From 048d38d18723eadace96d369fbb36f3c09225207 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 10 Jul 2022 03:10:01 +0200
Subject: [PATCH 0001/1398] interpolated mu i measures (yet to check )

I will replace ExactPredInexactConstructs with a geometry traits template next ISA
---
 .../interpolated_curvature_measures.h         | 88 +++++++++++++++++++
 .../Triangulation_2/triangulation_prog1.cpp   | 63 ++++++++-----
 2 files changed, 131 insertions(+), 20 deletions(-)
 create mode 100644 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_curvature_measures.h

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_curvature_measures.h
new file mode 100644
index 000000000000..e4f67d03e17a
--- /dev/null
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_curvature_measures.h
@@ -0,0 +1,88 @@
+#ifndef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CURVATURE_MEASURES_H
+#define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CURVATURE_MEASURES_H
+#endif
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <vector>
+#include <numeric>
+#include <CGAL/assertions.h>
+
+namespace CGAL {
+
+namespace Polygon_mesh_processing {
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic;
+
+// enum to specify which measure is computed
+enum MEASURE_INDEX {
+    MU0_AREA_MEASURE,
+    MU1_MEAN_CURVATURE_MEASURE,
+    MU2_GAUSSIAN_CURVATURE_MEASURE
+};
+
+Epic::FT interpolated_mu_i_triangle(const Epic::Vector_3 x0, const Epic::Vector_3 x1, const Epic::Vector_3 x2,
+    const Epic::Vector_3 u0, const Epic::Vector_3 u1, const Epic::Vector_3 u2, MEASURE_INDEX mu_i)
+{
+    Epic::Vector_3 um;
+    switch (mu_i)
+    {
+    case MU0_AREA_MEASURE:
+
+        um = (u0 + u1 + u2) / 3.0;
+        
+        return 0.5 * um * CGAL::cross_product(x1 - x0, x2 - x0);
+
+    case MU1_MEAN_CURVATURE_MEASURE:
+
+        um = (u0 + u1 + u2) / 3.0;
+        
+        return 0.5 * um * (CGAL::cross_product(u2 - u1, x0)
+                         + CGAL::cross_product(u0 - u2, x1)
+                         + CGAL::cross_product(u1 - u0, x2));
+
+    case MU2_GAUSSIAN_CURVATURE_MEASURE:
+
+        return 0.5 * u0 * CGAL::cross_product(u1, u2);
+
+    default: return 0;
+    }
+}
+
+Epic::FT interpolated_mu_i_face(std::vector<Epic::Vector_3>& x, std::vector<Epic::Vector_3>& u, MEASURE_INDEX mu_i)
+{
+    std::size_t n = x.size();
+    CGAL_precondition(u.size() == n);
+    CGAL_precondition(n >= 3);
+
+    if (n == 3)
+        return interpolated_mu_i_triangle(x[0], x[1], x[2],
+            u[0], u[1], u[2], mu_i);
+
+    /// If Quad measure formulas (Bilinear Interpolation) proved to be better,
+    /// they will be implemented and called here
+    //else if(n == 4)
+    //    return interpolated_mu0_quad(x[0], x[1], x[2], x[3]
+    //                                 u[0], u[1], u[2], u[3]);
+    else {
+        Epic::FT mu0 = 0;
+
+        // getting barycenter of points
+        Epic::Vector_3 xm = std::accumulate(x.begin(), x.end(), Epic::Vector_3(0, 0, 0));
+        xm /= n;
+
+        // getting unit average normal of points
+        Epic::Vector_3 um = std::accumulate(u.begin(), u.end(), Epic::Vector_3(0,0,0));
+        um /= sqrt(um * um);
+
+        // summing each triangle's measure after triangulation by barycenter split.
+        for (std::size_t i = 0; i < n; i++)
+        {
+            mu0 += interpolated_mu_i_triangle(x[i], x[(i + 1) % n], xm,
+                u[i], u[(i + 1) % n], um, mu_i);
+        }
+        return mu0;
+    }
+}
+
+}
+}
diff --git a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
index e68f7973163d..e52400cd5d0c 100644
--- a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
+++ b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
@@ -1,27 +1,50 @@
-#include <fstream>
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Triangulation_2.h>
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+#include <vector>
+#include <algorithm>
+#include <numeric>
+#include <CGAL/assertions.h>
+
+
+#include <CGAL/Polygon_mesh_processing/measure.h>
+#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_curvature_measures.h>
+#include <CGAL/Polyhedron_3.h>
+#include <CGAL/Surface_mesh.h>
+#include <chrono>
+
+#define N 4
+namespace PMP = CGAL::Polygon_mesh_processing;
 
-typedef CGAL::Triangulation_2<K>         Triangulation;
-typedef Triangulation::Vertex_circulator Vertex_circulator;
-typedef Triangulation::Point             Point;
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic;
 
-int main() {
-  std::ifstream in("data/triangulation_prog1.cin");
-  std::istream_iterator<Point> begin(in);
-  std::istream_iterator<Point> end;
+int main(int argc, char* argv[])
+{
+    srand(time(NULL));
 
-  Triangulation t;
-  t.insert(begin, end);
+    std::vector<Epic::Vector_3> X(N);
+    std::vector<Epic::Vector_3> U(N);
+
+    for (int i = 0; i < N; i++) {
+        X[i] = { rand() , rand() , rand() };
+        U[i] = { rand() , rand() , rand() };
+        U[i] = U[i] / sqrt(U[i] * U[i]);
+    }
+    std::cout << PMP::interpolated_mu_i_face(X, U, PMP::MU0_AREA_MEASURE) << std::endl;
+    std::cout << PMP::interpolated_mu_i_face(X, U, PMP::MU1_MEAN_CURVATURE_MEASURE) << std::endl;
+    std::cout << PMP::interpolated_mu_i_face(X, U, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE) << std::endl;
+
+    /*srand(time(NULL));
+    Epic::Vector_3 x, y;
+    Epic::FT d = 0;
+
+    Epic::Vector_3 z;
+    std::chrono::steady_clock::time_point begin = std::chrono::steady_clock::now();
+    for (int i = 0; i < N; i++)
+    {
+        x * y;
+    }
+    std::chrono::steady_clock::time_point end = std::chrono::steady_clock::now();
+    std::cout << std::chrono::duration_cast<std::chrono::microseconds>(end - begin).count() << std::endl;*/
 
-  Vertex_circulator vc = t.incident_vertices(t.infinite_vertex()),
-    done(vc);
-  if (vc != nullptr) {
-    do { std::cout << vc->point() << std::endl;
-    }while(++vc != done);
-  }
-  return 0;
 }
+

From e63de4f48ae1772992c4c64f158c8c353984e4b1 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 13 Jul 2022 07:59:21 +0200
Subject: [PATCH 0002/1398] implemented computing mu_i over all faces

it works fine, still need to handle if vnm is not given
---
 ...nterpolated_corrected_curvature_measures.h | 201 ++++++++++++++++++
 .../interpolated_curvature_measures.h         |  88 --------
 .../Triangulation_2/triangulation_prog1.cpp   |  76 ++++++-
 3 files changed, 267 insertions(+), 98 deletions(-)
 create mode 100644 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
 delete mode 100644 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_curvature_measures.h

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
new file mode 100644
index 000000000000..1ebf5fe4dfef
--- /dev/null
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -0,0 +1,201 @@
+#ifndef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
+#define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
+#endif
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <numeric>
+
+#include <CGAL/assertions.h>
+#include <CGAL/Named_function_parameters.h>
+#include <CGAL/Polygon_mesh_processing/internal/named_params_helper.h>
+#include <CGAL/Polygon_mesh_processing/compute_normal.h>
+#include <CGAL/property_map.h>
+
+
+namespace CGAL {
+
+    namespace Polygon_mesh_processing {
+
+        typedef Exact_predicates_inexact_constructions_kernel Epic;
+
+        // enum to specify which measure is computed
+        enum Measure_index {
+            MU0_AREA_MEASURE,
+            MU1_MEAN_CURVATURE_MEASURE,
+            MU2_GAUSSIAN_CURVATURE_MEASURE
+        };
+
+        Epic::FT interpolated_mu_i_triangle(const Epic::Vector_3 x0, const Epic::Vector_3 x1, const Epic::Vector_3 x2,
+            const Epic::Vector_3 u0, const Epic::Vector_3 u1, const Epic::Vector_3 u2, const Measure_index mu_i)
+        {
+            Epic::Vector_3 um;
+            switch (mu_i)
+            {
+            case MU0_AREA_MEASURE:
+
+                um = (u0 + u1 + u2) / 3.0;
+
+                return 0.5 * um * CGAL::cross_product(x1 - x0, x2 - x0);
+
+            case MU1_MEAN_CURVATURE_MEASURE:
+
+                um = (u0 + u1 + u2) / 3.0;
+
+                return 0.5 * um * (CGAL::cross_product(u2 - u1, x0)
+                    + CGAL::cross_product(u0 - u2, x1)
+                    + CGAL::cross_product(u1 - u0, x2));
+
+            case MU2_GAUSSIAN_CURVATURE_MEASURE:
+
+                return 0.5 * u0 * CGAL::cross_product(u1, u2);
+
+            default: return 0;
+            }
+        }
+
+        Epic::FT interpolated_mu_i_quad(const Epic::Vector_3 x0, const Epic::Vector_3 x1, const Epic::Vector_3 x2, const Epic::Vector_3 x3,
+            const Epic::Vector_3 u0, const Epic::Vector_3 u1, const Epic::Vector_3 u2, const Epic::Vector_3 u3, const Measure_index mu_i)
+        {
+            /// x0  _  x1
+            /// x2 |_| x3
+
+            switch (mu_i)
+            {
+            case MU0_AREA_MEASURE:
+
+                return (1 / 36.0) * ((4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(x1 - x0, x2 - x0)
+                    + (2 * u0 + 4 * u1 + u2 + 2 * u3) * CGAL::cross_product(x1 - x0, x3 - x1)
+                    + (2 * u0 + u1 + 4 * u2 + 2 * u3) * CGAL::cross_product(x3 - x2, x2 - x0)
+                    + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(x3 - x2, x3 - x1));
+
+            case MU1_MEAN_CURVATURE_MEASURE:
+            {
+                const Epic::Vector_3 u03 = u3 - u0;
+                const Epic::Vector_3 u12 = u2 - u1;
+                const Epic::Vector_3 x0_cross = CGAL::cross_product(u12, x0);
+                const Epic::Vector_3 x1_cross = -CGAL::cross_product(u03, x1);
+                const Epic::Vector_3 x2_cross = CGAL::cross_product(u03, x2);
+                const Epic::Vector_3 x3_cross = -CGAL::cross_product(u12, x3);
+
+
+                return (1 / 12.0) * (u0 * (2 * x0_cross - CGAL::cross_product((u2 + u3), x1) + CGAL::cross_product((u1 + u3), x2) + x3_cross)
+                    + u1 * (CGAL::cross_product((u2 + u3), x0) + 2 * x1_cross + x2_cross - CGAL::cross_product((u0 + u2), x3))
+                    + u2 * (CGAL::cross_product(-(u1 + u3), x0) + x1_cross + 2 * x2_cross + CGAL::cross_product((u0 + u1), x3))
+                    + u3 * (x0_cross + CGAL::cross_product((u0 + u2), x1) - CGAL::cross_product((u0 + u1), x2) + 2 * x3_cross));
+            }
+            case MU2_GAUSSIAN_CURVATURE_MEASURE:
+
+                return (1 / 36.0) * ((4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(u1 - u0, u2 - u0)
+                    + (2 * u0 + 4 * u1 + u2 + 2 * u3) * CGAL::cross_product(u1 - u0, u3 - u1)
+                    + (2 * u0 + u1 + 4 * u2 + 2 * u3) * CGAL::cross_product(u3 - u2, u2 - u0)
+                    + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(u3 - u2, u3 - u1));
+
+            default: return 0;
+            }
+        }
+
+        Epic::FT interpolated_mu_i_face(const std::vector<Epic::Vector_3>& x, const std::vector<Epic::Vector_3>& u, const Measure_index mu_i)
+        {
+            std::size_t n = x.size();
+            CGAL_precondition(u.size() == n);
+            CGAL_precondition(n >= 3);
+
+            // Triangle: use triangle formulas
+            if (n == 3)
+                return interpolated_mu_i_triangle(x[0], x[1], x[2],
+                    u[0], u[1], u[2], mu_i);
+
+            // Quad: use bilinear interpolation formulas
+            else if (n == 4)
+                /// x[0]  _  x[1]  --->  x0  _  x1   (reason for changing order)
+                /// x[3] |_| x[2]  --->  x2 |_| x3
+                return interpolated_mu_i_quad(x[0], x[1], x[3], x[2],
+                    u[0], u[1], u[3], u[2], mu_i);
+
+            // N-gon: split into n triangles by barycenter and use triangle formulas for each
+            else {
+                Epic::FT mu0 = 0;
+
+                // getting barycenter of points
+                Epic::Vector_3 xm = std::accumulate(x.begin(), x.end(), Epic::Vector_3(0, 0, 0));
+                xm /= n;
+
+                // getting unit average normal of points
+                Epic::Vector_3 um = std::accumulate(u.begin(), u.end(), Epic::Vector_3(0, 0, 0));
+                um /= sqrt(um * um);
+
+                // summing each triangle's measure after triangulation by barycenter split.
+                for (std::size_t i = 0; i < n; i++)
+                {
+                    mu0 += interpolated_mu_i_triangle(x[i], x[(i + 1) % n], xm,
+                        u[i], u[(i + 1) % n], um, mu_i);
+                }
+                return mu0;
+            }
+        }
+
+        
+        /// TODO:
+        /// 1- Handle if VNM is not given
+        /// 2- use GT instead of Epic
+
+        template<typename PolygonMesh,
+            typename VertexNormalMap,
+            typename NamedParameters = parameters::Default_named_parameters>
+            std::vector<Epic::FT>
+            interpolated_corrected_measure_i(
+                const PolygonMesh& pmesh,
+                const Measure_index mu_i,
+                VertexNormalMap vnm,
+                const NamedParameters& np = parameters::default_values())
+        {
+            using parameters::choose_parameter;
+            using parameters::get_parameter;
+
+            typedef boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+            typedef boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+            typedef boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
+
+            typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
+                vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+                    get_const_property_map(CGAL::vertex_point, pmesh));
+
+            //std::unordered_map<vertex_descriptor, Epic::Vector_3> vnm_init;
+
+            //boost::associative_property_map
+            //    <std::unordered_map<boost::graph_traits<PolygonMesh>::vertex_descriptor, Epic::Vector_3>> vnm(vnm_init);
+
+            ////if (!vnm)
+            // {
+            //    compute_vertex_normals(pmesh, vnm, np);
+            //}
+
+            std::vector<Epic::FT> mu_i_map;
+
+
+            for (face_descriptor f : faces(pmesh))
+            {
+                halfedge_descriptor h_start = pmesh.halfedge(f);
+                halfedge_descriptor h_iter = h_start;
+
+                std::vector<Epic::Vector_3> x;
+                std::vector<Epic::Vector_3> u;
+
+                // looping over vertices in face
+                do {
+                    vertex_descriptor v = source(h_iter, pmesh);
+                    Epic::Point_3 p = get(vpm, v);
+                    x.push_back(Epic::Vector_3(p.x(),p.y(),p.z()));
+                    u.push_back(get(vnm, v));
+                    h_iter = next(h_iter, pmesh);
+                } while (h_iter != h_start);
+
+
+                mu_i_map.push_back(interpolated_mu_i_face(x, u, mu_i));
+            }
+            return mu_i_map;
+        }
+
+    }
+}
+
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_curvature_measures.h
deleted file mode 100644
index e4f67d03e17a..000000000000
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_curvature_measures.h
+++ /dev/null
@@ -1,88 +0,0 @@
-#ifndef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CURVATURE_MEASURES_H
-#define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CURVATURE_MEASURES_H
-#endif
-
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <vector>
-#include <numeric>
-#include <CGAL/assertions.h>
-
-namespace CGAL {
-
-namespace Polygon_mesh_processing {
-
-typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic;
-
-// enum to specify which measure is computed
-enum MEASURE_INDEX {
-    MU0_AREA_MEASURE,
-    MU1_MEAN_CURVATURE_MEASURE,
-    MU2_GAUSSIAN_CURVATURE_MEASURE
-};
-
-Epic::FT interpolated_mu_i_triangle(const Epic::Vector_3 x0, const Epic::Vector_3 x1, const Epic::Vector_3 x2,
-    const Epic::Vector_3 u0, const Epic::Vector_3 u1, const Epic::Vector_3 u2, MEASURE_INDEX mu_i)
-{
-    Epic::Vector_3 um;
-    switch (mu_i)
-    {
-    case MU0_AREA_MEASURE:
-
-        um = (u0 + u1 + u2) / 3.0;
-        
-        return 0.5 * um * CGAL::cross_product(x1 - x0, x2 - x0);
-
-    case MU1_MEAN_CURVATURE_MEASURE:
-
-        um = (u0 + u1 + u2) / 3.0;
-        
-        return 0.5 * um * (CGAL::cross_product(u2 - u1, x0)
-                         + CGAL::cross_product(u0 - u2, x1)
-                         + CGAL::cross_product(u1 - u0, x2));
-
-    case MU2_GAUSSIAN_CURVATURE_MEASURE:
-
-        return 0.5 * u0 * CGAL::cross_product(u1, u2);
-
-    default: return 0;
-    }
-}
-
-Epic::FT interpolated_mu_i_face(std::vector<Epic::Vector_3>& x, std::vector<Epic::Vector_3>& u, MEASURE_INDEX mu_i)
-{
-    std::size_t n = x.size();
-    CGAL_precondition(u.size() == n);
-    CGAL_precondition(n >= 3);
-
-    if (n == 3)
-        return interpolated_mu_i_triangle(x[0], x[1], x[2],
-            u[0], u[1], u[2], mu_i);
-
-    /// If Quad measure formulas (Bilinear Interpolation) proved to be better,
-    /// they will be implemented and called here
-    //else if(n == 4)
-    //    return interpolated_mu0_quad(x[0], x[1], x[2], x[3]
-    //                                 u[0], u[1], u[2], u[3]);
-    else {
-        Epic::FT mu0 = 0;
-
-        // getting barycenter of points
-        Epic::Vector_3 xm = std::accumulate(x.begin(), x.end(), Epic::Vector_3(0, 0, 0));
-        xm /= n;
-
-        // getting unit average normal of points
-        Epic::Vector_3 um = std::accumulate(u.begin(), u.end(), Epic::Vector_3(0,0,0));
-        um /= sqrt(um * um);
-
-        // summing each triangle's measure after triangulation by barycenter split.
-        for (std::size_t i = 0; i < n; i++)
-        {
-            mu0 += interpolated_mu_i_triangle(x[i], x[(i + 1) % n], xm,
-                u[i], u[(i + 1) % n], um, mu_i);
-        }
-        return mu0;
-    }
-}
-
-}
-}
diff --git a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
index e52400cd5d0c..2e625d722cc1 100644
--- a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
+++ b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
@@ -1,25 +1,79 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <iostream>
+#include <unordered_map>
+#include <CGAL/property_map.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 
-#include <vector>
-#include <algorithm>
-#include <numeric>
-#include <CGAL/assertions.h>
+#include <boost/graph/graph_traits.hpp>
 
-
-#include <CGAL/Polygon_mesh_processing/measure.h>
-#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/compute_normal.h>
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/Surface_mesh.h>
 #include <chrono>
+#include <CGAL/Surface_mesh/IO/OFF.h>
 
-#define N 4
 namespace PMP = CGAL::Polygon_mesh_processing;
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic;
+typedef CGAL::Polyhedron_3<Epic> Polyhedron;
+typedef CGAL::Surface_mesh<Epic::Point_3> Mesh;
+typedef boost::graph_traits<Mesh>::face_descriptor face_descriptor;
+typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
+
+
 
 int main(int argc, char* argv[])
 {
-    srand(time(NULL));
+    Mesh g1;
+    if (!PMP::IO::read_polygon_mesh("small_bunny.obj", g1) || !CGAL::is_triangle_mesh(g1))
+    {
+        std::cerr << "Invalid input." << std::endl;
+        return 1;
+    }
+
+    //int n1 = g1.size_of_facets();
+
+    std::unordered_map<vertex_descriptor, Epic::Vector_3> vnm_vec;
+    boost::associative_property_map< std::unordered_map<vertex_descriptor, Epic::Vector_3>> vnm(vnm_vec);
+
+    PMP::compute_vertex_normals(g1, vnm);
+
+    
+
+    std::vector<Epic::FT> mu0_map, mu1_map, mu2_map;
+    
+    mu0_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU0_AREA_MEASURE, vnm);
+    mu1_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU1_MEAN_CURVATURE_MEASURE, vnm);
+    mu2_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE, vnm);
+
+    int n = g1.faces().size();
+
+    for (int i = 0; i < n; i++)
+    {
+        std::cout << mu0_map[i] << "\n";
+    }
+
+    std::cout << "\n";
+
+    for (int i = 0; i < n; i++)
+    {
+        std::cout << mu1_map[i]  << "\n";
+    }
+
+    std::cout <<  "\n";
+
+    for (int i = 0; i < n; i++)
+    {
+        std::cout << mu2_map[i] << "\n";
+    }
+
+
+    
+
+    /*srand(time(NULL));
+
+    CGAL::GetGeomTraits<Polyhedron> GT;
 
     std::vector<Epic::Vector_3> X(N);
     std::vector<Epic::Vector_3> U(N);
@@ -29,9 +83,11 @@ int main(int argc, char* argv[])
         U[i] = { rand() , rand() , rand() };
         U[i] = U[i] / sqrt(U[i] * U[i]);
     }
+    
+
     std::cout << PMP::interpolated_mu_i_face(X, U, PMP::MU0_AREA_MEASURE) << std::endl;
     std::cout << PMP::interpolated_mu_i_face(X, U, PMP::MU1_MEAN_CURVATURE_MEASURE) << std::endl;
-    std::cout << PMP::interpolated_mu_i_face(X, U, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE) << std::endl;
+    std::cout << PMP::interpolated_mu_i_face(X, U, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE) << std::endl;*/
 
     /*srand(time(NULL));
     Epic::Vector_3 x, y;

From 2eeb88ac96cb49755b487cb01a1bfc3fc8f0f1fb Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 15 Jul 2022 13:18:56 +0200
Subject: [PATCH 0003/1398] moved my main program to a new example file in PMP

---
 .../Polygon_mesh_processing/CMakeLists.txt    |  12 +-
 .../interpolated_corrected_curvatures.cpp     |  75 +++++++++++
 .../Triangulation_2/triangulation_prog1.cpp   | 120 +++---------------
 3 files changed, 106 insertions(+), 101 deletions(-)
 create mode 100644 Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index baa4d41677ac..d6f4e273516f 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -5,11 +5,13 @@ cmake_minimum_required(VERSION 3.1...3.23)
 project(Polygon_mesh_processing_Examples)
 
 # CGAL and its components
-find_package(CGAL REQUIRED)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
 
 # Boost and its components
 find_package(Boost REQUIRED)
 
+
+
 if(NOT Boost_FOUND)
 
   message(
@@ -100,6 +102,14 @@ create_single_source_cgal_program("orientation_pipeline_example.cpp")
 #create_single_source_cgal_program( "snapping_example.cpp")
 create_single_source_cgal_program("match_faces.cpp")
 create_single_source_cgal_program("cc_compatible_orientations.cpp")
+create_single_source_cgal_program("interpolated_corrected_curvatures.cpp")
+
+if(CGAL_Qt5_FOUND)
+
+  #link it with the required CGAL libraries
+  target_link_libraries(interpolated_corrected_curvatures PUBLIC CGAL::CGAL_Basic_viewer)
+
+endif()
 
 if(OpenMesh_FOUND)
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
new file mode 100644
index 000000000000..f45bec68a03b
--- /dev/null
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -0,0 +1,75 @@
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <iostream>
+#include <unordered_map>
+#include <CGAL/property_map.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <fstream>
+
+#include <boost/graph/graph_traits.hpp>
+
+#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/compute_normal.h>
+#include <CGAL/Polyhedron_3.h>
+#include <CGAL/Surface_mesh.h>
+#include <chrono>
+#include <CGAL/Surface_mesh/IO/OFF.h>
+#include <CGAL/draw_surface_mesh.h>
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic;
+typedef CGAL::Polyhedron_3<Epic> Polyhedron;
+typedef CGAL::Surface_mesh<Epic::Point_3> Mesh;
+typedef boost::graph_traits<Mesh>::face_descriptor face_descriptor;
+typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
+
+
+int main(int argc, char* argv[])
+{
+  const std::string filename = (argc>1) ? argv[1] : CGAL::data_file_path("small_bunny.obj");
+
+  Mesh g1;
+  if(!CGAL::IO::read_polygon_mesh(filename, g1))
+  {
+    std::cerr << "Invalid input file." << std::endl;
+    return EXIT_FAILURE;
+  }
+  std::unordered_map<vertex_descriptor, Epic::Vector_3> vnm_vec;
+  boost::associative_property_map< std::unordered_map<vertex_descriptor, Epic::Vector_3>> vnm(vnm_vec);
+
+  PMP::compute_vertex_normals(g1, vnm);
+
+
+  std::vector<Epic::FT> mu0_map, mu1_map, mu2_map;
+
+  mu0_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU0_AREA_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
+  mu1_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU1_MEAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
+  mu2_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
+
+  int n = g1.faces().size();
+
+  for (int i = 0; i < n; i++)
+  {
+      std::cout << mu0_map[i] << "\n";
+  }
+
+  std::cout << "\n";
+
+  for (int i = 0; i < n; i++)
+  {
+      std::cout << mu1_map[i] << "\n";
+  }
+
+  std::cout << "\n";
+
+  for (int i = 0; i < n; i++)
+  {
+      std::cout << mu2_map[i] << "\n";
+  }
+
+
+  CGAL::draw(g1);
+
+  return EXIT_SUCCESS;
+}
diff --git a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
index 2e625d722cc1..86b2c23cb481 100644
--- a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
+++ b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
@@ -1,106 +1,26 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <iostream>
-#include <unordered_map>
-#include <CGAL/property_map.h>
-#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
-
-#include <boost/graph/graph_traits.hpp>
-
-#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
-#include <CGAL/Polygon_mesh_processing/compute_normal.h>
-#include <CGAL/Polyhedron_3.h>
-#include <CGAL/Surface_mesh.h>
-#include <chrono>
-#include <CGAL/Surface_mesh/IO/OFF.h>
-
-namespace PMP = CGAL::Polygon_mesh_processing;
-
-typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic;
-typedef CGAL::Polyhedron_3<Epic> Polyhedron;
-typedef CGAL::Surface_mesh<Epic::Point_3> Mesh;
-typedef boost::graph_traits<Mesh>::face_descriptor face_descriptor;
-typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
-
-
-
-int main(int argc, char* argv[])
-{
-    Mesh g1;
-    if (!PMP::IO::read_polygon_mesh("small_bunny.obj", g1) || !CGAL::is_triangle_mesh(g1))
-    {
-        std::cerr << "Invalid input." << std::endl;
-        return 1;
-    }
-
-    //int n1 = g1.size_of_facets();
-
-    std::unordered_map<vertex_descriptor, Epic::Vector_3> vnm_vec;
-    boost::associative_property_map< std::unordered_map<vertex_descriptor, Epic::Vector_3>> vnm(vnm_vec);
-
-    PMP::compute_vertex_normals(g1, vnm);
-
-    
-
-    std::vector<Epic::FT> mu0_map, mu1_map, mu2_map;
-    
-    mu0_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU0_AREA_MEASURE, vnm);
-    mu1_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU1_MEAN_CURVATURE_MEASURE, vnm);
-    mu2_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE, vnm);
+#include <fstream>
 
-    int n = g1.faces().size();
-
-    for (int i = 0; i < n; i++)
-    {
-        std::cout << mu0_map[i] << "\n";
-    }
-
-    std::cout << "\n";
-
-    for (int i = 0; i < n; i++)
-    {
-        std::cout << mu1_map[i]  << "\n";
-    }
-
-    std::cout <<  "\n";
-
-    for (int i = 0; i < n; i++)
-    {
-        std::cout << mu2_map[i] << "\n";
-    }
-
-
-    
-
-    /*srand(time(NULL));
-
-    CGAL::GetGeomTraits<Polyhedron> GT;
-
-    std::vector<Epic::Vector_3> X(N);
-    std::vector<Epic::Vector_3> U(N);
-
-    for (int i = 0; i < N; i++) {
-        X[i] = { rand() , rand() , rand() };
-        U[i] = { rand() , rand() , rand() };
-        U[i] = U[i] / sqrt(U[i] * U[i]);
-    }
-    
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Triangulation_2.h>
 
-    std::cout << PMP::interpolated_mu_i_face(X, U, PMP::MU0_AREA_MEASURE) << std::endl;
-    std::cout << PMP::interpolated_mu_i_face(X, U, PMP::MU1_MEAN_CURVATURE_MEASURE) << std::endl;
-    std::cout << PMP::interpolated_mu_i_face(X, U, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE) << std::endl;*/
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
 
-    /*srand(time(NULL));
-    Epic::Vector_3 x, y;
-    Epic::FT d = 0;
+typedef CGAL::Triangulation_2<K>         Triangulation;
+typedef Triangulation::Vertex_circulator Vertex_circulator;
+typedef Triangulation::Point             Point;
 
-    Epic::Vector_3 z;
-    std::chrono::steady_clock::time_point begin = std::chrono::steady_clock::now();
-    for (int i = 0; i < N; i++)
-    {
-        x * y;
-    }
-    std::chrono::steady_clock::time_point end = std::chrono::steady_clock::now();
-    std::cout << std::chrono::duration_cast<std::chrono::microseconds>(end - begin).count() << std::endl;*/
+int main() {
+  std::ifstream in("data/triangulation_prog1.cin");
+  std::istream_iterator<Point> begin(in);
+  std::istream_iterator<Point> end;
 
-}
+  Triangulation t;
+  t.insert(begin, end);
 
+  Vertex_circulator vc = t.incident_vertices(t.infinite_vertex()),
+    done(vc);
+  if (vc != nullptr) {
+    do { std::cout << vc->point() << std::endl;
+    }while(++vc != done);
+  }
+  return 0;
\ No newline at end of file

From 5af7795d9450ed2ff27e954b23cf65cfb3524cf5 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 15 Jul 2022 16:47:44 +0200
Subject: [PATCH 0004/1398] typo fix

---
 .../examples/Triangulation_2/triangulation_prog1.cpp           | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
index 86b2c23cb481..b212837b4ee2 100644
--- a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
+++ b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
@@ -23,4 +23,5 @@ int main() {
     do { std::cout << vc->point() << std::endl;
     }while(++vc != done);
   }
-  return 0;
\ No newline at end of file
+  return 0;
+}
\ No newline at end of file

From 8c943fd433b4d3ce1390aa4802847a6a851d584c Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 15 Jul 2022 17:23:13 +0200
Subject: [PATCH 0005/1398] typo fix

---
 .../examples/Triangulation_2/triangulation_prog1.cpp            | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
index b212837b4ee2..e68f7973163d 100644
--- a/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
+++ b/Triangulation_2/examples/Triangulation_2/triangulation_prog1.cpp
@@ -24,4 +24,4 @@ int main() {
     }while(++vc != done);
   }
   return 0;
-}
\ No newline at end of file
+}

From 4b0577a2cff9d47e99577701eae6c3e085cc14c4 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 17 Jul 2022 18:46:04 +0200
Subject: [PATCH 0006/1398] added doc (yet to build), used generic GT instead
 of Epic, made VNM a named parameter (WIP)

---
 .../PackageDescription.txt                    |   4 +
 .../doc/Polygon_mesh_processing/examples.txt  |   1 +
 .../interpolated_corrected_curvatures.cpp     |   6 +-
 ...nterpolated_corrected_curvature_measures.h | 422 +++++++++++-------
 4 files changed, 271 insertions(+), 162 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 34d2f83f08e2..9f6d7ffd4736 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -16,6 +16,10 @@
 /// Functions to triangulate faces, and to refine and fair regions of a polygon mesh.
 /// \ingroup PkgPolygonMeshProcessingRef
 
+/// \defgroup PMP_corrected_curvatures_grp Corrected Curvature Computation 
+/// Functions to compute the corrected curvatures of a polygon mesh.
+/// \ingroup PkgPolygonMeshProcessingRef
+
 /// \defgroup PMP_normal_grp Normal Computation
 /// Functions to compute unit normals for individual/all vertices or faces.
 /// \ingroup PkgPolygonMeshProcessingRef
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
index 3ce5384c81ce..0317812aa443 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
@@ -19,6 +19,7 @@
 \example Polygon_mesh_processing/refine_fair_example.cpp
 \example Polygon_mesh_processing/mesh_slicer_example.cpp
 \example Polygon_mesh_processing/isotropic_remeshing_example.cpp
+\example Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
 \example Polygon_mesh_processing/delaunay_remeshing_example.cpp
 \example Polygon_mesh_processing/compute_normals_example_Polyhedron.cpp
 \example Polygon_mesh_processing/hausdorff_distance_remeshing_example.cpp
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index f45bec68a03b..c117e3f817fe 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -43,9 +43,9 @@ int main(int argc, char* argv[])
 
   std::vector<Epic::FT> mu0_map, mu1_map, mu2_map;
 
-  mu0_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU0_AREA_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
-  mu1_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU1_MEAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
-  mu2_map = PMP::interpolated_corrected_measure_i(g1, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
+  mu0_map = PMP::interpolated_corrected_measure_mesh(g1, PMP::MU0_AREA_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
+  mu1_map = PMP::interpolated_corrected_measure_mesh(g1, PMP::MU1_MEAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
+  mu2_map = PMP::interpolated_corrected_measure_mesh(g1, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
 
   int n = g1.faces().size();
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 1ebf5fe4dfef..df5197b2f005 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -2,7 +2,6 @@
 #define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
 #endif
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <numeric>
 
 #include <CGAL/assertions.h>
@@ -14,188 +13,293 @@
 
 namespace CGAL {
 
-    namespace Polygon_mesh_processing {
-
-        typedef Exact_predicates_inexact_constructions_kernel Epic;
-
-        // enum to specify which measure is computed
-        enum Measure_index {
-            MU0_AREA_MEASURE,
-            MU1_MEAN_CURVATURE_MEASURE,
-            MU2_GAUSSIAN_CURVATURE_MEASURE
-        };
-
-        Epic::FT interpolated_mu_i_triangle(const Epic::Vector_3 x0, const Epic::Vector_3 x1, const Epic::Vector_3 x2,
-            const Epic::Vector_3 u0, const Epic::Vector_3 u1, const Epic::Vector_3 u2, const Measure_index mu_i)
-        {
-            Epic::Vector_3 um;
-            switch (mu_i)
-            {
-            case MU0_AREA_MEASURE:
-
-                um = (u0 + u1 + u2) / 3.0;
+namespace Polygon_mesh_processing {
+
+// enum to specify which measure is computed
+enum Measure_index {
+    MU0_AREA_MEASURE,
+    MU1_MEAN_CURVATURE_MEASURE,
+    MU2_GAUSSIAN_CURVATURE_MEASURE
+};
+
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* computes the interpolated corrected measure of specific triangle.
+*
+* @tparam GT is the geometric traits class.
+*
+* @param x0 is the position of vertex #0.
+* @param x1 is the position of vertex #1.
+* @param x2 is the position of vertex #2.
+* @param u0 is the normal vector of vertex #0.
+* @param u1 is the normal vector of vertex #1.
+* @param u2 is the normal vector of vertex #2.
+* @param mu_i an enum for choosing between computing the area measure,
+* the mean curvature measure, or the gaussian curvature measure.
+*
+* @return a scalar of type GT::FT. This is the value of the interpolated corrected measure of the given triangle.
+*
+* @see `interpolated_corrected_measure_face()`
+* @see `interpolated_corrected_measure_quad()`
+*/
+template<typename GT>
+typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vector_3 x0, const typename GT::Vector_3 x1, const typename GT::Vector_3 x2,
+    const typename GT::Vector_3 u0, const typename GT::Vector_3 u1, const typename GT::Vector_3 u2, const Measure_index mu_i)
+{
+    switch (mu_i)
+    {
+    case MU0_AREA_MEASURE:
+    {
+        const typename GT::Vector_3 um = (u0 + u1 + u2) / 3.0;
+
+        return 0.5 * um * CGAL::cross_product(x1 - x0, x2 - x0);
+    }
+    case MU1_MEAN_CURVATURE_MEASURE:
+    {
+        const typename GT::Vector_3 um = (u0 + u1 + u2) / 3.0;
 
-                return 0.5 * um * CGAL::cross_product(x1 - x0, x2 - x0);
+        return 0.5 * um * (CGAL::cross_product(u2 - u1, x0)
+            + CGAL::cross_product(u0 - u2, x1)
+            + CGAL::cross_product(u1 - u0, x2));
+    }
+    case MU2_GAUSSIAN_CURVATURE_MEASURE:
 
-            case MU1_MEAN_CURVATURE_MEASURE:
+        return 0.5 * u0 * CGAL::cross_product(u1, u2);
 
-                um = (u0 + u1 + u2) / 3.0;
+    default: return 0;
+    }
+}
 
-                return 0.5 * um * (CGAL::cross_product(u2 - u1, x0)
-                    + CGAL::cross_product(u0 - u2, x1)
-                    + CGAL::cross_product(u1 - u0, x2));
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* computes the interpolated corrected measure of specific quad
+* Note that the vertices 0 to 3 are ordered like this \n
+* v0  _  v1 \n
+* v2 |_| v3
+*
+* @tparam GT is the geometric traits class.
+*
+* @param x0 is the position of vertex #0.
+* @param x1 is the position of vertex #1.
+* @param x2 is the position of vertex #2.
+* @param x3 is the position of vertex #3.
+* @param u0 is the normal vector of vertex #0.
+* @param u1 is the normal vector of vertex #1.
+* @param u2 is the normal vector of vertex #2.
+* @param u3 is the normal vector of vertex #3.
+* @param mu_i an enum for choosing between computing the area measure,
+* the mean curvature measure, or the gaussian curvature measure.
+*
+* @return a scalar of type GT::FT. This is the value of the interpolated corrected measure of the given triangle.
+*
+* @see `interpolated_corrected_measure_face()`
+* @see `interpolated_corrected_measure_quad()`
+*/
+template<typename GT>
+typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3 x0, const typename GT::Vector_3 x1, const typename GT::Vector_3 x2, const typename GT::Vector_3 x3,
+    const typename GT::Vector_3 u0, const typename GT::Vector_3 u1, const typename GT::Vector_3 u2, const typename GT::Vector_3 u3, const Measure_index mu_i)
+{
+    /// x0  _  x1
+    /// x2 |_| x3
+
+    switch (mu_i)
+    {
+    case MU0_AREA_MEASURE:
+
+        return (1 / 36.0) * ((4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(x1 - x0, x2 - x0)
+            + (2 * u0 + 4 * u1 + u2 + 2 * u3) * CGAL::cross_product(x1 - x0, x3 - x1)
+            + (2 * u0 + u1 + 4 * u2 + 2 * u3) * CGAL::cross_product(x3 - x2, x2 - x0)
+            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(x3 - x2, x3 - x1));
+
+    case MU1_MEAN_CURVATURE_MEASURE:
+    {
+        const typename GT::Vector_3 u03 = u3 - u0;
+        const typename GT::Vector_3 u12 = u2 - u1;
+        const typename GT::Vector_3 x0_cross = CGAL::cross_product(u12, x0);
+        const typename GT::Vector_3 x1_cross = -CGAL::cross_product(u03, x1);
+        const typename GT::Vector_3 x2_cross = CGAL::cross_product(u03, x2);
+        const typename GT::Vector_3 x3_cross = -CGAL::cross_product(u12, x3);
+
+
+        return (1 / 12.0) * (u0 * (2 * x0_cross - CGAL::cross_product((u2 + u3), x1) + CGAL::cross_product((u1 + u3), x2) + x3_cross)
+            + u1 * (CGAL::cross_product((u2 + u3), x0) + 2 * x1_cross + x2_cross - CGAL::cross_product((u0 + u2), x3))
+            + u2 * (CGAL::cross_product(-(u1 + u3), x0) + x1_cross + 2 * x2_cross + CGAL::cross_product((u0 + u1), x3))
+            + u3 * (x0_cross + CGAL::cross_product((u0 + u2), x1) - CGAL::cross_product((u0 + u1), x2) + 2 * x3_cross));
+    }
+    case MU2_GAUSSIAN_CURVATURE_MEASURE:
 
-            case MU2_GAUSSIAN_CURVATURE_MEASURE:
+        return (1 / 36.0) * ((4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(u1 - u0, u2 - u0)
+            + (2 * u0 + 4 * u1 + u2 + 2 * u3) * CGAL::cross_product(u1 - u0, u3 - u1)
+            + (2 * u0 + u1 + 4 * u2 + 2 * u3) * CGAL::cross_product(u3 - u2, u2 - u0)
+            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(u3 - u2, u3 - u1));
 
-                return 0.5 * u0 * CGAL::cross_product(u1, u2);
+    default: return 0;
+    }
+}
 
-            default: return 0;
-            }
-        }
 
-        Epic::FT interpolated_mu_i_quad(const Epic::Vector_3 x0, const Epic::Vector_3 x1, const Epic::Vector_3 x2, const Epic::Vector_3 x3,
-            const Epic::Vector_3 u0, const Epic::Vector_3 u1, const Epic::Vector_3 u2, const Epic::Vector_3 u3, const Measure_index mu_i)
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* computes the interpolated corrected measure of specific face.
+*
+* @tparam GT is the geometric traits class.
+*
+* @param x is a vector of the vertex positions of the face.
+* @param u is a vector of the vertex nomrals of the face.
+* @param mu_i an enum for choosing between computing the area measure,
+* the mean curvature measure, or the gaussian curvature measure.
+*
+* @return a scalar of type GT::FT. This is the value of the interpolated corrected measure of the given face.
+*
+* @see `interpolated_corrected_measure_triangle()`
+* @see `interpolated_corrected_measure_quad()`
+* @see `interpolated_corrected_measure_mesh()`
+*/
+template<typename GT>
+typename GT::FT interpolated_corrected_measure_face(const std::vector<typename GT::Vector_3>& x, const std::vector<typename GT::Vector_3>& u, const Measure_index mu_i)
+{
+    std::size_t n = x.size();
+    CGAL_precondition(u.size() == n);
+    CGAL_precondition(n >= 3);
+
+    // Triangle: use triangle formulas
+    if (n == 3)
+        return interpolated_corrected_measure_triangle<GT>(x[0], x[1], x[2],
+            u[0], u[1], u[2], mu_i);
+
+    // Quad: use bilinear interpolation formulas
+    else if (n == 4)
+        /// x[0]  _  x[1]  --->  x0  _  x1   (reason for changing order)
+        /// x[3] |_| x[2]  --->  x2 |_| x3
+        return interpolated_corrected_measure_quad<GT>(x[0], x[1], x[3], x[2],
+            u[0], u[1], u[3], u[2], mu_i);
+
+    // N-gon: split into n triangles by barycenter and use triangle formulas for each
+    else {
+        typename GT::FT mu0 = 0;
+
+        // getting barycenter of points
+        typename GT::Vector_3 xm = std::accumulate(x.begin(), x.end(), GT::Vector_3(0, 0, 0));
+        xm /= n;
+
+        // getting unit average normal of points
+        typename GT::Vector_3 um = std::accumulate(u.begin(), u.end(), GT::Vector_3(0, 0, 0));
+        um /= sqrt(um * um);
+
+        // summing each triangle's measure after triangulation by barycenter split.
+        for (std::size_t i = 0; i < n; i++)
         {
-            /// x0  _  x1
-            /// x2 |_| x3
-
-            switch (mu_i)
-            {
-            case MU0_AREA_MEASURE:
-
-                return (1 / 36.0) * ((4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(x1 - x0, x2 - x0)
-                    + (2 * u0 + 4 * u1 + u2 + 2 * u3) * CGAL::cross_product(x1 - x0, x3 - x1)
-                    + (2 * u0 + u1 + 4 * u2 + 2 * u3) * CGAL::cross_product(x3 - x2, x2 - x0)
-                    + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(x3 - x2, x3 - x1));
-
-            case MU1_MEAN_CURVATURE_MEASURE:
-            {
-                const Epic::Vector_3 u03 = u3 - u0;
-                const Epic::Vector_3 u12 = u2 - u1;
-                const Epic::Vector_3 x0_cross = CGAL::cross_product(u12, x0);
-                const Epic::Vector_3 x1_cross = -CGAL::cross_product(u03, x1);
-                const Epic::Vector_3 x2_cross = CGAL::cross_product(u03, x2);
-                const Epic::Vector_3 x3_cross = -CGAL::cross_product(u12, x3);
-
-
-                return (1 / 12.0) * (u0 * (2 * x0_cross - CGAL::cross_product((u2 + u3), x1) + CGAL::cross_product((u1 + u3), x2) + x3_cross)
-                    + u1 * (CGAL::cross_product((u2 + u3), x0) + 2 * x1_cross + x2_cross - CGAL::cross_product((u0 + u2), x3))
-                    + u2 * (CGAL::cross_product(-(u1 + u3), x0) + x1_cross + 2 * x2_cross + CGAL::cross_product((u0 + u1), x3))
-                    + u3 * (x0_cross + CGAL::cross_product((u0 + u2), x1) - CGAL::cross_product((u0 + u1), x2) + 2 * x3_cross));
-            }
-            case MU2_GAUSSIAN_CURVATURE_MEASURE:
-
-                return (1 / 36.0) * ((4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(u1 - u0, u2 - u0)
-                    + (2 * u0 + 4 * u1 + u2 + 2 * u3) * CGAL::cross_product(u1 - u0, u3 - u1)
-                    + (2 * u0 + u1 + 4 * u2 + 2 * u3) * CGAL::cross_product(u3 - u2, u2 - u0)
-                    + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(u3 - u2, u3 - u1));
-
-            default: return 0;
-            }
+            mu0 += interpolated_corrected_measure_triangle<GT>(x[i], x[(i + 1) % n], xm,
+                u[i], u[(i + 1) % n], um, mu_i);
         }
+        return mu0;
+    }
+}
 
-        Epic::FT interpolated_mu_i_face(const std::vector<Epic::Vector_3>& x, const std::vector<Epic::Vector_3>& u, const Measure_index mu_i)
-        {
-            std::size_t n = x.size();
-            CGAL_precondition(u.size() == n);
-            CGAL_precondition(n >= 3);
-
-            // Triangle: use triangle formulas
-            if (n == 3)
-                return interpolated_mu_i_triangle(x[0], x[1], x[2],
-                    u[0], u[1], u[2], mu_i);
-
-            // Quad: use bilinear interpolation formulas
-            else if (n == 4)
-                /// x[0]  _  x[1]  --->  x0  _  x1   (reason for changing order)
-                /// x[3] |_| x[2]  --->  x2 |_| x3
-                return interpolated_mu_i_quad(x[0], x[1], x[3], x[2],
-                    u[0], u[1], u[3], u[2], mu_i);
-
-            // N-gon: split into n triangles by barycenter and use triangle formulas for each
-            else {
-                Epic::FT mu0 = 0;
-
-                // getting barycenter of points
-                Epic::Vector_3 xm = std::accumulate(x.begin(), x.end(), Epic::Vector_3(0, 0, 0));
-                xm /= n;
-
-                // getting unit average normal of points
-                Epic::Vector_3 um = std::accumulate(u.begin(), u.end(), Epic::Vector_3(0, 0, 0));
-                um /= sqrt(um * um);
-
-                // summing each triangle's measure after triangulation by barycenter split.
-                for (std::size_t i = 0; i < n; i++)
-                {
-                    mu0 += interpolated_mu_i_triangle(x[i], x[(i + 1) % n], xm,
-                        u[i], u[(i + 1) % n], um, mu_i);
-                }
-                return mu0;
-            }
-        }
 
-        
-        /// TODO:
-        /// 1- Handle if VNM is not given
-        /// 2- use GT instead of Epic
-
-        template<typename PolygonMesh,
-            typename VertexNormalMap,
-            typename NamedParameters = parameters::Default_named_parameters>
-            std::vector<Epic::FT>
-            interpolated_corrected_measure_i(
-                const PolygonMesh& pmesh,
-                const Measure_index mu_i,
-                VertexNormalMap vnm,
-                const NamedParameters& np = parameters::default_values())
-        {
-            using parameters::choose_parameter;
-            using parameters::get_parameter;
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* computes the interpolated corrected curvature measure on each face of the mesh
+*
+* @tparam PolygonMesh a model of `FaceGraph`
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+*
+* @param pmesh the polygon mesh
+* @param mu_i an enum for choosing between computing the area measure, the mean curvature measure or the gaussian curvature measure
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*
+* \cgalNamedParamsBegin
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
+*                     must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_normal_map}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Vector_3` as value type}
+*     \cgalParamDefault{`TODO`}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals should be computed inside the function body.}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+*
+* @return a vector of the computed measure on all faces. The return type is a std::vector<GT::FT>.
+* GT is the type of the Geometric Triats deduced from the PolygonMesh and the NamedParameters arguments
+* This is to be changed later to a property_map<face_descriptor, GT::FT>.
+*
+* @see `interpolated_corrected_measure_face()`
+*/
+template<typename PolygonMesh,
+    typename NamedParameters = parameters::Default_named_parameters>
+#ifdef DOXYGEN_RUNNING
+    std::vector<FT>
+#else
+    std::vector<typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT>
+#endif
+    interpolated_corrected_measure_mesh(
+        const PolygonMesh& pmesh,
+        const Measure_index mu_i,
+        NamedParameters& np = parameters::default_values())
+{
+    typedef GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+    typedef dynamic_vertex_property_t<GT::Vector_3> Vector_map_tag;
+    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::type Default_vector_map;
+    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
+        NamedParameters,
+        Default_vector_map>::type       VNM;
 
-            typedef boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-            typedef boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
-            typedef boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+    using parameters::is_default_parameter;
 
-            typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
-                vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-                    get_const_property_map(CGAL::vertex_point, pmesh));
 
-            //std::unordered_map<vertex_descriptor, Epic::Vector_3> vnm_init;
+    typedef boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
 
-            //boost::associative_property_map
-            //    <std::unordered_map<boost::graph_traits<PolygonMesh>::vertex_descriptor, Epic::Vector_3>> vnm(vnm_init);
+    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
+        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+            get_const_property_map(CGAL::vertex_point, pmesh));
 
-            ////if (!vnm)
-            // {
-            //    compute_vertex_normals(pmesh, vnm, np);
-            //}
+    VNM vnm = choose_parameter<Default_vector_map>(
+        get_parameter(np, internal_np::vertex_normal_map), Vector_map_tag(), pmesh);
 
-            std::vector<Epic::FT> mu_i_map;
+    if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
+        compute_vertex_normals(pmesh, vnm, np);
 
+    std::vector<GT::FT> mu_i_map;
 
-            for (face_descriptor f : faces(pmesh))
-            {
-                halfedge_descriptor h_start = pmesh.halfedge(f);
-                halfedge_descriptor h_iter = h_start;
 
-                std::vector<Epic::Vector_3> x;
-                std::vector<Epic::Vector_3> u;
+    for (face_descriptor f : faces(pmesh))
+    {
+        halfedge_descriptor h_start = pmesh.halfedge(f);
+        halfedge_descriptor h_iter = h_start;
 
-                // looping over vertices in face
-                do {
-                    vertex_descriptor v = source(h_iter, pmesh);
-                    Epic::Point_3 p = get(vpm, v);
-                    x.push_back(Epic::Vector_3(p.x(),p.y(),p.z()));
-                    u.push_back(get(vnm, v));
-                    h_iter = next(h_iter, pmesh);
-                } while (h_iter != h_start);
+        std::vector<GT::Vector_3> x;
+        std::vector<GT::Vector_3> u;
 
+        // looping over vertices in face
+        do {
+            vertex_descriptor v = source(h_iter, pmesh);
+            GT::Point_3 p = get(vpm, v);
+            x.push_back(GT::Vector_3(p.x(),p.y(),p.z()));
+            u.push_back(get(vnm, v));
+            h_iter = next(h_iter, pmesh);
+        } while (h_iter != h_start);
 
-                mu_i_map.push_back(interpolated_mu_i_face(x, u, mu_i));
-            }
-            return mu_i_map;
-        }
 
+        mu_i_map.push_back(interpolated_corrected_measure_face<GT>(x, u, mu_i));
     }
+    return mu_i_map;
 }
-
+}
+}
\ No newline at end of file

From c3d654b2c372ae23c135d0641faab1edd099c772 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 18 Jul 2022 02:44:14 +0200
Subject: [PATCH 0007/1398] add documentation for enum

---
 ...nterpolated_corrected_curvature_measures.h | 21 ++++++++++++-------
 1 file changed, 13 insertions(+), 8 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index df5197b2f005..0b164f2d8509 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -15,11 +15,16 @@ namespace CGAL {
 
 namespace Polygon_mesh_processing {
 
-// enum to specify which measure is computed
+/*!
+ * \ingroup PMP_corrected_curvatures_grp
+ * Enumeration type used to specify which measure is computed for the
+ * interpolated corrected curvature functions
+ */
+// enum
 enum Measure_index {
-    MU0_AREA_MEASURE,
-    MU1_MEAN_CURVATURE_MEASURE,
-    MU2_GAUSSIAN_CURVATURE_MEASURE
+    MU0_AREA_MEASURE, ///< corrected area density of the given face
+    MU1_MEAN_CURVATURE_MEASURE, ///< corrected mean curvature density of the given face
+    MU2_GAUSSIAN_CURVATURE_MEASURE ///< corrected gaussian curvature density of the given face
 };
 
 /**
@@ -101,8 +106,8 @@ template<typename GT>
 typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3 x0, const typename GT::Vector_3 x1, const typename GT::Vector_3 x2, const typename GT::Vector_3 x3,
     const typename GT::Vector_3 u0, const typename GT::Vector_3 u1, const typename GT::Vector_3 u2, const typename GT::Vector_3 u3, const Measure_index mu_i)
 {
-    /// x0  _  x1
-    /// x2 |_| x3
+    // x0  _  x1
+    // x2 |_| x3
 
     switch (mu_i)
     {
@@ -172,8 +177,8 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 
     // Quad: use bilinear interpolation formulas
     else if (n == 4)
-        /// x[0]  _  x[1]  --->  x0  _  x1   (reason for changing order)
-        /// x[3] |_| x[2]  --->  x2 |_| x3
+        // x[0]  _  x[1]  --->  x0  _  x1   (reason for changing order)
+        // x[3] |_| x[2]  --->  x2 |_| x3
         return interpolated_corrected_measure_quad<GT>(x[0], x[1], x[3], x[2],
             u[0], u[1], u[3], u[2], mu_i);
 

From e1961c4340bef283b3b4c27afaceecdd89d3c01a Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 18 Jul 2022 02:48:52 +0200
Subject: [PATCH 0008/1398] minor doc fix

---
 .../Curvatures/interpolated_corrected_curvature_measures.h      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 0b164f2d8509..cf6ca10fc8ec 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -100,7 +100,7 @@ typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vecto
 * @return a scalar of type GT::FT. This is the value of the interpolated corrected measure of the given triangle.
 *
 * @see `interpolated_corrected_measure_face()`
-* @see `interpolated_corrected_measure_quad()`
+* @see `interpolated_corrected_measure_triangle()`
 */
 template<typename GT>
 typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3 x0, const typename GT::Vector_3 x1, const typename GT::Vector_3 x2, const typename GT::Vector_3 x3,

From 138f1ea831d9138f008bcb88e0d0db8f7dd26f5b Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 18 Jul 2022 03:31:49 +0200
Subject: [PATCH 0009/1398] added to reference manual page

---
 .../doc/Polygon_mesh_processing/PackageDescription.txt      | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 9f6d7ffd4736..c25cfb8490d3 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -200,6 +200,12 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - \link PMP_locate_grp Nearest Face Location Queries \endlink
 - \link PMP_locate_grp Random Location Generation \endlink
 
+\cgalCRPSection{Corrected Curvature Functions}
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_measure_mesh()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_measure_face()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_measure_triangle()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_measure_quad()`
+
 \cgalCRPSection{Normal Computation Functions}
 - `CGAL::Polygon_mesh_processing::compute_face_normal()`
 - `CGAL::Polygon_mesh_processing::compute_face_normals()`

From b1e191212c8d727180e0614ceae545acc8527b9f Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 18 Jul 2022 04:35:21 +0200
Subject: [PATCH 0010/1398] doc typos

---
 .../interpolated_corrected_curvature_measures.h      | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index cf6ca10fc8ec..38fa4bb05bd8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -18,7 +18,7 @@ namespace Polygon_mesh_processing {
 /*!
  * \ingroup PMP_corrected_curvatures_grp
  * Enumeration type used to specify which measure is computed for the
- * interpolated corrected curvature functions
+ * interpolated corrected curvature functions.
  */
 // enum
 enum Measure_index {
@@ -30,7 +30,7 @@ enum Measure_index {
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected measure of specific triangle.
+* computes the interpolated corrected measure of a specific triangle.
 *
 * @tparam GT is the geometric traits class.
 *
@@ -79,8 +79,8 @@ typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vecto
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected measure of specific quad
-* Note that the vertices 0 to 3 are ordered like this \n
+* computes the interpolated corrected measure of a specific quad. \n
+* Note that the vertices 0 to 3 are ordered like this: \n
 * v0  _  v1 \n
 * v2 |_| v3
 *
@@ -148,7 +148,7 @@ typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected measure of specific face.
+* computes the interpolated corrected measure of a specific face.
 *
 * @tparam GT is the geometric traits class.
 *
@@ -208,7 +208,7 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected curvature measure on each face of the mesh
+* computes the interpolated corrected curvature measure on each face of the mesh.
 *
 * @tparam PolygonMesh a model of `FaceGraph`
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"

From a5f99699e2d43b4373fe14f32e6c8676fdf81f5e Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 18 Jul 2022 16:17:03 +0200
Subject: [PATCH 0011/1398] used a face property map for computing measures,
 added license

will update docs to match
void
    interpolated_corrected_measure_mesh(
        const PolygonMesh& pmesh,
        FaceMeasureMap fmm,
        const Measure_index mu_i,
        NamedParameters& np = parameters::default_values())
{
later if it works
---
 ...nterpolated_corrected_curvature_measures.h | 54 ++++++++++++++++++
 .../interpolated_corrected_curvatures.cpp     | 40 ++++----------
 ...nterpolated_corrected_curvature_measures.h | 55 ++++++++-----------
 3 files changed, 88 insertions(+), 61 deletions(-)
 create mode 100644 Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h

diff --git a/Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h b/Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h
new file mode 100644
index 000000000000..15e2a79af8a9
--- /dev/null
+++ b/Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h
@@ -0,0 +1,54 @@
+// Copyright (c) 2016  GeometryFactory SARL (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s) : Andreas Fabri
+//
+// Warning: this file is generated, see include/CGAL/licence/README.md
+
+#ifndef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
+#define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
+
+#include <CGAL/config.h>
+#include <CGAL/license.h>
+
+#ifdef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE
+
+#  if CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+
+#    if defined(CGAL_LICENSE_WARNING)
+
+       CGAL_pragma_warning("Your commercial license for CGAL does not cover "
+                           "this release of the Polygon Mesh Processing - Interpolated Corrected Curvatures package.")
+#    endif
+
+#    ifdef CGAL_LICENSE_ERROR
+#      error "Your commercial license for CGAL does not cover this release \
+              of the Polygon Mesh Processing - Interpolated Corrected Curvatures package. \
+              You get this error, as you defined CGAL_LICENSE_ERROR."
+#    endif // CGAL_LICENSE_ERROR
+
+#  endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+
+#else // no CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE
+
+#  if defined(CGAL_LICENSE_WARNING)
+     CGAL_pragma_warning("\nThe macro CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE is not defined."
+                          "\nYou use the CGAL Polygon Mesh Processing - Interpolated Corrected Curvatures package under "
+                          "the terms of the GPLv3+.")
+#  endif // CGAL_LICENSE_WARNING
+
+#  ifdef CGAL_LICENSE_ERROR
+#    error "The macro CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE is not defined.\
+            You use the CGAL Polygon Mesh Processing - Interpolated Corrected Curvatures package under the terms of \
+            the GPLv3+. You get this error, as you defined CGAL_LICENSE_ERROR."
+#  endif // CGAL_LICENSE_ERROR
+
+#endif // no CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE
+
+#endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index c117e3f817fe..8dcf387d0ed5 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -23,6 +23,7 @@ typedef CGAL::Polyhedron_3<Epic> Polyhedron;
 typedef CGAL::Surface_mesh<Epic::Point_3> Mesh;
 typedef boost::graph_traits<Mesh>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
+typedef std::unordered_map<face_descriptor, Epic::FT> FaceMeasureMap_tag;
 
 
 int main(int argc, char* argv[])
@@ -35,41 +36,20 @@ int main(int argc, char* argv[])
     std::cerr << "Invalid input file." << std::endl;
     return EXIT_FAILURE;
   }
-  std::unordered_map<vertex_descriptor, Epic::Vector_3> vnm_vec;
-  boost::associative_property_map< std::unordered_map<vertex_descriptor, Epic::Vector_3>> vnm(vnm_vec);
+  std::unordered_map<vertex_descriptor, Epic::Vector_3> vnm_init;
+  boost::associative_property_map< std::unordered_map<vertex_descriptor, Epic::Vector_3>> vnm(vnm_init);
 
   PMP::compute_vertex_normals(g1, vnm);
 
+  FaceMeasureMap_tag mu0_init, mu1_init, mu2_init;
+  boost::associative_property_map<FaceMeasureMap_tag> mu0_map(mu0_init), mu1_map(mu1_init), mu2_map(mu2_init);
 
-  std::vector<Epic::FT> mu0_map, mu1_map, mu2_map;
+  PMP::interpolated_corrected_measure_mesh(g1, mu0_map, PMP::MU0_AREA_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
+  PMP::interpolated_corrected_measure_mesh(g1, mu1_map, PMP::MU1_MEAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
+  PMP::interpolated_corrected_measure_mesh(g1, mu2_map, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
 
-  mu0_map = PMP::interpolated_corrected_measure_mesh(g1, PMP::MU0_AREA_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
-  mu1_map = PMP::interpolated_corrected_measure_mesh(g1, PMP::MU1_MEAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
-  mu2_map = PMP::interpolated_corrected_measure_mesh(g1, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
-
-  int n = g1.faces().size();
-
-  for (int i = 0; i < n; i++)
+  for (face_descriptor f: g1.faces())
   {
-      std::cout << mu0_map[i] << "\n";
+      std::cout << f.idx() << ": " << get(mu0_map, f) << ", " << get(mu1_map, f) << ", " << get(mu2_map, f) << ", " << "\n";
   }
-
-  std::cout << "\n";
-
-  for (int i = 0; i < n; i++)
-  {
-      std::cout << mu1_map[i] << "\n";
-  }
-
-  std::cout << "\n";
-
-  for (int i = 0; i < n; i++)
-  {
-      std::cout << mu2_map[i] << "\n";
-  }
-
-
-  CGAL::draw(g1);
-
-  return EXIT_SUCCESS;
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 38fa4bb05bd8..6a5c675d4e69 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -3,6 +3,7 @@
 #endif
 
 #include <numeric>
+#include <CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h>
 
 #include <CGAL/assertions.h>
 #include <CGAL/Named_function_parameters.h>
@@ -17,10 +18,10 @@ namespace Polygon_mesh_processing {
 
 /*!
  * \ingroup PMP_corrected_curvatures_grp
- * Enumeration type used to specify which measure is computed for the
- * interpolated corrected curvature functions.
+ * Enumeration type used to specify which measure is computed for the 
+ * interpolated corrected curvature functions
  */
-// enum
+// enum 
 enum Measure_index {
     MU0_AREA_MEASURE, ///< corrected area density of the given face
     MU1_MEAN_CURVATURE_MEASURE, ///< corrected mean curvature density of the given face
@@ -30,7 +31,7 @@ enum Measure_index {
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected measure of a specific triangle.
+* computes the interpolated corrected measure of specific triangle.
 *
 * @tparam GT is the geometric traits class.
 *
@@ -79,9 +80,9 @@ typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vecto
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected measure of a specific quad. \n
-* Note that the vertices 0 to 3 are ordered like this: \n
-* v0  _  v1 \n
+* computes the interpolated corrected measure of specific quad
+* Note that the vertices 0 to 3 are ordered like this \n 
+* v0  _  v1 \n 
 * v2 |_| v3
 *
 * @tparam GT is the geometric traits class.
@@ -148,7 +149,7 @@ typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected measure of a specific face.
+* computes the interpolated corrected measure of specific face.
 *
 * @tparam GT is the geometric traits class.
 *
@@ -208,12 +209,12 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected curvature measure on each face of the mesh.
+* computes the interpolated corrected curvature measure on each face of the mesh
 *
 * @tparam PolygonMesh a model of `FaceGraph`
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
-* @param pmesh the polygon mesh
+* @param pmesh the polygon mesh 
 * @param mu_i an enum for choosing between computing the area measure, the mean curvature measure or the gaussian curvature measure
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
@@ -226,7 +227,7 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
 *                     must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
-*
+* 
 *   \cgalParamNBegin{vertex_normal_map}
 *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
@@ -234,29 +235,27 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 *     \cgalParamDefault{`TODO`}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals should be computed inside the function body.}
 *   \cgalParamNEnd
-*
+* 
 * \cgalNamedParamsEnd
 *
-* @return a vector of the computed measure on all faces. The return type is a std::vector<GT::FT>.
+* @return a vector of the computed measure on all faces. The return type is a std::vector<GT::FT>. 
 * GT is the type of the Geometric Triats deduced from the PolygonMesh and the NamedParameters arguments
 * This is to be changed later to a property_map<face_descriptor, GT::FT>.
 *
 * @see `interpolated_corrected_measure_face()`
 */
-template<typename PolygonMesh,
+template<typename PolygonMesh, typename FaceMeasureMap,
     typename NamedParameters = parameters::Default_named_parameters>
-#ifdef DOXYGEN_RUNNING
-    std::vector<FT>
-#else
-    std::vector<typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT>
-#endif
+    void
     interpolated_corrected_measure_mesh(
         const PolygonMesh& pmesh,
+        FaceMeasureMap fmm,
         const Measure_index mu_i,
         NamedParameters& np = parameters::default_values())
 {
+
     typedef GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-    typedef dynamic_vertex_property_t<GT::Vector_3> Vector_map_tag;
+    typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
     typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::type Default_vector_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
         NamedParameters,
@@ -266,7 +265,6 @@ template<typename PolygonMesh,
     using parameters::get_parameter;
     using parameters::is_default_parameter;
 
-
     typedef boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
     typedef boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
     typedef boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
@@ -274,16 +272,13 @@ template<typename PolygonMesh,
     typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
             get_const_property_map(CGAL::vertex_point, pmesh));
-
-    VNM vnm = choose_parameter<Default_vector_map>(
-        get_parameter(np, internal_np::vertex_normal_map), Vector_map_tag(), pmesh);
+    
+    // TODO - handle if vnm is not provided
+    VNM vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map), get(Vector_map_tag(), pmesh));
 
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
         compute_vertex_normals(pmesh, vnm, np);
 
-    std::vector<GT::FT> mu_i_map;
-
-
     for (face_descriptor f : faces(pmesh))
     {
         halfedge_descriptor h_start = pmesh.halfedge(f);
@@ -301,10 +296,8 @@ template<typename PolygonMesh,
             h_iter = next(h_iter, pmesh);
         } while (h_iter != h_start);
 
-
-        mu_i_map.push_back(interpolated_corrected_measure_face<GT>(x, u, mu_i));
+        put(fmm, f, interpolated_corrected_measure_face<GT>(x, u, mu_i));
     }
-    return mu_i_map;
 }
 }
-}
\ No newline at end of file
+}

From a54033c0c9211b9c9c42b8eeb6ec6f3f7fa86dfd Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 18 Jul 2022 16:32:33 +0200
Subject: [PATCH 0012/1398] add a couple of missing const and typename

---
 ...nterpolated_corrected_curvature_measures.h | 24 +++++++++----------
 1 file changed, 12 insertions(+), 12 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 6a5c675d4e69..46b2f5c01fcc 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -188,11 +188,11 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
         typename GT::FT mu0 = 0;
 
         // getting barycenter of points
-        typename GT::Vector_3 xm = std::accumulate(x.begin(), x.end(), GT::Vector_3(0, 0, 0));
+        typename GT::Vector_3 xm = std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
         xm /= n;
 
         // getting unit average normal of points
-        typename GT::Vector_3 um = std::accumulate(u.begin(), u.end(), GT::Vector_3(0, 0, 0));
+        typename GT::Vector_3 um = std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
         um /= sqrt(um * um);
 
         // summing each triangle's measure after triangulation by barycenter split.
@@ -251,12 +251,12 @@ template<typename PolygonMesh, typename FaceMeasureMap,
         const PolygonMesh& pmesh,
         FaceMeasureMap fmm,
         const Measure_index mu_i,
-        NamedParameters& np = parameters::default_values())
+        const NamedParameters& np = parameters::default_values())
 {
 
-    typedef GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
     typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
-    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::type Default_vector_map;
+    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
         NamedParameters,
         Default_vector_map>::type       VNM;
@@ -265,9 +265,9 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     using parameters::get_parameter;
     using parameters::is_default_parameter;
 
-    typedef boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-    typedef boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
-    typedef boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
 
     typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
@@ -284,14 +284,14 @@ template<typename PolygonMesh, typename FaceMeasureMap,
         halfedge_descriptor h_start = pmesh.halfedge(f);
         halfedge_descriptor h_iter = h_start;
 
-        std::vector<GT::Vector_3> x;
-        std::vector<GT::Vector_3> u;
+        std::vector<typename GT::Vector_3> x;
+        std::vector<typename GT::Vector_3> u;
 
         // looping over vertices in face
         do {
             vertex_descriptor v = source(h_iter, pmesh);
-            GT::Point_3 p = get(vpm, v);
-            x.push_back(GT::Vector_3(p.x(),p.y(),p.z()));
+            typename GT::Point_3 p = get(vpm, v);
+            x.push_back(typename GT::Vector_3(p.x(),p.y(),p.z()));
             u.push_back(get(vnm, v));
             h_iter = next(h_iter, pmesh);
         } while (h_iter != h_start);

From 5cc75c0bc4690df397c7dc14d03ca3049ad113f2 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 18 Jul 2022 21:57:42 +0200
Subject: [PATCH 0013/1398] Updated Demo Display property plugin, added to
 license list,

---
 .../include/CGAL/license/gpl_package_list.txt |   1 +
 .../interpolated_corrected_curvatures.cpp     |   2 +-
 ...nterpolated_corrected_curvature_measures.h |  10 +-
 .../Display/Display_property_plugin.cpp       | 191 +++++++++++++++++-
 4 files changed, 188 insertions(+), 16 deletions(-)

diff --git a/Installation/include/CGAL/license/gpl_package_list.txt b/Installation/include/CGAL/license/gpl_package_list.txt
index f023d48f375f..485c4234b91d 100644
--- a/Installation/include/CGAL/license/gpl_package_list.txt
+++ b/Installation/include/CGAL/license/gpl_package_list.txt
@@ -51,6 +51,7 @@ Polygon_mesh_processing/connected_components Polygon Mesh Processing - Connected
 Polygon_mesh_processing/corefinement Polygon Mesh Processing - Corefinement
 Polygon_mesh_processing/core Polygon Mesh Processing - Core
 Polygon_mesh_processing/distance Polygon Mesh Processing - Distance
+Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures Polygon Mesh Processing - Interpolated Corrected Curvatures
 Polygon_mesh_processing/measure Polygon Mesh Processing - Geometric Measure
 Polygon_mesh_processing/meshing_hole_filling Polygon Mesh Processing - Meshing and Hole Filling
 Polygon_mesh_processing/orientation Polygon Mesh Processing - Orientation
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index 8dcf387d0ed5..d17e37726a8a 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -44,7 +44,7 @@ int main(int argc, char* argv[])
   FaceMeasureMap_tag mu0_init, mu1_init, mu2_init;
   boost::associative_property_map<FaceMeasureMap_tag> mu0_map(mu0_init), mu1_map(mu1_init), mu2_map(mu2_init);
 
-  PMP::interpolated_corrected_measure_mesh(g1, mu0_map, PMP::MU0_AREA_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
+  PMP::interpolated_corrected_measure_mesh(g1, mu0_map, PMP::MU0_AREA_MEASURE);
   PMP::interpolated_corrected_measure_mesh(g1, mu1_map, PMP::MU1_MEAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
   PMP::interpolated_corrected_measure_mesh(g1, mu2_map, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 46b2f5c01fcc..7f99fbd7cace 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -22,7 +22,7 @@ namespace Polygon_mesh_processing {
  * interpolated corrected curvature functions
  */
 // enum 
-enum Measure_index {
+enum Curvature_measure_index {
     MU0_AREA_MEASURE, ///< corrected area density of the given face
     MU1_MEAN_CURVATURE_MEASURE, ///< corrected mean curvature density of the given face
     MU2_GAUSSIAN_CURVATURE_MEASURE ///< corrected gaussian curvature density of the given face
@@ -51,7 +51,7 @@ enum Measure_index {
 */
 template<typename GT>
 typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vector_3 x0, const typename GT::Vector_3 x1, const typename GT::Vector_3 x2,
-    const typename GT::Vector_3 u0, const typename GT::Vector_3 u1, const typename GT::Vector_3 u2, const Measure_index mu_i)
+    const typename GT::Vector_3 u0, const typename GT::Vector_3 u1, const typename GT::Vector_3 u2, const Curvature_measure_index mu_i)
 {
     switch (mu_i)
     {
@@ -105,7 +105,7 @@ typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vecto
 */
 template<typename GT>
 typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3 x0, const typename GT::Vector_3 x1, const typename GT::Vector_3 x2, const typename GT::Vector_3 x3,
-    const typename GT::Vector_3 u0, const typename GT::Vector_3 u1, const typename GT::Vector_3 u2, const typename GT::Vector_3 u3, const Measure_index mu_i)
+    const typename GT::Vector_3 u0, const typename GT::Vector_3 u1, const typename GT::Vector_3 u2, const typename GT::Vector_3 u3, const Curvature_measure_index mu_i)
 {
     // x0  _  x1
     // x2 |_| x3
@@ -165,7 +165,7 @@ typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3
 * @see `interpolated_corrected_measure_mesh()`
 */
 template<typename GT>
-typename GT::FT interpolated_corrected_measure_face(const std::vector<typename GT::Vector_3>& x, const std::vector<typename GT::Vector_3>& u, const Measure_index mu_i)
+typename GT::FT interpolated_corrected_measure_face(const std::vector<typename GT::Vector_3>& x, const std::vector<typename GT::Vector_3>& u, const Curvature_measure_index mu_i)
 {
     std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
@@ -250,7 +250,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     interpolated_corrected_measure_mesh(
         const PolygonMesh& pmesh,
         FaceMeasureMap fmm,
-        const Measure_index mu_i,
+        const Curvature_measure_index mu_i,
         const NamedParameters& np = parameters::default_values())
 {
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 0d8687bd6356..1ea1394649c2 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -15,6 +15,7 @@
 #include <CGAL/boost/graph/helpers.h>
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
 #include <CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h>
+#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
 
 #include "Scene_points_with_normal_item.h"
 
@@ -31,6 +32,7 @@
 #include <CGAL/Dynamic_property_map.h>
 #include <type_traits>
 #include <unordered_map>
+#include <vector>
 
 #define ARBITRARY_DBL_MIN 1.0E-30
 #define ARBITRARY_DBL_MAX 1.0E+30
@@ -41,6 +43,8 @@
 typedef CGAL::Three::Triangle_container Tri;
 typedef CGAL::Three::Viewer_interface VI;
 
+namespace PMP = CGAL::Polygon_mesh_processing;
+
 class Scene_heat_item
     : public CGAL::Three::Scene_item_rendering_helper
 {
@@ -529,6 +533,9 @@ private Q_SLOTS:
         dock_widget->propertyBox->addItem("Scaled Jacobian");
         dock_widget->propertyBox->addItem("Heat Intensity");
         dock_widget->propertyBox->addItem("Heat Intensity (Intrinsic Delaunay)");
+        dock_widget->propertyBox->addItem("corrected area density");
+        dock_widget->propertyBox->addItem("corrected mean curvature density");
+        dock_widget->propertyBox->addItem("corrected gaussian curvature density");
       detectSMScalarProperties(sm_item->face_graph());
 
     }
@@ -603,6 +610,18 @@ private Q_SLOTS:
         return;
       sm_item->setRenderingMode(Gouraud);
       break;
+    case 4: // corrected area density
+        displayInterpolatedCurvatureMeasure(sm_item, PMP::MU0_AREA_MEASURE);
+        sm_item->setRenderingMode(Flat);
+        break;
+    case 5: // corrected mean curvature density
+        displayInterpolatedCurvatureMeasure(sm_item, PMP::MU1_MEAN_CURVATURE_MEASURE);
+        sm_item->setRenderingMode(Flat);
+        break;
+    case 6: // corrected gaussian curvature density
+        displayInterpolatedCurvatureMeasure(sm_item, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE);
+        sm_item->setRenderingMode(Flat);
+        break;
     default:
       if(dock_widget->propertyBox->currentText().contains("v:"))
       {
@@ -637,6 +656,18 @@ private Q_SLOTS:
           sm_item->face_graph()->property_map<face_descriptor,double>("f:angle");
       if(does_exist)
         sm_item->face_graph()->remove_property_map(pmap);
+      std::tie(pmap, does_exist) =
+          sm_item->face_graph()->property_map<face_descriptor, double>("f:corrected_area_density");
+      if (does_exist)
+          sm_item->face_graph()->remove_property_map(pmap);
+      std::tie(pmap, does_exist) =
+          sm_item->face_graph()->property_map<face_descriptor, double>("f:corrected_mean_curvature_density");
+      if (does_exist)
+          sm_item->face_graph()->remove_property_map(pmap);
+      std::tie(pmap, does_exist) =
+          sm_item->face_graph()->property_map<face_descriptor, double>("f:corrected_gaussian_curvature_density");
+      if (does_exist)
+          sm_item->face_graph()->remove_property_map(pmap);
     });
     QApplication::restoreOverrideCursor();
     sm_item->invalidateOpenGLBuffers();
@@ -668,13 +699,25 @@ private Q_SLOTS:
       switch(dock_widget->propertyBox->currentIndex())
       {
       case 0:
-        dock_widget->zoomToMinButton->setEnabled(angles_max.count(sm_item)>0 );
+        dock_widget->zoomToMinButton->setEnabled(angles_min.count(sm_item)>0 );
         dock_widget->zoomToMaxButton->setEnabled(angles_max.count(sm_item)>0 );
         break;
       case 1:
-        dock_widget->zoomToMinButton->setEnabled(jacobian_max.count(sm_item)>0);
+        dock_widget->zoomToMinButton->setEnabled(jacobian_min.count(sm_item)>0);
         dock_widget->zoomToMaxButton->setEnabled(jacobian_max.count(sm_item)>0);
         break;
+      case 4:
+          dock_widget->zoomToMinButton->setEnabled(mu0_min.count(sm_item) > 0);
+          dock_widget->zoomToMaxButton->setEnabled(mu0_max.count(sm_item) > 0);
+          break;
+      case 5:
+          dock_widget->zoomToMinButton->setEnabled(mu1_min.count(sm_item) > 0);
+          dock_widget->zoomToMaxButton->setEnabled(mu1_max.count(sm_item) > 0);
+          break;
+      case 6:
+          dock_widget->zoomToMinButton->setEnabled(mu2_min.count(sm_item) > 0);
+          dock_widget->zoomToMaxButton->setEnabled(mu2_max.count(sm_item) > 0);
+          break;
       default:
         break;
       }
@@ -701,11 +744,28 @@ private Q_SLOTS:
     {
       smesh.remove_property_map(angles);
     }
+    SMesh::Property_map<face_descriptor, double> mu0;
+    std::tie(mu0, found) = smesh.property_map<face_descriptor, double>("f:corrected_area_density");
+    if (found)
+    {
+        smesh.remove_property_map(mu0);
+    }
+    SMesh::Property_map<face_descriptor, double> mu1;
+    std::tie(mu1, found) = smesh.property_map<face_descriptor, double>("f:corrected_mean_curvature_density");
+    if (found)
+    {
+        smesh.remove_property_map(mu0);
+    }
+    SMesh::Property_map<face_descriptor, double> mu2;
+    std::tie(mu2, found) = smesh.property_map<face_descriptor, double>("f:corrected_gaussian_curvature_density");
+    if (found)
+    {
+        smesh.remove_property_map(mu0);
+    }
   }
 
   void displayScaledJacobian(Scene_surface_mesh_item* item)
   {
-
     SMesh& smesh = *item->face_graph();
     //compute and store the jacobian per face
     bool non_init;
@@ -742,16 +802,59 @@ private Q_SLOTS:
     treat_sm_property<face_descriptor>("f:jacobian", item->face_graph());
   }
 
-  bool resetScaledJacobian(Scene_surface_mesh_item* item)
+  void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item, PMP::Curvature_measure_index mu_index)
   {
+    std::vector<std::string> tied_map = { 
+        "f:corrected_area_density",
+        "f:corrected_mean_curvature_density",
+        "f:corrected_gaussian_curvature_density" 
+    };
     SMesh& smesh = *item->face_graph();
-    if(!smesh.property_map<face_descriptor, double>("f:jacobian").second)
+    //compute once and store the value per face
+    bool non_init;
+    SMesh::Property_map<face_descriptor, double> mu_i_map;
+        std::tie(mu_i_map, non_init) = 
+            smesh.add_property_map<face_descriptor, double>(tied_map[mu_index], 0);
+    if (non_init)
     {
-      return false;
+        PMP::interpolated_corrected_measure_mesh(smesh, mu_i_map, mu_index);
+
+        double res_min = ARBITRARY_DBL_MAX,
+            res_max = -ARBITRARY_DBL_MAX;
+        SMesh::Face_index min_index, max_index;
+        for (SMesh::Face_index f : faces(smesh))
+        {
+            if (mu_i_map[f] > res_max)
+            {
+                res_max = mu_i_map[f];
+                max_index = f;
+            }
+            if (mu_i_map[f] < res_min)
+            {
+                res_min = mu_i_map[f];
+                min_index = f;
+            }
+        }
+        switch (mu_index)
+        {
+        case PMP::MU0_AREA_MEASURE:
+            mu0_max[item] = std::make_pair(res_max, max_index);
+            mu0_min[item] = std::make_pair(res_min, min_index);
+            break;
+        case PMP::MU1_MEAN_CURVATURE_MEASURE:
+            mu1_max[item] = std::make_pair(res_max, max_index);
+            mu1_min[item] = std::make_pair(res_min, min_index);
+            break;
+        case PMP::MU2_GAUSSIAN_CURVATURE_MEASURE:
+            mu2_max[item] = std::make_pair(res_max, max_index);
+            mu2_min[item] = std::make_pair(res_min, min_index);
+            break;
+        }
+
+        connect(item, &Scene_surface_mesh_item::itemChanged,
+            this, &DisplayPropertyPlugin::resetProperty);
     }
-    dock_widget->minBox->setValue(jacobian_min[item].first-0.01);
-    dock_widget->maxBox->setValue(jacobian_max[item].first);
-    return true;
+        treat_sm_property<face_descriptor>(tied_map[mu_index], item->face_graph());
   }
 
 
@@ -1054,6 +1157,9 @@ private Q_SLOTS:
         break;
       }
       case 1:
+      case 4:
+      case 5:
+      case 6:
         dock_widget->groupBox->  setEnabled(true);
         dock_widget->groupBox_3->setEnabled(true);
 
@@ -1113,6 +1219,34 @@ private Q_SLOTS:
                  dummy_fd,
                  dummy_p);
     }
+    break;
+    case 4:
+    {
+        ::zoomToId(*item->face_graph(),
+            QString("f%1").arg(mu0_min[item].second),
+            getActiveViewer(),
+            dummy_fd,
+            dummy_p);
+    }
+    break;
+    case 5:
+    {
+        ::zoomToId(*item->face_graph(),
+            QString("f%1").arg(mu1_min[item].second),
+            getActiveViewer(),
+            dummy_fd,
+            dummy_p);
+    }
+    break;
+    case 6:
+    {
+        ::zoomToId(*item->face_graph(),
+            QString("f%1").arg(mu2_min[item].second),
+            getActiveViewer(),
+            dummy_fd,
+            dummy_p);
+    }
+    break;
       break;
     default:
       break;
@@ -1145,6 +1279,33 @@ private Q_SLOTS:
                  getActiveViewer(),
                  dummy_fd,
                  dummy_p);
+    }
+    break;
+    case 4:
+    {
+        ::zoomToId(*item->face_graph(),
+            QString("f%1").arg(mu0_max[item].second),
+            getActiveViewer(),
+            dummy_fd,
+            dummy_p);
+    }
+    break;
+    case 5:
+    {
+        ::zoomToId(*item->face_graph(),
+            QString("f%1").arg(mu1_max[item].second),
+            getActiveViewer(),
+            dummy_fd,
+            dummy_p);
+    }
+    break;
+    case 6:
+    {
+        ::zoomToId(*item->face_graph(),
+            QString("f%1").arg(mu2_max[item].second),
+            getActiveViewer(),
+            dummy_fd,
+            dummy_p);
     }
       break;
     default:
@@ -1436,6 +1597,16 @@ private Q_SLOTS:
 
   std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > angles_min;
   std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > angles_max;
+
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu0_min;
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu0_max;
+
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu1_min;
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu1_max;
+  
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu2_min;
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu2_max;
+
   std::unordered_map<Scene_surface_mesh_item*, Vertex_source_map> is_source;
 
 
@@ -1718,7 +1889,7 @@ private Q_SLOTS:
     }
 
 
-    EPICK::Vector_3 unit_center_normal = CGAL::Polygon_mesh_processing::compute_face_normal(f, mesh);
+    EPICK::Vector_3 unit_center_normal = PMP::compute_face_normal(f, mesh);
     unit_center_normal *= 1.0/CGAL::approximate_sqrt(unit_center_normal.squared_length());
 
     for(std::size_t i = 0; i < corner_areas.size(); ++i)

From 5af4a28b1674cb660d1c4575ccf69a5d4925ace5 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 18 Jul 2022 22:23:46 +0200
Subject: [PATCH 0014/1398] updated doc for
 interpolated_corrected_measure_mesh()

---
 ...nterpolated_corrected_curvature_measures.h | 21 +++++++++----------
 1 file changed, 10 insertions(+), 11 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 7f99fbd7cace..93d41ac77db7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -18,10 +18,10 @@ namespace Polygon_mesh_processing {
 
 /*!
  * \ingroup PMP_corrected_curvatures_grp
- * Enumeration type used to specify which measure is computed for the 
+ * Enumeration type used to specify which measure is computed for the
  * interpolated corrected curvature functions
  */
-// enum 
+// enum
 enum Curvature_measure_index {
     MU0_AREA_MEASURE, ///< corrected area density of the given face
     MU1_MEAN_CURVATURE_MEASURE, ///< corrected mean curvature density of the given face
@@ -212,9 +212,12 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 * computes the interpolated corrected curvature measure on each face of the mesh
 *
 * @tparam PolygonMesh a model of `FaceGraph`
+* @tparam FaceMeasureMap a a model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and GT::FT as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
-* @param pmesh the polygon mesh 
+* @param pmesh the polygon mesh
+* @param fmm (face measure map) the property map used for storing the computed interpolated corrected measure
 * @param mu_i an enum for choosing between computing the area measure, the mean curvature measure or the gaussian curvature measure
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
@@ -227,7 +230,7 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
 *                     must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
-* 
+*
 *   \cgalParamNBegin{vertex_normal_map}
 *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
@@ -235,12 +238,8 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 *     \cgalParamDefault{`TODO`}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals should be computed inside the function body.}
 *   \cgalParamNEnd
-* 
-* \cgalNamedParamsEnd
 *
-* @return a vector of the computed measure on all faces. The return type is a std::vector<GT::FT>. 
-* GT is the type of the Geometric Triats deduced from the PolygonMesh and the NamedParameters arguments
-* This is to be changed later to a property_map<face_descriptor, GT::FT>.
+* \cgalNamedParamsEnd
 *
 * @see `interpolated_corrected_measure_face()`
 */
@@ -272,7 +271,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
             get_const_property_map(CGAL::vertex_point, pmesh));
-    
+
     // TODO - handle if vnm is not provided
     VNM vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map), get(Vector_map_tag(), pmesh));
 
@@ -291,7 +290,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
         do {
             vertex_descriptor v = source(h_iter, pmesh);
             typename GT::Point_3 p = get(vpm, v);
-            x.push_back(typename GT::Vector_3(p.x(),p.y(),p.z()));
+            x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
             u.push_back(get(vnm, v));
             h_iter = next(h_iter, pmesh);
         } while (h_iter != h_start);

From 8fea1a94a2a3239df27fcc734bdb3f814a490638 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 18 Jul 2022 22:40:38 +0200
Subject: [PATCH 0015/1398] minor fix

---
 .../interpolated_corrected_curvatures.cpp                       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index d17e37726a8a..05c74f68cfc7 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -28,7 +28,7 @@ typedef std::unordered_map<face_descriptor, Epic::FT> FaceMeasureMap_tag;
 
 int main(int argc, char* argv[])
 {
-  const std::string filename = (argc>1) ? argv[1] : CGAL::data_file_path("small_bunny.obj");
+  const std::string filename = (argc>1) ? argv[1] : CGAL::data_file_path("meshes/small_bunny.obj");
 
   Mesh g1;
   if(!CGAL::IO::read_polygon_mesh(filename, g1))

From 063e058988567727b9ae5421a98212e18958841e Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 22 Jul 2022 15:29:19 +0200
Subject: [PATCH 0016/1398] minor changes regarding the pull review

reordering includes, splitting too long lines, minor addition to doc
regarding review on the pull req
---
 .../interpolated_corrected_curvatures.cpp     |  66 +++++++-----
 ...nterpolated_corrected_curvature_measures.h | 102 +++++++++++-------
 2 files changed, 104 insertions(+), 64 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index 05c74f68cfc7..505d43286451 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -1,55 +1,67 @@
-#include <CGAL/Surface_mesh.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <iostream>
-#include <unordered_map>
-#include <CGAL/property_map.h>
+#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
-#include <fstream>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/property_map.h>
 
 #include <boost/graph/graph_traits.hpp>
 
-#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
-#include <CGAL/Polygon_mesh_processing/compute_normal.h>
-#include <CGAL/Polyhedron_3.h>
-#include <CGAL/Surface_mesh.h>
-#include <chrono>
-#include <CGAL/Surface_mesh/IO/OFF.h>
-#include <CGAL/draw_surface_mesh.h>
+#include <iostream>
+#include <unordered_map>
+
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic;
-typedef CGAL::Polyhedron_3<Epic> Polyhedron;
-typedef CGAL::Surface_mesh<Epic::Point_3> Mesh;
+typedef CGAL::Exact_predicates_inexact_constructions_kernel EpicKernel;
+typedef CGAL::Surface_mesh<EpicKernel::Point_3> Mesh;
 typedef boost::graph_traits<Mesh>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
-typedef std::unordered_map<face_descriptor, Epic::FT> FaceMeasureMap_tag;
+typedef std::unordered_map<face_descriptor, EpicKernel::FT> FaceMeasureMap_tag;
+typedef std::unordered_map<vertex_descriptor, EpicKernel::Vector_3> vertexVectorMap_tag;
 
 
 int main(int argc, char* argv[])
 {
-  const std::string filename = (argc>1) ? argv[1] : CGAL::data_file_path("meshes/small_bunny.obj");
-
   Mesh g1;
+  const std::string filename = (argc>1) ?
+      argv[1] :
+      CGAL::data_file_path("meshes/small_bunny.obj");
+
   if(!CGAL::IO::read_polygon_mesh(filename, g1))
   {
     std::cerr << "Invalid input file." << std::endl;
     return EXIT_FAILURE;
   }
-  std::unordered_map<vertex_descriptor, Epic::Vector_3> vnm_init;
-  boost::associative_property_map< std::unordered_map<vertex_descriptor, Epic::Vector_3>> vnm(vnm_init);
+
+  vertexVectorMap_tag vnm_init;
+  boost::associative_property_map <vertexVectorMap_tag> vnm(vnm_init);
 
   PMP::compute_vertex_normals(g1, vnm);
 
   FaceMeasureMap_tag mu0_init, mu1_init, mu2_init;
-  boost::associative_property_map<FaceMeasureMap_tag> mu0_map(mu0_init), mu1_map(mu1_init), mu2_map(mu2_init);
+  boost::associative_property_map<FaceMeasureMap_tag>
+      mu0_map(mu0_init), mu1_map(mu1_init), mu2_map(mu2_init);
 
-  PMP::interpolated_corrected_measure_mesh(g1, mu0_map, PMP::MU0_AREA_MEASURE);
-  PMP::interpolated_corrected_measure_mesh(g1, mu1_map, PMP::MU1_MEAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
-  PMP::interpolated_corrected_measure_mesh(g1, mu2_map, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE, CGAL::parameters::vertex_normal_map(vnm));
+  PMP::interpolated_corrected_measure_mesh(
+      g1,
+      mu0_map,
+      PMP::MU0_AREA_MEASURE);
+
+  PMP::interpolated_corrected_measure_mesh(
+      g1,
+      mu1_map,
+      PMP::MU1_MEAN_CURVATURE_MEASURE,
+      CGAL::parameters::vertex_normal_map(vnm));
+
+  PMP::interpolated_corrected_measure_mesh(
+      g1,
+      mu2_map,
+      PMP::MU2_GAUSSIAN_CURVATURE_MEASURE,
+      CGAL::parameters::vertex_normal_map(vnm));
 
   for (face_descriptor f: g1.faces())
-  {
-      std::cout << f.idx() << ": " << get(mu0_map, f) << ", " << get(mu1_map, f) << ", " << get(mu2_map, f) << ", " << "\n";
-  }
+      std::cout << f.idx() << ": "
+          << get(mu0_map, f) << ", "
+          << get(mu1_map, f) << ", "
+          << get(mu2_map, f) << ", " << "\n";
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 93d41ac77db7..aae957dc0159 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -2,15 +2,15 @@
 #define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
 #endif
 
-#include <numeric>
 #include <CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h>
 
 #include <CGAL/assertions.h>
-#include <CGAL/Named_function_parameters.h>
 #include <CGAL/Polygon_mesh_processing/internal/named_params_helper.h>
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
+#include <CGAL/Named_function_parameters.h>
 #include <CGAL/property_map.h>
 
+#include <numeric>
 
 namespace CGAL {
 
@@ -18,14 +18,14 @@ namespace Polygon_mesh_processing {
 
 /*!
  * \ingroup PMP_corrected_curvatures_grp
- * Enumeration type used to specify which measure is computed for the
- * interpolated corrected curvature functions
+ * Enumeration type used to specify which measure of a given face
+ * is computed for the interpolated corrected curvature functions
  */
 // enum
 enum Curvature_measure_index {
-    MU0_AREA_MEASURE, ///< corrected area density of the given face
-    MU1_MEAN_CURVATURE_MEASURE, ///< corrected mean curvature density of the given face
-    MU2_GAUSSIAN_CURVATURE_MEASURE ///< corrected gaussian curvature density of the given face
+    MU0_AREA_MEASURE, ///< corrected area density
+    MU1_MEAN_CURVATURE_MEASURE, ///< corrected mean curvature density
+    MU2_GAUSSIAN_CURVATURE_MEASURE ///< corrected gaussian curvature density
 };
 
 /**
@@ -44,14 +44,20 @@ enum Curvature_measure_index {
 * @param mu_i an enum for choosing between computing the area measure,
 * the mean curvature measure, or the gaussian curvature measure.
 *
-* @return a scalar of type GT::FT. This is the value of the interpolated corrected measure of the given triangle.
+* @return a scalar of type GT::FT. 
+* This is the value of the interpolated corrected measure of the given triangle.
 *
 * @see `interpolated_corrected_measure_face()`
 * @see `interpolated_corrected_measure_quad()`
 */
 template<typename GT>
-typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vector_3 x0, const typename GT::Vector_3 x1, const typename GT::Vector_3 x2,
-    const typename GT::Vector_3 u0, const typename GT::Vector_3 u1, const typename GT::Vector_3 u2, const Curvature_measure_index mu_i)
+typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vector_3 x0,
+                                                        const typename GT::Vector_3 x1,
+                                                        const typename GT::Vector_3 x2,
+                                                        const typename GT::Vector_3 u0, 
+                                                        const typename GT::Vector_3 u1, 
+                                                        const typename GT::Vector_3 u2, 
+                                                        const Curvature_measure_index mu_i)
 {
     switch (mu_i)
     {
@@ -98,26 +104,36 @@ typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vecto
 * @param mu_i an enum for choosing between computing the area measure,
 * the mean curvature measure, or the gaussian curvature measure.
 *
-* @return a scalar of type GT::FT. This is the value of the interpolated corrected measure of the given triangle.
+* @return a scalar of type GT::FT. 
+* This is the value of the interpolated corrected measure of the given triangle.
 *
 * @see `interpolated_corrected_measure_face()`
 * @see `interpolated_corrected_measure_triangle()`
 */
 template<typename GT>
-typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3 x0, const typename GT::Vector_3 x1, const typename GT::Vector_3 x2, const typename GT::Vector_3 x3,
-    const typename GT::Vector_3 u0, const typename GT::Vector_3 u1, const typename GT::Vector_3 u2, const typename GT::Vector_3 u3, const Curvature_measure_index mu_i)
+typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3 x0,
+                                                    const typename GT::Vector_3 x1,
+                                                    const typename GT::Vector_3 x2,
+                                                    const typename GT::Vector_3 x3,
+                                                    const typename GT::Vector_3 u0,
+                                                    const typename GT::Vector_3 u1,
+                                                    const typename GT::Vector_3 u2,
+                                                    const typename GT::Vector_3 u3,
+                                                    const Curvature_measure_index mu_i)
 {
     // x0  _  x1
     // x2 |_| x3
-
+    
     switch (mu_i)
     {
     case MU0_AREA_MEASURE:
 
-        return (1 / 36.0) * ((4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(x1 - x0, x2 - x0)
+        return (1 / 36.0) * (
+              (4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(x1 - x0, x2 - x0)
             + (2 * u0 + 4 * u1 + u2 + 2 * u3) * CGAL::cross_product(x1 - x0, x3 - x1)
             + (2 * u0 + u1 + 4 * u2 + 2 * u3) * CGAL::cross_product(x3 - x2, x2 - x0)
-            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(x3 - x2, x3 - x1));
+            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(x3 - x2, x3 - x1)
+            );
 
     case MU1_MEAN_CURVATURE_MEASURE:
     {
@@ -129,17 +145,21 @@ typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3
         const typename GT::Vector_3 x3_cross = -CGAL::cross_product(u12, x3);
 
 
-        return (1 / 12.0) * (u0 * (2 * x0_cross - CGAL::cross_product((u2 + u3), x1) + CGAL::cross_product((u1 + u3), x2) + x3_cross)
+        return (1 / 12.0) * (
+              u0 * (2 * x0_cross - CGAL::cross_product((u2 + u3), x1) + CGAL::cross_product((u1 + u3), x2) + x3_cross)
             + u1 * (CGAL::cross_product((u2 + u3), x0) + 2 * x1_cross + x2_cross - CGAL::cross_product((u0 + u2), x3))
-            + u2 * (CGAL::cross_product(-(u1 + u3), x0) + x1_cross + 2 * x2_cross + CGAL::cross_product((u0 + u1), x3))
-            + u3 * (x0_cross + CGAL::cross_product((u0 + u2), x1) - CGAL::cross_product((u0 + u1), x2) + 2 * x3_cross));
+            + u2 * (-CGAL::cross_product((u1 + u3), x0) + x1_cross + 2 * x2_cross + CGAL::cross_product((u0 + u1), x3))
+            + u3 * (x0_cross + CGAL::cross_product((u0 + u2), x1) - CGAL::cross_product((u0 + u1), x2) + 2 * x3_cross)
+            );
     }
     case MU2_GAUSSIAN_CURVATURE_MEASURE:
 
-        return (1 / 36.0) * ((4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(u1 - u0, u2 - u0)
+        return (1 / 36.0) * (
+              (4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(u1 - u0, u2 - u0)
             + (2 * u0 + 4 * u1 + u2 + 2 * u3) * CGAL::cross_product(u1 - u0, u3 - u1)
             + (2 * u0 + u1 + 4 * u2 + 2 * u3) * CGAL::cross_product(u3 - u2, u2 - u0)
-            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(u3 - u2, u3 - u1));
+            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(u3 - u2, u3 - u1)
+            );
 
     default: return 0;
     }
@@ -158,14 +178,17 @@ typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3
 * @param mu_i an enum for choosing between computing the area measure,
 * the mean curvature measure, or the gaussian curvature measure.
 *
-* @return a scalar of type GT::FT. This is the value of the interpolated corrected measure of the given face.
+* @return a scalar of type GT::FT. 
+* This is the value of the interpolated corrected measure of the given face.
 *
 * @see `interpolated_corrected_measure_triangle()`
 * @see `interpolated_corrected_measure_quad()`
 * @see `interpolated_corrected_measure_mesh()`
 */
 template<typename GT>
-typename GT::FT interpolated_corrected_measure_face(const std::vector<typename GT::Vector_3>& x, const std::vector<typename GT::Vector_3>& u, const Curvature_measure_index mu_i)
+typename GT::FT interpolated_corrected_measure_face(const std::vector<typename GT::Vector_3>& x,
+                                                    const std::vector<typename GT::Vector_3>& u,
+                                                    const Curvature_measure_index mu_i)
 {
     std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
@@ -188,11 +211,13 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
         typename GT::FT mu0 = 0;
 
         // getting barycenter of points
-        typename GT::Vector_3 xm = std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+        typename GT::Vector_3 xm = 
+            std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
         xm /= n;
 
         // getting unit average normal of points
-        typename GT::Vector_3 um = std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+        typename GT::Vector_3 um = 
+            std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
         um /= sqrt(um * um);
 
         // summing each triangle's measure after triangulation by barycenter split.
@@ -218,25 +243,29 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 *
 * @param pmesh the polygon mesh
 * @param fmm (face measure map) the property map used for storing the computed interpolated corrected measure
-* @param mu_i an enum for choosing between computing the area measure, the mean curvature measure or the gaussian curvature measure
+* @param mu_i an enum for choosing between computing 
+*             the area measure, the mean curvature measure or the gaussian curvature measure
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
 * \cgalNamedParamsBegin
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*     \cgalParamType{a class model of `ReadablePropertyMap` with 
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `%Point_3` as value type}
 *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
-*                     must be available in `PolygonMesh`.}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_normal_map}
 *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*     \cgalParamType{a class model of `ReadablePropertyMap` with 
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `%Vector_3` as value type}
-*     \cgalParamDefault{`TODO`}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals should be computed inside the function body.}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals should be
+*                     computed inside the function body.}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
@@ -246,11 +275,10 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 template<typename PolygonMesh, typename FaceMeasureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void
-    interpolated_corrected_measure_mesh(
-        const PolygonMesh& pmesh,
-        FaceMeasureMap fmm,
-        const Curvature_measure_index mu_i,
-        const NamedParameters& np = parameters::default_values())
+    interpolated_corrected_measure_mesh(const PolygonMesh& pmesh,
+                                        FaceMeasureMap fmm,
+                                        const Curvature_measure_index mu_i,
+                                        const NamedParameters& np = parameters::default_values())
 {
 
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;

From 66a26246412d9922610d380c37da5623c432dc69 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 25 Jul 2022 13:31:07 +0200
Subject: [PATCH 0017/1398] minor doc fix

making GT::FT back ticked
---
 .../interpolated_corrected_curvature_measures.h           | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index aae957dc0159..2409eab42b74 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -44,7 +44,7 @@ enum Curvature_measure_index {
 * @param mu_i an enum for choosing between computing the area measure,
 * the mean curvature measure, or the gaussian curvature measure.
 *
-* @return a scalar of type GT::FT. 
+* @return a scalar of type `GT::FT`. 
 * This is the value of the interpolated corrected measure of the given triangle.
 *
 * @see `interpolated_corrected_measure_face()`
@@ -104,7 +104,7 @@ typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vecto
 * @param mu_i an enum for choosing between computing the area measure,
 * the mean curvature measure, or the gaussian curvature measure.
 *
-* @return a scalar of type GT::FT. 
+* @return a scalar of type `GT::FT`. 
 * This is the value of the interpolated corrected measure of the given triangle.
 *
 * @see `interpolated_corrected_measure_face()`
@@ -178,7 +178,7 @@ typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3
 * @param mu_i an enum for choosing between computing the area measure,
 * the mean curvature measure, or the gaussian curvature measure.
 *
-* @return a scalar of type GT::FT. 
+* @return a scalar of type `GT::FT`. 
 * This is the value of the interpolated corrected measure of the given face.
 *
 * @see `interpolated_corrected_measure_triangle()`
@@ -238,7 +238,7 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 *
 * @tparam PolygonMesh a model of `FaceGraph`
 * @tparam FaceMeasureMap a a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and GT::FT as value type.
+* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `GT::FT` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
 * @param pmesh the polygon mesh

From 41be3688ae6a0682ad03db7f22a2bb5a215b4a7b Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 26 Jul 2022 19:32:17 +0200
Subject: [PATCH 0018/1398] Mean and Gaussian Curvatures + Visualizer (Still
 wip)

---
 .../interpolated_corrected_curvatures.cpp     |  35 +--
 ...nterpolated_corrected_curvature_measures.h | 224 +++++++++++++++++-
 .../Display/Display_property_plugin.cpp       | 116 +++------
 .../internal/parameters_interface.h           |   1 +
 4 files changed, 259 insertions(+), 117 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index 505d43286451..4480366bc2b0 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -33,35 +33,20 @@ int main(int argc, char* argv[])
     return EXIT_FAILURE;
   }
 
-  vertexVectorMap_tag vnm_init;
-  boost::associative_property_map <vertexVectorMap_tag> vnm(vnm_init);
-
-  PMP::compute_vertex_normals(g1, vnm);
-
-  FaceMeasureMap_tag mu0_init, mu1_init, mu2_init;
+  FaceMeasureMap_tag mean_curvature_init, gaussian_curvature_init;
   boost::associative_property_map<FaceMeasureMap_tag>
-      mu0_map(mu0_init), mu1_map(mu1_init), mu2_map(mu2_init);
+      mean_curvature_map(mean_curvature_init), gaussian_curvature_map(gaussian_curvature_init);
 
-  PMP::interpolated_corrected_measure_mesh(
+  PMP::interpolated_corrected_mean_curvature(
       g1,
-      mu0_map,
-      PMP::MU0_AREA_MEASURE);
-
-  PMP::interpolated_corrected_measure_mesh(
-      g1,
-      mu1_map,
-      PMP::MU1_MEAN_CURVATURE_MEASURE,
-      CGAL::parameters::vertex_normal_map(vnm));
-
-  PMP::interpolated_corrected_measure_mesh(
+      mean_curvature_map
+      );
+  PMP::interpolated_corrected_gaussian_curvature(
       g1,
-      mu2_map,
-      PMP::MU2_GAUSSIAN_CURVATURE_MEASURE,
-      CGAL::parameters::vertex_normal_map(vnm));
+      gaussian_curvature_map
+  );
 
   for (face_descriptor f: g1.faces())
-      std::cout << f.idx() << ": "
-          << get(mu0_map, f) << ", "
-          << get(mu1_map, f) << ", "
-          << get(mu2_map, f) << ", " << "\n";
+      std::cout << f.idx() << ": HC = " << get(mean_curvature_map, f) 
+                           << ", GC = " << get(gaussian_curvature_map, f) << "\n";
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 2409eab42b74..737a2525ebd7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -11,6 +11,8 @@
 #include <CGAL/property_map.h>
 
 #include <numeric>
+#include <queue>
+#include <unordered_set>
 
 namespace CGAL {
 
@@ -210,8 +212,8 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
     else {
         typename GT::FT mu0 = 0;
 
-        // getting barycenter of points
-        typename GT::Vector_3 xm = 
+        // getting center of points
+        typename GT::Vector_3 xm =
             std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
         xm /= n;
 
@@ -300,31 +302,229 @@ template<typename PolygonMesh, typename FaceMeasureMap,
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
             get_const_property_map(CGAL::vertex_point, pmesh));
 
-    // TODO - handle if vnm is not provided
-    VNM vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map), get(Vector_map_tag(), pmesh));
+    VNM vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+                               get(Vector_map_tag(), pmesh));
 
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
         compute_vertex_normals(pmesh, vnm, np);
 
     for (face_descriptor f : faces(pmesh))
     {
-        halfedge_descriptor h_start = pmesh.halfedge(f);
-        halfedge_descriptor h_iter = h_start;
-
         std::vector<typename GT::Vector_3> x;
         std::vector<typename GT::Vector_3> u;
 
-        // looping over vertices in face
-        do {
-            vertex_descriptor v = source(h_iter, pmesh);
+        for (vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
+        {
             typename GT::Point_3 p = get(vpm, v);
             x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
             u.push_back(get(vnm, v));
-            h_iter = next(h_iter, pmesh);
-        } while (h_iter != h_start);
+        }
 
         put(fmm, f, interpolated_corrected_measure_face<GT>(x, u, mu_i));
     }
 }
+
+//
+//
+//template<typename GT>
+//typename GT::FT triangle_in_ball_ratio_1(const typename GT::Vector_3 x1,
+//                                         const typename GT::Vector_3 x2,
+//                                         const typename GT::Vector_3 x3,
+//                                         const typename GT::FT r,
+//                                         const typename GT::Vector_3 c,
+//                                         const std::size_t res = 3)
+//{
+//    const typename GT::FT R = r * r;
+//    const typename GT::FT acc = 1.0 / res;
+//    std::size_t samples_in = 0;
+//    for (GT::FT alpha = acc / 3; alpha < 1; alpha += acc)
+//        for (GT::FT beta = acc / 3; beta < 1 - alpha; beta += acc)
+//        {
+//            if ((alpha * x1 + beta * x2 + (1 - alpha - beta) * x3 - c).squared_length() < R)
+//                samples_in++;
+//        }
+//    return samples_in / (typename GT::FT)(res * (res + 1) / 2);
+//}
+
+
+template<typename GT>
+typename GT::FT face_in_ball_ratio_2(const std::vector<typename GT::Vector_3>& x,
+                                     const typename GT::FT r,
+                                     const typename GT::Vector_3 c)
+{
+    std::size_t n = x.size();
+
+    // getting center of points
+    typename GT::Vector_3 xm =
+        std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+    xm /= n;
+
+    typename GT::FT d_min = (xm - c).squared_length();
+    typename GT::FT d_max = d_min;
+
+    for (const typename GT::Vector_3 xi : x)
+    {
+        const typename GT::FT d_sq = (xi - c).squared_length();
+        d_max = std::max(d_sq, d_max);
+        d_min = std::min(d_sq, d_min);
+    }
+
+    if (d_max <= r * r) return 1.0;
+    else if (r * r <= d_min) return 0.0;
+
+    d_max = sqrt(d_max);
+    d_min = sqrt(d_min);
+
+    return (r - d_min) / (d_max - d_min);
+}
+
+template<typename PolygonMesh, typename FaceMeasureMap,
+    typename NamedParameters = parameters::Default_named_parameters>
+    void expand_interpolated_corrected_measure_face(const PolygonMesh& pmesh,
+        FaceMeasureMap fmm,
+        const typename boost::graph_traits<PolygonMesh>::face_descriptor f,
+        const NamedParameters& np = parameters::default_values())
+{
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+
+    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+
+    const typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT 
+        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0.01);
+
+    if (r < 0.000001)
+        return;
+
+    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
+        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+            get_const_property_map(CGAL::vertex_point, pmesh));
+
+
+    std::queue<face_descriptor> bfs_q;
+    std::unordered_set<face_descriptor> bfs_v;
+
+    //get face center c
+    typename GT::Vector_3 c;
+    for (vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
+    {
+        typename GT::Point_3 p = get(vpm, v);
+        c += typename GT::Vector_3(p.x(), p.y(), p.z());
+    }
+    c /= degree(f, pmesh);
+
+    GT::FT corrected_mui = 0;
+
+    bfs_q.push(f);
+    bfs_v.insert(f);
+
+    while (!bfs_q.empty()) {
+        face_descriptor fi = bfs_q.front();
+        bfs_q.pop();
+
+        // looping over vertices in face to get point coordinates
+        std::vector<typename GT::Vector_3> x;
+        for (vertex_descriptor v : vertices_around_face(halfedge(fi, pmesh), pmesh))
+        {
+            typename GT::Point_3 p = get(vpm, v);
+            x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
+        }
+
+        const typename GT::FT f_ratio = face_in_ball_ratio_2<GT>(x, r, c);
+
+        if (f_ratio > 0.000001)
+        {
+            corrected_mui += f_ratio * get(fmm, fi);
+            for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+            {
+                if (bfs_v.find(fj) == bfs_v.end())
+                {
+                    bfs_q.push(fj);
+                    bfs_v.insert(fj);
+                }
+            }
+        }
+    }
+
+    put(fmm, f, corrected_mui);
+}
+
+//template<typename PolygonMesh, typename FaceMeasureMap,
+//    typename NamedParameters = parameters::Default_named_parameters>
+//    void expand_interpolated_corrected_measure_mesh(const PolygonMesh& pmesh,
+//        FaceMeasureMap fmm,
+//        const NamedParameters& np = parameters::default_values())
+//{
+//    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+//    for (face_descriptor f : faces(pmesh))
+//        expand_interpolated_corrected_measure_face(pmesh, fmm, f, np);
+//}
+
+template<typename PolygonMesh, typename FaceCurvatureMap,
+    typename NamedParameters = parameters::Default_named_parameters>
+    void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
+        FaceCurvatureMap fcm,
+        const NamedParameters& np = parameters::default_values())
+{
+    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef std::unordered_map<face_descriptor, GT::FT> FaceMeasureMap_tag;
+
+    FaceMeasureMap_tag mu0_init, mu1_init;
+    boost::associative_property_map<FaceMeasureMap_tag>
+        mu0_map(mu0_init), mu1_map(mu1_init);
+
+    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE);
+    interpolated_corrected_measure_mesh(pmesh, mu1_map, MU1_MEAN_CURVATURE_MEASURE);
+
+    for (face_descriptor f : faces(pmesh))
+    {
+        expand_interpolated_corrected_measure_face(pmesh, mu0_map, f, np);
+        expand_interpolated_corrected_measure_face(pmesh, mu1_map, f, np);
+
+        GT::FT f_mu0 = get(mu0_map, f);
+            if (f_mu0 > 0.000001)
+                put(fcm, f, 0.5 * get(mu1_map, f) / get(mu0_map, f));
+            else
+                put(fcm, f, 0);
+    }
+    
+}
+
+template<typename PolygonMesh, typename FaceCurvatureMap,
+    typename NamedParameters = parameters::Default_named_parameters>
+    void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
+        FaceCurvatureMap fcm,
+        const NamedParameters& np = parameters::default_values())
+{
+    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef std::unordered_map<face_descriptor, GT::FT> FaceMeasureMap_tag;
+
+    FaceMeasureMap_tag mu0_init, mu2_init;
+    boost::associative_property_map<FaceMeasureMap_tag>
+        mu0_map(mu0_init), mu2_map(mu2_init);
+
+    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE);
+    interpolated_corrected_measure_mesh(pmesh, mu2_map, MU2_GAUSSIAN_CURVATURE_MEASURE);
+
+    for (face_descriptor f : faces(pmesh))
+    {
+        expand_interpolated_corrected_measure_face(pmesh, mu0_map, f, np);
+        expand_interpolated_corrected_measure_face(pmesh, mu2_map, f, np);
+
+        GT::FT f_mu0 = get(mu0_map, f);
+        if(f_mu0 > 0.000001)
+            put(fcm, f, get(mu2_map, f) / f_mu0);
+        else
+            put(fcm, f, 0);
+    }
+
+}
+
+
+
 }
 }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 1ea1394649c2..88d86966f1d7 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -533,9 +533,8 @@ private Q_SLOTS:
         dock_widget->propertyBox->addItem("Scaled Jacobian");
         dock_widget->propertyBox->addItem("Heat Intensity");
         dock_widget->propertyBox->addItem("Heat Intensity (Intrinsic Delaunay)");
-        dock_widget->propertyBox->addItem("corrected area density");
-        dock_widget->propertyBox->addItem("corrected mean curvature density");
-        dock_widget->propertyBox->addItem("corrected gaussian curvature density");
+        dock_widget->propertyBox->addItem("Interpolated Corrected Mean Curvature");
+        dock_widget->propertyBox->addItem("Interpolated Corrected Gaussian Curvature");
       detectSMScalarProperties(sm_item->face_graph());
 
     }
@@ -610,15 +609,11 @@ private Q_SLOTS:
         return;
       sm_item->setRenderingMode(Gouraud);
       break;
-    case 4: // corrected area density
-        displayInterpolatedCurvatureMeasure(sm_item, PMP::MU0_AREA_MEASURE);
-        sm_item->setRenderingMode(Flat);
-        break;
-    case 5: // corrected mean curvature density
+    case 4: // Interpolated Corrected Mean Curvature
         displayInterpolatedCurvatureMeasure(sm_item, PMP::MU1_MEAN_CURVATURE_MEASURE);
         sm_item->setRenderingMode(Flat);
         break;
-    case 6: // corrected gaussian curvature density
+    case 5: // Interpolated Corrected Gaussian Curvature
         displayInterpolatedCurvatureMeasure(sm_item, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE);
         sm_item->setRenderingMode(Flat);
         break;
@@ -657,15 +652,11 @@ private Q_SLOTS:
       if(does_exist)
         sm_item->face_graph()->remove_property_map(pmap);
       std::tie(pmap, does_exist) =
-          sm_item->face_graph()->property_map<face_descriptor, double>("f:corrected_area_density");
-      if (does_exist)
-          sm_item->face_graph()->remove_property_map(pmap);
-      std::tie(pmap, does_exist) =
-          sm_item->face_graph()->property_map<face_descriptor, double>("f:corrected_mean_curvature_density");
+          sm_item->face_graph()->property_map<face_descriptor, double>("f:interpolated_corrected_mean_curvature");
       if (does_exist)
           sm_item->face_graph()->remove_property_map(pmap);
       std::tie(pmap, does_exist) =
-          sm_item->face_graph()->property_map<face_descriptor, double>("f:corrected_gaussian_curvature_density");
+          sm_item->face_graph()->property_map<face_descriptor, double>("f:interpolated_corrected_gaussian_curvature");
       if (does_exist)
           sm_item->face_graph()->remove_property_map(pmap);
     });
@@ -707,16 +698,12 @@ private Q_SLOTS:
         dock_widget->zoomToMaxButton->setEnabled(jacobian_max.count(sm_item)>0);
         break;
       case 4:
-          dock_widget->zoomToMinButton->setEnabled(mu0_min.count(sm_item) > 0);
-          dock_widget->zoomToMaxButton->setEnabled(mu0_max.count(sm_item) > 0);
+          dock_widget->zoomToMinButton->setEnabled(mean_curvature_min.count(sm_item) > 0);
+          dock_widget->zoomToMaxButton->setEnabled(mean_curvature_max.count(sm_item) > 0);
           break;
       case 5:
-          dock_widget->zoomToMinButton->setEnabled(mu1_min.count(sm_item) > 0);
-          dock_widget->zoomToMaxButton->setEnabled(mu1_max.count(sm_item) > 0);
-          break;
-      case 6:
-          dock_widget->zoomToMinButton->setEnabled(mu2_min.count(sm_item) > 0);
-          dock_widget->zoomToMaxButton->setEnabled(mu2_max.count(sm_item) > 0);
+          dock_widget->zoomToMinButton->setEnabled(gaussian_curvature_min.count(sm_item) > 0);
+          dock_widget->zoomToMaxButton->setEnabled(gaussian_curvature_max.count(sm_item) > 0);
           break;
       default:
         break;
@@ -744,23 +731,17 @@ private Q_SLOTS:
     {
       smesh.remove_property_map(angles);
     }
-    SMesh::Property_map<face_descriptor, double> mu0;
-    std::tie(mu0, found) = smesh.property_map<face_descriptor, double>("f:corrected_area_density");
+    SMesh::Property_map<face_descriptor, double> mean_curvature;
+    std::tie(mean_curvature, found) = smesh.property_map<face_descriptor, double>("f:interpolated_corrected_mean_curvature");
     if (found)
     {
-        smesh.remove_property_map(mu0);
+        smesh.remove_property_map(mean_curvature);
     }
-    SMesh::Property_map<face_descriptor, double> mu1;
-    std::tie(mu1, found) = smesh.property_map<face_descriptor, double>("f:corrected_mean_curvature_density");
+    SMesh::Property_map<face_descriptor, double> gaussian_curvature;
+    std::tie(gaussian_curvature, found) = smesh.property_map<face_descriptor, double>("f:interpolated_corrected_gaussian_curvature");
     if (found)
     {
-        smesh.remove_property_map(mu0);
-    }
-    SMesh::Property_map<face_descriptor, double> mu2;
-    std::tie(mu2, found) = smesh.property_map<face_descriptor, double>("f:corrected_gaussian_curvature_density");
-    if (found)
-    {
-        smesh.remove_property_map(mu0);
+        smesh.remove_property_map(gaussian_curvature);
     }
   }
 
@@ -804,20 +785,20 @@ private Q_SLOTS:
 
   void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item, PMP::Curvature_measure_index mu_index)
   {
-    std::vector<std::string> tied_map = { 
-        "f:corrected_area_density",
-        "f:corrected_mean_curvature_density",
-        "f:corrected_gaussian_curvature_density" 
-    };
+    std::string tied_string = (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)? 
+        "f:interpolated_corrected_mean_curvature": "f:interpolated_corrected_gaussian_curvature";
     SMesh& smesh = *item->face_graph();
     //compute once and store the value per face
     bool non_init;
     SMesh::Property_map<face_descriptor, double> mu_i_map;
         std::tie(mu_i_map, non_init) = 
-            smesh.add_property_map<face_descriptor, double>(tied_map[mu_index], 0);
+            smesh.add_property_map<face_descriptor, double>(tied_string, 0);
     if (non_init)
     {
-        PMP::interpolated_corrected_measure_mesh(smesh, mu_i_map, mu_index);
+        if (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)
+            PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map);
+        else
+            PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map);
 
         double res_min = ARBITRARY_DBL_MAX,
             res_max = -ARBITRARY_DBL_MAX;
@@ -837,24 +818,20 @@ private Q_SLOTS:
         }
         switch (mu_index)
         {
-        case PMP::MU0_AREA_MEASURE:
-            mu0_max[item] = std::make_pair(res_max, max_index);
-            mu0_min[item] = std::make_pair(res_min, min_index);
-            break;
         case PMP::MU1_MEAN_CURVATURE_MEASURE:
-            mu1_max[item] = std::make_pair(res_max, max_index);
-            mu1_min[item] = std::make_pair(res_min, min_index);
+            mean_curvature_max[item] = std::make_pair(res_max, max_index);
+            mean_curvature_min[item] = std::make_pair(res_min, min_index);
             break;
         case PMP::MU2_GAUSSIAN_CURVATURE_MEASURE:
-            mu2_max[item] = std::make_pair(res_max, max_index);
-            mu2_min[item] = std::make_pair(res_min, min_index);
+            gaussian_curvature_max[item] = std::make_pair(res_max, max_index);
+            gaussian_curvature_min[item] = std::make_pair(res_min, min_index);
             break;
         }
 
         connect(item, &Scene_surface_mesh_item::itemChanged,
             this, &DisplayPropertyPlugin::resetProperty);
     }
-        treat_sm_property<face_descriptor>(tied_map[mu_index], item->face_graph());
+        treat_sm_property<face_descriptor>(tied_string, item->face_graph());
   }
 
 
@@ -1159,7 +1136,6 @@ private Q_SLOTS:
       case 1:
       case 4:
       case 5:
-      case 6:
         dock_widget->groupBox->  setEnabled(true);
         dock_widget->groupBox_3->setEnabled(true);
 
@@ -1223,7 +1199,7 @@ private Q_SLOTS:
     case 4:
     {
         ::zoomToId(*item->face_graph(),
-            QString("f%1").arg(mu0_min[item].second),
+            QString("f%1").arg(mean_curvature_min[item].second),
             getActiveViewer(),
             dummy_fd,
             dummy_p);
@@ -1232,20 +1208,12 @@ private Q_SLOTS:
     case 5:
     {
         ::zoomToId(*item->face_graph(),
-            QString("f%1").arg(mu1_min[item].second),
+            QString("f%1").arg(gaussian_curvature_min[item].second),
             getActiveViewer(),
             dummy_fd,
             dummy_p);
     }
     break;
-    case 6:
-    {
-        ::zoomToId(*item->face_graph(),
-            QString("f%1").arg(mu2_min[item].second),
-            getActiveViewer(),
-            dummy_fd,
-            dummy_p);
-    }
     break;
       break;
     default:
@@ -1284,7 +1252,7 @@ private Q_SLOTS:
     case 4:
     {
         ::zoomToId(*item->face_graph(),
-            QString("f%1").arg(mu0_max[item].second),
+            QString("f%1").arg(mean_curvature_max[item].second),
             getActiveViewer(),
             dummy_fd,
             dummy_p);
@@ -1293,21 +1261,12 @@ private Q_SLOTS:
     case 5:
     {
         ::zoomToId(*item->face_graph(),
-            QString("f%1").arg(mu1_max[item].second),
+            QString("f%1").arg(gaussian_curvature_max[item].second),
             getActiveViewer(),
             dummy_fd,
             dummy_p);
     }
     break;
-    case 6:
-    {
-        ::zoomToId(*item->face_graph(),
-            QString("f%1").arg(mu2_max[item].second),
-            getActiveViewer(),
-            dummy_fd,
-            dummy_p);
-    }
-      break;
     default:
       break;
     }
@@ -1598,14 +1557,11 @@ private Q_SLOTS:
   std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > angles_min;
   std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > angles_max;
 
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu0_min;
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu0_max;
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mean_curvature_min;
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mean_curvature_max;
 
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu1_min;
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu1_max;
-  
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu2_min;
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mu2_max;
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > gaussian_curvature_min;
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > gaussian_curvature_max;
 
   std::unordered_map<Scene_surface_mesh_item*, Vertex_source_map> is_source;
 
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index c224b4982513..dd4785ab7e8a 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -87,6 +87,7 @@ CGAL_add_named_parameter(number_of_points_per_edge_t, number_of_points_per_edge,
 CGAL_add_named_parameter(number_of_points_on_edges_t, number_of_points_on_edges, number_of_points_on_edges)
 CGAL_add_named_parameter(nb_points_per_area_unit_t, nb_points_per_area_unit, number_of_points_per_area_unit)
 CGAL_add_named_parameter(nb_points_per_distance_unit_t, nb_points_per_distance_unit, number_of_points_per_distance_unit)
+CGAL_add_named_parameter(ball_radius_t, ball_radius, ball_radius)
 CGAL_add_named_parameter(outward_orientation_t, outward_orientation, outward_orientation)
 CGAL_add_named_parameter(overlap_test_t, overlap_test, do_overlap_test_of_bounded_sides)
 CGAL_add_named_parameter(preserve_genus_t, preserve_genus, preserve_genus)

From 48ff36dcc94d621d27a1fde09811159e3963eb3a Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 27 Jul 2022 12:42:38 +0200
Subject: [PATCH 0019/1398] fixed some missing typenames

---
 .../interpolated_corrected_curvature_measures.h      | 12 +++++-------
 1 file changed, 5 insertions(+), 7 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 737a2525ebd7..9f9a6c0fc14f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -415,7 +415,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     }
     c /= degree(f, pmesh);
 
-    GT::FT corrected_mui = 0;
+    typename GT::FT corrected_mui = 0;
 
     bfs_q.push(f);
     bfs_v.insert(f);
@@ -470,7 +470,7 @@ template<typename PolygonMesh, typename FaceCurvatureMap,
 {
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-    typedef std::unordered_map<face_descriptor, GT::FT> FaceMeasureMap_tag;
+    typedef std::unordered_map<face_descriptor, typename GT::FT> FaceMeasureMap_tag;
 
     FaceMeasureMap_tag mu0_init, mu1_init;
     boost::associative_property_map<FaceMeasureMap_tag>
@@ -484,13 +484,12 @@ template<typename PolygonMesh, typename FaceCurvatureMap,
         expand_interpolated_corrected_measure_face(pmesh, mu0_map, f, np);
         expand_interpolated_corrected_measure_face(pmesh, mu1_map, f, np);
 
-        GT::FT f_mu0 = get(mu0_map, f);
+        const typename GT::FT f_mu0 = get(mu0_map, f);
             if (f_mu0 > 0.000001)
                 put(fcm, f, 0.5 * get(mu1_map, f) / get(mu0_map, f));
             else
                 put(fcm, f, 0);
     }
-    
 }
 
 template<typename PolygonMesh, typename FaceCurvatureMap,
@@ -501,7 +500,7 @@ template<typename PolygonMesh, typename FaceCurvatureMap,
 {
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-    typedef std::unordered_map<face_descriptor, GT::FT> FaceMeasureMap_tag;
+    typedef std::unordered_map<face_descriptor, typename GT::FT> FaceMeasureMap_tag;
 
     FaceMeasureMap_tag mu0_init, mu2_init;
     boost::associative_property_map<FaceMeasureMap_tag>
@@ -515,13 +514,12 @@ template<typename PolygonMesh, typename FaceCurvatureMap,
         expand_interpolated_corrected_measure_face(pmesh, mu0_map, f, np);
         expand_interpolated_corrected_measure_face(pmesh, mu2_map, f, np);
 
-        GT::FT f_mu0 = get(mu0_map, f);
+        const typename GT::FT f_mu0 = get(mu0_map, f);
         if(f_mu0 > 0.000001)
             put(fcm, f, get(mu2_map, f) / f_mu0);
         else
             put(fcm, f, 0);
     }
-
 }
 
 

From 6b985bfeb86efd80958f42409fdd9fae5f2b5539 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 27 Jul 2022 13:25:35 +0200
Subject: [PATCH 0020/1398] for boundary faces

---
 .../Curvatures/interpolated_corrected_curvature_measures.h      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 9f9a6c0fc14f..3528ffed8a43 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -439,7 +439,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
             corrected_mui += f_ratio * get(fmm, fi);
             for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
             {
-                if (bfs_v.find(fj) == bfs_v.end())
+                if (bfs_v.find(fj) == bfs_v.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
                 {
                     bfs_q.push(fj);
                     bfs_v.insert(fj);

From 8d2a5bcf82a026a0c7aa8399dc024c96cf40b0d9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Jul 2022 13:40:25 +0200
Subject: [PATCH 0021/1398] add license header

---
 .../interpolated_corrected_curvature_measures.h     | 13 +++++++++++++
 1 file changed, 13 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 9f9a6c0fc14f..a3c3d9f16e2c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -1,3 +1,16 @@
+// Copyright (c) 2022 GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+//
+// Author(s)     : Hossam Saeed
+//
+
 #ifndef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
 #define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
 #endif

From c99008dde1ad696b2e9eea65081908f325e5ac8d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Jul 2022 13:40:33 +0200
Subject: [PATCH 0022/1398] trailing whitespaces

---
 .../PackageDescription.txt                    |  2 +-
 .../interpolated_corrected_curvatures.cpp     |  2 +-
 ...nterpolated_corrected_curvature_measures.h | 28 +++++++++----------
 .../Display/Display_property_plugin.cpp       |  4 +--
 4 files changed, 18 insertions(+), 18 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index c25cfb8490d3..d0cab92d6a89 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -16,7 +16,7 @@
 /// Functions to triangulate faces, and to refine and fair regions of a polygon mesh.
 /// \ingroup PkgPolygonMeshProcessingRef
 
-/// \defgroup PMP_corrected_curvatures_grp Corrected Curvature Computation 
+/// \defgroup PMP_corrected_curvatures_grp Corrected Curvature Computation
 /// Functions to compute the corrected curvatures of a polygon mesh.
 /// \ingroup PkgPolygonMeshProcessingRef
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index 4480366bc2b0..acf4591fe392 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -47,6 +47,6 @@ int main(int argc, char* argv[])
   );
 
   for (face_descriptor f: g1.faces())
-      std::cout << f.idx() << ": HC = " << get(mean_curvature_map, f) 
+      std::cout << f.idx() << ": HC = " << get(mean_curvature_map, f)
                            << ", GC = " << get(gaussian_curvature_map, f) << "\n";
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index a3c3d9f16e2c..f618533d2bc9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -59,7 +59,7 @@ enum Curvature_measure_index {
 * @param mu_i an enum for choosing between computing the area measure,
 * the mean curvature measure, or the gaussian curvature measure.
 *
-* @return a scalar of type `GT::FT`. 
+* @return a scalar of type `GT::FT`.
 * This is the value of the interpolated corrected measure of the given triangle.
 *
 * @see `interpolated_corrected_measure_face()`
@@ -69,9 +69,9 @@ template<typename GT>
 typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vector_3 x0,
                                                         const typename GT::Vector_3 x1,
                                                         const typename GT::Vector_3 x2,
-                                                        const typename GT::Vector_3 u0, 
-                                                        const typename GT::Vector_3 u1, 
-                                                        const typename GT::Vector_3 u2, 
+                                                        const typename GT::Vector_3 u0,
+                                                        const typename GT::Vector_3 u1,
+                                                        const typename GT::Vector_3 u2,
                                                         const Curvature_measure_index mu_i)
 {
     switch (mu_i)
@@ -102,8 +102,8 @@ typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vecto
 * \ingroup PMP_corrected_curvatures_grp
 *
 * computes the interpolated corrected measure of specific quad
-* Note that the vertices 0 to 3 are ordered like this \n 
-* v0  _  v1 \n 
+* Note that the vertices 0 to 3 are ordered like this \n
+* v0  _  v1 \n
 * v2 |_| v3
 *
 * @tparam GT is the geometric traits class.
@@ -119,7 +119,7 @@ typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vecto
 * @param mu_i an enum for choosing between computing the area measure,
 * the mean curvature measure, or the gaussian curvature measure.
 *
-* @return a scalar of type `GT::FT`. 
+* @return a scalar of type `GT::FT`.
 * This is the value of the interpolated corrected measure of the given triangle.
 *
 * @see `interpolated_corrected_measure_face()`
@@ -138,7 +138,7 @@ typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3
 {
     // x0  _  x1
     // x2 |_| x3
-    
+
     switch (mu_i)
     {
     case MU0_AREA_MEASURE:
@@ -193,7 +193,7 @@ typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3
 * @param mu_i an enum for choosing between computing the area measure,
 * the mean curvature measure, or the gaussian curvature measure.
 *
-* @return a scalar of type `GT::FT`. 
+* @return a scalar of type `GT::FT`.
 * This is the value of the interpolated corrected measure of the given face.
 *
 * @see `interpolated_corrected_measure_triangle()`
@@ -231,7 +231,7 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
         xm /= n;
 
         // getting unit average normal of points
-        typename GT::Vector_3 um = 
+        typename GT::Vector_3 um =
             std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
         um /= sqrt(um * um);
 
@@ -258,14 +258,14 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 *
 * @param pmesh the polygon mesh
 * @param fmm (face measure map) the property map used for storing the computed interpolated corrected measure
-* @param mu_i an enum for choosing between computing 
+* @param mu_i an enum for choosing between computing
 *             the area measure, the mean curvature measure or the gaussian curvature measure
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
 * \cgalNamedParamsBegin
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with 
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `%Point_3` as value type}
 *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
@@ -275,7 +275,7 @@ typename GT::FT interpolated_corrected_measure_face(const std::vector<typename G
 *
 *   \cgalParamNBegin{vertex_normal_map}
 *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with 
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `%Vector_3` as value type}
 *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
@@ -405,7 +405,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
 
-    const typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT 
+    const typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
         r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0.01);
 
     if (r < 0.000001)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 88d86966f1d7..13f704774e38 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -785,13 +785,13 @@ private Q_SLOTS:
 
   void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item, PMP::Curvature_measure_index mu_index)
   {
-    std::string tied_string = (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)? 
+    std::string tied_string = (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)?
         "f:interpolated_corrected_mean_curvature": "f:interpolated_corrected_gaussian_curvature";
     SMesh& smesh = *item->face_graph();
     //compute once and store the value per face
     bool non_init;
     SMesh::Property_map<face_descriptor, double> mu_i_map;
-        std::tie(mu_i_map, non_init) = 
+        std::tie(mu_i_map, non_init) =
             smesh.add_property_map<face_descriptor, double>(tied_string, 0);
     if (non_init)
     {

From 1c42a61fa11dc97e0c4629a4c73600e1356a518c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Jul 2022 14:26:28 +0200
Subject: [PATCH 0023/1398] use traits functor

---
 ...nterpolated_corrected_curvature_measures.h | 45 ++++++++++---------
 1 file changed, 23 insertions(+), 22 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index f618533d2bc9..415737e4991a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -74,25 +74,26 @@ typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vecto
                                                         const typename GT::Vector_3 u2,
                                                         const Curvature_measure_index mu_i)
 {
+    GT::Construct_cross_product_3 cross_product;
     switch (mu_i)
     {
     case MU0_AREA_MEASURE:
     {
         const typename GT::Vector_3 um = (u0 + u1 + u2) / 3.0;
 
-        return 0.5 * um * CGAL::cross_product(x1 - x0, x2 - x0);
+        return 0.5 * um * cross_product(x1 - x0, x2 - x0);
     }
     case MU1_MEAN_CURVATURE_MEASURE:
     {
         const typename GT::Vector_3 um = (u0 + u1 + u2) / 3.0;
 
-        return 0.5 * um * (CGAL::cross_product(u2 - u1, x0)
-            + CGAL::cross_product(u0 - u2, x1)
-            + CGAL::cross_product(u1 - u0, x2));
+        return 0.5 * um * (cross_product(u2 - u1, x0)
+            + cross_product(u0 - u2, x1)
+            + cross_product(u1 - u0, x2));
     }
     case MU2_GAUSSIAN_CURVATURE_MEASURE:
 
-        return 0.5 * u0 * CGAL::cross_product(u1, u2);
+        return 0.5 * u0 * cross_product(u1, u2);
 
     default: return 0;
     }
@@ -138,42 +139,42 @@ typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3
 {
     // x0  _  x1
     // x2 |_| x3
-
+    GT::Construct_cross_product_3 cross_product;
     switch (mu_i)
     {
     case MU0_AREA_MEASURE:
 
         return (1 / 36.0) * (
-              (4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(x1 - x0, x2 - x0)
-            + (2 * u0 + 4 * u1 + u2 + 2 * u3) * CGAL::cross_product(x1 - x0, x3 - x1)
-            + (2 * u0 + u1 + 4 * u2 + 2 * u3) * CGAL::cross_product(x3 - x2, x2 - x0)
-            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(x3 - x2, x3 - x1)
+              (4 * u0 + 2 * u1 + 2 * u2 + u3) * cross_product(x1 - x0, x2 - x0)
+            + (2 * u0 + 4 * u1 + u2 + 2 * u3) * cross_product(x1 - x0, x3 - x1)
+            + (2 * u0 + u1 + 4 * u2 + 2 * u3) * cross_product(x3 - x2, x2 - x0)
+            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * cross_product(x3 - x2, x3 - x1)
             );
 
     case MU1_MEAN_CURVATURE_MEASURE:
     {
         const typename GT::Vector_3 u03 = u3 - u0;
         const typename GT::Vector_3 u12 = u2 - u1;
-        const typename GT::Vector_3 x0_cross = CGAL::cross_product(u12, x0);
-        const typename GT::Vector_3 x1_cross = -CGAL::cross_product(u03, x1);
-        const typename GT::Vector_3 x2_cross = CGAL::cross_product(u03, x2);
-        const typename GT::Vector_3 x3_cross = -CGAL::cross_product(u12, x3);
+        const typename GT::Vector_3 x0_cross = cross_product(u12, x0);
+        const typename GT::Vector_3 x1_cross = -cross_product(u03, x1);
+        const typename GT::Vector_3 x2_cross = cross_product(u03, x2);
+        const typename GT::Vector_3 x3_cross = -cross_product(u12, x3);
 
 
         return (1 / 12.0) * (
-              u0 * (2 * x0_cross - CGAL::cross_product((u2 + u3), x1) + CGAL::cross_product((u1 + u3), x2) + x3_cross)
-            + u1 * (CGAL::cross_product((u2 + u3), x0) + 2 * x1_cross + x2_cross - CGAL::cross_product((u0 + u2), x3))
-            + u2 * (-CGAL::cross_product((u1 + u3), x0) + x1_cross + 2 * x2_cross + CGAL::cross_product((u0 + u1), x3))
-            + u3 * (x0_cross + CGAL::cross_product((u0 + u2), x1) - CGAL::cross_product((u0 + u1), x2) + 2 * x3_cross)
+              u0 * (2 * x0_cross - cross_product((u2 + u3), x1) + cross_product((u1 + u3), x2) + x3_cross)
+            + u1 * (cross_product((u2 + u3), x0) + 2 * x1_cross + x2_cross - cross_product((u0 + u2), x3))
+            + u2 * (-cross_product((u1 + u3), x0) + x1_cross + 2 * x2_cross + cross_product((u0 + u1), x3))
+            + u3 * (x0_cross + cross_product((u0 + u2), x1) - cross_product((u0 + u1), x2) + 2 * x3_cross)
             );
     }
     case MU2_GAUSSIAN_CURVATURE_MEASURE:
 
         return (1 / 36.0) * (
-              (4 * u0 + 2 * u1 + 2 * u2 + u3) * CGAL::cross_product(u1 - u0, u2 - u0)
-            + (2 * u0 + 4 * u1 + u2 + 2 * u3) * CGAL::cross_product(u1 - u0, u3 - u1)
-            + (2 * u0 + u1 + 4 * u2 + 2 * u3) * CGAL::cross_product(u3 - u2, u2 - u0)
-            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * CGAL::cross_product(u3 - u2, u3 - u1)
+              (4 * u0 + 2 * u1 + 2 * u2 + u3) * cross_product(u1 - u0, u2 - u0)
+            + (2 * u0 + 4 * u1 + u2 + 2 * u3) * cross_product(u1 - u0, u3 - u1)
+            + (2 * u0 + u1 + 4 * u2 + 2 * u3) * cross_product(u3 - u2, u2 - u0)
+            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * cross_product(u3 - u2, u3 - u1)
             );
 
     default: return 0;

From 12a627e23f2d26e98a6b53228fa4c050cef07d2c Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 27 Jul 2022 15:40:06 +0200
Subject: [PATCH 0024/1398] expanding from and evaluating on vertices instead
 of faces

---
 .../interpolated_corrected_curvatures.cpp     | 15 ++--
 ...nterpolated_corrected_curvature_measures.h | 87 +++++++++++--------
 .../Display/Display_property_plugin.cpp       | 56 ++++++------
 3 files changed, 85 insertions(+), 73 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index 4480366bc2b0..63c0b8df528c 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -17,7 +17,7 @@ typedef CGAL::Surface_mesh<EpicKernel::Point_3> Mesh;
 typedef boost::graph_traits<Mesh>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
 typedef std::unordered_map<face_descriptor, EpicKernel::FT> FaceMeasureMap_tag;
-typedef std::unordered_map<vertex_descriptor, EpicKernel::Vector_3> vertexVectorMap_tag;
+typedef std::unordered_map<vertex_descriptor, EpicKernel::FT> vertexVectorMap_tag;
 
 
 int main(int argc, char* argv[])
@@ -25,7 +25,7 @@ int main(int argc, char* argv[])
   Mesh g1;
   const std::string filename = (argc>1) ?
       argv[1] :
-      CGAL::data_file_path("meshes/small_bunny.obj");
+      CGAL::data_file_path("meshes/cylinder.off");
 
   if(!CGAL::IO::read_polygon_mesh(filename, g1))
   {
@@ -33,8 +33,9 @@ int main(int argc, char* argv[])
     return EXIT_FAILURE;
   }
 
-  FaceMeasureMap_tag mean_curvature_init, gaussian_curvature_init;
-  boost::associative_property_map<FaceMeasureMap_tag>
+
+  vertexVectorMap_tag mean_curvature_init, gaussian_curvature_init;
+  boost::associative_property_map<vertexVectorMap_tag>
       mean_curvature_map(mean_curvature_init), gaussian_curvature_map(gaussian_curvature_init);
 
   PMP::interpolated_corrected_mean_curvature(
@@ -46,7 +47,7 @@ int main(int argc, char* argv[])
       gaussian_curvature_map
   );
 
-  for (face_descriptor f: g1.faces())
-      std::cout << f.idx() << ": HC = " << get(mean_curvature_map, f) 
-                           << ", GC = " << get(gaussian_curvature_map, f) << "\n";
+  for (vertex_descriptor v : vertices(g1))
+      std::cout << v.idx() << ": HC = " << get(mean_curvature_map, v)
+                           << ", GC = " << get(gaussian_curvature_map, v) << "\n";
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 3528ffed8a43..3b499a8fe94d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -378,11 +378,12 @@ typename GT::FT face_in_ball_ratio_2(const std::vector<typename GT::Vector_3>& x
     return (r - d_min) / (d_max - d_min);
 }
 
-template<typename PolygonMesh, typename FaceMeasureMap,
+template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
-    void expand_interpolated_corrected_measure_face(const PolygonMesh& pmesh,
+    void expand_interpolated_corrected_measure_vertex(const PolygonMesh& pmesh,
         FaceMeasureMap fmm,
-        const typename boost::graph_traits<PolygonMesh>::face_descriptor f,
+        VertexCurvatureMap vcm,
+        const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
         const NamedParameters& np = parameters::default_values())
 {
     using parameters::choose_parameter;
@@ -406,30 +407,28 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     std::queue<face_descriptor> bfs_q;
     std::unordered_set<face_descriptor> bfs_v;
 
-    //get face center c
-    typename GT::Vector_3 c;
-    for (vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
-    {
-        typename GT::Point_3 p = get(vpm, v);
-        c += typename GT::Vector_3(p.x(), p.y(), p.z());
-    }
-    c /= degree(f, pmesh);
+    typename GT::Point_3 vp = get(vpm, v);
+    typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
 
     typename GT::FT corrected_mui = 0;
 
-    bfs_q.push(f);
-    bfs_v.insert(f);
-
+    for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+        if (f != boost::graph_traits<PolygonMesh>::null_face())
+        {
+            bfs_q.push(f);
+            bfs_v.insert(f);
+        }
+    }
     while (!bfs_q.empty()) {
         face_descriptor fi = bfs_q.front();
         bfs_q.pop();
 
         // looping over vertices in face to get point coordinates
         std::vector<typename GT::Vector_3> x;
-        for (vertex_descriptor v : vertices_around_face(halfedge(fi, pmesh), pmesh))
+        for (vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
         {
-            typename GT::Point_3 p = get(vpm, v);
-            x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
+            typename GT::Point_3 pi = get(vpm, vi);
+            x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
         }
 
         const typename GT::FT f_ratio = face_in_ball_ratio_2<GT>(x, r, c);
@@ -448,7 +447,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
         }
     }
 
-    put(fmm, f, corrected_mui);
+    put(vcm, v, corrected_mui);
 }
 
 //template<typename PolygonMesh, typename FaceMeasureMap,
@@ -462,63 +461,75 @@ template<typename PolygonMesh, typename FaceMeasureMap,
 //        expand_interpolated_corrected_measure_face(pmesh, fmm, f, np);
 //}
 
-template<typename PolygonMesh, typename FaceCurvatureMap,
+template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
-        FaceCurvatureMap fcm,
+        VertexCurvatureMap vcm,
         const NamedParameters& np = parameters::default_values())
 {
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
     typedef std::unordered_map<face_descriptor, typename GT::FT> FaceMeasureMap_tag;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef std::unordered_map<vertex_descriptor, typename GT::FT> VertexMeasureMap_tag;
 
     FaceMeasureMap_tag mu0_init, mu1_init;
     boost::associative_property_map<FaceMeasureMap_tag>
         mu0_map(mu0_init), mu1_map(mu1_init);
 
+    VertexMeasureMap_tag mu0_expand_init, mu1_expand_init;
+    boost::associative_property_map<VertexMeasureMap_tag>
+        mu0_expand_map(mu0_expand_init), mu1_expand_map(mu1_expand_init);
+
     interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE);
     interpolated_corrected_measure_mesh(pmesh, mu1_map, MU1_MEAN_CURVATURE_MEASURE);
 
-    for (face_descriptor f : faces(pmesh))
+    for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_measure_face(pmesh, mu0_map, f, np);
-        expand_interpolated_corrected_measure_face(pmesh, mu1_map, f, np);
-
-        const typename GT::FT f_mu0 = get(mu0_map, f);
-            if (f_mu0 > 0.000001)
-                put(fcm, f, 0.5 * get(mu1_map, f) / get(mu0_map, f));
-            else
-                put(fcm, f, 0);
+        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu0_expand_map, v, np);
+        expand_interpolated_corrected_measure_vertex(pmesh, mu1_map, mu1_expand_map, v, np);
+
+        typename GT::FT v_mu0 = get(mu0_expand_map, v);
+        if (v_mu0 > 0.000001)
+            put(vcm, v, 0.5 * get(mu1_expand_map, v) / v_mu0);
+        else
+            put(vcm, v, 0);
     }
 }
 
-template<typename PolygonMesh, typename FaceCurvatureMap,
+template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
-        FaceCurvatureMap fcm,
+        VertexCurvatureMap vcm,
         const NamedParameters& np = parameters::default_values())
 {
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
     typedef std::unordered_map<face_descriptor, typename GT::FT> FaceMeasureMap_tag;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef std::unordered_map<vertex_descriptor, typename GT::FT> VertexMeasureMap_tag;
 
     FaceMeasureMap_tag mu0_init, mu2_init;
     boost::associative_property_map<FaceMeasureMap_tag>
         mu0_map(mu0_init), mu2_map(mu2_init);
 
+    VertexMeasureMap_tag mu0_expand_init, mu2_expand_init;
+    boost::associative_property_map<VertexMeasureMap_tag>
+        mu0_expand_map(mu0_expand_init), mu2_expand_map(mu2_expand_init);
+
     interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE);
     interpolated_corrected_measure_mesh(pmesh, mu2_map, MU2_GAUSSIAN_CURVATURE_MEASURE);
 
-    for (face_descriptor f : faces(pmesh))
+    for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_measure_face(pmesh, mu0_map, f, np);
-        expand_interpolated_corrected_measure_face(pmesh, mu2_map, f, np);
+        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu0_expand_map, v, np);
+        expand_interpolated_corrected_measure_vertex(pmesh, mu2_map, mu2_expand_map, v, np);
 
-        const typename GT::FT f_mu0 = get(mu0_map, f);
-        if(f_mu0 > 0.000001)
-            put(fcm, f, get(mu2_map, f) / f_mu0);
+        typename GT::FT v_mu0 = get(mu0_expand_map, v);
+        if(v_mu0 > 0.000001)
+            put(vcm, v, get(mu2_expand_map, v) / v_mu0);
         else
-            put(fcm, f, 0);
+            put(vcm, v, 0);
     }
 }
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 88d86966f1d7..2f9bd19e584b 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -611,11 +611,11 @@ private Q_SLOTS:
       break;
     case 4: // Interpolated Corrected Mean Curvature
         displayInterpolatedCurvatureMeasure(sm_item, PMP::MU1_MEAN_CURVATURE_MEASURE);
-        sm_item->setRenderingMode(Flat);
+        sm_item->setRenderingMode(Gouraud);
         break;
     case 5: // Interpolated Corrected Gaussian Curvature
         displayInterpolatedCurvatureMeasure(sm_item, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE);
-        sm_item->setRenderingMode(Flat);
+        sm_item->setRenderingMode(Gouraud);
         break;
     default:
       if(dock_widget->propertyBox->currentText().contains("v:"))
@@ -652,11 +652,11 @@ private Q_SLOTS:
       if(does_exist)
         sm_item->face_graph()->remove_property_map(pmap);
       std::tie(pmap, does_exist) =
-          sm_item->face_graph()->property_map<face_descriptor, double>("f:interpolated_corrected_mean_curvature");
+          sm_item->face_graph()->property_map<face_descriptor, double>("v:interpolated_corrected_mean_curvature");
       if (does_exist)
           sm_item->face_graph()->remove_property_map(pmap);
       std::tie(pmap, does_exist) =
-          sm_item->face_graph()->property_map<face_descriptor, double>("f:interpolated_corrected_gaussian_curvature");
+          sm_item->face_graph()->property_map<face_descriptor, double>("v:interpolated_corrected_gaussian_curvature");
       if (does_exist)
           sm_item->face_graph()->remove_property_map(pmap);
     });
@@ -731,14 +731,14 @@ private Q_SLOTS:
     {
       smesh.remove_property_map(angles);
     }
-    SMesh::Property_map<face_descriptor, double> mean_curvature;
-    std::tie(mean_curvature, found) = smesh.property_map<face_descriptor, double>("f:interpolated_corrected_mean_curvature");
+    SMesh::Property_map<vertex_descriptor, double> mean_curvature;
+    std::tie(mean_curvature, found) = smesh.property_map<vertex_descriptor, double>("v:interpolated_corrected_mean_curvature");
     if (found)
     {
         smesh.remove_property_map(mean_curvature);
     }
-    SMesh::Property_map<face_descriptor, double> gaussian_curvature;
-    std::tie(gaussian_curvature, found) = smesh.property_map<face_descriptor, double>("f:interpolated_corrected_gaussian_curvature");
+    SMesh::Property_map<vertex_descriptor, double> gaussian_curvature;
+    std::tie(gaussian_curvature, found) = smesh.property_map<vertex_descriptor, double>("v:interpolated_corrected_gaussian_curvature");
     if (found)
     {
         smesh.remove_property_map(gaussian_curvature);
@@ -786,13 +786,13 @@ private Q_SLOTS:
   void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item, PMP::Curvature_measure_index mu_index)
   {
     std::string tied_string = (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)? 
-        "f:interpolated_corrected_mean_curvature": "f:interpolated_corrected_gaussian_curvature";
+        "v:interpolated_corrected_mean_curvature": "v:interpolated_corrected_gaussian_curvature";
     SMesh& smesh = *item->face_graph();
     //compute once and store the value per face
     bool non_init;
-    SMesh::Property_map<face_descriptor, double> mu_i_map;
+    SMesh::Property_map<vertex_descriptor, double> mu_i_map;
         std::tie(mu_i_map, non_init) = 
-            smesh.add_property_map<face_descriptor, double>(tied_string, 0);
+            smesh.add_property_map<vertex_descriptor, double>(tied_string, 0);
     if (non_init)
     {
         if (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)
@@ -802,18 +802,18 @@ private Q_SLOTS:
 
         double res_min = ARBITRARY_DBL_MAX,
             res_max = -ARBITRARY_DBL_MAX;
-        SMesh::Face_index min_index, max_index;
-        for (SMesh::Face_index f : faces(smesh))
+        SMesh::Vertex_index min_index, max_index;
+        for (SMesh::Vertex_index v : vertices(smesh))
         {
-            if (mu_i_map[f] > res_max)
+            if (mu_i_map[v] > res_max)
             {
-                res_max = mu_i_map[f];
-                max_index = f;
+                res_max = mu_i_map[v];
+                max_index = v;
             }
-            if (mu_i_map[f] < res_min)
+            if (mu_i_map[v] < res_min)
             {
-                res_min = mu_i_map[f];
-                min_index = f;
+                res_min = mu_i_map[v];
+                min_index = v;
             }
         }
         switch (mu_index)
@@ -831,7 +831,7 @@ private Q_SLOTS:
         connect(item, &Scene_surface_mesh_item::itemChanged,
             this, &DisplayPropertyPlugin::resetProperty);
     }
-        treat_sm_property<face_descriptor>(tied_string, item->face_graph());
+        treat_sm_property<vertex_descriptor>(tied_string, item->face_graph());
   }
 
 
@@ -1199,7 +1199,7 @@ private Q_SLOTS:
     case 4:
     {
         ::zoomToId(*item->face_graph(),
-            QString("f%1").arg(mean_curvature_min[item].second),
+            QString("v%1").arg(mean_curvature_min[item].second),
             getActiveViewer(),
             dummy_fd,
             dummy_p);
@@ -1208,7 +1208,7 @@ private Q_SLOTS:
     case 5:
     {
         ::zoomToId(*item->face_graph(),
-            QString("f%1").arg(gaussian_curvature_min[item].second),
+            QString("v%1").arg(gaussian_curvature_min[item].second),
             getActiveViewer(),
             dummy_fd,
             dummy_p);
@@ -1252,7 +1252,7 @@ private Q_SLOTS:
     case 4:
     {
         ::zoomToId(*item->face_graph(),
-            QString("f%1").arg(mean_curvature_max[item].second),
+            QString("v%1").arg(mean_curvature_max[item].second),
             getActiveViewer(),
             dummy_fd,
             dummy_p);
@@ -1261,7 +1261,7 @@ private Q_SLOTS:
     case 5:
     {
         ::zoomToId(*item->face_graph(),
-            QString("f%1").arg(gaussian_curvature_max[item].second),
+            QString("v%1").arg(gaussian_curvature_max[item].second),
             getActiveViewer(),
             dummy_fd,
             dummy_p);
@@ -1557,11 +1557,11 @@ private Q_SLOTS:
   std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > angles_min;
   std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > angles_max;
 
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mean_curvature_min;
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > mean_curvature_max;
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Vertex_index> > mean_curvature_min;
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Vertex_index> > mean_curvature_max;
 
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > gaussian_curvature_min;
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > gaussian_curvature_max;
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Vertex_index> > gaussian_curvature_min;
+  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Vertex_index> > gaussian_curvature_max;
 
   std::unordered_map<Scene_surface_mesh_item*, Vertex_source_map> is_source;
 

From 4ffd2d2a098b3c0bb69db2ade868e770e153de54 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Jul 2022 19:05:30 +0200
Subject: [PATCH 0025/1398] add missing typename

---
 .../Curvatures/interpolated_corrected_curvature_measures.h    | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 03e5f396e3ce..0c6a370059c4 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -74,7 +74,7 @@ typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vecto
                                                         const typename GT::Vector_3 u2,
                                                         const Curvature_measure_index mu_i)
 {
-    GT::Construct_cross_product_3 cross_product;
+    typename GT::Construct_cross_product_3 cross_product;
     switch (mu_i)
     {
     case MU0_AREA_MEASURE:
@@ -139,7 +139,7 @@ typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3
 {
     // x0  _  x1
     // x2 |_| x3
-    GT::Construct_cross_product_3 cross_product;
+    typename GT::Construct_cross_product_3 cross_product;
     switch (mu_i)
     {
     case MU0_AREA_MEASURE:

From 62c91c1479fb2396ed6b0e9ef9d707e9ef643f93 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Jul 2022 19:10:52 +0200
Subject: [PATCH 0026/1398] remove trailing whitespaces

---
 .../Polyhedron/Plugins/Display/Display_property_plugin.cpp    | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 2f9bd19e584b..0334eb45a972 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -785,13 +785,13 @@ private Q_SLOTS:
 
   void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item, PMP::Curvature_measure_index mu_index)
   {
-    std::string tied_string = (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)? 
+    std::string tied_string = (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)?
         "v:interpolated_corrected_mean_curvature": "v:interpolated_corrected_gaussian_curvature";
     SMesh& smesh = *item->face_graph();
     //compute once and store the value per face
     bool non_init;
     SMesh::Property_map<vertex_descriptor, double> mu_i_map;
-        std::tie(mu_i_map, non_init) = 
+        std::tie(mu_i_map, non_init) =
             smesh.add_property_map<vertex_descriptor, double>(tied_string, 0);
     if (non_init)
     {

From 184fa0c8a4b5be1b0ca9aab7bdcade05de342cc0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Jul 2022 19:28:44 +0200
Subject: [PATCH 0027/1398] fix invalid functor name

---
 .../Curvatures/interpolated_corrected_curvature_measures.h    | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 0c6a370059c4..c3f349740204 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -74,7 +74,7 @@ typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vecto
                                                         const typename GT::Vector_3 u2,
                                                         const Curvature_measure_index mu_i)
 {
-    typename GT::Construct_cross_product_3 cross_product;
+    typename GT::Construct_cross_product_vector_3 cross_product;
     switch (mu_i)
     {
     case MU0_AREA_MEASURE:
@@ -139,7 +139,7 @@ typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3
 {
     // x0  _  x1
     // x2 |_| x3
-    typename GT::Construct_cross_product_3 cross_product;
+    typename GT::Construct_cross_product_vector_3 cross_product;
     switch (mu_i)
     {
     case MU0_AREA_MEASURE:

From db753ee6b568c16ce2872a72d21cf9bed62e42c0 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 31 Jul 2022 00:21:55 +0200
Subject: [PATCH 0028/1398] Demo improvements + minor fixes

- Fixed some typos in example file and in comment in display prop plugin
- Added an option in random perturbation plugin to compute normals before hand
- added slider for expanding radius with an exponential range and with max val dependant on max edge length
---
 .../interpolated_corrected_curvatures.cpp     |  6 +--
 ...nterpolated_corrected_curvature_measures.h | 12 -----
 .../Plugins/Display/Display_property.ui       | 36 ++++++++++++--
 .../Display/Display_property_plugin.cpp       | 49 ++++++++++++++++++-
 .../Plugins/PMP/Random_perturbation_dialog.ui | 24 ++++++++-
 .../PMP/Random_perturbation_plugin.cpp        |  7 +++
 6 files changed, 111 insertions(+), 23 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index 63c0b8df528c..5359315f0fa0 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -17,7 +17,7 @@ typedef CGAL::Surface_mesh<EpicKernel::Point_3> Mesh;
 typedef boost::graph_traits<Mesh>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
 typedef std::unordered_map<face_descriptor, EpicKernel::FT> FaceMeasureMap_tag;
-typedef std::unordered_map<vertex_descriptor, EpicKernel::FT> vertexVectorMap_tag;
+typedef std::unordered_map<vertex_descriptor, EpicKernel::FT> vertexMeasureMap_tag;
 
 
 int main(int argc, char* argv[])
@@ -34,8 +34,8 @@ int main(int argc, char* argv[])
   }
 
 
-  vertexVectorMap_tag mean_curvature_init, gaussian_curvature_init;
-  boost::associative_property_map<vertexVectorMap_tag>
+  vertexMeasureMap_tag mean_curvature_init, gaussian_curvature_init;
+  boost::associative_property_map<vertexMeasureMap_tag>
       mean_curvature_map(mean_curvature_init), gaussian_curvature_map(gaussian_curvature_init);
 
   PMP::interpolated_corrected_mean_curvature(
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index c3f349740204..d36e1c67e363 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -338,7 +338,6 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     }
 }
 
-//
 //
 //template<typename GT>
 //typename GT::FT triangle_in_ball_ratio_1(const typename GT::Vector_3 x1,
@@ -464,17 +463,6 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
     put(vcm, v, corrected_mui);
 }
 
-//template<typename PolygonMesh, typename FaceMeasureMap,
-//    typename NamedParameters = parameters::Default_named_parameters>
-//    void expand_interpolated_corrected_measure_mesh(const PolygonMesh& pmesh,
-//        FaceMeasureMap fmm,
-//        const NamedParameters& np = parameters::default_values())
-//{
-//    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-//    for (face_descriptor f : faces(pmesh))
-//        expand_interpolated_corrected_measure_face(pmesh, fmm, f, np);
-//}
-
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
index 7a5a19621f42..70c22f8348c2 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
@@ -84,18 +84,18 @@
               <property name="title">
                <string>Ramp Colors</string>
               </property>
-              <layout class="QVBoxLayout" name="verticalLayout_3">
+              <layout class="QHBoxLayout" name="horizontalLayout_4">
                <item>
                 <widget class="QPushButton" name="minColorButton">
                  <property name="text">
-                  <string>Color Min...</string>
+                  <string>Min</string>
                  </property>
                 </widget>
                </item>
                <item>
                 <widget class="QPushButton" name="maxColorButton">
                  <property name="text">
-                  <string>Color Max...</string>
+                  <string>Max</string>
                  </property>
                 </widget>
                </item>
@@ -135,7 +135,7 @@
           <property name="title">
            <string>Zoom </string>
           </property>
-          <layout class="QVBoxLayout" name="verticalLayout_4">
+          <layout class="QHBoxLayout" name="horizontalLayout_5">
            <item>
             <widget class="QPushButton" name="zoomToMinButton">
              <property name="text">
@@ -158,7 +158,7 @@
           <property name="title">
            <string>Ramp Extrema</string>
           </property>
-          <layout class="QVBoxLayout" name="verticalLayout_2">
+          <layout class="QHBoxLayout" name="horizontalLayout_2">
            <item>
             <widget class="DoubleEdit" name="minBox">
              <property name="text">
@@ -186,6 +186,32 @@
           </property>
          </widget>
         </item>
+        <item row="8" column="1">
+         <widget class="QSlider" name="expandingRadiusSlider">
+          <property name="minimum">
+           <float>0</float>
+          </property>
+          <property name="maximum">
+           <float>100</float>
+          </property>
+          <property name="tracking">
+           <bool>true</bool>
+          </property>
+          <property name="orientation">
+           <enum>Qt::Horizontal</enum>
+          </property>
+          <property name="tickPosition">
+           <enum>QSlider::TicksAbove</enum>
+          </property>
+         </widget>
+        </item>
+        <item row="9" column="1">
+            <widget class="QLabel" name="expandingRadiusLabel">
+             <property name="text">
+                <string>Expanding Radius: 0</string>
+             </property>
+            </widget>
+        </item>
        </layout>
       </item>
      </layout>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 0334eb45a972..a2d25d167c6b 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -8,6 +8,7 @@
 #include <QColorDialog>
 #include <QPalette>
 #include <QColor>
+#include <QSlider>
 #include <QStyleFactory>
 #include <QMessageBox>
 #include <QAbstractItemView>
@@ -783,12 +784,56 @@ private Q_SLOTS:
     treat_sm_property<face_descriptor>("f:jacobian", item->face_graph());
   }
 
+  double sliderRangeToExpandRadius(SMesh& smesh, double val)
+  {
+      double sliderMin = dock_widget->expandingRadiusSlider->minimum();
+      double sliderMax = dock_widget->expandingRadiusSlider->maximum() - sliderMin;
+      val -= sliderMin;
+      sliderMin = 0;
+
+      auto vpm = get(CGAL::vertex_point, smesh);
+
+      auto edge_range = CGAL::edges(smesh);
+
+      if (edge_range.begin() == edge_range.end())
+          return 0;
+
+      auto edge_reference = std::max_element(edge_range.begin(), edge_range.end(), [&, vpm, smesh](auto l, auto r) {
+          auto res = EPICK().compare_squared_distance_3_object()(
+              get(vpm, source((l), smesh)),
+              get(vpm, target((l), smesh)),
+              get(vpm, source((r), smesh)),
+              get(vpm, target((r), smesh)));
+          return res == CGAL::SMALLER;
+      });
+
+      // if edge_reference is not derefrenceble
+      if (edge_reference == edge_range.end())
+          return 0;
+
+      double L = sqrt(
+          (get(vpm, source((*edge_reference), smesh)) - get(vpm, target((*edge_reference), smesh)))
+          .squared_length()
+      );
+      
+      std::cout << L << std::endl;
+
+      double outMin = 0, outMax = 5 * L, base = 1.2;
+
+      return (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
+
+  }
+
   void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item, PMP::Curvature_measure_index mu_index)
   {
     std::string tied_string = (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)?
         "v:interpolated_corrected_mean_curvature": "v:interpolated_corrected_gaussian_curvature";
     SMesh& smesh = *item->face_graph();
-    //compute once and store the value per face
+
+    expandRadius = sliderRangeToExpandRadius(smesh, dock_widget->expandingRadiusSlider->value());
+    dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expandRadius));
+
+    //compute once and store the value per vertex
     bool non_init;
     SMesh::Property_map<vertex_descriptor, double> mu_i_map;
         std::tie(mu_i_map, non_init) =
@@ -1565,7 +1610,7 @@ private Q_SLOTS:
 
   std::unordered_map<Scene_surface_mesh_item*, Vertex_source_map> is_source;
 
-
+  double expandRadius;
   double minBox;
   double maxBox;
   QPixmap legend_;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_dialog.ui b/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_dialog.ui
index 1d368c3dd592..3427d5b12e6a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_dialog.ui
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_dialog.ui
@@ -135,6 +135,26 @@
        </widget>
       </item>
       <item row="1" column="0">
+       <widget class="QLabel" name="keep_normal_label">
+        <property name="text">
+         <string>keep vertex normals unperturbed</string>
+        </property>
+        <property name="alignment">
+         <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
+        </property>
+        <property name="buddy">
+         <cstring>seed_spinbox</cstring>
+        </property>
+       </widget>
+      </item>
+      <item row="1" column="1">
+       <widget class="QCheckBox" name="keep_normal_checkbox">
+        <property name="text">
+         <string/>
+        </property>
+       </widget>
+      </item>
+      <item row="2" column="0">
        <widget class="QLabel" name="seed_label">
         <property name="text">
          <string>Random seed</string>
@@ -147,7 +167,7 @@
         </property>
        </widget>
       </item>
-      <item row="1" column="1">
+      <item row="2" column="1">
        <widget class="QSpinBox" name="seed_spinbox">
         <property name="minimumSize">
          <size>
@@ -163,6 +183,8 @@
      </layout>
      <zorder>seed_spinbox</zorder>
      <zorder>seed_label</zorder>
+     <zorder>keep_normal_label</zorder>
+     <zorder>keep_normal_checkbox</zorder>
      <zorder>deterministic_label</zorder>
      <zorder>deterministic_checkbox</zorder>
     </widget>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_plugin.cpp
index 53499b823367..9afb452ab13c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_plugin.cpp
@@ -10,6 +10,7 @@
 #include <CGAL/utility.h>
 
 #include <CGAL/Polygon_mesh_processing/random_perturbation.h>
+#include <CGAL/Polygon_mesh_processing/compute_normal.h>
 
 #include <boost/graph/graph_traits.hpp>
 #include <CGAL/property_map.h>
@@ -102,6 +103,12 @@ public Q_SLOTS:
     if (poly_item)
     {
       SMesh& pmesh = *poly_item->face_graph();
+      if(ui.keep_normal_checkbox->isChecked())
+      {
+        SMesh::Property_map<vertex_descriptor, EPICK::Vector_3 > vnormals =
+          pmesh.add_property_map<vertex_descriptor, EPICK::Vector_3 >("v:normal").first;
+        CGAL::Polygon_mesh_processing::compute_vertex_normals(pmesh,vnormals);
+      }
       if(ui.deterministic_checkbox->isChecked())
       {
         unsigned int seed = static_cast<unsigned int>(ui.seed_spinbox->value());

From 127c87857cbec43e692dfd94aefbe7755029e376 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 31 Jul 2022 00:32:42 +0200
Subject: [PATCH 0029/1398] Use slider radius (after remapping) in curvature
 computation

---
 .../Polyhedron/Plugins/Display/Display_property_plugin.cpp    | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index a2d25d167c6b..92f9df7b213d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -841,9 +841,9 @@ private Q_SLOTS:
     if (non_init)
     {
         if (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)
-            PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map);
+            PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expandRadius));
         else
-            PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map);
+            PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expandRadius));
 
         double res_min = ARBITRARY_DBL_MAX,
             res_max = -ARBITRARY_DBL_MAX;

From 22c0859d92fa444f0ca78b2c21bb58cf843d730d Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 31 Jul 2022 00:41:43 +0200
Subject: [PATCH 0030/1398] trailing spaces

---
 .../demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 92f9df7b213d..19afdc6728ec 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -815,7 +815,7 @@ private Q_SLOTS:
           (get(vpm, source((*edge_reference), smesh)) - get(vpm, target((*edge_reference), smesh)))
           .squared_length()
       );
-      
+
       std::cout << L << std::endl;
 
       double outMin = 0, outMax = 5 * L, base = 1.2;

From 9635ec14975c74beaaac9cce6f4fc6c883f5ff98 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 31 Jul 2022 18:55:51 +0200
Subject: [PATCH 0031/1398] minor changes on demo (wip)

---
 ...nterpolated_corrected_curvature_measures.h |  9 +--
 .../Display/Display_property_plugin.cpp       | 77 +++++++++++--------
 2 files changed, 50 insertions(+), 36 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index d36e1c67e363..1ee24fef37f5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -409,9 +409,6 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
     const typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
         r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0.01);
 
-    if (r < 0.000001)
-        return;
-
     typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
             get_const_property_map(CGAL::vertex_point, pmesh));
@@ -446,7 +443,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
 
         const typename GT::FT f_ratio = face_in_ball_ratio_2<GT>(x, r, c);
 
-        if (f_ratio > 0.000001)
+        if (f_ratio > 0.00000001)
         {
             corrected_mui += f_ratio * get(fmm, fi);
             for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
@@ -492,7 +489,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         expand_interpolated_corrected_measure_vertex(pmesh, mu1_map, mu1_expand_map, v, np);
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
-        if (v_mu0 > 0.000001)
+        if (v_mu0 > 0.00000001)
             put(vcm, v, 0.5 * get(mu1_expand_map, v) / v_mu0);
         else
             put(vcm, v, 0);
@@ -528,7 +525,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         expand_interpolated_corrected_measure_vertex(pmesh, mu2_map, mu2_expand_map, v, np);
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
-        if(v_mu0 > 0.000001)
+        if(v_mu0 > 0.00000001)
             put(vcm, v, get(mu2_expand_map, v) / v_mu0);
         else
             put(vcm, v, 0);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 19afdc6728ec..91deb90680a8 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -487,8 +487,10 @@ class DisplayPropertyPlugin :
     connect(scene_obj, SIGNAL(itemIndexSelected(int)),
             this,SLOT(detectScalarProperties(int)));
 
-    on_propertyBox_currentIndexChanged(0);
+    connect(dock_widget->expandingRadiusSlider, SIGNAL(valueChanged(int)),
+        this, SLOT(setExpandingRadius(int)));
 
+    on_propertyBox_currentIndexChanged(0);
 
   }
 private:
@@ -716,6 +718,10 @@ private Q_SLOTS:
   {
     Scene_surface_mesh_item* item =
         qobject_cast<Scene_surface_mesh_item*>(sender());
+
+    maxEdgeLength = -1;
+    setExpandingRadius(dock_widget->expandingRadiusSlider->value());
+    
     if(!item)
       return;
     SMesh& smesh = *item->face_graph();
@@ -784,43 +790,56 @@ private Q_SLOTS:
     treat_sm_property<face_descriptor>("f:jacobian", item->face_graph());
   }
 
-  double sliderRangeToExpandRadius(SMesh& smesh, double val)
+  void setExpandingRadius(int val_int)
   {
       double sliderMin = dock_widget->expandingRadiusSlider->minimum();
       double sliderMax = dock_widget->expandingRadiusSlider->maximum() - sliderMin;
-      val -= sliderMin;
+      double val =  val_int - sliderMin;
       sliderMin = 0;
 
-      auto vpm = get(CGAL::vertex_point, smesh);
-
-      auto edge_range = CGAL::edges(smesh);
-
-      if (edge_range.begin() == edge_range.end())
-          return 0;
+      SMesh& smesh = *(qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex())))->face_graph();
 
-      auto edge_reference = std::max_element(edge_range.begin(), edge_range.end(), [&, vpm, smesh](auto l, auto r) {
-          auto res = EPICK().compare_squared_distance_3_object()(
-              get(vpm, source((l), smesh)),
-              get(vpm, target((l), smesh)),
-              get(vpm, source((r), smesh)),
-              get(vpm, target((r), smesh)));
-          return res == CGAL::SMALLER;
-      });
+      auto vpm = get(CGAL::vertex_point, smesh);
 
-      // if edge_reference is not derefrenceble
-      if (edge_reference == edge_range.end())
-          return 0;
+      if (maxEdgeLength < 0)
+      {
+          auto edge_range = CGAL::edges(smesh);
 
-      double L = sqrt(
-          (get(vpm, source((*edge_reference), smesh)) - get(vpm, target((*edge_reference), smesh)))
-          .squared_length()
-      );
+          if (edge_range.begin() == edge_range.end())
+          {
+              expandRadius = 0;
+              dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expandRadius));
+              return;
+          }
 
-      std::cout << L << std::endl;
+          auto edge_reference = std::max_element(edge_range.begin(), edge_range.end(), [&, vpm, smesh](auto l, auto r) {
+              auto res = EPICK().compare_squared_distance_3_object()(
+                  get(vpm, source((l), smesh)),
+                  get(vpm, target((l), smesh)),
+                  get(vpm, source((r), smesh)),
+                  get(vpm, target((r), smesh)));
+              return res == CGAL::SMALLER;
+          });
+
+          // if edge_reference is not derefrenceble
+          if (edge_reference == edge_range.end())
+          {
+              expandRadius = 0;
+              dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expandRadius));
+              return;
+          }
 
-      double outMin = 0, outMax = 5 * L, base = 1.2;
+          maxEdgeLength = sqrt(
+              (get(vpm, source((*edge_reference), smesh)) - get(vpm, target((*edge_reference), smesh)))
+              .squared_length()
+          );
 
-      return (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
+      }
+      
+      double outMin = 0, outMax = 5 * maxEdgeLength, base = 1.2;
+      
+      expandRadius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
+      dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expandRadius));
 
   }
 
@@ -830,9 +849,6 @@ private Q_SLOTS:
         "v:interpolated_corrected_mean_curvature": "v:interpolated_corrected_gaussian_curvature";
     SMesh& smesh = *item->face_graph();
 
-    expandRadius = sliderRangeToExpandRadius(smesh, dock_widget->expandingRadiusSlider->value());
-    dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expandRadius));
-
     //compute once and store the value per vertex
     bool non_init;
     SMesh::Property_map<vertex_descriptor, double> mu_i_map;
@@ -1611,6 +1627,7 @@ private Q_SLOTS:
   std::unordered_map<Scene_surface_mesh_item*, Vertex_source_map> is_source;
 
   double expandRadius;
+  double maxEdgeLength = -1;
   double minBox;
   double maxBox;
   QPixmap legend_;

From 765220a4661743db3367676f6723cdc9dd23ccce Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 31 Jul 2022 20:03:33 +0200
Subject: [PATCH 0032/1398] removing the switch from measures functions (for
 optimization)

---
 ...nterpolated_corrected_curvature_measures.h | 277 ++++++++++--------
 1 file changed, 151 insertions(+), 126 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 1ee24fef37f5..250ea596c1c3 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -26,6 +26,7 @@
 #include <numeric>
 #include <queue>
 #include <unordered_set>
+#include <functional>
 
 namespace CGAL {
 
@@ -46,207 +47,215 @@ enum Curvature_measure_index {
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected measure of specific triangle.
+* computes the interpolated corrected area measure of a specific face.
 *
 * @tparam GT is the geometric traits class.
 *
-* @param x0 is the position of vertex #0.
-* @param x1 is the position of vertex #1.
-* @param x2 is the position of vertex #2.
-* @param u0 is the normal vector of vertex #0.
-* @param u1 is the normal vector of vertex #1.
-* @param u2 is the normal vector of vertex #2.
-* @param mu_i an enum for choosing between computing the area measure,
-* the mean curvature measure, or the gaussian curvature measure.
+* @param x is a vector of the vertex positions of the face.
+* @param u is a vector of the vertex nomrals of the face.
 *
 * @return a scalar of type `GT::FT`.
-* This is the value of the interpolated corrected measure of the given triangle.
+* This is the value of the interpolated corrected area measure of the given face.
 *
-* @see `interpolated_corrected_measure_face()`
-* @see `interpolated_corrected_measure_quad()`
+* @see `interpolated_corrected_mean_curvature_measure_face()`
+* @see `interpolated_corrected_gaussian_curvature_measure_face()`
+* @see `interpolated_corrected_measure_mesh()`
 */
 template<typename GT>
-typename GT::FT interpolated_corrected_measure_triangle(const typename GT::Vector_3 x0,
-                                                        const typename GT::Vector_3 x1,
-                                                        const typename GT::Vector_3 x2,
-                                                        const typename GT::Vector_3 u0,
-                                                        const typename GT::Vector_3 u1,
-                                                        const typename GT::Vector_3 u2,
-                                                        const Curvature_measure_index mu_i)
+typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typename GT::Vector_3>& x,
+                                                         const std::vector<typename GT::Vector_3>& u)
 {
+    std::size_t n = x.size();
+    CGAL_precondition(u.size() == n);
+    CGAL_precondition(n >= 3);
+
     typename GT::Construct_cross_product_vector_3 cross_product;
-    switch (mu_i)
+
+    // Triangle: use triangle formula
+    if (n == 3)
     {
-    case MU0_AREA_MEASURE:
+        const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
+        return 0.5 * um * cross_product(x[1] - x[0], x[2] - x[0]);
+    }
+    // Quad: use bilinear interpolation formula
+    else if (n == 4)
     {
-        const typename GT::Vector_3 um = (u0 + u1 + u2) / 3.0;
-
-        return 0.5 * um * cross_product(x1 - x0, x2 - x0);
+        // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+        return (1 / 36.0) * (
+              (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(u[1] - u[0], u[3] - u[0])
+            + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(u[1] - u[0], u[2] - u[1])
+            + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(u[2] - u[3], u[3] - u[0])
+            + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(u[2] - u[3], u[2] - u[1])
+            );
     }
-    case MU1_MEAN_CURVATURE_MEASURE:
+    // N-gon: split into n triangles by polygon center and use triangle formula for each
+    else
     {
-        const typename GT::Vector_3 um = (u0 + u1 + u2) / 3.0;
+        typename GT::FT mu0 = 0;
 
-        return 0.5 * um * (cross_product(u2 - u1, x0)
-            + cross_product(u0 - u2, x1)
-            + cross_product(u1 - u0, x2));
-    }
-    case MU2_GAUSSIAN_CURVATURE_MEASURE:
+        // getting center of points
+        typename GT::Vector_3 xc =
+            std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+        xc /= n;
 
-        return 0.5 * u0 * cross_product(u1, u2);
+        // getting unit average normal of points
+        typename GT::Vector_3 uc =
+            std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+        uc /= sqrt(uc * uc);
 
-    default: return 0;
+        // summing each triangle's measure after triangulation by barycenter split.
+        for (std::size_t i = 0; i < n; i++)
+        {
+            const typename GT::Vector_3 um = (u[i] + u[(i + 1) % n] + uc) / 3.0;
+            mu0 += 0.5 * um * cross_product(x[(i + 1) % n] - x[i], xc - x[i]);
+        }
+        return mu0;
     }
 }
 
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected measure of specific quad
-* Note that the vertices 0 to 3 are ordered like this \n
-* v0  _  v1 \n
-* v2 |_| v3
+* computes the interpolated corrected mean curvature measure of a specific face.
 *
 * @tparam GT is the geometric traits class.
 *
-* @param x0 is the position of vertex #0.
-* @param x1 is the position of vertex #1.
-* @param x2 is the position of vertex #2.
-* @param x3 is the position of vertex #3.
-* @param u0 is the normal vector of vertex #0.
-* @param u1 is the normal vector of vertex #1.
-* @param u2 is the normal vector of vertex #2.
-* @param u3 is the normal vector of vertex #3.
-* @param mu_i an enum for choosing between computing the area measure,
-* the mean curvature measure, or the gaussian curvature measure.
+* @param x is a vector of the vertex positions of the face.
+* @param u is a vector of the vertex nomrals of the face.
 *
 * @return a scalar of type `GT::FT`.
-* This is the value of the interpolated corrected measure of the given triangle.
+* This is the value of the interpolated corrected mean curvature measure of the given face.
 *
-* @see `interpolated_corrected_measure_face()`
-* @see `interpolated_corrected_measure_triangle()`
+* @see `interpolated_corrected_gaussian_curvature_measure_face()`
+* @see `interpolated_corrected_area_measure_face()`
+* @see `interpolated_corrected_measure_mesh()`
 */
 template<typename GT>
-typename GT::FT interpolated_corrected_measure_quad(const typename GT::Vector_3 x0,
-                                                    const typename GT::Vector_3 x1,
-                                                    const typename GT::Vector_3 x2,
-                                                    const typename GT::Vector_3 x3,
-                                                    const typename GT::Vector_3 u0,
-                                                    const typename GT::Vector_3 u1,
-                                                    const typename GT::Vector_3 u2,
-                                                    const typename GT::Vector_3 u3,
-                                                    const Curvature_measure_index mu_i)
+typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::vector<typename GT::Vector_3>& x,
+                                                                   const std::vector<typename GT::Vector_3>& u)
 {
-    // x0  _  x1
-    // x2 |_| x3
+    std::size_t n = x.size();
+    CGAL_precondition(u.size() == n);
+    CGAL_precondition(n >= 3);
+
     typename GT::Construct_cross_product_vector_3 cross_product;
-    switch (mu_i)
-    {
-    case MU0_AREA_MEASURE:
 
-        return (1 / 36.0) * (
-              (4 * u0 + 2 * u1 + 2 * u2 + u3) * cross_product(x1 - x0, x2 - x0)
-            + (2 * u0 + 4 * u1 + u2 + 2 * u3) * cross_product(x1 - x0, x3 - x1)
-            + (2 * u0 + u1 + 4 * u2 + 2 * u3) * cross_product(x3 - x2, x2 - x0)
-            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * cross_product(x3 - x2, x3 - x1)
-            );
+    // Triangle: use triangle formula
+    if (n == 3)
+    {
+        const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
 
-    case MU1_MEAN_CURVATURE_MEASURE:
+        return 0.5 * um * (cross_product(u[2] - u[1], x[0])
+            + cross_product(u[0] - u[2], x[1])
+            + cross_product(u[1] - u[0], x[2]));
+    }
+    // Quad: use bilinear interpolation formula
+    else if (n == 4)
     {
-        const typename GT::Vector_3 u03 = u3 - u0;
-        const typename GT::Vector_3 u12 = u2 - u1;
-        const typename GT::Vector_3 x0_cross = cross_product(u12, x0);
-        const typename GT::Vector_3 x1_cross = -cross_product(u03, x1);
-        const typename GT::Vector_3 x2_cross = cross_product(u03, x2);
-        const typename GT::Vector_3 x3_cross = -cross_product(u12, x3);
+        // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
 
+        const typename GT::Vector_3 u02 = u[2] - u[0];
+        const typename GT::Vector_3 u13 = u[3] - u[1];
+        const typename GT::Vector_3 x0_cross = cross_product(u13, x[0]);
+        const typename GT::Vector_3 x1_cross = -cross_product(u02, x[1]);
+        const typename GT::Vector_3 x3_cross = cross_product(u02, x[3]);
+        const typename GT::Vector_3 x2_cross = -cross_product(u13, x[2]);
 
         return (1 / 12.0) * (
-              u0 * (2 * x0_cross - cross_product((u2 + u3), x1) + cross_product((u1 + u3), x2) + x3_cross)
-            + u1 * (cross_product((u2 + u3), x0) + 2 * x1_cross + x2_cross - cross_product((u0 + u2), x3))
-            + u2 * (-cross_product((u1 + u3), x0) + x1_cross + 2 * x2_cross + cross_product((u0 + u1), x3))
-            + u3 * (x0_cross + cross_product((u0 + u2), x1) - cross_product((u0 + u1), x2) + 2 * x3_cross)
+              u[0] * (2 * x0_cross - cross_product((u[3] + u[2]), x[1]) + cross_product((u[1] + u[2]), x[3]) + x2_cross)
+            + u[1] * (cross_product((u[3] + u[2]), x[0]) + 2 * x1_cross + x3_cross - cross_product((u[0] + u[3]), x[2]))
+            + u[3] * (-cross_product((u[1] + u[2]), x[0]) + x1_cross + 2 * x3_cross + cross_product((u[0] + u[1]), x[2]))
+            + u[2] * (x0_cross + cross_product((u[0] + u[3]), x[1]) - cross_product((u[0] + u[1]), x[3]) + 2 * x2_cross)
             );
     }
-    case MU2_GAUSSIAN_CURVATURE_MEASURE:
+    // N-gon: split into n triangles by polygon center and use triangle formula for each
+    else
+    {
+        typename GT::FT mu1 = 0;
 
-        return (1 / 36.0) * (
-              (4 * u0 + 2 * u1 + 2 * u2 + u3) * cross_product(u1 - u0, u2 - u0)
-            + (2 * u0 + 4 * u1 + u2 + 2 * u3) * cross_product(u1 - u0, u3 - u1)
-            + (2 * u0 + u1 + 4 * u2 + 2 * u3) * cross_product(u3 - u2, u2 - u0)
-            + (u0 + 2 * u1 + 2 * u2 + 4 * u3) * cross_product(u3 - u2, u3 - u1)
-            );
+        // getting center of points
+        typename GT::Vector_3 xc =
+            std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+        xc /= n;
+
+        // getting unit average normal of points
+        typename GT::Vector_3 uc =
+            std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+        uc /= sqrt(uc * uc);
 
-    default: return 0;
+        // summing each triangle's measure after triangulation by barycenter split.
+        for (std::size_t i = 0; i < n; i++)
+        {
+            const typename GT::Vector_3 um = (u[i] + u[(i+1)%n] + uc) / 3.0;
+            mu1 += 0.5 * um * (cross_product(uc - u[(i + 1) % n], x[i])
+                            + cross_product(u[i] - uc, x[(i + 1) % n])
+                            + cross_product(u[(i + 1) % n] - u[i], xc));
+        }
+        return mu1;
     }
 }
 
-
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected measure of specific face.
+* computes the interpolated corrected gaussian curvature measure of a specific face.
 *
 * @tparam GT is the geometric traits class.
 *
 * @param x is a vector of the vertex positions of the face.
 * @param u is a vector of the vertex nomrals of the face.
-* @param mu_i an enum for choosing between computing the area measure,
-* the mean curvature measure, or the gaussian curvature measure.
 *
 * @return a scalar of type `GT::FT`.
-* This is the value of the interpolated corrected measure of the given face.
+* This is the value of the interpolated corrected gaussian curvature measure of the given face.
 *
-* @see `interpolated_corrected_measure_triangle()`
-* @see `interpolated_corrected_measure_quad()`
+* @see `interpolated_corrected_mean_curvature_measure_face()`
+* @see `interpolated_corrected_area_measure_face()`
 * @see `interpolated_corrected_measure_mesh()`
 */
 template<typename GT>
-typename GT::FT interpolated_corrected_measure_face(const std::vector<typename GT::Vector_3>& x,
-                                                    const std::vector<typename GT::Vector_3>& u,
-                                                    const Curvature_measure_index mu_i)
+typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& x,
+                                                                       const std::vector<typename GT::Vector_3>& u)
 {
-    std::size_t n = x.size();
-    CGAL_precondition(u.size() == n);
+    std::size_t n = u.size();
     CGAL_precondition(n >= 3);
 
-    // Triangle: use triangle formulas
-    if (n == 3)
-        return interpolated_corrected_measure_triangle<GT>(x[0], x[1], x[2],
-            u[0], u[1], u[2], mu_i);
+    typename GT::Construct_cross_product_vector_3 cross_product;
 
-    // Quad: use bilinear interpolation formulas
+    // Triangle: use triangle formula
+    if (n == 3)
+    {
+        return 0.5 * u[0] * cross_product(u[1], u[2]);
+    }
+    // Quad: use bilinear interpolation formula
     else if (n == 4)
-        // x[0]  _  x[1]  --->  x0  _  x1   (reason for changing order)
-        // x[3] |_| x[2]  --->  x2 |_| x3
-        return interpolated_corrected_measure_quad<GT>(x[0], x[1], x[3], x[2],
-            u[0], u[1], u[3], u[2], mu_i);
-
-    // N-gon: split into n triangles by barycenter and use triangle formulas for each
-    else {
-        typename GT::FT mu0 = 0;
-
-        // getting center of points
-        typename GT::Vector_3 xm =
-            std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-        xm /= n;
+    {
+        // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+        return (1 / 36.0) * (
+              (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(x[1] - x[0], x[3] - x[0])
+            + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(x[1] - x[0], x[2] - x[1])
+            + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(x[2] - x[3], x[3] - x[0])
+            + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(x[2] - x[3], x[2] - x[1])
+            );
+    }
+    // N-gon: split into n triangles by polygon center and use triangle formula for each
+    else
+    {
+        typename GT::FT mu2 = 0;
 
         // getting unit average normal of points
-        typename GT::Vector_3 um =
+        typename GT::Vector_3 uc =
             std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
-        um /= sqrt(um * um);
+        uc /= sqrt(uc * uc);
 
         // summing each triangle's measure after triangulation by barycenter split.
         for (std::size_t i = 0; i < n; i++)
         {
-            mu0 += interpolated_corrected_measure_triangle<GT>(x[i], x[(i + 1) % n], xm,
-                u[i], u[(i + 1) % n], um, mu_i);
+            mu2 += 0.5 * u[i] * cross_product(u[(i + 1) % n], uc);
         }
-        return mu0;
+        return mu2;
     }
 }
 
-
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
@@ -322,6 +331,22 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
         compute_vertex_normals(pmesh, vnm, np);
 
+    std::function
+        <GT::FT(const std::vector<typename GT::Vector_3>&, const std::vector<typename GT::Vector_3>&)>
+        iccm_function;
+    switch (mu_i)
+    {
+    case MU0_AREA_MEASURE:
+        iccm_function = &interpolated_corrected_area_measure_face<GT>;
+        break;
+    case MU1_MEAN_CURVATURE_MEASURE:
+        iccm_function = &interpolated_corrected_mean_curvature_measure_face<GT>;
+        break;
+    case MU2_GAUSSIAN_CURVATURE_MEASURE:
+        iccm_function = &interpolated_corrected_gaussian_curvature_measure_face<GT>;
+        break;
+    }
+
     for (face_descriptor f : faces(pmesh))
     {
         std::vector<typename GT::Vector_3> x;
@@ -334,7 +359,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
             u.push_back(get(vnm, v));
         }
 
-        put(fmm, f, interpolated_corrected_measure_face<GT>(x, u, mu_i));
+        put(fmm, f, iccm_function(x, u));
     }
 }
 

From 870c27670b52912cad7946c8e93e2993c473bb0d Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 1 Aug 2022 08:15:18 +0200
Subject: [PATCH 0033/1398] minor fixes (typename, doc)

---
 .../Curvatures/interpolated_corrected_curvature_measures.h  | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 250ea596c1c3..c9a70ee12ec8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -295,7 +295,9 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
 *
 * \cgalNamedParamsEnd
 *
-* @see `interpolated_corrected_measure_face()`
+* @see `interpolated_corrected_area_measure_face()`
+* @see `interpolated_corrected_mean_curvature_measure_face()`
+* @see `interpolated_corrected_gaussian_curvature_measure_face()`
 */
 template<typename PolygonMesh, typename FaceMeasureMap,
     typename NamedParameters = parameters::Default_named_parameters>
@@ -332,7 +334,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
         compute_vertex_normals(pmesh, vnm, np);
 
     std::function
-        <GT::FT(const std::vector<typename GT::Vector_3>&, const std::vector<typename GT::Vector_3>&)>
+        <typename GT::FT(const std::vector<typename GT::Vector_3>&, const std::vector<typename GT::Vector_3>&)>
         iccm_function;
     switch (mu_i)
     {

From 34b776d6c2e6ce0ec8cf54c6139478fb86b3c48e Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 1 Aug 2022 08:35:06 +0200
Subject: [PATCH 0034/1398] trailing spaces

---
 .../Polyhedron/Plugins/Display/Display_property_plugin.cpp  | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 91deb90680a8..66187583657e 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -721,7 +721,7 @@ private Q_SLOTS:
 
     maxEdgeLength = -1;
     setExpandingRadius(dock_widget->expandingRadiusSlider->value());
-    
+
     if(!item)
       return;
     SMesh& smesh = *item->face_graph();
@@ -835,9 +835,9 @@ private Q_SLOTS:
           );
 
       }
-      
+
       double outMin = 0, outMax = 5 * maxEdgeLength, base = 1.2;
-      
+
       expandRadius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
       dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expandRadius));
 

From 09cb2b1e6d1b78fe4e19031c40abb42fd12505cf Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 2 Aug 2022 23:12:23 +0200
Subject: [PATCH 0035/1398] some refactoring + implemented the anisotropic
 formulas function

---
 ...nterpolated_corrected_curvature_measures.h | 162 ++++++++++++++++--
 1 file changed, 143 insertions(+), 19 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index c9a70ee12ec8..1032413a9c5c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -47,7 +47,7 @@ enum Curvature_measure_index {
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected area measure of a specific face.
+* computes the interpolated corrected area measure (mu0) of a specific face.
 *
 * @tparam GT is the geometric traits class.
 *
@@ -62,8 +62,8 @@ enum Curvature_measure_index {
 * @see `interpolated_corrected_measure_mesh()`
 */
 template<typename GT>
-typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typename GT::Vector_3>& x,
-                                                         const std::vector<typename GT::Vector_3>& u)
+typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typename GT::Vector_3>& u,
+                                                         const std::vector<typename GT::Vector_3>& x = {})
 {
     std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
@@ -81,6 +81,7 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
     else if (n == 4)
     {
         // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+        // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
         return (1 / 36.0) * (
               (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(u[1] - u[0], u[3] - u[0])
             + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(u[1] - u[0], u[2] - u[1])
@@ -106,8 +107,10 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
         // summing each triangle's measure after triangulation by barycenter split.
         for (std::size_t i = 0; i < n; i++)
         {
-            const typename GT::Vector_3 um = (u[i] + u[(i + 1) % n] + uc) / 3.0;
-            mu0 += 0.5 * um * cross_product(x[(i + 1) % n] - x[i], xc - x[i]);
+            mu0 += interpolated_corrected_area_measure_face<GT>(
+                std::vector<typename GT::Vector_3> {u[i], u[i + 1 % n], uc},
+                std::vector<typename GT::Vector_3> {x[i], x[i + 1 % n], xc}
+            );
         }
         return mu0;
     }
@@ -116,7 +119,7 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected mean curvature measure of a specific face.
+* computes the interpolated corrected mean curvature measure (mu1) of a specific face.
 *
 * @tparam GT is the geometric traits class.
 *
@@ -131,8 +134,8 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
 * @see `interpolated_corrected_measure_mesh()`
 */
 template<typename GT>
-typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::vector<typename GT::Vector_3>& x,
-                                                                   const std::vector<typename GT::Vector_3>& u)
+typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
+                                                                   const std::vector<typename GT::Vector_3>& x = {})
 {
     std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
@@ -153,6 +156,7 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
     else if (n == 4)
     {
         // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+        // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
 
         const typename GT::Vector_3 u02 = u[2] - u[0];
         const typename GT::Vector_3 u13 = u[3] - u[1];
@@ -186,10 +190,10 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
         // summing each triangle's measure after triangulation by barycenter split.
         for (std::size_t i = 0; i < n; i++)
         {
-            const typename GT::Vector_3 um = (u[i] + u[(i+1)%n] + uc) / 3.0;
-            mu1 += 0.5 * um * (cross_product(uc - u[(i + 1) % n], x[i])
-                            + cross_product(u[i] - uc, x[(i + 1) % n])
-                            + cross_product(u[(i + 1) % n] - u[i], xc));
+            mu1 += interpolated_corrected_mean_curvature_measure_face<GT>(
+                std::vector<typename GT::Vector_3> {u[i], u[i + 1 % n], uc},
+                std::vector<typename GT::Vector_3> {x[i], x[i + 1 % n], xc}
+            );
         }
         return mu1;
     }
@@ -198,7 +202,7 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected gaussian curvature measure of a specific face.
+* computes the interpolated corrected gaussian curvature measure (mu2) of a specific face.
 *
 * @tparam GT is the geometric traits class.
 *
@@ -213,8 +217,8 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
 * @see `interpolated_corrected_measure_mesh()`
 */
 template<typename GT>
-typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& x,
-                                                                       const std::vector<typename GT::Vector_3>& u)
+typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
+                                                                       const std::vector<typename GT::Vector_3>& x = {})
 {
     std::size_t n = u.size();
     CGAL_precondition(n >= 3);
@@ -230,6 +234,7 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
     else if (n == 4)
     {
         // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+        // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
         return (1 / 36.0) * (
               (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(x[1] - x[0], x[3] - x[0])
             + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(x[1] - x[0], x[2] - x[1])
@@ -250,12 +255,131 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
         // summing each triangle's measure after triangulation by barycenter split.
         for (std::size_t i = 0; i < n; i++)
         {
-            mu2 += 0.5 * u[i] * cross_product(u[(i + 1) % n], uc);
+            mu2 += interpolated_corrected_gaussian_curvature_measure_face<GT>(
+                std::vector<typename GT::Vector_3> {u[i], u[i + 1 % n], uc}
+            );
         }
         return mu2;
     }
 }
 
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* computes the interpolated corrected anisotropic measure (muXY) of a specific face.
+*
+* @tparam GT is the geometric traits class.
+*
+* @param u is a vector of the vertex nomrals of the face.
+* @param x is a vector of the vertex positions of the face.
+*
+* @return an array of scalar values for each combination of the standard basis (3x3) of type `std::array<typename GT::FT, 3 * 3>`.
+* These are the values of the interpolated corrected anisotropic measure of the given face.
+*
+* @see `interpolated_corrected_anisotropic_measure_mesh()`
+*/
+template<typename GT>
+std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_face(const std::vector<typename GT::Vector_3>& u,
+                                                                                   const std::vector<typename GT::Vector_3>& x)
+{
+    std::size_t n = x.size();
+    CGAL_precondition(u.size() == n);
+    CGAL_precondition(n >= 3);
+
+    typename GT::Construct_cross_product_vector_3 cross_product;
+    std::array<typename GT::FT, 3 * 3> muXY;
+
+    // Triangle: use triangle formula
+    if (n == 3)
+    {
+        const typename GT::Vector_3 u01 = u[1] - u[0];
+        const typename GT::Vector_3 u02 = u[2] - u[0];
+        const typename GT::Vector_3 x01 = x[1] - x[0];
+        const typename GT::Vector_3 x02 = x[2] - x[0];
+        const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
+
+        for (std::size_t ix = 0; ix < 3; ix++)
+        {
+            const typename GT::Vector_3 X(0, 0, 0);
+            X[ix] = 1;
+            for (std::size_t iy = 0; iy < 3; iy++)
+                muXY[ix * 3 + iy] = 0.5 * um * (cross_product(u02[iy] * X, x01) - cross_product(u01[iy] * X, x02));
+        }
+    }
+    // Quad: use bilinear interpolation formula
+    else if (n == 4)
+    {
+        // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+        // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
+        for (std::size_t ix = 0; ix < 3; ix++)
+        {
+            const typename GT::Vector_3 X(0, 0, 0);
+            X[ix] = 1;
+            const typename GT::Vector_3 u0xX = cross_product(u[0], X);
+            const typename GT::Vector_3 u1xX = cross_product(u[1], X);
+            const typename GT::Vector_3 u2xX = cross_product(u[2], X);
+            const typename GT::Vector_3 u3xX = cross_product(u[3], X);
+
+            for (std::size_t iy = 0; iy < 3; iy++)
+                muXY[ix * 3 + iy] = (1 / 72.0) * (
+
+                    u[0][iy] * (    u0xX * (    - x[0] - 11 * x[1] + 13 * x[3] -      x[2])
+                                  + u1xX * ( -5 * x[0] -  7 * x[1] + 11 * x[3] +      x[2])
+                                  + u3xX * (      x[0] -  7 * x[1] + 11 * x[3] -  5 * x[2])
+                                  + u2xX * (    - x[0] -  5 * x[1] +  7 * x[3] -      x[2])
+                      )
+                  + u[1][iy] * (    u0xX * ( 13 * x[0] -      x[1] -  7 * x[3] -  5 * x[2])
+                                  + u1xX * ( 17 * x[0] -  5 * x[1] -  5 * x[3] -  7 * x[2])
+                                  + u3xX * (  5 * x[0] +      x[1] +      x[3] -  7 * x[2])
+                                  + u2xX * (  7 * x[0] -      x[1] +  5 * x[3] - 11 * x[2])
+                      )
+                  + u[2][iy] * (    u0xX * (-11 * x[0] +  5 * x[1] -      x[3] +  7 * x[2])
+                                  + u1xX * (- 7 * x[0] +      x[1] +      x[3] +  5 * x[2])
+                                  + u3xX * (- 7 * x[0] -  5 * x[1] -  5 * x[3] + 17 * x[2])
+                                  + u2xX * (- 5 * x[0] -  7 * x[1] -      x[3] + 13 * x[2])
+                      )
+                  + u[3][iy] * (    u0xX * (-     x[0] +  7 * x[1] -  5 * x[3] -      x[2])
+                                  + u1xX * (- 5 * x[0] + 11 * x[1] -  7 * x[3] +      x[2])
+                                  + u3xX * (      x[0] + 11 * x[1] -  7 * x[3] -  5 * x[2])
+                                  + u2xX * (-     x[0] + 13 * x[1] - 11 * x[3] -      x[2])
+                      )
+
+                  );
+        }
+    }
+    // N-gon: split into n triangles by polygon center and use triangle formula for each
+    else
+    {
+        typename GT::FT muXY = 0;
+
+        // getting center of points
+        typename GT::Vector_3 xc =
+            std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+        xc /= n;
+
+        // getting unit average normal of points
+        typename GT::Vector_3 uc =
+            std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+        uc /= sqrt(uc * uc);
+
+        // summing each triangle's measure after triangulation by barycenter split.
+        for (std::size_t i = 0; i < n; i++)
+        {
+            std::array<typename GT::FT, 3 * 3> muXY_curr_triangle =
+                interpolated_corrected_anisotropic_measure_face<GT>(
+                    std::vector<typename GT::Vector_3> {u[i], u[i + 1 % n], uc},
+                    std::vector<typename GT::Vector_3> {x[i], x[i + 1 % n], xc}
+                );
+
+            for (std::size_t ix = 0; ix < 3; ix++)
+                for (std::size_t iy = 0; iy < 3; iy++)
+                    muXY[ix * 3 + iy] += muXY_curr_triangle[ix * 3 + iy];
+        }
+    }
+    return muXY;
+}
+
+
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
@@ -333,6 +457,8 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
         compute_vertex_normals(pmesh, vnm, np);
 
+    typedef typename property_map_value<PolygonMesh, FaceMeasureMap>::type measure;
+
     std::function
         <typename GT::FT(const std::vector<typename GT::Vector_3>&, const std::vector<typename GT::Vector_3>&)>
         iccm_function;
@@ -361,7 +487,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
             u.push_back(get(vnm, v));
         }
 
-        put(fmm, f, iccm_function(x, u));
+        put(fmm, f, iccm_function(u, x));
     }
 }
 
@@ -559,7 +685,5 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     }
 }
 
-
-
 }
 }

From 83093295f52e67efe6d25b2b764a482646de5e84 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 3 Aug 2022 14:30:52 +0200
Subject: [PATCH 0036/1398] Principal Curvatures wip

---
 .../interpolated_corrected_curvatures.cpp     |   2 +-
 ...nterpolated_corrected_curvature_measures.h | 266 +++++++++++++++++-
 2 files changed, 260 insertions(+), 8 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index 5359315f0fa0..4b8a9e6cfe7d 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -25,7 +25,7 @@ int main(int argc, char* argv[])
   Mesh g1;
   const std::string filename = (argc>1) ?
       argv[1] :
-      CGAL::data_file_path("meshes/cylinder.off");
+      CGAL::data_file_path("meshes/sphere_diff_faces.obj");
 
   if(!CGAL::IO::read_polygon_mesh(filename, g1))
   {
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 1032413a9c5c..618124e7fc74 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -13,7 +13,6 @@
 
 #ifndef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
 #define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
-#endif
 
 #include <CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h>
 
@@ -22,6 +21,7 @@
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/property_map.h>
+#include <CGAL/Eigen_diagonalize_traits.h>
 
 #include <numeric>
 #include <queue>
@@ -82,7 +82,7 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
     {
         // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
         // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
-        return (1 / 36.0) * (
+        return (1.0 / 36.0) * (
               (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(u[1] - u[0], u[3] - u[0])
             + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(u[1] - u[0], u[2] - u[1])
             + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(u[2] - u[3], u[3] - u[0])
@@ -165,7 +165,7 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
         const typename GT::Vector_3 x3_cross = cross_product(u02, x[3]);
         const typename GT::Vector_3 x2_cross = -cross_product(u13, x[2]);
 
-        return (1 / 12.0) * (
+        return (1.0 / 12.0) * (
               u[0] * (2 * x0_cross - cross_product((u[3] + u[2]), x[1]) + cross_product((u[1] + u[2]), x[3]) + x2_cross)
             + u[1] * (cross_product((u[3] + u[2]), x[0]) + 2 * x1_cross + x3_cross - cross_product((u[0] + u[3]), x[2]))
             + u[3] * (-cross_product((u[1] + u[2]), x[0]) + x1_cross + 2 * x3_cross + cross_product((u[0] + u[1]), x[2]))
@@ -235,7 +235,7 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
     {
         // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
         // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
-        return (1 / 36.0) * (
+        return (1.0 / 36.0) * (
               (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(x[1] - x[0], x[3] - x[0])
             + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(x[1] - x[0], x[2] - x[1])
             + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(x[2] - x[3], x[3] - x[0])
@@ -273,7 +273,7 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
 * @param u is a vector of the vertex nomrals of the face.
 * @param x is a vector of the vertex positions of the face.
 *
-* @return an array of scalar values for each combination of the standard basis (3x3) of type `std::array<typename GT::FT, 3 * 3>`.
+* @return an array of scalar values for each combination of the standard basis (3x3) of type `std::array<GT::FT, 3 * 3>`.
 * These are the values of the interpolated corrected anisotropic measure of the given face.
 *
 * @see `interpolated_corrected_anisotropic_measure_mesh()`
@@ -321,7 +321,7 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
             const typename GT::Vector_3 u3xX = cross_product(u[3], X);
 
             for (std::size_t iy = 0; iy < 3; iy++)
-                muXY[ix * 3 + iy] = (1 / 72.0) * (
+                muXY[ix * 3 + iy] = (1.0 / 72.0) * (
 
                     u[0][iy] * (    u0xX * (    - x[0] - 11 * x[1] + 13 * x[3] -      x[2])
                                   + u1xX * ( -5 * x[0] -  7 * x[1] + 11 * x[3] +      x[2])
@@ -433,6 +433,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
 {
 
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+
     typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
     typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
@@ -491,6 +492,98 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     }
 }
 
+
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* computes the interpolated corrected anisotropic measure on each face of the mesh
+*
+* @tparam PolygonMesh a model of `FaceGraph`
+* @tparam FaceMeasureMap a a model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `std::array<GT::FT, 3 * 3>` as value type.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+*
+* @param pmesh the polygon mesh
+* @param fmm (face measure map) the property map used for storing the computed interpolated corrected measure
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*
+* \cgalNamedParamsBegin
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_normal_map}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Vector_3` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals should be
+*                     computed inside the function body.}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+*
+* @see `interpolated_corrected_anisotropic_measure_face()`
+* @see `interpolated_corrected_measure_mesh()`
+*/
+template<typename PolygonMesh, typename FaceMeasureMap,
+    typename NamedParameters = parameters::Default_named_parameters>
+    void
+    interpolated_corrected_anisotropic_measure_mesh(const PolygonMesh& pmesh,
+        FaceMeasureMap fmm,
+        const NamedParameters& np = parameters::default_values())
+{
+
+    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+
+    typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
+    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
+    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
+        NamedParameters,
+        Default_vector_map>::type       VNM;
+
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+    using parameters::is_default_parameter;
+
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
+
+    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
+        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+            get_const_property_map(CGAL::vertex_point, pmesh));
+
+    VNM vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+        get(Vector_map_tag(), pmesh));
+
+    if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
+        compute_vertex_normals(pmesh, vnm, np);
+
+    for (face_descriptor f : faces(pmesh))
+    {
+        std::vector<typename GT::Vector_3> x;
+        std::vector<typename GT::Vector_3> u;
+
+        for (vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
+        {
+            typename GT::Point_3 p = get(vpm, v);
+            x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
+            u.push_back(get(vnm, v));
+        }
+
+        put(fmm, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
+    }
+}
+
+
 //
 //template<typename GT>
 //typename GT::FT triangle_in_ball_ratio_1(const typename GT::Vector_3 x1,
@@ -556,6 +649,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
     using parameters::get_parameter;
 
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
 
@@ -613,6 +707,85 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
     put(vcm, v, corrected_mui);
 }
 
+template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvatureMap,
+    typename NamedParameters = parameters::Default_named_parameters>
+    void expand_interpolated_corrected_anisotropic_measure_vertex(const PolygonMesh& pmesh,
+        FaceMeasureMap fmm,
+        VertexCurvatureMap vcm,
+        const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+        const NamedParameters& np = parameters::default_values())
+{
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+
+    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+
+    const typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
+        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0.01);
+
+    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
+        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+            get_const_property_map(CGAL::vertex_point, pmesh));
+
+
+    std::queue<face_descriptor> bfs_q;
+    std::unordered_set<face_descriptor> bfs_v;
+
+    typename GT::Point_3 vp = get(vpm, v);
+    typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
+
+    Eigen::Matrix<typename GT::FT, 3, 3> corrected_muXY = {
+        { 0.0, 0.0, 0.0},
+        { 0.0, 0.0, 0.0},
+        { 0.0, 0.0, 0.0}
+    };
+
+    for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+        if (f != boost::graph_traits<PolygonMesh>::null_face())
+        {
+            bfs_q.push(f);
+            bfs_v.insert(f);
+        }
+    }
+    while (!bfs_q.empty()) {
+        face_descriptor fi = bfs_q.front();
+        bfs_q.pop();
+
+        // looping over vertices in face to get point coordinates
+        std::vector<typename GT::Vector_3> x;
+        for (vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+        {
+            typename GT::Point_3 pi = get(vpm, vi);
+            x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
+        }
+
+        const typename GT::FT f_ratio = face_in_ball_ratio_2<GT>(x, r, c);
+
+        if (f_ratio > 0.00000001)
+        {
+            std::array<typename GT::FT, 3 * 3> muXY_face = get(fmm, fi);
+
+            for (std::size_t ix = 0; ix < 3; ix++)
+                for (std::size_t iy = 0; iy < 3; iy++)
+                    corrected_muXY(ix, iy) += muXY_face[ix * 3 + iy];
+
+            for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+            {
+                if (bfs_v.find(fj) == bfs_v.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
+                {
+                    bfs_q.push(fj);
+                    bfs_v.insert(fj);
+                }
+            }
+        }
+    }
+
+    put(vcm, v, corrected_muXY);
+}
+
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
@@ -620,8 +793,10 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         const NamedParameters& np = parameters::default_values())
 {
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
     typedef std::unordered_map<face_descriptor, typename GT::FT> FaceMeasureMap_tag;
+
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
     typedef std::unordered_map<vertex_descriptor, typename GT::FT> VertexMeasureMap_tag;
 
@@ -656,8 +831,10 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         const NamedParameters& np = parameters::default_values())
 {
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
     typedef std::unordered_map<face_descriptor, typename GT::FT> FaceMeasureMap_tag;
+
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
     typedef std::unordered_map<vertex_descriptor, typename GT::FT> VertexMeasureMap_tag;
 
@@ -685,5 +862,80 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     }
 }
 
+template<typename PolygonMesh, typename VertexCurvatureMap,
+    typename NamedParameters = parameters::Default_named_parameters>
+    void interpolated_corrected_principal_curvature(const PolygonMesh& pmesh,
+        VertexCurvatureMap vcm,
+        const NamedParameters& np = parameters::default_values())
+{
+    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+
+    typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
+    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
+    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
+        NamedParameters,
+        Default_vector_map>::type       VNM;
+
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+    using parameters::is_default_parameter;
+
+    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
+        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+            get_const_property_map(CGAL::vertex_point, pmesh));
+
+    VNM vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+        get(Vector_map_tag(), pmesh));
+
+    if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
+        compute_vertex_normals(pmesh, vnm, np);
+
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef std::unordered_map<face_descriptor, typename GT::FT> FaceScalarMeasureMap_tag;
+    // using std:: array to store FT values on the 9 combinations of the standard 3D basis
+    typedef std::unordered_map<face_descriptor, std::array<typename GT::FT, 3 * 3>> FaceArrayMeasureMap_tag;
+
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef std::unordered_map<vertex_descriptor, typename GT::FT> VertexScalarMeasureMap_tag;
+    // using Eigen matrix to store & Process FT values on the 9 combinations of the standard 3D basis
+    typedef std::unordered_map<vertex_descriptor, Eigen::Matrix<typename GT::FT, 3, 3>> VertexMatrixMeasureMap_tag;
+
+
+    FaceScalarMeasureMap_tag mu0_init;
+    boost::associative_property_map<FaceScalarMeasureMap_tag>
+        mu0_map(mu0_init);
+
+    FaceArrayMeasureMap_tag muXY_init;
+    boost::associative_property_map<FaceArrayMeasureMap_tag>
+        muXY_map(muXY_init);
+
+    VertexScalarMeasureMap_tag mu0_expand_init;
+    boost::associative_property_map<VertexScalarMeasureMap_tag>
+        mu0_expand_map(mu0_expand_init);
+
+    VertexMatrixMeasureMap_tag muXY_expand_init;
+    boost::associative_property_map<VertexMatrixMeasureMap_tag>
+        muXY_expand_map(muXY_expand_init);
+
+    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE);
+    interpolated_corrected_anisotropic_measure_mesh(pmesh, muXY_map);
+
+    for (vertex_descriptor v : vertices(pmesh))
+    {
+        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu0_expand_map, v, np);
+        expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, muXY_map, muXY_expand_map, v, np);
+
+
+        
+        /*typename GT::FT v_mu0 = get(mu0_expand_map, v);
+        if (v_mu0 > 0.00000001)
+            put(vcm, v, get(mu2_expand_map, v) / v_mu0);
+        else
+            put(vcm, v, 0);*/
+    }
 }
-}
+
+} // namespace Polygon_mesh_processing
+} // namespace CGAL
+
+#endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
\ No newline at end of file

From 24edaa24b5fc54bf85ac21b9c291610da6bbbf1c Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 3 Aug 2022 18:59:08 +0200
Subject: [PATCH 0037/1398] principal curvatures (yet to decompose MuXY Matrix)

---
 .../interpolated_corrected_curvatures.cpp     | 23 ++++++++++--
 ...nterpolated_corrected_curvature_measures.h | 36 +++++++++++++------
 2 files changed, 46 insertions(+), 13 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index 4b8a9e6cfe7d..28e6e0ef81cb 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -18,6 +18,14 @@ typedef boost::graph_traits<Mesh>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
 typedef std::unordered_map<face_descriptor, EpicKernel::FT> FaceMeasureMap_tag;
 typedef std::unordered_map<vertex_descriptor, EpicKernel::FT> vertexMeasureMap_tag;
+typedef std::unordered_map<vertex_descriptor, std::tuple<
+    EpicKernel::FT,
+    EpicKernel::FT,
+    Eigen::Vector<EpicKernel::FT, 3>,
+    Eigen::Vector<EpicKernel::FT, 3>
+    >>
+vertexPrincipleCurvatureMap_tag;
+
 
 
 int main(int argc, char* argv[])
@@ -38,16 +46,27 @@ int main(int argc, char* argv[])
   boost::associative_property_map<vertexMeasureMap_tag>
       mean_curvature_map(mean_curvature_init), gaussian_curvature_map(gaussian_curvature_init);
 
+  vertexPrincipleCurvatureMap_tag principle_curvature_init;
+  boost::associative_property_map<vertexPrincipleCurvatureMap_tag> principle_curvature_map(principle_curvature_init);
+
   PMP::interpolated_corrected_mean_curvature(
       g1,
       mean_curvature_map
-      );
+  );
   PMP::interpolated_corrected_gaussian_curvature(
       g1,
       gaussian_curvature_map
   );
+  PMP::interpolated_corrected_principal_curvatures(
+      g1,
+      principle_curvature_map
+  );
 
   for (vertex_descriptor v : vertices(g1))
+  {
+    auto PC = get(principle_curvature_map, v);
       std::cout << v.idx() << ": HC = " << get(mean_curvature_map, v)
-                           << ", GC = " << get(gaussian_curvature_map, v) << "\n";
+                           << ", GC = " << get(gaussian_curvature_map, v) << "\n"
+                           << ", PC = [ " << std::get<0>(PC) << " , " << std::get<1>(PC) << " ]\n";
+  }
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 618124e7fc74..83f63b74b54e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -690,7 +690,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
 
         const typename GT::FT f_ratio = face_in_ball_ratio_2<GT>(x, r, c);
 
-        if (f_ratio > 0.00000001)
+        if (f_ratio != 0.0)
         {
             corrected_mui += f_ratio * get(fmm, fi);
             for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
@@ -764,7 +764,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
 
         const typename GT::FT f_ratio = face_in_ball_ratio_2<GT>(x, r, c);
 
-        if (f_ratio > 0.00000001)
+        if (f_ratio != 0.0)
         {
             std::array<typename GT::FT, 3 * 3> muXY_face = get(fmm, fi);
 
@@ -817,7 +817,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         expand_interpolated_corrected_measure_vertex(pmesh, mu1_map, mu1_expand_map, v, np);
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
-        if (v_mu0 > 0.00000001)
+        if (v_mu0 != 0.0)
             put(vcm, v, 0.5 * get(mu1_expand_map, v) / v_mu0);
         else
             put(vcm, v, 0);
@@ -855,7 +855,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         expand_interpolated_corrected_measure_vertex(pmesh, mu2_map, mu2_expand_map, v, np);
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
-        if(v_mu0 > 0.00000001)
+        if(v_mu0 != 0.0)
             put(vcm, v, get(mu2_expand_map, v) / v_mu0);
         else
             put(vcm, v, 0);
@@ -864,7 +864,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
-    void interpolated_corrected_principal_curvature(const PolygonMesh& pmesh,
+    void interpolated_corrected_principal_curvatures(const PolygonMesh& pmesh,
         VertexCurvatureMap vcm,
         const NamedParameters& np = parameters::default_values())
 {
@@ -925,13 +925,27 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu0_expand_map, v, np);
         expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, muXY_map, muXY_expand_map, v, np);
 
+        typename GT::FT v_mu0 = get(mu0_expand_map, v);
+        Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = get(muXY_expand_map, v);
+        typename GT::Vector_3 u_GT = get(vnm, v);
 
-        
-        /*typename GT::FT v_mu0 = get(mu0_expand_map, v);
-        if (v_mu0 > 0.00000001)
-            put(vcm, v, get(mu2_expand_map, v) / v_mu0);
-        else
-            put(vcm, v, 0);*/
+        Eigen::Vector<typename GT::FT, 3> u(u_GT.x(), u_GT.y(), u_GT.z());
+
+        const typename GT::FT K = 1000 * v_mu0;
+
+        v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
+
+        Eigen::Vector<typename GT::FT, 3> eig_vals;
+        Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs;
+
+
+        //(WIP)
+        EigenDecomposition< 3, typename GT::FT>::getEigenDecomposition(v_muXY, eig_vecs, eig_vals);
+
+        put(vcm, v, std::make_tuple((v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
+            (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
+            eig_vecs.column(0),
+            eig_vecs.column(1)));
     }
 }
 

From 24551e2cbb2b38db5aabc2f31395c38651e3d635 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Thu, 4 Aug 2022 10:51:45 +0200
Subject: [PATCH 0038/1398] principal curvatures completed (but not properly
 tested)

---
 .../interpolated_corrected_curvatures.cpp     |  2 +-
 ...nterpolated_corrected_curvature_measures.h | 60 ++++++++++++-------
 2 files changed, 40 insertions(+), 22 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index 28e6e0ef81cb..b804ae061cf4 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -33,7 +33,7 @@ int main(int argc, char* argv[])
   Mesh g1;
   const std::string filename = (argc>1) ?
       argv[1] :
-      CGAL::data_file_path("meshes/sphere_diff_faces.obj");
+      CGAL::data_file_path("meshes/small_bunny.obj");
 
   if(!CGAL::IO::read_polygon_mesh(filename, g1))
   {
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 83f63b74b54e..4b6a2f5149d9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -21,7 +21,7 @@
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/property_map.h>
-#include <CGAL/Eigen_diagonalize_traits.h>
+#include <Eigen/Eigenvalues> 
 
 #include <numeric>
 #include <queue>
@@ -287,7 +287,7 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
     CGAL_precondition(n >= 3);
 
     typename GT::Construct_cross_product_vector_3 cross_product;
-    std::array<typename GT::FT, 3 * 3> muXY;
+    std::array<typename GT::FT, 3 * 3> muXY {0};
 
     // Triangle: use triangle formula
     if (n == 3)
@@ -300,8 +300,14 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
 
         for (std::size_t ix = 0; ix < 3; ix++)
         {
-            const typename GT::Vector_3 X(0, 0, 0);
-            X[ix] = 1;
+            typename GT::Vector_3 X;
+            if (ix == 0)
+                X = typename GT::Vector_3(1, 0, 0);
+            if (ix == 1)
+                X = typename GT::Vector_3(0, 1, 0);
+            if (ix == 2)                  
+                X = typename GT::Vector_3(0, 0, 1);
+
             for (std::size_t iy = 0; iy < 3; iy++)
                 muXY[ix * 3 + iy] = 0.5 * um * (cross_product(u02[iy] * X, x01) - cross_product(u01[iy] * X, x02));
         }
@@ -313,8 +319,14 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
         // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
         for (std::size_t ix = 0; ix < 3; ix++)
         {
-            const typename GT::Vector_3 X(0, 0, 0);
-            X[ix] = 1;
+            typename GT::Vector_3 X;
+            if (ix == 0)
+                X = typename GT::Vector_3(1, 0, 0);
+            if (ix == 1)
+                X = typename GT::Vector_3(0, 1, 0);
+            if (ix == 2)
+                X = typename GT::Vector_3(0, 0, 1);
+
             const typename GT::Vector_3 u0xX = cross_product(u[0], X);
             const typename GT::Vector_3 u1xX = cross_product(u[1], X);
             const typename GT::Vector_3 u2xX = cross_product(u[2], X);
@@ -350,8 +362,6 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
     // N-gon: split into n triangles by polygon center and use triangle formula for each
     else
     {
-        typename GT::FT muXY = 0;
-
         // getting center of points
         typename GT::Vector_3 xc =
             std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
@@ -654,7 +664,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
 
     const typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
-        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0.01);
+        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0.1);
 
     typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
@@ -737,11 +747,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
     typename GT::Point_3 vp = get(vpm, v);
     typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
 
-    Eigen::Matrix<typename GT::FT, 3, 3> corrected_muXY = {
-        { 0.0, 0.0, 0.0},
-        { 0.0, 0.0, 0.0},
-        { 0.0, 0.0, 0.0}
-    };
+    Eigen::Matrix<typename GT::FT, 3, 3> corrected_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
 
     for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
         if (f != boost::graph_traits<PolygonMesh>::null_face())
@@ -935,17 +941,29 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
         v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
 
-        Eigen::Vector<typename GT::FT, 3> eig_vals;
-        Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs;
+        //(WIP)
+        Eigen::SelfAdjointEigenSolver<Eigen::Matrix <typename GT::FT, 3, 3>> eigensolver;
 
+        eigensolver.computeDirect(v_muXY);
+        
+        if (eigensolver.info() != Eigen::Success)
+        {
+            put(vcm, v, std::make_tuple(
+                0,
+                0,
+                Eigen::Vector<typename GT::FT, 3>(.0,.0,.0),
+                Eigen::Vector<typename GT::FT, 3>(.0, .0, .0)));
+            continue;
+        }
 
-        //(WIP)
-        EigenDecomposition< 3, typename GT::FT>::getEigenDecomposition(v_muXY, eig_vecs, eig_vals);
+        Eigen::Vector<typename GT::FT, 3> eig_vals = eigensolver.eigenvalues();
+        Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs = eigensolver.eigenvectors();
 
-        put(vcm, v, std::make_tuple((v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
+        put(vcm, v, std::make_tuple(
             (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
-            eig_vecs.column(0),
-            eig_vecs.column(1)));
+            (v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
+            eig_vecs.col(1),
+            eig_vecs.col(0)));
     }
 }
 

From c4db1600fda9f9fa3a50bc005db84f5122107382 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Thu, 4 Aug 2022 11:01:09 +0200
Subject: [PATCH 0039/1398] trim whitespaces

---
 .../Curvatures/interpolated_corrected_curvature_measures.h  | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 4b6a2f5149d9..4525628f5645 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -21,7 +21,7 @@
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/property_map.h>
-#include <Eigen/Eigenvalues> 
+#include <Eigen/Eigenvalues>
 
 #include <numeric>
 #include <queue>
@@ -305,7 +305,7 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
                 X = typename GT::Vector_3(1, 0, 0);
             if (ix == 1)
                 X = typename GT::Vector_3(0, 1, 0);
-            if (ix == 2)                  
+            if (ix == 2)
                 X = typename GT::Vector_3(0, 0, 1);
 
             for (std::size_t iy = 0; iy < 3; iy++)
@@ -945,7 +945,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         Eigen::SelfAdjointEigenSolver<Eigen::Matrix <typename GT::FT, 3, 3>> eigensolver;
 
         eigensolver.computeDirect(v_muXY);
-        
+
         if (eigensolver.info() != Eigen::Success)
         {
             put(vcm, v, std::make_tuple(

From 85332fed6d9243a03bcb93edf8a08fc05e091799 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 5 Aug 2022 13:58:52 +0200
Subject: [PATCH 0040/1398] according to some of the review comments on the
 pull

---
 .../Polygon_mesh_processing/CMakeLists.txt    |  9 ++--
 ...nterpolated_corrected_curvature_measures.h | 51 +++++++++++--------
 2 files changed, 33 insertions(+), 27 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index d6f4e273516f..4783d957589a 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -5,7 +5,7 @@ cmake_minimum_required(VERSION 3.1...3.23)
 project(Polygon_mesh_processing_Examples)
 
 # CGAL and its components
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED)
 
 # Boost and its components
 find_package(Boost REQUIRED)
@@ -102,12 +102,11 @@ create_single_source_cgal_program("orientation_pipeline_example.cpp")
 #create_single_source_cgal_program( "snapping_example.cpp")
 create_single_source_cgal_program("match_faces.cpp")
 create_single_source_cgal_program("cc_compatible_orientations.cpp")
-create_single_source_cgal_program("interpolated_corrected_curvatures.cpp")
 
-if(CGAL_Qt5_FOUND)
+if(TARGET CGAL::Eigen3_support)
 
-  #link it with the required CGAL libraries
-  target_link_libraries(interpolated_corrected_curvatures PUBLIC CGAL::CGAL_Basic_viewer)
+  create_single_source_cgal_program("interpolated_corrected_curvatures.cpp")
+  target_link_libraries(interpolated_corrected_curvatures PUBLIC CGAL::Eigen3_support)
 
 endif()
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 4525628f5645..33cbe05e576d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -17,10 +17,10 @@
 #include <CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h>
 
 #include <CGAL/assertions.h>
-#include <CGAL/Polygon_mesh_processing/internal/named_params_helper.h>
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/property_map.h>
+#include <CGAL/boost/graph/named_params_helper.h>
 #include <Eigen/Eigenvalues>
 
 #include <numeric>
@@ -83,10 +83,10 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
         // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
         // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
         return (1.0 / 36.0) * (
-              (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(u[1] - u[0], u[3] - u[0])
-            + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(u[1] - u[0], u[2] - u[1])
-            + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(u[2] - u[3], u[3] - u[0])
-            + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(u[2] - u[3], u[2] - u[1])
+              (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(x[1] - x[0], x[3] - x[0])
+            + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(x[1] - x[0], x[2] - x[1])
+            + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(x[2] - x[3], x[3] - x[0])
+            + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(x[2] - x[3], x[2] - x[1])
             );
     }
     // N-gon: split into n triangles by polygon center and use triangle formula for each
@@ -108,8 +108,8 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
         for (std::size_t i = 0; i < n; i++)
         {
             mu0 += interpolated_corrected_area_measure_face<GT>(
-                std::vector<typename GT::Vector_3> {u[i], u[i + 1 % n], uc},
-                std::vector<typename GT::Vector_3> {x[i], x[i + 1 % n], xc}
+                std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
+                std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
             );
         }
         return mu0;
@@ -191,8 +191,8 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
         for (std::size_t i = 0; i < n; i++)
         {
             mu1 += interpolated_corrected_mean_curvature_measure_face<GT>(
-                std::vector<typename GT::Vector_3> {u[i], u[i + 1 % n], uc},
-                std::vector<typename GT::Vector_3> {x[i], x[i + 1 % n], xc}
+                std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
+                std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
             );
         }
         return mu1;
@@ -236,10 +236,10 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
         // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
         // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
         return (1.0 / 36.0) * (
-              (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(x[1] - x[0], x[3] - x[0])
-            + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(x[1] - x[0], x[2] - x[1])
-            + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(x[2] - x[3], x[3] - x[0])
-            + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(x[2] - x[3], x[2] - x[1])
+              (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(u[1] - u[0], u[3] - u[0])
+            + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(u[1] - u[0], u[2] - u[1])
+            + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(u[2] - u[3], u[3] - u[0])
+            + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(u[2] - u[3], u[2] - u[1])
             );
     }
     // N-gon: split into n triangles by polygon center and use triangle formula for each
@@ -256,7 +256,7 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
         for (std::size_t i = 0; i < n; i++)
         {
             mu2 += interpolated_corrected_gaussian_curvature_measure_face<GT>(
-                std::vector<typename GT::Vector_3> {u[i], u[i + 1 % n], uc}
+                std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc}
             );
         }
         return mu2;
@@ -377,8 +377,8 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
         {
             std::array<typename GT::FT, 3 * 3> muXY_curr_triangle =
                 interpolated_corrected_anisotropic_measure_face<GT>(
-                    std::vector<typename GT::Vector_3> {u[i], u[i + 1 % n], uc},
-                    std::vector<typename GT::Vector_3> {x[i], x[i + 1 % n], xc}
+                    std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
+                    std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
                 );
 
             for (std::size_t ix = 0; ix < 3; ix++)
@@ -486,10 +486,11 @@ template<typename PolygonMesh, typename FaceMeasureMap,
         break;
     }
 
+    std::vector<typename GT::Vector_3> x;
+    std::vector<typename GT::Vector_3> u;
+
     for (face_descriptor f : faces(pmesh))
     {
-        std::vector<typename GT::Vector_3> x;
-        std::vector<typename GT::Vector_3> u;
 
         for (vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
         {
@@ -499,6 +500,8 @@ template<typename PolygonMesh, typename FaceMeasureMap,
         }
 
         put(fmm, f, iccm_function(u, x));
+        x.clear();
+        u.clear();
     }
 }
 
@@ -577,10 +580,11 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
         compute_vertex_normals(pmesh, vnm, np);
 
+    std::vector<typename GT::Vector_3> x;
+    std::vector<typename GT::Vector_3> u;
+
     for (face_descriptor f : faces(pmesh))
     {
-        std::vector<typename GT::Vector_3> x;
-        std::vector<typename GT::Vector_3> u;
 
         for (vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
         {
@@ -590,6 +594,9 @@ template<typename PolygonMesh, typename FaceMeasureMap,
         }
 
         put(fmm, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
+        x.clear();
+        u.clear();
+
     }
 }
 
@@ -634,8 +641,8 @@ typename GT::FT face_in_ball_ratio_2(const std::vector<typename GT::Vector_3>& x
     for (const typename GT::Vector_3 xi : x)
     {
         const typename GT::FT d_sq = (xi - c).squared_length();
-        d_max = std::max(d_sq, d_max);
-        d_min = std::min(d_sq, d_min);
+        d_max = (std::max)(d_sq, d_max);
+        d_min = (std::min)(d_sq, d_min);
     }
 
     if (d_max <= r * r) return 1.0;

From 7473a3e2dc702b1529e40f4931b95faa81430591 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 8 Aug 2022 05:05:28 +0200
Subject: [PATCH 0041/1398] Optimizing the expanding functions to compute
 intersections only once per curvature

---
 ...nterpolated_corrected_curvature_measures.h | 42 +++++++++++--------
 1 file changed, 25 insertions(+), 17 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 33cbe05e576d..289878b9a9bf 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -657,8 +657,10 @@ typename GT::FT face_in_ball_ratio_2(const std::vector<typename GT::Vector_3>& x
 template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void expand_interpolated_corrected_measure_vertex(const PolygonMesh& pmesh,
-        FaceMeasureMap fmm,
-        VertexCurvatureMap vcm,
+        FaceMeasureMap area_fmm,
+        FaceMeasureMap curvature_fmm,
+        VertexCurvatureMap area_vcm,
+        VertexCurvatureMap curvature_vcm,
         const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
         const NamedParameters& np = parameters::default_values())
 {
@@ -684,6 +686,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
     typename GT::Point_3 vp = get(vpm, v);
     typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
 
+    typename GT::FT corrected_mu0 = 0;
     typename GT::FT corrected_mui = 0;
 
     for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
@@ -709,7 +712,8 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
 
         if (f_ratio != 0.0)
         {
-            corrected_mui += f_ratio * get(fmm, fi);
+            corrected_mu0 += f_ratio * get(area_fmm, fi);
+            corrected_mui += f_ratio * get(curvature_fmm, fi);
             for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
             {
                 if (bfs_v.find(fj) == bfs_v.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
@@ -720,15 +724,18 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
             }
         }
     }
-
-    put(vcm, v, corrected_mui);
+    put(area_vcm, v, corrected_mu0);
+    put(curvature_vcm, v, corrected_mui);
 }
 
-template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvatureMap,
+template<typename PolygonMesh, typename AreaFaceMeasureMap, typename AnisotropicFaceMeasureMap,
+    typename AreaVertexCurvatureMap, typename AnisotropicVertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void expand_interpolated_corrected_anisotropic_measure_vertex(const PolygonMesh& pmesh,
-        FaceMeasureMap fmm,
-        VertexCurvatureMap vcm,
+        AreaFaceMeasureMap area_fmm,
+        AnisotropicFaceMeasureMap aniso_fmm,
+        AreaVertexCurvatureMap area_vcm,
+        AnisotropicVertexCurvatureMap aniso_vcm,
         const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
         const NamedParameters& np = parameters::default_values())
 {
@@ -754,6 +761,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
     typename GT::Point_3 vp = get(vpm, v);
     typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
 
+    typename GT::FT corrected_mu0 = 0;
     Eigen::Matrix<typename GT::FT, 3, 3> corrected_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
 
     for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
@@ -779,7 +787,9 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
 
         if (f_ratio != 0.0)
         {
-            std::array<typename GT::FT, 3 * 3> muXY_face = get(fmm, fi);
+            corrected_mu0 += f_ratio * get(area_fmm, fi);
+
+            std::array<typename GT::FT, 3 * 3> muXY_face = get(aniso_fmm, fi);
 
             for (std::size_t ix = 0; ix < 3; ix++)
                 for (std::size_t iy = 0; iy < 3; iy++)
@@ -795,8 +805,8 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
             }
         }
     }
-
-    put(vcm, v, corrected_muXY);
+    put(area_vcm, v, corrected_mu0);
+    put(aniso_vcm, v, corrected_muXY);
 }
 
 template<typename PolygonMesh, typename VertexCurvatureMap,
@@ -826,8 +836,8 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu0_expand_map, v, np);
-        expand_interpolated_corrected_measure_vertex(pmesh, mu1_map, mu1_expand_map, v, np);
+        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu1_map, mu0_expand_map, mu1_expand_map, v, np);
+
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         if (v_mu0 != 0.0)
@@ -864,8 +874,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu0_expand_map, v, np);
-        expand_interpolated_corrected_measure_vertex(pmesh, mu2_map, mu2_expand_map, v, np);
+        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu2_map, mu0_expand_map, mu2_expand_map, v, np);
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         if(v_mu0 != 0.0)
@@ -935,8 +944,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu0_expand_map, v, np);
-        expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, muXY_map, muXY_expand_map, v, np);
+        expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, mu0_map, muXY_map, mu0_expand_map, muXY_expand_map, v, np);
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = get(muXY_expand_map, v);

From 36d0fd4e5b3c5d5bfaed59ef3f9f8528aed486f1 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 8 Aug 2022 05:41:34 +0200
Subject: [PATCH 0042/1398] using internal property (SurfMesh) in example

---
 .../interpolated_corrected_curvatures.cpp     | 46 +++++++++++--------
 1 file changed, 26 insertions(+), 20 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index b804ae061cf4..c8b972aca658 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -9,24 +9,12 @@
 #include <iostream>
 #include <unordered_map>
 
-
 namespace PMP = CGAL::Polygon_mesh_processing;
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel EpicKernel;
 typedef CGAL::Surface_mesh<EpicKernel::Point_3> Mesh;
 typedef boost::graph_traits<Mesh>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
-typedef std::unordered_map<face_descriptor, EpicKernel::FT> FaceMeasureMap_tag;
-typedef std::unordered_map<vertex_descriptor, EpicKernel::FT> vertexMeasureMap_tag;
-typedef std::unordered_map<vertex_descriptor, std::tuple<
-    EpicKernel::FT,
-    EpicKernel::FT,
-    Eigen::Vector<EpicKernel::FT, 3>,
-    Eigen::Vector<EpicKernel::FT, 3>
-    >>
-vertexPrincipleCurvatureMap_tag;
-
-
 
 int main(int argc, char* argv[])
 {
@@ -41,13 +29,31 @@ int main(int argc, char* argv[])
     return EXIT_FAILURE;
   }
 
+  bool created = false;
+
+  Mesh::Property_map<vertex_descriptor, EpicKernel::FT> mean_curvature_map, gaussian_curvature_map;
+  boost::tie(mean_curvature_map, created) = g1.add_property_map<vertex_descriptor, EpicKernel::FT>("v:mean_curvature_map", 0);
+  assert(created);
+
+  boost::tie(gaussian_curvature_map, created) = g1.add_property_map<vertex_descriptor, EpicKernel::FT>("v:gaussian_curvature_map", 0);
+  assert(created);
 
-  vertexMeasureMap_tag mean_curvature_init, gaussian_curvature_init;
-  boost::associative_property_map<vertexMeasureMap_tag>
-      mean_curvature_map(mean_curvature_init), gaussian_curvature_map(gaussian_curvature_init);
+  Mesh::Property_map<vertex_descriptor, std::tuple<
+      EpicKernel::FT,
+      EpicKernel::FT,
+      Eigen::Vector<EpicKernel::FT, 3>,
+      Eigen::Vector<EpicKernel::FT, 3>
+      >> principle_curvature_map;
 
-  vertexPrincipleCurvatureMap_tag principle_curvature_init;
-  boost::associative_property_map<vertexPrincipleCurvatureMap_tag> principle_curvature_map(principle_curvature_init);
+  boost::tie(principle_curvature_map, created) = g1.add_property_map<vertex_descriptor, std::tuple<
+      EpicKernel::FT,
+      EpicKernel::FT,
+      Eigen::Vector<EpicKernel::FT, 3>,
+      Eigen::Vector<EpicKernel::FT, 3>
+      >>("v:principle_curvature_map", { 0, 0,
+          Eigen::Vector<EpicKernel::FT, 3>::Zero(),
+          Eigen::Vector<EpicKernel::FT, 3>::Zero() });
+  assert(created);
 
   PMP::interpolated_corrected_mean_curvature(
       g1,
@@ -64,9 +70,9 @@ int main(int argc, char* argv[])
 
   for (vertex_descriptor v : vertices(g1))
   {
-    auto PC = get(principle_curvature_map, v);
-      std::cout << v.idx() << ": HC = " << get(mean_curvature_map, v)
-                           << ", GC = " << get(gaussian_curvature_map, v) << "\n"
+    auto PC = principle_curvature_map[v];
+      std::cout << v.idx() << ": HC = " << mean_curvature_map[v]
+                           << ", GC = " << gaussian_curvature_map[v] << "\n"
                            << ", PC = [ " << std::get<0>(PC) << " , " << std::get<1>(PC) << " ]\n";
   }
 }

From a74e05a389dabe01022fcb4d2871bb027996f5fb Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 8 Aug 2022 06:16:05 +0200
Subject: [PATCH 0043/1398] documentation: fixes & improvements

---
 ...nterpolated_corrected_curvature_measures.h | 41 ++++++++-----------
 1 file changed, 16 insertions(+), 25 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 289878b9a9bf..3987f473c145 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -47,15 +47,13 @@ enum Curvature_measure_index {
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected area measure (mu0) of a specific face.
+* computes the interpolated corrected area measure \f$ \mu_0 \f$ of a specific face.
 *
-* @tparam GT is the geometric traits class.
+* @tparam GT geometric traits class model of `Kernel`.
 *
 * @param x is a vector of the vertex positions of the face.
-* @param u is a vector of the vertex nomrals of the face.
+* @param u is a vector of the vertex normals of the face.
 *
-* @return a scalar of type `GT::FT`.
-* This is the value of the interpolated corrected area measure of the given face.
 *
 * @see `interpolated_corrected_mean_curvature_measure_face()`
 * @see `interpolated_corrected_gaussian_curvature_measure_face()`
@@ -119,16 +117,13 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected mean curvature measure (mu1) of a specific face.
+* computes the interpolated corrected mean curvature measure \f$ \mu_1 \f$ of a specific face.
 *
-* @tparam GT is the geometric traits class.
+* @tparam GT geometric traits class model of `Kernel`.
 *
 * @param x is a vector of the vertex positions of the face.
 * @param u is a vector of the vertex nomrals of the face.
 *
-* @return a scalar of type `GT::FT`.
-* This is the value of the interpolated corrected mean curvature measure of the given face.
-*
 * @see `interpolated_corrected_gaussian_curvature_measure_face()`
 * @see `interpolated_corrected_area_measure_face()`
 * @see `interpolated_corrected_measure_mesh()`
@@ -202,16 +197,13 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected gaussian curvature measure (mu2) of a specific face.
+* computes the interpolated corrected gaussian curvature measure \f$ \mu_2 \f$ of a specific face.
 *
-* @tparam GT is the geometric traits class.
+* @tparam GT geometric traits class model of `Kernel`.
 *
 * @param x is a vector of the vertex positions of the face.
 * @param u is a vector of the vertex nomrals of the face.
 *
-* @return a scalar of type `GT::FT`.
-* This is the value of the interpolated corrected gaussian curvature measure of the given face.
-*
 * @see `interpolated_corrected_mean_curvature_measure_face()`
 * @see `interpolated_corrected_area_measure_face()`
 * @see `interpolated_corrected_measure_mesh()`
@@ -266,14 +258,14 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected anisotropic measure (muXY) of a specific face.
+* computes the interpolated corrected anisotropic measure \f$ \mu_{XY} \f$ of a specific face.
 *
-* @tparam GT is the geometric traits class.
+* @tparam GT geometric traits class model of `Kernel`.
 *
 * @param u is a vector of the vertex nomrals of the face.
 * @param x is a vector of the vertex positions of the face.
 *
-* @return an array of scalar values for each combination of the standard basis (3x3) of type `std::array<GT::FT, 3 * 3>`.
+* @return an array of scalar values for each combination of the standard basis (3x3)
 * These are the values of the interpolated corrected anisotropic measure of the given face.
 *
 * @see `interpolated_corrected_anisotropic_measure_mesh()`
@@ -395,7 +387,7 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
 *
 * computes the interpolated corrected curvature measure on each face of the mesh
 *
-* @tparam PolygonMesh a model of `FaceGraph`
+* @tparam PolygonMesh a model of `FaceListGraph`
 * @tparam FaceMeasureMap a a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `GT::FT` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
@@ -423,8 +415,8 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `%Vector_3` as value type}
 *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals should be
-*                     computed inside the function body.}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+*                     computed using compute_vertex_normals()}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
@@ -511,7 +503,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
 *
 * computes the interpolated corrected anisotropic measure on each face of the mesh
 *
-* @tparam PolygonMesh a model of `FaceGraph`
+* @tparam PolygonMesh a model of `FaceListGraph`
 * @tparam FaceMeasureMap a a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `std::array<GT::FT, 3 * 3>` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
@@ -537,8 +529,8 @@ template<typename PolygonMesh, typename FaceMeasureMap,
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `%Vector_3` as value type}
 *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals should be
-*                     computed inside the function body.}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+*                     computed using compute_vertex_normals()}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
@@ -956,7 +948,6 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
         v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
 
-        //(WIP)
         Eigen::SelfAdjointEigenSolver<Eigen::Matrix <typename GT::FT, 3, 3>> eigensolver;
 
         eigensolver.computeDirect(v_muXY);

From 86ac0fcb74f26336d492859b1d650fb28b5251d0 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 8 Aug 2022 07:04:37 +0200
Subject: [PATCH 0044/1398] Documenting Expansion functions

---
 ...nterpolated_corrected_curvature_measures.h | 158 +++++++++++++++---
 1 file changed, 134 insertions(+), 24 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 3987f473c145..dbe95c28f459 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -47,7 +47,7 @@ enum Curvature_measure_index {
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected area measure \f$ \mu_0 \f$ of a specific face.
+* Computes the interpolated corrected area measure \f$ \mu_0 \f$ of a specific face.
 *
 * @tparam GT geometric traits class model of `Kernel`.
 *
@@ -117,7 +117,7 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected mean curvature measure \f$ \mu_1 \f$ of a specific face.
+* Computes the interpolated corrected mean curvature measure \f$ \mu_1 \f$ of a specific face.
 *
 * @tparam GT geometric traits class model of `Kernel`.
 *
@@ -197,7 +197,7 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected gaussian curvature measure \f$ \mu_2 \f$ of a specific face.
+* Computes the interpolated corrected gaussian curvature measure \f$ \mu_2 \f$ of a specific face.
 *
 * @tparam GT geometric traits class model of `Kernel`.
 *
@@ -258,7 +258,7 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected anisotropic measure \f$ \mu_{XY} \f$ of a specific face.
+* Computes the interpolated corrected anisotropic measure \f$ \mu_{XY} \f$ of a specific face.
 *
 * @tparam GT geometric traits class model of `Kernel`.
 *
@@ -385,10 +385,10 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected curvature measure on each face of the mesh
+* Computes the interpolated corrected curvature measure on each face of the mesh
 *
 * @tparam PolygonMesh a model of `FaceListGraph`
-* @tparam FaceMeasureMap a a model of `WritablePropertyMap` with
+* @tparam FaceMeasureMap a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `GT::FT` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
@@ -399,6 +399,7 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
 * \cgalNamedParamsBegin
+*
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
@@ -501,10 +502,10 @@ template<typename PolygonMesh, typename FaceMeasureMap,
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected anisotropic measure on each face of the mesh
+* Computes the interpolated corrected anisotropic measure on each face of the mesh
 *
 * @tparam PolygonMesh a model of `FaceListGraph`
-* @tparam FaceMeasureMap a a model of `WritablePropertyMap` with
+* @tparam FaceMeasureMap a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `std::array<GT::FT, 3 * 3>` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
@@ -513,6 +514,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
 * \cgalNamedParamsBegin
+*
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
@@ -614,11 +616,25 @@ template<typename PolygonMesh, typename FaceMeasureMap,
 //    return samples_in / (typename GT::FT)(res * (res + 1) / 2);
 //}
 
-
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* Computes the ratio of inclusion of a face in a ball of radius `r` around the
+* point `c`.
+*
+* @tparam GT geometric traits class model of `Kernel`
+*
+* @param x is a vector of the vertex positions of the face.
+* @param r is the radius of the ball.
+* @param c is the center of the ball.
+*
+* @see `expand_interpolated_corrected_measure_vertex()`
+* @see `expand_interpolated_corrected_anisotropic_measure_vertex()`
+*/
 template<typename GT>
-typename GT::FT face_in_ball_ratio_2(const std::vector<typename GT::Vector_3>& x,
-                                     const typename GT::FT r,
-                                     const typename GT::Vector_3 c)
+typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
+                                   const typename GT::FT r,
+                                   const typename GT::Vector_3 c)
 {
     std::size_t n = x.size();
 
@@ -646,13 +662,59 @@ typename GT::FT face_in_ball_ratio_2(const std::vector<typename GT::Vector_3>& x
     return (r - d_min) / (d_max - d_min);
 }
 
-template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvatureMap,
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* Expands given face area and curvature (mean or gaussian) measures around a vertex `v`.
+* Expansion is based on the inclusion ratio of each face in a ball of radius `r` around the vertex `v`.
+*
+* @tparam PolygonMesh a model of `FaceListGraph`
+* @tparam FaceMeasureMap a model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `GT::FT` as value type.
+* @tparam VertexMeasureMap a model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+*
+* @param pmesh the polygon mesh
+* @param area_fmm (area face measure map) the property map storing the already computed area measure on each face.
+* @param curvature_fmm (curvature face measure map) the property map storing the already computed curvature measure on each face.
+* This curvature measure can be either the Mean Curvature or the Gaussian Curvature.
+* @param area_vmm (area vertex measure map) the property map provided to store the expanded area measure on each vertex.
+* @param curvature_vmm (curvature vertex measure map) the property map provided to store the expanded curvature measure on each vertex.
+* This curvature measure can be either the Mean Curvature or the Gaussian Curvature.
+* @param v (vertex) the vertex to expand the area and curvature measure around.
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*
+* \cgalNamedParamsBegin
+*
+*   \cgalParamNBegin{ball_radius}
+*     \cgalParamDescription{the radius of the ball around the vertex `v` to expand the area and curvature measure}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{`0.01`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+*
+* @see `expand_interpolated_corrected_anisotropic_measure_vertex()`
+* @see `face_in_ball_ratio()`
+*/
+template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void expand_interpolated_corrected_measure_vertex(const PolygonMesh& pmesh,
         FaceMeasureMap area_fmm,
         FaceMeasureMap curvature_fmm,
-        VertexCurvatureMap area_vcm,
-        VertexCurvatureMap curvature_vcm,
+        VertexMeasureMap area_vmm,
+        VertexMeasureMap curvature_vmm,
         const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
         const NamedParameters& np = parameters::default_values())
 {
@@ -700,7 +762,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
             x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
         }
 
-        const typename GT::FT f_ratio = face_in_ball_ratio_2<GT>(x, r, c);
+        const typename GT::FT f_ratio = face_in_ball_ratio<GT>(x, r, c);
 
         if (f_ratio != 0.0)
         {
@@ -716,18 +778,66 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexCurvature
             }
         }
     }
-    put(area_vcm, v, corrected_mu0);
-    put(curvature_vcm, v, corrected_mui);
+    put(area_vmm, v, corrected_mu0);
+    put(curvature_vmm, v, corrected_mui);
 }
 
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* Expands given face area and anisotropic curvature measures around a vertex `v`.
+* Expansion is based on the inclusion ratio of each face in a ball of radius `r` around the vertex `v`.
+*
+* @tparam PolygonMesh a model of `FaceListGraph`
+* @tparam AreaFaceMeasureMap a model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `GT::FT` as value type.
+* @tparam AnisotropicFaceMeasureMap a model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `std::array<typename GT::FT, 3 * 3>` as value type.
+* @tparam AreaVertexMeasureMap a model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
+* @tparam AnisotropicVertexMeasureMap a model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `std::array<typename GT::FT, 3 * 3>` as value type.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+*
+* @param pmesh the polygon mesh
+* @param area_fmm (area face measure map) the property map storing the already computed area measure on each face.
+* @param aniso_fmm (anisotropic face measure map) the property map storing the already computed anisotropic curvature measure on each face.
+* @param area_vmm (area vertex measure map) the property map provided to store the expanded area measure on each vertex.
+* @param aniso_vmm (anisotropic vertex measure map) the property map provided to store the expanded anisotropic curvature measure on each vertex.
+* @param v (vertex) the vertex to expand the area and anisotropic curvature measure around.
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*
+* \cgalNamedParamsBegin
+*
+*   \cgalParamNBegin{ball_radius}
+*     \cgalParamDescription{the radius of the ball around the vertex `v` to expand the area and curvature measure}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{`0.01`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+*
+* @see `expand_interpolated_corrected_measure_vertex()`
+* @see `face_in_ball_ratio()`
+*/
 template<typename PolygonMesh, typename AreaFaceMeasureMap, typename AnisotropicFaceMeasureMap,
-    typename AreaVertexCurvatureMap, typename AnisotropicVertexCurvatureMap,
+    typename AreaVertexMeasureMap, typename AnisotropicVertexMeasureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void expand_interpolated_corrected_anisotropic_measure_vertex(const PolygonMesh& pmesh,
         AreaFaceMeasureMap area_fmm,
         AnisotropicFaceMeasureMap aniso_fmm,
-        AreaVertexCurvatureMap area_vcm,
-        AnisotropicVertexCurvatureMap aniso_vcm,
+        AreaVertexMeasureMap area_vmm,
+        AnisotropicVertexMeasureMap aniso_vmm,
         const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
         const NamedParameters& np = parameters::default_values())
 {
@@ -775,7 +885,7 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
             x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
         }
 
-        const typename GT::FT f_ratio = face_in_ball_ratio_2<GT>(x, r, c);
+        const typename GT::FT f_ratio = face_in_ball_ratio<GT>(x, r, c);
 
         if (f_ratio != 0.0)
         {
@@ -797,8 +907,8 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
             }
         }
     }
-    put(area_vcm, v, corrected_mu0);
-    put(aniso_vcm, v, corrected_muXY);
+    put(area_vmm, v, corrected_mu0);
+    put(aniso_vmm, v, corrected_muXY);
 }
 
 template<typename PolygonMesh, typename VertexCurvatureMap,

From 4049979648d16e8ec5f40bee3fcd477ef6499af6 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 8 Aug 2022 07:13:14 +0200
Subject: [PATCH 0045/1398] minor documentation fixes

---
 .../Polygon_mesh_processing/PackageDescription.txt  | 13 ++++++++++---
 .../interpolated_corrected_curvature_measures.h     |  8 ++++----
 2 files changed, 14 insertions(+), 7 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index d0cab92d6a89..5c9e39811d46 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -202,9 +202,16 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 
 \cgalCRPSection{Corrected Curvature Functions}
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_measure_mesh()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_measure_face()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_measure_triangle()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_measure_quad()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_anisotropic_measure_mesh()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_area_measure_face()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_measure_face()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_measure_face()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_anisotropic_measure_face()`
+- `CGAL::Polygon_mesh_processing::expand_interpolated_corrected_measure_vertex()`
+- `CGAL::Polygon_mesh_processing::expand_interpolated_corrected_anisotropic_measure_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures()`
 
 \cgalCRPSection{Normal Computation Functions}
 - `CGAL::Polygon_mesh_processing::compute_face_normal()`
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index dbe95c28f459..00b17269d6f1 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -785,7 +785,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* Expands given face area and anisotropic curvature measures around a vertex `v`.
+* Expands given face area and anisotropic measures around a vertex `v`.
 * Expansion is based on the inclusion ratio of each face in a ball of radius `r` around the vertex `v`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`
@@ -801,10 +801,10 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
 *
 * @param pmesh the polygon mesh
 * @param area_fmm (area face measure map) the property map storing the already computed area measure on each face.
-* @param aniso_fmm (anisotropic face measure map) the property map storing the already computed anisotropic curvature measure on each face.
+* @param aniso_fmm (anisotropic face measure map) the property map storing the already computed anisotropic measure on each face.
 * @param area_vmm (area vertex measure map) the property map provided to store the expanded area measure on each vertex.
-* @param aniso_vmm (anisotropic vertex measure map) the property map provided to store the expanded anisotropic curvature measure on each vertex.
-* @param v (vertex) the vertex to expand the area and anisotropic curvature measure around.
+* @param aniso_vmm (anisotropic vertex measure map) the property map provided to store the expanded anisotropic measure on each vertex.
+* @param v (vertex) the vertex to expand the area and anisotropic measure around.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
 * \cgalNamedParamsBegin

From 5fdebfb28c3ac5da950bd79fe20d62942f2c7e51 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 8 Aug 2022 07:41:02 +0200
Subject: [PATCH 0046/1398] Documenting new functions + minor doc fixes

---
 ...nterpolated_corrected_curvature_measures.h | 120 +++++++++++++++---
 1 file changed, 103 insertions(+), 17 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 00b17269d6f1..dc7744a402eb 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -35,7 +35,7 @@ namespace Polygon_mesh_processing {
 /*!
  * \ingroup PMP_corrected_curvatures_grp
  * Enumeration type used to specify which measure of a given face
- * is computed for the interpolated corrected curvature functions
+ * is computed for the interpolated corrected curvature functions.
  */
 // enum
 enum Curvature_measure_index {
@@ -385,17 +385,17 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* Computes the interpolated corrected curvature measure on each face of the mesh
+* Computes the interpolated corrected curvature measure on each face of the mesh.
 *
-* @tparam PolygonMesh a model of `FaceListGraph`
+* @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam FaceMeasureMap a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `GT::FT` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
-* @param pmesh the polygon mesh
-* @param fmm (face measure map) the property map used for storing the computed interpolated corrected measure
+* @param pmesh the polygon mesh.
+* @param fmm (face measure map) the property map used for storing the computed interpolated corrected measure.
 * @param mu_i an enum for choosing between computing
-*             the area measure, the mean curvature measure or the gaussian curvature measure
+*             the area measure, the mean curvature measure or the gaussian curvature measure.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
 * \cgalNamedParamsBegin
@@ -504,13 +504,13 @@ template<typename PolygonMesh, typename FaceMeasureMap,
 *
 * Computes the interpolated corrected anisotropic measure on each face of the mesh
 *
-* @tparam PolygonMesh a model of `FaceListGraph`
+* @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam FaceMeasureMap a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `std::array<GT::FT, 3 * 3>` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
-* @param pmesh the polygon mesh
-* @param fmm (face measure map) the property map used for storing the computed interpolated corrected measure
+* @param pmesh the polygon mesh.
+* @param fmm (face measure map) the property map used for storing the computed interpolated corrected measure.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
 * \cgalNamedParamsBegin
@@ -622,7 +622,7 @@ template<typename PolygonMesh, typename FaceMeasureMap,
 * Computes the ratio of inclusion of a face in a ball of radius `r` around the
 * point `c`.
 *
-* @tparam GT geometric traits class model of `Kernel`
+* @tparam GT geometric traits class model of `Kernel`.
 *
 * @param x is a vector of the vertex positions of the face.
 * @param r is the radius of the ball.
@@ -668,14 +668,14 @@ typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
 * Expands given face area and curvature (mean or gaussian) measures around a vertex `v`.
 * Expansion is based on the inclusion ratio of each face in a ball of radius `r` around the vertex `v`.
 *
-* @tparam PolygonMesh a model of `FaceListGraph`
+* @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam FaceMeasureMap a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `GT::FT` as value type.
 * @tparam VertexMeasureMap a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
-* @param pmesh the polygon mesh
+* @param pmesh the polygon mesh.
 * @param area_fmm (area face measure map) the property map storing the already computed area measure on each face.
 * @param curvature_fmm (curvature face measure map) the property map storing the already computed curvature measure on each face.
 * This curvature measure can be either the Mean Curvature or the Gaussian Curvature.
@@ -797,9 +797,9 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
 * `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
 * @tparam AnisotropicVertexMeasureMap a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `std::array<typename GT::FT, 3 * 3>` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
-* @param pmesh the polygon mesh
+* @param pmesh the polygon mesh.
 * @param area_fmm (area face measure map) the property map storing the already computed area measure on each face.
 * @param aniso_fmm (anisotropic face measure map) the property map storing the already computed anisotropic measure on each face.
 * @param area_vmm (area vertex measure map) the property map provided to store the expanded area measure on each vertex.
@@ -911,6 +911,27 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
     put(aniso_vmm, v, corrected_muXY);
 }
 
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* Computes the interpolated corrected mean curvature across the mesh
+* and stores it in a veretex property map `vcm`.
+*
+* @tparam PolygonMesh a model of `FaceListGraph`.
+* @tparam VertexCurvatureMap model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
+*
+* @param pmesh the polygon mesh.
+* @param vcm the vertex property map in which the computed mean curvatures are stored.
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
+*
+* @see `interpolated_corrected_gaussian_curvature()`
+* @see `interpolated_corrected_principal_curvatures()`
+* @see `interpolated_corrected_measure_mesh()`
+* @see `expand_interpolated_corrected_measure_vertex()`
+*/
+
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
@@ -949,6 +970,26 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     }
 }
 
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* Computes the interpolated corrected gaussian curvature across the mesh
+* and stores it in a veretex property map `vcm`.
+*
+* @tparam PolygonMesh a model of `FaceListGraph`.
+* @tparam VertexCurvatureMap model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
+*
+* @param pmesh the polygon mesh.
+* @param vcm the vertex property map in which the computed gaussian curvatures are stored.
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
+*
+* @see `interpolated_corrected_mean_curvature()`
+* @see `interpolated_corrected_principal_curvatures()`
+* @see `interpolated_corrected_measure_mesh()`
+* @see `expand_interpolated_corrected_measure_vertex()`
+*/
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
@@ -986,6 +1027,51 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     }
 }
 
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* Computes the interpolated corrected principal curvatures across the mesh
+* and stores it in a veretex property map `vcm`.
+*
+* @tparam PolygonMesh a model of `FaceListGraph`.
+* @tparam VertexCurvatureMap model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and
+* `std::tuple<GT::FT, GT::FT, Eigen::Vector<GT::FT, 3>, Eigen::Vector<GT::FT, 3>>` as value type.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
+*
+* @param pmesh the polygon mesh.
+* @param vcm the vertex property map in which the computed principal curvatures are stored.
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*
+* \cgalNamedParamsBegin
+*
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_normal_map}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Vector_3` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+*                     computed using compute_vertex_normals()}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+*
+* @see `interpolated_corrected_mean_curvature()`
+* @see `interpolated_corrected_gaussian_curvatures()`
+* @see `interpolated_corrected_anisotropic_measure_mesh()`
+* @see `expand_interpolated_corrected_anisotropic_measure_vertex()`
+*/
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void interpolated_corrected_principal_curvatures(const PolygonMesh& pmesh,

From 5840eaf9556370c1c4cdc0cb2b76fc1d81380876 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 9 Aug 2022 17:10:15 +0200
Subject: [PATCH 0047/1398] Update interpolated_corrected_curvature_measures.h

---
 .../Curvatures/interpolated_corrected_curvature_measures.h      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index dc7744a402eb..f16413159cab 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -1068,7 +1068,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * \cgalNamedParamsEnd
 *
 * @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_gaussian_curvatures()`
+* @see `interpolated_corrected_gaussian_curvature()`
 * @see `interpolated_corrected_anisotropic_measure_mesh()`
 * @see `expand_interpolated_corrected_anisotropic_measure_vertex()`
 */

From 2ed69e935f02461fe6d6807489f04cb1bd8e6b4d Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 27 Aug 2022 18:01:59 +0200
Subject: [PATCH 0048/1398] fixing eigen vector definitions

so that it works with other compilers
---
 .../interpolated_corrected_curvature_measures.h           | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index f16413159cab..6ddfe5feb1a0 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -1138,7 +1138,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = get(muXY_expand_map, v);
         typename GT::Vector_3 u_GT = get(vnm, v);
 
-        Eigen::Vector<typename GT::FT, 3> u(u_GT.x(), u_GT.y(), u_GT.z());
+        Eigen::Matrix<typename GT::FT, 3, 1> u(u_GT.x(), u_GT.y(), u_GT.z());
 
         const typename GT::FT K = 1000 * v_mu0;
 
@@ -1153,12 +1153,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
             put(vcm, v, std::make_tuple(
                 0,
                 0,
-                Eigen::Vector<typename GT::FT, 3>(.0,.0,.0),
-                Eigen::Vector<typename GT::FT, 3>(.0, .0, .0)));
+                Eigen::Matrix<typename GT::FT, 3, 1>(.0,.0,.0),
+                Eigen::Matrix<typename GT::FT, 3, 1>(.0, .0, .0)));
             continue;
         }
 
-        Eigen::Vector<typename GT::FT, 3> eig_vals = eigensolver.eigenvalues();
+        Eigen::Matrix<typename GT::FT, 3, 1> eig_vals = eigensolver.eigenvalues();
         Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs = eigensolver.eigenvectors();
 
         put(vcm, v, std::make_tuple(

From 48262af4247eb8060e3bda3ccfcec6164512007b Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 27 Aug 2022 19:46:33 +0200
Subject: [PATCH 0049/1398] fixing eigenvector definitions

---
 .../interpolated_corrected_curvatures.cpp            | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index c8b972aca658..3a36aaac5c88 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -41,18 +41,18 @@ int main(int argc, char* argv[])
   Mesh::Property_map<vertex_descriptor, std::tuple<
       EpicKernel::FT,
       EpicKernel::FT,
-      Eigen::Vector<EpicKernel::FT, 3>,
-      Eigen::Vector<EpicKernel::FT, 3>
+      Eigen::Matrix<EpicKernel::FT, 3, 1>,
+      Eigen::Matrix<EpicKernel::FT, 3, 1>
       >> principle_curvature_map;
 
   boost::tie(principle_curvature_map, created) = g1.add_property_map<vertex_descriptor, std::tuple<
       EpicKernel::FT,
       EpicKernel::FT,
-      Eigen::Vector<EpicKernel::FT, 3>,
-      Eigen::Vector<EpicKernel::FT, 3>
+      Eigen::Matrix<EpicKernel::FT, 3, 1>,
+      Eigen::Matrix<EpicKernel::FT, 3, 1>
       >>("v:principle_curvature_map", { 0, 0,
-          Eigen::Vector<EpicKernel::FT, 3>::Zero(),
-          Eigen::Vector<EpicKernel::FT, 3>::Zero() });
+          Eigen::Matrix<EpicKernel::FT, 3, 1>::Zero(),
+          Eigen::Matrix<EpicKernel::FT, 3, 1>::Zero() });
   assert(created);
 
   PMP::interpolated_corrected_mean_curvature(

From 13b056c9d404c9eef9b3cdb630777ecb98db5dcf Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 17 Sep 2022 23:53:18 +0200
Subject: [PATCH 0050/1398] minor fixes + handled zero expansion radius

---
 ...nterpolated_corrected_curvature_measures.h | 72 +++++++++++++++----
 1 file changed, 60 insertions(+), 12 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 6ddfe5feb1a0..7cd2c67ab060 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -18,6 +18,7 @@
 
 #include <CGAL/assertions.h>
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
+#include <CGAL/Polygon_mesh_processing/measure.h>
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/property_map.h>
 #include <CGAL/boost/graph/named_params_helper.h>
@@ -28,10 +29,31 @@
 #include <unordered_set>
 #include <functional>
 
+#define EXPANDING_RADIUS_EPSILON 1e-6
+
 namespace CGAL {
 
 namespace Polygon_mesh_processing {
 
+namespace internal {
+
+template<typename PolygonMesh, typename GT>
+typename GT::FT average_edge_length(const PolygonMesh& pmesh)
+{
+    const std::size_t n = edges(pmesh).size();
+    if (n == 0)
+        return 0;
+
+    GT::FT avg_edge_length = 0;
+    for (auto e : edges(pmesh))
+        avg_edge_length += edge_length(e, pmesh);
+
+    avg_edge_length /= n;
+    return avg_edge_length;   
+}
+
+}
+
 /*!
  * \ingroup PMP_corrected_curvatures_grp
  * Enumeration type used to specify which measure of a given face
@@ -63,7 +85,7 @@ template<typename GT>
 typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typename GT::Vector_3>& u,
                                                          const std::vector<typename GT::Vector_3>& x = {})
 {
-    std::size_t n = x.size();
+    const std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
     CGAL_precondition(n >= 3);
 
@@ -132,7 +154,7 @@ template<typename GT>
 typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
                                                                    const std::vector<typename GT::Vector_3>& x = {})
 {
-    std::size_t n = x.size();
+    const std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
     CGAL_precondition(n >= 3);
 
@@ -212,7 +234,7 @@ template<typename GT>
 typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
                                                                        const std::vector<typename GT::Vector_3>& x = {})
 {
-    std::size_t n = u.size();
+    const std::size_t n = u.size();
     CGAL_precondition(n >= 3);
 
     typename GT::Construct_cross_product_vector_3 cross_product;
@@ -274,7 +296,7 @@ template<typename GT>
 std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_face(const std::vector<typename GT::Vector_3>& u,
                                                                                    const std::vector<typename GT::Vector_3>& x)
 {
-    std::size_t n = x.size();
+    const std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
     CGAL_precondition(n >= 3);
 
@@ -636,7 +658,7 @@ typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
                                    const typename GT::FT r,
                                    const typename GT::Vector_3 c)
 {
-    std::size_t n = x.size();
+    const std::size_t n = x.size();
 
     // getting center of points
     typename GT::Vector_3 xm =
@@ -726,8 +748,8 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
 
-    const typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
-        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0.1);
+    const typename GT::FT
+        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
 
     typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
@@ -849,8 +871,8 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
 
-    const typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
-        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0.01);
+    const typename GT::FT
+        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
 
     typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
@@ -938,6 +960,9 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         VertexCurvatureMap vcm,
         const NamedParameters& np = parameters::default_values())
 {
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
@@ -946,6 +971,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
     typedef std::unordered_map<vertex_descriptor, typename GT::FT> VertexMeasureMap_tag;
 
+    typename GT::FT
+        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
+
+    if (r == 0)
+        r = internal::average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+
     FaceMeasureMap_tag mu0_init, mu1_init;
     boost::associative_property_map<FaceMeasureMap_tag>
         mu0_map(mu0_init), mu1_map(mu1_init);
@@ -959,7 +990,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu1_map, mu0_expand_map, mu1_expand_map, v, np);
+        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu1_map, mu0_expand_map, mu1_expand_map, v, CGAL::parameters::ball_radius(r));
 
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
@@ -996,6 +1027,9 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         VertexCurvatureMap vcm,
         const NamedParameters& np = parameters::default_values())
 {
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
@@ -1004,6 +1038,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
     typedef std::unordered_map<vertex_descriptor, typename GT::FT> VertexMeasureMap_tag;
 
+    typename GT::FT
+        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
+
+    if (r == 0)
+        r = internal::average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+
     FaceMeasureMap_tag mu0_init, mu2_init;
     boost::associative_property_map<FaceMeasureMap_tag>
         mu0_map(mu0_init), mu2_map(mu2_init);
@@ -1017,7 +1057,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu2_map, mu0_expand_map, mu2_expand_map, v, np);
+        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu2_map, mu0_expand_map, mu2_expand_map, v, CGAL::parameters::ball_radius(r));
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         if(v_mu0 != 0.0)
@@ -1097,9 +1137,17 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     VNM vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
         get(Vector_map_tag(), pmesh));
 
+    typename GT::FT
+        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
+
+    if (r == 0)
+        r = internal::average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
         compute_vertex_normals(pmesh, vnm, np);
 
+
+
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
     typedef std::unordered_map<face_descriptor, typename GT::FT> FaceScalarMeasureMap_tag;
     // using std:: array to store FT values on the 9 combinations of the standard 3D basis
@@ -1132,7 +1180,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, mu0_map, muXY_map, mu0_expand_map, muXY_expand_map, v, np);
+        expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, mu0_map, muXY_map, mu0_expand_map, muXY_expand_map, v, CGAL::parameters::ball_radius(r));
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = get(muXY_expand_map, v);

From 4f1a5dd194822e3e763e5c47bd38c1c4151e575c Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 20 Sep 2022 04:18:11 +0200
Subject: [PATCH 0051/1398] minor demo updates

---
 .../Plugins/Display/Display_property_plugin.cpp    | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 66187583657e..e38211ecea85 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -1496,10 +1496,10 @@ private Q_SLOTS:
   void displayMapLegend(const std::vector<Value_type>& values)
   {
     // Create a legend_ and display it
-    const std::size_t size = (std::min)(color_map.size(), (std::size_t)256);
+    const std::size_t size = (std::min)(color_map.size(), (std::size_t)2048);
     const int text_height = 20;
     const int height = text_height*static_cast<int>(size) + text_height;
-    const int width = 140;
+    const int width = 170;
     const int cell_width = width/3;
     const int top_margin = 15;
     const int left_margin = 5;
@@ -1525,8 +1525,8 @@ private Q_SLOTS:
                        tick_height,
                        color);
       QRect text_rect(left_margin + cell_width+10, drawing_height - top_margin - j,
-                          50, text_height);
-      painter.drawText(text_rect, Qt::AlignCenter, tr("%1").arg(values[i], 0, 'f', 3, QLatin1Char(' ')));
+          100, text_height);
+      painter.drawText(text_rect, Qt::AlignCenter, tr("%1").arg(values[i], 0, 'f', 7, QLatin1Char(' ')));
     }
     if(color_map.size() > size){
       QRect text_rect(left_margin + cell_width+10, 0,
@@ -1545,7 +1545,7 @@ private Q_SLOTS:
   {
     // Create a legend_ and display it
     const int height = 256;
-    const int width = 140;
+    const int width = 170;
     const int cell_width = width/3;
     const int top_margin = 5;
     const int left_margin = 5;
@@ -1589,11 +1589,11 @@ private Q_SLOTS:
     painter.setPen(Qt::blue);
     QRect min_text_rect(left_margin + cell_width+10,drawing_height - top_margin,
                         100, text_height);
-    painter.drawText(min_text_rect, Qt::AlignCenter, tr("%1").arg(min_value, 0, 'f', 1));
+    painter.drawText(min_text_rect, Qt::AlignCenter, tr("%1").arg(min_value, 0, 'f', 7));
 
     QRect max_text_rect(left_margin + cell_width+10, drawing_height - top_margin - 200,
                         100, text_height);
-    painter.drawText(max_text_rect, Qt::AlignCenter, tr("%1").arg(max_value, 0, 'f', 1));
+    painter.drawText(max_text_rect, Qt::AlignCenter, tr("%1").arg(max_value, 0, 'f', 7));
 
     dock_widget->legendLabel->setPixmap(legend_);
   }

From 3d3b2c30fd2aedd43140d9c6a9b60b87a9340fba Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 20 Sep 2022 11:18:13 +0200
Subject: [PATCH 0052/1398] testing init

---
 ...nterpolated_corrected_curvature_measures.h |  20 ++-
 .../Polygon_mesh_processing/CMakeLists.txt    |   1 +
 ...est_interopolated_corrected_curvatures.cpp | 147 ++++++++++++++++++
 .../Display/Display_property_plugin.cpp       |  34 ++--
 .../PMP/Random_perturbation_plugin.cpp        |   2 +-
 5 files changed, 180 insertions(+), 24 deletions(-)
 create mode 100644 Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 7cd2c67ab060..aa05f8aebe47 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -483,8 +483,6 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
         compute_vertex_normals(pmesh, vnm, np);
 
-    typedef typename property_map_value<PolygonMesh, FaceMeasureMap>::type measure;
-
     std::function
         <typename GT::FT(const std::vector<typename GT::Vector_3>&, const std::vector<typename GT::Vector_3>&)>
         iccm_function;
@@ -985,12 +983,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     boost::associative_property_map<VertexMeasureMap_tag>
         mu0_expand_map(mu0_expand_init), mu1_expand_map(mu1_expand_init);
 
-    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE);
-    interpolated_corrected_measure_mesh(pmesh, mu1_map, MU1_MEAN_CURVATURE_MEASURE);
+    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE, np);
+    interpolated_corrected_measure_mesh(pmesh, mu1_map, MU1_MEAN_CURVATURE_MEASURE, np);
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu1_map, mu0_expand_map, mu1_expand_map, v, CGAL::parameters::ball_radius(r));
+        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu1_map, mu0_expand_map, mu1_expand_map, v, np.ball_radius(r));
 
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
@@ -1052,12 +1050,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     boost::associative_property_map<VertexMeasureMap_tag>
         mu0_expand_map(mu0_expand_init), mu2_expand_map(mu2_expand_init);
 
-    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE);
-    interpolated_corrected_measure_mesh(pmesh, mu2_map, MU2_GAUSSIAN_CURVATURE_MEASURE);
+    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE, np);
+    interpolated_corrected_measure_mesh(pmesh, mu2_map, MU2_GAUSSIAN_CURVATURE_MEASURE, np);
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu2_map, mu0_expand_map, mu2_expand_map, v, CGAL::parameters::ball_radius(r));
+        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu2_map, mu0_expand_map, mu2_expand_map, v, np.ball_radius(r));
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         if(v_mu0 != 0.0)
@@ -1175,12 +1173,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     boost::associative_property_map<VertexMatrixMeasureMap_tag>
         muXY_expand_map(muXY_expand_init);
 
-    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE);
-    interpolated_corrected_anisotropic_measure_mesh(pmesh, muXY_map);
+    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE, np);
+    interpolated_corrected_anisotropic_measure_mesh(pmesh, muXY_map, np);
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, mu0_map, muXY_map, mu0_expand_map, muXY_expand_map, v, CGAL::parameters::ball_radius(r));
+        expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, mu0_map, muXY_map, mu0_expand_map, muXY_expand_map, v, np.ball_radius(r));
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = get(muXY_expand_map, v);
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index 909dd292063a..808e6d3a05ef 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -69,6 +69,7 @@ create_single_source_cgal_program("self_intersection_polyhedron_test.cpp")
 create_single_source_cgal_program("self_intersection_surface_mesh_test.cpp")
 create_single_source_cgal_program("pmp_do_intersect_test.cpp")
 create_single_source_cgal_program("test_is_polygon_soup_a_polygon_mesh.cpp")
+create_single_source_cgal_program("test_interopolated_corrected_curvatures.cpp")
 create_single_source_cgal_program("test_stitching.cpp")
 create_single_source_cgal_program("remeshing_test.cpp")
 create_single_source_cgal_program("remeshing_with_isolated_constraints_test.cpp" )
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
new file mode 100644
index 000000000000..9c2408139a3f
--- /dev/null
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
@@ -0,0 +1,147 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/random_perturbation.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/property_map.h>
+
+#include <boost/graph/graph_traits.hpp>
+
+#include <iostream>
+#include <unordered_map>
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel EpicKernel;
+typedef CGAL::Surface_mesh<EpicKernel::Point_3> SMesh;
+typedef boost::graph_traits<SMesh>::face_descriptor face_descriptor;
+typedef boost::graph_traits<SMesh>::edge_descriptor edge_descriptor;
+typedef boost::graph_traits<SMesh>::vertex_descriptor vertex_descriptor;
+
+void test(std::string mesh_path, EpicKernel::FT rel_expansion_radius, EpicKernel::FT rel_noise_magnitude) {
+	SMesh pmesh;
+	const std::string filename = CGAL::data_file_path(mesh_path);
+
+	if (!CGAL::IO::read_polygon_mesh(filename, pmesh))
+	{
+		std::cerr << "Invalid input file." << std::endl;
+	}
+
+	bool created = false;
+
+	SMesh::Property_map<vertex_descriptor, EpicKernel::FT> mean_curvature_map, gaussian_curvature_map;
+	boost::tie(mean_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:mean_curvature_map", 0);
+	assert(created);
+
+	boost::tie(gaussian_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:gaussian_curvature_map", 0);
+	assert(created);
+
+	// getting the max and min edge lengthes
+	const auto edge_range = CGAL::edges(pmesh);
+
+	const auto edge_length_comparator = [&, pmesh](auto l, auto r) {
+		return PMP::edge_length(l, pmesh) < PMP::edge_length(r, pmesh);
+	};
+
+	const edge_descriptor longest_edge = *std::max_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
+	const EpicKernel::FT max_edge_length = PMP::edge_length(longest_edge, pmesh);
+
+	const edge_descriptor shortest_edge = *std::min_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
+	const EpicKernel::FT min_edge_length = PMP::edge_length(shortest_edge, pmesh);
+
+
+	if (rel_noise_magnitude > 0)
+	{
+		if (!CGAL::is_triangle_mesh(pmesh))
+			return;
+
+		SMesh::Property_map<vertex_descriptor, EpicKernel::Vector_3> vnm;
+		boost::tie(vnm, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::Vector_3>("v:vnm", { 0 , 0 , 0 });
+		assert(created);
+		
+		CGAL::Polygon_mesh_processing::compute_vertex_normals(pmesh, vnm);
+
+		PMP::random_perturbation(pmesh, rel_noise_magnitude * min_edge_length, CGAL::parameters::random_seed(0));
+		PMP::interpolated_corrected_mean_curvature(
+			pmesh,
+			mean_curvature_map,
+			CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
+		);
+		PMP::interpolated_corrected_gaussian_curvature(
+			pmesh,
+			gaussian_curvature_map,
+			CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
+		);
+	}
+	else {
+		PMP::interpolated_corrected_mean_curvature(
+			pmesh,
+			mean_curvature_map,
+			CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+		);
+		PMP::interpolated_corrected_gaussian_curvature(
+			pmesh,
+			gaussian_curvature_map,
+			CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+		);
+
+	}
+
+	
+
+	//PMP::interpolated_corrected_mean_curvature(
+	//	pmesh,
+	//	mean_curvature_map,
+	//	CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+	//);
+	//PMP::interpolated_corrected_gaussian_curvature(
+	//	pmesh,
+	//	gaussian_curvature_map,
+	//	CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+	//);
+
+
+	const EpicKernel::FT max_mean_curvature = *std::max_element(mean_curvature_map.begin(), mean_curvature_map.end());
+	const EpicKernel::FT min_mean_curvature = *std::min_element(mean_curvature_map.begin(), mean_curvature_map.end());
+	const EpicKernel::FT max_gaussian_curvature = *std::max_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
+	const EpicKernel::FT min_gaussian_curvature = *std::min_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
+
+	std::cout << "# " << mesh_path << ":\n" 
+		<< "expansion radius ratio to max length / expansion radius = " << rel_expansion_radius << " / " << rel_expansion_radius * max_edge_length << ",\n" 
+		<< "max perturbation ratio to minlength / max perturbation = " << rel_noise_magnitude << " / " << rel_noise_magnitude * min_edge_length << "\n"
+		<< "mean curvature: min = " << min_mean_curvature << " <-> " << max_mean_curvature << " = max" << "\n"
+		<< "gaussian curvature: min = " << min_gaussian_curvature << " <-> " << max_gaussian_curvature << " = max" << "\n\n\n";
+
+
+}
+
+int main()
+{
+	const std::vector<std::string> mesh_pathes_to_test = {
+		"meshes/icc_test/Cube with fillet Quads.obj",
+		"meshes/icc_test/Lantern Quads.obj",
+		"meshes/icc_test/Lantern Tris.obj",
+		"meshes/icc_test/Sphere Ngons + Quads + Tris.obj",
+		"meshes/icc_test/Sphere Quads + Tris 100352.obj",
+		"meshes/icc_test/Sphere Quads + Tris.obj",
+		"meshes/icc_test/Sphere Quads Remesh.obj",
+		"meshes/icc_test/Sphere Quads.obj",
+		"meshes/icc_test/Sphere Tris Ico.obj",
+		"meshes/icc_test/Sphere Tris Oct.obj",
+		"meshes/icc_test/Sphere Tris Tet.obj"
+	};
+
+	const std::vector<EpicKernel::FT> rel_expansion_radii = { 0, 0.1, 0.5, 1 };
+	const std::vector<EpicKernel::FT> rel_noise_magnitudes = { 0, 0.5, 0.9 };
+
+	for (auto mesh_path : mesh_pathes_to_test) {
+		for (EpicKernel::FT rel_expansion_radius : rel_expansion_radii)
+			for (EpicKernel::FT rel_noise_magnitude : rel_noise_magnitudes)
+			{
+				test(mesh_path, rel_expansion_radius, rel_noise_magnitude);
+			}
+
+		std::cout << "_________________________________________________________________________________\n\n";
+	}
+
+}
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index e38211ecea85..cda67cbd9700 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -807,8 +807,8 @@ private Q_SLOTS:
 
           if (edge_range.begin() == edge_range.end())
           {
-              expandRadius = 0;
-              dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expandRadius));
+              expand_radius = 0;
+              dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
               return;
           }
 
@@ -824,8 +824,8 @@ private Q_SLOTS:
           // if edge_reference is not derefrenceble
           if (edge_reference == edge_range.end())
           {
-              expandRadius = 0;
-              dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expandRadius));
+              expand_radius = 0;
+              dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
               return;
           }
 
@@ -838,8 +838,8 @@ private Q_SLOTS:
 
       double outMin = 0, outMax = 5 * maxEdgeLength, base = 1.2;
 
-      expandRadius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
-      dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expandRadius));
+      expand_radius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
+      dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
 
   }
 
@@ -849,6 +849,9 @@ private Q_SLOTS:
         "v:interpolated_corrected_mean_curvature": "v:interpolated_corrected_gaussian_curvature";
     SMesh& smesh = *item->face_graph();
 
+    const auto vnm = smesh.property_map<vertex_descriptor, EPICK::Vector_3>("v:normal_before_perturbation").first;
+    const bool vnm_exists = smesh.property_map<vertex_descriptor, EPICK::Vector_3>("v:normal_before_perturbation").second;
+
     //compute once and store the value per vertex
     bool non_init;
     SMesh::Property_map<vertex_descriptor, double> mu_i_map;
@@ -856,11 +859,18 @@ private Q_SLOTS:
             smesh.add_property_map<vertex_descriptor, double>(tied_string, 0);
     if (non_init)
     {
-        if (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)
-            PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expandRadius));
-        else
-            PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expandRadius));
-
+        if (vnm_exists) {
+            if (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)
+                PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
+            else
+                PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
+        }
+        else {
+            if (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)
+                PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
+            else
+                PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
+        }
         double res_min = ARBITRARY_DBL_MAX,
             res_max = -ARBITRARY_DBL_MAX;
         SMesh::Vertex_index min_index, max_index;
@@ -1626,7 +1636,7 @@ private Q_SLOTS:
 
   std::unordered_map<Scene_surface_mesh_item*, Vertex_source_map> is_source;
 
-  double expandRadius;
+  double expand_radius;
   double maxEdgeLength = -1;
   double minBox;
   double maxBox;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_plugin.cpp
index 9afb452ab13c..004768739cd5 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Random_perturbation_plugin.cpp
@@ -106,7 +106,7 @@ public Q_SLOTS:
       if(ui.keep_normal_checkbox->isChecked())
       {
         SMesh::Property_map<vertex_descriptor, EPICK::Vector_3 > vnormals =
-          pmesh.add_property_map<vertex_descriptor, EPICK::Vector_3 >("v:normal").first;
+          pmesh.add_property_map<vertex_descriptor, EPICK::Vector_3 >("v:normal_before_perturbation").first;
         CGAL::Polygon_mesh_processing::compute_vertex_normals(pmesh,vnormals);
       }
       if(ui.deterministic_checkbox->isChecked())

From c7a6651c6335f7911c8fb04274abc39030af64bb Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 20 Sep 2022 17:19:43 +0200
Subject: [PATCH 0053/1398] GroundTruthtests

---
 .../test_interopolated_corrected_curvatures.cpp | 17 +++++++++--------
 1 file changed, 9 insertions(+), 8 deletions(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
index 9c2408139a3f..0caf0149de28 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
@@ -118,17 +118,18 @@ void test(std::string mesh_path, EpicKernel::FT rel_expansion_radius, EpicKernel
 int main()
 {
 	const std::vector<std::string> mesh_pathes_to_test = {
-		"meshes/icc_test/Cube with fillet Quads.obj",
-		"meshes/icc_test/Lantern Quads.obj",
-		"meshes/icc_test/Lantern Tris.obj",
-		"meshes/icc_test/Sphere Ngons + Quads + Tris.obj",
-		"meshes/icc_test/Sphere Quads + Tris 100352.obj",
 		"meshes/icc_test/Sphere Quads + Tris.obj",
-		"meshes/icc_test/Sphere Quads Remesh.obj",
-		"meshes/icc_test/Sphere Quads.obj",
+		"meshes/icc_test/Sphere Quads + Tris 100352.obj",
 		"meshes/icc_test/Sphere Tris Ico.obj",
+		"meshes/icc_test/Sphere Tris Tet.obj",
 		"meshes/icc_test/Sphere Tris Oct.obj",
-		"meshes/icc_test/Sphere Tris Tet.obj"
+		"meshes/icc_test/Sphere Quads.obj",
+		"meshes/icc_test/Sphere Quads Remesh.obj",
+		"meshes/icc_test/Sphere Ngons + Quads + Tris.obj",
+		"meshes/icc_test/Cube with fillet Quads.obj",
+		"meshes/cylinder.off",
+		"meshes/icc_test/Lantern Tris.obj",
+		"meshes/icc_test/Lantern Quads.obj"
 	};
 
 	const std::vector<EpicKernel::FT> rel_expansion_radii = { 0, 0.1, 0.5, 1 };

From 75c7f83c6848a55b4e15f10ca813df2e0d232659 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 20 Sep 2022 17:21:19 +0200
Subject: [PATCH 0054/1398] whitespaces

---
 .../interpolated_corrected_curvature_measures.h           | 2 +-
 .../test_interopolated_corrected_curvatures.cpp           | 8 ++++----
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index aa05f8aebe47..c1c1bcd52877 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -49,7 +49,7 @@ typename GT::FT average_edge_length(const PolygonMesh& pmesh)
         avg_edge_length += edge_length(e, pmesh);
 
     avg_edge_length /= n;
-    return avg_edge_length;   
+    return avg_edge_length;
 }
 
 }
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
index 0caf0149de28..e7b473141562 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
@@ -58,7 +58,7 @@ void test(std::string mesh_path, EpicKernel::FT rel_expansion_radius, EpicKernel
 		SMesh::Property_map<vertex_descriptor, EpicKernel::Vector_3> vnm;
 		boost::tie(vnm, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::Vector_3>("v:vnm", { 0 , 0 , 0 });
 		assert(created);
-		
+
 		CGAL::Polygon_mesh_processing::compute_vertex_normals(pmesh, vnm);
 
 		PMP::random_perturbation(pmesh, rel_noise_magnitude * min_edge_length, CGAL::parameters::random_seed(0));
@@ -87,7 +87,7 @@ void test(std::string mesh_path, EpicKernel::FT rel_expansion_radius, EpicKernel
 
 	}
 
-	
+
 
 	//PMP::interpolated_corrected_mean_curvature(
 	//	pmesh,
@@ -106,8 +106,8 @@ void test(std::string mesh_path, EpicKernel::FT rel_expansion_radius, EpicKernel
 	const EpicKernel::FT max_gaussian_curvature = *std::max_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
 	const EpicKernel::FT min_gaussian_curvature = *std::min_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
 
-	std::cout << "# " << mesh_path << ":\n" 
-		<< "expansion radius ratio to max length / expansion radius = " << rel_expansion_radius << " / " << rel_expansion_radius * max_edge_length << ",\n" 
+	std::cout << "# " << mesh_path << ":\n"
+		<< "expansion radius ratio to max length / expansion radius = " << rel_expansion_radius << " / " << rel_expansion_radius * max_edge_length << ",\n"
 		<< "max perturbation ratio to minlength / max perturbation = " << rel_noise_magnitude << " / " << rel_noise_magnitude * min_edge_length << "\n"
 		<< "mean curvature: min = " << min_mean_curvature << " <-> " << max_mean_curvature << " = max" << "\n"
 		<< "gaussian curvature: min = " << min_gaussian_curvature << " <-> " << max_gaussian_curvature << " = max" << "\n\n\n";

From e0c596d29e8c10724300d40fecbf6015385f6da4 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 25 Sep 2022 22:03:50 +0200
Subject: [PATCH 0055/1398] principal curvatures and directions visualization

---
 .../interpolated_corrected_curvatures.cpp     |  12 +-
 ...nterpolated_corrected_curvature_measures.h |  59 +++---
 .../Polygon_mesh_processing/compute_normal.h  |  12 +-
 .../Polyhedron/Plugins/PMP/CMakeLists.txt     |  14 ++
 ..._corrected_principal_curvatures_plugin.cpp | 186 ++++++++++++++++++
 5 files changed, 240 insertions(+), 43 deletions(-)
 create mode 100644 Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
index 3a36aaac5c88..c011d57db41e 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
@@ -41,18 +41,18 @@ int main(int argc, char* argv[])
   Mesh::Property_map<vertex_descriptor, std::tuple<
       EpicKernel::FT,
       EpicKernel::FT,
-      Eigen::Matrix<EpicKernel::FT, 3, 1>,
-      Eigen::Matrix<EpicKernel::FT, 3, 1>
+      EpicKernel::Vector_3,
+      EpicKernel::Vector_3
       >> principle_curvature_map;
 
   boost::tie(principle_curvature_map, created) = g1.add_property_map<vertex_descriptor, std::tuple<
       EpicKernel::FT,
       EpicKernel::FT,
-      Eigen::Matrix<EpicKernel::FT, 3, 1>,
-      Eigen::Matrix<EpicKernel::FT, 3, 1>
+      EpicKernel::Vector_3,
+      EpicKernel::Vector_3
       >>("v:principle_curvature_map", { 0, 0,
-          Eigen::Matrix<EpicKernel::FT, 3, 1>::Zero(),
-          Eigen::Matrix<EpicKernel::FT, 3, 1>::Zero() });
+          EpicKernel::Vector_3 (0,0,0),
+          EpicKernel::Vector_3 (0,0,0)});
   assert(created);
 
   PMP::interpolated_corrected_mean_curvature(
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index c1c1bcd52877..e2e1292aedb4 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -754,8 +754,8 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
             get_const_property_map(CGAL::vertex_point, pmesh));
 
 
-    std::queue<face_descriptor> bfs_q;
-    std::unordered_set<face_descriptor> bfs_v;
+    std::queue<face_descriptor> bfs_queue;
+    std::unordered_set<face_descriptor> bfs_visited;
 
     typename GT::Point_3 vp = get(vpm, v);
     typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
@@ -766,13 +766,13 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
     for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
         if (f != boost::graph_traits<PolygonMesh>::null_face())
         {
-            bfs_q.push(f);
-            bfs_v.insert(f);
+            bfs_queue.push(f);
+            bfs_visited.insert(f);
         }
     }
-    while (!bfs_q.empty()) {
-        face_descriptor fi = bfs_q.front();
-        bfs_q.pop();
+    while (!bfs_queue.empty()) {
+        face_descriptor fi = bfs_queue.front();
+        bfs_queue.pop();
 
         // looping over vertices in face to get point coordinates
         std::vector<typename GT::Vector_3> x;
@@ -790,10 +790,10 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
             corrected_mui += f_ratio * get(curvature_fmm, fi);
             for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
             {
-                if (bfs_v.find(fj) == bfs_v.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
+                if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
                 {
-                    bfs_q.push(fj);
-                    bfs_v.insert(fj);
+                    bfs_queue.push(fj);
+                    bfs_visited.insert(fj);
                 }
             }
         }
@@ -877,8 +877,8 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
             get_const_property_map(CGAL::vertex_point, pmesh));
 
 
-    std::queue<face_descriptor> bfs_q;
-    std::unordered_set<face_descriptor> bfs_v;
+    std::queue<face_descriptor> bfs_queue;
+    std::unordered_set<face_descriptor> bfs_visited;
 
     typename GT::Point_3 vp = get(vpm, v);
     typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
@@ -889,13 +889,13 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
     for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
         if (f != boost::graph_traits<PolygonMesh>::null_face())
         {
-            bfs_q.push(f);
-            bfs_v.insert(f);
+            bfs_queue.push(f);
+            bfs_visited.insert(f);
         }
     }
-    while (!bfs_q.empty()) {
-        face_descriptor fi = bfs_q.front();
-        bfs_q.pop();
+    while (!bfs_queue.empty()) {
+        face_descriptor fi = bfs_queue.front();
+        bfs_queue.pop();
 
         // looping over vertices in face to get point coordinates
         std::vector<typename GT::Vector_3> x;
@@ -915,14 +915,14 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
 
             for (std::size_t ix = 0; ix < 3; ix++)
                 for (std::size_t iy = 0; iy < 3; iy++)
-                    corrected_muXY(ix, iy) += muXY_face[ix * 3 + iy];
+                    corrected_muXY(ix, iy) += f_ratio * muXY_face[ix * 3 + iy];
 
             for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
             {
-                if (bfs_v.find(fj) == bfs_v.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
+                if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
                 {
-                    bfs_q.push(fj);
-                    bfs_v.insert(fj);
+                    bfs_queue.push(fj);
+                    bfs_visited.insert(fj);
                 }
             }
         }
@@ -990,7 +990,6 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     {
         expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu1_map, mu0_expand_map, mu1_expand_map, v, np.ball_radius(r));
 
-
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         if (v_mu0 != 0.0)
             put(vcm, v, 0.5 * get(mu1_expand_map, v) / v_mu0);
@@ -1182,6 +1181,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = get(muXY_expand_map, v);
+
         typename GT::Vector_3 u_GT = get(vnm, v);
 
         Eigen::Matrix<typename GT::FT, 3, 1> u(u_GT.x(), u_GT.y(), u_GT.z());
@@ -1199,19 +1199,22 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
             put(vcm, v, std::make_tuple(
                 0,
                 0,
-                Eigen::Matrix<typename GT::FT, 3, 1>(.0,.0,.0),
-                Eigen::Matrix<typename GT::FT, 3, 1>(.0, .0, .0)));
+                typename GT::Vector_3(0, 0, 0),
+                typename GT::Vector_3(0, 0, 0)));
             continue;
         }
 
-        Eigen::Matrix<typename GT::FT, 3, 1> eig_vals = eigensolver.eigenvalues();
-        Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs = eigensolver.eigenvectors();
+        const Eigen::Matrix<typename GT::FT, 3, 1> eig_vals = eigensolver.eigenvalues();
+        const Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs = eigensolver.eigenvectors();
+
+        const typename GT::Vector_3 min_eig_vec(eig_vecs(0, 1), eig_vecs(1, 1), eig_vecs(2, 1));
+        const typename GT::Vector_3 max_eig_vec(eig_vecs(0, 0), eig_vecs(1, 0), eig_vecs(2, 0));
 
         put(vcm, v, std::make_tuple(
             (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
             (v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
-            eig_vecs.col(1),
-            eig_vecs.col(0)));
+            min_eig_vec,
+            max_eig_vec));
     }
 }
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h
index 2cd837e7bf84..8dfb16af1bdd 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h
@@ -717,15 +717,9 @@ compute_vertex_normal(typename boost::graph_traits<PolygonMesh>::vertex_descript
   }
 #endif
 
-  Vector_3 normal = internal::compute_vertex_normal_most_visible_min_circle(v, face_normals, pmesh, traits);
-  if(traits.equal_3_object()(normal, CGAL::NULL_VECTOR)) // can't always find a most visible normal
-  {
-#ifdef CGAL_PMP_COMPUTE_NORMAL_DEBUG_PP
-    std::cout << "Failed to find most visible normal, use weighted sum of normals" << std::endl;
-#endif
-    normal = internal::compute_vertex_normal_as_sum_of_weighted_normals(
-               v, internal::SIN_WEIGHT, face_normals, vpmap, pmesh, traits);
-  }
+    // Change for debugging (comparing with DGtal)
+    Vector_3 normal = internal::compute_vertex_normal_as_sum_of_weighted_normals(
+               v, internal::NO_WEIGHT, face_normals, vpmap, pmesh, traits);
 
   if(!traits.equal_3_object()(normal, CGAL::NULL_VECTOR))
     internal::normalize(normal, traits);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
index 53cfdc9b825a..7d2177b03a11 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
@@ -13,6 +13,20 @@ else()
   )
 endif()
 
+if(TARGET CGAL::Eigen3_support)
+
+  polyhedron_demo_plugin(interpolated_corrected_principal_curvatures_plugin Interpolated_corrected_principal_curvatures_plugin)
+  target_link_libraries(
+    interpolated_corrected_principal_curvatures_plugin PUBLIC scene_surface_mesh_item scene_polylines_item
+                              CGAL::Eigen3_support)
+
+else()
+  message(
+    STATUS
+      "NOTICE: Eigen 3.1 (or greater) was not found. Interpolated corrected principal curvatures plugin will not be available."
+  )
+endif()
+
 polyhedron_demo_plugin(extrude_plugin Extrude_plugin KEYWORDS PMP)
 target_link_libraries(extrude_plugin PUBLIC scene_surface_mesh_item
                                             scene_selection_item)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
new file mode 100644
index 000000000000..69c2b4fe2dd3
--- /dev/null
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
@@ -0,0 +1,186 @@
+#include <CGAL/Three/Polyhedron_demo_plugin_interface.h>
+#include <CGAL/property_map.h>
+#include <CGAL/Surface_mesh.h>
+#include "Scene_surface_mesh_item.h"
+#include "Scene_polylines_item.h"
+
+#include <limits>
+
+#include "Scene.h"
+#include <QApplication>
+#include <QMainWindow>
+
+#include <CGAL/Polygon_mesh_processing/measure.h>
+#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+
+using namespace CGAL::Three;
+class Polyhedron_demo_interpolated_corrected_principal_curvatures_plugin :
+  public QObject,
+  public Polyhedron_demo_plugin_interface
+{
+  Q_OBJECT
+  Q_INTERFACES(CGAL::Three::Polyhedron_demo_plugin_interface)
+  Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0")
+
+public:
+
+  QList<QAction*> actions() const {
+    return _actions;
+  }
+  void init(QMainWindow* mw,
+            Scene_interface* scene_interface,
+            Messages_interface*)
+  {
+      scene = scene_interface;
+      QAction *actionEstimateCurvature = new QAction(tr("Interpolated Corrected Principal Curvatures"), mw);
+      connect(actionEstimateCurvature, SIGNAL(triggered()), this, SLOT(on_actionEstimateCurvature_triggered()));
+      _actions <<actionEstimateCurvature;
+
+  }
+
+  bool applicable(QAction*) const {
+    return qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex()));
+  }
+
+public Q_SLOTS:
+  void on_actionEstimateCurvature_triggered();
+private :
+  Scene_interface *scene;
+  QList<QAction*> _actions;
+}; // end Polyhedron_demo_interpolated_corrected_principal_curvatures_plugin
+
+
+void compute(SMesh* sMesh,
+             Scene_polylines_item* max_curv,
+             Scene_polylines_item* min_curv,
+             Scene_polylines_item* max_negative_curv,
+             Scene_polylines_item* min_negative_curv)
+{
+  namespace PMP = CGAL::Polygon_mesh_processing;
+  typedef CGAL::Exact_predicates_inexact_constructions_kernel EpicKernel;
+  typedef EpicKernel::Point_3 Point;
+  typedef EpicKernel::Point_3 Point;
+  typedef EpicKernel::Vector_3 Vector;
+  typedef boost::graph_traits<SMesh>::vertex_descriptor vertex_descriptor;
+  typedef std::tuple<
+      EpicKernel::FT,
+      EpicKernel::FT,
+      Vector,
+      Vector
+  > PrincipalCurvatureTuple;
+
+  typename boost::property_map<SMesh, CGAL::vertex_point_t>::type vpmap = get(CGAL::vertex_point, *sMesh);
+
+  bool created = false;
+  SMesh::Property_map<vertex_descriptor, PrincipalCurvatureTuple> principle_curvature_map;
+
+  boost::tie(principle_curvature_map, created) = sMesh->add_property_map<vertex_descriptor, PrincipalCurvatureTuple>
+      ("v:principle_curvature_map", { 0, 0,
+              Vector(0,0,0),
+              Vector(0,0,0)});
+      assert(created);
+
+  PMP::interpolated_corrected_principal_curvatures(
+      *sMesh,
+      principle_curvature_map
+  );
+
+  typename EpicKernel::FT max_curvature_magnitude_on_mesh = 0;
+  for (vertex_descriptor v : vertices(*sMesh))
+  {
+      const PrincipalCurvatureTuple pc = principle_curvature_map[v];
+      max_curvature_magnitude_on_mesh = max(max_curvature_magnitude_on_mesh, max(abs(get<0>(pc)), get<1>(pc)));
+  }
+
+  for(vertex_descriptor v : vertices(*sMesh))
+  {
+    std::vector<Point> points;
+
+    // pick central point
+    const Point& central_point = get(vpmap,v);
+    points.push_back(central_point);
+
+    // compute min edge len around central vertex
+    // to scale the ribbons used to display the directions
+
+    typedef EPICK::FT FT;
+
+    const std::size_t n = CGAL::edges(*sMesh).size();
+
+    EpicKernel::FT avg_edge_length = 0;
+    if (n > 0) {
+        for (auto e : CGAL::edges(*sMesh))
+            avg_edge_length += PMP::edge_length(e, *sMesh);
+        avg_edge_length /= n;
+    }
+
+    const PrincipalCurvatureTuple pc = principle_curvature_map[v];
+
+    Vector umin = (std::get<0>(pc)/ max_curvature_magnitude_on_mesh) * std::get<2>(pc) * avg_edge_length;
+    Vector umax = (std::get<1>(pc)/ max_curvature_magnitude_on_mesh) * std::get<3>(pc) * avg_edge_length;
+
+    Scene_polylines_item::Polyline max_segment(2), min_segment(2);
+
+    const double du = 0.4;
+
+    min_segment[0] = central_point + du * umin;
+    min_segment[1] = central_point - du * umin;
+    max_segment[0] = central_point + du * umax;
+    max_segment[1] = central_point - du * umax;
+
+    (std::get<0>(pc) > 0 ? min_curv : min_negative_curv)->polylines.push_back(min_segment);
+    (std::get<1>(pc) > 0 ? max_curv : max_negative_curv)->polylines.push_back(max_segment);
+  }
+}
+
+void Polyhedron_demo_interpolated_corrected_principal_curvatures_plugin::on_actionEstimateCurvature_triggered()
+{
+  // get active polyhedron
+  const CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
+  QString name = scene->item(index)->name();
+  Scene_surface_mesh_item* sm_item =
+    qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
+  if(! sm_item){
+    return;
+  }
+  // wait cursor
+  QApplication::setOverrideCursor(Qt::WaitCursor);
+
+  // types
+  Scene_polylines_item* max_curv = new Scene_polylines_item;
+  max_curv->setColor(Qt::red);
+  max_curv->setWidth(3);
+  max_curv->setName(tr("%1 (max curvatures)").arg(name));
+
+  Scene_polylines_item* min_curv = new Scene_polylines_item;
+  min_curv->setColor(QColor(255,210,0));
+  min_curv->setWidth(4);
+  min_curv->setName(tr("%1 (min curvatures)").arg(name));
+
+  Scene_polylines_item* max_negative_curv = new Scene_polylines_item;
+  max_negative_curv->setColor(Qt::cyan);
+  max_negative_curv->setWidth(4);
+  max_negative_curv->setName(tr("%1 (min negative curvatures)").arg(name));
+
+  Scene_polylines_item* min_negative_curv = new Scene_polylines_item;
+  min_negative_curv->setColor(Qt::blue);
+  min_negative_curv->setWidth(3);
+  min_negative_curv->setName(tr("%1 (max negative curvatures)").arg(name));
+
+  SMesh* pMesh = sm_item->polyhedron();
+  compute(pMesh, max_curv, min_curv, max_negative_curv, min_negative_curv);
+
+  scene->addItem(max_curv);
+  scene->addItem(min_curv);
+  max_curv->invalidateOpenGLBuffers();
+  min_curv->invalidateOpenGLBuffers();
+  scene->addItem(max_negative_curv);
+  scene->addItem(min_negative_curv);
+  max_negative_curv->invalidateOpenGLBuffers();
+  min_negative_curv->invalidateOpenGLBuffers();
+
+  // default cursor
+  QApplication::restoreOverrideCursor();
+}
+
+#include "Interpolated_corrected_principal_curvatures_plugin.moc"

From 419745088537cfc6425758ae527048132fde193a Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 26 Sep 2022 02:33:04 +0200
Subject: [PATCH 0056/1398] restored compute_normal.h

---
 .../CGAL/Polygon_mesh_processing/compute_normal.h    | 12 +++++++++---
 1 file changed, 9 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h
index 8dfb16af1bdd..2cd837e7bf84 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/compute_normal.h
@@ -717,9 +717,15 @@ compute_vertex_normal(typename boost::graph_traits<PolygonMesh>::vertex_descript
   }
 #endif
 
-    // Change for debugging (comparing with DGtal)
-    Vector_3 normal = internal::compute_vertex_normal_as_sum_of_weighted_normals(
-               v, internal::NO_WEIGHT, face_normals, vpmap, pmesh, traits);
+  Vector_3 normal = internal::compute_vertex_normal_most_visible_min_circle(v, face_normals, pmesh, traits);
+  if(traits.equal_3_object()(normal, CGAL::NULL_VECTOR)) // can't always find a most visible normal
+  {
+#ifdef CGAL_PMP_COMPUTE_NORMAL_DEBUG_PP
+    std::cout << "Failed to find most visible normal, use weighted sum of normals" << std::endl;
+#endif
+    normal = internal::compute_vertex_normal_as_sum_of_weighted_normals(
+               v, internal::SIN_WEIGHT, face_normals, vpmap, pmesh, traits);
+  }
 
   if(!traits.equal_3_object()(normal, CGAL::NULL_VECTOR))
     internal::normalize(normal, traits);

From 7118646bec18cb0d4192daad64d1f52eb16cae97 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 26 Sep 2022 09:19:17 +0200
Subject: [PATCH 0057/1398] typo fix

---
 .../Interpolated_corrected_principal_curvatures_plugin.cpp    | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
index 69c2b4fe2dd3..0b729978c7e7 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
@@ -160,12 +160,12 @@ void Polyhedron_demo_interpolated_corrected_principal_curvatures_plugin::on_acti
   Scene_polylines_item* max_negative_curv = new Scene_polylines_item;
   max_negative_curv->setColor(Qt::cyan);
   max_negative_curv->setWidth(4);
-  max_negative_curv->setName(tr("%1 (min negative curvatures)").arg(name));
+  max_negative_curv->setName(tr("%1 (max negative curvatures)").arg(name));
 
   Scene_polylines_item* min_negative_curv = new Scene_polylines_item;
   min_negative_curv->setColor(Qt::blue);
   min_negative_curv->setWidth(3);
-  min_negative_curv->setName(tr("%1 (max negative curvatures)").arg(name));
+  min_negative_curv->setName(tr("%1 (min negative curvatures)").arg(name));
 
   SMesh* pMesh = sm_item->polyhedron();
   compute(pMesh, max_curv, min_curv, max_negative_curv, min_negative_curv);

From a1e9345a1ece1571b583326a217cb5833822a7b6 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 26 Sep 2022 19:59:36 +0200
Subject: [PATCH 0058/1398] added principal curvatures plugin to test with
 cmake

---
 Polyhedron/demo/Polyhedron/cgal_test_with_cmake | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Polyhedron/demo/Polyhedron/cgal_test_with_cmake b/Polyhedron/demo/Polyhedron/cgal_test_with_cmake
index 6fea79491769..59eb5c1d0211 100755
--- a/Polyhedron/demo/Polyhedron/cgal_test_with_cmake
+++ b/Polyhedron/demo/Polyhedron/cgal_test_with_cmake
@@ -149,6 +149,7 @@ hole_filling_plugin \
 hole_filling_sm_plugin \
 hole_filling_polyline_plugin \
 inside_out_plugin \
+interpolated_corrected_principal_curvatures_plugin\
 surface_intersection_plugin \
 surface_intersection_sm_plugin \
 io_image_plugin \

From 4f76f267d5b3e9dd08529baf06fefdffba256b4f Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 5 Oct 2022 00:38:23 +0200
Subject: [PATCH 0059/1398] mostly docs and examples, moved utils to internal

---
 .../PackageDescription.txt                    |   8 -
 .../Polygon_mesh_processing.txt               |  54 ++++
 .../doc/Polygon_mesh_processing/examples.txt  |   3 +-
 .../Polygon_mesh_processing/CMakeLists.txt    |   6 +-
 ...rpolated_corrected_curvatures_example.cpp} |  59 ++--
 ...orrected_curvatures_polyhedron_example.cpp |  74 +++++
 ...nterpolated_corrected_curvature_measures.h | 290 +-----------------
 7 files changed, 184 insertions(+), 310 deletions(-)
 rename Polygon_mesh_processing/examples/Polygon_mesh_processing/{interpolated_corrected_curvatures.cpp => interpolated_corrected_curvatures_example.cpp} (52%)
 create mode 100644 Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 5c9e39811d46..eae47c610011 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -201,14 +201,6 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - \link PMP_locate_grp Random Location Generation \endlink
 
 \cgalCRPSection{Corrected Curvature Functions}
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_measure_mesh()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_anisotropic_measure_mesh()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_area_measure_face()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_measure_face()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_measure_face()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_anisotropic_measure_face()`
-- `CGAL::Polygon_mesh_processing::expand_interpolated_corrected_measure_vertex()`
-- `CGAL::Polygon_mesh_processing::expand_interpolated_corrected_anisotropic_measure_vertex()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures()`
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 743d6bc35079..6c684c4419b4 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -876,6 +876,60 @@ not provide storage for the normals.
 
 \cgalExample{Polygon_mesh_processing/compute_normals_example_Polyhedron.cpp}
 
+****************************************
+\section PMPICC Computing Curvatures
+
+This package provides methods to compute curvatures on polygonal meshes based on #PAPER#.
+This includes mean curvature, gaussian curvature, principal curvatures and directions.
+These can be computed on triangle meshes, quad meshes, and meshes with n-gon faces.
+The algorithms used prove to work well in general. Also, on meshes with noise
+on vertex positions, they give accurate results, on the condition that the
+correct vertex normals are provided.
+
+The implementation is generic in terms of mesh data structure. It can be used on Surface_mesh,
+Polyhedron_3 and other polygonal mesh structures based on the Face Graph Model.
+
+These computations are performed using :
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures()`
+
+\cgalFigureRef{icc_diff_radius} shows how the mean curvature changes depending on
+the ball_radius named parameter which can be set to a value > 0 to get a smoother
+distribution of valuesa and "diffuse" the extreme values of curvatures across the mesh.
+
+\cgalFigureAnchor{icc_diff_radius}
+<center>
+<img src="icc_diff_radius.png" style="max-width:90%;"/>
+</center>
+\cgalFigureCaptionBegin{icc_diff_radius}
+The mean curvature distrubution on a bear mesh with different values for the expanding ball radius
+\cgalFigureCaptionEnd
+
+Property maps are used to record the computed curvatures as shown in examples.
+
+\subsection ICCExample Interpolated Corrected Curvature Examples
+
+Property maps are an API introduced in the boost library that allows to
+associate values to keys. In the following examples, for each proberty map, we associate
+a curvature value to each vertex.
+
+\subsubsection ICCExample Interpolated Corrected Curvature on a Surface Mesh.
+
+The following example illustrates how to
+compute the curvatures on vertices
+and store them in property maps provided by the class `Surface_mesh`.
+
+\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp}
+
+\subsubsection NormalsExampleNP Interpolated Corrected Curvature on a Polyhedron
+
+The following example illustrates how to
+compute the curvatures on vertices
+and store them in unordered (or ordered) maps as the class `Polyhedron_3` does
+not provide storage for the curvatures.
+
+\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp}
 
 ****************************************
 \section PMPSlicer Slicer
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
index 0317812aa443..0588d1c76e14 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
@@ -19,7 +19,8 @@
 \example Polygon_mesh_processing/refine_fair_example.cpp
 \example Polygon_mesh_processing/mesh_slicer_example.cpp
 \example Polygon_mesh_processing/isotropic_remeshing_example.cpp
-\example Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+\example Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+\example Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
 \example Polygon_mesh_processing/delaunay_remeshing_example.cpp
 \example Polygon_mesh_processing/compute_normals_example_Polyhedron.cpp
 \example Polygon_mesh_processing/hausdorff_distance_remeshing_example.cpp
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index 4783d957589a..ab084384835b 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -105,8 +105,10 @@ create_single_source_cgal_program("cc_compatible_orientations.cpp")
 
 if(TARGET CGAL::Eigen3_support)
 
-  create_single_source_cgal_program("interpolated_corrected_curvatures.cpp")
-  target_link_libraries(interpolated_corrected_curvatures PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("interpolated_corrected_curvatures_example.cpp")
+  target_link_libraries(interpolated_corrected_curvatures_example PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("interpolated_corrected_curvatures_polyhedron_example.cpp")
+  target_link_libraries(interpolated_corrected_curvatures_polyhedron_example PUBLIC CGAL::Eigen3_support)
 
 endif()
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
similarity index 52%
rename from Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
rename to Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index c011d57db41e..caaa52eb3af0 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -7,18 +7,17 @@
 #include <boost/graph/graph_traits.hpp>
 
 #include <iostream>
-#include <unordered_map>
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel EpicKernel;
-typedef CGAL::Surface_mesh<EpicKernel::Point_3> Mesh;
-typedef boost::graph_traits<Mesh>::face_descriptor face_descriptor;
-typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_Kernel;
+typedef CGAL::Surface_mesh<Epic_Kernel::Point_3> Surface_Mesh;
+typedef boost::graph_traits<Surface_Mesh>::face_descriptor face_descriptor;
+typedef boost::graph_traits<Surface_Mesh>::vertex_descriptor vertex_descriptor;
 
 int main(int argc, char* argv[])
 {
-  Mesh g1;
+  Surface_Mesh g1;
   const std::string filename = (argc>1) ?
       argv[1] :
       CGAL::data_file_path("meshes/small_bunny.obj");
@@ -29,36 +28,54 @@ int main(int argc, char* argv[])
     return EXIT_FAILURE;
   }
 
+  // creating and tying surface mesh property maps for curvatures (with defaults = 0)
   bool created = false;
-
-  Mesh::Property_map<vertex_descriptor, EpicKernel::FT> mean_curvature_map, gaussian_curvature_map;
-  boost::tie(mean_curvature_map, created) = g1.add_property_map<vertex_descriptor, EpicKernel::FT>("v:mean_curvature_map", 0);
+  Surface_Mesh::Property_map<vertex_descriptor, Epic_Kernel::FT> mean_curvature_map, gaussian_curvature_map;
+  boost::tie(mean_curvature_map, created) = g1.add_property_map<vertex_descriptor, Epic_Kernel::FT>("v:mean_curvature_map", 0);
   assert(created);
 
-  boost::tie(gaussian_curvature_map, created) = g1.add_property_map<vertex_descriptor, EpicKernel::FT>("v:gaussian_curvature_map", 0);
+  boost::tie(gaussian_curvature_map, created) = g1.add_property_map<vertex_descriptor, Epic_Kernel::FT>("v:gaussian_curvature_map", 0);
   assert(created);
 
-  Mesh::Property_map<vertex_descriptor, std::tuple<
-      EpicKernel::FT,
-      EpicKernel::FT,
-      EpicKernel::Vector_3,
-      EpicKernel::Vector_3
+  // we use a tuble of 2 scalar values and 2 vectors for principal curvatures and directions
+  Surface_Mesh::Property_map<vertex_descriptor, std::tuple<
+      Epic_Kernel::FT,
+      Epic_Kernel::FT,
+      Epic_Kernel::Vector_3,
+      Epic_Kernel::Vector_3
       >> principle_curvature_map;
 
   boost::tie(principle_curvature_map, created) = g1.add_property_map<vertex_descriptor, std::tuple<
-      EpicKernel::FT,
-      EpicKernel::FT,
-      EpicKernel::Vector_3,
-      EpicKernel::Vector_3
+      Epic_Kernel::FT,
+      Epic_Kernel::FT,
+      Epic_Kernel::Vector_3,
+      Epic_Kernel::Vector_3
       >>("v:principle_curvature_map", { 0, 0,
-          EpicKernel::Vector_3 (0,0,0),
-          EpicKernel::Vector_3 (0,0,0)});
+          Epic_Kernel::Vector_3 (0,0,0),
+          Epic_Kernel::Vector_3 (0,0,0)});
   assert(created);
 
   PMP::interpolated_corrected_mean_curvature(
       g1,
       mean_curvature_map
   );
+
+  // uncomment this to compute a curvature while specifying named parameters
+  // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)
+  
+  /*Surface_Mesh::Property_map<vertex_descriptor, Epic_Kernel::Vector_3> vnm;
+  boost::tie(vnm, created) = g1.add_property_map<vertex_descriptor, Epic_Kernel::Vector_3>(
+      "v:vnm", Epic_Kernel::Vector_3(0, 0, 0)
+  );
+
+  assert(created);
+
+  PMP::interpolated_corrected_mean_curvature(
+      g1,
+      mean_curvature_map,
+      CGAL::parameters::ball_radius(0.5).vertex_normal_map(vnm)
+  );*/
+
   PMP::interpolated_corrected_gaussian_curvature(
       g1,
       gaussian_curvature_map
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
new file mode 100644
index 000000000000..3e56905068f3
--- /dev/null
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
@@ -0,0 +1,74 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/Polyhedron_3.h>
+#include <CGAL/property_map.h>
+
+#include <boost/graph/graph_traits.hpp>
+
+#include <iostream>
+#include <unordered_map>
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_Kernel;
+typedef CGAL::Polyhedron_3<Epic_Kernel> Polyhedron;
+typedef boost::graph_traits<Polyhedron>::face_descriptor face_descriptor;
+typedef boost::graph_traits<Polyhedron>::vertex_descriptor vertex_descriptor;
+
+int main(int argc, char* argv[])
+{
+  Polyhedron g1;
+  const std::string filename = (argc>1) ?
+      argv[1] :
+      CGAL::data_file_path("meshes/small_bunny.obj");
+
+  if(!CGAL::IO::read_polygon_mesh(filename, g1))
+  {
+    std::cerr << "Invalid input file." << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::unordered_map<vertex_descriptor, Epic_Kernel::FT> mean_curvature_map, gaussian_curvature_map;
+  std::unordered_map<vertex_descriptor, std::tuple<
+      Epic_Kernel::FT,
+      Epic_Kernel::FT,
+      Epic_Kernel::Vector_3,
+      Epic_Kernel::Vector_3
+      >> principle_curvature_map;
+
+  PMP::interpolated_corrected_mean_curvature(
+      g1,
+      boost::make_assoc_property_map(mean_curvature_map)
+  );
+
+  // uncomment this to compute a curvature while specifying named parameters
+  // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)
+  
+  /*std::unordered_map<vertex_descriptor, Epic_Kernel::Vector_3> vnm;
+
+  PMP::interpolated_corrected_mean_curvature(
+      g1,
+      boost::make_assoc_property_map(mean_curvature_map),
+      CGAL::parameters::ball_radius(0.5).vertex_normal_map(boost::make_assoc_property_map(vnm))
+  );*/
+
+  PMP::interpolated_corrected_gaussian_curvature(
+      g1,
+      boost::make_assoc_property_map(gaussian_curvature_map)
+  );
+  PMP::interpolated_corrected_principal_curvatures(
+      g1,
+      boost::make_assoc_property_map(principle_curvature_map)
+  );
+
+  int i = 0;
+  for (vertex_descriptor v : vertices(g1))
+  {
+    auto PC = principle_curvature_map[v];
+      std::cout << i << ": HC = " << mean_curvature_map[v]
+                     << ", GC = " << gaussian_curvature_map[v] << "\n"
+                     << ", PC = [ " << std::get<0>(PC) << " , " << std::get<1>(PC) << " ]\n";
+    i++;
+  }
+}
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index e2e1292aedb4..8f5e1d338edb 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -44,7 +44,7 @@ typename GT::FT average_edge_length(const PolygonMesh& pmesh)
     if (n == 0)
         return 0;
 
-    GT::FT avg_edge_length = 0;
+    typename GT::FT avg_edge_length = 0;
     for (auto e : edges(pmesh))
         avg_edge_length += edge_length(e, pmesh);
 
@@ -52,35 +52,12 @@ typename GT::FT average_edge_length(const PolygonMesh& pmesh)
     return avg_edge_length;
 }
 
-}
-
-/*!
- * \ingroup PMP_corrected_curvatures_grp
- * Enumeration type used to specify which measure of a given face
- * is computed for the interpolated corrected curvature functions.
- */
-// enum
 enum Curvature_measure_index {
     MU0_AREA_MEASURE, ///< corrected area density
     MU1_MEAN_CURVATURE_MEASURE, ///< corrected mean curvature density
     MU2_GAUSSIAN_CURVATURE_MEASURE ///< corrected gaussian curvature density
 };
 
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Computes the interpolated corrected area measure \f$ \mu_0 \f$ of a specific face.
-*
-* @tparam GT geometric traits class model of `Kernel`.
-*
-* @param x is a vector of the vertex positions of the face.
-* @param u is a vector of the vertex normals of the face.
-*
-*
-* @see `interpolated_corrected_mean_curvature_measure_face()`
-* @see `interpolated_corrected_gaussian_curvature_measure_face()`
-* @see `interpolated_corrected_measure_mesh()`
-*/
 template<typename GT>
 typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typename GT::Vector_3>& u,
                                                          const std::vector<typename GT::Vector_3>& x = {})
@@ -136,20 +113,6 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
     }
 }
 
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Computes the interpolated corrected mean curvature measure \f$ \mu_1 \f$ of a specific face.
-*
-* @tparam GT geometric traits class model of `Kernel`.
-*
-* @param x is a vector of the vertex positions of the face.
-* @param u is a vector of the vertex nomrals of the face.
-*
-* @see `interpolated_corrected_gaussian_curvature_measure_face()`
-* @see `interpolated_corrected_area_measure_face()`
-* @see `interpolated_corrected_measure_mesh()`
-*/
 template<typename GT>
 typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
                                                                    const std::vector<typename GT::Vector_3>& x = {})
@@ -216,20 +179,6 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
     }
 }
 
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Computes the interpolated corrected gaussian curvature measure \f$ \mu_2 \f$ of a specific face.
-*
-* @tparam GT geometric traits class model of `Kernel`.
-*
-* @param x is a vector of the vertex positions of the face.
-* @param u is a vector of the vertex nomrals of the face.
-*
-* @see `interpolated_corrected_mean_curvature_measure_face()`
-* @see `interpolated_corrected_area_measure_face()`
-* @see `interpolated_corrected_measure_mesh()`
-*/
 template<typename GT>
 typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
                                                                        const std::vector<typename GT::Vector_3>& x = {})
@@ -277,21 +226,6 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
     }
 }
 
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Computes the interpolated corrected anisotropic measure \f$ \mu_{XY} \f$ of a specific face.
-*
-* @tparam GT geometric traits class model of `Kernel`.
-*
-* @param u is a vector of the vertex nomrals of the face.
-* @param x is a vector of the vertex positions of the face.
-*
-* @return an array of scalar values for each combination of the standard basis (3x3)
-* These are the values of the interpolated corrected anisotropic measure of the given face.
-*
-* @see `interpolated_corrected_anisotropic_measure_mesh()`
-*/
 template<typename GT>
 std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_face(const std::vector<typename GT::Vector_3>& u,
                                                                                    const std::vector<typename GT::Vector_3>& x)
@@ -403,51 +337,6 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
     return muXY;
 }
 
-
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Computes the interpolated corrected curvature measure on each face of the mesh.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam FaceMeasureMap a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `GT::FT` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param fmm (face measure map) the property map used for storing the computed interpolated corrected measure.
-* @param mu_i an enum for choosing between computing
-*             the area measure, the mean curvature measure or the gaussian curvature measure.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-*
-* \cgalNamedParamsBegin
-*
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using compute_vertex_normals()}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @see `interpolated_corrected_area_measure_face()`
-* @see `interpolated_corrected_mean_curvature_measure_face()`
-* @see `interpolated_corrected_gaussian_curvature_measure_face()`
-*/
 template<typename PolygonMesh, typename FaceMeasureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void
@@ -518,48 +407,6 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     }
 }
 
-
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Computes the interpolated corrected anisotropic measure on each face of the mesh
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam FaceMeasureMap a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `std::array<GT::FT, 3 * 3>` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param fmm (face measure map) the property map used for storing the computed interpolated corrected measure.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-*
-* \cgalNamedParamsBegin
-*
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using compute_vertex_normals()}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @see `interpolated_corrected_anisotropic_measure_face()`
-* @see `interpolated_corrected_measure_mesh()`
-*/
 template<typename PolygonMesh, typename FaceMeasureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void
@@ -636,21 +483,6 @@ template<typename PolygonMesh, typename FaceMeasureMap,
 //    return samples_in / (typename GT::FT)(res * (res + 1) / 2);
 //}
 
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Computes the ratio of inclusion of a face in a ball of radius `r` around the
-* point `c`.
-*
-* @tparam GT geometric traits class model of `Kernel`.
-*
-* @param x is a vector of the vertex positions of the face.
-* @param r is the radius of the ball.
-* @param c is the center of the ball.
-*
-* @see `expand_interpolated_corrected_measure_vertex()`
-* @see `expand_interpolated_corrected_anisotropic_measure_vertex()`
-*/
 template<typename GT>
 typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
                                    const typename GT::FT r,
@@ -682,52 +514,6 @@ typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
     return (r - d_min) / (d_max - d_min);
 }
 
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Expands given face area and curvature (mean or gaussian) measures around a vertex `v`.
-* Expansion is based on the inclusion ratio of each face in a ball of radius `r` around the vertex `v`.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam FaceMeasureMap a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `GT::FT` as value type.
-* @tparam VertexMeasureMap a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param area_fmm (area face measure map) the property map storing the already computed area measure on each face.
-* @param curvature_fmm (curvature face measure map) the property map storing the already computed curvature measure on each face.
-* This curvature measure can be either the Mean Curvature or the Gaussian Curvature.
-* @param area_vmm (area vertex measure map) the property map provided to store the expanded area measure on each vertex.
-* @param curvature_vmm (curvature vertex measure map) the property map provided to store the expanded curvature measure on each vertex.
-* This curvature measure can be either the Mean Curvature or the Gaussian Curvature.
-* @param v (vertex) the vertex to expand the area and curvature measure around.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-*
-* \cgalNamedParamsBegin
-*
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{the radius of the ball around the vertex `v` to expand the area and curvature measure}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`0.01`}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @see `expand_interpolated_corrected_anisotropic_measure_vertex()`
-* @see `face_in_ball_ratio()`
-*/
 template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void expand_interpolated_corrected_measure_vertex(const PolygonMesh& pmesh,
@@ -802,54 +588,6 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
     put(curvature_vmm, v, corrected_mui);
 }
 
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Expands given face area and anisotropic measures around a vertex `v`.
-* Expansion is based on the inclusion ratio of each face in a ball of radius `r` around the vertex `v`.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`
-* @tparam AreaFaceMeasureMap a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `GT::FT` as value type.
-* @tparam AnisotropicFaceMeasureMap a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%face_descriptor` as key type and `std::array<typename GT::FT, 3 * 3>` as value type.
-* @tparam AreaVertexMeasureMap a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
-* @tparam AnisotropicVertexMeasureMap a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `std::array<typename GT::FT, 3 * 3>` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param area_fmm (area face measure map) the property map storing the already computed area measure on each face.
-* @param aniso_fmm (anisotropic face measure map) the property map storing the already computed anisotropic measure on each face.
-* @param area_vmm (area vertex measure map) the property map provided to store the expanded area measure on each vertex.
-* @param aniso_vmm (anisotropic vertex measure map) the property map provided to store the expanded anisotropic measure on each vertex.
-* @param v (vertex) the vertex to expand the area and anisotropic measure around.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-*
-* \cgalNamedParamsBegin
-*
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{the radius of the ball around the vertex `v` to expand the area and curvature measure}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`0.01`}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @see `expand_interpolated_corrected_measure_vertex()`
-* @see `face_in_ball_ratio()`
-*/
 template<typename PolygonMesh, typename AreaFaceMeasureMap, typename AnisotropicFaceMeasureMap,
     typename AreaVertexMeasureMap, typename AnisotropicVertexMeasureMap,
     typename NamedParameters = parameters::Default_named_parameters>
@@ -931,6 +669,8 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
     put(aniso_vmm, v, corrected_muXY);
 }
 
+} // namespace internal
+
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
@@ -948,8 +688,6 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
 *
 * @see `interpolated_corrected_gaussian_curvature()`
 * @see `interpolated_corrected_principal_curvatures()`
-* @see `interpolated_corrected_measure_mesh()`
-* @see `expand_interpolated_corrected_measure_vertex()`
 */
 
 template<typename PolygonMesh, typename VertexCurvatureMap,
@@ -983,12 +721,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     boost::associative_property_map<VertexMeasureMap_tag>
         mu0_expand_map(mu0_expand_init), mu1_expand_map(mu1_expand_init);
 
-    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE, np);
-    interpolated_corrected_measure_mesh(pmesh, mu1_map, MU1_MEAN_CURVATURE_MEASURE, np);
+    internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
+    internal::interpolated_corrected_measure_mesh(pmesh, mu1_map, internal::MU1_MEAN_CURVATURE_MEASURE, np);
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu1_map, mu0_expand_map, mu1_expand_map, v, np.ball_radius(r));
+        internal::expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu1_map, mu0_expand_map, mu1_expand_map, v, np.ball_radius(r));
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         if (v_mu0 != 0.0)
@@ -1015,8 +753,6 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *
 * @see `interpolated_corrected_mean_curvature()`
 * @see `interpolated_corrected_principal_curvatures()`
-* @see `interpolated_corrected_measure_mesh()`
-* @see `expand_interpolated_corrected_measure_vertex()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
@@ -1049,12 +785,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     boost::associative_property_map<VertexMeasureMap_tag>
         mu0_expand_map(mu0_expand_init), mu2_expand_map(mu2_expand_init);
 
-    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE, np);
-    interpolated_corrected_measure_mesh(pmesh, mu2_map, MU2_GAUSSIAN_CURVATURE_MEASURE, np);
+    internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
+    internal::interpolated_corrected_measure_mesh(pmesh, mu2_map, internal::MU2_GAUSSIAN_CURVATURE_MEASURE, np);
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu2_map, mu0_expand_map, mu2_expand_map, v, np.ball_radius(r));
+        internal::expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu2_map, mu0_expand_map, mu2_expand_map, v, np.ball_radius(r));
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         if(v_mu0 != 0.0)
@@ -1106,8 +842,6 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *
 * @see `interpolated_corrected_mean_curvature()`
 * @see `interpolated_corrected_gaussian_curvature()`
-* @see `interpolated_corrected_anisotropic_measure_mesh()`
-* @see `expand_interpolated_corrected_anisotropic_measure_vertex()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
@@ -1172,12 +906,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     boost::associative_property_map<VertexMatrixMeasureMap_tag>
         muXY_expand_map(muXY_expand_init);
 
-    interpolated_corrected_measure_mesh(pmesh, mu0_map, MU0_AREA_MEASURE, np);
-    interpolated_corrected_anisotropic_measure_mesh(pmesh, muXY_map, np);
+    internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
+    internal::interpolated_corrected_anisotropic_measure_mesh(pmesh, muXY_map, np);
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-        expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, mu0_map, muXY_map, mu0_expand_map, muXY_expand_map, v, np.ball_radius(r));
+        internal::expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, mu0_map, muXY_map, mu0_expand_map, muXY_expand_map, v, np.ball_radius(r));
 
         typename GT::FT v_mu0 = get(mu0_expand_map, v);
         Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = get(muXY_expand_map, v);

From bb6d3e4f07b372972e942f4198a1666289ac3916 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 5 Oct 2022 10:30:27 +0200
Subject: [PATCH 0060/1398] doc fix

---
 .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt   | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 6c684c4419b4..8f222497a527 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -914,7 +914,7 @@ Property maps are an API introduced in the boost library that allows to
 associate values to keys. In the following examples, for each proberty map, we associate
 a curvature value to each vertex.
 
-\subsubsection ICCExample Interpolated Corrected Curvature on a Surface Mesh.
+\subsubsection ICCExampleSM Interpolated Corrected Curvature on a Surface Mesh.
 
 The following example illustrates how to
 compute the curvatures on vertices
@@ -922,7 +922,7 @@ and store them in property maps provided by the class `Surface_mesh`.
 
 \cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp}
 
-\subsubsection NormalsExampleNP Interpolated Corrected Curvature on a Polyhedron
+\subsubsection ICCExamplePH Interpolated Corrected Curvature on a Polyhedron
 
 The following example illustrates how to
 compute the curvatures on vertices

From e80a4c8cc57e375356090e07da3a7ff4c5d452a0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 5 Oct 2022 10:32:45 +0200
Subject: [PATCH 0061/1398] change ref

---
 .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 6c684c4419b4..6bb9140939c2 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -914,7 +914,7 @@ Property maps are an API introduced in the boost library that allows to
 associate values to keys. In the following examples, for each proberty map, we associate
 a curvature value to each vertex.
 
-\subsubsection ICCExample Interpolated Corrected Curvature on a Surface Mesh.
+\subsubsection ICCExampleSM Interpolated Corrected Curvature on a Surface Mesh.
 
 The following example illustrates how to
 compute the curvatures on vertices

From 2cb8906639e3aea577bd9c98dcd5005b78c44004 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 7 Oct 2022 21:36:30 +0200
Subject: [PATCH 0062/1398] principle -> principal typo fixed

---
 .../interpolated_corrected_curvatures_example.cpp    | 12 ++++++------
 ...lated_corrected_curvatures_polyhedron_example.cpp |  8 ++++----
 ...polated_corrected_principal_curvatures_plugin.cpp | 12 ++++++------
 3 files changed, 16 insertions(+), 16 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index caaa52eb3af0..78307b952e4f 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -43,14 +43,14 @@ int main(int argc, char* argv[])
       Epic_Kernel::FT,
       Epic_Kernel::Vector_3,
       Epic_Kernel::Vector_3
-      >> principle_curvature_map;
+      >> principal_curvature_map;
 
-  boost::tie(principle_curvature_map, created) = g1.add_property_map<vertex_descriptor, std::tuple<
+  boost::tie(principal_curvature_map, created) = g1.add_property_map<vertex_descriptor, std::tuple<
       Epic_Kernel::FT,
       Epic_Kernel::FT,
       Epic_Kernel::Vector_3,
       Epic_Kernel::Vector_3
-      >>("v:principle_curvature_map", { 0, 0,
+      >>("v:principal_curvature_map", { 0, 0,
           Epic_Kernel::Vector_3 (0,0,0),
           Epic_Kernel::Vector_3 (0,0,0)});
   assert(created);
@@ -62,7 +62,7 @@ int main(int argc, char* argv[])
 
   // uncomment this to compute a curvature while specifying named parameters
   // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)
-  
+
   /*Surface_Mesh::Property_map<vertex_descriptor, Epic_Kernel::Vector_3> vnm;
   boost::tie(vnm, created) = g1.add_property_map<vertex_descriptor, Epic_Kernel::Vector_3>(
       "v:vnm", Epic_Kernel::Vector_3(0, 0, 0)
@@ -82,12 +82,12 @@ int main(int argc, char* argv[])
   );
   PMP::interpolated_corrected_principal_curvatures(
       g1,
-      principle_curvature_map
+      principal_curvature_map
   );
 
   for (vertex_descriptor v : vertices(g1))
   {
-    auto PC = principle_curvature_map[v];
+    auto PC = principal_curvature_map[v];
       std::cout << v.idx() << ": HC = " << mean_curvature_map[v]
                            << ", GC = " << gaussian_curvature_map[v] << "\n"
                            << ", PC = [ " << std::get<0>(PC) << " , " << std::get<1>(PC) << " ]\n";
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
index 3e56905068f3..43aff72dec2b 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
@@ -35,7 +35,7 @@ int main(int argc, char* argv[])
       Epic_Kernel::FT,
       Epic_Kernel::Vector_3,
       Epic_Kernel::Vector_3
-      >> principle_curvature_map;
+      >> principal_curvature_map;
 
   PMP::interpolated_corrected_mean_curvature(
       g1,
@@ -44,7 +44,7 @@ int main(int argc, char* argv[])
 
   // uncomment this to compute a curvature while specifying named parameters
   // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)
-  
+
   /*std::unordered_map<vertex_descriptor, Epic_Kernel::Vector_3> vnm;
 
   PMP::interpolated_corrected_mean_curvature(
@@ -59,13 +59,13 @@ int main(int argc, char* argv[])
   );
   PMP::interpolated_corrected_principal_curvatures(
       g1,
-      boost::make_assoc_property_map(principle_curvature_map)
+      boost::make_assoc_property_map(principal_curvature_map)
   );
 
   int i = 0;
   for (vertex_descriptor v : vertices(g1))
   {
-    auto PC = principle_curvature_map[v];
+    auto PC = principal_curvature_map[v];
       std::cout << i << ": HC = " << mean_curvature_map[v]
                      << ", GC = " << gaussian_curvature_map[v] << "\n"
                      << ", PC = [ " << std::get<0>(PC) << " , " << std::get<1>(PC) << " ]\n";
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
index 0b729978c7e7..59e6438b6763 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
@@ -72,23 +72,23 @@ void compute(SMesh* sMesh,
   typename boost::property_map<SMesh, CGAL::vertex_point_t>::type vpmap = get(CGAL::vertex_point, *sMesh);
 
   bool created = false;
-  SMesh::Property_map<vertex_descriptor, PrincipalCurvatureTuple> principle_curvature_map;
+  SMesh::Property_map<vertex_descriptor, PrincipalCurvatureTuple> principal_curvature_map;
 
-  boost::tie(principle_curvature_map, created) = sMesh->add_property_map<vertex_descriptor, PrincipalCurvatureTuple>
-      ("v:principle_curvature_map", { 0, 0,
+  boost::tie(principal_curvature_map, created) = sMesh->add_property_map<vertex_descriptor, PrincipalCurvatureTuple>
+      ("v:principal_curvature_map", { 0, 0,
               Vector(0,0,0),
               Vector(0,0,0)});
       assert(created);
 
   PMP::interpolated_corrected_principal_curvatures(
       *sMesh,
-      principle_curvature_map
+      principal_curvature_map
   );
 
   typename EpicKernel::FT max_curvature_magnitude_on_mesh = 0;
   for (vertex_descriptor v : vertices(*sMesh))
   {
-      const PrincipalCurvatureTuple pc = principle_curvature_map[v];
+      const PrincipalCurvatureTuple pc = principal_curvature_map[v];
       max_curvature_magnitude_on_mesh = max(max_curvature_magnitude_on_mesh, max(abs(get<0>(pc)), get<1>(pc)));
   }
 
@@ -114,7 +114,7 @@ void compute(SMesh* sMesh,
         avg_edge_length /= n;
     }
 
-    const PrincipalCurvatureTuple pc = principle_curvature_map[v];
+    const PrincipalCurvatureTuple pc = principal_curvature_map[v];
 
     Vector umin = (std::get<0>(pc)/ max_curvature_magnitude_on_mesh) * std::get<2>(pc) * avg_edge_length;
     Vector umax = (std::get<1>(pc)/ max_curvature_magnitude_on_mesh) * std::get<3>(pc) * avg_edge_length;

From 48fc5aeebd9cb076daf20d42c769bb0fa73f797a Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 6 Nov 2022 18:19:39 +0200
Subject: [PATCH 0063/1398] dynamic property maps

---
 ...nterpolated_corrected_curvature_measures.h | 32 +++++++++----------
 1 file changed, 16 insertions(+), 16 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 8f5e1d338edb..d2765c8aa527 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -702,10 +702,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-    typedef std::unordered_map<face_descriptor, typename GT::FT> FaceMeasureMap_tag;
+    typedef typename boost::property_map<PolygonMesh,
+        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type FaceMeasureMap;
 
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
-    typedef std::unordered_map<vertex_descriptor, typename GT::FT> VertexMeasureMap_tag;
+    typedef typename boost::property_map<PolygonMesh,
+        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type VertexMeasureMap;
 
     typename GT::FT
         r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
@@ -713,13 +715,11 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     if (r == 0)
         r = internal::average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
 
-    FaceMeasureMap_tag mu0_init, mu1_init;
-    boost::associative_property_map<FaceMeasureMap_tag>
-        mu0_map(mu0_init), mu1_map(mu1_init);
+    FaceMeasureMap mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
+    FaceMeasureMap mu1_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
 
-    VertexMeasureMap_tag mu0_expand_init, mu1_expand_init;
-    boost::associative_property_map<VertexMeasureMap_tag>
-        mu0_expand_map(mu0_expand_init), mu1_expand_map(mu1_expand_init);
+    VertexMeasureMap mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
+    VertexMeasureMap mu1_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
 
     internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
     internal::interpolated_corrected_measure_mesh(pmesh, mu1_map, internal::MU1_MEAN_CURVATURE_MEASURE, np);
@@ -766,10 +766,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-    typedef std::unordered_map<face_descriptor, typename GT::FT> FaceMeasureMap_tag;
+    typedef typename boost::property_map<PolygonMesh,
+        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type FaceMeasureMap;
 
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
-    typedef std::unordered_map<vertex_descriptor, typename GT::FT> VertexMeasureMap_tag;
+    typedef typename boost::property_map<PolygonMesh,
+        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type VertexMeasureMap;
 
     typename GT::FT
         r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
@@ -777,13 +779,11 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     if (r == 0)
         r = internal::average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
 
-    FaceMeasureMap_tag mu0_init, mu2_init;
-    boost::associative_property_map<FaceMeasureMap_tag>
-        mu0_map(mu0_init), mu2_map(mu2_init);
+    FaceMeasureMap mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
+    FaceMeasureMap mu2_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
 
-    VertexMeasureMap_tag mu0_expand_init, mu2_expand_init;
-    boost::associative_property_map<VertexMeasureMap_tag>
-        mu0_expand_map(mu0_expand_init), mu2_expand_map(mu2_expand_init);
+    VertexMeasureMap mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
+    VertexMeasureMap mu2_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
 
     internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
     internal::interpolated_corrected_measure_mesh(pmesh, mu2_map, internal::MU2_GAUSSIAN_CURVATURE_MEASURE, np);

From 38c66a61e338950689bf6efcbe6aea42f6b74e8a Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 6 Nov 2022 18:23:51 +0200
Subject: [PATCH 0064/1398] typo fixes

---
 .../interpolated_corrected_curvatures_example.cpp           | 2 +-
 .../Curvatures/interpolated_corrected_curvature_measures.h  | 6 +++---
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index 78307b952e4f..3916b1ea3e1a 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -37,7 +37,7 @@ int main(int argc, char* argv[])
   boost::tie(gaussian_curvature_map, created) = g1.add_property_map<vertex_descriptor, Epic_Kernel::FT>("v:gaussian_curvature_map", 0);
   assert(created);
 
-  // we use a tuble of 2 scalar values and 2 vectors for principal curvatures and directions
+  // we use a tuple of 2 scalar values and 2 vectors for principal curvatures and directions
   Surface_Mesh::Property_map<vertex_descriptor, std::tuple<
       Epic_Kernel::FT,
       Epic_Kernel::FT,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index d2765c8aa527..6426cae12de7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -675,7 +675,7 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
 * \ingroup PMP_corrected_curvatures_grp
 *
 * Computes the interpolated corrected mean curvature across the mesh
-* and stores it in a veretex property map `vcm`.
+* and stores it in a vertex property map `vcm`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap model of `WritablePropertyMap` with
@@ -740,7 +740,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * \ingroup PMP_corrected_curvatures_grp
 *
 * Computes the interpolated corrected gaussian curvature across the mesh
-* and stores it in a veretex property map `vcm`.
+* and stores it in a vertex property map `vcm`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap model of `WritablePropertyMap` with
@@ -804,7 +804,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * \ingroup PMP_corrected_curvatures_grp
 *
 * Computes the interpolated corrected principal curvatures across the mesh
-* and stores it in a veretex property map `vcm`.
+* and stores it in a vertex property map `vcm`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap model of `WritablePropertyMap` with

From ce7c2fa5b70e6eba02d679028174e513b4804922 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 6 Nov 2022 19:06:19 +0200
Subject: [PATCH 0065/1398] tab to space

---
 ...est_interopolated_corrected_curvatures.cpp | 238 +++++++++---------
 1 file changed, 119 insertions(+), 119 deletions(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
index e7b473141562..7e376c887716 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
@@ -19,130 +19,130 @@ typedef boost::graph_traits<SMesh>::edge_descriptor edge_descriptor;
 typedef boost::graph_traits<SMesh>::vertex_descriptor vertex_descriptor;
 
 void test(std::string mesh_path, EpicKernel::FT rel_expansion_radius, EpicKernel::FT rel_noise_magnitude) {
-	SMesh pmesh;
-	const std::string filename = CGAL::data_file_path(mesh_path);
-
-	if (!CGAL::IO::read_polygon_mesh(filename, pmesh))
-	{
-		std::cerr << "Invalid input file." << std::endl;
-	}
-
-	bool created = false;
-
-	SMesh::Property_map<vertex_descriptor, EpicKernel::FT> mean_curvature_map, gaussian_curvature_map;
-	boost::tie(mean_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:mean_curvature_map", 0);
-	assert(created);
-
-	boost::tie(gaussian_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:gaussian_curvature_map", 0);
-	assert(created);
-
-	// getting the max and min edge lengthes
-	const auto edge_range = CGAL::edges(pmesh);
-
-	const auto edge_length_comparator = [&, pmesh](auto l, auto r) {
-		return PMP::edge_length(l, pmesh) < PMP::edge_length(r, pmesh);
-	};
-
-	const edge_descriptor longest_edge = *std::max_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
-	const EpicKernel::FT max_edge_length = PMP::edge_length(longest_edge, pmesh);
-
-	const edge_descriptor shortest_edge = *std::min_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
-	const EpicKernel::FT min_edge_length = PMP::edge_length(shortest_edge, pmesh);
-
-
-	if (rel_noise_magnitude > 0)
-	{
-		if (!CGAL::is_triangle_mesh(pmesh))
-			return;
-
-		SMesh::Property_map<vertex_descriptor, EpicKernel::Vector_3> vnm;
-		boost::tie(vnm, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::Vector_3>("v:vnm", { 0 , 0 , 0 });
-		assert(created);
-
-		CGAL::Polygon_mesh_processing::compute_vertex_normals(pmesh, vnm);
-
-		PMP::random_perturbation(pmesh, rel_noise_magnitude * min_edge_length, CGAL::parameters::random_seed(0));
-		PMP::interpolated_corrected_mean_curvature(
-			pmesh,
-			mean_curvature_map,
-			CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
-		);
-		PMP::interpolated_corrected_gaussian_curvature(
-			pmesh,
-			gaussian_curvature_map,
-			CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
-		);
-	}
-	else {
-		PMP::interpolated_corrected_mean_curvature(
-			pmesh,
-			mean_curvature_map,
-			CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-		);
-		PMP::interpolated_corrected_gaussian_curvature(
-			pmesh,
-			gaussian_curvature_map,
-			CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-		);
-
-	}
-
-
-
-	//PMP::interpolated_corrected_mean_curvature(
-	//	pmesh,
-	//	mean_curvature_map,
-	//	CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-	//);
-	//PMP::interpolated_corrected_gaussian_curvature(
-	//	pmesh,
-	//	gaussian_curvature_map,
-	//	CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-	//);
-
-
-	const EpicKernel::FT max_mean_curvature = *std::max_element(mean_curvature_map.begin(), mean_curvature_map.end());
-	const EpicKernel::FT min_mean_curvature = *std::min_element(mean_curvature_map.begin(), mean_curvature_map.end());
-	const EpicKernel::FT max_gaussian_curvature = *std::max_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
-	const EpicKernel::FT min_gaussian_curvature = *std::min_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
-
-	std::cout << "# " << mesh_path << ":\n"
-		<< "expansion radius ratio to max length / expansion radius = " << rel_expansion_radius << " / " << rel_expansion_radius * max_edge_length << ",\n"
-		<< "max perturbation ratio to minlength / max perturbation = " << rel_noise_magnitude << " / " << rel_noise_magnitude * min_edge_length << "\n"
-		<< "mean curvature: min = " << min_mean_curvature << " <-> " << max_mean_curvature << " = max" << "\n"
-		<< "gaussian curvature: min = " << min_gaussian_curvature << " <-> " << max_gaussian_curvature << " = max" << "\n\n\n";
+    SMesh pmesh;
+    const std::string filename = CGAL::data_file_path(mesh_path);
+
+    if (!CGAL::IO::read_polygon_mesh(filename, pmesh))
+    {
+        std::cerr << "Invalid input file." << std::endl;
+    }
+
+    bool created = false;
+
+    SMesh::Property_map<vertex_descriptor, EpicKernel::FT> mean_curvature_map, gaussian_curvature_map;
+    boost::tie(mean_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:mean_curvature_map", 0);
+    assert(created);
+
+    boost::tie(gaussian_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:gaussian_curvature_map", 0);
+    assert(created);
+
+    // getting the max and min edge lengthes
+    const auto edge_range = CGAL::edges(pmesh);
+
+    const auto edge_length_comparator = [&, pmesh](auto l, auto r) {
+        return PMP::edge_length(l, pmesh) < PMP::edge_length(r, pmesh);
+    };
+
+    const edge_descriptor longest_edge = *std::max_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
+    const EpicKernel::FT max_edge_length = PMP::edge_length(longest_edge, pmesh);
+
+    const edge_descriptor shortest_edge = *std::min_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
+    const EpicKernel::FT min_edge_length = PMP::edge_length(shortest_edge, pmesh);
+
+
+    if (rel_noise_magnitude > 0)
+    {
+        if (!CGAL::is_triangle_mesh(pmesh))
+            return;
+
+        SMesh::Property_map<vertex_descriptor, EpicKernel::Vector_3> vnm;
+        boost::tie(vnm, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::Vector_3>("v:vnm", { 0 , 0 , 0 });
+        assert(created);
+
+        CGAL::Polygon_mesh_processing::compute_vertex_normals(pmesh, vnm);
+
+        PMP::random_perturbation(pmesh, rel_noise_magnitude * min_edge_length, CGAL::parameters::random_seed(0));
+        PMP::interpolated_corrected_mean_curvature(
+            pmesh,
+            mean_curvature_map,
+            CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
+        );
+        PMP::interpolated_corrected_gaussian_curvature(
+            pmesh,
+            gaussian_curvature_map,
+            CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
+        );
+    }
+    else {
+        PMP::interpolated_corrected_mean_curvature(
+            pmesh,
+            mean_curvature_map,
+            CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+        );
+        PMP::interpolated_corrected_gaussian_curvature(
+            pmesh,
+            gaussian_curvature_map,
+            CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+        );
+
+    }
+
+
+
+    //PMP::interpolated_corrected_mean_curvature(
+    //  pmesh,
+    //  mean_curvature_map,
+    //  CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+    //);
+    //PMP::interpolated_corrected_gaussian_curvature(
+    //  pmesh,
+    //  gaussian_curvature_map,
+    //  CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+    //);
+
+
+    const EpicKernel::FT max_mean_curvature = *std::max_element(mean_curvature_map.begin(), mean_curvature_map.end());
+    const EpicKernel::FT min_mean_curvature = *std::min_element(mean_curvature_map.begin(), mean_curvature_map.end());
+    const EpicKernel::FT max_gaussian_curvature = *std::max_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
+    const EpicKernel::FT min_gaussian_curvature = *std::min_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
+
+    std::cout << "# " << mesh_path << ":\n"
+        << "expansion radius ratio to max length / expansion radius = " << rel_expansion_radius << " / " << rel_expansion_radius * max_edge_length << ",\n"
+        << "max perturbation ratio to minlength / max perturbation = " << rel_noise_magnitude << " / " << rel_noise_magnitude * min_edge_length << "\n"
+        << "mean curvature: min = " << min_mean_curvature << " <-> " << max_mean_curvature << " = max" << "\n"
+        << "gaussian curvature: min = " << min_gaussian_curvature << " <-> " << max_gaussian_curvature << " = max" << "\n\n\n";
 
 
 }
 
 int main()
 {
-	const std::vector<std::string> mesh_pathes_to_test = {
-		"meshes/icc_test/Sphere Quads + Tris.obj",
-		"meshes/icc_test/Sphere Quads + Tris 100352.obj",
-		"meshes/icc_test/Sphere Tris Ico.obj",
-		"meshes/icc_test/Sphere Tris Tet.obj",
-		"meshes/icc_test/Sphere Tris Oct.obj",
-		"meshes/icc_test/Sphere Quads.obj",
-		"meshes/icc_test/Sphere Quads Remesh.obj",
-		"meshes/icc_test/Sphere Ngons + Quads + Tris.obj",
-		"meshes/icc_test/Cube with fillet Quads.obj",
-		"meshes/cylinder.off",
-		"meshes/icc_test/Lantern Tris.obj",
-		"meshes/icc_test/Lantern Quads.obj"
-	};
-
-	const std::vector<EpicKernel::FT> rel_expansion_radii = { 0, 0.1, 0.5, 1 };
-	const std::vector<EpicKernel::FT> rel_noise_magnitudes = { 0, 0.5, 0.9 };
-
-	for (auto mesh_path : mesh_pathes_to_test) {
-		for (EpicKernel::FT rel_expansion_radius : rel_expansion_radii)
-			for (EpicKernel::FT rel_noise_magnitude : rel_noise_magnitudes)
-			{
-				test(mesh_path, rel_expansion_radius, rel_noise_magnitude);
-			}
-
-		std::cout << "_________________________________________________________________________________\n\n";
-	}
+    const std::vector<std::string> mesh_pathes_to_test = {
+        "meshes/icc_test/Sphere Quads + Tris.obj",
+        "meshes/icc_test/Sphere Quads + Tris 100352.obj",
+        "meshes/icc_test/Sphere Tris Ico.obj",
+        "meshes/icc_test/Sphere Tris Tet.obj",
+        "meshes/icc_test/Sphere Tris Oct.obj",
+        "meshes/icc_test/Sphere Quads.obj",
+        "meshes/icc_test/Sphere Quads Remesh.obj",
+        "meshes/icc_test/Sphere Ngons + Quads + Tris.obj",
+        "meshes/icc_test/Cube with fillet Quads.obj",
+        "meshes/cylinder.off",
+        "meshes/icc_test/Lantern Tris.obj",
+        "meshes/icc_test/Lantern Quads.obj"
+    };
+
+    const std::vector<EpicKernel::FT> rel_expansion_radii = { 0, 0.1, 0.5, 1 };
+    const std::vector<EpicKernel::FT> rel_noise_magnitudes = { 0, 0.5, 0.9 };
+
+    for (auto mesh_path : mesh_pathes_to_test) {
+        for (EpicKernel::FT rel_expansion_radius : rel_expansion_radii)
+            for (EpicKernel::FT rel_noise_magnitude : rel_noise_magnitudes)
+            {
+                test(mesh_path, rel_expansion_radius, rel_noise_magnitude);
+            }
+
+        std::cout << "_________________________________________________________________________________\n\n";
+    }
 
 }

From 4295fd4e07645213ab3ac097cfa60821a2900d7b Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 6 Nov 2022 19:49:37 +0200
Subject: [PATCH 0066/1398] enum minor fix

---
 .../Display/Display_property_plugin.cpp       | 28 ++++++++++---------
 1 file changed, 15 insertions(+), 13 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index cda67cbd9700..c69b73694980 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -338,7 +338,10 @@ class DisplayPropertyPlugin :
   typedef CGAL::Heat_method_3::Surface_mesh_geodesic_distances_3<SMesh, CGAL::Heat_method_3::Intrinsic_Delaunay> Heat_method_idt;
   typedef CGAL::dynamic_vertex_property_t<bool>                        Vertex_source_tag;
   typedef boost::property_map<SMesh, Vertex_source_tag>::type Vertex_source_map;
-
+  enum CurvatureType {
+    MEAN_CURVATURE,
+    GAUSSIAN_CURVATURE,
+};
 public:
 
   bool applicable(QAction* action) const Q_DECL_OVERRIDE
@@ -613,11 +616,11 @@ private Q_SLOTS:
       sm_item->setRenderingMode(Gouraud);
       break;
     case 4: // Interpolated Corrected Mean Curvature
-        displayInterpolatedCurvatureMeasure(sm_item, PMP::MU1_MEAN_CURVATURE_MEASURE);
+        displayInterpolatedCurvatureMeasure(sm_item, MEAN_CURVATURE);
         sm_item->setRenderingMode(Gouraud);
         break;
     case 5: // Interpolated Corrected Gaussian Curvature
-        displayInterpolatedCurvatureMeasure(sm_item, PMP::MU2_GAUSSIAN_CURVATURE_MEASURE);
+        displayInterpolatedCurvatureMeasure(sm_item, GAUSSIAN_CURVATURE);
         sm_item->setRenderingMode(Gouraud);
         break;
     default:
@@ -843,9 +846,11 @@ private Q_SLOTS:
 
   }
 
-  void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item, PMP::Curvature_measure_index mu_index)
+  void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item, CurvatureType mu_index)
   {
-    std::string tied_string = (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)?
+    if (mu_index != MEAN_CURVATURE && mu_index != GAUSSIAN_CURVATURE) return;
+
+    std::string tied_string = (mu_index == MEAN_CURVATURE)?
         "v:interpolated_corrected_mean_curvature": "v:interpolated_corrected_gaussian_curvature";
     SMesh& smesh = *item->face_graph();
 
@@ -860,13 +865,13 @@ private Q_SLOTS:
     if (non_init)
     {
         if (vnm_exists) {
-            if (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)
+            if (mu_index == MEAN_CURVATURE)
                 PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
             else
                 PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
         }
         else {
-            if (mu_index == PMP::MU1_MEAN_CURVATURE_MEASURE)
+            if (mu_index == MEAN_CURVATURE)
                 PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
             else
                 PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
@@ -887,16 +892,13 @@ private Q_SLOTS:
                 min_index = v;
             }
         }
-        switch (mu_index)
-        {
-        case PMP::MU1_MEAN_CURVATURE_MEASURE:
+        if (mu_index == MEAN_CURVATURE){
             mean_curvature_max[item] = std::make_pair(res_max, max_index);
             mean_curvature_min[item] = std::make_pair(res_min, min_index);
-            break;
-        case PMP::MU2_GAUSSIAN_CURVATURE_MEASURE:
+        }
+        else {
             gaussian_curvature_max[item] = std::make_pair(res_max, max_index);
             gaussian_curvature_min[item] = std::make_pair(res_min, min_index);
-            break;
         }
 
         connect(item, &Scene_surface_mesh_item::itemChanged,

From aeaf881c49c8969ec6b1024fb93e4de8e3306ff6 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 6 Nov 2022 20:35:05 +0200
Subject: [PATCH 0067/1398] minor fix max func

---
 .../PMP/Interpolated_corrected_principal_curvatures_plugin.cpp  | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
index 59e6438b6763..21b292b05d0c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
@@ -89,7 +89,7 @@ void compute(SMesh* sMesh,
   for (vertex_descriptor v : vertices(*sMesh))
   {
       const PrincipalCurvatureTuple pc = principal_curvature_map[v];
-      max_curvature_magnitude_on_mesh = max(max_curvature_magnitude_on_mesh, max(abs(get<0>(pc)), get<1>(pc)));
+      max_curvature_magnitude_on_mesh = std::max(max_curvature_magnitude_on_mesh, std::max(abs(get<0>(pc)), get<1>(pc)));
   }
 
   for(vertex_descriptor v : vertices(*sMesh))

From 8efd947d53a12aa751eaec67f2ae4a37a1b862a3 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 7 Nov 2022 10:58:45 +0200
Subject: [PATCH 0068/1398] doc fixes

---
 ...nterpolated_corrected_curvature_measures.h | 81 +++++++++++++++++++
 1 file changed, 81 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 6426cae12de7..6e659e4e6ec8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -686,6 +686,41 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
 * @param vcm the vertex property map in which the computed mean curvatures are stored.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
 *
+* \cgalNamedParamsBegin
+*
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_normal_map}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Vector_3` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+*                     computed using compute_vertex_normals()}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{ball_radius}
+*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+*                           by summing measures of faces inside a ball of this radius centered at the
+*                           vertex expanded from. The summed face measures are weighted by their
+*                           inclusion ratio inside this ball}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{`-1`}
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+*                     measures on faces around the vertex}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+* 
 * @see `interpolated_corrected_gaussian_curvature()`
 * @see `interpolated_corrected_principal_curvatures()`
 */
@@ -751,6 +786,41 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * @param vcm the vertex property map in which the computed gaussian curvatures are stored.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
 *
+* \cgalNamedParamsBegin
+*
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_normal_map}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Vector_3` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+*                     computed using compute_vertex_normals()}
+*   \cgalParamNEnd
+* 
+*   \cgalParamNBegin{ball_radius}
+*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+*                           by summing measures of faces inside a ball of this radius centered at the 
+*                           vertex expanded from. The summed face measures are weighted by their 
+*                           inclusion ratio inside this ball}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{`-1`}
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of 
+*                     measures on faces around the vertex}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+* 
 * @see `interpolated_corrected_mean_curvature()`
 * @see `interpolated_corrected_principal_curvatures()`
 */
@@ -837,6 +907,17 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
 *                     computed using compute_vertex_normals()}
 *   \cgalParamNEnd
+* 
+*   \cgalParamNBegin{ball_radius}
+*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+*                           by summing measures of faces inside a ball of this radius centered at the 
+*                           vertex expanded from. The summed face measures are weighted by their 
+*                           inclusion ratio inside this ball}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{`-1`}
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of 
+*                     measures on faces around the vertex}
+*   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
 *

From af91351ba33452c5394eb2245e4b8bb02ae08e6d Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 7 Nov 2022 11:00:29 +0200
Subject: [PATCH 0069/1398] trailing white spaces

---
 ...nterpolated_corrected_curvature_measures.h | 20 +++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 6e659e4e6ec8..7658f1f4dbb1 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -720,7 +720,7 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
-* 
+*
 * @see `interpolated_corrected_gaussian_curvature()`
 * @see `interpolated_corrected_principal_curvatures()`
 */
@@ -807,20 +807,20 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
 *                     computed using compute_vertex_normals()}
 *   \cgalParamNEnd
-* 
+*
 *   \cgalParamNBegin{ball_radius}
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the 
-*                           vertex expanded from. The summed face measures are weighted by their 
+*                           by summing measures of faces inside a ball of this radius centered at the
+*                           vertex expanded from. The summed face measures are weighted by their
 *                           inclusion ratio inside this ball}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of 
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
 *                     measures on faces around the vertex}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
-* 
+*
 * @see `interpolated_corrected_mean_curvature()`
 * @see `interpolated_corrected_principal_curvatures()`
 */
@@ -907,15 +907,15 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
 *                     computed using compute_vertex_normals()}
 *   \cgalParamNEnd
-* 
+*
 *   \cgalParamNBegin{ball_radius}
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the 
-*                           vertex expanded from. The summed face measures are weighted by their 
+*                           by summing measures of faces inside a ball of this radius centered at the
+*                           vertex expanded from. The summed face measures are weighted by their
 *                           inclusion ratio inside this ball}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of 
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
 *                     measures on faces around the vertex}
 *   \cgalParamNEnd
 *

From f3aee255b5740de597edfd1bc53cbcdd63343d17 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 8 Nov 2022 19:19:40 +0200
Subject: [PATCH 0070/1398] dynamic property maps

---
 ...nterpolated_corrected_curvature_measures.h | 44 +++++++------------
 1 file changed, 16 insertions(+), 28 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 7658f1f4dbb1..8a9949b073c8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -26,7 +26,6 @@
 
 #include <numeric>
 #include <queue>
-#include <unordered_set>
 #include <functional>
 
 #define EXPANDING_RADIUS_EPSILON 1e-6
@@ -932,6 +931,18 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 {
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef typename boost::property_map<PolygonMesh,
+        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type FaceScalarMeasureMap;
+    typedef typename boost::property_map<PolygonMesh,
+        CGAL::dynamic_face_property_t<std::array<typename GT::FT, 3 * 3>>>::const_type FaceArrayMeasureMap;
+
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef typename boost::property_map<PolygonMesh,
+        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type VertexScalarMeasureMap;
+    typedef typename boost::property_map<PolygonMesh,
+        CGAL::dynamic_vertex_property_t<Eigen::Matrix<typename GT::FT, 3, 3>>>::const_type VertexMatrixMeasureMap;
+
     typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
     typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
@@ -958,34 +969,11 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
         compute_vertex_normals(pmesh, vnm, np);
 
+    FaceScalarMeasureMap mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
+    FaceArrayMeasureMap muXY_map = get(CGAL::dynamic_face_property_t<std::array<typename GT::FT, 3 * 3>>(), pmesh);
 
-
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-    typedef std::unordered_map<face_descriptor, typename GT::FT> FaceScalarMeasureMap_tag;
-    // using std:: array to store FT values on the 9 combinations of the standard 3D basis
-    typedef std::unordered_map<face_descriptor, std::array<typename GT::FT, 3 * 3>> FaceArrayMeasureMap_tag;
-
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
-    typedef std::unordered_map<vertex_descriptor, typename GT::FT> VertexScalarMeasureMap_tag;
-    // using Eigen matrix to store & Process FT values on the 9 combinations of the standard 3D basis
-    typedef std::unordered_map<vertex_descriptor, Eigen::Matrix<typename GT::FT, 3, 3>> VertexMatrixMeasureMap_tag;
-
-
-    FaceScalarMeasureMap_tag mu0_init;
-    boost::associative_property_map<FaceScalarMeasureMap_tag>
-        mu0_map(mu0_init);
-
-    FaceArrayMeasureMap_tag muXY_init;
-    boost::associative_property_map<FaceArrayMeasureMap_tag>
-        muXY_map(muXY_init);
-
-    VertexScalarMeasureMap_tag mu0_expand_init;
-    boost::associative_property_map<VertexScalarMeasureMap_tag>
-        mu0_expand_map(mu0_expand_init);
-
-    VertexMatrixMeasureMap_tag muXY_expand_init;
-    boost::associative_property_map<VertexMatrixMeasureMap_tag>
-        muXY_expand_map(muXY_expand_init);
+    VertexScalarMeasureMap mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
+    VertexMatrixMeasureMap muXY_expand_map = get(CGAL::dynamic_vertex_property_t<Eigen::Matrix<typename GT::FT, 3, 3>>(), pmesh);
 
     internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
     internal::interpolated_corrected_anisotropic_measure_mesh(pmesh, muXY_map, np);

From 866287a98ee0aa02e213873d8c50a1240e109f20 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 8 Nov 2022 20:13:04 +0200
Subject: [PATCH 0071/1398] minor naming conventions fixes

---
 ...nterpolated_corrected_curvature_measures.h | 140 +++++++++---------
 .../internal/parameters_interface.h           |   3 +
 2 files changed, 73 insertions(+), 70 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 8a9949b073c8..32c8fcdfcd47 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -351,21 +351,21 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
         NamedParameters,
-        Default_vector_map>::type       VNM;
+        Default_vector_map>::type       Vertex_normal_map;
 
     using parameters::choose_parameter;
     using parameters::get_parameter;
     using parameters::is_default_parameter;
 
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
 
     typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
             get_const_property_map(CGAL::vertex_point, pmesh));
 
-    VNM vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+    Vertex_normal_map vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
                                get(Vector_map_tag(), pmesh));
 
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
@@ -390,10 +390,10 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     std::vector<typename GT::Vector_3> x;
     std::vector<typename GT::Vector_3> u;
 
-    for (face_descriptor f : faces(pmesh))
+    for (Face_descriptor f : faces(pmesh))
     {
 
-        for (vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
+        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
         {
             typename GT::Point_3 p = get(vpm, v);
             x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
@@ -420,21 +420,21 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
         NamedParameters,
-        Default_vector_map>::type       VNM;
+        Default_vector_map>::type       VertexNormalMap;
 
     using parameters::choose_parameter;
     using parameters::get_parameter;
     using parameters::is_default_parameter;
 
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
 
     typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
             get_const_property_map(CGAL::vertex_point, pmesh));
 
-    VNM vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+    VertexNormalMap vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
         get(Vector_map_tag(), pmesh));
 
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
@@ -443,10 +443,10 @@ template<typename PolygonMesh, typename FaceMeasureMap,
     std::vector<typename GT::Vector_3> x;
     std::vector<typename GT::Vector_3> u;
 
-    for (face_descriptor f : faces(pmesh))
+    for (Face_descriptor f : faces(pmesh))
     {
 
-        for (vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
+        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
         {
             typename GT::Point_3 p = get(vpm, v);
             x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
@@ -528,8 +528,8 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
 
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
 
     const typename GT::FT
         r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
@@ -539,8 +539,8 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
             get_const_property_map(CGAL::vertex_point, pmesh));
 
 
-    std::queue<face_descriptor> bfs_queue;
-    std::unordered_set<face_descriptor> bfs_visited;
+    std::queue<Face_descriptor> bfs_queue;
+    std::unordered_set<Face_descriptor> bfs_visited;
 
     typename GT::Point_3 vp = get(vpm, v);
     typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
@@ -548,7 +548,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
     typename GT::FT corrected_mu0 = 0;
     typename GT::FT corrected_mui = 0;
 
-    for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
         if (f != boost::graph_traits<PolygonMesh>::null_face())
         {
             bfs_queue.push(f);
@@ -556,12 +556,12 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
         }
     }
     while (!bfs_queue.empty()) {
-        face_descriptor fi = bfs_queue.front();
+        Face_descriptor fi = bfs_queue.front();
         bfs_queue.pop();
 
         // looping over vertices in face to get point coordinates
         std::vector<typename GT::Vector_3> x;
-        for (vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
         {
             typename GT::Point_3 pi = get(vpm, vi);
             x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
@@ -573,7 +573,7 @@ template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMa
         {
             corrected_mu0 += f_ratio * get(area_fmm, fi);
             corrected_mui += f_ratio * get(curvature_fmm, fi);
-            for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+            for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
             {
                 if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
                 {
@@ -603,8 +603,8 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
 
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
 
     const typename GT::FT
         r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
@@ -614,8 +614,8 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
             get_const_property_map(CGAL::vertex_point, pmesh));
 
 
-    std::queue<face_descriptor> bfs_queue;
-    std::unordered_set<face_descriptor> bfs_visited;
+    std::queue<Face_descriptor> bfs_queue;
+    std::unordered_set<Face_descriptor> bfs_visited;
 
     typename GT::Point_3 vp = get(vpm, v);
     typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
@@ -623,7 +623,7 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
     typename GT::FT corrected_mu0 = 0;
     Eigen::Matrix<typename GT::FT, 3, 3> corrected_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
 
-    for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
         if (f != boost::graph_traits<PolygonMesh>::null_face())
         {
             bfs_queue.push(f);
@@ -631,12 +631,12 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
         }
     }
     while (!bfs_queue.empty()) {
-        face_descriptor fi = bfs_queue.front();
+        Face_descriptor fi = bfs_queue.front();
         bfs_queue.pop();
 
         // looping over vertices in face to get point coordinates
         std::vector<typename GT::Vector_3> x;
-        for (vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
         {
             typename GT::Point_3 pi = get(vpm, vi);
             x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
@@ -654,7 +654,7 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
                 for (std::size_t iy = 0; iy < 3; iy++)
                     corrected_muXY(ix, iy) += f_ratio * muXY_face[ix * 3 + iy];
 
-            for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+            for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
             {
                 if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
                 {
@@ -678,7 +678,7 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
+* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and `GT::FT` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
@@ -690,7 +690,7 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
 *                    as key type and `%Point_3` as value type}
 *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
@@ -700,7 +700,7 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
 *   \cgalParamNBegin{vertex_normal_map}
 *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
 *                    as key type and `%Vector_3` as value type}
 *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
@@ -735,13 +735,13 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type FaceMeasureMap;
+        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type Face_measure_map;
 
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type VertexMeasureMap;
+        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type Vertex_measure_map;
 
     typename GT::FT
         r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
@@ -749,16 +749,16 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     if (r == 0)
         r = internal::average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
 
-    FaceMeasureMap mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
-    FaceMeasureMap mu1_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
+    Face_measure_map mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
+    Face_measure_map mu1_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
 
-    VertexMeasureMap mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
-    VertexMeasureMap mu1_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
+    Vertex_measure_map mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
+    Vertex_measure_map mu1_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
 
     internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
     internal::interpolated_corrected_measure_mesh(pmesh, mu1_map, internal::MU1_MEAN_CURVATURE_MEASURE, np);
 
-    for (vertex_descriptor v : vertices(pmesh))
+    for (Vertex_descriptor v : vertices(pmesh))
     {
         internal::expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu1_map, mu0_expand_map, mu1_expand_map, v, np.ball_radius(r));
 
@@ -778,7 +778,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
+* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and `GT::FT` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
@@ -790,7 +790,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
 *                    as key type and `%Point_3` as value type}
 *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
@@ -800,7 +800,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *   \cgalParamNBegin{vertex_normal_map}
 *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
 *                    as key type and `%Vector_3` as value type}
 *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
@@ -834,13 +834,13 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type FaceMeasureMap;
+        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type Face_measure_map;
 
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type VertexMeasureMap;
+        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type Vertex_measure_map;
 
     typename GT::FT
         r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
@@ -848,16 +848,16 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     if (r == 0)
         r = internal::average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
 
-    FaceMeasureMap mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
-    FaceMeasureMap mu2_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
+    Face_measure_map mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
+    Face_measure_map mu2_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
 
-    VertexMeasureMap mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
-    VertexMeasureMap mu2_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
+    Vertex_measure_map mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
+    Vertex_measure_map mu2_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
 
     internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
     internal::interpolated_corrected_measure_mesh(pmesh, mu2_map, internal::MU2_GAUSSIAN_CURVATURE_MEASURE, np);
 
-    for (vertex_descriptor v : vertices(pmesh))
+    for (Vertex_descriptor v : vertices(pmesh))
     {
         internal::expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu2_map, mu0_expand_map, mu2_expand_map, v, np.ball_radius(r));
 
@@ -877,7 +877,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and
+* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and
 * `std::tuple<GT::FT, GT::FT, Eigen::Vector<GT::FT, 3>, Eigen::Vector<GT::FT, 3>>` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
@@ -890,7 +890,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
 *                    as key type and `%Point_3` as value type}
 *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
@@ -900,7 +900,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *   \cgalParamNBegin{vertex_normal_map}
 *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
 *                    as key type and `%Vector_3` as value type}
 *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
@@ -931,23 +931,23 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 {
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type FaceScalarMeasureMap;
+        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type Face_scalar_measure_map;
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<std::array<typename GT::FT, 3 * 3>>>::const_type FaceArrayMeasureMap;
+        CGAL::dynamic_face_property_t<std::array<typename GT::FT, 3 * 3>>>::const_type Face_array_measure_map;
 
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type VertexScalarMeasureMap;
+        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type Vertex_scalar_measure_map;
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_vertex_property_t<Eigen::Matrix<typename GT::FT, 3, 3>>>::const_type VertexMatrixMeasureMap;
+        CGAL::dynamic_vertex_property_t<Eigen::Matrix<typename GT::FT, 3, 3>>>::const_type Vertex_matrix_measure_map;
 
     typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
     typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
         NamedParameters,
-        Default_vector_map>::type       VNM;
+        Default_vector_map>::type       VertexNormalMap;
 
     using parameters::choose_parameter;
     using parameters::get_parameter;
@@ -957,7 +957,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
             get_const_property_map(CGAL::vertex_point, pmesh));
 
-    VNM vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+    VertexNormalMap vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
         get(Vector_map_tag(), pmesh));
 
     typename GT::FT
@@ -969,16 +969,16 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
         compute_vertex_normals(pmesh, vnm, np);
 
-    FaceScalarMeasureMap mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
-    FaceArrayMeasureMap muXY_map = get(CGAL::dynamic_face_property_t<std::array<typename GT::FT, 3 * 3>>(), pmesh);
+    Face_scalar_measure_map mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
+    Face_array_measure_map muXY_map = get(CGAL::dynamic_face_property_t<std::array<typename GT::FT, 3 * 3>>(), pmesh);
 
-    VertexScalarMeasureMap mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
-    VertexMatrixMeasureMap muXY_expand_map = get(CGAL::dynamic_vertex_property_t<Eigen::Matrix<typename GT::FT, 3, 3>>(), pmesh);
+    Vertex_scalar_measure_map mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
+    Vertex_matrix_measure_map muXY_expand_map = get(CGAL::dynamic_vertex_property_t<Eigen::Matrix<typename GT::FT, 3, 3>>(), pmesh);
 
     internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
     internal::interpolated_corrected_anisotropic_measure_mesh(pmesh, muXY_map, np);
 
-    for (vertex_descriptor v : vertices(pmesh))
+    for (Vertex_descriptor v : vertices(pmesh))
     {
         internal::expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, mu0_map, muXY_map, mu0_expand_map, muXY_expand_map, v, np.ball_radius(r));
 
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index 9eea7e71e442..03ee822d0bc9 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -87,6 +87,9 @@ CGAL_add_named_parameter(number_of_points_per_edge_t, number_of_points_per_edge,
 CGAL_add_named_parameter(number_of_points_on_edges_t, number_of_points_on_edges, number_of_points_on_edges)
 CGAL_add_named_parameter(nb_points_per_area_unit_t, nb_points_per_area_unit, number_of_points_per_area_unit)
 CGAL_add_named_parameter(nb_points_per_distance_unit_t, nb_points_per_distance_unit, number_of_points_per_distance_unit)
+CGAL_add_named_parameter(vertex_mean_curvature_map_t, vertex_mean_curvature_map, vertex_mean_curvature_map)
+CGAL_add_named_parameter(vertex_gaussian_curvature_map_t, vertex_gaussian_curvature_map, vertex_gaussian_curvature_map)
+CGAL_add_named_parameter(vertex_principal_curvature_map_t, vertex_principal_curvature_map, vertex_principal_curvature_map)
 CGAL_add_named_parameter(ball_radius_t, ball_radius, ball_radius)
 CGAL_add_named_parameter(outward_orientation_t, outward_orientation, outward_orientation)
 CGAL_add_named_parameter(overlap_test_t, overlap_test, do_overlap_test_of_bounded_sides)

From aff46b61624328468311bfe3e83172ade9bed7ec Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 9 Nov 2022 17:32:42 +0200
Subject: [PATCH 0072/1398] incomplete (integrating class for combined
 curvature computations)

---
 ...erpolated_corrected_curvatures_example.cpp |   19 +-
 ...nterpolated_corrected_curvature_measures.h | 1054 ++++++++++-------
 2 files changed, 663 insertions(+), 410 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index 3916b1ea3e1a..da6e9d2252f0 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -38,19 +38,10 @@ int main(int argc, char* argv[])
   assert(created);
 
   // we use a tuple of 2 scalar values and 2 vectors for principal curvatures and directions
-  Surface_Mesh::Property_map<vertex_descriptor, std::tuple<
-      Epic_Kernel::FT,
-      Epic_Kernel::FT,
-      Epic_Kernel::Vector_3,
-      Epic_Kernel::Vector_3
-      >> principal_curvature_map;
-
-  boost::tie(principal_curvature_map, created) = g1.add_property_map<vertex_descriptor, std::tuple<
-      Epic_Kernel::FT,
-      Epic_Kernel::FT,
-      Epic_Kernel::Vector_3,
-      Epic_Kernel::Vector_3
-      >>("v:principal_curvature_map", { 0, 0,
+  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvature<Epic_Kernel>> principal_curvature_map;
+
+  boost::tie(principal_curvature_map, created) = g1.add_property_map<vertex_descriptor, PMP::Principal_curvature<Epic_Kernel>>
+      ("v:principal_curvature_map", { 0, 0,
           Epic_Kernel::Vector_3 (0,0,0),
           Epic_Kernel::Vector_3 (0,0,0)});
   assert(created);
@@ -90,6 +81,6 @@ int main(int argc, char* argv[])
     auto PC = principal_curvature_map[v];
       std::cout << v.idx() << ": HC = " << mean_curvature_map[v]
                            << ", GC = " << gaussian_curvature_map[v] << "\n"
-                           << ", PC = [ " << std::get<0>(PC) << " , " << std::get<1>(PC) << " ]\n";
+                           << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
   }
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 32c8fcdfcd47..c4a9154c1aa2 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -26,6 +26,7 @@
 
 #include <numeric>
 #include <queue>
+#include <unordered_set>
 #include <functional>
 
 #define EXPANDING_RADIUS_EPSILON 1e-6
@@ -34,6 +35,32 @@ namespace CGAL {
 
 namespace Polygon_mesh_processing {
 
+template<typename GT>
+struct Principal_curvature {
+    typename GT::FT min_curvature;
+    typename GT::FT max_curvature;
+    typename GT::Vector_3 min_direction;
+    typename GT::Vector_3 max_direction;
+
+    Principal_curvature() {
+        min_curvature = 0;
+        max_curvature = 0;
+        min_direction = typename GT::Vector_3(0, 0, 0);
+        max_direction = typename GT::Vector_3(0, 0, 0);
+    }
+
+    Principal_curvature(
+        typename GT::FT min_curvature,
+        typename GT::FT max_curvature,
+        typename GT::Vector_3 min_direction,
+        typename GT::Vector_3 max_direction) {
+        this->min_curvature = min_curvature;
+        this->max_curvature = max_curvature;
+        this->min_direction = min_direction;
+        this->max_direction = max_direction;
+    }
+};
+
 namespace internal {
 
 template<typename PolygonMesh, typename GT>
@@ -57,6 +84,16 @@ enum Curvature_measure_index {
     MU2_GAUSSIAN_CURVATURE_MEASURE ///< corrected gaussian curvature density
 };
 
+template<typename GT>
+struct Vertex_measures {
+    typename GT::FT area_measure = 0;
+    typename GT::FT mean_curvature_measure = 0;
+    typename GT::FT gaussian_curvature_measure = 0;
+    std::array<typename GT::FT, 3 * 3> anisotropic_measure = { 0, 0, 0,
+                                                               0, 0, 0,
+                                                               0, 0, 0 };
+};
+
 template<typename GT>
 typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typename GT::Vector_3>& u,
                                                          const std::vector<typename GT::Vector_3>& x = {})
@@ -336,130 +373,129 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
     return muXY;
 }
 
-template<typename PolygonMesh, typename FaceMeasureMap,
-    typename NamedParameters = parameters::Default_named_parameters>
-    void
-    interpolated_corrected_measure_mesh(const PolygonMesh& pmesh,
-                                        FaceMeasureMap fmm,
-                                        const Curvature_measure_index mu_i,
-                                        const NamedParameters& np = parameters::default_values())
-{
-
-    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-
-    typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
-    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
-    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
-        NamedParameters,
-        Default_vector_map>::type       Vertex_normal_map;
-
-    using parameters::choose_parameter;
-    using parameters::get_parameter;
-    using parameters::is_default_parameter;
-
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
-
-    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
-        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-            get_const_property_map(CGAL::vertex_point, pmesh));
-
-    Vertex_normal_map vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
-                               get(Vector_map_tag(), pmesh));
-
-    if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
-        compute_vertex_normals(pmesh, vnm, np);
-
-    std::function
-        <typename GT::FT(const std::vector<typename GT::Vector_3>&, const std::vector<typename GT::Vector_3>&)>
-        iccm_function;
-    switch (mu_i)
-    {
-    case MU0_AREA_MEASURE:
-        iccm_function = &interpolated_corrected_area_measure_face<GT>;
-        break;
-    case MU1_MEAN_CURVATURE_MEASURE:
-        iccm_function = &interpolated_corrected_mean_curvature_measure_face<GT>;
-        break;
-    case MU2_GAUSSIAN_CURVATURE_MEASURE:
-        iccm_function = &interpolated_corrected_gaussian_curvature_measure_face<GT>;
-        break;
-    }
-
-    std::vector<typename GT::Vector_3> x;
-    std::vector<typename GT::Vector_3> u;
-
-    for (Face_descriptor f : faces(pmesh))
-    {
-
-        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
-        {
-            typename GT::Point_3 p = get(vpm, v);
-            x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
-            u.push_back(get(vnm, v));
-        }
-
-        put(fmm, f, iccm_function(u, x));
-        x.clear();
-        u.clear();
-    }
-}
-
-template<typename PolygonMesh, typename FaceMeasureMap,
-    typename NamedParameters = parameters::Default_named_parameters>
-    void
-    interpolated_corrected_anisotropic_measure_mesh(const PolygonMesh& pmesh,
-        FaceMeasureMap fmm,
-        const NamedParameters& np = parameters::default_values())
-{
-
-    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-
-    typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
-    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
-    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
-        NamedParameters,
-        Default_vector_map>::type       VertexNormalMap;
-
-    using parameters::choose_parameter;
-    using parameters::get_parameter;
-    using parameters::is_default_parameter;
-
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
-
-    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
-        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-            get_const_property_map(CGAL::vertex_point, pmesh));
-
-    VertexNormalMap vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
-        get(Vector_map_tag(), pmesh));
-
-    if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
-        compute_vertex_normals(pmesh, vnm, np);
-
-    std::vector<typename GT::Vector_3> x;
-    std::vector<typename GT::Vector_3> u;
-
-    for (Face_descriptor f : faces(pmesh))
-    {
-
-        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
-        {
-            typename GT::Point_3 p = get(vpm, v);
-            x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
-            u.push_back(get(vnm, v));
-        }
-
-        put(fmm, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
-        x.clear();
-        u.clear();
-
-    }
-}
-
+//template<typename PolygonMesh, typename FaceMeasureMap,
+//    typename NamedParameters = parameters::Default_named_parameters>
+//    void
+//    interpolated_corrected_measure_mesh(const PolygonMesh& pmesh,
+//                                        FaceMeasureMap fmm,
+//                                        const Curvature_measure_index mu_i,
+//                                        const NamedParameters& np = parameters::default_values())
+//{
+//
+//    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+//
+//    typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
+//    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
+//    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
+//        NamedParameters,
+//        Default_vector_map>::type       Vertex_normal_map;
+//
+//    using parameters::choose_parameter;
+//    using parameters::get_parameter;
+//    using parameters::is_default_parameter;
+//
+//    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+//    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+//    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
+//
+//    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
+//        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+//            get_const_property_map(CGAL::vertex_point, pmesh));
+//
+//    Vertex_normal_map vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+//                               get(Vector_map_tag(), pmesh));
+//
+//    if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
+//        compute_vertex_normals(pmesh, vnm, np);
+//
+//    std::function
+//        <typename GT::FT(const std::vector<typename GT::Vector_3>&, const std::vector<typename GT::Vector_3>&)>
+//        iccm_function;
+//    switch (mu_i)
+//    {
+//    case MU0_AREA_MEASURE:
+//        iccm_function = &interpolated_corrected_area_measure_face<GT>;
+//        break;
+//    case MU1_MEAN_CURVATURE_MEASURE:
+//        iccm_function = &interpolated_corrected_mean_curvature_measure_face<GT>;
+//        break;
+//    case MU2_GAUSSIAN_CURVATURE_MEASURE:
+//        iccm_function = &interpolated_corrected_gaussian_curvature_measure_face<GT>;
+//        break;
+//    }
+//
+//    std::vector<typename GT::Vector_3> x;
+//    std::vector<typename GT::Vector_3> u;
+//
+//    for (Face_descriptor f : faces(pmesh))
+//    {
+//
+//        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
+//        {
+//            typename GT::Point_3 p = get(vpm, v);
+//            x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
+//            u.push_back(get(vnm, v));
+//        }
+//
+//        put(fmm, f, iccm_function(u, x));
+//        x.clear();
+//        u.clear();
+//    }
+//}
+//
+//template<typename PolygonMesh, typename FaceMeasureMap,
+//    typename NamedParameters = parameters::Default_named_parameters>
+//    void
+//    interpolated_corrected_anisotropic_measure_mesh(const PolygonMesh& pmesh,
+//        FaceMeasureMap fmm,
+//        const NamedParameters& np = parameters::default_values())
+//{
+//
+//    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+//
+//    typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
+//    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
+//    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
+//        NamedParameters,
+//        Default_vector_map>::type       VertexNormalMap;
+//
+//    using parameters::choose_parameter;
+//    using parameters::get_parameter;
+//    using parameters::is_default_parameter;
+//
+//    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+//    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+//    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
+//
+//    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
+//        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+//            get_const_property_map(CGAL::vertex_point, pmesh));
+//
+//    VertexNormalMap vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+//        get(Vector_map_tag(), pmesh));
+//
+//    if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
+//        compute_vertex_normals(pmesh, vnm, np);
+//
+//    std::vector<typename GT::Vector_3> x;
+//    std::vector<typename GT::Vector_3> u;
+//
+//    for (Face_descriptor f : faces(pmesh))
+//    {
+//
+//        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
+//        {
+//            typename GT::Point_3 p = get(vpm, v);
+//            x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
+//            u.push_back(get(vnm, v));
+//        }
+//
+//        put(fmm, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
+//        x.clear();
+//        u.clear();
+//
+//    }
+//}
 
 //
 //template<typename GT>
@@ -513,160 +549,472 @@ typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
     return (r - d_min) / (d_max - d_min);
 }
 
-template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMap,
-    typename NamedParameters = parameters::Default_named_parameters>
-    void expand_interpolated_corrected_measure_vertex(const PolygonMesh& pmesh,
-        FaceMeasureMap area_fmm,
-        FaceMeasureMap curvature_fmm,
-        VertexMeasureMap area_vmm,
-        VertexMeasureMap curvature_vmm,
-        const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-        const NamedParameters& np = parameters::default_values())
+//template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMap,
+//    typename NamedParameters = parameters::Default_named_parameters>
+//    void expand_interpolated_corrected_measure_vertex(const PolygonMesh& pmesh,
+//        FaceMeasureMap area_fmm,
+//        FaceMeasureMap curvature_fmm,
+//        VertexMeasureMap area_vmm,
+//        VertexMeasureMap curvature_vmm,
+//        const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+//        const NamedParameters& np = parameters::default_values())
+//{
+//    using parameters::choose_parameter;
+//    using parameters::get_parameter;
+//
+//    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+//
+//    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+//    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+//
+//    const typename GT::FT
+//        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
+//
+//    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
+//        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+//            get_const_property_map(CGAL::vertex_point, pmesh));
+//
+//
+//    std::queue<Face_descriptor> bfs_queue;
+//    std::unordered_set<Face_descriptor> bfs_visited;
+//
+//    typename GT::Point_3 vp = get(vpm, v);
+//    typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
+//
+//    typename GT::FT corrected_mu0 = 0;
+//    typename GT::FT corrected_mui = 0;
+//
+//    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+//        if (f != boost::graph_traits<PolygonMesh>::null_face())
+//        {
+//            bfs_queue.push(f);
+//            bfs_visited.insert(f);
+//        }
+//    }
+//    while (!bfs_queue.empty()) {
+//        Face_descriptor fi = bfs_queue.front();
+//        bfs_queue.pop();
+//
+//        // looping over vertices in face to get point coordinates
+//        std::vector<typename GT::Vector_3> x;
+//        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+//        {
+//            typename GT::Point_3 pi = get(vpm, vi);
+//            x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
+//        }
+//
+//        const typename GT::FT f_ratio = face_in_ball_ratio<GT>(x, r, c);
+//
+//        if (f_ratio != 0.0)
+//        {
+//            corrected_mu0 += f_ratio * get(area_fmm, fi);
+//            corrected_mui += f_ratio * get(curvature_fmm, fi);
+//            for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+//            {
+//                if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
+//                {
+//                    bfs_queue.push(fj);
+//                    bfs_visited.insert(fj);
+//                }
+//            }
+//        }
+//    }
+//    put(area_vmm, v, corrected_mu0);
+//    put(curvature_vmm, v, corrected_mui);
+//}
+//
+//template<typename PolygonMesh, typename AreaFaceMeasureMap, typename AnisotropicFaceMeasureMap,
+//    typename AreaVertexMeasureMap, typename AnisotropicVertexMeasureMap,
+//    typename NamedParameters = parameters::Default_named_parameters>
+//    void expand_interpolated_corrected_anisotropic_measure_vertex(const PolygonMesh& pmesh,
+//        AreaFaceMeasureMap area_fmm,
+//        AnisotropicFaceMeasureMap aniso_fmm,
+//        AreaVertexMeasureMap area_vmm,
+//        AnisotropicVertexMeasureMap aniso_vmm,
+//        const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+//        const NamedParameters& np = parameters::default_values())
+//{
+//    using parameters::choose_parameter;
+//    using parameters::get_parameter;
+//
+//    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+//
+//    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+//    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+//
+//    const typename GT::FT
+//        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
+//
+//    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
+//        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+//            get_const_property_map(CGAL::vertex_point, pmesh));
+//
+//
+//    std::queue<Face_descriptor> bfs_queue;
+//    std::unordered_set<Face_descriptor> bfs_visited;
+//
+//    typename GT::Point_3 vp = get(vpm, v);
+//    typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
+//
+//    typename GT::FT corrected_mu0 = 0;
+//    Eigen::Matrix<typename GT::FT, 3, 3> corrected_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
+//
+//    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+//        if (f != boost::graph_traits<PolygonMesh>::null_face())
+//        {
+//            bfs_queue.push(f);
+//            bfs_visited.insert(f);
+//        }
+//    }
+//    while (!bfs_queue.empty()) {
+//        Face_descriptor fi = bfs_queue.front();
+//        bfs_queue.pop();
+//
+//        // looping over vertices in face to get point coordinates
+//        std::vector<typename GT::Vector_3> x;
+//        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+//        {
+//            typename GT::Point_3 pi = get(vpm, vi);
+//            x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
+//        }
+//
+//        const typename GT::FT f_ratio = face_in_ball_ratio<GT>(x, r, c);
+//
+//        if (f_ratio != 0.0)
+//        {
+//            corrected_mu0 += f_ratio * get(area_fmm, fi);
+//
+//            std::array<typename GT::FT, 3 * 3> muXY_face = get(aniso_fmm, fi);
+//
+//            for (std::size_t ix = 0; ix < 3; ix++)
+//                for (std::size_t iy = 0; iy < 3; iy++)
+//                    corrected_muXY(ix, iy) += f_ratio * muXY_face[ix * 3 + iy];
+//
+//            for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+//            {
+//                if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
+//                {
+//                    bfs_queue.push(fj);
+//                    bfs_visited.insert(fj);
+//                }
+//            }
+//        }
+//    }
+//    put(area_vmm, v, corrected_mu0);
+//    put(aniso_vmm, v, corrected_muXY);
+//}
+
+
+template<typename GT>
+Principal_curvature<GT> principal_curvature_from_anisotropic_measures(
+    const std::array<typename GT::FT, 3 * 3> anisotropic_measure,
+    const typename GT::FT v_mu0,
+    const typename GT::Vector_3 u_GT
+)
 {
-    using parameters::choose_parameter;
-    using parameters::get_parameter;
+    Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
+
+    for (std::size_t ix = 0; ix < 3; ix++)
+        for (std::size_t iy = 0; iy < 3; iy++)
+            v_muXY(ix, iy) = anisotropic_measure[ix * 3 + iy];
+
+    Eigen::Matrix<typename GT::FT, 3, 1> u(u_GT.x(), u_GT.y(), u_GT.z());
+    const typename GT::FT K = 1000 * v_mu0;
 
+    v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
+
+    Eigen::SelfAdjointEigenSolver<Eigen::Matrix <typename GT::FT, 3, 3>> eigensolver;
+
+    eigensolver.computeDirect(v_muXY);
+
+    if (eigensolver.info() != Eigen::Success)
+        return Principal_curvature<GT>();
+
+    const Eigen::Matrix<typename GT::FT, 3, 1> eig_vals = eigensolver.eigenvalues();
+    const Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs = eigensolver.eigenvectors();
+
+    const typename GT::Vector_3 min_eig_vec(eig_vecs(0, 1), eig_vecs(1, 1), eig_vecs(2, 1));
+    const typename GT::Vector_3 max_eig_vec(eig_vecs(0, 0), eig_vecs(1, 0), eig_vecs(2, 0));
+
+    return Principal_curvature<GT>(
+        (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
+        (v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
+        min_eig_vec,
+        max_eig_vec
+        );
+}
+
+template<typename PolygonMesh, typename NamedParameters = parameters::Default_named_parameters>
+class Interpolated_corrected_curvatures_computer
+{
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
+    typedef typename GT::FT FT;
+    typedef typename GT::Point_3 Point_3;
+    typedef typename GT::Vector_3 Vector_3;
+
+    typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
+
+    typedef dynamic_vertex_property_t<Vector_3> Vector_map_tag;
+    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
+    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
+        NamedParameters,
+        Default_vector_map>::type Vertex_normal_map;
+
+    typedef dynamic_vertex_property_t<FT> Scalar_map_tag;
+    typedef typename boost::property_map<PolygonMesh, Scalar_map_tag>::const_type Default_scalar_map;
+    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_mean_curvature_map_t,
+        NamedParameters,
+        Default_scalar_map>::type Vertex_scalar_curvature_map;
+
+    typedef dynamic_vertex_property_t<Principal_curvature<GT>> Principal_map_tag;
+    typedef typename boost::property_map<PolygonMesh, Principal_map_tag>::const_type Default_principal_map;
+    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvature_map_t,
+        NamedParameters,
+        Default_principal_map>::type Vertex_principal_curvature_map;
+
+
+
+    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor Edge_descriptor;
     typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
     typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
 
-    const typename GT::FT
-        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
+    typedef typename boost::property_map<PolygonMesh,
+        CGAL::dynamic_face_property_t<FT>>::type Face_scalar_measure_map;
+    typedef typename boost::property_map<PolygonMesh,
+        CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>>::type Face_anisotropic_measure_map;
+
+private:
+    const PolygonMesh& pmesh;
+    Vertex_position_map vpm;
+    Vertex_normal_map vnm;
+    FT ball_radius;
+
+    bool is_mean_curvature_selected;
+    bool is_gaussian_curvature_selected;
+    bool is_principal_curvature_selected;
+
+    Vertex_scalar_curvature_map mean_curvature_map, gaussian_curvature_map;
+    Vertex_principal_curvature_map principal_curvature_map;
+
+    Face_scalar_measure_map mu0_map, mu1_map, mu2_map;
+    Face_anisotropic_measure_map muXY_map;
+
+    void set_property_maps() {
+        mu0_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
+        mu1_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
+        mu2_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
+        muXY_map = get(CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>(), pmesh);
+
+    }
+
+    void set_named_params(const NamedParameters& np = parameters::default_values())
+    {
+        using parameters::choose_parameter;
+        using parameters::get_parameter;
+        using parameters::is_default_parameter;
 
-    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
         vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
             get_const_property_map(CGAL::vertex_point, pmesh));
 
+        vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+            get(Vector_map_tag(), pmesh));
 
-    std::queue<Face_descriptor> bfs_queue;
-    std::unordered_set<Face_descriptor> bfs_visited;
+        if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
+            compute_vertex_normals(pmesh, vnm, np);
 
-    typename GT::Point_3 vp = get(vpm, v);
-    typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
+        const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
 
-    typename GT::FT corrected_mu0 = 0;
-    typename GT::FT corrected_mui = 0;
+        if (is_mean_curvature_selected)
+            mean_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature_map), get(CGAL::dynamic_vertex_property_t<FT>(), pmesh));
+        if (is_gaussian_curvature_selected)
+            gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature_map), get(CGAL::dynamic_vertex_property_t<FT>(), pmesh));
+        if (is_principal_curvature_selected)
+            principal_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvature_map), get(CGAL::dynamic_vertex_property_t<Principal_curvature<GT>>(), pmesh));
 
-    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-        if (f != boost::graph_traits<PolygonMesh>::null_face())
-        {
-            bfs_queue.push(f);
-            bfs_visited.insert(f);
-        }
+        set_ball_radius(radius);
     }
-    while (!bfs_queue.empty()) {
-        Face_descriptor fi = bfs_queue.front();
-        bfs_queue.pop();
 
-        // looping over vertices in face to get point coordinates
-        std::vector<typename GT::Vector_3> x;
-        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
-        {
-            typename GT::Point_3 pi = get(vpm, vi);
-            x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
-        }
+    void set_ball_radius(const FT radius) {
+        if (radius == 0)
+            ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+    }
+
+public:
+    
+    Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,
+        bool is_mean_curvature_selected,
+        bool is_gaussian_curvature_selected,
+        bool is_principal_curvature_selected,
+        const NamedParameters& np = parameters::default_values()
+    ) :
+        pmesh(pmesh),
+        is_mean_curvature_selected(is_mean_curvature_selected),
+        is_gaussian_curvature_selected(is_gaussian_curvature_selected),
+        is_principal_curvature_selected(is_principal_curvature_selected)
+    {
+        if (!is_mean_curvature_selected && !is_gaussian_curvature_selected && !is_principal_curvature_selected)
+            return;
+
+        set_named_params();
 
-        const typename GT::FT f_ratio = face_in_ball_ratio<GT>(x, r, c);
+        set_property_maps();
 
-        if (f_ratio != 0.0)
+        compute_selected_curvatures();
+
+    }
+
+    void interpolated_corrected_all_measures_all_faces()
+    {
+        std::vector<Vector_3> x;
+        std::vector<Vector_3> u;
+
+        for (Face_descriptor f : faces(pmesh))
         {
-            corrected_mu0 += f_ratio * get(area_fmm, fi);
-            corrected_mui += f_ratio * get(curvature_fmm, fi);
-            for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+            for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
             {
-                if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
-                {
-                    bfs_queue.push(fj);
-                    bfs_visited.insert(fj);
-                }
+                Point_3 p = get(vpm, v);
+                x.push_back(Vector_3(p.x(), p.y(), p.z()));
+                u.push_back(get(vnm, v));
             }
-        }
-    }
-    put(area_vmm, v, corrected_mu0);
-    put(curvature_vmm, v, corrected_mui);
-}
-
-template<typename PolygonMesh, typename AreaFaceMeasureMap, typename AnisotropicFaceMeasureMap,
-    typename AreaVertexMeasureMap, typename AnisotropicVertexMeasureMap,
-    typename NamedParameters = parameters::Default_named_parameters>
-    void expand_interpolated_corrected_anisotropic_measure_vertex(const PolygonMesh& pmesh,
-        AreaFaceMeasureMap area_fmm,
-        AnisotropicFaceMeasureMap aniso_fmm,
-        AreaVertexMeasureMap area_vmm,
-        AnisotropicVertexMeasureMap aniso_vmm,
-        const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-        const NamedParameters& np = parameters::default_values())
-{
-    using parameters::choose_parameter;
-    using parameters::get_parameter;
+            put(mu0_map, f, interpolated_corrected_area_measure_face<GT>(u, x));
 
-    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+            if (is_mean_curvature_selected)
+                put(mu1_map, f, interpolated_corrected_mean_curvature_measure_face<GT>(u, x));
 
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+            if (is_gaussian_curvature_selected)
+                put(mu2_map, f, interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x));
 
-    const typename GT::FT
-        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
+            if (is_principal_curvature_selected)
+                put(muXY_map, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
 
-    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
-        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-            get_const_property_map(CGAL::vertex_point, pmesh));
+            x.clear();
+            u.clear();
+        }
+    }
 
+    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(Vertex_descriptor v)
+    {
+        Vertex_measures<GT> vertex_curvatures;
 
-    std::queue<Face_descriptor> bfs_queue;
-    std::unordered_set<Face_descriptor> bfs_visited;
+        for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+            vertex_curvatures.area_measure += get(mu0_map, f);
 
-    typename GT::Point_3 vp = get(vpm, v);
-    typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
+            if (is_mean_curvature_selected)
+                vertex_curvatures.mean_curvature_measure += get(mu1_map, f);
 
-    typename GT::FT corrected_mu0 = 0;
-    Eigen::Matrix<typename GT::FT, 3, 3> corrected_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
+            if (is_gaussian_curvature_selected)
+                vertex_curvatures.gaussian_curvature_measure += get(mu2_map, f);
 
-    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-        if (f != boost::graph_traits<PolygonMesh>::null_face())
-        {
-            bfs_queue.push(f);
-            bfs_visited.insert(f);
+            if (is_principal_curvature_selected)
+            {
+                const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, f);
+                for (std::size_t i = 0; i < 3 * 3; i++)
+                    vertex_curvatures.anisotropic_measure[i] += face_anisotropic_measure[i];
+            }
         }
+        
+        return vertex_curvatures;
     }
-    while (!bfs_queue.empty()) {
-        Face_descriptor fi = bfs_queue.front();
-        bfs_queue.pop();
 
-        // looping over vertices in face to get point coordinates
-        std::vector<typename GT::Vector_3> x;
-        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
-        {
-            typename GT::Point_3 pi = get(vpm, vi);
-            x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
-        }
+    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex(Vertex_descriptor v)
+    {
+        std::queue<Face_descriptor> bfs_queue;
+        std::unordered_set<Face_descriptor> bfs_visited;
 
-        const typename GT::FT f_ratio = face_in_ball_ratio<GT>(x, r, c);
+        Point_3 vp = get(vpm, v);
+        Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
 
-        if (f_ratio != 0.0)
-        {
-            corrected_mu0 += f_ratio * get(area_fmm, fi);
+        Vertex_measures<GT> vertex_curvatures;
+
+        for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+            if (f != boost::graph_traits<PolygonMesh>::null_face())
+            {
+                bfs_queue.push(f);
+                bfs_visited.insert(f);
+            }
+        }
+        while (!bfs_queue.empty()) {
+            Face_descriptor fi = bfs_queue.front();
+            bfs_queue.pop();
 
-            std::array<typename GT::FT, 3 * 3> muXY_face = get(aniso_fmm, fi);
+            // looping over vertices in face to get point coordinates
+            std::vector<Vector_3> x;
+            for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+            {
+                Point_3 pi = get(vpm, vi);
+                x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
+            }
 
-            for (std::size_t ix = 0; ix < 3; ix++)
-                for (std::size_t iy = 0; iy < 3; iy++)
-                    corrected_muXY(ix, iy) += f_ratio * muXY_face[ix * 3 + iy];
+            const FT f_ratio = face_in_ball_ratio<GT>(x, ball_radius, c);
 
-            for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+            if (f_ratio != 0.0)
             {
-                if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
+                vertex_curvatures.area_measure += f_ratio * get(mu0_map, fi);
+
+                if (is_mean_curvature_selected)
+                    vertex_curvatures.mean_curvature_measure += f_ratio * get(mu1_map, fi);
+
+                if (is_gaussian_curvature_selected)
+                    vertex_curvatures.gaussian_curvature_measure += f_ratio * get(mu2_map, fi);
+
+                if (is_principal_curvature_selected)
                 {
-                    bfs_queue.push(fj);
-                    bfs_visited.insert(fj);
+                    const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, fi);
+                    for (std::size_t i = 0; i < 3 * 3; i++)
+                        vertex_curvatures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
+                }
+
+                for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+                {
+                    if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
+                    {
+                        bfs_queue.push(fj);
+                        bfs_visited.insert(fj);
+                    }
                 }
             }
         }
+        return vertex_curvatures;
+    }
+
+    void compute_selected_curvatures() {
+        interpolated_corrected_all_measures_all_faces();
+
+        for (Vertex_descriptor v : vertices(pmesh))
+        {
+            Vertex_measures<GT> vertex_curvatures = (ball_radius < 0)? 
+                expand_interpolated_corrected_measure_vertex_no_radius(v) : 
+                expand_interpolated_corrected_measure_vertex(v);
+
+            if (is_mean_curvature_selected) {
+                vertex_curvatures.area_measure != 0 ?
+                    put(mean_curvature_map, v, 0.5 * vertex_curvatures.mean_curvature_measure / vertex_curvatures.area_measure) :
+                    put(mean_curvature_map, v, 0);
+            }
+
+            if (is_gaussian_curvature_selected) {
+                vertex_curvatures.area_measure != 0 ?
+                    put(gaussian_curvature_map, v, vertex_curvatures.gaussian_curvature_measure / vertex_curvatures.area_measure) :
+                    put(gaussian_curvature_map, v, 0);
+            }
+
+            if (is_principal_curvature_selected) {
+                const Vector_3  v_normal = get(vnm, v);
+                const Principal_curvature<GT> principal_curvature = principal_curvature_from_anisotropic_measures<GT>(
+                    vertex_curvatures.anisotropic_measure,
+                    vertex_curvatures.area_measure,
+                    v_normal
+                    );
+                put(principal_curvature_map, v, principal_curvature);
+            }
+        }
     }
-    put(area_vmm, v, corrected_mu0);
-    put(aniso_vmm, v, corrected_muXY);
-}
+
+
+
+};
 
 } // namespace internal
 
@@ -722,6 +1070,7 @@ template<typename PolygonMesh, typename AreaFaceMeasureMap, typename Anisotropic
 *
 * @see `interpolated_corrected_gaussian_curvature()`
 * @see `interpolated_corrected_principal_curvatures()`
+* @see `interpolated_corrected_curvatures()`
 */
 
 template<typename PolygonMesh, typename VertexCurvatureMap,
@@ -730,44 +1079,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         VertexCurvatureMap vcm,
         const NamedParameters& np = parameters::default_values())
 {
-    using parameters::choose_parameter;
-    using parameters::get_parameter;
-
-    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-    typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type Face_measure_map;
-
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-    typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type Vertex_measure_map;
-
-    typename GT::FT
-        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
-
-    if (r == 0)
-        r = internal::average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
-
-    Face_measure_map mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
-    Face_measure_map mu1_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
-
-    Vertex_measure_map mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
-    Vertex_measure_map mu1_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
-
-    internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
-    internal::interpolated_corrected_measure_mesh(pmesh, mu1_map, internal::MU1_MEAN_CURVATURE_MEASURE, np);
-
-    for (Vertex_descriptor v : vertices(pmesh))
-    {
-        internal::expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu1_map, mu0_expand_map, mu1_expand_map, v, np.ball_radius(r));
-
-        typename GT::FT v_mu0 = get(mu0_expand_map, v);
-        if (v_mu0 != 0.0)
-            put(vcm, v, 0.5 * get(mu1_expand_map, v) / v_mu0);
-        else
-            put(vcm, v, 0);
-    }
+    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, true, false, false, np.vertex_mean_curvature_map(vcm));
 }
 
 /**
@@ -822,6 +1134,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *
 * @see `interpolated_corrected_mean_curvature()`
 * @see `interpolated_corrected_principal_curvatures()`
+* @see `interpolated_corrected_curvatures()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
@@ -829,44 +1142,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         VertexCurvatureMap vcm,
         const NamedParameters& np = parameters::default_values())
 {
-    using parameters::choose_parameter;
-    using parameters::get_parameter;
-
-    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-    typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type Face_measure_map;
-
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-    typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type Vertex_measure_map;
-
-    typename GT::FT
-        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
-
-    if (r == 0)
-        r = internal::average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
-
-    Face_measure_map mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
-    Face_measure_map mu2_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
-
-    Vertex_measure_map mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
-    Vertex_measure_map mu2_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
-
-    internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
-    internal::interpolated_corrected_measure_mesh(pmesh, mu2_map, internal::MU2_GAUSSIAN_CURVATURE_MEASURE, np);
-
-    for (Vertex_descriptor v : vertices(pmesh))
-    {
-        internal::expand_interpolated_corrected_measure_vertex(pmesh, mu0_map, mu2_map, mu0_expand_map, mu2_expand_map, v, np.ball_radius(r));
-
-        typename GT::FT v_mu0 = get(mu0_expand_map, v);
-        if(v_mu0 != 0.0)
-            put(vcm, v, get(mu2_expand_map, v) / v_mu0);
-        else
-            put(vcm, v, 0);
-    }
+    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, false, true, false, np.vertex_gaussian_curvature_map(vcm));
 }
 
 /**
@@ -922,6 +1198,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *
 * @see `interpolated_corrected_mean_curvature()`
 * @see `interpolated_corrected_gaussian_curvature()`
+* @see `interpolated_corrected_curvatures()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
@@ -929,98 +1206,83 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         VertexCurvatureMap vcm,
         const NamedParameters& np = parameters::default_values())
 {
-    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-    typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<typename GT::FT>>::const_type Face_scalar_measure_map;
-    typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<std::array<typename GT::FT, 3 * 3>>>::const_type Face_array_measure_map;
-
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-    typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_vertex_property_t<typename GT::FT>>::const_type Vertex_scalar_measure_map;
-    typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_vertex_property_t<Eigen::Matrix<typename GT::FT, 3, 3>>>::const_type Vertex_matrix_measure_map;
-
-    typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
-    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
-    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
-        NamedParameters,
-        Default_vector_map>::type       VertexNormalMap;
-
-    using parameters::choose_parameter;
-    using parameters::get_parameter;
-    using parameters::is_default_parameter;
-
-    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
-        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-            get_const_property_map(CGAL::vertex_point, pmesh));
-
-    VertexNormalMap vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
-        get(Vector_map_tag(), pmesh));
-
-    typename GT::FT
-        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
-
-    if (r == 0)
-        r = internal::average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
-
-    if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
-        compute_vertex_normals(pmesh, vnm, np);
-
-    Face_scalar_measure_map mu0_map = get(CGAL::dynamic_face_property_t<typename GT::FT>(), pmesh);
-    Face_array_measure_map muXY_map = get(CGAL::dynamic_face_property_t<std::array<typename GT::FT, 3 * 3>>(), pmesh);
-
-    Vertex_scalar_measure_map mu0_expand_map = get(CGAL::dynamic_vertex_property_t<typename GT::FT>(), pmesh);
-    Vertex_matrix_measure_map muXY_expand_map = get(CGAL::dynamic_vertex_property_t<Eigen::Matrix<typename GT::FT, 3, 3>>(), pmesh);
-
-    internal::interpolated_corrected_measure_mesh(pmesh, mu0_map, internal::MU0_AREA_MEASURE, np);
-    internal::interpolated_corrected_anisotropic_measure_mesh(pmesh, muXY_map, np);
+    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, false, false, true, np.vertex_principal_curvature_map(vcm));
+}
 
-    for (Vertex_descriptor v : vertices(pmesh))
+// TODO: DOC
+/**
+* \ingroup PMP_corrected_curvatures_grp
+*
+* Computes the interpolated corrected curvatures across the mesh, based on the provided property maps.
+* By providing mean, gaussian and/or principal curvature property maps, the user
+* can choose which curvatures to compute.
+*
+* @tparam PolygonMesh a model of `FaceListGraph`.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
+*
+* @param pmesh the polygon mesh.
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*
+* \cgalNamedParamsBegin
+*
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+*                    as key type and `%Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_normal_map}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+*                    as key type and `%Vector_3` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+*                     computed using compute_vertex_normals()}
+*   \cgalParamNEnd
+* 
+*   \cgalParamNBegin{ball_radius}
+*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+*                           by summing measures of faces inside a ball of this radius centered at the
+*                           vertex expanded from. The summed face measures are weighted by their
+*                           inclusion ratio inside this ball}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{`-1`}
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+*                     measures on faces around the vertex}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+*
+* @see `interpolated_corrected_mean_curvature()`
+* @see `interpolated_corrected_gaussian_curvature()`
+* @see `interpolated_corrected_principal_curvatures()`
+*/
+template<typename PolygonMesh,
+    typename NamedParameters = parameters::Default_named_parameters>
+    void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
+        bool is_mean_curvature_selected,
+        bool is_gaussian_curvature_selected,
+        bool is_principal_curvature_selected,
+        const NamedParameters& np = parameters::default_values())
+{
+    if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvature_selected)
     {
-        internal::expand_interpolated_corrected_anisotropic_measure_vertex(pmesh, mu0_map, muXY_map, mu0_expand_map, muXY_expand_map, v, np.ball_radius(r));
-
-        typename GT::FT v_mu0 = get(mu0_expand_map, v);
-        Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = get(muXY_expand_map, v);
-
-        typename GT::Vector_3 u_GT = get(vnm, v);
-
-        Eigen::Matrix<typename GT::FT, 3, 1> u(u_GT.x(), u_GT.y(), u_GT.z());
-
-        const typename GT::FT K = 1000 * v_mu0;
-
-        v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
-
-        Eigen::SelfAdjointEigenSolver<Eigen::Matrix <typename GT::FT, 3, 3>> eigensolver;
-
-        eigensolver.computeDirect(v_muXY);
-
-        if (eigensolver.info() != Eigen::Success)
-        {
-            put(vcm, v, std::make_tuple(
-                0,
-                0,
-                typename GT::Vector_3(0, 0, 0),
-                typename GT::Vector_3(0, 0, 0)));
-            continue;
-        }
-
-        const Eigen::Matrix<typename GT::FT, 3, 1> eig_vals = eigensolver.eigenvalues();
-        const Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs = eigensolver.eigenvectors();
-
-        const typename GT::Vector_3 min_eig_vec(eig_vecs(0, 1), eig_vecs(1, 1), eig_vecs(2, 1));
-        const typename GT::Vector_3 max_eig_vec(eig_vecs(0, 0), eig_vecs(1, 0), eig_vecs(2, 0));
-
-        put(vcm, v, std::make_tuple(
-            (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
-            (v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
-            min_eig_vec,
-            max_eig_vec));
+        internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(
+            pmesh,
+            is_mean_curvature_selected,
+            is_gaussian_curvature_selected,
+            is_principal_curvature_selected,
+            np
+            );
     }
 }
 
+
 } // namespace Polygon_mesh_processing
 } // namespace CGAL
 

From 2dcb2939b9011cb3e6fa0b199d1ac226f996a0e8 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 13 Nov 2022 13:32:38 +0200
Subject: [PATCH 0073/1398] compute multiple curvatures at same time + no
 radius handled

---
 ...erpolated_corrected_curvatures_example.cpp |  8 ++
 ...nterpolated_corrected_curvature_measures.h | 83 ++++++++-----------
 2 files changed, 42 insertions(+), 49 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index da6e9d2252f0..a2fd69fff1a7 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -76,6 +76,14 @@ int main(int argc, char* argv[])
       principal_curvature_map
   );
 
+  PMP::interpolated_corrected_curvatures(
+      g1,
+      CGAL::parameters::ball_radius(0)
+      .vertex_mean_curvature_map(mean_curvature_map)
+      .vertex_gaussian_curvature_map(gaussian_curvature_map)
+      .vertex_principal_curvature_map(principal_curvature_map)
+  );
+
   for (vertex_descriptor v : vertices(g1))
   {
     auto PC = principal_curvature_map[v];
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index c4a9154c1aa2..b83bf0e70dff 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -753,6 +753,11 @@ class Interpolated_corrected_curvatures_computer
     typedef typename GT::Point_3 Point_3;
     typedef typename GT::Vector_3 Vector_3;
 
+    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor Edge_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+
     typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
 
     typedef dynamic_vertex_property_t<Vector_3> Vector_map_tag;
@@ -761,29 +766,24 @@ class Interpolated_corrected_curvatures_computer
         NamedParameters,
         Default_vector_map>::type Vertex_normal_map;
 
-    typedef dynamic_vertex_property_t<FT> Scalar_map_tag;
-    typedef typename boost::property_map<PolygonMesh, Scalar_map_tag>::const_type Default_scalar_map;
+    typedef Constant_property_map<Vertex_descriptor, FT> Default_scalar_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_mean_curvature_map_t,
         NamedParameters,
-        Default_scalar_map>::type Vertex_scalar_curvature_map;
+        Default_scalar_map>::type Vertex_mean_curvature_map;
 
-    typedef dynamic_vertex_property_t<Principal_curvature<GT>> Principal_map_tag;
-    typedef typename boost::property_map<PolygonMesh, Principal_map_tag>::const_type Default_principal_map;
+    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_gaussian_curvature_map_t,
+        NamedParameters,
+        Default_scalar_map>::type Vertex_gaussian_curvature_map;
+
+    typedef Constant_property_map<Vertex_descriptor, Principal_curvature<GT>> Default_principal_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvature_map_t,
         NamedParameters,
         Default_principal_map>::type Vertex_principal_curvature_map;
 
-
-
-    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor Edge_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<FT>>::type Face_scalar_measure_map;
+        CGAL::dynamic_face_property_t<FT>>::const_type Face_scalar_measure_map;
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>>::type Face_anisotropic_measure_map;
+        CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>>::const_type Face_anisotropic_measure_map;
 
 private:
     const PolygonMesh& pmesh;
@@ -795,7 +795,8 @@ class Interpolated_corrected_curvatures_computer
     bool is_gaussian_curvature_selected;
     bool is_principal_curvature_selected;
 
-    Vertex_scalar_curvature_map mean_curvature_map, gaussian_curvature_map;
+    Vertex_mean_curvature_map mean_curvature_map;
+    Vertex_gaussian_curvature_map gaussian_curvature_map;
     Vertex_principal_curvature_map principal_curvature_map;
 
     Face_scalar_measure_map mu0_map, mu1_map, mu2_map;
@@ -809,7 +810,7 @@ class Interpolated_corrected_curvatures_computer
 
     }
 
-    void set_named_params(const NamedParameters& np = parameters::default_values())
+    void set_named_params(const NamedParameters& np)
     {
         using parameters::choose_parameter;
         using parameters::get_parameter;
@@ -826,12 +827,15 @@ class Interpolated_corrected_curvatures_computer
 
         const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
 
-        if (is_mean_curvature_selected)
-            mean_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature_map), get(CGAL::dynamic_vertex_property_t<FT>(), pmesh));
-        if (is_gaussian_curvature_selected)
-            gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature_map), get(CGAL::dynamic_vertex_property_t<FT>(), pmesh));
-        if (is_principal_curvature_selected)
-            principal_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvature_map), get(CGAL::dynamic_vertex_property_t<Principal_curvature<GT>>(), pmesh));
+        is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
+        is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
+        is_principal_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvature_map_t>::value;
+
+        mean_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature_map), Default_scalar_map());
+        gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature_map), Default_scalar_map());
+        principal_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvature_map), Default_principal_map());
+
+        std::cout << is_mean_curvature_selected << is_gaussian_curvature_selected << is_principal_curvature_selected << std::endl;
 
         set_ball_radius(radius);
     }
@@ -839,25 +843,18 @@ class Interpolated_corrected_curvatures_computer
     void set_ball_radius(const FT radius) {
         if (radius == 0)
             ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+        else
+            ball_radius = radius;
     }
 
 public:
     
     Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,
-        bool is_mean_curvature_selected,
-        bool is_gaussian_curvature_selected,
-        bool is_principal_curvature_selected,
         const NamedParameters& np = parameters::default_values()
     ) :
-        pmesh(pmesh),
-        is_mean_curvature_selected(is_mean_curvature_selected),
-        is_gaussian_curvature_selected(is_gaussian_curvature_selected),
-        is_principal_curvature_selected(is_principal_curvature_selected)
+        pmesh(pmesh)
     {
-        if (!is_mean_curvature_selected && !is_gaussian_curvature_selected && !is_principal_curvature_selected)
-            return;
-
-        set_named_params();
+        set_named_params(np);
 
         set_property_maps();
 
@@ -1079,7 +1076,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         VertexCurvatureMap vcm,
         const NamedParameters& np = parameters::default_values())
 {
-    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, true, false, false, np.vertex_mean_curvature_map(vcm));
+    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np.vertex_mean_curvature_map(vcm));
 }
 
 /**
@@ -1142,7 +1139,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         VertexCurvatureMap vcm,
         const NamedParameters& np = parameters::default_values())
 {
-    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, false, true, false, np.vertex_gaussian_curvature_map(vcm));
+    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np.vertex_gaussian_curvature_map(vcm));
 }
 
 /**
@@ -1206,7 +1203,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
         VertexCurvatureMap vcm,
         const NamedParameters& np = parameters::default_values())
 {
-    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, false, false, true, np.vertex_principal_curvature_map(vcm));
+    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np.vertex_principal_curvature_map(vcm));
 }
 
 // TODO: DOC
@@ -1265,21 +1262,9 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 template<typename PolygonMesh,
     typename NamedParameters = parameters::Default_named_parameters>
     void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
-        bool is_mean_curvature_selected,
-        bool is_gaussian_curvature_selected,
-        bool is_principal_curvature_selected,
         const NamedParameters& np = parameters::default_values())
 {
-    if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvature_selected)
-    {
-        internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(
-            pmesh,
-            is_mean_curvature_selected,
-            is_gaussian_curvature_selected,
-            is_principal_curvature_selected,
-            np
-            );
-    }
+    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np);
 }
 
 

From dbd18ed101a6e407f05201468bd04c814778f060 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 13 Nov 2022 13:34:18 +0200
Subject: [PATCH 0074/1398] trailing whitespaces

---
 .../interpolated_corrected_curvature_measures.h        | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index b83bf0e70dff..183f823e8483 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -848,7 +848,7 @@ class Interpolated_corrected_curvatures_computer
     }
 
 public:
-    
+
     Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,
         const NamedParameters& np = parameters::default_values()
     ) :
@@ -911,7 +911,7 @@ class Interpolated_corrected_curvatures_computer
                     vertex_curvatures.anisotropic_measure[i] += face_anisotropic_measure[i];
             }
         }
-        
+
         return vertex_curvatures;
     }
 
@@ -981,8 +981,8 @@ class Interpolated_corrected_curvatures_computer
 
         for (Vertex_descriptor v : vertices(pmesh))
         {
-            Vertex_measures<GT> vertex_curvatures = (ball_radius < 0)? 
-                expand_interpolated_corrected_measure_vertex_no_radius(v) : 
+            Vertex_measures<GT> vertex_curvatures = (ball_radius < 0)?
+                expand_interpolated_corrected_measure_vertex_no_radius(v) :
                 expand_interpolated_corrected_measure_vertex(v);
 
             if (is_mean_curvature_selected) {
@@ -1241,7 +1241,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
 *                     computed using compute_vertex_normals()}
 *   \cgalParamNEnd
-* 
+*
 *   \cgalParamNBegin{ball_radius}
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
 *                           by summing measures of faces inside a ball of this radius centered at the

From 2ba66286246b27fba1e71c9258bce0efd7503bf6 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 13 Nov 2022 17:59:01 +0200
Subject: [PATCH 0075/1398] minor fix

---
 ...nterpolated_corrected_curvature_measures.h | 30 ++++++++++---------
 1 file changed, 16 insertions(+), 14 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 183f823e8483..1a0ef9891b00 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -835,8 +835,6 @@ class Interpolated_corrected_curvatures_computer
         gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature_map), Default_scalar_map());
         principal_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvature_map), Default_principal_map());
 
-        std::cout << is_mean_curvature_selected << is_gaussian_curvature_selected << is_principal_curvature_selected << std::endl;
-
         set_ball_radius(radius);
     }
 
@@ -856,12 +854,16 @@ class Interpolated_corrected_curvatures_computer
     {
         set_named_params(np);
 
-        set_property_maps();
-
-        compute_selected_curvatures();
+        if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvature_selected)
+        {
+            set_property_maps();
 
+            compute_selected_curvatures();
+        }
     }
 
+private:
+
     void interpolated_corrected_all_measures_all_faces()
     {
         std::vector<Vector_3> x;
@@ -1073,10 +1075,10 @@ class Interpolated_corrected_curvatures_computer
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
-        VertexCurvatureMap vcm,
-        const NamedParameters& np = parameters::default_values())
+        VertexCurvatureMap& vcm,
+        NamedParameters& np = parameters::default_values())
 {
-    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np.vertex_mean_curvature_map(vcm));
+    interpolated_corrected_curvatures(pmesh, np.vertex_mean_curvature_map(vcm));
 }
 
 /**
@@ -1136,10 +1138,10 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
-        VertexCurvatureMap vcm,
-        const NamedParameters& np = parameters::default_values())
+        VertexCurvatureMap& vcm,
+        NamedParameters& np = parameters::default_values())
 {
-    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np.vertex_gaussian_curvature_map(vcm));
+    interpolated_corrected_curvatures(pmesh, np.vertex_gaussian_curvature_map(vcm));
 }
 
 /**
@@ -1200,10 +1202,10 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 template<typename PolygonMesh, typename VertexCurvatureMap,
     typename NamedParameters = parameters::Default_named_parameters>
     void interpolated_corrected_principal_curvatures(const PolygonMesh& pmesh,
-        VertexCurvatureMap vcm,
-        const NamedParameters& np = parameters::default_values())
+        VertexCurvatureMap& vcm,
+        NamedParameters& np = parameters::default_values())
 {
-    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np.vertex_principal_curvature_map(vcm));
+    interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvature_map(vcm));
 }
 
 // TODO: DOC

From 6ca73315496d290e77c67d5c8c10930801364adc Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 14 Nov 2022 11:26:13 +0200
Subject: [PATCH 0076/1398] fixes, doc, examples, general cleanup

---
 .../PackageDescription.txt                    |   2 +
 .../Polygon_mesh_processing.txt               |  19 +-
 ...erpolated_corrected_curvatures_example.cpp |  68 ++--
 ...orrected_curvatures_polyhedron_example.cpp |  61 ++--
 ...nterpolated_corrected_curvature_measures.h | 343 +++---------------
 5 files changed, 136 insertions(+), 357 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index eae47c610011..93f25c89f1fb 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -204,6 +204,8 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
+- `CGAL::Polygon_mesh_processing::Principal_curvature`
 
 \cgalCRPSection{Normal Computation Functions}
 - `CGAL::Polygon_mesh_processing::compute_face_normal()`
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 8f222497a527..7932051ec000 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -879,7 +879,10 @@ not provide storage for the normals.
 ****************************************
 \section PMPICC Computing Curvatures
 
-This package provides methods to compute curvatures on polygonal meshes based on #PAPER#.
+This package provides methods to compute curvatures on polygonal meshes based on
+<a href="https://perso.liris.cnrs.fr/david.coeurjolly/publication/lachaud2020/">
+  Interpolated corrected curvature measures for polygonal surfaces
+</a>.
 This includes mean curvature, gaussian curvature, principal curvatures and directions.
 These can be computed on triangle meshes, quad meshes, and meshes with n-gon faces.
 The algorithms used prove to work well in general. Also, on meshes with noise
@@ -893,25 +896,29 @@ These computations are performed using :
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
+
+Where it is recommended to use the last function for computing multiple curvatures (example: mean and gaussian)
+as the implementation performs the shared computations only once, making it more efficient.
 
 \cgalFigureRef{icc_diff_radius} shows how the mean curvature changes depending on
 the ball_radius named parameter which can be set to a value > 0 to get a smoother
-distribution of valuesa and "diffuse" the extreme values of curvatures across the mesh.
+distribution of values and "diffuse" the extreme values of curvatures across the mesh.
 
 \cgalFigureAnchor{icc_diff_radius}
 <center>
 <img src="icc_diff_radius.png" style="max-width:90%;"/>
 </center>
 \cgalFigureCaptionBegin{icc_diff_radius}
-The mean curvature distrubution on a bear mesh with different values for the expanding ball radius
+The mean curvature distribution on a bear mesh with different values for the expanding ball radius
 \cgalFigureCaptionEnd
 
 Property maps are used to record the computed curvatures as shown in examples.
 
 \subsection ICCExample Interpolated Corrected Curvature Examples
 
-Property maps are an API introduced in the boost library that allows to
-associate values to keys. In the following examples, for each proberty map, we associate
+Property maps are an API introduced in the boost library that allows associating
+values to keys. In the following examples, for each property map, we associate
 a curvature value to each vertex.
 
 \subsubsection ICCExampleSM Interpolated Corrected Curvature on a Surface Mesh.
@@ -926,7 +933,7 @@ and store them in property maps provided by the class `Surface_mesh`.
 
 The following example illustrates how to
 compute the curvatures on vertices
-and store them in unordered (or ordered) maps as the class `Polyhedron_3` does
+and store them in dynamic property maps as the class `Polyhedron_3` does
 not provide storage for the curvatures.
 
 \cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp}
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index a2fd69fff1a7..ffb86d94795c 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -10,19 +10,19 @@
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_Kernel;
-typedef CGAL::Surface_mesh<Epic_Kernel::Point_3> Surface_Mesh;
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
+typedef CGAL::Surface_mesh<Epic_kernel::Point_3> Surface_Mesh;
 typedef boost::graph_traits<Surface_Mesh>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Surface_Mesh>::vertex_descriptor vertex_descriptor;
 
 int main(int argc, char* argv[])
 {
-  Surface_Mesh g1;
+  Surface_Mesh smesh;
   const std::string filename = (argc>1) ?
       argv[1] :
       CGAL::data_file_path("meshes/small_bunny.obj");
 
-  if(!CGAL::IO::read_polygon_mesh(filename, g1))
+  if(!CGAL::IO::read_polygon_mesh(filename, smesh))
   {
     std::cerr << "Invalid input file." << std::endl;
     return EXIT_FAILURE;
@@ -30,65 +30,67 @@ int main(int argc, char* argv[])
 
   // creating and tying surface mesh property maps for curvatures (with defaults = 0)
   bool created = false;
-  Surface_Mesh::Property_map<vertex_descriptor, Epic_Kernel::FT> mean_curvature_map, gaussian_curvature_map;
-  boost::tie(mean_curvature_map, created) = g1.add_property_map<vertex_descriptor, Epic_Kernel::FT>("v:mean_curvature_map", 0);
+  Surface_Mesh::Property_map<vertex_descriptor, Epic_kernel::FT> mean_curvature_map, gaussian_curvature_map;
+  boost::tie(mean_curvature_map, created) = smesh.add_property_map<vertex_descriptor, Epic_kernel::FT>("v:mean_curvature_map", 0);
   assert(created);
 
-  boost::tie(gaussian_curvature_map, created) = g1.add_property_map<vertex_descriptor, Epic_Kernel::FT>("v:gaussian_curvature_map", 0);
+  boost::tie(gaussian_curvature_map, created) = smesh.add_property_map<vertex_descriptor, Epic_kernel::FT>("v:gaussian_curvature_map", 0);
   assert(created);
 
   // we use a tuple of 2 scalar values and 2 vectors for principal curvatures and directions
-  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvature<Epic_Kernel>> principal_curvature_map;
+  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvature<Epic_kernel>> principal_curvature_map;
 
-  boost::tie(principal_curvature_map, created) = g1.add_property_map<vertex_descriptor, PMP::Principal_curvature<Epic_Kernel>>
+  boost::tie(principal_curvature_map, created) = smesh.add_property_map<vertex_descriptor, PMP::Principal_curvature<Epic_kernel>>
       ("v:principal_curvature_map", { 0, 0,
-          Epic_Kernel::Vector_3 (0,0,0),
-          Epic_Kernel::Vector_3 (0,0,0)});
+          Epic_kernel::Vector_3(0,0,0),
+          Epic_kernel::Vector_3(0,0,0) });
   assert(created);
 
+  // user can call these fucntions to compute a specfic curvature type on each vertex.
   PMP::interpolated_corrected_mean_curvature(
-      g1,
+      smesh,
       mean_curvature_map
   );
 
+  PMP::interpolated_corrected_gaussian_curvature(
+      smesh,
+      gaussian_curvature_map
+  );
+
+  PMP::interpolated_corrected_principal_curvatures(
+      smesh,
+      principal_curvature_map
+  );
+
   // uncomment this to compute a curvature while specifying named parameters
   // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)
 
-  /*Surface_Mesh::Property_map<vertex_descriptor, Epic_Kernel::Vector_3> vnm;
-  boost::tie(vnm, created) = g1.add_property_map<vertex_descriptor, Epic_Kernel::Vector_3>(
-      "v:vnm", Epic_Kernel::Vector_3(0, 0, 0)
+  /*Surface_Mesh::Property_map<vertex_descriptor, Epic_kernel::Vector_3> vnm;
+  boost::tie(vnm, created) = smesh.add_property_map<vertex_descriptor, Epic_kernel::Vector_3>(
+      "v:vnm", Epic_kernel::Vector_3(0, 0, 0)
   );
 
   assert(created);
 
   PMP::interpolated_corrected_mean_curvature(
-      g1,
+      smesh,
       mean_curvature_map,
       CGAL::parameters::ball_radius(0.5).vertex_normal_map(vnm)
   );*/
 
-  PMP::interpolated_corrected_gaussian_curvature(
-      g1,
-      gaussian_curvature_map
-  );
-  PMP::interpolated_corrected_principal_curvatures(
-      g1,
-      principal_curvature_map
-  );
-
+  // This function can be used to compute multiple curvature types by specifiying them as named parameters
+  // This is more efficient than computing each one separately (shared computations).
   PMP::interpolated_corrected_curvatures(
-      g1,
-      CGAL::parameters::ball_radius(0)
-      .vertex_mean_curvature_map(mean_curvature_map)
-      .vertex_gaussian_curvature_map(gaussian_curvature_map)
+      smesh,
+      CGAL::parameters::vertex_mean_curvature_map(mean_curvature_map)
       .vertex_principal_curvature_map(principal_curvature_map)
   );
 
-  for (vertex_descriptor v : vertices(g1))
+  for (vertex_descriptor v : vertices(smesh))
   {
     auto PC = principal_curvature_map[v];
-      std::cout << v.idx() << ": HC = " << mean_curvature_map[v]
-                           << ", GC = " << gaussian_curvature_map[v] << "\n"
-                           << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
+    std::cout << v.idx() << ": HC = " << mean_curvature_map[v]
+                         << ", GC = " << gaussian_curvature_map[v] << "\n"
+                         << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
   }
 }
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
index 43aff72dec2b..207625fd8485 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
@@ -11,35 +11,43 @@
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_Kernel;
-typedef CGAL::Polyhedron_3<Epic_Kernel> Polyhedron;
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
+typedef CGAL::Polyhedron_3<Epic_kernel> Polyhedron;
 typedef boost::graph_traits<Polyhedron>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Polyhedron>::vertex_descriptor vertex_descriptor;
 
 int main(int argc, char* argv[])
 {
-  Polyhedron g1;
+  Polyhedron polyhedron;
   const std::string filename = (argc>1) ?
       argv[1] :
       CGAL::data_file_path("meshes/small_bunny.obj");
 
-  if(!CGAL::IO::read_polygon_mesh(filename, g1))
+  if(!CGAL::IO::read_polygon_mesh(filename, polyhedron))
   {
     std::cerr << "Invalid input file." << std::endl;
     return EXIT_FAILURE;
   }
 
-  std::unordered_map<vertex_descriptor, Epic_Kernel::FT> mean_curvature_map, gaussian_curvature_map;
-  std::unordered_map<vertex_descriptor, std::tuple<
-      Epic_Kernel::FT,
-      Epic_Kernel::FT,
-      Epic_Kernel::Vector_3,
-      Epic_Kernel::Vector_3
-      >> principal_curvature_map;
+  boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
+      mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron),
+      gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
+  boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<PMP::Principal_curvature<Epic_kernel>>>::type
+      principal_curvature_map = get(CGAL::dynamic_vertex_property_t< PMP::Principal_curvature<Epic_kernel>>(), polyhedron);
 
   PMP::interpolated_corrected_mean_curvature(
-      g1,
-      boost::make_assoc_property_map(mean_curvature_map)
+      polyhedron,
+      mean_curvature_map
+  );
+
+  PMP::interpolated_corrected_gaussian_curvature(
+      polyhedron,
+      gaussian_curvature_map
+  );
+
+  PMP::interpolated_corrected_principal_curvatures(
+      polyhedron,
+      principal_curvature_map
   );
 
   // uncomment this to compute a curvature while specifying named parameters
@@ -48,27 +56,26 @@ int main(int argc, char* argv[])
   /*std::unordered_map<vertex_descriptor, Epic_Kernel::Vector_3> vnm;
 
   PMP::interpolated_corrected_mean_curvature(
-      g1,
-      boost::make_assoc_property_map(mean_curvature_map),
+      polyhedron,
+      mean_curvature_map,
       CGAL::parameters::ball_radius(0.5).vertex_normal_map(boost::make_assoc_property_map(vnm))
   );*/
 
-  PMP::interpolated_corrected_gaussian_curvature(
-      g1,
-      boost::make_assoc_property_map(gaussian_curvature_map)
-  );
-  PMP::interpolated_corrected_principal_curvatures(
-      g1,
-      boost::make_assoc_property_map(principal_curvature_map)
+  // This function can be used to compute multiple curvature types by specifiying them as named parameters
+  // This is more efficient than computing each one separately (shared computations).
+  PMP::interpolated_corrected_curvatures(
+      polyhedron,
+      CGAL::parameters::vertex_mean_curvature_map(mean_curvature_map)
+      .vertex_principal_curvature_map(principal_curvature_map)
   );
 
   int i = 0;
-  for (vertex_descriptor v : vertices(g1))
+  for (vertex_descriptor v : vertices(polyhedron))
   {
-    auto PC = principal_curvature_map[v];
-      std::cout << i << ": HC = " << mean_curvature_map[v]
-                     << ", GC = " << gaussian_curvature_map[v] << "\n"
-                     << ", PC = [ " << std::get<0>(PC) << " , " << std::get<1>(PC) << " ]\n";
+    auto PC = get(principal_curvature_map, v);
+    std::cout << i << ": HC = " << get(mean_curvature_map, v)
+                   << ", GC = " << get(gaussian_curvature_map, v) << "\n"
+                   << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
     i++;
   }
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 1a0ef9891b00..0ed47db00584 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -35,11 +35,26 @@ namespace CGAL {
 
 namespace Polygon_mesh_processing {
 
+/**
+* \ingroup PMP_corrected_curvatures_grp
+* 
+* \brief a struct for storing principal curvatures and directions.
+*
+* @tparam GT is the geometric traits class.
+*/
 template<typename GT>
 struct Principal_curvature {
+    
+    /// min curvature magnitude
     typename GT::FT min_curvature;
+
+    /// max curvature magnitude
     typename GT::FT max_curvature;
+
+    /// min curvature direction vector
     typename GT::Vector_3 min_direction;
+
+    /// max curvature direction vector
     typename GT::Vector_3 max_direction;
 
     Principal_curvature() {
@@ -373,138 +388,13 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
     return muXY;
 }
 
-//template<typename PolygonMesh, typename FaceMeasureMap,
-//    typename NamedParameters = parameters::Default_named_parameters>
-//    void
-//    interpolated_corrected_measure_mesh(const PolygonMesh& pmesh,
-//                                        FaceMeasureMap fmm,
-//                                        const Curvature_measure_index mu_i,
-//                                        const NamedParameters& np = parameters::default_values())
-//{
-//
-//    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-//
-//    typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
-//    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
-//    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
-//        NamedParameters,
-//        Default_vector_map>::type       Vertex_normal_map;
-//
-//    using parameters::choose_parameter;
-//    using parameters::get_parameter;
-//    using parameters::is_default_parameter;
-//
-//    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-//    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-//    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
-//
-//    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
-//        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-//            get_const_property_map(CGAL::vertex_point, pmesh));
-//
-//    Vertex_normal_map vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
-//                               get(Vector_map_tag(), pmesh));
-//
-//    if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
-//        compute_vertex_normals(pmesh, vnm, np);
-//
-//    std::function
-//        <typename GT::FT(const std::vector<typename GT::Vector_3>&, const std::vector<typename GT::Vector_3>&)>
-//        iccm_function;
-//    switch (mu_i)
-//    {
-//    case MU0_AREA_MEASURE:
-//        iccm_function = &interpolated_corrected_area_measure_face<GT>;
-//        break;
-//    case MU1_MEAN_CURVATURE_MEASURE:
-//        iccm_function = &interpolated_corrected_mean_curvature_measure_face<GT>;
-//        break;
-//    case MU2_GAUSSIAN_CURVATURE_MEASURE:
-//        iccm_function = &interpolated_corrected_gaussian_curvature_measure_face<GT>;
-//        break;
-//    }
-//
-//    std::vector<typename GT::Vector_3> x;
-//    std::vector<typename GT::Vector_3> u;
-//
-//    for (Face_descriptor f : faces(pmesh))
-//    {
-//
-//        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
-//        {
-//            typename GT::Point_3 p = get(vpm, v);
-//            x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
-//            u.push_back(get(vnm, v));
-//        }
-//
-//        put(fmm, f, iccm_function(u, x));
-//        x.clear();
-//        u.clear();
-//    }
-//}
-//
-//template<typename PolygonMesh, typename FaceMeasureMap,
-//    typename NamedParameters = parameters::Default_named_parameters>
-//    void
-//    interpolated_corrected_anisotropic_measure_mesh(const PolygonMesh& pmesh,
-//        FaceMeasureMap fmm,
-//        const NamedParameters& np = parameters::default_values())
-//{
-//
-//    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-//
-//    typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
-//    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
-//    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
-//        NamedParameters,
-//        Default_vector_map>::type       VertexNormalMap;
-//
-//    using parameters::choose_parameter;
-//    using parameters::get_parameter;
-//    using parameters::is_default_parameter;
-//
-//    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-//    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-//    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
-//
-//    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
-//        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-//            get_const_property_map(CGAL::vertex_point, pmesh));
-//
-//    VertexNormalMap vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
-//        get(Vector_map_tag(), pmesh));
-//
-//    if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
-//        compute_vertex_normals(pmesh, vnm, np);
-//
-//    std::vector<typename GT::Vector_3> x;
-//    std::vector<typename GT::Vector_3> u;
-//
-//    for (Face_descriptor f : faces(pmesh))
-//    {
-//
-//        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
-//        {
-//            typename GT::Point_3 p = get(vpm, v);
-//            x.push_back(typename GT::Vector_3(p.x(), p.y(), p.z()));
-//            u.push_back(get(vnm, v));
-//        }
-//
-//        put(fmm, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
-//        x.clear();
-//        u.clear();
-//
-//    }
-//}
-
-//
 //template<typename GT>
-//typename GT::FT triangle_in_ball_ratio_1(const typename GT::Vector_3 x1,
-//                                         const typename GT::Vector_3 x2,
-//                                         const typename GT::Vector_3 x3,
-//                                         const typename GT::FT r,
-//                                         const typename GT::Vector_3 c,
-//                                         const std::size_t res = 3)
+//typename GT::FT triangle_in_ball_ratio(const typename GT::Vector_3 x1,
+//                                       const typename GT::Vector_3 x2,
+//                                       const typename GT::Vector_3 x3,
+//                                       const typename GT::FT r,
+//                                       const typename GT::Vector_3 c,
+//                                       const std::size_t res = 3)
 //{
 //    const typename GT::FT R = r * r;
 //    const typename GT::FT acc = 1.0 / res;
@@ -549,162 +439,6 @@ typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
     return (r - d_min) / (d_max - d_min);
 }
 
-//template<typename PolygonMesh, typename FaceMeasureMap, typename VertexMeasureMap,
-//    typename NamedParameters = parameters::Default_named_parameters>
-//    void expand_interpolated_corrected_measure_vertex(const PolygonMesh& pmesh,
-//        FaceMeasureMap area_fmm,
-//        FaceMeasureMap curvature_fmm,
-//        VertexMeasureMap area_vmm,
-//        VertexMeasureMap curvature_vmm,
-//        const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-//        const NamedParameters& np = parameters::default_values())
-//{
-//    using parameters::choose_parameter;
-//    using parameters::get_parameter;
-//
-//    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-//
-//    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-//    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-//
-//    const typename GT::FT
-//        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
-//
-//    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
-//        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-//            get_const_property_map(CGAL::vertex_point, pmesh));
-//
-//
-//    std::queue<Face_descriptor> bfs_queue;
-//    std::unordered_set<Face_descriptor> bfs_visited;
-//
-//    typename GT::Point_3 vp = get(vpm, v);
-//    typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
-//
-//    typename GT::FT corrected_mu0 = 0;
-//    typename GT::FT corrected_mui = 0;
-//
-//    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-//        if (f != boost::graph_traits<PolygonMesh>::null_face())
-//        {
-//            bfs_queue.push(f);
-//            bfs_visited.insert(f);
-//        }
-//    }
-//    while (!bfs_queue.empty()) {
-//        Face_descriptor fi = bfs_queue.front();
-//        bfs_queue.pop();
-//
-//        // looping over vertices in face to get point coordinates
-//        std::vector<typename GT::Vector_3> x;
-//        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
-//        {
-//            typename GT::Point_3 pi = get(vpm, vi);
-//            x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
-//        }
-//
-//        const typename GT::FT f_ratio = face_in_ball_ratio<GT>(x, r, c);
-//
-//        if (f_ratio != 0.0)
-//        {
-//            corrected_mu0 += f_ratio * get(area_fmm, fi);
-//            corrected_mui += f_ratio * get(curvature_fmm, fi);
-//            for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
-//            {
-//                if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
-//                {
-//                    bfs_queue.push(fj);
-//                    bfs_visited.insert(fj);
-//                }
-//            }
-//        }
-//    }
-//    put(area_vmm, v, corrected_mu0);
-//    put(curvature_vmm, v, corrected_mui);
-//}
-//
-//template<typename PolygonMesh, typename AreaFaceMeasureMap, typename AnisotropicFaceMeasureMap,
-//    typename AreaVertexMeasureMap, typename AnisotropicVertexMeasureMap,
-//    typename NamedParameters = parameters::Default_named_parameters>
-//    void expand_interpolated_corrected_anisotropic_measure_vertex(const PolygonMesh& pmesh,
-//        AreaFaceMeasureMap area_fmm,
-//        AnisotropicFaceMeasureMap aniso_fmm,
-//        AreaVertexMeasureMap area_vmm,
-//        AnisotropicVertexMeasureMap aniso_vmm,
-//        const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-//        const NamedParameters& np = parameters::default_values())
-//{
-//    using parameters::choose_parameter;
-//    using parameters::get_parameter;
-//
-//    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-//
-//    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-//    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-//
-//    const typename GT::FT
-//        r = choose_parameter(get_parameter(np, internal_np::ball_radius), 0);
-//
-//    typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type
-//        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-//            get_const_property_map(CGAL::vertex_point, pmesh));
-//
-//
-//    std::queue<Face_descriptor> bfs_queue;
-//    std::unordered_set<Face_descriptor> bfs_visited;
-//
-//    typename GT::Point_3 vp = get(vpm, v);
-//    typename GT::Vector_3 c = typename GT::Vector_3(vp.x(), vp.y(), vp.z());
-//
-//    typename GT::FT corrected_mu0 = 0;
-//    Eigen::Matrix<typename GT::FT, 3, 3> corrected_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
-//
-//    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-//        if (f != boost::graph_traits<PolygonMesh>::null_face())
-//        {
-//            bfs_queue.push(f);
-//            bfs_visited.insert(f);
-//        }
-//    }
-//    while (!bfs_queue.empty()) {
-//        Face_descriptor fi = bfs_queue.front();
-//        bfs_queue.pop();
-//
-//        // looping over vertices in face to get point coordinates
-//        std::vector<typename GT::Vector_3> x;
-//        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
-//        {
-//            typename GT::Point_3 pi = get(vpm, vi);
-//            x.push_back(typename GT::Vector_3(pi.x(), pi.y(), pi.z()));
-//        }
-//
-//        const typename GT::FT f_ratio = face_in_ball_ratio<GT>(x, r, c);
-//
-//        if (f_ratio != 0.0)
-//        {
-//            corrected_mu0 += f_ratio * get(area_fmm, fi);
-//
-//            std::array<typename GT::FT, 3 * 3> muXY_face = get(aniso_fmm, fi);
-//
-//            for (std::size_t ix = 0; ix < 3; ix++)
-//                for (std::size_t iy = 0; iy < 3; iy++)
-//                    corrected_muXY(ix, iy) += f_ratio * muXY_face[ix * 3 + iy];
-//
-//            for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
-//            {
-//                if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
-//                {
-//                    bfs_queue.push(fj);
-//                    bfs_visited.insert(fj);
-//                }
-//            }
-//        }
-//    }
-//    put(area_vmm, v, corrected_mu0);
-//    put(aniso_vmm, v, corrected_muXY);
-//}
-
-
 template<typename GT>
 Principal_curvature<GT> principal_curvature_from_anisotropic_measures(
     const std::array<typename GT::FT, 3 * 3> anisotropic_measure,
@@ -1208,12 +942,11 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
     interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvature_map(vcm));
 }
 
-// TODO: DOC
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
 * Computes the interpolated corrected curvatures across the mesh, based on the provided property maps.
-* By providing mean, gaussian and/or principal curvature property maps, the user
+* By providing mean, gaussian and/or principal curvature property maps as named parameters, the user
 * can choose which curvatures to compute.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
@@ -1243,15 +976,43 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
 *                     computed using compute_vertex_normals()}
 *   \cgalParamNEnd
+* 
+*   \cgalParamNBegin{vertex_mean_curvature_map}
+*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `WritablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+*                    as key type and `%FT` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, mean curvatures won't be computed}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_gaussian_curvature_map}
+*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `WritablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+*                    as key type and `%FT` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, gaussian curvatures won't be computed}
+*   \cgalParamNEnd
+* 
+*
+*   \cgalParamNBegin{vertex_prinicipal_curvature_map}
+*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `WritablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+*                    as key type and `%Principal_curvature` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<Principal_curvature<GT>>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, mean principal won't be computed}
+*   \cgalParamNEnd
 *
 *   \cgalParamNBegin{ball_radius}
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
 *                           by summing measures of faces inside a ball of this radius centered at the
 *                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball}
+*                           inclusion ratio inside this ball.}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
 *                     measures on faces around the vertex}
 *   \cgalParamNEnd
 *

From 59c3605a0689e20a54a8998d9ed3296fd8862cbb Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 14 Nov 2022 11:28:37 +0200
Subject: [PATCH 0077/1398] trailing whitespace

---
 .../interpolated_corrected_curvature_measures.h           | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 0ed47db00584..5bcff27cc2ee 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -37,14 +37,14 @@ namespace Polygon_mesh_processing {
 
 /**
 * \ingroup PMP_corrected_curvatures_grp
-* 
+*
 * \brief a struct for storing principal curvatures and directions.
 *
 * @tparam GT is the geometric traits class.
 */
 template<typename GT>
 struct Principal_curvature {
-    
+
     /// min curvature magnitude
     typename GT::FT min_curvature;
 
@@ -976,7 +976,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
 *                     computed using compute_vertex_normals()}
 *   \cgalParamNEnd
-* 
+*
 *   \cgalParamNBegin{vertex_mean_curvature_map}
 *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
@@ -994,7 +994,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, gaussian curvatures won't be computed}
 *   \cgalParamNEnd
-* 
+*
 *
 *   \cgalParamNBegin{vertex_prinicipal_curvature_map}
 *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}

From b0a82c4569c6f9483ed45f76f2224f9b9212fad8 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 14 Nov 2022 11:37:14 +0200
Subject: [PATCH 0078/1398] typo fix

---
 .../Curvatures/interpolated_corrected_curvature_measures.h      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 5bcff27cc2ee..9da751c7f83b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -996,7 +996,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *   \cgalParamNEnd
 *
 *
-*   \cgalParamNBegin{vertex_prinicipal_curvature_map}
+*   \cgalParamNBegin{vertex_principal_curvature_map}
 *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`

From 25eb94f1ec4996a46ec443888e768ff3e9ba6dd3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 14 Nov 2022 14:24:24 +0100
Subject: [PATCH 0079/1398] force copy fig

---
 .../doc/Polygon_mesh_processing/Doxyfile.in                    | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
index fa3b8b8f1bf5..f2e738b4d23c 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
@@ -21,4 +21,5 @@ EXCLUDE_SYMBOLS += experimental
 
 HTML_EXTRA_FILES           = ${CGAL_PACKAGE_DOC_DIR}/fig/selfintersections.jpg \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/mesh_smoothing.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/shape_smoothing.png
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/shape_smoothing.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/icc_diff_radius.png

From b56500d0fc8edbf4971c367bfbde6a9d2dd1a915 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 16 Nov 2022 12:51:14 +0200
Subject: [PATCH 0080/1398] 4-space -> 2-space indents

---
 ...erpolated_corrected_curvatures_example.cpp |  36 +-
 ...orrected_curvatures_polyhedron_example.cpp |  26 +-
 ...nterpolated_corrected_curvature_measures.h | 920 +++++++++---------
 ...est_interopolated_corrected_curvatures.cpp | 226 ++---
 .../Display/Display_property_plugin.cpp       | 214 ++--
 5 files changed, 708 insertions(+), 714 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index ffb86d94795c..7bf182c3ce3d 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -18,11 +18,11 @@ typedef boost::graph_traits<Surface_Mesh>::vertex_descriptor vertex_descriptor;
 int main(int argc, char* argv[])
 {
   Surface_Mesh smesh;
-  const std::string filename = (argc>1) ?
-      argv[1] :
-      CGAL::data_file_path("meshes/small_bunny.obj");
+  const std::string filename = (argc > 1) ?
+    argv[1] :
+    CGAL::data_file_path("meshes/small_bunny.obj");
 
-  if(!CGAL::IO::read_polygon_mesh(filename, smesh))
+  if (!CGAL::IO::read_polygon_mesh(filename, smesh))
   {
     std::cerr << "Invalid input file." << std::endl;
     return EXIT_FAILURE;
@@ -41,25 +41,25 @@ int main(int argc, char* argv[])
   Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvature<Epic_kernel>> principal_curvature_map;
 
   boost::tie(principal_curvature_map, created) = smesh.add_property_map<vertex_descriptor, PMP::Principal_curvature<Epic_kernel>>
-      ("v:principal_curvature_map", { 0, 0,
-          Epic_kernel::Vector_3(0,0,0),
-          Epic_kernel::Vector_3(0,0,0) });
+    ("v:principal_curvature_map", { 0, 0,
+        Epic_kernel::Vector_3(0,0,0),
+        Epic_kernel::Vector_3(0,0,0) });
   assert(created);
 
   // user can call these fucntions to compute a specfic curvature type on each vertex.
   PMP::interpolated_corrected_mean_curvature(
-      smesh,
-      mean_curvature_map
+    smesh,
+    mean_curvature_map
   );
 
   PMP::interpolated_corrected_gaussian_curvature(
-      smesh,
-      gaussian_curvature_map
+    smesh,
+    gaussian_curvature_map
   );
 
   PMP::interpolated_corrected_principal_curvatures(
-      smesh,
-      principal_curvature_map
+    smesh,
+    principal_curvature_map
   );
 
   // uncomment this to compute a curvature while specifying named parameters
@@ -81,16 +81,16 @@ int main(int argc, char* argv[])
   // This function can be used to compute multiple curvature types by specifiying them as named parameters
   // This is more efficient than computing each one separately (shared computations).
   PMP::interpolated_corrected_curvatures(
-      smesh,
-      CGAL::parameters::vertex_mean_curvature_map(mean_curvature_map)
-      .vertex_principal_curvature_map(principal_curvature_map)
+    smesh,
+    CGAL::parameters::vertex_mean_curvature_map(mean_curvature_map)
+    .vertex_principal_curvature_map(principal_curvature_map)
   );
 
   for (vertex_descriptor v : vertices(smesh))
   {
     auto PC = principal_curvature_map[v];
     std::cout << v.idx() << ": HC = " << mean_curvature_map[v]
-                         << ", GC = " << gaussian_curvature_map[v] << "\n"
-                         << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
+      << ", GC = " << gaussian_curvature_map[v] << "\n"
+      << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
   }
 }
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
index 207625fd8485..929fc8d96a67 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
@@ -16,14 +16,12 @@ typedef CGAL::Polyhedron_3<Epic_kernel> Polyhedron;
 typedef boost::graph_traits<Polyhedron>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Polyhedron>::vertex_descriptor vertex_descriptor;
 
-int main(int argc, char* argv[])
+int main(int argc, char *argv[])
 {
   Polyhedron polyhedron;
-  const std::string filename = (argc>1) ?
-      argv[1] :
-      CGAL::data_file_path("meshes/small_bunny.obj");
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/small_bunny.obj");
 
-  if(!CGAL::IO::read_polygon_mesh(filename, polyhedron))
+  if (!CGAL::IO::read_polygon_mesh(filename, polyhedron))
   {
     std::cerr << "Invalid input file." << std::endl;
     return EXIT_FAILURE;
@@ -33,22 +31,19 @@ int main(int argc, char* argv[])
       mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron),
       gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
   boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<PMP::Principal_curvature<Epic_kernel>>>::type
-      principal_curvature_map = get(CGAL::dynamic_vertex_property_t< PMP::Principal_curvature<Epic_kernel>>(), polyhedron);
+      principal_curvature_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvature<Epic_kernel>>(), polyhedron);
 
   PMP::interpolated_corrected_mean_curvature(
       polyhedron,
-      mean_curvature_map
-  );
+      mean_curvature_map);
 
   PMP::interpolated_corrected_gaussian_curvature(
       polyhedron,
-      gaussian_curvature_map
-  );
+      gaussian_curvature_map);
 
   PMP::interpolated_corrected_principal_curvatures(
       polyhedron,
-      principal_curvature_map
-  );
+      principal_curvature_map);
 
   // uncomment this to compute a curvature while specifying named parameters
   // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)
@@ -66,16 +61,15 @@ int main(int argc, char* argv[])
   PMP::interpolated_corrected_curvatures(
       polyhedron,
       CGAL::parameters::vertex_mean_curvature_map(mean_curvature_map)
-      .vertex_principal_curvature_map(principal_curvature_map)
-  );
+          .vertex_principal_curvature_map(principal_curvature_map));
 
   int i = 0;
   for (vertex_descriptor v : vertices(polyhedron))
   {
     auto PC = get(principal_curvature_map, v);
     std::cout << i << ": HC = " << get(mean_curvature_map, v)
-                   << ", GC = " << get(gaussian_curvature_map, v) << "\n"
-                   << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
+              << ", GC = " << get(gaussian_curvature_map, v) << "\n"
+              << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
     i++;
   }
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 9da751c7f83b..4006b761679f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -45,74 +45,74 @@ namespace Polygon_mesh_processing {
 template<typename GT>
 struct Principal_curvature {
 
-    /// min curvature magnitude
-    typename GT::FT min_curvature;
-
-    /// max curvature magnitude
-    typename GT::FT max_curvature;
-
-    /// min curvature direction vector
-    typename GT::Vector_3 min_direction;
-
-    /// max curvature direction vector
-    typename GT::Vector_3 max_direction;
-
-    Principal_curvature() {
-        min_curvature = 0;
-        max_curvature = 0;
-        min_direction = typename GT::Vector_3(0, 0, 0);
-        max_direction = typename GT::Vector_3(0, 0, 0);
-    }
-
-    Principal_curvature(
-        typename GT::FT min_curvature,
-        typename GT::FT max_curvature,
-        typename GT::Vector_3 min_direction,
-        typename GT::Vector_3 max_direction) {
-        this->min_curvature = min_curvature;
-        this->max_curvature = max_curvature;
-        this->min_direction = min_direction;
-        this->max_direction = max_direction;
-    }
+  /// min curvature magnitude
+  typename GT::FT min_curvature;
+
+  /// max curvature magnitude
+  typename GT::FT max_curvature;
+
+  /// min curvature direction vector
+  typename GT::Vector_3 min_direction;
+
+  /// max curvature direction vector
+  typename GT::Vector_3 max_direction;
+
+  Principal_curvature() {
+    min_curvature = 0;
+    max_curvature = 0;
+    min_direction = typename GT::Vector_3(0, 0, 0);
+    max_direction = typename GT::Vector_3(0, 0, 0);
+  }
+
+  Principal_curvature(
+    typename GT::FT min_curvature,
+    typename GT::FT max_curvature,
+    typename GT::Vector_3 min_direction,
+    typename GT::Vector_3 max_direction
+  ) {
+    min_curvature = min_curvature;
+    max_curvature = max_curvature;
+    min_direction = min_direction;
+    max_direction = max_direction;
+  }
 };
 
 namespace internal {
 
-template<typename PolygonMesh, typename GT>
-typename GT::FT average_edge_length(const PolygonMesh& pmesh)
-{
+  template<typename PolygonMesh, typename GT>
+  typename GT::FT average_edge_length(const PolygonMesh& pmesh) {
     const std::size_t n = edges(pmesh).size();
     if (n == 0)
-        return 0;
+      return 0;
 
     typename GT::FT avg_edge_length = 0;
     for (auto e : edges(pmesh))
-        avg_edge_length += edge_length(e, pmesh);
+      avg_edge_length += edge_length(e, pmesh);
 
     avg_edge_length /= n;
     return avg_edge_length;
-}
+  }
 
-enum Curvature_measure_index {
+  enum Curvature_measure_index {
     MU0_AREA_MEASURE, ///< corrected area density
     MU1_MEAN_CURVATURE_MEASURE, ///< corrected mean curvature density
     MU2_GAUSSIAN_CURVATURE_MEASURE ///< corrected gaussian curvature density
-};
+  };
 
-template<typename GT>
-struct Vertex_measures {
+  template<typename GT>
+  struct Vertex_measures {
     typename GT::FT area_measure = 0;
     typename GT::FT mean_curvature_measure = 0;
     typename GT::FT gaussian_curvature_measure = 0;
     std::array<typename GT::FT, 3 * 3> anisotropic_measure = { 0, 0, 0,
                                                                0, 0, 0,
                                                                0, 0, 0 };
-};
+  };
 
-template<typename GT>
-typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typename GT::Vector_3>& u,
-                                                         const std::vector<typename GT::Vector_3>& x = {})
-{
+  template<typename GT>
+  typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typename GT::Vector_3>& u,
+    const std::vector<typename GT::Vector_3>& x = {})
+  {
     const std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
     CGAL_precondition(n >= 3);
@@ -122,52 +122,52 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
     // Triangle: use triangle formula
     if (n == 3)
     {
-        const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
-        return 0.5 * um * cross_product(x[1] - x[0], x[2] - x[0]);
+      const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
+      return 0.5 * um * cross_product(x[1] - x[0], x[2] - x[0]);
     }
     // Quad: use bilinear interpolation formula
     else if (n == 4)
     {
-        // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
-        // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
-        return (1.0 / 36.0) * (
-              (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(x[1] - x[0], x[3] - x[0])
-            + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(x[1] - x[0], x[2] - x[1])
-            + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(x[2] - x[3], x[3] - x[0])
-            + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(x[2] - x[3], x[2] - x[1])
-            );
+      // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+      // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
+      return (1.0 / 36.0) * (
+        (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(x[1] - x[0], x[3] - x[0])
+        + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(x[1] - x[0], x[2] - x[1])
+        + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(x[2] - x[3], x[3] - x[0])
+        + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(x[2] - x[3], x[2] - x[1])
+        );
     }
     // N-gon: split into n triangles by polygon center and use triangle formula for each
     else
     {
-        typename GT::FT mu0 = 0;
-
-        // getting center of points
-        typename GT::Vector_3 xc =
-            std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-        xc /= n;
-
-        // getting unit average normal of points
-        typename GT::Vector_3 uc =
-            std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
-        uc /= sqrt(uc * uc);
+      typename GT::FT mu0 = 0;
 
-        // summing each triangle's measure after triangulation by barycenter split.
-        for (std::size_t i = 0; i < n; i++)
-        {
-            mu0 += interpolated_corrected_area_measure_face<GT>(
-                std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
-                std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
-            );
-        }
-        return mu0;
+      // getting center of points
+      typename GT::Vector_3 xc =
+        std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+      xc /= n;
+
+      // getting unit average normal of points
+      typename GT::Vector_3 uc =
+        std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+      uc /= sqrt(uc * uc);
+
+      // summing each triangle's measure after triangulation by barycenter split.
+      for (std::size_t i = 0; i < n; i++)
+      {
+        mu0 += interpolated_corrected_area_measure_face<GT>(
+          std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
+          std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
+        );
+      }
+      return mu0;
     }
-}
+  }
 
-template<typename GT>
-typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
-                                                                   const std::vector<typename GT::Vector_3>& x = {})
-{
+  template<typename GT>
+  typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
+    const std::vector<typename GT::Vector_3>& x = {})
+  {
     const std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
     CGAL_precondition(n >= 3);
@@ -177,63 +177,63 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
     // Triangle: use triangle formula
     if (n == 3)
     {
-        const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
+      const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
 
-        return 0.5 * um * (cross_product(u[2] - u[1], x[0])
-            + cross_product(u[0] - u[2], x[1])
-            + cross_product(u[1] - u[0], x[2]));
+      return 0.5 * um * (cross_product(u[2] - u[1], x[0])
+        + cross_product(u[0] - u[2], x[1])
+        + cross_product(u[1] - u[0], x[2]));
     }
     // Quad: use bilinear interpolation formula
     else if (n == 4)
     {
-        // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
-        // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
-
-        const typename GT::Vector_3 u02 = u[2] - u[0];
-        const typename GT::Vector_3 u13 = u[3] - u[1];
-        const typename GT::Vector_3 x0_cross = cross_product(u13, x[0]);
-        const typename GT::Vector_3 x1_cross = -cross_product(u02, x[1]);
-        const typename GT::Vector_3 x3_cross = cross_product(u02, x[3]);
-        const typename GT::Vector_3 x2_cross = -cross_product(u13, x[2]);
-
-        return (1.0 / 12.0) * (
-              u[0] * (2 * x0_cross - cross_product((u[3] + u[2]), x[1]) + cross_product((u[1] + u[2]), x[3]) + x2_cross)
-            + u[1] * (cross_product((u[3] + u[2]), x[0]) + 2 * x1_cross + x3_cross - cross_product((u[0] + u[3]), x[2]))
-            + u[3] * (-cross_product((u[1] + u[2]), x[0]) + x1_cross + 2 * x3_cross + cross_product((u[0] + u[1]), x[2]))
-            + u[2] * (x0_cross + cross_product((u[0] + u[3]), x[1]) - cross_product((u[0] + u[1]), x[3]) + 2 * x2_cross)
-            );
+      // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+      // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
+
+      const typename GT::Vector_3 u02 = u[2] - u[0];
+      const typename GT::Vector_3 u13 = u[3] - u[1];
+      const typename GT::Vector_3 x0_cross = cross_product(u13, x[0]);
+      const typename GT::Vector_3 x1_cross = -cross_product(u02, x[1]);
+      const typename GT::Vector_3 x3_cross = cross_product(u02, x[3]);
+      const typename GT::Vector_3 x2_cross = -cross_product(u13, x[2]);
+
+      return (1.0 / 12.0) * (
+        u[0] * (2 * x0_cross - cross_product((u[3] + u[2]), x[1]) + cross_product((u[1] + u[2]), x[3]) + x2_cross)
+        + u[1] * (cross_product((u[3] + u[2]), x[0]) + 2 * x1_cross + x3_cross - cross_product((u[0] + u[3]), x[2]))
+        + u[3] * (-cross_product((u[1] + u[2]), x[0]) + x1_cross + 2 * x3_cross + cross_product((u[0] + u[1]), x[2]))
+        + u[2] * (x0_cross + cross_product((u[0] + u[3]), x[1]) - cross_product((u[0] + u[1]), x[3]) + 2 * x2_cross)
+        );
     }
     // N-gon: split into n triangles by polygon center and use triangle formula for each
     else
     {
-        typename GT::FT mu1 = 0;
+      typename GT::FT mu1 = 0;
 
-        // getting center of points
-        typename GT::Vector_3 xc =
-            std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-        xc /= n;
-
-        // getting unit average normal of points
-        typename GT::Vector_3 uc =
-            std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
-        uc /= sqrt(uc * uc);
-
-        // summing each triangle's measure after triangulation by barycenter split.
-        for (std::size_t i = 0; i < n; i++)
-        {
-            mu1 += interpolated_corrected_mean_curvature_measure_face<GT>(
-                std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
-                std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
-            );
-        }
-        return mu1;
+      // getting center of points
+      typename GT::Vector_3 xc =
+        std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+      xc /= n;
+
+      // getting unit average normal of points
+      typename GT::Vector_3 uc =
+        std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+      uc /= sqrt(uc * uc);
+
+      // summing each triangle's measure after triangulation by barycenter split.
+      for (std::size_t i = 0; i < n; i++)
+      {
+        mu1 += interpolated_corrected_mean_curvature_measure_face<GT>(
+          std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
+          std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
+        );
+      }
+      return mu1;
     }
-}
+  }
 
-template<typename GT>
-typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
-                                                                       const std::vector<typename GT::Vector_3>& x = {})
-{
+  template<typename GT>
+  typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
+    const std::vector<typename GT::Vector_3>& x = {})
+  {
     const std::size_t n = u.size();
     CGAL_precondition(n >= 3);
 
@@ -242,182 +242,182 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
     // Triangle: use triangle formula
     if (n == 3)
     {
-        return 0.5 * u[0] * cross_product(u[1], u[2]);
+      return 0.5 * u[0] * cross_product(u[1], u[2]);
     }
     // Quad: use bilinear interpolation formula
     else if (n == 4)
     {
-        // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
-        // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
-        return (1.0 / 36.0) * (
-              (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(u[1] - u[0], u[3] - u[0])
-            + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(u[1] - u[0], u[2] - u[1])
-            + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(u[2] - u[3], u[3] - u[0])
-            + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(u[2] - u[3], u[2] - u[1])
-            );
+      // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+      // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
+      return (1.0 / 36.0) * (
+        (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(u[1] - u[0], u[3] - u[0])
+        + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(u[1] - u[0], u[2] - u[1])
+        + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(u[2] - u[3], u[3] - u[0])
+        + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(u[2] - u[3], u[2] - u[1])
+        );
     }
     // N-gon: split into n triangles by polygon center and use triangle formula for each
     else
     {
-        typename GT::FT mu2 = 0;
-
-        // getting unit average normal of points
-        typename GT::Vector_3 uc =
-            std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
-        uc /= sqrt(uc * uc);
-
-        // summing each triangle's measure after triangulation by barycenter split.
-        for (std::size_t i = 0; i < n; i++)
-        {
-            mu2 += interpolated_corrected_gaussian_curvature_measure_face<GT>(
-                std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc}
-            );
-        }
-        return mu2;
+      typename GT::FT mu2 = 0;
+
+      // getting unit average normal of points
+      typename GT::Vector_3 uc =
+        std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+      uc /= sqrt(uc * uc);
+
+      // summing each triangle's measure after triangulation by barycenter split.
+      for (std::size_t i = 0; i < n; i++)
+      {
+        mu2 += interpolated_corrected_gaussian_curvature_measure_face<GT>(
+          std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc}
+        );
+      }
+      return mu2;
     }
-}
+  }
 
-template<typename GT>
-std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_face(const std::vector<typename GT::Vector_3>& u,
-                                                                                   const std::vector<typename GT::Vector_3>& x)
-{
+  template<typename GT>
+  std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_face(const std::vector<typename GT::Vector_3>& u,
+    const std::vector<typename GT::Vector_3>& x)
+  {
     const std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
     CGAL_precondition(n >= 3);
 
     typename GT::Construct_cross_product_vector_3 cross_product;
-    std::array<typename GT::FT, 3 * 3> muXY {0};
+    std::array<typename GT::FT, 3 * 3> muXY{ 0 };
 
     // Triangle: use triangle formula
     if (n == 3)
     {
-        const typename GT::Vector_3 u01 = u[1] - u[0];
-        const typename GT::Vector_3 u02 = u[2] - u[0];
-        const typename GT::Vector_3 x01 = x[1] - x[0];
-        const typename GT::Vector_3 x02 = x[2] - x[0];
-        const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
+      const typename GT::Vector_3 u01 = u[1] - u[0];
+      const typename GT::Vector_3 u02 = u[2] - u[0];
+      const typename GT::Vector_3 x01 = x[1] - x[0];
+      const typename GT::Vector_3 x02 = x[2] - x[0];
+      const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
+
+      for (std::size_t ix = 0; ix < 3; ix++)
+      {
+        typename GT::Vector_3 X;
+        if (ix == 0)
+          X = typename GT::Vector_3(1, 0, 0);
+        if (ix == 1)
+          X = typename GT::Vector_3(0, 1, 0);
+        if (ix == 2)
+          X = typename GT::Vector_3(0, 0, 1);
 
-        for (std::size_t ix = 0; ix < 3; ix++)
-        {
-            typename GT::Vector_3 X;
-            if (ix == 0)
-                X = typename GT::Vector_3(1, 0, 0);
-            if (ix == 1)
-                X = typename GT::Vector_3(0, 1, 0);
-            if (ix == 2)
-                X = typename GT::Vector_3(0, 0, 1);
-
-            for (std::size_t iy = 0; iy < 3; iy++)
-                muXY[ix * 3 + iy] = 0.5 * um * (cross_product(u02[iy] * X, x01) - cross_product(u01[iy] * X, x02));
-        }
+        for (std::size_t iy = 0; iy < 3; iy++)
+          muXY[ix * 3 + iy] = 0.5 * um * (cross_product(u02[iy] * X, x01) - cross_product(u01[iy] * X, x02));
+      }
     }
     // Quad: use bilinear interpolation formula
     else if (n == 4)
     {
-        // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
-        // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
-        for (std::size_t ix = 0; ix < 3; ix++)
-        {
-            typename GT::Vector_3 X;
-            if (ix == 0)
-                X = typename GT::Vector_3(1, 0, 0);
-            if (ix == 1)
-                X = typename GT::Vector_3(0, 1, 0);
-            if (ix == 2)
-                X = typename GT::Vector_3(0, 0, 1);
-
-            const typename GT::Vector_3 u0xX = cross_product(u[0], X);
-            const typename GT::Vector_3 u1xX = cross_product(u[1], X);
-            const typename GT::Vector_3 u2xX = cross_product(u[2], X);
-            const typename GT::Vector_3 u3xX = cross_product(u[3], X);
-
-            for (std::size_t iy = 0; iy < 3; iy++)
-                muXY[ix * 3 + iy] = (1.0 / 72.0) * (
-
-                    u[0][iy] * (    u0xX * (    - x[0] - 11 * x[1] + 13 * x[3] -      x[2])
-                                  + u1xX * ( -5 * x[0] -  7 * x[1] + 11 * x[3] +      x[2])
-                                  + u3xX * (      x[0] -  7 * x[1] + 11 * x[3] -  5 * x[2])
-                                  + u2xX * (    - x[0] -  5 * x[1] +  7 * x[3] -      x[2])
-                      )
-                  + u[1][iy] * (    u0xX * ( 13 * x[0] -      x[1] -  7 * x[3] -  5 * x[2])
-                                  + u1xX * ( 17 * x[0] -  5 * x[1] -  5 * x[3] -  7 * x[2])
-                                  + u3xX * (  5 * x[0] +      x[1] +      x[3] -  7 * x[2])
-                                  + u2xX * (  7 * x[0] -      x[1] +  5 * x[3] - 11 * x[2])
-                      )
-                  + u[2][iy] * (    u0xX * (-11 * x[0] +  5 * x[1] -      x[3] +  7 * x[2])
-                                  + u1xX * (- 7 * x[0] +      x[1] +      x[3] +  5 * x[2])
-                                  + u3xX * (- 7 * x[0] -  5 * x[1] -  5 * x[3] + 17 * x[2])
-                                  + u2xX * (- 5 * x[0] -  7 * x[1] -      x[3] + 13 * x[2])
-                      )
-                  + u[3][iy] * (    u0xX * (-     x[0] +  7 * x[1] -  5 * x[3] -      x[2])
-                                  + u1xX * (- 5 * x[0] + 11 * x[1] -  7 * x[3] +      x[2])
-                                  + u3xX * (      x[0] + 11 * x[1] -  7 * x[3] -  5 * x[2])
-                                  + u2xX * (-     x[0] + 13 * x[1] - 11 * x[3] -      x[2])
-                      )
-
-                  );
-        }
+      // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+      // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
+      for (std::size_t ix = 0; ix < 3; ix++)
+      {
+        typename GT::Vector_3 X;
+        if (ix == 0)
+          X = typename GT::Vector_3(1, 0, 0);
+        if (ix == 1)
+          X = typename GT::Vector_3(0, 1, 0);
+        if (ix == 2)
+          X = typename GT::Vector_3(0, 0, 1);
+
+        const typename GT::Vector_3 u0xX = cross_product(u[0], X);
+        const typename GT::Vector_3 u1xX = cross_product(u[1], X);
+        const typename GT::Vector_3 u2xX = cross_product(u[2], X);
+        const typename GT::Vector_3 u3xX = cross_product(u[3], X);
+
+        for (std::size_t iy = 0; iy < 3; iy++)
+          muXY[ix * 3 + iy] = (1.0 / 72.0) * (
+
+            u[0][iy] * (u0xX * (-x[0] - 11 * x[1] + 13 * x[3] - x[2])
+              + u1xX * (-5 * x[0] - 7 * x[1] + 11 * x[3] + x[2])
+              + u3xX * (x[0] - 7 * x[1] + 11 * x[3] - 5 * x[2])
+              + u2xX * (-x[0] - 5 * x[1] + 7 * x[3] - x[2])
+              )
+            + u[1][iy] * (u0xX * (13 * x[0] - x[1] - 7 * x[3] - 5 * x[2])
+              + u1xX * (17 * x[0] - 5 * x[1] - 5 * x[3] - 7 * x[2])
+              + u3xX * (5 * x[0] + x[1] + x[3] - 7 * x[2])
+              + u2xX * (7 * x[0] - x[1] + 5 * x[3] - 11 * x[2])
+              )
+            + u[2][iy] * (u0xX * (-11 * x[0] + 5 * x[1] - x[3] + 7 * x[2])
+              + u1xX * (-7 * x[0] + x[1] + x[3] + 5 * x[2])
+              + u3xX * (-7 * x[0] - 5 * x[1] - 5 * x[3] + 17 * x[2])
+              + u2xX * (-5 * x[0] - 7 * x[1] - x[3] + 13 * x[2])
+              )
+            + u[3][iy] * (u0xX * (-x[0] + 7 * x[1] - 5 * x[3] - x[2])
+              + u1xX * (-5 * x[0] + 11 * x[1] - 7 * x[3] + x[2])
+              + u3xX * (x[0] + 11 * x[1] - 7 * x[3] - 5 * x[2])
+              + u2xX * (-x[0] + 13 * x[1] - 11 * x[3] - x[2])
+              )
+
+            );
+      }
     }
     // N-gon: split into n triangles by polygon center and use triangle formula for each
     else
     {
-        // getting center of points
-        typename GT::Vector_3 xc =
-            std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-        xc /= n;
-
-        // getting unit average normal of points
-        typename GT::Vector_3 uc =
-            std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
-        uc /= sqrt(uc * uc);
-
-        // summing each triangle's measure after triangulation by barycenter split.
-        for (std::size_t i = 0; i < n; i++)
-        {
-            std::array<typename GT::FT, 3 * 3> muXY_curr_triangle =
-                interpolated_corrected_anisotropic_measure_face<GT>(
-                    std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
-                    std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
-                );
-
-            for (std::size_t ix = 0; ix < 3; ix++)
-                for (std::size_t iy = 0; iy < 3; iy++)
-                    muXY[ix * 3 + iy] += muXY_curr_triangle[ix * 3 + iy];
-        }
+      // getting center of points
+      typename GT::Vector_3 xc =
+        std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+      xc /= n;
+
+      // getting unit average normal of points
+      typename GT::Vector_3 uc =
+        std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+      uc /= sqrt(uc * uc);
+
+      // summing each triangle's measure after triangulation by barycenter split.
+      for (std::size_t i = 0; i < n; i++)
+      {
+        std::array<typename GT::FT, 3 * 3> muXY_curr_triangle =
+          interpolated_corrected_anisotropic_measure_face<GT>(
+            std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
+            std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
+        );
+
+        for (std::size_t ix = 0; ix < 3; ix++)
+          for (std::size_t iy = 0; iy < 3; iy++)
+            muXY[ix * 3 + iy] += muXY_curr_triangle[ix * 3 + iy];
+      }
     }
     return muXY;
-}
-
-//template<typename GT>
-//typename GT::FT triangle_in_ball_ratio(const typename GT::Vector_3 x1,
-//                                       const typename GT::Vector_3 x2,
-//                                       const typename GT::Vector_3 x3,
-//                                       const typename GT::FT r,
-//                                       const typename GT::Vector_3 c,
-//                                       const std::size_t res = 3)
-//{
-//    const typename GT::FT R = r * r;
-//    const typename GT::FT acc = 1.0 / res;
-//    std::size_t samples_in = 0;
-//    for (GT::FT alpha = acc / 3; alpha < 1; alpha += acc)
-//        for (GT::FT beta = acc / 3; beta < 1 - alpha; beta += acc)
-//        {
-//            if ((alpha * x1 + beta * x2 + (1 - alpha - beta) * x3 - c).squared_length() < R)
-//                samples_in++;
-//        }
-//    return samples_in / (typename GT::FT)(res * (res + 1) / 2);
-//}
-
-template<typename GT>
-typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
-                                   const typename GT::FT r,
-                                   const typename GT::Vector_3 c)
-{
+  }
+
+  //template<typename GT>
+  //typename GT::FT triangle_in_ball_ratio(const typename GT::Vector_3 x1,
+  //                                       const typename GT::Vector_3 x2,
+  //                                       const typename GT::Vector_3 x3,
+  //                                       const typename GT::FT r,
+  //                                       const typename GT::Vector_3 c,
+  //                                       const std::size_t res = 3)
+  //{
+  //    const typename GT::FT R = r * r;
+  //    const typename GT::FT acc = 1.0 / res;
+  //    std::size_t samples_in = 0;
+  //    for (GT::FT alpha = acc / 3; alpha < 1; alpha += acc)
+  //        for (GT::FT beta = acc / 3; beta < 1 - alpha; beta += acc)
+  //        {
+  //            if ((alpha * x1 + beta * x2 + (1 - alpha - beta) * x3 - c).squared_length() < R)
+  //                samples_in++;
+  //        }
+  //    return samples_in / (typename GT::FT)(res * (res + 1) / 2);
+  //}
+
+  template<typename GT>
+  typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
+    const typename GT::FT r,
+    const typename GT::Vector_3 c)
+  {
     const std::size_t n = x.size();
 
     // getting center of points
     typename GT::Vector_3 xm =
-        std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+      std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
     xm /= n;
 
     typename GT::FT d_min = (xm - c).squared_length();
@@ -425,9 +425,9 @@ typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
 
     for (const typename GT::Vector_3 xi : x)
     {
-        const typename GT::FT d_sq = (xi - c).squared_length();
-        d_max = (std::max)(d_sq, d_max);
-        d_min = (std::min)(d_sq, d_min);
+      const typename GT::FT d_sq = (xi - c).squared_length();
+      d_max = (std::max)(d_sq, d_max);
+      d_min = (std::min)(d_sq, d_min);
     }
 
     if (d_max <= r * r) return 1.0;
@@ -437,20 +437,20 @@ typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
     d_min = sqrt(d_min);
 
     return (r - d_min) / (d_max - d_min);
-}
+  }
 
-template<typename GT>
-Principal_curvature<GT> principal_curvature_from_anisotropic_measures(
+  template<typename GT>
+  Principal_curvature<GT> principal_curvature_from_anisotropic_measures(
     const std::array<typename GT::FT, 3 * 3> anisotropic_measure,
     const typename GT::FT v_mu0,
     const typename GT::Vector_3 u_GT
-)
-{
+  )
+  {
     Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
 
     for (std::size_t ix = 0; ix < 3; ix++)
-        for (std::size_t iy = 0; iy < 3; iy++)
-            v_muXY(ix, iy) = anisotropic_measure[ix * 3 + iy];
+      for (std::size_t iy = 0; iy < 3; iy++)
+        v_muXY(ix, iy) = anisotropic_measure[ix * 3 + iy];
 
     Eigen::Matrix<typename GT::FT, 3, 1> u(u_GT.x(), u_GT.y(), u_GT.z());
     const typename GT::FT K = 1000 * v_mu0;
@@ -462,7 +462,7 @@ Principal_curvature<GT> principal_curvature_from_anisotropic_measures(
     eigensolver.computeDirect(v_muXY);
 
     if (eigensolver.info() != Eigen::Success)
-        return Principal_curvature<GT>();
+      return Principal_curvature<GT>();
 
     const Eigen::Matrix<typename GT::FT, 3, 1> eig_vals = eigensolver.eigenvalues();
     const Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs = eigensolver.eigenvectors();
@@ -471,16 +471,16 @@ Principal_curvature<GT> principal_curvature_from_anisotropic_measures(
     const typename GT::Vector_3 max_eig_vec(eig_vecs(0, 0), eig_vecs(1, 0), eig_vecs(2, 0));
 
     return Principal_curvature<GT>(
-        (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
-        (v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
-        min_eig_vec,
-        max_eig_vec
-        );
-}
-
-template<typename PolygonMesh, typename NamedParameters = parameters::Default_named_parameters>
-class Interpolated_corrected_curvatures_computer
-{
+      (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
+      (v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
+      min_eig_vec,
+      max_eig_vec
+      );
+  }
+
+  template<typename PolygonMesh, typename NamedParameters = parameters::Default_named_parameters>
+  class Interpolated_corrected_curvatures_computer
+  {
     typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
 
     typedef typename GT::FT FT;
@@ -497,29 +497,29 @@ class Interpolated_corrected_curvatures_computer
     typedef dynamic_vertex_property_t<Vector_3> Vector_map_tag;
     typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
-        NamedParameters,
-        Default_vector_map>::type Vertex_normal_map;
+      NamedParameters,
+      Default_vector_map>::type Vertex_normal_map;
 
     typedef Constant_property_map<Vertex_descriptor, FT> Default_scalar_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_mean_curvature_map_t,
-        NamedParameters,
-        Default_scalar_map>::type Vertex_mean_curvature_map;
+      NamedParameters,
+      Default_scalar_map>::type Vertex_mean_curvature_map;
 
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_gaussian_curvature_map_t,
-        NamedParameters,
-        Default_scalar_map>::type Vertex_gaussian_curvature_map;
+      NamedParameters,
+      Default_scalar_map>::type Vertex_gaussian_curvature_map;
 
     typedef Constant_property_map<Vertex_descriptor, Principal_curvature<GT>> Default_principal_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvature_map_t,
-        NamedParameters,
-        Default_principal_map>::type Vertex_principal_curvature_map;
+      NamedParameters,
+      Default_principal_map>::type Vertex_principal_curvature_map;
 
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<FT>>::const_type Face_scalar_measure_map;
+      CGAL::dynamic_face_property_t<FT>>::const_type Face_scalar_measure_map;
     typedef typename boost::property_map<PolygonMesh,
-        CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>>::const_type Face_anisotropic_measure_map;
+      CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>>::const_type Face_anisotropic_measure_map;
 
-private:
+  private:
     const PolygonMesh& pmesh;
     Vertex_position_map vpm;
     Vertex_normal_map vnm;
@@ -537,217 +537,217 @@ class Interpolated_corrected_curvatures_computer
     Face_anisotropic_measure_map muXY_map;
 
     void set_property_maps() {
-        mu0_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
-        mu1_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
-        mu2_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
-        muXY_map = get(CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>(), pmesh);
+      mu0_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
+      mu1_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
+      mu2_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
+      muXY_map = get(CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>(), pmesh);
 
     }
 
     void set_named_params(const NamedParameters& np)
     {
-        using parameters::choose_parameter;
-        using parameters::get_parameter;
-        using parameters::is_default_parameter;
+      using parameters::choose_parameter;
+      using parameters::get_parameter;
+      using parameters::is_default_parameter;
 
-        vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-            get_const_property_map(CGAL::vertex_point, pmesh));
+      vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+        get_const_property_map(CGAL::vertex_point, pmesh));
 
-        vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
-            get(Vector_map_tag(), pmesh));
+      vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+        get(Vector_map_tag(), pmesh));
 
-        if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
-            compute_vertex_normals(pmesh, vnm, np);
+      if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
+        compute_vertex_normals(pmesh, vnm, np);
 
-        const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
+      const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
 
-        is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
-        is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
-        is_principal_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvature_map_t>::value;
+      is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
+      is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
+      is_principal_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvature_map_t>::value;
 
-        mean_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature_map), Default_scalar_map());
-        gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature_map), Default_scalar_map());
-        principal_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvature_map), Default_principal_map());
+      mean_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature_map), Default_scalar_map());
+      gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature_map), Default_scalar_map());
+      principal_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvature_map), Default_principal_map());
 
-        set_ball_radius(radius);
+      set_ball_radius(radius);
     }
 
     void set_ball_radius(const FT radius) {
-        if (radius == 0)
-            ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
-        else
-            ball_radius = radius;
+      if (radius == 0)
+        ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+      else
+        ball_radius = radius;
     }
 
-public:
+  public:
 
     Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,
-        const NamedParameters& np = parameters::default_values()
+      const NamedParameters& np = parameters::default_values()
     ) :
-        pmesh(pmesh)
+      pmesh(pmesh)
     {
-        set_named_params(np);
+      set_named_params(np);
 
-        if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvature_selected)
-        {
-            set_property_maps();
+      if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvature_selected)
+      {
+        set_property_maps();
 
-            compute_selected_curvatures();
-        }
+        compute_selected_curvatures();
+      }
     }
 
-private:
+  private:
 
     void interpolated_corrected_all_measures_all_faces()
     {
-        std::vector<Vector_3> x;
-        std::vector<Vector_3> u;
+      std::vector<Vector_3> x;
+      std::vector<Vector_3> u;
 
-        for (Face_descriptor f : faces(pmesh))
+      for (Face_descriptor f : faces(pmesh))
+      {
+        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
         {
-            for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
-            {
-                Point_3 p = get(vpm, v);
-                x.push_back(Vector_3(p.x(), p.y(), p.z()));
-                u.push_back(get(vnm, v));
-            }
-            put(mu0_map, f, interpolated_corrected_area_measure_face<GT>(u, x));
+          Point_3 p = get(vpm, v);
+          x.push_back(Vector_3(p.x(), p.y(), p.z()));
+          u.push_back(get(vnm, v));
+        }
+        put(mu0_map, f, interpolated_corrected_area_measure_face<GT>(u, x));
 
-            if (is_mean_curvature_selected)
-                put(mu1_map, f, interpolated_corrected_mean_curvature_measure_face<GT>(u, x));
+        if (is_mean_curvature_selected)
+          put(mu1_map, f, interpolated_corrected_mean_curvature_measure_face<GT>(u, x));
 
-            if (is_gaussian_curvature_selected)
-                put(mu2_map, f, interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x));
+        if (is_gaussian_curvature_selected)
+          put(mu2_map, f, interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x));
 
-            if (is_principal_curvature_selected)
-                put(muXY_map, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
+        if (is_principal_curvature_selected)
+          put(muXY_map, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
 
-            x.clear();
-            u.clear();
-        }
+        x.clear();
+        u.clear();
+      }
     }
 
     Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(Vertex_descriptor v)
     {
-        Vertex_measures<GT> vertex_curvatures;
+      Vertex_measures<GT> vertex_curvatures;
 
-        for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-            vertex_curvatures.area_measure += get(mu0_map, f);
+      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+        vertex_curvatures.area_measure += get(mu0_map, f);
 
-            if (is_mean_curvature_selected)
-                vertex_curvatures.mean_curvature_measure += get(mu1_map, f);
+        if (is_mean_curvature_selected)
+          vertex_curvatures.mean_curvature_measure += get(mu1_map, f);
 
-            if (is_gaussian_curvature_selected)
-                vertex_curvatures.gaussian_curvature_measure += get(mu2_map, f);
+        if (is_gaussian_curvature_selected)
+          vertex_curvatures.gaussian_curvature_measure += get(mu2_map, f);
 
-            if (is_principal_curvature_selected)
-            {
-                const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, f);
-                for (std::size_t i = 0; i < 3 * 3; i++)
-                    vertex_curvatures.anisotropic_measure[i] += face_anisotropic_measure[i];
-            }
+        if (is_principal_curvature_selected)
+        {
+          const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, f);
+          for (std::size_t i = 0; i < 3 * 3; i++)
+            vertex_curvatures.anisotropic_measure[i] += face_anisotropic_measure[i];
         }
+      }
 
-        return vertex_curvatures;
+      return vertex_curvatures;
     }
 
     Vertex_measures<GT> expand_interpolated_corrected_measure_vertex(Vertex_descriptor v)
     {
-        std::queue<Face_descriptor> bfs_queue;
-        std::unordered_set<Face_descriptor> bfs_visited;
+      std::queue<Face_descriptor> bfs_queue;
+      std::unordered_set<Face_descriptor> bfs_visited;
 
-        Point_3 vp = get(vpm, v);
-        Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
+      Point_3 vp = get(vpm, v);
+      Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
 
-        Vertex_measures<GT> vertex_curvatures;
+      Vertex_measures<GT> vertex_curvatures;
 
-        for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-            if (f != boost::graph_traits<PolygonMesh>::null_face())
-            {
-                bfs_queue.push(f);
-                bfs_visited.insert(f);
-            }
+      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+        if (f != boost::graph_traits<PolygonMesh>::null_face())
+        {
+          bfs_queue.push(f);
+          bfs_visited.insert(f);
         }
-        while (!bfs_queue.empty()) {
-            Face_descriptor fi = bfs_queue.front();
-            bfs_queue.pop();
+      }
+      while (!bfs_queue.empty()) {
+        Face_descriptor fi = bfs_queue.front();
+        bfs_queue.pop();
 
-            // looping over vertices in face to get point coordinates
-            std::vector<Vector_3> x;
-            for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
-            {
-                Point_3 pi = get(vpm, vi);
-                x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
-            }
+        // looping over vertices in face to get point coordinates
+        std::vector<Vector_3> x;
+        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+        {
+          Point_3 pi = get(vpm, vi);
+          x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
+        }
 
-            const FT f_ratio = face_in_ball_ratio<GT>(x, ball_radius, c);
+        const FT f_ratio = face_in_ball_ratio<GT>(x, ball_radius, c);
 
-            if (f_ratio != 0.0)
+        if (f_ratio != 0.0)
+        {
+          vertex_curvatures.area_measure += f_ratio * get(mu0_map, fi);
+
+          if (is_mean_curvature_selected)
+            vertex_curvatures.mean_curvature_measure += f_ratio * get(mu1_map, fi);
+
+          if (is_gaussian_curvature_selected)
+            vertex_curvatures.gaussian_curvature_measure += f_ratio * get(mu2_map, fi);
+
+          if (is_principal_curvature_selected)
+          {
+            const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, fi);
+            for (std::size_t i = 0; i < 3 * 3; i++)
+              vertex_curvatures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
+          }
+
+          for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+          {
+            if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
             {
-                vertex_curvatures.area_measure += f_ratio * get(mu0_map, fi);
-
-                if (is_mean_curvature_selected)
-                    vertex_curvatures.mean_curvature_measure += f_ratio * get(mu1_map, fi);
-
-                if (is_gaussian_curvature_selected)
-                    vertex_curvatures.gaussian_curvature_measure += f_ratio * get(mu2_map, fi);
-
-                if (is_principal_curvature_selected)
-                {
-                    const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, fi);
-                    for (std::size_t i = 0; i < 3 * 3; i++)
-                        vertex_curvatures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
-                }
-
-                for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
-                {
-                    if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
-                    {
-                        bfs_queue.push(fj);
-                        bfs_visited.insert(fj);
-                    }
-                }
+              bfs_queue.push(fj);
+              bfs_visited.insert(fj);
             }
+          }
         }
-        return vertex_curvatures;
+      }
+      return vertex_curvatures;
     }
 
     void compute_selected_curvatures() {
-        interpolated_corrected_all_measures_all_faces();
-
-        for (Vertex_descriptor v : vertices(pmesh))
-        {
-            Vertex_measures<GT> vertex_curvatures = (ball_radius < 0)?
-                expand_interpolated_corrected_measure_vertex_no_radius(v) :
-                expand_interpolated_corrected_measure_vertex(v);
-
-            if (is_mean_curvature_selected) {
-                vertex_curvatures.area_measure != 0 ?
-                    put(mean_curvature_map, v, 0.5 * vertex_curvatures.mean_curvature_measure / vertex_curvatures.area_measure) :
-                    put(mean_curvature_map, v, 0);
-            }
+      interpolated_corrected_all_measures_all_faces();
+
+      for (Vertex_descriptor v : vertices(pmesh))
+      {
+        Vertex_measures<GT> vertex_curvatures = (ball_radius < 0) ?
+          expand_interpolated_corrected_measure_vertex_no_radius(v) :
+          expand_interpolated_corrected_measure_vertex(v);
+
+        if (is_mean_curvature_selected) {
+          vertex_curvatures.area_measure != 0 ?
+            put(mean_curvature_map, v, 0.5 * vertex_curvatures.mean_curvature_measure / vertex_curvatures.area_measure) :
+            put(mean_curvature_map, v, 0);
+        }
 
-            if (is_gaussian_curvature_selected) {
-                vertex_curvatures.area_measure != 0 ?
-                    put(gaussian_curvature_map, v, vertex_curvatures.gaussian_curvature_measure / vertex_curvatures.area_measure) :
-                    put(gaussian_curvature_map, v, 0);
-            }
+        if (is_gaussian_curvature_selected) {
+          vertex_curvatures.area_measure != 0 ?
+            put(gaussian_curvature_map, v, vertex_curvatures.gaussian_curvature_measure / vertex_curvatures.area_measure) :
+            put(gaussian_curvature_map, v, 0);
+        }
 
-            if (is_principal_curvature_selected) {
-                const Vector_3  v_normal = get(vnm, v);
-                const Principal_curvature<GT> principal_curvature = principal_curvature_from_anisotropic_measures<GT>(
-                    vertex_curvatures.anisotropic_measure,
-                    vertex_curvatures.area_measure,
-                    v_normal
-                    );
-                put(principal_curvature_map, v, principal_curvature);
-            }
+        if (is_principal_curvature_selected) {
+          const Vector_3  v_normal = get(vnm, v);
+          const Principal_curvature<GT> principal_curvature = principal_curvature_from_anisotropic_measures<GT>(
+            vertex_curvatures.anisotropic_measure,
+            vertex_curvatures.area_measure,
+            v_normal
+            );
+          put(principal_curvature_map, v, principal_curvature);
         }
+      }
     }
 
 
 
-};
+  };
 
 } // namespace internal
 
@@ -807,12 +807,12 @@ class Interpolated_corrected_curvatures_computer
 */
 
 template<typename PolygonMesh, typename VertexCurvatureMap,
-    typename NamedParameters = parameters::Default_named_parameters>
-    void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
-        VertexCurvatureMap& vcm,
-        NamedParameters& np = parameters::default_values())
+  typename NamedParameters = parameters::Default_named_parameters>
+  void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
+    VertexCurvatureMap& vcm,
+    NamedParameters& np = parameters::default_values())
 {
-    interpolated_corrected_curvatures(pmesh, np.vertex_mean_curvature_map(vcm));
+  interpolated_corrected_curvatures(pmesh, np.vertex_mean_curvature_map(vcm));
 }
 
 /**
@@ -870,12 +870,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * @see `interpolated_corrected_curvatures()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
-    typename NamedParameters = parameters::Default_named_parameters>
-    void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
-        VertexCurvatureMap& vcm,
-        NamedParameters& np = parameters::default_values())
+  typename NamedParameters = parameters::Default_named_parameters>
+  void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
+    VertexCurvatureMap& vcm,
+    NamedParameters& np = parameters::default_values())
 {
-    interpolated_corrected_curvatures(pmesh, np.vertex_gaussian_curvature_map(vcm));
+  interpolated_corrected_curvatures(pmesh, np.vertex_gaussian_curvature_map(vcm));
 }
 
 /**
@@ -934,12 +934,12 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * @see `interpolated_corrected_curvatures()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
-    typename NamedParameters = parameters::Default_named_parameters>
-    void interpolated_corrected_principal_curvatures(const PolygonMesh& pmesh,
-        VertexCurvatureMap& vcm,
-        NamedParameters& np = parameters::default_values())
+  typename NamedParameters = parameters::Default_named_parameters>
+  void interpolated_corrected_principal_curvatures(const PolygonMesh& pmesh,
+    VertexCurvatureMap& vcm,
+    NamedParameters& np = parameters::default_values())
 {
-    interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvature_map(vcm));
+  interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvature_map(vcm));
 }
 
 /**
@@ -1023,11 +1023,11 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * @see `interpolated_corrected_principal_curvatures()`
 */
 template<typename PolygonMesh,
-    typename NamedParameters = parameters::Default_named_parameters>
-    void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
-        const NamedParameters& np = parameters::default_values())
+  typename NamedParameters = parameters::Default_named_parameters>
+  void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
+    const NamedParameters& np = parameters::default_values())
 {
-    internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np);
+  internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np);
 }
 
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
index 7e376c887716..b2dbcc0850bb 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
@@ -19,130 +19,130 @@ typedef boost::graph_traits<SMesh>::edge_descriptor edge_descriptor;
 typedef boost::graph_traits<SMesh>::vertex_descriptor vertex_descriptor;
 
 void test(std::string mesh_path, EpicKernel::FT rel_expansion_radius, EpicKernel::FT rel_noise_magnitude) {
-    SMesh pmesh;
-    const std::string filename = CGAL::data_file_path(mesh_path);
+  SMesh pmesh;
+  const std::string filename = CGAL::data_file_path(mesh_path);
 
-    if (!CGAL::IO::read_polygon_mesh(filename, pmesh))
-    {
-        std::cerr << "Invalid input file." << std::endl;
-    }
+  if (!CGAL::IO::read_polygon_mesh(filename, pmesh))
+  {
+    std::cerr << "Invalid input file." << std::endl;
+  }
 
-    bool created = false;
+  bool created = false;
 
-    SMesh::Property_map<vertex_descriptor, EpicKernel::FT> mean_curvature_map, gaussian_curvature_map;
-    boost::tie(mean_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:mean_curvature_map", 0);
-    assert(created);
+  SMesh::Property_map<vertex_descriptor, EpicKernel::FT> mean_curvature_map, gaussian_curvature_map;
+  boost::tie(mean_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:mean_curvature_map", 0);
+  assert(created);
+
+  boost::tie(gaussian_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:gaussian_curvature_map", 0);
+  assert(created);
+
+  // getting the max and min edge lengthes
+  const auto edge_range = CGAL::edges(pmesh);
+
+  const auto edge_length_comparator = [&, pmesh](auto l, auto r) {
+    return PMP::edge_length(l, pmesh) < PMP::edge_length(r, pmesh);
+  };
+
+  const edge_descriptor longest_edge = *std::max_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
+  const EpicKernel::FT max_edge_length = PMP::edge_length(longest_edge, pmesh);
+
+  const edge_descriptor shortest_edge = *std::min_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
+  const EpicKernel::FT min_edge_length = PMP::edge_length(shortest_edge, pmesh);
+
+
+  if (rel_noise_magnitude > 0)
+  {
+    if (!CGAL::is_triangle_mesh(pmesh))
+      return;
 
-    boost::tie(gaussian_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:gaussian_curvature_map", 0);
+    SMesh::Property_map<vertex_descriptor, EpicKernel::Vector_3> vnm;
+    boost::tie(vnm, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::Vector_3>("v:vnm", { 0 , 0 , 0 });
     assert(created);
 
-    // getting the max and min edge lengthes
-    const auto edge_range = CGAL::edges(pmesh);
-
-    const auto edge_length_comparator = [&, pmesh](auto l, auto r) {
-        return PMP::edge_length(l, pmesh) < PMP::edge_length(r, pmesh);
-    };
-
-    const edge_descriptor longest_edge = *std::max_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
-    const EpicKernel::FT max_edge_length = PMP::edge_length(longest_edge, pmesh);
-
-    const edge_descriptor shortest_edge = *std::min_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
-    const EpicKernel::FT min_edge_length = PMP::edge_length(shortest_edge, pmesh);
-
-
-    if (rel_noise_magnitude > 0)
-    {
-        if (!CGAL::is_triangle_mesh(pmesh))
-            return;
-
-        SMesh::Property_map<vertex_descriptor, EpicKernel::Vector_3> vnm;
-        boost::tie(vnm, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::Vector_3>("v:vnm", { 0 , 0 , 0 });
-        assert(created);
-
-        CGAL::Polygon_mesh_processing::compute_vertex_normals(pmesh, vnm);
-
-        PMP::random_perturbation(pmesh, rel_noise_magnitude * min_edge_length, CGAL::parameters::random_seed(0));
-        PMP::interpolated_corrected_mean_curvature(
-            pmesh,
-            mean_curvature_map,
-            CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
-        );
-        PMP::interpolated_corrected_gaussian_curvature(
-            pmesh,
-            gaussian_curvature_map,
-            CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
-        );
-    }
-    else {
-        PMP::interpolated_corrected_mean_curvature(
-            pmesh,
-            mean_curvature_map,
-            CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-        );
-        PMP::interpolated_corrected_gaussian_curvature(
-            pmesh,
-            gaussian_curvature_map,
-            CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-        );
-
-    }
-
-
-
-    //PMP::interpolated_corrected_mean_curvature(
-    //  pmesh,
-    //  mean_curvature_map,
-    //  CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-    //);
-    //PMP::interpolated_corrected_gaussian_curvature(
-    //  pmesh,
-    //  gaussian_curvature_map,
-    //  CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-    //);
-
-
-    const EpicKernel::FT max_mean_curvature = *std::max_element(mean_curvature_map.begin(), mean_curvature_map.end());
-    const EpicKernel::FT min_mean_curvature = *std::min_element(mean_curvature_map.begin(), mean_curvature_map.end());
-    const EpicKernel::FT max_gaussian_curvature = *std::max_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
-    const EpicKernel::FT min_gaussian_curvature = *std::min_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
-
-    std::cout << "# " << mesh_path << ":\n"
-        << "expansion radius ratio to max length / expansion radius = " << rel_expansion_radius << " / " << rel_expansion_radius * max_edge_length << ",\n"
-        << "max perturbation ratio to minlength / max perturbation = " << rel_noise_magnitude << " / " << rel_noise_magnitude * min_edge_length << "\n"
-        << "mean curvature: min = " << min_mean_curvature << " <-> " << max_mean_curvature << " = max" << "\n"
-        << "gaussian curvature: min = " << min_gaussian_curvature << " <-> " << max_gaussian_curvature << " = max" << "\n\n\n";
+    CGAL::Polygon_mesh_processing::compute_vertex_normals(pmesh, vnm);
+
+    PMP::random_perturbation(pmesh, rel_noise_magnitude * min_edge_length, CGAL::parameters::random_seed(0));
+    PMP::interpolated_corrected_mean_curvature(
+      pmesh,
+      mean_curvature_map,
+      CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
+    );
+    PMP::interpolated_corrected_gaussian_curvature(
+      pmesh,
+      gaussian_curvature_map,
+      CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
+    );
+  }
+  else {
+    PMP::interpolated_corrected_mean_curvature(
+      pmesh,
+      mean_curvature_map,
+      CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+    );
+    PMP::interpolated_corrected_gaussian_curvature(
+      pmesh,
+      gaussian_curvature_map,
+      CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+    );
+
+  }
+
+
+
+  //PMP::interpolated_corrected_mean_curvature(
+  //  pmesh,
+  //  mean_curvature_map,
+  //  CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+  //);
+  //PMP::interpolated_corrected_gaussian_curvature(
+  //  pmesh,
+  //  gaussian_curvature_map,
+  //  CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
+  //);
+
+
+  const EpicKernel::FT max_mean_curvature = *std::max_element(mean_curvature_map.begin(), mean_curvature_map.end());
+  const EpicKernel::FT min_mean_curvature = *std::min_element(mean_curvature_map.begin(), mean_curvature_map.end());
+  const EpicKernel::FT max_gaussian_curvature = *std::max_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
+  const EpicKernel::FT min_gaussian_curvature = *std::min_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
+
+  std::cout << "# " << mesh_path << ":\n"
+    << "expansion radius ratio to max length / expansion radius = " << rel_expansion_radius << " / " << rel_expansion_radius * max_edge_length << ",\n"
+    << "max perturbation ratio to minlength / max perturbation = " << rel_noise_magnitude << " / " << rel_noise_magnitude * min_edge_length << "\n"
+    << "mean curvature: min = " << min_mean_curvature << " <-> " << max_mean_curvature << " = max" << "\n"
+    << "gaussian curvature: min = " << min_gaussian_curvature << " <-> " << max_gaussian_curvature << " = max" << "\n\n\n";
 
 
 }
 
 int main()
 {
-    const std::vector<std::string> mesh_pathes_to_test = {
-        "meshes/icc_test/Sphere Quads + Tris.obj",
-        "meshes/icc_test/Sphere Quads + Tris 100352.obj",
-        "meshes/icc_test/Sphere Tris Ico.obj",
-        "meshes/icc_test/Sphere Tris Tet.obj",
-        "meshes/icc_test/Sphere Tris Oct.obj",
-        "meshes/icc_test/Sphere Quads.obj",
-        "meshes/icc_test/Sphere Quads Remesh.obj",
-        "meshes/icc_test/Sphere Ngons + Quads + Tris.obj",
-        "meshes/icc_test/Cube with fillet Quads.obj",
-        "meshes/cylinder.off",
-        "meshes/icc_test/Lantern Tris.obj",
-        "meshes/icc_test/Lantern Quads.obj"
-    };
-
-    const std::vector<EpicKernel::FT> rel_expansion_radii = { 0, 0.1, 0.5, 1 };
-    const std::vector<EpicKernel::FT> rel_noise_magnitudes = { 0, 0.5, 0.9 };
-
-    for (auto mesh_path : mesh_pathes_to_test) {
-        for (EpicKernel::FT rel_expansion_radius : rel_expansion_radii)
-            for (EpicKernel::FT rel_noise_magnitude : rel_noise_magnitudes)
-            {
-                test(mesh_path, rel_expansion_radius, rel_noise_magnitude);
-            }
-
-        std::cout << "_________________________________________________________________________________\n\n";
-    }
+  const std::vector<std::string> mesh_pathes_to_test = {
+    "meshes/icc_test/Sphere Quads + Tris.obj",
+    "meshes/icc_test/Sphere Quads + Tris 100352.obj",
+    "meshes/icc_test/Sphere Tris Ico.obj",
+    "meshes/icc_test/Sphere Tris Tet.obj",
+    "meshes/icc_test/Sphere Tris Oct.obj",
+    "meshes/icc_test/Sphere Quads.obj",
+    "meshes/icc_test/Sphere Quads Remesh.obj",
+    "meshes/icc_test/Sphere Ngons + Quads + Tris.obj",
+    "meshes/icc_test/Cube with fillet Quads.obj",
+    "meshes/cylinder.off",
+    "meshes/icc_test/Lantern Tris.obj",
+    "meshes/icc_test/Lantern Quads.obj"
+  };
+
+  const std::vector<EpicKernel::FT> rel_expansion_radii = { 0, 0.1, 0.5, 1 };
+  const std::vector<EpicKernel::FT> rel_noise_magnitudes = { 0, 0.5, 0.9 };
+
+  for (auto mesh_path : mesh_pathes_to_test) {
+    for (EpicKernel::FT rel_expansion_radius : rel_expansion_radii)
+      for (EpicKernel::FT rel_noise_magnitude : rel_noise_magnitudes)
+      {
+        test(mesh_path, rel_expansion_radius, rel_noise_magnitude);
+      }
+
+    std::cout << "_________________________________________________________________________________\n\n";
+  }
 
 }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index c69b73694980..db26f59168a8 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -658,13 +658,13 @@ private Q_SLOTS:
       if(does_exist)
         sm_item->face_graph()->remove_property_map(pmap);
       std::tie(pmap, does_exist) =
-          sm_item->face_graph()->property_map<face_descriptor, double>("v:interpolated_corrected_mean_curvature");
+        sm_item->face_graph()->property_map<face_descriptor, double>("v:interpolated_corrected_mean_curvature");
       if (does_exist)
           sm_item->face_graph()->remove_property_map(pmap);
       std::tie(pmap, does_exist) =
-          sm_item->face_graph()->property_map<face_descriptor, double>("v:interpolated_corrected_gaussian_curvature");
+        sm_item->face_graph()->property_map<face_descriptor, double>("v:interpolated_corrected_gaussian_curvature");
       if (does_exist)
-          sm_item->face_graph()->remove_property_map(pmap);
+        sm_item->face_graph()->remove_property_map(pmap);
     });
     QApplication::restoreOverrideCursor();
     sm_item->invalidateOpenGLBuffers();
@@ -704,13 +704,13 @@ private Q_SLOTS:
         dock_widget->zoomToMaxButton->setEnabled(jacobian_max.count(sm_item)>0);
         break;
       case 4:
-          dock_widget->zoomToMinButton->setEnabled(mean_curvature_min.count(sm_item) > 0);
-          dock_widget->zoomToMaxButton->setEnabled(mean_curvature_max.count(sm_item) > 0);
-          break;
+        dock_widget->zoomToMinButton->setEnabled(mean_curvature_min.count(sm_item) > 0);
+        dock_widget->zoomToMaxButton->setEnabled(mean_curvature_max.count(sm_item) > 0);
+        break;
       case 5:
-          dock_widget->zoomToMinButton->setEnabled(gaussian_curvature_min.count(sm_item) > 0);
-          dock_widget->zoomToMaxButton->setEnabled(gaussian_curvature_max.count(sm_item) > 0);
-          break;
+        dock_widget->zoomToMinButton->setEnabled(gaussian_curvature_min.count(sm_item) > 0);
+        dock_widget->zoomToMaxButton->setEnabled(gaussian_curvature_max.count(sm_item) > 0);
+        break;
       default:
         break;
       }
@@ -745,13 +745,13 @@ private Q_SLOTS:
     std::tie(mean_curvature, found) = smesh.property_map<vertex_descriptor, double>("v:interpolated_corrected_mean_curvature");
     if (found)
     {
-        smesh.remove_property_map(mean_curvature);
+      smesh.remove_property_map(mean_curvature);
     }
     SMesh::Property_map<vertex_descriptor, double> gaussian_curvature;
     std::tie(gaussian_curvature, found) = smesh.property_map<vertex_descriptor, double>("v:interpolated_corrected_gaussian_curvature");
     if (found)
     {
-        smesh.remove_property_map(gaussian_curvature);
+      smesh.remove_property_map(gaussian_curvature);
     }
   }
 
@@ -795,54 +795,54 @@ private Q_SLOTS:
 
   void setExpandingRadius(int val_int)
   {
-      double sliderMin = dock_widget->expandingRadiusSlider->minimum();
-      double sliderMax = dock_widget->expandingRadiusSlider->maximum() - sliderMin;
-      double val =  val_int - sliderMin;
-      sliderMin = 0;
+    double sliderMin = dock_widget->expandingRadiusSlider->minimum();
+    double sliderMax = dock_widget->expandingRadiusSlider->maximum() - sliderMin;
+    double val =  val_int - sliderMin;
+    sliderMin = 0;
 
-      SMesh& smesh = *(qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex())))->face_graph();
+    SMesh& smesh = *(qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex())))->face_graph();
 
-      auto vpm = get(CGAL::vertex_point, smesh);
+    auto vpm = get(CGAL::vertex_point, smesh);
 
-      if (maxEdgeLength < 0)
+    if (maxEdgeLength < 0)
+    {
+      auto edge_range = CGAL::edges(smesh);
+      
+      if (edge_range.begin() == edge_range.end())
       {
-          auto edge_range = CGAL::edges(smesh);
-
-          if (edge_range.begin() == edge_range.end())
-          {
-              expand_radius = 0;
-              dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
-              return;
-          }
-
-          auto edge_reference = std::max_element(edge_range.begin(), edge_range.end(), [&, vpm, smesh](auto l, auto r) {
-              auto res = EPICK().compare_squared_distance_3_object()(
-                  get(vpm, source((l), smesh)),
-                  get(vpm, target((l), smesh)),
-                  get(vpm, source((r), smesh)),
-                  get(vpm, target((r), smesh)));
-              return res == CGAL::SMALLER;
-          });
-
-          // if edge_reference is not derefrenceble
-          if (edge_reference == edge_range.end())
-          {
-              expand_radius = 0;
-              dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
-              return;
-          }
-
-          maxEdgeLength = sqrt(
-              (get(vpm, source((*edge_reference), smesh)) - get(vpm, target((*edge_reference), smesh)))
-              .squared_length()
-          );
-
+        expand_radius = 0;
+        dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
+        return;
+      }
+      
+      auto edge_reference = std::max_element(edge_range.begin(), edge_range.end(), [&, vpm, smesh](auto l, auto r) {
+        auto res = EPICK().compare_squared_distance_3_object()(
+            get(vpm, source((l), smesh)),
+            get(vpm, target((l), smesh)),
+            get(vpm, source((r), smesh)),
+            get(vpm, target((r), smesh)));
+        return res == CGAL::SMALLER;
+      });
+      
+      // if edge_reference is not derefrenceble
+      if (edge_reference == edge_range.end())
+      {
+        expand_radius = 0;
+        dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
+        return;
       }
+      
+      maxEdgeLength = sqrt(
+          (get(vpm, source((*edge_reference), smesh)) - get(vpm, target((*edge_reference), smesh)))
+          .squared_length()
+      );
+      
+    }
 
-      double outMin = 0, outMax = 5 * maxEdgeLength, base = 1.2;
+    double outMin = 0, outMax = 5 * maxEdgeLength, base = 1.2;
 
-      expand_radius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
-      dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
+    expand_radius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
+    dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
 
   }
 
@@ -864,45 +864,45 @@ private Q_SLOTS:
             smesh.add_property_map<vertex_descriptor, double>(tied_string, 0);
     if (non_init)
     {
-        if (vnm_exists) {
-            if (mu_index == MEAN_CURVATURE)
-                PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
-            else
-                PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
-        }
-        else {
-            if (mu_index == MEAN_CURVATURE)
-                PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
-            else
-                PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
-        }
-        double res_min = ARBITRARY_DBL_MAX,
-            res_max = -ARBITRARY_DBL_MAX;
-        SMesh::Vertex_index min_index, max_index;
-        for (SMesh::Vertex_index v : vertices(smesh))
+      if (vnm_exists) {
+        if (mu_index == MEAN_CURVATURE)
+          PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
+        else
+          PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
+      }
+      else {
+        if (mu_index == MEAN_CURVATURE)
+          PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
+        else
+          PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
+      }
+      double res_min = ARBITRARY_DBL_MAX,
+             res_max = -ARBITRARY_DBL_MAX;
+      SMesh::Vertex_index min_index, max_index;
+      for (SMesh::Vertex_index v : vertices(smesh))
+      {
+        if (mu_i_map[v] > res_max)
         {
-            if (mu_i_map[v] > res_max)
-            {
-                res_max = mu_i_map[v];
-                max_index = v;
-            }
-            if (mu_i_map[v] < res_min)
-            {
-                res_min = mu_i_map[v];
-                min_index = v;
-            }
-        }
-        if (mu_index == MEAN_CURVATURE){
-            mean_curvature_max[item] = std::make_pair(res_max, max_index);
-            mean_curvature_min[item] = std::make_pair(res_min, min_index);
+          res_max = mu_i_map[v];
+          max_index = v;
         }
-        else {
-            gaussian_curvature_max[item] = std::make_pair(res_max, max_index);
-            gaussian_curvature_min[item] = std::make_pair(res_min, min_index);
+        if (mu_i_map[v] < res_min)
+        {
+          res_min = mu_i_map[v];
+          min_index = v;
         }
+      }
+      if (mu_index == MEAN_CURVATURE){
+        mean_curvature_max[item] = std::make_pair(res_max, max_index);
+        mean_curvature_min[item] = std::make_pair(res_min, min_index);
+      }
+      else {
+        gaussian_curvature_max[item] = std::make_pair(res_max, max_index);
+        gaussian_curvature_min[item] = std::make_pair(res_min, min_index);
+      }
 
-        connect(item, &Scene_surface_mesh_item::itemChanged,
-            this, &DisplayPropertyPlugin::resetProperty);
+      connect(item, &Scene_surface_mesh_item::itemChanged,
+          this, &DisplayPropertyPlugin::resetProperty);
     }
         treat_sm_property<vertex_descriptor>(tied_string, item->face_graph());
   }
@@ -1271,20 +1271,20 @@ private Q_SLOTS:
     break;
     case 4:
     {
-        ::zoomToId(*item->face_graph(),
-            QString("v%1").arg(mean_curvature_min[item].second),
-            getActiveViewer(),
-            dummy_fd,
-            dummy_p);
+      ::zoomToId(*item->face_graph(),
+          QString("v%1").arg(mean_curvature_min[item].second),
+          getActiveViewer(),
+          dummy_fd,
+          dummy_p);
     }
     break;
     case 5:
     {
-        ::zoomToId(*item->face_graph(),
-            QString("v%1").arg(gaussian_curvature_min[item].second),
-            getActiveViewer(),
-            dummy_fd,
-            dummy_p);
+      ::zoomToId(*item->face_graph(),
+          QString("v%1").arg(gaussian_curvature_min[item].second),
+          getActiveViewer(),
+          dummy_fd,
+          dummy_p);
     }
     break;
     break;
@@ -1324,20 +1324,20 @@ private Q_SLOTS:
     break;
     case 4:
     {
-        ::zoomToId(*item->face_graph(),
-            QString("v%1").arg(mean_curvature_max[item].second),
-            getActiveViewer(),
-            dummy_fd,
-            dummy_p);
+      ::zoomToId(*item->face_graph(),
+          QString("v%1").arg(mean_curvature_max[item].second),
+          getActiveViewer(),
+          dummy_fd,
+          dummy_p);
     }
     break;
     case 5:
     {
-        ::zoomToId(*item->face_graph(),
-            QString("v%1").arg(gaussian_curvature_max[item].second),
-            getActiveViewer(),
-            dummy_fd,
-            dummy_p);
+      ::zoomToId(*item->face_graph(),
+          QString("v%1").arg(gaussian_curvature_max[item].second),
+          getActiveViewer(),
+          dummy_fd,
+          dummy_p);
     }
     break;
     default:

From e79e34df4fe4e69279865c3b8294159774ad04dc Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 16 Nov 2022 12:53:43 +0200
Subject: [PATCH 0081/1398] trim trailing whitespaces

---
 .../Plugins/Display/Display_property_plugin.cpp        | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index db26f59168a8..6efc7f213fe2 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -807,14 +807,14 @@ private Q_SLOTS:
     if (maxEdgeLength < 0)
     {
       auto edge_range = CGAL::edges(smesh);
-      
+
       if (edge_range.begin() == edge_range.end())
       {
         expand_radius = 0;
         dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
         return;
       }
-      
+
       auto edge_reference = std::max_element(edge_range.begin(), edge_range.end(), [&, vpm, smesh](auto l, auto r) {
         auto res = EPICK().compare_squared_distance_3_object()(
             get(vpm, source((l), smesh)),
@@ -823,7 +823,7 @@ private Q_SLOTS:
             get(vpm, target((r), smesh)));
         return res == CGAL::SMALLER;
       });
-      
+
       // if edge_reference is not derefrenceble
       if (edge_reference == edge_range.end())
       {
@@ -831,12 +831,12 @@ private Q_SLOTS:
         dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
         return;
       }
-      
+
       maxEdgeLength = sqrt(
           (get(vpm, source((*edge_reference), smesh)) - get(vpm, target((*edge_reference), smesh)))
           .squared_length()
       );
-      
+
     }
 
     double outMin = 0, outMax = 5 * maxEdgeLength, base = 1.2;

From 400f9de47c68df5ac92a9eba42f0865af1c60515 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 17 Nov 2022 19:49:42 +0100
Subject: [PATCH 0082/1398] first draft version for getting the triangulation
 of a face

WARNING: COMPILATION NOT TESTED!
---
 .../triangulate_faces.h                       | 147 ++++++++++++++++++
 1 file changed, 147 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/triangulate_faces.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/triangulate_faces.h
index 0b48967f2733..abe56ea35a61 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/triangulate_faces.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/triangulate_faces.h
@@ -499,6 +499,153 @@ bool triangulate_face(typename boost::graph_traits<PolygonMesh>::face_descriptor
   return modifier.triangulate_face(f, pmesh, use_cdt, visitor);
 }
 
+
+#ifndef CGAL_TRIANGULATE_FACES_DO_NOT_USE_CDT2
+template<typename PolygonMesh, typename OutputIterator, typename NamedParameters = parameters::Default_named_parameters>
+OutputIterator
+face_triangulation(typename boost::graph_traits<PolygonMesh>::face_descriptor f,
+                   PolygonMesh& pmesh,
+                   OutputIterator out,
+                   const NamedParameters& np = parameters::default_values())
+{
+  using parameters::choose_parameter;
+  using parameters::get_parameter;
+
+  //VertexPointMap
+  typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::type VPMap;
+  VPMap vpmap = choose_parameter(get_parameter(np, internal_np::vertex_point),
+                             get_property_map(vertex_point, pmesh));
+
+  //Kernel
+  typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type Kernel;
+  Kernel traits = choose_parameter<Kernel>(get_parameter(np, internal_np::geom_traits));
+
+  //Face_info
+  typedef typename internal::Triangulate_modifier<PolygonMesh, VPMap, Kernel, internal::Default_visitor<PolygonMesh>>::Face_info Face_info;
+
+  //CDT
+  typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
+  typedef CGAL::Projection_traits_3<Kernel>   P_traits;
+  typedef CGAL::Triangulation_vertex_base_with_info_2<halfedge_descriptor,
+                                                      P_traits>        Vb;
+  typedef CGAL::Triangulation_face_base_with_info_2<Face_info,
+                                                    P_traits>          Fb1;
+  typedef CGAL::Constrained_triangulation_face_base_2<P_traits, Fb1>   Fb;
+  typedef CGAL::Triangulation_data_structure_2<Vb,Fb>                  TDS;
+  typedef CGAL::Exact_intersections_tag                                Itag;
+  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits,
+                                                     TDS,
+                                                     Itag>             CDT;
+  P_traits cdt_traits(normal);
+  CDT cdt(cdt_traits);
+
+  std::size_t original_size = CGAL::halfedges_around_face(halfedge(f, pmesh), pmesh).size();
+
+  // Halfedge_around_facet_circulator
+  typedef typename CDT::Vertex_handle Tr_Vertex_handle;
+  halfedge_descriptor start = halfedge(f, pmesh);
+  halfedge_descriptor h = start;
+  Tr_Vertex_handle previous, first;
+  do
+  {
+    Tr_Vertex_handle vh = cdt.insert(get(_vpmap, target(h, pmesh)));
+    if (first == Tr_Vertex_handle()) {
+      first = vh;
+    }
+    vh->info() = h;
+    if(previous != Tr_Vertex_handle() && previous != vh) {
+      cdt.insert_constraint(previous, vh);
+    }
+    previous = vh;
+    h = next(h, pmesh);
+
+  } while( h != start );
+  cdt.insert_constraint(previous, first);
+
+  // sets mark is_external
+  for(typename CDT::All_faces_iterator fit = cdt.all_faces_begin(),
+        end = cdt.all_faces_end();
+      fit != end; ++fit)
+  {
+    fit->info().is_external = false;
+  }
+  std::queue<typename CDT::Face_handle> face_queue;
+  face_queue.push(cdt.infinite_vertex()->face());
+  while(! face_queue.empty() )
+  {
+    typename CDT::Face_handle fh = face_queue.front();
+    face_queue.pop();
+
+    if(fh->info().is_external)
+      continue;
+
+    fh->info().is_external = true;
+    for(int i = 0; i <3; ++i)
+    {
+      if(!cdt.is_constrained(typename CDT::Edge(fh, i)))
+      {
+        face_queue.push(fh->neighbor(i));
+      }
+    }
+  }
+
+  if(cdt.dimension() != 2 || cdt.number_of_vertices() != original_size)
+    return out;
+
+  for(typename CDT::Finite_edges_iterator eit = cdt.finite_edges_begin(),
+        end = cdt.finite_edges_end();
+      eit != end; ++eit)
+  {
+    typename CDT::Face_handle fh = eit->first;
+    const int index = eit->second;
+    typename CDT::Face_handle opposite_fh = fh->neighbor(eit->second);
+    const int opposite_index = opposite_fh->index(fh);
+
+    const Tr_Vertex_handle va = fh->vertex(cdt. cw(index));
+    const Tr_Vertex_handle vb = fh->vertex(cdt.ccw(index));
+
+    if( ! (is_external(fh) && is_external(opposite_fh))//not both fh are external
+        && ! cdt.is_constrained(*eit) )                  //and edge is not constrained
+    {
+      // strictly internal edge
+      halfedge_descriptor hnew = halfedge(add_edge(pmesh), pmesh),
+        hnewopp = opposite(hnew, pmesh);
+
+      fh->info().e[index] = hnew;
+      opposite_fh->info().e[opposite_index] = hnewopp;
+
+      set_target(hnew,    target(va->info(), pmesh), pmesh);
+      set_target(hnewopp, target(vb->info(), pmesh), pmesh);
+    }
+    if( cdt.is_constrained(*eit) ) //edge is constrained
+    {
+      if(!is_external(fh)) {
+        fh->info().e[index] = va->info();
+      }
+      if(!is_external(opposite_fh)) {
+        opposite_fh->info().e[opposite_index] = vb->info();
+      }
+    }
+  }
+  for(typename CDT::Finite_faces_iterator fit = cdt.finite_faces_begin(),
+        end = cdt.finite_faces_end();
+      fit != end; ++fit)
+  {
+    if(!is_external(fit))
+    {
+      halfedge_descriptor h0 = fit->info().e[0];
+      halfedge_descriptor h1 = fit->info().e[1];
+      halfedge_descriptor h2 = fit->info().e[2];
+      *out++=std::make_tuple(target(h0, pmesh), target(h1, pmesh), target(h2,pmesh));
+    }
+  }
+
+  return out;
+}
+#endif
+
+
+
 /**
 * \ingroup PMP_meshing_grp
 *

From 80e3522eaa294462a26c758745908c5ff5cc9ffb Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 18 Nov 2022 12:56:08 +0200
Subject: [PATCH 0083/1398] incomplete (single vertex curvature)

---
 ...nterpolated_corrected_curvature_measures.h | 465 +++++++++++++++++-
 1 file changed, 455 insertions(+), 10 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 4006b761679f..3f118bdba45d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -598,7 +598,7 @@ namespace internal {
 
   private:
 
-    void interpolated_corrected_all_measures_all_faces()
+    void interpolated_corrected_selected_measures_all_faces()
     {
       std::vector<Vector_3> x;
       std::vector<Vector_3> u;
@@ -629,23 +629,239 @@ namespace internal {
 
     Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(Vertex_descriptor v)
     {
-      Vertex_measures<GT> vertex_curvatures;
+      Vertex_measures<GT> vertex_measures;
 
       for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-        vertex_curvatures.area_measure += get(mu0_map, f);
+        vertex_measures.area_measure += get(mu0_map, f);
 
         if (is_mean_curvature_selected)
-          vertex_curvatures.mean_curvature_measure += get(mu1_map, f);
+          vertex_measures.mean_curvature_measure += get(mu1_map, f);
 
         if (is_gaussian_curvature_selected)
-          vertex_curvatures.gaussian_curvature_measure += get(mu2_map, f);
+          vertex_measures.gaussian_curvature_measure += get(mu2_map, f);
 
         if (is_principal_curvature_selected)
         {
           const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, f);
+          for (std::size_t i = 0; i < 3 * 3; i++)
+            vertex_measures.anisotropic_measure[i] += face_anisotropic_measure[i];
+        }
+      }
+
+      return vertex_measures;
+    }
+
+    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex(Vertex_descriptor v)
+    {
+      std::queue<Face_descriptor> bfs_queue;
+      std::unordered_set<Face_descriptor> bfs_visited;
+
+      Point_3 vp = get(vpm, v);
+      Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
+
+      Vertex_measures<GT> vertex_measures;
+
+      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+        if (f != boost::graph_traits<PolygonMesh>::null_face())
+        {
+          bfs_queue.push(f);
+          bfs_visited.insert(f);
+        }
+      }
+      while (!bfs_queue.empty()) {
+        Face_descriptor fi = bfs_queue.front();
+        bfs_queue.pop();
+
+        // looping over vertices in face to get point coordinates
+        std::vector<Vector_3> x;
+        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+        {
+          Point_3 pi = get(vpm, vi);
+          x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
+        }
+
+        const FT f_ratio = face_in_ball_ratio<GT>(x, ball_radius, c);
+
+        if (f_ratio != 0.0)
+        {
+          vertex_measures.area_measure += f_ratio * get(mu0_map, fi);
+
+          if (is_mean_curvature_selected)
+            vertex_measures.mean_curvature_measure += f_ratio * get(mu1_map, fi);
+
+          if (is_gaussian_curvature_selected)
+            vertex_measures.gaussian_curvature_measure += f_ratio * get(mu2_map, fi);
+
+          if (is_principal_curvature_selected)
+          {
+            const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, fi);
+            for (std::size_t i = 0; i < 3 * 3; i++)
+              vertex_measures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
+          }
+
+          for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+          {
+            if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
+            {
+              bfs_queue.push(fj);
+              bfs_visited.insert(fj);
+            }
+          }
+        }
+      }
+      return vertex_measures;
+    }
+
+    void compute_selected_curvatures() {
+      interpolated_corrected_selected_measures_all_faces();
+
+      for (Vertex_descriptor v : vertices(pmesh))
+      {
+        Vertex_measures<GT> vertex_measures = (ball_radius < 0) ?
+          expand_interpolated_corrected_measure_vertex_no_radius(v) :
+          expand_interpolated_corrected_measure_vertex(v);
+
+        if (is_mean_curvature_selected) {
+          vertex_measures.area_measure != 0 ?
+            put(mean_curvature_map, v, 0.5 * vertex_measures.mean_curvature_measure / vertex_measures.area_measure) :
+            put(mean_curvature_map, v, 0);
+        }
+
+        if (is_gaussian_curvature_selected) {
+          vertex_measures.area_measure != 0 ?
+            put(gaussian_curvature_map, v, vertex_measures.gaussian_curvature_measure / vertex_measures.area_measure) :
+            put(gaussian_curvature_map, v, 0);
+        }
+
+        if (is_principal_curvature_selected) {
+          const Vector_3  v_normal = get(vnm, v);
+          const Principal_curvature<GT> principal_curvature = principal_curvature_from_anisotropic_measures<GT>(
+            vertex_measures.anisotropic_measure,
+            vertex_measures.area_measure,
+            v_normal
+            );
+          put(principal_curvature_map, v, principal_curvature);
+        }
+      }
+    }
+  };
+
+  template<typename PolygonMesh, typename NamedParameters = parameters::Default_named_parameters>
+  class Interpolated_corrected_curvatures_point_computer
+  {
+    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+
+    typedef typename GT::FT FT;
+    typedef typename GT::Point_3 Point_3;
+    typedef typename GT::Vector_3 Vector_3;
+
+    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor Edge_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+
+    typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
+
+    typedef dynamic_vertex_property_t<Vector_3> Vector_map_tag;
+    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
+    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
+      NamedParameters,
+      Default_vector_map>::type Vertex_normal_map;
+
+  private:
+    const PolygonMesh& pmesh;
+    Vertex_position_map vpm;
+    Vertex_normal_map vnm;
+    FT ball_radius;
+
+    bool is_mean_curvature_selected;
+    bool is_gaussian_curvature_selected;
+    bool is_principal_curvature_selected;
+
+    Point_3 point;
+
+    void set_named_params(const NamedParameters& np)
+    {
+      using parameters::choose_parameter;
+      using parameters::get_parameter;
+      using parameters::is_default_parameter;
+
+      vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+        get_const_property_map(CGAL::vertex_point, pmesh));
+
+      vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+        get(Vector_map_tag(), pmesh));
+
+      if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
+        compute_vertex_normals(pmesh, vnm, np);
+
+      const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
+
+      is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
+      is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
+      is_principal_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvature_map_t>::value;
+
+      set_ball_radius(radius);
+    }
+
+    void set_ball_radius(const FT radius) {
+      if (radius == 0)
+        ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+      else
+        ball_radius = radius;
+    }
+
+  public:
+
+    Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,
+      const NamedParameters& np = parameters::default_values()
+    ) :
+      pmesh(pmesh)
+    {
+      set_named_params(np);
+
+      if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvature_selected)
+      {
+        set_property_maps();
+
+        compute_selected_curvatures();
+      }
+    }
+
+  private:
+    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(Vertex_descriptor v)
+    {
+      Vertex_measures<GT> vertex_curvatures;
+
+      std::vector<Vector_3> x;
+      std::vector<Vector_3> u;
+
+      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+        
+        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
+        {
+          Point_3 p = get(vpm, v);
+          x.push_back(Vector_3(p.x(), p.y(), p.z()));
+          u.push_back(get(vnm, v));
+        }
+
+        vertex_curvatures.area_measure += interpolated_corrected_area_measure_face<GT>(u, x);
+
+        if (is_mean_curvature_selected)
+          vertex_curvatures.mean_curvature_measure += interpolated_corrected_mean_curvature_measure_face<GT>(u, x);
+
+        if (is_gaussian_curvature_selected)
+          vertex_curvatures.gaussian_curvature_measure += interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x);
+
+        if (is_principal_curvature_selected)
+        {
+          const std::array<FT, 3 * 3> face_anisotropic_measure = interpolated_corrected_anisotropic_measure_face<GT>(u, x);
           for (std::size_t i = 0; i < 3 * 3; i++)
             vertex_curvatures.anisotropic_measure[i] += face_anisotropic_measure[i];
         }
+
+        x.clear();
+        u.clear();
       }
 
       return vertex_curvatures;
@@ -668,12 +884,15 @@ namespace internal {
           bfs_visited.insert(f);
         }
       }
+
+      std::vector<Vector_3> x;
+      std::vector<Vector_3> u;
+
       while (!bfs_queue.empty()) {
         Face_descriptor fi = bfs_queue.front();
         bfs_queue.pop();
 
         // looping over vertices in face to get point coordinates
-        std::vector<Vector_3> x;
         for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
         {
           Point_3 pi = get(vpm, vi);
@@ -684,6 +903,11 @@ namespace internal {
 
         if (f_ratio != 0.0)
         {
+          for (Vertex_descriptor vi : vertices_around_face(halfedge(f, pmesh), pmesh))
+          {
+            u.push_back(get(vnm, vi));
+          }
+
           vertex_curvatures.area_measure += f_ratio * get(mu0_map, fi);
 
           if (is_mean_curvature_selected)
@@ -699,6 +923,9 @@ namespace internal {
               vertex_curvatures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
           }
 
+          x.clear();
+          u.clear();
+
           for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
           {
             if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
@@ -713,13 +940,11 @@ namespace internal {
     }
 
     void compute_selected_curvatures() {
-      interpolated_corrected_all_measures_all_faces();
-
       for (Vertex_descriptor v : vertices(pmesh))
       {
         Vertex_measures<GT> vertex_curvatures = (ball_radius < 0) ?
-          expand_interpolated_corrected_measure_vertex_no_radius(v) :
-          expand_interpolated_corrected_measure_vertex(v);
+          compute_expanded_interpolated_corrected_measure_vertex_no_radius(v) :
+          compute_expanded_interpolated_corrected_measure_vertex(v);
 
         if (is_mean_curvature_selected) {
           vertex_curvatures.area_measure != 0 ?
@@ -745,7 +970,227 @@ namespace internal {
       }
     }
 
+  };
 
+  template<typename PolygonMesh, typename NamedParameters = parameters::Default_named_parameters>
+  class Interpolated_corrected_curvatures_element_computer
+  {
+    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+
+    typedef typename GT::FT FT;
+    typedef typename GT::Point_3 Point_3;
+    typedef typename GT::Vector_3 Vector_3;
+
+    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor Edge_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+
+    typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
+
+    typedef dynamic_vertex_property_t<Vector_3> Vector_map_tag;
+    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
+    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
+      NamedParameters,
+      Default_vector_map>::type Vertex_normal_map;
+
+  private:
+    const PolygonMesh& pmesh;
+    Vertex_position_map vpm;
+    Vertex_normal_map vnm;
+    FT ball_radius;
+
+    bool is_mean_curvature_selected;
+    bool is_gaussian_curvature_selected;
+    bool is_principal_curvature_selected;
+
+    void set_named_params(const NamedParameters& np)
+    {
+      using parameters::choose_parameter;
+      using parameters::get_parameter;
+      using parameters::is_default_parameter;
+
+      vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+        get_const_property_map(CGAL::vertex_point, pmesh));
+
+      vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+        get(Vector_map_tag(), pmesh));
+
+      if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
+        compute_vertex_normals(pmesh, vnm, np);
+
+      const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
+
+      is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
+      is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
+      is_principal_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvature_map_t>::value;
+
+      set_ball_radius(radius);
+    }
+
+    void set_ball_radius(const FT radius) {
+      if (radius == 0)
+        ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+      else
+        ball_radius = radius;
+    }
+
+  public:
+
+    Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,
+      const NamedParameters& np = parameters::default_values()
+    ) :
+      pmesh(pmesh)
+    {
+      set_named_params(np);
+
+      if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvature_selected)
+      {
+        set_property_maps();
+      }
+    }
+
+  private:
+    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(Vertex_descriptor v)
+    {
+      Vertex_measures<GT> vertex_curvatures;
+
+      std::vector<Vector_3> x;
+      std::vector<Vector_3> u;
+
+      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+
+        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
+        {
+          Point_3 p = get(vpm, v);
+          x.push_back(Vector_3(p.x(), p.y(), p.z()));
+          u.push_back(get(vnm, v));
+        }
+
+        vertex_curvatures.area_measure += interpolated_corrected_area_measure_face<GT>(u, x);
+
+        if (is_mean_curvature_selected)
+          vertex_curvatures.mean_curvature_measure += interpolated_corrected_mean_curvature_measure_face<GT>(u, x);
+
+        if (is_gaussian_curvature_selected)
+          vertex_curvatures.gaussian_curvature_measure += interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x);
+
+        if (is_principal_curvature_selected)
+        {
+          const std::array<FT, 3 * 3> face_anisotropic_measure = interpolated_corrected_anisotropic_measure_face<GT>(u, x);
+          for (std::size_t i = 0; i < 3 * 3; i++)
+            vertex_curvatures.anisotropic_measure[i] += face_anisotropic_measure[i];
+        }
+
+        x.clear();
+        u.clear();
+      }
+
+      return vertex_curvatures;
+    }
+
+    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex(Vertex_descriptor v)
+    {
+      std::queue<Face_descriptor> bfs_queue;
+      std::unordered_set<Face_descriptor> bfs_visited;
+
+      Point_3 vp = get(vpm, v);
+      Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
+
+      Vertex_measures<GT> vertex_curvatures;
+
+      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+        if (f != boost::graph_traits<PolygonMesh>::null_face())
+        {
+          bfs_queue.push(f);
+          bfs_visited.insert(f);
+        }
+      }
+
+      std::vector<Vector_3> x;
+      std::vector<Vector_3> u;
+
+      while (!bfs_queue.empty()) {
+        Face_descriptor fi = bfs_queue.front();
+        bfs_queue.pop();
+
+        // looping over vertices in face to get point coordinates
+        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+        {
+          Point_3 pi = get(vpm, vi);
+          x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
+        }
+
+        const FT f_ratio = face_in_ball_ratio<GT>(x, ball_radius, c);
+
+        if (f_ratio != 0.0)
+        {
+          for (Vertex_descriptor vi : vertices_around_face(halfedge(f, pmesh), pmesh))
+          {
+            u.push_back(get(vnm, vi));
+          }
+
+          vertex_curvatures.area_measure += f_ratio * get(mu0_map, fi);
+
+          if (is_mean_curvature_selected)
+            vertex_curvatures.mean_curvature_measure += f_ratio * get(mu1_map, fi);
+
+          if (is_gaussian_curvature_selected)
+            vertex_curvatures.gaussian_curvature_measure += f_ratio * get(mu2_map, fi);
+
+          if (is_principal_curvature_selected)
+          {
+            const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, fi);
+            for (std::size_t i = 0; i < 3 * 3; i++)
+              vertex_curvatures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
+          }
+
+          x.clear();
+          u.clear();
+
+          for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+          {
+            if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
+            {
+              bfs_queue.push(fj);
+              bfs_visited.insert(fj);
+            }
+          }
+        }
+      }
+      return vertex_curvatures;
+    }
+
+    void compute_selected_curvatures() {
+      for (Vertex_descriptor v : vertices(pmesh))
+      {
+        Vertex_measures<GT> vertex_curvatures = (ball_radius < 0) ?
+          compute_expanded_interpolated_corrected_measure_vertex_no_radius(v) :
+          compute_expanded_interpolated_corrected_measure_vertex(v);
+
+        if (is_mean_curvature_selected) {
+          vertex_curvatures.area_measure != 0 ?
+            put(mean_curvature_map, v, 0.5 * vertex_curvatures.mean_curvature_measure / vertex_curvatures.area_measure) :
+            put(mean_curvature_map, v, 0);
+        }
+
+        if (is_gaussian_curvature_selected) {
+          vertex_curvatures.area_measure != 0 ?
+            put(gaussian_curvature_map, v, vertex_curvatures.gaussian_curvature_measure / vertex_curvatures.area_measure) :
+            put(gaussian_curvature_map, v, 0);
+        }
+
+        if (is_principal_curvature_selected) {
+          const Vector_3  v_normal = get(vnm, v);
+          const Principal_curvature<GT> principal_curvature = principal_curvature_from_anisotropic_measures<GT>(
+            vertex_curvatures.anisotropic_measure,
+            vertex_curvatures.area_measure,
+            v_normal
+            );
+          put(principal_curvature_map, v, principal_curvature);
+        }
+      }
+    }
 
   };
 

From e302b02f764301209548fae1c435f8a92c892d02 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 19 Nov 2022 11:02:26 +0200
Subject: [PATCH 0084/1398] Docs: adding bibtex, ack of DGtal, Authors +
 Renaming vars + minor fix

+ removing last commit's approach
---
 Documentation/doc/biblio/geom.bib             |  11 +
 .../PackageDescription.txt                    |   2 +-
 .../Polygon_mesh_processing.txt               |  11 +-
 ...erpolated_corrected_curvatures_example.cpp |  14 +-
 ...orrected_curvatures_polyhedron_example.cpp |  10 +-
 ...nterpolated_corrected_curvature_measures.h | 496 +-----------------
 ..._corrected_principal_curvatures_plugin.cpp |  22 +-
 .../internal/parameters_interface.h           |   2 +-
 8 files changed, 66 insertions(+), 502 deletions(-)

diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib
index 270f537e1394..37c42071a85f 100644
--- a/Documentation/doc/biblio/geom.bib
+++ b/Documentation/doc/biblio/geom.bib
@@ -152060,6 +152060,7 @@ @article{cvl-ew-12
 	Pages                    = {215--224},
 	Year                     = {2012},
 	Url                      = {http://monge.univ-mlv.fr/~colinde/pub/09edgewidth.pdf}
+}
 
 @inproceedings{tang2009interactive,
   title={Interactive Hausdorff distance computation for general polygonal models},
@@ -152071,3 +152072,13 @@ @inproceedings{tang2009interactive
   year={2009},
   organization={ACM}
 }
+
+@article{lachaud2020,
+  author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert and David Coeurjolly},
+  journal = {Computer Graphics Forum (Proceedings of Symposium on Geometry Processing)},
+  number = {5},
+  title = {Interpolated corrected curvature measures for polygonal surfaces},
+  volume = {39},
+  month = jul,
+  year = {2020}
+}
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 93f25c89f1fb..5090535be250 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -203,7 +203,7 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 \cgalCRPSection{Corrected Curvature Functions}
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
 - `CGAL::Polygon_mesh_processing::Principal_curvature`
 
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 7932051ec000..2347ae1c7ae8 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -879,10 +879,7 @@ not provide storage for the normals.
 ****************************************
 \section PMPICC Computing Curvatures
 
-This package provides methods to compute curvatures on polygonal meshes based on
-<a href="https://perso.liris.cnrs.fr/david.coeurjolly/publication/lachaud2020/">
-  Interpolated corrected curvature measures for polygonal surfaces
-</a>.
+This package provides methods to compute curvatures on polygonal meshes based on \cgalCite{lachaud2020}
 This includes mean curvature, gaussian curvature, principal curvatures and directions.
 These can be computed on triangle meshes, quad meshes, and meshes with n-gon faces.
 The algorithms used prove to work well in general. Also, on meshes with noise
@@ -895,7 +892,7 @@ Polyhedron_3 and other polygonal mesh structures based on the Face Graph Model.
 These computations are performed using :
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
 
 Where it is recommended to use the last function for computing multiple curvatures (example: mean and gaussian)
@@ -1145,6 +1142,10 @@ available on 7th of October 2020.  It only uses the high level algorithm of chec
 is covered by a set of prisms, where each prism is an offset for an input triangle.
 That is, the implementation in \cgal does not use indirect predicates.
 
+The interpolated corrected curvatures were implemented during GSoC 2022. This was implemented by Hossam Saeed and under
+supervision of Sebastien Loriot, Jaques-Olivier Lachaud and David Coeurjolly. The implementation is based \cgalCite{lachaud2020}.
+<a href="https://dgtal-team.github.io/doc-nightly/moduleCurvatureMeasures.html">DGtal's implementation</a> was also
+used as a reference during the project.
 
 */
 } /* namespace CGAL */
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index 7bf182c3ce3d..71aa06a8caec 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -38,10 +38,10 @@ int main(int argc, char* argv[])
   assert(created);
 
   // we use a tuple of 2 scalar values and 2 vectors for principal curvatures and directions
-  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvature<Epic_kernel>> principal_curvature_map;
+  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvature<Epic_kernel>> principal_curvatures_and_directions_map;
 
-  boost::tie(principal_curvature_map, created) = smesh.add_property_map<vertex_descriptor, PMP::Principal_curvature<Epic_kernel>>
-    ("v:principal_curvature_map", { 0, 0,
+  boost::tie(principal_curvatures_and_directions_map, created) = smesh.add_property_map<vertex_descriptor, PMP::Principal_curvature<Epic_kernel>>
+    ("v:principal_curvatures_and_directions_map", { 0, 0,
         Epic_kernel::Vector_3(0,0,0),
         Epic_kernel::Vector_3(0,0,0) });
   assert(created);
@@ -57,9 +57,9 @@ int main(int argc, char* argv[])
     gaussian_curvature_map
   );
 
-  PMP::interpolated_corrected_principal_curvatures(
+  PMP::interpolated_corrected_principal_curvatures_and_directions(
     smesh,
-    principal_curvature_map
+    principal_curvatures_and_directions_map
   );
 
   // uncomment this to compute a curvature while specifying named parameters
@@ -83,12 +83,12 @@ int main(int argc, char* argv[])
   PMP::interpolated_corrected_curvatures(
     smesh,
     CGAL::parameters::vertex_mean_curvature_map(mean_curvature_map)
-    .vertex_principal_curvature_map(principal_curvature_map)
+    .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map)
   );
 
   for (vertex_descriptor v : vertices(smesh))
   {
-    auto PC = principal_curvature_map[v];
+    auto PC = principal_curvatures_and_directions_map[v];
     std::cout << v.idx() << ": HC = " << mean_curvature_map[v]
       << ", GC = " << gaussian_curvature_map[v] << "\n"
       << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
index 929fc8d96a67..50fe1a014d8e 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
@@ -31,7 +31,7 @@ int main(int argc, char *argv[])
       mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron),
       gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
   boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<PMP::Principal_curvature<Epic_kernel>>>::type
-      principal_curvature_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvature<Epic_kernel>>(), polyhedron);
+      principal_curvatures_and_directions_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvature<Epic_kernel>>(), polyhedron);
 
   PMP::interpolated_corrected_mean_curvature(
       polyhedron,
@@ -41,9 +41,9 @@ int main(int argc, char *argv[])
       polyhedron,
       gaussian_curvature_map);
 
-  PMP::interpolated_corrected_principal_curvatures(
+  PMP::interpolated_corrected_principal_curvatures_and_directions(
       polyhedron,
-      principal_curvature_map);
+      principal_curvatures_and_directions_map);
 
   // uncomment this to compute a curvature while specifying named parameters
   // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)
@@ -61,12 +61,12 @@ int main(int argc, char *argv[])
   PMP::interpolated_corrected_curvatures(
       polyhedron,
       CGAL::parameters::vertex_mean_curvature_map(mean_curvature_map)
-          .vertex_principal_curvature_map(principal_curvature_map));
+          .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map));
 
   int i = 0;
   for (vertex_descriptor v : vertices(polyhedron))
   {
-    auto PC = get(principal_curvature_map, v);
+    auto PC = get(principal_curvatures_and_directions_map, v);
     std::cout << i << ": HC = " << get(mean_curvature_map, v)
               << ", GC = " << get(gaussian_curvature_map, v) << "\n"
               << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 3f118bdba45d..3b02341a2129 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -70,10 +70,10 @@ struct Principal_curvature {
     typename GT::Vector_3 min_direction,
     typename GT::Vector_3 max_direction
   ) {
-    min_curvature = min_curvature;
-    max_curvature = max_curvature;
-    min_direction = min_direction;
-    max_direction = max_direction;
+    this->min_curvature = min_curvature;
+    this->max_curvature = max_curvature;
+    this->min_direction = min_direction;
+    this->max_direction = max_direction;
   }
 };
 
@@ -440,7 +440,7 @@ namespace internal {
   }
 
   template<typename GT>
-  Principal_curvature<GT> principal_curvature_from_anisotropic_measures(
+  Principal_curvature<GT> principal_curvatures_and_directions_from_anisotropic_measures(
     const std::array<typename GT::FT, 3 * 3> anisotropic_measure,
     const typename GT::FT v_mu0,
     const typename GT::Vector_3 u_GT
@@ -510,9 +510,9 @@ namespace internal {
       Default_scalar_map>::type Vertex_gaussian_curvature_map;
 
     typedef Constant_property_map<Vertex_descriptor, Principal_curvature<GT>> Default_principal_map;
-    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvature_map_t,
+    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvatures_and_directions_map_t,
       NamedParameters,
-      Default_principal_map>::type Vertex_principal_curvature_map;
+      Default_principal_map>::type Vertex_principal_curvatures_and_directions_map;
 
     typedef typename boost::property_map<PolygonMesh,
       CGAL::dynamic_face_property_t<FT>>::const_type Face_scalar_measure_map;
@@ -527,11 +527,11 @@ namespace internal {
 
     bool is_mean_curvature_selected;
     bool is_gaussian_curvature_selected;
-    bool is_principal_curvature_selected;
+    bool is_principal_curvatures_and_directions_selected;
 
     Vertex_mean_curvature_map mean_curvature_map;
     Vertex_gaussian_curvature_map gaussian_curvature_map;
-    Vertex_principal_curvature_map principal_curvature_map;
+    Vertex_principal_curvatures_and_directions_map principal_curvatures_and_directions_map;
 
     Face_scalar_measure_map mu0_map, mu1_map, mu2_map;
     Face_anisotropic_measure_map muXY_map;
@@ -563,11 +563,11 @@ namespace internal {
 
       is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
       is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
-      is_principal_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvature_map_t>::value;
+      is_principal_curvatures_and_directions_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvatures_and_directions_map_t>::value;
 
       mean_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature_map), Default_scalar_map());
       gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature_map), Default_scalar_map());
-      principal_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvature_map), Default_principal_map());
+      principal_curvatures_and_directions_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvatures_and_directions_map), Default_principal_map());
 
       set_ball_radius(radius);
     }
@@ -588,7 +588,7 @@ namespace internal {
     {
       set_named_params(np);
 
-      if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvature_selected)
+      if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvatures_and_directions_selected)
       {
         set_property_maps();
 
@@ -619,7 +619,7 @@ namespace internal {
         if (is_gaussian_curvature_selected)
           put(mu2_map, f, interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x));
 
-        if (is_principal_curvature_selected)
+        if (is_principal_curvatures_and_directions_selected)
           put(muXY_map, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
 
         x.clear();
@@ -640,7 +640,7 @@ namespace internal {
         if (is_gaussian_curvature_selected)
           vertex_measures.gaussian_curvature_measure += get(mu2_map, f);
 
-        if (is_principal_curvature_selected)
+        if (is_principal_curvatures_and_directions_selected)
         {
           const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, f);
           for (std::size_t i = 0; i < 3 * 3; i++)
@@ -692,7 +692,7 @@ namespace internal {
           if (is_gaussian_curvature_selected)
             vertex_measures.gaussian_curvature_measure += f_ratio * get(mu2_map, fi);
 
-          if (is_principal_curvature_selected)
+          if (is_principal_curvatures_and_directions_selected)
           {
             const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, fi);
             for (std::size_t i = 0; i < 3 * 3; i++)
@@ -733,467 +733,19 @@ namespace internal {
             put(gaussian_curvature_map, v, 0);
         }
 
-        if (is_principal_curvature_selected) {
+        if (is_principal_curvatures_and_directions_selected) {
           const Vector_3  v_normal = get(vnm, v);
-          const Principal_curvature<GT> principal_curvature = principal_curvature_from_anisotropic_measures<GT>(
+          const Principal_curvature<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
             vertex_measures.anisotropic_measure,
             vertex_measures.area_measure,
             v_normal
             );
-          put(principal_curvature_map, v, principal_curvature);
+          put(principal_curvatures_and_directions_map, v, principal_curvatures_and_directions);
         }
       }
     }
   };
 
-  template<typename PolygonMesh, typename NamedParameters = parameters::Default_named_parameters>
-  class Interpolated_corrected_curvatures_point_computer
-  {
-    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-
-    typedef typename GT::FT FT;
-    typedef typename GT::Point_3 Point_3;
-    typedef typename GT::Vector_3 Vector_3;
-
-    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor Edge_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-
-    typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
-
-    typedef dynamic_vertex_property_t<Vector_3> Vector_map_tag;
-    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
-    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
-      NamedParameters,
-      Default_vector_map>::type Vertex_normal_map;
-
-  private:
-    const PolygonMesh& pmesh;
-    Vertex_position_map vpm;
-    Vertex_normal_map vnm;
-    FT ball_radius;
-
-    bool is_mean_curvature_selected;
-    bool is_gaussian_curvature_selected;
-    bool is_principal_curvature_selected;
-
-    Point_3 point;
-
-    void set_named_params(const NamedParameters& np)
-    {
-      using parameters::choose_parameter;
-      using parameters::get_parameter;
-      using parameters::is_default_parameter;
-
-      vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-        get_const_property_map(CGAL::vertex_point, pmesh));
-
-      vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
-        get(Vector_map_tag(), pmesh));
-
-      if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
-        compute_vertex_normals(pmesh, vnm, np);
-
-      const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
-
-      is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
-      is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
-      is_principal_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvature_map_t>::value;
-
-      set_ball_radius(radius);
-    }
-
-    void set_ball_radius(const FT radius) {
-      if (radius == 0)
-        ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
-      else
-        ball_radius = radius;
-    }
-
-  public:
-
-    Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,
-      const NamedParameters& np = parameters::default_values()
-    ) :
-      pmesh(pmesh)
-    {
-      set_named_params(np);
-
-      if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvature_selected)
-      {
-        set_property_maps();
-
-        compute_selected_curvatures();
-      }
-    }
-
-  private:
-    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(Vertex_descriptor v)
-    {
-      Vertex_measures<GT> vertex_curvatures;
-
-      std::vector<Vector_3> x;
-      std::vector<Vector_3> u;
-
-      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-        
-        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
-        {
-          Point_3 p = get(vpm, v);
-          x.push_back(Vector_3(p.x(), p.y(), p.z()));
-          u.push_back(get(vnm, v));
-        }
-
-        vertex_curvatures.area_measure += interpolated_corrected_area_measure_face<GT>(u, x);
-
-        if (is_mean_curvature_selected)
-          vertex_curvatures.mean_curvature_measure += interpolated_corrected_mean_curvature_measure_face<GT>(u, x);
-
-        if (is_gaussian_curvature_selected)
-          vertex_curvatures.gaussian_curvature_measure += interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x);
-
-        if (is_principal_curvature_selected)
-        {
-          const std::array<FT, 3 * 3> face_anisotropic_measure = interpolated_corrected_anisotropic_measure_face<GT>(u, x);
-          for (std::size_t i = 0; i < 3 * 3; i++)
-            vertex_curvatures.anisotropic_measure[i] += face_anisotropic_measure[i];
-        }
-
-        x.clear();
-        u.clear();
-      }
-
-      return vertex_curvatures;
-    }
-
-    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex(Vertex_descriptor v)
-    {
-      std::queue<Face_descriptor> bfs_queue;
-      std::unordered_set<Face_descriptor> bfs_visited;
-
-      Point_3 vp = get(vpm, v);
-      Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
-
-      Vertex_measures<GT> vertex_curvatures;
-
-      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-        if (f != boost::graph_traits<PolygonMesh>::null_face())
-        {
-          bfs_queue.push(f);
-          bfs_visited.insert(f);
-        }
-      }
-
-      std::vector<Vector_3> x;
-      std::vector<Vector_3> u;
-
-      while (!bfs_queue.empty()) {
-        Face_descriptor fi = bfs_queue.front();
-        bfs_queue.pop();
-
-        // looping over vertices in face to get point coordinates
-        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
-        {
-          Point_3 pi = get(vpm, vi);
-          x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
-        }
-
-        const FT f_ratio = face_in_ball_ratio<GT>(x, ball_radius, c);
-
-        if (f_ratio != 0.0)
-        {
-          for (Vertex_descriptor vi : vertices_around_face(halfedge(f, pmesh), pmesh))
-          {
-            u.push_back(get(vnm, vi));
-          }
-
-          vertex_curvatures.area_measure += f_ratio * get(mu0_map, fi);
-
-          if (is_mean_curvature_selected)
-            vertex_curvatures.mean_curvature_measure += f_ratio * get(mu1_map, fi);
-
-          if (is_gaussian_curvature_selected)
-            vertex_curvatures.gaussian_curvature_measure += f_ratio * get(mu2_map, fi);
-
-          if (is_principal_curvature_selected)
-          {
-            const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, fi);
-            for (std::size_t i = 0; i < 3 * 3; i++)
-              vertex_curvatures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
-          }
-
-          x.clear();
-          u.clear();
-
-          for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
-          {
-            if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
-            {
-              bfs_queue.push(fj);
-              bfs_visited.insert(fj);
-            }
-          }
-        }
-      }
-      return vertex_curvatures;
-    }
-
-    void compute_selected_curvatures() {
-      for (Vertex_descriptor v : vertices(pmesh))
-      {
-        Vertex_measures<GT> vertex_curvatures = (ball_radius < 0) ?
-          compute_expanded_interpolated_corrected_measure_vertex_no_radius(v) :
-          compute_expanded_interpolated_corrected_measure_vertex(v);
-
-        if (is_mean_curvature_selected) {
-          vertex_curvatures.area_measure != 0 ?
-            put(mean_curvature_map, v, 0.5 * vertex_curvatures.mean_curvature_measure / vertex_curvatures.area_measure) :
-            put(mean_curvature_map, v, 0);
-        }
-
-        if (is_gaussian_curvature_selected) {
-          vertex_curvatures.area_measure != 0 ?
-            put(gaussian_curvature_map, v, vertex_curvatures.gaussian_curvature_measure / vertex_curvatures.area_measure) :
-            put(gaussian_curvature_map, v, 0);
-        }
-
-        if (is_principal_curvature_selected) {
-          const Vector_3  v_normal = get(vnm, v);
-          const Principal_curvature<GT> principal_curvature = principal_curvature_from_anisotropic_measures<GT>(
-            vertex_curvatures.anisotropic_measure,
-            vertex_curvatures.area_measure,
-            v_normal
-            );
-          put(principal_curvature_map, v, principal_curvature);
-        }
-      }
-    }
-
-  };
-
-  template<typename PolygonMesh, typename NamedParameters = parameters::Default_named_parameters>
-  class Interpolated_corrected_curvatures_element_computer
-  {
-    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-
-    typedef typename GT::FT FT;
-    typedef typename GT::Point_3 Point_3;
-    typedef typename GT::Vector_3 Vector_3;
-
-    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor Edge_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-
-    typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
-
-    typedef dynamic_vertex_property_t<Vector_3> Vector_map_tag;
-    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
-    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
-      NamedParameters,
-      Default_vector_map>::type Vertex_normal_map;
-
-  private:
-    const PolygonMesh& pmesh;
-    Vertex_position_map vpm;
-    Vertex_normal_map vnm;
-    FT ball_radius;
-
-    bool is_mean_curvature_selected;
-    bool is_gaussian_curvature_selected;
-    bool is_principal_curvature_selected;
-
-    void set_named_params(const NamedParameters& np)
-    {
-      using parameters::choose_parameter;
-      using parameters::get_parameter;
-      using parameters::is_default_parameter;
-
-      vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-        get_const_property_map(CGAL::vertex_point, pmesh));
-
-      vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
-        get(Vector_map_tag(), pmesh));
-
-      if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
-        compute_vertex_normals(pmesh, vnm, np);
-
-      const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
-
-      is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
-      is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
-      is_principal_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvature_map_t>::value;
-
-      set_ball_radius(radius);
-    }
-
-    void set_ball_radius(const FT radius) {
-      if (radius == 0)
-        ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
-      else
-        ball_radius = radius;
-    }
-
-  public:
-
-    Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,
-      const NamedParameters& np = parameters::default_values()
-    ) :
-      pmesh(pmesh)
-    {
-      set_named_params(np);
-
-      if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvature_selected)
-      {
-        set_property_maps();
-      }
-    }
-
-  private:
-    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(Vertex_descriptor v)
-    {
-      Vertex_measures<GT> vertex_curvatures;
-
-      std::vector<Vector_3> x;
-      std::vector<Vector_3> u;
-
-      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-
-        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
-        {
-          Point_3 p = get(vpm, v);
-          x.push_back(Vector_3(p.x(), p.y(), p.z()));
-          u.push_back(get(vnm, v));
-        }
-
-        vertex_curvatures.area_measure += interpolated_corrected_area_measure_face<GT>(u, x);
-
-        if (is_mean_curvature_selected)
-          vertex_curvatures.mean_curvature_measure += interpolated_corrected_mean_curvature_measure_face<GT>(u, x);
-
-        if (is_gaussian_curvature_selected)
-          vertex_curvatures.gaussian_curvature_measure += interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x);
-
-        if (is_principal_curvature_selected)
-        {
-          const std::array<FT, 3 * 3> face_anisotropic_measure = interpolated_corrected_anisotropic_measure_face<GT>(u, x);
-          for (std::size_t i = 0; i < 3 * 3; i++)
-            vertex_curvatures.anisotropic_measure[i] += face_anisotropic_measure[i];
-        }
-
-        x.clear();
-        u.clear();
-      }
-
-      return vertex_curvatures;
-    }
-
-    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex(Vertex_descriptor v)
-    {
-      std::queue<Face_descriptor> bfs_queue;
-      std::unordered_set<Face_descriptor> bfs_visited;
-
-      Point_3 vp = get(vpm, v);
-      Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
-
-      Vertex_measures<GT> vertex_curvatures;
-
-      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-        if (f != boost::graph_traits<PolygonMesh>::null_face())
-        {
-          bfs_queue.push(f);
-          bfs_visited.insert(f);
-        }
-      }
-
-      std::vector<Vector_3> x;
-      std::vector<Vector_3> u;
-
-      while (!bfs_queue.empty()) {
-        Face_descriptor fi = bfs_queue.front();
-        bfs_queue.pop();
-
-        // looping over vertices in face to get point coordinates
-        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
-        {
-          Point_3 pi = get(vpm, vi);
-          x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
-        }
-
-        const FT f_ratio = face_in_ball_ratio<GT>(x, ball_radius, c);
-
-        if (f_ratio != 0.0)
-        {
-          for (Vertex_descriptor vi : vertices_around_face(halfedge(f, pmesh), pmesh))
-          {
-            u.push_back(get(vnm, vi));
-          }
-
-          vertex_curvatures.area_measure += f_ratio * get(mu0_map, fi);
-
-          if (is_mean_curvature_selected)
-            vertex_curvatures.mean_curvature_measure += f_ratio * get(mu1_map, fi);
-
-          if (is_gaussian_curvature_selected)
-            vertex_curvatures.gaussian_curvature_measure += f_ratio * get(mu2_map, fi);
-
-          if (is_principal_curvature_selected)
-          {
-            const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, fi);
-            for (std::size_t i = 0; i < 3 * 3; i++)
-              vertex_curvatures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
-          }
-
-          x.clear();
-          u.clear();
-
-          for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
-          {
-            if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
-            {
-              bfs_queue.push(fj);
-              bfs_visited.insert(fj);
-            }
-          }
-        }
-      }
-      return vertex_curvatures;
-    }
-
-    void compute_selected_curvatures() {
-      for (Vertex_descriptor v : vertices(pmesh))
-      {
-        Vertex_measures<GT> vertex_curvatures = (ball_radius < 0) ?
-          compute_expanded_interpolated_corrected_measure_vertex_no_radius(v) :
-          compute_expanded_interpolated_corrected_measure_vertex(v);
-
-        if (is_mean_curvature_selected) {
-          vertex_curvatures.area_measure != 0 ?
-            put(mean_curvature_map, v, 0.5 * vertex_curvatures.mean_curvature_measure / vertex_curvatures.area_measure) :
-            put(mean_curvature_map, v, 0);
-        }
-
-        if (is_gaussian_curvature_selected) {
-          vertex_curvatures.area_measure != 0 ?
-            put(gaussian_curvature_map, v, vertex_curvatures.gaussian_curvature_measure / vertex_curvatures.area_measure) :
-            put(gaussian_curvature_map, v, 0);
-        }
-
-        if (is_principal_curvature_selected) {
-          const Vector_3  v_normal = get(vnm, v);
-          const Principal_curvature<GT> principal_curvature = principal_curvature_from_anisotropic_measures<GT>(
-            vertex_curvatures.anisotropic_measure,
-            vertex_curvatures.area_measure,
-            v_normal
-            );
-          put(principal_curvature_map, v, principal_curvature);
-        }
-      }
-    }
-
-  };
-
 } // namespace internal
 
 /**
@@ -1247,7 +799,7 @@ namespace internal {
 * \cgalNamedParamsEnd
 *
 * @see `interpolated_corrected_gaussian_curvature()`
-* @see `interpolated_corrected_principal_curvatures()`
+* @see `interpolated_corrected_principal_curvatures_and_directions()`
 * @see `interpolated_corrected_curvatures()`
 */
 
@@ -1311,7 +863,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * \cgalNamedParamsEnd
 *
 * @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_principal_curvatures()`
+* @see `interpolated_corrected_principal_curvatures_and_directions()`
 * @see `interpolated_corrected_curvatures()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
@@ -1380,11 +932,11 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
   typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_principal_curvatures(const PolygonMesh& pmesh,
+  void interpolated_corrected_principal_curvatures_and_directions(const PolygonMesh& pmesh,
     VertexCurvatureMap& vcm,
     NamedParameters& np = parameters::default_values())
 {
-  interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvature_map(vcm));
+  interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvatures_and_directions_map(vcm));
 }
 
 /**
@@ -1441,7 +993,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *   \cgalParamNEnd
 *
 *
-*   \cgalParamNBegin{vertex_principal_curvature_map}
+*   \cgalParamNBegin{vertex_principal_curvatures_and_directions_map}
 *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
@@ -1465,7 +1017,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *
 * @see `interpolated_corrected_mean_curvature()`
 * @see `interpolated_corrected_gaussian_curvature()`
-* @see `interpolated_corrected_principal_curvatures()`
+* @see `interpolated_corrected_principal_curvatures_and_directions()`
 */
 template<typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
index 21b292b05d0c..09df28bc2816 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
@@ -14,7 +14,7 @@
 #include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
 
 using namespace CGAL::Three;
-class Polyhedron_demo_interpolated_corrected_principal_curvatures_plugin :
+class Polyhedron_demo_interpolated_corrected_principal_curvatures_and_directions_plugin :
   public QObject,
   public Polyhedron_demo_plugin_interface
 {
@@ -47,7 +47,7 @@ public Q_SLOTS:
 private :
   Scene_interface *scene;
   QList<QAction*> _actions;
-}; // end Polyhedron_demo_interpolated_corrected_principal_curvatures_plugin
+}; // end Polyhedron_demo_interpolated_corrected_principal_curvatures_and_directions_plugin
 
 
 void compute(SMesh* sMesh,
@@ -72,23 +72,23 @@ void compute(SMesh* sMesh,
   typename boost::property_map<SMesh, CGAL::vertex_point_t>::type vpmap = get(CGAL::vertex_point, *sMesh);
 
   bool created = false;
-  SMesh::Property_map<vertex_descriptor, PrincipalCurvatureTuple> principal_curvature_map;
+  SMesh::Property_map<vertex_descriptor, PrincipalCurvatureTuple> principal_curvatures_and_directions_map;
 
-  boost::tie(principal_curvature_map, created) = sMesh->add_property_map<vertex_descriptor, PrincipalCurvatureTuple>
-      ("v:principal_curvature_map", { 0, 0,
+  boost::tie(principal_curvatures_and_directions_map, created) = sMesh->add_property_map<vertex_descriptor, PrincipalCurvatureTuple>
+      ("v:principal_curvatures_and_directions_map", { 0, 0,
               Vector(0,0,0),
               Vector(0,0,0)});
       assert(created);
 
-  PMP::interpolated_corrected_principal_curvatures(
+  PMP::interpolated_corrected_principal_curvatures_and_directions(
       *sMesh,
-      principal_curvature_map
+      principal_curvatures_and_directions_map
   );
 
   typename EpicKernel::FT max_curvature_magnitude_on_mesh = 0;
   for (vertex_descriptor v : vertices(*sMesh))
   {
-      const PrincipalCurvatureTuple pc = principal_curvature_map[v];
+      const PrincipalCurvatureTuple pc = principal_curvatures_and_directions_map[v];
       max_curvature_magnitude_on_mesh = std::max(max_curvature_magnitude_on_mesh, std::max(abs(get<0>(pc)), get<1>(pc)));
   }
 
@@ -114,7 +114,7 @@ void compute(SMesh* sMesh,
         avg_edge_length /= n;
     }
 
-    const PrincipalCurvatureTuple pc = principal_curvature_map[v];
+    const PrincipalCurvatureTuple pc = principal_curvatures_and_directions_map[v];
 
     Vector umin = (std::get<0>(pc)/ max_curvature_magnitude_on_mesh) * std::get<2>(pc) * avg_edge_length;
     Vector umax = (std::get<1>(pc)/ max_curvature_magnitude_on_mesh) * std::get<3>(pc) * avg_edge_length;
@@ -133,7 +133,7 @@ void compute(SMesh* sMesh,
   }
 }
 
-void Polyhedron_demo_interpolated_corrected_principal_curvatures_plugin::on_actionEstimateCurvature_triggered()
+void Polyhedron_demo_interpolated_corrected_principal_curvatures_and_directions_plugin::on_actionEstimateCurvature_triggered()
 {
   // get active polyhedron
   const CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
@@ -183,4 +183,4 @@ void Polyhedron_demo_interpolated_corrected_principal_curvatures_plugin::on_acti
   QApplication::restoreOverrideCursor();
 }
 
-#include "Interpolated_corrected_principal_curvatures_plugin.moc"
+#include "Interpolated_corrected_principal_curvatures_and_directions_plugin.moc"
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index 03ee822d0bc9..21b8227e86c9 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -89,7 +89,7 @@ CGAL_add_named_parameter(nb_points_per_area_unit_t, nb_points_per_area_unit, num
 CGAL_add_named_parameter(nb_points_per_distance_unit_t, nb_points_per_distance_unit, number_of_points_per_distance_unit)
 CGAL_add_named_parameter(vertex_mean_curvature_map_t, vertex_mean_curvature_map, vertex_mean_curvature_map)
 CGAL_add_named_parameter(vertex_gaussian_curvature_map_t, vertex_gaussian_curvature_map, vertex_gaussian_curvature_map)
-CGAL_add_named_parameter(vertex_principal_curvature_map_t, vertex_principal_curvature_map, vertex_principal_curvature_map)
+CGAL_add_named_parameter(vertex_principal_curvatures_and_directions_map_t, vertex_principal_curvatures_and_directions_map, vertex_principal_curvatures_and_directions_map)
 CGAL_add_named_parameter(ball_radius_t, ball_radius, ball_radius)
 CGAL_add_named_parameter(outward_orientation_t, outward_orientation, outward_orientation)
 CGAL_add_named_parameter(overlap_test_t, overlap_test, do_overlap_test_of_bounded_sides)

From f35faf60e18ace1d90646823bd7c1ff1ff8ddb1e Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 19 Nov 2022 11:54:20 +0200
Subject: [PATCH 0085/1398] minor doc fixes and renaming

---
 .../PackageDescription.txt                    |  4 ++--
 .../Polygon_mesh_processing.txt               | 17 ++++++++--------
 ...erpolated_corrected_curvatures_example.cpp |  4 ++--
 ...orrected_curvatures_polyhedron_example.cpp |  4 ++--
 ...nterpolated_corrected_curvature_measures.h | 20 +++++++++----------
 5 files changed, 24 insertions(+), 25 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 5090535be250..f62b2816cf7f 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -200,12 +200,12 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - \link PMP_locate_grp Nearest Face Location Queries \endlink
 - \link PMP_locate_grp Random Location Generation \endlink
 
-\cgalCRPSection{Corrected Curvature Functions}
+\cgalCRPSection{Corrected Curvatures}
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
-- `CGAL::Polygon_mesh_processing::Principal_curvature`
+- `CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions`
 
 \cgalCRPSection{Normal Computation Functions}
 - `CGAL::Polygon_mesh_processing::compute_face_normal()`
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 2347ae1c7ae8..1d7184561a80 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -879,11 +879,11 @@ not provide storage for the normals.
 ****************************************
 \section PMPICC Computing Curvatures
 
-This package provides methods to compute curvatures on polygonal meshes based on \cgalCite{lachaud2020}
-This includes mean curvature, gaussian curvature, principal curvatures and directions.
-These can be computed on triangle meshes, quad meshes, and meshes with n-gon faces.
-The algorithms used prove to work well in general. Also, on meshes with noise
-on vertex positions, they give accurate results, on the condition that the
+This package provides methods to compute curvatures on polygonal meshes based on Interpolated Corrected Curvatures
+on Polyhedral Surfaces \cgalCite{lachaud2020}. This includes mean curvature, gaussian curvature,
+principal curvatures and directions. These can be computed on triangle meshes, quad meshes,
+and meshes with n-gon faces. The algorithms used prove to work well in general. Also, on meshes
+with noise on vertex positions, they give accurate results, on the condition that the
 correct vertex normals are provided.
 
 The implementation is generic in terms of mesh data structure. It can be used on Surface_mesh,
@@ -912,13 +912,12 @@ The mean curvature distribution on a bear mesh with different values for the exp
 
 Property maps are used to record the computed curvatures as shown in examples.
 
-\subsection ICCExample Interpolated Corrected Curvature Examples
 
 Property maps are an API introduced in the boost library that allows associating
 values to keys. In the following examples, for each property map, we associate
 a curvature value to each vertex.
 
-\subsubsection ICCExampleSM Interpolated Corrected Curvature on a Surface Mesh.
+\subsection ICCExampleSM Interpolated Corrected Curvature on a Surface Mesh Example
 
 The following example illustrates how to
 compute the curvatures on vertices
@@ -926,7 +925,7 @@ and store them in property maps provided by the class `Surface_mesh`.
 
 \cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp}
 
-\subsubsection ICCExamplePH Interpolated Corrected Curvature on a Polyhedron
+\subsection ICCExamplePH Interpolated Corrected Curvature on a Polyhedron Example
 
 The following example illustrates how to
 compute the curvatures on vertices
@@ -1143,7 +1142,7 @@ is covered by a set of prisms, where each prism is an offset for an input triang
 That is, the implementation in \cgal does not use indirect predicates.
 
 The interpolated corrected curvatures were implemented during GSoC 2022. This was implemented by Hossam Saeed and under
-supervision of Sebastien Loriot, Jaques-Olivier Lachaud and David Coeurjolly. The implementation is based \cgalCite{lachaud2020}.
+supervision of Sebastien Loriot, Jaques-Olivier Lachaud and David Coeurjolly. The implementation is based on \cgalCite{lachaud2020}.
 <a href="https://dgtal-team.github.io/doc-nightly/moduleCurvatureMeasures.html">DGtal's implementation</a> was also
 used as a reference during the project.
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index 71aa06a8caec..33d34cd34f13 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -38,9 +38,9 @@ int main(int argc, char* argv[])
   assert(created);
 
   // we use a tuple of 2 scalar values and 2 vectors for principal curvatures and directions
-  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvature<Epic_kernel>> principal_curvatures_and_directions_map;
+  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>> principal_curvatures_and_directions_map;
 
-  boost::tie(principal_curvatures_and_directions_map, created) = smesh.add_property_map<vertex_descriptor, PMP::Principal_curvature<Epic_kernel>>
+  boost::tie(principal_curvatures_and_directions_map, created) = smesh.add_property_map<vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>>
     ("v:principal_curvatures_and_directions_map", { 0, 0,
         Epic_kernel::Vector_3(0,0,0),
         Epic_kernel::Vector_3(0,0,0) });
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
index 50fe1a014d8e..6bbe49ce37e5 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
@@ -30,8 +30,8 @@ int main(int argc, char *argv[])
   boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
       mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron),
       gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
-  boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<PMP::Principal_curvature<Epic_kernel>>>::type
-      principal_curvatures_and_directions_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvature<Epic_kernel>>(), polyhedron);
+  boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
+      principal_curvatures_and_directions_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), polyhedron);
 
   PMP::interpolated_corrected_mean_curvature(
       polyhedron,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 3b02341a2129..6ed11404a257 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -43,7 +43,7 @@ namespace Polygon_mesh_processing {
 * @tparam GT is the geometric traits class.
 */
 template<typename GT>
-struct Principal_curvature {
+struct Principal_curvatures_and_directions {
 
   /// min curvature magnitude
   typename GT::FT min_curvature;
@@ -57,14 +57,14 @@ struct Principal_curvature {
   /// max curvature direction vector
   typename GT::Vector_3 max_direction;
 
-  Principal_curvature() {
+  Principal_curvatures_and_directions() {
     min_curvature = 0;
     max_curvature = 0;
     min_direction = typename GT::Vector_3(0, 0, 0);
     max_direction = typename GT::Vector_3(0, 0, 0);
   }
 
-  Principal_curvature(
+  Principal_curvatures_and_directions(
     typename GT::FT min_curvature,
     typename GT::FT max_curvature,
     typename GT::Vector_3 min_direction,
@@ -440,7 +440,7 @@ namespace internal {
   }
 
   template<typename GT>
-  Principal_curvature<GT> principal_curvatures_and_directions_from_anisotropic_measures(
+  Principal_curvatures_and_directions<GT> principal_curvatures_and_directions_from_anisotropic_measures(
     const std::array<typename GT::FT, 3 * 3> anisotropic_measure,
     const typename GT::FT v_mu0,
     const typename GT::Vector_3 u_GT
@@ -462,7 +462,7 @@ namespace internal {
     eigensolver.computeDirect(v_muXY);
 
     if (eigensolver.info() != Eigen::Success)
-      return Principal_curvature<GT>();
+      return Principal_curvatures_and_directions<GT>();
 
     const Eigen::Matrix<typename GT::FT, 3, 1> eig_vals = eigensolver.eigenvalues();
     const Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs = eigensolver.eigenvectors();
@@ -470,7 +470,7 @@ namespace internal {
     const typename GT::Vector_3 min_eig_vec(eig_vecs(0, 1), eig_vecs(1, 1), eig_vecs(2, 1));
     const typename GT::Vector_3 max_eig_vec(eig_vecs(0, 0), eig_vecs(1, 0), eig_vecs(2, 0));
 
-    return Principal_curvature<GT>(
+    return Principal_curvatures_and_directions<GT>(
       (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
       (v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
       min_eig_vec,
@@ -509,7 +509,7 @@ namespace internal {
       NamedParameters,
       Default_scalar_map>::type Vertex_gaussian_curvature_map;
 
-    typedef Constant_property_map<Vertex_descriptor, Principal_curvature<GT>> Default_principal_map;
+    typedef Constant_property_map<Vertex_descriptor, Principal_curvatures_and_directions<GT>> Default_principal_map;
     typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvatures_and_directions_map_t,
       NamedParameters,
       Default_principal_map>::type Vertex_principal_curvatures_and_directions_map;
@@ -735,7 +735,7 @@ namespace internal {
 
         if (is_principal_curvatures_and_directions_selected) {
           const Vector_3  v_normal = get(vnm, v);
-          const Principal_curvature<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
+          const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
             vertex_measures.anisotropic_measure,
             vertex_measures.area_measure,
             v_normal
@@ -997,8 +997,8 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Principal_curvature` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<Principal_curvature<GT>>(), pmesh)`}
+*                    as key type and `%Principal_curvatures_and_directions` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<Principal_curvatures_and_directions<GT>>(), pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, mean principal won't be computed}
 *   \cgalParamNEnd
 *

From fe8988b650046236a9dc26c39707c915de4c4147 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 19 Nov 2022 12:16:27 +0200
Subject: [PATCH 0086/1398] demo fixes

---
 .../demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 6efc7f213fe2..404bb20f8072 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -1638,7 +1638,7 @@ private Q_SLOTS:
 
   std::unordered_map<Scene_surface_mesh_item*, Vertex_source_map> is_source;
 
-  double expand_radius;
+  double expand_radius = 0;
   double maxEdgeLength = -1;
   double minBox;
   double maxBox;

From dd49b0c0d87eb344efc3ef994c32b74ca2916706 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 19 Nov 2022 12:18:28 +0200
Subject: [PATCH 0087/1398] demo fixes

---
 ..._corrected_principal_curvatures_plugin.cpp | 64 +++++++++----------
 1 file changed, 30 insertions(+), 34 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
index 09df28bc2816..789ba4a06567 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
@@ -57,42 +57,38 @@ void compute(SMesh* sMesh,
              Scene_polylines_item* min_negative_curv)
 {
   namespace PMP = CGAL::Polygon_mesh_processing;
-  typedef CGAL::Exact_predicates_inexact_constructions_kernel EpicKernel;
-  typedef EpicKernel::Point_3 Point;
-  typedef EpicKernel::Point_3 Point;
-  typedef EpicKernel::Vector_3 Vector;
-  typedef boost::graph_traits<SMesh>::vertex_descriptor vertex_descriptor;
-  typedef std::tuple<
-      EpicKernel::FT,
-      EpicKernel::FT,
-      Vector,
-      Vector
-  > PrincipalCurvatureTuple;
+  typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
+  typedef Epic_kernel::Point_3 Point;
+  typedef Epic_kernel::Point_3 Point;
+  typedef Epic_kernel::Vector_3 Vector;
+  typedef boost::graph_traits<SMesh>::vertex_descriptor Vertex_descriptor;
 
   typename boost::property_map<SMesh, CGAL::vertex_point_t>::type vpmap = get(CGAL::vertex_point, *sMesh);
 
   bool created = false;
-  SMesh::Property_map<vertex_descriptor, PrincipalCurvatureTuple> principal_curvatures_and_directions_map;
+  SMesh::Property_map<Vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>> principal_curvatures_and_directions_map;
+
+  boost::tie(principal_curvatures_and_directions_map, created) = sMesh->add_property_map<Vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>>
+    ("v:principal_curvatures_and_directions_map", { 0, 0,
+        Vector(0,0,0),
+        Vector(0,0,0) });
+  assert(created);
 
-  boost::tie(principal_curvatures_and_directions_map, created) = sMesh->add_property_map<vertex_descriptor, PrincipalCurvatureTuple>
-      ("v:principal_curvatures_and_directions_map", { 0, 0,
-              Vector(0,0,0),
-              Vector(0,0,0)});
-      assert(created);
 
   PMP::interpolated_corrected_principal_curvatures_and_directions(
-      *sMesh,
-      principal_curvatures_and_directions_map
+    *sMesh,
+    principal_curvatures_and_directions_map,
+    CGAL::parameters::ball_radius(0)
   );
 
-  typename EpicKernel::FT max_curvature_magnitude_on_mesh = 0;
-  for (vertex_descriptor v : vertices(*sMesh))
+  typename Epic_kernel::FT max_curvature_magnitude_on_mesh = 0;
+  for (Vertex_descriptor v : vertices(*sMesh))
   {
-      const PrincipalCurvatureTuple pc = principal_curvatures_and_directions_map[v];
-      max_curvature_magnitude_on_mesh = std::max(max_curvature_magnitude_on_mesh, std::max(abs(get<0>(pc)), get<1>(pc)));
+    const PMP::Principal_curvatures_and_directions<Epic_kernel> pc = principal_curvatures_and_directions_map[v];
+    max_curvature_magnitude_on_mesh = std::max(max_curvature_magnitude_on_mesh, std::max(abs(pc.min_curvature), abs(pc.max_curvature)));
   }
 
-  for(vertex_descriptor v : vertices(*sMesh))
+  for(Vertex_descriptor v : vertices(*sMesh))
   {
     std::vector<Point> points;
 
@@ -107,17 +103,17 @@ void compute(SMesh* sMesh,
 
     const std::size_t n = CGAL::edges(*sMesh).size();
 
-    EpicKernel::FT avg_edge_length = 0;
+    Epic_kernel::FT avg_edge_length = 0;
     if (n > 0) {
-        for (auto e : CGAL::edges(*sMesh))
-            avg_edge_length += PMP::edge_length(e, *sMesh);
-        avg_edge_length /= n;
+      for (auto e : CGAL::edges(*sMesh))
+        avg_edge_length += PMP::edge_length(e, *sMesh);
+      avg_edge_length /= n;
     }
 
-    const PrincipalCurvatureTuple pc = principal_curvatures_and_directions_map[v];
+    const PMP::Principal_curvatures_and_directions<Epic_kernel> pc = principal_curvatures_and_directions_map[v];
 
-    Vector umin = (std::get<0>(pc)/ max_curvature_magnitude_on_mesh) * std::get<2>(pc) * avg_edge_length;
-    Vector umax = (std::get<1>(pc)/ max_curvature_magnitude_on_mesh) * std::get<3>(pc) * avg_edge_length;
+    Vector umin = (pc.min_curvature / max_curvature_magnitude_on_mesh) * pc.min_direction * avg_edge_length;
+    Vector umax = (pc.max_curvature / max_curvature_magnitude_on_mesh) * pc.max_direction * avg_edge_length;
 
     Scene_polylines_item::Polyline max_segment(2), min_segment(2);
 
@@ -128,8 +124,8 @@ void compute(SMesh* sMesh,
     max_segment[0] = central_point + du * umax;
     max_segment[1] = central_point - du * umax;
 
-    (std::get<0>(pc) > 0 ? min_curv : min_negative_curv)->polylines.push_back(min_segment);
-    (std::get<1>(pc) > 0 ? max_curv : max_negative_curv)->polylines.push_back(max_segment);
+    (pc.min_curvature > 0 ? min_curv : min_negative_curv)->polylines.push_back(min_segment);
+    (pc.max_curvature > 0 ? max_curv : max_negative_curv)->polylines.push_back(max_segment);
   }
 }
 
@@ -183,4 +179,4 @@ void Polyhedron_demo_interpolated_corrected_principal_curvatures_and_directions_
   QApplication::restoreOverrideCursor();
 }
 
-#include "Interpolated_corrected_principal_curvatures_and_directions_plugin.moc"
+#include "Interpolated_corrected_principal_curvatures_plugin.moc"

From d96dca1264c3f53a836d6410165c60910967e005 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 19 Nov 2022 17:16:28 +0200
Subject: [PATCH 0088/1398] Skipping concave n-gons case for now

remove face triangulation function draft
---
 .../triangulate_faces.h                       | 147 ------------------
 1 file changed, 147 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/triangulate_faces.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/triangulate_faces.h
index abe56ea35a61..0b48967f2733 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/triangulate_faces.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/triangulate_faces.h
@@ -499,153 +499,6 @@ bool triangulate_face(typename boost::graph_traits<PolygonMesh>::face_descriptor
   return modifier.triangulate_face(f, pmesh, use_cdt, visitor);
 }
 
-
-#ifndef CGAL_TRIANGULATE_FACES_DO_NOT_USE_CDT2
-template<typename PolygonMesh, typename OutputIterator, typename NamedParameters = parameters::Default_named_parameters>
-OutputIterator
-face_triangulation(typename boost::graph_traits<PolygonMesh>::face_descriptor f,
-                   PolygonMesh& pmesh,
-                   OutputIterator out,
-                   const NamedParameters& np = parameters::default_values())
-{
-  using parameters::choose_parameter;
-  using parameters::get_parameter;
-
-  //VertexPointMap
-  typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::type VPMap;
-  VPMap vpmap = choose_parameter(get_parameter(np, internal_np::vertex_point),
-                             get_property_map(vertex_point, pmesh));
-
-  //Kernel
-  typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type Kernel;
-  Kernel traits = choose_parameter<Kernel>(get_parameter(np, internal_np::geom_traits));
-
-  //Face_info
-  typedef typename internal::Triangulate_modifier<PolygonMesh, VPMap, Kernel, internal::Default_visitor<PolygonMesh>>::Face_info Face_info;
-
-  //CDT
-  typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
-  typedef CGAL::Projection_traits_3<Kernel>   P_traits;
-  typedef CGAL::Triangulation_vertex_base_with_info_2<halfedge_descriptor,
-                                                      P_traits>        Vb;
-  typedef CGAL::Triangulation_face_base_with_info_2<Face_info,
-                                                    P_traits>          Fb1;
-  typedef CGAL::Constrained_triangulation_face_base_2<P_traits, Fb1>   Fb;
-  typedef CGAL::Triangulation_data_structure_2<Vb,Fb>                  TDS;
-  typedef CGAL::Exact_intersections_tag                                Itag;
-  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits,
-                                                     TDS,
-                                                     Itag>             CDT;
-  P_traits cdt_traits(normal);
-  CDT cdt(cdt_traits);
-
-  std::size_t original_size = CGAL::halfedges_around_face(halfedge(f, pmesh), pmesh).size();
-
-  // Halfedge_around_facet_circulator
-  typedef typename CDT::Vertex_handle Tr_Vertex_handle;
-  halfedge_descriptor start = halfedge(f, pmesh);
-  halfedge_descriptor h = start;
-  Tr_Vertex_handle previous, first;
-  do
-  {
-    Tr_Vertex_handle vh = cdt.insert(get(_vpmap, target(h, pmesh)));
-    if (first == Tr_Vertex_handle()) {
-      first = vh;
-    }
-    vh->info() = h;
-    if(previous != Tr_Vertex_handle() && previous != vh) {
-      cdt.insert_constraint(previous, vh);
-    }
-    previous = vh;
-    h = next(h, pmesh);
-
-  } while( h != start );
-  cdt.insert_constraint(previous, first);
-
-  // sets mark is_external
-  for(typename CDT::All_faces_iterator fit = cdt.all_faces_begin(),
-        end = cdt.all_faces_end();
-      fit != end; ++fit)
-  {
-    fit->info().is_external = false;
-  }
-  std::queue<typename CDT::Face_handle> face_queue;
-  face_queue.push(cdt.infinite_vertex()->face());
-  while(! face_queue.empty() )
-  {
-    typename CDT::Face_handle fh = face_queue.front();
-    face_queue.pop();
-
-    if(fh->info().is_external)
-      continue;
-
-    fh->info().is_external = true;
-    for(int i = 0; i <3; ++i)
-    {
-      if(!cdt.is_constrained(typename CDT::Edge(fh, i)))
-      {
-        face_queue.push(fh->neighbor(i));
-      }
-    }
-  }
-
-  if(cdt.dimension() != 2 || cdt.number_of_vertices() != original_size)
-    return out;
-
-  for(typename CDT::Finite_edges_iterator eit = cdt.finite_edges_begin(),
-        end = cdt.finite_edges_end();
-      eit != end; ++eit)
-  {
-    typename CDT::Face_handle fh = eit->first;
-    const int index = eit->second;
-    typename CDT::Face_handle opposite_fh = fh->neighbor(eit->second);
-    const int opposite_index = opposite_fh->index(fh);
-
-    const Tr_Vertex_handle va = fh->vertex(cdt. cw(index));
-    const Tr_Vertex_handle vb = fh->vertex(cdt.ccw(index));
-
-    if( ! (is_external(fh) && is_external(opposite_fh))//not both fh are external
-        && ! cdt.is_constrained(*eit) )                  //and edge is not constrained
-    {
-      // strictly internal edge
-      halfedge_descriptor hnew = halfedge(add_edge(pmesh), pmesh),
-        hnewopp = opposite(hnew, pmesh);
-
-      fh->info().e[index] = hnew;
-      opposite_fh->info().e[opposite_index] = hnewopp;
-
-      set_target(hnew,    target(va->info(), pmesh), pmesh);
-      set_target(hnewopp, target(vb->info(), pmesh), pmesh);
-    }
-    if( cdt.is_constrained(*eit) ) //edge is constrained
-    {
-      if(!is_external(fh)) {
-        fh->info().e[index] = va->info();
-      }
-      if(!is_external(opposite_fh)) {
-        opposite_fh->info().e[opposite_index] = vb->info();
-      }
-    }
-  }
-  for(typename CDT::Finite_faces_iterator fit = cdt.finite_faces_begin(),
-        end = cdt.finite_faces_end();
-      fit != end; ++fit)
-  {
-    if(!is_external(fit))
-    {
-      halfedge_descriptor h0 = fit->info().e[0];
-      halfedge_descriptor h1 = fit->info().e[1];
-      halfedge_descriptor h2 = fit->info().e[2];
-      *out++=std::make_tuple(target(h0, pmesh), target(h1, pmesh), target(h2,pmesh));
-    }
-  }
-
-  return out;
-}
-#endif
-
-
-
 /**
 * \ingroup PMP_meshing_grp
 *

From 0ac812bd2f57e4efbea92c7cbaf0bc5579166dac Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 19 Nov 2022 17:23:15 +0200
Subject: [PATCH 0089/1398] minor change, position shouldn't be optional

that is, in area and mean measures, in gaussian, it is not needed
---
 .../Curvatures/interpolated_corrected_curvature_measures.h  | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 6ed11404a257..f14904c6799a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -111,7 +111,7 @@ namespace internal {
 
   template<typename GT>
   typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typename GT::Vector_3>& u,
-    const std::vector<typename GT::Vector_3>& x = {})
+    const std::vector<typename GT::Vector_3>& x)
   {
     const std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
@@ -166,7 +166,7 @@ namespace internal {
 
   template<typename GT>
   typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
-    const std::vector<typename GT::Vector_3>& x = {})
+    const std::vector<typename GT::Vector_3>& x)
   {
     const std::size_t n = x.size();
     CGAL_precondition(u.size() == n);
@@ -617,7 +617,7 @@ namespace internal {
           put(mu1_map, f, interpolated_corrected_mean_curvature_measure_face<GT>(u, x));
 
         if (is_gaussian_curvature_selected)
-          put(mu2_map, f, interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x));
+          put(mu2_map, f, interpolated_corrected_gaussian_curvature_measure_face<GT>(u));
 
         if (is_principal_curvatures_and_directions_selected)
           put(muXY_map, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));

From d5a2cf1f0555a015ea3d17c24624565cbb4aebcc Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 19 Nov 2022 19:27:33 +0200
Subject: [PATCH 0090/1398] fixed an expansion bug

when mesh has boundary and no input radius is specified
---
 .../Curvatures/interpolated_corrected_curvature_measures.h     | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index f14904c6799a..4a50a618e66f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -632,6 +632,9 @@ namespace internal {
       Vertex_measures<GT> vertex_measures;
 
       for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+        if (f == boost::graph_traits<PolygonMesh>::null_face())
+          continue;
+
         vertex_measures.area_measure += get(mu0_map, f);
 
         if (is_mean_curvature_selected)

From 1fd56cdd1dfd5fa06184c1ea38fe581f29c02fdf Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 20 Nov 2022 00:28:10 +0200
Subject: [PATCH 0091/1398] testing file for implemented functions

---
 .../Polygon_mesh_processing/CMakeLists.txt    |   2 +-
 ...est_interopolated_corrected_curvatures.cpp | 148 ---------------
 ...test_interpolated_corrected_curvatures.cpp | 178 ++++++++++++++++++
 3 files changed, 179 insertions(+), 149 deletions(-)
 delete mode 100644 Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
 create mode 100644 Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index 808e6d3a05ef..c1aedddedf4e 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -69,7 +69,7 @@ create_single_source_cgal_program("self_intersection_polyhedron_test.cpp")
 create_single_source_cgal_program("self_intersection_surface_mesh_test.cpp")
 create_single_source_cgal_program("pmp_do_intersect_test.cpp")
 create_single_source_cgal_program("test_is_polygon_soup_a_polygon_mesh.cpp")
-create_single_source_cgal_program("test_interopolated_corrected_curvatures.cpp")
+create_single_source_cgal_program("test_interpolated_corrected_curvatures.cpp")
 create_single_source_cgal_program("test_stitching.cpp")
 create_single_source_cgal_program("remeshing_test.cpp")
 create_single_source_cgal_program("remeshing_with_isolated_constraints_test.cpp" )
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
deleted file mode 100644
index b2dbcc0850bb..000000000000
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interopolated_corrected_curvatures.cpp
+++ /dev/null
@@ -1,148 +0,0 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
-#include <CGAL/Polygon_mesh_processing/random_perturbation.h>
-#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
-#include <CGAL/Surface_mesh.h>
-#include <CGAL/property_map.h>
-
-#include <boost/graph/graph_traits.hpp>
-
-#include <iostream>
-#include <unordered_map>
-
-namespace PMP = CGAL::Polygon_mesh_processing;
-
-typedef CGAL::Exact_predicates_inexact_constructions_kernel EpicKernel;
-typedef CGAL::Surface_mesh<EpicKernel::Point_3> SMesh;
-typedef boost::graph_traits<SMesh>::face_descriptor face_descriptor;
-typedef boost::graph_traits<SMesh>::edge_descriptor edge_descriptor;
-typedef boost::graph_traits<SMesh>::vertex_descriptor vertex_descriptor;
-
-void test(std::string mesh_path, EpicKernel::FT rel_expansion_radius, EpicKernel::FT rel_noise_magnitude) {
-  SMesh pmesh;
-  const std::string filename = CGAL::data_file_path(mesh_path);
-
-  if (!CGAL::IO::read_polygon_mesh(filename, pmesh))
-  {
-    std::cerr << "Invalid input file." << std::endl;
-  }
-
-  bool created = false;
-
-  SMesh::Property_map<vertex_descriptor, EpicKernel::FT> mean_curvature_map, gaussian_curvature_map;
-  boost::tie(mean_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:mean_curvature_map", 0);
-  assert(created);
-
-  boost::tie(gaussian_curvature_map, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::FT>("v:gaussian_curvature_map", 0);
-  assert(created);
-
-  // getting the max and min edge lengthes
-  const auto edge_range = CGAL::edges(pmesh);
-
-  const auto edge_length_comparator = [&, pmesh](auto l, auto r) {
-    return PMP::edge_length(l, pmesh) < PMP::edge_length(r, pmesh);
-  };
-
-  const edge_descriptor longest_edge = *std::max_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
-  const EpicKernel::FT max_edge_length = PMP::edge_length(longest_edge, pmesh);
-
-  const edge_descriptor shortest_edge = *std::min_element(edge_range.begin(), edge_range.end(), edge_length_comparator);
-  const EpicKernel::FT min_edge_length = PMP::edge_length(shortest_edge, pmesh);
-
-
-  if (rel_noise_magnitude > 0)
-  {
-    if (!CGAL::is_triangle_mesh(pmesh))
-      return;
-
-    SMesh::Property_map<vertex_descriptor, EpicKernel::Vector_3> vnm;
-    boost::tie(vnm, created) = pmesh.add_property_map<vertex_descriptor, EpicKernel::Vector_3>("v:vnm", { 0 , 0 , 0 });
-    assert(created);
-
-    CGAL::Polygon_mesh_processing::compute_vertex_normals(pmesh, vnm);
-
-    PMP::random_perturbation(pmesh, rel_noise_magnitude * min_edge_length, CGAL::parameters::random_seed(0));
-    PMP::interpolated_corrected_mean_curvature(
-      pmesh,
-      mean_curvature_map,
-      CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
-    );
-    PMP::interpolated_corrected_gaussian_curvature(
-      pmesh,
-      gaussian_curvature_map,
-      CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length).vertex_normal_map(vnm)
-    );
-  }
-  else {
-    PMP::interpolated_corrected_mean_curvature(
-      pmesh,
-      mean_curvature_map,
-      CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-    );
-    PMP::interpolated_corrected_gaussian_curvature(
-      pmesh,
-      gaussian_curvature_map,
-      CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-    );
-
-  }
-
-
-
-  //PMP::interpolated_corrected_mean_curvature(
-  //  pmesh,
-  //  mean_curvature_map,
-  //  CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-  //);
-  //PMP::interpolated_corrected_gaussian_curvature(
-  //  pmesh,
-  //  gaussian_curvature_map,
-  //  CGAL::parameters::ball_radius(rel_expansion_radius * max_edge_length)
-  //);
-
-
-  const EpicKernel::FT max_mean_curvature = *std::max_element(mean_curvature_map.begin(), mean_curvature_map.end());
-  const EpicKernel::FT min_mean_curvature = *std::min_element(mean_curvature_map.begin(), mean_curvature_map.end());
-  const EpicKernel::FT max_gaussian_curvature = *std::max_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
-  const EpicKernel::FT min_gaussian_curvature = *std::min_element(gaussian_curvature_map.begin(), gaussian_curvature_map.end());
-
-  std::cout << "# " << mesh_path << ":\n"
-    << "expansion radius ratio to max length / expansion radius = " << rel_expansion_radius << " / " << rel_expansion_radius * max_edge_length << ",\n"
-    << "max perturbation ratio to minlength / max perturbation = " << rel_noise_magnitude << " / " << rel_noise_magnitude * min_edge_length << "\n"
-    << "mean curvature: min = " << min_mean_curvature << " <-> " << max_mean_curvature << " = max" << "\n"
-    << "gaussian curvature: min = " << min_gaussian_curvature << " <-> " << max_gaussian_curvature << " = max" << "\n\n\n";
-
-
-}
-
-int main()
-{
-  const std::vector<std::string> mesh_pathes_to_test = {
-    "meshes/icc_test/Sphere Quads + Tris.obj",
-    "meshes/icc_test/Sphere Quads + Tris 100352.obj",
-    "meshes/icc_test/Sphere Tris Ico.obj",
-    "meshes/icc_test/Sphere Tris Tet.obj",
-    "meshes/icc_test/Sphere Tris Oct.obj",
-    "meshes/icc_test/Sphere Quads.obj",
-    "meshes/icc_test/Sphere Quads Remesh.obj",
-    "meshes/icc_test/Sphere Ngons + Quads + Tris.obj",
-    "meshes/icc_test/Cube with fillet Quads.obj",
-    "meshes/cylinder.off",
-    "meshes/icc_test/Lantern Tris.obj",
-    "meshes/icc_test/Lantern Quads.obj"
-  };
-
-  const std::vector<EpicKernel::FT> rel_expansion_radii = { 0, 0.1, 0.5, 1 };
-  const std::vector<EpicKernel::FT> rel_noise_magnitudes = { 0, 0.5, 0.9 };
-
-  for (auto mesh_path : mesh_pathes_to_test) {
-    for (EpicKernel::FT rel_expansion_radius : rel_expansion_radii)
-      for (EpicKernel::FT rel_noise_magnitude : rel_noise_magnitudes)
-      {
-        test(mesh_path, rel_expansion_radius, rel_noise_magnitude);
-      }
-
-    std::cout << "_________________________________________________________________________________\n\n";
-  }
-
-}
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
new file mode 100644
index 000000000000..a4f43470332e
--- /dev/null
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -0,0 +1,178 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/random_perturbation.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Polyhedron_3.h>
+#include <CGAL/property_map.h>
+
+#include <boost/graph/graph_traits.hpp>
+
+#include <iostream>
+#include <unordered_map>
+
+#define ABS_ERROR 1e-6
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
+typedef CGAL::Surface_mesh<Epic_kernel::Point_3> SMesh;
+typedef CGAL::Polyhedron_3<Epic_kernel> Polyhedron;
+
+struct Average_test_info {
+  Epic_kernel::FT expansion_radius = -1;
+  Epic_kernel::FT mean_curvature_avg;
+  Epic_kernel::FT gaussian_curvature_avg;
+  Epic_kernel::FT principal_curvature_avg;
+  Epic_kernel::FT tolerance = 0.9;
+
+  Average_test_info(
+    Epic_kernel::FT mean_curvature_avg,
+    Epic_kernel::FT gaussian_curvature_avg,
+    Epic_kernel::FT principal_curvature_avg,
+    Epic_kernel::FT expansion_radius = -1,
+    Epic_kernel::FT tolerance = 0.9
+  ): 
+    expansion_radius(expansion_radius),
+    mean_curvature_avg(mean_curvature_avg),
+    gaussian_curvature_avg(gaussian_curvature_avg),
+    principal_curvature_avg(principal_curvature_avg),
+    tolerance(tolerance)
+  { 
+  }
+
+};
+
+bool passes_comparison(Epic_kernel::FT result, Epic_kernel::FT expected, Epic_kernel::FT tolerance)
+{
+  if (abs(expected) < ABS_ERROR && abs(result) < ABS_ERROR)
+    return true; // expected 0, got 0
+  else if (abs(expected) < ABS_ERROR)
+    return false; // expected 0, got non-0
+
+  return std::min(result, expected) / std::max(result, expected) > tolerance;
+}
+
+template <typename PolygonMesh>
+void test_average_curvatures(std::string mesh_path, Average_test_info test_info){
+  PolygonMesh pmesh;
+  const std::string filename = CGAL::data_file_path(mesh_path);
+
+  if (!CGAL::IO::read_polygon_mesh(filename, pmesh) || faces(pmesh).size() == 0)
+  {
+    std::cerr << "Invalid input file." << std::endl;
+  }
+
+  typedef boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+
+  boost::property_map<PolygonMesh, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
+    mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), pmesh),
+    gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), pmesh);
+  boost::property_map<PolygonMesh, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
+    principal_curvatures_and_directions_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), pmesh);
+
+  // test_info.expansion_radius -> test if no radius is provided by user.
+  if (test_info.expansion_radius < 0) {
+    PMP::interpolated_corrected_mean_curvature(pmesh, mean_curvature_map);
+    PMP::interpolated_corrected_gaussian_curvature(pmesh, gaussian_curvature_map);
+    PMP::interpolated_corrected_principal_curvatures_and_directions(pmesh, principal_curvatures_and_directions_map);
+  }
+  else {
+    PMP::interpolated_corrected_mean_curvature(
+      pmesh,
+      mean_curvature_map,
+      CGAL::parameters::ball_radius(test_info.expansion_radius)
+    );
+
+    PMP::interpolated_corrected_gaussian_curvature(
+      pmesh,
+      gaussian_curvature_map,
+      CGAL::parameters::ball_radius(test_info.expansion_radius)
+    );
+
+    PMP::interpolated_corrected_principal_curvatures_and_directions(
+      pmesh,
+      principal_curvatures_and_directions_map,
+      CGAL::parameters::ball_radius(test_info.expansion_radius)
+    );
+  }
+
+  Epic_kernel::FT mean_curvature_avg = 0, gaussian_curvature_avg = 0, principal_curvature_avg = 0;
+
+  for (vertex_descriptor v : vertices(pmesh))
+  {
+    mean_curvature_avg += get(mean_curvature_map, v);
+    gaussian_curvature_avg += get(gaussian_curvature_map, v);
+    principal_curvature_avg += get(principal_curvatures_and_directions_map, v).min_curvature
+      + get(principal_curvatures_and_directions_map, v).max_curvature;
+  }
+
+  mean_curvature_avg /= vertices(pmesh).size();
+  gaussian_curvature_avg /= vertices(pmesh).size();
+  principal_curvature_avg /= vertices(pmesh).size() * 2;
+
+  // are average curvatures equal to expected?
+  assert(passes_comparison(mean_curvature_avg, test_info.mean_curvature_avg, test_info.tolerance));
+  assert(passes_comparison(gaussian_curvature_avg, test_info.gaussian_curvature_avg, test_info.tolerance));
+  assert(passes_comparison(principal_curvature_avg, test_info.principal_curvature_avg, test_info.tolerance));
+
+  PMP::interpolated_corrected_curvatures(
+    pmesh,
+    CGAL::parameters::ball_radius(test_info.expansion_radius)
+    .vertex_mean_curvature_map(mean_curvature_map)
+    .vertex_gaussian_curvature_map(gaussian_curvature_map)
+    .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map)
+  );
+
+  // are average curvatures computed from interpolated_corrected_curvatures() equal to average curvatures each computed on its own?
+  Epic_kernel::FT new_mean_curvature_avg = 0, new_gaussian_curvature_avg = 0, new_principal_curvature_avg = 0;
+
+  for (vertex_descriptor v : vertices(pmesh))
+  {
+    new_mean_curvature_avg += get(mean_curvature_map, v);
+    new_gaussian_curvature_avg += get(gaussian_curvature_map, v);
+    new_principal_curvature_avg += get(principal_curvatures_and_directions_map, v).min_curvature
+      + get(principal_curvatures_and_directions_map, v).max_curvature;
+  }
+
+  new_mean_curvature_avg /= vertices(pmesh).size();
+  new_gaussian_curvature_avg /= vertices(pmesh).size();
+  new_principal_curvature_avg /= vertices(pmesh).size() * 2;
+
+  assert(passes_comparison(mean_curvature_avg, new_mean_curvature_avg, 0.99));
+  assert(passes_comparison(gaussian_curvature_avg, new_gaussian_curvature_avg, 0.99));
+  assert(passes_comparison(principal_curvature_avg, new_principal_curvature_avg, 0.99));
+}
+
+int main()
+{
+  // testing on a simple sphere(r = 0.5), on both Polyhedron & SurfaceMesh:
+  // Expected: Mean Curvature = 2, Gaussian Curvature = 4, Principal Curvatures = 2 & 2 so 2 on avg.
+  test_average_curvatures<Polyhedron>("meshes/sphere.off", Average_test_info(2,4,2));
+  test_average_curvatures<SMesh>("meshes/sphere.off", Average_test_info(2, 4, 2));
+
+  // Same mesh but with specified expansion radii of 0 and 0.25 (half radius of sphere)
+  test_average_curvatures<SMesh>("meshes/sphere.off", Average_test_info(2, 4, 2, 0));
+  test_average_curvatures<SMesh>("meshes/sphere.off", Average_test_info(2, 4, 2, 0.25));
+
+  // testing on a simple sphere(r = 10), on both Polyhedron & SurfaceMesh:
+  // Expected: Mean Curvature = 0.1, Gaussian Curvature = 0.01, Principal Curvatures = 0.1 & 0.1 so 0.1 on avg.
+  test_average_curvatures<Polyhedron>("meshes/sphere966.off", Average_test_info(0.1, 0.01, 0.1));
+  test_average_curvatures<SMesh>("meshes/sphere966.off", Average_test_info(0.1, 0.01, 0.1));
+
+  // Same mesh but with specified expansion radii of 0 and 5 (half radius of sphere)
+  test_average_curvatures<SMesh>("meshes/sphere966.off", Average_test_info(0.1, 0.01, 0.1, 0));
+  test_average_curvatures<SMesh>("meshes/sphere966.off", Average_test_info(0.1, 0.01, 0.1, 5));
+
+  // testing on a simple half cylinder(r = 1), on both Polyhedron & SurfaceMesh:
+  // Expected: Mean Curvature = 0.5, Gaussian Curvature = 0, Principal Curvatures = 0 & 1 so 0.5 on avg.
+  test_average_curvatures<Polyhedron>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5));
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5));
+
+  // Same mesh but with specified expansion radii of 0 and 0.5 (half radius of cylinder)
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0));
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0.5));
+
+
+
+}

From 2af64657636b1fadbacee3dac9e6b2108e1ffedf Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 20 Nov 2022 00:39:14 +0200
Subject: [PATCH 0092/1398] trailing spaces

---
 .../test_interpolated_corrected_curvatures.cpp                | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index a4f43470332e..163c9b8d334d 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -32,13 +32,13 @@ struct Average_test_info {
     Epic_kernel::FT principal_curvature_avg,
     Epic_kernel::FT expansion_radius = -1,
     Epic_kernel::FT tolerance = 0.9
-  ): 
+  ):
     expansion_radius(expansion_radius),
     mean_curvature_avg(mean_curvature_avg),
     gaussian_curvature_avg(gaussian_curvature_avg),
     principal_curvature_avg(principal_curvature_avg),
     tolerance(tolerance)
-  { 
+  {
   }
 
 };

From 669ba26a266c4e935a546587d92362fa7ca93814 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Fri, 25 Nov 2022 13:00:42 +0100
Subject: [PATCH 0093/1398] Allow the use of Foreach_enabled_attributes
 internal functor starting from a given dimension.

---
 .../Combinatorial_map/internal/Combinatorial_map_utility.h  | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
index 542b5ab176a3..340b0551c988 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
@@ -609,13 +609,13 @@ namespace CGAL
       struct Attribute_const_range<d, CGAL::Void>
       { typedef CGAL::Void type; };
 
-      // To iterate onto each enabled attributes
-      template <class Functor>
+      // To iterate onto each enabled attributes, starting from n-attributes (0 by default)
+      template <class Functor, int n=0>
       struct Foreach_enabled_attributes
       {
         template <class ...Ts>
         static void run(Ts& ... t)
-        { Foreach_static_restricted<Functor, Attributes>::run(t...); }
+        { Foreach_static_restricted<Functor, Attributes, n>::run(t...); }
       };
       // To iterate onto each enabled attributes, except j-attributes
       template <class Functor, unsigned int j>

From 45ee81d52266a3fd7a34c484456672ba75c81977 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Fri, 25 Nov 2022 13:01:43 +0100
Subject: [PATCH 0094/1398] add insert_cell_1_between_two_cells_2 method in
 genericmap concept

---
 .../Combinatorial_map/Concepts/GenericMap.h   | 44 +++++++++++++++++++
 1 file changed, 44 insertions(+)

diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
index 8c1c39162128..31bcaf161d65 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
@@ -876,6 +876,7 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 
 \sa `insert_cell_0_in_cell_2`
 \sa `insert_cell_1_in_cell_2`
+\sa `insert_cell_1_between_two_cells_2`
 \sa `insert_dangling_cell_1_in_cell_2`
 \sa `insert_cell_2_in_cell_3<InputIterator>`
 \sa `remove_cell<i>`
@@ -896,6 +897,7 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 
 \sa `insert_cell_0_in_cell_2`
 \sa `insert_cell_1_in_cell_2`
+\sa `insert_cell_1_between_two_cells_2`
 \sa `insert_dangling_cell_1_in_cell_2`
 \sa `insert_cell_2_in_cell_3<InputIterator>`
 \sa `remove_cell<i>`
@@ -917,12 +919,40 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 \sa `is_insertable_cell_1_in_cell_2`
 \sa `insert_cell_0_in_cell_1`
 \sa `insert_cell_0_in_cell_2`
+\sa `insert_cell_1_between_two_cells_2`
 \sa `insert_dangling_cell_1_in_cell_2`
 \sa `insert_cell_2_in_cell_3<InputIterator>`
 \sa `remove_cell<i>`
 */
 Dart_descriptor insert_cell_1_in_cell_2(Dart_descriptor d1, Dart_descriptor d2);
 
+/*!
+Inserts a 1-cell between the 2-cell containing `d1` and the one containing `d2`. Returns `previous(d1)`, a descriptor on one dart belonging to the new 1-cell.
+\pre `is_insertable_cell_1_between_two_cells_2(d1,d2)`.
+
+If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, call \link CellAttribute::On_merge `Attribute_type<i>::type::On_merge`\endlink(<I>a</I>,<I>a'</I>) is called for all enabled i-attributes, for i>=2, with <I>a</I> the original 2-attribute associated with `d` and <I>a'</I> the new 2-attribute created during the operation. If set, the dynamic onmerge function of i-attributes is also called on <I>a</I> and <I>a'</I>.
+
+\cgalAdvancedBegin
+If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
+\cgalAdvancedEnd
+
+\sa `is_insertable_cell_1_between_two_cells_2`
+\sa `insert_cell_0_in_cell_1`
+\sa `insert_cell_0_in_cell_2`
+\sa `insert_cell_1_in_cell_2`
+\sa `insert_dangling_cell_1_in_cell_2`
+\sa `insert_cell_2_in_cell_3<InputIterator>`
+\sa `remove_cell<i>`
+*/
+Dart_descriptor insert_cell_1_between_two_cells_2(Dart_descriptor d1, Dart_descriptor d2);
+
+/*! Call `insert_cell_1_in_cell_2` if `is_insertable_cell_1_in_cell_2(d1, d2)`, otherwise call `insert_cell_1_between_two_cells_2`.
+\sa `insert_cell_1_in_cell_2`
+\sa `insert_cell_1_between_two_cells_2`
+\sa `is_insertable_cell_1_in_cell_2`
+*/
+Dart_descriptor insert_cell_1(Dart_descriptor d1, Dart_descriptor d2);
+
 /*!
 Inserts a 2-cell along the path of 1-cells containing darts given by the range `[afirst,alast)`. Returns `opposite<2>(*afirst)`, a descriptor on one dart belonging to the new 2-cell.
 \pre `is_insertable_cell_2_in_cell_3(afirst,alast)`.
@@ -939,6 +969,7 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 \sa `insert_cell_0_in_cell_1`
 \sa `insert_cell_0_in_cell_2`
 \sa `insert_cell_1_in_cell_2`
+\sa `insert_cell_1_between_two_cells_2`
 \sa `insert_dangling_cell_1_in_cell_2`
 \sa `remove_cell<i>`
 */
@@ -958,6 +989,7 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 \sa `insert_cell_0_in_cell_1`
 \sa `insert_cell_0_in_cell_2`
 \sa `insert_cell_1_in_cell_2`
+\sa `insert_cell_1_between_two_cells_2`
 \sa `insert_cell_2_in_cell_3<InputIterator>`
 \sa `remove_cell<i>`
 
@@ -976,6 +1008,17 @@ This is possible if `d1`\f$ \neq \f$ `d2` and `d1` can be reached from `d2` by u
 */
 bool is_insertable_cell_1_in_cell_2(Dart_const_descriptor d1, Dart_const_descriptor d2);
 
+/*!
+Returns true iff it is possible to insert a 1-cell in the generic map between `d1` and `d2`.
+
+This is possible if `d1`\f$ \neq \f$ `d2` and `d1` can not be reached from `d2` by using some `previous` and `next` calls.
+\pre \link GenericMap::dimension `dimension`\endlink \f$ \geq\f$ 2, `d1`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink, and `d2`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink.
+
+\sa `insert_cell_1_between_two_cells_2`
+
+*/
+bool is_insertable_cell_1_between_two_cells_2(Dart_const_descriptor d1, Dart_const_descriptor d2);
+
 /*!
 Returns true iff it is possible to insert a 2-cell in the generic map along the path of darts given by the range `[afirst,alast)`. The 2-cell can be inserted iff the ordered list of darts form a closed path of edges inside a same volume.
 \pre \link GenericMap::dimension `dimension`\endlink \f$ \geq\f$ 3.
@@ -1016,6 +1059,7 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 \sa `insert_cell_0_in_cell_1`
 \sa `insert_cell_0_in_cell_2`
 \sa `insert_cell_1_in_cell_2`
+\sa `insert_cell_1_between_two_cells_2`
 \sa `insert_dangling_cell_1_in_cell_2`
 \sa `insert_cell_2_in_cell_3<InputIterator>`
 */

From 01c05d8f1b2f1c772e5b62881239e31c05485813 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Fri, 25 Nov 2022 13:02:32 +0100
Subject: [PATCH 0095/1398] Add index method in cc with index, taking an index
 as parameter.

---
 Combinatorial_map/include/CGAL/Compact_container_with_index.h | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Combinatorial_map/include/CGAL/Compact_container_with_index.h b/Combinatorial_map/include/CGAL/Compact_container_with_index.h
index 37d555793b6b..c3ddb24005be 100644
--- a/Combinatorial_map/include/CGAL/Compact_container_with_index.h
+++ b/Combinatorial_map/include/CGAL/Compact_container_with_index.h
@@ -738,6 +738,9 @@ class Compact_container_with_index
   size_type index(const_iterator cit) const
   { return static_cast<size_type>(cit); }
 
+  size_type index(Index idx) const
+  { return static_cast<size_type>(idx); }
+
   // Returns whether the iterator "cit" is in the range [begin(), end()].
   // This function is mostly useful for purposes of efficient debugging at
   // higher levels.

From bb263e009e859b9f6d2f11d24483dbef9bf17021 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Fri, 25 Nov 2022 13:06:50 +0100
Subject: [PATCH 0096/1398] add insert_cell_1_between_two_cells_2 method in
 CMap and GMap

---
 .../include/CGAL/Combinatorial_map.h          |  90 +++++++++-
 .../include/CGAL/Generalized_map.h            | 165 +++++++++++++-----
 2 files changed, 203 insertions(+), 52 deletions(-)

diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map.h b/Combinatorial_map/include/CGAL/Combinatorial_map.h
index fa13fbe6d6c4..f16a3779cd99 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map.h
@@ -1639,11 +1639,14 @@ namespace CGAL {
       CGAL_static_assertion(i<=dimension);
       CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
                   "set_attribute<i> but i-attributes are disabled");
-      for ( typename Dart_of_cell_range<i>::iterator it(*this, dh);
-            it.cont(); ++it)
+
+      for (typename Dart_of_cell_range<i>::iterator it(*this, dh); it.cont(); ++it)
       {
         this->template set_dart_attribute<i>(it, ah);
       }
+      if(ah!=null_descriptor)
+      // To ensure that the dart of this attribute is dh
+      { this->template set_dart_of_attribute<i>(ah, dh); }
     }
 
     /// @return a Attributes_range<i> (range through all the
@@ -4410,7 +4413,8 @@ namespace CGAL {
     bool is_insertable_cell_1_in_cell_2(Dart_const_descriptor adart1,
                                         Dart_const_descriptor adart2) const
     {
-      if ( adart1==adart2 ) return false;
+      if (adart1==adart2 || adart1==null_descriptor) return false;
+      if (adart2==null_descriptor) return true;
       for ( CMap_dart_const_iterator_of_orbit<Self,1> it(*this,adart1);
             it.cont(); ++it )
       {
@@ -4427,15 +4431,81 @@ namespace CGAL {
      *         same vertex than adart1.
      */
     Dart_descriptor insert_cell_1_in_cell_2(Dart_descriptor adart1,
-                                        Dart_descriptor adart2,
-                                        bool update_attributes=true)
+                                            Dart_descriptor adart2,
+                                            bool update_attributes=true)
     {
+      CGAL_assertion(is_insertable_cell_1_in_cell_2(adart1, adart2));
       if ( adart2==null_descriptor )
         return insert_dangling_cell_1_in_cell_2(adart1, null_descriptor,
                                                 update_attributes);
+      return generic_insert_cell_1(adart1, adart2, false, update_attributes);
+    }
 
-      CGAL_assertion(is_insertable_cell_1_in_cell_2(adart1, adart2));
+    /** Test if an edge can be inserted between two different 2-cells
+     *   between two given darts.
+     * @param adart1 a first dart.
+     * @param adart2 a second dart.
+     * @return true iff an edge can be inserted between adart1 and adart2.
+     */
+    bool is_insertable_cell_1_between_two_cells_2(Dart_const_descriptor adart1,
+                                                  Dart_const_descriptor adart2) const
+    {
+      if (adart1==adart2 || adart1==null_descriptor || adart2==null_descriptor)
+      { return false; }
+      for ( CMap_dart_const_iterator_of_orbit<Self,1> it(*this,adart1);
+            it.cont(); ++it )
+      {
+        if ( it==adart2 )  return false;
+      }
+      return true;
+    }
 
+    /** Insert an edge between two different 2-cells, between two given darts.
+     * @param adart1 a first dart of the first facet (!=null_descriptor && !=null_dart_descriptor).
+     * @param adart2 a second dart of the second facet (!=null_descriptor && !=null_dart_descriptor).
+     * @param update_attributes a boolean to update the enabled attributes
+     * @return a dart of the new edge, and not incident to the
+     *         same vertex than adart1.
+     */
+    Dart_descriptor insert_cell_1_between_two_cells_2(Dart_descriptor adart1,
+                                                      Dart_descriptor adart2,
+                                                      bool update_attributes=true)
+    {
+      CGAL_assertion(is_insertable_cell_1_between_two_cells_2(adart1, adart2));
+      return generic_insert_cell_1(adart1, adart2, true, update_attributes);
+    }
+
+    /** Insert an edge between two given darts. If the two darts belong to the same facet, call
+     *  insert_cell_1_in_cell_2, otherwise call insert_cell_1_between_two_cells_2.
+     * @param adart1 a first dart (!=null_descriptor && !=null_dart_descriptor).
+     * @param adart2 a second dart.
+     * @param update_attributes a boolean to update the enabled attributes
+     * @return a dart of the new edge, and not incident to the
+     *         same vertex than adart1.
+     */
+    Dart_descriptor insert_cell_1(Dart_descriptor adart1,
+                                  Dart_descriptor adart2,
+                                  bool update_attributes=true)
+    {
+      if(is_insertable_cell_1_in_cell_2(adart1, adart2))
+      { return insert_cell_1_in_cell_2(adart1, adart2, update_attributes); }
+      return insert_cell_1_between_two_cells_2(adart1, adart2, update_attributes);
+    }
+
+    /** Generic method to insert a 1-cell, either in a 2-cell (cf. insert_cell_1_in_cell_2)
+     *  or between two different 2-cells (cf. insert_cell_1_between_two_cells_2).
+     *  Indeed the code is the same, except for the group/degroup attribute.
+     *  merge is true if adart1 and adart2 belongs to two different facets; in this case
+     *        the two facets should be merged (they are now linked by the new edge);
+     *  merge is false it adart1 and adart2 belongs to the same facet; in this case
+     *        the facet is split in two.
+     *  Internal method not supposed to be called by users.
+     */
+    Dart_descriptor generic_insert_cell_1(Dart_descriptor adart1,
+                                          Dart_descriptor adart2,
+                                          bool merge,
+                                          bool update_attributes)
+    {
       size_type m1=get_new_mark();
       CMap_dart_iterator_basic_of_involution<Self,1> it1(*this, adart1, m1);
 
@@ -4509,7 +4579,13 @@ namespace CGAL {
 
       if (are_attributes_automatically_managed() && update_attributes)
       {
-        internal::Degroup_attribute_functor_run<Self, 2>::run(*this, d1, d2);
+        if(merge)
+        { // Here we group all enabled attributes starting from 2 to dimension
+          Helper::template Foreach_enabled_attributes
+            <internal::Group_attribute_functor<Self>, 2>::run(*this, adart1, adart2);
+        }
+        else // Here we degroup 2-attributes
+        { internal::Degroup_attribute_functor_run<Self, 2>::run(*this, adart1, adart2); }
       }
 
       negate_mark(m1);
diff --git a/Generalized_map/include/CGAL/Generalized_map.h b/Generalized_map/include/CGAL/Generalized_map.h
index 6aa6b56045ea..273d8b32bf27 100644
--- a/Generalized_map/include/CGAL/Generalized_map.h
+++ b/Generalized_map/include/CGAL/Generalized_map.h
@@ -1464,11 +1464,14 @@ namespace CGAL {
       CGAL_static_assertion(i<=dimension);
       CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
                   "set_attribute<i> but i-attributes are disabled");
-      for ( typename Dart_of_cell_range<i>::iterator it(*this, dh);
-            it.cont(); ++it)
+      for (typename Dart_of_cell_range<i>::iterator it(*this, dh);
+           it.cont(); ++it)
       {
         this->template set_dart_attribute<i>(it, ah);
       }
+      if(ah!=null_descriptor)
+      // To ensure that the dart of this attribute is dh
+      { this->template set_dart_of_attribute<i>(ah, dh); }
     }
 
     /// @return a Attributes_range<i> (range through all the
@@ -3512,7 +3515,9 @@ namespace CGAL {
   bool is_insertable_cell_1_in_cell_2(Dart_const_descriptor adart1,
                                       Dart_const_descriptor adart2)
   {
-    if ( adart1==adart2 || adart1==this->template alpha<0>(adart2) )
+    if (adart2==null_descriptor) return true;
+    if (adart1==adart2 || adart1==this->template alpha<0>(adart2) ||
+        adart1==null_descriptor || this->template is_free<1>(adart2))
       return false;
     for ( CGAL::GMap_dart_const_iterator_of_orbit<Self,0,1> it(*this,adart1);
           it.cont(); ++it )
@@ -3525,29 +3530,104 @@ namespace CGAL {
   /** Insert an edge in a 2-cell between two given darts.
    * @param adart1 a first dart of the facet (!=null_descriptor && !=null_dart_descriptor).
    * @param adart2 a second dart of the facet. If null_descriptor insert a dangling edge.
+   * @param update_attributes a boolean to update the enabled attributes
    * @return a dart of the new edge, and not incident to the
    *         same vertex than adart1.
    */
   Dart_descriptor insert_cell_1_in_cell_2(Dart_descriptor adart1,
-                                      Dart_descriptor adart2,
-                                      bool update_attributes=true,
-                                      typename Attribute_descriptor<0>::type
-                                      ah=null_descriptor)
+                                          Dart_descriptor adart2,
+                                          typename Attribute_descriptor<0>::
+                                          type ah=null_descriptor,
+                                          bool update_attributes=true)
   {
-    if ( adart2!=null_descriptor)
+    CGAL_assertion(is_insertable_cell_1_in_cell_2(adart1, adart2));
+    return generic_insert_cell_1(adart1, adart2, false, update_attributes, ah);
+  }
+
+  /** Test if an edge can be inserted between two different 2-cells
+   *   between two given darts.
+   * @param adart1 a first dart.
+   * @param adart2 a second dart.
+   * @return true iff an edge can be inserted between adart1 and adart2.
+   */
+  bool is_insertable_cell_1_between_two_cells_2(Dart_const_descriptor adart1,
+                                                Dart_const_descriptor adart2) const
+  {
+    if (adart1==adart2 || adart1==null_descriptor || adart2==null_descriptor)
+    { return false; }
+    for ( CGAL::GMap_dart_const_iterator_of_orbit<Self,0,1> it(*this,adart1);
+          it.cont(); ++it )
     {
-      CGAL_assertion(is_insertable_cell_1_in_cell_2(adart1, adart2));
+      if ( it==adart2 )  return false;
     }
+    for(unsigned int d=3; d<=dimension; ++d)
+    { if(is_free(adart1, d)!=is_free(adart2, d)) { return false; }}
+
+    return true;
+  }
+
+  /** Insert an edge between two different 2-cells, between two given darts.
+   * @param adart1 a first dart of the first facet (!=null_descriptor && !=null_dart_descriptor).
+   * @param adart2 a second dart of the second facet (!=null_descriptor && !=null_dart_descriptor).
+   * @param update_attributes a boolean to update the enabled attributes
+   * @return a dart of the new edge, and not incident to the
+   *         same vertex than adart1.
+   */
+  Dart_descriptor insert_cell_1_between_two_cells_2(Dart_descriptor adart1,
+                                                    Dart_descriptor adart2,
+                                                    bool update_attributes=true)
+  {
+    CGAL_assertion(is_insertable_cell_1_between_two_cells_2(adart1, adart2));
+    return generic_insert_cell_1(adart1, adart2, true, update_attributes);
+  }
+
+  /** Insert an edge between two given darts. If the two darts belong to the same facet, call
+   *  insert_cell_1_in_cell_2, otherwise call insert_cell_1_between_two_cells_2.
+   * @param adart1 a first dart (!=null_descriptor && !=null_dart_descriptor).
+   * @param adart2 a second dart.
+   * @param update_attributes a boolean to update the enabled attributes
+   * @return a dart of the new edge, and not incident to the
+   *         same vertex than adart1.
+   */
+  Dart_descriptor insert_cell_1(Dart_descriptor adart1,
+                                Dart_descriptor adart2,
+                                bool update_attributes=true,
+                                typename Attribute_descriptor<0>::type
+                                ah=null_descriptor)
+  {
+    CGAL_assertion(adart1!=null_descriptor);
+    if(is_insertable_cell_1_in_cell_2(adart1, adart2))
+    { return insert_cell_1_in_cell_2(adart1, adart2, update_attributes, ah); }
+    return insert_cell_1_between_two_cells_2(adart1, adart2, update_attributes);
+  }
 
+  /** Generic method to insert a 1-cell, either in a 2-cell (cf. insert_cell_1_in_cell_2)
+   *  or between two different 2-cells (cf. insert_cell_1_between_two_cells_2).
+   *  Indeed the code is the same, except for the group/degroup attribute.
+   *  merge is true if adart1 and adart2 belongs to two different facets; in this case
+   *        the two facets should be merged (they are now linked by the new edge);
+   *  merge is false it adart1 and adart2 belongs to the same facet; in this case
+   *        the facet is split in two.
+   *  Internal method not supposed to be called by users.
+   */
+  Dart_descriptor generic_insert_cell_1(Dart_descriptor adart1,
+                                        Dart_descriptor adart2,
+                                        bool merge,
+                                        bool update_attributes=true,
+                                        typename Attribute_descriptor<0>::type
+                                        ah=null_descriptor)
+  {
     /* CGAL::GMap_dart_iterator_basic_of_involution<Self,1> will contain all
      * alpha_i except alpha_0, alpha_1 and alpha_2, i.e. this is
      * <alpha_3,...,alpha_d>
      */
+    Dart_descriptor dart2_a1=null_descriptor;
+    if(adart2!=null_descriptor) { dart2_a1=alpha<1>(adart2); }
+
     size_type m1=get_new_mark();
     CGAL::GMap_dart_iterator_basic_of_involution<Self,1> it1(*this, adart1, m1);
-
     size_type m2=get_new_mark();
-    CGAL::GMap_dart_iterator_basic_of_involution<Self,1> it2(*this, adart2, m2);
+    CGAL::GMap_dart_iterator_basic_of_involution<Self,1> it2(*this, dart2_a1, m2);
 
     Dart_descriptor d1=null_descriptor;
     Dart_descriptor d2=null_descriptor;
@@ -3563,44 +3643,32 @@ namespace CGAL {
       d2 = create_dart();
       mark(it1,treated);
 
-      if (!isfree1)
-      {
-        d3 = create_dart();
-        d4 = create_dart();
-        this->template basic_link_alpha<2>(d1, d3);
-        this->template basic_link_alpha<2>(d2, d4);
-      }
+      d3 = create_dart();
+      d4 = create_dart();
+      this->template basic_link_alpha<2>(d1, d3);
+      this->template basic_link_alpha<2>(d2, d4);
 
-      for ( unsigned int dim=3; dim<=dimension; ++dim)
+      for (unsigned int dim=3; dim<=dimension; ++dim)
       {
         if ( !is_free(it1, dim) &&
              is_marked(alpha(it1, dim), treated) )
         {
           basic_link_alpha(alpha(it1, dim, 1), d1, dim);
-          basic_link_alpha(alpha(d1, dim, 0), d2, dim);
+          basic_link_alpha(alpha(it1, dim, 1, 0), d2, dim);
 
-          if (!isfree1)
-          {
-            basic_link_alpha(alpha(it1, 1, dim, 1), d3, dim);
-            basic_link_alpha(alpha(d3, dim, 0), d4, dim);
-          }
+          basic_link_alpha(alpha(it1, dim, 1, 2), d3, dim);
+          basic_link_alpha(alpha(it1, dim, 1, 2, 0), d4, dim);
         }
       }
 
       if (!isfree1)
-      {
-        this->template link_alpha<1>(this->template alpha<1>(it1), d3);
-        if ( adart2!=null_descriptor )
-        {
-          CGAL_assertion (it2.cont());
-          this->template link_alpha<1>(this->template alpha<1>(it2), d4);
-        }
-      }
-
+      { this->template link_alpha<1>(this->template alpha<1>(it1), d3); }
       this->template link_alpha<1>(it1, d1);
-      if ( adart2!=null_descriptor )
+
+      if (adart2!=null_descriptor)
       {
         CGAL_assertion (it2.cont());
+        this->template link_alpha<1>(this->template alpha<1>(it2), d4);
         this->template link_alpha<1>(it2, d2);
         ++it2;
       }
@@ -3610,25 +3678,31 @@ namespace CGAL {
             update_attributes && ah!=null_descriptor)
         {
           internal::Set_i_attribute_of_dart_functor<Self, 0>::run(*this, d2, ah);
-          if (!isfree1)
-          {
-            internal::Set_i_attribute_of_dart_functor<Self, 0>::run(*this, d4, ah);
-          }
+          internal::Set_i_attribute_of_dart_functor<Self, 0>::run(*this, d4, ah);
         }
       }
 
       // We do the link_alpha<0> after the link_alpha<1> to update the
       // possible attributes of d2.
       this->template link_alpha<0>(d1, d2);
-      if (!isfree1)
-      { this->template link_alpha<0>(d3, d4); }
+      this->template link_alpha<0>(d3, d4);
     }
 
     if (are_attributes_automatically_managed() && update_attributes)
     {
-      if ( !this->template is_free<2>(d1) && d2!=null_descriptor )
-        CGAL::internal::GMap_degroup_attribute_functor_run<Self, 2>::
-          run(*this, d1, this->template alpha<2>(d1));
+      if(merge)
+      { // Here we group all enabled attributes starting from 2 to dimension
+        Helper::template Foreach_enabled_attributes
+          <internal::Group_attribute_functor<Self>, 2>::
+            run(*this, adart1, adart2);
+      }
+      else // Here we degroup 2-attributes
+      {
+        // TODO if ( !this->template is_free<2>(d1) && d2!=null_descriptor )
+        if (adart2!=null_descriptor)
+        { CGAL::internal::GMap_degroup_attribute_functor_run<Self, 2>::
+              run(*this, adart1, adart2); }
+      }
     }
 
     negate_mark(m1);
@@ -3673,7 +3747,8 @@ namespace CGAL {
                                                 typename Attribute_descriptor<0>::
                                                 type ah=null_descriptor,
                                                 bool update_attributes=true )
-  { return insert_cell_1_in_cell_2(adart1, null_descriptor, update_attributes, ah); }
+  { return insert_cell_1_in_cell_2(adart1, null_descriptor, ah,
+                                   update_attributes); }
 
   /** Test if a 2-cell can be inserted onto a given 3-cell along
    *  a path of edges.

From 8d66f692e07f5d4610745d459a198d17e196f5c3 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Fri, 25 Nov 2022 13:20:30 +0100
Subject: [PATCH 0097/1398] add a function in tests to create all possible
 attributes.

---
 .../Linear_cell_complex_2_test.h              | 97 +++++++++++++++++++
 1 file changed, 97 insertions(+)

diff --git a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.h b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.h
index 55e93de1f2b6..3b96f69ca76c 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.h
+++ b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.h
@@ -45,6 +45,103 @@ void trace_display_msg(const char* msg)
 #endif
 }
 
+template<typename Map, int i, typename Info=
+         typename Map::template Attribute_type<i>::type::Info>
+struct SetInfoIfNonVoid
+{
+  static void run(Map& map,
+                  typename Map::template Attribute_descriptor<i>::type attr,
+                  long long int nb)
+  {
+    map.template info_of_attribute<i>(attr)=
+      typename Map::template Attribute_type<i>::type::Info(nb);
+  }
+};
+template<typename Map, int i>
+struct SetInfoIfNonVoid<Map, i, void>
+{
+  static void run(Map&, typename Map::template Attribute_descriptor<i>::type,
+                  long long int)
+  {}
+};
+
+template<typename Map, unsigned int i, typename Attr=typename Map::
+         template Attribute_type<i>::type>
+struct CreateAttributes
+{
+  static void run(Map& map)
+  {
+    long long int nb=0;
+    for(typename Map::Dart_range::iterator it=map.darts().begin(),
+        itend=map.darts().end(); it!=itend; ++it)
+    {
+      if ( map.template attribute<i>(it)==map.null_descriptor )
+      {
+        map.template set_attribute<i>(it, map.template create_attribute<i>());
+        SetInfoIfNonVoid<Map, i>::run(map, map.template attribute<i>(it), ++nb);
+      }
+    }
+  }
+};
+
+template<typename Map, typename Attr>
+struct CreateAttributes<Map, 0, Attr>
+{
+  static void run(Map& amap)
+  {
+    long long int nb=0;
+    for ( typename Map::template Attribute_range<0>::type::iterator
+          it=amap.template attributes<0>().begin(),
+          itend=amap.template attributes<0>().end(); it!=itend; ++it )
+      SetInfoIfNonVoid<Map, 0>::run(amap, it, ++nb);
+  }
+};
+
+template<typename Map, unsigned int i>
+struct CreateAttributes<Map, i, CGAL::Void>
+{
+  static void run(Map&)
+  {}
+};
+
+template<typename Map>
+struct CreateAttributes<Map, 0, CGAL::Void>
+{
+  static void run(Map&)
+  {}
+};
+
+template<typename Map, typename Info=typename Map::Dart_info>
+struct InitDartInfo
+{
+  static void run(Map& map)
+  {
+    long long int nb=0;
+    for(typename Map::Dart_range::iterator it=map.darts().begin(),
+        itend=map.darts().end(); it!=itend; ++it)
+    {
+      nb=CGAL::get_default_random().get_int(0,20000);
+      map.info(it)=Info(nb);
+    }
+  }
+};
+
+template<typename Map>
+struct InitDartInfo<Map, CGAL::Void>
+{
+  static void run(Map&)
+  {}
+};
+
+template<typename Map>
+void create_attributes_2(Map& map)
+{
+  CreateAttributes<Map, 0>::run(map);
+  CreateAttributes<Map, 1>::run(map);
+  CreateAttributes<Map, 2>::run(map);
+  InitDartInfo<Map>::run(map);
+}
+
 template<typename LCC,
          typename Map=typename LCC::Combinatorial_data_structure>
 struct Alpha1

From d381bfbd4486b6fb580eb1b56238606f96e8cfa0 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 30 Nov 2022 10:35:16 +0100
Subject: [PATCH 0098/1398] Add a parameter to group functor to deal with the
 case where first dart will be deleted

---
 .../Combinatorial_map_group_functors.h        | 42 ++++++++++++++-----
 .../internal/Generalized_map_group_functors.h | 23 +++++++---
 2 files changed, 48 insertions(+), 17 deletions(-)

diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
index 885940755110..bda62d360f86 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
@@ -238,7 +238,8 @@ struct Group_nonvoid_attribute_functor_run
 {
   static void run(CMap& amap,
                   typename CMap::Dart_descriptor adart1,
-                  typename CMap::Dart_descriptor adart2)
+                  typename CMap::Dart_descriptor adart2,
+                  bool dart1_deleted=true)
   {
     CGAL_static_assertion( 1<=i && i<=CMap::dimension );
     CGAL_static_assertion( i!=j );
@@ -251,8 +252,13 @@ struct Group_nonvoid_attribute_functor_run
         a2=amap.template attribute<i>(adart2);
 
     // If the two attributes are equal, nothing to do.
-    if ( a1 == a2 ) return;
-
+    if (a1==a2)
+    {
+      if(a1!=CMap::null_descriptor && dart1_deleted &&
+         amap.template dart_of_attribute<i>(a1)==adart1)
+      { amap.template set_dart_of_attribute<i>(a1, adart2); }
+      return;
+    }
     typename CMap::Dart_descriptor toSet = amap.null_descriptor;
 
     // If the attribute associated to adart1 is nullptr, set it with
@@ -268,6 +274,8 @@ struct Group_nonvoid_attribute_functor_run
       }
     }
     amap.template set_attribute<i>(toSet, a1);
+    if(dart1_deleted && toSet==adart1)
+    { amap.template set_dart_of_attribute<i>(a1, adart2); }
   }
 };
 // Specialization for i=0 and 2<=j. We update 0-attributes for beta_j j>=2.
@@ -277,7 +285,8 @@ struct Group_nonvoid_attribute_functor_run<CMap, 0, j, T>
 {
   static void run( CMap& amap,
                    typename CMap::Dart_descriptor dh1,
-                   typename CMap::Dart_descriptor dh2 )
+                   typename CMap::Dart_descriptor dh2,
+                   bool dart1_deleted=true)
   {
     CGAL_static_assertion_msg
         ( CMap::Helper::template Dimension_index<0>::value>=0,
@@ -306,6 +315,8 @@ struct Group_nonvoid_attribute_functor_run<CMap, 0, j, T>
           }
         }
         amap.template set_attribute<0>(toSet, a1);
+        if(dart1_deleted && toSet==dh1)
+        { amap.template set_dart_of_attribute<0>(a1, od); }
       }
     }
     // Second extremity
@@ -338,7 +349,8 @@ struct Group_nonvoid_attribute_functor_run<CMap, 0, 0, T>
 {
   static void run( CMap& amap,
                    typename CMap::Dart_descriptor dh1,
-                   typename CMap::Dart_descriptor dh2 )
+                   typename CMap::Dart_descriptor dh2,
+                   bool dart1_deleted=true)
   {
     CGAL_static_assertion_msg
         ( CMap::Helper::template Dimension_index<0>::value>=0,
@@ -364,6 +376,8 @@ struct Group_nonvoid_attribute_functor_run<CMap, 0, 0, T>
           }
         }
         amap.template set_attribute<0>(toSet, a1);
+        if(dart1_deleted && toSet==dh1)
+        { amap.template set_dart_of_attribute<0>(a1, od); }
       }
     }
   }
@@ -375,7 +389,8 @@ struct Group_nonvoid_attribute_functor_run<CMap, 0, 1, T>
 {
   static void run( CMap& amap,
                    typename CMap::Dart_descriptor dh1,
-                   typename CMap::Dart_descriptor dh2 )
+                   typename CMap::Dart_descriptor dh2,
+                   bool=true)
   {
     CGAL_static_assertion_msg
         ( CMap::Helper::template Dimension_index<0>::value>=0,
@@ -411,7 +426,8 @@ struct Group_nonvoid_attribute_functor_run<CMap,i,i,T>
 {
   static void run(CMap&,
                   typename CMap::Dart_descriptor,
-                  typename CMap::Dart_descriptor)
+                  typename CMap::Dart_descriptor,
+                  bool=true)
   {}
 };
 // Specialization for i=1 and j=0. Do nothing as edges attributes are not
@@ -421,7 +437,8 @@ struct Group_nonvoid_attribute_functor_run<CMap,1,0,T>
 {
   static void run(CMap&,
                   typename CMap::Dart_descriptor,
-                  typename CMap::Dart_descriptor)
+                  typename CMap::Dart_descriptor,
+                  bool=true)
   {}
 };
 //------------------------------------------------------------------------------
@@ -432,8 +449,10 @@ struct Group_attribute_functor_run
 {
   static void run( CMap& amap,
                    typename CMap::Dart_descriptor d1,
-                   typename CMap::Dart_descriptor d2)
-  { Group_nonvoid_attribute_functor_run<CMap, i, j, T>::run(amap, d1, d2); }
+                   typename CMap::Dart_descriptor d2,
+                   bool dart1_deleted=true)
+  { Group_nonvoid_attribute_functor_run<CMap, i, j, T>::
+        run(amap, d1, d2, dart1_deleted); }
 };
 // Specialization for void attributes.
 template<typename CMap, unsigned int i, unsigned int j>
@@ -441,7 +460,8 @@ struct Group_attribute_functor_run<CMap, i, j, CGAL::Void>
 {
   static void run( CMap&,
                    typename CMap::Dart_descriptor,
-                   typename CMap::Dart_descriptor )
+                   typename CMap::Dart_descriptor,
+                   bool=true)
   {}
 };
 // ************************************************************************
diff --git a/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h b/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h
index 950a723bf21a..7514a5a0089c 100644
--- a/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h
+++ b/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h
@@ -132,7 +132,8 @@ struct GMap_group_attribute_functor_run
 {
   static void run(GMap& amap,
                   typename GMap::Dart_descriptor adart1,
-                  typename GMap::Dart_descriptor adart2)
+                  typename GMap::Dart_descriptor adart2,
+                  bool dart1_deleted=true)
   {
     CGAL_static_assertion( i<=GMap::dimension );
     CGAL_static_assertion( i!=j );
@@ -145,7 +146,13 @@ struct GMap_group_attribute_functor_run
         a2=amap.template attribute<i>(adart2);
 
     // If the two attributes are equal, nothing to do.
-    if ( a1 == a2 ) return;
+    if ( a1 == a2 )
+    {
+      if(a1!=GMap::null_descriptor && dart1_deleted &&
+         amap.template dart_of_attribute<i>(a1)==adart1)
+      { amap.template set_dart_of_attribute<i>(a1, adart2); }
+      return;
+    }
 
     typename GMap::Dart_descriptor toSet = amap.null_descriptor;
 
@@ -162,15 +169,18 @@ struct GMap_group_attribute_functor_run
       }
     }
     amap.template set_attribute<i>(toSet, a1);
+    if(dart1_deleted && toSet==adart1)
+    { amap.template set_dart_of_attribute<i>(a1, adart2); }
   }
 };
 // Specialization for void attributes.
 template<typename GMap, unsigned int i, unsigned int j>
 struct GMap_group_attribute_functor_run<GMap, i, j, CGAL::Void>
 {
-  static void run( GMap&,
-                   typename GMap::Dart_descriptor,
-                   typename GMap::Dart_descriptor )
+  static void run(GMap&,
+                  typename GMap::Dart_descriptor,
+                  typename GMap::Dart_descriptor,
+                  bool=true)
   {}
 };
 // Specialization for i=j. Do nothing as j is the dimension to not consider.
@@ -179,7 +189,8 @@ struct GMap_group_attribute_functor_run<GMap,i,i,T>
 {
   static void run(GMap&,
                   typename GMap::Dart_descriptor,
-                  typename GMap::Dart_descriptor)
+                  typename GMap::Dart_descriptor,
+                  bool=true)
   {}
 };
 // ************************************************************************

From 96873950ee5eeb89a06e944c0b747ce14cbd0709 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 30 Nov 2022 10:36:04 +0100
Subject: [PATCH 0099/1398] Bug fix for remove and contrat operations for CMap
 and GMap

---
 .../include/CGAL/Combinatorial_map_operations.h        | 10 ++++++----
 .../include/CGAL/Generalized_map_operations.h          |  4 ++--
 2 files changed, 8 insertions(+), 6 deletions(-)

diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h b/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h
index 2ba09b326500..8d29ad53b6ca 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h
@@ -107,8 +107,10 @@ namespace CGAL
       {
         // We group the two (i+1)-cells incident if they exist.
         if ( dg1!=amap.null_descriptor )
+        {
           CGAL::internal::Group_attribute_functor_run<CMap, i+1>::
-              run(amap, dg1, dg2);
+              run(amap, dg1, dg2, true); // true because dg1 will be removed
+        }
       }
 
       // During the operation, we store in modified_darts the darts modified
@@ -353,7 +355,7 @@ namespace CGAL
         // We group the two edges incident if they exist.
         if ( dg1!=amap.null_descriptor )
           CGAL::internal::Group_attribute_functor_run<CMap, 1>::
-              run(amap, dg1, dg2);
+              run(amap, dg1, dg2, true); // true because dg1 will be removed
       }
 
       // During the operation, we store in modified_darts the darts modified
@@ -523,7 +525,7 @@ namespace CGAL
         // We group the two (i-1)-cells incident if they exist.
         if ( dg1!=amap.null_descriptor )
           CGAL::internal::Group_attribute_functor_run<CMap,i-1>::
-            run(amap, dg1, dg2);
+            run(amap, dg1, dg2, true); // true because dg1 will be removed
       }
 
       // During the operation, we store in modified_darts the darts modified
@@ -677,7 +679,7 @@ namespace CGAL
         // We group the two vertices incident if they exist.
         if ( dg1!=amap.null_descriptor )
           CGAL::internal::Group_attribute_functor_run<CMap, 0, 1>::
-            run(amap, dg1, dg2);
+            run(amap, dg1, dg2, true); // true because dg1 will be removed
       }
 
       // During the operation, we store in modified_darts the darts modified
diff --git a/Generalized_map/include/CGAL/Generalized_map_operations.h b/Generalized_map/include/CGAL/Generalized_map_operations.h
index 8366f3495dfe..abffe8d16513 100644
--- a/Generalized_map/include/CGAL/Generalized_map_operations.h
+++ b/Generalized_map/include/CGAL/Generalized_map_operations.h
@@ -102,7 +102,7 @@ namespace CGAL
         // We group the two (i+1)-cells incident if they exist.
         if ( dg1!=amap.null_descriptor )
           CGAL::internal::GMap_group_attribute_functor_run<GMap, i+1>::
-              run(amap, dg1, dg2);
+            run(amap, dg1, dg2, true); // true because dg1 will be deleted
       }
 
       // During the operation, we store in modified_darts the darts modified
@@ -320,7 +320,7 @@ namespace CGAL
          // We group the two (i-1)-cells incident if they exist.
         if ( dg1!=amap.null_descriptor )
            CGAL::internal::GMap_group_attribute_functor_run<GMap,i-1>::
-               run(amap, dg1, dg2);
+               run(amap, dg1, dg2, true); // true because dg1 will be deleted
       }
 
       // During the operation, we store in modified_darts the darts modified

From 8b114241ca644aac5dda96308f60256c56b5b6aa Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 30 Nov 2022 10:36:40 +0100
Subject: [PATCH 0100/1398] add one insertion test for cmap

---
 .../test/Combinatorial_map/Combinatorial_map_3_test.h | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/Combinatorial_map/test/Combinatorial_map/Combinatorial_map_3_test.h b/Combinatorial_map/test/Combinatorial_map/Combinatorial_map_3_test.h
index 1abea6aef50e..aecd73c271a3 100644
--- a/Combinatorial_map/test/Combinatorial_map/Combinatorial_map_3_test.h
+++ b/Combinatorial_map/test/Combinatorial_map/Combinatorial_map_3_test.h
@@ -1012,6 +1012,17 @@ bool test3D()
   map.insert_cell_1_in_cell_2(d1, map.beta(d1,1,1));
   map.display_characteristics(cout) << ", valid=" << map.is_valid() << endl;
   map.clear();
+
+  d1 = map.make_combinatorial_polygon(4);
+  d2 = map.make_combinatorial_polygon(4);
+  map.insert_cell_1_between_two_cells_2(d1, d2);
+  if(!map.is_valid())
+  {
+    map.display_characteristics(cout) << ", valid=" << map.is_valid() << endl;
+    std::cout<<"ERROR after map.insert_cell_1_between_two_cells_2(d1, d2);"<<std::endl;
+    assert(false);
+    return false;
+  }
   map.clear();
 
   cout << "***************************** TEST INSERT EDGE 3D DONE."

From f8b6e2c2729793d52cede631d7002b4475060f8e Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 30 Nov 2022 10:37:54 +0100
Subject: [PATCH 0101/1398] Bug fix in gmap tests, for the second dart given as
 parameter to the insert_cell_1_in_cell_2 method.

---
 .../test/Generalized_map/GMap_test_insertions.h     | 13 +++----------
 1 file changed, 3 insertions(+), 10 deletions(-)

diff --git a/Generalized_map/test/Generalized_map/GMap_test_insertions.h b/Generalized_map/test/Generalized_map/GMap_test_insertions.h
index b239bad84c16..1a3f67aabc30 100644
--- a/Generalized_map/test/Generalized_map/GMap_test_insertions.h
+++ b/Generalized_map/test/Generalized_map/GMap_test_insertions.h
@@ -149,7 +149,7 @@ bool test_edge_insertion(GMAP& gmap)
 
   trace_test_begin();
   d1 = gmap.make_combinatorial_polygon(4);
-  gmap.insert_cell_1_in_cell_2(d1, gmap.alpha(d1,0,1,0));
+  gmap.insert_cell_1_in_cell_2(d1, gmap.alpha(d1,0,1));
   if ( !check_number_of_cells_3(gmap, 4, 5, 2, 1, 1) )
     return false;
   gmap.clear();
@@ -158,7 +158,7 @@ bool test_edge_insertion(GMAP& gmap)
   d1 = gmap.make_combinatorial_polygon(4);
   d2 = gmap.make_combinatorial_polygon(4);
   gmap.template sew<3>(d1, d2);
-  gmap.insert_cell_1_in_cell_2(d1, gmap.alpha(d1,0,1,0));
+  gmap.insert_cell_1_in_cell_2(d1, gmap.alpha(d1,0,1));
   if ( !check_number_of_cells_3(gmap, 4, 5, 2, 2, 1) )
     return false;
   gmap.clear();
@@ -167,18 +167,11 @@ bool test_edge_insertion(GMAP& gmap)
   d1 = gmap.make_combinatorial_polygon(4);
   d2 = gmap.make_combinatorial_polygon(4);
   gmap.template sew<2>(d1, d2);
-  gmap.insert_cell_1_in_cell_2(d1, gmap.alpha(d1,0,1,0));
+  gmap.insert_cell_1_in_cell_2(d1, gmap.alpha(d1,0,1));
   if ( !check_number_of_cells_3(gmap, 6, 8, 3, 1, 1) )
     return false;
   gmap.clear();
 
-  trace_test_begin();
-  d1 = gmap.create_dart();
-  gmap.insert_dangling_cell_1_in_cell_2(d1);
-  if ( !check_number_of_cells_3(gmap, 2, 2, 1, 1, 1) )
-    return false;
-  gmap.clear();
-
   trace_test_begin();
   d1 = gmap.make_edge();
   gmap.template sew<1>(d1, gmap.alpha(d1, 0));

From caf6d1b38b4e74a45b26794ac00751836988365c Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 30 Nov 2022 11:06:42 +0100
Subject: [PATCH 0102/1398] update lcc test in 2D and 4d

---
 .../Linear_cell_complex_2_test.h                   | 14 --------------
 .../Linear_cell_complex_4_test.h                   |  4 ++--
 2 files changed, 2 insertions(+), 16 deletions(-)

diff --git a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.h b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.h
index 3b96f69ca76c..b76bbf1d7e62 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.h
+++ b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.h
@@ -142,20 +142,6 @@ void create_attributes_2(Map& map)
   InitDartInfo<Map>::run(map);
 }
 
-template<typename LCC,
-         typename Map=typename LCC::Combinatorial_data_structure>
-struct Alpha1
-{
-  static typename LCC::Dart_descriptor run(LCC&, typename LCC::Dart_descriptor dh)
-  { return dh; }
-};
-template<typename LCC>
-struct Alpha1<LCC, CGAL::Generalized_map_tag>
-{
-  static typename LCC::Dart_descriptor run(LCC& lcc, typename LCC::Dart_descriptor dh)
-  { return lcc.template alpha<1>(dh); }
-};
-
 // Test orientation specialized below only for CMap. For GMap return true.
 template<typename LCC, typename Map=typename LCC::Combinatorial_data_structure>
 struct Test_change_orientation_LCC_2
diff --git a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_4_test.h b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_4_test.h
index 1606dbdaffac..edc8b0f6d40d 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_4_test.h
+++ b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_4_test.h
@@ -377,9 +377,9 @@ bool test_LCC_4()
   if ( !check_number_of_cells_4(lcc, 16, 28, 16, 4, 2, 1) )
     return false;
 
-  lcc.insert_cell_1_in_cell_2(lcc.next(dh1), Alpha1<LCC>::run(lcc, lcc.previous(dh1)));
+  lcc.insert_cell_1_in_cell_2(lcc.next(dh1), lcc.previous(dh1));
   dh2=lcc.template opposite<2>(lcc.next(lcc.next(lcc.template opposite<2>(dh1))));
-  lcc.insert_cell_1_in_cell_2(dh2, Alpha1<LCC>::run(lcc, lcc.next(lcc.next(dh2))));
+  lcc.insert_cell_1_in_cell_2(dh2, lcc.next(lcc.next(dh2)));
 
   std::vector<Dart_descriptor> path;
   path.push_back(lcc.next(dh1));

From f6855fef22c428a701719578097f4051ce8525e1 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 3 Jan 2023 12:13:26 +0200
Subject: [PATCH 0103/1398] single vertex computation

implemented single vertex curvature computation
compared against the whole mesh computation on both cases of no radius and with radius on some vertices
still need to add tests, documentation and an example file
---
 ...nterpolated_corrected_curvature_measures.h | 1374 ++++++++++-------
 .../internal/parameters_interface.h           |    3 +
 2 files changed, 830 insertions(+), 547 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 4a50a618e66f..94aaff9b8b52 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -79,675 +79,911 @@ struct Principal_curvatures_and_directions {
 
 namespace internal {
 
-  template<typename PolygonMesh, typename GT>
-  typename GT::FT average_edge_length(const PolygonMesh& pmesh) {
-    const std::size_t n = edges(pmesh).size();
-    if (n == 0)
-      return 0;
-
-    typename GT::FT avg_edge_length = 0;
-    for (auto e : edges(pmesh))
-      avg_edge_length += edge_length(e, pmesh);
-
-    avg_edge_length /= n;
-    return avg_edge_length;
-  }
+template<typename PolygonMesh, typename GT>
+typename GT::FT average_edge_length(const PolygonMesh& pmesh) {
+  const std::size_t n = edges(pmesh).size();
+  if (n == 0)
+    return 0;
+
+  typename GT::FT avg_edge_length = 0;
+  for (auto e : edges(pmesh))
+    avg_edge_length += edge_length(e, pmesh);
+
+  avg_edge_length /= n;
+  return avg_edge_length;
+}
 
-  enum Curvature_measure_index {
-    MU0_AREA_MEASURE, ///< corrected area density
-    MU1_MEAN_CURVATURE_MEASURE, ///< corrected mean curvature density
-    MU2_GAUSSIAN_CURVATURE_MEASURE ///< corrected gaussian curvature density
-  };
-
-  template<typename GT>
-  struct Vertex_measures {
-    typename GT::FT area_measure = 0;
-    typename GT::FT mean_curvature_measure = 0;
-    typename GT::FT gaussian_curvature_measure = 0;
-    std::array<typename GT::FT, 3 * 3> anisotropic_measure = { 0, 0, 0,
-                                                               0, 0, 0,
-                                                               0, 0, 0 };
-  };
-
-  template<typename GT>
-  typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typename GT::Vector_3>& u,
-    const std::vector<typename GT::Vector_3>& x)
+enum Curvature_measure_index {
+  MU0_AREA_MEASURE, ///< corrected area density
+  MU1_MEAN_CURVATURE_MEASURE, ///< corrected mean curvature density
+  MU2_GAUSSIAN_CURVATURE_MEASURE ///< corrected gaussian curvature density
+};
+
+template<typename GT>
+struct Vertex_measures {
+  typename GT::FT area_measure = 0;
+  typename GT::FT mean_curvature_measure = 0;
+  typename GT::FT gaussian_curvature_measure = 0;
+  std::array<typename GT::FT, 3 * 3> anisotropic_measure = { 0, 0, 0,
+                                                             0, 0, 0,
+                                                             0, 0, 0 };
+};
+
+template<typename GT>
+typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typename GT::Vector_3>& u,
+  const std::vector<typename GT::Vector_3>& x)
+{
+  const std::size_t n = x.size();
+  CGAL_precondition(u.size() == n);
+  CGAL_precondition(n >= 3);
+
+  typename GT::Construct_cross_product_vector_3 cross_product;
+
+  // Triangle: use triangle formula
+  if (n == 3)
+  {
+    const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
+    return 0.5 * um * cross_product(x[1] - x[0], x[2] - x[0]);
+  }
+  // Quad: use bilinear interpolation formula
+  else if (n == 4)
   {
-    const std::size_t n = x.size();
-    CGAL_precondition(u.size() == n);
-    CGAL_precondition(n >= 3);
+    // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+    // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
+    return (1.0 / 36.0) * (
+      (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(x[1] - x[0], x[3] - x[0])
+      + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(x[1] - x[0], x[2] - x[1])
+      + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(x[2] - x[3], x[3] - x[0])
+      + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(x[2] - x[3], x[2] - x[1])
+      );
+  }
+  // N-gon: split into n triangles by polygon center and use triangle formula for each
+  else
+  {
+    typename GT::FT mu0 = 0;
 
-    typename GT::Construct_cross_product_vector_3 cross_product;
+    // getting center of points
+    typename GT::Vector_3 xc =
+      std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+    xc /= n;
 
-    // Triangle: use triangle formula
-    if (n == 3)
-    {
-      const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
-      return 0.5 * um * cross_product(x[1] - x[0], x[2] - x[0]);
-    }
-    // Quad: use bilinear interpolation formula
-    else if (n == 4)
+    // getting unit average normal of points
+    typename GT::Vector_3 uc =
+      std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+    uc /= sqrt(uc * uc);
+
+    // summing each triangle's measure after triangulation by barycenter split.
+    for (std::size_t i = 0; i < n; i++)
     {
-      // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
-      // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
-      return (1.0 / 36.0) * (
-        (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(x[1] - x[0], x[3] - x[0])
-        + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(x[1] - x[0], x[2] - x[1])
-        + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(x[2] - x[3], x[3] - x[0])
-        + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(x[2] - x[3], x[2] - x[1])
-        );
+      mu0 += interpolated_corrected_area_measure_face<GT>(
+        std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
+        std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
+      );
     }
-    // N-gon: split into n triangles by polygon center and use triangle formula for each
-    else
-    {
-      typename GT::FT mu0 = 0;
+    return mu0;
+  }
+}
 
-      // getting center of points
-      typename GT::Vector_3 xc =
-        std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-      xc /= n;
+template<typename GT>
+typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
+  const std::vector<typename GT::Vector_3>& x)
+{
+  const std::size_t n = x.size();
+  CGAL_precondition(u.size() == n);
+  CGAL_precondition(n >= 3);
 
-      // getting unit average normal of points
-      typename GT::Vector_3 uc =
-        std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
-      uc /= sqrt(uc * uc);
+  typename GT::Construct_cross_product_vector_3 cross_product;
 
-      // summing each triangle's measure after triangulation by barycenter split.
-      for (std::size_t i = 0; i < n; i++)
-      {
-        mu0 += interpolated_corrected_area_measure_face<GT>(
-          std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
-          std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
-        );
-      }
-      return mu0;
-    }
-  }
+  // Triangle: use triangle formula
+  if (n == 3)
+  {
+    const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
 
-  template<typename GT>
-  typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
-    const std::vector<typename GT::Vector_3>& x)
+    return 0.5 * um * (cross_product(u[2] - u[1], x[0])
+      + cross_product(u[0] - u[2], x[1])
+      + cross_product(u[1] - u[0], x[2]));
+  }
+  // Quad: use bilinear interpolation formula
+  else if (n == 4)
   {
-    const std::size_t n = x.size();
-    CGAL_precondition(u.size() == n);
-    CGAL_precondition(n >= 3);
+    // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+    // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
+
+    const typename GT::Vector_3 u02 = u[2] - u[0];
+    const typename GT::Vector_3 u13 = u[3] - u[1];
+    const typename GT::Vector_3 x0_cross = cross_product(u13, x[0]);
+    const typename GT::Vector_3 x1_cross = -cross_product(u02, x[1]);
+    const typename GT::Vector_3 x3_cross = cross_product(u02, x[3]);
+    const typename GT::Vector_3 x2_cross = -cross_product(u13, x[2]);
+
+    return (1.0 / 12.0) * (
+      u[0] * (2 * x0_cross - cross_product((u[3] + u[2]), x[1]) + cross_product((u[1] + u[2]), x[3]) + x2_cross)
+      + u[1] * (cross_product((u[3] + u[2]), x[0]) + 2 * x1_cross + x3_cross - cross_product((u[0] + u[3]), x[2]))
+      + u[3] * (-cross_product((u[1] + u[2]), x[0]) + x1_cross + 2 * x3_cross + cross_product((u[0] + u[1]), x[2]))
+      + u[2] * (x0_cross + cross_product((u[0] + u[3]), x[1]) - cross_product((u[0] + u[1]), x[3]) + 2 * x2_cross)
+      );
+  }
+  // N-gon: split into n triangles by polygon center and use triangle formula for each
+  else
+  {
+    typename GT::FT mu1 = 0;
 
-    typename GT::Construct_cross_product_vector_3 cross_product;
+    // getting center of points
+    typename GT::Vector_3 xc =
+      std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+    xc /= n;
 
-    // Triangle: use triangle formula
-    if (n == 3)
-    {
-      const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
+    // getting unit average normal of points
+    typename GT::Vector_3 uc =
+      std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+    uc /= sqrt(uc * uc);
 
-      return 0.5 * um * (cross_product(u[2] - u[1], x[0])
-        + cross_product(u[0] - u[2], x[1])
-        + cross_product(u[1] - u[0], x[2]));
-    }
-    // Quad: use bilinear interpolation formula
-    else if (n == 4)
+    // summing each triangle's measure after triangulation by barycenter split.
+    for (std::size_t i = 0; i < n; i++)
     {
-      // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
-      // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
-
-      const typename GT::Vector_3 u02 = u[2] - u[0];
-      const typename GT::Vector_3 u13 = u[3] - u[1];
-      const typename GT::Vector_3 x0_cross = cross_product(u13, x[0]);
-      const typename GT::Vector_3 x1_cross = -cross_product(u02, x[1]);
-      const typename GT::Vector_3 x3_cross = cross_product(u02, x[3]);
-      const typename GT::Vector_3 x2_cross = -cross_product(u13, x[2]);
-
-      return (1.0 / 12.0) * (
-        u[0] * (2 * x0_cross - cross_product((u[3] + u[2]), x[1]) + cross_product((u[1] + u[2]), x[3]) + x2_cross)
-        + u[1] * (cross_product((u[3] + u[2]), x[0]) + 2 * x1_cross + x3_cross - cross_product((u[0] + u[3]), x[2]))
-        + u[3] * (-cross_product((u[1] + u[2]), x[0]) + x1_cross + 2 * x3_cross + cross_product((u[0] + u[1]), x[2]))
-        + u[2] * (x0_cross + cross_product((u[0] + u[3]), x[1]) - cross_product((u[0] + u[1]), x[3]) + 2 * x2_cross)
-        );
+      mu1 += interpolated_corrected_mean_curvature_measure_face<GT>(
+        std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
+        std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
+      );
     }
-    // N-gon: split into n triangles by polygon center and use triangle formula for each
-    else
-    {
-      typename GT::FT mu1 = 0;
+    return mu1;
+  }
+}
 
-      // getting center of points
-      typename GT::Vector_3 xc =
-        std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-      xc /= n;
+template<typename GT>
+typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
+  const std::vector<typename GT::Vector_3>& x = {})
+{
+  const std::size_t n = u.size();
+  CGAL_precondition(n >= 3);
 
-      // getting unit average normal of points
-      typename GT::Vector_3 uc =
-        std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
-      uc /= sqrt(uc * uc);
+  typename GT::Construct_cross_product_vector_3 cross_product;
 
-      // summing each triangle's measure after triangulation by barycenter split.
-      for (std::size_t i = 0; i < n; i++)
-      {
-        mu1 += interpolated_corrected_mean_curvature_measure_face<GT>(
-          std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
-          std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
-        );
-      }
-      return mu1;
-    }
+  // Triangle: use triangle formula
+  if (n == 3)
+  {
+    return 0.5 * u[0] * cross_product(u[1], u[2]);
   }
-
-  template<typename GT>
-  typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
-    const std::vector<typename GT::Vector_3>& x = {})
+  // Quad: use bilinear interpolation formula
+  else if (n == 4)
+  {
+    // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+    // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
+    return (1.0 / 36.0) * (
+      (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(u[1] - u[0], u[3] - u[0])
+      + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(u[1] - u[0], u[2] - u[1])
+      + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(u[2] - u[3], u[3] - u[0])
+      + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(u[2] - u[3], u[2] - u[1])
+      );
+  }
+  // N-gon: split into n triangles by polygon center and use triangle formula for each
+  else
   {
-    const std::size_t n = u.size();
-    CGAL_precondition(n >= 3);
+    typename GT::FT mu2 = 0;
 
-    typename GT::Construct_cross_product_vector_3 cross_product;
+    // getting unit average normal of points
+    typename GT::Vector_3 uc =
+      std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+    uc /= sqrt(uc * uc);
 
-    // Triangle: use triangle formula
-    if (n == 3)
+    // summing each triangle's measure after triangulation by barycenter split.
+    for (std::size_t i = 0; i < n; i++)
     {
-      return 0.5 * u[0] * cross_product(u[1], u[2]);
+      mu2 += interpolated_corrected_gaussian_curvature_measure_face<GT>(
+        std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc}
+      );
     }
-    // Quad: use bilinear interpolation formula
-    else if (n == 4)
+    return mu2;
+  }
+}
+
+template<typename GT>
+std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_face(const std::vector<typename GT::Vector_3>& u,
+  const std::vector<typename GT::Vector_3>& x)
+{
+  const std::size_t n = x.size();
+  CGAL_precondition(u.size() == n);
+  CGAL_precondition(n >= 3);
+
+  typename GT::Construct_cross_product_vector_3 cross_product;
+  std::array<typename GT::FT, 3 * 3> muXY{ 0 };
+
+  // Triangle: use triangle formula
+  if (n == 3)
+  {
+    const typename GT::Vector_3 u01 = u[1] - u[0];
+    const typename GT::Vector_3 u02 = u[2] - u[0];
+    const typename GT::Vector_3 x01 = x[1] - x[0];
+    const typename GT::Vector_3 x02 = x[2] - x[0];
+    const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
+
+    for (std::size_t ix = 0; ix < 3; ix++)
     {
-      // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
-      // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
-      return (1.0 / 36.0) * (
-        (4 * u[0] + 2 * u[1] + 2 * u[3] + u[2]) * cross_product(u[1] - u[0], u[3] - u[0])
-        + (2 * u[0] + 4 * u[1] + u[3] + 2 * u[2]) * cross_product(u[1] - u[0], u[2] - u[1])
-        + (2 * u[0] + u[1] + 4 * u[3] + 2 * u[2]) * cross_product(u[2] - u[3], u[3] - u[0])
-        + (u[0] + 2 * u[1] + 2 * u[3] + 4 * u[2]) * cross_product(u[2] - u[3], u[2] - u[1])
-        );
+      typename GT::Vector_3 X;
+      if (ix == 0)
+        X = typename GT::Vector_3(1, 0, 0);
+      if (ix == 1)
+        X = typename GT::Vector_3(0, 1, 0);
+      if (ix == 2)
+        X = typename GT::Vector_3(0, 0, 1);
+
+      for (std::size_t iy = 0; iy < 3; iy++)
+        muXY[ix * 3 + iy] = 0.5 * um * (cross_product(u02[iy] * X, x01) - cross_product(u01[iy] * X, x02));
     }
-    // N-gon: split into n triangles by polygon center and use triangle formula for each
-    else
+  }
+  // Quad: use bilinear interpolation formula
+  else if (n == 4)
+  {
+    // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
+    // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
+    for (std::size_t ix = 0; ix < 3; ix++)
     {
-      typename GT::FT mu2 = 0;
+      typename GT::Vector_3 X;
+      if (ix == 0)
+        X = typename GT::Vector_3(1, 0, 0);
+      if (ix == 1)
+        X = typename GT::Vector_3(0, 1, 0);
+      if (ix == 2)
+        X = typename GT::Vector_3(0, 0, 1);
+
+      const typename GT::Vector_3 u0xX = cross_product(u[0], X);
+      const typename GT::Vector_3 u1xX = cross_product(u[1], X);
+      const typename GT::Vector_3 u2xX = cross_product(u[2], X);
+      const typename GT::Vector_3 u3xX = cross_product(u[3], X);
 
-      // getting unit average normal of points
-      typename GT::Vector_3 uc =
-        std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
-      uc /= sqrt(uc * uc);
-
-      // summing each triangle's measure after triangulation by barycenter split.
-      for (std::size_t i = 0; i < n; i++)
-      {
-        mu2 += interpolated_corrected_gaussian_curvature_measure_face<GT>(
-          std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc}
-        );
-      }
-      return mu2;
+      for (std::size_t iy = 0; iy < 3; iy++)
+        muXY[ix * 3 + iy] = (1.0 / 72.0) * (
+
+          u[0][iy] * (u0xX * (-x[0] - 11 * x[1] + 13 * x[3] - x[2])
+            + u1xX * (-5 * x[0] - 7 * x[1] + 11 * x[3] + x[2])
+            + u3xX * (x[0] - 7 * x[1] + 11 * x[3] - 5 * x[2])
+            + u2xX * (-x[0] - 5 * x[1] + 7 * x[3] - x[2])
+            )
+          + u[1][iy] * (u0xX * (13 * x[0] - x[1] - 7 * x[3] - 5 * x[2])
+            + u1xX * (17 * x[0] - 5 * x[1] - 5 * x[3] - 7 * x[2])
+            + u3xX * (5 * x[0] + x[1] + x[3] - 7 * x[2])
+            + u2xX * (7 * x[0] - x[1] + 5 * x[3] - 11 * x[2])
+            )
+          + u[2][iy] * (u0xX * (-11 * x[0] + 5 * x[1] - x[3] + 7 * x[2])
+            + u1xX * (-7 * x[0] + x[1] + x[3] + 5 * x[2])
+            + u3xX * (-7 * x[0] - 5 * x[1] - 5 * x[3] + 17 * x[2])
+            + u2xX * (-5 * x[0] - 7 * x[1] - x[3] + 13 * x[2])
+            )
+          + u[3][iy] * (u0xX * (-x[0] + 7 * x[1] - 5 * x[3] - x[2])
+            + u1xX * (-5 * x[0] + 11 * x[1] - 7 * x[3] + x[2])
+            + u3xX * (x[0] + 11 * x[1] - 7 * x[3] - 5 * x[2])
+            + u2xX * (-x[0] + 13 * x[1] - 11 * x[3] - x[2])
+            )
+
+          );
     }
   }
-
-  template<typename GT>
-  std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_face(const std::vector<typename GT::Vector_3>& u,
-    const std::vector<typename GT::Vector_3>& x)
+  // N-gon: split into n triangles by polygon center and use triangle formula for each
+  else
   {
-    const std::size_t n = x.size();
-    CGAL_precondition(u.size() == n);
-    CGAL_precondition(n >= 3);
+    // getting center of points
+    typename GT::Vector_3 xc =
+      std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+    xc /= n;
 
-    typename GT::Construct_cross_product_vector_3 cross_product;
-    std::array<typename GT::FT, 3 * 3> muXY{ 0 };
+    // getting unit average normal of points
+    typename GT::Vector_3 uc =
+      std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
+    uc /= sqrt(uc * uc);
 
-    // Triangle: use triangle formula
-    if (n == 3)
+    // summing each triangle's measure after triangulation by barycenter split.
+    for (std::size_t i = 0; i < n; i++)
     {
-      const typename GT::Vector_3 u01 = u[1] - u[0];
-      const typename GT::Vector_3 u02 = u[2] - u[0];
-      const typename GT::Vector_3 x01 = x[1] - x[0];
-      const typename GT::Vector_3 x02 = x[2] - x[0];
-      const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
+      std::array<typename GT::FT, 3 * 3> muXY_curr_triangle =
+        interpolated_corrected_anisotropic_measure_face<GT>(
+          std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
+          std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
+      );
 
       for (std::size_t ix = 0; ix < 3; ix++)
-      {
-        typename GT::Vector_3 X;
-        if (ix == 0)
-          X = typename GT::Vector_3(1, 0, 0);
-        if (ix == 1)
-          X = typename GT::Vector_3(0, 1, 0);
-        if (ix == 2)
-          X = typename GT::Vector_3(0, 0, 1);
-
         for (std::size_t iy = 0; iy < 3; iy++)
-          muXY[ix * 3 + iy] = 0.5 * um * (cross_product(u02[iy] * X, x01) - cross_product(u01[iy] * X, x02));
-      }
+          muXY[ix * 3 + iy] += muXY_curr_triangle[ix * 3 + iy];
     }
-    // Quad: use bilinear interpolation formula
-    else if (n == 4)
+  }
+  return muXY;
+}
+
+//template<typename GT>
+//typename GT::FT triangle_in_ball_ratio(const typename GT::Vector_3 x1,
+//                                       const typename GT::Vector_3 x2,
+//                                       const typename GT::Vector_3 x3,
+//                                       const typename GT::FT r,
+//                                       const typename GT::Vector_3 c,
+//                                       const std::size_t res = 3)
+//{
+//    const typename GT::FT R = r * r;
+//    const typename GT::FT acc = 1.0 / res;
+//    std::size_t samples_in = 0;
+//    for (GT::FT alpha = acc / 3; alpha < 1; alpha += acc)
+//        for (GT::FT beta = acc / 3; beta < 1 - alpha; beta += acc)
+//        {
+//            if ((alpha * x1 + beta * x2 + (1 - alpha - beta) * x3 - c).squared_length() < R)
+//                samples_in++;
+//        }
+//    return samples_in / (typename GT::FT)(res * (res + 1) / 2);
+//}
+
+template<typename GT>
+typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
+  const typename GT::FT r,
+  const typename GT::Vector_3 c)
+{
+  const std::size_t n = x.size();
+
+  // getting center of points
+  typename GT::Vector_3 xm =
+    std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
+  xm /= n;
+
+  typename GT::FT d_min = (xm - c).squared_length();
+  typename GT::FT d_max = d_min;
+
+  for (const typename GT::Vector_3 xi : x)
+  {
+    const typename GT::FT d_sq = (xi - c).squared_length();
+    d_max = (std::max)(d_sq, d_max);
+    d_min = (std::min)(d_sq, d_min);
+  }
+
+  if (d_max <= r * r) return 1.0;
+  else if (r * r <= d_min) return 0.0;
+
+  d_max = sqrt(d_max);
+  d_min = sqrt(d_min);
+
+  return (r - d_min) / (d_max - d_min);
+}
+
+template<typename GT>
+Principal_curvatures_and_directions<GT> principal_curvatures_and_directions_from_anisotropic_measures(
+  const std::array<typename GT::FT, 3 * 3> anisotropic_measure,
+  const typename GT::FT v_mu0,
+  const typename GT::Vector_3 u_GT
+)
+{
+  Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
+
+  for (std::size_t ix = 0; ix < 3; ix++)
+    for (std::size_t iy = 0; iy < 3; iy++)
+      v_muXY(ix, iy) = anisotropic_measure[ix * 3 + iy];
+
+  Eigen::Matrix<typename GT::FT, 3, 1> u(u_GT.x(), u_GT.y(), u_GT.z());
+  const typename GT::FT K = 1000 * v_mu0;
+
+  v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
+
+  Eigen::SelfAdjointEigenSolver<Eigen::Matrix <typename GT::FT, 3, 3>> eigensolver;
+
+  eigensolver.computeDirect(v_muXY);
+
+  if (eigensolver.info() != Eigen::Success)
+    return Principal_curvatures_and_directions<GT>();
+
+  const Eigen::Matrix<typename GT::FT, 3, 1> eig_vals = eigensolver.eigenvalues();
+  const Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs = eigensolver.eigenvectors();
+
+  const typename GT::Vector_3 min_eig_vec(eig_vecs(0, 1), eig_vecs(1, 1), eig_vecs(2, 1));
+  const typename GT::Vector_3 max_eig_vec(eig_vecs(0, 0), eig_vecs(1, 0), eig_vecs(2, 0));
+
+  return Principal_curvatures_and_directions<GT>(
+    (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
+    (v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
+    min_eig_vec,
+    max_eig_vec
+    );
+}
+
+template<typename GT, typename PolygonMesh, typename VPM, typename VNM>
+typename Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
+  const PolygonMesh pmesh,
+  const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+  const bool is_mean_curvature_selected,
+  const bool is_gaussian_curvature_selected,
+  const bool is_principal_curvatures_and_directions_selected,
+  const VPM vpm,
+  const VNM vnm
+)
+{
+  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+  typedef typename GT::Point_3 Point_3;
+  typedef typename GT::Vector_3 Vector_3;
+  typedef typename GT::FT FT;
+
+  std::queue<Face_descriptor> bfs_queue;
+  std::unordered_set<Face_descriptor> bfs_visited;
+
+  typename Vertex_measures<GT> vertex_measures;
+
+  std::vector<Vector_3> x;
+  std::vector<Vector_3> u;
+
+  for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+    if (f != boost::graph_traits<PolygonMesh>::null_face())
     {
-      // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
-      // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
-      for (std::size_t ix = 0; ix < 3; ix++)
+      for (Vertex_descriptor vi : vertices_around_face(halfedge(f, pmesh), pmesh))
       {
-        typename GT::Vector_3 X;
-        if (ix == 0)
-          X = typename GT::Vector_3(1, 0, 0);
-        if (ix == 1)
-          X = typename GT::Vector_3(0, 1, 0);
-        if (ix == 2)
-          X = typename GT::Vector_3(0, 0, 1);
-
-        const typename GT::Vector_3 u0xX = cross_product(u[0], X);
-        const typename GT::Vector_3 u1xX = cross_product(u[1], X);
-        const typename GT::Vector_3 u2xX = cross_product(u[2], X);
-        const typename GT::Vector_3 u3xX = cross_product(u[3], X);
-
-        for (std::size_t iy = 0; iy < 3; iy++)
-          muXY[ix * 3 + iy] = (1.0 / 72.0) * (
-
-            u[0][iy] * (u0xX * (-x[0] - 11 * x[1] + 13 * x[3] - x[2])
-              + u1xX * (-5 * x[0] - 7 * x[1] + 11 * x[3] + x[2])
-              + u3xX * (x[0] - 7 * x[1] + 11 * x[3] - 5 * x[2])
-              + u2xX * (-x[0] - 5 * x[1] + 7 * x[3] - x[2])
-              )
-            + u[1][iy] * (u0xX * (13 * x[0] - x[1] - 7 * x[3] - 5 * x[2])
-              + u1xX * (17 * x[0] - 5 * x[1] - 5 * x[3] - 7 * x[2])
-              + u3xX * (5 * x[0] + x[1] + x[3] - 7 * x[2])
-              + u2xX * (7 * x[0] - x[1] + 5 * x[3] - 11 * x[2])
-              )
-            + u[2][iy] * (u0xX * (-11 * x[0] + 5 * x[1] - x[3] + 7 * x[2])
-              + u1xX * (-7 * x[0] + x[1] + x[3] + 5 * x[2])
-              + u3xX * (-7 * x[0] - 5 * x[1] - 5 * x[3] + 17 * x[2])
-              + u2xX * (-5 * x[0] - 7 * x[1] - x[3] + 13 * x[2])
-              )
-            + u[3][iy] * (u0xX * (-x[0] + 7 * x[1] - 5 * x[3] - x[2])
-              + u1xX * (-5 * x[0] + 11 * x[1] - 7 * x[3] + x[2])
-              + u3xX * (x[0] + 11 * x[1] - 7 * x[3] - 5 * x[2])
-              + u2xX * (-x[0] + 13 * x[1] - 11 * x[3] - x[2])
-              )
-
-            );
+        Point_3 pi = get(vpm, vi);
+        Vector_3 ui = get(vnm, vi);
+        x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
+        u.push_back(ui);
       }
-    }
-    // N-gon: split into n triangles by polygon center and use triangle formula for each
-    else
-    {
-      // getting center of points
-      typename GT::Vector_3 xc =
-        std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-      xc /= n;
-
-      // getting unit average normal of points
-      typename GT::Vector_3 uc =
-        std::accumulate(u.begin(), u.end(), typename GT::Vector_3(0, 0, 0));
-      uc /= sqrt(uc * uc);
-
-      // summing each triangle's measure after triangulation by barycenter split.
-      for (std::size_t i = 0; i < n; i++)
+
+      vertex_measures.area_measure += interpolated_corrected_area_measure_face<GT>(u, x);
+
+      if (is_mean_curvature_selected)
+        vertex_measures.mean_curvature_measure += interpolated_corrected_mean_curvature_measure_face<GT>(u, x);
+
+      if (is_gaussian_curvature_selected)
+        vertex_measures.gaussian_curvature_measure += interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x);
+
+      if (is_principal_curvatures_and_directions_selected)
       {
-        std::array<typename GT::FT, 3 * 3> muXY_curr_triangle =
-          interpolated_corrected_anisotropic_measure_face<GT>(
-            std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc},
-            std::vector<typename GT::Vector_3> {x[i], x[(i + 1) % n], xc}
-        );
-
-        for (std::size_t ix = 0; ix < 3; ix++)
-          for (std::size_t iy = 0; iy < 3; iy++)
-            muXY[ix * 3 + iy] += muXY_curr_triangle[ix * 3 + iy];
+        const std::array<FT, 3 * 3> face_anisotropic_measure = interpolated_corrected_anisotropic_measure_face<GT>(u, x);
+        for (std::size_t i = 0; i < 3 * 3; i++)
+          vertex_measures.anisotropic_measure[i] += face_anisotropic_measure[i];
       }
     }
-    return muXY;
+
+    x.clear();
+    u.clear();
   }
+  return vertex_measures;
+}
 
-  //template<typename GT>
-  //typename GT::FT triangle_in_ball_ratio(const typename GT::Vector_3 x1,
-  //                                       const typename GT::Vector_3 x2,
-  //                                       const typename GT::Vector_3 x3,
-  //                                       const typename GT::FT r,
-  //                                       const typename GT::Vector_3 c,
-  //                                       const std::size_t res = 3)
-  //{
-  //    const typename GT::FT R = r * r;
-  //    const typename GT::FT acc = 1.0 / res;
-  //    std::size_t samples_in = 0;
-  //    for (GT::FT alpha = acc / 3; alpha < 1; alpha += acc)
-  //        for (GT::FT beta = acc / 3; beta < 1 - alpha; beta += acc)
-  //        {
-  //            if ((alpha * x1 + beta * x2 + (1 - alpha - beta) * x3 - c).squared_length() < R)
-  //                samples_in++;
-  //        }
-  //    return samples_in / (typename GT::FT)(res * (res + 1) / 2);
-  //}
-
-  template<typename GT>
-  typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
-    const typename GT::FT r,
-    const typename GT::Vector_3 c)
-  {
-    const std::size_t n = x.size();
 
-    // getting center of points
-    typename GT::Vector_3 xm =
-      std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-    xm /= n;
+template<typename GT, typename PolygonMesh, typename VPM, typename VNM>
+typename Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
+  const PolygonMesh pmesh,
+  const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+  const typename GT::FT radius,
+  const bool is_mean_curvature_selected,
+  const bool is_gaussian_curvature_selected,
+  const bool is_principal_curvatures_and_directions_selected,
+  const VPM vpm,
+  const VNM vnm
+)
+{
+  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+  typedef typename GT::Point_3 Point_3;
+  typedef typename GT::Vector_3 Vector_3;
+  typedef typename GT::FT FT;
+
+  std::queue<Face_descriptor> bfs_queue;
+  std::unordered_set<Face_descriptor> bfs_visited;
 
-    typename GT::FT d_min = (xm - c).squared_length();
-    typename GT::FT d_max = d_min;
+  typename Vertex_measures<GT> vertex_measures;
 
-    for (const typename GT::Vector_3 xi : x)
+  typename Point_3 vp = get(vpm, v);
+  typename Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
+
+  for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+    if (f != boost::graph_traits<PolygonMesh>::null_face())
     {
-      const typename GT::FT d_sq = (xi - c).squared_length();
-      d_max = (std::max)(d_sq, d_max);
-      d_min = (std::min)(d_sq, d_min);
+      bfs_queue.push(f);
+      bfs_visited.insert(f);
     }
+  }
+  std::vector<Vector_3> x;
+  std::vector<Vector_3> u;
+  while (!bfs_queue.empty()) {
+    Face_descriptor fi = bfs_queue.front();
+    bfs_queue.pop();
 
-    if (d_max <= r * r) return 1.0;
-    else if (r * r <= d_min) return 0.0;
-
-    d_max = sqrt(d_max);
-    d_min = sqrt(d_min);
+    // looping over vertices in face to get point coordinates
 
-    return (r - d_min) / (d_max - d_min);
-  }
+    for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+    {
+      Point_3 pi = get(vpm, vi);
+      Vector_3 ui = get(vnm, vi);
+      x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
+      u.push_back(ui);
+    }
 
-  template<typename GT>
-  Principal_curvatures_and_directions<GT> principal_curvatures_and_directions_from_anisotropic_measures(
-    const std::array<typename GT::FT, 3 * 3> anisotropic_measure,
-    const typename GT::FT v_mu0,
-    const typename GT::Vector_3 u_GT
-  )
-  {
-    Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
+    const FT f_ratio = face_in_ball_ratio<GT>(x, radius, c);
 
-    for (std::size_t ix = 0; ix < 3; ix++)
-      for (std::size_t iy = 0; iy < 3; iy++)
-        v_muXY(ix, iy) = anisotropic_measure[ix * 3 + iy];
+    if (f_ratio != 0.0)
+    {
+      vertex_measures.area_measure += f_ratio * interpolated_corrected_area_measure_face<GT>(u, x);
 
-    Eigen::Matrix<typename GT::FT, 3, 1> u(u_GT.x(), u_GT.y(), u_GT.z());
-    const typename GT::FT K = 1000 * v_mu0;
+      if (is_mean_curvature_selected)
+        vertex_measures.mean_curvature_measure += f_ratio * interpolated_corrected_mean_curvature_measure_face<GT>(u, x);
 
-    v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
+      if (is_gaussian_curvature_selected)
+        vertex_measures.gaussian_curvature_measure += f_ratio * interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x);
 
-    Eigen::SelfAdjointEigenSolver<Eigen::Matrix <typename GT::FT, 3, 3>> eigensolver;
+      if (is_principal_curvatures_and_directions_selected)
+      {
+        const std::array<FT, 3 * 3> face_anisotropic_measure = interpolated_corrected_anisotropic_measure_face<GT>(u, x);
+        for (std::size_t i = 0; i < 3 * 3; i++)
+          vertex_measures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
+      }
 
-    eigensolver.computeDirect(v_muXY);
+      for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+      {
+        if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
+        {
+          bfs_queue.push(fj);
+          bfs_visited.insert(fj);
+        }
+      }
+    }
 
-    if (eigensolver.info() != Eigen::Success)
-      return Principal_curvatures_and_directions<GT>();
+    x.clear();
+    u.clear();
+  }
+  return vertex_measures;
+}
 
-    const Eigen::Matrix<typename GT::FT, 3, 1> eig_vals = eigensolver.eigenvalues();
-    const Eigen::Matrix<typename GT::FT, 3, 3> eig_vecs = eigensolver.eigenvectors();
+template<typename PolygonMesh,
+  typename NamedParameters = parameters::Default_named_parameters>
+  void interpolated_corrected_curvatures_one_vertex(
+    const PolygonMesh pmesh,
+    const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+    NamedParameters& np = parameters::default_values()
+  )
+{
+  typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+  typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
+
+  typedef dynamic_vertex_property_t<GT::Vector_3> Vector_map_tag;
+  typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
+  typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
+    NamedParameters,
+    Default_vector_map>::type Vertex_normal_map;
+
+  using parameters::choose_parameter;
+  using parameters::get_parameter;
+  using parameters::is_default_parameter;
+
+  Vertex_position_map vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+    get_const_property_map(CGAL::vertex_point, pmesh));
+
+  Vertex_normal_map vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+    get(Vector_map_tag(), pmesh));
+
+  if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
+    compute_vertex_normals(pmesh, vnm, np);
+
+  typename GT::FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
+  if (radius == 0)
+    radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+  else
+    radius = radius;
+
+  typename GT::FT* vertex_mean_curvature = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature), nullptr);
+  typename GT::FT* vertex_gaussian_curvature = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature), nullptr);
+  typename Principal_curvatures_and_directions<GT>* vertex_principal_curvatures_and_directions = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvatures_and_directions), nullptr);
+
+  const bool is_mean_curvature_selected = (vertex_mean_curvature != nullptr);
+  const bool is_gaussian_curvature_selected = (vertex_gaussian_curvature != nullptr);
+  const bool is_principal_curvatures_and_directions_selected = (vertex_principal_curvatures_and_directions != nullptr);
+
+  std::cout << is_mean_curvature_selected << is_gaussian_curvature_selected << is_principal_curvatures_and_directions_selected << std::endl;
+
+  Vertex_measures<GT> vertex_measures;
+
+  if (radius < 0)
+    vertex_measures = interpolated_corrected_measures_one_vertex_no_radius<GT>(
+      pmesh,
+      v,
+      is_mean_curvature_selected,
+      is_gaussian_curvature_selected,
+      is_principal_curvatures_and_directions_selected,
+      vpm,
+      vnm
+      );
+  else
+    vertex_measures = interpolated_corrected_measures_one_vertex<GT>(
+    pmesh,
+    v,
+    radius,
+    is_mean_curvature_selected,
+    is_gaussian_curvature_selected,
+    is_principal_curvatures_and_directions_selected,
+    vpm,
+    vnm
+    );
+
+
+  if (is_mean_curvature_selected) {
+    *vertex_mean_curvature = vertex_measures.area_measure != 0 ?
+      0.5 * vertex_measures.mean_curvature_measure / vertex_measures.area_measure : 0;
+  }
 
-    const typename GT::Vector_3 min_eig_vec(eig_vecs(0, 1), eig_vecs(1, 1), eig_vecs(2, 1));
-    const typename GT::Vector_3 max_eig_vec(eig_vecs(0, 0), eig_vecs(1, 0), eig_vecs(2, 0));
+  if (is_gaussian_curvature_selected) {
+    *vertex_gaussian_curvature = vertex_measures.area_measure != 0 ?
+      vertex_measures.gaussian_curvature_measure / vertex_measures.area_measure : 0;
+  }
 
-    return Principal_curvatures_and_directions<GT>(
-      (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
-      (v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
-      min_eig_vec,
-      max_eig_vec
+  if (is_principal_curvatures_and_directions_selected) {
+    const GT::Vector_3  v_normal = get(vnm, v);
+    const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
+      vertex_measures.anisotropic_measure,
+      vertex_measures.area_measure,
+      v_normal
       );
+    *vertex_principal_curvatures_and_directions = principal_curvatures_and_directions;
   }
+}
 
-  template<typename PolygonMesh, typename NamedParameters = parameters::Default_named_parameters>
-  class Interpolated_corrected_curvatures_computer
-  {
-    typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
-
-    typedef typename GT::FT FT;
-    typedef typename GT::Point_3 Point_3;
-    typedef typename GT::Vector_3 Vector_3;
-
-    typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor Edge_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-    typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
-
-    typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
-
-    typedef dynamic_vertex_property_t<Vector_3> Vector_map_tag;
-    typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
-    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
-      NamedParameters,
-      Default_vector_map>::type Vertex_normal_map;
-
-    typedef Constant_property_map<Vertex_descriptor, FT> Default_scalar_map;
-    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_mean_curvature_map_t,
-      NamedParameters,
-      Default_scalar_map>::type Vertex_mean_curvature_map;
-
-    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_gaussian_curvature_map_t,
-      NamedParameters,
-      Default_scalar_map>::type Vertex_gaussian_curvature_map;
-
-    typedef Constant_property_map<Vertex_descriptor, Principal_curvatures_and_directions<GT>> Default_principal_map;
-    typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvatures_and_directions_map_t,
-      NamedParameters,
-      Default_principal_map>::type Vertex_principal_curvatures_and_directions_map;
-
-    typedef typename boost::property_map<PolygonMesh,
-      CGAL::dynamic_face_property_t<FT>>::const_type Face_scalar_measure_map;
-    typedef typename boost::property_map<PolygonMesh,
-      CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>>::const_type Face_anisotropic_measure_map;
-
-  private:
-    const PolygonMesh& pmesh;
-    Vertex_position_map vpm;
-    Vertex_normal_map vnm;
-    FT ball_radius;
-
-    bool is_mean_curvature_selected;
-    bool is_gaussian_curvature_selected;
-    bool is_principal_curvatures_and_directions_selected;
-
-    Vertex_mean_curvature_map mean_curvature_map;
-    Vertex_gaussian_curvature_map gaussian_curvature_map;
-    Vertex_principal_curvatures_and_directions_map principal_curvatures_and_directions_map;
-
-    Face_scalar_measure_map mu0_map, mu1_map, mu2_map;
-    Face_anisotropic_measure_map muXY_map;
-
-    void set_property_maps() {
-      mu0_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
-      mu1_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
-      mu2_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
-      muXY_map = get(CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>(), pmesh);
 
-    }
+template<typename PolygonMesh, typename NamedParameters = parameters::Default_named_parameters>
+class Interpolated_corrected_curvatures_computer
+{
+  typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+
+  typedef typename GT::FT FT;
+  typedef typename GT::Point_3 Point_3;
+  typedef typename GT::Vector_3 Vector_3;
+
+  typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor Edge_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+
+  typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
+
+  typedef dynamic_vertex_property_t<Vector_3> Vector_map_tag;
+  typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
+  typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
+    NamedParameters,
+    Default_vector_map>::type Vertex_normal_map;
+
+  typedef Constant_property_map<Vertex_descriptor, FT> Default_scalar_map;
+  typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_mean_curvature_map_t,
+    NamedParameters,
+    Default_scalar_map>::type Vertex_mean_curvature_map;
+
+  typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_gaussian_curvature_map_t,
+    NamedParameters,
+    Default_scalar_map>::type Vertex_gaussian_curvature_map;
+
+  typedef Constant_property_map<Vertex_descriptor, Principal_curvatures_and_directions<GT>> Default_principal_map;
+  typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvatures_and_directions_map_t,
+    NamedParameters,
+    Default_principal_map>::type Vertex_principal_curvatures_and_directions_map;
+
+  typedef typename boost::property_map<PolygonMesh,
+    CGAL::dynamic_face_property_t<FT>>::const_type Face_scalar_measure_map;
+  typedef typename boost::property_map<PolygonMesh,
+    CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>>::const_type Face_anisotropic_measure_map;
+
+private:
+  const PolygonMesh& pmesh;
+  Vertex_position_map vpm;
+  Vertex_normal_map vnm;
+  FT ball_radius;
+
+  bool is_mean_curvature_selected;
+  bool is_gaussian_curvature_selected;
+  bool is_principal_curvatures_and_directions_selected;
+
+  Vertex_mean_curvature_map mean_curvature_map;
+  Vertex_gaussian_curvature_map gaussian_curvature_map;
+  Vertex_principal_curvatures_and_directions_map principal_curvatures_and_directions_map;
+
+  Face_scalar_measure_map mu0_map, mu1_map, mu2_map;
+  Face_anisotropic_measure_map muXY_map;
+
+  void set_property_maps() {
+    mu0_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
+    mu1_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
+    mu2_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
+    muXY_map = get(CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>(), pmesh);
 
-    void set_named_params(const NamedParameters& np)
-    {
-      using parameters::choose_parameter;
-      using parameters::get_parameter;
-      using parameters::is_default_parameter;
+  }
 
-      vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
-        get_const_property_map(CGAL::vertex_point, pmesh));
+  void set_named_params(const NamedParameters& np)
+  {
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+    using parameters::is_default_parameter;
 
-      vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
-        get(Vector_map_tag(), pmesh));
+    vpm = choose_parameter(get_parameter(np, CGAL::vertex_point),
+      get_const_property_map(CGAL::vertex_point, pmesh));
 
-      if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
-        compute_vertex_normals(pmesh, vnm, np);
+    vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
+      get(Vector_map_tag(), pmesh));
 
-      const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
+    if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
+      compute_vertex_normals(pmesh, vnm, np);
 
-      is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
-      is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
-      is_principal_curvatures_and_directions_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvatures_and_directions_map_t>::value;
+    const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
 
-      mean_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature_map), Default_scalar_map());
-      gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature_map), Default_scalar_map());
-      principal_curvatures_and_directions_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvatures_and_directions_map), Default_principal_map());
+    is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
+    is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
+    is_principal_curvatures_and_directions_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvatures_and_directions_map_t>::value;
 
-      set_ball_radius(radius);
-    }
+    mean_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature_map), Default_scalar_map());
+    gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature_map), Default_scalar_map());
+    principal_curvatures_and_directions_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvatures_and_directions_map), Default_principal_map());
 
-    void set_ball_radius(const FT radius) {
-      if (radius == 0)
-        ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
-      else
-        ball_radius = radius;
-    }
+    set_ball_radius(radius);
+  }
 
-  public:
+  void set_ball_radius(const FT radius) {
+    if (radius == 0)
+      ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+    else
+      ball_radius = radius;
+  }
 
-    Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,
-      const NamedParameters& np = parameters::default_values()
-    ) :
-      pmesh(pmesh)
-    {
-      set_named_params(np);
+public:
 
-      if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvatures_and_directions_selected)
-      {
-        set_property_maps();
+  Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,
+    const NamedParameters& np = parameters::default_values()
+  ) :
+    pmesh(pmesh)
+  {
+    set_named_params(np);
 
-        compute_selected_curvatures();
-      }
+    if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvatures_and_directions_selected)
+    {
+      set_property_maps();
+
+      compute_selected_curvatures();
     }
+  }
 
-  private:
+private:
 
-    void interpolated_corrected_selected_measures_all_faces()
-    {
-      std::vector<Vector_3> x;
-      std::vector<Vector_3> u;
+  void interpolated_corrected_selected_measures_all_faces()
+  {
+    std::vector<Vector_3> x;
+    std::vector<Vector_3> u;
 
-      for (Face_descriptor f : faces(pmesh))
+    for (Face_descriptor f : faces(pmesh))
+    {
+      for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
       {
-        for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
-        {
-          Point_3 p = get(vpm, v);
-          x.push_back(Vector_3(p.x(), p.y(), p.z()));
-          u.push_back(get(vnm, v));
-        }
-        put(mu0_map, f, interpolated_corrected_area_measure_face<GT>(u, x));
+        Point_3 p = get(vpm, v);
+        x.push_back(Vector_3(p.x(), p.y(), p.z()));
+        u.push_back(get(vnm, v));
+      }
+      put(mu0_map, f, interpolated_corrected_area_measure_face<GT>(u, x));
 
-        if (is_mean_curvature_selected)
-          put(mu1_map, f, interpolated_corrected_mean_curvature_measure_face<GT>(u, x));
+      if (is_mean_curvature_selected)
+        put(mu1_map, f, interpolated_corrected_mean_curvature_measure_face<GT>(u, x));
 
-        if (is_gaussian_curvature_selected)
-          put(mu2_map, f, interpolated_corrected_gaussian_curvature_measure_face<GT>(u));
+      if (is_gaussian_curvature_selected)
+        put(mu2_map, f, interpolated_corrected_gaussian_curvature_measure_face<GT>(u));
 
-        if (is_principal_curvatures_and_directions_selected)
-          put(muXY_map, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
+      if (is_principal_curvatures_and_directions_selected)
+        put(muXY_map, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
 
-        x.clear();
-        u.clear();
-      }
+      x.clear();
+      u.clear();
     }
+  }
 
-    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(Vertex_descriptor v)
-    {
-      Vertex_measures<GT> vertex_measures;
+  Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(Vertex_descriptor v)
+  {
+    Vertex_measures<GT> vertex_measures;
 
-      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-        if (f == boost::graph_traits<PolygonMesh>::null_face())
-          continue;
+    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+      if (f == boost::graph_traits<PolygonMesh>::null_face())
+        continue;
 
-        vertex_measures.area_measure += get(mu0_map, f);
+      vertex_measures.area_measure += get(mu0_map, f);
 
-        if (is_mean_curvature_selected)
-          vertex_measures.mean_curvature_measure += get(mu1_map, f);
+      if (is_mean_curvature_selected)
+        vertex_measures.mean_curvature_measure += get(mu1_map, f);
 
-        if (is_gaussian_curvature_selected)
-          vertex_measures.gaussian_curvature_measure += get(mu2_map, f);
+      if (is_gaussian_curvature_selected)
+        vertex_measures.gaussian_curvature_measure += get(mu2_map, f);
 
-        if (is_principal_curvatures_and_directions_selected)
-        {
-          const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, f);
-          for (std::size_t i = 0; i < 3 * 3; i++)
-            vertex_measures.anisotropic_measure[i] += face_anisotropic_measure[i];
-        }
+      if (is_principal_curvatures_and_directions_selected)
+      {
+        const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, f);
+        for (std::size_t i = 0; i < 3 * 3; i++)
+          vertex_measures.anisotropic_measure[i] += face_anisotropic_measure[i];
       }
-
-      return vertex_measures;
     }
 
-    Vertex_measures<GT> expand_interpolated_corrected_measure_vertex(Vertex_descriptor v)
-    {
-      std::queue<Face_descriptor> bfs_queue;
-      std::unordered_set<Face_descriptor> bfs_visited;
+    return vertex_measures;
+  }
 
-      Point_3 vp = get(vpm, v);
-      Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
+  Vertex_measures<GT> expand_interpolated_corrected_measure_vertex(Vertex_descriptor v)
+  {
+    std::queue<Face_descriptor> bfs_queue;
+    std::unordered_set<Face_descriptor> bfs_visited;
 
-      Vertex_measures<GT> vertex_measures;
+    Point_3 vp = get(vpm, v);
+    Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
 
-      for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
-        if (f != boost::graph_traits<PolygonMesh>::null_face())
-        {
-          bfs_queue.push(f);
-          bfs_visited.insert(f);
-        }
+    Vertex_measures<GT> vertex_measures;
+
+    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+      if (f != boost::graph_traits<PolygonMesh>::null_face())
+      {
+        bfs_queue.push(f);
+        bfs_visited.insert(f);
       }
-      while (!bfs_queue.empty()) {
-        Face_descriptor fi = bfs_queue.front();
-        bfs_queue.pop();
+    }
+    while (!bfs_queue.empty()) {
+      Face_descriptor fi = bfs_queue.front();
+      bfs_queue.pop();
 
-        // looping over vertices in face to get point coordinates
-        std::vector<Vector_3> x;
-        for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
-        {
-          Point_3 pi = get(vpm, vi);
-          x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
-        }
+      // looping over vertices in face to get point coordinates
+      std::vector<Vector_3> x;
+      for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+      {
+        Point_3 pi = get(vpm, vi);
+        x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
+      }
 
-        const FT f_ratio = face_in_ball_ratio<GT>(x, ball_radius, c);
+      const FT f_ratio = face_in_ball_ratio<GT>(x, ball_radius, c);
 
-        if (f_ratio != 0.0)
-        {
-          vertex_measures.area_measure += f_ratio * get(mu0_map, fi);
+      if (f_ratio != 0.0)
+      {
+        vertex_measures.area_measure += f_ratio * get(mu0_map, fi);
 
-          if (is_mean_curvature_selected)
-            vertex_measures.mean_curvature_measure += f_ratio * get(mu1_map, fi);
+        if (is_mean_curvature_selected)
+          vertex_measures.mean_curvature_measure += f_ratio * get(mu1_map, fi);
 
-          if (is_gaussian_curvature_selected)
-            vertex_measures.gaussian_curvature_measure += f_ratio * get(mu2_map, fi);
+        if (is_gaussian_curvature_selected)
+          vertex_measures.gaussian_curvature_measure += f_ratio * get(mu2_map, fi);
 
-          if (is_principal_curvatures_and_directions_selected)
-          {
-            const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, fi);
-            for (std::size_t i = 0; i < 3 * 3; i++)
-              vertex_measures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
-          }
+        if (is_principal_curvatures_and_directions_selected)
+        {
+          const std::array<FT, 3 * 3> face_anisotropic_measure = get(muXY_map, fi);
+          for (std::size_t i = 0; i < 3 * 3; i++)
+            vertex_measures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
+        }
 
-          for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+        for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+        {
+          if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
           {
-            if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
-            {
-              bfs_queue.push(fj);
-              bfs_visited.insert(fj);
-            }
+            bfs_queue.push(fj);
+            bfs_visited.insert(fj);
           }
         }
       }
-      return vertex_measures;
     }
+    return vertex_measures;
+  }
 
-    void compute_selected_curvatures() {
-      interpolated_corrected_selected_measures_all_faces();
+  void compute_selected_curvatures() {
+    interpolated_corrected_selected_measures_all_faces();
 
-      for (Vertex_descriptor v : vertices(pmesh))
-      {
-        Vertex_measures<GT> vertex_measures = (ball_radius < 0) ?
-          expand_interpolated_corrected_measure_vertex_no_radius(v) :
-          expand_interpolated_corrected_measure_vertex(v);
-
-        if (is_mean_curvature_selected) {
-          vertex_measures.area_measure != 0 ?
-            put(mean_curvature_map, v, 0.5 * vertex_measures.mean_curvature_measure / vertex_measures.area_measure) :
-            put(mean_curvature_map, v, 0);
-        }
+    for (Vertex_descriptor v : vertices(pmesh))
+    {
+      Vertex_measures<GT> vertex_measures = (ball_radius < 0) ?
+        expand_interpolated_corrected_measure_vertex_no_radius(v) :
+        expand_interpolated_corrected_measure_vertex(v);
+
+      if (is_mean_curvature_selected) {
+        vertex_measures.area_measure != 0 ?
+          put(mean_curvature_map, v, 0.5 * vertex_measures.mean_curvature_measure / vertex_measures.area_measure) :
+          put(mean_curvature_map, v, 0);
+      }
 
-        if (is_gaussian_curvature_selected) {
-          vertex_measures.area_measure != 0 ?
-            put(gaussian_curvature_map, v, vertex_measures.gaussian_curvature_measure / vertex_measures.area_measure) :
-            put(gaussian_curvature_map, v, 0);
-        }
+      if (is_gaussian_curvature_selected) {
+        vertex_measures.area_measure != 0 ?
+          put(gaussian_curvature_map, v, vertex_measures.gaussian_curvature_measure / vertex_measures.area_measure) :
+          put(gaussian_curvature_map, v, 0);
+      }
 
-        if (is_principal_curvatures_and_directions_selected) {
-          const Vector_3  v_normal = get(vnm, v);
-          const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
-            vertex_measures.anisotropic_measure,
-            vertex_measures.area_measure,
-            v_normal
-            );
-          put(principal_curvatures_and_directions_map, v, principal_curvatures_and_directions);
-        }
+      if (is_principal_curvatures_and_directions_selected) {
+        const Vector_3  v_normal = get(vnm, v);
+        const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
+          vertex_measures.anisotropic_measure,
+          vertex_measures.area_measure,
+          v_normal
+          );
+        put(principal_curvatures_and_directions_map, v, principal_curvatures_and_directions);
       }
     }
-  };
+  }
+};
 
 } // namespace internal
 
@@ -1030,6 +1266,50 @@ template<typename PolygonMesh,
   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np);
 }
 
+template<typename GT, typename PolygonMesh,
+  typename NamedParameters = parameters::Default_named_parameters>
+  typename GT::FT interpolated_corrected_mean_curvature_at_vertex(const PolygonMesh& pmesh,
+    typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+    const NamedParameters& np = parameters::default_values())
+{
+  // use interpolated_corrected_curvatures_at_vertex to compute mean curvature
+  typename GT::FT* mean_curvature = new typename GT::FT();
+  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_mean_curvature(mean_curvature));
+  return *mean_curvature;
+}
+
+template<typename GT, typename PolygonMesh,
+  typename NamedParameters = parameters::Default_named_parameters>
+  typename GT::FT interpolated_corrected_gaussian_curvature_at_vertex(const PolygonMesh& pmesh,
+    typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+    const NamedParameters& np = parameters::default_values())
+{
+  // use interpolated_corrected_curvatures_at_vertex to compute gaussian curvature
+  typename GT::FT* gc = new typename GT::FT();
+  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_gaussian_curvature(gc));
+  return *gc;
+}
+
+template<typename GT, typename PolygonMesh,
+  typename NamedParameters = parameters::Default_named_parameters>
+  Principal_curvatures_and_directions<GT> interpolated_corrected_principal_curvatures_and_directions_at_vertex(const PolygonMesh& pmesh,
+    typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+    const NamedParameters& np = parameters::default_values())
+{
+  // use interpolated_corrected_curvatures_at_vertex to compute principal curvatures
+  Principal_curvatures_and_directions<GT>* pcd = new Principal_curvatures_and_directions<GT>();
+  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(pcd));
+  return *pcd;
+}
+
+template<typename PolygonMesh,
+  typename NamedParameters = parameters::Default_named_parameters>
+  void interpolated_corrected_curvatures_at_vertex(const PolygonMesh& pmesh,
+    typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+    const NamedParameters& np = parameters::default_values())
+{
+  internal::interpolated_corrected_curvatures_one_vertex(pmesh, v, np);
+}
 
 } // namespace Polygon_mesh_processing
 } // namespace CGAL
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index 21b8227e86c9..0d5469775614 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -90,6 +90,9 @@ CGAL_add_named_parameter(nb_points_per_distance_unit_t, nb_points_per_distance_u
 CGAL_add_named_parameter(vertex_mean_curvature_map_t, vertex_mean_curvature_map, vertex_mean_curvature_map)
 CGAL_add_named_parameter(vertex_gaussian_curvature_map_t, vertex_gaussian_curvature_map, vertex_gaussian_curvature_map)
 CGAL_add_named_parameter(vertex_principal_curvatures_and_directions_map_t, vertex_principal_curvatures_and_directions_map, vertex_principal_curvatures_and_directions_map)
+CGAL_add_named_parameter(vertex_mean_curvature_t, vertex_mean_curvature, vertex_mean_curvature)
+CGAL_add_named_parameter(vertex_gaussian_curvature_t, vertex_gaussian_curvature, vertex_gaussian_curvature)
+CGAL_add_named_parameter(vertex_principal_curvatures_and_directions_t, vertex_principal_curvatures_and_directions, vertex_principal_curvatures_and_directions)
 CGAL_add_named_parameter(ball_radius_t, ball_radius, ball_radius)
 CGAL_add_named_parameter(outward_orientation_t, outward_orientation, outward_orientation)
 CGAL_add_named_parameter(overlap_test_t, overlap_test, do_overlap_test_of_bounded_sides)

From 73bde6daa0c57675f5eccd157fab07f6b0370d55 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 20 Jan 2023 16:02:25 +0100
Subject: [PATCH 0104/1398] Eigen is needed

---
 .../test/Polygon_mesh_processing/CMakeLists.txt              | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index c1aedddedf4e..c446a7395dee 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -1,4 +1,4 @@
-# Created by the script cgal_create_CMakeLists
+0# Created by the script cgal_create_CMakeLists
 # This is the CMake script for compiling a set of CGAL applications.
 
 cmake_minimum_required(VERSION 3.1...3.23)
@@ -44,6 +44,8 @@ if(TARGET CGAL::Eigen3_support)
   target_link_libraries(test_shape_smoothing PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("delaunay_remeshing_test.cpp")
   target_link_libraries(delaunay_remeshing_test PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("test_interpolated_corrected_curvatures.cpp")
+  target_link_libraries(test_interpolated_corrected_curvatures PUBLIC CGAL::Eigen3_support)
 endif()
 
 find_package(OpenMesh QUIET)
@@ -69,7 +71,6 @@ create_single_source_cgal_program("self_intersection_polyhedron_test.cpp")
 create_single_source_cgal_program("self_intersection_surface_mesh_test.cpp")
 create_single_source_cgal_program("pmp_do_intersect_test.cpp")
 create_single_source_cgal_program("test_is_polygon_soup_a_polygon_mesh.cpp")
-create_single_source_cgal_program("test_interpolated_corrected_curvatures.cpp")
 create_single_source_cgal_program("test_stitching.cpp")
 create_single_source_cgal_program("remeshing_test.cpp")
 create_single_source_cgal_program("remeshing_with_isolated_constraints_test.cpp" )

From 8af5c620fafb7c6771357f91f05fb9000f748a90 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 23 Jan 2023 13:49:34 +0200
Subject: [PATCH 0105/1398] reference documentation + minor fix

+ added documentation for the at_vertext curvature functions
- removed dynamically allocated pointers for storing the curvature on vertex
---
 .../PackageDescription.txt                    |   4 +
 ...nterpolated_corrected_curvature_measures.h | 761 ++++++++++++------
 2 files changed, 504 insertions(+), 261 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index f62b2816cf7f..f6696dc1ba8c 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -205,6 +205,10 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_at_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_at_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_at_vertex()`
 - `CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions`
 
 \cgalCRPSection{Normal Computation Functions}
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 94aaff9b8b52..cdd25aefc0e5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -36,11 +36,11 @@ namespace CGAL {
 namespace Polygon_mesh_processing {
 
 /**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* \brief a struct for storing principal curvatures and directions.
-*
-* @tparam GT is the geometric traits class.
+  * \ingroup PMP_corrected_curvatures_grp
+  *
+  * \brief a struct for storing principal curvatures and directions.
+  *
+  * @tparam GT is the geometric traits class.
 */
 template<typename GT>
 struct Principal_curvatures_and_directions {
@@ -665,11 +665,11 @@ template<typename PolygonMesh,
   const bool is_gaussian_curvature_selected = (vertex_gaussian_curvature != nullptr);
   const bool is_principal_curvatures_and_directions_selected = (vertex_principal_curvatures_and_directions != nullptr);
 
-  std::cout << is_mean_curvature_selected << is_gaussian_curvature_selected << is_principal_curvatures_and_directions_selected << std::endl;
-
   Vertex_measures<GT> vertex_measures;
 
   if (radius < 0)
+  {
+    std::cout << -1;
     vertex_measures = interpolated_corrected_measures_one_vertex_no_radius<GT>(
       pmesh,
       v,
@@ -679,18 +679,21 @@ template<typename PolygonMesh,
       vpm,
       vnm
       );
+  }
   else
+  {
+    std::cout << radius;
     vertex_measures = interpolated_corrected_measures_one_vertex<GT>(
-    pmesh,
-    v,
-    radius,
-    is_mean_curvature_selected,
-    is_gaussian_curvature_selected,
-    is_principal_curvatures_and_directions_selected,
-    vpm,
-    vnm
-    );
-
+      pmesh,
+      v,
+      radius,
+      is_mean_curvature_selected,
+      is_gaussian_curvature_selected,
+      is_principal_curvatures_and_directions_selected,
+      vpm,
+      vnm
+      );
+  }
 
   if (is_mean_curvature_selected) {
     *vertex_mean_curvature = vertex_measures.area_measure != 0 ?
@@ -988,58 +991,58 @@ class Interpolated_corrected_curvatures_computer
 } // namespace internal
 
 /**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Computes the interpolated corrected mean curvature across the mesh
-* and stores it in a vertex property map `vcm`.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam VertexCurvatureMap model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and `GT::FT` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param vcm the vertex property map in which the computed mean curvatures are stored.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* \cgalNamedParamsBegin
-*
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using compute_vertex_normals()}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the
-*                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @see `interpolated_corrected_gaussian_curvature()`
-* @see `interpolated_corrected_principal_curvatures_and_directions()`
-* @see `interpolated_corrected_curvatures()`
+  * \ingroup PMP_corrected_curvatures_grp
+  *
+  * Computes the interpolated corrected mean curvature across the mesh
+  * and stores it in a vertex property map `vcm`.
+  *
+  * @tparam PolygonMesh a model of `FaceListGraph`.
+  * @tparam VertexCurvatureMap model of `WritablePropertyMap` with
+  * `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and `GT::FT` as value type.
+  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
+  *
+  * @param pmesh the polygon mesh.
+  * @param vcm the vertex property map in which the computed mean curvatures are stored.
+  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
+  *
+  * \cgalNamedParamsBegin
+  *
+  *   \cgalParamNBegin{vertex_point_map}
+  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Point_3` as value type}
+  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
+  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_normal_map}
+  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Vector_3` as value type}
+  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+  *                     computed using compute_vertex_normals()}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{ball_radius}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+  *                           by summing measures of faces inside a ball of this radius centered at the
+  *                           vertex expanded from. The summed face measures are weighted by their
+  *                           inclusion ratio inside this ball}
+  *     \cgalParamType{`GT::FT`}
+  *     \cgalParamDefault{`-1`}
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+  *                     measures on faces around the vertex}
+  *   \cgalParamNEnd
+  *
+  * \cgalNamedParamsEnd
+  *
+  * @see `interpolated_corrected_gaussian_curvature()`
+  * @see `interpolated_corrected_principal_curvatures_and_directions()`
+  * @see `interpolated_corrected_curvatures()`
 */
 
 template<typename PolygonMesh, typename VertexCurvatureMap,
@@ -1052,58 +1055,58 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 }
 
 /**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Computes the interpolated corrected gaussian curvature across the mesh
-* and stores it in a vertex property map `vcm`.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam VertexCurvatureMap model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and `GT::FT` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param vcm the vertex property map in which the computed gaussian curvatures are stored.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* \cgalNamedParamsBegin
-*
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using compute_vertex_normals()}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the
-*                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_principal_curvatures_and_directions()`
-* @see `interpolated_corrected_curvatures()`
+  * \ingroup PMP_corrected_curvatures_grp
+  *
+  * Computes the interpolated corrected gaussian curvature across the mesh
+  * and stores it in a vertex property map `vcm`.
+  *
+  * @tparam PolygonMesh a model of `FaceListGraph`.
+  * @tparam VertexCurvatureMap model of `WritablePropertyMap` with
+  * `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and `GT::FT` as value type.
+  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
+  *
+  * @param pmesh the polygon mesh.
+  * @param vcm the vertex property map in which the computed gaussian curvatures are stored.
+  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
+  *
+  * \cgalNamedParamsBegin
+  *
+  *   \cgalParamNBegin{vertex_point_map}
+  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Point_3` as value type}
+  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
+  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_normal_map}
+  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Vector_3` as value type}
+  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+  *                     computed using compute_vertex_normals()}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{ball_radius}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+  *                           by summing measures of faces inside a ball of this radius centered at the
+  *                           vertex expanded from. The summed face measures are weighted by their
+  *                           inclusion ratio inside this ball}
+  *     \cgalParamType{`GT::FT`}
+  *     \cgalParamDefault{`-1`}
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+  *                     measures on faces around the vertex}
+  *   \cgalParamNEnd
+  *
+  * \cgalNamedParamsEnd
+  *
+  * @see `interpolated_corrected_mean_curvature()`
+  * @see `interpolated_corrected_principal_curvatures_and_directions()`
+  * @see `interpolated_corrected_curvatures()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
   typename NamedParameters = parameters::Default_named_parameters>
@@ -1115,59 +1118,59 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 }
 
 /**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Computes the interpolated corrected principal curvatures across the mesh
-* and stores it in a vertex property map `vcm`.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam VertexCurvatureMap model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and
-* `std::tuple<GT::FT, GT::FT, Eigen::Vector<GT::FT, 3>, Eigen::Vector<GT::FT, 3>>` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param vcm the vertex property map in which the computed principal curvatures are stored.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-*
-* \cgalNamedParamsBegin
-*
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using compute_vertex_normals()}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the
-*                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_gaussian_curvature()`
-* @see `interpolated_corrected_curvatures()`
+  * \ingroup PMP_corrected_curvatures_grp
+  *
+  * Computes the interpolated corrected principal curvatures across the mesh
+  * and stores it in a vertex property map `vcm`.
+  *
+  * @tparam PolygonMesh a model of `FaceListGraph`.
+  * @tparam VertexCurvatureMap model of `WritablePropertyMap` with
+  * `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and
+  * `%Principal_curvatures_and_directions` as value type.
+  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
+  *
+  * @param pmesh the polygon mesh.
+  * @param vcm the vertex property map in which the computed principal curvatures are stored.
+  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+  *
+  * \cgalNamedParamsBegin
+  *
+  *   \cgalParamNBegin{vertex_point_map}
+  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Point_3` as value type}
+  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
+  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_normal_map}
+  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Vector_3` as value type}
+  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+  *                     computed using compute_vertex_normals()}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{ball_radius}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+  *                           by summing measures of faces inside a ball of this radius centered at the
+  *                           vertex expanded from. The summed face measures are weighted by their
+  *                           inclusion ratio inside this ball}
+  *     \cgalParamType{`GT::FT`}
+  *     \cgalParamDefault{`-1`}
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+  *                     measures on faces around the vertex}
+  *   \cgalParamNEnd
+  *
+  * \cgalNamedParamsEnd
+  *
+  * @see `interpolated_corrected_mean_curvature()`
+  * @see `interpolated_corrected_gaussian_curvature()`
+  * @see `interpolated_corrected_curvatures()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
   typename NamedParameters = parameters::Default_named_parameters>
@@ -1179,84 +1182,84 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 }
 
 /**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* Computes the interpolated corrected curvatures across the mesh, based on the provided property maps.
-* By providing mean, gaussian and/or principal curvature property maps as named parameters, the user
-* can choose which curvatures to compute.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-*
-* \cgalNamedParamsBegin
-*
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using compute_vertex_normals()}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_mean_curvature_map}
-*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `WritablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%FT` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, mean curvatures won't be computed}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_gaussian_curvature_map}
-*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `WritablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%FT` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, gaussian curvatures won't be computed}
-*   \cgalParamNEnd
-*
-*
-*   \cgalParamNBegin{vertex_principal_curvatures_and_directions_map}
-*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `WritablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Principal_curvatures_and_directions` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<Principal_curvatures_and_directions<GT>>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, mean principal won't be computed}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the
-*                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball.}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
-*                     measures on faces around the vertex}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_gaussian_curvature()`
-* @see `interpolated_corrected_principal_curvatures_and_directions()`
+  * \ingroup PMP_corrected_curvatures_grp
+  *
+  * Computes the interpolated corrected curvatures across the mesh, based on the provided property maps.
+  * By providing mean, gaussian and/or principal curvature property maps as named parameters, the user
+  * can choose which curvatures to compute.
+  *
+  * @tparam PolygonMesh a model of `FaceListGraph`.
+  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
+  *
+  * @param pmesh the polygon mesh.
+  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+  *
+  * \cgalNamedParamsBegin
+  *
+  *   \cgalParamNBegin{vertex_point_map}
+  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Point_3` as value type}
+  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
+  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_normal_map}
+  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Vector_3` as value type}
+  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+  *                     computed using compute_vertex_normals()}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_mean_curvature_map}
+  *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `WritablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%FT` as value type}
+  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, mean curvatures won't be computed}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_gaussian_curvature_map}
+  *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `WritablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%FT` as value type}
+  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, gaussian curvatures won't be computed}
+  *   \cgalParamNEnd
+  *
+  *
+  *   \cgalParamNBegin{vertex_principal_curvatures_and_directions_map}
+  *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `WritablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Principal_curvatures_and_directions` as value type}
+  *     \cgalParamDefault{`get(dynamic_vertex_property_t<Principal_curvatures_and_directions<GT>>(), pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, mean principal won't be computed}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{ball_radius}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+  *                           by summing measures of faces inside a ball of this radius centered at the
+  *                           vertex expanded from. The summed face measures are weighted by their
+  *                           inclusion ratio inside this ball.}
+  *     \cgalParamType{`GT::FT`}
+  *     \cgalParamDefault{`-1`}
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
+  *                     measures on faces around the vertex}
+  *   \cgalParamNEnd
+  *
+  * \cgalNamedParamsEnd
+  *
+  * @see `interpolated_corrected_mean_curvature()`
+  * @see `interpolated_corrected_gaussian_curvature()`
+  * @see `interpolated_corrected_principal_curvatures_and_directions()`
 */
 template<typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
@@ -1266,6 +1269,60 @@ template<typename PolygonMesh,
   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np);
 }
 
+/**
+  * \ingroup PMP_corrected_curvatures_grp
+  * computes the interpolated corrected mean curvature at a vertex of a triangle mesh.
+  *
+  * @tparam GT a geometric traits class that provides the nested type `FT`,
+  * @tparam PolygonMesh a model of `FaceListGraph`
+  * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
+  *
+  * @param pmesh the polygon mesh
+  * @param v the vertex of `pmesh` to compute the mean curvature at
+  * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
+  *
+  * \cgalNamedParamsBegin
+  *   \cgalParamNBegin{vertex_point_map}
+  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Point_3` as value type}
+  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
+  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_normal_map}
+  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Vector_3` as value type}
+  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+  *                     computed using compute_vertex_normals()}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{ball_radius}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+  *                           by summing measures of faces inside a ball of this radius centered at the
+  *                           vertex expanded from. The summed face measures are weighted by their
+  *                           inclusion ratio inside this ball}
+  *     \cgalParamType{`GT::FT`}
+  *     \cgalParamDefault{`-1`}
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+  *                     measures on faces around the vertex}
+  *   \cgalParamNEnd
+  *
+  * \cgalNamedParamsEnd
+  *
+  * @return the interpolated corrected mean curvature at the vertex `v`
+  *
+  * @see `interpolated_corrected_mean_curvature()`
+  * @see `interpolated_corrected_gaussian_curvature_at_vertex()`
+  * @see `interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
+  * @see `interpolated_corrected_curvatures_at_vertex()`
+*/
+
 template<typename GT, typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
   typename GT::FT interpolated_corrected_mean_curvature_at_vertex(const PolygonMesh& pmesh,
@@ -1273,11 +1330,65 @@ template<typename GT, typename PolygonMesh,
     const NamedParameters& np = parameters::default_values())
 {
   // use interpolated_corrected_curvatures_at_vertex to compute mean curvature
-  typename GT::FT* mean_curvature = new typename GT::FT();
-  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_mean_curvature(mean_curvature));
-  return *mean_curvature;
+  typename GT::FT mean_curvature;
+  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_mean_curvature(&mean_curvature));
+  return mean_curvature;
 }
 
+/**
+  * \ingroup PMP_corrected_curvatures_grp
+  * computes the interpolated corrected Gaussian curvature at a vertex of a triangle mesh.
+  *
+  * @tparam GT a geometric traits class that provides the nested type `FT`,
+  * @tparam PolygonMesh a model of `FaceListGraph`
+  * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
+  *
+  * @param pmesh the polygon mesh
+  * @param v the vertex of `pmesh` to compute the Gaussian curvature at
+  * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
+  *
+  * \cgalNamedParamsBegin
+  *   \cgalParamNBegin{vertex_point_map}
+  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Point_3` as value type}
+  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
+  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_normal_map}
+  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Vector_3` as value type}
+  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+  *                     computed using compute_vertex_normals()}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{ball_radius}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+  *                           by summing measures of faces inside a ball of this radius centered at the
+  *                           vertex expanded from. The summed face measures are weighted by their
+  *                           inclusion ratio inside this ball}
+  *     \cgalParamType{`GT::FT`}
+  *     \cgalParamDefault{`-1`}
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+  *                     measures on faces around the vertex}
+  *   \cgalParamNEnd
+  *
+  * \cgalNamedParamsEnd
+  *
+  * @return the interpolated corrected Gaussian curvature at the vertex `v`
+  *
+  * @see `interpolated_corrected_gaussian_curvature()`
+  * @see `interpolated_corrected_mean_curvature_at_vertex()`
+  * @see `interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
+  * @see `interpolated_corrected_curvatures_at_vertex()`
+*/
+
 template<typename GT, typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
   typename GT::FT interpolated_corrected_gaussian_curvature_at_vertex(const PolygonMesh& pmesh,
@@ -1285,11 +1396,64 @@ template<typename GT, typename PolygonMesh,
     const NamedParameters& np = parameters::default_values())
 {
   // use interpolated_corrected_curvatures_at_vertex to compute gaussian curvature
-  typename GT::FT* gc = new typename GT::FT();
-  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_gaussian_curvature(gc));
-  return *gc;
+  typename GT::FT gc;
+  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_gaussian_curvature(&gc));
+  return gc;
 }
 
+/**
+  * \ingroup PMP_corrected_curvatures_grp
+  * computes the interpolated corrected principal curvatures and directions at a vertex of a triangle mesh.
+  *
+  * @tparam GT the geometric traits class,
+  * @tparam PolygonMesh a model of `FaceListGraph`
+  * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
+  *
+  * @param pmesh the polygon mesh
+  * @param v the vertex of `pmesh` to compute the principal curvatures and directions at
+  * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
+  *
+  * \cgalNamedParamsBegin
+  *   \cgalParamNBegin{vertex_point_map}
+  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Point_3` as value type}
+  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
+  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_normal_map}
+  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Vector_3` as value type}
+  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+  *                     computed using compute_vertex_normals()}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{ball_radius}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+  *                           by summing measures of faces inside a ball of this radius centered at the
+  *                           vertex expanded from. The summed face measures are weighted by their
+  *                           inclusion ratio inside this ball}
+  *     \cgalParamType{`GT::FT`}
+  *     \cgalParamDefault{`-1`}
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+  *                     measures on faces around the vertex}
+  *   \cgalParamNEnd
+  * \cgalNamedParamsEnd
+  *
+  * @return the interpolated corrected principal curvatures and directions at the vertex `v`
+  *
+  * @see `interpolated_corrected_principal_curvatures_and_directions()`
+  * @see `interpolated_corrected_mean_curvature_at_vertex()`
+  * @see `interpolated_corrected_gaussian_curvature_at_vertex()`
+  * @see `interpolated_corrected_curvatures_at_vertex()`
+*/
+
 template<typename GT, typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
   Principal_curvatures_and_directions<GT> interpolated_corrected_principal_curvatures_and_directions_at_vertex(const PolygonMesh& pmesh,
@@ -1297,11 +1461,86 @@ template<typename GT, typename PolygonMesh,
     const NamedParameters& np = parameters::default_values())
 {
   // use interpolated_corrected_curvatures_at_vertex to compute principal curvatures
-  Principal_curvatures_and_directions<GT>* pcd = new Principal_curvatures_and_directions<GT>();
-  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(pcd));
-  return *pcd;
+  Principal_curvatures_and_directions<GT> pcd;
+  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(&pcd));
+  return pcd;
 }
 
+/**
+  * \ingroup PMP_corrected_curvatures_grp
+  * Computes the interpolated corrected curvatures at a certain vertex, based on the provided pointers.
+  * By providing mean, gaussian and/or principal curvature pointers as named parameters, the user
+  * can choose which curvatures to compute.
+  * The pointers are used to store the computed curvatures.
+  * The user is responsible for the memory management of the pointers.
+  *
+  * @tparam PolygonMesh a model of `FaceListGraph`
+  * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
+  *
+  * @param pmesh the polygon mesh
+  * @param v the vertex of `pmesh` to compute the curvatures at
+  * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
+  *
+  * \cgalNamedParamsBegin
+  *   \cgalParamNBegin{vertex_point_map}
+  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Point_3` as value type}
+  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
+  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_normal_map}
+  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadablePropertyMap` with
+  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+  *                    as key type and `%Vector_3` as value type}
+  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+  *                     computed using compute_vertex_normals()}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_mean_curvature}
+  *     \cgalParamDescription{a pointer to a scalar value to store the mean curvature at the vertex `v`}
+  *     \cgalParamType{`GT::FT*`}
+  *     \cgalParamDefault{`nullptr`}
+  *     \cgalParamExtra{If this parameter is omitted, mean curvature won't be computed}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_gaussian_curvature}
+  *     \cgalParamDescription{a pointer to a scalar value to store the gaussian curvature at the vertex `v`}
+  *     \cgalParamType{`GT::FT*`}
+  *     \cgalParamDefault{`nullptr`}
+  *     \cgalParamExtra{If this parameter is omitted, gaussian curvature won't be computed}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_principal_curvatures_and_directions}
+  *     \cgalParamDescription{a pointer to a Principal_curvatures_and_directions object to store the principal curvatures and directions at the vertex `v`}
+  *     \cgalParamType{`Principal_curvatures_and_directions<GT>*`}
+  *     \cgalParamDefault{`nullptr`}
+  *     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions won't be computed}
+  *  \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{ball_radius}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+  *                           by summing measures of faces inside a ball of this radius centered at the
+  *                           vertex expanded from. The summed face measures are weighted by their
+  *                           inclusion ratio inside this ball.}
+  *     \cgalParamType{`GT::FT`}
+  *     \cgalParamDefault{`-1`}
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
+  *                     measures on faces around the vertex}
+  *   \cgalParamNEnd
+  *
+  * \cgalNamedParamsEnd
+  *
+  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
+  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_at_vertex()`
+  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_at_vertex()`
+  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
+*/
 template<typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
   void interpolated_corrected_curvatures_at_vertex(const PolygonMesh& pmesh,

From 483e8b8e509ee4420ba0861ab70dd5a50133f7b0 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 24 Jan 2023 08:44:09 +0200
Subject: [PATCH 0106/1398] User manual + add example file for 1 vertex
 curvature

---
 .../Polygon_mesh_processing.txt               | 16 ++++-
 .../Polygon_mesh_processing/CMakeLists.txt    |  2 +
 ...corrected_curvatures_at_vertex_example.cpp | 60 +++++++++++++++++++
 ...erpolated_corrected_curvatures_example.cpp |  2 +
 ...nterpolated_corrected_curvature_measures.h |  2 -
 5 files changed, 79 insertions(+), 3 deletions(-)
 create mode 100644 Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 1d7184561a80..49f912ee5ca7 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -889,7 +889,7 @@ correct vertex normals are provided.
 The implementation is generic in terms of mesh data structure. It can be used on Surface_mesh,
 Polyhedron_3 and other polygonal mesh structures based on the Face Graph Model.
 
-These computations are performed using :
+These computations are performed using (on all vertices of mesh):
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
@@ -898,6 +898,13 @@ These computations are performed using :
 Where it is recommended to use the last function for computing multiple curvatures (example: mean and gaussian)
 as the implementation performs the shared computations only once, making it more efficient.
 
+Similarly, we can use the following example functions to compute the curvatures on a specific vertex:
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_at_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_at_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_at_vertex()`
+
+
 \cgalFigureRef{icc_diff_radius} shows how the mean curvature changes depending on
 the ball_radius named parameter which can be set to a value > 0 to get a smoother
 distribution of values and "diffuse" the extreme values of curvatures across the mesh.
@@ -934,6 +941,13 @@ not provide storage for the curvatures.
 
 \cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp}
 
+\subsection ICCExamplePH Interpolated Corrected Curvature on a Vertex Example
+
+The following example illustrates how to
+compute the curvatures on a specific vertex
+
+\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp}
+
 ****************************************
 \section PMPSlicer Slicer
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index ab084384835b..5e840c38a508 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -109,6 +109,8 @@ if(TARGET CGAL::Eigen3_support)
   target_link_libraries(interpolated_corrected_curvatures_example PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("interpolated_corrected_curvatures_polyhedron_example.cpp")
   target_link_libraries(interpolated_corrected_curvatures_polyhedron_example PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("interpolated_corrected_curvatures_at_vertex_example.cpp")
+  target_link_libraries(interpolated_corrected_curvatures_at_vertex_example PUBLIC CGAL::Eigen3_support)
 
 endif()
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp
new file mode 100644
index 000000000000..6ed061db93b8
--- /dev/null
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp
@@ -0,0 +1,60 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <boost/graph/graph_traits.hpp>
+
+#include <iostream>
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
+typedef Epic_kernel::FT FT;
+typedef CGAL::Surface_mesh<Epic_kernel::Point_3> Surface_Mesh;
+typedef boost::graph_traits<Surface_Mesh>::face_descriptor face_descriptor;
+typedef boost::graph_traits<Surface_Mesh>::vertex_descriptor vertex_descriptor;
+
+int main(int argc, char* argv[])
+{
+  // instantiating and reading mesh 
+  Surface_Mesh smesh;
+  const std::string filename = (argc > 1) ?
+    argv[1] :
+    CGAL::data_file_path("meshes/small_bunny.obj");
+
+  if (!CGAL::IO::read_polygon_mesh(filename, smesh))
+  {
+    std::cerr << "Invalid input file." << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  // loop over vertices and use vertex_descriptor to compute a curvature on one vertex
+  for (vertex_descriptor v : vertices(smesh))
+  {
+    FT h = PMP::interpolated_corrected_mean_curvature_at_vertex<Epic_kernel>(smesh, v);
+    FT g = PMP::interpolated_corrected_gaussian_curvature_at_vertex<Epic_kernel>(smesh, v);
+    PMP::Principal_curvatures_and_directions<Epic_kernel> p = 
+      PMP::interpolated_corrected_principal_curvatures_and_directions_at_vertex<Epic_kernel>(smesh, v);
+
+    // we can also specify a ball radius for expansion and a user defined vertex normals map using 
+    // named parameters. Refer to interpolated_corrected_curvatures_example.cpp to see example usage.
+
+    // Can also use interpolated_corrected_curvatures_at_vertex() to compute multiple curvatures
+    // on the vertex at the same time. This is more efficient than computing each one separately.
+    // The following commented lines show this (all mentioned named parameters work on it as well)
+    // we specify which curvatures we want to compute by passing pointers as named parameters 
+    // as shown. These pointers are used for storing the result as well. in this example we 
+    // selected mean and gaussian curvatures
+    // PMP::interpolated_corrected_curvatures_at_vertex(
+    //   smesh,
+    //   v, 
+    //   CGAL::parameters::vertex_mean_curvature(&h)
+    //   .vertex_gaussian_curvature(&g)
+    // );
+
+    std::cout << v.idx() << ": HC = " << h
+      << ", GC = " << g << "\n"
+      << ", PC = [ " << p.min_curvature << " , " << p.max_curvature << " ]\n";
+  }
+}
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index 33d34cd34f13..91266f594135 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -47,6 +47,8 @@ int main(int argc, char* argv[])
   assert(created);
 
   // user can call these fucntions to compute a specfic curvature type on each vertex.
+  // (Note: if no ball radius is specified, the measure expansion of each vertex happens by 
+  // summing measures on faces adjacent to each vertex.)
   PMP::interpolated_corrected_mean_curvature(
     smesh,
     mean_curvature_map
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index cdd25aefc0e5..847bac1f5c06 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -669,7 +669,6 @@ template<typename PolygonMesh,
 
   if (radius < 0)
   {
-    std::cout << -1;
     vertex_measures = interpolated_corrected_measures_one_vertex_no_radius<GT>(
       pmesh,
       v,
@@ -682,7 +681,6 @@ template<typename PolygonMesh,
   }
   else
   {
-    std::cout << radius;
     vertex_measures = interpolated_corrected_measures_one_vertex<GT>(
       pmesh,
       v,

From a7cd6a275ecabaad05c802b4593e1f7235e25e65 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 24 Jan 2023 09:00:24 +0200
Subject: [PATCH 0107/1398] trailling whitespaces

---
 ...olated_corrected_curvatures_at_vertex_example.cpp | 12 ++++++------
 .../interpolated_corrected_curvatures_example.cpp    |  2 +-
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp
index 6ed061db93b8..009c5881f262 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp
@@ -17,7 +17,7 @@ typedef boost::graph_traits<Surface_Mesh>::vertex_descriptor vertex_descriptor;
 
 int main(int argc, char* argv[])
 {
-  // instantiating and reading mesh 
+  // instantiating and reading mesh
   Surface_Mesh smesh;
   const std::string filename = (argc > 1) ?
     argv[1] :
@@ -34,21 +34,21 @@ int main(int argc, char* argv[])
   {
     FT h = PMP::interpolated_corrected_mean_curvature_at_vertex<Epic_kernel>(smesh, v);
     FT g = PMP::interpolated_corrected_gaussian_curvature_at_vertex<Epic_kernel>(smesh, v);
-    PMP::Principal_curvatures_and_directions<Epic_kernel> p = 
+    PMP::Principal_curvatures_and_directions<Epic_kernel> p =
       PMP::interpolated_corrected_principal_curvatures_and_directions_at_vertex<Epic_kernel>(smesh, v);
 
-    // we can also specify a ball radius for expansion and a user defined vertex normals map using 
+    // we can also specify a ball radius for expansion and a user defined vertex normals map using
     // named parameters. Refer to interpolated_corrected_curvatures_example.cpp to see example usage.
 
     // Can also use interpolated_corrected_curvatures_at_vertex() to compute multiple curvatures
     // on the vertex at the same time. This is more efficient than computing each one separately.
     // The following commented lines show this (all mentioned named parameters work on it as well)
-    // we specify which curvatures we want to compute by passing pointers as named parameters 
-    // as shown. These pointers are used for storing the result as well. in this example we 
+    // we specify which curvatures we want to compute by passing pointers as named parameters
+    // as shown. These pointers are used for storing the result as well. in this example we
     // selected mean and gaussian curvatures
     // PMP::interpolated_corrected_curvatures_at_vertex(
     //   smesh,
-    //   v, 
+    //   v,
     //   CGAL::parameters::vertex_mean_curvature(&h)
     //   .vertex_gaussian_curvature(&g)
     // );
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index 91266f594135..511288702336 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -47,7 +47,7 @@ int main(int argc, char* argv[])
   assert(created);
 
   // user can call these fucntions to compute a specfic curvature type on each vertex.
-  // (Note: if no ball radius is specified, the measure expansion of each vertex happens by 
+  // (Note: if no ball radius is specified, the measure expansion of each vertex happens by
   // summing measures on faces adjacent to each vertex.)
   PMP::interpolated_corrected_mean_curvature(
     smesh,

From fc943a4c317588c51b7e64da23dd84c4fef9672a Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 24 Jan 2023 09:18:05 +0200
Subject: [PATCH 0108/1398] minor doc fixes

---
 .../Polygon_mesh_processing/Polygon_mesh_processing.txt   | 8 ++++----
 .../doc/Polygon_mesh_processing/examples.txt              | 1 +
 2 files changed, 5 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 49f912ee5ca7..426e9e3b54a6 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -898,7 +898,7 @@ These computations are performed using (on all vertices of mesh):
 Where it is recommended to use the last function for computing multiple curvatures (example: mean and gaussian)
 as the implementation performs the shared computations only once, making it more efficient.
 
-Similarly, we can use the following example functions to compute the curvatures on a specific vertex:
+Similarly, we can use the following functions to compute curvatures on a specific vertex:
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_at_vertex()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_at_vertex()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
@@ -924,7 +924,7 @@ Property maps are an API introduced in the boost library that allows associating
 values to keys. In the following examples, for each property map, we associate
 a curvature value to each vertex.
 
-\subsection ICCExampleSM Interpolated Corrected Curvature on a Surface Mesh Example
+\subsection ICCExampleSM Interpolated Corrected Curvatures on a Surface Mesh Example
 
 The following example illustrates how to
 compute the curvatures on vertices
@@ -932,7 +932,7 @@ and store them in property maps provided by the class `Surface_mesh`.
 
 \cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp}
 
-\subsection ICCExamplePH Interpolated Corrected Curvature on a Polyhedron Example
+\subsection ICCExamplePH Interpolated Corrected Curvatures on a Polyhedron Example
 
 The following example illustrates how to
 compute the curvatures on vertices
@@ -941,7 +941,7 @@ not provide storage for the curvatures.
 
 \cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp}
 
-\subsection ICCExamplePH Interpolated Corrected Curvature on a Vertex Example
+\subsection ICCExampleSV Interpolated Corrected Curvatures on a Vertex Example
 
 The following example illustrates how to
 compute the curvatures on a specific vertex
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
index 0588d1c76e14..58af6e391b56 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
@@ -21,6 +21,7 @@
 \example Polygon_mesh_processing/isotropic_remeshing_example.cpp
 \example Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
 \example Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
+\example Polygon_mesh_processing/interpolated_corrected_gaussian_curvature_at_vertex.cpp
 \example Polygon_mesh_processing/delaunay_remeshing_example.cpp
 \example Polygon_mesh_processing/compute_normals_example_Polyhedron.cpp
 \example Polygon_mesh_processing/hausdorff_distance_remeshing_example.cpp

From ca4e412e0e1d98c605ef6cc16eb448a43f66158f Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 24 Jan 2023 09:35:20 +0200
Subject: [PATCH 0109/1398] minor fix

---
 .../test/Polygon_mesh_processing/CMakeLists.txt                 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index c446a7395dee..8608e203c6eb 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -1,4 +1,4 @@
-0# Created by the script cgal_create_CMakeLists
+# Created by the script cgal_create_CMakeLists
 # This is the CMake script for compiling a set of CGAL applications.
 
 cmake_minimum_required(VERSION 3.1...3.23)

From da3db9a40674ac30071ec9e579412e1c2ba9a8a8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 24 Jan 2023 09:58:35 +0100
Subject: [PATCH 0110/1398] typo

---
 .../test/Polygon_mesh_processing/CMakeLists.txt                 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index c446a7395dee..8608e203c6eb 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -1,4 +1,4 @@
-0# Created by the script cgal_create_CMakeLists
+# Created by the script cgal_create_CMakeLists
 # This is the CMake script for compiling a set of CGAL applications.
 
 cmake_minimum_required(VERSION 3.1...3.23)

From 50ba18725ca32ab402357f13409bcee7f1e9fd79 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 24 Jan 2023 11:10:29 +0100
Subject: [PATCH 0111/1398] fix typename usage

---
 ...nterpolated_corrected_curvature_measures.h | 26 +++++++++----------
 ...test_interpolated_corrected_curvatures.cpp |  6 ++---
 2 files changed, 16 insertions(+), 16 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 94aaff9b8b52..94520cf403dd 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -479,7 +479,7 @@ Principal_curvatures_and_directions<GT> principal_curvatures_and_directions_from
 }
 
 template<typename GT, typename PolygonMesh, typename VPM, typename VNM>
-typename Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
+Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
   const PolygonMesh pmesh,
   const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
   const bool is_mean_curvature_selected,
@@ -498,7 +498,7 @@ typename Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radiu
   std::queue<Face_descriptor> bfs_queue;
   std::unordered_set<Face_descriptor> bfs_visited;
 
-  typename Vertex_measures<GT> vertex_measures;
+  Vertex_measures<GT> vertex_measures;
 
   std::vector<Vector_3> x;
   std::vector<Vector_3> u;
@@ -538,7 +538,7 @@ typename Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radiu
 
 
 template<typename GT, typename PolygonMesh, typename VPM, typename VNM>
-typename Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
+Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
   const PolygonMesh pmesh,
   const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
   const typename GT::FT radius,
@@ -558,10 +558,10 @@ typename Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
   std::queue<Face_descriptor> bfs_queue;
   std::unordered_set<Face_descriptor> bfs_visited;
 
-  typename Vertex_measures<GT> vertex_measures;
+  Vertex_measures<GT> vertex_measures;
 
-  typename Point_3 vp = get(vpm, v);
-  typename Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
+  Point_3 vp = get(vpm, v);
+  Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
 
   for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
     if (f != boost::graph_traits<PolygonMesh>::null_face())
@@ -626,13 +626,13 @@ template<typename PolygonMesh,
   void interpolated_corrected_curvatures_one_vertex(
     const PolygonMesh pmesh,
     const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-    NamedParameters& np = parameters::default_values()
+    const NamedParameters& np = parameters::default_values()
   )
 {
   typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
   typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
 
-  typedef dynamic_vertex_property_t<GT::Vector_3> Vector_map_tag;
+  typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
   typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
   typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
     NamedParameters,
@@ -659,7 +659,7 @@ template<typename PolygonMesh,
 
   typename GT::FT* vertex_mean_curvature = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature), nullptr);
   typename GT::FT* vertex_gaussian_curvature = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature), nullptr);
-  typename Principal_curvatures_and_directions<GT>* vertex_principal_curvatures_and_directions = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvatures_and_directions), nullptr);
+  Principal_curvatures_and_directions<GT>* vertex_principal_curvatures_and_directions = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvatures_and_directions), nullptr);
 
   const bool is_mean_curvature_selected = (vertex_mean_curvature != nullptr);
   const bool is_gaussian_curvature_selected = (vertex_gaussian_curvature != nullptr);
@@ -703,7 +703,7 @@ template<typename PolygonMesh,
   }
 
   if (is_principal_curvatures_and_directions_selected) {
-    const GT::Vector_3  v_normal = get(vnm, v);
+    const typename GT::Vector_3  v_normal = get(vnm, v);
     const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
       vertex_measures.anisotropic_measure,
       vertex_measures.area_measure,
@@ -1046,7 +1046,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
   typename NamedParameters = parameters::Default_named_parameters>
   void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
     VertexCurvatureMap& vcm,
-    NamedParameters& np = parameters::default_values())
+    const NamedParameters& np = parameters::default_values())
 {
   interpolated_corrected_curvatures(pmesh, np.vertex_mean_curvature_map(vcm));
 }
@@ -1109,7 +1109,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
   typename NamedParameters = parameters::Default_named_parameters>
   void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
     VertexCurvatureMap& vcm,
-    NamedParameters& np = parameters::default_values())
+    const NamedParameters& np = parameters::default_values())
 {
   interpolated_corrected_curvatures(pmesh, np.vertex_gaussian_curvature_map(vcm));
 }
@@ -1173,7 +1173,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
   typename NamedParameters = parameters::Default_named_parameters>
   void interpolated_corrected_principal_curvatures_and_directions(const PolygonMesh& pmesh,
     VertexCurvatureMap& vcm,
-    NamedParameters& np = parameters::default_values())
+    const NamedParameters& np = parameters::default_values())
 {
   interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvatures_and_directions_map(vcm));
 }
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index 163c9b8d334d..7f8aa1f7d691 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -63,12 +63,12 @@ void test_average_curvatures(std::string mesh_path, Average_test_info test_info)
     std::cerr << "Invalid input file." << std::endl;
   }
 
-  typedef boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
 
-  boost::property_map<PolygonMesh, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
+  typename boost::property_map<PolygonMesh, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
     mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), pmesh),
     gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), pmesh);
-  boost::property_map<PolygonMesh, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
+  typename boost::property_map<PolygonMesh, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
     principal_curvatures_and_directions_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), pmesh);
 
   // test_info.expansion_radius -> test if no radius is provided by user.

From 69610f6958dc51f31ede8a0e75c32e4f4c9a5c84 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 24 Jan 2023 11:15:04 +0100
Subject: [PATCH 0112/1398] move function

---
 ...nterpolated_corrected_curvature_measures.h | 128 +++++++++---------
 1 file changed, 64 insertions(+), 64 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 94520cf403dd..821436dc05f6 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -990,17 +990,15 @@ class Interpolated_corrected_curvatures_computer
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* Computes the interpolated corrected mean curvature across the mesh
-* and stores it in a vertex property map `vcm`.
+* Computes the interpolated corrected curvatures across the mesh, based on the provided property maps.
+* By providing mean, gaussian and/or principal curvature property maps as named parameters, the user
+* can choose which curvatures to compute.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam VertexCurvatureMap model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and `GT::FT` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
-* @param vcm the vertex property map in which the computed mean curvatures are stored.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
 * \cgalNamedParamsBegin
 *
@@ -1024,37 +1022,63 @@ class Interpolated_corrected_curvatures_computer
 *                     computed using compute_vertex_normals()}
 *   \cgalParamNEnd
 *
+*   \cgalParamNBegin{vertex_mean_curvature_map}
+*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `WritablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+*                    as key type and `%FT` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, mean curvatures won't be computed}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_gaussian_curvature_map}
+*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `WritablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+*                    as key type and `%FT` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, gaussian curvatures won't be computed}
+*   \cgalParamNEnd
+*
+*
+*   \cgalParamNBegin{vertex_principal_curvatures_and_directions_map}
+*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `WritablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+*                    as key type and `%Principal_curvatures_and_directions` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<Principal_curvatures_and_directions<GT>>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, mean principal won't be computed}
+*   \cgalParamNEnd
+*
 *   \cgalParamNBegin{ball_radius}
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
 *                           by summing measures of faces inside a ball of this radius centered at the
 *                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball}
+*                           inclusion ratio inside this ball.}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
 *                     measures on faces around the vertex}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
 *
+* @see `interpolated_corrected_mean_curvature()`
 * @see `interpolated_corrected_gaussian_curvature()`
 * @see `interpolated_corrected_principal_curvatures_and_directions()`
-* @see `interpolated_corrected_curvatures()`
 */
-
-template<typename PolygonMesh, typename VertexCurvatureMap,
+template<typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
-    VertexCurvatureMap& vcm,
+  void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
     const NamedParameters& np = parameters::default_values())
 {
-  interpolated_corrected_curvatures(pmesh, np.vertex_mean_curvature_map(vcm));
+  internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np);
 }
 
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* Computes the interpolated corrected gaussian curvature across the mesh
+* Computes the interpolated corrected mean curvature across the mesh
 * and stores it in a vertex property map `vcm`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
@@ -1063,7 +1087,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
-* @param vcm the vertex property map in which the computed gaussian curvatures are stored.
+* @param vcm the vertex property map in which the computed mean curvatures are stored.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * \cgalNamedParamsBegin
@@ -1101,34 +1125,34 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *
 * \cgalNamedParamsEnd
 *
-* @see `interpolated_corrected_mean_curvature()`
+* @see `interpolated_corrected_gaussian_curvature()`
 * @see `interpolated_corrected_principal_curvatures_and_directions()`
 * @see `interpolated_corrected_curvatures()`
 */
+
 template<typename PolygonMesh, typename VertexCurvatureMap,
   typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
+  void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
     VertexCurvatureMap& vcm,
     const NamedParameters& np = parameters::default_values())
 {
-  interpolated_corrected_curvatures(pmesh, np.vertex_gaussian_curvature_map(vcm));
+  interpolated_corrected_curvatures(pmesh, np.vertex_mean_curvature_map(vcm));
 }
 
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* Computes the interpolated corrected principal curvatures across the mesh
+* Computes the interpolated corrected gaussian curvature across the mesh
 * and stores it in a vertex property map `vcm`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and
-* `std::tuple<GT::FT, GT::FT, Eigen::Vector<GT::FT, 3>, Eigen::Vector<GT::FT, 3>>` as value type.
+* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and `GT::FT` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
-* @param vcm the vertex property map in which the computed principal curvatures are stored.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+* @param vcm the vertex property map in which the computed gaussian curvatures are stored.
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * \cgalNamedParamsBegin
 *
@@ -1166,29 +1190,32 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * \cgalNamedParamsEnd
 *
 * @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_gaussian_curvature()`
+* @see `interpolated_corrected_principal_curvatures_and_directions()`
 * @see `interpolated_corrected_curvatures()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
   typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_principal_curvatures_and_directions(const PolygonMesh& pmesh,
+  void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
     VertexCurvatureMap& vcm,
     const NamedParameters& np = parameters::default_values())
 {
-  interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvatures_and_directions_map(vcm));
+  interpolated_corrected_curvatures(pmesh, np.vertex_gaussian_curvature_map(vcm));
 }
 
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* Computes the interpolated corrected curvatures across the mesh, based on the provided property maps.
-* By providing mean, gaussian and/or principal curvature property maps as named parameters, the user
-* can choose which curvatures to compute.
+* Computes the interpolated corrected principal curvatures across the mesh
+* and stores it in a vertex property map `vcm`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
+* @tparam VertexCurvatureMap model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and
+* `std::tuple<GT::FT, GT::FT, Eigen::Vector<GT::FT, 3>, Eigen::Vector<GT::FT, 3>>` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
+* @param vcm the vertex property map in which the computed principal curvatures are stored.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
 * \cgalNamedParamsBegin
@@ -1213,42 +1240,14 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *                     computed using compute_vertex_normals()}
 *   \cgalParamNEnd
 *
-*   \cgalParamNBegin{vertex_mean_curvature_map}
-*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `WritablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%FT` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, mean curvatures won't be computed}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_gaussian_curvature_map}
-*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `WritablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%FT` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, gaussian curvatures won't be computed}
-*   \cgalParamNEnd
-*
-*
-*   \cgalParamNBegin{vertex_principal_curvatures_and_directions_map}
-*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `WritablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Principal_curvatures_and_directions` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<Principal_curvatures_and_directions<GT>>(), pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, mean principal won't be computed}
-*   \cgalParamNEnd
-*
 *   \cgalParamNBegin{ball_radius}
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
 *                           by summing measures of faces inside a ball of this radius centered at the
 *                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball.}
+*                           inclusion ratio inside this ball}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
 *                     measures on faces around the vertex}
 *   \cgalParamNEnd
 *
@@ -1256,14 +1255,15 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *
 * @see `interpolated_corrected_mean_curvature()`
 * @see `interpolated_corrected_gaussian_curvature()`
-* @see `interpolated_corrected_principal_curvatures_and_directions()`
+* @see `interpolated_corrected_curvatures()`
 */
-template<typename PolygonMesh,
+template<typename PolygonMesh, typename VertexCurvatureMap,
   typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
+  void interpolated_corrected_principal_curvatures_and_directions(const PolygonMesh& pmesh,
+    VertexCurvatureMap& vcm,
     const NamedParameters& np = parameters::default_values())
 {
-  internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np);
+  interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvatures_and_directions_map(vcm));
 }
 
 template<typename GT, typename PolygonMesh,

From 5c682f5b94b291d72e245ab76dd8c437c29d0e8e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 24 Jan 2023 11:27:31 +0100
Subject: [PATCH 0113/1398] fix warning

---
 .../Interpolated_corrected_principal_curvatures_plugin.cpp  | 6 ++----
 1 file changed, 2 insertions(+), 4 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
index 789ba4a06567..e5a01f7b3c3b 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
@@ -81,7 +81,7 @@ void compute(SMesh* sMesh,
     CGAL::parameters::ball_radius(0)
   );
 
-  typename Epic_kernel::FT max_curvature_magnitude_on_mesh = 0;
+  double max_curvature_magnitude_on_mesh = 0;
   for (Vertex_descriptor v : vertices(*sMesh))
   {
     const PMP::Principal_curvatures_and_directions<Epic_kernel> pc = principal_curvatures_and_directions_map[v];
@@ -99,11 +99,9 @@ void compute(SMesh* sMesh,
     // compute min edge len around central vertex
     // to scale the ribbons used to display the directions
 
-    typedef EPICK::FT FT;
-
     const std::size_t n = CGAL::edges(*sMesh).size();
 
-    Epic_kernel::FT avg_edge_length = 0;
+    double avg_edge_length = 0;
     if (n > 0) {
       for (auto e : CGAL::edges(*sMesh))
         avg_edge_length += PMP::edge_length(e, *sMesh);

From 999b475e4ca5142589b239fb8418a7ff78254c56 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 24 Jan 2023 14:08:02 +0200
Subject: [PATCH 0114/1398] tests (incomplete) + minor typename fix

still not passing single vertex on polyhedron due to a problem with vertex normal map
---
 ...nterpolated_corrected_curvature_measures.h | 10 ++--
 ...test_interpolated_corrected_curvatures.cpp | 58 ++++++++++++++++---
 2 files changed, 55 insertions(+), 13 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 847bac1f5c06..4cf352e32e48 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -399,8 +399,8 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
 //    const typename GT::FT R = r * r;
 //    const typename GT::FT acc = 1.0 / res;
 //    std::size_t samples_in = 0;
-//    for (GT::FT alpha = acc / 3; alpha < 1; alpha += acc)
-//        for (GT::FT beta = acc / 3; beta < 1 - alpha; beta += acc)
+//    for (typename GT::FT alpha = acc / 3; alpha < 1; alpha += acc)
+//        for (typename GT::FT beta = acc / 3; beta < 1 - alpha; beta += acc)
 //        {
 //            if ((alpha * x1 + beta * x2 + (1 - alpha - beta) * x3 - c).squared_length() < R)
 //                samples_in++;
@@ -632,7 +632,7 @@ template<typename PolygonMesh,
   typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
   typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
 
-  typedef dynamic_vertex_property_t<GT::Vector_3> Vector_map_tag;
+  typedef dynamic_vertex_property_t<typename GT::Vector_3> Vector_map_tag;
   typedef typename boost::property_map<PolygonMesh, Vector_map_tag>::const_type Default_vector_map;
   typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_normal_map_t,
     NamedParameters,
@@ -654,8 +654,6 @@ template<typename PolygonMesh,
   typename GT::FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
   if (radius == 0)
     radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
-  else
-    radius = radius;
 
   typename GT::FT* vertex_mean_curvature = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature), nullptr);
   typename GT::FT* vertex_gaussian_curvature = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature), nullptr);
@@ -704,7 +702,7 @@ template<typename PolygonMesh,
   }
 
   if (is_principal_curvatures_and_directions_selected) {
-    const GT::Vector_3  v_normal = get(vnm, v);
+    const typename GT::Vector_3  v_normal = get(vnm, v);
     const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
       vertex_measures.anisotropic_measure,
       vertex_measures.area_measure,
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index 163c9b8d334d..a6fa6f712680 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -54,7 +54,11 @@ bool passes_comparison(Epic_kernel::FT result, Epic_kernel::FT expected, Epic_ke
 }
 
 template <typename PolygonMesh>
-void test_average_curvatures(std::string mesh_path, Average_test_info test_info){
+void test_average_curvatures(std::string mesh_path, 
+  Average_test_info test_info,
+  bool compare_single_vertex = false
+){
+
   PolygonMesh pmesh;
   const std::string filename = CGAL::data_file_path(mesh_path);
 
@@ -116,6 +120,7 @@ void test_average_curvatures(std::string mesh_path, Average_test_info test_info)
   assert(passes_comparison(gaussian_curvature_avg, test_info.gaussian_curvature_avg, test_info.tolerance));
   assert(passes_comparison(principal_curvature_avg, test_info.principal_curvature_avg, test_info.tolerance));
 
+  // computing curvatures together from interpolated_corrected_curvatures()
   PMP::interpolated_corrected_curvatures(
     pmesh,
     CGAL::parameters::ball_radius(test_info.expansion_radius)
@@ -124,7 +129,6 @@ void test_average_curvatures(std::string mesh_path, Average_test_info test_info)
     .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map)
   );
 
-  // are average curvatures computed from interpolated_corrected_curvatures() equal to average curvatures each computed on its own?
   Epic_kernel::FT new_mean_curvature_avg = 0, new_gaussian_curvature_avg = 0, new_principal_curvature_avg = 0;
 
   for (vertex_descriptor v : vertices(pmesh))
@@ -138,22 +142,62 @@ void test_average_curvatures(std::string mesh_path, Average_test_info test_info)
   new_mean_curvature_avg /= vertices(pmesh).size();
   new_gaussian_curvature_avg /= vertices(pmesh).size();
   new_principal_curvature_avg /= vertices(pmesh).size() * 2;
-
+  
+  // are average curvatures computed from interpolated_corrected_curvatures() 
+  // equal to average curvatures each computed on its own?
   assert(passes_comparison(mean_curvature_avg, new_mean_curvature_avg, 0.99));
   assert(passes_comparison(gaussian_curvature_avg, new_gaussian_curvature_avg, 0.99));
   assert(passes_comparison(principal_curvature_avg, new_principal_curvature_avg, 0.99));
+
+  if (compare_single_vertex)
+  {
+    // computing curvatures together from interpolated_corrected_curvatures()
+
+    Epic_kernel::FT single_vertex_mean_curvature_avg = 0,
+      single_vertex_gaussian_curvature_avg = 0,
+      single_vertex_principal_curvature_avg = 0;
+   
+    Epic_kernel::FT h, g;
+    PMP::Principal_curvatures_and_directions<Epic_kernel> p;
+    
+    for (vertex_descriptor v : vertices(pmesh))
+    {
+      PMP::interpolated_corrected_curvatures_at_vertex(
+        pmesh,
+        v, 
+        CGAL::parameters::vertex_gaussian_curvature(&g)
+        .vertex_mean_curvature(&h)
+        .vertex_principal_curvatures_and_directions(&p)
+      );
+
+      single_vertex_mean_curvature_avg += h;
+      single_vertex_gaussian_curvature_avg += g;
+      single_vertex_principal_curvature_avg += p.min_curvature + p.max_curvature;
+    }
+
+    single_vertex_mean_curvature_avg /= vertices(pmesh).size();
+    single_vertex_gaussian_curvature_avg /= vertices(pmesh).size();
+    single_vertex_principal_curvature_avg /= vertices(pmesh).size() * 2;
+
+    assert(passes_comparison(mean_curvature_avg, single_vertex_mean_curvature_avg, 0.99));
+    assert(passes_comparison(gaussian_curvature_avg, single_vertex_gaussian_curvature_avg, 0.99));
+    assert(passes_comparison(principal_curvature_avg, single_vertex_principal_curvature_avg, 0.99));
+  }
+
 }
 
 int main()
 {
   // testing on a simple sphere(r = 0.5), on both Polyhedron & SurfaceMesh:
+  // For this mesh, ina addition to the whole mesh functions, we also compare against the single vertex 
+  // curvature functions to make sure the produce the same results 
   // Expected: Mean Curvature = 2, Gaussian Curvature = 4, Principal Curvatures = 2 & 2 so 2 on avg.
-  test_average_curvatures<Polyhedron>("meshes/sphere.off", Average_test_info(2,4,2));
-  test_average_curvatures<SMesh>("meshes/sphere.off", Average_test_info(2, 4, 2));
+  test_average_curvatures<Polyhedron>("meshes/sphere.off", Average_test_info(2,4,2), true);
+  test_average_curvatures<SMesh>("meshes/sphere.off", Average_test_info(2, 4, 2), true);
 
   // Same mesh but with specified expansion radii of 0 and 0.25 (half radius of sphere)
-  test_average_curvatures<SMesh>("meshes/sphere.off", Average_test_info(2, 4, 2, 0));
-  test_average_curvatures<SMesh>("meshes/sphere.off", Average_test_info(2, 4, 2, 0.25));
+  test_average_curvatures<SMesh>("meshes/sphere.off", Average_test_info(2, 4, 2, 0), true);
+  test_average_curvatures<SMesh>("meshes/sphere.off", Average_test_info(2, 4, 2, 0.25), true);
 
   // testing on a simple sphere(r = 10), on both Polyhedron & SurfaceMesh:
   // Expected: Mean Curvature = 0.1, Gaussian Curvature = 0.01, Principal Curvatures = 0.1 & 0.1 so 0.1 on avg.

From 7303c7401e476d85784715ab3c28e05a8ca3eb8a Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 24 Jan 2023 14:42:39 +0200
Subject: [PATCH 0115/1398] move function + minor func doc fix

---
 ...nterpolated_corrected_curvature_measures.h | 155 +++++++++---------
 1 file changed, 78 insertions(+), 77 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 078fcaeb48e3..2ae9a6856e38 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -1210,7 +1210,7 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and
-* `std::tuple<GT::FT, GT::FT, Eigen::Vector<GT::FT, 3>, Eigen::Vector<GT::FT, 3>>` as value type.
+* `%Principal_curvatures_and_directions` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
@@ -1265,16 +1265,20 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
   interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvatures_and_directions_map(vcm));
 }
 
+
 /**
   * \ingroup PMP_corrected_curvatures_grp
-  * computes the interpolated corrected mean curvature at a vertex of a triangle mesh.
+  * Computes the interpolated corrected curvatures at a certain vertex, based on the provided pointers.
+  * By providing mean, gaussian and/or principal curvature pointers as named parameters, the user
+  * can choose which curvatures to compute.
+  * The pointers are used to store the computed curvatures.
+  * The user is responsible for the memory management of the pointers.
   *
-  * @tparam GT a geometric traits class that provides the nested type `FT`,
   * @tparam PolygonMesh a model of `FaceListGraph`
   * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
   *
   * @param pmesh the polygon mesh
-  * @param v the vertex of `pmesh` to compute the mean curvature at
+  * @param v the vertex of `pmesh` to compute the curvatures at
   * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
   *
   * \cgalNamedParamsBegin
@@ -1298,49 +1302,64 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
   *                     computed using compute_vertex_normals()}
   *   \cgalParamNEnd
   *
+  *   \cgalParamNBegin{vertex_mean_curvature}
+  *     \cgalParamDescription{a pointer to a scalar value to store the mean curvature at the vertex `v`}
+  *     \cgalParamType{`GT::FT*`}
+  *     \cgalParamDefault{`nullptr`}
+  *     \cgalParamExtra{If this parameter is omitted, mean curvature won't be computed}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_gaussian_curvature}
+  *     \cgalParamDescription{a pointer to a scalar value to store the gaussian curvature at the vertex `v`}
+  *     \cgalParamType{`GT::FT*`}
+  *     \cgalParamDefault{`nullptr`}
+  *     \cgalParamExtra{If this parameter is omitted, gaussian curvature won't be computed}
+  *   \cgalParamNEnd
+  *
+  *   \cgalParamNBegin{vertex_principal_curvatures_and_directions}
+  *     \cgalParamDescription{a pointer to a Principal_curvatures_and_directions object to store the principal curvatures and directions at the vertex `v`}
+  *     \cgalParamType{`Principal_curvatures_and_directions<GT>*`}
+  *     \cgalParamDefault{`nullptr`}
+  *     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions won't be computed}
+  *  \cgalParamNEnd
+  *
   *   \cgalParamNBegin{ball_radius}
   *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
   *                           by summing measures of faces inside a ball of this radius centered at the
   *                           vertex expanded from. The summed face measures are weighted by their
-  *                           inclusion ratio inside this ball}
+  *                           inclusion ratio inside this ball.}
   *     \cgalParamType{`GT::FT`}
   *     \cgalParamDefault{`-1`}
-  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
   *                     measures on faces around the vertex}
   *   \cgalParamNEnd
   *
   * \cgalNamedParamsEnd
   *
-  * @return the interpolated corrected mean curvature at the vertex `v`
-  *
-  * @see `interpolated_corrected_mean_curvature()`
-  * @see `interpolated_corrected_gaussian_curvature_at_vertex()`
-  * @see `interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
-  * @see `interpolated_corrected_curvatures_at_vertex()`
+  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
+  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_at_vertex()`
+  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_at_vertex()`
+  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
 */
-
-template<typename GT, typename PolygonMesh,
+template<typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
-  typename GT::FT interpolated_corrected_mean_curvature_at_vertex(const PolygonMesh& pmesh,
+  void interpolated_corrected_curvatures_at_vertex(const PolygonMesh& pmesh,
     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values())
 {
-  // use interpolated_corrected_curvatures_at_vertex to compute mean curvature
-  typename GT::FT mean_curvature;
-  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_mean_curvature(&mean_curvature));
-  return mean_curvature;
+  internal::interpolated_corrected_curvatures_one_vertex(pmesh, v, np);
 }
 
 /**
   * \ingroup PMP_corrected_curvatures_grp
-  * computes the interpolated corrected Gaussian curvature at a vertex of a triangle mesh.
+  * computes the interpolated corrected mean curvature at a vertex of a triangle mesh.
   *
   * @tparam GT a geometric traits class that provides the nested type `FT`,
   * @tparam PolygonMesh a model of `FaceListGraph`
   * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
   *
   * @param pmesh the polygon mesh
-  * @param v the vertex of `pmesh` to compute the Gaussian curvature at
+  * @param v the vertex of `pmesh` to compute the mean curvature at
   * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
   *
   * \cgalNamedParamsBegin
@@ -1377,36 +1396,36 @@ template<typename GT, typename PolygonMesh,
   *
   * \cgalNamedParamsEnd
   *
-  * @return the interpolated corrected Gaussian curvature at the vertex `v`
+  * @return the interpolated corrected mean curvature at the vertex `v`
   *
-  * @see `interpolated_corrected_gaussian_curvature()`
-  * @see `interpolated_corrected_mean_curvature_at_vertex()`
+  * @see `interpolated_corrected_mean_curvature()`
+  * @see `interpolated_corrected_gaussian_curvature_at_vertex()`
   * @see `interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
   * @see `interpolated_corrected_curvatures_at_vertex()`
 */
 
 template<typename GT, typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
-  typename GT::FT interpolated_corrected_gaussian_curvature_at_vertex(const PolygonMesh& pmesh,
+  typename GT::FT interpolated_corrected_mean_curvature_at_vertex(const PolygonMesh& pmesh,
     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values())
 {
-  // use interpolated_corrected_curvatures_at_vertex to compute gaussian curvature
-  typename GT::FT gc;
-  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_gaussian_curvature(&gc));
-  return gc;
+  // use interpolated_corrected_curvatures_at_vertex to compute mean curvature
+  typename GT::FT mean_curvature;
+  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_mean_curvature(&mean_curvature));
+  return mean_curvature;
 }
 
 /**
   * \ingroup PMP_corrected_curvatures_grp
-  * computes the interpolated corrected principal curvatures and directions at a vertex of a triangle mesh.
+  * computes the interpolated corrected Gaussian curvature at a vertex of a triangle mesh.
   *
-  * @tparam GT the geometric traits class,
+  * @tparam GT a geometric traits class that provides the nested type `FT`,
   * @tparam PolygonMesh a model of `FaceListGraph`
   * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
   *
   * @param pmesh the polygon mesh
-  * @param v the vertex of `pmesh` to compute the principal curvatures and directions at
+  * @param v the vertex of `pmesh` to compute the Gaussian curvature at
   * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
   *
   * \cgalNamedParamsBegin
@@ -1440,41 +1459,39 @@ template<typename GT, typename PolygonMesh,
   *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
   *                     measures on faces around the vertex}
   *   \cgalParamNEnd
+  *
   * \cgalNamedParamsEnd
   *
-  * @return the interpolated corrected principal curvatures and directions at the vertex `v`
+  * @return the interpolated corrected Gaussian curvature at the vertex `v`
   *
-  * @see `interpolated_corrected_principal_curvatures_and_directions()`
+  * @see `interpolated_corrected_gaussian_curvature()`
   * @see `interpolated_corrected_mean_curvature_at_vertex()`
-  * @see `interpolated_corrected_gaussian_curvature_at_vertex()`
+  * @see `interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
   * @see `interpolated_corrected_curvatures_at_vertex()`
 */
 
 template<typename GT, typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
-  Principal_curvatures_and_directions<GT> interpolated_corrected_principal_curvatures_and_directions_at_vertex(const PolygonMesh& pmesh,
+  typename GT::FT interpolated_corrected_gaussian_curvature_at_vertex(const PolygonMesh& pmesh,
     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values())
 {
-  // use interpolated_corrected_curvatures_at_vertex to compute principal curvatures
-  Principal_curvatures_and_directions<GT> pcd;
-  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(&pcd));
-  return pcd;
+  // use interpolated_corrected_curvatures_at_vertex to compute gaussian curvature
+  typename GT::FT gc;
+  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_gaussian_curvature(&gc));
+  return gc;
 }
 
 /**
   * \ingroup PMP_corrected_curvatures_grp
-  * Computes the interpolated corrected curvatures at a certain vertex, based on the provided pointers.
-  * By providing mean, gaussian and/or principal curvature pointers as named parameters, the user
-  * can choose which curvatures to compute.
-  * The pointers are used to store the computed curvatures.
-  * The user is responsible for the memory management of the pointers.
+  * computes the interpolated corrected principal curvatures and directions at a vertex of a triangle mesh.
   *
+  * @tparam GT the geometric traits class,
   * @tparam PolygonMesh a model of `FaceListGraph`
   * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
   *
   * @param pmesh the polygon mesh
-  * @param v the vertex of `pmesh` to compute the curvatures at
+  * @param v the vertex of `pmesh` to compute the principal curvatures and directions at
   * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
   *
   * \cgalNamedParamsBegin
@@ -1498,52 +1515,36 @@ template<typename GT, typename PolygonMesh,
   *                     computed using compute_vertex_normals()}
   *   \cgalParamNEnd
   *
-  *   \cgalParamNBegin{vertex_mean_curvature}
-  *     \cgalParamDescription{a pointer to a scalar value to store the mean curvature at the vertex `v`}
-  *     \cgalParamType{`GT::FT*`}
-  *     \cgalParamDefault{`nullptr`}
-  *     \cgalParamExtra{If this parameter is omitted, mean curvature won't be computed}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{vertex_gaussian_curvature}
-  *     \cgalParamDescription{a pointer to a scalar value to store the gaussian curvature at the vertex `v`}
-  *     \cgalParamType{`GT::FT*`}
-  *     \cgalParamDefault{`nullptr`}
-  *     \cgalParamExtra{If this parameter is omitted, gaussian curvature won't be computed}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{vertex_principal_curvatures_and_directions}
-  *     \cgalParamDescription{a pointer to a Principal_curvatures_and_directions object to store the principal curvatures and directions at the vertex `v`}
-  *     \cgalParamType{`Principal_curvatures_and_directions<GT>*`}
-  *     \cgalParamDefault{`nullptr`}
-  *     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions won't be computed}
-  *  \cgalParamNEnd
-  *
   *   \cgalParamNBegin{ball_radius}
   *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
   *                           by summing measures of faces inside a ball of this radius centered at the
   *                           vertex expanded from. The summed face measures are weighted by their
-  *                           inclusion ratio inside this ball.}
+  *                           inclusion ratio inside this ball}
   *     \cgalParamType{`GT::FT`}
   *     \cgalParamDefault{`-1`}
-  *     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
   *                     measures on faces around the vertex}
   *   \cgalParamNEnd
-  *
   * \cgalNamedParamsEnd
   *
-  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
-  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_at_vertex()`
-  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_at_vertex()`
-  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
+  * @return the interpolated corrected principal curvatures and directions at the vertex `v`
+  *
+  * @see `interpolated_corrected_principal_curvatures_and_directions()`
+  * @see `interpolated_corrected_mean_curvature_at_vertex()`
+  * @see `interpolated_corrected_gaussian_curvature_at_vertex()`
+  * @see `interpolated_corrected_curvatures_at_vertex()`
 */
-template<typename PolygonMesh,
+
+template<typename GT, typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_curvatures_at_vertex(const PolygonMesh& pmesh,
+  Principal_curvatures_and_directions<GT> interpolated_corrected_principal_curvatures_and_directions_at_vertex(const PolygonMesh& pmesh,
     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values())
 {
-  internal::interpolated_corrected_curvatures_one_vertex(pmesh, v, np);
+  // use interpolated_corrected_curvatures_at_vertex to compute principal curvatures
+  Principal_curvatures_and_directions<GT> pcd;
+  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(&pcd));
+  return pcd;
 }
 
 } // namespace Polygon_mesh_processing

From f9c21faf02f7296a6285909dffa9c3758599e564 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 24 Jan 2023 15:11:58 +0200
Subject: [PATCH 0116/1398] trailling white spaces

---
 .../test_interpolated_corrected_curvatures.cpp   | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index cd71fbb20f34..367d3c7045d1 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -54,7 +54,7 @@ bool passes_comparison(Epic_kernel::FT result, Epic_kernel::FT expected, Epic_ke
 }
 
 template <typename PolygonMesh>
-void test_average_curvatures(std::string mesh_path, 
+void test_average_curvatures(std::string mesh_path,
   Average_test_info test_info,
   bool compare_single_vertex = false
 ){
@@ -142,8 +142,8 @@ void test_average_curvatures(std::string mesh_path,
   new_mean_curvature_avg /= vertices(pmesh).size();
   new_gaussian_curvature_avg /= vertices(pmesh).size();
   new_principal_curvature_avg /= vertices(pmesh).size() * 2;
-  
-  // are average curvatures computed from interpolated_corrected_curvatures() 
+
+  // are average curvatures computed from interpolated_corrected_curvatures()
   // equal to average curvatures each computed on its own?
   assert(passes_comparison(mean_curvature_avg, new_mean_curvature_avg, 0.99));
   assert(passes_comparison(gaussian_curvature_avg, new_gaussian_curvature_avg, 0.99));
@@ -156,15 +156,15 @@ void test_average_curvatures(std::string mesh_path,
     Epic_kernel::FT single_vertex_mean_curvature_avg = 0,
       single_vertex_gaussian_curvature_avg = 0,
       single_vertex_principal_curvature_avg = 0;
-   
+
     Epic_kernel::FT h, g;
     PMP::Principal_curvatures_and_directions<Epic_kernel> p;
-    
+
     for (vertex_descriptor v : vertices(pmesh))
     {
       PMP::interpolated_corrected_curvatures_at_vertex(
         pmesh,
-        v, 
+        v,
         CGAL::parameters::vertex_gaussian_curvature(&g)
         .vertex_mean_curvature(&h)
         .vertex_principal_curvatures_and_directions(&p)
@@ -189,8 +189,8 @@ void test_average_curvatures(std::string mesh_path,
 int main()
 {
   // testing on a simple sphere(r = 0.5), on both Polyhedron & SurfaceMesh:
-  // For this mesh, ina addition to the whole mesh functions, we also compare against the single vertex 
-  // curvature functions to make sure the produce the same results 
+  // For this mesh, ina addition to the whole mesh functions, we also compare against the single vertex
+  // curvature functions to make sure the produce the same results
   // Expected: Mean Curvature = 2, Gaussian Curvature = 4, Principal Curvatures = 2 & 2 so 2 on avg.
   test_average_curvatures<Polyhedron>("meshes/sphere.off", Average_test_info(2,4,2), true);
   test_average_curvatures<SMesh>("meshes/sphere.off", Average_test_info(2, 4, 2), true);

From 92e22644357462fd3b13af386d4795284999639e Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 24 Jan 2023 17:58:03 +0200
Subject: [PATCH 0117/1398] Update test_interpolated_corrected_curvatures.cpp

---
 .../test_interpolated_corrected_curvatures.cpp                   | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index 367d3c7045d1..12ab2bff3872 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -168,6 +168,7 @@ void test_average_curvatures(std::string mesh_path,
         CGAL::parameters::vertex_gaussian_curvature(&g)
         .vertex_mean_curvature(&h)
         .vertex_principal_curvatures_and_directions(&p)
+        .ball_radius(test_info.expansion_radius)
       );
 
       single_vertex_mean_curvature_avg += h;

From 6f2f912c4d03e5a418d37c2f9b1de7c0d4de4a5a Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 24 Jan 2023 18:41:25 +0200
Subject: [PATCH 0118/1398] minor fix

---
 .../Curvatures/interpolated_corrected_curvature_measures.h  | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 2ae9a6856e38..32287848fb31 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -480,7 +480,7 @@ Principal_curvatures_and_directions<GT> principal_curvatures_and_directions_from
 
 template<typename GT, typename PolygonMesh, typename VPM, typename VNM>
 Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
-  const PolygonMesh pmesh,
+  const PolygonMesh& pmesh,
   const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
   const bool is_mean_curvature_selected,
   const bool is_gaussian_curvature_selected,
@@ -539,7 +539,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
 
 template<typename GT, typename PolygonMesh, typename VPM, typename VNM>
 Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
-  const PolygonMesh pmesh,
+  const PolygonMesh& pmesh,
   const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
   const typename GT::FT radius,
   const bool is_mean_curvature_selected,
@@ -624,7 +624,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
 template<typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
   void interpolated_corrected_curvatures_one_vertex(
-    const PolygonMesh pmesh,
+    const PolygonMesh& pmesh,
     const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values()
   )

From 1294548acc0444ec23145fe29d3e428baa515f8a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 24 Jan 2023 17:58:27 +0100
Subject: [PATCH 0119/1398] avoid macro substitution

---
 .../test_interpolated_corrected_curvatures.cpp                  | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index 12ab2bff3872..2aa963fea52b 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -50,7 +50,7 @@ bool passes_comparison(Epic_kernel::FT result, Epic_kernel::FT expected, Epic_ke
   else if (abs(expected) < ABS_ERROR)
     return false; // expected 0, got non-0
 
-  return std::min(result, expected) / std::max(result, expected) > tolerance;
+  return (std::min)(result, expected) / (std::max)(result, expected) > tolerance;
 }
 
 template <typename PolygonMesh>

From 00cf0970e56f8eafdbb74afe728e8b7e8bcf3c3e Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Thu, 26 Jan 2023 12:04:51 +0200
Subject: [PATCH 0120/1398] changed the mesh file used in examples

---
 ...corrected_curvatures_at_vertex_example.cpp |  3 +-
 ...erpolated_corrected_curvatures_example.cpp |  3 +-
 ...orrected_curvatures_polyhedron_example.cpp | 35 ++++++++++---------
 3 files changed, 20 insertions(+), 21 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp
index 009c5881f262..046f9101d1e6 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp
@@ -12,7 +12,6 @@ namespace PMP = CGAL::Polygon_mesh_processing;
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
 typedef Epic_kernel::FT FT;
 typedef CGAL::Surface_mesh<Epic_kernel::Point_3> Surface_Mesh;
-typedef boost::graph_traits<Surface_Mesh>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Surface_Mesh>::vertex_descriptor vertex_descriptor;
 
 int main(int argc, char* argv[])
@@ -21,7 +20,7 @@ int main(int argc, char* argv[])
   Surface_Mesh smesh;
   const std::string filename = (argc > 1) ?
     argv[1] :
-    CGAL::data_file_path("meshes/small_bunny.obj");
+    CGAL::data_file_path("meshes/sphere.off");
 
   if (!CGAL::IO::read_polygon_mesh(filename, smesh))
   {
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
index 511288702336..6a991bafdfb8 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
@@ -12,7 +12,6 @@ namespace PMP = CGAL::Polygon_mesh_processing;
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
 typedef CGAL::Surface_mesh<Epic_kernel::Point_3> Surface_Mesh;
-typedef boost::graph_traits<Surface_Mesh>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Surface_Mesh>::vertex_descriptor vertex_descriptor;
 
 int main(int argc, char* argv[])
@@ -20,7 +19,7 @@ int main(int argc, char* argv[])
   Surface_Mesh smesh;
   const std::string filename = (argc > 1) ?
     argv[1] :
-    CGAL::data_file_path("meshes/small_bunny.obj");
+    CGAL::data_file_path("meshes/sphere.off");
 
   if (!CGAL::IO::read_polygon_mesh(filename, smesh))
   {
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
index 6bbe49ce37e5..0d1ffcfa35d1 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
@@ -13,13 +13,14 @@ namespace PMP = CGAL::Polygon_mesh_processing;
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
 typedef CGAL::Polyhedron_3<Epic_kernel> Polyhedron;
-typedef boost::graph_traits<Polyhedron>::face_descriptor face_descriptor;
 typedef boost::graph_traits<Polyhedron>::vertex_descriptor vertex_descriptor;
 
-int main(int argc, char *argv[])
+int main(int argc, char* argv[])
 {
   Polyhedron polyhedron;
-  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/small_bunny.obj");
+  const std::string filename = (argc > 1) ?
+    argv[1] :
+    CGAL::data_file_path("meshes/sphere.off");
 
   if (!CGAL::IO::read_polygon_mesh(filename, polyhedron))
   {
@@ -28,22 +29,22 @@ int main(int argc, char *argv[])
   }
 
   boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
-      mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron),
-      gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
+    mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron),
+    gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
   boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
-      principal_curvatures_and_directions_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), polyhedron);
+    principal_curvatures_and_directions_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), polyhedron);
 
   PMP::interpolated_corrected_mean_curvature(
-      polyhedron,
-      mean_curvature_map);
+    polyhedron,
+    mean_curvature_map);
 
   PMP::interpolated_corrected_gaussian_curvature(
-      polyhedron,
-      gaussian_curvature_map);
+    polyhedron,
+    gaussian_curvature_map);
 
   PMP::interpolated_corrected_principal_curvatures_and_directions(
-      polyhedron,
-      principal_curvatures_and_directions_map);
+    polyhedron,
+    principal_curvatures_and_directions_map);
 
   // uncomment this to compute a curvature while specifying named parameters
   // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)
@@ -59,17 +60,17 @@ int main(int argc, char *argv[])
   // This function can be used to compute multiple curvature types by specifiying them as named parameters
   // This is more efficient than computing each one separately (shared computations).
   PMP::interpolated_corrected_curvatures(
-      polyhedron,
-      CGAL::parameters::vertex_mean_curvature_map(mean_curvature_map)
-          .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map));
+    polyhedron,
+    CGAL::parameters::vertex_mean_curvature_map(mean_curvature_map)
+    .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map));
 
   int i = 0;
   for (vertex_descriptor v : vertices(polyhedron))
   {
     auto PC = get(principal_curvatures_and_directions_map, v);
     std::cout << i << ": HC = " << get(mean_curvature_map, v)
-              << ", GC = " << get(gaussian_curvature_map, v) << "\n"
-              << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
+      << ", GC = " << get(gaussian_curvature_map, v) << "\n"
+      << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
     i++;
   }
 }

From 8d2043d0aab934e3d97cd2de8be8f112638fc94b Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 28 Jan 2023 15:54:35 +0200
Subject: [PATCH 0121/1398] renaming

mostly to pass the max path error
---
 .../PackageDescription.txt                    |  8 ++--
 .../Polygon_mesh_processing.txt               | 14 +++---
 .../doc/Polygon_mesh_processing/examples.txt  |  6 +--
 .../Polygon_mesh_processing/CMakeLists.txt    | 12 ++---
 ...lated_corrected_curvatures_example_PH.cpp} |  0
 ...lated_corrected_curvatures_example_SM.cpp} |  0
 ...d_corrected_curvatures_vertex_example.cpp} | 12 ++---
 ...nterpolated_corrected_curvature_measures.h | 44 +++++++++----------
 ...test_interpolated_corrected_curvatures.cpp |  2 +-
 9 files changed, 49 insertions(+), 49 deletions(-)
 rename Polygon_mesh_processing/examples/Polygon_mesh_processing/{interpolated_corrected_curvatures_polyhedron_example.cpp => interpolated_corrected_curvatures_example_PH.cpp} (100%)
 rename Polygon_mesh_processing/examples/Polygon_mesh_processing/{interpolated_corrected_curvatures_example.cpp => interpolated_corrected_curvatures_example_SM.cpp} (100%)
 rename Polygon_mesh_processing/examples/Polygon_mesh_processing/{interpolated_corrected_curvatures_at_vertex_example.cpp => interpolated_corrected_curvatures_vertex_example.cpp} (83%)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index d5790ec725ee..52ae8934ddf2 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -212,10 +212,10 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_at_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_at_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_at_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_one_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_one_vertex()`
 - `CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions`
 
 \cgalCRPSection{Normal Computation Functions}
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index fedebf4b8f8a..751db0992492 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -909,10 +909,10 @@ Where it is recommended to use the last function for computing multiple curvatur
 as the implementation performs the shared computations only once, making it more efficient.
 
 Similarly, we can use the following functions to compute curvatures on a specific vertex:
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_at_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_at_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_at_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_one_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_one_vertex()`
 
 
 \cgalFigureRef{icc_diff_radius} shows how the mean curvature changes depending on
@@ -940,7 +940,7 @@ The following example illustrates how to
 compute the curvatures on vertices
 and store them in property maps provided by the class `Surface_mesh`.
 
-\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp}
+\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp}
 
 \subsection ICCExamplePH Interpolated Corrected Curvatures on a Polyhedron Example
 
@@ -949,14 +949,14 @@ compute the curvatures on vertices
 and store them in dynamic property maps as the class `Polyhedron_3` does
 not provide storage for the curvatures.
 
-\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp}
+\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp}
 
 \subsection ICCExampleSV Interpolated Corrected Curvatures on a Vertex Example
 
 The following example illustrates how to
 compute the curvatures on a specific vertex
 
-\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp}
+\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp}
 
 ****************************************
 \section PMPSlicer Slicer
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
index 58af6e391b56..33e68eea8091 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
@@ -19,9 +19,9 @@
 \example Polygon_mesh_processing/refine_fair_example.cpp
 \example Polygon_mesh_processing/mesh_slicer_example.cpp
 \example Polygon_mesh_processing/isotropic_remeshing_example.cpp
-\example Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
-\example Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
-\example Polygon_mesh_processing/interpolated_corrected_gaussian_curvature_at_vertex.cpp
+\example Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp
+\example Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp
+\example Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp
 \example Polygon_mesh_processing/delaunay_remeshing_example.cpp
 \example Polygon_mesh_processing/compute_normals_example_Polyhedron.cpp
 \example Polygon_mesh_processing/hausdorff_distance_remeshing_example.cpp
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index 5e840c38a508..93e321e837c8 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -105,12 +105,12 @@ create_single_source_cgal_program("cc_compatible_orientations.cpp")
 
 if(TARGET CGAL::Eigen3_support)
 
-  create_single_source_cgal_program("interpolated_corrected_curvatures_example.cpp")
-  target_link_libraries(interpolated_corrected_curvatures_example PUBLIC CGAL::Eigen3_support)
-  create_single_source_cgal_program("interpolated_corrected_curvatures_polyhedron_example.cpp")
-  target_link_libraries(interpolated_corrected_curvatures_polyhedron_example PUBLIC CGAL::Eigen3_support)
-  create_single_source_cgal_program("interpolated_corrected_curvatures_at_vertex_example.cpp")
-  target_link_libraries(interpolated_corrected_curvatures_at_vertex_example PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("interpolated_corrected_curvatures_example_SM.cpp")
+  target_link_libraries(interpolated_corrected_curvatures_example_SM PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("interpolated_corrected_curvatures_example_PH.cpp")
+  target_link_libraries(interpolated_corrected_curvatures_example_PH PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("interpolated_corrected_curvatures_vertex_example.cpp")
+  target_link_libraries(interpolated_corrected_curvatures_vertex_example PUBLIC CGAL::Eigen3_support)
 
 endif()
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp
similarity index 100%
rename from Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_polyhedron_example.cpp
rename to Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp
similarity index 100%
rename from Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example.cpp
rename to Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp
similarity index 83%
rename from Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp
rename to Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp
index 046f9101d1e6..a897066facb6 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_at_vertex_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp
@@ -31,21 +31,21 @@ int main(int argc, char* argv[])
   // loop over vertices and use vertex_descriptor to compute a curvature on one vertex
   for (vertex_descriptor v : vertices(smesh))
   {
-    FT h = PMP::interpolated_corrected_mean_curvature_at_vertex<Epic_kernel>(smesh, v);
-    FT g = PMP::interpolated_corrected_gaussian_curvature_at_vertex<Epic_kernel>(smesh, v);
+    FT h = PMP::interpolated_corrected_mean_curvature_one_vertex<Epic_kernel>(smesh, v);
+    FT g = PMP::interpolated_corrected_gaussian_curvature_one_vertex<Epic_kernel>(smesh, v);
     PMP::Principal_curvatures_and_directions<Epic_kernel> p =
-      PMP::interpolated_corrected_principal_curvatures_and_directions_at_vertex<Epic_kernel>(smesh, v);
+      PMP::interpolated_corrected_principal_curvatures_and_directions_one_vertex<Epic_kernel>(smesh, v);
 
     // we can also specify a ball radius for expansion and a user defined vertex normals map using
-    // named parameters. Refer to interpolated_corrected_curvatures_example.cpp to see example usage.
+    // named parameters. Refer to interpolated_corrected_curvatures_example_SM.cpp to see example usage.
 
-    // Can also use interpolated_corrected_curvatures_at_vertex() to compute multiple curvatures
+    // Can also use interpolated_corrected_curvatures_one_vertex() to compute multiple curvatures
     // on the vertex at the same time. This is more efficient than computing each one separately.
     // The following commented lines show this (all mentioned named parameters work on it as well)
     // we specify which curvatures we want to compute by passing pointers as named parameters
     // as shown. These pointers are used for storing the result as well. in this example we
     // selected mean and gaussian curvatures
-    // PMP::interpolated_corrected_curvatures_at_vertex(
+    // PMP::interpolated_corrected_curvatures_one_vertex(
     //   smesh,
     //   v,
     //   CGAL::parameters::vertex_mean_curvature(&h)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 32287848fb31..2142e57fd194 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -1337,13 +1337,13 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
   * \cgalNamedParamsEnd
   *
   * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
-  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_at_vertex()`
-  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_at_vertex()`
-  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
+  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
+  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_one_vertex()`
+  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
 */
 template<typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_curvatures_at_vertex(const PolygonMesh& pmesh,
+  void interpolated_corrected_curvatures_one_vertex(const PolygonMesh& pmesh,
     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values())
 {
@@ -1399,20 +1399,20 @@ template<typename PolygonMesh,
   * @return the interpolated corrected mean curvature at the vertex `v`
   *
   * @see `interpolated_corrected_mean_curvature()`
-  * @see `interpolated_corrected_gaussian_curvature_at_vertex()`
-  * @see `interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
-  * @see `interpolated_corrected_curvatures_at_vertex()`
+  * @see `interpolated_corrected_gaussian_curvature_one_vertex()`
+  * @see `interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
+  * @see `interpolated_corrected_curvatures_one_vertex()`
 */
 
 template<typename GT, typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
-  typename GT::FT interpolated_corrected_mean_curvature_at_vertex(const PolygonMesh& pmesh,
+  typename GT::FT interpolated_corrected_mean_curvature_one_vertex(const PolygonMesh& pmesh,
     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values())
 {
-  // use interpolated_corrected_curvatures_at_vertex to compute mean curvature
+  // use interpolated_corrected_curvatures_one_vertex to compute mean curvature
   typename GT::FT mean_curvature;
-  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_mean_curvature(&mean_curvature));
+  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_mean_curvature(&mean_curvature));
   return mean_curvature;
 }
 
@@ -1465,20 +1465,20 @@ template<typename GT, typename PolygonMesh,
   * @return the interpolated corrected Gaussian curvature at the vertex `v`
   *
   * @see `interpolated_corrected_gaussian_curvature()`
-  * @see `interpolated_corrected_mean_curvature_at_vertex()`
-  * @see `interpolated_corrected_principal_curvatures_and_directions_at_vertex()`
-  * @see `interpolated_corrected_curvatures_at_vertex()`
+  * @see `interpolated_corrected_mean_curvature_one_vertex()`
+  * @see `interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
+  * @see `interpolated_corrected_curvatures_one_vertex()`
 */
 
 template<typename GT, typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
-  typename GT::FT interpolated_corrected_gaussian_curvature_at_vertex(const PolygonMesh& pmesh,
+  typename GT::FT interpolated_corrected_gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values())
 {
-  // use interpolated_corrected_curvatures_at_vertex to compute gaussian curvature
+  // use interpolated_corrected_curvatures_one_vertex to compute gaussian curvature
   typename GT::FT gc;
-  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_gaussian_curvature(&gc));
+  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_gaussian_curvature(&gc));
   return gc;
 }
 
@@ -1530,20 +1530,20 @@ template<typename GT, typename PolygonMesh,
   * @return the interpolated corrected principal curvatures and directions at the vertex `v`
   *
   * @see `interpolated_corrected_principal_curvatures_and_directions()`
-  * @see `interpolated_corrected_mean_curvature_at_vertex()`
-  * @see `interpolated_corrected_gaussian_curvature_at_vertex()`
-  * @see `interpolated_corrected_curvatures_at_vertex()`
+  * @see `interpolated_corrected_mean_curvature_one_vertex()`
+  * @see `interpolated_corrected_gaussian_curvature_one_vertex()`
+  * @see `interpolated_corrected_curvatures_one_vertex()`
 */
 
 template<typename GT, typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
-  Principal_curvatures_and_directions<GT> interpolated_corrected_principal_curvatures_and_directions_at_vertex(const PolygonMesh& pmesh,
+  Principal_curvatures_and_directions<GT> interpolated_corrected_principal_curvatures_and_directions_one_vertex(const PolygonMesh& pmesh,
     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values())
 {
-  // use interpolated_corrected_curvatures_at_vertex to compute principal curvatures
+  // use interpolated_corrected_curvatures_one_vertex to compute principal curvatures
   Principal_curvatures_and_directions<GT> pcd;
-  interpolated_corrected_curvatures_at_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(&pcd));
+  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(&pcd));
   return pcd;
 }
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index 2aa963fea52b..37fc6f050df4 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -162,7 +162,7 @@ void test_average_curvatures(std::string mesh_path,
 
     for (vertex_descriptor v : vertices(pmesh))
     {
-      PMP::interpolated_corrected_curvatures_at_vertex(
+      PMP::interpolated_corrected_curvatures_one_vertex(
         pmesh,
         v,
         CGAL::parameters::vertex_gaussian_curvature(&g)

From 4e669b79a73682b97aca64b9e04ef46edbf56143 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 29 Jan 2023 06:26:16 +0200
Subject: [PATCH 0122/1398] conversion warnings

---
 ...interpolated_corrected_curvature_measures.h | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
index 2142e57fd194..cfe3b79b6e19 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
@@ -89,7 +89,7 @@ typename GT::FT average_edge_length(const PolygonMesh& pmesh) {
   for (auto e : edges(pmesh))
     avg_edge_length += edge_length(e, pmesh);
 
-  avg_edge_length /= n;
+  avg_edge_length /= static_cast<typename GT::FT>(n);
   return avg_edge_length;
 }
 
@@ -145,7 +145,7 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
     // getting center of points
     typename GT::Vector_3 xc =
       std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-    xc /= n;
+    xc /= static_cast<typename GT::FT>(n);
 
     // getting unit average normal of points
     typename GT::Vector_3 uc =
@@ -211,7 +211,7 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
     // getting center of points
     typename GT::Vector_3 xc =
       std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-    xc /= n;
+    xc /= static_cast<typename GT::FT>(n);
 
     // getting unit average normal of points
     typename GT::Vector_3 uc =
@@ -297,7 +297,7 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
     const typename GT::Vector_3 x02 = x[2] - x[0];
     const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
 
-    for (std::size_t ix = 0; ix < 3; ix++)
+    for (unsigned int ix = 0; ix < 3; ix++)
     {
       typename GT::Vector_3 X;
       if (ix == 0)
@@ -307,7 +307,7 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
       if (ix == 2)
         X = typename GT::Vector_3(0, 0, 1);
 
-      for (std::size_t iy = 0; iy < 3; iy++)
+      for (unsigned int iy = 0; iy < 3; iy++)
         muXY[ix * 3 + iy] = 0.5 * um * (cross_product(u02[iy] * X, x01) - cross_product(u01[iy] * X, x02));
     }
   }
@@ -316,7 +316,7 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
   {
     // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
     // the indices in paper vs in here are: 00 = 0, 10 = 1, 11 = 2, 01 = 3
-    for (std::size_t ix = 0; ix < 3; ix++)
+    for (unsigned int ix = 0; ix < 3; ix++)
     {
       typename GT::Vector_3 X;
       if (ix == 0)
@@ -331,7 +331,7 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
       const typename GT::Vector_3 u2xX = cross_product(u[2], X);
       const typename GT::Vector_3 u3xX = cross_product(u[3], X);
 
-      for (std::size_t iy = 0; iy < 3; iy++)
+      for (unsigned int iy = 0; iy < 3; iy++)
         muXY[ix * 3 + iy] = (1.0 / 72.0) * (
 
           u[0][iy] * (u0xX * (-x[0] - 11 * x[1] + 13 * x[3] - x[2])
@@ -364,7 +364,7 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
     // getting center of points
     typename GT::Vector_3 xc =
       std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-    xc /= n;
+    xc /= static_cast<typename GT::FT>(n);
 
     // getting unit average normal of points
     typename GT::Vector_3 uc =
@@ -418,7 +418,7 @@ typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
   // getting center of points
   typename GT::Vector_3 xm =
     std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
-  xm /= n;
+  xm /= static_cast<typename GT::FT>(n);
 
   typename GT::FT d_min = (xm - c).squared_length();
   typename GT::FT d_max = d_min;

From 2ccabc92899980c65ce17ff9e165905af3d2e6c0 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 29 Jan 2023 09:39:39 +0200
Subject: [PATCH 0123/1398] renaming files

---
 ....h => interpolated_corrected_curvatures.h} | 20 +++++++++----------
 .../include/CGAL/license/gpl_package_list.txt |  2 +-
 ...olated_corrected_curvatures_example_PH.cpp |  2 +-
 ...olated_corrected_curvatures_example_SM.cpp |  2 +-
 ...ed_corrected_curvatures_vertex_example.cpp |  2 +-
 ....h => interpolated_corrected_curvatures.h} |  8 ++++----
 ...test_interpolated_corrected_curvatures.cpp |  2 +-
 .../Display/Display_property_plugin.cpp       |  2 +-
 ..._corrected_principal_curvatures_plugin.cpp |  2 +-
 9 files changed, 21 insertions(+), 21 deletions(-)
 rename Installation/include/CGAL/license/Polygon_mesh_processing/{interpolated_corrected_curvature_measures.h => interpolated_corrected_curvatures.h} (83%)
 rename Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/{Curvatures/interpolated_corrected_curvature_measures.h => interpolated_corrected_curvatures.h} (99%)

diff --git a/Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h b/Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvatures.h
similarity index 83%
rename from Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h
rename to Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 15e2a79af8a9..e484daaf5eae 100644
--- a/Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h
+++ b/Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -11,15 +11,15 @@
 //
 // Warning: this file is generated, see include/CGAL/licence/README.md
 
-#ifndef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
-#define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
+#ifndef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
+#define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
 
 #include <CGAL/config.h>
 #include <CGAL/license.h>
 
-#ifdef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE
+#ifdef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_COMMERCIAL_LICENSE
 
-#  if CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+#  if CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
 
 #    if defined(CGAL_LICENSE_WARNING)
 
@@ -33,22 +33,22 @@
               You get this error, as you defined CGAL_LICENSE_ERROR."
 #    endif // CGAL_LICENSE_ERROR
 
-#  endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+#  endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
 
-#else // no CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE
+#else // no CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_COMMERCIAL_LICENSE
 
 #  if defined(CGAL_LICENSE_WARNING)
-     CGAL_pragma_warning("\nThe macro CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE is not defined."
+     CGAL_pragma_warning("\nThe macro CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_COMMERCIAL_LICENSE is not defined."
                           "\nYou use the CGAL Polygon Mesh Processing - Interpolated Corrected Curvatures package under "
                           "the terms of the GPLv3+.")
 #  endif // CGAL_LICENSE_WARNING
 
 #  ifdef CGAL_LICENSE_ERROR
-#    error "The macro CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE is not defined.\
+#    error "The macro CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_COMMERCIAL_LICENSE is not defined.\
             You use the CGAL Polygon Mesh Processing - Interpolated Corrected Curvatures package under the terms of \
             the GPLv3+. You get this error, as you defined CGAL_LICENSE_ERROR."
 #  endif // CGAL_LICENSE_ERROR
 
-#endif // no CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_COMMERCIAL_LICENSE
+#endif // no CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_COMMERCIAL_LICENSE
 
-#endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
+#endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
diff --git a/Installation/include/CGAL/license/gpl_package_list.txt b/Installation/include/CGAL/license/gpl_package_list.txt
index c6ac0b619df0..14d68b5d9a6a 100644
--- a/Installation/include/CGAL/license/gpl_package_list.txt
+++ b/Installation/include/CGAL/license/gpl_package_list.txt
@@ -51,7 +51,7 @@ Polygon_mesh_processing/connected_components Polygon Mesh Processing - Connected
 Polygon_mesh_processing/corefinement Polygon Mesh Processing - Corefinement
 Polygon_mesh_processing/core Polygon Mesh Processing - Core
 Polygon_mesh_processing/distance Polygon Mesh Processing - Distance
-Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures Polygon Mesh Processing - Interpolated Corrected Curvatures
+Polygon_mesh_processing/interpolated_corrected_curvatures Polygon Mesh Processing - Interpolated Corrected Curvatures
 Polygon_mesh_processing/measure Polygon Mesh Processing - Geometric Measure
 Polygon_mesh_processing/meshing_hole_filling Polygon Mesh Processing - Meshing and Hole Filling
 Polygon_mesh_processing/orientation Polygon Mesh Processing - Orientation
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp
index 0d1ffcfa35d1..3cf675c53ca4 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp
@@ -1,5 +1,5 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/property_map.h>
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp
index 6a991bafdfb8..d92ec7b8096d 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp
@@ -1,5 +1,5 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/property_map.h>
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp
index a897066facb6..beb2eda31c04 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp
@@ -1,5 +1,5 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 #include <CGAL/Surface_mesh.h>
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
similarity index 99%
rename from Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
rename to Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index cfe3b79b6e19..7f0bbc8197ce 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -11,10 +11,10 @@
 // Author(s)     : Hossam Saeed
 //
 
-#ifndef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
-#define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
+#ifndef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
+#define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
 
-#include <CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvature_measures.h>
+#include <CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 
 #include <CGAL/assertions.h>
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
@@ -1550,4 +1550,4 @@ template<typename GT, typename PolygonMesh,
 } // namespace Polygon_mesh_processing
 } // namespace CGAL
 
-#endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURE_MEASURES_H
\ No newline at end of file
+#endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
\ No newline at end of file
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index 37fc6f050df4..c8d3894720cc 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -1,5 +1,5 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 #include <CGAL/Polygon_mesh_processing/random_perturbation.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 #include <CGAL/Surface_mesh.h>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 67a2061fc5e8..f515c7c12e08 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -16,7 +16,7 @@
 #include <CGAL/boost/graph/helpers.h>
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
 #include <CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h>
-#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 
 #include "Scene_points_with_normal_item.h"
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
index e5a01f7b3c3b..8bb6a229967b 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
@@ -11,7 +11,7 @@
 #include <QMainWindow>
 
 #include <CGAL/Polygon_mesh_processing/measure.h>
-#include <CGAL/Polygon_mesh_processing/Curvatures/interpolated_corrected_curvature_measures.h>
+#include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 
 using namespace CGAL::Three;
 class Polyhedron_demo_interpolated_corrected_principal_curvatures_and_directions_plugin :

From eef0f5fd80cf703486b1f72b862898f45c266d00 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 31 Jan 2023 11:23:46 +0200
Subject: [PATCH 0124/1398] removed unused parameter

---
 .../interpolated_corrected_curvatures.h                       | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 7f0bbc8197ce..a71fdf164449 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -27,7 +27,6 @@
 #include <numeric>
 #include <queue>
 #include <unordered_set>
-#include <functional>
 
 #define EXPANDING_RADIUS_EPSILON 1e-6
 
@@ -231,8 +230,7 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
 }
 
 template<typename GT>
-typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& u,
-  const std::vector<typename GT::Vector_3>& x = {})
+typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& u)
 {
   const std::size_t n = u.size();
   CGAL_precondition(n >= 3);

From 4f4eeea292f09dc7e7a84c55787346f2ec51a607 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 31 Jan 2023 11:55:15 +0200
Subject: [PATCH 0125/1398] removing _example suffix (renaming)

---
 .../Polygon_mesh_processing.txt                      |  6 +++---
 .../doc/Polygon_mesh_processing/examples.txt         |  6 +++---
 .../examples/Polygon_mesh_processing/CMakeLists.txt  | 12 ++++++------
 ....cpp => interpolated_corrected_curvatures_PH.cpp} |  0
 ....cpp => interpolated_corrected_curvatures_SM.cpp} |  0
 ... => interpolated_corrected_curvatures_vertex.cpp} |  2 +-
 6 files changed, 13 insertions(+), 13 deletions(-)
 rename Polygon_mesh_processing/examples/Polygon_mesh_processing/{interpolated_corrected_curvatures_example_PH.cpp => interpolated_corrected_curvatures_PH.cpp} (100%)
 rename Polygon_mesh_processing/examples/Polygon_mesh_processing/{interpolated_corrected_curvatures_example_SM.cpp => interpolated_corrected_curvatures_SM.cpp} (100%)
 rename Polygon_mesh_processing/examples/Polygon_mesh_processing/{interpolated_corrected_curvatures_vertex_example.cpp => interpolated_corrected_curvatures_vertex.cpp} (98%)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 751db0992492..1da140d96791 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -940,7 +940,7 @@ The following example illustrates how to
 compute the curvatures on vertices
 and store them in property maps provided by the class `Surface_mesh`.
 
-\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp}
+\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp}
 
 \subsection ICCExamplePH Interpolated Corrected Curvatures on a Polyhedron Example
 
@@ -949,14 +949,14 @@ compute the curvatures on vertices
 and store them in dynamic property maps as the class `Polyhedron_3` does
 not provide storage for the curvatures.
 
-\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp}
+\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp}
 
 \subsection ICCExampleSV Interpolated Corrected Curvatures on a Vertex Example
 
 The following example illustrates how to
 compute the curvatures on a specific vertex
 
-\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp}
+\cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp}
 
 ****************************************
 \section PMPSlicer Slicer
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
index 33e68eea8091..3a5620d82424 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
@@ -19,9 +19,9 @@
 \example Polygon_mesh_processing/refine_fair_example.cpp
 \example Polygon_mesh_processing/mesh_slicer_example.cpp
 \example Polygon_mesh_processing/isotropic_remeshing_example.cpp
-\example Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp
-\example Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp
-\example Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp
+\example Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
+\example Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
+\example Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
 \example Polygon_mesh_processing/delaunay_remeshing_example.cpp
 \example Polygon_mesh_processing/compute_normals_example_Polyhedron.cpp
 \example Polygon_mesh_processing/hausdorff_distance_remeshing_example.cpp
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index 93e321e837c8..19a3aaf5313d 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -105,12 +105,12 @@ create_single_source_cgal_program("cc_compatible_orientations.cpp")
 
 if(TARGET CGAL::Eigen3_support)
 
-  create_single_source_cgal_program("interpolated_corrected_curvatures_example_SM.cpp")
-  target_link_libraries(interpolated_corrected_curvatures_example_SM PUBLIC CGAL::Eigen3_support)
-  create_single_source_cgal_program("interpolated_corrected_curvatures_example_PH.cpp")
-  target_link_libraries(interpolated_corrected_curvatures_example_PH PUBLIC CGAL::Eigen3_support)
-  create_single_source_cgal_program("interpolated_corrected_curvatures_vertex_example.cpp")
-  target_link_libraries(interpolated_corrected_curvatures_vertex_example PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("interpolated_corrected_curvatures_SM.cpp")
+  target_link_libraries(interpolated_corrected_curvatures_SM PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("interpolated_corrected_curvatures_PH.cpp")
+  target_link_libraries(interpolated_corrected_curvatures_PH PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("interpolated_corrected_curvatures_vertex.cpp")
+  target_link_libraries(interpolated_corrected_curvatures_vertex PUBLIC CGAL::Eigen3_support)
 
 endif()
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
similarity index 100%
rename from Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_PH.cpp
rename to Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
similarity index 100%
rename from Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_example_SM.cpp
rename to Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
similarity index 98%
rename from Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp
rename to Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
index beb2eda31c04..47fbcfd68711 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
@@ -37,7 +37,7 @@ int main(int argc, char* argv[])
       PMP::interpolated_corrected_principal_curvatures_and_directions_one_vertex<Epic_kernel>(smesh, v);
 
     // we can also specify a ball radius for expansion and a user defined vertex normals map using
-    // named parameters. Refer to interpolated_corrected_curvatures_example_SM.cpp to see example usage.
+    // named parameters. Refer to interpolated_corrected_curvatures_SM.cpp to see example usage.
 
     // Can also use interpolated_corrected_curvatures_one_vertex() to compute multiple curvatures
     // on the vertex at the same time. This is more efficient than computing each one separately.

From bd5d9df950ea845efa3b6bdf926a1b548c8c4ffd Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 31 Jan 2023 11:57:00 +0200
Subject: [PATCH 0126/1398] fix

some functions were passing x to interpolated_corrected_gaussian_curvature_measure_face() when it was not needed (and causes a compilation error for 1 vertex)
---
 .../interpolated_corrected_curvatures.h                       | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index a71fdf164449..3c7c647e8a6b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -518,7 +518,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
         vertex_measures.mean_curvature_measure += interpolated_corrected_mean_curvature_measure_face<GT>(u, x);
 
       if (is_gaussian_curvature_selected)
-        vertex_measures.gaussian_curvature_measure += interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x);
+        vertex_measures.gaussian_curvature_measure += interpolated_corrected_gaussian_curvature_measure_face<GT>(u);
 
       if (is_principal_curvatures_and_directions_selected)
       {
@@ -594,7 +594,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
         vertex_measures.mean_curvature_measure += f_ratio * interpolated_corrected_mean_curvature_measure_face<GT>(u, x);
 
       if (is_gaussian_curvature_selected)
-        vertex_measures.gaussian_curvature_measure += f_ratio * interpolated_corrected_gaussian_curvature_measure_face<GT>(u, x);
+        vertex_measures.gaussian_curvature_measure += f_ratio * interpolated_corrected_gaussian_curvature_measure_face<GT>(u);
 
       if (is_principal_curvatures_and_directions_selected)
       {

From 6a7e7d267ebf9be9eedd306ce311b7c0d5c7dc2f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 31 Jan 2023 11:56:48 +0100
Subject: [PATCH 0127/1398] fix link

---
 .../interpolated_corrected_curvatures.h          | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 3c7c647e8a6b..88110842b67d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -1273,11 +1273,11 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
   * The user is responsible for the memory management of the pointers.
   *
   * @tparam PolygonMesh a model of `FaceListGraph`
-  * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
+  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
   *
   * @param pmesh the polygon mesh
   * @param v the vertex of `pmesh` to compute the curvatures at
-  * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
+  * @param np optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
   *
   * \cgalNamedParamsBegin
   *   \cgalParamNBegin{vertex_point_map}
@@ -1354,11 +1354,11 @@ template<typename PolygonMesh,
   *
   * @tparam GT a geometric traits class that provides the nested type `FT`,
   * @tparam PolygonMesh a model of `FaceListGraph`
-  * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
+  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
   *
   * @param pmesh the polygon mesh
   * @param v the vertex of `pmesh` to compute the mean curvature at
-  * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
+  * @param np optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
   *
   * \cgalNamedParamsBegin
   *   \cgalParamNBegin{vertex_point_map}
@@ -1420,11 +1420,11 @@ template<typename GT, typename PolygonMesh,
   *
   * @tparam GT a geometric traits class that provides the nested type `FT`,
   * @tparam PolygonMesh a model of `FaceListGraph`
-  * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
+  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
   *
   * @param pmesh the polygon mesh
   * @param v the vertex of `pmesh` to compute the Gaussian curvature at
-  * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
+  * @param np optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
   *
   * \cgalNamedParamsBegin
   *   \cgalParamNBegin{vertex_point_map}
@@ -1486,11 +1486,11 @@ template<typename GT, typename PolygonMesh,
   *
   * @tparam GT the geometric traits class,
   * @tparam PolygonMesh a model of `FaceListGraph`
-  * @tparam NamedParameters a sequence of \ref pmp_namedparameters "Named Parameters"
+  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
   *
   * @param pmesh the polygon mesh
   * @param v the vertex of `pmesh` to compute the principal curvatures and directions at
-  * @param np optional sequence of \ref pmp_namedparameters "Named Parameters" among the ones listed below
+  * @param np optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
   *
   * \cgalNamedParamsBegin
   *   \cgalParamNBegin{vertex_point_map}

From 1dc1ed467a00f13f766a6b9d4d332e9fe614f7dc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 31 Jan 2023 12:06:10 +0100
Subject: [PATCH 0128/1398] remove unused variable

---
 .../demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index f515c7c12e08..c4c7d6a3c916 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -839,7 +839,7 @@ private Q_SLOTS:
 
     }
 
-    double outMin = 0, outMax = 5 * maxEdgeLength, base = 1.2;
+    double outMax = 5 * maxEdgeLength, base = 1.2;
 
     expand_radius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
     dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));

From e71fcd899a44a07a53d65fbdf976d6224141fd0c Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Thu, 2 Feb 2023 02:15:34 +0200
Subject: [PATCH 0129/1398] removed unused enum

---
 .../interpolated_corrected_curvatures.h                     | 6 ------
 1 file changed, 6 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 88110842b67d..7adc37f0b4a2 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -92,12 +92,6 @@ typename GT::FT average_edge_length(const PolygonMesh& pmesh) {
   return avg_edge_length;
 }
 
-enum Curvature_measure_index {
-  MU0_AREA_MEASURE, ///< corrected area density
-  MU1_MEAN_CURVATURE_MEASURE, ///< corrected mean curvature density
-  MU2_GAUSSIAN_CURVATURE_MEASURE ///< corrected gaussian curvature density
-};
-
 template<typename GT>
 struct Vertex_measures {
   typename GT::FT area_measure = 0;

From fcbc89b50314db6f17508bcc8a63046c18c910fc Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Thu, 2 Feb 2023 12:07:20 +0200
Subject: [PATCH 0130/1398] added comments for clarity

---
 .../interpolated_corrected_curvatures.h       | 63 +++++++++++++++----
 1 file changed, 52 insertions(+), 11 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 7adc37f0b4a2..952a7e749ecf 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -118,7 +118,7 @@ typename GT::FT interpolated_corrected_area_measure_face(const std::vector<typen
     const typename GT::Vector_3 um = (u[0] + u[1] + u[2]) / 3.0;
     return 0.5 * um * cross_product(x[1] - x[0], x[2] - x[0]);
   }
-  // Quad: use bilinear interpolation formula
+  // Quad: use the bilinear interpolation formula
   else if (n == 4)
   {
     // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
@@ -176,7 +176,7 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
       + cross_product(u[0] - u[2], x[1])
       + cross_product(u[1] - u[0], x[2]));
   }
-  // Quad: use bilinear interpolation formula
+  // Quad: use the bilinear interpolation formula
   else if (n == 4)
   {
     // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
@@ -236,7 +236,7 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
   {
     return 0.5 * u[0] * cross_product(u[1], u[2]);
   }
-  // Quad: use bilinear interpolation formula
+  // Quad: use the bilinear interpolation formula
   else if (n == 4)
   {
     // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
@@ -303,7 +303,7 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
         muXY[ix * 3 + iy] = 0.5 * um * (cross_product(u02[iy] * X, x01) - cross_product(u01[iy] * X, x02));
     }
   }
-  // Quad: use bilinear interpolation formula
+  // Quad: use the bilinear interpolation formula
   else if (n == 4)
   {
     // for the formulas below, values of verices 2 & 3 are swapped (compared to paper) to correct order.
@@ -412,6 +412,7 @@ typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
     std::accumulate(x.begin(), x.end(), typename GT::Vector_3(0, 0, 0));
   xm /= static_cast<typename GT::FT>(n);
 
+  // computing squared distance of furthest and closest point to ball center
   typename GT::FT d_min = (xm - c).squared_length();
   typename GT::FT d_max = d_min;
 
@@ -422,12 +423,14 @@ typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
     d_min = (std::min)(d_sq, d_min);
   }
 
+  // if the furthest point is inside ball, return 1
   if (d_max <= r * r) return 1.0;
+  // if the closest point is outside ball, return 0
   else if (r * r <= d_min) return 0.0;
 
+  // else, approximate inclusion ratio of the triangle:
   d_max = sqrt(d_max);
   d_min = sqrt(d_min);
-
   return (r - d_min) / (d_max - d_min);
 }
 
@@ -438,17 +441,22 @@ Principal_curvatures_and_directions<GT> principal_curvatures_and_directions_from
   const typename GT::Vector_3 u_GT
 )
 {
+  // putting anisotropic measure in matrix form
   Eigen::Matrix<typename GT::FT, 3, 3> v_muXY = Eigen::Matrix<typename GT::FT, 3, 3>::Zero();
 
   for (std::size_t ix = 0; ix < 3; ix++)
     for (std::size_t iy = 0; iy < 3; iy++)
       v_muXY(ix, iy) = anisotropic_measure[ix * 3 + iy];
 
+  // constant factor K to force the principal direction eigenvectors to be tangential to the surface
   Eigen::Matrix<typename GT::FT, 3, 1> u(u_GT.x(), u_GT.y(), u_GT.z());
   const typename GT::FT K = 1000 * v_mu0;
 
+  // symmetrizing and adding the constant term
   v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
 
+
+  // computing eigenvalues and eigenvectors
   Eigen::SelfAdjointEigenSolver<Eigen::Matrix <typename GT::FT, 3, 3>> eigensolver;
 
   eigensolver.computeDirect(v_muXY);
@@ -462,6 +470,7 @@ Principal_curvatures_and_directions<GT> principal_curvatures_and_directions_from
   const typename GT::Vector_3 min_eig_vec(eig_vecs(0, 1), eig_vecs(1, 1), eig_vecs(2, 1));
   const typename GT::Vector_3 max_eig_vec(eig_vecs(0, 0), eig_vecs(1, 0), eig_vecs(2, 0));
 
+  // returning principal curvatures and directions (with the correct sign)
   return Principal_curvatures_and_directions<GT>(
     (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
     (v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
@@ -470,6 +479,7 @@ Principal_curvatures_and_directions<GT> principal_curvatures_and_directions_from
     );
 }
 
+// measures are computed for faces only if they are adjacent to the vertex
 template<typename GT, typename PolygonMesh, typename VPM, typename VNM>
 Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
   const PolygonMesh& pmesh,
@@ -495,9 +505,11 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
   std::vector<Vector_3> x;
   std::vector<Vector_3> u;
 
+  // compute for each face around the vertex (except the null (boundary) face)
   for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
     if (f != boost::graph_traits<PolygonMesh>::null_face())
     {
+      // looping over vertices in face to get point coordinates and normal vectors
       for (Vertex_descriptor vi : vertices_around_face(halfedge(f, pmesh), pmesh))
       {
         Point_3 pi = get(vpm, vi);
@@ -506,6 +518,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
         u.push_back(ui);
       }
 
+      // compute measures for selected curvatures (area is always computed)
       vertex_measures.area_measure += interpolated_corrected_area_measure_face<GT>(u, x);
 
       if (is_mean_curvature_selected)
@@ -528,7 +541,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
   return vertex_measures;
 }
 
-
+// measures are computed for faces only if they are in the ball of radius 'radius' centered at the vertex
 template<typename GT, typename PolygonMesh, typename VPM, typename VNM>
 Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
   const PolygonMesh& pmesh,
@@ -547,6 +560,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
   typedef typename GT::Vector_3 Vector_3;
   typedef typename GT::FT FT;
 
+  // the ball expansion is done using a BFS traversal from the vertex
   std::queue<Face_descriptor> bfs_queue;
   std::unordered_set<Face_descriptor> bfs_visited;
 
@@ -568,8 +582,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
     Face_descriptor fi = bfs_queue.front();
     bfs_queue.pop();
 
-    // looping over vertices in face to get point coordinates
-
+    // looping over vertices in face to get point coordinates and normal vectors
     for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
     {
       Point_3 pi = get(vpm, vi);
@@ -578,8 +591,11 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
       u.push_back(ui);
     }
 
+    // approximate inclusion ratio of the face in the ball
     const FT f_ratio = face_in_ball_ratio<GT>(x, radius, c);
 
+    // if it is not 0 (not completely outside), compute measures for selected curvatures (area is always computed)
+    // and add neighboring faces to the bfs queue
     if (f_ratio != 0.0)
     {
       vertex_measures.area_measure += f_ratio * interpolated_corrected_area_measure_face<GT>(u, x);
@@ -613,6 +629,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
   return vertex_measures;
 }
 
+// computes selected curvatures for one specific vertex
 template<typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
   void interpolated_corrected_curvatures_one_vertex(
@@ -640,23 +657,29 @@ template<typename PolygonMesh,
   Vertex_normal_map vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
     get(Vector_map_tag(), pmesh));
 
+  // if the normal map is not provided, compute it
   if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
     compute_vertex_normals(pmesh, vnm, np);
 
+  // if no radius is given, we pass -1 which will make the expansion be only on the incident faces instead of a ball
   typename GT::FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
+  // if the radius is 0, we use a small epsilon to expand the ball (scaled with the average edge length)
   if (radius == 0)
     radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
 
+  // get parameters (pointers) for curvatures
   typename GT::FT* vertex_mean_curvature = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature), nullptr);
   typename GT::FT* vertex_gaussian_curvature = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature), nullptr);
   Principal_curvatures_and_directions<GT>* vertex_principal_curvatures_and_directions = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvatures_and_directions), nullptr);
 
+  // determine which curvatures are selected (by checking if the pointers are not null)
   const bool is_mean_curvature_selected = (vertex_mean_curvature != nullptr);
   const bool is_gaussian_curvature_selected = (vertex_gaussian_curvature != nullptr);
   const bool is_principal_curvatures_and_directions_selected = (vertex_principal_curvatures_and_directions != nullptr);
 
   Vertex_measures<GT> vertex_measures;
 
+  // if the radius is negative, we do not expand the ball (only the incident faces)
   if (radius < 0)
   {
     vertex_measures = interpolated_corrected_measures_one_vertex_no_radius<GT>(
@@ -683,6 +706,7 @@ template<typename PolygonMesh,
       );
   }
 
+  // compute the selected curvatures from expanded measures
   if (is_mean_curvature_selected) {
     *vertex_mean_curvature = vertex_measures.area_measure != 0 ?
       0.5 * vertex_measures.mean_curvature_measure / vertex_measures.area_measure : 0;
@@ -694,6 +718,7 @@ template<typename PolygonMesh,
   }
 
   if (is_principal_curvatures_and_directions_selected) {
+    // compute the principal curvatures and directions from the anisotropic measures
     const typename GT::Vector_3  v_normal = get(vnm, v);
     const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
       vertex_measures.anisotropic_measure,
@@ -783,11 +808,14 @@ class Interpolated_corrected_curvatures_computer
     vnm = choose_parameter(get_parameter(np, internal_np::vertex_normal_map),
       get(Vector_map_tag(), pmesh));
 
+    // if no normal map is given, compute normals
     if (is_default_parameter<NamedParameters, internal_np::vertex_normal_map_t>::value)
       compute_vertex_normals(pmesh, vnm, np);
 
+    // if no radius is given, we pass -1 which will make the expansion be only on the incident faces instead of a ball
     const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
 
+    // check which curvature maps are provided by the user (determines which curvatures are computed)
     is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
     is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
     is_principal_curvatures_and_directions_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvatures_and_directions_map_t>::value;
@@ -800,6 +828,7 @@ class Interpolated_corrected_curvatures_computer
   }
 
   void set_ball_radius(const FT radius) {
+    // if given radius is 0, we use a small epsilon to expand the ball (scaled by the average edge length)
     if (radius == 0)
       ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
     else
@@ -825,6 +854,8 @@ class Interpolated_corrected_curvatures_computer
 
 private:
 
+  // Computes the (selected) interpolated corrected measures for all faces
+  // and stores them in the property maps
   void interpolated_corrected_selected_measures_all_faces()
   {
     std::vector<Vector_3> x;
@@ -854,14 +885,17 @@ class Interpolated_corrected_curvatures_computer
     }
   }
 
+  // expand the measures of the faces incident to v
   Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(Vertex_descriptor v)
   {
     Vertex_measures<GT> vertex_measures;
 
+    // add the measures of the faces incident to v (excluding the null (boundary) face)
     for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
       if (f == boost::graph_traits<PolygonMesh>::null_face())
         continue;
 
+      // only add the measures for the selected curvatures (area measure is always added)
       vertex_measures.area_measure += get(mu0_map, f);
 
       if (is_mean_curvature_selected)
@@ -881,8 +915,10 @@ class Interpolated_corrected_curvatures_computer
     return vertex_measures;
   }
 
+  // expand the measures of the faces inside the ball of radius r around v
   Vertex_measures<GT> expand_interpolated_corrected_measure_vertex(Vertex_descriptor v)
   {
+    // the ball expansion is done using a BFS traversal from the vertex
     std::queue<Face_descriptor> bfs_queue;
     std::unordered_set<Face_descriptor> bfs_visited;
 
@@ -891,6 +927,7 @@ class Interpolated_corrected_curvatures_computer
 
     Vertex_measures<GT> vertex_measures;
 
+    // add the measures of the faces incident to v (excluding the null (boundary) face)
     for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
       if (f != boost::graph_traits<PolygonMesh>::null_face())
       {
@@ -910,8 +947,11 @@ class Interpolated_corrected_curvatures_computer
         x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
       }
 
+      // compute the inclusion ratio of the face in the ball
       const FT f_ratio = face_in_ball_ratio<GT>(x, ball_radius, c);
 
+      // if the face is inside the ball, add the measures
+      // only add the measures for the selected curvatures (area measure is always added)
       if (f_ratio != 0.0)
       {
         vertex_measures.area_measure += f_ratio * get(mu0_map, fi);
@@ -947,10 +987,13 @@ class Interpolated_corrected_curvatures_computer
 
     for (Vertex_descriptor v : vertices(pmesh))
     {
+      // expand the computed measures (on faces) to the vertices
       Vertex_measures<GT> vertex_measures = (ball_radius < 0) ?
         expand_interpolated_corrected_measure_vertex_no_radius(v) :
         expand_interpolated_corrected_measure_vertex(v);
 
+      // compute the selected curvatures from the expanded measures and store them in the property maps
+      // if the area measure is zero, the curvature is set to zero
       if (is_mean_curvature_selected) {
         vertex_measures.area_measure != 0 ?
           put(mean_curvature_map, v, 0.5 * vertex_measures.mean_curvature_measure / vertex_measures.area_measure) :
@@ -964,6 +1007,7 @@ class Interpolated_corrected_curvatures_computer
       }
 
       if (is_principal_curvatures_and_directions_selected) {
+        // compute the principal curvatures and directions from the anisotropic measure
         const Vector_3  v_normal = get(vnm, v);
         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
           vertex_measures.anisotropic_measure,
@@ -1402,7 +1446,6 @@ template<typename GT, typename PolygonMesh,
     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values())
 {
-  // use interpolated_corrected_curvatures_one_vertex to compute mean curvature
   typename GT::FT mean_curvature;
   interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_mean_curvature(&mean_curvature));
   return mean_curvature;
@@ -1468,7 +1511,6 @@ template<typename GT, typename PolygonMesh,
     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values())
 {
-  // use interpolated_corrected_curvatures_one_vertex to compute gaussian curvature
   typename GT::FT gc;
   interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_gaussian_curvature(&gc));
   return gc;
@@ -1533,7 +1575,6 @@ template<typename GT, typename PolygonMesh,
     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
     const NamedParameters& np = parameters::default_values())
 {
-  // use interpolated_corrected_curvatures_one_vertex to compute principal curvatures
   Principal_curvatures_and_directions<GT> pcd;
   interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(&pcd));
   return pcd;

From ec4312695a5136411b53ae572f9445fd7e385983 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Thu, 2 Feb 2023 12:23:50 +0200
Subject: [PATCH 0131/1398] remove unused var + minor change

---
 .../interpolated_corrected_curvatures.h                     | 6 +-----
 1 file changed, 1 insertion(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 952a7e749ecf..b298f8cf495f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -497,9 +497,6 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
   typedef typename GT::Vector_3 Vector_3;
   typedef typename GT::FT FT;
 
-  std::queue<Face_descriptor> bfs_queue;
-  std::unordered_set<Face_descriptor> bfs_visited;
-
   Vertex_measures<GT> vertex_measures;
 
   std::vector<Vector_3> x;
@@ -814,6 +811,7 @@ class Interpolated_corrected_curvatures_computer
 
     // if no radius is given, we pass -1 which will make the expansion be only on the incident faces instead of a ball
     const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
+    set_ball_radius(radius);
 
     // check which curvature maps are provided by the user (determines which curvatures are computed)
     is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
@@ -823,8 +821,6 @@ class Interpolated_corrected_curvatures_computer
     mean_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature_map), Default_scalar_map());
     gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature_map), Default_scalar_map());
     principal_curvatures_and_directions_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvatures_and_directions_map), Default_principal_map());
-
-    set_ball_radius(radius);
   }
 
   void set_ball_radius(const FT radius) {

From 19fd037731d50f20e703c6dddc9997441bad9d06 Mon Sep 17 00:00:00 2001
From: David Coeurjolly <david.coeurjolly@liris.cnrs.fr>
Date: Mon, 20 Feb 2023 11:20:07 +0100
Subject: [PATCH 0132/1398] Minor API doc edits

---
 .../interpolated_corrected_curvatures.h           | 15 ++++++++-------
 1 file changed, 8 insertions(+), 7 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index b298f8cf495f..ea01b0fe4c34 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -1022,8 +1022,8 @@ class Interpolated_corrected_curvatures_computer
 * \ingroup PMP_corrected_curvatures_grp
 *
 * Computes the interpolated corrected curvatures across the mesh, based on the provided property maps.
-* By providing mean, gaussian and/or principal curvature property maps as named parameters, the user
-* can choose which curvatures to compute.
+* By providing mean, gaussian and/or principal curvature and direction property maps as named parameters, the user
+* can choose which quantites to compute.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
@@ -1039,7 +1039,7 @@ class Interpolated_corrected_curvatures_computer
 *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
 *                    as key type and `%Point_3` as value type}
 *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*     \cgalParamExtra{If this parameter is omitted, an internal property map forBy
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
 *
@@ -1301,9 +1301,10 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 /**
   * \ingroup PMP_corrected_curvatures_grp
   * Computes the interpolated corrected curvatures at a certain vertex, based on the provided pointers.
-  * By providing mean, gaussian and/or principal curvature pointers as named parameters, the user
-  * can choose which curvatures to compute.
-  * The pointers are used to store the computed curvatures.
+  * By providing mean, gaussian and/or principal curvature and direction property maps as named parameters, the user
+  * can choose which quantites to compute.
+  *
+  * The pointers are used to store the computed quantities.
   * The user is responsible for the memory management of the pointers.
   *
   * @tparam PolygonMesh a model of `FaceListGraph`
@@ -1579,4 +1580,4 @@ template<typename GT, typename PolygonMesh,
 } // namespace Polygon_mesh_processing
 } // namespace CGAL
 
-#endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
\ No newline at end of file
+#endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H

From a601cbc5e7b9ed04971b453afaf947917dececb8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 22 Mar 2023 18:13:27 +0100
Subject: [PATCH 0133/1398] first pass on the API

---
 .../Polygon_mesh_processing.txt               |   2 +-
 ...terpolated_corrected_curvatures_vertex.cpp |   7 +-
 .../interpolated_corrected_curvatures.h       | 695 ++++++++++--------
 3 files changed, 386 insertions(+), 318 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 1da140d96791..2eb85a80bfbb 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -1166,7 +1166,7 @@ is covered by a set of prisms, where each prism is an offset for an input triang
 That is, the implementation in \cgal does not use indirect predicates.
 
 The interpolated corrected curvatures were implemented during GSoC 2022. This was implemented by Hossam Saeed and under
-supervision of Sebastien Loriot, Jaques-Olivier Lachaud and David Coeurjolly. The implementation is based on \cgalCite{lachaud2020}.
+supervision of David Coeurjolly, Jaques-Olivier Lachaud, and Sébastien Loriot. The implementation is based on \cgalCite{lachaud2020}.
 <a href="https://dgtal-team.github.io/doc-nightly/moduleCurvatureMeasures.html">DGtal's implementation</a> was also
 used as a reference during the project.
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
index 47fbcfd68711..e5845a1b3a5a 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
@@ -10,7 +10,6 @@
 namespace PMP = CGAL::Polygon_mesh_processing;
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
-typedef Epic_kernel::FT FT;
 typedef CGAL::Surface_mesh<Epic_kernel::Point_3> Surface_Mesh;
 typedef boost::graph_traits<Surface_Mesh>::vertex_descriptor vertex_descriptor;
 
@@ -31,10 +30,10 @@ int main(int argc, char* argv[])
   // loop over vertices and use vertex_descriptor to compute a curvature on one vertex
   for (vertex_descriptor v : vertices(smesh))
   {
-    FT h = PMP::interpolated_corrected_mean_curvature_one_vertex<Epic_kernel>(smesh, v);
-    FT g = PMP::interpolated_corrected_gaussian_curvature_one_vertex<Epic_kernel>(smesh, v);
+    double h = PMP::interpolated_corrected_mean_curvature_one_vertex(smesh, v);
+    double g = PMP::interpolated_corrected_gaussian_curvature_one_vertex(smesh, v);
     PMP::Principal_curvatures_and_directions<Epic_kernel> p =
-      PMP::interpolated_corrected_principal_curvatures_and_directions_one_vertex<Epic_kernel>(smesh, v);
+      PMP::interpolated_corrected_principal_curvatures_and_directions_one_vertex(smesh, v);
 
     // we can also specify a ball radius for expansion and a user defined vertex normals map using
     // named parameters. Refer to interpolated_corrected_curvatures_SM.cpp to see example usage.
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index ea01b0fe4c34..24c1d12a59e3 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -28,8 +28,6 @@
 #include <queue>
 #include <unordered_set>
 
-#define EXPANDING_RADIUS_EPSILON 1e-6
-
 namespace CGAL {
 
 namespace Polygon_mesh_processing {
@@ -39,7 +37,7 @@ namespace Polygon_mesh_processing {
   *
   * \brief a struct for storing principal curvatures and directions.
   *
-  * @tparam GT is the geometric traits class.
+  * @tparam GT is the geometric traits class, model of `Kernel`.
 */
 template<typename GT>
 struct Principal_curvatures_and_directions {
@@ -662,7 +660,7 @@ template<typename PolygonMesh,
   typename GT::FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
   // if the radius is 0, we use a small epsilon to expand the ball (scaled with the average edge length)
   if (radius == 0)
-    radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+    radius = average_edge_length<PolygonMesh, GT>(pmesh) * 1e-6;
 
   // get parameters (pointers) for curvatures
   typename GT::FT* vertex_mean_curvature = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature), nullptr);
@@ -826,7 +824,7 @@ class Interpolated_corrected_curvatures_computer
   void set_ball_radius(const FT radius) {
     // if given radius is 0, we use a small epsilon to expand the ball (scaled by the average edge length)
     if (radius == 0)
-      ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * EXPANDING_RADIUS_EPSILON;
+      ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * 1e-6;
     else
       ball_radius = radius;
   }
@@ -1021,7 +1019,7 @@ class Interpolated_corrected_curvatures_computer
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* Computes the interpolated corrected curvatures across the mesh, based on the provided property maps.
+* computes the interpolated corrected curvatures across the mesh `pmesh`.
 * By providing mean, gaussian and/or principal curvature and direction property maps as named parameters, the user
 * can choose which quantites to compute.
 *
@@ -1029,66 +1027,70 @@ class Interpolated_corrected_curvatures_computer
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below.
+*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *
 * \cgalNamedParamsBegin
 *
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Point_3` as value type}
 *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map forBy
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_normal_map}
 *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Vector_3` as value type}
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Vector_3` as value type}
 *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using compute_vertex_normals()}
+*                     computed using `compute_vertex_normals()`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{geom_traits}
+*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamType{a class model of `Kernel`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_mean_curvature_map}
 *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%FT` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::FT` as value type}
 *     \cgalParamExtra{If this parameter is omitted, mean curvatures won't be computed}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_gaussian_curvature_map}
 *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%FT` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::FT>(), pmesh)`}
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::FT` as value type}
 *     \cgalParamExtra{If this parameter is omitted, gaussian curvatures won't be computed}
 *   \cgalParamNEnd
 *
-*
 *   \cgalParamNBegin{vertex_principal_curvatures_and_directions_map}
 *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Principal_curvatures_and_directions` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<Principal_curvatures_and_directions<GT>>(), pmesh)`}
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `Principal_curvatures_and_directions<GT>` as value type}
 *     \cgalParamExtra{If this parameter is omitted, mean principal won't be computed}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+*     \cgalParamDescription{a strictly positive scalar value specifying the radius used for expanding curvature measures
 *                           by summing measures of faces inside a ball of this radius centered at the
 *                           vertex expanded from. The summed face measures are weighted by their
 *                           inclusion ratio inside this ball.}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion is then just a sum of
 *                     measures on faces around the vertex}
 *   \cgalParamNEnd
 *
@@ -1099,9 +1101,9 @@ class Interpolated_corrected_curvatures_computer
 * @see `interpolated_corrected_principal_curvatures_and_directions()`
 */
 template<typename PolygonMesh,
-  typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
-    const NamedParameters& np = parameters::default_values())
+         typename NamedParameters = parameters::Default_named_parameters>
+void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
+                                       const NamedParameters& np = parameters::default_values())
 {
   internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np);
 }
@@ -1109,25 +1111,25 @@ template<typename PolygonMesh,
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* Computes the interpolated corrected mean curvature across the mesh
-* and stores it in a vertex property map `vcm`.
+* computes the interpolated corrected mean curvature across the mesh `pmesh`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam VertexCurvatureMap model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and `GT::FT` as value type.
+* @tparam VertexCurvatureMap a model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
 * @param vcm the vertex property map in which the computed mean curvatures are stored.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
+*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *
 * \cgalNamedParamsBegin
 *
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Point_3` as value type}
 *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
@@ -1136,11 +1138,18 @@ template<typename PolygonMesh,
 *   \cgalParamNBegin{vertex_normal_map}
 *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Vector_3` as value type}
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Vector_3` as value type}
 *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using compute_vertex_normals()}
+*                     computed using `compute_vertex_normals()`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{geom_traits}
+*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamType{a class model of `Kernel`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{ball_radius}
@@ -1162,10 +1171,10 @@ template<typename PolygonMesh,
 */
 
 template<typename PolygonMesh, typename VertexCurvatureMap,
-  typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
-    VertexCurvatureMap& vcm,
-    const NamedParameters& np = parameters::default_values())
+         typename NamedParameters = parameters::Default_named_parameters>
+void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
+                                           VertexCurvatureMap vcm,
+                                           const NamedParameters& np = parameters::default_values())
 {
   interpolated_corrected_curvatures(pmesh, np.vertex_mean_curvature_map(vcm));
 }
@@ -1173,24 +1182,24 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* Computes the interpolated corrected gaussian curvature across the mesh
-* and stores it in a vertex property map `vcm`.
+* computes the interpolated corrected gaussian curvature across the mesh `pmesh`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam VertexCurvatureMap model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and `GT::FT` as value type.
+* @tparam VertexCurvatureMap a model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
 * @param vcm the vertex property map in which the computed gaussian curvatures are stored.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
+*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *
 * \cgalNamedParamsBegin
 *
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `%Point_3` as value type}
 *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
@@ -1199,12 +1208,19 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *
 *   \cgalParamNBegin{vertex_normal_map}
 *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
+*     \cgalParamType{a class model of `GT::ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `%Vector_3` as value type}
 *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using compute_vertex_normals()}
+*                     computed using `compute_vertex_normals()`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{geom_traits}
+*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamType{a class model of `Kernel`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{ball_radius}
@@ -1225,10 +1241,10 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * @see `interpolated_corrected_curvatures()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
-  typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
-    VertexCurvatureMap& vcm,
-    const NamedParameters& np = parameters::default_values())
+         typename NamedParameters = parameters::Default_named_parameters>
+void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
+                                               VertexCurvatureMap vcm,
+                                               const NamedParameters& np = parameters::default_values())
 {
   interpolated_corrected_curvatures(pmesh, np.vertex_gaussian_curvature_map(vcm));
 }
@@ -1236,26 +1252,26 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* Computes the interpolated corrected principal curvatures across the mesh
-* and stores it in a vertex property map `vcm`.
+* computes the interpolated corrected principal curvatures across the mesh `pmesh`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam VertexCurvatureMap model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%Vertex_descriptor` as key type and
-* `%Principal_curvatures_and_directions` as value type.
+* @tparam VertexCurvatureMap a model of `WritablePropertyMap` with
+* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and
+* `Principal_curvatures_and_directions` as value type.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
 * @param vcm the vertex property map in which the computed principal curvatures are stored.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *
 * \cgalNamedParamsBegin
 *
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Point_3` as value type}
 *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
@@ -1264,11 +1280,18 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 *   \cgalParamNBegin{vertex_normal_map}
 *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-*                    as key type and `%Vector_3` as value type}
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Vector_3` as value type}
 *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using compute_vertex_normals()}
+*                     computed using `compute_vertex_normals()`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{geom_traits}
+*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamType{a class model of `Kernel`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{ball_radius}
@@ -1289,289 +1312,335 @@ template<typename PolygonMesh, typename VertexCurvatureMap,
 * @see `interpolated_corrected_curvatures()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
-  typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_principal_curvatures_and_directions(const PolygonMesh& pmesh,
-    VertexCurvatureMap& vcm,
-    const NamedParameters& np = parameters::default_values())
+typename NamedParameters = parameters::Default_named_parameters>
+void interpolated_corrected_principal_curvatures_and_directions(const PolygonMesh& pmesh,
+                                                                VertexCurvatureMap vcm,
+                                                                const NamedParameters& np = parameters::default_values())
 {
   interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvatures_and_directions_map(vcm));
 }
 
 
 /**
-  * \ingroup PMP_corrected_curvatures_grp
-  * Computes the interpolated corrected curvatures at a certain vertex, based on the provided pointers.
-  * By providing mean, gaussian and/or principal curvature and direction property maps as named parameters, the user
-  * can choose which quantites to compute.
-  *
-  * The pointers are used to store the computed quantities.
-  * The user is responsible for the memory management of the pointers.
-  *
-  * @tparam PolygonMesh a model of `FaceListGraph`
-  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
-  *
-  * @param pmesh the polygon mesh
-  * @param v the vertex of `pmesh` to compute the curvatures at
-  * @param np optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-  *
-  * \cgalNamedParamsBegin
-  *   \cgalParamNBegin{vertex_point_map}
-  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-  *     \cgalParamType{a class model of `ReadablePropertyMap` with
-  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-  *                    as key type and `%Point_3` as value type}
-  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
-  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{vertex_normal_map}
-  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-  *     \cgalParamType{a class model of `ReadablePropertyMap` with
-  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-  *                    as key type and `%Vector_3` as value type}
-  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-  *                     computed using compute_vertex_normals()}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{vertex_mean_curvature}
-  *     \cgalParamDescription{a pointer to a scalar value to store the mean curvature at the vertex `v`}
-  *     \cgalParamType{`GT::FT*`}
-  *     \cgalParamDefault{`nullptr`}
-  *     \cgalParamExtra{If this parameter is omitted, mean curvature won't be computed}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{vertex_gaussian_curvature}
-  *     \cgalParamDescription{a pointer to a scalar value to store the gaussian curvature at the vertex `v`}
-  *     \cgalParamType{`GT::FT*`}
-  *     \cgalParamDefault{`nullptr`}
-  *     \cgalParamExtra{If this parameter is omitted, gaussian curvature won't be computed}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{vertex_principal_curvatures_and_directions}
-  *     \cgalParamDescription{a pointer to a Principal_curvatures_and_directions object to store the principal curvatures and directions at the vertex `v`}
-  *     \cgalParamType{`Principal_curvatures_and_directions<GT>*`}
-  *     \cgalParamDefault{`nullptr`}
-  *     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions won't be computed}
-  *  \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{ball_radius}
-  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-  *                           by summing measures of faces inside a ball of this radius centered at the
-  *                           vertex expanded from. The summed face measures are weighted by their
-  *                           inclusion ratio inside this ball.}
-  *     \cgalParamType{`GT::FT`}
-  *     \cgalParamDefault{`-1`}
-  *     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
-  *                     measures on faces around the vertex}
-  *   \cgalParamNEnd
-  *
-  * \cgalNamedParamsEnd
-  *
-  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
-  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
-  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_one_vertex()`
-  * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
+* \ingroup PMP_corrected_curvatures_grp
+* computes the interpolated corrected curvatures at a certain vertex, based on the provided pointers.
+* By providing mean, gaussian and/or principal curvature and direction property maps as named parameters, the user
+* can choose which quantites to compute.
+*
+* The pointers are used to store the computed quantities.
+* The user is responsible for the memory management of the pointers.
+*
+* @tparam PolygonMesh a model of `FaceListGraph`
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+*
+* @param pmesh the polygon mesh
+* @param v the vertex of `pmesh` to compute the curvatures at
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
+*
+* \cgalNamedParamsBegin
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_normal_map}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Vector_3` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+*                     computed using `compute_vertex_normals()`}
+*   \cgalParamNEnd
+*
+*
+*   \cgalParamNBegin{geom_traits}
+*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamType{a class model of `Kernel`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_mean_curvature}
+*     \cgalParamDescription{a pointer to a scalar value to store the mean curvature at the vertex `v`}
+*     \cgalParamType{`GT::FT*`}
+*     \cgalParamDefault{`nullptr`}
+*     \cgalParamExtra{If this parameter is omitted, mean curvature won't be computed}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_gaussian_curvature}
+*     \cgalParamDescription{a pointer to a scalar value to store the gaussian curvature at the vertex `v`}
+*     \cgalParamType{`GT::FT*`}
+*     \cgalParamDefault{`nullptr`}
+*     \cgalParamExtra{If this parameter is omitted, gaussian curvature won't be computed}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_principal_curvatures_and_directions}
+*     \cgalParamDescription{a pointer to a Principal_curvatures_and_directions object to store the principal curvatures and directions at the vertex `v`}
+*     \cgalParamType{`Principal_curvatures_and_directions<GT>*`}
+*     \cgalParamDefault{`nullptr`}
+*     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions won't be computed}
+*  \cgalParamNEnd
+*
+*   \cgalParamNBegin{ball_radius}
+*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+*                           by summing measures of faces inside a ball of this radius centered at the
+*                           vertex expanded from. The summed face measures are weighted by their
+*                           inclusion ratio inside this ball.}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{`-1`}
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
+*                     measures on faces around the vertex}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+*
+* @see `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
+* @see `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
+* @see `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_one_vertex()`
+* @see `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
 */
 template<typename PolygonMesh,
-  typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_curvatures_one_vertex(const PolygonMesh& pmesh,
-    typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-    const NamedParameters& np = parameters::default_values())
+         typename NamedParameters = parameters::Default_named_parameters>
+void interpolated_corrected_curvatures_one_vertex(const PolygonMesh& pmesh,
+                                                  typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+                                                  const NamedParameters& np = parameters::default_values())
 {
   internal::interpolated_corrected_curvatures_one_vertex(pmesh, v, np);
 }
 
 /**
-  * \ingroup PMP_corrected_curvatures_grp
-  * computes the interpolated corrected mean curvature at a vertex of a triangle mesh.
-  *
-  * @tparam GT a geometric traits class that provides the nested type `FT`,
-  * @tparam PolygonMesh a model of `FaceListGraph`
-  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
-  *
-  * @param pmesh the polygon mesh
-  * @param v the vertex of `pmesh` to compute the mean curvature at
-  * @param np optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-  *
-  * \cgalNamedParamsBegin
-  *   \cgalParamNBegin{vertex_point_map}
-  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-  *     \cgalParamType{a class model of `ReadablePropertyMap` with
-  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-  *                    as key type and `%Point_3` as value type}
-  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
-  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{vertex_normal_map}
-  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-  *     \cgalParamType{a class model of `ReadablePropertyMap` with
-  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-  *                    as key type and `%Vector_3` as value type}
-  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-  *                     computed using compute_vertex_normals()}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{ball_radius}
-  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-  *                           by summing measures of faces inside a ball of this radius centered at the
-  *                           vertex expanded from. The summed face measures are weighted by their
-  *                           inclusion ratio inside this ball}
-  *     \cgalParamType{`GT::FT`}
-  *     \cgalParamDefault{`-1`}
-  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-  *                     measures on faces around the vertex}
-  *   \cgalParamNEnd
-  *
-  * \cgalNamedParamsEnd
-  *
-  * @return the interpolated corrected mean curvature at the vertex `v`
-  *
-  * @see `interpolated_corrected_mean_curvature()`
-  * @see `interpolated_corrected_gaussian_curvature_one_vertex()`
-  * @see `interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
-  * @see `interpolated_corrected_curvatures_one_vertex()`
+* \ingroup PMP_corrected_curvatures_grp
+* computes the interpolated corrected mean curvature at a vertex of a triangle mesh.
+*
+* @tparam PolygonMesh a model of `FaceListGraph`
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+*
+* @param pmesh the polygon mesh
+* @param v the vertex of `pmesh` to compute the mean curvature at
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
+*
+* \cgalNamedParamsBegin
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_normal_map}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Vector_3` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+*                     computed using `compute_vertex_normals()`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{geom_traits}
+*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamType{a class model of `Kernel`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{ball_radius}
+*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+*                           by summing measures of faces inside a ball of this radius centered at the
+*                           vertex expanded from. The summed face measures are weighted by their
+*                           inclusion ratio inside this ball}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{`-1`}
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+*                     measures on faces around the vertex}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+*
+* @return the interpolated corrected mean curvature at the vertex `v`
+*
+* @see `interpolated_corrected_mean_curvature()`
+* @see `interpolated_corrected_gaussian_curvature_one_vertex()`
+* @see `interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
+* @see `interpolated_corrected_curvatures_one_vertex()`
 */
 
-template<typename GT, typename PolygonMesh,
-  typename NamedParameters = parameters::Default_named_parameters>
-  typename GT::FT interpolated_corrected_mean_curvature_one_vertex(const PolygonMesh& pmesh,
-    typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-    const NamedParameters& np = parameters::default_values())
+template<typename PolygonMesh,
+         typename NamedParameters = parameters::Default_named_parameters>
+#ifdef DOXYGEN_RUNNING
+typename GT::FT
+#else
+typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
+#endif
+interpolated_corrected_mean_curvature_one_vertex(const PolygonMesh& pmesh,
+                                                 typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+                                                 const NamedParameters& np = parameters::default_values())
 {
-  typename GT::FT mean_curvature;
+  typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT mean_curvature;
   interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_mean_curvature(&mean_curvature));
   return mean_curvature;
 }
 
 /**
-  * \ingroup PMP_corrected_curvatures_grp
-  * computes the interpolated corrected Gaussian curvature at a vertex of a triangle mesh.
-  *
-  * @tparam GT a geometric traits class that provides the nested type `FT`,
-  * @tparam PolygonMesh a model of `FaceListGraph`
-  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
-  *
-  * @param pmesh the polygon mesh
-  * @param v the vertex of `pmesh` to compute the Gaussian curvature at
-  * @param np optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-  *
-  * \cgalNamedParamsBegin
-  *   \cgalParamNBegin{vertex_point_map}
-  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-  *     \cgalParamType{a class model of `ReadablePropertyMap` with
-  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-  *                    as key type and `%Point_3` as value type}
-  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
-  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{vertex_normal_map}
-  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-  *     \cgalParamType{a class model of `ReadablePropertyMap` with
-  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-  *                    as key type and `%Vector_3` as value type}
-  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-  *                     computed using compute_vertex_normals()}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{ball_radius}
-  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-  *                           by summing measures of faces inside a ball of this radius centered at the
-  *                           vertex expanded from. The summed face measures are weighted by their
-  *                           inclusion ratio inside this ball}
-  *     \cgalParamType{`GT::FT`}
-  *     \cgalParamDefault{`-1`}
-  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-  *                     measures on faces around the vertex}
-  *   \cgalParamNEnd
-  *
-  * \cgalNamedParamsEnd
-  *
-  * @return the interpolated corrected Gaussian curvature at the vertex `v`
-  *
-  * @see `interpolated_corrected_gaussian_curvature()`
-  * @see `interpolated_corrected_mean_curvature_one_vertex()`
-  * @see `interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
-  * @see `interpolated_corrected_curvatures_one_vertex()`
+* \ingroup PMP_corrected_curvatures_grp
+* computes the interpolated corrected Gaussian curvature at a vertex of a triangle mesh.
+*
+* @tparam PolygonMesh a model of `FaceListGraph`
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+*
+* @param pmesh the polygon mesh
+* @param v the vertex of `pmesh` to compute the Gaussian curvature at
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
+*
+* \cgalNamedParamsBegin
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_normal_map}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `GT::Vector_3` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+*                     computed using `compute_vertex_normals()`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{geom_traits}
+*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamType{a class model of `Kernel`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{ball_radius}
+*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+*                           by summing measures of faces inside a ball of this radius centered at the
+*                           vertex expanded from. The summed face measures are weighted by their
+*                           inclusion ratio inside this ball}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{`-1`}
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+*                     measures on faces around the vertex}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+*
+* @return the interpolated corrected Gaussian curvature at the vertex `v`
+*
+* @see `interpolated_corrected_gaussian_curvature()`
+* @see `interpolated_corrected_mean_curvature_one_vertex()`
+* @see `interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
+* @see `interpolated_corrected_curvatures_one_vertex()`
 */
 
-template<typename GT, typename PolygonMesh,
+template<typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
-  typename GT::FT interpolated_corrected_gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
-    typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-    const NamedParameters& np = parameters::default_values())
+#ifdef DOXYGEN_RUNNING
+typename GT::FT
+#else
+typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
+#endif
+interpolated_corrected_gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
+                                                     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+                                                     const NamedParameters& np = parameters::default_values())
 {
-  typename GT::FT gc;
+  typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT gc;
   interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_gaussian_curvature(&gc));
   return gc;
 }
 
 /**
-  * \ingroup PMP_corrected_curvatures_grp
-  * computes the interpolated corrected principal curvatures and directions at a vertex of a triangle mesh.
-  *
-  * @tparam GT the geometric traits class,
-  * @tparam PolygonMesh a model of `FaceListGraph`
-  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
-  *
-  * @param pmesh the polygon mesh
-  * @param v the vertex of `pmesh` to compute the principal curvatures and directions at
-  * @param np optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-  *
-  * \cgalNamedParamsBegin
-  *   \cgalParamNBegin{vertex_point_map}
-  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
-  *     \cgalParamType{a class model of `ReadablePropertyMap` with
-  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-  *                    as key type and `%Point_3` as value type}
-  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
-  *     \cgalParamExtra{If this parameter is omitted, an internal property map for
-  *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{vertex_normal_map}
-  *     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
-  *     \cgalParamType{a class model of `ReadablePropertyMap` with
-  *                    `boost::graph_traits<PolygonMesh>::%Vertex_descriptor`
-  *                    as key type and `%Vector_3` as value type}
-  *     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
-  *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-  *                     computed using compute_vertex_normals()}
-  *   \cgalParamNEnd
-  *
-  *   \cgalParamNBegin{ball_radius}
-  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-  *                           by summing measures of faces inside a ball of this radius centered at the
-  *                           vertex expanded from. The summed face measures are weighted by their
-  *                           inclusion ratio inside this ball}
-  *     \cgalParamType{`GT::FT`}
-  *     \cgalParamDefault{`-1`}
-  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-  *                     measures on faces around the vertex}
-  *   \cgalParamNEnd
-  * \cgalNamedParamsEnd
-  *
-  * @return the interpolated corrected principal curvatures and directions at the vertex `v`
-  *
-  * @see `interpolated_corrected_principal_curvatures_and_directions()`
-  * @see `interpolated_corrected_mean_curvature_one_vertex()`
-  * @see `interpolated_corrected_gaussian_curvature_one_vertex()`
-  * @see `interpolated_corrected_curvatures_one_vertex()`
+* \ingroup PMP_corrected_curvatures_grp
+* computes the interpolated corrected principal curvatures and directions at a vertex of a triangle mesh.
+*
+* @tparam PolygonMesh a model of `FaceListGraph`
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+*
+* @param pmesh the polygon mesh
+* @param v the vertex of `pmesh` to compute the principal curvatures and directions at
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
+*
+* \cgalNamedParamsBegin
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for
+*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_normal_map}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with
+*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `%Vector_3` as value type}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
+*                     computed using `compute_vertex_normals()`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{geom_traits}
+*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamType{a class model of `Kernel`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{ball_radius}
+*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+*                           by summing measures of faces inside a ball of this radius centered at the
+*                           vertex expanded from. The summed face measures are weighted by their
+*                           inclusion ratio inside this ball}
+*     \cgalParamType{`GT::FT`}
+*     \cgalParamDefault{`-1`}
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+*                     measures on faces around the vertex}
+*   \cgalParamNEnd
+* \cgalNamedParamsEnd
+*
+* @return the interpolated corrected principal curvatures and directions at the vertex `v`
+*
+* @see `interpolated_corrected_principal_curvatures_and_directions()`
+* @see `interpolated_corrected_mean_curvature_one_vertex()`
+* @see `interpolated_corrected_gaussian_curvature_one_vertex()`
+* @see `interpolated_corrected_curvatures_one_vertex()`
 */
 
-template<typename GT, typename PolygonMesh,
-  typename NamedParameters = parameters::Default_named_parameters>
-  Principal_curvatures_and_directions<GT> interpolated_corrected_principal_curvatures_and_directions_one_vertex(const PolygonMesh& pmesh,
-    typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-    const NamedParameters& np = parameters::default_values())
+template<typename PolygonMesh,
+         typename NamedParameters = parameters::Default_named_parameters>
+#ifdef DOXYGEN_RUNNING
+Principal_curvatures_and_directions<GT>
+#else
+Principal_curvatures_and_directions<typename GetGeomTraits<PolygonMesh, NamedParameters>::type>
+#endif
+interpolated_corrected_principal_curvatures_and_directions_one_vertex(const PolygonMesh& pmesh,
+                                                                      typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+                                                                      const NamedParameters& np = parameters::default_values())
 {
+  using GT=typename GetGeomTraits<PolygonMesh, NamedParameters>::type;
   Principal_curvatures_and_directions<GT> pcd;
   interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(&pcd));
   return pcd;

From 5ef5d67920724435a903a932866b9525260125a1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 22 Mar 2023 18:40:44 +0100
Subject: [PATCH 0134/1398] do not use pointers

---
 .../interpolated_corrected_curvatures.h       | 75 +++++++++----------
 ...test_interpolated_corrected_curvatures.cpp |  6 +-
 2 files changed, 39 insertions(+), 42 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 24c1d12a59e3..cc898d2fc943 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -624,6 +624,16 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
   return vertex_measures;
 }
 
+template <class T>
+void set_value(const T& value, std::reference_wrapper<T> rw)
+{
+  rw.get()=value;
+}
+
+template <class T>
+void set_value(const T&, internal_np::Param_not_found)
+{}
+
 // computes selected curvatures for one specific vertex
 template<typename PolygonMesh,
   typename NamedParameters = parameters::Default_named_parameters>
@@ -662,15 +672,10 @@ template<typename PolygonMesh,
   if (radius == 0)
     radius = average_edge_length<PolygonMesh, GT>(pmesh) * 1e-6;
 
-  // get parameters (pointers) for curvatures
-  typename GT::FT* vertex_mean_curvature = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature), nullptr);
-  typename GT::FT* vertex_gaussian_curvature = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature), nullptr);
-  Principal_curvatures_and_directions<GT>* vertex_principal_curvatures_and_directions = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvatures_and_directions), nullptr);
-
-  // determine which curvatures are selected (by checking if the pointers are not null)
-  const bool is_mean_curvature_selected = (vertex_mean_curvature != nullptr);
-  const bool is_gaussian_curvature_selected = (vertex_gaussian_curvature != nullptr);
-  const bool is_principal_curvatures_and_directions_selected = (vertex_principal_curvatures_and_directions != nullptr);
+  // determine which curvatures are selected
+  const bool is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_t>::value;
+  const bool is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_t>::value;
+  const bool is_principal_curvatures_and_directions_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvatures_and_directions_t>::value;
 
   Vertex_measures<GT> vertex_measures;
 
@@ -703,13 +708,13 @@ template<typename PolygonMesh,
 
   // compute the selected curvatures from expanded measures
   if (is_mean_curvature_selected) {
-    *vertex_mean_curvature = vertex_measures.area_measure != 0 ?
-      0.5 * vertex_measures.mean_curvature_measure / vertex_measures.area_measure : 0;
+    set_value(vertex_measures.area_measure != 0 ? 0.5 * vertex_measures.mean_curvature_measure / vertex_measures.area_measure : 0,
+              get_parameter(np, internal_np::vertex_mean_curvature));
   }
 
   if (is_gaussian_curvature_selected) {
-    *vertex_gaussian_curvature = vertex_measures.area_measure != 0 ?
-      vertex_measures.gaussian_curvature_measure / vertex_measures.area_measure : 0;
+    set_value(vertex_measures.area_measure != 0 ? vertex_measures.gaussian_curvature_measure / vertex_measures.area_measure : 0,
+              get_parameter(np, internal_np::vertex_gaussian_curvature));
   }
 
   if (is_principal_curvatures_and_directions_selected) {
@@ -718,9 +723,8 @@ template<typename PolygonMesh,
     const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
       vertex_measures.anisotropic_measure,
       vertex_measures.area_measure,
-      v_normal
-      );
-    *vertex_principal_curvatures_and_directions = principal_curvatures_and_directions;
+      v_normal);
+    set_value(principal_curvatures_and_directions, get_parameter(np, internal_np::vertex_principal_curvatures_and_directions));
   }
 }
 
@@ -1064,7 +1068,7 @@ class Interpolated_corrected_curvatures_computer
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `GT::FT` as value type}
-*     \cgalParamExtra{If this parameter is omitted, mean curvatures won't be computed}
+*     \cgalParamExtra{If this parameter is omitted, mean curvatures will not be computed}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_gaussian_curvature_map}
@@ -1072,7 +1076,7 @@ class Interpolated_corrected_curvatures_computer
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `GT::FT` as value type}
-*     \cgalParamExtra{If this parameter is omitted, gaussian curvatures won't be computed}
+*     \cgalParamExtra{If this parameter is omitted, gaussian curvatures will not be computed}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_principal_curvatures_and_directions_map}
@@ -1080,7 +1084,7 @@ class Interpolated_corrected_curvatures_computer
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `Principal_curvatures_and_directions<GT>` as value type}
-*     \cgalParamExtra{If this parameter is omitted, mean principal won't be computed}
+*     \cgalParamExtra{If this parameter is omitted, mean principal will not be computed}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{ball_radius}
@@ -1323,13 +1327,10 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 
 /**
 * \ingroup PMP_corrected_curvatures_grp
-* computes the interpolated corrected curvatures at a certain vertex, based on the provided pointers.
+* computes the interpolated corrected curvatures at a vertex `v`.
 * By providing mean, gaussian and/or principal curvature and direction property maps as named parameters, the user
 * can choose which quantites to compute.
 *
-* The pointers are used to store the computed quantities.
-* The user is responsible for the memory management of the pointers.
-*
 * @tparam PolygonMesh a model of `FaceListGraph`
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
@@ -1359,7 +1360,6 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 *                     computed using `compute_vertex_normals()`}
 *   \cgalParamNEnd
 *
-*
 *   \cgalParamNBegin{geom_traits}
 *     \cgalParamDescription{an instance of a geometric traits class}
 *     \cgalParamType{a class model of `Kernel`}
@@ -1368,24 +1368,21 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_mean_curvature}
-*     \cgalParamDescription{a pointer to a scalar value to store the mean curvature at the vertex `v`}
-*     \cgalParamType{`GT::FT*`}
-*     \cgalParamDefault{`nullptr`}
-*     \cgalParamExtra{If this parameter is omitted, mean curvature won't be computed}
+*     \cgalParamDescription{a reference to a scalar value to store the mean curvature at the vertex `v`}
+*     \cgalParamType{`std::reference_wrapper<GT::FT>`}
+*     \cgalParamExtra{If this parameter is omitted, mean curvature will not be computed}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_gaussian_curvature}
-*     \cgalParamDescription{a pointer to a scalar value to store the gaussian curvature at the vertex `v`}
-*     \cgalParamType{`GT::FT*`}
-*     \cgalParamDefault{`nullptr`}
-*     \cgalParamExtra{If this parameter is omitted, gaussian curvature won't be computed}
+*     \cgalParamDescription{a reference to a scalar value to store the gaussian curvature at the vertex `v`}
+*     \cgalParamType{`std::reference_wrapper<GT::FT>`}
+*     \cgalParamExtra{If this parameter is omitted, gaussian curvature will not be computed}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_principal_curvatures_and_directions}
-*     \cgalParamDescription{a pointer to a Principal_curvatures_and_directions object to store the principal curvatures and directions at the vertex `v`}
-*     \cgalParamType{`Principal_curvatures_and_directions<GT>*`}
-*     \cgalParamDefault{`nullptr`}
-*     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions won't be computed}
+*     \cgalParamDescription{a reference to an`Principal_curvatures_and_directions<GT>` object to store the principal curvatures and directions at the vertex `v`}
+*     \cgalParamType{`std::reference_wrapper<Principal_curvatures_and_directions<GT>>`}
+*     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions will not be computed}
 *  \cgalParamNEnd
 *
 *   \cgalParamNBegin{ball_radius}
@@ -1488,7 +1485,7 @@ interpolated_corrected_mean_curvature_one_vertex(const PolygonMesh& pmesh,
                                                  const NamedParameters& np = parameters::default_values())
 {
   typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT mean_curvature;
-  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_mean_curvature(&mean_curvature));
+  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_mean_curvature(std::ref(mean_curvature)));
   return mean_curvature;
 }
 
@@ -1565,7 +1562,7 @@ interpolated_corrected_gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
                                                      const NamedParameters& np = parameters::default_values())
 {
   typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT gc;
-  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_gaussian_curvature(&gc));
+  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_gaussian_curvature(std::ref(gc)));
   return gc;
 }
 
@@ -1642,7 +1639,7 @@ interpolated_corrected_principal_curvatures_and_directions_one_vertex(const Poly
 {
   using GT=typename GetGeomTraits<PolygonMesh, NamedParameters>::type;
   Principal_curvatures_and_directions<GT> pcd;
-  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(&pcd));
+  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(std::ref(pcd)));
   return pcd;
 }
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index c8d3894720cc..bd0594652206 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -165,9 +165,9 @@ void test_average_curvatures(std::string mesh_path,
       PMP::interpolated_corrected_curvatures_one_vertex(
         pmesh,
         v,
-        CGAL::parameters::vertex_gaussian_curvature(&g)
-        .vertex_mean_curvature(&h)
-        .vertex_principal_curvatures_and_directions(&p)
+        CGAL::parameters::vertex_gaussian_curvature(std::ref(g))
+        .vertex_mean_curvature(std::ref(h))
+        .vertex_principal_curvatures_and_directions(std::ref(p))
         .ball_radius(test_info.expansion_radius)
       );
 

From 7f4597720eed4bc4c9c215668f99e02495357826 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 22 Mar 2023 18:44:11 +0100
Subject: [PATCH 0135/1398] the mesh does not need to be triangulated

---
 .../interpolated_corrected_curvatures.h                     | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index cc898d2fc943..94a8533ca42b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -1414,7 +1414,7 @@ void interpolated_corrected_curvatures_one_vertex(const PolygonMesh& pmesh,
 
 /**
 * \ingroup PMP_corrected_curvatures_grp
-* computes the interpolated corrected mean curvature at a vertex of a triangle mesh.
+* computes the interpolated corrected mean curvature at vertex `v` of mesh `pmesh`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
@@ -1491,7 +1491,7 @@ interpolated_corrected_mean_curvature_one_vertex(const PolygonMesh& pmesh,
 
 /**
 * \ingroup PMP_corrected_curvatures_grp
-* computes the interpolated corrected Gaussian curvature at a vertex of a triangle mesh.
+* computes the interpolated corrected Gaussian curvature at vertex `v` of mesh `pmesh`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
@@ -1568,7 +1568,7 @@ interpolated_corrected_gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
 
 /**
 * \ingroup PMP_corrected_curvatures_grp
-* computes the interpolated corrected principal curvatures and directions at a vertex of a triangle mesh.
+* computes the interpolated corrected principal curvatures and directions at vertex `v` of mesh `pmesh`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"

From 661513b16ee05509e00d0975213e928c75443dd3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 22 Mar 2023 19:12:28 +0100
Subject: [PATCH 0136/1398] gaussian -> Gaussian

---
 .../PackageDescription.txt                    |  4 +-
 .../Polygon_mesh_processing.txt               |  4 +-
 .../interpolated_corrected_curvatures_PH.cpp  |  2 +-
 .../interpolated_corrected_curvatures_SM.cpp  |  2 +-
 ...terpolated_corrected_curvatures_vertex.cpp |  4 +-
 .../interpolated_corrected_curvatures.h       | 76 +++++++++----------
 ...test_interpolated_corrected_curvatures.cpp | 24 +++---
 .../Display/Display_property_plugin.cpp       | 10 +--
 .../internal/parameters_interface.h           |  4 +-
 9 files changed, 65 insertions(+), 65 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 9cb257338a72..9c8b5d6f2948 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -209,11 +209,11 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 
 \cgalCRPSection{Corrected Curvatures}
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_one_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature_one_vertex()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_one_vertex()`
 - `CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions`
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 2eb85a80bfbb..65c236e99fc3 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -901,7 +901,7 @@ Polyhedron_3 and other polygonal mesh structures based on the Face Graph Model.
 
 These computations are performed using (on all vertices of mesh):
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
 
@@ -910,7 +910,7 @@ as the implementation performs the shared computations only once, making it more
 
 Similarly, we can use the following functions to compute curvatures on a specific vertex:
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_one_vertex()`
+- `CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature_one_vertex()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_one_vertex()`
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
index 3cf675c53ca4..0e3923dc67b8 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
@@ -38,7 +38,7 @@ int main(int argc, char* argv[])
     polyhedron,
     mean_curvature_map);
 
-  PMP::interpolated_corrected_gaussian_curvature(
+  PMP::interpolated_corrected_Gaussian_curvature(
     polyhedron,
     gaussian_curvature_map);
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
index d92ec7b8096d..811146dd6412 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
@@ -53,7 +53,7 @@ int main(int argc, char* argv[])
     mean_curvature_map
   );
 
-  PMP::interpolated_corrected_gaussian_curvature(
+  PMP::interpolated_corrected_Gaussian_curvature(
     smesh,
     gaussian_curvature_map
   );
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
index e5845a1b3a5a..c0722b25675a 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
@@ -31,7 +31,7 @@ int main(int argc, char* argv[])
   for (vertex_descriptor v : vertices(smesh))
   {
     double h = PMP::interpolated_corrected_mean_curvature_one_vertex(smesh, v);
-    double g = PMP::interpolated_corrected_gaussian_curvature_one_vertex(smesh, v);
+    double g = PMP::interpolated_corrected_Gaussian_curvature_one_vertex(smesh, v);
     PMP::Principal_curvatures_and_directions<Epic_kernel> p =
       PMP::interpolated_corrected_principal_curvatures_and_directions_one_vertex(smesh, v);
 
@@ -48,7 +48,7 @@ int main(int argc, char* argv[])
     //   smesh,
     //   v,
     //   CGAL::parameters::vertex_mean_curvature(&h)
-    //   .vertex_gaussian_curvature(&g)
+    //   .vertex_Gaussian_curvature(&g)
     // );
 
     std::cout << v.idx() << ": HC = " << h
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 94a8533ca42b..bffd2657e96c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -222,7 +222,7 @@ typename GT::FT interpolated_corrected_mean_curvature_measure_face(const std::ve
 }
 
 template<typename GT>
-typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& u)
+typename GT::FT interpolated_corrected_Gaussian_curvature_measure_face(const std::vector<typename GT::Vector_3>& u)
 {
   const std::size_t n = u.size();
   CGAL_precondition(n >= 3);
@@ -259,7 +259,7 @@ typename GT::FT interpolated_corrected_gaussian_curvature_measure_face(const std
     // summing each triangle's measure after triangulation by barycenter split.
     for (std::size_t i = 0; i < n; i++)
     {
-      mu2 += interpolated_corrected_gaussian_curvature_measure_face<GT>(
+      mu2 += interpolated_corrected_Gaussian_curvature_measure_face<GT>(
         std::vector<typename GT::Vector_3> {u[i], u[(i + 1) % n], uc}
       );
     }
@@ -483,7 +483,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
   const PolygonMesh& pmesh,
   const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
   const bool is_mean_curvature_selected,
-  const bool is_gaussian_curvature_selected,
+  const bool is_Gaussian_curvature_selected,
   const bool is_principal_curvatures_and_directions_selected,
   const VPM vpm,
   const VNM vnm
@@ -519,8 +519,8 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
       if (is_mean_curvature_selected)
         vertex_measures.mean_curvature_measure += interpolated_corrected_mean_curvature_measure_face<GT>(u, x);
 
-      if (is_gaussian_curvature_selected)
-        vertex_measures.gaussian_curvature_measure += interpolated_corrected_gaussian_curvature_measure_face<GT>(u);
+      if (is_Gaussian_curvature_selected)
+        vertex_measures.gaussian_curvature_measure += interpolated_corrected_Gaussian_curvature_measure_face<GT>(u);
 
       if (is_principal_curvatures_and_directions_selected)
       {
@@ -543,7 +543,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
   const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
   const typename GT::FT radius,
   const bool is_mean_curvature_selected,
-  const bool is_gaussian_curvature_selected,
+  const bool is_Gaussian_curvature_selected,
   const bool is_principal_curvatures_and_directions_selected,
   const VPM vpm,
   const VNM vnm
@@ -598,8 +598,8 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
       if (is_mean_curvature_selected)
         vertex_measures.mean_curvature_measure += f_ratio * interpolated_corrected_mean_curvature_measure_face<GT>(u, x);
 
-      if (is_gaussian_curvature_selected)
-        vertex_measures.gaussian_curvature_measure += f_ratio * interpolated_corrected_gaussian_curvature_measure_face<GT>(u);
+      if (is_Gaussian_curvature_selected)
+        vertex_measures.gaussian_curvature_measure += f_ratio * interpolated_corrected_Gaussian_curvature_measure_face<GT>(u);
 
       if (is_principal_curvatures_and_directions_selected)
       {
@@ -674,7 +674,7 @@ template<typename PolygonMesh,
 
   // determine which curvatures are selected
   const bool is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_t>::value;
-  const bool is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_t>::value;
+  const bool is_Gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_Gaussian_curvature_t>::value;
   const bool is_principal_curvatures_and_directions_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvatures_and_directions_t>::value;
 
   Vertex_measures<GT> vertex_measures;
@@ -686,7 +686,7 @@ template<typename PolygonMesh,
       pmesh,
       v,
       is_mean_curvature_selected,
-      is_gaussian_curvature_selected,
+      is_Gaussian_curvature_selected,
       is_principal_curvatures_and_directions_selected,
       vpm,
       vnm
@@ -699,7 +699,7 @@ template<typename PolygonMesh,
       v,
       radius,
       is_mean_curvature_selected,
-      is_gaussian_curvature_selected,
+      is_Gaussian_curvature_selected,
       is_principal_curvatures_and_directions_selected,
       vpm,
       vnm
@@ -712,9 +712,9 @@ template<typename PolygonMesh,
               get_parameter(np, internal_np::vertex_mean_curvature));
   }
 
-  if (is_gaussian_curvature_selected) {
+  if (is_Gaussian_curvature_selected) {
     set_value(vertex_measures.area_measure != 0 ? vertex_measures.gaussian_curvature_measure / vertex_measures.area_measure : 0,
-              get_parameter(np, internal_np::vertex_gaussian_curvature));
+              get_parameter(np, internal_np::vertex_Gaussian_curvature));
   }
 
   if (is_principal_curvatures_and_directions_selected) {
@@ -756,9 +756,9 @@ class Interpolated_corrected_curvatures_computer
     NamedParameters,
     Default_scalar_map>::type Vertex_mean_curvature_map;
 
-  typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_gaussian_curvature_map_t,
+  typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_Gaussian_curvature_map_t,
     NamedParameters,
-    Default_scalar_map>::type Vertex_gaussian_curvature_map;
+    Default_scalar_map>::type Vertex_Gaussian_curvature_map;
 
   typedef Constant_property_map<Vertex_descriptor, Principal_curvatures_and_directions<GT>> Default_principal_map;
   typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvatures_and_directions_map_t,
@@ -777,11 +777,11 @@ class Interpolated_corrected_curvatures_computer
   FT ball_radius;
 
   bool is_mean_curvature_selected;
-  bool is_gaussian_curvature_selected;
+  bool is_Gaussian_curvature_selected;
   bool is_principal_curvatures_and_directions_selected;
 
   Vertex_mean_curvature_map mean_curvature_map;
-  Vertex_gaussian_curvature_map gaussian_curvature_map;
+  Vertex_Gaussian_curvature_map gaussian_curvature_map;
   Vertex_principal_curvatures_and_directions_map principal_curvatures_and_directions_map;
 
   Face_scalar_measure_map mu0_map, mu1_map, mu2_map;
@@ -817,11 +817,11 @@ class Interpolated_corrected_curvatures_computer
 
     // check which curvature maps are provided by the user (determines which curvatures are computed)
     is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_map_t>::value;
-    is_gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_gaussian_curvature_map_t>::value;
+    is_Gaussian_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_Gaussian_curvature_map_t>::value;
     is_principal_curvatures_and_directions_selected = !is_default_parameter<NamedParameters, internal_np::vertex_principal_curvatures_and_directions_map_t>::value;
 
     mean_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_mean_curvature_map), Default_scalar_map());
-    gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_gaussian_curvature_map), Default_scalar_map());
+    gaussian_curvature_map = choose_parameter(get_parameter(np, internal_np::vertex_Gaussian_curvature_map), Default_scalar_map());
     principal_curvatures_and_directions_map = choose_parameter(get_parameter(np, internal_np::vertex_principal_curvatures_and_directions_map), Default_principal_map());
   }
 
@@ -842,7 +842,7 @@ class Interpolated_corrected_curvatures_computer
   {
     set_named_params(np);
 
-    if (is_mean_curvature_selected || is_gaussian_curvature_selected || is_principal_curvatures_and_directions_selected)
+    if (is_mean_curvature_selected || is_Gaussian_curvature_selected || is_principal_curvatures_and_directions_selected)
     {
       set_property_maps();
 
@@ -872,8 +872,8 @@ class Interpolated_corrected_curvatures_computer
       if (is_mean_curvature_selected)
         put(mu1_map, f, interpolated_corrected_mean_curvature_measure_face<GT>(u, x));
 
-      if (is_gaussian_curvature_selected)
-        put(mu2_map, f, interpolated_corrected_gaussian_curvature_measure_face<GT>(u));
+      if (is_Gaussian_curvature_selected)
+        put(mu2_map, f, interpolated_corrected_Gaussian_curvature_measure_face<GT>(u));
 
       if (is_principal_curvatures_and_directions_selected)
         put(muXY_map, f, interpolated_corrected_anisotropic_measure_face<GT>(u, x));
@@ -899,7 +899,7 @@ class Interpolated_corrected_curvatures_computer
       if (is_mean_curvature_selected)
         vertex_measures.mean_curvature_measure += get(mu1_map, f);
 
-      if (is_gaussian_curvature_selected)
+      if (is_Gaussian_curvature_selected)
         vertex_measures.gaussian_curvature_measure += get(mu2_map, f);
 
       if (is_principal_curvatures_and_directions_selected)
@@ -957,7 +957,7 @@ class Interpolated_corrected_curvatures_computer
         if (is_mean_curvature_selected)
           vertex_measures.mean_curvature_measure += f_ratio * get(mu1_map, fi);
 
-        if (is_gaussian_curvature_selected)
+        if (is_Gaussian_curvature_selected)
           vertex_measures.gaussian_curvature_measure += f_ratio * get(mu2_map, fi);
 
         if (is_principal_curvatures_and_directions_selected)
@@ -998,7 +998,7 @@ class Interpolated_corrected_curvatures_computer
           put(mean_curvature_map, v, 0);
       }
 
-      if (is_gaussian_curvature_selected) {
+      if (is_Gaussian_curvature_selected) {
         vertex_measures.area_measure != 0 ?
           put(gaussian_curvature_map, v, vertex_measures.gaussian_curvature_measure / vertex_measures.area_measure) :
           put(gaussian_curvature_map, v, 0);
@@ -1071,7 +1071,7 @@ class Interpolated_corrected_curvatures_computer
 *     \cgalParamExtra{If this parameter is omitted, mean curvatures will not be computed}
 *   \cgalParamNEnd
 *
-*   \cgalParamNBegin{vertex_gaussian_curvature_map}
+*   \cgalParamNBegin{vertex_Gaussian_curvature_map}
 *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
@@ -1101,7 +1101,7 @@ class Interpolated_corrected_curvatures_computer
 * \cgalNamedParamsEnd
 *
 * @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_gaussian_curvature()`
+* @see `interpolated_corrected_Gaussian_curvature()`
 * @see `interpolated_corrected_principal_curvatures_and_directions()`
 */
 template<typename PolygonMesh,
@@ -1169,7 +1169,7 @@ void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
 *
 * \cgalNamedParamsEnd
 *
-* @see `interpolated_corrected_gaussian_curvature()`
+* @see `interpolated_corrected_Gaussian_curvature()`
 * @see `interpolated_corrected_principal_curvatures_and_directions()`
 * @see `interpolated_corrected_curvatures()`
 */
@@ -1246,11 +1246,11 @@ void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
          typename NamedParameters = parameters::Default_named_parameters>
-void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
+void interpolated_corrected_Gaussian_curvature(const PolygonMesh& pmesh,
                                                VertexCurvatureMap vcm,
                                                const NamedParameters& np = parameters::default_values())
 {
-  interpolated_corrected_curvatures(pmesh, np.vertex_gaussian_curvature_map(vcm));
+  interpolated_corrected_curvatures(pmesh, np.vertex_Gaussian_curvature_map(vcm));
 }
 
 /**
@@ -1312,7 +1312,7 @@ void interpolated_corrected_gaussian_curvature(const PolygonMesh& pmesh,
 * \cgalNamedParamsEnd
 *
 * @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_gaussian_curvature()`
+* @see `interpolated_corrected_Gaussian_curvature()`
 * @see `interpolated_corrected_curvatures()`
 */
 template<typename PolygonMesh, typename VertexCurvatureMap,
@@ -1373,7 +1373,7 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 *     \cgalParamExtra{If this parameter is omitted, mean curvature will not be computed}
 *   \cgalParamNEnd
 *
-*   \cgalParamNBegin{vertex_gaussian_curvature}
+*   \cgalParamNBegin{vertex_Gaussian_curvature}
 *     \cgalParamDescription{a reference to a scalar value to store the gaussian curvature at the vertex `v`}
 *     \cgalParamType{`std::reference_wrapper<GT::FT>`}
 *     \cgalParamExtra{If this parameter is omitted, gaussian curvature will not be computed}
@@ -1400,7 +1400,7 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 *
 * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
 * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
-* @see `CGAL::Polygon_mesh_processing::interpolated_corrected_gaussian_curvature_one_vertex()`
+* @see `CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature_one_vertex()`
 * @see `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
 */
 template<typename PolygonMesh,
@@ -1468,7 +1468,7 @@ void interpolated_corrected_curvatures_one_vertex(const PolygonMesh& pmesh,
 * @return the interpolated corrected mean curvature at the vertex `v`
 *
 * @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_gaussian_curvature_one_vertex()`
+* @see `interpolated_corrected_Gaussian_curvature_one_vertex()`
 * @see `interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
 * @see `interpolated_corrected_curvatures_one_vertex()`
 */
@@ -1544,7 +1544,7 @@ interpolated_corrected_mean_curvature_one_vertex(const PolygonMesh& pmesh,
 *
 * @return the interpolated corrected Gaussian curvature at the vertex `v`
 *
-* @see `interpolated_corrected_gaussian_curvature()`
+* @see `interpolated_corrected_Gaussian_curvature()`
 * @see `interpolated_corrected_mean_curvature_one_vertex()`
 * @see `interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
 * @see `interpolated_corrected_curvatures_one_vertex()`
@@ -1557,12 +1557,12 @@ typename GT::FT
 #else
 typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
 #endif
-interpolated_corrected_gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
+interpolated_corrected_Gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
                                                      typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
                                                      const NamedParameters& np = parameters::default_values())
 {
   typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT gc;
-  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_gaussian_curvature(std::ref(gc)));
+  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_Gaussian_curvature(std::ref(gc)));
   return gc;
 }
 
@@ -1622,7 +1622,7 @@ interpolated_corrected_gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
 *
 * @see `interpolated_corrected_principal_curvatures_and_directions()`
 * @see `interpolated_corrected_mean_curvature_one_vertex()`
-* @see `interpolated_corrected_gaussian_curvature_one_vertex()`
+* @see `interpolated_corrected_Gaussian_curvature_one_vertex()`
 * @see `interpolated_corrected_curvatures_one_vertex()`
 */
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index bd0594652206..c0772ce989bc 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -78,7 +78,7 @@ void test_average_curvatures(std::string mesh_path,
   // test_info.expansion_radius -> test if no radius is provided by user.
   if (test_info.expansion_radius < 0) {
     PMP::interpolated_corrected_mean_curvature(pmesh, mean_curvature_map);
-    PMP::interpolated_corrected_gaussian_curvature(pmesh, gaussian_curvature_map);
+    PMP::interpolated_corrected_Gaussian_curvature(pmesh, gaussian_curvature_map);
     PMP::interpolated_corrected_principal_curvatures_and_directions(pmesh, principal_curvatures_and_directions_map);
   }
   else {
@@ -88,7 +88,7 @@ void test_average_curvatures(std::string mesh_path,
       CGAL::parameters::ball_radius(test_info.expansion_radius)
     );
 
-    PMP::interpolated_corrected_gaussian_curvature(
+    PMP::interpolated_corrected_Gaussian_curvature(
       pmesh,
       gaussian_curvature_map,
       CGAL::parameters::ball_radius(test_info.expansion_radius)
@@ -125,28 +125,28 @@ void test_average_curvatures(std::string mesh_path,
     pmesh,
     CGAL::parameters::ball_radius(test_info.expansion_radius)
     .vertex_mean_curvature_map(mean_curvature_map)
-    .vertex_gaussian_curvature_map(gaussian_curvature_map)
+    .vertex_Gaussian_curvature_map(gaussian_curvature_map)
     .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map)
   );
 
-  Epic_kernel::FT new_mean_curvature_avg = 0, new_gaussian_curvature_avg = 0, new_principal_curvature_avg = 0;
+  Epic_kernel::FT new_mean_curvature_avg = 0, new_Gaussian_curvature_avg = 0, new_principal_curvature_avg = 0;
 
   for (vertex_descriptor v : vertices(pmesh))
   {
     new_mean_curvature_avg += get(mean_curvature_map, v);
-    new_gaussian_curvature_avg += get(gaussian_curvature_map, v);
+    new_Gaussian_curvature_avg += get(gaussian_curvature_map, v);
     new_principal_curvature_avg += get(principal_curvatures_and_directions_map, v).min_curvature
       + get(principal_curvatures_and_directions_map, v).max_curvature;
   }
 
   new_mean_curvature_avg /= vertices(pmesh).size();
-  new_gaussian_curvature_avg /= vertices(pmesh).size();
+  new_Gaussian_curvature_avg /= vertices(pmesh).size();
   new_principal_curvature_avg /= vertices(pmesh).size() * 2;
 
   // are average curvatures computed from interpolated_corrected_curvatures()
   // equal to average curvatures each computed on its own?
   assert(passes_comparison(mean_curvature_avg, new_mean_curvature_avg, 0.99));
-  assert(passes_comparison(gaussian_curvature_avg, new_gaussian_curvature_avg, 0.99));
+  assert(passes_comparison(gaussian_curvature_avg, new_Gaussian_curvature_avg, 0.99));
   assert(passes_comparison(principal_curvature_avg, new_principal_curvature_avg, 0.99));
 
   if (compare_single_vertex)
@@ -154,7 +154,7 @@ void test_average_curvatures(std::string mesh_path,
     // computing curvatures together from interpolated_corrected_curvatures()
 
     Epic_kernel::FT single_vertex_mean_curvature_avg = 0,
-      single_vertex_gaussian_curvature_avg = 0,
+      single_vertex_Gaussian_curvature_avg = 0,
       single_vertex_principal_curvature_avg = 0;
 
     Epic_kernel::FT h, g;
@@ -165,23 +165,23 @@ void test_average_curvatures(std::string mesh_path,
       PMP::interpolated_corrected_curvatures_one_vertex(
         pmesh,
         v,
-        CGAL::parameters::vertex_gaussian_curvature(std::ref(g))
+        CGAL::parameters::vertex_Gaussian_curvature(std::ref(g))
         .vertex_mean_curvature(std::ref(h))
         .vertex_principal_curvatures_and_directions(std::ref(p))
         .ball_radius(test_info.expansion_radius)
       );
 
       single_vertex_mean_curvature_avg += h;
-      single_vertex_gaussian_curvature_avg += g;
+      single_vertex_Gaussian_curvature_avg += g;
       single_vertex_principal_curvature_avg += p.min_curvature + p.max_curvature;
     }
 
     single_vertex_mean_curvature_avg /= vertices(pmesh).size();
-    single_vertex_gaussian_curvature_avg /= vertices(pmesh).size();
+    single_vertex_Gaussian_curvature_avg /= vertices(pmesh).size();
     single_vertex_principal_curvature_avg /= vertices(pmesh).size() * 2;
 
     assert(passes_comparison(mean_curvature_avg, single_vertex_mean_curvature_avg, 0.99));
-    assert(passes_comparison(gaussian_curvature_avg, single_vertex_gaussian_curvature_avg, 0.99));
+    assert(passes_comparison(gaussian_curvature_avg, single_vertex_Gaussian_curvature_avg, 0.99));
     assert(passes_comparison(principal_curvature_avg, single_vertex_principal_curvature_avg, 0.99));
   }
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index c4c7d6a3c916..050487c9fec2 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -662,7 +662,7 @@ private Q_SLOTS:
       if (does_exist)
           sm_item->face_graph()->remove_property_map(pmap);
       std::tie(pmap, does_exist) =
-        sm_item->face_graph()->property_map<face_descriptor, double>("v:interpolated_corrected_gaussian_curvature");
+        sm_item->face_graph()->property_map<face_descriptor, double>("v:interpolated_corrected_Gaussian_curvature");
       if (does_exist)
         sm_item->face_graph()->remove_property_map(pmap);
     });
@@ -748,7 +748,7 @@ private Q_SLOTS:
       smesh.remove_property_map(mean_curvature);
     }
     SMesh::Property_map<vertex_descriptor, double> gaussian_curvature;
-    std::tie(gaussian_curvature, found) = smesh.property_map<vertex_descriptor, double>("v:interpolated_corrected_gaussian_curvature");
+    std::tie(gaussian_curvature, found) = smesh.property_map<vertex_descriptor, double>("v:interpolated_corrected_Gaussian_curvature");
     if (found)
     {
       smesh.remove_property_map(gaussian_curvature);
@@ -851,7 +851,7 @@ private Q_SLOTS:
     if (mu_index != MEAN_CURVATURE && mu_index != GAUSSIAN_CURVATURE) return;
 
     std::string tied_string = (mu_index == MEAN_CURVATURE)?
-        "v:interpolated_corrected_mean_curvature": "v:interpolated_corrected_gaussian_curvature";
+        "v:interpolated_corrected_mean_curvature": "v:interpolated_corrected_Gaussian_curvature";
     SMesh& smesh = *item->face_graph();
 
     const auto vnm = smesh.property_map<vertex_descriptor, EPICK::Vector_3>("v:normal_before_perturbation").first;
@@ -868,13 +868,13 @@ private Q_SLOTS:
         if (mu_index == MEAN_CURVATURE)
           PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
         else
-          PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
+          PMP::interpolated_corrected_Gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
       }
       else {
         if (mu_index == MEAN_CURVATURE)
           PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
         else
-          PMP::interpolated_corrected_gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
+          PMP::interpolated_corrected_Gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
       }
       double res_min = ARBITRARY_DBL_MAX,
              res_max = -ARBITRARY_DBL_MAX;
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index 4990dca1ba15..30272955bb00 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -91,10 +91,10 @@ CGAL_add_named_parameter(number_of_points_on_edges_t, number_of_points_on_edges,
 CGAL_add_named_parameter(nb_points_per_area_unit_t, nb_points_per_area_unit, number_of_points_per_area_unit)
 CGAL_add_named_parameter(nb_points_per_distance_unit_t, nb_points_per_distance_unit, number_of_points_per_distance_unit)
 CGAL_add_named_parameter(vertex_mean_curvature_map_t, vertex_mean_curvature_map, vertex_mean_curvature_map)
-CGAL_add_named_parameter(vertex_gaussian_curvature_map_t, vertex_gaussian_curvature_map, vertex_gaussian_curvature_map)
+CGAL_add_named_parameter(vertex_Gaussian_curvature_map_t, vertex_Gaussian_curvature_map, vertex_Gaussian_curvature_map)
 CGAL_add_named_parameter(vertex_principal_curvatures_and_directions_map_t, vertex_principal_curvatures_and_directions_map, vertex_principal_curvatures_and_directions_map)
 CGAL_add_named_parameter(vertex_mean_curvature_t, vertex_mean_curvature, vertex_mean_curvature)
-CGAL_add_named_parameter(vertex_gaussian_curvature_t, vertex_gaussian_curvature, vertex_gaussian_curvature)
+CGAL_add_named_parameter(vertex_Gaussian_curvature_t, vertex_Gaussian_curvature, vertex_Gaussian_curvature)
 CGAL_add_named_parameter(vertex_principal_curvatures_and_directions_t, vertex_principal_curvatures_and_directions, vertex_principal_curvatures_and_directions)
 CGAL_add_named_parameter(ball_radius_t, ball_radius, ball_radius)
 CGAL_add_named_parameter(outward_orientation_t, outward_orientation, outward_orientation)

From 556218bf153dcfd7b82861445e0a77e135753c0f Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 25 Mar 2023 11:57:22 +0200
Subject: [PATCH 0137/1398] gaussian -> Gaussian in docs and comments

---
 .../Polygon_mesh_processing.txt                    |  4 ++--
 .../interpolated_corrected_curvatures_vertex.cpp   |  2 +-
 .../interpolated_corrected_curvatures.h            | 14 +++++++-------
 3 files changed, 10 insertions(+), 10 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 65c236e99fc3..e2bee6e295d8 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -890,7 +890,7 @@ not provide storage for the normals.
 \section PMPICC Computing Curvatures
 
 This package provides methods to compute curvatures on polygonal meshes based on Interpolated Corrected Curvatures
-on Polyhedral Surfaces \cgalCite{lachaud2020}. This includes mean curvature, gaussian curvature,
+on Polyhedral Surfaces \cgalCite{lachaud2020}. This includes mean curvature, Gaussian curvature,
 principal curvatures and directions. These can be computed on triangle meshes, quad meshes,
 and meshes with n-gon faces. The algorithms used prove to work well in general. Also, on meshes
 with noise on vertex positions, they give accurate results, on the condition that the
@@ -905,7 +905,7 @@ These computations are performed using (on all vertices of mesh):
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
 
-Where it is recommended to use the last function for computing multiple curvatures (example: mean and gaussian)
+Where it is recommended to use the last function for computing multiple curvatures (example: mean and Gaussian)
 as the implementation performs the shared computations only once, making it more efficient.
 
 Similarly, we can use the following functions to compute curvatures on a specific vertex:
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
index c0722b25675a..c6bef5faa740 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
@@ -43,7 +43,7 @@ int main(int argc, char* argv[])
     // The following commented lines show this (all mentioned named parameters work on it as well)
     // we specify which curvatures we want to compute by passing pointers as named parameters
     // as shown. These pointers are used for storing the result as well. in this example we
-    // selected mean and gaussian curvatures
+    // selected mean and Gaussian curvatures
     // PMP::interpolated_corrected_curvatures_one_vertex(
     //   smesh,
     //   v,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index bffd2657e96c..2324b0e9e88c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -1024,7 +1024,7 @@ class Interpolated_corrected_curvatures_computer
 * \ingroup PMP_corrected_curvatures_grp
 *
 * computes the interpolated corrected curvatures across the mesh `pmesh`.
-* By providing mean, gaussian and/or principal curvature and direction property maps as named parameters, the user
+* By providing mean, Gaussian and/or principal curvature and direction property maps as named parameters, the user
 * can choose which quantites to compute.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
@@ -1076,7 +1076,7 @@ class Interpolated_corrected_curvatures_computer
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `GT::FT` as value type}
-*     \cgalParamExtra{If this parameter is omitted, gaussian curvatures will not be computed}
+*     \cgalParamExtra{If this parameter is omitted, Gaussian curvatures will not be computed}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_principal_curvatures_and_directions_map}
@@ -1186,7 +1186,7 @@ void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected gaussian curvature across the mesh `pmesh`.
+* computes the interpolated corrected Gaussian curvature across the mesh `pmesh`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap a model of `WritablePropertyMap` with
@@ -1194,7 +1194,7 @@ void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
-* @param vcm the vertex property map in which the computed gaussian curvatures are stored.
+* @param vcm the vertex property map in which the computed Gaussian curvatures are stored.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
 *        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *
@@ -1328,7 +1328,7 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 /**
 * \ingroup PMP_corrected_curvatures_grp
 * computes the interpolated corrected curvatures at a vertex `v`.
-* By providing mean, gaussian and/or principal curvature and direction property maps as named parameters, the user
+* By providing mean, Gaussian and/or principal curvature and direction property maps as named parameters, the user
 * can choose which quantites to compute.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`
@@ -1374,9 +1374,9 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_Gaussian_curvature}
-*     \cgalParamDescription{a reference to a scalar value to store the gaussian curvature at the vertex `v`}
+*     \cgalParamDescription{a reference to a scalar value to store the Gaussian curvature at the vertex `v`}
 *     \cgalParamType{`std::reference_wrapper<GT::FT>`}
-*     \cgalParamExtra{If this parameter is omitted, gaussian curvature will not be computed}
+*     \cgalParamExtra{If this parameter is omitted, Gaussian curvature will not be computed}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_principal_curvatures_and_directions}

From 2bc8b1b49565f9f033c40d30dd08d1f6192d99f5 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 25 Mar 2023 13:29:15 +0200
Subject: [PATCH 0138/1398] user man doc improvements

---
 .../Polygon_mesh_processing.txt               | 22 ++++++++-----------
 1 file changed, 9 insertions(+), 13 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index e2bee6e295d8..49614be67c91 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -896,10 +896,10 @@ and meshes with n-gon faces. The algorithms used prove to work well in general.
 with noise on vertex positions, they give accurate results, on the condition that the
 correct vertex normals are provided.
 
-The implementation is generic in terms of mesh data structure. It can be used on Surface_mesh,
-Polyhedron_3 and other polygonal mesh structures based on the Face Graph Model.
+The implementation is generic in terms of mesh data structure. It can be used on `Surface_mesh`,
+`Polyhedron_3` and other polygonal mesh structures based on the concept `FaceGraph`.
 
-These computations are performed using (on all vertices of mesh):
+These computations are performed using (on all vertices of the mesh):
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
@@ -916,29 +916,25 @@ Similarly, we can use the following functions to compute curvatures on a specifi
 
 
 \cgalFigureRef{icc_diff_radius} shows how the mean curvature changes depending on
-the ball_radius named parameter which can be set to a value > 0 to get a smoother
-distribution of values and "diffuse" the extreme values of curvatures across the mesh.
+the named parameter `ball_radius`, which can be set to a value > 0 to get a smoother
+distribution of values and "diffuses" the extreme values of curvatures across the mesh.
 
 \cgalFigureAnchor{icc_diff_radius}
 <center>
-<img src="icc_diff_radius.png" style="max-width:90%;"/>
+<img src="icc_diff_radius.png" style="max-width:85%;"/>
 </center>
 \cgalFigureCaptionBegin{icc_diff_radius}
-The mean curvature distribution on a bear mesh with different values for the expanding ball radius
+The mean curvature distribution on a bear mesh with different values for the ball radius parameter
 \cgalFigureCaptionEnd
 
-Property maps are used to record the computed curvatures as shown in examples.
-
-
-Property maps are an API introduced in the boost library that allows associating
-values to keys. In the following examples, for each property map, we associate
+\ref BGLPropertyMaps are used to record the computed curvatures as shown in examples. In the following examples, for each property map, we associate
 a curvature value to each vertex.
 
 \subsection ICCExampleSM Interpolated Corrected Curvatures on a Surface Mesh Example
 
 The following example illustrates how to
 compute the curvatures on vertices
-and store them in property maps provided by the class `Surface_mesh`.
+and store them in the property maps provided by the class `Surface_mesh`.
 
 \cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp}
 

From 49c12d9265f2b0c02fd816f82d82f5e9141c4504 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 25 Mar 2023 13:44:36 +0200
Subject: [PATCH 0139/1398] ref doc fixes

---
 .../interpolated_corrected_curvatures.h                | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 2324b0e9e88c..71a2ceaaa911 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -1072,7 +1072,7 @@ class Interpolated_corrected_curvatures_computer
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_Gaussian_curvature_map}
-*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating Gaussian curvatures to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `GT::FT` as value type}
@@ -1080,11 +1080,11 @@ class Interpolated_corrected_curvatures_computer
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_principal_curvatures_and_directions_map}
-*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating principal curvatures and directions to the vertices of `pmesh`}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `Principal_curvatures_and_directions<GT>` as value type}
-*     \cgalParamExtra{If this parameter is omitted, mean principal will not be computed}
+*     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions will not be computed}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{ball_radius}
@@ -1256,7 +1256,7 @@ void interpolated_corrected_Gaussian_curvature(const PolygonMesh& pmesh,
 /**
 * \ingroup PMP_corrected_curvatures_grp
 *
-* computes the interpolated corrected principal curvatures across the mesh `pmesh`.
+* computes the interpolated corrected principal curvatures and directions across the mesh `pmesh`.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap a model of `WritablePropertyMap` with
@@ -1265,7 +1265,7 @@ void interpolated_corrected_Gaussian_curvature(const PolygonMesh& pmesh,
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
-* @param vcm the vertex property map in which the computed principal curvatures are stored.
+* @param vcm the vertex property map in which the computed principal curvatures and directions are stored.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *

From 057b6fc2dd5011052b1049bbbfbc3728c3b875e8 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 27 Mar 2023 17:20:26 +0200
Subject: [PATCH 0140/1398] gaussian -> Gaussian in example files

---
 .../interpolated_corrected_curvatures_PH.cpp              | 6 +++---
 .../interpolated_corrected_curvatures_SM.cpp              | 8 ++++----
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
index 0e3923dc67b8..ecf40b840829 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
@@ -30,7 +30,7 @@ int main(int argc, char* argv[])
 
   boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
     mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron),
-    gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
+    Gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
   boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
     principal_curvatures_and_directions_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), polyhedron);
 
@@ -40,7 +40,7 @@ int main(int argc, char* argv[])
 
   PMP::interpolated_corrected_Gaussian_curvature(
     polyhedron,
-    gaussian_curvature_map);
+    Gaussian_curvature_map);
 
   PMP::interpolated_corrected_principal_curvatures_and_directions(
     polyhedron,
@@ -69,7 +69,7 @@ int main(int argc, char* argv[])
   {
     auto PC = get(principal_curvatures_and_directions_map, v);
     std::cout << i << ": HC = " << get(mean_curvature_map, v)
-      << ", GC = " << get(gaussian_curvature_map, v) << "\n"
+      << ", GC = " << get(Gaussian_curvature_map, v) << "\n"
       << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
     i++;
   }
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
index 811146dd6412..ab985e5068d0 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
@@ -29,11 +29,11 @@ int main(int argc, char* argv[])
 
   // creating and tying surface mesh property maps for curvatures (with defaults = 0)
   bool created = false;
-  Surface_Mesh::Property_map<vertex_descriptor, Epic_kernel::FT> mean_curvature_map, gaussian_curvature_map;
+  Surface_Mesh::Property_map<vertex_descriptor, Epic_kernel::FT> mean_curvature_map, Gaussian_curvature_map;
   boost::tie(mean_curvature_map, created) = smesh.add_property_map<vertex_descriptor, Epic_kernel::FT>("v:mean_curvature_map", 0);
   assert(created);
 
-  boost::tie(gaussian_curvature_map, created) = smesh.add_property_map<vertex_descriptor, Epic_kernel::FT>("v:gaussian_curvature_map", 0);
+  boost::tie(Gaussian_curvature_map, created) = smesh.add_property_map<vertex_descriptor, Epic_kernel::FT>("v:Gaussian_curvature_map", 0);
   assert(created);
 
   // we use a tuple of 2 scalar values and 2 vectors for principal curvatures and directions
@@ -55,7 +55,7 @@ int main(int argc, char* argv[])
 
   PMP::interpolated_corrected_Gaussian_curvature(
     smesh,
-    gaussian_curvature_map
+    Gaussian_curvature_map
   );
 
   PMP::interpolated_corrected_principal_curvatures_and_directions(
@@ -91,7 +91,7 @@ int main(int argc, char* argv[])
   {
     auto PC = principal_curvatures_and_directions_map[v];
     std::cout << v.idx() << ": HC = " << mean_curvature_map[v]
-      << ", GC = " << gaussian_curvature_map[v] << "\n"
+      << ", GC = " << Gaussian_curvature_map[v] << "\n"
       << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
   }
 }

From 5aa995dbe7a24727d22bcbee6d3d2170b0d3274b Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 27 Mar 2023 17:45:16 +0200
Subject: [PATCH 0141/1398] missing dots in ref documentation

---
 .../interpolated_corrected_curvatures.h       | 250 +++++++++---------
 1 file changed, 125 insertions(+), 125 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 71a2ceaaa911..a22761691b18 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -1037,54 +1037,54 @@ class Interpolated_corrected_curvatures_computer
 * \cgalNamedParamsBegin
 *
 *   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*                    as key type and `GT::Point_3` as value type.}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*                    as key type and `GT::Vector_3` as value type.}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`}
+*                     computed using `compute_vertex_normals()`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamDescription{an instance of a geometric traits class.}
 *     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
 *     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_mean_curvature_map}
-*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *                    as key type and `GT::FT` as value type}
-*     \cgalParamExtra{If this parameter is omitted, mean curvatures will not be computed}
+*     \cgalParamExtra{If this parameter is omitted, mean curvatures will not be computed.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_Gaussian_curvature_map}
-*     \cgalParamDescription{a property map associating Gaussian curvatures to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating Gaussian curvatures to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::FT` as value type}
-*     \cgalParamExtra{If this parameter is omitted, Gaussian curvatures will not be computed}
+*                    as key type and `GT::FT` as value type.}
+*     \cgalParamExtra{If this parameter is omitted, Gaussian curvatures will not be computed.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_principal_curvatures_and_directions_map}
-*     \cgalParamDescription{a property map associating principal curvatures and directions to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating principal curvatures and directions to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `Principal_curvatures_and_directions<GT>` as value type}
-*     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions will not be computed}
+*                    as key type and `Principal_curvatures_and_directions<GT>` as value type.}
+*     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions will not be computed.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{ball_radius}
@@ -1095,7 +1095,7 @@ class Interpolated_corrected_curvatures_computer
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
 *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion is then just a sum of
-*                     measures on faces around the vertex}
+*                     measures on faces around the vertex.}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
@@ -1130,29 +1130,29 @@ void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
 * \cgalNamedParamsBegin
 *
 *   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*                    as key type and `GT::Point_3` as value type.}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*                    as key type and `GT::Vector_3` as value type.}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`}
+*                     computed using `compute_vertex_normals()`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamDescription{an instance of a geometric traits class.}
 *     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
 *     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
@@ -1160,11 +1160,11 @@ void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
 *                           by summing measures of faces inside a ball of this radius centered at the
 *                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball}
+*                           inclusion ratio inside this ball.}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
 *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex}
+*                     measures on faces around the vertex.}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
@@ -1201,29 +1201,29 @@ void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
 * \cgalNamedParamsBegin
 *
 *   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*                    as key type and `%Point_3` as value type.}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `GT::ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*                    as key type and `%Vector_3` as value type.}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`}
+*                     computed using `compute_vertex_normals()`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamDescription{an instance of a geometric traits class.}
 *     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
 *     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
@@ -1231,11 +1231,11 @@ void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
 *                           by summing measures of faces inside a ball of this radius centered at the
 *                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball}
+*                           inclusion ratio inside this ball.}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
 *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex}
+*                     measures on faces around the vertex.}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
@@ -1272,29 +1272,29 @@ void interpolated_corrected_Gaussian_curvature(const PolygonMesh& pmesh,
 * \cgalNamedParamsBegin
 *
 *   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*                    as key type and `GT::Point_3` as value type.}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*                    as key type and `GT::Vector_3` as value type.}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`}
+*                     computed using `compute_vertex_normals()`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamDescription{an instance of a geometric traits class.}
 *     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
 *     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
@@ -1302,11 +1302,11 @@ void interpolated_corrected_Gaussian_curvature(const PolygonMesh& pmesh,
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
 *                           by summing measures of faces inside a ball of this radius centered at the
 *                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball}
+*                           inclusion ratio inside this ball.}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
 *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex}
+*                     measures on faces around the vertex.}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
@@ -1331,58 +1331,58 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 * By providing mean, Gaussian and/or principal curvature and direction property maps as named parameters, the user
 * can choose which quantites to compute.
 *
-* @tparam PolygonMesh a model of `FaceListGraph`
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+* @tparam PolygonMesh a model of `FaceListGraph`.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
-* @param pmesh the polygon mesh
-* @param v the vertex of `pmesh` to compute the curvatures at
+* @param pmesh the polygon mesh.
+* @param v the vertex of `pmesh` to compute the curvatures at.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *
 * \cgalNamedParamsBegin
 *   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*                    as key type and `GT::Point_3` as value type.}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*                    as key type and `GT::Vector_3` as value type.}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`}
+*                     computed using `compute_vertex_normals()`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamDescription{an instance of a geometric traits class.}
 *     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
 *     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_mean_curvature}
-*     \cgalParamDescription{a reference to a scalar value to store the mean curvature at the vertex `v`}
-*     \cgalParamType{`std::reference_wrapper<GT::FT>`}
-*     \cgalParamExtra{If this parameter is omitted, mean curvature will not be computed}
+*     \cgalParamDescription{a reference to a scalar value to store the mean curvature at the vertex `v`.}
+*     \cgalParamType{`std::reference_wrapper<GT::FT>`.}
+*     \cgalParamExtra{If this parameter is omitted, mean curvature will not be computed.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_Gaussian_curvature}
-*     \cgalParamDescription{a reference to a scalar value to store the Gaussian curvature at the vertex `v`}
-*     \cgalParamType{`std::reference_wrapper<GT::FT>`}
-*     \cgalParamExtra{If this parameter is omitted, Gaussian curvature will not be computed}
+*     \cgalParamDescription{a reference to a scalar value to store the Gaussian curvature at the vertex `v`.}
+*     \cgalParamType{`std::reference_wrapper<GT::FT>`.}
+*     \cgalParamExtra{If this parameter is omitted, Gaussian curvature will not be computed.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_principal_curvatures_and_directions}
-*     \cgalParamDescription{a reference to an`Principal_curvatures_and_directions<GT>` object to store the principal curvatures and directions at the vertex `v`}
-*     \cgalParamType{`std::reference_wrapper<Principal_curvatures_and_directions<GT>>`}
-*     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions will not be computed}
+*     \cgalParamDescription{a reference to an`Principal_curvatures_and_directions<GT>` object to store the principal curvatures and directions at the vertex `v`.}
+*     \cgalParamType{`std::reference_wrapper<Principal_curvatures_and_directions<GT>>`.}
+*     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions will not be computed.}
 *  \cgalParamNEnd
 *
 *   \cgalParamNBegin{ball_radius}
@@ -1393,7 +1393,7 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
 *     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
-*                     measures on faces around the vertex}
+*                     measures on faces around the vertex.}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
@@ -1416,39 +1416,39 @@ void interpolated_corrected_curvatures_one_vertex(const PolygonMesh& pmesh,
 * \ingroup PMP_corrected_curvatures_grp
 * computes the interpolated corrected mean curvature at vertex `v` of mesh `pmesh`.
 *
-* @tparam PolygonMesh a model of `FaceListGraph`
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+* @tparam PolygonMesh a model of `FaceListGraph`.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
-* @param pmesh the polygon mesh
-* @param v the vertex of `pmesh` to compute the mean curvature at
+* @param pmesh the polygon mesh.
+* @param v the vertex of `pmesh` to compute the mean curvature at.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *
 * \cgalNamedParamsBegin
 *   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*                    as key type and `GT::Point_3` as value type.}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*                    as key type and `GT::Vector_3` as value type.}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`}
+*                     computed using `compute_vertex_normals()`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class}
-*     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamDescription{an instance of a geometric traits class.}
+*     \cgalParamType{a class model of `Kernel`.}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
 *     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
@@ -1456,16 +1456,16 @@ void interpolated_corrected_curvatures_one_vertex(const PolygonMesh& pmesh,
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
 *                           by summing measures of faces inside a ball of this radius centered at the
 *                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball}
+*                           inclusion ratio inside this ball.}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
 *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex}
+*                     measures on faces around the vertex.}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
 *
-* @return the interpolated corrected mean curvature at the vertex `v`
+* @return the interpolated corrected mean curvature at the vertex `v`.
 *
 * @see `interpolated_corrected_mean_curvature()`
 * @see `interpolated_corrected_Gaussian_curvature_one_vertex()`
@@ -1493,39 +1493,39 @@ interpolated_corrected_mean_curvature_one_vertex(const PolygonMesh& pmesh,
 * \ingroup PMP_corrected_curvatures_grp
 * computes the interpolated corrected Gaussian curvature at vertex `v` of mesh `pmesh`.
 *
-* @tparam PolygonMesh a model of `FaceListGraph`
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+* @tparam PolygonMesh a model of `FaceListGraph`.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
-* @param pmesh the polygon mesh
-* @param v the vertex of `pmesh` to compute the Gaussian curvature at
+* @param pmesh the polygon mesh.
+* @param v the vertex of `pmesh` to compute the Gaussian curvature at.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *
 * \cgalNamedParamsBegin
 *   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*                    as key type and `GT::Point_3` as value type.}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*                    as key type and `GT::Vector_3` as value type.}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`}
+*                     computed using `compute_vertex_normals()`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class}
-*     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamDescription{an instance of a geometric traits class.}
+*     \cgalParamType{a class model of `Kernel`.}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
 *     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
@@ -1533,16 +1533,16 @@ interpolated_corrected_mean_curvature_one_vertex(const PolygonMesh& pmesh,
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
 *                           by summing measures of faces inside a ball of this radius centered at the
 *                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball}
+*                           inclusion ratio inside this ball.}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
 *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex}
+*                     measures on faces around the vertex.}
 *   \cgalParamNEnd
 *
 * \cgalNamedParamsEnd
 *
-* @return the interpolated corrected Gaussian curvature at the vertex `v`
+* @return the interpolated corrected Gaussian curvature at the vertex `v`.
 *
 * @see `interpolated_corrected_Gaussian_curvature()`
 * @see `interpolated_corrected_mean_curvature_one_vertex()`
@@ -1570,39 +1570,39 @@ interpolated_corrected_Gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
 * \ingroup PMP_corrected_curvatures_grp
 * computes the interpolated corrected principal curvatures and directions at vertex `v` of mesh `pmesh`.
 *
-* @tparam PolygonMesh a model of `FaceListGraph`
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+* @tparam PolygonMesh a model of `FaceListGraph`.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
-* @param pmesh the polygon mesh
-* @param v the vertex of `pmesh` to compute the principal curvatures and directions at
+* @param pmesh the polygon mesh.
+* @param v the vertex of `pmesh` to compute the principal curvatures and directions at.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *
 * \cgalNamedParamsBegin
 *   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+*                    as key type and `%Point_3` as value type.}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, an internal property map for
 *                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`}
+*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
 *                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Vector_3` as value type}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`}
+*                    as key type and `%Vector_3` as value type.}
+*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
 *     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`}
+*                     computed using `compute_vertex_normals()`.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class}
-*     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamDescription{an instance of a geometric traits class.}
+*     \cgalParamType{a class model of `Kernel`.}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
 *     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
@@ -1610,15 +1610,15 @@ interpolated_corrected_Gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
 *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
 *                           by summing measures of faces inside a ball of this radius centered at the
 *                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball}
+*                           inclusion ratio inside this ball.}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
 *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex}
+*                     measures on faces around the vertex.}
 *   \cgalParamNEnd
 * \cgalNamedParamsEnd
 *
-* @return the interpolated corrected principal curvatures and directions at the vertex `v`
+* @return the interpolated corrected principal curvatures and directions at the vertex `v`.
 *
 * @see `interpolated_corrected_principal_curvatures_and_directions()`
 * @see `interpolated_corrected_mean_curvature_one_vertex()`

From 2884d8b3cbdd14341d63142d4e96949e3a06be97 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 27 Mar 2023 18:06:06 +0200
Subject: [PATCH 0142/1398] using is_zero() & is_negative() for FT variables

---
 .../interpolated_corrected_curvatures.h       | 24 +++++++++----------
 1 file changed, 12 insertions(+), 12 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index a22761691b18..72f7b1b93d07 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -470,8 +470,8 @@ Principal_curvatures_and_directions<GT> principal_curvatures_and_directions_from
 
   // returning principal curvatures and directions (with the correct sign)
   return Principal_curvatures_and_directions<GT>(
-    (v_mu0 != 0.0) ? -eig_vals[1] / v_mu0 : 0.0,
-    (v_mu0 != 0.0) ? -eig_vals[0] / v_mu0 : 0.0,
+    (!is_zero(v_mu0)) ? -eig_vals[1] / v_mu0 : 0.0,
+    (!is_zero(v_mu0)) ? -eig_vals[0] / v_mu0 : 0.0,
     min_eig_vec,
     max_eig_vec
     );
@@ -591,7 +591,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
 
     // if it is not 0 (not completely outside), compute measures for selected curvatures (area is always computed)
     // and add neighboring faces to the bfs queue
-    if (f_ratio != 0.0)
+    if (!is_zero(f_ratio))
     {
       vertex_measures.area_measure += f_ratio * interpolated_corrected_area_measure_face<GT>(u, x);
 
@@ -669,7 +669,7 @@ template<typename PolygonMesh,
   // if no radius is given, we pass -1 which will make the expansion be only on the incident faces instead of a ball
   typename GT::FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
   // if the radius is 0, we use a small epsilon to expand the ball (scaled with the average edge length)
-  if (radius == 0)
+  if (is_zero(radius))
     radius = average_edge_length<PolygonMesh, GT>(pmesh) * 1e-6;
 
   // determine which curvatures are selected
@@ -680,7 +680,7 @@ template<typename PolygonMesh,
   Vertex_measures<GT> vertex_measures;
 
   // if the radius is negative, we do not expand the ball (only the incident faces)
-  if (radius < 0)
+  if (is_negative(radius))
   {
     vertex_measures = interpolated_corrected_measures_one_vertex_no_radius<GT>(
       pmesh,
@@ -708,12 +708,12 @@ template<typename PolygonMesh,
 
   // compute the selected curvatures from expanded measures
   if (is_mean_curvature_selected) {
-    set_value(vertex_measures.area_measure != 0 ? 0.5 * vertex_measures.mean_curvature_measure / vertex_measures.area_measure : 0,
+    set_value(!is_zero(vertex_measures.area_measure) ? 0.5 * vertex_measures.mean_curvature_measure / vertex_measures.area_measure : 0,
               get_parameter(np, internal_np::vertex_mean_curvature));
   }
 
   if (is_Gaussian_curvature_selected) {
-    set_value(vertex_measures.area_measure != 0 ? vertex_measures.gaussian_curvature_measure / vertex_measures.area_measure : 0,
+    set_value(!is_zero(vertex_measures.area_measure) ? vertex_measures.gaussian_curvature_measure / vertex_measures.area_measure : 0,
               get_parameter(np, internal_np::vertex_Gaussian_curvature));
   }
 
@@ -827,7 +827,7 @@ class Interpolated_corrected_curvatures_computer
 
   void set_ball_radius(const FT radius) {
     // if given radius is 0, we use a small epsilon to expand the ball (scaled by the average edge length)
-    if (radius == 0)
+    if (is_zero(radius))
       ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * 1e-6;
     else
       ball_radius = radius;
@@ -950,7 +950,7 @@ class Interpolated_corrected_curvatures_computer
 
       // if the face is inside the ball, add the measures
       // only add the measures for the selected curvatures (area measure is always added)
-      if (f_ratio != 0.0)
+      if (!is_zero(f_ratio))
       {
         vertex_measures.area_measure += f_ratio * get(mu0_map, fi);
 
@@ -986,20 +986,20 @@ class Interpolated_corrected_curvatures_computer
     for (Vertex_descriptor v : vertices(pmesh))
     {
       // expand the computed measures (on faces) to the vertices
-      Vertex_measures<GT> vertex_measures = (ball_radius < 0) ?
+      Vertex_measures<GT> vertex_measures = (is_negative(ball_radius)) ?
         expand_interpolated_corrected_measure_vertex_no_radius(v) :
         expand_interpolated_corrected_measure_vertex(v);
 
       // compute the selected curvatures from the expanded measures and store them in the property maps
       // if the area measure is zero, the curvature is set to zero
       if (is_mean_curvature_selected) {
-        vertex_measures.area_measure != 0 ?
+        !is_zero(vertex_measures.area_measure) ?
           put(mean_curvature_map, v, 0.5 * vertex_measures.mean_curvature_measure / vertex_measures.area_measure) :
           put(mean_curvature_map, v, 0);
       }
 
       if (is_Gaussian_curvature_selected) {
-        vertex_measures.area_measure != 0 ?
+        !is_zero(vertex_measures.area_measure) ?
           put(gaussian_curvature_map, v, vertex_measures.gaussian_curvature_measure / vertex_measures.area_measure) :
           put(gaussian_curvature_map, v, 0);
       }

From 4279a734bfb71821609ee14ea5bf33bcc90831cf Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 27 Mar 2023 19:35:31 +0200
Subject: [PATCH 0143/1398] minor linting changing

---
 .../interpolated_corrected_curvatures_PH.cpp  | 16 ++++------
 .../interpolated_corrected_curvatures_SM.cpp  | 31 +++++++++----------
 2 files changed, 20 insertions(+), 27 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
index ecf40b840829..0aa0c196d3f5 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
@@ -31,20 +31,16 @@ int main(int argc, char* argv[])
   boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
     mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron),
     Gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
+
   boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
-    principal_curvatures_and_directions_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), polyhedron);
+    principal_curvatures_and_directions_map = 
+    get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), polyhedron);
 
-  PMP::interpolated_corrected_mean_curvature(
-    polyhedron,
-    mean_curvature_map);
+  PMP::interpolated_corrected_mean_curvature(polyhedron, mean_curvature_map);
 
-  PMP::interpolated_corrected_Gaussian_curvature(
-    polyhedron,
-    Gaussian_curvature_map);
+  PMP::interpolated_corrected_Gaussian_curvature(polyhedron, Gaussian_curvature_map);
 
-  PMP::interpolated_corrected_principal_curvatures_and_directions(
-    polyhedron,
-    principal_curvatures_and_directions_map);
+  PMP::interpolated_corrected_principal_curvatures_and_directions(polyhedron, principal_curvatures_and_directions_map);
 
   // uncomment this to compute a curvature while specifying named parameters
   // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
index ab985e5068d0..d75ab14f6984 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
@@ -29,17 +29,23 @@ int main(int argc, char* argv[])
 
   // creating and tying surface mesh property maps for curvatures (with defaults = 0)
   bool created = false;
-  Surface_Mesh::Property_map<vertex_descriptor, Epic_kernel::FT> mean_curvature_map, Gaussian_curvature_map;
-  boost::tie(mean_curvature_map, created) = smesh.add_property_map<vertex_descriptor, Epic_kernel::FT>("v:mean_curvature_map", 0);
+  Surface_Mesh::Property_map<vertex_descriptor, Epic_kernel::FT> 
+    mean_curvature_map, Gaussian_curvature_map;
+
+  boost::tie(mean_curvature_map, created) = 
+    smesh.add_property_map<vertex_descriptor, Epic_kernel::FT>("v:mean_curvature_map", 0);
   assert(created);
 
-  boost::tie(Gaussian_curvature_map, created) = smesh.add_property_map<vertex_descriptor, Epic_kernel::FT>("v:Gaussian_curvature_map", 0);
+  boost::tie(Gaussian_curvature_map, created) = 
+    smesh.add_property_map<vertex_descriptor, Epic_kernel::FT>("v:Gaussian_curvature_map", 0);
   assert(created);
 
   // we use a tuple of 2 scalar values and 2 vectors for principal curvatures and directions
-  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>> principal_curvatures_and_directions_map;
+  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>> 
+    principal_curvatures_and_directions_map;
 
-  boost::tie(principal_curvatures_and_directions_map, created) = smesh.add_property_map<vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>>
+  boost::tie(principal_curvatures_and_directions_map, created) = 
+    smesh.add_property_map<vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>>
     ("v:principal_curvatures_and_directions_map", { 0, 0,
         Epic_kernel::Vector_3(0,0,0),
         Epic_kernel::Vector_3(0,0,0) });
@@ -48,20 +54,11 @@ int main(int argc, char* argv[])
   // user can call these fucntions to compute a specfic curvature type on each vertex.
   // (Note: if no ball radius is specified, the measure expansion of each vertex happens by
   // summing measures on faces adjacent to each vertex.)
-  PMP::interpolated_corrected_mean_curvature(
-    smesh,
-    mean_curvature_map
-  );
+  PMP::interpolated_corrected_mean_curvature(smesh, mean_curvature_map);
 
-  PMP::interpolated_corrected_Gaussian_curvature(
-    smesh,
-    Gaussian_curvature_map
-  );
+  PMP::interpolated_corrected_Gaussian_curvature(smesh, Gaussian_curvature_map);
 
-  PMP::interpolated_corrected_principal_curvatures_and_directions(
-    smesh,
-    principal_curvatures_and_directions_map
-  );
+  PMP::interpolated_corrected_principal_curvatures_and_directions(smesh, principal_curvatures_and_directions_map);
 
   // uncomment this to compute a curvature while specifying named parameters
   // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)

From 33c7f5c03aabadea45c0ed1078d38df38455efa2 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 27 Mar 2023 19:37:31 +0200
Subject: [PATCH 0144/1398] traillling spaces

---
 .../interpolated_corrected_curvatures_PH.cpp           |  2 +-
 .../interpolated_corrected_curvatures_SM.cpp           | 10 +++++-----
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
index 0aa0c196d3f5..c93de26f26cc 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
@@ -33,7 +33,7 @@ int main(int argc, char* argv[])
     Gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
 
   boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
-    principal_curvatures_and_directions_map = 
+    principal_curvatures_and_directions_map =
     get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), polyhedron);
 
   PMP::interpolated_corrected_mean_curvature(polyhedron, mean_curvature_map);
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
index d75ab14f6984..dae2ec0716ec 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
@@ -29,22 +29,22 @@ int main(int argc, char* argv[])
 
   // creating and tying surface mesh property maps for curvatures (with defaults = 0)
   bool created = false;
-  Surface_Mesh::Property_map<vertex_descriptor, Epic_kernel::FT> 
+  Surface_Mesh::Property_map<vertex_descriptor, Epic_kernel::FT>
     mean_curvature_map, Gaussian_curvature_map;
 
-  boost::tie(mean_curvature_map, created) = 
+  boost::tie(mean_curvature_map, created) =
     smesh.add_property_map<vertex_descriptor, Epic_kernel::FT>("v:mean_curvature_map", 0);
   assert(created);
 
-  boost::tie(Gaussian_curvature_map, created) = 
+  boost::tie(Gaussian_curvature_map, created) =
     smesh.add_property_map<vertex_descriptor, Epic_kernel::FT>("v:Gaussian_curvature_map", 0);
   assert(created);
 
   // we use a tuple of 2 scalar values and 2 vectors for principal curvatures and directions
-  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>> 
+  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>>
     principal_curvatures_and_directions_map;
 
-  boost::tie(principal_curvatures_and_directions_map, created) = 
+  boost::tie(principal_curvatures_and_directions_map, created) =
     smesh.add_property_map<vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>>
     ("v:principal_curvatures_and_directions_map", { 0, 0,
         Epic_kernel::Vector_3(0,0,0),

From 796d7cc57d79a06454afac969a329d49a428f6b3 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 31 Mar 2023 01:55:26 +0200
Subject: [PATCH 0145/1398] handled scale dependency and add tests for it

---
 .../interpolated_corrected_curvatures.h       | 22 ++++--
 ...test_interpolated_corrected_curvatures.cpp | 68 ++++++++++++++-----
 2 files changed, 66 insertions(+), 24 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 72f7b1b93d07..4b940f157e88 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -436,7 +436,8 @@ template<typename GT>
 Principal_curvatures_and_directions<GT> principal_curvatures_and_directions_from_anisotropic_measures(
   const std::array<typename GT::FT, 3 * 3> anisotropic_measure,
   const typename GT::FT v_mu0,
-  const typename GT::Vector_3 u_GT
+  const typename GT::Vector_3 u_GT,
+  const typename GT::FT avg_edge_length
 )
 {
   // putting anisotropic measure in matrix form
@@ -448,7 +449,7 @@ Principal_curvatures_and_directions<GT> principal_curvatures_and_directions_from
 
   // constant factor K to force the principal direction eigenvectors to be tangential to the surface
   Eigen::Matrix<typename GT::FT, 3, 1> u(u_GT.x(), u_GT.y(), u_GT.z());
-  const typename GT::FT K = 1000 * v_mu0;
+  const typename GT::FT K = 1000 * avg_edge_length * v_mu0;
 
   // symmetrizing and adding the constant term
   v_muXY = 0.5 * (v_muXY + v_muXY.transpose()) + K * u * u.transpose();
@@ -668,9 +669,13 @@ template<typename PolygonMesh,
 
   // if no radius is given, we pass -1 which will make the expansion be only on the incident faces instead of a ball
   typename GT::FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
+
+  // calculate avg_edge_length as it is used in case radius is 0, and in the principal curvature computation later
+  typename GT::FT avg_edge_length = average_edge_length<PolygonMesh, GT>(pmesh);
+
   // if the radius is 0, we use a small epsilon to expand the ball (scaled with the average edge length)
   if (is_zero(radius))
-    radius = average_edge_length<PolygonMesh, GT>(pmesh) * 1e-6;
+    radius = avg_edge_length * 1e-6;
 
   // determine which curvatures are selected
   const bool is_mean_curvature_selected = !is_default_parameter<NamedParameters, internal_np::vertex_mean_curvature_t>::value;
@@ -723,7 +728,9 @@ template<typename PolygonMesh,
     const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
       vertex_measures.anisotropic_measure,
       vertex_measures.area_measure,
-      v_normal);
+      v_normal,
+      avg_edge_length
+      );
     set_value(principal_curvatures_and_directions, get_parameter(np, internal_np::vertex_principal_curvatures_and_directions));
   }
 }
@@ -775,6 +782,7 @@ class Interpolated_corrected_curvatures_computer
   Vertex_position_map vpm;
   Vertex_normal_map vnm;
   FT ball_radius;
+  FT avg_edge_length;
 
   bool is_mean_curvature_selected;
   bool is_Gaussian_curvature_selected;
@@ -813,6 +821,7 @@ class Interpolated_corrected_curvatures_computer
 
     // if no radius is given, we pass -1 which will make the expansion be only on the incident faces instead of a ball
     const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
+    avg_edge_length = average_edge_length<PolygonMesh, GT>(pmesh);
     set_ball_radius(radius);
 
     // check which curvature maps are provided by the user (determines which curvatures are computed)
@@ -828,7 +837,7 @@ class Interpolated_corrected_curvatures_computer
   void set_ball_radius(const FT radius) {
     // if given radius is 0, we use a small epsilon to expand the ball (scaled by the average edge length)
     if (is_zero(radius))
-      ball_radius = average_edge_length<PolygonMesh, GT>(pmesh) * 1e-6;
+      ball_radius = avg_edge_length * 1e-6;
     else
       ball_radius = radius;
   }
@@ -1010,7 +1019,8 @@ class Interpolated_corrected_curvatures_computer
         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
           vertex_measures.anisotropic_measure,
           vertex_measures.area_measure,
-          v_normal
+          v_normal,
+          avg_edge_length
           );
         put(principal_curvatures_and_directions_map, v, principal_curvatures_and_directions);
       }
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index c0772ce989bc..2f1af8adb106 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -32,7 +32,7 @@ struct Average_test_info {
     Epic_kernel::FT principal_curvature_avg,
     Epic_kernel::FT expansion_radius = -1,
     Epic_kernel::FT tolerance = 0.9
-  ):
+  ) :
     expansion_radius(expansion_radius),
     mean_curvature_avg(mean_curvature_avg),
     gaussian_curvature_avg(gaussian_curvature_avg),
@@ -43,8 +43,7 @@ struct Average_test_info {
 
 };
 
-bool passes_comparison(Epic_kernel::FT result, Epic_kernel::FT expected, Epic_kernel::FT tolerance)
-{
+bool passes_comparison(Epic_kernel::FT result, Epic_kernel::FT expected, Epic_kernel::FT tolerance) {
   if (abs(expected) < ABS_ERROR && abs(result) < ABS_ERROR)
     return true; // expected 0, got 0
   else if (abs(expected) < ABS_ERROR)
@@ -56,8 +55,10 @@ bool passes_comparison(Epic_kernel::FT result, Epic_kernel::FT expected, Epic_ke
 template <typename PolygonMesh>
 void test_average_curvatures(std::string mesh_path,
   Average_test_info test_info,
-  bool compare_single_vertex = false
-){
+  bool compare_single_vertex = false,
+  int scale_factor_exponent = 0
+) {
+  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
 
   PolygonMesh pmesh;
   const std::string filename = CGAL::data_file_path(mesh_path);
@@ -67,14 +68,33 @@ void test_average_curvatures(std::string mesh_path,
     std::cerr << "Invalid input file." << std::endl;
   }
 
-  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+  // The following part is used to scale the given mesh and expected curvatures by a constant factor
+  // this is used to test the stability of the implementation across different scales
+  if (scale_factor_exponent) {
+    Epic_kernel::FT factor = pow(10, scale_factor_exponent);
+
+    test_info.expansion_radius *= factor;
+    test_info.mean_curvature_avg /= factor;
+    test_info.gaussian_curvature_avg /= factor * factor;
+    test_info.principal_curvature_avg /= factor;
+
+    auto vpm = get(CGAL::vertex_point, pmesh);
+
+    for (vertex_descriptor vi : vertices(pmesh)) {
+      Epic_kernel::Point_3 pi = get(vpm, vi);
+      Epic_kernel::Point_3 pi_new(pi.x() * factor, pi.y() * factor, pi.z() * factor);
+      put(vpm, vi, pi_new);
+    }
+  }
+
 
   typename boost::property_map<PolygonMesh, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
     mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), pmesh),
     gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), pmesh);
-  typename boost::property_map<PolygonMesh, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
-    principal_curvatures_and_directions_map = get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), pmesh);
-
+  typename boost::property_map
+    <PolygonMesh, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
+      principal_curvatures_and_directions_map =
+        get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), pmesh);
   // test_info.expansion_radius -> test if no radius is provided by user.
   if (test_info.expansion_radius < 0) {
     PMP::interpolated_corrected_mean_curvature(pmesh, mean_curvature_map);
@@ -103,8 +123,7 @@ void test_average_curvatures(std::string mesh_path,
 
   Epic_kernel::FT mean_curvature_avg = 0, gaussian_curvature_avg = 0, principal_curvature_avg = 0;
 
-  for (vertex_descriptor v : vertices(pmesh))
-  {
+  for (vertex_descriptor v : vertices(pmesh)) {
     mean_curvature_avg += get(mean_curvature_map, v);
     gaussian_curvature_avg += get(gaussian_curvature_map, v);
     principal_curvature_avg += get(principal_curvatures_and_directions_map, v).min_curvature
@@ -131,8 +150,7 @@ void test_average_curvatures(std::string mesh_path,
 
   Epic_kernel::FT new_mean_curvature_avg = 0, new_Gaussian_curvature_avg = 0, new_principal_curvature_avg = 0;
 
-  for (vertex_descriptor v : vertices(pmesh))
-  {
+  for (vertex_descriptor v : vertices(pmesh)) {
     new_mean_curvature_avg += get(mean_curvature_map, v);
     new_Gaussian_curvature_avg += get(gaussian_curvature_map, v);
     new_principal_curvature_avg += get(principal_curvatures_and_directions_map, v).min_curvature
@@ -149,8 +167,7 @@ void test_average_curvatures(std::string mesh_path,
   assert(passes_comparison(gaussian_curvature_avg, new_Gaussian_curvature_avg, 0.99));
   assert(passes_comparison(principal_curvature_avg, new_principal_curvature_avg, 0.99));
 
-  if (compare_single_vertex)
-  {
+  if (compare_single_vertex) {
     // computing curvatures together from interpolated_corrected_curvatures()
 
     Epic_kernel::FT single_vertex_mean_curvature_avg = 0,
@@ -160,8 +177,7 @@ void test_average_curvatures(std::string mesh_path,
     Epic_kernel::FT h, g;
     PMP::Principal_curvatures_and_directions<Epic_kernel> p;
 
-    for (vertex_descriptor v : vertices(pmesh))
-    {
+    for (vertex_descriptor v : vertices(pmesh)) {
       PMP::interpolated_corrected_curvatures_one_vertex(
         pmesh,
         v,
@@ -193,7 +209,7 @@ int main()
   // For this mesh, ina addition to the whole mesh functions, we also compare against the single vertex
   // curvature functions to make sure the produce the same results
   // Expected: Mean Curvature = 2, Gaussian Curvature = 4, Principal Curvatures = 2 & 2 so 2 on avg.
-  test_average_curvatures<Polyhedron>("meshes/sphere.off", Average_test_info(2,4,2), true);
+  test_average_curvatures<Polyhedron>("meshes/sphere.off", Average_test_info(2, 4, 2), true);
   test_average_curvatures<SMesh>("meshes/sphere.off", Average_test_info(2, 4, 2), true);
 
   // Same mesh but with specified expansion radii of 0 and 0.25 (half radius of sphere)
@@ -218,6 +234,22 @@ int main()
   test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0));
   test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0.5));
 
+  // Same tests as last one, but with a scaling on the mesh with different values to check for scale stability
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0), false, -6);
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0.5), false, -6);
+
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0), false, -3);
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0.5), false, -3);
+
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0), false, -1);
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0.5), false, -1);
+
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0), false, 1);
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0.5), false, 1);
 
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0), false, 3);
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0.5), false, 3);
 
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0), false, 6);
+  test_average_curvatures<SMesh>("meshes/cylinder.off", Average_test_info(0.5, 0, 0.5, 0.5), false, 6);
 }

From a1ff847b6a4ec05ce40e3e24b7d38d8a87fd868e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 2 Jan 2023 08:17:16 +0100
Subject: [PATCH 0146/1398] add "brute-force" version of autorefine()

---
 .../Polygon_mesh_processing/CMakeLists.txt    |   1 +
 .../triangle_mesh_autorefinement.cpp          |  29 +
 .../Polygon_mesh_processing/autorefinement.h  | 507 ++++++++++++++++++
 .../internal/parameters_interface.h           |   1 +
 4 files changed, 538 insertions(+)
 create mode 100644 Polygon_mesh_processing/examples/Polygon_mesh_processing/triangle_mesh_autorefinement.cpp
 create mode 100644 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index 192e7d29b745..e188e01e3eb7 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -50,6 +50,7 @@ create_single_source_cgal_program("match_faces.cpp")
 create_single_source_cgal_program("cc_compatible_orientations.cpp")
 create_single_source_cgal_program("hausdorff_distance_remeshing_example.cpp")
 create_single_source_cgal_program("hausdorff_bounded_error_distance_example.cpp")
+create_single_source_cgal_program("triangle_mesh_autorefinement.cpp")
 
 find_package(Eigen3 3.2.0 QUIET) #(requires 3.2.0 or greater)
 include(CGAL_Eigen3_support)
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangle_mesh_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangle_mesh_autorefinement.cpp
new file mode 100644
index 000000000000..65db52fef2c9
--- /dev/null
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangle_mesh_autorefinement.cpp
@@ -0,0 +1,29 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Polygon_mesh_processing/autorefinement.h>
+#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+
+#include <iostream>
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
+typedef Kernel::Point_3                                     Point;
+
+typedef CGAL::Surface_mesh<Point>                           Mesh;
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+int main(int argc, char** argv)
+{
+  Mesh mesh;
+
+  const std::string filename = argc == 1 ? CGAL::data_file_path("meshes/elephant.off")
+                                         : std::string(argv[1]);
+  CGAL::IO::read_polygon_mesh(filename, mesh);
+
+  PMP::autorefine(mesh);
+
+  CGAL::IO::write_polygon_mesh("autorefined.off", mesh, CGAL::parameters::stream_precision(17));
+
+  return 0;
+}
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
new file mode 100644
index 000000000000..8c34b4041d86
--- /dev/null
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -0,0 +1,507 @@
+// Copyright (c) 2023 GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+//
+// Author(s)     : Sebastien Loriot
+//
+
+#ifndef CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_H
+#define CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_H
+
+#include <CGAL/license/Polygon_mesh_processing/geometric_repair.h>
+
+#include <CGAL/Polygon_mesh_processing/self_intersections.h>
+#include <CGAL/Constrained_Delaunay_triangulation_2.h>
+#include <CGAL/Projection_traits_3.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+
+// output
+#include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
+#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+
+#ifndef NDEBUG
+// debug
+#include <CGAL/Surface_mesh.h>
+#endif
+
+#include <vector>
+
+namespace CGAL {
+namespace Polygon_mesh_processing {
+
+#ifndef DOXYGEN_RUNNING
+namespace autorefine_impl {
+
+template <class EK>
+void generate_subtriangles(const typename EK::Triangle_3& t,
+                           const std::vector<typename EK::Segment_3>& segments,
+                           const std::vector<typename EK::Point_3>& points,
+                           std::vector<typename EK::Triangle_3>& new_triangles)
+{
+  typedef CGAL::Projection_traits_3<EK> P_traits;
+  // typedef CGAL::Exact_intersections_tag Itag;
+  typedef CGAL::No_constraint_intersection_requiring_constructions_tag Itag;
+  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits, Default, Itag> CDT;
+
+
+  P_traits cdt_traits(normal(t[0], t[1], t[2]));
+  CDT cdt(cdt_traits);
+
+  cdt.insert_outside_affine_hull(t[0]);
+  cdt.insert_outside_affine_hull(t[1]);
+  typename CDT::Vertex_handle v = cdt.tds().insert_dim_up(cdt.infinite_vertex(), false);
+  v->set_point(t[2]);
+
+  for (const typename EK::Segment_3& s : segments)
+    cdt.insert_constraint(s[0], s[1]);
+
+  for (const typename EK::Point_3& p : points)
+    cdt.insert(p);
+
+  for (typename CDT::Face_handle fh : cdt.finite_face_handles())
+  {
+    new_triangles.emplace_back(fh->vertex(0)->point(),
+                               fh->vertex(cdt.ccw(0))->point(),
+                               fh->vertex(cdt.cw(0))->point());
+  }
+}
+
+template <class EK>
+struct Intersection_visitor
+{
+  std::vector<typename EK::Segment_3>& all_segments_1;
+  std::vector<typename EK::Segment_3>& all_segments_2;
+  std::vector<typename EK::Point_3>& all_points_1;
+  std::vector<typename EK::Point_3>& all_points_2;
+
+  Intersection_visitor(std::vector<typename EK::Segment_3>& all_segments_1,
+                       std::vector<typename EK::Segment_3>& all_segments_2,
+                       std::vector<typename EK::Point_3>& all_points_1,
+                       std::vector<typename EK::Point_3>& all_points_2)
+    : all_segments_1(all_segments_1)
+    , all_segments_2(all_segments_2)
+    , all_points_1(all_points_1)
+    , all_points_2(all_points_2)
+  {}
+
+  typedef void result_type;
+  void operator()(const typename EK::Point_3& p)
+  {
+    all_points_1.push_back(p);
+    all_points_2.push_back(p);
+  }
+
+  void operator()(const typename EK::Segment_3& s)
+  {
+    all_segments_1.push_back(s);
+    all_segments_2.push_back(s);
+  }
+
+  void operator()(const typename EK::Triangle_3& t)
+  {
+    for (std::size_t i=1; i<3; ++i)
+    {
+      typename EK::Segment_3 s(t[i-1], t[i]);
+      all_segments_1.push_back(s);
+      all_segments_2.push_back(s);
+    }
+  }
+
+  void operator()(const std::vector<typename EK::Point_3>& poly)
+  {
+    std::size_t nbp = poly.size();
+    for (std::size_t i=1; i<nbp; ++i)
+    {
+      typename EK::Segment_3 s(poly[i-1], poly[i]);
+      all_segments_1.push_back(s);
+      all_segments_2.push_back(s);
+    }
+  }
+};
+
+template <class EK, class TriangleMesh, class VPM, class TID_Map>
+bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, const std::vector< std::vector<Triangle_3<EK>>>& triangles)
+{
+  typedef typename Kernel_traits<typename boost::property_traits<VPM>::value_type>::type IK;
+  typedef boost::graph_traits<TriangleMesh> Graph_traits;
+  typedef typename Graph_traits::face_descriptor face_descriptor;
+  typedef typename Graph_traits::halfedge_descriptor halfedge_descriptor;
+
+  std::vector<typename EK::Point_3> soup_points;
+  std::vector<std::array<std::size_t, 3> > soup_triangles;
+  Cartesian_converter<IK, EK> to_exact;
+  std::map<typename EK::Point_3, std::size_t> point_id_map;
+
+  auto get_point_id = [&](const typename EK::Point_3& pt)
+  {
+    auto insert_res = point_id_map.insert(std::make_pair(pt, soup_points.size()));
+    if (insert_res.second)
+      soup_points.push_back(pt);
+    return insert_res.first->second;
+  };
+
+  for (face_descriptor f : faces(tm))
+  {
+    int tid = get(tid_map, f);
+    if (tid == -1)
+    {
+      halfedge_descriptor h = halfedge(f, tm);
+      soup_triangles.emplace_back(
+        CGAL::make_array(get_point_id(to_exact(get(vpm,source(h, tm)))),
+                         get_point_id(to_exact(get(vpm,target(h, tm)))),
+                         get_point_id(to_exact(get(vpm,target(next(h, tm), tm)))))
+      );
+    }
+    else
+    {
+      for (const typename EK::Triangle_3& t : triangles[tid])
+      {
+        soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
+      }
+    }
+  }
+
+  typedef Surface_mesh<typename EK::Point_3> Exact_mesh;
+  Exact_mesh etm;
+  orient_polygon_soup(soup_points, soup_triangles);
+  polygon_soup_to_polygon_mesh(soup_points, soup_triangles, etm);
+  typename Exact_mesh::Property_map<typename Exact_mesh::Vertex_index, bool> is_border_map =
+    etm.template add_property_map<typename Exact_mesh::Vertex_index, bool>("v:is_border", false).first;
+  for(typename Exact_mesh::Halfedge_index h : etm.halfedges())
+  {
+    if (CGAL::is_border(h, etm))
+      is_border_map[target(h, etm)] = true;
+  }
+
+  //TODO: double check me
+  auto skip_faces = [&](const std::pair<typename Exact_mesh::Face_index, typename Exact_mesh::Face_index>& p)
+  {
+    typename Exact_mesh::Halfedge_index h1 = etm.halfedge(p.first), h2=etm.halfedge(p.second);
+
+    boost::container::small_vector<typename Exact_mesh::Halfedge_index, 3> bv1;
+    if (is_border_map[source(h1, etm)]) bv1.push_back(prev(h1, etm));
+    if (is_border_map[target(h1, etm)]) bv1.push_back(h1);
+    if (is_border_map[target(next(h1, etm), etm)]) bv1.push_back(next(h1, etm));
+    if (bv1.empty()) return false;
+
+    boost::container::small_vector<typename Exact_mesh::Halfedge_index, 3> bv2;
+    if (is_border_map[source(h2, etm)]) bv2.push_back(prev(h2, etm));
+    if (is_border_map[target(h2, etm)]) bv2.push_back(h2);
+    if (is_border_map[target(next(h2, etm), etm)]) bv2.push_back(next(h2, etm));
+    if (bv2.empty()) return false;
+
+    //collect identical border vertices
+    boost::container::small_vector<std::pair<typename Exact_mesh::Halfedge_index, typename Exact_mesh::Halfedge_index>, 3> common;
+    for(typename Exact_mesh::Halfedge_index h1 : bv1)
+      for(typename Exact_mesh::Halfedge_index h2 : bv2)
+        if (etm.point(target(h1, etm))==etm.point(target(h2,etm)))
+          common.push_back(std::make_pair(h1,h2));
+
+    if (common.empty()) return false;
+
+    switch (common.size())
+    {
+      case 1:
+      {
+        // geometric check if the opposite segments intersect the triangles
+        const typename EK::Triangle_3 t1(etm.point(source(h1,etm)),
+                                         etm.point(target(h1,etm)),
+                                         etm.point(target(next(h1,etm),etm)));
+        const typename EK::Triangle_3 t2(etm.point(source(h2,etm)),
+                                         etm.point(target(h2,etm)),
+                                         etm.point(target(next(h2,etm),etm)));
+
+        const typename EK::Segment_3 s1(etm.point(source(common[0].first,etm)), etm.point(target(next(common[0].first,etm),etm)));
+        const typename EK::Segment_3 s2(etm.point(source(common[0].second,etm)), etm.point(target(next(common[0].second,etm),etm)));
+
+        if(do_intersect(t1, s2) || do_intersect(t2, s1))
+          return false;
+        return true;
+      }
+      case 2:
+      {
+        // shared edge
+        h1 = next(common[0].first, etm) == common[1].first ? common[1].first : common[0].first;
+        h2 = next(common[0].second, etm) == common[1].second ? common[1].second : common[0].second;
+
+        if ( is_border(etm.opposite(h1), etm) &&
+             is_border(etm.opposite(h2), etm) )
+        {
+          if( CGAL::coplanar(etm.point(source(h1,etm)),
+                             etm.point(target(h1,etm)),
+                             etm.point(target(etm.next(h1),etm)),
+                             etm.point(source(h1,etm))) &&
+              CGAL::coplanar_orientation(etm.point(source(h1,etm)),
+                             etm.point(target(h1,etm)),
+                             etm.point(target(etm.next(h1),etm)),
+                             etm.point(source(h1,etm))) == CGAL::POSITIVE)
+          {
+            return false;
+          }
+          return true;
+        }
+        else
+        {
+          // TODO: 2 identical border vertices, no common edge on the boundary. Not sure what to do
+          return false;
+        }
+      }
+      default: // size == 3
+        return true;
+    }
+  };
+
+  std::vector< std::pair<typename Exact_mesh::Face_index, typename Exact_mesh::Face_index> > si_faces;
+  self_intersections(etm,
+                     CGAL::filter_output_iterator(std::back_inserter(si_faces),
+                     skip_faces));
+
+  return si_faces.empty();
+}
+
+} // end of autorefine_impl
+#endif
+
+/**
+ * \ingroup PMP_corefinement_grp
+ * \link coref_def_subsec autorefines \endlink `tm`. Refines a triangle mesh
+ * so that no triangles intersects in their interior.
+ * Self-intersection edges will be marked as constrained. If an edge that was marked as
+ * constrained is split, its sub-edges will be marked as constrained as well.
+ *
+ * @tparam TriangleMesh a model of `HalfedgeListGraph`, `FaceListGraph`, and `MutableFaceGraph`
+ * @tparam NamedParameters a sequence of \ref namedparameters
+ *
+ * @param tm input triangulated surface mesh
+ * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+ *
+ * \cgalParamNBegin{geom_traits}
+ *   \cgalParamDescription{an instance of a geometric traits class}
+ *   \cgalParamType{a class model of `PMPSelfIntersectionTraits`}
+ *   \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+ *   \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
+ * \cgalParamNEnd
+ *
+ * \cgalNamedParamsBegin
+ *   \cgalParamNBegin{vertex_point_map}
+ *     \cgalParamDescription{a property map associating points to the vertices of `tm`}
+ *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%vertex_descriptor`
+ *                    as key type and `%Point_3` as value type}
+ *     \cgalParamDefault{`boost::get(CGAL::vertex_point, tm)`}
+ *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
+ *                     must be available in `TriangleMesh`.}
+ *  \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{edge_is_constrained_map}
+ *     \cgalParamDescription{a property map containing the constrained-or-not status of each edge of `tm`}
+ *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%edge_descriptor`
+ *                    as key type and `bool` as value type}
+ *     \cgalParamDefault{a constant property map returning `false` for any edge}
+ *   \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{face_index_map}
+ *     \cgalParamDescription{a property map associating to each face of `tm` a unique index between `0` and `num_faces(tm) - 1`}
+ *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%face_descriptor`
+ *                    as key type and `std::size_t` as value type}
+ *     \cgalParamDefault{an automatically indexed internal map}
+ *     \cgalParamExtra{If the property map is writable, the indices of the faces of `tm1` and `tm2`
+ *                     will be set after the corefinement is done.}
+ *   \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{visitor}
+ *     \cgalParamDescription{a visitor used to track the creation of new faces}
+ *     \cgalParamType{a class model of `PMPCorefinementVisitor`}
+ *     \cgalParamDefault{`Corefinement::Default_visitor<TriangleMesh>`}
+ *   \cgalParamNEnd
+ * \cgalNamedParamsEnd
+ *
+ */
+template <class TriangleMesh,
+          class NamedParameters = parameters::Default_named_parameters>
+void
+autorefine(      TriangleMesh& tm,
+           const NamedParameters& np = parameters::default_values())
+{
+  //TODO: what about degenerate faces?
+
+  using parameters::choose_parameter;
+  using parameters::get_parameter;
+
+  typedef typename GetGeomTraits<TriangleMesh, NamedParameters>::type GT;
+  GT traits = choose_parameter<GT>(get_parameter(np, internal_np::geom_traits));
+
+  typedef typename GetVertexPointMap<TriangleMesh, NamedParameters>::type VPM;
+  VPM vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
+                             get_property_map(vertex_point, tm));
+
+  typedef typename internal_np::Lookup_named_param_def <
+    internal_np::concurrency_tag_t,
+    NamedParameters,
+    Sequential_tag
+  > ::type Concurrency_tag;
+
+  typedef boost::graph_traits<TriangleMesh> Graph_traits;
+  typedef typename Graph_traits::face_descriptor face_descriptor;
+  typedef typename Graph_traits::halfedge_descriptor halfedge_descriptor;
+  typedef typename Graph_traits::vertex_descriptor vertex_descriptor;
+  typedef std::pair<face_descriptor, face_descriptor> Pair_of_faces;
+
+  std::vector<Pair_of_faces> si_pairs;
+
+  // collect intersecting pairs of triangles
+  self_intersections<Concurrency_tag>(tm, std::back_inserter(si_pairs), np);
+
+  if (si_pairs.empty()) return;
+
+  // assign an id per triangle involved in an intersection
+  // + the faces involved in the intersection
+  typedef CGAL::dynamic_face_property_t<int> Face_property_tag;
+  typedef typename boost::property_map<TriangleMesh, Face_property_tag>::type Triangle_id_map;
+
+  Triangle_id_map tid_map = get(Face_property_tag(), tm);
+  for (face_descriptor f : faces(tm))
+    put(tid_map, f, -1);
+
+  std::vector<face_descriptor> intersected_faces;
+  int tid=-1;
+  for (const Pair_of_faces& p : si_pairs)
+  {
+    if (get(tid_map, p.first)==-1)
+    {
+      put(tid_map, p.first, ++tid);
+      intersected_faces.push_back(p.first);
+    }
+    if (get(tid_map, p.second)==-1)
+    {
+      put(tid_map, p.second, ++tid);
+      intersected_faces.push_back(p.second);
+    }
+  }
+
+  // init the vector of triangles used for the autorefinement of triangles
+  typedef CGAL::Exact_predicates_exact_constructions_kernel EK;
+  std::vector< std::vector<EK::Triangle_3> > triangles(tid+1);
+  Cartesian_converter<GT, EK> to_exact;
+
+  for(face_descriptor f : intersected_faces)
+  {
+    halfedge_descriptor h = halfedge(f, tm);
+    triangles[get(tid_map, f)].emplace_back(
+      to_exact( get(vpm, source(h, tm)) ),
+      to_exact( get(vpm, target(h, tm)) ),
+      to_exact( get(vpm, target(next(h, tm), tm)) ) );
+  }
+
+  typename EK::Intersect_3 intersection = EK().intersect_3_object();
+  for (const Pair_of_faces& p : si_pairs)
+  {
+    int i1 = get(tid_map, p.first),
+        i2 = get(tid_map, p.second);
+
+
+    std::size_t nbt_1 = triangles[i1].size(),
+                nbt_2 = triangles[i2].size();
+
+    std::vector< std::vector<EK::Segment_3> > all_segments_1(nbt_1);
+    std::vector< std::vector<EK::Segment_3> > all_segments_2(nbt_2);
+    std::vector< std::vector<EK::Point_3> > all_points_1(nbt_1);
+    std::vector< std::vector<EK::Point_3> > all_points_2(nbt_2);
+
+    std::vector <EK::Triangle_3> t1_subtriangles, t2_subtriangles;
+    for (std::size_t it1=0; it1<nbt_1; ++it1)
+    {
+      for (std::size_t it2=0; it2<nbt_2; ++it2)
+      {
+        const EK::Triangle_3& t1 = triangles[i1][it1];
+        const EK::Triangle_3& t2 = triangles[i2][it2];
+
+        auto inter = intersection(t1, t2);
+
+        if (inter != boost::none)
+        {
+          autorefine_impl::Intersection_visitor<EK> intersection_visitor(all_segments_1[it1],  all_segments_2[it2],
+                                                                         all_points_1[it1], all_points_2[it2]);
+
+          boost::apply_visitor(intersection_visitor, *inter);
+        }
+      }
+    }
+
+    // now refine triangles
+    std::vector<EK::Triangle_3> new_triangles;
+    for(std::size_t it1=0; it1<nbt_1; ++it1)
+    {
+      if (all_segments_1[it1].empty() && all_points_1[it1].empty())
+        new_triangles.push_back(triangles[i1][it1]);
+      else
+        autorefine_impl::generate_subtriangles<EK>(triangles[i1][it1], all_segments_1[it1], all_points_1[it1], new_triangles);
+    }
+    triangles[i1].swap(new_triangles);
+    new_triangles.clear();
+    for(std::size_t it2=0; it2<nbt_2; ++it2)
+    {
+      if (all_segments_2[it2].empty() && all_points_2[it2].empty())
+        new_triangles.push_back(triangles[i2][it2]);
+      else
+        autorefine_impl::generate_subtriangles<EK>(triangles[i2][it2], all_segments_2[it2], all_points_2[it2], new_triangles);
+    }
+    triangles[i2].swap(new_triangles);
+  }
+
+  CGAL_assertion( autorefine_impl::is_output_valid(tm, vpm, tid_map, triangles) );
+
+  // brute force output: create a soup, orient and to-mesh
+  // WARNING: there is no reason when using double that identical exact points are identical in double
+  std::vector<typename GT::Point_3> soup_points;
+  std::vector<std::array<std::size_t, 3> > soup_triangles;
+  Cartesian_converter<EK, GT> to_input;
+  std::map<EK::Point_3, std::size_t> point_id_map;
+
+  for (vertex_descriptor v : vertices(tm))
+  {
+    if (point_id_map.insert(std::make_pair(to_exact(get(vpm,v)), soup_points.size())).second)
+      soup_points.push_back(get(vpm,v));
+  }
+
+  auto get_point_id = [&](const typename EK::Point_3& pt)
+  {
+    auto insert_res = point_id_map.insert(std::make_pair(pt, soup_points.size()));
+    if (insert_res.second)
+      soup_points.push_back(to_input(pt));
+    return insert_res.first->second;
+  };
+
+  for (face_descriptor f : faces(tm))
+  {
+    int tid = get(tid_map, f);
+    if (tid == -1)
+    {
+      halfedge_descriptor h = halfedge(f, tm);
+      soup_triangles.emplace_back(
+        CGAL::make_array(get_point_id(to_exact(get(vpm,source(h, tm)))),
+                         get_point_id(to_exact(get(vpm,target(h, tm)))),
+                         get_point_id(to_exact(get(vpm,target(next(h, tm), tm)))))
+      );
+    }
+    else
+    {
+      for (const typename EK::Triangle_3& t : triangles[tid])
+      {
+        soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
+      }
+    }
+  }
+  clear(tm);
+  orient_polygon_soup(soup_points, soup_triangles);
+  polygon_soup_to_polygon_mesh(soup_points, soup_triangles, tm);
+}
+
+} } // end of CGAL::Polygon_mesh_processing
+
+#endif // CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_H
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index 5c649faa56c7..7d758abc4ee6 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -45,6 +45,7 @@ CGAL_add_named_parameter(implementation_tag_t, implementation_tag, implementatio
 CGAL_add_named_parameter(prevent_unselection_t, prevent_unselection, prevent_unselection)
 
 CGAL_add_named_parameter(verbose_t, verbose, verbose)
+CGAL_add_named_parameter(concurrency_tag_t, concurrency_tag, concurrency_tag)
 
 // List of named parameters used for IO
 CGAL_add_named_parameter(vertex_normal_output_iterator_t, vertex_normal_output_iterator, vertex_normal_output_iterator)

From b0edd90580ea3044ca3fbfe11086d5413f9338cf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 2 Jan 2023 17:21:01 +0100
Subject: [PATCH 0147/1398] add option to directly dump the soup

---
 .../Polygon_mesh_processing/autorefinement.h  | 149 ++++++++++--------
 1 file changed, 84 insertions(+), 65 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 8c34b4041d86..fd124bce8579 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -266,67 +266,12 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, const std::vec
 }
 
 } // end of autorefine_impl
-#endif
 
-/**
- * \ingroup PMP_corefinement_grp
- * \link coref_def_subsec autorefines \endlink `tm`. Refines a triangle mesh
- * so that no triangles intersects in their interior.
- * Self-intersection edges will be marked as constrained. If an edge that was marked as
- * constrained is split, its sub-edges will be marked as constrained as well.
- *
- * @tparam TriangleMesh a model of `HalfedgeListGraph`, `FaceListGraph`, and `MutableFaceGraph`
- * @tparam NamedParameters a sequence of \ref namedparameters
- *
- * @param tm input triangulated surface mesh
- * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
- *
- * \cgalParamNBegin{geom_traits}
- *   \cgalParamDescription{an instance of a geometric traits class}
- *   \cgalParamType{a class model of `PMPSelfIntersectionTraits`}
- *   \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
- *   \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
- * \cgalParamNEnd
- *
- * \cgalNamedParamsBegin
- *   \cgalParamNBegin{vertex_point_map}
- *     \cgalParamDescription{a property map associating points to the vertices of `tm`}
- *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%vertex_descriptor`
- *                    as key type and `%Point_3` as value type}
- *     \cgalParamDefault{`boost::get(CGAL::vertex_point, tm)`}
- *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
- *                     must be available in `TriangleMesh`.}
- *  \cgalParamNEnd
- *
- *   \cgalParamNBegin{edge_is_constrained_map}
- *     \cgalParamDescription{a property map containing the constrained-or-not status of each edge of `tm`}
- *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%edge_descriptor`
- *                    as key type and `bool` as value type}
- *     \cgalParamDefault{a constant property map returning `false` for any edge}
- *   \cgalParamNEnd
- *
- *   \cgalParamNBegin{face_index_map}
- *     \cgalParamDescription{a property map associating to each face of `tm` a unique index between `0` and `num_faces(tm) - 1`}
- *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%face_descriptor`
- *                    as key type and `std::size_t` as value type}
- *     \cgalParamDefault{an automatically indexed internal map}
- *     \cgalParamExtra{If the property map is writable, the indices of the faces of `tm1` and `tm2`
- *                     will be set after the corefinement is done.}
- *   \cgalParamNEnd
- *
- *   \cgalParamNBegin{visitor}
- *     \cgalParamDescription{a visitor used to track the creation of new faces}
- *     \cgalParamType{a class model of `PMPCorefinementVisitor`}
- *     \cgalParamDefault{`Corefinement::Default_visitor<TriangleMesh>`}
- *   \cgalParamNEnd
- * \cgalNamedParamsEnd
- *
- */
-template <class TriangleMesh,
-          class NamedParameters = parameters::Default_named_parameters>
-void
-autorefine(      TriangleMesh& tm,
-           const NamedParameters& np = parameters::default_values())
+template <class TriangleMesh, class Point_3, class NamedParameters = parameters::Default_named_parameters>
+void autorefine_soup_output(const TriangleMesh& tm,
+                            std::vector<Point_3>& soup_points,
+                            std::vector<std::array<std::size_t, 3> >& soup_triangles,
+                            const NamedParameters& np = parameters::default_values())
 {
   //TODO: what about degenerate faces?
 
@@ -336,9 +281,9 @@ autorefine(      TriangleMesh& tm,
   typedef typename GetGeomTraits<TriangleMesh, NamedParameters>::type GT;
   GT traits = choose_parameter<GT>(get_parameter(np, internal_np::geom_traits));
 
-  typedef typename GetVertexPointMap<TriangleMesh, NamedParameters>::type VPM;
+  typedef typename GetVertexPointMap<TriangleMesh, NamedParameters>::const_type VPM;
   VPM vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
-                             get_property_map(vertex_point, tm));
+                             get_const_property_map(vertex_point, tm));
 
   typedef typename internal_np::Lookup_named_param_def <
     internal_np::concurrency_tag_t,
@@ -362,7 +307,7 @@ autorefine(      TriangleMesh& tm,
   // assign an id per triangle involved in an intersection
   // + the faces involved in the intersection
   typedef CGAL::dynamic_face_property_t<int> Face_property_tag;
-  typedef typename boost::property_map<TriangleMesh, Face_property_tag>::type Triangle_id_map;
+  typedef typename boost::property_map<TriangleMesh, Face_property_tag>::const_type Triangle_id_map;
 
   Triangle_id_map tid_map = get(Face_property_tag(), tm);
   for (face_descriptor f : faces(tm))
@@ -458,8 +403,6 @@ autorefine(      TriangleMesh& tm,
 
   // brute force output: create a soup, orient and to-mesh
   // WARNING: there is no reason when using double that identical exact points are identical in double
-  std::vector<typename GT::Point_3> soup_points;
-  std::vector<std::array<std::size_t, 3> > soup_triangles;
   Cartesian_converter<EK, GT> to_input;
   std::map<EK::Point_3, std::size_t> point_id_map;
 
@@ -497,11 +440,87 @@ autorefine(      TriangleMesh& tm,
       }
     }
   }
+
+}
+#endif
+
+/**
+ * \ingroup PMP_corefinement_grp
+ * \link coref_def_subsec autorefines \endlink `tm`. Refines a triangle mesh
+ * so that no triangles intersects in their interior.
+ * Self-intersection edges will be marked as constrained. If an edge that was marked as
+ * constrained is split, its sub-edges will be marked as constrained as well.
+ *
+ * @tparam TriangleMesh a model of `HalfedgeListGraph`, `FaceListGraph`, and `MutableFaceGraph`
+ * @tparam NamedParameters a sequence of \ref namedparameters
+ *
+ * @param tm input triangulated surface mesh
+ * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+ *
+ * \cgalParamNBegin{geom_traits}
+ *   \cgalParamDescription{an instance of a geometric traits class}
+ *   \cgalParamType{a class model of `PMPSelfIntersectionTraits`}
+ *   \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+ *   \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
+ * \cgalParamNEnd
+ *
+ * \cgalNamedParamsBegin
+ *   \cgalParamNBegin{vertex_point_map}
+ *     \cgalParamDescription{a property map associating points to the vertices of `tm`}
+ *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%vertex_descriptor`
+ *                    as key type and `%Point_3` as value type}
+ *     \cgalParamDefault{`boost::get(CGAL::vertex_point, tm)`}
+ *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
+ *                     must be available in `TriangleMesh`.}
+ *  \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{edge_is_constrained_map}
+ *     \cgalParamDescription{a property map containing the constrained-or-not status of each edge of `tm`}
+ *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%edge_descriptor`
+ *                    as key type and `bool` as value type}
+ *     \cgalParamDefault{a constant property map returning `false` for any edge}
+ *   \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{face_index_map}
+ *     \cgalParamDescription{a property map associating to each face of `tm` a unique index between `0` and `num_faces(tm) - 1`}
+ *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%face_descriptor`
+ *                    as key type and `std::size_t` as value type}
+ *     \cgalParamDefault{an automatically indexed internal map}
+ *     \cgalParamExtra{If the property map is writable, the indices of the faces of `tm1` and `tm2`
+ *                     will be set after the corefinement is done.}
+ *   \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{visitor}
+ *     \cgalParamDescription{a visitor used to track the creation of new faces}
+ *     \cgalParamType{a class model of `PMPCorefinementVisitor`}
+ *     \cgalParamDefault{`Corefinement::Default_visitor<TriangleMesh>`}
+ *   \cgalParamNEnd
+ * \cgalNamedParamsEnd
+ *
+ */
+template <class TriangleMesh,
+          class NamedParameters = parameters::Default_named_parameters>
+void
+autorefine(      TriangleMesh& tm,
+           const NamedParameters& np = parameters::default_values())
+{
+  using parameters::choose_parameter;
+  using parameters::get_parameter;
+
+  typedef typename GetGeomTraits<TriangleMesh, NamedParameters>::type GT;
+  GT traits = choose_parameter<GT>(get_parameter(np, internal_np::geom_traits));
+
+  std::vector<typename GT::Point_3> soup_points;
+  std::vector<std::array<std::size_t, 3> > soup_triangles;
+
+  autorefine_soup_output(tm, soup_points, soup_triangles, np);
+
   clear(tm);
   orient_polygon_soup(soup_points, soup_triangles);
   polygon_soup_to_polygon_mesh(soup_points, soup_triangles, tm);
 }
 
+
 } } // end of CGAL::Polygon_mesh_processing
 
 #endif // CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_H

From 47ac016af779ab6a987ee16c62bbf723bd4c182f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 2 Jan 2023 17:32:35 +0100
Subject: [PATCH 0148/1398] skip degenerate faces

---
 .../Polygon_mesh_processing/autorefinement.h  | 32 ++++++++++++-------
 1 file changed, 21 insertions(+), 11 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index fd124bce8579..4b7020b5615b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -17,6 +17,7 @@
 #include <CGAL/license/Polygon_mesh_processing/geometric_repair.h>
 
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
+#include <CGAL/Polygon_mesh_processing/shape_predicates.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/Projection_traits_3.h>
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
@@ -125,8 +126,8 @@ struct Intersection_visitor
   }
 };
 
-template <class EK, class TriangleMesh, class VPM, class TID_Map>
-bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, const std::vector< std::vector<Triangle_3<EK>>>& triangles)
+template <class EK, class TriangleMesh, class VPM, class TID_Map, class Is_degen_map>
+bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map is_degen, const std::vector< std::vector<Triangle_3<EK>>>& triangles)
 {
   typedef typename Kernel_traits<typename boost::property_traits<VPM>::value_type>::type IK;
   typedef boost::graph_traits<TriangleMesh> Graph_traits;
@@ -148,6 +149,7 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, const std::vec
 
   for (face_descriptor f : faces(tm))
   {
+    if (get(is_degen, f)) continue; // skip degenerate faces
     int tid = get(tid_map, f);
     if (tid == -1)
     {
@@ -273,8 +275,6 @@ void autorefine_soup_output(const TriangleMesh& tm,
                             std::vector<std::array<std::size_t, 3> >& soup_triangles,
                             const NamedParameters& np = parameters::default_values())
 {
-  //TODO: what about degenerate faces?
-
   using parameters::choose_parameter;
   using parameters::get_parameter;
 
@@ -304,12 +304,20 @@ void autorefine_soup_output(const TriangleMesh& tm,
 
   if (si_pairs.empty()) return;
 
+  // mark degenerate faces so that we can ignore them
+  typedef CGAL::dynamic_face_property_t<bool> Degen_property_tag;
+  typedef typename boost::property_map<TriangleMesh, Degen_property_tag>::const_type Is_degen_map;
+  Is_degen_map is_degen = get(Degen_property_tag(), tm);
+
+  for(face_descriptor f : faces(tm))
+    put(is_degen, f, is_degenerate_triangle_face(f, tm, np));
+
   // assign an id per triangle involved in an intersection
   // + the faces involved in the intersection
-  typedef CGAL::dynamic_face_property_t<int> Face_property_tag;
-  typedef typename boost::property_map<TriangleMesh, Face_property_tag>::const_type Triangle_id_map;
+  typedef CGAL::dynamic_face_property_t<int> TID_property_tag;
+  typedef typename boost::property_map<TriangleMesh, TID_property_tag>::const_type Triangle_id_map;
 
-  Triangle_id_map tid_map = get(Face_property_tag(), tm);
+  Triangle_id_map tid_map = get(TID_property_tag(), tm);
   for (face_descriptor f : faces(tm))
     put(tid_map, f, -1);
 
@@ -317,12 +325,12 @@ void autorefine_soup_output(const TriangleMesh& tm,
   int tid=-1;
   for (const Pair_of_faces& p : si_pairs)
   {
-    if (get(tid_map, p.first)==-1)
+    if (get(tid_map, p.first)==-1 && !get(is_degen, p.first))
     {
       put(tid_map, p.first, ++tid);
       intersected_faces.push_back(p.first);
     }
-    if (get(tid_map, p.second)==-1)
+    if (get(tid_map, p.second)==-1 && !get(is_degen, p.second))
     {
       put(tid_map, p.second, ++tid);
       intersected_faces.push_back(p.second);
@@ -349,6 +357,7 @@ void autorefine_soup_output(const TriangleMesh& tm,
     int i1 = get(tid_map, p.first),
         i2 = get(tid_map, p.second);
 
+    if (i1==-1 || i2==-1) continue; //skip degenerate faces
 
     std::size_t nbt_1 = triangles[i1].size(),
                 nbt_2 = triangles[i2].size();
@@ -399,7 +408,7 @@ void autorefine_soup_output(const TriangleMesh& tm,
     triangles[i2].swap(new_triangles);
   }
 
-  CGAL_assertion( autorefine_impl::is_output_valid(tm, vpm, tid_map, triangles) );
+  CGAL_assertion( autorefine_impl::is_output_valid(tm, vpm, tid_map, is_degen, triangles) );
 
   // brute force output: create a soup, orient and to-mesh
   // WARNING: there is no reason when using double that identical exact points are identical in double
@@ -422,6 +431,8 @@ void autorefine_soup_output(const TriangleMesh& tm,
 
   for (face_descriptor f : faces(tm))
   {
+    if (get(is_degen, f)) continue; //skip degenerate faces
+
     int tid = get(tid_map, f);
     if (tid == -1)
     {
@@ -440,7 +451,6 @@ void autorefine_soup_output(const TriangleMesh& tm,
       }
     }
   }
-
 }
 #endif
 

From 6df9926f9b6ea6553be1fbcfd1c0996e76b802f4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 2 Jan 2023 17:47:04 +0100
Subject: [PATCH 0149/1398] add another example with soup as input

---
 .../Polygon_mesh_processing/CMakeLists.txt    |  1 +
 .../soup_autorefinement.cpp                   | 39 +++++++++++++++++++
 2 files changed, 40 insertions(+)
 create mode 100644 Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index e188e01e3eb7..d2faeb70cb28 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -51,6 +51,7 @@ create_single_source_cgal_program("cc_compatible_orientations.cpp")
 create_single_source_cgal_program("hausdorff_distance_remeshing_example.cpp")
 create_single_source_cgal_program("hausdorff_bounded_error_distance_example.cpp")
 create_single_source_cgal_program("triangle_mesh_autorefinement.cpp")
+create_single_source_cgal_program("soup_autorefinement.cpp")
 
 find_package(Eigen3 3.2.0 QUIET) #(requires 3.2.0 or greater)
 include(CGAL_Eigen3_support)
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
new file mode 100644
index 000000000000..fa1f5d686907
--- /dev/null
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -0,0 +1,39 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Polygon_mesh_processing/autorefinement.h>
+#include <CGAL/Polygon_mesh_processing/repair_polygon_soup.h>
+#include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
+#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <iostream>
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
+typedef Kernel::Point_3                                     Point;
+
+typedef CGAL::Surface_mesh<Point>                           Mesh;
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+int main(int argc, char** argv)
+{
+  const std::string filename = argc == 1 ? CGAL::data_file_path("meshes/elephant.off")
+                                         : std::string(argv[1]);
+
+  std::vector<Point> input_points;
+  std::vector<std::vector<std::size_t> > input_triangles;
+
+  CGAL::IO::read_polygon_soup(filename, input_points, input_triangles);
+  PMP::repair_polygon_soup(input_points, input_triangles);
+
+  Mesh mesh;
+  PMP::orient_polygon_soup(input_points, input_triangles);
+  PMP::polygon_soup_to_polygon_mesh(input_points, input_triangles, mesh);
+
+  PMP::autorefine(mesh);
+
+  CGAL::IO::write_polygon_mesh("autorefined.off", mesh, CGAL::parameters::stream_precision(17));
+
+  return 0;
+}

From e1414de8d935cc5da43682c48b5419823b806c77 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 2 Jan 2023 18:09:26 +0100
Subject: [PATCH 0150/1398] add debug

---
 .../Polygon_mesh_processing/autorefinement.h  | 46 +++++++++++++++++--
 1 file changed, 43 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 4b7020b5615b..8dd8d28fcfcc 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -181,6 +181,17 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map i
       is_border_map[target(h, etm)] = true;
   }
 
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE
+  std::cerr << std::setprecision(17);
+  auto verbose_fail_msg = [&](int i, const std::pair<typename Exact_mesh::Face_index, typename Exact_mesh::Face_index>& p)
+  {
+    typename Exact_mesh::Halfedge_index h1 = halfedge(p.first, etm), h2 = halfedge(p.second, etm);
+    std::cerr << "DEBUG: failing at check #" << i << "\n";
+    std::cerr << "DEBUG: " << etm.point(source(h1, etm)) << " " <<  etm.point(target(h1, etm)) << " " <<  etm.point(target(next(h1, etm), etm)) << " " << etm.point(source(h1, etm)) << "\n";
+    std::cerr << "DEBUG: " << etm.point(source(h2, etm)) << " " <<  etm.point(target(h2, etm)) << " " <<  etm.point(target(next(h2, etm), etm)) << " " << etm.point(source(h2, etm)) << "\n";
+  };
+#endif
+
   //TODO: double check me
   auto skip_faces = [&](const std::pair<typename Exact_mesh::Face_index, typename Exact_mesh::Face_index>& p)
   {
@@ -190,13 +201,25 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map i
     if (is_border_map[source(h1, etm)]) bv1.push_back(prev(h1, etm));
     if (is_border_map[target(h1, etm)]) bv1.push_back(h1);
     if (is_border_map[target(next(h1, etm), etm)]) bv1.push_back(next(h1, etm));
-    if (bv1.empty()) return false;
+    if (bv1.empty())
+    {
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE
+      verbose_fail_msg(1, p);
+#endif
+      return false;
+    }
 
     boost::container::small_vector<typename Exact_mesh::Halfedge_index, 3> bv2;
     if (is_border_map[source(h2, etm)]) bv2.push_back(prev(h2, etm));
     if (is_border_map[target(h2, etm)]) bv2.push_back(h2);
     if (is_border_map[target(next(h2, etm), etm)]) bv2.push_back(next(h2, etm));
-    if (bv2.empty()) return false;
+    if (bv2.empty())
+    {
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE
+      verbose_fail_msg(2, p);
+#endif
+      return false;
+    }
 
     //collect identical border vertices
     boost::container::small_vector<std::pair<typename Exact_mesh::Halfedge_index, typename Exact_mesh::Halfedge_index>, 3> common;
@@ -205,7 +228,13 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map i
         if (etm.point(target(h1, etm))==etm.point(target(h2,etm)))
           common.push_back(std::make_pair(h1,h2));
 
-    if (common.empty()) return false;
+    if (common.empty())
+    {
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE
+      verbose_fail_msg(3, p);
+#endif
+      return false;
+    }
 
     switch (common.size())
     {
@@ -223,7 +252,12 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map i
         const typename EK::Segment_3 s2(etm.point(source(common[0].second,etm)), etm.point(target(next(common[0].second,etm),etm)));
 
         if(do_intersect(t1, s2) || do_intersect(t2, s1))
+        {
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE
+          verbose_fail_msg(4, p);
+#endif
           return false;
+        }
         return true;
       }
       case 2:
@@ -244,6 +278,9 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map i
                              etm.point(target(etm.next(h1),etm)),
                              etm.point(source(h1,etm))) == CGAL::POSITIVE)
           {
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE
+            verbose_fail_msg(5, p);
+#endif
             return false;
           }
           return true;
@@ -251,6 +288,9 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map i
         else
         {
           // TODO: 2 identical border vertices, no common edge on the boundary. Not sure what to do
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE
+          verbose_fail_msg(6, p);
+#endif
           return false;
         }
       }

From 85368c43c6258e67aca26af6985fb57884642901 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 2 Jan 2023 19:38:10 +0100
Subject: [PATCH 0151/1398] use all vertices in the check

---
 .../Polygon_mesh_processing/autorefinement.h  | 79 ++++++-------------
 1 file changed, 23 insertions(+), 56 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 8dd8d28fcfcc..fd5e7312c263 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -173,13 +173,6 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map i
   Exact_mesh etm;
   orient_polygon_soup(soup_points, soup_triangles);
   polygon_soup_to_polygon_mesh(soup_points, soup_triangles, etm);
-  typename Exact_mesh::Property_map<typename Exact_mesh::Vertex_index, bool> is_border_map =
-    etm.template add_property_map<typename Exact_mesh::Vertex_index, bool>("v:is_border", false).first;
-  for(typename Exact_mesh::Halfedge_index h : etm.halfedges())
-  {
-    if (CGAL::is_border(h, etm))
-      is_border_map[target(h, etm)] = true;
-  }
 
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE
   std::cerr << std::setprecision(17);
@@ -197,41 +190,27 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map i
   {
     typename Exact_mesh::Halfedge_index h1 = etm.halfedge(p.first), h2=etm.halfedge(p.second);
 
-    boost::container::small_vector<typename Exact_mesh::Halfedge_index, 3> bv1;
-    if (is_border_map[source(h1, etm)]) bv1.push_back(prev(h1, etm));
-    if (is_border_map[target(h1, etm)]) bv1.push_back(h1);
-    if (is_border_map[target(next(h1, etm), etm)]) bv1.push_back(next(h1, etm));
-    if (bv1.empty())
-    {
-#ifdef CGAL_DEBUG_PMP_AUTOREFINE
-      verbose_fail_msg(1, p);
-#endif
-      return false;
-    }
+    boost::container::small_vector<typename Exact_mesh::Halfedge_index, 3> v1;
+    v1.push_back(prev(h1, etm));
+    v1.push_back(h1);
+    v1.push_back(next(h1, etm));
 
-    boost::container::small_vector<typename Exact_mesh::Halfedge_index, 3> bv2;
-    if (is_border_map[source(h2, etm)]) bv2.push_back(prev(h2, etm));
-    if (is_border_map[target(h2, etm)]) bv2.push_back(h2);
-    if (is_border_map[target(next(h2, etm), etm)]) bv2.push_back(next(h2, etm));
-    if (bv2.empty())
-    {
-#ifdef CGAL_DEBUG_PMP_AUTOREFINE
-      verbose_fail_msg(2, p);
-#endif
-      return false;
-    }
+    boost::container::small_vector<typename Exact_mesh::Halfedge_index, 3> v2;
+    v2.push_back(prev(h2, etm));
+    v2.push_back(h2);
+    v2.push_back(next(h2, etm));
 
-    //collect identical border vertices
+    //collect identical vertices
     boost::container::small_vector<std::pair<typename Exact_mesh::Halfedge_index, typename Exact_mesh::Halfedge_index>, 3> common;
-    for(typename Exact_mesh::Halfedge_index h1 : bv1)
-      for(typename Exact_mesh::Halfedge_index h2 : bv2)
+    for(typename Exact_mesh::Halfedge_index h1 : v1)
+      for(typename Exact_mesh::Halfedge_index h2 : v2)
         if (etm.point(target(h1, etm))==etm.point(target(h2,etm)))
           common.push_back(std::make_pair(h1,h2));
 
     if (common.empty())
     {
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE
-      verbose_fail_msg(3, p);
+      verbose_fail_msg(1, p);
 #endif
       return false;
     }
@@ -254,7 +233,7 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map i
         if(do_intersect(t1, s2) || do_intersect(t2, s1))
         {
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE
-          verbose_fail_msg(4, p);
+          verbose_fail_msg(2, p);
 #endif
           return false;
         }
@@ -266,33 +245,21 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map i
         h1 = next(common[0].first, etm) == common[1].first ? common[1].first : common[0].first;
         h2 = next(common[0].second, etm) == common[1].second ? common[1].second : common[0].second;
 
-        if ( is_border(etm.opposite(h1), etm) &&
-             is_border(etm.opposite(h2), etm) )
+        if( CGAL::coplanar(etm.point(source(h1,etm)),
+                           etm.point(target(h1,etm)),
+                           etm.point(target(etm.next(h1),etm)),
+                           etm.point(source(h1,etm))) &&
+            CGAL::coplanar_orientation(etm.point(source(h1,etm)),
+                           etm.point(target(h1,etm)),
+                           etm.point(target(etm.next(h1),etm)),
+                           etm.point(source(h1,etm))) == CGAL::POSITIVE)
         {
-          if( CGAL::coplanar(etm.point(source(h1,etm)),
-                             etm.point(target(h1,etm)),
-                             etm.point(target(etm.next(h1),etm)),
-                             etm.point(source(h1,etm))) &&
-              CGAL::coplanar_orientation(etm.point(source(h1,etm)),
-                             etm.point(target(h1,etm)),
-                             etm.point(target(etm.next(h1),etm)),
-                             etm.point(source(h1,etm))) == CGAL::POSITIVE)
-          {
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE
-            verbose_fail_msg(5, p);
-#endif
-            return false;
-          }
-          return true;
-        }
-        else
-        {
-          // TODO: 2 identical border vertices, no common edge on the boundary. Not sure what to do
-#ifdef CGAL_DEBUG_PMP_AUTOREFINE
-          verbose_fail_msg(6, p);
+          verbose_fail_msg(3, p);
 #endif
           return false;
         }
+        return true;
       }
       default: // size == 3
         return true;

From 944475f169213f38a04637480f0be7aaa080b98c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 2 Jan 2023 19:38:38 +0100
Subject: [PATCH 0152/1398] triangulate input faces

---
 .../examples/Polygon_mesh_processing/soup_autorefinement.cpp    | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index fa1f5d686907..8ca983aa31c3 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -5,6 +5,7 @@
 #include <CGAL/Polygon_mesh_processing/repair_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
 #include <CGAL/IO/polygon_soup_io.h>
 
 #include <iostream>
@@ -30,6 +31,7 @@ int main(int argc, char** argv)
   Mesh mesh;
   PMP::orient_polygon_soup(input_points, input_triangles);
   PMP::polygon_soup_to_polygon_mesh(input_points, input_triangles, mesh);
+  PMP::triangulate_faces(mesh);
 
   PMP::autorefine(mesh);
 

From 2b77fcd094859cd07853b1ae02434b05d5a277a1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 3 Jan 2023 18:22:14 +0100
Subject: [PATCH 0153/1398] faster implementation + fix intersection segments +
 check

---
 .../Polygon_mesh_processing/autorefinement.h  | 246 ++++++++++--------
 1 file changed, 133 insertions(+), 113 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index fd5e7312c263..01188d4d6b14 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -19,6 +19,7 @@
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
 #include <CGAL/Polygon_mesh_processing/shape_predicates.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
+#include <CGAL/Constrained_triangulation_plus_2.h>
 #include <CGAL/Projection_traits_3.h>
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 
@@ -26,7 +27,7 @@
 #include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
 
-#ifndef NDEBUG
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE
 // debug
 #include <CGAL/Surface_mesh.h>
 #endif
@@ -46,12 +47,42 @@ void generate_subtriangles(const typename EK::Triangle_3& t,
                            std::vector<typename EK::Triangle_3>& new_triangles)
 {
   typedef CGAL::Projection_traits_3<EK> P_traits;
-  // typedef CGAL::Exact_intersections_tag Itag;
-  typedef CGAL::No_constraint_intersection_requiring_constructions_tag Itag;
-  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits, Default, Itag> CDT;
-
-
-  P_traits cdt_traits(normal(t[0], t[1], t[2]));
+  typedef CGAL::Exact_intersections_tag Itag;
+  //typedef CGAL::No_constraint_intersection_requiring_constructions_tag Itag;
+  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits, Default, Itag> CDT_base;
+  typedef CGAL::Constrained_triangulation_plus_2<CDT_base> CDT;
+
+  typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
+  //~ bool orientation_flipped = false;
+  //~ if (n.x() < 0)
+  //~ {
+    //~ orientation_flipped = true;
+    //~ n = -n;
+  //~ }
+  //~ else
+  //~ {
+    //~ if (n.x()==0)
+    //~ {
+      //~ if (n.y() < 0)
+      //~ {
+        //~ orientation_flipped = true;
+        //~ n = -n;
+      //~ }
+      //~ else
+      //~ {
+        //~ if (n.y()==0)
+        //~ {
+          //~ if (n.z() < 0)
+          //~ {
+            //~ orientation_flipped = true;
+            //~ n = -n;
+          //~ }
+        //~ }
+      //~ }
+    //~ }
+  //~ }
+
+  P_traits cdt_traits(n);
   CDT cdt(cdt_traits);
 
   cdt.insert_outside_affine_hull(t[0]);
@@ -65,12 +96,41 @@ void generate_subtriangles(const typename EK::Triangle_3& t,
   for (const typename EK::Point_3& p : points)
     cdt.insert(p);
 
-  for (typename CDT::Face_handle fh : cdt.finite_face_handles())
-  {
-    new_triangles.emplace_back(fh->vertex(0)->point(),
-                               fh->vertex(cdt.ccw(0))->point(),
-                               fh->vertex(cdt.cw(0))->point());
-  }
+  //~ if (orientation_flipped)
+    //~ for (typename CDT::Face_handle fh : cdt.finite_face_handles())
+    //~ {
+      //~ new_triangles.emplace_back(fh->vertex(0)->point(),
+                                 //~ fh->vertex(cdt.cw(0))->point(),
+                                 //~ fh->vertex(cdt.ccw(0))->point());
+    //~ }
+  //~ else
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS
+    static int k = 0;
+    std::stringstream buffer;
+    buffer.precision(17);
+    int nbt=0;
+#endif
+    for (typename CDT::Face_handle fh : cdt.finite_face_handles())
+    {
+      new_triangles.emplace_back(fh->vertex(0)->point(),
+                                 fh->vertex(cdt.ccw(0))->point(),
+                                 fh->vertex(cdt.cw(0))->point());
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS
+      ++nbt;
+      buffer << fh->vertex(0)->point() << "\n";
+      buffer << fh->vertex(cdt.ccw(0))->point() << "\n";
+      buffer << fh->vertex(cdt.cw(0))->point() << "\n";
+#endif
+    }
+
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS
+    std::ofstream dump("triangulation_"+std::to_string(k)+".off");
+    dump << "OFF\n" << 3*nbt << " " << nbt << " 0\n";
+    dump << buffer.str();
+    for (int i=0; i<nbt; ++i)
+      dump << "3 " << 3*i << " " << 3*i+1 << " " << 3*i+2 << "\n";
+    ++k;
+#endif
 }
 
 template <class EK>
@@ -106,69 +166,31 @@ struct Intersection_visitor
 
   void operator()(const typename EK::Triangle_3& t)
   {
-    for (std::size_t i=1; i<3; ++i)
+    for (std::size_t i=0; i<3; ++i)
     {
-      typename EK::Segment_3 s(t[i-1], t[i]);
+      typename EK::Segment_3 s(t[i], t[(i+1)%3]);
       all_segments_1.push_back(s);
       all_segments_2.push_back(s);
     }
+
   }
 
   void operator()(const std::vector<typename EK::Point_3>& poly)
   {
     std::size_t nbp = poly.size();
-    for (std::size_t i=1; i<nbp; ++i)
+    for (std::size_t i=0; i<nbp; ++i)
     {
-      typename EK::Segment_3 s(poly[i-1], poly[i]);
+      typename EK::Segment_3 s(poly[i], poly[(i+1)%nbp]);
       all_segments_1.push_back(s);
       all_segments_2.push_back(s);
     }
   }
 };
 
-template <class EK, class TriangleMesh, class VPM, class TID_Map, class Is_degen_map>
-bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map is_degen, const std::vector< std::vector<Triangle_3<EK>>>& triangles)
+template <class EK>
+bool is_output_valid(std::vector<Point_3<EK>> soup_points,
+                     std::vector<std::array<std::size_t, 3> > soup_triangles)
 {
-  typedef typename Kernel_traits<typename boost::property_traits<VPM>::value_type>::type IK;
-  typedef boost::graph_traits<TriangleMesh> Graph_traits;
-  typedef typename Graph_traits::face_descriptor face_descriptor;
-  typedef typename Graph_traits::halfedge_descriptor halfedge_descriptor;
-
-  std::vector<typename EK::Point_3> soup_points;
-  std::vector<std::array<std::size_t, 3> > soup_triangles;
-  Cartesian_converter<IK, EK> to_exact;
-  std::map<typename EK::Point_3, std::size_t> point_id_map;
-
-  auto get_point_id = [&](const typename EK::Point_3& pt)
-  {
-    auto insert_res = point_id_map.insert(std::make_pair(pt, soup_points.size()));
-    if (insert_res.second)
-      soup_points.push_back(pt);
-    return insert_res.first->second;
-  };
-
-  for (face_descriptor f : faces(tm))
-  {
-    if (get(is_degen, f)) continue; // skip degenerate faces
-    int tid = get(tid_map, f);
-    if (tid == -1)
-    {
-      halfedge_descriptor h = halfedge(f, tm);
-      soup_triangles.emplace_back(
-        CGAL::make_array(get_point_id(to_exact(get(vpm,source(h, tm)))),
-                         get_point_id(to_exact(get(vpm,target(h, tm)))),
-                         get_point_id(to_exact(get(vpm,target(next(h, tm), tm)))))
-      );
-    }
-    else
-    {
-      for (const typename EK::Triangle_3& t : triangles[tid])
-      {
-        soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
-      }
-    }
-  }
-
   typedef Surface_mesh<typename EK::Point_3> Exact_mesh;
   Exact_mesh etm;
   orient_polygon_soup(soup_points, soup_triangles);
@@ -248,11 +270,11 @@ bool is_output_valid(TriangleMesh& tm , VPM vpm, TID_Map tid_map, Is_degen_map i
         if( CGAL::coplanar(etm.point(source(h1,etm)),
                            etm.point(target(h1,etm)),
                            etm.point(target(etm.next(h1),etm)),
-                           etm.point(source(h1,etm))) &&
+                           etm.point(target(etm.next(h2),etm))) &&
             CGAL::coplanar_orientation(etm.point(source(h1,etm)),
                            etm.point(target(h1,etm)),
                            etm.point(target(etm.next(h1),etm)),
-                           etm.point(source(h1,etm))) == CGAL::POSITIVE)
+                           etm.point(target(etm.next(h2),etm))) == CGAL::POSITIVE)
         {
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE
           verbose_fail_msg(3, p);
@@ -346,18 +368,22 @@ void autorefine_soup_output(const TriangleMesh& tm,
 
   // init the vector of triangles used for the autorefinement of triangles
   typedef CGAL::Exact_predicates_exact_constructions_kernel EK;
-  std::vector< std::vector<EK::Triangle_3> > triangles(tid+1);
+  std::vector< EK::Triangle_3 > triangles(tid+1);
   Cartesian_converter<GT, EK> to_exact;
 
   for(face_descriptor f : intersected_faces)
   {
     halfedge_descriptor h = halfedge(f, tm);
-    triangles[get(tid_map, f)].emplace_back(
+    triangles[get(tid_map, f)]= EK::Triangle_3(
       to_exact( get(vpm, source(h, tm)) ),
       to_exact( get(vpm, target(h, tm)) ),
       to_exact( get(vpm, target(next(h, tm), tm)) ) );
   }
 
+  std::vector< std::vector<EK::Segment_3> > all_segments(triangles.size());
+  std::vector< std::vector<EK::Point_3> > all_points(triangles.size());
+
+
   typename EK::Intersect_3 intersection = EK().intersect_3_object();
   for (const Pair_of_faces& p : si_pairs)
   {
@@ -366,73 +392,59 @@ void autorefine_soup_output(const TriangleMesh& tm,
 
     if (i1==-1 || i2==-1) continue; //skip degenerate faces
 
-    std::size_t nbt_1 = triangles[i1].size(),
-                nbt_2 = triangles[i2].size();
+    const EK::Triangle_3& t1 = triangles[i1];
+    const EK::Triangle_3& t2 = triangles[i2];
 
-    std::vector< std::vector<EK::Segment_3> > all_segments_1(nbt_1);
-    std::vector< std::vector<EK::Segment_3> > all_segments_2(nbt_2);
-    std::vector< std::vector<EK::Point_3> > all_points_1(nbt_1);
-    std::vector< std::vector<EK::Point_3> > all_points_2(nbt_2);
+    auto inter = intersection(t1, t2);
 
-    std::vector <EK::Triangle_3> t1_subtriangles, t2_subtriangles;
-    for (std::size_t it1=0; it1<nbt_1; ++it1)
+    if (inter != boost::none)
     {
-      for (std::size_t it2=0; it2<nbt_2; ++it2)
-      {
-        const EK::Triangle_3& t1 = triangles[i1][it1];
-        const EK::Triangle_3& t2 = triangles[i2][it2];
-
-        auto inter = intersection(t1, t2);
-
-        if (inter != boost::none)
-        {
-          autorefine_impl::Intersection_visitor<EK> intersection_visitor(all_segments_1[it1],  all_segments_2[it2],
-                                                                         all_points_1[it1], all_points_2[it2]);
+      autorefine_impl::Intersection_visitor<EK> intersection_visitor(all_segments[i1],  all_segments[i2],
+                                                                     all_points[i1], all_points[i2]);
 
-          boost::apply_visitor(intersection_visitor, *inter);
-        }
-      }
+      boost::apply_visitor(intersection_visitor, *inter);
     }
+  }
 
-    // now refine triangles
-    std::vector<EK::Triangle_3> new_triangles;
-    for(std::size_t it1=0; it1<nbt_1; ++it1)
-    {
-      if (all_segments_1[it1].empty() && all_points_1[it1].empty())
-        new_triangles.push_back(triangles[i1][it1]);
-      else
-        autorefine_impl::generate_subtriangles<EK>(triangles[i1][it1], all_segments_1[it1], all_points_1[it1], new_triangles);
-    }
-    triangles[i1].swap(new_triangles);
-    new_triangles.clear();
-    for(std::size_t it2=0; it2<nbt_2; ++it2)
-    {
-      if (all_segments_2[it2].empty() && all_points_2[it2].empty())
-        new_triangles.push_back(triangles[i2][it2]);
-      else
-        autorefine_impl::generate_subtriangles<EK>(triangles[i2][it2], all_segments_2[it2], all_points_2[it2], new_triangles);
-    }
-    triangles[i2].swap(new_triangles);
+  // now refine triangles
+  std::vector<EK::Triangle_3> new_triangles;
+  for(std::size_t ti=0; ti<triangles.size(); ++ti)
+  {
+    if (all_segments[ti].empty() && all_points[ti].empty())
+      new_triangles.push_back(triangles[ti]);
+    else
+      autorefine_impl::generate_subtriangles<EK>(triangles[ti], all_segments[ti], all_points[ti], new_triangles);
   }
 
-  CGAL_assertion( autorefine_impl::is_output_valid(tm, vpm, tid_map, is_degen, triangles) );
 
   // brute force output: create a soup, orient and to-mesh
-  // WARNING: there is no reason when using double that identical exact points are identical in double
   Cartesian_converter<EK, GT> to_input;
   std::map<EK::Point_3, std::size_t> point_id_map;
+#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
+  std::vector<EK::Point_3> exact_soup_points;
+#endif
 
   for (vertex_descriptor v : vertices(tm))
   {
     if (point_id_map.insert(std::make_pair(to_exact(get(vpm,v)), soup_points.size())).second)
+    {
       soup_points.push_back(get(vpm,v));
+#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
+      exact_soup_points.push_back(to_exact(get(vpm,v)));
+#endif
+    }
   }
 
   auto get_point_id = [&](const typename EK::Point_3& pt)
   {
     auto insert_res = point_id_map.insert(std::make_pair(pt, soup_points.size()));
     if (insert_res.second)
+    {
       soup_points.push_back(to_input(pt));
+#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
+      exact_soup_points.push_back(pt);
+#endif
+    }
     return insert_res.first->second;
   };
 
@@ -450,14 +462,22 @@ void autorefine_soup_output(const TriangleMesh& tm,
                          get_point_id(to_exact(get(vpm,target(next(h, tm), tm)))))
       );
     }
-    else
-    {
-      for (const typename EK::Triangle_3& t : triangles[tid])
-      {
-        soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
-      }
-    }
   }
+  for (const typename EK::Triangle_3& t : new_triangles)
+  {
+    soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
+  }
+
+
+#ifndef CGAL_NDEBUG
+  CGAL_assertion( autorefine_impl::is_output_valid(exact_soup_points, soup_triangles) );
+#endif
+
+#ifdef CGAL_DEBUG_PMP_AUTOREFINE
+  autorefine_impl::is_output_valid(exact_soup_points, soup_triangles);
+    throw std::runtime_error("invalid output");
+#endif
+
 }
 #endif
 

From d92d37c476c40e909db3b8a27b20e3968c4e1f28 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 3 Jan 2023 18:44:52 +0100
Subject: [PATCH 0154/1398] fix condition

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 01188d4d6b14..d18826fc2f1e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -474,7 +474,7 @@ void autorefine_soup_output(const TriangleMesh& tm,
 #endif
 
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE
-  autorefine_impl::is_output_valid(exact_soup_points, soup_triangles);
+  if (!autorefine_impl::is_output_valid(exact_soup_points, soup_triangles))
     throw std::runtime_error("invalid output");
 #endif
 

From 34e8d7ee420489459d88a90a83a277cc9e071caa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 4 Jan 2023 16:51:55 +0100
Subject: [PATCH 0155/1398] disable CDT+ that is slower and add debug

---
 .../Polygon_mesh_processing/autorefinement.h  | 21 +++++++++++++++----
 1 file changed, 17 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index d18826fc2f1e..3ec807450421 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -32,6 +32,10 @@
 #include <CGAL/Surface_mesh.h>
 #endif
 
+#ifndef CGAL_PMP_AUTOREFINE_VERBOSE
+#define CGAL_PMP_AUTOREFINE_VERBOSE(MSG)
+#endif
+
 #include <vector>
 
 namespace CGAL {
@@ -49,8 +53,12 @@ void generate_subtriangles(const typename EK::Triangle_3& t,
   typedef CGAL::Projection_traits_3<EK> P_traits;
   typedef CGAL::Exact_intersections_tag Itag;
   //typedef CGAL::No_constraint_intersection_requiring_constructions_tag Itag;
-  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits, Default, Itag> CDT_base;
-  typedef CGAL::Constrained_triangulation_plus_2<CDT_base> CDT;
+
+
+  //typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits, Default, Itag> CDT_base;
+  //typedef CGAL::Constrained_triangulation_plus_2<CDT_base> CDT;
+
+  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits, Default, Itag> CDT;
 
   typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
   //~ bool orientation_flipped = false;
@@ -329,6 +337,7 @@ void autorefine_soup_output(const TriangleMesh& tm,
   std::vector<Pair_of_faces> si_pairs;
 
   // collect intersecting pairs of triangles
+  CGAL_PMP_AUTOREFINE_VERBOSE("collect intersecting pairs");
   self_intersections<Concurrency_tag>(tm, std::back_inserter(si_pairs), np);
 
   if (si_pairs.empty()) return;
@@ -384,6 +393,7 @@ void autorefine_soup_output(const TriangleMesh& tm,
   std::vector< std::vector<EK::Point_3> > all_points(triangles.size());
 
 
+  CGAL_PMP_AUTOREFINE_VERBOSE("compute intersections");
   typename EK::Intersect_3 intersection = EK().intersect_3_object();
   for (const Pair_of_faces& p : si_pairs)
   {
@@ -406,6 +416,7 @@ void autorefine_soup_output(const TriangleMesh& tm,
     }
   }
 
+  CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
   // now refine triangles
   std::vector<EK::Triangle_3> new_triangles;
   for(std::size_t ti=0; ti<triangles.size(); ++ti)
@@ -418,6 +429,7 @@ void autorefine_soup_output(const TriangleMesh& tm,
 
 
   // brute force output: create a soup, orient and to-mesh
+  CGAL_PMP_AUTOREFINE_VERBOSE("create output soup");
   Cartesian_converter<EK, GT> to_input;
   std::map<EK::Point_3, std::size_t> point_id_map;
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
@@ -468,16 +480,17 @@ void autorefine_soup_output(const TriangleMesh& tm,
     soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
   }
 
-
 #ifndef CGAL_NDEBUG
+  CGAL_PMP_AUTOREFINE_VERBOSE("check soup");
   CGAL_assertion( autorefine_impl::is_output_valid(exact_soup_points, soup_triangles) );
 #endif
 
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE
+  CGAL_PMP_AUTOREFINE_VERBOSE("check soup");
   if (!autorefine_impl::is_output_valid(exact_soup_points, soup_triangles))
     throw std::runtime_error("invalid output");
 #endif
-
+  CGAL_PMP_AUTOREFINE_VERBOSE("done");
 }
 #endif
 

From e94c7be4aa72ca2b481e15265ec30f5bad92abec Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 5 Jan 2023 08:44:32 +0100
Subject: [PATCH 0156/1398] update doc + TODOs

---
 .../Polygon_mesh_processing/autorefinement.h  | 31 +++----------------
 1 file changed, 4 insertions(+), 27 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 3ec807450421..0711ad71e21c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1,3 +1,5 @@
+//TODO: add for soup face the id of the input face. not sure it is easy to report intersection edge as a pair of vertex id
+
 // Copyright (c) 2023 GeometryFactory (France).
 // All rights reserved.
 //
@@ -347,6 +349,7 @@ void autorefine_soup_output(const TriangleMesh& tm,
   typedef typename boost::property_map<TriangleMesh, Degen_property_tag>::const_type Is_degen_map;
   Is_degen_map is_degen = get(Degen_property_tag(), tm);
 
+// TODO: we already have this test in bbox inter when it report (f,f)
   for(face_descriptor f : faces(tm))
     put(is_degen, f, is_degenerate_triangle_face(f, tm, np));
 
@@ -496,10 +499,7 @@ void autorefine_soup_output(const TriangleMesh& tm,
 
 /**
  * \ingroup PMP_corefinement_grp
- * \link coref_def_subsec autorefines \endlink `tm`. Refines a triangle mesh
- * so that no triangles intersects in their interior.
- * Self-intersection edges will be marked as constrained. If an edge that was marked as
- * constrained is split, its sub-edges will be marked as constrained as well.
+ * refines a triangle mesh so that no triangles intersects in their interior.
  *
  * @tparam TriangleMesh a model of `HalfedgeListGraph`, `FaceListGraph`, and `MutableFaceGraph`
  * @tparam NamedParameters a sequence of \ref namedparameters
@@ -524,29 +524,6 @@ void autorefine_soup_output(const TriangleMesh& tm,
  *                     must be available in `TriangleMesh`.}
  *  \cgalParamNEnd
  *
- *   \cgalParamNBegin{edge_is_constrained_map}
- *     \cgalParamDescription{a property map containing the constrained-or-not status of each edge of `tm`}
- *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%edge_descriptor`
- *                    as key type and `bool` as value type}
- *     \cgalParamDefault{a constant property map returning `false` for any edge}
- *   \cgalParamNEnd
- *
- *   \cgalParamNBegin{face_index_map}
- *     \cgalParamDescription{a property map associating to each face of `tm` a unique index between `0` and `num_faces(tm) - 1`}
- *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%face_descriptor`
- *                    as key type and `std::size_t` as value type}
- *     \cgalParamDefault{an automatically indexed internal map}
- *     \cgalParamExtra{If the property map is writable, the indices of the faces of `tm1` and `tm2`
- *                     will be set after the corefinement is done.}
- *   \cgalParamNEnd
- *
- *   \cgalParamNBegin{visitor}
- *     \cgalParamDescription{a visitor used to track the creation of new faces}
- *     \cgalParamType{a class model of `PMPCorefinementVisitor`}
- *     \cgalParamDefault{`Corefinement::Default_visitor<TriangleMesh>`}
- *   \cgalParamNEnd
- * \cgalNamedParamsEnd
- *
  */
 template <class TriangleMesh,
           class NamedParameters = parameters::Default_named_parameters>

From 370d9134a08db1f422e6038dfa7e94ea695efea2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 9 Jan 2023 17:59:56 +0100
Subject: [PATCH 0157/1398] use insertion by range

---
 .../CGAL/Polygon_mesh_processing/autorefinement.h   | 13 ++++---------
 1 file changed, 4 insertions(+), 9 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 0711ad71e21c..b2786386205f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -54,13 +54,10 @@ void generate_subtriangles(const typename EK::Triangle_3& t,
 {
   typedef CGAL::Projection_traits_3<EK> P_traits;
   typedef CGAL::Exact_intersections_tag Itag;
-  //typedef CGAL::No_constraint_intersection_requiring_constructions_tag Itag;
 
-
-  //typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits, Default, Itag> CDT_base;
+  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits, Default, Itag> CDT_2;
   //typedef CGAL::Constrained_triangulation_plus_2<CDT_base> CDT;
-
-  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits, Default, Itag> CDT;
+  typedef CDT_2 CDT;
 
   typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
   //~ bool orientation_flipped = false;
@@ -100,11 +97,9 @@ void generate_subtriangles(const typename EK::Triangle_3& t,
   typename CDT::Vertex_handle v = cdt.tds().insert_dim_up(cdt.infinite_vertex(), false);
   v->set_point(t[2]);
 
-  for (const typename EK::Segment_3& s : segments)
-    cdt.insert_constraint(s[0], s[1]);
+  cdt.insert_constraints(segments.begin(), segments.end());
+  cdt.insert(points.begin(), points.end());
 
-  for (const typename EK::Point_3& p : points)
-    cdt.insert(p);
 
   //~ if (orientation_flipped)
     //~ for (typename CDT::Face_handle fh : cdt.finite_face_handles())

From 9ba370a22902afb08d0af7629b7383bba785ac57 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 10 Jan 2023 14:40:02 +0100
Subject: [PATCH 0158/1398] use a canonical orientation

---
 .../Polygon_mesh_processing/autorefinement.h  | 58 ++++++-------------
 1 file changed, 17 insertions(+), 41 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index b2786386205f..881ffcc8796b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -60,55 +60,26 @@ void generate_subtriangles(const typename EK::Triangle_3& t,
   typedef CDT_2 CDT;
 
   typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
-  //~ bool orientation_flipped = false;
-  //~ if (n.x() < 0)
-  //~ {
-    //~ orientation_flipped = true;
-    //~ n = -n;
-  //~ }
-  //~ else
-  //~ {
-    //~ if (n.x()==0)
-    //~ {
-      //~ if (n.y() < 0)
-      //~ {
-        //~ orientation_flipped = true;
-        //~ n = -n;
-      //~ }
-      //~ else
-      //~ {
-        //~ if (n.y()==0)
-        //~ {
-          //~ if (n.z() < 0)
-          //~ {
-            //~ orientation_flipped = true;
-            //~ n = -n;
-          //~ }
-        //~ }
-      //~ }
-    //~ }
-  //~ }
+  typename EK::Point_3 o(0,0,0);
+
+  bool orientation_flipped = false;
+  if ( typename EK::Less_xyz_3()(o+n,o) )
+  {
+    n=-n;
+    orientation_flipped = true;
+  }
 
   P_traits cdt_traits(n);
   CDT cdt(cdt_traits);
 
   cdt.insert_outside_affine_hull(t[0]);
   cdt.insert_outside_affine_hull(t[1]);
-  typename CDT::Vertex_handle v = cdt.tds().insert_dim_up(cdt.infinite_vertex(), false);
+  typename CDT::Vertex_handle v = cdt.tds().insert_dim_up(cdt.infinite_vertex(), orientation_flipped);
   v->set_point(t[2]);
 
   cdt.insert_constraints(segments.begin(), segments.end());
   cdt.insert(points.begin(), points.end());
 
-
-  //~ if (orientation_flipped)
-    //~ for (typename CDT::Face_handle fh : cdt.finite_face_handles())
-    //~ {
-      //~ new_triangles.emplace_back(fh->vertex(0)->point(),
-                                 //~ fh->vertex(cdt.cw(0))->point(),
-                                 //~ fh->vertex(cdt.ccw(0))->point());
-    //~ }
-  //~ else
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS
     static int k = 0;
     std::stringstream buffer;
@@ -117,9 +88,14 @@ void generate_subtriangles(const typename EK::Triangle_3& t,
 #endif
     for (typename CDT::Face_handle fh : cdt.finite_face_handles())
     {
-      new_triangles.emplace_back(fh->vertex(0)->point(),
-                                 fh->vertex(cdt.ccw(0))->point(),
-                                 fh->vertex(cdt.cw(0))->point());
+      if (orientation_flipped)
+        new_triangles.emplace_back(fh->vertex(0)->point(),
+                                   fh->vertex(cdt.cw(0))->point(),
+                                   fh->vertex(cdt.ccw(0))->point());
+      else
+        new_triangles.emplace_back(fh->vertex(0)->point(),
+                                   fh->vertex(cdt.ccw(0))->point(),
+                                   fh->vertex(cdt.cw(0))->point());
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS
       ++nbt;
       buffer << fh->vertex(0)->point() << "\n";

From f9668e279f5f7f2acb49a735adb9f6c15e110841 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 11 Jan 2023 11:14:05 +0100
Subject: [PATCH 0159/1398] use self-intersection test for soup for checking
 the validity of the output

on some cases it seems twice faster
---
 .../Polygon_mesh_processing/autorefinement.h  | 122 +-----------------
 1 file changed, 4 insertions(+), 118 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 881ffcc8796b..9393e197a195 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -29,11 +29,6 @@
 #include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
 
-#ifdef CGAL_DEBUG_PMP_AUTOREFINE
-// debug
-#include <CGAL/Surface_mesh.h>
-#endif
-
 #ifndef CGAL_PMP_AUTOREFINE_VERBOSE
 #define CGAL_PMP_AUTOREFINE_VERBOSE(MSG)
 #endif
@@ -168,115 +163,6 @@ struct Intersection_visitor
   }
 };
 
-template <class EK>
-bool is_output_valid(std::vector<Point_3<EK>> soup_points,
-                     std::vector<std::array<std::size_t, 3> > soup_triangles)
-{
-  typedef Surface_mesh<typename EK::Point_3> Exact_mesh;
-  Exact_mesh etm;
-  orient_polygon_soup(soup_points, soup_triangles);
-  polygon_soup_to_polygon_mesh(soup_points, soup_triangles, etm);
-
-#ifdef CGAL_DEBUG_PMP_AUTOREFINE
-  std::cerr << std::setprecision(17);
-  auto verbose_fail_msg = [&](int i, const std::pair<typename Exact_mesh::Face_index, typename Exact_mesh::Face_index>& p)
-  {
-    typename Exact_mesh::Halfedge_index h1 = halfedge(p.first, etm), h2 = halfedge(p.second, etm);
-    std::cerr << "DEBUG: failing at check #" << i << "\n";
-    std::cerr << "DEBUG: " << etm.point(source(h1, etm)) << " " <<  etm.point(target(h1, etm)) << " " <<  etm.point(target(next(h1, etm), etm)) << " " << etm.point(source(h1, etm)) << "\n";
-    std::cerr << "DEBUG: " << etm.point(source(h2, etm)) << " " <<  etm.point(target(h2, etm)) << " " <<  etm.point(target(next(h2, etm), etm)) << " " << etm.point(source(h2, etm)) << "\n";
-  };
-#endif
-
-  //TODO: double check me
-  auto skip_faces = [&](const std::pair<typename Exact_mesh::Face_index, typename Exact_mesh::Face_index>& p)
-  {
-    typename Exact_mesh::Halfedge_index h1 = etm.halfedge(p.first), h2=etm.halfedge(p.second);
-
-    boost::container::small_vector<typename Exact_mesh::Halfedge_index, 3> v1;
-    v1.push_back(prev(h1, etm));
-    v1.push_back(h1);
-    v1.push_back(next(h1, etm));
-
-    boost::container::small_vector<typename Exact_mesh::Halfedge_index, 3> v2;
-    v2.push_back(prev(h2, etm));
-    v2.push_back(h2);
-    v2.push_back(next(h2, etm));
-
-    //collect identical vertices
-    boost::container::small_vector<std::pair<typename Exact_mesh::Halfedge_index, typename Exact_mesh::Halfedge_index>, 3> common;
-    for(typename Exact_mesh::Halfedge_index h1 : v1)
-      for(typename Exact_mesh::Halfedge_index h2 : v2)
-        if (etm.point(target(h1, etm))==etm.point(target(h2,etm)))
-          common.push_back(std::make_pair(h1,h2));
-
-    if (common.empty())
-    {
-#ifdef CGAL_DEBUG_PMP_AUTOREFINE
-      verbose_fail_msg(1, p);
-#endif
-      return false;
-    }
-
-    switch (common.size())
-    {
-      case 1:
-      {
-        // geometric check if the opposite segments intersect the triangles
-        const typename EK::Triangle_3 t1(etm.point(source(h1,etm)),
-                                         etm.point(target(h1,etm)),
-                                         etm.point(target(next(h1,etm),etm)));
-        const typename EK::Triangle_3 t2(etm.point(source(h2,etm)),
-                                         etm.point(target(h2,etm)),
-                                         etm.point(target(next(h2,etm),etm)));
-
-        const typename EK::Segment_3 s1(etm.point(source(common[0].first,etm)), etm.point(target(next(common[0].first,etm),etm)));
-        const typename EK::Segment_3 s2(etm.point(source(common[0].second,etm)), etm.point(target(next(common[0].second,etm),etm)));
-
-        if(do_intersect(t1, s2) || do_intersect(t2, s1))
-        {
-#ifdef CGAL_DEBUG_PMP_AUTOREFINE
-          verbose_fail_msg(2, p);
-#endif
-          return false;
-        }
-        return true;
-      }
-      case 2:
-      {
-        // shared edge
-        h1 = next(common[0].first, etm) == common[1].first ? common[1].first : common[0].first;
-        h2 = next(common[0].second, etm) == common[1].second ? common[1].second : common[0].second;
-
-        if( CGAL::coplanar(etm.point(source(h1,etm)),
-                           etm.point(target(h1,etm)),
-                           etm.point(target(etm.next(h1),etm)),
-                           etm.point(target(etm.next(h2),etm))) &&
-            CGAL::coplanar_orientation(etm.point(source(h1,etm)),
-                           etm.point(target(h1,etm)),
-                           etm.point(target(etm.next(h1),etm)),
-                           etm.point(target(etm.next(h2),etm))) == CGAL::POSITIVE)
-        {
-#ifdef CGAL_DEBUG_PMP_AUTOREFINE
-          verbose_fail_msg(3, p);
-#endif
-          return false;
-        }
-        return true;
-      }
-      default: // size == 3
-        return true;
-    }
-  };
-
-  std::vector< std::pair<typename Exact_mesh::Face_index, typename Exact_mesh::Face_index> > si_faces;
-  self_intersections(etm,
-                     CGAL::filter_output_iterator(std::back_inserter(si_faces),
-                     skip_faces));
-
-  return si_faces.empty();
-}
-
 } // end of autorefine_impl
 
 template <class TriangleMesh, class Point_3, class NamedParameters = parameters::Default_named_parameters>
@@ -456,13 +342,13 @@ void autorefine_soup_output(const TriangleMesh& tm,
 
 #ifndef CGAL_NDEBUG
   CGAL_PMP_AUTOREFINE_VERBOSE("check soup");
-  CGAL_assertion( autorefine_impl::is_output_valid(exact_soup_points, soup_triangles) );
-#endif
-
+  CGAL_assertion( !does_triangle_soup_self_intersect(exact_soup_points, soup_triangles) );
+#else
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE
   CGAL_PMP_AUTOREFINE_VERBOSE("check soup");
-  if (!autorefine_impl::is_output_valid(exact_soup_points, soup_triangles))
+  if (does_triangle_soup_self_intersect(exact_soup_points, soup_triangles))
     throw std::runtime_error("invalid output");
+#endif
 #endif
   CGAL_PMP_AUTOREFINE_VERBOSE("done");
 }

From 7d1582ddbb9ad7bf6e7d8872eb08101254b7e68a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 11 Jan 2023 14:00:32 +0100
Subject: [PATCH 0160/1398] avoid doing twice the degenerate test

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h   | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 9393e197a195..283e139eb1c6 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -206,9 +206,11 @@ void autorefine_soup_output(const TriangleMesh& tm,
   typedef typename boost::property_map<TriangleMesh, Degen_property_tag>::const_type Is_degen_map;
   Is_degen_map is_degen = get(Degen_property_tag(), tm);
 
-// TODO: we already have this test in bbox inter when it report (f,f)
   for(face_descriptor f : faces(tm))
-    put(is_degen, f, is_degenerate_triangle_face(f, tm, np));
+    put(is_degen, f, false);
+  for (const Pair_of_faces& p : si_pairs)
+    if (p.first==p.second) // bbox inter reports (f,f) for degenerate faces
+      put(is_degen, p.first, true);
 
   // assign an id per triangle involved in an intersection
   // + the faces involved in the intersection

From 822e65b3cf93b51855d14349d96cdbcf09cff85f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 13 Jan 2023 09:35:51 +0100
Subject: [PATCH 0161/1398] build visitor once for all

---
 .../Polygon_mesh_processing/autorefinement.h  | 50 +++++++++----------
 1 file changed, 25 insertions(+), 25 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 283e139eb1c6..ea1c0de07eba 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -54,6 +54,7 @@ void generate_subtriangles(const typename EK::Triangle_3& t,
   //typedef CGAL::Constrained_triangulation_plus_2<CDT_base> CDT;
   typedef CDT_2 CDT;
 
+  // positive triangle normal
   typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
   typename EK::Point_3 o(0,0,0);
 
@@ -112,32 +113,32 @@ void generate_subtriangles(const typename EK::Triangle_3& t,
 template <class EK>
 struct Intersection_visitor
 {
-  std::vector<typename EK::Segment_3>& all_segments_1;
-  std::vector<typename EK::Segment_3>& all_segments_2;
-  std::vector<typename EK::Point_3>& all_points_1;
-  std::vector<typename EK::Point_3>& all_points_2;
-
-  Intersection_visitor(std::vector<typename EK::Segment_3>& all_segments_1,
-                       std::vector<typename EK::Segment_3>& all_segments_2,
-                       std::vector<typename EK::Point_3>& all_points_1,
-                       std::vector<typename EK::Point_3>& all_points_2)
-    : all_segments_1(all_segments_1)
-    , all_segments_2(all_segments_2)
-    , all_points_1(all_points_1)
-    , all_points_2(all_points_2)
+  std::vector< std::vector<typename EK::Segment_3> >& all_segments;
+  std::vector< std::vector<typename EK::Point_3> >& all_points;
+  std::pair<int, int> ids;
+
+  Intersection_visitor(std::vector< std::vector<typename EK::Segment_3> >& all_segments,
+                       std::vector< std::vector<typename EK::Point_3> >& all_points)
+    : all_segments (all_segments)
+    , all_points(all_points)
   {}
 
+  void set_triangle_ids(int i1, int i2)
+  {
+    ids = {i1, i2};
+  }
+
   typedef void result_type;
   void operator()(const typename EK::Point_3& p)
   {
-    all_points_1.push_back(p);
-    all_points_2.push_back(p);
+    all_points[ids.first].push_back(p);
+    all_points[ids.second].push_back(p);
   }
 
   void operator()(const typename EK::Segment_3& s)
   {
-    all_segments_1.push_back(s);
-    all_segments_2.push_back(s);
+    all_segments[ids.first].push_back(s);
+    all_segments[ids.second].push_back(s);
   }
 
   void operator()(const typename EK::Triangle_3& t)
@@ -145,8 +146,8 @@ struct Intersection_visitor
     for (std::size_t i=0; i<3; ++i)
     {
       typename EK::Segment_3 s(t[i], t[(i+1)%3]);
-      all_segments_1.push_back(s);
-      all_segments_2.push_back(s);
+      all_segments[ids.first].push_back(s);
+      all_segments[ids.second].push_back(s);
     }
 
   }
@@ -157,8 +158,8 @@ struct Intersection_visitor
     for (std::size_t i=0; i<nbp; ++i)
     {
       typename EK::Segment_3 s(poly[i], poly[(i+1)%nbp]);
-      all_segments_1.push_back(s);
-      all_segments_2.push_back(s);
+      all_segments[ids.first].push_back(s);
+      all_segments[ids.second].push_back(s);
     }
   }
 };
@@ -254,9 +255,10 @@ void autorefine_soup_output(const TriangleMesh& tm,
   std::vector< std::vector<EK::Segment_3> > all_segments(triangles.size());
   std::vector< std::vector<EK::Point_3> > all_points(triangles.size());
 
-
   CGAL_PMP_AUTOREFINE_VERBOSE("compute intersections");
   typename EK::Intersect_3 intersection = EK().intersect_3_object();
+  autorefine_impl::Intersection_visitor<EK> intersection_visitor(all_segments, all_points);
+
   for (const Pair_of_faces& p : si_pairs)
   {
     int i1 = get(tid_map, p.first),
@@ -271,9 +273,7 @@ void autorefine_soup_output(const TriangleMesh& tm,
 
     if (inter != boost::none)
     {
-      autorefine_impl::Intersection_visitor<EK> intersection_visitor(all_segments[i1],  all_segments[i2],
-                                                                     all_points[i1], all_points[i2]);
-
+      intersection_visitor.set_triangle_ids(i1, i2);
       boost::apply_visitor(intersection_visitor, *inter);
     }
   }

From 9c2de3ee7974a1ccd5e72c73bbf60e03366d5523 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 13 Jan 2023 11:42:14 +0100
Subject: [PATCH 0162/1398] handle soup as input

---
 .../Polygon_mesh_processing/autorefinement.h  | 123 ++++++++----------
 1 file changed, 53 insertions(+), 70 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index ea1c0de07eba..290dde253324 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -28,6 +28,7 @@
 // output
 #include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+#include <CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h>
 
 #ifndef CGAL_PMP_AUTOREFINE_VERBOSE
 #define CGAL_PMP_AUTOREFINE_VERBOSE(MSG)
@@ -166,8 +167,9 @@ struct Intersection_visitor
 
 } // end of autorefine_impl
 
-template <class TriangleMesh, class Point_3, class NamedParameters = parameters::Default_named_parameters>
-void autorefine_soup_output(const TriangleMesh& tm,
+template <class PointRange, class TriIdsRange, class Point_3, class NamedParameters = parameters::Default_named_parameters>
+void autorefine_soup_output(const PointRange& input_points,
+                            const TriIdsRange& id_triples,
                             std::vector<Point_3>& soup_points,
                             std::vector<std::array<std::size_t, 3> >& soup_triangles,
                             const NamedParameters& np = parameters::default_values())
@@ -175,12 +177,9 @@ void autorefine_soup_output(const TriangleMesh& tm,
   using parameters::choose_parameter;
   using parameters::get_parameter;
 
-  typedef typename GetGeomTraits<TriangleMesh, NamedParameters>::type GT;
-  GT traits = choose_parameter<GT>(get_parameter(np, internal_np::geom_traits));
-
-  typedef typename GetVertexPointMap<TriangleMesh, NamedParameters>::const_type VPM;
-  VPM vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
-                             get_const_property_map(vertex_point, tm));
+  typedef typename GetPolygonSoupGeomTraits<PointRange, NamedParameters>::type GT;
+  typedef typename GetPointMap<PointRange, NamedParameters>::const_type    Point_map;
+  Point_map pm = choose_parameter<Point_map>(get_parameter(np, internal_np::point_map));
 
   typedef typename internal_np::Lookup_named_param_def <
     internal_np::concurrency_tag_t,
@@ -188,68 +187,54 @@ void autorefine_soup_output(const TriangleMesh& tm,
     Sequential_tag
   > ::type Concurrency_tag;
 
-  typedef boost::graph_traits<TriangleMesh> Graph_traits;
-  typedef typename Graph_traits::face_descriptor face_descriptor;
-  typedef typename Graph_traits::halfedge_descriptor halfedge_descriptor;
-  typedef typename Graph_traits::vertex_descriptor vertex_descriptor;
-  typedef std::pair<face_descriptor, face_descriptor> Pair_of_faces;
+  typedef std::size_t Input_TID;
+  typedef std::pair<Input_TID, Input_TID> Pair_of_triangle_ids;
 
-  std::vector<Pair_of_faces> si_pairs;
+  std::vector<Pair_of_triangle_ids> si_pairs;
 
   // collect intersecting pairs of triangles
   CGAL_PMP_AUTOREFINE_VERBOSE("collect intersecting pairs");
-  self_intersections<Concurrency_tag>(tm, std::back_inserter(si_pairs), np);
+  triangle_soup_self_intersections<Concurrency_tag>(input_points, id_triples, std::back_inserter(si_pairs), np);
 
   if (si_pairs.empty()) return;
 
   // mark degenerate faces so that we can ignore them
-  typedef CGAL::dynamic_face_property_t<bool> Degen_property_tag;
-  typedef typename boost::property_map<TriangleMesh, Degen_property_tag>::const_type Is_degen_map;
-  Is_degen_map is_degen = get(Degen_property_tag(), tm);
+  std::vector<bool> is_degen(id_triples.size(), false);
 
-  for(face_descriptor f : faces(tm))
-    put(is_degen, f, false);
-  for (const Pair_of_faces& p : si_pairs)
+  for (const Pair_of_triangle_ids& p : si_pairs)
     if (p.first==p.second) // bbox inter reports (f,f) for degenerate faces
-      put(is_degen, p.first, true);
+      is_degen[p.first] = true;
 
   // assign an id per triangle involved in an intersection
   // + the faces involved in the intersection
-  typedef CGAL::dynamic_face_property_t<int> TID_property_tag;
-  typedef typename boost::property_map<TriangleMesh, TID_property_tag>::const_type Triangle_id_map;
-
-  Triangle_id_map tid_map = get(TID_property_tag(), tm);
-  for (face_descriptor f : faces(tm))
-    put(tid_map, f, -1);
-
-  std::vector<face_descriptor> intersected_faces;
-  int tid=-1;
-  for (const Pair_of_faces& p : si_pairs)
+  std::vector<int> tri_inter_ids(id_triples.size(), -1);
+  std::vector<Input_TID> intersected_faces;
+  int tiid=-1;
+  for (const Pair_of_triangle_ids& p : si_pairs)
   {
-    if (get(tid_map, p.first)==-1 && !get(is_degen, p.first))
+    if (tri_inter_ids[p.first]==-1 && !is_degen[p.first])
     {
-      put(tid_map, p.first, ++tid);
+      tri_inter_ids[p.first]=++tiid;
       intersected_faces.push_back(p.first);
     }
-    if (get(tid_map, p.second)==-1 && !get(is_degen, p.second))
+    if (tri_inter_ids[p.second]==-1 && !is_degen[p.second])
     {
-      put(tid_map, p.second, ++tid);
+      tri_inter_ids[p.second]=++tiid;
       intersected_faces.push_back(p.second);
     }
   }
 
   // init the vector of triangles used for the autorefinement of triangles
   typedef CGAL::Exact_predicates_exact_constructions_kernel EK;
-  std::vector< EK::Triangle_3 > triangles(tid+1);
+  std::vector< EK::Triangle_3 > triangles(tiid+1);
   Cartesian_converter<GT, EK> to_exact;
 
-  for(face_descriptor f : intersected_faces)
+  for(Input_TID f : intersected_faces)
   {
-    halfedge_descriptor h = halfedge(f, tm);
-    triangles[get(tid_map, f)]= EK::Triangle_3(
-      to_exact( get(vpm, source(h, tm)) ),
-      to_exact( get(vpm, target(h, tm)) ),
-      to_exact( get(vpm, target(next(h, tm), tm)) ) );
+    triangles[tri_inter_ids[f]]= EK::Triangle_3(
+      to_exact( get(pm, input_points[id_triples[f][0]]) ),
+      to_exact( get(pm, input_points[id_triples[f][1]]) ),
+      to_exact( get(pm, input_points[id_triples[f][2]]) ) );
   }
 
   std::vector< std::vector<EK::Segment_3> > all_segments(triangles.size());
@@ -259,10 +244,10 @@ void autorefine_soup_output(const TriangleMesh& tm,
   typename EK::Intersect_3 intersection = EK().intersect_3_object();
   autorefine_impl::Intersection_visitor<EK> intersection_visitor(all_segments, all_points);
 
-  for (const Pair_of_faces& p : si_pairs)
+  for (const Pair_of_triangle_ids& p : si_pairs)
   {
-    int i1 = get(tid_map, p.first),
-        i2 = get(tid_map, p.second);
+    int i1 = tri_inter_ids[p.first],
+        i2 = tri_inter_ids[p.second];
 
     if (i1==-1 || i2==-1) continue; //skip degenerate faces
 
@@ -298,17 +283,6 @@ void autorefine_soup_output(const TriangleMesh& tm,
   std::vector<EK::Point_3> exact_soup_points;
 #endif
 
-  for (vertex_descriptor v : vertices(tm))
-  {
-    if (point_id_map.insert(std::make_pair(to_exact(get(vpm,v)), soup_points.size())).second)
-    {
-      soup_points.push_back(get(vpm,v));
-#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
-      exact_soup_points.push_back(to_exact(get(vpm,v)));
-#endif
-    }
-  }
-
   auto get_point_id = [&](const typename EK::Point_3& pt)
   {
     auto insert_res = point_id_map.insert(std::make_pair(pt, soup_points.size()));
@@ -322,18 +296,22 @@ void autorefine_soup_output(const TriangleMesh& tm,
     return insert_res.first->second;
   };
 
-  for (face_descriptor f : faces(tm))
+  std::vector <std::size_t> input_point_ids;
+  input_point_ids.reserve(input_points.size());
+  for (const auto& p : input_points)
+    input_point_ids.push_back(get_point_id(to_exact(get(pm,p))));
+
+  for (Input_TID f=0; f<id_triples.size(); ++f)
   {
-    if (get(is_degen, f)) continue; //skip degenerate faces
+    if (is_degen[f]) continue; //skip degenerate faces
 
-    int tid = get(tid_map, f);
-    if (tid == -1)
+    int tiid = tri_inter_ids[f];
+    if (tiid == -1)
     {
-      halfedge_descriptor h = halfedge(f, tm);
       soup_triangles.emplace_back(
-        CGAL::make_array(get_point_id(to_exact(get(vpm,source(h, tm)))),
-                         get_point_id(to_exact(get(vpm,target(h, tm)))),
-                         get_point_id(to_exact(get(vpm,target(next(h, tm), tm)))))
+        CGAL::make_array(input_point_ids[id_triples[f][0]],
+                         input_point_ids[id_triples[f][1]],
+                         input_point_ids[id_triples[f][2]])
       );
     }
   }
@@ -396,14 +374,19 @@ autorefine(      TriangleMesh& tm,
   typedef typename GetGeomTraits<TriangleMesh, NamedParameters>::type GT;
   GT traits = choose_parameter<GT>(get_parameter(np, internal_np::geom_traits));
 
-  std::vector<typename GT::Point_3> soup_points;
-  std::vector<std::array<std::size_t, 3> > soup_triangles;
+  std::vector<typename GT::Point_3> in_soup_points;
+  std::vector<std::array<std::size_t, 3> > in_soup_triangles;
+  std::vector<typename GT::Point_3> out_soup_points;
+  std::vector<std::array<std::size_t, 3> > out_soup_triangles;
+
+  polygon_mesh_to_polygon_soup(tm, in_soup_points, in_soup_triangles);
 
-  autorefine_soup_output(tm, soup_points, soup_triangles, np);
+  autorefine_soup_output(in_soup_points, in_soup_triangles,
+                         out_soup_points, out_soup_triangles);
 
   clear(tm);
-  orient_polygon_soup(soup_points, soup_triangles);
-  polygon_soup_to_polygon_mesh(soup_points, soup_triangles, tm);
+  orient_polygon_soup(out_soup_points, out_soup_triangles);
+  polygon_soup_to_polygon_mesh(out_soup_points, out_soup_triangles, tm);
 }
 
 

From b4887272e85bfde8bebf0093a9169cc897bca5ab Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 13 Jan 2023 11:56:36 +0100
Subject: [PATCH 0163/1398] use soup as input/output in example

---
 .../soup_autorefinement.cpp                       | 15 +++++----------
 1 file changed, 5 insertions(+), 10 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index 8ca983aa31c3..297875c9ec89 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -23,19 +23,14 @@ int main(int argc, char** argv)
                                          : std::string(argv[1]);
 
   std::vector<Point> input_points;
-  std::vector<std::vector<std::size_t> > input_triangles;
-
+  std::vector<std::array<std::size_t, 3>> input_triangles;
   CGAL::IO::read_polygon_soup(filename, input_points, input_triangles);
-  PMP::repair_polygon_soup(input_points, input_triangles);
-
-  Mesh mesh;
-  PMP::orient_polygon_soup(input_points, input_triangles);
-  PMP::polygon_soup_to_polygon_mesh(input_points, input_triangles, mesh);
-  PMP::triangulate_faces(mesh);
 
-  PMP::autorefine(mesh);
+  std::vector<Point> output_points;
+  std::vector<std::array<std::size_t, 3>> output_triangles;
+  PMP::autorefine_soup_output(input_points, input_triangles, output_points, output_triangles);
 
-  CGAL::IO::write_polygon_mesh("autorefined.off", mesh, CGAL::parameters::stream_precision(17));
+  CGAL::IO::write_polygon_soup("autorefined.off", output_points, output_triangles, CGAL::parameters::stream_precision(17));
 
   return 0;
 }

From d979121cd29c42c203609ab3bc4956601e9b0512 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 13 Jan 2023 15:41:33 +0100
Subject: [PATCH 0164/1398] repair soup is still recommanded

---
 .../examples/Polygon_mesh_processing/soup_autorefinement.cpp    | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index 297875c9ec89..9ade96e3be84 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -3,7 +3,6 @@
 
 #include <CGAL/Polygon_mesh_processing/autorefinement.h>
 #include <CGAL/Polygon_mesh_processing/repair_polygon_soup.h>
-#include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
 #include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
 #include <CGAL/IO/polygon_soup_io.h>
@@ -25,6 +24,7 @@ int main(int argc, char** argv)
   std::vector<Point> input_points;
   std::vector<std::array<std::size_t, 3>> input_triangles;
   CGAL::IO::read_polygon_soup(filename, input_points, input_triangles);
+  PMP::repair_polygon_soup(input_points, input_triangles);
 
   std::vector<Point> output_points;
   std::vector<std::array<std::size_t, 3>> output_triangles;

From 4bc74c399cac5ce0ac84ba894e1b5e996960d605 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 16 Jan 2023 22:59:18 +0100
Subject: [PATCH 0165/1398] WIP: start improving intersect computation

---
 .../Polygon_mesh_processing/autorefinement.h  | 269 ++++++++++++++++--
 1 file changed, 248 insertions(+), 21 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 290dde253324..80b964ad8590 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1,5 +1,5 @@
 //TODO: add for soup face the id of the input face. not sure it is easy to report intersection edge as a pair of vertex id
-
+//TODO: only return intersection segments
 // Copyright (c) 2023 GeometryFactory (France).
 // All rights reserved.
 //
@@ -43,21 +43,26 @@ namespace Polygon_mesh_processing {
 namespace autorefine_impl {
 
 template <class EK>
-void generate_subtriangles(const typename EK::Triangle_3& t,
-                           const std::vector<typename EK::Segment_3>& segments,
+void generate_subtriangles(std::size_t ti,
+                                 std::vector<typename EK::Segment_3>& segments,
                            const std::vector<typename EK::Point_3>& points,
+                           const std::vector<std::size_t>& in_triangle_ids,
+                           const std::set<std::pair<std::size_t, std::size_t> >& intersecting_triangles,
+                           const std::vector<typename EK::Triangle_3>& triangles,
                            std::vector<typename EK::Triangle_3>& new_triangles)
 {
   typedef CGAL::Projection_traits_3<EK> P_traits;
   typedef CGAL::Exact_intersections_tag Itag;
 
-  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits, Default, Itag> CDT_2;
+  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits/* , Default, Itag */> CDT_2;
   //typedef CGAL::Constrained_triangulation_plus_2<CDT_base> CDT;
   typedef CDT_2 CDT;
 
+  const typename EK::Triangle_3& t = triangles[ti];
+
   // positive triangle normal
   typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
-  typename EK::Point_3 o(0,0,0);
+  typename EK::Point_3 o(CGAL::ORIGIN);
 
   bool orientation_flipped = false;
   if ( typename EK::Less_xyz_3()(o+n,o) )
@@ -74,6 +79,184 @@ void generate_subtriangles(const typename EK::Triangle_3& t,
   typename CDT::Vertex_handle v = cdt.tds().insert_dim_up(cdt.infinite_vertex(), orientation_flipped);
   v->set_point(t[2]);
 
+#if 1
+  //~ static std::ofstream debug("inter_segments.polylines.txt");
+  //~ debug.precision(17);
+
+  // pre-compute segment intersections
+  if (!segments.empty())
+  {
+    std::size_t nbs = segments.size();
+    //~ std::cout << "nbs " << nbs << "\n";
+
+    //~ if (nbs==8)
+    //~ {
+      //~ for (std::size_t i = 0; i<nbs; ++i)
+        //~ std::ofstream("cst_"+std::to_string(i)+".polylines.txt") << std::setprecision(17) << "2 " << segments[i] << "\n";
+    //~ }
+
+    std::vector< std::vector<typename EK::Point_3> > points_on_segments(nbs);
+    for (std::size_t i = 0; i<nbs-1; ++i)
+    {
+      for (std::size_t j = i+1; j<nbs; ++j)
+      {
+        if (intersecting_triangles.count(CGAL::make_sorted_pair(in_triangle_ids[i], in_triangle_ids[j]))!=0)
+        {
+          if (CGAL::do_intersect(segments[i], segments[j]))
+          {
+            auto res = CGAL::intersection(triangles[in_triangle_ids[i]].supporting_plane(),
+                                          triangles[in_triangle_ids[j]].supporting_plane(),
+                                          triangles[ti].supporting_plane());
+
+            if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*res)))
+            {
+              points_on_segments[i].push_back(*pt_ptr);
+              points_on_segments[j].push_back(*pt_ptr);
+
+              //~ std::cout << "new inter " << *pt_ptr << "\n";
+
+            }
+            else
+            {
+              // We can have hard cases if two triangles are coplanar....
+
+              //~ std::cout << "coplanar inter: " << i << " " << j << "\n";
+
+              auto inter = CGAL::intersection(segments[i], segments[j]);
+              if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*inter)))
+              {
+                points_on_segments[i].push_back(*pt_ptr);
+                points_on_segments[j].push_back(*pt_ptr);
+
+                //~ std::cout << "new inter bis" << *pt_ptr << "\n";
+              }
+              else
+              {
+                if (const typename EK::Segment_3* seg_ptr = boost::get<typename EK::Segment_3>(&(*inter)))
+                {
+                  points_on_segments[i].push_back(seg_ptr->source());
+                  points_on_segments[j].push_back(seg_ptr->source());
+                  points_on_segments[i].push_back(seg_ptr->target());
+                  points_on_segments[j].push_back(seg_ptr->target());
+
+                }
+                else
+                  std::cerr <<"ERROR!\n";
+              }
+
+              #if 0
+              //this code works if triangles are not coplanar
+              // coplanar intersection that is not a point
+              int coord = 0;
+              const typename EK::Segment_3& s = segments[i];
+              typename EK::Point_3 src = s.source(), tgt=s.target();
+              if (src.x()==tgt.x())
+              {
+                coord=1;
+                if (src.y()==tgt.y())
+                  coord==2;
+              }
+
+              std::vector<typename EK::Point_3> tmp_pts = {
+                src, tgt, segments[j][0], segments[j][1] };
+
+              std::sort(tmp_pts.begin(), tmp_pts.end(),
+                        [coord](const typename EK::Point_3& p, const typename EK::Point_3& q)
+                        {return p[coord]<q[coord];});
+
+              points_on_segments[i].push_back(tmp_pts[1]);
+              points_on_segments[i].push_back(tmp_pts[2]);
+              points_on_segments[j].push_back(tmp_pts[1]);
+              points_on_segments[j].push_back(tmp_pts[2]);
+#endif
+              //~ std::cout << "new inter coli " << segments[j].source() << "\n";
+              //~ std::cout << "new inter coli " << segments[j].target() << "\n";
+              //~ std::cout << "new inter coli " << segments[i].source() << "\n";
+              //~ std::cout << "new inter coli " << segments[i].target() << "\n";
+
+              //~ points_on_segments[j].push_back(*pt_ptr);
+
+
+
+              //~ std::cerr << "ERROR: intersection is a segment\n";
+              //~ std::cout << std::setprecision(17);
+              //~ exact(segments[i]);
+              //~ exact(segments[j]);
+              //~ std::cout << segments[i] << "\n";
+              //~ std::cout << segments[j] << "\n";
+              //~ debug << "4 " << triangles[in_triangle_ids[i]] << " " << triangles[in_triangle_ids[i]][0] << "\n";
+              //~ debug << "4 " << triangles[in_triangle_ids[j]] << " " << triangles[in_triangle_ids[j]][0] << "\n";
+              //~ debug << "4 " << triangles[ti] << " " << triangles[ti][0] << "\n";
+              //~ exit(1);
+            }
+          }
+        }
+      }
+    }
+
+    std::vector<typename EK::Point_3> cst_points;
+    std::vector<std::pair<std::size_t, std::size_t>> csts;
+    for (std::size_t i = 0; i<nbs; ++i)
+    {
+      if(!points_on_segments[i].empty())
+      {
+        // TODO: predicate on input triangles
+        int coord = 0;
+        const typename EK::Segment_3& s = segments[i];
+        typename EK::Point_3 src = s.source(), tgt=s.target();
+        if (src.x()==tgt.x())
+        {
+          coord=1;
+          if (src.y()==tgt.y())
+            coord==2;
+        }
+        if (src[coord]>tgt[coord])
+          std::swap(src, tgt);
+
+        std::sort(points_on_segments[i].begin(), points_on_segments[i].end(), [coord](const typename EK::Point_3& p, const typename EK::Point_3& q){return p[coord]<q[coord];});
+//TODO: use reserve on cst_points?
+        std::size_t src_id=cst_points.size();
+        cst_points.push_back(src);
+        cst_points.insert(cst_points.end(), points_on_segments[i].begin(), points_on_segments[i].end());
+        cst_points.push_back(tgt);
+
+
+        //~ {
+        //~ std::cout << "cst_points.size() " << cst_points.size() << "\n";
+        //~ std::ofstream debugbis("subcst.polylines.txt");
+        //~ debugbis << std::setprecision(17);
+
+        //~ std::cout << "splittng " << segments[i] << "\n";
+        //~ static int kkk=-1;
+        //~ ++kkk;
+        //~ std::ofstream debugter("subcst_"+std::to_string(i)+".polylines.txt");
+        //~ for (std::size_t k=0; k<=points_on_segments[i].size(); ++k)
+        //~ {
+          //~ exact(cst_points[src_id+k]);
+          //~ exact(cst_points[src_id+k+1]);
+          //~ debugbis << "2 " << cst_points[src_id+k] << " " <<  cst_points[src_id+k+1] << "\n";
+          //~ debugter << "2 " << cst_points[src_id+k] << " " <<  cst_points[src_id+k+1] << "\n";
+        //~ }
+        //~ std::cout << "---\n";
+        //~ }
+
+        for (std::size_t k=0; k<=points_on_segments[i].size(); ++k)
+          csts.emplace_back(src_id+k, src_id+k+1);
+      }
+    }
+
+    cdt.insert_constraints(cst_points.begin(), cst_points.end(), csts.begin(), csts.end());
+
+    std::vector<typename EK::Segment_3> no_inter_segments;
+    no_inter_segments.reserve(nbs);
+    for (std::size_t i = 0; i<nbs; ++i)
+      if(points_on_segments[i].empty())
+        no_inter_segments.push_back(segments[i]);
+    no_inter_segments.swap(segments);
+  }
+  //~ std::cout << "done\n";
+#endif
+
   cdt.insert_constraints(segments.begin(), segments.end());
   cdt.insert(points.begin(), points.end());
 
@@ -116,12 +299,15 @@ struct Intersection_visitor
 {
   std::vector< std::vector<typename EK::Segment_3> >& all_segments;
   std::vector< std::vector<typename EK::Point_3> >& all_points;
+  std::vector< std::vector<std::size_t> >& all_in_triangle_ids;
   std::pair<int, int> ids;
 
   Intersection_visitor(std::vector< std::vector<typename EK::Segment_3> >& all_segments,
-                       std::vector< std::vector<typename EK::Point_3> >& all_points)
+                       std::vector< std::vector<typename EK::Point_3> >& all_points,
+                       std::vector< std::vector<std::size_t> >& all_in_triangle_ids)
     : all_segments (all_segments)
     , all_points(all_points)
+    , all_in_triangle_ids(all_in_triangle_ids)
   {}
 
   void set_triangle_ids(int i1, int i2)
@@ -140,6 +326,8 @@ struct Intersection_visitor
   {
     all_segments[ids.first].push_back(s);
     all_segments[ids.second].push_back(s);
+    all_in_triangle_ids[ids.first].push_back(ids.second);
+    all_in_triangle_ids[ids.second].push_back(ids.first);
   }
 
   void operator()(const typename EK::Triangle_3& t)
@@ -149,6 +337,8 @@ struct Intersection_visitor
       typename EK::Segment_3 s(t[i], t[(i+1)%3]);
       all_segments[ids.first].push_back(s);
       all_segments[ids.second].push_back(s);
+      all_in_triangle_ids[ids.first].push_back(ids.second);
+      all_in_triangle_ids[ids.second].push_back(ids.first);
     }
 
   }
@@ -161,6 +351,8 @@ struct Intersection_visitor
       typename EK::Segment_3 s(poly[i], poly[(i+1)%nbp]);
       all_segments[ids.first].push_back(s);
       all_segments[ids.second].push_back(s);
+      all_in_triangle_ids[ids.first].push_back(ids.second);
+      all_in_triangle_ids[ids.second].push_back(ids.first);
     }
   }
 };
@@ -239,11 +431,13 @@ void autorefine_soup_output(const PointRange& input_points,
 
   std::vector< std::vector<EK::Segment_3> > all_segments(triangles.size());
   std::vector< std::vector<EK::Point_3> > all_points(triangles.size());
+  std::vector< std::vector<std::size_t> > all_in_triangle_ids(triangles.size());
 
   CGAL_PMP_AUTOREFINE_VERBOSE("compute intersections");
   typename EK::Intersect_3 intersection = EK().intersect_3_object();
-  autorefine_impl::Intersection_visitor<EK> intersection_visitor(all_segments, all_points);
+  autorefine_impl::Intersection_visitor<EK> intersection_visitor(all_segments, all_points, all_in_triangle_ids);
 
+  std::set<std::pair<std::size_t, std::size_t> > intersecting_triangles;
   for (const Pair_of_triangle_ids& p : si_pairs)
   {
     int i1 = tri_inter_ids[p.first],
@@ -258,25 +452,13 @@ void autorefine_soup_output(const PointRange& input_points,
 
     if (inter != boost::none)
     {
+      intersecting_triangles.insert(CGAL::make_sorted_pair(i1, i2));
       intersection_visitor.set_triangle_ids(i1, i2);
       boost::apply_visitor(intersection_visitor, *inter);
     }
   }
 
-  CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
-  // now refine triangles
-  std::vector<EK::Triangle_3> new_triangles;
-  for(std::size_t ti=0; ti<triangles.size(); ++ti)
-  {
-    if (all_segments[ti].empty() && all_points[ti].empty())
-      new_triangles.push_back(triangles[ti]);
-    else
-      autorefine_impl::generate_subtriangles<EK>(triangles[ti], all_segments[ti], all_points[ti], new_triangles);
-  }
-
-
-  // brute force output: create a soup, orient and to-mesh
-  CGAL_PMP_AUTOREFINE_VERBOSE("create output soup");
+  // deduplicate inserted segments
   Cartesian_converter<EK, GT> to_input;
   std::map<EK::Point_3, std::size_t> point_id_map;
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
@@ -296,6 +478,51 @@ void autorefine_soup_output(const PointRange& input_points,
     return insert_res.first->second;
   };
 
+  // filter duplicated segments
+  for(std::size_t ti=0; ti<triangles.size(); ++ti)
+  {
+    if (!all_segments[ti].empty())
+    {
+      std::size_t nbs = all_segments[ti].size();
+      std::vector<EK::Segment_3> filtered_segments;
+      std::vector<std::size_t> filtered_in_triangle_ids;
+      filtered_segments.reserve(nbs);
+      std::set<std::pair<std::size_t, std::size_t>> segset;
+      for (std::size_t si=0; si<nbs; ++si)
+      {
+        EK::Point_3 src = all_segments[ti][si].source(),
+                    tgt = all_segments[ti][si].target();
+        if (segset.insert(
+              CGAL::make_sorted_pair( get_point_id(src),
+                                      get_point_id(tgt))).second)
+        {
+          filtered_segments.push_back(all_segments[ti][si]);
+          filtered_in_triangle_ids.push_back(all_in_triangle_ids[ti][si]);
+        }
+      }
+      if (filtered_segments.size()!=nbs)
+      {
+        filtered_segments.swap(all_segments[ti]);
+        filtered_in_triangle_ids.swap(all_in_triangle_ids[ti]);
+      }
+    }
+  }
+
+  CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
+  // now refine triangles
+  std::vector<EK::Triangle_3> new_triangles;
+  for(std::size_t ti=0; ti<triangles.size(); ++ti)
+  {
+    if (all_segments[ti].empty() && all_points[ti].empty())
+      new_triangles.push_back(triangles[ti]);
+    else
+      autorefine_impl::generate_subtriangles<EK>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+  }
+
+
+  // brute force output: create a soup, orient and to-mesh
+  CGAL_PMP_AUTOREFINE_VERBOSE("create output soup");
+
   std::vector <std::size_t> input_point_ids;
   input_point_ids.reserve(input_points.size());
   for (const auto& p : input_points)

From 842b6282b5c7a0b9f9c9551dfa443edd4f5319f5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 23 Jan 2023 15:39:01 +0100
Subject: [PATCH 0166/1398] STILL WIP: copy/paste code for coplanar
 intersection

---
 .../Polygon_mesh_processing/autorefinement.h  | 44 +++++++++++++++++--
 1 file changed, 40 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 80b964ad8590..6d97f7521ded 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -36,12 +36,43 @@
 
 #include <vector>
 
+#define TEST_RESOLVE_INTERSECTION
+#define DEDUPLICATE_SEGMENTS
+
 namespace CGAL {
 namespace Polygon_mesh_processing {
 
 #ifndef DOXYGEN_RUNNING
 namespace autorefine_impl {
 
+template <class K>
+bool do_coplanar_segments_intersect(const typename K::Segment_3& s1,
+                                    const typename K::Segment_3& s2,
+                                    const K& k = K())
+{
+  // supporting_line intersects: points are coplanar
+  typename K::Coplanar_orientation_3 cpl_orient=k.coplanar_orientation_3_object();
+  ::CGAL::Orientation or1 = cpl_orient(s1[0], s1[1], s2[0]);
+  ::CGAL::Orientation or2 = cpl_orient(s1[0], s1[1], s2[1]);
+
+  if(or1 == COLLINEAR && or2 == COLLINEAR)
+  {
+    // segments are collinear
+    typename K::Collinear_are_ordered_along_line_3 cln_order = k.collinear_are_ordered_along_line_3_object();
+    return (cln_order(s1[0], s2[0], s1[1]) ||
+            cln_order(s1[0], s2[1], s1[1]) ||
+            cln_order(s2[0], s1[0], s2[1]));
+  }
+
+  if(or1 != or2)
+  {
+    or1 = cpl_orient(s2[0], s2[1], s1[0]);
+    return (or1 == COLLINEAR || or1 != cpl_orient(s2[0], s2[1], s1[1]));
+  }
+
+  return false;
+}
+
 template <class EK>
 void generate_subtriangles(std::size_t ti,
                                  std::vector<typename EK::Segment_3>& segments,
@@ -54,7 +85,11 @@ void generate_subtriangles(std::size_t ti,
   typedef CGAL::Projection_traits_3<EK> P_traits;
   typedef CGAL::Exact_intersections_tag Itag;
 
-  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits/* , Default, Itag */> CDT_2;
+  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits
+#ifndef TEST_RESOLVE_INTERSECTION
+  ,Default, Itag
+#endif
+> CDT_2;
   //typedef CGAL::Constrained_triangulation_plus_2<CDT_base> CDT;
   typedef CDT_2 CDT;
 
@@ -79,7 +114,7 @@ void generate_subtriangles(std::size_t ti,
   typename CDT::Vertex_handle v = cdt.tds().insert_dim_up(cdt.infinite_vertex(), orientation_flipped);
   v->set_point(t[2]);
 
-#if 1
+#ifdef TEST_RESOLVE_INTERSECTION
   //~ static std::ofstream debug("inter_segments.polylines.txt");
   //~ debug.precision(17);
 
@@ -102,7 +137,7 @@ void generate_subtriangles(std::size_t ti,
       {
         if (intersecting_triangles.count(CGAL::make_sorted_pair(in_triangle_ids[i], in_triangle_ids[j]))!=0)
         {
-          if (CGAL::do_intersect(segments[i], segments[j]))
+          if (do_coplanar_segments_intersect<EK>(segments[i], segments[j]))
           {
             auto res = CGAL::intersection(triangles[in_triangle_ids[i]].supporting_plane(),
                                           triangles[in_triangle_ids[j]].supporting_plane(),
@@ -479,6 +514,7 @@ void autorefine_soup_output(const PointRange& input_points,
   };
 
   // filter duplicated segments
+#ifdef DEDUPLICATE_SEGMENTS
   for(std::size_t ti=0; ti<triangles.size(); ++ti)
   {
     if (!all_segments[ti].empty())
@@ -507,6 +543,7 @@ void autorefine_soup_output(const PointRange& input_points,
       }
     }
   }
+#endif
 
   CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
   // now refine triangles
@@ -519,7 +556,6 @@ void autorefine_soup_output(const PointRange& input_points,
       autorefine_impl::generate_subtriangles<EK>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
   }
 
-
   // brute force output: create a soup, orient and to-mesh
   CGAL_PMP_AUTOREFINE_VERBOSE("create output soup");
 

From 39d7bbc57fee319e45f8c51c75794f7828cc21d0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 24 Jan 2023 14:54:20 +0100
Subject: [PATCH 0167/1398] WIP import intersection computation from coref code

---
 .../Polygon_mesh_processing/autorefinement.h  | 363 +++++++++++++-----
 1 file changed, 259 insertions(+), 104 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 6d97f7521ded..afbe0c3479d7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -36,8 +36,8 @@
 
 #include <vector>
 
-#define TEST_RESOLVE_INTERSECTION
-#define DEDUPLICATE_SEGMENTS
+// #define TEST_RESOLVE_INTERSECTION
+// #define DEDUPLICATE_SEGMENTS
 
 namespace CGAL {
 namespace Polygon_mesh_processing {
@@ -45,10 +45,13 @@ namespace Polygon_mesh_processing {
 #ifndef DOXYGEN_RUNNING
 namespace autorefine_impl {
 
+enum Segment_inter_type { NO_INTERSECTION=0, COPLANAR_SEGMENTS, POINT_INTERSECTION };
+
 template <class K>
-bool do_coplanar_segments_intersect(const typename K::Segment_3& s1,
-                                    const typename K::Segment_3& s2,
-                                    const K& k = K())
+Segment_inter_type
+do_coplanar_segments_intersect(const typename K::Segment_3& s1,
+                               const typename K::Segment_3& s2,
+                               const K& k = K())
 {
   // supporting_line intersects: points are coplanar
   typename K::Coplanar_orientation_3 cpl_orient=k.coplanar_orientation_3_object();
@@ -61,26 +64,207 @@ bool do_coplanar_segments_intersect(const typename K::Segment_3& s1,
     typename K::Collinear_are_ordered_along_line_3 cln_order = k.collinear_are_ordered_along_line_3_object();
     return (cln_order(s1[0], s2[0], s1[1]) ||
             cln_order(s1[0], s2[1], s1[1]) ||
-            cln_order(s2[0], s1[0], s2[1]));
+            cln_order(s2[0], s1[0], s2[1])) ? COPLANAR_SEGMENTS : NO_INTERSECTION;
   }
 
   if(or1 != or2)
   {
     or1 = cpl_orient(s2[0], s2[1], s1[0]);
-    return (or1 == COLLINEAR || or1 != cpl_orient(s2[0], s2[1], s1[1]));
+    return (or1 == COLLINEAR || or1 != cpl_orient(s2[0], s2[1], s1[1])) ? POINT_INTERSECTION : NO_INTERSECTION;
+  }
+
+  return NO_INTERSECTION;
+}
+
+//////////////////////////////////
+//////////////////////////////////
+//////////////////////////////////
+//////////////////////////////////
+//////////////////////////////////
+
+// imported from Polygon_mesh_processing/internal/Corefinement/intersect_triangle_segment_3.h
+
+template<class K>
+void
+find_intersection(const typename K::Point_3& p, const typename K::Point_3& q,  //segment
+                  const typename K::Point_3& a, const typename K::Point_3& b, const typename K::Point_3& c, //triangle
+                  std::vector<typename K::Point_3>& inter_pts,
+                  bool is_p_coplanar=false, bool is_q_coplanar=false) // note that in coref this was wrt a halfedge not p/q
+{
+  Orientation ab=orientation(p,q,a,b);
+  Orientation bc=orientation(p,q,b,c);
+  Orientation ca=orientation(p,q,c,a);
+
+  if ( ab==POSITIVE || bc==POSITIVE || ca==POSITIVE )
+    return;
+
+  int nb_coplanar=(ab==COPLANAR?1:0) + (bc==COPLANAR?1:0) + (ca==COPLANAR?1:0);
+
+/*
+  if ( nb_coplanar==0 )
+    return result_type(ON_FACE,hd,is_src_coplanar,is_tgt_coplanar);
+
+  if (nb_coplanar==1){
+    if (ab==COPLANAR)
+      // intersection is ab
+      return result_type(ON_EDGE,next(hd,tm),is_src_coplanar,is_tgt_coplanar);
+    if (bc==COPLANAR)
+      // intersection is bc
+      return result_type(ON_EDGE,prev(hd,tm),is_src_coplanar,is_tgt_coplanar);
+    CGAL_assertion(ca==COPLANAR);
+    // intersection is ca
+    return result_type(ON_EDGE,hd,is_src_coplanar,is_tgt_coplanar);
+  }
+*/
+
+  if (is_p_coplanar)
+  {
+    inter_pts.push_back(p);
+    return;
+  }
+  if (is_q_coplanar)
+  {
+    inter_pts.push_back(q);
+    return;
+  }
+
+  if (nb_coplanar!=2)
+  {
+    inter_pts.push_back(
+      typename K::Construct_plane_line_intersection_point_3()(a, b, c, p, q)
+    );
+  }
+  else
+  {
+    if (ab!=COPLANAR)
+    {
+      // intersection is c
+      inter_pts.push_back(c);
+      return;
+    }
+
+    if (bc!=COPLANAR)
+    {
+      // intersection is a
+      inter_pts.push_back(a);
+      return;
+    }
+    CGAL_assertion(ca!=COPLANAR);
+    // intersection is b
+    inter_pts.push_back(b);
   }
+}
 
-  return false;
+template <class K>
+void test_edge(const typename K::Point_3& p, const typename K::Point_3& q,
+               const typename K::Point_3& a, const typename K::Point_3& b, const typename K::Point_3& c,
+               const Orientation abcp,
+               const Orientation abcq,
+               std::vector<typename K::Point_3>& inter_pts)
+{
+ switch ( abcp ) {
+  case POSITIVE:
+    switch ( abcq ) {
+    case POSITIVE:
+      // the segment lies in the positive open halfspaces defined by the
+      // triangle's supporting plane
+    break;
+    case NEGATIVE:
+      // p sees the triangle in counterclockwise order
+      find_intersection<K>(p,q,a,b,c,inter_pts);
+    break;
+    //case COPLANAR:
+    default:
+      // q belongs to the triangle's supporting plane
+      // p sees the triangle in counterclockwise order
+      find_intersection<K>(p,q,a,b,c,inter_pts,false,true);
+    }
+  break;
+  case NEGATIVE:
+    switch ( abcq ) {
+    case POSITIVE:
+      // q sees the triangle in counterclockwise order
+      find_intersection<K>(q,p,a,b,c,inter_pts);
+    break;
+    case NEGATIVE:
+      // the segment lies in the negative open halfspaces defined by the
+      // triangle's supporting plane
+    break;
+    // case COPLANAR:
+    default:
+      // q belongs to the triangle's supporting plane
+      // p sees the triangle in clockwise order
+      find_intersection<K>(q,p,a,b,c,inter_pts,true,false);
+    }
+  break;
+  default:
+  //case COPLANAR: // p belongs to the triangle's supporting plane
+    switch ( abcq ) {
+    case POSITIVE:
+      // q sees the triangle in counterclockwise order
+      find_intersection<K>(q,p,a,b,c,inter_pts,false, true);
+    break;
+    case NEGATIVE:
+      // q sees the triangle in clockwise order
+      find_intersection<K>(p,q,a,b,c,inter_pts,true);
+    break;
+    //case COPLANAR:
+    default:
+      // the segment is coplanar with the triangle's supporting plane
+      // we test whether the segment intersects the triangle in the common
+      // supporting plane
+      if ( ::CGAL::Intersections::internal::do_intersect_coplanar(a,b,c,p,q,K()) )
+      {
+        //handle coplanar intersection
+        // TODO: use coref function
+        throw std::runtime_error("coplanar intersection");
+        return;
+      }
+    }
+  }
 }
 
+template <class K>
+void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
+                           const std::array<typename K::Point_3, 3>& t2,
+                           std::vector<typename K::Point_3>& inter_pts)
+{
+  // test edges of t1 vs t2
+  std::array<Orientation,3> ori;
+  for (int i=0; i<3; ++i)
+    ori[i] = orientation(t2[0],t2[1],t2[2],t1[i]);
+  for (int i=0; i<3; ++i)
+  {
+    int j=(i+1)%3;
+    test_edge<K>(t1[i], t1[j], t2[0], t2[1], t2[2], ori[i], ori[j], inter_pts);
+    if (inter_pts.size()>1) return;
+  }
+
+  // test edges of t2 vs t1
+  for (int i=0; i<3; ++i)
+    ori[i] = orientation(t1[0],t1[1],t1[2],t2[i]);
+  for (int i=0; i<3; ++i)
+  {
+    int j=(i+1)%3;
+    test_edge<K>(t2[i], t2[j], t1[0], t1[1], t1[2], ori[i], ori[j], inter_pts);
+    if (inter_pts.size()>1) return;
+  }
+}
+
+//////////////////////////////////
+//////////////////////////////////
+//////////////////////////////////
+//////////////////////////////////
+//////////////////////////////////
+
 template <class EK>
 void generate_subtriangles(std::size_t ti,
                                  std::vector<typename EK::Segment_3>& segments,
                            const std::vector<typename EK::Point_3>& points,
                            const std::vector<std::size_t>& in_triangle_ids,
                            const std::set<std::pair<std::size_t, std::size_t> >& intersecting_triangles,
-                           const std::vector<typename EK::Triangle_3>& triangles,
-                           std::vector<typename EK::Triangle_3>& new_triangles)
+                           const std::vector<std::array<typename EK::Point_3,3>>& triangles,
+                           std::vector<std::array<typename EK::Point_3,3>>& new_triangles)
 {
   typedef CGAL::Projection_traits_3<EK> P_traits;
   typedef CGAL::Exact_intersections_tag Itag;
@@ -93,7 +277,7 @@ void generate_subtriangles(std::size_t ti,
   //typedef CGAL::Constrained_triangulation_plus_2<CDT_base> CDT;
   typedef CDT_2 CDT;
 
-  const typename EK::Triangle_3& t = triangles[ti];
+  const std::array<typename EK::Point_3,3>& t = triangles[ti];
 
   // positive triangle normal
   typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
@@ -130,6 +314,11 @@ void generate_subtriangles(std::size_t ti,
         //~ std::ofstream("cst_"+std::to_string(i)+".polylines.txt") << std::setprecision(17) << "2 " << segments[i] << "\n";
     //~ }
 
+    auto supporting_plane = [](const std::array<typename EK::Point_3, 3>& t)
+    {
+      return typename EK::Plane_3(t[0], t[1], t[2]);
+    };
+
     std::vector< std::vector<typename EK::Point_3> > points_on_segments(nbs);
     for (std::size_t i = 0; i<nbs-1; ++i)
     {
@@ -137,27 +326,35 @@ void generate_subtriangles(std::size_t ti,
       {
         if (intersecting_triangles.count(CGAL::make_sorted_pair(in_triangle_ids[i], in_triangle_ids[j]))!=0)
         {
-          if (do_coplanar_segments_intersect<EK>(segments[i], segments[j]))
+          Segment_inter_type seg_inter_type = do_coplanar_segments_intersect<EK>(segments[i], segments[j]);
+          switch(seg_inter_type)
           {
-            auto res = CGAL::intersection(triangles[in_triangle_ids[i]].supporting_plane(),
-                                          triangles[in_triangle_ids[j]].supporting_plane(),
-                                          triangles[ti].supporting_plane());
-
-            if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*res)))
+            case POINT_INTERSECTION:
             {
-              points_on_segments[i].push_back(*pt_ptr);
-              points_on_segments[j].push_back(*pt_ptr);
+              auto res = CGAL::intersection(supporting_plane(triangles[in_triangle_ids[i]]),
+                                            supporting_plane(triangles[in_triangle_ids[j]]),
+                                            supporting_plane(triangles[ti]));
+
+              if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*res)))
+              {
+                points_on_segments[i].push_back(*pt_ptr);
+                points_on_segments[j].push_back(*pt_ptr);
 
-              //~ std::cout << "new inter " << *pt_ptr << "\n";
+                //~ std::cout << "new inter " << *pt_ptr << "\n";
 
+              }
             }
-            else
+            // break; No break because of the coplanar case
+            case COPLANAR_SEGMENTS:
             {
               // We can have hard cases if two triangles are coplanar....
 
               //~ std::cout << "coplanar inter: " << i << " " << j << "\n";
 
               auto inter = CGAL::intersection(segments[i], segments[j]);
+
+              if (inter == boost::none) throw std::runtime_error("Unexpected case #2");
+
               if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*inter)))
               {
                 points_on_segments[i].push_back(*pt_ptr);
@@ -224,6 +421,9 @@ void generate_subtriangles(std::size_t ti,
               //~ debug << "4 " << triangles[ti] << " " << triangles[ti][0] << "\n";
               //~ exit(1);
             }
+            break;
+            default:
+            break;
           }
         }
       }
@@ -304,13 +504,13 @@ void generate_subtriangles(std::size_t ti,
     for (typename CDT::Face_handle fh : cdt.finite_face_handles())
     {
       if (orientation_flipped)
-        new_triangles.emplace_back(fh->vertex(0)->point(),
-                                   fh->vertex(cdt.cw(0))->point(),
-                                   fh->vertex(cdt.ccw(0))->point());
+        new_triangles.push_back( CGAL::make_array(fh->vertex(0)->point(),
+                                                  fh->vertex(cdt.cw(0))->point(),
+                                                  fh->vertex(cdt.ccw(0))->point()) );
       else
-        new_triangles.emplace_back(fh->vertex(0)->point(),
-                                   fh->vertex(cdt.ccw(0))->point(),
-                                   fh->vertex(cdt.cw(0))->point());
+        new_triangles.push_back( CGAL::make_array(fh->vertex(0)->point(),
+                                                  fh->vertex(cdt.ccw(0))->point(),
+                                                  fh->vertex(cdt.cw(0))->point()) );
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS
       ++nbt;
       buffer << fh->vertex(0)->point() << "\n";
@@ -329,69 +529,6 @@ void generate_subtriangles(std::size_t ti,
 #endif
 }
 
-template <class EK>
-struct Intersection_visitor
-{
-  std::vector< std::vector<typename EK::Segment_3> >& all_segments;
-  std::vector< std::vector<typename EK::Point_3> >& all_points;
-  std::vector< std::vector<std::size_t> >& all_in_triangle_ids;
-  std::pair<int, int> ids;
-
-  Intersection_visitor(std::vector< std::vector<typename EK::Segment_3> >& all_segments,
-                       std::vector< std::vector<typename EK::Point_3> >& all_points,
-                       std::vector< std::vector<std::size_t> >& all_in_triangle_ids)
-    : all_segments (all_segments)
-    , all_points(all_points)
-    , all_in_triangle_ids(all_in_triangle_ids)
-  {}
-
-  void set_triangle_ids(int i1, int i2)
-  {
-    ids = {i1, i2};
-  }
-
-  typedef void result_type;
-  void operator()(const typename EK::Point_3& p)
-  {
-    all_points[ids.first].push_back(p);
-    all_points[ids.second].push_back(p);
-  }
-
-  void operator()(const typename EK::Segment_3& s)
-  {
-    all_segments[ids.first].push_back(s);
-    all_segments[ids.second].push_back(s);
-    all_in_triangle_ids[ids.first].push_back(ids.second);
-    all_in_triangle_ids[ids.second].push_back(ids.first);
-  }
-
-  void operator()(const typename EK::Triangle_3& t)
-  {
-    for (std::size_t i=0; i<3; ++i)
-    {
-      typename EK::Segment_3 s(t[i], t[(i+1)%3]);
-      all_segments[ids.first].push_back(s);
-      all_segments[ids.second].push_back(s);
-      all_in_triangle_ids[ids.first].push_back(ids.second);
-      all_in_triangle_ids[ids.second].push_back(ids.first);
-    }
-
-  }
-
-  void operator()(const std::vector<typename EK::Point_3>& poly)
-  {
-    std::size_t nbp = poly.size();
-    for (std::size_t i=0; i<nbp; ++i)
-    {
-      typename EK::Segment_3 s(poly[i], poly[(i+1)%nbp]);
-      all_segments[ids.first].push_back(s);
-      all_segments[ids.second].push_back(s);
-      all_in_triangle_ids[ids.first].push_back(ids.second);
-      all_in_triangle_ids[ids.second].push_back(ids.first);
-    }
-  }
-};
-
 } // end of autorefine_impl
 
 template <class PointRange, class TriIdsRange, class Point_3, class NamedParameters = parameters::Default_named_parameters>
@@ -453,24 +590,22 @@ void autorefine_soup_output(const PointRange& input_points,
 
   // init the vector of triangles used for the autorefinement of triangles
   typedef CGAL::Exact_predicates_exact_constructions_kernel EK;
-  std::vector< EK::Triangle_3 > triangles(tiid+1);
+  std::vector< std::array<typename EK::Point_3, 3> > triangles(tiid+1);
   Cartesian_converter<GT, EK> to_exact;
 
   for(Input_TID f : intersected_faces)
   {
-    triangles[tri_inter_ids[f]]= EK::Triangle_3(
+    triangles[tri_inter_ids[f]]= CGAL::make_array(
       to_exact( get(pm, input_points[id_triples[f][0]]) ),
       to_exact( get(pm, input_points[id_triples[f][1]]) ),
       to_exact( get(pm, input_points[id_triples[f][2]]) ) );
   }
 
-  std::vector< std::vector<EK::Segment_3> > all_segments(triangles.size());
+  std::vector< std::vector<EK::Segment_3> > all_segments(triangles.size()); // TODO use std::pair
   std::vector< std::vector<EK::Point_3> > all_points(triangles.size());
   std::vector< std::vector<std::size_t> > all_in_triangle_ids(triangles.size());
 
   CGAL_PMP_AUTOREFINE_VERBOSE("compute intersections");
-  typename EK::Intersect_3 intersection = EK().intersect_3_object();
-  autorefine_impl::Intersection_visitor<EK> intersection_visitor(all_segments, all_points, all_in_triangle_ids);
 
   std::set<std::pair<std::size_t, std::size_t> > intersecting_triangles;
   for (const Pair_of_triangle_ids& p : si_pairs)
@@ -480,16 +615,36 @@ void autorefine_soup_output(const PointRange& input_points,
 
     if (i1==-1 || i2==-1) continue; //skip degenerate faces
 
-    const EK::Triangle_3& t1 = triangles[i1];
-    const EK::Triangle_3& t2 = triangles[i2];
+    const std::array<typename EK::Point_3, 3>& t1 = triangles[i1];
+    const std::array<typename EK::Point_3, 3>& t2 = triangles[i2];
 
-    auto inter = intersection(t1, t2);
+    std::vector<typename EK::Point_3> inter_pts;
+    autorefine_impl::collect_intersections<EK>(t1, t2, inter_pts);
 
-    if (inter != boost::none)
+    if (!inter_pts.empty())
     {
-      intersecting_triangles.insert(CGAL::make_sorted_pair(i1, i2));
-      intersection_visitor.set_triangle_ids(i1, i2);
-      boost::apply_visitor(intersection_visitor, *inter);
+      std::size_t nbi = inter_pts.size();
+      switch(nbi)
+      {
+        case 1:
+          all_points[i1].push_back(inter_pts[0]);
+          all_points[i2].push_back(inter_pts[0]);
+        break;
+        case 2:
+          all_segments[i1].push_back({inter_pts[0], inter_pts[1]});
+          all_segments[i2].push_back({inter_pts[0], inter_pts[1]});
+          all_in_triangle_ids[i1].push_back(i2);
+          all_in_triangle_ids[i2].push_back(i1);
+        break;
+        default:
+          for (std::size_t i=0;i<nbi; ++i)
+          {
+            all_segments[i1].push_back({inter_pts[i], inter_pts[(i+1)%nbi]});
+            all_segments[i2].push_back({inter_pts[i], inter_pts[(i+1)%nbi]});
+            all_in_triangle_ids[i1].push_back(i2);
+            all_in_triangle_ids[i2].push_back(i1);
+          }
+      }
     }
   }
 
@@ -547,7 +702,7 @@ void autorefine_soup_output(const PointRange& input_points,
 
   CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
   // now refine triangles
-  std::vector<EK::Triangle_3> new_triangles;
+  std::vector<std::array<EK::Point_3,3>> new_triangles;
   for(std::size_t ti=0; ti<triangles.size(); ++ti)
   {
     if (all_segments[ti].empty() && all_points[ti].empty())
@@ -578,7 +733,7 @@ void autorefine_soup_output(const PointRange& input_points,
       );
     }
   }
-  for (const typename EK::Triangle_3& t : new_triangles)
+  for (const std::array<EK::Point_3,3>& t : new_triangles)
   {
     soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
   }

From 10252faf1df2480f21c25959c1980e68819099a4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 24 Jan 2023 16:04:43 +0100
Subject: [PATCH 0168/1398] WIP use segments

---
 .../Polygon_mesh_processing/autorefinement.h  | 46 ++++++++++---------
 1 file changed, 24 insertions(+), 22 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index afbe0c3479d7..c9bb3f3ffa81 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -36,8 +36,8 @@
 
 #include <vector>
 
-// #define TEST_RESOLVE_INTERSECTION
-// #define DEDUPLICATE_SEGMENTS
+//#define TEST_RESOLVE_INTERSECTION
+//#define DEDUPLICATE_SEGMENTS
 
 namespace CGAL {
 namespace Polygon_mesh_processing {
@@ -49,8 +49,8 @@ enum Segment_inter_type { NO_INTERSECTION=0, COPLANAR_SEGMENTS, POINT_INTERSECTI
 
 template <class K>
 Segment_inter_type
-do_coplanar_segments_intersect(const typename K::Segment_3& s1,
-                               const typename K::Segment_3& s2,
+do_coplanar_segments_intersect(const std::array<typename K::Point_3, 2>& s1,
+                               const std::array<typename K::Point_3, 2>& s2,
                                const K& k = K())
 {
   // supporting_line intersects: points are coplanar
@@ -259,7 +259,7 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
 
 template <class EK>
 void generate_subtriangles(std::size_t ti,
-                                 std::vector<typename EK::Segment_3>& segments,
+                                 std::vector<std::array<typename EK::Point_3, 2>>& segments,
                            const std::vector<typename EK::Point_3>& points,
                            const std::vector<std::size_t>& in_triangle_ids,
                            const std::set<std::pair<std::size_t, std::size_t> >& intersecting_triangles,
@@ -351,7 +351,9 @@ void generate_subtriangles(std::size_t ti,
 
               //~ std::cout << "coplanar inter: " << i << " " << j << "\n";
 
-              auto inter = CGAL::intersection(segments[i], segments[j]);
+              typename EK::Segment_3 s1(segments[i][0], segments[i][1]);
+              typename EK::Segment_3 s2(segments[j][0], segments[j][1]);// TODO: avoid this construction
+              auto inter = CGAL::intersection(s1, s2);
 
               if (inter == boost::none) throw std::runtime_error("Unexpected case #2");
 
@@ -381,7 +383,7 @@ void generate_subtriangles(std::size_t ti,
               // coplanar intersection that is not a point
               int coord = 0;
               const typename EK::Segment_3& s = segments[i];
-              typename EK::Point_3 src = s.source(), tgt=s.target();
+              typename EK::Point_3 src = s[0], tgt=s[1];
               if (src.x()==tgt.x())
               {
                 coord=1;
@@ -401,10 +403,10 @@ void generate_subtriangles(std::size_t ti,
               points_on_segments[j].push_back(tmp_pts[1]);
               points_on_segments[j].push_back(tmp_pts[2]);
 #endif
-              //~ std::cout << "new inter coli " << segments[j].source() << "\n";
-              //~ std::cout << "new inter coli " << segments[j].target() << "\n";
-              //~ std::cout << "new inter coli " << segments[i].source() << "\n";
-              //~ std::cout << "new inter coli " << segments[i].target() << "\n";
+              //~ std::cout << "new inter coli " << segments[j][0] << "\n";
+              //~ std::cout << "new inter coli " << segments[j][1] << "\n";
+              //~ std::cout << "new inter coli " << segments[i][0] << "\n";
+              //~ std::cout << "new inter coli " << segments[i][1] << "\n";
 
               //~ points_on_segments[j].push_back(*pt_ptr);
 
@@ -437,8 +439,8 @@ void generate_subtriangles(std::size_t ti,
       {
         // TODO: predicate on input triangles
         int coord = 0;
-        const typename EK::Segment_3& s = segments[i];
-        typename EK::Point_3 src = s.source(), tgt=s.target();
+        const std::array<typename EK::Point_3, 2>& s = segments[i];
+        typename EK::Point_3 src = s[0], tgt=s[1];
         if (src.x()==tgt.x())
         {
           coord=1;
@@ -482,7 +484,7 @@ void generate_subtriangles(std::size_t ti,
 
     cdt.insert_constraints(cst_points.begin(), cst_points.end(), csts.begin(), csts.end());
 
-    std::vector<typename EK::Segment_3> no_inter_segments;
+    std::vector<std::array<typename EK::Point_3,2>> no_inter_segments;
     no_inter_segments.reserve(nbs);
     for (std::size_t i = 0; i<nbs; ++i)
       if(points_on_segments[i].empty())
@@ -601,7 +603,7 @@ void autorefine_soup_output(const PointRange& input_points,
       to_exact( get(pm, input_points[id_triples[f][2]]) ) );
   }
 
-  std::vector< std::vector<EK::Segment_3> > all_segments(triangles.size()); // TODO use std::pair
+  std::vector< std::vector<std::array<EK::Point_3,2> > > all_segments(triangles.size());
   std::vector< std::vector<EK::Point_3> > all_points(triangles.size());
   std::vector< std::vector<std::size_t> > all_in_triangle_ids(triangles.size());
 
@@ -631,16 +633,16 @@ void autorefine_soup_output(const PointRange& input_points,
           all_points[i2].push_back(inter_pts[0]);
         break;
         case 2:
-          all_segments[i1].push_back({inter_pts[0], inter_pts[1]});
-          all_segments[i2].push_back({inter_pts[0], inter_pts[1]});
+          all_segments[i1].push_back(CGAL::make_array(inter_pts[0], inter_pts[1]));
+          all_segments[i2].push_back(CGAL::make_array(inter_pts[0], inter_pts[1]));
           all_in_triangle_ids[i1].push_back(i2);
           all_in_triangle_ids[i2].push_back(i1);
         break;
         default:
           for (std::size_t i=0;i<nbi; ++i)
           {
-            all_segments[i1].push_back({inter_pts[i], inter_pts[(i+1)%nbi]});
-            all_segments[i2].push_back({inter_pts[i], inter_pts[(i+1)%nbi]});
+            all_segments[i1].push_back(CGAL::make_array(inter_pts[i], inter_pts[(i+1)%nbi]));
+            all_segments[i2].push_back(CGAL::make_array(inter_pts[i], inter_pts[(i+1)%nbi]));
             all_in_triangle_ids[i1].push_back(i2);
             all_in_triangle_ids[i2].push_back(i1);
           }
@@ -675,14 +677,14 @@ void autorefine_soup_output(const PointRange& input_points,
     if (!all_segments[ti].empty())
     {
       std::size_t nbs = all_segments[ti].size();
-      std::vector<EK::Segment_3> filtered_segments;
+      std::vector<std::array<EK::Point_3,2>> filtered_segments;
       std::vector<std::size_t> filtered_in_triangle_ids;
       filtered_segments.reserve(nbs);
       std::set<std::pair<std::size_t, std::size_t>> segset;
       for (std::size_t si=0; si<nbs; ++si)
       {
-        EK::Point_3 src = all_segments[ti][si].source(),
-                    tgt = all_segments[ti][si].target();
+        EK::Point_3 src = all_segments[ti][si][0],
+                    tgt = all_segments[ti][si][1];
         if (segset.insert(
               CGAL::make_sorted_pair( get_point_id(src),
                                       get_point_id(tgt))).second)

From 5905003d57c4358ef9088f90de6998fe9d3c71f5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 24 Jan 2023 16:04:54 +0100
Subject: [PATCH 0169/1398] always std::array as cst

---
 Triangulation_2/include/CGAL/Constrained_triangulation_2.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
index 42867cfbb074..047c8526afc5 100644
--- a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
@@ -330,11 +330,11 @@ class Constrained_triangulation_2
 #if 1
   template <class Segment_2>
   static decltype(auto) get_source(const Segment_2& segment){
-    return segment.source();
+    return segment[0];
   }
   template <class Segment_2>
   static decltype(auto) get_target(const Segment_2& segment){
-    return segment.target();
+    return segment[1];
   }
 
   static const Point& get_source(const Constraint& cst){

From 810715778223710a066d3161e2a4ec453475eaf4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 24 Jan 2023 18:04:10 +0100
Subject: [PATCH 0170/1398] WIP handle coplanar

---
 .../Polygon_mesh_processing/autorefinement.h  | 47 +++++++++++++++----
 1 file changed, 38 insertions(+), 9 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index c9bb3f3ffa81..f412c2ea298e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -82,8 +82,30 @@ do_coplanar_segments_intersect(const std::array<typename K::Point_3, 2>& s1,
 //////////////////////////////////
 //////////////////////////////////
 
-// imported from Polygon_mesh_processing/internal/Corefinement/intersect_triangle_segment_3.h
+// imported from Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+
+template<class K>
+void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
+                            const std::array<typename K::Point_3, 3>& t2,
+                            std::vector<typename K::Point_3>& inter_pts)
+{
+  const typename K::Point_3& p = t1[0], q = t1[1], r = t1[2];
+
+  std::list<typename K::Point_3> l_inter_pts;
+  l_inter_pts.push_back(t2[0]);
+  l_inter_pts.push_back(t2[1]);
+  l_inter_pts.push_back(t2[2]);
 
+  //intersect t2 with the three half planes which intersection defines t1
+  K k;
+  Intersections::internal::intersection_coplanar_triangles_cutoff(p,q,r,k,l_inter_pts); //line pq
+  Intersections::internal::intersection_coplanar_triangles_cutoff(q,r,p,k,l_inter_pts); //line qr
+  Intersections::internal::intersection_coplanar_triangles_cutoff(r,p,q,k,l_inter_pts); //line rp
+
+  inter_pts.assign(l_inter_pts.begin(), l_inter_pts.end());
+}
+
+// imported from Polygon_mesh_processing/internal/Corefinement/intersect_triangle_segment_3.h
 template<class K>
 void
 find_intersection(const typename K::Point_3& p, const typename K::Point_3& q,  //segment
@@ -162,7 +184,7 @@ void test_edge(const typename K::Point_3& p, const typename K::Point_3& q,
                const Orientation abcq,
                std::vector<typename K::Point_3>& inter_pts)
 {
- switch ( abcp ) {
+  switch ( abcp ) {
   case POSITIVE:
     switch ( abcq ) {
     case POSITIVE:
@@ -213,13 +235,13 @@ void test_edge(const typename K::Point_3& p, const typename K::Point_3& q,
       // the segment is coplanar with the triangle's supporting plane
       // we test whether the segment intersects the triangle in the common
       // supporting plane
-      if ( ::CGAL::Intersections::internal::do_intersect_coplanar(a,b,c,p,q,K()) )
-      {
+      //if ( ::CGAL::Intersections::internal::do_intersect_coplanar(a,b,c,p,q,K()) )
+      //{
         //handle coplanar intersection
-        // TODO: use coref function
-        throw std::runtime_error("coplanar intersection");
-        return;
-      }
+        // nothing done as coplanar case handle in collect_intersections
+        // and other intersection points will be collected with non-coplanar edges
+      //}
+    break;
     }
   }
 }
@@ -233,6 +255,13 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   std::array<Orientation,3> ori;
   for (int i=0; i<3; ++i)
     ori[i] = orientation(t2[0],t2[1],t2[2],t1[i]);
+
+  if (ori[0]== COPLANAR && ori[1]==COPLANAR && ori[2]==COPLANAR)
+  {
+    coplanar_intersections<K>(t1, t2, inter_pts);
+    return;
+  }
+
   for (int i=0; i<3; ++i)
   {
     int j=(i+1)%3;
@@ -378,7 +407,7 @@ void generate_subtriangles(std::size_t ti,
                   std::cerr <<"ERROR!\n";
               }
 
-              #if 0
+#if 0
               //this code works if triangles are not coplanar
               // coplanar intersection that is not a point
               int coord = 0;

From fa662e7dea97c5f33c8872c71817c18f51df0894 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 25 Jan 2023 14:45:12 +0100
Subject: [PATCH 0171/1398] WIP handle duplicated intersections + add in
 intersection list

---
 .../Polygon_mesh_processing/autorefinement.h  | 45 +++++++++++++++----
 1 file changed, 36 insertions(+), 9 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index f412c2ea298e..ae9858ae77d5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1,5 +1,5 @@
 //TODO: add for soup face the id of the input face. not sure it is easy to report intersection edge as a pair of vertex id
-//TODO: only return intersection segments
+//TODO: only return intersection segments (pay attention to degenerate triangles that are currently ignored)
 // Copyright (c) 2023 GeometryFactory (France).
 // All rights reserved.
 //
@@ -36,8 +36,8 @@
 
 #include <vector>
 
-//#define TEST_RESOLVE_INTERSECTION
-//#define DEDUPLICATE_SEGMENTS
+// #define TEST_RESOLVE_INTERSECTION
+// #define DEDUPLICATE_SEGMENTS
 
 namespace CGAL {
 namespace Polygon_mesh_processing {
@@ -266,7 +266,7 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   {
     int j=(i+1)%3;
     test_edge<K>(t1[i], t1[j], t2[0], t2[1], t2[2], ori[i], ori[j], inter_pts);
-    if (inter_pts.size()>1) return;
+    //~ if (inter_pts.size()>1) return;
   }
 
   // test edges of t2 vs t1
@@ -276,8 +276,13 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   {
     int j=(i+1)%3;
     test_edge<K>(t2[i], t2[j], t1[0], t1[1], t1[2], ori[i], ori[j], inter_pts);
-    if (inter_pts.size()>1) return;
+    //~ if (inter_pts.size()>1) return;
   }
+
+  // because we don't handle intersection type and can have edge-edge edge-vertex duplicates
+  std::sort(inter_pts.begin(), inter_pts.end());
+  auto last = std::unique(inter_pts.begin(), inter_pts.end());
+  inter_pts.erase(last, inter_pts.end());
 }
 
 //////////////////////////////////
@@ -288,7 +293,7 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
 
 template <class EK>
 void generate_subtriangles(std::size_t ti,
-                                 std::vector<std::array<typename EK::Point_3, 2>>& segments,
+                           std::vector<std::array<typename EK::Point_3, 2>>& segments,
                            const std::vector<typename EK::Point_3>& points,
                            const std::vector<std::size_t>& in_triangle_ids,
                            const std::set<std::pair<std::size_t, std::size_t> >& intersecting_triangles,
@@ -331,6 +336,27 @@ void generate_subtriangles(std::size_t ti,
   //~ static std::ofstream debug("inter_segments.polylines.txt");
   //~ debug.precision(17);
 
+  //~ std::cout << "points.size() " << points.size() << "\n";
+  //~ std::set<std::size_t> all_triangles_indices(in_triangle_ids.begin(), in_triangle_ids.end());
+  //~ all_triangles_indices.insert(ti);
+
+  //~ std::ofstream debug("triangles.polylines.txt");
+  //~ debug << std::setprecision(17);
+  //~ for (std::size_t i : all_triangles_indices)
+    //~ debug << "4 "
+          //~ << triangles[i][0] << " "
+          //~ << triangles[i][1] << " "
+          //~ << triangles[i][2] << " "
+          //~ << triangles[i][0] << "\n";
+  //~ debug.close();
+  //~ debug.open("triangle.off");
+  //~ debug << std::setprecision(17);
+  //~ debug << "OFF\n3 1 0\n";
+  //~ debug << triangles[ti][0] << "\n"
+        //~ << triangles[ti][1] << "\n"
+        //~ << triangles[ti][2] << "\n 3 0 1 2\n";
+  //~ debug.close();
+
   // pre-compute segment intersections
   if (!segments.empty())
   {
@@ -340,7 +366,7 @@ void generate_subtriangles(std::size_t ti,
     //~ if (nbs==8)
     //~ {
       //~ for (std::size_t i = 0; i<nbs; ++i)
-        //~ std::ofstream("cst_"+std::to_string(i)+".polylines.txt") << std::setprecision(17) << "2 " << segments[i] << "\n";
+        //~ std::ofstream("cst_"+std::to_string(i)+".polylines.txt") << std::setprecision(17) << "2 " << segments[i][0] << " " << segments[i][1] << "\n";
     //~ }
 
     auto supporting_plane = [](const std::array<typename EK::Point_3, 3>& t)
@@ -404,7 +430,7 @@ void generate_subtriangles(std::size_t ti,
 
                 }
                 else
-                  std::cerr <<"ERROR!\n";
+                  throw std::runtime_error("BOOM\n");
               }
 
 #if 0
@@ -671,11 +697,12 @@ void autorefine_soup_output(const PointRange& input_points,
           for (std::size_t i=0;i<nbi; ++i)
           {
             all_segments[i1].push_back(CGAL::make_array(inter_pts[i], inter_pts[(i+1)%nbi]));
-            all_segments[i2].push_back(CGAL::make_array(inter_pts[i], inter_pts[(i+1)%nbi]));
+            all_segments[i2].push_back(all_segments[i1].back());
             all_in_triangle_ids[i1].push_back(i2);
             all_in_triangle_ids[i2].push_back(i1);
           }
       }
+      intersecting_triangles.insert(CGAL::make_sorted_pair(i1, i2));
     }
   }
 

From 8bea32df62486b2be8e6e3a2f62d183bb145effe Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 2 Feb 2023 11:14:18 +0100
Subject: [PATCH 0172/1398] WIP new coplanar intersection

---
 .../Triangle_3_Triangle_3_intersection.h      | 297 +++++++++++++++---
 .../Polygon_mesh_processing/autorefinement.h  |  36 ++-
 2 files changed, 285 insertions(+), 48 deletions(-)

diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index 424e1fc93616..d4e467a07986 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -31,54 +31,257 @@ namespace CGAL {
 namespace Intersections {
 namespace internal{
 
+template <class K>
+typename K::FT
+coplanar_segment_segment_alpha_intersection(const typename K::Point_3& p1, const typename K::Point_3& p2, // segment 1
+                                            const typename K::Point_3& p3, const typename K::Point_3& p4, // segment 2
+                                            const K& k)
+{
+  const typename K::Vector_3 v1 = p2-p1;
+  const typename K::Vector_3 v2 = p4-p3;
+
+  CGAL_assertion(k.coplanar_3_object()(p1,p2,p3,p4));
+
+  const typename K::Vector_3 v3 = p3 - p1;
+  const typename K::Vector_3 v3v2 = cross_product(v3,v2);
+  const typename K::Vector_3 v1v2 = cross_product(v1,v2);
+  const typename K::FT sl = v1v2.squared_length();
+  CGAL_assertion(!certainly(is_zero(sl)));
+
+  const typename K::FT t = ((v3v2.x()*v1v2.x()) + (v3v2.y()*v1v2.y()) + (v3v2.z()*v1v2.z())) / sl;
+  return t; // p1 + (p2-p1) * t
+}
+
+template <class Kernel>
+struct Point_on_triangle
+{
+  static
+  inline
+  const typename Kernel::Point_3&
+  point_from_id(const typename Kernel::Point_3& p,
+                const typename Kernel::Point_3& q,
+                const typename Kernel::Point_3& r,
+                int id)
+  {
+    switch(id)
+    {
+      case 0:
+        return p;
+      case 1:
+        return q;
+      default:
+        return r;
+    }
+  }
+
+  Point_on_triangle(int i1, int i2=-1, int sign=0, typename Kernel::FT alpha = 0.) // TODO add global zero()?
+    : t1_t2_ids(i1,i2)
+    , sign(sign)
+  {}
+
+  // (id, -1) point on t1
+  // (-1, id) point on t2
+  // (id1, id2) intersection of edges
+  std::pair<int, int> t1_t2_ids;
+  int sign;
+  typename Kernel::FT alpha;
+
+  Orientation
+  orientation (const typename Kernel::Point_3& p1, // source of edge edge_ids1
+               const typename Kernel::Point_3& q1, // target of edge edge_ids1
+               const typename Kernel::Point_3& r1,
+               int edge_id1,
+               const typename Kernel::Point_3& p2,
+               const typename Kernel::Point_3& q2,
+               const typename Kernel::Point_3& r2,
+               const Kernel& k) const
+  {
+    if (t1_t2_ids.first!=-1)
+    {
+      if (t1_t2_ids.second==-1) return ZERO; // it is a point on t1
+      // this is an intersection point
+      if (sign == 0)
+        return POSITIVE;
+      if (sign == -1)
+        return edge_id1==t1_t2_ids.first+1?POSITIVE:NEGATIVE;
+      else
+        return edge_id1==t1_t2_ids.first+1?NEGATIVE:POSITIVE;
+    }
+    else
+    {
+      //this is an input point of t2
+      typename Kernel::Coplanar_orientation_3 orient = k.coplanar_orientation_3_object();
+      const typename Kernel::Point_3& query = point_from_id(p2,q2,r2,t1_t2_ids.second);
+      return orient(p1,q1,r1,query);
+    }
+  }
+
+  int id1() const { return t1_t2_ids.first; }
+  int id2() const { return t1_t2_ids.second; }
+
+  typename Kernel::Point_3
+  point(const typename Kernel::Point_3& p1,
+        const typename Kernel::Point_3& q1,
+        const typename Kernel::Point_3& r1,
+        const typename Kernel::Point_3& p2,
+        const typename Kernel::Point_3& q2,
+        const typename Kernel::Point_3& r2,
+        const Kernel& k) const
+  {
+    if (t1_t2_ids.first==-1)
+      return point_from_id(p2,q2,r2,t1_t2_ids.second);
+    if (t1_t2_ids.second==-1)
+      return point_from_id(p1,q1,r1,t1_t2_ids.first);
+
+    return k.construct_barycenter_3_object()(point_from_id(p2,q2,r2,(t1_t2_ids.second+1)%3), alpha, point_from_id(p2,q2,r2,t1_t2_ids.second)) ;
+  }
+};
+
 template <class Kernel>
-void intersection_coplanar_triangles_cutoff(const typename Kernel::Point_3& p,
-                                            const typename Kernel::Point_3& q,
-                                            const typename Kernel::Point_3& r,
+Point_on_triangle<Kernel>
+intersection(const Point_on_triangle<Kernel>& p,
+             const Point_on_triangle<Kernel>& q,
+             int edge_id_t1,
+             const typename Kernel::Point_3& p1,
+             const typename Kernel::Point_3& q1,
+//             const typename Kernel::Point_3& r1,
+             const typename Kernel::Point_3& p2,
+             const typename Kernel::Point_3& q2,
+             const typename Kernel::Point_3& r2,
+             const Kernel& k)
+{
+  typedef Point_on_triangle<Kernel> Pot;
+  switch(p.id1())
+  {
+    case -1:
+    {
+      switch(q.id1())
+      {
+        case -1: // (-1, ip2) - (-1, iq2)
+        {
+          typename Kernel::FT alpha =
+            coplanar_segment_segment_alpha_intersection(p1, q1,
+                                                        Pot::point_from_id(p2, q2, r2, p.id2()),
+                                                        Pot::point_from_id(p2, q2, r2, q.id2()), k);
+          int sgn = sign(alpha);
+          return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), sgn, alpha); // intersection with an original edge of t2
+        }
+        default:
+          if (q.id2()!=-1) // (-1, ip2) - (iq1, iq2)
+          {
+            // we shorten an already cut edge
+            CGAL_assertion((p.id2()+1)%3 == q.id2());
+
+            typename Kernel::FT alpha =
+              coplanar_segment_segment_alpha_intersection(p1, q1,
+                                                          Pot::point_from_id(p2, q2, r2, p.id2()),
+                                                          Pot::point_from_id(p2, q2, r2, q.id2()), k);
+            int sgn = sign(alpha);
+            return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), sgn, alpha);
+          }
+          // (-1, ip2) - (iq1, -1)
+          //vertex of t1, special case t1 edge passed thru a vertex of t2
+          CGAL_assertion(edge_id_t1 == 2);
+          return  Point_on_triangle<Kernel>(2, -1); // point on t1 has to be created from the intersection of edge 0 and edge 1
+      }
+    }
+    default:
+    {
+      switch(p.id2())
+      {
+        case -1:
+        {
+          switch(q.id1())
+          {
+            case -1: // (ip1, -1) - (-1, iq2)
+              //vertex of t1, special case t1 edge passed thru a vertex of t2
+              return  Point_on_triangle<Kernel>(0, -1);
+            default:
+            {
+              CGAL_assertion(q.id2()!=-1); // (ip1, -1) - (iq2, -1)
+              //(ip1,-1), (iq1, iq2)
+              CGAL_assertion(edge_id_t1==2 && p.id1()==1);
+              return  Point_on_triangle<Kernel>(q.id1()==1?2:0,-1); // vertex of t1
+            }
+          }
+        }
+        default:
+        {
+          switch(q.id1())
+          {
+            case -1: // (ip1, ip2) - (-1, iq2)
+            {
+              // we shorten an already cut edge
+              CGAL_assertion((q.id2()+1)%3 == p.id2());
+
+              typename Kernel::FT alpha =
+                coplanar_segment_segment_alpha_intersection(p1, q1,
+                                                            Pot::point_from_id(p2, q2, r2, q.id2()),
+                                                            Pot::point_from_id(p2, q2, r2, p.id2()), k);
+              int sgn = sign(alpha);
+              return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), sgn, alpha);
+            }
+            default:
+            {
+              switch(q.id2())
+              {
+                case -1: // (ip1, ip2) - (iq1, -1)
+                {
+                  CGAL_assertion(edge_id_t1==2 && q.id1()==1);
+                  return  Point_on_triangle<Kernel>(p.id1()==1?2:0); // vertex of t1
+                }
+                default: // (ip1, ip2) - (iq1, iq2)
+                  return  Point_on_triangle<Kernel>((p.id1()+1)%3==q.id1()?q.id1():p.id1(), -1); // vertex of t1
+              }
+            }
+          }
+        }
+      }
+    }
+  }
+}
+
+template <class Kernel>
+void intersection_coplanar_triangles_cutoff(const typename Kernel::Point_3& p1,
+                                            const typename Kernel::Point_3& q1,
+                                            const typename Kernel::Point_3& r1,
+                                            int edge_id,
+                                            const typename Kernel::Point_3& p2,
+                                            const typename Kernel::Point_3& q2,
+                                            const typename Kernel::Point_3& r2,
                                             const Kernel& k,
-                                            std::list<typename Kernel::Point_3>& inter_pts)
+                                            std::list<Point_on_triangle<Kernel>>& inter_pts)
 {
-  typedef typename std::list<typename Kernel::Point_3>::iterator Iterator;
+  typedef typename std::list<Point_on_triangle<Kernel>>::iterator Iterator;
 
   if(inter_pts.empty())
     return;
 
-  typename Kernel::Coplanar_orientation_3 orient = k.coplanar_orientation_3_object();
-  typename Kernel::Construct_line_3 line = k.construct_line_3_object();
-
-  //orient(p,q,r,r) is POSITIVE
-  std::map<const typename Kernel::Point_3*,Orientation> orientations;
-  for (Iterator it=inter_pts.begin();it!=inter_pts.end();++it)
-    orientations[ &(*it) ]=orient(p,q,r,*it);
+  //orient(p1,q1,r1,r1) is POSITIVE
+  std::map<const Point_on_triangle<Kernel>*,Orientation> orientations; // TODO skip map
+  for (const Point_on_triangle<Kernel>& pot : inter_pts)
+    orientations[ &pot ]=pot.orientation(p1,q1,r1,edge_id,p2,q2,r2,k);
 
-  CGAL_kernel_assertion_code(int pt_added = 0;)
+  CGAL_kernel_assertion_code(int pt_added = 0);
 
-  const typename Kernel::Point_3* prev = &(*boost::prior(inter_pts.end()));
-  Iterator stop = inter_pts.size() > 2 ? inter_pts.end() : boost::prior(inter_pts.end());
+  Iterator prev = std::prev(inter_pts.end());
+  Iterator stop = inter_pts.size() > 2 ? inter_pts.end() : std::prev(inter_pts.end());
   for(Iterator it=inter_pts.begin(); it!=stop; ++it)
   {
-    const typename Kernel::Point_3& curr = *it;
-    Orientation or_prev = orientations[prev],
-                or_curr = orientations[&curr];
+    Orientation or_prev = orientations[&(*prev)],
+                or_curr = orientations[&(*it)];
 
     if((or_prev == POSITIVE && or_curr == NEGATIVE) ||
        (or_prev == NEGATIVE && or_curr == POSITIVE))
     {
-      typename Intersection_traits<Kernel, typename Kernel::Line_3, typename Kernel::Line_3>::result_type
-        obj = intersection(line(p,q), line(*prev,curr), k);
-
-      // assert "not empty"
-      CGAL_kernel_assertion(bool(obj));
+      Point_on_triangle<Kernel> new_pt = intersection(*prev, *it, edge_id, p1, q1, p2, q2, r2, k);
 
-      const typename Kernel::Point_3* inter = intersect_get<typename Kernel::Point_3>(obj);
-      CGAL_kernel_assertion(inter != nullptr);
-
-      prev = &(*inter_pts.insert(it,*inter));
-      orientations[prev] = COLLINEAR;
-      CGAL_kernel_assertion_code(++pt_added;)
+      prev = inter_pts.insert(it,new_pt);
+      orientations[&(*prev)] = COLLINEAR;
+      CGAL_assertion_code(++pt_added);
     }
 
-    prev = &(*it);
+    prev = it;
   }
 
   CGAL_kernel_assertion(pt_added<3);
@@ -98,35 +301,41 @@ intersection_coplanar_triangles(const typename K::Triangle_3& t1,
                                 const typename K::Triangle_3& t2,
                                 const K& k)
 {
-  const typename K::Point_3& p = t1.vertex(0),
-                             q = t1.vertex(1),
-                             r = t1.vertex(2);
+  const typename K::Point_3& p1 = t1.vertex(0),
+                             q1 = t1.vertex(1),
+                             r1 = t1.vertex(2);
+
+  const typename K::Point_3& p2 = t2.vertex(0),
+                             q2 = t2.vertex(1),
+                             r2 = t2.vertex(2);
 
-  std::list<typename K::Point_3> inter_pts;
-  inter_pts.push_back(t2.vertex(0));
-  inter_pts.push_back(t2.vertex(1));
-  inter_pts.push_back(t2.vertex(2));
+  std::list<Point_on_triangle<K>> inter_pts;
+  inter_pts.push_back(Point_on_triangle<K>(-1,0));
+  inter_pts.push_back(Point_on_triangle<K>(-1,1));
+  inter_pts.push_back(Point_on_triangle<K>(-1,2));
 
   //intersect t2 with the three half planes which intersection defines t1
-  intersection_coplanar_triangles_cutoff(p,q,r,k,inter_pts); //line pq
-  intersection_coplanar_triangles_cutoff(q,r,p,k,inter_pts); //line qr
-  intersection_coplanar_triangles_cutoff(r,p,q,k,inter_pts); //line rp
+  intersection_coplanar_triangles_cutoff(p1,q1,r1,0,p2,q2,r2,k,inter_pts); //line pq
+  intersection_coplanar_triangles_cutoff(q1,r1,p1,1,p2,q2,r2,k,inter_pts); //line qr
+  intersection_coplanar_triangles_cutoff(r1,p1,q1,2,p2,q2,r2,k,inter_pts); //line rp
 
+  auto point = [&](const Point_on_triangle<K>& pot){ return pot.point(p1,q1,r1,p2,q2,r2,k); };
   switch(inter_pts.size())
   {
     case 0:
       return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>();
     case 1:
-      return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>(*inter_pts.begin());
+      return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>(point(*inter_pts.begin()));
     case 2:
       return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>(
-            k.construct_segment_3_object()(*inter_pts.begin(), *boost::next(inter_pts.begin())) );
+            k.construct_segment_3_object()(point(*inter_pts.begin()), point(*std::next(inter_pts.begin()))) );
     case 3:
       return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>(
-            k.construct_triangle_3_object()(*inter_pts.begin(), *boost::next(inter_pts.begin()), *boost::prior(inter_pts.end())) );
+            k.construct_triangle_3_object()(point(*inter_pts.begin()), point(*std::next(inter_pts.begin())), point(*std::prev(inter_pts.end()))) );
     default:
       return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>(
-            std::vector<typename K::Point_3>(inter_pts.begin(),inter_pts.end()));
+            std::vector<typename K::Point_3>(boost::make_transform_iterator(inter_pts.begin(), point),
+                                             boost::make_transform_iterator(inter_pts.end(), point)));
   }
 }
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index ae9858ae77d5..6d0334d93661 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -36,8 +36,8 @@
 
 #include <vector>
 
-// #define TEST_RESOLVE_INTERSECTION
-// #define DEDUPLICATE_SEGMENTS
+//#define TEST_RESOLVE_INTERSECTION
+//#define DEDUPLICATE_SEGMENTS
 
 namespace CGAL {
 namespace Polygon_mesh_processing {
@@ -259,6 +259,9 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   if (ori[0]== COPLANAR && ori[1]==COPLANAR && ori[2]==COPLANAR)
   {
     coplanar_intersections<K>(t1, t2, inter_pts);
+    for (auto p : inter_pts)
+      if (depth(p)>2) throw std::runtime_error("Depth is not 2: "+std::to_string(depth(p)));
+
     return;
   }
 
@@ -283,6 +286,11 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   std::sort(inter_pts.begin(), inter_pts.end());
   auto last = std::unique(inter_pts.begin(), inter_pts.end());
   inter_pts.erase(last, inter_pts.end());
+
+
+  for (auto p : inter_pts)
+    if (depth(p)>2) throw std::runtime_error("Depth is not 2: "+std::to_string(depth(p)));
+
 }
 
 //////////////////////////////////
@@ -300,6 +308,10 @@ void generate_subtriangles(std::size_t ti,
                            const std::vector<std::array<typename EK::Point_3,3>>& triangles,
                            std::vector<std::array<typename EK::Point_3,3>>& new_triangles)
 {
+  //~ std::cout << "generate_subtriangles()\n";
+  std::cout << std::setprecision(17);
+
+
   typedef CGAL::Projection_traits_3<EK> P_traits;
   typedef CGAL::Exact_intersections_tag Itag;
 
@@ -395,7 +407,7 @@ void generate_subtriangles(std::size_t ti,
                 points_on_segments[i].push_back(*pt_ptr);
                 points_on_segments[j].push_back(*pt_ptr);
 
-                //~ std::cout << "new inter " << *pt_ptr << "\n";
+                //~ std::cout << "new inter " << *pt_ptr << " (" << depth(points_on_segments[i].back()) << ")" << "\n";
 
               }
             }
@@ -417,7 +429,7 @@ void generate_subtriangles(std::size_t ti,
                 points_on_segments[i].push_back(*pt_ptr);
                 points_on_segments[j].push_back(*pt_ptr);
 
-                //~ std::cout << "new inter bis" << *pt_ptr << "\n";
+                //~ std::cout << "new inter bis " << *pt_ptr << " (" << depth(points_on_segments[i].back()) << ")" <<  "\n";
               }
               else
               {
@@ -428,6 +440,8 @@ void generate_subtriangles(std::size_t ti,
                   points_on_segments[i].push_back(seg_ptr->target());
                   points_on_segments[j].push_back(seg_ptr->target());
 
+                  //~ std::cout << "new inter seg " << *seg_ptr << " (" << depth(*seg_ptr) << ")" <<  "\n";
+
                 }
                 else
                   throw std::runtime_error("BOOM\n");
@@ -537,6 +551,20 @@ void generate_subtriangles(std::size_t ti,
       }
     }
 
+    //~ int max_degree = 0;
+    //~ for (const auto p : cst_points)
+      //~ max_degree = std::max(max_degree, depth(p));
+    //~ std::cout << "max_degree " << max_degree << "\n";
+
+    //~ if (max_degree > 10){
+      //~ for (const auto p : cst_points)
+        //~ std::cout << " -- " << p << "(" << depth(p) << ")\n";
+      //~ std::cout << "segments:\n";
+      //~ for (auto s : segments)
+        //~ std::cout << "  " << depth(s[0]) << " " << depth(s[1]) << "\n";
+      //~ exit(1);
+    //~ }
+
     cdt.insert_constraints(cst_points.begin(), cst_points.end(), csts.begin(), csts.end());
 
     std::vector<std::array<typename EK::Point_3,2>> no_inter_segments;

From 8e050bdb49c5268af0e12bb48bcf34edd01db96c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 1 Mar 2023 15:39:28 +0100
Subject: [PATCH 0173/1398] fix various bug and add debug

triangle_3_triangle_3_intersection now passes
---
 .../Triangle_3_Triangle_3_intersection.h      | 131 +++++++++++++-----
 1 file changed, 98 insertions(+), 33 deletions(-)

diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index d4e467a07986..55610e867ff3 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -14,6 +14,8 @@
 #ifndef CGAL_INTERNAL_INTERSECTIONS_TRIANGLE_3_TRIANGLE_3_INTERSECTION_H
 #define CGAL_INTERNAL_INTERSECTIONS_TRIANGLE_3_TRIANGLE_3_INTERSECTION_H
 
+//#define CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+
 #include <CGAL/Intersection_traits_3.h>
 #include <CGAL/Intersections_3/internal/Line_3_Triangle_3_intersection.h>
 #include <CGAL/Intersections_3/internal/Line_3_Line_3_intersection.h>
@@ -74,21 +76,20 @@ struct Point_on_triangle
     }
   }
 
-  Point_on_triangle(int i1, int i2=-1, int sign=0, typename Kernel::FT alpha = 0.) // TODO add global zero()?
+  Point_on_triangle(int i1, int i2=-1, typename Kernel::FT alpha = 0.) // TODO add global zero()?
     : t1_t2_ids(i1,i2)
-    , sign(sign)
+    , alpha(alpha)
   {}
 
   // (id, -1) point on t1
   // (-1, id) point on t2
   // (id1, id2) intersection of edges
   std::pair<int, int> t1_t2_ids;
-  int sign;
   typename Kernel::FT alpha;
 
   Orientation
-  orientation (const typename Kernel::Point_3& p1, // source of edge edge_ids1
-               const typename Kernel::Point_3& q1, // target of edge edge_ids1
+  orientation (const typename Kernel::Point_3& p1, // source of edge edge_id1
+               const typename Kernel::Point_3& q1, // target of edge edge_id1
                const typename Kernel::Point_3& r1,
                int edge_id1,
                const typename Kernel::Point_3& p2,
@@ -98,15 +99,21 @@ struct Point_on_triangle
   {
     if (t1_t2_ids.first!=-1)
     {
-      if (t1_t2_ids.second==-1) return ZERO; // it is a point on t1
+      if (t1_t2_ids.second==-1)
+        return (edge_id1==t1_t2_ids.first || (edge_id1+1)%3==t1_t2_ids.first) ? ZERO:POSITIVE; // it is a point on t1
       // this is an intersection point
-      if (sign == 0)
-        return POSITIVE;
-      if (sign == -1)
-        return edge_id1==t1_t2_ids.first+1?POSITIVE:NEGATIVE;
-      else
-        return edge_id1==t1_t2_ids.first+1?NEGATIVE:POSITIVE;
-    }
+
+      if (t1_t2_ids.first==edge_id1)
+        return ZERO;
+      if (t1_t2_ids.first==(edge_id1+1)%3)
+      {
+        if (alpha==0) return ZERO;
+        return alpha>=0 ? POSITIVE:NEGATIVE;
+      }
+      CGAL_assertion((t1_t2_ids.first+1)%3==edge_id1);
+      if (alpha==1) return ZERO;
+      return alpha<=1?POSITIVE:NEGATIVE;
+  }
     else
     {
       //this is an input point of t2
@@ -150,6 +157,11 @@ intersection(const Point_on_triangle<Kernel>& p,
              const typename Kernel::Point_3& r2,
              const Kernel& k)
 {
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::cout << "    calling intersection: ";
+  std::cout << "  (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "])-";
+  std::cout << "  (" << q.id1() << "," << q.id2() << ",[" << q.alpha << "])  || e" << edge_id_t1 << "\n";
+#endif
   typedef Point_on_triangle<Kernel> Pot;
   switch(p.id1())
   {
@@ -163,21 +175,23 @@ intersection(const Point_on_triangle<Kernel>& p,
             coplanar_segment_segment_alpha_intersection(p1, q1,
                                                         Pot::point_from_id(p2, q2, r2, p.id2()),
                                                         Pot::point_from_id(p2, q2, r2, q.id2()), k);
-          int sgn = sign(alpha);
-          return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), sgn, alpha); // intersection with an original edge of t2
+          return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), alpha); // intersection with an original edge of t2
         }
         default:
           if (q.id2()!=-1) // (-1, ip2) - (iq1, iq2)
           {
-            // we shorten an already cut edge
-            CGAL_assertion((p.id2()+1)%3 == q.id2());
-
-            typename Kernel::FT alpha =
-              coplanar_segment_segment_alpha_intersection(p1, q1,
-                                                          Pot::point_from_id(p2, q2, r2, p.id2()),
-                                                          Pot::point_from_id(p2, q2, r2, q.id2()), k);
-            int sgn = sign(alpha);
-            return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), sgn, alpha);
+            if (p.id2() == q.id2() || p.id2() == (q.id2()+1)%3)
+            {
+              // points are on the same edge of t2 --> we shorten an already cut edge
+              typename Kernel::FT alpha =
+                coplanar_segment_segment_alpha_intersection(p1, q1,
+                                                            Pot::point_from_id(p2, q2, r2,  q.id2()),
+                                                            Pot::point_from_id(p2, q2, r2, (q.id2()+1)%3), k);
+
+              return  Point_on_triangle<Kernel>(edge_id_t1, q.id2(), alpha);
+            }
+            // point of t1
+            return  Point_on_triangle<Kernel>((q.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3 , -1);
           }
           // (-1, ip2) - (iq1, -1)
           //vertex of t1, special case t1 edge passed thru a vertex of t2
@@ -211,15 +225,18 @@ intersection(const Point_on_triangle<Kernel>& p,
           {
             case -1: // (ip1, ip2) - (-1, iq2)
             {
-              // we shorten an already cut edge
-              CGAL_assertion((q.id2()+1)%3 == p.id2());
+              if (q.id2() == p.id2() || q.id2() == (p.id2()+1)%3)
+              {
+                // points are on the same edge of t2 --> we shorten an already cut edge
+                typename Kernel::FT alpha =
+                  coplanar_segment_segment_alpha_intersection(p1, q1,
+                                                              Pot::point_from_id(p2, q2, r2,  p.id2()),
+                                                              Pot::point_from_id(p2, q2, r2, (p.id2()+1)%3), k);
 
-              typename Kernel::FT alpha =
-                coplanar_segment_segment_alpha_intersection(p1, q1,
-                                                            Pot::point_from_id(p2, q2, r2, q.id2()),
-                                                            Pot::point_from_id(p2, q2, r2, p.id2()), k);
-              int sgn = sign(alpha);
-              return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), sgn, alpha);
+                return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), alpha);
+              }
+              // point of t1
+              return  Point_on_triangle<Kernel>((p.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3 , -1);
             }
             default:
             {
@@ -231,7 +248,8 @@ intersection(const Point_on_triangle<Kernel>& p,
                   return  Point_on_triangle<Kernel>(p.id1()==1?2:0); // vertex of t1
                 }
                 default: // (ip1, ip2) - (iq1, iq2)
-                  return  Point_on_triangle<Kernel>((p.id1()+1)%3==q.id1()?q.id1():p.id1(), -1); // vertex of t1
+                  CGAL_assertion(p.id1()==q.id1());
+                  return  Point_on_triangle<Kernel>((p.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3, -1); // vertex of t1
               }
             }
           }
@@ -252,6 +270,11 @@ void intersection_coplanar_triangles_cutoff(const typename Kernel::Point_3& p1,
                                             const Kernel& k,
                                             std::list<Point_on_triangle<Kernel>>& inter_pts)
 {
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::cout << "  cutoff using e" << edge_id << ": "
+            << to_double(p1.x()) << " " << to_double(p1.y()) << " " << to_double(p1.z()) << " "
+            << to_double(q1.x()) << " " << to_double(q1.y()) << " " << to_double(q1.z()) << "\n";
+#endif
   typedef typename std::list<Point_on_triangle<Kernel>>::iterator Iterator;
 
   if(inter_pts.empty())
@@ -262,6 +285,12 @@ void intersection_coplanar_triangles_cutoff(const typename Kernel::Point_3& p1,
   for (const Point_on_triangle<Kernel>& pot : inter_pts)
     orientations[ &pot ]=pot.orientation(p1,q1,r1,edge_id,p2,q2,r2,k);
 
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::cout << "    Orientations:";
+  for (const Point_on_triangle<Kernel>& pot : inter_pts)
+    std::cout << " " << orientations[ &pot ];
+  std::cout << "\n";
+#endif
   CGAL_kernel_assertion_code(int pt_added = 0);
 
   Iterator prev = std::prev(inter_pts.end());
@@ -301,6 +330,22 @@ intersection_coplanar_triangles(const typename K::Triangle_3& t1,
                                 const typename K::Triangle_3& t2,
                                 const K& k)
 {
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  auto to_string = [](const typename K::Triangle_3& t)
+  {
+    std::stringstream sstr;
+    sstr << "4 "
+         << to_double(t[0].x()) << " "  << to_double(t[0].y()) << " "  << to_double(t[0].z()) << " "
+         << to_double(t[1].x()) << " "  << to_double(t[1].y()) << " "  << to_double(t[1].z()) << " "
+         << to_double(t[2].x()) << " "  << to_double(t[2].y()) << " "  << to_double(t[2].z()) << " "
+         << to_double(t[0].x()) << " "  << to_double(t[0].y()) << " "  << to_double(t[0].z()) << "\n";
+    return sstr.str();
+  };
+
+  std::cout << "intersection_coplanar_triangles\n";
+  std::ofstream("/tmp/t1.polylines.txt") << to_string(t1) << "\n";
+  std::ofstream("/tmp/t2.polylines.txt") << to_string(t2) << "\n";
+#endif
   const typename K::Point_3& p1 = t1.vertex(0),
                              q1 = t1.vertex(1),
                              r1 = t1.vertex(2);
@@ -314,10 +359,30 @@ intersection_coplanar_triangles(const typename K::Triangle_3& t1,
   inter_pts.push_back(Point_on_triangle<K>(-1,1));
   inter_pts.push_back(Point_on_triangle<K>(-1,2));
 
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  auto print_points = [&]()
+  {
+    for(auto p : inter_pts) std::cout << "  (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) "; std::cout <<"\n";
+  };
+  std::cout << "  ipts size: " << inter_pts.size() << "\n";
+  print_points();
+#endif
   //intersect t2 with the three half planes which intersection defines t1
   intersection_coplanar_triangles_cutoff(p1,q1,r1,0,p2,q2,r2,k,inter_pts); //line pq
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::cout << "  ipts size: " << inter_pts.size() << "\n";
+  print_points();
+#endif
   intersection_coplanar_triangles_cutoff(q1,r1,p1,1,p2,q2,r2,k,inter_pts); //line qr
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::cout << "  ipts size: " << inter_pts.size() << "\n";
+  print_points();
+#endif
   intersection_coplanar_triangles_cutoff(r1,p1,q1,2,p2,q2,r2,k,inter_pts); //line rp
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::cout << "  ipts size: " << inter_pts.size() << "\n";
+  print_points();
+#endif
 
   auto point = [&](const Point_on_triangle<K>& pot){ return pot.point(p1,q1,r1,p2,q2,r2,k); };
   switch(inter_pts.size())

From 0bf300d5c51ea71657925aec1a3e6721729cc3c7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 1 Mar 2023 17:19:35 +0100
Subject: [PATCH 0174/1398] plug new coplanar triangle intersection code

---
 .../Polygon_mesh_processing/autorefinement.h  | 38 ++++++++++++++-----
 1 file changed, 28 insertions(+), 10 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 6d0334d93661..b87a04c8a6a2 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -83,26 +83,44 @@ do_coplanar_segments_intersect(const std::array<typename K::Point_3, 2>& s1,
 //////////////////////////////////
 
 // imported from Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
-
 template<class K>
 void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
                             const std::array<typename K::Point_3, 3>& t2,
                             std::vector<typename K::Point_3>& inter_pts)
 {
-  const typename K::Point_3& p = t1[0], q = t1[1], r = t1[2];
+  const typename K::Point_3& p1 = t1[0], q1 = t1[1], r1 = t1[2];
+  const typename K::Point_3& p2 = t2[0], q2 = t2[1], r2 = t2[2];
+
+  std::list<Intersections::internal::Point_on_triangle<K>> l_inter_pts;
+  l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(-1,0));
+  l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(-1,1));
+  l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(-1,2));
+
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  auto to_string = [](const auto& t)
+  {
+    std::stringstream sstr;
+    sstr << "4 "
+         << to_double(t[0].x()) << " "  << to_double(t[0].y()) << " "  << to_double(t[0].z()) << " "
+         << to_double(t[1].x()) << " "  << to_double(t[1].y()) << " "  << to_double(t[1].z()) << " "
+         << to_double(t[2].x()) << " "  << to_double(t[2].y()) << " "  << to_double(t[2].z()) << " "
+         << to_double(t[0].x()) << " "  << to_double(t[0].y()) << " "  << to_double(t[0].z()) << "\n";
+    return sstr.str();
+  };
 
-  std::list<typename K::Point_3> l_inter_pts;
-  l_inter_pts.push_back(t2[0]);
-  l_inter_pts.push_back(t2[1]);
-  l_inter_pts.push_back(t2[2]);
+  std::cout << "intersection_coplanar_triangles\n";
+  std::ofstream("/tmp/t1.polylines.txt") << to_string(t1) << "\n";
+  std::ofstream("/tmp/t2.polylines.txt") << to_string(t2) << "\n";
+#endif
 
   //intersect t2 with the three half planes which intersection defines t1
   K k;
-  Intersections::internal::intersection_coplanar_triangles_cutoff(p,q,r,k,l_inter_pts); //line pq
-  Intersections::internal::intersection_coplanar_triangles_cutoff(q,r,p,k,l_inter_pts); //line qr
-  Intersections::internal::intersection_coplanar_triangles_cutoff(r,p,q,k,l_inter_pts); //line rp
+  intersection_coplanar_triangles_cutoff(p1,q1,r1,0,p2,q2,r2,k,l_inter_pts); //line p1q1
+  intersection_coplanar_triangles_cutoff(q1,r1,p1,1,p2,q2,r2,k,l_inter_pts); //line q1r1
+  intersection_coplanar_triangles_cutoff(r1,p1,q1,2,p2,q2,r2,k,l_inter_pts); //line r1p1
 
-  inter_pts.assign(l_inter_pts.begin(), l_inter_pts.end());
+  for (const Intersections::internal::Point_on_triangle<K>& pot : l_inter_pts)
+    inter_pts.push_back( pot.point(p1,q1,r1,p2,q2,r2,k) );
 }
 
 // imported from Polygon_mesh_processing/internal/Corefinement/intersect_triangle_segment_3.h

From 4fa600bc5fbf357f071817c7e8a775e89d9b2fa7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 3 Mar 2023 10:33:16 +0100
Subject: [PATCH 0175/1398] bug fix

---
 .../internal/Triangle_3_Triangle_3_intersection.h | 15 +++++++++++++--
 1 file changed, 13 insertions(+), 2 deletions(-)

diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index 55610e867ff3..7c6ad7b95f82 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -33,6 +33,7 @@ namespace CGAL {
 namespace Intersections {
 namespace internal{
 
+//TODO: move into a functor
 template <class K>
 typename K::FT
 coplanar_segment_segment_alpha_intersection(const typename K::Point_3& p1, const typename K::Point_3& p2, // segment 1
@@ -248,8 +249,18 @@ intersection(const Point_on_triangle<Kernel>& p,
                   return  Point_on_triangle<Kernel>(p.id1()==1?2:0); // vertex of t1
                 }
                 default: // (ip1, ip2) - (iq1, iq2)
-                  CGAL_assertion(p.id1()==q.id1());
-                  return  Point_on_triangle<Kernel>((p.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3, -1); // vertex of t1
+                {
+                  CGAL_assertion(p.id1()==q.id1() || p.id2()==q.id2() );
+
+                  if (p.id1()==q.id1())
+                    return  Point_on_triangle<Kernel>((p.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3, -1); // vertex of t1
+
+                  typename Kernel::FT alpha =
+                    coplanar_segment_segment_alpha_intersection(p1, q1,
+                                                                Pot::point_from_id(p2, q2, r2,  q.id2()),
+                                                                Pot::point_from_id(p2, q2, r2, (q.id2()+1)%3), k);
+                  return  Point_on_triangle<Kernel>(edge_id_t1, q.id2(), alpha);
+                }
               }
             }
           }

From 2fade292146be00a4d383c8a0356802de81aa708 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 3 Mar 2023 10:35:42 +0100
Subject: [PATCH 0176/1398] add more debug

---
 .../Polygon_mesh_processing/autorefinement.h  | 24 +++++++++++++++++--
 1 file changed, 22 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index b87a04c8a6a2..c5f3ebb78905 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -38,6 +38,7 @@
 
 //#define TEST_RESOLVE_INTERSECTION
 //#define DEDUPLICATE_SEGMENTS
+//#define DEBUG_DEPTH
 
 namespace CGAL {
 namespace Polygon_mesh_processing {
@@ -111,13 +112,31 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
   std::cout << "intersection_coplanar_triangles\n";
   std::ofstream("/tmp/t1.polylines.txt") << to_string(t1) << "\n";
   std::ofstream("/tmp/t2.polylines.txt") << to_string(t2) << "\n";
+  auto print_points = [&]()
+  {
+    for(auto p : l_inter_pts) std::cout << "  (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) "; std::cout <<"\n";
+  };
+  std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
+  print_points();
 #endif
 
   //intersect t2 with the three half planes which intersection defines t1
   K k;
   intersection_coplanar_triangles_cutoff(p1,q1,r1,0,p2,q2,r2,k,l_inter_pts); //line p1q1
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
+  print_points();
+#endif
   intersection_coplanar_triangles_cutoff(q1,r1,p1,1,p2,q2,r2,k,l_inter_pts); //line q1r1
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
+  print_points();
+#endif
   intersection_coplanar_triangles_cutoff(r1,p1,q1,2,p2,q2,r2,k,l_inter_pts); //line r1p1
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
+  print_points();
+#endif
 
   for (const Intersections::internal::Point_on_triangle<K>& pot : l_inter_pts)
     inter_pts.push_back( pot.point(p1,q1,r1,p2,q2,r2,k) );
@@ -277,8 +296,10 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   if (ori[0]== COPLANAR && ori[1]==COPLANAR && ori[2]==COPLANAR)
   {
     coplanar_intersections<K>(t1, t2, inter_pts);
+#ifdef DEBUG_DEPTH
     for (auto p : inter_pts)
-      if (depth(p)>2) throw std::runtime_error("Depth is not 2: "+std::to_string(depth(p)));
+      if (depth(p)>2) throw std::runtime_error("Depth is not 4: "+std::to_string(depth(p)));
+#endif
 
     return;
   }
@@ -308,7 +329,6 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
 
   for (auto p : inter_pts)
     if (depth(p)>2) throw std::runtime_error("Depth is not 2: "+std::to_string(depth(p)));
-
 }
 
 //////////////////////////////////

From f3e4a60f96be4fe94124a8c945a0bd3bd2f5ffb2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 6 Mar 2023 14:03:24 +0100
Subject: [PATCH 0177/1398] fix intersection point computation

---
 .../internal/Triangle_3_Triangle_3_intersection.h      | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index 7c6ad7b95f82..ac376f443506 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -141,7 +141,7 @@ struct Point_on_triangle
     if (t1_t2_ids.second==-1)
       return point_from_id(p1,q1,r1,t1_t2_ids.first);
 
-    return k.construct_barycenter_3_object()(point_from_id(p2,q2,r2,(t1_t2_ids.second+1)%3), alpha, point_from_id(p2,q2,r2,t1_t2_ids.second)) ;
+    return k.construct_barycenter_3_object()(point_from_id(p1,q1,r1,(t1_t2_ids.first+1)%3), alpha, point_from_id(p1,q1,r1,t1_t2_ids.first)) ;
   }
 };
 
@@ -160,8 +160,8 @@ intersection(const Point_on_triangle<Kernel>& p,
 {
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "    calling intersection: ";
-  std::cout << "  (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "])-";
-  std::cout << "  (" << q.id1() << "," << q.id2() << ",[" << q.alpha << "])  || e" << edge_id_t1 << "\n";
+  std::cout << " (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) -";
+  std::cout << " (" << q.id1() << "," << q.id2() << ",[" << q.alpha << "]) || e" << edge_id_t1 << "\n";
 #endif
   typedef Point_on_triangle<Kernel> Pot;
   switch(p.id1())
@@ -354,8 +354,8 @@ intersection_coplanar_triangles(const typename K::Triangle_3& t1,
   };
 
   std::cout << "intersection_coplanar_triangles\n";
-  std::ofstream("/tmp/t1.polylines.txt") << to_string(t1) << "\n";
-  std::ofstream("/tmp/t2.polylines.txt") << to_string(t2) << "\n";
+  std::ofstream("/tmp/t1.polylines.txt") << std::setprecision(17) << to_string(t1) << "\n";
+  std::ofstream("/tmp/t2.polylines.txt") << std::setprecision(17) << to_string(t2) << "\n";
 #endif
   const typename K::Point_3& p1 = t1.vertex(0),
                              q1 = t1.vertex(1),

From f499c392664483298fb4c26bc587cce758671b37 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 6 Mar 2023 19:30:07 +0100
Subject: [PATCH 0178/1398] add a version with fixed dimension for projection

---
 .../Polygon_mesh_processing/autorefinement.h  | 54 +++++++++++++++++--
 1 file changed, 49 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index c5f3ebb78905..7524c9c7f342 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -38,8 +38,13 @@
 
 //#define TEST_RESOLVE_INTERSECTION
 //#define DEDUPLICATE_SEGMENTS
+//#define USE_FIXED_PROJECTION_TRAITS
 //#define DEBUG_DEPTH
 
+#ifdef USE_FIXED_PROJECTION_TRAITS
+#include <CGAL/Kernel_23/internal/Projection_traits_3.h>
+#endif
+
 namespace CGAL {
 namespace Polygon_mesh_processing {
 
@@ -337,7 +342,11 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
 //////////////////////////////////
 //////////////////////////////////
 
-template <class EK>
+template <class EK
+#ifdef USE_FIXED_PROJECTION_TRAITS
+, int dim
+#endif
+>
 void generate_subtriangles(std::size_t ti,
                            std::vector<std::array<typename EK::Point_3, 2>>& segments,
                            const std::vector<typename EK::Point_3>& points,
@@ -349,8 +358,11 @@ void generate_subtriangles(std::size_t ti,
   //~ std::cout << "generate_subtriangles()\n";
   std::cout << std::setprecision(17);
 
-
+#ifdef USE_FIXED_PROJECTION_TRAITS
+  typedef ::CGAL::internal::Projection_traits_3<EK, dim> P_traits;
+#else
   typedef CGAL::Projection_traits_3<EK> P_traits;
+#endif
   typedef CGAL::Exact_intersections_tag Itag;
 
   typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits
@@ -367,20 +379,28 @@ void generate_subtriangles(std::size_t ti,
   typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
   typename EK::Point_3 o(CGAL::ORIGIN);
 
+#ifdef USE_FIXED_PROJECTION_TRAITS
+  P_traits cdt_traits;
+  bool orientation_flipped = false;
+  CDT cdt(cdt_traits);
+  // TODO: still need to figure out why I can't make the orientation_flipped correctly
+  cdt.insert(t[0]);
+  cdt.insert(t[1]);
+  cdt.insert(t[2]);
+#else
+  P_traits cdt_traits(n);
   bool orientation_flipped = false;
   if ( typename EK::Less_xyz_3()(o+n,o) )
   {
     n=-n;
     orientation_flipped = true;
   }
-
-  P_traits cdt_traits(n);
   CDT cdt(cdt_traits);
-
   cdt.insert_outside_affine_hull(t[0]);
   cdt.insert_outside_affine_hull(t[1]);
   typename CDT::Vertex_handle v = cdt.tds().insert_dim_up(cdt.infinite_vertex(), orientation_flipped);
   v->set_point(t[2]);
+#endif
 
 #ifdef TEST_RESOLVE_INTERSECTION
   //~ static std::ofstream debug("inter_segments.polylines.txt");
@@ -832,7 +852,31 @@ void autorefine_soup_output(const PointRange& input_points,
     if (all_segments[ti].empty() && all_points[ti].empty())
       new_triangles.push_back(triangles[ti]);
     else
+    {
+      #ifdef USE_FIXED_PROJECTION_TRAITS
+      const std::array<typename EK::Point_3, 3>& t = triangles[ti];
+      auto is_constant_in_dim = [](const std::array<typename EK::Point_3, 3>& t, int dim)
+      {
+        return t[0][dim]==t[1][dim] && t[0][dim]!=t[2][dim];
+      };
+
+      typename EK::Vector_3 orth = CGAL::normal(t[0], t[1], t[2]); // TODO::avoid construction?
+      int c = CGAL::abs(orth[0]) > CGAL::abs(orth[1]) ? 0 : 1;
+      c = CGAL::abs(orth[2]) > CGAL::abs(orth[c]) ? 2 : c;
+
+      if(c == 0) {
+        autorefine_impl::generate_subtriangles<EK, 0>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+      } else if(c == 1) {
+        autorefine_impl::generate_subtriangles<EK, 1>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+      } else if(c == 2) {
+        autorefine_impl::generate_subtriangles<EK, 2>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+      }
+      #else
       autorefine_impl::generate_subtriangles<EK>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+      #endif
+    }
+
+
   }
 
   // brute force output: create a soup, orient and to-mesh

From 3abf7c401b67eefc2a2408dbac40c11f7e933203 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 6 Mar 2023 19:31:26 +0100
Subject: [PATCH 0179/1398] add debug

---
 .../CGAL/Polygon_mesh_processing/autorefinement.h   | 13 +++++++++++++
 1 file changed, 13 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 7524c9c7f342..e5a7dbbb139e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -145,6 +145,19 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
 
   for (const Intersections::internal::Point_on_triangle<K>& pot : l_inter_pts)
     inter_pts.push_back( pot.point(p1,q1,r1,p2,q2,r2,k) );
+
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::ofstream debug("interpts.xyz");
+  debug << std::setprecision(17);
+  debug << l_inter_pts.size() << "\n";
+  for (auto pot : l_inter_pts)
+    debug << pot.point(p1,q1,r1,p2,q2,r2,k)  << "\n";
+  debug.close();
+  std::cout <<"check!\n";
+  int i;
+  std::cin >> i;
+#endif
+
 }
 
 // imported from Polygon_mesh_processing/internal/Corefinement/intersect_triangle_segment_3.h

From 8ff9f17a415524a52aa253b3c148ad45459de656 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 13 Mar 2023 15:33:35 +0100
Subject: [PATCH 0180/1398] restore traits creation

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h      | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index e5a7dbbb139e..3bb845854ec2 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -401,13 +401,14 @@ void generate_subtriangles(std::size_t ti,
   cdt.insert(t[1]);
   cdt.insert(t[2]);
 #else
-  P_traits cdt_traits(n);
   bool orientation_flipped = false;
   if ( typename EK::Less_xyz_3()(o+n,o) )
   {
     n=-n;
     orientation_flipped = true;
   }
+
+  P_traits cdt_traits(n);
   CDT cdt(cdt_traits);
   cdt.insert_outside_affine_hull(t[0]);
   cdt.insert_outside_affine_hull(t[1]);

From 14105bbdd4319109f83b256b7af86e855870a487 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 14 Mar 2023 13:56:54 +0100
Subject: [PATCH 0181/1398] always use local indices for range insertion of
 constraints

---
 .../Polygon_mesh_processing/autorefinement.h  | 253 ++++++++++++------
 1 file changed, 167 insertions(+), 86 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 3bb845854ec2..a81b00f65a48 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -37,7 +37,8 @@
 #include <vector>
 
 //#define TEST_RESOLVE_INTERSECTION
-//#define DEDUPLICATE_SEGMENTS
+#define DEDUPLICATE_SEGMENTS
+//#define DEBUG_COUNTERS
 //#define USE_FIXED_PROJECTION_TRAITS
 //#define DEBUG_DEPTH
 
@@ -45,6 +46,10 @@
 #include <CGAL/Kernel_23/internal/Projection_traits_3.h>
 #endif
 
+#ifdef DEBUG_COUNTERS
+#include <CGAL/Real_timer.h>
+#endif
+
 namespace CGAL {
 namespace Polygon_mesh_processing {
 
@@ -55,28 +60,28 @@ enum Segment_inter_type { NO_INTERSECTION=0, COPLANAR_SEGMENTS, POINT_INTERSECTI
 
 template <class K>
 Segment_inter_type
-do_coplanar_segments_intersect(const std::array<typename K::Point_3, 2>& s1,
-                               const std::array<typename K::Point_3, 2>& s2,
+do_coplanar_segments_intersect(const typename K::Point_3& s1_0, const typename K::Point_3& s1_1,
+                               const typename K::Point_3& s2_0, const typename K::Point_3& s2_1,
                                const K& k = K())
 {
   // supporting_line intersects: points are coplanar
   typename K::Coplanar_orientation_3 cpl_orient=k.coplanar_orientation_3_object();
-  ::CGAL::Orientation or1 = cpl_orient(s1[0], s1[1], s2[0]);
-  ::CGAL::Orientation or2 = cpl_orient(s1[0], s1[1], s2[1]);
+  ::CGAL::Orientation or1 = cpl_orient(s1_0, s1_1, s2_0);
+  ::CGAL::Orientation or2 = cpl_orient(s1_0, s1_1, s2_1);
 
   if(or1 == COLLINEAR && or2 == COLLINEAR)
   {
     // segments are collinear
     typename K::Collinear_are_ordered_along_line_3 cln_order = k.collinear_are_ordered_along_line_3_object();
-    return (cln_order(s1[0], s2[0], s1[1]) ||
-            cln_order(s1[0], s2[1], s1[1]) ||
-            cln_order(s2[0], s1[0], s2[1])) ? COPLANAR_SEGMENTS : NO_INTERSECTION;
+    return (cln_order(s1_0, s2_0, s1_1) ||
+            cln_order(s1_0, s2_1, s1_1) ||
+            cln_order(s2_0, s1_0, s2_1)) ? COPLANAR_SEGMENTS : NO_INTERSECTION;
   }
 
   if(or1 != or2)
   {
-    or1 = cpl_orient(s2[0], s2[1], s1[0]);
-    return (or1 == COLLINEAR || or1 != cpl_orient(s2[0], s2[1], s1[1])) ? POINT_INTERSECTION : NO_INTERSECTION;
+    or1 = cpl_orient(s2_0, s2_1, s1_0);
+    return (or1 == COLLINEAR || or1 != cpl_orient(s2_0, s2_1, s1_1)) ? POINT_INTERSECTION : NO_INTERSECTION;
   }
 
   return NO_INTERSECTION;
@@ -361,8 +366,8 @@ template <class EK
 #endif
 >
 void generate_subtriangles(std::size_t ti,
-                           std::vector<std::array<typename EK::Point_3, 2>>& segments,
-                           const std::vector<typename EK::Point_3>& points,
+                           std::vector<std::pair<std::size_t, std::size_t>>& segments,
+                           std::vector<typename EK::Point_3>& points,
                            const std::vector<std::size_t>& in_triangle_ids,
                            const std::set<std::pair<std::size_t, std::size_t> >& intersecting_triangles,
                            const std::vector<std::array<typename EK::Point_3,3>>& triangles,
@@ -376,13 +381,14 @@ void generate_subtriangles(std::size_t ti,
 #else
   typedef CGAL::Projection_traits_3<EK> P_traits;
 #endif
-  typedef CGAL::Exact_intersections_tag Itag;
 
-  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits
 #ifndef TEST_RESOLVE_INTERSECTION
-  ,Default, Itag
+  typedef CGAL::Exact_intersections_tag Itag;
+#else
+  typedef CGAL::No_constraint_intersection_tag Itag;
 #endif
-> CDT_2;
+
+  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits ,Default, Itag> CDT_2;
   //typedef CGAL::Constrained_triangulation_plus_2<CDT_base> CDT;
   typedef CDT_2 CDT;
 
@@ -416,6 +422,35 @@ void generate_subtriangles(std::size_t ti,
   v->set_point(t[2]);
 #endif
 
+#ifdef DEBUG_COUNTERS
+  struct Counter
+  {
+    int c1=0;
+    int c2=0;
+    int c3=0;
+    int c4=0;
+    int total=0;
+    ~Counter()
+    {
+      std::cout << "intersection of 3 planes: " << c1 << "\n";
+      std::cout << "coplanar segment intersection : " << c2 << "\n";
+      std::cout << "coplanar segment overlap: " << c3 << "\n";
+      std::cout << "no intersection: " << c4 << "\n";
+      std::cout << "# pairs of segments : " << total << "\n";
+      std::cout << "time computing segment intersections: " << timer1.time() << "\n";
+      std::cout << "time sorting intersection points: " << timer2.time() << "\n";
+      std::cout << "time for cdt of constraints: " << timer3.time() << "\n";
+    }
+    CGAL::Real_timer timer1, timer2, timer3;
+  };
+
+  static Counter counter;
+#define COUNTER_INSTRUCTION(X) X
+#else
+#define COUNTER_INSTRUCTION(X)
+#endif
+
+
 #ifdef TEST_RESOLVE_INTERSECTION
   //~ static std::ofstream debug("inter_segments.polylines.txt");
   //~ debug.precision(17);
@@ -458,14 +493,33 @@ void generate_subtriangles(std::size_t ti,
       return typename EK::Plane_3(t[0], t[1], t[2]);
     };
 
-    std::vector< std::vector<typename EK::Point_3> > points_on_segments(nbs);
+    std::vector< std::vector<std::size_t> > points_on_segments(nbs);
+
+    COUNTER_INSTRUCTION(counter.timer1.start();)
+
+    std::map<typename EK::Point_3, std::size_t> point_id_map;
+
+    for (std::size_t pid=0; pid<points.size(); ++pid)
+      point_id_map.insert(std::make_pair(points[pid], pid));
+
+    auto get_point_id = [&](const typename EK::Point_3& pt)
+    {
+      auto insert_res = point_id_map.insert(std::make_pair(pt, points.size()));
+      if (insert_res.second)
+        points.push_back(pt);
+      return insert_res.first->second;
+    };
+
+
     for (std::size_t i = 0; i<nbs-1; ++i)
     {
       for (std::size_t j = i+1; j<nbs; ++j)
       {
         if (intersecting_triangles.count(CGAL::make_sorted_pair(in_triangle_ids[i], in_triangle_ids[j]))!=0)
         {
-          Segment_inter_type seg_inter_type = do_coplanar_segments_intersect<EK>(segments[i], segments[j]);
+          Segment_inter_type seg_inter_type =
+            do_coplanar_segments_intersect<EK>(points[segments[i].first], points[segments[i].second],
+                                               points[segments[j].first], points[segments[j].second]);
           switch(seg_inter_type)
           {
             case POINT_INTERSECTION:
@@ -476,9 +530,11 @@ void generate_subtriangles(std::size_t ti,
 
               if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*res)))
               {
-                points_on_segments[i].push_back(*pt_ptr);
-                points_on_segments[j].push_back(*pt_ptr);
-
+                COUNTER_INSTRUCTION(++counter.c1;)
+                std::size_t pid = get_point_id(*pt_ptr);
+                points_on_segments[i].push_back(pid);
+                points_on_segments[j].push_back(pid);
+                break;
                 //~ std::cout << "new inter " << *pt_ptr << " (" << depth(points_on_segments[i].back()) << ")" << "\n";
 
               }
@@ -490,30 +546,35 @@ void generate_subtriangles(std::size_t ti,
 
               //~ std::cout << "coplanar inter: " << i << " " << j << "\n";
 
-              typename EK::Segment_3 s1(segments[i][0], segments[i][1]);
-              typename EK::Segment_3 s2(segments[j][0], segments[j][1]);// TODO: avoid this construction
+              typename EK::Segment_3 s1(points[segments[i].first], points[segments[i].second]);
+              typename EK::Segment_3 s2(points[segments[j].first], points[segments[j].second]);// TODO: avoid this construction
               auto inter = CGAL::intersection(s1, s2);
 
               if (inter == boost::none) throw std::runtime_error("Unexpected case #2");
 
               if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*inter)))
               {
-                points_on_segments[i].push_back(*pt_ptr);
-                points_on_segments[j].push_back(*pt_ptr);
-
+                COUNTER_INSTRUCTION(++counter.c2;)
+                std::size_t pid = get_point_id(*pt_ptr);
+                points_on_segments[i].push_back(pid);
+                points_on_segments[j].push_back(pid);
+                break;
                 //~ std::cout << "new inter bis " << *pt_ptr << " (" << depth(points_on_segments[i].back()) << ")" <<  "\n";
               }
               else
               {
                 if (const typename EK::Segment_3* seg_ptr = boost::get<typename EK::Segment_3>(&(*inter)))
                 {
-                  points_on_segments[i].push_back(seg_ptr->source());
-                  points_on_segments[j].push_back(seg_ptr->source());
-                  points_on_segments[i].push_back(seg_ptr->target());
-                  points_on_segments[j].push_back(seg_ptr->target());
-
+                  //TODO HERE WE SHOULD IMPROVE TO AVOID RECOMPUTING SEGMENTS ENDPOINTS
+                  COUNTER_INSTRUCTION(++counter.c3;)
+                  std::size_t src_pid = get_point_id(seg_ptr->source());
+                  std::size_t tgt_pid = get_point_id(seg_ptr->target());
+                  points_on_segments[i].push_back(src_pid);
+                  points_on_segments[j].push_back(src_pid);
+                  points_on_segments[i].push_back(tgt_pid);
+                  points_on_segments[j].push_back(tgt_pid);
+                  break;
                   //~ std::cout << "new inter seg " << *seg_ptr << " (" << depth(*seg_ptr) << ")" <<  "\n";
-
                 }
                 else
                   throw std::runtime_error("BOOM\n");
@@ -564,24 +625,26 @@ void generate_subtriangles(std::size_t ti,
               //~ debug << "4 " << triangles[ti] << " " << triangles[ti][0] << "\n";
               //~ exit(1);
             }
-            break;
+//            break;
             default:
+              COUNTER_INSTRUCTION(++counter.c4;)
             break;
           }
         }
+        COUNTER_INSTRUCTION(++counter.total;)
       }
     }
-
-    std::vector<typename EK::Point_3> cst_points;
-    std::vector<std::pair<std::size_t, std::size_t>> csts;
+    COUNTER_INSTRUCTION(counter.timer1.stop();)
+    COUNTER_INSTRUCTION(counter.timer2.start();)
+    std::size_t nb_new_segments=0;
     for (std::size_t i = 0; i<nbs; ++i)
     {
       if(!points_on_segments[i].empty())
       {
         // TODO: predicate on input triangles
         int coord = 0;
-        const std::array<typename EK::Point_3, 2>& s = segments[i];
-        typename EK::Point_3 src = s[0], tgt=s[1];
+        std::size_t src_id = segments[i].first, tgt_id = segments[i].second;
+        typename EK::Point_3 src = points[src_id], tgt=points[tgt_id];
         if (src.x()==tgt.x())
         {
           coord=1;
@@ -589,15 +652,23 @@ void generate_subtriangles(std::size_t ti,
             coord==2;
         }
         if (src[coord]>tgt[coord])
+        {
+          std::swap(src_id, tgt_id);
           std::swap(src, tgt);
+        }
 
-        std::sort(points_on_segments[i].begin(), points_on_segments[i].end(), [coord](const typename EK::Point_3& p, const typename EK::Point_3& q){return p[coord]<q[coord];});
-//TODO: use reserve on cst_points?
-        std::size_t src_id=cst_points.size();
-        cst_points.push_back(src);
-        cst_points.insert(cst_points.end(), points_on_segments[i].begin(), points_on_segments[i].end());
-        cst_points.push_back(tgt);
-
+        points_on_segments[i].push_back(src_id);
+        std::swap(points_on_segments[i].front(), points_on_segments[i].back());
+        std::sort(std::next(points_on_segments[i].begin()), points_on_segments[i].end(),
+                  [&](std::size_t id1, std::size_t id2)
+                  {
+                    if (id1==id2) return false;
+                    return points[id1][coord]<points[id1][coord];
+                  });
+        points_on_segments[i].push_back(tgt_id);
+        auto last = std::unique(points_on_segments[i].begin(), points_on_segments[i].end());
+        points_on_segments[i].erase(last, points_on_segments[i].end());
+        nb_new_segments+=points_on_segments[i].size()-2;
 
         //~ {
         //~ std::cout << "cst_points.size() " << cst_points.size() << "\n";
@@ -617,11 +688,9 @@ void generate_subtriangles(std::size_t ti,
         //~ }
         //~ std::cout << "---\n";
         //~ }
-
-        for (std::size_t k=0; k<=points_on_segments[i].size(); ++k)
-          csts.emplace_back(src_id+k, src_id+k+1);
       }
     }
+    COUNTER_INSTRUCTION(counter.timer2.stop();)
 
     //~ int max_degree = 0;
     //~ for (const auto p : cst_points)
@@ -637,20 +706,24 @@ void generate_subtriangles(std::size_t ti,
       //~ exit(1);
     //~ }
 
-    cdt.insert_constraints(cst_points.begin(), cst_points.end(), csts.begin(), csts.end());
-
-    std::vector<std::array<typename EK::Point_3,2>> no_inter_segments;
-    no_inter_segments.reserve(nbs);
+    // now fill segments with new segments
+    segments.reserve(segments.size()+nb_new_segments);
     for (std::size_t i = 0; i<nbs; ++i)
-      if(points_on_segments[i].empty())
-        no_inter_segments.push_back(segments[i]);
-    no_inter_segments.swap(segments);
+    {
+      if(!points_on_segments[i].empty())
+      {
+        segments[i]=std::make_pair(points_on_segments[i][0], points_on_segments[i][1]);
+        for(std::size_t pos=1; pos<points_on_segments[i].size()-1; ++pos)
+          segments.emplace_back(points_on_segments[i][pos], points_on_segments[i][pos+1]);
+      }
+    }
   }
   //~ std::cout << "done\n";
 #endif
 
-  cdt.insert_constraints(segments.begin(), segments.end());
-  cdt.insert(points.begin(), points.end());
+  COUNTER_INSTRUCTION(counter.timer3.start();)
+  cdt.insert_constraints(points.begin(), points.end(), segments.begin(), segments.end());
+  COUNTER_INSTRUCTION(counter.timer3.stop();)
 
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS
     static int k = 0;
@@ -806,32 +879,22 @@ void autorefine_soup_output(const PointRange& input_points,
     }
   }
 
-  // deduplicate inserted segments
-  Cartesian_converter<EK, GT> to_input;
-  std::map<EK::Point_3, std::size_t> point_id_map;
-#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
-  std::vector<EK::Point_3> exact_soup_points;
-#endif
-
-  auto get_point_id = [&](const typename EK::Point_3& pt)
-  {
-    auto insert_res = point_id_map.insert(std::make_pair(pt, soup_points.size()));
-    if (insert_res.second)
-    {
-      soup_points.push_back(to_input(pt));
-#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
-      exact_soup_points.push_back(pt);
-#endif
-    }
-    return insert_res.first->second;
-  };
-
-  // filter duplicated segments
 #ifdef DEDUPLICATE_SEGMENTS
+  // deduplicate inserted segments
+  std::vector<std::vector<std::pair<std::size_t, std::size_t>>> all_segments_ids(all_segments.size());
   for(std::size_t ti=0; ti<triangles.size(); ++ti)
   {
     if (!all_segments[ti].empty())
     {
+      std::map<EK::Point_3, std::size_t> point_id_map;
+      auto get_point_id = [&](const typename EK::Point_3& pt)
+      {
+        auto insert_res = point_id_map.insert(std::make_pair(pt, all_points[ti].size()));
+        if (insert_res.second)
+          all_points[ti].push_back(pt);
+        return insert_res.first->second;
+      };
+
       std::size_t nbs = all_segments[ti].size();
       std::vector<std::array<EK::Point_3,2>> filtered_segments;
       std::vector<std::size_t> filtered_in_triangle_ids;
@@ -841,19 +904,16 @@ void autorefine_soup_output(const PointRange& input_points,
       {
         EK::Point_3 src = all_segments[ti][si][0],
                     tgt = all_segments[ti][si][1];
+        std::size_t src_id = get_point_id(src), tgt_id=get_point_id(tgt);
         if (segset.insert(
-              CGAL::make_sorted_pair( get_point_id(src),
-                                      get_point_id(tgt))).second)
+              CGAL::make_sorted_pair(src_id, tgt_id)).second)
         {
-          filtered_segments.push_back(all_segments[ti][si]);
+          all_segments_ids[ti].emplace_back(src_id, tgt_id);
           filtered_in_triangle_ids.push_back(all_in_triangle_ids[ti][si]);
         }
       }
-      if (filtered_segments.size()!=nbs)
-      {
-        filtered_segments.swap(all_segments[ti]);
+      if (all_segments_ids[ti].size()!=nbs)
         filtered_in_triangle_ids.swap(all_in_triangle_ids[ti]);
-      }
     }
   }
 #endif
@@ -886,7 +946,7 @@ void autorefine_soup_output(const PointRange& input_points,
         autorefine_impl::generate_subtriangles<EK, 2>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
       }
       #else
-      autorefine_impl::generate_subtriangles<EK>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+      autorefine_impl::generate_subtriangles<EK>(ti, all_segments_ids[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
       #endif
     }
 
@@ -896,11 +956,31 @@ void autorefine_soup_output(const PointRange& input_points,
   // brute force output: create a soup, orient and to-mesh
   CGAL_PMP_AUTOREFINE_VERBOSE("create output soup");
 
+  Cartesian_converter<EK, GT> to_input;
+  std::map<EK::Point_3, std::size_t> point_id_map;
+#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
+  std::vector<EK::Point_3> exact_soup_points;
+#endif
+
+  auto get_point_id = [&](const typename EK::Point_3& pt)
+  {
+    auto insert_res = point_id_map.insert(std::make_pair(pt, soup_points.size()));
+    if (insert_res.second)
+    {
+      soup_points.push_back(to_input(pt));
+#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
+      exact_soup_points.push_back(pt);
+#endif
+    }
+    return insert_res.first->second;
+  };
+
   std::vector <std::size_t> input_point_ids;
   input_point_ids.reserve(input_points.size());
   for (const auto& p : input_points)
     input_point_ids.push_back(get_point_id(to_exact(get(pm,p))));
 
+  // raw copy of input triangles with no intersection
   for (Input_TID f=0; f<id_triples.size(); ++f)
   {
     if (is_degen[f]) continue; //skip degenerate faces
@@ -915,6 +995,7 @@ void autorefine_soup_output(const PointRange& input_points,
       );
     }
   }
+  // import refined triangles
   for (const std::array<EK::Point_3,3>& t : new_triangles)
   {
     soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));

From 003910ee220262b370b31bfe525ecb20bf2e8a27 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 14 Mar 2023 18:10:04 +0100
Subject: [PATCH 0182/1398] fix typo

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index a81b00f65a48..e18cf1982b2b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -663,7 +663,7 @@ void generate_subtriangles(std::size_t ti,
                   [&](std::size_t id1, std::size_t id2)
                   {
                     if (id1==id2) return false;
-                    return points[id1][coord]<points[id1][coord];
+                    return points[id1][coord]<points[id2][coord];
                   });
         points_on_segments[i].push_back(tgt_id);
         auto last = std::unique(points_on_segments[i].begin(), points_on_segments[i].end());

From adb5a318527c52e38d5431fd35ab1629820611ae Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 14 Mar 2023 18:32:31 +0100
Subject: [PATCH 0183/1398] dramatic typo

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index e18cf1982b2b..d40fce82d2bc 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -649,7 +649,7 @@ void generate_subtriangles(std::size_t ti,
         {
           coord=1;
           if (src.y()==tgt.y())
-            coord==2;
+            coord=2;
         }
         if (src[coord]>tgt[coord])
         {

From 5defd784cc0dae96083708f8b2454c2249509dad Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 15 Mar 2023 14:24:37 +0100
Subject: [PATCH 0184/1398] better treatment of intersection between segments

---
 .../Polygon_mesh_processing/autorefinement.h  | 447 ++++++++++++++----
 1 file changed, 346 insertions(+), 101 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index d40fce82d2bc..711c3d82ce0a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -56,13 +56,59 @@ namespace Polygon_mesh_processing {
 #ifndef DOXYGEN_RUNNING
 namespace autorefine_impl {
 
-enum Segment_inter_type { NO_INTERSECTION=0, COPLANAR_SEGMENTS, POINT_INTERSECTION };
+
+enum Segment_inter_type_old { NO_INTERSECTION_OLD=0, COPLANAR_SEGMENTS, POINT_INTERSECTION_OLD };
+enum Segment_inter_type { NO_INTERSECTION=0,
+                          POINT_INTERSECTION,
+                          POINT_P,
+                          POINT_Q,
+                          POINT_R,
+                          POINT_S,
+                          COPLANAR_SEGMENT_PQ,
+                          COPLANAR_SEGMENT_RS,
+                          COPLANAR_SEGMENT_PS,
+                          COPLANAR_SEGMENT_QS,
+                          COPLANAR_SEGMENT_PR,
+                          COPLANAR_SEGMENT_QR,
+                        };
+
+
+
+std::string print_enum(Segment_inter_type_old s)
+{
+  switch(s)
+  {
+    case NO_INTERSECTION_OLD: return "NO_INTERSECTION_OLD";
+    case COPLANAR_SEGMENTS: return "COPLANAR_SEGMENTS";
+    case POINT_INTERSECTION_OLD: return "POINT_INTERSECTION_OLD";
+  }
+}
+
+std::string print_enum(Segment_inter_type s)
+{
+  switch(s)
+  {
+    case NO_INTERSECTION: return "NO_INTERSECTION";
+    case POINT_INTERSECTION: return "POINT_INTERSECTION";
+    case POINT_P: return "POINT_P";
+    case POINT_Q: return "POINT_Q";
+    case POINT_R: return "POINT_R";
+    case POINT_S: return "POINT_S";
+    case COPLANAR_SEGMENT_PQ: return "COPLANAR_SEGMENT_PQ";
+    case COPLANAR_SEGMENT_RS: return "COPLANAR_SEGMENT_RS";
+    case COPLANAR_SEGMENT_PS: return "COPLANAR_SEGMENT_PS";
+    case COPLANAR_SEGMENT_QS: return "COPLANAR_SEGMENT_QS";
+    case COPLANAR_SEGMENT_PR: return "COPLANAR_SEGMENT_PR";
+    case COPLANAR_SEGMENT_QR: return "COPLANAR_SEGMENT_QR";
+  }
+}
+
 
 template <class K>
-Segment_inter_type
-do_coplanar_segments_intersect(const typename K::Point_3& s1_0, const typename K::Point_3& s1_1,
-                               const typename K::Point_3& s2_0, const typename K::Point_3& s2_1,
-                               const K& k = K())
+Segment_inter_type_old
+do_coplanar_segments_intersect_old(const typename K::Point_3& s1_0, const typename K::Point_3& s1_1,
+                                   const typename K::Point_3& s2_0, const typename K::Point_3& s2_1,
+                                   const K& k = K())
 {
   // supporting_line intersects: points are coplanar
   typename K::Coplanar_orientation_3 cpl_orient=k.coplanar_orientation_3_object();
@@ -75,13 +121,155 @@ do_coplanar_segments_intersect(const typename K::Point_3& s1_0, const typename K
     typename K::Collinear_are_ordered_along_line_3 cln_order = k.collinear_are_ordered_along_line_3_object();
     return (cln_order(s1_0, s2_0, s1_1) ||
             cln_order(s1_0, s2_1, s1_1) ||
-            cln_order(s2_0, s1_0, s2_1)) ? COPLANAR_SEGMENTS : NO_INTERSECTION;
+            cln_order(s2_0, s1_0, s2_1)) ? COPLANAR_SEGMENTS : NO_INTERSECTION_OLD;
   }
 
   if(or1 != or2)
   {
     or1 = cpl_orient(s2_0, s2_1, s1_0);
-    return (or1 == COLLINEAR || or1 != cpl_orient(s2_0, s2_1, s1_1)) ? POINT_INTERSECTION : NO_INTERSECTION;
+    return (or1 == COLLINEAR || or1 != cpl_orient(s2_0, s2_1, s1_1)) ? POINT_INTERSECTION_OLD : NO_INTERSECTION_OLD;
+  }
+
+  return NO_INTERSECTION_OLD;
+}
+
+
+// test intersection in the interior of segment pq and rs with pq and rs being coplanar segments
+// note that for coplanar cases, we might report identical endpoints
+template <class K>
+Segment_inter_type
+do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
+                               std::size_t ri, std::size_t si,
+                               const std::vector<typename K::Point_3>& points,
+                               const K& k = K())
+{
+  typename K::Collinear_are_ordered_along_line_3 cln_order = k.collinear_are_ordered_along_line_3_object();
+  typename K::Coplanar_orientation_3 cpl_orient=k.coplanar_orientation_3_object();
+
+  const typename K::Point_3& p=points[pi];
+  const typename K::Point_3& q=points[qi];
+  const typename K::Point_3& r=points[ri];
+  const typename K::Point_3& s=points[si];
+
+  // first handle case of shared endpoints
+  if (pi==ri)
+  {
+    if (si==qi || cpl_orient(p, q, s)!=COPLANAR) return NO_INTERSECTION;
+    // can be s, q or nothing
+    if (cln_order(p,s,q))
+      return POINT_S;
+    if (cln_order(p,q,s))
+      return POINT_Q;
+    return NO_INTERSECTION;
+  }
+  else
+  {
+    if(pi==si)
+    {
+      if (qi==ri || cpl_orient(p, q, r)!=COPLANAR) return NO_INTERSECTION;
+      // can be r, q or nothing
+      if (cln_order(p,r,q))
+        return POINT_R;
+      if (cln_order(p,q,r))
+        return POINT_Q;
+      return NO_INTERSECTION;
+    }
+    else
+    {
+      if (qi==ri)
+      {
+        if (pi==si || cpl_orient(p, q, s)!=COPLANAR) return NO_INTERSECTION;
+        // can be p, s or nothing
+        if (cln_order(p,s,q))
+          return POINT_S;
+        if (cln_order(q,p,s))
+          return POINT_P;
+        return NO_INTERSECTION;
+      }
+      else
+      {
+        if (qi==si)
+        {
+          if (pi==ri || cpl_orient(p, q, r)!=COPLANAR) return NO_INTERSECTION;
+          // can be p, r or nothing
+          if (cln_order(p,r,q))
+            return POINT_R;
+          if (cln_order(q,p,r))
+            return POINT_P;
+          return NO_INTERSECTION;
+        }
+      }
+    }
+  }
+
+  // supporting_line intersects: points are coplanar
+  ::CGAL::Orientation pqr = cpl_orient(p, q, r);
+  ::CGAL::Orientation pqs = cpl_orient(p, q, s);
+
+  if(pqr == COLLINEAR && pqs == COLLINEAR)
+  {
+    // segments are collinear
+    bool r_in_pq = cln_order(p, r, q),
+         s_in_pq = cln_order(p, s, q),
+         p_in_rs = cln_order(r, p, s);
+
+    if (r_in_pq)
+    {
+      // intersection could be rs, pr or qr
+      if (s_in_pq)
+        return COPLANAR_SEGMENT_RS;
+      if (p_in_rs)
+        return COPLANAR_SEGMENT_PR;
+      CGAL_assertion(cln_order(r, q, s));
+      return COPLANAR_SEGMENT_QR;
+    }
+    else
+    {
+      if (s_in_pq)
+      {
+        // intersection could be ps or qs
+        if (p_in_rs)
+          return COPLANAR_SEGMENT_PS;
+        CGAL_assertion(cln_order(r, q, s));
+        return COPLANAR_SEGMENT_QS;
+      }
+      else
+        if (p_in_rs)
+        {
+          CGAL_assertion(cln_order(r, q, s));
+          return COPLANAR_SEGMENT_PQ;
+        }
+    }
+    return NO_INTERSECTION;
+  }
+
+  if(pqr != pqs)
+  {
+    ::CGAL::Orientation rsp = cpl_orient(r, s, p);
+
+    if (rsp==COLLINEAR)
+    {
+      if (pqr==COLLINEAR || pqs==COLLINEAR)
+      {
+        throw std::runtime_error("no expected #1");
+      }
+      return POINT_P;
+    }
+    ::CGAL::Orientation rsq = cpl_orient(r, s, q);
+    if (rsq==COLLINEAR)
+    {
+      if (pqr==COLLINEAR || pqs==COLLINEAR)
+      {
+        throw std::runtime_error("no expected #2");
+      }
+      return POINT_Q;
+    }
+    if (rsp!=rsq)
+    {
+      if (pqr==COLLINEAR) return POINT_R;
+      if (pqs==COLLINEAR) return POINT_S;
+      return POINT_INTERSECTION;
+    }
   }
 
   return NO_INTERSECTION;
@@ -429,6 +617,7 @@ void generate_subtriangles(std::size_t ti,
     int c2=0;
     int c3=0;
     int c4=0;
+    int c5=0;
     int total=0;
     ~Counter()
     {
@@ -436,6 +625,7 @@ void generate_subtriangles(std::size_t ti,
       std::cout << "coplanar segment intersection : " << c2 << "\n";
       std::cout << "coplanar segment overlap: " << c3 << "\n";
       std::cout << "no intersection: " << c4 << "\n";
+      std::cout << "intersection filtered with bboxes: " << c5 << "\n";
       std::cout << "# pairs of segments : " << total << "\n";
       std::cout << "time computing segment intersections: " << timer1.time() << "\n";
       std::cout << "time sorting intersection points: " << timer2.time() << "\n";
@@ -480,13 +670,6 @@ void generate_subtriangles(std::size_t ti,
   if (!segments.empty())
   {
     std::size_t nbs = segments.size();
-    //~ std::cout << "nbs " << nbs << "\n";
-
-    //~ if (nbs==8)
-    //~ {
-      //~ for (std::size_t i = 0; i<nbs; ++i)
-        //~ std::ofstream("cst_"+std::to_string(i)+".polylines.txt") << std::setprecision(17) << "2 " << segments[i][0] << " " << segments[i][1] << "\n";
-    //~ }
 
     auto supporting_plane = [](const std::array<typename EK::Point_3, 3>& t)
     {
@@ -510,20 +693,69 @@ void generate_subtriangles(std::size_t ti,
       return insert_res.first->second;
     };
 
-
+    std::vector<Bbox_3> point_boxes(points.size());
+    for (std::size_t i = 0; i<points.size(); ++i)
+      point_boxes[i]=points[i].bbox();
+    std::vector<Bbox_3> segment_boxes(nbs);
+    for (std::size_t i = 0; i<nbs; ++i)
+      segment_boxes[i]=point_boxes[segments[i].first]+point_boxes[segments[i].second];
+//~ std::cout << "=========================================================================\n";
     for (std::size_t i = 0; i<nbs-1; ++i)
     {
       for (std::size_t j = i+1; j<nbs; ++j)
       {
         if (intersecting_triangles.count(CGAL::make_sorted_pair(in_triangle_ids[i], in_triangle_ids[j]))!=0)
         {
+          if ( !do_overlap(segment_boxes[i], segment_boxes[j]) )
+          {
+            COUNTER_INSTRUCTION(++counter.c5;)
+            COUNTER_INSTRUCTION(++counter.total;)
+            continue;
+          }
+
+          // TODO: use point ids to skip some test?
           Segment_inter_type seg_inter_type =
-            do_coplanar_segments_intersect<EK>(points[segments[i].first], points[segments[i].second],
-                                               points[segments[j].first], points[segments[j].second]);
+            do_coplanar_segments_intersect<EK>(segments[i].first, segments[i].second,
+                                               segments[j].first, segments[j].second,
+                                               points);
+
+
+          //~ Segment_inter_type_old seg_inter_type_old =
+            //~ do_coplanar_segments_intersect_old<EK>(points[segments[i].first], points[segments[i].second],
+                                               //~ points[segments[j].first], points[segments[j].second]);
+
+
+          //~ std::cout << std::setprecision(17);
+          //~ std::cout << points[segments[i].first] << " " << points[segments[i].second] << "\n";
+          //~ std::cout << points[segments[j].first] << " " << points[segments[j].second] << "\n";
+          //~ std::cout << "OLD: " << print_enum(seg_inter_type_old) << "\n";
+          //~ std::cout << "NEW: " << print_enum(seg_inter_type) << "\n";
+
           switch(seg_inter_type)
           {
+            case POINT_P:
+            {
+              points_on_segments[j].push_back(segments[i].first);
+              break;
+            }
+            case POINT_Q:
+            {
+              points_on_segments[j].push_back(segments[i].second);
+              break;
+            }
+            case POINT_R:
+            {
+              points_on_segments[i].push_back(segments[j].first);
+              break;
+            }
+            case POINT_S:
+            {
+              points_on_segments[i].push_back(segments[j].second);
+              break;
+            }
             case POINT_INTERSECTION:
             {
+              // TODO: use version with no variant
               auto res = CGAL::intersection(supporting_plane(triangles[in_triangle_ids[i]]),
                                             supporting_plane(triangles[in_triangle_ids[j]]),
                                             supporting_plane(triangles[ti]));
@@ -534,101 +766,78 @@ void generate_subtriangles(std::size_t ti,
                 std::size_t pid = get_point_id(*pt_ptr);
                 points_on_segments[i].push_back(pid);
                 points_on_segments[j].push_back(pid);
-                break;
-                //~ std::cout << "new inter " << *pt_ptr << " (" << depth(points_on_segments[i].back()) << ")" << "\n";
-
-              }
-            }
-            // break; No break because of the coplanar case
-            case COPLANAR_SEGMENTS:
-            {
-              // We can have hard cases if two triangles are coplanar....
-
-              //~ std::cout << "coplanar inter: " << i << " " << j << "\n";
-
-              typename EK::Segment_3 s1(points[segments[i].first], points[segments[i].second]);
-              typename EK::Segment_3 s2(points[segments[j].first], points[segments[j].second]);// TODO: avoid this construction
-              auto inter = CGAL::intersection(s1, s2);
-
-              if (inter == boost::none) throw std::runtime_error("Unexpected case #2");
-
-              if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*inter)))
-              {
-                COUNTER_INSTRUCTION(++counter.c2;)
-                std::size_t pid = get_point_id(*pt_ptr);
-                points_on_segments[i].push_back(pid);
-                points_on_segments[j].push_back(pid);
-                break;
-                //~ std::cout << "new inter bis " << *pt_ptr << " (" << depth(points_on_segments[i].back()) << ")" <<  "\n";
               }
               else
               {
-                if (const typename EK::Segment_3* seg_ptr = boost::get<typename EK::Segment_3>(&(*inter)))
+                COUNTER_INSTRUCTION(++counter.c2;)
+                //TODO find better!
+                typename EK::Segment_3 s1(points[segments[i].first], points[segments[i].second]);
+                typename EK::Segment_3 s2(points[segments[j].first], points[segments[j].second]);// TODO: avoid this construction
+                auto inter = CGAL::intersection(s1, s2);
+                if (inter == boost::none) throw std::runtime_error("Unexpected case #2");
+                if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*inter)))
                 {
-                  //TODO HERE WE SHOULD IMPROVE TO AVOID RECOMPUTING SEGMENTS ENDPOINTS
-                  COUNTER_INSTRUCTION(++counter.c3;)
-                  std::size_t src_pid = get_point_id(seg_ptr->source());
-                  std::size_t tgt_pid = get_point_id(seg_ptr->target());
-                  points_on_segments[i].push_back(src_pid);
-                  points_on_segments[j].push_back(src_pid);
-                  points_on_segments[i].push_back(tgt_pid);
-                  points_on_segments[j].push_back(tgt_pid);
+                  std::size_t pid = get_point_id(*pt_ptr);
+                  points_on_segments[i].push_back(pid);
+                  points_on_segments[j].push_back(pid);
                   break;
-                  //~ std::cout << "new inter seg " << *seg_ptr << " (" << depth(*seg_ptr) << ")" <<  "\n";
                 }
                 else
-                  throw std::runtime_error("BOOM\n");
-              }
-
-#if 0
-              //this code works if triangles are not coplanar
-              // coplanar intersection that is not a point
-              int coord = 0;
-              const typename EK::Segment_3& s = segments[i];
-              typename EK::Point_3 src = s[0], tgt=s[1];
-              if (src.x()==tgt.x())
-              {
-                coord=1;
-                if (src.y()==tgt.y())
-                  coord==2;
+                  throw std::runtime_error("Unexpected case 1");
+                //~ std::ofstream debug ("/tmp/triangles.polylines.txt");
+                //~ debug << "4 " << triangles[ti][0] << " " << triangles[ti][1] << " " << triangles[ti][2] << " " << triangles[ti][0] << "\n";
+                //~ debug << "4 " << triangles[in_triangle_ids[i]][0] << " " << triangles[in_triangle_ids[i]][1] << " " << triangles[in_triangle_ids[i]][2] << " " << triangles[in_triangle_ids[i]][0] << "\n";
+                //~ debug << "4 " << triangles[in_triangle_ids[j]][0] << " " << triangles[in_triangle_ids[j]][1] << " " << triangles[in_triangle_ids[j]][2] << " " << triangles[in_triangle_ids[j]][0] << "\n";
+                //~ debug.close();
+                //~ throw std::runtime_error("Unexpected case 1");
               }
-
-              std::vector<typename EK::Point_3> tmp_pts = {
-                src, tgt, segments[j][0], segments[j][1] };
-
-              std::sort(tmp_pts.begin(), tmp_pts.end(),
-                        [coord](const typename EK::Point_3& p, const typename EK::Point_3& q)
-                        {return p[coord]<q[coord];});
-
-              points_on_segments[i].push_back(tmp_pts[1]);
-              points_on_segments[i].push_back(tmp_pts[2]);
-              points_on_segments[j].push_back(tmp_pts[1]);
-              points_on_segments[j].push_back(tmp_pts[2]);
-#endif
-              //~ std::cout << "new inter coli " << segments[j][0] << "\n";
-              //~ std::cout << "new inter coli " << segments[j][1] << "\n";
-              //~ std::cout << "new inter coli " << segments[i][0] << "\n";
-              //~ std::cout << "new inter coli " << segments[i][1] << "\n";
-
-              //~ points_on_segments[j].push_back(*pt_ptr);
-
-
-
-              //~ std::cerr << "ERROR: intersection is a segment\n";
-              //~ std::cout << std::setprecision(17);
-              //~ exact(segments[i]);
-              //~ exact(segments[j]);
-              //~ std::cout << segments[i] << "\n";
-              //~ std::cout << segments[j] << "\n";
-              //~ debug << "4 " << triangles[in_triangle_ids[i]] << " " << triangles[in_triangle_ids[i]][0] << "\n";
-              //~ debug << "4 " << triangles[in_triangle_ids[j]] << " " << triangles[in_triangle_ids[j]][0] << "\n";
-              //~ debug << "4 " << triangles[ti] << " " << triangles[ti][0] << "\n";
-              //~ exit(1);
+              break;
+            }
+            case COPLANAR_SEGMENT_PQ:
+            {
+              COUNTER_INSTRUCTION(++counter.c3;)
+              points_on_segments[j].push_back(segments[i].first);
+              points_on_segments[j].push_back(segments[i].second);
+              break;
+            }
+            case COPLANAR_SEGMENT_RS:
+            {
+              COUNTER_INSTRUCTION(++counter.c3;)
+              points_on_segments[i].push_back(segments[j].first);
+              points_on_segments[i].push_back(segments[j].second);
+              break;
+            }
+            case COPLANAR_SEGMENT_PR:
+            {
+              COUNTER_INSTRUCTION(++counter.c3;)
+              points_on_segments[i].push_back(segments[j].first);
+              points_on_segments[j].push_back(segments[i].first);
+              break;
+            }
+            case COPLANAR_SEGMENT_QS:
+            {
+              COUNTER_INSTRUCTION(++counter.c3;)
+              points_on_segments[i].push_back(segments[j].second);
+              points_on_segments[j].push_back(segments[i].second);
+              break;
+            }
+            case COPLANAR_SEGMENT_PS:
+            {
+              COUNTER_INSTRUCTION(++counter.c3;)
+              points_on_segments[i].push_back(segments[j].second);
+              points_on_segments[j].push_back(segments[i].first);
+              break;
+            }
+            case COPLANAR_SEGMENT_QR:
+            {
+              COUNTER_INSTRUCTION(++counter.c3;)
+              points_on_segments[i].push_back(segments[j].first);
+              points_on_segments[j].push_back(segments[i].second);
+              break;
             }
 //            break;
-            default:
+            case NO_INTERSECTION:
               COUNTER_INSTRUCTION(++counter.c4;)
-            break;
           }
         }
         COUNTER_INSTRUCTION(++counter.total;)
@@ -668,6 +877,24 @@ void generate_subtriangles(std::size_t ti,
         points_on_segments[i].push_back(tgt_id);
         auto last = std::unique(points_on_segments[i].begin(), points_on_segments[i].end());
         points_on_segments[i].erase(last, points_on_segments[i].end());
+
+        if (std::set<std::size_t>(points_on_segments[i].begin(), points_on_segments[i].end()).size()!= points_on_segments[i].size())
+        {
+          std::cout << "coord = " << coord << "\n";
+          std::cout << "(src.x()==tgt.x()) " << (src.x()==tgt.x()) << "\n";
+          std::cout << "(src.y()==tgt.y()) " << (src.y()==tgt.y()) << "\n";
+          std::cout << "(src.z()==tgt.z()) " << (src.z()==tgt.z()) << "\n";
+
+          for (auto v : points_on_segments[i])
+            std::cout << " " << v;
+          std::cout << std::endl;
+          for (auto v : points_on_segments[i])
+            std::cout << points[v] << "\n";
+          std::cout << std::endl;
+          throw std::runtime_error("unique failed!");
+        }
+
+
         nb_new_segments+=points_on_segments[i].size()-2;
 
         //~ {
@@ -721,6 +948,24 @@ void generate_subtriangles(std::size_t ti,
   //~ std::cout << "done\n";
 #endif
 
+  // TODO: sorted pair to be constructed when pushing_back
+  for (std::pair<std::size_t, size_t>& s : segments)
+    if (s.second < s.first)
+      std::swap(s.first,s.second);
+  std::sort(segments.begin(), segments.end());
+  auto last = std::unique(segments.begin(), segments.end());
+  segments.erase(last, segments.end());
+
+
+  std::ofstream("/tmp/tri.xyz") << std::setprecision(17) << triangles[ti][0] << "\n"
+                                                         << triangles[ti][1] << "\n"
+                                                         << triangles[ti][2] << "\n";
+  std::ofstream debug("/tmp/cst.polylines.txt");
+  debug << std::setprecision(17);
+  for(auto s : segments)
+    debug << "2 " << points[s.first] << " " << points[s.second] << "\n";
+  debug.close();
+
   COUNTER_INSTRUCTION(counter.timer3.start();)
   cdt.insert_constraints(points.begin(), points.end(), segments.begin(), segments.end());
   COUNTER_INSTRUCTION(counter.timer3.stop();)

From 48c49add1cd8100ed08cbff3a97f11de244f3fa7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 15 Mar 2023 15:48:44 +0100
Subject: [PATCH 0185/1398] more debug and enum fix

---
 .../Polygon_mesh_processing/autorefinement.h  | 41 ++++++++-----------
 1 file changed, 16 insertions(+), 25 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 711c3d82ce0a..8cc1dd7ff9f8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -154,7 +154,7 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
   // first handle case of shared endpoints
   if (pi==ri)
   {
-    if (si==qi || cpl_orient(p, q, s)!=COPLANAR) return NO_INTERSECTION;
+    if (si==qi || cpl_orient(p, q, s)!=COLLINEAR) return NO_INTERSECTION;
     // can be s, q or nothing
     if (cln_order(p,s,q))
       return POINT_S;
@@ -166,7 +166,7 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
   {
     if(pi==si)
     {
-      if (qi==ri || cpl_orient(p, q, r)!=COPLANAR) return NO_INTERSECTION;
+      if (qi==ri || cpl_orient(p, q, r)!=COLLINEAR) return NO_INTERSECTION;
       // can be r, q or nothing
       if (cln_order(p,r,q))
         return POINT_R;
@@ -178,7 +178,7 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
     {
       if (qi==ri)
       {
-        if (pi==si || cpl_orient(p, q, s)!=COPLANAR) return NO_INTERSECTION;
+        if (pi==si || cpl_orient(p, q, s)!=COLLINEAR) return NO_INTERSECTION;
         // can be p, s or nothing
         if (cln_order(p,s,q))
           return POINT_S;
@@ -190,7 +190,7 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
       {
         if (qi==si)
         {
-          if (pi==ri || cpl_orient(p, q, r)!=COPLANAR) return NO_INTERSECTION;
+          if (pi==ri || cpl_orient(p, q, r)!=COLLINEAR) return NO_INTERSECTION;
           // can be p, r or nothing
           if (cln_order(p,r,q))
             return POINT_R;
@@ -577,7 +577,7 @@ void generate_subtriangles(std::size_t ti,
 #endif
 
   typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits ,Default, Itag> CDT_2;
-  //typedef CGAL::Constrained_triangulation_plus_2<CDT_base> CDT;
+  //typedef CGAL::Constrained_triangulation_plus_2<CDT_2> CDT;
   typedef CDT_2 CDT;
 
   const std::array<typename EK::Point_3,3>& t = triangles[ti];
@@ -630,8 +630,11 @@ void generate_subtriangles(std::size_t ti,
       std::cout << "time computing segment intersections: " << timer1.time() << "\n";
       std::cout << "time sorting intersection points: " << timer2.time() << "\n";
       std::cout << "time for cdt of constraints: " << timer3.time() << "\n";
+      std::cout << "time coplanar segment intersections: " << timer4.time() << "\n";
+      std::cout << "time of do_coplanar_segments_intersect: " << timer5.time() << "\n";
+      std::cout << "time of triplane intersection: " << timer6.time() << "\n";
     }
-    CGAL::Real_timer timer1, timer2, timer3;
+    CGAL::Real_timer timer1, timer2, timer3, timer4, timer5, timer6;
   };
 
   static Counter counter;
@@ -713,11 +716,12 @@ void generate_subtriangles(std::size_t ti,
             continue;
           }
 
-          // TODO: use point ids to skip some test?
+          COUNTER_INSTRUCTION(counter.timer5.start();)
           Segment_inter_type seg_inter_type =
             do_coplanar_segments_intersect<EK>(segments[i].first, segments[i].second,
                                                segments[j].first, segments[j].second,
                                                points);
+          COUNTER_INSTRUCTION(counter.timer5.stop();)
 
 
           //~ Segment_inter_type_old seg_inter_type_old =
@@ -756,9 +760,11 @@ void generate_subtriangles(std::size_t ti,
             case POINT_INTERSECTION:
             {
               // TODO: use version with no variant
+              COUNTER_INSTRUCTION(counter.timer6.start();)
               auto res = CGAL::intersection(supporting_plane(triangles[in_triangle_ids[i]]),
                                             supporting_plane(triangles[in_triangle_ids[j]]),
                                             supporting_plane(triangles[ti]));
+              COUNTER_INSTRUCTION(counter.timer6.stop();)
 
               if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*res)))
               {
@@ -770,6 +776,7 @@ void generate_subtriangles(std::size_t ti,
               else
               {
                 COUNTER_INSTRUCTION(++counter.c2;)
+                COUNTER_INSTRUCTION(counter.timer4.start();)
                 //TODO find better!
                 typename EK::Segment_3 s1(points[segments[i].first], points[segments[i].second]);
                 typename EK::Segment_3 s2(points[segments[j].first], points[segments[j].second]);// TODO: avoid this construction
@@ -784,6 +791,7 @@ void generate_subtriangles(std::size_t ti,
                 }
                 else
                   throw std::runtime_error("Unexpected case 1");
+                COUNTER_INSTRUCTION(counter.timer4.stop();)
                 //~ std::ofstream debug ("/tmp/triangles.polylines.txt");
                 //~ debug << "4 " << triangles[ti][0] << " " << triangles[ti][1] << " " << triangles[ti][2] << " " << triangles[ti][0] << "\n";
                 //~ debug << "4 " << triangles[in_triangle_ids[i]][0] << " " << triangles[in_triangle_ids[i]][1] << " " << triangles[in_triangle_ids[i]][2] << " " << triangles[in_triangle_ids[i]][0] << "\n";
@@ -877,24 +885,6 @@ void generate_subtriangles(std::size_t ti,
         points_on_segments[i].push_back(tgt_id);
         auto last = std::unique(points_on_segments[i].begin(), points_on_segments[i].end());
         points_on_segments[i].erase(last, points_on_segments[i].end());
-
-        if (std::set<std::size_t>(points_on_segments[i].begin(), points_on_segments[i].end()).size()!= points_on_segments[i].size())
-        {
-          std::cout << "coord = " << coord << "\n";
-          std::cout << "(src.x()==tgt.x()) " << (src.x()==tgt.x()) << "\n";
-          std::cout << "(src.y()==tgt.y()) " << (src.y()==tgt.y()) << "\n";
-          std::cout << "(src.z()==tgt.z()) " << (src.z()==tgt.z()) << "\n";
-
-          for (auto v : points_on_segments[i])
-            std::cout << " " << v;
-          std::cout << std::endl;
-          for (auto v : points_on_segments[i])
-            std::cout << points[v] << "\n";
-          std::cout << std::endl;
-          throw std::runtime_error("unique failed!");
-        }
-
-
         nb_new_segments+=points_on_segments[i].size()-2;
 
         //~ {
@@ -1240,6 +1230,7 @@ void autorefine_soup_output(const PointRange& input_points,
       );
     }
   }
+
   // import refined triangles
   for (const std::array<EK::Point_3,3>& t : new_triangles)
   {

From ebb051f0b6e5bd89b17e4eb48f5c0cfdd2b6f1fa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 16 Mar 2023 10:26:06 +0100
Subject: [PATCH 0186/1398] remove debug

---
 .../Polygon_mesh_processing/autorefinement.h  | 96 ++-----------------
 1 file changed, 10 insertions(+), 86 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 8cc1dd7ff9f8..f6b7bac57bb4 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -36,9 +36,9 @@
 
 #include <vector>
 
-//#define TEST_RESOLVE_INTERSECTION
+#define TEST_RESOLVE_INTERSECTION
 #define DEDUPLICATE_SEGMENTS
-//#define DEBUG_COUNTERS
+#define DEBUG_COUNTERS
 //#define USE_FIXED_PROJECTION_TRAITS
 //#define DEBUG_DEPTH
 
@@ -56,8 +56,6 @@ namespace Polygon_mesh_processing {
 #ifndef DOXYGEN_RUNNING
 namespace autorefine_impl {
 
-
-enum Segment_inter_type_old { NO_INTERSECTION_OLD=0, COPLANAR_SEGMENTS, POINT_INTERSECTION_OLD };
 enum Segment_inter_type { NO_INTERSECTION=0,
                           POINT_INTERSECTION,
                           POINT_P,
@@ -72,68 +70,6 @@ enum Segment_inter_type { NO_INTERSECTION=0,
                           COPLANAR_SEGMENT_QR,
                         };
 
-
-
-std::string print_enum(Segment_inter_type_old s)
-{
-  switch(s)
-  {
-    case NO_INTERSECTION_OLD: return "NO_INTERSECTION_OLD";
-    case COPLANAR_SEGMENTS: return "COPLANAR_SEGMENTS";
-    case POINT_INTERSECTION_OLD: return "POINT_INTERSECTION_OLD";
-  }
-}
-
-std::string print_enum(Segment_inter_type s)
-{
-  switch(s)
-  {
-    case NO_INTERSECTION: return "NO_INTERSECTION";
-    case POINT_INTERSECTION: return "POINT_INTERSECTION";
-    case POINT_P: return "POINT_P";
-    case POINT_Q: return "POINT_Q";
-    case POINT_R: return "POINT_R";
-    case POINT_S: return "POINT_S";
-    case COPLANAR_SEGMENT_PQ: return "COPLANAR_SEGMENT_PQ";
-    case COPLANAR_SEGMENT_RS: return "COPLANAR_SEGMENT_RS";
-    case COPLANAR_SEGMENT_PS: return "COPLANAR_SEGMENT_PS";
-    case COPLANAR_SEGMENT_QS: return "COPLANAR_SEGMENT_QS";
-    case COPLANAR_SEGMENT_PR: return "COPLANAR_SEGMENT_PR";
-    case COPLANAR_SEGMENT_QR: return "COPLANAR_SEGMENT_QR";
-  }
-}
-
-
-template <class K>
-Segment_inter_type_old
-do_coplanar_segments_intersect_old(const typename K::Point_3& s1_0, const typename K::Point_3& s1_1,
-                                   const typename K::Point_3& s2_0, const typename K::Point_3& s2_1,
-                                   const K& k = K())
-{
-  // supporting_line intersects: points are coplanar
-  typename K::Coplanar_orientation_3 cpl_orient=k.coplanar_orientation_3_object();
-  ::CGAL::Orientation or1 = cpl_orient(s1_0, s1_1, s2_0);
-  ::CGAL::Orientation or2 = cpl_orient(s1_0, s1_1, s2_1);
-
-  if(or1 == COLLINEAR && or2 == COLLINEAR)
-  {
-    // segments are collinear
-    typename K::Collinear_are_ordered_along_line_3 cln_order = k.collinear_are_ordered_along_line_3_object();
-    return (cln_order(s1_0, s2_0, s1_1) ||
-            cln_order(s1_0, s2_1, s1_1) ||
-            cln_order(s2_0, s1_0, s2_1)) ? COPLANAR_SEGMENTS : NO_INTERSECTION_OLD;
-  }
-
-  if(or1 != or2)
-  {
-    or1 = cpl_orient(s2_0, s2_1, s1_0);
-    return (or1 == COLLINEAR || or1 != cpl_orient(s2_0, s2_1, s1_1)) ? POINT_INTERSECTION_OLD : NO_INTERSECTION_OLD;
-  }
-
-  return NO_INTERSECTION_OLD;
-}
-
-
 // test intersection in the interior of segment pq and rs with pq and rs being coplanar segments
 // note that for coplanar cases, we might report identical endpoints
 template <class K>
@@ -723,18 +659,6 @@ void generate_subtriangles(std::size_t ti,
                                                points);
           COUNTER_INSTRUCTION(counter.timer5.stop();)
 
-
-          //~ Segment_inter_type_old seg_inter_type_old =
-            //~ do_coplanar_segments_intersect_old<EK>(points[segments[i].first], points[segments[i].second],
-                                               //~ points[segments[j].first], points[segments[j].second]);
-
-
-          //~ std::cout << std::setprecision(17);
-          //~ std::cout << points[segments[i].first] << " " << points[segments[i].second] << "\n";
-          //~ std::cout << points[segments[j].first] << " " << points[segments[j].second] << "\n";
-          //~ std::cout << "OLD: " << print_enum(seg_inter_type_old) << "\n";
-          //~ std::cout << "NEW: " << print_enum(seg_inter_type) << "\n";
-
           switch(seg_inter_type)
           {
             case POINT_P:
@@ -947,14 +871,14 @@ void generate_subtriangles(std::size_t ti,
   segments.erase(last, segments.end());
 
 
-  std::ofstream("/tmp/tri.xyz") << std::setprecision(17) << triangles[ti][0] << "\n"
-                                                         << triangles[ti][1] << "\n"
-                                                         << triangles[ti][2] << "\n";
-  std::ofstream debug("/tmp/cst.polylines.txt");
-  debug << std::setprecision(17);
-  for(auto s : segments)
-    debug << "2 " << points[s.first] << " " << points[s.second] << "\n";
-  debug.close();
+  //~ std::ofstream("/tmp/tri.xyz") << std::setprecision(17) << triangles[ti][0] << "\n"
+                                                         //~ << triangles[ti][1] << "\n"
+                                                         //~ << triangles[ti][2] << "\n";
+  //~ std::ofstream debug("/tmp/cst.polylines.txt");
+  //~ debug << std::setprecision(17);
+  //~ for(auto s : segments)
+    //~ debug << "2 " << points[s.first] << " " << points[s.second] << "\n";
+  //~ debug.close();
 
   COUNTER_INSTRUCTION(counter.timer3.start();)
   cdt.insert_constraints(points.begin(), points.end(), segments.begin(), segments.end());

From b31dc68889c704f0120e6286fb3bbbacdf19da48 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 16 Mar 2023 10:28:24 +0100
Subject: [PATCH 0187/1398] add another option coplanar orientation

---
 .../Polygon_mesh_processing/autorefinement.h  | 20 ++++++++++++++-----
 1 file changed, 15 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index f6b7bac57bb4..7432f1f7d35e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -38,7 +38,7 @@
 
 #define TEST_RESOLVE_INTERSECTION
 #define DEDUPLICATE_SEGMENTS
-#define DEBUG_COUNTERS
+//#define DEBUG_COUNTERS
 //#define USE_FIXED_PROJECTION_TRAITS
 //#define DEBUG_DEPTH
 
@@ -77,10 +77,20 @@ Segment_inter_type
 do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
                                std::size_t ri, std::size_t si,
                                const std::vector<typename K::Point_3>& points,
+                               const typename K::Vector_3& plane_normal,
                                const K& k = K())
 {
   typename K::Collinear_are_ordered_along_line_3 cln_order = k.collinear_are_ordered_along_line_3_object();
+#ifdef USE_PROJECTED_ORIENTATION_2_FOR_COPLANAR_ORIENTATION_TESTS
+  auto cpl_orient =
+    [&plane_normal](const typename K::Point_3& p, const typename K::Point_3& q, const typename K::Point_3& r)
+  {
+    return ::CGAL::orientation(q-p, r-p, plane_normal);
+  };
+#else
   typename K::Coplanar_orientation_3 cpl_orient=k.coplanar_orientation_3_object();
+  CGAL_USE(plane_normal);
+#endif
 
   const typename K::Point_3& p=points[pi];
   const typename K::Point_3& q=points[qi];
@@ -638,7 +648,7 @@ void generate_subtriangles(std::size_t ti,
     std::vector<Bbox_3> segment_boxes(nbs);
     for (std::size_t i = 0; i<nbs; ++i)
       segment_boxes[i]=point_boxes[segments[i].first]+point_boxes[segments[i].second];
-//~ std::cout << "=========================================================================\n";
+
     for (std::size_t i = 0; i<nbs-1; ++i)
     {
       for (std::size_t j = i+1; j<nbs; ++j)
@@ -656,7 +666,7 @@ void generate_subtriangles(std::size_t ti,
           Segment_inter_type seg_inter_type =
             do_coplanar_segments_intersect<EK>(segments[i].first, segments[i].second,
                                                segments[j].first, segments[j].second,
-                                               points);
+                                               points, n);
           COUNTER_INSTRUCTION(counter.timer5.stop();)
 
           switch(seg_inter_type)
@@ -767,9 +777,10 @@ void generate_subtriangles(std::size_t ti,
               points_on_segments[j].push_back(segments[i].second);
               break;
             }
-//            break;
             case NO_INTERSECTION:
+            {
               COUNTER_INSTRUCTION(++counter.c4;)
+            }
           }
         }
         COUNTER_INSTRUCTION(++counter.total;)
@@ -859,7 +870,6 @@ void generate_subtriangles(std::size_t ti,
       }
     }
   }
-  //~ std::cout << "done\n";
 #endif
 
   // TODO: sorted pair to be constructed when pushing_back

From 38a92ead67a2b471b68ecfc23367b72b710739ae Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 16 Mar 2023 14:59:08 +0100
Subject: [PATCH 0188/1398] make the message clearer

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h     | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 7432f1f7d35e..a54e4d299712 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -36,7 +36,7 @@
 
 #include <vector>
 
-#define TEST_RESOLVE_INTERSECTION
+//#define TEST_RESOLVE_INTERSECTION
 #define DEDUPLICATE_SEGMENTS
 //#define DEBUG_COUNTERS
 //#define USE_FIXED_PROJECTION_TRAITS
@@ -1178,7 +1178,7 @@ void autorefine_soup_output(const PointRange& input_points,
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE
   CGAL_PMP_AUTOREFINE_VERBOSE("check soup");
   if (does_triangle_soup_self_intersect(exact_soup_points, soup_triangles))
-    throw std::runtime_error("invalid output");
+    throw std::runtime_error("ERROR: invalid output, there is most probably a bug");
 #endif
 #endif
   CGAL_PMP_AUTOREFINE_VERBOSE("done");

From 6139fc4119b0c80bd6285e4c1cf1c7c269b85721 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 16 Mar 2023 19:10:05 +0100
Subject: [PATCH 0189/1398] insert points even if no constraints

---
 .../Polygon_mesh_processing/autorefinement.h   | 18 ++++++++++--------
 1 file changed, 10 insertions(+), 8 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index a54e4d299712..734a47fcf562 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -465,7 +465,6 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   {
     int j=(i+1)%3;
     test_edge<K>(t1[i], t1[j], t2[0], t2[1], t2[2], ori[i], ori[j], inter_pts);
-    //~ if (inter_pts.size()>1) return;
   }
 
   // test edges of t2 vs t1
@@ -475,7 +474,6 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   {
     int j=(i+1)%3;
     test_edge<K>(t2[i], t2[j], t1[0], t1[1], t1[2], ori[i], ori[j], inter_pts);
-    //~ if (inter_pts.size()>1) return;
   }
 
   // because we don't handle intersection type and can have edge-edge edge-vertex duplicates
@@ -483,9 +481,10 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   auto last = std::unique(inter_pts.begin(), inter_pts.end());
   inter_pts.erase(last, inter_pts.end());
 
-
+#ifdef DEBUG_DEPTH
   for (auto p : inter_pts)
     if (depth(p)>2) throw std::runtime_error("Depth is not 2: "+std::to_string(depth(p)));
+#endif
 }
 
 //////////////////////////////////
@@ -507,8 +506,8 @@ void generate_subtriangles(std::size_t ti,
                            const std::vector<std::array<typename EK::Point_3,3>>& triangles,
                            std::vector<std::array<typename EK::Point_3,3>>& new_triangles)
 {
-  //~ std::cout << "generate_subtriangles()\n";
-  std::cout << std::setprecision(17);
+  // std::cout << "generate_subtriangles()\n";
+  // std::cout << std::setprecision(17);
 
 #ifdef USE_FIXED_PROJECTION_TRAITS
   typedef ::CGAL::internal::Projection_traits_3<EK, dim> P_traits;
@@ -870,16 +869,16 @@ void generate_subtriangles(std::size_t ti,
       }
     }
   }
-#endif
 
   // TODO: sorted pair to be constructed when pushing_back
+  // TODO: only needed in case of coplanar segments?
   for (std::pair<std::size_t, size_t>& s : segments)
     if (s.second < s.first)
       std::swap(s.first,s.second);
   std::sort(segments.begin(), segments.end());
   auto last = std::unique(segments.begin(), segments.end());
   segments.erase(last, segments.end());
-
+#endif
 
   //~ std::ofstream("/tmp/tri.xyz") << std::setprecision(17) << triangles[ti][0] << "\n"
                                                          //~ << triangles[ti][1] << "\n"
@@ -891,7 +890,10 @@ void generate_subtriangles(std::size_t ti,
   //~ debug.close();
 
   COUNTER_INSTRUCTION(counter.timer3.start();)
-  cdt.insert_constraints(points.begin(), points.end(), segments.begin(), segments.end());
+  if (segments.empty())
+    cdt.insert(points.begin(), points.end());
+  else
+    cdt.insert_constraints(points.begin(), points.end(), segments.begin(), segments.end());
   COUNTER_INSTRUCTION(counter.timer3.stop();)
 
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS

From 85b3f7ed5732f203905086d630b7e35c521e7c23 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 27 Mar 2023 17:52:09 +0200
Subject: [PATCH 0190/1398] working around non-triangular polygons

---
 .../Polygon_mesh_processing/soup_autorefinement.cpp        | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index 9ade96e3be84..a46fc6e711c7 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -7,6 +7,8 @@
 #include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
 #include <CGAL/IO/polygon_soup_io.h>
 
+#include <boost/container/small_vector.hpp>
+
 #include <iostream>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
@@ -22,10 +24,13 @@ int main(int argc, char** argv)
                                          : std::string(argv[1]);
 
   std::vector<Point> input_points;
-  std::vector<std::array<std::size_t, 3>> input_triangles;
+  std::vector<boost::container::small_vector<std::size_t, 3>> input_triangles;
   CGAL::IO::read_polygon_soup(filename, input_points, input_triangles);
   PMP::repair_polygon_soup(input_points, input_triangles);
 
+  for (const auto& c : input_triangles)
+    if (c.size()!=3) return 0; // skipt for now
+
   std::vector<Point> output_points;
   std::vector<std::array<std::size_t, 3>> output_triangles;
   PMP::autorefine_soup_output(input_points, input_triangles, output_points, output_triangles);

From b06ed794e6e7ffa1f3112ec16ba556128be2ba79 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 27 Mar 2023 17:53:36 +0200
Subject: [PATCH 0191/1398] add more debug

---
 .../Polygon_mesh_processing/autorefinement.h  | 159 +++++++++++++++++-
 1 file changed, 155 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 734a47fcf562..7cd083e83388 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -36,7 +36,7 @@
 
 #include <vector>
 
-//#define TEST_RESOLVE_INTERSECTION
+#define TEST_RESOLVE_INTERSECTION
 #define DEDUPLICATE_SEGMENTS
 //#define DEBUG_COUNTERS
 //#define USE_FIXED_PROJECTION_TRAITS
@@ -227,6 +227,69 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
 //////////////////////////////////
 //////////////////////////////////
 
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+template <class Kernel>
+void old_intersection_coplanar_triangles_cutoff(const typename Kernel::Point_3& p,
+                                                const typename Kernel::Point_3& q,
+                                                const typename Kernel::Point_3& r,
+                                                const Kernel& k,
+                                                std::list<typename Kernel::Point_3>& inter_pts)
+{
+  typedef typename std::list<typename Kernel::Point_3>::iterator Iterator;
+
+  if(inter_pts.empty())
+    return;
+
+  typename Kernel::Coplanar_orientation_3 orient = k.coplanar_orientation_3_object();
+  typename Kernel::Construct_line_3 line = k.construct_line_3_object();
+
+  //orient(p,q,r,r) is POSITIVE
+  std::map<const typename Kernel::Point_3*,Orientation> orientations;
+  for (Iterator it=inter_pts.begin();it!=inter_pts.end();++it)
+    orientations[ &(*it) ]=orient(p,q,r,*it);
+
+  CGAL_kernel_assertion_code(int pt_added = 0;)
+
+  const typename Kernel::Point_3* prev = &(*boost::prior(inter_pts.end()));
+  Iterator stop = inter_pts.size() > 2 ? inter_pts.end() : boost::prior(inter_pts.end());
+  for(Iterator it=inter_pts.begin(); it!=stop; ++it)
+  {
+    const typename Kernel::Point_3& curr = *it;
+    Orientation or_prev = orientations[prev],
+                or_curr = orientations[&curr];
+
+    if((or_prev == POSITIVE && or_curr == NEGATIVE) ||
+       (or_prev == NEGATIVE && or_curr == POSITIVE))
+    {
+      typename Intersection_traits<Kernel, typename Kernel::Line_3, typename Kernel::Line_3>::result_type
+        obj = ::CGAL::Intersections::internal::intersection(line(p,q), line(*prev,curr), k);
+
+      // assert "not empty"
+      CGAL_kernel_assertion(bool(obj));
+
+      const typename Kernel::Point_3* inter = ::CGAL::Intersections::internal::intersect_get<typename Kernel::Point_3>(obj);
+      CGAL_kernel_assertion(inter != nullptr);
+
+      prev = &(*inter_pts.insert(it,*inter));
+      orientations[prev] = COLLINEAR;
+      CGAL_kernel_assertion_code(++pt_added;)
+    }
+
+    prev = &(*it);
+  }
+
+  CGAL_kernel_assertion(pt_added<3);
+  Iterator it = inter_pts.begin();
+  while(it!=inter_pts.end())
+  {
+    if(orientations[&(*it)] == NEGATIVE)
+      inter_pts.erase(it++);
+    else
+      ++it;
+  }
+}
+#endif
+
 // imported from Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
 template<class K>
 void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
@@ -242,6 +305,19 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
   l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(-1,2));
 
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::list<typename K::Point_3> old_l_inter_pts;
+  old_l_inter_pts.push_back(p2);
+  old_l_inter_pts.push_back(q2);
+  old_l_inter_pts.push_back(r2);
+
+
+  auto enum_to_string = [](CGAL::Orientation o)
+  {
+    if (o==COLLINEAR) return std::string("COLLINEAR");
+    if (o==POSITIVE) return std::string("POSITIVE");
+    return std::string("NEGATIVE");
+  };
+
   auto to_string = [](const auto& t)
   {
     std::stringstream sstr;
@@ -256,6 +332,32 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
   std::cout << "intersection_coplanar_triangles\n";
   std::ofstream("/tmp/t1.polylines.txt") << to_string(t1) << "\n";
   std::ofstream("/tmp/t2.polylines.txt") << to_string(t2) << "\n";
+
+  std::cout << "Position of vertices of t1: ";
+  std::cout << enum_to_string( coplanar_orientation(p2,q2,r2,p1)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(p2,q2,r2,q1)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(p2,q2,r2,r1)) << "\n";
+  std::cout << "                            ";
+  std::cout << enum_to_string( coplanar_orientation(q2,r2,p2,p1)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(q2,r2,p2,q1)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(q2,r2,p2,r1)) << "\n";
+  std::cout << "                            ";
+  std::cout << enum_to_string( coplanar_orientation(r2,p2,q2,p1)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(r2,p2,q2,q1)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(r2,p2,q2,r1)) << "\n";
+  std::cout << "Position of vertices of t2: ";
+  std::cout << enum_to_string( coplanar_orientation(p1,q1,r1,p2)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(p1,q1,r1,q2)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(p1,q1,r1,r2)) << "\n";
+  std::cout << "                            ";
+  std::cout << enum_to_string( coplanar_orientation(q1,r1,p1,p2)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(q1,r1,p1,q2)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(q1,r1,p1,r2)) << "\n";
+  std::cout << "                            ";
+  std::cout << enum_to_string( coplanar_orientation(r1,p1,q1,p2)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(r1,p1,q1,q2)) << " - ";
+  std::cout << enum_to_string( coplanar_orientation(r1,p1,q1,r2)) << "\n";
+
   auto print_points = [&]()
   {
     for(auto p : l_inter_pts) std::cout << "  (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) "; std::cout <<"\n";
@@ -270,31 +372,76 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
   print_points();
+  old_intersection_coplanar_triangles_cutoff(p1,q1,r1,k,old_l_inter_pts);
+  CGAL_assertion(l_inter_pts.size()==old_l_inter_pts.size());
+  for (std::size_t i=0; i<l_inter_pts.size(); ++i)
+  {
+    if (*(std::next(old_l_inter_pts.begin(),i))!=std::next(l_inter_pts.begin(),i)->point(p1,q1,r1,p2,q2,r2,k))
+    {
+      std::cout <<"ERROR with point #" << i << "\n";
+      throw std::runtime_error("invalid output 0");
+    }
+  }
 #endif
   intersection_coplanar_triangles_cutoff(q1,r1,p1,1,p2,q2,r2,k,l_inter_pts); //line q1r1
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
   print_points();
+  old_intersection_coplanar_triangles_cutoff(q1,r1,p1,k,old_l_inter_pts);
+  CGAL_assertion(l_inter_pts.size()==old_l_inter_pts.size());
+  for (std::size_t i=0; i<l_inter_pts.size(); ++i)
+  {
+    if (*(std::next(old_l_inter_pts.begin(),i))!=std::next(l_inter_pts.begin(),i)->point(p1,q1,r1,p2,q2,r2,k))
+    {
+      std::cout <<"ERROR with point #" << i << "\n";
+      throw std::runtime_error("invalid output 1");
+    }
+  }
 #endif
   intersection_coplanar_triangles_cutoff(r1,p1,q1,2,p2,q2,r2,k,l_inter_pts); //line r1p1
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
   print_points();
+  old_intersection_coplanar_triangles_cutoff(r1,p1,q1,k,old_l_inter_pts);
+  CGAL_assertion(l_inter_pts.size()==old_l_inter_pts.size());
+  for (std::size_t i=0; i<l_inter_pts.size(); ++i)
+  {
+    if (*(std::next(old_l_inter_pts.begin(),i))!=std::next(l_inter_pts.begin(),i)->point(p1,q1,r1,p2,q2,r2,k))
+    {
+      std::cout <<"ERROR with point #" << i << "\n";
+      throw std::runtime_error("invalid output 2");
+    }
+  }
+#endif
+
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  std::size_t start=inter_pts.size();
 #endif
 
   for (const Intersections::internal::Point_on_triangle<K>& pot : l_inter_pts)
     inter_pts.push_back( pot.point(p1,q1,r1,p2,q2,r2,k) );
 
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  for (std::size_t i=0; i<l_inter_pts.size(); ++i)
+  {
+    typename K::Point_3 inter = inter_pts[start+i];
+    CGAL_assertion( coplanar_orientation(p1,q1,r1,inter)!=NEGATIVE );
+    CGAL_assertion( coplanar_orientation(q1,r1,p1,inter)!=NEGATIVE );
+    CGAL_assertion( coplanar_orientation(r1,p1,q1,inter)!=NEGATIVE );
+    CGAL_assertion( coplanar_orientation(p2,q2,r2,inter)!=NEGATIVE );
+    CGAL_assertion( coplanar_orientation(q2,r2,p2,inter)!=NEGATIVE );
+    CGAL_assertion( coplanar_orientation(r2,p2,q2,inter)!=NEGATIVE );
+  }
+
   std::ofstream debug("interpts.xyz");
   debug << std::setprecision(17);
   debug << l_inter_pts.size() << "\n";
   for (auto pot : l_inter_pts)
     debug << pot.point(p1,q1,r1,p2,q2,r2,k)  << "\n";
   debug.close();
-  std::cout <<"check!\n";
-  int i;
-  std::cin >> i;
+  // std::cout <<"check!\n";
+  // int i;
+  // std::cin >> i;
 #endif
 
 }
@@ -1022,6 +1169,10 @@ void autorefine_soup_output(const PointRange& input_points,
     std::vector<typename EK::Point_3> inter_pts;
     autorefine_impl::collect_intersections<EK>(t1, t2, inter_pts);
 
+    CGAL_assertion(
+      CGAL::do_intersect(typename EK::Triangle_3(t1[0], t1[1], t1[2]), typename EK::Triangle_3(t2[0], t2[1], t2[2]))
+      != inter_pts.empty());
+
     if (!inter_pts.empty())
     {
       std::size_t nbi = inter_pts.size();

From bd967e7cec9885afb9cee799ae6b39a16abfa609 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 27 Mar 2023 17:53:50 +0200
Subject: [PATCH 0192/1398] avoid duplicated tangency point

---
 .../Polygon_mesh_processing/autorefinement.h  | 19 ++++++++++++++++++-
 1 file changed, 18 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 7cd083e83388..c90ba515271c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -778,7 +778,13 @@ void generate_subtriangles(std::size_t ti,
     std::map<typename EK::Point_3, std::size_t> point_id_map;
 
     for (std::size_t pid=0; pid<points.size(); ++pid)
-      point_id_map.insert(std::make_pair(points[pid], pid));
+    {
+      CGAL_assertion_code(bool insertion_ok =)
+      point_id_map.insert(std::make_pair(points[pid], pid))
+      CGAL_assertion_code(.second);
+      CGAL_assertion(insertion_ok);
+    }
+
 
     auto get_point_id = [&](const typename EK::Point_3& pt)
     {
@@ -1015,6 +1021,9 @@ void generate_subtriangles(std::size_t ti,
           segments.emplace_back(points_on_segments[i][pos], points_on_segments[i][pos+1]);
       }
     }
+
+    CGAL_assertion(points.size()==std::set<typename EK::Point_3>(points.begin(), points.end()).size());
+    CGAL_assertion(points.size()==point_id_map.size());
   }
 
   // TODO: sorted pair to be constructed when pushing_back
@@ -1217,6 +1226,14 @@ void autorefine_soup_output(const PointRange& input_points,
         return insert_res.first->second;
       };
 
+      if (!all_points[ti].empty())
+      {
+        std::vector<typename EK::Point_3> tmp;
+        tmp.swap(all_points[ti]);
+        for (const typename EK::Point_3& pt : tmp)
+          get_point_id(pt);
+      }
+
       std::size_t nbs = all_segments[ti].size();
       std::vector<std::array<EK::Point_3,2>> filtered_segments;
       std::vector<std::size_t> filtered_in_triangle_ids;

From 2b74b8f10d561a335e159857e14f109a92aeed50 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 28 Mar 2023 14:35:40 +0200
Subject: [PATCH 0193/1398] fix some bugs

---
 .../Triangle_3_Triangle_3_intersection.h      | 98 ++++++++++++++-----
 1 file changed, 76 insertions(+), 22 deletions(-)

diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index ac376f443506..35aa4f8f0a53 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -24,6 +24,7 @@
 #include <CGAL/kernel_assertions.h>
 
 #include <boost/next_prior.hpp>
+#include <boost/container/flat_set.hpp>
 
 #include <list>
 #include <map>
@@ -86,6 +87,7 @@ struct Point_on_triangle
   // (-1, id) point on t2
   // (id1, id2) intersection of edges
   std::pair<int, int> t1_t2_ids;
+  boost::container::flat_set<int> extra_t1;
   typename Kernel::FT alpha;
 
   Orientation
@@ -161,7 +163,7 @@ intersection(const Point_on_triangle<Kernel>& p,
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "    calling intersection: ";
   std::cout << " (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) -";
-  std::cout << " (" << q.id1() << "," << q.id2() << ",[" << q.alpha << "]) || e" << edge_id_t1 << "\n";
+  std::cout << " (" << q.id1() << "," << q.id2() << ",[" << q.alpha << "]) || e" << edge_id_t1;
 #endif
   typedef Point_on_triangle<Kernel> Pot;
   switch(p.id1())
@@ -172,17 +174,26 @@ intersection(const Point_on_triangle<Kernel>& p,
       {
         case -1: // (-1, ip2) - (-1, iq2)
         {
+          CGAL_assertion((p.id2()+1)%3 == q.id2() || (q.id2()+1)%3 == p.id2());
+//          CGAL_assertion(p.extra_t1.empty() && q.extra_t1.empty());  // TMP to see if it's worth implementing special case
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+          std::cout << " -- case 1\n";
+#endif
           typename Kernel::FT alpha =
             coplanar_segment_segment_alpha_intersection(p1, q1,
                                                         Pot::point_from_id(p2, q2, r2, p.id2()),
                                                         Pot::point_from_id(p2, q2, r2, q.id2()), k);
-          return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), alpha); // intersection with an original edge of t2
+          int id2 = (p.id2()+1)%3 == q.id2() ? p.id2() : q.id2();
+          return  Point_on_triangle<Kernel>(edge_id_t1, id2, alpha); // intersection with an original edge of t2
         }
         default:
           if (q.id2()!=-1) // (-1, ip2) - (iq1, iq2)
           {
             if (p.id2() == q.id2() || p.id2() == (q.id2()+1)%3)
             {
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+              std::cout << " -- case 2\n";
+#endif
               // points are on the same edge of t2 --> we shorten an already cut edge
               typename Kernel::FT alpha =
                 coplanar_segment_segment_alpha_intersection(p1, q1,
@@ -191,13 +202,23 @@ intersection(const Point_on_triangle<Kernel>& p,
 
               return  Point_on_triangle<Kernel>(edge_id_t1, q.id2(), alpha);
             }
-            // point of t1
-            return  Point_on_triangle<Kernel>((q.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3 , -1);
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+            std::cout << " -- case 3\n";
+#endif
+            // point of t1: look for an edge of t1 containing both points
+            CGAL_assertion( p.extra_t1.count(q.id1())!=0 || p.extra_t1.count(3-q.id1()-edge_id_t1)!=0 );
+            int eid1 = p.extra_t1.count(q.id1())!=0 ? q.id1() : 3-q.id1()-edge_id_t1;
+            return  Point_on_triangle<Kernel>((eid1+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3, -1); // vertex of t1
           }
           // (-1, ip2) - (iq1, -1)
           //vertex of t1, special case t1 edge passed thru a vertex of t2
           CGAL_assertion(edge_id_t1 == 2);
-          return  Point_on_triangle<Kernel>(2, -1); // point on t1 has to be created from the intersection of edge 0 and edge 1
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+          std::cout << " -- case 4\n";
+#endif
+          CGAL_assertion(q.id1()==1);
+          CGAL_assertion(!p.extra_t1.empty());
+          return  Point_on_triangle<Kernel>(p.extra_t1.count(0)==1?0:2,-1);
       }
     }
     default:
@@ -210,13 +231,24 @@ intersection(const Point_on_triangle<Kernel>& p,
           {
             case -1: // (ip1, -1) - (-1, iq2)
               //vertex of t1, special case t1 edge passed thru a vertex of t2
-              return  Point_on_triangle<Kernel>(0, -1);
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+              std::cout << " -- case 5\n";
+#endif
+              CGAL_assertion(edge_id_t1 == 2);
+              CGAL_assertion(p.id1()==1);
+              CGAL_assertion(!q.extra_t1.empty());
+              return  Point_on_triangle<Kernel>(q.extra_t1.count(0)==1?0:2,-1);
             default:
             {
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+              std::cout << " -- case 6\n";
+#endif
               CGAL_assertion(q.id2()!=-1); // (ip1, -1) - (iq2, -1)
               //(ip1,-1), (iq1, iq2)
-              CGAL_assertion(edge_id_t1==2 && p.id1()==1);
-              return  Point_on_triangle<Kernel>(q.id1()==1?2:0,-1); // vertex of t1
+              CGAL_assertion(edge_id_t1==2);
+              // p and q are on the same edge of t1
+              CGAL_assertion(p.id1()==q.id1() || p.id1()==(q.id1()+1)%3);
+              return  Point_on_triangle<Kernel>((q.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3 , -1);
             }
           }
         }
@@ -228,6 +260,9 @@ intersection(const Point_on_triangle<Kernel>& p,
             {
               if (q.id2() == p.id2() || q.id2() == (p.id2()+1)%3)
               {
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+                std::cout << " -- case 7\n";
+#endif
                 // points are on the same edge of t2 --> we shorten an already cut edge
                 typename Kernel::FT alpha =
                   coplanar_segment_segment_alpha_intersection(p1, q1,
@@ -236,8 +271,14 @@ intersection(const Point_on_triangle<Kernel>& p,
 
                 return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), alpha);
               }
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+              std::cout << " -- case 8\n";
+#endif
               // point of t1
-              return  Point_on_triangle<Kernel>((p.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3 , -1);
+              //std::cout << "q.extra_t1: "; for(int qet1 : q.extra_t1) std::cout << " " << qet1; std::cout << "\n";
+              CGAL_assertion( q.extra_t1.count(p.id1())!=0 || q.extra_t1.count(3-p.id1()-edge_id_t1)!=0 );
+              int eid1 = q.extra_t1.count(p.id1())!=0 ? p.id1() : 3-p.id1()-edge_id_t1;
+              return  Point_on_triangle<Kernel>((eid1+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3, -1); // vertex of t1
             }
             default:
             {
@@ -245,21 +286,30 @@ intersection(const Point_on_triangle<Kernel>& p,
               {
                 case -1: // (ip1, ip2) - (iq1, -1)
                 {
-                  CGAL_assertion(edge_id_t1==2 && q.id1()==1);
-                  return  Point_on_triangle<Kernel>(p.id1()==1?2:0); // vertex of t1
+                  // p and q are on the same edge of t1
+                  CGAL_assertion(q.id1()==p.id1() ||  q.id1()==(p.id1()+1)%3);
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+                  std::cout << " -- case 9\n";
+#endif
+                  return  Point_on_triangle<Kernel>((p.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3 , -1);
                 }
                 default: // (ip1, ip2) - (iq1, iq2)
                 {
-                  CGAL_assertion(p.id1()==q.id1() || p.id2()==q.id2() );
-
-                  if (p.id1()==q.id1())
-                    return  Point_on_triangle<Kernel>((p.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3, -1); // vertex of t1
-
-                  typename Kernel::FT alpha =
-                    coplanar_segment_segment_alpha_intersection(p1, q1,
-                                                                Pot::point_from_id(p2, q2, r2,  q.id2()),
-                                                                Pot::point_from_id(p2, q2, r2, (q.id2()+1)%3), k);
-                  return  Point_on_triangle<Kernel>(edge_id_t1, q.id2(), alpha);
+                  if (p.id2()==q.id2())
+                  {
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+                    std::cout << " -- case 10\n";
+#endif
+                    typename Kernel::FT alpha =
+                      coplanar_segment_segment_alpha_intersection(p1, q1,
+                                                                  Pot::point_from_id(p2, q2, r2,  q.id2()),
+                                                                  Pot::point_from_id(p2, q2, r2, (q.id2()+1)%3), k);
+                    return  Point_on_triangle<Kernel>(edge_id_t1, q.id2(), alpha);
+                  }
+                  // we are intersecting an edge of t1
+                  CGAL_assertion(p.id1()==q.id1() || edge_id_t1==2);
+                  int eid1 = p.id1()==q.id1() ? p.id1() : 1;
+                  return  Point_on_triangle<Kernel>((eid1+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3, -1); // vertex of t1
                 }
               }
             }
@@ -293,8 +343,12 @@ void intersection_coplanar_triangles_cutoff(const typename Kernel::Point_3& p1,
 
   //orient(p1,q1,r1,r1) is POSITIVE
   std::map<const Point_on_triangle<Kernel>*,Orientation> orientations; // TODO skip map
-  for (const Point_on_triangle<Kernel>& pot : inter_pts)
+  for (Point_on_triangle<Kernel>& pot : inter_pts)
+  {
     orientations[ &pot ]=pot.orientation(p1,q1,r1,edge_id,p2,q2,r2,k);
+    if (pot.id1()==-1 && orientations[ &pot ]==COLLINEAR)
+      pot.extra_t1.insert(edge_id);
+  }
 
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "    Orientations:";

From e29d52421e624a416b741e3416d75bc65ee1e101 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 28 Mar 2023 16:43:35 +0200
Subject: [PATCH 0194/1398] fix doc

---
 .../Polygon_mesh_processing/autorefinement.h   | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index c90ba515271c..c7e067916d59 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1360,19 +1360,18 @@ void autorefine_soup_output(const PointRange& input_points,
  * refines a triangle mesh so that no triangles intersects in their interior.
  *
  * @tparam TriangleMesh a model of `HalfedgeListGraph`, `FaceListGraph`, and `MutableFaceGraph`
- * @tparam NamedParameters a sequence of \ref namedparameters
+ * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
  *
  * @param tm input triangulated surface mesh
  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
  *
- * \cgalParamNBegin{geom_traits}
- *   \cgalParamDescription{an instance of a geometric traits class}
- *   \cgalParamType{a class model of `PMPSelfIntersectionTraits`}
- *   \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
- *   \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
- * \cgalParamNEnd
- *
  * \cgalNamedParamsBegin
+ *   \cgalParamNBegin{geom_traits}
+ *     \cgalParamDescription{an instance of a geometric traits class}
+ *     \cgalParamType{a class model of `PMPSelfIntersectionTraits`}
+ *     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+ *     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
+ *   \cgalParamNEnd
  *   \cgalParamNBegin{vertex_point_map}
  *     \cgalParamDescription{a property map associating points to the vertices of `tm`}
  *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%vertex_descriptor`
@@ -1380,7 +1379,8 @@ void autorefine_soup_output(const PointRange& input_points,
  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, tm)`}
  *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
  *                     must be available in `TriangleMesh`.}
- *  \cgalParamNEnd
+ *   \cgalParamNEnd
+ * \cgalNamedParamsEnd
  *
  */
 template <class TriangleMesh,

From 2bae23a2d5b1f73944b455387e0e9bbd0d0c3d80 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 29 Mar 2023 16:38:34 +0200
Subject: [PATCH 0195/1398] triangulate soup

---
 .../examples/Polygon_mesh_processing/soup_autorefinement.cpp  | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index a46fc6e711c7..d955734853bf 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -27,9 +27,7 @@ int main(int argc, char** argv)
   std::vector<boost::container::small_vector<std::size_t, 3>> input_triangles;
   CGAL::IO::read_polygon_soup(filename, input_points, input_triangles);
   PMP::repair_polygon_soup(input_points, input_triangles);
-
-  for (const auto& c : input_triangles)
-    if (c.size()!=3) return 0; // skipt for now
+  PMP::triangulate_polygons(input_points, input_triangles);
 
   std::vector<Point> output_points;
   std::vector<std::array<std::size_t, 3>> output_triangles;

From 2a791d2625c885b96f6d12b890d6b482918b48d9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 31 Mar 2023 10:24:42 +0200
Subject: [PATCH 0196/1398] add optional progress display

---
 .../CGAL/Polygon_mesh_processing/autorefinement.h   | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index c7e067916d59..4f56b8a0d817 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -25,6 +25,10 @@
 #include <CGAL/Projection_traits_3.h>
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 
+#ifdef USE_PROGRESS_DISPLAY
+#include <boost/timer/progress_display.hpp>
+#endif
+
 // output
 #include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
@@ -1260,6 +1264,11 @@ void autorefine_soup_output(const PointRange& input_points,
   CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
   // now refine triangles
   std::vector<std::array<EK::Point_3,3>> new_triangles;
+
+#ifdef USE_PROGRESS_DISPLAY
+  boost::timer::progress_display pd(triangles.size());
+#endif
+
   for(std::size_t ti=0; ti<triangles.size(); ++ti)
   {
     if (all_segments[ti].empty() && all_points[ti].empty())
@@ -1289,7 +1298,9 @@ void autorefine_soup_output(const PointRange& input_points,
       #endif
     }
 
-
+#ifdef USE_PROGRESS_DISPLAY
+    ++pd;
+#endif
   }
 
   // brute force output: create a soup, orient and to-mesh

From aefc4b9ce8d0cf6f5e9a5034b999744d7729fcfd Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 31 Mar 2023 10:26:21 +0200
Subject: [PATCH 0197/1398] repair soup before orient + to mesh

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h       | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 4f56b8a0d817..e38f64ff3010 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -20,6 +20,7 @@
 
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
 #include <CGAL/Polygon_mesh_processing/shape_predicates.h>
+#include <CGAL/Polygon_mesh_processing/repair_polygon_soup.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/Constrained_triangulation_plus_2.h>
 #include <CGAL/Projection_traits_3.h>
@@ -1417,6 +1418,7 @@ autorefine(      TriangleMesh& tm,
                          out_soup_points, out_soup_triangles);
 
   clear(tm);
+  repair_polygon_soup(out_soup_points, out_soup_triangles);
   orient_polygon_soup(out_soup_points, out_soup_triangles);
   polygon_soup_to_polygon_mesh(out_soup_points, out_soup_triangles, tm);
 }

From 55f8bcb12202de6fb6fe70ee3096d979b8f95dbe Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 6 Apr 2023 18:24:59 +0200
Subject: [PATCH 0198/1398] fix assertion

---
 .../internal/Triangle_3_Triangle_3_intersection.h               | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index 35aa4f8f0a53..4cc5f9be5600 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -372,7 +372,7 @@ void intersection_coplanar_triangles_cutoff(const typename Kernel::Point_3& p1,
 
       prev = inter_pts.insert(it,new_pt);
       orientations[&(*prev)] = COLLINEAR;
-      CGAL_assertion_code(++pt_added);
+      CGAL_kernel_assertion_code(++pt_added);
     }
 
     prev = it;

From cef23a90456ece3a592b33fcdf17317726759bb3 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 8 Apr 2023 10:24:47 +0200
Subject: [PATCH 0199/1398] moving captions out of the figure

---
 .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 49614be67c91..70f9cf00c0e7 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -921,10 +921,12 @@ distribution of values and "diffuses" the extreme values of curvatures across th
 
 \cgalFigureAnchor{icc_diff_radius}
 <center>
-<img src="icc_diff_radius.png" style="max-width:85%;"/>
+<img src="icc_diff_radius.png" style="max-width:90%;"/>
 </center>
 \cgalFigureCaptionBegin{icc_diff_radius}
-The mean curvature distribution on a bear mesh with different values for the ball radius parameter
+The mean curvature distribution on a bear mesh with different values for the ball
+radius parameter. R = 0 (a), R = 0.025 (b), R = 0.05 (c), R = 0.16 (d). Note that
+the max edge length is 0.031 and the size of bounding box of the mesh is 1 x 0.7 x 0.8.
 \cgalFigureCaptionEnd
 
 \ref BGLPropertyMaps are used to record the computed curvatures as shown in examples. In the following examples, for each property map, we associate

From 8393933630960d1b23198aac9bc37b6ce38ea0f0 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 8 Apr 2023 10:27:13 +0200
Subject: [PATCH 0200/1398] minor grammer fixes

---
 .../Polygon_mesh_processing.txt                        | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 70f9cf00c0e7..987b88b0a217 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -905,8 +905,8 @@ These computations are performed using (on all vertices of the mesh):
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
 
-Where it is recommended to use the last function for computing multiple curvatures (example: mean and Gaussian)
-as the implementation performs the shared computations only once, making it more efficient.
+Where it is recommended to use the last function for computing multiple curvatures (for example: mean and
+Gaussian) as the implementation performs the shared computations only once, making it more efficient.
 
 Similarly, we can use the following functions to compute curvatures on a specific vertex:
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
@@ -924,9 +924,9 @@ distribution of values and "diffuses" the extreme values of curvatures across th
 <img src="icc_diff_radius.png" style="max-width:90%;"/>
 </center>
 \cgalFigureCaptionBegin{icc_diff_radius}
-The mean curvature distribution on a bear mesh with different values for the ball
-radius parameter. R = 0 (a), R = 0.025 (b), R = 0.05 (c), R = 0.16 (d). Note that
-the max edge length is 0.031 and the size of bounding box of the mesh is 1 x 0.7 x 0.8.
+The mean curvature distribution on a bear mesh with different values for the ball radius
+parameter. R = 0 (a), R = 0.025 (b), R = 0.05 (c), R = 0.16 (d). Note that the max
+edge length is 0.031 and the size of the bounding box of the mesh is 1 x 0.7 x 0.8.
 \cgalFigureCaptionEnd
 
 \ref BGLPropertyMaps are used to record the computed curvatures as shown in examples. In the following examples, for each property map, we associate

From f8a9862abfd91f33622830b9142e3137c57842b6 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 17 Apr 2023 15:14:37 +0200
Subject: [PATCH 0201/1398] incomplete update to user man doc

---
 .../Polygon_mesh_processing.txt               | 19 ++++++++++++++-----
 1 file changed, 14 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 987b88b0a217..b454706b9723 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -892,10 +892,16 @@ not provide storage for the normals.
 This package provides methods to compute curvatures on polygonal meshes based on Interpolated Corrected Curvatures
 on Polyhedral Surfaces \cgalCite{lachaud2020}. This includes mean curvature, Gaussian curvature,
 principal curvatures and directions. These can be computed on triangle meshes, quad meshes,
-and meshes with n-gon faces. The algorithms used prove to work well in general. Also, on meshes
+and meshes with n-gon faces (for n-gons, the centroid must be inside the n-gon face).
+The algorithms used prove to work well in general. Also, on meshes
 with noise on vertex positions, they give accurate results, on the condition that the
 correct vertex normals are provided.
 
+\subsection ICCBackground Brief Background
+
+
+\subsection ICCAPI API
+
 The implementation is generic in terms of mesh data structure. It can be used on `Surface_mesh`,
 `Polyhedron_3` and other polygonal mesh structures based on the concept `FaceGraph`.
 
@@ -914,6 +920,9 @@ Similarly, we can use the following functions to compute curvatures on a specifi
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_one_vertex()`
 
+\subsection ICCResults Results
+
+**To be updated**
 
 \cgalFigureRef{icc_diff_radius} shows how the mean curvature changes depending on
 the named parameter `ball_radius`, which can be set to a value > 0 to get a smoother
@@ -921,12 +930,12 @@ distribution of values and "diffuses" the extreme values of curvatures across th
 
 \cgalFigureAnchor{icc_diff_radius}
 <center>
-<img src="icc_diff_radius.png" style="max-width:90%;"/>
+<img src="icc_diff_radius.png" style="max-width:85%;"/>
 </center>
 \cgalFigureCaptionBegin{icc_diff_radius}
-The mean curvature distribution on a bear mesh with different values for the ball radius
-parameter. R = 0 (a), R = 0.025 (b), R = 0.05 (c), R = 0.16 (d). Note that the max
-edge length is 0.031 and the size of the bounding box of the mesh is 1 x 0.7 x 0.8.
+The mean curvature on a mesh with different values for the ball radius
+parameter: (a) R = 0, (b) R = 0.025, (c) R = 0.05, (d) R = 0.16. Note that the max
+edge length is 0.031 and the size of the bounding box of the mesh is 1 x .7 x .8.
 \cgalFigureCaptionEnd
 
 \ref BGLPropertyMaps are used to record the computed curvatures as shown in examples. In the following examples, for each property map, we associate

From 261eac81e9847bdc2b313ac19ae7a00edeaa9405 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Tue, 18 Apr 2023 14:30:37 +0200
Subject: [PATCH 0202/1398] user manual - incomplete

---
 .../Polygon_mesh_processing.txt               | 57 ++++++++++++++++---
 1 file changed, 49 insertions(+), 8 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index b454706b9723..ead5b5a8c80c 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -889,16 +889,57 @@ not provide storage for the normals.
 ****************************************
 \section PMPICC Computing Curvatures
 
-This package provides methods to compute curvatures on polygonal meshes based on Interpolated Corrected Curvatures
-on Polyhedral Surfaces \cgalCite{lachaud2020}. This includes mean curvature, Gaussian curvature,
-principal curvatures and directions. These can be computed on triangle meshes, quad meshes,
-and meshes with n-gon faces (for n-gons, the centroid must be inside the n-gon face).
-The algorithms used prove to work well in general. Also, on meshes
-with noise on vertex positions, they give accurate results, on the condition that the
-correct vertex normals are provided.
+This package provides methods to compute curvatures on polygonal meshes based on Interpolated
+Corrected Curvatures on Polyhedral Surfaces \cgalCite{lachaud2020}. This includes mean curvature,
+Gaussian curvature, principal curvatures and directions. These can be computed on triangle meshes,
+quad meshes, and meshes with n-gon faces (for n-gons, the centroid must be inside the n-gon face).
+The algorithms used prove to work well in general. Also, on meshes with noise on vertex positions,
+they give accurate results, on the condition that the correct vertex normals are provided.
 
 \subsection ICCBackground Brief Background
 
+Curvatures are quantities that describe the local geometry of a surface. They are important in many
+geometry processing applications. since surfaces are 2-dimensional objects (embedded in 3D), they can bend
+in 2 independent directions. These directions are called principal directions, and the amount of bending
+in each direction is called the principal curvature: \f$ k_1 \f$ and \f$ k_2 \f$. Curvature is usually
+expressed as scalar quantities like the mean curvature \f$ H \f$ and the Gaussian curvature \f$ K \f$
+which are defined in terms of the principal curvatures.
+
+The algorithms are based on the following paper \cgalCite{lachaud2020}. It introduces a new way to
+compute curvatures on polygonal meshes. The main idea is based on decoupling the normal information from
+the position information, which is useful for dealing with digital surfaces, or meshes with noise on
+vertex positions. To compute the curvatures, we first compute interpolated curvature measures for each face
+as described below. For a triangle \f$ \tau_{ijk} \f$, with vertices \a i, \a j, \a k:
+
+\f[
+  \begin{align*}
+  \mu^{(0)}(\tau_{ijk}) = &\frac{1}{2} \langle \bar{\mathbf{u}} \mid (\mathbf{x}_j - \mathbf{x}_i) \times (\mathbf{x}_k - \mathbf{x}_i) \rangle, \\
+  \mu^{(1)}(\tau_{ijk}) = &\frac{1}{2} \langle \bar{\mathbf{u}} \mid (\mathbf{u}_k - \mathbf{u}_j) \times \mathbf{x}_i + (\mathbf{u}_i - \mathbf{u}_k) \times \mathbf{x}_j + (\mathbf{u}_j - \mathbf{u}_i) \times \mathbf{x}_k \rangle, \\
+  \mu^{(2)}(\tau_{ijk}) = &\frac{1}{2} \langle \mathbf{u}_i \mid \mathbf{u}_j \times \mathbf{u}_k \rangle, \\
+  \mu^{\mathbf{X},\mathbf{Y}}(\tau_{ijk}) = & \frac{1}{2} \big\langle \bar{\mathbf{u}} \big| \langle \mathbf{Y} | \mathbf{u}_k -\mathbf{u}_i \rangle \mathbf{X} \times (\mathbf{x}_j - \mathbf{x}_i) \big\rangle
+    -\frac{1}{2} \big\langle \bar{\mathbf{u}} \big| \langle \mathbf{Y} | \mathbf{u}_j -\mathbf{u}_i \rangle \mathbf{X} \times (\mathbf{x}_k - \mathbf{x}_i) \big\rangle,
+  \end{align*}
+\f]
+where \f$ \langle \cdot \mid \cdot \rangle \f$ denotes the usual scalar product,
+\f$ \bar{\mathbf{u}}=\frac{1}{3}( \mathbf{u}_i + \mathbf{u}_j + \mathbf{u}_k )\f$.
+
+The first measure \f$ \mu^{(0)} \f$ is the area measure of the triangle, and the second and third measures
+\f$ \mu^{(1)} \f$ and \f$ \mu^{(2)} \f$ are the mean and Gaussian corrected curvature measures of the triangle.
+The last measure \f$ \mu^{\mathbf{X},\mathbf{Y}} \f$ is the anisotropic corrected curvature measure of the triangle.
+The anisotropic measure is later used to compute the principal curvatures and directions through an eigenvalue
+solver.
+
+The interpolated curvature measures are then computed for each vertex \f$ v \f$ as the sum of
+the curvature measures of the faces in a ball around \f$ v \f$ weighted by the inclusion ratio of the
+triangle in the ball. if the ball radius is not specified, the sum is instead over the incident faces
+of \f$ v \f$.
+
+To get the final curvature value for a vertex \f$ v \f$, the respective interpolated curvature measure
+is divided by the interpolated area measure.
+
+\f[
+\mu^{(k)}( B ) = \sum_{\tau : \text{triangle} } \mu^{(k)}( \tau ) \frac{\mathrm{Area}( \tau \cap B )}{\mathrm{Area}(\tau)}.
+\f]
 
 \subsection ICCAPI API
 
@@ -920,7 +961,7 @@ Similarly, we can use the following functions to compute curvatures on a specifi
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_one_vertex()`
 
-\subsection ICCResults Results
+\subsection ICCResults Results & Performance
 
 **To be updated**
 

From ef465063783b4646f5a90753f4b1f3375221134b Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 18 Apr 2023 16:46:40 +0100
Subject: [PATCH 0203/1398] Add cmake/modules files

---
 .../CGAL_Qt6_moc_and_resource_files.cmake     |  25 ++++
 .../CGAL_SetupCGAL_Qt6Dependencies.cmake      | 124 ++++++++++++++++++
 2 files changed, 149 insertions(+)
 create mode 100644 Installation/cmake/modules/CGAL_Qt6_moc_and_resource_files.cmake
 create mode 100644 Installation/cmake/modules/CGAL_SetupCGAL_Qt6Dependencies.cmake

diff --git a/Installation/cmake/modules/CGAL_Qt6_moc_and_resource_files.cmake b/Installation/cmake/modules/CGAL_Qt6_moc_and_resource_files.cmake
new file mode 100644
index 000000000000..21b32bc2e9e6
--- /dev/null
+++ b/Installation/cmake/modules/CGAL_Qt6_moc_and_resource_files.cmake
@@ -0,0 +1,25 @@
+if(CGAL_Qt6_moc_and_resource_files_included)
+  return()
+endif()
+set(CGAL_Qt6_moc_and_resource_files_included TRUE)
+# qrc files (resources files, that contain icons, at least)
+if(EXISTS ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/resources/CGAL.qrc)
+  qt5_add_resources (_CGAL_Qt6_RESOURCE_FILES_private
+    ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/resources/CGAL.qrc
+    ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/icons/Input.qrc
+    ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/icons/File.qrc
+    ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/icons/Triangulation_2.qrc)
+else()
+  # Installed version, in CMake resources
+  file ( COPY
+    ${CGAL_MODULES_DIR}/demo/resources
+    ${CGAL_MODULES_DIR}/demo/icons
+    DESTINATION ${CMAKE_BINARY_DIR})
+  qt5_add_resources (_CGAL_Qt6_RESOURCE_FILES_private
+    ${CMAKE_BINARY_DIR}/resources/CGAL.qrc
+    ${CMAKE_BINARY_DIR}/icons/Input.qrc
+    ${CMAKE_BINARY_DIR}/icons/File.qrc
+    ${CMAKE_BINARY_DIR}/icons/Triangulation_2.qrc)
+endif()
+
+qt5_wrap_ui(_CGAL_Qt6_UI_FILES ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/ImageInterface.ui)
diff --git a/Installation/cmake/modules/CGAL_SetupCGAL_Qt6Dependencies.cmake b/Installation/cmake/modules/CGAL_SetupCGAL_Qt6Dependencies.cmake
new file mode 100644
index 000000000000..161e9673345c
--- /dev/null
+++ b/Installation/cmake/modules/CGAL_SetupCGAL_Qt6Dependencies.cmake
@@ -0,0 +1,124 @@
+#.rst:
+# CGAL_SetupCGAL_Qt6Dependencies
+# ------------------------------
+#
+# The module searches for the dependencies of the `CGAL_Qt6` library:
+#   - the `Qt6` libraries
+#
+# by calling
+#
+# .. code-block:: cmake
+#
+#    find_package(Qt6 QUIET COMPONENTS OpenGL Svg)
+#
+# and defines the variable :variable:`CGAL_Qt6_FOUND` and the function
+# :command:`CGAL_setup_CGAL_Qt6_dependencies`.
+#
+
+if(CGAL_SetupCGAL_Qt6Dependencies_included)
+  return()
+endif()
+set(CGAL_SetupCGAL_Qt6Dependencies_included TRUE)
+
+#.rst:
+# Used Modules
+# ^^^^^^^^^^^^
+#   - :module:`Qt6Config`
+find_package(Qt6 QUIET COMPONENTS OpenGL Svg)
+
+set(CGAL_Qt6_MISSING_DEPS "")
+if(NOT Qt6OpenGL_FOUND)
+  set(CGAL_Qt6_MISSING_DEPS "Qt6OpenGL")
+endif()
+if(NOT Qt6Svg_FOUND)
+  set(CGAL_Qt6_MISSING_DEPS "${CGAL_Qt6_MISSING_DEPS} Qt6Svg")
+endif()
+if(NOT Qt6_FOUND)
+  set(CGAL_Qt6_MISSING_DEPS "${CGAL_Qt6_MISSING_DEPS} Qt6")
+endif()
+if(NOT EXISTS ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/GraphicsItem.h)
+  set(CGAL_Qt6_MISSING_DEPS "${CGAL_Qt6_MISSING_DEPS} <CGAL/Qt/*.h> headers")
+endif()
+
+#.rst:
+# Result Variables
+# ^^^^^^^^^^^^^^^^
+#
+# .. variable:: CGAL_Qt6_FOUND
+#
+#    Set to `TRUE` if the dependencies of `CGAL_Qt6` were found.
+#
+if(NOT CGAL_Qt6_MISSING_DEPS)
+  set(CGAL_Qt6_FOUND TRUE)
+  set_property(GLOBAL PROPERTY CGAL_Qt6_FOUND TRUE)
+
+  include(${CMAKE_CURRENT_LIST_DIR}/CGAL_Qt6_moc_and_resource_files.cmake)
+
+  if(NOT TARGET CGAL_Qt6_moc_and_resources)
+    add_library(CGAL_Qt6_moc_and_resources STATIC
+      ${_CGAL_Qt6_MOC_FILES_private}
+        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/GraphicsViewNavigation.h
+        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/DemosMainWindow.h
+        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/GraphicsItem.h
+        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/GraphicsViewInput.h
+        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/camera.h
+        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/frame.h
+        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/keyFrameInterpolator.h
+        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/manipulatedCameraFrame.h
+        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/manipulatedFrame.h
+        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/qglviewer.h
+        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/image_interface.h
+        ${_CGAL_Qt6_UI_FILES}
+      ${_CGAL_Qt6_RESOURCE_FILES_private})
+    target_include_directories( CGAL_Qt6_moc_and_resources PUBLIC ${CMAKE_CURRENT_BINARY_DIR})
+    set_target_properties(CGAL_Qt6_moc_and_resources PROPERTIES
+      POSITION_INDEPENDENT_CODE TRUE
+      EXCLUDE_FROM_ALL TRUE
+      AUTOMOC TRUE)
+    target_link_libraries(CGAL_Qt6_moc_and_resources CGAL::CGAL Qt6::Widgets Qt6::OpenGL Qt6::Svg )
+
+    add_library(CGAL::CGAL_Qt6_moc_and_resources ALIAS CGAL_Qt6_moc_and_resources)
+    add_library(CGAL::Qt6_moc_and_resources ALIAS CGAL_Qt6_moc_and_resources)
+  endif()
+
+endif()
+
+#get_property(QT_UIC_EXECUTABLE TARGET Qt6::uic PROPERTY LOCATION)
+#message( STATUS "Qt6Core include:     ${Qt6Core_INCLUDE_DIRS}" )
+#message( STATUS "Qt6 libraries:       ${Qt6Core_LIBRARIES} ${Qt6Gui_LIBRARIES} ${Qt6Svg_LIBRARIES} ${Qt6OpenGL_LIBRARIES}" )
+#message( STATUS "Qt6Core definitions: ${Qt6Core_DEFINITIONS}" )
+#message( STATUS "moc executable:      ${QT_MOC_EXECUTABLE}" )
+#message( STATUS "uic executable:      ${QT_UIC_EXECUTABLE}" )
+
+#.rst:
+#
+# Provided Functions
+# ^^^^^^^^^^^^^^^^^^
+#
+# .. command:: CGAL_setup_CGAL_Qt6_dependencies
+#
+#   Link the target with the dependencies of `CGAL_Qt6`::
+#
+#     CGAL_setup_CGAL_Qt6_dependencies( target )
+#
+#   The dependencies are
+#   added using :command:`target_link_libraries` with the ``INTERFACE``
+#   keyword.
+#
+function(CGAL_setup_CGAL_Qt6_dependencies target)
+
+  if($ENV{CGAL_FAKE_PUBLIC_RELEASE})
+    target_compile_definitions( ${target} INTERFACE CGAL_FAKE_PUBLIC_RELEASE=1 )
+  endif()
+  target_link_libraries( ${target} INTERFACE CGAL::CGAL)
+  target_link_libraries( ${target} INTERFACE CGAL::Qt6_moc_and_resources)
+  target_link_libraries( ${target} INTERFACE Qt6::OpenGL Qt6::Svg )
+
+  # Remove -Wdeprecated-copy, for g++ >= 9.0, because Qt6, as of
+  # version 5.12, has a lot of [-Wdeprecated-copy] warnings.
+  if( CMAKE_CXX_COMPILER_ID STREQUAL "GNU"
+      AND NOT CMAKE_CXX_COMPILER_VERSION VERSION_LESS "9" )
+    target_compile_options( ${target} INTERFACE "-Wno-deprecated-copy" "-Wno-cast-function-type" )
+  endif()
+
+endfunction()

From c6ce5fb1208bb48e173a5bd81116f28c13c10a4e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 19 Apr 2023 12:19:38 +0100
Subject: [PATCH 0204/1398] Switch to QT6 for the GraphicsView demos

---
 .../demo/Alpha_shapes_2/CMakeLists.txt        | 20 +++++------
 .../demo/Apollonius_graph_2/CMakeLists.txt    | 18 +++++-----
 .../demo/Bounding_volumes/CMakeLists.txt      | 18 +++++-----
 .../demo/Circular_kernel_2/CMakeLists.txt     | 18 +++++-----
 GraphicsView/demo/Generator/CMakeLists.txt    | 16 ++++-----
 GraphicsView/demo/GraphicsView/CMakeLists.txt | 12 +++----
 .../demo/L1_Voronoi_diagram_2/CMakeLists.txt  | 18 +++++-----
 .../demo/Largest_empty_rect_2/CMakeLists.txt  | 16 ++++-----
 .../Periodic_2_triangulation_2/CMakeLists.txt | 18 +++++-----
 GraphicsView/demo/Polygon/CMakeLists.txt      | 18 +++++-----
 .../Segment_Delaunay_graph_2/CMakeLists.txt   | 22 +++++-------
 .../CMakeLists.txt                            | 16 ++++-----
 .../demo/Snap_rounding_2/CMakeLists.txt       | 18 +++++-----
 .../demo/Spatial_searching_2/CMakeLists.txt   | 18 +++++-----
 .../demo/Stream_lines_2/CMakeLists.txt        | 20 +++++------
 .../demo/Triangulation_2/CMakeLists.txt       | 34 +++++++++---------
 .../include/CGAL/Qt/DemosMainWindow_impl.h    | 15 ++++----
 GraphicsView/include/CGAL/Qt/qglviewer.h      |  4 +--
 GraphicsView/include/CGAL/Qt/qglviewer_impl.h |  2 +-
 Installation/CMakeLists.txt                   | 36 +++++++++----------
 .../cmake/modules/CGALConfig_binary.cmake.in  | 24 ++++++-------
 .../cmake/modules/CGALConfig_install.cmake.in | 20 +++++------
 Installation/cmake/modules/CGAL_Macros.cmake  |  8 ++---
 .../CGAL_Qt6_moc_and_resource_files.cmake     |  6 ++--
 .../CGAL_SetupCGAL_Qt6Dependencies.cmake      | 17 +++++----
 .../cmake/modules/CGAL_add_test.cmake         | 34 +++++++++---------
 .../CGAL_setup_target_dependencies.cmake      |  4 +--
 Installation/lib/cmake/CGAL/CGALConfig.cmake  |  5 ++-
 28 files changed, 236 insertions(+), 239 deletions(-)

diff --git a/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt b/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt
index ca4a58c59589..771664f2a4b5 100644
--- a/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt
+++ b/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt
@@ -13,31 +13,31 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 include_directories(BEFORE ./include)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES Alpha_shapes_2.ui)
+  qt6_wrap_ui(DT_UI_FILES Alpha_shapes_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Alpha_shapes_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Alpha_shapes_2.qrc)
 
   # The executable itself.
   add_executable(
-    Alpha_shapes_2 Alpha_shapes_2.cpp ${DT_UI_FILES} ${CGAL_Qt5_RESOURCE_FILES}
-                   ${CGAL_Qt5_MOC_FILES})
+    Alpha_shapes_2 Alpha_shapes_2.cpp ${DT_UI_FILES} ${CGAL_Qt6_RESOURCE_FILES}
+                   ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Alpha_shapes_2)
 
-  target_link_libraries(Alpha_shapes_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                               Qt5::Gui)
+  target_link_libraries(Alpha_shapes_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                               Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Alpha_shapes_2)
@@ -45,5 +45,5 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Alpha_shapes_2)
 else()
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 endif()
diff --git a/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt b/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt
index ab0f43011f9a..27a13e4b21cb 100644
--- a/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt
+++ b/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt
@@ -13,32 +13,32 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
   #--------------------------------
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES Apollonius_graph_2.ui)
+  qt6_wrap_ui(DT_UI_FILES Apollonius_graph_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Apollonius_graph_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Apollonius_graph_2.qrc)
 
   # use the Qt MOC preprocessor on classes that derives from QObject
 
   # The executable itself.
   add_executable(
     Apollonius_graph_2 Apollonius_graph_2.cpp ${DT_UI_FILES}
-                       ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                       ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Apollonius_graph_2)
 
-  target_link_libraries(Apollonius_graph_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                                   Qt5::Gui)
+  target_link_libraries(Apollonius_graph_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                                   Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Apollonius_graph_2)
@@ -46,5 +46,5 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Apollonius_graph_2)
 else()
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 endif()
diff --git a/GraphicsView/demo/Bounding_volumes/CMakeLists.txt b/GraphicsView/demo/Bounding_volumes/CMakeLists.txt
index 69a30838cea5..3325c4379037 100644
--- a/GraphicsView/demo/Bounding_volumes/CMakeLists.txt
+++ b/GraphicsView/demo/Bounding_volumes/CMakeLists.txt
@@ -13,34 +13,34 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 include_directories(BEFORE ./include)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_AUTOMOC ON)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES Bounding_volumes.ui)
+  qt6_wrap_ui(DT_UI_FILES Bounding_volumes.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Bounding_volumes.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Bounding_volumes.qrc)
 
   # use the Qt MOC preprocessor on classes that derives from QObject
 
   # The executable itself.
   add_executable(
     Bounding_volumes Bounding_volumes.cpp ${DT_UI_FILES}
-                     ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                     ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Bounding_volumes)
 
-  target_link_libraries(Bounding_volumes PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                                 Qt5::Gui)
+  target_link_libraries(Bounding_volumes PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                                 Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Bounding_volumes)
@@ -50,6 +50,6 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
 
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/GraphicsView/demo/Circular_kernel_2/CMakeLists.txt b/GraphicsView/demo/Circular_kernel_2/CMakeLists.txt
index eb2e2b790116..129bcd076b86 100644
--- a/GraphicsView/demo/Circular_kernel_2/CMakeLists.txt
+++ b/GraphicsView/demo/Circular_kernel_2/CMakeLists.txt
@@ -13,32 +13,32 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES Circular_kernel_2.ui)
+  qt6_wrap_ui(DT_UI_FILES Circular_kernel_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Circular_kernel_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Circular_kernel_2.qrc)
 
   # use the Qt MOC preprocessor on classes that derives from QObject
 
   # The executable itself.
   add_executable(
     Circular_kernel_2 Circular_kernel_2.cpp ${DT_UI_FILES}
-                      ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                      ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Circular_kernel_2)
 
-  target_link_libraries(Circular_kernel_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                                  Qt5::Gui)
+  target_link_libraries(Circular_kernel_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                                  Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Circular_kernel_2)
@@ -48,6 +48,6 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
 
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/GraphicsView/demo/Generator/CMakeLists.txt b/GraphicsView/demo/Generator/CMakeLists.txt
index 3be28ec735dc..58346ad7753c 100644
--- a/GraphicsView/demo/Generator/CMakeLists.txt
+++ b/GraphicsView/demo/Generator/CMakeLists.txt
@@ -12,36 +12,36 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES Generator_2.ui)
+  qt6_wrap_ui(DT_UI_FILES Generator_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Generator_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Generator_2.qrc)
 
   # use the Qt MOC preprocessor on classes that derives from QObject
 
   # The executable itself.
   add_executable(Generator_2 Generator_2.cpp ${DT_UI_FILES}
-                             ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                             ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Generator_2)
 
-  target_link_libraries(Generator_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5 Qt5::Gui)
+  target_link_libraries(Generator_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Generator_2)
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/GraphicsView/demo/GraphicsView/CMakeLists.txt b/GraphicsView/demo/GraphicsView/CMakeLists.txt
index 51617b00b874..4b3940bf0fa0 100644
--- a/GraphicsView/demo/GraphicsView/CMakeLists.txt
+++ b/GraphicsView/demo/GraphicsView/CMakeLists.txt
@@ -12,25 +12,25 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets Svg)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
-  add_executable(min min.cpp ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+  add_executable(min min.cpp ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS min)
 
-  target_link_libraries(min PRIVATE CGAL::CGAL CGAL::CGAL_Qt5 Qt5::Gui)
+  target_link_libraries(min PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(min)
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/GraphicsView/demo/L1_Voronoi_diagram_2/CMakeLists.txt b/GraphicsView/demo/L1_Voronoi_diagram_2/CMakeLists.txt
index 432cb655369e..b5e8e231bde5 100644
--- a/GraphicsView/demo/L1_Voronoi_diagram_2/CMakeLists.txt
+++ b/GraphicsView/demo/L1_Voronoi_diagram_2/CMakeLists.txt
@@ -13,32 +13,32 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 include_directories(BEFORE ./include)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES L1_voronoi_diagram_2.ui)
+  qt6_wrap_ui(DT_UI_FILES L1_voronoi_diagram_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./L1_voronoi_diagram_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./L1_voronoi_diagram_2.qrc)
 
   # The executable itself.
   add_executable(
     L1_voronoi_diagram_2 L1_voronoi_diagram_2.cpp ${DT_UI_FILES}
-                         ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                         ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS L1_voronoi_diagram_2)
 
-  target_link_libraries(L1_voronoi_diagram_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                                     Qt5::Gui)
+  target_link_libraries(L1_voronoi_diagram_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                                     Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(L1_voronoi_diagram_2)
@@ -48,6 +48,6 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
 
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/GraphicsView/demo/Largest_empty_rect_2/CMakeLists.txt b/GraphicsView/demo/Largest_empty_rect_2/CMakeLists.txt
index a6de2468c40b..7c83ab38c01c 100644
--- a/GraphicsView/demo/Largest_empty_rect_2/CMakeLists.txt
+++ b/GraphicsView/demo/Largest_empty_rect_2/CMakeLists.txt
@@ -13,36 +13,36 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES Largest_empty_rectangle_2.ui)
+  qt6_wrap_ui(DT_UI_FILES Largest_empty_rectangle_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Largest_empty_rectangle_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Largest_empty_rectangle_2.qrc)
 
   # The executable itself.
   add_executable(
     Largest_empty_rectangle_2 Largest_empty_rectangle_2.cpp ${DT_UI_FILES}
-                              ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                              ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Largest_empty_rectangle_2)
 
   target_link_libraries(Largest_empty_rectangle_2
-                        PRIVATE CGAL::CGAL CGAL::CGAL_Qt5 Qt5::Gui)
+                        PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Largest_empty_rectangle_2)
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/GraphicsView/demo/Periodic_2_triangulation_2/CMakeLists.txt b/GraphicsView/demo/Periodic_2_triangulation_2/CMakeLists.txt
index 2f964941bb01..0cae7c979012 100644
--- a/GraphicsView/demo/Periodic_2_triangulation_2/CMakeLists.txt
+++ b/GraphicsView/demo/Periodic_2_triangulation_2/CMakeLists.txt
@@ -10,22 +10,22 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 include_directories(BEFORE ./include)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES Periodic_2_triangulation_2.ui)
+  qt6_wrap_ui(DT_UI_FILES Periodic_2_triangulation_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Periodic_2_triangulation_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Periodic_2_triangulation_2.qrc)
 
   # find header files for projects that can show them
   file(GLOB headers "*.h")
@@ -39,8 +39,8 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
     Periodic_2_Delaunay_triangulation_2
     Periodic_2_Delaunay_triangulation_2.cpp
     ${DT_UI_FILES}
-    ${CGAL_Qt5_RESOURCE_FILES}
-    ${CGAL_Qt5_MOC_FILES}
+    ${CGAL_Qt6_RESOURCE_FILES}
+    ${CGAL_Qt6_MOC_FILES}
     ${headers}
     ${QT_headers}
     ${P2T2_headers})
@@ -49,12 +49,12 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
                      Periodic_2_Delaunay_triangulation_2)
 
   target_link_libraries(Periodic_2_Delaunay_triangulation_2
-                        PRIVATE CGAL::CGAL CGAL::CGAL_Qt5 Qt5::Gui)
+                        PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Periodic_2_Delaunay_triangulation_2)
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/GraphicsView/demo/Polygon/CMakeLists.txt b/GraphicsView/demo/Polygon/CMakeLists.txt
index 8314d618d2ff..fb753dccefe5 100644
--- a/GraphicsView/demo/Polygon/CMakeLists.txt
+++ b/GraphicsView/demo/Polygon/CMakeLists.txt
@@ -13,7 +13,7 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5 Core)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6 Core)
 
 find_package(Eigen3 3.1.0 QUIET) #(requires 3.1.0 or greater)
 include(CGAL_Eigen3_support)
@@ -22,9 +22,9 @@ if(NOT TARGET CGAL::Eigen3_support)
   return()
 endif()
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   include(${CGAL_USE_FILE})
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_AUTOMOC ON)
@@ -34,25 +34,25 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   endif()
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES Polygon_2.ui)
+  qt6_wrap_ui(DT_UI_FILES Polygon_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Polygon_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Polygon_2.qrc)
 
   #  add_library( CGAL SHARED IMPORTED )
   #  SET_PROPERTY(TARGET CGAL PROPERTY IMPORTED_LOCATION ${CGAL_LIBRARY} )
 
   # The executable itself.
   add_executable(Polygon_2 Polygon_2.cpp ${DT_UI_FILES} ${DT_RESOURCE_FILES}
-                           ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                           ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Polygon_2)
 
-  target_link_libraries(Polygon_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                          CGAL::Eigen3_support Qt5::Gui)
+  target_link_libraries(Polygon_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                          CGAL::Eigen3_support Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Polygon_2)
 else()
-  message("NOTICE: This demo requires CGAL, CGAL_Core, and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL, CGAL_Core, and Qt6, and will not be compiled.")
 endif()
diff --git a/GraphicsView/demo/Segment_Delaunay_graph_2/CMakeLists.txt b/GraphicsView/demo/Segment_Delaunay_graph_2/CMakeLists.txt
index 745fbb09ed0a..653619eb3201 100644
--- a/GraphicsView/demo/Segment_Delaunay_graph_2/CMakeLists.txt
+++ b/GraphicsView/demo/Segment_Delaunay_graph_2/CMakeLists.txt
@@ -13,40 +13,36 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5 Core)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6 Core)
 
-set(QT_USE_QTXML TRUE)
-set(QT_USE_QTMAIN TRUE)
-set(QT_USE_QTSCRIPT TRUE)
-set(QT_USE_QTOPENGL TRUE)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 include_directories(BEFORE ./include)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   set(CMAKE_AUTOMOC ON)
 
   include(${CGAL_USE_FILE})
   add_definitions(-DQT_NO_KEYWORDS)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(CDT_UI_FILES Segment_voronoi_2.ui)
+  qt6_wrap_ui(CDT_UI_FILES Segment_voronoi_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Segment_voronoi_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Segment_voronoi_2.qrc)
 
   # The executable itself.
   add_executable(
     Segment_voronoi_2 Segment_voronoi_2.cpp ${CDT_UI_FILES}
-                      ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                      ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Segment_voronoi_2)
 
-  target_link_libraries(Segment_voronoi_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                                  Qt5::Gui)
+  target_link_libraries(Segment_voronoi_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                                  Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Segment_voronoi_2)
 else()
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 endif()
diff --git a/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt b/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt
index f1d5e4fbbd41..25cc1e2f3b6f 100644
--- a/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt
+++ b/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt
@@ -13,39 +13,39 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5 Core)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6 Core)
 
 set(QT_USE_QTXML TRUE)
 set(QT_USE_QTMAIN TRUE)
 set(QT_USE_QTSCRIPT TRUE)
 set(QT_USE_QTOPENGL TRUE)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 include_directories(BEFORE ./include)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   set(CMAKE_AUTOMOC ON)
   include(${CGAL_USE_FILE})
   add_definitions(-DQT_NO_KEYWORDS)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(CDT_UI_FILES Segment_voronoi_2.ui)
+  qt6_wrap_ui(CDT_UI_FILES Segment_voronoi_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Segment_voronoi_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Segment_voronoi_2.qrc)
 
   # The executable itself.
   add_executable(
     Segment_voronoi_linf_2 Segment_voronoi_linf_2.cpp ${CDT_UI_FILES}
-                           ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                           ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Segment_voronoi_linf_2)
 
   target_link_libraries(Segment_voronoi_linf_2 PRIVATE CGAL::CGAL
-                                                       CGAL::CGAL_Qt5 Qt5::Gui)
+                                                       CGAL::CGAL_Qt6 Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Segment_voronoi_linf_2)
 else()
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 endif()
diff --git a/GraphicsView/demo/Snap_rounding_2/CMakeLists.txt b/GraphicsView/demo/Snap_rounding_2/CMakeLists.txt
index 0b7ebdeb6d86..aaffe63198b9 100644
--- a/GraphicsView/demo/Snap_rounding_2/CMakeLists.txt
+++ b/GraphicsView/demo/Snap_rounding_2/CMakeLists.txt
@@ -13,30 +13,30 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   set(CMAKE_AUTOMOC ON)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES Snap_rounding_2.ui)
+  qt6_wrap_ui(DT_UI_FILES Snap_rounding_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Snap_rounding_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Snap_rounding_2.qrc)
 
   # The executable itself.
   add_executable(
     Snap_rounding_2 Snap_rounding_2.cpp ${DT_UI_FILES}
-                    ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                    ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Snap_rounding_2)
 
-  target_link_libraries(Snap_rounding_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                                Qt5::Gui)
+  target_link_libraries(Snap_rounding_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                                Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Snap_rounding_2)
@@ -44,5 +44,5 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Snap_rounding_2)
 else()
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6<, and will not be compiled.")
 endif()
diff --git a/GraphicsView/demo/Spatial_searching_2/CMakeLists.txt b/GraphicsView/demo/Spatial_searching_2/CMakeLists.txt
index f5d5aad6d142..6615bea349df 100644
--- a/GraphicsView/demo/Spatial_searching_2/CMakeLists.txt
+++ b/GraphicsView/demo/Spatial_searching_2/CMakeLists.txt
@@ -13,36 +13,36 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES Spatial_searching_2.ui)
+  qt6_wrap_ui(DT_UI_FILES Spatial_searching_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Spatial_searching_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Spatial_searching_2.qrc)
 
   # The executable itself.
   add_executable(
     Spatial_searching_2 Spatial_searching_2.cpp ${DT_UI_FILES}
-                        ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                        ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Spatial_searching_2)
 
-  target_link_libraries(Spatial_searching_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                                    Qt5::Gui)
+  target_link_libraries(Spatial_searching_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                                    Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Spatial_searching_2)
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/GraphicsView/demo/Stream_lines_2/CMakeLists.txt b/GraphicsView/demo/Stream_lines_2/CMakeLists.txt
index 0067351b4e14..19f88273a048 100644
--- a/GraphicsView/demo/Stream_lines_2/CMakeLists.txt
+++ b/GraphicsView/demo/Stream_lines_2/CMakeLists.txt
@@ -13,31 +13,31 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(DT_UI_FILES Stream_lines_2.ui)
+  qt6_wrap_ui(DT_UI_FILES Stream_lines_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Stream_lines_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Stream_lines_2.qrc)
 
   # The executable itself.
   add_executable(
-    Stream_lines_2 Stream_lines_2.cpp ${DT_UI_FILES} ${CGAL_Qt5_RESOURCE_FILES}
-                   ${CGAL_Qt5_MOC_FILES})
+    Stream_lines_2 Stream_lines_2.cpp ${DT_UI_FILES} ${CGAL_Qt6_RESOURCE_FILES}
+                   ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Stream_lines_2)
 
-  target_link_libraries(Stream_lines_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                               Qt5::Gui)
+  target_link_libraries(Stream_lines_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                               Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Stream_lines_2)
@@ -47,6 +47,6 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
 
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/GraphicsView/demo/Triangulation_2/CMakeLists.txt b/GraphicsView/demo/Triangulation_2/CMakeLists.txt
index 4560bc339dcb..6ee55850f86d 100644
--- a/GraphicsView/demo/Triangulation_2/CMakeLists.txt
+++ b/GraphicsView/demo/Triangulation_2/CMakeLists.txt
@@ -16,11 +16,11 @@ endif()
 set(CMAKE_AUTOMOC TRUE)
 set(CMAKE_INCLUDE_CURRENT_DIR TRUE)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
-find_package(Qt5 QUIET COMPONENTS Widgets)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
-if(NOT CGAL_Qt5_FOUND OR NOT Qt5_FOUND)
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+if(NOT CGAL_Qt6_FOUND OR NOT Qt6_FOUND)
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
   return()
 endif()
 
@@ -31,15 +31,15 @@ set(CMAKE_INCLUDE_CURRENT_DIR ON)
 # The "constrained Delaunay" demo: Constrained_Delaunay_triangulation_2
 #--------------------------------
 
-qt5_add_resources(CD_RES_FILE Constrained_Delaunay_triangulation_2.qrc)
-qt5_wrap_ui(CD_UI_FILES Constrained_Delaunay_triangulation_2.ui)
+qt6_add_resources(CD_RES_FILE Constrained_Delaunay_triangulation_2.qrc)
+qt6_wrap_ui(CD_UI_FILES Constrained_Delaunay_triangulation_2.ui)
 # The executable itself.
 add_executable(
   Constrained_Delaunay_triangulation_2
   Constrained_Delaunay_triangulation_2.cpp ${CD_UI_FILES}
-  ${CGAL_Qt5_RESOURCE_FILES} ${CD_RES_FILE})
+  ${CGAL_Qt6_RESOURCE_FILES} ${CD_RES_FILE})
 target_link_libraries(Constrained_Delaunay_triangulation_2
-                      PRIVATE CGAL::CGAL CGAL::CGAL_Qt5 Qt5::Widgets)
+                      PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
 target_include_directories(Constrained_Delaunay_triangulation_2
                            PRIVATE ./include)
 
@@ -48,14 +48,14 @@ add_to_cached_list(CGAL_EXECUTABLE_TARGETS Constrained_Delaunay_triangulation_2)
 #--------------------------------
 # The "Delaunay" demo: Delaunay_triangulation_2
 #--------------------------------
-qt5_wrap_ui(D_UI_FILES Delaunay_triangulation_2.ui)
-qt5_add_resources(D_RES_FILE Delaunay_triangulation_2.qrc)
+qt6_wrap_ui(D_UI_FILES Delaunay_triangulation_2.ui)
+qt6_add_resources(D_RES_FILE Delaunay_triangulation_2.qrc)
 # The executable itself.
 add_executable(
   Delaunay_triangulation_2 Delaunay_triangulation_2.cpp ${D_UI_FILES}
-                           ${CGAL_Qt5_RESOURCE_FILES} ${D_RES_FILE})
+                           ${CGAL_Qt6_RESOURCE_FILES} ${D_RES_FILE})
 target_link_libraries(Delaunay_triangulation_2
-                      PRIVATE CGAL::CGAL CGAL::CGAL_Qt5 Qt5::Widgets)
+                      PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
 
 add_to_cached_list(CGAL_EXECUTABLE_TARGETS Delaunay_triangulation_2)
 
@@ -64,13 +64,13 @@ add_to_cached_list(CGAL_EXECUTABLE_TARGETS Delaunay_triangulation_2)
 #--------------------------------
 
 # The executable itself.
-qt5_add_resources(R_RES_FILE Regular_triangulation_2.qrc)
-qt5_wrap_ui(R_UI_FILES Regular_triangulation_2.ui)
+qt6_add_resources(R_RES_FILE Regular_triangulation_2.qrc)
+qt6_wrap_ui(R_UI_FILES Regular_triangulation_2.ui)
 add_executable(
   Regular_triangulation_2 Regular_triangulation_2.cpp ${R_UI_FILES}
-                          ${CGAL_Qt5_RESOURCE_FILES} ${R_RES_FILE})
-target_link_libraries(Regular_triangulation_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                                      Qt5::Widgets)
+                          ${CGAL_Qt6_RESOURCE_FILES} ${R_RES_FILE})
+target_link_libraries(Regular_triangulation_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                                      Qt6::Widgets)
 
 add_to_cached_list(CGAL_EXECUTABLE_TARGETS Regular_triangulation_2)
 
diff --git a/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h b/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h
index 009b142b963b..31458a45eca2 100644
--- a/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h
+++ b/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h
@@ -32,12 +32,11 @@
 #include <QMessageBox>
 #include <QStatusBar>
 #include <QGraphicsView>
-#include <QGLWidget>
+#include <QOpenGLWidget>
 #include <QTextStream>
 #include <QSettings>
 #include <QUrl>
-#include <QDesktopWidget>
-#include <QRegExp>
+#include <QRegularExpression>
 #include <QSvgGenerator>
 #include <QtCore>
 #include <QtOpenGL>
@@ -205,16 +204,16 @@ void
 DemosMainWindow::setUseOpenGL(bool checked)
 {
   if(checked) {
-    QGLWidget* new_viewport = new QGLWidget;
+    // AF QOpenGLWidget* new_viewport = new QOpenGLWidget;
 
     // Setup the format to allow antialiasing with OpenGL:
     // one need to activate the SampleBuffers, if the graphic driver allows
     // this.
-    QGLFormat glformat = new_viewport->format();
-    glformat.setOption(QGL::SampleBuffers);
-    new_viewport->setFormat(glformat);
+    // AF QGLFormat glformat = new_viewport->format();
+    // AF glformat.setOption(QGL::SampleBuffers);
+    // AF new_viewport->setFormat(glformat);
 
-    view->setViewport(new_viewport);
+    // AF view->setViewport(new_viewport);
   }
   else {
     view->setViewport(new QWidget);
diff --git a/GraphicsView/include/CGAL/Qt/qglviewer.h b/GraphicsView/include/CGAL/Qt/qglviewer.h
index 16fd9b123eb5..89885041c58a 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer.h
@@ -30,7 +30,6 @@
 #include <QVector>
 #include <QElapsedTimer>
 #include <QTimer>
-#include <QGLContext>
 #include <QOpenGLWidget>
 #include <QMouseEvent>
 
@@ -72,8 +71,7 @@ class CGAL_QT_EXPORT QGLViewer : public QOpenGLWidget, public QOpenGLFunctions {
 
 public:
   //todo check if this is used. If not remove it
-  explicit QGLViewer(QGLContext* context, QWidget *parent = nullptr,
-                     ::Qt::WindowFlags flags = ::Qt::WindowType(0));
+
   explicit QGLViewer(QOpenGLContext* context, QWidget *parent = nullptr,
                      ::Qt::WindowFlags flags = ::Qt::WindowType(0));
   explicit QGLViewer(QWidget *parent = nullptr,
diff --git a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
index 0950301c127e..d54e88f8aba7 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
@@ -31,7 +31,7 @@
 #include <QDateTime>
 #include <QDir>
 #include <QFileInfo>
-#include <QGLContext>
+#include <QOpenGLContext>
 #include <QImage>
 #include <QMessageBox>
 #include <QMouseEvent>
diff --git a/Installation/CMakeLists.txt b/Installation/CMakeLists.txt
index 0a521d9dd2c2..e4372214daeb 100644
--- a/Installation/CMakeLists.txt
+++ b/Installation/CMakeLists.txt
@@ -500,7 +500,7 @@ macro(set_special_prefix library prefix)
   set(CGAL_EXT_LIB_${library}_PREFIX ${prefix})
 endmacro()
 
-set_special_prefix(Qt5 QT)
+set_special_prefix(Qt6 QT)
 set_special_prefix(Eigen3 EIGEN3)
 set_special_prefix(Coin3D COIN3D)
 
@@ -647,10 +647,10 @@ cache_get(CGAL_3RD_PARTY_INCLUDE_DIRS  )
 cache_get(CGAL_3RD_PARTY_LIBRARIES     )
 cache_get(CGAL_3RD_PARTY_LIBRARIES_DIRS)
 
-install(DIRECTORY "${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/" DESTINATION "${CGAL_INSTALL_INC_DIR}/CGAL/Qt" COMPONENT CGAL_Qt5)
+install(DIRECTORY "${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/" DESTINATION "${CGAL_INSTALL_INC_DIR}/CGAL/Qt" COMPONENT CGAL_Qt6)
 if(CGAL_BRANCH_BUILD)
-  install(DIRECTORY "${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/resources/" DESTINATION "${CGAL_INSTALL_CMAKE_DIR}/demo/resources" COMPONENT CGAL_Qt5)
-  install(DIRECTORY "${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/icons/" DESTINATION "${CGAL_INSTALL_CMAKE_DIR}/demo/icons" COMPONENT CGAL_Qt5)
+  install(DIRECTORY "${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/resources/" DESTINATION "${CGAL_INSTALL_CMAKE_DIR}/demo/resources" COMPONENT CGAL_Qt6)
+  install(DIRECTORY "${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/icons/" DESTINATION "${CGAL_INSTALL_CMAKE_DIR}/demo/icons" COMPONENT CGAL_Qt6)
 endif()
 
 #
@@ -660,7 +660,7 @@ set(CGAL_USE_FILE ${CGAL_MODULES_DIR}/UseCGAL.cmake)
 get_property(CGAL_FOUND GLOBAL PROPERTY CGAL_FOUND)
 get_property(CGAL_Core_FOUND GLOBAL PROPERTY CGAL_Core_FOUND)
 get_property(CGAL_ImageIO_FOUND GLOBAL PROPERTY CGAL_ImageIO_FOUND)
-get_property(CGAL_Qt5_FOUND GLOBAL PROPERTY CGAL_Qt5_FOUND)
+get_property(CGAL_Qt6_FOUND GLOBAL PROPERTY CGAL_Qt6_FOUND)
 
 #
 # Repeat some problems
@@ -928,7 +928,7 @@ if(CGAL_BRANCH_BUILD)
     find_package(GMP REQUIRED)
     find_package(Doxygen REQUIRED)
     find_package(Eigen3 REQUIRED)
-    find_package(Qt5 COMPONENTS Core Widgets OpenGL Gui REQUIRED)
+    find_package(Qt6 COMPONENTS Core Widgets OpenGL Gui REQUIRED)
     find_package(VTK COMPONENTS vtkImagingGeneral vtkIOImage NO_MODULE)
     find_package(IPE)
     find_package(RS3)
@@ -939,10 +939,10 @@ if(CGAL_BRANCH_BUILD)
     set(compile_options
         "\
 ${CMAKE_CXX_FLAGS} -DCGAL_EIGEN3_ENABLED -DCGAL_PROFILE \
-${Qt5Widgets_DEFINITIONS} ${Qt5OpenGL_DEFINITIONS} ${Qt5Gui_DEFINITIONS} \
-${Qt5OpenGL_EXECUTABLE_COMPILE_FLAGS} -fPIC \
-${Qt5Gui_EXECUTABLE_COMPILE_FLAGS} \
-${CGAL_3RD_PARTY_DEFINITIONS} ${CGAL_Qt5_3RD_PARTY_DEFINITIONS} \
+${Qt6Widgets_DEFINITIONS} ${Qt6OpenGL_DEFINITIONS} ${Qt6Gui_DEFINITIONS} \
+${Qt6OpenGL_EXECUTABLE_COMPILE_FLAGS} -fPIC \
+${Qt6Gui_EXECUTABLE_COMPILE_FLAGS} \
+${CGAL_3RD_PARTY_DEFINITIONS} ${CGAL_Qt6_3RD_PARTY_DEFINITIONS} \
 ${CGAL_DEFINITIONS}")
     message("COMPILATION OPTIONS ARE :  ${compile_options}")
 
@@ -1032,11 +1032,11 @@ You must disable CGAL_ENABLE_CHECK_HEADERS.")
       ${RS_INCLUDE_DIR}
       ${EIGEN3_INCLUDE_DIR}
       ${GMP_INCLUDE_DIR}
-      ${Qt5OpenGL_INCLUDE_DIRS}
-      ${Qt5Widgets_INCLUDE_DIRS}
-      ${Qt5Gui_DEFINITIONS}
+      ${Qt6OpenGL_INCLUDE_DIRS}
+      ${Qt6Widgets_INCLUDE_DIRS}
+      ${Qt6Gui_DEFINITIONS}
       ${CGAL_3RD_PARTY_INCLUDE_DIRS}
-      ${CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS})
+      ${CGAL_Qt6_3RD_PARTY_INCLUDE_DIRS})
       list(APPEND include_options "-I${incdir}")
     endforeach()
     include_directories(SYSTEM ${CGAL_3RD_PARTY_INCLUDE_DIRS})
@@ -1234,7 +1234,7 @@ endif()
 
 #print some info about versions
 if(RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE)
-  find_package(Qt5 QUIET COMPONENTS Core)
+  find_package(Qt6 QUIET COMPONENTS Core)
   find_package(Boost)
   if(NOT CGAL_DISABLE_GMP)
     find_package(GMP)
@@ -1248,7 +1248,7 @@ if(RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE)
     STATUS
     "USING BOOST_VERSION = '${Boost_MAJOR_VERSION}.${Boost_MINOR_VERSION}.${Boost_SUBMINOR_VERSION}'"
     )
-  if(Qt5_FOUND)
-    message(STATUS "USING Qt5_VERSION = '${Qt5Core_VERSION_STRING}'")
-  endif()#Qt5_FOUND
+  if(Qt6_FOUND)
+    message(STATUS "USING Qt6_VERSION = '${Qt6Core_VERSION_STRING}'")
+  endif()#Qt6_FOUND
 endif()#RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE
diff --git a/Installation/cmake/modules/CGALConfig_binary.cmake.in b/Installation/cmake/modules/CGALConfig_binary.cmake.in
index b15db42aa7e8..7987a2bbd1f3 100644
--- a/Installation/cmake/modules/CGALConfig_binary.cmake.in
+++ b/Installation/cmake/modules/CGALConfig_binary.cmake.in
@@ -36,7 +36,7 @@ else()
   CGAL_alias_library(CGAL)
   CGAL_alias_library(CGAL_Core)
   CGAL_alias_library(CGAL_ImageIO)
-  CGAL_alias_library(CGAL_Qt5)
+  CGAL_alias_library(CGAL_Qt6)
 endif()
 
 macro(CGAL_set_LIB_LIBRARY_var lib)
@@ -50,7 +50,7 @@ endmacro()
 CGAL_set_LIB_LIBRARY_var(CGAL)
 CGAL_set_LIB_LIBRARY_var(CGAL_Core)
 CGAL_set_LIB_LIBRARY_var(CGAL_ImageIO)
-CGAL_set_LIB_LIBRARY_var(CGAL_Qt5)
+CGAL_set_LIB_LIBRARY_var(CGAL_Qt6)
 
 set(CGAL_CONFIGURED_LIBRARIES "@CGAL_ACTUAL_CONFIGURED_LIBRARIES@")
 
@@ -120,15 +120,15 @@ macro(check_cgal_component COMPONENT)
   else( "${CGAL_LIB}" STREQUAL "CGAL" )
     if ( WITH_${CGAL_LIB} )
       if(TARGET CGAL::${CGAL_LIB})
-        if ("${CGAL_LIB}" STREQUAL "CGAL_Qt5")
-          
-          include("${CGAL_MODULES_DIR}/CGAL_SetupCGAL_Qt5Dependencies.cmake")
+        if ("${CGAL_LIB}" STREQUAL "CGAL_Qt6")
 
-          if(CGAL_Qt5_MISSING_DEPS)
-            set( CGAL_Qt5_FOUND FALSE )
-            message(STATUS "libCGAL_Qt5 is missing the dependencies: ${CGAL_Qt5_MISSING_DEPS} cannot be configured.")
+          include("${CGAL_MODULES_DIR}/CGAL_SetupCGAL_Qt6Dependencies.cmake")
+
+          if(CGAL_Qt6_MISSING_DEPS)
+            set( CGAL_Qt6_FOUND FALSE )
+            message(STATUS "libCGAL_Qt6 is missing the dependencies: ${CGAL_Qt6_MISSING_DEPS} cannot be configured.")
           else()
-            set( CGAL_Qt5_FOUND TRUE )
+            set( CGAL_Qt6_FOUND TRUE )
           endif()
         elseif("${CGAL_LIB}" STREQUAL "CGAL_Core")
           include("${CGAL_MODULES_DIR}/CGAL_SetupCGAL_CoreDependencies.cmake")
@@ -138,10 +138,10 @@ macro(check_cgal_component COMPONENT)
           else()
             set( CGAL_Core_FOUND TRUE )
           endif()
-        else("${CGAL_LIB}" STREQUAL "CGAL_Qt5")
+        else("${CGAL_LIB}" STREQUAL "CGAL_Qt6")
           # Libraries that have no dependencies
           set( ${CGAL_LIB}_FOUND TRUE )
-        endif("${CGAL_LIB}" STREQUAL "CGAL_Qt5")
+        endif("${CGAL_LIB}" STREQUAL "CGAL_Qt6")
       else(TARGET CGAL::${CGAL_LIB})
         set( ${CGAL_LIB}_FOUND FALSE )
         set( CHECK_${CGAL_LIB}_ERROR_TAIL " CGAL was configured with WITH_${CGAL_LIB}=ON, but one of the dependencies of ${CGAL_LIB} was not configured properly." )
@@ -214,7 +214,7 @@ if (NOT TARGET CGAL::CGAL_Basic_viewer)
   add_library(CGAL::CGAL_Basic_viewer INTERFACE IMPORTED GLOBAL)
     set_target_properties(CGAL::CGAL_Basic_viewer PROPERTIES
       INTERFACE_COMPILE_DEFINITIONS "CGAL_USE_BASIC_VIEWER;QT_NO_KEYWORDS"
-      INTERFACE_LINK_LIBRARIES CGAL::CGAL_Qt5)
+      INTERFACE_LINK_LIBRARIES CGAL::CGAL_Qt6)
 endif()
 
 include("${CGAL_MODULES_DIR}/CGAL_enable_end_of_configuration_hook.cmake")
diff --git a/Installation/cmake/modules/CGALConfig_install.cmake.in b/Installation/cmake/modules/CGALConfig_install.cmake.in
index 00db762aa76d..9ee7c0ba8803 100644
--- a/Installation/cmake/modules/CGALConfig_install.cmake.in
+++ b/Installation/cmake/modules/CGALConfig_install.cmake.in
@@ -104,15 +104,15 @@ macro(check_cgal_component COMPONENT)
 
     if ( WITH_${CGAL_LIB} )
       if(TARGET CGAL::${CGAL_LIB})
-        if ("${CGAL_LIB}" STREQUAL "CGAL_Qt5")
-          
-          include("${CGAL_MODULES_DIR}/CGAL_SetupCGAL_Qt5Dependencies.cmake")
+        if ("${CGAL_LIB}" STREQUAL "CGAL_Qt6")
 
-          if(CGAL_Qt5_MISSING_DEPS)
-            set( CGAL_Qt5_FOUND FALSE )
-            message(STATUS "libCGAL_Qt5 is missing the dependencies: ${CGAL_Qt5_MISSING_DEPS} cannot be configured.")
+          include("${CGAL_MODULES_DIR}/CGAL_SetupCGAL_Qt6Dependencies.cmake")
+
+          if(CGAL_Qt6_MISSING_DEPS)
+            set( CGAL_Qt6_FOUND FALSE )
+            message(STATUS "libCGAL_Qt6 is missing the dependencies: ${CGAL_Qt6_MISSING_DEPS} cannot be configured.")
           else()
-            set( CGAL_Qt5_FOUND TRUE )
+            set( CGAL_Qt6_FOUND TRUE )
           endif()
         elseif("${CGAL_LIB}" STREQUAL "CGAL_Core")
           include("${CGAL_MODULES_DIR}/CGAL_SetupCGAL_CoreDependencies.cmake")
@@ -122,10 +122,10 @@ macro(check_cgal_component COMPONENT)
           else()
             set( CGAL_Core_FOUND TRUE )
           endif()
-        else("${CGAL_LIB}" STREQUAL "CGAL_Qt5")
+        else("${CGAL_LIB}" STREQUAL "CGAL_Qt6")
           # Libraries that have no dependencies
           set( ${CGAL_LIB}_FOUND TRUE )
-        endif("${CGAL_LIB}" STREQUAL "CGAL_Qt5")
+        endif("${CGAL_LIB}" STREQUAL "CGAL_Qt6")
       else(TARGET CGAL::${CGAL_LIB})
         set( ${CGAL_LIB}_FOUND FALSE )
         set( CHECK_${CGAL_LIB}_ERROR_TAIL " CGAL was configured with WITH_${CGAL_LIB}=ON, but one of the dependencies of ${CGAL_LIB} was not configured properly." )
@@ -198,7 +198,7 @@ if (NOT TARGET CGAL::CGAL_Basic_viewer)
   add_library(CGAL::CGAL_Basic_viewer INTERFACE IMPORTED GLOBAL)
     set_target_properties(CGAL::CGAL_Basic_viewer PROPERTIES
       INTERFACE_COMPILE_DEFINITIONS "CGAL_USE_BASIC_VIEWER;QT_NO_KEYWORDS"
-      INTERFACE_LINK_LIBRARIES CGAL::CGAL_Qt5)
+      INTERFACE_LINK_LIBRARIES CGAL::CGAL_Qt6)
 endif()
 
 include("${CGAL_MODULES_DIR}/CGAL_enable_end_of_configuration_hook.cmake")
diff --git a/Installation/cmake/modules/CGAL_Macros.cmake b/Installation/cmake/modules/CGAL_Macros.cmake
index 8ca618abcd46..2cc35fdc572e 100644
--- a/Installation/cmake/modules/CGAL_Macros.cmake
+++ b/Installation/cmake/modules/CGAL_Macros.cmake
@@ -229,7 +229,7 @@ if( NOT CGAL_MACROS_FILE_INCLUDED )
           message (STATUS "Configured ${lib} from UseLIB-file: ${usefile}")
 
           # UseLIB-file has to set ${vlib}_SETUP to TRUE
-          # TODO EBEB what about Qt5, zlib?
+          # TODO EBEB what about Qt6, zlib?
 
         else()
 
@@ -288,11 +288,11 @@ if( NOT CGAL_MACROS_FILE_INCLUDED )
       add_to_list( CGAL_3RD_PARTY_DEFINITIONS    ${CGAL_${component}_3RD_PARTY_DEFINITIONS}    )
       add_to_list( CGAL_3RD_PARTY_LIBRARIES_DIRS ${CGAL_${component}_3RD_PARTY_LIBRARIES_DIRS} )
 
-      # To deal with imported targets of Qt5 and Boost, when CGAL
+      # To deal with imported targets of Qt6 and Boost, when CGAL
       # targets are themselves imported by another project.
 
-      if (${component} STREQUAL "Qt5")
-        find_package(Qt5 COMPONENTS OpenGL Gui Core Script ScriptTools QUIET)
+      if (${component} STREQUAL "Qt6")
+        find_package(Qt6 COMPONENTS Widgets OpenGLWidgets Gui Core Script ScriptTools QUIET)
       endif()
 
     else(WITH_CGAL_${component})
diff --git a/Installation/cmake/modules/CGAL_Qt6_moc_and_resource_files.cmake b/Installation/cmake/modules/CGAL_Qt6_moc_and_resource_files.cmake
index 21b32bc2e9e6..c3c6cbb71431 100644
--- a/Installation/cmake/modules/CGAL_Qt6_moc_and_resource_files.cmake
+++ b/Installation/cmake/modules/CGAL_Qt6_moc_and_resource_files.cmake
@@ -4,7 +4,7 @@ endif()
 set(CGAL_Qt6_moc_and_resource_files_included TRUE)
 # qrc files (resources files, that contain icons, at least)
 if(EXISTS ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/resources/CGAL.qrc)
-  qt5_add_resources (_CGAL_Qt6_RESOURCE_FILES_private
+  qt6_add_resources (_CGAL_Qt6_RESOURCE_FILES_private
     ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/resources/CGAL.qrc
     ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/icons/Input.qrc
     ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/icons/File.qrc
@@ -15,11 +15,11 @@ else()
     ${CGAL_MODULES_DIR}/demo/resources
     ${CGAL_MODULES_DIR}/demo/icons
     DESTINATION ${CMAKE_BINARY_DIR})
-  qt5_add_resources (_CGAL_Qt6_RESOURCE_FILES_private
+  qt6_add_resources (_CGAL_Qt6_RESOURCE_FILES_private
     ${CMAKE_BINARY_DIR}/resources/CGAL.qrc
     ${CMAKE_BINARY_DIR}/icons/Input.qrc
     ${CMAKE_BINARY_DIR}/icons/File.qrc
     ${CMAKE_BINARY_DIR}/icons/Triangulation_2.qrc)
 endif()
 
-qt5_wrap_ui(_CGAL_Qt6_UI_FILES ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/ImageInterface.ui)
+qt_wrap_ui(_CGAL_Qt6_UI_FILES ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/ImageInterface.ui)
diff --git a/Installation/cmake/modules/CGAL_SetupCGAL_Qt6Dependencies.cmake b/Installation/cmake/modules/CGAL_SetupCGAL_Qt6Dependencies.cmake
index 161e9673345c..690d018d33f8 100644
--- a/Installation/cmake/modules/CGAL_SetupCGAL_Qt6Dependencies.cmake
+++ b/Installation/cmake/modules/CGAL_SetupCGAL_Qt6Dependencies.cmake
@@ -9,7 +9,7 @@
 #
 # .. code-block:: cmake
 #
-#    find_package(Qt6 QUIET COMPONENTS OpenGL Svg)
+#    find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 #
 # and defines the variable :variable:`CGAL_Qt6_FOUND` and the function
 # :command:`CGAL_setup_CGAL_Qt6_dependencies`.
@@ -24,19 +24,24 @@ set(CGAL_SetupCGAL_Qt6Dependencies_included TRUE)
 # Used Modules
 # ^^^^^^^^^^^^
 #   - :module:`Qt6Config`
-find_package(Qt6 QUIET COMPONENTS OpenGL Svg)
+
+find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets Svg)
 
 set(CGAL_Qt6_MISSING_DEPS "")
-if(NOT Qt6OpenGL_FOUND)
-  set(CGAL_Qt6_MISSING_DEPS "Qt6OpenGL")
+if(NOT Qt6OpenGLWidgets_FOUND)
+  message( STATUS "NOTICE: NOT Qt6OpenGLWidgets_FOUND")
+  set(CGAL_Qt6_MISSING_DEPS "Qt6OpenGLWidgets")
 endif()
 if(NOT Qt6Svg_FOUND)
+  message(STATUS "NOTICE: NOT Qt6Svg_FOUND")
   set(CGAL_Qt6_MISSING_DEPS "${CGAL_Qt6_MISSING_DEPS} Qt6Svg")
 endif()
 if(NOT Qt6_FOUND)
+  message(STATUS "NOTICE: NOT Qt6_FOUND")
   set(CGAL_Qt6_MISSING_DEPS "${CGAL_Qt6_MISSING_DEPS} Qt6")
 endif()
 if(NOT EXISTS ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/GraphicsItem.h)
+  message(STATUS "NOTICE: NOT EXISTS GraphicsItem")
   set(CGAL_Qt6_MISSING_DEPS "${CGAL_Qt6_MISSING_DEPS} <CGAL/Qt/*.h> headers")
 endif()
 
@@ -75,7 +80,7 @@ if(NOT CGAL_Qt6_MISSING_DEPS)
       POSITION_INDEPENDENT_CODE TRUE
       EXCLUDE_FROM_ALL TRUE
       AUTOMOC TRUE)
-    target_link_libraries(CGAL_Qt6_moc_and_resources CGAL::CGAL Qt6::Widgets Qt6::OpenGL Qt6::Svg )
+    target_link_libraries(CGAL_Qt6_moc_and_resources CGAL::CGAL Qt6::Widgets Qt6::OpenGLWidgets Qt6::Svg )
 
     add_library(CGAL::CGAL_Qt6_moc_and_resources ALIAS CGAL_Qt6_moc_and_resources)
     add_library(CGAL::Qt6_moc_and_resources ALIAS CGAL_Qt6_moc_and_resources)
@@ -112,7 +117,7 @@ function(CGAL_setup_CGAL_Qt6_dependencies target)
   endif()
   target_link_libraries( ${target} INTERFACE CGAL::CGAL)
   target_link_libraries( ${target} INTERFACE CGAL::Qt6_moc_and_resources)
-  target_link_libraries( ${target} INTERFACE Qt6::OpenGL Qt6::Svg )
+  target_link_libraries( ${target} INTERFACE Qt6::OpenGLWidgets Qt6::Svg )
 
   # Remove -Wdeprecated-copy, for g++ >= 9.0, because Qt6, as of
   # version 5.12, has a lot of [-Wdeprecated-copy] warnings.
diff --git a/Installation/cmake/modules/CGAL_add_test.cmake b/Installation/cmake/modules/CGAL_add_test.cmake
index a5c8b2bc83a7..eb0c748109cc 100644
--- a/Installation/cmake/modules/CGAL_add_test.cmake
+++ b/Installation/cmake/modules/CGAL_add_test.cmake
@@ -117,23 +117,23 @@ function(cgal_add_compilation_test exe_name)
     set_property(TEST "check_build_system"
        PROPERTY FIXTURES_SETUP "check_build_system_SetupFixture")
   endif()
-  if(TARGET CGAL_Qt5_moc_and_resources) # if CGAL_Qt5 was searched, and is header-only
+  if(TARGET CGAL_Qt6_moc_and_resources) # if CGAL_Qt6 was searched, and is header-only
     get_property(linked_libraries TARGET "${exe_name}" PROPERTY LINK_LIBRARIES)
     #  message(STATUS "${exe_name} depends on ${linked_libraries}")
-    string(FIND "${linked_libraries}" "CGAL::CGAL_Qt5" link_with_CGAL_Qt5)
-    if(link_with_CGAL_Qt5 STRGREATER "-1" AND
-        NOT TARGET compilation_of__CGAL_Qt5_moc_and_resources)
+    string(FIND "${linked_libraries}" "CGAL::CGAL_Qt6" link_with_CGAL_Qt6)
+    if(link_with_CGAL_Qt6 STRGREATER "-1" AND
+        NOT TARGET compilation_of__CGAL_Qt6_moc_and_resources)
       # This custom target is useless. It is used only as a flag to
       # detect that the test has already been created.
-      add_custom_target(compilation_of__CGAL_Qt5_moc_and_resources)
-      add_dependencies( compilation_of__CGAL_Qt5_moc_and_resources CGAL_Qt5_moc_and_resources )
-      add_test(NAME "compilation_of__CGAL_Qt5_moc_and_resources"
-        COMMAND "${CMAKE_COMMAND}" --build "${CMAKE_BINARY_DIR}" --target "CGAL_Qt5_moc_and_resources" --config "$<CONFIG>")
-      set_property(TEST "compilation_of__CGAL_Qt5_moc_and_resources"
+      add_custom_target(compilation_of__CGAL_Qt6_moc_and_resources)
+      add_dependencies( compilation_of__CGAL_Qt6_moc_and_resources CGAL_Qt6_moc_and_resources )
+      add_test(NAME "compilation_of__CGAL_Qt6_moc_and_resources"
+        COMMAND "${CMAKE_COMMAND}" --build "${CMAKE_BINARY_DIR}" --target "CGAL_Qt6_moc_and_resources" --config "$<CONFIG>")
+      set_property(TEST "compilation_of__CGAL_Qt6_moc_and_resources"
         APPEND PROPERTY LABELS "CGAL_build_system")
-      set_property(TEST "compilation_of__CGAL_Qt5_moc_and_resources"
-        PROPERTY FIXTURES_SETUP "CGAL_Qt5_moc_and_resources_Fixture")
-      set_property(TEST "compilation_of__CGAL_Qt5_moc_and_resources"
+      set_property(TEST "compilation_of__CGAL_Qt6_moc_and_resources"
+        PROPERTY FIXTURES_SETUP "CGAL_Qt6_moc_and_resources_Fixture")
+      set_property(TEST "compilation_of__CGAL_Qt6_moc_and_resources"
         APPEND PROPERTY DEPENDS "check_build_system")
     endif()
   endif()
@@ -313,7 +313,7 @@ function(cgal_add_test exe_name)
         -P "${CGAL_MODULES_DIR}/run_test_with_cin.cmake")
       set_property(DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR}
         APPEND PROPERTY CMAKE_CONFIGURE_DEPENDS ${cin_file})
-      #	message(STATUS "add test: ${exe_name} < ${cin_file}")
+      # message(STATUS "add test: ${exe_name} < ${cin_file}")
     endif()
   else()
     if(NOT ARGS AND NOT cgal_add_test_TEST_NAME)
@@ -328,12 +328,12 @@ function(cgal_add_test exe_name)
         file(STRINGS "${cmd_file}" CMD_LINES)
         string(CONFIGURE "${CMD_LINES}" CMD_LINES)
         set(ARGS)
-        #	  message(STATUS "DEBUG test ${exe_name}")
+        #         message(STATUS "DEBUG test ${exe_name}")
         foreach(CMD_LINE ${CMD_LINES})
-    #	    message(STATUS "  command line: ${CMD_LINE}")
+    #       message(STATUS "  command line: ${CMD_LINE}")
           string(REGEX REPLACE "\#.*" "" CMD_LINE "${CMD_LINE}")
           separate_arguments(CMD_LINE_ARGS UNIX_COMMAND ${CMD_LINE})
-    #	    message(STATUS "  args: ${CMD_LINE_ARGS}")
+    #       message(STATUS "  args: ${CMD_LINE_ARGS}")
           list(APPEND ARGS ${CMD_LINE_ARGS})
         endforeach()
         expand_list_with_globbing(ARGS)
@@ -341,7 +341,7 @@ function(cgal_add_test exe_name)
           APPEND PROPERTY CMAKE_CONFIGURE_DEPENDS ${cmd_file})
       endif()
     endif()
-    #	message(STATUS "add test: ${exe_name} ${ARGS}")
+    #   message(STATUS "add test: ${exe_name} ${ARGS}")
     if(ANDROID)
       add_test(NAME ${test_name} COMMAND ${TIME_COMMAND} ${adb_executable} shell cd ${CGAL_REMOTE_TEST_DIR_PREFIX}${PROJECT_NAME} && LD_LIBRARY_PATH=${CGAL_REMOTE_TEST_DIR_PREFIX}${PROJECT_NAME} ${CGAL_REMOTE_TEST_DIR_PREFIX}${PROJECT_NAME}/${exe_name} ${ARGS})
     elseif(CGAL_RUN_TESTS_THROUGH_SSH)
diff --git a/Installation/cmake/modules/CGAL_setup_target_dependencies.cmake b/Installation/cmake/modules/CGAL_setup_target_dependencies.cmake
index bed40154c809..820664d04981 100644
--- a/Installation/cmake/modules/CGAL_setup_target_dependencies.cmake
+++ b/Installation/cmake/modules/CGAL_setup_target_dependencies.cmake
@@ -5,7 +5,7 @@ function(CGAL_setup_target_dependencies target)
     CGAL_setup_CGAL_Core_dependencies(${target})
   elseif(${target} STREQUAL CGAL_ImageIO)
     CGAL_setup_CGAL_ImageIO_dependencies(${target})
-  elseif(${target} STREQUAL CGAL_Qt5)
-    CGAL_setup_CGAL_Qt5_dependencies(${target})
+  elseif(${target} STREQUAL CGAL_Qt6)
+    CGAL_setup_CGAL_Qt6_dependencies(${target})
   endif()
 endfunction()
diff --git a/Installation/lib/cmake/CGAL/CGALConfig.cmake b/Installation/lib/cmake/CGAL/CGALConfig.cmake
index b9030ecc4dc7..f7afccf00574 100644
--- a/Installation/lib/cmake/CGAL/CGALConfig.cmake
+++ b/Installation/lib/cmake/CGAL/CGALConfig.cmake
@@ -128,7 +128,7 @@ if( CGAL_DEV_MODE OR RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE )
 endif()
 
 foreach(comp ${CGAL_FIND_COMPONENTS})
-  if(NOT comp MATCHES "Core|ImageIO|Qt5")
+  if(NOT comp MATCHES "Core|ImageIO|Qt6")
     message(FATAL_ERROR "The requested CGAL component ${comp} does not exist!")
   endif()
   if(comp MATCHES "Core" AND CGAL_DISABLE_GMP)
@@ -193,6 +193,5 @@ if (NOT TARGET CGAL::CGAL_Basic_viewer)
   add_library(CGAL::CGAL_Basic_viewer INTERFACE IMPORTED GLOBAL)
     set_target_properties(CGAL::CGAL_Basic_viewer PROPERTIES
       INTERFACE_COMPILE_DEFINITIONS "CGAL_USE_BASIC_VIEWER;QT_NO_KEYWORDS"
-      INTERFACE_LINK_LIBRARIES CGAL::CGAL_Qt5)
+      INTERFACE_LINK_LIBRARIES CGAL::CGAL_Qt6)
 endif()
-

From 47683f2dea3c40bbd380b78426a47dee5d9154b0 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 19 Apr 2023 14:27:45 +0100
Subject: [PATCH 0205/1398] The Truiangulation_2/examples which use draw()
 compile and visualize but have an assertion in a QMap

---
 .../include/CGAL/Qt/Basic_viewer_qt.h         |  4 ++--
 .../include/CGAL/Qt/CreateOpenGLContext.h     | 21 +++++++++++--------
 GraphicsView/include/CGAL/Qt/qglviewer_impl.h |  6 +++++-
 .../examples/Triangulation_2/CMakeLists.txt   |  6 +++---
 4 files changed, 22 insertions(+), 15 deletions(-)

diff --git a/GraphicsView/include/CGAL/Qt/Basic_viewer_qt.h b/GraphicsView/include/CGAL/Qt/Basic_viewer_qt.h
index 3c7b05082b98..054740afb350 100644
--- a/GraphicsView/include/CGAL/Qt/Basic_viewer_qt.h
+++ b/GraphicsView/include/CGAL/Qt/Basic_viewer_qt.h
@@ -34,7 +34,7 @@
 #include <CGAL/Qt/manipulatedFrame.h>
 #include <QKeyEvent>
 #include <QOpenGLVertexArrayObject>
-#include <QGLBuffer>
+#include <QOpenGLBuffer>
 #include <QOpenGLShaderProgram>
 
 #ifdef __GNUC__
@@ -1779,7 +1779,7 @@ class Basic_viewer_qt : public CGAL::QGLViewer
   static const unsigned int NB_VBO_BUFFERS=(END_POS-BEGIN_POS)+
     (END_COLOR-BEGIN_COLOR)+2; // +2 for 2 vectors of normals
 
-  QGLBuffer buffers[NB_VBO_BUFFERS];
+  QOpenGLBuffer buffers[NB_VBO_BUFFERS];
 
   // The following enum gives the indices of the different vao.
   enum
diff --git a/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h b/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
index 20bed5105a18..e85911f73e87 100644
--- a/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
+++ b/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
@@ -13,19 +13,22 @@
 #define CGAL_QT_CREATE_OPENGL_CONTEXT_H
 
 #include <QOpenGLContext>
-#include <QGLContext>
+
 namespace CGAL{
 namespace Qt{
-inline QGLContext* createOpenGLContext()
+inline QOpenGLContext* createOpenGLContext()
 {
     QOpenGLContext *context = new QOpenGLContext();
-    QSurfaceFormat format;
-    format.setVersion(2,1);
-    format.setProfile(QSurfaceFormat::CompatibilityProfile);
-    context->setFormat(format);
-    QGLContext *result = QGLContext::fromOpenGLContext(context);
-    result->create();
-    return result;
+    context->create();
+    return context;
+
+    //QSurfaceFormat format;
+    //format.setVersion(2,1);
+    //format.setProfile(QSurfaceFormat::CompatibilityProfile);
+    //context->setFormat(format);
+    //QGLContext *result = QGLContext::fromOpenGLContext(context);
+    // result->create();
+    //return result;
 }
 } // namespace Qt
 } // namespace CGAL
diff --git a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
index d54e88f8aba7..c8dec4a0725d 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
@@ -35,6 +35,7 @@
 #include <QImage>
 #include <QMessageBox>
 #include <QMouseEvent>
+#include <QPainter>
 #include <QPushButton>
 #include <QTabWidget>
 #include <QTextEdit>
@@ -2455,7 +2456,10 @@ void CGAL::QGLViewer::setMouseBinding(::Qt::Key key, ::Qt::KeyboardModifiers mod
     mouseBinding_.insert(mbp, map);
 
   ClickBindingPrivate cbp(modifiers, button, false, ::Qt::NoButton, key);
-  clickBinding_.remove(cbp);
+  
+  // AF: currently results in a runtime error
+  // clickBinding_.remove(cbp);
+  
 }
 
 
diff --git a/Triangulation_2/examples/Triangulation_2/CMakeLists.txt b/Triangulation_2/examples/Triangulation_2/CMakeLists.txt
index e4f5e7392ee8..47374a859985 100644
--- a/Triangulation_2/examples/Triangulation_2/CMakeLists.txt
+++ b/Triangulation_2/examples/Triangulation_2/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Triangulation_2_Examples)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # create a target per cppfile
 file(
@@ -15,10 +15,10 @@ foreach(cppfile ${cppfiles})
   create_single_source_cgal_program("${cppfile}")
 endforeach()
 
-if(CGAL_Qt5_FOUND)
+if(CGAL_Qt6_FOUND)
   target_link_libraries(polygon_triangulation PUBLIC CGAL::CGAL_Basic_viewer)
   target_link_libraries(draw_triangulation_2 PUBLIC CGAL::CGAL_Basic_viewer)
   target_link_libraries(star_conflict_zone PUBLIC CGAL::CGAL_Basic_viewer)
 else()
-  message(STATUS "NOTICE: Several examples require Qt5 and will not be compiled.")
+  message(STATUS "NOTICE: Several examples require Qt6 and will not be compiled.")
 endif()

From b1040de076ee390b3062d9734fdae4fb597ee445 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 19 Apr 2023 14:46:31 +0100
Subject: [PATCH 0206/1398] Surface_mesh example works as well

---
 Surface_mesh/examples/Surface_mesh/CMakeLists.txt | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Surface_mesh/examples/Surface_mesh/CMakeLists.txt b/Surface_mesh/examples/Surface_mesh/CMakeLists.txt
index b39506d8b451..87cdd52e06c4 100644
--- a/Surface_mesh/examples/Surface_mesh/CMakeLists.txt
+++ b/Surface_mesh/examples/Surface_mesh/CMakeLists.txt
@@ -9,8 +9,8 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Surface_mesh_Examples)
 
-#CGAL_Qt5 is needed for the drawing.
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+#CGAL_Qt6 is needed for the drawing.
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 create_single_source_cgal_program("sm_points.cpp")
 create_single_source_cgal_program("sm_derivation.cpp")
@@ -28,7 +28,7 @@ create_single_source_cgal_program("check_orientation.cpp")
 
 #create the executable of the application
 create_single_source_cgal_program("draw_surface_mesh.cpp")
-if(CGAL_Qt5_FOUND)
+if(CGAL_Qt6_FOUND)
 
   #link it with the required CGAL libraries
   target_link_libraries(draw_surface_mesh PUBLIC CGAL::CGAL_Basic_viewer)

From 42a9757f2f1e9a768eabe4287a8071d797fe0d1d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 19 Apr 2023 15:05:12 +0100
Subject: [PATCH 0207/1398] Fix to have a weak order

---
 GraphicsView/include/CGAL/Qt/qglviewer.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/GraphicsView/include/CGAL/Qt/qglviewer.h b/GraphicsView/include/CGAL/Qt/qglviewer.h
index 89885041c58a..2cf5b7faf342 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer.h
@@ -1156,7 +1156,7 @@ private Q_SLOTS:
         return modifiers < cbp.modifiers;
       if (button != cbp.button)
         return button < cbp.button;
-      return doubleClick != cbp.doubleClick;
+      return doubleClick < cbp.doubleClick;
     }
   };
 #endif

From 370e81ef08a91199779dad96cbbb16a49f34a8bf Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 19 Apr 2023 15:05:33 +0100
Subject: [PATCH 0208/1398] AABB Tree demo works

---
 AABB_tree/demo/AABB_tree/CMakeLists.txt   | 40 +++++++++++------------
 AABB_tree/demo/AABB_tree/MainWindow.h     |  2 +-
 AABB_tree/demo/AABB_tree/Scene.h          |  4 +--
 AABB_tree/demo/AABB_tree/Viewer.cpp       |  2 +-
 GraphicsView/include/CGAL/Qt/debug_impl.h |  2 +-
 5 files changed, 25 insertions(+), 25 deletions(-)

diff --git a/AABB_tree/demo/AABB_tree/CMakeLists.txt b/AABB_tree/demo/AABB_tree/CMakeLists.txt
index c777eba1798e..76e9faa655e4 100644
--- a/AABB_tree/demo/AABB_tree/CMakeLists.txt
+++ b/AABB_tree/demo/AABB_tree/CMakeLists.txt
@@ -20,28 +20,28 @@ endif()
 # Include this package's headers first
 include_directories(BEFORE ./ ./include)
 
-# Find CGAL and CGAL Qt5
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+# Find CGAL and CGAL Qt6
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-# Find Qt5 itself
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Gui Svg)
+# Find Qt6 itself
+find_package(Qt6 QUIET COMPONENTS  OpenGLWidgets Gui Svg)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
-  qt5_wrap_ui(UI_FILES MainWindow.ui)
+  qt6_wrap_ui(UI_FILES MainWindow.ui)
 
   include(AddFileDependencies)
 
-  qt5_generate_moc("MainWindow.h" "${CMAKE_CURRENT_BINARY_DIR}/MainWindow_moc.cpp")
+  qt6_generate_moc("MainWindow.h" "${CMAKE_CURRENT_BINARY_DIR}/MainWindow_moc.cpp")
   add_file_dependencies(MainWindow_moc.cpp "${CMAKE_CURRENT_SOURCE_DIR}/MainWindow.h")
 
-  qt5_generate_moc("Viewer.h" "${CMAKE_CURRENT_BINARY_DIR}/Viewer_moc.cpp")
+  qt6_generate_moc("Viewer.h" "${CMAKE_CURRENT_BINARY_DIR}/Viewer_moc.cpp")
   add_file_dependencies(Viewer_moc.cpp "${CMAKE_CURRENT_SOURCE_DIR}/Viewer.h")
 
-  qt5_generate_moc("Scene.h" "${CMAKE_CURRENT_BINARY_DIR}/Scene_moc.cpp")
+  qt6_generate_moc("Scene.h" "${CMAKE_CURRENT_BINARY_DIR}/Scene_moc.cpp")
   add_file_dependencies(Scene_moc.cpp "${CMAKE_CURRENT_SOURCE_DIR}/Scene.h")
 
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES AABB_demo.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES AABB_demo.qrc)
 
   add_file_dependencies(
     AABB_demo.cpp "${CMAKE_CURRENT_BINARY_DIR}/MainWindow_moc.cpp"
@@ -49,30 +49,30 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
     "${CMAKE_CURRENT_BINARY_DIR}/Scene_moc.cpp")
 
   add_executable(
-    AABB_demo AABB_demo.cpp ${UI_FILES} ${CGAL_Qt5_RESOURCE_FILES}
-    #${CGAL_Qt5_MOC_FILES}
+    AABB_demo AABB_demo.cpp ${UI_FILES} ${CGAL_Qt6_RESOURCE_FILES}
+    #${CGAL_Qt6_MOC_FILES}
   )
   # Link with Qt libraries
-  target_link_libraries(AABB_demo PRIVATE Qt5::OpenGL Qt5::Gui
-                                          CGAL::CGAL CGAL::CGAL_Qt5)
+  target_link_libraries(AABB_demo PRIVATE Qt6::OpenGLWidgets Qt6::Gui
+                                          CGAL::CGAL CGAL::CGAL_Qt6)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS AABB_demo)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(AABB_demo)
 
-else(CGAL_Qt5_FOUND AND Qt5_FOUND)
+else(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   set(AABB_MISSING_DEPS "")
 
-  if(NOT CGAL_Qt5_FOUND)
-    set(AABB_MISSING_DEPS "CGAL_Qt5, ${AABB_MISSING_DEPS}")
+  if(NOT CGAL_Qt6_FOUND)
+    set(AABB_MISSING_DEPS "CGAL_Qt6, ${AABB_MISSING_DEPS}")
   endif()
 
-  if(NOT Qt5_FOUND)
-    set(AABB_MISSING_DEPS "Qt5, ${AABB_MISSING_DEPS}")
+  if(NOT Qt6_FOUND)
+    set(AABB_MISSING_DEPS "Qt6, ${AABB_MISSING_DEPS}")
   endif()
 
   message("NOTICE: This demo requires ${AABB_MISSING_DEPS}, and will not be compiled.")
 
-endif(CGAL_Qt5_FOUND AND Qt5_FOUND)
+endif(CGAL_Qt6_FOUND AND Qt6_FOUND)
diff --git a/AABB_tree/demo/AABB_tree/MainWindow.h b/AABB_tree/demo/AABB_tree/MainWindow.h
index 2a072f195121..f768694514b8 100644
--- a/AABB_tree/demo/AABB_tree/MainWindow.h
+++ b/AABB_tree/demo/AABB_tree/MainWindow.h
@@ -1,7 +1,7 @@
 #ifndef MAINWINDOW_H
 #define MAINWINDOW_H
 
-#include <QtOpenGL/qgl.h>
+#include <QOpenGLWidget>
 #include <CGAL/Qt/DemosMainWindow.h>
 
 class QDragEnterEvent;
diff --git a/AABB_tree/demo/AABB_tree/Scene.h b/AABB_tree/demo/AABB_tree/Scene.h
index 44d7b8239ce8..cc109a433fdf 100644
--- a/AABB_tree/demo/AABB_tree/Scene.h
+++ b/AABB_tree/demo/AABB_tree/Scene.h
@@ -1,7 +1,7 @@
 #ifndef SCENE_H
 #define SCENE_H
 
-#include <QtOpenGL/qgl.h>
+#include <QOpenGLWidget>
 #include <iostream>
 #include <cmath>
 
@@ -77,7 +77,7 @@ class Scene : public QObject
     };
 
 public:
-    QGLContext* context;
+    QOpenGLContext* context;
     void draw(CGAL::QGLViewer*);
     void update_bbox();
     Bbox bbox() { return m_bbox; }
diff --git a/AABB_tree/demo/AABB_tree/Viewer.cpp b/AABB_tree/demo/AABB_tree/Viewer.cpp
index 7bc82f7770e6..6f5eac006797 100644
--- a/AABB_tree/demo/AABB_tree/Viewer.cpp
+++ b/AABB_tree/demo/AABB_tree/Viewer.cpp
@@ -1,7 +1,7 @@
 #include "Viewer.h"
 #include "Scene.h"
 #include <QMouseEvent>
-#include <QGLFunctions>
+#include <QOpenGLFunctions>
 #include <CGAL/Qt/CreateOpenGLContext.h>
 
 Viewer::Viewer(QWidget* parent)
diff --git a/GraphicsView/include/CGAL/Qt/debug_impl.h b/GraphicsView/include/CGAL/Qt/debug_impl.h
index eaa4d7ed108b..4f3c152697c6 100644
--- a/GraphicsView/include/CGAL/Qt/debug_impl.h
+++ b/GraphicsView/include/CGAL/Qt/debug_impl.h
@@ -23,7 +23,7 @@
 #include <CGAL/Qt/debug.h>
 #include <QDir>
 #include <iostream>
-#include <QtOpenGL/qgl.h>
+#include <QOpenGLWidget>
 #include <qopenglfunctions.h>
 namespace CGAL {
 namespace Qt {

From 5601e035ff0bd50bb7856028399071a2ab052da7 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 19 Apr 2023 17:05:21 +0100
Subject: [PATCH 0209/1398] Change all CMakeLists.txt

---
 Polyhedron/demo/Polyhedron/CMakeLists.txt     | 148 ++++++++++--------
 .../Plugins/Alpha_wrap_3/CMakeLists.txt       |   2 +-
 .../Plugins/Camera_position/CMakeLists.txt    |   2 +-
 .../Plugins/Classification/CMakeLists.txt     |   2 +-
 .../Polyhedron/Plugins/Display/CMakeLists.txt |   2 +-
 .../demo/Polyhedron/Plugins/IO/CMakeLists.txt |   2 +-
 .../Polyhedron/Plugins/Mesh_2/CMakeLists.txt  |   2 +-
 .../Polyhedron/Plugins/Mesh_3/CMakeLists.txt  |  12 +-
 .../Operations_on_polyhedra/CMakeLists.txt    |   6 +-
 .../Polyhedron/Plugins/PCA/CMakeLists.txt     |   6 +-
 .../Polyhedron/Plugins/PMP/CMakeLists.txt     |  26 +--
 .../Plugins/Point_set/CMakeLists.txt          |  26 +--
 .../Plugins/Surface_mesh/CMakeLists.txt       |  12 +-
 .../Tetrahedral_remeshing/CMakeLists.txt      |   6 +-
 .../Plugins/Three_examples/CMakeLists.txt     |  16 +-
 .../implicit_functions/CMakeLists.txt         |  22 +--
 16 files changed, 156 insertions(+), 136 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/CMakeLists.txt b/Polyhedron/demo/Polyhedron/CMakeLists.txt
index 9eb13d44e097..e78c8acd1d0b 100644
--- a/Polyhedron/demo/Polyhedron/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/CMakeLists.txt
@@ -36,25 +36,34 @@ option(POLYHEDRON_QTSCRIPT_DEBUGGER
        "Activate the use of Qt Script Debugger in Polyhedron_3 demo" OFF)
 
 # Find CGAL
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5 ImageIO)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6 ImageIO)
 set_package_properties(CGAL PROPERTIES TYPE REQUIRED)
 include(${CGAL_USE_FILE})
 
-# Find Qt5 itself
-find_package(Qt5 QUIET
-             COMPONENTS OpenGL Script Widgets
+if(CGAL_Qt6_FOUND)
+  message( STATUS "we found CGAL_Qt6")
+endif()
+
+# Find Qt6 itself
+find_package(Qt6 QUIET
+             COMPONENTS OpenGLWidgets Widgets
              OPTIONAL_COMPONENTS ScriptTools WebSockets Network)
 
 set_package_properties(
-  Qt5 PROPERTIES
+  Qt6 PROPERTIES
   TYPE REQUIRED
   PURPOSE "Enables the 3D Features, for GUI and visualization."
-  DESCRIPTION "To find this package, it should be sufficient to fill the Qt5_DIR variable with: <Qt_dir>/<Qt_version>/<Compilator>/lib/cmake/Qt5")
+  DESCRIPTION "To find this package, it should be sufficient to fill the Qt6_DIR variable with: <Qt_dir>/<Qt_version>/<Compilator>/lib/cmake/Qt6")
+
+if(NOT Qt6_FOUND)
+  message( STATUS "we did not find it")
+endif()
 
-if(Qt5_FOUND)
+if(Qt6_FOUND)
+  message( STATUS "we did find Qt6")
   add_definitions(-DQT_NO_KEYWORDS)
   add_definitions(-DSCENE_IMAGE_GL_BUFFERS_AVAILABLE)
-endif(Qt5_FOUND)
+endif(Qt6_FOUND)
 
 find_package(Eigen3 3.2.0 QUIET) #(requires 3.2.0 or greater)
 set_package_properties(
@@ -119,23 +128,34 @@ set_package_properties(
   DESCRIPTION "A library for parallel programming."
   PURPOSE "Plugins such as Mesh_3, Bilateral smoothing, and WLOP are faster if TBB is linked.")
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+
+
+if(NOT CGAL_Qt6_FOUND)
+  message( STATUS "NOT CGAL_Qt6_FOUND")
+endif()
+
+if(NOT Qt6_FOUND)
+  message( STATUS "NOT Qt6_FOUND")
+endif()
+
+
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   include(${CGAL_USE_FILE})
 
-  qt5_wrap_ui(MainWindowUI_files MainWindow.ui)
-  qt5_wrap_ui(SubViewerUI_files SubViewer.ui)
-  qt5_wrap_ui(statisticsUI_FILES Statistics_on_item_dialog.ui)
-  qt5_wrap_ui(FileLoaderDialogUI_files FileLoaderDialog.ui)
-  qt5_wrap_ui(Show_point_dialogUI_FILES Show_point_dialog.ui)
-  qt5_wrap_ui(PreferencesUI_FILES Preferences.ui Details.ui SSH_dialog.ui)
-  qt5_wrap_ui(Show_point_dialogUI_FILES Show_point_dialog.ui)
-  qt5_wrap_ui(ViewerUI_FILES LightingDialog.ui)
-  qt5_generate_moc("File_loader_dialog.h"
+  qt6_wrap_ui(MainWindowUI_files MainWindow.ui)
+  qt6_wrap_ui(SubViewerUI_files SubViewer.ui)
+  qt6_wrap_ui(statisticsUI_FILES Statistics_on_item_dialog.ui)
+  qt6_wrap_ui(FileLoaderDialogUI_files FileLoaderDialog.ui)
+  qt6_wrap_ui(Show_point_dialogUI_FILES Show_point_dialog.ui)
+  qt6_wrap_ui(PreferencesUI_FILES Preferences.ui Details.ui SSH_dialog.ui)
+  qt6_wrap_ui(Show_point_dialogUI_FILES Show_point_dialog.ui)
+  qt6_wrap_ui(ViewerUI_FILES LightingDialog.ui)
+  qt6_generate_moc("File_loader_dialog.h"
                    "${CMAKE_CURRENT_BINARY_DIR}/File_loader_dialog_moc.cpp")
 
   include(${CMAKE_CURRENT_SOURCE_DIR}/polyhedron_demo_macros.cmake)
 
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES Polyhedron_3.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES Polyhedron_3.qrc)
   find_path(
     CGAL_THREE_HEADERS_PATH
     NAMES CGAL/Three/Scene_item.h
@@ -144,16 +164,16 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
     DOC "Path to CGAL/Three/Scene_item.h")
 
   if(CGAL_THREE_HEADERS_PATH)
-    qt5_generate_moc("${CGAL_THREE_HEADERS_PATH}/CGAL/Three/Viewer_interface.h"
+    qt6_generate_moc("${CGAL_THREE_HEADERS_PATH}/CGAL/Three/Viewer_interface.h"
                      "${CMAKE_CURRENT_BINARY_DIR}/Viewer_interface_moc.cpp")
-    qt5_generate_moc("${CGAL_THREE_HEADERS_PATH}/CGAL/Three/Scene_item.h"
+    qt6_generate_moc("${CGAL_THREE_HEADERS_PATH}/CGAL/Three/Scene_item.h"
                      "${CMAKE_CURRENT_BINARY_DIR}/Scene_item_moc.cpp")
-    qt5_generate_moc("${CGAL_THREE_HEADERS_PATH}/CGAL/Three/Scene_group_item.h"
+    qt6_generate_moc("${CGAL_THREE_HEADERS_PATH}/CGAL/Three/Scene_group_item.h"
                      "${CMAKE_CURRENT_BINARY_DIR}/Scene_group_item_moc.cpp")
-    qt5_generate_moc(
+    qt6_generate_moc(
       "${CGAL_THREE_HEADERS_PATH}/CGAL/Three/Scene_item_rendering_helper.h"
       "${CMAKE_CURRENT_BINARY_DIR}/Scene_item_rendering_helper_moc.cpp")
-    qt5_generate_moc("${CGAL_THREE_HEADERS_PATH}/CGAL/Three/TextRenderer.h"
+    qt6_generate_moc("${CGAL_THREE_HEADERS_PATH}/CGAL/Three/TextRenderer.h"
                      "${CMAKE_CURRENT_BINARY_DIR}/TextRenderer_moc.cpp")
   else()
     message(FATAL_ERROR "Cannot find <CGAL/Three/Scene_item.h>")
@@ -174,8 +194,8 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
     Viewer.cpp
     Three.cpp
     ${ViewerUI_FILES}
-    ${CGAL_Qt5_RESOURCE_FILES}
-    ${CGAL_Qt5_MOC_FILES}
+    ${CGAL_Qt6_RESOURCE_FILES}
+    ${CGAL_Qt6_MOC_FILES}
     Viewer_interface_moc.cpp
     Scene_item_moc.cpp
     Scene_item.cpp
@@ -191,11 +211,11 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
     Primitive_container.cpp
     Polyhedron_demo_plugin_helper.cpp
     CGAL_double_edit.cpp)
-  target_link_libraries(demo_framework PUBLIC Qt5::OpenGL Qt5::Widgets Qt5::Gui
-                                              Qt5::Script CGAL::CGAL_Qt5)
-  if(TARGET Qt5::WebSockets)
-    target_link_libraries(demo_framework PUBLIC Qt5::WebSockets)
-    message(STATUS "Qt5WebSockets was found. Using WebSockets is therefore possible.")
+  target_link_libraries(demo_framework PUBLIC Qt6::OpenGLWidgets Qt6::Widgets Qt6::Gui
+                                              CGAL::CGAL_Qt6)
+  if(TARGET Qt6::WebSockets)
+    target_link_libraries(demo_framework PUBLIC Qt6::WebSockets)
+    message(STATUS "Qt6WebSockets was found. Using WebSockets is therefore possible.")
   endif()
 
   #compilation_of__demo_framework is defined in polyhedron_demo_macros.cmake
@@ -204,29 +224,29 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   # CMake). That is to deal with the visibility of symbols of
   # `Three.h`/`Three.cpp`.
   target_compile_definitions(demo_framework PRIVATE three_EXPORTS=1)
-  target_compile_definitions(demo_framework PRIVATE -DCGAL_USE_Qt5_RESOURCES)
+  target_compile_definitions(demo_framework PRIVATE -DCGAL_USE_Qt6_RESOURCES)
 
   add_library(scene_basic_objects SHARED Scene_plane_item.cpp
                                          Scene_spheres_item.cpp)
   target_link_libraries(
-    scene_basic_objects PUBLIC demo_framework ${CGAL_LIBRARIES} Qt5::OpenGL
-                               Qt5::Gui Qt5::Script Qt5::Widgets)
+    scene_basic_objects PUBLIC demo_framework ${CGAL_LIBRARIES} Qt6::OpenGLWidgets
+                               Qt6::Gui Qt6::Widgets)
   add_library(scene_color_ramp SHARED Color_ramp.cpp)
-  target_link_libraries(scene_color_ramp PRIVATE Qt5::Core)
+  target_link_libraries(scene_color_ramp PRIVATE Qt6::Core)
 
   add_library(scene_callback_signaler SHARED Callback_signaler.cpp)
-  target_link_libraries(scene_callback_signaler PRIVATE Qt5::Core)
+  target_link_libraries(scene_callback_signaler PRIVATE Qt6::Core)
 
   add_library(point_dialog SHARED Show_point_dialog.cpp Show_point_dialog.ui
                                   ${Show_point_dialogUI_FILES})
-  target_link_libraries(point_dialog PUBLIC Qt5::OpenGL Qt5::Gui Qt5::Script
-                                            Qt5::Widgets)
+  target_link_libraries(point_dialog PUBLIC Qt6::OpenGLWidgets Qt6::Gui
+                                            Qt6::Widgets)
 
   macro(add_item item_name)
     add_library(${item_name} SHARED ${ARGN})
     target_link_libraries(
-      ${item_name} PUBLIC demo_framework ${CGAL_LIBRARIES} Qt5::OpenGL Qt5::Gui
-                          Qt5::Script Qt5::Widgets)
+      ${item_name} PUBLIC demo_framework ${CGAL_LIBRARIES} Qt6::OpenGLWidgets Qt6::Gui
+                          Qt6::Widgets)
     add_to_cached_list(CGAL_EXECUTABLE_TARGETS ${item_name})
   endmacro(add_item)
 
@@ -286,7 +306,7 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
     add_item(scene_textured_item Scene_textured_surface_mesh_item.cpp
              texture.cpp)
     target_link_libraries(scene_textured_item PUBLIC CGAL::Eigen3_support)
-    qt5_wrap_ui(editionUI_FILES Plugins/Surface_mesh_deformation/Deform_mesh.ui)
+    qt6_wrap_ui(editionUI_FILES Plugins/Surface_mesh_deformation/Deform_mesh.ui)
     add_item(scene_edit_item
              Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.cpp
              ${editionUI_FILES})
@@ -337,35 +357,35 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
     Polyhedron_demo.cpp
     File_loader_dialog_moc.cpp
     Use_ssh.cpp
-    ${CGAL_Qt5_RESOURCE_FILES}
-    ${CGAL_Qt5_MOC_FILES}
+    ${CGAL_Qt6_RESOURCE_FILES}
+    ${CGAL_Qt6_MOC_FILES}
     ${FileLoaderDialogUI_files}
     ${MainWindowUI_files}
     ${PreferencesUI_FILES}
     ${statisticsUI_FILES}
     ${SubViewerUI_files})
   target_link_libraries(
-    polyhedron_demo PUBLIC demo_framework point_dialog Qt5::Gui Qt5::OpenGL
-                           Qt5::Widgets Qt5::Script)
+    polyhedron_demo PUBLIC demo_framework point_dialog Qt6::Gui Qt6::OpenGLWidgets
+                           Qt6::Widgets )
   if(LIBSSH_FOUND)
     target_compile_definitions(polyhedron_demo PRIVATE -DCGAL_USE_SSH)
     target_link_libraries(polyhedron_demo PRIVATE ${LIBSSH_LIBRARIES})
     target_include_directories(polyhedron_demo SYSTEM PRIVATE ${LIBSSH_INCLUDE_DIR})
   endif() #libssh
-  if(TARGET Qt5::WebSockets)
+  if(TARGET Qt6::WebSockets)
     target_compile_definitions(polyhedron_demo PRIVATE -DCGAL_USE_WEBSOCKETS)
     target_compile_definitions(demo_framework PRIVATE -DCGAL_USE_WEBSOCKETS)
-    target_link_libraries(polyhedron_demo PRIVATE Qt5::WebSockets)
+    target_link_libraries(polyhedron_demo PRIVATE Qt6::WebSockets)
   endif()
   add_executable(Polyhedron_3 Polyhedron_3.cpp)
   target_link_libraries(Polyhedron_3 PRIVATE polyhedron_demo)
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Polyhedron_3)
 
   if(POLYHEDRON_QTSCRIPT_DEBUGGER)
-    if(TARGET Qt5::ScriptTools)
-      target_link_libraries(polyhedron_demo PUBLIC Qt5::ScriptTools)
+    if(TARGET Qt6::ScriptTools)
+      target_link_libraries(polyhedron_demo PUBLIC Qt6::ScriptTools)
     else()
-      message(STATUS "POLYHEDRON_QTSCRIPT_DEBUGGER is set to TRUE but the Qt5 ScriptTools library was not found.")
+      message(STATUS "POLYHEDRON_QTSCRIPT_DEBUGGER is set to TRUE but the Qt6 ScriptTools library was not found.")
     endif()
   endif()
   target_link_libraries(Polyhedron_3 PRIVATE demo_framework)
@@ -409,23 +429,23 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS CGAL_PMP)
 
   #WS Server
-  if(TARGET Qt5::WebSockets AND TARGET Qt5::Network)
+  if(TARGET Qt6::WebSockets AND TARGET Qt6::Network)
     add_executable(WS_server Server_ws.cpp)
-    target_link_libraries(WS_server PUBLIC Qt5::WebSockets Qt5::Widgets Qt5::Network)
-    message(STATUS "Qt5WebSockets was found. Using WebSockets is therefore possible.")
+    target_link_libraries(WS_server PUBLIC Qt6::WebSockets Qt6::Widgets Qt6::Network)
+    message(STATUS "Qt6WebSockets was found. Using WebSockets is therefore possible.")
   endif()
   #
   # Exporting
   #
-  if(TARGET CGAL_Qt5)
+  if(TARGET CGAL_Qt6)
     export(
-      TARGETS CGAL CGAL_Qt5 CGAL_ImageIO
+      TARGETS CGAL CGAL_Qt6 CGAL_ImageIO
       FILE polyhedron_demo_targets.cmake
       NAMESPACE Polyhedron_)
   endif()
-  if(TARGET CGAL_Qt5_moc_and_resources)
+  if(TARGET CGAL_Qt6_moc_and_resources)
     export(
-      TARGETS CGAL_Qt5_moc_and_resources
+      TARGETS CGAL_Qt6_moc_and_resources
       NAMESPACE Polyhedron_ APPEND
       FILE polyhedron_demo_targets.cmake)
   endif()
@@ -447,21 +467,21 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
                  CGAL_polyhedron_demoConfig.cmake)
   #TO DO script the activation of all the plugins.
 
-else(CGAL_Qt5_FOUND AND Qt5_FOUND)
+else(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   set(POLYHEDRON_MISSING_DEPS "")
 
-  if(NOT CGAL_Qt5_FOUND)
-    set(POLYHEDRON_MISSING_DEPS "the CGAL Qt5 library, ${POLYHEDRON_MISSING_DEPS}")
+  if(NOT CGAL_Qt6_FOUND)
+    set(POLYHEDRON_MISSING_DEPS "the CGAL Qt6 library, ${POLYHEDRON_MISSING_DEPS}")
   endif()
 
-  if(NOT Qt5_FOUND)
-    set(POLYHEDRON_MISSING_DEPS "Qt5, ${POLYHEDRON_MISSING_DEPS}")
+  if(NOT Qt6_FOUND)
+    set(POLYHEDRON_MISSING_DEPS "Qt6, ${POLYHEDRON_MISSING_DEPS}")
   endif()
 
-  message("NOTICE: This demo requires ${POLYHEDRON_MISSING_DEPS} and will not be compiled.")
+  message("NOTICE: XX This demo requires ${POLYHEDRON_MISSING_DEPS} and will not be compiled.")
 
-endif(CGAL_Qt5_FOUND AND Qt5_FOUND)
+endif(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
 feature_summary(
   WHAT REQUIRED_PACKAGES_NOT_FOUND
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/CMakeLists.txt
index 89b5b8ea92a1..3f6540236e37 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/CMakeLists.txt
@@ -1,7 +1,7 @@
 include(polyhedron_demo_macros)
 
 #if the plugin has a UI file
-qt5_wrap_ui(alpha_wrap_3UI_FILES alpha_wrap_3_dialog.ui)
+qt6_wrap_ui(alpha_wrap_3UI_FILES alpha_wrap_3_dialog.ui)
 polyhedron_demo_plugin(alpha_wrap_3_plugin Alpha_wrap_3_plugin ${alpha_wrap_3UI_FILES})
 
 #if the plugin uses external libraries like scene_items
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Camera_position/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Camera_position/CMakeLists.txt
index 35c19f5a82aa..e080e6837a31 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Camera_position/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Camera_position/CMakeLists.txt
@@ -1,6 +1,6 @@
 
 include( polyhedron_demo_macros )
-qt5_wrap_ui( cameraUI_FILES   Camera_positions_list.ui )
+qt6_wrap_ui( cameraUI_FILES   Camera_positions_list.ui )
 polyhedron_demo_plugin(camera_positions_plugin
     Camera_positions_plugin
     Camera_positions_list.cpp
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Classification/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Classification/CMakeLists.txt
index 86d60a563194..7b8cafbb3c41 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Classification/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Classification/CMakeLists.txt
@@ -20,7 +20,7 @@ if(TARGET CGAL::Eigen3_support)
     message(STATUS "NOTICE: OpenCV was not found. OpenCV random forest predicate for classification won't be available.")
   endif()
 
-  qt5_wrap_ui(classificationUI_FILES Classification_widget.ui
+  qt6_wrap_ui(classificationUI_FILES Classification_widget.ui
     Classification_advanced_widget.ui)
   polyhedron_demo_plugin(
     classification_plugin
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Display/CMakeLists.txt
index 6e1c99909175..3831b4679a13 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/CMakeLists.txt
@@ -1,6 +1,6 @@
 include(polyhedron_demo_macros)
 if(TARGET CGAL::Eigen3_support)
-  qt5_wrap_ui( display_propertyUI_FILES Display_property.ui )
+  qt6_wrap_ui( display_propertyUI_FILES Display_property.ui )
   polyhedron_demo_plugin(display_property_plugin Display_property_plugin ${display_propertyUI_FILES} KEYWORDS Viewer)
   target_link_libraries(display_property_plugin
     PUBLIC
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/IO/CMakeLists.txt
index 0d4300700dc9..ec7b583d8a28 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/CMakeLists.txt
@@ -11,7 +11,7 @@ include(CGAL_LASLIB_support)
 polyhedron_demo_plugin(gocad_plugin GOCAD_io_plugin KEYWORDS Viewer)
 target_link_libraries(gocad_plugin PUBLIC scene_surface_mesh_item)
 
-qt5_wrap_ui( funcUI_FILES Function_dialog.ui )
+qt6_wrap_ui( funcUI_FILES Function_dialog.ui )
 polyhedron_demo_plugin(io_implicit_function_plugin
   Implicit_function_io_plugin
   ${funcUI_FILES}
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_2/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Mesh_2/CMakeLists.txt
index e4336410f023..3f3be1c57aac 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_2/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_2/CMakeLists.txt
@@ -1,6 +1,6 @@
 include(polyhedron_demo_macros)
 #if the plugin has a UI file
-qt5_wrap_ui(mesh_2UI_FILES mesh_2_dialog.ui)
+qt6_wrap_ui(mesh_2UI_FILES mesh_2_dialog.ui)
 polyhedron_demo_plugin(mesh_2_plugin Mesh_2_plugin ${mesh_2UI_FILES})
 #if the plugin uses external libraries like scene_items
 target_link_libraries(
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
index 9bf2f376761b..7343e7e215cd 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
@@ -2,11 +2,11 @@ include(polyhedron_demo_macros)
 
 remove_definitions(-DQT_STATICPLUGIN)
 
-qt5_wrap_cpp(VOLUME_MOC_OUTFILES
+qt6_wrap_cpp(VOLUME_MOC_OUTFILES
              ${CMAKE_CURRENT_SOURCE_DIR}/Volume_plane_thread.h)
-qt5_wrap_cpp(VOLUME_MOC_OUTFILES
+qt6_wrap_cpp(VOLUME_MOC_OUTFILES
              ${CMAKE_CURRENT_SOURCE_DIR}/Volume_plane_interface.h)
-qt5_wrap_ui(meshingUI_FILES Meshing_dialog.ui Smoother_dialog.ui
+qt6_wrap_ui(meshingUI_FILES Meshing_dialog.ui Smoother_dialog.ui
             Local_optimizers_dialog.ui)
 polyhedron_demo_plugin(
   mesh_3_plugin
@@ -55,7 +55,7 @@ endif()
 
 find_package(Boost QUIET OPTIONAL_COMPONENTS filesystem system)
 if(Boost_FILESYSTEM_FOUND)
-  qt5_wrap_ui( imgUI_FILES Image_res_dialog.ui raw_image.ui)
+  qt6_wrap_ui( imgUI_FILES Image_res_dialog.ui raw_image.ui)
   polyhedron_demo_plugin(io_image_plugin Io_image_plugin
     Volume_plane_intersection.cpp
     Raw_image_dialog.cpp
@@ -101,11 +101,11 @@ endif()
 polyhedron_demo_plugin(c3t3_io_plugin C3t3_io_plugin KEYWORDS Viewer Mesh_3)
 target_link_libraries(c3t3_io_plugin PUBLIC scene_c3t3_item)
 
-qt5_wrap_ui(tetraUI_FILES Tetrahedra_filter_widget.ui)
+qt6_wrap_ui(tetraUI_FILES Tetrahedra_filter_widget.ui)
 polyhedron_demo_plugin(tetrahedra_filtering_plugin Tetrahedra_filtering_plugin ${tetraUI_FILES} KEYWORDS Mesh_3 Viewer)
 target_link_libraries(tetrahedra_filtering_plugin  PUBLIC scene_c3t3_item scene_tetrahedra_item)
 
-qt5_wrap_ui(ribUI_FILES Rib_dialog.ui)
+qt6_wrap_ui(ribUI_FILES Rib_dialog.ui)
 polyhedron_demo_plugin(c3t3_rib_exporter_plugin C3t3_rib_exporter_plugin
                        ${ribUI_FILES} KEYWORDS Mesh_3)
 target_link_libraries(c3t3_rib_exporter_plugin PUBLIC scene_c3t3_item)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/CMakeLists.txt
index 628d00b72d34..2e030be7f6df 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/CMakeLists.txt
@@ -1,5 +1,5 @@
 include(polyhedron_demo_macros)
-qt5_wrap_ui(clip_polyhedronUI_FILES Clip_polyhedron_plugin.ui)
+qt6_wrap_ui(clip_polyhedronUI_FILES Clip_polyhedron_plugin.ui)
 polyhedron_demo_plugin(clip_polyhedron_plugin Clip_polyhedron_plugin
                        ${clip_polyhedronUI_FILES})
 target_link_libraries(
@@ -16,12 +16,12 @@ target_link_libraries(
 polyhedron_demo_plugin(diff_between_meshes_plugin Diff_between_meshes_plugin)
 target_link_libraries(diff_between_meshes_plugin PUBLIC scene_surface_mesh_item)
 
- qt5_wrap_ui( animateUI_FILES Animate_widget.ui )
+ qt6_wrap_ui( animateUI_FILES Animate_widget.ui )
  polyhedron_demo_plugin(animate_mesh_plugin Animate_mesh_plugin ${animateUI_FILES})
  target_link_libraries(animate_mesh_plugin PUBLIC scene_surface_mesh_item)
 
  if( TARGET CGAL::METIS_support )
-   qt5_wrap_ui( partitionUI_FILES PartitionDialog.ui )
+   qt6_wrap_ui( partitionUI_FILES PartitionDialog.ui )
    polyhedron_demo_plugin(partition_plugin Partition_graph_plugin ${partitionUI_FILES})
    target_link_libraries(partition_plugin PUBLIC scene_surface_mesh_item CGAL::METIS_support )
 else()
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/PCA/CMakeLists.txt
index 4171347a6dcc..ccc765452927 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/CMakeLists.txt
@@ -4,7 +4,7 @@ target_link_libraries(
   pca_plugin PUBLIC scene_surface_mesh_item scene_points_with_normal_item
                     scene_basic_objects)
 
-qt5_wrap_ui(transformUI_FILES Transformation_widget.ui MeshOnGrid_dialog.ui)
+qt6_wrap_ui(transformUI_FILES Transformation_widget.ui MeshOnGrid_dialog.ui)
 
 polyhedron_demo_plugin(affine_transform_plugin Affine_transform_plugin
                        ${transformUI_FILES} KEYWORDS PointSetProcessing)
@@ -16,7 +16,7 @@ polyhedron_demo_plugin(edit_box_plugin Edit_box_plugin)
 target_link_libraries(edit_box_plugin PUBLIC scene_edit_box_item
                                              scene_surface_mesh_item)
 
-qt5_wrap_ui(clipUI_FILES Clipping_box_widget.ui)
+qt6_wrap_ui(clipUI_FILES Clipping_box_widget.ui)
 polyhedron_demo_plugin(clipping_box_plugin Clipping_box_plugin ${clipUI_FILES})
 target_link_libraries(clipping_box_plugin PUBLIC scene_edit_box_item
                                                  scene_basic_objects)
@@ -29,7 +29,7 @@ target_link_libraries(
   create_obb_mesh_plugin PUBLIC scene_surface_mesh_item scene_selection_item
                                 scene_points_with_normal_item)
 
-qt5_wrap_ui(volumesUI_FILES Basic_generator_widget.ui)
+qt6_wrap_ui(volumesUI_FILES Basic_generator_widget.ui)
 polyhedron_demo_plugin(
   basic_generator_plugin Basic_generator_plugin ${volumesUI_FILES} KEYWORDS
   PolygonMesh PointSetProcessing)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
index 6ff2b7c356dc..3abd47002122 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
@@ -15,15 +15,15 @@ target_link_libraries(extrude_plugin PUBLIC scene_surface_mesh_item
 
 if(TARGET CGAL::Eigen3_support)
   if("${EIGEN3_VERSION}" VERSION_GREATER "3.1.90")
-    qt5_wrap_ui( hole_fillingUI_FILES Hole_filling_widget.ui)
+    qt6_wrap_ui( hole_fillingUI_FILES Hole_filling_widget.ui)
     polyhedron_demo_plugin(hole_filling_plugin Hole_filling_plugin ${hole_fillingUI_FILES} KEYWORDS PMP)
     target_link_libraries(hole_filling_plugin PUBLIC scene_surface_mesh_item scene_polylines_item scene_selection_item CGAL::Eigen3_support)
 
-    qt5_wrap_ui( fairingUI_FILES Fairing_widget.ui)
+    qt6_wrap_ui( fairingUI_FILES Fairing_widget.ui)
     polyhedron_demo_plugin(fairing_plugin Fairing_plugin ${fairingUI_FILES} KEYWORDS PMP)
     target_link_libraries(fairing_plugin PUBLIC scene_selection_item CGAL::Eigen3_support)
 
-    qt5_wrap_ui( Mean_curvature_flow_skeleton_pluginUI_FILES  Mean_curvature_flow_skeleton_plugin.ui)
+    qt6_wrap_ui( Mean_curvature_flow_skeleton_pluginUI_FILES  Mean_curvature_flow_skeleton_plugin.ui)
     polyhedron_demo_plugin(mean_curvature_flow_skeleton_plugin Mean_curvature_flow_skeleton_plugin ${Mean_curvature_flow_skeleton_pluginUI_FILES})
     target_link_libraries(mean_curvature_flow_skeleton_plugin
       PUBLIC
@@ -34,7 +34,7 @@ if(TARGET CGAL::Eigen3_support)
         demo_framework
         CGAL::Eigen3_support)
     # The smoothing plugin can still do some things, even if Ceres is not found
-    qt5_wrap_ui( smoothingUI_FILES Smoothing_plugin.ui Smoothing_tangential_relaxation.ui)
+    qt6_wrap_ui( smoothingUI_FILES Smoothing_plugin.ui Smoothing_tangential_relaxation.ui)
     polyhedron_demo_plugin(smoothing_plugin Smoothing_plugin ${smoothingUI_FILES})
     target_link_libraries(smoothing_plugin PUBLIC scene_surface_mesh_item scene_selection_item CGAL::Eigen3_support)
     find_package(Ceres QUIET)
@@ -49,7 +49,7 @@ if(TARGET CGAL::Eigen3_support)
       PURPOSE "Can be used as a solver in the smoothing plugin.")
     target_link_libraries(extrude_plugin PUBLIC CGAL::Eigen3_support)
 
-    qt5_wrap_ui(remeshPlanarPatchesUI_FILES Remesh_planar_patches_dialog.ui)
+    qt6_wrap_ui(remeshPlanarPatchesUI_FILES Remesh_planar_patches_dialog.ui)
     polyhedron_demo_plugin(remesh_planar_patches_plugin Remesh_planar_patches_plugin
                            ${remeshPlanarPatchesUI_FILES} KEYWORDS PMP)
     target_link_libraries(remesh_planar_patches_plugin PUBLIC scene_surface_mesh_item CGAL::Eigen3_support)
@@ -71,7 +71,7 @@ else()
   message(STATUS "NOTICE: The hole filling and fairing plugins require Eigen 3.2 (or higher) and will not be available.")
 endif()
 
-qt5_wrap_ui(soupUI_FILES Repair_soup.ui)
+qt6_wrap_ui(soupUI_FILES Repair_soup.ui)
 polyhedron_demo_plugin(orient_soup_plugin Orient_soup_plugin ${soupUI_FILES}
                        KEYWORDS Classification PMP)
 target_link_libraries(
@@ -85,18 +85,18 @@ target_link_libraries(inside_out_plugin PUBLIC scene_surface_mesh_item scene_pol
 polyhedron_demo_plugin(join_and_split_plugin Join_and_split_polyhedra_plugin KEYWORDS PMP)
 target_link_libraries(join_and_split_plugin PUBLIC scene_surface_mesh_item scene_selection_item)
 
-qt5_wrap_ui( point_inside_polyhedronUI_FILES Point_inside_polyhedron_widget.ui)
+qt6_wrap_ui( point_inside_polyhedronUI_FILES Point_inside_polyhedron_widget.ui)
 polyhedron_demo_plugin(point_inside_polyhedron_plugin Point_inside_polyhedron_plugin ${point_inside_polyhedronUI_FILES})
 target_link_libraries(point_inside_polyhedron_plugin PUBLIC scene_surface_mesh_item scene_points_with_normal_item)
 
-qt5_wrap_ui( polyhedron_slicerUI_FILES Polyhedron_slicer_widget.ui)
+qt6_wrap_ui( polyhedron_slicerUI_FILES Polyhedron_slicer_widget.ui)
 polyhedron_demo_plugin(polyhedron_slicer_plugin Polyhedron_slicer_plugin ${polyhedron_slicerUI_FILES})
 target_link_libraries(polyhedron_slicer_plugin PUBLIC scene_surface_mesh_item scene_basic_objects scene_polylines_item)
 
 polyhedron_demo_plugin(polyhedron_stitching_plugin Polyhedron_stitching_plugin KEYWORDS PMP)
 target_link_libraries(polyhedron_stitching_plugin PUBLIC scene_surface_mesh_item scene_polylines_item)
 
-qt5_wrap_ui( selectionUI_FILES Selection_widget.ui)
+qt6_wrap_ui( selectionUI_FILES Selection_widget.ui)
 polyhedron_demo_plugin(selection_plugin Selection_plugin ${selectionUI_FILES} KEYWORDS PMP Viewer Classification Mesh_3)
 target_link_libraries(selection_plugin PUBLIC scene_selection_item scene_points_with_normal_item scene_polylines_item)
 
@@ -117,11 +117,11 @@ target_link_libraries(
   PUBLIC scene_surface_mesh_item scene_polylines_item
          scene_points_with_normal_item)
 
-qt5_wrap_ui( repairUI_FILES RemoveNeedlesDialog.ui SelfSnapDialog.ui)
+qt6_wrap_ui( repairUI_FILES RemoveNeedlesDialog.ui SelfSnapDialog.ui)
 polyhedron_demo_plugin(repair_polyhedron_plugin Repair_polyhedron_plugin  ${repairUI_FILES} KEYWORDS PMP)
 target_link_libraries(repair_polyhedron_plugin PUBLIC scene_points_with_normal_item scene_surface_mesh_item)
 
-qt5_wrap_ui(isotropicRemeshingUI_FILES Isotropic_remeshing_dialog.ui)
+qt6_wrap_ui(isotropicRemeshingUI_FILES Isotropic_remeshing_dialog.ui)
 polyhedron_demo_plugin(isotropic_remeshing_plugin Isotropic_remeshing_plugin
                        ${isotropicRemeshingUI_FILES} KEYWORDS PMP)
 target_link_libraries(isotropic_remeshing_plugin PUBLIC scene_surface_mesh_item
@@ -141,7 +141,7 @@ endif()
 polyhedron_demo_plugin(detect_sharp_edges_plugin Detect_sharp_edges_plugin KEYWORDS Viewer Mesh_3 PMP)
 target_link_libraries(detect_sharp_edges_plugin PUBLIC scene_surface_mesh_item)
 
-qt5_wrap_ui(randomPerturbationUI_FILES Random_perturbation_dialog.ui)
+qt6_wrap_ui(randomPerturbationUI_FILES Random_perturbation_dialog.ui)
 polyhedron_demo_plugin(random_perturbation_plugin Random_perturbation_plugin
                        ${randomPerturbationUI_FILES} KEYWORDS PMP)
 target_link_libraries(random_perturbation_plugin PUBLIC scene_surface_mesh_item
@@ -152,7 +152,7 @@ polyhedron_demo_plugin(degenerated_faces_plugin Degenerated_faces_plugin
 target_link_libraries(degenerated_faces_plugin PUBLIC scene_surface_mesh_item
                                                       scene_selection_item)
 
-qt5_wrap_ui(engravUI_FILES Engrave_dock_widget.ui)
+qt6_wrap_ui(engravUI_FILES Engrave_dock_widget.ui)
 polyhedron_demo_plugin(engrave_text_plugin Engrave_text_plugin
                        ${engravUI_FILES})
 target_link_libraries(
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Point_set/CMakeLists.txt
index 1955755b2dbb..3bade0d26e6e 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/CMakeLists.txt
@@ -24,7 +24,7 @@ if(TARGET CGAL::Eigen3_support)
     message(STATUS "NOTICE: SCIP and GLPK were not found. Polygonal surface reconstruction will not be available.")
   endif()
 
-  qt5_wrap_ui(surface_reconstructionUI_FILES Surface_reconstruction_plugin.ui)
+  qt6_wrap_ui(surface_reconstructionUI_FILES Surface_reconstruction_plugin.ui)
   polyhedron_demo_plugin(
     surface_reconstruction_plugin
     Surface_reconstruction_plugin
@@ -46,7 +46,7 @@ if(TARGET CGAL::Eigen3_support)
     target_link_libraries(surface_reconstruction_plugin PUBLIC CGAL::GLPK_support)
   endif()
 
-  qt5_wrap_ui(point_set_normal_estimationUI_FILES
+  qt6_wrap_ui(point_set_normal_estimationUI_FILES
               Point_set_normal_estimation_plugin.ui)
   polyhedron_demo_plugin(
     point_set_normal_estimation_plugin Point_set_normal_estimation_plugin
@@ -57,7 +57,7 @@ if(TARGET CGAL::Eigen3_support)
     PUBLIC scene_points_with_normal_item scene_callback_signaler
            CGAL::Eigen3_support)
 
-  qt5_wrap_ui(features_detection_pluginUI_FILES Features_detection_plugin.ui)
+  qt6_wrap_ui(features_detection_pluginUI_FILES Features_detection_plugin.ui)
   polyhedron_demo_plugin(
     features_detection_plugin Features_detection_plugin
     ${features_detection_pluginUI_FILES} KEYWORDS PointSetProcessing)
@@ -80,7 +80,7 @@ if(TARGET CGAL::Eigen3_support)
     PUBLIC scene_points_with_normal_item scene_callback_signaler
            CGAL::Eigen3_support)
 
-  qt5_wrap_ui(point_set_shape_detectionUI_FILES
+  qt6_wrap_ui(point_set_shape_detectionUI_FILES
               Point_set_shape_detection_plugin.ui)
   polyhedron_demo_plugin(
     point_set_shape_detection_plugin Point_set_shape_detection_plugin
@@ -97,7 +97,7 @@ if(TARGET CGAL::Eigen3_support)
   include(CGAL_pointmatcher_support)
 
   if(TARGET CGAL::OpenGR_support OR CGAL::pointmatcher_support)
-    qt5_wrap_ui(register_point_setsUI_FILES Register_point_sets_plugin.ui)
+    qt6_wrap_ui(register_point_setsUI_FILES Register_point_sets_plugin.ui)
     polyhedron_demo_plugin(
       register_point_sets_plugin Register_point_sets_plugin
       ${register_point_setsUI_FILES} KEYWORDS PointSetProcessing)
@@ -123,7 +123,7 @@ else()
   message(STATUS "NOTICE: Eigen 3.1 (or greater) was not found. Feature detection plugin will not be available.")
 endif()
 
-qt5_wrap_ui(point_set_bilateral_smoothingUI_FILES
+qt6_wrap_ui(point_set_bilateral_smoothingUI_FILES
             Point_set_bilateral_smoothing_plugin.ui)
 polyhedron_demo_plugin(
   point_set_bilateral_smoothing_plugin Point_set_bilateral_smoothing_plugin
@@ -132,7 +132,7 @@ target_link_libraries(
   point_set_bilateral_smoothing_plugin PUBLIC scene_points_with_normal_item
                                               scene_callback_signaler)
 
-qt5_wrap_ui(ps_outliers_removal_UI_FILES Point_set_outliers_removal_plugin.ui)
+qt6_wrap_ui(ps_outliers_removal_UI_FILES Point_set_outliers_removal_plugin.ui)
 polyhedron_demo_plugin(
   point_set_outliers_removal_plugin Point_set_outliers_removal_plugin
   ${ps_outliers_removal_UI_FILES} KEYWORDS PointSetProcessing)
@@ -140,7 +140,7 @@ target_link_libraries(
   point_set_outliers_removal_plugin PUBLIC scene_points_with_normal_item
                                            scene_callback_signaler)
 
-qt5_wrap_ui(point_set_selectionUI_FILES Point_set_selection_widget.ui)
+qt6_wrap_ui(point_set_selectionUI_FILES Point_set_selection_widget.ui)
 polyhedron_demo_plugin(
   point_set_selection_plugin Point_set_selection_plugin
   ${point_set_selectionUI_FILES} KEYWORDS PointSetProcessing Classification)
@@ -148,7 +148,7 @@ target_link_libraries(
   point_set_selection_plugin PUBLIC scene_points_with_normal_item
                                     scene_polylines_item scene_edit_box_item)
 
-qt5_wrap_ui(point_set_simplificationUI_FILES Point_set_simplification_plugin.ui)
+qt6_wrap_ui(point_set_simplificationUI_FILES Point_set_simplification_plugin.ui)
 polyhedron_demo_plugin(
   point_set_simplification_plugin Point_set_simplification_plugin
   ${point_set_simplificationUI_FILES} KEYWORDS PointSetProcessing)
@@ -156,14 +156,14 @@ target_link_libraries(
   point_set_simplification_plugin PUBLIC scene_points_with_normal_item
                                          scene_callback_signaler)
 
-qt5_wrap_ui(point_set_upsamplingUI_FILES Point_set_upsampling_plugin.ui)
+qt6_wrap_ui(point_set_upsamplingUI_FILES Point_set_upsampling_plugin.ui)
 polyhedron_demo_plugin(
   point_set_upsampling_plugin Point_set_upsampling_plugin
   ${point_set_upsamplingUI_FILES} KEYWORDS PointSetProcessing)
 target_link_libraries(point_set_upsampling_plugin
                       PUBLIC scene_points_with_normal_item)
 
-qt5_wrap_ui(point_set_wlopFILES Point_set_wlop_plugin.ui)
+qt6_wrap_ui(point_set_wlopFILES Point_set_wlop_plugin.ui)
 polyhedron_demo_plugin(point_set_wlop_plugin Point_set_wlop_plugin
                        ${point_set_wlopFILES} KEYWORDS PointSetProcessing)
 target_link_libraries(point_set_wlop_plugin PUBLIC scene_points_with_normal_item
@@ -186,13 +186,13 @@ polyhedron_demo_plugin(
 target_link_libraries(point_set_interference_plugin
                       PUBLIC scene_points_with_normal_item)
 
-qt5_wrap_ui(alpha_shapeUI_FILES Alpha_shape_widget.ui)
+qt6_wrap_ui(alpha_shapeUI_FILES Alpha_shape_widget.ui)
 polyhedron_demo_plugin(alpha_shape_plugin Alpha_shape_plugin
                        ${alpha_shapeUI_FILES} KEYWORDS PointSetProcessing)
 target_link_libraries(alpha_shape_plugin PUBLIC scene_points_with_normal_item
                                                 scene_c3t3_item)
 
-qt5_wrap_ui(distanceUI_FILES Point_set_to_mesh_distance_widget.ui)
+qt6_wrap_ui(distanceUI_FILES Point_set_to_mesh_distance_widget.ui)
 polyhedron_demo_plugin(
   point_set_to_mesh_distance_plugin Point_set_to_mesh_distance_plugin
   ${distanceUI_FILES} KEYWORDS PointSetProcessing)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
index 4e553fbde16a..1c211311a738 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
@@ -9,7 +9,7 @@ if(NOT CGAL_DISABLE_GMP)
 
     include(${CGAL_USE_FILE})
 
-    qt5_wrap_ui(parameterizationUI_FILES Parameterization_widget.ui OTE_dialog.ui)
+    qt6_wrap_ui(parameterizationUI_FILES Parameterization_widget.ui OTE_dialog.ui)
     polyhedron_demo_plugin(parameterization_plugin Parameterization_plugin
                            ${parameterizationUI_FILES})
     target_link_libraries(
@@ -26,7 +26,7 @@ if(NOT CGAL_DISABLE_GMP)
     message(STATUS "NOTICE: Eigen 3.1 (or greater) was not found. The Parameterization plugin will not be available.")
   endif()
 
-  qt5_wrap_ui(segmentationUI_FILES Mesh_segmentation_widget.ui)
+  qt6_wrap_ui(segmentationUI_FILES Mesh_segmentation_widget.ui)
   polyhedron_demo_plugin(mesh_segmentation_plugin Mesh_segmentation_plugin
                          ${segmentationUI_FILES})
   target_link_libraries(mesh_segmentation_plugin PUBLIC scene_surface_mesh_item)
@@ -37,11 +37,11 @@ if(NOT CGAL_DISABLE_GMP)
       PROPERTIES RESOURCE_LOCK Selection_test_resources)
   endif()
 
-  qt5_wrap_ui( mesh_simplificationUI_FILES  Mesh_simplification_dialog.ui)
+  qt6_wrap_ui( mesh_simplificationUI_FILES  Mesh_simplification_dialog.ui)
   polyhedron_demo_plugin(mesh_simplification_plugin Mesh_simplification_plugin ${mesh_simplificationUI_FILES})
   target_link_libraries(mesh_simplification_plugin PUBLIC scene_surface_mesh_item scene_selection_item)
 
-  qt5_wrap_ui(remeshingUI_FILES Remeshing_dialog.ui)
+  qt6_wrap_ui(remeshingUI_FILES Remeshing_dialog.ui)
   polyhedron_demo_plugin(offset_meshing_plugin Offset_meshing_plugin
                          ${remeshingUI_FILES})
   target_link_libraries(offset_meshing_plugin PUBLIC scene_surface_mesh_item
@@ -54,14 +54,14 @@ if(NOT CGAL_DISABLE_GMP)
     target_link_libraries(offset_meshing_plugin PUBLIC CGAL::TBB_support)
   endif()
 
-  qt5_wrap_ui(shortestPathUI_FILES Shortest_path_widget.ui)
+  qt6_wrap_ui(shortestPathUI_FILES Shortest_path_widget.ui)
   polyhedron_demo_plugin(shortest_path_plugin Shortest_path_plugin
                          ${shortestPathUI_FILES})
   target_link_libraries(
     shortest_path_plugin PUBLIC scene_surface_mesh_item scene_shortest_path_item
                                 scene_basic_objects)
 
-  qt5_wrap_ui(basicUI_FILES Surface_mesh_approximation_dockwidget.ui)
+  qt6_wrap_ui(basicUI_FILES Surface_mesh_approximation_dockwidget.ui)
   polyhedron_demo_plugin(
     surface_mesh_approximation_plugin Surface_mesh_approximation_plugin
     ${basicUI_FILES} VSA_wrapper.cpp)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/CMakeLists.txt
index a7547b6e19cd..15dc949776e9 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/CMakeLists.txt
@@ -2,12 +2,12 @@ include(polyhedron_demo_macros)
 
 remove_definitions(-DQT_STATICPLUGIN)
 
-qt5_wrap_cpp(VOLUME_MOC_OUTFILES
+qt6_wrap_cpp(VOLUME_MOC_OUTFILES
              ${CMAKE_CURRENT_SOURCE_DIR}/Volume_plane_thread.h)
-qt5_wrap_cpp(VOLUME_MOC_OUTFILES
+qt6_wrap_cpp(VOLUME_MOC_OUTFILES
              ${CMAKE_CURRENT_SOURCE_DIR}/Volume_plane_interface.h)
 
-qt5_wrap_ui(tetRemeshingUI_FILES Tetrahedral_remeshing_dialog.ui)
+qt6_wrap_ui(tetRemeshingUI_FILES Tetrahedral_remeshing_dialog.ui)
 polyhedron_demo_plugin(
   tetrahedral_remeshing_plugin Tetrahedral_remeshing_plugin
   ${tetRemeshingUI_FILES} KEYWORDS Tetrahedral_remeshing)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/CMakeLists.txt
index a3b77b8e4526..7ebf7feedea9 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/CMakeLists.txt
@@ -10,22 +10,22 @@ set(CMAKE_INCLUDE_CURRENT_DIR ON)
 # Instruct CMake to run moc automatically when needed.
 set(CMAKE_AUTOMOC ON)
 #Find CGAL
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5 ImageIO)
-# Find Qt5 itself
-find_package(Qt5 QUIET
-             COMPONENTS OpenGL Script Svg
-             OPTIONAL_COMPONENTS ScriptTools WebSockets)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6 ImageIO)
+# Find Qt6 itself
+find_package(Qt6 QUIET
+             COMPONENTS OpenGLWidget Svg
+             OPTIONAL_COMPONENTS WebSockets)
 
 if(RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE)
-  if(Qt5_FOUND)
+  if(Qt6_FOUND)
     include(${CGAL_USE_FILE})
   endif()
   polyhedron_demo_plugin(example_plugin Example_plugin)
 
-  qt5_wrap_ui(basicUI_FILES Basic_dialog.ui)
+  qt6_wrap_ui(basicUI_FILES Basic_dialog.ui)
   polyhedron_demo_plugin(basic_plugin Basic_plugin ${basicUI_FILES})
 
-  qt5_wrap_ui(dockUI_FILES Basic_dock_widget.ui)
+  qt6_wrap_ui(dockUI_FILES Basic_dock_widget.ui)
   polyhedron_demo_plugin(dock_widget_plugin Dock_widget_plugin ${dockUI_FILES})
 
   polyhedron_demo_plugin(basic_item_plugin Basic_item_plugin)
diff --git a/Polyhedron/demo/Polyhedron/implicit_functions/CMakeLists.txt b/Polyhedron/demo/Polyhedron/implicit_functions/CMakeLists.txt
index 98faad76be30..7e374a519dcb 100644
--- a/Polyhedron/demo/Polyhedron/implicit_functions/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/implicit_functions/CMakeLists.txt
@@ -19,17 +19,17 @@ set(CMAKE_LIBRARY_OUTPUT_DIRECTORY "${CMAKE_RUNTIME_OUTPUT_DIRECTORY}")
 # Include directory of demo includes
 include_directories(BEFORE ${Mesh_3_implicit_functions_BINARY_DIR} ../include)
 
-# Find CGAL and CGAL Qt5
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+# Find CGAL and CGAL Qt6
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-# Find Qt5 itself
+# Find Qt6 itself
 set(QT_USE_QTXML TRUE)
 set(QT_USE_QTMAIN TRUE)
 set(QT_USE_QTSCRIPT TRUE)
 set(QT_USE_QTOPENGL TRUE)
-find_package(Qt5 QUIET COMPONENTS Script OpenGL ScriptTools)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets ScriptTools)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   # put plugins (which are shared libraries) at the same location as
   # executable files
   set(LIBRARY_OUTPUT_PATH ${RUNTIME_OUTPUT_PATH})
@@ -47,18 +47,18 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   polyhedron_demo_plugin(p_klein_function_plugin Klein_implicit_function
                          KEYWORDS Mesh_3)
 
-else(CGAL_Qt5_FOUND AND Qt5_FOUND)
+else(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   set(MESH_3_MISSING_DEPS "")
 
-  if(NOT CGAL_Qt5_FOUND)
-    set(MESH_3_MISSING_DEPS "the CGAL Qt5 library, ${MESH_3_MISSING_DEPS}")
+  if(NOT CGAL_Qt6_FOUND)
+    set(MESH_3_MISSING_DEPS "the CGAL Qt6 library, ${MESH_3_MISSING_DEPS}")
   endif()
 
-  if(NOT Qt5_FOUND)
-    set(MESH_3_MISSING_DEPS "Qt5, ${MESH_3_MISSING_DEPS}")
+  if(NOT Qt6_FOUND)
+    set(MESH_3_MISSING_DEPS "Qt6, ${MESH_3_MISSING_DEPS}")
   endif()
 
   message("NOTICE: This demo requires ${MESH_3_MISSING_DEPS} and will not be compiled.")
 
-endif(CGAL_Qt5_FOUND AND Qt5_FOUND)
+endif(CGAL_Qt6_FOUND AND Qt6_FOUND)

From 5030d671d5ee5a71f4eee1b8fe2ea6e1e5d1317e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 19 Apr 2023 17:06:44 +0100
Subject: [PATCH 0210/1398] Target Polyhedron_3 builds and executes, but with
 all scripting and RegExp (deprecated) commented

---
 Polyhedron/demo/Polyhedron/MainWindow.cpp     | 43 +++++++++++++------
 Polyhedron/demo/Polyhedron/MainWindow.h       | 20 +++++----
 .../demo/Polyhedron/Polyhedron_demo.cpp       |  4 +-
 Polyhedron/demo/Polyhedron/Scene.cpp          |  2 +-
 Polyhedron/demo/Polyhedron/Scene.h            |  2 +-
 .../demo/Polyhedron/Show_point_dialog.cpp     |  5 ++-
 Polyhedron/demo/Polyhedron/Viewer.cpp         |  3 +-
 .../Polyhedron/polyhedron_demo_macros.cmake   |  4 +-
 Three/include/CGAL/Three/exceptions.h         | 14 +++---
 9 files changed, 64 insertions(+), 33 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index b797ecf7a70e..4560cf9aceea 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -73,10 +73,12 @@
 #include <CGAL/Qt/manipulatedCameraFrame.h>
 #include <CGAL/Qt/manipulatedFrame.h>
 
+#include "Color_map.h"
+
 #ifdef QT_SCRIPT_LIB
 #  include <QScriptEngine>
 #  include <QScriptValue>
-#include "Color_map.h"
+
 
 
 using namespace CGAL::Three;
@@ -123,6 +125,7 @@ const QString debug_widgets_names[9] = {
 #  endif
 #endif
 
+#if 0
 QScriptValue myPrintFunction(QScriptContext *context, QScriptEngine *engine)
 {
   MainWindow* mw = qobject_cast<MainWindow*>(engine->parent());
@@ -138,6 +141,7 @@ QScriptValue myPrintFunction(QScriptContext *context, QScriptEngine *engine)
 
   return engine->undefinedValue();
 }
+#endif
 
 inline
 QKeySequence combine(Qt::Modifier m, Qt::Key k)
@@ -166,8 +170,8 @@ MainWindow::MainWindow(const QStringList &keywords, bool verbose, QWidget* paren
   is_locked = false;
   // remove the Load Script menu entry, when the demo has not been compiled with QT_SCRIPT_LIB
 #if !defined(QT_SCRIPT_LIB)
-  ui->menuBar->removeAction(ui->actionLoadScript);
-  ui->menuBar->removeAction(ui->on_actionLoad_a_Scene_from_a_Script_File);
+ // ui->menuBar->removeAction(ui->actionLoadScript);
+ // ui->menuBar->removeAction(ui->on_actionLoad_a_Scene_from_a_Script_File);
 #endif
   // Save some pointers from ui, for latter use.
   sceneView = ui->sceneView;
@@ -528,6 +532,7 @@ void MainWindow::filterOperations(bool)
 
 #include <CGAL/Three/exceptions.h>
 
+#if 0
 void MainWindow::evaluate_script(QString script,
                                  const QString& filename,
                                  const bool quiet) {
@@ -595,6 +600,7 @@ void MainWindow::enableScriptDebugger(bool b /* = true */)
   this->error(tr("Your version of Qt is too old, and for that reason "
                  "the Qt Script Debugger is not available."));
 }
+#endif 
 
 namespace {
 bool actionsByName(QAction* x, QAction* y) {
@@ -650,8 +656,8 @@ bool MainWindow::load_plugin(QString fileName, bool blacklisted)
     QFileInfo fileinfo(fileName);
     //set plugin name
     QString name = fileinfo.fileName();
-    name.remove(QRegExp("^lib"));
-    name.remove(QRegExp("\\..*"));
+    name.remove(QRegularExpression("^lib"));
+    name.remove(QRegularExpression("\\..*"));
     //do not load it if it is in the blacklist
     if(blacklisted)
     {
@@ -1138,20 +1144,22 @@ bool MainWindow::file_matches_filter(const QString& filters,
   QString filename_striped=fileinfo.fileName();
 
   //match all filters between ()
-  QRegExp all_filters_rx("\\((.*)\\)");
+  QRegularExpression all_filters_rx("\\((.*)\\)");
 
   QStringList split_filters = filters.split(";;");
   Q_FOREACH(const QString& filter, split_filters) {
     //extract filters
+#if 0 // AF @todo
     if ( all_filters_rx.indexIn(filter)!=-1 ){
       Q_FOREACH(const QString& pattern,all_filters_rx.cap(1).split(' ')){
-        QRegExp rx(pattern);
-        rx.setPatternSyntax(QRegExp::Wildcard);
+        QRegularExpression rx(pattern);
+        rx.setPatternSyntax(QRegularExpression::Wildcard);
         if ( rx.exactMatch(filename_striped) ){
           return true;
         }
       }
     }
+#endif
   }
   return false;
 }
@@ -1268,6 +1276,7 @@ void MainWindow::open(QString filename)
 bool MainWindow::open(QString filename, QString loader_name) {
   QFileInfo fileinfo(filename);
   boost::optional<bool> item_opt;
+#if 0 // AF
   try {
     item_opt = wrap_a_call_to_cpp
         ([this, fileinfo, loader_name]()
@@ -1284,6 +1293,7 @@ bool MainWindow::open(QString filename, QString loader_name) {
     std::cerr << e.what() << std::endl;
     return false;
   }
+#endif
   return true;
 }
 
@@ -1887,6 +1897,7 @@ void MainWindow::closeEvent(QCloseEvent *event)
   event->accept();
 }
 
+#if 0
 bool MainWindow::loadScript(QString filename)
 {
   QFileInfo fileinfo(filename);
@@ -1920,12 +1931,15 @@ bool MainWindow::loadScript(QFileInfo info)
 #endif
   return false;
 }
+#endif
 
 void MainWindow::throw_exception() {
+#if 0 // AF
   wrap_a_call_to_cpp([]() {
     throw std::runtime_error("Exception thrown in "
                              "MainWindow::throw_exception()");
   }, this, __FILE__, __LINE__);
+#endif
 }
 
 void MainWindow::on_actionLoadScript_triggered()
@@ -2046,7 +2060,7 @@ void MainWindow::on_actionSaveAs_triggered()
           sf = plugin->saveNameFilters().split(";;").first();
       }
     }
-    QRegExp extensions("\\(\\*\\..+\\)");
+    QRegularExpression extensions("\\(\\*\\..+\\)");
     QStringList filter_exts;
     if(filters.empty())
     {
@@ -2056,6 +2070,7 @@ void MainWindow::on_actionSaveAs_triggered()
                            .arg(item->name()));
           return;
     }
+#if 0 // AF 
     Q_FOREACH(QString string, filters)
     {
       QStringList sl = string.split(";;");
@@ -2065,6 +2080,8 @@ void MainWindow::on_actionSaveAs_triggered()
           filter_exts.append(extensions.capturedTexts());
       }
     }
+#endif 
+
     filters << tr("All files (*)");
     if(canSavePlugins.isEmpty()) {
       QMessageBox::warning(this,
@@ -2094,9 +2111,9 @@ void MainWindow::on_actionSaveAs_triggered()
     if(filename.isEmpty())
       return;
     last_saved_dir = QFileInfo(filename).absoluteDir().path();
-    extensions.indexIn(sf.split(";;").first());
+    // AF  extensions.indexIn(sf.split(";;").first());
     QString filter_ext, filename_ext;
-    filter_ext = extensions.cap().split(" ").first();// in case of syntax like (*.a *.b)
+    // AF filter_ext = extensions.cap().split(" ").first();// in case of syntax like (*.a *.b)
 
     filter_ext.remove(")");
     filter_ext.remove("(");
@@ -2804,9 +2821,11 @@ void MainWindow::colorItems()
     return;
   std::vector<QColor> colors_;
   colors_.reserve(nb_files);
+#
   compute_color_map(scene->item(scene->selectionIndices().last())->color(),
                     static_cast<unsigned>(nb_files),
                     std::back_inserter(colors_));
+
   std::size_t nb_item = -1;
   Q_FOREACH(int id, scene->selectionIndices())
   {
@@ -3859,7 +3878,7 @@ void MainWindow::on_actionLoad_a_Scene_from_a_Script_File_triggered()
     if(filename.isEmpty())
       return;
   }
-  loadScript(QFileInfo(filename));
+  
   if(do_download){
     QFile tmp_file(filename);
     tmp_file.remove();
diff --git a/Polyhedron/demo/Polyhedron/MainWindow.h b/Polyhedron/demo/Polyhedron/MainWindow.h
index 7202c8ac6296..f0c3adca0078 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.h
+++ b/Polyhedron/demo/Polyhedron/MainWindow.h
@@ -3,12 +3,13 @@
 #include "config.h"
 #include "MainWindow_config.h"
 
-#include <QtOpenGL/qgl.h>
+#include <QOpenGLWidget>
 #include <CGAL/Qt/DemosMainWindow.h>
 #include <CGAL/Three/Three.h>
 
-#include <QScriptEngine>
-#include <QScriptable>
+// AF @todo   Scripting has changed
+// #include <QScriptEngine>
+// #include <QScriptable>
 
 
 #include <QVector>
@@ -60,8 +61,8 @@ namespace Ui {
 class MAINWINDOW_EXPORT MainWindow :
   public CGAL::Qt::DemosMainWindow,
   public Messages_interface,
-  public CGAL::Three::Three,
-  protected QScriptable
+  public CGAL::Three::Three
+  // AF        , protected QScriptable
 {
   Q_OBJECT
   Q_INTERFACES(Messages_interface)
@@ -147,12 +148,13 @@ public Q_SLOTS:
    index of the item to be reloaded as data attached to the action.
    The index must identify a valid `Scene_item`.*/
   void reloadItem();
-
+#if 0
   //! Loads a script. Returns true if it worked.
   bool loadScript(QString filename);
 
   //! Loads a script. Returns true if it worked.
   bool loadScript(QFileInfo);
+#endif
 
   /*!
    * Gives the keyboard input focus to the widget searchEdit.
@@ -261,7 +263,7 @@ public Q_SLOTS:
    * If able, finds a script debugger and interrupts current action. Default
    * value for parameter is true.
    */
-  void enableScriptDebugger(bool = true);
+  // void enableScriptDebugger(bool = true);
 
   /// This slot is used to test exception handling in Qt Scripts.
   void throw_exception();
@@ -449,9 +451,11 @@ protected Q_SLOTS:
   //! Calls evaluate_script(script, filename, true).
   void evaluate_script_quiet(QString script,
                              const QString & fileName = QString());
+  #endif 
+
   QMutex mutex;
   QWaitCondition wait_condition;
-#endif
+
 public Q_SLOTS:
   void on_actionSa_ve_Scene_as_Script_triggered();
   void on_actionLoad_a_Scene_from_a_Script_File_triggered();
diff --git a/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp b/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
index 7b6e5225dfe3..6348c203eab8 100644
--- a/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
+++ b/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
@@ -129,10 +129,10 @@ Polyhedron_demo::Polyhedron_demo(int& argc, char **argv,
   }
 #endif
 
-  mainWindow.loadScript(":/cgal/Polyhedron_3/javascript/lib.js");
+  // mainWindow.loadScript(":/cgal/Polyhedron_3/javascript/lib.js");
   QFileInfo autostart_js("autostart.js");
   if(!parser.isSet(no_autostart) && autostart_js.exists()) {
-    mainWindow.loadScript(autostart_js);
+    // mainWindow.loadScript(autostart_js);
   }
   Q_FOREACH(QString filename, parser.positionalArguments()) {
     mainWindow.open(filename);
diff --git a/Polyhedron/demo/Polyhedron/Scene.cpp b/Polyhedron/demo/Polyhedron/Scene.cpp
index c70929ab4a5e..8a66f7fb2cad 100644
--- a/Polyhedron/demo/Polyhedron/Scene.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene.cpp
@@ -15,7 +15,7 @@
 #include <QObject>
 #include <QMetaObject>
 #include <QString>
-#include <QGLWidget>
+#include <QOpenGLWidget>
 #include <QEvent>
 #include <QMouseEvent>
 #include <QPainter>
diff --git a/Polyhedron/demo/Polyhedron/Scene.h b/Polyhedron/demo/Polyhedron/Scene.h
index b661ed7baa83..0724bc577cf3 100644
--- a/Polyhedron/demo/Polyhedron/Scene.h
+++ b/Polyhedron/demo/Polyhedron/Scene.h
@@ -7,7 +7,7 @@
 #include <CGAL/Three/Scene_draw_interface.h>
 #include <CGAL/Three/Viewer_config.h>
 
-#include <QtOpenGL/qgl.h>
+#include <QtOpenGLWidgets>
 #include <QStandardItemModel>
 #include <QString>
 #include <QColor>
diff --git a/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp b/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp
index c831303083d8..1654dadf30bc 100644
--- a/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp
+++ b/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp
@@ -2,6 +2,7 @@
 #include "ui_Show_point_dialog.h"
 
 #include <QClipboard>
+#include <QRegularExpression>
 
 Show_point_dialog::Show_point_dialog(QWidget* parent)
   : QDialog(parent)
@@ -50,7 +51,8 @@ void Show_point_dialog::interprete_string(const QString& string)
     + "|" + not_double_char_re + "+" + double_re
     + ")"
     + "$";
-  QRegExp re(full_re);
+#if 0  // AF @todo  QRegExp had exactMatch() and cap()
+  QRegularExpression re(full_re);
   if(re.exactMatch(string)) {
     // const double x = re.cap(1).toDouble();
     // const double y = re.cap(2).toDouble();
@@ -66,6 +68,7 @@ void Show_point_dialog::interprete_string(const QString& string)
     ui->coord_z->setText(QString());
     m_has_correct_coordinates = false;
   }
+#endif
 }
 
 double Show_point_dialog::get_x() const
diff --git a/Polyhedron/demo/Polyhedron/Viewer.cpp b/Polyhedron/demo/Polyhedron/Viewer.cpp
index 201e15555c50..83182e00bf2e 100644
--- a/Polyhedron/demo/Polyhedron/Viewer.cpp
+++ b/Polyhedron/demo/Polyhedron/Viewer.cpp
@@ -18,6 +18,7 @@
 #include <QStyleFactory>
 #include <QAction>
 #include <QMultipleInputDialog.h>
+#include <QRegularExpression>
 #include <QRegularExpressionMatch>
 #ifdef CGAL_USE_WEBSOCKETS
 #include <QtWebSockets/QWebSocket>
@@ -1838,7 +1839,7 @@ void Viewer::setLighting()
   connect(dialog->position_lineEdit, &QLineEdit::editingFinished,
           [this, dialog]()
   {
-    QStringList list = dialog->position_lineEdit->text().split(QRegExp(","), CGAL_QT_SKIP_EMPTY_PARTS);
+    QStringList list = dialog->position_lineEdit->text().split(QRegularExpression(","), CGAL_QT_SKIP_EMPTY_PARTS);
     if (list.isEmpty()) return;
     if (list.size()!=3){
       QMessageBox *msgBox = new QMessageBox;
diff --git a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
index 0e20273faa76..3b31bce3992e 100644
--- a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
+++ b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
@@ -19,7 +19,7 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
       set(moc_file_name "")
     else()
       set(moc_file_name ${plugin_implementation_base_name}.moc )
-      qt5_generate_moc( ${plugin_implementation_base_name}.cpp "${CMAKE_CURRENT_BINARY_DIR}/${moc_file_name}" )
+      qt6_generate_moc( ${plugin_implementation_base_name}.cpp "${CMAKE_CURRENT_BINARY_DIR}/${moc_file_name}" )
       add_file_dependencies( ${moc_file_name} "${CMAKE_CURRENT_SOURCE_DIR}/${plugin_implementation_base_name}.cpp" )
     endif()
 
@@ -49,7 +49,7 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
               set_property(TEST "compilation_of__demo_framework"
                 APPEND PROPERTY FIXTURES_SETUP "demo_framework_SetupFixture")
               set_property(TEST "compilation_of__demo_framework"
-                APPEND PROPERTY DEPENDS "compilation_of__CGAL_Qt5_moc_and_resources")
+                APPEND PROPERTY DEPENDS "compilation_of__CGAL_Qt6_moc_and_resources")
         endif()
       endif()
     else()
diff --git a/Three/include/CGAL/Three/exceptions.h b/Three/include/CGAL/Three/exceptions.h
index cf3640d5b46a..15fa13cd320d 100644
--- a/Three/include/CGAL/Three/exceptions.h
+++ b/Three/include/CGAL/Three/exceptions.h
@@ -19,9 +19,9 @@
 #include <exception>
 #include <QString>
 #include <QApplication>
-#include <QScriptable>
-#include <QScriptContext>
-#include <QScriptEngine>
+//#include <QScriptable>
+//#include <QScriptContext>
+//#include <QScriptEngine>
 #include <boost/optional.hpp>
 #include <QStringList>
 
@@ -60,6 +60,7 @@ struct Optional_or_bool<void> {
 
 enum Context { CURRENT_CONTEXT, PARENT_CONTEXT };
 
+#if 1 //  AF @todo scripting has changed
 /// This function template wraps a `Callable` that can be called without
 /// any argument (such as a lambda expression without arguments), and in
 /// case the function call is in a Qt Script context, wraps the call in a
@@ -69,7 +70,7 @@ enum Context { CURRENT_CONTEXT, PARENT_CONTEXT };
 template <typename Callable>
 typename Optional_or_bool<typename cpp11::result_of<Callable()>::type>::type
 wrap_a_call_to_cpp(Callable f,
-                   QScriptable* qs = 0,
+                   // QScriptable* qs = 0,
                    const char* file = 0,
                    int line = -1,
                    Context c = CURRENT_CONTEXT) {
@@ -78,12 +79,13 @@ wrap_a_call_to_cpp(Callable f,
   typedef typename O_r_b::type Return_type;
 
   const bool no_try_catch = qApp->property("no-try-catch").toBool();
-  if(no_try_catch || qs == 0 || !qs->context()) return O_r_b::invoke(f);
+  if(no_try_catch /*  || qs == 0 || !qs->context() */ ) return O_r_b::invoke(f);
   else
     try {
       return O_r_b::invoke(f);
     }
     catch(const std::exception& e) {
+#if 0
       const Script_exception* se = dynamic_cast<const Script_exception*>(&e);
       QScriptContext* context = qs->context();
       QStringList qt_bt = context->backtrace();
@@ -121,9 +123,11 @@ wrap_a_call_to_cpp(Callable f,
                     qScriptValueFromSequence(context->engine(), qt_bt));
       std::cerr << "result after throwError: "
                 << qPrintable(v.toString()) << std::endl;
+#endif
       return Return_type();
     }
 }
+#endif 
 
 } // end namespace Three
 } // end namespace CGAL

From b80fbc83d08a059d2cfdc176009636c3216f6e4f Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 20 Apr 2023 08:18:29 +0100
Subject: [PATCH 0211/1398] Fixes for target Mesh_3

---
 .../Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp |  2 +-
 Polyhedron/demo/Polyhedron/Scene_plane_item.cpp   | 15 +++++++++------
 .../Scene_polyhedron_selection_item.cpp           |  2 +-
 3 files changed, 11 insertions(+), 8 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
index 68c3053d876b..f137b7eb46e6 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
@@ -666,7 +666,7 @@ public Q_SLOTS:
     QApplication::setOverrideCursor(Qt::WaitCursor);
     //Control widgets creation
     QLayout* layout = createOrGetDockLayout();
-    QRegExpValidator* validator = new QRegExpValidator(QRegExp("\\d*"), this);
+    QRegularExpressionValidator* validator = new QRegularExpressionValidator(QRegularExpression("\\d*"), this);
     bool show_sliders = true;
     if(x_control == nullptr)
     {
diff --git a/Polyhedron/demo/Polyhedron/Scene_plane_item.cpp b/Polyhedron/demo/Polyhedron/Scene_plane_item.cpp
index ea241f1cd780..ba455ac0cc22 100644
--- a/Polyhedron/demo/Polyhedron/Scene_plane_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_plane_item.cpp
@@ -5,7 +5,7 @@
 #include <CGAL/Three/Three.h>
 #include <QInputDialog>
 #include <QMessageBox>
-#include <QRegExp>
+#include <QRegularExpression>
 #include <QMenu>
 using namespace CGAL::Three;
 typedef Triangle_container Tc;
@@ -307,13 +307,14 @@ void Scene_plane_item::setPlaneOrientation()
 {
   bool does_match = true;
   //check that the result is of the form %1*x + %2*y + %3*z + %4 = 0, modulo the whitespaces.
-  QRegExp rx(
+  QRegularExpression rx(
         "(\\-?\\s*\\d*\\.?\\d*(?:e\\-?\\d*)?)\\s*\\*\\s*x\\s*\\+?\\s*(\\-?\\s*\\d*\\.?\\d*(?:e\\-?\\d*)?)\\s*\\*\\s*y\\s*\\+?\\s*(\\-?\\s*\\d*\\.?\\d*(?:e\\-?\\d*)?)\\s*\\*\\s*z\\s*\\+?\\s*(\\-?\\s*\\d*\\.?\\d*(?:e\\-?\\d*)?)\\s*=\\s*0"
         );
   const CGAL::qglviewer::Vec offset = static_cast<CGAL::Three::Viewer_interface*>(CGAL::QGLViewer::QGLViewerPool().first())->offset();
   QVector3D qoffset(offset.x, offset.y, offset.z);
   const CGAL::qglviewer::Vec& pos = frame->position();
   const CGAL::qglviewer::Vec& n = frame->inverseTransformOf(CGAL::qglviewer::Vec(0.f, 0.f, 1.f));
+  QRegularExpressionMatch match;
   do{
     bool ok;
 
@@ -327,13 +328,15 @@ void Scene_plane_item::setPlaneOrientation()
                                        &ok);
     if(!ok)
       return;
-    does_match = rx.exactMatch(eq);
-    if(!does_match)
+
+    match = rx.match(eq); // AF: exact?
+    // does_match = rx.exactMatch(eq);
+    if(! match.hasMatch())
     {
       QMessageBox::warning(CGAL::Three::Three::mainWindow(),"Error","The input must be of the form a*x+b*y+c*z+d=0");
     }
-  }while(!does_match);
-  double a(rx.cap(1).toDouble()), b(rx.cap(2).toDouble()), c(rx.cap(3).toDouble()), d(rx.cap(4).toDouble());
+  }while(! match.hasMatch());
+  double a(match.captured(1).toDouble()), b(match.captured(2).toDouble()), c(match.captured(3).toDouble()), d(match.captured(4).toDouble());
 
   Kernel_epic::Point_3 sure_point(0,0,0);
   if(c != 0)
diff --git a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
index 561f3f7c8fb7..e6922054fbe2 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
@@ -1830,7 +1830,7 @@ Scene_polyhedron_selection_item::Scene_polyhedron_selection_item(Scene_face_grap
 {
   common_constructor();
   QString sf = poly_item->property("source filename").toString();
-  QRegExp rx("\\.(ts$|off$|obj$|ply$|stl$|surf$|vtk$|vtp$|vtu)");
+  QRegularExpression rx("\\.(ts$|off$|obj$|ply$|stl$|surf$|vtk$|vtp$|vtu)");
   sf.remove(rx);
   if(!sf.isEmpty())
     setProperty("defaultSaveDir", sf);

From bd78a33b206fa0efaae62314a8d96f367e6b55b8 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 20 Apr 2023 09:52:25 +0100
Subject: [PATCH 0212/1398] PMP compiles [skip ci]

---
 .../Classification/Classification_plugin.cpp  |  2 +-
 .../Plugins/PCA/Affine_transform_plugin.cpp   |  2 +-
 .../Plugins/PCA/Basic_generator_plugin.cpp    | 20 +++++++++----------
 .../Scene_edit_polyhedron_item.h              |  6 +++---
 4 files changed, 15 insertions(+), 15 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Classification/Classification_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Classification/Classification_plugin.cpp
index 586c45709638..5ac906e1c560 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Classification/Classification_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Classification/Classification_plugin.cpp
@@ -1389,7 +1389,7 @@ public Q_SLOTS:
 
     QAction* add_selection = label_buttons.back().menu->addAction ("Add selection to training set");
 
-    add_selection->setShortcut(Qt::SHIFT | (Qt::Key_A + (label_button.shortcut - 'a')));
+    add_selection->setShortcut(QKeySequence(Qt::SHIFT | (Qt::Key_A + (label_button.shortcut - 'a'))));
 //    add_selection->setShortcut(Qt::Key_0 + label_buttons.size() - 1);
 
     connect(add_selection,  SIGNAL(triggered()), this,
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
index 9e2af43a3186..a1ca2fe9f62d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
@@ -727,7 +727,7 @@ void Polyhedron_demo_affine_transform_plugin::normalize(Item* item)
   double max = (std::max)((double)tsr.x()-bil.x(), (double)tsr.y()-bil.y());
   max = (std::max)(max, (double)tsr.z()-bil.z());
   QVector3D v_bil= QVector3D(bil.x(),bil.y(),bil.z());
-  QMatrix4x4 frameMat = QMatrix();
+  QMatrix4x4 frameMat = QMatrix4x4();
   QVector3D center(item->center().x,
                    item->center().y,
                    item->center().z);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Basic_generator_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Basic_generator_plugin.cpp
index c7a62533106d..4397d8f9362a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Basic_generator_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Basic_generator_plugin.cpp
@@ -369,7 +369,7 @@ void Basic_generator_plugin::generateCube()
 
     for(int i=0; i<8; ++i)
     {
-      QStringList list = point_texts[i].split(QRegExp("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
+      QStringList list = point_texts[i].split(QRegularExpression("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
       if (list.isEmpty()) return;
       if (list.size()!=3){
         QMessageBox *msgBox = new QMessageBox;
@@ -410,7 +410,7 @@ void Basic_generator_plugin::generateCube()
   else
   {
     QString text = dock_widget->extremaEdit->text();
-    QStringList list = text.split(QRegExp("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
+    QStringList list = text.split(QRegularExpression("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
     if (list.isEmpty()) return;
     if (list.size()!=6){
       QMessageBox *msgBox = new QMessageBox;
@@ -461,7 +461,7 @@ void Basic_generator_plugin::generatePrism()
   bool is_closed = dock_widget->prismCheckBox->isChecked();
 
   QString text = dock_widget->prism_lineEdit->text();
-  QStringList list = text.split(QRegExp("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
+  QStringList list = text.split(QRegularExpression("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
   if (list.isEmpty()) return;
   if (list.size()!=3){
     QMessageBox *msgBox = new QMessageBox;
@@ -508,7 +508,7 @@ void Basic_generator_plugin::generatePyramid()
   bool is_closed = dock_widget->pyramidCheckBox->isChecked();
 
   QString text = dock_widget->pyramid_lineEdit->text();
-  QStringList list = text.split(QRegExp("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
+  QStringList list = text.split(QRegularExpression("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
   if (list.isEmpty()) return;
   if (list.size()!=3){
     QMessageBox *msgBox = new QMessageBox;
@@ -551,7 +551,7 @@ void Basic_generator_plugin::generateSphere()
 {
   int precision = dock_widget->SphereSpinBox->value();
   QString text = dock_widget->center_radius_lineEdit->text();
-  QStringList list = text.split(QRegExp("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
+  QStringList list = text.split(QRegularExpression("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
   if (list.isEmpty()) return;
   if (list.size()!=4){
     QMessageBox *msgBox = new QMessageBox;
@@ -601,7 +601,7 @@ void Basic_generator_plugin::generateTetrahedron()
 
     for (int i = 0; i < 4; ++i)
     {
-      QStringList list = point_texts[i].split(QRegExp("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
+      QStringList list = point_texts[i].split(QRegularExpression("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
       if (list.isEmpty()) return;
       if (list.size() != 3) {
         QMessageBox* msgBox = new QMessageBox;
@@ -635,7 +635,7 @@ void Basic_generator_plugin::generateTetrahedron()
   else
   {
       QString text = dock_widget->point_textEdit_2->toPlainText();
-      QStringList list = text.split(QRegExp("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
+      QStringList list = text.split(QRegularExpression("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
       if (list.isEmpty()) return;
       if (list.size() != 12) {
           QMessageBox* msgBox = new QMessageBox;
@@ -676,7 +676,7 @@ void Basic_generator_plugin::generatePoints()
 {
   QString text = dock_widget->point_textEdit->toPlainText();
   Scene_points_with_normal_item* item = new Scene_points_with_normal_item();
-  QStringList list = text.split(QRegExp("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
+  QStringList list = text.split(QRegularExpression("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
   int counter = 0;
   double coord[3];
   bool ok = true;
@@ -735,7 +735,7 @@ void Basic_generator_plugin::generateLines()
   std::vector<Scene_polylines_item::Point_3>& polyline = *(polylines.rbegin());
   QStringList polylines_metadata;
 
-  QStringList list = text.split(QRegExp("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
+  QStringList list = text.split(QRegularExpression("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
   int counter = 0;
   double coord[3];
   bool ok = true;
@@ -867,7 +867,7 @@ void Basic_generator_plugin::generateGrid()
   bool triangulated = dock_widget->grid_checkBox->isChecked();
   points_text= dock_widget->grid_lineEdit->text();
 
-  QStringList list = points_text.split(QRegExp("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
+  QStringList list = points_text.split(QRegularExpression("\\s+"), CGAL_QT_SKIP_EMPTY_PARTS);
   if (list.isEmpty()) return;
   if (list.size()!=6){
     QMessageBox *msgBox = new QMessageBox;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.h b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.h
index 3fc7b02d1ddf..bd93820384fa 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.h
@@ -26,9 +26,9 @@
 #include <CGAL/Surface_mesh_deformation.h>
 
 #include <boost/iterator/function_output_iterator.hpp>
-#include <QGLBuffer>
-#include <QGLShader>
-#include <QGLShaderProgram>
+#include <QOpenGLBuffer>
+#include <QOpenGLShader>
+#include <QOpenGLShaderProgram>
 
 
 typedef boost::graph_traits<SMesh>::vertex_descriptor sm_vertex_descriptor;

From ab1d7990d2f1fe2275d4d839aa476176bbffa5db Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 20 Apr 2023 11:14:11 +0100
Subject: [PATCH 0213/1398] various fixes [skip ci]

---
 GraphicsView/include/CGAL/Qt/qglviewer_impl.h    |  6 ++----
 Polyhedron/demo/Polyhedron/Show_point_dialog.cpp | 13 ++++++-------
 2 files changed, 8 insertions(+), 11 deletions(-)

diff --git a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
index c8dec4a0725d..e1ead77a2276 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
@@ -2456,10 +2456,8 @@ void CGAL::QGLViewer::setMouseBinding(::Qt::Key key, ::Qt::KeyboardModifiers mod
     mouseBinding_.insert(mbp, map);
 
   ClickBindingPrivate cbp(modifiers, button, false, ::Qt::NoButton, key);
-  
-  // AF: currently results in a runtime error
-  // clickBinding_.remove(cbp);
-  
+  clickBinding_.remove(cbp);
+
 }
 
 
diff --git a/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp b/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp
index 1654dadf30bc..5df594bc57c4 100644
--- a/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp
+++ b/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp
@@ -51,15 +51,16 @@ void Show_point_dialog::interprete_string(const QString& string)
     + "|" + not_double_char_re + "+" + double_re
     + ")"
     + "$";
-#if 0  // AF @todo  QRegExp had exactMatch() and cap()
+
   QRegularExpression re(full_re);
-  if(re.exactMatch(string)) {
+  QRegularExpressionMatch match = re.match(string); // AF @todo  QRegExp had exactMatch()
+  if(match.hasMatch()) {
     // const double x = re.cap(1).toDouble();
     // const double y = re.cap(2).toDouble();
     // const double z = re.cap(3).toDouble();
-    ui->coord_x->setText(QString(re.cap(1)));
-    ui->coord_y->setText(QString(re.cap(2)));
-    ui->coord_z->setText(QString(re.cap(3)));
+    ui->coord_x->setText(QString(match.captured(1)));
+    ui->coord_y->setText(QString(match.captured(2)));
+    ui->coord_z->setText(QString(match.captured(3)));
     m_has_correct_coordinates = true;
   }
   else {
@@ -68,7 +69,6 @@ void Show_point_dialog::interprete_string(const QString& string)
     ui->coord_z->setText(QString());
     m_has_correct_coordinates = false;
   }
-#endif
 }
 
 double Show_point_dialog::get_x() const
@@ -90,4 +90,3 @@ bool Show_point_dialog::has_correct_coordinates() const
 {
   return m_has_correct_coordinates;
 }
-

From c77f1443072722dd9f239303423a0114f9e8c1fb Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 20 Apr 2023 11:38:47 +0100
Subject: [PATCH 0214/1398] various fixes [skip ci]

---
 Polyhedron/demo/Polyhedron/MainWindow.cpp | 13 ++++++-------
 1 file changed, 6 insertions(+), 7 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index 4560cf9aceea..91d3d9b1d47e 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -600,7 +600,7 @@ void MainWindow::enableScriptDebugger(bool b /* = true */)
   this->error(tr("Your version of Qt is too old, and for that reason "
                  "the Qt Script Debugger is not available."));
 }
-#endif 
+#endif
 
 namespace {
 bool actionsByName(QAction* x, QAction* y) {
@@ -2070,17 +2070,16 @@ void MainWindow::on_actionSaveAs_triggered()
                            .arg(item->name()));
           return;
     }
-#if 0 // AF 
+
     Q_FOREACH(QString string, filters)
     {
       QStringList sl = string.split(";;");
       Q_FOREACH(QString s, sl){
-        int pos = extensions.indexIn(s);
-        if( pos >-1)
-          filter_exts.append(extensions.capturedTexts());
+        QRegularExpressionMatch match = extensions.match(s);
+        if(match.hasMatch())
+          filter_exts.append(match.capturedTexts());
       }
     }
-#endif 
 
     filters << tr("All files (*)");
     if(canSavePlugins.isEmpty()) {
@@ -3878,7 +3877,7 @@ void MainWindow::on_actionLoad_a_Scene_from_a_Script_File_triggered()
     if(filename.isEmpty())
       return;
   }
-  
+
   if(do_download){
     QFile tmp_file(filename);
     tmp_file.remove();

From b15e0a1ea256e21a5f904f7ab27404e3ef2a8de1 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 20 Apr 2023 15:54:44 +0100
Subject: [PATCH 0215/1398] Fix 'Save As' [skip ci]

---
 Polyhedron/demo/Polyhedron/MainWindow.cpp | 19 ++++++++-----------
 1 file changed, 8 insertions(+), 11 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index 91d3d9b1d47e..40e14de0d22c 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -1141,25 +1141,22 @@ bool MainWindow::file_matches_filter(const QString& filters,
                                      const QString& filename )
 {
   QFileInfo fileinfo(filename);
-  QString filename_striped=fileinfo.fileName();
+  QString filename_stripped=fileinfo.fileName();
 
   //match all filters between ()
   QRegularExpression all_filters_rx("\\((.*)\\)");
 
   QStringList split_filters = filters.split(";;");
   Q_FOREACH(const QString& filter, split_filters) {
-    //extract filters
-#if 0 // AF @todo
-    if ( all_filters_rx.indexIn(filter)!=-1 ){
-      Q_FOREACH(const QString& pattern,all_filters_rx.cap(1).split(' ')){
-        QRegularExpression rx(pattern);
-        rx.setPatternSyntax(QRegularExpression::Wildcard);
-        if ( rx.exactMatch(filename_striped) ){
-          return true;
+      QRegularExpressionMatch match = all_filters_rx.match(filter);
+      if(match.hasMatch()){
+        for (const QString& pattern : match.captured(1).split(' ')) {
+            QRegularExpressionMatch m = QRegularExpression(QRegularExpression::fromWildcard(pattern)).match(filename_stripped);
+            if (m.hasMatch()) {
+                return true;
+            }
         }
       }
-    }
-#endif
   }
   return false;
 }

From 0574c6ba4cad8e73f0902840490abea8c9da6576 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 20 Apr 2023 16:35:14 +0100
Subject: [PATCH 0216/1398] Change the remaining CMakeLists.txt [skip ci]

---
 .../demo/Alpha_shapes_3/CMakeLists.txt        | 18 +++----
 .../Arrangement_on_surface_2/CMakeLists.txt   | 28 +++++------
 .../demo/Circular_kernel_3/CMakeLists.txt     | 14 +++---
 .../Hyperbolic_triangulation_2/CMakeLists.txt | 20 ++++----
 .../demo/Linear_cell_complex/CMakeLists.txt   | 20 ++++----
 .../CMakeLists.txt                            | 50 +++++++++----------
 .../Periodic_3_triangulation_3/CMakeLists.txt | 44 ++++++++--------
 .../demo/Periodic_Lloyd_3/CMakeLists.txt      | 38 +++++++-------
 .../CMakeLists.txt                            | 16 +++---
 .../Polyline_simplification_2/CMakeLists.txt  | 16 +++---
 .../CMakeLists.txt                            | 38 +++++++-------
 .../demo/Triangulation_3/CMakeLists.txt       | 34 ++++++-------
 .../Triangulation_on_sphere_2/CMakeLists.txt  | 18 +++----
 13 files changed, 177 insertions(+), 177 deletions(-)

diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt b/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt
index ec2a2a8dbb46..b74ed758e222 100644
--- a/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt
@@ -17,11 +17,11 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
 
@@ -29,24 +29,24 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   include_directories(BEFORE ./)
 
   # ui file, created with Qt Designer
-  qt5_wrap_ui(uis MainWindow.ui)
+  qt6_wrap_ui(uis MainWindow.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Alpha_shape_3.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Alpha_shape_3.qrc)
 
   add_executable(
     Alpha_shape_3 Alpha_shape_3.cpp MainWindow.cpp Viewer.cpp ${uis}
-                  ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                  ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Alpha_shape_3)
 
-  target_link_libraries(Alpha_shape_3 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                              Qt5::OpenGL Qt5::Gui)
+  target_link_libraries(Alpha_shape_3 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                              Qt6::OpenGLWidgets Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Alpha_shape_3)
 
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt
index 82e33197dae2..6b221f35824b 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt
@@ -12,10 +12,10 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Core Qt5)
-find_package(Qt5 QUIET COMPONENTS Gui Widgets)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Core Qt6)
+find_package(Qt6 QUIET COMPONENTS Gui Widgets)
 
-if (CGAL_Qt5_FOUND AND Qt5_FOUND)
+if (CGAL_Qt6_FOUND AND Qt6_FOUND)
   include(${CGAL_USE_FILE})
   add_compile_definitions(QT_NO_KEYWORDS)
   include_directories( BEFORE ./ )
@@ -50,7 +50,7 @@ if (CGAL_Qt5_FOUND AND Qt5_FOUND)
   endif()
 
 
-  qt5_wrap_ui(arrangement_2_uis
+  qt6_wrap_ui(arrangement_2_uis
               ArrangementDemoWindow.ui
               NewTabDialog.ui
               OverlayDialog.ui
@@ -58,7 +58,7 @@ if (CGAL_Qt5_FOUND AND Qt5_FOUND)
               AlgebraicCurveInputDialog.ui
               RationalCurveInputDialog.ui)
 
-  qt5_wrap_cpp(CGAL_Qt5_MOC_FILES
+  qt6_wrap_cpp(CGAL_Qt6_MOC_FILES
                ArrangementDemoWindow.h
                ArrangementDemoTab.h
                GraphicsViewCurveInput.h
@@ -70,7 +70,7 @@ if (CGAL_Qt5_FOUND AND Qt5_FOUND)
                ColorItemEditor.h
                PropertyValueDelegate.h)
 
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES Arrangement_on_surface_2.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES Arrangement_on_surface_2.qrc)
 
   add_executable(arrangement_2
                  arrangement_2.cpp
@@ -107,11 +107,11 @@ if (CGAL_Qt5_FOUND AND Qt5_FOUND)
                  ArrangementIO.cpp
                  ${UTILS_COMPILE_FILES}
                  ${arrangement_2_uis}
-                 ${CGAL_Qt5_RESOURCE_FILES}
-                 ${CGAL_Qt5_MOC_FILES})
+                 ${CGAL_Qt6_RESOURCE_FILES}
+                 ${CGAL_Qt6_MOC_FILES})
 
-  target_link_libraries(arrangement_2 PRIVATE Qt5::Core Qt5::Gui Qt5::Widgets)
-  target_link_libraries(arrangement_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5)
+  target_link_libraries(arrangement_2 PRIVATE Qt6::Core Qt6::Gui Qt6::Widgets)
+  target_link_libraries(arrangement_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6)
   if(CGAL_Core_FOUND)
     target_link_libraries(arrangement_2 PRIVATE CGAL::CGAL_Core)
   endif()
@@ -124,11 +124,11 @@ if (CGAL_Qt5_FOUND AND Qt5_FOUND)
 else()
   set(MISSING_DEPS "")
 
-  if(NOT CGAL_Qt5_FOUND)
-    set(MISSING_DEPS "the CGAL Qt5 library, ${MISSING_DEPS}")
+  if(NOT CGAL_Qt6_FOUND)
+    set(MISSING_DEPS "the CGAL Qt6 library, ${MISSING_DEPS}")
   endif()
-  if(NOT Qt5_FOUND)
-    set(MISSING_DEPS "Qt5, ${MISSING_DEPS}")
+  if(NOT Qt6_FOUND)
+    set(MISSING_DEPS "Qt6, ${MISSING_DEPS}")
   endif()
   message("NOTICE: This demo requires ${MISSING_DEPS} and will not be compiled.")
 endif()
diff --git a/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt b/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt
index 54c3be3aba43..85038ef29987 100644
--- a/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt
+++ b/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt
@@ -10,20 +10,20 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidget)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_executable(
     Circular_kernel_3 Circular_kernel_3.cpp Viewer.cpp
-                      ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+                      ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Circular_kernel_3)
 
-  target_link_libraries(Circular_kernel_3 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                                  Qt5::OpenGL Qt5::Gui)
+  target_link_libraries(Circular_kernel_3 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                                  Qt6::OpenGLWidget Qt6::Gui)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Circular_kernel_3)
@@ -33,6 +33,6 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
 
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
index fbdf3791ccbf..7fa99290718d 100644
--- a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
+++ b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
@@ -11,25 +11,25 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Core Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Core Qt6)
 find_package(LEDA QUIET)
 
-# Find Qt5 itself
-find_package(Qt5 QUIET COMPONENTS OpenGL Gui)
+# Find Qt6 itself
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Gui)
 
-if(CGAL_Qt5_FOUND
-   AND Qt5_FOUND
+if(CGAL_Qt6_FOUND
+   AND Qt6_FOUND
    AND (CGAL_Core_FOUND OR LEDA_FOUND))
   # ui files, created with Qt Designer
-  qt5_wrap_ui(UIS HDT2.ui)
+  qt6_wrap_ui(UIS HDT2.ui)
 
-  qt5_add_resources(RESOURCE_FILES resources/Delaunay_triangulation_2.qrc)
+  qt6_add_resources(RESOURCE_FILES resources/Delaunay_triangulation_2.qrc)
 
   # cpp files
-  add_executable ( HDT2 HDT2.cpp ${CGAL_Qt5_RESOURCE_FILES} ${RESOURCE_FILES} ${UIS})
+  add_executable ( HDT2 HDT2.cpp ${CGAL_Qt6_RESOURCE_FILES} ${RESOURCE_FILES} ${UIS})
   target_include_directories(HDT2 PRIVATE ./ ./include)
   add_to_cached_list( CGAL_EXECUTABLE_TARGETS HDT2 )
-  target_link_libraries ( HDT2 CGAL::CGAL CGAL::CGAL_Qt5 Qt5::Widgets)
+  target_link_libraries ( HDT2 CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
   if(CGAL_Core_FOUND)
     target_link_libraries ( HDT2 CGAL::CGAL_Core)
   else()
@@ -39,5 +39,5 @@ if(CGAL_Qt5_FOUND
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test( HDT2 )
 else()
-  message("NOTICE: This demo requires CGAL_Core (or LEDA), and Qt5 and will not be compiled.")
+  message("NOTICE: This demo requires CGAL_Core (or LEDA), and Qt6 and will not be compiled.")
 endif()
diff --git a/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt b/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt
index 66c6e7088aa5..cda51b9191e8 100644
--- a/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt
+++ b/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt
@@ -40,26 +40,26 @@ add_definitions(-DCGAL_PROFILE_LCC_DEMO)
 add_definitions(-DCMAP_WITH_INDEX) # to use cc with index (handle otherwise)
 
 ##################
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Svg)
 
 if(NOT
-   (CGAL_Qt5_FOUND
-    AND Qt5_FOUND))
+   (CGAL_Qt6_FOUND
+    AND Qt6_FOUND))
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 else()
 
   add_definitions(-DCGAL_USE_BASIC_VIEWER -DQT_NO_KEYWORDS)
 
   # ui file, created with Qt Designer
-  qt5_wrap_ui(uis MainWindow.ui CreateMesh.ui CreateMenger.ui
+  qt6_wrap_ui(uis MainWindow.ui CreateMesh.ui CreateMenger.ui
               CreateSierpinskiCarpet.ui CreateSierpinskiTriangle.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Linear_cell_complex_3.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Linear_cell_complex_3.qrc)
 
   add_executable(
     Linear_cell_complex_3_demo
@@ -73,13 +73,13 @@ else()
     MainWindow.h
     Viewer.h
     ${uis}
-    ${CGAL_Qt5_RESOURCE_FILES}
-    ${CGAL_Qt5_MOC_FILES})
+    ${CGAL_Qt6_RESOURCE_FILES}
+    ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Linear_cell_complex_3_demo)
 
   target_link_libraries(Linear_cell_complex_3_demo
-                        PUBLIC CGAL::CGAL CGAL::CGAL_Qt5 Qt5::Gui Qt5::OpenGL)
+                        PUBLIC CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Gui Qt6::OpenGLWidgets)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Linear_cell_complex_3_demo)
diff --git a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
index 96eb570c9c94..bdb94342a0a8 100644
--- a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
+++ b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
@@ -15,15 +15,15 @@ endif()
 # Include this package's headers first
 include_directories(BEFORE ./ ./include)
 
-# Find CGAL and CGAL Qt5
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+# Find CGAL and CGAL Qt6
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-# Find Qt5 itself
-find_package(Qt5 5.4 QUIET COMPONENTS OpenGL)
-if(Qt5_FOUND)
+# Find Qt6 itself
+find_package(Qt6 5.4 QUIET COMPONENTS OpenGLWidgets)
+if(Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
-endif(Qt5_FOUND)
+endif(Qt6_FOUND)
 
 # Find CImg
 find_path(
@@ -39,37 +39,37 @@ else()
                  "Try setting the environment variable CIMG_INC_DIR to point to the path of the directory containing CImg.h.")
 endif()
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   set(SRCS glviewer.cpp scene.cpp Otr2_demo.cpp window.cpp render.cpp)
 
-  set(CGAL_Qt5_MOC_FILES moc_dialog_options.cxx moc_glviewer.cxx moc_window.cxx)
+  set(CGAL_Qt6_MOC_FILES moc_dialog_options.cxx moc_glviewer.cxx moc_window.cxx)
 
   set(UIS pwsrec.ui options.ui)
 
-  qt5_wrap_ui(UI_FILES ${UIS})
+  qt6_wrap_ui(UI_FILES ${UIS})
 
   include(AddFileDependencies)
 
-  qt5_generate_moc("window.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_window.cxx")
+  qt6_generate_moc("window.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_window.cxx")
   add_file_dependencies(moc_window.cxx "${CMAKE_CURRENT_SOURCE_DIR}/window.h")
 
-  qt5_generate_moc("glviewer.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_glviewer.cxx")
+  qt6_generate_moc("glviewer.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_glviewer.cxx")
   add_file_dependencies(moc_glviewer.cxx
                         "${CMAKE_CURRENT_SOURCE_DIR}/glviewer.h")
 
-  qt5_generate_moc("dialog_options.h"
+  qt6_generate_moc("dialog_options.h"
                    "${CMAKE_CURRENT_BINARY_DIR}/moc_dialog_options.cxx")
   add_file_dependencies(moc_dialog_options.cxx
                         "${CMAKE_CURRENT_SOURCE_DIR}/dialog_options.h")
 
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES pwsrec.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES pwsrec.qrc)
 
-  add_executable(Otr2_demo ${SRCS} ${CGAL_Qt5_MOC_FILES} ${UI_FILES}
-                           ${CGAL_Qt5_RESOURCE_FILES})
+  add_executable(Otr2_demo ${SRCS} ${CGAL_Qt6_MOC_FILES} ${UI_FILES}
+                           ${CGAL_Qt6_RESOURCE_FILES})
 
-  target_link_libraries(Otr2_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt5 Qt5::Gui
-                                          Qt5::OpenGL)
+  target_link_libraries(Otr2_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Gui
+                                          Qt6::OpenGLWidgets)
 
   # Link with pthread if necessary
   if(CIMG_INCLUDE_DIR)
@@ -88,21 +88,21 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Otr2_demo)
 else(
-  CGAL_Qt5_FOUND
-  AND Qt5_FOUND)
+  CGAL_Qt6_FOUND
+  AND Qt6_FOUND)
 
   set(OTR2_MISSING_DEPS "")
 
-  if(NOT CGAL_Qt5_FOUND)
-    set(OTR2_MISSING_DEPS "the CGAL Qt5 library, ${OTR2_MISSING_DEPS}")
+  if(NOT CGAL_Qt6_FOUND)
+    set(OTR2_MISSING_DEPS "the CGAL Qt6 library, ${OTR2_MISSING_DEPS}")
   endif()
 
-  if(NOT Qt5_FOUND)
-    set(OTR2_MISSING_DEPS "Qt5.4, ${OTR2_MISSING_DEPS}")
+  if(NOT Qt6_FOUND)
+    set(OTR2_MISSING_DEPS "Qt6.4, ${OTR2_MISSING_DEPS}")
   endif()
 
   message("NOTICE: This demo requires ${OTR2_MISSING_DEPS} and will not be compiled.")
 
 endif(
-  CGAL_Qt5_FOUND
-  AND Qt5_FOUND)
+  CGAL_Qt6_FOUND
+  AND Qt6_FOUND)
diff --git a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
index 3692008579ee..f668d13ffdb0 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
+++ b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
@@ -14,37 +14,37 @@ if(POLICY CMP0071)
 endif()
 
 # Find CGAL
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-# Find Qt5 itself
-find_package(Qt5 QUIET COMPONENTS OpenGL Help Core)
+# Find Qt6 itself
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Help Core)
 
-if(Qt5_FOUND)
+if(Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
-endif(Qt5_FOUND)
+endif(Qt6_FOUND)
 
-if(Qt5Help_VERSION VERSION_LESS 5.12)
-  set(CGAL_QCOLLECTIONGENERATOR_TARGET Qt5::qcollectiongenerator)
+if(Qt6Help_VERSION VERSION_LESS 5.12)
+  set(CGAL_QCOLLECTIONGENERATOR_TARGET Qt6::qcollectiongenerator)
 else()
-  set(CGAL_QCOLLECTIONGENERATOR_TARGET Qt5::qhelpgenerator)
+  set(CGAL_QCOLLECTIONGENERATOR_TARGET Qt6::qhelpgenerator)
 endif()
 
-if(CGAL_Qt5_FOUND
-   AND Qt5_FOUND
+if(CGAL_Qt6_FOUND
+   AND Qt6_FOUND
    AND TARGET ${CGAL_QCOLLECTIONGENERATOR_TARGET})
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(UI_FILES MainWindow.ui)
+  qt6_wrap_ui(UI_FILES MainWindow.ui)
 
   # qrc files (resource files)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Periodic_3_triangulation_3.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Periodic_3_triangulation_3.qrc)
 
   # use the Qt MOC preprocessor on classes that derive from QObject
-  qt5_generate_moc("Scene.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_Scene.cpp")
-  qt5_generate_moc("MainWindow.h"
+  qt6_generate_moc("Scene.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_Scene.cpp")
+  qt6_generate_moc("MainWindow.h"
                    "${CMAKE_CURRENT_BINARY_DIR}/moc_MainWindow.cpp")
-  qt5_generate_moc("Viewer.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_Viewer.cpp")
+  qt6_generate_moc("Viewer.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_Viewer.cpp")
 
   # generate QtAssistant collection file
   add_custom_command(
@@ -66,14 +66,14 @@ if(CGAL_Qt5_FOUND
     MainWindow.ui
     moc_MainWindow.cpp
     ${UI_FILES}
-    ${CGAL_Qt5_RESOURCE_FILES}
-    ${CGAL_Qt5_MOC_FILES}
+    ${CGAL_Qt6_RESOURCE_FILES}
+    ${CGAL_Qt6_MOC_FILES}
     Periodic_3_triangulation_3.qhc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS periodic_3_triangulation_3_demo)
 
   target_link_libraries(periodic_3_triangulation_3_demo
-                        PRIVATE CGAL::CGAL CGAL::CGAL_Qt5 Qt5::OpenGL)
+                        PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::OpenGLWidgets)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(periodic_3_triangulation_3_demo)
@@ -81,14 +81,14 @@ else()
 
   set(PERIODIC_TRIANGULATION_MISSING_DEPS "")
 
-  if(NOT CGAL_Qt5_FOUND)
+  if(NOT CGAL_Qt6_FOUND)
     set(PERIODIC_TRIANGULATION_MISSING_DEPS
-        "the CGAL Qt5 library, ${PERIODIC_TRIANGULATION_MISSING_DEPS}")
+        "the CGAL Qt6 library, ${PERIODIC_TRIANGULATION_MISSING_DEPS}")
   endif()
 
-  if(NOT Qt5_FOUND)
+  if(NOT Qt6_FOUND)
     set(PERIODIC_TRIANGULATION_MISSING_DEPS
-        "Qt5, ${PERIODIC_TRIANGULATION_MISSING_DEPS}")
+        "Qt6, ${PERIODIC_TRIANGULATION_MISSING_DEPS}")
   endif()
 
   if(NOT TARGET ${CGAL_QCOLLECTIONGENERATOR_TARGET})
diff --git a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
index 63284a9ba629..a587c2deb4f8 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
+++ b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
@@ -17,27 +17,27 @@ set(CMAKE_INCLUDE_CURRENT_DIR ON)
 # Instruct CMake to run moc automatically when needed.
 set(CMAKE_AUTOMOC ON)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS Script Help OpenGL Svg)
+find_package(Qt6 QUIET COMPONENTS Help OpenGLWidget Svg)
 
-if(Qt5Help_VERSION VERSION_LESS 5.12)
-  set(CGAL_QCOLLECTIONGENERATOR_TARGET Qt5::qcollectiongenerator)
+if(Qt6Help_VERSION VERSION_LESS 5.12)
+  set(CGAL_QCOLLECTIONGENERATOR_TARGET Qt6::qcollectiongenerator)
 else()
-  set(CGAL_QCOLLECTIONGENERATOR_TARGET Qt5::qhelpgenerator)
+  set(CGAL_QCOLLECTIONGENERATOR_TARGET Qt6::qhelpgenerator)
 endif()
 
-if(CGAL_Qt5_FOUND
-   AND Qt5_FOUND
+if(CGAL_Qt6_FOUND
+   AND Qt6_FOUND
    AND TARGET ${CGAL_QCOLLECTIONGENERATOR_TARGET})
 
   include_directories(BEFORE ./)
 
   # ui file, created with Qt Designer
-  qt5_wrap_ui(uis MainWindow.ui)
+  qt6_wrap_ui(uis MainWindow.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./Periodic_Lloyd_3.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Periodic_Lloyd_3.qrc)
 
   if(DEFINED QT_QCOLLECTIONGENERATOR_EXECUTABLE)
 
@@ -62,29 +62,29 @@ if(CGAL_Qt5_FOUND
     MainWindow.cpp
     Viewer.cpp
     ${uis}
-    ${CGAL_Qt5_RESOURCE_FILES}
-    ${CGAL_Qt5_MOC_FILES})
+    ${CGAL_Qt6_RESOURCE_FILES}
+    ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Periodic_Lloyd_3)
 
-  target_link_libraries(Periodic_Lloyd_3 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                                 Qt5::OpenGL)
+  target_link_libraries(Periodic_Lloyd_3 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                                 Qt6::OpenGLWidget)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Periodic_Lloyd_3)
-else(CGAL_Qt5_FOUND
-  AND Qt5_FOUND
+else(CGAL_Qt6_FOUND
+  AND Qt6_FOUND
   AND QT_QCOLLECTIONGENERATOR_EXECUTABLE)
 
   set(PERIODIC_LLOYD_MISSING_DEPS "")
 
-  if(NOT CGAL_Qt5_FOUND)
+  if(NOT CGAL_Qt6_FOUND)
     set(PERIODIC_LLOYD_MISSING_DEPS
-        "the CGAL Qt5 library, ${PERIODIC_LLOYD_MISSING_DEPS}")
+        "the CGAL Qt6 library, ${PERIODIC_LLOYD_MISSING_DEPS}")
   endif()
 
-  if(NOT Qt5_FOUND)
-    set(PERIODIC_LLOYD_MISSING_DEPS "Qt5, ${PERIODIC_LLOYD_MISSING_DEPS}")
+  if(NOT Qt6_FOUND)
+    set(PERIODIC_LLOYD_MISSING_DEPS "Qt6, ${PERIODIC_LLOYD_MISSING_DEPS}")
   endif()
 
   if(NOT QT_QCOLLECTIONGENERATOR_EXECUTABLE)
diff --git a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
index a2b4110a07f0..cda66cbac6e7 100644
--- a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
+++ b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
@@ -8,28 +8,28 @@ include_directories(${CMAKE_BINARY_DIR})
 # Instruct CMake to run moc automatically when needed.
 set(CMAKE_AUTOMOC ON)
 
-find_package(CGAL REQUIRED COMPONENTS Core Qt5)
+find_package(CGAL REQUIRED COMPONENTS Core Qt6)
 include(${CGAL_USE_FILE})
 
 find_package(LEDA QUIET)
 
-find_package(Qt5 QUIET COMPONENTS Widgets)
+find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
 if((CGAL_Core_FOUND OR LEDA_FOUND)
-   AND Qt5_FOUND
-   AND CGAL_Qt5_FOUND)
+   AND Qt6_FOUND
+   AND CGAL_Qt6_FOUND)
 
   include_directories(BEFORE include)
 
   # ui files, created with Qt Designer
-  qt5_wrap_ui(UIS P4HDT2.ui)
+  qt6_wrap_ui(UIS P4HDT2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(RESOURCE_FILES Main_resources.qrc)
+  qt6_add_resources(RESOURCE_FILES Main_resources.qrc)
 
   # cpp files
   add_executable(P4HDT2 P4HDT2.cpp ${RESOURCE_FILES} ${UIS})
 
-  target_link_libraries(P4HDT2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt5 Qt5::Widgets)
+  target_link_libraries(P4HDT2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
   if(TARGET CGAL::CGAL_Core)
     target_link_libraries(P4HDT2 PRIVATE CGAL::CGAL_Core)
   endif()
@@ -41,5 +41,5 @@ if((CGAL_Core_FOUND OR LEDA_FOUND)
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(P4HDT2)
 else()
-  message("NOTICE: This demo requires Qt5 and will not be compiled.")
+  message("NOTICE: This demo requires Qt6 and will not be compiled.")
 endif()
diff --git a/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt b/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt
index 002fd913902f..f9da2a3bfb7d 100644
--- a/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt
+++ b/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt
@@ -13,33 +13,33 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Widgets Svg)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Widgets Svg)
 
 include_directories(BEFORE ${CMAKE_CURRENT_SOURCE_DIR}/include)
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   set(CMAKE_AUTOMOC ON)
 
   add_definitions(-DQT_NO_KEYWORDS)
 
   # UI files (Qt Designer files)
-  qt5_wrap_ui(CDT_UI_FILES Polyline_simplification_2.ui)
+  qt6_wrap_ui(CDT_UI_FILES Polyline_simplification_2.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES
                     ${CMAKE_CURRENT_SOURCE_DIR}/Polyline_simplification_2.qrc)
 
   # The executable itself.
   add_executable(
     Polyline_simplification_2
     ${CMAKE_CURRENT_SOURCE_DIR}/Polyline_simplification_2.cpp ${CDT_UI_FILES}
-    ${CGAL_Qt5_RESOURCE_FILES} ${CGAL_Qt5_MOC_FILES})
+    ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
 
   target_link_libraries(Polyline_simplification_2
-                        PRIVATE CGAL::CGAL CGAL::CGAL_Qt5 Qt5::Gui)
+                        PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Gui)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Polyline_simplification_2)
 
@@ -48,6 +48,6 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
 
 else()
 
-  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt6, and will not be compiled.")
 
 endif()
diff --git a/Principal_component_analysis/demo/Principal_component_analysis/CMakeLists.txt b/Principal_component_analysis/demo/Principal_component_analysis/CMakeLists.txt
index 6ec0024f3a59..b00178ac2338 100644
--- a/Principal_component_analysis/demo/Principal_component_analysis/CMakeLists.txt
+++ b/Principal_component_analysis/demo/Principal_component_analysis/CMakeLists.txt
@@ -14,8 +14,8 @@ endif()
 
 include_directories(./)
 
-# Find CGAL and CGAL Qt5
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+# Find CGAL and CGAL Qt6
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 find_package(Eigen3 3.1.0 QUIET) #(requires 3.1.0 or greater)
 include(CGAL_Eigen3_support)
@@ -24,52 +24,52 @@ if(NOT TARGET CGAL::Eigen3_support)
   return()
 endif()
 
-# Find Qt5 itself
-find_package(Qt5 QUIET COMPONENTS Script OpenGL)
+# Find Qt6 itself
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
-  qt5_wrap_ui(UI_FILES MainWindow.ui)
+  qt6_wrap_ui(UI_FILES MainWindow.ui)
 
   include(AddFileDependencies)
 
-  qt5_generate_moc("MainWindow.h"
+  qt6_generate_moc("MainWindow.h"
                    "${CMAKE_CURRENT_BINARY_DIR}/MainWindow_moc.cpp")
   add_file_dependencies(MainWindow_moc.cpp
                         "${CMAKE_CURRENT_SOURCE_DIR}/MainWindow.h")
 
-  qt5_generate_moc("Viewer.h" "${CMAKE_CURRENT_BINARY_DIR}/Viewer_moc.cpp")
+  qt6_generate_moc("Viewer.h" "${CMAKE_CURRENT_BINARY_DIR}/Viewer_moc.cpp")
   add_file_dependencies(Viewer_moc.cpp "${CMAKE_CURRENT_SOURCE_DIR}/Viewer.h")
 
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES PCA_demo.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES PCA_demo.qrc)
 
   add_file_dependencies(
     PCA_demo.cpp "${CMAKE_CURRENT_BINARY_DIR}/MainWindow_moc.cpp"
     "${CMAKE_CURRENT_BINARY_DIR}/Viewer_moc.cpp")
-  add_executable(PCA_demo PCA_demo.cpp ${UI_FILES} ${CGAL_Qt5_RESOURCE_FILES}
-                          ${CGAL_Qt5_MOC_FILES})
+  add_executable(PCA_demo PCA_demo.cpp ${UI_FILES} ${CGAL_Qt6_RESOURCE_FILES}
+                          ${CGAL_Qt6_MOC_FILES})
 
-  target_link_libraries(PCA_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                         CGAL::Eigen3_support Qt5::Gui)
+  target_link_libraries(PCA_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
+                                         CGAL::Eigen3_support Qt6::Gui)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS PCA_demo)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(PCA_demo)
 
-else(CGAL_Qt5_FOUND AND Qt5_FOUND)
+else(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   set(PCA_MISSING_DEPS "")
 
-  if(NOT CGAL_Qt5_FOUND)
-    set(PCA_MISSING_DEPS "the CGAL Qt5 library, ${PCA_MISSING_DEPS}")
+  if(NOT CGAL_Qt6_FOUND)
+    set(PCA_MISSING_DEPS "the CGAL Qt6 library, ${PCA_MISSING_DEPS}")
   endif()
 
-  if(NOT Qt5_FOUND)
-    set(PCA_MISSING_DEPS "Qt5, ${PCA_MISSING_DEPS}")
+  if(NOT Qt6_FOUND)
+    set(PCA_MISSING_DEPS "Qt6, ${PCA_MISSING_DEPS}")
   endif()
 
   message("NOTICE: This demo requires ${PCA_MISSING_DEPS} and will not be compiled.")
 
-endif(CGAL_Qt5_FOUND AND Qt5_FOUND)
+endif(CGAL_Qt6_FOUND AND Qt6_FOUND)
diff --git a/Triangulation_3/demo/Triangulation_3/CMakeLists.txt b/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
index d142ca179899..3c4b5f8ad346 100644
--- a/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
+++ b/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
@@ -18,14 +18,14 @@ set(CMAKE_INCLUDE_CURRENT_DIR ON)
 # Instruct CMake to run moc automatically when needed.
 set(CMAKE_AUTOMOC ON)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt5 QUIET COMPONENTS OpenGL)
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets)
 
-if(Qt5_FOUND)
+if(Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
-endif(Qt5_FOUND)
+endif(Qt6_FOUND)
 
 # Activate concurrency ? (turned OFF by default)
 option(CGAL_ACTIVATE_CONCURRENT_TRIANGULATION_3
@@ -45,15 +45,15 @@ else(CGAL_ACTIVATE_CONCURRENT_TRIANGULATION_3)
   endif(LINK_WITH_TBB)
 endif()
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   include_directories(BEFORE ./)
 
   # ui files, created with Qt Designer
-  qt5_wrap_ui(uis MainWindow.ui)
+  qt6_wrap_ui(uis MainWindow.ui)
 
   # qrc files (resources files, that contain icons, at least)
-  qt5_add_resources(CGAL_Qt5_RESOURCE_FILES ./T3_demo.qrc)
+  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./T3_demo.qrc)
 
   # cpp files
   add_executable(
@@ -64,13 +64,13 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
     PreferenceDlg.cpp
     Scene.cpp
     ${uis}
-    ${CGAL_Qt5_RESOURCE_FILES}
-    ${CGAL_Qt5_MOC_FILES})
+    ${CGAL_Qt6_RESOURCE_FILES}
+    ${CGAL_Qt6_MOC_FILES})
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS T3_demo)
 
-  target_link_libraries(T3_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt5)
-  target_link_libraries(T3_demo PRIVATE Qt5::OpenGL)
+  target_link_libraries(T3_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt6)
+  target_link_libraries(T3_demo PRIVATE Qt6::OpenGLWidgets)
   if(TARGET CGAL::TBB_support)
     target_link_libraries(T3_demo PUBLIC CGAL::TBB_support)
   endif()
@@ -81,19 +81,19 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(T3_demo)
 
-else(CGAL_Qt5_FOUND AND Qt5_FOUND)
+else(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   set(TRIANGULATION_3_MISSING_DEPS "")
 
-  if(NOT CGAL_Qt5_FOUND)
+  if(NOT CGAL_Qt6_FOUND)
     set(TRIANGULATION_3_MISSING_DEPS
-        "the CGAL Qt5 library, ${TRIANGULATION_3_MISSING_DEPS}")
+        "the CGAL Qt6 library, ${TRIANGULATION_3_MISSING_DEPS}")
   endif()
 
-  if(NOT Qt5_FOUND)
-    set(TRIANGULATION_3_MISSING_DEPS "Qt5, ${TRIANGULATION_3_MISSING_DEPS}")
+  if(NOT Qt6_FOUND)
+    set(TRIANGULATION_3_MISSING_DEPS "Qt6, ${TRIANGULATION_3_MISSING_DEPS}")
   endif()
 
   message("NOTICE: This demo requires ${TRIANGULATION_3_MISSING_DEPS}, and will not be compiled.")
 
-endif(CGAL_Qt5_FOUND AND Qt5_FOUND)
+endif(CGAL_Qt6_FOUND AND Qt6_FOUND)
diff --git a/Triangulation_on_sphere_2/demo/Triangulation_on_sphere_2/CMakeLists.txt b/Triangulation_on_sphere_2/demo/Triangulation_on_sphere_2/CMakeLists.txt
index c9b21f4d7eef..020c94e50df6 100644
--- a/Triangulation_on_sphere_2/demo/Triangulation_on_sphere_2/CMakeLists.txt
+++ b/Triangulation_on_sphere_2/demo/Triangulation_on_sphere_2/CMakeLists.txt
@@ -20,32 +20,32 @@ if(POLICY CMP0071)
   cmake_policy(SET CMP0071 NEW)
 endif()
 
-# Find CGAL and CGAL Qt5
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+# Find CGAL and CGAL Qt6
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-# Find Qt5 itself
-find_package(Qt5 QUIET COMPONENTS Script OpenGL Gui Svg)
+# Find Qt6 itself
+find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Gui Svg)
 
 find_package(Eigen3 3.1.0 QUIET) #(requires 3.1.0 or greater)
 include(CGAL_Eigen3_support)
 
-if(CGAL_Qt5_FOUND AND Qt5_FOUND AND TARGET CGAL::Eigen3_support)
+if(CGAL_Qt6_FOUND AND Qt6_FOUND AND TARGET CGAL::Eigen3_support)
   # Include this package's headers first
   include_directories(BEFORE ./ ./include)
 
   # ui file, created with Qt Designer
-  qt5_wrap_ui( uis Mainwindow.ui )
+  qt6_wrap_ui( uis Mainwindow.ui )
 
-  #qt5_generate_moc( main.cpp Mainwindow.moc)
+  #qt6_generate_moc( main.cpp Mainwindow.moc)
 
   add_executable  ( Triangulation_on_sphere_2_Demo main.cpp Viewer.cpp ${uis})
 
   add_to_cached_list( CGAL_EXECUTABLE_TARGETS Triangulation_on_sphere_2_Demo )
 
-  target_link_libraries( Triangulation_on_sphere_2_Demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt5 CGAL::Eigen3_support)
+  target_link_libraries( Triangulation_on_sphere_2_Demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 CGAL::Eigen3_support)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test( Triangulation_on_sphere_2_Demo )
 else()
-  message("NOTICE: This demo requires CGAL, Qt5, and Eigen, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL, Qt6, and Eigen, and will not be compiled.")
 endif()

From 7e160aa2bb4daea89c4c222784b7c1ab696043b3 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 21 Apr 2023 14:36:13 +0100
Subject: [PATCH 0217/1398] Hello QJSEngine [skip ci]

---
 AABB_tree/demo/AABB_tree/CMakeLists.txt |  4 +--
 AABB_tree/demo/AABB_tree/MainWindow.cpp | 26 ++++++++++++++++---
 AABB_tree/demo/AABB_tree/MainWindow.h   | 34 +++++++++++++++++++++++++
 3 files changed, 58 insertions(+), 6 deletions(-)

diff --git a/AABB_tree/demo/AABB_tree/CMakeLists.txt b/AABB_tree/demo/AABB_tree/CMakeLists.txt
index 76e9faa655e4..d3042f8eb7c9 100644
--- a/AABB_tree/demo/AABB_tree/CMakeLists.txt
+++ b/AABB_tree/demo/AABB_tree/CMakeLists.txt
@@ -24,7 +24,7 @@ include_directories(BEFORE ./ ./include)
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # Find Qt6 itself
-find_package(Qt6 QUIET COMPONENTS  OpenGLWidgets Gui Svg)
+find_package(Qt6 QUIET COMPONENTS  OpenGLWidgets Gui Svg Qml)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
@@ -53,7 +53,7 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
     #${CGAL_Qt6_MOC_FILES}
   )
   # Link with Qt libraries
-  target_link_libraries(AABB_demo PRIVATE Qt6::OpenGLWidgets Qt6::Gui
+  target_link_libraries(AABB_demo PRIVATE Qt6::OpenGLWidgets Qt6::Gui Qt6::Qml
                                           CGAL::CGAL CGAL::CGAL_Qt6)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS AABB_demo)
diff --git a/AABB_tree/demo/AABB_tree/MainWindow.cpp b/AABB_tree/demo/AABB_tree/MainWindow.cpp
index 95fc4056bf7e..7064d50ba5a3 100644
--- a/AABB_tree/demo/AABB_tree/MainWindow.cpp
+++ b/AABB_tree/demo/AABB_tree/MainWindow.cpp
@@ -13,6 +13,8 @@
 
 #include "ui_MainWindow.h"
 
+
+
 MainWindow::MainWindow(QWidget* parent)
 : CGAL::Qt::DemosMainWindow(parent)
 {
@@ -38,12 +40,25 @@ MainWindow::MainWindow(QWidget* parent)
   connect(this, SIGNAL(openRecentFile(QString)),
     this, SLOT(open(QString)));
 
+  QJSValue mainWindow = myEngine.newQObject(this);
+  myEngine.globalObject().setProperty("main_window", mainWindow);
   readSettings();
+  std::ifstream script("init.js");
+  if(script.good()){
+    std::string line;
+    while(getline(script, line)){
+      myEngine.evaluate(line.c_str());
+    }
+  }
 }
 
 MainWindow::~MainWindow()
 {
   m_pViewer->makeCurrent();
+  // AF I thought this helps to avoid  the exception when the program
+  // terminates, but it does not
+  myEngine.globalObject().setProperty("main_window", QJSValue());
+  myEngine.collectGarbage();
   delete ui;
 }
 
@@ -65,6 +80,13 @@ void MainWindow::dropEvent(QDropEvent *event)
   event->acceptProposedAction();
 }
 
+
+void MainWindow::hello() const
+{
+  std::cout << "Hhello world" << std::endl;
+}
+
+
 void MainWindow::updateViewerBBox()
 {
   m_pScene->update_bbox();
@@ -418,7 +440,3 @@ void MainWindow::on_actionCopy_snapshot_triggered()
   qb->setImage(snapshot);
   QApplication::restoreOverrideCursor();
 }
-
-
-
-
diff --git a/AABB_tree/demo/AABB_tree/MainWindow.h b/AABB_tree/demo/AABB_tree/MainWindow.h
index f768694514b8..7a28f7cde919 100644
--- a/AABB_tree/demo/AABB_tree/MainWindow.h
+++ b/AABB_tree/demo/AABB_tree/MainWindow.h
@@ -2,6 +2,7 @@
 #define MAINWINDOW_H
 
 #include <QOpenGLWidget>
+#include <QJSEngine>
 #include <CGAL/Qt/DemosMainWindow.h>
 
 class QDragEnterEvent;
@@ -12,6 +13,36 @@ namespace Ui {
   class MainWindow;
 }
 
+#if 0
+
+struct Foo : public QObject
+{
+
+  Q_OBJECT
+public:
+  QJSEngine myEngine;
+
+  Foo()
+  {
+      QJSValue baz = myEngine.newQObject(this);
+      myEngine.globalObject().setProperty("baz", baz);
+  }
+
+  void bar()
+  {
+      std::cout << "bar()" << std::endl;
+      myEngine.evaluate("baz.hello()");
+  }
+
+public slots:
+  void hello() const // if not a slot it must be
+  {
+    std::cout << "called hello()" << std::endl;
+  }
+
+};
+#endif
+
 
 class MainWindow :
   public CGAL::Qt::DemosMainWindow
@@ -22,6 +53,8 @@ class MainWindow :
   ~MainWindow();
 
   public slots:
+
+    void hello() const;
     void updateViewerBBox();
     void open(QString filename);
     void setAddKeyFrameKeyboardModifiers(Qt::KeyboardModifiers);
@@ -79,6 +112,7 @@ class MainWindow :
       void on_actionView_cutting_plane_triggered();
 
 private:
+  QJSEngine myEngine;
   Scene* m_pScene;
   Viewer* m_pViewer;
   Ui::MainWindow* ui;

From b4a259c31b28396cbeba31fb831b53ba9a06f538 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 21 Apr 2023 14:36:13 +0100
Subject: [PATCH 0218/1398] Hello QJSEngine [skip ci]

---
 AABB_tree/demo/AABB_tree/init.js | 2 ++
 1 file changed, 2 insertions(+)
 create mode 100644 AABB_tree/demo/AABB_tree/init.js

diff --git a/AABB_tree/demo/AABB_tree/init.js b/AABB_tree/demo/AABB_tree/init.js
new file mode 100644
index 000000000000..e7f08e266c68
--- /dev/null
+++ b/AABB_tree/demo/AABB_tree/init.js
@@ -0,0 +1,2 @@
+main_window.hello();
+main_window.hello();

From fc034c6a5d589cfbf4ed976c1c043c0293ce3f6f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 18:40:39 +0200
Subject: [PATCH 0219/1398] boost::unit -> std::uint

---
 BGL/include/CGAL/boost/graph/IO/STL.h         |  2 +-
 CGAL_ImageIO/include/CGAL/ImageIO/bmptypes.h  |  2 +-
 .../include/CGAL/Image_3_vtk_interface.h      |  6 +--
 ...or_connected_components_in_labeled_image.h |  2 +-
 .../CGAL/Polyhedral_complex_mesh_domain_3.h   |  6 +--
 Number_types/include/CGAL/Mpzf.h              |  6 +--
 .../include/CGAL/known_bit_size_integers.h    |  8 ++--
 .../Number_types/known_bit_size_integers.cpp  |  8 ++--
 Point_set_3/doc/Point_set_3/Point_set_3.txt   |  2 +-
 Point_set_3/include/CGAL/Point_set_3.h        |  2 +-
 Point_set_3/include/CGAL/Point_set_3/IO/PLY.h | 30 ++++++------
 .../Classification/Cluster_classification.cpp | 12 ++---
 .../Point_set_item_classification.cpp         | 12 ++---
 .../Display/Display_property_plugin.cpp       | 48 +++++++++----------
 .../demo/Polyhedron/Scene_image_item.cpp      |  6 +--
 Spatial_searching/include/CGAL/Kd_tree_node.h |  4 +-
 Stream_support/include/CGAL/IO/PLY.h          | 24 +++++-----
 .../include/CGAL/IO/PLY/PLY_reader.h          | 34 ++++++-------
 Stream_support/include/CGAL/IO/STL.h          |  2 +-
 .../include/CGAL/IO/STL/STL_reader.h          |  2 +-
 .../doc/Surface_mesh/Surface_mesh.txt         |  2 +-
 .../include/CGAL/Surface_mesh/IO/PLY.h        | 38 +++++++--------
 .../include/CGAL/Surface_mesh/Surface_mesh.h  |  6 +--
 .../boost/graph/properties_Surface_mesh.h     | 12 ++---
 .../include/CGAL/Face_graph_wrapper.h         |  2 +-
 .../Functors_for_face_graph_wrapper.h         | 12 ++---
 26 files changed, 145 insertions(+), 145 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/IO/STL.h b/BGL/include/CGAL/boost/graph/IO/STL.h
index 7198d8640aa1..d2cb78c45243 100644
--- a/BGL/include/CGAL/boost/graph/IO/STL.h
+++ b/BGL/include/CGAL/boost/graph/IO/STL.h
@@ -264,7 +264,7 @@ bool write_STL(std::ostream& os,
   if(get_mode(os) == BINARY)
   {
     os << "FileType: Binary                                                                ";
-    const boost::uint32_t N32 = static_cast<boost::uint32_t>(faces(g).size());
+    const std::uint32_t N32 = static_cast<std::uint32_t>(faces(g).size());
     os.write(reinterpret_cast<const char *>(&N32), sizeof(N32));
 
     for(const face_descriptor f : faces(g))
diff --git a/CGAL_ImageIO/include/CGAL/ImageIO/bmptypes.h b/CGAL_ImageIO/include/CGAL/ImageIO/bmptypes.h
index c40f95ca3780..83841c5f5792 100644
--- a/CGAL_ImageIO/include/CGAL/ImageIO/bmptypes.h
+++ b/CGAL_ImageIO/include/CGAL/ImageIO/bmptypes.h
@@ -42,7 +42,7 @@ typedef short           CGAL_INT16;
 typedef boost::int32_t  CGAL_INT32;
 typedef unsigned char   CGAL_UINT8;
 typedef unsigned short  CGAL_UINT16;
-typedef boost::uint32_t CGAL_UINT32;
+typedef std::uint32_t CGAL_UINT32;
 
 /*****************************************************************************
 *
diff --git a/CGAL_ImageIO/include/CGAL/Image_3_vtk_interface.h b/CGAL_ImageIO/include/CGAL/Image_3_vtk_interface.h
index 57e8555557d3..d4fa5b776b8f 100644
--- a/CGAL_ImageIO/include/CGAL/Image_3_vtk_interface.h
+++ b/CGAL_ImageIO/include/CGAL/Image_3_vtk_interface.h
@@ -55,7 +55,7 @@ struct VTK_type_generator<char> {
 };
 
 template <>
-struct VTK_type_generator<boost::uint8_t> {
+struct VTK_type_generator<std::uint8_t> {
   static const int type = VTK_UNSIGNED_CHAR;
   typedef vtkUnsignedCharArray ArrayType;
 };
@@ -67,7 +67,7 @@ struct VTK_type_generator<boost::int16_t> {
 };
 
 template <>
-struct VTK_type_generator<boost::uint16_t> {
+struct VTK_type_generator<std::uint16_t> {
   static const int type = VTK_UNSIGNED_SHORT;
   typedef vtkUnsignedShortArray ArrayType;
 };
@@ -79,7 +79,7 @@ struct VTK_type_generator<boost::int32_t> {
 };
 
 template <>
-struct VTK_type_generator<boost::uint32_t> {
+struct VTK_type_generator<std::uint32_t> {
   static const int type = VTK_UNSIGNED_INT;
   typedef vtkUnsignedIntArray ArrayType;
 };
diff --git a/Mesh_3/include/CGAL/Mesh_3/search_for_connected_components_in_labeled_image.h b/Mesh_3/include/CGAL/Mesh_3/search_for_connected_components_in_labeled_image.h
index 343b16ebdc22..70c6d34add02 100644
--- a/Mesh_3/include/CGAL/Mesh_3/search_for_connected_components_in_labeled_image.h
+++ b/Mesh_3/include/CGAL/Mesh_3/search_for_connected_components_in_labeled_image.h
@@ -47,7 +47,7 @@ search_for_connected_components_in_labeled_image(const CGAL::Image_3& image,
   const std::size_t nz = image.zdim();
   const std::size_t size = nx * ny * nz;
 
-  typedef boost::uint16_t uint;
+  typedef std::uint16_t uint;
 
   if(nx > 65535 || ny > 65535 || nz > 65535)
   {
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 17e69ff984cb..72ba8cdaa0cf 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -456,9 +456,9 @@ class Polyhedral_complex_mesh_domain_3
         // here we have a new free vertex on patch #`patch_id`
 
         if(random.uniform_smallint(
-               boost::uint32_t(0),
-               boost::uint32_t(nb_of_free_vertices_on_patch[patch_id]))
-           < boost::uint32_t(needed_vertices_on_patch[patch_id]))
+               std::uint32_t(0),
+               std::uint32_t(nb_of_free_vertices_on_patch[patch_id]))
+           < std::uint32_t(needed_vertices_on_patch[patch_id]))
         {
           several_vertices_on_patch[patch_id].push_back(vit);
           --needed_vertices_on_patch[patch_id];
diff --git a/Number_types/include/CGAL/Mpzf.h b/Number_types/include/CGAL/Mpzf.h
index c2689f3ee455..93cfcd5b30cd 100644
--- a/Number_types/include/CGAL/Mpzf.h
+++ b/Number_types/include/CGAL/Mpzf.h
@@ -188,7 +188,7 @@ template <class T, class = void> struct no_pool {
 };
 
 // Only used with an argument known not to be 0.
-inline int ctz (boost::uint64_t x) {
+inline int ctz (std::uint64_t x) {
 #if defined(_MSC_VER)
   unsigned long ret;
   _BitScanForward64(&ret, x);
@@ -200,7 +200,7 @@ inline int ctz (boost::uint64_t x) {
   return __builtin_ctzll (x);
 #endif
 }
-inline int clz (boost::uint64_t x) {
+inline int clz (std::uint64_t x) {
 #if defined(_MSC_VER)
   unsigned long ret;
   _BitScanReverse64(&ret, x);
@@ -430,7 +430,7 @@ struct Mpzf {
   }
   Mpzf(double d){
     init();
-    using boost::uint64_t;
+    using std::uint64_t;
     union {
 #ifdef CGAL_LITTLE_ENDIAN
       struct { uint64_t man:52; uint64_t exp:11; uint64_t sig:1; } s;
diff --git a/Number_types/include/CGAL/known_bit_size_integers.h b/Number_types/include/CGAL/known_bit_size_integers.h
index 5f9e786701ff..c4871baa3291 100644
--- a/Number_types/include/CGAL/known_bit_size_integers.h
+++ b/Number_types/include/CGAL/known_bit_size_integers.h
@@ -38,15 +38,15 @@ namespace CGAL {
   typedef boost::int16_t   Integer16;
   typedef boost::int32_t   Integer32;
 
-  typedef boost::uint8_t   UInteger8;
-  typedef boost::uint16_t  UInteger16;
-  typedef boost::uint32_t  UInteger32;
+  typedef std::uint8_t   UInteger8;
+  typedef std::uint16_t  UInteger16;
+  typedef std::uint32_t  UInteger32;
 
 #ifndef BOOST_NO_INT64_T
 // this macro is still provided but its use is discouraged
 #   define CGAL_HAS_INTEGER64
   typedef boost::int64_t   Integer64;
-  typedef boost::uint64_t  UInteger64;
+  typedef std::uint64_t  UInteger64;
 #endif
 
 } //namespace CGAL
diff --git a/Number_types/test/Number_types/known_bit_size_integers.cpp b/Number_types/test/Number_types/known_bit_size_integers.cpp
index 0172db54dac2..d7799f602666 100644
--- a/Number_types/test/Number_types/known_bit_size_integers.cpp
+++ b/Number_types/test/Number_types/known_bit_size_integers.cpp
@@ -14,11 +14,11 @@ int main()
   CGAL_static_assertion(sizeof(boost::int64_t) == 8);
 #endif
 
-  CGAL_static_assertion(sizeof(boost::uint8_t)  == 1);
-  CGAL_static_assertion(sizeof(boost::uint16_t) == 2);
-  CGAL_static_assertion(sizeof(boost::uint32_t) == 4);
+  CGAL_static_assertion(sizeof(std::uint8_t)  == 1);
+  CGAL_static_assertion(sizeof(std::uint16_t) == 2);
+  CGAL_static_assertion(sizeof(std::uint32_t) == 4);
 #ifndef BOOST_NO_INT64_T
-  CGAL_static_assertion(sizeof(boost::uint64_t) == 8);
+  CGAL_static_assertion(sizeof(std::uint64_t) == 8);
 #endif
 
   return 0;
diff --git a/Point_set_3/doc/Point_set_3/Point_set_3.txt b/Point_set_3/doc/Point_set_3/Point_set_3.txt
index 449e557d88e0..513659988820 100644
--- a/Point_set_3/doc/Point_set_3/Point_set_3.txt
+++ b/Point_set_3/doc/Point_set_3/Point_set_3.txt
@@ -117,7 +117,7 @@ For example, if the following line is found in the PLY header:
 
 > property uchar red
 
-Then a property named `red` and with type `boost::uint8_t` (`boost`
+Then a property named `red` and with type `std::uint8_t` (`boost`
 types are used because of their fixed memory size) will be
 instantiated in the point set and filled with the corresponding
 values.
diff --git a/Point_set_3/include/CGAL/Point_set_3.h b/Point_set_3/include/CGAL/Point_set_3.h
index 2d0f2083dcc5..70cd87aee043 100644
--- a/Point_set_3/include/CGAL/Point_set_3.h
+++ b/Point_set_3/include/CGAL/Point_set_3.h
@@ -48,7 +48,7 @@ namespace internal {
 #ifdef CGAL_POINT_SET_3_USE_STD_SIZE_T_AS_SIZE_TYPE
     typedef std::size_t size_type;
 #else
-    typedef boost::uint32_t size_type;
+    typedef std::uint32_t size_type;
 #endif
     typedef CGAL::Point_set_3<Point, Vector> Point_set_3;
 
diff --git a/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h b/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h
index 9a9b7fcddb75..147d38e11397 100644
--- a/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h
+++ b/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h
@@ -124,10 +124,10 @@ class Point_set_3_filler
             (new PLY_property_to_point_set_property<boost::int8_t>(m_point_set,
                                                                    name));
       }
-      else if(dynamic_cast<PLY_read_typed_number<boost::uint8_t>*>(property))
+      else if(dynamic_cast<PLY_read_typed_number<std::uint8_t>*>(property))
       {
         m_properties.push_back
-            (new PLY_property_to_point_set_property<boost::uint8_t>(m_point_set,
+            (new PLY_property_to_point_set_property<std::uint8_t>(m_point_set,
                                                                     name));
       }
       else if(dynamic_cast<PLY_read_typed_number<boost::int16_t>*>(property))
@@ -136,10 +136,10 @@ class Point_set_3_filler
             (new PLY_property_to_point_set_property<boost::int16_t>(m_point_set,
                                                                     name));
       }
-      else if(dynamic_cast<PLY_read_typed_number<boost::uint16_t>*>(property))
+      else if(dynamic_cast<PLY_read_typed_number<std::uint16_t>*>(property))
       {
         m_properties.push_back
-            (new PLY_property_to_point_set_property<boost::uint16_t>(m_point_set,
+            (new PLY_property_to_point_set_property<std::uint16_t>(m_point_set,
                                                                      name));
       }
       else if(dynamic_cast<PLY_read_typed_number<boost::int32_t>*>(property))
@@ -148,10 +148,10 @@ class Point_set_3_filler
             (new PLY_property_to_point_set_property<boost::int32_t>(m_point_set,
                                                                     name));
       }
-      else if(dynamic_cast<PLY_read_typed_number<boost::uint32_t>*>(property))
+      else if(dynamic_cast<PLY_read_typed_number<std::uint32_t>*>(property))
       {
         m_properties.push_back
-            (new PLY_property_to_point_set_property<boost::uint32_t>(m_point_set,
+            (new PLY_property_to_point_set_property<std::uint32_t>(m_point_set,
                                                                      name));
       }
       else if(dynamic_cast<PLY_read_typed_number<float>*>(property))
@@ -457,13 +457,13 @@ bool write_PLY(std::ostream& os,
   typedef typename Point_set::Point_map Point_map;
   typedef typename Point_set::Vector_map Vector_map;
   typedef typename Point_set::template Property_map<boost::int8_t> Int8_map;
-  typedef typename Point_set::template Property_map<boost::uint8_t> Uint8_map;
+  typedef typename Point_set::template Property_map<std::uint8_t> Uint8_map;
   typedef typename Point_set::template Property_map<boost::int16_t> Int16_map;
-  typedef typename Point_set::template Property_map<boost::uint16_t> Uint16_map;
+  typedef typename Point_set::template Property_map<std::uint16_t> Uint16_map;
   typedef typename Point_set::template Property_map<boost::int32_t> Int32_map;
-  typedef typename Point_set::template Property_map<boost::uint32_t> Uint32_map;
+  typedef typename Point_set::template Property_map<std::uint32_t> Uint32_map;
   typedef typename Point_set::template Property_map<boost::int64_t> Int64_map;
-  typedef typename Point_set::template Property_map<boost::uint64_t> Uint64_map;
+  typedef typename Point_set::template Property_map<std::uint64_t> Uint64_map;
   typedef typename Point_set::template Property_map<float> Float_map;
   typedef typename Point_set::template Property_map<double> Double_map;
 
@@ -551,7 +551,7 @@ bool write_PLY(std::ostream& os,
     }
     {
       Uint8_map pmap;
-      boost::tie(pmap, okay) = point_set.template property_map<boost::uint8_t>(prop[i]);
+      boost::tie(pmap, okay) = point_set.template property_map<std::uint8_t>(prop[i]);
       if(okay)
       {
         os << "property uchar " << prop[i] << std::endl;
@@ -571,7 +571,7 @@ bool write_PLY(std::ostream& os,
     }
     {
       Uint16_map pmap;
-      boost::tie(pmap, okay) = point_set.template property_map<boost::uint16_t>(prop[i]);
+      boost::tie(pmap, okay) = point_set.template property_map<std::uint16_t>(prop[i]);
       if(okay)
       {
         os << "property ushort " << prop[i] << std::endl;
@@ -591,7 +591,7 @@ bool write_PLY(std::ostream& os,
     }
     {
       Uint32_map pmap;
-      boost::tie(pmap, okay) = point_set.template property_map<boost::uint32_t>(prop[i]);
+      boost::tie(pmap, okay) = point_set.template property_map<std::uint32_t>(prop[i]);
       if(okay)
       {
         os << "property uint " << prop[i] << std::endl;
@@ -611,11 +611,11 @@ bool write_PLY(std::ostream& os,
     }
     {
       Uint64_map pmap;
-      boost::tie(pmap, okay) = point_set.template property_map<boost::uint64_t>(prop[i]);
+      boost::tie(pmap, okay) = point_set.template property_map<std::uint64_t>(prop[i]);
       if(okay)
       {
         os << "property uint " << prop[i] << std::endl;
-        printers.push_back(new internal::Simple_property_printer<Index,Uint64_map,boost::uint32_t>(pmap));
+        printers.push_back(new internal::Simple_property_printer<Index,Uint64_map,std::uint32_t>(pmap));
         continue;
       }
     }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp b/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp
index b919ba2ca6b3..03d16d3eef95 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp
@@ -637,11 +637,11 @@ void Cluster_classification::compute_features (std::size_t nb_scales, float voxe
 
   bool colors = (m_color != Point_set::Property_map<CGAL::IO::Color>());
 
-  Point_set::Property_map<boost::uint8_t> echo_map;
+  Point_set::Property_map<std::uint8_t> echo_map;
   bool echo;
-  boost::tie (echo_map, echo) = m_points->point_set()->template property_map<boost::uint8_t>("echo");
+  boost::tie (echo_map, echo) = m_points->point_set()->template property_map<std::uint8_t>("echo");
   if (!echo)
-    boost::tie (echo_map, echo) = m_points->point_set()->template property_map<boost::uint8_t>("number_of_returns");
+    boost::tie (echo_map, echo) = m_points->point_set()->template property_map<std::uint8_t>("number_of_returns");
 
   Feature_set pointwise_features;
 
@@ -775,15 +775,15 @@ void Cluster_classification::add_remaining_point_set_properties_as_features(Feat
 
     if (try_adding_simple_feature<boost::int8_t>(feature_set, prop[i]))
       continue;
-    if (try_adding_simple_feature<boost::uint8_t>(feature_set, prop[i]))
+    if (try_adding_simple_feature<std::uint8_t>(feature_set, prop[i]))
       continue;
     if (try_adding_simple_feature<boost::int16_t>(feature_set, prop[i]))
       continue;
-    if (try_adding_simple_feature<boost::uint16_t>(feature_set, prop[i]))
+    if (try_adding_simple_feature<std::uint16_t>(feature_set, prop[i]))
       continue;
     if (try_adding_simple_feature<boost::int32_t>(feature_set, prop[i]))
       continue;
-    if (try_adding_simple_feature<boost::uint32_t>(feature_set, prop[i]))
+    if (try_adding_simple_feature<std::uint32_t>(feature_set, prop[i]))
       continue;
     if (try_adding_simple_feature<float>(feature_set, prop[i]))
       continue;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp b/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp
index b6295553e1ad..23aa1094f9e3 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp
@@ -532,11 +532,11 @@ void Point_set_item_classification::compute_features (std::size_t nb_scales, flo
 
   bool colors = (m_color != Point_set::Property_map<CGAL::IO::Color>());
 
-  Point_set::Property_map<boost::uint8_t> echo_map;
+  Point_set::Property_map<std::uint8_t> echo_map;
   bool echo;
-  boost::tie (echo_map, echo) = m_points->point_set()->template property_map<boost::uint8_t>("echo");
+  boost::tie (echo_map, echo) = m_points->point_set()->template property_map<std::uint8_t>("echo");
   if (!echo)
-    boost::tie (echo_map, echo) = m_points->point_set()->template property_map<boost::uint8_t>("number_of_returns");
+    boost::tie (echo_map, echo) = m_points->point_set()->template property_map<std::uint8_t>("number_of_returns");
 
   m_generator = new Generator (*(m_points->point_set()), m_points->point_set()->point_map(), nb_scales, voxel_size);
 
@@ -670,15 +670,15 @@ void Point_set_item_classification::add_remaining_point_set_properties_as_featur
 
     if (try_adding_simple_feature<boost::int8_t>(prop[i]))
       continue;
-    if (try_adding_simple_feature<boost::uint8_t>(prop[i]))
+    if (try_adding_simple_feature<std::uint8_t>(prop[i]))
       continue;
     if (try_adding_simple_feature<boost::int16_t>(prop[i]))
       continue;
-    if (try_adding_simple_feature<boost::uint16_t>(prop[i]))
+    if (try_adding_simple_feature<std::uint16_t>(prop[i]))
       continue;
     if (try_adding_simple_feature<boost::int32_t>(prop[i]))
       continue;
-    if (try_adding_simple_feature<boost::uint32_t>(prop[i]))
+    if (try_adding_simple_feature<std::uint32_t>(prop[i]))
       continue;
     if (try_adding_simple_feature<float>(prop[i]))
       continue;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index af1eef9e115c..3e2f7003882c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -1758,7 +1758,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(ps->template property_map<boost::uint8_t>(name).second)
+    if(ps->template property_map<std::uint8_t>(name).second)
     {
       return true;
     }
@@ -1766,7 +1766,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(ps->template property_map<boost::uint16_t>(name).second)
+    if(ps->template property_map<std::uint16_t>(name).second)
     {
       return true;
     }
@@ -1774,7 +1774,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(ps->template property_map<boost::uint32_t>(name).second)
+    if(ps->template property_map<std::uint32_t>(name).second)
     {
       return true;
     }
@@ -1782,7 +1782,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(ps->template property_map<boost::uint64_t>(name).second)
+    if(ps->template property_map<std::uint64_t>(name).second)
     {
       return true;
     }
@@ -1805,7 +1805,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(sm->template property_map<Simplex,boost::uint8_t>(name).second)
+    if(sm->template property_map<Simplex,std::uint8_t>(name).second)
     {
       return true;
     }
@@ -1813,7 +1813,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(sm->template property_map<Simplex,boost::uint16_t>(name).second)
+    if(sm->template property_map<Simplex,std::uint16_t>(name).second)
     {
       return true;
     }
@@ -1821,7 +1821,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(sm->template property_map<Simplex,boost::uint32_t>(name).second)
+    if(sm->template property_map<Simplex,std::uint32_t>(name).second)
     {
       return true;
     }
@@ -1829,7 +1829,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(sm->template property_map<Simplex,boost::uint64_t>(name).second)
+    if(sm->template property_map<Simplex,std::uint64_t>(name).second)
     {
       return true;
     }
@@ -1847,13 +1847,13 @@ private Q_SLOTS:
   bool DisplayPropertyPlugin::treat_point_property(std::string name, Point_set* ps)
   {
     typedef typename Point_set::template Property_map<boost::int8_t>   Int8_map;
-    typedef typename Point_set::template Property_map<boost::uint8_t>  Uint8_map;
+    typedef typename Point_set::template Property_map<std::uint8_t>  Uint8_map;
     typedef typename Point_set::template Property_map<boost::int16_t>  Int16_map;
-    typedef typename Point_set::template Property_map<boost::uint16_t> Uint16_map;
+    typedef typename Point_set::template Property_map<std::uint16_t> Uint16_map;
     typedef typename Point_set::template Property_map<boost::int32_t>  Int32_map;
-    typedef typename Point_set::template Property_map<boost::uint32_t> Uint32_map;
+    typedef typename Point_set::template Property_map<std::uint32_t> Uint32_map;
     typedef typename Point_set::template Property_map<boost::int64_t>  Int64_map;
-    typedef typename Point_set::template Property_map<boost::uint64_t> Uint64_map;
+    typedef typename Point_set::template Property_map<std::uint64_t> Uint64_map;
     typedef typename Point_set::template Property_map<float>           Float_map;
     typedef typename Point_set::template Property_map<double>          Double_map;
 
@@ -1869,7 +1869,7 @@ private Q_SLOTS:
 
     {
       Uint8_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::uint8_t>(name);
+      std::tie(pmap, okay) = ps->property_map<std::uint8_t>(name);
       if(okay)
       {
         return displayPSProperty(ps, pmap);
@@ -1887,7 +1887,7 @@ private Q_SLOTS:
 
     {
       Uint16_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::uint16_t>(name);
+      std::tie(pmap, okay) = ps->property_map<std::uint16_t>(name);
       if(okay)
       {
         return displayPSProperty(ps, pmap);
@@ -1905,7 +1905,7 @@ private Q_SLOTS:
 
     {
       Uint32_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::uint32_t>(name);
+      std::tie(pmap, okay) = ps->property_map<std::uint32_t>(name);
       if(okay)
       {
         return displayPSProperty(ps, pmap);
@@ -1923,7 +1923,7 @@ private Q_SLOTS:
 
     {
       Uint64_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::uint64_t>(name);
+      std::tie(pmap, okay) = ps->property_map<std::uint64_t>(name);
       if(okay)
       {
         return displayPSProperty(ps, pmap);
@@ -1954,13 +1954,13 @@ private Q_SLOTS:
   bool DisplayPropertyPlugin::treat_sm_property(std::string name, SMesh* sm)
   {
     typedef typename SMesh::template Property_map<TAG, boost::int8_t>   Int8_map;
-    typedef typename SMesh::template Property_map<TAG, boost::uint8_t>  Uint8_map;
+    typedef typename SMesh::template Property_map<TAG, std::uint8_t>  Uint8_map;
     typedef typename SMesh::template Property_map<TAG, boost::int16_t>  Int16_map;
-    typedef typename SMesh::template Property_map<TAG, boost::uint16_t> Uint16_map;
+    typedef typename SMesh::template Property_map<TAG, std::uint16_t> Uint16_map;
     typedef typename SMesh::template Property_map<TAG, boost::int32_t>  Int32_map;
-    typedef typename SMesh::template Property_map<TAG, boost::uint32_t> Uint32_map;
+    typedef typename SMesh::template Property_map<TAG, std::uint32_t> Uint32_map;
     typedef typename SMesh::template Property_map<TAG, boost::int64_t>  Int64_map;
-    typedef typename SMesh::template Property_map<TAG, boost::uint64_t> Uint64_map;
+    typedef typename SMesh::template Property_map<TAG, std::uint64_t> Uint64_map;
     typedef typename SMesh::template Property_map<TAG, float>           Float_map;
     typedef typename SMesh::template Property_map<TAG, double>          Double_map;
 
@@ -1976,7 +1976,7 @@ private Q_SLOTS:
 
     {
       Uint8_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::uint8_t>(name);
+      std::tie(pmap, okay) = sm->property_map<TAG,std::uint8_t>(name);
       if(okay)
       {
         return displaySMProperty(*sm, pmap, TAG());
@@ -1994,7 +1994,7 @@ private Q_SLOTS:
 
     {
       Uint16_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::uint16_t>(name);
+      std::tie(pmap, okay) = sm->property_map<TAG,std::uint16_t>(name);
       if(okay)
       {
         return displaySMProperty(*sm, pmap, TAG());
@@ -2012,7 +2012,7 @@ private Q_SLOTS:
 
     {
       Uint32_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::uint32_t>(name);
+      std::tie(pmap, okay) = sm->property_map<TAG,std::uint32_t>(name);
       if(okay)
       {
         return displaySMProperty(*sm, pmap, TAG());
@@ -2030,7 +2030,7 @@ private Q_SLOTS:
 
     {
       Uint64_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::uint64_t>(name);
+      std::tie(pmap, okay) = sm->property_map<TAG,std::uint64_t>(name);
       if(okay)
       {
         return displaySMProperty(*sm, pmap, TAG());
diff --git a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
index 229aff8a7ffe..24deb8dbc303 100644
--- a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
@@ -548,11 +548,11 @@ template <typename T> const char* whatType(T) { return "unknown"; }    // defaul
 template <> const char* whatType(float) { return "float"; }
 template <> const char* whatType(double) { return "double"; }
 template <> const char* whatType(char) { return "int8_t (char)"; }
-template <> const char* whatType(boost::uint8_t) { return "uint8_t (unsigned char)"; }
+template <> const char* whatType(std::uint8_t) { return "uint8_t (unsigned char)"; }
 template <> const char* whatType(boost::int16_t) { return "int16_t (short)"; }
-template <> const char* whatType(boost::uint16_t) { return "uint16_t (unsigned short)"; }
+template <> const char* whatType(std::uint16_t) { return "uint16_t (unsigned short)"; }
 template <> const char* whatType(boost::int32_t) { return "int32_t (int)"; }
-template <> const char* whatType(boost::uint32_t) { return "uint32_t (unsigned int)"; }
+template <> const char* whatType(std::uint32_t) { return "uint32_t (unsigned int)"; }
 
 template<typename Word>
 QString explicitWordType()
diff --git a/Spatial_searching/include/CGAL/Kd_tree_node.h b/Spatial_searching/include/CGAL/Kd_tree_node.h
index 02af0663d6ab..242b1c9ccc48 100644
--- a/Spatial_searching/include/CGAL/Kd_tree_node.h
+++ b/Spatial_searching/include/CGAL/Kd_tree_node.h
@@ -653,7 +653,7 @@ namespace CGAL {
   private:
 
        // private variables for internal nodes
-    boost::uint8_t cut_dim;
+    std::uint8_t cut_dim;
     FT cut_val;
 
     Node_handle lower_ch, upper_ch;
@@ -714,7 +714,7 @@ namespace CGAL {
 
     inline
     void set_separator(Separator& sep){
-      cut_dim = static_cast<boost::uint8_t>(sep.cutting_dimension());
+      cut_dim = static_cast<std::uint8_t>(sep.cutting_dimension());
       cut_val = sep.cutting_value();
     }
 
diff --git a/Stream_support/include/CGAL/IO/PLY.h b/Stream_support/include/CGAL/IO/PLY.h
index 34dfd1ddba6f..c9623ac455d5 100644
--- a/Stream_support/include/CGAL/IO/PLY.h
+++ b/Stream_support/include/CGAL/IO/PLY.h
@@ -81,13 +81,13 @@ bool read_PLY(std::istream& is,
       bool has_colors = false;
       std::string rtag = "r", gtag = "g", btag = "b";
 
-      if((element.has_property<boost::uint8_t>("red") || element.has_property<boost::uint8_t>("r")) &&
-         (element.has_property<boost::uint8_t>("green") || element.has_property<boost::uint8_t>("g")) &&
-         (element.has_property<boost::uint8_t>("blue") || element.has_property<boost::uint8_t>("b")))
+      if((element.has_property<std::uint8_t>("red") || element.has_property<std::uint8_t>("r")) &&
+         (element.has_property<std::uint8_t>("green") || element.has_property<std::uint8_t>("g")) &&
+         (element.has_property<std::uint8_t>("blue") || element.has_property<std::uint8_t>("b")))
       {
         has_colors = true;
 
-        if(element.has_property<boost::uint8_t>("red"))
+        if(element.has_property<std::uint8_t>("red"))
         {
           rtag = "red";
           gtag = "green";
@@ -106,17 +106,17 @@ bool read_PLY(std::istream& is,
             return false;
         }
 
-        std::tuple<Point_3, boost::uint8_t, boost::uint8_t, boost::uint8_t> new_vertex;
+        std::tuple<Point_3, std::uint8_t, std::uint8_t, std::uint8_t> new_vertex;
         if(has_colors)
         {
           internal::process_properties(element, new_vertex,
                                        make_ply_point_reader(CGAL::make_nth_of_tuple_property_map<0>(new_vertex)),
                                        std::make_pair(CGAL::make_nth_of_tuple_property_map<1>(new_vertex),
-                                                      PLY_property<boost::uint8_t>(rtag.c_str())),
+                                                      PLY_property<std::uint8_t>(rtag.c_str())),
                                        std::make_pair(CGAL::make_nth_of_tuple_property_map<2>(new_vertex),
-                                                      PLY_property<boost::uint8_t>(gtag.c_str())),
+                                                      PLY_property<std::uint8_t>(gtag.c_str())),
                                        std::make_pair(CGAL::make_nth_of_tuple_property_map<3>(new_vertex),
-                                                      PLY_property<boost::uint8_t>(btag.c_str())));
+                                                      PLY_property<std::uint8_t>(btag.c_str())));
 
           *vc_out++ = Color_rgb(get<1>(new_vertex), get<2>(new_vertex), get<3>(new_vertex));
         }
@@ -135,17 +135,17 @@ bool read_PLY(std::istream& is,
       {
         internal::read_PLY_faces<boost::int32_t>(is, element, polygons, fc_out, "vertex_indices");
       }
-      else if(element.has_property<std::vector<boost::uint32_t> >("vertex_indices"))
+      else if(element.has_property<std::vector<std::uint32_t> >("vertex_indices"))
       {
-        internal::read_PLY_faces<boost::uint32_t>(is, element, polygons, fc_out, "vertex_indices");
+        internal::read_PLY_faces<std::uint32_t>(is, element, polygons, fc_out, "vertex_indices");
       }
       else if(element.has_property<std::vector<boost::int32_t> >("vertex_index"))
       {
         internal::read_PLY_faces<boost::int32_t>(is, element, polygons, fc_out, "vertex_index");
       }
-      else if(element.has_property<std::vector<boost::uint32_t> >("vertex_index"))
+      else if(element.has_property<std::vector<std::uint32_t> >("vertex_index"))
       {
-        internal::read_PLY_faces<boost::uint32_t>(is, element, polygons, fc_out, "vertex_index");
+        internal::read_PLY_faces<std::uint32_t>(is, element, polygons, fc_out, "vertex_index");
       }
       else
       {
diff --git a/Stream_support/include/CGAL/IO/PLY/PLY_reader.h b/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
index ddbb1835054c..cd007c256186 100644
--- a/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
+++ b/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
@@ -37,11 +37,11 @@
     m_elements.back().add_property(new PLY_read_typed_list_with_typed_size< SIZE_TYPE , INDEX_TYPE >(name, format))
 
 #define TRY_TO_GENERATE_LIST_PROPERTY(STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE) \
-  TRY_TO_GENERATE_SIZED_LIST_PROPERTY("uchar", "uint8", boost::uint8_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
+  TRY_TO_GENERATE_SIZED_LIST_PROPERTY("uchar", "uint8", std::uint8_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
   else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("char", "int8", boost::int8_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
-  else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("ushort", "uint16", boost::uint16_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
+  else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("ushort", "uint16", std::uint16_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
   else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("short", "int16", boost::int16_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
-  else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("uint", "uint32", boost::uint32_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
+  else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("uint", "uint32", std::uint32_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
   else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("int", "int32", boost::int32_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE)
 
 namespace CGAL {
@@ -530,22 +530,22 @@ class PLY_reader
             }
 
             TRY_TO_GENERATE_LIST_PROPERTY("char", "int8", boost::int8_t);
-            else TRY_TO_GENERATE_LIST_PROPERTY("uchar", "uint8", boost::uint8_t);
+            else TRY_TO_GENERATE_LIST_PROPERTY("uchar", "uint8", std::uint8_t);
             else TRY_TO_GENERATE_LIST_PROPERTY("short", "int16", boost::int16_t);
-            else TRY_TO_GENERATE_LIST_PROPERTY("ushort", "uint16", boost::uint16_t);
+            else TRY_TO_GENERATE_LIST_PROPERTY("ushort", "uint16", std::uint16_t);
             else TRY_TO_GENERATE_LIST_PROPERTY("int", "int32", boost::int32_t);
-            else TRY_TO_GENERATE_LIST_PROPERTY("uint", "uint32", boost::uint32_t);
+            else TRY_TO_GENERATE_LIST_PROPERTY("uint", "uint32", std::uint32_t);
             else TRY_TO_GENERATE_LIST_PROPERTY("float", "float32", float);
             else TRY_TO_GENERATE_LIST_PROPERTY("double", "float64", double);
           }
           else
           {
             TRY_TO_GENERATE_PROPERTY("char", "int8", boost::int8_t);
-            else TRY_TO_GENERATE_PROPERTY("uchar", "uint8", boost::uint8_t);
+            else TRY_TO_GENERATE_PROPERTY("uchar", "uint8", std::uint8_t);
             else TRY_TO_GENERATE_PROPERTY("short", "int16", boost::int16_t);
-            else TRY_TO_GENERATE_PROPERTY("ushort", "uint16", boost::uint16_t);
+            else TRY_TO_GENERATE_PROPERTY("ushort", "uint16", std::uint16_t);
             else TRY_TO_GENERATE_PROPERTY("int", "int32", boost::int32_t);
-            else TRY_TO_GENERATE_PROPERTY("uint", "uint32", boost::uint32_t);
+            else TRY_TO_GENERATE_PROPERTY("uint", "uint32", std::uint32_t);
             else TRY_TO_GENERATE_PROPERTY("float", "float32", float);
             else TRY_TO_GENERATE_PROPERTY("double", "float64", double);
           }
@@ -711,12 +711,12 @@ bool read_PLY_faces(std::istream& in,
   bool has_colors = false;
   std::string rtag = "r", gtag = "g", btag = "b";
 
-  if((element.has_property<boost::uint8_t>("red") || element.has_property<boost::uint8_t>("r")) &&
-     (element.has_property<boost::uint8_t>("green") || element.has_property<boost::uint8_t>("g")) &&
-     (element.has_property<boost::uint8_t>("blue") || element.has_property<boost::uint8_t>("b")))
+  if((element.has_property<std::uint8_t>("red") || element.has_property<std::uint8_t>("r")) &&
+     (element.has_property<std::uint8_t>("green") || element.has_property<std::uint8_t>("g")) &&
+     (element.has_property<std::uint8_t>("blue") || element.has_property<std::uint8_t>("b")))
   {
     has_colors = true;
-    if(element.has_property<boost::uint8_t>("red"))
+    if(element.has_property<std::uint8_t>("red"))
     {
       rtag = "red";
       gtag = "green";
@@ -735,7 +735,7 @@ bool read_PLY_faces(std::istream& in,
         return false;
     }
 
-    std::tuple<std::vector<Integer>, boost::uint8_t, boost::uint8_t, boost::uint8_t> new_face;
+    std::tuple<std::vector<Integer>, std::uint8_t, std::uint8_t, std::uint8_t> new_face;
 
     if(has_colors)
     {
@@ -743,11 +743,11 @@ bool read_PLY_faces(std::istream& in,
                          std::make_pair(CGAL::make_nth_of_tuple_property_map<0>(new_face),
                                         PLY_property<std::vector<Integer> >(vertex_indices_tag)),
                          std::make_pair(CGAL::make_nth_of_tuple_property_map<1>(new_face),
-                                        PLY_property<boost::uint8_t>(rtag.c_str())),
+                                        PLY_property<std::uint8_t>(rtag.c_str())),
                          std::make_pair(CGAL::make_nth_of_tuple_property_map<2>(new_face),
-                                        PLY_property<boost::uint8_t>(gtag.c_str())),
+                                        PLY_property<std::uint8_t>(gtag.c_str())),
                          std::make_pair(CGAL::make_nth_of_tuple_property_map<3>(new_face),
-                                        PLY_property<boost::uint8_t>(btag.c_str())));
+                                        PLY_property<std::uint8_t>(btag.c_str())));
 
       *fc_out++ = Color_rgb(get<1>(new_face), get<2>(new_face), get<3>(new_face));
     }
diff --git a/Stream_support/include/CGAL/IO/STL.h b/Stream_support/include/CGAL/IO/STL.h
index d2c31b00cf85..dfa3ecded7ea 100644
--- a/Stream_support/include/CGAL/IO/STL.h
+++ b/Stream_support/include/CGAL/IO/STL.h
@@ -308,7 +308,7 @@ bool write_STL(std::ostream& os,
   if(get_mode(os) == BINARY)
   {
     os << "FileType: Binary                                                                ";
-    const boost::uint32_t N32 = static_cast<boost::uint32_t>(facets.size());
+    const std::uint32_t N32 = static_cast<std::uint32_t>(facets.size());
     os.write(reinterpret_cast<const char *>(&N32), sizeof(N32));
 
     for(const Triangle& face : facets)
diff --git a/Stream_support/include/CGAL/IO/STL/STL_reader.h b/Stream_support/include/CGAL/IO/STL/STL_reader.h
index 919ceeddd56d..16970596d098 100644
--- a/Stream_support/include/CGAL/IO/STL/STL_reader.h
+++ b/Stream_support/include/CGAL/IO/STL/STL_reader.h
@@ -209,7 +209,7 @@ bool parse_binary_STL(std::istream& is,
   int index = 0;
   std::map<Point, int> index_map;
 
-  boost::uint32_t N32;
+  std::uint32_t N32;
   if(!(is.read(reinterpret_cast<char*>(&N32), sizeof(N32))))
   {
     if(verbose)
diff --git a/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt b/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt
index 82555e4488cc..e7a521eaaabc 100644
--- a/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt
+++ b/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt
@@ -398,7 +398,7 @@ Result of the run of the draw_surface_mesh program. A window shows the surface m
 
 \section sectionSurfaceMeshImplementation Implementation Details
 
-As integer type for the indices we have chosen `boost::uint32_t`. On 64 bit operating systems they
+As integer type for the indices we have chosen `std::uint32_t`. On 64 bit operating systems they
 take only half the size of a pointer. They still allow to have meshes with 2 billion elements.
 
 We use `std::vector` for storing properties. So by accessing the address
diff --git a/Surface_mesh/include/CGAL/Surface_mesh/IO/PLY.h b/Surface_mesh/include/CGAL/Surface_mesh/IO/PLY.h
index 8e274941fc1a..dac77f788dd4 100644
--- a/Surface_mesh/include/CGAL/Surface_mesh/IO/PLY.h
+++ b/Surface_mesh/include/CGAL/Surface_mesh/IO/PLY.h
@@ -146,7 +146,7 @@ class Surface_mesh_filler
     if(name == "vertex_indices" || name == "vertex_index")
     {
       CGAL_assertion(dynamic_cast<PLY_read_typed_list<boost::int32_t>*>(property)
-                     || dynamic_cast<PLY_read_typed_list<boost::uint32_t>*>(property));
+                     || dynamic_cast<PLY_read_typed_list<std::uint32_t>*>(property));
       m_index_tag  = name;
       m_use_int32_t = dynamic_cast<PLY_read_typed_list<boost::int32_t>*>(property);
       return true;
@@ -222,25 +222,25 @@ class Surface_mesh_filler
       {
         properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, boost::int8_t>(m_mesh, name));
       }
-      else if(dynamic_cast<PLY_read_typed_number<boost::uint8_t>*>(property))
+      else if(dynamic_cast<PLY_read_typed_number<std::uint8_t>*>(property))
       {
-        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, boost::uint8_t>(m_mesh, name));
+        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, std::uint8_t>(m_mesh, name));
       }
       else if(dynamic_cast<PLY_read_typed_number<boost::int16_t>*>(property))
       {
         properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, boost::int16_t>(m_mesh, name));
       }
-      else if(dynamic_cast<PLY_read_typed_number<boost::uint16_t>*>(property))
+      else if(dynamic_cast<PLY_read_typed_number<std::uint16_t>*>(property))
       {
-        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, boost::uint16_t>(m_mesh, name));
+        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, std::uint16_t>(m_mesh, name));
       }
       else if(dynamic_cast<PLY_read_typed_number<boost::int32_t>*>(property))
       {
         properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, boost::int32_t>(m_mesh, name));
       }
-      else if(dynamic_cast<PLY_read_typed_number<boost::uint32_t>*>(property))
+      else if(dynamic_cast<PLY_read_typed_number<std::uint32_t>*>(property))
       {
-        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, boost::uint32_t>(m_mesh, name));
+        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, std::uint32_t>(m_mesh, name));
       }
       else if(dynamic_cast<PLY_read_typed_number<float>*>(property))
       {
@@ -316,7 +316,7 @@ class Surface_mesh_filler
     if(m_use_int32_t)
       process_line<boost::int32_t>(element, fi);
     else
-      process_line<boost::uint32_t>(element, fi);
+      process_line<std::uint32_t>(element, fi);
 
     if(fi == Surface_mesh::null_face())
       return false;
@@ -370,7 +370,7 @@ class Surface_mesh_filler
     if(m_use_int32_t)
       process_line<boost::int32_t>(element, ei);
     else
-      process_line<boost::uint32_t>(element, ei);
+      process_line<std::uint32_t>(element, ei);
 
     if(ei == Surface_mesh::null_edge())
       return false;
@@ -403,7 +403,7 @@ class Surface_mesh_filler
     if(m_use_int32_t)
       process_line<boost::int32_t>(element, hi);
     else
-      process_line<boost::uint32_t>(element, hi);
+      process_line<std::uint32_t>(element, hi);
 
     if(hi == Surface_mesh::null_halfedge())
       return false;
@@ -641,13 +641,13 @@ void fill_header(std::ostream& os, const Surface_mesh<Point>& sm,
 {
   typedef Surface_mesh<Point>                                             SMesh;
   typedef typename SMesh::template Property_map<Simplex, boost::int8_t>   Int8_map;
-  typedef typename SMesh::template Property_map<Simplex, boost::uint8_t>  Uint8_map;
+  typedef typename SMesh::template Property_map<Simplex, std::uint8_t>  Uint8_map;
   typedef typename SMesh::template Property_map<Simplex, boost::int16_t>  Int16_map;
-  typedef typename SMesh::template Property_map<Simplex, boost::uint16_t> Uint16_map;
+  typedef typename SMesh::template Property_map<Simplex, std::uint16_t> Uint16_map;
   typedef typename SMesh::template Property_map<Simplex, boost::int32_t>  Int32_map;
-  typedef typename SMesh::template Property_map<Simplex, boost::uint32_t> Uint32_map;
+  typedef typename SMesh::template Property_map<Simplex, std::uint32_t> Uint32_map;
   typedef typename SMesh::template Property_map<Simplex, boost::int64_t>  Int64_map;
-  typedef typename SMesh::template Property_map<Simplex, boost::uint64_t> Uint64_map;
+  typedef typename SMesh::template Property_map<Simplex, std::uint64_t> Uint64_map;
   typedef typename SMesh::template Property_map<Simplex, float>           Float_map;
   typedef typename SMesh::template Property_map<Simplex, double>          Double_map;
 
@@ -721,7 +721,7 @@ void fill_header(std::ostream& os, const Surface_mesh<Point>& sm,
     }
     {
       Uint8_map pmap;
-      boost::tie(pmap, okay) = sm.template property_map<Simplex,boost::uint8_t>(prop[i]);
+      boost::tie(pmap, okay) = sm.template property_map<Simplex,std::uint8_t>(prop[i]);
       if(okay)
       {
         os << "property uchar " << name << std::endl;
@@ -741,7 +741,7 @@ void fill_header(std::ostream& os, const Surface_mesh<Point>& sm,
     }
     {
       Uint16_map pmap;
-      boost::tie(pmap, okay) = sm.template property_map<Simplex,boost::uint16_t>(prop[i]);
+      boost::tie(pmap, okay) = sm.template property_map<Simplex,std::uint16_t>(prop[i]);
       if(okay)
       {
         os << "property ushort " << name << std::endl;
@@ -761,7 +761,7 @@ void fill_header(std::ostream& os, const Surface_mesh<Point>& sm,
     }
     {
       Uint32_map pmap;
-      boost::tie(pmap, okay) = sm.template property_map<Simplex,boost::uint32_t>(prop[i]);
+      boost::tie(pmap, okay) = sm.template property_map<Simplex,std::uint32_t>(prop[i]);
       if(okay)
       {
         os << "property uint " << name << std::endl;
@@ -781,11 +781,11 @@ void fill_header(std::ostream& os, const Surface_mesh<Point>& sm,
     }
     {
       Uint64_map pmap;
-      boost::tie(pmap, okay) = sm.template property_map<Simplex,boost::uint64_t>(prop[i]);
+      boost::tie(pmap, okay) = sm.template property_map<Simplex,std::uint64_t>(prop[i]);
       if(okay)
       {
         os << "property uint " << name << std::endl;
-        printers.push_back(new internal::Simple_property_printer<Simplex,Uint64_map,boost::uint32_t>(pmap));
+        printers.push_back(new internal::Simple_property_printer<Simplex,Uint64_map,std::uint32_t>(pmap));
         continue;
       }
     }
diff --git a/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h b/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
index 47232cbabd51..8a4b5c0921ee 100644
--- a/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
+++ b/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
@@ -60,7 +60,7 @@ namespace CGAL {
     class SM_Index
     {
     public:
-    typedef boost::uint32_t size_type;
+    typedef std::uint32_t size_type;
         /// Constructor. %Default construction creates an invalid index.
         /// We write -1, which is <a href="https://en.cppreference.com/w/cpp/types/numeric_limits">
         /// <tt>(std::numeric_limits<size_type>::max)()</tt></a>
@@ -239,7 +239,7 @@ namespace CGAL {
     class SM_Edge_index
     {
     public:
-        typedef boost::uint32_t size_type;
+        typedef std::uint32_t size_type;
 
         SM_Edge_index() : halfedge_((std::numeric_limits<size_type>::max)()) { }
 
@@ -364,7 +364,7 @@ class Surface_mesh
     typedef P Point;
 
     /// The type used to represent an index.
-    typedef boost::uint32_t size_type;
+    typedef std::uint32_t size_type;
 
     ///@}
 
diff --git a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h
index 5bff49ebab5b..b05395d26427 100644
--- a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h
+++ b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h
@@ -71,8 +71,8 @@ class SM_index_pmap
 {
 public:
   typedef boost::readable_property_map_tag category;
-  typedef boost::uint32_t                  value_type;
-  typedef boost::uint32_t                  reference;
+  typedef std::uint32_t                  value_type;
+  typedef std::uint32_t                  reference;
   typedef VEF                              key_type;
 
   value_type operator[](const key_type& vd) const
@@ -260,13 +260,13 @@ namespace internal {
      const TYPE& x)                                                \
  { return get(get(p, sm), x); }                                        \
 
-CGAL_SM_INTRINSIC_PROPERTY(boost::uint32_t, boost::vertex_index_t,
+CGAL_SM_INTRINSIC_PROPERTY(std::uint32_t, boost::vertex_index_t,
 SM_Vertex_index)
-CGAL_SM_INTRINSIC_PROPERTY(boost::uint32_t, boost::edge_index_t,
+CGAL_SM_INTRINSIC_PROPERTY(std::uint32_t, boost::edge_index_t,
 SM_Edge_index)
-CGAL_SM_INTRINSIC_PROPERTY(boost::uint32_t, boost::halfedge_index_t,
+CGAL_SM_INTRINSIC_PROPERTY(std::uint32_t, boost::halfedge_index_t,
 SM_Halfedge_index)
-CGAL_SM_INTRINSIC_PROPERTY(boost::uint32_t, boost::face_index_t,
+CGAL_SM_INTRINSIC_PROPERTY(std::uint32_t, boost::face_index_t,
 SM_Face_index)
 CGAL_SM_INTRINSIC_PROPERTY(Point&, CGAL::vertex_point_t, SM_Vertex_index)
 
diff --git a/Surface_mesh_topology/include/CGAL/Face_graph_wrapper.h b/Surface_mesh_topology/include/CGAL/Face_graph_wrapper.h
index b44c70ef305c..661b69eb94dd 100644
--- a/Surface_mesh_topology/include/CGAL/Face_graph_wrapper.h
+++ b/Surface_mesh_topology/include/CGAL/Face_graph_wrapper.h
@@ -40,7 +40,7 @@ class Face_graph_wrapper
 public:
   typedef HEG_                    HEG;
   typedef Face_graph_wrapper<HEG> Self;
-  typedef boost::uint32_t /*std::size_t*/ size_type;
+  typedef std::uint32_t /*std::size_t*/ size_type;
   typedef Self                    Refs;
 
   struct Dart_container
diff --git a/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Functors_for_face_graph_wrapper.h b/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Functors_for_face_graph_wrapper.h
index ea5b79e2bfb3..200ffb829379 100644
--- a/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Functors_for_face_graph_wrapper.h
+++ b/Surface_mesh_topology/include/CGAL/Surface_mesh_topology/internal/Functors_for_face_graph_wrapper.h
@@ -71,7 +71,7 @@ struct Get_beta<HEG, 2>
 template<typename Mesh>
 struct Index_from_halfedge_descriptor
 {
-  typedef boost::uint32_t size_type;
+  typedef std::uint32_t size_type;
   typedef typename boost::template graph_traits<Mesh>::halfedge_descriptor
   halfedge_descriptor;
 
@@ -88,7 +88,7 @@ template<typename P>
 struct Index_from_halfedge_descriptor<CGAL::Surface_mesh<P> >
 {
   using Mesh=CGAL::Surface_mesh<P>;
-  typedef boost::uint32_t size_type;
+  typedef std::uint32_t size_type;
   typedef typename boost::template graph_traits<Mesh>::halfedge_descriptor
   halfedge_descriptor;
 
@@ -99,7 +99,7 @@ struct Index_from_halfedge_descriptor<CGAL::Surface_mesh<P> >
 template<typename Mesh>
 struct Halfedge_descriptor_from_index
 {
-  typedef boost::uint32_t size_type;
+  typedef std::uint32_t size_type;
   typedef typename boost::template graph_traits<Mesh>::halfedge_descriptor
   halfedge_descriptor;
 
@@ -115,7 +115,7 @@ template<typename P>
 struct Halfedge_descriptor_from_index<CGAL::Surface_mesh<P> >
 {
   using Mesh=CGAL::Surface_mesh<P>;
-  typedef boost::uint32_t size_type;
+  typedef std::uint32_t size_type;
   typedef typename boost::template graph_traits<Mesh>::halfedge_descriptor
   halfedge_descriptor;
 
@@ -126,7 +126,7 @@ struct Halfedge_descriptor_from_index<CGAL::Surface_mesh<P> >
 template<typename Mesh>
 struct Is_index_used
 {
-  typedef boost::uint32_t size_type;
+  typedef std::uint32_t size_type;
 
   static bool run(const Mesh& m, size_type i)
   { return i<m.size_of_halfedges(); }
@@ -135,7 +135,7 @@ template<typename P>
 struct Is_index_used<CGAL::Surface_mesh<P> >
 {
   using Mesh=CGAL::Surface_mesh<P>;
-  typedef boost::uint32_t size_type;
+  typedef std::uint32_t size_type;
 
   static bool run(const Mesh& m, size_type i)
   { return i<(m.number_of_halfedges()+m.number_of_removed_halfedges()) &&

From 99e7f4806a1c8b18b98a76c7b4ba39d345e55c70 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 18:43:10 +0200
Subject: [PATCH 0220/1398] boost::int -> std::int

---
 CGAL_ImageIO/include/CGAL/ImageIO/bmptypes.h  |  2 +-
 .../include/CGAL/Image_3_vtk_interface.h      |  4 +-
 .../Hyperbolic_triangulation_face_base_2.h    |  2 +-
 .../include/CGAL/known_bit_size_integers.h    |  8 ++--
 .../Number_types/known_bit_size_integers.cpp  |  8 ++--
 .../Point_set_3/point_set_read_ply.cpp        |  4 +-
 Point_set_3/include/CGAL/Point_set_3/IO/PLY.h | 30 ++++++------
 .../Classification/Cluster_classification.cpp |  6 +--
 .../Point_set_item_classification.cpp         |  6 +--
 .../Display/Display_property_plugin.cpp       | 48 +++++++++----------
 .../demo/Polyhedron/Scene_image_item.cpp      |  4 +-
 Random_numbers/include/CGAL/Random_impl.h     |  6 +--
 Spatial_searching/include/CGAL/Kd_tree_node.h |  4 +-
 .../CGAL/IO/OFF/File_header_OFF_impl.h        |  2 +-
 .../include/CGAL/IO/OFF/File_scanner_OFF.h    |  8 ++--
 .../include/CGAL/IO/OFF/File_writer_OFF.h     |  4 +-
 Stream_support/include/CGAL/IO/PLY.h          |  8 ++--
 .../include/CGAL/IO/PLY/PLY_reader.h          | 18 +++----
 .../include/CGAL/Surface_mesh/IO/PLY.h        | 40 ++++++++--------
 .../Triangulation_3/test_regular_remove_3.cpp |  2 +-
 20 files changed, 107 insertions(+), 107 deletions(-)

diff --git a/CGAL_ImageIO/include/CGAL/ImageIO/bmptypes.h b/CGAL_ImageIO/include/CGAL/ImageIO/bmptypes.h
index 83841c5f5792..9c27b948b3d3 100644
--- a/CGAL_ImageIO/include/CGAL/ImageIO/bmptypes.h
+++ b/CGAL_ImageIO/include/CGAL/ImageIO/bmptypes.h
@@ -39,7 +39,7 @@
 
 typedef char            CGAL_INT8;
 typedef short           CGAL_INT16;
-typedef boost::int32_t  CGAL_INT32;
+typedef std::int32_t  CGAL_INT32;
 typedef unsigned char   CGAL_UINT8;
 typedef unsigned short  CGAL_UINT16;
 typedef std::uint32_t CGAL_UINT32;
diff --git a/CGAL_ImageIO/include/CGAL/Image_3_vtk_interface.h b/CGAL_ImageIO/include/CGAL/Image_3_vtk_interface.h
index d4fa5b776b8f..99a7f528f17e 100644
--- a/CGAL_ImageIO/include/CGAL/Image_3_vtk_interface.h
+++ b/CGAL_ImageIO/include/CGAL/Image_3_vtk_interface.h
@@ -61,7 +61,7 @@ struct VTK_type_generator<std::uint8_t> {
 };
 
 template <>
-struct VTK_type_generator<boost::int16_t> {
+struct VTK_type_generator<std::int16_t> {
   static const int type = VTK_SHORT;
   typedef vtkShortArray ArrayType;
 };
@@ -73,7 +73,7 @@ struct VTK_type_generator<std::uint16_t> {
 };
 
 template <>
-struct VTK_type_generator<boost::int32_t> {
+struct VTK_type_generator<std::int32_t> {
   static const int type = VTK_INT;
   typedef vtkIntArray ArrayType;
 };
diff --git a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_face_base_2.h b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_face_base_2.h
index 32d730aab7c3..724f45794e65 100644
--- a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_face_base_2.h
+++ b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_face_base_2.h
@@ -23,7 +23,7 @@ namespace CGAL {
 
 class Hyperbolic_data
 {
-  typedef boost::int8_t Id;
+  typedef std::int8_t Id;
 
 private:
   // - 2 for infinite face
diff --git a/Number_types/include/CGAL/known_bit_size_integers.h b/Number_types/include/CGAL/known_bit_size_integers.h
index c4871baa3291..c5bc43fed546 100644
--- a/Number_types/include/CGAL/known_bit_size_integers.h
+++ b/Number_types/include/CGAL/known_bit_size_integers.h
@@ -34,9 +34,9 @@
 
 namespace CGAL {
 
-  typedef boost::int8_t    Integer8;
-  typedef boost::int16_t   Integer16;
-  typedef boost::int32_t   Integer32;
+  typedef std::int8_t    Integer8;
+  typedef std::int16_t   Integer16;
+  typedef std::int32_t   Integer32;
 
   typedef std::uint8_t   UInteger8;
   typedef std::uint16_t  UInteger16;
@@ -45,7 +45,7 @@ namespace CGAL {
 #ifndef BOOST_NO_INT64_T
 // this macro is still provided but its use is discouraged
 #   define CGAL_HAS_INTEGER64
-  typedef boost::int64_t   Integer64;
+  typedef std::int64_t   Integer64;
   typedef std::uint64_t  UInteger64;
 #endif
 
diff --git a/Number_types/test/Number_types/known_bit_size_integers.cpp b/Number_types/test/Number_types/known_bit_size_integers.cpp
index d7799f602666..93f2be8d6ec7 100644
--- a/Number_types/test/Number_types/known_bit_size_integers.cpp
+++ b/Number_types/test/Number_types/known_bit_size_integers.cpp
@@ -7,11 +7,11 @@ int main()
   std::cout << "Verifying the sizes of boost::[u]int{8,16,32,64}_t"
             << std::endl;
 
-  CGAL_static_assertion(sizeof(boost::int8_t)  == 1);
-  CGAL_static_assertion(sizeof(boost::int16_t) == 2);
-  CGAL_static_assertion(sizeof(boost::int32_t) == 4);
+  CGAL_static_assertion(sizeof(std::int8_t)  == 1);
+  CGAL_static_assertion(sizeof(std::int16_t) == 2);
+  CGAL_static_assertion(sizeof(std::int32_t) == 4);
 #ifndef BOOST_NO_INT64_T
-  CGAL_static_assertion(sizeof(boost::int64_t) == 8);
+  CGAL_static_assertion(sizeof(std::int64_t) == 8);
 #endif
 
   CGAL_static_assertion(sizeof(std::uint8_t)  == 1);
diff --git a/Point_set_3/examples/Point_set_3/point_set_read_ply.cpp b/Point_set_3/examples/Point_set_3/point_set_read_ply.cpp
index 01add66acb16..f0ecd03904f2 100644
--- a/Point_set_3/examples/Point_set_3/point_set_read_ply.cpp
+++ b/Point_set_3/examples/Point_set_3/point_set_read_ply.cpp
@@ -32,9 +32,9 @@ int main (int argc, char** argv)
     std::cerr << " * " << properties[i] << std::endl;
 
   // Recover "label" property of type int
-  Point_set::Property_map<boost::int32_t> label_prop;
+  Point_set::Property_map<std::int32_t> label_prop;
   bool found = false;
-  boost::tie(label_prop, found)  = point_set.property_map<boost::int32_t> ("label");
+  boost::tie(label_prop, found)  = point_set.property_map<std::int32_t> ("label");
 
   if(found)
   {
diff --git a/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h b/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h
index 147d38e11397..9e5dafbd2895 100644
--- a/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h
+++ b/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h
@@ -118,10 +118,10 @@ class Point_set_3_filler
         continue;
       }
 
-      if(dynamic_cast<PLY_read_typed_number<boost::int8_t>*>(property))
+      if(dynamic_cast<PLY_read_typed_number<std::int8_t>*>(property))
       {
         m_properties.push_back
-            (new PLY_property_to_point_set_property<boost::int8_t>(m_point_set,
+            (new PLY_property_to_point_set_property<std::int8_t>(m_point_set,
                                                                    name));
       }
       else if(dynamic_cast<PLY_read_typed_number<std::uint8_t>*>(property))
@@ -130,10 +130,10 @@ class Point_set_3_filler
             (new PLY_property_to_point_set_property<std::uint8_t>(m_point_set,
                                                                     name));
       }
-      else if(dynamic_cast<PLY_read_typed_number<boost::int16_t>*>(property))
+      else if(dynamic_cast<PLY_read_typed_number<std::int16_t>*>(property))
       {
         m_properties.push_back
-            (new PLY_property_to_point_set_property<boost::int16_t>(m_point_set,
+            (new PLY_property_to_point_set_property<std::int16_t>(m_point_set,
                                                                     name));
       }
       else if(dynamic_cast<PLY_read_typed_number<std::uint16_t>*>(property))
@@ -142,10 +142,10 @@ class Point_set_3_filler
             (new PLY_property_to_point_set_property<std::uint16_t>(m_point_set,
                                                                      name));
       }
-      else if(dynamic_cast<PLY_read_typed_number<boost::int32_t>*>(property))
+      else if(dynamic_cast<PLY_read_typed_number<std::int32_t>*>(property))
       {
         m_properties.push_back
-            (new PLY_property_to_point_set_property<boost::int32_t>(m_point_set,
+            (new PLY_property_to_point_set_property<std::int32_t>(m_point_set,
                                                                     name));
       }
       else if(dynamic_cast<PLY_read_typed_number<std::uint32_t>*>(property))
@@ -456,13 +456,13 @@ bool write_PLY(std::ostream& os,
   typedef typename Point_set::Index Index;
   typedef typename Point_set::Point_map Point_map;
   typedef typename Point_set::Vector_map Vector_map;
-  typedef typename Point_set::template Property_map<boost::int8_t> Int8_map;
+  typedef typename Point_set::template Property_map<std::int8_t> Int8_map;
   typedef typename Point_set::template Property_map<std::uint8_t> Uint8_map;
-  typedef typename Point_set::template Property_map<boost::int16_t> Int16_map;
+  typedef typename Point_set::template Property_map<std::int16_t> Int16_map;
   typedef typename Point_set::template Property_map<std::uint16_t> Uint16_map;
-  typedef typename Point_set::template Property_map<boost::int32_t> Int32_map;
+  typedef typename Point_set::template Property_map<std::int32_t> Int32_map;
   typedef typename Point_set::template Property_map<std::uint32_t> Uint32_map;
-  typedef typename Point_set::template Property_map<boost::int64_t> Int64_map;
+  typedef typename Point_set::template Property_map<std::int64_t> Int64_map;
   typedef typename Point_set::template Property_map<std::uint64_t> Uint64_map;
   typedef typename Point_set::template Property_map<float> Float_map;
   typedef typename Point_set::template Property_map<double> Double_map;
@@ -541,7 +541,7 @@ bool write_PLY(std::ostream& os,
     bool okay = false;
     {
       Int8_map pmap;
-      boost::tie(pmap, okay) = point_set.template property_map<boost::int8_t>(prop[i]);
+      boost::tie(pmap, okay) = point_set.template property_map<std::int8_t>(prop[i]);
       if(okay)
       {
         os << "property char " << prop[i] << std::endl;
@@ -561,7 +561,7 @@ bool write_PLY(std::ostream& os,
     }
     {
       Int16_map pmap;
-      boost::tie(pmap, okay) = point_set.template property_map<boost::int16_t>(prop[i]);
+      boost::tie(pmap, okay) = point_set.template property_map<std::int16_t>(prop[i]);
       if(okay)
       {
         os << "property short " << prop[i] << std::endl;
@@ -581,7 +581,7 @@ bool write_PLY(std::ostream& os,
     }
     {
       Int32_map pmap;
-      boost::tie(pmap, okay) = point_set.template property_map<boost::int32_t>(prop[i]);
+      boost::tie(pmap, okay) = point_set.template property_map<std::int32_t>(prop[i]);
       if(okay)
       {
         os << "property int " << prop[i] << std::endl;
@@ -601,11 +601,11 @@ bool write_PLY(std::ostream& os,
     }
     {
       Int64_map pmap;
-      boost::tie(pmap, okay) = point_set.template property_map<boost::int64_t>(prop[i]);
+      boost::tie(pmap, okay) = point_set.template property_map<std::int64_t>(prop[i]);
       if(okay)
       {
         os << "property int " << prop[i] << std::endl;
-        printers.push_back(new internal::Simple_property_printer<Index,Int64_map,boost::int32_t>(pmap));
+        printers.push_back(new internal::Simple_property_printer<Index,Int64_map,std::int32_t>(pmap));
         continue;
       }
     }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp b/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp
index 03d16d3eef95..cc1393e2ec2e 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp
@@ -773,15 +773,15 @@ void Cluster_classification::add_remaining_point_set_properties_as_features(Feat
         prop[i] == "r" || prop[i] == "g" || prop[i] == "b")
       continue;
 
-    if (try_adding_simple_feature<boost::int8_t>(feature_set, prop[i]))
+    if (try_adding_simple_feature<std::int8_t>(feature_set, prop[i]))
       continue;
     if (try_adding_simple_feature<std::uint8_t>(feature_set, prop[i]))
       continue;
-    if (try_adding_simple_feature<boost::int16_t>(feature_set, prop[i]))
+    if (try_adding_simple_feature<std::int16_t>(feature_set, prop[i]))
       continue;
     if (try_adding_simple_feature<std::uint16_t>(feature_set, prop[i]))
       continue;
-    if (try_adding_simple_feature<boost::int32_t>(feature_set, prop[i]))
+    if (try_adding_simple_feature<std::int32_t>(feature_set, prop[i]))
       continue;
     if (try_adding_simple_feature<std::uint32_t>(feature_set, prop[i]))
       continue;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp b/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp
index 23aa1094f9e3..617692963d12 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp
@@ -668,15 +668,15 @@ void Point_set_item_classification::add_remaining_point_set_properties_as_featur
         prop[i] == "r" || prop[i] == "g" || prop[i] == "b")
       continue;
 
-    if (try_adding_simple_feature<boost::int8_t>(prop[i]))
+    if (try_adding_simple_feature<std::int8_t>(prop[i]))
       continue;
     if (try_adding_simple_feature<std::uint8_t>(prop[i]))
       continue;
-    if (try_adding_simple_feature<boost::int16_t>(prop[i]))
+    if (try_adding_simple_feature<std::int16_t>(prop[i]))
       continue;
     if (try_adding_simple_feature<std::uint16_t>(prop[i]))
       continue;
-    if (try_adding_simple_feature<boost::int32_t>(prop[i]))
+    if (try_adding_simple_feature<std::int32_t>(prop[i]))
       continue;
     if (try_adding_simple_feature<std::uint32_t>(prop[i]))
       continue;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 3e2f7003882c..51f960a7cb49 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -1754,7 +1754,7 @@ private Q_SLOTS:
       return false;
     }
 
-    if(ps->template property_map<boost::int8_t>(name).second)
+    if(ps->template property_map<std::int8_t>(name).second)
     {
       return true;
     }
@@ -1762,7 +1762,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(ps->template property_map<boost::int16_t>(name).second)
+    if(ps->template property_map<std::int16_t>(name).second)
     {
       return true;
     }
@@ -1770,7 +1770,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(ps->template property_map<boost::int32_t>(name).second)
+    if(ps->template property_map<std::int32_t>(name).second)
     {
       return true;
     }
@@ -1778,7 +1778,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(ps->template property_map<boost::int64_t>(name).second)
+    if(ps->template property_map<std::int64_t>(name).second)
     {
       return true;
     }
@@ -1801,7 +1801,7 @@ private Q_SLOTS:
   bool DisplayPropertyPlugin::is_property_scalar(std::string name, const SMesh* sm)
   {
 
-    if(sm->template property_map<Simplex,boost::int8_t>(name).second)
+    if(sm->template property_map<Simplex,std::int8_t>(name).second)
     {
       return true;
     }
@@ -1809,7 +1809,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(sm->template property_map<Simplex,boost::int16_t>(name).second)
+    if(sm->template property_map<Simplex,std::int16_t>(name).second)
     {
       return true;
     }
@@ -1817,7 +1817,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(sm->template property_map<Simplex,boost::int32_t>(name).second)
+    if(sm->template property_map<Simplex,std::int32_t>(name).second)
     {
       return true;
     }
@@ -1825,7 +1825,7 @@ private Q_SLOTS:
     {
       return true;
     }
-    if(sm->template property_map<Simplex,boost::int64_t>(name).second)
+    if(sm->template property_map<Simplex,std::int64_t>(name).second)
     {
       return true;
     }
@@ -1846,13 +1846,13 @@ private Q_SLOTS:
 
   bool DisplayPropertyPlugin::treat_point_property(std::string name, Point_set* ps)
   {
-    typedef typename Point_set::template Property_map<boost::int8_t>   Int8_map;
+    typedef typename Point_set::template Property_map<std::int8_t>   Int8_map;
     typedef typename Point_set::template Property_map<std::uint8_t>  Uint8_map;
-    typedef typename Point_set::template Property_map<boost::int16_t>  Int16_map;
+    typedef typename Point_set::template Property_map<std::int16_t>  Int16_map;
     typedef typename Point_set::template Property_map<std::uint16_t> Uint16_map;
-    typedef typename Point_set::template Property_map<boost::int32_t>  Int32_map;
+    typedef typename Point_set::template Property_map<std::int32_t>  Int32_map;
     typedef typename Point_set::template Property_map<std::uint32_t> Uint32_map;
-    typedef typename Point_set::template Property_map<boost::int64_t>  Int64_map;
+    typedef typename Point_set::template Property_map<std::int64_t>  Int64_map;
     typedef typename Point_set::template Property_map<std::uint64_t> Uint64_map;
     typedef typename Point_set::template Property_map<float>           Float_map;
     typedef typename Point_set::template Property_map<double>          Double_map;
@@ -1860,7 +1860,7 @@ private Q_SLOTS:
     bool okay = false;
     {
       Int8_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::int8_t>(name);
+      std::tie(pmap, okay) = ps->property_map<std::int8_t>(name);
       if(okay)
       {
         return displayPSProperty(ps, pmap);
@@ -1878,7 +1878,7 @@ private Q_SLOTS:
 
     {
       Int16_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::int16_t>(name);
+      std::tie(pmap, okay) = ps->property_map<std::int16_t>(name);
       if(okay)
       {
         return displayPSProperty(ps, pmap);
@@ -1896,7 +1896,7 @@ private Q_SLOTS:
 
     {
       Int32_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::int32_t>(name);
+      std::tie(pmap, okay) = ps->property_map<std::int32_t>(name);
       if(okay)
       {
         return displayPSProperty(ps, pmap);
@@ -1914,7 +1914,7 @@ private Q_SLOTS:
 
     {
       Int64_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::int64_t>(name);
+      std::tie(pmap, okay) = ps->property_map<std::int64_t>(name);
       if(okay)
       {
         return displayPSProperty(ps, pmap);
@@ -1953,13 +1953,13 @@ private Q_SLOTS:
   template<typename TAG>
   bool DisplayPropertyPlugin::treat_sm_property(std::string name, SMesh* sm)
   {
-    typedef typename SMesh::template Property_map<TAG, boost::int8_t>   Int8_map;
+    typedef typename SMesh::template Property_map<TAG, std::int8_t>   Int8_map;
     typedef typename SMesh::template Property_map<TAG, std::uint8_t>  Uint8_map;
-    typedef typename SMesh::template Property_map<TAG, boost::int16_t>  Int16_map;
+    typedef typename SMesh::template Property_map<TAG, std::int16_t>  Int16_map;
     typedef typename SMesh::template Property_map<TAG, std::uint16_t> Uint16_map;
-    typedef typename SMesh::template Property_map<TAG, boost::int32_t>  Int32_map;
+    typedef typename SMesh::template Property_map<TAG, std::int32_t>  Int32_map;
     typedef typename SMesh::template Property_map<TAG, std::uint32_t> Uint32_map;
-    typedef typename SMesh::template Property_map<TAG, boost::int64_t>  Int64_map;
+    typedef typename SMesh::template Property_map<TAG, std::int64_t>  Int64_map;
     typedef typename SMesh::template Property_map<TAG, std::uint64_t> Uint64_map;
     typedef typename SMesh::template Property_map<TAG, float>           Float_map;
     typedef typename SMesh::template Property_map<TAG, double>          Double_map;
@@ -1967,7 +1967,7 @@ private Q_SLOTS:
     bool okay = false;
     {
       Int8_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::int8_t>(name);
+      std::tie(pmap, okay) = sm->property_map<TAG,std::int8_t>(name);
       if(okay)
       {
         return displaySMProperty(*sm, pmap, TAG());
@@ -1985,7 +1985,7 @@ private Q_SLOTS:
 
     {
       Int16_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::int16_t>(name);
+      std::tie(pmap, okay) = sm->property_map<TAG,std::int16_t>(name);
       if(okay)
       {
         return displaySMProperty(*sm, pmap, TAG());
@@ -2003,7 +2003,7 @@ private Q_SLOTS:
 
     {
       Int32_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::int32_t>(name);
+      std::tie(pmap, okay) = sm->property_map<TAG,std::int32_t>(name);
       if(okay)
       {
         return displaySMProperty(*sm, pmap, TAG());
@@ -2021,7 +2021,7 @@ private Q_SLOTS:
 
     {
       Int64_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::int64_t>(name);
+      std::tie(pmap, okay) = sm->property_map<TAG,std::int64_t>(name);
       if(okay)
       {
         return displaySMProperty(*sm, pmap, TAG());
diff --git a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
index 24deb8dbc303..94c091b86e91 100644
--- a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
@@ -549,9 +549,9 @@ template <> const char* whatType(float) { return "float"; }
 template <> const char* whatType(double) { return "double"; }
 template <> const char* whatType(char) { return "int8_t (char)"; }
 template <> const char* whatType(std::uint8_t) { return "uint8_t (unsigned char)"; }
-template <> const char* whatType(boost::int16_t) { return "int16_t (short)"; }
+template <> const char* whatType(std::int16_t) { return "int16_t (short)"; }
 template <> const char* whatType(std::uint16_t) { return "uint16_t (unsigned short)"; }
-template <> const char* whatType(boost::int32_t) { return "int32_t (int)"; }
+template <> const char* whatType(std::int32_t) { return "int32_t (int)"; }
 template <> const char* whatType(std::uint32_t) { return "uint32_t (unsigned int)"; }
 
 template<typename Word>
diff --git a/Random_numbers/include/CGAL/Random_impl.h b/Random_numbers/include/CGAL/Random_impl.h
index 89ca7057fe5d..675ed05e814e 100644
--- a/Random_numbers/include/CGAL/Random_impl.h
+++ b/Random_numbers/include/CGAL/Random_impl.h
@@ -40,7 +40,7 @@ Random()
     std::time( &s);
     seed = (unsigned int)s;
     // initialize random numbers generator
-    rng.seed(static_cast<boost::int32_t>(seed));
+    rng.seed(static_cast<std::int32_t>(seed));
     random_value = get_int(0, 1<<15);
 }
 
@@ -55,7 +55,7 @@ Random(internal::Random_print_seed)
     seed = (unsigned int)s;
     std::cerr << "CGAL::Random()::get_seed() = " << seed << std::endl;
     // initialize random numbers generator
-    rng.seed(static_cast<boost::int32_t>(seed));
+    rng.seed(static_cast<std::int32_t>(seed));
     random_value = get_int(0, 1<<15);
 }
 
@@ -65,7 +65,7 @@ Random( unsigned int  seed)
     : val(0), seed(seed)
 {
     // initialize random numbers generator
-    rng.seed(static_cast<boost::int32_t>(seed));
+    rng.seed(static_cast<std::int32_t>(seed));
     random_value = get_int(0, 1<<15);
 }
 
diff --git a/Spatial_searching/include/CGAL/Kd_tree_node.h b/Spatial_searching/include/CGAL/Kd_tree_node.h
index 242b1c9ccc48..c6af70495a2a 100644
--- a/Spatial_searching/include/CGAL/Kd_tree_node.h
+++ b/Spatial_searching/include/CGAL/Kd_tree_node.h
@@ -435,7 +435,7 @@ namespace CGAL {
   private:
 
     // private variables for leaf nodes
-    boost::int32_t n; // denotes number of items in a leaf node
+    std::int32_t n; // denotes number of items in a leaf node
     iterator data; // iterator to data in leaf node
 
 
@@ -503,7 +503,7 @@ namespace CGAL {
   private:
 
        // private variables for internal nodes
-    boost::int32_t cut_dim;
+    std::int32_t cut_dim;
     FT cut_val;
     Node_handle lower_ch, upper_ch;
 
diff --git a/Stream_support/include/CGAL/IO/OFF/File_header_OFF_impl.h b/Stream_support/include/CGAL/IO/OFF/File_header_OFF_impl.h
index 1ecff298f55b..87994e60aa99 100644
--- a/Stream_support/include/CGAL/IO/OFF/File_header_OFF_impl.h
+++ b/Stream_support/include/CGAL/IO/OFF/File_header_OFF_impl.h
@@ -348,7 +348,7 @@ std::istream& operator>>( std::istream& in, File_header_OFF& h) {
     // Read remaining size value(s).
     int n_h;
     if ( h.binary()) {
-        boost::int32_t a, b, c;
+        std::int32_t a, b, c;
         I_Binary_read_big_endian_integer32( in, a);
         if ( h.n_dimensional()) {
             h.set_dimension( a);
diff --git a/Stream_support/include/CGAL/IO/OFF/File_scanner_OFF.h b/Stream_support/include/CGAL/IO/OFF/File_scanner_OFF.h
index 806295998184..8ec2d14334b2 100644
--- a/Stream_support/include/CGAL/IO/OFF/File_scanner_OFF.h
+++ b/Stream_support/include/CGAL/IO/OFF/File_scanner_OFF.h
@@ -656,7 +656,7 @@ class File_scanner_OFF
 
       if(has_colors())
       {
-        boost::int32_t k;
+        std::int32_t k;
         I_Binary_read_big_endian_integer32(m_in, k);
         if(k<0 || k>4)
         {
@@ -688,7 +688,7 @@ class File_scanner_OFF
     CGAL_assertion(current_facet < size_of_facets());
     if(binary())
     {
-      boost::int32_t i32;
+      std::int32_t i32;
       I_Binary_read_big_endian_integer32(m_in, i32);
       size = i32;
     }
@@ -735,7 +735,7 @@ class File_scanner_OFF
                                std::size_t current_facet)
   {
     if(binary()){
-      boost::int32_t i32;
+      std::int32_t i32;
       I_Binary_read_big_endian_integer32(m_in, i32);
       index = i32;
     }
@@ -793,7 +793,7 @@ class File_scanner_OFF
     // Take care of trailing information like color triples.
     if(binary())
     {
-      boost::int32_t k;
+      std::int32_t k;
       I_Binary_read_big_endian_integer32(m_in, k);
       if(k<0 || k>4)
       {
diff --git a/Stream_support/include/CGAL/IO/OFF/File_writer_OFF.h b/Stream_support/include/CGAL/IO/OFF/File_writer_OFF.h
index 91860254f47e..d608a7e38f4f 100644
--- a/Stream_support/include/CGAL/IO/OFF/File_writer_OFF.h
+++ b/Stream_support/include/CGAL/IO/OFF/File_writer_OFF.h
@@ -129,7 +129,7 @@ class File_writer_OFF
   void write_facet_begin(std::size_t no)
   {
     if(m_header.binary())
-      I_Binary_write_big_endian_integer32(out(), static_cast<boost::int32_t>(no));
+      I_Binary_write_big_endian_integer32(out(), static_cast<std::int32_t>(no));
     else
       out() << no << ' ';
   }
@@ -137,7 +137,7 @@ class File_writer_OFF
   void write_facet_vertex_index(std::size_t index)
   {
     if(m_header.binary())
-      I_Binary_write_big_endian_integer32(out(), static_cast<boost::int32_t>(index));
+      I_Binary_write_big_endian_integer32(out(), static_cast<std::int32_t>(index));
     else
       out() << ' ' << index;
   }
diff --git a/Stream_support/include/CGAL/IO/PLY.h b/Stream_support/include/CGAL/IO/PLY.h
index c9623ac455d5..7f72b37a3f59 100644
--- a/Stream_support/include/CGAL/IO/PLY.h
+++ b/Stream_support/include/CGAL/IO/PLY.h
@@ -131,17 +131,17 @@ bool read_PLY(std::istream& is,
     }
     else if(element.name() == "face" || element.name() == "faces")
     {
-      if(element.has_property<std::vector<boost::int32_t> >("vertex_indices"))
+      if(element.has_property<std::vector<std::int32_t> >("vertex_indices"))
       {
-        internal::read_PLY_faces<boost::int32_t>(is, element, polygons, fc_out, "vertex_indices");
+        internal::read_PLY_faces<std::int32_t>(is, element, polygons, fc_out, "vertex_indices");
       }
       else if(element.has_property<std::vector<std::uint32_t> >("vertex_indices"))
       {
         internal::read_PLY_faces<std::uint32_t>(is, element, polygons, fc_out, "vertex_indices");
       }
-      else if(element.has_property<std::vector<boost::int32_t> >("vertex_index"))
+      else if(element.has_property<std::vector<std::int32_t> >("vertex_index"))
       {
-        internal::read_PLY_faces<boost::int32_t>(is, element, polygons, fc_out, "vertex_index");
+        internal::read_PLY_faces<std::int32_t>(is, element, polygons, fc_out, "vertex_index");
       }
       else if(element.has_property<std::vector<std::uint32_t> >("vertex_index"))
       {
diff --git a/Stream_support/include/CGAL/IO/PLY/PLY_reader.h b/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
index cd007c256186..a4a50bd36c8c 100644
--- a/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
+++ b/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
@@ -38,11 +38,11 @@
 
 #define TRY_TO_GENERATE_LIST_PROPERTY(STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE) \
   TRY_TO_GENERATE_SIZED_LIST_PROPERTY("uchar", "uint8", std::uint8_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
-  else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("char", "int8", boost::int8_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
+  else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("char", "int8", std::int8_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
   else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("ushort", "uint16", std::uint16_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
-  else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("short", "int16", boost::int16_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
+  else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("short", "int16", std::int16_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
   else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("uint", "uint32", std::uint32_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE); \
-  else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("int", "int32", boost::int32_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE)
+  else TRY_TO_GENERATE_SIZED_LIST_PROPERTY("int", "int32", std::int32_t, STD_INDEX_TYPE, T_INDEX_TYPE, INDEX_TYPE)
 
 namespace CGAL {
 
@@ -529,22 +529,22 @@ class PLY_reader
               return false;
             }
 
-            TRY_TO_GENERATE_LIST_PROPERTY("char", "int8", boost::int8_t);
+            TRY_TO_GENERATE_LIST_PROPERTY("char", "int8", std::int8_t);
             else TRY_TO_GENERATE_LIST_PROPERTY("uchar", "uint8", std::uint8_t);
-            else TRY_TO_GENERATE_LIST_PROPERTY("short", "int16", boost::int16_t);
+            else TRY_TO_GENERATE_LIST_PROPERTY("short", "int16", std::int16_t);
             else TRY_TO_GENERATE_LIST_PROPERTY("ushort", "uint16", std::uint16_t);
-            else TRY_TO_GENERATE_LIST_PROPERTY("int", "int32", boost::int32_t);
+            else TRY_TO_GENERATE_LIST_PROPERTY("int", "int32", std::int32_t);
             else TRY_TO_GENERATE_LIST_PROPERTY("uint", "uint32", std::uint32_t);
             else TRY_TO_GENERATE_LIST_PROPERTY("float", "float32", float);
             else TRY_TO_GENERATE_LIST_PROPERTY("double", "float64", double);
           }
           else
           {
-            TRY_TO_GENERATE_PROPERTY("char", "int8", boost::int8_t);
+            TRY_TO_GENERATE_PROPERTY("char", "int8", std::int8_t);
             else TRY_TO_GENERATE_PROPERTY("uchar", "uint8", std::uint8_t);
-            else TRY_TO_GENERATE_PROPERTY("short", "int16", boost::int16_t);
+            else TRY_TO_GENERATE_PROPERTY("short", "int16", std::int16_t);
             else TRY_TO_GENERATE_PROPERTY("ushort", "uint16", std::uint16_t);
-            else TRY_TO_GENERATE_PROPERTY("int", "int32", boost::int32_t);
+            else TRY_TO_GENERATE_PROPERTY("int", "int32", std::int32_t);
             else TRY_TO_GENERATE_PROPERTY("uint", "uint32", std::uint32_t);
             else TRY_TO_GENERATE_PROPERTY("float", "float32", float);
             else TRY_TO_GENERATE_PROPERTY("double", "float64", double);
diff --git a/Surface_mesh/include/CGAL/Surface_mesh/IO/PLY.h b/Surface_mesh/include/CGAL/Surface_mesh/IO/PLY.h
index dac77f788dd4..7bf9dd2e8fc2 100644
--- a/Surface_mesh/include/CGAL/Surface_mesh/IO/PLY.h
+++ b/Surface_mesh/include/CGAL/Surface_mesh/IO/PLY.h
@@ -145,10 +145,10 @@ class Surface_mesh_filler
     const std::string& name = property->name();
     if(name == "vertex_indices" || name == "vertex_index")
     {
-      CGAL_assertion(dynamic_cast<PLY_read_typed_list<boost::int32_t>*>(property)
+      CGAL_assertion(dynamic_cast<PLY_read_typed_list<std::int32_t>*>(property)
                      || dynamic_cast<PLY_read_typed_list<std::uint32_t>*>(property));
       m_index_tag  = name;
-      m_use_int32_t = dynamic_cast<PLY_read_typed_list<boost::int32_t>*>(property);
+      m_use_int32_t = dynamic_cast<PLY_read_typed_list<std::int32_t>*>(property);
       return true;
     }
     if(name == "red" ||
@@ -218,25 +218,25 @@ class Surface_mesh_filler
 
       const std::string& name = property->name();
 
-      if(dynamic_cast<PLY_read_typed_number<boost::int8_t>*>(property))
+      if(dynamic_cast<PLY_read_typed_number<std::int8_t>*>(property))
       {
-        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, boost::int8_t>(m_mesh, name));
+        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, std::int8_t>(m_mesh, name));
       }
       else if(dynamic_cast<PLY_read_typed_number<std::uint8_t>*>(property))
       {
         properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, std::uint8_t>(m_mesh, name));
       }
-      else if(dynamic_cast<PLY_read_typed_number<boost::int16_t>*>(property))
+      else if(dynamic_cast<PLY_read_typed_number<std::int16_t>*>(property))
       {
-        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, boost::int16_t>(m_mesh, name));
+        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, std::int16_t>(m_mesh, name));
       }
       else if(dynamic_cast<PLY_read_typed_number<std::uint16_t>*>(property))
       {
         properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, std::uint16_t>(m_mesh, name));
       }
-      else if(dynamic_cast<PLY_read_typed_number<boost::int32_t>*>(property))
+      else if(dynamic_cast<PLY_read_typed_number<std::int32_t>*>(property))
       {
-        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, boost::int32_t>(m_mesh, name));
+        properties.push_back(new PLY_property_to_surface_mesh_property<Simplex, std::int32_t>(m_mesh, name));
       }
       else if(dynamic_cast<PLY_read_typed_number<std::uint32_t>*>(property))
       {
@@ -314,7 +314,7 @@ class Surface_mesh_filler
     Face_index fi = m_mesh.null_face();
 
     if(m_use_int32_t)
-      process_line<boost::int32_t>(element, fi);
+      process_line<std::int32_t>(element, fi);
     else
       process_line<std::uint32_t>(element, fi);
 
@@ -368,7 +368,7 @@ class Surface_mesh_filler
     Edge_index ei = m_mesh.null_edge();
 
     if(m_use_int32_t)
-      process_line<boost::int32_t>(element, ei);
+      process_line<std::int32_t>(element, ei);
     else
       process_line<std::uint32_t>(element, ei);
 
@@ -401,7 +401,7 @@ class Surface_mesh_filler
     Halfedge_index hi = m_mesh.null_halfedge();
 
     if(m_use_int32_t)
-      process_line<boost::int32_t>(element, hi);
+      process_line<std::int32_t>(element, hi);
     else
       process_line<std::uint32_t>(element, hi);
 
@@ -640,13 +640,13 @@ void fill_header(std::ostream& os, const Surface_mesh<Point>& sm,
                  const CGAL_NP_CLASS& np = parameters::default_values())
 {
   typedef Surface_mesh<Point>                                             SMesh;
-  typedef typename SMesh::template Property_map<Simplex, boost::int8_t>   Int8_map;
+  typedef typename SMesh::template Property_map<Simplex, std::int8_t>   Int8_map;
   typedef typename SMesh::template Property_map<Simplex, std::uint8_t>  Uint8_map;
-  typedef typename SMesh::template Property_map<Simplex, boost::int16_t>  Int16_map;
+  typedef typename SMesh::template Property_map<Simplex, std::int16_t>  Int16_map;
   typedef typename SMesh::template Property_map<Simplex, std::uint16_t> Uint16_map;
-  typedef typename SMesh::template Property_map<Simplex, boost::int32_t>  Int32_map;
+  typedef typename SMesh::template Property_map<Simplex, std::int32_t>  Int32_map;
   typedef typename SMesh::template Property_map<Simplex, std::uint32_t> Uint32_map;
-  typedef typename SMesh::template Property_map<Simplex, boost::int64_t>  Int64_map;
+  typedef typename SMesh::template Property_map<Simplex, std::int64_t>  Int64_map;
   typedef typename SMesh::template Property_map<Simplex, std::uint64_t> Uint64_map;
   typedef typename SMesh::template Property_map<Simplex, float>           Float_map;
   typedef typename SMesh::template Property_map<Simplex, double>          Double_map;
@@ -711,7 +711,7 @@ void fill_header(std::ostream& os, const Surface_mesh<Point>& sm,
     bool okay = false;
     {
       Int8_map pmap;
-      boost::tie(pmap, okay) = sm.template property_map<Simplex,boost::int8_t>(prop[i]);
+      boost::tie(pmap, okay) = sm.template property_map<Simplex,std::int8_t>(prop[i]);
       if(okay)
       {
         os << "property char " << name << std::endl;
@@ -731,7 +731,7 @@ void fill_header(std::ostream& os, const Surface_mesh<Point>& sm,
     }
     {
       Int16_map pmap;
-      boost::tie(pmap, okay) = sm.template property_map<Simplex,boost::int16_t>(prop[i]);
+      boost::tie(pmap, okay) = sm.template property_map<Simplex,std::int16_t>(prop[i]);
       if(okay)
       {
         os << "property short " << name << std::endl;
@@ -751,7 +751,7 @@ void fill_header(std::ostream& os, const Surface_mesh<Point>& sm,
     }
     {
       Int32_map pmap;
-      boost::tie(pmap, okay) = sm.template property_map<Simplex,boost::int32_t>(prop[i]);
+      boost::tie(pmap, okay) = sm.template property_map<Simplex,std::int32_t>(prop[i]);
       if(okay)
       {
         os << "property int " << name << std::endl;
@@ -771,11 +771,11 @@ void fill_header(std::ostream& os, const Surface_mesh<Point>& sm,
     }
     {
       Int64_map pmap;
-      boost::tie(pmap, okay) = sm.template property_map<Simplex,boost::int64_t>(prop[i]);
+      boost::tie(pmap, okay) = sm.template property_map<Simplex,std::int64_t>(prop[i]);
       if(okay)
       {
         os << "property int " << name << std::endl;
-        printers.push_back(new internal::Simple_property_printer<Simplex,Int64_map,boost::int32_t>(pmap));
+        printers.push_back(new internal::Simple_property_printer<Simplex,Int64_map,std::int32_t>(pmap));
         continue;
       }
     }
diff --git a/Triangulation_3/test/Triangulation_3/test_regular_remove_3.cpp b/Triangulation_3/test/Triangulation_3/test_regular_remove_3.cpp
index f37bb0964136..9252598776cc 100644
--- a/Triangulation_3/test/Triangulation_3/test_regular_remove_3.cpp
+++ b/Triangulation_3/test/Triangulation_3/test_regular_remove_3.cpp
@@ -329,7 +329,7 @@ int main(int argc, char **argv)
     }
 
     // Hardcoded seeds so that the test-suite is deterministic.
-    boost::int32_t seed0 = 42, seed1 = 43, seed2 = 42, seed3 = 42;
+    std::int32_t seed0 = 42, seed1 = 43, seed2 = 42, seed3 = 42;
 
     // You can also pass seeds on the command line.
     if (argc > 1) { std::istringstream iss(argv[1]); iss >>seed0; }

From 5a8736d666b95a94c68c96674c5ff5c2bbbfb4d3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 18:54:12 +0200
Subject: [PATCH 0221/1398] fix typo

---
 .../include/CGAL/Variational_shape_approximation.h              | 2 +-
 Triangulation_3/doc/Triangulation_3/CGAL/link_to_face_graph.h   | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
index 566aec602d73..222a99f77e7a 100644
--- a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
+++ b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
@@ -1959,7 +1959,7 @@ class Variational_shape_approximation {
   /*!
    * @brief checks if a vertex is attached with an anchor.
    * @tparam VertexAnchorIndexMap `ReadablePropertyMap`
-   * with `boost::graph_traights<TriangleMesh>::vertex_descriptor` as key and `std::size_t` as value type
+   * with `boost::graph_traits<TriangleMesh>::vertex_descriptor` as key and `std::size_t` as value type
    * @param vtx a vertex descriptor
    * @param vanchor_map vertex anchor index map
    */
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/link_to_face_graph.h b/Triangulation_3/doc/Triangulation_3/CGAL/link_to_face_graph.h
index 0ca74d3f6ba7..484ae1296c0b 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/link_to_face_graph.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/link_to_face_graph.h
@@ -26,7 +26,7 @@ fills the face graph `tm` with the <A HREF="https://en.wikipedia.org/wiki/Simpli
 
 */
 template <class Triangulation, class TriangleMesh>
-typename boost::graph_trait<FG>::vertex_descriptor
+typename boost::graph_traits<FG>::vertex_descriptor
 link_to_face_graph(const Triangulation& t,
                    typename Triangulation::Vertex_handle vh,
                    TriangleMesh& tm,

From 61834d5a267f6bf30ceb81248090e0d33ccba1f5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 19:06:31 +0200
Subject: [PATCH 0222/1398] boost::remove_const -> std::remove_const_t

---
 BGL/include/CGAL/boost/graph/property_maps.h  | 29 +++++++++----------
 .../boost/graph/graph_traits_HalfedgeDS.h     |  1 -
 Mesh_3/benchmark/Mesh_3/StdAfx.h              |  1 -
 .../Mesh_3/experimental/Get_curve_index.h     |  4 +--
 .../AABB_filtered_projection_traits.h         |  2 +-
 STL_Extension/include/CGAL/vector.h           | 15 +++++-----
 6 files changed, 23 insertions(+), 29 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/property_maps.h b/BGL/include/CGAL/boost/graph/property_maps.h
index c10935e27f2d..772966bdacdb 100644
--- a/BGL/include/CGAL/boost/graph/property_maps.h
+++ b/BGL/include/CGAL/boost/graph/property_maps.h
@@ -17,7 +17,6 @@
 #include <CGAL/boost/graph/properties.h>
 #include <boost/type_traits/is_const.hpp>
 #include <boost/mpl/if.hpp>
-#include <boost/type_traits/remove_const.hpp>
 
 namespace CGAL{
 
@@ -25,7 +24,7 @@ namespace CGAL{
 template < class TriangleMesh,
            class VertexPointMap = typename boost::property_map<TriangleMesh,vertex_point_t>::type >
 struct Triangle_from_face_descriptor_map{
-  typename boost::remove_const<TriangleMesh>::type* m_tm;
+  typename std::remove_const_t<TriangleMesh>* m_tm;
   VertexPointMap m_vpm;
 
   Triangle_from_face_descriptor_map()
@@ -33,13 +32,13 @@ struct Triangle_from_face_descriptor_map{
   {}
 
   Triangle_from_face_descriptor_map(TriangleMesh const* tm)
-    : m_tm( const_cast<typename boost::remove_const<TriangleMesh>::type*>(tm) )
+    : m_tm( const_cast<std::remove_const_t<TriangleMesh>*>(tm) )
     , m_vpm( get(vertex_point, *m_tm) )
   {}
 
   Triangle_from_face_descriptor_map(TriangleMesh const* tm,
                                     VertexPointMap vpm )
-    : m_tm(const_cast<typename boost::remove_const<TriangleMesh>::type*>(tm))
+    : m_tm(const_cast<std::remove_const_t<TriangleMesh>*>(tm))
     , m_vpm(vpm)
   {}
 
@@ -57,7 +56,7 @@ struct Triangle_from_face_descriptor_map{
   get(const Triangle_from_face_descriptor_map<TriangleMesh,VertexPointMap>& pmap,
       key_type f)
   {
-    typename boost::remove_const<TriangleMesh>::type & tm = *(pmap.m_tm);
+    std::remove_const_t<TriangleMesh>& tm = *(pmap.m_tm);
     CGAL_precondition(halfedge(f,tm) == next(next(next(halfedge(f,tm),tm),tm),tm));
 
     return value_type( get(pmap.m_vpm, target(halfedge(f,tm),tm)),
@@ -70,7 +69,7 @@ struct Triangle_from_face_descriptor_map{
   get(const Triangle_from_face_descriptor_map<TriangleMesh,VertexPointMap>& pmap,
       const std::pair<key_type, const TriangleMesh*>& f)
   {
-    typename boost::remove_const<TriangleMesh>::type & tm = *(pmap.m_tm);
+    std::remove_const_t<TriangleMesh> & tm = *(pmap.m_tm);
     CGAL_precondition(halfedge(f.first,tm) == next(next(next(halfedge(f.first,tm),tm),tm),tm));
 
     return value_type( get(pmap.m_vpm, target(halfedge(f.first,tm),tm)),
@@ -88,13 +87,13 @@ struct Segment_from_edge_descriptor_map{
   {}
 
   Segment_from_edge_descriptor_map(PolygonMesh const * pm)
-    : m_pm( const_cast<typename boost::remove_const<PolygonMesh>::type*>(pm) )
+    : m_pm( const_cast<std::remove_const_t<PolygonMesh>*>(pm) )
     , m_vpm( get(vertex_point, *m_pm) )
   {}
 
   Segment_from_edge_descriptor_map(PolygonMesh const * pm,
                                    VertexPointMap vpm )
-    : m_pm( const_cast<typename boost::remove_const<PolygonMesh>::type*>(pm) )
+    : m_pm( const_cast<std::remove_const_t<PolygonMesh>*>(pm) )
     , m_vpm(vpm)
   {}
 
@@ -106,7 +105,7 @@ struct Segment_from_edge_descriptor_map{
   typedef value_type reference;
   typedef boost::readable_property_map_tag category;
   //data
-  typename boost::remove_const<PolygonMesh>::type* m_pm;
+  std::remove_const_t<PolygonMesh>* m_pm;
   VertexPointMap m_vpm;
 
   //get function for property map
@@ -138,16 +137,16 @@ struct One_point_from_face_descriptor_map{
   {}
 
   One_point_from_face_descriptor_map(PolygonMesh const * g)
-    : m_pm( const_cast<typename boost::remove_const<PolygonMesh>::type*>(g) )
+    : m_pm( const_cast<std::remove_const_t<PolygonMesh>*>(g) )
     , m_vpm( get(vertex_point, *m_pm) )
   {}
 
   One_point_from_face_descriptor_map(PolygonMesh const * g, VertexPointMap vpm )
-    : m_pm( const_cast<typename boost::remove_const<PolygonMesh>::type*>(g) )
+    : m_pm( const_cast<std::remove_const_t<PolygonMesh>*>(g) )
     , m_vpm(vpm)
   {}
 
-  typename boost::remove_const<PolygonMesh>::type* m_pm;
+  std::remove_const_t<PolygonMesh>* m_pm;
   VertexPointMap m_vpm;
 
   //classical typedefs
@@ -182,12 +181,12 @@ struct Source_point_from_edge_descriptor_map{
   {}
 
   Source_point_from_edge_descriptor_map(PolygonMesh const * g)
-    : m_pm( const_cast<typename boost::remove_const<PolygonMesh>::type*>(g) )
+    : m_pm( const_cast<std::remove_const_t<PolygonMesh>*>(g) )
     , m_vpm( get(vertex_point, *m_pm) )
   {}
 
   Source_point_from_edge_descriptor_map(PolygonMesh const * g, VertexPointMap vpm )
-    : m_pm( const_cast<typename boost::remove_const<PolygonMesh>::type*>(g) )
+    : m_pm( const_cast<std::remove_const_t<PolygonMesh>*>(g) )
     , m_vpm(vpm)
   {}
 
@@ -198,7 +197,7 @@ struct Source_point_from_edge_descriptor_map{
   typedef boost::readable_property_map_tag category;
 
   //data
-  typename boost::remove_const<PolygonMesh>::type* m_pm;
+  std::remove_const_t<PolygonMesh>* m_pm;
   VertexPointMap m_vpm;
 
   //get function for property map
diff --git a/HalfedgeDS/include/CGAL/boost/graph/graph_traits_HalfedgeDS.h b/HalfedgeDS/include/CGAL/boost/graph/graph_traits_HalfedgeDS.h
index 9914445e81a0..542d5a447f70 100644
--- a/HalfedgeDS/include/CGAL/boost/graph/graph_traits_HalfedgeDS.h
+++ b/HalfedgeDS/include/CGAL/boost/graph/graph_traits_HalfedgeDS.h
@@ -20,7 +20,6 @@
 #include <boost/config.hpp>
 #include <boost/iterator/iterator_adaptor.hpp>
 #include <CGAL/boost/iterator/transform_iterator.hpp>
-#include <boost/type_traits/remove_const.hpp>
 
 #include <boost/graph/graph_traits.hpp>
 #include <boost/graph/properties.hpp>
diff --git a/Mesh_3/benchmark/Mesh_3/StdAfx.h b/Mesh_3/benchmark/Mesh_3/StdAfx.h
index a07ee4b3f167..8cf35e5a5036 100644
--- a/Mesh_3/benchmark/Mesh_3/StdAfx.h
+++ b/Mesh_3/benchmark/Mesh_3/StdAfx.h
@@ -140,7 +140,6 @@
 #include <boost/type_traits/is_const.hpp>
 #include <boost/type_traits/is_convertible.hpp>
 #include <boost/type_traits/is_reference.hpp>
-#include <boost/type_traits/remove_const.hpp>
 #include <boost/type_traits/remove_reference.hpp>
 #include <boost/utility.hpp>
 #include <boost/variant.hpp>
diff --git a/Mesh_3/include/CGAL/Mesh_3/experimental/Get_curve_index.h b/Mesh_3/include/CGAL/Mesh_3/experimental/Get_curve_index.h
index e8ac78646df1..4ef2453bfe42 100644
--- a/Mesh_3/include/CGAL/Mesh_3/experimental/Get_curve_index.h
+++ b/Mesh_3/include/CGAL/Mesh_3/experimental/Get_curve_index.h
@@ -57,14 +57,12 @@ get(Get_curve_index<Primitive>, const typename Primitive::Id id) {
 
 }} // end namespace CGAL::Mesh_3
 
-#include <boost/type_traits/remove_const.hpp>
-
 namespace boost {
   // specialization for using pointers as property maps
   template <typename Primitive>
   struct property_traits<CGAL::Mesh_3::Get_curve_index<Primitive> > {
     typedef typename std::iterator_traits<typename Primitive::Id::first_type>::value_type ConstPair;
-    typedef typename boost::remove_const<typename ConstPair::first_type>::type value_type;
+    typedef std::remove_const_t<typename ConstPair::first_type> value_type;
     typedef value_type& reference;
     typedef typename Primitive::Id key_type;
     typedef readable_property_map_tag category;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/AABB_filtered_projection_traits.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/AABB_filtered_projection_traits.h
index 3271879dc64d..1cfce7e81d9d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/AABB_filtered_projection_traits.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/AABB_filtered_projection_traits.h
@@ -50,7 +50,7 @@ class Filtered_projection_traits
 
   typedef typename boost::property_traits<IndexPropertyMap>::value_type Index_type;
 
-  typedef std::set<typename boost::remove_const<Index_type>::type> Set_of_indices;
+  typedef std::set<std::remove_const_t<Index_type>> Set_of_indices;
 
 public:
   template <typename IndexToIgnoreIterator>
diff --git a/STL_Extension/include/CGAL/vector.h b/STL_Extension/include/CGAL/vector.h
index 192baedacdc5..092bde6a6556 100644
--- a/STL_Extension/include/CGAL/vector.h
+++ b/STL_Extension/include/CGAL/vector.h
@@ -25,7 +25,6 @@
 #include <memory>
 #include <cstddef>
 #include <functional>
-#include <boost/type_traits/remove_const.hpp>
 #include <boost/type_traits/remove_reference.hpp>
 #include <boost/type_traits/remove_pointer.hpp>
 
@@ -118,19 +117,19 @@ class vector_iterator {
     bool operator>=( const Self& i) const { return !(*this < i); }
 
     vector_iterator<  T,
-                      typename boost::remove_const<
+                      std::remove_const_t<
                         typename boost::remove_reference<Ref>::type
-                      >::type&,
-                      typename boost::remove_const<
+                      >&,
+                      std::remove_const_t<
                           typename boost::remove_pointer<Ptr>::type
-                      >::type* >
+                      >* >
     remove_const() const
     {
-      typedef typename boost::remove_const<
+      typedef std::remove_const_t<
                 typename boost::remove_pointer<Ptr>::type
-              >::type* Ptr_no_c;
+              >* Ptr_no_c;
       return  vector_iterator< T,
-                     typename boost::remove_const<typename boost::remove_reference<Ref>::type>::type&,
+                     std::remove_const_t<typename boost::remove_reference<Ref>::type>::type&,
                      Ptr_no_c>
               ( const_cast<Ptr_no_c>(ptr) );
     }

From fa301554ceff6a7d32789e331e53969ecd0e3b04 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 19:13:56 +0200
Subject: [PATCH 0223/1398] boost::remove_v -> std::remove_cv_t

---
 Filtered_kernel/include/CGAL/Lazy.h                       | 8 ++++----
 Filtered_kernel/include/CGAL/Lazy_kernel.h                | 7 +++----
 Kernel_23/include/CGAL/Kernel/Type_mapper.h               | 5 ++---
 .../include/CGAL/Implicit_to_labeling_function_wrapper.h  | 3 +--
 STL_Extension/include/CGAL/is_streamable.h                | 5 ++---
 STL_Extension/include/CGAL/transforming_iterator.h        | 2 +-
 STL_Extension/include/CGAL/transforming_pair_iterator.h   | 2 +-
 STL_Extension/include/CGAL/type_traits/is_iterator.h      | 5 ++---
 Spatial_searching/include/CGAL/Fuzzy_iso_box.h            | 5 ++---
 9 files changed, 18 insertions(+), 24 deletions(-)

diff --git a/Filtered_kernel/include/CGAL/Lazy.h b/Filtered_kernel/include/CGAL/Lazy.h
index e7024f6220b8..6496d7066a21 100644
--- a/Filtered_kernel/include/CGAL/Lazy.h
+++ b/Filtered_kernel/include/CGAL/Lazy.h
@@ -2088,10 +2088,10 @@ struct Lazy_construction<LK, AC, EC, E2A_, true> {
 
   typedef typename LK::Approximate_kernel AK;
   typedef typename LK::Exact_kernel EK;
-  typedef typename boost::remove_cv<
-    typename boost::remove_reference < typename AC::result_type >::type >::type AT;
-  typedef typename boost::remove_cv<
-    typename boost::remove_reference < typename EC::result_type >::type >::type ET;
+  typedef std::remove_cv_t<
+    typename boost::remove_reference < typename AC::result_type >::type > AT;
+  typedef std::remove_cv_t<
+    typename boost::remove_reference < typename EC::result_type >::type > ET;
 
   typedef typename Default::Get<E2A_, typename LK::E2A>::type E2A;
 
diff --git a/Filtered_kernel/include/CGAL/Lazy_kernel.h b/Filtered_kernel/include/CGAL/Lazy_kernel.h
index 08a6ebb41a0a..7c5888e8f961 100644
--- a/Filtered_kernel/include/CGAL/Lazy_kernel.h
+++ b/Filtered_kernel/include/CGAL/Lazy_kernel.h
@@ -30,7 +30,6 @@
 #include <boost/mpl/if.hpp>
 #include <boost/mpl/or.hpp>
 #include <boost/type_traits/remove_reference.hpp>
-#include <boost/type_traits/remove_cv.hpp>
 
 #if defined(BOOST_MSVC)
 #  pragma warning(push)
@@ -64,7 +63,7 @@ class Has_result_type_helper
 template<typename T>
 struct Has_result_type
   : boost::integral_constant< bool,
-                              Has_result_type_helper< typename boost::remove_cv<T>::type>::value>
+                              Has_result_type_helper< std::remove_cv_t<T>>::value>
 {};
 
 template <typename T>
@@ -191,10 +190,10 @@ class Lazy_kernel_generic_base : protected internal::Enum_holder
   template <typename Construction, typename Dummy = boost::none_t>
   struct Lazy_wrapper_traits :
     boost::mpl::eval_if< internal::Has_result_type<Construction>,
-                         boost::mpl::eval_if< std::is_same< typename boost::remove_cv<
+                         boost::mpl::eval_if< std::is_same< std::remove_cv_t<
                                                             typename boost::remove_reference<
                                                               typename internal::Lazy_result_type<Construction>::type
-                                                                  >::type >::type,
+                                                                  >::type >,
                                                             typename Approximate_kernel::FT>,
                                               boost::mpl::int_<NT>,
                                               boost::mpl::eval_if< std::is_same< typename internal::Lazy_result_type<Construction>::type,
diff --git a/Kernel_23/include/CGAL/Kernel/Type_mapper.h b/Kernel_23/include/CGAL/Kernel/Type_mapper.h
index 683b7fe9255c..05556ce3534b 100644
--- a/Kernel_23/include/CGAL/Kernel/Type_mapper.h
+++ b/Kernel_23/include/CGAL/Kernel/Type_mapper.h
@@ -21,7 +21,6 @@
 
 #include <vector>
 
-#include <boost/type_traits/remove_cv.hpp>
 #include <boost/type_traits/remove_reference.hpp>
 
 #include <boost/mpl/transform.hpp>
@@ -111,9 +110,9 @@ struct Type_mapper_impl < typename K1::FT, K1, K2 >
 
 template < typename T, typename K1, typename K2 >
 struct Type_mapper :
-    internal::Type_mapper_impl< typename boost::remove_cv<
+    internal::Type_mapper_impl< std::remove_cv_t<
                                   typename boost::remove_reference < T >::type
-                                  >::type, K1, K2 >
+                                  >, K1, K2 >
 { };
 
 } //namespace CGAL
diff --git a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
index 59cd91281cc1..658b54caef6a 100644
--- a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
+++ b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
@@ -33,7 +33,6 @@
 
 #include <boost/dynamic_bitset.hpp>
 #include <boost/type_traits/remove_reference.hpp>
-#include <boost/type_traits/remove_cv.hpp>
 #include <boost/type_traits/is_function.hpp>
 #include <boost/mpl/if.hpp>
 
@@ -157,7 +156,7 @@ class Implicit_multi_domain_to_labeling_function_wrapper
   {
   public:
     typedef typename boost::remove_reference<
-            typename boost::remove_cv< Point_ >::type>::type Point;
+            std::remove_cv_t< Point_ >>::type Point;
   };
 
 public:
diff --git a/STL_Extension/include/CGAL/is_streamable.h b/STL_Extension/include/CGAL/is_streamable.h
index dabeb375728e..6e1fb41e87e9 100644
--- a/STL_Extension/include/CGAL/is_streamable.h
+++ b/STL_Extension/include/CGAL/is_streamable.h
@@ -11,7 +11,6 @@
 #define CGAL_IS_STREAMABLE_H
 
 #include <boost/type_traits/remove_reference.hpp>
-#include <boost/type_traits/remove_cv.hpp>
 #include <iostream>
 
 namespace CGAL {
@@ -50,8 +49,8 @@ namespace is_streamable
   template <class T>
   struct is_streamable_impl
   {
-    static typename boost::remove_cv<typename boost::remove_reference<T>::type>::type const & x;
-    static typename boost::remove_cv<typename boost::remove_reference<T>::type>::type  & y;
+    static std::remove_cv_t<typename boost::remove_reference<T>::type> const & x;
+    static std::remove_cv_t<typename boost::remove_reference<T>::type>  & y;
 
     static const bool value =
       sizeof(is_streamable::check(std::cout << x)) == sizeof(is_streamable::yes) &&
diff --git a/STL_Extension/include/CGAL/transforming_iterator.h b/STL_Extension/include/CGAL/transforming_iterator.h
index 7caa2d3b1a24..2605dc0a3ce5 100644
--- a/STL_Extension/include/CGAL/transforming_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_iterator.h
@@ -55,7 +55,7 @@ class transforming_iterator_helper
                 decltype(std::declval<F>()(std::declval<Iter_ref>()))
                         >::type reference_;
 
-        typedef typename Default::Get<Val,typename boost::remove_cv<typename boost::remove_reference<reference_>::type>::type>::type value_type;
+        typedef typename Default::Get<Val,std::remove_cv_t<typename boost::remove_reference<reference_>::type>>::type value_type;
 
         // Crappy heuristic. If we have *it that returns a Weighted_point and F that returns a reference to the Point contained in the Weighted_point it takes as argument, we do NOT want the transformed iterator to return a reference to the temporary *it. On the other hand, if *it returns an int n, and F returns a reference to array[n] it is not so good to lose the reference. This probably should be done elsewhere and should at least be made optional...
         typedef typename boost::mpl::if_<
diff --git a/STL_Extension/include/CGAL/transforming_pair_iterator.h b/STL_Extension/include/CGAL/transforming_pair_iterator.h
index 4e59bb9282a7..bf397f39a1aa 100644
--- a/STL_Extension/include/CGAL/transforming_pair_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_pair_iterator.h
@@ -47,7 +47,7 @@ class transforming_pair_iterator_helper
                 decltype(std::declval<F>()(std::declval<typename std::iterator_traits<It1>::reference>(),std::declval<typename std::iterator_traits<It2>::reference>()))
                         >::type reference;
 
-        typedef typename Default::Get<Val,typename boost::remove_cv<typename boost::remove_reference<reference>::type>::type>::type value_type;
+        typedef typename Default::Get<Val,std::remove_cv_t<typename boost::remove_reference<reference>::type>>::type value_type;
 
         public:
         typedef boost::iterator_facade<
diff --git a/STL_Extension/include/CGAL/type_traits/is_iterator.h b/STL_Extension/include/CGAL/type_traits/is_iterator.h
index f8010ab35b3f..e31fd88686bf 100644
--- a/STL_Extension/include/CGAL/type_traits/is_iterator.h
+++ b/STL_Extension/include/CGAL/type_traits/is_iterator.h
@@ -20,7 +20,6 @@
 #include <boost/type_traits/is_convertible.hpp>
 #include <boost/type_traits/is_pointer.hpp>
 #include <boost/type_traits/remove_reference.hpp>
-#include <boost/type_traits/remove_cv.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/mpl/logical.hpp>
 
@@ -65,7 +64,7 @@ struct is_iterator_type_<T, U, true>
 // NOTE: we don't want the real std::decay or functions are included
 template <class T>
 struct is_iterator
-  : public internal::is_iterator_<typename boost::remove_cv<typename boost::remove_reference<T>::type>::type>
+  : public internal::is_iterator_<std::remove_cv_t<typename boost::remove_reference<T>::type>>
 { };
 
 template <class T>
@@ -73,7 +72,7 @@ CGAL_CPP17_INLINE constexpr bool is_iterator_v = is_iterator<T>::value;
 
 template <class T, class Tag>
 struct is_iterator_type
-  : public internal::is_iterator_type_<typename boost::remove_cv<typename boost::remove_reference<T>::type>::type, Tag>
+  : public internal::is_iterator_type_<std::remove_cv_t<typename boost::remove_reference<T>::type>, Tag>
 { };
 
 template <class T, class Tag>
diff --git a/Spatial_searching/include/CGAL/Fuzzy_iso_box.h b/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
index 3aeaeb550e89..24ef22fb8a63 100644
--- a/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
+++ b/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
@@ -23,7 +23,6 @@
 #include <CGAL/Search_traits_adapter.h>
 
 #include <boost/mpl/if.hpp>
-#include <boost/type_traits/remove_cv.hpp>
 #include <boost/type_traits/remove_reference.hpp>
 
 #include <type_traits>
@@ -63,9 +62,9 @@ namespace CGAL {
 
     private:
 
-    typename boost::remove_cv<
+    std::remove_cv_t<
       typename boost::remove_reference< typename Construct_min_vertex_d::result_type >::type
-      >::type min, max;
+      > min, max;
     Cartesian_const_iterator_d min_begin, max_begin;
     FT eps;
     unsigned int dim;

From 8b3acae1c737e4fc61e20d2cf84cfee8f48c35fa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 19:23:16 +0200
Subject: [PATCH 0224/1398] boost::remove_reference -> std::remove_reference

---
 .../include/CGAL/Arr_circular_line_arc_traits_2.h         | 8 ++++----
 Filtered_kernel/include/CGAL/Lazy.h                       | 4 ++--
 Filtered_kernel/include/CGAL/Lazy_kernel.h                | 5 ++---
 .../Generator/internal/Generic_random_point_generator.h   | 4 ++--
 Kernel_23/include/CGAL/Kernel/Type_mapper.h               | 4 +---
 Mesh_3/benchmark/Mesh_3/StdAfx.h                          | 1 -
 .../include/CGAL/Implicit_to_labeling_function_wrapper.h  | 5 ++---
 NewKernel_d/include/CGAL/NewKernel_d/utils.h              | 2 +-
 .../internal/Corefinement/face_graph_utils.h              | 1 -
 STL_Extension/include/CGAL/is_streamable.h                | 5 ++---
 STL_Extension/include/CGAL/iterator.h                     | 2 +-
 STL_Extension/include/CGAL/transforming_iterator.h        | 2 +-
 STL_Extension/include/CGAL/transforming_pair_iterator.h   | 2 +-
 STL_Extension/include/CGAL/type_traits/is_iterator.h      | 5 ++---
 STL_Extension/include/CGAL/vector.h                       | 5 ++---
 Spatial_searching/include/CGAL/Fuzzy_iso_box.h            | 3 +--
 16 files changed, 24 insertions(+), 34 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
index e913bc9f7db5..4d5c07d46eac 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
@@ -352,7 +352,7 @@ namespace CGAL {
       //typedef const result_type&       qualified_result_type;
 
       template < typename T >
-      //typename boost::remove_reference<qualified_result_type>::type
+      //std::remove_reference_t<qualified_result_type>
         Circular_arc_point_2
       operator()(const T &a) const
       {
@@ -370,7 +370,7 @@ namespace CGAL {
       typedef Point_2                  result_type;
       //typedef const result_type&       qualified_result_type;
 
-      //typename boost::remove_reference<qualified_result_type>::type
+      //std::remove_reference_t<qualified_result_type>
       result_type
       operator() (const boost::variant< Arc1, Arc2 > & cv) const
       {
@@ -397,7 +397,7 @@ namespace CGAL {
       //typedef const result_type&       qualified_result_type;
 
       template < typename T >
-      //typename boost::remove_reference<qualified_result_type>::type
+      //std::remove_reference_t<qualified_result_type>
         Circular_arc_point_2
       operator()(const T &a) const
       {
@@ -420,7 +420,7 @@ namespace CGAL {
       typedef Point_2                  result_type;
       //typedef const result_type&       qualified_result_type;
 
-       //typename boost::remove_reference<qualified_result_type>::type
+       //std::remove_reference<qualified_result_type>
       result_type
        operator() (const boost::variant< Arc1, Arc2 > & cv) const
       {
diff --git a/Filtered_kernel/include/CGAL/Lazy.h b/Filtered_kernel/include/CGAL/Lazy.h
index 6496d7066a21..43d6a5ddc111 100644
--- a/Filtered_kernel/include/CGAL/Lazy.h
+++ b/Filtered_kernel/include/CGAL/Lazy.h
@@ -2089,9 +2089,9 @@ struct Lazy_construction<LK, AC, EC, E2A_, true> {
   typedef typename LK::Approximate_kernel AK;
   typedef typename LK::Exact_kernel EK;
   typedef std::remove_cv_t<
-    typename boost::remove_reference < typename AC::result_type >::type > AT;
+    std::remove_reference_t < typename AC::result_type > > AT;
   typedef std::remove_cv_t<
-    typename boost::remove_reference < typename EC::result_type >::type > ET;
+    std::remove_reference_t < typename EC::result_type > > ET;
 
   typedef typename Default::Get<E2A_, typename LK::E2A>::type E2A;
 
diff --git a/Filtered_kernel/include/CGAL/Lazy_kernel.h b/Filtered_kernel/include/CGAL/Lazy_kernel.h
index 7c5888e8f961..a510d4c43739 100644
--- a/Filtered_kernel/include/CGAL/Lazy_kernel.h
+++ b/Filtered_kernel/include/CGAL/Lazy_kernel.h
@@ -29,7 +29,6 @@
 #include <boost/none.hpp>
 #include <boost/mpl/if.hpp>
 #include <boost/mpl/or.hpp>
-#include <boost/type_traits/remove_reference.hpp>
 
 #if defined(BOOST_MSVC)
 #  pragma warning(push)
@@ -191,9 +190,9 @@ class Lazy_kernel_generic_base : protected internal::Enum_holder
   struct Lazy_wrapper_traits :
     boost::mpl::eval_if< internal::Has_result_type<Construction>,
                          boost::mpl::eval_if< std::is_same< std::remove_cv_t<
-                                                            typename boost::remove_reference<
+                                                            std::remove_reference_t<
                                                               typename internal::Lazy_result_type<Construction>::type
-                                                                  >::type >,
+                                                                  > >,
                                                             typename Approximate_kernel::FT>,
                                               boost::mpl::int_<NT>,
                                               boost::mpl::eval_if< std::is_same< typename internal::Lazy_result_type<Construction>::type,
diff --git a/Generator/include/CGAL/Generator/internal/Generic_random_point_generator.h b/Generator/include/CGAL/Generator/internal/Generic_random_point_generator.h
index a161df1da76f..958915aa6356 100644
--- a/Generator/include/CGAL/Generator/internal/Generic_random_point_generator.h
+++ b/Generator/include/CGAL/Generator/internal/Generic_random_point_generator.h
@@ -118,8 +118,8 @@ struct Apply_approx_sqrt
   Apply_approx_sqrt(const Functor& f) : Functor(f) { }
 
   template <class T>
-  typename boost::remove_reference<
-             typename cpp11::result_of<Functor(const T&)>::type>::type
+  std::remove_reference_t<
+             typename cpp11::result_of<Functor(const T&)>::type>
   operator()(const T& t) const
   {
     return approximate_sqrt( static_cast<const Functor&>(*this)(t) );
diff --git a/Kernel_23/include/CGAL/Kernel/Type_mapper.h b/Kernel_23/include/CGAL/Kernel/Type_mapper.h
index 05556ce3534b..6b3ce37ed857 100644
--- a/Kernel_23/include/CGAL/Kernel/Type_mapper.h
+++ b/Kernel_23/include/CGAL/Kernel/Type_mapper.h
@@ -21,8 +21,6 @@
 
 #include <vector>
 
-#include <boost/type_traits/remove_reference.hpp>
-
 #include <boost/mpl/transform.hpp>
 #include <boost/mpl/remove.hpp>
 
@@ -111,7 +109,7 @@ struct Type_mapper_impl < typename K1::FT, K1, K2 >
 template < typename T, typename K1, typename K2 >
 struct Type_mapper :
     internal::Type_mapper_impl< std::remove_cv_t<
-                                  typename boost::remove_reference < T >::type
+                                  std::remove_reference_t< T >
                                   >, K1, K2 >
 { };
 
diff --git a/Mesh_3/benchmark/Mesh_3/StdAfx.h b/Mesh_3/benchmark/Mesh_3/StdAfx.h
index 8cf35e5a5036..d99e062fcbe0 100644
--- a/Mesh_3/benchmark/Mesh_3/StdAfx.h
+++ b/Mesh_3/benchmark/Mesh_3/StdAfx.h
@@ -140,7 +140,6 @@
 #include <boost/type_traits/is_const.hpp>
 #include <boost/type_traits/is_convertible.hpp>
 #include <boost/type_traits/is_reference.hpp>
-#include <boost/type_traits/remove_reference.hpp>
 #include <boost/utility.hpp>
 #include <boost/variant.hpp>
 #include <boost/version.hpp>
diff --git a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
index 658b54caef6a..0be7ea4e7414 100644
--- a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
+++ b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
@@ -32,7 +32,6 @@
 #endif
 
 #include <boost/dynamic_bitset.hpp>
-#include <boost/type_traits/remove_reference.hpp>
 #include <boost/type_traits/is_function.hpp>
 #include <boost/mpl/if.hpp>
 
@@ -155,8 +154,8 @@ class Implicit_multi_domain_to_labeling_function_wrapper
   class Implicit_function_traits<RT_ (*)(Point_)>
   {
   public:
-    typedef typename boost::remove_reference<
-            std::remove_cv_t< Point_ >>::type Point;
+    typedef std::remove_reference_t<
+            std::remove_cv_t< Point_ >> Point;
   };
 
 public:
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/utils.h b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
index 487eae5bc108..fb661f5397e2 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/utils.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
@@ -104,7 +104,7 @@ struct Has_type_different_from <T, No, true>
         template<class T,class U> struct Type_copy_cv<T const volatile,U> { typedef U const volatile type; };
 
         template<class T,class U> struct Type_copy_cvref :
-                Type_copy_ref<T,typename Type_copy_cv<typename boost::remove_reference<T>::type,U>::type> {};
+                Type_copy_ref<T,typename Type_copy_cv<std::remove_reference_t<T>,U>::type> {};
 
         struct Dereference_functor {
                 template<class> struct result{};
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
index ee3d3159491a..d05e9ff97b1e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
@@ -19,7 +19,6 @@
 #include <CGAL/Polygon_mesh_processing/orientation.h>
 #include <CGAL/property_map.h>
 #include <boost/type_traits/is_const.hpp>
-#include <boost/type_traits/remove_reference.hpp>
 #include <boost/mpl/if.hpp>
 #include <fstream>
 #include <sstream>
diff --git a/STL_Extension/include/CGAL/is_streamable.h b/STL_Extension/include/CGAL/is_streamable.h
index 6e1fb41e87e9..bc0173931b6c 100644
--- a/STL_Extension/include/CGAL/is_streamable.h
+++ b/STL_Extension/include/CGAL/is_streamable.h
@@ -10,7 +10,6 @@
 #ifndef CGAL_IS_STREAMABLE_H
 #define CGAL_IS_STREAMABLE_H
 
-#include <boost/type_traits/remove_reference.hpp>
 #include <iostream>
 
 namespace CGAL {
@@ -49,8 +48,8 @@ namespace is_streamable
   template <class T>
   struct is_streamable_impl
   {
-    static std::remove_cv_t<typename boost::remove_reference<T>::type> const & x;
-    static std::remove_cv_t<typename boost::remove_reference<T>::type>  & y;
+    static std::remove_cv_t<std::remove_reference_t<T>> const & x;
+    static std::remove_cv_t<std::remove_reference_t<T>>  & y;
 
     static const bool value =
       sizeof(is_streamable::check(std::cout << x)) == sizeof(is_streamable::yes) &&
diff --git a/STL_Extension/include/CGAL/iterator.h b/STL_Extension/include/CGAL/iterator.h
index ea9a964c8a38..22cead434c7b 100644
--- a/STL_Extension/include/CGAL/iterator.h
+++ b/STL_Extension/include/CGAL/iterator.h
@@ -58,7 +58,7 @@ class Prevent_deref
   Prevent_deref(const I& i) : Base(i) {}
 private:
   friend class boost::iterator_core_access;
-  reference dereference() const { return const_cast<typename boost::remove_reference<reference>::type&>(this->base_reference()); }
+  reference dereference() const { return const_cast<std::remove_reference_t<reference>&>(this->base_reference()); }
 };
 
 template<typename I>
diff --git a/STL_Extension/include/CGAL/transforming_iterator.h b/STL_Extension/include/CGAL/transforming_iterator.h
index 2605dc0a3ce5..ed58473b0c50 100644
--- a/STL_Extension/include/CGAL/transforming_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_iterator.h
@@ -55,7 +55,7 @@ class transforming_iterator_helper
                 decltype(std::declval<F>()(std::declval<Iter_ref>()))
                         >::type reference_;
 
-        typedef typename Default::Get<Val,std::remove_cv_t<typename boost::remove_reference<reference_>::type>>::type value_type;
+        typedef typename Default::Get<Val,std::remove_cv_t<std::remove_reference_t<reference_>>>::type value_type;
 
         // Crappy heuristic. If we have *it that returns a Weighted_point and F that returns a reference to the Point contained in the Weighted_point it takes as argument, we do NOT want the transformed iterator to return a reference to the temporary *it. On the other hand, if *it returns an int n, and F returns a reference to array[n] it is not so good to lose the reference. This probably should be done elsewhere and should at least be made optional...
         typedef typename boost::mpl::if_<
diff --git a/STL_Extension/include/CGAL/transforming_pair_iterator.h b/STL_Extension/include/CGAL/transforming_pair_iterator.h
index bf397f39a1aa..22e1bc610800 100644
--- a/STL_Extension/include/CGAL/transforming_pair_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_pair_iterator.h
@@ -47,7 +47,7 @@ class transforming_pair_iterator_helper
                 decltype(std::declval<F>()(std::declval<typename std::iterator_traits<It1>::reference>(),std::declval<typename std::iterator_traits<It2>::reference>()))
                         >::type reference;
 
-        typedef typename Default::Get<Val,std::remove_cv_t<typename boost::remove_reference<reference>::type>>::type value_type;
+        typedef typename Default::Get<Val,std::remove_cv_t<std::remove_reference_t<reference>>>::type value_type;
 
         public:
         typedef boost::iterator_facade<
diff --git a/STL_Extension/include/CGAL/type_traits/is_iterator.h b/STL_Extension/include/CGAL/type_traits/is_iterator.h
index e31fd88686bf..837c91e0330c 100644
--- a/STL_Extension/include/CGAL/type_traits/is_iterator.h
+++ b/STL_Extension/include/CGAL/type_traits/is_iterator.h
@@ -19,7 +19,6 @@
 
 #include <boost/type_traits/is_convertible.hpp>
 #include <boost/type_traits/is_pointer.hpp>
-#include <boost/type_traits/remove_reference.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/mpl/logical.hpp>
 
@@ -64,7 +63,7 @@ struct is_iterator_type_<T, U, true>
 // NOTE: we don't want the real std::decay or functions are included
 template <class T>
 struct is_iterator
-  : public internal::is_iterator_<std::remove_cv_t<typename boost::remove_reference<T>::type>>
+  : public internal::is_iterator_<std::remove_cv_t<std::remove_reference_t<T>>>
 { };
 
 template <class T>
@@ -72,7 +71,7 @@ CGAL_CPP17_INLINE constexpr bool is_iterator_v = is_iterator<T>::value;
 
 template <class T, class Tag>
 struct is_iterator_type
-  : public internal::is_iterator_type_<std::remove_cv_t<typename boost::remove_reference<T>::type>, Tag>
+  : public internal::is_iterator_type_<std::remove_cv_t<std::remove_reference_t<T>>, Tag>
 { };
 
 template <class T, class Tag>
diff --git a/STL_Extension/include/CGAL/vector.h b/STL_Extension/include/CGAL/vector.h
index 092bde6a6556..9dd7def871be 100644
--- a/STL_Extension/include/CGAL/vector.h
+++ b/STL_Extension/include/CGAL/vector.h
@@ -25,7 +25,6 @@
 #include <memory>
 #include <cstddef>
 #include <functional>
-#include <boost/type_traits/remove_reference.hpp>
 #include <boost/type_traits/remove_pointer.hpp>
 
 namespace CGAL {
@@ -118,7 +117,7 @@ class vector_iterator {
 
     vector_iterator<  T,
                       std::remove_const_t<
-                        typename boost::remove_reference<Ref>::type
+                        std::remove_reference_t<Ref>
                       >&,
                       std::remove_const_t<
                           typename boost::remove_pointer<Ptr>::type
@@ -129,7 +128,7 @@ class vector_iterator {
                 typename boost::remove_pointer<Ptr>::type
               >* Ptr_no_c;
       return  vector_iterator< T,
-                     std::remove_const_t<typename boost::remove_reference<Ref>::type>::type&,
+                     std::remove_const_t<std::remove_reference_t<Ref>>&,
                      Ptr_no_c>
               ( const_cast<Ptr_no_c>(ptr) );
     }
diff --git a/Spatial_searching/include/CGAL/Fuzzy_iso_box.h b/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
index 24ef22fb8a63..0b34898eff93 100644
--- a/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
+++ b/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
@@ -23,7 +23,6 @@
 #include <CGAL/Search_traits_adapter.h>
 
 #include <boost/mpl/if.hpp>
-#include <boost/type_traits/remove_reference.hpp>
 
 #include <type_traits>
 
@@ -63,7 +62,7 @@ namespace CGAL {
     private:
 
     std::remove_cv_t<
-      typename boost::remove_reference< typename Construct_min_vertex_d::result_type >::type
+      std::remove_reference_t< typename Construct_min_vertex_d::result_type >
       > min, max;
     Cartesian_const_iterator_d min_begin, max_begin;
     FT eps;

From b99c384528eecd03ebedb4e8d88525604ffbe5d1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 19:25:48 +0200
Subject: [PATCH 0225/1398] boost::remove_pointer -> std::remove_pointer

---
 .../Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp    | 4 ++--
 STL_Extension/include/CGAL/vector.h                          | 5 ++---
 2 files changed, 4 insertions(+), 5 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 37dcedc8adb2..53693c316379 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -122,8 +122,8 @@ void split_long_duplicated_edge(const HedgeRange& hedge_range,
 {
   typedef typename HedgeRange::value_type Pair;
   typedef typename Pair::first_type halfedge_descriptor;
-  typedef typename boost::remove_pointer<
-    typename Pair::second_type>::type TriangleMesh;
+  typedef std::remove_pointer_t<
+    typename Pair::second_type> TriangleMesh;
   typedef typename boost::property_map<TriangleMesh,
     CGAL::vertex_point_t>::type PointPMap;
   typedef typename boost::property_traits<PointPMap>::value_type Point_3;
diff --git a/STL_Extension/include/CGAL/vector.h b/STL_Extension/include/CGAL/vector.h
index 9dd7def871be..ebbc1f2872a1 100644
--- a/STL_Extension/include/CGAL/vector.h
+++ b/STL_Extension/include/CGAL/vector.h
@@ -25,7 +25,6 @@
 #include <memory>
 #include <cstddef>
 #include <functional>
-#include <boost/type_traits/remove_pointer.hpp>
 
 namespace CGAL {
 
@@ -120,12 +119,12 @@ class vector_iterator {
                         std::remove_reference_t<Ref>
                       >&,
                       std::remove_const_t<
-                          typename boost::remove_pointer<Ptr>::type
+                          std::remove_pointer_t<Ptr>
                       >* >
     remove_const() const
     {
       typedef std::remove_const_t<
-                typename boost::remove_pointer<Ptr>::type
+                std::remove_pointer_t<Ptr>
               >* Ptr_no_c;
       return  vector_iterator< T,
                      std::remove_const_t<std::remove_reference_t<Ref>>&,

From 7b85df810d9d17d02d46d87b76c3ae76b8947942 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 19:32:03 +0200
Subject: [PATCH 0226/1398] boost::add_const -> std::add_const

---
 .../Triangulation_3/test_regular_insert_range_with_info.cpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Triangulation_3/test/Triangulation_3/test_regular_insert_range_with_info.cpp b/Triangulation_3/test/Triangulation_3/test_regular_insert_range_with_info.cpp
index 675380a06849..e4f80d9149f0 100644
--- a/Triangulation_3/test/Triangulation_3/test_regular_insert_range_with_info.cpp
+++ b/Triangulation_3/test/Triangulation_3/test_regular_insert_range_with_info.cpp
@@ -38,7 +38,7 @@ struct Tester
   {
     typedef std::vector<std::pair<Weighted_point, unsigned> >              Container;
     typedef typename boost::mpl::if_<boost::mpl::bool_<is_const>,
-                                     typename boost::add_const<Container>::type,
+                                     std::add_const_t<Container>,
                                      Container>::type                      Cast_type;
 
     Container points;
@@ -91,7 +91,7 @@ struct Tester
   {
     typedef std::vector<Weighted_point>                                   Container;
     typedef typename boost::mpl::if_<boost::mpl::bool_<is_const>,
-                                     typename boost::add_const<Container>::type,
+                                     std::add_const_t<Container>,
                                      Container >::type                    Cast_type;
 
     Container points;
@@ -157,7 +157,7 @@ struct Tester
   {
     typedef std::vector< Weighted_point >                                   Container;
     typedef typename boost::mpl::if_<boost::mpl::bool_<is_const>,
-                                     typename boost::add_const<Container>::type,
+                                     std::add_const_t<Container>,
                                      Container >::type                      Cast_type;
 
     Container points;

From a88af6c0c621375c1f732cc7d1c67381cb8b55d0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 19:34:58 +0200
Subject: [PATCH 0227/1398] boost::array -> std::array

---
 AABB_tree/test/AABB_tree/aabb_test_multi_mesh.cpp          | 1 -
 AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp    | 3 +--
 .../Curved_kernel_via_analysis_2/Curve_renderer_facade.h   | 1 -
 CGAL_ImageIO/include/CGAL/SEP_header.h                     | 7 +++----
 .../include/CGAL/Periodic_3_regular_triangulation_3.h      | 2 +-
 .../include/CGAL/Poisson_reconstruction_function.h         | 1 -
 .../Plugins/Classification/Cluster_classification.cpp      | 1 -
 .../Classification/Point_set_item_classification.cpp       | 1 -
 .../Classification/Surface_mesh_item_classification.cpp    | 1 -
 .../demo/Polyhedron/Scene_points_with_normal_item.cpp      | 1 -
 Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.h       | 4 +---
 Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.h       | 1 -
 STL_Extension/include/CGAL/array.h                         | 2 +-
 Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h      | 5 ++---
 .../square_border_parameterizer.cpp                        | 4 +---
 .../Orbifold_Tutte_parameterizer_3.h                       | 1 -
 .../Surface_mesh_shortest_path_traits.h                    | 2 --
 .../Tetrahedral_remeshing/internal/collapse_short_edges.h  | 5 ++---
 18 files changed, 12 insertions(+), 31 deletions(-)

diff --git a/AABB_tree/test/AABB_tree/aabb_test_multi_mesh.cpp b/AABB_tree/test/AABB_tree/aabb_test_multi_mesh.cpp
index 5b78ff330163..3b2307a134b5 100644
--- a/AABB_tree/test/AABB_tree/aabb_test_multi_mesh.cpp
+++ b/AABB_tree/test/AABB_tree/aabb_test_multi_mesh.cpp
@@ -3,7 +3,6 @@
 #include <iterator>
 
 #include <boost/functional/value_factory.hpp>
-#include <boost/array.hpp>
 
 #include <CGAL/algorithm.h>
 #include <CGAL/point_generators_3.h>
diff --git a/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp b/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp
index 4e86ed22d7fd..649f594d7e9c 100644
--- a/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp
+++ b/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp
@@ -3,7 +3,6 @@
 #include <iterator>
 
 #include <boost/functional/value_factory.hpp>
-#include <boost/array.hpp>
 
 #include <CGAL/assertions.h>
 #include <CGAL/algorithm.h>
@@ -92,7 +91,7 @@ int main()
   Vector bbox_center((bbox.xmin() + bbox.xmax()) / 2,
                      (bbox.ymin() + bbox.ymax()) / 2,
                      (bbox.zmin() + bbox.zmax()) / 2);
-  boost::array<double, 3> extents;
+  std::array<double, 3> extents;
   extents[0] = bbox.xmax() - bbox.xmin();
   extents[1] = bbox.ymax() - bbox.ymin();
   extents[2] = bbox.zmax() - bbox.zmin();
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
index c1ece0d0d577..5e95ec2d7310 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
@@ -62,7 +62,6 @@
 #include <CGAL/Bbox_2.h>
 #include <CGAL/Arithmetic_kernel.h>
 
-#include <boost/array.hpp>
 #include <CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h>
 
 
diff --git a/CGAL_ImageIO/include/CGAL/SEP_header.h b/CGAL_ImageIO/include/CGAL/SEP_header.h
index 17c40493ef54..9bf345d4c6eb 100644
--- a/CGAL_ImageIO/include/CGAL/SEP_header.h
+++ b/CGAL_ImageIO/include/CGAL/SEP_header.h
@@ -20,7 +20,6 @@
 
 #include <boost/tuple/tuple.hpp>
 #include <boost/fusion/adapted/boost_tuple.hpp>
-#include <boost/array.hpp>
 #include <boost/spirit/include/qi.hpp>
 #include <boost/phoenix/core.hpp>
 #include <boost/phoenix/operator.hpp>
@@ -106,9 +105,9 @@ namespace CGAL {
 
 class SEP_header {
 
-  boost::array<std::size_t, 3> _n;
-  boost::array<double, 3> _d;
-  boost::array<double, 3> _o;
+  std::array<std::size_t, 3> _n;
+  std::array<double, 3> _d;
+  std::array<double, 3> _o;
 
   SEP_header_aux::String_dict _string_dict;
 
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h
index 59aafb7f27a9..5dcdca4f3052 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h
@@ -902,7 +902,7 @@ class Periodic_3_regular_triangulation_3
       std::cout << "four offsets: " << std::endl;
 #endif
 
-      boost::array<int, 4> offsets;
+      std::array<int, 4> offsets;
       for(int i=0; i<4; ++i)
       {
 #ifdef CGAL_PERIODIC_SET_POINT_VERBOSE
diff --git a/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h b/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h
index bd0281cd9d77..300a84fdaced 100644
--- a/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h
+++ b/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h
@@ -45,7 +45,6 @@
 #include <CGAL/Timer.h>
 
 #include <memory>
-#include <boost/array.hpp>
 #include <boost/type_traits/is_convertible.hpp>
 #include <boost/iterator/indirect_iterator.hpp>
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp b/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp
index cc1393e2ec2e..b26135e231ae 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.cpp
@@ -19,7 +19,6 @@
 #include <set>
 #include <stack>
 #include <algorithm>
-#include <boost/array.hpp>
 
 Cluster_classification::Cluster_classification(Scene_points_with_normal_item* points)
   : m_points (points)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp b/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp
index 617692963d12..12bc858fea91 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Classification/Point_set_item_classification.cpp
@@ -14,7 +14,6 @@
 #include <set>
 #include <stack>
 #include <algorithm>
-#include <boost/array.hpp>
 
 Point_set_item_classification::Point_set_item_classification(Scene_points_with_normal_item* points)
   : m_points (points)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Classification/Surface_mesh_item_classification.cpp b/Polyhedron/demo/Polyhedron/Plugins/Classification/Surface_mesh_item_classification.cpp
index 3fc12e4dd2f1..4880c0917db3 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Classification/Surface_mesh_item_classification.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Classification/Surface_mesh_item_classification.cpp
@@ -11,7 +11,6 @@
 #include <set>
 #include <stack>
 #include <algorithm>
-#include <boost/array.hpp>
 
 Surface_mesh_item_classification::Surface_mesh_item_classification(Scene_surface_mesh_item* mesh)
   : m_mesh (mesh),
diff --git a/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp b/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp
index e2b93295cbc6..94a03a4c6f0b 100644
--- a/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp
@@ -30,7 +30,6 @@
 #include <set>
 #include <stack>
 #include <algorithm>
-#include <boost/array.hpp>
 
 #include <CGAL/boost/graph/properties_Surface_mesh.h>
 
diff --git a/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.h b/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.h
index 9fd1aed124ff..fcc57b4ab509 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.h
@@ -4,8 +4,6 @@
 #include  <CGAL/Three/Scene_item_rendering_helper.h>
 #include "SMesh_type.h"
 
-#include <boost/array.hpp>
-
 #include <iostream>
 
 struct Scene_polygon_soup_item_priv;
@@ -18,7 +16,7 @@ struct Polygon_soup
     //vector containing a pair of indices of points in Points and a set of indices of Polygons
     //containing the edge.
     typedef std::map<std::pair<std::size_t, std::size_t>, std::set<std::size_t> > Edges_map;
-    typedef boost::array<std::size_t, 2> Edge;
+    typedef std::array<std::size_t, 2> Edge;
     typedef std::vector<Polygon_3> Polygons;
     typedef std::vector<CGAL::IO::Color> Colors;
     typedef std::set<Edge> Edges;
diff --git a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.h b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.h
index 7639c066a5e8..812a1dc053bb 100644
--- a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.h
@@ -21,7 +21,6 @@
 #ifndef Q_MOC_RUN
 #include <vector>
 #include <boost/scoped_ptr.hpp>
-#include <boost/array.hpp>
 #endif
 
 #include <QColor>
diff --git a/STL_Extension/include/CGAL/array.h b/STL_Extension/include/CGAL/array.h
index ff234183f99d..eb6d4c086e9e 100644
--- a/STL_Extension/include/CGAL/array.h
+++ b/STL_Extension/include/CGAL/array.h
@@ -37,7 +37,7 @@ namespace CGAL {
 
 // NOTE : The above is actually untrue !  It is possible to do :
 //     struct S2 {
-//       typedef boost::array<M,2> Ar;
+//       typedef std::array<M,2> Ar;
 //       Ar m;
 //       S2 (const M&a) : m ((Ar) { { a, a } }) {}
 //     };
diff --git a/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h b/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
index 8a4b5c0921ee..c109f002a3a6 100644
--- a/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
+++ b/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
@@ -34,7 +34,6 @@
 #include <CGAL/property_map.h>
 
 #include <boost/cstdint.hpp>
-#include <boost/array.hpp>
 #include <boost/iterator/iterator_facade.hpp>
 
 #include <algorithm>
@@ -1084,7 +1083,7 @@ class Surface_mesh
     /// \returns the face index of the added face, or `Surface_mesh::null_face()` if the face could not be added.
     Face_index add_face(Vertex_index v0, Vertex_index v1, Vertex_index v2)
     {
-        boost::array<Vertex_index, 3>
+        std::array<Vertex_index, 3>
             v = {{v0, v1, v2}};
         return add_face(v);
     }
@@ -1093,7 +1092,7 @@ class Surface_mesh
     /// \returns the face index of the added face, or `Surface_mesh::null_face()` if the face could not be added.
     Face_index add_face(Vertex_index v0, Vertex_index v1, Vertex_index v2, Vertex_index v3)
     {
-        boost::array<Vertex_index, 4>
+        std::array<Vertex_index, 4>
             v = {{v0, v1, v2, v3}};
         return add_face(v);
     }
diff --git a/Surface_mesh_parameterization/examples/Surface_mesh_parameterization/square_border_parameterizer.cpp b/Surface_mesh_parameterization/examples/Surface_mesh_parameterization/square_border_parameterizer.cpp
index 5784d3a1fdb9..09f644dd47db 100644
--- a/Surface_mesh_parameterization/examples/Surface_mesh_parameterization/square_border_parameterizer.cpp
+++ b/Surface_mesh_parameterization/examples/Surface_mesh_parameterization/square_border_parameterizer.cpp
@@ -10,8 +10,6 @@
 #include <CGAL/Polygon_mesh_processing/measure.h>
 #include <CGAL/Unique_hash_map.h>
 
-#include <boost/array.hpp>
-
 #include <unordered_set>
 #include <cstdlib>
 #include <iostream>
@@ -28,7 +26,7 @@ typedef boost::graph_traits<PolyMesh>::face_descriptor           face_descriptor
 
 typedef boost::graph_traits<PolyMesh>::vertex_iterator           vertex_iterator;
 
-typedef boost::array<vertex_descriptor, 4>                       Vd_array;
+typedef std::array<vertex_descriptor, 4>                       Vd_array;
 
 typedef CGAL::Unique_hash_map<vertex_descriptor, Point_2>        UV_uhm;
 typedef boost::associative_property_map<UV_uhm>                  UV_pmap;
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h
index c23ce5bf15d8..1f5bed3c5908 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h
@@ -38,7 +38,6 @@
 #endif
 #endif
 
-#include <boost/array.hpp>
 #include <boost/tuple/tuple.hpp>
 
 #include <unordered_map>
diff --git a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path_traits.h b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path_traits.h
index 8a67d99a1d21..5e2955124f59 100644
--- a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path_traits.h
+++ b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path_traits.h
@@ -22,8 +22,6 @@
 #include <ostream>
 #include <cstddef>
 
-#include <boost/array.hpp>
-
 namespace CGAL {
 
 /*!
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
index 77caca7318f5..d2ababd2779e 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
@@ -18,7 +18,6 @@
 #include <boost/bimap.hpp>
 #include <boost/bimap/set_of.hpp>
 #include <boost/bimap/multiset_of.hpp>
-#include <boost/array.hpp>
 #include <boost/container/small_vector.hpp>
 #include <boost/functional/hash.hpp>
 
@@ -453,7 +452,7 @@ bool is_valid_collapse(const typename C3t3::Edge& edge,
       if (!ch->has_vertex(v1))
       {
         //check orientation
-        boost::array<Point, 4> pts = { ch->vertex(0)->point(),
+        std::array<Point, 4> pts = { ch->vertex(0)->point(),
                                        ch->vertex(1)->point(),
                                        ch->vertex(2)->point(),
                                        ch->vertex(3)->point()};
@@ -486,7 +485,7 @@ bool is_valid_collapse(const typename C3t3::Edge& edge,
       if (!ch->has_vertex(v0))
       {
         //check orientation
-        boost::array<Point, 4> pts = { ch->vertex(0)->point(),
+        std::array<Point, 4> pts = { ch->vertex(0)->point(),
                                        ch->vertex(1)->point(),
                                        ch->vertex(2)->point(),
                                        ch->vertex(3)->point() };

From b8571795b65e18dcc1fcec22515a92620651fac6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 19:41:05 +0200
Subject: [PATCH 0228/1398] remove extra namespace

---
 .../benchmark/Linear_cell_complex_2/surface_mesh/IO_off.cpp   | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/IO_off.cpp b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/IO_off.cpp
index d1be42f9fe41..40024a4b51fb 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/IO_off.cpp
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/IO_off.cpp
@@ -42,7 +42,7 @@ bool read_off_ascii(Surface_mesh& mesh,
     Vec2f                t;
     Surface_mesh::Vertex v;
     typename CGAL::GetVertexPointMap<Surface_mesh, NamedParameters>::const_type
-        vpm = choose_parameter(get_parameter(np, CGAL::boost::internal_np::vertex_point),
+        vpm = choose_parameter(get_parameter(np, CGAL::internal_np::vertex_point),
                            get_const_property_map(CGAL::vertex_point, mesh));
 
 
@@ -164,7 +164,7 @@ bool read_off_binary(Surface_mesh& mesh,
     if (has_normals)   normals   = mesh.vertex_property<Normal>("v:normal");
     if (has_texcoords) texcoords = mesh.vertex_property<Texture_coordinate>("v:texcoord");
     typename CGAL::GetVertexPointMap<Surface_mesh, NamedParameters>::const_type
-        vpm = choose_parameter(get_parameter(np, CGAL::boost::internal_np::vertex_point),
+        vpm = choose_parameter(get_parameter(np, CGAL::internal_np::vertex_point),
                            get_const_property_map(CGAL::vertex_point, mesh));
 
 

From 99619dc63417f422574ffc194edba03f07cf4461 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 19:49:16 +0200
Subject: [PATCH 0229/1398] boost::prior -> std::prev

---
 Alpha_shapes_3/include/CGAL/Fixed_alpha_shape_3.h      |  2 +-
 Convex_hull_3/include/CGAL/convex_hull_3.h             |  4 ++--
 Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h |  4 ++--
 Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h |  4 ++--
 .../internal/Triangle_3_Triangle_3_intersection.h      |  6 +++---
 .../include/CGAL/Mesh_3/Protect_edges_sizing_field.h   |  2 +-
 Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h      |  4 ++--
 .../CGAL/Mesh_domain_with_polyline_features_3.h        |  8 ++++----
 .../Periodic_3_mesh_3/Protect_edges_sizing_field.h     |  2 +-
 .../intersection_of_coplanar_triangles_3.h             |  4 ++--
 Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp    |  6 +++---
 .../Hybrid_squared_distance_cost.h                     |  2 +-
 .../Scaled_squared_distance_cost.h                     |  2 +-
 .../Polyline_simplification_2/Squared_distance_cost.h  |  2 +-
 .../include/CGAL/Polyline_simplification_2/simplify.h  |  8 ++++----
 STL_Extension/test/STL_Extension/test_skiplist.cpp     | 10 +++++-----
 .../include/CGAL/Constrained_triangulation_plus_2.h    |  4 ++--
 17 files changed, 37 insertions(+), 37 deletions(-)

diff --git a/Alpha_shapes_3/include/CGAL/Fixed_alpha_shape_3.h b/Alpha_shapes_3/include/CGAL/Fixed_alpha_shape_3.h
index f599e971bb0a..b901a497018c 100644
--- a/Alpha_shapes_3/include/CGAL/Fixed_alpha_shape_3.h
+++ b/Alpha_shapes_3/include/CGAL/Fixed_alpha_shape_3.h
@@ -255,7 +255,7 @@ class Fixed_alpha_shape_3 : public Dt
                               std::back_inserter(cells),
                               Emptyset_iterator()));
 
-    Facet facet=*boost::prior(facets_on_the_boundary_of_the_hole.end());
+    Facet facet=*std::prev(facets_on_the_boundary_of_the_hole.end());
 
     // Remember the points that are hidden by the conflicting cells,
     // as they will be deleted during the insertion.
diff --git a/Convex_hull_3/include/CGAL/convex_hull_3.h b/Convex_hull_3/include/CGAL/convex_hull_3.h
index 18a113293083..5915ca243134 100644
--- a/Convex_hull_3/include/CGAL/convex_hull_3.h
+++ b/Convex_hull_3/include/CGAL/convex_hull_3.h
@@ -613,7 +613,7 @@ partition_outside_sets(const std::list<Face_handle>& new_facets,
     }
     if(! point_list.empty()){
       pending_facets.push_back(f);
-      f->it = boost::prior(pending_facets.end());
+      f->it = std::prev(pending_facets.end());
     } else {
       f->it = pending_facets.end();
     }
@@ -748,7 +748,7 @@ void non_coplanar_quickhull_3(std::list<typename Traits::Point_3>& points,
   for(Face_iterator fit = tds.faces_begin(); fit != tds.faces_end(); ++fit){
     if (! fit->points.empty()){
       pending_facets.push_back(fit);
-      fit->it = boost::prior(pending_facets.end());
+      fit->it = std::prev(pending_facets.end());
         } else {
       fit->it =  pending_facets.end();
     }
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
index 5460f21e7cef..4490b2057f8a 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
@@ -101,12 +101,12 @@ class VectorH2
    Cartesian_const_iterator cartesian_begin() const
    {
      return make_cartesian_const_iterator_begin(CGAL::get_pointee_or_identity(base).begin(),
-                                                boost::prior(CGAL::get_pointee_or_identity(base).end()));
+                                                std::prev(CGAL::get_pointee_or_identity(base).end()));
    }
 
    Cartesian_const_iterator cartesian_end() const
    {
-     return make_cartesian_const_iterator_end(boost::prior(CGAL::get_pointee_or_identity(base).end()));
+     return make_cartesian_const_iterator_end(std::prev(CGAL::get_pointee_or_identity(base).end()));
    }
 
    int     dimension() const;
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
index 544ffa964933..7885e2dd9587 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
@@ -117,12 +117,12 @@ class VectorH3
   Cartesian_const_iterator cartesian_begin() const
   {
     return make_cartesian_const_iterator_begin(get_pointee_or_identity(base).begin(),
-                                               boost::prior(get_pointee_or_identity(base).end()));
+                                               std::prev(get_pointee_or_identity(base).end()));
   }
 
   Cartesian_const_iterator cartesian_end() const
   {
-    return make_cartesian_const_iterator_end(boost::prior(get_pointee_or_identity(base).end()));
+    return make_cartesian_const_iterator_end(std::prev(get_pointee_or_identity(base).end()));
   }
 
   int   dimension() const { return 3; };
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index 424e1fc93616..c4be2ae163de 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -53,8 +53,8 @@ void intersection_coplanar_triangles_cutoff(const typename Kernel::Point_3& p,
 
   CGAL_kernel_assertion_code(int pt_added = 0;)
 
-  const typename Kernel::Point_3* prev = &(*boost::prior(inter_pts.end()));
-  Iterator stop = inter_pts.size() > 2 ? inter_pts.end() : boost::prior(inter_pts.end());
+  const typename Kernel::Point_3* prev = &(*std::prev(inter_pts.end()));
+  Iterator stop = inter_pts.size() > 2 ? inter_pts.end() : std::prev(inter_pts.end());
   for(Iterator it=inter_pts.begin(); it!=stop; ++it)
   {
     const typename Kernel::Point_3& curr = *it;
@@ -123,7 +123,7 @@ intersection_coplanar_triangles(const typename K::Triangle_3& t1,
             k.construct_segment_3_object()(*inter_pts.begin(), *boost::next(inter_pts.begin())) );
     case 3:
       return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>(
-            k.construct_triangle_3_object()(*inter_pts.begin(), *boost::next(inter_pts.begin()), *boost::prior(inter_pts.end())) );
+            k.construct_triangle_3_object()(*inter_pts.begin(), *boost::next(inter_pts.begin()), *std::prev(inter_pts.end())) );
     default:
       return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>(
             std::vector<typename K::Point_3>(inter_pts.begin(),inter_pts.end()));
diff --git a/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h b/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
index 2fe2261344c9..8dfdf054d158 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
@@ -2098,7 +2098,7 @@ repopulate_edges_around_corner(const Vertex_handle& v, ErasedVeOutIt out)
     // `check_and_repopulate_edges()::vertices` before it is passed itself
     // to `repopulate_edges_around_corner()`.
     if(c3t3_.is_in_complex(to_repopulate.back()))
-      std::copy(to_repopulate.begin(), boost::prior(to_repopulate.end()), out);
+      std::copy(to_repopulate.begin(), std::prev(to_repopulate.end()), out);
     else
       std::copy(to_repopulate.begin(), to_repopulate.end(), out);
 
diff --git a/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h b/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
index e42bc0acff77..7ee16b41b79b 100644
--- a/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
+++ b/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
@@ -29,7 +29,7 @@
 #include <CGAL/Mesh_3/internal/Graph_manipulations.h>
 #include <boost/graph/adjacency_list.hpp>
 
-#include <boost/utility.hpp> // for boost::prior
+#include <boost/utility.hpp> // for std::prev
 #include <boost/optional.hpp>
 
 #include <CGAL/Search_traits_3.h>
@@ -388,7 +388,7 @@ void snap_graph_vertices(Graph& graph,
     if(poly_it->begin() != poly_it->end()) {
       tree.insert(*poly_it->begin());
       if(boost::next(poly_it->begin()) != poly_it->end()) {
-        tree.insert(*boost::prior(poly_it->end()));
+        tree.insert(*std::prev(poly_it->end()));
       }
     }
   }
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 47b9bf495ade..363d0d0c61b7 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -37,7 +37,7 @@
 #include <algorithm>
 #include <type_traits>
 
-#include <boost/next_prior.hpp> // for boost::prior and boost::next
+#include <boost/next_prior.hpp> // for std::prev and boost::next
 #include <boost/variant.hpp>
 #include <memory>
 
@@ -883,7 +883,7 @@ class Mesh_domain_with_polyline_features_3
   }
   Curve_index maximal_curve_index() const {
     if(edges_incidences_.empty()) return Curve_index();
-    return boost::prior(edges_incidences_.end())->first;
+    return std::prev(edges_incidences_.end())->first;
   }
 
   void build_curves_aabb_tree() const {
@@ -1458,9 +1458,9 @@ insert_edge(InputIterator first, InputIterator end)
   // 'compute_corners_incidences()', that corner is incident only to a
   // loop, then it will be removed from the set of corners.
   register_corner(*first, curve_index);
-  if ( *first != *boost::prior(end) )
+  if ( *first != *std::prev(end) )
   {
-    register_corner(*boost::prior(end), curve_index);
+    register_corner(*std::prev(end), curve_index);
   }
 
   // Create a new polyline
diff --git a/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h b/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
index a8936abb6ffd..de6dccfcbe66 100644
--- a/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
+++ b/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
@@ -3126,7 +3126,7 @@ repopulate_edges_around_corner(const Vertex_handle& v, ErasedVeOutIt out)
     // `check_and_repopulate_edges()::vertices` before it is passed itself
     // to `repopulate_edges_around_corner()`.
     if(c3t3_.is_in_complex(to_repopulate.back()))
-      std::copy(to_repopulate.begin(), boost::prior(to_repopulate.end()), out);
+      std::copy(to_repopulate.begin(), std::prev(to_repopulate.end()), out);
     else
       std::copy(to_repopulate.begin(), to_repopulate.end(), out);
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
index 0e73d4be013c..50972f741935 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
@@ -243,9 +243,9 @@ struct Intersect_coplanar_faces_3
 
     CGAL_assertion_code(int pt_added=0;)
 
-    Inter_pt_info* prev = &(*boost::prior(inter_pts.end()));
+    Inter_pt_info* prev = &(*std::prev(inter_pts.end()));
     bool inter_pts_size_g_2 = inter_pts.size() > 2;
-    Iterator stop = inter_pts_size_g_2 ? inter_pts.end() : boost::prior(inter_pts.end());
+    Iterator stop = inter_pts_size_g_2 ? inter_pts.end() : std::prev(inter_pts.end());
     for (Iterator it=inter_pts.begin();it!=stop;++it)
     {
       Inter_pt_info* curr=&(*it);
diff --git a/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
index 329d4b3f7198..27e3d41ccc42 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
@@ -622,9 +622,9 @@ void Scene_polylines_item::split_at_sharp_angles()
         else
             ++bare_polyline_it;
         if(it != bare_polyline.end()) {
-            for(; it != boost::prior(bare_polyline.end()); ++it) {
+            for(; it != std::prev(bare_polyline.end()); ++it) {
                 const Point_3 pv = *it;
-                const Point_3 pa = *boost::prior(it);
+                const Point_3 pa = *std::prev(it);
                 const Point_3 pb = *boost::next(it);
                 const K::Vector_3 av = pv - pa;
                 const K::Vector_3 bv = pv - pb;
@@ -647,7 +647,7 @@ void Scene_polylines_item::split_at_sharp_angles()
                         // if the polyline is a cycle, test if its beginning is a sharp
                         // angle...
                         const Point_3 pv = *bare_polyline.begin();
-                        const Point_3 pa = *boost::prior(boost::prior(bare_polyline.end()));
+                        const Point_3 pa = *std::prev(std::prev(bare_polyline.end()));
                         const Point_3 pb = *boost::next(bare_polyline.begin());
                         const K::Vector_3 av = pv - pa;
                         const K::Vector_3 bv = pv - pb;
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
index d7f169997b78..850ff94fbd0a 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
@@ -65,7 +65,7 @@ class Hybrid_squared_distance_cost
     Construct_segment        construct_segment        = pct.geom_traits().construct_segment_2_object() ;
     typedef typename Constrained_triangulation_plus_2<CDT>::Vertices_in_constraint_iterator Vertices_in_constraint_iterator;
 
-    Vertices_in_constraint_iterator vicp = boost::prior(vicq);
+    Vertices_in_constraint_iterator vicp = std::prev(vicq);
     Vertices_in_constraint_iterator vicr = boost::next(vicq);
 
     Point const& lP = (*vicp)->point();
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
index 53ecf34cc6fc..30a7b2cf00c7 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
@@ -61,7 +61,7 @@ class Scaled_squared_distance_cost
     Construct_segment        construct_segment        = pct.geom_traits().construct_segment_2_object() ;
     typedef typename Constrained_triangulation_plus_2<CDT>::Vertices_in_constraint_iterator Vertices_in_constraint_iterator;
 
-    Vertices_in_constraint_iterator vicp = boost::prior(vicq);
+    Vertices_in_constraint_iterator vicp = std::prev(vicq);
     Vertices_in_constraint_iterator vicr = boost::next(vicq);
 
     Point const& lP = (*vicp)->point();
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
index 08ca152ddd0c..92aa449bfdea 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
@@ -66,7 +66,7 @@ class Squared_distance_cost
     Construct_segment        construct_segment        = pct.geom_traits().construct_segment_2_object() ;
     typedef typename Constrained_triangulation_plus_2<CDT>::Vertices_in_constraint_iterator Vertices_in_constraint_iterator;
 
-    Vertices_in_constraint_iterator vicp = boost::prior(vicq);
+    Vertices_in_constraint_iterator vicp = std::prev(vicq);
     Vertices_in_constraint_iterator vicr = boost::next(vicq);
 
     Point const& lP = (*vicp)->point();
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
index d5497788a02a..e77c07e351e7 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
@@ -154,11 +154,11 @@ class Polyline_simplification_2
       (*it)->set_removable(false);
       ++it;
       for(; it != ite; ++it){
-        if((boost::next(it) != ite) && (boost::prior(it)== boost::next(it))){
+        if((boost::next(it) != ite) && (std::prev(it)== boost::next(it))){
           (*it)->set_removable(false);
         }
       }
-      it = boost::prior(it);
+      it = std::prev(it);
       (*it)->set_removable(false);
     }
 
@@ -245,7 +245,7 @@ class Polyline_simplification_2
     }
 
     Vertex_handle vh = *it;
-    Vertices_in_constraint_iterator u = boost::prior(it);
+    Vertices_in_constraint_iterator u = std::prev(it);
     Vertex_handle uh = *u;
     Vertices_in_constraint_iterator w = boost::next(it);
     Vertex_handle wh = *w;
@@ -322,7 +322,7 @@ operator()()
 
   Vertices_in_constraint_iterator vit = vertex_to_iterator[v].front();
   if(is_removable(vit)){
-    Vertices_in_constraint_iterator u = boost::prior(vit), w = boost::next(vit);
+    Vertices_in_constraint_iterator u = std::prev(vit), w = boost::next(vit);
     pct.simplify(vit);
 
     if((*u)->is_removable()){
diff --git a/STL_Extension/test/STL_Extension/test_skiplist.cpp b/STL_Extension/test/STL_Extension/test_skiplist.cpp
index f0f61b5f803f..6405dff5d2f0 100644
--- a/STL_Extension/test/STL_Extension/test_skiplist.cpp
+++ b/STL_Extension/test/STL_Extension/test_skiplist.cpp
@@ -86,8 +86,8 @@ BOOST_FIXTURE_TEST_CASE( test_single_skip, Fixture )
                                 skips.begin(), skips.end());
   BOOST_CHECK_EQUAL_COLLECTIONS(l.all_begin(), l.all_end(),
                                 all.begin(), all.end());
-  l.skip(boost::prior(l.all_end()));
-  BOOST_CHECK(l.is_skipped(boost::prior(l.all_end())));
+  l.skip(std::prev(l.all_end()));
+  BOOST_CHECK(l.is_skipped(std::prev(l.all_end())));
   skips.erase(std::remove(skips.begin(), skips.end(), 7), skips.end());
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
                                 skips.begin(), skips.end());
@@ -112,7 +112,7 @@ BOOST_FIXTURE_TEST_CASE( test_range_skip, Fixture )
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
                                 skips.begin(), skips.end());
   // drop 6 and 7
-  l.skip(boost::prior(l.all_end(), 2), l.all_end());
+  l.skip(std::prev(l.all_end(), 2), l.all_end());
   skips.erase(std::remove(skips.begin(), skips.end(), 6), skips.end());
   skips.erase(std::remove(skips.begin(), skips.end(), 7), skips.end());
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
@@ -229,7 +229,7 @@ BOOST_AUTO_TEST_CASE( test_swap )
 {
   using std::swap;
   Fixture a, b;
-  all_iterator it = boost::prior(b.l.all_end());
+  all_iterator it = std::prev(b.l.all_end());
   b.l.push_back(8); b.l.push_back(9); b.l.push_back(10);
   swap(a.l, b.l);
 
@@ -244,7 +244,7 @@ BOOST_AUTO_TEST_CASE( test_swap )
                                 a.all.begin(), a.all.end());
   // this iterator should still be valid and now point into a
   BOOST_CHECK_EQUAL_COLLECTIONS(it, a.l.all_end(),
-                                boost::prior(a.all.end(), 4), a.all.end());
+                                std::prev(a.all.end(), 4), a.all.end());
 }
 
 BOOST_AUTO_TEST_CASE( test_splice )
diff --git a/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h b/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h
index 63e07c51dcfe..f37ee350689a 100644
--- a/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h
@@ -582,7 +582,7 @@ Default::Get< Tr_, Constrained_Delaunay_triangulation_2<
       insert_incident_faces(vcit, out);
     }
     //AF    vertices_in_constraint_begin(ca)->fixed() = true;
-    // Vertices_in_constraint_iterator end = boost::prior(vertices_in_constraint_end(ca));
+    // Vertices_in_constraint_iterator end = std::prev(vertices_in_constraint_end(ca));
     // end->fixed() = true;
     fc.write_faces(out);
 
@@ -753,7 +753,7 @@ Default::Get< Tr_, Constrained_Delaunay_triangulation_2<
 
   void simplify(Vertices_in_constraint_iterator v)
   {
-    Vertices_in_constraint_iterator u = boost::prior(v);
+    Vertices_in_constraint_iterator u = std::prev(v);
     Vertices_in_constraint_iterator w = boost::next(v);
     bool unew = (*u != *w);
     hierarchy.simplify(u,v,w);

From e82d970d19e56be8e4b8b7ec84dfd81605bfeb25 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 19:50:23 +0200
Subject: [PATCH 0230/1398] boost::next -> std::next

---
 BGL/test/BGL/test_Face_filtered_graph.cpp     |  2 +-
 BGL/test/BGL/test_graph_traits.cpp            |  2 +-
 CGAL_ipelets/demo/CGAL_ipelets/pca.cpp        |  4 +-
 .../include/CGAL/CGAL_Ipelet_base_v6.h        |  4 +-
 .../include/CGAL/CGAL_Ipelet_base_v7.h        |  4 +-
 .../Triangle_3_Triangle_3_intersection.h      |  4 +-
 .../CGAL/Mesh_3/polylines_to_protect.h        | 10 ++---
 .../Mesh_domain_with_polyline_features_3.h    |  2 +-
 .../CGAL/Polyhedral_complex_mesh_domain_3.h   |  2 +-
 .../intersection_of_coplanar_triangles_3.h    |  4 +-
 .../Plugins/IO/Polylines_io_plugin.cpp        |  4 +-
 .../demo/Polyhedron/Scene_polylines_item.cpp  | 16 ++++----
 .../Polyhedron/Scene_surface_mesh_item.cpp    |  6 +--
 .../demo/Polyhedron/include/id_printing.h     |  2 +-
 .../Hybrid_squared_distance_cost.h            |  2 +-
 .../Scaled_squared_distance_cost.h            |  2 +-
 .../Squared_distance_cost.h                   |  2 +-
 .../CGAL/Polyline_simplification_2/simplify.h |  6 +--
 .../test/STL_Extension/test_skiplist.cpp      | 38 +++++++++----------
 .../internal/bounded_priority_queue.h         |  2 +-
 .../internal/graph_traits_2D_TDS_helper.h     |  2 +-
 .../CGAL/Constrained_triangulation_plus_2.h   |  2 +-
 .../Polyline_constraint_hierarchy_2.h         |  4 +-
 23 files changed, 63 insertions(+), 63 deletions(-)

diff --git a/BGL/test/BGL/test_Face_filtered_graph.cpp b/BGL/test/BGL/test_Face_filtered_graph.cpp
index 2bab2e1d83c4..5dd6521bb02f 100644
--- a/BGL/test/BGL/test_Face_filtered_graph.cpp
+++ b/BGL/test/BGL/test_Face_filtered_graph.cpp
@@ -37,7 +37,7 @@ void test_halfedge_around_vertex_iterator(const  Graph& g)
       assert(target(*havit, fg) == *vit);
 
       // check if we are really moving clockwise
-      halfedge_around_target_iterator step = boost::next(havit);
+      halfedge_around_target_iterator step = std::next(havit);
       if(step != havend) {
         halfedge_descriptor stepd = *step;
         assert(stepd == opposite(next(*havit, fg), fg));
diff --git a/BGL/test/BGL/test_graph_traits.cpp b/BGL/test/BGL/test_graph_traits.cpp
index 3d71af5a7c23..08e80ef75c76 100644
--- a/BGL/test/BGL/test_graph_traits.cpp
+++ b/BGL/test/BGL/test_graph_traits.cpp
@@ -34,7 +34,7 @@ void test_halfedge_around_vertex_iterator(const Graph& g)
       assert(target(*havit, g) == *vit);
 
       // check if we are really moving clockwise
-      halfedge_around_target_iterator step = boost::next(havit);
+      halfedge_around_target_iterator step = std::next(havit);
       if(step != havend) {
         halfedge_descriptor stepd = *step;
         assert(stepd == opposite(next(*havit, g), g));
diff --git a/CGAL_ipelets/demo/CGAL_ipelets/pca.cpp b/CGAL_ipelets/demo/CGAL_ipelets/pca.cpp
index 5e476893af07..50d96042ba69 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/pca.cpp
+++ b/CGAL_ipelets/demo/CGAL_ipelets/pca.cpp
@@ -67,8 +67,8 @@ void pcaIpelet::protected_run(int fn)
   for (std::list<Polygon_2>::iterator it=poly_list.begin();it!=poly_list.end();++it)
     if (it->size()==3){
       tri_list.push_back(Kernel::Triangle_2(*(it->vertices_begin()),
-                                            *boost::next(it->vertices_begin()),
-                                            *boost::next(it->vertices_begin(),2)
+                                            *std::next(it->vertices_begin()),
+                                            *std::next(it->vertices_begin(),2)
                                             ));
     }
     else{
diff --git a/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v6.h b/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v6.h
index 1d55bf3269e5..48572f24118b 100644
--- a/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v6.h
+++ b/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v6.h
@@ -317,10 +317,10 @@ namespace CGAL{
     IpeSegmentSubPath*
     create_polyline(const iterator first, const iterator last,bool setclose=false) const
     {
-      if (boost::next(first)!=last){
+      if (std::next(first)!=last){
         IpeSegmentSubPath* SSP_ipe = new IpeSegmentSubPath();
         IpeVector Prev_pt=IpeVector(CGAL::to_double(first->x()),CGAL::to_double(first->y())) ;
-        for (iterator it = boost::next(first);it!=last;++it){
+        for (iterator it = std::next(first);it!=last;++it){
           IpeVector Cur_pt=IpeVector(CGAL::to_double(it->x()),CGAL::to_double(it->y()));
           SSP_ipe -> AppendSegment(Prev_pt,Cur_pt);
           Prev_pt=Cur_pt;
diff --git a/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h b/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h
index cae6c0794f87..276e5d5c651a 100644
--- a/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h
+++ b/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h
@@ -329,10 +329,10 @@ namespace CGAL{
     ipe::Curve*
     create_polyline(const iterator first, const iterator last,bool setclose=false) const
     {
-      if (boost::next(first)!=last){
+      if (std::next(first)!=last){
         ipe::Curve* SSP_ipe = new ipe::Curve();
         ipe::Vector Prev_pt=ipe::Vector(CGAL::to_double(first->x()),CGAL::to_double(first->y())) ;
-        for (iterator it = boost::next(first);it!=last;++it){
+        for (iterator it = std::next(first);it!=last;++it){
           ipe::Vector Cur_pt=ipe::Vector(CGAL::to_double(it->x()),CGAL::to_double(it->y()));
           SSP_ipe -> appendSegment(Prev_pt,Cur_pt);
           Prev_pt=Cur_pt;
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index c4be2ae163de..2f036bc98a07 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -120,10 +120,10 @@ intersection_coplanar_triangles(const typename K::Triangle_3& t1,
       return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>(*inter_pts.begin());
     case 2:
       return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>(
-            k.construct_segment_3_object()(*inter_pts.begin(), *boost::next(inter_pts.begin())) );
+            k.construct_segment_3_object()(*inter_pts.begin(), *std::next(inter_pts.begin())) );
     case 3:
       return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>(
-            k.construct_triangle_3_object()(*inter_pts.begin(), *boost::next(inter_pts.begin()), *std::prev(inter_pts.end())) );
+            k.construct_triangle_3_object()(*inter_pts.begin(), *std::next(inter_pts.begin()), *std::prev(inter_pts.end())) );
     default:
       return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>(
             std::vector<typename K::Point_3>(inter_pts.begin(),inter_pts.end()));
diff --git a/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h b/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
index 7ee16b41b79b..756bf520604d 100644
--- a/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
+++ b/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
@@ -387,7 +387,7 @@ void snap_graph_vertices(Graph& graph,
   {
     if(poly_it->begin() != poly_it->end()) {
       tree.insert(*poly_it->begin());
-      if(boost::next(poly_it->begin()) != poly_it->end()) {
+      if(std::next(poly_it->begin()) != poly_it->end()) {
         tree.insert(*std::prev(poly_it->end()));
       }
     }
@@ -1048,10 +1048,10 @@ polylines_to_protect(std::vector<std::vector<P> >& polylines,
       continue;
 
     typename Polyline::const_iterator pit = polyline.begin();
-    while (boost::next(pit) != polyline.end())
+    while (std::next(pit) != polyline.end())
     {
       vertex_descriptor v = g_manip.get_vertex(*pit, false);
-      vertex_descriptor w = g_manip.get_vertex(*boost::next(pit), false);
+      vertex_descriptor w = g_manip.get_vertex(*std::next(pit), false);
       g_manip.try_add_edge(v, w);
       ++pit;
     }
@@ -1165,10 +1165,10 @@ merge_and_snap_polylines(const CGAL::Image_3& image,
       continue;
 
     auto pit = polyline.begin();
-    while (boost::next(pit) != polyline.end())
+    while (std::next(pit) != polyline.end())
     {
       vertex_descriptor v = g_manip.get_vertex(*pit, false);
-      vertex_descriptor w = g_manip.get_vertex(*boost::next(pit), false);
+      vertex_descriptor w = g_manip.get_vertex(*std::next(pit), false);
       g_manip.try_add_edge(v, w);
       ++pit;
     }
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 363d0d0c61b7..400699d0e667 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -37,7 +37,7 @@
 #include <algorithm>
 #include <type_traits>
 
-#include <boost/next_prior.hpp> // for std::prev and boost::next
+#include <boost/next_prior.hpp> // for std::prev and std::next
 #include <boost/variant.hpp>
 #include <memory>
 
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 72ba8cdaa0cf..ce6de8775be8 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -884,7 +884,7 @@ merge_duplicated_points(const PointSet& duplicated_points)
     typename Union_find_t::handle first_handle =
       handles[range_begin->second];
     // In a second loop on the equal-range, update new_ids around p
-    for (it = boost::next(range_begin); it != range_end; ++it)
+    for (it = std::next(range_begin); it != range_end; ++it)
     {
 #if CGAL_MESH_3_VERBOSE > 10
       std::cerr << " - #" << it->second << "\n";
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
index 50972f741935..45369d47bf53 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
@@ -253,7 +253,7 @@ struct Intersect_coplanar_faces_3
       Orientation or_prev=orientations[prev],or_curr=orientations[curr];
       if ( (or_prev==POSITIVE && or_curr==NEGATIVE) || (or_prev==NEGATIVE && or_curr==POSITIVE) )
       {
-        Iterator it_curr = inter_pts_size_g_2 ? it:boost::next(it);
+        Iterator it_curr = inter_pts_size_g_2 ? it:std::next(it);
         prev=&(* inter_pts.insert( it_curr,operator()(*prev,*curr,h1,h2) ) );
         orientations[prev]=COLLINEAR;
         CGAL_assertion_code(++pt_added;)
@@ -278,7 +278,7 @@ struct Intersect_coplanar_faces_3
     {
       if (orientations[&(*it)]==NEGATIVE){
         inter_pts.erase(it++);
-        if (--nb_interpt == 2 && it!=inter_pts.end() && boost::next(it)==inter_pts.end()) should_revert_list=true;
+        if (--nb_interpt == 2 && it!=inter_pts.end() && std::next(it)==inter_pts.end()) should_revert_list=true;
       }
       else
         ++it;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
index fa09b6036548..fd052aaf8253 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
@@ -309,10 +309,10 @@ polylines_to_split(std::vector<std::vector<P> >& polylines,
       continue;
 
     typename Polyline::iterator pit = polyline.begin();
-    while (boost::next(pit) != polyline.end())
+    while (std::next(pit) != polyline.end())
     {
       vertex_descriptor v = g_manip.get_vertex(*pit, false);
-      vertex_descriptor w = g_manip.get_vertex(*boost::next(pit), false);
+      vertex_descriptor w = g_manip.get_vertex(*std::next(pit), false);
       g_manip.try_add_edge(v, w);
       ++pit;
     }
diff --git a/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
index 27e3d41ccc42..da241453b286 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
@@ -611,9 +611,9 @@ void Scene_polylines_item::split_at_sharp_angles()
         Bare_polyline_container::iterator current_polyline_it =
                 bare_polyline_it;
         Bare_polyline& bare_polyline = *bare_polyline_it;
-        Bare_polyline::iterator it = boost::next(bare_polyline.begin());
+        Bare_polyline::iterator it = std::next(bare_polyline.begin());
 
-        if(boost::next(bare_polyline.begin()) == bare_polyline.end())
+        if(std::next(bare_polyline.begin()) == bare_polyline.end())
         {
             std::cerr << "WARNING: Isolated point in polylines\n";
             bare_polyline_it = bare_polylines.erase(bare_polyline_it);
@@ -625,7 +625,7 @@ void Scene_polylines_item::split_at_sharp_angles()
             for(; it != std::prev(bare_polyline.end()); ++it) {
                 const Point_3 pv = *it;
                 const Point_3 pa = *std::prev(it);
-                const Point_3 pb = *boost::next(it);
+                const Point_3 pb = *std::next(it);
                 const K::Vector_3 av = pv - pa;
                 const K::Vector_3 bv = pv - pb;
                 const K::FT sc_prod = av * bv;
@@ -648,7 +648,7 @@ void Scene_polylines_item::split_at_sharp_angles()
                         // angle...
                         const Point_3 pv = *bare_polyline.begin();
                         const Point_3 pa = *std::prev(std::prev(bare_polyline.end()));
-                        const Point_3 pb = *boost::next(bare_polyline.begin());
+                        const Point_3 pb = *std::next(bare_polyline.begin());
                         const K::Vector_3 av = pv - pa;
                         const K::Vector_3 bv = pv - pb;
                         const K::FT sc_prod = av * bv;
@@ -657,18 +657,18 @@ void Scene_polylines_item::split_at_sharp_angles()
                                  CGAL::square(sc_prod) < (av * av) * (bv * bv) / 4 ) )
                         {
                             // if its beginning is a sharp angle, then split
-                            bare_polyline.erase(boost::next(it), bare_polyline.end());
+                            bare_polyline.erase(std::next(it), bare_polyline.end());
                         }
                         else {
                             // ...if not, modifies its beginning
-                            std::copy(boost::next(bare_polyline.begin()),
-                                      boost::next(it),
+                            std::copy(std::next(bare_polyline.begin()),
+                                      std::next(it),
                                       std::back_inserter(new_polyline));
                             bare_polylines.erase(current_polyline_it);
                         }
                     }
                     else {
-                        bare_polyline.erase(boost::next(it), bare_polyline.end());
+                        bare_polyline.erase(std::next(it), bare_polyline.end());
                     }
                     bare_polylines.push_back(new_polyline);
                     break;
diff --git a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
index 75db7480aaa0..47efcc20ce9c 100644
--- a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
@@ -1216,7 +1216,7 @@ Scene_surface_mesh_item::select(double orig_x,
       const EPICK::Point_3* closest_point =
           boost::get<EPICK::Point_3>(&(closest->first));
       for(Intersections::iterator
-          it = boost::next(intersections.begin()),
+          it = std::next(intersections.begin()),
           end = intersections.end();
           it != end; ++it)
       {
@@ -1431,7 +1431,7 @@ bool Scene_surface_mesh_item::intersect_face(double orig_x,
       const EPICK::Point_3* closest_point =
           CGAL::object_cast<EPICK::Point_3>(&closest->first);
       for(Intersections::iterator
-          it = boost::next(intersections.begin()),
+          it = std::next(intersections.begin()),
           end = intersections.end();
           it != end; ++it)
       {
@@ -1925,7 +1925,7 @@ void Scene_surface_mesh_item::zoomToPosition(const QPoint &point, CGAL::Three::V
       const EPICK::Point_3* closest_point =
           boost::get<EPICK::Point_3>(&closest->first);
       for(Intersections::iterator
-          it = boost::next(intersections.begin()),
+          it = std::next(intersections.begin()),
           end = intersections.end();
           it != end; ++it)
       {
diff --git a/Polyhedron/demo/Polyhedron/include/id_printing.h b/Polyhedron/demo/Polyhedron/include/id_printing.h
index 46d142a24bb0..5676f1129df3 100644
--- a/Polyhedron/demo/Polyhedron/include/id_printing.h
+++ b/Polyhedron/demo/Polyhedron/include/id_printing.h
@@ -155,7 +155,7 @@ bool find_primitive_id(const QPoint& point,
   const Point* closest_point =
       boost::get<Point>(&closest->first);
   for(typename Intersections::iterator
-      it = boost::next(intersections.begin()),
+      it = std::next(intersections.begin()),
       end = intersections.end();
       it != end; ++it)
   {
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
index 850ff94fbd0a..fd1e9ccc0de8 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
@@ -66,7 +66,7 @@ class Hybrid_squared_distance_cost
     typedef typename Constrained_triangulation_plus_2<CDT>::Vertices_in_constraint_iterator Vertices_in_constraint_iterator;
 
     Vertices_in_constraint_iterator vicp = std::prev(vicq);
-    Vertices_in_constraint_iterator vicr = boost::next(vicq);
+    Vertices_in_constraint_iterator vicr = std::next(vicq);
 
     Point const& lP = (*vicp)->point();
     Point const& lR = (*vicr)->point();
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
index 30a7b2cf00c7..8a6977364610 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
@@ -62,7 +62,7 @@ class Scaled_squared_distance_cost
     typedef typename Constrained_triangulation_plus_2<CDT>::Vertices_in_constraint_iterator Vertices_in_constraint_iterator;
 
     Vertices_in_constraint_iterator vicp = std::prev(vicq);
-    Vertices_in_constraint_iterator vicr = boost::next(vicq);
+    Vertices_in_constraint_iterator vicr = std::next(vicq);
 
     Point const& lP = (*vicp)->point();
     Point const& lR = (*vicr)->point();
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
index 92aa449bfdea..4110a7718213 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
@@ -67,7 +67,7 @@ class Squared_distance_cost
     typedef typename Constrained_triangulation_plus_2<CDT>::Vertices_in_constraint_iterator Vertices_in_constraint_iterator;
 
     Vertices_in_constraint_iterator vicp = std::prev(vicq);
-    Vertices_in_constraint_iterator vicr = boost::next(vicq);
+    Vertices_in_constraint_iterator vicr = std::next(vicq);
 
     Point const& lP = (*vicp)->point();
     Point const& lR = (*vicr)->point();
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
index e77c07e351e7..85404f86c2d1 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
@@ -154,7 +154,7 @@ class Polyline_simplification_2
       (*it)->set_removable(false);
       ++it;
       for(; it != ite; ++it){
-        if((boost::next(it) != ite) && (std::prev(it)== boost::next(it))){
+        if((std::next(it) != ite) && (std::prev(it)== std::next(it))){
           (*it)->set_removable(false);
         }
       }
@@ -247,7 +247,7 @@ class Polyline_simplification_2
     Vertex_handle vh = *it;
     Vertices_in_constraint_iterator u = std::prev(it);
     Vertex_handle uh = *u;
-    Vertices_in_constraint_iterator w = boost::next(it);
+    Vertices_in_constraint_iterator w = std::next(it);
     Vertex_handle wh = *w;
 
     typename Geom_traits::Orientation_2 orientation_2 = pct.geom_traits().orientation_2_object();
@@ -322,7 +322,7 @@ operator()()
 
   Vertices_in_constraint_iterator vit = vertex_to_iterator[v].front();
   if(is_removable(vit)){
-    Vertices_in_constraint_iterator u = std::prev(vit), w = boost::next(vit);
+    Vertices_in_constraint_iterator u = std::prev(vit), w = std::next(vit);
     pct.simplify(vit);
 
     if((*u)->is_removable()){
diff --git a/STL_Extension/test/STL_Extension/test_skiplist.cpp b/STL_Extension/test/STL_Extension/test_skiplist.cpp
index 6405dff5d2f0..0e0cf9a9c204 100644
--- a/STL_Extension/test/STL_Extension/test_skiplist.cpp
+++ b/STL_Extension/test/STL_Extension/test_skiplist.cpp
@@ -60,10 +60,10 @@ BOOST_FIXTURE_TEST_CASE( test_insert, Fixture )
                                 skips.begin(), skips.end());
 
   // the same goes for inserting at an arbitrary position
-  skip::all_iterator pos = boost::next(l.all_begin(), 3);
-  l.insert(boost::next(l.all_begin(), 3)
+  skip::all_iterator pos = std::next(l.all_begin(), 3);
+  l.insert(std::next(l.all_begin(), 3)
            , 20);
-  all.insert(boost::next(all.begin(), 3)
+  all.insert(std::next(all.begin(), 3)
              , 20);
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
                                 skips.begin(), skips.end());
@@ -79,8 +79,8 @@ BOOST_FIXTURE_TEST_CASE( test_single_skip, Fixture )
 
   // skip somewhere in between and at the end
   // skip 2 and 7
-  l.skip(boost::next(l.all_begin()));
-  BOOST_CHECK(l.is_skipped(boost::next(l.all_begin())));
+  l.skip(std::next(l.all_begin()));
+  BOOST_CHECK(l.is_skipped(std::next(l.all_begin())));
   skips.erase(std::remove(skips.begin(), skips.end(), 2), skips.end());
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
                                 skips.begin(), skips.end());
@@ -106,7 +106,7 @@ BOOST_FIXTURE_TEST_CASE( test_single_skip, Fixture )
 BOOST_FIXTURE_TEST_CASE( test_range_skip, Fixture )
 {
   // drop all from 2 up to 4
-  l.skip(boost::next(l.all_begin()), boost::next(l.all_begin(), 3));
+  l.skip(std::next(l.all_begin()), std::next(l.all_begin(), 3));
   skips.erase(std::remove(skips.begin(), skips.end(), 2), skips.end());
   skips.erase(std::remove(skips.begin(), skips.end(), 3), skips.end());
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
@@ -137,20 +137,20 @@ BOOST_AUTO_TEST_CASE( test_continous_insert )
 BOOST_FIXTURE_TEST_CASE( test_unskip, Fixture )
 {
   // skip 2 and 3
-  l.skip(boost::next(l.all_begin()), boost::next(l.all_begin(), 3));
+  l.skip(std::next(l.all_begin()), std::next(l.all_begin(), 3));
   skips.erase(std::remove(skips.begin(), skips.end(), 2), skips.end());
   skips.erase(std::remove(skips.begin(), skips.end(), 3), skips.end());
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
                                 skips.begin(), skips.end());
 
   // unskip 2
-  l.unskip(boost::next(l.skip_begin()), boost::next(l.all_begin()));
-  skips.insert(boost::next(skips.begin()), 2);
+  l.unskip(std::next(l.skip_begin()), std::next(l.all_begin()));
+  skips.insert(std::next(skips.begin()), 2);
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
                                 skips.begin(), skips.end());
   // unskip 3
-  l.unskip(boost::next(l.skip_begin(), 2), boost::next(l.all_begin(), 2));
-  skips.insert(boost::next(skips.begin(), 2), 3);
+  l.unskip(std::next(l.skip_begin(), 2), std::next(l.all_begin(), 2));
+  skips.insert(std::next(skips.begin(), 2), 3);
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
                                 skips.begin(), skips.end());
 
@@ -181,8 +181,8 @@ BOOST_FIXTURE_TEST_CASE( test_push, Fixture )
                                 all.begin(), all.end());
 
   // check how it works with skipped elements
-  l.skip(l.all_begin(), boost::next(l.all_begin(), 4));
-  skips.erase(skips.begin(), boost::next(skips.begin(), 4));
+  l.skip(l.all_begin(), std::next(l.all_begin(), 4));
+  skips.erase(skips.begin(), std::next(skips.begin(), 4));
   l.push_front(20);
   l.push_front(21);
   skips.insert(skips.begin(), 20);
@@ -206,7 +206,7 @@ BOOST_FIXTURE_TEST_CASE( test_implicit_conversion, Fixture )
 BOOST_FIXTURE_TEST_CASE( test_erase, Fixture )
 {
   // erase 3
-  l.erase(boost::next(l.all_begin(), 2));
+  l.erase(std::next(l.all_begin(), 2));
   skips.erase(std::remove(skips.begin(), skips.end(), 3), skips.end());
   all.erase(std::remove(all.begin(), all.end(), 3), all.end());
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
@@ -215,10 +215,10 @@ BOOST_FIXTURE_TEST_CASE( test_erase, Fixture )
                                 all.begin(), all.end());
 
   // skip 2 first and then erase it
-  l.skip(boost::next(l.all_begin()));
+  l.skip(std::next(l.all_begin()));
   skips.erase(std::remove(skips.begin(), skips.end(), 2), skips.end());
   all.erase(std::remove(all.begin(), all.end(), 2), all.end());
-  l.erase(boost::next(l.all_begin()));
+  l.erase(std::next(l.all_begin()));
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
                                 skips.begin(), skips.end());
   BOOST_CHECK_EQUAL_COLLECTIONS(l.all_begin(), l.all_end(),
@@ -250,10 +250,10 @@ BOOST_AUTO_TEST_CASE( test_swap )
 BOOST_AUTO_TEST_CASE( test_splice )
 {
   Fixture a, b;
-  a.all.insert(boost::next(a.all.begin()), b.all.begin(), b.all.end());
-  a.skips.insert(boost::next(a.skips.begin()), b.skips.begin(), b.skips.end());
+  a.all.insert(std::next(a.all.begin()), b.all.begin(), b.all.end());
+  a.skips.insert(std::next(a.skips.begin()), b.skips.begin(), b.skips.end());
 
-  a.l.splice(boost::next(a.l.skip_begin()), b.l, b.l.skip_begin(), b.l.skip_end());
+  a.l.splice(std::next(a.l.skip_begin()), b.l, b.l.skip_begin(), b.l.skip_end());
   BOOST_CHECK_EQUAL_COLLECTIONS(a.l.all_begin(), a.l.all_end(),
                                 a.all.begin(), a.all.end());
 
diff --git a/Spatial_searching/include/CGAL/Spatial_searching/internal/bounded_priority_queue.h b/Spatial_searching/include/CGAL/Spatial_searching/internal/bounded_priority_queue.h
index 4ef263f59163..58eae6b11ed3 100644
--- a/Spatial_searching/include/CGAL/Spatial_searching/internal/bounded_priority_queue.h
+++ b/Spatial_searching/include/CGAL/Spatial_searching/internal/bounded_priority_queue.h
@@ -124,7 +124,7 @@ class bounded_priority_queue
 
   void sort()
   {
-std::sort(m_data.begin(), boost::next(m_data.begin(),m_count), m_comp);
+std::sort(m_data.begin(), std::next(m_data.begin(),m_count), m_comp);
   }
 
 protected:
diff --git a/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h b/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h
index d710a027cf2b..9b5f303250d0 100644
--- a/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h
+++ b/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h
@@ -285,7 +285,7 @@ class TDS2_In_edge_circulator
 
 namespace std {
 
-// workaround a bug detected on at least g++ 4.4 where boost::next(Iterator)
+// workaround a bug detected on at least g++ 4.4 where std::next(Iterator)
 // is picked as a candidate for next(h,g)
 template <typename TDS>
 struct iterator_traits< CGAL::internal::TDS2_halfedge_descriptor<TDS> >
diff --git a/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h b/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h
index f37ee350689a..c3cd6d187dec 100644
--- a/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_triangulation_plus_2.h
@@ -754,7 +754,7 @@ Default::Get< Tr_, Constrained_Delaunay_triangulation_2<
   void simplify(Vertices_in_constraint_iterator v)
   {
     Vertices_in_constraint_iterator u = std::prev(v);
-    Vertices_in_constraint_iterator w = boost::next(v);
+    Vertices_in_constraint_iterator w = std::next(v);
     bool unew = (*u != *w);
     hierarchy.simplify(u,v,w);
 
diff --git a/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h b/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
index 8154e26251c9..2280ed0cf9eb 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
@@ -612,7 +612,7 @@ void Polyline_constraint_hierarchy_2<T,Compare,Point>::simplify(Vertex_it uc,
       // Remove the list item which points to v
       Vertex_list* vertex_list = it->id().vl_ptr();
       Vertex_it vc_in_context = it->current();
-      vc_in_context = boost::next(vc_in_context);
+      vc_in_context = std::next(vc_in_context);
       vertex_list->skip(vc_in_context.base());
       ++it;
     }
@@ -625,7 +625,7 @@ void Polyline_constraint_hierarchy_2<T,Compare,Point>::simplify(Vertex_it uc,
       // Remove the list item which points to v
       Vertex_list* vertex_list = it->id().vl_ptr();
       Vertex_it vc_in_context = it->current();
-      vc_in_context = boost::next(vc_in_context);
+      vc_in_context = std::next(vc_in_context);
       vertex_list->skip(vc_in_context.base());
       ++it;
     }

From 9ed6c7acdc71e358854b32df3e6bec68de9b422a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 19:51:54 +0200
Subject: [PATCH 0231/1398] remove useless include

---
 Alpha_shapes_3/include/CGAL/Fixed_alpha_shape_3.h               | 1 -
 Convex_hull_3/include/CGAL/convex_hull_3.h                      | 1 -
 Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h          | 2 --
 Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h          | 2 --
 .../internal/Triangle_3_Triangle_3_intersection.h               | 2 --
 Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h      | 1 -
 .../CGAL/Spatial_searching/internal/bounded_priority_queue.h    | 1 -
 7 files changed, 10 deletions(-)

diff --git a/Alpha_shapes_3/include/CGAL/Fixed_alpha_shape_3.h b/Alpha_shapes_3/include/CGAL/Fixed_alpha_shape_3.h
index b901a497018c..586f82ddfe37 100644
--- a/Alpha_shapes_3/include/CGAL/Fixed_alpha_shape_3.h
+++ b/Alpha_shapes_3/include/CGAL/Fixed_alpha_shape_3.h
@@ -27,7 +27,6 @@
 #include <utility>
 #include <iostream>
 #include <queue>
-#include <boost/next_prior.hpp>
 
 #include <CGAL/Triangulation_utils_3.h>
 #include <CGAL/Unique_hash_map.h>
diff --git a/Convex_hull_3/include/CGAL/convex_hull_3.h b/Convex_hull_3/include/CGAL/convex_hull_3.h
index 5915ca243134..20d0809dd967 100644
--- a/Convex_hull_3/include/CGAL/convex_hull_3.h
+++ b/Convex_hull_3/include/CGAL/convex_hull_3.h
@@ -42,7 +42,6 @@
 #include <CGAL/boost/graph/named_params_helper.h>
 #include <CGAL/type_traits/is_iterator.h>
 
-#include <boost/next_prior.hpp>
 #include <boost/type_traits/is_floating_point.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/graph/graph_traits.hpp>
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
index 4490b2057f8a..26fb034df447 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
@@ -23,8 +23,6 @@
 #include <CGAL/Kernel_d/Cartesian_const_iterator_d.h>
 #include <CGAL/Handle_for.h>
 
-#include <boost/next_prior.hpp>
-
 namespace CGAL {
 
 template < class R_ >
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
index 7885e2dd9587..c86e20f486dd 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
@@ -21,8 +21,6 @@
 #include <CGAL/array.h>
 #include <CGAL/Kernel_d/Cartesian_const_iterator_d.h>
 
-#include <boost/next_prior.hpp>
-
 namespace CGAL {
 
 template < class R_ >
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index 2f036bc98a07..b55ccf02acb2 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -21,8 +21,6 @@
 
 #include <CGAL/kernel_assertions.h>
 
-#include <boost/next_prior.hpp>
-
 #include <list>
 #include <map>
 #include <vector>
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 400699d0e667..758aa9931717 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -37,7 +37,6 @@
 #include <algorithm>
 #include <type_traits>
 
-#include <boost/next_prior.hpp> // for std::prev and std::next
 #include <boost/variant.hpp>
 #include <memory>
 
diff --git a/Spatial_searching/include/CGAL/Spatial_searching/internal/bounded_priority_queue.h b/Spatial_searching/include/CGAL/Spatial_searching/internal/bounded_priority_queue.h
index 58eae6b11ed3..bd3e9f0b8ff7 100644
--- a/Spatial_searching/include/CGAL/Spatial_searching/internal/bounded_priority_queue.h
+++ b/Spatial_searching/include/CGAL/Spatial_searching/internal/bounded_priority_queue.h
@@ -22,7 +22,6 @@
 #include <vector>
 #include <functional>
 #include <algorithm>
-#include <boost/next_prior.hpp>
 
 namespace CGAL {
 namespace internal{

From 8e29e704be6a5e4801d9aff4783a7d96ffac1863 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 20:53:57 +0200
Subject: [PATCH 0232/1398] factorize constructor

---
 Property_map/include/CGAL/property_map.h | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/Property_map/include/CGAL/property_map.h b/Property_map/include/CGAL/property_map.h
index 0da2528a3da5..12fd06503fee 100644
--- a/Property_map/include/CGAL/property_map.h
+++ b/Property_map/include/CGAL/property_map.h
@@ -73,9 +73,7 @@ class OR_property_map {
   typedef typename PM1::reference reference;
   typedef boost::read_write_property_map_tag category;
 
-  OR_property_map() {} // required by boost::connected_components
-
-  OR_property_map(PM1 pm1, PM2 pm2)
+  OR_property_map(PM1 pm1 = PM1(), PM2 pm2 = PM2())
     : pm1(pm1),pm2(pm2)
   {}
 

From 8740b244a26bd9f69caa60bf6a683240d178ad9c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 20:55:55 +0200
Subject: [PATCH 0233/1398] boost::distance -> std::distance

boost's version is working on std::pair but we decided to no longer
consider iterator pairs as ranges
---
 BGL/include/CGAL/boost/graph/Dual.h           |  2 +-
 BGL/test/BGL/test_Euler_operations.cpp        | 20 +++++++++----------
 .../Scene_polyhedron_selection_item.cpp       |  8 ++++----
 3 files changed, 15 insertions(+), 15 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/Dual.h b/BGL/include/CGAL/boost/graph/Dual.h
index 78cc2b6c6f79..1255e0b08d93 100644
--- a/BGL/include/CGAL/boost/graph/Dual.h
+++ b/BGL/include/CGAL/boost/graph/Dual.h
@@ -458,7 +458,7 @@ out_degree(typename boost::graph_traits<Dual<P> >::vertex_descriptor v,
            const Dual<P>& dual)
 {
   const typename Dual<P>::Primal& primal = dual.primal();
-  return boost::distance(halfedges_around_face(halfedge(v,primal),primal));
+  return std::distance(halfedges_around_face(halfedge(v,primal),primal));
 }
 
  template <typename P>
diff --git a/BGL/test/BGL/test_Euler_operations.cpp b/BGL/test/BGL/test_Euler_operations.cpp
index 4c2ade85ea1c..36ac20e3f35d 100644
--- a/BGL/test/BGL/test_Euler_operations.cpp
+++ b/BGL/test/BGL/test_Euler_operations.cpp
@@ -270,8 +270,8 @@ join_vertex_interior_test()
   assert(CGAL::internal::exact_num_faces(f.m) == 2);
   assert(CGAL::internal::exact_num_vertices(f.m) == 5);
   assert(CGAL::internal::exact_num_edges(f.m) == 6);
-  assert(boost::distance(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m)) == 3);
-  assert(boost::distance(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m)) == 3);
+  assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m)) == 3);
+  assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m)) == 3);
   assert(degree(f.x, f.m) == 4);
   assert(CGAL::is_valid_polygon_mesh(f.m));
 }
@@ -295,8 +295,8 @@ join_vertex_exterior_test()
     assert(CGAL::internal::exact_num_faces(f.m) == 2);
     assert(CGAL::internal::exact_num_vertices(f.m) == 5);
     assert(CGAL::internal::exact_num_edges(f.m) == 6);
-    assert(boost::distance(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m)) == 4);
-    assert(boost::distance(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m)) == 3);
+    assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m)) == 4);
+    assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m)) == 3);
     assert(degree(f.y, f.m) == 3);
     assert(CGAL::is_valid_polygon_mesh(f.m));
   }
@@ -314,8 +314,8 @@ join_vertex_exterior_test()
     assert(CGAL::internal::exact_num_faces(f.m) == 2);
     assert(CGAL::internal::exact_num_vertices(f.m) == 5);
     assert(CGAL::internal::exact_num_edges(f.m) == 6);
-    assert(boost::distance(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m)) == 4);
-    assert(boost::distance(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m)) == 3);
+    assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m)) == 4);
+    assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m)) == 3);
 
     assert(CGAL::is_valid_polygon_mesh(f.m));
     assert(degree(f.w, f.m) == 3);
@@ -344,8 +344,8 @@ split_vertex()
   assert(CGAL::is_valid_polygon_mesh(f.m));
   assert(CGAL::internal::exact_num_vertices(f.m) == 7);
   assert(CGAL::internal::exact_num_edges(f.m) == 8);
-  assert(boost::distance(CGAL::halfedges_around_face(h1, f.m)) == 5);
-  assert(boost::distance(CGAL::halfedges_around_face(h2, f.m)) == 7);
+  assert(std::distance(CGAL::halfedges_around_face(h1, f.m)) == 5);
+  assert(std::distance(CGAL::halfedges_around_face(h2, f.m)) == 7);
 }
 
 template <typename T>
@@ -371,8 +371,8 @@ split_join_vertex_inverse()
   assert(CGAL::internal::exact_num_faces(f.m) == 2);
   assert(CGAL::internal::exact_num_edges(f.m) == 6);
   assert(CGAL::internal::exact_num_halfedges(f.m) == 12);
-  assert(boost::distance(CGAL::halfedges_around_face(h1, f.m)) == 3);
-  assert(boost::distance(CGAL::halfedges_around_face(h2, f.m)) == 3);
+  assert(std::distance(CGAL::halfedges_around_face(h1, f.m)) == 3);
+  assert(std::distance(CGAL::halfedges_around_face(h2, f.m)) == 3);
 }
 
 
diff --git a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
index 561f3f7c8fb7..0f32ae5b719e 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
@@ -1076,9 +1076,9 @@ bool Scene_polyhedron_selection_item:: treat_selection(const std::set<fg_edge_de
     }
       //Join vertex
     case 0:
-      if(boost::distance(CGAL::halfedges_around_face(halfedge(ed, *polyhedron()), *polyhedron())) < 4
+      if(std::distance(CGAL::halfedges_around_face(halfedge(ed, *polyhedron()), *polyhedron())) < 4
            ||
-         boost::distance(CGAL::halfedges_around_face(opposite(halfedge(ed, *polyhedron()),*polyhedron()),*polyhedron()))< 4)
+         std::distance(CGAL::halfedges_around_face(opposite(halfedge(ed, *polyhedron()),*polyhedron()),*polyhedron()))< 4)
         {
           d->tempInstructions("Edge not selected: the incident facets must have a degree of at least 4.",
                            "Select the edge with extremities you want to join.");
@@ -1177,9 +1177,9 @@ bool Scene_polyhedron_selection_item:: treat_selection(const std::set<fg_edge_de
     case 6:
 
         //check preconditions
-      if(boost::distance(CGAL::halfedges_around_face(halfedge(ed, *polyhedron()),*polyhedron())) == 3
+      if(std::distance(CGAL::halfedges_around_face(halfedge(ed, *polyhedron()),*polyhedron())) == 3
          &&
-         boost::distance(CGAL::halfedges_around_face(opposite(halfedge(ed, *polyhedron()),*polyhedron()),*polyhedron())) == 3
+         std::distance(CGAL::halfedges_around_face(opposite(halfedge(ed, *polyhedron()),*polyhedron()),*polyhedron())) == 3
         && !CGAL::is_border(ed, *polyhedron()))
       {
         SMesh* mesh = polyhedron();

From 390cccf63b15322849f70d44af1c320c2dc2e647 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 21:01:38 +0200
Subject: [PATCH 0234/1398] boost::is_empty -> std::is_empty

---
 STL_Extension/include/CGAL/transforming_iterator.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/STL_Extension/include/CGAL/transforming_iterator.h b/STL_Extension/include/CGAL/transforming_iterator.h
index ed58473b0c50..97287711aec7 100644
--- a/STL_Extension/include/CGAL/transforming_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_iterator.h
@@ -27,7 +27,7 @@ namespace CGAL {
 namespace internal {
 
 // non-empty case
-template<class T,bool=boost::is_empty<T>::value> struct Functor_as_base {
+template<class T,bool=std::is_empty<T>::value> struct Functor_as_base {
         Functor_as_base(){}
         Functor_as_base(T const& t):f(t){}
         //template<class T2> Functor_as_base(Functor_as_base<T2> const&g):f(g.functor()){}

From 6fd9476cd79c85a322fe1ef8153ccd7d0d9864bf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 21:15:38 +0200
Subject: [PATCH 0235/1398] boost::is_integral -> std::is_integral

---
 .../demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp      | 6 +++---
 STL_Extension/include/CGAL/transforming_iterator.h          | 4 +---
 2 files changed, 4 insertions(+), 6 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
index 68c3053d876b..67da801ae913 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
@@ -855,18 +855,18 @@ public Q_SLOTS:
   template<typename T>
   void switchReaderConverter(std::pair<T, T> minmax)
   {
-    switchReaderConverter(minmax, typename boost::is_integral<T>::type());
+    switchReaderConverter(minmax, typename std::is_integral<T>::type());
   }
 
   template<typename T>
-  void switchReaderConverter(std::pair<T, T> minmax, boost::true_type)
+  void switchReaderConverter(std::pair<T, T> minmax, std::true_type)
   {
     // IntConverter
     IntConverter x = { minmax }; pxr_.setIC(x);
   }
 
   template<typename T>
-  void switchReaderConverter(std::pair<T, T> minmax, boost::false_type)
+  void switchReaderConverter(std::pair<T, T> minmax, std::false_type)
   {
     // IntConverter
     DoubleConverter x = { minmax }; pxr_.setFC(x);
diff --git a/STL_Extension/include/CGAL/transforming_iterator.h b/STL_Extension/include/CGAL/transforming_iterator.h
index 97287711aec7..fe61368ddfbd 100644
--- a/STL_Extension/include/CGAL/transforming_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_iterator.h
@@ -12,9 +12,7 @@
 #ifndef CGAL_TRANSFORMING_ITERATOR_H
 #define CGAL_TRANSFORMING_ITERATOR_H
 #include <boost/iterator/iterator_adaptor.hpp>
-#include <boost/type_traits/is_empty.hpp>
 #include <boost/type_traits/is_reference.hpp>
-#include <boost/type_traits/is_integral.hpp>
 #include <boost/mpl/if.hpp>
 #include <boost/mpl/or.hpp>
 #include <CGAL/Default.h>
@@ -60,7 +58,7 @@ class transforming_iterator_helper
         // Crappy heuristic. If we have *it that returns a Weighted_point and F that returns a reference to the Point contained in the Weighted_point it takes as argument, we do NOT want the transformed iterator to return a reference to the temporary *it. On the other hand, if *it returns an int n, and F returns a reference to array[n] it is not so good to lose the reference. This probably should be done elsewhere and should at least be made optional...
         typedef typename boost::mpl::if_<
           boost::mpl::or_<boost::is_reference<Iter_ref>,
-                          boost::is_integral<Iter_ref> >,
+                          std::is_integral<Iter_ref> >,
           reference_, value_type>::type reference;
 
         public:

From d4d2225801f18b73bab4439a7964ed7badfb30ac Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 21:18:32 +0200
Subject: [PATCH 0236/1398] boost::is_reference -> std::is_reference

---
 BGL/include/CGAL/boost/graph/properties.h              | 2 +-
 STL_Extension/include/CGAL/transforming_iterator.h     | 3 +--
 Spatial_searching/include/CGAL/Search_traits_adapter.h | 4 ++--
 3 files changed, 4 insertions(+), 5 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/properties.h b/BGL/include/CGAL/boost/graph/properties.h
index fbe1f2e45139..80b02a191a14 100644
--- a/BGL/include/CGAL/boost/graph/properties.h
+++ b/BGL/include/CGAL/boost/graph/properties.h
@@ -140,7 +140,7 @@ struct Point_accessor<Handle, ValueType, ConstReference, true>
   typedef ValueType                      value_type;
   typedef Handle                         key_type;
 
-  typedef typename boost::mpl::if_< boost::is_reference<ConstReference>,
+  typedef typename boost::mpl::if_< std::is_reference<ConstReference>,
                                     ValueType&,
                                     ValueType >::type Reference;
 
diff --git a/STL_Extension/include/CGAL/transforming_iterator.h b/STL_Extension/include/CGAL/transforming_iterator.h
index fe61368ddfbd..3067207e643e 100644
--- a/STL_Extension/include/CGAL/transforming_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_iterator.h
@@ -12,7 +12,6 @@
 #ifndef CGAL_TRANSFORMING_ITERATOR_H
 #define CGAL_TRANSFORMING_ITERATOR_H
 #include <boost/iterator/iterator_adaptor.hpp>
-#include <boost/type_traits/is_reference.hpp>
 #include <boost/mpl/if.hpp>
 #include <boost/mpl/or.hpp>
 #include <CGAL/Default.h>
@@ -57,7 +56,7 @@ class transforming_iterator_helper
 
         // Crappy heuristic. If we have *it that returns a Weighted_point and F that returns a reference to the Point contained in the Weighted_point it takes as argument, we do NOT want the transformed iterator to return a reference to the temporary *it. On the other hand, if *it returns an int n, and F returns a reference to array[n] it is not so good to lose the reference. This probably should be done elsewhere and should at least be made optional...
         typedef typename boost::mpl::if_<
-          boost::mpl::or_<boost::is_reference<Iter_ref>,
+          boost::mpl::or_<std::is_reference<Iter_ref>,
                           std::is_integral<Iter_ref> >,
           reference_, value_type>::type reference;
 
diff --git a/Spatial_searching/include/CGAL/Search_traits_adapter.h b/Spatial_searching/include/CGAL/Search_traits_adapter.h
index f93fc340b7a2..ff640dc639a4 100644
--- a/Spatial_searching/include/CGAL/Search_traits_adapter.h
+++ b/Spatial_searching/include/CGAL/Search_traits_adapter.h
@@ -225,13 +225,13 @@ class Search_traits_adapter : public Base_traits{
   // Select type of iterator + construct class depending on whether
   // point map is lvalue or not
   typedef typename boost::mpl::if_<
-              boost::is_reference<typename boost::property_traits<PointPropertyMap>::reference>,
+              std::is_reference<typename boost::property_traits<PointPropertyMap>::reference>,
               typename Base::Cartesian_const_iterator_d,
               No_lvalue_iterator>::type
     Cartesian_const_iterator_d;
 
   typedef typename boost::mpl::if_<
-              boost::is_reference<typename boost::property_traits<PointPropertyMap>::reference>,
+              std::is_reference<typename boost::property_traits<PointPropertyMap>::reference>,
               Construct_cartesian_const_iterator_d_lvalue,
               Construct_cartesian_const_iterator_d_no_lvalue>::type
     Construct_cartesian_const_iterator_d;

From a1b2dd014db61aa8b67fd0ec8e645171ad85e9e2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 21:20:00 +0200
Subject: [PATCH 0237/1398] boost::is_pointer -> std::is_pointer

---
 STL_Extension/include/CGAL/type_traits/is_iterator.h | 3 +--
 Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h    | 4 +---
 2 files changed, 2 insertions(+), 5 deletions(-)

diff --git a/STL_Extension/include/CGAL/type_traits/is_iterator.h b/STL_Extension/include/CGAL/type_traits/is_iterator.h
index 837c91e0330c..ddc34f9d4dfd 100644
--- a/STL_Extension/include/CGAL/type_traits/is_iterator.h
+++ b/STL_Extension/include/CGAL/type_traits/is_iterator.h
@@ -18,7 +18,6 @@
 #define CGAL_TYPE_TRAITS_IS_ITERATOR_H
 
 #include <boost/type_traits/is_convertible.hpp>
-#include <boost/type_traits/is_pointer.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/mpl/logical.hpp>
 
@@ -44,7 +43,7 @@ struct is_iterator_
                has_difference_type<T>,
                has_pointer<T>,
                has_reference<T> >,
-             boost::is_pointer<T> >
+               std::is_pointer<T> >
 { };
 
 template <class T, class U, bool = is_iterator_<T>::value>
diff --git a/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h b/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h
index add923b15e22..3709e0a0e15b 100644
--- a/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h
+++ b/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h
@@ -26,8 +26,6 @@
 #include <CGAL/Dimension.h>
 #include <CGAL/number_type_config.h>
 
-#include <boost/type_traits/is_pointer.hpp>
-
 #include <CGAL/Kd_tree.h>
 #include <CGAL/Search_traits_2.h>
 #include <CGAL/Fuzzy_iso_box.h>
@@ -107,7 +105,7 @@ class Search_traits_kd_tree_2 {
 
 template<class Traits_, class SAVED_OBJECT>
 class Multiple_kd_tree {
-  CGAL_static_assertion_msg((boost::is_pointer<SAVED_OBJECT>::value), "SAVED_OBJECT is not a pointer.");
+  CGAL_static_assertion_msg((std::is_pointer<SAVED_OBJECT>::value), "SAVED_OBJECT is not a pointer.");
 private:
   typedef Traits_                                       Traits;
   typedef typename Traits::FT                           NT;

From a04035879d5811b21c703f9691a3fdd69d704145 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 21:22:20 +0200
Subject: [PATCH 0238/1398] boost::is_const -> std::is_const

---
 BGL/include/CGAL/boost/graph/property_maps.h           |  1 -
 Mesh_3/benchmark/Mesh_3/StdAfx.h                       |  1 -
 .../internal/Corefinement/face_graph_utils.h           |  1 -
 Polyhedron/demo/Polyhedron/SMesh_type.h                |  2 +-
 .../include/CGAL/boost/graph/properties_Surface_mesh.h |  2 +-
 .../boost/graph/properties_Surface_mesh_features.h     | 10 +++++-----
 .../boost/graph/properties_Surface_mesh_time_stamp.h   |  2 +-
 7 files changed, 8 insertions(+), 11 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/property_maps.h b/BGL/include/CGAL/boost/graph/property_maps.h
index 772966bdacdb..aab29d9b8811 100644
--- a/BGL/include/CGAL/boost/graph/property_maps.h
+++ b/BGL/include/CGAL/boost/graph/property_maps.h
@@ -15,7 +15,6 @@
 
 #include <CGAL/property_map.h>
 #include <CGAL/boost/graph/properties.h>
-#include <boost/type_traits/is_const.hpp>
 #include <boost/mpl/if.hpp>
 
 namespace CGAL{
diff --git a/Mesh_3/benchmark/Mesh_3/StdAfx.h b/Mesh_3/benchmark/Mesh_3/StdAfx.h
index d99e062fcbe0..4505ee29f7f1 100644
--- a/Mesh_3/benchmark/Mesh_3/StdAfx.h
+++ b/Mesh_3/benchmark/Mesh_3/StdAfx.h
@@ -137,7 +137,6 @@
 #include <boost/type_traits.hpp>
 #include <boost/type_traits/add_reference.hpp>
 #include <boost/type_traits/is_base_and_derived.hpp>
-#include <boost/type_traits/is_const.hpp>
 #include <boost/type_traits/is_convertible.hpp>
 #include <boost/type_traits/is_reference.hpp>
 #include <boost/utility.hpp>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
index d05e9ff97b1e..7d9a37385f8a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
@@ -18,7 +18,6 @@
 
 #include <CGAL/Polygon_mesh_processing/orientation.h>
 #include <CGAL/property_map.h>
-#include <boost/type_traits/is_const.hpp>
 #include <boost/mpl/if.hpp>
 #include <fstream>
 #include <sstream>
diff --git a/Polyhedron/demo/Polyhedron/SMesh_type.h b/Polyhedron/demo/Polyhedron/SMesh_type.h
index f79a819cb9a6..fad279a89931 100644
--- a/Polyhedron/demo/Polyhedron/SMesh_type.h
+++ b/Polyhedron/demo/Polyhedron/SMesh_type.h
@@ -51,7 +51,7 @@ struct Get_pmap_of_surface_mesh_ {
 
 #define CGAL_PROPERTY_SURFACE_MESH_RETURN_TYPE(Tag) \
   typename boost::lazy_disable_if<                      \
-     boost::is_const<P>,                                \
+     std::is_const<P>,                                \
      Get_pmap_of_surface_mesh_<P, Tag >                  \
    >::type
 
diff --git a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h
index b05395d26427..281c2b37093e 100644
--- a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h
+++ b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h
@@ -238,7 +238,7 @@ template<typename Point>
 typename
 boost::lazy_disable_if
 <
-  boost::is_const<Point>,
+  std::is_const<Point>,
   internal::Get_vertex_point_map_for_Surface_mesh_return_type<Point>
 >::type
 get(CGAL::vertex_point_t, const CGAL::Surface_mesh<Point>& g) {
diff --git a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h
index b3881cb789e9..b6fbb66f9681 100644
--- a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h
+++ b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h
@@ -79,7 +79,7 @@ namespace CGAL {
 
 template <typename P, typename I>
 typename boost::lazy_disable_if<
-   boost::is_const<P>,
+   std::is_const<P>,
    Get_pmap_of_surface_mesh<P, CGAL::face_patch_id_t<I> >
  >::type
 inline get(CGAL::face_patch_id_t<I>, Surface_mesh<P> & smesh)
@@ -91,7 +91,7 @@ inline get(CGAL::face_patch_id_t<I>, Surface_mesh<P> & smesh)
 
 template <typename P, typename I>
 typename boost::lazy_disable_if<
-   boost::is_const<P>,
+   std::is_const<P>,
    Get_pmap_of_surface_mesh<P, CGAL::face_patch_id_t<I> >
  >::type
 inline get(CGAL::face_patch_id_t<I>, const Surface_mesh<P> & smesh)
@@ -103,7 +103,7 @@ inline get(CGAL::face_patch_id_t<I>, const Surface_mesh<P> & smesh)
 
 #define CGAL_PROPERTY_SURFACE_MESH_RETURN_TYPE(Tag) \
   typename boost::lazy_disable_if<                      \
-     boost::is_const<P>,                                \
+     std::is_const<P>,                                \
      Get_pmap_of_surface_mesh<P, Tag >                  \
    >::type
 
@@ -153,7 +153,7 @@ inline get(CGAL::vertex_feature_degree_t, const Surface_mesh<P> & smesh)
 
 template <typename P, typename I>
 typename boost::lazy_disable_if<
-   boost::is_const<P>,
+   std::is_const<P>,
    Get_pmap_of_surface_mesh<P, CGAL::vertex_incident_patches_t<I> >
  >::type
   inline get(CGAL::vertex_incident_patches_t<I>, Surface_mesh<P> & smesh)
@@ -164,7 +164,7 @@ typename boost::lazy_disable_if<
 
 template <typename P, typename I>
 typename boost::lazy_disable_if<
-   boost::is_const<P>,
+   std::is_const<P>,
    Get_pmap_of_surface_mesh<P, CGAL::vertex_incident_patches_t<I> >
  >::type
   inline get(CGAL::vertex_incident_patches_t<I>, const Surface_mesh<P> & smesh)
diff --git a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h
index 23f4f074bf30..d1df35ed90f9 100644
--- a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h
+++ b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h
@@ -59,7 +59,7 @@ namespace CGAL {
 
 #define CGAL_PROPERTY_SURFACE_MESH_RETURN_TYPE(Tag) \
   typename boost::lazy_disable_if<                      \
-     boost::is_const<P>,                                \
+     std::is_const<P>,                                \
      Get_pmap_of_surface_mesh<P, Tag >                  \
    >::type
 

From 5726a0a255314d658420a982031c7477db6ec3f6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 21:24:43 +0200
Subject: [PATCH 0239/1398] boost::is_floating_point -> std::is_floating_point
 boost::is_float

---
 .../include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h    | 2 +-
 .../include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h    | 2 +-
 .../CGAL/Convex_hull_3/dual/halfspace_intersection_3.h        | 3 +--
 Convex_hull_3/include/CGAL/Convex_hull_traits_3.h             | 2 +-
 Convex_hull_3/include/CGAL/convex_hull_3.h                    | 3 +--
 .../include/CGAL/Optimal_transportation_reconstruction_2.h    | 3 +--
 .../internal/Corefinement/intersection_nodes.h                | 3 +--
 .../CGAL/Surface_mesh_segmentation/internal/AABB_traits.h     | 4 ++--
 8 files changed, 9 insertions(+), 13 deletions(-)

diff --git a/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h b/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
index cc734b7f4b63..84263d358f69 100644
--- a/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
+++ b/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
@@ -448,7 +448,7 @@ struct Alpha_nt_selector_2
              GeomTraits,
              // If the base traits is already exact then we don't need to do anything,
              // and we can simply directly use the traits class
-             Boolean_tag<boost::is_floating_point<typename GeomTraits::FT>::value &&
+             Boolean_tag<std::is_floating_point<typename GeomTraits::FT>::value &&
                          ExactAlphaComparisonTag::value >,
              Weighted_tag>
 { };
diff --git a/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h b/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
index cd8536243789..14ff435b3e0d 100644
--- a/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
+++ b/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
@@ -417,7 +417,7 @@ struct Alpha_nt_selector_3
              GeomTraits,
              // If the base traits is already exact then we don't need to do anything,
              // and we can simply directly use the traits class
-             Boolean_tag<boost::is_floating_point<typename GeomTraits::FT>::value &&
+             Boolean_tag<std::is_floating_point<typename GeomTraits::FT>::value &&
                          ExactAlphaComparisonTag::value >,
              Weighted_tag>
 { };
diff --git a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
index 16a685e08ddf..87062e5c29dd 100644
--- a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
+++ b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
@@ -30,7 +30,6 @@
 #include <CGAL/Number_types/internal/Exact_type_selector.h>
 
 #include <unordered_map>
-#include <boost/type_traits/is_floating_point.hpp>
 #include <deque>
 
 namespace CGAL
@@ -261,7 +260,7 @@ namespace CGAL
         // The check is done only if the number type is not float or double because in that
         // case we know the construction of dual points is not exact
         CGAL_assertion_msg(
-          boost::is_floating_point<typename K::FT>::value ||
+          std::is_floating_point<typename K::FT>::value ||
           Convex_hull_3::internal::point_inside_convex_polyhedron(P, *origin),
           "halfspace_intersection_3: origin not in the polyhedron"
         );
diff --git a/Convex_hull_3/include/CGAL/Convex_hull_traits_3.h b/Convex_hull_3/include/CGAL/Convex_hull_traits_3.h
index 4cf555e37b35..e57dc65772e8 100644
--- a/Convex_hull_3/include/CGAL/Convex_hull_traits_3.h
+++ b/Convex_hull_3/include/CGAL/Convex_hull_traits_3.h
@@ -151,7 +151,7 @@ struct GT3_for_CH3 {
   template <class R_, class Polyhedron = Default,
             class Has_filtered_predicates_tag = Boolean_tag
             <
-              boost::is_floating_point<typename R_::FT>::type::value &&
+              std::is_floating_point<typename R_::FT>::type::value &&
               R_::Has_filtered_predicates_tag::value
             > >
 class Convex_hull_traits_3
diff --git a/Convex_hull_3/include/CGAL/convex_hull_3.h b/Convex_hull_3/include/CGAL/convex_hull_3.h
index 20d0809dd967..70c2f5ea0972 100644
--- a/Convex_hull_3/include/CGAL/convex_hull_3.h
+++ b/Convex_hull_3/include/CGAL/convex_hull_3.h
@@ -42,7 +42,6 @@
 #include <CGAL/boost/graph/named_params_helper.h>
 #include <CGAL/type_traits/is_iterator.h>
 
-#include <boost/type_traits/is_floating_point.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/graph/graph_traits.hpp>
 
@@ -148,7 +147,7 @@ namespace internal {
 //struct to select the default traits class for computing convex hull
 template< class Point_3,
           class PolygonMesh = Default,
-          class Is_floating_point=typename boost::is_floating_point<typename Kernel_traits<Point_3>::Kernel::FT>::type,
+          class Is_floating_point=typename std::is_floating_point<typename Kernel_traits<Point_3>::Kernel::FT>::type,
           class Has_filtered_predicates_tag=typename Kernel_traits<Point_3>::Kernel::Has_filtered_predicates_tag >
 struct Default_traits_for_Chull_3{
   typedef typename Kernel_traits<Point_3>::Kernel type;
diff --git a/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h b/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h
index d18407434122..ba6ebd878120 100644
--- a/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h
+++ b/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h
@@ -34,7 +34,6 @@
 #include <boost/multi_index/ordered_index.hpp>
 #include <boost/multi_index/identity.hpp>
 #include <CGAL/boost/iterator/transform_iterator.hpp>
-#include <boost/type_traits/is_float.hpp>
 
 namespace CGAL {
 
@@ -1196,7 +1195,7 @@ class Optimal_transportation_reconstruction_2
   void relocate_on_the_double_grid(Point& p) const
   {
     relocate_on_the_double_grid(p,
-      typename boost::is_float<typename Traits::FT>::type());
+      typename std::is_floating_point<typename Traits::FT>::type());
   }
 
   Point compute_relocation(Vertex_handle vertex) const {
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
index 64933af6b3b8..42629a5b6797 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
@@ -17,7 +17,6 @@
 
 
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <boost/type_traits/is_floating_point.hpp>
 #include <CGAL/Kernel_traits.h>
 
 namespace CGAL {
@@ -31,7 +30,7 @@ template <class TriangleMesh,
           class VertexPointMap1, class VertexPointMap2,
           bool Predicates_on_constructions_needed,
           bool Has_exact_constructions =
-          !boost::is_floating_point<
+          !std::is_floating_point<
             typename Kernel_traits<
               typename boost::property_traits<VertexPointMap1>::value_type
             >::Kernel::FT
diff --git a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/AABB_traits.h b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/AABB_traits.h
index c6528a2b4030..ae2a6de7ae0f 100644
--- a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/AABB_traits.h
+++ b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/AABB_traits.h
@@ -47,7 +47,7 @@ class AABB_traits_SDF :
     // activate functions below if K::FT is floating point and fast_bbox_intersection = true
     template <class K>
     std::enable_if_t<
-      boost::is_floating_point<typename K::FT>::value && fast_bbox_intersection,
+      std::is_floating_point<typename K::FT>::value && fast_bbox_intersection,
           bool >
     operator()(const CGAL::Segment_3<K>& segment, const Bounding_box& bbox) const {
       const Point_3& p = segment.source();
@@ -65,7 +65,7 @@ class AABB_traits_SDF :
 
     template <class K>
     std::enable_if_t<
-      boost::is_floating_point<typename K::FT>::value && fast_bbox_intersection,
+      std::is_floating_point<typename K::FT>::value && fast_bbox_intersection,
           bool >
     operator()(const CGAL::Ray_3<K>& ray, const Bounding_box& bbox) const {
       const Point_3& p = ray.source();

From 32340e64010fd45767c019b8c36b1edef07bda66 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 21:29:36 +0200
Subject: [PATCH 0240/1398] boost::is_arithmetic -> std::is_arithmetic

---
 NewKernel_d/include/CGAL/NewKernel_d/utils.h | 2 +-
 Number_types/include/CGAL/Lazy_exact_nt.h    | 3 +--
 2 files changed, 2 insertions(+), 3 deletions(-)

diff --git a/NewKernel_d/include/CGAL/NewKernel_d/utils.h b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
index fb661f5397e2..adc632e50c67 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/utils.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
@@ -88,7 +88,7 @@ struct Has_type_different_from <T, No, true>
                 }
         };
 
-        template <class NT> struct has_cheap_constructor : boost::is_arithmetic<NT>{};
+        template <class NT> struct has_cheap_constructor : std::is_arithmetic<NT>{};
         template <bool p> struct has_cheap_constructor<Interval_nt<p> > {
                         enum { value=true };
         };
diff --git a/Number_types/include/CGAL/Lazy_exact_nt.h b/Number_types/include/CGAL/Lazy_exact_nt.h
index 38c55c62d325..6890fc174208 100644
--- a/Number_types/include/CGAL/Lazy_exact_nt.h
+++ b/Number_types/include/CGAL/Lazy_exact_nt.h
@@ -18,7 +18,6 @@
 
 #include <CGAL/boost/iterator/transform_iterator.hpp> // for Root_of functor
 #include <boost/operators.hpp>
-#include <boost/type_traits/is_arithmetic.hpp>
 
 #include <boost/mpl/if.hpp>
 #include <boost/mpl/logical.hpp>
@@ -383,7 +382,7 @@ public :
   // Also check that ET and AT are constructible from T?
   template<class T>
   Lazy_exact_nt (T i, std::enable_if_t<boost::mpl::and_<
-      boost::mpl::or_<boost::is_arithmetic<T>, std::is_enum<T> >,
+      boost::mpl::or_<std::is_arithmetic<T>, std::is_enum<T> >,
       boost::mpl::not_<std::is_same<T,ET> > >::value,void*> = 0)
     : Base(new Lazy_exact_Cst<ET,T>(i)) {}
 

From b039040f732ff7769f3349f14cb75474d2ea1c1a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 22:00:21 +0200
Subject: [PATCH 0241/1398] boost::is_convertible -> std::is_convertible

---
 .../AABB_halfedge_graph_segment_primitive.h    |  1 -
 .../CGAL/Test/_test_algebraic_structure.h      |  2 +-
 .../include/CGAL/Arr_overlay_2.h               |  8 ++++----
 .../include/CGAL/box_intersection_d.h          |  4 ++--
 Circulator/include/CGAL/circulator.h           | 16 +++++++---------
 .../include/CGAL/Homogeneous/PointH2.h         |  5 ++---
 .../include/CGAL/Homogeneous/PointH3.h         |  6 +++---
 .../include/CGAL/Homogeneous/VectorH2.h        |  4 ++--
 .../include/CGAL/Homogeneous/VectorH3.h        |  6 +++---
 .../CGAL/regular_neighbor_coordinates_2.h      |  4 +---
 .../Kernel_23/include/CGAL/_test_cls_point_2.h |  6 ++----
 .../Kernel_23/include/CGAL/_test_cls_point_3.h |  4 ++--
 Mesh_3/benchmark/Mesh_3/StdAfx.h               |  1 -
 Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h      | 17 ++++++++---------
 .../CGAL/Mesh_3/Mesh_global_optimizer.h        | 12 +++++-------
 Mesh_3/include/CGAL/Mesh_3/Mesher_3.h          |  7 +++----
 Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h    |  5 ++---
 Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h   |  5 ++---
 .../CGAL/Mesh_3/Refine_facets_manifold_base.h  | 18 +++++++++---------
 Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h  |  3 +--
 Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h    |  5 ++---
 Mesh_3/include/CGAL/Mesh_cell_base_3.h         |  2 --
 Mesh_3/include/CGAL/refine_mesh_3.h            |  4 ++--
 .../Mesh_3/test_meshing_implicit_function.cpp  |  2 +-
 ...st_meshing_implicit_function_deprecated.cpp |  2 +-
 Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp |  2 +-
 Mesh_3/test/Mesh_3/test_meshing_utilities.h    |  2 +-
 .../CGAL/Periodic_2_Delaunay_triangulation_2.h |  8 ++++----
 .../CGAL/Poisson_reconstruction_function.h     |  3 +--
 .../CGAL/Polygon_mesh_processing/distance.h    | 12 ++++++------
 .../orient_polygon_soup_extension.h            |  4 ++--
 .../include/run_with_qprogressdialog.h         |  2 +-
 STL_Extension/include/CGAL/for_each.h          |  4 ++--
 STL_Extension/include/CGAL/is_convertible.h    |  3 +--
 .../include/CGAL/transforming_iterator.h       |  4 ++--
 .../include/CGAL/transforming_pair_iterator.h  | 14 +++++---------
 .../include/CGAL/type_traits/is_iterator.h     |  5 ++---
 .../Weighted_PCA_smoother.h                    |  4 ++--
 Spatial_searching/include/CGAL/Kd_tree.h       |  2 +-
 .../include/CGAL/Hilbert_sort_median_2.h       |  4 +---
 .../include/CGAL/Hilbert_sort_median_3.h       |  4 +---
 Stream_support/include/CGAL/IO/helpers.h       |  2 +-
 .../Constrained_Delaunay_triangulation_2.h     |  8 ++++----
 .../include/CGAL/Delaunay_triangulation_2.h    |  8 ++++----
 .../include/CGAL/Regular_triangulation_2.h     |  8 ++++----
 Triangulation_2/include/CGAL/Triangulation_2.h |  8 ++++----
 .../include/CGAL/Delaunay_triangulation_3.h    |  8 ++++----
 .../include/CGAL/Regular_triangulation_3.h     |  8 ++++----
 Triangulation_3/include/CGAL/Triangulation_3.h |  8 ++++----
 .../include/CGAL/Triangulation_hierarchy_3.h   |  8 ++++----
 50 files changed, 131 insertions(+), 161 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
index 9a6730264095..fe85c35d3662 100644
--- a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
@@ -24,7 +24,6 @@
 #include <iterator>
 #include <boost/mpl/and.hpp>
 #include <CGAL/type_traits/is_iterator.h>
-#include <boost/type_traits/is_convertible.hpp>
 #include <boost/mpl/if.hpp>
 
 #include <CGAL/Default.h>
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h b/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h
index 5a5e23c7d8fc..f598b1fe7fec 100644
--- a/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h
+++ b/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h
@@ -819,7 +819,7 @@ void test_algebraic_structure(){
     CGAL_static_assertion(
             ( ::std::is_same< typename AST::Is_exact, Is_exact >::value));
 
-    CGAL_static_assertion(( ::boost::is_convertible< Tag,
+    CGAL_static_assertion(( ::std::is_convertible< Tag,
                     Integral_domain_without_division_tag >::value ));
     CGAL_static_assertion(( ::std::is_same< Tag, Algebraic_category>::value));
     CGAL_static_assertion((!::std::is_same< Simplify, Null_functor>::value));
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
index 83358c14b12d..8dc8cdf6fce0 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
@@ -172,14 +172,14 @@ overlay(const Arrangement_on_surface_2<GeometryTraitsA_2, TopologyTraitsA>& arr1
   typedef typename Agt2::Point_2                                A_point;
   typedef typename Bgt2::Point_2                                B_point;
   typedef typename Rgt2::Point_2                                Res_point;
-  CGAL_static_assertion((boost::is_convertible<A_point, Res_point>::value));
-  CGAL_static_assertion((boost::is_convertible<B_point, Res_point>::value));
+  CGAL_static_assertion((std::is_convertible<A_point, Res_point>::value));
+  CGAL_static_assertion((std::is_convertible<B_point, Res_point>::value));
 
   typedef typename Agt2::X_monotone_curve_2                     A_xcv;
   typedef typename Bgt2::X_monotone_curve_2                     B_xcv;
   typedef typename Rgt2::X_monotone_curve_2                     Res_xcv;
-  CGAL_static_assertion((boost::is_convertible<A_xcv, Res_xcv>::value));
-  CGAL_static_assertion((boost::is_convertible<B_xcv, Res_xcv>::value));
+  CGAL_static_assertion((std::is_convertible<A_xcv, Res_xcv>::value));
+  CGAL_static_assertion((std::is_convertible<B_xcv, Res_xcv>::value));
 
   typedef Arr_traits_basic_adaptor_2<Rgt2>              Gt_adaptor_2;
   typedef Arr_overlay_traits_2<Gt_adaptor_2, Arr_a, Arr_b>
diff --git a/Box_intersection_d/include/CGAL/box_intersection_d.h b/Box_intersection_d/include/CGAL/box_intersection_d.h
index 94752c414623..a37ae5a98c72 100644
--- a/Box_intersection_d/include/CGAL/box_intersection_d.h
+++ b/Box_intersection_d/include/CGAL/box_intersection_d.h
@@ -63,10 +63,10 @@ void box_intersection_segment_tree_d(
   const NT sup = Box_intersection_d::box_limits<NT>::sup();
 
 #ifndef CGAL_LINKED_WITH_TBB
-  CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+  CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #else // CGAL_LINKED_WITH_TBB
-  if(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value)
+  if(std::is_convertible<ConcurrencyTag, Parallel_tag>::value)
   {
     // Here is an illustration for n=2.
     //
diff --git a/Circulator/include/CGAL/circulator.h b/Circulator/include/CGAL/circulator.h
index 2b1556218f04..8b4f1d09b04f 100644
--- a/Circulator/include/CGAL/circulator.h
+++ b/Circulator/include/CGAL/circulator.h
@@ -27,8 +27,6 @@
 #include <functional>
 #include <iterator>
 
-#include <boost/type_traits/is_convertible.hpp>
-
 // These are name redefinitions for backwards compatibility
 // with the pre iterator-traits style adaptors.
 
@@ -193,45 +191,45 @@ template <class C> inline
 void Assert_circulator( const C &) {
     typedef typename Circulator_traits<C>::category category;
     CGAL_USE_TYPE(category);
-    CGAL_static_assertion((boost::is_convertible<category, Circulator_tag>::value));
+    CGAL_static_assertion((std::is_convertible<category, Circulator_tag>::value));
 }
 
 template <class I> inline
 void Assert_iterator( const I &) {
     typedef typename Circulator_traits<I>::category category;
     CGAL_USE_TYPE(category);
-    CGAL_static_assertion((boost::is_convertible<category, Iterator_tag>::value));
+    CGAL_static_assertion((std::is_convertible<category, Iterator_tag>::value));
 }
 template <class I> inline
 void Assert_input_category( const I &/*i*/) {
     typedef typename std::iterator_traits<I>::iterator_category category;
     CGAL_USE_TYPE(category);
-    CGAL_static_assertion((boost::is_convertible<category, std::input_iterator_tag>::value));
+    CGAL_static_assertion((std::is_convertible<category, std::input_iterator_tag>::value));
 }
 
 template <class I> inline
 void Assert_output_category( const I &/*i*/) {
   typedef typename std::iterator_traits<I>::iterator_category category;
   CGAL_USE_TYPE(category);
-  CGAL_static_assertion((boost::is_convertible<category, std::output_iterator_tag>::value));
+  CGAL_static_assertion((std::is_convertible<category, std::output_iterator_tag>::value));
 }
 template <class IC> inline
 void Assert_forward_category( const IC &/*ic*/) {
   typedef typename std::iterator_traits<IC>::iterator_category category;
   CGAL_USE_TYPE(category);
-  CGAL_static_assertion((boost::is_convertible<category, std::forward_iterator_tag>::value));
+  CGAL_static_assertion((std::is_convertible<category, std::forward_iterator_tag>::value));
 }
 template <class IC> inline
 void Assert_bidirectional_category( const IC &/*ic*/) {
   typedef typename std::iterator_traits<IC>::iterator_category category;
   CGAL_USE_TYPE(category);
-  CGAL_static_assertion((boost::is_convertible<category, std::bidirectional_iterator_tag>::value));
+  CGAL_static_assertion((std::is_convertible<category, std::bidirectional_iterator_tag>::value));
 }
 template <class IC> inline
 void Assert_random_access_category( const IC &/*ic*/) {
   typedef typename std::iterator_traits<IC>::iterator_category category;
   CGAL_USE_TYPE(category);
-  CGAL_static_assertion((boost::is_convertible<category, std::random_access_iterator_tag>::value));
+  CGAL_static_assertion((std::is_convertible<category, std::random_access_iterator_tag>::value));
 }
 // The assert at-least-category functions use the following
 // functions to resolve properly. Note the proper order of the
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h
index 1c7340d4e606..afb6bff830e9 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h
@@ -18,7 +18,6 @@
 #define CGAL_HOMOGENEOUS_POINT_2_H
 
 #include <CGAL/Origin.h>
-#include <boost/type_traits/is_convertible.hpp>
 #include <boost/mpl/and.hpp>
 #include <boost/mpl/logical.hpp>
 
@@ -54,8 +53,8 @@ class PointH2
 
     template < typename Tx, typename Ty >
     PointH2(const Tx & x, const Ty & y,
-            std::enable_if_t< boost::mpl::and_<boost::is_convertible<Tx, RT>,
-                                               boost::is_convertible<Ty, RT> >::value >* = 0)
+            std::enable_if_t< boost::mpl::and_<std::is_convertible<Tx, RT>,
+                                               std::is_convertible<Ty, RT> >::value >* = 0)
       : base(x, y) {}
 
     PointH2(const FT& x, const FT& y)
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h
index 8f6cb17a535d..87da02cabff1 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h
@@ -52,9 +52,9 @@ class PointH3
 
   template < typename Tx, typename Ty, typename Tz >
   PointH3(const Tx & x, const Ty & y, const Tz & z,
-          std::enable_if_t< boost::mpl::and_< boost::mpl::and_< boost::is_convertible<Tx, RT>,
-                                                                         boost::is_convertible<Ty, RT> >,
-                                                       boost::is_convertible<Tz, RT> >::value >* = 0)
+          std::enable_if_t< boost::mpl::and_< boost::mpl::and_< std::is_convertible<Tx, RT>,
+                                                                         std::is_convertible<Ty, RT> >,
+                                                       std::is_convertible<Tz, RT> >::value >* = 0)
     : base(x, y, z) {}
 
   PointH3(const FT& x, const FT& y, const FT& z)
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
index 26fb034df447..81cd31075952 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
@@ -57,8 +57,8 @@ class VectorH2
 
    template < typename Tx, typename Ty >
    VectorH2(const Tx & x, const Ty & y,
-            std::enable_if_t< boost::mpl::and_<boost::is_convertible<Tx, RT>,
-                                                        boost::is_convertible<Ty, RT> >::value >* = 0)
+            std::enable_if_t< boost::mpl::and_<std::is_convertible<Tx, RT>,
+                                                        std::is_convertible<Ty, RT> >::value >* = 0)
       : base(CGAL::make_array<RT>(x, y, RT(1))) {}
 
    VectorH2(const FT& x, const FT& y)
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
index c86e20f486dd..5228d5251ade 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
@@ -67,9 +67,9 @@ class VectorH3
 
   template < typename Tx, typename Ty, typename Tz >
   VectorH3(const Tx & x, const Ty & y, const Tz & z,
-           std::enable_if_t< boost::mpl::and_< boost::mpl::and_< boost::is_convertible<Tx, RT>,
-                                                                          boost::is_convertible<Ty, RT> >,
-                                                        boost::is_convertible<Tz, RT> >::value >* = 0)
+           std::enable_if_t< boost::mpl::and_< boost::mpl::and_< std::is_convertible<Tx, RT>,
+                                                                          std::is_convertible<Ty, RT> >,
+                                                        std::is_convertible<Tz, RT> >::value >* = 0)
     : base(CGAL::make_array<RT>(x, y, z, RT(1))) {}
 
   VectorH3(const FT& x, const FT& y, const FT& z)
diff --git a/Interpolation/include/CGAL/regular_neighbor_coordinates_2.h b/Interpolation/include/CGAL/regular_neighbor_coordinates_2.h
index 0e18ed8baaf3..2464a1229046 100644
--- a/Interpolation/include/CGAL/regular_neighbor_coordinates_2.h
+++ b/Interpolation/include/CGAL/regular_neighbor_coordinates_2.h
@@ -22,8 +22,6 @@
 #include <CGAL/function_objects.h>
 #include <CGAL/Polygon_2_algorithms.h>
 
-#include <boost/type_traits/is_convertible.hpp>
-
 #include <iterator>
 #include <list>
 #include <map>
@@ -343,7 +341,7 @@ regular_neighbor_coordinates_2(const Rt& rt,
                                OutputIterator out,
                                OutputFunctor fct,
                                std::enable_if_t<
-                                 !boost::is_convertible<OutputFunctor,
+                                 !std::is_convertible<OutputFunctor,
                                                        typename Rt::Face_handle>::value
                                >* = 0)
 {
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h
index 6ea80be2a414..4473d4c55e32 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h
@@ -26,8 +26,6 @@
 #include <CGAL/Weighted_point_2.h>
 #include <CGAL/use.h>
 
-#include <boost/type_traits/is_convertible.hpp>
-
 #include <cassert>
 #include <iostream>
 
@@ -60,9 +58,9 @@ _test_cls_point_2(const R& )
  CGAL::Weighted_point_2<R> wp(p1);
  CGAL::Point_2<R> p7(wp);
 
- CGAL_static_assertion(!(boost::is_convertible<CGAL::Weighted_point_2<R>,
+ CGAL_static_assertion(!(std::is_convertible<CGAL::Weighted_point_2<R>,
                                                CGAL::Point_2<R> >::value));
- CGAL_static_assertion(!(boost::is_convertible<CGAL::Point_2<R>,
+ CGAL_static_assertion(!(std::is_convertible<CGAL::Point_2<R>,
                                                CGAL::Weighted_point_2<R> >::value));
 
  std::cout << '.';
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h
index b09c11e47a70..29471b3c10d0 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h
@@ -58,9 +58,9 @@ _test_cls_point_3(const R& )
  CGAL::Weighted_point_3<R> wp(p1);
  CGAL::Point_3<R> p7(wp);
 
- CGAL_static_assertion(!(boost::is_convertible<CGAL::Weighted_point_3<R>,
+ CGAL_static_assertion(!(std::is_convertible<CGAL::Weighted_point_3<R>,
                                                CGAL::Point_3<R> >::value));
- CGAL_static_assertion(!(boost::is_convertible<CGAL::Point_3<R>,
+ CGAL_static_assertion(!(std::is_convertible<CGAL::Point_3<R>,
                                                CGAL::Weighted_point_3<R> >::value));
 
  std::cout << '.';
diff --git a/Mesh_3/benchmark/Mesh_3/StdAfx.h b/Mesh_3/benchmark/Mesh_3/StdAfx.h
index 4505ee29f7f1..e1b24ae23fa9 100644
--- a/Mesh_3/benchmark/Mesh_3/StdAfx.h
+++ b/Mesh_3/benchmark/Mesh_3/StdAfx.h
@@ -137,7 +137,6 @@
 #include <boost/type_traits.hpp>
 #include <boost/type_traits/add_reference.hpp>
 #include <boost/type_traits/is_base_and_derived.hpp>
-#include <boost/type_traits/is_convertible.hpp>
 #include <boost/type_traits/is_reference.hpp>
 #include <boost/utility.hpp>
 #include <boost/variant.hpp>
diff --git a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
index 8e86644477bc..106b4776edaf 100644
--- a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
+++ b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
@@ -41,7 +41,6 @@
 #include <boost/optional.hpp>
 #include <CGAL/boost/iterator/transform_iterator.hpp>
 #include <boost/iterator/function_output_iterator.hpp>
-#include <boost/type_traits/is_convertible.hpp>
 #include <boost/unordered_set.hpp>
 
 #ifdef CGAL_LINKED_WITH_TBB
@@ -1938,7 +1937,7 @@ class C3T3_helpers
   {
 # ifdef CGAL_LINKED_WITH_TBB
     // Parallel
-    if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+    if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
     {
       tbb::parallel_for_each(
         outdated_cells.begin(), outdated_cells.end(),
@@ -1966,7 +1965,7 @@ class C3T3_helpers
   {
 # ifdef CGAL_LINKED_WITH_TBB
     // Parallel
-    if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+    if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
     {
       tbb::parallel_for
       (
@@ -2704,7 +2703,7 @@ rebuild_restricted_delaunay(OutdatedCells& outdated_cells,
 
 # ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     std::vector<Cell_handle> outdated_cells_vector;
     outdated_cells_vector.reserve(outdated_cells.size());
@@ -2828,7 +2827,7 @@ rebuild_restricted_delaunay(ForwardIterator first_cell,
   // Note: ~58% of rebuild_restricted_delaunay time
 #ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     tbb::parallel_for_each(first_cell, last_cell,
       Update_cell<C3T3, Update_c3t3>(c3t3_, updater));
@@ -2850,7 +2849,7 @@ rebuild_restricted_delaunay(ForwardIterator first_cell,
 
 #ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     tbb::parallel_for_each(
       facets.begin(), facets.end(),
@@ -2962,7 +2961,7 @@ move_point(const Vertex_handle& old_vertex,
 
 # ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     tr_.incident_cells_threadsafe(old_vertex, std::back_inserter(incident_cells_));
   }
@@ -3438,7 +3437,7 @@ get_least_square_surface_plane(const Vertex_handle& v,
   Facet_vector facets;
 # ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     tr_.finite_incident_facets_threadsafe(v, std::back_inserter(facets));
   }
@@ -3861,7 +3860,7 @@ get_conflict_zone_topo_change(const Vertex_handle& v,
 
 # ifdef CGAL_LINKED_WITH_TBB
 // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     tr_.incident_cells_threadsafe(v, removal_conflict_cells);
   }
diff --git a/Mesh_3/include/CGAL/Mesh_3/Mesh_global_optimizer.h b/Mesh_3/include/CGAL/Mesh_3/Mesh_global_optimizer.h
index 7b83d8b05bcf..019cb18589c8 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Mesh_global_optimizer.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Mesh_global_optimizer.h
@@ -44,8 +44,6 @@
 #include <list>
 #include <limits>
 
-#include <boost/type_traits/is_convertible.hpp>
-
 #ifdef CGAL_LINKED_WITH_TBB
 # include <atomic>
 # include <mutex>
@@ -802,7 +800,7 @@ compute_moves(Moving_vertices_set& moving_vertices)
 
 #ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     tbb::concurrent_vector<Vertex_handle> vertices_not_moving_any_more;
 
@@ -888,7 +886,7 @@ compute_move(const Vertex_handle& v)
   incident_cells.reserve(64);
 #ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     tr_.incident_cells_threadsafe(v, std::back_inserter(incident_cells));
   }
@@ -947,7 +945,7 @@ update_mesh(const Moves_vector& moves,
 
 #ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     // Apply moves in triangulation
     tbb::parallel_for(tbb::blocked_range<size_t>(0, moves.size()),
@@ -1040,7 +1038,7 @@ fill_sizing_field()
 
 #ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     typedef tbb::enumerable_thread_specific<
       std::vector< std::pair<Bare_point, FT> > > Local_list;
@@ -1111,7 +1109,7 @@ average_circumradius_length(const Vertex_handle& v) const
   incident_cells.reserve(64);
 #ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     tr_.incident_cells_threadsafe(v, std::back_inserter(incident_cells));
   }
diff --git a/Mesh_3/include/CGAL/Mesh_3/Mesher_3.h b/Mesh_3/include/CGAL/Mesh_3/Mesher_3.h
index 185efe6229cf..94220c276e66 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Mesher_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Mesher_3.h
@@ -63,7 +63,6 @@
 #endif
 
 #include <boost/format.hpp>
-#include <boost/type_traits/is_convertible.hpp>
 #include <string>
 #include <atomic>
 
@@ -653,7 +652,7 @@ initialize()
     defined(CGAL_SEQUENTIAL_MESH_3_ADD_OUTSIDE_POINTS_ON_A_FAR_SPHERE)
 
 #ifndef CGAL_SEQUENTIAL_MESH_3_ADD_OUTSIDE_POINTS_ON_A_FAR_SPHERE
-  if(boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if(std::is_convertible<Concurrency_tag, Parallel_tag>::value)
 #endif // If that macro is defined, then estimated_bbox must be initialized
   {
     Base::set_bbox(r_oracle_.bbox());
@@ -666,7 +665,7 @@ initialize()
 
 #ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     // we're not multi-thread, yet
     r_c3t3_.triangulation().set_lock_data_structure(0);
@@ -861,7 +860,7 @@ Mesher_3<C3T3,MC,MD>::
 status() const
 {
 #ifdef CGAL_LINKED_WITH_TBB
-  if(boost::is_convertible<Concurrency_tag, Parallel_tag>::value) {
+  if(std::is_convertible<Concurrency_tag, Parallel_tag>::value) {
     return Mesher_status(
 #  if CGAL_CONCURRENT_COMPACT_CONTAINER_APPROXIMATE_SIZE
                          approximate_number_of_vertices(Concurrency_tag()),
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
index 4ee48c865ea2..98d4f9572264 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
@@ -38,7 +38,6 @@
 #include <boost/format.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/mpl/if.hpp>
-#include <boost/type_traits/is_convertible.hpp>
 #include <sstream>
 #include <atomic>
 
@@ -175,7 +174,7 @@ template<class Tr,
 #ifdef CGAL_LINKED_WITH_TBB
          class Container_ = typename boost::mpl::if_c // (parallel/sequential?)
          <
-          boost::is_convertible<Concurrency_tag, Parallel_tag>::value,
+          std::is_convertible<Concurrency_tag, Parallel_tag>::value,
 
           // Parallel
 # ifdef CGAL_MESH_3_USE_LAZY_UNSORTED_REFINEMENT_QUEUE
@@ -662,7 +661,7 @@ scan_triangulation_impl()
 
 #ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Ct, Parallel_tag>::value)
+  if (std::is_convertible<Ct, Parallel_tag>::value)
   {
 # if defined(CGAL_MESH_3_VERBOSE) || defined(CGAL_MESH_3_PROFILING)
     std::cerr << "Scanning triangulation for bad cells (in parallel)";
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
index ded63f9b139a..72fc441c2d79 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
@@ -48,7 +48,6 @@
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/mpl/if.hpp>
 #include <CGAL/tuple.h>
-#include <boost/type_traits/is_convertible.hpp>
 #include <sstream>
 #include <atomic>
 
@@ -642,7 +641,7 @@ template<class Tr,
 #ifdef CGAL_LINKED_WITH_TBB
          class Container_ = typename boost::mpl::if_c // (parallel/sequential?)
          <
-          boost::is_convertible<Concurrency_tag, Parallel_tag>::value,
+          std::is_convertible<Concurrency_tag, Parallel_tag>::value,
           // Parallel
 # ifdef CGAL_MESH_3_USE_LAZY_UNSORTED_REFINEMENT_QUEUE
           Meshes::Filtered_deque_container
@@ -983,7 +982,7 @@ scan_triangulation_impl()
 
 #ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Ct, Parallel_tag>::value)
+  if (std::is_convertible<Ct, Parallel_tag>::value)
   {
 # if defined(CGAL_MESH_3_VERBOSE) || defined(CGAL_MESH_3_PROFILING)
     std::cerr << "Scanning triangulation for bad facets (in parallel) - "
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
index 17b04cc4239d..c46dad7a808f 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
@@ -251,7 +251,7 @@ class Refine_facets_manifold_base
   {
 #ifdef CGAL_LINKED_WITH_TBB
     // Sequential only
-    if (!boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+    if (!std::is_convertible<Concurrency_tag, Parallel_tag>::value)
 #endif // CGAL_LINKED_WITH_TBB
     {
     //Sequential
@@ -280,7 +280,7 @@ class Refine_facets_manifold_base
 
 #ifdef CGAL_LINKED_WITH_TBB
     // Sequential only
-    if (!boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+    if (!std::is_convertible<Concurrency_tag, Parallel_tag>::value)
 #endif // CGAL_LINKED_WITH_TBB
     {
     if(m_bad_vertices_initialized) {
@@ -359,7 +359,7 @@ class Refine_facets_manifold_base
       {
 #ifdef CGAL_LINKED_WITH_TBB
         // Parallel
-        if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+        if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
         {
           this->insert_bad_facet(biggest_incident_facet_in_complex(*eit),
                                  typename Base::Quality());
@@ -402,7 +402,7 @@ class Refine_facets_manifold_base
 #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS
 #ifdef CGAL_LINKED_WITH_TBB
         // Parallel
-        if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+        if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
         {
           this->insert_bad_facet(biggest_incident_facet_in_complex(vit),
                                  typename Base::Quality());
@@ -471,7 +471,7 @@ class Refine_facets_manifold_base
   Facet get_next_element_impl() {
 
 #ifdef CGAL_LINKED_WITH_TBB
-    if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+    if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
       return Base::get_next_element_impl();
     else
 #endif
@@ -570,7 +570,7 @@ class Refine_facets_manifold_base
           {
 #ifdef CGAL_LINKED_WITH_TBB
             // Parallel
-            if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+            if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
             {
               this->insert_bad_facet(biggest_incident_facet_in_complex(edge),
                                      typename Base::Quality());
@@ -585,7 +585,7 @@ class Refine_facets_manifold_base
           else {
 #ifdef CGAL_LINKED_WITH_TBB
             // Sequential only
-            if (!boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+            if (!std::is_convertible<Concurrency_tag, Parallel_tag>::value)
 #endif // CGAL_LINKED_WITH_TBB
             {
               m_bad_edges.left.erase( edge_to_edgevv(edge) ); // @TODO: pourquoi?!
@@ -622,7 +622,7 @@ class Refine_facets_manifold_base
 #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS
 #ifdef CGAL_LINKED_WITH_TBB
         // Parallel
-        if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+        if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
         {
           this->insert_bad_facet(biggest_incident_facet_in_complex(*vit),
                                  typename Base::Quality());
@@ -645,7 +645,7 @@ class Refine_facets_manifold_base
 #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS
 #ifdef CGAL_LINKED_WITH_TBB
       // Parallel
-      if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+      if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
       {
         this->insert_bad_facet(biggest_incident_facet_in_complex(v),
                                typename Base::Quality());
diff --git a/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h b/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h
index 87a0416f7b32..9554a14cc0e1 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h
@@ -59,7 +59,6 @@
 #include <boost/format.hpp>
 #include <CGAL/Modifiable_priority_queue.h>
 #include <boost/ptr_container/ptr_vector.hpp>
-#include <boost/type_traits/is_convertible.hpp>
 
 #include <boost/unordered_map.hpp>
 
@@ -928,7 +927,7 @@ perturb(const FT& sliver_bound, PQueue& pqueue, Visitor& visitor) const
 
 #ifdef CGAL_LINKED_WITH_TBB
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     this->create_task_group();
 
diff --git a/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h b/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h
index e8c2c214e48d..3f471ca14a92 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h
@@ -39,7 +39,6 @@
 #include <boost/format.hpp>
 #include <boost/iterator/function_output_iterator.hpp>
 #include <boost/optional.hpp>
-#include <boost/type_traits/is_convertible.hpp>
 
 #include <algorithm>
 #include <iomanip> // std::setprecision
@@ -623,7 +622,7 @@ class Slivers_exuder
   {
 #if defined( CGAL_LINKED_WITH_TBB ) && ( !defined (BOOST_MSVC) || !defined( _DEBUG ) || !defined (CGAL_TEST_SUITE) )
     // Parallel
-    if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+    if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
       enqueue_task<pump_vertices_on_surfaces>(
         ch, this->erase_counter(ch), criterion_value);
     // Sequential
@@ -920,7 +919,7 @@ pump_vertices(FT sliver_criterion_limit,
 
 #if defined( CGAL_LINKED_WITH_TBB ) && ( !defined (BOOST_MSVC) || !defined( _DEBUG ) || !defined (CGAL_TEST_SUITE) )
   // Parallel
-  if (boost::is_convertible<Concurrency_tag, Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
   {
     this->create_task_group();
 
diff --git a/Mesh_3/include/CGAL/Mesh_cell_base_3.h b/Mesh_3/include/CGAL/Mesh_cell_base_3.h
index 787124c3ec75..b52243fbbc2d 100644
--- a/Mesh_3/include/CGAL/Mesh_cell_base_3.h
+++ b/Mesh_3/include/CGAL/Mesh_cell_base_3.h
@@ -30,8 +30,6 @@
 #include <CGAL/SMDS_3/io_signature.h>
 #include <CGAL/tags.h>
 
-#include <boost/type_traits/is_convertible.hpp>
-
 #ifdef CGAL_LINKED_WITH_TBB
 # include <atomic>
 #endif
diff --git a/Mesh_3/include/CGAL/refine_mesh_3.h b/Mesh_3/include/CGAL/refine_mesh_3.h
index 3f11e81ce8a2..b4823d073f48 100644
--- a/Mesh_3/include/CGAL/refine_mesh_3.h
+++ b/Mesh_3/include/CGAL/refine_mesh_3.h
@@ -77,14 +77,14 @@ class Insert_vertex_in_c3t3
 
 #if defined(CGAL_LINKED_WITH_TBB)\
 && !defined(CGAL_PARALLEL_MESH_3_DO_NOT_ADD_OUTSIDE_POINTS_ON_A_FAR_SPHERE)
-    if (boost::is_convertible<typename C3T3::Concurrency_tag, CGAL::Parallel_tag>::value)
+    if (std::is_convertible<typename C3T3::Concurrency_tag, CGAL::Parallel_tag>::value)
     {
       if (dimension == -1)
         r_c3t3_.add_far_point(new_vertex);
     }
 #endif
 #ifdef CGAL_SEQUENTIAL_MESH_3_ADD_OUTSIDE_POINTS_ON_A_FAR_SPHERE
-    if (boost::is_convertible<typename C3T3::Concurrency_tag, CGAL::Sequential_tag>::value)
+    if (std::is_convertible<typename C3T3::Concurrency_tag, CGAL::Sequential_tag>::value)
     {
       if (dimension == -1)
         r_c3t3_.add_far_point(new_vertex);
diff --git a/Mesh_3/test/Mesh_3/test_meshing_implicit_function.cpp b/Mesh_3/test/Mesh_3/test_meshing_implicit_function.cpp
index 58eab9a75008..c9a88cecf460 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_implicit_function.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_implicit_function.cpp
@@ -75,7 +75,7 @@ struct Implicit_tester : public Tester<K>
 
 #ifdef CGAL_LINKED_WITH_TBB
     // Parallel
-    if (boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value)
+    if (std::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value)
     {
       this->verify(c3t3, domain, criteria, Bissection_tag(), 40, 65, 60, 110);
     }
diff --git a/Mesh_3/test/Mesh_3/test_meshing_implicit_function_deprecated.cpp b/Mesh_3/test/Mesh_3/test_meshing_implicit_function_deprecated.cpp
index 6a7a8aa0b57e..7877b7558d5c 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_implicit_function_deprecated.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_implicit_function_deprecated.cpp
@@ -73,7 +73,7 @@ struct Implicit_tester : public Tester<K>
 
 #ifdef CGAL_LINKED_WITH_TBB
     // Parallel
-    if (boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value)
+    if (std::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value)
     {
       this->verify(c3t3, domain, criteria, Bissection_tag(), 40, 65, 60, 110);
     }
diff --git a/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp b/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
index 9a0c5677168f..c5a30ccb1ec7 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
@@ -90,7 +90,7 @@ struct Polyhedron_tester : public Tester<K>
     this->verify_c3t3_volume(c3t3, vol*0.95, vol*1.05);
 #ifdef CGAL_LINKED_WITH_TBB
     // Parallel
-    if (boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value)
+    if (std::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value)
     {
       this->verify(c3t3, domain, criteria, Polyhedral_tag(),
                    110, 140, 190, 235, 300, 450);
diff --git a/Mesh_3/test/Mesh_3/test_meshing_utilities.h b/Mesh_3/test/Mesh_3/test_meshing_utilities.h
index a16c177a9376..cafe2bfcab8d 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_utilities.h
+++ b/Mesh_3/test/Mesh_3/test_meshing_utilities.h
@@ -399,7 +399,7 @@ struct Tester
     // Parallel
     typedef typename C3t3::Concurrency_tag Concurrency_tag;
 
-    if (boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value)
+    if (std::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value)
       assert(hdist <= reference_value*4.);
     else
 #endif //CGAL_LINKED_WITH_TBB
diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_Delaunay_triangulation_2.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_Delaunay_triangulation_2.h
index b737a7a6edcd..1232e426aed9 100644
--- a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_Delaunay_triangulation_2.h
+++ b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_Delaunay_triangulation_2.h
@@ -208,7 +208,7 @@ class Periodic_2_Delaunay_triangulation_2
   insert(InputIterator first, InputIterator last,
          bool is_large_point_set = true,
          std::enable_if_t <
-         boost::is_convertible <
+         std::is_convertible <
          typename std::iterator_traits<InputIterator>::value_type,
          Point
          >::value >* = nullptr)
@@ -420,7 +420,7 @@ class Periodic_2_Delaunay_triangulation_2
           InputIterator last,
           bool is_large_point_set = true,
           std::enable_if_t <
-          boost::is_convertible <
+          std::is_convertible <
           typename std::iterator_traits<InputIterator>::value_type,
           std::pair<Point, typename internal::Info_check<typename Tds::Vertex>::type>
           >::value >* = nullptr
@@ -436,8 +436,8 @@ class Periodic_2_Delaunay_triangulation_2
           bool is_large_point_set = true,
           std::enable_if_t <
           boost::mpl::and_ <
-          boost::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-          boost::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
+          std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
+          std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
           >::value >* = nullptr)
   {
     return insert_with_info< boost::tuple<Point, typename internal::Info_check<typename Tds::Vertex>::type> >(first, last, is_large_point_set);
diff --git a/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h b/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h
index 300a84fdaced..9c2c5885fece 100644
--- a/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h
+++ b/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h
@@ -45,7 +45,6 @@
 #include <CGAL/Timer.h>
 
 #include <memory>
-#include <boost/type_traits/is_convertible.hpp>
 #include <boost/iterator/indirect_iterator.hpp>
 
 /*!
@@ -380,7 +379,7 @@ class Poisson_reconstruction_function
     InputIterator beyond, ///< past-the-end iterator over the input points.
     NormalPMap normal_pmap, ///< property map: `value_type of InputIterator` -> `Vector` (the *oriented* normal of an input point).
     std::enable_if_t<
-      boost::is_convertible<typename std::iterator_traits<InputIterator>::value_type, Point>::value
+      std::is_convertible<typename std::iterator_traits<InputIterator>::value_type, Point>::value
     >* = 0
   )
     : m_tr(new Triangulation), m_bary(new std::vector<Cached_bary_coord>)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
index 4237fa85b6f8..d8a5f68c083b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
@@ -155,10 +155,10 @@ double max_distance_to_mesh_impl(const PointRange& sample_points,
   using FT = typename Kernel::FT;
 
 #if !defined(CGAL_LINKED_WITH_TBB)
-  CGAL_static_assertion_msg (!(boost::is_convertible<Concurrency_tag, Parallel_tag>::value),
+  CGAL_static_assertion_msg (!(std::is_convertible<Concurrency_tag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #else
-  if(boost::is_convertible<Concurrency_tag,Parallel_tag>::value)
+  if(std::is_convertible<Concurrency_tag,Parallel_tag>::value)
   {
     Distance_computation<Kernel, AABBTree, PointRange> f(tree, hint, sample_points);
     tbb::parallel_reduce(tbb::blocked_range<std::size_t>(0, sample_points.size()), f);
@@ -1995,7 +1995,7 @@ bounded_error_squared_one_sided_Hausdorff_distance_impl(const TriangleMesh1& tm1
                                                         OutputIterator& out)
 {
 #if !defined(CGAL_LINKED_WITH_TBB) || !defined(CGAL_METIS_ENABLED)
-  CGAL_static_assertion_msg(!(boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
+  CGAL_static_assertion_msg(!(std::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
                             "Parallel_tag is enabled but at least TBB or METIS is unavailable.");
 #endif
 
@@ -2053,7 +2053,7 @@ bounded_error_squared_one_sided_Hausdorff_distance_impl(const TriangleMesh1& tm1
   std::cout << "* num cores: " << nb_cores << std::endl;
  #endif
 
-  if(boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value &&
+  if(std::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value &&
      nb_cores > 1 &&
      faces(tm1).size() >= min_nb_faces_to_split)
   {
@@ -2207,7 +2207,7 @@ bounded_error_squared_one_sided_Hausdorff_distance_impl(const TriangleMesh1& tm1
 #endif
 
 #if defined(CGAL_LINKED_WITH_TBB) && defined(CGAL_METIS_ENABLED) && defined(USE_PARALLEL_BEHD)
-  if(boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value &&
+  if(std::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value &&
      nb_cores > 1 &&
      faces(tm1).size() >= min_nb_faces_to_split)
   {
@@ -2270,7 +2270,7 @@ bounded_error_squared_symmetric_Hausdorff_distance_impl(const TriangleMesh1& tm1
                                                         OutputIterator2& out2)
 {
 #if !defined(CGAL_LINKED_WITH_TBB) || !defined(CGAL_METIS_ENABLED)
-  CGAL_static_assertion_msg(!(boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
+  CGAL_static_assertion_msg(!(std::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
                             "Parallel_tag is enabled but at least TBB or METIS is unavailable.");
 #endif
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h
index 612620049a0e..1fa539d9bc72 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h
@@ -352,10 +352,10 @@ void orient_triangle_soup_with_reference_triangle_mesh(const TriangleMesh& tm_re
   };
 
 #if !defined(CGAL_LINKED_WITH_TBB)
-  CGAL_static_assertion_msg (!(boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
+  CGAL_static_assertion_msg (!(std::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #else
-  if (boost::is_convertible<Concurrency_tag,CGAL::Parallel_tag>::value)
+  if (std::is_convertible<Concurrency_tag,CGAL::Parallel_tag>::value)
     tbb::parallel_for(std::size_t(0), triangles.size(), std::size_t(1), process_facet);
   else
 #endif
diff --git a/Polyhedron/demo/Polyhedron/include/run_with_qprogressdialog.h b/Polyhedron/demo/Polyhedron/include/run_with_qprogressdialog.h
index f2657fda3f1d..9671bb46277e 100644
--- a/Polyhedron/demo/Polyhedron/include/run_with_qprogressdialog.h
+++ b/Polyhedron/demo/Polyhedron/include/run_with_qprogressdialog.h
@@ -111,7 +111,7 @@ void run_with_qprogressdialog (Functor& functor,
            signal_callback->signaler.get(), SLOT(cancel()));
 
 #ifdef CGAL_HAS_STD_THREADS
-  if (boost::is_convertible<ConcurrencyTag, CGAL::Parallel_tag>::value)
+  if (std::is_convertible<ConcurrencyTag, CGAL::Parallel_tag>::value)
   {
     std::thread thread (functor);
 
diff --git a/STL_Extension/include/CGAL/for_each.h b/STL_Extension/include/CGAL/for_each.h
index f68bba0e80b9..8f05752cbf2f 100644
--- a/STL_Extension/include/CGAL/for_each.h
+++ b/STL_Extension/include/CGAL/for_each.h
@@ -102,7 +102,7 @@ void for_each (const Range& range,
                                         <typename Range::const_iterator>::reference)>& functor)
 {
 #ifndef CGAL_LINKED_WITH_TBB
-  CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+  CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #endif
 
@@ -118,7 +118,7 @@ void for_each (Range& range,
                                         <typename Range::iterator>::reference)>& functor)
 {
 #ifndef CGAL_LINKED_WITH_TBB
-  CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+  CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #endif
 
diff --git a/STL_Extension/include/CGAL/is_convertible.h b/STL_Extension/include/CGAL/is_convertible.h
index 8b9a6a36c93c..1daa86cb63b3 100644
--- a/STL_Extension/include/CGAL/is_convertible.h
+++ b/STL_Extension/include/CGAL/is_convertible.h
@@ -18,7 +18,6 @@
 #define CGAL_IS_CONVERTIBLE_H
 
 #include <boost/type_traits/integral_constant.hpp>
-#include <boost/type_traits/is_convertible.hpp>
 #ifdef CGAL_USE_GMPXX
 #include <gmpxx.h>
 #endif
@@ -26,7 +25,7 @@
 namespace CGAL {
 
 template<class From,class To>struct is_implicit_convertible
-        : boost::is_convertible<From,To> {};
+        : std::is_convertible<From,To> {};
 
 #ifdef CGAL_USE_GMPXX
 // Work around a gmpxx misfeature
diff --git a/STL_Extension/include/CGAL/transforming_iterator.h b/STL_Extension/include/CGAL/transforming_iterator.h
index 3067207e643e..bd94ad33c4fd 100644
--- a/STL_Extension/include/CGAL/transforming_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_iterator.h
@@ -90,8 +90,8 @@ private internal::Functor_as_base<F>
         template<class F2,class I2,class R2,class V2>
         transforming_iterator(
                 transforming_iterator<F2,I2,R2,V2> const&i,
-                std::enable_if_t<boost::is_convertible<I2, Iter>::value>* = 0,
-                std::enable_if_t<boost::is_convertible<F2, F>::value>* = 0)
+                std::enable_if_t<std::is_convertible<I2, Iter>::value>* = 0,
+                std::enable_if_t<std::is_convertible<F2, F>::value>* = 0)
                 : Base(i.base()),Functor_base(i.functor()) {}
 
 };
diff --git a/STL_Extension/include/CGAL/transforming_pair_iterator.h b/STL_Extension/include/CGAL/transforming_pair_iterator.h
index 22e1bc610800..d048850c156c 100644
--- a/STL_Extension/include/CGAL/transforming_pair_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_pair_iterator.h
@@ -16,16 +16,12 @@
 
 #include <CGAL/transforming_iterator.h>
 #include <CGAL/assertions.h>
-#include <boost/type_traits/is_convertible.hpp>
-
-
-
 
 namespace CGAL {
 namespace internal {
-template <class Cat1, class Cat2, bool=boost::is_convertible<Cat1,Cat2>::value>
+template <class Cat1, class Cat2, bool=std::is_convertible<Cat1,Cat2>::value>
 struct Min_category {
-        CGAL_static_assertion((boost::is_convertible<Cat2,Cat1>::value));
+        CGAL_static_assertion((std::is_convertible<Cat2,Cat1>::value));
         typedef Cat1 type;
 };
 
@@ -97,9 +93,9 @@ private internal::Functor_as_base<F>
         template<class F2,class J1,class J2,class R2,class V2>
         transforming_pair_iterator(
                 transforming_pair_iterator<F2,J1,J2,R2,V2> const&i,
-                std::enable_if_t<boost::is_convertible<J1, It1>::value>* = 0,
-                std::enable_if_t<boost::is_convertible<J2, It2>::value>* = 0,
-                std::enable_if_t<boost::is_convertible<F2, F>::value>* = 0)
+                std::enable_if_t<std::is_convertible<J1, It1>::value>* = 0,
+                std::enable_if_t<std::is_convertible<J2, It2>::value>* = 0,
+                std::enable_if_t<std::is_convertible<F2, F>::value>* = 0)
                 : Functor_base(i.functor()),iter1(i.iter1),iter2(i.iter2) {}
 
 };
diff --git a/STL_Extension/include/CGAL/type_traits/is_iterator.h b/STL_Extension/include/CGAL/type_traits/is_iterator.h
index ddc34f9d4dfd..6e1e3c2ea052 100644
--- a/STL_Extension/include/CGAL/type_traits/is_iterator.h
+++ b/STL_Extension/include/CGAL/type_traits/is_iterator.h
@@ -17,7 +17,6 @@
 #ifndef CGAL_TYPE_TRAITS_IS_ITERATOR_H
 #define CGAL_TYPE_TRAITS_IS_ITERATOR_H
 
-#include <boost/type_traits/is_convertible.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/mpl/logical.hpp>
 
@@ -54,7 +53,7 @@ struct is_iterator_type_
 template <class T,class U>
 struct is_iterator_type_<T, U, true>
   : public //boost::is_base_of<U,typename std::iterator_traits<T>::iterator_category>
-           boost::is_convertible<typename std::iterator_traits<T>::iterator_category, U>
+           std::is_convertible<typename std::iterator_traits<T>::iterator_category, U>
 { };
 
 } // namespace internal
@@ -84,7 +83,7 @@ struct is_iterator_to
 
 template <class T, class U>
 struct is_iterator_to<T, U, true>
-  : public boost::is_convertible<typename std::iterator_traits<T>::value_type, U>
+  : public std::is_convertible<typename std::iterator_traits<T>::value_type, U>
 { };
 
 template <class T, class U>
diff --git a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
index bc4ba9ec616a..cecf6f62d44d 100644
--- a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
+++ b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
@@ -198,10 +198,10 @@ class Weighted_PCA_smoother
   void try_parallel (const F& func, std::size_t begin, std::size_t end)
   {
 #ifndef CGAL_LINKED_WITH_TBB
-    CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+    CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                "Parallel_tag is enabled but TBB is unavailable.");
 #else
-    if (boost::is_convertible<ConcurrencyTag,Parallel_tag>::value)
+    if (std::is_convertible<ConcurrencyTag,Parallel_tag>::value)
       tbb::parallel_for(tbb::blocked_range<std::size_t>(begin, end), func);
     else
 #endif
diff --git a/Spatial_searching/include/CGAL/Kd_tree.h b/Spatial_searching/include/CGAL/Kd_tree.h
index b0958bc44ee4..c3e107bc31fa 100644
--- a/Spatial_searching/include/CGAL/Kd_tree.h
+++ b/Spatial_searching/include/CGAL/Kd_tree.h
@@ -335,7 +335,7 @@ class Kd_tree {
     }
 
 #ifndef CGAL_TBB_STRUCTURE_IN_KD_TREE
-    CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+    CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                "Parallel_tag is enabled but TBB is unavailable.");
 #endif
 
diff --git a/Spatial_sorting/include/CGAL/Hilbert_sort_median_2.h b/Spatial_sorting/include/CGAL/Hilbert_sort_median_2.h
index 722ccc3acbce..aaff07b8693c 100644
--- a/Spatial_sorting/include/CGAL/Hilbert_sort_median_2.h
+++ b/Spatial_sorting/include/CGAL/Hilbert_sort_median_2.h
@@ -17,8 +17,6 @@
 #include <CGAL/tags.h>
 #include <CGAL/Hilbert_sort_base.h>
 
-#include <boost/type_traits/is_convertible.hpp>
-
 #ifdef CGAL_LINKED_WITH_TBB
 #include <tbb/parallel_invoke.h>
 #endif
@@ -157,7 +155,7 @@ class Hilbert_sort_median_2
 #ifndef CGAL_LINKED_WITH_TBB
     CGAL_USE(begin);
     CGAL_USE(end);
-    CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+    CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                "Parallel_tag is enabled but TBB is unavailable.");
 #else
     const int y = (x + 1) % 2;
diff --git a/Spatial_sorting/include/CGAL/Hilbert_sort_median_3.h b/Spatial_sorting/include/CGAL/Hilbert_sort_median_3.h
index ebf71afed5a1..d318d436921a 100644
--- a/Spatial_sorting/include/CGAL/Hilbert_sort_median_3.h
+++ b/Spatial_sorting/include/CGAL/Hilbert_sort_median_3.h
@@ -18,8 +18,6 @@
 #include <cstddef>
 #include <CGAL/Hilbert_sort_base.h>
 
-#include <boost/type_traits/is_convertible.hpp>
-
 #ifdef CGAL_LINKED_WITH_TBB
 #include <tbb/parallel_invoke.h>
 #endif
@@ -180,7 +178,7 @@ class CGAL_VISIBILITY_MACRO Hilbert_sort_median_3
 #ifndef CGAL_LINKED_WITH_TBB
     CGAL_USE(begin);
     CGAL_USE(end);
-    CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+    CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                "Parallel_tag is enabled but TBB is unavailable.");
 #else
     const int y = (x + 1) % 3, z = (x + 2) % 3;
diff --git a/Stream_support/include/CGAL/IO/helpers.h b/Stream_support/include/CGAL/IO/helpers.h
index 36cd5e2a89ce..39828dcabe21 100644
--- a/Stream_support/include/CGAL/IO/helpers.h
+++ b/Stream_support/include/CGAL/IO/helpers.h
@@ -80,7 +80,7 @@ struct is_Range
   : public boost::mpl::and_<
              boost::has_range_const_iterator<T>, // should be a range
              boost::mpl::not_<is_Point_set_3<T> >, // but not a Point_set_3
-             boost::mpl::not_<boost::is_convertible<T, std::string> > > // or a std::string / char [x]
+             boost::mpl::not_<std::is_convertible<T, std::string> > > // or a std::string / char [x]
 { };
 
 template <class T>
diff --git a/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
index 3c5ee85b9232..a96be0e6d76d 100644
--- a/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
@@ -316,7 +316,7 @@ class Constrained_Delaunay_triangulation_2
   std::ptrdiff_t
   insert( InputIterator first, InputIterator last,
           std::enable_if_t<
-            boost::is_convertible<
+            std::is_convertible<
                 typename internal::Get_iterator_value_type< InputIterator >::type,
                 Point
             >::value
@@ -398,7 +398,7 @@ class Constrained_Delaunay_triangulation_2
   insert( InputIterator first,
           InputIterator last,
           std::enable_if_t<
-            boost::is_convertible<
+            std::is_convertible<
               typename internal::Get_iterator_value_type< InputIterator >::type,
               std::pair<Point,typename internal::Info_check<typename Tds::Vertex>::type>
             >::value
@@ -414,8 +414,8 @@ class Constrained_Delaunay_triangulation_2
           boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
           std::enable_if_t<
             boost::mpl::and_<
-              boost::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-              boost::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
+              std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
+              std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
             >::value
           >* =nullptr
   )
diff --git a/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
index fa001fd490ef..34a282b91626 100644
--- a/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
@@ -301,7 +301,7 @@ class Delaunay_triangulation_2
   std::ptrdiff_t
   insert(InputIterator first, InputIterator last,
          std::enable_if_t<
-           boost::is_convertible<
+           std::is_convertible<
              typename std::iterator_traits<InputIterator>::value_type,
              Point
            >::value
@@ -372,7 +372,7 @@ class Delaunay_triangulation_2
   insert(InputIterator first,
          InputIterator last,
          std::enable_if_t<
-           boost::is_convertible<
+           std::is_convertible<
              typename std::iterator_traits<InputIterator>::value_type,
              std::pair<Point,typename internal::Info_check<typename Tds::Vertex>::type>
            >::value >* = nullptr)
@@ -386,8 +386,8 @@ class Delaunay_triangulation_2
          boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
          std::enable_if_t<
            boost::mpl::and_<
-             boost::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-             boost::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
+             std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
+             std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
            >::value
          >* = nullptr)
   {
diff --git a/Triangulation_2/include/CGAL/Regular_triangulation_2.h b/Triangulation_2/include/CGAL/Regular_triangulation_2.h
index 145b387263fe..f7e4a653060b 100644
--- a/Triangulation_2/include/CGAL/Regular_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Regular_triangulation_2.h
@@ -395,7 +395,7 @@ class Regular_triangulation_2
   std::ptrdiff_t
   insert(InputIterator first, InputIterator last,
           std::enable_if_t<
-              boost::is_convertible<
+              std::is_convertible<
                   typename std::iterator_traits<InputIterator>::value_type,
                   Weighted_point
               >::value
@@ -516,7 +516,7 @@ class Regular_triangulation_2
   insert(InputIterator first,
           InputIterator last,
           std::enable_if_t<
-              boost::is_convertible<
+              std::is_convertible<
                 typename std::iterator_traits<InputIterator>::value_type,
                 std::pair<Weighted_point,typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type>
               >::value
@@ -530,8 +530,8 @@ class Regular_triangulation_2
           boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
           std::enable_if_t<
             boost::mpl::and_<
-              typename boost::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point >,
-              typename boost::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
+              typename std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point >,
+              typename std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
             >::value
           >* =nullptr
 )
diff --git a/Triangulation_2/include/CGAL/Triangulation_2.h b/Triangulation_2/include/CGAL/Triangulation_2.h
index 6b1de4b4f19d..c79aa0128d2b 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2.h
@@ -632,7 +632,7 @@ class Triangulation_2
 template < class InputIterator >
 std::ptrdiff_t insert(InputIterator first, InputIterator last,
          std::enable_if_t<
-           boost::is_convertible<
+           std::is_convertible<
              typename std::iterator_traits<InputIterator>::value_type,
              Point
            >::value
@@ -697,7 +697,7 @@ std::ptrdiff_t insert(InputIterator first, InputIterator last,
   insert(InputIterator first,
          InputIterator last,
          std::enable_if_t<
-           boost::is_convertible<
+           std::is_convertible<
              typename std::iterator_traits<InputIterator>::value_type,
              std::pair<Point,typename internal::Info_check<typename Tds::Vertex>::type>
            >::value >* = NULL)
@@ -711,8 +711,8 @@ std::ptrdiff_t insert(InputIterator first, InputIterator last,
          boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
          std::enable_if_t<
            boost::mpl::and_<
-             boost::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-             boost::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
+             std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
+             std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
            >::value
          >* = NULL)
   {
diff --git a/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h b/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h
index 0099a3044301..8b22fddd3493 100644
--- a/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h
@@ -334,7 +334,7 @@ class Delaunay_triangulation_3<Gt, Tds_, Default, Lock_data_structure_>
   template < class InputIterator >
   std::ptrdiff_t insert(InputIterator first, InputIterator last,
                         std::enable_if_t<
-                          boost::is_convertible<
+                          std::is_convertible<
                               typename std::iterator_traits<InputIterator>::value_type,
                               Point
                           >::value
@@ -480,7 +480,7 @@ class Delaunay_triangulation_3<Gt, Tds_, Default, Lock_data_structure_>
   template < class InputIterator >
   std::ptrdiff_t insert(InputIterator first, InputIterator last,
                         std::enable_if_t<
-                          boost::is_convertible<
+                          std::is_convertible<
                             typename std::iterator_traits<InputIterator>::value_type,
                             std::pair<Point, typename internal::Info_check<
                                                typename Triangulation_data_structure::Vertex>::type>
@@ -495,8 +495,8 @@ class Delaunay_triangulation_3<Gt, Tds_, Default, Lock_data_structure_>
           boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
           std::enable_if_t<
             boost::mpl::and_<
-              boost::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-              boost::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
+              std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
+              std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
             >::value
           >* =nullptr)
   {
diff --git a/Triangulation_3/include/CGAL/Regular_triangulation_3.h b/Triangulation_3/include/CGAL/Regular_triangulation_3.h
index 482cb41c1764..18e448bda7a4 100644
--- a/Triangulation_3/include/CGAL/Regular_triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Regular_triangulation_3.h
@@ -337,7 +337,7 @@ class Regular_triangulation_3
   template < class InputIterator >
   std::ptrdiff_t insert(InputIterator first, InputIterator last,
                         std::enable_if_t<
-                          boost::is_convertible<
+                          std::is_convertible<
                           typename std::iterator_traits<InputIterator>::value_type,
                           Weighted_point>::value >* = nullptr)
 #else
@@ -576,7 +576,7 @@ class Regular_triangulation_3
   std::ptrdiff_t insert(InputIterator first,
                         InputIterator last,
                         std::enable_if_t<
-                        boost::is_convertible<
+                        std::is_convertible<
                         typename std::iterator_traits<InputIterator>::value_type,
                         std::pair<Weighted_point,typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type>
                         >::value
@@ -595,8 +595,8 @@ class Regular_triangulation_3
          boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
          std::enable_if_t<
            boost::mpl::and_<
-           typename boost::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point >,
-           typename boost::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
+           typename std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point >,
+           typename std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
          >::value >* =nullptr)
   {
     return insert_with_info<
diff --git a/Triangulation_3/include/CGAL/Triangulation_3.h b/Triangulation_3/include/CGAL/Triangulation_3.h
index cbad6e031830..7b8ef9ab6c8a 100644
--- a/Triangulation_3/include/CGAL/Triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_3.h
@@ -1146,7 +1146,7 @@ class Triangulation_3
   template < class InputIterator >
   std::ptrdiff_t insert(InputIterator first, InputIterator last,
                         std::enable_if_t<
-                          boost::is_convertible<
+                          std::is_convertible<
                               typename std::iterator_traits<InputIterator>::value_type,
                               Point
                           >::value
@@ -1209,7 +1209,7 @@ class Triangulation_3
   template < class InputIterator >
   std::ptrdiff_t insert(InputIterator first, InputIterator last,
                         std::enable_if_t<
-                          boost::is_convertible<
+                          std::is_convertible<
                             typename std::iterator_traits<InputIterator>::value_type,
                             std::pair<Point, typename internal::Info_check<
                                                typename Triangulation_data_structure::Vertex>::type>
@@ -1224,8 +1224,8 @@ class Triangulation_3
           boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
           std::enable_if_t<
             boost::mpl::and_<
-              boost::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-              boost::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
+              std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
+              std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
             >::value
           >* =NULL)
   {
diff --git a/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h b/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h
index 8553a34a1b3a..021e40e2ffef 100644
--- a/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h
@@ -180,7 +180,7 @@ class Triangulation_hierarchy_3
   std::ptrdiff_t
   insert( InputIterator first, InputIterator last,
           std::enable_if_t<
-            boost::is_convertible<
+            std::is_convertible<
                 typename std::iterator_traits<InputIterator>::value_type,
                 Point
             >::value
@@ -317,7 +317,7 @@ class Triangulation_hierarchy_3
   insert( InputIterator first,
           InputIterator last,
           std::enable_if_t<
-            boost::is_convertible<
+            std::is_convertible<
               typename std::iterator_traits<InputIterator>::value_type,
               std::pair<Point,typename internal::Info_check<Vertex>::type>
             >::value >* =nullptr
@@ -332,8 +332,8 @@ class Triangulation_hierarchy_3
           boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
           std::enable_if_t<
             boost::mpl::and_<
-              boost::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-              boost::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<Vertex>::type >
+              std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
+              std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<Vertex>::type >
             >::value
           >* =nullptr
   )

From cf45dd3d5bfa1ca4a85c32aee2c2fc1e3f64e840 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 22:03:59 +0200
Subject: [PATCH 0242/1398] boost::is_base_of -> std::is_base_of

---
 .../include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h |  3 +--
 .../include/CGAL/Hyperbolic_Delaunay_triangulation_2.h |  2 +-
 Mesh_3/include/CGAL/Mesh_criteria_3.h                  |  6 +++---
 STL_Extension/include/CGAL/type_traits/is_iterator.h   |  2 +-
 .../test/STL_Extension/test_Compact_container.cpp      | 10 ++++------
 5 files changed, 10 insertions(+), 13 deletions(-)

diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
index b8bd5995a6f9..757a71e20750 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
@@ -23,7 +23,6 @@
 #include <type_traits>
 
 #include <boost/mpl/has_xxx.hpp>
-#include <boost/type_traits/is_base_of.hpp>
 #include <boost/mpl/and.hpp>
 #include <boost/mpl/logical.hpp>
 
@@ -73,7 +72,7 @@ template<typename Comparable>
   struct Is_derived_from_Handle_with_policy<Comparable,true> {
 
     typedef typename
-      boost::is_base_of< CGAL::Handle_with_policy
+      std::is_base_of< CGAL::Handle_with_policy
                              < typename Comparable::T,
                                typename Comparable::Handle_policy,
                                typename Comparable::Allocator >,
diff --git a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_2.h b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_2.h
index 2629ec1aff78..538991692ba3 100644
--- a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_2.h
+++ b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_2.h
@@ -431,7 +431,7 @@ class Hyperbolic_Delaunay_triangulation_2
   template < class InputIterator >
   std::ptrdiff_t insert(InputIterator first, InputIterator last,
                         std::enable_if_t<
-                          boost::is_base_of<Point, typename std::iterator_traits<InputIterator>::value_type>::value
+                          std::is_base_of<Point, typename std::iterator_traits<InputIterator>::value_type>::value
                         >* = nullptr)
 #else
   template < class InputIterator >
diff --git a/Mesh_3/include/CGAL/Mesh_criteria_3.h b/Mesh_3/include/CGAL/Mesh_criteria_3.h
index c7dcfeb33ab6..458ab35ee872 100644
--- a/Mesh_3/include/CGAL/Mesh_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_criteria_3.h
@@ -28,7 +28,7 @@
 #include <CGAL/Mesh_facet_criteria_3.h>
 #include <CGAL/Mesh_cell_criteria_3.h>
 #include <cfloat> // for the macro DBL_MAX
-#include <boost/type_traits/is_base_of.hpp>
+
 namespace CGAL {
 
 
@@ -98,7 +98,7 @@ class Mesh_criteria_3_impl
 
   template <typename Facet_criterion>
   void add_facet_criterion(Facet_criterion* criterion) {
-    CGAL_static_assertion((boost::is_base_of<
+    CGAL_static_assertion((std::is_base_of<
                            typename Facet_criteria::Abstract_criterion,
                            Facet_criterion
                            >::value));
@@ -107,7 +107,7 @@ class Mesh_criteria_3_impl
 
   template <typename Cell_criterion>
   void add_cell_criterion(Cell_criterion* criterion) {
-    CGAL_static_assertion((boost::is_base_of<
+    CGAL_static_assertion((std::is_base_of<
                            typename Cell_criteria::Abstract_criterion,
                            Cell_criterion
                            >::value));
diff --git a/STL_Extension/include/CGAL/type_traits/is_iterator.h b/STL_Extension/include/CGAL/type_traits/is_iterator.h
index 6e1e3c2ea052..e48f3ef8bf1f 100644
--- a/STL_Extension/include/CGAL/type_traits/is_iterator.h
+++ b/STL_Extension/include/CGAL/type_traits/is_iterator.h
@@ -52,7 +52,7 @@ struct is_iterator_type_
 
 template <class T,class U>
 struct is_iterator_type_<T, U, true>
-  : public //boost::is_base_of<U,typename std::iterator_traits<T>::iterator_category>
+  : public //std::is_base_of<U,typename std::iterator_traits<T>::iterator_category>
            std::is_convertible<typename std::iterator_traits<T>::iterator_category, U>
 { };
 
diff --git a/STL_Extension/test/STL_Extension/test_Compact_container.cpp b/STL_Extension/test/STL_Extension/test_Compact_container.cpp
index d2d96cdfc4b3..360073381126 100644
--- a/STL_Extension/test/STL_Extension/test_Compact_container.cpp
+++ b/STL_Extension/test/STL_Extension/test_Compact_container.cpp
@@ -12,8 +12,6 @@
 #include <CGAL/use.h>
 #include <CGAL/assertions.h>
 
-#include <boost/type_traits/is_base_of.hpp>
-
 #include <CGAL/disable_warnings.h>
 
 template <typename Has_timestamp_ = CGAL::Tag_true>
@@ -324,22 +322,22 @@ int main()
   test_time_stamps<C4>();
 
   // Check the time stamper policies
-  if(! boost::is_base_of<CGAL::Time_stamper<T1>,
+  if(! std::is_base_of<CGAL::Time_stamper<T1>,
      C1::Time_stamper>::value)
   {
     std::cerr << "Error timestamper of C1\n"; return 1;
   }
-  if(! boost::is_base_of<CGAL::No_time_stamp<T2>,
+  if(! std::is_base_of<CGAL::No_time_stamp<T2>,
      C2::Time_stamper>::value)
   {
     std::cerr << "Error timestamper of C2\n"; return 1;
   }
-  if(! boost::is_base_of<CGAL::No_time_stamp<T3>,
+  if(! std::is_base_of<CGAL::No_time_stamp<T3>,
      C3::Time_stamper>::value)
   {
     std::cerr << "Error timestamper of C3\n"; return 1;
   }
-  if(! boost::is_base_of<CGAL::Time_stamper<T2>,
+  if(! std::is_base_of<CGAL::Time_stamper<T2>,
      C4::Time_stamper>::value)
   {
     std::cerr << "Error timestamper of C4\n"; return 1;

From 633ec7329c3beb5cdf32e16fc03146540f31cc88 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 22:09:06 +0200
Subject: [PATCH 0243/1398] fonctor -> functor

---
 Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt | 2 +-
 Generalized_map/doc/Generalized_map/Generalized_map.txt       | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
index 2e36037ea231..a8f20cf4d062 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
@@ -498,7 +498,7 @@ Step 2 defines the onsplit and onmerge dynamic functors. We can see here that wi
 
 The next operations will call these functors when 2-cells are split or merged. The \link CombinatorialMap::sew `sew<3>`\endlink operation calls 1 onmerge as two faces are identified; the \link GenericMap::insert_cell_0_in_cell_2 `insert_cell_0_in_cell_2`\endlink operation calls 3 onsplit as one face is split in 4.
 
-Lastly we remove the dynamic onmerge functor (step 7). This is done by initializing the fonctor to a default boost::function. After this initialization, no dynamic merge functor is called when two faces are merged.
+Lastly we remove the dynamic onmerge functor (step 7). This is done by initializing the functor to a default boost::function. After this initialization, no dynamic merge functor is called when two faces are merged.
 
 \cgalExample{Combinatorial_map/map_3_dynamic_onmerge.cpp}
 
diff --git a/Generalized_map/doc/Generalized_map/Generalized_map.txt b/Generalized_map/doc/Generalized_map/Generalized_map.txt
index 491a8c9ed3d3..9ea562fd56f1 100644
--- a/Generalized_map/doc/Generalized_map/Generalized_map.txt
+++ b/Generalized_map/doc/Generalized_map/Generalized_map.txt
@@ -520,7 +520,7 @@ Step 2 defines the onsplit and onmerge dynamic functors. We can see here that wi
 
 The next operations will call these functors when 2-cells are split or merged. The \link GeneralizedMap::sew `sew<3>`\endlink operation calls 1 onmerge as two faces are identified; the \link GenericMap::insert_cell_0_in_cell_2 `insert_cell_0_in_cell_2`\endlink operation calls 3 onsplit as one face is split in 4.
 
-Lastly we remove the dynamic onmerge functor (step 7). This is done by initializing the fonctor to a default boost::function. After this initialization, no dynamic merge functor is called when two faces are merged.
+Lastly we remove the dynamic onmerge functor (step 7). This is done by initializing the functor to a default boost::function. After this initialization, no dynamic merge functor is called when two faces are merged.
 
 \cgalExample{Generalized_map/gmap_3_dynamic_onmerge.cpp}
 

From ea62c316aeae88a2e142dab2ed405cc875b3b28e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 22:35:45 +0200
Subject: [PATCH 0244/1398] boost::lambda -> c++11 lambda

---
 AABB_tree/include/CGAL/AABB_tree.h                   | 5 ++---
 Mesh_2/include/CGAL/Mesh_2/Mesh_global_optimizer_2.h | 6 +-----
 2 files changed, 3 insertions(+), 8 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_tree.h b/AABB_tree/include/CGAL/AABB_tree.h
index 0016d4ecc097..3f49779b6acf 100644
--- a/AABB_tree/include/CGAL/AABB_tree.h
+++ b/AABB_tree/include/CGAL/AABB_tree.h
@@ -27,7 +27,6 @@
 #include <CGAL/AABB_tree/internal/Has_nested_type_Shared_data.h>
 #include <CGAL/AABB_tree/internal/Primitive_helper.h>
 #include <boost/optional.hpp>
-#include <boost/lambda/lambda.hpp>
 
 #ifdef CGAL_HAS_THREADS
 #include <CGAL/mutex.h>
@@ -326,7 +325,7 @@ namespace CGAL {
     boost::optional< typename Intersection_and_primitive_id<Ray>::Type >
     first_intersection(const Ray& query) const
     {
-      return first_intersection(query, boost::lambda::constant(false));
+      return first_intersection(query, [](Primitive_id){ return false; });
     }
     /// \endcond
 
@@ -351,7 +350,7 @@ namespace CGAL {
     boost::optional<Primitive_id>
     first_intersected_primitive(const Ray& query) const
     {
-      return first_intersected_primitive(query, boost::lambda::constant(false));
+      return first_intersected_primitive(query, [](Primitive_id){ return false; });
     }
     /// \endcond
     ///@}
diff --git a/Mesh_2/include/CGAL/Mesh_2/Mesh_global_optimizer_2.h b/Mesh_2/include/CGAL/Mesh_2/Mesh_global_optimizer_2.h
index 4c6dacd7802f..6c380f054f2d 100644
--- a/Mesh_2/include/CGAL/Mesh_2/Mesh_global_optimizer_2.h
+++ b/Mesh_2/include/CGAL/Mesh_2/Mesh_global_optimizer_2.h
@@ -33,8 +33,6 @@
 #include <algorithm>
 #include <iterator>
 
-#include <boost/lambda/lambda.hpp>
-#include <boost/lambda/bind.hpp>
 #include <boost/format.hpp>
 #include <boost/math/constants/constants.hpp>
 
@@ -329,7 +327,7 @@ class Mesh_global_optimizer_2
       typename FT_list::iterator pos = std::find_if(
         big_moves_.begin(),
         big_moves_.end(),
-        boost::lambda::_1 < new_sq_move );
+        [&](const FT& v) { return v< new_sq_move; } );
 
       big_moves_.insert(pos, new_sq_move);
     }
@@ -343,8 +341,6 @@ class Mesh_global_optimizer_2
 
   bool check_convergence() const
   {
-    namespace bl = boost::lambda;
-
     FT sum(0);
     for(typename FT_list::const_iterator it = big_moves_.begin();
         it != big_moves_.end();

From 2f7d15053108b54884fbc7f9a4c7d06d368ae2ac Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 22:44:33 +0200
Subject: [PATCH 0245/1398] boost::begin/end/empty/size ->
 std::begin/end/empty/size

---
 .../CGAL/boost/graph/Face_filtered_graph.h    |  4 +--
 BGL/include/CGAL/boost/graph/helpers.h        | 20 +++++------
 BGL/test/BGL/test_Euler_operations.cpp        |  4 +--
 BGL/test/BGL/test_Properties.cpp              |  6 ++--
 Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h     | 10 +++---
 .../CGAL/Mesh_3/polylines_to_protect.h        |  2 +-
 .../CGAL/Polygon_mesh_processing/clip.h       |  4 +--
 .../CGAL/Polygon_mesh_processing/distance.h   |  4 +--
 .../Hole_filling/Triangulate_hole_polyline.h  |  4 +--
 .../Isotropic_remeshing/remesh_impl.h         |  8 ++---
 .../internal/fair_impl.h                      |  4 +--
 .../internal/refine_impl.h                    |  4 +--
 .../Polygon_mesh_processing/intersection.h    | 36 +++++++++----------
 .../merge_border_vertices.h                   |  2 +-
 .../polygon_soup_to_polygon_mesh.h            |  7 ++--
 .../CGAL/Polygon_mesh_processing/remesh.h     |  2 +-
 .../Rigid_triangle_mesh_collision_detection.h |  4 +--
 .../test_pmp_collision_detection.cpp          |  2 +-
 .../Surface_mesh/Offset_meshing_plugin.cpp    |  4 +--
 .../demo/Polyhedron/Scene_c3t3_item.cpp       |  2 +-
 .../examples/Surface_mesh/sm_iterators.cpp    |  4 +--
 .../test/Surface_mesh/sm_circulator_test.cpp  |  8 ++---
 22 files changed, 71 insertions(+), 74 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
index e1e9f6f0a6ff..e6f4136481d9 100644
--- a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
+++ b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
@@ -486,8 +486,8 @@ struct Face_filtered_graph
     selected_halfedges.reset();
 
     typedef typename boost::property_traits<FacePatchIndexMap>::value_type Patch_index;
-    std::unordered_set<Patch_index> pids(boost::begin(selected_face_patch_indices),
-                                         boost::end(selected_face_patch_indices));
+    std::unordered_set<Patch_index> pids(std::begin(selected_face_patch_indices),
+                                         std::end(selected_face_patch_indices));
 
     for(face_descriptor fd : faces(_graph) )
     {
diff --git a/BGL/include/CGAL/boost/graph/helpers.h b/BGL/include/CGAL/boost/graph/helpers.h
index 21644ebf18f4..fb585f04acc0 100644
--- a/BGL/include/CGAL/boost/graph/helpers.h
+++ b/BGL/include/CGAL/boost/graph/helpers.h
@@ -848,12 +848,12 @@ inline
 std::enable_if_t<!Has_member_clear<FaceGraph>::value, void>
 clear_impl(FaceGraph& g)
 {
-  while(boost::begin(edges(g))!=boost::end(edges(g)))
-    remove_edge(*boost::begin(edges(g)), g);
-  while(boost::begin(faces(g))!=boost::end(faces(g)))
-    remove_face(*boost::begin(faces(g)), g);
-  while(boost::begin(vertices(g))!=boost::end(vertices(g)))
-    remove_vertex(*boost::begin(vertices(g)), g);
+  while(std::begin(edges(g))!=std::end(edges(g)))
+    remove_edge(*std::begin(edges(g)), g);
+  while(std::begin(faces(g))!=std::end(faces(g)))
+    remove_face(*std::begin(faces(g)), g);
+  while(std::begin(vertices(g))!=std::end(vertices(g)))
+    remove_vertex(*std::begin(vertices(g)), g);
 }
 
 template <class FaceGraph>
@@ -975,9 +975,9 @@ template<typename FaceGraph>
 void clear(FaceGraph& g)
 {
   internal::clear_impl(g);
-  CGAL_postcondition(std::distance(boost::begin(edges(g)),boost::end(edges(g))) == 0);
-  CGAL_postcondition(std::distance(boost::begin(vertices(g)),boost::end(vertices(g))) == 0);
-  CGAL_postcondition(std::distance(boost::begin(faces(g)),boost::end(faces(g))) == 0);
+  CGAL_postcondition(std::distance(std::begin(edges(g)),std::end(edges(g))) == 0);
+  CGAL_postcondition(std::distance(std::begin(vertices(g)),std::end(vertices(g))) == 0);
+  CGAL_postcondition(std::distance(std::begin(faces(g)),std::end(faces(g))) == 0);
 }
 
 /**
@@ -993,7 +993,7 @@ void clear(FaceGraph& g)
 template<typename FaceGraph>
 bool is_empty(const FaceGraph& g)
 {
-  return boost::empty(vertices(g));
+  return std::empty(vertices(g));
 }
 
 /// \ingroup PkgBGLHelperFct
diff --git a/BGL/test/BGL/test_Euler_operations.cpp b/BGL/test/BGL/test_Euler_operations.cpp
index 36ac20e3f35d..a72d33306476 100644
--- a/BGL/test/BGL/test_Euler_operations.cpp
+++ b/BGL/test/BGL/test_Euler_operations.cpp
@@ -476,8 +476,8 @@ test_swap_edges()
     {
       Graph g;
       CGAL::make_tetrahedron(pt,pt,pt,pt,g);
-      halfedge_descriptor h1 = *std::next(boost::begin(halfedges(g)), i);
-      halfedge_descriptor h2 = *std::next(boost::begin(halfedges(g)), j);
+      halfedge_descriptor h1 = *std::next(std::begin(halfedges(g)), i);
+      halfedge_descriptor h2 = *std::next(std::begin(halfedges(g)), j);
       CGAL::internal::swap_edges(h1, h2, g);
       assert(CGAL::is_valid_polygon_mesh(g));
     }
diff --git a/BGL/test/BGL/test_Properties.cpp b/BGL/test/BGL/test_Properties.cpp
index ca63a2f78032..d932eb36d267 100644
--- a/BGL/test/BGL/test_Properties.cpp
+++ b/BGL/test/BGL/test_Properties.cpp
@@ -68,9 +68,9 @@ void test_uniqueness(const Graph&,
 #endif
 
   typename boost::range_iterator<ForwardRange>::type
-    begin = boost::begin(range),
-    begin2 = boost::begin(range),
-    end = boost::end(range);
+    begin = std::begin(range),
+    begin2 = std::begin(range),
+    end = std::end(range);
 
   typedef std::unordered_set<typename IndexPropertyMap::value_type> id_map;
   typedef std::pair<typename id_map::iterator, bool> resultp;
diff --git a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
index 106b4776edaf..7298969e1149 100644
--- a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
+++ b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
@@ -36,8 +36,6 @@
   #include <CGAL/Mesh_3/Profiling_tools.h>
 #endif
 
-#include <boost/range/begin.hpp>
-#include <boost/range/end.hpp>
 #include <boost/optional.hpp>
 #include <CGAL/boost/iterator/transform_iterator.hpp>
 #include <boost/iterator/function_output_iterator.hpp>
@@ -2135,8 +2133,8 @@ class C3T3_helpers
   template <typename CellRange>
   void reset_sliver_cache(CellRange& cell_range) const
   {
-    reset_sliver_cache(boost::begin(cell_range),
-                       boost::end(cell_range));
+    reset_sliver_cache(std::begin(cell_range),
+                       std::end(cell_range));
   }
 
   template <typename CellForwardIterator>
@@ -2152,8 +2150,8 @@ class C3T3_helpers
   template <typename CellRange>
   void reset_circumcenter_cache(CellRange& cell_range) const
   {
-    reset_circumcenter_cache(boost::begin(cell_range),
-                             boost::end(cell_range));
+    reset_circumcenter_cache(std::begin(cell_range),
+                             std::end(cell_range));
   }
 
   template <typename CellForwardIterator>
diff --git a/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h b/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
index 756bf520604d..7979860f68f2 100644
--- a/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
+++ b/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
@@ -1177,7 +1177,7 @@ merge_and_snap_polylines(const CGAL::Image_3& image,
   // snap graph to existing_polylines
   snap_graph_vertices(graph,
     image.vx(), image.vy(), image.vz(),
-    boost::begin(existing_polylines), boost::end(existing_polylines),
+    std::begin(existing_polylines), std::end(existing_polylines),
     K());
 
   // rebuild polylines_to_snap
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h
index ee92e8e36405..d40ae7396915 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h
@@ -721,7 +721,7 @@ bool clip(TriangleMesh& tm,
   using params::get_parameter;
   using params::choose_parameter;
 
-  if(boost::begin(faces(tm))==boost::end(faces(tm))) return true;
+  if(std::begin(faces(tm))==std::end(faces(tm))) return true;
 
   CGAL::Bbox_3 bbox = ::CGAL::Polygon_mesh_processing::bbox(tm);
 
@@ -831,7 +831,7 @@ bool clip(TriangleMesh& tm,
   using params::get_parameter;
   using params::choose_parameter;
 
-  if(boost::begin(faces(tm))==boost::end(faces(tm))) return true;
+  if(std::begin(faces(tm))==std::end(faces(tm))) return true;
   TriangleMesh clipper;
 
   make_hexahedron(iso_cuboid[0], iso_cuboid[1], iso_cuboid[2], iso_cuboid[3],
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
index d8a5f68c083b..180d40f892fd 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
@@ -481,8 +481,8 @@ struct Triangle_structure_sampler_for_triangle_mesh
   void sample_points()
   {
     Property_map_to_unary_function<Vpm> unary(pmap);
-    this->out = std::copy(boost::make_transform_iterator(boost::begin(vertices(tm)), unary),
-                          boost::make_transform_iterator(boost::end(vertices(tm)), unary),
+    this->out = std::copy(boost::make_transform_iterator(std::begin(vertices(tm)), unary),
+                          boost::make_transform_iterator(std::end(vertices(tm)), unary),
                           this->out);
   }
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/Triangulate_hole_polyline.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/Triangulate_hole_polyline.h
index 5e84ba9e6947..a969e7a189c3 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/Triangulate_hole_polyline.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/Triangulate_hole_polyline.h
@@ -1555,8 +1555,8 @@ triangulate_hole_polyline(const PointRange1& points,
 #endif
   typedef CGAL::internal::Triangulate_hole_polyline<K, Tracer, WeightCalculator, Visitor>    Fill;
 
-  std::vector<Point_3> P(boost::begin(points), boost::end(points));
-  std::vector<Point_3> Q(boost::begin(third_points), boost::end(third_points));
+  std::vector<Point_3> P(std::begin(points), std::end(points));
+  std::vector<Point_3> Q(std::begin(third_points), std::end(third_points));
 
   if(P.front() != P.back()){
     P.push_back(P.front());
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 9cdb76ac76b0..72ef49c39968 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -156,15 +156,15 @@ namespace internal {
     template <class Range>
     bool same_range(const Range& r1, const Range& r2)
     {
-      return boost::begin(r1)==boost::begin(r2) &&
-             boost::end(r1)==boost::end(r2);
+      return std::begin(r1)==std::begin(r2) &&
+             std::end(r1)==std::end(r2);
     }
 
     template <class Range1, class Range2>
     bool same_range(const Range1& r1, const Range2& r2)
     {
-      return std::distance(boost::begin(r1), boost::end(r1)) ==
-             std::distance(boost::begin(r2), boost::end(r2));
+      return std::distance(std::begin(r1), std::end(r1)) ==
+             std::distance(std::begin(r2), std::end(r2));
     }
 
   public:
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h
index dac9b2d57fca..3de4f3fe12fb 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/fair_impl.h
@@ -122,8 +122,8 @@ class Fair_Polyhedron_3 {
       return false;
     }
 
-    std::set<vertex_descriptor> interior_vertices(boost::begin(vertices),
-                                                  boost::end(vertices));
+    std::set<vertex_descriptor> interior_vertices(std::begin(vertices),
+                                                  std::end(vertices));
     if(interior_vertices.empty()) { return true; }
 
     #ifdef CGAL_PMP_FAIR_DEBUG
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_impl.h
index 06ddc868f0d4..9ad6c177ec0a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_impl.h
@@ -305,7 +305,7 @@ class Refine_Polyhedron_3 {
               double alpha)
   {
       // do not use just std::set, the order effects the output (for the same input we want to get same output)
-    std::set<face_descriptor> interior_map(boost::begin(faces), boost::end(faces));
+    std::set<face_descriptor> interior_map(std::begin(faces), std::end(faces));
 
     // store boundary edges - to be used in relax
     std::set<halfedge_descriptor> border_edges;
@@ -324,7 +324,7 @@ class Refine_Polyhedron_3 {
     std::map<vertex_descriptor, double> scale_attribute;
     calculate_scale_attribute(faces, interior_map, scale_attribute, accept_internal_facets);
 
-    std::vector<face_descriptor> all_faces(boost::begin(faces), boost::end(faces));
+    std::vector<face_descriptor> all_faces(std::begin(faces), std::end(faces));
     #ifdef CGAL_PMP_REFINE_DEBUG
     CGAL::Timer total_timer; total_timer.start();
     #endif
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
index 7d1b1b6e6bfd..470ca6ed2325 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
@@ -415,8 +415,8 @@ compute_face_face_intersection(const FaceRange& face_range1,
   // make one box per facet
   std::vector<Box> boxes1;
   std::vector<Box> boxes2;
-  boxes1.reserve(std::distance(boost::begin(face_range1), boost::end(face_range1)));
-  boxes2.reserve(std::distance(boost::begin(face_range2), boost::end(face_range2)));
+  boxes1.reserve(std::distance(std::begin(face_range1), std::end(face_range1)));
+  boxes2.reserve(std::distance(std::begin(face_range2), std::end(face_range2)));
 
   typedef typename GetVertexPointMap<TM, NamedParameters1>::const_type VertexPointMap1;
   typedef typename GetVertexPointMap<TM, NamedParameters2>::const_type VertexPointMap2;
@@ -548,7 +548,7 @@ compute_face_polyline_intersection(const FaceRange& face_range,
         typename boost::range_value<Polyline>::type>::value));
 
   std::vector<face_descriptor> faces;
-  faces.reserve(std::distance(boost::begin(face_range), boost::end(face_range)));
+  faces.reserve(std::distance(std::begin(face_range), std::end(face_range)));
 
   typedef CGAL::Box_intersection_d::ID_FROM_BOX_ADDRESS Box_policy;
   typedef CGAL::Box_intersection_d::Box_with_info_d<double, 3, std::size_t, Box_policy> Box;
@@ -556,8 +556,8 @@ compute_face_polyline_intersection(const FaceRange& face_range,
   // make one box per facet
   std::vector<Box> boxes1;
   std::vector<Box> boxes2;
-  boxes1.reserve(std::distance(boost::begin(face_range), boost::end(face_range)));
-  boxes2.reserve(std::distance(boost::begin(polyline), boost::end(polyline)) - 1);
+  boxes1.reserve(std::distance(std::begin(face_range), std::end(face_range)));
+  boxes2.reserve(std::distance(std::begin(polyline), std::end(polyline)) - 1);
 
   for(face_descriptor f : face_range)
   {
@@ -684,7 +684,7 @@ compute_face_polylines_intersection(const FaceRange& face_range,
   CGAL_static_assertion((std::is_same<Point, typename boost::range_value<Polyline>::type>::value));
 
   std::vector<face_descriptor> faces;
-  faces.reserve(std::distance( boost::begin(face_range), boost::end(face_range) ));
+  faces.reserve(std::distance( std::begin(face_range), std::end(face_range) ));
 
   typedef CGAL::Box_intersection_d::ID_FROM_BOX_ADDRESS Box_policy;
   typedef CGAL::Box_intersection_d::Box_with_info_d<double, 3, std::pair<std::size_t, std::size_t>, Box_policy> Box;
@@ -692,12 +692,12 @@ compute_face_polylines_intersection(const FaceRange& face_range,
   // make one box per facet
   std::vector<Box> boxes1;
   std::vector<Box> boxes2;
-  boxes1.reserve(std::distance(boost::begin(face_range), boost::end(face_range)));
+  boxes1.reserve(std::distance(std::begin(face_range), std::end(face_range)));
 
   std::size_t polylines_size = 0;
   for(Polyline poly : polyline_range)
   {
-    polylines_size += std::distance( boost::begin(poly), boost::end(poly) ) -1;
+    polylines_size += std::distance( std::begin(poly), std::end(poly) ) -1;
   }
   boxes2.reserve(polylines_size);
 
@@ -707,11 +707,11 @@ compute_face_polylines_intersection(const FaceRange& face_range,
     boxes1.push_back(Box(Polygon_mesh_processing::face_bbox(f, tm), std::make_pair(0, faces.size()-1)));
   }
 
-  std::size_t range_size = std::distance( boost::begin(polyline_range), boost::end(polyline_range) );
+  std::size_t range_size = std::distance( std::begin(polyline_range), std::end(polyline_range) );
   for(std::size_t j = 0; j < range_size; ++j)
   {
     Polyline poly = polyline_range[j];
-    std::size_t size = std::distance( boost::begin(poly), boost::end(poly) );
+    std::size_t size = std::distance( std::begin(poly), std::end(poly) );
     for(std::size_t i =0; i< size - 1; ++i)
     {
       Point p1 = poly[i];
@@ -785,8 +785,8 @@ compute_polyline_polyline_intersection(const Polyline& polyline1,
   // make one box per facet
   std::vector<Box> boxes1;
   std::vector<Box> boxes2;
-  boxes1.reserve(std::distance(boost::begin(polyline1), boost::end(polyline1)) - 1);
-  boxes2.reserve(std::distance(boost::begin(polyline2), boost::end(polyline2)) - 1);
+  boxes1.reserve(std::distance(std::begin(polyline1), std::end(polyline1)) - 1);
+  boxes2.reserve(std::distance(std::begin(polyline2), std::end(polyline2)) - 1);
 
   for(std::size_t i =0; i< polyline1.size()-1; ++i)
   {
@@ -870,7 +870,7 @@ compute_polylines_polylines_intersection(const PolylineRange& polylines1,
   CGAL::Bbox_3 b1, b2;
   for(Polyline poly : polylines1)
   {
-    polylines_size += std::distance( boost::begin(poly), boost::end(poly) ) -1;
+    polylines_size += std::distance( std::begin(poly), std::end(poly) ) -1;
     b1 += CGAL::bbox_3(poly.begin(), poly.end());
   }
   boxes1.reserve( polylines_size );
@@ -878,7 +878,7 @@ compute_polylines_polylines_intersection(const PolylineRange& polylines1,
   polylines_size = 0;
   for(Polyline poly : polylines2)
   {
-    polylines_size += std::distance( boost::begin(poly), boost::end(poly) ) -1;
+    polylines_size += std::distance( std::begin(poly), std::end(poly) ) -1;
     b2 += CGAL::bbox_3(poly.begin(), poly.end());
   }
   boxes2.reserve(polylines_size);
@@ -886,11 +886,11 @@ compute_polylines_polylines_intersection(const PolylineRange& polylines1,
   if(!CGAL::do_overlap(b1,b2))
     return out;
 
-  std::size_t range_size = std::distance( boost::begin(polylines1), boost::end(polylines1) );
+  std::size_t range_size = std::distance( std::begin(polylines1), std::end(polylines1) );
   for(std::size_t j = 0; j < range_size; ++j)
   {
     Polyline poly = polylines1[j];
-    std::size_t size = std::distance( boost::begin(poly), boost::end(poly) );
+    std::size_t size = std::distance( std::begin(poly), std::end(poly) );
     for(std::size_t i =0; i< size - 1; ++i)
     {
       const Point& p1 = poly[i];
@@ -899,11 +899,11 @@ compute_polylines_polylines_intersection(const PolylineRange& polylines1,
     }
   }
 
-  range_size = std::distance( boost::begin(polylines2), boost::end(polylines2) );
+  range_size = std::distance( std::begin(polylines2), std::end(polylines2) );
   for(std::size_t j = 0; j < range_size; ++j)
   {
     Polyline poly = polylines2[j];
-    std::size_t size = std::distance( boost::begin(poly), boost::end(poly) );
+    std::size_t size = std::distance( std::begin(poly), std::end(poly) );
     for(std::size_t i =0; i< size - 1; ++i)
     {
       const Point& p1 = poly[i];
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/merge_border_vertices.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/merge_border_vertices.h
index af70795b209a..85d5d7428a43 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/merge_border_vertices.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/merge_border_vertices.h
@@ -222,7 +222,7 @@ void merge_vertices_in_range(const HalfedgeRange& sorted_hedges,
   typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
   typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
 
-  halfedge_descriptor in_h_kept = *boost::begin(sorted_hedges);
+  halfedge_descriptor in_h_kept = *std::begin(sorted_hedges);
   halfedge_descriptor out_h_kept = next(in_h_kept, pm);
   vertex_descriptor v_kept = target(in_h_kept, pm);
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
index bd543f5d390d..4322f62676f9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
@@ -26,7 +26,6 @@
 #include <CGAL/property_map.h>
 
 #include <boost/dynamic_bitset.hpp>
-#include <boost/range/size.hpp>
 #include <boost/range/value_type.hpp>
 #include <boost/range/reference.hpp>
 #include <boost/container/flat_set.hpp>
@@ -197,7 +196,7 @@ bool is_polygon_soup_a_polygon_mesh(const PolygonRange& polygons)
   typedef typename boost::range_value<PolygonRange>::type           Polygon;
   typedef typename boost::range_value<Polygon>::type                V_ID;
 
-  if(boost::begin(polygons) == boost::end(polygons))
+  if(std::begin(polygons) == std::end(polygons))
     return true;
 
   //check there is no duplicated ordered edge, and
@@ -208,12 +207,12 @@ bool is_polygon_soup_a_polygon_mesh(const PolygonRange& polygons)
 
   for(const Polygon& polygon : polygons)
   {
-    std::size_t nb_edges = boost::size(polygon);
+    std::size_t nb_edges = std::size(polygon);
     if(nb_edges < 3)
       return false;
 
     polygon_vertices.clear();
-    V_ID prev = *std::prev(boost::end(polygon));
+    V_ID prev = *std::prev(std::end(polygon));
     for(V_ID id : polygon)
     {
       if(max_id<id)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 6b37ec946ea9..014ae0af1410 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -199,7 +199,7 @@ void isotropic_remeshing(const FaceRange& faces
                        , PolygonMesh& pmesh
                        , const NamedParameters& np = parameters::default_values())
 {
-  if (boost::begin(faces)==boost::end(faces))
+  if (std::begin(faces)==std::end(faces))
     return;
 
   typedef PolygonMesh PM;
diff --git a/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h b/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h
index d6cbd4204789..e6b66f2145c7 100644
--- a/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h
+++ b/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h
@@ -260,7 +260,7 @@ class Rigid_triangle_mesh_collision_detection
     CGAL_assertion( m_aabb_trees[id] == nullptr );
     m_is_closed[id] = is_closed(tm);
     m_own_aabb_trees[id] = true;
-    Tree* t = new Tree(boost::begin(faces(tm)), boost::end(faces(tm)), tm, vpm);
+    Tree* t = new Tree(std::begin(faces(tm)), std::end(faces(tm)), tm, vpm);
     t->build();
     m_aabb_trees[id] = t;
     m_traversal_traits[id] = Traversal_traits(m_aabb_trees[id]->traits());
@@ -600,7 +600,7 @@ class Rigid_triangle_mesh_collision_detection
       }
     }
     // only one CC
-    points.push_back( get(vpm, *boost::begin(vertices(tm))) );
+    points.push_back( get(vpm, *std::begin(vertices(tm))) );
   }
 
  /*!
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_collision_detection.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_collision_detection.cpp
index 935c9525faa7..e8e28c9c2bd8 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_collision_detection.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_collision_detection.cpp
@@ -93,7 +93,7 @@ void test_intersections(Index index, const char* type)
   collision_detection.add_mesh(tm1, params::face_index_map(get(index, tm1))); // 0
   // add tm1 using an external tree
   typename CGAL::Rigid_triangle_mesh_collision_detection<TriangleMesh>::AABB_tree
-    tm1_tree(boost::begin(faces(tm1)), boost::end(faces(tm1)), tm1);
+    tm1_tree(std::begin(faces(tm1)), std::end(faces(tm1)), tm1);
   collision_detection.add_mesh(tm1_tree, tm1, params::face_index_map(get(index, tm1))); // 1 small_spheres
   collision_detection.add_mesh(tm2, params::face_index_map(get(index, tm2))); // 2 blobby
   collision_detection.add_mesh(tm3, params::face_index_map(get(index, tm3))); // 3 large_cube_coplanar
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp
index 860cc2d66e9d..429572694813 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp
@@ -52,8 +52,8 @@ class Offset_function
 public:
 
   Offset_function(TriangleMesh& tm, double offset_distance)
-    : m_tree_ptr(new Tree(boost::begin(faces(tm)),
-                          boost::end(faces(tm)),
+    : m_tree_ptr(new Tree(std::begin(faces(tm)),
+                          std::end(faces(tm)),
                           tm) )
     , m_side_of_ptr( new Side_of(*m_tree_ptr) )
     , m_offset_distance(offset_distance)
diff --git a/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp
index 7b3051fdd3e7..fb464e110f7c 100644
--- a/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp
@@ -306,7 +306,7 @@ void Scene_c3t3_item::compute_bbox() const
     _bbox = Bbox(result.xmin(), result.ymin(), result.zmin(),
                  result.xmax(), result.ymax(), result.zmax());
 
-    if (boost::empty(c3t3().cells_in_complex()))
+    if (std::empty(c3t3().cells_in_complex()))
     {
       for (Tr::Vertex_handle v : c3t3().triangulation().finite_vertex_handles())
       {
diff --git a/Surface_mesh/examples/Surface_mesh/sm_iterators.cpp b/Surface_mesh/examples/Surface_mesh/sm_iterators.cpp
index 6f5270b76cfd..6fe9d48402e8 100644
--- a/Surface_mesh/examples/Surface_mesh/sm_iterators.cpp
+++ b/Surface_mesh/examples/Surface_mesh/sm_iterators.cpp
@@ -41,8 +41,8 @@ int main()
     vb = r.begin();
     ve = r.end();
     // or the boost Range API
-    vb = boost::begin(r);
-    ve = boost::end(r);
+    vb = std::begin(r);
+    ve = std::end(r);
 
     // or with boost::tie, as the CGAL range derives from std::pair
     for(boost::tie(vb, ve) = m.vertices(); vb != ve; ++vb){
diff --git a/Surface_mesh/test/Surface_mesh/sm_circulator_test.cpp b/Surface_mesh/test/Surface_mesh/sm_circulator_test.cpp
index bf446b309597..5e932869a440 100644
--- a/Surface_mesh/test/Surface_mesh/sm_circulator_test.cpp
+++ b/Surface_mesh/test/Surface_mesh/sm_circulator_test.cpp
@@ -64,20 +64,20 @@ struct test_emptiness : public Surface_fixture
     assert(m.is_isolated(iv));
 
     Sm::Vertex_around_target_range vr = m.vertices_around_target(m.halfedge(iv));
-    assert(is_empty_range(boost::begin(vr), boost::end(vr)));
+    assert(is_empty_range(std::begin(vr), std::end(vr)));
 
     Sm::Face_around_target_range fr = m.faces_around_target(m.halfedge(iv));
-    assert(is_empty_range(boost::begin(fr), boost::end(fr)));
+    assert(is_empty_range(std::begin(fr), std::end(fr)));
 
     Sm::Halfedge_around_target_range hr = m.halfedges_around_target(m.halfedge(iv));
-    assert(is_empty_range(boost::begin(hr), boost::end(hr)));
+    assert(is_empty_range(std::begin(hr), std::end(hr)));
     // not true for everything else
     m.remove_vertex(iv);
     assert(m.is_removed(iv));
     Sm::Vertex_iterator vb, ve;
     for(boost::tie(vb, ve) = m.vertices(); vb != ve; ++vb) {
       Sm::Vertex_around_target_range vr = m.vertices_around_target(m.halfedge(*vb));
-      assert(!is_empty_range(boost::begin(vr), boost::end(vr)));
+      assert(!is_empty_range(std::begin(vr), std::end(vr)));
     }
   }
 };

From d9e9c1e66419b50ee38fcad12e92f9cca30c4400 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 23 Apr 2023 23:27:35 +0200
Subject: [PATCH 0246/1398] dtd::disance does not handle ranges

---
 .../demo/Polyhedron/Scene_polyhedron_selection_item.cpp   | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
index 0f32ae5b719e..0a012a64293f 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
@@ -1076,9 +1076,9 @@ bool Scene_polyhedron_selection_item:: treat_selection(const std::set<fg_edge_de
     }
       //Join vertex
     case 0:
-      if(std::distance(CGAL::halfedges_around_face(halfedge(ed, *polyhedron()), *polyhedron())) < 4
+      if(CGAL::halfedges_around_face(halfedge(ed, *polyhedron()), *polyhedron()).size() < 4
            ||
-         std::distance(CGAL::halfedges_around_face(opposite(halfedge(ed, *polyhedron()),*polyhedron()),*polyhedron()))< 4)
+         CGAL::halfedges_around_face(opposite(halfedge(ed, *polyhedron()),*polyhedron()),*polyhedron()).size()< 4)
         {
           d->tempInstructions("Edge not selected: the incident facets must have a degree of at least 4.",
                            "Select the edge with extremities you want to join.");
@@ -1177,9 +1177,9 @@ bool Scene_polyhedron_selection_item:: treat_selection(const std::set<fg_edge_de
     case 6:
 
         //check preconditions
-      if(std::distance(CGAL::halfedges_around_face(halfedge(ed, *polyhedron()),*polyhedron())) == 3
+      if(CGAL::halfedges_around_face(halfedge(ed, *polyhedron()),*polyhedron()).size() == 3
          &&
-         std::distance(CGAL::halfedges_around_face(opposite(halfedge(ed, *polyhedron()),*polyhedron()),*polyhedron())) == 3
+         CGAL::halfedges_around_face(opposite(halfedge(ed, *polyhedron()),*polyhedron()),*polyhedron()).size() == 3
         && !CGAL::is_border(ed, *polyhedron()))
       {
         SMesh* mesh = polyhedron();

From 7803086c66f927acc2cf058641b4c7fb7d6ce885 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Tue, 25 Apr 2023 11:38:13 +0200
Subject: [PATCH 0247/1398] Start to debug cmap/gmap insertion (nyf)

---
 .../include/CGAL/Combinatorial_map.h          |  4 +-
 .../Combinatorial_map_group_functors.h        | 41 +++++++++++++++++++
 .../internal/Combinatorial_map_utility.h      | 21 +++++-----
 .../CGAL/Combinatorial_map_operations.h       |  6 +++
 .../include/CGAL/Generalized_map_operations.h |  8 +++-
 5 files changed, 67 insertions(+), 13 deletions(-)

diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map.h b/Combinatorial_map/include/CGAL/Combinatorial_map.h
index f16a3779cd99..b65e30614dd9 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map.h
@@ -4562,7 +4562,7 @@ namespace CGAL {
         }
         this->template basic_link_beta_for_involution<2>(d2, d1);
 
-        for ( unsigned int dim=3; dim<=dimension; ++dim)
+        for (unsigned int dim=3; dim<=dimension; ++dim)
         {
           if ( !is_free(it1, dim) &&
                is_marked(beta(it1, dim), treated) )
@@ -4583,6 +4583,8 @@ namespace CGAL {
         { // Here we group all enabled attributes starting from 2 to dimension
           Helper::template Foreach_enabled_attributes
             <internal::Group_attribute_functor<Self>, 2>::run(*this, adart1, adart2);
+          Helper::template Foreach_enabled_attributes
+            <internal::Toto<Self>, 3>::run(*this, adart1, adart2); // TODO DEBUG
         }
         else // Here we degroup 2-attributes
         { internal::Degroup_attribute_functor_run<Self, 2>::run(*this, adart1, adart2); }
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
index bda62d360f86..08dd26c00c75 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
@@ -42,6 +42,10 @@
  * Test_split_attribute_functor<CMap,i> to test if there is some i-attributes
  *   that are split after an operation. Modified darts are given in a
  *   std::deque.
+ *
+ * Set_dart_of_attribute_if_marked<CMap, i> to set the dart of the i-attribute
+ *   associated with a dart if the old dart is marked. Used in remove_cell
+ *   functions.
  */
 namespace CGAL
 {
@@ -1033,6 +1037,43 @@ struct Test_split_attribute_functor
   }
 };
 // ************************************************************************
+template<typename CMap, unsigned int i,
+         typename T=typename CMap::template Attribute_type<i>::type>
+struct Set_dart_of_attribute_if_marked
+{
+  static void run(CMap& amap, typename CMap::Dart_descriptor d1,
+                  typename CMap::size_type amark)
+  {
+    if(amap.template attribute<i>(d1)!=CMap::null_descriptor &&
+       amap.template dart<i>(d1)!=CMap::null_descriptor &&
+       amap.is_marked(amap.template dart<i>(d1), amark))
+    { amap.template dart<i>(d1)=d1; }
+  }
+};
+// Specialization for void attributes.
+template<typename CMap, unsigned int i>
+struct Set_dart_of_attribute_if_marked<CMap, i, CGAL::Void>
+{
+  static void run(CMap&, typename CMap::Dart_descriptor,
+                  typename CMap::size_type)
+  {}
+};
+// ************************************************************************
+template<typename CMap>
+struct Toto // TODO UPDATE
+{
+  template<unsigned int i>
+  static void run(CMap& amap, typename CMap::Dart_descriptor d1,
+                  typename CMap::Dart_descriptor d2)
+  {
+    if(!amap.template is_free<i>(d1) && !amap.template is_free<i>(d2))
+    {
+      Group_attribute_functor_run<CMap, i>::run
+          (amap, amap.template beta<i>(d1), amap.template beta<i>(d2), false);
+    }
+  }
+};
+// ************************************************************************
 } // namespace internal
 } // namespace CGAL
 
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
index 340b0551c988..884c4f80b981 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
@@ -342,23 +342,24 @@ namespace CGAL
     //is called for case k only if the k'th type in the tuple
     //is different from Void. Note that to the converse of Foreach_static
     //Functor are called from n =0 to k
-    template <class Functor,class T,int n=0>
+    template <class Functor,class T,int n=0, int startn=0>
     struct Foreach_static_restricted;
 
-    template <class Functor,class Head, class ... Items,int n>
+    template <class Functor,class Head, class ... Items,int n, int startn>
     struct Foreach_static_restricted<Functor,
-                                     std::tuple<Head,Items...>,n>
+                                     std::tuple<Head,Items...>,n, startn>
     {
       template <class  ... T>
       static void run(T& ... t){
-        Conditionnal_run<Functor,n,Head>::run(t...);
+        if(n>=startn)
+        { Conditionnal_run<Functor,n,Head>::run(t...); }
         Foreach_static_restricted
-          <Functor,std::tuple<Items...>,n+1>::run(t...);
+          <Functor,std::tuple<Items...>, n+1, startn>::run(t...);
       }
     };
 
-    template <class Functor,int n>
-    struct Foreach_static_restricted<Functor,std::tuple<>,n>{
+    template <class Functor,int n, int startn>
+    struct Foreach_static_restricted<Functor,std::tuple<>,n, startn>{
       template <class  ... T>
       static void run(T& ... ){}
     };
@@ -609,13 +610,13 @@ namespace CGAL
       struct Attribute_const_range<d, CGAL::Void>
       { typedef CGAL::Void type; };
 
-      // To iterate onto each enabled attributes, starting from n-attributes (0 by default)
-      template <class Functor, int n=0>
+      // To iterate onto each enabled attributes, starting from startn-attributes (0 by default)
+      template <class Functor, int startn=0>
       struct Foreach_enabled_attributes
       {
         template <class ...Ts>
         static void run(Ts& ... t)
-        { Foreach_static_restricted<Functor, Attributes, n>::run(t...); }
+        { Foreach_static_restricted<Functor, Attributes, 0, startn>::run(t...); }
       };
       // To iterate onto each enabled attributes, except j-attributes
       template <class Functor, unsigned int j>
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h b/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h
index 8d29ad53b6ca..9a2a3a947448 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h
@@ -150,6 +150,9 @@ namespace CGAL
 
           if ( d1!=amap.null_dart_descriptor )
           {
+            internal::Set_dart_of_attribute_if_marked<CMap, i+1>::
+                run(amap, d1, mark);
+
             if ( d2!=amap.null_dart_descriptor && d1!=d2 )
             {
               amap.template basic_link_beta<i>(d1, d2);
@@ -371,6 +374,9 @@ namespace CGAL
       {
         if ( !amap.template is_free<0>(*it) )
         {
+          internal::Set_dart_of_attribute_if_marked<CMap, 1>::
+              run(amap, amap.template beta<0>(*it), mark);
+
           if ( !amap.template is_free<1>(*it) &&
                amap.template beta<0>(*it)!=(*it) )
           {
diff --git a/Generalized_map/include/CGAL/Generalized_map_operations.h b/Generalized_map/include/CGAL/Generalized_map_operations.h
index abffe8d16513..7ae5b70117fc 100644
--- a/Generalized_map/include/CGAL/Generalized_map_operations.h
+++ b/Generalized_map/include/CGAL/Generalized_map_operations.h
@@ -91,8 +91,9 @@ namespace CGAL
             it.cont(); ++it )
       {
         to_erase.push_back(it);
-        if ( !amap.template is_free<i+1>(it) && dg1==amap.null_descriptor )
-        { dg1=it; dg2=amap.template alpha<i+1>(it); }
+        if (dg1==amap.null_descriptor && !amap.template is_free<i+1>(it) &&
+            !amap.template is_free<i>(amap.template alpha<i+1>(it)))
+        { dg1=it; dg2=amap.template alpha<i+1, i>(it); }
         amap.mark(it, mark);
         ++res;
       }
@@ -136,6 +137,9 @@ namespace CGAL
               modified_darts.push_back(d2);
               amap.mark(d2, mark_modified_darts);
             }
+
+            internal::Set_dart_of_attribute_if_marked<GMap, i+1>::
+                run(amap, d1, mark);
           }
         }
       }

From 79ac67c8ffa25e9d3e821cbfb2da9b09285c4069 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Tue, 25 Apr 2023 11:40:31 +0200
Subject: [PATCH 0248/1398] Create all attributes for LCC tests; add draw to
 debug (todo: remove later)

---
 .../test/Linear_cell_complex/CMakeLists.txt   |   7 +-
 .../Linear_cell_complex_3_test.h              | 108 +++++++++++++++++-
 2 files changed, 108 insertions(+), 7 deletions(-)

diff --git a/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt b/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt
index 9adb636537f1..0b7a094a29d1 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt
+++ b/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Linear_cell_complex_Tests)
 
-find_package(CGAL REQUIRED)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
 
 set(hfiles Linear_cell_complex_2_test.h
   Linear_cell_complex_3_test.h Linear_cell_complex_3_test.h)
@@ -26,6 +26,11 @@ target_compile_definitions(Linear_cell_complex_3_test_index PUBLIC USE_COMPACT_C
 target_link_libraries(Linear_cell_complex_3_test_index PUBLIC CGAL CGAL::Data)
 cgal_add_compilation_test(Linear_cell_complex_3_test_index)
 
+if(CGAL_Qt5_FOUND)
+  target_link_libraries(Linear_cell_complex_3_test PUBLIC CGAL::CGAL_Basic_viewer)
+  target_link_libraries(Linear_cell_complex_3_test_index PUBLIC CGAL::CGAL_Basic_viewer)
+endif()
+
 add_executable(Linear_cell_complex_4_test_index Linear_cell_complex_4_test.cpp ${hfiles})
 target_compile_definitions(Linear_cell_complex_4_test_index PUBLIC USE_COMPACT_CONTAINER_WITH_INDEX)
 target_link_libraries(Linear_cell_complex_4_test_index PUBLIC CGAL CGAL::Data)
diff --git a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h
index 7235848f2e84..d5811fbfff11 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h
+++ b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h
@@ -20,7 +20,7 @@
 #include "Linear_cell_complex_2_test.h"
 #include <fstream>
 #include <typeinfo>
-
+#include<CGAL/draw_linear_cell_complex.h>
 template<typename LCC>
 bool check_number_of_cells_3(LCC& lcc, unsigned int nbv, unsigned int nbe,
                              unsigned int nbf, unsigned int nbvol,
@@ -63,6 +63,13 @@ bool check_number_of_cells_3(LCC& lcc, unsigned int nbv, unsigned int nbe,
   return true;
 }
 
+template<typename Map>
+void create_attributes_3(Map& map)
+{
+  create_attributes_2(map);
+  CreateAttributes<Map, 3>::run(map);
+}
+
 template<typename LCC>
 typename LCC::Dart_descriptor make_loop(LCC& lcc, const typename LCC::Point& p1)
 {
@@ -96,6 +103,7 @@ bool test_LCC_3()
   Dart_descriptor dh1=lcc.make_segment(Point(0,0,0),Point(1,0,0), true);
   Dart_descriptor dh2=lcc.make_segment(Point(2,0,0),Point(2,1,0), true);
   Dart_descriptor dh3=lcc.make_segment(Point(2,2,0),Point(3,1,0), true);
+  create_attributes_3(lcc);
   if ( !check_number_of_cells_3(lcc, 6, 3, 6, 3, 3) )
     return false;
 
@@ -210,6 +218,7 @@ bool test_LCC_3()
   if ( !check_number_of_cells_3(lcc, 11, 13, 8, 2, 2) )
     return false;
 
+  // CGAL::draw(lcc);
   trace_test_begin();
   lcc.template remove_cell<0>(dh9);
   if ( !check_number_of_cells_3(lcc, 10, 12, 8, 2, 2) )
@@ -320,6 +329,7 @@ bool test_LCC_3()
   dh1 = lcc.make_triangle(Point(5,5,3),Point(7,5,3),Point(6,6,3));
   dh2 = lcc.make_triangle(Point(5,4,3),Point(7,4,3),Point(6,3,3));
   lcc.template sew<3>(dh1, dh2);
+  create_attributes_3(lcc);
   dh2 = lcc.previous(dh1); dh3 = lcc.next(dh1);
 
   lcc.template contract_cell<1>(dh1);
@@ -341,6 +351,7 @@ bool test_LCC_3()
   trace_test_begin();
   dh1 = lcc.make_triangle(Point(5,5,3),Point(7,5,3),Point(6,6,3));
   dh2 = lcc.make_triangle(Point(5,4,3),Point(7,4,3),Point(6,3,3));
+  create_attributes_3(lcc);
   lcc.template sew<2>(dh1, dh2);
 
   dh2 = lcc.next(dh2);
@@ -373,6 +384,7 @@ bool test_LCC_3()
   trace_test_begin();
   dh1 = lcc.make_triangle(Point(5,5,3),Point(7,5,3),Point(6,6,3));
   dh2 = lcc.make_triangle(Point(5,4,3),Point(7,4,3),Point(6,3,3));
+  create_attributes_3(lcc);
   lcc.template sew<2>(dh1, dh2);
 
   dh2 = lcc.next(dh2);
@@ -405,6 +417,7 @@ bool test_LCC_3()
   trace_test_begin();
   dh1 = lcc.make_triangle(Point(5,5,3),Point(7,5,3),Point(6,6,3));
   dh2 = lcc.make_triangle(Point(5,4,3),Point(7,4,3),Point(6,3,3));
+  create_attributes_3(lcc);
   lcc.template sew<2>(dh1, dh2);
 
   dh3 = lcc.make_triangle(Point(5,5,4),Point(7,5,4),Point(6,6,4));
@@ -445,6 +458,7 @@ bool test_LCC_3()
   trace_test_begin();
   dh1 = lcc.make_triangle(Point(5,5,3),Point(7,5,3),Point(6,6,3));
   dh2 = lcc.make_triangle(Point(5,4,3),Point(7,4,3),Point(6,3,3));
+  create_attributes_3(lcc);
   lcc.template sew<2>(dh1, dh2);
 
   dh3 = lcc.make_triangle(Point(5,5,4),Point(7,5,4),Point(6,6,4));
@@ -483,6 +497,7 @@ bool test_LCC_3()
   trace_test_begin();
   dh1 = lcc.make_tetrahedron(Point(9, 9, 0),Point(9, 0, 9),
                              Point(0, 9, 9),Point(0, 0, 0));
+  create_attributes_3(lcc);
   typename LCC::Vector v=CGAL::compute_normal_of_cell_0(lcc, dh1);
   if (v!=typename LCC::Vector(-9,-9,9))
   {
@@ -496,7 +511,7 @@ bool test_LCC_3()
   dh1 = lcc.
       make_hexahedron(Point(0,0,0),Point(1,0,0),Point(1,2,0),Point(0,2,0),
                       Point(0,3,4),Point(0,0,4),Point(6,0,4),Point(6,3,4));
-
+  create_attributes_3(lcc);
   v=CGAL::compute_normal_of_cell_2(lcc, lcc.template
                                    opposite<2>(lcc.previous(dh1)));
   if (v!=typename LCC::Vector(0,0,1))
@@ -529,6 +544,7 @@ bool test_LCC_3()
       make_hexahedron(Point(0,3,0),Point(1,3,0),Point(1,4,0),Point(0,4,0),
                       Point(0,4,1),Point(0,3,1),Point(1,3,1),Point(1,4,1));
   dh2 = lcc.template opposite<2>(lcc.next(lcc.next(lcc.template opposite<2>(dh2))));
+  create_attributes_3(lcc);
   lcc.template sew<3>(dh1,dh2);
 
   lcc.template contract_cell<1>(lcc.previous(dh1));
@@ -560,12 +576,14 @@ bool test_LCC_3()
 
   trace_test_begin();
   dh1 = make_loop<LCC>(lcc, Point(0,0,0));
+  create_attributes_3(lcc);
   lcc.template contract_cell<2>(dh1);
   if ( !check_number_of_cells_3(lcc, 0, 0, 0, 0, 0) )
     return false;
 
   trace_test_begin();
   dh1 = lcc.make_segment(Point(0,0,0),Point(1,0,0), true);
+  create_attributes_3(lcc);
   lcc.template sew<1>(lcc.template opposite<2>(dh1),
                       lcc.other_orientation(lcc.template opposite<2>(dh1)));
   lcc.template contract_cell<2>(dh1);
@@ -575,6 +593,7 @@ bool test_LCC_3()
 
   trace_test_begin();
   dh1 = lcc.make_segment(Point(0,0,0),Point(1,0,0),true);
+  create_attributes_3(lcc);
   lcc.template sew<1>(dh1, lcc.other_orientation(dh1));
   lcc.template sew<1>(lcc.template opposite<2>(dh1),
                       lcc.other_orientation(lcc.template opposite<2>(dh1)));
@@ -586,6 +605,7 @@ bool test_LCC_3()
   trace_test_begin();
   dh1 = make_face_two_edges(lcc, Point(0,0,0), Point(1,0,0));
   dh2 = make_face_two_edges(lcc, Point(0,0,1), Point(1,0,1));
+  create_attributes_3(lcc);
   lcc.template sew<2>(dh1, dh2);
   lcc.template contract_cell<2>(dh1);
   if ( !check_number_of_cells_3(lcc, 2, 2, 1, 1, 1) )
@@ -600,6 +620,7 @@ bool test_LCC_3()
   dh1 = lcc.make_triangle(Point(5,5,3),Point(7,5,3),Point(6,6,3));
   dh2 = lcc.make_triangle(Point(5,4,3),Point(7,4,3),Point(6,3,3));
   dh3 = lcc.make_triangle(Point(5,3,3),Point(7,3,3),Point(6,0,3));
+  create_attributes_3(lcc);
   lcc.template sew<2>(dh1, dh2);
   lcc.template sew<2>(lcc.next(dh2), dh3);
 
@@ -615,6 +636,7 @@ bool test_LCC_3()
 
   trace_test_begin();
   dh1 = lcc.create_dart(Point(0,0,0));
+  create_attributes_3(lcc);
   lcc.template sew<3>(dh1, lcc.create_dart(Point(1,0,0)));
   lcc.template contract_cell<2>(dh1);
   if ( !check_number_of_cells_3(lcc, 0, 0, 0, 0, 0) )
@@ -623,6 +645,7 @@ bool test_LCC_3()
   trace_test_begin();
   dh1 = make_loop(lcc, Point(0,0,0));
   dh2 = make_loop(lcc, Point(0,0,1));
+  create_attributes_3(lcc);
   lcc.template sew<3>(dh1, dh2);
   lcc.template contract_cell<2>(dh1);
   if ( !check_number_of_cells_3(lcc, 0, 0, 0, 0, 0) )
@@ -630,6 +653,7 @@ bool test_LCC_3()
 
   trace_test_begin();
   dh1 = lcc.make_segment(Point(0,0,0),Point(1,0,0), true);
+  create_attributes_3(lcc);
   lcc.template sew<3>(dh1, lcc.make_segment(Point(0,0,1),Point(1,0,1), true));
   lcc.template sew<3>(lcc.template opposite<2>(dh1),
                       lcc.template opposite<2>(lcc.template opposite<3>(dh1)));
@@ -640,8 +664,10 @@ bool test_LCC_3()
 
   trace_test_begin();
   dh1 = lcc.make_segment(Point(0,0,0),Point(1,0,0), true);
+  create_attributes_3(lcc);
   lcc.template sew<1>(dh1, lcc.other_orientation(dh1));
   dh2 = lcc.make_segment(Point(0,0,1),Point(1,0,1), true);
+  create_attributes_3(lcc);
   lcc.template sew<1>(dh2, lcc.other_orientation(dh2));
   lcc.template sew<3>(dh1, dh2);
   lcc.template contract_cell<2>(dh1);
@@ -651,10 +677,12 @@ bool test_LCC_3()
 
   trace_test_begin();
   dh1 = lcc.make_segment(Point(0,0,0),Point(1,0,0), true);
+  create_attributes_3(lcc);
   lcc.template sew<1>(dh1, lcc.other_orientation(dh1));
   lcc.template sew<1>(lcc.template opposite<2>(dh1),
                       lcc.other_orientation(lcc.template opposite<2>(dh1)));
   dh2 = lcc.make_segment(Point(0,0,1),Point(1,0,1), true);
+  create_attributes_3(lcc);
   lcc.template sew<1>(dh2, lcc.other_orientation(dh2));
   lcc.template sew<1>(lcc.template opposite<2>(dh2),
                       lcc.other_orientation(lcc.template opposite<2>(dh2)));
@@ -669,6 +697,7 @@ bool test_LCC_3()
   trace_test_begin();
   dh1 = make_face_two_edges(lcc, Point(0,0,0), Point(1,0,0));
   dh2 = make_face_two_edges(lcc, Point(0,0,1), Point(1,0,1));
+  create_attributes_3(lcc);
   lcc.template sew<2>(dh1, dh2);
   lcc.template sew<3>(dh1,
                       make_face_two_edges(lcc, Point(0,0,1), Point(1,0,1)));
@@ -686,6 +715,7 @@ bool test_LCC_3()
   trace_test_begin();
   dh1 = make_face_two_edges(lcc, Point(0,0,0), Point(1,0,0));
   dh2 = make_face_two_edges(lcc, Point(0,0,1), Point(1,0,1));
+  create_attributes_3(lcc);
   lcc.template sew<2>(dh1, dh2);
   lcc.template sew<3>(dh1,
                       make_face_two_edges(lcc, Point(0,0,1), Point(1,0,1)));
@@ -706,6 +736,7 @@ bool test_LCC_3()
   dh1 = lcc.make_triangle(Point(5,5,3),Point(7,5,3),Point(6,6,3));
   dh2 = lcc.make_triangle(Point(5,4,3),Point(7,4,3),Point(6,3,3));
   dh3 = lcc.make_triangle(Point(5,3,3),Point(7,3,3),Point(6,0,3));
+  create_attributes_3(lcc);
   lcc.template sew<2>(dh1, dh2);
   lcc.template sew<2>(lcc.next(dh2), dh3);
   lcc.template sew<3>(dh1, lcc.make_triangle(Point(5,5,4),Point(7,5,4),
@@ -737,18 +768,21 @@ bool test_LCC_3()
 
   trace_test_begin();
   dh1 = make_loop<LCC>(lcc, Point(0,0,0));
+  create_attributes_3(lcc);
   lcc.template contract_cell<3>(dh1);
   if ( !check_number_of_cells_3(lcc, 0, 0, 0, 0, 0) )
     return false;
 
   trace_test_begin();
   dh1 = lcc.make_segment(Point(0,0,0),Point(1,0,0));
+  create_attributes_3(lcc);
   lcc.template contract_cell<3>(dh1);
   if ( !check_number_of_cells_3(lcc, 0, 0, 0, 0, 0) )
     return false;
 
   trace_test_begin();
   dh1 = lcc.make_segment(Point(0,0,0),Point(1,0,0), true);
+  create_attributes_3(lcc);
   lcc.template sew<1>(dh1, lcc.other_orientation(dh1));
   lcc.template sew<1>(lcc.template opposite<2>(dh1),
                       lcc.other_orientation(lcc.template opposite<2>(dh1)));
@@ -764,6 +798,7 @@ bool test_LCC_3()
   dh2 = lcc.
     make_hexahedron(Point(0,3,0),Point(1,3,0),Point(1,4,0),Point(0,4,0),
                     Point(0,4,1),Point(0,3,1),Point(1,3,1),Point(1,4,1));
+  create_attributes_3(lcc);
   dh2 = lcc.template opposite<2>(lcc.next(lcc.next(lcc.template opposite<2>(dh2))));
   lcc.template sew<3>(dh1,dh2);
 
@@ -813,6 +848,7 @@ bool test_LCC_3()
   dh3 = lcc.
     make_hexahedron(Point(0,6,0),Point(1,6,0),Point(1,7,0),Point(0,7,0),
                     Point(0,7,1),Point(0,6,1),Point(1,6,1),Point(1,7,1));
+  create_attributes_3(lcc);
   dh3 = lcc.template opposite<2>(lcc.next(lcc.next(lcc.template opposite<2>(dh3))));
   lcc.template sew<3>(dh2,dh3);
   dh2 = lcc.template opposite<2>(lcc.next(lcc.next(lcc.template opposite<2>(dh2))));
@@ -861,6 +897,12 @@ bool test_LCC_3()
                       Point(1,2,0),Point(0,2,0),
                       Point(0,3,4),Point(0,0,4),
                       Point(6,0,4),Point(6,3,4));
+
+  dh2=lcc.insert_cell_1_in_cell_2(lcc.next(dh1), lcc.previous(dh1));
+  if ( !check_number_of_cells_3(lcc, 8, 13, 7, 1, 1) )
+    return false;
+  lcc.template remove_cell<1>(dh2);
+
   dh2 = lcc.
       make_hexahedron(Point(0,0,4),Point(1,0,4),
                       Point(1,2,4),Point(0,2,4),
@@ -871,16 +913,24 @@ bool test_LCC_3()
                       Point(6,2,4),Point(5,2,4),
                       Point(5,3,8),Point(5,0,8),
                       Point(11,0,8),Point(11,3,8));
-  lcc.template sew<3>(dh1,lcc.template opposite<2>(lcc.next(lcc.next(lcc.template opposite<2>(dh2)))));
-  lcc.template sew<3>(lcc.template opposite<2>(lcc.next(dh1)), lcc.template opposite<2>(lcc.previous(dh3)));
+  create_attributes_3(lcc);
+  lcc.template sew<3>(dh1,lcc.template opposite<2>
+                      (lcc.next(lcc.next(lcc.template opposite<2>(dh2)))));
+  lcc.template sew<3>(lcc.template opposite<2>(lcc.next(dh1)),
+                      lcc.template opposite<2>(lcc.previous(dh3)));
 
   lcc.template close<3>();
   if ( !check_number_of_cells_3(lcc, 16, 28, 16, 4, 1) )
     return false;
 
-  lcc.insert_cell_1_in_cell_2(lcc.next(dh1), Alpha1<LCC>::run(lcc, lcc.previous(dh1)));
+  lcc.insert_cell_1_in_cell_2(lcc.next(dh1), lcc.previous(dh1));
+  if ( !check_number_of_cells_3(lcc, 16, 29, 17, 4, 1) )
+    return false;
+
   dh2=lcc.template opposite<2>(lcc.next(lcc.next(lcc.template opposite<2>(dh1))));
-  lcc.insert_cell_1_in_cell_2(dh2, Alpha1<LCC>::run(lcc, lcc.next(lcc.next(dh2))));
+  lcc.insert_cell_1_in_cell_2(dh2, lcc.next(lcc.next(dh2)));
+  if ( !check_number_of_cells_3(lcc, 16, 30, 18, 4, 1) )
+    return false;
 
   std::vector<Dart_descriptor> path;
   path.push_back(lcc.next(dh1));
@@ -891,6 +941,52 @@ bool test_LCC_3()
   if ( !check_number_of_cells_3(lcc, 16, 30, 19, 5, 1) )
     return false;
 
+  // Test insertion between two different 2-cells
+  trace_test_begin();
+  lcc.clear();
+  dh1 = lcc.
+      make_hexahedron(Point(0,0,0),Point(1,0,0),
+                      Point(1,2,0),Point(0,2,0),
+                      Point(0,3,4),Point(0,0,4),
+                      Point(6,0,4),Point(6,3,4));
+  dh2 = lcc.
+      make_hexahedron(Point(0,0,4),Point(1,0,4),
+                      Point(1,2,4),Point(0,2,4),
+                      Point(0,3,8),Point(0,0,8),
+                      Point(6,0,8),Point(6,3,8));
+  create_attributes_3(lcc);
+  lcc.template sew<3>(dh1,lcc.template opposite<2>(lcc.next(lcc.next(lcc.template opposite<2>(dh2)))));
+
+  lcc.insert_cell_1_between_two_cells_2(lcc.template opposite<2>(dh1),
+                                        lcc.template opposite<2>(lcc.next(dh1)));
+  if ( !check_number_of_cells_3(lcc, 12, 21, 10, 2, 1) )
+    return false;
+
+  trace_test_begin();
+  lcc.clear();
+  dh1=lcc.make_hexahedron(Point(0,0,0), Point(5,0,0),
+                          Point(5,5,0), Point(0,5,0),
+                          Point(0,5,4), Point(0,0,4),
+                          Point(5,0,4), Point(5,5,4));
+  dh2=lcc.make_hexahedron(Point(5,0,0), Point(10,0,0),
+                          Point(10,5,0), Point(5,5,0),
+                          Point(5,5,4), Point(5,0,4),
+                          Point(10,0,4), Point(10,5,4));
+  dh3=lcc.make_quadrangle(Point(5,2,2), Point(5,1,2),
+                          Point(5,1,1), Point(5,2,1));
+  create_attributes_3(lcc);
+  lcc.template sew<3>(lcc.template opposite<2>(lcc.next(lcc.next(dh1))),
+                      lcc.other_orientation(lcc.template opposite<2>(dh2)));
+  lcc.template sew<3>(dh3, lcc.make_combinatorial_polygon(4));
+
+  // Create an hole in the face between the two cubes
+  lcc.insert_cell_1_between_two_cells_2(lcc.template opposite<2>(lcc.next(lcc.next(dh1))),
+                                        lcc.next(lcc.next(dh3)));
+
+  CGAL::draw(lcc); // TODO remove
+  if (!check_number_of_cells_3(lcc, 16, 25, 11, 2, 1) )
+    return false;
+
   // Construction from Polyhedron_3
   {
     trace_test_begin();

From 57f0b8908d198643a9b41cf379aa638cf77f7539 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Tue, 25 Apr 2023 14:47:33 +0200
Subject: [PATCH 0249/1398] bug fix in insert cell 1 between two 2 cells

---
 .../include/CGAL/Combinatorial_map.h          |  6 +++-
 .../Combinatorial_map_group_functors.h        | 34 +++++++++++--------
 .../include/CGAL/Generalized_map.h            |  7 ++++
 .../Linear_cell_complex_3_test.h              |  2 +-
 4 files changed, 32 insertions(+), 17 deletions(-)

diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map.h b/Combinatorial_map/include/CGAL/Combinatorial_map.h
index b65e30614dd9..77af5bbc736c 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map.h
@@ -4583,8 +4583,12 @@ namespace CGAL {
         { // Here we group all enabled attributes starting from 2 to dimension
           Helper::template Foreach_enabled_attributes
             <internal::Group_attribute_functor<Self>, 2>::run(*this, adart1, adart2);
+          // And we need to group also beta_i(adart1) and beta_i(adart2) for all
+          // enabled attributes starting from 3 dimension. Indeed when two i-cells
+          // are grouped for adart1 and adart2, this group also all beta_j two by two
+          // except for beta_i.
           Helper::template Foreach_enabled_attributes
-            <internal::Toto<Self>, 3>::run(*this, adart1, adart2); // TODO DEBUG
+            <internal::Group_neighboor_attribute<Self>, 3>::run(*this, adart1, adart2);
         }
         else // Here we degroup 2-attributes
         { internal::Degroup_attribute_functor_run<Self, 2>::run(*this, adart1, adart2); }
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
index 08dd26c00c75..6fd93934b2c1 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
@@ -36,6 +36,9 @@
  *    non nullptr, we overide all the i-attribute of the second i-cell to the
  *    first i-attribute.
  *
+ * Group_neighboor_attribute to group the <i>-attributes of beta_i(d1) and
+ *    beta_i(d2) if they exist.
+ *
  * Degroup_attribute_functor_run<CMap> to degroup one i-attributes in two
  *   (except for j-adim).
  *
@@ -488,6 +491,22 @@ struct Group_attribute_functor
         run(amap,adart1,adart2); }
 };
 // ************************************************************************
+/// Group i-attribute of beta_i(d1) and beta_i(d2) if they exist.
+template<typename CMap>
+struct Group_neighboor_attribute
+{
+  template<unsigned int i>
+  static void run(CMap& amap, typename CMap::Dart_descriptor d1,
+                  typename CMap::Dart_descriptor d2)
+  {
+    if(!amap.template is_free<i>(d1) && !amap.template is_free<i>(d2))
+    {
+      CGAL::internal::Group_attribute_functor_run<CMap, i>::run
+          (amap, amap.template opposite<i>(d1), amap.template opposite<i>(d2), false);
+    }
+  }
+};
+// ************************************************************************
 // Functor used to degroup one i-attribute of one i-cell in two, except the
 // attribute of j.
 template<typename CMap, unsigned int i, unsigned int j=CMap::dimension+1,
@@ -1059,21 +1078,6 @@ struct Set_dart_of_attribute_if_marked<CMap, i, CGAL::Void>
   {}
 };
 // ************************************************************************
-template<typename CMap>
-struct Toto // TODO UPDATE
-{
-  template<unsigned int i>
-  static void run(CMap& amap, typename CMap::Dart_descriptor d1,
-                  typename CMap::Dart_descriptor d2)
-  {
-    if(!amap.template is_free<i>(d1) && !amap.template is_free<i>(d2))
-    {
-      Group_attribute_functor_run<CMap, i>::run
-          (amap, amap.template beta<i>(d1), amap.template beta<i>(d2), false);
-    }
-  }
-};
-// ************************************************************************
 } // namespace internal
 } // namespace CGAL
 
diff --git a/Generalized_map/include/CGAL/Generalized_map.h b/Generalized_map/include/CGAL/Generalized_map.h
index 273d8b32bf27..d65292ed5a0b 100644
--- a/Generalized_map/include/CGAL/Generalized_map.h
+++ b/Generalized_map/include/CGAL/Generalized_map.h
@@ -3695,6 +3695,13 @@ namespace CGAL {
         Helper::template Foreach_enabled_attributes
           <internal::Group_attribute_functor<Self>, 2>::
             run(*this, adart1, adart2);
+        // And we need to group also alpha_i(adart1) and alpha_i(adart2) for all
+        // enabled attributes starting from 3 dimension. Indeed when two i-cells
+        // are grouped for adart1 and adart2, this group also all alpha_j two by two
+        // except for alpha_i.
+        Helper::template Foreach_enabled_attributes
+          <internal::Group_neighboor_attribute<Self>, 3>::run(*this, adart1, adart2);
+
       }
       else // Here we degroup 2-attributes
       {
diff --git a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h
index d5811fbfff11..8b8d55ea375e 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h
+++ b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h
@@ -974,10 +974,10 @@ bool test_LCC_3()
                           Point(10,0,4), Point(10,5,4));
   dh3=lcc.make_quadrangle(Point(5,2,2), Point(5,1,2),
                           Point(5,1,1), Point(5,2,1));
-  create_attributes_3(lcc);
   lcc.template sew<3>(lcc.template opposite<2>(lcc.next(lcc.next(dh1))),
                       lcc.other_orientation(lcc.template opposite<2>(dh2)));
   lcc.template sew<3>(dh3, lcc.make_combinatorial_polygon(4));
+  create_attributes_3(lcc);
 
   // Create an hole in the face between the two cubes
   lcc.insert_cell_1_between_two_cells_2(lcc.template opposite<2>(lcc.next(lcc.next(dh1))),

From 24451c03e1ef4a81a346f9dc4e7158be1e5aa1cc Mon Sep 17 00:00:00 2001
From: Michael Hoffmann <hoffmann@inf.ethz.ch>
Date: Tue, 25 Apr 2023 17:01:09 +0200
Subject: [PATCH 0250/1398] Add doc which constructions are trivial/exact.

---
 ..._predicates_inexact_constructions_kernel.h | 205 +++++++++++++++++-
 1 file changed, 197 insertions(+), 8 deletions(-)

diff --git a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
index 1063561e3d65..a24ad8901c22 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
@@ -4,16 +4,205 @@ namespace CGAL {
 /*!
 \ingroup kernel_predef
 
-A typedef to a kernel which has the following properties:
-
-<UL>
-<LI>It uses %Cartesian representation.
-<LI>It supports constructions of points from `double` %Cartesian
-coordinates.
-<LI>It provides exact geometric predicates, but inexact geometric
-constructions.
+A typedef to a kernel that has the following properties:
+
+<UL> 
+<LI>It uses %Cartesian representation. 
+<LI>It supports constructions of points from `double` %Cartesian 
+coordinates. 
+<LI>It provides exact geometric predicates, but geometric 
+constructions are not exact in general. 
 </UL>
 
+<h4>Trivial Constructions</h4>  
+
+Some geometric constructions, however, are exact because they only
+copy parameters and do not involve any computations that could lead to
+roundoff errors. We call such a construction <em>trivial</em>. For
+instance, all copy constructors, such as `Point_2::Point_2(const
+Point_2&)`, are trivial constructions. In addition, the following
+constructions in `CGAL::Exact_predicates_inexact_constructions_kernel`
+are trivial:
+
+<ul> 
+<li> `Point_2::Point_2(double,double)`
+<li> `Point_2::Point_2(const Weighted_point_2&)`
+<li> `Point_2::Point_2(Origin)`
+<li> `Weighted_point_2::Weighted_point_2(double,double)`
+<li> `Weighted_point_2::Weighted_point_2(const Point_2&, double = 0)`
+<li> `Weighted_point_2::Weighted_point_2(Origin)`
+<li> `Vector_2::Vector_2(double,double)`
+<li> `Direction_2::Direction_2(double,double)`
+<li> `Direction_2::Direction_2(const Vector_2&)`
+<li> `Line_2::Line_2(double,double,double)`
+<li> `Ray_2::Ray_2(const Point_2&, const Point_2&)`
+<li> `Segment_2::Segment_2(const Point_2&, const Point_2&)`
+<li> `Triangle_2::Triangle_2(const Point_2&, const Point_2&, const Point_2&)`
+<li> `Iso_rectangle_2::Iso_rectangle_2(const Point_2&, const Point_2&)`
+<li> `Iso_rectangle_2::Iso_rectangle_2(const Point_2&, const Point_2&, int)`
+<li> `Iso_rectangle_2::Iso_rectangle_2(const Point_2&, const Point_2&, const Point_2&, const Point_2&)`
+<li> `Iso_rectangle_2::Iso_rectangle_2(const Bbox_2&)`
+<li> `Circle_2::Circle_2(const Point_2&, double, Orientation = COUNTERCLOCKWISE)`
+<li> `Kernel::ConstructPoint_2()(const Weighted_point_2&)`
+<li> `Kernel::ConstructPoint_2()(Origin)`
+<li> `Kernel::ConstructWeightedPoint_2()(const Point_2&, double = 0)`
+<li> `Kernel::ConstructWeightedPoint_2()(Origin)`
+<li> `Kernel::ConstructVector_2()(Origin, const Point_2&)`
+<li> `Kernel::ConstructVector_2()(const Point_2&, Origin)`
+<li> `Kernel::ConstructVector_2()(Null_vector)`
+<li> `Kernel::ConstructDirection_2()(const Vector_2&)`
+<li> `Kernel::ConstructSegment_2()(const Point_2&, const Point_2&)`
+<li> `Kernel::ConstructRay_2()(const Point_2&, const Point_2&)`
+<li> `Kernel::ConstructCircle_2()(const Point_2&, double, Orientation = COUNTERCLOCKWISE)`
+<li> `Kernel::ConstructCircle_2()(const Point_2&, Orientation = COUNTERCLOCKWISE)`
+<li> `Kernel::ConstructTriangle_2()(const Point_2&, const Point_2&, const Point_2&)`
+<li> `Kernel::ConstructIsoRectangle_2()(const Point_2&, const Point_2&)`
+<li> `Kernel::ConstructIsoRectangle_2()(const Point_2&, const Point_2&, int)`
+<li> `Kernel::ConstructIsoRectangle_2()(const Point_2&, const Point_2&, const Point_2&, const Point_2&)`
+<li> `Kernel::ConstructVertex_2()(const Segment_2&, int)`
+<li> `Kernel::ConstructVertex_2()(const Triangle_2&, int)`
+<li> `Kernel::ConstructVertex_2()(const Iso_rectangle_2&, int)`
+<li> `Kernel::ConstructBbox_2()(const Point_2&)`
+<li> `Kernel::ConstructBbox_2()(const Segment_2&)`
+<li> `Kernel::ConstructBbox_2()(const Triangle_2&)`
+<li> `Kernel::ConstructBbox_2()(const Iso_rectangle_2&)`
+<li> `Kernel::ConstructCenter_2()(const Circle_2&)`
+<li> `Kernel::ConstructOppositeVector_2()(const Vector_2&)`
+<li> `Kernel::ConstructOppositeDirection_2()(const Direction_2&)`
+<li> `Kernel::ConstructOppositeSegment_2()(const Segment_2&)`
+<li> `Kernel::ConstructOppositeRay_2()(const Ray_2&)`
+<li> `Kernel::ConstructOppositeLine_2()(const Line_2&)`
+<li> `Kernel::ConstructOppositeTriangle_2()(const Triangle_2&)`
+<li> `Kernel::ConstructOppositeCircle_2()(const Circle_2&)`
+<li> `Kernel::ConstructSource_2()(const Segment_2&)`
+<li> `Kernel::ConstructSource_2()(const Ray_2&)`
+<li> `Kernel::ConstructSecondPoint_2()(const Ray_2&)`
+<li> `Kernel::ConstructTarget_2()(const Target_2&)`
+<li> `Kernel::ConstructMinVertex_2()(const Segment_2&)`
+<li> `Kernel::ConstructMinVertex_2()(const Iso_rectangle_2&)`
+<li> `Kernel::ConstructMaxVertex_2()(const Segment_2&)`
+<li> `Kernel::ConstructMaxVertex_2()(const Iso_rectangle_2&)`
+<li> `Kernel::ComputeWeight_2()(const Weighted_point_2&)`
+<li> `Kernel::ComputeX_2()(const Point_2&)`
+<li> `Kernel::ComputeX_2()(const Vector_2&)`
+<li> `Kernel::ComputeY_2()(const Point_2&)`
+<li> `Kernel::ComputeY_2()(const Vector_2&)`
+<li> `Kernel::ComputeA_2()(const Line_2&)`
+<li> `Kernel::ComputeB_2()(const Line_2&)`
+<li> `Kernel::ComputeC_2()(const Line_2&)`
+<li> `Kernel::ComputeDx_2()(const Direction_2&)`
+<li> `Kernel::ComputeDy_2()(const Direction_2&)`
+<li> `Kernel::ComputeXmin_2()(const Iso_rectangle_2&)`
+<li> `Kernel::ComputeXmax_2()(const Iso_rectangle_2&)`
+<li> `Kernel::ComputeYmin_2()(const Iso_rectangle_2&)`
+<li> `Kernel::ComputeYmax_2()(const Iso_rectangle_2&)`
+<li> `Kernel::ComputeSquaredRadius_2()(const Circle_2&)`
+<li> `Kernel::ComputeSquaredRadius_2()(const Point_2&)`
+<li> `Kernel::CartesianConstIterator_2()(const Point_2&)`
+<li> `Kernel::CartesianConstIterator_2()(const Point_2&, int)`
+<li> `Kernel::CartesianConstIterator_2()(const Vector_2&)`
+<li> `Kernel::CartesianConstIterator_2()(const Vector_2&, int)`
+<li> `Point_3::Point_3(double,double,double)`
+<li> `Point_3::Point_3(const Weighted_point_3&)`
+<li> `Point_3::Point_3(Origin)`
+<li> `Weighted_point_3::Weighted_point_3(double,double)`
+<li> `Weighted_point_3::Weighted_point_3(const Point_3&, double = 0)`
+<li> `Weighted_point_3::Weighted_point_3(Origin)`
+<li> `Vector_3::Vector_3(double,double,double)`
+<li> `Direction_3::Direction_3(double,double,double)`
+<li> `Direction_3::Direction_3(const Vector_3&)`
+<li> `Line_3::Line_3(const Point_3&, const Vector_3&)`
+<li> `Line_3::Line_3(const Point_3&, const Direction_3&)`
+<li> `Plane_3::Plane_3(double,double,double,double)`
+<li> `Circle_3::Circle_3(const Point_3&, double, const Plane_3&)`
+<li> `Sphere_3::Sphere_3(const Point_3&, double, Orientation = COUNTERCLOCKWISE)`
+<li> `Ray_3::Ray_3(const Point_3&, const Point_3&)`
+<li> `Segment_3::Segment_3(const Point_3&, const Point_3&)`
+<li> `Triangle_3::Triangle_3(const Point_3&, const Point_3&, const Point_3&)`
+<li> `Tetrahedron_3::Tetrahedron_3(const Point_3&, const Point_3&, const Point_3&, const Point_3&)`
+<li> `Iso_cuboid_3::Iso_cuboid_3(const Point_3&, const Point_3&)`
+<li> `Iso_cuboid_3::Iso_cuboid_3(const Point_3&, const Point_3&, int)`
+<li> `Iso_cuboid_3::Iso_cuboid_3(const Point_3&, const Point_3&, const Point_3&, const Point_3&, const Point_3&, const Point_3&)`
+<li> `Iso_cuboid_3::Iso_cuboid_3(const Bbox_3&)`
+<li> `Kernel::ConstructPoint_3()(const Weighted_point_3&)`
+<li> `Kernel::ConstructPoint_3()(Origin)`
+<li> `Kernel::ConstructWeightedPoint_3()(const Point_3&, double = 0)`
+<li> `Kernel::ConstructWeightedPoint_3()(Origin)`
+<li> `Kernel::ConstructVector_3()(Origin, const Point_3&)`
+<li> `Kernel::ConstructVector_3()(const Point_3&, Origin)`
+<li> `Kernel::ConstructVector_3()(Null_vector)`
+<li> `Kernel::ConstructDirection_3()(const Vector_3&)`
+<li> `Kernel::ConstructPlane_3()(double,double,double,double)`
+<li> `Kernel::ConstructIsoCuboid_3()(const Point_3&, const Point_3&)`
+<li> `Kernel::ConstructIsoCuboid_3()(const Point_3&, const Point_3&, int)`
+<li> `Kernel::ConstructIsoCuboid_3()(const Point_3&, const Point_3&, const Point_3&, const Point_3&, const Point_3&, const Point_3&)`
+<li> `Kernel::ConstructLine_3()(const Point_3&, const Vector_3&)`
+<li> `Kernel::ConstructLine_3()(const Point_3&, const Direction_3&)`
+<li> `Kernel::ConstructRay_3()(const Point_3&, const Point_3&)`
+<li> `Kernel::ConstructSphere_3()(const Point_3&, double, Orientation = COUNTERCLOCKWISE)`
+<li> `Kernel::ConstructSphere_3()(const Point_3&, Orientation = COUNTERCLOCKWISE)`
+<li> `Kernel::ConstructSegment_3()(const Point_3&, const Point_3&)`
+<li> `Kernel::ConstructTriangle_3()(const Point_3&, const Point_3&, const Point_3&)`
+<li> `Kernel::ConstructTetrahedron_3()(const Point_3&, const Point_3&, const Point_3&, const Point_3&)`
+<li> `Kernel::ConstructCircle_3()(const Point_3&, double, const Plane_3&)`
+<li> `Kernel::ConstructCircle_3()(
+<li> `Kernel::ConstructVertex_3()(const Segment_3&, int)`
+<li> `Kernel::ConstructVertex_3()(const Triangle_3&, int)`
+<li> `Kernel::ConstructVertex_3()(const Tetrahedron_3&, int)`
+<li> `Kernel::ConstructVertex_3()(const Iso_cuboid_3&, int)`
+<li> `Kernel::ConstructSource_3()(const Segment_3&)`
+<li> `Kernel::ConstructSource_3()(const Ray_3&)`
+<li> `Kernel::ConstructTarget_3()(const Target_3&)`
+<li> `Kernel::ConstructMinVertex_3()(const Segment_3&)`
+<li> `Kernel::ConstructMinVertex_3()(const Iso_cuboid_3&)`
+<li> `Kernel::ConstructMaxVertex_3()(const Segment_3&)`
+<li> `Kernel::ConstructMaxVertex_3()(const Iso_cuboid_3&)`
+<li> `Kernel::ConstructBbox_3()(const Point_3&)`
+<li> `Kernel::ConstructBbox_3()(const Segment_3&)`
+<li> `Kernel::ConstructBbox_3()(const Triangle_3&)`
+<li> `Kernel::ConstructBbox_3()(const Tetrahedron_3&)`
+<li> `Kernel::ConstructBbox_3()(const Iso_cuboid_3&)`
+<li> `Kernel::ConstructCenter_3()(const Sphere_3&)`
+<li> `Kernel::ConstructCenter_3()(const Circle_3&)`
+<li> `Kernel::ConstructSecondPoint_3()(const Ray_3&)`
+<li> `Kernel::ConstructOppositeVector_3()(const Vector_3&)`
+<li> `Kernel::ConstructOppositeDirection_3()(const Direction_3&)`
+<li> `Kernel::ConstructOppositeSegment_3()(const Segment_3&)`
+<li> `Kernel::ConstructOppositeRay_3()(const Ray_3&)`
+<li> `Kernel::ConstructOppositeLine_3()(const Line_3&)`
+<li> `Kernel::ConstructOppositeTriangle_3()(const Triangle_3&)`
+<li> `Kernel::ConstructOppositePlane_3()(const Plane_3&)`
+<li> `Kernel::ConstructOppositeSphere_3()(const Sphere_3&)`
+<li> `Kernel::ConstructOppositeCircle_3()(const Circle_3&)`
+<li> `Kernel::ComputeWeight_3()(const Weighted_point_3&)`
+<li> `Kernel::ComputeX_3()(const Point_3&)`
+<li> `Kernel::ComputeX_3()(const Vector_3&)`
+<li> `Kernel::ComputeY_3()(const Point_3&)`
+<li> `Kernel::ComputeY_3()(const Vector_3&)`
+<li> `Kernel::ComputeZ_3()(const Point_3&)`
+<li> `Kernel::ComputeZ_3()(const Vector_3&)`
+<li> `Kernel::ComputeA_3()(const Line_3&)`
+<li> `Kernel::ComputeB_3()(const Line_3&)`
+<li> `Kernel::ComputeC_3()(const Line_3&)`
+<li> `Kernel::ComputeD_3()(const Line_3&)`
+<li> `Kernel::ComputeDx_3()(const Direction_3&)`
+<li> `Kernel::ComputeDy_3()(const Direction_3&)`
+<li> `Kernel::ComputeDz_3()(const Direction_3&)`
+<li> `Kernel::ComputeXmin_3()(const Iso_cuboid_3&)`
+<li> `Kernel::ComputeXmax_3()(const Iso_cuboid_3&)`
+<li> `Kernel::ComputeYmin_3()(const Iso_cuboid_3&)`
+<li> `Kernel::ComputeYmax_3()(const Iso_cuboid_3&)`
+<li> `Kernel::ComputeZmin_3()(const Iso_cuboid_3&)`
+<li> `Kernel::ComputeZmax_3()(const Iso_cuboid_3&)`
+<li> `Kernel::ComputeSquaredRadius_3()(const Sphere_3&)`
+<li> `Kernel::ComputeSquaredRadius_3()(const Circle_3&)`
+<li> `Kernel::ComputeSquaredRadius_3()(const Point_3&)`
+<li> `Kernel::CartesianConstIterator_3()(const Point_3&)`
+<li> `Kernel::CartesianConstIterator_3()(const Point_3&, int)`
+<li> `Kernel::CartesianConstIterator_3()(const Vector_3&)`
+<li> `Kernel::CartesianConstIterator_3()(const Vector_3&, int)`
+</ul>
+
 \cgalModels `Kernel`
 
 \sa `CGAL::Exact_predicates_exact_constructions_kernel`

From 67441a37726221204593c51e604dd9c87fa306ef Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Tue, 25 Apr 2023 17:27:03 +0200
Subject: [PATCH 0251/1398] Convert all CMakeLists.txt to Qt6

---
 .../examples/Boolean_set_operations_2/CMakeLists.txt      | 2 +-
 Installation/test/Installation/CMakeLists.txt             | 8 ++++----
 .../examples/Linear_cell_complex/CMakeLists.txt           | 2 +-
 Mesh_2/examples/Mesh_2/CMakeLists.txt                     | 2 +-
 Nef_3/examples/Nef_3/CMakeLists.txt                       | 2 +-
 .../examples/Periodic_2_triangulation_2/CMakeLists.txt    | 2 +-
 Point_set_3/examples/Point_set_3/CMakeLists.txt           | 2 +-
 Polygon/examples/Polygon/CMakeLists.txt                   | 2 +-
 Polyhedron/demo/Polyhedron/include/CGAL/Use_ssh.h         | 2 +-
 Polyhedron/examples/Polyhedron/CMakeLists.txt             | 2 +-
 .../examples/Straight_skeleton_2/CMakeLists.txt           | 2 +-
 .../test/Straight_skeleton_2/CMakeLists.txt               | 2 +-
 .../examples/Surface_mesh_topology/CMakeLists.txt         | 2 +-
 .../test/Surface_mesh_topology/CMakeLists.txt             | 2 +-
 Triangulation_3/examples/Triangulation_3/CMakeLists.txt   | 4 ++--
 .../examples/Voronoi_diagram_2/CMakeLists.txt             | 4 ++--
 16 files changed, 21 insertions(+), 21 deletions(-)

diff --git a/Boolean_set_operations_2/examples/Boolean_set_operations_2/CMakeLists.txt b/Boolean_set_operations_2/examples/Boolean_set_operations_2/CMakeLists.txt
index f24ead2e8bd4..f01d9597d925 100644
--- a/Boolean_set_operations_2/examples/Boolean_set_operations_2/CMakeLists.txt
+++ b/Boolean_set_operations_2/examples/Boolean_set_operations_2/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Boolean_set_operations_2_Examples)
 
-find_package(CGAL REQUIRED COMPONENTS Core OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED COMPONENTS Core OPTIONAL_COMPONENTS Qt6)
 
 # create a target per cppfile
 file(
diff --git a/Installation/test/Installation/CMakeLists.txt b/Installation/test/Installation/CMakeLists.txt
index 2560f75d5c8d..d65c89d3dacc 100644
--- a/Installation/test/Installation/CMakeLists.txt
+++ b/Installation/test/Installation/CMakeLists.txt
@@ -79,7 +79,7 @@ else()
 endif()
 
 if(WITH_CGAL_Qt5)
-  find_package(Qt5 QUIET COMPONENTS Core)
+  find_package(Qt6 QUIET COMPONENTS Core)
   if(Qt5_FOUND)
     create_link_to_program(CGAL_Qt5)
   endif()
@@ -146,7 +146,7 @@ set_tests_properties(
   test_find_package_version_fail-exact
   PROPERTIES WILL_FAIL TRUE)
 
-find_package(CGAL COMPONENTS Qt5)
+find_package(CGAL COMPONENTS Qt6)
 
 file(MAKE_DIRECTORY "${NON_STANDARD_INSTALL_PREFIX}/non_standard_install")
 file(MAKE_DIRECTORY ${NON_STANDARD_INSTALL_PREFIX}/non_standard_build)
@@ -196,7 +196,7 @@ else()#CGAL_BRANCH_BUILD
 endif()#CGAL_BRANCH_BUILD
 list(APPEND test_config_lst "test_config_file_2")
 
-#configure cgal for a non standard install without qt5
+#configure cgal for a non standard install without Qt6
 get_filename_component(CORRECT_INSTALL_PATH "${NON_STANDARD_INSTALL_PREFIX}/non_standard_install/dummy.txt" DIRECTORY)
 add_test(NAME config_non_standard_cgal
   COMMAND ${CMAKE_COMMAND} ${GENERATOR} ${INIT_FILE} -DCMAKE_BUILD_TYPE=Release -DCMAKE_INSTALL_PREFIX=${CORRECT_INSTALL_PATH} -DCGAL_INSTALL_LIB_DIR=lib
@@ -215,7 +215,7 @@ WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_3")
 list(APPEND test_config_lst "test_config_file_3")
 
 if(CGAL_Qt5_FOUND)
-  #configure cgal for a non standard install with qt5
+  #configure cgal for a non standard install with Qt6
   add_test(NAME config_non_standard_cgal_qt5
     COMMAND ${CMAKE_COMMAND} ${INIT_FILE} -DCMAKE_BUILD_TYPE=Release -DCMAKE_INSTALL_PREFIX=${NON_STANDARD_INSTALL_PREFIX}/non_standard_install_qt5 -DCGAL_INSTALL_LIB_DIR=lib
     "${CGAL_SOURCE_DIR}"
diff --git a/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt b/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt
index d0ed1c3a028c..320149215f20 100644
--- a/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt
+++ b/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Linear_cell_complex_Examples)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # For Gprof.
 # ADD_DEFINITIONS("-pg")
diff --git a/Mesh_2/examples/Mesh_2/CMakeLists.txt b/Mesh_2/examples/Mesh_2/CMakeLists.txt
index b42d588216a2..949c376ecbb7 100644
--- a/Mesh_2/examples/Mesh_2/CMakeLists.txt
+++ b/Mesh_2/examples/Mesh_2/CMakeLists.txt
@@ -1,7 +1,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Mesh_2_Examples)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # create a target per cppfile
 file(
diff --git a/Nef_3/examples/Nef_3/CMakeLists.txt b/Nef_3/examples/Nef_3/CMakeLists.txt
index 8d88f56728f6..479f814c4103 100644
--- a/Nef_3/examples/Nef_3/CMakeLists.txt
+++ b/Nef_3/examples/Nef_3/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Nef_3_Examples)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # create a target per cppfile
 file(
diff --git a/Periodic_2_triangulation_2/examples/Periodic_2_triangulation_2/CMakeLists.txt b/Periodic_2_triangulation_2/examples/Periodic_2_triangulation_2/CMakeLists.txt
index 0acef682baaf..8eb15e9dc00d 100644
--- a/Periodic_2_triangulation_2/examples/Periodic_2_triangulation_2/CMakeLists.txt
+++ b/Periodic_2_triangulation_2/examples/Periodic_2_triangulation_2/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Periodic_2_triangulation_2_Examples)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # create a target per cppfile
 file(
diff --git a/Point_set_3/examples/Point_set_3/CMakeLists.txt b/Point_set_3/examples/Point_set_3/CMakeLists.txt
index b26633c293a3..cfd4152dd57d 100644
--- a/Point_set_3/examples/Point_set_3/CMakeLists.txt
+++ b/Point_set_3/examples/Point_set_3/CMakeLists.txt
@@ -5,7 +5,7 @@ cmake_minimum_required(VERSION 3.1...3.23)
 project(Point_set_3_Examples)
 
 # CGAL and its components
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 create_single_source_cgal_program("point_set.cpp")
 create_single_source_cgal_program("point_set_property.cpp")
diff --git a/Polygon/examples/Polygon/CMakeLists.txt b/Polygon/examples/Polygon/CMakeLists.txt
index c9fdf0aa007a..d3d48d57fc4f 100644
--- a/Polygon/examples/Polygon/CMakeLists.txt
+++ b/Polygon/examples/Polygon/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Polygon_Examples)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # create a target per cppfile
 file(
diff --git a/Polyhedron/demo/Polyhedron/include/CGAL/Use_ssh.h b/Polyhedron/demo/Polyhedron/include/CGAL/Use_ssh.h
index d006e6704feb..b0309c3917c8 100644
--- a/Polyhedron/demo/Polyhedron/include/CGAL/Use_ssh.h
+++ b/Polyhedron/demo/Polyhedron/include/CGAL/Use_ssh.h
@@ -2,8 +2,8 @@
 #define USE_SSH_H
 #include <libssh/libsshpp.hpp>
 #include <vector>
+#include <QtCore/qcontainerfwd.h>
 
-class QStringList;
 
 namespace CGAL{
 namespace ssh_internal{
diff --git a/Polyhedron/examples/Polyhedron/CMakeLists.txt b/Polyhedron/examples/Polyhedron/CMakeLists.txt
index 207f712b3231..bdec4ea6e90a 100644
--- a/Polyhedron/examples/Polyhedron/CMakeLists.txt
+++ b/Polyhedron/examples/Polyhedron/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Polyhedron_Examples)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # create a target per cppfile
 file(
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/CMakeLists.txt b/Straight_skeleton_2/examples/Straight_skeleton_2/CMakeLists.txt
index c6e8c6c0d51e..928a4c2f0e82 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/CMakeLists.txt
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/CMakeLists.txt
@@ -5,7 +5,7 @@ cmake_minimum_required(VERSION 3.1...3.23)
 project( Straight_skeleton_2_Examples )
 
 
-find_package(CGAL REQUIRED COMPONENTS Qt5 Core)
+find_package(CGAL REQUIRED COMPONENTS Qt6 Core)
 
 # create a target per cppfile
 file(GLOB cppfiles RELATIVE ${CMAKE_CURRENT_SOURCE_DIR} ${CMAKE_CURRENT_SOURCE_DIR}/*.cpp)
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt b/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt
index 34257e84946d..7d4b7c35b07a 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Straight_skeleton_2_Tests)
 
-find_package(CGAL REQUIRED COMPONENTS Qt5 Core)
+find_package(CGAL REQUIRED COMPONENTS Qt6 Core)
 
 include_directories(BEFORE "include")
 
diff --git a/Surface_mesh_topology/examples/Surface_mesh_topology/CMakeLists.txt b/Surface_mesh_topology/examples/Surface_mesh_topology/CMakeLists.txt
index 778aafba88fe..b331761128f0 100644
--- a/Surface_mesh_topology/examples/Surface_mesh_topology/CMakeLists.txt
+++ b/Surface_mesh_topology/examples/Surface_mesh_topology/CMakeLists.txt
@@ -1,7 +1,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Surface_mesh_topology_Examples)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # add_definitions(-DCGAL_TRACE_PATH_TESTS)
 # add_definitions(-DCGAL_TRACE_CMAP_TOOLS)
diff --git a/Surface_mesh_topology/test/Surface_mesh_topology/CMakeLists.txt b/Surface_mesh_topology/test/Surface_mesh_topology/CMakeLists.txt
index 904303a77e8d..203721628be9 100644
--- a/Surface_mesh_topology/test/Surface_mesh_topology/CMakeLists.txt
+++ b/Surface_mesh_topology/test/Surface_mesh_topology/CMakeLists.txt
@@ -1,7 +1,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Surface_mesh_topology_Tests)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # add_definitions(-DCGAL_TRACE_PATH_TESTS)
 # add_definitions(-DCGAL_TRACE_CMAP_TOOLS)
diff --git a/Triangulation_3/examples/Triangulation_3/CMakeLists.txt b/Triangulation_3/examples/Triangulation_3/CMakeLists.txt
index 4519992969f5..9aa0e8f4401f 100644
--- a/Triangulation_3/examples/Triangulation_3/CMakeLists.txt
+++ b/Triangulation_3/examples/Triangulation_3/CMakeLists.txt
@@ -1,7 +1,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Triangulation_3_Examples)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 include_directories(BEFORE "../../include")
 
@@ -26,7 +26,7 @@ create_single_source_cgal_program("draw_triangulation_3.cpp")
 if(CGAL_Qt5_FOUND)
   target_link_libraries(draw_triangulation_3 PUBLIC CGAL::CGAL_Basic_viewer)
 else()
-  message(STATUS "NOTICE: The example 'draw_triangulation_3' requires Qt5, and will not be compiled.")
+  message(STATUS "NOTICE: The example 'draw_triangulation_3' requires Qt6, and will not be compiled.")
 endif()
 
 find_package(TBB QUIET)
diff --git a/Voronoi_diagram_2/examples/Voronoi_diagram_2/CMakeLists.txt b/Voronoi_diagram_2/examples/Voronoi_diagram_2/CMakeLists.txt
index ea1bf322bf54..308963700a5b 100644
--- a/Voronoi_diagram_2/examples/Voronoi_diagram_2/CMakeLists.txt
+++ b/Voronoi_diagram_2/examples/Voronoi_diagram_2/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Voronoi_diagram_2_Examples)
 
-find_package(CGAL REQUIRED QUIET OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED QUIET OPTIONAL_COMPONENTS Qt6)
 
 # create a target per cppfile
 file(
@@ -18,5 +18,5 @@ endforeach()
 if(CGAL_Qt5_FOUND)
   target_link_libraries(draw_voronoi_diagram_2 PUBLIC CGAL::CGAL_Basic_viewer)
 else()
-  message(STATUS "NOTICE: The Qt5 library was not found. The example 'draw_voronoi_diagram_2' will not be compiled.")
+  message(STATUS "NOTICE: The Qt6 library was not found. The example 'draw_voronoi_diagram_2' will not be compiled.")
 endif()

From c9a683bf5488fdd8afa886a9237740e4ddbfa835 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 26 Apr 2023 10:17:58 +0200
Subject: [PATCH 0252/1398] Start to reintroduce last master modifications

---
 .../Combinatorial_map/Combinatorial_map.txt   |  4 +-
 .../Concepts/CombinatorialMap.h               |  2 +-
 .../Combinatorial_map/Concepts/GenericMap.h   | 12 +--
 .../map_3_dynamic_onmerge.cpp                 |  2 +-
 .../include/CGAL/Cell_attribute.h             | 14 +--
 .../include/CGAL/Cell_attribute_with_id.h     |  6 +-
 .../include/CGAL/Combinatorial_map.h          | 18 ++--
 .../Combinatorial_map_copy_functors.h         |  6 +-
 .../Combinatorial_map_group_functors.h        | 11 ++-
 .../Combinatorial_map_internal_functors.h     |  4 +-
 .../internal/Combinatorial_map_utility.h      | 10 +-
 .../CGAL/Combinatorial_map_iterators_base.h   |  2 +-
 .../CGAL/Combinatorial_map_save_load.h        |  6 +-
 .../Combinatorial_map_storages_with_index.h   |  9 ++
 .../CGAL/Compact_container_with_index.h       |  9 +-
 Combinatorial_map/include/CGAL/Dart.h         |  2 +-
 .../include/CGAL/Info_for_cell_attribute.h    |  4 +-
 .../test/Combinatorial_map/CMakeLists.txt     |  8 ++
 .../cmap_test_split_attribute.cpp             | 92 +++++++++++++++++++
 .../Generalized_map/Concepts/GeneralizedMap.h |  2 +-
 .../doc/Generalized_map/Generalized_map.txt   |  4 +-
 .../gmap_3_dynamic_onmerge.cpp                |  2 +-
 .../include/CGAL/Generalized_map.h            | 51 ++++++----
 .../internal/Generalized_map_group_functors.h |  9 +-
 .../Generalized_map_storages_with_index.h     |  7 ++
 .../test/Generalized_map/CMakeLists.txt       | 20 ++--
 .../gmap_test_split_attribute.cpp             | 92 +++++++++++++++++++
 .../cmake/FindCGAL.cmake                      |  2 +-
 .../surface_mesh/Surface_mesh.h               |  2 +-
 .../surface_mesh/Vector.h                     |  2 +-
 .../Linear_cell_complex_3/CMakeLists.txt      |  7 --
 .../cmake/ACGCommon.cmake                     |  2 +-
 .../cmake/FindGoogleTest.cmake                |  2 +-
 Linear_cell_complex/benchmark/README.TXT      | 10 +-
 .../demo/Linear_cell_complex/CMakeLists.txt   |  5 +-
 .../demo/Linear_cell_complex/MainWindow.cpp   |  2 +-
 .../examples/Linear_cell_complex/README.txt   |  2 +-
 .../test/Linear_cell_complex/CMakeLists.txt   |  7 +-
 .../Linear_cell_complex_3_test.h              |  3 -
 39 files changed, 337 insertions(+), 117 deletions(-)
 create mode 100644 Combinatorial_map/test/Combinatorial_map/cmap_test_split_attribute.cpp
 create mode 100644 Generalized_map/test/Generalized_map/gmap_test_split_attribute.cpp

diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
index 423f49aae1c0..2e36037ea231 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
@@ -115,7 +115,7 @@ To answer this need, a combinatorial map allows to create <I>attributes</I> whic
 <LI>an <I>i</I>-cell may have no associated <I>i</I>-attribute.
 </UL>
 
-Since <I>i</I>-cells are not explicitely represented in combinatorial maps, the association between <I>i</I>-cells and <I>i</I>-attributes is transferred to darts: if attribute <I>a</I> is associated to <I>i</I>-cell <I>c</I>, all the darts belonging to <I>c</I> are associated to <I>a</I>.
+Since <I>i</I>-cells are not explicitly represented in combinatorial maps, the association between <I>i</I>-cells and <I>i</I>-attributes is transferred to darts: if attribute <I>a</I> is associated to <I>i</I>-cell <I>c</I>, all the darts belonging to <I>c</I> are associated to <I>a</I>.
 
 We can see two examples of combinatorial maps having some attributes in \cgalFigureRef{fig_cmap_with_attribs}. In the first example (Left), a 2D combinatorial map has 1-attributes containing a float, for example corresponding to the length of the associated 1-cell, and 2-attributes containing a color in RGB format. In the second example (Right), a 3D combinatorial map has 2-attributes containing a color in RGB format.
 
@@ -280,7 +280,7 @@ There are also two different classes of ranges containing one dart per <I>i</I>-
 
 The iterators of the \link GenericMap::Dart_range `Dart_range`\endlink are bidirectional iterators,  while the iterators of the other four ranges are forward iterators.  The value type of all these iterators is `Dart` thus all these iterators can be directly used as \link GenericMap::Dart_descriptor `Dart_descriptor`\endlink.
 
-Additionally, there is a range over non void <I>i</I>-attributes: \link GenericMap::Attribute_range `Attribute_range<i>::type`\endlink, having a bidirectional iterator with value type \link GenericMap::Attribute_type Attribute_type<i>::type`\endlink.
+Additionally, there is a range over non void <I>i</I>-attributes: \link GenericMap::Attribute_range `Attribute_range<i>::type`\endlink, having a bidirectional iterator with value type \link GenericMap::Attribute_type `Attribute_type<i>::type`\endlink.
 
 For each range, there is an associated const range, a model of the `ConstRange` concept. You can find some examples of ranges in Section \ref ssecexample3DCM "A 3D Combinatorial Map".
 
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
index 007d8b424c56..03f492d1b081 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
@@ -4,7 +4,7 @@
 
 The concept `CombinatorialMap` defines a <I>d</I>-dimensional combinatorial map.
 
-\cgalRefines `GenericMap`
+\cgalRefines{GenericMap}
 
 \cgalHasModel \link CGAL::Combinatorial_map `CGAL::Combinatorial_map<d,Items,Alloc>`\endlink
 
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
index 31bcaf161d65..790d378bd074 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
@@ -4,7 +4,7 @@
 
 The concept `GenericMap` defines a <I>d</I>-dimensional generic map. This concept is defined only to factorize the common notions between \link CombinatorialMap `CombinatorialMap`\endlink and \link GeneralizedMap `GeneralizedMap`\endlink concepts.
 
-\cgalRefines DefaultConstructible
+\cgalRefines{DefaultConstructible}
 
 A generic map has a set of darts <I>D</I>, and functions \f$ f_0\f$,\f$ \ldots\f$,\f$ f_{d}\f$ that link these darts between them.
 
@@ -450,28 +450,28 @@ template <unsigned int i>
 const Attribute_type<i>::type::Info& info_of_attribute(typename Attribute_const_descriptor<i>::type ah) const;
 
 /*!
-A shorcut for \link GenericMap::info_of_attribute `info_of_attribute<i>`\endlink`(`\link GenericMap::attribute `attribute<i>`\endlink`(adart))`.
+A shortcut for \link GenericMap::info_of_attribute `info_of_attribute<i>`\endlink`(`\link GenericMap::attribute `attribute<i>`\endlink`(adart))`.
 \pre \link GenericMap::attribute `attribute<i>`\endlink`(adart)!=nullptr`.
 */
 template<unsigned int i>
 typename Attribute_type<i>::type::Info & info(Dart_descriptor adart);
 
 /*!
-A shorcut for \link GenericMap::info_of_attribute(typename Attribute_const_descriptor<i>::type)const `info_of_attribute<i>`\endlink`(`\link GenericMap::attribute(Dart_const_descriptor)const `attribute<i>`\endlink`(adart))` for const descriptor.
+A shortcut for \link GenericMap::info_of_attribute(typename Attribute_const_descriptor<i>::type)const `info_of_attribute<i>`\endlink`(`\link GenericMap::attribute(Dart_const_descriptor)const `attribute<i>`\endlink`(adart))` for const descriptor.
 \pre \link GenericMap::attribute(Dart_const_descriptor)const `attribute<i>`\endlink`(adart)!=nullptr`.
 */
 template<unsigned int i>
 const typename Attribute_type<i>::type::Info & info(Dart_const_descriptor adart) const;
 
 /*!
-A shorcut for \link GenericMap::dart_of_attribute `dart_of_attribute<i>`\endlink`(`\link GenericMap::attribute `attribute<i>`\endlink`(adart))`.
+A shortcut for \link GenericMap::dart_of_attribute `dart_of_attribute<i>`\endlink`(`\link GenericMap::attribute `attribute<i>`\endlink`(adart))`.
 \pre `attribute<i>(adart)!=nullptr`.
 */
 template<unsigned int i>
 Dart_descriptor & dart(Dart_descriptor adart);
 
 /*!
-A shorcut for \link GenericMap::dart_of_attribute(typename Attribute_const_descriptor<i>::type)const `dart_of_attribute<i>`\endlink`(`\link GenericMap::attribute(Dart_const_descriptor)const `attribute<i>`\endlink`(adart))` for const descriptor.
+A shortcut for \link GenericMap::dart_of_attribute(typename Attribute_const_descriptor<i>::type)const `dart_of_attribute<i>`\endlink`(`\link GenericMap::attribute(Dart_const_descriptor)const `attribute<i>`\endlink`(adart))` for const descriptor.
 \pre `attribute<i>(adart)!=nullptr`.
 */
 template<unsigned int i>
@@ -679,7 +679,7 @@ Returns the status of the management of the attributes of the generic map. <code
 bool are_attributes_automatically_managed() const;
 
 /*!
-Set the status of the managment of the attributes of the generic map.
+Set the status of the management of the attributes of the generic map.
 
 \cgalAdvancedBegin
 After calling `set_automatic_attributes_management(false)`, all high level operations will not update non void attributes, until the call of `set_automatic_attributes_management(true)`. The call of `set_automatic_attributes_management(true)` call the \link GenericMap::correct_invalid_attributes `correct_invalid_attributes()`\endlink function.
diff --git a/Combinatorial_map/examples/Combinatorial_map/map_3_dynamic_onmerge.cpp b/Combinatorial_map/examples/Combinatorial_map/map_3_dynamic_onmerge.cpp
index 1629c0b7f31d..5cbb728744b8 100644
--- a/Combinatorial_map/examples/Combinatorial_map/map_3_dynamic_onmerge.cpp
+++ b/Combinatorial_map/examples/Combinatorial_map/map_3_dynamic_onmerge.cpp
@@ -40,7 +40,7 @@ struct Split_functor
   // operator() automatically called after a split.
   void operator()(Face_attribute& ca1, Face_attribute& ca2)
   {
-     // We need to reinitalize the weight of the two faces
+     // We need to reinitialize the weight of the two faces
     CMap_3::size_type nb1=mmap.darts_of_cell<2>(ca1.dart()).size();
     CMap_3::size_type nb2=mmap.darts_of_cell<2>(ca2.dart()).size();
     mmap.info<2>(ca1.dart())*=(double(nb1)/(nb1+nb2));
diff --git a/Combinatorial_map/include/CGAL/Cell_attribute.h b/Combinatorial_map/include/CGAL/Cell_attribute.h
index 091fb5730a1d..0c931f0e30d9 100644
--- a/Combinatorial_map/include/CGAL/Cell_attribute.h
+++ b/Combinatorial_map/include/CGAL/Cell_attribute.h
@@ -176,11 +176,11 @@ struct Init_id;
     { return !operator==(other); }
 
   protected:
-    /// Contructor without parameter.
+    /// Constructor without parameter.
     Cell_attribute_without_info(): mrefcounting(0), m_for_cc(Refs::null_descriptor)
     {}
 
-    /// Copy contructor.
+    /// Copy constructor.
     Cell_attribute_without_info(const Cell_attribute_without_info& acell):
       mrefcounting(acell.mrefcounting)
     {}
@@ -301,12 +301,12 @@ struct Init_id;
     { return !operator==(other); }
 
   protected:
-    /// Contructor without parameter.
+    /// Constructor without parameter.
     Cell_attribute_without_info() : mdart(Refs::null_descriptor),
                                     mrefcounting(0)
     {}
 
-    /// Copy contructor.
+    /// Copy constructor.
     Cell_attribute_without_info(const Cell_attribute_without_info& acell):
       mdart(acell.mdart),
       mrefcounting(acell.mrefcounting)
@@ -398,7 +398,7 @@ struct Init_id;
     typedef void                             Info;
 
   protected:
-    /// Default contructor.
+    /// Default constructor.
     Cell_attribute()
     {}
   };
@@ -461,11 +461,11 @@ struct Init_id;
     { return !operator==(other); }
 
   protected:
-    /// Default contructor.
+    /// Default constructor.
     Cell_attribute()
     {}
 
-    /// Contructor with an info in parameter.
+    /// Constructor with an info in parameter.
     Cell_attribute(const Info_& ainfo) :
       Info_for_cell_attribute<Info_>(ainfo)
     {}
diff --git a/Combinatorial_map/include/CGAL/Cell_attribute_with_id.h b/Combinatorial_map/include/CGAL/Cell_attribute_with_id.h
index 768e0b82aeb5..7366d1189284 100644
--- a/Combinatorial_map/include/CGAL/Cell_attribute_with_id.h
+++ b/Combinatorial_map/include/CGAL/Cell_attribute_with_id.h
@@ -42,11 +42,11 @@ namespace CGAL {
     friend class Concurrent_compact_container;
 
   protected:
-    /// Default contructor.
+    /// Default constructor.
     Cell_attribute_with_id()
     {}
 
-    /// Contructor with an info in parameter.
+    /// Constructor with an info in parameter.
     Cell_attribute_with_id(const Info_& ainfo) :
       Cell_attribute<Refs, Info_, Tag_, OnMerge, OnSplit, Tag_true>(ainfo)
     {}
@@ -64,7 +64,7 @@ namespace CGAL {
     friend class Concurrent_compact_container;
 
   protected:
-    /// Default contructor.
+    /// Default constructor.
     Cell_attribute_with_id()
     {}
   };
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map.h b/Combinatorial_map/include/CGAL/Combinatorial_map.h
index 77af5bbc736c..ee80b2978c2c 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map.h
@@ -219,7 +219,7 @@ namespace CGAL {
      *  @param dartinfoconverter functor to transform original information of darts into information of copies
      *  @param pointconverter functor to transform points in original map into points of copies.
      *  @param copy_perforated_darts true to copy also darts marked perforated (if any)
-     *  @param mark_perforated_darts true to mark darts wich are copies of perforated darts (if any)
+     *  @param mark_perforated_darts true to mark darts which are copies of perforated darts (if any)
      *  @post *this is valid.
      */
     template <typename CMap2, typename Dart_descriptor_2,
@@ -1590,7 +1590,7 @@ namespace CGAL {
        std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers).emplace(args...);
      // Reinitialize the ref counting of the new attribute. This is normally
-     // not required except if create_attribute is used as "copy contructor".
+     // not required except if create_attribute is used as "copy constructor".
      this->template init_attribute_ref_counting<i>(res);
      internal::Init_id<typename Attribute_range<i>::type>::run
          (this->template attributes<i>(), res);
@@ -1639,8 +1639,8 @@ namespace CGAL {
       CGAL_static_assertion(i<=dimension);
       CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
                   "set_attribute<i> but i-attributes are disabled");
-
-      for (typename Dart_of_cell_range<i>::iterator it(*this, dh); it.cont(); ++it)
+      for (typename Dart_of_cell_range<i>::iterator it(*this, dh);
+           it.cont(); ++it)
       {
         this->template set_dart_attribute<i>(it, ah);
       }
@@ -3543,7 +3543,7 @@ namespace CGAL {
                   <Self, Map2, 0>::run(*this, map2, current, other);
             }
 
-            // We test if the injection is valid with its neighboors.
+            // We test if the injection is valid with its neighbors.
             // We go out as soon as it is not satisfied.
             for (i=0; match && i<=dimension; ++i)
             {
@@ -3772,7 +3772,7 @@ namespace CGAL {
 
     /** Test if a face is a combinatorial polygon of length alg
      *  (a cycle of alg darts beta1 links together).
-     * @param adart an intial dart
+     * @param adart an initial dart
      * @return true iff the face containing adart is a polygon of length alg.
      */
     bool is_face_combinatorial_polygon(Dart_const_descriptor adart,
@@ -3858,7 +3858,7 @@ namespace CGAL {
     }
 
     /** Test if a volume is a combinatorial tetrahedron.
-     * @param adart an intial dart
+     * @param adart an initial dart
      * @return true iff the volume containing adart is a combinatorial tetrahedron.
      */
     bool is_volume_combinatorial_tetrahedron(Dart_const_descriptor d1) const
@@ -3951,7 +3951,7 @@ namespace CGAL {
     }
 
     /** Test if a volume is a combinatorial hexahedron.
-     * @param adart an intial dart
+     * @param adart an initial dart
      * @return true iff the volume containing adart is a combinatorial hexahedron.
      */
     bool is_volume_combinatorial_hexahedron(Dart_const_descriptor d1) const
@@ -4145,7 +4145,7 @@ namespace CGAL {
     }
 
     /** Insert a vertex in the given 2-cell which is split in triangles,
-     *  once for each inital edge of the facet.
+     *  once for each initial edge of the facet.
      * @param adart a dart of the facet to triangulate.
      * @param update_attributes a boolean to update the enabled attributes
      *        (deprecated, now we use are_attributes_automatically_managed())
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_copy_functors.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_copy_functors.h
index d3d11cbdfc7a..5cbf7b7861a6 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_copy_functors.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_copy_functors.h
@@ -41,7 +41,7 @@ namespace internal
 // ****************************************************************************
 // Map1 is the existing map, to convert into map2.
 // Functor called only when both i-attributes have non void info.
-// General cases when both info are differents.
+// General cases when both info are different.
 template< typename Map1, typename Map2, unsigned int i,
           typename Info1=typename Map1::template
           Attribute_type<i>::type::Info,
@@ -439,7 +439,7 @@ struct Default_converter_cmap_attributes
 };
 // ****************************************************************************
 // Cast converter always copy attributes, doing a cast. This can work only
-// if both types are convertible and this is user responsability
+// if both types are convertible and this is user responsibility
 // to use it only in this case.
 template< typename Map1, typename Map2, unsigned int i>
 struct Cast_converter_cmap_attributes
@@ -480,7 +480,7 @@ struct Default_converter_dart_info<Map1, Map2, Info, Info>
 };
 // ****************************************************************************
 // Cast converter of dart info. This can work only if both types are
-// convertible and this is user responsability to use it only in this case.
+// convertible and this is user responsibility to use it only in this case.
 template< typename Map1, typename Map2>
 struct Cast_converter_dart_info
 {
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
index 6fd93934b2c1..d86c152c503a 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
@@ -33,7 +33,7 @@
  * Group_attribute_functor<CMap> to group the <i>-attributes of two
  *    given i-cells (except for j-adim). If one i-attribute is nullptr, we set the
  *    darts of its i-cell to the second attribute. If both i-attributes are
- *    non nullptr, we overide all the i-attribute of the second i-cell to the
+ *    non nullptr, we override all the i-attribute of the second i-cell to the
  *    first i-attribute.
  *
  * Group_neighboor_attribute to group the <i>-attributes of beta_i(d1) and
@@ -609,6 +609,15 @@ void test_split_attribute_functor_one_dart
   Attribute_descriptor_i a1 = amap.template attribute<i>(adart);
   if ( found_attributes.is_defined(a1) )
   {  // Here the attribute was already present in the hash_map
+
+    // We need to call reserve for the cc with index case. Indeed, if the vector
+    // is reallocated, the reference returned by get_attribute<i>(a1) will be
+    // invalidated, and the copy will be wrong. Note that there is no overhead
+    // since the creation of the attribute need one allocation.
+    amap.template attributes<i>().reserve(amap.template attributes<i>().size()+1);
+
+    // Now we are sure that the creation of a new attribute will not imply
+    // a realloc.
     Attribute_descriptor_i a2 = amap.template
       create_attribute<i>(amap.template get_attribute<i>(a1));
 
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h
index 5fe14f3217b2..3e0b147942c5 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h
@@ -39,7 +39,7 @@
  *    valid (all its darts are linked to the same attribute, no other dart is
  *    linked with this attribute).
  *
- * internal::Count_cell_functor<CMap> to count the nuber of i-cells.
+ * internal::Count_cell_functor<CMap> to count the number of i-cells.
  *
  * internal::Count_bytes_one_attribute_functor<CMap> to count the memory
  *    occupied by i-attributes.
@@ -66,7 +66,7 @@
  * internal::Test_is_same_attribute_functor<Map1, Map2> to test if two
  *   i-attributes of two darts are isomorphic (ie they have the same info).
  *
- * inernal::Test_is_same_attribute_point_functor<Map1, Map2, i> to test if
+ * internal::Test_is_same_attribute_point_functor<Map1, Map2, i> to test if
  *   the point of two i-attributes are equal.
  *
  * internal::Reverse_orientation_of_map_functor<CMap> to reverse the
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
index 884c4f80b981..4488da87fe19 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_utility.h
@@ -533,7 +533,7 @@ namespace CGAL
       struct Attribute_type<d,0>
       { typedef Void type; };
 
-      // Helper class allowing to retreive the d-cell-descriptor attribute
+      // Helper class allowing to retrieve the d-cell-descriptor attribute
       template<int d, class Type=typename Attribute_type<d>::type,
                typename WithIndex=typename CMap::Use_index>
       struct Attribute_descriptor
@@ -550,7 +550,7 @@ namespace CGAL
       struct Attribute_descriptor<d, CGAL::Void, CGAL::Tag_true>
       { typedef typename CMap::Dart_index type; };
 
-      // Helper class allowing to retreive the d-cell-const descriptor attribute
+      // Helper class allowing to retrieve the d-cell-const descriptor attribute
       template<int d, class Type=typename Attribute_type<d>::type>
       struct Attribute_const_descriptor
       {
@@ -562,7 +562,7 @@ namespace CGAL
       struct Attribute_const_descriptor<d, CGAL::Void>
       { typedef CGAL::Void* type; };
 
-      // Helper class allowing to retreive the d-cell-iterator attribute
+      // Helper class allowing to retrieve the d-cell-iterator attribute
       template<int d, class Type=typename Attribute_type<d>::type>
       struct Attribute_iterator
       {
@@ -574,7 +574,7 @@ namespace CGAL
       struct Attribute_iterator<d, CGAL::Void>
       { typedef CGAL::Void* type; };
 
-      // Helper class allowing to retreive the d-cell-const descriptor attribute
+      // Helper class allowing to retrieve the d-cell-const descriptor attribute
       template<int d, class Type=typename Attribute_type<d>::type>
       struct Attribute_const_iterator
       {
@@ -586,7 +586,7 @@ namespace CGAL
       struct Attribute_const_iterator<d, CGAL::Void>
       { typedef CGAL::Void* type; };
 
-      // Helper class allowing to retreive the d-cell-attribute range
+      // Helper class allowing to retrieve the d-cell-attribute range
       template<int d, class Type=typename Attribute_type<d>::type>
       struct Attribute_range
       {
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h b/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
index eeb2c40b1460..0b2c39bc7204 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
@@ -28,7 +28,7 @@ namespace CGAL {
    * Basic classes that serve as tools for definition of iterators.
    There are 3 classes:
    *  - CMap_dart_iterator<Map,Const> is the basic generic class defining
-   *    what is an interator on darts.
+   *    what is an iterator on darts.
    *  - CMap_extend_iterator<Map,Ite,Bi> to extend the given iterator by adding
    *    the involution Bi.
    *  - CMap_non_basic_iterator<Map_,Ite> to transform the basic iterator Ite
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_save_load.h b/Combinatorial_map/include/CGAL/Combinatorial_map_save_load.h
index 31e8cff3946a..e691fce122c6 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_save_load.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_save_load.h
@@ -347,7 +347,7 @@ namespace CGAL {
     using boost::property_tree::ptree;
     ptree pt;
 
-    // update pt adding nodes containing attributes informations
+    // update pt adding nodes containing attributes information
     CMap::Helper::template Foreach_enabled_attributes
       <My_functor_cmap_save_attrib<CMap> >::run(const_cast<CMap&>(amap), pt, myDarts);
 
@@ -371,7 +371,7 @@ namespace CGAL {
     tree.put("data", "");
 
     /** First we save general information of the map (by default nothing,
-        the fuction can be specialized by users). */
+        the function can be specialized by users). */
     f(tree);
 
     // map dart => number
@@ -818,7 +818,7 @@ namespace CGAL {
     read_xml(input, pt);
 
     /** First we load general information of the map (by default nothing,
-        the fuction can be specialized by users). */
+        the function can be specialized by users). */
     f(pt);
 
     // Then we load darts and attributes.
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h b/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h
index aad7d6437877..584442412c54 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h
@@ -146,6 +146,8 @@ namespace CGAL {
       { return cit; }
       bool is_used(size_type i) const
       { return mmap.mdarts.is_used(i); }
+      bool owns(size_type i) const
+      { return mmap.mdarts.owns(i); }
     private:
       Self & mmap;
     };
@@ -286,6 +288,13 @@ namespace CGAL {
     {
       CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
                      "copy_attribute<i> called but i-attributes are disabled.");
+      // We need to do a reserve before the emplace in order to avoid a bug of
+      // invalid reference when the container is reallocated.
+      std::get<Helper::template Dimension_index<i>::value>
+          (mattribute_containers).reserve
+          (std::get<Helper::template Dimension_index<i>::value>
+           (mattribute_containers).size()+1);
+
       typename Attribute_descriptor<i>::type res=
         std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers).emplace(get_attribute<i>(ah));
diff --git a/Combinatorial_map/include/CGAL/Compact_container_with_index.h b/Combinatorial_map/include/CGAL/Compact_container_with_index.h
index c3ddb24005be..d3d67c57a88d 100644
--- a/Combinatorial_map/include/CGAL/Compact_container_with_index.h
+++ b/Combinatorial_map/include/CGAL/Compact_container_with_index.h
@@ -755,16 +755,21 @@ class Compact_container_with_index
     return false;
   }
 
-  bool owns_dereferencable(const_iterator cit) const
+  bool owns(size_type i) const
+  { return i<capacity() && is_used(i); }
+
+  bool owns_dereferenceable(const_iterator cit) const
   { return cit!=end() && owns(cit); }
 
+  CGAL_DEPRECATED bool owns_dereferencable(const_iterator cit) const
+  { return owns_dereferenceable(cit); }
+
   /** Reserve method to ensure that the capacity of the Compact_container be
    * greater or equal than a given value n.
    */
   void reserve(size_type n)
   {
     if(capacity_>=n) return;
-    capacity_=n;
     increase_size();
   }
 
diff --git a/Combinatorial_map/include/CGAL/Dart.h b/Combinatorial_map/include/CGAL/Dart.h
index 761e9023249a..3308def61039 100644
--- a/Combinatorial_map/include/CGAL/Dart.h
+++ b/Combinatorial_map/include/CGAL/Dart.h
@@ -241,7 +241,7 @@ namespace CGAL {
     }
 
   protected:
-    /// Neighboors for each dimension +1 (from 0 to dimension).
+    /// Neighbors for each dimension +1 (from 0 to dimension).
     Dart_descriptor mf[dimension+1];
 
     /// Values of Boolean marks.
diff --git a/Combinatorial_map/include/CGAL/Info_for_cell_attribute.h b/Combinatorial_map/include/CGAL/Info_for_cell_attribute.h
index f45b23d76f8a..ba13c664c213 100644
--- a/Combinatorial_map/include/CGAL/Info_for_cell_attribute.h
+++ b/Combinatorial_map/include/CGAL/Info_for_cell_attribute.h
@@ -19,10 +19,10 @@ namespace CGAL {
   class Info_for_cell_attribute
   {
   public:
-    /// Contructor without parameter.
+    /// Constructor without parameter.
     Info_for_cell_attribute()=default; // default => zero-initializing built-in types
 
-    /// Contructor with an info in parameter.
+    /// Constructor with an info in parameter.
     Info_for_cell_attribute(const Info& ainfo) : minfo(ainfo)
     {}
 
diff --git a/Combinatorial_map/test/Combinatorial_map/CMakeLists.txt b/Combinatorial_map/test/Combinatorial_map/CMakeLists.txt
index 94b110c4ac7c..6357af2198d4 100644
--- a/Combinatorial_map/test/Combinatorial_map/CMakeLists.txt
+++ b/Combinatorial_map/test/Combinatorial_map/CMakeLists.txt
@@ -24,9 +24,17 @@ target_compile_definitions(Combinatorial_map_copy_test_index PUBLIC USE_COMPACT_
 target_link_libraries(Combinatorial_map_copy_test_index PUBLIC CGAL CGAL::Data)
 cgal_add_compilation_test(Combinatorial_map_copy_test_index)
 
+create_single_source_cgal_program(cmap_test_split_attribute.cpp)
+
 # Link with OpenMesh if possible
 find_package(OpenMesh QUIET)
 if(TARGET OpenMesh::OpenMesh)
+  message(STATUS "Found OpenMesh")
+
   target_link_libraries(Combinatorial_map_copy_test PRIVATE OpenMesh::OpenMesh)
+  target_compile_definitions(Combinatorial_map_copy_test PRIVATE -DCGAL_USE_OPENMESH)
   target_link_libraries(Combinatorial_map_copy_test_index PRIVATE OpenMesh::OpenMesh)
+  target_compile_definitions(Combinatorial_map_copy_test_index PRIVATE -DCGAL_USE_OPENMESH)
+else()
+  message(STATUS "NOTICE: Tests will not use OpenMesh.")
 endif()
diff --git a/Combinatorial_map/test/Combinatorial_map/cmap_test_split_attribute.cpp b/Combinatorial_map/test/Combinatorial_map/cmap_test_split_attribute.cpp
new file mode 100644
index 000000000000..49e8795eef77
--- /dev/null
+++ b/Combinatorial_map/test/Combinatorial_map/cmap_test_split_attribute.cpp
@@ -0,0 +1,92 @@
+#include <CGAL/Combinatorial_map.h>
+#include <CGAL/Cell_attribute.h>
+#include <vector>
+#include <algorithm>
+#include <string>
+#include <cstdlib>
+
+struct MyInfo
+{
+  MyInfo() :data(1)
+  {}
+
+  MyInfo(int i) :data(i)
+  {}
+
+  int data;
+};
+
+struct Myitem1
+{
+  using Use_index=CGAL::Tag_true; // use indices
+  using Index_type=std::uint16_t; // 16 bits
+  template<class CMap>
+  struct Dart_wrapper
+  {
+    typedef CGAL::Cell_attribute<CMap, MyInfo> attrib;
+    typedef std::tuple<void, void, attrib> Attributes;
+  };
+};
+
+struct Myitem2
+{
+  template<class CMap>
+  struct Dart_wrapper
+  {
+    typedef CGAL::Cell_attribute<CMap, MyInfo> attrib;
+    typedef std::tuple<void, void, attrib> Attributes;
+  };
+};
+
+using CMap1=CGAL::Combinatorial_map<3,Myitem1>;
+using CMap2=CGAL::Combinatorial_map<3,Myitem2>;
+
+#define NB 1000
+template<typename CMap>
+bool test(const std::string& s)
+{
+  bool res=true;
+  CMap m;
+  // 1) create a face and one attribute.
+  typename CMap::Dart_descriptor dd=m.make_combinatorial_polygon(4);
+  m.template set_attribute<2>(dd, m.template create_attribute<2>(2));
+  // 2) Split this face NB times => will create new 2-attributes for new faces
+  for(std::size_t i=0; i<NB; ++i)
+  {
+    typename CMap::Dart_descriptor
+      newd=m.insert_cell_1_in_cell_2(dd, m.next(m.next(dd)));
+    if(m.template attribute<2>(newd)==CMap::null_descriptor)
+    {
+      std::cout<<"ERROR1: "<<s<<": "
+               <<"attribute<2>(newd)==CMap::null_descriptor"<<std::endl;
+      res=false;
+    }
+    else if(m.template info<2>(newd).data!=2)
+    {
+      std::cout<<"ERROR2: "<<s<<": "<<m.template info<2>(newd).data<<std::endl;
+      res=false;
+    }
+
+    newd=m.template opposite<2>(newd);
+    if(m.template attribute<2>(newd)==CMap::null_descriptor)
+    {
+      std::cout<<"ERROR3: "<<s<<": "
+               <<"attribute<2>(newd)==CMap::null_descriptor"<<std::endl;
+      res=false;
+    }
+    else if(m.template info<2>(newd).data!=2)
+    {
+      std::cout<<"ERROR4: "<<s<<": "<<m.template info<2>(newd).data<<std::endl;
+      res=false;
+    }
+  }
+  return res;
+}
+
+int main()
+{
+  if(!test<CMap1>("CMap1") || !test<CMap2>("CMap2"))
+  { return EXIT_FAILURE; }
+
+  return EXIT_SUCCESS;
+}
diff --git a/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h b/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h
index 172e2481899f..91c430a9d914 100644
--- a/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h
+++ b/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h
@@ -4,7 +4,7 @@
 
 The concept `GeneralizedMap` defines a <I>d</I>-dimensional generalized map.
 
-\cgalRefines `GenericMap`
+\cgalRefines{GenericMap}
 
 \cgalHasModel \link CGAL::Generalized_map `CGAL::Generalized_map<d,Items,Alloc>`\endlink
 
diff --git a/Generalized_map/doc/Generalized_map/Generalized_map.txt b/Generalized_map/doc/Generalized_map/Generalized_map.txt
index 0b08884f40ac..491a8c9ed3d3 100644
--- a/Generalized_map/doc/Generalized_map/Generalized_map.txt
+++ b/Generalized_map/doc/Generalized_map/Generalized_map.txt
@@ -117,7 +117,7 @@ To answer this need, a generalized map allows to create <I>attributes</I> which
 <LI>an <I>i</I>-cell may have no associated <I>i</I>-attribute.
 </UL>
 
-Since <I>i</I>-cells are not explicitely represented in generalized maps, the association between <I>i</I>-cells and <I>i</I>-attributes is transferred to darts: if attribute <I>a</I> is associated to <I>i</I>-cell <I>c</I>, all the darts belonging to <I>c</I> are associated to <I>a</I>.
+Since <I>i</I>-cells are not explicitly represented in generalized maps, the association between <I>i</I>-cells and <I>i</I>-attributes is transferred to darts: if attribute <I>a</I> is associated to <I>i</I>-cell <I>c</I>, all the darts belonging to <I>c</I> are associated to <I>a</I>.
 
 We can see two examples of generalized maps having some attributes in \cgalFigureRef{fig_gmap_with_attribs}. In the first example (Left), a 2D generalized map has 1-attributes containing a float, for example corresponding to the length of the associated 1-cell, and 2-attributes containing a color in RGB format. In the second example (Right), a 3D generalized map has 2-attributes containing a color in RGB format.
 
@@ -279,7 +279,7 @@ There are also two different classes of ranges containing one dart per <I>i</I>-
 
 The iterators of the \link GenericMap::Dart_range `Dart_range`\endlink are bidirectional iterators,  while the iterators of the other four ranges are forward iterators.  The value type of all these iterators is `Dart` thus all these iterators can be directly used as \link GenericMap::Dart_descriptor `Dart_descriptor`\endlink.
 
-Additionally, there is a range over non void <I>i</I>-attributes: \link GenericMap::Attribute_range `Attribute_range<i>::type`\endlink, having a bidirectional iterator with value type \link GenericMap::Attribute_type Attribute_type<i>::type`\endlink.
+Additionally, there is a range over non void <I>i</I>-attributes: \link GenericMap::Attribute_range `Attribute_range<i>::type`\endlink, having a bidirectional iterator with value type \link GenericMap::Attribute_type `Attribute_type<i>::type`\endlink.
 
 For each range, there is an associated const range, a model of the `ConstRange` concept. You can find some examples of ranges in Section \ref ssecexample3DGM "A 3D Generalized Map".
 
diff --git a/Generalized_map/examples/Generalized_map/gmap_3_dynamic_onmerge.cpp b/Generalized_map/examples/Generalized_map/gmap_3_dynamic_onmerge.cpp
index 48651e5ef92c..4c8717af339d 100644
--- a/Generalized_map/examples/Generalized_map/gmap_3_dynamic_onmerge.cpp
+++ b/Generalized_map/examples/Generalized_map/gmap_3_dynamic_onmerge.cpp
@@ -40,7 +40,7 @@ struct Split_functor
   // operator() automatically called after a split.
   void operator()(Face_attribute& ca1, Face_attribute& ca2)
   {
-     // We need to reinitalize the weight of the two faces
+     // We need to reinitialize the weight of the two faces
     GMap_3::size_type nb1=mmap.darts_of_cell<2>(ca1.dart()).size();
     GMap_3::size_type nb2=mmap.darts_of_cell<2>(ca2.dart()).size();
     mmap.info<2>(ca1.dart())*=(double(nb1)/(nb1+nb2));
diff --git a/Generalized_map/include/CGAL/Generalized_map.h b/Generalized_map/include/CGAL/Generalized_map.h
index d65292ed5a0b..4f4b29152fbd 100644
--- a/Generalized_map/include/CGAL/Generalized_map.h
+++ b/Generalized_map/include/CGAL/Generalized_map.h
@@ -193,7 +193,7 @@ namespace CGAL {
      *  @param dartinfoconverter functor to transform original information of darts into information of copies
      *  @param pointconverter functor to transform points in original map into points of copies.
      *  @param copy_perforated_darts true to copy also darts marked perforated (if any)
-     *  @param mark_perforated_darts true to mark darts wich are copies of perforated darts (if any)
+     *  @param mark_perforated_darts true to mark darts which are copies of perforated darts (if any)
      *  @post *this is valid.
      */
     template <typename GMap2, typename Dart_descriptor_2,
@@ -1415,7 +1415,7 @@ namespace CGAL {
        std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers).emplace(args...);
      // Reinitialize the ref counting of the new attribute. This is normally
-     // not required except if create_attribute is used as "copy contructor".
+     // not required except if create_attribute is used as "copy constructor".
      this->template init_attribute_ref_counting<i>(res);
      internal::Init_id<typename Attribute_range<i>::type>::run
          (this->template attributes<i>(), res);
@@ -2635,7 +2635,7 @@ namespace CGAL {
                   <Self, Map2, 0>::run(*this, map2, current, other);
             }
 
-            // We test if the injection is valid with its neighboors.
+            // We test if the injection is valid with its neighbors.
             // We go out as soon as it is not satisfied.
             for (i = 0; match && i <= dimension; ++i)
             {
@@ -3024,7 +3024,7 @@ namespace CGAL {
 
     /** Test if a face is a combinatorial polygon of length alg
      *  (a cycle of alg edges alpha1 links together).
-     * @param adart an intial dart
+     * @param adart an initial dart
      * @return true iff the face containing adart is a polygon of length alg.
      */
     bool is_face_combinatorial_polygon(Dart_const_descriptor adart,
@@ -3118,7 +3118,7 @@ namespace CGAL {
     }
 
     /** Test if a volume is a combinatorial tetrahedron.
-     * @param adart an intial dart
+     * @param adart an initial dart
      * @return true iff the volume containing adart is a combinatorial tetrahedron.
      */
     bool is_volume_combinatorial_tetrahedron(Dart_const_descriptor d1) const
@@ -3195,7 +3195,7 @@ namespace CGAL {
     }
 
     /** Test if a volume is a combinatorial hexahedron.
-     * @param adart an intial dart
+     * @param adart an initial dart
      * @return true iff the volume containing adart is a combinatorial hexahedron.
      */
     bool is_volume_combinatorial_hexahedron(Dart_const_descriptor d1) const
@@ -3388,7 +3388,7 @@ namespace CGAL {
     }
 
     /** Insert a vertex in the given 2-cell which is split in triangles,
-     * once for each inital edge of the facet.
+     * once for each initial edge of the facet.
      * @param adart a dart of the facet to triangulate.
      * @return A dart incident to the new vertex.
      */
@@ -3643,10 +3643,13 @@ namespace CGAL {
       d2 = create_dart();
       mark(it1,treated);
 
+      if (!isfree1)
+      {
       d3 = create_dart();
       d4 = create_dart();
       this->template basic_link_alpha<2>(d1, d3);
       this->template basic_link_alpha<2>(d2, d4);
+      }
 
       for (unsigned int dim=3; dim<=dimension; ++dim)
       {
@@ -3654,21 +3657,30 @@ namespace CGAL {
              is_marked(alpha(it1, dim), treated) )
         {
           basic_link_alpha(alpha(it1, dim, 1), d1, dim);
-          basic_link_alpha(alpha(it1, dim, 1, 0), d2, dim);
+          basic_link_alpha(alpha(d1, dim, 0), d2, dim);
 
-          basic_link_alpha(alpha(it1, dim, 1, 2), d3, dim);
-          basic_link_alpha(alpha(it1, dim, 1, 2, 0), d4, dim);
+          if (!isfree1)
+          {
+            basic_link_alpha(alpha(it1, 1, dim, 1), d3, dim);
+            basic_link_alpha(alpha(d3, dim, 0), d4, dim);
+          }
         }
       }
 
       if (!isfree1)
-      { this->template link_alpha<1>(this->template alpha<1>(it1), d3); }
-      this->template link_alpha<1>(it1, d1);
+      {
+        this->template link_alpha<1>(this->template alpha<1>(it1), d3);
+        if ( adart2!=null_descriptor )
+        {
+          CGAL_assertion (it2.cont());
+          this->template link_alpha<1>(this->template alpha<1>(it2), d4);
+        }
+      }
 
+      this->template link_alpha<1>(it1, d1);
       if (adart2!=null_descriptor)
       {
         CGAL_assertion (it2.cont());
-        this->template link_alpha<1>(this->template alpha<1>(it2), d4);
         this->template link_alpha<1>(it2, d2);
         ++it2;
       }
@@ -3678,14 +3690,18 @@ namespace CGAL {
             update_attributes && ah!=null_descriptor)
         {
           internal::Set_i_attribute_of_dart_functor<Self, 0>::run(*this, d2, ah);
-          internal::Set_i_attribute_of_dart_functor<Self, 0>::run(*this, d4, ah);
+          if (!isfree1)
+          {
+            internal::Set_i_attribute_of_dart_functor<Self, 0>::run(*this, d4, ah);
+          }
         }
       }
 
       // We do the link_alpha<0> after the link_alpha<1> to update the
       // possible attributes of d2.
       this->template link_alpha<0>(d1, d2);
-      this->template link_alpha<0>(d3, d4);
+      if (!isfree1)
+      { this->template link_alpha<0>(d3, d4); }
     }
 
     if (are_attributes_automatically_managed() && update_attributes)
@@ -3705,10 +3721,9 @@ namespace CGAL {
       }
       else // Here we degroup 2-attributes
       {
-        // TODO if ( !this->template is_free<2>(d1) && d2!=null_descriptor )
-        if (adart2!=null_descriptor)
+        if (!this->template is_free<2>(d1) && d2!=null_descriptor)
         { CGAL::internal::GMap_degroup_attribute_functor_run<Self, 2>::
-              run(*this, adart1, adart2); }
+              run(*this, d1, this->template alpha<2>(d1)); }
       }
     }
 
diff --git a/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h b/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h
index 7514a5a0089c..69179ad118c9 100644
--- a/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h
+++ b/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h
@@ -34,7 +34,7 @@
  * GMap_group_attribute_functor<GMap> to group the <i>-attributes of two
  *    given i-cells (except for j-adim). If one i-attribute is nullptr, we set the
  *    darts of its i-cell to the second attribute. If both i-attributes are
- *    non nullptr, we overide all the i-attribute of the second i-cell to the
+ *    non nullptr, we override all the i-attribute of the second i-cell to the
  *    first i-attribute.
  *
  * GMap_degroup_attribute_functor_run<GMap> to degroup one i-attributes in two
@@ -304,6 +304,13 @@ void GMap_test_split_attribute_functor_one_dart
   Attribute_descriptor_i a1 = amap.template attribute<i>(adart);
   if ( found_attributes.is_defined(a1) )
   {  // Here the attribute was already present in the hash_map
+
+    // We need to call reserve for the cc with index case. Indeed, if the vector
+    // is reallocated, the reference returned by get_attribute<i>(a1) will be
+    // invalidated, and the copy will be wrong. Note that there is no overhead
+    // since the creation of the attribute need one allocation.
+    amap.template attributes<i>().reserve(amap.template attributes<i>().size()+1);
+
     Attribute_descriptor_i a2 = amap.template
       create_attribute<i>(amap.template get_attribute<i>(a1));
 
diff --git a/Generalized_map/include/CGAL/Generalized_map_storages_with_index.h b/Generalized_map/include/CGAL/Generalized_map_storages_with_index.h
index 80044bdc7d3f..828004b84164 100644
--- a/Generalized_map/include/CGAL/Generalized_map_storages_with_index.h
+++ b/Generalized_map/include/CGAL/Generalized_map_storages_with_index.h
@@ -242,6 +242,13 @@ namespace CGAL {
     {
       CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
                      "copy_attribute<i> called but i-attributes are disabled.");
+      // We need to do a reserve before the emplace in order to avoid a bug of
+      // invalid reference when the container is reallocated.
+      std::get<Helper::template Dimension_index<i>::value>
+          (mattribute_containers).reserve
+          (std::get<Helper::template Dimension_index<i>::value>
+           (mattribute_containers).size()+1);
+
       typename Attribute_descriptor<i>::type res=
         std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers).emplace(get_attribute<i>(ah));
diff --git a/Generalized_map/test/Generalized_map/CMakeLists.txt b/Generalized_map/test/Generalized_map/CMakeLists.txt
index d712bb061dc5..e773e5c32187 100644
--- a/Generalized_map/test/Generalized_map/CMakeLists.txt
+++ b/Generalized_map/test/Generalized_map/CMakeLists.txt
@@ -7,20 +7,10 @@ project(Generalized_map_Tests)
 # CGAL and its components
 find_package(CGAL REQUIRED)
 
-# Boost and its components
-find_package(Boost REQUIRED)
-
-if(NOT Boost_FOUND)
-
-  message(
-    STATUS "This project requires the Boost library, and will not be compiled.")
-
-  return()
-
-endif()
-
-set(hfiles Generalized_map_2_test.h Generalized_map_3_test.h
-  Generalized_map_4_test.h GMap_test_insertions.h)
+set(hfiles Generalized_map_2_test.h
+           Generalized_map_3_test.h
+           Generalized_map_4_test.h
+           GMap_test_insertions.h)
 
 create_single_source_cgal_program("Generalized_map_test.cpp" ${hfiles})
 
@@ -28,3 +18,5 @@ add_executable(Generalized_map_test_index  Generalized_map_test.cpp ${hfiles})
 target_compile_definitions(Generalized_map_test_index PUBLIC USE_COMPACT_CONTAINER_WITH_INDEX)
 target_link_libraries(Generalized_map_test_index PUBLIC CGAL CGAL::Data)
 cgal_add_compilation_test(Generalized_map_test_index)
+
+create_single_source_cgal_program("gmap_test_split_attribute.cpp")
diff --git a/Generalized_map/test/Generalized_map/gmap_test_split_attribute.cpp b/Generalized_map/test/Generalized_map/gmap_test_split_attribute.cpp
new file mode 100644
index 000000000000..6dd17ee0a84f
--- /dev/null
+++ b/Generalized_map/test/Generalized_map/gmap_test_split_attribute.cpp
@@ -0,0 +1,92 @@
+#include <CGAL/Generalized_map.h>
+#include <CGAL/Cell_attribute.h>
+#include <vector>
+#include <algorithm>
+#include <string>
+#include <cstdlib>
+
+struct MyInfo
+{
+  MyInfo() :data(1)
+  {}
+
+  MyInfo(int i) :data(i)
+  {}
+
+  int data;
+};
+
+struct Myitem1
+{
+  using Use_index=CGAL::Tag_true; // use indices
+  using Index_type=std::uint16_t; // 16 bits
+  template<class GMap>
+  struct Dart_wrapper
+  {
+    typedef CGAL::Cell_attribute<GMap, MyInfo> attrib;
+    typedef std::tuple<void, void, attrib> Attributes;
+  };
+};
+
+struct Myitem2
+{
+  template<class GMap>
+  struct Dart_wrapper
+  {
+    typedef CGAL::Cell_attribute<GMap, MyInfo> attrib;
+    typedef std::tuple<void, void, attrib> Attributes;
+  };
+};
+
+using GMap1=CGAL::Generalized_map<3,Myitem1>;
+using GMap2=CGAL::Generalized_map<3,Myitem2>;
+
+#define NB 1000
+template<typename GMap>
+bool test(const std::string& s)
+{
+  bool res=true;
+  GMap m;
+  // 1) create a face and one attribute.
+  typename GMap::Dart_descriptor dd=m.make_combinatorial_polygon(4);
+  m.template set_attribute<2>(dd, m.template create_attribute<2>(2));
+  // 2) Split this face NB times => will create new 2-attributes for new faces
+  for(std::size_t i=0; i<NB; ++i)
+  {
+    typename GMap::Dart_descriptor
+      newd=m.insert_cell_1_in_cell_2(dd, m.template alpha<0,1>(dd));
+    if(m.template attribute<2>(newd)==GMap::null_descriptor)
+    {
+      std::cout<<"ERROR1: "<<s<<": "
+               <<"attribute<2>(newd)==GMap::null_descriptor"<<std::endl;
+      res=false;
+    }
+    else if(m.template info<2>(newd).data!=2)
+    {
+      std::cout<<"ERROR2: "<<s<<": "<<m.template info<2>(newd).data<<std::endl;
+      res=false;
+    }
+
+    newd=m.template opposite<2>(newd);
+    if(m.template attribute<2>(newd)==GMap::null_descriptor)
+    {
+      std::cout<<"ERROR3: "<<s<<": "
+               <<"attribute<2>(newd)==GMap::null_descriptor"<<std::endl;
+      res=false;
+    }
+    else if(m.template info<2>(newd).data!=2)
+    {
+      std::cout<<"ERROR4: "<<s<<": "<<m.template info<2>(newd).data<<std::endl;
+      res=false;
+    }
+  }
+  return res;
+}
+
+int main()
+{
+  if(!test<GMap1>("GMap1") || !test<GMap2>("GMap2"))
+  { return EXIT_FAILURE; }
+
+  return EXIT_SUCCESS;
+}
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_2/cmake/FindCGAL.cmake b/Linear_cell_complex/benchmark/Linear_cell_complex_2/cmake/FindCGAL.cmake
index 7dc0446bf45b..a4b0902e60d4 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_2/cmake/FindCGAL.cmake
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_2/cmake/FindCGAL.cmake
@@ -10,7 +10,7 @@
 #  CGAL_USE_FILE      - CMake file to use CGAL.
 #
 
-# Construct consitent error messages for use below.
+# Construct consistent error messages for use below.
 set(CGAL_DIR_DESCRIPTION "directory containing CGALConfig.cmake. This is either the binary directory where CGAL was configured or PREFIX/lib/CGAL for an installation.")
 set(CGAL_DIR_MESSAGE     "CGAL not found.  Set the CGAL_DIR cmake variable or environment variable to the ${CGAL_DIR_DESCRIPTION}")
 
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h
index 889ee37db5d1..f092321e4a9e 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h
@@ -705,7 +705,7 @@ class Surface_mesh
     {
     public:
 
-        /// default constructur
+        /// default constructor
         Halfedge_around_face_circulator(const Surface_mesh* m=NULL, Face f=Face())
         : mesh_(m)
         {
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Vector.h b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Vector.h
index 8f9487c28cc7..21aa768dbfb4 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Vector.h
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Vector.h
@@ -137,7 +137,7 @@ class Vector
     }
 
 
-    /// assign a scalar to all componenets
+    /// assign a scalar to all components
     Vector<Scalar,N>& operator=(const Scalar s)
     {
         for (int i=0; i<N; ++i)
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_3/CMakeLists.txt b/Linear_cell_complex/benchmark/Linear_cell_complex_3/CMakeLists.txt
index bc7fb931661b..4b65e2ee3c5e 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_3/CMakeLists.txt
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_3/CMakeLists.txt
@@ -8,13 +8,6 @@ endif()
 
 find_package(CGAL REQUIRED)
 
-find_package(Boost 1.43.0)
-if(Boost_FOUND)
-  include_directories(${Boost_INCLUDE_DIRS})
-else()
-  set(USE_IN_SOURCE_TREE_BOOST true)
-endif()
-
 add_subdirectory(openvolumemesh)
 
 include_directories(BEFORE openvolumemesh/src)
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_3/cmake/ACGCommon.cmake b/Linear_cell_complex/benchmark/Linear_cell_complex_3/cmake/ACGCommon.cmake
index 251520efd4da..8942c96886cf 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_3/cmake/ACGCommon.cmake
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_3/cmake/ACGCommon.cmake
@@ -19,7 +19,7 @@ if (NOT CMAKE_BUILD_TYPE)
       FORCE)
 endif ()
 
-# create our output directroy
+# create our output directory
 if (NOT EXISTS ${CMAKE_BINARY_DIR}/Build)
   file (MAKE_DIRECTORY ${CMAKE_BINARY_DIR}/Build)
 endif ()
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_3/cmake/FindGoogleTest.cmake b/Linear_cell_complex/benchmark/Linear_cell_complex_3/cmake/FindGoogleTest.cmake
index 37bd9a812d67..5e86a4dd4cf6 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_3/cmake/FindGoogleTest.cmake
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_3/cmake/FindGoogleTest.cmake
@@ -13,7 +13,7 @@
 #   use this file except in compliance with the License.  You may obtain a copy
 #   of the License at
 #
-#       http://www.apache.org/licenses/LICENSE-2.0
+#       https://www.apache.org/licenses/LICENSE-2.0
 #
 #   Unless required by applicable law or agreed to in writing, software
 #   distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
diff --git a/Linear_cell_complex/benchmark/README.TXT b/Linear_cell_complex/benchmark/README.TXT
index a721960047dc..54465dd4a15c 100644
--- a/Linear_cell_complex/benchmark/README.TXT
+++ b/Linear_cell_complex/benchmark/README.TXT
@@ -18,9 +18,9 @@ INSTALLATION:
 1) Install all the following libraries:
 
 CGAL: https://www.cgal.org/
-CGoGN: http://cgogn.u-strasbg.fr/
-OpenMesh: http://www.openmesh.org/
-OpenVolumeMesh: http://www.openvolumemesh.org/
+CGoGN: https://cgogn.github.io/
+OpenMesh: https://www.openmesh.org/
+OpenVolumeMesh: https://www.openvolumemesh.org/
 
 2) create links (or copy directory):
 * in the 2D directory:
@@ -41,7 +41,7 @@ CGAL_BUILD_DIR being the build directory of the CGAL library.
 * In 2D, the programs take off files as input.
 * In 3D, lcc and cgogn take tetmesh and OpenVolumeMesh takes ovm.
 
-You can create a tetmesh file using tetgen programm with an off file as input (http://tetgen.berlios.de/) with option -g to generate XXX.mesh file. Rename this file into XXX.tetmesh. Modify the file to keep only the two following sections:
+You can create a tetmesh file using tetgen with an OFF file as input (https://www.berlios.de/software/tetgen/) with option -g to generate XXX.mesh file. Rename this file into XXX.tetmesh. Modify the file to keep only the two following sections:
 
 **********************
 Vertices
@@ -54,4 +54,4 @@ Tetrahedra
 
 And for each tetrahedra line, remove the last column.
 
-You obtain the tetmesh file. Then you can use the FileConverter/file_converter programm in the OpenVolumeMesh library to convert it into the corresponding ovm file.
+You obtain the tetmesh file. Then you can use the FileConverter/file_converter program in the OpenVolumeMesh library to convert it into the corresponding ovm file.
diff --git a/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt b/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt
index 8f715aac0843..66c6e7088aa5 100644
--- a/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt
+++ b/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt
@@ -48,14 +48,13 @@ if(NOT
    (CGAL_Qt5_FOUND
     AND Qt5_FOUND))
 
-  message(STATUS "NOTICE: This demo requires CGAL, "
-                 "and Qt5, and will not be compiled.")
+  message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
 
 else()
 
   add_definitions(-DCGAL_USE_BASIC_VIEWER -DQT_NO_KEYWORDS)
 
-  # ui file, created wih Qt Designer
+  # ui file, created with Qt Designer
   qt5_wrap_ui(uis MainWindow.ui CreateMesh.ui CreateMenger.ui
               CreateSierpinskiCarpet.ui CreateSierpinskiTriangle.ui)
 
diff --git a/Linear_cell_complex/demo/Linear_cell_complex/MainWindow.cpp b/Linear_cell_complex/demo/Linear_cell_complex/MainWindow.cpp
index 46b596fcee8c..9237d1913479 100644
--- a/Linear_cell_complex/demo/Linear_cell_complex/MainWindow.cpp
+++ b/Linear_cell_complex/demo/Linear_cell_complex/MainWindow.cpp
@@ -3261,7 +3261,7 @@ void MainWindow::sierpinski_triangle_split_face_in_four(Dart_descriptor dh, bool
     }
     else
     {
-      // we dupplicate all 0-embeddings to set them to the splitted vertices
+      // we duplicate all 0-embeddings to set them to the split vertices
       (scene.lcc)->set_dart_attribute<0>(scene.lcc->beta(d2,1),(scene.lcc)->create_vertex_attribute(scene.lcc->point(d1)));
       (scene.lcc)->set_dart_attribute<0>(scene.lcc->beta(d3,1),(scene.lcc)->create_vertex_attribute(scene.lcc->point(d2)));
       (scene.lcc)->set_dart_attribute<0>(scene.lcc->beta(d1,1),(scene.lcc)->create_vertex_attribute(scene.lcc->point(d3)));
diff --git a/Linear_cell_complex/examples/Linear_cell_complex/README.txt b/Linear_cell_complex/examples/Linear_cell_complex/README.txt
index 6326da0e6650..e461312f2dd2 100644
--- a/Linear_cell_complex/examples/Linear_cell_complex/README.txt
+++ b/Linear_cell_complex/examples/Linear_cell_complex/README.txt
@@ -5,7 +5,7 @@ Examples for Linear_cell_complex package:
   linear_cell_complex_3_with_colored_vertices.cpp
   linear_cell_complex_4.cpp
 
-  Three "basic" examples, detailled in the user manual.
+  Three "basic" examples, detailed in the user manual.
 
 
 * plane_graph_to_lcc_2.cpp
diff --git a/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt b/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt
index 0b7a094a29d1..9adb636537f1 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt
+++ b/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Linear_cell_complex_Tests)
 
-find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED)
 
 set(hfiles Linear_cell_complex_2_test.h
   Linear_cell_complex_3_test.h Linear_cell_complex_3_test.h)
@@ -26,11 +26,6 @@ target_compile_definitions(Linear_cell_complex_3_test_index PUBLIC USE_COMPACT_C
 target_link_libraries(Linear_cell_complex_3_test_index PUBLIC CGAL CGAL::Data)
 cgal_add_compilation_test(Linear_cell_complex_3_test_index)
 
-if(CGAL_Qt5_FOUND)
-  target_link_libraries(Linear_cell_complex_3_test PUBLIC CGAL::CGAL_Basic_viewer)
-  target_link_libraries(Linear_cell_complex_3_test_index PUBLIC CGAL::CGAL_Basic_viewer)
-endif()
-
 add_executable(Linear_cell_complex_4_test_index Linear_cell_complex_4_test.cpp ${hfiles})
 target_compile_definitions(Linear_cell_complex_4_test_index PUBLIC USE_COMPACT_CONTAINER_WITH_INDEX)
 target_link_libraries(Linear_cell_complex_4_test_index PUBLIC CGAL CGAL::Data)
diff --git a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h
index 8b8d55ea375e..1f696a418113 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h
+++ b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.h
@@ -20,7 +20,6 @@
 #include "Linear_cell_complex_2_test.h"
 #include <fstream>
 #include <typeinfo>
-#include<CGAL/draw_linear_cell_complex.h>
 template<typename LCC>
 bool check_number_of_cells_3(LCC& lcc, unsigned int nbv, unsigned int nbe,
                              unsigned int nbf, unsigned int nbvol,
@@ -218,7 +217,6 @@ bool test_LCC_3()
   if ( !check_number_of_cells_3(lcc, 11, 13, 8, 2, 2) )
     return false;
 
-  // CGAL::draw(lcc);
   trace_test_begin();
   lcc.template remove_cell<0>(dh9);
   if ( !check_number_of_cells_3(lcc, 10, 12, 8, 2, 2) )
@@ -983,7 +981,6 @@ bool test_LCC_3()
   lcc.insert_cell_1_between_two_cells_2(lcc.template opposite<2>(lcc.next(lcc.next(dh1))),
                                         lcc.next(lcc.next(dh3)));
 
-  CGAL::draw(lcc); // TODO remove
   if (!check_number_of_cells_3(lcc, 16, 25, 11, 2, 1) )
     return false;
 

From 134b464aaa4280e1ba9c70e5839b47b61a657e08 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 26 Apr 2023 11:51:43 +0100
Subject: [PATCH 0253/1398] Allocate the QJSEngine on the heap

---
 AABB_tree/demo/AABB_tree/MainWindow.cpp | 12 ++++++------
 AABB_tree/demo/AABB_tree/MainWindow.h   | 11 ++++++-----
 2 files changed, 12 insertions(+), 11 deletions(-)

diff --git a/AABB_tree/demo/AABB_tree/MainWindow.cpp b/AABB_tree/demo/AABB_tree/MainWindow.cpp
index 7064d50ba5a3..4321e396b8d4 100644
--- a/AABB_tree/demo/AABB_tree/MainWindow.cpp
+++ b/AABB_tree/demo/AABB_tree/MainWindow.cpp
@@ -16,7 +16,7 @@
 
 
 MainWindow::MainWindow(QWidget* parent)
-: CGAL::Qt::DemosMainWindow(parent)
+  : CGAL::Qt::DemosMainWindow(parent), myEngine(new QJSEngine())
 {
   ui = new Ui::MainWindow;
   ui->setupUi(this);
@@ -40,14 +40,14 @@ MainWindow::MainWindow(QWidget* parent)
   connect(this, SIGNAL(openRecentFile(QString)),
     this, SLOT(open(QString)));
 
-  QJSValue mainWindow = myEngine.newQObject(this);
-  myEngine.globalObject().setProperty("main_window", mainWindow);
+  QJSValue mainWindow = myEngine->newQObject(this);
+  myEngine->globalObject().setProperty("main_window", mainWindow);
   readSettings();
   std::ifstream script("init.js");
   if(script.good()){
     std::string line;
     while(getline(script, line)){
-      myEngine.evaluate(line.c_str());
+      myEngine->evaluate(line.c_str());
     }
   }
 }
@@ -57,8 +57,8 @@ MainWindow::~MainWindow()
   m_pViewer->makeCurrent();
   // AF I thought this helps to avoid  the exception when the program
   // terminates, but it does not
-  myEngine.globalObject().setProperty("main_window", QJSValue());
-  myEngine.collectGarbage();
+  myEngine->globalObject().setProperty("main_window", QJSValue());
+  myEngine->collectGarbage();
   delete ui;
 }
 
diff --git a/AABB_tree/demo/AABB_tree/MainWindow.h b/AABB_tree/demo/AABB_tree/MainWindow.h
index 7a28f7cde919..50cd927a7cb4 100644
--- a/AABB_tree/demo/AABB_tree/MainWindow.h
+++ b/AABB_tree/demo/AABB_tree/MainWindow.h
@@ -20,18 +20,19 @@ struct Foo : public QObject
 
   Q_OBJECT
 public:
-  QJSEngine myEngine;
+  QJSEngine* myEngine;
 
   Foo()
+    : myEngine(new QJSEngine())
   {
-      QJSValue baz = myEngine.newQObject(this);
-      myEngine.globalObject().setProperty("baz", baz);
+      QJSValue baz = myEngine->newQObject(this);
+      myEngine->.globalObject().setProperty("baz", baz);
   }
 
   void bar()
   {
       std::cout << "bar()" << std::endl;
-      myEngine.evaluate("baz.hello()");
+      myEngine->evaluate("baz.hello()");
   }
 
 public slots:
@@ -112,7 +113,7 @@ class MainWindow :
       void on_actionView_cutting_plane_triggered();
 
 private:
-  QJSEngine myEngine;
+  QJSEngine* myEngine;
   Scene* m_pScene;
   Viewer* m_pViewer;
   Ui::MainWindow* ui;

From 585e79b67e5750a541d18e97487f9b23d07d5d00 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 26 Apr 2023 13:06:19 +0200
Subject: [PATCH 0254/1398] add authors from the history section

---
 .../doc/Polygon_mesh_processing/PackageDescription.txt          | 2 +-
 .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt     | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 9c8b5d6f2948..bf667377a96a 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -79,7 +79,7 @@
 \cgalPkgPicture{hole_filling_ico.png}
 
 \cgalPkgSummaryBegin
-\cgalPkgAuthors{Sébastien Loriot, Mael Rouxel-Labbé, Jane Tournois, and Ilker %O. Yaz}
+\cgalPkgAuthors{David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katriopla, Sébastien Loriot, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz}
 \cgalPkgDesc{This package provides a collection of methods and classes for polygon mesh processing,
 ranging from basic operations on simplices, to complex geometry processing algorithms such as
 Boolean operations, remeshing, repairing, collision and intersection detection, and more.}
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index ead5b5a8c80c..eac246d8ab47 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -4,7 +4,7 @@ namespace CGAL {
 \anchor Chapter_PolygonMeshProcessing
 
 \cgalAutoToc
-\authors Sébastien Loriot, Mael Rouxel-Labbé, Jane Tournois, Ilker %O. Yaz
+\authors David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katriopla, Sébastien Loriot, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz
 
 \image html neptun_head.jpg
 \image latex neptun_head.jpg

From cfa16aa95fb754181e40acb18e8203ab76652211 Mon Sep 17 00:00:00 2001
From: Michael Hoffmann <hoffmann@inf.ethz.ch>
Date: Thu, 27 Apr 2023 12:14:36 +0200
Subject: [PATCH 0255/1398] Document which constructions are exact in EPIC.

---
 .../doc/resources/1.9.3/BaseDoxyfile.in       |   3 +-
 Kernel_23/doc/Kernel_23/CGAL/Circle_2.h       |   8 +
 Kernel_23/doc/Kernel_23/CGAL/Circle_3.h       |   8 +-
 Kernel_23/doc/Kernel_23/CGAL/Direction_2.h    |   6 +
 Kernel_23/doc/Kernel_23/CGAL/Direction_3.h    |   9 +
 ..._predicates_inexact_constructions_kernel.h | 357 +++++++++---------
 Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h   |  21 ++
 .../doc/Kernel_23/CGAL/Iso_rectangle_2.h      |  18 +
 Kernel_23/doc/Kernel_23/CGAL/Line_2.h         |   5 +
 Kernel_23/doc/Kernel_23/CGAL/Line_3.h         |   5 +
 Kernel_23/doc/Kernel_23/CGAL/Plane_3.h        |   9 +
 Kernel_23/doc/Kernel_23/CGAL/Point_2.h        |  11 +
 Kernel_23/doc/Kernel_23/CGAL/Point_3.h        |  13 +
 Kernel_23/doc/Kernel_23/CGAL/Ray_2.h          |   2 +
 Kernel_23/doc/Kernel_23/CGAL/Ray_3.h          |   2 +
 Kernel_23/doc/Kernel_23/CGAL/Segment_2.h      |  10 +
 Kernel_23/doc/Kernel_23/CGAL/Segment_3.h      |  10 +
 Kernel_23/doc/Kernel_23/CGAL/Sphere_3.h       |   9 +
 Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h  |   4 +
 Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h     |   5 +
 Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h     |   4 +
 Kernel_23/doc/Kernel_23/CGAL/Vector_2.h       |  10 +
 Kernel_23/doc/Kernel_23/CGAL/Vector_3.h       |  13 +
 .../doc/Kernel_23/CGAL/Weighted_point_2.h     |  15 +-
 .../doc/Kernel_23/CGAL/Weighted_point_3.h     |  15 +
 25 files changed, 392 insertions(+), 180 deletions(-)

diff --git a/Documentation/doc/resources/1.9.3/BaseDoxyfile.in b/Documentation/doc/resources/1.9.3/BaseDoxyfile.in
index 3fcdb56be680..0a56ea1fc37e 100644
--- a/Documentation/doc/resources/1.9.3/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.3/BaseDoxyfile.in
@@ -382,7 +382,8 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalParamNEnd=</ul> \htmlonly[block] </div> \endhtmlonly </td><td></td></tr>" \
                          "cgalParamSectionBegin{1}=\cgalParamNBegin{\1}" \
                          "cgalParamSectionEnd=\cgalParamNEnd" \
-                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>"
+                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>" \
+			 "cgalEpicExact=<dl class=\"section note\"><dt>Exactness</dt><dd>This construction is trivial and therefore always exact in `Exact_predicates_inexact_constructions_kernel`.</dd></dl>"
 
 # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
 # only. Doxygen will then generate output that is more tailored for C. For
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Circle_2.h b/Kernel_23/doc/Kernel_23/CGAL/Circle_2.h
index 1e9eacdeb0e4..ecb9d969847a 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Circle_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Circle_2.h
@@ -29,6 +29,8 @@ It is initialized to the circle with center `center`,
 squared radius `squared_radius` and orientation
 `ori`.
 \pre `ori != COLLINEAR` and `squared_radius >= 0`.
+
+\cgalEpicExact
 */
 Circle_2(const Point_2<Kernel> &center,
 const Kernel::FT &squared_radius,
@@ -65,6 +67,8 @@ It is initialized to the circle with center `center`, squared
 radius zero and orientation `ori`.
 \pre `ori != COLLINEAR`.
 \post `c.is_degenerate()` = `true`.
+
+\cgalEpicExact
 */
 Circle_2( const Point_2<Kernel> &center,
           const Orientation &ori = COUNTERCLOCKWISE);
@@ -77,18 +81,21 @@ Circle_2( const Point_2<Kernel> &center,
 /*!
 
 returns the center of `c`.
+\cgalEpicExact
 */
 const Point_2<Kernel> &center( ) const;
 
 /*!
 
 returns the squared radius of `c`.
+\cgalEpicExact
 */
 const Kernel::FT& squared_radius( ) const;
 
 /*!
 
 returns the orientation of `c`.
+\cgalEpicExact
 */
 Orientation orientation( ) const;
 
@@ -172,6 +179,7 @@ bool has_on_unbounded_side(const Point_2<Kernel> &p) const;
 
 returns the circle with the same center and squared radius as
 `c` but with opposite orientation.
+\cgalEpicExact
 */
 Circle_2<Kernel> opposite() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Circle_3.h b/Kernel_23/doc/Kernel_23/CGAL/Circle_3.h
index 1fcdcab6e68f..f152c18e2953 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Circle_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Circle_3.h
@@ -22,6 +22,8 @@ introduces a variable `c` of type `Circle_3`.
 It is initialized to the circle of center `center` and
 squared radius `sq_r` in plane `plane`.
 \pre `center` lies in `plane` and `sq_r >= 0`.
+
+\cgalEpicExact
 */
 Circle_3(const Point_3<Kernel> &center,
          const Kernel::FT &sq_r,
@@ -60,7 +62,7 @@ It is initialized to the circle along which the sphere and the
 plane intersect.
 \pre The sphere and the plane intersect along a circle.
 */
-  Circle_3(constSphere_3<Kernel> & sphere,
+  Circle_3(const Sphere_3<Kernel> & sphere,
            const Plane_3<Kernel> & plane);
 
 /*!
@@ -80,24 +82,28 @@ Circle_3(const Plane_3<Kernel> & plane,
 /*!
 
 returns the center of `c`.
+\cgalEpicExact
 */
 const Point_3<Kernel> & center( ) const;
 
 /*!
 
 returns the squared radius of `c`.
+\cgalEpicExact
 */
 const Kernel::FT & squared_radius( ) const;
 
 /*!
 
 returns the supporting plane of `c`.
+\cgalEpicExact
 */
 const Plane_3<Kernel> & supporting_plane( ) const;
 
 /*!
 
 returns the diametral sphere of `c`.
+\cgalEpicExact
 */
 const Sphere_3<Kernel> & diametral_sphere( ) const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Direction_2.h b/Kernel_23/doc/Kernel_23/CGAL/Direction_2.h
index 00a2e8d74a57..3c3355de785b 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Direction_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Direction_2.h
@@ -26,6 +26,7 @@ class Direction_2 {
 
 /*!
 introduces the direction `d` of vector `v`.
+\cgalEpicExact
 */
 Direction_2(const Vector_2<Kernel> &v);
 
@@ -47,6 +48,7 @@ Direction_2(const Segment_2<Kernel> &s);
 /*!
 introduces a direction `d` passing through the origin
 and the point with %Cartesian coordinates \f$ (x, y)\f$.
+\cgalEpicExact
 */
 Direction_2(const Kernel::RT &x, const Kernel::RT &y);
 
@@ -61,16 +63,20 @@ Direction_2(const Kernel::RT &x, const Kernel::RT &y);
 /*!
 returns values, such that `d``== Direction_2<Kernel>(delta(0),delta(1))`.
 \pre `0 <= i <= 1`.
+
+\cgalEpicExact
 */
 Kernel::RT delta(int i) const;
 
 /*!
 returns `delta(0)`.
+\cgalEpicExact
 */
 Kernel::RT dx() const;
 
 /*!
 returns `delta(1)`.
+\cgalEpicExact
 */
 Kernel::RT dy() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Direction_3.h b/Kernel_23/doc/Kernel_23/CGAL/Direction_3.h
index 81b096ac359a..32dd7834bdb7 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Direction_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Direction_3.h
@@ -26,6 +26,7 @@ class Direction_3 {
 /*!
 introduces a direction `d` initialized with the
 direction of vector `v`.
+\cgalEpicExact
 */
 Direction_3(const Vector_3<Kernel> &v);
 
@@ -47,6 +48,7 @@ Direction_3(const Segment_3<Kernel> &s);
 /*!
 introduces a direction `d` initialized with the direction
 from the origin to the point with %Cartesian coordinates \f$ (x, y, z)\f$.
+\cgalEpicExact
 */
 Direction_3(const Kernel::RT &x, const Kernel::RT &y, const Kernel::RT &z);
 
@@ -58,21 +60,26 @@ Direction_3(const Kernel::RT &x, const Kernel::RT &y, const Kernel::RT &z);
 /*!
 returns values, such that `d``== Direction_3<Kernel>(delta(0),delta(1),delta(2))`.
 \pre `0 <= i <= 2`.
+
+\cgalEpicExact
 */
 Kernel::RT delta(int i) const;
 
 /*!
 returns `delta(0)`.
+\cgalEpicExact
 */
 Kernel::RT dx() const;
 
 /*!
 returns `delta(1)`.
+\cgalEpicExact
 */
 Kernel::RT dy() const;
 
 /*!
 returns `delta(2)`.
+\cgalEpicExact
 */
 Kernel::RT dz() const;
 
@@ -88,11 +95,13 @@ bool operator!=(const Direction_3<Kernel> &e) const;
 
 /*!
 The direction opposite to `d`.
+\cgalEpicExact
 */
 Direction_3<Kernel> operator-() const;
 
 /*!
 returns a vector that has the same direction as `d`.
+\cgalEpicExact
 */
 Vector_3<Kernel> vector() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
index a24ad8901c22..8a5e33aa5fc8 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
@@ -14,193 +14,196 @@ coordinates.
 constructions are not exact in general. 
 </UL>
 
-<h4>Trivial Constructions</h4>  
-
-Some geometric constructions, however, are exact because they only
+<dl class="section"><dt>Trivial Constructions</dt></dl>
+<p>Some geometric constructions, however, are exact because they only
 copy parameters and do not involve any computations that could lead to
 roundoff errors. We call such a construction <em>trivial</em>. For
 instance, all copy constructors, such as `Point_2::Point_2(const
 Point_2&)`, are trivial constructions. In addition, the following
 constructions in `CGAL::Exact_predicates_inexact_constructions_kernel`
-are trivial:
+are trivial:</p>
 
-<ul> 
-<li> `Point_2::Point_2(double,double)`
-<li> `Point_2::Point_2(const Weighted_point_2&)`
+<ul>
+<li> `Point_2::Point_2(FT, FT)`
+<li> `Point_2::Point_2(Weighted_point_2)`
 <li> `Point_2::Point_2(Origin)`
-<li> `Weighted_point_2::Weighted_point_2(double,double)`
-<li> `Weighted_point_2::Weighted_point_2(const Point_2&, double = 0)`
+<li> `FT Point_2::x()`
+<li> `FT Point_2::y()`
+<li> `FT Point_2::cartesian(int)`
+<li> `FT Point_2::operator[](int)`
+<li> `Bbox_2 Point_2::bbox()`
+<li> `Vector_2 operator-(Point_2, Origin)`
+<li> `Vector_2 operator-(Origin, Point_2)`
+<li> `Weighted_point_2::Weighted_point_2(FT, FT)`
+<li> `Weighted_point_2::Weighted_point_2(Point_2, FT)`
+<li> `Weighted_point_2::Weighted_point_2(Point_2)`
 <li> `Weighted_point_2::Weighted_point_2(Origin)`
-<li> `Vector_2::Vector_2(double,double)`
-<li> `Direction_2::Direction_2(double,double)`
-<li> `Direction_2::Direction_2(const Vector_2&)`
-<li> `Line_2::Line_2(double,double,double)`
-<li> `Ray_2::Ray_2(const Point_2&, const Point_2&)`
-<li> `Segment_2::Segment_2(const Point_2&, const Point_2&)`
-<li> `Triangle_2::Triangle_2(const Point_2&, const Point_2&, const Point_2&)`
-<li> `Iso_rectangle_2::Iso_rectangle_2(const Point_2&, const Point_2&)`
-<li> `Iso_rectangle_2::Iso_rectangle_2(const Point_2&, const Point_2&, int)`
-<li> `Iso_rectangle_2::Iso_rectangle_2(const Point_2&, const Point_2&, const Point_2&, const Point_2&)`
-<li> `Iso_rectangle_2::Iso_rectangle_2(const Bbox_2&)`
-<li> `Circle_2::Circle_2(const Point_2&, double, Orientation = COUNTERCLOCKWISE)`
-<li> `Kernel::ConstructPoint_2()(const Weighted_point_2&)`
-<li> `Kernel::ConstructPoint_2()(Origin)`
-<li> `Kernel::ConstructWeightedPoint_2()(const Point_2&, double = 0)`
-<li> `Kernel::ConstructWeightedPoint_2()(Origin)`
-<li> `Kernel::ConstructVector_2()(Origin, const Point_2&)`
-<li> `Kernel::ConstructVector_2()(const Point_2&, Origin)`
-<li> `Kernel::ConstructVector_2()(Null_vector)`
-<li> `Kernel::ConstructDirection_2()(const Vector_2&)`
-<li> `Kernel::ConstructSegment_2()(const Point_2&, const Point_2&)`
-<li> `Kernel::ConstructRay_2()(const Point_2&, const Point_2&)`
-<li> `Kernel::ConstructCircle_2()(const Point_2&, double, Orientation = COUNTERCLOCKWISE)`
-<li> `Kernel::ConstructCircle_2()(const Point_2&, Orientation = COUNTERCLOCKWISE)`
-<li> `Kernel::ConstructTriangle_2()(const Point_2&, const Point_2&, const Point_2&)`
-<li> `Kernel::ConstructIsoRectangle_2()(const Point_2&, const Point_2&)`
-<li> `Kernel::ConstructIsoRectangle_2()(const Point_2&, const Point_2&, int)`
-<li> `Kernel::ConstructIsoRectangle_2()(const Point_2&, const Point_2&, const Point_2&, const Point_2&)`
-<li> `Kernel::ConstructVertex_2()(const Segment_2&, int)`
-<li> `Kernel::ConstructVertex_2()(const Triangle_2&, int)`
-<li> `Kernel::ConstructVertex_2()(const Iso_rectangle_2&, int)`
-<li> `Kernel::ConstructBbox_2()(const Point_2&)`
-<li> `Kernel::ConstructBbox_2()(const Segment_2&)`
-<li> `Kernel::ConstructBbox_2()(const Triangle_2&)`
-<li> `Kernel::ConstructBbox_2()(const Iso_rectangle_2&)`
-<li> `Kernel::ConstructCenter_2()(const Circle_2&)`
-<li> `Kernel::ConstructOppositeVector_2()(const Vector_2&)`
-<li> `Kernel::ConstructOppositeDirection_2()(const Direction_2&)`
-<li> `Kernel::ConstructOppositeSegment_2()(const Segment_2&)`
-<li> `Kernel::ConstructOppositeRay_2()(const Ray_2&)`
-<li> `Kernel::ConstructOppositeLine_2()(const Line_2&)`
-<li> `Kernel::ConstructOppositeTriangle_2()(const Triangle_2&)`
-<li> `Kernel::ConstructOppositeCircle_2()(const Circle_2&)`
-<li> `Kernel::ConstructSource_2()(const Segment_2&)`
-<li> `Kernel::ConstructSource_2()(const Ray_2&)`
-<li> `Kernel::ConstructSecondPoint_2()(const Ray_2&)`
-<li> `Kernel::ConstructTarget_2()(const Target_2&)`
-<li> `Kernel::ConstructMinVertex_2()(const Segment_2&)`
-<li> `Kernel::ConstructMinVertex_2()(const Iso_rectangle_2&)`
-<li> `Kernel::ConstructMaxVertex_2()(const Segment_2&)`
-<li> `Kernel::ConstructMaxVertex_2()(const Iso_rectangle_2&)`
-<li> `Kernel::ComputeWeight_2()(const Weighted_point_2&)`
-<li> `Kernel::ComputeX_2()(const Point_2&)`
-<li> `Kernel::ComputeX_2()(const Vector_2&)`
-<li> `Kernel::ComputeY_2()(const Point_2&)`
-<li> `Kernel::ComputeY_2()(const Vector_2&)`
-<li> `Kernel::ComputeA_2()(const Line_2&)`
-<li> `Kernel::ComputeB_2()(const Line_2&)`
-<li> `Kernel::ComputeC_2()(const Line_2&)`
-<li> `Kernel::ComputeDx_2()(const Direction_2&)`
-<li> `Kernel::ComputeDy_2()(const Direction_2&)`
-<li> `Kernel::ComputeXmin_2()(const Iso_rectangle_2&)`
-<li> `Kernel::ComputeXmax_2()(const Iso_rectangle_2&)`
-<li> `Kernel::ComputeYmin_2()(const Iso_rectangle_2&)`
-<li> `Kernel::ComputeYmax_2()(const Iso_rectangle_2&)`
-<li> `Kernel::ComputeSquaredRadius_2()(const Circle_2&)`
-<li> `Kernel::ComputeSquaredRadius_2()(const Point_2&)`
-<li> `Kernel::CartesianConstIterator_2()(const Point_2&)`
-<li> `Kernel::CartesianConstIterator_2()(const Point_2&, int)`
-<li> `Kernel::CartesianConstIterator_2()(const Vector_2&)`
-<li> `Kernel::CartesianConstIterator_2()(const Vector_2&, int)`
-<li> `Point_3::Point_3(double,double,double)`
-<li> `Point_3::Point_3(const Weighted_point_3&)`
+<li> `Point_2 Weighted_point_2::point()`
+<li> `FT Weighted_point_2::weight()`
+<li> `FT Weighted_point_2::x()`
+<li> `FT Weighted_point_2::y()`
+<li> `FT Weighted_point_2::cartesian(int)`
+<li> `FT Weighted_point_2::operator[](int)`
+<li> `Bbox_2 Weighted_point_2::bbox()`
+<li> `Vector_2::Vector_2(FT, FT)`
+<li> `FT Vector_2::x()`
+<li> `FT Vector_2::y()`
+<li> `FT Vector_2::cartesian(int)`
+<li> `FT Vector_2::operator[](int)`
+<li> `Direction_2 Vector_2::direction()`
+<li> `Vector_2 Vector_2::operator-()`
+<li> `Direction_2::Direction_2(FT, FT)`
+<li> `Direction_2::Direction_2(Vector_2)`
+<li> `RT Direction_2::delta(int)`
+<li> `RT Direction_2::dx()`
+<li> `RT Direction_2::dy()`
+<li> `Direction_2 Direction_2::operator-()`
+<li> `Vector_2 Direction_2::vector()`
+<li> `Line_2::Line_2(RT, RT, RT)`
+<li> `RT Line_2::a()`
+<li> `RT Line_2::b()`
+<li> `Line_2 Line_2::opposite()`
+<li> `Ray_2::Ray_2(Point_2, Point_2)`
+<li> `Point_2 Ray_2::source()`
+<li> `Segment_2::Segment_2(Point_2, Point_2)`
+<li> `Point_2 Segment_2::source()`
+<li> `Point_2 Segment_2::target()`
+<li> `Point_2 Segment_2::min()`
+<li> `Point_2 Segment_2::max()`
+<li> `Point_2 Segment_2::vertex(int)`
+<li> `Point_2 Segment_2::point(int)`
+<li> `Point_2 Segment_2::operator[](int)`
+<li> `Segment_2 Segment_2::opposite()`
+<li> `Bbox_2 Segment_2::bbox()`
+<li> `Triangle_2::Triangle_2(Point_2, Point_2, Point_2)`
+<li> `Point_2 Triangle_2::vertex(int)`
+<li> `Point_2 Triangle_2::operator[](int)`
+<li> `Triangle_2 Triangle_2::opposite()`
+<li> `Bbox_2 Triangle_2::bbox()`
+<li> `Iso_rectangle_2::Iso_rectangle_2(Point_2, Point_2)`
+<li> `Iso_rectangle_2::Iso_rectangle_2(Point_2, Point_2, int)`
+<li> `Iso_rectangle_2::Iso_rectangle_2(Point_2, Point_2, Point_2, Point_2)`
+<li> `Iso_rectangle_2::Iso_rectangle_2(Bbox_2)`
+<li> `Point_2 Iso_rectangle_2::vertex(int)`
+<li> `Point_2 Iso_rectangle_2::operator[](int)`
+<li> `Point_2 Iso_rectangle_2::min()`
+<li> `Point_2 Iso_rectangle_2::max()`
+<li> `FT Iso_rectangle_2::xmin()`
+<li> `FT Iso_rectangle_2::ymin()`
+<li> `FT Iso_rectangle_2::xmax()`
+<li> `FT Iso_rectangle_2::ymax()`
+<li> `FT Iso_rectangle_2::min_coord(int)`
+<li> `FT Iso_rectangle_2::max_coord(int)`
+<li> `Bbox_2 Iso_rectangle_2::bbox()`
+<li> `Circle_2::Circle_2(Point_2, FT, Orientation)`
+<li> `Circle_2::Circle_2(Point_2, Orientation)`
+<li> `Point_2 Circle_2::center()`
+<li> `FT Circle_2::squared_radius()`
+<li> `Orientation Circle_2::orientation()`
+<li> `Circle_2 Circle_2::opposite()`
+<li> `Point_3::Point_3(FT, FT, FT)`
+<li> `Point_3::Point_3(Weighted_point_3)`
 <li> `Point_3::Point_3(Origin)`
-<li> `Weighted_point_3::Weighted_point_3(double,double)`
-<li> `Weighted_point_3::Weighted_point_3(const Point_3&, double = 0)`
+<li> `FT Point_3::x()`
+<li> `FT Point_3::y()`
+<li> `FT Point_3::z()`
+<li> `FT Point_3::cartesian(int)`
+<li> `FT Point_3::operator[](int)`
+<li> `Bbox_3 Point_3::bbox()`
+<li> `Vector_3 operator-(Point_3, Origin)`
+<li> `Vector_3 operator-(Origin, Point_3)`
+<li> `Weighted_point_3::Weighted_point_3(FT, FT, FT)`
+<li> `Weighted_point_3::Weighted_point_3(Point_3, FT)`
+<li> `Weighted_point_3::Weighted_point_3(Point_3)`
 <li> `Weighted_point_3::Weighted_point_3(Origin)`
-<li> `Vector_3::Vector_3(double,double,double)`
-<li> `Direction_3::Direction_3(double,double,double)`
-<li> `Direction_3::Direction_3(const Vector_3&)`
-<li> `Line_3::Line_3(const Point_3&, const Vector_3&)`
-<li> `Line_3::Line_3(const Point_3&, const Direction_3&)`
-<li> `Plane_3::Plane_3(double,double,double,double)`
-<li> `Circle_3::Circle_3(const Point_3&, double, const Plane_3&)`
-<li> `Sphere_3::Sphere_3(const Point_3&, double, Orientation = COUNTERCLOCKWISE)`
-<li> `Ray_3::Ray_3(const Point_3&, const Point_3&)`
-<li> `Segment_3::Segment_3(const Point_3&, const Point_3&)`
-<li> `Triangle_3::Triangle_3(const Point_3&, const Point_3&, const Point_3&)`
-<li> `Tetrahedron_3::Tetrahedron_3(const Point_3&, const Point_3&, const Point_3&, const Point_3&)`
-<li> `Iso_cuboid_3::Iso_cuboid_3(const Point_3&, const Point_3&)`
-<li> `Iso_cuboid_3::Iso_cuboid_3(const Point_3&, const Point_3&, int)`
-<li> `Iso_cuboid_3::Iso_cuboid_3(const Point_3&, const Point_3&, const Point_3&, const Point_3&, const Point_3&, const Point_3&)`
-<li> `Iso_cuboid_3::Iso_cuboid_3(const Bbox_3&)`
-<li> `Kernel::ConstructPoint_3()(const Weighted_point_3&)`
-<li> `Kernel::ConstructPoint_3()(Origin)`
-<li> `Kernel::ConstructWeightedPoint_3()(const Point_3&, double = 0)`
-<li> `Kernel::ConstructWeightedPoint_3()(Origin)`
-<li> `Kernel::ConstructVector_3()(Origin, const Point_3&)`
-<li> `Kernel::ConstructVector_3()(const Point_3&, Origin)`
-<li> `Kernel::ConstructVector_3()(Null_vector)`
-<li> `Kernel::ConstructDirection_3()(const Vector_3&)`
-<li> `Kernel::ConstructPlane_3()(double,double,double,double)`
-<li> `Kernel::ConstructIsoCuboid_3()(const Point_3&, const Point_3&)`
-<li> `Kernel::ConstructIsoCuboid_3()(const Point_3&, const Point_3&, int)`
-<li> `Kernel::ConstructIsoCuboid_3()(const Point_3&, const Point_3&, const Point_3&, const Point_3&, const Point_3&, const Point_3&)`
-<li> `Kernel::ConstructLine_3()(const Point_3&, const Vector_3&)`
-<li> `Kernel::ConstructLine_3()(const Point_3&, const Direction_3&)`
-<li> `Kernel::ConstructRay_3()(const Point_3&, const Point_3&)`
-<li> `Kernel::ConstructSphere_3()(const Point_3&, double, Orientation = COUNTERCLOCKWISE)`
-<li> `Kernel::ConstructSphere_3()(const Point_3&, Orientation = COUNTERCLOCKWISE)`
-<li> `Kernel::ConstructSegment_3()(const Point_3&, const Point_3&)`
-<li> `Kernel::ConstructTriangle_3()(const Point_3&, const Point_3&, const Point_3&)`
-<li> `Kernel::ConstructTetrahedron_3()(const Point_3&, const Point_3&, const Point_3&, const Point_3&)`
-<li> `Kernel::ConstructCircle_3()(const Point_3&, double, const Plane_3&)`
-<li> `Kernel::ConstructCircle_3()(
-<li> `Kernel::ConstructVertex_3()(const Segment_3&, int)`
-<li> `Kernel::ConstructVertex_3()(const Triangle_3&, int)`
-<li> `Kernel::ConstructVertex_3()(const Tetrahedron_3&, int)`
-<li> `Kernel::ConstructVertex_3()(const Iso_cuboid_3&, int)`
-<li> `Kernel::ConstructSource_3()(const Segment_3&)`
-<li> `Kernel::ConstructSource_3()(const Ray_3&)`
-<li> `Kernel::ConstructTarget_3()(const Target_3&)`
-<li> `Kernel::ConstructMinVertex_3()(const Segment_3&)`
-<li> `Kernel::ConstructMinVertex_3()(const Iso_cuboid_3&)`
-<li> `Kernel::ConstructMaxVertex_3()(const Segment_3&)`
-<li> `Kernel::ConstructMaxVertex_3()(const Iso_cuboid_3&)`
-<li> `Kernel::ConstructBbox_3()(const Point_3&)`
-<li> `Kernel::ConstructBbox_3()(const Segment_3&)`
-<li> `Kernel::ConstructBbox_3()(const Triangle_3&)`
-<li> `Kernel::ConstructBbox_3()(const Tetrahedron_3&)`
-<li> `Kernel::ConstructBbox_3()(const Iso_cuboid_3&)`
-<li> `Kernel::ConstructCenter_3()(const Sphere_3&)`
-<li> `Kernel::ConstructCenter_3()(const Circle_3&)`
-<li> `Kernel::ConstructSecondPoint_3()(const Ray_3&)`
-<li> `Kernel::ConstructOppositeVector_3()(const Vector_3&)`
-<li> `Kernel::ConstructOppositeDirection_3()(const Direction_3&)`
-<li> `Kernel::ConstructOppositeSegment_3()(const Segment_3&)`
-<li> `Kernel::ConstructOppositeRay_3()(const Ray_3&)`
-<li> `Kernel::ConstructOppositeLine_3()(const Line_3&)`
-<li> `Kernel::ConstructOppositeTriangle_3()(const Triangle_3&)`
-<li> `Kernel::ConstructOppositePlane_3()(const Plane_3&)`
-<li> `Kernel::ConstructOppositeSphere_3()(const Sphere_3&)`
-<li> `Kernel::ConstructOppositeCircle_3()(const Circle_3&)`
-<li> `Kernel::ComputeWeight_3()(const Weighted_point_3&)`
-<li> `Kernel::ComputeX_3()(const Point_3&)`
-<li> `Kernel::ComputeX_3()(const Vector_3&)`
-<li> `Kernel::ComputeY_3()(const Point_3&)`
-<li> `Kernel::ComputeY_3()(const Vector_3&)`
-<li> `Kernel::ComputeZ_3()(const Point_3&)`
-<li> `Kernel::ComputeZ_3()(const Vector_3&)`
-<li> `Kernel::ComputeA_3()(const Line_3&)`
-<li> `Kernel::ComputeB_3()(const Line_3&)`
-<li> `Kernel::ComputeC_3()(const Line_3&)`
-<li> `Kernel::ComputeD_3()(const Line_3&)`
-<li> `Kernel::ComputeDx_3()(const Direction_3&)`
-<li> `Kernel::ComputeDy_3()(const Direction_3&)`
-<li> `Kernel::ComputeDz_3()(const Direction_3&)`
-<li> `Kernel::ComputeXmin_3()(const Iso_cuboid_3&)`
-<li> `Kernel::ComputeXmax_3()(const Iso_cuboid_3&)`
-<li> `Kernel::ComputeYmin_3()(const Iso_cuboid_3&)`
-<li> `Kernel::ComputeYmax_3()(const Iso_cuboid_3&)`
-<li> `Kernel::ComputeZmin_3()(const Iso_cuboid_3&)`
-<li> `Kernel::ComputeZmax_3()(const Iso_cuboid_3&)`
-<li> `Kernel::ComputeSquaredRadius_3()(const Sphere_3&)`
-<li> `Kernel::ComputeSquaredRadius_3()(const Circle_3&)`
-<li> `Kernel::ComputeSquaredRadius_3()(const Point_3&)`
-<li> `Kernel::CartesianConstIterator_3()(const Point_3&)`
-<li> `Kernel::CartesianConstIterator_3()(const Point_3&, int)`
-<li> `Kernel::CartesianConstIterator_3()(const Vector_3&)`
-<li> `Kernel::CartesianConstIterator_3()(const Vector_3&, int)`
+<li> `Point_3 Weighted_point_3::point()`
+<li> `FT Weighted_point_3::weight()`
+<li> `FT Weighted_point_3::x()`
+<li> `FT Weighted_point_3::y()`
+<li> `FT Weighted_point_3::z()`
+<li> `FT Weighted_point_3::cartesian(int)`
+<li> `FT Weighted_point_3::operator[](int)`
+<li> `Bbox_3 Weighted_point_3::bbox()`
+<li> `Vector_3::Vector_3(FT, FT, FT)`
+<li> `Vector_3::Vector_3(Null_vector)`
+<li> `FT Vector_3::x()`
+<li> `FT Vector_3::y()`
+<li> `FT Vector_3::z()`
+<li> `FT Vector_3::cartesian(int)`
+<li> `FT Vector_3::operator[](int)`
+<li> `Direction_3 Vector_3::direction()`
+<li> `Vector_3 Vector_3::opposite()`
+<li> `Direction_3::Direction_3(RT, RT, RT)`
+<li> `Direction_3::Direction_3(Vector_3)`
+<li> `RT Direction_3::delta(int)`
+<li> `RT Direction_3::dx()`
+<li> `RT Direction_3::dy()`
+<li> `RT Direction_3::dz()`
+<li> `Direction_3 Direction_3::opposite()`
+<li> `Vector_3 Direction_3::vector()`
+<li> `Line_3::Line_3(Point_3, Vector_3)`
+<li> `Line_3::Line_3(Point_3, Direction_3)`
+<li> `Line_3 Line_3::opposite()`
+<li> `Vector_3 Line_3::to_vector()`
+<li> `Direction_3 Line_3::direction()`
+<li> `Plane_3::Plane_3(FT, FT, FT, FT)`
+<li> `Plane_3::Plane_3(Circle_3)`
+<li> `FT Plane_3::a()`
+<li> `FT Plane_3::b()`
+<li> `FT Plane_3::c()`
+<li> `FT Plane_3::d()`
+<li> `Plane_3 Plane_3::opposite()`
+<li> `Vector_3 Plane_3::orthogonal_vector()`
+<li> `Direction_3 Plane_3::orthogonal_direction()`
+<li> `Circle_3::Circle_3(Point_3, FT, Plane_3)`
+<li> `Point_3 Circle_3::center()`
+<li> `FT Circle_3::squared_radius()`
+<li> `FT Circle_3::supporting_plane()`
+<li> `Sphere_3 Circle_3::diametral_sphere()`
+<li> `Sphere_3::Sphere_3(Point_3, FT, Orientation)`
+<li> `Sphere_3::Sphere_3(Point_3, Orientation)`
+<li> `Sphere_3::Sphere_3(Circle_3)`
+<li> `Point_3 Sphere_3::center()`
+<li> `FT Sphere_3::squared_radius()`
+<li> `Orientation Sphere_3::orientation()`
+<li> `Sphere_3 Sphere_3::opposite()`
+<li> `Ray_3::Ray_3(Point_3, Point_3)`
+<li> `Point_3 Ray_3::source()`
+<li> `Segment_3::Segment_3(Point_3, Point_3)`
+<li> `Point_3 Segment_3::source()`
+<li> `Point_3 Segment_3::target()`
+<li> `Point_3 Segment_3::min()`
+<li> `Point_3 Segment_3::max()`
+<li> `Point_3 Segment_3::vertex(int)`
+<li> `Point_3 Segment_3::point(int)`
+<li> `Point_3 Segment_3::operator[](int)`
+<li> `Segment_3 Segment_3::opposite()`
+<li> `Bbox_3 Segment_3::bbox()`
+<li> `Triangle_3::Triangle_3(Point_3, Point_3, Point_3)`
+<li> `Point_3 Triangle_3::vertex(int)`
+<li> `Point_3 Triangle_3::operator[](int)`
+<li> `Bbox_3 Triangle_3::bbox()`
+<li> `Tetrahedron_3::Tetrahedron_3(Point_3, Point_3, Point_3, Point_3)`
+<li> `Point_3 Tetrahedron_3::vertex(int)`
+<li> `Point_3 Tetrahedron_3::operator[](int)`
+<li> `Bbox_3 Tetrahedron_3::bbox()`
+<li> `Iso_cuboid_3::Iso_cuboid_3(Point_3, Point_3)`
+<li> `Iso_cuboid_3::Iso_cuboid_3(Point_3, Point_3, int)`
+<li> `Iso_cuboid_3::Iso_cuboid_3(Point_3, Point_3, Point_3, Point_3, Point_3, Point_3)`
+<li> `Iso_cuboid_3::Iso_cuboid_3(Bbox_3)`
+<li> `Point_3 Iso_cuboid_3::vertex(int)`
+<li> `Point_3 Iso_cuboid_3::operator[](int)`
+<li> `Point_3 Iso_cuboid_3::min()`
+<li> `Point_3 Iso_cuboid_3::max()`
+<li> `FT Iso_cuboid_3::xmin()`
+<li> `FT Iso_cuboid_3::ymin()`
+<li> `FT Iso_cuboid_3::zmin()`
+<li> `FT Iso_cuboid_3::xmax()`
+<li> `FT Iso_cuboid_3::ymax()`
+<li> `FT Iso_cuboid_3::zmax()`
+<li> `FT Iso_cuboid_3::min_coord(int)`
+<li> `FT Iso_cuboid_3::max_coord(int)`
+<li> `Bbox_3 Iso_cuboid_3::bbox()`
 </ul>
 
 \cgalModels `Kernel`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h b/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h
index a32da1d2490d..d2e9a734ad41 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h
@@ -31,6 +31,7 @@ class Iso_cuboid_3 {
 introduces an iso-oriented cuboid `c` with diagonal
 opposite vertices `p` and `q`. Note that the object is
 brought in the canonical form.
+\cgalEpicExact
 */
 Iso_cuboid_3(const Point_3<Kernel> &p,
 const Point_3<Kernel> &q);
@@ -40,6 +41,8 @@ introduces an iso-oriented cuboid `c` with diagonal
 opposite vertices `p` and `q`. The `int` argument value
 is only used to distinguish the two overloaded functions.
 \pre `p.x()<=q.x()`, `p.y()<=q.y()` and `p.z()<=q.z()`.
+
+\cgalEpicExact
 */
 Iso_cuboid_3(const Point_3<Kernel> &p,
 const Point_3<Kernel> &q, int);
@@ -52,6 +55,7 @@ minimal \f$ y\f$ coordinate is the one of `bottom`, the
 maximal \f$ y\f$ coordinate is the one of `top`, the
 minimal \f$ z\f$ coordinate is the one of `far`, the
 maximal \f$ z\f$ coordinate is the one of `close`.
+\cgalEpicExact
 */
 Iso_cuboid_3(const Point_3<Kernel> &left,
 const Point_3<Kernel> &right,
@@ -75,6 +79,7 @@ const Kernel::RT& hw = RT(1));
 /*!
 If `Kernel::RT` is constructible from double,
 introduces an iso-oriented cuboid from `bbox`.
+\cgalEpicExact
 */
 Iso_cuboid_3(const Bbox_3& bbox);
 
@@ -97,6 +102,7 @@ bool operator!=(const Iso_cuboid_3<Kernel> &c2) const;
 /*!
 returns the i'th vertex modulo 8 of `c`.
 starting with the lower left vertex.
+\cgalEpicExact
 */
 Point_3<Kernel> vertex(int i) const;
 
@@ -104,52 +110,62 @@ Point_3<Kernel> vertex(int i) const;
 returns `vertex(i)`, as indicated in the figure below:
 \image html IsoCuboid.png
 \image latex IsoCuboid.png
+
+\cgalEpicExact
 */
 Point_3<Kernel> operator[](int i) const;
 
 /*!
 returns the smallest vertex of `c` (= `vertex(0)`).
+\cgalEpicExact
 */
 Point_3<Kernel> min() const;
 
 /*!
 returns the largest vertex of `c` (= `vertex(7)`).
+\cgalEpicExact
 */
 Point_3<Kernel> max() const;
 
 /*!
 returns smallest %Cartesian
 \f$ x\f$-coordinate in `c`.
+\cgalEpicExact
 */
 Kernel::FT xmin() const;
 
 /*!
 returns smallest %Cartesian
 \f$ y\f$-coordinate in `c`.
+\cgalEpicExact
 */
 Kernel::FT ymin() const;
 
 /*!
 returns smallest %Cartesian
 \f$ z\f$-coordinate in `c`.
+\cgalEpicExact
 */
 Kernel::FT zmin() const;
 
 /*!
 returns largest %Cartesian
 \f$ x\f$-coordinate in `c`.
+\cgalEpicExact
 */
 Kernel::FT xmax() const;
 
 /*!
 returns largest %Cartesian
 \f$ y\f$-coordinate in `c`.
+\cgalEpicExact
 */
 Kernel::FT ymax() const;
 
 /*!
 returns largest %Cartesian
 \f$ z\f$-coordinate in `c`.
+\cgalEpicExact
 */
 Kernel::FT zmax() const;
 
@@ -157,6 +173,8 @@ Kernel::FT zmax() const;
 returns `i`-th %Cartesian coordinate of
 the smallest vertex of `c`.
 \pre `0 <= i <= 2`.
+
+\cgalEpicExact
 */
 Kernel::FT min_coord(int i) const;
 
@@ -164,6 +182,8 @@ Kernel::FT min_coord(int i) const;
 returns `i`-th %Cartesian coordinate of
 the largest vertex of `c`.
 \pre `0 <= i <= 2`.
+
+\cgalEpicExact
 */
 Kernel::FT max_coord(int i) const;
 
@@ -213,6 +233,7 @@ Kernel::FT volume() const;
 
 /*!
 returns a bounding box containing `c`.
+\cgalEpicExact
 */
 Bbox_3 bbox() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h b/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h
index d7228803e0e2..764b6ac796f7 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h
@@ -32,6 +32,7 @@ class Iso_rectangle_2 {
 introduces an iso-oriented rectangle `r` with diagonal
 opposite vertices `p` and `q`. Note that the object is
 brought in the canonical form.
+\cgalEpicExact
 */
 Iso_rectangle_2(const Point_2<Kernel> &p,
 const Point_2<Kernel> &q);
@@ -41,6 +42,8 @@ introduces an iso-oriented rectangle `r` with diagonal
 opposite vertices `p` and `q`. The `int` argument value
 is only used to distinguish the two overloaded functions.
 \pre `p.x()<=q.x()` and `p.y()<=q.y()`.
+
+\cgalEpicExact
 */
 Iso_rectangle_2(const Point_2<Kernel> &p,
 const Point_2<Kernel> &q,
@@ -52,6 +55,7 @@ minimal \f$ x\f$ coordinate is the one of `left`, the
 maximal \f$ x\f$ coordinate is the one of `right`, the
 minimal \f$ y\f$ coordinate is the one of `bottom`, the
 maximal \f$ y\f$ coordinate is the one of `top`.
+\cgalEpicExact
 */
 Iso_rectangle_2(const Point_2<Kernel> &left,
 const Point_2<Kernel> &right,
@@ -71,6 +75,7 @@ const Kernel::RT& hw = RT(1));
 /*!
 If `Kernel::RT` is constructible from double,
 introduces an iso-oriented rectangle from `bbox`.
+\cgalEpicExact
 */
 Iso_rectangle_2(const Bbox_2& bbox);
 
@@ -93,41 +98,49 @@ bool operator!=(const Iso_rectangle_2<Kernel> &r2) const;
 /*!
 returns the i'th vertex modulo 4 of `r` in counterclockwise order,
 starting with the lower left vertex.
+\cgalEpicExact
 */
 Point_2<Kernel> vertex(int i) const;
 
 /*!
 returns `vertex(i)`.
+\cgalEpicExact
 */
 Point_2<Kernel> operator[](int i) const;
 
 /*!
 returns the lower left vertex of `r` (= `vertex(0)`).
+\cgalEpicExact
 */
 Point_2<Kernel> min() const;
 
 /*!
 returns the upper right vertex of `r` (= `vertex(2)`).
+\cgalEpicExact
 */
 Point_2<Kernel> max() const;
 
 /*!
 returns the \f$ x\f$ coordinate of lower left vertex of `r`.
+\cgalEpicExact
 */
 Kernel::FT xmin() const;
 
 /*!
 returns the \f$ y\f$ coordinate of lower left vertex of `r`.
+\cgalEpicExact
 */
 Kernel::FT ymin() const;
 
 /*!
 returns the \f$ x\f$ coordinate of upper right vertex of `r`.
+\cgalEpicExact
 */
 Kernel::FT xmax() const;
 
 /*!
 returns the \f$ y\f$ coordinate of upper right vertex of `r`.
+\cgalEpicExact
 */
 Kernel::FT ymax() const;
 
@@ -135,6 +148,8 @@ Kernel::FT ymax() const;
 returns the `i`'th %Cartesian coordinate of the
 lower left vertex of `r`.
 \pre `0 <= i <= 1`.
+
+\cgalEpicExact
 */
 Kernel::FT min_coord(int i) const;
 
@@ -142,6 +157,8 @@ Kernel::FT min_coord(int i) const;
 returns the `i`'th %Cartesian coordinate of the
 upper right vertex of `r`.
 \pre `0 <= i <= 1`.
+
+\cgalEpicExact
 */
 Kernel::FT max_coord(int i) const;
 
@@ -191,6 +208,7 @@ Kernel::FT area() const;
 
 /*!
 returns a bounding box containing `r`.
+\cgalEpicExact
 */
 Bbox_2 bbox() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Line_2.h b/Kernel_23/doc/Kernel_23/CGAL/Line_2.h
index 079c65a6eb6c..2cd4a22a791b 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Line_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Line_2.h
@@ -47,6 +47,7 @@ class Line_2 {
 /*!
 introduces a line `l` with the line equation in %Cartesian
 coordinates \f$ ax +by +c = 0\f$.
+\cgalEpicExact
 */
 Line_2(const Kernel::RT &a, const Kernel::RT &b, const Kernel::RT &c);
 
@@ -98,16 +99,19 @@ bool operator!=(const Line_2<Kernel> &h) const;
 
 /*!
 returns the first coefficient of `l`.
+\cgalEpicExact
 */
 Kernel::RT a() const;
 
 /*!
 returns the second coefficient of `l`.
+\cgalEpicExact
 */
 Kernel::RT b() const;
 
 /*!
 returns the third coefficient of `l`.
+\cgalEpicExact
 */
 Kernel::RT c() const;
 
@@ -205,6 +209,7 @@ Direction_2<Kernel> direction() const;
 
 /*!
 returns the line with opposite direction.
+\cgalEpicExact
 */
 Line_2<Kernel> opposite() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Line_3.h b/Kernel_23/doc/Kernel_23/CGAL/Line_3.h
index e7b19f591073..57be8fabf5b1 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Line_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Line_3.h
@@ -25,12 +25,14 @@ Line_3(const Point_3<Kernel> &p, const Point_3<Kernel> &q);
 /*!
 introduces a line `l` passing through point `p` with
 direction `d`.
+\cgalEpicExact
 */
 Line_3(const Point_3<Kernel> &p, const Direction_3<Kernel>&d);
 
 /*!
 introduces a line `l` passing through point `p` and
 oriented by `v`.
+\cgalEpicExact
 */
 Line_3(const Point_3<Kernel> &p, const Vector_3<Kernel>&v);
 
@@ -100,16 +102,19 @@ Plane_3<Kernel> perpendicular_plane(const Point_3<Kernel> &p) const;
 
 /*!
 returns the line with opposite direction.
+\cgalEpicExact
 */
 Line_3<Kernel> opposite() const;
 
 /*!
 returns a vector having the same direction as `l`.
+\cgalEpicExact
 */
 Vector_3<Kernel> to_vector() const;
 
 /*!
 returns the direction of `l`.
+\cgalEpicExact
 */
 Direction_3<Kernel> direction() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Plane_3.h b/Kernel_23/doc/Kernel_23/CGAL/Plane_3.h
index 9ef778c7c174..88c71c73700b 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Plane_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Plane_3.h
@@ -29,6 +29,7 @@ creates a plane `h` defined by the equation
 \f$ a\, px +b\, py +c\, pz + d = 0\f$.
 Notice that `h` is degenerate if
 \f$ a = b = c = 0\f$.
+\cgalEpicExact
 */
 Plane_3(const Kernel::RT &a,
 const Kernel::RT &b,
@@ -84,6 +85,7 @@ const Point_3<Kernel> &p);
 /*!
 introduces a plane `h` that is defined as the plane containing
 the circle.
+\cgalEpicExact
 */
 Plane_3(const Circle_3<Kernel> &c);
 
@@ -105,21 +107,25 @@ bool operator!=(const Plane_3<Kernel> &h2) const;
 
 /*!
 returns the first coefficient of `h`.
+\cgalEpicExact
 */
 Kernel::RT a() const;
 
 /*!
 returns the second coefficient of `h`.
+\cgalEpicExact
 */
 Kernel::RT b() const;
 
 /*!
 returns the third coefficient of `h`.
+\cgalEpicExact
 */
 Kernel::RT c() const;
 
 /*!
 returns the fourth coefficient of `h`.
+\cgalEpicExact
 */
 Kernel::RT d() const;
 
@@ -137,6 +143,7 @@ Point_3<Kernel> projection(const Point_3<Kernel> &p) const;
 
 /*!
 returns the plane with opposite orientation.
+\cgalEpicExact
 */
 Plane_3<Kernel> opposite() const;
 
@@ -148,12 +155,14 @@ Point_3<Kernel> point() const;
 /*!
 returns a vector that is orthogonal to `h` and that
 is directed to the positive side of `h`.
+\cgalEpicExact
 */
 Vector_3<Kernel> orthogonal_vector() const;
 
 /*!
 returns the direction that is orthogonal to `h` and that
 is directed to the positive side of `h`.
+\cgalEpicExact
 */
 Direction_3<Kernel> orthogonal_direction() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Point_2.h b/Kernel_23/doc/Kernel_23/CGAL/Point_2.h
index 00ea07ef2fbc..ffa2cf49cc92 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Point_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Point_2.h
@@ -55,6 +55,7 @@ typedef unspecified_type Cartesian_const_iterator;
 /*!
 introduces a variable `p` with %Cartesian coordinates
 \f$ (0,0)\f$.
+\cgalEpicExact
 */
 Point_2(const Origin &ORIGIN);
 
@@ -66,6 +67,7 @@ Point_2(int x, int y);
 /*!
 introduces a point `p` initialized to `(x,y)`
 provided `RT` supports construction from `double`.
+\cgalEpicExact
 */
 Point_2(double x, double y);
 
@@ -77,11 +79,13 @@ Point_2(const Kernel::RT &hx, const Kernel::RT &hy, const Kernel::RT &hw = RT(1)
 
 /*!
 introduces a point `p` initialized to `(x,y)`.
+\cgalEpicExact
 */
 Point_2(const Kernel::FT &x, const Kernel::FT &y);
 
 /*!
 introduces a point from a weighted point.
+\cgalEpicExact
 
 \warning The `explicit` keyword is used to avoid accidental implicit conversions
          between Point_2 and Weighted_point_2.
@@ -141,11 +145,13 @@ Kernel::RT hw() const;
 
 /*!
 returns the %Cartesian \f$ x\f$ coordinate, that is `hx()`/`hw()`.
+\cgalEpicExact
 */
 Kernel::FT x() const;
 
 /*!
 returns the %Cartesian \f$ y\f$ coordinate, that is `hy()`/`hw()`.
+\cgalEpicExact
 */
 Kernel::FT y() const;
 
@@ -166,12 +172,16 @@ Kernel::RT homogeneous(int i) const;
 /*!
 returns the i'th %Cartesian coordinate of `p`.
 \pre `0 <= i <= 1`.
+
+\cgalEpicExact
 */
 Kernel::FT cartesian(int i) const;
 
 /*!
 returns `cartesian(i)`.
 \pre `0 <= i <= 1`.
+
+\cgalEpicExact
 */
 Kernel::FT operator[](int i) const;
 
@@ -194,6 +204,7 @@ int dimension() const;
 
 /*!
 returns a bounding box containing `p`.
+\cgalEpicExact
 */
 Bbox_2 bbox() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Point_3.h b/Kernel_23/doc/Kernel_23/CGAL/Point_3.h
index 0babd70a4c84..70db98ff117c 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Point_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Point_3.h
@@ -40,6 +40,7 @@ typedef unspecified_type Cartesian_const_iterator;
 
 /*!
 introduces a point with %Cartesian coordinates\f$ (0,0,0)\f$.
+\cgalEpicExact
 */
 Point_3(const Origin &ORIGIN);
 
@@ -51,6 +52,7 @@ Point_3(int x, int y, int z);
 /*!
 introduces a point `p` initialized to `(x,y,z)`
 provided `RT` supports it.
+\cgalEpicExact
 */
 Point_3(double x, double y, double z);
 
@@ -62,6 +64,7 @@ Point_3(const Kernel::RT &hx, const Kernel::RT &hy, const Kernel::RT &hz, const
 
 /*!
 introduces a point `p` initialized to `(x,y,z)`.
+\cgalEpicExact
 */
 Point_3(const Kernel::FT &x, const Kernel::FT &y, const Kernel::FT &z);
 
@@ -70,6 +73,8 @@ introduces a point from a weighted point.
 
 \warning The `explicit` keyword is used to avoid accidental implicit conversions
          between Point_3 and Weighted_point_3.
+
+\cgalEpicExact
 */
 explicit Point_3(const Kernel::Weighted_point_3 &wp);
 
@@ -131,16 +136,19 @@ Kernel::RT hw() const;
 
 /*!
 returns the %Cartesian \f$ x\f$ coordinate, that is `hx()`/`hw()`.
+\cgalEpicExact
 */
 Kernel::FT x() const;
 
 /*!
 returns the %Cartesian \f$ y\f$ coordinate, that is `hy()`/`hw()`.
+\cgalEpicExact
 */
 Kernel::FT y() const;
 
 /*!
 returns the %Cartesian \f$ z\f$ coordinate, that is `hz()`/`hw()`.
+\cgalEpicExact
 */
 Kernel::FT z() const;
 
@@ -161,12 +169,16 @@ Kernel::RT homogeneous(int i) const;
 /*!
 returns the i'th %Cartesian coordinate of `p`.
 \pre `0 <= i <= 2`.
+
+\cgalEpicExact
 */
 Kernel::FT cartesian(int i) const;
 
 /*!
 returns `cartesian(i)`.
 \pre `0 <= i <= 2`.
+
+\cgalEpicExact
 */
 Kernel::FT operator[](int i) const;
 
@@ -189,6 +201,7 @@ int dimension() const;
 
 /*!
 returns a bounding box containing `p`.
+\cgalEpicExact
 */
 Bbox_3 bbox() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Ray_2.h b/Kernel_23/doc/Kernel_23/CGAL/Ray_2.h
index c153b0f9ee38..c38f84606eea 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Ray_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Ray_2.h
@@ -20,6 +20,7 @@ class Ray_2 {
 /*!
 introduces a ray `r`
 with source `p` and passing through point `q`.
+\cgalEpicExact
 */
 Ray_2(const Point_2<Kernel> &p, const Point_2<Kernel>&q);
 
@@ -59,6 +60,7 @@ bool operator!=(const Ray_2<Kernel> &h) const;
 
 /*!
 returns the source of `r`.
+\cgalEpicExact
 */
 Point_2<Kernel> source() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Ray_3.h b/Kernel_23/doc/Kernel_23/CGAL/Ray_3.h
index 86e6efce248a..766e7403240c 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Ray_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Ray_3.h
@@ -20,6 +20,7 @@ class Ray_3 {
 /*!
 introduces a ray `r`
 with source `p` and passing through point `q`.
+\cgalEpicExact
 */
 Ray_3(const Point_3<Kernel> &p, const Point_3<Kernel> &q);
 
@@ -59,6 +60,7 @@ bool operator!=(const Ray_3<Kernel> &h) const;
 
 /*!
 returns the source of `r`
+\cgalEpicExact
 */
 Point_3<Kernel> source() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Segment_2.h b/Kernel_23/doc/Kernel_23/CGAL/Segment_2.h
index 71ae42573350..b2ce17ed50f0 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Segment_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Segment_2.h
@@ -29,6 +29,7 @@ class Segment_2 {
 introduces a segment `s` with source `p`
 and target `q`. The segment is directed from the source towards
 the target.
+\cgalEpicExact
 */
 Segment_2(const Point_2<Kernel> &p, const Point_2<Kernel> &q);
 
@@ -50,21 +51,25 @@ bool operator!=(const Segment_2<Kernel> &q) const;
 
 /*!
 returns the source of `s`.
+\cgalEpicExact
 */
 Point_2<Kernel> source() const;
 
 /*!
 returns the target of `s`.
+\cgalEpicExact
 */
 Point_2<Kernel> target() const;
 
 /*!
 returns the point of `s` with lexicographically smallest coordinate.
+\cgalEpicExact
 */
 Point_2<Kernel> min() const;
 
 /*!
 returns the point of `s` with lexicographically largest coordinate.
+\cgalEpicExact
 */
 Point_2<Kernel> max() const;
 
@@ -73,16 +78,19 @@ returns source or target of `s`: `vertex(0)` returns
 the source of `s`, `vertex(1)` returns the target of `s`.
 The parameter `i` is taken modulo 2, which gives
 easy access to the other vertex.
+\cgalEpicExact
 */
 Point_2<Kernel> vertex(int i) const;
 
 /*!
 returns `vertex(i)`.
+\cgalEpicExact
 */
 Point_2<Kernel> point(int i) const;
 
 /*!
 returns `vertex(i)`.
+\cgalEpicExact
 */
 Point_2<Kernel> operator[](int i) const;
 
@@ -103,6 +111,7 @@ Vector_2<Kernel> to_vector() const;
 
 /*!
 returns a segment with source and target point interchanged.
+\cgalEpicExact
 */
 Segment_2<Kernel> opposite() const;
 
@@ -152,6 +161,7 @@ bool collinear_has_on(const Point_2<Kernel> &p) const;
 
 /*!
 returns a bounding box containing `s`.
+\cgalEpicExact
 */
 Bbox_2 bbox() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Segment_3.h b/Kernel_23/doc/Kernel_23/CGAL/Segment_3.h
index 36dcda524944..dc3dd9b4f1c8 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Segment_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Segment_3.h
@@ -29,6 +29,7 @@ class Segment_3 {
 introduces a segment `s` with source `p`
 and target `q`. It is directed from the source towards
 the target.
+\cgalEpicExact
 */
 Segment_3(const Point_3<Kernel> &p, const Point_3<Kernel> &q);
 
@@ -50,21 +51,25 @@ bool operator!=(const Segment_3<Kernel> &q) const;
 
 /*!
 returns the source of `s`.
+\cgalEpicExact
 */
 Point_3<Kernel> source() const;
 
 /*!
 returns the target of `s`.
+\cgalEpicExact
 */
 Point_3<Kernel> target() const;
 
 /*!
 returns the point of `s` with smallest coordinate (lexicographically).
+\cgalEpicExact
 */
 Point_3<Kernel> min() const;
 
 /*!
 returns the point of `s` with largest coordinate (lexicographically).
+\cgalEpicExact
 */
 Point_3<Kernel> max() const;
 
@@ -73,16 +78,19 @@ returns source or target of `s`: `vertex(0)` returns
 the source, `vertex(1)` returns the target.
 The parameter `i` is taken modulo 2, which gives
 easy access to the other vertex.
+\cgalEpicExact
 */
 Point_3<Kernel> vertex(int i) const;
 
 /*!
 returns `vertex(i)`.
+\cgalEpicExact
 */
 Point_3<Kernel> point(int i) const;
 
 /*!
 returns `vertex(i)`.
+\cgalEpicExact
 */
 Point_3<Kernel> operator[](int i) const;
 
@@ -103,6 +111,7 @@ Direction_3<Kernel> direction() const;
 
 /*!
 returns a segment with source and target interchanged.
+\cgalEpicExact
 */
 Segment_3<Kernel> opposite() const;
 
@@ -126,6 +135,7 @@ bool has_on(const Point_3<Kernel> &p) const;
 
 /*!
 returns a bounding box containing `s`.
+\cgalEpicExact
 */
 Bbox_3 bbox() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Sphere_3.h b/Kernel_23/doc/Kernel_23/CGAL/Sphere_3.h
index f8541de6dd30..04fef101b3c9 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Sphere_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Sphere_3.h
@@ -29,6 +29,8 @@ It is initialized to the sphere with center `center`,
 squared radius `squared_radius` and orientation
 `orientation`.
 \pre `orientation != COPLANAR` and `squared_radius >= 0`.
+
+\cgalEpicExact
 */
 Sphere_3( const Point_3<Kernel> & center,
           const Kernel::FT & squared_radius,
@@ -78,6 +80,8 @@ It is initialized to the sphere with center `center`, squared
 radius zero and orientation `orientation`.
 \pre `orientation != COPLANAR`.
 \post `c.is_degenerate()` = `true`.
+
+\cgalEpicExact
 */
 Sphere_3( const Point_3<Kernel> & center,
           const Orientation& orientation = COUNTERCLOCKWISE);
@@ -86,6 +90,7 @@ Sphere_3( const Point_3<Kernel> & center,
 
 introduces a variable `c` of type `Sphere_3`.
 It is initialized to the diametral sphere of the circle.
+\cgalEpicExact
 */
 Sphere_3( const Circle_3<Kernel> & c );
 
@@ -97,18 +102,21 @@ Sphere_3( const Circle_3<Kernel> & c );
 /*!
 
 returns the center of `c`.
+\cgalEpicExact
 */
 const Point_3<Kernel> & center( ) const;
 
 /*!
 
 returns the squared radius of `c`.
+\cgalEpicExact
 */
 Kernel::FT const& squared_radius( ) const;
 
 /*!
 
 returns the orientation of `c`.
+\cgalEpicExact
 */
 Orientation const& orientation( ) const;
 
@@ -202,6 +210,7 @@ bool has_on(const Circle_3<Kernel> &p) const;
 
 returns the sphere with the same center and squared radius as
 `c` but with opposite orientation.
+\cgalEpicExact
 */
 Sphere_3<Kernel> opposite() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h b/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h
index 649a874e2423..d045765309e6 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h
@@ -29,6 +29,7 @@ class Tetrahedron_3 {
 
 /*!
 introduces a tetrahedron `t` with vertices `p0`, `p1`, `p2` and `p3`.
+\cgalEpicExact
 */
 Tetrahedron_3(const Point_3<Kernel> &p0,
 const Point_3<Kernel> &p1,
@@ -54,11 +55,13 @@ bool operator!=(const Tetrahedron_3<Kernel> &t2) const;
 
 /*!
 returns the i'th vertex modulo 4 of `t`.
+\cgalEpicExact
 */
 Point_3<Kernel> vertex(int i) const;
 
 /*!
 returns `vertex(int i)`.
+\cgalEpicExact
 */
 Point_3<Kernel> operator[](int i) const;
 
@@ -129,6 +132,7 @@ Kernel::FT volume() const;
 
 /*!
 returns a bounding box containing `t`.
+\cgalEpicExact
 */
 Bbox_3 bbox() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h b/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h
index e19f43bc5226..8812fe4d09cb 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h
@@ -25,6 +25,7 @@ class Triangle_2 {
 
 /*!
 introduces a triangle `t` with vertices `p`, `q` and `r`.
+\cgalEpicExact
 */
 Triangle_2(const Point_2<Kernel> &p,
 const Point_2<Kernel> &q,
@@ -49,11 +50,13 @@ bool operator!=(const Triangle_2<Kernel> &t2) const;
 
 /*!
 returns the i'th vertex modulo 3 of `t`.
+\cgalEpicExact
 */
 Point_2<Kernel> vertex(int i) const;
 
 /*!
 returns `vertex(i)`.
+\cgalEpicExact
 */
 Point_2<Kernel> operator[](int i) const;
 
@@ -127,6 +130,7 @@ bool has_on_unbounded_side(const Point_2<Kernel> &p) const;
 returns a triangle where the boundary is oriented the other
 way round (this flips the positive and the negative side, but
 not the bounded and unbounded side).
+\cgalEpicExact
 */
 Triangle_2<Kernel> opposite();
 
@@ -137,6 +141,7 @@ Kernel::FT area() const;
 
 /*!
 returns a bounding box containing `t`.
+\cgalEpicExact
 */
 Bbox_2 bbox() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h b/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h
index d0dadad48b80..1f9396d91e54 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h
@@ -20,6 +20,7 @@ class Triangle_3 {
 
 /*!
 introduces a triangle `t` with vertices `p`, `q` and `r`.
+\cgalEpicExact
 */
 Triangle_3(const Point_3<Kernel> &p,
 const Point_3<Kernel> &q,
@@ -44,11 +45,13 @@ bool operator!=(const Triangle_3<Kernel> &t2) const;
 
 /*!
 returns the i'th vertex modulo 3 of `t`.
+\cgalEpicExact
 */
 Point_3<Kernel> vertex(int i) const;
 
 /*!
 returns `vertex(int i)`.
+\cgalEpicExact
 */
 Point_3<Kernel> operator[](int i) const;
 
@@ -86,6 +89,7 @@ Kernel::FT squared_area() const;
 
 /*!
 returns a bounding box containing `t`.
+\cgalEpicExact
 */
 Bbox_3 bbox() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h b/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
index eaeab03a882a..c8b45010ae48 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
@@ -66,6 +66,7 @@ Vector_2(int x, int y);
 
 /*!
 introduces a vector `v` initialized to `(x,y)`.
+\cgalEpicExact
 */
 Vector_2(double x, double y);
 
@@ -77,6 +78,7 @@ Vector_2(const Kernel::RT &hx, const Kernel::RT &hy, const Kernel::RT &hw = RT(1
 
 /*!
 introduces a vector `v` initialized to `(x,y)`.
+\cgalEpicExact
 */
 Vector_2(const Kernel::FT &x, const Kernel::FT &y);
 
@@ -107,11 +109,13 @@ Kernel::RT hw() const;
 
 /*!
 returns the `x`-coordinate of `v`, that is `hx()`/`hw()`.
+\cgalEpicExact
 */
 Kernel::FT x() const;
 
 /*!
 returns the `y`-coordinate of `v`, that is `hy()`/`hw()`.
+\cgalEpicExact
 */
 Kernel::FT y() const;
 
@@ -133,12 +137,16 @@ Kernel::RT homogeneous(int i) const;
 /*!
 returns the i'th Cartesian coordinate of `v`.
 \pre `0 <= i <= 1`.
+
+\cgalEpicExact
 */
 Kernel::FT cartesian(int i) const;
 
 /*!
 returns `cartesian(i)`.
 \pre `0 <= i <= 1`.
+
+\cgalEpicExact
 */
 Kernel::FT operator[](int i) const;
 
@@ -161,6 +169,7 @@ int dimension() const;
 
 /*!
 returns the direction which passes through `v`.
+\cgalEpicExact
 */
 Direction_2<Kernel> direction() const;
 
@@ -216,6 +225,7 @@ Vector_2<Kernel>& operator-=(const Vector_2<Kernel> &w);
 
 /*!
 returns the opposite vector.
+\cgalEpicExact
 */
 Vector_2<Kernel> operator-() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h b/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h
index d126bd977403..e1c38752e677 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h
@@ -59,6 +59,7 @@ Vector_3(const Line_3<Kernel> &l);
 
 /*!
 introduces a null vector `v`.
+\cgalEpicExact
 */
 Vector_3(const Null_vector &NULL_VECTOR);
 
@@ -69,6 +70,7 @@ Vector_3(int x, int y, int z);
 
 /*!
 introduces a vector `v` initialized to `(x, y, z)`.
+\cgalEpicExact
 */
 Vector_3(double x, double y, double z);
 
@@ -79,6 +81,7 @@ Vector_3(const Kernel::RT &hx, const Kernel::RT &hy, const Kernel::RT &hz, const
 
 /*!
 introduces a vector `v` initialized to `(x, y, z)`.
+\cgalEpicExact
 */
 Vector_3(const Kernel::FT &x, const Kernel::FT &y, const Kernel::FT &z);
 
@@ -114,16 +117,19 @@ Kernel::RT hw() const;
 
 /*!
 returns the `x`-coordinate of `v`, that is `hx()`/`hw()`.
+\cgalEpicExact
 */
 Kernel::FT x() const;
 
 /*!
 returns the `y`-coordinate of `v`, that is `hy()`/`hw()`.
+\cgalEpicExact
 */
 Kernel::FT y() const;
 
 /*!
 returns the `z` coordinate of `v`, that is `hz()`/`hw()`.
+\cgalEpicExact
 */
 Kernel::FT z() const;
 
@@ -144,12 +150,16 @@ Kernel::RT homogeneous(int i) const;
 /*!
 returns the i'th %Cartesian coordinate of `v`.
 \pre  `0 <= i <= 2`
+
+\cgalEpicExact
 */
 Kernel::FT cartesian(int i) const;
 
 /*!
 returns `cartesian(i)`.
 \pre  `0 <= i <= 2`
+
+\cgalEpicExact
 */
 Kernel::FT operator[](int i) const;
 
@@ -177,6 +187,8 @@ Vector_3<Kernel> transform(const Aff_transformation_3<Kernel> &t) const;
 
 /*!
 returns the direction of `v`.
+
+\cgalEpicExact
 */
 Direction_3<Kernel> direction() const;
 
@@ -220,6 +232,7 @@ Vector_3<Kernel>& operator-=(const Vector_3<Kernel> &w);
 
 /*!
 Returns the opposite vector.
+\cgalEpicExact
 */
 Vector_3<Kernel> operator-() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
index 01a147e6d645..a61368add0ed 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
@@ -43,12 +43,14 @@ class Weighted_point_2
 
   /*!
   introduces a weighted point with %Cartesian coordinates `(0,0)` and weight `0`.
+  \cgalEpicExact
   */
   Weighted_point_2(const Origin &ORIGIN);
 
   /*!
   introduces a weighted point from point `p` and weight `0`.
-
+  \cgalEpicExact
+  
   \warning The `explicit` keyword is used to avoid accidental implicit conversions
            between Point_2 and Weighted_point_2.
   */
@@ -56,11 +58,13 @@ class Weighted_point_2
 
   /*!
   introduces a weighted point from point `p` and weight `w`.
+  \cgalEpicExact
   */
   Weighted_point_2(const Point_2<Kernel>& p, Kernel::FT& w);
 
   /*!
   introduces a weighted point with coordinates `x`, `y`, and weight `0`.
+  \cgalEpicExact
   */
   Weighted_point_2(const Kernel::FT& x, const Kernel::FT& y);
 
@@ -71,11 +75,13 @@ class Weighted_point_2
 
   /*!
   returns the point of the weighted point.
+  \cgalEpicExact
   */
   Point_2<Kernel> point() const;
 
   /*!
   returns the weight of the weighted point.
+  \cgalEpicExact
   */
   Kernel::FT weight() const;
   /// @}
@@ -129,11 +135,13 @@ class Weighted_point_2
 
   /*!
   returns the %Cartesian \f$ x\f$ coordinate, that is `hx()`/`hw()`.
+  \cgalEpicExact
   */
   Kernel::FT x() const;
 
   /*!
   returns the %Cartesian \f$ y\f$ coordinate, that is `hy()`/`hw()`.
+  \cgalEpicExact
   */
   Kernel::FT y() const;
 
@@ -154,12 +162,16 @@ class Weighted_point_2
   /*!
   returns the i'th %Cartesian coordinate of `p`.
   \pre  `0 <= i <= 1`
+  
+  \cgalEpicExact
   */
   Kernel::FT cartesian(int i) const;
 
   /*!
   returns `cartesian(i)`.
   \pre  `0 <= i <= 1`
+  
+  \cgalEpicExact
   */
   Kernel::FT operator[](int i) const;
 
@@ -182,6 +194,7 @@ class Weighted_point_2
 
   /*!
   returns a bounding box containing `p`.
+  \cgalEpicExact
   */
   Bbox_2 bbox() const;
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h
index 3dcb39e1786b..22a1f071fe74 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h
@@ -43,6 +43,7 @@ class Weighted_point_3
 
   /*!
   introduces a weighted point with %Cartesian coordinates `(0,0,0)` and weight `0`.
+  \cgalEpicExact
   */
   Weighted_point_3(const Origin &ORIGIN);
 
@@ -51,16 +52,20 @@ class Weighted_point_3
 
   \warning The `explicit` keyword is used to avoid accidental implicit conversions
            between Point_3 and Weighted_point_3.
+
+  \cgalEpicExact
   */
   explicit Weighted_point_3(const Point_3<Kernel>& p);
 
   /*!
   introduces a weighted point from point `p` and weight `w`.
+  \cgalEpicExact
   */
   Weighted_point_3(const Point_3<Kernel>& p, Kernel::FT& w);
 
   /*!
   introduces a weighted point with coordinates `x`, `y`, `z` and weight `0`.
+  \cgalEpicExact
   */
   Weighted_point_3(const Kernel::FT& x, const Kernel::FT& y, const Kernel::FT& z);
 
@@ -71,11 +76,13 @@ class Weighted_point_3
 
   /*!
   returns the point of the weighted point.
+  \cgalEpicExact
   */
   Point_3<Kernel> point() const;
 
   /*!
   returns the weight of the weighted point.
+  \cgalEpicExact
   */
   Kernel::FT weight() const;
   /// @}
@@ -134,16 +141,19 @@ class Weighted_point_3
 
   /*!
   returns the %Cartesian \f$ x\f$ coordinate, that is `hx()`/`hw()`.
+  \cgalEpicExact
   */
   Kernel::FT x() const;
 
   /*!
   returns the %Cartesian \f$ y\f$ coordinate, that is `hy()`/`hw()`.
+  \cgalEpicExact
   */
   Kernel::FT y() const;
 
   /*!
   returns the %Cartesian \f$ z\f$ coordinate, that is `hz()`/`hw()`.
+  \cgalEpicExact
   */
   Kernel::FT z() const;
 
@@ -164,12 +174,16 @@ class Weighted_point_3
   /*!
   returns the i'th %Cartesian coordinate of `p`.
   \pre  `0 <= i <= 2`
+
+  \cgalEpicExact
   */
   Kernel::FT cartesian(int i) const;
 
   /*!
   returns `cartesian(i)`.
   \pre  `0 <= i <= 2`
+
+  \cgalEpicExact
   */
   Kernel::FT operator[](int i) const;
 
@@ -192,6 +206,7 @@ class Weighted_point_3
 
   /*!
   returns a bounding box containing `p`.
+  \cgalEpicExact
   */
   Bbox_3 bbox() const;
 

From f6451700d13abd352ff3426effb37ff5c4038bef Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 27 Apr 2023 15:19:35 +0200
Subject: [PATCH 0256/1398] fix memory leak

---
 AABB_tree/demo/AABB_tree/MainWindow.cpp | 2 +-
 AABB_tree/demo/AABB_tree/MainWindow.h   | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/AABB_tree/demo/AABB_tree/MainWindow.cpp b/AABB_tree/demo/AABB_tree/MainWindow.cpp
index 4321e396b8d4..cd1444b9968c 100644
--- a/AABB_tree/demo/AABB_tree/MainWindow.cpp
+++ b/AABB_tree/demo/AABB_tree/MainWindow.cpp
@@ -16,7 +16,7 @@
 
 
 MainWindow::MainWindow(QWidget* parent)
-  : CGAL::Qt::DemosMainWindow(parent), myEngine(new QJSEngine())
+  : CGAL::Qt::DemosMainWindow(parent), myEngine(new QJSEngine(this))
 {
   ui = new Ui::MainWindow;
   ui->setupUi(this);
diff --git a/AABB_tree/demo/AABB_tree/MainWindow.h b/AABB_tree/demo/AABB_tree/MainWindow.h
index 50cd927a7cb4..87f6de0c76c9 100644
--- a/AABB_tree/demo/AABB_tree/MainWindow.h
+++ b/AABB_tree/demo/AABB_tree/MainWindow.h
@@ -23,7 +23,7 @@ struct Foo : public QObject
   QJSEngine* myEngine;
 
   Foo()
-    : myEngine(new QJSEngine())
+    : myEngine(new QJSEngine(this))
   {
       QJSValue baz = myEngine->newQObject(this);
       myEngine->.globalObject().setProperty("baz", baz);

From 003ce240b65d2563fbb9799262c9912df32b5893 Mon Sep 17 00:00:00 2001
From: Michael Hoffmann <hoffmann@inf.ethz.ch>
Date: Thu, 27 Apr 2023 15:34:53 +0200
Subject: [PATCH 0257/1398] Added EPIC exact tag for the (two relevant) global
 functions.

---
 .../CGAL/Exact_predicates_inexact_constructions_kernel.h      | 4 ++++
 Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h        | 4 ++++
 2 files changed, 8 insertions(+)

diff --git a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
index 8a5e33aa5fc8..3349ebca9777 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
@@ -204,6 +204,10 @@ are trivial:</p>
 <li> `FT Iso_cuboid_3::min_coord(int)`
 <li> `FT Iso_cuboid_3::max_coord(int)`
 <li> `Bbox_3 Iso_cuboid_3::bbox()`
+<li> `Point_2 min_vertex(Iso_rectangle_2)`
+<li> `Point_2 min_vertex(Iso_cuboid_3)`
+<li> `Point_2 max_vertex(Iso_rectangle_2)`
+<li> `Point_2 max_vertex(Iso_cuboid_3)`
 </ul>
 
 \cgalModels `Kernel`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
index 6be2530b49b6..7ac44aca209b 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
@@ -2242,12 +2242,14 @@ const CGAL::Point_3<Kernel>& q);
 
 /*!
 computes the vertex with the lexicographically largest coordinates of the iso rectangle `ir`.
+\cgalEpicExact
 */
 template <typename Kernel>
 CGAL::Point_2<Kernel> max_vertex( const CGAL::Iso_rectangle_2<Kernel>& ir );
 
 /*!
 computes the vertex with the lexicographically largest coordinates of the iso cuboid `ic`.
+\cgalEpicExact
 */
 template <typename Kernel>
 CGAL::Point_3<Kernel> max_vertex( const CGAL::Iso_cuboid_3<Kernel>& ic );
@@ -2292,12 +2294,14 @@ CGAL::Point_3<Kernel> midpoint( const CGAL::Segment_3<Kernel>& s );
 
 /*!
 computes the vertex with the lexicographically smallest coordinates of the iso rectangle `ir`.
+\cgalEpicExact
 */
 template <typename Kernel>
 CGAL::Point_2<Kernel> min_vertex( const CGAL::Iso_rectangle_2<Kernel>& ir );
 
 /*!
 computes the vertex with the lexicographically smallest coordinates of the iso cuboid `ic`.
+\cgalEpicExact
 */
 template <typename Kernel>
 CGAL::Point_3<Kernel> min_vertex( const CGAL::Iso_cuboid_3<Kernel>& ic );

From 4ad2561b39332ed3a82f6b7e33e352705d96d372 Mon Sep 17 00:00:00 2001
From: Michael Hoffmann <hoffmann@inf.ethz.ch>
Date: Thu, 27 Apr 2023 16:52:25 +0200
Subject: [PATCH 0258/1398] remove trailing whitespace

---
 .../Exact_predicates_inexact_constructions_kernel.h  | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
index 3349ebca9777..aa14c521c2e9 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
@@ -6,12 +6,12 @@ namespace CGAL {
 
 A typedef to a kernel that has the following properties:
 
-<UL> 
-<LI>It uses %Cartesian representation. 
-<LI>It supports constructions of points from `double` %Cartesian 
-coordinates. 
-<LI>It provides exact geometric predicates, but geometric 
-constructions are not exact in general. 
+<UL>
+<LI>It uses %Cartesian representation.
+<LI>It supports constructions of points from `double` %Cartesian
+coordinates.
+<LI>It provides exact geometric predicates, but geometric
+constructions are not exact in general.
 </UL>
 
 <dl class="section"><dt>Trivial Constructions</dt></dl>

From 721aafd22ed39c7ad46d7ea20d90cc2bb6dfa10c Mon Sep 17 00:00:00 2001
From: Michael Hoffmann <hoffmann@inf.ethz.ch>
Date: Thu, 27 Apr 2023 17:49:50 +0200
Subject: [PATCH 0259/1398] remove trailing whitespace

---
 Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
index a61368add0ed..2b0fe496d5e6 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
@@ -50,7 +50,7 @@ class Weighted_point_2
   /*!
   introduces a weighted point from point `p` and weight `0`.
   \cgalEpicExact
-  
+
   \warning The `explicit` keyword is used to avoid accidental implicit conversions
            between Point_2 and Weighted_point_2.
   */
@@ -162,7 +162,7 @@ class Weighted_point_2
   /*!
   returns the i'th %Cartesian coordinate of `p`.
   \pre  `0 <= i <= 1`
-  
+
   \cgalEpicExact
   */
   Kernel::FT cartesian(int i) const;
@@ -170,7 +170,7 @@ class Weighted_point_2
   /*!
   returns `cartesian(i)`.
   \pre  `0 <= i <= 1`
-  
+
   \cgalEpicExact
   */
   Kernel::FT operator[](int i) const;

From a5cfd5ebad33a96b2ffc28b77f983ca90b0e63d3 Mon Sep 17 00:00:00 2001
From: Michael Hoffmann <hoffmann@inf.ethz.ch>
Date: Fri, 28 Apr 2023 09:09:55 +0200
Subject: [PATCH 0260/1398] add cgalepicexact macro for all doxygen versions

---
 Documentation/doc/resources/1.8.13/BaseDoxyfile.in | 3 ++-
 Documentation/doc/resources/1.8.14/BaseDoxyfile.in | 3 ++-
 Documentation/doc/resources/1.8.20/BaseDoxyfile.in | 3 ++-
 Documentation/doc/resources/1.8.4/BaseDoxyfile.in  | 1 +
 4 files changed, 7 insertions(+), 3 deletions(-)

diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index 69351ed254e8..1cc6aa39585e 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -359,7 +359,8 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalParamNEnd=</ul> \htmlonly[block] </div> \endhtmlonly </td><td></td></tr>" \
                          "cgalParamSectionBegin{1}=\cgalParamNBegin{\1}" \
                          "cgalParamSectionEnd=\cgalParamNEnd" \
-                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>"
+                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>" \
+                         "cgalEpicExact=<dl class=\"section note\"><dt>Exactness</dt><dd>This construction is trivial and therefore always exact in `Exact_predicates_inexact_constructions_kernel`.</dd></dl>"
 
 # This tag can be used to specify a number of word-keyword mappings (TCL only).
 # A mapping has the form "name=value". For example adding "class=itcl::class"
diff --git a/Documentation/doc/resources/1.8.14/BaseDoxyfile.in b/Documentation/doc/resources/1.8.14/BaseDoxyfile.in
index 1a59e5d2d97f..3a280dbad850 100644
--- a/Documentation/doc/resources/1.8.14/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.14/BaseDoxyfile.in
@@ -353,7 +353,8 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalParamNEnd=</ul> \htmlonly[block] </div> \endhtmlonly </td><td></td></tr>" \
                          "cgalParamSectionBegin{1}=\cgalParamNBegin{\1}" \
                          "cgalParamSectionEnd=\cgalParamNEnd" \
-                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>"
+                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>" \
+                         "cgalEpicExact=<dl class=\"section note\"><dt>Exactness</dt><dd>This construction is trivial and therefore always exact in `Exact_predicates_inexact_constructions_kernel`.</dd></dl>"
 
 # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
 # only. Doxygen will then generate output that is more tailored for C. For
diff --git a/Documentation/doc/resources/1.8.20/BaseDoxyfile.in b/Documentation/doc/resources/1.8.20/BaseDoxyfile.in
index f950a6836db9..1c3073af6f9a 100644
--- a/Documentation/doc/resources/1.8.20/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.20/BaseDoxyfile.in
@@ -375,7 +375,8 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalParamNEnd=</ul> \htmlonly[block] </div> \endhtmlonly </td><td></td></tr>" \
                          "cgalParamSectionBegin{1}=\cgalParamNBegin{\1}" \
                          "cgalParamSectionEnd=\cgalParamNEnd" \
-                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>"
+                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>" \
+                         "cgalEpicExact=<dl class=\"section note\"><dt>Exactness</dt><dd>This construction is trivial and therefore always exact in `Exact_predicates_inexact_constructions_kernel`.</dd></dl>"
 
 
 # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
diff --git a/Documentation/doc/resources/1.8.4/BaseDoxyfile.in b/Documentation/doc/resources/1.8.4/BaseDoxyfile.in
index 70267fd649dc..4532a3fc4a18 100644
--- a/Documentation/doc/resources/1.8.4/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.4/BaseDoxyfile.in
@@ -365,6 +365,7 @@ ALIASES+= "cgalParamNEnd=</ul> \htmlonly[block] </div> \endhtmlonly </td><td></t
 ALIASES+= "cgalParamSectionBegin{1}=\cgalParamNBegin{\1}"
 ALIASES+= "cgalParamSectionEnd=\cgalParamNEnd"
 ALIASES+= "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>"
+ALIASES+= "cgalEpicExact=<dl class=\"section note\"><dt>Exactness</dt><dd>This construction is trivial and therefore always exact in `Exact_predicates_inexact_constructions_kernel`.</dd></dl>"
 
 
 # This tag can be used to specify a number of word-keyword mappings (TCL only).

From a10460dd31365c64f5ddf581eb24ce9cfdf1430a Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 28 Apr 2023 14:05:01 +0200
Subject: [PATCH 0261/1398] Remove trailing whitespaces

---
 Polyhedron/demo/Polyhedron/MainWindow.h | 2 +-
 Three/include/CGAL/Three/exceptions.h   | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/MainWindow.h b/Polyhedron/demo/Polyhedron/MainWindow.h
index f0c3adca0078..d970c1813ef3 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.h
+++ b/Polyhedron/demo/Polyhedron/MainWindow.h
@@ -451,7 +451,7 @@ protected Q_SLOTS:
   //! Calls evaluate_script(script, filename, true).
   void evaluate_script_quiet(QString script,
                              const QString & fileName = QString());
-  #endif 
+  #endif
 
   QMutex mutex;
   QWaitCondition wait_condition;
diff --git a/Three/include/CGAL/Three/exceptions.h b/Three/include/CGAL/Three/exceptions.h
index 15fa13cd320d..417798cd469f 100644
--- a/Three/include/CGAL/Three/exceptions.h
+++ b/Three/include/CGAL/Three/exceptions.h
@@ -127,7 +127,7 @@ wrap_a_call_to_cpp(Callable f,
       return Return_type();
     }
 }
-#endif 
+#endif
 
 } // end namespace Three
 } // end namespace CGAL

From db652acef2a84f940c627b1681c58c6f2ae9f985 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 28 Apr 2023 15:31:35 +0200
Subject: [PATCH 0262/1398] add Qt6 to the CI tests

---
 .github/install.sh | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/.github/install.sh b/.github/install.sh
index 32b8552aa8f6..d19a714ae79a 100755
--- a/.github/install.sh
+++ b/.github/install.sh
@@ -2,7 +2,8 @@
 sudo apt-get update
 sudo apt-get install -y  libmpfr-dev \
  libeigen3-dev qtbase5-dev libqt5sql5-sqlite libqt5opengl5-dev qtscript5-dev \
- libqt5svg5-dev qttools5-dev qttools5-dev-tools libboost-dev libinsighttoolkit4-dev zsh
+ libqt5svg5-dev qttools5-dev qttools5-dev-tools libboost-dev libinsighttoolkit4-dev zsh \
+ qt6-base-dev qt6-declarative-dev
 #update cmake to 3.18.4
 sudo apt purge --auto-remove cmake
 cd /tmp

From 932ba31013d494b191261ed15455b491ad07d155 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 20:08:58 +0200
Subject: [PATCH 0263/1398] bump CGAL version to 6.0

---
 Installation/include/CGAL/version.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Installation/include/CGAL/version.h b/Installation/include/CGAL/version.h
index d90474f89134..482cd7db1a64 100644
--- a/Installation/include/CGAL/version.h
+++ b/Installation/include/CGAL/version.h
@@ -17,12 +17,12 @@
 #define CGAL_VERSION_H
 
 #ifndef SWIG
-#define CGAL_VERSION 5.6-beta1
+#define CGAL_VERSION 6.0-beta1
 #define CGAL_GIT_HASH abcdef
 #endif
-#define CGAL_VERSION_NR 1050600910
+#define CGAL_VERSION_NR 1060000910
 #define CGAL_SVN_REVISION 99999
-#define CGAL_RELEASE_DATE 20230430
+#define CGAL_RELEASE_DATE 20231001
 
 #include <CGAL/version_macros.h>
 

From fcd71fa9f3612a3e04a4413a7940e756d5109b2f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 20:16:28 +0200
Subject: [PATCH 0264/1398] CGAL now requires C++17

---
 Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake b/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
index 7329be331166..de0f5eb7fa4f 100644
--- a/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
+++ b/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
@@ -97,8 +97,8 @@ function(CGAL_setup_CGAL_dependencies target)
     target_compile_definitions(${target} INTERFACE CGAL_TEST_SUITE=1)
   endif()
 
-  # CGAL now requires C++14. `decltype(auto)` is used as a marker of C++14.
-  target_compile_features(${target} INTERFACE cxx_decltype_auto)
+  # CGAL now requires C++17
+  target_compile_features(${target} INTERFACE cxx_std_17)
 
   use_CGAL_Boost_support(${target} INTERFACE)
 

From 4fb4ca2b53dc64a9deab3b05d3e0aacfa075369d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 23:37:15 +0200
Subject: [PATCH 0265/1398] std::empty needs  c++17

remove this commit before merging in 6.0
---
 BGL/include/CGAL/boost/graph/helpers.h         | 2 +-
 Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/helpers.h b/BGL/include/CGAL/boost/graph/helpers.h
index fb585f04acc0..34597b221923 100644
--- a/BGL/include/CGAL/boost/graph/helpers.h
+++ b/BGL/include/CGAL/boost/graph/helpers.h
@@ -993,7 +993,7 @@ void clear(FaceGraph& g)
 template<typename FaceGraph>
 bool is_empty(const FaceGraph& g)
 {
-  return std::empty(vertices(g));
+  return boost::empty(vertices(g));
 }
 
 /// \ingroup PkgBGLHelperFct
diff --git a/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp
index fb464e110f7c..7b3051fdd3e7 100644
--- a/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp
@@ -306,7 +306,7 @@ void Scene_c3t3_item::compute_bbox() const
     _bbox = Bbox(result.xmin(), result.ymin(), result.zmin(),
                  result.xmax(), result.ymax(), result.zmax());
 
-    if (std::empty(c3t3().cells_in_complex()))
+    if (boost::empty(c3t3().cells_in_complex()))
     {
       for (Tr::Vertex_handle v : c3t3().triangulation().finite_vertex_handles())
       {

From af337edf4db8ced98bea5b59d72333a7d56aee45 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sat, 29 Apr 2023 08:35:13 +0200
Subject: [PATCH 0266/1398] boost::reference_wrapper --->
 std::reference_wrapper

---
 BGL/include/CGAL/boost/graph/visitor.h | 339 ++++++++++++-------------
 1 file changed, 168 insertions(+), 171 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/visitor.h b/BGL/include/CGAL/boost/graph/visitor.h
index 085c6ce01d9f..f7df1e748b21 100644
--- a/BGL/include/CGAL/boost/graph/visitor.h
+++ b/BGL/include/CGAL/boost/graph/visitor.h
@@ -14,13 +14,13 @@
 
 #include <boost/graph/graph_traits.hpp>
 #include <boost/tuple/tuple.hpp>
-#include <boost/ref.hpp>
+#include <utility>
 
 namespace boost
 {
   template<typename V, typename Graph>
   struct graph_traits<
-    boost::tuple<boost::reference_wrapper<V>, boost::reference_wrapper<Graph> > >
+    boost::tuple<std::reference_wrapper<V>, std::reference_wrapper<Graph> > >
     : boost::graph_traits< Graph >
   {
     typedef boost::graph_traits<Graph> Base;
@@ -29,20 +29,20 @@ namespace boost
 
   template<typename V, typename Graph>
   struct graph_traits<
-    boost::tuple<boost::reference_wrapper<V>, boost::reference_wrapper<Graph> > const >
+    boost::tuple<std::reference_wrapper<V>, std::reference_wrapper<Graph> > const >
     : boost::graph_traits< Graph >
   {};
 
   template<typename V, typename Graph, class PropertyTag>
   struct property_map<
-      boost::tuple<boost::reference_wrapper<V>, boost::reference_wrapper<Graph> >,
+      boost::tuple<std::reference_wrapper<V>, std::reference_wrapper<Graph> >,
       PropertyTag>
       : public property_map<Graph, PropertyTag>
   {};
 
   template<typename V, typename Graph, class PropertyTag>
   struct property_map<
-    const boost::tuple<boost::reference_wrapper<V>, boost::reference_wrapper<Graph> >,
+    const boost::tuple<std::reference_wrapper<V>, std::reference_wrapper<Graph> >,
     PropertyTag>
     : public property_map<Graph, PropertyTag>
   {};
@@ -52,11 +52,11 @@ namespace boost
 namespace CGAL
 {
 template<typename V, typename Graph>
-boost::tuple<boost::reference_wrapper<V>,
-             boost::reference_wrapper<Graph> >
+boost::tuple<std::reference_wrapper<V>,
+             std::reference_wrapper<Graph> >
 make_graph_with_visitor(V& v, Graph& g)
 {
-  return boost::make_tuple(boost::ref(v), boost::ref(g));
+  return boost::make_tuple(std::ref(v), std::ref(g));
 }
 
 template<typename Graph>
@@ -67,11 +67,8 @@ class Visitor_base
   typedef typename gt::halfedge_descriptor halfedge_descriptor;
   typedef typename gt::edge_descriptor edge_descriptor;
   typedef typename gt::vertex_descriptor vertex_descriptor;
-
-
 };
 
-
 //// OVERLOADS FOR Visitor
 
 template<typename Graph>
@@ -260,119 +257,119 @@ void get(PropertyTag ptag, const Visitor_base<Graph>& w)
 
 template <class Graph, class Visitor>
 typename boost::graph_traits<Graph>::vertices_size_type
-num_vertices(const boost::tuple<boost::reference_wrapper<Visitor>,
-                                boost::reference_wrapper<Graph> >& w)
+num_vertices(const boost::tuple<std::reference_wrapper<Visitor>,
+                                std::reference_wrapper<Graph> >& w)
 {
-  num_vertices(boost::unwrap_ref(w.get<0>()));
-  return num_vertices(boost::unwrap_ref(w.get<1>()));
+  num_vertices(get<0>(w).get());
+  return num_vertices(get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits<Graph>::edges_size_type
-num_edges(const boost::tuple<boost::reference_wrapper<Visitor>,
-                             boost::reference_wrapper<Graph> >& w)
+num_edges(const boost::tuple<std::reference_wrapper<Visitor>,
+                             std::reference_wrapper<Graph> >& w)
 {
-  num_edges(boost::unwrap_ref(w.get<0>()));
-  return num_edges(boost::unwrap_ref(w.get<1>()));
+  num_edges(get<0>(w).get());
+  return num_edges(get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits<Graph>::degree_size_type
 degree(typename boost::graph_traits<Graph>::vertex_descriptor v
-     , const boost::tuple<boost::reference_wrapper<Visitor>,
-                          boost::reference_wrapper<Graph> >& w)
+     , const boost::tuple<std::reference_wrapper<Visitor>,
+                          std::reference_wrapper<Graph> >& w)
 {
-  degree(v, boost::unwrap_ref(w.get<0>()));
-  return degree(v, boost::unwrap_ref(w.get<1>()));
+  degree(v, get<0>(w).get());
+  return degree(v, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits<Graph>::degree_size_type
 out_degree(typename boost::graph_traits<Graph>::vertex_descriptor v
-         , const boost::tuple<boost::reference_wrapper<Visitor>,
-                              boost::reference_wrapper<Graph> >& w)
+         , const boost::tuple<std::reference_wrapper<Visitor>,
+                              std::reference_wrapper<Graph> >& w)
 {
-  out_degree(v, boost::unwrap_ref(w.get<0>()));
-  return out_degree(v, boost::unwrap_ref(w.get<1>()));
+  out_degree(v, get<0>(w).get());
+  return out_degree(v, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits<Graph>::degree_size_type
 in_degree(typename boost::graph_traits<Graph>::vertex_descriptor v
-        , const boost::tuple<boost::reference_wrapper<Visitor>,
-                             boost::reference_wrapper<Graph> >& w)
+        , const boost::tuple<std::reference_wrapper<Visitor>,
+                             std::reference_wrapper<Graph> >& w)
 {
-  in_degree(v, boost::unwrap_ref(w.get<0>()));
-  return in_degree(v, boost::unwrap_ref(w.get<1>()));
+  in_degree(v, get<0>(w).get());
+  return in_degree(v, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits<Graph>::vertex_descriptor
 source(typename boost::graph_traits<Graph>::edge_descriptor e
-     , const boost::tuple<boost::reference_wrapper<Visitor>,
-                          boost::reference_wrapper<Graph> > & w)
+     , const boost::tuple<std::reference_wrapper<Visitor>,
+                          std::reference_wrapper<Graph> > & w)
 {
-  source(e, boost::unwrap_ref(w.get<0>()));
-  return source(e, boost::unwrap_ref(w.get<1>()));
+  source(e, get<0>(w).get());
+  return source(e, get<1>(w).get);
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits<Graph>::vertex_descriptor
 target(typename boost::graph_traits<Graph>::edge_descriptor e
-     , const boost::tuple<boost::reference_wrapper<Visitor>,
-                          boost::reference_wrapper<Graph> > & w)
+     , const boost::tuple<std::reference_wrapper<Visitor>,
+                          std::reference_wrapper<Graph> > & w)
 {
-  target(e, boost::unwrap_ref(w.get<0>()));
-  return target(e, boost::unwrap_ref(w.get<1>()));
+  target(e, get<0>(w).get());
+  return target(e, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 std::pair<typename boost::graph_traits<Graph>::edge_descriptor, bool>
 edge(typename boost::graph_traits<Graph>::vertex_descriptor u
    , typename boost::graph_traits<Graph>::vertex_descriptor v
-   , const boost::tuple<boost::reference_wrapper<Visitor>,
-                        boost::reference_wrapper<Graph> > & w)
+   , const boost::tuple<std::reference_wrapper<Visitor>,
+                        std::reference_wrapper<Graph> > & w)
 {
-  edge(u, v, boost::unwrap_ref(w.get<0>()));
-  return edge(u, v, boost::unwrap_ref(w.get<1>()));
+  edge(u, v, get<0>(w).get());
+  return edge(u, v, get<1>(w).get);
 }
 
 template <class Graph, class Visitor>
 inline CGAL::Iterator_range<typename boost::graph_traits<Graph>::vertex_iterator>
-vertices(const boost::tuple<boost::reference_wrapper<Visitor>,
-                            boost::reference_wrapper<Graph> >& w)
+vertices(const boost::tuple<std::reference_wrapper<Visitor>,
+                            std::reference_wrapper<Graph> >& w)
 {
-  vertices(boost::unwrap_ref(w.get<0>()));
-  return vertices(boost::unwrap_ref(w.get<1>()));
+  vertices(get<0>(w).get());
+  return vertices(get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 inline CGAL::Iterator_range<typename boost::graph_traits<Graph>::edge_iterator>
-edges(const boost::tuple<boost::reference_wrapper<Visitor>,
-                         boost::reference_wrapper<Graph> >& w)
+edges(const boost::tuple<std::reference_wrapper<Visitor>,
+                         std::reference_wrapper<Graph> >& w)
 {
-  edges(boost::unwrap_ref(w.get<0>()));
-  return edges(boost::unwrap_ref(w.get<1>()));
+  edges(get<0>(w).get());
+  return edges(get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 inline CGAL::Iterator_range<typename boost::graph_traits<Graph>::in_edge_iterator>
 in_edges(typename boost::graph_traits<Graph>::vertex_descriptor u
-       , const boost::tuple<boost::reference_wrapper<Visitor>,
-                            boost::reference_wrapper<Graph> >& w)
+       , const boost::tuple<std::reference_wrapper<Visitor>,
+                            std::reference_wrapper<Graph> >& w)
 {
-  in_edges(u, boost::unwrap_ref(w.get<0>()));
-  return in_edges(u, boost::unwrap_ref(w.get<1>()));
+  in_edges(u, get<0>(w).get());
+  return in_edges(u, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 inline CGAL::Iterator_range<typename boost::graph_traits<Graph>::out_edge_iterator>
 out_edges(typename boost::graph_traits<Graph>::vertex_descriptor u
-        , const boost::tuple<boost::reference_wrapper<Visitor>,
-                             boost::reference_wrapper<Graph> >& w)
+        , const boost::tuple<std::reference_wrapper<Visitor>,
+                             std::reference_wrapper<Graph> >& w)
 {
-  out_edges(u, boost::unwrap_ref(w.get<0>()));
-  return out_edges(u, boost::unwrap_ref(w.get<1>()));
+  out_edges(u, get<0>(w).get());
+  return out_edges(u, get<1>(w).get());
 }
 
 //
@@ -381,72 +378,72 @@ out_edges(typename boost::graph_traits<Graph>::vertex_descriptor u
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::vertex_descriptor
-add_vertex(boost::tuple<boost::reference_wrapper<Visitor>,
-                        boost::reference_wrapper<Graph> >& w)
+add_vertex(boost::tuple<std::reference_wrapper<Visitor>,
+                        std::reference_wrapper<Graph> >& w)
 {
-  add_vertex(boost::unwrap_ref(w.get<0>()));
-  return add_vertex(boost::unwrap_ref(w.get<1>()));
+  add_vertex(get<0>(w).get());
+  return add_vertex(get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::vertex_descriptor
 add_vertex(const typename boost::graph_traits<Graph >::vertex_property_type& p
-         , boost::tuple<boost::reference_wrapper<Visitor>,
-                        boost::reference_wrapper<Graph> >& w)
+         , boost::tuple<std::reference_wrapper<Visitor>,
+                        std::reference_wrapper<Graph> >& w)
 {
-  add_vertex(p, boost::unwrap_ref(w.get<0>()));
-  return add_vertex(p, boost::unwrap_ref(w.get<1>()));
+  add_vertex(p, get<0>(w).get());
+  return add_vertex(p, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 void
 remove_vertex(typename boost::graph_traits< Graph >::vertex_descriptor v
-            , boost::tuple<boost::reference_wrapper<Visitor>,
-                           boost::reference_wrapper<Graph> >& w)
+            , boost::tuple<std::reference_wrapper<Visitor>,
+                           std::reference_wrapper<Graph> >& w)
 {
-  remove_vertex(v, boost::unwrap_ref(w.get<0>()));
-  remove_vertex(v, boost::unwrap_ref(w.get<1>()));
+  remove_vertex(v, get<0>(w).get());
+  remove_vertex(v, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::edge_descriptor
-add_edge(boost::tuple<boost::reference_wrapper<Visitor>,
-                      boost::reference_wrapper<Graph> >& w)
+add_edge(boost::tuple<std::reference_wrapper<Visitor>,
+                      std::reference_wrapper<Graph> >& w)
 {
-  add_edge(boost::unwrap_ref(w.get<0>()));
-  return add_edge(boost::unwrap_ref(w.get<1>()));
+  add_edge(get<0>(w).get());
+  return add_edge(get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 void
 remove_edge(typename boost::graph_traits< Graph >::edge_descriptor e
-, boost::tuple<boost::reference_wrapper<Visitor>,
-               boost::reference_wrapper<Graph> >& w)
+, boost::tuple<std::reference_wrapper<Visitor>,
+               std::reference_wrapper<Graph> >& w)
 {
-  remove_edge(e, boost::unwrap_ref(w.get<0>()));
-  remove_edge(e, boost::unwrap_ref(w.get<1>()));
+  remove_edge(e, get<0>(w).get());
+  remove_edge(e, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 void
 set_target(typename boost::graph_traits< Graph >::halfedge_descriptor h1
 , typename boost::graph_traits< Graph >::vertex_descriptor v
-, boost::tuple<boost::reference_wrapper<Visitor>,
-               boost::reference_wrapper<Graph> >& w)
+, boost::tuple<std::reference_wrapper<Visitor>,
+               std::reference_wrapper<Graph> >& w)
 {
-  set_target(h1, v, boost::unwrap_ref(w.get<0>()));
-  set_target(h1, v, boost::unwrap_ref(w.get<1>()));
+  set_target(h1, v, get<0>(w).get());
+  set_target(h1, v, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 void
 set_next(typename boost::graph_traits< Graph >::halfedge_descriptor h1
        , typename boost::graph_traits< Graph >::halfedge_descriptor h2
-       , boost::tuple<boost::reference_wrapper<Visitor >,
-                      boost::reference_wrapper<Graph> >& w)
+       , boost::tuple<std::reference_wrapper<Visitor >,
+                      std::reference_wrapper<Graph> >& w)
 {
-  set_next(h1, h2, boost::unwrap_ref(w.get<0>()));
-  set_next(h1, h2, boost::unwrap_ref(w.get<1>()));
+  set_next(h1, h2, get<0>(w).get());
+  set_next(h1, h2, get<1>(w).get());
 }
 
 //
@@ -454,65 +451,65 @@ set_next(typename boost::graph_traits< Graph >::halfedge_descriptor h1
 //
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::face_descriptor
-add_face(boost::tuple<boost::reference_wrapper<Visitor>,
-  boost::reference_wrapper<Graph> >& w)
+add_face(boost::tuple<std::reference_wrapper<Visitor>,
+  std::reference_wrapper<Graph> >& w)
 {
-  add_face(boost::unwrap_ref(w.get<0>()));
-  return add_face(boost::unwrap_ref(w.get<1>()));
+  add_face(get<0>(w).get());
+  return add_face(get<1>(w).get());
 }
 
 template <class InputIterator, class Graph, class Visitor>
 typename boost::graph_traits< Graph >::face_descriptor
 add_face(InputIterator begin,
          InputIterator end,
-         boost::tuple<boost::reference_wrapper<Visitor>,
-         boost::reference_wrapper<Graph> >& w)
+         boost::tuple<std::reference_wrapper<Visitor>,
+         std::reference_wrapper<Graph> >& w)
 {
-  add_face(begin, end, boost::unwrap_ref(w.get<0>()));
-  return add_face(begin, end, boost::unwrap_ref(w.get<1>()));
+  add_face(begin, end, get<0>(w).get());
+  return add_face(begin, end, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 void
 remove_face(typename boost::graph_traits< Graph >::face_descriptor f
-, boost::tuple<boost::reference_wrapper<Visitor>,
-boost::reference_wrapper<Graph> >& w)
+, boost::tuple<std::reference_wrapper<Visitor>,
+std::reference_wrapper<Graph> >& w)
 {
-  remove_face(f, boost::unwrap_ref(w.get<0>()));
-  return remove_face(f, boost::unwrap_ref(w.get<1>()));
+  remove_face(f, get<0>(w).get());
+  return remove_face(f, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 void
 set_face(typename boost::graph_traits< Graph >::halfedge_descriptor h
 , typename boost::graph_traits< Graph >::face_descriptor f
-, const boost::tuple<boost::reference_wrapper<Visitor>,
-boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>,
+std::reference_wrapper<Graph> >& w)
 {
-  set_face(h, f, boost::unwrap_ref(w.get<0>()));
-  set_face(h, f, boost::unwrap_ref(w.get<1>()));
+  set_face(h, f, get<0>(w).get());
+  set_face(h, f, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 void
 set_halfedge(typename boost::graph_traits< Graph >::face_descriptor f
 , typename boost::graph_traits< Graph >::halfedge_descriptor h
-, boost::tuple<boost::reference_wrapper<Visitor>,
-boost::reference_wrapper<Graph> >& w)
+, boost::tuple<std::reference_wrapper<Visitor>,
+std::reference_wrapper<Graph> >& w)
 {
-  set_halfedge(f, h, boost::unwrap_ref(w.get<0>()));
-  set_halfedge(f, h, boost::unwrap_ref(w.get<1>()));
+  set_halfedge(f, h, get<0>(w).get());
+  set_halfedge(f, h, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 void
 set_halfedge(typename boost::graph_traits< Graph >::vertex_descriptor v
 , typename boost::graph_traits< Graph >::halfedge_descriptor h
-, const boost::tuple<boost::reference_wrapper<Visitor>,
-boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>,
+std::reference_wrapper<Graph> >& w)
 {
-  set_halfedge(v, h, boost::unwrap_ref(w.get<0>()));
-  set_halfedge(v, h, boost::unwrap_ref(w.get<1>()));
+  set_halfedge(v, h, get<0>(w).get());
+  set_halfedge(v, h, get<1>(w).get());
 }
 
 //
@@ -521,31 +518,31 @@ boost::reference_wrapper<Graph> >& w)
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::edge_descriptor
 edge(typename boost::graph_traits< Graph >::halfedge_descriptor h
-, const boost::tuple<boost::reference_wrapper<Visitor>,
-                     boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>,
+                     std::reference_wrapper<Graph> >& w)
 {
-  edge(h, boost::unwrap_ref(w.get<0>()));
-  return edge(h, boost::unwrap_ref(w.get<1>()));
+  edge(h, get<0>(w).get());
+  return edge(h, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::halfedge_descriptor
 halfedge(typename boost::graph_traits< Graph >::edge_descriptor e
-, const boost::tuple<boost::reference_wrapper<Visitor>,
-                     boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>,
+                     std::reference_wrapper<Graph> >& w)
 {
-  halfedge(e, boost::unwrap_ref(w.get<0>()));
-  return halfedge(e, boost::unwrap_ref(w.get<1>()));
+  halfedge(e, get<0>(w).get());
+  return halfedge(e, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::halfedge_descriptor
 halfedge(typename boost::graph_traits< Graph >::vertex_descriptor v
-, const boost::tuple<boost::reference_wrapper<Visitor>,
-                     boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>,
+                     std::reference_wrapper<Graph> >& w)
 {
-  halfedge(v, boost::unwrap_ref(w.get<0>()));
-  return halfedge(v, boost::unwrap_ref(w.get<1>()));
+  halfedge(v, get<0>(w).get());
+  return halfedge(v, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
@@ -553,58 +550,58 @@ std::pair< typename boost::graph_traits< Graph >::halfedge_descriptor
   , bool>
   halfedge(typename boost::graph_traits< Graph >::vertex_descriptor u
   , typename boost::graph_traits< Graph >::vertex_descriptor v
-  , const boost::tuple<boost::reference_wrapper<Visitor>,
-                       boost::reference_wrapper<Graph> >& w)
+  , const boost::tuple<std::reference_wrapper<Visitor>,
+                       std::reference_wrapper<Graph> >& w)
 {
-  halfedge(u, v, boost::unwrap_ref(w.get<0>()));
-  return halfedge(u, v, boost::unwrap_ref(w.get<1>()));
+  halfedge(u, v, get<0>(w).get());
+  return halfedge(u, v, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::halfedge_descriptor
 opposite(typename boost::graph_traits< Graph >::halfedge_descriptor h
-, const boost::tuple<boost::reference_wrapper<Visitor>,
-                      boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>,
+                      std::reference_wrapper<Graph> >& w)
 {
-  opposite(h, boost::unwrap_ref(w.get<0>()));
-  return opposite(h, boost::unwrap_ref(w.get<1>()));
+  opposite(h, get<0>(w).get());
+  return opposite(h, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::vertex_descriptor
 source(typename boost::graph_traits< Graph >::halfedge_descriptor h
-, const boost::tuple<boost::reference_wrapper<Visitor>,
-                     boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>,
+                     std::reference_wrapper<Graph> >& w)
 {
-  source(h, boost::unwrap_ref(w.get<0>()));
-  return source(h, boost::unwrap_ref(w.get<1>()));
+  source(h, get<0>(w).get());
+  return source(h, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::vertex_descriptor
 target(typename boost::graph_traits< Graph >::halfedge_descriptor h
-, const boost::tuple<boost::reference_wrapper<Visitor>, boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>, std::reference_wrapper<Graph> >& w)
 {
-  target(h, boost::unwrap_ref(w.get<0>()));
-  return target(h, boost::unwrap_ref(w.get<1>()));
+  target(h, get<0>(w).get());
+  return target(h, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::halfedge_descriptor
 next(typename boost::graph_traits< Graph >::halfedge_descriptor outedge
-, const boost::tuple<boost::reference_wrapper<Visitor>, boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>, std::reference_wrapper<Graph> >& w)
 {
-  next(outedge, boost::unwrap_ref(w.get<0>()));
-  return next(outedge, boost::unwrap_ref(w.get<1>()));
+  next(outedge, get<0>(w).get());
+  return next(outedge, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::halfedge_descriptor
 prev(typename boost::graph_traits< Graph >::halfedge_descriptor outedge
-, const boost::tuple<boost::reference_wrapper<Visitor>, boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>, std::reference_wrapper<Graph> >& w)
 {
-  prev(outedge, boost::unwrap_ref(w.get<0>()));
-  return prev(outedge, boost::unwrap_ref(w.get<1>()));
+  prev(outedge, get<0>(w).get());
+  return prev(outedge, get<1>(w).get());
 }
 
 //
@@ -612,73 +609,73 @@ prev(typename boost::graph_traits< Graph >::halfedge_descriptor outedge
 //
 template <class Graph, class Visitor>
 CGAL::Iterator_range<typename boost::graph_traits< Graph >::halfedge_iterator>
-halfedges(const boost::tuple<boost::reference_wrapper<Visitor>, boost::reference_wrapper<Graph> >& w)
+halfedges(const boost::tuple<std::reference_wrapper<Visitor>, std::reference_wrapper<Graph> >& w)
 {
-  halfedges(boost::unwrap_ref(w.get<0>()));
-  return halfedges(boost::unwrap_ref(w.get<1>()));
+  halfedges(get<0>(w).get());
+  return halfedges(get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::halfedges_size_type
-num_halfedges(const boost::tuple<boost::reference_wrapper<Visitor>, boost::reference_wrapper<Graph> >& w)
+num_halfedges(const boost::tuple<std::reference_wrapper<Visitor>, std::reference_wrapper<Graph> >& w)
 {
-  num_halfedges(boost::unwrap_ref(w.get<0>()));
-  return num_halfedges(boost::unwrap_ref(w.get<1>()));
+  num_halfedges(get<0>(w).get());
+  return num_halfedges(get<1>(w).get());
 }
 
 // Graph
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::face_descriptor
 face(typename boost::graph_traits< Graph >::halfedge_descriptor h
-, const boost::tuple<boost::reference_wrapper<Visitor>, boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>, std::reference_wrapper<Graph> >& w)
 {
-  face(h, boost::unwrap_ref(w.get<0>()));
-  return face(h, boost::unwrap_ref(w.get<1>()));
+  face(h, get<0>(w).get());
+  return face(h, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits< Graph >::halfedge_descriptor
 halfedge(typename boost::graph_traits< Graph >::face_descriptor f
-, const boost::tuple<boost::reference_wrapper<Visitor>, boost::reference_wrapper<Graph> >& w)
+, const boost::tuple<std::reference_wrapper<Visitor>, std::reference_wrapper<Graph> >& w)
 {
-  halfedge(f, boost::unwrap_ref(w.get<0>()));
-  return halfedge(f, boost::unwrap_ref(w.get<1>()));
+  halfedge(f, get<0>(w).get());
+  return halfedge(f, get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 inline CGAL::Iterator_range<typename boost::graph_traits<Graph>::face_iterator >
-faces(const boost::tuple<boost::reference_wrapper<Visitor>, boost::reference_wrapper<Graph> >& w)
+faces(const boost::tuple<std::reference_wrapper<Visitor>, std::reference_wrapper<Graph> >& w)
 {
-  faces(boost::unwrap_ref(w.get<0>()));
-  return faces(boost::unwrap_ref(w.get<1>()));
+  faces(get<0>(w).get());
+  return faces(get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
 typename boost::graph_traits<Graph>::faces_size_type
-num_faces(const boost::tuple<boost::reference_wrapper<Visitor>,
-                             boost::reference_wrapper<Graph> >& w)
+num_faces(const boost::tuple<std::reference_wrapper<Visitor>,
+                             std::reference_wrapper<Graph> >& w)
 {
-  num_faces(boost::unwrap_ref(w.get<0>()));
-  return num_faces(boost::unwrap_ref(w.get<1>()));
+  num_faces(get<0>(w).get());
+  return num_faces(get<1>(w).get());
 }
 
 template <class Graph, class Visitor>
-bool is_valid(const boost::tuple<boost::reference_wrapper<Visitor>,
-                                 boost::reference_wrapper<Graph> >& w
+bool is_valid(const boost::tuple<std::reference_wrapper<Visitor>,
+                                 std::reference_wrapper<Graph> >& w
               , bool verbose = false)
 {
-  is_valid(boost::unwrap_ref(w.get<0>()), verbose);
-  return is_valid(boost::unwrap_ref(w.get<1>()), verbose);
+  is_valid(get<0>(w).get(), verbose);
+  return is_valid(get<1>(w).get(), verbose);
 }
 
 template <class Graph, class PropertyTag, class Visitor>
 typename boost::property_map< Graph, PropertyTag >::type
 get(PropertyTag ptag,
-    const boost::tuple<boost::reference_wrapper<Visitor>,
-                       boost::reference_wrapper<Graph> >& w)
+    const boost::tuple<std::reference_wrapper<Visitor>,
+                       std::reference_wrapper<Graph> >& w)
 {
-  get(ptag, boost::unwrap_ref(w.get<0>()));
-  return get(ptag, boost::unwrap_ref(w.get<1>()));
+  get(ptag, get<0>(w).get());
+  return get(ptag, get<1>(w).get());
 }
 
 }//end namespace CGAL

From 769fca359769ebb207559e199f2c6ad23cf0d72e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sat, 29 Apr 2023 08:54:05 +0200
Subject: [PATCH 0267/1398] std::size is also c++17

remove this commit before merging to master
---
 .../Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h     | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
index 4322f62676f9..a3ba31c27262 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
@@ -26,6 +26,7 @@
 #include <CGAL/property_map.h>
 
 #include <boost/dynamic_bitset.hpp>
+#include <boost/range/size.hpp>
 #include <boost/range/value_type.hpp>
 #include <boost/range/reference.hpp>
 #include <boost/container/flat_set.hpp>
@@ -207,7 +208,7 @@ bool is_polygon_soup_a_polygon_mesh(const PolygonRange& polygons)
 
   for(const Polygon& polygon : polygons)
   {
-    std::size_t nb_edges = std::size(polygon);
+    std::size_t nb_edges = boost::size(polygon);
     if(nb_edges < 3)
       return false;
 

From c1294a0eaaae49fd85f0619966e2122300379463 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sat, 29 Apr 2023 09:22:12 +0200
Subject: [PATCH 0268/1398] boost::integral_constant --->
 std::integral_constant

---
 .../Algebraic_kernel_d/Curve_analysis_2.h     |  4 ++--
 .../include/CGAL/Arr_conic_traits_2.h         |  2 +-
 .../Arr_geodesic_arc_on_sphere_traits_2.h     | 18 +++++++--------
 .../Arrangement_on_surface_2_global.h         | 12 +++++-----
 .../Arrangement_2/arrangement_type_traits.h   |  8 +++----
 .../benchmark/DxfArrayBenchmarks/benchmark.h  |  2 +-
 .../benchmark/arrangement_traits/benchmark.h  |  2 +-
 Circular_kernel_2/benchmark/benchmark.h       |  2 +-
 Circular_kernel_2/benchmark/benchmark_CK2.cpp |  4 ++--
 .../incremental_insertion/benchmark.h         |  2 +-
 Convex_hull_3/include/CGAL/convex_hull_3.h    |  6 ++---
 .../quick_hull_default_traits.cpp             |  2 +-
 .../Envelope_diagram_on_surface_2.h           |  4 ++--
 Filtered_kernel/include/CGAL/Lazy_kernel.h    |  2 +-
 .../CGAL/NewKernel_d/Cartesian_LA_base.h      | 22 +++++++++----------
 .../include/CGAL/NewKernel_d/LA_eigen/LA.h    |  8 +++----
 .../include/CGAL/NewKernel_d/Vector/array.h   |  2 +-
 .../include/CGAL/NewKernel_d/Vector/avx4.h    | 12 +++++-----
 ...rator_to_points_from_iterator_to_vectors.h |  2 +-
 ...minant_of_iterator_to_points_from_points.h | 10 ++++-----
 ...nant_of_iterator_to_vectors_from_vectors.h | 10 ++++-----
 .../determinant_of_points_from_vectors.h      | 10 ++++-----
 ...eterminant_of_vectors_small_dim_internal.h | 10 ++++-----
 .../include/CGAL/NewKernel_d/Vector/sse2.h    | 10 ++++-----
 .../include/CGAL/NewKernel_d/Vector/v2int.h   |  8 +++----
 .../include/CGAL/NewKernel_d/Vector/vector.h  |  2 +-
 .../CGAL/NewKernel_d/functor_properties.h     |  2 +-
 .../include/CGAL/NewKernel_d/functor_tags.h   | 22 +++++++++----------
 NewKernel_d/include/CGAL/NewKernel_d/utils.h  |  2 +-
 .../Optimal_transportation_reconstruction_2.h |  4 ++--
 .../Polygon_mesh_processing/intersection.h    |  8 +++----
 STL_Extension/include/CGAL/is_convertible.h   |  4 ++--
 32 files changed, 109 insertions(+), 109 deletions(-)

diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
index 757a71e20750..70db25837e94 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
@@ -65,7 +65,7 @@ namespace internal {
 
 template<typename Comparable,bool has_template_typedefs>
   struct Is_derived_from_Handle_with_policy {
-    typedef boost::false_type Tag;
+    typedef std::false_type Tag;
 };
 
 template<typename Comparable>
@@ -89,7 +89,7 @@ template<typename Comparable,typename Tag> struct Compare_for_vert_line_map_
 };
 
 template<typename Comparable>
-  struct Compare_for_vert_line_map_<Comparable,boost::true_type> {
+  struct Compare_for_vert_line_map_<Comparable,std::true_type> {
 
     bool operator() (const Comparable& a, const Comparable& b) const {
       return CGAL::Handle_id_less_than< Comparable >()(a,b);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
index 8c3e7f6533e5..7d541c690119 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
@@ -71,7 +71,7 @@ class Arr_conic_traits_2
   typedef Tag_true                        Has_left_category;
   typedef Tag_true                        Has_merge_category;
   typedef Tag_false                       Has_do_intersect_category;
-  //typedef boost::true_type                Has_line_segment_constructor;
+  //typedef std::true_type                Has_line_segment_constructor;
 
   typedef Arr_oblivious_side_tag          Left_side_category;
   typedef Arr_oblivious_side_tag          Bottom_side_category;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
index 1468d38bc67e..476a20f466c8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
@@ -65,7 +65,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   typedef Arr_contracted_side_tag               Top_side_category;
   typedef Arr_identified_side_tag               Right_side_category;
 
-  typedef boost::integral_constant<bool, atan_y==0>       Zero_atan_y;
+  typedef std::integral_constant<bool, atan_y==0>       Zero_atan_y;
 
   // Traits objects
   typedef Arr_extended_direction_3<Kernel>                Point_2;
@@ -357,7 +357,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   void intersection_with_identification(const X_monotone_curve_2& xcv,
                                         Direction_3& dp,
-                                        boost::true_type) const
+                                        std::true_type) const
   {
     const Direction_3& normal = xcv.normal();
     dp = (CGAL::sign(normal.dz()) == POSITIVE) ?
@@ -370,7 +370,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   void intersection_with_identification(const X_monotone_curve_2& xcv,
                                         Direction_3& dp,
-                                        boost::false_type) const
+                                        std::false_type) const
   {
     const Direction_3& normal = xcv.normal();
     FT z((atan_x * normal.dx() + atan_y * normal.dy()) /
@@ -382,7 +382,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * \param[in] cv the curve
    */
   bool overlap_with_identification(const X_monotone_curve_2& xcv,
-                                   boost::true_type) const
+                                   std::true_type) const
   {
     const Direction_3& normal = xcv.normal();
     return ((x_sign(normal) == ZERO) &&
@@ -394,7 +394,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * \param[in] cv the curve
    */
   bool overlap_with_identification(const X_monotone_curve_2& xcv,
-                                   boost::false_type) const
+                                   std::false_type) const
   {
     const Direction_3& normal = xcv.normal();
     const Direction_3& iden_normal = identification_normal();
@@ -440,7 +440,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       Point_2 p;
       Direction_3& d(p);
       d = Direction_3(x, y, z);
-      init(p, boost::integral_constant<bool, atan_y==0>());
+      init(p, std::integral_constant<bool, atan_y==0>());
       return p;
     }
 
@@ -453,14 +453,14 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       Point_2 p;
       Direction_3& d(p);
       d = Direction_3(other);
-      init(p, boost::integral_constant<bool, atan_y==0>());
+      init(p, std::integral_constant<bool, atan_y==0>());
       return p;
     }
 
     /*! Initialize a point on the sphere,
      * \param[in] p the point to initialize.
      */
-    void init(Point_2& p, boost::true_type) const
+    void init(Point_2& p, std::true_type) const
     {
       const Direction_3& dir = p;
       if (y_sign(dir) != ZERO) {
@@ -479,7 +479,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
     /*! Initialize a point on the sphere,
      * \param[in] p the point to initialize.
      */
-    void init(Point_2& p, boost::false_type) const
+    void init(Point_2& p, std::false_type) const
     {
       const Direction_3& dir = p;
       if ((x_sign(dir) == ZERO) && (y_sign(dir) == ZERO)) {
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
index c39c34099a53..d54f4c2cb0e1 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
@@ -61,7 +61,7 @@ namespace Ss2 = Surface_sweep_2;
 // The last parameter is used to resolve ambiguity between this function and
 // do_intersect of X_monotone_curve_2 in case that X_monotone_curve_2 and
 // Curve_2 are the same class.
-// The last parameter should be boost::false_type but we used a
+// The last parameter should be std::false_type but we used a
 // workaround since it didn't compile in FC3_g++-3.4.4 with the error of:
 //
 // error: no matching function for call to `do_intersect(Arrangement_2<>&,
@@ -132,7 +132,7 @@ void insert(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 //
 // The last parameter is used to resolve ambiguity between this function and
 // do_intersect of Curve_2 in case that X_monotone_curve_2 and Curve_2 are the
-// same class. The last parameter should be boost::true_type but we used a
+// same class. The last parameter should be std::true_type but we used a
 // workaround since it didn't compile in FC3_g++-3.4.4 with the error of:
 //
 // error: no matching function for call to `do_intersect(Arrangement_2<>&,
@@ -406,7 +406,7 @@ void insert_non_empty(Arrangement_on_surface_2<GeometryTraits_2,
 // The last parameter is used to resolve ambiguity between this function and
 // do_intersect of X_monotone_curve_2 in case that X_monotone_curve_2 and
 // Curve_2 are the same class.
-// The last parameter should be boost::false_type but we used a
+// The last parameter should be std::false_type but we used a
 // workaround since it didn't compile in FC3_g++-3.4.4 with the error of:
 //
 // error: no matching function for call to `do_intersect(Arrangement_2<>&,
@@ -460,7 +460,7 @@ void insert(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 //
 // The last parameter is used to resolve ambiguity between this function and
 // insert of Curve_2 in case that X_monotone_curve_2 and Curve_2 are the
-// same class. The last parameter should be boost::true_type but we used a
+// same class. The last parameter should be std::true_type but we used a
 // workaround since it didn't compile in FC3_g++-3.4.4 with the error of:
 //
 // error: no matching function for call to `do_intersect(Arrangement_2<>&,
@@ -1522,7 +1522,7 @@ zone(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 // Checks whether the given x-monotone curve intersects the existing arrangement.
 // The last parameter is used to resolve ambiguity between this function and
 // do_intersect of Curve_2 in case that X_monotone_curve_2 and Curve_2 are the
-// same class. The last parameter should be boost::true_type but we used a
+// same class. The last parameter should be std::true_type but we used a
 // workaround since it didn't compile in FC3_g++-3.4.4 with the error of:
 //
 // error: no matching function for call to `do_intersect(Arrangement_on_surface_2<>&,
@@ -1559,7 +1559,7 @@ do_intersect(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 // The last parameter is used to resolve ambiguity between this function and
 // do_intersect of X_monotone_curve_2 in case that X_monotone_curve_2 and
 // Curve_2 are the same class.
-// The last parameter should be boost::false_type but we used a
+// The last parameter should be std::false_type but we used a
 // workaround since it didn't compile in FC3_g++-3.4.4 with the error of:
 //
 // error: no matching function for call to
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/arrangement_type_traits.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/arrangement_type_traits.h
index a97588ecde2f..93788c728d02 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/arrangement_type_traits.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/arrangement_type_traits.h
@@ -24,7 +24,7 @@
 #include <CGAL/license/Arrangement_on_surface_2.h>
 
 
-#include <boost/type_traits/integral_constant.hpp>
+#include <type_traits>
 
 namespace CGAL
 {
@@ -62,7 +62,7 @@ namespace CGAL
 
 // In the meanwhile we use a default implementation.
 template <class T>
-class is_arrangement_2 : public boost::false_type
+class is_arrangement_2 : public std::false_type
 {};
 
 //--------------------------------  Arrangement_2
@@ -74,7 +74,7 @@ class Arrangement_2;
 template <class GeomTraits_, class DCEL_>
 class is_arrangement_2<
   Arrangement_2<GeomTraits_, DCEL_>
-> : public boost::false_type
+> : public std::false_type
 {};
 
 
@@ -87,7 +87,7 @@ class Arrangement_on_surface_2;
 template <class GeomTraits_, class TopTraits_>
 class is_arrangement_2<
   Arrangement_on_surface_2<GeomTraits_, TopTraits_>
-> : public boost::true_type
+> : public std::true_type
 {};
 
 } // namespace CGAL
diff --git a/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmark.h b/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmark.h
index 1e7db3856c0e..6c37f7e69072 100644
--- a/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmark.h
+++ b/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmark.h
@@ -267,7 +267,7 @@ class Bench
 
         try{
                     this->start();
-                      insert(_pm,ac.begin(),ac.end(),boost::false_type());
+                      insert(_pm,ac.begin(),ac.end(),std::false_type());
                     this->stop();
           }
           catch (...) {
diff --git a/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h b/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h
index 36210feffcb8..179ea2b2f82b 100644
--- a/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h
+++ b/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h
@@ -214,7 +214,7 @@ class Bench
   try{
     this->start();
 
-      insert(_pm,ac.begin(),ac.end(),boost::false_type());
+      insert(_pm,ac.begin(),ac.end(),std::false_type());
 
     this->stop();
   }
diff --git a/Circular_kernel_2/benchmark/benchmark.h b/Circular_kernel_2/benchmark/benchmark.h
index 9d13d728f659..92ba72909ca6 100644
--- a/Circular_kernel_2/benchmark/benchmark.h
+++ b/Circular_kernel_2/benchmark/benchmark.h
@@ -219,7 +219,7 @@ typedef std::size_t size_type;
           Point_location _pl(_pm);
         try{
                     this->start();
-                      insert(_pm,ac.begin(),ac.end(),boost::false_type());
+                      insert(_pm,ac.begin(),ac.end(),std::false_type());
                     this->stop();
           } catch (std::exception &e) {
                     this->fail();
diff --git a/Circular_kernel_2/benchmark/benchmark_CK2.cpp b/Circular_kernel_2/benchmark/benchmark_CK2.cpp
index 54a4137e4ce8..fca082283401 100644
--- a/Circular_kernel_2/benchmark/benchmark_CK2.cpp
+++ b/Circular_kernel_2/benchmark/benchmark_CK2.cpp
@@ -87,7 +87,7 @@ void do_main(const char *s) {
   struct rusage before, after;
   struct timeval utime, stime;
   getrusage(RUSAGE_SELF,&before);
-  insert(_pm,ac.begin(),ac.end(),boost::false_type());
+  insert(_pm,ac.begin(),ac.end(),std::false_type());
   getrusage(RUSAGE_SELF,&after);
   timersub(&(after.ru_utime),&(before.ru_utime),&utime);
   timersub(&(after.ru_stime),&(before.ru_stime),&stime);
@@ -177,7 +177,7 @@ void do_main(int k) {
   struct rusage before, after;
   struct timeval utime, stime;
   getrusage(RUSAGE_SELF,&before);
-  insert(_pm,ac.begin(),ac.end(),boost::false_type());
+  insert(_pm,ac.begin(),ac.end(),std::false_type());
   getrusage(RUSAGE_SELF,&after);
   timersub(&(after.ru_utime),&(before.ru_utime),&utime);
   timersub(&(after.ru_stime),&(before.ru_stime),&stime);
diff --git a/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h b/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h
index 3787adde5222..1a251c11978a 100644
--- a/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h
+++ b/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h
@@ -217,7 +217,7 @@ class Bench
     this->start();
     for (typename ArcContainer::const_iterator it=ac.begin();
          it != ac.end(); ++it) {
-      insert(_pm,*it,_pl,boost::false_type());
+      insert(_pm,*it,_pl,std::false_type());
     };
     this->stop();
   }
diff --git a/Convex_hull_3/include/CGAL/convex_hull_3.h b/Convex_hull_3/include/CGAL/convex_hull_3.h
index 70c2f5ea0972..51555a5d57b0 100644
--- a/Convex_hull_3/include/CGAL/convex_hull_3.h
+++ b/Convex_hull_3/include/CGAL/convex_hull_3.h
@@ -155,7 +155,7 @@ struct Default_traits_for_Chull_3{
 
 //FT is a floating point type and Kernel is a filtered kernel
 template <class Point_3, class PolygonMesh>
-struct Default_traits_for_Chull_3<Point_3, PolygonMesh, boost::true_type,Tag_true>{
+struct Default_traits_for_Chull_3<Point_3, PolygonMesh, std::true_type,Tag_true>{
   typedef Convex_hull_traits_3< typename Kernel_traits<Point_3>::Kernel, PolygonMesh, Tag_true > type;
 };
 
@@ -172,7 +172,7 @@ struct Default_polyhedron_for_Chull_3<Convex_hull_traits_3<K, P, Tag> >{
 template <class T>
 struct Is_cartesian_kernel
 {
-  typedef boost::false_type type;
+  typedef std::false_type type;
 };
 
 template <class Kernel, class PolygonMesh>
@@ -233,7 +233,7 @@ class Is_on_positive_side_of_plane_3< Extreme_points_traits_adapter_3<VPM,Base_t
 //interval arithmetic (the protector must be created before using this predicate)
 //and in case of failure, exact arithmetic is used.
 template <class Kernel, class P>
-class Is_on_positive_side_of_plane_3<Convex_hull_traits_3<Kernel, P, Tag_true>, boost::true_type >{
+class Is_on_positive_side_of_plane_3<Convex_hull_traits_3<Kernel, P, Tag_true>, std::true_type >{
   typedef Simple_cartesian<CGAL::internal::Exact_field_selector<double>::Type>  Exact_K;
   typedef Simple_cartesian<Interval_nt_advanced >                               Approx_K;
   typedef Convex_hull_traits_3<Kernel, P, Tag_true>                             Traits;
diff --git a/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp b/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp
index d1bca0f468f5..90bf87cfa8cd 100644
--- a/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp
+++ b/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp
@@ -29,6 +29,6 @@ int main()
   CGAL_static_assertion( (std::is_same<SCR,Default_traits_for_Chull_3<SCR::Point_3>::type>::value) );
   CGAL_static_assertion( (std::is_same<EPEC,Default_traits_for_Chull_3<EPEC::Point_3>::type>::value) );
   CGAL_static_assertion( (std::is_same<CGAL::Convex_hull_traits_3<EPIC, CGAL::Default, CGAL::Tag_true>,Default_traits_for_Chull_3<EPIC::Point_3>::type>::value) );
-  CGAL_static_assertion( (std::is_same<Is_on_positive_side_of_plane_3<CGAL::Convex_hull_traits_3<EPIC, CGAL::Default, CGAL::Tag_true>, boost::true_type >::Protector,CGAL::Protect_FPU_rounding<true> >::value) );
+  CGAL_static_assertion( (std::is_same<Is_on_positive_side_of_plane_3<CGAL::Convex_hull_traits_3<EPIC, CGAL::Default, CGAL::Tag_true>, std::true_type >::Protector,CGAL::Protect_FPU_rounding<true> >::value) );
   return 0;
 }
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_diagram_on_surface_2.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_diagram_on_surface_2.h
index c8aa90f709b7..b9f922ef6995 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_diagram_on_surface_2.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_diagram_on_surface_2.h
@@ -129,14 +129,14 @@ class Envelope_diagram_2 :
 template <class GeomTraits_, class TopTraits_>
 class is_arrangement_2<
   Envelope_diagram_on_surface_2<GeomTraits_, TopTraits_>
-> : public boost::true_type
+> : public std::true_type
 {};
 
 // specialization
 template <class GeomTraits_, class DCEL_>
 class is_arrangement_2<
   Envelope_diagram_2<GeomTraits_, DCEL_>
-> : public boost::true_type
+> : public std::true_type
 {};
 
 
diff --git a/Filtered_kernel/include/CGAL/Lazy_kernel.h b/Filtered_kernel/include/CGAL/Lazy_kernel.h
index a510d4c43739..3ceb706c3b98 100644
--- a/Filtered_kernel/include/CGAL/Lazy_kernel.h
+++ b/Filtered_kernel/include/CGAL/Lazy_kernel.h
@@ -61,7 +61,7 @@ class Has_result_type_helper
 
 template<typename T>
 struct Has_result_type
-  : boost::integral_constant< bool,
+  : std::integral_constant< bool,
                               Has_result_type_helper< std::remove_cv_t<T>>::value>
 {};
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_LA_base.h b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_LA_base.h
index b5de315b902e..9aecb942bb17 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_LA_base.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_LA_base.h
@@ -13,7 +13,7 @@
 #define CGAL_KERNEL_D_CARTESIAN_LA_BASE_H
 #include <CGAL/basic.h>
 #include <CGAL/Origin.h>
-#include <boost/type_traits/integral_constant.hpp>
+#include <type_traits>
 #include <CGAL/representation_tags.h>
 #include <CGAL/NewKernel_d/functor_tags.h>
 #include <CGAL/Uncertain.h>
@@ -89,7 +89,7 @@ struct Cartesian_LA_base_d : public Dimension_base<Dim_>
       ::add<Vector_cartesian_const_iterator_tag>::type
       Iterator_list;
 
-    template<class, class=void, class=boost::integral_constant<int,0> > struct Functor {
+    template<class, class=void, class=std::integral_constant<int,0> > struct Functor {
             typedef Null_functor type;
     };
     template<class D> struct Functor<Construct_ttag<Vector_tag>,D> {
@@ -105,19 +105,19 @@ struct Cartesian_LA_base_d : public Dimension_base<Dim_>
             typedef CartesianDVectorBase::Construct_cartesian_const_iterator<Self> type;
     };
     template<class D> struct Functor<Sum_of_vectors_tag,D,
-      boost::integral_constant<int,!LA_vector::template Property<Has_vector_plus_minus_tag>::value> > {
+      std::integral_constant<int,!LA_vector::template Property<Has_vector_plus_minus_tag>::value> > {
             typedef CartesianDVectorBase::Sum_of_vectors<Self> type;
     };
     template<class D> struct Functor<Difference_of_vectors_tag,D,
-      boost::integral_constant<int,!LA_vector::template Property<Has_vector_plus_minus_tag>::value> > {
+      std::integral_constant<int,!LA_vector::template Property<Has_vector_plus_minus_tag>::value> > {
             typedef CartesianDVectorBase::Difference_of_vectors<Self> type;
     };
     template<class D> struct Functor<Opposite_vector_tag,D,
-      boost::integral_constant<int,!LA_vector::template Property<Has_vector_plus_minus_tag>::value> > {
+      std::integral_constant<int,!LA_vector::template Property<Has_vector_plus_minus_tag>::value> > {
             typedef CartesianDVectorBase::Opposite_vector<Self> type;
     };
     template<class D> struct Functor<Midpoint_tag,D,
-      boost::integral_constant<int,
+      std::integral_constant<int,
            !LA_vector::template Property<Has_vector_plus_minus_tag>::value
         || !LA_vector::template Property<Has_vector_scalar_ops_tag>::value> > {
             typedef CartesianDVectorBase::Midpoint<Self> type;
@@ -135,24 +135,24 @@ struct Cartesian_LA_base_d : public Dimension_base<Dim_>
             typedef CartesianDVectorBase::PV_dimension<Self> type;
     };
     template<class D> struct Functor<Orientation_of_vectors_tag,D,
-      boost::integral_constant<int,!LA_vector::template Property<Has_determinant_of_iterator_to_vectors_tag>::value> > {
+      std::integral_constant<int,!LA_vector::template Property<Has_determinant_of_iterator_to_vectors_tag>::value> > {
             typedef CartesianDVectorBase::Orientation_of_vectors<Self> type;
     };
     template<class D> struct Functor<Orientation_of_points_tag,D,
-      boost::integral_constant<int,!LA_vector::template Property<Has_determinant_of_iterator_to_points_tag>::value> > {
+      std::integral_constant<int,!LA_vector::template Property<Has_determinant_of_iterator_to_points_tag>::value> > {
             typedef CartesianDVectorBase::Orientation_of_points<Self> type;
     };
     template<class D> struct Functor<Scalar_product_tag,D,
-      boost::integral_constant<int,!LA_vector::template Property<Has_dot_product_tag>::value> > {
+      std::integral_constant<int,!LA_vector::template Property<Has_dot_product_tag>::value> > {
             typedef CartesianDVectorBase::Scalar_product<Self> type;
     };
     template<class D> struct Functor<Squared_distance_to_origin_tag,D,
-      boost::integral_constant<int,!LA_vector::template Property<Stores_squared_norm_tag>::value> > {
+      std::integral_constant<int,!LA_vector::template Property<Stores_squared_norm_tag>::value> > {
             typedef CartesianDVectorBase::Squared_distance_to_origin_stored<Self> type;
     };
     // Use integral_constant<int,2> in case of failure, to distinguish from the previous one.
     template<class D> struct Functor<Squared_distance_to_origin_tag,D,
-      boost::integral_constant<int,
+      std::integral_constant<int,
         (LA_vector::template Property<Stores_squared_norm_tag>::value
          || !LA_vector::template Property<Has_dot_product_tag>::value)*2> > {
             typedef CartesianDVectorBase::Squared_distance_to_origin_via_dotprod<Self> type;
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/LA_eigen/LA.h b/NewKernel_d/include/CGAL/NewKernel_d/LA_eigen/LA.h
index c96e0eea6479..7124d799251d 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/LA_eigen/LA.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/LA_eigen/LA.h
@@ -38,10 +38,10 @@ template<class NT_,class Dim_,class Max_dim_=Dim_> struct LA_eigen {
         struct Rebind_dimension {
           typedef LA_eigen< NT, D2, D3 > Other;
         };
-        template<class,class=void> struct Property : boost::false_type {};
-        template<class D> struct Property<Has_vector_plus_minus_tag,D> : boost::true_type {};
-        template<class D> struct Property<Has_vector_scalar_ops_tag,D> : boost::true_type {};
-        template<class D> struct Property<Has_dot_product_tag,D> : boost::true_type {};
+        template<class,class=void> struct Property : std::false_type {};
+        template<class D> struct Property<Has_vector_plus_minus_tag,D> : std::true_type {};
+        template<class D> struct Property<Has_vector_scalar_ops_tag,D> : std::true_type {};
+        template<class D> struct Property<Has_dot_product_tag,D> : std::true_type {};
 
         typedef Eigen::Matrix<NT,Eigen_dimension<Dim_>::value,1,Eigen::ColMajor|Eigen::AutoAlign,Eigen_dimension<Max_dim_>::value,1> Vector;
         typedef Eigen::Matrix<NT,Eigen::Dynamic,1> Dynamic_vector;
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h
index 88a4ed421a99..0ac98f7261ba 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h
@@ -38,7 +38,7 @@ template<class NT_,class Dim_,class Max_dim_=Dim_> struct Array_vector {
         struct Rebind_dimension {
           typedef Array_vector< NT, D2, D3 > Other;
         };
-        template<class> struct Property : boost::false_type {};
+        template<class> struct Property : std::false_type {};
 
         static const unsigned d_=Max_dim_::value;
         CGAL_static_assertion(d_ != (unsigned)UNKNOWN_DIMENSION);
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/avx4.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/avx4.h
index 950910925a32..90a35986e500 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/avx4.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/avx4.h
@@ -31,19 +31,19 @@ namespace CGAL {
     typedef Dimension_tag<4> Dimension;
     typedef Dimension_tag<4> Max_dimension;
     // No Rebind_dimension, this is a building block
-    template<class,bool=true> struct Property : boost::false_type {};
+    template<class,bool=true> struct Property : std::false_type {};
     template<bool b> struct Property<Has_vector_plus_minus_tag,b>
-      : boost::true_type {};
+      : std::true_type {};
     /* MAYBE?
        template<bool b> struct Property<Has_vector_scalar_ops_tag,b>
-       : boost::true_type {};
+       : std::true_type {};
        */
     template<bool b> struct Property<Has_determinant_of_vectors_tag,b>
-      : boost::true_type {};
+      : std::true_type {};
     template<bool b> struct Property<Has_dot_product_tag,b>
-      : boost::true_type {};
+      : std::true_type {};
     template<bool b> struct Property<Has_determinant_of_vectors_omit_last_tag,b>
-      : boost::true_type {};
+      : std::true_type {};
 
     typedef __m256d Vector;
     struct Construct_vector {
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_points_from_iterator_to_vectors.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_points_from_iterator_to_vectors.h
index 2a222f81d728..293fdfdc1d34 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_points_from_iterator_to_vectors.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_points_from_iterator_to_vectors.h
@@ -42,7 +42,7 @@ struct Add_determinant_of_iterator_to_points_from_iterator_to_vectors
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_iterator_to_points_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   // TODO: use std::minus, boost::bind, etc
   template<class T> struct Minus_fixed {
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_points_from_points.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_points_from_points.h
index 5e135e530be0..110305fe61e6 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_points_from_points.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_points_from_points.h
@@ -42,7 +42,7 @@ struct Add_determinant_of_iterator_to_points_from_points
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_iterator_to_points_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   template<class Iter>
   static NT determinant_of_iterator_to_points(Iter const&first, Iter const&end){
@@ -74,7 +74,7 @@ struct Add_determinant_of_iterator_to_points_from_points
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_iterator_to_points_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   template<class Iter>
   static NT determinant_of_iterator_to_points(Iter const&first, Iter const&end){
@@ -108,7 +108,7 @@ struct Add_determinant_of_iterator_to_points_from_points
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_iterator_to_points_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   template<class Iter>
   static NT determinant_of_iterator_to_points(Iter const&first, Iter const&end){
@@ -144,7 +144,7 @@ struct Add_determinant_of_iterator_to_points_from_points
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_iterator_to_points_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   template<class Iter>
   static NT determinant_of_iterator_to_points(Iter const&first, Iter const&end){
@@ -182,7 +182,7 @@ struct Add_determinant_of_iterator_to_points_from_points
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_iterator_to_points_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   template<class Iter>
   static NT determinant_of_iterator_to_points(Iter const&first, Iter const&end){
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_vectors_from_vectors.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_vectors_from_vectors.h
index e6db622451c3..bf7ab454eac4 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_vectors_from_vectors.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_iterator_to_vectors_from_vectors.h
@@ -42,7 +42,7 @@ struct Add_determinant_of_iterator_to_vectors_from_vectors
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_iterator_to_vectors_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   template<class Iter>
   static NT determinant_of_iterator_to_vectors(Iter const&first, Iter const&end){
@@ -72,7 +72,7 @@ struct Add_determinant_of_iterator_to_vectors_from_vectors
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_iterator_to_vectors_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   template<class Iter>
   static NT determinant_of_iterator_to_vectors(Iter const&first, Iter const&end){
@@ -104,7 +104,7 @@ struct Add_determinant_of_iterator_to_vectors_from_vectors
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_iterator_to_vectors_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   template<class Iter>
   static NT determinant_of_iterator_to_vectors(Iter const&first, Iter const&end){
@@ -138,7 +138,7 @@ struct Add_determinant_of_iterator_to_vectors_from_vectors
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_iterator_to_vectors_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   template<class Iter>
   static NT determinant_of_iterator_to_vectors(Iter const&first, Iter const&end){
@@ -174,7 +174,7 @@ struct Add_determinant_of_iterator_to_vectors_from_vectors
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_iterator_to_vectors_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   template<class Iter>
   static NT determinant_of_iterator_to_vectors(Iter const&first, Iter const&end){
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_points_from_vectors.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_points_from_vectors.h
index 653ac9c8dd61..66edfeba37d6 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_points_from_vectors.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_points_from_vectors.h
@@ -42,7 +42,7 @@ struct Add_determinant_of_points_from_vectors_and_minus
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_points_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   static NT determinant_of_points(Vector const&a, Vector const&b,
       Vector const&c){
@@ -66,7 +66,7 @@ struct Add_determinant_of_points_from_vectors_and_minus
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_points_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   static NT determinant_of_points(Vector const&a, Vector const&b,
       Vector const&c, Vector const&d){
@@ -90,7 +90,7 @@ struct Add_determinant_of_points_from_vectors_and_minus
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_points_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   static NT determinant_of_points(Vector const&a, Vector const&b,
       Vector const&c, Vector const&d, Vector const&e){
@@ -114,7 +114,7 @@ struct Add_determinant_of_points_from_vectors_and_minus
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_points_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   static NT determinant_of_points(Vector const&a, Vector const&b,
       Vector const&c, Vector const&d, Vector const&e, Vector const&f){
@@ -138,7 +138,7 @@ struct Add_determinant_of_points_from_vectors_and_minus
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<Has_determinant_of_points_tag, D> :
-    boost::true_type {};
+    std::true_type {};
 
   static NT determinant_of_points(Vector const&a, Vector const&b,
       Vector const&c, Vector const&d, Vector const&e, Vector const&f,
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_vectors_small_dim_internal.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_vectors_small_dim_internal.h
index f423bf8b0935..59a3752f61cc 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_vectors_small_dim_internal.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/determinant_of_vectors_small_dim_internal.h
@@ -46,7 +46,7 @@ struct CGAL_CLASS
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<CGAL_TAG, D> :
-    boost::true_type {};
+    std::true_type {};
 
   static NT CGAL_FUNC(Vector const&a, Vector const&b){
     return CGAL::determinant_of_vectors<NT>(a,b);
@@ -69,7 +69,7 @@ struct CGAL_CLASS
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<CGAL_TAG, D> :
-    boost::true_type {};
+    std::true_type {};
 
   static NT CGAL_FUNC(Vector const&a, Vector const&b,
       Vector const&c){
@@ -93,7 +93,7 @@ struct CGAL_CLASS
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<CGAL_TAG, D> :
-    boost::true_type {};
+    std::true_type {};
 
   static NT CGAL_FUNC(Vector const&a, Vector const&b,
       Vector const&c, Vector const&d){
@@ -117,7 +117,7 @@ struct CGAL_CLASS
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<CGAL_TAG, D> :
-    boost::true_type {};
+    std::true_type {};
 
   static NT CGAL_FUNC(Vector const&a, Vector const&b,
       Vector const&c, Vector const&d, Vector const&e){
@@ -141,7 +141,7 @@ struct CGAL_CLASS
     };
   template<class P,class=void> struct Property : LA::template Property<P> {};
   template<class D> struct Property<CGAL_TAG, D> :
-    boost::true_type {};
+    std::true_type {};
 
   static NT CGAL_FUNC(Vector const&a, Vector const&b,
       Vector const&c, Vector const&d, Vector const&e, Vector const&f){
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/sse2.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/sse2.h
index 1330bf6fa775..24607f39e697 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/sse2.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/sse2.h
@@ -32,17 +32,17 @@ namespace CGAL {
     typedef Dimension_tag<2> Dimension;
     typedef Dimension_tag<2> Max_dimension;
     // No Rebind_dimension, this is a building block
-    template<class,bool=true> struct Property : boost::false_type {};
+    template<class,bool=true> struct Property : std::false_type {};
     template<bool b> struct Property<Has_vector_plus_minus_tag,b>
-      : boost::true_type {};
+      : std::true_type {};
     /* MAYBE?
        template<bool b> struct Property<Has_vector_scalar_ops_tag,b>
-       : boost::true_type {};
+       : std::true_type {};
        */
     template<bool b> struct Property<Has_determinant_of_vectors_tag,b>
-      : boost::true_type {};
+      : std::true_type {};
     template<bool b> struct Property<Has_dot_product_tag,b>
-      : boost::true_type {};
+      : std::true_type {};
 
     typedef __m128d Vector;
     struct Construct_vector {
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/v2int.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/v2int.h
index d864c67bbc50..d02965cd4e74 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/v2int.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/v2int.h
@@ -70,13 +70,13 @@ namespace CGAL {
     typedef Dimension_tag<2> Dimension;
     typedef Dimension_tag<2> Max_dimension;
     // No Rebind_dimension, this is a building block
-    template<class,bool=true> struct Property : boost::false_type {};
+    template<class,bool=true> struct Property : std::false_type {};
     //template<bool b> struct Property<Has_vector_plus_minus_tag,b>
-    //  : boost::true_type {};
+    //  : std::true_type {};
     template<bool b> struct Property<Has_determinant_of_vectors_tag,b>
-      : boost::true_type {};
+      : std::true_type {};
     //template<bool b> struct Property<Has_determinant_of_points_tag,b>
-    //  : boost::true_type {};
+    //  : std::true_type {};
     // Advertise somehow that the sign_of_determinant* are exact?
 
     typedef std::array<NT1,2> Vector;
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/vector.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/vector.h
index 9dfda2c38b10..89ccbace2011 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/vector.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/vector.h
@@ -29,7 +29,7 @@ template<class NT_,class Dim_,class Max_dim_=Dim_> struct Vector_vector {
         struct Rebind_dimension {
           typedef Vector_vector< NT, D2, D3 > Other;
         };
-        template<class> struct Property : boost::false_type {};
+        template<class> struct Property : std::false_type {};
 
         struct Construct_vector {
                 struct Dimension {
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/functor_properties.h b/NewKernel_d/include/CGAL/NewKernel_d/functor_properties.h
index f8608d9fd4dc..a1e788113af5 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/functor_properties.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/functor_properties.h
@@ -20,7 +20,7 @@ namespace CGAL {
     BOOST_MPL_HAS_XXX_TRAIT_DEF(Is_pretty) \
   } \
   template<class T,bool=internal::has_##Is_pretty<T>::value> \
-  struct Is_pretty : boost::false_type {}; \
+  struct Is_pretty : std::false_type {}; \
   template<class T> \
   struct Is_pretty<T,true> : T::Is_pretty {}
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h b/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h
index 99a28ab578f1..a3255d25eb00 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h
@@ -69,19 +69,19 @@ namespace CGAL {
                                    Provides_functor<K, typename boost::mpl::front<List>::type>,
                                    Provides_functors<K, typename boost::mpl::pop_front<List>::type> > {};
         template<class K, class List>
-        struct Provides_functors<K, List, true> : boost::true_type {};
+        struct Provides_functors<K, List, true> : std::true_type {};
 
         template<class K, class List, bool=boost::mpl::empty<List>::type::value>
         struct Provides_types : boost::mpl::and_ <
                                    Provides_type<K, typename boost::mpl::front<List>::type>,
                                    Provides_types<K, typename boost::mpl::pop_front<List>::type> > {};
         template<class K, class List>
-        struct Provides_types<K, List, true> : boost::true_type {};
+        struct Provides_types<K, List, true> : std::true_type {};
 
         namespace internal { BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(has_Type,template Type<Null_tag>,false) }
         template<class Kernel, class Tg,
           bool = internal::has_Type<Kernel>::value /* false */>
-        struct Provides_type_i : boost::false_type {};
+        struct Provides_type_i : std::false_type {};
         template<class Kernel, class Tg>
         struct Provides_type_i <Kernel, Tg, true>
           : Has_type_different_from<typename Kernel::template Type<Tg>, Null_type> {};
@@ -93,7 +93,7 @@ namespace CGAL {
 
         template<class Kernel, class Tg, class O=void,
           bool = internal::has_Functor<Kernel>::value /* false */>
-        struct Provides_functor_i : boost::false_type {};
+        struct Provides_functor_i : std::false_type {};
         template<class Kernel, class Tg, class O>
         struct Provides_functor_i <Kernel, Tg, O, true>
           : Has_type_different_from<typename Kernel::template Functor<Tg, O>, Null_functor> {};
@@ -332,19 +332,19 @@ namespace CGAL {
         struct Stores_squared_norm_tag {};
 
         template<class> struct Preserved_by_non_linear_extra_coordinate
-          : boost::false_type {};
+          : std::false_type {};
         template<> struct Preserved_by_non_linear_extra_coordinate
-          <Has_extra_dimension_tag> : boost::true_type {};
+          <Has_extra_dimension_tag> : std::true_type {};
         template<> struct Preserved_by_non_linear_extra_coordinate
-          <Has_determinant_of_vectors_tag> : boost::true_type {};
+          <Has_determinant_of_vectors_tag> : std::true_type {};
         template<> struct Preserved_by_non_linear_extra_coordinate
-          <Has_determinant_of_points_tag> : boost::true_type {};
+          <Has_determinant_of_points_tag> : std::true_type {};
         template<> struct Preserved_by_non_linear_extra_coordinate
-          <Has_determinant_of_iterator_to_vectors_tag> : boost::true_type {};
+          <Has_determinant_of_iterator_to_vectors_tag> : std::true_type {};
         template<> struct Preserved_by_non_linear_extra_coordinate
-          <Has_determinant_of_iterator_to_points_tag> : boost::true_type {};
+          <Has_determinant_of_iterator_to_points_tag> : std::true_type {};
         template<> struct Preserved_by_non_linear_extra_coordinate
-          <Has_determinant_of_vectors_omit_last_tag> : boost::true_type {};
+          <Has_determinant_of_vectors_omit_last_tag> : std::true_type {};
 
         // Kernel properties
         struct Point_stores_squared_distance_to_origin_tag {};
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/utils.h b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
index adc632e50c67..a1ac6faeddd2 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/utils.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
@@ -35,7 +35,7 @@ namespace internal {
 }
 
 template <class T, class No, bool=internal::has_type<T>::value /*false*/>
-struct Has_type_different_from : boost::false_type {};
+struct Has_type_different_from : std::false_type {};
 template <class T, class No>
 struct Has_type_different_from <T, No, true>
 : boost::mpl::not_<std::is_same<typename T::type, No> > {};
diff --git a/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h b/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h
index ba6ebd878120..b8d09a2dbfd4 100644
--- a/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h
+++ b/Optimal_transportation_reconstruction_2/include/CGAL/Optimal_transportation_reconstruction_2.h
@@ -1184,9 +1184,9 @@ class Optimal_transportation_reconstruction_2
   // number type (like a multiprecision), the coordinates of the points
   // will increase a lot due to the relocation step. These functions
   // simply turn a relocated point to a rounded to double version.
-  void relocate_on_the_double_grid(Point&, boost::true_type) const
+  void relocate_on_the_double_grid(Point&, std::true_type) const
   {}
-  void relocate_on_the_double_grid(Point& p, boost::false_type) const
+  void relocate_on_the_double_grid(Point& p, std::false_type) const
   {
     double x=to_double(m_traits.compute_x_2_object()(p));
     double y=to_double(m_traits.compute_y_2_object()(p));
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
index 470ca6ed2325..30b0fef1855e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
@@ -1147,7 +1147,7 @@ bool do_intersect(const PolylineRange& polylines1,
                       typename boost::mpl::eval_if<
                         boost::has_range_iterator<PolylineRange>,
                         boost::range_value<PolylineRange>,
-                        boost::false_type >::type
+                        std::false_type >::type
                     >::value
                    >* = 0//end enable_if
 #endif
@@ -1194,7 +1194,7 @@ bool do_intersect(const Polyline& polyline1,
                       typename boost::mpl::eval_if<
                         boost::has_range_iterator<Polyline>,
                         boost::range_value<Polyline>,
-                        boost::false_type
+                        std::false_type
                       >::type
                     >::value
                   >* = 0//end enable_if
@@ -1365,7 +1365,7 @@ bool do_intersect(const TriangleMesh& tm,
                       typename boost::mpl::eval_if<
                         boost::has_range_iterator<PolylineRange>,
                         boost::range_value<PolylineRange>,
-                        boost::false_type
+                        std::false_type
                       >::type
                     >::value
                   >* = 0//end enable_if
@@ -1435,7 +1435,7 @@ bool do_intersect(const TriangleMesh& tm,
                         typename boost::mpl::eval_if<
                           boost::has_range_iterator<Polyline>,
                           boost::range_value<Polyline>,
-                          boost::false_type
+                          std::false_type
                         >::type
                       >::type // not a range of a range
                     >::value
diff --git a/STL_Extension/include/CGAL/is_convertible.h b/STL_Extension/include/CGAL/is_convertible.h
index 1daa86cb63b3..1dfcda697459 100644
--- a/STL_Extension/include/CGAL/is_convertible.h
+++ b/STL_Extension/include/CGAL/is_convertible.h
@@ -17,7 +17,7 @@
 #ifndef CGAL_IS_CONVERTIBLE_H
 #define CGAL_IS_CONVERTIBLE_H
 
-#include <boost/type_traits/integral_constant.hpp>
+#include <type_traits>
 #ifdef CGAL_USE_GMPXX
 #include <gmpxx.h>
 #endif
@@ -30,7 +30,7 @@ template<class From,class To>struct is_implicit_convertible
 #ifdef CGAL_USE_GMPXX
 // Work around a gmpxx misfeature
 template<class T>struct is_implicit_convertible<__gmp_expr<mpq_t,T>,mpz_class>
-        : boost::false_type {};
+        : std::false_type {};
 #endif
 
 // TODO: add is_explicit_convertible (using boost::is_constructible?)

From b2a330bbdfb25fd9572b163381e1aec0b7c29eb9 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Sun, 30 Apr 2023 14:21:54 +0100
Subject: [PATCH 0269/1398] WIP re-adding scripting

---
 Polyhedron/demo/Polyhedron/CMakeLists.txt |   4 +-
 Polyhedron/demo/Polyhedron/MainWindow.cpp | 192 +++++++---------------
 Polyhedron/demo/Polyhedron/MainWindow.h   |  25 +--
 3 files changed, 71 insertions(+), 150 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/CMakeLists.txt b/Polyhedron/demo/Polyhedron/CMakeLists.txt
index ce49786fd28c..c6d91a0cf727 100644
--- a/Polyhedron/demo/Polyhedron/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/CMakeLists.txt
@@ -46,7 +46,7 @@ endif()
 
 # Find Qt6 itself
 find_package(Qt6 QUIET
-             COMPONENTS OpenGLWidgets Widgets
+             COMPONENTS OpenGLWidgets Widgets Qml
              OPTIONAL_COMPONENTS WebSockets Network)
 
 set_package_properties(
@@ -211,7 +211,7 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
     Primitive_container.cpp
     Polyhedron_demo_plugin_helper.cpp
     CGAL_double_edit.cpp)
-  target_link_libraries(demo_framework PUBLIC Qt6::OpenGLWidgets Qt6::Widgets Qt6::Gui
+  target_link_libraries(demo_framework PUBLIC Qt6::OpenGLWidgets Qt6::Widgets Qt6::Gui Qt6::Qml
                                               CGAL::CGAL_Qt6)
   if(TARGET Qt6::WebSockets)
     target_link_libraries(demo_framework PUBLIC Qt6::WebSockets)
diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index 40e14de0d22c..b481ce58d009 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -46,15 +46,10 @@
 #include <fstream>
 #include <QElapsedTimer>
 #include <QWidgetAction>
-#include <QJsonArray>
 #include <QSequentialIterable>
 #include <QDir>
-#ifdef QT_SCRIPT_LIB
-#  include <QScriptValue>
-#  ifdef QT_SCRIPTTOOLS_LIB
-#    include <QScriptEngineDebugger>
-#  endif
-#endif
+#include <QJSValue>
+
 
 #include <CGAL/Three/Three.h>
 #include <CGAL/Three/Polyhedron_demo_plugin_interface.h>
@@ -75,58 +70,25 @@
 
 #include "Color_map.h"
 
-#ifdef QT_SCRIPT_LIB
-#  include <QScriptEngine>
-#  include <QScriptValue>
-
-
 
 using namespace CGAL::Three;
-QScriptValue
-myScene_itemToScriptValue(QScriptEngine *engine,
+QJSValue
+myScene_itemToScriptValue(QJSEngine *engine,
                           CGAL::Three::Scene_item* const &in)
 {
   return engine->newQObject(in);
 }
 
-void myScene_itemFromScriptValue(const QScriptValue &object,
+void myScene_itemFromScriptValue(const QJSValue &object,
                                  CGAL::Three::Scene_item* &out)
 {
   out = qobject_cast<CGAL::Three::Scene_item*>(object.toQObject());
 }
-#endif // QT_SCRIPT_LIB
-
-#ifdef QT_SCRIPT_LIB
-#  ifdef QT_SCRIPTTOOLS_LIB
-
-const QScriptEngineDebugger::DebuggerWidget debug_widgets[9] = {
-  QScriptEngineDebugger::ConsoleWidget,
-  QScriptEngineDebugger::StackWidget,
-  QScriptEngineDebugger::ScriptsWidget,
-  QScriptEngineDebugger::LocalsWidget,
-  QScriptEngineDebugger::CodeWidget,
-  QScriptEngineDebugger::CodeFinderWidget,
-  QScriptEngineDebugger::BreakpointsWidget,
-  QScriptEngineDebugger::DebugOutputWidget,
-  QScriptEngineDebugger::ErrorLogWidget
-};
-const QString debug_widgets_names[9] = {
-  "Script console",
-  "Stack",
-  "Scripts",
-  "Locals",
-  "Code",
-  "CodeFinder",
-  "Breakpoints",
-  "DebugOutput",
-  "ErrorLog"
-};
-
-#  endif
-#endif
+
+
 
 #if 0
-QScriptValue myPrintFunction(QScriptContext *context, QScriptEngine *engine)
+QJSValue myPrintFunction(QScriptContext *context, QJSEngine *engine)
 {
   MainWindow* mw = qobject_cast<MainWindow*>(engine->parent());
   QString result;
@@ -168,11 +130,7 @@ MainWindow::MainWindow(const QStringList &keywords, bool verbose, QWidget* paren
   menu_map[ui->menuOperations->title()] = ui->menuOperations;
   this->verbose = verbose;
   is_locked = false;
-  // remove the Load Script menu entry, when the demo has not been compiled with QT_SCRIPT_LIB
-#if !defined(QT_SCRIPT_LIB)
- // ui->menuBar->removeAction(ui->actionLoadScript);
- // ui->menuBar->removeAction(ui->on_actionLoad_a_Scene_from_a_Script_File);
-#endif
+
   // Save some pointers from ui, for latter use.
   sceneView = ui->sceneView;
   viewer_window = new SubViewer(ui->mdiArea, this, nullptr);
@@ -329,54 +287,36 @@ MainWindow::MainWindow(const QStringList &keywords, bool verbose, QWidget* paren
   // Reset the "Operation menu"
   clearMenu(ui->menuOperations);
 
-#ifdef QT_SCRIPT_LIB
   std::cerr << "Enable scripts.\n";
-  script_engine = new QScriptEngine(this);
+  script_engine = new QJSEngine(this);
+
+#if 0
   qScriptRegisterMetaType<CGAL::Three::Scene_item*>(script_engine,
                                                     myScene_itemToScriptValue,
                                                     myScene_itemFromScriptValue);
-#  ifdef QT_SCRIPTTOOLS_LIB
-  QScriptEngineDebugger* debugger = new QScriptEngineDebugger(this);
-  debugger->setObjectName("qt script debugger");
-  QAction* debuggerMenuAction =
-      menuBar()->addMenu(debugger->createStandardMenu());
-  debuggerMenuAction->setText(tr("Qt Script &Debug"));
-  for(unsigned int i = 0; i < 9; ++i)
-  {
-    QDockWidget* dock = new QDockWidget(debug_widgets_names[i], this);
-    dock->setObjectName(debug_widgets_names[i]);
-    dock->setWidget(debugger->widget(debug_widgets[i]));
-    this->QMainWindow::addDockWidget(Qt::BottomDockWidgetArea, dock);
-    dock->hide();
-  }
-  debugger->setAutoShowStandardWindow(false);
-  debugger->attachTo(script_engine);
-#  endif // QT_SCRIPTTOOLS_LIB
-  QScriptValue fun = script_engine->newFunction(myPrintFunction);
-  script_engine->globalObject().setProperty("print", fun);
 
+
+  QJSValue fun = script_engine->newFunction(myPrintFunction);
+  script_engine->globalObject().setProperty("print", fun);
+#endif
   //  evaluate_script("print('hello', 'world', 'from QtScript!')");
-  QScriptValue mainWindowObjectValue = script_engine->newQObject(this);
+  QJSValue mainWindowObjectValue = script_engine->newQObject(this);
   script_engine->globalObject().setProperty("main_window", mainWindowObjectValue);
 
-  QScriptValue sceneObjectValue = script_engine->newQObject(scene);
+  QJSValue sceneObjectValue = script_engine->newQObject(scene);
   mainWindowObjectValue.setProperty("scene", sceneObjectValue);
   script_engine->globalObject().setProperty("scene", sceneObjectValue);
 
-  QScriptValue viewerObjectValue = script_engine->newQObject(viewer);
+  QJSValue viewerObjectValue = script_engine->newQObject(viewer);
   mainWindowObjectValue.setProperty("viewer", viewerObjectValue);
   script_engine->globalObject().setProperty("viewer", viewerObjectValue);
 
-  QScriptValue cameraObjectValue = script_engine->newQObject(viewer->camera());
+  QJSValue cameraObjectValue = script_engine->newQObject(viewer->camera());
   viewerObjectValue.setProperty("camera", cameraObjectValue);
   script_engine->globalObject().setProperty("camera", cameraObjectValue);
 
   evaluate_script("var plugins = new Array();");
-#  ifdef QT_SCRIPTTOOLS_LIB
-  QScriptValue debuggerObjectValue = script_engine->newQObject(debugger);
-  script_engine->globalObject().setProperty("debugger", debuggerObjectValue);
-#  endif
-#endif
+
 
   readSettings(); // Among other things, the column widths are stored.
 
@@ -415,18 +355,15 @@ MainWindow::MainWindow(const QStringList &keywords, bool verbose, QWidget* paren
 
   actionResetDefaultLoaders = new QAction("Reset Default Loaders",this);
 
-#ifdef QT_SCRIPT_LIB
   // evaluate_script("print(plugins);");
   Q_FOREACH(QAction* action, findChildren<QAction*>()) {
     if(action->objectName() != "") {
-      QScriptValue objectValue = script_engine->newQObject(action);
+      QJSValue objectValue = script_engine->newQObject(action);
       script_engine->globalObject().setProperty(action->objectName(),
                                                 objectValue);
     }
   }
   filterOperations(true);
-  // debugger->action(QScriptEngineDebugger::InterruptAction)->trigger();
-#endif
 }
 
 void addActionToMenu(QAction* action, QMenu* menu)
@@ -532,23 +469,33 @@ void MainWindow::filterOperations(bool)
 
 #include <CGAL/Three/exceptions.h>
 
-#if 0
+
 void MainWindow::evaluate_script(QString script,
                                  const QString& filename,
                                  const bool quiet) {
+#if 0
   QScriptContext* context = script_engine->currentContext();
-  QScriptValue object = context->activationObject();
-  QScriptValue former_current_filename = object.property("current_filename");;
+  QJSValue object = context->activationObject();
+  QJSValue former_current_filename = object.property("current_filename");;
   object.setProperty("current_filename", filename);
+#endif
+
+  QJSValue value = script_engine->evaluate(script, filename);
+  if (value.isError())
+    if(! quiet){
+      qDebug() << "Uncaught exception at line"
+               << value.property("lineNumber").toInt()
+               << ":" << value.toString();
+    }
+#if 0
 
-  QScriptValue value = script_engine->evaluate(script, filename);
   if(script_engine->hasUncaughtException()) {
-    QScriptValue js_exception = script_engine->uncaughtException();
-    QScriptValue js_bt =js_exception.property("backtrace");
+    QJSValue js_exception = script_engine->uncaughtException();
+    QJSValue js_bt =js_exception.property("backtrace");
     QStringList bt = script_engine->uncaughtExceptionBacktrace();
     if(js_bt.isValid()) {
       QStringList other_bt;
-      qScriptValueToSequence(js_bt, other_bt);
+      qJSValueToSequence(js_bt, other_bt);
       if(!other_bt.isEmpty()) bt = other_bt;
     }
     if(!quiet) {
@@ -569,6 +516,7 @@ void MainWindow::evaluate_script(QString script,
   }
 
   object.setProperty("current_filename", former_current_filename);
+#endif
 }
 
 void MainWindow::evaluate_script_quiet(QString script,
@@ -577,30 +525,7 @@ void MainWindow::evaluate_script_quiet(QString script,
   evaluate_script(script, filename, true);
 }
 
-void MainWindow::enableScriptDebugger(bool b /* = true */)
-{
-  Q_UNUSED(b);
-#ifdef QT_SCRIPT_LIB
-#  ifdef QT_SCRIPTTOOLS_LIB
-  QScriptEngineDebugger* debugger =
-      findChild<QScriptEngineDebugger*>("qt script debugger");
-  if(debugger) {
-    if(b) {
-      debugger->action(QScriptEngineDebugger::InterruptAction)->trigger();
-    }
-    else {
-      std::cerr << "Detach the script debugger\n";
-      debugger->detach();
-    }
-  }
-  return;
-#  endif
-#endif
-  // If we are here, then the debugger is not available
-  this->error(tr("Your version of Qt is too old, and for that reason "
-                 "the Qt Script Debugger is not available."));
-}
-#endif
+
 
 namespace {
 bool actionsByName(QAction* x, QAction* y) {
@@ -704,12 +629,10 @@ bool MainWindow::load_plugin(QString fileName, bool blacklisted)
         pluginsStatus_map[name] = QString("Not for this program.");
       }
       else{
-#ifdef QT_SCRIPT_LIB
-        QScriptValue objectValue =
+        QJSValue objectValue =
             script_engine->newQObject(obj);
         script_engine->globalObject().setProperty(obj->objectName(), objectValue);
         evaluate_script_quiet(QString("plugins.push(%1);").arg(obj->objectName()));
-#endif
         pluginsStatus_map[name] = QString("success");
       }
     }
@@ -927,11 +850,10 @@ void MainWindow::addAction(QString actionName,
   QAction* action = new QAction(actionText, this);
   action->setObjectName(actionName);
   menu->addAction(action);
-#ifdef QT_SCRIPT_LIB
-  QScriptValue objectValue = script_engine->newQObject(action);
+
+  QJSValue objectValue = script_engine->newQObject(action);
   script_engine->globalObject().setProperty(action->objectName(),
                                             objectValue);
-#endif
 }
 
 void MainWindow::viewerShow(float xmin,
@@ -1165,7 +1087,6 @@ void MainWindow::open(QString filename)
 {
   QFileInfo fileinfo(filename);
 
-#ifdef QT_SCRIPT_LIB
   // Handles the loading of script file from the command line arguments,
   // and the special command line arguments that start with "javascript:"
   // or "qtscript:"
@@ -1193,7 +1114,6 @@ void MainWindow::open(QString filename)
     QApplication::restoreOverrideCursor();
     return;
   }
-#endif
 
   if ( !fileinfo.exists() ){
     QMessageBox::warning(this,
@@ -1290,8 +1210,11 @@ bool MainWindow::open(QString filename, QString loader_name) {
     std::cerr << e.what() << std::endl;
     return false;
   }
+#else
+  bool ok;
+  loadItem(fileinfo, findLoader(loader_name), ok);
+  return ok;
 #endif
-  return true;
 }
 
 
@@ -1894,9 +1817,10 @@ void MainWindow::closeEvent(QCloseEvent *event)
   event->accept();
 }
 
-#if 0
+
 bool MainWindow::loadScript(QString filename)
 {
+#if 0
   QFileInfo fileinfo(filename);
   boost::optional<bool> opt = wrap_a_call_to_cpp
       ([this, fileinfo] {
@@ -1904,11 +1828,15 @@ bool MainWindow::loadScript(QString filename)
   }, this, __FILE__, __LINE__, CGAL::Three::PARENT_CONTEXT);
   if(!opt) return false;
   else return *opt;
+#else
+  QFileInfo fileinfo(filename);
+  return loadScript(fileinfo);
+#endif
 }
 
 bool MainWindow::loadScript(QFileInfo info)
 {
-#if defined(QT_SCRIPT_LIB)
+
   QString program;
   QString filename = info.absoluteFilePath();
   QFile script_file(filename);
@@ -1925,10 +1853,9 @@ bool MainWindow::loadScript(QFileInfo info)
     evaluate_script(program, filename);
     return true;
   }
-#endif
   return false;
 }
-#endif
+
 
 void MainWindow::throw_exception() {
 #if 0 // AF
@@ -1936,14 +1863,15 @@ void MainWindow::throw_exception() {
     throw std::runtime_error("Exception thrown in "
                              "MainWindow::throw_exception()");
   }, this, __FILE__, __LINE__);
+#else
+  throw std::runtime_error("Exception thrown in "
+                             "MainWindow::throw_exception()");
 #endif
 }
 
 void MainWindow::on_actionLoadScript_triggered()
 {
-#if defined(QT_SCRIPT_LIB)
 
-#endif
 }
 
 void MainWindow::on_actionLoad_triggered()
@@ -3874,7 +3802,7 @@ void MainWindow::on_actionLoad_a_Scene_from_a_Script_File_triggered()
     if(filename.isEmpty())
       return;
   }
-
+  loadScript(QFileInfo(filename));
   if(do_download){
     QFile tmp_file(filename);
     tmp_file.remove();
diff --git a/Polyhedron/demo/Polyhedron/MainWindow.h b/Polyhedron/demo/Polyhedron/MainWindow.h
index d970c1813ef3..ea43c7a482f6 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.h
+++ b/Polyhedron/demo/Polyhedron/MainWindow.h
@@ -1,5 +1,8 @@
 #ifndef MAINWINDOW_H
 #define MAINWINDOW_H
+
+#define QT_SCRIPT_LIB
+
 #include "config.h"
 #include "MainWindow_config.h"
 
@@ -7,10 +10,7 @@
 #include <CGAL/Qt/DemosMainWindow.h>
 #include <CGAL/Three/Three.h>
 
-// AF @todo   Scripting has changed
-// #include <QScriptEngine>
-// #include <QScriptable>
-
+#include <QJSEngine>
 
 #include <QVector>
 #include <QList>
@@ -62,7 +62,6 @@ class MAINWINDOW_EXPORT MainWindow :
   public CGAL::Qt::DemosMainWindow,
   public Messages_interface,
   public CGAL::Three::Three
-  // AF        , protected QScriptable
 {
   Q_OBJECT
   Q_INTERFACES(Messages_interface)
@@ -148,13 +147,12 @@ public Q_SLOTS:
    index of the item to be reloaded as data attached to the action.
    The index must identify a valid `Scene_item`.*/
   void reloadItem();
-#if 0
+
   //! Loads a script. Returns true if it worked.
   bool loadScript(QString filename);
 
   //! Loads a script. Returns true if it worked.
   bool loadScript(QFileInfo);
-#endif
 
   /*!
    * Gives the keyboard input focus to the widget searchEdit.
@@ -259,11 +257,6 @@ public Q_SLOTS:
 
     //!Returns true if the target plugin is present. If not, returns false.
   bool hasPlugin(const QString&) const;
-  /*!
-   * If able, finds a script debugger and interrupts current action. Default
-   * value for parameter is true.
-   */
-  // void enableScriptDebugger(bool = true);
 
   /// This slot is used to test exception handling in Qt Scripts.
   void throw_exception();
@@ -331,7 +324,7 @@ protected Q_SLOTS:
   bool on_actionErase_triggered();
   //!Duplicates the selected item and selects the new item.
   void on_actionDuplicate_triggered();
-  //!If QT_SCRIPT_LIB is defined, opens a dialog to choose a script.
+  //!Opens a dialog to choose a script.
   void on_actionLoadScript_triggered();
   //!Loads a plugin from a specified directory
   void on_actionLoadPlugin_triggered();
@@ -439,8 +432,8 @@ protected Q_SLOTS:
   bool verbose;
   void insertActionBeforeLoadPlugin(QMenu*, QAction *actionToInsert);
 
-#ifdef QT_SCRIPT_LIB
-  QScriptEngine* script_engine;
+
+  QJSEngine* script_engine;
 public:
   /*! Evaluates a script and search for uncaught exceptions. If quiet is false, prints the
    *backtrace of the uncaught exceptions.
@@ -451,7 +444,7 @@ protected Q_SLOTS:
   //! Calls evaluate_script(script, filename, true).
   void evaluate_script_quiet(QString script,
                              const QString & fileName = QString());
-  #endif
+
 
   QMutex mutex;
   QWaitCondition wait_condition;

From ae5d32ba2e425853d4cf822ffd64e19c1d45e7ad Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 1 May 2023 12:23:20 +0200
Subject: [PATCH 0270/1398] citing/referencing "corrected curvature measures"

+ refining the theo background
---
 Documentation/doc/biblio/geom.bib             | 12 +++++++
 .../Polygon_mesh_processing.txt               | 33 ++++++++++---------
 2 files changed, 30 insertions(+), 15 deletions(-)

diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib
index 7c9fec6e420d..f072116a2e27 100644
--- a/Documentation/doc/biblio/geom.bib
+++ b/Documentation/doc/biblio/geom.bib
@@ -152065,3 +152065,15 @@ @article{lachaud2020
   month = jul,
   year = {2020}
 }
+
+@article{lachaud2022
+  author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert},
+  journal = {Discrete & Computational Geometry},
+  title = {Corrected Curvature Measures},
+  volume = {68},
+  pages = {477-524},
+  month = jul,
+  year = {2022},
+  url = {https://doi.org/10.1007/s00454-022-00399-4}
+}
+
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index eac246d8ab47..354c622f0e99 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -898,18 +898,21 @@ they give accurate results, on the condition that the correct vertex normals are
 
 \subsection ICCBackground Brief Background
 
-Curvatures are quantities that describe the local geometry of a surface. They are important in many
-geometry processing applications. since surfaces are 2-dimensional objects (embedded in 3D), they can bend
+Surface curvatures are quantities that describe the local geometry of a surface. They are important in many
+geometry processing applications. As surfaces are 2-dimensional objects (embedded in 3D), they can bend
 in 2 independent directions. These directions are called principal directions, and the amount of bending
-in each direction is called the principal curvature: \f$ k_1 \f$ and \f$ k_2 \f$. Curvature is usually
-expressed as scalar quantities like the mean curvature \f$ H \f$ and the Gaussian curvature \f$ K \f$
-which are defined in terms of the principal curvatures.
-
-The algorithms are based on the following paper \cgalCite{lachaud2020}. It introduces a new way to
-compute curvatures on polygonal meshes. The main idea is based on decoupling the normal information from
-the position information, which is useful for dealing with digital surfaces, or meshes with noise on
-vertex positions. To compute the curvatures, we first compute interpolated curvature measures for each face
-as described below. For a triangle \f$ \tau_{ijk} \f$, with vertices \a i, \a j, \a k:
+in each direction is called the principal curvature: \f$ k_1 \f$ and \f$ k_2 \f$ (denoting max and min
+curvatures). Curvature is usually expressed as scalar quantities like the mean curvature \f$ H \f$ and
+the Gaussian curvature \f$ K \f$ which are defined in terms of the principal curvatures.
+
+The algorithms are based on the two papers \cgalCite{lachaud2022} and \cgalCite{lachaud2020}. They
+introduce a new way to compute curvatures on polygonal meshes. The main idea in \cgalCite{lachaud2022} is
+based on decoupling the normal information from the position information, which is useful for dealing with
+digital surfaces, or meshes with noise on vertex positions. \cgalCite{lachaud2020} introduces some
+extensions to this framework. As it uses linear interpolation on the corrected normal vector field
+to derive new closed form equations for the corrected curvature measures. These <b>interpolated</b>
+curvature measures are the first step for computing the curvatures. For a triangle \f$ \tau_{ijk} \f$,
+with vertices \a i, \a j, \a k:
 
 \f[
   \begin{align*}
@@ -923,10 +926,10 @@ as described below. For a triangle \f$ \tau_{ijk} \f$, with vertices \a i, \a j,
 where \f$ \langle \cdot \mid \cdot \rangle \f$ denotes the usual scalar product,
 \f$ \bar{\mathbf{u}}=\frac{1}{3}( \mathbf{u}_i + \mathbf{u}_j + \mathbf{u}_k )\f$.
 
-The first measure \f$ \mu^{(0)} \f$ is the area measure of the triangle, and the second and third measures
-\f$ \mu^{(1)} \f$ and \f$ \mu^{(2)} \f$ are the mean and Gaussian corrected curvature measures of the triangle.
-The last measure \f$ \mu^{\mathbf{X},\mathbf{Y}} \f$ is the anisotropic corrected curvature measure of the triangle.
-The anisotropic measure is later used to compute the principal curvatures and directions through an eigenvalue
+The first measure \f$ \mu^{(0)} \f$ is the area measure of the triangle, and the measures \f$ \mu^{(1)} \f$ and
+\f$ \mu^{(2)} \f$ are the mean and Gaussian corrected curvature measures of the triangle. The last measure
+\f$ \mu^{\mathbf{X},\mathbf{Y}} \f$ is the anisotropic corrected curvature measure of the triangle. The
+anisotropic measure is later used to compute the principal curvatures and directions through an eigenvalue
 solver.
 
 The interpolated curvature measures are then computed for each vertex \f$ v \f$ as the sum of

From 83bf49bf3977565330e6316cd2640fc60c38cb46 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Mon, 1 May 2023 12:29:25 +0200
Subject: [PATCH 0271/1398] Computing curvatures mentioned in the outline
 section (1.3)

---
 .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt      | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 354c622f0e99..6b6f979ba59f 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -49,6 +49,7 @@ mesh, which includes point location and self intersection tests.
 - \ref PMPCombinatorialRepair :  repair of polygon meshes and polygon soups.
 - \ref PMPGeometricRepair :  repair of the geometry of polygon meshes.
 - \ref PMPNormalComp : normal computation at vertices and on faces of a polygon mesh.
+- \ref PMPICC : computing curvatures (mean, gaussian, principal) on a polygon mesh.
 - \ref PMPSlicer : functor able to compute the intersections of a polygon mesh with arbitrary planes (slicer).
 - \ref PMPConnectedComponents : methods to deal with connected
   components of a polygon mesh (extraction, marks, removal, ...).

From 0ee9406235728660ecc74122fc20505bacfd21ba Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@geometryfactory.com>
Date: Thu, 30 Jul 2020 15:42:41 +0200
Subject: [PATCH 0272/1398] add possibility to provide a variable sizing field
 to PMP::isotropic_remeshing

# Conflicts:
#	Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
#	Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
---
 .../Polygon_mesh_processing/CMakeLists.txt    |  1 +
 ...sotropic_remeshing_with_sizing_example.cpp | 39 ++++++++
 .../Isotropic_remeshing/Sizing_field.h        | 50 ++++++++++
 .../Uniform_sizing_field.h                    | 92 +++++++++++++++++++
 .../Isotropic_remeshing/remesh_impl.h         | 60 ++++++------
 .../CGAL/Polygon_mesh_processing/remesh.h     | 32 +++++--
 6 files changed, 233 insertions(+), 41 deletions(-)
 create mode 100644 Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
 create mode 100644 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
 create mode 100644 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index c755ecf63e8e..cf1424b05c92 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -27,6 +27,7 @@ create_single_source_cgal_program("mesh_slicer_example.cpp")
 #create_single_source_cgal_program( "remove_degeneracies_example.cpp")
 create_single_source_cgal_program("isotropic_remeshing_example.cpp")
 create_single_source_cgal_program("isotropic_remeshing_of_patch_example.cpp")
+create_single_source_cgal_program("isotropic_remeshing_with_sizing_example.cpp")
 create_single_source_cgal_program("tangential_relaxation_example.cpp")
 create_single_source_cgal_program("surface_mesh_intersection.cpp")
 create_single_source_cgal_program("corefinement_SM.cpp")
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
new file mode 100644
index 000000000000..fa5dc55d7896
--- /dev/null
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -0,0 +1,39 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Polygon_mesh_processing/remesh.h>
+
+#include <fstream>
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+typedef CGAL::Surface_mesh<K::Point_3> Mesh;
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+int main(int argc, char* argv[])
+{
+  const char* filename = (argc > 1) ? argv[1] : "data/pig.off";
+  std::ifstream input(filename);
+
+  Mesh mesh;
+  if (!input || !(input >> mesh) || !CGAL::is_triangle_mesh(mesh)) {
+    std::cerr << "Not a valid input file." << std::endl;
+    return 1;
+  }
+
+  double target_edge_length = 0.04;
+  unsigned int nb_iter = 3;
+
+  std::cout << "Start remeshing of " << filename
+    << " (" << num_faces(mesh) << " faces)..." << std::endl;
+
+  PMP::isotropic_remeshing(
+      faces(mesh),
+      target_edge_length,
+      mesh,
+      PMP::parameters::number_of_iterations(nb_iter)
+      );
+
+  std::cout << "Remeshing done." << std::endl;
+
+  return 0;
+}
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
new file mode 100644
index 000000000000..3df70524feca
--- /dev/null
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
@@ -0,0 +1,50 @@
+// Copyright (c) 2020 GeometryFactory (France)
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+//
+// Author(s)     : Jane Tournois
+
+#ifndef CGAL_SIZING_FIELD_H
+#define CGAL_SIZING_FIELD_H
+
+#include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
+
+#include <CGAL/Kernel_traits.h>
+
+namespace CGAL
+{
+/*!
+* Sizing field virtual class
+*/
+template <class PolygonMesh>
+class Sizing_field
+{
+private:
+  typedef PolygonMesh                     PM;
+  typedef typename boost::property_map<PM, boost::vertex_point_t>::const_type VPMap;
+  typedef typename boost::property_traits<VPMap>::value_type Point;
+  typedef typename CGAL::Kernel_traits<Point>::Kernel K;
+
+public:
+  typedef typename boost::graph_traits<PM>::halfedge_descriptor halfedge_descriptor;
+  typedef typename boost::graph_traits<PM>::vertex_descriptor   vertex_descriptor;
+  typedef Point                                                 Point_3;
+  typedef typename K::FT                                        FT;
+
+public:
+  virtual bool is_too_long(const halfedge_descriptor& h, FT& sql) const = 0;
+  virtual bool is_too_long(const vertex_descriptor& va, const vertex_descriptor& vb) const = 0;
+  virtual bool is_too_short(const halfedge_descriptor& h, FT& sqlen) const = 0;
+  virtual Point_3 split_placement(const halfedge_descriptor& h) const = 0;
+
+};
+
+}//end namespace CGAL
+
+#endif //CGAL_SIZING_FIELD_H
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
new file mode 100644
index 000000000000..7b00635ff543
--- /dev/null
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
@@ -0,0 +1,92 @@
+// Copyright (c) 2020 GeometryFactory (France)
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+//
+// Author(s)     : Jane Tournois
+
+#ifndef CGAL_UNIFORM_SIZING_FIELD_H
+#define CGAL_UNIFORM_SIZING_FIELD_H
+
+#include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
+
+#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h>
+
+#include <CGAL/number_utils.h>
+
+namespace CGAL
+{
+template <class PolygonMesh>
+class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
+{
+private:
+  typedef CGAL::Sizing_field<PolygonMesh> Base;
+
+public:
+  typedef typename Base::FT         FT;
+  typedef typename Base::Point_3    Point_3;
+  typedef typename Base::halfedge_descriptor halfedge_descriptor;
+  typedef typename Base::vertex_descriptor   vertex_descriptor;
+
+  Uniform_sizing_field(const FT& size, const PolygonMesh& pmesh)
+    : m_sq_short( CGAL::square(4./5. * size))
+    , m_sq_long(  CGAL::square(4./3. * size))
+    , m_pmesh(pmesh)
+  {}
+
+private:
+  FT sqlength(const vertex_descriptor& va,
+              const vertex_descriptor& vb) const
+  {
+    typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
+      vpmap = get(CGAL::vertex_point, m_pmesh);
+    return FT(CGAL::squared_distance(get(vpmap, va), get(vpmap, vb)));
+  }
+
+  FT sqlength(const halfedge_descriptor& h) const
+  {
+    return sqlength(target(h, m_pmesh), source(h, m_pmesh));
+  }
+
+public:
+  bool is_too_long(const halfedge_descriptor& h, FT& sqlen) const
+  {
+    sqlen = sqlength(h);
+    return sqlen > m_sq_long;
+  }
+
+  bool is_too_long(const vertex_descriptor& va,
+                   const vertex_descriptor& vb) const
+  {
+    FT sqlen = sqlength(va, vb);
+    return sqlen > m_sq_long;
+  }
+
+  bool is_too_short(const halfedge_descriptor& h, FT& sqlen) const
+  {
+    sqlen = sqlength(h);
+    return sqlen < m_sq_short;
+  }
+
+  virtual Point_3 split_placement(const halfedge_descriptor& h) const
+  {
+    typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
+      vpmap = get(CGAL::vertex_point, m_pmesh);
+    return CGAL::midpoint(get(vpmap, target(h, m_pmesh)),
+                          get(vpmap, source(h, m_pmesh)));
+  }
+
+private:
+  FT m_sq_short;
+  FT m_sq_long;
+  const PolygonMesh& m_pmesh;
+};
+
+}//end namespace CGAL
+
+#endif //CGAL_UNIFORM_SIZING_FIELD_H
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 9cdb76ac76b0..e6911102a683 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -478,13 +478,12 @@ namespace internal {
     // "visits all edges of the mesh
     //if an edge is longer than the given threshold `high`, the edge
     //is split at its midpoint and the two adjacent triangles are bisected (2-4 split)"
-    void split_long_edges(const double& high)
+    template<typename SizingFunction>
+    void split_long_edges(const SizingFunction& sizing)
     {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
       std::cout << "Split long edges (" << high << ")..." << std::endl;
 #endif
-      double sq_high = high*high;
-
       //collect long edges
       typedef std::pair<halfedge_descriptor, double> H_and_sql;
       std::multiset< H_and_sql, std::function<bool(H_and_sql,H_and_sql)> >
@@ -497,8 +496,8 @@ namespace internal {
       {
         if (!is_split_allowed(e))
           continue;
-        double sqlen = sqlength(e);
-        if(sqlen > sq_high)
+        double sqlen;
+        if(sizing.is_too_long(halfedge(e, mesh_), sqlen))
           long_edges.emplace(halfedge(e, mesh_), sqlen);
       }
 
@@ -528,7 +527,7 @@ namespace internal {
         Patch_id patch_id_opp = get_patch_id(face(opposite(he, mesh_), mesh_));
 
         //split edge
-        Point refinement_point = this->midpoint(he);
+        Point refinement_point = sizing.split_placement(he);
         halfedge_descriptor hnew = CGAL::Euler::split_edge(he, mesh_);
         CGAL_assertion(he == next(hnew, mesh_));
         put(ecmap_, edge(hnew, mesh_), get(ecmap_, edge(he, mesh_)) );
@@ -548,13 +547,12 @@ namespace internal {
         halfedge_added(hnew_opp, status(opposite(he, mesh_)));
 
         //check sub-edges
-        double sqlen_new = 0.25 * sqlen;
-        if (sqlen_new > sq_high)
-        {
-          //if it was more than twice the "long" threshold, insert them
-          long_edges.emplace(hnew, sqlen_new);
-          long_edges.emplace(next(hnew, mesh_), sqlen_new);
-        }
+        //if it was more than twice the "long" threshold, insert them
+        double sqlen_new;
+        if(sizing.is_too_long(hnew, sqlen_new))
+          long_edges.emplace(hnew,              sqlen_new);
+        if(sizing.is_too_long(next(hnew, mesh_), sqlen_new))
+          long_edges.insert(long_edge(next(hnew, mesh_), sqlen_new));
 
         //insert new edges to keep triangular faces, and update long_edges
         if (!is_on_border(hnew))
@@ -573,8 +571,8 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            double sql = sqlength(hnew2);
-            if (sql > sq_high)
+            double sql;
+            if(sizing.is_too_long(hnew2, sql))
               long_edges.emplace(hnew2, sql);
           }
         }
@@ -596,8 +594,8 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            double sql = sqlength(hnew2);
-            if (sql > sq_high)
+            double sql;
+            if (sizing.is_too_long(hnew2, sql))
               long_edges.emplace(hnew2, sql);
           }
         }
@@ -620,8 +618,8 @@ namespace internal {
     // "collapses and thus removes all edges that are shorter than a
     // threshold `low`. [...] testing before each collapse whether the collapse
     // would produce an edge that is longer than `high`"
-    void collapse_short_edges(const double& low,
-                              const double& high,
+    template<typename SizingFunction>
+    void collapse_short_edges(const SizingFunction& sizing,
                               const bool collapse_constraints)
     {
       typedef boost::bimap<
@@ -637,14 +635,13 @@ namespace internal {
       std::cout << "Fill bimap...";
       std::cout.flush();
 #endif
-      double sq_low = low*low;
-      double sq_high = high*high;
 
       Boost_bimap short_edges;
       for(edge_descriptor e : edges(mesh_))
       {
-        double sqlen = sqlength(e);
-        if ((sqlen < sq_low) && is_collapse_allowed(e, collapse_constraints))
+        double sqlen;
+        if(  sizing.is_too_short(halfedge(e, mesh_), sqlen)
+          && is_collapse_allowed(e, collapse_constraints))
           short_edges.insert(short_edge(halfedge(e, mesh_), sqlen));
       }
 #ifdef CGAL_PMP_REMESHING_VERBOSE_PROGRESS
@@ -741,7 +738,7 @@ namespace internal {
         for(halfedge_descriptor ha : halfedges_around_target(va, mesh_))
         {
           vertex_descriptor va_i = source(ha, mesh_);
-          if (sqlength(vb, va_i) > sq_high)
+          if (sizing.is_too_long(vb, va_i))
           {
             collapse_ok = false;
             break;
@@ -796,7 +793,7 @@ namespace internal {
           //fix constrained case
           CGAL_assertion((is_constrained(vkept) || is_corner(vkept) || is_on_patch_border(vkept)) ==
                          (is_va_constrained || is_vb_constrained || is_va_on_constrained_polyline || is_vb_on_constrained_polyline));
-          if (fix_degenerate_faces(vkept, short_edges, sq_low, collapse_constraints))
+          if (fix_degenerate_faces(vkept, short_edges, sizing, collapse_constraints))
           {
 #ifdef CGAL_PMP_REMESHING_DEBUG
             debug_status_map();
@@ -806,8 +803,9 @@ namespace internal {
             //insert new/remaining short edges
             for (halfedge_descriptor ht : halfedges_around_target(vkept, mesh_))
             {
-              double sqlen = sqlength(ht);
-              if ((sqlen < sq_low) && is_collapse_allowed(edge(ht, mesh_), collapse_constraints))
+              double sqlen;
+              if (sizing.is_too_short(ht, sqlen)
+                && is_collapse_allowed(edge(ht, mesh_), collapse_constraints))
                 short_edges.insert(short_edge(ht, sqlen));
             }
           }
@@ -1645,10 +1643,10 @@ namespace internal {
       // else keep current status for en and eno
     }
 
-    template<typename Bimap>
+    template<typename Bimap, typename SizingFunction>
     bool fix_degenerate_faces(const vertex_descriptor& v,
                               Bimap& short_edges,
-                              const double& sq_low,
+                              const SizingFunction& sizing,
                               const bool collapse_constraints)
     {
       std::unordered_set<halfedge_descriptor> degenerate_faces;
@@ -1726,8 +1724,8 @@ namespace internal {
             //insert new edges in 'short_edges'
             if (is_collapse_allowed(edge(hf, mesh_), collapse_constraints))
             {
-              double sqlen = sqlength(hf);
-              if (sqlen < sq_low)
+              double sqlen;
+              if (sizing.is_too_short(hf, sqlen))
                 short_edges.insert(typename Bimap::value_type(hf, sqlen));
             }
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 6b37ec946ea9..791a0741a611 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -18,6 +18,7 @@
 #include <CGAL/disable_warnings.h>
 
 #include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h>
+#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h>
 
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/boost/graph/named_params_helper.h>
@@ -198,6 +199,21 @@ void isotropic_remeshing(const FaceRange& faces
                        , const double& target_edge_length
                        , PolygonMesh& pmesh
                        , const NamedParameters& np = parameters::default_values())
+{
+  isotropic_remeshing(faces,
+    CGAL::Uniform_sizing_field<PolygonMesh>(target_edge_length, pmesh),
+    pmesh,
+    np);
+}
+
+template<typename PolygonMesh
+       , typename FaceRange
+       , typename SizingFunction
+       , typename NamedParameters>
+void isotropic_remeshing(const FaceRange& faces
+                       , const SizingFunction& sizing
+                       , PolygonMesh& pmesh
+                       , const NamedParameters& np)
 {
   if (boost::begin(faces)==boost::end(faces))
     return;
@@ -261,12 +277,10 @@ void isotropic_remeshing(const FaceRange& faces
 #endif
     ) ) );
 
-  double low = 4. / 5. * target_edge_length;
-  double high = 4. / 3. * target_edge_length;
-
 #if !defined(CGAL_NO_PRECONDITIONS)
   if(protect)
   {
+    double high = 4. / 3. * target_edge_length;
     std::string msg("Isotropic remeshing : protect_constraints cannot be set to");
     msg.append(" true with constraints larger than 4/3 * target_edge_length.");
     msg.append(" Remeshing aborted.");
@@ -313,13 +327,11 @@ void isotropic_remeshing(const FaceRange& faces
 #ifdef CGAL_PMP_REMESHING_VERBOSE
     std::cout << " * Iteration " << (i + 1) << " *" << std::endl;
 #endif
-    if (target_edge_length>0)
-    {
-      if(do_split)
-        remesher.split_long_edges(high);
-      if(do_collapse)
-        remesher.collapse_short_edges(low, high, collapse_constraints);
-    }
+
+    if(do_split)
+     remesher.split_long_edges(sizing);
+    if(do_collapse)
+     remesher.collapse_short_edges(sizing, collapse_constraints);
     if(do_flip)
       remesher.flip_edges_for_valence_and_shape();
     remesher.tangential_relaxation_impl(smoothing_1d, nb_laplacian);

From 9de41310fd27bd8d55a7a9b75914f5c2d60f2a1f Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@geometryfactory.com>
Date: Thu, 30 Jul 2020 16:23:03 +0200
Subject: [PATCH 0273/1398] use boost::optional<double> instead of a bool and a
 double

# Conflicts:
#	Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
---
 .../Isotropic_remeshing/Sizing_field.h        | 14 ++---
 .../Uniform_sizing_field.h                    | 35 ++++++++-----
 .../Isotropic_remeshing/remesh_impl.h         | 51 ++++++++++---------
 3 files changed, 57 insertions(+), 43 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
index 3df70524feca..fc6b14a984f5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
@@ -10,12 +10,13 @@
 //
 // Author(s)     : Jane Tournois
 
-#ifndef CGAL_SIZING_FIELD_H
-#define CGAL_SIZING_FIELD_H
+#ifndef CGAL_PMP_REMESHING_SIZING_FIELD_H
+#define CGAL_PMP_REMESHING_SIZING_FIELD_H
 
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
 #include <CGAL/Kernel_traits.h>
+#include <boost/optional.hpp>
 
 namespace CGAL
 {
@@ -38,13 +39,14 @@ class Sizing_field
   typedef typename K::FT                                        FT;
 
 public:
-  virtual bool is_too_long(const halfedge_descriptor& h, FT& sql) const = 0;
-  virtual bool is_too_long(const vertex_descriptor& va, const vertex_descriptor& vb) const = 0;
-  virtual bool is_too_short(const halfedge_descriptor& h, FT& sqlen) const = 0;
+  virtual boost::optional<FT> is_too_long(const halfedge_descriptor& h) const = 0;
+  virtual boost::optional<FT> is_too_long(const vertex_descriptor& va,
+                                          const vertex_descriptor& vb) const = 0;
+  virtual boost::optional<FT> is_too_short(const halfedge_descriptor& h) const = 0;
   virtual Point_3 split_placement(const halfedge_descriptor& h) const = 0;
 
 };
 
 }//end namespace CGAL
 
-#endif //CGAL_SIZING_FIELD_H
+#endif //CGAL_PMP_REMESHING_SIZING_FIELD_H
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
index 7b00635ff543..8704c84ef117 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
@@ -10,8 +10,8 @@
 //
 // Author(s)     : Jane Tournois
 
-#ifndef CGAL_UNIFORM_SIZING_FIELD_H
-#define CGAL_UNIFORM_SIZING_FIELD_H
+#ifndef CGAL_PMP_REMESHING_UNIFORM_SIZING_FIELD_H
+#define CGAL_PMP_REMESHING_UNIFORM_SIZING_FIELD_H
 
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
@@ -54,23 +54,32 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   }
 
 public:
-  bool is_too_long(const halfedge_descriptor& h, FT& sqlen) const
+  boost::optional<FT> is_too_long(const halfedge_descriptor& h) const
   {
-    sqlen = sqlength(h);
-    return sqlen > m_sq_long;
+    const FT sqlen = sqlength(h);
+    if(sqlen > m_sq_long)
+      return sqlen;
+    else
+      return boost::none;
   }
 
-  bool is_too_long(const vertex_descriptor& va,
-                   const vertex_descriptor& vb) const
+  boost::optional<FT> is_too_long(const vertex_descriptor& va,
+                                  const vertex_descriptor& vb) const
   {
-    FT sqlen = sqlength(va, vb);
-    return sqlen > m_sq_long;
+    const FT sqlen = sqlength(va, vb);
+    if (sqlen > m_sq_long)
+      return sqlen;
+    else
+      return boost::none;
   }
 
-  bool is_too_short(const halfedge_descriptor& h, FT& sqlen) const
+  boost::optional<FT> is_too_short(const halfedge_descriptor& h) const
   {
-    sqlen = sqlength(h);
-    return sqlen < m_sq_short;
+    const FT sqlen = sqlength(h);
+    if (sqlen < m_sq_long)
+      return sqlen;
+    else
+      return boost::none;
   }
 
   virtual Point_3 split_placement(const halfedge_descriptor& h) const
@@ -89,4 +98,4 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
 
 }//end namespace CGAL
 
-#endif //CGAL_UNIFORM_SIZING_FIELD_H
+#endif //CGAL_PMP_REMESHING_UNIFORM_SIZING_FIELD_H
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index e6911102a683..ed95352bab9c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -496,9 +496,9 @@ namespace internal {
       {
         if (!is_split_allowed(e))
           continue;
-        double sqlen;
-        if(sizing.is_too_long(halfedge(e, mesh_), sqlen))
-          long_edges.emplace(halfedge(e, mesh_), sqlen);
+        boost::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_));
+        if(sqlen != boost::none)
+          long_edges.emplace(halfedge(e, mesh_), sqlen.get());
       }
 
       //split long edges
@@ -548,11 +548,13 @@ namespace internal {
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
-        double sqlen_new;
-        if(sizing.is_too_long(hnew, sqlen_new))
-          long_edges.emplace(hnew,              sqlen_new);
-        if(sizing.is_too_long(next(hnew, mesh_), sqlen_new))
-          long_edges.insert(long_edge(next(hnew, mesh_), sqlen_new));
+        boost::optional<double> sqlen_new = sizing.is_too_long(hnew);
+        if(sqlen_new != boost::none)
+          long_edges.emplace(hnew, sqlen_new.get());
+
+        sqlen_new = sizing.is_too_long(next(hnew, mesh_));
+        if (sqlen_new != boost::none)
+          long_edges.emplace(next(hnew, mesh_), sqlen_new.get());
 
         //insert new edges to keep triangular faces, and update long_edges
         if (!is_on_border(hnew))
@@ -571,9 +573,9 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            double sql;
-            if(sizing.is_too_long(hnew2, sql))
-              long_edges.emplace(hnew2, sql);
+            boost::optional<double> sql = sizing.is_too_long(hnew2);
+            if(sql != boost::none)
+              long_edges.emplace(hnew2, sql.get());
           }
         }
 
@@ -594,9 +596,9 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            double sql;
-            if (sizing.is_too_long(hnew2, sql))
-              long_edges.emplace(hnew2, sql);
+            boost::optional<double> sql = sizing.is_too_long(hnew2);
+            if (sql != boost::none)
+              long_edges.emplace(hnew2, sql.get());
           }
         }
       }
@@ -639,10 +641,10 @@ namespace internal {
       Boost_bimap short_edges;
       for(edge_descriptor e : edges(mesh_))
       {
-        double sqlen;
-        if(  sizing.is_too_short(halfedge(e, mesh_), sqlen)
+        boost::optional<double> sqlen = sizing.is_too_short(halfedge(e, mesh_));
+        if(sqlen != boost::none
           && is_collapse_allowed(e, collapse_constraints))
-          short_edges.insert(short_edge(halfedge(e, mesh_), sqlen));
+          short_edges.insert(short_edge(halfedge(e, mesh_), sqlen.get()));
       }
 #ifdef CGAL_PMP_REMESHING_VERBOSE_PROGRESS
       std::cout << "done." << std::endl;
@@ -738,7 +740,8 @@ namespace internal {
         for(halfedge_descriptor ha : halfedges_around_target(va, mesh_))
         {
           vertex_descriptor va_i = source(ha, mesh_);
-          if (sizing.is_too_long(vb, va_i))
+          boost::optional<double> sqha = sizing.is_too_long(vb, va_i);
+          if (sqha != boost::none)
           {
             collapse_ok = false;
             break;
@@ -803,10 +806,10 @@ namespace internal {
             //insert new/remaining short edges
             for (halfedge_descriptor ht : halfedges_around_target(vkept, mesh_))
             {
-              double sqlen;
-              if (sizing.is_too_short(ht, sqlen)
+              boost::optional<double> sqlen = sizing.is_too_short(ht);
+              if (sqlen != boost::none
                 && is_collapse_allowed(edge(ht, mesh_), collapse_constraints))
-                short_edges.insert(short_edge(ht, sqlen));
+                short_edges.insert(short_edge(ht, sqlen.get()));
             }
           }
         }//end if(collapse_ok)
@@ -1724,9 +1727,9 @@ namespace internal {
             //insert new edges in 'short_edges'
             if (is_collapse_allowed(edge(hf, mesh_), collapse_constraints))
             {
-              double sqlen;
-              if (sizing.is_too_short(hf, sqlen))
-                short_edges.insert(typename Bimap::value_type(hf, sqlen));
+              boost::optional<double> sqlen = sizing.is_too_short(hf);
+              if (sqlen != boost::none)
+                short_edges.insert(typename Bimap::value_type(hf, sqlen.get()));
             }
 
             if(!is_border(hf, mesh_) &&

From ad55b8cd9f7e6dd5cf9a54818c06570b36b861fc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 11 Apr 2021 07:45:14 +0200
Subject: [PATCH 0274/1398] fix compilation issues

---
 .../Isotropic_remeshing/remesh_impl.h         |  9 ++++-----
 .../CGAL/Polygon_mesh_processing/remesh.h     | 19 +++++++++++++++----
 2 files changed, 19 insertions(+), 9 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index ed95352bab9c..6103108cc50e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -227,14 +227,14 @@ namespace internal {
   template<typename PM,
            typename EdgeConstraintMap,
            typename VertexPointMap,
-           typename FacePatchMap>
+           typename FacePatchMap,
+           typename SizingFunction>
   bool constraints_are_short_enough(const PM& pmesh,
                                     EdgeConstraintMap ecmap,
                                     VertexPointMap vpmap,
                                     const FacePatchMap& fpm,
-                                    const double& high)
+                                    const SizingFunction& sizing)
   {
-    double sqh = high*high;
     typedef typename boost::graph_traits<PM>::halfedge_descriptor halfedge_descriptor;
     typedef typename boost::graph_traits<PM>::edge_descriptor     edge_descriptor;
     for(edge_descriptor e : edges(pmesh))
@@ -244,8 +244,7 @@ namespace internal {
             get(ecmap, e) ||
             get(fpm, face(h,pmesh))!=get(fpm, face(opposite(h,pmesh),pmesh)) )
       {
-        if (sqh < CGAL::squared_distance(get(vpmap, source(h, pmesh)),
-                                         get(vpmap, target(h, pmesh))))
+        if (sizing.is_too_long(source(h, pmesh), target(h, pmesh)))
         {
           return false;
         }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 791a0741a611..8887a0b9beb5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -31,6 +31,16 @@ namespace CGAL {
 
 namespace Polygon_mesh_processing {
 
+/*! \todo document me or merge the doc with the original overload*/
+template<typename PolygonMesh
+       , typename FaceRange
+       , typename SizingFunction
+       , typename NamedParameters>
+void isotropic_remeshing(const FaceRange& faces
+                       , const SizingFunction& sizing
+                       , PolygonMesh& pmesh
+                       , const NamedParameters& np);
+
 /*!
 * \ingroup PMP_meshing_grp
 *
@@ -200,8 +210,10 @@ void isotropic_remeshing(const FaceRange& faces
                        , PolygonMesh& pmesh
                        , const NamedParameters& np = parameters::default_values())
 {
-  isotropic_remeshing(faces,
-    CGAL::Uniform_sizing_field<PolygonMesh>(target_edge_length, pmesh),
+  typedef Uniform_sizing_field<PolygonMesh> Default_sizing;
+  isotropic_remeshing<PolygonMesh, FaceRange, Default_sizing, NamedParameters>(
+    faces,
+    Default_sizing(target_edge_length, pmesh),
     pmesh,
     np);
 }
@@ -280,12 +292,11 @@ void isotropic_remeshing(const FaceRange& faces
 #if !defined(CGAL_NO_PRECONDITIONS)
   if(protect)
   {
-    double high = 4. / 3. * target_edge_length;
     std::string msg("Isotropic remeshing : protect_constraints cannot be set to");
     msg.append(" true with constraints larger than 4/3 * target_edge_length.");
     msg.append(" Remeshing aborted.");
     CGAL_precondition_msg(
-      internal::constraints_are_short_enough(pmesh, ecmap, vpmap, fpmap, high),
+      internal::constraints_are_short_enough(pmesh, ecmap, vpmap, fpmap, sizing),
       msg.c_str());
   }
 #endif

From 5c1e820c1eff9fba31e6622e7d4737cfcc619fa0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 11 Apr 2021 08:39:54 +0200
Subject: [PATCH 0275/1398] fix test and demo

---
 .../internal/Isotropic_remeshing/remesh_impl.h              | 4 ++--
 .../include/CGAL/Polygon_mesh_processing/remesh.h           | 6 ++----
 .../Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp   | 4 ++--
 3 files changed, 6 insertions(+), 8 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 6103108cc50e..f0daf9cc20a5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -481,7 +481,7 @@ namespace internal {
     void split_long_edges(const SizingFunction& sizing)
     {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
-      std::cout << "Split long edges (" << high << ")..." << std::endl;
+      std::cout << "Split long edges..." << std::endl;
 #endif
       //collect long edges
       typedef std::pair<halfedge_descriptor, double> H_and_sql;
@@ -629,7 +629,7 @@ namespace internal {
       typedef typename Boost_bimap::value_type                    short_edge;
 
 #ifdef CGAL_PMP_REMESHING_VERBOSE
-      std::cout << "Collapse short edges (" << low << ", " << high << ")..."
+      std::cout << "Collapse short edges..."
                 << std::endl;
 #endif
 #ifdef CGAL_PMP_REMESHING_VERBOSE_PROGRESS
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 8887a0b9beb5..54c99b2de432 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -328,8 +328,7 @@ void isotropic_remeshing(const FaceRange& faces
 
 #ifdef CGAL_PMP_REMESHING_VERBOSE
   std::cout << std::endl;
-  std::cout << "Remeshing (size = " << target_edge_length;
-  std::cout << ", #iter = " << nb_iterations << ")..." << std::endl;
+  std::cout << "Remeshing (#iter = " << nb_iterations << ")..." << std::endl;
   t.reset(); t.start();
 #endif
 
@@ -355,8 +354,7 @@ void isotropic_remeshing(const FaceRange& faces
 
 #ifdef CGAL_PMP_REMESHING_VERBOSE
   t.stop();
-  std::cout << "Remeshing done (size = " << target_edge_length;
-  std::cout << ", #iter = " << nb_iterations;
+  std::cout << "Remeshing done (#iter = " << nb_iterations;
   std::cout << ", " << t.time() << " sec )." << std::endl;
 #endif
 }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 37dcedc8adb2..d20594ec1688 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -406,7 +406,7 @@ public Q_SLOTS:
                  selection_item->constrained_edges_pmap(),
                  get(CGAL::vertex_point, *selection_item->polyhedron()),
                  CGAL::Constant_property_map<face_descriptor, std::size_t>(1),
-                 4. / 3. * target_length))
+                 CGAL::Uniform_sizing_field<FaceGraph>(target_length, pmesh)))
             {
               QApplication::restoreOverrideCursor();
               //If facets are selected, splitting edges will add facets that won't be selected, and it will mess up the rest.
@@ -606,7 +606,7 @@ public Q_SLOTS:
                ecm,
                get(CGAL::vertex_point, pmesh),
                CGAL::Constant_property_map<face_descriptor, std::size_t>(1),
-               4. / 3. * target_length))
+               CGAL::Uniform_sizing_field<FaceGraph>(target_length, pmesh)))
           {
             QApplication::restoreOverrideCursor();
             QMessageBox::warning(mw, tr("Error"),

From 50bbb4f6828ad0291cee8383c4decb8cb31b23a9 Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Mon, 12 Apr 2021 07:48:10 +0200
Subject: [PATCH 0276/1398] add namespace

to avoid conflicts with Uniform_sizing_field in Mesh_3
---
 .../internal/Isotropic_remeshing/Uniform_sizing_field.h        | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
index 8704c84ef117..3f32aacb1aa9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
@@ -21,6 +21,8 @@
 
 namespace CGAL
 {
+namespace Polygon_mesh_processing
+{
 template <class PolygonMesh>
 class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
 {
@@ -96,6 +98,7 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   const PolygonMesh& m_pmesh;
 };
 
+}//end namespace Polygon_mesh_processing
 }//end namespace CGAL
 
 #endif //CGAL_PMP_REMESHING_UNIFORM_SIZING_FIELD_H

From 13c4db20dd6f6858cad4eb8aa0b25b6d9b540739 Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Mon, 12 Apr 2021 11:28:32 +0200
Subject: [PATCH 0277/1398] fix max value for constraints length

---
 .../Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp     | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index d20594ec1688..f1b138c16728 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -406,7 +406,7 @@ public Q_SLOTS:
                  selection_item->constrained_edges_pmap(),
                  get(CGAL::vertex_point, *selection_item->polyhedron()),
                  CGAL::Constant_property_map<face_descriptor, std::size_t>(1),
-                 CGAL::Uniform_sizing_field<FaceGraph>(target_length, pmesh)))
+                 CGAL::Polygon_mesh_processing::Uniform_sizing_field<FaceGraph>( 4. / 3. * target_length, pmesh)))
             {
               QApplication::restoreOverrideCursor();
               //If facets are selected, splitting edges will add facets that won't be selected, and it will mess up the rest.
@@ -606,7 +606,7 @@ public Q_SLOTS:
                ecm,
                get(CGAL::vertex_point, pmesh),
                CGAL::Constant_property_map<face_descriptor, std::size_t>(1),
-               CGAL::Uniform_sizing_field<FaceGraph>(target_length, pmesh)))
+               CGAL::Polygon_mesh_processing::Uniform_sizing_field<FaceGraph>(4. / 3. * target_length, pmesh)))
           {
             QApplication::restoreOverrideCursor();
             QMessageBox::warning(mw, tr("Error"),

From a94052388247059d6c6d5ab2f76d1663a43a1d71 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 15 May 2023 15:52:35 +0100
Subject: [PATCH 0278/1398] Mesh_3: Move doxygen into header file

---
 .../Polyhedral_mesh_domain_with_features_3.h  | 105 ------------------
 Mesh_3/doc/Mesh_3/Doxyfile.in                 |   1 +
 .../Polyhedral_mesh_domain_with_features_3.h  | 104 ++++++++++++++---
 3 files changed, 92 insertions(+), 118 deletions(-)
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h

diff --git a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h
deleted file mode 100644
index 8ee1140044cd..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ /dev/null
@@ -1,105 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-The class `Polyhedral_mesh_domain_with_features_3` implements a domain whose
-boundary is a simplicial polyhedral surface.
-This surface must be free of intersection.
-It can either be closed,
-included inside another polyhedral surface which is closed and free of intersection,
-or open. In the latter case, the meshing process will only take care of the quality
-of the 1D (features and boundaries) and 2D (surfaces) components of the mesh.
-
-It is a model of the concept `MeshDomainWithFeatures_3`. It also
-provides a member function to automatically detect sharp features and boundaries from
-the input polyhedral surface(s).
-
-\tparam IGT stands for a geometric traits class providing the types
-and functors required to implement the intersection tests and intersection computations
-for polyhedral boundary surfaces. This parameter has to be
-instantiated with a model of the concept `IntersectionGeometricTraits_3`.
-
-\cgalModels `MeshDomainWithFeatures_3`
-
-\sa `CGAL::Mesh_domain_with_polyline_features_3<MD>`
-\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
-\sa `CGAL::Mesh_polyhedron_3<IGT>`
-*/
-template< typename IGT >
-class Polyhedral_mesh_domain_with_features_3
-  : public CGAL::Mesh_domain_with_polyline_features_3<
-  CGAL::Polyhedral_mesh_domain_3< CGAL::Mesh_polyhedron_3<IGT>::type, IGT> >
- {
-public:
-
-/// \name Types
-/// @{
-
-/*!
-Numerical type.
-*/
-typedef unspecified_type FT;
-
-/// @}
-
-/// \name Creation
-/// @{
-
-/*!
-Constructs a `Polyhedral_mesh_domain_with_features_3` from a polyhedral surface of type `Polyhedron`.
-The only requirement on type `Polyhedron` is that `CGAL::Mesh_polyhedron_3<IGT>::%type` should
-be constructible from `Polyhedron`.
-No feature detection is done at this level. Note that a copy of `bounding_polyhedron` will be done.
-The polyhedron `bounding_polyhedron` has to be closed and free of intersections.
-Its interior of `bounding_polyhedron` will be meshed.
-*/
-template <typename Polyhedron>
-Polyhedral_mesh_domain_with_features_3(const Polyhedron& bounding_polyhedron);
-
-
-/*!
-Constructs a `Polyhedral_mesh_domain_with_features_3` from a polyhedral surface, and a bounding polyhedral surface.
-`CGAL::Mesh_polyhedron_3<IGT>::%type` should be constructible from `Polyhedron`.
-The first polyhedron should be entirely included inside `bounding_polyhedron`, which has to be closed
-and free of intersections.
-Using this constructor allows to mesh a polyhedral surface which is not closed, or has holes.
-The inside of `bounding_polyhedron` will be meshed.
-*/
-template <typename Polyhedron>
-Polyhedral_mesh_domain_with_features_3(const Polyhedron& polyhedron,
-                                       const Polyhedron& bounding_polyhedron);
-
-/*!
-\deprecated Constructs a `Polyhedral_mesh_domain_with_features_3` from an off file. No feature
-detection is done at this level. Users must read the file into a `Polyhedron_3` and call the
-constructor above.
-*/
-Polyhedral_mesh_domain_with_features_3(const std::string& filename);
-
-/// @}
-
-/// \name Operations
-/// @{
-
-/*!
-Detects sharp features and boundaries of the internal bounding polyhedron (and the potential internal polyhedron)
-and inserts them as features of the domain. `angle_bound` gives the maximum
-angle (in degrees) between the two normal vectors of adjacent triangles.
-For an edge of the polyhedron, if the angle between the two normal vectors of its
-incident facets is bigger than the given bound, then the edge is considered as
-a feature edge.
-*/
-void detect_features(FT angle_bound=60);
-
-
-/*!
-Detects border edges of the bounding polyhedron and inserts them as features of the domain.
-This function should be called alone only, and not before or after `detect_features()`.
-*/
-   void detect_borders();
-
-/// @}
-
-}; /* end Polyhedral_mesh_domain_with_features_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/Doxyfile.in b/Mesh_3/doc/Mesh_3/Doxyfile.in
index d3608c7b5a0e..7e8105428e3a 100644
--- a/Mesh_3/doc/Mesh_3/Doxyfile.in
+++ b/Mesh_3/doc/Mesh_3/Doxyfile.in
@@ -4,6 +4,7 @@
 ALIASES += "cgalDescribePolylineType=A polyline is defined as a sequence of points, each pair of contiguous points defines a segment of the polyline. If the first and last points of the polyline are identical, the polyline is closed."
 
 INPUT += \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_mesh_domain_with_features_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_complex_mesh_domain_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_domain_with_polyline_features_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_3/generate_label_weights.h \
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index acaf34553212..bb8eb5df378a 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -57,11 +57,36 @@
 
 namespace CGAL {
 
-/**
- * @class Polyhedral_mesh_domain_with_features_3
- *
- *
- */
+/*!
+\ingroup PkgMesh3Domains
+
+The class `Polyhedral_mesh_domain_with_features_3` implements a domain whose
+boundary is a simplicial polyhedral surface.
+This surface must be free of intersection.
+It can either be closed,
+included inside another polyhedral surface which is closed and free of intersection,
+or open. In the latter case, the meshing process will only take care of the quality
+of the 1D (features and boundaries) and 2D (surfaces) components of the mesh.
+
+It is a model of the concept `MeshDomainWithFeatures_3`. It also
+provides a member function to automatically detect sharp features and boundaries from
+the input polyhedral surface(s).
+
+\tparam IGT stands for a geometric traits class providing the types
+and functors required to implement the intersection tests and intersection computations
+for polyhedral boundary surfaces. This parameter has to be
+instantiated with a model of the concept
+`IntersectionGeometricTraits_3`.
+
+
+\tparam Polyhedron stands for the type of the input polyhedral surface(s), model of `FaceListGraph`.
+
+\cgalModels `MeshDomainWithFeatures_3`
+
+\sa `CGAL::Mesh_domain_with_polyline_features_3<MD>`
+\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
+\sa `CGAL::Mesh_polyhedron_3<IGT>`
+*/
 template < class IGT_,
            class Polyhedron_ = typename Mesh_polyhedron_3<IGT_>::type,
            class TriangleAccessor= CGAL::Default,
@@ -114,27 +139,50 @@ class Polyhedral_mesh_domain_with_features_3
 
   typedef typename Base::R         R;
   typedef typename Base::Point_3   Point_3;
+
+
+  /// \name Types
+  /// @{
+
+  /*!
+    Numerical type.
+  */
   typedef typename Base::FT        FT;
 
+  /// @}
+
   typedef CGAL::Tag_true           Has_features;
 
   typedef std::vector<Point_3> Bare_polyline;
   typedef Mesh_3::Polyline_with_context<Surface_patch_index, Curve_index,
                                         Bare_polyline > Polyline_with_context;
-  /// Constructors
-  Polyhedral_mesh_domain_with_features_3(const Polyhedron& p,
+
+/// \name Creation
+/// @{
+
+  /*!
+    Constructs a `Polyhedral_mesh_domain_with_features_3` from a polyhedral surface.
+    No feature detection is done at this level. Note that a copy of `bounding_polyhedron` will be done.
+    The polyhedron `bounding_polyhedron` has to be closed and free of intersections.
+    Its interior of `bounding_polyhedron` will be meshed.
+  */
+  Polyhedral_mesh_domain_with_features_3(const Polyhedron& bounding_polyhedron,
                                          CGAL::Random* p_rng = nullptr)
     : Base(p_rng) , borders_detected_(false)
   {
     stored_polyhedra.resize(1);
-    stored_polyhedra[0] = p;
+    stored_polyhedra[0] = bounding_polyhedron;
     get(face_patch_id_t<Patch_id>(), stored_polyhedra[0]);
     this->add_primitives(stored_polyhedra[0]);
     this->build();
   }
 
 #ifndef CGAL_NO_DEPRECATED_CODE
-
+  /*!
+    \deprecated Constructs a `Polyhedral_mesh_domain_with_features_3` from an off file. No feature
+    detection is done at this level. Users must read the file into a `Polyhedron` and call the
+    constructor above.
+  */
   CGAL_DEPRECATED
   Polyhedral_mesh_domain_with_features_3(const std::string& filename,
                                          CGAL::Random* p_rng = nullptr)
@@ -155,14 +203,21 @@ class Polyhedral_mesh_domain_with_features_3
   }
 #endif // not CGAL_NO_DEPRECATED_CODE
 
-  Polyhedral_mesh_domain_with_features_3(const Polyhedron& p,
-                                         const Polyhedron& bounding_p,
+  /*!
+    Constructs a `Polyhedral_mesh_domain_with_features_3` from a polyhedral surface, and a bounding polyhedral surface.
+    The first polyhedron should be entirely included inside `bounding_polyhedron`, which has to be closed
+    and free of intersections.
+    Using this constructor enables to mesh a polyhedral surface which is not closed, or has holes.
+    The inside of `bounding_polyhedron` will be meshed.
+  */
+  Polyhedral_mesh_domain_with_features_3(const Polyhedron& polyhedron,
+                                         const Polyhedron& bounding_polyhedron,
                                          CGAL::Random* p_rng = nullptr)
     : Base(p_rng) , borders_detected_(false)
   {
     stored_polyhedra.resize(2);
-    stored_polyhedra[0] = p;
-    stored_polyhedra[1] = bounding_p;
+    stored_polyhedra[0] = polyhedron;
+    stored_polyhedra[1] = bounding_polyhedron;
     get(face_patch_id_t<Patch_id>(), stored_polyhedra[0]);
     get(face_patch_id_t<Patch_id>(), stored_polyhedra[1]);
     this->add_primitives(stored_polyhedra[0]);
@@ -219,18 +274,41 @@ class Polyhedral_mesh_domain_with_features_3
   /// Destructor
   ~Polyhedral_mesh_domain_with_features_3() {}
 
+/// @}
+
   /// Detect features
   void initialize_ts(Polyhedron& p);
 
+
   void detect_features(FT angle_in_degree, std::vector<Polyhedron>& p);
+
+/// \name Operations
+/// @{
+
+  /*!
+    Detects sharp features and boundaries of the internal bounding polyhedron (and the potential internal polyhedron)
+    and inserts them as features of the domain. `angle_bound` gives the maximum
+    angle (in degrees) between the two normal vectors of adjacent triangles.
+    For an edge of the polyhedron, if the angle between the two normal vectors of its
+    incident facets is bigger than the given bound, then the edge is considered as
+    a feature edge.
+  */
   void detect_features(FT angle_in_degree = FT(60))
   {
     detect_features(angle_in_degree, stored_polyhedra);
   }
 
   void detect_borders(std::vector<Polyhedron>& p);
+
+  /*!
+    Detects border edges of the bounding polyhedron and inserts them as features of the domain.
+    This function should be called alone only, and not before or after `detect_features()`.
+  */
+
   void detect_borders() { detect_borders(stored_polyhedra); };
 
+  /// @}
+
   template <typename InputIterator>
   void
   add_features(InputIterator first, InputIterator end)

From 7171de7b03167ecede862be52f4744153c5498f3 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 15 May 2023 21:59:09 +0100
Subject: [PATCH 0279/1398] Mesh_3: Move doxygen into header file

---
 Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h | 62 ----------------
 Mesh_3/doc/Mesh_3/CGAL/Mesh_triangulation_3.h | 57 ---------------
 .../Mesh_3/CGAL/Polyhedral_mesh_domain_3.h    | 60 ----------------
 Mesh_3/doc/Mesh_3/Doxyfile.in                 |  2 +
 Mesh_3/include/CGAL/Mesh_cell_criteria_3.h    | 65 ++++++++++++++++-
 Mesh_3/include/CGAL/Mesh_triangulation_3.h    | 56 ++++++++++++++-
 .../include/CGAL/Polyhedral_mesh_domain_3.h   | 72 +++++++++++++++----
 .../Polyhedral_mesh_domain_with_features_3.h  |  2 +-
 8 files changed, 177 insertions(+), 199 deletions(-)
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Mesh_triangulation_3.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h

diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h
deleted file mode 100644
index 873a815075d5..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h
+++ /dev/null
@@ -1,62 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3MeshClasses
-
-The class `Mesh_cell_criteria_3` is a model of `MeshCellCriteria_3`. It provides,
-for the mesh tetrahedra,
-a uniform shape criteria
-and a sizing field which may be a uniform or variable field.
-
-\tparam Tr must be identical to the nested type
-`Triangulation` of the instance used as model of
-`MeshComplex_3InTriangulation_3`.
-
-\cgalModels `MeshCellCriteria_3`
-
-\sa `MeshCriteria_3`
-\sa `CGAL::Mesh_criteria_3<Tr>`
-\sa `CGAL::make_mesh_3()`
-
-*/
-template< typename Tr >
-class Mesh_cell_criteria_3 {
-public:
-
-/// \name Types
-/// @{
-
-/*!
-Numerical type
-*/
-typedef Tr::FT FT;
-
-/// @}
-
-/// \name Creation
-/// @{
-
-/*!
-Returns an object to serve as default criteria for cells. The argument
-`radius_edge_bound` is the upper bound for the radius-edge ratio
-of the tetrahedra. The argument `radius_bound` is a uniform upper bound
-for the circumradii of the tetrahedra in the mesh. See
-section \ref introsecparam for further details.
-Note that if one parameter is set to 0, then its corresponding criteria is ignored.
-*/
-  Mesh_cell_criteria_3(const FT& radius_edge_bound,
-                       const FT& radius_bound);
-
-/*!
-Returns an object to serve as default criteria for facets. The type `SizingField` must
-be a model of the concept `MeshDomainField_3`. The behavior and semantic of the arguments are the same
-as above, except that the radius bound parameter is a functional instead of a constant.
-*/
-  template<class SizingField>
-  Mesh_cell_criteria_3(const FT& radius_edge_bound,
-                       const SizingField& radius_bound);
-
-/// @}
-
-}; /* end Mesh_cell_criteria_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_triangulation_3.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_triangulation_3.h
deleted file mode 100644
index cb8834e90409..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_triangulation_3.h
+++ /dev/null
@@ -1,57 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3MeshClasses
-
-The class `Mesh_triangulation_3` is a class template which provides the triangulation
-type to be used for the 3D triangulation embedding the mesh.
-
-\tparam MD must be a model of `MeshDomain_3`.
-
-\tparam Gt must be a model of `MeshTriangulationTraits_3` or `Default`
-and defaults to `Kernel_traits<MD>::%Kernel`.
-
-\tparam Concurrency_tag enables sequential versus parallel meshing and optimization algorithms.
-                        Possible values are `Sequential_tag` (the default), `Parallel_tag`,
-                        and `Parallel_if_available_tag`.
-
-\tparam Vertex_base must be a model of `MeshVertexBase_3` or `Default`
-and defaults to `Mesh_vertex_base_3<Gt, MD>`.
-
-\tparam Cell_base must be a model of `MeshCellBase_3` or `Default`
-and defaults to `Compact_mesh_cell_base_3<Gt, MD>`.
-
-\warning To improve the robustness of the meshing process, the input traits `Gt`
-         is wrapped with the traits class `Robust_weighted_circumcenter_filtered_traits_3`.
-         The class `Robust_weighted_circumcenter_filtered_traits_3<Gt>` upgrades the functors
-         models of `Kernel::ConstructWeightedCircumcenter_3`, `Kernel::ComputeSquaredRadius_3`,
-         and `Kernel::ComputeSquaredRadiusSmallestOrthogonalSphere_3` that are
-         provided by `Gt` to use exact computations when the geometric configuration
-         is close to degenerate (e.g. almost coplanar points). <br>
-         Users should therefore be aware that the traits class of the triangulation
-         will have type `Robust_weighted_circumcenter_filtered_traits_3<Gt>`.
-
-\sa `make_mesh_3()`
-\sa `Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
-
-*/
-template< typename MD, typename Gt,
-          typename Concurrency_tag,
-          typename Vertex_base,
-          typename Cell_base >
-struct Mesh_triangulation_3 {
-
-/// \name Types
-/// @{
-
-/*!
-The triangulation type to be used for the 3D triangulation embedding the mesh.
-This type is a wrapper around the type `CGAL::Regular_triangulation_3`, whose vertex
-and cell base classes are respectively `Vertex_base` and `Cell_base`.
-*/
-typedef unspecified_type type;
-
-/// @}
-
-}; /* end Mesh_triangulation_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h
deleted file mode 100644
index a084e25bfcf8..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h
+++ /dev/null
@@ -1,60 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-The class `Polyhedral_mesh_domain_3` implements
-a domain defined by a simplicial polyhedral surface.
-
-The input polyhedral surface must be free of intersection.
-It must include (at least) one closed connected component
-that defines the boundary of the domain to be meshed.
-Inside this bounding component,
-the input polyhedral surface may contain
-several other components (closed or not)
-that will be represented in the final mesh.
-This class is a model of the concept `MeshDomain_3`.
-
-\tparam Polyhedron stands for the type of the input polyhedral surface(s),
-model of `FaceListGraph`.
-
-\tparam IGT stands for a geometric traits class
-providing the types and functors required to implement
-the intersection tests and intersection computations
-for polyhedral boundary surfaces. This parameter has to be instantiated
-with a model of the concept `IntersectionGeometricTraits_3`.
-
-\cgalModels `MeshDomain_3`
-
-\sa `IntersectionGeometricTraits_3`
-\sa `CGAL::make_mesh_3()`.
-
-*/
-template< typename Polyhedron, typename IGT, typename TriangleAccessor >
-class Polyhedral_mesh_domain_3
-{
-public:
-
-/// \name Creation
-/// @{
-
-/*!
-Construction from a bounding polyhedral surface which must be closed, and free of intersections.
-The inside of `bounding_polyhedron` will be meshed.
-*/
-Polyhedral_mesh_domain_3(const Polyhedron& bounding_polyhedron);
-
-/*!
-Construction from a polyhedral surface, and a bounding polyhedral surface,.
-The first polyhedron must be entirely included inside `bounding_polyhedron`, which must be closed
-and free of intersections.
-Using this constructor allows to mesh a polyhedral surface which is not closed, or has holes.
-The inside of `bounding_polyhedron` will be meshed.
-*/
-Polyhedral_mesh_domain_3(const Polyhedron& polyhedron,
-                         const Polyhedron& bounding_polyhedron);
-
-/// @}
-
-}; /* end Polyhedral_mesh_domain_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/Doxyfile.in b/Mesh_3/doc/Mesh_3/Doxyfile.in
index 7e8105428e3a..fdbd34718f79 100644
--- a/Mesh_3/doc/Mesh_3/Doxyfile.in
+++ b/Mesh_3/doc/Mesh_3/Doxyfile.in
@@ -4,6 +4,8 @@
 ALIASES += "cgalDescribePolylineType=A polyline is defined as a sequence of points, each pair of contiguous points defines a segment of the polyline. If the first and last points of the polyline are identical, the polyline is closed."
 
 INPUT += \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_triangulation_3.h \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_mesh_domain_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_mesh_domain_with_features_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_complex_mesh_domain_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_domain_with_polyline_features_3.h \
diff --git a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
index 061936937609..27b81bcb2ca0 100644
--- a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
@@ -27,6 +27,28 @@
 
 namespace CGAL {
 
+/*!
+\ingroup PkgMesh3MeshClasses
+
+The class `Mesh_cell_criteria_3` is a model of `MeshCellCriteria_3`. It provides,
+for the mesh tetrahedra,
+a uniform shape criteria
+and a sizing field which may be a uniform or variable field.
+
+\tparam Tr must be identical to the nested type
+`Triangulation` of the instance used as model of
+`MeshComplex_3InTriangulation_3`.
+
+@todo What to do with `Visitor_`?
+
+\cgalModels `MeshCellCriteria_3`
+
+\sa `MeshCriteria_3`
+\sa `CGAL::Mesh_criteria_3<Tr>`
+\sa `CGAL::make_mesh_3()`
+
+*/
+
 template <typename Tr,
           typename Visitor_ = Mesh_3::Cell_criteria_visitor_with_features<Tr> >
 class Mesh_cell_criteria_3
@@ -47,10 +69,34 @@ class Mesh_cell_criteria_3
 
 public:
 
-  /**
+#ifdef DOXYGEN_RUNNING
+/// \name Types
+/// @{
+
+/*!
+Numerical type
+@todo:  In the code this typedef is private
+*/
+typedef Tr::FT FT;
+
+/// @}
+#endif
+
+
+  /// \name Creation
+/// @{
+
+  /*!
    * @brief Constructor
-   * @param radius_edge_bound the radius-edge bound
-   * @param radius_bound the radius bound (tet sizing)
+
+   * @param radius_edge_bound is the upper bound for the radius-edge
+   *                          ratio of the tetrahedra.
+   * @param radius_bound is a uniform upper bound
+                         for the circumradii of the tetrahedra in the
+   *                          mesh.
+   *
+   * See Section \ref introsecparam for further details.
+   * Note that if one parameter is set to 0, then its corresponding criteria is ignored.
    */
   Mesh_cell_criteria_3(const FT& radius_edge_bound,
                        const FT& radius_bound)
@@ -64,6 +110,17 @@ class Mesh_cell_criteria_3
 
   // Nb: SFINAE to avoid wrong matches with built-in numerical types
   // as int.
+
+  /*!
+    Returns an object to serve as default criteria for facets.
+    @tparam SizingField must be a model of the concept
+    `MeshDomainField_3`.
+
+    The behavior and semantic of the arguments are the same
+    as above, except that the radius bound parameter is a functional
+    instead of a constant.
+    @todo hide the `enable_if_t`
+  */
   template <typename Sizing_field>
   Mesh_cell_criteria_3(const FT& radius_edge_bound,
                        const Sizing_field& radius_bound,
@@ -78,6 +135,8 @@ class Mesh_cell_criteria_3
       init_radius_edge(radius_edge_bound);
   }
 
+  /// @}
+
   /// Destructor
   ~Mesh_cell_criteria_3() { }
 
diff --git a/Mesh_3/include/CGAL/Mesh_triangulation_3.h b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
index 8d8012806c7f..72d133a36d54 100644
--- a/Mesh_3/include/CGAL/Mesh_triangulation_3.h
+++ b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
@@ -122,8 +122,42 @@ class Mesh_3_regular_triangulation_3_wrapper
   }
 };
 
-// Struct Mesh_triangulation_3
-//
+
+/*!
+\ingroup PkgMesh3MeshClasses
+
+The class `Mesh_triangulation_3` is a class template which provides the triangulation
+type to be used for the 3D triangulation embedding the mesh.
+
+\tparam MD must be a model of `MeshDomain_3`.
+
+\tparam K_ must be a model of `MeshTriangulationTraits_3` or `Default`
+and defaults to `Kernel_traits<MD>::%Kernel`.
+
+\tparam Concurrency_tag_ enables sequential versus parallel meshing and optimization algorithms.
+                        Possible values are `Sequential_tag` (the default), `Parallel_tag`,
+                        and `Parallel_if_available_tag`.
+
+\tparam Vertex_base__ must be a model of `MeshVertexBase_3` or `Default`
+and defaults to `Mesh_vertex_base_3<K_, MD>`.
+
+\tparam Cell_base_ must be a model of `MeshCellBase_3` or `Default`
+and defaults to `Compact_mesh_cell_base_3<K_, MD>`.
+
+\warning To improve the robustness of the meshing process, the input traits `K_`
+         is wrapped with the traits class `Robust_weighted_circumcenter_filtered_traits_3`.
+         The class `Robust_weighted_circumcenter_filtered_traits_3<K_>` upgrades the functors
+         models of `Kernel::ConstructWeightedCircumcenter_3`, `Kernel::ComputeSquaredRadius_3`,
+         and `Kernel::ComputeSquaredRadiusSmallestOrthogonalSphere_3` that are
+         provided by `K_` to use exact computations when the geometric configuration
+         is close to degenerate (e.g. almost coplanar points). <br>
+         Users should therefore be aware that the traits class of the triangulation
+         will have type `Robust_weighted_circumcenter_filtered_traits_3<K_>`.
+
+\sa `make_mesh_3()`
+\sa `Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
+
+*/
 template<class MD,
          class K_ = Default,
          class Concurrency_tag_ = Sequential_tag,
@@ -156,8 +190,26 @@ struct Mesh_triangulation_3
       Mesh_3_regular_triangulation_3_wrapper<Geom_traits, Tds>;
 
 public:
+
+#ifndef DOXYGEN_RUNNING
   using type = Triangulation;
   using Type = type;
+#else
+
+/// \name Types
+/// @{
+
+/*!
+The triangulation type to be used for the 3D triangulation embedding the mesh.
+This type is a wrapper around the type `CGAL::Regular_triangulation_3`, whose vertex
+and cell base classes are respectively `Vertex_base` and `Cell_base`.
+*/
+typedef unspecified_type type;
+
+#endif
+
+/// @}
+
 };  // end struct Mesh_triangulation_3
 }  // end namespace CGAL
 
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 2d9bf625f57d..f944d1c7739b 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -104,11 +104,39 @@ struct IGT_generator<Gt,CGAL::Tag_false>
 }  // end namespace details
 }  // end namespace Mesh_3
 
-/**
- * @class Polyhedral_mesh_domain_3
- *
- *
- */
+
+/*!
+\ingroup PkgMesh3Domains
+
+The class `Polyhedral_mesh_domain_3` implements
+a domain defined by a simplicial polyhedral surface.
+
+The input polyhedral surface must be free of intersection.
+It must include (at least) one closed connected component
+that defines the boundary of the domain to be meshed.
+Inside this bounding component,
+the input polyhedral surface may contain
+several other components (closed or not)
+that will be represented in the final mesh.
+This class is a model of the concept `MeshDomain_3`.
+
+\tparam Polyhedron stands for the type of the input polyhedral surface(s),
+model of `FaceListGraph`.
+
+\tparam IGT stands for a geometric traits class
+providing the types and functors required to implement
+the intersection tests and intersection computations
+for polyhedral boundary surfaces. This parameter has to be instantiated
+with a model of the concept `IntersectionGeometricTraits_3`.
+
+\cgalModels `MeshDomain_3`
+
+\sa `IntersectionGeometricTraits_3`
+\sa `CGAL::make_mesh_3()`.
+
+*/
+
+
 template<class Polyhedron,/*FaceGraph*/
          class IGT_,
          class = CGAL::Default,
@@ -206,24 +234,36 @@ class Polyhedral_mesh_domain_3
   {
   }
 
-  /**
-   * @brief Constructor. Construction from a polyhedral surface
-   * @param polyhedron the polyhedron describing the polyhedral surface
-   */
-  Polyhedral_mesh_domain_3(const Polyhedron& p,
+
+/// \name Creation
+/// @{
+
+  /*!
+    Construction from a bounding polyhedral surface which must be closed, and free of intersections.
+    The inside of `bounding_polyhedron` will be meshed.
+  */
+
+  Polyhedral_mesh_domain_3(const Polyhedron& bounding_polyhedron,
                            CGAL::Random* p_rng = nullptr)
     : tree_()
     , bounding_tree_(&tree_) // the bounding tree is tree_
     , p_rng_(p_rng)
   {
-    this->add_primitives(p);
-    if(! is_triangle_mesh(p)) {
+    this->add_primitives(bounding_polyhedron);
+    if(! is_triangle_mesh(bounding_polyhedron)) {
       std::cerr << "Your input polyhedron must be triangulated!\n";
       CGAL_error_msg("Your input polyhedron must be triangulated!");
     }
     this->build();
   }
 
+  /*!
+    Construction from a polyhedral surface, and a bounding polyhedral surface.
+    The first polyhedron must be entirely included inside `bounding_polyhedron`, which must be closed
+    and free of intersections.
+    Using this constructor allows to mesh a polyhedral surface which is not closed, or has holes.
+    The inside of `bounding_polyhedron` will be meshed.
+*/
   Polyhedral_mesh_domain_3(const Polyhedron& p,
                            const Polyhedron& bounding_polyhedron,
                            CGAL::Random* p_rng = nullptr)
@@ -241,7 +281,8 @@ class Polyhedral_mesh_domain_3
     this->build();
   }
 
-  /**
+  /*!
+   * @todo was not in doxygen
    * Constructor.
    *
    * Constructor from a sequence of polyhedral surfaces, and a bounding
@@ -274,7 +315,8 @@ class Polyhedral_mesh_domain_3
     this->build();
   }
 
-  /**
+  /*!
+   * @todo was not in doxygen
    * Constructor.
    *
    * Constructor from a sequence of polyhedral surfaces, without bounding
@@ -309,6 +351,8 @@ class Polyhedral_mesh_domain_3
   void set_surface_only() {
     bounding_tree_ = 0;
   }
+/// @}
+
 
   /**
    * Constructs  a set of \ccc{n} points on the surface, and output them to
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index bb8eb5df378a..0d01d4159222 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -222,7 +222,7 @@ class Polyhedral_mesh_domain_with_features_3
     get(face_patch_id_t<Patch_id>(), stored_polyhedra[1]);
     this->add_primitives(stored_polyhedra[0]);
     this->add_primitives(stored_polyhedra[1]);
-    if(CGAL::is_empty(bounding_p)) {
+    if(CGAL::is_empty(bounding_polyhedron)) {
       this->set_surface_only();
     } else {
       this->add_primitives_to_bounding_tree(stored_polyhedra[1]);

From f1780e39ddb2bfa3857e410caf386f29ad071fa6 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 16 May 2023 09:32:15 +0100
Subject: [PATCH 0280/1398] Mesh_3: Move doxygen into header file

---
 .../Mesh_3/CGAL/Gray_image_mesh_domain_3.h    | 80 -------------------
 .../doc/Mesh_3/CGAL/Implicit_mesh_domain_3.h  | 80 -------------------
 .../Implicit_to_labeling_function_wrapper.h   | 66 ---------------
 .../Mesh_3/CGAL/Labeled_image_mesh_domain_3.h | 63 ---------------
 .../CGAL/Mesh_constant_domain_field_3.h       | 73 -----------------
 Mesh_3/doc/Mesh_3/CGAL/Mesh_edge_criteria_3.h | 53 ------------
 .../doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h   | 77 ------------------
 Mesh_3/doc/Mesh_3/CGAL/Mesh_polyhedron_3.h    | 34 --------
 Mesh_3/doc/Mesh_3/CGAL/Triangle_accessor_3.h  | 49 ------------
 Mesh_3/doc/Mesh_3/Doxyfile.in                 | 10 +++
 .../include/CGAL/Gray_image_mesh_domain_3.h   | 73 +++++++++++++++--
 Mesh_3/include/CGAL/Implicit_mesh_domain_3.h  | 72 +++++++++++++++--
 .../Implicit_to_labeling_function_wrapper.h   | 59 +++++++++++++-
 .../CGAL/Labeled_image_mesh_domain_3.h        | 63 +++++++++++++--
 .../CGAL/Mesh_constant_domain_field_3.h       | 70 +++++++++++++++-
 Mesh_3/include/CGAL/Mesh_edge_criteria_3.h    | 53 ++++++++++--
 Mesh_3/include/CGAL/Mesh_facet_criteria_3.h   | 75 ++++++++++++++++-
 Mesh_3/include/CGAL/Mesh_polyhedron_3.h       | 30 ++++++-
 Mesh_3/include/CGAL/Triangle_accessor_3.h     | 35 ++++++++
 19 files changed, 506 insertions(+), 609 deletions(-)
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Gray_image_mesh_domain_3.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Implicit_mesh_domain_3.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Implicit_to_labeling_function_wrapper.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Labeled_image_mesh_domain_3.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Mesh_constant_domain_field_3.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Mesh_edge_criteria_3.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Mesh_polyhedron_3.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Triangle_accessor_3.h

diff --git a/Mesh_3/doc/Mesh_3/CGAL/Gray_image_mesh_domain_3.h b/Mesh_3/doc/Mesh_3/CGAL/Gray_image_mesh_domain_3.h
deleted file mode 100644
index 02428df510e9..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Gray_image_mesh_domain_3.h
+++ /dev/null
@@ -1,80 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-\deprecated The class template `Gray_image_mesh_domain_3` is deprecated
-since CGAL-4.13, in favor of the class template `Labeled_mesh_domain_3` and
-its static function
-`Labeled_mesh_domain_3::create_gray_image_mesh_domain()`.
-
-The class `Gray_image_mesh_domain_3` implements a domain described by a 3D
-gray image. A 3D gray image is a grid of voxels,
-where each voxel is associated with a gray level value.
-This class is a model of the concept `MeshDomain_3`.
-The domain to be discretized is the union of voxels that lie inside a surface
-described by an isolevel value, called \a isovalue. The voxels lying inside the
-domain have gray level values that are larger than the isovalue.
-
-This class includes a member function that provides, by interpolation,
-a gray level value at any query point.
-An intersection between a segment and bounding
-surfaces is detected when both segment endpoints are associated with gray level
-values which are on both sides of the isovalue.
-The intersection is then constructed by bisection.
-The bisection stops when the query segment is shorter than a given error bound
-`e`. This error bound is given by `e=d`\f$ \times\f$`bound` where `d` is the
-length of the diagonal of the bounding box (in world coordinates) and
-`bound` is the argument passed to the constructor of `Labeled_image_mesh_domain_3`.
-
-
-\tparam Image is the type of the input image.
-This parameter must be `CGAL::Image_3`.
-
-\tparam BGT is a geometric traits class which provides
-the basic operations to implement
-intersection tests and intersection computations
-through a bisection method. This parameter must be instantiated
-with a model of the concept `BisectionGeometricTraits_3`.
-
-\tparam Image_word_type is the data type encoded in the `Image`
-input file
-
-
-\cgalModels `MeshDomain_3`
-
-\sa `BisectionGeometricTraits_3`
-\sa `CGAL::make_mesh_3()`.
-
-*/
-template<typename Image,
-         typename BGT,
-         typename Image_word_type>
-class Gray_image_mesh_domain_3
-{
-public:
-
-/// \name Creation
-/// @{
-
-/*!
-Construction from an image.
-The object to be meshed is described by the voxels that have a gray-level
-value higher than the input isovalue.
-@param image the input image
-@param iso_value the isovalue, inside `image`,
-       of the surface describing the boundary of the object to be meshed.
-@param value_outside the value attached to voxels outside of the domain
-       to be meshed. It should be lower than `iso_value`
-@param error_bound is relative to the size of the image.
-*/
-  Gray_image_mesh_domain_3(
-      const Image& image,
-      const Image_word_type iso_value,
-      const Image_word_type value_outside = 0.,
-      const BGT::FT& error_bound = BGT::FT(1e-3));
-
-/// @}
-
-}; /* end Labeled_image_mesh_domain_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Implicit_mesh_domain_3.h b/Mesh_3/doc/Mesh_3/CGAL/Implicit_mesh_domain_3.h
deleted file mode 100644
index e2595b9d6fb9..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Implicit_mesh_domain_3.h
+++ /dev/null
@@ -1,80 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-\deprecated The class template `Implicit_mesh_domain_3` is deprecated
-since CGAL-4.13, in favor of the class template `Labeled_mesh_domain_3` and
-its static function
-`Labeled_mesh_domain_3::create_implicit_mesh_domain()`.
-
-The class `Implicit_mesh_domain_3` implements a domain whose bounding surface is
-described
-implicitly as the zero level set of a function.
-The domain to be discretized is assumed to be the domain where
-the function has negative values.
-This class is a model of the concept `MeshDomain_3`.
-
-
-\tparam Function provides the definition of the function.
-This parameter stands for a model of the concept
-`ImplicitFunction` described in the
-surface mesh generation package.
-The number types `Function::FT`
-and `BGT::FT` are required to match.
-
-\tparam BGT is a geometric traits which provides the basic operations to implement
-intersection tests and computations
-through a bisection method. This parameter must be instantiated
-with a model of the concept `BisectionGeometricTraits_3`.
-
-The constructor of `Implicit_mesh_domain_3`
-takes as argument a bounding sphere which is required
-to circumscribe the surface and to have its center inside the
-domain.
-This domain constructs intersection points
-between
-the surface and segments/rays/lines by
-bisection. It needs an
-`error_bound` such that the bisection process is stopped
-when the query segment is smaller than the error bound.
-The `error_bound` passed as argument to the domain constructor
-is a relative error bound expressed as a ratio to the bounding sphere radius.
-
-\cgalModels `MeshDomain_3`
-
-\sa `BisectionGeometricTraits_3`
-\sa `CGAL::make_mesh_3()`.
-
-*/
-template< typename Function, typename BGT >
-class Implicit_mesh_domain_3
-{
-public:
-
-/// \name Creation
-/// @{
-
-/*!
-`f` is the object of type `Function` that represents the implicit
-surface.
-
-`bounding_sphere` is a bounding sphere of the implicit surface. The
-value of `f` at the sphere center `c` must be
-negative: \f$ f(c)<0\f$.
-
-`error_bound` is the relative error bound
-used to compute intersection points between the implicit surface
-and query segments. The
-bisection is stopped when the length of the intersected
-segment is less than the product of `error_bound` by the
-radius of `bounding_sphere`.
-*/
-  Implicit_mesh_domain_3(Function f,
-                         const BGT::Sphere_3& bounding_sphere,
-                         const BGT::FT& error_bound = FT(1e-3));
-
-/// @}
-
-}; /* end Implicit_mesh_domain_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Implicit_to_labeling_function_wrapper.h b/Mesh_3/doc/Mesh_3/CGAL/Implicit_to_labeling_function_wrapper.h
deleted file mode 100644
index 9a5b38be16d4..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Implicit_to_labeling_function_wrapper.h
+++ /dev/null
@@ -1,66 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-The class `Implicit_multi_domain_to_labeling_function_wrapper` is a helping class to get a function with integer values
-labeling the components of a multi-domain. The multidomain is described through a set of functions {fi(p), i=1, ...n}.
-Each component corresponds to a sign vector [s1, s2, ..., sn] where si is the sign of the function fi(p) at a point p of the component.
-This wrapper class can be passed to `Labeled_mesh_domain_3` as first template parameter.
-
-\par Example
-For example, the multidomain described by the three functions [f1,f2,f3] and the two sign vectors [-,-,+] and [+,-,+]
- includes two components.<br />
-The first one matches the locus of points satisfying f1(p)<0 and f2(p)<0 and f3(p)>0.<br />
-The second one matches the locus of points satisfying f1(p)>0 and f2(p)<0 and f3(p)>0.<br />
-
-\tparam Function provides the definition of the function.
-This parameter stands for a model of the concept ImplicitFunction described in the surface mesh generation package.
-The number types Function::FT and BGT::FT are required to match.
-
-\sa `Labeled_mesh_domain_3`.
-
-*/
-template<class Function>
-class Implicit_multi_domain_to_labeling_function_wrapper
-{
-public:
-  /// \name Types
-  /// @{
-  //!
-  typedef std::vector<Function*>   Function_vector;
-  //!
-  typedef typename Function::Point     Point_3;
-  /// @}
-
-  /// \name Creation
-  /// @{
-  /*!
-   * \brief Construction from a vector of implicit functions.
-   * \param implicit_functions the vector of implicit functions.
-   *
-   * Position vectors are built automatically so that the union of components equals the union of the functions.
-   */
-  Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& implicit_functions);
-
-  /*!
-   * \brief Construction from a vector of implicit functions and a vector of vector of signs.
-   * \param implicit_functions the vector of implicit functions.
-   * \param position_vectors the vector of vector of signs. Each vector of positions describes a component.
-   * \sa `Sign`
-   */
-  Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& implicit_functions,
-                                                      const std::vector<std::vector<Sign> >& position_vectors);
-
-  /*!
-   * \brief Construction from a vector of implicit functions and a vector of strings.
-   * \param implicit_functions the vector of implicit functions.
-   * \param position_strings the vector of strings. The strings contained in this vector must contain '+' or '-' only. Each string (vector of positions) describes a component.
-   */
-  Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& implicit_functions,
-                                                      const std::vector<std::string>& position_strings);
-/// @}
-
-}; /* end Implicit_multi_domain_to_labeling_function_wrapper */
-
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Labeled_image_mesh_domain_3.h b/Mesh_3/doc/Mesh_3/CGAL/Labeled_image_mesh_domain_3.h
deleted file mode 100644
index 9109b74f1824..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Labeled_image_mesh_domain_3.h
+++ /dev/null
@@ -1,63 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-\deprecated The class template `Labeled_image_mesh_domain_3` is deprecated
-since CGAL-4.13, in favor of the class template `Labeled_mesh_domain_3` and
-its static function
-`Labeled_mesh_domain_3::create_labeled_image_mesh_domain()`.
-
-The class `Labeled_image_mesh_domain_3` implements a domain described by a 3D labeled image. A 3D
-labeled image is a grid of voxels, where each voxel is associated with an index
-(a subdomain index) characterizing the subdomain in which the voxel lies. This
-class is a model of the concept `MeshDomain_3`. The domain to be discretized
-is the union of voxels that have an non-default index (different from the
-default constructed value of the type `Image::Type`).
-
-This class includes a member function that provides, by interpolation, the index
-of the subdomain in which any query point lies. An intersection between a segment and bounding
-surfaces is detected when both segment endpoints are associated with different
-values of subdomain indices. The intersection is then constructed by bisection.
-The bisection stops when the query segment is shorter than a given error bound
-`e`. This error bound is given by `e=d`\f$ \times\f$`bound` where `d` is the
-length of the diagonal of the bounding box (in world coordinates) and
-`bound` is the argument passed to the constructor of `Labeled_image_mesh_domain_3`.
-
-
-\tparam Image is the type of the input image.
-This parameter must be `CGAL::Image_3`.
-
-\tparam BGT is a geometric traits class which provides
-the basic operations to implement
-intersection tests and intersection computations
-through a bisection method. This parameter must be instantiated
-with a model of the concept `BisectionGeometricTraits_3`.
-
-\cgalModels `MeshDomain_3`
-
-An executable that uses `Labeled_image_mesh_domain_3` must be linked with
-the <I>CGAL_ImageIO</I> library.
-
-\sa `BisectionGeometricTraits_3`
-\sa `CGAL::make_mesh_3()`.
-
-*/
-template< typename Image, typename BGT >
-class Labeled_image_mesh_domain_3 {
-public:
-
-/// \name Creation
-/// @{
-
-/*!
-Construction from an image.
-The parameter `error_bound` is relative to the size of the image.
-*/
-  Labeled_Image_mesh_domain_3(const Image& image,
-                              const BGT::FT& error_bound = FT(1e-3));
-
-/// @}
-
-}; /* end Labeled_image_mesh_domain_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_constant_domain_field_3.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_constant_domain_field_3.h
deleted file mode 100644
index b660a43e23bf..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_constant_domain_field_3.h
+++ /dev/null
@@ -1,73 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-The class `Mesh_constant_domain_field_3` is a model of concept `MeshDomainField_3`. It provides
-a constant field accessible using queries on 3D-points.
-
-The class `Mesh_constant_domain_field_3` can also be customized through `set_size()` operations to become
-a piecewise constant field, i.e.\ a sizing field with a constant size on each subpart
-of the domain.
-
-\tparam Gt is the geometric traits class. It must match the type `Triangulation::Geom_traits`,
-where `Triangulation` is the nested type of the model of `MeshComplex_3InTriangulation_3` used
-in the meshing process.
-
-\tparam Index is the type of index of the vertices of the triangulation.
-It must match the type `%Index` of the model of `MeshDomain_3` used in the meshing process.
-
-\cgalModels `MeshDomainField_3`
-
-\sa `MeshDomainField_3`
-
-*/
-template< typename Gt, typename Index >
-class Mesh_constant_domain_field_3 {
-public:
-
-/// \name Types
-/// @{
-
-/*!
-Numerical type.
-*/
-typedef Gt::FT FT;
-
-/*!
-Point type.
-*/
-typedef Gt::Point_3 Point_3;
-
-/*!
-Type of index of the vertices of the triangulation.
-*/
-typedef Index Index;
-
-/// @}
-
-/// \name Creation
-/// @{
-
-/*!
-
-Builds a constant domain field with size `size`.
-*/
-Mesh_constant_domain_field_3(FT size);
-
-/// @}
-
-/// \name Operations
-/// @{
-
-/*!
-
-Sets the size such as `operator()` will return size `size`
-at any query point of dimension `dimension` and index `index`.
-*/
-void set_size(FT size, int dimension, const Index& index);
-
-/// @}
-
-}; /* end Mesh_constant_domain_field_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_edge_criteria_3.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_edge_criteria_3.h
deleted file mode 100644
index 3acbda1bd27f..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_edge_criteria_3.h
+++ /dev/null
@@ -1,53 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3MeshClasses
-
-The function object class `Mesh_edge_criteria_3` is a model of `MeshEdgeCriteria_3`. It
-provides a bound for the size criterion.
-
-\cgalModels `MeshEdgeCriteria_3`
-
-\sa `MeshCriteria_3`
-\sa `CGAL::Mesh_criteria_3<Tr>`
-\sa `MeshDomainField_3`
-
-*/
-template< typename Tr >
-class Mesh_edge_criteria_3 {
-public:
-
-/// \name Types
-/// @{
-
-/*!
-Numerical type.
-*/
-typedef Tr::Geom_traits::FT FT;
-
-/// @}
-
-/// \name Creation
-/// @{
-
-/*!
-Returns an object to serve as criteria for edges.
-The argument `length_bound` is an upper bound
-for the length of the edges which are used to discretize the curves.
-Note that if one parameter is set to 0, then its corresponding criteria is ignored.
-*/
-Mesh_edge_criteria_3(const FT& length_bound);
-
-/*!
-Returns an object to serve as criteria for edges. The type `SizingField`
-must be a model of concept `MeshDomainField_3`. The behavior and semantic of the argument are the same
-as above, except that the length
-parameter is a functional instead of a constant.
-*/
-template <class SizingField>
-Mesh_edge_criteria_3(const SizingField& length_bound);
-
-/// @}
-
-}; /* end Mesh_edge_criteria_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h
deleted file mode 100644
index ab5b440dc6f0..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h
+++ /dev/null
@@ -1,77 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3MeshClasses
-
-The class `Mesh_facet_criteria_3` is a model of `MeshFacetCriteria_3`.
-It provides a uniform bound for the shape criterion,
-a uniform or variable sizing field
-for the size criterion and/or
-a uniform or variable distance field
-for the approximation error criterion.
-
-\tparam Tr must be identical to the nested type
-`Triangulation` of the instance used as model of
-`MeshComplex_3InTriangulation_3`.
-
-\cgalModels `MeshFacetCriteria_3`
-
-\sa `CGAL::Mesh_facet_topology`
-\sa `MeshCriteria_3`
-\sa `MeshFacetCriteria_3`
-\sa `CGAL::Mesh_criteria_3<Tr>`
-\sa `MeshDomainField_3`
-\sa `CGAL::make_mesh_3()`
-
-*/
-template< typename Tr >
-class Mesh_facet_criteria_3 {
-public:
-
-/// \name Types
-/// @{
-
-/*!
-Numerical type
-*/
-typedef Tr::Geom_traits::FT FT;
-
-/// @}
-
-/// \name Creation
-/// @{
-
-/*!
-Returns an object to serve as criteria for facets.
-\param angle_bound is the lower bound for the angle in degrees of the
-surface mesh facets.
-\param radius_bound is a uniform upper bound
-for the radius of the surface Delaunay balls.
-\param distance_bound is an upper bound for the center-center distances
-of the surface mesh facets.
-\param topology is the set of topological constraints
-which have to be verified by each surface facet. See
-section \ref Mesh_3DelaunayRefinement for further details.
-Note that if one parameter is set to 0, then its corresponding criteria is ignored.
-*/
-  Mesh_facet_criteria_3(const FT& angle_bound,
-                        const FT& radius_bound,
-                        const FT& distance_bound,
-                        Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE);
-
-/*!
-Returns an object to serve as criteria for facets. The types `SizingField` and
-`DistanceField` must
-be models of the concept `MeshDomainField_3`. The behavior and semantic of the arguments are the same
-as above, except that the radius and distance bound parameters are functionals instead of constants.
-*/
-  template <class SizingField, class DistanceField>
-  Mesh_facet_criteria_3(const FT& angle_bound,
-                        const SizingField& radius_bound,
-                        const DistanceField& distance_bound,
-                        Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE);
-
-/// @}
-
-}; /* end Mesh_facet_criteria_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_polyhedron_3.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_polyhedron_3.h
deleted file mode 100644
index 4ec7e8481fa9..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_polyhedron_3.h
+++ /dev/null
@@ -1,34 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-The class `Mesh_polyhedron_3` provides a customized `Polyhedron_3` type. This type uses
-as `PolyhedronItems_3` a customized type which adds data to the Vertex, Face and
-Halfedge class. Those data are required to use our sharp features
-detection algorithm.
-
-\tparam IGT stands for the geometric traits associated
-to the meshing process. It should be a model of the two concepts
-`PolyhedronTraits_3` and `IntersectionGeometricTraits_3`.
-
-\sa `CGAL::Polyhedron_3<Gt>`
-\sa `CGAL::Polyhedral_mesh_domain_with_features_3<IGT>`
-
-*/
-template< typename IGT >
-struct Mesh_polyhedron_3 {
-
-/// \name Types
-/// @{
-
-/*!
-`CGAL::Polyhedron_3<IGT>` type with customized `PolyhedronItems_3`
-designed to handle sharp feature detection.
-*/
-typedef unspecified_type type;
-
-/// @}
-
-}; /* end Mesh_polyhedron_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Triangle_accessor_3.h b/Mesh_3/doc/Mesh_3/CGAL/Triangle_accessor_3.h
deleted file mode 100644
index e72ee14e2865..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Triangle_accessor_3.h
+++ /dev/null
@@ -1,49 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-The class `Triangle_accessor_3` is a model for the concept `TriangleAccessor_3`. It is
-designed to serve as accessor for objects of type `Polyhedron_3<K>`.
-
-\attention Actually, the class `Triangle_accessor_3` is a partial specialization of the class
-template `template<typename Polyhedron, typename K>
-Triangle_accessor_3<Polyhedron, K>`. One may give another partial
-specialization of this class to handle one's own polyhedron data structure.
-
-
-\tparam K is the geometric traits class.
-
-\cgalModels `TriangleAccessor_3`
-
-\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
-
-*/
-template< CGAL::Polyhedron<typename K>, typename K >
-class Triangle_accessor_3 {
-public:
-
-/// \name Types
-/// @{
-
-/*!
-Triangle iterator.
-*/
-typedef Polyhedron_3<K>::Facet_const_iterator
-Triangle_iterator;
-
-/*!
-Triangle
-handle.
-*/
-typedef Polyhedron_3<K>::Facet_const_handle Triangle_handle;
-
-/*!
-Triangle type.
-*/
-typedef K::Triangle_3 Triangle_3;
-
-/// @}
-
-}; /* end Triangle_accessor_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/Doxyfile.in b/Mesh_3/doc/Mesh_3/Doxyfile.in
index fdbd34718f79..7d0a3aa1ccf8 100644
--- a/Mesh_3/doc/Mesh_3/Doxyfile.in
+++ b/Mesh_3/doc/Mesh_3/Doxyfile.in
@@ -5,9 +5,14 @@ ALIASES += "cgalDescribePolylineType=A polyline is defined as a sequence of poin
 
 INPUT += \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_triangulation_3.h \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_polyhedron_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_mesh_domain_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_mesh_domain_with_features_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_complex_mesh_domain_3.h \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Gray_image_mesh_domain_3.h \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Labeled_image_mesh_domain_3.h \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Implicit_mesh_domain_3.h \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Implicit_to_labeling_function_wrapper.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_domain_with_polyline_features_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_3/generate_label_weights.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/exude_mesh_3.h \
@@ -17,7 +22,12 @@ INPUT += \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/refine_mesh_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/make_mesh_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Labeled_mesh_domain_3.h \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Triangle_accessor_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_criteria_3.h \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_constant_domain_field_3.h \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_cell_criteria_3.h \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_facet_criteria_3.h \
+      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_edge_criteria_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_facet_topology.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_vertex_base_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_cell_base_3.h \
diff --git a/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h b/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
index 99bc1e6b3136..65cb1690f93b 100644
--- a/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
@@ -26,11 +26,55 @@
 
 namespace CGAL {
 
-/**
- * @class Gray_image_mesh_domain_3
- *
- *
- */
+
+/*!
+\ingroup PkgMesh3Domains
+
+\deprecated The class template `Gray_image_mesh_domain_3` is deprecated
+since CGAL-4.13, in favor of the class template `Labeled_mesh_domain_3` and
+its static function
+`Labeled_mesh_domain_3::create_gray_image_mesh_domain()`.
+
+The class `Gray_image_mesh_domain_3` implements a domain described by a 3D
+gray image. A 3D gray image is a grid of voxels,
+where each voxel is associated with a gray level value.
+This class is a model of the concept `MeshDomain_3`.
+The domain to be discretized is the union of voxels that lie inside a surface
+described by an isolevel value, called \a isovalue. The voxels lying inside the
+domain have gray level values that are larger than the isovalue.
+
+This class includes a member function that provides, by interpolation,
+a gray level value at any query point.
+An intersection between a segment and bounding
+surfaces is detected when both segment endpoints are associated with gray level
+values which are on both sides of the isovalue.
+The intersection is then constructed by bisection.
+The bisection stops when the query segment is shorter than a given error bound
+`e`. This error bound is given by `e=d`\f$ \times\f$`bound` where `d` is the
+length of the diagonal of the bounding box (in world coordinates) and
+`bound` is the argument passed to the constructor of `Labeled_image_mesh_domain_3`.
+
+
+\tparam Image is the type of the input image.
+This parameter must be `CGAL::Image_3`.
+
+\tparam BGT is a geometric traits class which provides
+the basic operations to implement
+intersection tests and intersection computations
+through a bisection method. This parameter must be instantiated
+with a model of the concept `BisectionGeometricTraits_3`.
+
+\tparam Image_word_type is the data type encoded in the `Image`
+input file
+
+
+\cgalModels `MeshDomain_3`
+
+\sa `BisectionGeometricTraits_3`
+\sa `CGAL::make_mesh_3()`.
+
+*/
+
 template<class Image,
          class BGT,
          typename Image_word_type_ = float,
@@ -58,7 +102,22 @@ Gray_image_mesh_domain_3
   typedef BGT Geom_traits;
   typedef CGAL::Bbox_3 Bbox_3;
 
-  /// Constructor
+  /// \name Creation
+  /// @{
+
+  /*!
+    Construction from an image.
+    The object to be meshed is described by the voxels that have a gray-level
+    value higher than the input isovalue.
+    @param image the input image
+    @param iso_value the isovalue, inside `image`,
+    of the surface describing the boundary of the object to be meshed.
+    @param value_outside the value attached to voxels outside of the domain
+    to be meshed. It should be lower than `iso_value`
+    @param error_bound is relative to the size of the image.
+
+    @todo deal with p_rng
+  */
   Gray_image_mesh_domain_3(const Image& image,
                            const Image_word_type iso_value,
                            const Image_word_type value_outside = 0.,
@@ -74,6 +133,8 @@ Gray_image_mesh_domain_3
     CGAL_assertion(Transform(iso_value)(value_outside) == 0);
   }
 
+  /// @}
+
   Gray_image_mesh_domain_3(const Image& image,
                            const Transform& transform,
                            const Image_word_type value_outside = 0.,
diff --git a/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h b/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
index 62c9eb47b5ce..67b8ac251e1d 100644
--- a/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
@@ -30,12 +30,51 @@
 namespace CGAL {
 
 
-/**
- * @class Implicit_mesh_domain_3
- *
- * Implements mesh_traits for a domain defined as the negative values of
- * an implicit function.
- */
+/*!
+\ingroup PkgMesh3Domains
+
+\deprecated The class template `Implicit_mesh_domain_3` is deprecated
+since CGAL-4.13, in favor of the class template `Labeled_mesh_domain_3` and
+its static function
+`Labeled_mesh_domain_3::create_implicit_mesh_domain()`.
+
+The class `Implicit_mesh_domain_3` implements a domain whose bounding surface is
+described
+implicitly as the zero level set of a function.
+The domain to be discretized is assumed to be the domain where
+the function has negative values.
+This class is a model of the concept `MeshDomain_3`.
+
+
+\tparam Function_ provides the definition of the function.
+This parameter stands for a model of the concept
+`ImplicitFunction` described in the
+surface mesh generation package.
+The number types `Function::FT`
+and `BGT::FT` are required to match.
+
+\tparam BGT is a geometric traits which provides the basic operations to implement
+intersection tests and computations
+through a bisection method. This parameter must be instantiated
+with a model of the concept `BisectionGeometricTraits_3`.
+
+The constructor of `Implicit_mesh_domain_3`
+takes as argument a bounding sphere which is required
+to circumscribe the surface and to have its center inside the
+domain.
+This domain constructs intersection points between
+the surface and segments/rays/lines by bisection. It needs an
+`error_bound` such that the bisection process is stopped
+when the query segment is smaller than the error bound.
+The `error_bound` passed as argument to the domain constructor
+is a relative error bound expressed as a ratio to the bounding sphere radius.
+
+\cgalModels `MeshDomain_3`
+
+\sa `BisectionGeometricTraits_3`
+\sa `CGAL::make_mesh_3()`.
+
+*/
 template<class Function_,
   class BGT,
   class Wrapper = Implicit_to_labeling_function_wrapper<Function_,BGT> >
@@ -62,6 +101,25 @@ Implicit_mesh_domain_3
    * @param bounding_sphere a bounding sphere of the domain
    * @param error_bound the error bound relative to the sphere radius
    */
+  /// \name Creation
+  /// @{
+
+  /*!
+    @param f is the object of type `Function_` that represents the implicit
+    surface.
+
+    @param bounding_sphere is a bounding sphere of the implicit surface. The
+    value of `f` at the sphere center `c` must be
+    negative: \f$ f(c)<0\f$.
+
+    @param error_bound is the relative error bound
+    used to compute intersection points between the implicit surface
+    and query segments. The
+    bisection is stopped when the length of the intersected
+    segment is less than the product of `error_bound` by the
+    radius of `bounding_sphere`.
+    @todo Fix for `p_rng`
+  */
   Implicit_mesh_domain_3(Function_ f,
                          const Sphere_3& bounding_sphere,
                          const FT& error_bound = FT(1e-6),
@@ -69,6 +127,8 @@ Implicit_mesh_domain_3
     : Base(parameters::function = Wrapper(f), parameters::bounding_object = bounding_sphere, parameters::relative_error_bound = error_bound,
            parameters::null_subdomain_index = Null_subdomain_index(), parameters::p_rng = p_rng)  {}
 
+  /// @}
+
   /// Destructor
   virtual ~Implicit_mesh_domain_3() {}
 
diff --git a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
index 59cd91281cc1..48bd6d03cfef 100644
--- a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
+++ b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
@@ -142,6 +142,29 @@ class Implicit_vector_to_labeling_function_wrapper
 
 };  // end class Implicit_to_labeling_function_wrapper
 
+
+  /*!
+\ingroup PkgMesh3Domains
+
+The class `Implicit_multi_domain_to_labeling_function_wrapper` is a helping class to get a function with integer values
+labeling the components of a multi-domain. The multidomain is described through a set of functions {fi(p), i=1, ...n}.
+Each component corresponds to a sign vector [s1, s2, ..., sn] where si is the sign of the function fi(p) at a point p of the component.
+This wrapper class can be passed to `Labeled_mesh_domain_3` as first template parameter.
+
+\par Example
+For example, the multidomain described by the three functions [f1,f2,f3] and the two sign vectors [-,-,+] and [+,-,+]
+ includes two components.<br />
+The first one matches the locus of points satisfying f1(p)<0 and f2(p)<0 and f3(p)>0.<br />
+The second one matches the locus of points satisfying f1(p)>0 and f2(p)<0 and f3(p)>0.<br />
+
+\tparam ImplicitFunction provides the definition of the function.
+This parameter stands for a model of the concept `ImplicitFunction` described in the surface mesh generation package.
+The number types `ImplicitFunction::FT` and `BGT::FT` are required to match.
+
+\sa `Labeled_mesh_domain_3`.
+
+*/
+
 template <class ImplicitFunction>
 class Implicit_multi_domain_to_labeling_function_wrapper
 {
@@ -164,7 +187,18 @@ class Implicit_multi_domain_to_labeling_function_wrapper
   typedef int                     return_type;
   typedef ImplicitFunction        Function;
   typedef typename Implicit_function_traits<ImplicitFunction>::Point   Point_3;
+
+  /// \name Types
+  /// @{
+  //!
   typedef std::vector<Function>   Function_vector;
+#ifdef DOXYGEN_RUNNING
+ //!
+  /// @todo different from code
+  typedef typename Function::Point     Point_3;
+#endif
+  /// @}
+
 
 private:
   std::vector<Function> funcs;
@@ -172,6 +206,17 @@ class Implicit_multi_domain_to_labeling_function_wrapper
   std::vector<Bmask> bmasks;
 
 public:
+
+
+  /// \name Creation
+  /// @{
+
+  /*!
+   * \brief Construction from a vector of implicit functions and a vector of vector of signs.
+   * \param implicit_functions the vector of implicit functions.
+   * \param position_vectors the vector of vector of signs. Each vector of positions describes a component.
+   * \sa `Sign`
+   */
   Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& vf, const std::vector<std::vector<Sign> >& vps)
   : funcs(vf), bmasks(vps.size(), Bmask(funcs.size() * 2, false))
   {
@@ -200,7 +245,12 @@ class Implicit_multi_domain_to_labeling_function_wrapper
     }
     std::sort(bmasks.begin(), bmasks.end());
   }
-
+  /*!
+   * \brief Construction from a vector of implicit functions.
+   * \param implicit_functions the vector of implicit functions.
+   *
+   * Position vectors are built automatically so that the union of components equals the union of the functions.
+   */
   Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& vf)
   : funcs(vf)
   {
@@ -227,6 +277,11 @@ class Implicit_multi_domain_to_labeling_function_wrapper
     std::sort(bmasks.begin(), bmasks.end());
   }
 
+  /*!
+   * \brief Construction from a vector of implicit functions and a vector of strings.
+   * \param implicit_functions the vector of implicit functions.
+   * \param position_strings the vector of strings. The strings contained in this vector must contain '+' or '-' only. Each string (vector of positions) describes a component.
+   */
   Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& vf, const std::vector<std::string>& vps)
   : funcs(vf), bmasks(vps.size(), Bmask(funcs.size() * 2, false))
   {
@@ -256,6 +311,8 @@ class Implicit_multi_domain_to_labeling_function_wrapper
     std::sort(bmasks.begin(), bmasks.end());
   }
 
+  /// @}
+
   return_type operator() (const Point_3& p) const
   {
     Bmask bmask(funcs.size() * 2, false);
diff --git a/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
index d9bd487410a5..34491151faac 100644
--- a/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
@@ -32,11 +32,52 @@
 
 namespace CGAL {
 
-/**
- * @class Labeled_image_mesh_domain_3
- *
- *
- */
+/*!
+\ingroup PkgMesh3Domains
+
+\deprecated The class template `Labeled_image_mesh_domain_3` is deprecated
+since CGAL-4.13, in favor of the class template `Labeled_mesh_domain_3` and
+its static function
+`Labeled_mesh_domain_3::create_labeled_image_mesh_domain()`.
+
+The class `Labeled_image_mesh_domain_3` implements a domain described by a 3D labeled image. A 3D
+labeled image is a grid of voxels, where each voxel is associated with an index
+(a subdomain index) characterizing the subdomain in which the voxel lies. This
+class is a model of the concept `MeshDomain_3`. The domain to be discretized
+is the union of voxels that have an non-default index (different from the
+default constructed value of the type `Image::Type`).
+
+This class includes a member function that provides, by interpolation, the index
+of the subdomain in which any query point lies. An intersection between a segment and bounding
+surfaces is detected when both segment endpoints are associated with different
+values of subdomain indices. The intersection is then constructed by bisection.
+The bisection stops when the query segment is shorter than a given error bound
+`e`. This error bound is given by `e=d`\f$ \times\f$`bound` where `d` is the
+length of the diagonal of the bounding box (in world coordinates) and
+`bound` is the argument passed to the constructor of `Labeled_image_mesh_domain_3`.
+
+
+\tparam Image is the type of the input image.
+This parameter must be `CGAL::Image_3`.
+
+\tparam BGT is a geometric traits class which provides
+the basic operations to implement
+intersection tests and intersection computations
+through a bisection method. This parameter must be instantiated
+with a model of the concept `BisectionGeometricTraits_3`.
+
+\cgalModels `MeshDomain_3`
+
+An executable that uses `Labeled_image_mesh_domain_3` must be linked with
+the <I>CGAL_ImageIO</I> library.
+
+@todo Document or comment the other parameters
+
+\sa `BisectionGeometricTraits_3`
+\sa `CGAL::make_mesh_3()`.
+
+*/
+
 template<class Image,
          class BGT,
          typename Image_word_type_ = unsigned char,
@@ -70,7 +111,15 @@ Labeled_image_mesh_domain_3
   typedef CGAL::Bbox_3 Bbox_3;
   typedef CGAL::Identity<Subdomain_index> Identity;
 
-  /// Constructor
+
+  /// \name Creation
+  /// @{
+
+  /*!
+    Construction from an image.
+    The parameter `error_bound` is relative to the size of the image.
+    @todo Document or comment the other parameters
+  */
   Labeled_image_mesh_domain_3(const Image& image,
                               const FT& error_bound = FT(1e-3),
                               Subdomain_index value_outside = 0,
@@ -83,6 +132,8 @@ Labeled_image_mesh_domain_3
            parameters::p_rng = p_rng)
   {}
 
+  /// @}
+
   Labeled_image_mesh_domain_3(const Image& image,
                               const FT error_bound,
                               CGAL::Random* p_rng)
diff --git a/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h b/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
index 002117b14ae2..2cc8550ce057 100644
--- a/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
+++ b/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
@@ -28,24 +28,73 @@
 
 namespace CGAL {
 
+/*!
+  \ingroup PkgMesh3Domains
+
+  The class `Mesh_constant_domain_field_3` is a model of concept `MeshDomainField_3`. It provides
+  a constant field accessible using queries on 3D-points.
+
+  The class `Mesh_constant_domain_field_3` can also be customized through `set_size()` operations to become
+  a piecewise constant field, i.e.\ a sizing field with a constant size on each subpart
+  of the domain.
+
+  \tparam Gt is the geometric traits class. It must match the type `Triangulation::Geom_traits`,
+  where `Triangulation` is the nested type of the model of `MeshComplex_3InTriangulation_3` used
+  in the meshing process.
+
+  \tparam Index_ is the type of index of the vertices of the triangulation.
+  It must match the type `%Index` of the model of `MeshDomain_3` used in the meshing process.
+
+  \cgalModels `MeshDomainField_3`
+
+  \sa `MeshDomainField_3`
+
+*/
+
 template <typename Gt, typename Index_>
 class Mesh_constant_domain_field_3
 {
 public:
+  /// \name Types
+  /// @{
+
+  /*!
+    Numerical type.
+  */
   typedef typename Gt::FT         FT;
+
+  /*!
+    Point type.
+@todo in the code `eval_if` for `Bare_point_type`
+  */
+#ifdef DOXYGEN_RUNNING
+typedef Gt::Point_3 Point_3;
+#else
     typedef typename boost::mpl::eval_if_c<
       internal::Has_nested_type_Bare_point<Gt>::value,
       typename internal::Bare_point_type<Gt>,
       boost::mpl::identity<typename Gt::Point_3>
     >::type                       Point_3;
+#endif
+  /*!
+    Type of index of the vertices of the triangulation.
+  */
   typedef Index_                  Index;
 
+  /// @}
+
 private:
   // Map to store field values
   typedef std::map<std::pair<int,Index>,FT> Values;
 
 public:
-  /// Constructor
+
+  /// \name Creation
+  /// @{
+
+  /*!
+    Builds a constant domain field with size `size`.
+  */
   Mesh_constant_domain_field_3(const FT& d) : d_(d) {}
 
   /// Returns size
@@ -57,11 +106,24 @@ class Mesh_constant_domain_field_3
     return d_;
   }
 
-  /// Sets size at any point of dimension `dim` and index `index`.
-  void set_size(const FT& size, const int dim, const Index& index)
+  /// @}
+
+  /// \name Operations
+  /// @{
+
+  /*!
+
+    Sets the size such as `operator()` will return size `size`
+    at any query point of dimension `dimension` and index `index`.
+
+    @todo docunment `operator()`?
+  */
+
+  void set_size(const FT& size, const int dimension, const Index& index)
   {
-    values_.insert(std::make_pair(std::make_pair(dim,index),size));
+    values_.insert(std::make_pair(std::make_pair(dimension,index),size));
   }
+  /// @}
 
 private:
   // default value
diff --git a/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h b/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
index d45ff426f9f7..811d7690055f 100644
--- a/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
@@ -85,18 +85,52 @@ namespace internal {
 } // end namespace internal
 } // end namespace Mesh_3
 
+
+  /*!
+    \ingroup PkgMesh3MeshClasses
+
+    The function object class `Mesh_edge_criteria_3` is a model of `MeshEdgeCriteria_3`. It
+    provides a bound for the size criterion.
+
+    \cgalModels `MeshEdgeCriteria_3`
+
+    \sa `MeshCriteria_3`
+    \sa `CGAL::Mesh_criteria_3<Tr>`
+    \sa `MeshDomainField_3`
+
+*/
+
 template < typename Tr >
 class Mesh_edge_criteria_3
 {
   typedef Mesh_edge_criteria_3 Self;
 
 public:
+
+  /// \name Types
+  /// @{
+
+  /*!
+    Numerical type.
+  */
+  typedef typename Tr::Geom_traits::FT FT;
+
+  /// @}
+
   typedef typename Tr::Vertex::Index  Index;
   typedef typename Tr::Geom_traits    Gt;
-  typedef typename Gt::FT             FT;
   typedef typename Tr::Bare_point     Point_3;
 
-  /// Constructors
+  /// \name Creation
+  /// @{
+
+  /*!
+    Returns an object to serve as criteria for edges.
+    The argument `length_bound` is an upper bound
+    for the length of the edges which are used to discretize the curves.
+    Note that if one parameter is set to 0, then its corresponding criteria is ignored.
+  */
+
   Mesh_edge_criteria_3(const FT& value)
     : p_size_(new Mesh_3::internal::Sizing_field_container<
                 Mesh_constant_domain_field_3<Gt,Index> ,
@@ -107,14 +141,21 @@ class Mesh_edge_criteria_3
 
   // Nb: SFINAE to avoid wrong matches with built-in numerical types
   // as int.
-  template < typename Sizing_field >
+
+  /*!
+    Returns an object to serve as criteria for edges. The type `SizingField`
+    must be a model of concept `MeshDomainField_3`. The behavior and semantic of the argument are the same
+    as above, except that the length
+    parameter is a functional instead of a constant.
+  */
+  template < typename SizingField >
   Mesh_edge_criteria_3
   (
-   const Sizing_field& size,
-   std::enable_if_t<Mesh_3::Is_mesh_domain_field_3<Tr, Sizing_field>::value>* = 0
+   const SizingField& size,
+   std::enable_if_t<Mesh_3::Is_mesh_domain_field_3<Tr, SizingField>::value>* = 0
    )
   {
-    p_size_ = new Mesh_3::internal::Sizing_field_container<Sizing_field,
+    p_size_ = new Mesh_3::internal::Sizing_field_container<SizingField,
                                                            FT,
                                                            Point_3,
                                                            Index>(size);
diff --git a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
index 86972063b11d..0e595d7a79b0 100644
--- a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
@@ -27,6 +27,30 @@
 
 namespace CGAL {
 
+/*!
+  \ingroup PkgMesh3MeshClasses
+
+  The class `Mesh_facet_criteria_3` is a model of `MeshFacetCriteria_3`.
+  It provides a uniform bound for the shape criterion,
+  a uniform or variable sizing field
+  for the size criterion and/or
+  a uniform or variable distance field
+  for the approximation error criterion.
+
+  \tparam Tr must be identical to the nested type
+  `Triangulation` of the instance used as model of
+  `MeshComplex_3InTriangulation_3`.
+
+  \cgalModels `MeshFacetCriteria_3`
+
+  \sa `CGAL::Mesh_facet_topology`
+  \sa `MeshCriteria_3`
+  \sa `MeshFacetCriteria_3`
+  \sa `CGAL::Mesh_criteria_3<Tr>`
+  \sa `MeshDomainField_3`
+  \sa `CGAL::make_mesh_3()`
+
+*/
 template<typename Tr,
          typename Visitor_ = Mesh_3::Facet_criterion_visitor_with_features<Tr> >
 class Mesh_facet_criteria_3
@@ -48,9 +72,36 @@ class Mesh_facet_criteria_3
 public:
   typedef CGAL::Tag_true Has_manifold_criterion;
 
-  /**
-   * @brief Constructor
-   */
+#ifdef DOXYGEN_RUNNING
+/// \name Types
+/// @{
+
+/*!
+Numerical type
+@todo:  In the code this typedef is private
+*/
+typedef Tr::FT FT;
+
+/// @}
+#endif
+
+
+  /// \name Creation
+  /// @{
+
+  /*!
+    Returns an object to serve as criteria for facets.
+    \param angle_bound is the lower bound for the angle in degrees of the
+    surface mesh facets.
+    \param radius_bound is a uniform upper bound
+    for the radius of the surface Delaunay balls.
+    \param distance_bound is an upper bound for the center-center distances
+    of the surface mesh facets.
+    \param topology is the set of topological constraints
+    which have to be verified by each surface facet. See
+    section \ref Mesh_3DelaunayRefinement for further details.
+    Note that if one parameter is set to 0, then its corresponding criteria is ignored.
+  */
   template < typename Sizing_field, typename Sizing_field2 >
   Mesh_facet_criteria_3(const FT& angle_bound,
                         const Sizing_field & radius_bound,
@@ -69,6 +120,24 @@ class Mesh_facet_criteria_3
 
     init_topo(topology);
   }
+#ifdef DOXYGEN_RUNNING
+  /*!
+    Returns an object to serve as criteria for facets. The types `SizingField` and
+    `DistanceField` must
+    be models of the concept `MeshDomainField_3`. The behavior and semantic of the arguments are the same
+    as above, except that the radius and distance bound parameters are
+    functionals instead of constants.
+
+    @todo This one is only in the doc
+  */
+  template <class SizingField, class DistanceField>
+  Mesh_facet_criteria_3(const FT& angle_bound,
+                        const SizingField& radius_bound,
+                        const DistanceField& distance_bound,
+                        Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE);
+#endif
+  /// @}
+
 
 /// Destructor
   ~Mesh_facet_criteria_3() { }
diff --git a/Mesh_3/include/CGAL/Mesh_polyhedron_3.h b/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
index 4461e5ec478b..f179ca9233d9 100644
--- a/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
+++ b/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
@@ -209,12 +209,38 @@ class Mesh_polyhedron_items : public CGAL::Polyhedron_items_3 {
 
 } // end namespace Mesh_3
 
+/*!
+\ingroup PkgMesh3Domains
 
-template <typename Gt, typename Patch_id=int>
+The class `Mesh_polyhedron_3` provides a customized `Polyhedron_3` type. This type uses
+as `PolyhedronItems_3` a customized type which adds data to the Vertex, Face and
+Halfedge class. Those data are required to use the detection of sharp features.
+
+\tparam IGT stands for the geometric traits associated
+to the meshing process. It must be a model of the two concepts
+`PolyhedronTraits_3` and `IntersectionGeometricTraits_3`.
+
+\sa `CGAL::Polyhedron_3<Gt>`
+\sa `CGAL::Polyhedral_mesh_domain_with_features_3<IGT>`
+
+*/
+template <typename IGT, typename Patch_id=int>
 struct Mesh_polyhedron_3
 {
-  typedef Polyhedron_3<Gt, Mesh_3::Mesh_polyhedron_items<Patch_id> > type;
+#ifdef DOXYGEN_RUNNING
+  /// \name Types
+  /// @{
+
+  /*!
+    `CGAL::Polyhedron_3<IGT>` type with customized `PolyhedronItems_3`
+  */
+  typedef unspecified_type type;
+
+  /// @}
+#else
+  typedef Polyhedron_3<IGT, Mesh_3::Mesh_polyhedron_items<Patch_id> > type;
   typedef type Type;
+#endif
 };
 } // end namespace CGAL
 
diff --git a/Mesh_3/include/CGAL/Triangle_accessor_3.h b/Mesh_3/include/CGAL/Triangle_accessor_3.h
index 03e8313e6875..cba5e955c7dc 100644
--- a/Mesh_3/include/CGAL/Triangle_accessor_3.h
+++ b/Mesh_3/include/CGAL/Triangle_accessor_3.h
@@ -34,6 +34,26 @@ class Triangle_accessor_3 {
 };
 
 
+/*!
+\ingroup PkgMesh3Domains
+
+The class `Triangle_accessor_3` is a model for the concept `TriangleAccessor_3`. It is
+designed to serve as accessor for objects of type `Polyhedron_3<K>`.
+
+\attention Actually, the class `Triangle_accessor_3` is a partial specialization of the class
+template `template<typename Polyhedron, typename K>
+Triangle_accessor_3<Polyhedron, K>`. One may give another partial
+specialization of this class to handle one's own polyhedron data structure.
+
+@todo Document the other partial specializations
+
+\tparam K is the geometric traits class.
+
+\cgalModels `TriangleAccessor_3`
+
+\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
+
+*/
 template < class K,class Items,
            template < class T, class I, class A>
            class T_HDS,
@@ -42,10 +62,25 @@ class Triangle_accessor_3<Polyhedron_3<K,Items,T_HDS,Alloc>, K >
 {
   typedef Polyhedron_3<K,Items,T_HDS,Alloc> Polyhedron;
 public:
+  /// \name Types
+  /// @{
+  /*!
+    Triangle type.
+  */
   typedef typename K::Triangle_3                    Triangle_3;
+
+  /*!
+    Triangle iterator.
+  */
   typedef typename Polyhedron::Facet_const_iterator Triangle_iterator;
+
+  /*!
+    Triangle handle.
+  */
   typedef typename Polyhedron::Facet_const_handle   Triangle_handle;
 
+  /// @}
+
   Triangle_accessor_3() { }
 
   Triangle_iterator triangles_begin(const Polyhedron& p) const

From c97ce3ee5574c35b2df07296c96c39f473b5f40e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 16 May 2023 10:30:03 +0100
Subject: [PATCH 0281/1398] Remove doc files

---
 Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h | 69 ----------------
 .../doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h   | 82 -------------------
 2 files changed, 151 deletions(-)
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h

diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h
deleted file mode 100644
index bdba19131c8f..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h
+++ /dev/null
@@ -1,69 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3MeshClasses
-
-The class `Mesh_cell_criteria_3` is a model of `MeshCellCriteria_3`. It provides,
-for the mesh tetrahedra,
-a uniform shape criteria
-and a sizing field which may be a uniform or variable field.
-
-\tparam Tr must be identical to the nested type
-`Triangulation` of the instance used as model of
-`MeshComplex_3InTriangulation_3`.
-
-\cgalModels `MeshCellCriteria_3`
-
-\sa `MeshCriteria_3`
-\sa `CGAL::Mesh_criteria_3<Tr>`
-\sa `CGAL::make_mesh_3()`
-
-*/
-template< typename Tr >
-class Mesh_cell_criteria_3 {
-public:
-
-/// \name Types
-/// @{
-
-/*!
-Numerical type
-*/
-typedef Tr::FT FT;
-
-/// @}
-
-/// \name Creation
-/// @{
-
-/*!
-* Returns an object to serve as default criteria for cells.
-* @param radius_edge_bound is the upper bound for the radius-edge ratio
-*     of the tetrahedra.
-* @param radius_bound is a uniform upper bound
-*     for the circumradii of the tetrahedra in the mesh. See
-*     section \ref introsecparam for further details.
-* @param min_radius_bound is a uniform lower bound for the
-*     circumradii of the tetrahedra in the mesh.
-*     Only cells with a circumradius larger than that
-*     bound will be refined.
-* Note that if one parameter is set to 0, then its corresponding criteria is ignored.
-*/
-  Mesh_cell_criteria_3(const FT& radius_edge_bound,
-                       const FT& radius_bound,
-                       const FT& min_radius_bound = 0.);
-
-/*!
-Returns an object to serve as default criteria for facets. The type `SizingField` must
-be a model of the concept `MeshDomainField_3`. The behavior and semantic of the arguments are the same
-as above, except that the radius bound parameter is a functional instead of a constant.
-*/
-  template<class SizingField>
-  Mesh_cell_criteria_3(const FT& radius_edge_bound,
-                       const SizingField& radius_bound,
-                       const FT& min_radius_bound = 0.);
-
-/// @}
-
-}; /* end Mesh_cell_criteria_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h
deleted file mode 100644
index bfbd79dfe399..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h
+++ /dev/null
@@ -1,82 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3MeshClasses
-
-The class `Mesh_facet_criteria_3` is a model of `MeshFacetCriteria_3`.
-It provides a uniform bound for the shape criterion,
-a uniform or variable sizing field
-for the size criterion and/or
-a uniform or variable distance field
-for the approximation error criterion.
-
-\tparam Tr must be identical to the nested type
-`Triangulation` of the instance used as model of
-`MeshComplex_3InTriangulation_3`.
-
-\cgalModels `MeshFacetCriteria_3`
-
-\sa `CGAL::Mesh_facet_topology`
-\sa `MeshCriteria_3`
-\sa `MeshFacetCriteria_3`
-\sa `CGAL::Mesh_criteria_3<Tr>`
-\sa `MeshDomainField_3`
-\sa `CGAL::make_mesh_3()`
-
-*/
-template< typename Tr >
-class Mesh_facet_criteria_3 {
-public:
-
-/// \name Types
-/// @{
-
-/*!
-Numerical type
-*/
-typedef Tr::Geom_traits::FT FT;
-
-/// @}
-
-/// \name Creation
-/// @{
-
-/*!
-Returns an object to serve as criteria for facets.
-\param angle_bound is the lower bound for the angle in degrees of the
-surface mesh facets.
-\param radius_bound is a uniform upper bound
-for the radius of the surface Delaunay balls.
-\param distance_bound is an upper bound for the center-center distances
-of the surface mesh facets.
-\param topology is the set of topological constraints
-which have to be verified by each surface facet. See
-section \ref Mesh_3DelaunayRefinement for further details.
-Note that if one parameter is set to 0, then its corresponding criteria is ignored.
-\param min_radius_bound is a uniform lower bound for the radius of
-the surface Delaunay balls. Only facets with a radius larger than that
-bound will be refined.
-*/
-  Mesh_facet_criteria_3(const FT& angle_bound,
-                        const FT& radius_bound,
-                        const FT& distance_bound,
-                        Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE,
-                        const FT& min_radius_bound = 0.);
-
-/*!
-Returns an object to serve as criteria for facets. The types `SizingField` and
-`DistanceField` must
-be models of the concept `MeshDomainField_3`. The behavior and semantic of the arguments are the same
-as above, except that the radius and distance bound parameters are functionals instead of constants.
-*/
-  template <class SizingField, class DistanceField>
-  Mesh_facet_criteria_3(const FT& angle_bound,
-                        const SizingField& radius_bound,
-                        const DistanceField& distance_bound,
-                        Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE,
-                        const FT& min_radius_bound = 0.);
-
-/// @}
-
-}; /* end Mesh_facet_criteria_3 */
-} /* end namespace CGAL */

From cec7c3dccce46a1cb89bfd34df42bab0339bcbde Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 16 May 2023 11:57:32 +0100
Subject: [PATCH 0282/1398] Fix some warnings

---
 .../Implicit_to_labeling_function_wrapper.h   | 16 ++++++-------
 .../include/CGAL/Polyhedral_mesh_domain_3.h   | 24 +++++++++----------
 2 files changed, 20 insertions(+), 20 deletions(-)

diff --git a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
index 48bd6d03cfef..7ef8933b5a0b 100644
--- a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
+++ b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
@@ -217,13 +217,13 @@ class Implicit_multi_domain_to_labeling_function_wrapper
    * \param position_vectors the vector of vector of signs. Each vector of positions describes a component.
    * \sa `Sign`
    */
-  Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& vf, const std::vector<std::vector<Sign> >& vps)
-  : funcs(vf), bmasks(vps.size(), Bmask(funcs.size() * 2, false))
+  Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& implicit_functions, const std::vector<std::vector<Sign> >& position_vectors)
+  : funcs(implicit_functions), bmasks(position_vectors.size(), Bmask(funcs.size() * 2, false))
   {
     CGAL_assertion(funcs.size() != 0);
 
     std::size_t mask_index = 0;
-    for (std::vector<std::vector<Sign> >::const_iterator mask_iter = vps.begin(), mask_end_iter = vps.end();
+    for (std::vector<std::vector<Sign> >::const_iterator mask_iter = position_vectors.begin(), mask_end_iter = position_vectors.end();
          mask_iter != mask_end_iter;
          ++mask_iter)
     {
@@ -251,8 +251,8 @@ class Implicit_multi_domain_to_labeling_function_wrapper
    *
    * Position vectors are built automatically so that the union of components equals the union of the functions.
    */
-  Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& vf)
-  : funcs(vf)
+  Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& implicit_functions)
+  : funcs(implicit_functions)
   {
     CGAL_assertion(funcs.size() != 0);
 
@@ -282,13 +282,13 @@ class Implicit_multi_domain_to_labeling_function_wrapper
    * \param implicit_functions the vector of implicit functions.
    * \param position_strings the vector of strings. The strings contained in this vector must contain '+' or '-' only. Each string (vector of positions) describes a component.
    */
-  Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& vf, const std::vector<std::string>& vps)
-  : funcs(vf), bmasks(vps.size(), Bmask(funcs.size() * 2, false))
+  Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& implicit_functions, const std::vector<std::string>& position_strings)
+  : funcs(implicit_functions), bmasks(position_strings.size(), Bmask(funcs.size() * 2, false))
   {
     CGAL_assertion(funcs.size() != 0);
 
     std::size_t mask_index = 0;
-    for (std::vector<std::string>::const_iterator mask_iter = vps.begin(), mask_end_iter = vps.end();
+    for (std::vector<std::string>::const_iterator mask_iter = position_strings.begin(), mask_end_iter = position_strings.end();
          mask_iter != mask_end_iter;
          ++mask_iter)
     {
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index f944d1c7739b..230863ee3def 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -355,9 +355,9 @@ class Polyhedral_mesh_domain_3
 
 
   /**
-   * Constructs  a set of \ccc{n} points on the surface, and output them to
-   *  the output iterator \ccc{pts} whose value type is required to be
-   *  \ccc{std::pair<Points_3, Index>}.
+   * Constructs  a set of `n points on the surface, and output them to
+   *  the output iterator `pts` whose value type is required to be
+   *  `std::pair<Points_3, Index>`.
    */
   struct Construct_initial_points
   {
@@ -386,9 +386,9 @@ class Polyhedral_mesh_domain_3
 
 
   /**
-   * Returns true if point~\ccc{p} is in the domain. If \ccc{p} is in the
+   * Returns true if point `p` is in the domain. If `p` is in the
    *  domain, the parameter index is set to the index of the subdomain
-   *  including $p$. It is set to the default value otherwise.
+   *  including `p`. It is set to the default value otherwise.
    */
   struct Is_in_domain
   {
@@ -411,12 +411,12 @@ class Polyhedral_mesh_domain_3
   typedef boost::mpl::vector<Segment_3, Ray_3, Line_3> Allowed_query_types;
 
   /**
-   * Returns true is the element \ccc{type} intersect properly any of the
+   * Returns true is the element `type` intersect properly any of the
    * surface patches describing the either the domain boundary or some
    * subdomain boundary.
-   * \ccc{Type} is either \ccc{Segment_3}, \ccc{Ray_3} or \ccc{Line_3}.
+   * `Type` is either `Segment_3`, `Ray_3` or `Line_3`.
    * Parameter index is set to the index of the intersected surface patch
-   * if \ccc{true} is returned and to the default \ccc{Surface_patch_index}
+   * if `true` is returned and to the default `Surface_patch_index`
    * value otherwise.
    */
   struct Do_intersect_surface
@@ -452,12 +452,12 @@ class Polyhedral_mesh_domain_3
   }
 
   /**
-   * Returns a point in the intersection of the primitive \ccc{type}
+   * Returns a point in the intersection of the primitive `type`
    * with some boundary surface.
-   * \ccc{Type1} is either \ccc{Segment_3}, \ccc{Ray_3} or \ccc{Line_3}.
-   * The integer \ccc{dimension} is set to the dimension of the lowest
+   * `Type1` is either `Segment_3`, `Ray_3` or `Line_3`.
+   * The integer `dimension` is set to the dimension of the lowest
    * dimensional face in the input complex containing the returned point, and
-   * \ccc{index} is set to the index to be stored at a mesh vertex lying
+   * `index` is set to the index to be stored at a mesh vertex lying
    * on this face.
    */
   struct Construct_intersection

From 26369cb81b0e70453dfada9cb91998dc51880519 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 16 May 2023 12:33:14 +0100
Subject: [PATCH 0283/1398] fixes

---
 .../CGAL/Mesh_constant_domain_field_3.h       |  2 +-
 .../include/CGAL/Polyhedral_mesh_domain_3.h   | 33 ++++++++++++-------
 2 files changed, 22 insertions(+), 13 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h b/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
index 20de215efd51..fc5ea3f7538a 100644
--- a/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
+++ b/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
@@ -115,7 +115,7 @@ class Mesh_constant_domain_field_3
   */
   void set_size(const FT& size, const int dim, const Index& index)
   {
-    values_.insert(std::make_pair(std::make_pair(dimension,index),size));
+    values_.insert(std::make_pair(std::make_pair(dim,index),size));
   }
   /// @}
 
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 230863ee3def..f1bf80dab4e1 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -243,8 +243,11 @@ class Polyhedral_mesh_domain_3
     The inside of `bounding_polyhedron` will be meshed.
   */
 
-  Polyhedral_mesh_domain_3(const Polyhedron& bounding_polyhedron,
-                           CGAL::Random* p_rng = nullptr)
+  Polyhedral_mesh_domain_3(const Polyhedron& bounding_polyhedron
+#ifndef DOXYGEN_RUNNING
+                           , CGAL::Random* p_rng = nullptr
+#endif
+                           )
     : tree_()
     , bounding_tree_(&tree_) // the bounding tree is tree_
     , p_rng_(p_rng)
@@ -288,16 +291,19 @@ class Polyhedral_mesh_domain_3
    * Constructor from a sequence of polyhedral surfaces, and a bounding
    * polyhedral surface.
    *
-   * @param InputPolyhedraPtrIterator must an iterator of a sequence of
-   * pointers to polyhedra
+   * @tparam InputPolyhedraPtrIterator must an iterator of a sequence of
+   * pointers to polyhedra  @todo fix what the type is
    *
    * @param bounding_polyhedron reference to the bounding surface
    */
   template <typename InputPolyhedraPtrIterator>
-  Polyhedral_mesh_domain_3(InputPolyhedraPtrIterator begin,
-                           InputPolyhedraPtrIterator end,
-                           const Polyhedron& bounding_polyhedron,
-                           CGAL::Random* p_rng = nullptr)
+  Polyhedral_mesh_domain_3(InputPolyhedraPtrIterator begin
+                           ,InputPolyhedraPtrIterator end
+                           ,const Polyhedron& bounding_polyhedron
+#ifndef DOXYGEN_RUNNING
+                           ,CGAL::Random* p_rng = nullptr
+#endif
+                           )
     : p_rng_(p_rng)
     , delete_rng_(false)
   {
@@ -323,13 +329,16 @@ class Polyhedral_mesh_domain_3
    * surface. The domain will always answer false to "is_in_domain"
    * queries.
    *
-   * @param InputPolyhedraPtrIterator must an iterator of a sequence of
+   * @tparam InputPolyhedraPtrIterator must an iterator of a sequence of
    * pointers to polyhedra
    */
   template <typename InputPolyhedraPtrIterator>
-  Polyhedral_mesh_domain_3(InputPolyhedraPtrIterator begin,
-                           InputPolyhedraPtrIterator end,
-                           CGAL::Random* p_rng = nullptr)
+  Polyhedral_mesh_domain_3(InputPolyhedraPtrIterator begin
+                           , InputPolyhedraPtrIterator end
+#ifndef DOXYGEN_RUNNING
+                           , CGAL::Random* p_rng = nullptr
+#endif
+                           )
     : p_rng_(p_rng)
   {
     if(begin != end) {

From e9583a69d0654d139f0533cd4085c607ebbcbaff Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 16 May 2023 12:38:50 +0100
Subject: [PATCH 0284/1398] fixes

---
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index f1bf80dab4e1..66e7bf8f3891 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -291,9 +291,11 @@ class Polyhedral_mesh_domain_3
    * Constructor from a sequence of polyhedral surfaces, and a bounding
    * polyhedral surface.
    *
-   * @tparam InputPolyhedraPtrIterator must an iterator of a sequence of
-   * pointers to polyhedra  @todo fix what the type is
+   * @tparam InputPolyhedraPtrIterator must be a model of
+   * `ForwardIterator` and value type `Polyhedron*`
    *
+   * @param begin iterator for a sequence of pointers to polyhedra
+   * @param end iterator for a sequence of pointers to polyhedra
    * @param bounding_polyhedron reference to the bounding surface
    */
   template <typename InputPolyhedraPtrIterator>

From 90773e880618c96771b467876526ee1b435b5c47 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 16 May 2023 12:41:17 +0100
Subject: [PATCH 0285/1398] fixes

---
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h | 10 +++++++---
 1 file changed, 7 insertions(+), 3 deletions(-)

diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 66e7bf8f3891..25005e5748b8 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -328,11 +328,15 @@ class Polyhedral_mesh_domain_3
    * Constructor.
    *
    * Constructor from a sequence of polyhedral surfaces, without bounding
-   * surface. The domain will always answer false to "is_in_domain"
+   * surface. The domain will always answer `false` to `is_in_domain()`
    * queries.
    *
-   * @tparam InputPolyhedraPtrIterator must an iterator of a sequence of
-   * pointers to polyhedra
+   * @tparam InputPolyhedraPtrIterator must be a model of
+   * `ForwardIterator` and value type `Polyhedron*`
+   *
+   * @param begin iterator for a sequence of pointers to polyhedra
+   * @param end iterator for a sequence of pointers to polyhedra
+   * @param bounding_polyhedron reference to the bounding surface
    */
   template <typename InputPolyhedraPtrIterator>
   Polyhedral_mesh_domain_3(InputPolyhedraPtrIterator begin

From fdcdd1a9eb0b82e725b53c4edb159f782fd8f49e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 16 May 2023 12:50:07 +0100
Subject: [PATCH 0286/1398] fixes

---
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 25005e5748b8..077dfcd3603f 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -336,7 +336,6 @@ class Polyhedral_mesh_domain_3
    *
    * @param begin iterator for a sequence of pointers to polyhedra
    * @param end iterator for a sequence of pointers to polyhedra
-   * @param bounding_polyhedron reference to the bounding surface
    */
   template <typename InputPolyhedraPtrIterator>
   Polyhedral_mesh_domain_3(InputPolyhedraPtrIterator begin

From b6531a76d19690a318d0e682d0b625bd7c6b32a6 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 16 May 2023 16:22:48 +0100
Subject: [PATCH 0287/1398] fixes

---
 Mesh_3/doc/Mesh_3/examples.txt                 |  3 +++
 Mesh_3/include/CGAL/Mesh_cell_criteria_3.h     | 11 ++++++-----
 Mesh_3/include/CGAL/Mesh_triangulation_3.h     |  4 ++--
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h |  2 +-
 4 files changed, 12 insertions(+), 8 deletions(-)

diff --git a/Mesh_3/doc/Mesh_3/examples.txt b/Mesh_3/doc/Mesh_3/examples.txt
index ce8dbbb1b343..d9c2eb95d718 100644
--- a/Mesh_3/doc/Mesh_3/examples.txt
+++ b/Mesh_3/doc/Mesh_3/examples.txt
@@ -20,9 +20,12 @@
 \example Mesh_3/mesh_optimization_example.cpp
 \example Mesh_3/mesh_optimization_lloyd_example.cpp
 \example Mesh_3/mesh_polyhedral_domain.cpp
+\example Mesh_3/mesh_polyhedral_domain_sm.cpp
 \example Mesh_3/mesh_polyhedral_complex.cpp
+\example Mesh_3/mesh_polyhedral_complex_sm.cpp
 \example Mesh_3/remesh_polyhedral_surface.cpp
 \example Mesh_3/mesh_polyhedral_domain_with_features.cpp
+\example Mesh_3/mesh_polyhedral_domain_with_features_sm.cpp
 \example Mesh_3/mesh_polyhedral_domain_with_features_sizing.cpp
 \example Mesh_3/mesh_polyhedral_domain_with_surface_inside.cpp
 \example Mesh_3/mesh_polyhedral_domain_with_lipschitz_sizing.cpp
diff --git a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
index f782ea9ffeff..7ef85ff8adda 100644
--- a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
@@ -126,15 +126,16 @@ typedef Tr::FT FT;
     The behavior and semantic of the arguments are the same
     as above, except that the radius bound parameter is a functional
     instead of a constant.
-    @todo hide the `enable_if_t`
   */
   template <typename Sizing_field>
-  Mesh_cell_criteria_3(const FT& radius_edge_bound,
-                       const Sizing_field& radius_bound,
-                       const FT& min_radius_bound = 0.,
-                       std::enable_if_t<
+  Mesh_cell_criteria_3(const FT& radius_edge_bound
+                       ,const Sizing_field& radius_bound
+                       ,const FT& min_radius_bound = 0.
+#ifndef DOXYGEN_RUNNING
+                       ,std::enable_if_t<
                          Mesh_3::Is_mesh_domain_field_3<Tr,Sizing_field>::value
                        >* = 0
+#endif
                        )
   {
     if (FT(0) != min_radius_bound)
diff --git a/Mesh_3/include/CGAL/Mesh_triangulation_3.h b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
index 72d133a36d54..560d2983f415 100644
--- a/Mesh_3/include/CGAL/Mesh_triangulation_3.h
+++ b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
@@ -206,9 +206,9 @@ and cell base classes are respectively `Vertex_base` and `Cell_base`.
 */
 typedef unspecified_type type;
 
-#endif
+  /// @}
 
-/// @}
+#endif
 
 };  // end struct Mesh_triangulation_3
 }  // end namespace CGAL
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 077dfcd3603f..f1791c3d847e 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -369,7 +369,7 @@ class Polyhedral_mesh_domain_3
 
 
   /**
-   * Constructs  a set of `n points on the surface, and output them to
+   * Constructs  a set of `n` points on the surface, and output them to
    *  the output iterator `pts` whose value type is required to be
    *  `std::pair<Points_3, Index>`.
    */

From e1ac0e56e025e468cc2155161fe587027f308759 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 17 May 2023 09:21:33 +0200
Subject: [PATCH 0288/1398] add new macro

---
 Documentation/doc/resources/1.8.13/BaseDoxyfile.in | 3 ++-
 Documentation/doc/resources/1.8.14/BaseDoxyfile.in | 3 ++-
 Documentation/doc/resources/1.8.20/BaseDoxyfile.in | 3 ++-
 Documentation/doc/resources/1.8.4/BaseDoxyfile.in  | 3 ++-
 Documentation/doc/resources/1.9.3/BaseDoxyfile.in  | 3 ++-
 5 files changed, 10 insertions(+), 5 deletions(-)

diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index 69351ed254e8..831c8ae9edf6 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -2187,7 +2187,8 @@ PREDEFINED             = DOXYGEN_RUNNING \
                          "CGAL_NP_CLASS_1=NamedParameters1" \
                          "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
                          "CGAL_NP_CLASS_2=NamedParameters2" \
-                         CGAL_DEPRECATED
+                         CGAL_DEPRECATED \
+                         CGAL_MSG_DEPRECATED
 
 # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
 # tag can be used to specify a list of macro names that should be expanded. The
diff --git a/Documentation/doc/resources/1.8.14/BaseDoxyfile.in b/Documentation/doc/resources/1.8.14/BaseDoxyfile.in
index 1a59e5d2d97f..545860df0c40 100644
--- a/Documentation/doc/resources/1.8.14/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.14/BaseDoxyfile.in
@@ -2171,7 +2171,8 @@ PREDEFINED             = DOXYGEN_RUNNING \
                          "CGAL_NP_CLASS_1=NamedParameters1" \
                          "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
                          "CGAL_NP_CLASS_2=NamedParameters2" \
-                         CGAL_DEPRECATED
+                         CGAL_DEPRECATED \
+                         CGAL_DEPRECATED_MSG
 
 # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
 # tag can be used to specify a list of macro names that should be expanded. The
diff --git a/Documentation/doc/resources/1.8.20/BaseDoxyfile.in b/Documentation/doc/resources/1.8.20/BaseDoxyfile.in
index bc0ca527ff2e..b445780d98b7 100644
--- a/Documentation/doc/resources/1.8.20/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.20/BaseDoxyfile.in
@@ -2255,7 +2255,8 @@ PREDEFINED             = DOXYGEN_RUNNING \
                          "CGAL_NP_CLASS_1=NamedParameters1" \
                          "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
                          "CGAL_NP_CLASS_2=NamedParameters2" \
-                         CGAL_DEPRECATED
+                         CGAL_DEPRECATED \
+                         CGAL_DEPRECATED_MSG
 
 # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
 # tag can be used to specify a list of macro names that should be expanded. The
diff --git a/Documentation/doc/resources/1.8.4/BaseDoxyfile.in b/Documentation/doc/resources/1.8.4/BaseDoxyfile.in
index 70267fd649dc..66cefaad4f2d 100644
--- a/Documentation/doc/resources/1.8.4/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.4/BaseDoxyfile.in
@@ -1778,7 +1778,8 @@ PREDEFINED             = DOXYGEN_RUNNING \
                          "CGAL_NP_CLASS_1=NamedParameters1" \
                          "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
                          "CGAL_NP_CLASS_2=NamedParameters2" \
-                         CGAL_DEPRECATED
+                         CGAL_DEPRECATED \
+                         CGAL_DEPRECATED_MSG
 
 # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then
 # this tag can be used to specify a list of macro names that should be expanded.
diff --git a/Documentation/doc/resources/1.9.3/BaseDoxyfile.in b/Documentation/doc/resources/1.9.3/BaseDoxyfile.in
index 21d24dd6ecd2..50fb0eddfe1b 100644
--- a/Documentation/doc/resources/1.9.3/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.3/BaseDoxyfile.in
@@ -2267,7 +2267,8 @@ PREDEFINED             = DOXYGEN_RUNNING \
                          "CGAL_NP_CLASS_1=NamedParameters1" \
                          "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
                          "CGAL_NP_CLASS_2=NamedParameters2" \
-                         CGAL_DEPRECATED
+                         CGAL_DEPRECATED \
+                         CGAL_DEPRECATED_MSG
 
 
 # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this

From a78afb74bfe0295d83aaa311db31ab3fb56e541f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 17 May 2023 09:58:33 +0200
Subject: [PATCH 0289/1398] fix syntax

---
 Documentation/doc/resources/1.8.13/BaseDoxyfile.in | 2 +-
 Documentation/doc/resources/1.8.14/BaseDoxyfile.in | 2 +-
 Documentation/doc/resources/1.8.20/BaseDoxyfile.in | 2 +-
 Documentation/doc/resources/1.8.4/BaseDoxyfile.in  | 2 +-
 Documentation/doc/resources/1.9.3/BaseDoxyfile.in  | 2 +-
 5 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index 831c8ae9edf6..caaa6b37982a 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -2188,7 +2188,7 @@ PREDEFINED             = DOXYGEN_RUNNING \
                          "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
                          "CGAL_NP_CLASS_2=NamedParameters2" \
                          CGAL_DEPRECATED \
-                         CGAL_MSG_DEPRECATED
+                         CGAL_DEPRECATED_MSG(name)=
 
 # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
 # tag can be used to specify a list of macro names that should be expanded. The
diff --git a/Documentation/doc/resources/1.8.14/BaseDoxyfile.in b/Documentation/doc/resources/1.8.14/BaseDoxyfile.in
index 545860df0c40..e8f8336f1121 100644
--- a/Documentation/doc/resources/1.8.14/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.14/BaseDoxyfile.in
@@ -2172,7 +2172,7 @@ PREDEFINED             = DOXYGEN_RUNNING \
                          "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
                          "CGAL_NP_CLASS_2=NamedParameters2" \
                          CGAL_DEPRECATED \
-                         CGAL_DEPRECATED_MSG
+                         CGAL_DEPRECATED_MSG(name)=
 
 # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
 # tag can be used to specify a list of macro names that should be expanded. The
diff --git a/Documentation/doc/resources/1.8.20/BaseDoxyfile.in b/Documentation/doc/resources/1.8.20/BaseDoxyfile.in
index b445780d98b7..822440929e06 100644
--- a/Documentation/doc/resources/1.8.20/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.20/BaseDoxyfile.in
@@ -2256,7 +2256,7 @@ PREDEFINED             = DOXYGEN_RUNNING \
                          "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
                          "CGAL_NP_CLASS_2=NamedParameters2" \
                          CGAL_DEPRECATED \
-                         CGAL_DEPRECATED_MSG
+                         CGAL_DEPRECATED_MSG(name)=
 
 # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
 # tag can be used to specify a list of macro names that should be expanded. The
diff --git a/Documentation/doc/resources/1.8.4/BaseDoxyfile.in b/Documentation/doc/resources/1.8.4/BaseDoxyfile.in
index 66cefaad4f2d..af6e905ef0f4 100644
--- a/Documentation/doc/resources/1.8.4/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.4/BaseDoxyfile.in
@@ -1779,7 +1779,7 @@ PREDEFINED             = DOXYGEN_RUNNING \
                          "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
                          "CGAL_NP_CLASS_2=NamedParameters2" \
                          CGAL_DEPRECATED \
-                         CGAL_DEPRECATED_MSG
+                         CGAL_DEPRECATED_MSG(name)=
 
 # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then
 # this tag can be used to specify a list of macro names that should be expanded.
diff --git a/Documentation/doc/resources/1.9.3/BaseDoxyfile.in b/Documentation/doc/resources/1.9.3/BaseDoxyfile.in
index 50fb0eddfe1b..6a80966eb82a 100644
--- a/Documentation/doc/resources/1.9.3/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.3/BaseDoxyfile.in
@@ -2268,7 +2268,7 @@ PREDEFINED             = DOXYGEN_RUNNING \
                          "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
                          "CGAL_NP_CLASS_2=NamedParameters2" \
                          CGAL_DEPRECATED \
-                         CGAL_DEPRECATED_MSG
+                         CGAL_DEPRECATED_MSG(name)=
 
 
 # If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this

From 3ca05f491827ae5966f0e296090e83485174c92a Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 17 May 2023 09:28:25 +0100
Subject: [PATCH 0290/1398] fixes

---
 Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h | 15 ++++++++-------
 Mesh_3/include/CGAL/Implicit_mesh_domain_3.h   | 11 +++++++----
 2 files changed, 15 insertions(+), 11 deletions(-)

diff --git a/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h b/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
index 65cb1690f93b..44e555b90278 100644
--- a/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
@@ -115,14 +115,15 @@ Gray_image_mesh_domain_3
     @param value_outside the value attached to voxels outside of the domain
     to be meshed. It should be lower than `iso_value`
     @param error_bound is relative to the size of the image.
-
-    @todo deal with p_rng
   */
-  Gray_image_mesh_domain_3(const Image& image,
-                           const Image_word_type iso_value,
-                           const Image_word_type value_outside = 0.,
-                           const FT& error_bound = FT(1e-3),
-                           CGAL::Random* p_rng = nullptr)
+  Gray_image_mesh_domain_3(const Image& image
+                           ,const Image_word_type iso_value
+                           ,const Image_word_type value_outside = 0.
+                           ,const FT& error_bound = FT(1e-3)
+#ifndef DOXYGEN_RUNNING
+                           ,CGAL::Random* p_rng = nullptr
+#endif
+                           )
     : Base(parameters::function = Wrapper(image,
                    Transform(iso_value),
                    Transform(iso_value)(value_outside)),
diff --git a/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h b/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
index 67b8ac251e1d..47421dee5321 100644
--- a/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
@@ -120,10 +120,13 @@ Implicit_mesh_domain_3
     radius of `bounding_sphere`.
     @todo Fix for `p_rng`
   */
-  Implicit_mesh_domain_3(Function_ f,
-                         const Sphere_3& bounding_sphere,
-                         const FT& error_bound = FT(1e-6),
-                         CGAL::Random* p_rng = nullptr)
+  Implicit_mesh_domain_3(Function_ f
+                         ,const Sphere_3& bounding_sphere
+                         ,const FT& error_bound = FT(1e-6)
+#ifndef DOXYGEN_RUNNING
+                         ,CGAL::Random* p_rng = nullptr
+#endif
+                         )
     : Base(parameters::function = Wrapper(f), parameters::bounding_object = bounding_sphere, parameters::relative_error_bound = error_bound,
            parameters::null_subdomain_index = Null_subdomain_index(), parameters::p_rng = p_rng)  {}
 

From a827d9ab676b760a22b198574cf3f42c787c1342 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 17 May 2023 11:11:25 +0100
Subject: [PATCH 0291/1398] fixes

---
 Mesh_3/include/CGAL/Implicit_mesh_domain_3.h | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h b/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
index 47421dee5321..59ad97066501 100644
--- a/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
@@ -118,7 +118,6 @@ Implicit_mesh_domain_3
     bisection is stopped when the length of the intersected
     segment is less than the product of `error_bound` by the
     radius of `bounding_sphere`.
-    @todo Fix for `p_rng`
   */
   Implicit_mesh_domain_3(Function_ f
                          ,const Sphere_3& bounding_sphere

From bf79ecd8ad377cf4e32a2768740b6dde456a3991 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 17 May 2023 21:05:29 +0100
Subject: [PATCH 0292/1398] fixes

---
 Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h | 13 ++++++++-----
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h    | 13 ++++++++-----
 2 files changed, 16 insertions(+), 10 deletions(-)

diff --git a/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
index 34491151faac..9992d44a56f4 100644
--- a/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
@@ -120,11 +120,14 @@ Labeled_image_mesh_domain_3
     The parameter `error_bound` is relative to the size of the image.
     @todo Document or comment the other parameters
   */
-  Labeled_image_mesh_domain_3(const Image& image,
-                              const FT& error_bound = FT(1e-3),
-                              Subdomain_index value_outside = 0,
-                              Null null = Null(),
-                              CGAL::Random* p_rng = nullptr)
+  Labeled_image_mesh_domain_3(const Image& image
+                              ,const FT& error_bound = FT(1e-3)
+                              ,Subdomain_index value_outside = 0
+                              ,Null null = Null()
+#ifndef DOXYGEN_RUNNING
+                              ,CGAL::Random* p_rng = nullptr
+#endif
+                              )
     : Base(parameters::function = Wrapper(image, Identity(), value_outside),
            parameters::bounding_object = compute_bounding_box(image),
            parameters::relative_error_bound = error_bound,
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index f1791c3d847e..0e3937e4c7da 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -267,9 +267,12 @@ class Polyhedral_mesh_domain_3
     Using this constructor allows to mesh a polyhedral surface which is not closed, or has holes.
     The inside of `bounding_polyhedron` will be meshed.
 */
-  Polyhedral_mesh_domain_3(const Polyhedron& p,
-                           const Polyhedron& bounding_polyhedron,
-                           CGAL::Random* p_rng = nullptr)
+  Polyhedral_mesh_domain_3(const Polyhedron& p
+                           ,const Polyhedron& bounding_polyhedron
+#ifndef DOXYGEN_RUNNING
+                           ,CGAL::Random* p_rng = nullptr
+#endif
+                           )
     : tree_()
     , bounding_tree_(new AABB_tree_)
     , p_rng_(p_rng)
@@ -425,8 +428,8 @@ class Polyhedral_mesh_domain_3
   typedef boost::mpl::vector<Segment_3, Ray_3, Line_3> Allowed_query_types;
 
   /**
-   * Returns true is the element `type` intersect properly any of the
-   * surface patches describing the either the domain boundary or some
+   * Returns `true` if the element `type` intersects properly any of the
+   * surface patches describing either the domain boundary or some
    * subdomain boundary.
    * `Type` is either `Segment_3`, `Ray_3` or `Line_3`.
    * Parameter index is set to the index of the intersected surface patch

From 9f241c89c5471a1cd6d5fcdefba01aec4c351304 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 19 May 2023 18:42:56 +0100
Subject: [PATCH 0293/1398] rename template parameters

---
 .../Mesh_domain_with_polyline_features_3.h    | 23 +++++++-------
 Mesh_3/include/CGAL/Mesh_triangulation_3.h    | 30 +++++++++----------
 .../include/CGAL/Polyhedral_mesh_domain_3.h   |  4 ++-
 3 files changed, 30 insertions(+), 27 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 47b9bf495ade..9fa436fe842b 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -523,7 +523,7 @@ features into any model of the `MeshDomain_3` concept.
 The 1-dimensional features are described as polylines
 whose endpoints are the added corners.
 
-\tparam MeshDomain_3 is the type
+\tparam MD is the type
 of the domain which should be extended.
 It has to be a model of the `MeshDomain_3` concept.
 
@@ -536,16 +536,17 @@ It has to be a model of the `MeshDomain_3` concept.
 \sa `CGAL::Labeled_image_mesh_domain_3<Image,BGT>`
 
 */
-template < typename MeshDomain_3 >
+template < typename MD >
 class Mesh_domain_with_polyline_features_3
-  : public MeshDomain_3
+  : public MD
 {
-  typedef Mesh_domain_with_polyline_features_3<MeshDomain_3> Self;
+  typedef Mesh_domain_with_polyline_features_3<MD> Self;
+
 public:
 /// \name Types
 /// @{
-  typedef typename MeshDomain_3::Surface_patch_index Surface_patch_index;
-  typedef typename MeshDomain_3::Subdomain_index     Subdomain_index;
+  typedef typename MD::Surface_patch_index           Surface_patch_index;
+  typedef typename MD::Subdomain_index               Subdomain_index;
   typedef int                                        Curve_index;
   typedef int                                        Corner_index;
 
@@ -553,14 +554,14 @@ class Mesh_domain_with_polyline_features_3
   typedef unspecified_type                           Index;
 #else
   typedef typename Mesh_3::internal::Index_generator_with_features<
-    typename MeshDomain_3::Subdomain_index,
+    typename MD::Subdomain_index,
     Surface_patch_index,
     Curve_index,
     Corner_index>::type                              Index;
 #endif
 
   typedef CGAL::Tag_true                             Has_features;
-  typedef typename MeshDomain_3::R::FT               FT;
+  typedef typename MD::R::FT                         FT;
 /// @}
 
 #ifndef DOXYGEN_RUNNING
@@ -569,9 +570,9 @@ class Mesh_domain_with_polyline_features_3
   typedef Curve_index Curve_segment_index;
 #endif
 
-  typedef typename MeshDomain_3::R         Gt;
+  typedef typename MD::R           Gt;
   typedef Gt                       R;
-  typedef typename MeshDomain_3::Point_3   Point_3;
+  typedef typename MD::Point_3     Point_3;
 #endif // DOXYGEN_RUNNING
 
 /// \name Creation
@@ -581,7 +582,7 @@ class Mesh_domain_with_polyline_features_3
 
   template <typename ... T>
   Mesh_domain_with_polyline_features_3(const T& ...o)
-    : MeshDomain_3(o...)
+    : MD(o...)
     , current_corner_index_(1)
     , current_curve_index_(1)
     , curves_aabb_tree_is_built(false) {}
diff --git a/Mesh_3/include/CGAL/Mesh_triangulation_3.h b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
index 560d2983f415..ee7d53ab7105 100644
--- a/Mesh_3/include/CGAL/Mesh_triangulation_3.h
+++ b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
@@ -131,7 +131,7 @@ type to be used for the 3D triangulation embedding the mesh.
 
 \tparam MD must be a model of `MeshDomain_3`.
 
-\tparam K_ must be a model of `MeshTriangulationTraits_3` or `Default`
+\tparam Gt must be a model of `MeshTriangulationTraits_3` or `Default`
 and defaults to `Kernel_traits<MD>::%Kernel`.
 
 \tparam Concurrency_tag_ enables sequential versus parallel meshing and optimization algorithms.
@@ -139,51 +139,51 @@ and defaults to `Kernel_traits<MD>::%Kernel`.
                         and `Parallel_if_available_tag`.
 
 \tparam Vertex_base__ must be a model of `MeshVertexBase_3` or `Default`
-and defaults to `Mesh_vertex_base_3<K_, MD>`.
+and defaults to `Mesh_vertex_base_3<Gt, MD>`.
 
 \tparam Cell_base_ must be a model of `MeshCellBase_3` or `Default`
-and defaults to `Compact_mesh_cell_base_3<K_, MD>`.
+and defaults to `Compact_mesh_cell_base_3<Gt, MD>`.
 
-\warning To improve the robustness of the meshing process, the input traits `K_`
+\warning To improve the robustness of the meshing process, the input traits `Gt`
          is wrapped with the traits class `Robust_weighted_circumcenter_filtered_traits_3`.
-         The class `Robust_weighted_circumcenter_filtered_traits_3<K_>` upgrades the functors
+         The class `Robust_weighted_circumcenter_filtered_traits_3<Gt>` upgrades the functors
          models of `Kernel::ConstructWeightedCircumcenter_3`, `Kernel::ComputeSquaredRadius_3`,
          and `Kernel::ComputeSquaredRadiusSmallestOrthogonalSphere_3` that are
-         provided by `K_` to use exact computations when the geometric configuration
+         provided by `Gt` to use exact computations when the geometric configuration
          is close to degenerate (e.g. almost coplanar points). <br>
          Users should therefore be aware that the traits class of the triangulation
-         will have type `Robust_weighted_circumcenter_filtered_traits_3<K_>`.
+         will have type `Robust_weighted_circumcenter_filtered_traits_3<Gt>`.
 
 \sa `make_mesh_3()`
 \sa `Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
 
 */
 template<class MD,
-         class K_ = Default,
-         class Concurrency_tag_ = Sequential_tag,
-         class Vertex_base_ = Default,
-         class Cell_base_   = Default>
+         class Gt  = Default,
+         class ConcurrencyTag = Sequential_tag,
+         class VertexBase = Default,
+         class CellBase   = Default>
 struct Mesh_triangulation_3
 {
 private:
-  using K = typename Default::Lazy_get<K_, Kernel_traits<MD> >::type;
+  using K = typename Default::Lazy_get<Gt, Kernel_traits<MD> >::type;
 
   using Geom_traits = typename details::Mesh_geom_traits_generator<K>::type;
 
   using Indices_tuple = Mesh_3::internal::Indices_tuple_t<MD>;
   using Vertex_base = typename Default::Get<
-    Vertex_base_,
+    VertexBase,
     Mesh_vertex_generator_3<Geom_traits,
                             Indices_tuple,
                             typename MD::Index> >::type;
   using Cell_base = typename Default::Get<
-    Cell_base_,
+    CellBase,
     Compact_mesh_cell_generator_3<Geom_traits,
                                   typename MD::Subdomain_index,
                                   typename MD::Surface_patch_index,
                                   typename MD::Index> >::type;
   using Concurrency_tag =
-      typename Default::Get<Concurrency_tag_, Sequential_tag>::type;
+      typename Default::Get<ConcurrencyTag, Sequential_tag>::type;
   struct Tds : public Triangulation_data_structure_3<Vertex_base, Cell_base,
                                                      Concurrency_tag> {};
   using Triangulation =
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 0e3937e4c7da..a07b9d106ff6 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -129,6 +129,8 @@ the intersection tests and intersection computations
 for polyhedral boundary surfaces. This parameter has to be instantiated
 with a model of the concept `IntersectionGeometricTraits_3`.
 
+@todo Document TriangleAccessor as it was template parameter. What about the two others?
+
 \cgalModels `MeshDomain_3`
 
 \sa `IntersectionGeometricTraits_3`
@@ -139,7 +141,7 @@ with a model of the concept `IntersectionGeometricTraits_3`.
 
 template<class Polyhedron,/*FaceGraph*/
          class IGT_,
-         class = CGAL::Default,
+         class TriangleAccessor = CGAL::Default,
          class Patch_id_ = void,
          class Use_exact_intersection_construction_tag = CGAL::Tag_true>
 class Polyhedral_mesh_domain_3

From 7326fb52ceea2c98462000cb6170e28ee1d8e0be Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 16 May 2023 22:56:41 +0200
Subject: [PATCH 0294/1398] Add initial preparations for adaptive sizing field
 Add Adaptive_sizing_field header with edge min and max limits, and tolerance
 Adjust the example

---
 ...sotropic_remeshing_with_sizing_example.cpp |  10 +-
 .../Adaptive_sizing_field.h                   | 112 ++++++++++++++++++
 .../CGAL/Polygon_mesh_processing/remesh.h     |  18 +++
 3 files changed, 137 insertions(+), 3 deletions(-)
 create mode 100644 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index fa5dc55d7896..96325e6d8619 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -11,7 +11,7 @@ namespace PMP = CGAL::Polygon_mesh_processing;
 
 int main(int argc, char* argv[])
 {
-  const char* filename = (argc > 1) ? argv[1] : "data/pig.off";
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/pig.off");
   std::ifstream input(filename);
 
   Mesh mesh;
@@ -20,7 +20,8 @@ int main(int argc, char* argv[])
     return 1;
   }
 
-  double target_edge_length = 0.04;
+  const std::pair<double, double> edge_min_max{0.1, 0.4};
+  const double tol = 0.1;
   unsigned int nb_iter = 3;
 
   std::cout << "Start remeshing of " << filename
@@ -28,11 +29,14 @@ int main(int argc, char* argv[])
 
   PMP::isotropic_remeshing(
       faces(mesh),
-      target_edge_length,
+      edge_min_max,
+      tol,
       mesh,
       PMP::parameters::number_of_iterations(nb_iter)
       );
 
+  CGAL::IO::write_polygon_mesh("out.off", mesh, CGAL::parameters::stream_precision(17));
+
   std::cout << "Remeshing done." << std::endl;
 
   return 0;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
new file mode 100644
index 000000000000..6b48181388e4
--- /dev/null
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -0,0 +1,112 @@
+// Copyright (c) 2020 GeometryFactory (France)
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+//
+// Author(s)     : Jane Tournois
+
+#ifndef CGAL_PMP_REMESHING_ADAPTIVE_SIZING_FIELD_H
+#define CGAL_PMP_REMESHING_ADAPTIVE_SIZING_FIELD_H
+
+#include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
+
+#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h>
+
+#include <CGAL/number_utils.h>
+
+namespace CGAL
+{
+namespace Polygon_mesh_processing
+{
+template <class PolygonMesh>
+class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
+{
+private:
+  typedef CGAL::Sizing_field<PolygonMesh> Base;
+
+public:
+  typedef typename Base::FT         FT;
+  typedef typename Base::Point_3    Point_3;
+  typedef typename Base::halfedge_descriptor halfedge_descriptor;
+  typedef typename Base::vertex_descriptor   vertex_descriptor;
+
+  Adaptive_sizing_field(const std::pair<FT, FT>& edge_len_min_max
+                      , const FT& tolerance
+                      , const PolygonMesh& pmesh)
+    : m_sq_short( CGAL::square(edge_len_min_max.first))
+    , m_sq_long(  CGAL::square(edge_len_min_max.second))
+    , tol(tolerance)
+    , m_pmesh(pmesh)
+  {
+      // calculate and store curvature and sizing field here in constructor?
+      // todo what about updating it?
+  }
+
+private:
+  FT sqlength(const vertex_descriptor& va,
+              const vertex_descriptor& vb) const
+  {
+    typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
+      vpmap = get(CGAL::vertex_point, m_pmesh);
+    return FT(CGAL::squared_distance(get(vpmap, va), get(vpmap, vb)));
+  }
+
+  FT sqlength(const halfedge_descriptor& h) const
+  {
+    return sqlength(target(h, m_pmesh), source(h, m_pmesh));
+  }
+
+public:
+  boost::optional<FT> is_too_long(const halfedge_descriptor& h) const
+  {
+    const FT sqlen = sqlength(h);
+    if(sqlen > m_sq_long)
+      return sqlen;
+    else
+      return boost::none;
+  }
+
+  boost::optional<FT> is_too_long(const vertex_descriptor& va,
+                                  const vertex_descriptor& vb) const
+  {
+    const FT sqlen = sqlength(va, vb);
+    if (sqlen > m_sq_long)
+      return sqlen;
+    else
+      return boost::none;
+  }
+
+  boost::optional<FT> is_too_short(const halfedge_descriptor& h) const
+  {
+    const FT sqlen = sqlength(h);
+    if (sqlen < m_sq_long)
+      return sqlen;
+    else
+      return boost::none;
+  }
+
+  virtual Point_3 split_placement(const halfedge_descriptor& h) const
+  {
+    typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
+      vpmap = get(CGAL::vertex_point, m_pmesh);
+    return CGAL::midpoint(get(vpmap, target(h, m_pmesh)),
+                          get(vpmap, source(h, m_pmesh)));
+  }
+
+private:
+  FT m_sq_short;
+  FT m_sq_long;
+  FT tol;
+  const PolygonMesh& m_pmesh;
+  //todo add property map containing sizing field form m_pmesh here
+};
+
+}//end namespace Polygon_mesh_processing
+}//end namespace CGAL
+
+#endif //CGAL_PMP_REMESHING_ADAPTIVE_SIZING_FIELD_H
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 54c99b2de432..4ba686e9e191 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -19,6 +19,7 @@
 
 #include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h>
 #include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h>
+#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h>
 
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/boost/graph/named_params_helper.h>
@@ -218,6 +219,23 @@ void isotropic_remeshing(const FaceRange& faces
     np);
 }
 
+template<typename PolygonMesh
+        , typename FaceRange
+        , typename NamedParameters = parameters::Default_named_parameters>
+void isotropic_remeshing(const FaceRange& faces
+                       , const std::pair<double, double>& edge_len_min_max //todo add defaults?
+                       , const double& tolerance                           //todo add defaults?
+                       , PolygonMesh& pmesh
+                       , const NamedParameters& np = parameters::default_values())
+{
+  typedef Adaptive_sizing_field<PolygonMesh> Adaptive_sizing;
+  isotropic_remeshing<PolygonMesh, FaceRange, Adaptive_sizing, NamedParameters>(
+          faces,
+          Adaptive_sizing(edge_len_min_max, tolerance, pmesh),
+          pmesh,
+          np);
+}
+
 template<typename PolygonMesh
        , typename FaceRange
        , typename SizingFunction

From 5c4e6ed7b5d80ea09f677ee0c662efe251de1acd Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 19 May 2023 22:42:32 +0200
Subject: [PATCH 0295/1398] Create a vertex property map that will contain
 sizing info (WIP) Also, update target length checks

---
 ...sotropic_remeshing_with_sizing_example.cpp |  5 +-
 .../Adaptive_sizing_field.h                   | 57 +++++++++++++++----
 .../Uniform_sizing_field.h                    |  2 +
 .../Isotropic_remeshing/remesh_impl.h         |  7 ++-
 .../CGAL/Polygon_mesh_processing/remesh.h     |  8 +--
 5 files changed, 59 insertions(+), 20 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index 96325e6d8619..1e1335ccfa6d 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -20,8 +20,8 @@ int main(int argc, char* argv[])
     return 1;
   }
 
-  const std::pair<double, double> edge_min_max{0.1, 0.4};
-  const double tol = 0.1;
+  //todo ip - update
+  const std::pair<double, double> edge_min_max{0.1, 0.12};
   unsigned int nb_iter = 3;
 
   std::cout << "Start remeshing of " << filename
@@ -30,7 +30,6 @@ int main(int argc, char* argv[])
   PMP::isotropic_remeshing(
       faces(mesh),
       edge_min_max,
-      tol,
       mesh,
       PMP::parameters::number_of_iterations(nb_iter)
       );
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 6b48181388e4..1293577ad4f8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -34,17 +34,22 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   typedef typename Base::Point_3    Point_3;
   typedef typename Base::halfedge_descriptor halfedge_descriptor;
   typedef typename Base::vertex_descriptor   vertex_descriptor;
+  typedef typename CGAL::dynamic_vertex_property_t<FT>            Vertex_property_tag;
+  typedef typename boost::property_map<PolygonMesh,
+                                       Vertex_property_tag>::type VertexSizingMap;
 
-  Adaptive_sizing_field(const std::pair<FT, FT>& edge_len_min_max
-                      , const FT& tolerance
-                      , const PolygonMesh& pmesh)
+    Adaptive_sizing_field(const std::pair<FT, FT>& edge_len_min_max
+                        , PolygonMesh& pmesh)
     : m_sq_short( CGAL::square(edge_len_min_max.first))
     , m_sq_long(  CGAL::square(edge_len_min_max.second))
-    , tol(tolerance)
     , m_pmesh(pmesh)
   {
-      // calculate and store curvature and sizing field here in constructor?
-      // todo what about updating it?
+      //todo ip: initialize sizing map with default values
+      //todo ip: might end up using directly the property map of the curvature calculation (if mutable)?
+      vertex_sizing_map_ = get(Vertex_property_tag(), m_pmesh);
+      for(vertex_descriptor v : vertices(m_pmesh)){
+          put(vertex_sizing_map_, v, m_sq_long);
+      }
   }
 
 private:
@@ -62,10 +67,24 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   }
 
 public:
+  void calc_sizing_map()
+  {
+      //todo ip
+      // calculate curvature
+
+      // loop over curvature property field and calculate the target mesh size for a vertex
+      // don't forget to store squared length
+
+  }
+
   boost::optional<FT> is_too_long(const halfedge_descriptor& h) const
   {
     const FT sqlen = sqlength(h);
-    if(sqlen > m_sq_long)
+    FT sqtarg_len = std::min(get(vertex_sizing_map_, source(h, m_pmesh)),
+                             get(vertex_sizing_map_, target(h, m_pmesh)));
+    CGAL_assertion(get(vertex_sizing_map_, source(h, m_pmesh)));
+    CGAL_assertion(get(vertex_sizing_map_, target(h, m_pmesh)));
+    if(sqlen > sqtarg_len)
       return sqlen;
     else
       return boost::none;
@@ -75,7 +94,11 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                                   const vertex_descriptor& vb) const
   {
     const FT sqlen = sqlength(va, vb);
-    if (sqlen > m_sq_long)
+    FT sqtarg_len = std::min(get(vertex_sizing_map_, va),
+                             get(vertex_sizing_map_, vb));
+    CGAL_assertion(get(vertex_sizing_map_, va));
+    CGAL_assertion(get(vertex_sizing_map_, vb));
+    if (sqlen > sqtarg_len)
       return sqlen;
     else
       return boost::none;
@@ -84,7 +107,11 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   boost::optional<FT> is_too_short(const halfedge_descriptor& h) const
   {
     const FT sqlen = sqlength(h);
-    if (sqlen < m_sq_long)
+    FT sqtarg_len = std::min(get(vertex_sizing_map_, source(h, m_pmesh)),
+                             get(vertex_sizing_map_, target(h, m_pmesh)));
+    CGAL_assertion(get(vertex_sizing_map_, source(h, m_pmesh)));
+    CGAL_assertion(get(vertex_sizing_map_, target(h, m_pmesh)));
+    if (sqlen < sqtarg_len)
       return sqlen;
     else
       return boost::none;
@@ -98,12 +125,18 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                           get(vpmap, source(h, m_pmesh)));
   }
 
+  void update_sizing_map(const vertex_descriptor& vnew)
+  {
+    //todo ip: calculate curvature for the vertex
+    //dummy
+    put(vertex_sizing_map_, vnew, m_sq_short);
+  }
+
 private:
   FT m_sq_short;
   FT m_sq_long;
-  FT tol;
-  const PolygonMesh& m_pmesh;
-  //todo add property map containing sizing field form m_pmesh here
+  PolygonMesh& m_pmesh;
+  VertexSizingMap vertex_sizing_map_;
 };
 
 }//end namespace Polygon_mesh_processing
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
index 3f32aacb1aa9..fbb522b7c787 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
@@ -92,6 +92,8 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                           get(vpmap, source(h, m_pmesh)));
   }
 
+  void update_sizing_map(const vertex_descriptor& vnew) const {} //todo ip- rewrite to remove this?
+
 private:
   FT m_sq_short;
   FT m_sq_long;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index f0daf9cc20a5..19651ded9ae5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -478,7 +478,7 @@ namespace internal {
     //if an edge is longer than the given threshold `high`, the edge
     //is split at its midpoint and the two adjacent triangles are bisected (2-4 split)"
     template<typename SizingFunction>
-    void split_long_edges(const SizingFunction& sizing)
+    void split_long_edges(SizingFunction& sizing)
     {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
       std::cout << "Split long edges..." << std::endl;
@@ -536,6 +536,8 @@ namespace internal {
         //move refinement point
         vertex_descriptor vnew = target(hnew, mesh_);
         put(vpmap_, vnew, refinement_point);
+        //todo ip-add
+        sizing.update_sizing_map(vnew);
 #ifdef CGAL_PMP_REMESHING_VERY_VERBOSE
         std::cout << "   Refinement point : " << refinement_point << std::endl;
 #endif
@@ -1080,6 +1082,7 @@ namespace internal {
 
         Point proj = trees[patch_id_to_index_map[get_patch_id(face(halfedge(v, mesh_), mesh_))]]->closest_point(get(vpmap_, v));
         put(vpmap_, v, proj);
+        //todo ip - also update sizing field here?
       }
       CGAL_assertion(!input_mesh_is_valid_ || is_valid_polygon_mesh(mesh_));
 #ifdef CGAL_PMP_REMESHING_DEBUG
@@ -1108,6 +1111,7 @@ namespace internal {
           continue;
         //note if v is constrained, it has not moved
         put(vpmap_, v,  proj(v));
+        //todo ip: also update sizing field here?
       }
       CGAL_assertion(is_valid(mesh_));
 #ifdef CGAL_PMP_REMESHING_DEBUG
@@ -2010,6 +2014,7 @@ namespace internal {
     VertexIsConstrainedMap vcmap_;
     FaceIndexMap fimap_;
     CGAL_assertion_code(bool input_mesh_is_valid_;)
+    //todo ip: maybe make sizing field member (reference) here? easier to handle updates
 
   };//end class Incremental_remesher
 }//end namespace internal
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 4ba686e9e191..858f34958109 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -38,7 +38,7 @@ template<typename PolygonMesh
        , typename SizingFunction
        , typename NamedParameters>
 void isotropic_remeshing(const FaceRange& faces
-                       , const SizingFunction& sizing
+                       , SizingFunction& sizing
                        , PolygonMesh& pmesh
                        , const NamedParameters& np);
 
@@ -224,14 +224,14 @@ template<typename PolygonMesh
         , typename NamedParameters = parameters::Default_named_parameters>
 void isotropic_remeshing(const FaceRange& faces
                        , const std::pair<double, double>& edge_len_min_max //todo add defaults?
-                       , const double& tolerance                           //todo add defaults?
                        , PolygonMesh& pmesh
                        , const NamedParameters& np = parameters::default_values())
 {
   typedef Adaptive_sizing_field<PolygonMesh> Adaptive_sizing;
+  Adaptive_sizing sizing(edge_len_min_max, pmesh);
   isotropic_remeshing<PolygonMesh, FaceRange, Adaptive_sizing, NamedParameters>(
           faces,
-          Adaptive_sizing(edge_len_min_max, tolerance, pmesh),
+          sizing,
           pmesh,
           np);
 }
@@ -241,7 +241,7 @@ template<typename PolygonMesh
        , typename SizingFunction
        , typename NamedParameters>
 void isotropic_remeshing(const FaceRange& faces
-                       , const SizingFunction& sizing
+                       , SizingFunction& sizing
                        , PolygonMesh& pmesh
                        , const NamedParameters& np)
 {

From b1137e9d83a98704f152e586d9decbad008702fc Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 22 May 2023 12:19:44 +0100
Subject: [PATCH 0296/1398] various

---
 Mesh_3/doc/Mesh_3/Doxyfile.in                 |  5 ++
 Mesh_3/doc/Mesh_3/Mesh_3.txt                  |  2 +-
 Mesh_3/doc/Mesh_3/PackageDescription.txt      |  1 -
 .../Implicit_to_labeling_function_wrapper.h   |  1 -
 .../CGAL/Labeled_image_mesh_domain_3.h        | 26 +++----
 Mesh_3/include/CGAL/Mesh_cell_criteria_3.h    | 35 +++++----
 Mesh_3/include/CGAL/Mesh_facet_criteria_3.h   | 76 ++++++++++---------
 .../CGAL/Polyhedral_complex_mesh_domain_3.h   | 26 +++----
 .../include/CGAL/Polyhedral_mesh_domain_3.h   | 23 +++---
 .../Polyhedral_mesh_domain_with_features_3.h  | 40 ++++++----
 10 files changed, 124 insertions(+), 111 deletions(-)

diff --git a/Mesh_3/doc/Mesh_3/Doxyfile.in b/Mesh_3/doc/Mesh_3/Doxyfile.in
index b228592fd953..b7f0fd996208 100644
--- a/Mesh_3/doc/Mesh_3/Doxyfile.in
+++ b/Mesh_3/doc/Mesh_3/Doxyfile.in
@@ -1,4 +1,9 @@
 @INCLUDE = ${CGAL_DOC_PACKAGE_DEFAULTS}
+# custom options for this package
+
+EXTRACT_ALL                =  false
+HIDE_UNDOC_CLASSES         =  true
+WARN_IF_UNDOCUMENTED       =  false
 
 # macros to be used inside the code
 ALIASES += "cgalDescribePolylineType=A polyline is defined as a sequence of points, each pair of contiguous points defines a segment of the polyline. If the first and last points of the polyline are identical, the polyline is closed."
diff --git a/Mesh_3/doc/Mesh_3/Mesh_3.txt b/Mesh_3/doc/Mesh_3/Mesh_3.txt
index b7057a757a27..90afbe72b31b 100644
--- a/Mesh_3/doc/Mesh_3/Mesh_3.txt
+++ b/Mesh_3/doc/Mesh_3/Mesh_3.txt
@@ -1428,6 +1428,6 @@ and Mariette Yvinec. It appeared first in the release 3.8 of \cgal.
 
 In 2013, Clément Jamin made the meshing and optimization algorithms parallel
 on multi-core shared-memory architectures.
-\todo Add reference to paper or research report when it is available.
+
 */
 } /* namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/PackageDescription.txt b/Mesh_3/doc/Mesh_3/PackageDescription.txt
index 553358a202bc..24a8d1786a30 100644
--- a/Mesh_3/doc/Mesh_3/PackageDescription.txt
+++ b/Mesh_3/doc/Mesh_3/PackageDescription.txt
@@ -41,7 +41,6 @@
 
 /*!
 \addtogroup PkgMesh3Ref
-\todo check generated documentation
 \cgalPkgDescriptionBegin{3D Mesh Generation,PkgMesh3}
 \cgalPkgPicture{Mesh_3/fig/multilabel_mesher_small.jpg}
 \cgalPkgSummaryBegin
diff --git a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
index 7ef8933b5a0b..cc4e8c96c9ea 100644
--- a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
+++ b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
@@ -194,7 +194,6 @@ class Implicit_multi_domain_to_labeling_function_wrapper
   typedef std::vector<Function>   Function_vector;
 #ifdef DOXYGEN_RUNNING
  //!
-  /// @todo different from code
   typedef typename Function::Point     Point_3;
 #endif
   /// @}
diff --git a/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
index 9992d44a56f4..da495b895a3d 100644
--- a/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
@@ -71,19 +71,20 @@ with a model of the concept `BisectionGeometricTraits_3`.
 An executable that uses `Labeled_image_mesh_domain_3` must be linked with
 the <I>CGAL_ImageIO</I> library.
 
-@todo Document or comment the other parameters
-
 \sa `BisectionGeometricTraits_3`
 \sa `CGAL::make_mesh_3()`.
 
 */
 
-template<class Image,
-         class BGT,
-         typename Image_word_type_ = unsigned char,
-         typename Subdomain_index = int,
-         class Null_subdomain_index = Default,
-         class Wrapper_ = Default >
+template<class Image
+         ,class BGT
+#ifndef DOXYGEN_RUNNING
+         ,typename Image_word_type_ = unsigned char
+         ,typename Subdomain_index = int
+         ,class Null_subdomain_index = Default
+         ,class Wrapper_ = Default
+#endif
+         >
 class
 CGAL_DEPRECATED_MSG
 ( "The class template `CGAL::Labeled_image_mesh_domain_3` is now deprecated. "
@@ -117,14 +118,13 @@ Labeled_image_mesh_domain_3
 
   /*!
     Construction from an image.
-    The parameter `error_bound` is relative to the size of the image.
-    @todo Document or comment the other parameters
+    @param error_bound is relative to the size of the image.
   */
   Labeled_image_mesh_domain_3(const Image& image
                               ,const FT& error_bound = FT(1e-3)
+#ifndef DOXYGEN_RUNNING
                               ,Subdomain_index value_outside = 0
                               ,Null null = Null()
-#ifndef DOXYGEN_RUNNING
                               ,CGAL::Random* p_rng = nullptr
 #endif
                               )
@@ -146,13 +146,13 @@ Labeled_image_mesh_domain_3
            parameters::p_rng = p_rng)
   {}
 
-  /// Destructor
+  // Destructor
   virtual ~Labeled_image_mesh_domain_3() {}
 
   using Base::bbox;
 
 private:
-  /// Returns a box enclosing image `im`
+  // Returns a box enclosing image `im`
   Bbox_3 compute_bounding_box(const Image& im) const
   {
     return Bbox_3(-im.vx()+im.tx(),
diff --git a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
index 7ef85ff8adda..2b8331a7b644 100644
--- a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
@@ -39,8 +39,6 @@ and a sizing field which may be a uniform or variable field.
 `Triangulation` of the instance used as model of
 `MeshComplex_3InTriangulation_3`.
 
-@todo What to do with `Visitor_`?
-
 \cgalModels `MeshCellCriteria_3`
 
 \sa `MeshCriteria_3`
@@ -49,11 +47,22 @@ and a sizing field which may be a uniform or variable field.
 
 */
 
-template <typename Tr,
-          typename Visitor_ = Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Tr> >
+template <typename Tr
+#ifndef DOXYGEN_RUNNING
+          ,typename Visitor_ = Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Tr>
+#endif
+          >
 class Mesh_cell_criteria_3
 {
 public:
+  /// \name Types
+  /// @{
+
+  /*!
+    Numerical type
+  */
+  typedef typename Tr::Geom_traits::FT FT;
+
   typedef Visitor_ Visitor;
   typedef typename Visitor::Cell_quality Cell_quality;
   typedef typename Visitor::Is_cell_bad  Is_cell_bad;
@@ -67,21 +76,9 @@ class Mesh_cell_criteria_3
 
   typedef Mesh_cell_criteria_3<Tr> Self;
 
-public:
-
-#ifdef DOXYGEN_RUNNING
-/// \name Types
-/// @{
-
-/*!
-Numerical type
-@todo:  In the code this typedef is private
-*/
-typedef Tr::FT FT;
-
-/// @}
-#endif
+  /// @}
 
+public:
 
   /// \name Creation
 /// @{
@@ -162,10 +159,12 @@ typedef Tr::FT FT;
     return criteria_(tr, cell);
   }
 
+#ifndef DOXYGEN_RUNNING
   void add(Abstract_criterion* criterion)
   {
     criteria_.add(criterion);
   }
+#endif
 
 private:
   void init_radius_edge(const FT& radius_edge_bound)
diff --git a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
index 7a14a3ea20b5..d35f24e024f8 100644
--- a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
@@ -51,11 +51,23 @@ namespace CGAL {
   \sa `CGAL::make_mesh_3()`
 
 */
-template<typename Tr,
-         typename Visitor_ = Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Tr> >
+template<typename Tr
+#ifndef DOXYGEN_RUNNING
+         ,typename Visitor_ = Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Tr>
+#endif
+         >
 class Mesh_facet_criteria_3
 {
 public:
+
+  /// \name Types
+  /// @{
+
+  /*!
+    Numerical type
+  */
+  typedef typename Tr::Geom_traits::FT FT;
+
   typedef Visitor_ Visitor;
   typedef typename Visitor::Facet_quality Facet_quality;
   typedef typename Visitor::Is_facet_bad  Is_facet_bad;
@@ -65,31 +77,21 @@ class Mesh_facet_criteria_3
   typedef Mesh_3::Criteria<Tr,Visitor> Criteria;
 
   typedef typename Tr::Facet Facet;
-  typedef typename Tr::Geom_traits::FT FT;
+
 
   typedef Mesh_facet_criteria_3<Tr> Self;
 
 public:
   typedef CGAL::Tag_true Has_manifold_criterion;
 
-#ifdef DOXYGEN_RUNNING
-/// \name Types
-/// @{
-
-/*!
-Numerical type
-@todo:  In the code this typedef is private
-*/
-typedef Tr::FT FT;
-
 /// @}
-#endif
 
 
   /// \name Creation
   /// @{
 
-  /*!
+#ifdef DOXYGEN_RUNNING
+ /*!
     Returns an object to serve as criteria for facets.
     \param angle_bound is the lower bound for the angle in degrees of the
     surface mesh facets.
@@ -100,17 +102,32 @@ typedef Tr::FT FT;
     \param topology is the set of topological constraints
     which have to be verified by each surface facet. See
     section \ref Mesh_3DelaunayRefinement for further details.
-    Note that if one parameter is set to 0, then its corresponding
-    criteria is ignored.
     \param min_radius_bound is a uniform lower bound for the radius of
     the surface Delaunay balls. Only facets with a radius larger than that
     bound will be refined.
-@todo Does the Note also apply to min_radius_bound?
+    @note If one parameter is set to 0, then its corresponding
+    criterion is ignored.
   */
-  template < typename Sizing_field, typename Sizing_field2 >
+  Mesh_facet_criteria_3(const FT& angle_bound,
+                        const FT& radius_bound,
+                        const FT& distance_bound,
+                        const Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE,
+                        const FT& min_radius_bound = 0.);
+
+#endif
+
+
+  /*!
+    Returns an object to serve as criteria for facets. The types `SizingField` and
+    `DistanceField` must
+    be models of the concept `MeshDomainField_3`. The behavior and semantic of the arguments are the same
+    as above, except that the radius and distance bound parameters are
+    functionals instead of constants.
+  */
+  template < typename Sizing_field, typename DistanceField >
   Mesh_facet_criteria_3(const FT& angle_bound,
                         const Sizing_field & radius_bound,
-                        const Sizing_field2& distance_bound,
+                        const DistanceField& distance_bound,
                         const Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE,
                         const FT& min_radius_bound = 0.)
   {
@@ -124,30 +141,15 @@ typedef Tr::FT FT;
                 Mesh_3::Is_mesh_domain_field_3<Tr, Sizing_field>());
 
     init_distance(distance_bound,
-                  Mesh_3::Is_mesh_domain_field_3<Tr, Sizing_field2>());
+                  Mesh_3::Is_mesh_domain_field_3<Tr, DistanceField>());
 
     init_topo(topology);
   }
-#ifdef DOXYGEN_RUNNING
-  /*!
-    Returns an object to serve as criteria for facets. The types `SizingField` and
-    `DistanceField` must
-    be models of the concept `MeshDomainField_3`. The behavior and semantic of the arguments are the same
-    as above, except that the radius and distance bound parameters are
-    functionals instead of constants.
 
-    @todo This one is only in the doc
-  */
-  template <class SizingField, class DistanceField>
-  Mesh_facet_criteria_3(const FT& angle_bound,
-                        const SizingField& radius_bound,
-                        const DistanceField& distance_bound,
-                        Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE);
-#endif
   /// @}
 
 
-/// Destructor
+  // Destructor
   ~Mesh_facet_criteria_3() { }
 
    /**
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 17e69ff984cb..ca0ed7f8fc37 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -85,7 +85,7 @@ surface, the sub-domain indices on both sides are known.
 \tparam Polyhedron stands for the type of the input polyhedral surface(s),
 model of `FaceListGraph`.
 
-\tparam IGT_ stands for a geometric traits class
+\tparam IGT stands for a geometric traits class
 providing the types and functors required to implement
 the intersection tests and intersection computations
 for polyhedral boundary surfaces. This parameter has to be instantiated
@@ -96,16 +96,16 @@ with a model of the concept `IntersectionGeometricTraits_3`.
 \sa `IntersectionGeometricTraits_3`
 \sa `CGAL::make_mesh_3()`.
 \sa `CGAL::Mesh_domain_with_polyline_features_3<MeshDomain>`
-\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT_,TriangleAccessor>`
-\sa `CGAL::Mesh_polyhedron_3<IGT_>`
+\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
+\sa `CGAL::Mesh_polyhedron_3<IGT>`
 */
 template < class IGT_,
-           class Polyhedron_ = typename Mesh_polyhedron_3<IGT_>::type,
+           class Polyhedron = typename Mesh_polyhedron_3<IGT_>::type,
            class TriangleAccessor=CGAL::Default
            >
 class Polyhedral_complex_mesh_domain_3
   : public Mesh_domain_with_polyline_features_3<
-      Polyhedral_mesh_domain_3< Polyhedron_,
+      Polyhedral_mesh_domain_3< Polyhedron,
                                 IGT_,
                                 CGAL::Default,
                                 int,   //Use_patch_id_tag
@@ -113,14 +113,14 @@ class Polyhedral_complex_mesh_domain_3
 {
 public:
   /// The base class
-  typedef Polyhedron_ Polyhedron;
+  typedef Polyhedron Polyhedron;
   typedef Mesh_domain_with_polyline_features_3<
     Polyhedral_mesh_domain_3<
       Polyhedron, IGT_, CGAL::Default,
       int, Tag_true > > Base;
   /// @cond DEVELOPERS
 private:
-  typedef IGT_ IGT;
+
   typedef Polyhedral_mesh_domain_3<Polyhedron, IGT_, CGAL::Default,
                                    int, Tag_true >       BaseBase;
   typedef Polyhedral_complex_mesh_domain_3<IGT_, Polyhedron>  Self;
@@ -178,7 +178,7 @@ class Polyhedral_complex_mesh_domain_3
     boost::setS, // this avoids parallel edges
     boost::vecS,
     boost::undirectedS,
-    typename IGT::Point_3,
+    typename IGT_::Point_3,
     Set_of_indices> Featured_edges_copy_graph;
 
   /// @endcond
@@ -378,7 +378,7 @@ class Polyhedral_complex_mesh_domain_3
 
     typedef typename C3t3::Triangulation                  Tr;
     typedef typename Tr::Weighted_point                   Weighted_point;
-    typedef typename IGT::Sphere_3                        Sphere_3;
+    typedef typename IGT_::Sphere_3                        Sphere_3;
     typedef typename Polyhedron::Vertex_const_handle      Vertex_const_handle;
 
     Tr& tr = c3t3.triangulation();
@@ -565,8 +565,8 @@ class Polyhedral_complex_mesh_domain_3
       }
 
       // Shoot ray
-      typename IGT::Construct_ray_3 ray = IGT().construct_ray_3_object();
-      typename IGT::Construct_vector_3 vector = IGT().construct_vector_3_object();
+      typename IGT_::Construct_ray_3 ray = IGT_().construct_ray_3_object();
+      typename IGT_::Construct_vector_3 vector = IGT_().construct_vector_3_object();
 
       while(true) {
         Random_points_on_sphere_3<Point_3> random_point(1.);
@@ -598,7 +598,7 @@ class Polyhedral_complex_mesh_domain_3
           Surface_patch_index face_id = r_domain_.make_surface_index(*opt);
           const std::pair<Subdomain_index, Subdomain_index>& pair =
             r_domain_.incident_subdomains_indices(face_id);
-          const typename IGT::Triangle_3 triangle =
+          const typename IGT_::Triangle_3 triangle =
             BaseBase::template Primitive_type<Polyhedron_type>::datum(*opt);
           const Point_3& a = triangle[0];
           const Point_3& b = triangle[1];
@@ -723,7 +723,7 @@ detect_features(FT angle_in_degree,
   G_copy g_copy;
   typedef typename boost::graph_traits<G_copy>::vertex_descriptor
                                                       graph_vertex_descriptor;
-  typedef std::map<typename IGT::Point_3,
+  typedef std::map<Point_3,
                    graph_vertex_descriptor> P2vmap;
   // TODO: replace this map by and unordered_map
   P2vmap p2vmap;
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index a07b9d106ff6..394ec07be02d 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -129,7 +129,7 @@ the intersection tests and intersection computations
 for polyhedral boundary surfaces. This parameter has to be instantiated
 with a model of the concept `IntersectionGeometricTraits_3`.
 
-@todo Document TriangleAccessor as it was template parameter. What about the two others?
+@todo Comment TriangleAccessor as well as the others
 
 \cgalModels `MeshDomain_3`
 
@@ -139,11 +139,14 @@ with a model of the concept `IntersectionGeometricTraits_3`.
 */
 
 
-template<class Polyhedron,/*FaceGraph*/
-         class IGT_,
-         class TriangleAccessor = CGAL::Default,
-         class Patch_id_ = void,
-         class Use_exact_intersection_construction_tag = CGAL::Tag_true>
+template<class Polyhedron /*FaceGraph*/
+         ,class IGT_
+#ifndef DOXYGEN_RUNNING
+         ,class TriangleAccessor = CGAL::Default
+         ,class Patch_id_ = void
+         ,class Use_exact_intersection_construction_tag = CGAL::Tag_true
+#endif
+         >
 class Polyhedral_mesh_domain_3
 {
 public:
@@ -290,9 +293,6 @@ class Polyhedral_mesh_domain_3
   }
 
   /*!
-   * @todo was not in doxygen
-   * Constructor.
-   *
    * Constructor from a sequence of polyhedral surfaces, and a bounding
    * polyhedral surface.
    *
@@ -329,9 +329,6 @@ class Polyhedral_mesh_domain_3
   }
 
   /*!
-   * @todo was not in doxygen
-   * Constructor.
-   *
    * Constructor from a sequence of polyhedral surfaces, without bounding
    * surface. The domain will always answer `false` to `is_in_domain()`
    * queries.
@@ -360,7 +357,7 @@ class Polyhedral_mesh_domain_3
     bounding_tree_ = 0;
   }
 
-  /// Destructor
+  // Destructor
   ~Polyhedral_mesh_domain_3() {
     if(bounding_tree_ != 0 && bounding_tree_ != &tree_) {
       delete bounding_tree_;
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index 0d01d4159222..41fc06a2207f 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -88,13 +88,13 @@ instantiated with a model of the concept
 \sa `CGAL::Mesh_polyhedron_3<IGT>`
 */
 template < class IGT_,
-           class Polyhedron_ = typename Mesh_polyhedron_3<IGT_>::type,
+           class Polyhedron = typename Mesh_polyhedron_3<IGT_>::type,
            class TriangleAccessor= CGAL::Default,
            class Patch_id=int,
            class Use_exact_intersection_construction_tag = Tag_true >
 class Polyhedral_mesh_domain_with_features_3
   : public Mesh_domain_with_polyline_features_3<
-      Polyhedral_mesh_domain_3< Polyhedron_,
+      Polyhedral_mesh_domain_3< Polyhedron,
                                 IGT_,
                                 TriangleAccessor,
                                 Patch_id,
@@ -102,7 +102,7 @@ class Polyhedral_mesh_domain_with_features_3
 {
   typedef Mesh_domain_with_polyline_features_3<
     Polyhedral_mesh_domain_3<
-      Polyhedron_, IGT_, TriangleAccessor,
+      Polyhedron, IGT_, TriangleAccessor,
       Patch_id, Use_exact_intersection_construction_tag > > Base;
 
   typedef boost::adjacency_list<
@@ -112,7 +112,7 @@ class Polyhedral_mesh_domain_with_features_3
     typename IGT_::Point_3,
     std::set<typename Base::Surface_patch_index> > Featured_edges_copy_graph;
 public:
-  typedef Polyhedron_ Polyhedron;
+  typedef Polyhedron Polyhedron;
   typedef Polyhedron Polyhedron_type;
 
   // Index types
@@ -166,8 +166,11 @@ class Polyhedral_mesh_domain_with_features_3
     The polyhedron `bounding_polyhedron` has to be closed and free of intersections.
     Its interior of `bounding_polyhedron` will be meshed.
   */
-  Polyhedral_mesh_domain_with_features_3(const Polyhedron& bounding_polyhedron,
-                                         CGAL::Random* p_rng = nullptr)
+  Polyhedral_mesh_domain_with_features_3(const Polyhedron& bounding_polyhedron
+#ifndef DOXYGEN_RUNNING
+                                         ,CGAL::Random* p_rng = nullptr
+#endif
+                                         )
     : Base(p_rng) , borders_detected_(false)
   {
     stored_polyhedra.resize(1);
@@ -184,13 +187,17 @@ class Polyhedral_mesh_domain_with_features_3
     constructor above.
   */
   CGAL_DEPRECATED
-  Polyhedral_mesh_domain_with_features_3(const std::string& filename,
-                                         CGAL::Random* p_rng = nullptr)
+  Polyhedral_mesh_domain_with_features_3(const std::string& filename
+#ifndef DOXYGEN_RUNNING
+                                         ,CGAL::Random* p_rng = nullptr
+#endif
+                                         )
     : Base(p_rng) , borders_detected_(false)
   {
     load_from_file(filename.c_str());
   }
 
+#ifndef DOXYGEN_RUNNING
   // The following is needed, because otherwise, when a "const char*" is
   // passed, the constructors templates are a better match, than the
   // constructor with `std::string`.
@@ -201,6 +208,7 @@ class Polyhedral_mesh_domain_with_features_3
   {
     load_from_file(filename);
   }
+#endif
 #endif // not CGAL_NO_DEPRECATED_CODE
 
   /*!
@@ -210,9 +218,12 @@ class Polyhedral_mesh_domain_with_features_3
     Using this constructor enables to mesh a polyhedral surface which is not closed, or has holes.
     The inside of `bounding_polyhedron` will be meshed.
   */
-  Polyhedral_mesh_domain_with_features_3(const Polyhedron& polyhedron,
-                                         const Polyhedron& bounding_polyhedron,
-                                         CGAL::Random* p_rng = nullptr)
+  Polyhedral_mesh_domain_with_features_3(const Polyhedron& polyhedron
+                                         ,const Polyhedron& bounding_polyhedron
+#ifndef DOXYGEN_RUNNING
+                                         ,CGAL::Random* p_rng = nullptr
+#endif
+                                         )
     : Base(p_rng) , borders_detected_(false)
   {
     stored_polyhedra.resize(2);
@@ -287,15 +298,16 @@ class Polyhedral_mesh_domain_with_features_3
 
   /*!
     Detects sharp features and boundaries of the internal bounding polyhedron (and the potential internal polyhedron)
-    and inserts them as features of the domain. `angle_bound` gives the maximum
+    and inserts them as features of the domain.
+    @param angle_bound gives the maximum
     angle (in degrees) between the two normal vectors of adjacent triangles.
     For an edge of the polyhedron, if the angle between the two normal vectors of its
     incident facets is bigger than the given bound, then the edge is considered as
     a feature edge.
   */
-  void detect_features(FT angle_in_degree = FT(60))
+  void detect_features(FT angle_bound = FT(60))
   {
-    detect_features(angle_in_degree, stored_polyhedra);
+    detect_features(angle_bound, stored_polyhedra);
   }
 
   void detect_borders(std::vector<Polyhedron>& p);

From 1b4d4e0eb07edaf31eea75cac9c8bd72a9bb15e1 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 22 May 2023 12:49:33 +0100
Subject: [PATCH 0297/1398] various

---
 Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
index da495b895a3d..952d4fc2187c 100644
--- a/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
@@ -118,6 +118,7 @@ Labeled_image_mesh_domain_3
 
   /*!
     Construction from an image.
+    @param image the image
     @param error_bound is relative to the size of the image.
   */
   Labeled_image_mesh_domain_3(const Image& image

From 710219ed6d4be7d8d9742ce84b69e409a542fda0 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 22 May 2023 13:12:46 +0100
Subject: [PATCH 0298/1398] various

---
 Mesh_3/include/CGAL/Mesh_cell_criteria_3.h    |  1 -
 .../CGAL/Polyhedral_complex_mesh_domain_3.h   | 11 +++++++---
 .../include/CGAL/Polyhedral_mesh_domain_3.h   | 11 +++++-----
 .../Polyhedral_mesh_domain_with_features_3.h  | 21 ++++++++++++-------
 4 files changed, 26 insertions(+), 18 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
index 2b8331a7b644..09ccdd883578 100644
--- a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
@@ -72,7 +72,6 @@ class Mesh_cell_criteria_3
   typedef Mesh_3::Criteria<Tr,Visitor> Criteria;
 
   typedef typename Tr::Cell_handle Cell_handle;
-  typedef typename Tr::Geom_traits::FT FT;
 
   typedef Mesh_cell_criteria_3<Tr> Self;
 
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index ca0ed7f8fc37..98a766c97142 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -85,7 +85,7 @@ surface, the sub-domain indices on both sides are known.
 \tparam Polyhedron stands for the type of the input polyhedral surface(s),
 model of `FaceListGraph`.
 
-\tparam IGT stands for a geometric traits class
+\tparam IGT_ stands for a geometric traits class
 providing the types and functors required to implement
 the intersection tests and intersection computations
 for polyhedral boundary surfaces. This parameter has to be instantiated
@@ -99,10 +99,15 @@ with a model of the concept `IntersectionGeometricTraits_3`.
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
 \sa `CGAL::Mesh_polyhedron_3<IGT>`
 */
+#ifdef DOXYGEN_RUNNING
+template < class IGT,
+           class Polyhedron = typename Mesh_polyhedron_3<IGT_>::type,
+           class TriangleAccessor=CGAL::Default>
+#else
 template < class IGT_,
            class Polyhedron = typename Mesh_polyhedron_3<IGT_>::type,
-           class TriangleAccessor=CGAL::Default
-           >
+           class TriangleAccessor=CGAL::Default>
+#endif
 class Polyhedral_complex_mesh_domain_3
   : public Mesh_domain_with_polyline_features_3<
       Polyhedral_mesh_domain_3< Polyhedron,
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 394ec07be02d..4dc89cf407ec 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -129,8 +129,6 @@ the intersection tests and intersection computations
 for polyhedral boundary surfaces. This parameter has to be instantiated
 with a model of the concept `IntersectionGeometricTraits_3`.
 
-@todo Comment TriangleAccessor as well as the others
-
 \cgalModels `MeshDomain_3`
 
 \sa `IntersectionGeometricTraits_3`
@@ -138,15 +136,16 @@ with a model of the concept `IntersectionGeometricTraits_3`.
 
 */
 
-
+#ifdef DOXYGEN_RUNNING
+template<class Polyhedron /*FaceGraph*/
+         ,class IGT>
+#else
 template<class Polyhedron /*FaceGraph*/
          ,class IGT_
-#ifndef DOXYGEN_RUNNING
          ,class TriangleAccessor = CGAL::Default
          ,class Patch_id_ = void
-         ,class Use_exact_intersection_construction_tag = CGAL::Tag_true
+         ,class Use_exact_intersection_construction_tag = CGAL::Tag_true>
 #endif
-         >
 class Polyhedral_mesh_domain_3
 {
 public:
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index 41fc06a2207f..99c4123eead3 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -87,14 +87,19 @@ instantiated with a model of the concept
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
 \sa `CGAL::Mesh_polyhedron_3<IGT>`
 */
-template < class IGT_,
-           class Polyhedron = typename Mesh_polyhedron_3<IGT_>::type,
-           class TriangleAccessor= CGAL::Default,
-           class Patch_id=int,
-           class Use_exact_intersection_construction_tag = Tag_true >
+#ifdef DOXYGEN_RUNNING
+template < class IGT
+           ,class Polyhedron = typename Mesh_polyhedron_3<IGT_>::type>
+#else
+template < class IGT_
+           ,class Polyhedron_ = typename Mesh_polyhedron_3<IGT_>::type
+           ,class TriangleAccessor= CGAL::Default
+           ,class Patch_id=int
+           ,class Use_exact_intersection_construction_tag = Tag_true>
+#endif
 class Polyhedral_mesh_domain_with_features_3
   : public Mesh_domain_with_polyline_features_3<
-      Polyhedral_mesh_domain_3< Polyhedron,
+      Polyhedral_mesh_domain_3< Polyhedron_,
                                 IGT_,
                                 TriangleAccessor,
                                 Patch_id,
@@ -102,7 +107,7 @@ class Polyhedral_mesh_domain_with_features_3
 {
   typedef Mesh_domain_with_polyline_features_3<
     Polyhedral_mesh_domain_3<
-      Polyhedron, IGT_, TriangleAccessor,
+      Polyhedron_, IGT_, TriangleAccessor,
       Patch_id, Use_exact_intersection_construction_tag > > Base;
 
   typedef boost::adjacency_list<
@@ -112,7 +117,7 @@ class Polyhedral_mesh_domain_with_features_3
     typename IGT_::Point_3,
     std::set<typename Base::Surface_patch_index> > Featured_edges_copy_graph;
 public:
-  typedef Polyhedron Polyhedron;
+  typedef Polyhedron_ Polyhedron;
   typedef Polyhedron Polyhedron_type;
 
   // Index types

From 585dc0f42458bd3b4e8225353de76af763dee2e0 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 22 May 2023 13:36:24 +0100
Subject: [PATCH 0299/1398] various

---
 Mesh_3/doc/Mesh_3/Doxyfile.in                               | 1 +
 Mesh_3/doc/Mesh_3/PackageDescription.txt                    | 4 ++--
 Mesh_3/doc/Mesh_3/dependencies                              | 2 +-
 Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h | 2 +-
 Mesh_3/include/CGAL/Labeled_mesh_domain_3.h                 | 4 ++--
 Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h      | 4 ++--
 Mesher_level/include/CGAL/Mesh_optimization_return_code.h   | 5 ++++-
 7 files changed, 13 insertions(+), 9 deletions(-)

diff --git a/Mesh_3/doc/Mesh_3/Doxyfile.in b/Mesh_3/doc/Mesh_3/Doxyfile.in
index b7f0fd996208..86ae0b5b5b42 100644
--- a/Mesh_3/doc/Mesh_3/Doxyfile.in
+++ b/Mesh_3/doc/Mesh_3/Doxyfile.in
@@ -9,6 +9,7 @@ WARN_IF_UNDOCUMENTED       =  false
 ALIASES += "cgalDescribePolylineType=A polyline is defined as a sequence of points, each pair of contiguous points defines a segment of the polyline. If the first and last points of the polyline are identical, the polyline is closed."
 
 INPUT += \
+      ${CGAL_Mesher_level_INCLUDE_DIR}/CGAL/Mesh_optimization_return_code.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_triangulation_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_polyhedron_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_mesh_domain_3.h \
diff --git a/Mesh_3/doc/Mesh_3/PackageDescription.txt b/Mesh_3/doc/Mesh_3/PackageDescription.txt
index 24a8d1786a30..3e907c426861 100644
--- a/Mesh_3/doc/Mesh_3/PackageDescription.txt
+++ b/Mesh_3/doc/Mesh_3/PackageDescription.txt
@@ -85,7 +85,7 @@ related to the template parameters of some models of the main concepts:
 
 \cgalCRPSection{Classes}
 
-- `CGAL::Mesh_triangulation_3<MD,Gt,Concurrency_tag,Vertex_base,Cell_base>`
+- `CGAL::Mesh_triangulation_3<MD,Gt,ConcurrencyTag,VertexBase,CellBase>`
 - `CGAL::Mesh_vertex_base_3<Gt,MD,Vb>`
 - `CGAL::Compact_mesh_cell_base_3<Gt,MD,Tds>`
 - `CGAL::Mesh_cell_base_3<Gt,MD,Cb>`
@@ -102,7 +102,7 @@ and their associated classes:
 - `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
 - `CGAL::Polyhedral_mesh_domain_with_features_3<IGT>`
 - `CGAL::Polyhedral_complex_mesh_domain_3<IGT>`
-- `CGAL::Mesh_domain_with_polyline_features_3<MeshDomain_3>`
+- `CGAL::Mesh_domain_with_polyline_features_3<MD>`
 - `CGAL::Mesh_polyhedron_3<IGT>`
 - `CGAL::Triangle_accessor_3<CGAL::Polyhedron_3<K>,K>`
 - `CGAL::Implicit_multi_domain_to_labeling_function_wrapper<ImplicitFunction>`
diff --git a/Mesh_3/doc/Mesh_3/dependencies b/Mesh_3/doc/Mesh_3/dependencies
index be614f85b311..5f5120071393 100644
--- a/Mesh_3/doc/Mesh_3/dependencies
+++ b/Mesh_3/doc/Mesh_3/dependencies
@@ -12,6 +12,6 @@ TDS_3
 Polyhedron
 Miscellany
 Mesh_2
+Mesher_level
 Polygon_mesh_processing
 SMDS_3
-
diff --git a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
index cc4e8c96c9ea..8c1c880cb708 100644
--- a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
+++ b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
@@ -161,7 +161,7 @@ The second one matches the locus of points satisfying f1(p)>0 and f2(p)<0 and f3
 This parameter stands for a model of the concept `ImplicitFunction` described in the surface mesh generation package.
 The number types `ImplicitFunction::FT` and `BGT::FT` are required to match.
 
-\sa `Labeled_mesh_domain_3`.
+\sa `CGAL::Labeled_mesh_domain_3`.
 
 */
 
diff --git a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
index 6e810c060c4d..3782f9d46f47 100644
--- a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
@@ -340,8 +340,8 @@ The function type can be any model of the concept `Callable` compatible with the
 
 \cgalModels `MeshDomain_3`
 
-\sa `Implicit_multi_domain_to_labeling_function_wrapper`
-\sa `CGAL::make_mesh_3()`.
+\sa `CGAL::Implicit_multi_domain_to_labeling_function_wrapper`
+\sa `CGAL::make_mesh_3()`
 
 */
 template<class BGT,
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 98a766c97142..8a284018e136 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -94,8 +94,8 @@ with a model of the concept `IntersectionGeometricTraits_3`.
 \cgalModels `MeshDomainWithFeatures_3`
 
 \sa `IntersectionGeometricTraits_3`
-\sa `CGAL::make_mesh_3()`.
-\sa `CGAL::Mesh_domain_with_polyline_features_3<MeshDomain>`
+\sa `CGAL::make_mesh_3()`
+\sa `CGAL::Mesh_domain_with_polyline_features_3<MD>`
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
 \sa `CGAL::Mesh_polyhedron_3<IGT>`
 */
diff --git a/Mesher_level/include/CGAL/Mesh_optimization_return_code.h b/Mesher_level/include/CGAL/Mesh_optimization_return_code.h
index 4717055c5303..3643395667c2 100644
--- a/Mesher_level/include/CGAL/Mesh_optimization_return_code.h
+++ b/Mesher_level/include/CGAL/Mesh_optimization_return_code.h
@@ -18,7 +18,10 @@
 #define CGAL_MESH_OPTIMIZATION_RETURN_CODE_H
 
 namespace CGAL {
-
+  /*!
+   * \brief bla bla
+   @todo  document correctly
+   */
 enum Mesh_optimization_return_code
 {
   MESH_OPTIMIZATION_UNKNOWN_ERROR=-1,

From 95f150a16ce6cc0bf8eea69470d3ed64b0351153 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 22 May 2023 16:51:33 +0100
Subject: [PATCH 0300/1398] various

---
 .../CGAL/Polyhedral_complex_mesh_domain_3.h        | 14 +++++++++-----
 .../CGAL/Polyhedral_mesh_domain_with_features_3.h  |  6 +++++-
 2 files changed, 14 insertions(+), 6 deletions(-)

diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 8a284018e136..8550178efb4a 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -101,24 +101,28 @@ with a model of the concept `IntersectionGeometricTraits_3`.
 */
 #ifdef DOXYGEN_RUNNING
 template < class IGT,
-           class Polyhedron = typename Mesh_polyhedron_3<IGT_>::type,
+           class Polyhedron = typename Mesh_polyhedron_3<IGT>::type,
            class TriangleAccessor=CGAL::Default>
+class Polyhedral_complex_mesh_domain_3
+  : public Mesh_domain_with_polyline_features_3<
+      Polyhedral_mesh_domain_3< Polyhedron,
+                                IGT>
 #else
 template < class IGT_,
-           class Polyhedron = typename Mesh_polyhedron_3<IGT_>::type,
+           class Polyhedron_ = typename Mesh_polyhedron_3<IGT_>::type,
            class TriangleAccessor=CGAL::Default>
-#endif
 class Polyhedral_complex_mesh_domain_3
   : public Mesh_domain_with_polyline_features_3<
-      Polyhedral_mesh_domain_3< Polyhedron,
+      Polyhedral_mesh_domain_3< Polyhedron_,
                                 IGT_,
                                 CGAL::Default,
                                 int,   //Use_patch_id_tag
                                 Tag_true > >//Use_exact_intersection_tag
+#endif
 {
 public:
   /// The base class
-  typedef Polyhedron Polyhedron;
+  typedef Polyhedron_ Polyhedron;
   typedef Mesh_domain_with_polyline_features_3<
     Polyhedral_mesh_domain_3<
       Polyhedron, IGT_, CGAL::Default,
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index 99c4123eead3..8361c3edd2b4 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -90,13 +90,16 @@ instantiated with a model of the concept
 #ifdef DOXYGEN_RUNNING
 template < class IGT
            ,class Polyhedron = typename Mesh_polyhedron_3<IGT_>::type>
+class Polyhedral_mesh_domain_with_features_3
+  : public Mesh_domain_with_polyline_features_3<
+      Polyhedral_mesh_domain_3< Polyhedron,
+                                IGT> >
 #else
 template < class IGT_
            ,class Polyhedron_ = typename Mesh_polyhedron_3<IGT_>::type
            ,class TriangleAccessor= CGAL::Default
            ,class Patch_id=int
            ,class Use_exact_intersection_construction_tag = Tag_true>
-#endif
 class Polyhedral_mesh_domain_with_features_3
   : public Mesh_domain_with_polyline_features_3<
       Polyhedral_mesh_domain_3< Polyhedron_,
@@ -104,6 +107,7 @@ class Polyhedral_mesh_domain_with_features_3
                                 TriangleAccessor,
                                 Patch_id,
                                 Use_exact_intersection_construction_tag > >
+#endif
 {
   typedef Mesh_domain_with_polyline_features_3<
     Polyhedral_mesh_domain_3<

From 78ab4fab704560c0ae8806716d7917e94349423f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 22 May 2023 18:24:06 +0200
Subject: [PATCH 0301/1398] add special cases for header only packages

---
 Documentation/doc/CMakeLists.txt | 9 +++++++++
 Mesh_3/doc/Mesh_3/dependencies   | 1 -
 2 files changed, 9 insertions(+), 1 deletion(-)

diff --git a/Documentation/doc/CMakeLists.txt b/Documentation/doc/CMakeLists.txt
index bec8ffbb22f3..13853e567353 100644
--- a/Documentation/doc/CMakeLists.txt
+++ b/Documentation/doc/CMakeLists.txt
@@ -402,6 +402,15 @@ else()
   endforeach()
 endif()
 
+#special cases
+foreach(pkg "Mesh_level")
+  if(CGAL_BRANCH_BUILD)
+    set(CGAL_${pkg}_INCLUDE_DIR "${CGAL_ROOT}/${pkg}/include")
+  else()
+    set(CGAL_${pkg}_INCLUDE_DIR "${CGAL_ROOT}/include")
+  endif()
+endforeach()
+
 option(CGAL_BUILD_THREE_DOC "Build the documentation of the Three package" OFF)
 
 if(NOT CGAL_BUILD_THREE_DOC)
diff --git a/Mesh_3/doc/Mesh_3/dependencies b/Mesh_3/doc/Mesh_3/dependencies
index 5f5120071393..c8703db07823 100644
--- a/Mesh_3/doc/Mesh_3/dependencies
+++ b/Mesh_3/doc/Mesh_3/dependencies
@@ -12,6 +12,5 @@ TDS_3
 Polyhedron
 Miscellany
 Mesh_2
-Mesher_level
 Polygon_mesh_processing
 SMDS_3

From 79ce772e71f56f7bfac7aba96a6c74d0cc2a7a58 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 22 May 2023 18:46:09 +0100
Subject: [PATCH 0302/1398] various

---
 Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h     |  3 ++-
 Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h     |  2 +-
 Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h | 10 +++++-----
 Mesh_3/include/CGAL/Implicit_mesh_domain_3.h    | 17 +++++++----------
 Mesh_3/include/CGAL/Mesh_cell_criteria_3.h      |  2 +-
 .../include/CGAL/Mesh_constant_domain_field_3.h | 14 +++++++-------
 Mesh_3/include/CGAL/Mesh_edge_criteria_3.h      |  2 +-
 Mesh_3/include/CGAL/Mesh_facet_criteria_3.h     |  4 ++--
 .../CGAL/Polyhedral_complex_mesh_domain_3.h     |  2 +-
 .../include/CGAL/Sizing_field_with_aabb_tree.h  | 14 +++++++-------
 10 files changed, 34 insertions(+), 36 deletions(-)

diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
index ea4a1f33ea38..07cd4f12acdc 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
@@ -16,9 +16,10 @@ The concept `MeshCriteria_3` encapsulates these concepts.
 
 \sa `MeshFacetCriteria_3`
 \sa `MeshCellCriteria_3`
+\sa `MeshCriteriaWithFeatures_3`
 \sa `CGAL::make_mesh_3()`
 \sa `CGAL::refine_mesh_3()`
-\sa `MeshCriteriaWithFeatures_3`
+
 
 */
 
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h
index bfe6e4b8d982..b2a0fb4fa9c2 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h
@@ -2,7 +2,7 @@
 \ingroup PkgMesh3SecondaryConcepts
 \cgalConcept
 
-The concept `MeshPolyline_3` implements a container of points designed to represent a polyline (i.e.\ a sequence of points).
+The concept `MeshPolyline_3` implements a container of points designed to represent a polyline (i.e., a sequence of points).
 Types and functions provided in this concept are such as standard template library containers
 are natural models of this concept.
 
diff --git a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
index 03f9ff4880ad..958e64ea360d 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
@@ -19,19 +19,19 @@ class TriangleAccessor_3 {
 /// @{
 
 /*!
-Triangle type. Must be a model of DefaultConstructible and
-CopyConstructible.
+Triangle type. Must be a model of `DefaultConstructible` and
+`CopyConstructible`.
 */
 typedef unspecified_type Triangle_3;
 
 /*!
-Triangle iterator type. Must be a model of InputIterator.
+Triangle iterator type. Must be a model of `InputIterator`.
 */
 typedef unspecified_type Triangle_iterator;
 
 /*!
-Handle to a `Triangle_3`. Must be
-constructible from `Triangle_iterator`. It may be `Triangle_Iterator` itself.
+%Handle to a `Triangle_3`. Must be
+constructible from `Triangle_iterator`. It may be `Triangle_iterator` itself.
 */
 typedef unspecified_type Triangle_handle;
 
diff --git a/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h b/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
index 59ad97066501..b8c1d72e0bd4 100644
--- a/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
@@ -75,9 +75,12 @@ is a relative error bound expressed as a ratio to the bounding sphere radius.
 \sa `CGAL::make_mesh_3()`.
 
 */
-template<class Function_,
-  class BGT,
-  class Wrapper = Implicit_to_labeling_function_wrapper<Function_,BGT> >
+template<class Function_
+         ,class BGT
+#ifndef DOXYGEN_RUNNING
+         ,class Wrapper = Implicit_to_labeling_function_wrapper<Function_,BGT>
+#endif
+         >
 class
 CGAL_DEPRECATED_MSG
 ( "The class template `CGAL::Implicit_mesh_domain_3` is now deprecated. "
@@ -95,12 +98,6 @@ Implicit_mesh_domain_3
   typedef typename Base::FT FT;
   typedef BGT Geom_traits;
 
-  /**
-   * Constructor
-   * @param f the function which negative values defines the domain
-   * @param bounding_sphere a bounding sphere of the domain
-   * @param error_bound the error bound relative to the sphere radius
-   */
   /// \name Creation
   /// @{
 
@@ -131,7 +128,7 @@ Implicit_mesh_domain_3
 
   /// @}
 
-  /// Destructor
+  // Destructor
   virtual ~Implicit_mesh_domain_3() {}
 
   using Base::bbox;
diff --git a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
index 09ccdd883578..eab9f7944409 100644
--- a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
@@ -145,7 +145,7 @@ class Mesh_cell_criteria_3
 
   /// @}
 
-  /// Destructor
+  // Destructor
   ~Mesh_cell_criteria_3() { }
 
   /**
diff --git a/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h b/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
index fc5ea3f7538a..46b23a408c3e 100644
--- a/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
+++ b/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
@@ -37,7 +37,7 @@ namespace CGAL {
 * a piecewise constant field, i.e. a sizing field with a constant size on each subpart
 * of the domain.
 *
-* @tparam Gt is the geometric traits class. It must match the type `Triangulation::Geom_traits`,
+* @tparam GT is the geometric traits class. It must match the type `Triangulation::Geom_traits`,
 * where `Triangulation` is the nested type of the model of `MeshComplex_3InTriangulation_3` used
 * in the meshing process.
 *
@@ -46,7 +46,7 @@ namespace CGAL {
 *
 * @cgalModels `MeshDomainField_3`
 */
-template <typename Gt, typename Index_>
+template <typename GT, typename Index_>
 class Mesh_constant_domain_field_3
 {
 public:
@@ -56,19 +56,19 @@ class Mesh_constant_domain_field_3
   /*!
   * Numerical type.
   */
-  typedef typename Gt::FT         FT;
+  typedef typename GT::FT         FT;
 
   /*!
 
   * Point type.
   */
 #ifdef DOXYGEN_RUNNING
-  typedef Gt::Point_3 Point_3;
+  typedef GT::Point_3 Point_3;
 #else
   typedef typename boost::mpl::eval_if_c<
-      internal::Has_nested_type_Bare_point<Gt>::value,
-      typename internal::Bare_point_type<Gt>,
-      boost::mpl::identity<typename Gt::Point_3>
+      internal::Has_nested_type_Bare_point<GT>::value,
+      typename internal::Bare_point_type<GT>,
+      boost::mpl::identity<typename GT::Point_3>
     >::type                       Point_3;
   #endif
 
diff --git a/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h b/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
index a297dd42e0f0..e7f3c4fa983b 100644
--- a/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
@@ -134,7 +134,7 @@ class Mesh_edge_criteria_3
   * break all the surface topology guarantees of the meshing algorithm.
   * It is not guaranteed to be exactly respected in the output mesh.
   *
-  * Note that if one parameter is set to 0, then its corresponding criterion is ignored.
+  * \note if one parameter is set to 0, then its corresponding criterion is ignored.
   */
   Mesh_edge_criteria_3(const FT& length_bound,
                        const FT& min_length_bound = 0)
diff --git a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
index d35f24e024f8..b35a7e78f95b 100644
--- a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
@@ -43,11 +43,11 @@ namespace CGAL {
 
   \cgalModels `MeshFacetCriteria_3`
 
-  \sa `CGAL::Mesh_facet_topology`
   \sa `MeshCriteria_3`
   \sa `MeshFacetCriteria_3`
-  \sa `CGAL::Mesh_criteria_3<Tr>`
   \sa `MeshDomainField_3`
+  \sa `CGAL::Mesh_facet_topology`
+  \sa `CGAL::Mesh_criteria_3<Tr>`
   \sa `CGAL::make_mesh_3()`
 
 */
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 8550178efb4a..5f707903fbba 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -106,7 +106,7 @@ template < class IGT,
 class Polyhedral_complex_mesh_domain_3
   : public Mesh_domain_with_polyline_features_3<
       Polyhedral_mesh_domain_3< Polyhedron,
-                                IGT>
+                                IGT> >
 #else
 template < class IGT_,
            class Polyhedron_ = typename Mesh_polyhedron_3<IGT_>::type,
diff --git a/Mesh_3/include/CGAL/Sizing_field_with_aabb_tree.h b/Mesh_3/include/CGAL/Sizing_field_with_aabb_tree.h
index b3a0379c989e..1104b45322ed 100644
--- a/Mesh_3/include/CGAL/Sizing_field_with_aabb_tree.h
+++ b/Mesh_3/include/CGAL/Sizing_field_with_aabb_tree.h
@@ -52,7 +52,7 @@ namespace CGAL {
 * protecting ball will intersect a surface patch to which the
 * corresponding vertex does not belong.
 *
-* @tparam GeomTraits is the geometric traits class. It must match the type `Triangulation::Geom_traits`,
+* @tparam GT is the geometric traits class. It must match the type `Triangulation::Geom_traits`,
 * where `Triangulation` is the nested type of the model of `MeshComplex_3InTriangulation_3` used
 * in the meshing process.
 * @tparam MeshDomain is the type of the domain. It must be a model of `MeshDomainWithFeatures_3`,
@@ -61,7 +61,7 @@ namespace CGAL {
 
 * @cgalModels `MeshDomainField_3`
 */
-template <typename GeomTraits,
+template <typename GT,
           typename MeshDomain
 #ifndef DOXYGEN_RUNNING
         , typename Input_facets_AABB_tree_ = CGAL::Default
@@ -71,8 +71,8 @@ template <typename GeomTraits,
           >
 struct Sizing_field_with_aabb_tree
 {
-  using FT      = typename GeomTraits::FT;
-  using Point_3 = typename GeomTraits::Point_3;
+  using FT      = typename GT::FT;
+  using Point_3 = typename GT::Point_3;
   using Index   = typename MeshDomain::Index;
 
 private:
@@ -89,7 +89,7 @@ struct Sizing_field_with_aabb_tree
   typedef std::vector<Patches_ids> Corners_incident_patches;
   typedef std::vector<Patches_ids> Curves_incident_patches;
 
-  typedef GeomTraits Kernel_;
+  typedef GT Kernel_;
   typedef CGAL::Delaunay_triangulation_3<Kernel_> Dt;
 
   using Input_facets_AABB_tree = typename CGAL::Default::Get<
@@ -532,8 +532,8 @@ struct Sizing_field_with_aabb_tree
       d_ptr->domain.curves_aabb_tree().traversal(p, curves_projection_traits);
 
       //Compute distance to the curve on which p lies
-      typedef typename GeomTraits::Segment_3                        Segment_3;
-      typedef typename GeomTraits::Plane_3                          Plane_3;
+      typedef typename GT::Segment_3                        Segment_3;
+      typedef typename GT::Plane_3                          Plane_3;
 
       const typename Input_curves_AABB_tree_::Point_and_primitive_id& ppid
         = d_ptr->domain.curves_aabb_tree().closest_point_and_primitive(p);

From c4d6c232181458655b3f7f83e112d7f2beb2fb59 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 23 May 2023 08:43:52 +0200
Subject: [PATCH 0303/1398] add macro

---
 Documentation/doc/resources/1.9.6/BaseDoxyfile.in | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index 5e86cb89cc18..6759b86cc65e 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -655,7 +655,9 @@ PREDEFINED             = DOXYGEN_RUNNING \
                          "CGAL_NP_CLASS_1=NamedParameters1" \
                          "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
                          "CGAL_NP_CLASS_2=NamedParameters2" \
-                         CGAL_DEPRECATED
+                         CGAL_DEPRECATED  \
+                         CGAL_DEPRECATED_MSG(name)=
+
 
 #---------------------------------------------------------------------------
 # Configuration options related to external references

From 0c29013c3d45cb49505127e1f69503bacbc7f087 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 23 May 2023 09:58:41 +0100
Subject: [PATCH 0304/1398] Polish

---
 .../doc/Mesh_3/Concepts/MeshCellCriteria_3.h  |  2 +-
 .../Concepts/MeshDomainWithFeatures_3.h       |  6 ++---
 Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h     |  2 +-
 .../doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h  |  2 +-
 .../doc/Mesh_3/Concepts/TriangleAccessor_3.h  |  5 ++--
 Mesh_3/include/CGAL/Triangle_accessor_3.h     | 25 +++++++++++--------
 6 files changed, 22 insertions(+), 20 deletions(-)

diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
index d3b0b83f0a64..242c25189b5a 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
@@ -26,7 +26,7 @@ class MeshCellCriteria_3 {
 /// @{
 
 /*!
-Handle type for the cells of the
+%Handle type for the cells of the
 triangulation. Must match the `Cell_handle` type in the
 triangulation type used by the mesh generation function.
 */
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
index 18e97b9a2753..8e91075c5814 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
@@ -17,7 +17,7 @@ between two ordered points on the same curve.
 
 \cgalRefines{MeshDomain_3}
 
-\cgalHasModel `CGAL::Mesh_domain_with_polyline_features_3<MeshDomain_3>`
+\cgalHasModel `CGAL::Mesh_domain_with_polyline_features_3<MD>`
 \cgalHasModel `CGAL::Polyhedral_mesh_domain_with_features_3<IGT>`
 
 \sa `MeshDomain_3`
@@ -47,7 +47,7 @@ Point type.
 typedef unspecified_type Point_3;
 
 /*!
-Type of indices for curves (i.e. \f$ 1\f$-dimensional features)
+Type of indices for curves (i.e., \f$ 1\f$-dimensional features)
 of the input domain.
 Must be a model of CopyConstructible, Assignable, DefaultConstructible and
 LessThanComparable. The default constructed value must be the value of an edge which
@@ -56,7 +56,7 @@ does not approximate a 1-dimensional feature of the input domain.
 typedef unspecified_type Curve_index;
 
 /*!
-Type of indices for corners (i.e.\f$ 0\f$--dimensional features)
+Type of indices for corners (i.e., \f$ 0\f$--dimensional features)
 of the input domain.
 Must be a model of CopyConstructible, Assignable, DefaultConstructible and
 LessThanComparable.
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
index 240f9b0f1fbf..929790c0d462 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
@@ -29,7 +29,7 @@ A segment, ray or line is said to intersect properly the domain boundary
 if it includes points which are strictly inside
 and strictly outside the domain (resp. the subdomain).
 
-\cgalHasModel `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
+\cgalHasModel `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT>`
 \cgalHasModel `CGAL::Labeled_mesh_domain_3<BGT>`
 
 \sa `MeshVertexBase_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
index 4c044751069f..50b9374fa983 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
@@ -46,7 +46,7 @@ typedef unspecified_type FT;
 
 /*!
 
-Returns the value of the sizing field (i.e.\ the maximum edge length) at point `p`.
+Returns the value of the sizing field (i.e., the maximum edge length) at point `p`.
 */
 FT sizing_field(const Point_3& p);
 
diff --git a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
index 958e64ea360d..5df33f35db1d 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
@@ -5,9 +5,8 @@
 The concept `TriangleAccessor_3` represents an accessor to a triangulated polyhedral
 surface, intersection free and without boundaries.
 
-\cgalHasModel `CGAL::Triangle_accessor_3<Polyhedron_3<K>,K>`
+\cgalHasModel `CGAL::Triangle_accessor_3<Polyhedron,,K>`
 
-\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
 \sa `CGAL::make_mesh_3()`
 
 */
@@ -36,7 +35,7 @@ constructible from `Triangle_iterator`. It may be `Triangle_iterator` itself.
 typedef unspecified_type Triangle_handle;
 
 /*!
-Polyhedron type.
+Polyhedron type which must be a model of `FaceGraph`.
 */
 typedef unspecified_type Polyhedron;
 
diff --git a/Mesh_3/include/CGAL/Triangle_accessor_3.h b/Mesh_3/include/CGAL/Triangle_accessor_3.h
index cba5e955c7dc..578833fd494a 100644
--- a/Mesh_3/include/CGAL/Triangle_accessor_3.h
+++ b/Mesh_3/include/CGAL/Triangle_accessor_3.h
@@ -37,23 +37,26 @@ class Triangle_accessor_3 {
 /*!
 \ingroup PkgMesh3Domains
 
-The class `Triangle_accessor_3` is a model for the concept `TriangleAccessor_3`. It is
-designed to serve as accessor for objects of type `Polyhedron_3<K>`.
+The class `Triangle_accessor_3` is a model for the concept
+`TriangleAccessor_3`. It is no longer used in the 3D Mesh
+Generation package, and it is only kept for backward compatibility.
 
-\attention Actually, the class `Triangle_accessor_3` is a partial specialization of the class
-template `template<typename Polyhedron, typename K>
-Triangle_accessor_3<Polyhedron, K>`. One may give another partial
-specialization of this class to handle one's own polyhedron data structure.
-
-@todo Document the other partial specializations
+\attention Actually, the class generic class template of
+`Triangle_accessor_3` must not be used. Partial specializations
+are provided for `CGAL::Polyhedron<K>` and `CGAL::Graph_with_descriptor_with_graph<Surface_mesh<K::Point_3>>`.
 
+\tparam Polyhdron must be model of FaceGraph
 \tparam K is the geometric traits class.
 
 \cgalModels `TriangleAccessor_3`
+*/
 
-\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
+#ifdef DOXYGEN_RUNNING
+template <typename Polyhedron, typename K>
+class Triangle_accessor_3
+{};
 
-*/
+#else
 template < class K,class Items,
            template < class T, class I, class A>
            class T_HDS,
@@ -142,7 +145,7 @@ class Triangle_accessor_3<Graph_with_descriptor_with_graph<Surface_mesh<P> >, K
     return Triangle_3(a,b,c);
   }
 };
-
+#endif
 
 } // end namespace CGAL
 

From a15956d231a5639cd850c6dde9f37891fdad1e25 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 24 May 2023 16:09:31 +0200
Subject: [PATCH 0305/1398] add clear function and input must mesh should be
 const in principle

---
 .../Non_manifold_feature_map.h                     | 14 +++++++++++---
 1 file changed, 11 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Non_manifold_feature_map.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Non_manifold_feature_map.h
index 8177a02d178b..e8901ebd727b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Non_manifold_feature_map.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Non_manifold_feature_map.h
@@ -28,8 +28,8 @@ struct Non_manifold_feature_map
   typedef typename Graph_traits::halfedge_descriptor halfedge_descriptor;
   typedef dynamic_edge_property_t<std::size_t> Edge_to_id_tag;
   typedef dynamic_vertex_property_t<std::size_t> Vertex_to_id_tag;
-  typedef typename boost::property_map<PolygonMesh, Edge_to_id_tag>::type Edge_to_nm_id;
-  typedef typename boost::property_map<PolygonMesh, Vertex_to_id_tag>::type Vertex_to_nm_id;
+  typedef typename boost::property_map<PolygonMesh, Edge_to_id_tag>::const_type Edge_to_nm_id;
+  typedef typename boost::property_map<PolygonMesh, Vertex_to_id_tag>::const_type Vertex_to_nm_id;
   Edge_to_nm_id e_nm_id;
   Vertex_to_nm_id v_nm_id;
   std::vector< std::vector<edge_descriptor> > non_manifold_edges;
@@ -39,7 +39,7 @@ struct Non_manifold_feature_map
   {}
 
   template <class Vpm>
-  Non_manifold_feature_map(PolygonMesh& pm, Vpm vpm)
+  Non_manifold_feature_map(const PolygonMesh& pm, Vpm vpm)
     : e_nm_id(get(Edge_to_id_tag(), pm))
     , v_nm_id(get(Vertex_to_id_tag(), pm))
   {
@@ -99,6 +99,14 @@ struct Non_manifold_feature_map
       }
     }
   }
+
+  void clear()
+  {
+    non_manifold_edges.clear();
+    non_manifold_vertices.clear();
+    e_nm_id = Edge_to_nm_id();
+    v_nm_id = Vertex_to_nm_id();
+  }
 };
 
 } } // end of CGAL::Polygon_mesh_processing

From 5d73a7addd778919f50b60b37d87e70886703035 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 25 May 2023 10:06:51 +0200
Subject: [PATCH 0306/1398] add TODOs for parallelism

---
 .../examples/Polygon_mesh_processing/CMakeLists.txt |  1 +
 .../CGAL/Polygon_mesh_processing/autorefinement.h   | 13 +++++++++----
 2 files changed, 10 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index d2faeb70cb28..306e216be408 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -120,6 +120,7 @@ if(TARGET CGAL::TBB_support)
   target_link_libraries(self_intersections_example PUBLIC CGAL::TBB_support)
   target_link_libraries(hausdorff_distance_remeshing_example PUBLIC CGAL::TBB_support)
   target_link_libraries(hausdorff_bounded_error_distance_example PUBLIC CGAL::TBB_support)
+  target_link_libraries(soup_autorefinement PUBLIC CGAL::TBB_support)
 
   create_single_source_cgal_program("corefinement_parallel_union_meshes.cpp")
   target_link_libraries(corefinement_parallel_union_meshes PUBLIC CGAL::TBB_support)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index e38f64ff3010..a46f2664803f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1116,7 +1116,7 @@ void autorefine_soup_output(const PointRange& input_points,
   typedef std::size_t Input_TID;
   typedef std::pair<Input_TID, Input_TID> Pair_of_triangle_ids;
 
-  std::vector<Pair_of_triangle_ids> si_pairs;
+  std::vector<Pair_of_triangle_ids> si_pairs; // TODO: check std::vector is fine with Parallel_tag
 
   // collect intersecting pairs of triangles
   CGAL_PMP_AUTOREFINE_VERBOSE("collect intersecting pairs");
@@ -1170,6 +1170,7 @@ void autorefine_soup_output(const PointRange& input_points,
   CGAL_PMP_AUTOREFINE_VERBOSE("compute intersections");
 
   std::set<std::pair<std::size_t, std::size_t> > intersecting_triangles;
+  //TODO: PARALLEL_FOR #2
   for (const Pair_of_triangle_ids& p : si_pairs)
   {
     int i1 = tri_inter_ids[p.first],
@@ -1217,6 +1218,7 @@ void autorefine_soup_output(const PointRange& input_points,
 
 #ifdef DEDUPLICATE_SEGMENTS
   // deduplicate inserted segments
+  //TODO: PARALLEL_FOR #3
   std::vector<std::vector<std::pair<std::size_t, std::size_t>>> all_segments_ids(all_segments.size());
   for(std::size_t ti=0; ti<triangles.size(); ++ti)
   {
@@ -1264,12 +1266,13 @@ void autorefine_soup_output(const PointRange& input_points,
 
   CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
   // now refine triangles
-  std::vector<std::array<EK::Point_3,3>> new_triangles;
+  std::vector<std::array<EK::Point_3,3>> new_triangles; // Need to be threadsafe
 
 #ifdef USE_PROGRESS_DISPLAY
   boost::timer::progress_display pd(triangles.size());
 #endif
 
+  //TODO: PARALLEL_FOR #1
   for(std::size_t ti=0; ti<triangles.size(); ++ti)
   {
     if (all_segments[ti].empty() && all_points[ti].empty())
@@ -1308,6 +1311,7 @@ void autorefine_soup_output(const PointRange& input_points,
   CGAL_PMP_AUTOREFINE_VERBOSE("create output soup");
 
   Cartesian_converter<EK, GT> to_input;
+  // TODO: reuse the fact that maps per triangle are already sorted
   std::map<EK::Point_3, std::size_t> point_id_map;
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
   std::vector<EK::Point_3> exact_soup_points;
@@ -1348,6 +1352,7 @@ void autorefine_soup_output(const PointRange& input_points,
   }
 
   // import refined triangles
+    //TODO: PARALLEL_FOR #4
   for (const std::array<EK::Point_3,3>& t : new_triangles)
   {
     soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
@@ -1355,11 +1360,11 @@ void autorefine_soup_output(const PointRange& input_points,
 
 #ifndef CGAL_NDEBUG
   CGAL_PMP_AUTOREFINE_VERBOSE("check soup");
-  CGAL_assertion( !does_triangle_soup_self_intersect(exact_soup_points, soup_triangles) );
+  CGAL_assertion( !does_triangle_soup_self_intersect<Concurrency_tag>(exact_soup_points, soup_triangles) );
 #else
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE
   CGAL_PMP_AUTOREFINE_VERBOSE("check soup");
-  if (does_triangle_soup_self_intersect(exact_soup_points, soup_triangles))
+  if (does_triangle_soup_self_intersect<Concurrency_tag>(exact_soup_points, soup_triangles))
     throw std::runtime_error("ERROR: invalid output, there is most probably a bug");
 #endif
 #endif

From bc45a0019425a03d5e31cbf993204ed95603e71e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 25 May 2023 12:08:01 +0200
Subject: [PATCH 0307/1398] Undocument TriangleAccessor_3 and
 CGAL::Triangle_accessor_3 as they are unused

---
 .../doc/Mesh_3/Concepts/TriangleAccessor_3.h  | 65 -------------------
 Mesh_3/doc/Mesh_3/Doxyfile.in                 |  1 -
 Mesh_3/doc/Mesh_3/PackageDescription.txt      |  1 -
 Mesh_3/include/CGAL/Triangle_accessor_3.h     | 25 -------
 4 files changed, 92 deletions(-)
 delete mode 100644 Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h

diff --git a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
deleted file mode 100644
index 5df33f35db1d..000000000000
--- a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
+++ /dev/null
@@ -1,65 +0,0 @@
-/*!
-\ingroup PkgMesh3SecondaryConcepts
-\cgalConcept
-
-The concept `TriangleAccessor_3` represents an accessor to a triangulated polyhedral
-surface, intersection free and without boundaries.
-
-\cgalHasModel `CGAL::Triangle_accessor_3<Polyhedron,,K>`
-
-\sa `CGAL::make_mesh_3()`
-
-*/
-
-class TriangleAccessor_3 {
-public:
-
-/// \name Types
-/// @{
-
-/*!
-Triangle type. Must be a model of `DefaultConstructible` and
-`CopyConstructible`.
-*/
-typedef unspecified_type Triangle_3;
-
-/*!
-Triangle iterator type. Must be a model of `InputIterator`.
-*/
-typedef unspecified_type Triangle_iterator;
-
-/*!
-%Handle to a `Triangle_3`. Must be
-constructible from `Triangle_iterator`. It may be `Triangle_iterator` itself.
-*/
-typedef unspecified_type Triangle_handle;
-
-/*!
-Polyhedron type which must be a model of `FaceGraph`.
-*/
-typedef unspecified_type Polyhedron;
-
-/// @}
-
-/// \name Operations
-/// @{
-
-/*!
-Returns a `Triangle_iterator` to visit the triangles of polyhedron `p`.
-*/
-Triangle_iterator triangles_begin(Polyhedron p);
-
-/*!
-Returns the past-the-end iterator for the above iterator.
-*/
-Triangle_iterator triangles_end(Polyhedron p);
-
-/*!
-Returns a `Triangle_3`
-object from handle `h`.
-*/
-Triangle_3 triangle(Triangle_handle h);
-
-/// @}
-
-}; /* end TriangleAccessor_3 */
diff --git a/Mesh_3/doc/Mesh_3/Doxyfile.in b/Mesh_3/doc/Mesh_3/Doxyfile.in
index 86ae0b5b5b42..741c77a18f5b 100644
--- a/Mesh_3/doc/Mesh_3/Doxyfile.in
+++ b/Mesh_3/doc/Mesh_3/Doxyfile.in
@@ -30,7 +30,6 @@ INPUT += \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/refine_mesh_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/make_mesh_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Labeled_mesh_domain_3.h \
-      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Triangle_accessor_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_criteria_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_constant_domain_field_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_cell_criteria_3.h \
diff --git a/Mesh_3/doc/Mesh_3/PackageDescription.txt b/Mesh_3/doc/Mesh_3/PackageDescription.txt
index 3e907c426861..c3b82d6b25bc 100644
--- a/Mesh_3/doc/Mesh_3/PackageDescription.txt
+++ b/Mesh_3/doc/Mesh_3/PackageDescription.txt
@@ -104,7 +104,6 @@ and their associated classes:
 - `CGAL::Polyhedral_complex_mesh_domain_3<IGT>`
 - `CGAL::Mesh_domain_with_polyline_features_3<MD>`
 - `CGAL::Mesh_polyhedron_3<IGT>`
-- `CGAL::Triangle_accessor_3<CGAL::Polyhedron_3<K>,K>`
 - `CGAL::Implicit_multi_domain_to_labeling_function_wrapper<ImplicitFunction>`
 - `CGAL::Implicit_mesh_domain_3<Function,BGT>` (deprecated)
 - `CGAL::Labeled_image_mesh_domain_3<Image,BGT>` (deprecated)
diff --git a/Mesh_3/include/CGAL/Triangle_accessor_3.h b/Mesh_3/include/CGAL/Triangle_accessor_3.h
index 578833fd494a..03c091ccdb42 100644
--- a/Mesh_3/include/CGAL/Triangle_accessor_3.h
+++ b/Mesh_3/include/CGAL/Triangle_accessor_3.h
@@ -33,30 +33,6 @@ class Triangle_accessor_3 {
   typedef typename Polyhedron::Error_bad_match Error_bad_match;
 };
 
-
-/*!
-\ingroup PkgMesh3Domains
-
-The class `Triangle_accessor_3` is a model for the concept
-`TriangleAccessor_3`. It is no longer used in the 3D Mesh
-Generation package, and it is only kept for backward compatibility.
-
-\attention Actually, the class generic class template of
-`Triangle_accessor_3` must not be used. Partial specializations
-are provided for `CGAL::Polyhedron<K>` and `CGAL::Graph_with_descriptor_with_graph<Surface_mesh<K::Point_3>>`.
-
-\tparam Polyhdron must be model of FaceGraph
-\tparam K is the geometric traits class.
-
-\cgalModels `TriangleAccessor_3`
-*/
-
-#ifdef DOXYGEN_RUNNING
-template <typename Polyhedron, typename K>
-class Triangle_accessor_3
-{};
-
-#else
 template < class K,class Items,
            template < class T, class I, class A>
            class T_HDS,
@@ -145,7 +121,6 @@ class Triangle_accessor_3<Graph_with_descriptor_with_graph<Surface_mesh<P> >, K
     return Triangle_3(a,b,c);
   }
 };
-#endif
 
 } // end namespace CGAL
 

From 13f804402789dfa8e97df003cdef069f5d998caf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 25 May 2023 14:56:16 +0200
Subject: [PATCH 0308/1398] Remove more (needless) doc appearances of
 TriangleAccessor

---
 Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h   | 2 +-
 Mesh_3/doc/Mesh_3/PackageDescription.txt                     | 3 +--
 Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h   | 2 +-
 Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h       | 5 ++---
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h | 2 +-
 5 files changed, 6 insertions(+), 8 deletions(-)

diff --git a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
index a1b35060f858..7583cc6957e1 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
@@ -12,7 +12,7 @@ and construction of intersections between segments and triangles.
 \cgalHasModel All models of the `Kernel` concept.
 
 \sa `BisectionGeometricTraits_3`
-\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
+\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT>`
 
 */
 class IntersectionGeometricTraits_3 {
diff --git a/Mesh_3/doc/Mesh_3/PackageDescription.txt b/Mesh_3/doc/Mesh_3/PackageDescription.txt
index c3b82d6b25bc..a2480bc71ac0 100644
--- a/Mesh_3/doc/Mesh_3/PackageDescription.txt
+++ b/Mesh_3/doc/Mesh_3/PackageDescription.txt
@@ -81,7 +81,6 @@ related to the template parameters of some models of the main concepts:
 - `MeshVertexBase_3`
 - `MeshDomainField_3`
 - `MeshPolyline_3`
-- `TriangleAccessor_3`
 
 \cgalCRPSection{Classes}
 
@@ -99,7 +98,7 @@ The following classes are models of domain concepts
 and their associated classes:
 
 - `CGAL::Labeled_mesh_domain_3<LabelingFunction,BGT>`
-- `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
+- `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT>`
 - `CGAL::Polyhedral_mesh_domain_with_features_3<IGT>`
 - `CGAL::Polyhedral_complex_mesh_domain_3<IGT>`
 - `CGAL::Mesh_domain_with_polyline_features_3<MD>`
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 9fa436fe842b..a4f81ce18124 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -532,7 +532,7 @@ It has to be a model of the `MeshDomain_3` concept.
 \sa `MeshDomain_3`
 \sa `MeshPolyline_3`
 \sa `CGAL::Implicit_mesh_domain_3<Function,BGT>`
-\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
+\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT>`
 \sa `CGAL::Labeled_image_mesh_domain_3<Image,BGT>`
 
 */
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 5f707903fbba..68687f526bec 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -96,13 +96,12 @@ with a model of the concept `IntersectionGeometricTraits_3`.
 \sa `IntersectionGeometricTraits_3`
 \sa `CGAL::make_mesh_3()`
 \sa `CGAL::Mesh_domain_with_polyline_features_3<MD>`
-\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
+\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT>`
 \sa `CGAL::Mesh_polyhedron_3<IGT>`
 */
 #ifdef DOXYGEN_RUNNING
 template < class IGT,
-           class Polyhedron = typename Mesh_polyhedron_3<IGT>::type,
-           class TriangleAccessor=CGAL::Default>
+           class Polyhedron = typename Mesh_polyhedron_3<IGT>::type>
 class Polyhedral_complex_mesh_domain_3
   : public Mesh_domain_with_polyline_features_3<
       Polyhedral_mesh_domain_3< Polyhedron,
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index 8361c3edd2b4..7c07b8a5ef21 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -84,7 +84,7 @@ instantiated with a model of the concept
 \cgalModels `MeshDomainWithFeatures_3`
 
 \sa `CGAL::Mesh_domain_with_polyline_features_3<MD>`
-\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
+\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT>`
 \sa `CGAL::Mesh_polyhedron_3<IGT>`
 */
 #ifdef DOXYGEN_RUNNING

From c3873374ceb18111f776a7e4ba983d61ed0fc38d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 25 May 2023 14:56:46 +0200
Subject: [PATCH 0309/1398] Carry the template parameter (as it should be if it
 were actually in use)

It is in fact CGAL::Default and unused everywhere, but it's clearer
this way.
---
 Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 68687f526bec..56fabd998135 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -114,7 +114,7 @@ class Polyhedral_complex_mesh_domain_3
   : public Mesh_domain_with_polyline_features_3<
       Polyhedral_mesh_domain_3< Polyhedron_,
                                 IGT_,
-                                CGAL::Default,
+                                TriangleAccessor,
                                 int,   //Use_patch_id_tag
                                 Tag_true > >//Use_exact_intersection_tag
 #endif
@@ -124,7 +124,7 @@ class Polyhedral_complex_mesh_domain_3
   typedef Polyhedron_ Polyhedron;
   typedef Mesh_domain_with_polyline_features_3<
     Polyhedral_mesh_domain_3<
-      Polyhedron, IGT_, CGAL::Default,
+      Polyhedron, IGT_, TriangleAccessor,
       int, Tag_true > > Base;
   /// @cond DEVELOPERS
 private:

From 6d3d60c6e27b1cab5939fdb50694007bfa5491fa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 25 May 2023 15:19:13 +0200
Subject: [PATCH 0310/1398] Do not document Mesh_3 classes' members that are
 not explicitely documented

---
 Mesh_3/doc/Mesh_3/Doxyfile.in | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Mesh_3/doc/Mesh_3/Doxyfile.in b/Mesh_3/doc/Mesh_3/Doxyfile.in
index 741c77a18f5b..70e7712b5745 100644
--- a/Mesh_3/doc/Mesh_3/Doxyfile.in
+++ b/Mesh_3/doc/Mesh_3/Doxyfile.in
@@ -3,6 +3,7 @@
 
 EXTRACT_ALL                =  false
 HIDE_UNDOC_CLASSES         =  true
+HIDE_UNDOC_MEMBERS         =  true
 WARN_IF_UNDOCUMENTED       =  false
 
 # macros to be used inside the code

From abad43a63db368aec51a5a0ec6b1fe918c082596 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 25 May 2023 15:19:36 +0200
Subject: [PATCH 0311/1398] Add missing doc dependency

---
 Mesh_3/doc/Mesh_3/dependencies | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Mesh_3/doc/Mesh_3/dependencies b/Mesh_3/doc/Mesh_3/dependencies
index c8703db07823..3219d3896f46 100644
--- a/Mesh_3/doc/Mesh_3/dependencies
+++ b/Mesh_3/doc/Mesh_3/dependencies
@@ -10,6 +10,7 @@ Triangulation_3
 Periodic_3_triangulation_3
 TDS_3
 Polyhedron
+Surface_mesh
 Miscellany
 Mesh_2
 Polygon_mesh_processing

From 525338eec262979fd676da4a53a120f18166239e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 26 May 2023 12:52:35 +0200
Subject: [PATCH 0312/1398] Haronize Gt/GT/etc.

---
 Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h   |  4 +-
 .../doc/Mesh_3/Concepts/MeshDomainField_3.h   |  2 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h |  2 +-
 Mesh_3/doc/Mesh_3/PackageDescription.txt      | 10 +--
 Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h     | 72 ++++++++---------
 .../Mesh_3/Cell_criteria_visitor_with_balls.h |  8 +-
 .../CGAL/Mesh_3/Detect_features_in_image.h    |  6 +-
 .../Facet_criteria_visitor_with_balls.h       | 12 +--
 Mesh_3/include/CGAL/Mesh_3/Lloyd_move.h       | 48 ++++++------
 .../CGAL/Mesh_3/Mesh_global_optimizer.h       | 50 ++++++------
 .../include/CGAL/Mesh_3/Mesh_sizing_field.h   | 16 ++--
 Mesh_3/include/CGAL/Mesh_3/Odt_move.h         | 28 +++----
 .../CGAL/Mesh_3/Protect_edges_sizing_field.h  | 36 ++++-----
 Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h  | 26 +++----
 Mesh_3/include/CGAL/Mesh_3/Sizing_grid.h      | 14 ++--
 Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h | 14 ++--
 Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h   | 24 +++---
 .../CGAL/Mesh_3/Triangle_accessor_primitive.h | 16 ++--
 .../CGAL/Mesh_3/Triangulation_helpers.h       | 32 ++++----
 .../CGAL/Mesh_3/Triangulation_sizing_field.h  | 22 +++---
 .../CGAL/Mesh_3/Uniform_sizing_field.h        |  4 +-
 ...tialize_triangulation_from_labeled_image.h | 12 +--
 .../CGAL/Mesh_3/mesh_standard_cell_criteria.h | 14 ++--
 .../Mesh_3/mesh_standard_facet_criteria.h     | 44 +++++------
 Mesh_3/include/CGAL/Mesh_3/sliver_criteria.h  |  8 +-
 .../include/CGAL/Mesh_3/vertex_perturbation.h | 78 +++++++++----------
 .../Mesh_domain_with_polyline_features_3.h    | 10 +--
 Mesh_3/include/CGAL/Mesh_edge_criteria_3.h    |  6 +-
 Mesh_3/include/CGAL/Mesh_triangulation_3.h    | 16 ++--
 .../include/CGAL/Polyhedral_mesh_domain_3.h   | 16 ++--
 Mesh_3/test/Mesh_3/test_criteria.cpp          |  4 +-
 Mesh_3/test/Mesh_3/test_mesh_3_issue_1554.cpp |  4 +-
 .../test/Mesh_3/test_meshing_polyhedron.cpp   |  6 +-
 .../test_meshing_polyhedron_with_features.cpp |  6 +-
 Mesh_3/test/Mesh_3/test_min_size_criteria.cpp |  6 +-
 35 files changed, 337 insertions(+), 339 deletions(-)

diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
index 028d9e70d9fe..68138d36775e 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
@@ -43,8 +43,8 @@ each cell (see below).
 
 \cgalRefines{SimplicialMeshCellBase_3,RegularTriangulationCellBaseWithWeightedCircumcenter_3,CopyConstructible}
 
-\cgalHasModel `CGAL::Compact_mesh_cell_base_3<Gt,MD,Tds>`
-\cgalHasModel `CGAL::Mesh_cell_base_3<Gt,MD,Cb>`
+\cgalHasModel `CGAL::Compact_mesh_cell_base_3<GT,MD,Tds>`
+\cgalHasModel `CGAL::Mesh_cell_base_3<GT,MD,Cb>`
 
 \sa `CGAL::make_mesh_3()`
 \sa `MeshDomain_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
index 644a3a46046b..c90469bf8354 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
@@ -5,7 +5,7 @@
 The concept `MeshDomainField_3` describes a scalar field which could be queried
 at any point of the space.
 
-\cgalHasModel `CGAL::Mesh_constant_domain_field_3<Gt,%Index>`
+\cgalHasModel `CGAL::Mesh_constant_domain_field_3<GT,%Index>`
 
 \sa `MeshDomain_3`
 \sa `MeshDomainWithFeatures_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
index 4739741b01c7..a80d9c5b28f4 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
@@ -22,7 +22,7 @@ each cell (see below).
 
 \cgalRefines{SimplicialMeshVertexBase_3,RegularTriangulationVertexBase_3,SurfaceMeshVertexBase_3}
 
-\cgalHasModel `CGAL::Mesh_vertex_base_3<Gt,MD,Vb>`
+\cgalHasModel `CGAL::Mesh_vertex_base_3<GT,MD,Vb>`
 
 \sa `CGAL::make_mesh_3()`
 \sa `CGAL::refine_mesh_3()`
diff --git a/Mesh_3/doc/Mesh_3/PackageDescription.txt b/Mesh_3/doc/Mesh_3/PackageDescription.txt
index a2480bc71ac0..bad6b7e691e1 100644
--- a/Mesh_3/doc/Mesh_3/PackageDescription.txt
+++ b/Mesh_3/doc/Mesh_3/PackageDescription.txt
@@ -84,15 +84,15 @@ related to the template parameters of some models of the main concepts:
 
 \cgalCRPSection{Classes}
 
-- `CGAL::Mesh_triangulation_3<MD,Gt,ConcurrencyTag,VertexBase,CellBase>`
-- `CGAL::Mesh_vertex_base_3<Gt,MD,Vb>`
-- `CGAL::Compact_mesh_cell_base_3<Gt,MD,Tds>`
-- `CGAL::Mesh_cell_base_3<Gt,MD,Cb>`
+- `CGAL::Mesh_triangulation_3<MD,GT,ConcurrencyTag,VertexBase,CellBase>`
+- `CGAL::Mesh_vertex_base_3<GT,MD,Vb>`
+- `CGAL::Compact_mesh_cell_base_3<GT,MD,Tds>`
+- `CGAL::Mesh_cell_base_3<GT,MD,Cb>`
 - `CGAL::Mesh_criteria_3<Tr>`
 - `CGAL::Mesh_cell_criteria_3<Tr>`
 - `CGAL::Mesh_facet_criteria_3<Tr>`
 - `CGAL::Mesh_edge_criteria_3<Tr>`
-- `CGAL::Mesh_constant_domain_field_3<Gt,%Index>`
+- `CGAL::Mesh_constant_domain_field_3<GT,%Index>`
 
 The following classes are models of domain concepts
 and their associated classes:
diff --git a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
index 6a15d8cce50c..a7826a3d56b4 100644
--- a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
+++ b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
@@ -378,10 +378,10 @@ template <typename Tr, typename Concurrency_tag>
 class C3T3_helpers_base
 {
 protected:
-  typedef typename Tr::Geom_traits          Gt;
+  typedef typename Tr::Geom_traits          GT;
   typedef typename Tr::Bare_point           Bare_point;
   typedef typename Tr::Weighted_point       Weighted_point;
-  typedef typename Gt::FT                   FT;
+  typedef typename GT::FT                   FT;
   typedef typename Tr::Vertex_handle        Vertex_handle;
   typedef typename Tr::Cell_handle          Cell_handle;
   typedef typename Tr::Facet                Facet;
@@ -450,7 +450,7 @@ template <typename Tr>
 class C3T3_helpers_base<Tr, Parallel_tag>
 {
 protected:
-  typedef typename Tr::Geom_traits          Gt;
+  typedef typename Tr::Geom_traits          GT;
   typedef typename Tr::Bare_point           Bare_point;
   typedef typename Tr::Weighted_point       Weighted_point;
   typedef typename Tr::Vertex_handle        Vertex_handle;
@@ -625,14 +625,14 @@ class C3T3_helpers
   typedef typename Base::Lock_data_structure          Lock_data_structure;
   typedef typename C3T3::Triangulation                Tr;
   typedef Tr                                          Triangulation;
-  typedef typename Tr::Geom_traits                    Gt;
+  typedef typename Tr::Geom_traits                    GT;
 
-  typedef typename Gt::FT                             FT;
+  typedef typename GT::FT                             FT;
   typedef typename Tr::Bare_point                     Bare_point;
   typedef typename Tr::Weighted_point                 Weighted_point;
-  typedef typename Gt::Vector_3                       Vector_3;
-  typedef typename Gt::Plane_3                        Plane_3;
-  typedef typename Gt::Tetrahedron_3                  Tetrahedron;
+  typedef typename GT::Vector_3                       Vector_3;
+  typedef typename GT::Plane_3                        Plane_3;
+  typedef typename GT::Tetrahedron_3                  Tetrahedron;
 
   typedef typename Tr::Vertex_handle                  Vertex_handle;
   typedef typename Tr::Facet                          Facet;
@@ -1118,17 +1118,17 @@ class C3T3_helpers
                              const bool update_c3t3,
                              const bool update_surface_center) const
     {
-      typedef typename C3T3::Triangulation::Geom_traits Gt;
-      typedef typename Gt::Segment_3 Segment_3;
-      typedef typename Gt::Ray_3 Ray_3;
-      typedef typename Gt::Line_3 Line_3;
+      typedef typename C3T3::Triangulation::Geom_traits GT;
+      typedef typename GT::Segment_3 Segment_3;
+      typedef typename GT::Ray_3 Ray_3;
+      typedef typename GT::Line_3 Line_3;
 
       // Nothing to do for infinite facets
       if ( c3t3_.triangulation().is_infinite(facet) )
         return Surface_patch();
 
       // Functors
-      typename Gt::Is_degenerate_3 is_degenerate =
+      typename GT::Is_degenerate_3 is_degenerate =
         c3t3_.triangulation().geom_traits().is_degenerate_3_object();
 
       // Get dual of facet
@@ -2476,7 +2476,7 @@ update_mesh_no_topo_change(const Vertex_handle& old_vertex,
              << "                            " << new_position << ")" << std::endl;
 #endif
 
-  typename Gt::Construct_opposite_vector_3 cov = tr_.geom_traits().construct_opposite_vector_3_object();
+  typename GT::Construct_opposite_vector_3 cov = tr_.geom_traits().construct_opposite_vector_3_object();
 
   //backup metadata
   std::set<Cell_data_backup> cells_backup;
@@ -2685,7 +2685,7 @@ C3T3_helpers<C3T3,MD>::
 rebuild_restricted_delaunay(OutdatedCells& outdated_cells,
                             Moving_vertices_set& moving_vertices)
 {
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
 
   typename OutdatedCells::iterator first_cell = outdated_cells.begin();
   typename OutdatedCells::iterator last_cell = outdated_cells.end();
@@ -2815,9 +2815,9 @@ rebuild_restricted_delaunay(ForwardIterator first_cell,
                             ForwardIterator last_cell,
                             Moving_vertices_set& moving_vertices)
 {
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
-  typename Gt::Construct_vector_3 vector = tr_.geom_traits().construct_vector_3_object();
-  typename Gt::Equal_3 equal = tr_.geom_traits().equal_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Construct_vector_3 vector = tr_.geom_traits().construct_vector_3_object();
+  typename GT::Equal_3 equal = tr_.geom_traits().equal_3_object();
 
   Update_c3t3 updater(domain_,c3t3_);
 
@@ -2953,9 +2953,9 @@ move_point(const Vertex_handle& old_vertex,
              << "                             " << move << ")\n";
 #endif
 
-  typename Gt::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
-  typename Gt::Construct_weighted_point_3 cwp = tr_.geom_traits().construct_weighted_point_3_object();
+  typename GT::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Construct_weighted_point_3 cwp = tr_.geom_traits().construct_weighted_point_3_object();
 
   Cell_vector incident_cells_;
   incident_cells_.reserve(64);
@@ -3004,9 +3004,9 @@ move_point(const Vertex_handle& old_vertex,
             << "                         " << move << ")\n";
 #endif
 
-  typename Gt::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
-  typename Gt::Construct_weighted_point_3 cwp = tr_.geom_traits().construct_weighted_point_3_object();
+  typename GT::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Construct_weighted_point_3 cwp = tr_.geom_traits().construct_weighted_point_3_object();
 
   Cell_vector incident_cells_;
   incident_cells_.reserve(64);
@@ -3068,9 +3068,9 @@ move_point(const Vertex_handle& old_vertex,
   }
   //======= /Get incident cells ==========
 
-  typename Gt::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
-  typename Gt::Construct_weighted_point_3 cwp = tr_.geom_traits().construct_weighted_point_3_object();
+  typename GT::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Construct_weighted_point_3 cwp = tr_.geom_traits().construct_weighted_point_3_object();
 
   const Weighted_point& position = tr_.point(old_vertex);
   const Weighted_point& new_position = cwp(translate(cp(position), move));
@@ -3372,14 +3372,14 @@ project_on_surface_aux(const Bare_point& p,
                        const Bare_point& ref_point,
                        const Vector_3& projection_vector) const
 {
-  typedef typename Gt::Segment_3 Segment_3;
+  typedef typename GT::Segment_3 Segment_3;
 
   // Build a segment directed as projection_direction,
-  typename Gt::Compute_squared_distance_3 sq_distance = tr_.geom_traits().compute_squared_distance_3_object();
-  typename Gt::Compute_squared_length_3 sq_length = tr_.geom_traits().compute_squared_length_3_object();
-  typename Gt::Construct_scaled_vector_3 scale = tr_.geom_traits().construct_scaled_vector_3_object();
-  typename Gt::Is_degenerate_3 is_degenerate = tr_.geom_traits().is_degenerate_3_object();
-  typename Gt::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
+  typename GT::Compute_squared_distance_3 sq_distance = tr_.geom_traits().compute_squared_distance_3_object();
+  typename GT::Compute_squared_length_3 sq_length = tr_.geom_traits().compute_squared_length_3_object();
+  typename GT::Construct_scaled_vector_3 scale = tr_.geom_traits().construct_scaled_vector_3_object();
+  typename GT::Is_degenerate_3 is_degenerate = tr_.geom_traits().is_degenerate_3_object();
+  typename GT::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
 
   typename MD::Construct_intersection construct_intersection =
     domain_.construct_intersection_object();
@@ -3432,7 +3432,7 @@ get_least_square_surface_plane(const Vertex_handle& v,
                                Surface_patch_index patch_index) const
 {
   typedef typename C3T3::Triangulation::Triangle Triangle;
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
 
   // Get incident facets
   Facet_vector facets;
@@ -3521,8 +3521,8 @@ project_on_surface_if_possible(const Vertex_handle& v,
 {
   // return domain_.project_on_surface(p);
 
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
-  typename Gt::Equal_3 equal = tr_.geom_traits().equal_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Equal_3 equal = tr_.geom_traits().equal_3_object();
 
   // Get plane
   std::pair<boost::optional<Plane_3>, Bare_point> pl_rp
diff --git a/Mesh_3/include/CGAL/Mesh_3/Cell_criteria_visitor_with_balls.h b/Mesh_3/include/CGAL/Mesh_3/Cell_criteria_visitor_with_balls.h
index 4e9393a01e53..3e6824d27ea8 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Cell_criteria_visitor_with_balls.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Cell_criteria_visitor_with_balls.h
@@ -45,8 +45,8 @@ class Cell_criteria_visitor_with_balls
 
   typedef typename Tr::Bare_point      Bare_point;
   typedef typename Tr::Weighted_point  Weighted_point;
-  typedef typename Tr::Geom_traits     Gt;
-  typedef typename Gt::FT              FT;
+  typedef typename Tr::Geom_traits     GT;
+  typedef typename GT::FT              FT;
 
   int nb_weighted_points;
   std::vector<Weighted_point> points;
@@ -59,9 +59,9 @@ class Cell_criteria_visitor_with_balls
   Cell_criteria_visitor_with_balls(const Tr& tr, const Cell_handle& ch)
     : Base(tr, ch)
   {
-    typename Gt::Compare_weighted_squared_radius_3 compare_sq_radius =
+    typename GT::Compare_weighted_squared_radius_3 compare_sq_radius =
       tr.geom_traits().compare_weighted_squared_radius_3_object();
-    typename Gt::Squared_radius_orthogonal_sphere sq_radius_ortho_sphere =
+    typename GT::Squared_radius_orthogonal_sphere sq_radius_ortho_sphere =
       tr.geom_traits().compute_squared_radius_smallest_orthogonal_sphere_3_object();
 
     const Weighted_point& p = tr.point(ch, 0);
diff --git a/Mesh_3/include/CGAL/Mesh_3/Detect_features_in_image.h b/Mesh_3/include/CGAL/Mesh_3/Detect_features_in_image.h
index 8efaf67f799d..5df9393ce5d2 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Detect_features_in_image.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Detect_features_in_image.h
@@ -57,9 +57,9 @@ std::vector<std::vector<P>>
 detect_features_in_image_with_know_word_type(const CGAL::Image_3& image,
                                              CGAL::Image_3& weights)
 {
-  using Gt = typename CGAL::Kernel_traits<P>::Kernel;
+  using GT = typename CGAL::Kernel_traits<P>::Kernel;
   using Point_3 = P;
-  using Vector_3 = typename Gt::Vector_3;
+  using Vector_3 = typename GT::Vector_3;
   using Polyline_type = std::vector<Point_3>;
   using Polylines = std::vector<Polyline_type>;
 
@@ -86,7 +86,7 @@ detect_features_in_image_with_know_word_type(const CGAL::Image_3& image,
 
   using CGAL::IMAGEIO::static_evaluate;
 
-  using Del = CGAL::Delaunay_triangulation_3<Gt>;
+  using Del = CGAL::Delaunay_triangulation_3<GT>;
   using Cell_handle = typename Del::Cell_handle;
   using Vertex_handle = typename Del::Vertex_handle;
   Del triangulation;
diff --git a/Mesh_3/include/CGAL/Mesh_3/Facet_criteria_visitor_with_balls.h b/Mesh_3/include/CGAL/Mesh_3/Facet_criteria_visitor_with_balls.h
index ec638dd29efb..0db721cd9d97 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Facet_criteria_visitor_with_balls.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Facet_criteria_visitor_with_balls.h
@@ -50,8 +50,8 @@ class Facet_criterion_visitor_with_balls
 
   typedef typename Tr::Bare_point      Bare_point;
   typedef typename Tr::Weighted_point  Weighted_point;
-  typedef typename Tr::Geom_traits     Gt;
-  typedef typename Gt::FT              FT;
+  typedef typename Tr::Geom_traits     GT;
+  typedef typename GT::FT              FT;
 
   int wp_nb_;
   double radius_ortho_shpere;
@@ -68,13 +68,13 @@ class Facet_criterion_visitor_with_balls
     , radius_ortho_shpere(0.)
     , ratio(0.)
   {
-    typename Gt::Compare_weighted_squared_radius_3 compare_sq_radius =
+    typename GT::Compare_weighted_squared_radius_3 compare_sq_radius =
       tr.geom_traits().compare_weighted_squared_radius_3_object();
-    typename Gt::Compute_weight_3 cw =
+    typename GT::Compute_weight_3 cw =
       tr.geom_traits().compute_weight_3_object();
-    typename Gt::Construct_point_3 cp =
+    typename GT::Construct_point_3 cp =
       tr.geom_traits().construct_point_3_object();
-    typename Gt::Squared_radius_orthogonal_sphere sq_radius_ortho_sphere =
+    typename GT::Squared_radius_orthogonal_sphere sq_radius_ortho_sphere =
       tr.geom_traits().compute_squared_radius_smallest_orthogonal_sphere_3_object();
 
     Weighted_point wp1 = tr.point(fh.first, (fh.second+1)&3);
diff --git a/Mesh_3/include/CGAL/Mesh_3/Lloyd_move.h b/Mesh_3/include/CGAL/Mesh_3/Lloyd_move.h
index f709f4b4f1a3..74dbb09b2ca5 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Lloyd_move.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Lloyd_move.h
@@ -44,7 +44,7 @@ template <typename C3T3,
 class Lloyd_move
 {
   typedef typename C3T3::Triangulation                        Tr;
-  typedef typename Tr::Geom_traits                            Gt;
+  typedef typename Tr::Geom_traits                            GT;
 
   typedef typename Tr::Vertex_handle                          Vertex_handle;
   typedef typename Tr::Edge                                   Edge;
@@ -57,12 +57,12 @@ class Lloyd_move
   typedef typename std::vector<Facet>                         Facet_vector;
   typedef typename std::vector<Cell_handle>                   Cell_vector;
 
-  typedef typename Gt::FT                                     FT;
-  typedef typename Gt::Point_2                                Point_2;
-  typedef typename Gt::Vector_3                               Vector_3;
-  typedef typename Gt::Tetrahedron_3                          Tetrahedron_3;
-  typedef typename Gt::Plane_3                                Plane_3;
-  typedef typename Gt::Aff_transformation_3                   Aff_transformation_3;
+  typedef typename GT::FT                                     FT;
+  typedef typename GT::Point_2                                Point_2;
+  typedef typename GT::Vector_3                               Vector_3;
+  typedef typename GT::Tetrahedron_3                          Tetrahedron_3;
+  typedef typename GT::Plane_3                                Plane_3;
+  typedef typename GT::Aff_transformation_3                   Aff_transformation_3;
 
 public:
   typedef SizingField                                         Sizing_field;
@@ -261,7 +261,7 @@ class Lloyd_move
   {
     const Tr& tr = c3t3.triangulation();
 
-    typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+    typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
 
     Facet_vector incident_facets;
     incident_facets.reserve(64);
@@ -306,8 +306,8 @@ class Lloyd_move
                                  const C3T3& c3t3,
                                  const Sizing_field& sizing_field) const
   {
-    typename Gt::Construct_point_3 cp = c3t3.triangulation().geom_traits().construct_point_3_object();
-    typename Gt::Construct_vector_3 vector = c3t3.triangulation().geom_traits().construct_vector_3_object();
+    typename GT::Construct_point_3 cp = c3t3.triangulation().geom_traits().construct_point_3_object();
+    typename GT::Construct_vector_3 vector = c3t3.triangulation().geom_traits().construct_vector_3_object();
 
     const Weighted_point position = c3t3.triangulation().point(v);
     const Bare_point& p = cp(position);
@@ -329,8 +329,8 @@ class Lloyd_move
                                   const C3T3& c3t3,
                                   const Sizing_field& sizing_field) const
   {
-    typename Gt::Construct_point_3 cp = c3t3.triangulation().geom_traits().construct_point_3_object();
-    typename Gt::Construct_vector_3 vector = c3t3.triangulation().geom_traits().construct_vector_3_object();
+    typename GT::Construct_point_3 cp = c3t3.triangulation().geom_traits().construct_point_3_object();
+    typename GT::Construct_vector_3 vector = c3t3.triangulation().geom_traits().construct_vector_3_object();
 
     const Weighted_point& position = c3t3.triangulation().point(v);
     const Bare_point& p = cp(position);
@@ -409,10 +409,10 @@ class Lloyd_move
   {
     CGAL_precondition(std::distance(first,last) >= 3);
 
-    typename Gt::Compute_area_3 area = c3t3.triangulation().geom_traits().compute_area_3_object();
-    typename Gt::Construct_centroid_3 centroid = c3t3.triangulation().geom_traits().construct_centroid_3_object();
-    typename Gt::Construct_point_3 cp = c3t3.triangulation().geom_traits().construct_point_3_object();
-    typename Gt::Construct_vector_3 vector = c3t3.triangulation().geom_traits().construct_vector_3_object();
+    typename GT::Compute_area_3 area = c3t3.triangulation().geom_traits().compute_area_3_object();
+    typename GT::Construct_centroid_3 centroid = c3t3.triangulation().geom_traits().construct_centroid_3_object();
+    typename GT::Construct_point_3 cp = c3t3.triangulation().geom_traits().construct_point_3_object();
+    typename GT::Construct_vector_3 vector = c3t3.triangulation().geom_traits().construct_vector_3_object();
 
     // Vertex current position
     const Weighted_point& vertex_weighted_position = c3t3.triangulation().point(v);
@@ -460,8 +460,8 @@ class Lloyd_move
                                                const Bare_point& reference_point,
                                                const C3T3& c3t3) const
   {
-    typename Gt::Construct_base_vector_3 base = c3t3.triangulation().geom_traits().construct_base_vector_3_object();
-    typename Gt::Construct_orthogonal_vector_3 orthogonal_vector = c3t3.triangulation().geom_traits().construct_orthogonal_vector_3_object();
+    typename GT::Construct_base_vector_3 base = c3t3.triangulation().geom_traits().construct_base_vector_3_object();
+    typename GT::Construct_orthogonal_vector_3 orthogonal_vector = c3t3.triangulation().geom_traits().construct_orthogonal_vector_3_object();
 
     Vector_3 u = base(plane, 1);
     u = u / CGAL::sqrt(u*u);
@@ -542,12 +542,12 @@ class Lloyd_move
 
     const Tr& tr = c3t3.triangulation();
 
-    typename Gt::Construct_centroid_3 centroid = tr.geom_traits().construct_centroid_3_object();
-    typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
-    typename Gt::Construct_tetrahedron_3 tetrahedron = tr.geom_traits().construct_tetrahedron_3_object();
-    typename Gt::Construct_translated_point_3 translate = tr.geom_traits().construct_translated_point_3_object();
-    typename Gt::Construct_vector_3 vector = tr.geom_traits().construct_vector_3_object();
-    typename Gt::Compute_volume_3 volume = tr.geom_traits().compute_volume_3_object();
+    typename GT::Construct_centroid_3 centroid = tr.geom_traits().construct_centroid_3_object();
+    typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+    typename GT::Construct_tetrahedron_3 tetrahedron = tr.geom_traits().construct_tetrahedron_3_object();
+    typename GT::Construct_translated_point_3 translate = tr.geom_traits().construct_translated_point_3_object();
+    typename GT::Construct_vector_3 vector = tr.geom_traits().construct_vector_3_object();
+    typename GT::Compute_volume_3 volume = tr.geom_traits().compute_volume_3_object();
 
     Cell_circulator current_cell = tr.incident_cells(edge);
     Cell_circulator done = current_cell;
diff --git a/Mesh_3/include/CGAL/Mesh_3/Mesh_global_optimizer.h b/Mesh_3/include/CGAL/Mesh_3/Mesh_global_optimizer.h
index 7b83d8b05bcf..0014ff0e5e04 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Mesh_global_optimizer.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Mesh_global_optimizer.h
@@ -68,9 +68,9 @@ template <typename Tr, typename Concurrency_tag>
 class Mesh_global_optimizer_base
 {
 protected:
-  typedef typename Tr::Geom_traits                          Gt;
-  typedef typename Gt::FT                                   FT;
-  typedef typename Gt::Vector_3                             Vector_3;
+  typedef typename Tr::Geom_traits                          GT;
+  typedef typename GT::FT                                   FT;
+  typedef typename GT::Vector_3                             Vector_3;
   typedef typename Tr::Lock_data_structure                  Lock_data_structure;
 
   // The sizing field info is stored inside the move vector because it is computed
@@ -127,9 +127,9 @@ class Mesh_global_optimizer_base<Tr, Parallel_tag>
 {
 
 protected:
-  typedef typename Tr::Geom_traits                          Gt;
-  typedef typename Gt::FT                                   FT;
-  typedef typename Gt::Vector_3                             Vector_3;
+  typedef typename Tr::Geom_traits                          GT;
+  typedef typename GT::FT                                   FT;
+  typedef typename GT::Vector_3                             Vector_3;
   typedef typename Tr::Lock_data_structure                  Lock_data_structure;
   typedef tbb::concurrent_vector<std::tuple<typename Tr::Vertex_handle, Vector_3, FT> >
                                                             Moves_vector;
@@ -240,7 +240,7 @@ class Mesh_global_optimizer
   using Base::increment_frozen_points;
 
   typedef typename C3T3::Triangulation  Tr;
-  typedef typename Tr::Geom_traits      Gt;
+  typedef typename Tr::Geom_traits      GT;
 
   typedef typename Tr::Bare_point       Bare_point;
   typedef typename Tr::Weighted_point   Weighted_point;
@@ -249,8 +249,8 @@ class Mesh_global_optimizer
   typedef typename Tr::Edge             Edge;
   typedef typename Tr::Vertex           Vertex;
 
-  typedef typename Gt::FT               FT;
-  typedef typename Gt::Vector_3         Vector_3;
+  typedef typename GT::FT               FT;
+  typedef typename GT::Vector_3         Vector_3;
 
   typedef typename std::vector<Cell_handle>                      Cell_vector;
   typedef typename std::vector<Vertex_handle>                    Vertex_vector;
@@ -380,7 +380,7 @@ class Mesh_global_optimizer
     Moves_vector_        & m_moves;
     bool                   m_do_freeze;
     Vertex_conc_vector   & m_vertices_not_moving_any_more;
-    const Gt             & m_gt;
+    const GT             & m_gt;
 
   public:
     // Constructor
@@ -389,7 +389,7 @@ class Mesh_global_optimizer
                  Moves_vector_ &moves,
                  bool do_freeze,
                  Vertex_conc_vector &vertices_not_moving_any_more,
-                 const Gt &gt)
+                 const GT &gt)
     : m_mgo(mgo),
       m_sizing_field(sizing_field),
       m_moves(moves),
@@ -411,8 +411,8 @@ class Mesh_global_optimizer
     // operator()
     void operator()(const Vertex_handle& oldv) const
     {
-      typename Gt::Construct_point_3 cp = m_gt.construct_point_3_object();
-      typename Gt::Construct_translated_point_3 translate = m_gt.construct_translated_point_3_object();
+      typename GT::Construct_point_3 cp = m_gt.construct_point_3_object();
+      typename GT::Construct_translated_point_3 translate = m_gt.construct_translated_point_3_object();
 
       Vector_3 move = m_mgo.compute_move(oldv);
       if ( CGAL::NULL_VECTOR != move )
@@ -451,13 +451,13 @@ class Mesh_global_optimizer
   class Compute_sizing_field_value
   {
     MGO                  & m_mgo;
-    const Gt             & m_gt;
+    const GT             & m_gt;
     Local_list_          & m_local_lists;
 
   public:
     // Constructor
     Compute_sizing_field_value(MGO &mgo,
-                               const Gt &gt,
+                               const GT &gt,
                                Local_list_ &local_lists)
     : m_mgo(mgo),
       m_gt(gt),
@@ -474,7 +474,7 @@ class Mesh_global_optimizer
     // operator()
     void operator()(Vertex& v) const
     {
-      typename Gt::Construct_point_3 cp = m_gt.construct_point_3_object();
+      typename GT::Construct_point_3 cp = m_gt.construct_point_3_object();
 
       Vertex_handle vh
         = Tr::Triangulation_data_structure::Vertex_range::s_iterator_to(v);
@@ -827,8 +827,8 @@ compute_moves(Moving_vertices_set& moving_vertices)
   else
 #endif // CGAL_LINKED_WITH_TBB
   {
-    typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
-    typename Gt::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
+    typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+    typename GT::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
 
     // Get move for each moving vertex
     typename Moving_vertices_set::iterator vit = moving_vertices.begin();
@@ -879,10 +879,10 @@ typename Mesh_global_optimizer<C3T3,Md,Mf,V_>::Vector_3
 Mesh_global_optimizer<C3T3,Md,Mf,V_>::
 compute_move(const Vertex_handle& v)
 {
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
-  typename Gt::Compute_squared_length_3 sq_length = tr_.geom_traits().compute_squared_length_3_object();
-  typename Gt::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
-  typename Gt::Construct_vector_3 vector = tr_.geom_traits().construct_vector_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Compute_squared_length_3 sq_length = tr_.geom_traits().compute_squared_length_3_object();
+  typename GT::Construct_translated_point_3 translate = tr_.geom_traits().construct_translated_point_3_object();
+  typename GT::Construct_vector_3 vector = tr_.geom_traits().construct_vector_3_object();
 
   Cell_vector incident_cells;
   incident_cells.reserve(64);
@@ -1061,7 +1061,7 @@ fill_sizing_field()
   else
 #endif //CGAL_LINKED_WITH_TBB
   {
-    typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+    typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
 
     // Fill map with local size
     for(typename Tr::Finite_vertices_iterator vit = tr_.finite_vertices_begin();
@@ -1195,8 +1195,8 @@ typename Mesh_global_optimizer<C3T3,Md,Mf,V_>::FT
 Mesh_global_optimizer<C3T3,Md,Mf,V_>::
 sq_circumradius_length(const Cell_handle& cell, const Vertex_handle& v) const
 {
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
-  typename Gt::Compute_squared_distance_3 sq_distance = tr_.geom_traits().compute_squared_distance_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Compute_squared_distance_3 sq_distance = tr_.geom_traits().compute_squared_distance_3_object();
 
   const Bare_point circumcenter = tr_.dual(cell);
   const Weighted_point& position = tr_.point(cell, cell->index(v));
diff --git a/Mesh_3/include/CGAL/Mesh_3/Mesh_sizing_field.h b/Mesh_3/include/CGAL/Mesh_3/Mesh_sizing_field.h
index e1d52d202f2c..03e3262ef6bd 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Mesh_sizing_field.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Mesh_sizing_field.h
@@ -88,10 +88,10 @@ class Mesh_sizing_field
                                   typename Tr::Concurrency_tag>
 {
   // Types
-  typedef typename Tr::Geom_traits              Gt;
+  typedef typename Tr::Geom_traits              GT;
   typedef typename Tr::Bare_point               Bare_point;
   typedef typename Tr::Weighted_point           Weighted_point;
-  typedef typename Gt::FT                       FT;
+  typedef typename GT::FT                       FT;
 
   typedef typename Tr::Vertex_handle            Vertex_handle;
   typedef typename Tr::Cell_handle              Cell_handle;
@@ -169,7 +169,7 @@ fill(const std::map<Bare_point, FT>& value_map)
 {
   typedef typename Tr::Finite_vertices_iterator  Fvi;
 
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
 
   for ( Fvi vit = tr_.finite_vertices_begin(); vit != tr_.finite_vertices_end(); ++ vit )
   {
@@ -196,7 +196,7 @@ typename Mesh_sizing_field<Tr,B>::FT
 Mesh_sizing_field<Tr,B>::
 operator()(const Bare_point& p, const Cell_handle& c) const
 {
-  typename Gt::Construct_weighted_point_3 cwp = tr_.geom_traits().construct_weighted_point_3_object();
+  typename GT::Construct_weighted_point_3 cwp = tr_.geom_traits().construct_weighted_point_3_object();
 
 #ifdef CGAL_MESH_3_SIZING_FIELD_INEXACT_LOCATE
   //use the inexact locate (much faster than locate) to get a hint
@@ -239,8 +239,8 @@ typename Mesh_sizing_field<Tr,B>::FT
 Mesh_sizing_field<Tr,B>::
 interpolate_on_cell_vertices(const Bare_point& p, const Cell_handle& cell) const
 {
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
-  typename Gt::Compute_volume_3 volume = tr_.geom_traits().compute_volume_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Compute_volume_3 volume = tr_.geom_traits().compute_volume_3_object();
 
   // Interpolate value using tet vertices values
   const FT& va = cell->vertex(0)->meshing_info();
@@ -275,9 +275,9 @@ typename Mesh_sizing_field<Tr,B>::FT
 Mesh_sizing_field<Tr,B>::
 interpolate_on_facet_vertices(const Bare_point& p, const Cell_handle& cell) const
 {
-  typename Gt::Compute_area_3 area =  tr_.geom_traits().compute_area_3_object();
+  typename GT::Compute_area_3 area =  tr_.geom_traits().compute_area_3_object();
 
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
   // Find infinite vertex and put it in k0
   int k0 = 0;
   int k1 = 1;
diff --git a/Mesh_3/include/CGAL/Mesh_3/Odt_move.h b/Mesh_3/include/CGAL/Mesh_3/Odt_move.h
index a2cbcc78cc5a..4ec48adaf2ed 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Odt_move.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Odt_move.h
@@ -34,7 +34,7 @@ template <typename C3T3,
 class Odt_move
 {
   typedef typename C3T3::Triangulation                        Tr;
-  typedef typename Tr::Geom_traits                            Gt;
+  typedef typename Tr::Geom_traits                            GT;
 
   typedef typename Tr::Vertex_handle                          Vertex_handle;
   typedef typename Tr::Facet                                  Facet;
@@ -46,8 +46,8 @@ class Odt_move
   typedef typename std::vector<Facet>                         Facet_vector;
   typedef typename std::vector<Cell_handle>                   Cell_vector;
 
-  typedef typename Gt::FT                                     FT;
-  typedef typename Gt::Vector_3                               Vector_3;
+  typedef typename GT::FT                                     FT;
+  typedef typename GT::Vector_3                               Vector_3;
 
 public:
   typedef SizingField                                         Sizing_field;
@@ -66,8 +66,8 @@ class Odt_move
     // Compute move
     const Tr& tr = c3t3.triangulation();
 
-    typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
-    typename Gt::Construct_vector_3 vector = tr.geom_traits().construct_vector_3_object();
+    typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+    typename GT::Construct_vector_3 vector = tr.geom_traits().construct_vector_3_object();
 
     Vector_3 move = CGAL::NULL_VECTOR;
     FT sum_volume(0);
@@ -117,8 +117,8 @@ class Odt_move
                        const Tr& tr,
                        const Sizing_field& sizing_field) const
   {
-    typename Gt::Construct_centroid_3 centroid = tr.geom_traits().construct_centroid_3_object();
-    typename Gt::Compute_volume_3 volume = tr.geom_traits().compute_volume_3_object();
+    typename GT::Construct_centroid_3 centroid = tr.geom_traits().construct_centroid_3_object();
+    typename GT::Compute_volume_3 volume = tr.geom_traits().compute_volume_3_object();
 
     Bare_point c = centroid(tr.tetrahedron(cell));
     FT s = sizing_field(c, std::make_pair(cell, true));
@@ -195,8 +195,8 @@ class Odt_move
 //                     const Tr& tr,
 //                     const Sizing_field& sizing_field) const
 //  {
-//    typename Gt::Compute_area_3 area = tr.geom_traits().compute_area_3_object();
-//    typename Gt::Construct_centroid_3 centroid = tr.geom_traits().construct_centroid_3_object();
+//    typename GT::Compute_area_3 area = tr.geom_traits().compute_area_3_object();
+//    typename GT::Construct_centroid_3 centroid = tr.geom_traits().construct_centroid_3_object();
 //
 //    Bare_point c = centroid(tr.triangle(facet));
 //    FT s = sizing_field(c, facet.first->vertex(0));
@@ -211,9 +211,9 @@ class Odt_move
 //                          const Tr& tr,
 //                          const Sizing_field& sizing_field) const
 //  {
-//    typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
-//    typename Gt::Construct_midpoint_3 midpoint = tr.geom_traits().construct_midpoint_3_object();
-//    typename Gt::Compute_squared_distance_3 sq_distance = tr.geom_traits().compute_squared_distance_3_object();
+//    typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+//    typename GT::Construct_midpoint_3 midpoint = tr.geom_traits().construct_midpoint_3_object();
+//    typename GT::Compute_squared_distance_3 sq_distance = tr.geom_traits().compute_squared_distance_3_object();
 //
 //    const Weighted_point& wp1 = tr.point(cell, vertex_index_1);
 //    const Weighted_point& wp2 = tr.point(cell, vertex_index_2);
@@ -251,8 +251,8 @@ class Odt_move
 //
 //  Vector_3 normal_outside(const Facet& f, const C3T3& c3t3) const
 //  {
-//    typename Gt::Construct_point_3 cp = c3t3.triangulation().geom_traits().construct_point_3_object();
-//    typename Gt::Construct_normal_3 normal = c3t3.triangulation().geom_traits().construct_normal_3_object();
+//    typename GT::Construct_point_3 cp = c3t3.triangulation().geom_traits().construct_point_3_object();
+//    typename GT::Construct_normal_3 normal = c3t3.triangulation().geom_traits().construct_normal_3_object();
 //
 //    const Cell_handle& cell = f.first;
 //    const int& i = f.second;
diff --git a/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h b/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
index 3bd65976493f..197b71916fe9 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
@@ -118,8 +118,8 @@ class Protect_edges_sizing_field
   typedef typename Tr::Weighted_point         Weighted_point;
   typedef typename Weighted_point::Weight     Weight;
 
-  typedef typename Tr::Geom_traits            Gt;
-  typedef typename Gt::FT                     FT;
+  typedef typename Tr::Geom_traits            GT;
+  typedef typename GT::FT                     FT;
 
   typedef typename C3T3::Cell_handle          Cell_handle;
   typedef typename C3T3::Vertex_handle        Vertex_handle;
@@ -394,7 +394,7 @@ class Protect_edges_sizing_field
   /// Returns the radius of the ball of vertex `v`.
   FT get_radius(const Vertex_handle& v) const
   {
-    typename Gt::Compute_weight_3 cw =
+    typename GT::Compute_weight_3 cw =
       c3t3_.triangulation().geom_traits().compute_weight_3_object();
 
     const Weighted_point& v_wp = c3t3_.triangulation().point(v);
@@ -643,7 +643,7 @@ insert_point(const Bare_point& p, const Weight& w, int dim, const Index& index,
   // Insert point
   CGAL_assertion_code(size_type nb_vertices_before = c3t3_.triangulation().number_of_vertices());
 
-  typename Gt::Construct_weighted_point_3 cwp =
+  typename GT::Construct_weighted_point_3 cwp =
     c3t3_.triangulation().geom_traits().construct_weighted_point_3_object();
 
   const Weighted_point wp = cwp(p,w*weight_modifier);
@@ -712,13 +712,13 @@ smart_insert_point(const Bare_point& p, Weight w, int dim, const Index& index,
 #endif
   const Tr& tr = c3t3_.triangulation();
 
-  typename Gt::Compute_squared_distance_3 sq_distance =
+  typename GT::Compute_squared_distance_3 sq_distance =
     tr.geom_traits().compute_squared_distance_3_object();
-  typename Gt::Compare_weighted_squared_radius_3 cwsr =
+  typename GT::Compare_weighted_squared_radius_3 cwsr =
     tr.geom_traits().compare_weighted_squared_radius_3_object();
-  typename Gt::Construct_point_3 cp =
+  typename GT::Construct_point_3 cp =
     tr.geom_traits().construct_point_3_object();
-  typename Gt::Construct_weighted_point_3 cwp =
+  typename GT::Construct_weighted_point_3 cwp =
     tr.geom_traits().construct_weighted_point_3_object();
 
   bool add_handle_to_unchecked = false; // add or not the new vertex to the set 'unchecked_vertices'
@@ -972,7 +972,7 @@ insert_balls_on_edges()
       }
       else
       {
-        typename Gt::Construct_weighted_point_3 cwp =
+        typename GT::Construct_weighted_point_3 cwp =
           c3t3_.triangulation().geom_traits().construct_weighted_point_3_object();
 
         // Even if the curve is a cycle, it can intersect other curves at
@@ -1026,7 +1026,7 @@ typename Protect_edges_sizing_field<C3T3, MD, Sf>::Vertex_handle
 Protect_edges_sizing_field<C3T3, MD, Sf>::
 get_vertex_corner_from_point(const Bare_point& p, const Index&) const
 {
-  typename Gt::Construct_weighted_point_3 cwp =
+  typename GT::Construct_weighted_point_3 cwp =
     c3t3_.triangulation().geom_traits().construct_weighted_point_3_object();
 
   // Get vertex_handle associated to corner (dim=0) point
@@ -1470,13 +1470,13 @@ bool
 Protect_edges_sizing_field<C3T3, MD, Sf>::
 do_balls_intersect(const Vertex_handle& va, const Vertex_handle& vb) const
 {
-  typename Gt::Construct_sphere_3 sphere =
+  typename GT::Construct_sphere_3 sphere =
     c3t3_.triangulation().geom_traits().construct_sphere_3_object();
-  typename Gt::Do_intersect_3 do_intersect =
+  typename GT::Do_intersect_3 do_intersect =
     c3t3_.triangulation().geom_traits().do_intersect_3_object();
-  typename Gt::Construct_point_3 cp =
+  typename GT::Construct_point_3 cp =
     c3t3_.triangulation().geom_traits().construct_point_3_object();
-  typename Gt::Compute_weight_3 cw =
+  typename GT::Compute_weight_3 cw =
     c3t3_.triangulation().geom_traits().compute_weight_3_object();
 
   const Weighted_point& wa = c3t3_.triangulation().point(va);
@@ -1516,7 +1516,7 @@ change_ball_size(const Vertex_handle& v, const FT squared_size, const bool speci
   }
 
   // Store point data
-  typename Gt::Construct_point_3 cp =
+  typename GT::Construct_point_3 cp =
     c3t3_.triangulation().geom_traits().construct_point_3_object();
 
   Index index = c3t3_.index(v);
@@ -1535,7 +1535,7 @@ change_ball_size(const Vertex_handle& v, const FT squared_size, const bool speci
   // Change v size
   c3t3_.triangulation().remove(v);
 
-  CGAL_assertion_code(typename Gt::Construct_weighted_point_3 cwp =
+  CGAL_assertion_code(typename GT::Construct_weighted_point_3 cwp =
                         c3t3_.triangulation().geom_traits().construct_weighted_point_3_object();)
   CGAL_assertion_code(const Weighted_point wp = cwp(p,w);)
   CGAL_assertion_code(Tr& tr = c3t3_.triangulation());
@@ -1724,9 +1724,9 @@ is_sampling_dense_enough(const Vertex_handle& v1, const Vertex_handle& v2,
   using CGAL::Mesh_3::internal::min_intersection_factor;
   CGAL_precondition(c3t3_.curve_index(v1,v2) == curve_index);
 
-  typename Gt::Construct_point_3 cp =
+  typename GT::Construct_point_3 cp =
     c3t3_.triangulation().geom_traits().construct_point_3_object();
-  typename Gt::Compute_weight_3 cw =
+  typename GT::Compute_weight_3 cw =
     c3t3_.triangulation().geom_traits().compute_weight_3_object();
 
   // Get sizes
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
index ded63f9b139a..06f3d16139be 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
@@ -244,10 +244,10 @@ class Refine_facets_3_base
   typedef typename Tr::Cell_handle Cell_handle;
   typedef typename Triangulation_mesher_level_traits_3<Tr>::Zone Zone;
 
-  typedef typename Tr::Geom_traits Gt;
-  typedef typename Gt::Segment_3 Segment_3;
-  typedef typename Gt::Ray_3 Ray_3;
-  typedef typename Gt::Line_3 Line_3;
+  typedef typename Tr::Geom_traits GT;
+  typedef typename GT::Segment_3 Segment_3;
+  typedef typename GT::Ray_3 Ray_3;
+  typedef typename GT::Line_3 Line_3;
 
 public:
   Refine_facets_3_base(Tr& tr, Complex3InTriangulation3& c3t3,
@@ -892,8 +892,8 @@ class Refine_facets_3
   typedef typename Tr::Cell_handle Cell_handle;
   typedef typename MeshDomain::Surface_patch_index Surface_patch_index;
   typedef typename MeshDomain::Index Index;
-  typedef typename Tr::Geom_traits Gt;
-  typedef typename Gt::Ray_3 Ray_3;
+  typedef typename Tr::Geom_traits GT;
+  typedef typename GT::Ray_3 Ray_3;
 
 private:
   // Disabled copy constructor
@@ -1628,11 +1628,11 @@ compute_facet_properties(const Facet& facet,
   typedef typename MD::Intersection Intersection;
 
   // Functor
-  typename Gt::Is_degenerate_3 is_degenerate =
+  typename GT::Is_degenerate_3 is_degenerate =
       r_tr_.geom_traits().is_degenerate_3_object();
-  typename Gt::Compare_xyz_3 compare_xyz =
+  typename GT::Compare_xyz_3 compare_xyz =
       r_tr_.geom_traits().compare_xyz_3_object();
-  typename Gt::Construct_segment_3 construct_segment =
+  typename GT::Construct_segment_3 construct_segment =
       r_tr_.geom_traits().construct_segment_3_object();
 #ifndef CGAL_MESH_3_NO_LONGER_CALLS_DO_INTERSECT_3
   typename MD::Do_intersect_surface do_intersect_surface =
@@ -1752,13 +1752,13 @@ Refine_facets_3_base<Tr,Cr,MD,C3T3_,Ct,C_>::
 is_encroached_facet_refinable(Facet& facet) const
 {
   typedef typename Tr::Weighted_point Weighted_point;
-  typedef typename Gt::FT      FT;
+  typedef typename GT::FT      FT;
 
-  typename Gt::Compute_squared_radius_smallest_orthogonal_sphere_3 sq_radius =
+  typename GT::Compute_squared_radius_smallest_orthogonal_sphere_3 sq_radius =
     r_tr_.geom_traits().compute_squared_radius_smallest_orthogonal_sphere_3_object();
-  typename Gt::Compute_weight_3 cw =
+  typename GT::Compute_weight_3 cw =
     r_tr_.geom_traits().compute_weight_3_object();
-  typename Gt::Compare_weighted_squared_radius_3 compare =
+  typename GT::Compare_weighted_squared_radius_3 compare =
     r_tr_.geom_traits().compare_weighted_squared_radius_3_object();
 
   const Cell_handle& c = facet.first;
diff --git a/Mesh_3/include/CGAL/Mesh_3/Sizing_grid.h b/Mesh_3/include/CGAL/Mesh_3/Sizing_grid.h
index 9fe82752715c..ac261599db87 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Sizing_grid.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Sizing_grid.h
@@ -31,12 +31,12 @@ namespace CGAL {
 
 namespace Mesh_3 {
 
-template <class Gt>
+template <class GT>
 class Sizing_grid_node
 {
 public:
-  typedef typename Gt::Point_3 Point;
-  typedef typename Gt::FT FT;
+  typedef typename GT::Point_3 Point;
+  typedef typename GT::FT FT;
 
   FT m_init_size;
   FT m_size;
@@ -108,14 +108,14 @@ template <class Tr>
 class Sizing_grid
 {
 public:
-  typedef typename Tr::Geom_traits Gt;
-  typedef typename Gt::FT FT;
+  typedef typename Tr::Geom_traits GT;
+  typedef typename GT::FT FT;
 
   typedef typename Tr::Weighted_point Weighted_point;
   typedef typename Tr::Bare_point Bare_point;
 
-  typedef typename Gt::Vector_3 Vector;
-  typedef Sizing_grid_node<Gt> Node;
+  typedef typename GT::Vector_3 Vector;
+  typedef Sizing_grid_node<GT> Node;
   typedef typename std::pair<Bare_point, FT> Constraint;
 
 private:
diff --git a/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h b/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h
index 87a0416f7b32..875ea6983788 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Sliver_perturber.h
@@ -317,8 +317,8 @@ class Sliver_perturber_base
 {
 protected:
   typedef typename Tr::Vertex_handle                        Vertex_handle;
-  typedef typename Tr::Geom_traits                          Gt;
-  typedef typename Gt::FT                                   FT;
+  typedef typename Tr::Geom_traits                          GT;
+  typedef typename GT::FT                                   FT;
   typedef typename std::vector<Vertex_handle>               Bad_vertices_vector;
   typedef typename Tr::Lock_data_structure                  Lock_data_structure;
 
@@ -345,8 +345,8 @@ class Sliver_perturber_base<Tr, Parallel_tag>
 {
 protected:
   typedef typename Tr::Vertex_handle                        Vertex_handle;
-  typedef typename Tr::Geom_traits                          Gt;
-  typedef typename Gt::FT                                   FT;
+  typedef typename Tr::Geom_traits                          GT;
+  typedef typename GT::FT                                   FT;
   typedef typename tbb::concurrent_vector<Vertex_handle>    Bad_vertices_vector;
   typedef typename Tr::Lock_data_structure                  Lock_data_structure;
 
@@ -437,7 +437,7 @@ class Sliver_perturber
     typename C3T3::Triangulation, Concurrency_tag>                      Base;
 
   typedef typename C3T3::Triangulation          Tr;
-  typedef typename Tr::Geom_traits              Gt;
+  typedef typename Tr::Geom_traits              GT;
 
   typedef typename Tr::Cell_handle              Cell_handle;
   typedef typename Base::Vertex_handle          Vertex_handle;
@@ -450,7 +450,7 @@ class Sliver_perturber
   typedef typename std::vector<Vertex_handle>   Vertex_vector;
   typedef typename Base::Bad_vertices_vector    Bad_vertices_vector;
 
-  typedef typename Gt::FT                       FT;
+  typedef typename GT::FT                       FT;
 
   // Helper
   typedef class C3T3_helpers<C3T3,MeshDomain> C3T3_helpers;
@@ -1261,7 +1261,7 @@ perturb_vertex( PVertex pv
               , bool *could_lock_zone
               ) const
 {
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
 
 #ifdef CGAL_CONCURRENT_MESH_3_PROFILING
   static Profile_branch_counter_3 bcounter(
diff --git a/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h b/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h
index 03eb91e812b5..cbe8056b23a0 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h
@@ -107,8 +107,8 @@ class Slivers_exuder_base
   typedef typename Tr::Vertex_handle                        Vertex_handle;
   typedef typename Tr::Cell_handle                          Cell_handle;
   typedef std::vector<Cell_handle>                          Cell_vector;
-  typedef typename Tr::Geom_traits                          Gt;
-  typedef typename Gt::FT                                   FT;
+  typedef typename Tr::Geom_traits                          GT;
+  typedef typename GT::FT                                   FT;
   typedef typename std::vector<Vertex_handle>               Bad_vertices_vector;
   typedef typename Tr::Lock_data_structure                  Lock_data_structure;
 
@@ -197,8 +197,8 @@ class Slivers_exuder_base<Tr, Parallel_tag>
   typedef typename Tr::Vertex_handle                        Vertex_handle;
   typedef typename Tr::Cell_handle                          Cell_handle;
   typedef std::vector<Cell_handle>                          Cell_vector;
-  typedef typename Tr::Geom_traits                          Gt;
-  typedef typename Gt::FT                                   FT;
+  typedef typename Tr::Geom_traits                          GT;
+  typedef typename GT::FT                                   FT;
   typedef typename tbb::concurrent_vector<Vertex_handle>    Bad_vertices_vector;
   typedef typename Tr::Lock_data_structure                  Lock_data_structure;
 
@@ -353,9 +353,9 @@ class Slivers_exuder
   typedef typename Base::Queue_value_type                    Queue_value_type;
   typedef typename Base::Cell_vector                         Cell_vector;
 
-  typedef typename Tr::Geom_traits                           Gt;
+  typedef typename Tr::Geom_traits                           GT;
   typedef typename Base::FT                                  FT;
-  typedef typename Gt::Tetrahedron_3                         Tetrahedron_3;
+  typedef typename GT::Tetrahedron_3                         Tetrahedron_3;
 
   typedef typename C3T3::Cells_in_complex_iterator           Cell_iterator;
   typedef std::vector<Facet>                                 Facet_vector;
@@ -1045,14 +1045,14 @@ pump_vertex(const Vertex_handle& pumped_vertex,
   if (could_lock_zone && *could_lock_zone == false)
     return false;
 
-  typename Gt::Compare_weighted_squared_radius_3 compare_sq_radius =
+  typename GT::Compare_weighted_squared_radius_3 compare_sq_radius =
     tr_.geom_traits().compare_weighted_squared_radius_3_object();
 
   // If best_weight <= pumped_vertex weight, nothing to do
   const Weighted_point& pumped_vertex_wp = tr_.point(pumped_vertex);
   if ( compare_sq_radius(pumped_vertex_wp, - best_weight) == CGAL::LARGER ) // best_weight > v's weight
   {
-    typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+    typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
 
     const Weighted_point& pwp = tr_.point(pumped_vertex);
     Weighted_point wp(cp(pwp), best_weight);
@@ -1115,8 +1115,8 @@ expand_prestar(const Cell_handle& cell_to_add,
                Pre_star& pre_star,
                Sliver_values& criterion_values) const
 {
-  typename Gt::Compute_weight_3 cw = tr_.geom_traits().compute_weight_3_object();
-  typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+  typename GT::Compute_weight_3 cw = tr_.geom_traits().compute_weight_3_object();
+  typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
 
   // Delete first facet of pre_star
   Facet start_facet = pre_star.front()->second;
@@ -1332,13 +1332,13 @@ get_best_weight(const Vertex_handle& v, bool *could_lock_zone) const
   } // end while(... can pump...)
 
 #ifdef CGAL_MESH_3_DEBUG_SLIVERS_EXUDER
-  typename Gt::Compare_weighted_squared_radius_3 compare_sq_radius =
+  typename GT::Compare_weighted_squared_radius_3 compare_sq_radius =
     tr_.geom_traits().compare_weighted_squared_radius_3_object();
 
   const Weighted_point& vwp = tr_.point(v);
   if ( compare_sq_radius(vwp, - best_weight) == CGAL::LARGER ) // best_weight > v's weight
   {
-    typename Gt::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
+    typename GT::Construct_point_3 cp = tr_.geom_traits().construct_point_3_object();
     const Weighted_point& wpv = tr_.point(v);
     Weighted_point wp(cp(wpv), best_weight);
     check_pre_star(pre_star_copy, wp, v);
diff --git a/Mesh_3/include/CGAL/Mesh_3/Triangle_accessor_primitive.h b/Mesh_3/include/CGAL/Mesh_3/Triangle_accessor_primitive.h
index a3436fbdb919..a5a132329093 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Triangle_accessor_primitive.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Triangle_accessor_primitive.h
@@ -24,13 +24,13 @@
 namespace CGAL {
 namespace Mesh_3 {
 
-template<typename TriangleAccessor, typename Gt>
+template<typename TriangleAccessor, typename GT>
 class Triangle_accessor_primitive
 {
 public:
   typedef typename TriangleAccessor::Triangle_handle  Id;
-  typedef typename Gt::Triangle_3                     Datum;
-  typedef typename Gt::Point_3                        Point;
+  typedef typename GT::Triangle_3                     Datum;
+  typedef typename GT::Point_3                        Point;
 
   Triangle_accessor_primitive(const Id& h)
     : handle_(h) {}
@@ -55,15 +55,15 @@ class Triangle_accessor_primitive
   Id handle_;
 };
 
-//template <typename Gt>
-//class Triangle_accessor_primitive<Triangle_accessor<Polyhedron_3<Gt>,Gt>, Gt>
+//template <typename GT>
+//class Triangle_accessor_primitive<Triangle_accessor<Polyhedron_3<GT>,GT>, GT>
 //{
-//  typedef class Triangle_accessor<Polyhedron_3<Gt>,Gt> Triangle_accessor;
+//  typedef class Triangle_accessor<Polyhedron_3<GT>,GT> Triangle_accessor;
 //
 //public:
 //  typedef typename Triangle_accessor::Triangle_iterator Id;
-//  typedef typename Gt::Triangle_3                       Datum;
-//  typedef typename Gt::Point_3                          Point;
+//  typedef typename GT::Triangle_3                       Datum;
+//  typedef typename GT::Point_3                          Point;
 //
 //  Triangle_accessor_primitive(const Id& h)
 //    : handle_(h) {}
diff --git a/Mesh_3/include/CGAL/Mesh_3/Triangulation_helpers.h b/Mesh_3/include/CGAL/Mesh_3/Triangulation_helpers.h
index 7de442b25fbb..644cdc5399f3 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Triangulation_helpers.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Triangulation_helpers.h
@@ -43,17 +43,17 @@ namespace Mesh_3 {
 template<typename Tr>
 class Triangulation_helpers
 {
-  typedef typename Tr::Geom_traits              Gt;
+  typedef typename Tr::Geom_traits              GT;
 
-  typedef typename Gt::FT                       FT;
-  typedef typename Gt::Vector_3                 Vector_3;
+  typedef typename GT::FT                       FT;
+  typedef typename GT::Vector_3                 Vector_3;
 
   // If `Tr` is not a triangulation that has defined Bare_point,
   // use Point_3 as defined in the traits class.
   typedef typename boost::mpl::eval_if_c<
     CGAL::internal::Has_nested_type_Bare_point<Tr>::value,
     typename CGAL::internal::Bare_point_type<Tr>,
-    boost::mpl::identity<typename Gt::Point_3>
+    boost::mpl::identity<typename GT::Point_3>
   >::type                                       Bare_point;
 
   // 'Point' is either a bare point or a weighted point, depending on the triangulation.
@@ -190,7 +190,7 @@ no_topological_change(Tr& tr,
   if(std::is_same<typename Tr::Periodic_tag, Tag_true>::value)
     return false;
 
-  typename Gt::Construct_opposite_vector_3 cov =
+  typename GT::Construct_opposite_vector_3 cov =
       tr.geom_traits().construct_opposite_vector_3_object();
 
   bool np = true;
@@ -382,7 +382,7 @@ inside_protecting_balls(const Tr& tr,
                         const Vertex_handle v,
                         const Bare_point& p) const
 {
-  typename Gt::Compare_weighted_squared_radius_3 cwsr =
+  typename GT::Compare_weighted_squared_radius_3 cwsr =
     tr.geom_traits().compare_weighted_squared_radius_3_object();
 
   Vertex_handle nv = tr.nearest_power_vertex(p, v->cell());
@@ -416,8 +416,8 @@ get_sq_distance_to_closest_vertex(const Tr& tr,
   // There is no need to use tr.min_squared_distance() here because we are computing
   // distances between 'v' and a neighbor within their common cell, which means
   // that even if we are using a periodic triangulation, the distance is correctly computed.
-  typename Gt::Compute_squared_distance_3 csqd = tr.geom_traits().compute_squared_distance_3_object();
-  typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+  typename GT::Compute_squared_distance_3 csqd = tr.geom_traits().compute_squared_distance_3_object();
+  typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
 
   Vertex_container treated_vertices;
   FT min_sq_dist = std::numeric_limits<FT>::infinity();
@@ -477,8 +477,8 @@ get_sq_distance_to_closest_vertex(const Tr& tr,
   // There is no need to use tr.min_squared_distance() here because we are computing
   // distances between 'v' and a neighbor within their common cell, which means
   // that even if we are using a periodic triangulation, the distance is correctly computed.
-  typename Gt::Compute_squared_distance_3 csqd = tr.geom_traits().compute_squared_distance_3_object();
-  typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+  typename GT::Compute_squared_distance_3 csqd = tr.geom_traits().compute_squared_distance_3_object();
+  typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
 
   Vertex_container treated_vertices;
   FT min_sq_dist = std::numeric_limits<FT>::infinity();
@@ -524,9 +524,9 @@ Triangulation_helpers<Tr>::
 well_oriented(const Tr& tr,
               const Cell_vector& cells_tos) const
 {
-  typedef typename Tr::Geom_traits Gt;
-  typename Gt::Orientation_3 orientation = tr.geom_traits().orientation_3_object();
-  typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+  typedef typename Tr::Geom_traits GT;
+  typename GT::Orientation_3 orientation = tr.geom_traits().orientation_3_object();
+  typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
 
   typename Cell_vector::const_iterator it = cells_tos.begin();
   for( ; it != cells_tos.end() ; ++it)
@@ -570,9 +570,9 @@ well_oriented(const Tr& tr,
               const Cell_vector& cells_tos,
               const Point_getter& pg) const
 {
-  typedef typename Tr::Geom_traits Gt;
-  typename Gt::Orientation_3 orientation = tr.geom_traits().orientation_3_object();
-  typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+  typedef typename Tr::Geom_traits GT;
+  typename GT::Orientation_3 orientation = tr.geom_traits().orientation_3_object();
+  typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
 
   typename Cell_vector::const_iterator it = cells_tos.begin();
   for( ; it != cells_tos.end() ; ++it)
diff --git a/Mesh_3/include/CGAL/Mesh_3/Triangulation_sizing_field.h b/Mesh_3/include/CGAL/Mesh_3/Triangulation_sizing_field.h
index 547365f9a1e7..aa607e7b088f 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Triangulation_sizing_field.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Triangulation_sizing_field.h
@@ -43,18 +43,18 @@ template <typename Tr>
 class Triangulation_sizing_field
 {
   // Types
-  typedef typename Tr::Geom_traits                        Gt;
+  typedef typename Tr::Geom_traits                        GT;
   typedef typename Tr::Bare_point                         Bare_point;
   typedef typename Tr::Weighted_point                     Weighted_point;
-  typedef typename Gt::FT                                 FT;
+  typedef typename GT::FT                                 FT;
 
-  typedef Triangulation_vertex_base_with_info_3<FT, Gt>   Vbb;
-  typedef Regular_triangulation_vertex_base_3<Gt, Vb>     Vb;
-  typedef Triangulation_cell_base_3<Gt>                   Cbb;
+  typedef Triangulation_vertex_base_with_info_3<FT, GT>   Vbb;
+  typedef Regular_triangulation_vertex_base_3<GT, Vb>     Vb;
+  typedef Triangulation_cell_base_3<GT>                   Cbb;
   typedef Regular_triangulation_cell_base_3<
-            Gt, Cbb, Discard_hidden_points>               Cb;
+            GT, Cbb, Discard_hidden_points>               Cb;
   typedef Triangulation_data_structure_3<Vb, Cb>          Tds;
-  typedef Regular_triangulation_3<Gt,Tds>                 Compact_triangulation;
+  typedef Regular_triangulation_3<GT,Tds>                 Compact_triangulation;
   typedef Compact_triangulation                           Ctr;
 
   typedef typename Tr::Vertex_handle                      Vertex_handle;
@@ -181,8 +181,8 @@ typename Triangulation_sizing_field<Tr>::FT
 Triangulation_sizing_field<Tr>::
 interpolate_on_cell_vertices(const Weighted_point& p, const CCell_handle& cell) const
 {
-  typename Gt::Construct_point_3 cp = ctr_.geom_traits().construct_point_3_object();
-  typename Gt::Compute_volume_3 volume = ctr_.geom_traits().compute_volume_3_object();
+  typename GT::Construct_point_3 cp = ctr_.geom_traits().construct_point_3_object();
+  typename GT::Compute_volume_3 volume = ctr_.geom_traits().compute_volume_3_object();
 
   // Interpolate value using tet vertices values
   const FT& va = cell->vertex(0)->info();
@@ -217,8 +217,8 @@ typename Triangulation_sizing_field<Tr>::FT
 Triangulation_sizing_field<Tr>::
 interpolate_on_facet_vertices(const Weighted_point& p, const CCell_handle& cell) const
 {
-  typename Gt::Construct_point_3 cp = ctr_.geom_traits().construct_point_3_object();
-  typename Gt::Compute_area_3 area = ctr_.geom_traits().compute_area_3_object();
+  typename GT::Construct_point_3 cp = ctr_.geom_traits().construct_point_3_object();
+  typename GT::Compute_area_3 area = ctr_.geom_traits().compute_area_3_object();
 
   // Find infinite vertex and put it in k0
   int k0 = 0;
diff --git a/Mesh_3/include/CGAL/Mesh_3/Uniform_sizing_field.h b/Mesh_3/include/CGAL/Mesh_3/Uniform_sizing_field.h
index 273ba6b6f372..3e552737ee68 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Uniform_sizing_field.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Uniform_sizing_field.h
@@ -27,9 +27,9 @@ namespace Mesh_3 {
 template <typename Tr>
 class Uniform_sizing_field
 {
-  typedef typename Tr::Geom_traits    Gt;
+  typedef typename Tr::Geom_traits    GT;
   typedef typename Tr::Weighted_point Weighted_point;
-  typedef typename Gt::FT             FT;
+  typedef typename GT::FT             FT;
 
 public:
   // Vertices of mesh triangulation do not need to be updated
diff --git a/Mesh_3/include/CGAL/Mesh_3/initialize_triangulation_from_labeled_image.h b/Mesh_3/include/CGAL/Mesh_3/initialize_triangulation_from_labeled_image.h
index d2dfef196e0a..edfef11f0397 100644
--- a/Mesh_3/include/CGAL/Mesh_3/initialize_triangulation_from_labeled_image.h
+++ b/Mesh_3/include/CGAL/Mesh_3/initialize_triangulation_from_labeled_image.h
@@ -96,25 +96,25 @@ void initialize_triangulation_from_labeled_image(C3T3& c3t3,
       TransformOperator transform = CGAL::Identity<Image_word_type>())
 {
   typedef typename C3T3::Triangulation       Tr;
-  typedef typename Tr::Geom_traits           Gt;
-  typedef typename Gt::FT                    FT;
+  typedef typename Tr::Geom_traits           GT;
+  typedef typename GT::FT                    FT;
   typedef typename Tr::Weighted_point        Weighted_point;
   typedef typename Tr::Bare_point            Bare_point;
   typedef typename Tr::Segment               Segment_3;
   typedef typename Tr::Vertex_handle         Vertex_handle;
   typedef typename Tr::Cell_handle           Cell_handle;
 
-  typedef typename Gt::Vector_3              Vector_3;
+  typedef typename GT::Vector_3              Vector_3;
 
   typedef MeshDomain                         Mesh_domain;
 
   Tr& tr = c3t3.triangulation();
 
-  typename Gt::Compare_weighted_squared_radius_3 cwsr =
+  typename GT::Compare_weighted_squared_radius_3 cwsr =
     tr.geom_traits().compare_weighted_squared_radius_3_object();
-  typename Gt::Construct_point_3 cp =
+  typename GT::Construct_point_3 cp =
     tr.geom_traits().construct_point_3_object();
-  typename Gt::Construct_weighted_point_3 cwp =
+  typename GT::Construct_weighted_point_3 cwp =
     tr.geom_traits().construct_weighted_point_3_object();
 
   if(protect_features) {
diff --git a/Mesh_3/include/CGAL/Mesh_3/mesh_standard_cell_criteria.h b/Mesh_3/include/CGAL/Mesh_3/mesh_standard_cell_criteria.h
index 5fed977c7ef8..c5a148d78fa8 100644
--- a/Mesh_3/include/CGAL/Mesh_3/mesh_standard_cell_criteria.h
+++ b/Mesh_3/include/CGAL/Mesh_3/mesh_standard_cell_criteria.h
@@ -395,8 +395,8 @@ class Cell_criteria_visitor_with_features
   typedef Criterion_visitor<Tr, typename Tr::Cell_handle> Base;
   typedef Cell_criteria_visitor_with_features<Tr> Self;
 
-  typedef typename Tr::Geom_traits    Gt;
-  typedef typename Gt::FT             FT;
+  typedef typename Tr::Geom_traits    GT;
+  typedef typename GT::FT             FT;
   typedef typename Tr::Weighted_point Weighted_point;
 
 
@@ -414,11 +414,11 @@ class Cell_criteria_visitor_with_features
     , ratio_(0)
     , size_ratio_(0.5*0.5*4.)
   {
-    typename Gt::Compare_weighted_squared_radius_3 compare =
+    typename GT::Compare_weighted_squared_radius_3 compare =
       tr.geom_traits().compare_weighted_squared_radius_3_object();
-    typename Gt::Compute_weight_3 cw =
+    typename GT::Compute_weight_3 cw =
       tr.geom_traits().compute_weight_3_object();
-    typename Gt::Compute_squared_radius_smallest_orthogonal_sphere_3 sq_radius =
+    typename GT::Compute_squared_radius_smallest_orthogonal_sphere_3 sq_radius =
       tr.geom_traits().compute_squared_radius_smallest_orthogonal_sphere_3_object();
 
     int k1 = 0;
@@ -560,8 +560,8 @@ class Cell_criterion_visitor_with_radius_lower_bound
   typedef Cell_criteria_visitor_with_features<Tr> Base;
   typedef Cell_criterion_visitor_with_radius_lower_bound<Tr> Self;
 
-  typedef typename Tr::Geom_traits    Gt;
-  typedef typename Gt::FT             FT;
+  typedef typename Tr::Geom_traits    GT;
+  typedef typename GT::FT             FT;
 
 public:
   typedef typename Base::Quality  Cell_quality;
diff --git a/Mesh_3/include/CGAL/Mesh_3/mesh_standard_facet_criteria.h b/Mesh_3/include/CGAL/Mesh_3/mesh_standard_facet_criteria.h
index ed57357bda90..4e42d3810054 100644
--- a/Mesh_3/include/CGAL/Mesh_3/mesh_standard_facet_criteria.h
+++ b/Mesh_3/include/CGAL/Mesh_3/mesh_standard_facet_criteria.h
@@ -102,14 +102,14 @@ class Aspect_ratio_criterion :
     CGAL_assertion (f.first->is_facet_on_surface(f.second));
     CGAL_assertion (B_ != 0);
 
-    typedef typename Tr::Geom_traits      Gt;
+    typedef typename Tr::Geom_traits      GT;
     typedef typename Tr::Bare_point       Bare_point;
     typedef typename Tr::Weighted_point   Weighted_point;
 
-    typedef typename Gt::Compute_squared_area_3     Area;
-    typedef typename Gt::Compute_squared_distance_3 Distance;
-    typedef typename Gt::Construct_point_3          Construct_point_3;
-    typedef typename Gt::Construct_triangle_3       Construct_triangle_3;
+    typedef typename GT::Compute_squared_area_3     Area;
+    typedef typename GT::Compute_squared_distance_3 Distance;
+    typedef typename GT::Construct_point_3          Construct_point_3;
+    typedef typename GT::Construct_triangle_3       Construct_triangle_3;
 
     Area area = tr.geom_traits().compute_squared_area_3_object();
     Distance distance = tr.geom_traits().compute_squared_distance_3_object();
@@ -127,7 +127,7 @@ class Aspect_ratio_criterion :
     const FT d12 = distance(p1,p2);
     const FT d13 = distance(p1,p3);
     const FT d23 = distance(p2,p3);
-    const FT min_d123 = details::min_3<Gt>(d12,d13,d23);
+    const FT min_d123 = details::min_3<GT>(d12,d13,d23);
 
     const FT aspect_ratio = 4 * triangle_area * min_d123 / (d12*d13*d23);
 
@@ -193,11 +193,11 @@ class Uniform_curvature_size_criterion :
     CGAL_assertion(f.first->is_facet_on_surface(f.second));
     CGAL_assertion (B_ != 0);
 
-    typedef typename Tr::Geom_traits    Gt;
+    typedef typename Tr::Geom_traits    GT;
     typedef typename Tr::Weighted_point Weighted_point;
     typedef typename Tr::Bare_point Bare_point;
 
-    typename Gt::Construct_weighted_circumcenter_3 weighted_circumcenter =
+    typename GT::Construct_weighted_circumcenter_3 weighted_circumcenter =
         tr.geom_traits().construct_weighted_circumcenter_3_object();
 
     const Weighted_point& p1 = tr.point(f.first, (f.second+1)&3);
@@ -264,11 +264,11 @@ class Variable_curvature_size_criterion :
   {
     CGAL_assertion (f.first->is_facet_on_surface(f.second));
 
-    typedef typename Tr::Geom_traits    Gt;
+    typedef typename Tr::Geom_traits    GT;
     typedef typename Tr::Weighted_point Weighted_point;
     typedef typename Tr::Bare_point Bare_point;
 
-    typename Gt::Construct_weighted_circumcenter_3 weighted_circumcenter =
+    typename GT::Construct_weighted_circumcenter_3 weighted_circumcenter =
       tr.geom_traits().construct_weighted_circumcenter_3_object();
 
     const Weighted_point& p1 = tr.point(f.first, (f.second+1)&3);
@@ -346,11 +346,11 @@ class Variable_size_criterion :
   {
     CGAL_assertion (f.first->is_facet_on_surface(f.second));
 
-    typedef typename Tr::Geom_traits    Gt;
+    typedef typename Tr::Geom_traits    GT;
     typedef typename Tr::Bare_point     Bare_point;
     typedef typename Tr::Weighted_point Weighted_point;
 
-    typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+    typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
 
     const Weighted_point& wp1 = tr.point(f.first, (f.second+1)&3);
     const Bare_point& p1 = cp(wp1);
@@ -426,11 +426,11 @@ class Uniform_size_criterion :
     CGAL_assertion (f.first->is_facet_on_surface(f.second));
     CGAL_assertion (B_ != 0);
 
-    typedef typename Tr::Geom_traits        Gt;
+    typedef typename Tr::Geom_traits        GT;
     typedef typename Tr::Bare_point         Bare_point;
     typedef typename Tr::Weighted_point     Weighted_point;
 
-    typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+    typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
 
     const Weighted_point& wp1 = tr.point(f.first, (f.second+1)&3);
     const Bare_point p1 = cp(wp1);
@@ -653,8 +653,8 @@ class Facet_criterion_visitor_with_features
   typedef Mesh_3::Criterion_visitor<Tr, typename Tr::Facet> Base;
   typedef Facet_criterion_visitor_with_features<Tr> Self;
 
-  typedef typename Tr::Geom_traits  Gt;
-  typedef typename Gt::FT           FT;
+  typedef typename Tr::Geom_traits  GT;
+  typedef typename GT::FT           FT;
 
 public:
   typedef typename Base::Quality  Facet_quality;
@@ -672,15 +672,15 @@ class Facet_criterion_visitor_with_features
     , angle_ratio_(0.5*0.5*4.)
     , size_ratio_(0.4*0.4*4.)
   {
-    typedef typename Tr::Geom_traits    Gt;
+    typedef typename Tr::Geom_traits    GT;
     typedef typename Tr::Weighted_point Weighted_point;
     typedef typename Tr::Cell_handle    Cell_handle;
 
-    typename Gt::Compute_squared_radius_smallest_orthogonal_sphere_3 sq_radius =
+    typename GT::Compute_squared_radius_smallest_orthogonal_sphere_3 sq_radius =
       tr.geom_traits().compute_squared_radius_smallest_orthogonal_sphere_3_object();
-    typename Gt::Compute_weight_3 cw =
+    typename GT::Compute_weight_3 cw =
       tr.geom_traits().compute_weight_3_object();
-    typename Gt::Compare_weighted_squared_radius_3 compare =
+    typename GT::Compare_weighted_squared_radius_3 compare =
       tr.geom_traits().compare_weighted_squared_radius_3_object();
 
     const Cell_handle& c = fh.first;
@@ -817,8 +817,8 @@ class Facet_criterion_visitor_with_radius_lower_bound
   typedef Facet_criterion_visitor_with_features<Tr> Base;
   typedef Facet_criterion_visitor_with_radius_lower_bound<Tr> Self;
 
-  typedef typename Tr::Geom_traits  Gt;
-  typedef typename Gt::FT           FT;
+  typedef typename Tr::Geom_traits  GT;
+  typedef typename GT::FT           FT;
 
 public:
   typedef typename Base::Quality  Facet_quality;
diff --git a/Mesh_3/include/CGAL/Mesh_3/sliver_criteria.h b/Mesh_3/include/CGAL/Mesh_3/sliver_criteria.h
index 335bd89291c1..6ecabd1aa906 100644
--- a/Mesh_3/include/CGAL/Mesh_3/sliver_criteria.h
+++ b/Mesh_3/include/CGAL/Mesh_3/sliver_criteria.h
@@ -36,9 +36,9 @@ template<typename Tr, //Triangulation
 class Sliver_criterion
 {
 public:
-  typedef typename Tr::Geom_traits Gt;
+  typedef typename Tr::Geom_traits GT;
   typedef typename Tr::Cell_handle Cell_handle;
-  typedef typename Gt::Tetrahedron_3 Tetrahedron_3;
+  typedef typename GT::Tetrahedron_3 Tetrahedron_3;
   typedef Cell_vector_ Cell_vector;
 
 public:
@@ -108,7 +108,7 @@ class Min_dihedral_angle_criterion
   typedef Sliver_criterion<Tr, update_sliver_cache> Base;
   typedef typename Base::Tetrahedron_3  Tetrahedron_3;
   typedef typename Base::Cell_vector    Cell_vector;
-  typedef typename Base::Gt             Gt;
+  typedef typename Base::GT             GT;
 
 public:
   typedef typename Base::Cell_handle    Cell_handle;
@@ -163,7 +163,7 @@ class Radius_ratio_criterion
 {
 protected:
   typedef Sliver_criterion<Tr, update_sliver_cache> Base;
-  typedef typename Base::Gt             Gt;
+  typedef typename Base::GT             GT;
   typedef typename Base::Tetrahedron_3  Tetrahedron_3;
   typedef typename Base::Cell_vector    Cell_vector;
   typedef Radius_ratio_criterion<Tr, update_sliver_cache> RR_criterion;
diff --git a/Mesh_3/include/CGAL/Mesh_3/vertex_perturbation.h b/Mesh_3/include/CGAL/Mesh_3/vertex_perturbation.h
index 1b1e53c93052..d33523015da0 100644
--- a/Mesh_3/include/CGAL/Mesh_3/vertex_perturbation.h
+++ b/Mesh_3/include/CGAL/Mesh_3/vertex_perturbation.h
@@ -115,13 +115,13 @@ typename Tr::Geom_traits::FT
 edge_sq_length(const typename Tr::Edge& e,
                const Tr& tr)
 {
-  typedef typename Tr::Geom_traits     Gt;
+  typedef typename Tr::Geom_traits     GT;
   typedef typename Tr::Bare_point      Bare_point;
   typedef typename Tr::Weighted_point  Weighted_point;
 
-  typename Gt::Construct_point_3 cp =
+  typename GT::Construct_point_3 cp =
     tr.geom_traits().construct_point_3_object();
-  typename Gt::Compute_squared_distance_3 sq_distance =
+  typename GT::Compute_squared_distance_3 sq_distance =
     tr.geom_traits().compute_squared_distance_3_object();
 
   const Weighted_point& wp = tr.point(e.first, e.second);
@@ -390,9 +390,9 @@ class Gradient_based_perturbation
   typedef typename Base::Cell_handle                  Cell_handle;
 
   typedef typename C3T3::Triangulation                Tr;
-  typedef typename Tr::Geom_traits                    Gt;
-  typedef typename Gt::FT                             FT;
-  typedef typename Gt::Vector_3                       Vector_3;
+  typedef typename Tr::Geom_traits                    GT;
+  typedef typename GT::FT                             FT;
+  typedef typename GT::Vector_3                       Vector_3;
 
   typedef typename Tr::Bare_point                     Bare_point;
   typedef typename Tr::Weighted_point                 Weighted_point;
@@ -447,15 +447,15 @@ class Gradient_based_perturbation
 
     const Tr& tr = c3t3.triangulation();
 
-    typename Gt::Construct_point_3 cp =
+    typename GT::Construct_point_3 cp =
       tr.geom_traits().construct_point_3_object();
-    typename Gt::Construct_weighted_point_3 cwp =
+    typename GT::Construct_weighted_point_3 cwp =
       tr.geom_traits().construct_weighted_point_3_object();
-    typename Gt::Compute_squared_length_3 sq_length =
+    typename GT::Compute_squared_length_3 sq_length =
       tr.geom_traits().compute_squared_length_3_object();
-    typename Gt::Construct_translated_point_3 translate =
+    typename GT::Construct_translated_point_3 translate =
       tr.geom_traits().construct_translated_point_3_object();
-    typename Gt::Construct_vector_3 vector =
+    typename GT::Construct_vector_3 vector =
       tr.geom_traits().construct_vector_3_object();
 
     // create a helper
@@ -548,9 +548,9 @@ class Sq_radius_perturbation
   typedef typename Base::Vertex_handle                Vertex_handle;
   typedef typename Base::Cell_handle                  Cell_handle;
 
-  typedef typename Tr::Geom_traits                    Gt;
-  typedef typename Gt::FT                             FT;
-  typedef typename Gt::Vector_3                       Vector_3;
+  typedef typename Tr::Geom_traits                    GT;
+  typedef typename GT::FT                             FT;
+  typedef typename GT::Vector_3                       Vector_3;
 
   typedef typename Tr::Bare_point                     Bare_point;
   typedef typename Tr::Weighted_point                 Weighted_point;
@@ -650,9 +650,9 @@ class Sq_radius_perturbation
   {
     const Triangulation& tr = c3t3.triangulation();
 
-    typename Gt::Construct_point_3 cp =
+    typename GT::Construct_point_3 cp =
       c3t3.triangulation().geom_traits().construct_point_3_object();
-    typename Gt::Construct_translated_point_3 translate =
+    typename GT::Construct_translated_point_3 translate =
       c3t3.triangulation().geom_traits().construct_translated_point_3_object();
 
     unsigned int index = cell->index(v);
@@ -724,9 +724,9 @@ class Volume_perturbation
   typedef typename Base::Cell_handle                  Cell_handle;
 
   typedef typename C3T3::Triangulation                Tr;
-  typedef typename Tr::Geom_traits                    Gt;
-  typedef typename Gt::FT                             FT;
-  typedef typename Gt::Vector_3                       Vector_3;
+  typedef typename Tr::Geom_traits                    GT;
+  typedef typename GT::FT                             FT;
+  typedef typename GT::Vector_3                       Vector_3;
 
   typedef typename Tr::Bare_point                     Bare_point;
   typedef typename Tr::Weighted_point                 Weighted_point;
@@ -827,7 +827,7 @@ class Volume_perturbation
     CGAL_precondition(cell->has_vertex(v));
 
     const typename C3T3::Triangulation& tr = c3t3.triangulation();
-    typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+    typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
 
     const int i = cell->index(v);
 
@@ -875,9 +875,9 @@ class Dihedral_angle_perturbation
   typedef typename Base::Cell_handle                  Cell_handle;
 
   typedef typename C3T3::Triangulation                Tr;
-  typedef typename Tr::Geom_traits                    Gt;
-  typedef typename Gt::FT                             FT;
-  typedef typename Gt::Vector_3                       Vector_3;
+  typedef typename Tr::Geom_traits                    GT;
+  typedef typename GT::FT                             FT;
+  typedef typename GT::Vector_3                       Vector_3;
 
   typedef typename Tr::Bare_point                     Bare_point;
   typedef typename Tr::Weighted_point                 Weighted_point;
@@ -979,9 +979,9 @@ class Dihedral_angle_perturbation
     CGAL_assertion(cell->has_vertex(v));
     const typename C3T3::Triangulation& tr = c3t3.triangulation();
 
-    typename Gt::Construct_point_3 cp =
+    typename GT::Construct_point_3 cp =
       tr.geom_traits().construct_point_3_object();
-    typename Gt::Compute_squared_distance_3 sq_distance =
+    typename GT::Compute_squared_distance_3 sq_distance =
       tr.geom_traits().compute_squared_distance_3_object();
 
     const int i = cell->index(v);
@@ -1041,9 +1041,9 @@ class Dihedral_angle_perturbation
   {
     const typename C3T3::Triangulation& tr = c3t3.triangulation();
 
-    typename Gt::Construct_point_3 cp =
+    typename GT::Construct_point_3 cp =
       tr.geom_traits().construct_point_3_object();
-    typename Gt::Compute_approximate_dihedral_angle_3 approx_dihedral_angle =
+    typename GT::Compute_approximate_dihedral_angle_3 approx_dihedral_angle =
       tr.geom_traits().compute_approximate_dihedral_angle_3_object();
 
     const Weighted_point& wp1 = tr.point(cell, k1);
@@ -1069,7 +1069,7 @@ class Dihedral_angle_perturbation
   {
     const typename C3T3::Triangulation& tr = c3t3.triangulation();
 
-    typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+    typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
 
     int k1 = (i+1)&3;
     int k2 = (i+2)&3;
@@ -1108,9 +1108,9 @@ class Random_based_perturbation
   typedef typename Base::Cell_handle                  Cell_handle;
 
   typedef typename C3T3::Triangulation                Tr;
-  typedef typename Tr::Geom_traits                    Gt;
-  typedef typename Gt::FT                             FT;
-  typedef typename Gt::Vector_3                       Vector_3;
+  typedef typename Tr::Geom_traits                    GT;
+  typedef typename GT::FT                             FT;
+  typedef typename GT::Vector_3                       Vector_3;
 
   typedef typename Tr::Bare_point                     Bare_point;
 
@@ -1171,7 +1171,7 @@ class Random_based_perturbation
   Vector_3 random_vector_fixed_size(const C3T3& c3t3,
                                     const FT& vector_sq_size) const
   {
-    typename Gt::Compute_squared_length_3 sq_length =
+    typename GT::Compute_squared_length_3 sq_length =
       c3t3.triangulation().geom_traits().compute_squared_length_3_object();
 
     Vector_3 rnd_vector(random_ft(),random_ft(),random_ft());
@@ -1236,9 +1236,9 @@ class Li_random_perturbation
   typedef typename Base::Cell_handle                  Cell_handle;
 
   typedef typename C3T3::Triangulation                Tr;
-  typedef typename Tr::Geom_traits                    Gt;
-  typedef typename Gt::FT                             FT;
-  typedef typename Gt::Vector_3                       Vector_3;
+  typedef typename Tr::Geom_traits                    GT;
+  typedef typename GT::FT                             FT;
+  typedef typename GT::Vector_3                       Vector_3;
 
   typedef typename Tr::Bare_point                     Bare_point;
   typedef typename Tr::Weighted_point                 Weighted_point;
@@ -1313,13 +1313,13 @@ class Li_random_perturbation
   {
     typedef Triangulation_helpers<typename C3T3::Triangulation> Th;
 
-    typename Gt::Construct_point_3 cp =
+    typename GT::Construct_point_3 cp =
       c3t3.triangulation().geom_traits().construct_point_3_object();
-    typename Gt::Construct_weighted_point_3 cwp =
+    typename GT::Construct_weighted_point_3 cwp =
       c3t3.triangulation().geom_traits().construct_weighted_point_3_object();
-    typename Gt::Construct_translated_point_3 translate =
+    typename GT::Construct_translated_point_3 translate =
       c3t3.triangulation().geom_traits().construct_translated_point_3_object();
-    typename Gt::Construct_vector_3 vector =
+    typename GT::Construct_vector_3 vector =
       c3t3.triangulation().geom_traits().construct_vector_3_object();
 
     modified_vertices.clear();
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index a4f81ce18124..4014f13835c2 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -452,7 +452,7 @@ class Polyline
 }; // end class Polyline
 
 
-template <typename Gt, typename MapIterator>
+template <typename GT, typename MapIterator>
 struct Mesh_domain_segment_of_curve_primitive{
   typedef typename std::iterator_traits<MapIterator>::value_type Map_value_type;
   typedef typename Map_value_type::first_type Curve_id;
@@ -464,7 +464,7 @@ struct Mesh_domain_segment_of_curve_primitive{
   typedef typename std::iterator_traits<
     typename Polyline::const_iterator>::value_type Point;
 
-  typedef typename Gt::Segment_3 Datum;
+  typedef typename GT::Segment_3 Datum;
 
   Id id_;
 
@@ -844,17 +844,17 @@ class Mesh_domain_with_polyline_features_3
 private:
   typedef std::map<Point_3,Corner_index> Corners;
 
-  typedef Mesh_3::internal::Polyline<Gt> Polyline;
+  typedef Mesh_3::internal::Polyline<GT> Polyline;
   typedef std::map<Curve_index, Polyline> Edges;
   typedef std::map<Curve_index, Surface_patch_index_set > Edges_incidences;
   typedef std::map<Corner_index, std::set<Curve_index> > Corners_tmp_incidences;
   typedef std::map<Corner_index, Surface_patch_index_set > Corners_incidences;
 
   typedef Mesh_3::internal::Mesh_domain_segment_of_curve_primitive<
-    Gt,
+    GT,
     typename Edges::const_iterator> Curves_primitives;
 
-  typedef CGAL::AABB_traits<Gt,
+  typedef CGAL::AABB_traits<GT,
                             Curves_primitives> AABB_curves_traits;
 
   Corners corners_;
diff --git a/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h b/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
index e7f3c4fa983b..cbaf1add1119 100644
--- a/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
@@ -97,15 +97,13 @@ provides a bound for the size criterion.
 \sa `MeshCriteria_3`
 \sa `CGAL::Mesh_criteria_3<Tr>`
 \sa `MeshDomainField_3`
-
 */
-
 template < typename Tr >
 class Mesh_edge_criteria_3
 {
 private:
   typedef Mesh_edge_criteria_3 Self;
-  typedef typename Tr::Geom_traits Gt;
+  typedef typename Tr::Geom_traits GT;
 
 public:
 
@@ -140,7 +138,7 @@ class Mesh_edge_criteria_3
                        const FT& min_length_bound = 0)
 
     : p_size_(new Mesh_3::internal::Sizing_field_container<
-                Mesh_constant_domain_field_3<Gt,Index> ,
+                Mesh_constant_domain_field_3<GT,Index> ,
                 FT,
                 Point_3,
                 Index>(length_bound))
diff --git a/Mesh_3/include/CGAL/Mesh_triangulation_3.h b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
index ee7d53ab7105..3f3ca673523e 100644
--- a/Mesh_3/include/CGAL/Mesh_triangulation_3.h
+++ b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
@@ -131,7 +131,7 @@ type to be used for the 3D triangulation embedding the mesh.
 
 \tparam MD must be a model of `MeshDomain_3`.
 
-\tparam Gt must be a model of `MeshTriangulationTraits_3` or `Default`
+\tparam GT must be a model of `MeshTriangulationTraits_3` or `Default`
 and defaults to `Kernel_traits<MD>::%Kernel`.
 
 \tparam Concurrency_tag_ enables sequential versus parallel meshing and optimization algorithms.
@@ -144,29 +144,29 @@ and defaults to `Mesh_vertex_base_3<Gt, MD>`.
 \tparam Cell_base_ must be a model of `MeshCellBase_3` or `Default`
 and defaults to `Compact_mesh_cell_base_3<Gt, MD>`.
 
-\warning To improve the robustness of the meshing process, the input traits `Gt`
+\warning To improve the robustness of the meshing process, the input traits `GT`
          is wrapped with the traits class `Robust_weighted_circumcenter_filtered_traits_3`.
-         The class `Robust_weighted_circumcenter_filtered_traits_3<Gt>` upgrades the functors
+         The class `Robust_weighted_circumcenter_filtered_traits_3<GT>` upgrades the functors
          models of `Kernel::ConstructWeightedCircumcenter_3`, `Kernel::ComputeSquaredRadius_3`,
          and `Kernel::ComputeSquaredRadiusSmallestOrthogonalSphere_3` that are
-         provided by `Gt` to use exact computations when the geometric configuration
-         is close to degenerate (e.g. almost coplanar points). <br>
+         provided by `GT` to use exact computations when the geometric configuration
+         is close to degenerate (e.g. almost coplanar points). <br><br>
          Users should therefore be aware that the traits class of the triangulation
-         will have type `Robust_weighted_circumcenter_filtered_traits_3<Gt>`.
+         will have type `Robust_weighted_circumcenter_filtered_traits_3<GT>`.
 
 \sa `make_mesh_3()`
 \sa `Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
 
 */
 template<class MD,
-         class Gt  = Default,
+         class GT = Default,
          class ConcurrencyTag = Sequential_tag,
          class VertexBase = Default,
          class CellBase   = Default>
 struct Mesh_triangulation_3
 {
 private:
-  using K = typename Default::Lazy_get<Gt, Kernel_traits<MD> >::type;
+  using K = typename Default::Lazy_get<GT, Kernel_traits<MD> >::type;
 
   using Geom_traits = typename details::Mesh_geom_traits_generator<K>::type;
 
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 4dc89cf407ec..6d50190ac98f 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -79,25 +79,25 @@ max_length(const Bbox_3& b)
 // -----------------------------------
 // Geometric traits generator
 // -----------------------------------
-template < typename Gt,
+template < typename GT,
            typename Use_exact_intersection_construction_tag >
 struct IGT_generator {};
 
-template < typename Gt >
-struct IGT_generator<Gt,CGAL::Tag_true>
+template < typename GT >
+struct IGT_generator<GT,CGAL::Tag_true>
 {
 #ifdef CGAL_MESH_3_NEW_ROBUST_INTERSECTION_TRAITS
-  typedef CGAL::Mesh_3::Robust_intersection_traits_3_new<Gt> type;
+  typedef CGAL::Mesh_3::Robust_intersection_traits_3_new<GT> type;
 #else // NOT CGAL_MESH_3_NEW_ROBUST_INTERSECTION_TRAITS
-  typedef CGAL::Mesh_3::Robust_intersection_traits_3<Gt> type;
+  typedef CGAL::Mesh_3::Robust_intersection_traits_3<GT> type;
 #endif // NOT CGAL_MESH_3_NEW_ROBUST_INTERSECTION_TRAITS
   typedef type Type;
 };
 
-template < typename Gt >
-struct IGT_generator<Gt,CGAL::Tag_false>
+template < typename GT >
+struct IGT_generator<GT,CGAL::Tag_false>
 {
-  typedef Gt type;
+  typedef GT type;
   typedef type Type;
 };
 
diff --git a/Mesh_3/test/Mesh_3/test_criteria.cpp b/Mesh_3/test/Mesh_3/test_criteria.cpp
index 317fcb5f3e96..a10460ceee22 100644
--- a/Mesh_3/test/Mesh_3/test_criteria.cpp
+++ b/Mesh_3/test/Mesh_3/test_criteria.cpp
@@ -49,8 +49,8 @@ struct Tester
   typedef typename Tr::Bare_point       Bare_point;
   typedef typename Tr::Weighted_point   Weighted_point;
 
-  typedef typename Tr::Geom_traits      Gt;
-  typedef typename Gt::FT               FT;
+  typedef typename Tr::Geom_traits      GT;
+  typedef typename GT::FT               FT;
 
   C3t3 c3t3_;
   // Cells & facets
diff --git a/Mesh_3/test/Mesh_3/test_mesh_3_issue_1554.cpp b/Mesh_3/test/Mesh_3/test_mesh_3_issue_1554.cpp
index fe31c62f6a44..f0371d3a96d3 100644
--- a/Mesh_3/test/Mesh_3/test_mesh_3_issue_1554.cpp
+++ b/Mesh_3/test/Mesh_3/test_mesh_3_issue_1554.cpp
@@ -24,7 +24,7 @@ typedef CGAL::Parallel_if_available_tag Concurrency_tag;
 typedef CGAL::Mesh_triangulation_3<Mesh_domain,
                                    CGAL::Default,
                                    Concurrency_tag>::type  Tr;
-typedef Tr::Geom_traits                                    Gt;
+typedef Tr::Geom_traits                                    GT;
 
 typedef CGAL::Mesh_complex_3_in_triangulation_3<Tr,
                                                 Mesh_domain::Corner_index,
@@ -68,7 +68,7 @@ int main(int argc, char*argv[])
   // Mesh generation
   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria, no_perturb(), no_exude());
 
-  Gt::Construct_weighted_circumcenter_3 w_circumcenter =
+  GT::Construct_weighted_circumcenter_3 w_circumcenter =
       c3t3.triangulation().geom_traits().construct_weighted_circumcenter_3_object();
 
   int return_code = 0;
diff --git a/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp b/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
index 9a0c5677168f..c44966f9cce9 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
@@ -31,9 +31,9 @@ struct Polyhedron_tester : public Tester<K>
 {
   void polyhedron() const
   {
-    typedef K Gt;
-    typedef CGAL::Polyhedron_3<Gt> Polyhedron;
-    typedef CGAL::Polyhedral_mesh_domain_3<Polyhedron, Gt> Mesh_domain;
+    typedef K GT;
+    typedef CGAL::Polyhedron_3<GT> Polyhedron;
+    typedef CGAL::Polyhedral_mesh_domain_3<Polyhedron, GT> Mesh_domain;
 
     CGAL_static_assertion((std::is_same<
                             typename Mesh_domain::Surface_patch_index,
diff --git a/Mesh_3/test/Mesh_3/test_meshing_polyhedron_with_features.cpp b/Mesh_3/test/Mesh_3/test_meshing_polyhedron_with_features.cpp
index 5cfdd17ca792..ad3c190e0565 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_polyhedron_with_features.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_polyhedron_with_features.cpp
@@ -75,9 +75,9 @@ struct Polyhedron_with_features_tester : public Tester<K>
   }
   void operator()() const
   {
-    typedef CGAL::Mesh_3::Robust_intersection_traits_3<K> Gt;
-    typedef typename CGAL::Mesh_polyhedron_3<Gt, short>::type Polyhedron;
-    typedef CGAL::Polyhedral_mesh_domain_with_features_3<Gt,
+    typedef CGAL::Mesh_3::Robust_intersection_traits_3<K> GT;
+    typedef typename CGAL::Mesh_polyhedron_3<GT, short>::type Polyhedron;
+    typedef CGAL::Polyhedral_mesh_domain_with_features_3<GT,
                                                          Polyhedron,
                                                          CGAL::Default,
                                                          short> Mesh_domain;
diff --git a/Mesh_3/test/Mesh_3/test_min_size_criteria.cpp b/Mesh_3/test/Mesh_3/test_min_size_criteria.cpp
index 427030c4c701..d42bef33f806 100644
--- a/Mesh_3/test/Mesh_3/test_min_size_criteria.cpp
+++ b/Mesh_3/test/Mesh_3/test_min_size_criteria.cpp
@@ -37,7 +37,7 @@ struct Image_tester : public Tester<K_e_i>
       Concurrency_tag>::type;
     using C3t3 = CGAL::Mesh_complex_3_in_triangulation_3<Tr>;
 
-    using Gt             = typename Tr::Geom_traits;
+    using GT             = typename Tr::Geom_traits;
     using FT             = typename Tr::Geom_traits::FT;
     using Bare_point     = typename Tr::Bare_point;
 
@@ -79,8 +79,8 @@ struct Image_tester : public Tester<K_e_i>
                                         CGAL::parameters::no_perturb());
 
     const Tr& tr = c3t3.triangulation();
-    typename Gt::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
-    typename Gt::Compute_squared_radius_3 sq_radius = tr.geom_traits().compute_squared_radius_3_object();
+    typename GT::Construct_point_3 cp = tr.geom_traits().construct_point_3_object();
+    typename GT::Compute_squared_radius_3 sq_radius = tr.geom_traits().compute_squared_radius_3_object();
 
     double max_sq_facet_radius = 0.;
     double max_sq_cell_radius = 0.;

From 97097f1f040472b2fa8b02d778ecb22b55109d05 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 26 May 2023 13:19:19 +0200
Subject: [PATCH 0313/1398] misc fixes

---
 Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h   |   2 +-
 .../include/CGAL/Gray_image_mesh_domain_3.h   |   8 +-
 .../Implicit_to_labeling_function_wrapper.h   |  38 ++---
 Mesh_3/include/CGAL/Labeled_mesh_domain_3.h   |  29 ++--
 Mesh_3/include/CGAL/Mesh_cell_base_3.h        |  23 +--
 Mesh_3/include/CGAL/Mesh_cell_criteria_3.h    |   6 +-
 .../Mesh_domain_with_polyline_features_3.h    | 136 ++++++++---------
 Mesh_3/include/CGAL/Mesh_edge_criteria_3.h    |  12 +-
 Mesh_3/include/CGAL/Mesh_facet_criteria_3.h   |  10 +-
 Mesh_3/include/CGAL/Mesh_polyhedron_3.h       |  18 ++-
 Mesh_3/include/CGAL/Mesh_triangulation_3.h    |  41 +++--
 .../CGAL/Polyhedral_complex_mesh_domain_3.h   |  87 ++++++-----
 .../include/CGAL/Polyhedral_mesh_domain_3.h   |  64 ++++----
 .../Polyhedral_mesh_domain_with_features_3.h  | 141 ++++++++++--------
 Mesh_3/include/CGAL/Triangle_accessor_3.h     |  19 +--
 15 files changed, 318 insertions(+), 316 deletions(-)

diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
index 68138d36775e..f1b619635db0 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
@@ -41,7 +41,7 @@ and `is_facet_visited(1)` in parallel must be safe)
 Moreover, the parallel algorithms require an erase counter in
 each cell (see below).
 
-\cgalRefines{SimplicialMeshCellBase_3,RegularTriangulationCellBaseWithWeightedCircumcenter_3,CopyConstructible}
+\cgalRefines{SimplicialMeshCellBase_3,RegularTriangulationCellBaseWithWeightedCircumcenter_3}
 
 \cgalHasModel `CGAL::Compact_mesh_cell_base_3<GT,MD,Tds>`
 \cgalHasModel `CGAL::Mesh_cell_base_3<GT,MD,Cb>`
diff --git a/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h b/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
index 44e555b90278..cb5f6cc262f3 100644
--- a/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
@@ -67,7 +67,6 @@ with a model of the concept `BisectionGeometricTraits_3`.
 \tparam Image_word_type is the data type encoded in the `Image`
 input file
 
-
 \cgalModels `MeshDomain_3`
 
 \sa `BisectionGeometricTraits_3`
@@ -149,13 +148,12 @@ Gray_image_mesh_domain_3
     CGAL_assertion(transform(value_outside) == 0);
   }
 
-  /// Destructor
+  // Destructor
   virtual ~Gray_image_mesh_domain_3() {}
-};  // end class Gray_image_mesh_domain_3
+};
 
-}  // end namespace CGAL
+} // namespace CGAL
 
 #include <CGAL/enable_warnings.h>
 
-
 #endif // CGAL_GRAY_IMAGE_MESH_DOMAIN_3_H
diff --git a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
index 8c1c880cb708..c57f4e4d3b38 100644
--- a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
+++ b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
@@ -157,15 +157,17 @@ For example, the multidomain described by the three functions [f1,f2,f3] and the
 The first one matches the locus of points satisfying f1(p)<0 and f2(p)<0 and f3(p)>0.<br />
 The second one matches the locus of points satisfying f1(p)>0 and f2(p)<0 and f3(p)>0.<br />
 
-\tparam ImplicitFunction provides the definition of the function.
+\tparam Function provides the definition of the function.
 This parameter stands for a model of the concept `ImplicitFunction` described in the surface mesh generation package.
-The number types `ImplicitFunction::FT` and `BGT::FT` are required to match.
+The number types `Function::FT` and `BGT::FT` are required to match.
 
 \sa `CGAL::Labeled_mesh_domain_3`.
-
 */
-
+#ifdef DOXYGEN_RUNNING
+template <class Function>
+#else
 template <class ImplicitFunction>
+#endif
 class Implicit_multi_domain_to_labeling_function_wrapper
 {
   template <class T_>
@@ -184,20 +186,20 @@ class Implicit_multi_domain_to_labeling_function_wrapper
   };
 
 public:
-  typedef int                     return_type;
-  typedef ImplicitFunction        Function;
-  typedef typename Implicit_function_traits<ImplicitFunction>::Point   Point_3;
-
   /// \name Types
   /// @{
-  //!
-  typedef std::vector<Function>   Function_vector;
+
 #ifdef DOXYGEN_RUNNING
- //!
-  typedef typename Function::Point     Point_3;
+  typedef typename Function::Point                             Point_3;
+#else
+  typedef ImplicitFunction                                     Function;
+  typedef typename Implicit_function_traits<Function>::Point   Point_3;
+  typedef int                                                  return_type;
 #endif
-  /// @}
 
+  typedef std::vector<Function>                                Function_vector;
+
+  /// @}
 
 private:
   std::vector<Function> funcs;
@@ -205,15 +207,15 @@ class Implicit_multi_domain_to_labeling_function_wrapper
   std::vector<Bmask> bmasks;
 
 public:
-
-
   /// \name Creation
   /// @{
 
   /*!
    * \brief Construction from a vector of implicit functions and a vector of vector of signs.
+   *
    * \param implicit_functions the vector of implicit functions.
    * \param position_vectors the vector of vector of signs. Each vector of positions describes a component.
+   *
    * \sa `Sign`
    */
   Implicit_multi_domain_to_labeling_function_wrapper (const Function_vector& implicit_functions, const std::vector<std::vector<Sign> >& position_vectors)
@@ -246,6 +248,7 @@ class Implicit_multi_domain_to_labeling_function_wrapper
   }
   /*!
    * \brief Construction from a vector of implicit functions.
+
    * \param implicit_functions the vector of implicit functions.
    *
    * Position vectors are built automatically so that the union of components equals the union of the functions.
@@ -278,6 +281,7 @@ class Implicit_multi_domain_to_labeling_function_wrapper
 
   /*!
    * \brief Construction from a vector of implicit functions and a vector of strings.
+   *
    * \param implicit_functions the vector of implicit functions.
    * \param position_strings the vector of strings. The strings contained in this vector must contain '+' or '-' only. Each string (vector of positions) describes a component.
    */
@@ -337,9 +341,7 @@ class Implicit_multi_domain_to_labeling_function_wrapper
   }
 };
 
-}  // end namespace CGAL
-
-
+} // end namespace CGAL
 
 #if defined(BOOST_MSVC)
 #  pragma warning(pop)
diff --git a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
index 3782f9d46f47..b273da9af2e3 100644
--- a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
@@ -336,7 +336,9 @@ Let `p` be a Point.
 `CGAL::Implicit_multi_domain_to_labeling_function_wrapper` is a good candidate for this template parameter
 if there are several components to mesh.
 
-The function type can be any model of the concept `Callable` compatible with the signature `Subdomain_index(const Point_3&)`: it can be a function, a function object, a lambda expression... that takes a `%Point_3` as argument, and returns a type convertible to `Subdomain_index`.
+The function type can be any model of the concept `Callable` compatible with the signature
+`Subdomain_index(const %Point_3&)`: it can be a function, a function object, a lambda expression...
+that takes a `%Point_3` as argument, and returns a type convertible to `Subdomain_index`.
 
 \cgalModels `MeshDomain_3`
 
@@ -350,9 +352,9 @@ template<class BGT,
                                                 Subdomain_index_> >
 class Labeled_mesh_domain_3
 #ifndef DOXYGEN_RUNNING
-: protected details::Labeled_mesh_domain_3_impl<BGT,
-                                                Subdomain_index_,
-                                                Surface_patch_index_>
+  : protected details::Labeled_mesh_domain_3_impl<BGT,
+                                                  Subdomain_index_,
+                                                  Surface_patch_index_>
 #endif
 {
 public:
@@ -381,7 +383,7 @@ class Labeled_mesh_domain_3
   /// The number type (a field type) of the geometric traits class
   typedef typename Geom_traits::FT           FT;
 ///@}
-#else
+#else // DOXYGEN_RUNNING
   typedef boost::optional<Subdomain_index>  Subdomain;
 
   // Type of indexes for cells of the input complex
@@ -428,7 +430,7 @@ class Labeled_mesh_domain_3
   typedef typename BGT::FT FT;
   typedef BGT Geom_traits;
   using Impl_details::construct_pair_functor;
-#endif
+#endif // DOXYGEN_RUNNING
 
 /// \name Creation
 /// @{
@@ -451,16 +453,19 @@ class Labeled_mesh_domain_3
    *      \cgalParamDefault{FT(1e-3)}
    *   \cgalParamNEnd
    * \cgalNamedParamsEnd
+   *
    * \cgalHeading{Example}
    * From the example (\ref Mesh_3/mesh_implicit_domains_2.cpp):
    * \snippet Mesh_3/mesh_implicit_domains_2.cpp Domain creation
-   *
    */
   template<typename Function, typename Bounding_object, typename CGAL_NP_TEMPLATE_PARAMETERS>
   Labeled_mesh_domain_3(const Function& function,
                         const Bounding_object& bounding_object,
-                        const CGAL_NP_CLASS& np = parameters::default_values(),
-                        typename std::enable_if<!is_named_function_parameter<Function>>::type* = nullptr)
+                        const CGAL_NP_CLASS& np = parameters::default_values()
+#ifndef DOXYGEN_RUNNING
+                        , typename std::enable_if<!is_named_function_parameter<Function>>::type* = nullptr
+#endif // DOXYGEN_RUNNING
+                        )
   :Impl_details(function,
                 bounding_object,
                 parameters::choose_parameter(parameters::get_parameter(np, internal_np::error_bound), FT(1e-3)),
@@ -496,7 +501,7 @@ class Labeled_mesh_domain_3
   template<typename Function, typename Bounding_object>
 #if !defined(BOOST_MSVC)
   CGAL_DEPRECATED
-#endif
+#endif // BOOST_MSVC
   Labeled_mesh_domain_3(const Function& function,
                         const Bounding_object& bounding_object,
                         double error_bound,
@@ -505,8 +510,8 @@ class Labeled_mesh_domain_3
                           bounding_object,
                           parameters::relative_error_bound(error_bound))
   {}
-#endif
-#endif
+#endif // CGAL_NO_DEPRECATED_CODE
+#endif // DOXYGEN_RUNNING
 
 /// \name Creation of domains from 3D images
 /// @{
diff --git a/Mesh_3/include/CGAL/Mesh_cell_base_3.h b/Mesh_3/include/CGAL/Mesh_cell_base_3.h
index 787124c3ec75..14f18f4a09bd 100644
--- a/Mesh_3/include/CGAL/Mesh_cell_base_3.h
+++ b/Mesh_3/include/CGAL/Mesh_cell_base_3.h
@@ -125,15 +125,14 @@ of the concept `RegularTriangulationCellBaseWithWeightedCircumcenter_3` and defa
 \sa `CGAL::Compact_mesh_cell_base_3<GT, MD, Tds>`
 
 */
-template< class GT,
-  class MD,
-  class Cb= CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3<
-              GT, CGAL::Regular_triangulation_cell_base_3<GT> > >
+template<class GT,
+         class MD,
+         class Cb = CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3<
+                      GT, CGAL::Regular_triangulation_cell_base_3<GT> > >
 class Mesh_cell_base_3
-: public Mesh_3::Mesh_surface_cell_base_3<GT, MD, Cb>
 #ifndef DOXYGEN_RUNNING
-, public Mesh_cell_base_3_base<
-    typename Mesh_3::Mesh_surface_cell_base_3<GT, MD, Cb>::Tds::Concurrency_tag>
+  : public Mesh_3::Mesh_surface_cell_base_3<GT, MD, Cb>,
+    public Mesh_cell_base_3_base<typename Mesh_3::Mesh_surface_cell_base_3<GT, MD, Cb>::Tds::Concurrency_tag>
 #endif
 {
   typedef typename GT::FT FT;
@@ -163,7 +162,6 @@ class Mesh_cell_base_3
     typedef Mesh_cell_base_3 <GT, MD, Cb3> Other;
   };
 
-  // Constructors
   Mesh_cell_base_3()
     : Base()
     , subdomain_index_()
@@ -225,6 +223,9 @@ class Mesh_cell_base_3
   bool is_cache_valid() const { return sliver_cache_validity_; }
   void reset_cache_validity() const { sliver_cache_validity_ = false;  }
 
+  /// \name I/O
+  ///@{
+
   static
   std::string io_signature()
   {
@@ -233,6 +234,8 @@ class Mesh_cell_base_3
       + Get_io_signature<Base>()();
   }
 
+  /// @}
+
 #ifdef CGAL_INTRUSIVE_LIST
 public:
   Cell_handle next_intrusive() const { return next_intrusive_; }
@@ -248,8 +251,9 @@ class Mesh_cell_base_3
   }
 #endif // CGAL_INTRUSIVE_LIST
 
-  /// For the determinism of Compact_container iterators
+  /// \name Determinism
   ///@{
+
   typedef Tag_true Has_timestamp;
 
   std::size_t time_stamp() const {
@@ -258,6 +262,7 @@ class Mesh_cell_base_3
   void set_time_stamp(const std::size_t& ts) {
     time_stamp_ = ts;
   }
+
   ///@}
 
 private:
diff --git a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
index eab9f7944409..b13a99555211 100644
--- a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
@@ -44,9 +44,7 @@ and a sizing field which may be a uniform or variable field.
 \sa `MeshCriteria_3`
 \sa `CGAL::Mesh_criteria_3<Tr>`
 \sa `CGAL::make_mesh_3()`
-
 */
-
 template <typename Tr
 #ifndef DOXYGEN_RUNNING
           ,typename Visitor_ = Mesh_3::Cell_criterion_visitor_with_radius_lower_bound<Tr>
@@ -63,6 +61,8 @@ class Mesh_cell_criteria_3
   */
   typedef typename Tr::Geom_traits::FT FT;
 
+  /// @}
+
   typedef Visitor_ Visitor;
   typedef typename Visitor::Cell_quality Cell_quality;
   typedef typename Visitor::Is_cell_bad  Is_cell_bad;
@@ -75,8 +75,6 @@ class Mesh_cell_criteria_3
 
   typedef Mesh_cell_criteria_3<Tr> Self;
 
-  /// @}
-
 public:
 
   /// \name Creation
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 4014f13835c2..a8cfa8a26108 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -62,7 +62,7 @@ class Polyline
   Polyline() {}
   ~Polyline() {}
 
-  /// Add a point at the end of the polyline
+  /// adds a point at the end of the polyline
   void add_point(const Point_3& p)
   {
     if( points_.empty() || p != end_point() ) {
@@ -70,27 +70,27 @@ class Polyline
     }
   }
 
-  /// Returns the starting point of the polyline
+  /// returns the starting point of the polyline
   const Point_3& start_point() const
   {
     CGAL_assertion( ! points_.empty() );
     return points_.front();
   }
 
-  /// Returns the ending point of the polyline
+  /// returns the ending point of the polyline
   const Point_3& end_point() const
   {
     CGAL_assertion( ! points_.empty() );
     return points_.back();
   }
 
-  /// Returns `true` if the polyline is not degenerated
+  /// returns `true` if the polyline is not degenerated
   bool is_valid() const
   {
     return points_.size() > 1;
   }
 
-  /// Returns `true` if polyline is a loop
+  /// returns `true` if polyline is a loop
   bool is_loop() const
   {
     return start_point() == end_point();
@@ -201,7 +201,7 @@ class Polyline
   }
 
 
-  /// Returns the angle at the first point.
+  /// returns the angle at the first point.
   /// \pre The polyline must be a loop.
   Angle angle_at_first_point() const {
     CGAL_precondition(is_loop());
@@ -211,7 +211,7 @@ class Polyline
     return angle(prev, first, next_p);
   }
 
-  /// Returns the length of the polyline
+  /// returns the length of the polyline
   FT length() const
   {
     //TODO: cache result
@@ -227,7 +227,7 @@ class Polyline
     return result;
   }
 
-  /// Returns signed geodesic distance between `p` and `q`.
+  /// returns signed geodesic distance between `p` and `q`.
   FT signed_geodesic_distance(const Point_3& p, const Point_3& q) const
   {
     // Locate p & q on polyline
@@ -259,7 +259,7 @@ class Polyline
   }
 
 
-  /// Returns a point at geodesic distance `distance` from p along the
+  /// returns a point at geodesic distance `distance` from p along the
   /// polyline. The polyline is oriented from starting point to end point.
   /// The distance could be negative.
   Point_3 point_at(const Point_3& p, FT distance) const
@@ -332,7 +332,7 @@ class Polyline
     return (points_.end() - 2);
   }
 
-  /// Returns an iterator on the starting point of the segment of the
+  /// returns an iterator on the starting point of the segment of the
   /// polyline which contains p
   /// if end_point_first is true, then --end is returned instead of begin
   /// if p is the starting point of a loop.
@@ -523,28 +523,25 @@ features into any model of the `MeshDomain_3` concept.
 The 1-dimensional features are described as polylines
 whose endpoints are the added corners.
 
-\tparam MD is the type
-of the domain which should be extended.
-It has to be a model of the `MeshDomain_3` concept.
+\tparam MD is the type of the domain which is extended. It has to be a model of the `MeshDomain_3` concept.
 
 \cgalModels `MeshDomainWithFeatures_3`
 
-\sa `MeshDomain_3`
 \sa `MeshPolyline_3`
 \sa `CGAL::Implicit_mesh_domain_3<Function,BGT>`
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT>`
 \sa `CGAL::Labeled_image_mesh_domain_3<Image,BGT>`
-
 */
 template < typename MD >
 class Mesh_domain_with_polyline_features_3
   : public MD
 {
-  typedef Mesh_domain_with_polyline_features_3<MD> Self;
+  typedef Mesh_domain_with_polyline_features_3<MD>   Self;
 
 public:
-/// \name Types
-/// @{
+  /// \name Types
+  /// @{
+
   typedef typename MD::Surface_patch_index           Surface_patch_index;
   typedef typename MD::Subdomain_index               Subdomain_index;
   typedef int                                        Curve_index;
@@ -562,24 +559,21 @@ class Mesh_domain_with_polyline_features_3
 
   typedef CGAL::Tag_true                             Has_features;
   typedef typename MD::R::FT                         FT;
-/// @}
 
-#ifndef DOXYGEN_RUNNING
+  /// @}
 
 #ifndef CGAL_NO_DEPRECATED_CODE
-  typedef Curve_index Curve_segment_index;
+  typedef Curve_index                                Curve_segment_index;
 #endif
 
-  typedef typename MD::R           Gt;
-  typedef Gt                       R;
-  typedef typename MD::Point_3     Point_3;
-#endif // DOXYGEN_RUNNING
+  typedef typename MD::R                             GT;
+  typedef GT                                         R;
+  typedef typename MD::Point_3                       Point_3;
 
-/// \name Creation
-/// Constructors. Forwards the arguments to the constructor
-/// of the base class.
-/// @{
+  /// \name Creation
+  /// @{
 
+  // forwards the arguments to the constructor of the base class.
   template <typename ... T>
   Mesh_domain_with_polyline_features_3(const T& ...o)
     : MD(o...)
@@ -589,15 +583,14 @@ class Mesh_domain_with_polyline_features_3
 
   Mesh_domain_with_polyline_features_3(const Mesh_domain_with_polyline_features_3&) = default;
 
-/// @}
+  /// @}
 
-/// \name Operations
-/// @{
+  /// \name Operations
+  /// @{
 
   /// @cond DEVELOPERS
-  /// @{
 
-  /// Add a 0-dimensional feature in the domain.
+  /// adds a 0-dimensional feature in the domain.
   Corner_index add_corner(const Point_3& p);
 
   /// Overload where the last parameter `out` is not `CGAL::Emptyset_iterator()`.
@@ -607,8 +600,9 @@ class Mesh_domain_with_polyline_features_3
               IndicesOutputIterator out  /*= CGAL::Emptyset_iterator()*/);
 
   /*!
-    Add 0-dimensional features in the domain. The value type of `InputIterator` must
-    be `Point_3`.
+    adds 0-dimensional features in the domain.
+
+    The value type of `InputIterator` must be `Point_3`.
   */
   template <typename InputIterator>
   void
@@ -641,11 +635,13 @@ class Mesh_domain_with_polyline_features_3
   add_features_with_context(InputIterator first, InputIterator end,
                             IndicesOutputIterator out /*=
                                                         CGAL::Emptyset_iterator()*/);
-  /// @}
-  /// \endcond
+
+  /// @endcond
+
   /*!
-    Add 1-dimensional features in the domain. `InputIterator` value type must
-    be a model of the concept `MeshPolyline_3`.
+    adds 1-dimensional features in the domain.
+
+    The value type of `InputIterator` must be a model of the concept `MeshPolyline_3`.
   */
   template <typename InputIterator>
   void
@@ -653,16 +649,17 @@ class Mesh_domain_with_polyline_features_3
   { add_features(first, end, CGAL::Emptyset_iterator()); }
 
   /// @cond DEVELOPERS
-  /// Undocumented function, kept for backward-compatibility with existing
-  /// code
+
+  /// Undocumented function, kept for backward-compatibility with existing code
   template <typename InputIterator>
   void
   add_features_with_context(InputIterator first, InputIterator end)
   { add_features_with_context(first, end, CGAL::Emptyset_iterator()); }
+
   /// @endcond
 
   /*!
-    Add 1-dimensional features (curves) from the range `[first, end)` in the domain with their incidences
+    adds 1-dimensional features (curves) from the range `[first, end)` in the domain with their incidences
     with 2-dimensional features (patches) of the domain.
 
     \tparam InputIterator input iterator over curves
@@ -695,57 +692,57 @@ class Mesh_domain_with_polyline_features_3
                                 incident_patches_indices_pmap,
                                 CGAL::Emptyset_iterator());
   }
-/// @}
 
-/// \name Implementation of the concept MeshDomainWithFeatures_3
-/// The following methods implement the requirement of the concept
-/// `MeshDomainWithFeatures_3`.
-/// @{
+  /// @}
 
-  /// Implements `MeshDomainWithFeatures_3::get_corners()`.
-  /// OutputIterator value type is std::pair<Corner_index, Point_3>
+  /// \name Implementation of the concept MeshDomainWithFeatures_3
+  /// The following methods implement the requirement of the concept
+  /// `MeshDomainWithFeatures_3`.
+  /// @{
+
+  /// implements `MeshDomainWithFeatures_3::get_corners()`.
+  /// OutputIterator is std::pair<Corner_index, Point_3>
   template <typename OutputIterator>
   OutputIterator get_corners(OutputIterator out) const;
 
-  /// Implements `MeshDomainWithFeatures_3::get_curves()`.
+  /// implements `MeshDomainWithFeatures_3::get_curves()`.
   /// OutputIterator value type is std::tuple<Curve_index,
   /// std::pair<Point_3,Index>, std::pair<Point_3,Index> >
   template <typename OutputIterator>
   OutputIterator get_curves(OutputIterator out) const;
 
-  /// Implements `MeshDomainWithFeatures_3::curve_segment_length()`.
+  /// implements `MeshDomainWithFeatures_3::curve_segment_length()`.
   FT curve_segment_length(const Point_3& p, const Point_3 q,
                           const Curve_index& curve_index,
                           CGAL::Orientation orientation) const;
 
-  /// Implements `MeshDomainWithFeatures_3::curve_length()`.
+  /// implements `MeshDomainWithFeatures_3::curve_length()`.
   FT curve_length(const Curve_index& curve_index) const;
 
-  /// Implements `MeshDomainWithFeatures_3::construct_point_on_curve()`.
+  /// implements `MeshDomainWithFeatures_3::construct_point_on_curve()`.
   Point_3
   construct_point_on_curve(const Point_3& starting_point,
                            const Curve_index& curve_index,
                            FT distance) const;
-  /// Implements `MeshDomainWithFeatures_3::distance_sign_along_loop()`.
+  /// implements `MeshDomainWithFeatures_3::distance_sign_along_loop()`.
   CGAL::Sign distance_sign_along_loop(const Point_3& p,
                                       const Point_3& q,
                                       const Point_3& r,
                                       const Curve_index& index) const;
 
-  /// Implements `MeshDomainWithFeatures_3::distance_sign()`.
+  /// implements `MeshDomainWithFeatures_3::distance_sign()`.
   CGAL::Sign distance_sign(const Point_3& p, const Point_3& q,
                            const Curve_index& index) const;
 
-  /// Implements `MeshDomainWithFeatures_3::is_loop()`.
+  /// implements `MeshDomainWithFeatures_3::is_loop()`.
   bool is_loop(const Curve_index& index) const;
 
-  /// Implements `MeshDomainWithFeatures_3::is_curve_segment_covered()`.
+  /// implements `MeshDomainWithFeatures_3::is_curve_segment_covered()`.
   bool is_curve_segment_covered(const Curve_index& index,
                                 CGAL::Orientation orientation,
                                 const Point_3& c1, const Point_3& c2,
                                 const FT sq_r1, const FT sq_r2) const;
 
-
   /**
    * Returns the index to be stored in a vertex lying on the surface identified
    * by `index`.
@@ -760,11 +757,11 @@ class Mesh_domain_with_polyline_features_3
   Index index_from_subdomain_index(const Subdomain_index& index) const
   { return Index(index); }
 
-  /// Returns an `Index` from a `Curve_index`
+  /// returns an `Index` from a `Curve_index`
   Index index_from_curve_index(const Curve_index& index) const
   { return Index(index); }
 
-  /// Returns an `Index` from a `Corner_index`
+  /// returns an `Index` from a `Corner_index`
   Index index_from_corner_index(const Corner_index& index) const
   { return Index(index); }
 
@@ -782,11 +779,11 @@ class Mesh_domain_with_polyline_features_3
   Subdomain_index subdomain_index(const Index& index) const
   { return boost::get<Subdomain_index>(index); }
 
-  /// Returns a `Curve_index` from an `Index`
+  /// returns a `Curve_index` from an `Index`
   Curve_index curve_index(const Index& index) const
   { return boost::get<Curve_index>(index); }
 
-  /// Returns a `Corner_index` from an `Index`
+  /// returns a `Corner_index` from an `Index`
   Corner_index corner_index(const Index& index) const
   { return boost::get<Corner_index>(index); }
 
@@ -832,12 +829,12 @@ class Mesh_domain_with_polyline_features_3
   Curve_index insert_edge(InputIterator first, InputIterator end);
   /// @endcond
 
-/// @}
+  /// @}
 
 private:
   void compute_corners_incidences();
 
-  /// Returns Index associated to p (p must be the coordinates of a corner
+  /// returns Index associated to p (p must be the coordinates of a corner
   /// point)
   Index point_corner_index(const Point_3& p) const;
 
@@ -918,9 +915,11 @@ class Mesh_domain_with_polyline_features_3
     timer.stop();
     std::cerr << " done (" << timer.time() * 1000 << " ms)" << std::endl;
 #endif
-  } // end build_curves_aabb_tree()
+  } // build_curves_aabb_tree()
+
   /// @endcond
-};  // end class Mesh_domain_with_polyline_features_3
+
+}; // class Mesh_domain_with_polyline_features_3
 
 
 
@@ -1548,9 +1547,6 @@ is_curve_segment_covered(const Curve_index& index,
                                               c1, c2, sq_r1, sq_r2);
 }
 
-
-
 } //namespace CGAL
 
-
 #endif // CGAL_MESH_DOMAIN_WITH_POLYLINE_FEATURES_3_H
diff --git a/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h b/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
index cbaf1add1119..ca001d12072f 100644
--- a/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
@@ -122,7 +122,8 @@ class Mesh_edge_criteria_3
   /// \name Creation
   /// @{
   /*!
-  * Returns an object to serve as criteria for edges.
+  * returns an object to serve as criteria for edges.
+  *
   * \param length_bound is an upper bound
   * for the length of the edges which are used to discretize the curves.
   * \param min_length_bound is a desired lower bound
@@ -132,7 +133,7 @@ class Mesh_edge_criteria_3
   * break all the surface topology guarantees of the meshing algorithm.
   * It is not guaranteed to be exactly respected in the output mesh.
   *
-  * \note if one parameter is set to 0, then its corresponding criterion is ignored.
+  * \note If one parameter is set to 0, then its corresponding criterion is ignored.
   */
   Mesh_edge_criteria_3(const FT& length_bound,
                        const FT& min_length_bound = 0)
@@ -149,13 +150,12 @@ class Mesh_edge_criteria_3
   // as int.
 
   /*!
-  * @tparam SizingField a model of `MeshDomainField_3`
-  *
-  * Returns an object to serve as criteria for edges.
+  * returns an object to serve as criteria for edges.
   * The behavior and semantic of the argument are the same
   * as above, except that the `length_bound`
   * parameter is a functional instead of a constant.
-
+  *
+  * @tparam SizingField a model of `MeshDomainField_3`
   */
   template < typename SizingField >
   Mesh_edge_criteria_3
diff --git a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
index b35a7e78f95b..30adfbd26f40 100644
--- a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
@@ -68,6 +68,8 @@ class Mesh_facet_criteria_3
   */
   typedef typename Tr::Geom_traits::FT FT;
 
+  /// @}
+
   typedef Visitor_ Visitor;
   typedef typename Visitor::Facet_quality Facet_quality;
   typedef typename Visitor::Is_facet_bad  Is_facet_bad;
@@ -84,15 +86,13 @@ class Mesh_facet_criteria_3
 public:
   typedef CGAL::Tag_true Has_manifold_criterion;
 
-/// @}
-
-
   /// \name Creation
   /// @{
 
 #ifdef DOXYGEN_RUNNING
  /*!
-    Returns an object to serve as criteria for facets.
+    returns an object to serve as criteria for facets.
+
     \param angle_bound is the lower bound for the angle in degrees of the
     surface mesh facets.
     \param radius_bound is a uniform upper bound
@@ -105,6 +105,7 @@ class Mesh_facet_criteria_3
     \param min_radius_bound is a uniform lower bound for the radius of
     the surface Delaunay balls. Only facets with a radius larger than that
     bound will be refined.
+
     @note If one parameter is set to 0, then its corresponding
     criterion is ignored.
   */
@@ -154,6 +155,7 @@ class Mesh_facet_criteria_3
 
    /**
    * @brief returns whether the facet `facet` is bad or not.
+   *
    * @param tr the triangulation within which `facet` lives
    * @param facet the facet
    */
diff --git a/Mesh_3/include/CGAL/Mesh_polyhedron_3.h b/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
index f179ca9233d9..8e053945d604 100644
--- a/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
+++ b/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
@@ -214,34 +214,40 @@ class Mesh_polyhedron_items : public CGAL::Polyhedron_items_3 {
 
 The class `Mesh_polyhedron_3` provides a customized `Polyhedron_3` type. This type uses
 as `PolyhedronItems_3` a customized type which adds data to the Vertex, Face and
-Halfedge class. Those data are required to use the detection of sharp features.
+Halfedge classes. Those data are required to use the detection of sharp features.
 
 \tparam IGT stands for the geometric traits associated
 to the meshing process. It must be a model of the two concepts
 `PolyhedronTraits_3` and `IntersectionGeometricTraits_3`.
 
-\sa `CGAL::Polyhedron_3<Gt>`
+\sa `CGAL::Polyhedron_3<GT>`
 \sa `CGAL::Polyhedral_mesh_domain_with_features_3<IGT>`
 
 */
-template <typename IGT, typename Patch_id=int>
+#ifdef DOXYGEN_RUNNING
+template <typename IGT>
 struct Mesh_polyhedron_3
 {
-#ifdef DOXYGEN_RUNNING
   /// \name Types
   /// @{
 
   /*!
-    `CGAL::Polyhedron_3<IGT>` type with customized `PolyhedronItems_3`
+    `CGAL::Polyhedron_3<IGT>` type with customized `PolyhedronItems_3` designed to handle sharp feature detection.
   */
   typedef unspecified_type type;
 
   /// @}
+};
 #else
+template <typename IGT,
+          typename Patch_id = int>
+struct Mesh_polyhedron_3
+{
   typedef Polyhedron_3<IGT, Mesh_3::Mesh_polyhedron_items<Patch_id> > type;
   typedef type Type;
-#endif
 };
+#endif
+
 } // end namespace CGAL
 
 #endif // CGAL_MESH_POLYHEDRON_3_H
diff --git a/Mesh_3/include/CGAL/Mesh_triangulation_3.h b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
index 3f3ca673523e..3aca87748439 100644
--- a/Mesh_3/include/CGAL/Mesh_triangulation_3.h
+++ b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
@@ -134,15 +134,15 @@ type to be used for the 3D triangulation embedding the mesh.
 \tparam GT must be a model of `MeshTriangulationTraits_3` or `Default`
 and defaults to `Kernel_traits<MD>::%Kernel`.
 
-\tparam Concurrency_tag_ enables sequential versus parallel meshing and optimization algorithms.
-                        Possible values are `Sequential_tag` (the default), `Parallel_tag`,
-                        and `Parallel_if_available_tag`.
+\tparam ConcurrencyTag enables sequential versus parallel meshing and optimization algorithms.
+                       Possible values are `Sequential_tag` (the default), `Parallel_tag`,
+                       and `Parallel_if_available_tag`.
 
-\tparam Vertex_base__ must be a model of `MeshVertexBase_3` or `Default`
-and defaults to `Mesh_vertex_base_3<Gt, MD>`.
+\tparam VertexBase must be a model of `MeshVertexBase_3` or `Default`
+and defaults to `Mesh_vertex_base_3<GT, MD>`.
 
-\tparam Cell_base_ must be a model of `MeshCellBase_3` or `Default`
-and defaults to `Compact_mesh_cell_base_3<Gt, MD>`.
+\tparam CellBase must be a model of `MeshCellBase_3` or `Default`
+and defaults to `Compact_mesh_cell_base_3<GT, MD>`.
 
 \warning To improve the robustness of the meshing process, the input traits `GT`
          is wrapped with the traits class `Robust_weighted_circumcenter_filtered_traits_3`.
@@ -162,7 +162,7 @@ template<class MD,
          class GT = Default,
          class ConcurrencyTag = Sequential_tag,
          class VertexBase = Default,
-         class CellBase   = Default>
+         class CellBase = Default>
 struct Mesh_triangulation_3
 {
 private:
@@ -190,28 +190,25 @@ struct Mesh_triangulation_3
       Mesh_3_regular_triangulation_3_wrapper<Geom_traits, Tds>;
 
 public:
-
 #ifndef DOXYGEN_RUNNING
   using type = Triangulation;
   using Type = type;
 #else
+  /// \name Types
+  /// @{
 
-/// \name Types
-/// @{
-
-/*!
-The triangulation type to be used for the 3D triangulation embedding the mesh.
-This type is a wrapper around the type `CGAL::Regular_triangulation_3`, whose vertex
-and cell base classes are respectively `Vertex_base` and `Cell_base`.
-*/
-typedef unspecified_type type;
+  /*!
+  The triangulation type to be used for the 3D triangulation embedding the mesh.
+  This type is a wrapper around the type `CGAL::Regular_triangulation_3`, whose vertex
+  and cell base classes are respectively `VertexBase` and `CellBase`.
+  */
+  typedef unspecified_type type;
 
   /// @}
+#endif // DOXYGEN_RUNNING
+};
 
-#endif
-
-};  // end struct Mesh_triangulation_3
-}  // end namespace CGAL
+} // end namespace CGAL
 
 #include <CGAL/enable_warnings.h>
 
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 56fabd998135..987acca1567f 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -85,7 +85,7 @@ surface, the sub-domain indices on both sides are known.
 \tparam Polyhedron stands for the type of the input polyhedral surface(s),
 model of `FaceListGraph`.
 
-\tparam IGT_ stands for a geometric traits class
+\tparam IGT stands for a geometric traits class
 providing the types and functors required to implement
 the intersection tests and intersection computations
 for polyhedral boundary surfaces. This parameter has to be instantiated
@@ -93,7 +93,6 @@ with a model of the concept `IntersectionGeometricTraits_3`.
 
 \cgalModels `MeshDomainWithFeatures_3`
 
-\sa `IntersectionGeometricTraits_3`
 \sa `CGAL::make_mesh_3()`
 \sa `CGAL::Mesh_domain_with_polyline_features_3<MD>`
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT>`
@@ -104,53 +103,47 @@ template < class IGT,
            class Polyhedron = typename Mesh_polyhedron_3<IGT>::type>
 class Polyhedral_complex_mesh_domain_3
   : public Mesh_domain_with_polyline_features_3<
-      Polyhedral_mesh_domain_3< Polyhedron,
-                                IGT> >
+             Polyhedral_mesh_domain_3<Polyhedron,
+                                      IGT> >
 #else
 template < class IGT_,
            class Polyhedron_ = typename Mesh_polyhedron_3<IGT_>::type,
-           class TriangleAccessor=CGAL::Default>
+           class TriangleAccessor = CGAL::Default>
 class Polyhedral_complex_mesh_domain_3
   : public Mesh_domain_with_polyline_features_3<
       Polyhedral_mesh_domain_3< Polyhedron_,
                                 IGT_,
                                 TriangleAccessor,
-                                int,   //Use_patch_id_tag
-                                Tag_true > >//Use_exact_intersection_tag
+                                int, // Use_patch_id_tag
+                                Tag_true > >// Use_exact_intersection_tag
 #endif
 {
 public:
-  /// The base class
+  // The base class
   typedef Polyhedron_ Polyhedron;
   typedef Mesh_domain_with_polyline_features_3<
-    Polyhedral_mesh_domain_3<
-      Polyhedron, IGT_, TriangleAccessor,
-      int, Tag_true > > Base;
-  /// @cond DEVELOPERS
-private:
+            Polyhedral_mesh_domain_3<
+              Polyhedron, IGT_, TriangleAccessor, int, Tag_true > > Base;
 
+private:
+  /// @cond DEVELOPERS
   typedef Polyhedral_mesh_domain_3<Polyhedron, IGT_, CGAL::Default,
                                    int, Tag_true >       BaseBase;
   typedef Polyhedral_complex_mesh_domain_3<IGT_, Polyhedron>  Self;
   /// @endcond
 
 public:
-  /*!
-  Numerical type.
-  */
+  // Numerical type
   typedef typename Base::FT        FT;
 
-  /// The polyhedron type
+  // The polyhedron type
   typedef Polyhedron Polyhedron_type;
 
-  /// \name Index types
-  /// @{
-  /// The types are `int` or types compatible with `int`.
+  // The types are `int` or types compatible with `int`.
   typedef typename Base::Corner_index         Corner_index;
   typedef typename Base::Curve_index          Curve_index;
   typedef typename Base::Surface_patch_index  Surface_patch_index;
   typedef typename Base::Subdomain_index      Subdomain_index;
-  /// @}
 
   /// @cond DEVELOPERS
   typedef typename Base::Ray_3                Ray_3;
@@ -162,6 +155,7 @@ class Polyhedral_complex_mesh_domain_3
   typedef typename Base::AABB_primitive       AABB_primitive;
   typedef typename Base::AABB_primitive_id    AABB_primitive_id;
   typedef typename Base::Surface_patch_index  Patch_id;
+
   // Backward compatibility
 #ifndef CGAL_MESH_3_NO_DEPRECATED_SURFACE_INDEX
   typedef Surface_patch_index                 Surface_index;
@@ -192,9 +186,12 @@ class Polyhedral_complex_mesh_domain_3
   /// @endcond
 
 public:
-  /// Constructor
-  /*! Constructs a domain defined by a set of polyhedral surfaces,
-  describing a polyhedral complex.
+  /// \name Creation
+  /// @{
+
+  /*!
+  constructs a domain defined by a set of polyhedral surfaces, describing a polyhedral complex.
+
   @param begin first iterator on the input polyhedral surfaces
   @param end past the end iterator on the input polyhedral surfaces
   @param indices_begin first iterator on the pairs of subdomain indices
@@ -214,15 +211,14 @@ class Polyhedral_complex_mesh_domain_3
   */
   template <typename InputPolyhedraIterator,
             typename InputPairOfSubdomainIndicesIterator>
-  Polyhedral_complex_mesh_domain_3
-  ( InputPolyhedraIterator begin,
-    InputPolyhedraIterator end,
-    InputPairOfSubdomainIndicesIterator indices_begin,
-    InputPairOfSubdomainIndicesIterator indices_end
+  Polyhedral_complex_mesh_domain_3(InputPolyhedraIterator begin,
+                                   InputPolyhedraIterator end,
+                                   InputPairOfSubdomainIndicesIterator indices_begin,
+                                   InputPairOfSubdomainIndicesIterator indices_end
 #ifndef DOXYGEN_RUNNING
-    , CGAL::Random* p_rng = nullptr
+                                   , CGAL::Random* p_rng = nullptr
 #endif
-    )
+                                   )
     : Base(p_rng)
     , patch_indices(indices_begin, indices_end)
     , borders_detected_(false)
@@ -254,7 +250,10 @@ class Polyhedral_complex_mesh_domain_3
     this->build();
   }
 
+  /// @}
+
   /// @cond DEVELOPERS
+
   Polyhedral_complex_mesh_domain_3
     (
     CGAL::Random* p_rng = nullptr
@@ -266,17 +265,15 @@ class Polyhedral_complex_mesh_domain_3
   const std::vector<Polyhedron>& polyhedra() const {
     return stored_polyhedra;
   }
-  /// @endcond
 
-  /// @cond DEVELOPERS
   /*!
   * construct_initial_points_object() is one of the very first functions called
-  * when make_mesh_3 starts
+  * when make_mesh_3 starts.
   * BEFORE make_mesh_3 starts, we have to make sure that (at least) the borders have
   * been detected, and the polyhedral complex internal data structures initialized
   * So, this function is overloaded to make sure they are (checking that
-  * borders_detected_ is false is enough)
-  * Then, call the base class function
+  * borders_detected_ is false is enough).
+  * Then, call the base class function.
   */
   typename BaseBase::Construct_initial_points construct_initial_points_object() const
   {
@@ -289,9 +286,13 @@ class Polyhedral_complex_mesh_domain_3
   void detect_features(FT angle_in_degree,
                        std::vector<Polyhedron_type>& p,
                        const bool dont_protect);//if true, features will not be protected
+
+  void detect_borders(std::vector<Polyhedron_type>& p, const bool dont_protect);
+
   /// @endcond
+
   /*!
-  Detects sharp features and boundaries of the polyhedral components of the complex
+  detects sharp features and boundaries of the polyhedral components of the complex
   (including potential internal polyhedra),
   and inserts them as features of the domain. `angle_bound` gives the maximum
   angle (in degrees) between the two normal vectors of adjacent triangles.
@@ -303,13 +304,10 @@ class Polyhedral_complex_mesh_domain_3
     detect_features(angle_bound, stored_polyhedra, false/*do protect*/);
   }
 
-  /// @cond DEVELOPERS
-  void detect_borders(std::vector<Polyhedron_type>& p, const bool dont_protect);
-  /// @endcond
   /*!
-  Detects border edges of the polyhedral components of the complex,
+  detects border edges of the polyhedral components of the complex,
   and inserts them as features of the domain.
-  This function should be called alone only, and not before or after `detect_features()`.
+  This function should only be called alone, and not before or after `detect_features()`.
   */
   void detect_borders() {
     detect_borders(stored_polyhedra, false/*do protect*/);
@@ -373,11 +371,10 @@ class Polyhedral_complex_mesh_domain_3
         this->boundary_polyhedra_ids.push_back(poly_id);
     }
   }
-  /// @endcond
 
-  /// @cond DEVELOPERS
   template <typename C3t3>
-  void add_vertices_to_c3t3_on_patch_without_feature_edges(C3t3& c3t3) const {
+  void add_vertices_to_c3t3_on_patch_without_feature_edges(C3t3& c3t3) const
+  {
 #ifdef CGAL_MESH_3_VERBOSE
     std::cout << "add_vertices_to_c3t3_on_patch_without_feature_edges...";
     std::cout.flush();
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 6d50190ac98f..2abd37c3d77b 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -133,19 +133,17 @@ with a model of the concept `IntersectionGeometricTraits_3`.
 
 \sa `IntersectionGeometricTraits_3`
 \sa `CGAL::make_mesh_3()`.
-
 */
-
 #ifdef DOXYGEN_RUNNING
 template<class Polyhedron /*FaceGraph*/
          ,class IGT>
-#else
-template<class Polyhedron /*FaceGraph*/
-         ,class IGT_
-         ,class TriangleAccessor = CGAL::Default
-         ,class Patch_id_ = void
-         ,class Use_exact_intersection_construction_tag = CGAL::Tag_true>
-#endif
+#else // DOXYGEN_RUNNING
+template<class Polyhedron, /*FaceGraph*/
+         class IGT_,
+         class TriangleAccessor = CGAL::Default,
+         class Patch_id_ = void,
+         class Use_exact_intersection_construction_tag = CGAL::Tag_true>
+#endif // DOXYGEN_RUNNING
 class Polyhedral_mesh_domain_3
 {
 public:
@@ -155,7 +153,7 @@ class Polyhedral_mesh_domain_3
 
   typedef Patch_id_ Patch_id;
 
-  /// Geometric object types
+  // Geometric object types
   typedef typename IGT::Point_3    Point_3;
   typedef typename IGT::Segment_3  Segment_3;
   typedef typename IGT::Ray_3      Ray_3;
@@ -166,25 +164,25 @@ class Polyhedral_mesh_domain_3
   //-------------------------------------------------------
   // Index Types
   //-------------------------------------------------------
-  /// Type of indexes for cells of the input complex
+  // Type of indexes for cells of the input complex
   typedef int Subdomain_index;
   typedef boost::optional<Subdomain_index> Subdomain;
 
-  /// Type of indexes for surface patch of the input complex
+  // Type of indexes for surface patch of the input complex
   typedef typename boost::property_map<Polyhedron,
                                        face_patch_id_t<Patch_id>
                                        >::type            Face_patch_id_pmap;
   typedef typename boost::property_traits<
     Face_patch_id_pmap>::value_type                       Surface_patch_index;
   typedef boost::optional<Surface_patch_index>            Surface_patch;
-  /// Type of indexes to characterize the lowest dimensional face of the input
-  /// complex on which a vertex lie
+
+  // Type of indexes to characterize the lowest dimensional face of the input
+  // complex on which a vertex lie
   typedef typename Mesh_3::internal::Index_generator<
     Subdomain_index, Surface_patch_index>::type           Index;
 
   typedef std::tuple<Point_3,Index,int> Intersection;
 
-
   typedef typename IGT::FT         FT;
 
   // Kernel_traits compatibility
@@ -229,8 +227,6 @@ class Polyhedral_mesh_domain_3
   typedef typename AABB_traits::Bounding_box              Bounding_box;
 
 public:
-
-  /// Default constructor
   Polyhedral_mesh_domain_3(CGAL::Random* p_rng = nullptr)
     : tree_()
     , bounding_tree_(&tree_)
@@ -238,15 +234,13 @@ class Polyhedral_mesh_domain_3
   {
   }
 
-
-/// \name Creation
-/// @{
+  /// \name Creation
+  /// @{
 
   /*!
     Construction from a bounding polyhedral surface which must be closed, and free of intersections.
     The inside of `bounding_polyhedron` will be meshed.
   */
-
   Polyhedral_mesh_domain_3(const Polyhedron& bounding_polyhedron
 #ifndef DOXYGEN_RUNNING
                            , CGAL::Random* p_rng = nullptr
@@ -270,11 +264,11 @@ class Polyhedral_mesh_domain_3
     and free of intersections.
     Using this constructor allows to mesh a polyhedral surface which is not closed, or has holes.
     The inside of `bounding_polyhedron` will be meshed.
-*/
-  Polyhedral_mesh_domain_3(const Polyhedron& p
-                           ,const Polyhedron& bounding_polyhedron
+  */
+  Polyhedral_mesh_domain_3(const Polyhedron& p,
+                           const Polyhedron& bounding_polyhedron
 #ifndef DOXYGEN_RUNNING
-                           ,CGAL::Random* p_rng = nullptr
+                           , CGAL::Random* p_rng = nullptr
 #endif
                            )
     : tree_()
@@ -300,14 +294,14 @@ class Polyhedral_mesh_domain_3
    *
    * @param begin iterator for a sequence of pointers to polyhedra
    * @param end iterator for a sequence of pointers to polyhedra
-   * @param bounding_polyhedron reference to the bounding surface
+   * @param bounding_polyhedron the bounding surface
    */
   template <typename InputPolyhedraPtrIterator>
-  Polyhedral_mesh_domain_3(InputPolyhedraPtrIterator begin
-                           ,InputPolyhedraPtrIterator end
-                           ,const Polyhedron& bounding_polyhedron
+  Polyhedral_mesh_domain_3(InputPolyhedraPtrIterator begin,
+                           InputPolyhedraPtrIterator end,
+                           const Polyhedron& bounding_polyhedron
 #ifndef DOXYGEN_RUNNING
-                           ,CGAL::Random* p_rng = nullptr
+                           , CGAL::Random* p_rng = nullptr
 #endif
                            )
     : p_rng_(p_rng)
@@ -328,7 +322,7 @@ class Polyhedral_mesh_domain_3
   }
 
   /*!
-   * Constructor from a sequence of polyhedral surfaces, without bounding
+   * Constructor from a sequence of polyhedral surfaces, without a bounding
    * surface. The domain will always answer `false` to `is_in_domain()`
    * queries.
    *
@@ -356,6 +350,8 @@ class Polyhedral_mesh_domain_3
     bounding_tree_ = 0;
   }
 
+  /// @}
+
   // Destructor
   ~Polyhedral_mesh_domain_3() {
     if(bounding_tree_ != 0 && bounding_tree_ != &tree_) {
@@ -366,11 +362,9 @@ class Polyhedral_mesh_domain_3
   void set_surface_only() {
     bounding_tree_ = 0;
   }
-/// @}
-
 
   /**
-   * Constructs  a set of `n` points on the surface, and output them to
+   * constructs a set of `n` points on the surface, and output them to
    *  the output iterator `pts` whose value type is required to be
    *  `std::pair<Points_3, Index>`.
    */
@@ -422,7 +416,7 @@ class Polyhedral_mesh_domain_3
     return tree_.closest_point(p);
   }
 
-  /// Allowed query types
+  // Allowed query types
   typedef boost::mpl::vector<Segment_3, Ray_3, Line_3> Allowed_query_types;
 
   /**
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index 7c07b8a5ef21..38c2b9570f19 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -62,14 +62,14 @@ namespace CGAL {
 
 The class `Polyhedral_mesh_domain_with_features_3` implements a domain whose
 boundary is a simplicial polyhedral surface.
-This surface must be free of intersection.
-It can either be closed,
+
+This surface must be free of intersection. It can either be closed,
 included inside another polyhedral surface which is closed and free of intersection,
 or open. In the latter case, the meshing process will only take care of the quality
 of the 1D (features and boundaries) and 2D (surfaces) components of the mesh.
 
-It is a model of the concept `MeshDomainWithFeatures_3`. It also
-provides a member function to automatically detect sharp features and boundaries from
+It is a model of the concept `MeshDomainWithFeatures_3`. It also provides
+a member function to automatically detect sharp features and boundaries from
 the input polyhedral surface(s).
 
 \tparam IGT stands for a geometric traits class providing the types
@@ -78,7 +78,6 @@ for polyhedral boundary surfaces. This parameter has to be
 instantiated with a model of the concept
 `IntersectionGeometricTraits_3`.
 
-
 \tparam Polyhedron stands for the type of the input polyhedral surface(s), model of `FaceListGraph`.
 
 \cgalModels `MeshDomainWithFeatures_3`
@@ -88,25 +87,25 @@ instantiated with a model of the concept
 \sa `CGAL::Mesh_polyhedron_3<IGT>`
 */
 #ifdef DOXYGEN_RUNNING
-template < class IGT
-           ,class Polyhedron = typename Mesh_polyhedron_3<IGT_>::type>
+template <class IGT,
+          class Polyhedron = typename Mesh_polyhedron_3<IGT_>::type>
 class Polyhedral_mesh_domain_with_features_3
   : public Mesh_domain_with_polyline_features_3<
-      Polyhedral_mesh_domain_3< Polyhedron,
-                                IGT> >
+             Polyhedral_mesh_domain_3<Polyhedron,
+                                      IGT> >
 #else
-template < class IGT_
-           ,class Polyhedron_ = typename Mesh_polyhedron_3<IGT_>::type
-           ,class TriangleAccessor= CGAL::Default
-           ,class Patch_id=int
-           ,class Use_exact_intersection_construction_tag = Tag_true>
+template <class IGT_,
+          class Polyhedron_ = typename Mesh_polyhedron_3<IGT_>::type,
+          class TriangleAccessor = CGAL::Default,
+          class Patch_id = int,
+          class Use_exact_intersection_construction_tag = Tag_true>
 class Polyhedral_mesh_domain_with_features_3
   : public Mesh_domain_with_polyline_features_3<
-      Polyhedral_mesh_domain_3< Polyhedron_,
-                                IGT_,
-                                TriangleAccessor,
-                                Patch_id,
-                                Use_exact_intersection_construction_tag > >
+      Polyhedral_mesh_domain_3<Polyhedron_,
+                               IGT_,
+                               TriangleAccessor,
+                               Patch_id,
+                               Use_exact_intersection_construction_tag > >
 #endif
 {
   typedef Mesh_domain_with_polyline_features_3<
@@ -131,8 +130,9 @@ class Polyhedral_mesh_domain_with_features_3
   typedef typename Base::Surface_patch_index  Surface_patch_index;
   typedef typename Base::Subdomain_index      Subdomain_index;
 
+  // Backward-compatibility
 #ifndef CGAL_NO_DEPRECATED_CODE
-  typedef Curve_index Curve_segment_index; ///< Backward-compatibility
+  typedef Curve_index                         Curve_segment_index;
 #endif
 
   typedef typename boost::property_map<Polyhedron,
@@ -149,35 +149,26 @@ class Polyhedral_mesh_domain_with_features_3
   typedef typename Base::R         R;
   typedef typename Base::Point_3   Point_3;
 
-
-  /// \name Types
-  /// @{
-
-  /*!
-    Numerical type.
-  */
   typedef typename Base::FT        FT;
 
-  /// @}
-
   typedef CGAL::Tag_true           Has_features;
 
   typedef std::vector<Point_3> Bare_polyline;
   typedef Mesh_3::Polyline_with_context<Surface_patch_index, Curve_index,
                                         Bare_polyline > Polyline_with_context;
 
-/// \name Creation
-/// @{
+  /// \name Creation
+  /// @{
 
   /*!
-    Constructs a `Polyhedral_mesh_domain_with_features_3` from a polyhedral surface.
+    Constructor from a polyhedral surface.
     No feature detection is done at this level. Note that a copy of `bounding_polyhedron` will be done.
     The polyhedron `bounding_polyhedron` has to be closed and free of intersections.
     Its interior of `bounding_polyhedron` will be meshed.
   */
   Polyhedral_mesh_domain_with_features_3(const Polyhedron& bounding_polyhedron
 #ifndef DOXYGEN_RUNNING
-                                         ,CGAL::Random* p_rng = nullptr
+                                         , CGAL::Random* p_rng = nullptr
 #endif
                                          )
     : Base(p_rng) , borders_detected_(false)
@@ -191,14 +182,13 @@ class Polyhedral_mesh_domain_with_features_3
 
 #ifndef CGAL_NO_DEPRECATED_CODE
   /*!
-    \deprecated Constructs a `Polyhedral_mesh_domain_with_features_3` from an off file. No feature
-    detection is done at this level. Users must read the file into a `Polyhedron` and call the
-    constructor above.
+    \deprecated Constructor from an OFF file. No feature detection is done at this level.
+    Users must read the file into a `Polyhedron` and call the constructor above.
   */
   CGAL_DEPRECATED
   Polyhedral_mesh_domain_with_features_3(const std::string& filename
 #ifndef DOXYGEN_RUNNING
-                                         ,CGAL::Random* p_rng = nullptr
+                                         , CGAL::Random* p_rng = nullptr
 #endif
                                          )
     : Base(p_rng) , borders_detected_(false)
@@ -217,20 +207,20 @@ class Polyhedral_mesh_domain_with_features_3
   {
     load_from_file(filename);
   }
-#endif
+#endif // DOXYGEN_RUNNING
 #endif // not CGAL_NO_DEPRECATED_CODE
 
   /*!
-    Constructs a `Polyhedral_mesh_domain_with_features_3` from a polyhedral surface, and a bounding polyhedral surface.
+    Constructor from a polyhedral surface, and a bounding polyhedral surface.
     The first polyhedron should be entirely included inside `bounding_polyhedron`, which has to be closed
     and free of intersections.
     Using this constructor enables to mesh a polyhedral surface which is not closed, or has holes.
     The inside of `bounding_polyhedron` will be meshed.
   */
-  Polyhedral_mesh_domain_with_features_3(const Polyhedron& polyhedron
-                                         ,const Polyhedron& bounding_polyhedron
+  Polyhedral_mesh_domain_with_features_3(const Polyhedron& polyhedron,
+                                         const Polyhedron& bounding_polyhedron
 #ifndef DOXYGEN_RUNNING
-                                         ,CGAL::Random* p_rng = nullptr
+                                         , CGAL::Random* p_rng = nullptr
 #endif
                                          )
     : Base(p_rng) , borders_detected_(false)
@@ -249,10 +239,24 @@ class Polyhedral_mesh_domain_with_features_3
     }
   }
 
+  /*!
+   * Constructor from a sequence of polyhedral surfaces, without a bounding
+   * surface. The domain will always answer `false` to `is_in_domain()`
+   * queries.
+   *
+   * @tparam InputPolyhedraPtrIterator must be a model of
+   * `ForwardIterator` and value type `Polyhedron*`
+   *
+   * @param begin iterator for a sequence of pointers to polyhedra
+   * @param end iterator for a sequence of pointers to polyhedra
+   */
   template <typename InputPolyhedraPtrIterator>
   Polyhedral_mesh_domain_with_features_3(InputPolyhedraPtrIterator begin,
-                                         InputPolyhedraPtrIterator end,
-                                         CGAL::Random* p_rng = nullptr)
+                                         InputPolyhedraPtrIterator end
+#ifndef DOXYGEN_RUNNING
+                                         , CGAL::Random* p_rng = nullptr
+#endif
+                                         )
     : Base(p_rng) , borders_detected_(false)
   {
     stored_polyhedra.reserve(std::distance(begin, end));
@@ -265,11 +269,25 @@ class Polyhedral_mesh_domain_with_features_3
     this->build();
   }
 
+  /*!
+   * Constructor from a sequence of polyhedral surfaces, and a bounding
+   * polyhedral surface.
+   *
+   * @tparam InputPolyhedraPtrIterator must be a model of
+   * `ForwardIterator` and value type `Polyhedron*`
+   *
+   * @param begin iterator for a sequence of pointers to polyhedra
+   * @param end iterator for a sequence of pointers to polyhedra
+   * @param bounding_polyhedron the bounding surface
+   */
   template <typename InputPolyhedraPtrIterator>
   Polyhedral_mesh_domain_with_features_3(InputPolyhedraPtrIterator begin,
                                          InputPolyhedraPtrIterator end,
-                                         const Polyhedron& bounding_polyhedron,
-                                         CGAL::Random* p_rng = nullptr)
+                                         const Polyhedron& bounding_polyhedron
+#ifndef DOXYGEN_RUNNING
+                                         , CGAL::Random* p_rng = nullptr
+#endif
+                                         )
     : Base(p_rng) , borders_detected_(false)
   {
     stored_polyhedra.reserve(std::distance(begin, end)+1);
@@ -291,26 +309,27 @@ class Polyhedral_mesh_domain_with_features_3
     this->build();
   }
 
-  /// Destructor
-  ~Polyhedral_mesh_domain_with_features_3() {}
+  /// @}
 
-/// @}
+  // Destructor
+  ~Polyhedral_mesh_domain_with_features_3() {}
 
-  /// Detect features
+  // Detect features
   void initialize_ts(Polyhedron& p);
 
+  void detect_borders(std::vector<Polyhedron>& p);
 
   void detect_features(FT angle_in_degree, std::vector<Polyhedron>& p);
 
-/// \name Operations
-/// @{
+  /// \name Operations
+  /// @{
 
   /*!
-    Detects sharp features and boundaries of the internal bounding polyhedron (and the potential internal polyhedron)
-    and inserts them as features of the domain.
-    @param angle_bound gives the maximum
-    angle (in degrees) between the two normal vectors of adjacent triangles.
-    For an edge of the polyhedron, if the angle between the two normal vectors of its
+    detects sharp features and boundaries of the internal bounding polyhedron (and the potential
+    internal polyhedra) and inserts them as features of the domain.
+
+    @param angle_bound gives the maximum angle (in degrees) between the two normal vectors of adjacent triangles.
+    For an edge of a polyhedron, if the angle between the two normal vectors of its
     incident facets is bigger than the given bound, then the edge is considered as
     a feature edge.
   */
@@ -319,13 +338,11 @@ class Polyhedral_mesh_domain_with_features_3
     detect_features(angle_bound, stored_polyhedra);
   }
 
-  void detect_borders(std::vector<Polyhedron>& p);
-
   /*!
-    Detects border edges of the bounding polyhedron and inserts them as features of the domain.
-    This function should be called alone only, and not before or after `detect_features()`.
-  */
+    detects border edges of the bounding polyhedron and inserts them as features of the domain.
 
+    This function should only be called alone, and not before or after `detect_features()`.
+  */
   void detect_borders() { detect_borders(stored_polyhedra); };
 
   /// @}
diff --git a/Mesh_3/include/CGAL/Triangle_accessor_3.h b/Mesh_3/include/CGAL/Triangle_accessor_3.h
index 03c091ccdb42..4e336aea354b 100644
--- a/Mesh_3/include/CGAL/Triangle_accessor_3.h
+++ b/Mesh_3/include/CGAL/Triangle_accessor_3.h
@@ -19,7 +19,6 @@
 
 #include <CGAL/license/Mesh_3.h>
 
-
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/Surface_mesh/Surface_mesh_fwd.h>
 #include <CGAL/boost/graph/Graph_with_descriptor_with_graph.h>
@@ -40,26 +39,14 @@ template < class K,class Items,
 class Triangle_accessor_3<Polyhedron_3<K,Items,T_HDS,Alloc>, K >
 {
   typedef Polyhedron_3<K,Items,T_HDS,Alloc> Polyhedron;
+
 public:
-  /// \name Types
-  /// @{
-  /*!
-    Triangle type.
-  */
   typedef typename K::Triangle_3                    Triangle_3;
 
-  /*!
-    Triangle iterator.
-  */
   typedef typename Polyhedron::Facet_const_iterator Triangle_iterator;
 
-  /*!
-    Triangle handle.
-  */
   typedef typename Polyhedron::Facet_const_handle   Triangle_handle;
 
-  /// @}
-
   Triangle_accessor_3() { }
 
   Triangle_iterator triangles_begin(const Polyhedron& p) const
@@ -82,8 +69,7 @@ class Triangle_accessor_3<Polyhedron_3<K,Items,T_HDS,Alloc>, K >
   }
 };
 
-
-  template <class P, class K>
+template <class P, class K>
 class Triangle_accessor_3<Graph_with_descriptor_with_graph<Surface_mesh<P> >, K >
 {
   typedef  Graph_with_descriptor_with_graph<Surface_mesh<P> > Polyhedron;
@@ -124,5 +110,4 @@ class Triangle_accessor_3<Graph_with_descriptor_with_graph<Surface_mesh<P> >, K
 
 } // end namespace CGAL
 
-
 #endif // POLYHEDRON_TRIANGLE_ACCESSOR_H

From b3fe07a51d8673fd7dcac79433510cd1f453956b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 26 May 2023 13:36:15 +0200
Subject: [PATCH 0314/1398] Remove deprecated labeled mesh domains

---
 Mesh_3/benchmark/Mesh_3/StdAfx.h              |   2 +-
 Mesh_3/benchmark/Mesh_3/concurrency.cpp       |  17 +-
 Mesh_3/doc/Mesh_3/Doxyfile.in                 |   3 -
 Mesh_3/doc/Mesh_3/PackageDescription.txt      |   3 -
 .../include/CGAL/Gray_image_mesh_domain_3.h   | 159 ----------------
 Mesh_3/include/CGAL/Implicit_mesh_domain_3.h  | 148 ---------------
 .../CGAL/Labeled_image_mesh_domain_3.h        | 174 ------------------
 .../Mesh_domain_with_polyline_features_3.h    |   2 -
 .../test_meshing_3D_gray_image_deprecated.cpp | 103 -----------
 .../test_meshing_3D_image_deprecated.cpp      |  73 --------
 ...t_meshing_implicit_function_deprecated.cpp | 102 ----------
 11 files changed, 11 insertions(+), 775 deletions(-)
 delete mode 100644 Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
 delete mode 100644 Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
 delete mode 100644 Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
 delete mode 100644 Mesh_3/test/Mesh_3/test_meshing_3D_gray_image_deprecated.cpp
 delete mode 100644 Mesh_3/test/Mesh_3/test_meshing_3D_image_deprecated.cpp
 delete mode 100644 Mesh_3/test/Mesh_3/test_meshing_implicit_function_deprecated.cpp

diff --git a/Mesh_3/benchmark/Mesh_3/StdAfx.h b/Mesh_3/benchmark/Mesh_3/StdAfx.h
index a07ee4b3f167..6cb2d1e0c6c1 100644
--- a/Mesh_3/benchmark/Mesh_3/StdAfx.h
+++ b/Mesh_3/benchmark/Mesh_3/StdAfx.h
@@ -201,7 +201,7 @@
 #include <CGAL/Kernel/interface_macros.h>
 #include <CGAL/Kernel/Type_equality_wrapper.h>
 #include <CGAL/Kernel_traits.h>
-#include <CGAL/Labeled_image_mesh_domain_3.h>
+#include <CGAL/Labeled_mesh_domain_3.h>
 #include <CGAL/Lazy.h>
 #include <CGAL/Lazy_exact_nt.h>
 #include <CGAL/Lazy_kernel.h>
diff --git a/Mesh_3/benchmark/Mesh_3/concurrency.cpp b/Mesh_3/benchmark/Mesh_3/concurrency.cpp
index 006c917b990d..153f235d2b8e 100644
--- a/Mesh_3/benchmark/Mesh_3/concurrency.cpp
+++ b/Mesh_3/benchmark/Mesh_3/concurrency.cpp
@@ -236,11 +236,10 @@ class XML_perf_data
 #include <CGAL/Mesh_complex_3_in_triangulation_3.h>
 #include <CGAL/Mesh_criteria_3.h>
 
+#include <CGAL/Labeled_mesh_domain_3.h>
 #include <CGAL/Polyhedral_mesh_domain_3.h>
 #include <CGAL/Polyhedral_mesh_domain_with_features_3.h>
-#include <CGAL/Implicit_mesh_domain_3.h>
 #include <CGAL/Mesh_domain_with_polyline_features_3.h>
-#include <CGAL/Labeled_image_mesh_domain_3.h>
 
 #include <CGAL/make_mesh_3.h>
 #include <CGAL/refine_mesh_3.h>
@@ -579,7 +578,7 @@ bool make_mesh_3D_images(const std::string &input_filename,
   // Domain
   typedef Kernel K;
 
-  typedef CGAL::Labeled_image_mesh_domain_3<CGAL::Image_3, K> Mesh_domain;
+  typedef CGAL::Labeled_mesh_domain_3<K> Mesh_domain;
 
   // Triangulation
 #ifdef CGAL_CONCURRENT_MESH_3
@@ -600,7 +599,7 @@ bool make_mesh_3D_images(const std::string &input_filename,
   image.read(input_filename.c_str());
 
   // Create domain
-  Mesh_domain domain(image);
+  Mesh_domain domain = Mesh_domain::create_labeled_image_mesh_domain(image);
   std::cerr << "done." << std::endl;
 
   Mesh_parameters params;
@@ -686,10 +685,10 @@ bool make_mesh_implicit(double facet_approx,
 {
   // Domain
 #ifdef CGAL_MESH_3_IMPLICIT_WITH_FEATURES
-  typedef CGAL::Implicit_mesh_domain_3<const ImplicitFunction, Kernel> Implicit_domain;
+  typedef CGAL::Labeled_mesh_domain_3<Kernel> Implicit_domain;
   typedef CGAL::Mesh_domain_with_polyline_features_3<Implicit_domain> Mesh_domain;
 #else
-  typedef CGAL::Implicit_mesh_domain_3<ImplicitFunction, Kernel> Mesh_domain;
+  typedef CGAL::Labeled_mesh_domain_3<Kernel> Mesh_domain;
 #endif
 
   // Triangulation
@@ -708,7 +707,11 @@ bool make_mesh_implicit(double facet_approx,
 
   // Create domain
   Sphere bounding_sphere(CGAL::ORIGIN, 10.0 * 10.0);
-  Mesh_domain domain(func, bounding_sphere/*, 1e-7*/);
+
+  namespace p = CGAL::parameters;
+  Mesh_domain domain = Mesh_domain::create_implicit_mesh_domain(p::function = func,
+                                                                p::bounding_object = bounding_sphere
+                                                                /*, p::relative_error_bound = 1e-7*/);
 
 #ifdef CGAL_MESH_3_IMPLICIT_WITH_FEATURES
   // Add 12 feature creases
diff --git a/Mesh_3/doc/Mesh_3/Doxyfile.in b/Mesh_3/doc/Mesh_3/Doxyfile.in
index 70e7712b5745..18c58c248e66 100644
--- a/Mesh_3/doc/Mesh_3/Doxyfile.in
+++ b/Mesh_3/doc/Mesh_3/Doxyfile.in
@@ -16,9 +16,6 @@ INPUT += \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_mesh_domain_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_mesh_domain_with_features_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Polyhedral_complex_mesh_domain_3.h \
-      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Gray_image_mesh_domain_3.h \
-      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Labeled_image_mesh_domain_3.h \
-      ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Implicit_mesh_domain_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Implicit_to_labeling_function_wrapper.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_domain_with_polyline_features_3.h \
       ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/Mesh_3/generate_label_weights.h \
diff --git a/Mesh_3/doc/Mesh_3/PackageDescription.txt b/Mesh_3/doc/Mesh_3/PackageDescription.txt
index bad6b7e691e1..63141c257e05 100644
--- a/Mesh_3/doc/Mesh_3/PackageDescription.txt
+++ b/Mesh_3/doc/Mesh_3/PackageDescription.txt
@@ -104,9 +104,6 @@ and their associated classes:
 - `CGAL::Mesh_domain_with_polyline_features_3<MD>`
 - `CGAL::Mesh_polyhedron_3<IGT>`
 - `CGAL::Implicit_multi_domain_to_labeling_function_wrapper<ImplicitFunction>`
-- `CGAL::Implicit_mesh_domain_3<Function,BGT>` (deprecated)
-- `CGAL::Labeled_image_mesh_domain_3<Image,BGT>` (deprecated)
-- `CGAL::Gray_image_mesh_domain_3<Image,BGT,Image_word_type>` (deprecated)
 
 The following functors are available for feature detection:
 
diff --git a/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h b/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
deleted file mode 100644
index cb5f6cc262f3..000000000000
--- a/Mesh_3/include/CGAL/Gray_image_mesh_domain_3.h
+++ /dev/null
@@ -1,159 +0,0 @@
-// Copyright (c) 2009 INRIA Sophia-Antipolis (France).
-// Copyright (c) 2012  GeometryFactory Sarl (France).
-// All rights reserved.
-//
-// This file is part of CGAL (www.cgal.org).
-//
-// $URL$
-// $Id$
-// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
-//
-//
-// Author(s)     : Stephane Tayeb, Laurent Rineau
-//
-
-#ifndef CGAL_GRAY_IMAGE_MESH_DOMAIN_3_H
-#define CGAL_GRAY_IMAGE_MESH_DOMAIN_3_H
-
-#include <CGAL/license/Mesh_3.h>
-
-#include <CGAL/disable_warnings.h>
-
-#include <CGAL/Random.h>
-#include <CGAL/Labeled_mesh_domain_3.h>
-#include <CGAL/Mesh_3/Image_to_labeled_function_wrapper.h>
-#include <CGAL/Bbox_3.h>
-
-namespace CGAL {
-
-
-/*!
-\ingroup PkgMesh3Domains
-
-\deprecated The class template `Gray_image_mesh_domain_3` is deprecated
-since CGAL-4.13, in favor of the class template `Labeled_mesh_domain_3` and
-its static function
-`Labeled_mesh_domain_3::create_gray_image_mesh_domain()`.
-
-The class `Gray_image_mesh_domain_3` implements a domain described by a 3D
-gray image. A 3D gray image is a grid of voxels,
-where each voxel is associated with a gray level value.
-This class is a model of the concept `MeshDomain_3`.
-The domain to be discretized is the union of voxels that lie inside a surface
-described by an isolevel value, called \a isovalue. The voxels lying inside the
-domain have gray level values that are larger than the isovalue.
-
-This class includes a member function that provides, by interpolation,
-a gray level value at any query point.
-An intersection between a segment and bounding
-surfaces is detected when both segment endpoints are associated with gray level
-values which are on both sides of the isovalue.
-The intersection is then constructed by bisection.
-The bisection stops when the query segment is shorter than a given error bound
-`e`. This error bound is given by `e=d`\f$ \times\f$`bound` where `d` is the
-length of the diagonal of the bounding box (in world coordinates) and
-`bound` is the argument passed to the constructor of `Labeled_image_mesh_domain_3`.
-
-
-\tparam Image is the type of the input image.
-This parameter must be `CGAL::Image_3`.
-
-\tparam BGT is a geometric traits class which provides
-the basic operations to implement
-intersection tests and intersection computations
-through a bisection method. This parameter must be instantiated
-with a model of the concept `BisectionGeometricTraits_3`.
-
-\tparam Image_word_type is the data type encoded in the `Image`
-input file
-
-\cgalModels `MeshDomain_3`
-
-\sa `BisectionGeometricTraits_3`
-\sa `CGAL::make_mesh_3()`.
-
-*/
-
-template<class Image,
-         class BGT,
-         typename Image_word_type_ = float,
-         typename Transform = Mesh_3::internal::Greater_than<double>,
-         typename Subdomain_index = int>
-class
-CGAL_DEPRECATED_MSG
-( "The class template `CGAL::Gray_image_mesh_domain_3` is now deprecated. "
-  "Use the static member function template "
-  "`Labeled_mesh_domain_3<K>::create_gray_image_mesh_domain` instead.")
-Gray_image_mesh_domain_3
-  : public Labeled_mesh_domain_3<BGT, Subdomain_index>
-{
-public:
-  typedef Image_word_type_ Image_word_type;
-  typedef Mesh_3::Image_to_labeled_function_wrapper<Image_word_type,
-                                                    double,
-                                                    Subdomain_index,
-                                                    false>           Wrapper;
-
-  typedef Labeled_mesh_domain_3<BGT, Subdomain_index>                Base;
-
-  typedef typename Base::Sphere_3 Sphere_3;
-  typedef typename Base::FT FT;
-  typedef BGT Geom_traits;
-  typedef CGAL::Bbox_3 Bbox_3;
-
-  /// \name Creation
-  /// @{
-
-  /*!
-    Construction from an image.
-    The object to be meshed is described by the voxels that have a gray-level
-    value higher than the input isovalue.
-    @param image the input image
-    @param iso_value the isovalue, inside `image`,
-    of the surface describing the boundary of the object to be meshed.
-    @param value_outside the value attached to voxels outside of the domain
-    to be meshed. It should be lower than `iso_value`
-    @param error_bound is relative to the size of the image.
-  */
-  Gray_image_mesh_domain_3(const Image& image
-                           ,const Image_word_type iso_value
-                           ,const Image_word_type value_outside = 0.
-                           ,const FT& error_bound = FT(1e-3)
-#ifndef DOXYGEN_RUNNING
-                           ,CGAL::Random* p_rng = nullptr
-#endif
-                           )
-    : Base(parameters::function = Wrapper(image,
-                   Transform(iso_value),
-                   Transform(iso_value)(value_outside)),
-           parameters::bounding_object = Mesh_3::internal::compute_bounding_box(image),
-           parameters::relative_error_bound = error_bound,
-           parameters::p_rng = p_rng)
-  {
-    CGAL_assertion(Transform(iso_value)(value_outside) == 0);
-  }
-
-  /// @}
-
-  Gray_image_mesh_domain_3(const Image& image,
-                           const Transform& transform,
-                           const Image_word_type value_outside = 0.,
-                           const FT& error_bound = FT(1e-3),
-                           CGAL::Random* p_rng = nullptr)
-    : Base(parameters::function = Wrapper(image, transform, transform(value_outside)),
-           parameters::bounding_object = Mesh_3::internal::compute_bounding_box(image),
-           parameters::relative_error_bound = error_bound,
-           parameters::p_rng = p_rng)
-  {
-    CGAL_assertion(transform(value_outside) == 0);
-  }
-
-  // Destructor
-  virtual ~Gray_image_mesh_domain_3() {}
-};
-
-} // namespace CGAL
-
-#include <CGAL/enable_warnings.h>
-
-#endif // CGAL_GRAY_IMAGE_MESH_DOMAIN_3_H
diff --git a/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h b/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
deleted file mode 100644
index b8c1d72e0bd4..000000000000
--- a/Mesh_3/include/CGAL/Implicit_mesh_domain_3.h
+++ /dev/null
@@ -1,148 +0,0 @@
-// Copyright (c) 2009 INRIA Sophia-Antipolis (France).
-// All rights reserved.
-//
-// This file is part of CGAL (www.cgal.org).
-//
-// $URL$
-// $Id$
-// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
-//
-//
-// Author(s)     : Stéphane Tayeb
-//
-//******************************************************************************
-// File Description :
-// class Implicit_mesh_domain_3. See class description.
-//******************************************************************************
-
-#ifndef CGAL_IMPLICIT_MESH_DOMAIN_3_H
-#define CGAL_IMPLICIT_MESH_DOMAIN_3_H
-
-#include <CGAL/license/Mesh_3.h>
-
-#include <CGAL/disable_warnings.h>
-
-#include <CGAL/Labeled_mesh_domain_3.h>
-#include <CGAL/Implicit_to_labeling_function_wrapper.h>
-#include <CGAL/Mesh_3/Null_subdomain_index.h>
-#include <CGAL/Random.h>
-
-namespace CGAL {
-
-
-/*!
-\ingroup PkgMesh3Domains
-
-\deprecated The class template `Implicit_mesh_domain_3` is deprecated
-since CGAL-4.13, in favor of the class template `Labeled_mesh_domain_3` and
-its static function
-`Labeled_mesh_domain_3::create_implicit_mesh_domain()`.
-
-The class `Implicit_mesh_domain_3` implements a domain whose bounding surface is
-described
-implicitly as the zero level set of a function.
-The domain to be discretized is assumed to be the domain where
-the function has negative values.
-This class is a model of the concept `MeshDomain_3`.
-
-
-\tparam Function_ provides the definition of the function.
-This parameter stands for a model of the concept
-`ImplicitFunction` described in the
-surface mesh generation package.
-The number types `Function::FT`
-and `BGT::FT` are required to match.
-
-\tparam BGT is a geometric traits which provides the basic operations to implement
-intersection tests and computations
-through a bisection method. This parameter must be instantiated
-with a model of the concept `BisectionGeometricTraits_3`.
-
-The constructor of `Implicit_mesh_domain_3`
-takes as argument a bounding sphere which is required
-to circumscribe the surface and to have its center inside the
-domain.
-This domain constructs intersection points between
-the surface and segments/rays/lines by bisection. It needs an
-`error_bound` such that the bisection process is stopped
-when the query segment is smaller than the error bound.
-The `error_bound` passed as argument to the domain constructor
-is a relative error bound expressed as a ratio to the bounding sphere radius.
-
-\cgalModels `MeshDomain_3`
-
-\sa `BisectionGeometricTraits_3`
-\sa `CGAL::make_mesh_3()`.
-
-*/
-template<class Function_
-         ,class BGT
-#ifndef DOXYGEN_RUNNING
-         ,class Wrapper = Implicit_to_labeling_function_wrapper<Function_,BGT>
-#endif
-         >
-class
-CGAL_DEPRECATED_MSG
-( "The class template `CGAL::Implicit_mesh_domain_3` is now deprecated. "
-  "Use the static member function template "
-  "`Labeled_mesh_domain_3<K>::create_implicit_image_mesh_domain` instead.")
-Implicit_mesh_domain_3
- : public Labeled_mesh_domain_3<BGT>
-{
-public:
-  /// Base type
-  typedef Labeled_mesh_domain_3<BGT> Base;
-
-  /// Public types
-  typedef typename Base::Sphere_3 Sphere_3;
-  typedef typename Base::FT FT;
-  typedef BGT Geom_traits;
-
-  /// \name Creation
-  /// @{
-
-  /*!
-    @param f is the object of type `Function_` that represents the implicit
-    surface.
-
-    @param bounding_sphere is a bounding sphere of the implicit surface. The
-    value of `f` at the sphere center `c` must be
-    negative: \f$ f(c)<0\f$.
-
-    @param error_bound is the relative error bound
-    used to compute intersection points between the implicit surface
-    and query segments. The
-    bisection is stopped when the length of the intersected
-    segment is less than the product of `error_bound` by the
-    radius of `bounding_sphere`.
-  */
-  Implicit_mesh_domain_3(Function_ f
-                         ,const Sphere_3& bounding_sphere
-                         ,const FT& error_bound = FT(1e-6)
-#ifndef DOXYGEN_RUNNING
-                         ,CGAL::Random* p_rng = nullptr
-#endif
-                         )
-    : Base(parameters::function = Wrapper(f), parameters::bounding_object = bounding_sphere, parameters::relative_error_bound = error_bound,
-           parameters::null_subdomain_index = Null_subdomain_index(), parameters::p_rng = p_rng)  {}
-
-  /// @}
-
-  // Destructor
-  virtual ~Implicit_mesh_domain_3() {}
-
-  using Base::bbox;
-private:
-  // Disabled copy constructor & assignment operator
-  typedef Implicit_mesh_domain_3<Function_,BGT> Self;
-  Implicit_mesh_domain_3(const Self& src);
-  Self& operator=(const Self& src);
-
-};  // end class Implicit_mesh_domain_3
-
-
-}  // end namespace CGAL
-
-#include <CGAL/enable_warnings.h>
-
-#endif // CGAL_IMPLICIT_MESH_DOMAIN_3_H
diff --git a/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
deleted file mode 100644
index 952d4fc2187c..000000000000
--- a/Mesh_3/include/CGAL/Labeled_image_mesh_domain_3.h
+++ /dev/null
@@ -1,174 +0,0 @@
-// Copyright (c) 2009 INRIA Sophia-Antipolis (France).
-// All rights reserved.
-//
-// This file is part of CGAL (www.cgal.org).
-//
-// $URL$
-// $Id$
-// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
-//
-//
-// Author(s)     : Stephane Tayeb
-//
-//******************************************************************************
-// File Description :
-//
-//
-//******************************************************************************
-
-#ifndef CGAL_LABELED_IMAGE_MESH_DOMAIN_3_H
-#define CGAL_LABELED_IMAGE_MESH_DOMAIN_3_H
-
-#include <CGAL/license/Mesh_3.h>
-
-#include <CGAL/disable_warnings.h>
-
-#include <CGAL/Random.h>
-#include <CGAL/Labeled_mesh_domain_3.h>
-#include <CGAL/Mesh_3/Image_to_labeled_function_wrapper.h>
-#include <CGAL/Mesh_3/Null_subdomain_index.h>
-#include <CGAL/Bbox_3.h>
-#include <CGAL/Default.h>
-
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-\deprecated The class template `Labeled_image_mesh_domain_3` is deprecated
-since CGAL-4.13, in favor of the class template `Labeled_mesh_domain_3` and
-its static function
-`Labeled_mesh_domain_3::create_labeled_image_mesh_domain()`.
-
-The class `Labeled_image_mesh_domain_3` implements a domain described by a 3D labeled image. A 3D
-labeled image is a grid of voxels, where each voxel is associated with an index
-(a subdomain index) characterizing the subdomain in which the voxel lies. This
-class is a model of the concept `MeshDomain_3`. The domain to be discretized
-is the union of voxels that have an non-default index (different from the
-default constructed value of the type `Image::Type`).
-
-This class includes a member function that provides, by interpolation, the index
-of the subdomain in which any query point lies. An intersection between a segment and bounding
-surfaces is detected when both segment endpoints are associated with different
-values of subdomain indices. The intersection is then constructed by bisection.
-The bisection stops when the query segment is shorter than a given error bound
-`e`. This error bound is given by `e=d`\f$ \times\f$`bound` where `d` is the
-length of the diagonal of the bounding box (in world coordinates) and
-`bound` is the argument passed to the constructor of `Labeled_image_mesh_domain_3`.
-
-
-\tparam Image is the type of the input image.
-This parameter must be `CGAL::Image_3`.
-
-\tparam BGT is a geometric traits class which provides
-the basic operations to implement
-intersection tests and intersection computations
-through a bisection method. This parameter must be instantiated
-with a model of the concept `BisectionGeometricTraits_3`.
-
-\cgalModels `MeshDomain_3`
-
-An executable that uses `Labeled_image_mesh_domain_3` must be linked with
-the <I>CGAL_ImageIO</I> library.
-
-\sa `BisectionGeometricTraits_3`
-\sa `CGAL::make_mesh_3()`.
-
-*/
-
-template<class Image
-         ,class BGT
-#ifndef DOXYGEN_RUNNING
-         ,typename Image_word_type_ = unsigned char
-         ,typename Subdomain_index = int
-         ,class Null_subdomain_index = Default
-         ,class Wrapper_ = Default
-#endif
-         >
-class
-CGAL_DEPRECATED_MSG
-( "The class template `CGAL::Labeled_image_mesh_domain_3` is now deprecated. "
-  "Use the static member function template "
-  "`Labeled_mesh_domain_3<K>::create_labeled_image_mesh_domain` instead.")
-Labeled_image_mesh_domain_3
-  : public Labeled_mesh_domain_3<BGT, Subdomain_index>
-{
-public:
-  typedef Image_word_type_ Image_word_type;
-  typedef typename Default::Get
-    <Wrapper_,
-     Mesh_3::Image_to_labeled_function_wrapper<Image_word_type,
-                                               int,
-                                               Subdomain_index>
-     >::type Wrapper;
-  typedef typename Default::Get<Null_subdomain_index,
-                                CGAL::Null_subdomain_index>::type Null;
-
-  typedef Labeled_mesh_domain_3<BGT, Subdomain_index> Base;
-
-  typedef typename Base::Sphere_3 Sphere_3;
-  typedef typename Base::FT FT;
-  typedef BGT Geom_traits;
-  typedef CGAL::Bbox_3 Bbox_3;
-  typedef CGAL::Identity<Subdomain_index> Identity;
-
-
-  /// \name Creation
-  /// @{
-
-  /*!
-    Construction from an image.
-    @param image the image
-    @param error_bound is relative to the size of the image.
-  */
-  Labeled_image_mesh_domain_3(const Image& image
-                              ,const FT& error_bound = FT(1e-3)
-#ifndef DOXYGEN_RUNNING
-                              ,Subdomain_index value_outside = 0
-                              ,Null null = Null()
-                              ,CGAL::Random* p_rng = nullptr
-#endif
-                              )
-    : Base(parameters::function = Wrapper(image, Identity(), value_outside),
-           parameters::bounding_object = compute_bounding_box(image),
-           parameters::relative_error_bound = error_bound,
-           parameters::null_subdomain_index = null,
-           parameters::p_rng = p_rng)
-  {}
-
-  /// @}
-
-  Labeled_image_mesh_domain_3(const Image& image,
-                              const FT error_bound,
-                              CGAL::Random* p_rng)
-    : Base(parameters::function = Wrapper(image),
-           parameters::bounding_object = compute_bounding_box(image),
-           parameters::relative_error_bound = error_bound,
-           parameters::p_rng = p_rng)
-  {}
-
-  // Destructor
-  virtual ~Labeled_image_mesh_domain_3() {}
-
-  using Base::bbox;
-
-private:
-  // Returns a box enclosing image `im`
-  Bbox_3 compute_bounding_box(const Image& im) const
-  {
-    return Bbox_3(-im.vx()+im.tx(),
-                  -im.vy()+im.ty(),
-                  -im.vz()+im.tz(),
-                  double(im.xdim()+1)*im.vx()+im.tx(),
-                  double(im.ydim()+1)*im.vy()+im.ty(),
-                  double(im.zdim()+1)*im.vz()+im.tz());
-  }
-};  // end class Labeled_image_mesh_domain_3
-
-
-
-}  // end namespace CGAL
-
-#include <CGAL/enable_warnings.h>
-
-#endif // CGAL_LABELED_IMAGE_MESH_DOMAIN_3_H
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index a8cfa8a26108..4934f22a7e90 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -528,9 +528,7 @@ whose endpoints are the added corners.
 \cgalModels `MeshDomainWithFeatures_3`
 
 \sa `MeshPolyline_3`
-\sa `CGAL::Implicit_mesh_domain_3<Function,BGT>`
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT>`
-\sa `CGAL::Labeled_image_mesh_domain_3<Image,BGT>`
 */
 template < typename MD >
 class Mesh_domain_with_polyline_features_3
diff --git a/Mesh_3/test/Mesh_3/test_meshing_3D_gray_image_deprecated.cpp b/Mesh_3/test/Mesh_3/test_meshing_3D_gray_image_deprecated.cpp
deleted file mode 100644
index b2ba365111f8..000000000000
--- a/Mesh_3/test/Mesh_3/test_meshing_3D_gray_image_deprecated.cpp
+++ /dev/null
@@ -1,103 +0,0 @@
-#include <CGAL/Installation/internal/disable_deprecation_warnings_and_errors.h>
-
-#include "test_meshing_utilities.h"
-
-#include <CGAL/Image_3.h>
-#include <CGAL/Gray_image_mesh_domain_3.h>
-#include <CGAL/use.h>
-
-#include <functional>
-
-// To avoid verbose function and named parameters call
-using namespace CGAL::parameters;
-
-template<typename T>
-struct Greater_than {
-  typedef T argument_type;
-  Greater_than(const T& second) : second(second) {}
-  bool operator()(const T& first) const {
-    return std::greater<T>()(first, second);
-  }
-  T second;
-};
-
-template <typename Concurrency_tag = CGAL::Sequential_tag>
-struct Image_tester : public Tester<K_e_i>
-{
-public:
-  void image() const
-  {
-    typedef float                                       Image_word_type;
-    typedef CGAL::Image_3                               Image;
-    typedef CGAL::Gray_image_mesh_domain_3<
-      Image,
-      K_e_i,
-      Image_word_type,
-      Greater_than<double> >                            Mesh_domain;
-
-    typedef typename CGAL::Mesh_triangulation_3<
-      Mesh_domain,
-      CGAL::Kernel_traits<Mesh_domain>::Kernel,
-      Concurrency_tag>::type                            Tr;
-    typedef CGAL::Mesh_complex_3_in_triangulation_3<Tr> C3t3;
-    typedef CGAL::Mesh_criteria_3<Tr>                   Mesh_criteria;
-
-    CGAL_USE_TYPE(typename Mesh_domain::Surface_patch_index);
-
-    //-------------------------------------------------------
-    // Data generation
-    //-------------------------------------------------------
-    Image image;
-    if (!image.read(CGAL::data_file_path("images/skull_2.9.inr")))
-    {
-      std::cout << "Image reading error. Exit test.\n";
-      return;
-    }
-
-    std::cout << "\tSeed is\t"
-              << CGAL::get_default_random().get_seed() << std::endl;
-
-    // Domain
-    Mesh_domain domain(image,
-      2.9f, //isovalue
-      0.f,  //value_outside
-      1e-3, //error_bound
-      &CGAL::get_default_random());//random generator for determinism
-
-    // Mesh criteria
-    Mesh_criteria criteria(facet_angle = 30,
-                           facet_size = 6,
-                           facet_distance = 2,
-                           facet_topology = CGAL::MANIFOLD,
-                           cell_radius_edge_ratio = 3,
-                           cell_size = 8);
-
-    // Mesh generation
-    C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
-                                        no_perturb(),
-                                        no_exude(),
-      mesh_3_options(number_of_initial_points = 30),
-      non_manifold()
-      );
-
-    // Verify
-    this->verify_c3t3_volume(c3t3, 1236086 * 0.95, 1236086 * 1.05);
-    this->verify(c3t3, domain, criteria, Bissection_tag());
-  }
-};
-
-
-int main()
-{
-  Image_tester<> test_epic;
-  std::cerr << "Mesh generation from a 3D image:\n";
-  test_epic.image();
-
-#ifdef CGAL_LINKED_WITH_TBB
-  Image_tester<CGAL::Parallel_tag> test_epic_p;
-  std::cerr << "Parallel mesh generation from a 3D image:\n";
-  test_epic_p.image();
-#endif
-
-  return EXIT_SUCCESS;
-}
diff --git a/Mesh_3/test/Mesh_3/test_meshing_3D_image_deprecated.cpp b/Mesh_3/test/Mesh_3/test_meshing_3D_image_deprecated.cpp
deleted file mode 100644
index 8107c4cefb59..000000000000
--- a/Mesh_3/test/Mesh_3/test_meshing_3D_image_deprecated.cpp
+++ /dev/null
@@ -1,73 +0,0 @@
-#define CGAL_MESH_3_VERBOSE 1
-#include <CGAL/Installation/internal/disable_deprecation_warnings_and_errors.h>
-
-#include "test_meshing_utilities.h"
-
-#include <CGAL/Image_3.h>
-#include <CGAL/Labeled_image_mesh_domain_3.h>
-#include <CGAL/use.h>
-
-template <typename Concurrency_tag = CGAL::Sequential_tag>
-struct Image_tester : public Tester<K_e_i>
-{
-public:
-  void image() const
-  {
-    typedef CGAL::Image_3 Image;
-    typedef CGAL::Labeled_image_mesh_domain_3<Image, K_e_i> Mesh_domain;
-
-    typedef typename CGAL::Mesh_triangulation_3<
-      Mesh_domain,
-      CGAL::Kernel_traits<Mesh_domain>::Kernel,
-      Concurrency_tag>::type Tr;
-    typedef CGAL::Mesh_complex_3_in_triangulation_3<Tr> C3t3;
-
-    typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
-    typedef typename Mesh_criteria::Facet_criteria Facet_criteria;
-    typedef typename Mesh_criteria::Cell_criteria Cell_criteria;
-
-    //-------------------------------------------------------
-    // Data generation
-    //-------------------------------------------------------
-    Image image;
-    image.read(CGAL::data_file_path("images/liver.inr.gz"));
-
-    std::cout << "\tSeed is\t"
-      << CGAL::get_default_random().get_seed() << std::endl;
-    Mesh_domain domain(image, 1e-6, &CGAL::get_default_random());
-
-    // Set mesh criteria
-    Facet_criteria facet_criteria(25, 20*image.vx(), 5*image.vx());
-    Cell_criteria cell_criteria(4, 25*image.vx());
-    Mesh_criteria criteria(facet_criteria, cell_criteria);
-
-    // Mesh generation
-    C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
-                                        CGAL::parameters::no_exude(),
-                                        CGAL::parameters::no_perturb());
-
-    // Verify
-    this->verify_c3t3_volume(c3t3, 1772330*0.95, 1772330*1.05);
-    this->verify(c3t3,domain,criteria, Bissection_tag());
-
-    typedef typename Mesh_domain::Surface_patch_index Patch_id;
-    CGAL_static_assertion(CGAL::Output_rep<Patch_id>::is_specialized);
-    CGAL_USE_TYPE(Patch_id);
-  }
-
-};
-
-int main()
-{
-  Image_tester<> test_epic;
-  std::cerr << "Mesh generation from a 3D image:\n";
-  test_epic.image();
-
-#ifdef CGAL_LINKED_WITH_TBB
-  Image_tester<CGAL::Parallel_tag> test_epic_p;
-  std::cerr << "Parallel mesh generation from a 3D image:\n";
-  test_epic_p.image();
-#endif
-
-  return EXIT_SUCCESS;
-}
diff --git a/Mesh_3/test/Mesh_3/test_meshing_implicit_function_deprecated.cpp b/Mesh_3/test/Mesh_3/test_meshing_implicit_function_deprecated.cpp
deleted file mode 100644
index 6a7a8aa0b57e..000000000000
--- a/Mesh_3/test/Mesh_3/test_meshing_implicit_function_deprecated.cpp
+++ /dev/null
@@ -1,102 +0,0 @@
-#include <CGAL/Installation/internal/disable_deprecation_warnings_and_errors.h>
-#include <CGAL/disable_warnings.h>
-
-#include "test_meshing_utilities.h"
-
-#include <CGAL/Implicit_mesh_domain_3.h>
-
-template <typename K, typename Concurrency_tag = CGAL::Sequential_tag>
-struct Implicit_tester : public Tester<K>
-{
-  typedef typename K::Point_3 Point;
-  typedef typename K::FT FT;
-  static FT sphere_function (const Point& p)
-  {
-    const FT x2=p.x()*p.x(), y2=p.y()*p.y(), z2=p.z()*p.z();
-    return x2+y2+z2-1;
-  }
-
-  void implicit() const
-  {
-    typedef FT (Function)(const Point&);
-    typedef CGAL::Implicit_mesh_domain_3<Function, K> Mesh_domain;
-
-    typedef typename CGAL::Mesh_triangulation_3<
-      Mesh_domain,
-      typename CGAL::Kernel_traits<Mesh_domain>::Kernel,
-      Concurrency_tag>::type Tr;
-    typedef CGAL::Mesh_complex_3_in_triangulation_3<Tr> C3t3;
-
-    typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
-    typedef typename Mesh_criteria::Facet_criteria Facet_criteria;
-    typedef typename Mesh_criteria::Cell_criteria Cell_criteria;
-
-    typedef typename K::Sphere_3 Sphere_3;
-
-    typedef typename Mesh_domain::Surface_patch_index Surface_patch_index;
-
-    //-------------------------------------------------------
-    // Data generation
-    //-------------------------------------------------------
-    std::cout << "\tSeed is\t"
-      << CGAL::get_default_random().get_seed() << std::endl;
-
-    Mesh_domain domain(Implicit_tester<K>::sphere_function,
-                       Sphere_3(CGAL::ORIGIN,2.),
-                       1e-3,
-                       &CGAL::get_default_random());
-
-    // Set mesh criteria
-    Facet_criteria facet_criteria(0, 0, 0.3);
-    Cell_criteria cell_criteria(0, 0.5);
-    Mesh_criteria criteria(facet_criteria, cell_criteria);
-
-    std::vector<Point> initial_points;
-    initial_points.push_back(Point(1,0,0));
-    initial_points.push_back(Point(0,1,0));
-    initial_points.push_back(Point(0,0,1));
-    initial_points.push_back(Point(-1,0,0));
-    initial_points.push_back(Point(0,-1,0));
-    initial_points.push_back(Point(0,0,-1));
-
-    // Mesh generation
-    C3t3 c3t3;
-    c3t3.insert_surface_points(initial_points.begin(),
-                               initial_points.end(),
-                               domain.index_from_surface_patch_index(Surface_patch_index(0,1)));
-
-    CGAL::refine_mesh_3(c3t3, domain, criteria,
-                        CGAL::parameters::no_exude(),
-                        CGAL::parameters::no_perturb());
-
-    CGAL::remove_far_points_in_mesh_3(c3t3);
-
-#ifdef CGAL_LINKED_WITH_TBB
-    // Parallel
-    if (boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value)
-    {
-      this->verify(c3t3, domain, criteria, Bissection_tag(), 40, 65, 60, 110);
-    }
-    else
-#endif //CGAL_LINKED_WITH_TBB
-    {
-      // Verify
-      this->verify(c3t3, domain, criteria, Bissection_tag(), 50, 58, 80, 90);
-    }
-  }
-};
-
-
-int main()
-{
-  Implicit_tester<K_e_i> test_epic;
-  std::cerr << "Mesh generation from an implicit function:\n";
-  test_epic.implicit();
-
-#ifdef CGAL_LINKED_WITH_TBB
-  Implicit_tester<K_e_i, CGAL::Parallel_tag> test_epic_p;
-  std::cerr << "Parallel mesh generation from an implicit function:\n";
-  test_epic_p.implicit();
-#endif
-  return EXIT_SUCCESS;
-}

From 7b91a3d972551759756d06e01c5d049109e12ba1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 26 May 2023 13:47:20 +0200
Subject: [PATCH 0315/1398] Fix compilation

---
 Mesh_3/test/Mesh_3/XML_exporter.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/test/Mesh_3/XML_exporter.h b/Mesh_3/test/Mesh_3/XML_exporter.h
index 8ecb25600b67..5be7055d3204 100644
--- a/Mesh_3/test/Mesh_3/XML_exporter.h
+++ b/Mesh_3/test/Mesh_3/XML_exporter.h
@@ -185,7 +185,7 @@ class Streaming_XML_exporter
       m_xml_fstream << "  </" << m_element_name << ">" << std::endl;
 
       // Save current pointer position
-      std::ofstream::streampos pos = m_xml_fstream.tellp();
+      std::streampos pos = m_xml_fstream.tellp();
       // Close the XML file (temporarily) so that the XML file is always correct
       m_xml_fstream << "</" << m_list_name << ">" << std::endl;
       // Restore the pointer position so that the next "add_element" will overwrite

From 278e1867aa322600cd236413ba305f96b013258e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 26 May 2023 17:12:28 +0100
Subject: [PATCH 0316/1398] parallize #1

---
 .../soup_autorefinement.cpp                   |  7 +-
 .../Polygon_mesh_processing/autorefinement.h  | 89 +++++++++++++------
 2 files changed, 65 insertions(+), 31 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index d955734853bf..f12306689485 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -6,6 +6,7 @@
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
 #include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
 #include <CGAL/IO/polygon_soup_io.h>
+#include <CGAL/Real_timer.h>
 
 #include <boost/container/small_vector.hpp>
 
@@ -29,11 +30,13 @@ int main(int argc, char** argv)
   PMP::repair_polygon_soup(input_points, input_triangles);
   PMP::triangulate_polygons(input_points, input_triangles);
 
+  CGAL::Real_timer t;
+  t.start();
   std::vector<Point> output_points;
   std::vector<std::array<std::size_t, 3>> output_triangles;
   PMP::autorefine_soup_output(input_points, input_triangles, output_points, output_triangles);
-
-  CGAL::IO::write_polygon_soup("autorefined.off", output_points, output_triangles, CGAL::parameters::stream_precision(17));
+  std::cout << "#points = " << output_points.size() << " and #triangles = " << output_triangles.size() << " in " << t.time() << " sec." << std::endl;
+  // CGAL::IO::write_polygon_soup("autorefined.off", output_points, output_triangles, CGAL::parameters::stream_precision(17));
 
   return 0;
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index a46f2664803f..e862d6839609 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -39,6 +39,11 @@
 #define CGAL_PMP_AUTOREFINE_VERBOSE(MSG)
 #endif
 
+#ifdef CGAL_LINKED_WITH_TBB
+#include <tbb/concurrent_vector.h>
+#include <tbb/parallel_for.h>
+#endif
+
 #include <vector>
 
 #define TEST_RESOLVE_INTERSECTION
@@ -656,7 +661,12 @@ void generate_subtriangles(std::size_t ti,
                            const std::vector<std::size_t>& in_triangle_ids,
                            const std::set<std::pair<std::size_t, std::size_t> >& intersecting_triangles,
                            const std::vector<std::array<typename EK::Point_3,3>>& triangles,
-                           std::vector<std::array<typename EK::Point_3,3>>& new_triangles)
+#ifdef CGAL_LINKED_WITH_TBB
+                           tbb::concurrent_vector<std::array<typename EK::Point_3,3>>& new_triangles
+#else
+                           std::vector<std::array<typename EK::Point_3,3>>& new_triangles
+#endif
+                           )
 {
   // std::cout << "generate_subtriangles()\n";
   // std::cout << std::setprecision(17);
@@ -1266,46 +1276,67 @@ void autorefine_soup_output(const PointRange& input_points,
 
   CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
   // now refine triangles
-  std::vector<std::array<EK::Point_3,3>> new_triangles; // Need to be threadsafe
+#ifdef CGAL_LINKED_WITH_TBB
+    tbb::concurrent_vector<std::array<EK::Point_3, 3>> new_triangles;
+#else
+  std::vector<std::array<EK::Point_3,3>> new_triangles;
+#endif
 
 #ifdef USE_PROGRESS_DISPLAY
   boost::timer::progress_display pd(triangles.size());
 #endif
 
-  //TODO: PARALLEL_FOR #1
-  for(std::size_t ti=0; ti<triangles.size(); ++ti)
-  {
-    if (all_segments[ti].empty() && all_points[ti].empty())
-      new_triangles.push_back(triangles[ti]);
-    else
+
+  auto func = [&](std::size_t ti)
     {
-      #ifdef USE_FIXED_PROJECTION_TRAITS
-      const std::array<typename EK::Point_3, 3>& t = triangles[ti];
-      auto is_constant_in_dim = [](const std::array<typename EK::Point_3, 3>& t, int dim)
-      {
-        return t[0][dim]==t[1][dim] && t[0][dim]!=t[2][dim];
-      };
+      if (all_segments[ti].empty() && all_points[ti].empty())
+        new_triangles.push_back(triangles[ti]);
+      else
+        {
+#ifdef USE_FIXED_PROJECTION_TRAITS
+          const std::array<typename EK::Point_3, 3>& t = triangles[ti];
+          auto is_constant_in_dim = [](const std::array<typename EK::Point_3, 3>& t, int dim)
+          {
+            return t[0][dim] == t[1][dim] && t[0][dim] != t[2][dim];
+          };
 
-      typename EK::Vector_3 orth = CGAL::normal(t[0], t[1], t[2]); // TODO::avoid construction?
-      int c = CGAL::abs(orth[0]) > CGAL::abs(orth[1]) ? 0 : 1;
-      c = CGAL::abs(orth[2]) > CGAL::abs(orth[c]) ? 2 : c;
+          typename EK::Vector_3 orth = CGAL::normal(t[0], t[1], t[2]); // TODO::avoid construction?
+          int c = CGAL::abs(orth[0]) > CGAL::abs(orth[1]) ? 0 : 1;
+          c = CGAL::abs(orth[2]) > CGAL::abs(orth[c]) ? 2 : c;
 
-      if(c == 0) {
-        autorefine_impl::generate_subtriangles<EK, 0>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
-      } else if(c == 1) {
-        autorefine_impl::generate_subtriangles<EK, 1>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
-      } else if(c == 2) {
-        autorefine_impl::generate_subtriangles<EK, 2>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
-      }
-      #else
-      autorefine_impl::generate_subtriangles<EK>(ti, all_segments_ids[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
-      #endif
-    }
+          if (c == 0) {
+            autorefine_impl::generate_subtriangles<EK, 0>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+          }
+          else if (c == 1) {
+            autorefine_impl::generate_subtriangles<EK, 1>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+          }
+          else if (c == 2) {
+            autorefine_impl::generate_subtriangles<EK, 2>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+          }
+#else
+          autorefine_impl::generate_subtriangles<EK>(ti, all_segments_ids[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+#endif
+        }
 
 #ifdef USE_PROGRESS_DISPLAY
-    ++pd;
+      ++pd;
 #endif
+    };
+
+#ifdef CGAL_LINKED_WITH_TBB
+  tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
+                    [&](const tbb::blocked_range<size_t>& r) {
+                      for (size_t ti = r.begin(); ti != r.end(); ++ti)
+                        func(ti);
+                    }
+                    );
+#else
+  for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
+    func(ti);
   }
+#endif
+
+
 
   // brute force output: create a soup, orient and to-mesh
   CGAL_PMP_AUTOREFINE_VERBOSE("create output soup");

From 1c1ed53c76457c841dab781f76f3eacfb299071c Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 30 May 2023 08:03:29 +0100
Subject: [PATCH 0317/1398] Parallelize deduplicate_segments()

---
 .../Polygon_mesh_processing/autorefinement.h  | 28 +++++++++++++++++--
 1 file changed, 26 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index e862d6839609..ad88f3a6aceb 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1178,7 +1178,8 @@ void autorefine_soup_output(const PointRange& input_points,
   std::vector< std::vector<std::size_t> > all_in_triangle_ids(triangles.size());
 
   CGAL_PMP_AUTOREFINE_VERBOSE("compute intersections");
-
+  Real_timer t;
+  t.start();
   std::set<std::pair<std::size_t, std::size_t> > intersecting_triangles;
   //TODO: PARALLEL_FOR #2
   for (const Pair_of_triangle_ids& p : si_pairs)
@@ -1225,16 +1226,22 @@ void autorefine_soup_output(const PointRange& input_points,
       intersecting_triangles.insert(CGAL::make_sorted_pair(i1, i2));
     }
   }
+  std::cout << t.time() << " sec. for #2" << std::endl;
 
 #ifdef DEDUPLICATE_SEGMENTS
   // deduplicate inserted segments
   //TODO: PARALLEL_FOR #3
+  Real_timer t3;
+  t3.start();
   std::vector<std::vector<std::pair<std::size_t, std::size_t>>> all_segments_ids(all_segments.size());
-  for(std::size_t ti=0; ti<triangles.size(); ++ti)
+
+  auto deduplicate_inserted_segments = [&](std::size_t ti)
   {
     if (!all_segments[ti].empty())
     {
       std::map<EK::Point_3, std::size_t> point_id_map;
+
+
       auto get_point_id = [&](const typename EK::Point_3& pt)
       {
         auto insert_res = point_id_map.insert(std::make_pair(pt, all_points[ti].size()));
@@ -1243,6 +1250,7 @@ void autorefine_soup_output(const PointRange& input_points,
         return insert_res.first->second;
       };
 
+
       if (!all_points[ti].empty())
       {
         std::vector<typename EK::Point_3> tmp;
@@ -1271,9 +1279,25 @@ void autorefine_soup_output(const PointRange& input_points,
       if (all_segments_ids[ti].size()!=nbs)
         filtered_in_triangle_ids.swap(all_in_triangle_ids[ti]);
     }
+  };
+
+#ifdef CGAL_LINKED_WITH_TBB
+  tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
+                    [&](const tbb::blocked_range<size_t>& r) {
+                      for (size_t ti = r.begin(); ti != r.end(); ++ti)
+                        deduplicate_inserted_segments(ti);
+                    }
+                    );
+#else
+  for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
+    deduplicate_inserted_segments(ti);
   }
 #endif
 
+
+  std::cout << t.time() << " sec. for #3" << std::endl;
+#endif
+
   CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
   // now refine triangles
 #ifdef CGAL_LINKED_WITH_TBB

From 2695834873b41052bb2b8669d74e93de41fb89ea Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 30 May 2023 08:10:06 +0100
Subject: [PATCH 0318/1398] Rename lambdas

---
 .../Polygon_mesh_processing/soup_autorefinement.cpp    |  2 +-
 .../CGAL/Polygon_mesh_processing/autorefinement.h      | 10 +++++-----
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index f12306689485..d5ebeb78c3f5 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -36,7 +36,7 @@ int main(int argc, char** argv)
   std::vector<std::array<std::size_t, 3>> output_triangles;
   PMP::autorefine_soup_output(input_points, input_triangles, output_points, output_triangles);
   std::cout << "#points = " << output_points.size() << " and #triangles = " << output_triangles.size() << " in " << t.time() << " sec." << std::endl;
-  // CGAL::IO::write_polygon_soup("autorefined.off", output_points, output_triangles, CGAL::parameters::stream_precision(17));
+  CGAL::IO::write_polygon_soup("autorefined.off", output_points, output_triangles, CGAL::parameters::stream_precision(17));
 
   return 0;
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index ad88f3a6aceb..40a3ed87cbc7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1226,7 +1226,7 @@ void autorefine_soup_output(const PointRange& input_points,
       intersecting_triangles.insert(CGAL::make_sorted_pair(i1, i2));
     }
   }
-  std::cout << t.time() << " sec. for #2" << std::endl;
+  std::cout << t.time() << " sec. for compute_intersections()" << std::endl;
 
 #ifdef DEDUPLICATE_SEGMENTS
   // deduplicate inserted segments
@@ -1295,7 +1295,7 @@ void autorefine_soup_output(const PointRange& input_points,
 #endif
 
 
-  std::cout << t.time() << " sec. for #3" << std::endl;
+  std::cout << t.time() << " sec. for deduplicate_segments()" << std::endl;
 #endif
 
   CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
@@ -1311,7 +1311,7 @@ void autorefine_soup_output(const PointRange& input_points,
 #endif
 
 
-  auto func = [&](std::size_t ti)
+  auto refine_triangles = [&](std::size_t ti)
     {
       if (all_segments[ti].empty() && all_points[ti].empty())
         new_triangles.push_back(triangles[ti]);
@@ -1351,12 +1351,12 @@ void autorefine_soup_output(const PointRange& input_points,
   tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
                     [&](const tbb::blocked_range<size_t>& r) {
                       for (size_t ti = r.begin(); ti != r.end(); ++ti)
-                        func(ti);
+                        refine_triangles(ti);
                     }
                     );
 #else
   for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
-    func(ti);
+    refine_triangles(ti);
   }
 #endif
 

From e34a79864a78c7a19402af066698881d54a22d28 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 30 May 2023 10:13:28 +0200
Subject: [PATCH 0319/1398] debug macro

---
 .../Polygon_mesh_processing/autorefinement.h  | 38 ++++++++++++++++---
 1 file changed, 33 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 40a3ed87cbc7..eb24d60804a7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -48,15 +48,20 @@
 
 #define TEST_RESOLVE_INTERSECTION
 #define DEDUPLICATE_SEGMENTS
+#define USE_DEBUG_PARALLEL_TIMERS
 //#define DEBUG_COUNTERS
 //#define USE_FIXED_PROJECTION_TRAITS
 //#define DEBUG_DEPTH
 
+#ifdef USE_DEBUG_PARALLEL_TIMERS
+#include <CGAL/Real_timer.h>
+#endif
+
 #ifdef USE_FIXED_PROJECTION_TRAITS
 #include <CGAL/Kernel_23/internal/Projection_traits_3.h>
 #endif
 
-#ifdef DEBUG_COUNTERS
+#if defined(DEBUG_COUNTERS) || defined(USE_DEBUG_PARALLEL_TIMERS)
 #include <CGAL/Real_timer.h>
 #endif
 
@@ -1178,8 +1183,10 @@ void autorefine_soup_output(const PointRange& input_points,
   std::vector< std::vector<std::size_t> > all_in_triangle_ids(triangles.size());
 
   CGAL_PMP_AUTOREFINE_VERBOSE("compute intersections");
+#ifdef USE_DEBUG_PARALLEL_TIMERS
   Real_timer t;
   t.start();
+#endif
   std::set<std::pair<std::size_t, std::size_t> > intersecting_triangles;
   //TODO: PARALLEL_FOR #2
   for (const Pair_of_triangle_ids& p : si_pairs)
@@ -1226,7 +1233,9 @@ void autorefine_soup_output(const PointRange& input_points,
       intersecting_triangles.insert(CGAL::make_sorted_pair(i1, i2));
     }
   }
-  std::cout << t.time() << " sec. for compute_intersections()" << std::endl;
+#ifdef USE_DEBUG_PARALLEL_TIMERS
+  std::cout << t.time() << " sec. for #2" << std::endl;
+#endif
 
 #ifdef DEDUPLICATE_SEGMENTS
   // deduplicate inserted segments
@@ -1294,8 +1303,9 @@ void autorefine_soup_output(const PointRange& input_points,
   }
 #endif
 
-
-  std::cout << t.time() << " sec. for deduplicate_segments()" << std::endl;
+#ifdef USE_DEBUG_PARALLEL_TIMERS
+  std::cout << t.time() << " sec. for #3" << std::endl;
+#endif
 #endif
 
   CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
@@ -1347,6 +1357,11 @@ void autorefine_soup_output(const PointRange& input_points,
 #endif
     };
 
+
+#ifdef USE_DEBUG_PARALLEL_TIMERS
+  t.reset();
+  t.start();
+#endif
 #ifdef CGAL_LINKED_WITH_TBB
   tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
                     [&](const tbb::blocked_range<size_t>& r) {
@@ -1360,7 +1375,11 @@ void autorefine_soup_output(const PointRange& input_points,
   }
 #endif
 
-
+#ifdef USE_DEBUG_PARALLEL_TIMERS
+  t.stop();
+  std::cout << t.time() << " sec. for #1" << std::endl;
+  t.reset();
+#endif
 
   // brute force output: create a soup, orient and to-mesh
   CGAL_PMP_AUTOREFINE_VERBOSE("create output soup");
@@ -1408,10 +1427,19 @@ void autorefine_soup_output(const PointRange& input_points,
 
   // import refined triangles
     //TODO: PARALLEL_FOR #4
+#ifdef USE_DEBUG_PARALLEL_TIMERS
+  t.reset();
+  t.start();
+#endif
   for (const std::array<EK::Point_3,3>& t : new_triangles)
   {
     soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
   }
+#ifdef USE_DEBUG_PARALLEL_TIMERS
+  t.stop();
+  std::cout << t.time() << " sec. for #4" << std::endl;
+  t.reset();
+#endif
 
 #ifndef CGAL_NDEBUG
   CGAL_PMP_AUTOREFINE_VERBOSE("check soup");

From 3d6d9b3edce9890d2b0dae38c2d1231602f98411 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 30 May 2023 11:10:36 +0100
Subject: [PATCH 0320/1398] parallelize unique points

---
 .../Polygon_mesh_processing/autorefinement.h  | 73 ++++++++++++++++++-
 1 file changed, 70 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index eb24d60804a7..e5f96d26c3bd 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -41,6 +41,7 @@
 
 #ifdef CGAL_LINKED_WITH_TBB
 #include <tbb/concurrent_vector.h>
+#include <tbb/concurrent_map.h>
 #include <tbb/parallel_for.h>
 #endif
 
@@ -1386,11 +1387,18 @@ void autorefine_soup_output(const PointRange& input_points,
 
   Cartesian_converter<EK, GT> to_input;
   // TODO: reuse the fact that maps per triangle are already sorted
+
+#ifdef CGAL_LINKED_WITH_TBB
+  tbb::concurrent_map<EK::Point_3, std::size_t> point_id_map;
+#else
   std::map<EK::Point_3, std::size_t> point_id_map;
+#endif
+
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
   std::vector<EK::Point_3> exact_soup_points;
 #endif
 
+  /// Lambda get_point_id()
   auto get_point_id = [&](const typename EK::Point_3& pt)
   {
     auto insert_res = point_id_map.insert(std::make_pair(pt, soup_points.size()));
@@ -1404,6 +1412,8 @@ void autorefine_soup_output(const PointRange& input_points,
     return insert_res.first->second;
   };
 
+
+
   std::vector <std::size_t> input_point_ids;
   input_point_ids.reserve(input_points.size());
   for (const auto& p : input_points)
@@ -1431,13 +1441,70 @@ void autorefine_soup_output(const PointRange& input_points,
   t.reset();
   t.start();
 #endif
-  for (const std::array<EK::Point_3,3>& t : new_triangles)
-  {
+
+  bool sequential =
+#ifdef CGAL_LINKED_WITH_TBB
+    false;
+#else
+  true;
+#endif
+
+
+  std::size_t offset = soup_triangles.size();
+  std::string mode;
+  if(sequential || new_triangles.size() < 100){
+      mode = "sequential";
+    soup_triangles.reserve(offset + new_triangles.size());
+    for (const std::array<EK::Point_3,3>& t : new_triangles)
+      {
     soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
+      }
   }
+  else {
+      mode = "parallel";
+#ifdef CGAL_LINKED_WITH_TBB
+
+      tbb::concurrent_vector<Point_3> concurrent_soup_points;
+      /// Lambda concurrent_get_point_id()
+      auto concurrent_get_point_id = [&](const typename EK::Point_3& pt)
+      {
+          auto insert_res = point_id_map.insert(std::make_pair(pt, concurrent_soup_points.size()));
+          if (insert_res.second)
+          {
+              concurrent_soup_points.push_back(to_input(pt));
+#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
+              exact_soup_points.push_back(pt);
+#endif
+          }
+          return insert_res.first->second;
+      };
+
+
+      soup_triangles.resize(offset + new_triangles.size());
+      std::cout << "soup_triangles.size() = " << soup_triangles.size() << std::endl;
+      std::cout << "new_triangles.size() = " << new_triangles.size() << std::endl;
+      tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
+          [&](const tbb::blocked_range<size_t>& r) {
+              for (size_t ti = r.begin(); ti != r.end(); ++ti) {
+                  if (offset + ti > soup_triangles.size()) {
+                      std::cout << "ti = " << ti << std::endl;
+                  }
+                  const std::array<EK::Point_3, 3>& t = new_triangles[ti];
+                  soup_triangles[offset + ti] = CGAL::make_array(concurrent_get_point_id(t[0]), concurrent_get_point_id(t[1]), concurrent_get_point_id(t[2]));
+              }
+          }
+      );
+
+      soup_points.reserve(soup_points.size() + concurrent_soup_points.size());
+      soup_points.insert(soup_points.end(), concurrent_soup_points.begin(), concurrent_soup_points.end());
+  }
+#endif
+
+
+
 #ifdef USE_DEBUG_PARALLEL_TIMERS
   t.stop();
-  std::cout << t.time() << " sec. for #4" << std::endl;
+  std::cout << t.time() << " sec. for #4 (" << mode << ")" << std::endl;
   t.reset();
 #endif
 

From a1fbd105dacff034f89de7db2b5086c2f24999ab Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 30 May 2023 15:07:13 +0200
Subject: [PATCH 0321/1398] add TODO

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h       | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index e5f96d26c3bd..16c788c22ecc 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -164,7 +164,9 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
     }
   }
 
+
   // supporting_line intersects: points are coplanar
+  // TODO: check if we can write a dedicated predicate taking advantage of p,q being shared
   ::CGAL::Orientation pqr = cpl_orient(p, q, r);
   ::CGAL::Orientation pqs = cpl_orient(p, q, s);
 

From 4b2f3e6ec7c10e0d7acf8d40608f4e548db7e091 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 30 May 2023 16:01:05 +0200
Subject: [PATCH 0322/1398] take np into account for concurrency

---
 .../soup_autorefinement.cpp                   |   4 +-
 .../Polygon_mesh_processing/autorefinement.h  | 211 ++++++++++--------
 2 files changed, 115 insertions(+), 100 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index d5ebeb78c3f5..823c50974dcc 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -34,7 +34,9 @@ int main(int argc, char** argv)
   t.start();
   std::vector<Point> output_points;
   std::vector<std::array<std::size_t, 3>> output_triangles;
-  PMP::autorefine_soup_output(input_points, input_triangles, output_points, output_triangles);
+  PMP::autorefine_soup_output(input_points, input_triangles,
+                              output_points, output_triangles,
+                              CGAL::parameters::concurrency_tag(CGAL::Parallel_if_available_tag()));
   std::cout << "#points = " << output_points.size() << " and #triangles = " << output_triangles.size() << " in " << t.time() << " sec." << std::endl;
   CGAL::IO::write_polygon_soup("autorefined.off", output_points, output_triangles, CGAL::parameters::stream_precision(17));
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 16c788c22ecc..ae383a4af293 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -658,10 +658,11 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
 //////////////////////////////////
 //////////////////////////////////
 
-template <class EK
+template <class EK,
 #ifdef USE_FIXED_PROJECTION_TRAITS
-, int dim
+          int dim,
 #endif
+          class PointVector
 >
 void generate_subtriangles(std::size_t ti,
                            std::vector<std::pair<std::size_t, std::size_t>>& segments,
@@ -669,11 +670,7 @@ void generate_subtriangles(std::size_t ti,
                            const std::vector<std::size_t>& in_triangle_ids,
                            const std::set<std::pair<std::size_t, std::size_t> >& intersecting_triangles,
                            const std::vector<std::array<typename EK::Point_3,3>>& triangles,
-#ifdef CGAL_LINKED_WITH_TBB
-                           tbb::concurrent_vector<std::array<typename EK::Point_3,3>>& new_triangles
-#else
-                           std::vector<std::array<typename EK::Point_3,3>>& new_triangles
-#endif
+                           PointVector& new_triangles
                            )
 {
   // std::cout << "generate_subtriangles()\n";
@@ -1131,6 +1128,14 @@ void autorefine_soup_output(const PointRange& input_points,
     Sequential_tag
   > ::type Concurrency_tag;
 
+  constexpr bool parallel_execution = std::is_same_v<Parallel_tag, Concurrency_tag>;
+
+#ifndef CGAL_LINKED_WITH_TBB
+  CGAL_static_assertion_msg (parallel_execution,
+                             "Parallel_tag is enabled but TBB is unavailable.");
+#endif
+
+
   typedef std::size_t Input_TID;
   typedef std::pair<Input_TID, Input_TID> Pair_of_triangle_ids;
 
@@ -1294,16 +1299,20 @@ void autorefine_soup_output(const PointRange& input_points,
   };
 
 #ifdef CGAL_LINKED_WITH_TBB
-  tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
-                    [&](const tbb::blocked_range<size_t>& r) {
-                      for (size_t ti = r.begin(); ti != r.end(); ++ti)
-                        deduplicate_inserted_segments(ti);
-                    }
-                    );
-#else
-  for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
-    deduplicate_inserted_segments(ti);
+  if (parallel_execution)
+  {
+    tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
+                      [&](const tbb::blocked_range<size_t>& r) {
+                        for (size_t ti = r.begin(); ti != r.end(); ++ti)
+                          deduplicate_inserted_segments(ti);
+                      }
+                      );
   }
+  else
+#else
+    for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
+      deduplicate_inserted_segments(ti);
+    }
 #endif
 
 #ifdef USE_DEBUG_PARALLEL_TIMERS
@@ -1314,7 +1323,9 @@ void autorefine_soup_output(const PointRange& input_points,
   CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
   // now refine triangles
 #ifdef CGAL_LINKED_WITH_TBB
-    tbb::concurrent_vector<std::array<EK::Point_3, 3>> new_triangles;
+    std::conditional_t<parallel_execution,
+                       tbb::concurrent_vector<std::array<EK::Point_3, 3>>,
+                       std::vector<std::array<EK::Point_3,3>>> new_triangles;
 #else
   std::vector<std::array<EK::Point_3,3>> new_triangles;
 #endif
@@ -1325,40 +1336,40 @@ void autorefine_soup_output(const PointRange& input_points,
 
 
   auto refine_triangles = [&](std::size_t ti)
+  {
+    if (all_segments[ti].empty() && all_points[ti].empty())
+      new_triangles.push_back(triangles[ti]);
+    else
     {
-      if (all_segments[ti].empty() && all_points[ti].empty())
-        new_triangles.push_back(triangles[ti]);
-      else
-        {
 #ifdef USE_FIXED_PROJECTION_TRAITS
-          const std::array<typename EK::Point_3, 3>& t = triangles[ti];
-          auto is_constant_in_dim = [](const std::array<typename EK::Point_3, 3>& t, int dim)
-          {
-            return t[0][dim] == t[1][dim] && t[0][dim] != t[2][dim];
-          };
+      const std::array<typename EK::Point_3, 3>& t = triangles[ti];
+      auto is_constant_in_dim = [](const std::array<typename EK::Point_3, 3>& t, int dim)
+      {
+        return t[0][dim] == t[1][dim] && t[0][dim] != t[2][dim];
+      };
 
-          typename EK::Vector_3 orth = CGAL::normal(t[0], t[1], t[2]); // TODO::avoid construction?
-          int c = CGAL::abs(orth[0]) > CGAL::abs(orth[1]) ? 0 : 1;
-          c = CGAL::abs(orth[2]) > CGAL::abs(orth[c]) ? 2 : c;
+      typename EK::Vector_3 orth = CGAL::normal(t[0], t[1], t[2]); // TODO::avoid construction?
+      int c = CGAL::abs(orth[0]) > CGAL::abs(orth[1]) ? 0 : 1;
+      c = CGAL::abs(orth[2]) > CGAL::abs(orth[c]) ? 2 : c;
 
-          if (c == 0) {
-            autorefine_impl::generate_subtriangles<EK, 0>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
-          }
-          else if (c == 1) {
-            autorefine_impl::generate_subtriangles<EK, 1>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
-          }
-          else if (c == 2) {
-            autorefine_impl::generate_subtriangles<EK, 2>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
-          }
+      if (c == 0) {
+        autorefine_impl::generate_subtriangles<EK, 0>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+      }
+      else if (c == 1) {
+        autorefine_impl::generate_subtriangles<EK, 1>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+      }
+      else if (c == 2) {
+        autorefine_impl::generate_subtriangles<EK, 2>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+      }
 #else
-          autorefine_impl::generate_subtriangles<EK>(ti, all_segments_ids[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+      autorefine_impl::generate_subtriangles<EK>(ti, all_segments_ids[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
 #endif
-        }
+    }
 
 #ifdef USE_PROGRESS_DISPLAY
-      ++pd;
+    ++pd;
 #endif
-    };
+  };
 
 
 #ifdef USE_DEBUG_PARALLEL_TIMERS
@@ -1366,16 +1377,20 @@ void autorefine_soup_output(const PointRange& input_points,
   t.start();
 #endif
 #ifdef CGAL_LINKED_WITH_TBB
-  tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
-                    [&](const tbb::blocked_range<size_t>& r) {
-                      for (size_t ti = r.begin(); ti != r.end(); ++ti)
-                        refine_triangles(ti);
-                    }
-                    );
-#else
-  for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
-    refine_triangles(ti);
+  if (parallel_execution)
+  {
+    tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
+                      [&](const tbb::blocked_range<size_t>& r) {
+                        for (size_t ti = r.begin(); ti != r.end(); ++ti)
+                          refine_triangles(ti);
+                      }
+                      );
   }
+  else
+#else
+    for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
+      refine_triangles(ti);
+    }
 #endif
 
 #ifdef USE_DEBUG_PARALLEL_TIMERS
@@ -1391,7 +1406,9 @@ void autorefine_soup_output(const PointRange& input_points,
   // TODO: reuse the fact that maps per triangle are already sorted
 
 #ifdef CGAL_LINKED_WITH_TBB
-  tbb::concurrent_map<EK::Point_3, std::size_t> point_id_map;
+  std::conditional_t<parallel_execution,
+                     tbb::concurrent_map<EK::Point_3, std::size_t>,
+                     std::map<EK::Point_3, std::size_t>> point_id_map;
 #else
   std::map<EK::Point_3, std::size_t> point_id_map;
 #endif
@@ -1444,63 +1461,59 @@ void autorefine_soup_output(const PointRange& input_points,
   t.start();
 #endif
 
-  bool sequential =
-#ifdef CGAL_LINKED_WITH_TBB
-    false;
-#else
-  true;
+  std::size_t offset = soup_triangles.size();
+#ifdef USE_DEBUG_PARALLEL_TIMERS
+  std::string mode = "parallel";
 #endif
 
-
-  std::size_t offset = soup_triangles.size();
-  std::string mode;
-  if(sequential || new_triangles.size() < 100){
-      mode = "sequential";
-    soup_triangles.reserve(offset + new_triangles.size());
-    for (const std::array<EK::Point_3,3>& t : new_triangles)
-      {
-    soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
-      }
-  }
-  else {
-      mode = "parallel";
+  //TODO: 100 should be fined tune and depends on #threads
 #ifdef CGAL_LINKED_WITH_TBB
-
-      tbb::concurrent_vector<Point_3> concurrent_soup_points;
-      /// Lambda concurrent_get_point_id()
-      auto concurrent_get_point_id = [&](const typename EK::Point_3& pt)
-      {
-          auto insert_res = point_id_map.insert(std::make_pair(pt, concurrent_soup_points.size()));
-          if (insert_res.second)
-          {
-              concurrent_soup_points.push_back(to_input(pt));
+  if(parallel_execution && new_triangles.size() > 100)
+  {
+    tbb::concurrent_vector<Point_3> concurrent_soup_points;
+    /// Lambda concurrent_get_point_id()
+    auto concurrent_get_point_id = [&](const typename EK::Point_3& pt)
+    {
+        auto insert_res = point_id_map.insert(std::make_pair(pt, concurrent_soup_points.size()));
+        if (insert_res.second)
+        {
+            concurrent_soup_points.push_back(to_input(pt));
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
-              exact_soup_points.push_back(pt);
+            exact_soup_points.push_back(pt);
 #endif
-          }
-          return insert_res.first->second;
-      };
+        }
+        return insert_res.first->second;
+    };
 
 
-      soup_triangles.resize(offset + new_triangles.size());
-      std::cout << "soup_triangles.size() = " << soup_triangles.size() << std::endl;
-      std::cout << "new_triangles.size() = " << new_triangles.size() << std::endl;
-      tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
-          [&](const tbb::blocked_range<size_t>& r) {
-              for (size_t ti = r.begin(); ti != r.end(); ++ti) {
-                  if (offset + ti > soup_triangles.size()) {
-                      std::cout << "ti = " << ti << std::endl;
-                  }
-                  const std::array<EK::Point_3, 3>& t = new_triangles[ti];
-                  soup_triangles[offset + ti] = CGAL::make_array(concurrent_get_point_id(t[0]), concurrent_get_point_id(t[1]), concurrent_get_point_id(t[2]));
-              }
-          }
-      );
+    soup_triangles.resize(offset + new_triangles.size());
+    std::cout << "soup_triangles.size() = " << soup_triangles.size() << std::endl;
+    std::cout << "new_triangles.size() = " << new_triangles.size() << std::endl;
+    tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
+        [&](const tbb::blocked_range<size_t>& r) {
+            for (size_t ti = r.begin(); ti != r.end(); ++ti) {
+                if (offset + ti > soup_triangles.size()) {
+                    std::cout << "ti = " << ti << std::endl;
+                }
+                const std::array<EK::Point_3, 3>& t = new_triangles[ti];
+                soup_triangles[offset + ti] = CGAL::make_array(concurrent_get_point_id(t[0]), concurrent_get_point_id(t[1]), concurrent_get_point_id(t[2]));
+            }
+        }
+    );
 
-      soup_points.reserve(soup_points.size() + concurrent_soup_points.size());
-      soup_points.insert(soup_points.end(), concurrent_soup_points.begin(), concurrent_soup_points.end());
+    soup_points.reserve(soup_points.size() + concurrent_soup_points.size());
+    soup_points.insert(soup_points.end(), concurrent_soup_points.begin(), concurrent_soup_points.end());
   }
+  else
+#endif
+  {
+#ifdef USE_DEBUG_PARALLEL_TIMERS
+    mode = "sequential";
 #endif
+    soup_triangles.reserve(offset + new_triangles.size());
+    for (const std::array<EK::Point_3,3>& t : new_triangles)
+      soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
+  }
 
 
 

From 388ae042c6913dca60fbf135edcd18ca6da67c62 Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Wed, 31 May 2023 09:11:28 +0200
Subject: [PATCH 0323/1398] Fix typo

---
 Documentation/doc/CMakeLists.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Documentation/doc/CMakeLists.txt b/Documentation/doc/CMakeLists.txt
index 404d93efa663..f6cb41191d5e 100644
--- a/Documentation/doc/CMakeLists.txt
+++ b/Documentation/doc/CMakeLists.txt
@@ -403,7 +403,7 @@ else()
 endif()
 
 #special cases
-foreach(pkg "Mesh_level")
+foreach(pkg "Mesher_level")
   if(CGAL_BRANCH_BUILD)
     set(CGAL_${pkg}_INCLUDE_DIR "${CGAL_ROOT}/${pkg}/include")
   else()

From 3d6c0da44cdf28be1ebfc4e7818ba78987c7209c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 31 May 2023 09:14:42 +0200
Subject: [PATCH 0324/1398] remove debug

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h | 8 +++-----
 1 file changed, 3 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index ae383a4af293..18bbfa2ce40f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1323,9 +1323,9 @@ void autorefine_soup_output(const PointRange& input_points,
   CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
   // now refine triangles
 #ifdef CGAL_LINKED_WITH_TBB
-    std::conditional_t<parallel_execution,
-                       tbb::concurrent_vector<std::array<EK::Point_3, 3>>,
-                       std::vector<std::array<EK::Point_3,3>>> new_triangles;
+  std::conditional_t<parallel_execution,
+                     tbb::concurrent_vector<std::array<EK::Point_3, 3>>,
+                     std::vector<std::array<EK::Point_3,3>>> new_triangles;
 #else
   std::vector<std::array<EK::Point_3,3>> new_triangles;
 #endif
@@ -1487,8 +1487,6 @@ void autorefine_soup_output(const PointRange& input_points,
 
 
     soup_triangles.resize(offset + new_triangles.size());
-    std::cout << "soup_triangles.size() = " << soup_triangles.size() << std::endl;
-    std::cout << "new_triangles.size() = " << new_triangles.size() << std::endl;
     tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
         [&](const tbb::blocked_range<size_t>& r) {
             for (size_t ti = r.begin(); ti != r.end(); ++ti) {

From 8f0a9dd99685d6b7704b2297baede974b5a84543 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 31 May 2023 11:34:37 +0200
Subject: [PATCH 0325/1398] Fix two links

---
 Mesh_3/doc/Mesh_3/Mesh_3.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Mesh_3/doc/Mesh_3/Mesh_3.txt b/Mesh_3/doc/Mesh_3/Mesh_3.txt
index 90afbe72b31b..4b4a67432708 100644
--- a/Mesh_3/doc/Mesh_3/Mesh_3.txt
+++ b/Mesh_3/doc/Mesh_3/Mesh_3.txt
@@ -296,7 +296,7 @@ also inserts a small set of auxiliary vertices that belong to the triangulation
 but are isolated from the complex at the end of the meshing process.
 
 These so-called \em isolated vertices belong to the triangulation but not to any cell
-of the `C3T3`. They can be removed using the function `remove_isolated_vertices()`.
+of the `C3T3`. They can be removed using the function `CGAL::Polygon_mesh_processing::remove_isolated_vertices()`.
 
 
 \section Mesh_3_section_interface Interface
@@ -725,7 +725,7 @@ to the voxels surface, causing an aliasing effect.
 A solution to generate a smooth and accurate output surface was described by Stalling et al in
 \cgalCite{stalling1998weighted}. It consists in generating a second input image, made
 of integer coefficients called *weights*, and use those weights to define smoother domain boundaries.
-The 3D image of weights can be generated using `CGAL::Mesh_3::generate_weights()` as shown in
+The 3D image of weights can be generated using `CGAL::Mesh_3::generate_label_weights()` as shown in
 the following example.
 
 \cgalExample{Mesh_3/mesh_3D_weighted_image.cpp}

From 21358ac490cad6635cb7198b7cbef268e78c9d5b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 31 May 2023 17:41:39 +0200
Subject: [PATCH 0326/1398] Clean CMakelists.txt

---
 Mesh_3/test/Mesh_3/CMakeLists.txt | 6 ------
 1 file changed, 6 deletions(-)

diff --git a/Mesh_3/test/Mesh_3/CMakeLists.txt b/Mesh_3/test/Mesh_3/CMakeLists.txt
index 2a8e19e1c383..b0e9e250c27a 100644
--- a/Mesh_3/test/Mesh_3/CMakeLists.txt
+++ b/Mesh_3/test/Mesh_3/CMakeLists.txt
@@ -30,17 +30,14 @@ create_single_source_cgal_program( "test_without_detect_features.cpp" )
 
 if(CGAL_ImageIO_USE_ZLIB)
   create_single_source_cgal_program( "test_meshing_3D_image.cpp" )
-  create_single_source_cgal_program( "test_meshing_3D_image_deprecated.cpp" )
   create_single_source_cgal_program( "test_meshing_3D_image_with_features.cpp" )
   create_single_source_cgal_program( "test_meshing_3D_gray_image.cpp" )
-  create_single_source_cgal_program( "test_meshing_3D_gray_image_deprecated.cpp" )
   create_single_source_cgal_program( "test_min_size_criteria.cpp")
 else()
   message(STATUS "NOTICE: The test 'test_meshing_3D_image' requires the ZLIB library, and will not be compiled.")
 endif()
 
 create_single_source_cgal_program( "test_meshing_implicit_function.cpp" )
-create_single_source_cgal_program( "test_meshing_implicit_function_deprecated.cpp" )
 create_single_source_cgal_program( "test_meshing_polyhedral_complex.cpp" )
 create_single_source_cgal_program( "test_meshing_polyhedron.cpp" )
 create_single_source_cgal_program( "test_meshing_polylines_only.cpp" )
@@ -66,12 +63,9 @@ foreach(target
     test_mesh_criteria_creation
     test_without_detect_features
     test_meshing_3D_image
-    test_meshing_3D_image_deprecated
     test_meshing_3D_image_with_features
     test_meshing_3D_gray_image
-    test_meshing_3D_gray_image_deprecated
     test_meshing_implicit_function
-    test_meshing_implicit_function_deprecated
     test_meshing_polyhedral_complex
     test_meshing_polyhedron
     test_meshing_polylines_only

From 163dd738d9b17facd54a9e9cfc2770b34354afda Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 5 Jun 2023 11:31:39 +0100
Subject: [PATCH 0327/1398] PSP: wlop_simplify() performance improvement

---
 .../include/CGAL/wlop_simplify_and_regularize_point_set.h   | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Point_set_processing_3/include/CGAL/wlop_simplify_and_regularize_point_set.h b/Point_set_processing_3/include/CGAL/wlop_simplify_and_regularize_point_set.h
index 41412051408c..149944d50a29 100644
--- a/Point_set_processing_3/include/CGAL/wlop_simplify_and_regularize_point_set.h
+++ b/Point_set_processing_3/include/CGAL/wlop_simplify_and_regularize_point_set.h
@@ -525,6 +525,7 @@ wlop_simplify_and_regularize_point_set(
 
   if (require_uniform_sampling)//default value is false
   {
+    original_density_weights.reserve(number_of_original);
     //todo: this part could also be parallelized if needed
     for (it = first_original_iter, i = 0; it != points.end() ; ++it, ++i)
     {
@@ -552,6 +553,7 @@ wlop_simplify_and_regularize_point_set(
 
     // Compute sample density weight for sample points
     std::vector<FT> sample_density_weights;
+    sample_density_weights.reserve(number_of_sample);
 
     for (sample_iter = sample_points.begin();
          sample_iter != sample_points.end(); ++sample_iter)
@@ -602,9 +604,7 @@ wlop_simplify_and_regularize_point_set(
     if (interrupted)
       return output;
 
-    sample_iter = sample_points.begin();
-    for (std::size_t i = 0; i < sample_points.size(); ++ i)
-      sample_points[i] = update_sample_points[i];
+    sample_points.swap(update_sample_points);
   }
 
   // final output

From 854aacd671b9936730e97f8bf003bf2969e016fe Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 6 Jun 2023 15:31:19 +0200
Subject: [PATCH 0328/1398] add comments

---
 .../Triangle_3_Triangle_3_intersection.h      | 48 ++++++++++++-------
 1 file changed, 31 insertions(+), 17 deletions(-)

diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index 4cc5f9be5600..99dcd24ff457 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -59,6 +59,19 @@ coplanar_segment_segment_alpha_intersection(const typename K::Point_3& p1, const
 template <class Kernel>
 struct Point_on_triangle
 {
+  // triangle points are not stored in this class but are expected
+  // to always be passed in the same order. For a triangle pqr,
+  // edge 0 is pq, edge 1 qr and edge 2 rp. Point 0 is p, 1 is q and 2 is r.
+  //
+  // (id, -1) point on t1
+  // (-1, id) point on t2
+  // (id1, id2) intersection of edges
+  std::pair<int, int> t1_t2_ids;
+  boost::container::flat_set<int> extra_t1; // store other ids of edges containing the point
+  typename Kernel::FT alpha; //
+
+//////
+
   static
   inline
   const typename Kernel::Point_3&
@@ -83,13 +96,7 @@ struct Point_on_triangle
     , alpha(alpha)
   {}
 
-  // (id, -1) point on t1
-  // (-1, id) point on t2
-  // (id1, id2) intersection of edges
-  std::pair<int, int> t1_t2_ids;
-  boost::container::flat_set<int> extra_t1;
-  typename Kernel::FT alpha;
-
+  // orientation of the current point wrt to edge id1 (p1q1)
   Orientation
   orientation (const typename Kernel::Point_3& p1, // source of edge edge_id1
                const typename Kernel::Point_3& q1, // target of edge edge_id1
@@ -116,7 +123,7 @@ struct Point_on_triangle
       CGAL_assertion((t1_t2_ids.first+1)%3==edge_id1);
       if (alpha==1) return ZERO;
       return alpha<=1?POSITIVE:NEGATIVE;
-  }
+    }
     else
     {
       //this is an input point of t2
@@ -129,6 +136,7 @@ struct Point_on_triangle
   int id1() const { return t1_t2_ids.first; }
   int id2() const { return t1_t2_ids.second; }
 
+  // construct the intersection point from the info stored
   typename Kernel::Point_3
   point(const typename Kernel::Point_3& p1,
         const typename Kernel::Point_3& q1,
@@ -147,6 +155,12 @@ struct Point_on_triangle
   }
 };
 
+// the intersection of two triangles is computed by interatively intersection t2
+// with halfspaces defined by edges of t1. The following function is called
+// for each each on t1 on edge of the current intersection.
+// pq is such an edge and p1q1 from t1 defines the halfspace intersection
+// we are currently interseted in. We return the intersection point of
+// pq with p1q1
 template <class Kernel>
 Point_on_triangle<Kernel>
 intersection(const Point_on_triangle<Kernel>& p,
@@ -172,7 +186,7 @@ intersection(const Point_on_triangle<Kernel>& p,
     {
       switch(q.id1())
       {
-        case -1: // (-1, ip2) - (-1, iq2)
+        case -1: // A: (-1, ip2) - (-1, iq2)
         {
           CGAL_assertion((p.id2()+1)%3 == q.id2() || (q.id2()+1)%3 == p.id2());
 //          CGAL_assertion(p.extra_t1.empty() && q.extra_t1.empty());  // TMP to see if it's worth implementing special case
@@ -187,7 +201,7 @@ intersection(const Point_on_triangle<Kernel>& p,
           return  Point_on_triangle<Kernel>(edge_id_t1, id2, alpha); // intersection with an original edge of t2
         }
         default:
-          if (q.id2()!=-1) // (-1, ip2) - (iq1, iq2)
+          if (q.id2()!=-1) // B: (-1, ip2) - (iq1, iq2)
           {
             if (p.id2() == q.id2() || p.id2() == (q.id2()+1)%3)
             {
@@ -210,7 +224,7 @@ intersection(const Point_on_triangle<Kernel>& p,
             int eid1 = p.extra_t1.count(q.id1())!=0 ? q.id1() : 3-q.id1()-edge_id_t1;
             return  Point_on_triangle<Kernel>((eid1+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3, -1); // vertex of t1
           }
-          // (-1, ip2) - (iq1, -1)
+          // C: (-1, ip2) - (iq1, -1)
           //vertex of t1, special case t1 edge passed thru a vertex of t2
           CGAL_assertion(edge_id_t1 == 2);
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
@@ -229,7 +243,7 @@ intersection(const Point_on_triangle<Kernel>& p,
         {
           switch(q.id1())
           {
-            case -1: // (ip1, -1) - (-1, iq2)
+            case -1: // G: (ip1, -1) - (-1, iq2)
               //vertex of t1, special case t1 edge passed thru a vertex of t2
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
               std::cout << " -- case 5\n";
@@ -243,8 +257,8 @@ intersection(const Point_on_triangle<Kernel>& p,
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
               std::cout << " -- case 6\n";
 #endif
-              CGAL_assertion(q.id2()!=-1); // (ip1, -1) - (iq2, -1)
-              //(ip1,-1), (iq1, iq2)
+              CGAL_assertion(q.id2()!=-1); // I: (ip1, -1) - (iq2, -1)
+              //H: (ip1,-1), (iq1, iq2)
               CGAL_assertion(edge_id_t1==2);
               // p and q are on the same edge of t1
               CGAL_assertion(p.id1()==q.id1() || p.id1()==(q.id1()+1)%3);
@@ -256,7 +270,7 @@ intersection(const Point_on_triangle<Kernel>& p,
         {
           switch(q.id1())
           {
-            case -1: // (ip1, ip2) - (-1, iq2)
+            case -1: // D: (ip1, ip2) - (-1, iq2)
             {
               if (q.id2() == p.id2() || q.id2() == (p.id2()+1)%3)
               {
@@ -284,7 +298,7 @@ intersection(const Point_on_triangle<Kernel>& p,
             {
               switch(q.id2())
               {
-                case -1: // (ip1, ip2) - (iq1, -1)
+                case -1: // F: (ip1, ip2) - (iq1, -1)
                 {
                   // p and q are on the same edge of t1
                   CGAL_assertion(q.id1()==p.id1() ||  q.id1()==(p.id1()+1)%3);
@@ -293,7 +307,7 @@ intersection(const Point_on_triangle<Kernel>& p,
 #endif
                   return  Point_on_triangle<Kernel>((p.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3 , -1);
                 }
-                default: // (ip1, ip2) - (iq1, iq2)
+                default: // E: (ip1, ip2) - (iq1, iq2)
                 {
                   if (p.id2()==q.id2())
                   {

From 1c646c0db234adde54f900f0dcdbb4964815c5b8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 7 Jun 2023 10:28:35 +0200
Subject: [PATCH 0329/1398] Do not take a const& to the oracle in AW3

No changes to existing oracles as AW3's oracles use a shared ptr to AABB Tree
---
 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 20982e9beaaa..62c9f81c45d5 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -173,7 +173,7 @@ class Alpha_wrap_3
   using Alpha_PQ = Modifiable_priority_queue<Gate, Less_gate, Gate_ID_PM<Dt>, CGAL_BOOST_PAIRING_HEAP>;
 
 protected:
-  const Oracle& m_oracle;
+  const Oracle m_oracle;
   SC_Iso_cuboid_3 m_bbox;
 
   FT m_alpha, m_sq_alpha;

From 5c8acef03564129faf1a214b915ec1403071115e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 7 Jun 2023 10:29:42 +0200
Subject: [PATCH 0330/1398] Add the possibility to interrupt AW3 (whether
 iterative visu is used or not)

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h |   1 +
 .../Alpha_wrap_3/Alpha_wrap_3_plugin.cpp      | 558 +++++++++++++-----
 .../Alpha_wrap_3/alpha_wrap_3_dialog.ui       | 370 ++++++------
 3 files changed, 598 insertions(+), 331 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 62c9f81c45d5..51d0fc17db42 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1343,6 +1343,7 @@ class Alpha_wrap_3
     return true;
   }
 
+public:
   // Not the best complexity, but it's very cheap compared to the rest of the algorithm.
   void make_manifold()
   {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index bb686a60f98e..bbee40716425 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -10,7 +10,6 @@
 #include "Scene_points_with_normal_item.h"
 
 #include <CGAL/alpha_wrap_3.h>
-#include <CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h>
 
 #include <QAction>
 #include <QApplication>
@@ -20,6 +19,8 @@
 #include <QMessageBox>
 #include <QTextStream>
 #include <QString>
+#include <QThread>
+#include <QTimer>
 #include <QTranslator>
 #include <QtPlugin>
 
@@ -31,44 +32,85 @@
 
 #include "ui_alpha_wrap_3_dialog.h"
 
-struct Iterative_AW3_visualization_visitor
+using TS_Oracle = CGAL::Alpha_wraps_3::internal::Triangle_soup_oracle<Kernel>;
+using SS_Oracle = CGAL::Alpha_wraps_3::internal::Segment_soup_oracle<Kernel, TS_Oracle>;
+using Oracle = CGAL::Alpha_wraps_3::internal::Point_set_oracle<Kernel, SS_Oracle>;
+using Wrapper = CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle>;
+
+// Here is the pipeline for the interruption box:
+// - The main window is connected to a wrapping thread, which performs the wrapping.
+// - The wrapping has a visitor, AW3_interrupter_visitor, which has a shared_ptr to a Boolean
+// - When the user clicks the box, the Boolean is switched to *false*, and the visitor throws
+// - The wrapping thread catches the exception, and creates the wip mesh
+
+// Here is the pipeline for the iterative visualization:
+// - The main window is connected to a wrapping thread, which performs the wrapping.
+// - The wrapping has a visitor, Iterative_AW3_visualization_visitor
+// - The visitor has a shared pointer to an emiter (can't emit directly from the visitor)
+// - The visitor has shared pointers to a polygon soup (+ colors), which it updates itself
+//   before emitting a signal
+// - There is a pause in the emition because it needs to wait for the main thread to draw the
+//   polygon soup before the visitor updates the polygon soup.
+
+struct Iterative_update_emiter
+  : public QObject
 {
-private:
-  bool m_do_snapshot;
-  Scene_polygon_soup_item* m_iterative_wrap_item = nullptr;
-  int sid = 0;
+  Q_OBJECT
 
 public:
-  template <typename Scene>
-  Iterative_AW3_visualization_visitor(Scene* scene,
-                                      const bool visualize_iterations,
-                                      const bool do_snapshot)
-    : m_do_snapshot(do_snapshot)
+  void emit_new_iteration(int sid)
   {
-    if(!visualize_iterations)
-      return;
+    Q_EMIT new_iteration(sid);
+    CGAL::Three::Three::getMutex()->lock();
+    Three::getWaitCondition()->wait(CGAL::Three::Three::getMutex());
+    CGAL::Three::Three::getMutex()->unlock();
+  }
 
-    m_iterative_wrap_item = new Scene_polygon_soup_item();
-    m_iterative_wrap_item->setName(QString("Iterative wrap"));
-    scene->addItem(m_iterative_wrap_item);
+  void emit_last_iteration(int sid)
+  {
+    // Last iteration only updates the (existing) soup item's properties, but there is no change
+    // in geometry, so there is no need to wait for the main thread to update the main window.
+    Q_EMIT last_iteration(sid);
   }
 
-public:
-  template <typename AlphaWrapper>
-  void on_alpha_wrapping_begin(const AlphaWrapper&) { }
+Q_SIGNALS:
+  void new_iteration(int);
+  void last_iteration(int sid);
+};
 
-  template <typename AlphaWrapper>
-  void on_flood_fill_begin(const AlphaWrapper&) { }
+struct Iterative_AW3_visualization_visitor
+  : public CGAL::Alpha_wraps_3::internal::Wrapping_default_visitor
+{
+private:
+  const bool visualize_iterations;
 
-  template <typename AlphaWrapper, typename Facet>
-  void before_facet_treatment(const AlphaWrapper&,
-                              const Facet&) { }
+  std::shared_ptr<std::vector<Kernel::Point_3> > points;
+  std::shared_ptr<std::vector<std::vector<std::size_t> > > faces;
+  std::shared_ptr<std::vector<CGAL::IO::Color> > fcolors;
+  std::shared_ptr<std::vector<CGAL::IO::Color> > vcolors;
+  std::shared_ptr<Iterative_update_emiter> emiter;
+  int sid = 0;
+
+public:
+  Iterative_AW3_visualization_visitor(const bool visualize_iterations,
+                                      std::shared_ptr<std::vector<Kernel::Point_3> > points,
+                                      std::shared_ptr<std::vector<std::vector<std::size_t> > > faces,
+                                      std::shared_ptr<std::vector<CGAL::IO::Color> > fcolors,
+                                      std::shared_ptr<std::vector<CGAL::IO::Color> > vcolors,
+                                      std::shared_ptr<Iterative_update_emiter> emiter)
+    : visualize_iterations(visualize_iterations),
+      points(points), faces(faces), fcolors(fcolors), vcolors(vcolors),
+      emiter(emiter)
+  { }
 
   template <typename AlphaWrapper, typename Point>
   void before_Steiner_point_insertion(const AlphaWrapper& wrapper,
                                       const Point& /* p */)
   {
-    if(m_iterative_wrap_item == nullptr)
+    if(!visualize_iterations)
+      return;
+
+    if(!points || !faces || !fcolors || !vcolors)
       return;
 
     // If the next top of the queue has vertices on the bbox, don't draw (as to avoid producing
@@ -82,18 +124,20 @@ struct Iterative_AW3_visualization_visitor
       return;
 
     // Extract the wrap as a triangle soup
+    points->clear();
+    faces->clear();
+    fcolors->clear();
+    vcolors->clear();
 
     using Dt = typename std::decay<decltype(wrapper.triangulation())>::type;
     using Vertex_handle = typename Dt::Vertex_handle;
     using Facet = typename Dt::Facet;
     using Cell_handle = typename Dt::Cell_handle;
 
-    std::vector<Kernel::Point_3> points;
-    std::vector<std::vector<std::size_t> > faces;
-
     std::unordered_map<Vertex_handle, std::size_t> vertex_to_id;
     std::size_t nv = 0;
 
+#if 0
     // This is used to compute colors depending on what is old and what is new.
     // It is not currently used (a uniform gray color is used), but leaving it as it might be useful.
     std::size_t min_time_stamp = -1, max_time_stamp = 0;
@@ -104,9 +148,7 @@ struct Iterative_AW3_visualization_visitor
       if(cit->time_stamp() < min_time_stamp)
         min_time_stamp = cit->time_stamp();
     }
-
-    std::vector<CGAL::IO::Color> vcolors;
-    std::vector<CGAL::IO::Color> fcolors;
+#endif
 
     for(auto fit=wrapper.triangulation().finite_facets_begin(), fend=wrapper.triangulation().finite_facets_end(); fit!=fend; ++fit)
     {
@@ -127,85 +169,143 @@ struct Iterative_AW3_visualization_visitor
         auto insertion_res = vertex_to_id.emplace(vh, nv);
         if(insertion_res.second) // successful insertion, never-seen-before vertex
         {
-          points.push_back(wrapper.triangulation().point(vh));
-          vcolors.push_back(CGAL::IO::Color(0, 0, 0));
+          points->push_back(wrapper.triangulation().point(vh));
+          vcolors->push_back(CGAL::IO::Color(0, 0, 0));
           ++nv;
         }
 
         ids[pos] = insertion_res.first->second;
       }
 
-      faces.emplace_back(std::vector<std::size_t>{ids[0], ids[1], ids[2]});
-      double color_val = double(c->time_stamp() - min_time_stamp) / double(max_time_stamp - min_time_stamp);
-      color_val = int(256. * color_val);
+      faces->emplace_back(std::vector<std::size_t>{ids[0], ids[1], ids[2]});
 
-      // fcolors.push_back(CGAL::IO::Color(color_val, 10, 150)); // young is red, old is blue
+#if 0
+      double color_val = double(c->time_stamp() - min_time_stamp) / double(max_time_stamp - min_time_stamp);
+       color_val = int(256. * color_val);
+      fcolors.push_back(CGAL::IO::Color(color_val, 10, 150)); // young is red, old is blue
       // fcolors.push_back(CGAL::IO::Color(256 - color_val, 256 - color_val, 256 - color_val)); // young is light, old is dark
-      fcolors.push_back(CGAL::IO::Color(100, 100, 100)); // uniform darkish gray
+#endif
+      fcolors->push_back(CGAL::IO::Color(100, 100, 100)); // uniform darkish gray
     }
 
-    // Update the wrap item's visualization
-    m_iterative_wrap_item->load(points, faces, fcolors, vcolors);
-    m_iterative_wrap_item->setName(QString("Iterative wrap #%1").arg(sid));
-    m_iterative_wrap_item->setAlpha(255 / 2);
+    emiter->emit_new_iteration(sid++);
+  }
 
-    m_iterative_wrap_item->invalidateOpenGLBuffers();
-    m_iterative_wrap_item->redraw();
-    m_iterative_wrap_item->itemChanged();
+  template <typename AlphaWrapper>
+  void on_alpha_wrapping_end(const AlphaWrapper&)
+  {
+    if(!visualize_iterations)
+      return;
 
-    // Refresh the view
-    QApplication::processEvents();
+    emiter->emit_last_iteration(sid);
+  }
+};
 
-    if(m_do_snapshot)
-    {
-      std::stringstream oss;
-      oss << "Wrap_iteration-" << sid << ".png" << std::ends;
-      QString filename = QString::fromStdString(oss.str().c_str());
+// Use a throw to get out of the AW3 refinement loop
+class Out_of_patience_exception : public std::exception { };
 
-      CGAL::Three::Viewer_interface* viewer = CGAL::Three::Three::activeViewer();
-      viewer->saveSnapshot(filename, 1920, 1080, true /*expand*/, 2.0 /*oversampling*/);
-    }
+template <typename BaseVisitor>
+struct AW3_interrupter_visitor
+  : BaseVisitor
+{
+  // shared pointer because visitors are copied
+  std::shared_ptr<bool> should_stop = std::make_shared<bool>(false);
+
+  AW3_interrupter_visitor(const BaseVisitor base)
+    : BaseVisitor(base)
+  { }
 
-    ++sid;
+  // Only overload this one because it gives a better state of the wrap (for other visitor calls,
+  // we often get tetrahedral spikes because there are artificial gates in the queue)
+  template <typename Wrapper, typename Point>
+  void before_Steiner_point_insertion(const Wrapper& wrapper, const Point& p)
+  {
+    if(*should_stop)
+      throw Out_of_patience_exception();
+
+    return BaseVisitor::before_Steiner_point_insertion(wrapper, p);
   }
+};
 
-  template <typename AlphaWrapper, typename VertexHandle>
-  void after_Steiner_point_insertion(const AlphaWrapper&,
-                                     const VertexHandle) { }
+struct Wrapper_thread
+  : public QThread
+{
+  Q_OBJECT
 
-  template <typename AlphaWrapper>
-  void on_flood_fill_end(const AlphaWrapper&) { }
+  using Visitor = AW3_interrupter_visitor<Iterative_AW3_visualization_visitor>;
 
-  template <typename AlphaWrapper>
-  void on_alpha_wrapping_end(const AlphaWrapper&)
+public:
+  Wrapper wrapper;
+  const Oracle oracle;
+  const double alpha, offset;
+  const bool enforce_manifoldness;
+  Visitor visitor;
+
+  SMesh wrap;
+
+  QTimer* timer;
+
+public:
+  Wrapper_thread(const Oracle& oracle,
+                 const double alpha,
+                 const double offset,
+                 const bool enforce_manifoldness,
+                 Visitor visitor)
+    : wrapper(oracle),
+      alpha(alpha), offset(offset),
+      enforce_manifoldness(enforce_manifoldness),
+      visitor(visitor),
+      timer(new QTimer(this))
   {
-    if(m_iterative_wrap_item == nullptr)
-      return;
+    connect(timer, SIGNAL(timeout()),
+            this,  SLOT(emit_status()));
 
-    m_iterative_wrap_item->setName(QString("Iterative wrap #%1").arg(sid));
+    timer->start(1000);
+  }
 
-    m_iterative_wrap_item->setAlpha(255);
-    m_iterative_wrap_item->invalidateOpenGLBuffers();
-    m_iterative_wrap_item->redraw();
-    m_iterative_wrap_item->itemChanged();
+  ~Wrapper_thread()
+  {
+    delete timer;
+  }
 
-    QApplication::processEvents();
+  void run() override
+  {
+    QElapsedTimer elapsed_timer;
+    elapsed_timer.start();
 
-    if(m_do_snapshot)
+    // try-catch because the stop visitor currently uses a throw
+    try
     {
-      std::stringstream oss;
-      oss << "Wrap_iteration-" << sid << ".png" << std::ends;
-      QString filename = QString::fromStdString(oss.str().c_str());
+      wrapper(alpha, offset, wrap,
+              CGAL::parameters::do_enforce_manifoldness(enforce_manifoldness)
+                               .visitor(visitor));
 
-      CGAL::Three::Viewer_interface* viewer = CGAL::Three::Three::activeViewer();
-      viewer->saveSnapshot(filename);
+      Q_EMIT done(this);
     }
+    catch(const Out_of_patience_exception&)
+    {
+      if(enforce_manifoldness)
+        wrapper.make_manifold();
 
-    m_iterative_wrap_item->setVisible(false);
+      // extract the wrap in its current state
+      wrapper.extract_surface(wrap, CGAL::get(CGAL::vertex_point, wrap), !enforce_manifoldness);
 
-    // Refresh the view
-    QApplication::processEvents();
+      Q_EMIT interrupted(this);
+    }
+
+    std::cout << "Wrapping took " << elapsed_timer.elapsed() / 1000. << "s" << std::endl;
   }
+
+public Q_SLOTS:
+  void emit_status()
+  {
+    Q_EMIT status_report(QString("%1 vertices").arg(wrapper.triangulation().number_of_vertices()));
+  }
+
+Q_SIGNALS:
+  void interrupted(Wrapper_thread*);
+  void done(Wrapper_thread*);
+  void status_report(QString);
 };
 
 class Polyhedron_demo_alpha_wrap_3_plugin
@@ -220,17 +320,24 @@ class Polyhedron_demo_alpha_wrap_3_plugin
   using Segments = std::vector<Kernel::Segment_3>;
   using Points = std::vector<Kernel::Point_3>;
 
-  using TS_Oracle = CGAL::Alpha_wraps_3::internal::Triangle_soup_oracle<Kernel>;
-  using SS_Oracle = CGAL::Alpha_wraps_3::internal::Segment_soup_oracle<Kernel, TS_Oracle>;
-  using Oracle = CGAL::Alpha_wraps_3::internal::Point_set_oracle<Kernel, SS_Oracle>;
-
 private:
-  CGAL::Bbox_3 wrap_bbox;
-  double wrap_bbox_diag_length;
+  CGAL::Bbox_3 m_wrap_bbox;
+  double m_wrap_bbox_diag_length;
 
-  QAction* actionAlpha_wrap_3_;
+  QAction* actionAlpha_wrap_3_ = nullptr;
   Ui::alpha_wrap_3_dialog ui;
 
+  // GUI for the interruption
+  QMessageBox* m_message_box = nullptr;
+
+  // storage of intermediate wraps for iterative visualization
+  std::shared_ptr<std::vector<Kernel::Point_3> > m_iter_points;
+  std::shared_ptr<std::vector<std::vector<std::size_t> > > m_iter_faces;
+  std::shared_ptr<std::vector<CGAL::IO::Color> > m_iter_fcolors;
+  std::shared_ptr<std::vector<CGAL::IO::Color> > m_iter_vcolors;
+  Scene_polygon_soup_item* m_iterative_wrap_item = nullptr;
+  bool m_do_snapshot = false;
+
 public:
   void init(QMainWindow* mainWindow,
             CGAL::Three::Scene_interface* scene_interface,
@@ -241,26 +348,30 @@ class Polyhedron_demo_alpha_wrap_3_plugin
 
     actionAlpha_wrap_3_ = new QAction("3D Alpha Wrapping", this->mw);
     if(actionAlpha_wrap_3_)
-      connect(actionAlpha_wrap_3_, SIGNAL(triggered()), this, SLOT(on_actionAlpha_wrap_3_triggered()));
+    {
+      connect(actionAlpha_wrap_3_, SIGNAL(triggered()),
+              this,                SLOT(on_actionAlpha_wrap_3_triggered()));
+    }
   }
 
   bool applicable(QAction*) const
   {
+    if(scene->selectionIndices().empty())
+      return false;
+
     Q_FOREACH(int index, scene->selectionIndices())
     {
-      if(qobject_cast<Scene_polygon_soup_item*>(scene->item(index)))
-        return true;
-      if(qobject_cast<Scene_surface_mesh_item*>(scene->item(index)))
-        return true;
-      if(qobject_cast<Scene_polyhedron_selection_item*>(scene->item(index)))
-        return true;
-      if(qobject_cast<Scene_polylines_item*>(scene->item(index)))
-        return true;
-      if(qobject_cast<Scene_points_with_normal_item*>(scene->item(index)))
-        return true;
+      if(!qobject_cast<Scene_polygon_soup_item*>(scene->item(index)) &&
+         !qobject_cast<Scene_surface_mesh_item*>(scene->item(index)) &&
+         !qobject_cast<Scene_polyhedron_selection_item*>(scene->item(index)) &&
+         !qobject_cast<Scene_polylines_item*>(scene->item(index)) &&
+         !qobject_cast<Scene_points_with_normal_item*>(scene->item(index)))
+      {
+        return false;
+      }
     }
 
-    return false;
+    return true;
   }
 
   QList<QAction*> actions() const
@@ -275,28 +386,29 @@ class Polyhedron_demo_alpha_wrap_3_plugin
   }
 
 public Q_SLOTS:
+  // This is UI stuff
   void on_alphaValue_changed(double)
   {
     QSignalBlocker block(ui.relativeAlphaValue);
-    ui.relativeAlphaValue->setValue(wrap_bbox_diag_length / ui.alphaValue->value());
+    ui.relativeAlphaValue->setValue(m_wrap_bbox_diag_length / ui.alphaValue->value());
   }
 
   void on_relativeAlphaValue_changed(double)
   {
     QSignalBlocker block(ui.alphaValue);
-    ui.alphaValue->setValue(wrap_bbox_diag_length / ui.relativeAlphaValue->value());
+    ui.alphaValue->setValue(m_wrap_bbox_diag_length / ui.relativeAlphaValue->value());
   }
 
   void on_offsetValue_changed(double)
   {
     QSignalBlocker block(ui.relativeOffsetValue);
-    ui.relativeOffsetValue->setValue(wrap_bbox_diag_length / ui.offsetValue->value());
+    ui.relativeOffsetValue->setValue(m_wrap_bbox_diag_length / ui.offsetValue->value());
   }
 
   void on_relativeOffsetValue_changed(double)
   {
     QSignalBlocker block(ui.offsetValue);
-    ui.offsetValue->setValue(wrap_bbox_diag_length / ui.relativeOffsetValue->value());
+    ui.offsetValue->setValue(m_wrap_bbox_diag_length / ui.relativeOffsetValue->value());
   }
 
   void update_iteration_snapshot_checkbox()
@@ -304,6 +416,108 @@ public Q_SLOTS:
     ui.snapshotIterations->setCheckable(ui.visualizeIterations->isChecked());
   }
 
+  // This is for the visualization
+  void update_iterative_wrap_item(int sid)
+  {
+    if(m_iterative_wrap_item == nullptr)
+      return;
+
+    // Update the wrap item's visualization
+    m_iterative_wrap_item->load(*m_iter_points, *m_iter_faces, *m_iter_fcolors, *m_iter_vcolors);
+    m_iterative_wrap_item->setName(QString("Iterative wrap #%1").arg(sid));
+    m_iterative_wrap_item->setAlpha(255 / 2);
+    m_iterative_wrap_item->setRenderingMode(FlatPlusEdges);
+
+    m_iterative_wrap_item->invalidateOpenGLBuffers();
+    m_iterative_wrap_item->redraw();
+    m_iterative_wrap_item->itemChanged();
+
+    // Refresh the view
+    CGAL::Three::Viewer_interface* viewer = CGAL::Three::Three::activeViewer();
+    viewer->update();
+
+    CGAL::Three::Three::getWaitCondition()->wakeAll();
+
+    if(m_do_snapshot)
+    {
+      std::stringstream oss;
+      oss << "Wrap_iteration-" << sid << ".png" << std::ends;
+      QString filename = QString::fromStdString(oss.str().c_str());
+
+      viewer->saveSnapshot(filename, 1920, 1080, true /*expand*/, 2.0 /*oversampling*/);
+    }
+  }
+
+  void finish_iterative_wrap_item(int sid)
+  {
+    if(m_iterative_wrap_item == nullptr)
+      return;
+
+    if(m_do_snapshot)
+    {
+      m_iterative_wrap_item->setName(QString("Iterative wrap #%1").arg(sid));
+
+      m_iterative_wrap_item->setAlpha(255);
+      m_iterative_wrap_item->invalidateOpenGLBuffers();
+      m_iterative_wrap_item->redraw();
+      m_iterative_wrap_item->itemChanged();
+
+      // Refresh the view
+      CGAL::Three::Viewer_interface* viewer = CGAL::Three::Three::activeViewer();
+      viewer->update();
+
+      std::stringstream oss;
+      oss << "Wrap_iteration-" << sid << ".png" << std::ends;
+      QString filename = QString::fromStdString(oss.str().c_str());
+
+      viewer->saveSnapshot(filename);
+    }
+
+    CGAL_assertion(m_iterative_wrap_item);
+    scene->erase(scene->item_id(m_iterative_wrap_item));
+  }
+
+  void reset_iterative_wrap_item()
+  {
+    m_iterative_wrap_item = nullptr;
+  }
+
+  // This is for the message box and thread interruption
+  void wrapping_done(Wrapper_thread* wrapper_thread)
+  {
+    Scene_surface_mesh_item* wrap_item = new Scene_surface_mesh_item(wrapper_thread->wrap);
+    wrap_item->setName(tr("Wrap with alpha %2 offset %3").arg(wrapper_thread->alpha)
+                                                         .arg(wrapper_thread->offset));
+    wrap_item->setColor(Qt::gray);
+    const int wrap_item_id = scene->addItem(wrap_item);
+    scene->setSelectedItem(wrap_item_id);
+
+    wrapper_thread->terminate();
+    wrapper_thread->wait();
+    delete wrapper_thread;
+
+    if(m_message_box)
+    {
+      m_message_box->done(0);
+      m_message_box = nullptr;
+    }
+  }
+
+  // In case we wish to do something more one day
+  void wrapping_interrupted(Wrapper_thread* wrapper_thread)
+  {
+    wrapping_done(wrapper_thread);
+  }
+
+  void status_report(const QString& msg)
+  {
+    if(m_message_box == nullptr)
+      return;
+
+    m_message_box->setInformativeText(msg);
+  }
+
+  // Main call
   void on_actionAlpha_wrap_3_triggered()
   {
     QDialog dialog(mw);
@@ -341,7 +555,7 @@ public Q_SLOTS:
           boost::graph_traits<SMesh>::halfedge_descriptor h = halfedge(f, *pMesh);
           if(!is_triangle(h, *pMesh))
           {
-            print_message("Warning: non-triangular face in input");
+            print_message("Warning: a non-triangular face in input has been ignored");
             continue;
           }
 
@@ -349,7 +563,7 @@ public Q_SLOTS:
                                  get(vpm, target(next(h, *pMesh), *pMesh)),
                                  get(vpm, source(h, *pMesh)));
 
-          wrap_bbox += triangles.back().bbox();
+          m_wrap_bbox += triangles.back().bbox();
         }
 
         continue;
@@ -365,7 +579,7 @@ public Q_SLOTS:
         {
           if(p.size() != 3)
           {
-            print_message("Warning: non-triangular face in input");
+            print_message("Warning: a non-triangular face in input has been ignored");
             continue;
           }
 
@@ -373,7 +587,7 @@ public Q_SLOTS:
                                  soup_item->points()[p[1]],
                                  soup_item->points()[p[2]]);
 
-          wrap_bbox += triangles.back().bbox();
+          m_wrap_bbox += triangles.back().bbox();
         }
 
         continue;
@@ -393,7 +607,7 @@ public Q_SLOTS:
           boost::graph_traits<SMesh>::halfedge_descriptor h = halfedge(f, *pMesh);
           if(!is_triangle(h, *pMesh))
           {
-            print_message("Warning: non-triangular face in input");
+            print_message("Warning: a non-triangular face in input has been ignored");
             continue;
           }
 
@@ -401,7 +615,7 @@ public Q_SLOTS:
                                  get(vpm, target(next(h, *pMesh), *pMesh)),
                                  get(vpm, source(h, *pMesh)));
 
-          wrap_bbox += triangles.back().bbox();
+          m_wrap_bbox += triangles.back().bbox();
         }
 
         segments.reserve(segments.size() + selection_item->selected_edges.size());
@@ -410,7 +624,7 @@ public Q_SLOTS:
           segments.emplace_back(get(vpm, target(halfedge(e, *pMesh), *pMesh)),
                                 get(vpm, target(opposite(halfedge(e, *pMesh), *pMesh), *pMesh)));
 
-          wrap_bbox += segments.back().bbox();
+          m_wrap_bbox += segments.back().bbox();
         }
 
         points.reserve(points.size() + selection_item->selected_vertices.size());
@@ -418,7 +632,7 @@ public Q_SLOTS:
         {
           points.push_back(get(vpm, v));
 
-          wrap_bbox += points.back().bbox();
+          m_wrap_bbox += points.back().bbox();
         }
 
         continue;
@@ -460,14 +674,14 @@ public Q_SLOTS:
     // The relative value uses the bbox of the full scene and not that of selected items to wrap
     // This is intentional, both because it's tedious to make it otherwise, and because it seems
     // to be simpler to compare between "all wrapped" / "some wrapped"
-    wrap_bbox_diag_length = std::sqrt(CGAL::square(wrap_bbox.xmax() - wrap_bbox.xmin()) +
-                                      CGAL::square(wrap_bbox.ymax() - wrap_bbox.ymin()) +
-                                      CGAL::square(wrap_bbox.zmax() - wrap_bbox.zmin()));
+    m_wrap_bbox_diag_length = std::sqrt(CGAL::square(m_wrap_bbox.xmax() - m_wrap_bbox.xmin()) +
+                                        CGAL::square(m_wrap_bbox.ymax() - m_wrap_bbox.ymin()) +
+                                        CGAL::square(m_wrap_bbox.zmax() - m_wrap_bbox.zmin()));
 
     ui.relativeAlphaValue->setValue(20.);
     ui.relativeOffsetValue->setValue(600.);
-    ui.alphaValue->setValue(wrap_bbox_diag_length / ui.relativeAlphaValue->value());
-    ui.offsetValue->setValue(wrap_bbox_diag_length / ui.relativeOffsetValue->value());
+    ui.alphaValue->setValue(m_wrap_bbox_diag_length / ui.relativeAlphaValue->value());
+    ui.offsetValue->setValue(m_wrap_bbox_diag_length / ui.relativeOffsetValue->value());
 
     // EXECUTION
     int i = dialog.exec();
@@ -476,16 +690,6 @@ public Q_SLOTS:
 
     QApplication::setOverrideCursor(Qt::WaitCursor);
 
-    Q_FOREACH(int index, this->scene->selectionIndices())
-    {
-      Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(this->scene->item(index));
-      if(sm_item != nullptr)
-        sm_item->setRenderingMode(Flat);
-      Scene_polygon_soup_item* soup_item = qobject_cast<Scene_polygon_soup_item*>(scene->item(index));
-      if(soup_item != nullptr)
-        soup_item->setRenderingMode(Flat);
-    }
-
     const bool wrap_triangles = ui.wrapTriangles->isChecked();
     const bool wrap_segments = ui.wrapSegments->isChecked();
     const bool wrap_points = ui.wrapPoints->isChecked();
@@ -495,9 +699,12 @@ public Q_SLOTS:
 
     const bool enforce_manifoldness = ui.runManifoldness->isChecked();
     const bool visualize_iterations = ui.visualizeIterations->isChecked();
-    const bool do_snapshot_iterations = ui.snapshotIterations->isChecked();
+    m_do_snapshot = ui.snapshotIterations->isChecked();
+
+    const bool use_message_box = ui.enableMessageBox->isChecked();
 
-    std::cout << "do wrap edges/faces: " << wrap_segments << " " << wrap_triangles << std::endl;
+    std::cout << "Wrapping edges? " << std::boolalpha << wrap_segments << std::endl;
+    std::cout << "Wrapping faces? " << std::boolalpha << wrap_triangles << std::endl;
 
     if(!wrap_triangles)
     {
@@ -554,22 +761,91 @@ public Q_SLOTS:
       return;
     }
 
-    // Oracles are now set up, main function call
-    CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle> aw3(oracle);
+    // Switch from 'wait' to 'busy'
+    QApplication::restoreOverrideCursor();
+    QApplication::setOverrideCursor(Qt::BusyCursor);
+
+    Q_FOREACH(int index, this->scene->selectionIndices())
+    {
+      Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(this->scene->item(index));
+      if(sm_item != nullptr)
+        sm_item->setRenderingMode(Flat);
+      Scene_polygon_soup_item* soup_item = qobject_cast<Scene_polygon_soup_item*>(scene->item(index));
+      if(soup_item != nullptr)
+        soup_item->setRenderingMode(Flat);
+    }
+
+    if(visualize_iterations)
+    {
+      m_iterative_wrap_item = new Scene_polygon_soup_item();
+      m_iterative_wrap_item->setName(QString("Iterative wrap"));
+      const int iterative_wrap_item_id = scene->addItem(m_iterative_wrap_item);
+      scene->setSelectedItem(iterative_wrap_item_id);
+
+      // Deal with independent (e.g. manual from the main window) destruction of the iterative item
+      connect(m_iterative_wrap_item, SIGNAL(aboutToBeDestroyed()),
+              this, SLOT(reset_iterative_wrap_item()));
+    }
+
+    // Visitors
+    m_iter_points = std::make_shared<std::vector<Kernel::Point_3> >();
+    m_iter_faces = std::make_shared<std::vector<std::vector<std::size_t> > >();
+    m_iter_fcolors = std::make_shared<std::vector<CGAL::IO::Color> >();
+    m_iter_vcolors = std::make_shared<std::vector<CGAL::IO::Color> >();
+    std::shared_ptr<Iterative_update_emiter> emiter = std::make_shared<Iterative_update_emiter>();
+    Iterative_AW3_visualization_visitor visu_visitor(visualize_iterations, m_iter_points, m_iter_faces, m_iter_fcolors, m_iter_vcolors, emiter);
+    AW3_interrupter_visitor<Iterative_AW3_visualization_visitor> visitor(visu_visitor);
+
+    connect(emiter.get(), SIGNAL(new_iteration(int)),
+            this,         SLOT(update_iterative_wrap_item(int)));
+    connect(emiter.get(), SIGNAL(last_iteration(int)),
+            this,         SLOT(finish_iterative_wrap_item(int)));
+
+    Wrapper_thread* wrapper_thread = new Wrapper_thread(oracle, alpha, offset, enforce_manifoldness, visitor);
+    if(wrapper_thread == nullptr)
+    {
+      QMessageBox::critical(mw, tr(""), tr("ERROR: failed to create thread"));
+      return;
+    }
 
-    Iterative_AW3_visualization_visitor visitor(scene,
-                                                visualize_iterations,
-                                                do_snapshot_iterations);
+    // Connect main thread to wrapping thread
+    QObject::connect(wrapper_thread, SIGNAL(done(Wrapper_thread*)),
+                     this,           SLOT(wrapping_done(Wrapper_thread*)));
+    QObject::connect(wrapper_thread, SIGNAL(interrupted(Wrapper_thread*)),
+                     this,           SLOT(wrapping_interrupted(Wrapper_thread*)));
+    QObject::connect(wrapper_thread, SIGNAL(status_report(QString)),
+                     this,           SLOT(status_report(QString)));
+
+    // Launch thread
+    CGAL::Three::Three::getMutex()->lock();
+    CGAL::Three::Three::isLocked() = true;
+    CGAL::Three::Three::getMutex()->unlock();
+
+    // Create message box with stop button
+    if(use_message_box)
+    {
+      m_message_box = new QMessageBox(QMessageBox::NoIcon,
+                                     "Wrapping",
+                                     "Wrapping in progress...",
+                                     QMessageBox::Cancel,
+                                     mw);
+      m_message_box->setDefaultButton(QMessageBox::Cancel);
+      QAbstractButton* cancelButton = m_message_box->button(QMessageBox::Cancel);
+      cancelButton->setText(tr("Stop"));
+
+      // Connect the message box to the thread
+      connect(cancelButton, &QAbstractButton::clicked,
+              this, [wrapper_thread]() { *(wrapper_thread->visitor.should_stop) = true; });
+
+      m_message_box->open();
+    }
 
-    SMesh wrap;
-    aw3(alpha, offset, wrap,
-        CGAL::parameters::do_enforce_manifoldness(enforce_manifoldness)
-                         .visitor(visitor));
+    // Actual start
+    wrapper_thread->start();
 
-    Scene_surface_mesh_item* wrap_item = new Scene_surface_mesh_item(wrap);
-    wrap_item->setName(tr("Wrap with alpha %2 offset %3").arg(alpha).arg(offset));
-    wrap_item->setColor(Qt::gray);
-    scene->addItem(wrap_item);
+    CGAL::Three::Three::getMutex()->lock();
+    CGAL::Three::Three::isLocked() = false;
+    CGAL::Three::Three::getMutex()->unlock();
 
     QApplication::restoreOverrideCursor();
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/alpha_wrap_3_dialog.ui b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/alpha_wrap_3_dialog.ui
index cc6cce927223..c02ccc3b17d3 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/alpha_wrap_3_dialog.ui
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/alpha_wrap_3_dialog.ui
@@ -9,7 +9,7 @@
    <rect>
     <x>0</x>
     <y>0</y>
-    <width>646</width>
+    <width>839</width>
     <height>673</height>
    </rect>
   </property>
@@ -17,47 +17,57 @@
    <string>3D Alpha Wrapping</string>
   </property>
   <layout class="QGridLayout" name="gridLayout_2">
+   <item row="3" column="0">
+    <widget class="QDialogButtonBox" name="buttonBox">
+     <property name="orientation">
+      <enum>Qt::Horizontal</enum>
+     </property>
+     <property name="standardButtons">
+      <set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
+     </property>
+    </widget>
+   </item>
+   <item row="2" column="0">
+    <spacer name="verticalSpacer_6">
+     <property name="orientation">
+      <enum>Qt::Vertical</enum>
+     </property>
+     <property name="sizeHint" stdset="0">
+      <size>
+       <width>20</width>
+       <height>40</height>
+      </size>
+     </property>
+    </spacer>
+   </item>
    <item row="1" column="0">
     <widget class="QGroupBox" name="groupBox">
      <property name="title">
       <string>3D Alpha Wrapping</string>
      </property>
      <layout class="QGridLayout" name="gridLayout">
-      <item row="6" column="0">
-       <widget class="QLabel" name="offsetValue_Label">
-        <property name="text">
-         <string>Offset value (absolute):</string>
-        </property>
-       </widget>
-      </item>
-      <item row="8" column="0">
-       <widget class="QLabel" name="relativeOffsetValue_Label">
+      <item row="28" column="1" alignment="Qt::AlignRight">
+       <widget class="QCheckBox" name="visualizeIterations">
         <property name="text">
-         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Offset value (relative):&lt;br/&gt;&lt;span style=&quot; font-size:9pt;&quot;&gt;As ratio of the length of the bbox's diagonal&lt;br/&gt;(i.e., value &lt;/span&gt;&lt;span style=&quot; font-size:9pt; font-style:italic;&quot;&gt;x &lt;/span&gt;&lt;span style=&quot; font-size:9pt;&quot;&gt;means &lt;/span&gt;&lt;span style=&quot; font-size:9pt; font-style:italic;&quot;&gt;offset := bbox_diag_l / x)&lt;/span&gt;&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
+         <string/>
         </property>
        </widget>
       </item>
-      <item row="0" column="1">
-       <widget class="QDoubleSpinBox" name="alphaValue">
-        <property name="decimals">
-         <number>10</number>
-        </property>
-        <property name="minimum">
-         <double>0.000000000000000</double>
-        </property>
-        <property name="maximum">
-         <double>100000000.000000000000000</double>
+      <item row="23" column="0">
+       <widget class="QLabel" name="runManifoldness_Label">
+        <property name="enabled">
+         <bool>true</bool>
         </property>
-        <property name="singleStep">
-         <double>1.000000000000000</double>
+        <property name="text">
+         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Enforce 2-manifold output&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
         </property>
-        <property name="value">
-         <double>0.000000000000000</double>
+        <property name="alignment">
+         <set>Qt::AlignLeading|Qt::AlignLeft|Qt::AlignVCenter</set>
         </property>
        </widget>
       </item>
-      <item row="23" column="0">
-       <spacer name="verticalSpacer_4">
+      <item row="24" column="1">
+       <spacer name="verticalSpacer">
         <property name="orientation">
          <enum>Qt::Vertical</enum>
         </property>
@@ -69,41 +79,8 @@
         </property>
        </spacer>
       </item>
-      <item row="1" column="1">
-       <widget class="QDoubleSpinBox" name="relativeAlphaValue">
-        <property name="decimals">
-         <number>10</number>
-        </property>
-        <property name="minimum">
-         <double>0.000000000000000</double>
-        </property>
-        <property name="maximum">
-         <double>10000000.000000000000000</double>
-        </property>
-        <property name="singleStep">
-         <double>1.000000000000000</double>
-        </property>
-        <property name="value">
-         <double>0.000000000000000</double>
-        </property>
-       </widget>
-      </item>
-      <item row="27" column="0">
-       <widget class="QLabel" name="snapshotIterations_Label">
-        <property name="text">
-         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Snapshot iterations&lt;br/&gt;&lt;span style=&quot; font-size:9pt;&quot;&gt;For each iteration, save a snapshot of the viewer &lt;br/&gt;to a file named &lt;/span&gt;&lt;span style=&quot; font-size:9pt; font-style:italic;&quot;&gt;Wrap-iteration_i.png&lt;/span&gt;&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
-        </property>
-       </widget>
-      </item>
-      <item row="20" column="0" colspan="2">
-       <widget class="Line" name="line_2">
-        <property name="orientation">
-         <enum>Qt::Horizontal</enum>
-        </property>
-       </widget>
-      </item>
-      <item row="25" column="0">
-       <spacer name="verticalSpacer_7">
+      <item row="26" column="1">
+       <spacer name="verticalSpacer_4">
         <property name="orientation">
          <enum>Qt::Vertical</enum>
         </property>
@@ -115,22 +92,22 @@
         </property>
        </spacer>
       </item>
-      <item row="26" column="0">
-       <widget class="QLabel" name="visualizeIterations_Label">
+      <item row="11" column="0">
+       <widget class="QLabel" name="wrapTriangles_Label">
         <property name="text">
-         <string>Visualize iterations</string>
+         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Wrap faces / triangles&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
         </property>
        </widget>
       </item>
-      <item row="0" column="0">
-       <widget class="QLabel" name="alphaValue_Label">
+      <item row="0" column="1">
+       <widget class="QLabel" name="relativeOffsetValue_Label">
         <property name="text">
-         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Alpha value (absolute):&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
+         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p align=&quot;center&quot;&gt;Absolute value&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
         </property>
        </widget>
       </item>
-      <item row="12" column="1">
-       <widget class="QCheckBox" name="wrapTriangles">
+      <item row="12" column="1" alignment="Qt::AlignRight">
+       <widget class="QCheckBox" name="wrapSegments">
         <property name="text">
          <string/>
         </property>
@@ -139,8 +116,15 @@
         </property>
        </widget>
       </item>
-      <item row="5" column="0">
-       <spacer name="verticalSpacer">
+      <item row="20" column="0" colspan="3">
+       <widget class="Line" name="line">
+        <property name="orientation">
+         <enum>Qt::Horizontal</enum>
+        </property>
+       </widget>
+      </item>
+      <item row="16" column="1">
+       <spacer name="verticalSpacer_8">
         <property name="orientation">
          <enum>Qt::Vertical</enum>
         </property>
@@ -152,50 +136,79 @@
         </property>
        </spacer>
       </item>
-      <item row="22" column="1">
-       <widget class="QCheckBox" name="runManifoldness">
+      <item row="1" column="2">
+       <widget class="QDoubleSpinBox" name="relativeAlphaValue">
+        <property name="decimals">
+         <number>7</number>
+        </property>
+        <property name="minimum">
+         <double>0.000000000000000</double>
+        </property>
+        <property name="maximum">
+         <double>10000000.000000000000000</double>
+        </property>
+        <property name="singleStep">
+         <double>1.000000000000000</double>
+        </property>
+        <property name="value">
+         <double>0.000000000000000</double>
+        </property>
+       </widget>
+      </item>
+      <item row="0" column="2">
+       <widget class="QLabel" name="relativeAlphaValue_Label">
         <property name="text">
-         <string/>
+         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p align=&quot;center&quot;&gt;Relative value&lt;br/&gt;&lt;span style=&quot; font-size:9pt;&quot;&gt;As the ratio of the length of the bbox's diagonal&lt;br/&gt;(i.e., a value &lt;/span&gt;&lt;span style=&quot; font-size:9pt; font-style:italic;&quot;&gt;x &lt;/span&gt;&lt;span style=&quot; font-size:9pt;&quot;&gt;means value&lt;/span&gt;&lt;span style=&quot; font-size:9pt; font-style:italic;&quot;&gt; := bbox_diag_l / x)&lt;/span&gt;&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
         </property>
-        <property name="checked">
-         <bool>true</bool>
+        <property name="alignment">
+         <set>Qt::AlignLeading|Qt::AlignLeft|Qt::AlignVCenter</set>
         </property>
        </widget>
       </item>
-      <item row="10" column="0" colspan="2">
-       <widget class="Line" name="line">
+      <item row="28" column="0">
+       <widget class="QLabel" name="visualizeIterations_Label">
+        <property name="text">
+         <string>Visualize iterations</string>
+        </property>
+       </widget>
+      </item>
+      <item row="4" column="0" colspan="3">
+       <widget class="Line" name="line_2">
         <property name="orientation">
          <enum>Qt::Horizontal</enum>
         </property>
        </widget>
       </item>
-      <item row="13" column="1">
-       <widget class="QCheckBox" name="wrapSegments">
+      <item row="12" column="0">
+       <widget class="QLabel" name="wrapSegments_Label">
         <property name="text">
-         <string/>
-        </property>
-        <property name="checked">
-         <bool>true</bool>
+         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Wrap edges / segments&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
         </property>
        </widget>
       </item>
-      <item row="11" column="0">
-       <spacer name="verticalSpacer_3">
-        <property name="orientation">
-         <enum>Qt::Vertical</enum>
+      <item row="2" column="1">
+       <widget class="QDoubleSpinBox" name="offsetValue">
+        <property name="decimals">
+         <number>7</number>
         </property>
-        <property name="sizeHint" stdset="0">
-         <size>
-          <width>20</width>
-          <height>40</height>
-         </size>
+        <property name="minimum">
+         <double>0.000000000000000</double>
         </property>
-       </spacer>
+        <property name="maximum">
+         <double>100000000.000000000000000</double>
+        </property>
+        <property name="singleStep">
+         <double>1.000000000000000</double>
+        </property>
+        <property name="value">
+         <double>0.000000000000000</double>
+        </property>
+       </widget>
       </item>
-      <item row="8" column="1">
+      <item row="2" column="2">
        <widget class="QDoubleSpinBox" name="relativeOffsetValue">
         <property name="decimals">
-         <number>10</number>
+         <number>7</number>
         </property>
         <property name="minimum">
          <double>0.000000000000000</double>
@@ -211,17 +224,44 @@
         </property>
        </widget>
       </item>
-      <item row="27" column="1">
-       <widget class="QCheckBox" name="snapshotIterations">
+      <item row="11" column="1" alignment="Qt::AlignRight">
+       <widget class="QCheckBox" name="wrapTriangles">
         <property name="text">
          <string/>
         </property>
-        <property name="checkable">
-         <bool>false</bool>
+        <property name="checked">
+         <bool>true</bool>
+        </property>
+       </widget>
+      </item>
+      <item row="25" column="0" colspan="3">
+       <widget class="Line" name="line_3">
+        <property name="orientation">
+         <enum>Qt::Horizontal</enum>
+        </property>
+       </widget>
+      </item>
+      <item row="2" column="0">
+       <widget class="QLabel" name="offsetValue_Label">
+        <property name="text">
+         <string>Offset value:</string>
         </property>
        </widget>
       </item>
-      <item row="21" column="0">
+      <item row="3" column="1">
+       <spacer name="verticalSpacer_3">
+        <property name="orientation">
+         <enum>Qt::Vertical</enum>
+        </property>
+        <property name="sizeHint" stdset="0">
+         <size>
+          <width>20</width>
+          <height>40</height>
+         </size>
+        </property>
+       </spacer>
+      </item>
+      <item row="22" column="1">
        <spacer name="verticalSpacer_2">
         <property name="orientation">
          <enum>Qt::Vertical</enum>
@@ -234,49 +274,32 @@
         </property>
        </spacer>
       </item>
-      <item row="16" column="0">
-       <widget class="QLabel" name="label">
+      <item row="15" column="0">
+       <widget class="QLabel" name="wrapPoints_Label">
         <property name="text">
          <string>Wrap points / vertices</string>
         </property>
        </widget>
       </item>
-      <item row="24" column="0" colspan="2">
-       <widget class="Line" name="line_4">
-        <property name="orientation">
-         <enum>Qt::Horizontal</enum>
-        </property>
-       </widget>
-      </item>
-      <item row="22" column="0">
-       <widget class="QLabel" name="runManifoldness_Label">
-        <property name="enabled">
-         <bool>true</bool>
-        </property>
+      <item row="1" column="0">
+       <widget class="QLabel" name="alphaValue_Label">
         <property name="text">
-         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Enforce 2-manifold output&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
-        </property>
-        <property name="alignment">
-         <set>Qt::AlignLeading|Qt::AlignLeft|Qt::AlignVCenter</set>
+         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Alpha value:&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
         </property>
        </widget>
       </item>
-      <item row="26" column="1">
-       <widget class="QCheckBox" name="visualizeIterations">
+      <item row="15" column="1" alignment="Qt::AlignRight">
+       <widget class="QCheckBox" name="wrapPoints">
         <property name="text">
          <string/>
         </property>
-       </widget>
-      </item>
-      <item row="12" column="0">
-       <widget class="QLabel" name="wrapTriangles_Label">
-        <property name="text">
-         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Wrap faces / triangles&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
+        <property name="checked">
+         <bool>true</bool>
         </property>
        </widget>
       </item>
-      <item row="16" column="1">
-       <widget class="QCheckBox" name="wrapPoints">
+      <item row="23" column="1" alignment="Qt::AlignRight">
+       <widget class="QCheckBox" name="runManifoldness">
         <property name="text">
          <string/>
         </property>
@@ -285,10 +308,10 @@
         </property>
        </widget>
       </item>
-      <item row="6" column="1">
-       <widget class="QDoubleSpinBox" name="offsetValue">
+      <item row="1" column="1">
+       <widget class="QDoubleSpinBox" name="alphaValue">
         <property name="decimals">
-         <number>10</number>
+         <number>7</number>
         </property>
         <property name="minimum">
          <double>0.000000000000000</double>
@@ -304,87 +327,54 @@
         </property>
        </widget>
       </item>
-      <item row="1" column="0">
-       <widget class="QLabel" name="relativeAlphaValue_Label">
+      <item row="29" column="0">
+       <widget class="QLabel" name="snapshotIterations_Label">
         <property name="text">
-         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Alpha value (relative):&lt;br/&gt;&lt;span style=&quot; font-size:9pt;&quot;&gt;As the ratio of the length of the bbox's diagonal&lt;br/&gt;(i.e., value &lt;/span&gt;&lt;span style=&quot; font-size:9pt; font-style:italic;&quot;&gt;x &lt;/span&gt;&lt;span style=&quot; font-size:9pt;&quot;&gt;means alpha&lt;/span&gt;&lt;span style=&quot; font-size:9pt; font-style:italic;&quot;&gt; := bbox_diag_l / x)&lt;/span&gt;&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
-        </property>
-        <property name="alignment">
-         <set>Qt::AlignLeading|Qt::AlignLeft|Qt::AlignVCenter</set>
+         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Snapshot iterations&lt;br/&gt;&lt;span style=&quot; font-size:9pt;&quot;&gt;For each iteration, save a snapshot of the viewer &lt;br/&gt;to a file named &lt;/span&gt;&lt;span style=&quot; font-size:9pt; font-style:italic;&quot;&gt;Wrap-iteration_i.png&lt;/span&gt;&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
         </property>
        </widget>
       </item>
-      <item row="9" column="0">
-       <spacer name="verticalSpacer_5">
-        <property name="orientation">
-         <enum>Qt::Vertical</enum>
-        </property>
-        <property name="sizeHint" stdset="0">
-         <size>
-          <width>20</width>
-          <height>40</height>
-         </size>
+      <item row="30" column="0">
+       <widget class="QLabel" name="enableMessageBox_Label">
+        <property name="text">
+         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Enable interruption &lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
         </property>
-       </spacer>
+       </widget>
       </item>
-      <item row="13" column="0">
-       <widget class="QLabel" name="wrapSegments_Label">
+      <item row="30" column="1" alignment="Qt::AlignRight">
+       <widget class="QCheckBox" name="enableMessageBox">
         <property name="text">
-         <string>&lt;html&gt;&lt;head/&gt;&lt;body&gt;&lt;p&gt;Wrap edges / segments&lt;/p&gt;&lt;/body&gt;&lt;/html&gt;</string>
+         <string/>
+        </property>
+        <property name="checked">
+         <bool>true</bool>
         </property>
        </widget>
       </item>
-      <item row="17" column="0">
-       <spacer name="verticalSpacer_8">
-        <property name="orientation">
-         <enum>Qt::Vertical</enum>
+      <item row="29" column="1" alignment="Qt::AlignRight">
+       <widget class="QCheckBox" name="snapshotIterations">
+        <property name="text">
+         <string/>
         </property>
-        <property name="sizeHint" stdset="0">
-         <size>
-          <width>20</width>
-          <height>40</height>
-         </size>
+        <property name="checkable">
+         <bool>false</bool>
         </property>
-       </spacer>
+        <property name="checked">
+         <bool>false</bool>
+        </property>
+       </widget>
       </item>
      </layout>
     </widget>
    </item>
-   <item row="3" column="0">
-    <widget class="QDialogButtonBox" name="buttonBox">
-     <property name="orientation">
-      <enum>Qt::Horizontal</enum>
-     </property>
-     <property name="standardButtons">
-      <set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
-     </property>
-    </widget>
-   </item>
-   <item row="2" column="0">
-    <spacer name="verticalSpacer_6">
-     <property name="orientation">
-      <enum>Qt::Vertical</enum>
-     </property>
-     <property name="sizeHint" stdset="0">
-      <size>
-       <width>20</width>
-       <height>40</height>
-      </size>
-     </property>
-    </spacer>
-   </item>
   </layout>
  </widget>
  <tabstops>
   <tabstop>alphaValue</tabstop>
-  <tabstop>relativeAlphaValue</tabstop>
-  <tabstop>offsetValue</tabstop>
-  <tabstop>relativeOffsetValue</tabstop>
   <tabstop>wrapTriangles</tabstop>
   <tabstop>wrapSegments</tabstop>
   <tabstop>runManifoldness</tabstop>
   <tabstop>visualizeIterations</tabstop>
-  <tabstop>snapshotIterations</tabstop>
  </tabstops>
  <resources/>
  <connections>

From 0551cefa5d315c4071dec5c1118bceaaa6bdfcdd Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 7 Jun 2023 15:02:10 +0200
Subject: [PATCH 0331/1398] add more test from errors while testing thingi10k
 models

---
 .../triangle_3_triangle_3_intersection.cpp    | 59 +++++++++++++++++++
 1 file changed, 59 insertions(+)

diff --git a/Intersections_3/test/Intersections_3/triangle_3_triangle_3_intersection.cpp b/Intersections_3/test/Intersections_3/triangle_3_triangle_3_intersection.cpp
index 0098bcd01422..f0875a55ee8b 100644
--- a/Intersections_3/test/Intersections_3/triangle_3_triangle_3_intersection.cpp
+++ b/Intersections_3/test/Intersections_3/triangle_3_triangle_3_intersection.cpp
@@ -96,6 +96,13 @@ void test_coplanar_triangles(){
   assert(CGAL::object_cast<Triangle>(&obj)!=nullptr);
   obj=CGAL::intersection(t2,t1);
   assert(CGAL::object_cast<Triangle>(&obj)!=nullptr);
+  // TK10 case C'
+  t1=Triangle(Point(88.7921, 89.0007, 1.25), Point(88.1912, 88.3997, 1.25), Point(89.8224, 90.031, 1.25));
+  t2=Triangle(Point(88.0497, 88.2583, 1.25), Point(82.9292, 81.8747, 1.25), Point(91.1726, 91.3812, 1.25));
+  obj=CGAL::intersection(t1,t2);
+  assert(CGAL::object_cast<Triangle>(&obj)!=nullptr);
+  obj=CGAL::intersection(t2,t1);
+  assert(CGAL::object_cast<Triangle>(&obj)!=nullptr);
 //Intersection is a point
   //edges  are collinear, one vertex in common
   t1=Triangle( Point(0,0,0),Point(0,1,0),Point(1,0,0) );
@@ -153,6 +160,13 @@ void test_coplanar_triangles(){
   assert(CGAL::object_cast<Segment>(&obj)!=nullptr);
   obj=CGAL::intersection(t2,t1);
   assert(CGAL::object_cast<Segment>(&obj)!=nullptr);
+  // TK10 case D
+  t1=Triangle(Point(-34.893700000000003, -16.0351, 3.1334899999999998e-12), Point(-34.893700000000003, -18.5351, 3.1334899999999998e-12), Point(-42.393700000000003, -16.0351, 3.1334899999999998e-12));
+  t2=Triangle(Point(-34.893700000000003, -32.0351, 3.1334899999999998e-12), Point(-34.893700000000003, -9.7851400000000002, 3.1334899999999998e-12), Point(-31.643699999999999, -17.201799999999999, 3.1334899999999998e-12));
+  obj=CGAL::intersection(t1,t2);
+  assert(CGAL::object_cast<Segment>(&obj)!=nullptr);
+  obj=CGAL::intersection(t2,t1);
+  assert(CGAL::object_cast<Segment>(&obj)!=nullptr);
 //Intersection is a polygon
   //David's star
   t1=Triangle( Point(0,0,0),Point(1,0,0),Point(0.5,1.5,0) );
@@ -181,6 +195,51 @@ void test_coplanar_triangles(){
   obj=CGAL::intersection(t2,t1);
   assert(CGAL::object_cast<Polygon2>(&obj)!=nullptr);
   assert(CGAL::object_cast<Polygon2>(&obj)->size()==4);
+  // TK10 case A
+  t1=Triangle(Point(3.74861, 12.4822, 14.0112), Point(5.40582, 12.4822, 15.6895), Point(5.37748, 12.4822, 15.7206));
+  t2=Triangle(Point(5.49972, 12.4822, 13.491), Point(5.27627, 12.4822, 15.8106), Point(5.32119, 12.4822, 15.8126));
+  obj=CGAL::intersection(t1,t2);
+  assert(CGAL::object_cast<Polygon2>(&obj)!=nullptr);
+  assert(CGAL::object_cast<Polygon2>(&obj)->size()==4);
+  obj=CGAL::intersection(t2,t1);
+  assert(CGAL::object_cast<Polygon2>(&obj)!=nullptr);
+  assert(CGAL::object_cast<Polygon2>(&obj)->size()==4);
+  // TK10 case C
+  t1=Triangle(Point(5, -94.6659, 3.85175), Point(5, -94.5682, 3.08638), Point(5, -94.8182, 3.08638));
+  t2=Triangle(Point(5, -94.4317, 3.76399), Point(5, -97.6182, 3.08638), Point(5, -94.5659, 2.99682));
+  obj=CGAL::intersection(t1,t2);
+  assert(CGAL::object_cast<Polygon2>(&obj)!=nullptr);
+  assert(CGAL::object_cast<Polygon2>(&obj)->size()==4);
+  obj=CGAL::intersection(t2,t1);
+  assert(CGAL::object_cast<Polygon2>(&obj)!=nullptr);
+  assert(CGAL::object_cast<Polygon2>(&obj)->size()==4);
+  // TK10 case E
+  t1=Triangle(Point(-955.858, -45.032, -0.016), Point(-955.856, -45.032, -0.004), Point(-955.856, -45.032, -0.002));
+  t2=Triangle(Point(-955.856, -45.032, 0.006), Point(-955.854, -45.032, -0.002), Point(-955.876, -45.032, -0.034));
+  obj=CGAL::intersection(t1,t2);
+  assert(CGAL::object_cast<Polygon2>(&obj)!=nullptr);
+  assert(CGAL::object_cast<Polygon2>(&obj)->size()==4);
+  obj=CGAL::intersection(t2,t1);
+  assert(CGAL::object_cast<Polygon2>(&obj)!=nullptr);
+  assert(CGAL::object_cast<Polygon2>(&obj)->size()==4);
+  // TK10 case F
+  t1=Triangle(Point(141.172, 20.576, 155.764), Point(141.172, 20.588, 155.766), Point(141.172, 20.59, 155.766));
+  t2=Triangle(Point(141.172, 20.602, 155.768), Point(141.172, 20.594, 155.766), Point(141.172, 20.574, 155.764));
+  obj=CGAL::intersection(t1,t2);
+  assert(CGAL::object_cast<Polygon2>(&obj)!=nullptr);
+  assert(CGAL::object_cast<Polygon2>(&obj)->size()==4);
+  obj=CGAL::intersection(t2,t1);
+  assert(CGAL::object_cast<Polygon2>(&obj)!=nullptr);
+  assert(CGAL::object_cast<Polygon2>(&obj)->size()==4);
+  // TK10 case D
+  t1=Triangle(Point(152.864, 126.324, 0.950001), Point(152.77, 126.483, 0.950001), Point(153.072, 125.973, 0.950001));
+  t2=Triangle(Point(153.322, 125.551, 0.950001), Point(152.218, 127.415, 0.950001), Point(153.66, 124.768, 0.950001));
+  obj=CGAL::intersection(t1,t2);
+  assert(CGAL::object_cast<Polygon2>(&obj)!=nullptr);
+  assert(CGAL::object_cast<Polygon2>(&obj)->size()==4);
+  obj=CGAL::intersection(t2,t1);
+  assert(CGAL::object_cast<Polygon2>(&obj)!=nullptr);
+  assert(CGAL::object_cast<Polygon2>(&obj)->size()==4);
 //Intersection is empty
   t1=Triangle( Point(0,0,0),Point(0,1,0),Point(1,0,0) );
   t2=Triangle( Point(-0.1,-0.1,0),Point(-0.1,-0.9,0),Point(-1,-0.1,0) );

From 48712f7862f02ce63558de039c603e0d018ae31d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 8 Jun 2023 14:04:55 +0200
Subject: [PATCH 0332/1398] don't use c++17 features

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 18bbfa2ce40f..6b664ec360bc 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1128,7 +1128,7 @@ void autorefine_soup_output(const PointRange& input_points,
     Sequential_tag
   > ::type Concurrency_tag;
 
-  constexpr bool parallel_execution = std::is_same_v<Parallel_tag, Concurrency_tag>;
+  constexpr bool parallel_execution = std::is_same<Parallel_tag, Concurrency_tag>::value;
 
 #ifndef CGAL_LINKED_WITH_TBB
   CGAL_static_assertion_msg (parallel_execution,

From 003bf47781ef69354d9cd388f2fce00168c2e762 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 8 Jun 2023 14:05:09 +0200
Subject: [PATCH 0333/1398] move alpha computation into a functor

---
 .../Triangle_3_Triangle_3_intersection.h      | 52 +++++--------------
 .../include/CGAL/Kernel/function_objects.h    | 31 +++++++++++
 .../include/CGAL/Kernel/interface_macros.h    |  2 +
 .../Polygon_mesh_processing/autorefinement.h  |  6 +--
 4 files changed, 50 insertions(+), 41 deletions(-)

diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index 99dcd24ff457..68166f18c6e2 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -34,28 +34,6 @@ namespace CGAL {
 namespace Intersections {
 namespace internal{
 
-//TODO: move into a functor
-template <class K>
-typename K::FT
-coplanar_segment_segment_alpha_intersection(const typename K::Point_3& p1, const typename K::Point_3& p2, // segment 1
-                                            const typename K::Point_3& p3, const typename K::Point_3& p4, // segment 2
-                                            const K& k)
-{
-  const typename K::Vector_3 v1 = p2-p1;
-  const typename K::Vector_3 v2 = p4-p3;
-
-  CGAL_assertion(k.coplanar_3_object()(p1,p2,p3,p4));
-
-  const typename K::Vector_3 v3 = p3 - p1;
-  const typename K::Vector_3 v3v2 = cross_product(v3,v2);
-  const typename K::Vector_3 v1v2 = cross_product(v1,v2);
-  const typename K::FT sl = v1v2.squared_length();
-  CGAL_assertion(!certainly(is_zero(sl)));
-
-  const typename K::FT t = ((v3v2.x()*v1v2.x()) + (v3v2.y()*v1v2.y()) + (v3v2.z()*v1v2.z())) / sl;
-  return t; // p1 + (p2-p1) * t
-}
-
 template <class Kernel>
 struct Point_on_triangle
 {
@@ -179,6 +157,8 @@ intersection(const Point_on_triangle<Kernel>& p,
   std::cout << " (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) -";
   std::cout << " (" << q.id1() << "," << q.id2() << ",[" << q.alpha << "]) || e" << edge_id_t1;
 #endif
+  typename Kernel::Compute_alpha_for_coplanar_triangle_intersection_3 compute_alpha
+    = k.compute_alpha_for_coplanar_triangle_intersection_3_object();
   typedef Point_on_triangle<Kernel> Pot;
   switch(p.id1())
   {
@@ -193,10 +173,9 @@ intersection(const Point_on_triangle<Kernel>& p,
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
           std::cout << " -- case 1\n";
 #endif
-          typename Kernel::FT alpha =
-            coplanar_segment_segment_alpha_intersection(p1, q1,
-                                                        Pot::point_from_id(p2, q2, r2, p.id2()),
-                                                        Pot::point_from_id(p2, q2, r2, q.id2()), k);
+          typename Kernel::FT alpha = compute_alpha(p1, q1,
+                                                    Pot::point_from_id(p2, q2, r2, p.id2()),
+                                                    Pot::point_from_id(p2, q2, r2, q.id2()));
           int id2 = (p.id2()+1)%3 == q.id2() ? p.id2() : q.id2();
           return  Point_on_triangle<Kernel>(edge_id_t1, id2, alpha); // intersection with an original edge of t2
         }
@@ -209,10 +188,9 @@ intersection(const Point_on_triangle<Kernel>& p,
               std::cout << " -- case 2\n";
 #endif
               // points are on the same edge of t2 --> we shorten an already cut edge
-              typename Kernel::FT alpha =
-                coplanar_segment_segment_alpha_intersection(p1, q1,
-                                                            Pot::point_from_id(p2, q2, r2,  q.id2()),
-                                                            Pot::point_from_id(p2, q2, r2, (q.id2()+1)%3), k);
+              typename Kernel::FT alpha = compute_alpha(p1, q1,
+                                                        Pot::point_from_id(p2, q2, r2,  q.id2()),
+                                                        Pot::point_from_id(p2, q2, r2, (q.id2()+1)%3));
 
               return  Point_on_triangle<Kernel>(edge_id_t1, q.id2(), alpha);
             }
@@ -278,10 +256,9 @@ intersection(const Point_on_triangle<Kernel>& p,
                 std::cout << " -- case 7\n";
 #endif
                 // points are on the same edge of t2 --> we shorten an already cut edge
-                typename Kernel::FT alpha =
-                  coplanar_segment_segment_alpha_intersection(p1, q1,
-                                                              Pot::point_from_id(p2, q2, r2,  p.id2()),
-                                                              Pot::point_from_id(p2, q2, r2, (p.id2()+1)%3), k);
+                typename Kernel::FT alpha = compute_alpha(p1, q1,
+                                                          Pot::point_from_id(p2, q2, r2,  p.id2()),
+                                                          Pot::point_from_id(p2, q2, r2, (p.id2()+1)%3));
 
                 return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), alpha);
               }
@@ -314,10 +291,9 @@ intersection(const Point_on_triangle<Kernel>& p,
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
                     std::cout << " -- case 10\n";
 #endif
-                    typename Kernel::FT alpha =
-                      coplanar_segment_segment_alpha_intersection(p1, q1,
-                                                                  Pot::point_from_id(p2, q2, r2,  q.id2()),
-                                                                  Pot::point_from_id(p2, q2, r2, (q.id2()+1)%3), k);
+                    typename Kernel::FT alpha = compute_alpha(p1, q1,
+                                                              Pot::point_from_id(p2, q2, r2,  q.id2()),
+                                                              Pot::point_from_id(p2, q2, r2, (q.id2()+1)%3));
                     return  Point_on_triangle<Kernel>(edge_id_t1, q.id2(), alpha);
                   }
                   // we are intersecting an edge of t1
diff --git a/Kernel_23/include/CGAL/Kernel/function_objects.h b/Kernel_23/include/CGAL/Kernel/function_objects.h
index 71aa268e6d35..780c0b2d4e50 100644
--- a/Kernel_23/include/CGAL/Kernel/function_objects.h
+++ b/Kernel_23/include/CGAL/Kernel/function_objects.h
@@ -2149,6 +2149,37 @@ namespace CommonKernelFunctors {
     }
   };
 
+  template <typename K>
+  class Compute_alpha_for_coplanar_triangle_intersection_3
+  {
+    typedef typename K::Point_3 Point_3;
+    typedef typename K::Vector_3 Vector_3;
+  public:
+    typedef typename K::FT  result_type;
+    result_type
+    operator()(const Point_3& p1, const Point_3& p2,       // segment 1
+               const Point_3& p3, const Point_3& p4) const // segment 2
+    {
+      typename K::Construct_vector_3 vector = K().construct_vector_3_object();
+      typename K::Construct_cross_product_vector_3 cross_product =
+        K().construct_cross_product_vector_3_object();
+
+      const Vector_3 v1 = vector(p1, p2);
+      const Vector_3 v2 = vector(p3, p4);
+
+      CGAL_assertion(K().coplanar_3_object()(p1,p2,p3,p4));
+
+      const Vector_3 v3 = vector(p1, p3);
+      const Vector_3 v3v2 = cross_product(v3,v2);
+      const Vector_3 v1v2 = cross_product(v1,v2);
+      const typename K::FT sl = K().compute_squared_length_3_object()(v1v2);
+      CGAL_assertion(!certainly(is_zero(sl)));
+
+      const typename K::FT t = ((v3v2.x()*v1v2.x()) + (v3v2.y()*v1v2.y()) + (v3v2.z()*v1v2.z())) / sl;
+      return t; // p1 + (p2-p1) * t
+    }
+  };
+
   template <typename K>
   class Construct_point_on_2
   {
diff --git a/Kernel_23/include/CGAL/Kernel/interface_macros.h b/Kernel_23/include/CGAL/Kernel/interface_macros.h
index 9c85643a977e..e5a2ebf81210 100644
--- a/Kernel_23/include/CGAL/Kernel/interface_macros.h
+++ b/Kernel_23/include/CGAL/Kernel/interface_macros.h
@@ -396,6 +396,8 @@ CGAL_Kernel_cons(Construct_plane_3,
                  construct_plane_3_object)
 CGAL_Kernel_cons(Construct_plane_line_intersection_point_3,
                  construct_plane_line_intersection_point_3_object)
+CGAL_Kernel_cons(Compute_alpha_for_coplanar_triangle_intersection_3,
+                 compute_alpha_for_coplanar_triangle_intersection_3_object)
 CGAL_Kernel_cons(Construct_point_on_2,
                  construct_point_on_2_object)
 CGAL_Kernel_cons(Construct_point_on_3,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 6b664ec360bc..6c8ba3f8cd27 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -386,7 +386,7 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
 
   //intersect t2 with the three half planes which intersection defines t1
   K k;
-  intersection_coplanar_triangles_cutoff(p1,q1,r1,0,p2,q2,r2,k,l_inter_pts); //line p1q1
+  Intersections::internal::intersection_coplanar_triangles_cutoff(p1,q1,r1,0,p2,q2,r2,k,l_inter_pts); //line p1q1
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
   print_points();
@@ -401,7 +401,7 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
     }
   }
 #endif
-  intersection_coplanar_triangles_cutoff(q1,r1,p1,1,p2,q2,r2,k,l_inter_pts); //line q1r1
+  Intersections::internal::intersection_coplanar_triangles_cutoff(q1,r1,p1,1,p2,q2,r2,k,l_inter_pts); //line q1r1
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
   print_points();
@@ -416,7 +416,7 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
     }
   }
 #endif
-  intersection_coplanar_triangles_cutoff(r1,p1,q1,2,p2,q2,r2,k,l_inter_pts); //line r1p1
+  Intersections::internal::intersection_coplanar_triangles_cutoff(r1,p1,q1,2,p2,q2,r2,k,l_inter_pts); //line r1p1
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
   print_points();

From 0684bd203fa818c1dbf6cb4b3fae839e08da94a9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 8 Jun 2023 14:17:18 +0200
Subject: [PATCH 0334/1398] hide debug

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h     | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 6c8ba3f8cd27..90174e42753d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -49,7 +49,7 @@
 
 #define TEST_RESOLVE_INTERSECTION
 #define DEDUPLICATE_SEGMENTS
-#define USE_DEBUG_PARALLEL_TIMERS
+//#define USE_DEBUG_PARALLEL_TIMERS
 //#define DEBUG_COUNTERS
 //#define USE_FIXED_PROJECTION_TRAITS
 //#define DEBUG_DEPTH
@@ -1248,8 +1248,6 @@ void autorefine_soup_output(const PointRange& input_points,
 #ifdef DEDUPLICATE_SEGMENTS
   // deduplicate inserted segments
   //TODO: PARALLEL_FOR #3
-  Real_timer t3;
-  t3.start();
   std::vector<std::vector<std::pair<std::size_t, std::size_t>>> all_segments_ids(all_segments.size());
 
   auto deduplicate_inserted_segments = [&](std::size_t ti)

From c5fab1c874248e87abe1f769616f624f8bd0efdc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 8 Jun 2023 14:21:59 +0200
Subject: [PATCH 0335/1398] fix sequential run

---
 .../CGAL/Polygon_mesh_processing/autorefinement.h  | 14 ++++++--------
 1 file changed, 6 insertions(+), 8 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 90174e42753d..11b15fa4ec47 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1307,11 +1307,10 @@ void autorefine_soup_output(const PointRange& input_points,
                       );
   }
   else
-#else
-    for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
-      deduplicate_inserted_segments(ti);
-    }
 #endif
+  for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
+    deduplicate_inserted_segments(ti);
+  }
 
 #ifdef USE_DEBUG_PARALLEL_TIMERS
   std::cout << t.time() << " sec. for #3" << std::endl;
@@ -1385,11 +1384,10 @@ void autorefine_soup_output(const PointRange& input_points,
                       );
   }
   else
-#else
-    for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
-      refine_triangles(ti);
-    }
 #endif
+  for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
+    refine_triangles(ti);
+  }
 
 #ifdef USE_DEBUG_PARALLEL_TIMERS
   t.stop();

From 9fbfd93b56af9be923a5e1297e45a353a786c608 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 8 Jun 2023 18:09:44 +0200
Subject: [PATCH 0336/1398] Fix function name

---
 .../Polyhedron/Plugins/IO/Polylines_io_plugin.cpp    |  2 +-
 .../demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp   |  4 ++--
 .../Plugins/PMP/Repair_polyhedron_plugin.cpp         |  2 +-
 .../Point_set/Point_set_shape_detection_plugin.cpp   |  2 +-
 Polyhedron/demo/Polyhedron/Scene_item.cpp            |  2 +-
 .../demo/Polyhedron/Scene_item_rendering_helper.cpp  | 10 +++++-----
 .../Polyhedron/Scene_points_with_normal_item.cpp     |  2 +-
 Three/include/CGAL/Three/Scene_item.h                | 12 ++++++------
 .../include/CGAL/Three/Scene_item_rendering_helper.h |  2 +-
 9 files changed, 19 insertions(+), 19 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
index fa09b6036548..e500ffb92a8a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
@@ -343,7 +343,7 @@ void Polyhedron_demo_polylines_io_plugin::simplify()
 {
   Scene_polylines_item* item = qobject_cast<Scene_polylines_item*>(scene->item(scene->mainSelectionIndex()));
   bool ok;
-  double err = QInputDialog::getDouble(mw, "Squared Frechet Distance", "Enter the squared approximation error:", pow(0.01*item->diagonalBbox(),2),0,999,8,&ok);
+  double err = QInputDialog::getDouble(mw, "Squared Frechet Distance", "Enter the squared approximation error:", pow(0.01*item->bboxDiagonal(),2),0,999,8,&ok);
   if(!ok)
     return;
   for(Scene_polylines_item::Polylines_container::iterator
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
index 308bd503d958..caea10065a9c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
@@ -404,8 +404,8 @@ private Q_SLOTS:
     // compute centroid
     Point c = CGAL::centroid(triangles.begin(),triangles.end());
 
-    oliver_queen = new Scene_arrow_item(Vec(c.x(),c.y(),c.z()), fg_item->diagonalBbox() / 50.0f,
-                                        fg_item->diagonalBbox()/3.0f);
+    oliver_queen = new Scene_arrow_item(Vec(c.x(),c.y(),c.z()), fg_item->bboxDiagonal() / 50.0f,
+                                        fg_item->bboxDiagonal()/3.0f);
     Vec dir(plane.orthogonal_vector().x(),
             plane.orthogonal_vector().y(),
             plane.orthogonal_vector().z());
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
index 1cae60b9a70e..5ecc8921433e 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
@@ -192,7 +192,7 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionRemoveNeedlesAndCaps_tri
   QDialog dialog;
   Ui::NeedleDialog ui;
   ui.setupUi(&dialog);
-  ui.collapseBox->setValue(sm_item->diagonalBbox()*0.01);
+  ui.collapseBox->setValue(sm_item->bboxDiagonal()*0.01);
   if(dialog.exec() != QDialog::Accepted)
     return;
   CGAL::Polygon_mesh_processing::remove_almost_degenerate_faces(*sm_item->face_graph(),
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
index fc344cec857c..68a1fe2c6d3a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
@@ -928,7 +928,7 @@ void Polyhedron_demo_point_set_shape_detection_plugin::on_actionDetectShapesSM_t
     dialog.m_cluster_epsilon_field->setEnabled(false);
     dialog.groupBox_3->setEnabled(false);
     //todo: check default values
-    dialog.m_epsilon_field->setValue(0.01*sm_item->diagonalBbox());
+    dialog.m_epsilon_field->setValue(0.01*sm_item->bboxDiagonal());
     std::size_t nb_faces = mesh->number_of_faces();
     dialog.m_min_pts_field->setValue((std::max)(static_cast<int>(0.01*nb_faces), 1));
     if(!dialog.exec()) return;
diff --git a/Polyhedron/demo/Polyhedron/Scene_item.cpp b/Polyhedron/demo/Polyhedron/Scene_item.cpp
index 1951ee8ff7c2..1b54ec529938 100644
--- a/Polyhedron/demo/Polyhedron/Scene_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_item.cpp
@@ -22,7 +22,7 @@ CGAL::Three::Scene_item::Scene_item(int buffers_size, int vaos_size)
 
   CGAL::QGLViewer::QGLViewerPool().first()->makeCurrent();
   is_bbox_computed = false;
-  is_diag_bbox_computed = false;
+  is_bbox_diag_computed = false;
   for(int i=0; i<vaosSize; i++)
   {
     addVaos(i);
diff --git a/Polyhedron/demo/Polyhedron/Scene_item_rendering_helper.cpp b/Polyhedron/demo/Polyhedron/Scene_item_rendering_helper.cpp
index 7572b9a1ff53..27bb13524126 100644
--- a/Polyhedron/demo/Polyhedron/Scene_item_rendering_helper.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_item_rendering_helper.cpp
@@ -16,7 +16,7 @@ struct PRIV{
   PRIV(Scene_item_rendering_helper* item)
     : item(item),
       is_bbox_computed(false),
-      is_diag_bbox_computed(false),
+      is_bbox_diag_computed(false),
       _diag_bbox(0),
       alphaSlider(nullptr),
       are_buffers_filled(false)
@@ -44,7 +44,7 @@ struct PRIV{
   Scene_item_rendering_helper* item;
   Scene_item::Bbox _bbox;
   bool is_bbox_computed;
-  bool is_diag_bbox_computed;
+  bool is_bbox_diag_computed;
   double _diag_bbox;
   QSlider* alphaSlider;
   bool are_buffers_filled;
@@ -67,10 +67,10 @@ Scene_item_rendering_helper::~Scene_item_rendering_helper()
     delete priv;
 }
 
-double Scene_item_rendering_helper::diagonalBbox() const {
-  if(!priv->is_diag_bbox_computed)
+double Scene_item_rendering_helper::bboxDiagonal() const {
+  if(!priv->is_bbox_diag_computed)
     priv->compute_diag_bbox();
-  priv->is_diag_bbox_computed = true;
+  priv->is_bbox_diag_computed = true;
   return priv->_diag_bbox;
 }
 
diff --git a/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp b/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp
index 7ad2931f252b..75bea895cfac 100644
--- a/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp
@@ -321,7 +321,7 @@ void Scene_points_with_normal_item_priv::compute_normals_and_vertices() const
       positions_selected_normals.resize(m_points->nb_selected_points() * 3);
 
       // we can't afford computing real average spacing just for display, 0.5% of bbox will do
-      average_spacing = 0.005 * item->diagonalBbox();
+      average_spacing = 0.005 * item->bboxDiagonal();
       normal_length = (std::min)(average_spacing, std::sqrt(
                                    region_of_interest.squared_radius() / 1000.));
       length_factor = 10.0/100*normal_Slider->value();
diff --git a/Three/include/CGAL/Three/Scene_item.h b/Three/include/CGAL/Three/Scene_item.h
index f22b9be5f52d..ca65c413f3c1 100644
--- a/Three/include/CGAL/Three/Scene_item.h
+++ b/Three/include/CGAL/Three/Scene_item.h
@@ -187,11 +187,11 @@ class SCENE_ITEM_EXPORT Scene_item : public QObject{
   //! If the diagonal's length has never been computed, computes it and
   //! saves the result for further calls.
   //! @returns the item's bounding box's diagonal length.
-  virtual double diagonalBbox() const {
-   if(!is_diag_bbox_computed)
-       compute_diag_bbox();
-   is_diag_bbox_computed = true;
-   return _diag_bbox;
+  virtual double bboxDiagonal() const {
+    if(!is_bbox_diag_computed)
+      compute_diag_bbox();
+    is_bbox_diag_computed = true;
+    return _diag_bbox;
   }
 
   // Function about manipulation
@@ -413,7 +413,7 @@ public Q_SLOTS:
   mutable Bbox _bbox;
   mutable double _diag_bbox;
   mutable bool is_bbox_computed;
-  mutable bool is_diag_bbox_computed;
+  mutable bool is_bbox_diag_computed;
   virtual void compute_bbox()const{}
   virtual void compute_diag_bbox()const;
   // The four basic properties
diff --git a/Three/include/CGAL/Three/Scene_item_rendering_helper.h b/Three/include/CGAL/Three/Scene_item_rendering_helper.h
index f654139c2a69..72fd4ce154a9 100644
--- a/Three/include/CGAL/Three/Scene_item_rendering_helper.h
+++ b/Three/include/CGAL/Three/Scene_item_rendering_helper.h
@@ -174,7 +174,7 @@ class DEMO_FRAMEWORK_EXPORT Scene_item_rendering_helper
   //! saves the result for further calls.
   //! @returns the item's bounding box's diagonal length.
   //! @todo must replace the one from Scene_item eventually
-  virtual double diagonalBbox() const Q_DECL_OVERRIDE;
+  virtual double bboxDiagonal() const Q_DECL_OVERRIDE;
   //!
   //! \brief newViewer adds Vaos for `viewer`.
   //! \param viewer the new viewer.

From f85b8398582e1f2e7b86c8003e5e6d443a40d074 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 8 Jun 2023 18:09:53 +0200
Subject: [PATCH 0337/1398] Do not proceed if user cancels

---
 .../Subdivision_methods_plugin.cpp            | 51 ++++++++++++-------
 1 file changed, 33 insertions(+), 18 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp
index 84e3b4702ce2..87bb50fd96fe 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp
@@ -95,16 +95,19 @@ void Polyhedron_demo_subdivision_methods_plugin::apply_loop(FaceGraphItem* item,
 void Polyhedron_demo_subdivision_methods_plugin::on_actionLoop_triggered()
 {
   CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
-
-  Scene_surface_mesh_item* sm_item =
-      qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
+  Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
   if(!sm_item)
     return;
+
+  bool ok = true;
   int nb_steps = QInputDialog::getInt(mw,
                                       QString("Number of Iterations"),
                                       QString("Choose number of iterations"),
-                                      1,
-                                      1);
+                                      1 /* value */, 1 /* min */, (std::numeric_limits<int>::max)() /* max */, 1 /*step*/,
+                                      &ok);
+  if(!ok)
+    return;
+
   apply_loop(sm_item, nb_steps);
 }
 
@@ -123,18 +126,23 @@ void Polyhedron_demo_subdivision_methods_plugin::apply_catmullclark(FaceGraphIte
   item->invalidateOpenGLBuffers();
   scene->itemChanged(item);
 }
+
 void Polyhedron_demo_subdivision_methods_plugin::on_actionCatmullClark_triggered()
 {
   CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
-  Scene_surface_mesh_item* sm_item =
-      qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
+  Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
   if(!sm_item)
     return;
+
+  bool ok = true;
   int nb_steps = QInputDialog::getInt(mw,
                                       QString("Number of Iterations"),
                                       QString("Choose number of iterations"),
-                                      1,
-                                      1);
+                                      1 /* value */, 1 /* min */, (std::numeric_limits<int>::max)() /* max */, 1 /*step*/,
+                                      &ok);
+  if(!ok)
+    return;
+
   apply_catmullclark(sm_item, nb_steps);
 }
 
@@ -157,15 +165,19 @@ void Polyhedron_demo_subdivision_methods_plugin::apply_sqrt3(FaceGraphItem* item
 void Polyhedron_demo_subdivision_methods_plugin::on_actionSqrt3_triggered()
 {
   CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
-  Scene_surface_mesh_item* sm_item =
-      qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
+  Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
   if(!sm_item)
     return;
+
+  bool ok = true;
   int nb_steps = QInputDialog::getInt(mw,
                                       QString("Number of Iterations"),
                                       QString("Choose number of iterations"),
-                                      1,
-                                      1);
+                                      1 /* value */, 1 /* min */, (std::numeric_limits<int>::max)() /* max */, 1 /*step*/,
+                                      &ok);
+  if(!ok)
+    return;
+
   apply_sqrt3(sm_item, nb_steps);
 
 }
@@ -189,16 +201,19 @@ void Polyhedron_demo_subdivision_methods_plugin::apply_doosabin(FaceGraphItem* i
 void Polyhedron_demo_subdivision_methods_plugin::on_actionDooSabin_triggered()
 {
   CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
-
-  Scene_surface_mesh_item* sm_item =
-      qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
+  Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
   if(!sm_item)
     return;
+
+  bool ok = true;
   int nb_steps = QInputDialog::getInt(mw,
                                       QString("Number of Iterations"),
                                       QString("Choose number of iterations"),
-                                      1,
-                                      1);
+                                      1 /* value */, 1 /* min */, (std::numeric_limits<int>::max)() /* max */, 1 /*step*/,
+                                      &ok);
+  if(!ok)
+    return;
+
   apply_doosabin(sm_item, nb_steps);
 
 }

From 1237c7a39873bc2d7a6c4efae7e7f3decaee6fed Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Fri, 9 Jun 2023 12:45:19 +0200
Subject: [PATCH 0338/1398] Remove a warning for lcc tests

---
 .../test/Linear_cell_complex/Linear_cell_complex_2_test.cpp    | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.cpp b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.cpp
index 28195f353548..89f981f53d1b 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.cpp
+++ b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_2_test.cpp
@@ -32,7 +32,8 @@ struct Myattrib : public  CGAL::Cell_attribute_with_point
 
 struct MonInfo
 {
-  MonInfo(int i=0) : mnb(i==0?rand():i), ptr(reinterpret_cast<char*>(this))
+  MonInfo(long long int i=0) : mnb(i==0?rand():static_cast<int>(i)),
+                               ptr(reinterpret_cast<char*>(this))
   {}
 
   bool operator==(const MonInfo& info) const

From efd68a5f922ca427bc17e841ce8df3c2387481b4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 9 Jun 2023 19:15:16 +0200
Subject: [PATCH 0339/1398] Update offset meshing plugin

- fixed not working for polygon soups
- fixed broken formula for both giving Mesh_3 assertions and inverted meshes
- fixed applicable() allowing wrong combinations
- fixed inflate() needlessly normalizing normals
- fixed crashing for non triangulated inputs
- fixed some memory leaks
- fixed dialog name
- removed useless sqrts
- avoid recomputing bbox 4 times
- cleaned UI
- etc.
---
 .../Polyhedron/Plugins/Mesh_3/CMakeLists.txt  |  13 +
 .../Offset_meshing_dialog.ui}                 | 124 +--
 .../Plugins/Mesh_3/Offset_meshing_plugin.cpp  | 765 ++++++++++++++++++
 .../Plugins/Surface_mesh/CMakeLists.txt       |  12 -
 .../Surface_mesh/Offset_meshing_plugin.cpp    | 691 ----------------
 5 files changed, 846 insertions(+), 759 deletions(-)
 rename Polyhedron/demo/Polyhedron/Plugins/{Surface_mesh/Remeshing_dialog.ui => Mesh_3/Offset_meshing_dialog.ui} (81%)
 create mode 100644 Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Offset_meshing_plugin.cpp
 delete mode 100644 Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
index eb4e9c5b57d0..2cc3f58854f2 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
@@ -116,3 +116,16 @@ if(TBB_FOUND)
   target_link_libraries(c3t3_io_plugin PUBLIC CGAL::TBB_support)
   target_link_libraries(c3t3_rib_exporter_plugin PUBLIC CGAL::TBB_support)
 endif()
+
+qt5_wrap_ui(offsetMeshingUI_FILES Offset_meshing_dialog.ui)
+polyhedron_demo_plugin(offset_meshing_plugin Offset_meshing_plugin
+                       ${offsetMeshingUI_FILES})
+target_link_libraries(offset_meshing_plugin PUBLIC scene_surface_mesh_item
+                                                   scene_polygon_soup_item
+                                                   scene_polylines_item)
+if(TARGET CGAL::Eigen3_support)
+  target_link_libraries(offset_meshing_plugin PUBLIC CGAL::Eigen3_support)
+endif()
+if(TARGET CGAL::TBB_support)
+  target_link_libraries(offset_meshing_plugin PUBLIC CGAL::TBB_support)
+endif()
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Remeshing_dialog.ui b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Offset_meshing_dialog.ui
similarity index 81%
rename from Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Remeshing_dialog.ui
rename to Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Offset_meshing_dialog.ui
index 37b9073000f6..33df99c77bbc 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Remeshing_dialog.ui
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Offset_meshing_dialog.ui
@@ -1,64 +1,70 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <ui version="4.0">
- <class>Remeshing_dialog</class>
- <widget class="QDialog" name="Remeshing_dialog">
+ <class>Offset_meshing_dialog</class>
+ <widget class="QDialog" name="Offset_meshing_dialog">
   <property name="geometry">
    <rect>
     <x>0</x>
     <y>0</y>
-    <width>376</width>
-    <height>216</height>
+    <width>413</width>
+    <height>294</height>
    </rect>
   </property>
   <property name="windowTitle">
    <string>Meshing criteria</string>
   </property>
   <layout class="QGridLayout" name="gridLayout">
-   <item row="0" column="2" colspan="2">
+   <item row="1" column="2" colspan="2">
     <widget class="DoubleEdit" name="angle">
      <property name="text">
       <string>25.0</string>
      </property>
     </widget>
    </item>
-   <item row="1" column="2" colspan="2">
-    <widget class="DoubleEdit" name="sizing">
-     <property name="text">
-      <string>0.00</string>
+   <item row="7" column="3">
+    <widget class="QDialogButtonBox" name="buttonBox">
+     <property name="orientation">
+      <enum>Qt::Horizontal</enum>
+     </property>
+     <property name="standardButtons">
+      <set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
      </property>
     </widget>
    </item>
-   <item row="2" column="0" colspan="2">
-    <widget class="QLabel" name="approxLabel">
+   <item row="4" column="1">
+    <widget class="QLabel" name="sizingLabel_2">
      <property name="text">
-      <string>Approximation &amp;error:</string>
+      <string>Edge size</string>
      </property>
      <property name="alignment">
       <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
      </property>
     </widget>
    </item>
-   <item row="2" column="2" colspan="2">
-    <widget class="DoubleEdit" name="approx">
+   <item row="4" column="2" colspan="2">
+    <widget class="DoubleEdit" name="edge_sizing">
+     <property name="enabled">
+      <bool>true</bool>
+     </property>
      <property name="text">
       <string>0.00</string>
      </property>
     </widget>
    </item>
-   <item row="4" column="0" colspan="2">
-    <widget class="QLabel" name="label">
-     <property name="text">
-      <string>&amp;Topological criterion:</string>
-     </property>
-     <property name="alignment">
-      <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
+   <item row="6" column="2">
+    <spacer name="verticalSpacer">
+     <property name="orientation">
+      <enum>Qt::Vertical</enum>
      </property>
-     <property name="buddy">
-      <cstring>tags</cstring>
+     <property name="sizeHint" stdset="0">
+      <size>
+       <width>20</width>
+       <height>40</height>
+      </size>
      </property>
-    </widget>
+    </spacer>
    </item>
-   <item row="4" column="2" colspan="2">
+   <item row="5" column="2" colspan="2">
     <widget class="QComboBox" name="tags">
      <item>
       <property name="text">
@@ -77,69 +83,75 @@
      </item>
     </widget>
    </item>
-   <item row="5" column="2">
-    <spacer name="verticalSpacer">
-     <property name="orientation">
-      <enum>Qt::Vertical</enum>
-     </property>
-     <property name="sizeHint" stdset="0">
-      <size>
-       <width>20</width>
-       <height>40</height>
-      </size>
+   <item row="5" column="0" colspan="2">
+    <widget class="QLabel" name="label">
+     <property name="text">
+      <string>Topological criterion</string>
      </property>
-    </spacer>
-   </item>
-   <item row="6" column="3">
-    <widget class="QDialogButtonBox" name="buttonBox">
-     <property name="orientation">
-      <enum>Qt::Horizontal</enum>
+     <property name="alignment">
+      <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
      </property>
-     <property name="standardButtons">
-      <set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
+     <property name="buddy">
+      <cstring>tags</cstring>
      </property>
     </widget>
    </item>
    <item row="3" column="2" colspan="2">
-    <widget class="DoubleEdit" name="edge_sizing">
-     <property name="enabled">
-      <bool>true</bool>
-     </property>
+    <widget class="DoubleEdit" name="approx">
      <property name="text">
       <string>0.00</string>
      </property>
     </widget>
    </item>
-   <item row="3" column="1">
-    <widget class="QLabel" name="sizingLabel_2">
+   <item row="3" column="0" colspan="2">
+    <widget class="QLabel" name="approxLabel">
      <property name="text">
-      <string>&amp;Edge size:</string>
+      <string>Approximation error</string>
      </property>
      <property name="alignment">
       <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
      </property>
     </widget>
    </item>
-   <item row="1" column="1">
+   <item row="2" column="2" colspan="2">
+    <widget class="DoubleEdit" name="sizing">
+     <property name="text">
+      <string>0.00</string>
+     </property>
+    </widget>
+   </item>
+   <item row="2" column="1">
     <widget class="QLabel" name="sizingLabel">
      <property name="text">
-      <string>&amp;Size:</string>
+      <string>Size</string>
      </property>
      <property name="alignment">
       <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
      </property>
     </widget>
    </item>
-   <item row="0" column="1">
+   <item row="1" column="1">
     <widget class="QLabel" name="angleLabel">
      <property name="text">
-      <string>&amp;Angle:</string>
+      <string>Angle</string>
      </property>
      <property name="alignment">
       <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
      </property>
     </widget>
    </item>
+   <item row="0" column="0" colspan="4">
+    <widget class="QLabel" name="objectName">
+     <property name="font">
+      <font>
+       <pointsize>15</pointsize>
+      </font>
+     </property>
+     <property name="text">
+      <string>Meshing Criteria</string>
+     </property>
+    </widget>
+   </item>
   </layout>
  </widget>
  <customwidgets>
@@ -154,7 +166,7 @@
   <connection>
    <sender>buttonBox</sender>
    <signal>accepted()</signal>
-   <receiver>Remeshing_dialog</receiver>
+   <receiver>Offset_meshing_dialog</receiver>
    <slot>accept()</slot>
    <hints>
     <hint type="sourcelabel">
@@ -170,7 +182,7 @@
   <connection>
    <sender>buttonBox</sender>
    <signal>rejected()</signal>
-   <receiver>Remeshing_dialog</receiver>
+   <receiver>Offset_meshing_dialog</receiver>
    <slot>reject()</slot>
    <hints>
     <hint type="sourcelabel">
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Offset_meshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Offset_meshing_plugin.cpp
new file mode 100644
index 000000000000..8b0e0bab57b5
--- /dev/null
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Offset_meshing_plugin.cpp
@@ -0,0 +1,765 @@
+#include "config.h"
+
+#ifdef CGAL_POLYHEDRON_DEMO_USE_SURFACE_MESHER
+
+#include <CGAL/Three/Polyhedron_demo_plugin_interface.h>
+#include "ui_Offset_meshing_dialog.h"
+
+#include "C3t3_type.h"
+
+#include <CGAL/AABB_tree.h>
+#include <CGAL/AABB_traits.h>
+#include <CGAL/AABB_face_graph_triangle_primitive.h>
+
+#include <CGAL/Side_of_triangle_mesh.h>
+#include <CGAL/Polygon_mesh_processing/bbox.h>
+#include <CGAL/Polygon_mesh_processing/orientation.h>
+#include <CGAL/Polygon_mesh_processing/compute_normal.h>
+
+#include <CGAL/Timer.h>
+#include <CGAL/make_mesh_3.h>
+#include <CGAL/Labeled_mesh_domain_3.h>
+#include <CGAL/Mesh_domain_with_polyline_features_3.h>
+#include <CGAL/Mesh_criteria_3.h>
+#include <CGAL/facets_in_complex_3_to_triangle_mesh.h>
+
+#include <CGAL/Three/Three.h>
+
+#include <QObject>
+#include <QAction>
+#include <QMainWindow>
+#include <QMenu>
+#include <QApplication>
+#include <QtPlugin>
+#include <QThread>
+#include "Scene_surface_mesh_item.h"
+#include "Scene_polygon_soup_item.h"
+#include "Scene_polylines_item.h"
+#include <QInputDialog>
+#include <QStringList>
+#include <QMessageBox>
+#include <QAbstractButton>
+
+#include <algorithm>
+#include <iostream>
+#include <iterator>
+#include <memory>
+
+using namespace CGAL::Three;
+
+namespace CGAL {
+
+template <class TriangleMesh, class GeomTraits>
+class Offset_function
+{
+  using Primitive = AABB_face_graph_triangle_primitive<TriangleMesh>;
+  using Traits = AABB_traits<GeomTraits, Primitive>;
+  using Tree = AABB_tree<Traits>;
+  using Side_of = Side_of_triangle_mesh<TriangleMesh, GeomTraits>;
+
+  using FT = typename GeomTraits::FT;
+  using Point_3 = typename GeomTraits::Point_3;
+
+public:
+  Offset_function(const TriangleMesh& tm,
+                  double offset_distance)
+    : m_tree_ptr(std::make_shared<Tree>(std::begin(faces(tm)), std::end(faces(tm)), tm)),
+      m_side_of_ptr(std::make_shared<Side_of>(*m_tree_ptr)),
+      m_is_inset(offset_distance < 0),
+      m_sq_offset_distance(CGAL::square(offset_distance)),
+      m_is_closed(is_closed(tm))
+  {
+    CGAL_assertion(!m_tree_ptr->empty());
+  }
+
+  // we only need negative inside, and positive outside, so we can compare square roots
+  double operator()(const Point_3& p) const
+  {
+    const Bounded_side side = m_is_closed ? m_side_of_ptr->operator()(p) : ON_UNBOUNDED_SIDE;
+
+    if(m_is_inset) // also means that the mesh is closed
+    {
+      // - ON_UNBOUNDED_SIDE is outside the offset since we are insetting
+      // - ON_BOUNDARY is outside the offset since we are insetting
+      if(side != ON_BOUNDED_SIDE)
+        return 1;
+
+      // inside the offset if the distance to the input mesh is greater than the offset distance
+      const FT sq_distance = m_tree_ptr->squared_distance(p);
+      return (sq_distance > m_sq_offset_distance) ? -1 : 1;
+    }
+    else // outset
+    {
+      // - ON_BOUNDED_SIDE can only happen if it's a closed mesh, and in that case, being inside
+      // the mesh is being inside the offset
+      // - ON_BOUNDARY is in the offset whether the mesh is open or closed
+      if(side != ON_UNBOUNDED_SIDE)
+        return - 1;
+
+      // inside the offset if the distance to the input mesh is smaller than the offset distance
+      const FT sq_distance = m_tree_ptr->squared_distance(p);
+      return (sq_distance < m_sq_offset_distance) ? -1 : 1;
+    }
+  }
+
+private:
+  std::shared_ptr<Tree> m_tree_ptr;
+  std::shared_ptr<Side_of> m_side_of_ptr;
+  const bool m_is_inset;
+  const double m_sq_offset_distance;
+  const bool m_is_closed;
+};
+
+template <typename Points, typename Polygons>
+class Polygon_soup_offset_function
+{
+  using Polygon_iterator = typename Polygons::const_iterator;
+
+  class Polygon_soup_point_property_map
+  {
+    const Points* points_vector_ptr;
+
+  public:
+    using key_type = Polygon_iterator;
+    using value_type = EPICK::Point_3;
+    using reference = const value_type&;
+    using category = boost::readable_property_map_tag;
+
+    Polygon_soup_point_property_map() = default;
+    Polygon_soup_point_property_map(const Points* ptr) : points_vector_ptr(ptr) { }
+
+    friend reference get(Polygon_soup_point_property_map map,
+                         key_type polygon_it)
+    {
+      return (*map.points_vector_ptr)[*polygon_it->begin()];
+    }
+  };
+
+  class Polygon_soup_triangle_property_map
+  {
+    const Points* points_vector_ptr;
+
+  public:
+    using key_type = Polygon_iterator;
+    using value_type = EPICK::Triangle_3;
+    using reference = value_type;
+    using category = boost::readable_property_map_tag;
+
+    Polygon_soup_triangle_property_map() = default;
+    Polygon_soup_triangle_property_map(const Points* ptr) : points_vector_ptr(ptr) { }
+
+    friend value_type get(Polygon_soup_triangle_property_map map,
+                          key_type polygon_it)
+    {
+      auto it = polygon_it->begin();
+      CGAL_assertion(it != polygon_it->end());
+      const auto id0 = *it++;
+      CGAL_assertion(it != polygon_it->end());
+      const auto id1 = *it++;
+      CGAL_assertion(it != polygon_it->end());
+      const auto id2 = *it++;
+      CGAL_assertion(it == polygon_it->end());
+
+      return value_type((*map.points_vector_ptr)[id0],
+                        (*map.points_vector_ptr)[id1],
+                        (*map.points_vector_ptr)[id2]);
+    }
+  };
+
+  struct AABB_polygon_soup_triangle_primitive
+    : public CGAL::AABB_primitive<Polygon_iterator,
+                                  Polygon_soup_triangle_property_map,
+                                  Polygon_soup_point_property_map,
+                                  CGAL::Tag_true /*ExternalPropertyMaps*/,
+                                  CGAL::Tag_false /*CacheDatum*/>
+  {
+    using Base = CGAL::AABB_primitive<Polygon_iterator,
+                                      Polygon_soup_triangle_property_map,
+                                      Polygon_soup_point_property_map,
+                                      CGAL::Tag_true,
+                                      CGAL::Tag_false>;
+
+    using Id = Polygon_iterator;
+
+    template <typename ObjectPmap, typename PointPmap>
+    AABB_polygon_soup_triangle_primitive(Id id,
+                                         ObjectPmap&& opmap,
+                                         PointPmap&& ppmap)
+      : Base(id, std::forward<ObjectPmap>(opmap), std::forward<PointPmap>(ppmap))
+    {
+    }
+
+    template <typename Iterator, typename ObjectPmap, typename PointPmap>
+    AABB_polygon_soup_triangle_primitive(Iterator it,
+                                         ObjectPmap&& opmap,
+                                         PointPmap&& ppmap)
+      : Base(*it, std::forward<ObjectPmap>(opmap), std::forward<PointPmap>(ppmap))
+    {
+    }
+  }; // struct template Polygon_soup_primitive
+
+  using AABB_traits = CGAL::AABB_traits<EPICK, AABB_polygon_soup_triangle_primitive>;
+  using AABB_tree = CGAL::AABB_tree<AABB_traits>;
+
+  std::shared_ptr<AABB_tree> m_tree_ptr;
+  double m_sq_offset_distance;
+
+public:
+  Polygon_soup_offset_function(const Points& points,
+                               const Polygons& polygons,
+                               const double offset_distance)
+    : m_tree_ptr(std::make_shared<AABB_tree>(std::begin(polygons),
+                                             std::end(polygons),
+                                             Polygon_soup_triangle_property_map(&points),
+                                             Polygon_soup_point_property_map(&points))),
+      m_sq_offset_distance(square(offset_distance))
+  {
+    CGAL_assertion(!m_tree_ptr->empty());
+  }
+
+  // we only need negative inside, and positive outside, so we can compare square roots
+  double operator()(const EPICK::Point_3& p) const
+  {
+    // it's a soup so it's open by definition ==> treat inset and outset identically
+    const double sq_distance = m_tree_ptr->squared_distance(p);
+    return sq_distance - m_sq_offset_distance;
+  }
+
+}; // class Polygon_soup_offset_function
+
+} // namespace CGAL
+
+CGAL::Offset_function<SMesh, EPICK>
+offset_function(Scene_surface_mesh_item* item, double offset_value)
+{
+  return { *(item->face_graph()), offset_value };
+}
+
+CGAL::Polygon_soup_offset_function<Scene_polygon_soup_item::Points,
+                                   Scene_polygon_soup_item::Polygons>
+offset_function(Scene_polygon_soup_item* item, double offset_value)
+{
+  return { item->points(), item->polygons(), offset_value };
+}
+
+class MeshGuard
+{
+  SMesh* mesh;
+  bool done;
+
+public:
+  MeshGuard(SMesh* mesh) : mesh(mesh), done(false) { }
+  void setDone() { done = true; }
+  ~MeshGuard()
+  {
+    if(!done)
+      delete mesh;
+  }
+};
+
+// declare the CGAL function
+template<class SourceItem>
+SMesh* cgal_off_meshing(QWidget*,
+                        SourceItem* source_item,
+                        Scene_polylines_item* polylines_item,
+                        const double offset_value,
+                        const double angle,
+                        const double sizing,
+                        const double approx,
+                        const double edge_size,
+                        int tag)
+{
+  using GT = EPICK;
+  using Sphere_3 = GT::Sphere_3;
+
+  using Mesh_domain_base = CGAL::Labeled_mesh_domain_3<GT, int, int>;
+  using Mesh_domain = CGAL::Mesh_domain_with_polyline_features_3<Mesh_domain_base>;
+  using Tr = C3t3::Triangulation;
+  using Mesh_criteria = CGAL::Mesh_criteria_3<Tr>;
+
+  const CGAL::Bbox_3 bbox = source_item->bbox();
+
+  const GT::Point_3 center((bbox.xmax() + bbox.xmin()) / 2,
+                           (bbox.ymax() + bbox.ymin()) / 2,
+                           (bbox.zmax() + bbox.zmin()) / 2);
+  const double rad = 0.6 * std::sqrt(CGAL::square(bbox.xmax() - bbox.xmin()) +
+                                     CGAL::square(bbox.ymax() - bbox.ymin()) +
+                                     CGAL::square(bbox.zmax() - bbox.zmin()))
+                     + offset_value;
+  const double sqrad = CGAL::square(rad);
+
+  CGAL::Timer timer;
+  timer.start();
+
+  namespace p = CGAL::parameters;
+
+  Mesh_domain domain =
+    Mesh_domain::create_implicit_mesh_domain
+    (p::function = offset_function(source_item, offset_value),
+     p::bounding_object = Sphere_3(center, sqrad),
+     p::relative_error_bound = 1e-7,
+     p::construct_surface_patch_index = [](int i, int j) { return (i * 1000 + j); });
+
+  const CGAL::Mesh_facet_topology topology = CGAL::FACET_VERTICES_ON_SAME_SURFACE_PATCH;
+  auto manifold_option = p::non_manifold();
+  if(tag == 1)
+    manifold_option = p::manifold_with_boundary();
+  if(tag == 2)
+    manifold_option = p::manifold();
+
+  Mesh_criteria criteria(p::facet_angle = angle,
+                         p::facet_size = sizing,
+                         p::facet_distance = approx,
+                         p::facet_topology = topology,
+                         p::edge_size = edge_size);
+
+  if(polylines_item != nullptr)
+  {
+    typedef std::vector<Mesh_domain::Surface_patch_index> Surface_patch_ids;
+    std::vector<Mesh_domain::Surface_patch_index> surface_patch_ids;
+
+    domain.add_features_and_incidences(polylines_item->polylines.begin(),
+                                       polylines_item->polylines.end(),
+                                       CGAL::Identity_property_map<Scene_polylines_item::Polyline>(),
+                                       CGAL::Constant_property_map<Scene_polylines_item::Polyline, Surface_patch_ids>(surface_patch_ids));
+  }
+
+  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
+                                      p::no_perturb(),
+                                      p::no_exude(),
+                                      manifold_option);
+
+  timer.stop();
+  std::cerr << "done (" << timer.time() << " ms, " << c3t3.triangulation().number_of_vertices() << " vertices)" << std::endl;
+
+  if(c3t3.number_of_facets_in_complex() > 0)
+  {
+    SMesh* pRemesh = new SMesh();
+
+    // if the thread is interrupted before the mesh is returned, delete it.
+    MeshGuard guard(pRemesh);
+    CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, *pRemesh);
+    guard.setDone();
+
+    CGAL_postcondition(CGAL::Polygon_mesh_processing::is_outward_oriented(*pRemesh));
+
+    return pRemesh;
+  }
+  else
+  {
+    return nullptr;
+  }
+}
+
+struct Mesher_thread
+  : public QThread
+{
+  Q_OBJECT
+
+private:
+  Scene_surface_mesh_item* sm_item;
+  Scene_polygon_soup_item* soup_item;
+  Scene_polylines_item* polylines_item;
+
+  const double offset_value;
+  const double angle;
+  const double sizing;
+  const double approx;
+  const double edge_size;
+  int tag_index;
+
+public:
+  Mesher_thread(Scene_surface_mesh_item* sm_item,
+                Scene_polygon_soup_item* soup_item,
+                Scene_polylines_item* polylines_item,
+                const double offset_value,
+                const double angle,
+                const double sizing,
+                const double approx,
+                const double edge_size,
+                int tag)
+    : sm_item(sm_item), soup_item(soup_item), polylines_item(polylines_item),
+      offset_value(offset_value),
+      angle(angle), sizing(sizing), approx(approx), edge_size(edge_size), tag_index(tag)
+  {
+  }
+
+  void run() override
+  {
+    SMesh* offset_mesh = nullptr;
+
+    if(soup_item)
+    {
+      offset_mesh = cgal_off_meshing(Three::mainWindow(),
+                                     soup_item, polylines_item,
+                                     offset_value,
+                                     angle, sizing, approx, edge_size, tag_index);
+    }
+    else
+    {
+      offset_mesh = cgal_off_meshing(Three::mainWindow(),
+                                     sm_item, polylines_item,
+                                     offset_value,
+                                     angle, sizing, approx, edge_size, tag_index);
+    }
+
+    Three::getMutex()->lock();
+    Three::getWaitCondition()->wakeAll();
+    Three::getMutex()->unlock();
+
+    Q_EMIT resultReady(offset_mesh);
+  }
+
+Q_SIGNALS:
+  void resultReady(SMesh *offset_mesh);
+};
+
+class Polyhedron_demo_offset_meshing_plugin
+  : public QObject,
+    protected Polyhedron_demo_plugin_interface
+{
+  Q_OBJECT
+  Q_INTERFACES(CGAL::Three::Polyhedron_demo_plugin_interface)
+  Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0")
+
+private:
+  QAction* actionOffsetMeshing;
+  QAction* actionInflateMesh;
+
+  Scene_interface *scene;
+  QMainWindow *mw;
+
+public:
+  void init(QMainWindow* mainWindow,
+            Scene_interface* scene_interface,
+            Messages_interface*)
+  {
+    this->scene = scene_interface;
+    this->mw = mainWindow;
+
+    actionOffsetMeshing = new QAction(tr("Offset Meshing"), mw);
+    actionOffsetMeshing->setProperty("subMenuName", "3D Surface Mesh Generation");
+    connect(actionOffsetMeshing, SIGNAL(triggered()),
+            this, SLOT(offset_meshing()));
+
+    actionInflateMesh = new QAction(tr("Inflate Mesh"), mw);
+    actionInflateMesh->setProperty("subMenuName", "Operations on Polyhedra");
+    connect(actionInflateMesh, SIGNAL(triggered()),
+            this, SLOT(inflate_mesh()));
+  }
+
+  bool applicable(QAction* action) const
+  {
+    if(action == actionOffsetMeshing)
+    {
+      if(scene->selectionIndices().size() == 1)
+      {
+        const int index = scene->mainSelectionIndex();
+        return (qobject_cast<Scene_surface_mesh_item*>(scene->item(index)) ||
+                qobject_cast<Scene_polygon_soup_item*>(scene->item(index)));
+      }
+
+      // Can provide a polyline item for feature protection
+      if(scene->selectionIndices().size() != 2)
+        return false;
+
+      // One needs to be a surface mesh or polygon soup item, and the other a polyline item
+      const int index1 = scene->selectionIndices().at(0);
+      const int index2 = scene->selectionIndices().at(1);
+      Scene_item* item1 = scene->item(index1);
+      Scene_item* item2 = scene->item(index2);
+
+      if((qobject_cast<Scene_surface_mesh_item*>(item1) ||
+          qobject_cast<Scene_polygon_soup_item*>(item1)) &&
+         qobject_cast<Scene_polylines_item*>(item2))
+        return true;
+
+      if((qobject_cast<Scene_surface_mesh_item*>(item2) ||
+          qobject_cast<Scene_polygon_soup_item*>(item2)) &&
+         qobject_cast<Scene_polylines_item*>(item1))
+        return true;
+    }
+    else if(action == actionInflateMesh)
+    {
+      if(scene->selectionIndices().size() == 1)
+      {
+        const int index = scene->mainSelectionIndex();
+        return qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
+      }
+    }
+
+    return false;
+  }
+
+  QList<QAction*> actions() const
+  {
+    return QList<QAction*>() << actionOffsetMeshing
+                             << actionInflateMesh;
+  }
+
+public Q_SLOTS:
+  void offset_meshing();
+  void inflate_mesh();
+}; // class Polyhedron_demo_offset_meshing_plugin
+
+void
+Polyhedron_demo_offset_meshing_plugin::
+offset_meshing()
+{
+  Scene_item* item = nullptr;
+  Scene_surface_mesh_item* sm_item = nullptr;
+  Scene_polygon_soup_item* soup_item = nullptr;
+  Scene_polylines_item* polylines_item = nullptr;
+
+  bool mesh_or_soup_item_found = false;
+  Q_FOREACH(Scene_interface::Item_id index, scene->selectionIndices())
+  {
+    if(!mesh_or_soup_item_found)
+    {
+      sm_item = qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
+      if(sm_item == nullptr)
+      {
+        soup_item = qobject_cast<Scene_polygon_soup_item*>(scene->item(index));
+        if(soup_item != nullptr)
+        {
+          item = scene->item(index);
+          mesh_or_soup_item_found = true;
+          continue;
+        }
+      }
+      else
+      {
+        item = scene->item(index);
+        mesh_or_soup_item_found = true;
+        continue;
+      }
+    }
+
+    polylines_item = qobject_cast<Scene_polylines_item*>(scene->item(index));
+  }
+
+  QApplication::setOverrideCursor(Qt::WaitCursor);
+
+  if(!mesh_or_soup_item_found)
+    return;
+
+  if(sm_item)
+  {
+    if(!is_triangle_mesh(*(sm_item->face_graph())))
+    {
+      QMessageBox::critical(mw,
+                            tr("Offset Meshing"),
+                            tr("The selected mesh is not a triangle mesh."));
+      return;
+    }
+  }
+  else
+  {
+    for(const auto& p : soup_item->polygons())
+    {
+      if(p.size() != 3)
+      {
+        QMessageBox::critical(mw,
+                              tr("Offset Meshing"),
+                              tr("The selected polygon soup is not a triangle soup."));
+        return;
+      }
+    }
+  }
+
+  double diag;
+  if(sm_item)
+    diag = sm_item->bboxDiagonal();
+  else
+    diag = soup_item->bboxDiagonal();
+
+  QApplication::restoreOverrideCursor();
+
+  bool ok = true;
+  double offset_value = QInputDialog::getDouble(mw,
+                                                QString("Choose Offset Value"),
+                                                QString("Offset Value (use a negative number to compute the inset of a closed mesh)"),
+                                                0.1 * diag,
+                                                - (std::numeric_limits<double>::max)(),
+                                                (std::numeric_limits<double>::max)(), 10, &ok);
+  if(!ok)
+    return;
+
+  if(offset_value < 0 && (!sm_item || !is_closed(*(sm_item->face_graph()))))
+  {
+    QMessageBox::critical(mw,
+                          tr("Offset Meshing"),
+                          tr("Insetting is only possible for closed polygon meshes."));
+    return;
+  }
+
+  QDialog dialog(mw);
+  Ui::Offset_meshing_dialog ui;
+  ui.setupUi(&dialog);
+  ui.angle->setRange(1.0, 30.0);
+
+  connect(ui.buttonBox, SIGNAL(accepted()),
+          &dialog, SLOT(accept()));
+  connect(ui.buttonBox, SIGNAL(rejected()),
+          &dialog, SLOT(reject()));
+
+  ui.sizing->setRange(diag * 10e-6, diag);
+  ui.sizing->setValue(diag * 0.05); // default value
+  ui.approx->setRange(diag * 10e-7, diag);
+  ui.approx->setValue(diag * 0.005);
+
+  if(polylines_item != nullptr)
+  {
+    ui.edge_sizing->setRange(diag * 10e-6, diag);
+    ui.edge_sizing->setValue(diag * 0.05); // default value
+  }
+  else
+  {
+    ui.edge_sizing->setEnabled(false);
+  }
+
+  int i = dialog.exec();
+  if(i == QDialog::Rejected)
+    return;
+
+  const double angle = ui.angle->value();
+  const double approx = ui.approx->value();
+  const double sizing = ui.sizing->value();
+  const double edge_size = (polylines_item != nullptr) ? ui.edge_sizing->value() : 0;
+  const int tag_index = ui.tags->currentIndex();
+
+  if(tag_index < 0)
+    return;
+
+  QApplication::setOverrideCursor(Qt::BusyCursor);
+
+  std::cerr << "mesh with:"
+            << "\n  angle= " << angle
+            << "\n  sizing= " << sizing
+            << "\n  approx= " << approx
+            << "\n  tag= " << tag_index
+            << std::boolalpha
+            << std::endl;
+
+  Mesher_thread* worker = nullptr;
+  if(soup_item)
+  {
+    worker = new Mesher_thread(nullptr, soup_item, polylines_item,
+                               offset_value,
+                               angle, sizing, approx, edge_size, tag_index);
+  }
+  else
+  {
+    worker = new Mesher_thread(sm_item, nullptr, polylines_item,
+                               offset_value,
+                               angle, sizing, approx, edge_size, tag_index);
+  }
+
+  connect(worker, &QThread::finished,
+          worker, &QObject::deleteLater);
+
+  connect(worker, &Mesher_thread::resultReady,
+          this, [item, angle, sizing, approx, offset_value/* , index */](SMesh* offset_mesh)
+                {
+                  if(!offset_mesh)
+                  {
+                    QApplication::restoreOverrideCursor();
+
+                    Three::getMutex()->lock();
+                    Three::isLocked() = false;
+                    Three::getMutex()->unlock();
+
+                    return;
+                  }
+
+                  Scene_surface_mesh_item* offset_item = new Scene_surface_mesh_item(offset_mesh);
+                  offset_item->setName(tr("%1 offset %5 (%2 %3 %4)").arg(item->name())
+                                                                   .arg(angle)
+                                                                   .arg(sizing)
+                                                                   .arg(approx)
+                                                                   .arg(offset_value));
+                  offset_item->setColor(Qt::magenta);
+                  offset_item->setRenderingMode(Wireframe);
+                  Three::scene()->addItem(offset_item);
+
+                  QApplication::restoreOverrideCursor();
+
+                  Three::getMutex()->lock();
+                  Three::isLocked() = false;
+                  Three::getMutex()->unlock();
+                });
+
+  QMessageBox* message_box = new QMessageBox(QMessageBox::NoIcon,
+                                             "Meshing",
+                                             "Offset meshing in progress...",
+                                             QMessageBox::Cancel,
+                                             mw);
+  message_box->setDefaultButton(QMessageBox::Cancel);
+  QAbstractButton* cancelButton = message_box->button(QMessageBox::Cancel);
+  cancelButton->setText(tr("Stop"));
+
+  connect(cancelButton, &QAbstractButton::clicked,
+          this, [worker](){ worker->terminate(); });
+  connect(worker, &Mesher_thread::finished,
+          message_box, &QMessageBox::close);
+
+  Three::getMutex()->lock();
+  Three::isLocked() = true;
+  Three::getMutex()->unlock();
+
+  message_box->open();
+  worker->start();
+}
+
+void
+Polyhedron_demo_offset_meshing_plugin::
+inflate_mesh()
+{
+  const Scene_interface::Item_id index = scene->mainSelectionIndex();
+  Scene_item* item = scene->item(index);
+  if(item == nullptr)
+    return;
+
+  Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
+  if(sm_item == nullptr)
+    return;
+
+  SMesh* sMesh = sm_item->face_graph();
+  if(sMesh == nullptr)
+    return;
+
+  const double diag = sm_item->bboxDiagonal();
+
+  bool ok = true;
+  const double offset_value = QInputDialog::getDouble(mw,
+                                                      QString("Choose Inflate Distance"),
+                                                      QString("Inflate Distance (use a negative number to deflate)"),
+                                                      0.1 * diag,
+                                                      -(std::numeric_limits<double>::max)(),
+                                                      (std::numeric_limits<double>::max)(),
+                                                      10,
+                                                      &ok);
+  if(!ok)
+    return;
+
+  auto vpm = get(CGAL::vertex_point, *sMesh);
+  auto vnm = sMesh->property_map<vertex_descriptor, EPICK::Vector_3 >("v:normal").first;
+
+  QApplication::setOverrideCursor(Qt::WaitCursor);
+
+  for(const auto& v : vertices(*sMesh))
+  {
+    const EPICK::Vector_3& n = get(vnm, v);
+    put(vpm, v, get(vpm, v) + offset_value * n);
+  }
+
+  sm_item->invalidateOpenGLBuffers();
+  sm_item->itemChanged();
+  sm_item->itemVisibilityChanged();
+
+  QApplication::restoreOverrideCursor();
+}
+
+#include "Offset_meshing_plugin.moc"
+
+#endif // CGAL_POLYHEDRON_DEMO_USE_SURFACE_MESHER
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
index 508716a21e10..845dedbc31f3 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
@@ -41,18 +41,6 @@ if(NOT CGAL_DISABLE_GMP)
   polyhedron_demo_plugin(mesh_simplification_plugin Mesh_simplification_plugin ${mesh_simplificationUI_FILES})
   target_link_libraries(mesh_simplification_plugin PUBLIC scene_surface_mesh_item scene_selection_item)
 
-  qt5_wrap_ui(remeshingUI_FILES Remeshing_dialog.ui)
-  polyhedron_demo_plugin(offset_meshing_plugin Offset_meshing_plugin
-                         ${remeshingUI_FILES})
-  target_link_libraries(offset_meshing_plugin PUBLIC scene_surface_mesh_item
-                                                     scene_polygon_soup_item
-                                                     scene_polylines_item)
-  if(TARGET CGAL::Eigen3_support)
-    target_link_libraries(offset_meshing_plugin PUBLIC CGAL::Eigen3_support)
-  endif()
-  if(TARGET CGAL::TBB_support)
-    target_link_libraries(offset_meshing_plugin PUBLIC CGAL::TBB_support)
-  endif()
 
   qt5_wrap_ui(shortestPathUI_FILES Shortest_path_widget.ui)
   polyhedron_demo_plugin(shortest_path_plugin Shortest_path_plugin
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp
deleted file mode 100644
index 860cc2d66e9d..000000000000
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp
+++ /dev/null
@@ -1,691 +0,0 @@
-#include "config.h"
-#ifdef CGAL_POLYHEDRON_DEMO_USE_SURFACE_MESHER
-#include <CGAL/Three/Polyhedron_demo_plugin_interface.h>
-#include "ui_Remeshing_dialog.h"
-
-#include <QObject>
-#include <QAction>
-#include <QMainWindow>
-#include <QMenu>
-#include <QApplication>
-#include <QtPlugin>
-#include <QThread>
-#include "Scene_surface_mesh_item.h"
-#include "Scene_polygon_soup_item.h"
-#include "Scene_polylines_item.h"
-#include <QInputDialog>
-#include <QStringList>
-#include <QMessageBox>
-#include <QAbstractButton>
-
-#include "C3t3_type.h"
-
-#include <CGAL/AABB_tree.h>
-#include <CGAL/AABB_traits.h>
-#include <CGAL/AABB_face_graph_triangle_primitive.h>
-
-#include <CGAL/Side_of_triangle_mesh.h>
-#include <CGAL/Polygon_mesh_processing/bbox.h>
-#include <CGAL/Polygon_mesh_processing/orientation.h>
-
-#include <CGAL/Timer.h>
-#include <CGAL/make_mesh_3.h>
-#include <CGAL/Labeled_mesh_domain_3.h>
-#include <CGAL/Mesh_domain_with_polyline_features_3.h>
-#include <CGAL/Mesh_criteria_3.h>
-#include <CGAL/Three/Three.h>
-
-#include <CGAL/facets_in_complex_3_to_triangle_mesh.h>
-
-#include <memory> // std::shared_ptr
-
-namespace CGAL{
-
-template <class TriangleMesh, class GeomTraits>
-class Offset_function
-{
-  typedef AABB_face_graph_triangle_primitive<TriangleMesh> Primitive;
-  typedef AABB_traits<GeomTraits, Primitive> Traits;
-  typedef AABB_tree<Traits> Tree;
-  typedef Side_of_triangle_mesh<TriangleMesh, GeomTraits> Side_of;
-
-public:
-
-  Offset_function(TriangleMesh& tm, double offset_distance)
-    : m_tree_ptr(new Tree(boost::begin(faces(tm)),
-                          boost::end(faces(tm)),
-                          tm) )
-    , m_side_of_ptr( new Side_of(*m_tree_ptr) )
-    , m_offset_distance(offset_distance)
-    , m_is_closed( is_closed(tm) )
-  {
-    CGAL_assertion(!m_tree_ptr->empty());
-  }
-
-  double operator()(const typename GeomTraits::Point_3& p) const
-  {
-    using CGAL::sqrt;
-
-    Bounded_side side = m_is_closed?m_side_of_ptr->operator()(p):ON_UNBOUNDED_SIDE;
-    if (side==ON_BOUNDARY) return m_offset_distance;
-
-    typename GeomTraits::Point_3 closest_point = m_tree_ptr->closest_point(p);
-    double distance = sqrt(squared_distance(p, closest_point));
-
-    return (side == ON_UNBOUNDED_SIDE ? -distance : distance) + m_offset_distance;
-  }
-
-private:
-  std::shared_ptr<Tree> m_tree_ptr;
-  std::shared_ptr<Side_of> m_side_of_ptr;
-  double m_offset_distance;
-  bool m_is_closed;
-
-};
-
-class Polygon_soup_offset_function {
-  typedef Scene_polygon_soup_item::Points Points;
-  typedef Scene_polygon_soup_item::Polygons Polygons;
-
-  typedef Polygons::const_iterator Polygon_iterator;
-
-
-  class Polygon_soup_point_property_map {
-    const Points* points_vector_ptr;
-  public:
-    typedef Polygon_iterator key_type;
-    typedef EPICK::Point_3 value_type;
-    typedef const value_type& reference;
-    typedef boost::readable_property_map_tag category;
-
-    Polygon_soup_point_property_map() = default;
-    Polygon_soup_point_property_map(const Points* ptr)
-      : points_vector_ptr(ptr)
-    {}
-
-    friend reference get(Polygon_soup_point_property_map map,
-                         key_type polygon_it)
-    {
-      return (*map.points_vector_ptr)[*polygon_it->begin()];
-    }
-  };
-
-
-  class Polygon_soup_triangle_property_map {
-    const Points* points_vector_ptr;
-  public:
-    typedef Polygon_iterator key_type;
-    typedef EPICK::Triangle_3 value_type;
-    typedef value_type reference;
-    typedef boost::readable_property_map_tag category;
-
-    Polygon_soup_triangle_property_map() = default;
-    Polygon_soup_triangle_property_map(const Points* ptr)
-      : points_vector_ptr(ptr)
-    {}
-
-    friend value_type get(Polygon_soup_triangle_property_map map,
-                          key_type polygon_it)
-    {
-      auto it = polygon_it->begin();
-      CGAL_assertion(it != polygon_it->end());
-      const auto id0 = *it++;
-      CGAL_assertion(it != polygon_it->end());
-      const auto id1 = *it++;
-      CGAL_assertion(it != polygon_it->end());
-      const auto id2 = *it++;
-      CGAL_assertion(it == polygon_it->end());
-
-      return value_type( (*map.points_vector_ptr)[id0],
-                         (*map.points_vector_ptr)[id1],
-                         (*map.points_vector_ptr)[id2] );
-    }
-  };
-
-  struct AABB_primitive :
-    public CGAL::AABB_primitive<Polygon_iterator,
-                                Polygon_soup_triangle_property_map,
-                                Polygon_soup_point_property_map,
-                                CGAL::Tag_true,
-                                CGAL::Tag_false>
-  {
-    typedef CGAL::AABB_primitive<Polygon_iterator,
-                                 Polygon_soup_triangle_property_map,
-                                 Polygon_soup_point_property_map,
-                                 CGAL::Tag_true,
-                                 CGAL::Tag_false> Base;
-
-    typedef Polygon_iterator Id;
-
-    template <typename ObjectPmap, typename PointPmap>
-    AABB_primitive(Id id, ObjectPmap&& opmap, PointPmap&& ppmap)
-      : Base(id, std::forward<ObjectPmap>(opmap), std::forward<PointPmap>(ppmap))
-    {}
-
-    template <typename Iterator, typename ObjectPmap, typename PointPmap>
-    AABB_primitive(Iterator it, ObjectPmap&& opmap, PointPmap&& ppmap)
-      : Base(*it, std::forward<ObjectPmap>(opmap), std::forward<PointPmap>(ppmap))
-    {}
-  }; // end struct template AABB_primitive
-
-
-  typedef CGAL::AABB_traits<EPICK, AABB_primitive> AABB_traits;
-  typedef CGAL::AABB_tree<AABB_traits> AABB_tree;
-
-  std::shared_ptr<AABB_tree> m_tree_ptr;
-  double m_offset_distance;
-
-  typedef Polygon_soup_triangle_property_map ObjectPmap;
-  typedef Polygon_soup_point_property_map    PointPmap;
-public:
-  Polygon_soup_offset_function(const Scene_polygon_soup_item* soup,
-                               const double offset_distance)
-    : m_tree_ptr
-      (std::make_shared<AABB_tree>(begin(soup->polygons()),
-                                   end(soup->polygons()),
-                                   ObjectPmap(&soup->points()),
-                                   PointPmap(&soup->points()))
-       )
-    , m_offset_distance(offset_distance)
-  {
-    CGAL_assertion(! m_tree_ptr->empty() );
-  }
-
-  double operator()(const EPICK::Point_3& p) const
-  {
-    using CGAL::sqrt;
-
-    EPICK::Point_3 closest_point = m_tree_ptr->closest_point(p);
-    double distance = sqrt(squared_distance(p, closest_point));
-
-    return m_offset_distance - distance;
-  }
-
-}; // end class Polygon_soup_offset_function
-
-} //end of CGAL namespace
-
-Scene_surface_mesh_item* make_item(SMesh* sm)
-{
-  return new Scene_surface_mesh_item(sm);
-}
-
-CGAL::Offset_function<SMesh, EPICK>
-offset_function(SMesh* surface_mesh_ptr, double offset_value) {
-  return { *surface_mesh_ptr, offset_value };
-}
-
-CGAL::Polygon_soup_offset_function
-offset_function(Scene_polygon_soup_item* item, double offset_value) {
-  return { item, offset_value };
-}
-
-template <typename T>
-struct Result_type {
-  typedef T type;
-};
-
-template <>
-struct Result_type<Scene_polygon_soup_item> {
-  typedef SMesh type;
-};
-
-template <typename Mesh>
-CGAL::Bbox_3 bbox(Mesh* mesh_ptr) {
-  return CGAL::Polygon_mesh_processing::bbox(*mesh_ptr);
-}
-
-CGAL::Bbox_3 bbox(Scene_polygon_soup_item* item) {
-  return item->bbox();
-}
-class MeshGuard{
-  SMesh* mesh;
-  bool done;
-public:
-  MeshGuard(SMesh* mesh):mesh(mesh), done(false){}
-  void setDone(){done = true;}
-  ~MeshGuard(){
-    if(!done)
-      delete mesh;
-  }
-};
-// declare the CGAL function
-template<class Mesh>
-SMesh* cgal_off_meshing(QWidget*,
-                        Mesh* tm_ptr,
-                        Scene_polylines_item* polylines_item,
-                        const double offset_value,
-                        const double angle,
-                        const double sizing,
-                        const double approx,
-                        const double edge_size,
-                        int tag)
-{
-  typedef EPICK GT;
-  typedef CGAL::Labeled_mesh_domain_3<GT, int, int> Mesh_domain_base;
-  typedef CGAL::Mesh_domain_with_polyline_features_3<Mesh_domain_base> Mesh_domain;
-  typedef C3t3::Triangulation Tr;
-  typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
-  typedef GT::Sphere_3 Sphere_3;
-
-  CGAL::Bbox_3 bbox = ::bbox(tm_ptr);
-
-  GT::Point_3 center((bbox.xmax()+bbox.xmin())/2,
-                     (bbox.ymax()+bbox.ymin())/2,
-                     (bbox.zmax()+bbox.zmin())/2);
-  double sqrad = 0.6 * std::sqrt( CGAL::square(bbox.xmax()-bbox.xmin())+
-                                  CGAL::square(bbox.ymax()-bbox.ymin())+
-                                  CGAL::square(bbox.zmax()-bbox.zmin()) )
-                + offset_value;
-  sqrad=CGAL::square(sqrad);
-
-  CGAL::Timer timer;
-  timer.start();
-
-  namespace p = CGAL::parameters;
-
-  Mesh_domain domain =
-    Mesh_domain::create_implicit_mesh_domain
-    (p::function = offset_function(tm_ptr, offset_value),
-     p::bounding_object = Sphere_3(center, sqrad),
-     p::relative_error_bound = 1e-7,
-     p::construct_surface_patch_index = [](int i, int j) { return (i * 1000 + j); });
-
-  const CGAL::Mesh_facet_topology topology = CGAL::FACET_VERTICES_ON_SAME_SURFACE_PATCH;
-  auto manifold_option = p::non_manifold();
-  if(tag == 1) manifold_option = p::manifold_with_boundary();
-  if(tag == 2) manifold_option = p::manifold();
-  Mesh_criteria criteria(p::facet_angle = angle,
-                         p::facet_size = sizing,
-                         p::facet_distance = approx,
-                         p::facet_topology = topology,
-                         p::edge_size = edge_size);
-
-  if (polylines_item!=nullptr)
-  {
-    typedef std::vector<Mesh_domain::Surface_patch_index> Surface_patch_ids;
-    std::vector<Mesh_domain::Surface_patch_index> surface_patch_ids;
-
-    domain.add_features_and_incidences(polylines_item->polylines.begin(),
-                                       polylines_item->polylines.end(),
-                                       CGAL::Identity_property_map<Scene_polylines_item::Polyline>(),
-                                       CGAL::Constant_property_map<Scene_polylines_item::Polyline, Surface_patch_ids>(
-                                         surface_patch_ids));
-  }
-
-  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
-                                      p::no_perturb(),
-                                      p::no_exude(),
-                                      manifold_option);
-
-  const Tr& tr = c3t3.triangulation();
-
-  timer.stop();
-  std::cerr << "done (" << timer.time() << " ms, " << tr.number_of_vertices() << " vertices)" << std::endl;
-
-  if(tr.number_of_vertices() > 0)
-  {
-    typedef typename Result_type<Mesh>::type Result_mesh;
-    // add remesh as new polyhedron
-    Result_mesh *pRemesh = new Result_mesh;
-    //if the thread is interrupted before the mesh is returned, delete it.
-    MeshGuard guard(pRemesh);
-    CGAL::facets_in_complex_3_to_triangle_mesh(c3t3, *pRemesh);
-    guard.setDone();
-    if(CGAL::is_closed(*pRemesh)
-       && ! CGAL::Polygon_mesh_processing::is_outward_oriented(*pRemesh))
-    {
-      CGAL::Polygon_mesh_processing::reverse_face_orientations(*pRemesh);
-    }
-
-    return pRemesh;
-  }
-  else
-    return nullptr;
-}
-
-struct Mesher_thread:public QThread{
-  Q_OBJECT
-
-private:
-  SMesh* sMesh;
-  Scene_polygon_soup_item* soup_item;
-  Scene_polylines_item* polylines_item;
-  const double offset_value;
-  const double angle;
-  const double sizing;
-  const double approx;
-  const double edge_size;
-  int tag_index;
-public:
-  Mesher_thread( SMesh* tm_ptr,
-                 Scene_polygon_soup_item* soup_item,
-                 Scene_polylines_item* polylines_item,
-                 const double offset_value,
-                 const double angle,
-                 const double sizing,
-                 const double approx,
-                 const double edge_size,
-                 int tag)
-    :sMesh(tm_ptr), soup_item(soup_item), polylines_item(polylines_item),
-      offset_value(offset_value), angle(angle),
-      sizing(sizing), approx(approx), edge_size(edge_size), tag_index(tag){
-  }
-  void run() override {
-    SMesh* new_mesh= nullptr;
-    if(soup_item)
-      new_mesh = cgal_off_meshing(CGAL::Three::Three::mainWindow(),
-                                  soup_item,
-                                  polylines_item,
-                                  offset_value,
-                                  angle,
-                                  sizing,
-                                  approx,
-                                  edge_size,
-                                  tag_index);
-    else
-      new_mesh = cgal_off_meshing(CGAL::Three::Three::mainWindow(),
-                                  sMesh,
-                                  polylines_item,
-                                  offset_value,
-                                  angle,
-                                  sizing,
-                                  approx,
-                                  edge_size,
-                                  tag_index);
-    CGAL::Three::Three::getMutex()->lock();
-    CGAL::Three::Three::getWaitCondition()->wakeAll();
-    CGAL::Three::Three::getMutex()->unlock();
-    Q_EMIT resultReady(new_mesh);
-  }
-Q_SIGNALS:
-  void resultReady(SMesh *new_mesh);
-};
-
-using namespace CGAL::Three;
-class Polyhedron_demo_offset_meshing_plugin :
-  public QObject,
-  protected Polyhedron_demo_plugin_interface
-{
-  Q_OBJECT
-  Q_INTERFACES(CGAL::Three::Polyhedron_demo_plugin_interface)
-  Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0")
-
-public:
-  void init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* scene_interface, Messages_interface*) {
-    this->scene = scene_interface;
-    this->mw = mainWindow;
-    actionOffsetMeshing = new QAction(tr("Offset Meshing"), mw);
-    actionOffsetMeshing->setProperty("subMenuName", "3D Surface Mesh Generation");
-    if(actionOffsetMeshing) {
-      connect(actionOffsetMeshing, SIGNAL(triggered()),
-              this, SLOT(offset_meshing()));
-    }
-
-    actionInflateMesh= new QAction(tr("Inflate Mesh"), mw);
-    actionInflateMesh->setProperty("subMenuName", "Operations on Polyhedra");
-    if(actionInflateMesh) {
-      connect(actionInflateMesh, SIGNAL(triggered()),
-              this, SLOT(inflate_mesh()));
-    }
-  }
-
-  bool applicable(QAction*) const {
-    if ( scene->selectionIndices().size() != 1 &&
-         scene->selectionIndices().size() != 2 )
-    {
-      return false;
-    }
-
-    Q_FOREACH(CGAL::Three::Scene_interface::Item_id index, scene->selectionIndices())
-    {
-      if ( qobject_cast<Scene_surface_mesh_item*>(scene->item(index)) ||
-           qobject_cast<Scene_polygon_soup_item*>(scene->item(index)) )
-        return true;
-    }
-    return false;
-  }
-
-  QList<QAction*> actions() const {
-    return QList<QAction*>() << actionOffsetMeshing
-                             << actionInflateMesh;
-  }
-public Q_SLOTS:
-  void offset_meshing();
-  void inflate_mesh();
-
-private:
-  QAction* actionOffsetMeshing;
-  QAction* actionInflateMesh;
-  Scene_interface *scene;
-  QMainWindow *mw;
-}; // end class Polyhedron_demo_offset_meshing_plugin
-
-void Polyhedron_demo_offset_meshing_plugin::inflate_mesh()
-{
-  const CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
-  Scene_item* item = scene->item(index);
-  if(item == nullptr){
-    return;
-  }
-
-  Scene_surface_mesh_item* sm_item =
-      qobject_cast<Scene_surface_mesh_item*>(item);
-
-  if(sm_item == nullptr){
-    return;
-  }
-
-  SMesh* sMesh = sm_item->face_graph();
-
-  if(sMesh == nullptr){
-    return;
-  }
-
-  double diag = sm_item->diagonalBbox();
-  double offset_value = QInputDialog::getDouble(mw,
-                                                QString("Choose Inflate Distance"),
-                                                QString("Inflate Distance (use negative number for deflate)"),
-                                                0.1*diag,
-                                                -(std::numeric_limits<double>::max)(),
-                                                (std::numeric_limits<double>::max)(), 10);
-
-  auto vpm = get(CGAL::vertex_point,*sMesh);
-  auto vnm =
-      sMesh->property_map<vertex_descriptor, EPICK::Vector_3 >("v:normal").first;
-
-  for(const auto& v : vertices(*sMesh))
-  {
-    Point_3 p = get(vpm, v);
-    EPICK::Vector_3 n = get(vnm, v);
-    n/=(CGAL::sqrt(n.squared_length()));
-    put(vpm, v, p + offset_value*n);
-  }
-  sm_item->invalidateOpenGLBuffers();
-}
-
-void Polyhedron_demo_offset_meshing_plugin::offset_meshing()
-{
-  Scene_surface_mesh_item* sm_item = nullptr;
-  Scene_polygon_soup_item* soup_item = nullptr;
-  Scene_polylines_item* polylines_item = nullptr;
-  Scene_item* item = nullptr;
-
-  bool mesh_or_soup_item_found = false;
-
-  Q_FOREACH(CGAL::Three::Scene_interface::Item_id index, scene->selectionIndices())
-  {
-    if (!mesh_or_soup_item_found)
-    {
-      sm_item = qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
-      if (sm_item == nullptr)
-      {
-        soup_item = qobject_cast<Scene_polygon_soup_item*>(item);
-        if (soup_item != nullptr)
-        {
-          item=scene->item(index);
-          mesh_or_soup_item_found = true;
-          continue;
-        }
-      }
-      else
-      {
-        item=scene->item(index);
-        mesh_or_soup_item_found = true;
-        continue;
-      }
-    }
-    polylines_item = qobject_cast<Scene_polylines_item*>(scene->item(index));
-  }
-
-  SMesh* sMesh = nullptr;
-  double diag = 0;
-  Scene_item::Bbox box;
-  if(sm_item)
-  {
-    sMesh = sm_item->face_graph();
-    if(!sMesh)
-      return;
-    box = bbox(sMesh);
-  }
-  else if(soup_item != nullptr)
-  {
-    box = bbox(soup_item);
-  }
-  else if(soup_item == nullptr)
-    return;
-  double X=(box.max)(0)-(box.min)(0),
-      Y = (box.max)(1)-(box.min)(1),
-      Z = (box.max)(2)-(box.min)(2);
-  diag = CGAL::sqrt(X*X+Y*Y+Z*Z);
-  double offset_value = QInputDialog::getDouble(mw,
-                                                QString("Choose Offset Value"),
-                                                QString("Offset Value (use negative number for inset)"),
-                                                0.1*diag,
-                                                -(std::numeric_limits<double>::max)(),
-                                                (std::numeric_limits<double>::max)(), 10);
-
-  QDialog dialog(mw);
-  Ui::Remeshing_dialog ui;
-  ui.setupUi(&dialog);
-  ui.angle->setRange(1.0, 30.0);
-  connect(ui.buttonBox, SIGNAL(accepted()),
-          &dialog, SLOT(accept()));
-  connect(ui.buttonBox, SIGNAL(rejected()),
-          &dialog, SLOT(reject()));
-
-  ui.sizing->setRange(diag * 10e-6, // min
-                      diag); // max
-  ui.sizing->setValue(diag * 0.05); // default value
-
-  ui.approx->setRange(diag * 10e-7, // min
-                      diag); // max
-  ui.approx->setValue(diag * 0.005);
-
-  if (polylines_item!=nullptr)
-  {
-    ui.edge_sizing->setRange(diag * 10e-6, // min
-                        diag); // max
-    ui.edge_sizing->setValue(diag * 0.05); // default value
-  }
-  else
-    ui.edge_sizing->setEnabled(false);
-
-  int i = dialog.exec();
-  if(i == QDialog::Rejected)
-    return;
-
-  const double angle = ui.angle->value();
-  const double approx = ui.approx->value();
-  const double sizing = ui.sizing->value();
-  const double edge_size=polylines_item!=nullptr?ui.edge_sizing->value():0;
-  const int tag_index = ui.tags->currentIndex();
-
-  if(tag_index < 0) return;
-
-  QApplication::setOverrideCursor(Qt::WaitCursor);
-
-  std::cerr << "mesh with:"
-            << "\n  angle=" << angle
-            << "\n  sizing=" << sizing
-            << "\n  approx=" << approx
-            << "\n  tag=" << tag_index
-            << std::boolalpha
-            << std::endl;
-  Mesher_thread* worker = nullptr;
-  if(soup_item)
-    worker = new Mesher_thread(nullptr,
-                               soup_item,
-                               polylines_item,
-                               offset_value,
-                               angle,
-                               sizing,
-                               approx,
-                               edge_size,
-                               tag_index);
-  else
-    worker = new Mesher_thread(sMesh,
-                               nullptr,
-                               polylines_item,
-                               offset_value,
-                               angle,
-                               sizing,
-                               approx,
-                               edge_size,
-                               tag_index);
-  connect(worker, &QThread::finished, worker, &QObject::deleteLater);
-  connect(worker, &Mesher_thread::resultReady, this,
-          [item, angle, sizing, approx, offset_value/* , index */]
-          (SMesh *new_mesh){
-    QApplication::restoreOverrideCursor();
-    if(!new_mesh){
-      CGAL::Three::Three::getMutex()->lock();
-      CGAL::Three::Three::isLocked() = false;
-      CGAL::Three::Three::getMutex()->unlock();
-      return;
-    }
-    Scene_surface_mesh_item* new_item = new Scene_surface_mesh_item(new_mesh);
-    new_item->setName(tr("%1 offset %5 (%2 %3 %4)")
-                      .arg(item->name())
-                      .arg(angle)
-                      .arg(sizing)
-                      .arg(approx)
-                      .arg(offset_value));
-    new_item->setColor(Qt::magenta);
-    new_item->setWireframeMode();
-    CGAL::Three::Three::scene()->addItem(new_item);
-//    CGAL::Three::Three::scene()->itemChanged(index);
-    QApplication::restoreOverrideCursor();
-    CGAL::Three::Three::getMutex()->lock();
-    CGAL::Three::Three::isLocked() = false;
-    CGAL::Three::Three::getMutex()->unlock();
-  });
-  QMessageBox* message_box = new QMessageBox(QMessageBox::NoIcon,
-                                             "Meshing",
-                                             "Offset meshing in progress...",
-                                             QMessageBox::Cancel,
-                                             mw);
-  message_box->setDefaultButton(QMessageBox::Cancel);
-  QAbstractButton* cancelButton = message_box->button(QMessageBox::Cancel);
-  cancelButton->setText(tr("Stop"));
-
-  connect(cancelButton, &QAbstractButton::clicked,
-          this, [worker](){
-    worker->terminate();
-    QApplication::restoreOverrideCursor();//waitcursor
-    QApplication::restoreOverrideCursor();//busycursor
-  });
-  connect(worker, &Mesher_thread::finished,
-          message_box, &QMessageBox::close);
-  message_box->open();
-
-  QApplication::setOverrideCursor(Qt::BusyCursor);
-  CGAL::Three::Three::getMutex()->lock();
-  CGAL::Three::Three::isLocked() = true;
-  CGAL::Three::Three::getMutex()->unlock();
-  worker->start();
-}
-
-#include "Offset_meshing_plugin.moc"
-
-#endif // CGAL_POLYHEDRON_DEMO_USE_SURFACE_MESHER

From 45c7b0015f8f54e8f2fb517b6f5bc54181979467 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 12 Jun 2023 10:55:56 +0200
Subject: [PATCH 0340/1398] add stop

---
 .../examples/Polygon_mesh_processing/soup_autorefinement.cpp     | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index 823c50974dcc..9e4999287f7b 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -37,6 +37,7 @@ int main(int argc, char** argv)
   PMP::autorefine_soup_output(input_points, input_triangles,
                               output_points, output_triangles,
                               CGAL::parameters::concurrency_tag(CGAL::Parallel_if_available_tag()));
+  t.stop();
   std::cout << "#points = " << output_points.size() << " and #triangles = " << output_triangles.size() << " in " << t.time() << " sec." << std::endl;
   CGAL::IO::write_polygon_soup("autorefined.off", output_points, output_triangles, CGAL::parameters::stream_precision(17));
 

From 41449d71cd3c3d7b8be578f0e3f56a3a14fc5842 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 12 Jun 2023 11:05:11 +0200
Subject: [PATCH 0341/1398] fix bug when setting the ids of points

2 options, one with mutex and one without. As this section is not critical,
we do not really see a runtime difference (without mutex seems faster so
I pick that one as default)
---
 .../Polygon_mesh_processing/autorefinement.h  | 127 ++++++++++++++----
 1 file changed, 102 insertions(+), 25 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 11b15fa4ec47..9bbc67efb487 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -43,6 +43,9 @@
 #include <tbb/concurrent_vector.h>
 #include <tbb/concurrent_map.h>
 #include <tbb/parallel_for.h>
+#ifdef SET_POINT_IDS_USING_MUTEX
+#include <CGAL/mutex.h>
+#endif
 #endif
 
 #include <vector>
@@ -1242,12 +1245,17 @@ void autorefine_soup_output(const PointRange& input_points,
     }
   }
 #ifdef USE_DEBUG_PARALLEL_TIMERS
+  t.stop();
   std::cout << t.time() << " sec. for #2" << std::endl;
+  t.reset();
 #endif
 
 #ifdef DEDUPLICATE_SEGMENTS
+#ifdef USE_DEBUG_PARALLEL_TIMERS
+  t.start();
+#endif
+
   // deduplicate inserted segments
-  //TODO: PARALLEL_FOR #3
   std::vector<std::vector<std::pair<std::size_t, std::size_t>>> all_segments_ids(all_segments.size());
 
   auto deduplicate_inserted_segments = [&](std::size_t ti)
@@ -1313,7 +1321,9 @@ void autorefine_soup_output(const PointRange& input_points,
   }
 
 #ifdef USE_DEBUG_PARALLEL_TIMERS
+  t.stop();
   std::cout << t.time() << " sec. for #3" << std::endl;
+  t.reset();
 #endif
 #endif
 
@@ -1370,7 +1380,6 @@ void autorefine_soup_output(const PointRange& input_points,
 
 
 #ifdef USE_DEBUG_PARALLEL_TIMERS
-  t.reset();
   t.start();
 #endif
 #ifdef CGAL_LINKED_WITH_TBB
@@ -1427,8 +1436,7 @@ void autorefine_soup_output(const PointRange& input_points,
     return insert_res.first->second;
   };
 
-
-
+  // TODO: parallel_for?
   std::vector <std::size_t> input_point_ids;
   input_point_ids.reserve(input_points.size());
   for (const auto& p : input_points)
@@ -1451,9 +1459,7 @@ void autorefine_soup_output(const PointRange& input_points,
   }
 
   // import refined triangles
-    //TODO: PARALLEL_FOR #4
 #ifdef USE_DEBUG_PARALLEL_TIMERS
-  t.reset();
   t.start();
 #endif
 
@@ -1466,37 +1472,108 @@ void autorefine_soup_output(const PointRange& input_points,
 #ifdef CGAL_LINKED_WITH_TBB
   if(parallel_execution && new_triangles.size() > 100)
   {
-    tbb::concurrent_vector<Point_3> concurrent_soup_points;
+
+#ifdef SET_POINT_IDS_USING_MUTEX
+    //option 1 (using a mutex)
+    CGAL_MUTEX point_container_mutex;
     /// Lambda concurrent_get_point_id()
-    auto concurrent_get_point_id = [&](const typename EK::Point_3& pt)
+    auto concurrent_get_point_id = [&](const typename EK::Point_3 pt)
     {
-        auto insert_res = point_id_map.insert(std::make_pair(pt, concurrent_soup_points.size()));
-        if (insert_res.second)
-        {
-            concurrent_soup_points.push_back(to_input(pt));
+      auto insert_res = point_id_map.insert(std::make_pair(pt, -1));
+
+      if (insert_res.second)
+      {
+        CGAL_SCOPED_LOCK(point_container_mutex);
+        insert_res.first->second=soup_points.size();
+        soup_points.push_back(to_input(pt));
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
-            exact_soup_points.push_back(pt);
+        exact_soup_points.push_back(pt);
 #endif
-        }
-        return insert_res.first->second;
+      }
+      return insert_res.first;
     };
 
+    soup_triangles.resize(offset + new_triangles.size());
+    //use map iterator triple for triangles to create them concurrently and safely
+    std::vector<std::array<tbb::concurrent_map<EK::Point_3, std::size_t>::iterator, 3>> triangle_buffer(new_triangles.size());
+    tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
+      [&](const tbb::blocked_range<size_t>& r) {
+        for (size_t ti = r.begin(); ti != r.end(); ++ti) {
+          const std::array<EK::Point_3, 3>& t = new_triangles[ti];
+          triangle_buffer[ti] = CGAL::make_array(concurrent_get_point_id(t[0]), concurrent_get_point_id(t[1]), concurrent_get_point_id(t[2]));
+        }
+      }
+    );
+    tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
+      [&](const tbb::blocked_range<size_t>& r) {
+          for (size_t ti = r.begin(); ti != r.end(); ++ti)
+          {
+            soup_triangles[offset + ti] =
+              CGAL::make_array(triangle_buffer[ti][0]->second,
+                               triangle_buffer[ti][1]->second,
+                               triangle_buffer[ti][2]->second);
+          }
+        }
+    );
+#else
+    //option 2 (without mutex)
+    /// Lambda concurrent_get_point_id()
+    tbb::concurrent_vector<tbb::concurrent_map<EK::Point_3, std::size_t>::iterator> iterators;
+    auto concurrent_get_point_id = [&](const typename EK::Point_3 pt)
+    {
+      auto insert_res = point_id_map.insert(std::make_pair(pt, -1));
+      if (insert_res.second)
+        iterators.push_back(insert_res.first);
+      return insert_res.first;
+    };
 
+    //use map iterator triple for triangles to create them concurrently and safely
     soup_triangles.resize(offset + new_triangles.size());
+    std::vector<std::array<tbb::concurrent_map<EK::Point_3, std::size_t>::iterator, 3>> triangle_buffer(new_triangles.size());
     tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
-        [&](const tbb::blocked_range<size_t>& r) {
-            for (size_t ti = r.begin(); ti != r.end(); ++ti) {
-                if (offset + ti > soup_triangles.size()) {
-                    std::cout << "ti = " << ti << std::endl;
-                }
-                const std::array<EK::Point_3, 3>& t = new_triangles[ti];
-                soup_triangles[offset + ti] = CGAL::make_array(concurrent_get_point_id(t[0]), concurrent_get_point_id(t[1]), concurrent_get_point_id(t[2]));
-            }
+      [&](const tbb::blocked_range<size_t>& r) {
+        for (size_t ti = r.begin(); ti != r.end(); ++ti) {
+          if (offset + ti > soup_triangles.size()) {
+              std::cout << "ti = " << ti << std::endl;
+          }
+          const std::array<EK::Point_3, 3>& t = new_triangles[ti];
+          triangle_buffer[ti] = CGAL::make_array(concurrent_get_point_id(t[0]), concurrent_get_point_id(t[1]), concurrent_get_point_id(t[2]));
+        }
+      }
+    );
+
+    // the map is now filled we can safely set the point ids
+    std::size_t pid_offset=soup_points.size();
+    soup_points.resize(pid_offset+iterators.size());
+#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
+    exact_soup_points.resize(soup_points.size());
+#endif
+
+    tbb::parallel_for(tbb::blocked_range<size_t>(0, iterators.size()),
+      [&](const tbb::blocked_range<size_t>& r) {
+        for (size_t ti = r.begin(); ti != r.end(); ++ti)
+        {
+          soup_points[pid_offset+ti] = to_input(iterators[ti]->first);
+#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
+          exact_soup_points[pid_offset+ti] = iterators[ti]->first;
+#endif
+          iterators[ti]->second=pid_offset+ti;
         }
+      }
     );
 
-    soup_points.reserve(soup_points.size() + concurrent_soup_points.size());
-    soup_points.insert(soup_points.end(), concurrent_soup_points.begin(), concurrent_soup_points.end());
+    tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
+      [&](const tbb::blocked_range<size_t>& r) {
+          for (size_t ti = r.begin(); ti != r.end(); ++ti)
+          {
+            soup_triangles[offset + ti] =
+              CGAL::make_array(triangle_buffer[ti][0]->second,
+                               triangle_buffer[ti][1]->second,
+                               triangle_buffer[ti][2]->second);
+          }
+        }
+    );
+#endif
   }
   else
 #endif

From ddb405a2c23db2416808271f9181804113cea5e8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 13 Jun 2023 10:40:06 +0200
Subject: [PATCH 0342/1398] move specialization into the header (avoid
 superflous include)

---
 Number_types/include/CGAL/Lazy_exact_nt.h     | 21 ++++++++++++++++++-
 .../internal/Exact_type_selector.h            | 16 --------------
 2 files changed, 20 insertions(+), 17 deletions(-)

diff --git a/Number_types/include/CGAL/Lazy_exact_nt.h b/Number_types/include/CGAL/Lazy_exact_nt.h
index 38c55c62d325..5af1544eb082 100644
--- a/Number_types/include/CGAL/Lazy_exact_nt.h
+++ b/Number_types/include/CGAL/Lazy_exact_nt.h
@@ -34,6 +34,8 @@
 #include <CGAL/Kernel/mpl.h>
 #include <CGAL/tss.h>
 #include <CGAL/type_traits.h>
+#include <CGAL/Number_types/internal/Exact_type_selector.h>
+
 
 #include<type_traits>
 
@@ -1427,7 +1429,24 @@ class Modular_traits<Lazy_exact_nt<ET> >
 #undef CGAL_int
 #undef CGAL_To_interval
 
-} //namespace CGAL
+namespace internal {
+
+template < typename ET >
+struct Exact_field_selector<Lazy_exact_nt<ET> >
+: Exact_field_selector<ET>
+{
+  // We have a choice here :
+  // - using ET gets rid of the DAG computation as well as redoing the interval
+  // - using Lazy_exact_nt<ET> might use sharper intervals.
+  // typedef ET  Type;
+  // typedef Lazy_exact_nt<ET>  Type;
+};
+template < typename ET >
+struct Exact_ring_selector<Lazy_exact_nt<ET> >
+: Exact_ring_selector<ET>
+{};
+
+} } //namespace CGAL::internal
 
 namespace Eigen {
   template<class> struct NumTraits;
diff --git a/Number_types/include/CGAL/Number_types/internal/Exact_type_selector.h b/Number_types/include/CGAL/Number_types/internal/Exact_type_selector.h
index f69df29f2bf7..f0d8e961c325 100644
--- a/Number_types/include/CGAL/Number_types/internal/Exact_type_selector.h
+++ b/Number_types/include/CGAL/Number_types/internal/Exact_type_selector.h
@@ -22,7 +22,6 @@
 #include <CGAL/number_type_basic.h>
 #include <CGAL/MP_Float.h>
 #include <CGAL/Quotient.h>
-#include <CGAL/Lazy_exact_nt.h>
 
 #include <CGAL/boost_mp.h>
 
@@ -280,21 +279,6 @@ struct Exact_ring_selector<Exact_NT_backend<BOOST_BACKEND>::Rational>
 { typedef Exact_NT_backend<BOOST_BACKEND>::Rational  Type; };
 #endif
 
-template < typename ET >
-struct Exact_field_selector<Lazy_exact_nt<ET> >
-: Exact_field_selector<ET>
-{
-  // We have a choice here :
-  // - using ET gets rid of the DAG computation as well as redoing the interval
-  // - using Lazy_exact_nt<ET> might use sharper intervals.
-  // typedef ET  Type;
-  // typedef Lazy_exact_nt<ET>  Type;
-};
-template < typename ET >
-struct Exact_ring_selector<Lazy_exact_nt<ET> >
-: Exact_ring_selector<ET>
-{};
-
 #ifndef CGAL_NO_DEPRECATED_CODE
 // Added for backward compatibility
 template < typename ET >

From 5564cb247f45a1c24ad3131a994a87126f97aef2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 20:08:58 +0200
Subject: [PATCH 0343/1398] bump CGAL version to 6.0

---
 Installation/include/CGAL/version.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Installation/include/CGAL/version.h b/Installation/include/CGAL/version.h
index d90474f89134..482cd7db1a64 100644
--- a/Installation/include/CGAL/version.h
+++ b/Installation/include/CGAL/version.h
@@ -17,12 +17,12 @@
 #define CGAL_VERSION_H
 
 #ifndef SWIG
-#define CGAL_VERSION 5.6-beta1
+#define CGAL_VERSION 6.0-beta1
 #define CGAL_GIT_HASH abcdef
 #endif
-#define CGAL_VERSION_NR 1050600910
+#define CGAL_VERSION_NR 1060000910
 #define CGAL_SVN_REVISION 99999
-#define CGAL_RELEASE_DATE 20230430
+#define CGAL_RELEASE_DATE 20231001
 
 #include <CGAL/version_macros.h>
 

From a9e1d599aa8bbe679bc8ae025b467c4db674c9ef Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Tue, 13 Jun 2023 12:45:58 +0200
Subject: [PATCH 0344/1398] more warnings lcc

---
 .../test/Linear_cell_complex/Linear_cell_complex_3_test.cpp    | 3 ++-
 .../test/Linear_cell_complex/Linear_cell_complex_4_test.cpp    | 3 ++-
 2 files changed, 4 insertions(+), 2 deletions(-)

diff --git a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.cpp b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.cpp
index c1d6eb4cdfef..6e04cbb07a3a 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.cpp
+++ b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_3_test.cpp
@@ -32,7 +32,8 @@ struct Myattrib : public  CGAL::Cell_attribute_with_point
 
 struct MonInfo
 {
-  MonInfo(int i=0) : mnb(i==0?rand():i), ptr(reinterpret_cast<char*>(this))
+  MonInfo(long long int i=0) : mnb(i==0?rand():static_cast<int>(i)),
+                               ptr(reinterpret_cast<char*>(this))
   {}
 
   bool operator==(const MonInfo& info) const
diff --git a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_4_test.cpp b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_4_test.cpp
index 737e6b965ba2..b4d882132755 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_4_test.cpp
+++ b/Linear_cell_complex/test/Linear_cell_complex/Linear_cell_complex_4_test.cpp
@@ -35,7 +35,8 @@ struct Myattrib : public  CGAL::Cell_attribute_with_point
 
 struct MonInfo
 {
-  MonInfo(int i=0) : mnb(i==0?rand():i), ptr(reinterpret_cast<char*>(this))
+  MonInfo(long long int i=0) : mnb(i==0?rand():static_cast<int>(i)),
+                               ptr(reinterpret_cast<char*>(this))
   {}
 
   bool operator==(const MonInfo& info) const

From 29b84248f844608560adeda5afd1641d38403612 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 23:08:22 +0200
Subject: [PATCH 0345/1398] missing 6.0 updates

# Conflicts:
#	Documentation/doc/resources/1.8.20/menu_version.js
#	Documentation/doc/resources/1.8.4/menu_version.js
#	Documentation/doc/resources/1.9.3/menu_version.js
---
 Documentation/doc/resources/1.8.13/menu_version.js  | 3 ++-
 Documentation/doc/resources/1.9.6/menu_version.js   | 3 ++-
 Installation/lib/cmake/CGAL/CGALConfigVersion.cmake | 6 +++---
 3 files changed, 7 insertions(+), 5 deletions(-)

diff --git a/Documentation/doc/resources/1.8.13/menu_version.js b/Documentation/doc/resources/1.8.13/menu_version.js
index a66903b10fee..f3b20c2fe004 100644
--- a/Documentation/doc/resources/1.8.13/menu_version.js
+++ b/Documentation/doc/resources/1.8.13/menu_version.js
@@ -6,7 +6,8 @@
   var current_version_local = 'master'
   var all_versions = [
       'master',
-      '5.6-beta1',
+      '6.0-beta1',
+      '5.6',
       'latest',
       '5.5.2',
       '5.4.4',
diff --git a/Documentation/doc/resources/1.9.6/menu_version.js b/Documentation/doc/resources/1.9.6/menu_version.js
index a66903b10fee..f3b20c2fe004 100644
--- a/Documentation/doc/resources/1.9.6/menu_version.js
+++ b/Documentation/doc/resources/1.9.6/menu_version.js
@@ -6,7 +6,8 @@
   var current_version_local = 'master'
   var all_versions = [
       'master',
-      '5.6-beta1',
+      '6.0-beta1',
+      '5.6',
       'latest',
       '5.5.2',
       '5.4.4',
diff --git a/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake b/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake
index e71784c4c52c..fc443126c186 100644
--- a/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake
+++ b/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake
@@ -1,8 +1,8 @@
-set(CGAL_MAJOR_VERSION 5)
-set(CGAL_MINOR_VERSION 6)
+set(CGAL_MAJOR_VERSION 6)
+set(CGAL_MINOR_VERSION 0)
 set(CGAL_BUGFIX_VERSION 0)
 include(${CMAKE_CURRENT_LIST_DIR}/CGALConfigBuildVersion.cmake)
-set(CGAL_VERSION_PUBLIC_RELEASE_VERSION "5.6-beta1")
+set(CGAL_VERSION_PUBLIC_RELEASE_VERSION "6.0-beta1")
 set(CGAL_VERSION_PUBLIC_RELEASE_NAME "CGAL-${CGAL_VERSION_PUBLIC_RELEASE_VERSION}")
 
 if (CGAL_BUGFIX_VERSION AND CGAL_BUGFIX_VERSION GREATER 0)

From 12cc83e7d57f806fd98f032cd18220b922a778db Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Tue, 13 Jun 2023 13:32:56 +0200
Subject: [PATCH 0346/1398] prepare the creation of 5.6-beta2 and 6.0-dev

---
 Installation/include/CGAL/version.h                       | 4 ++--
 Installation/lib/cmake/CGAL/CGALConfigVersion.cmake       | 2 +-
 .../cgal.geometryfactory.com/bin/cgal_release.py          | 3 +++
 .../bin/create_internal_release_of_the_day.py             | 8 ++++----
 4 files changed, 10 insertions(+), 7 deletions(-)

diff --git a/Installation/include/CGAL/version.h b/Installation/include/CGAL/version.h
index 482cd7db1a64..584452d7d679 100644
--- a/Installation/include/CGAL/version.h
+++ b/Installation/include/CGAL/version.h
@@ -17,10 +17,10 @@
 #define CGAL_VERSION_H
 
 #ifndef SWIG
-#define CGAL_VERSION 6.0-beta1
+#define CGAL_VERSION 6.0-dev
 #define CGAL_GIT_HASH abcdef
 #endif
-#define CGAL_VERSION_NR 1060000910
+#define CGAL_VERSION_NR 1060000900
 #define CGAL_SVN_REVISION 99999
 #define CGAL_RELEASE_DATE 20231001
 
diff --git a/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake b/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake
index fc443126c186..2687e75956ee 100644
--- a/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake
+++ b/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake
@@ -2,7 +2,7 @@ set(CGAL_MAJOR_VERSION 6)
 set(CGAL_MINOR_VERSION 0)
 set(CGAL_BUGFIX_VERSION 0)
 include(${CMAKE_CURRENT_LIST_DIR}/CGALConfigBuildVersion.cmake)
-set(CGAL_VERSION_PUBLIC_RELEASE_VERSION "6.0-beta1")
+set(CGAL_VERSION_PUBLIC_RELEASE_VERSION "6.0-dev")
 set(CGAL_VERSION_PUBLIC_RELEASE_NAME "CGAL-${CGAL_VERSION_PUBLIC_RELEASE_VERSION}")
 
 if (CGAL_BUGFIX_VERSION AND CGAL_BUGFIX_VERSION GREATER 0)
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/bin/cgal_release.py b/Maintenance/infrastructure/cgal.geometryfactory.com/bin/cgal_release.py
index 506343940945..a835da2c812f 100644
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/bin/cgal_release.py
+++ b/Maintenance/infrastructure/cgal.geometryfactory.com/bin/cgal_release.py
@@ -72,6 +72,9 @@ def beta_release_from_master(beta_number):
     rel.cwd = "$HOME/CGAL/create_internal_release"
     return rel
 
+def beta_release(branch, beta_number):
+    """Convenience function to create a beta release from a branch"""
+    return BetaRelease(branch, beta_number)
 
 def release(branch):
     """Convenience function to create a release from a branch"""
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/bin/create_internal_release_of_the_day.py b/Maintenance/infrastructure/cgal.geometryfactory.com/bin/create_internal_release_of_the_day.py
index 36daeb35eaf0..cd976dd2d01e 100644
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/bin/create_internal_release_of_the_day.py
+++ b/Maintenance/infrastructure/cgal.geometryfactory.com/bin/create_internal_release_of_the_day.py
@@ -8,7 +8,7 @@
 import datetime
 import locale
 import argparse
-from cgal_release import release, integration, master, beta_release_from_master
+from cgal_release import release, integration, master, beta_release, master, beta_release_from_master
 
 # Define a dictionary that maps day of the week to an action
 actions = {
@@ -16,9 +16,9 @@
     "Tuesday": integration,
     "Wednesday": integration,
     "Thursday": integration,
-    "Friday": release("5.5"),
-    "Saturday": release("5.4"),
-    "Sunday": beta_release_from_master(1),
+    "Friday": beta_release("5.6", 2),
+    "Saturday": release("5.5"),
+    "Sunday": master,
 }
 
 

From 5459870e311be1302ad823ed7f25aed217c8d8a0 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Tue, 13 Jun 2023 14:18:02 +0200
Subject: [PATCH 0347/1398] create a new CMake function CGAL_setup_CGAL_flags

That new CMake function will ease the work with the Conan CGAL package.
---
 .../cmake/modules/CGAL_SetupCGALDependencies.cmake    | 11 ++++++++---
 1 file changed, 8 insertions(+), 3 deletions(-)

diff --git a/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake b/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
index 7329be331166..fb5e92371e63 100644
--- a/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
+++ b/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
@@ -97,9 +97,6 @@ function(CGAL_setup_CGAL_dependencies target)
     target_compile_definitions(${target} INTERFACE CGAL_TEST_SUITE=1)
   endif()
 
-  # CGAL now requires C++14. `decltype(auto)` is used as a marker of C++14.
-  target_compile_features(${target} INTERFACE cxx_decltype_auto)
-
   use_CGAL_Boost_support(${target} INTERFACE)
 
   # Make CGAL depend on threads-support (for Epeck and Epeck_d)
@@ -119,6 +116,14 @@ function(CGAL_setup_CGAL_dependencies target)
     target_link_options(${target} INTERFACE -fsanitize=address)
   endif()
   # Now setup compilation flags
+  CGAL_setup_CGAL_flags(${target})
+endfunction()
+
+function(CGAL_setup_CGAL_flags target)
+  # CGAL now requires C++14. `decltype(auto)` is used as a marker of
+  # C++14.
+  target_compile_features(${target} INTERFACE cxx_decltype_auto)
+
   if(MSVC)
     target_compile_options(${target} INTERFACE
       "-D_SCL_SECURE_NO_DEPRECATE;-D_SCL_SECURE_NO_WARNINGS")

From 2251c438fa55a092cac42f8b49c53346a2b0d019 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 13 Jun 2023 14:30:01 +0200
Subject: [PATCH 0348/1398] enable exact serialization of triangulations with
 EPECK

---
 .../include/CGAL/Convex_hull_vertex_base_2.h  |  2 +-
 Stream_support/include/CGAL/IO/io.h           | 19 +++++++++++++++++++
 .../Regular_triangulation_vertex_base_2.h     |  2 +-
 .../CGAL/Triangulation_vertex_base_2.h        |  2 +-
 .../Regular_triangulation_vertex_base_3.h     |  2 +-
 .../CGAL/Triangulation_vertex_base_3.h        |  3 ++-
 .../test/Triangulation_3/CMakeLists.txt       |  1 +
 7 files changed, 26 insertions(+), 5 deletions(-)

diff --git a/Convex_hull_3/include/CGAL/Convex_hull_vertex_base_2.h b/Convex_hull_3/include/CGAL/Convex_hull_vertex_base_2.h
index 2ec965bb8092..a7f311246463 100644
--- a/Convex_hull_3/include/CGAL/Convex_hull_vertex_base_2.h
+++ b/Convex_hull_3/include/CGAL/Convex_hull_vertex_base_2.h
@@ -77,7 +77,7 @@ template <typename GT, typename Vb>
 std::ostream&
 operator<<(std::ostream &os, const Convex_hull_vertex_base_2<GT, Vb>& v)
 {
-  return os << static_cast<const Vb&>(v) << v.point();
+  return os << static_cast<const Vb&>(v) << IO::serialize(v.point());
 }
 
 } //namespace CGAL
diff --git a/Stream_support/include/CGAL/IO/io.h b/Stream_support/include/CGAL/IO/io.h
index e287fe8e16f2..1034f74abff0 100644
--- a/Stream_support/include/CGAL/IO/io.h
+++ b/Stream_support/include/CGAL/IO/io.h
@@ -698,6 +698,25 @@ inline const char* mode_name( IO::Mode m )
   return names[m];
 }
 
+namespace internal {
+
+template <class P> constexpr auto has_exact(int) -> decltype(exact(P()), bool()) { return true; }
+template <class P> constexpr bool has_exact(...) { return false; }
+
+}
+
+template <class P>
+auto
+serialize(const P& p) {
+  if constexpr (internal::has_exact<P>(0)) {
+    return exact(p);
+  } else {
+    return p;
+  }
+}
+
+
+
 } // IO namespace
 
 #ifndef CGAL_NO_DEPRECATED_CODE
diff --git a/Triangulation_2/include/CGAL/Regular_triangulation_vertex_base_2.h b/Triangulation_2/include/CGAL/Regular_triangulation_vertex_base_2.h
index 36ec36f23092..a2ca48dac151 100644
--- a/Triangulation_2/include/CGAL/Regular_triangulation_vertex_base_2.h
+++ b/Triangulation_2/include/CGAL/Regular_triangulation_vertex_base_2.h
@@ -81,7 +81,7 @@ operator<<(std::ostream &os,
            const Regular_triangulation_vertex_base_2<GT, Vb> &v)
   // non combinatorial information. Default = point
 {
-  return os << static_cast<const Vb&>(v) << v.point();
+  return os << static_cast<const Vb&>(v) << IO::serialize(v.point());
 }
 
 } //namespace CGAL
diff --git a/Triangulation_2/include/CGAL/Triangulation_vertex_base_2.h b/Triangulation_2/include/CGAL/Triangulation_vertex_base_2.h
index 7936ae663361..ecbb1083689d 100644
--- a/Triangulation_2/include/CGAL/Triangulation_vertex_base_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_vertex_base_2.h
@@ -109,7 +109,7 @@ std::ostream&
 operator<<(std::ostream &os, const Triangulation_vertex_base_2<GT, Vb> &v)
   // non combinatorial information. Default = point
 {
-  return os << static_cast<const Vb&>(v) << v.point();
+  return os << static_cast<const Vb&>(v) << IO::serialize(v.point());
 }
 
 #ifndef CGAL_NO_DEPRECATED_CODE
diff --git a/Triangulation_3/include/CGAL/Regular_triangulation_vertex_base_3.h b/Triangulation_3/include/CGAL/Regular_triangulation_vertex_base_3.h
index f9f642cfbb10..cd697f179781 100644
--- a/Triangulation_3/include/CGAL/Regular_triangulation_vertex_base_3.h
+++ b/Triangulation_3/include/CGAL/Regular_triangulation_vertex_base_3.h
@@ -75,7 +75,7 @@ std::ostream&
 operator<<(std::ostream &os, const Regular_triangulation_vertex_base_3<GT, DSVb> &v)
   // non combinatorial information. Default = point
 {
-  return os << static_cast<const DSVb&>(v) << v.point();
+  return os << static_cast<const DSVb&>(v) << IO::serialize(v.point());
 }
 
 } //namespace CGAL
diff --git a/Triangulation_3/include/CGAL/Triangulation_vertex_base_3.h b/Triangulation_3/include/CGAL/Triangulation_vertex_base_3.h
index b4527f6c403a..60e11f6233eb 100644
--- a/Triangulation_3/include/CGAL/Triangulation_vertex_base_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_vertex_base_3.h
@@ -61,6 +61,7 @@ class Triangulation_vertex_base_3
   Point _p;
 };
 
+
 template < class GT, class DSVb >
 std::istream&
 operator>>(std::istream &is, Triangulation_vertex_base_3<GT, DSVb> &v)
@@ -74,7 +75,7 @@ std::ostream&
 operator<<(std::ostream &os, const Triangulation_vertex_base_3<GT, DSVb> &v)
   // non combinatorial information. Default = point
 {
-  return os << static_cast<const DSVb&>(v) << v.point();
+  return os << static_cast<const DSVb&>(v) << IO::serialize(v.point());
 }
 
 } //namespace CGAL
diff --git a/Triangulation_3/test/Triangulation_3/CMakeLists.txt b/Triangulation_3/test/Triangulation_3/CMakeLists.txt
index ffd521512de0..88d63413f646 100644
--- a/Triangulation_3/test/Triangulation_3/CMakeLists.txt
+++ b/Triangulation_3/test/Triangulation_3/CMakeLists.txt
@@ -28,6 +28,7 @@ create_single_source_cgal_program("test_segment_simplex_traverser_3.cpp" )
 create_single_source_cgal_program("test_static_filters.cpp")
 create_single_source_cgal_program("test_triangulation_3.cpp")
 create_single_source_cgal_program("test_io_triangulation_3.cpp")
+create_single_source_cgal_program("test_triangulation_serialization_3.cpp")
 
 if(TARGET CGAL::TBB_support)
   message(STATUS "Found TBB")

From 8f54a3aa06e5560ca641cc86b6a7c090a9535c19 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 13 Jun 2023 14:38:48 +0200
Subject: [PATCH 0349/1398] add missing test

---
 .../test_triangulation_serialization_3.cpp    | 44 +++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 Triangulation_3/test/Triangulation_3/test_triangulation_serialization_3.cpp

diff --git a/Triangulation_3/test/Triangulation_3/test_triangulation_serialization_3.cpp b/Triangulation_3/test/Triangulation_3/test_triangulation_serialization_3.cpp
new file mode 100644
index 000000000000..91a969dcc981
--- /dev/null
+++ b/Triangulation_3/test/Triangulation_3/test_triangulation_serialization_3.cpp
@@ -0,0 +1,44 @@
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Exact_rational.h>
+
+#include <CGAL/Delaunay_triangulation_3.h>
+
+#include <CGAL/Random.h>
+
+
+#include <sstream>
+
+template <class K>
+void test()
+{
+  typedef typename K::FT FT;
+  CGAL::Delaunay_triangulation_3<K> dt3;
+
+
+  // create a bunch of points
+  CGAL::Random random;
+  FT x,y,z;
+  for (int n=0;n<50;++n)
+  {
+    x=random.get_int(-500,500);
+    y=random.get_int(-500,500);
+    z=random.get_int(-500,500);
+    dt3.insert(typename K::Point_3(x/FT(3),y/FT(5),z/FT(7)));
+  }
+
+  std::stringstream buffer;
+  buffer << std::setprecision(17) << dt3;
+  decltype(dt3) dt3_bis;
+  buffer >> dt3_bis;
+
+  assert(dt3==dt3_bis);
+}
+
+int main()
+{
+  test<CGAL::Simple_cartesian<CGAL::Exact_rational>>();
+  test<CGAL::Exact_predicates_exact_constructions_kernel>();
+  test<CGAL::Exact_predicates_inexact_constructions_kernel>();
+}
\ No newline at end of file

From c4eb65d71bac0982e7bab1cc175e98c1f7c792d4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 13 Jun 2023 19:01:35 +0200
Subject: [PATCH 0350/1398] disable MSVC 2015

---
 Scripts/developer_scripts/autotest_cgal | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/Scripts/developer_scripts/autotest_cgal b/Scripts/developer_scripts/autotest_cgal
index ab124cf51e2e..c984ac9ae231 100755
--- a/Scripts/developer_scripts/autotest_cgal
+++ b/Scripts/developer_scripts/autotest_cgal
@@ -429,6 +429,13 @@ setup_dirs()
 
   for PLATFORM in ${PLATFORMS}; do
 
+    # MSVC2015 does not support C++17
+    if [ "$CGAL_RELEASE_ID" \> "CGAL-6.0" ]; then
+      if [ "$PLATFORMS" = "MSVC2015-Release-64bits" ]; then
+        continue
+      fi
+    fi
+
     CGAL_BINARY_DIR=${CGAL_BINARY_DIR_BASE}/${PLATFORM}
 
     if [ ! -d "${CGAL_BINARY_DIR}" ]; then

From 852b3b664b9fed1c76da2717a011cf2e1bcb7116 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 22:40:15 +0200
Subject: [PATCH 0351/1398] expand -CGAL_CPP17_INLINE macro

---
 BGL/include/CGAL/boost/graph/internal/Has_member_clear.h    | 2 +-
 .../include/CGAL/Box_intersection_d/segment_tree.h          | 2 +-
 Combinatorial_map/include/CGAL/Combinatorial_map_storages.h | 4 ++--
 Generalized_map/include/CGAL/Generalized_map_storages.h     | 4 ++--
 Installation/include/CGAL/config.h                          | 6 ------
 .../include/CGAL/CMap_linear_cell_complex_storages.h        | 4 ++--
 .../include/CGAL/GMap_linear_cell_complex_storages.h        | 4 ++--
 STL_Extension/include/CGAL/Named_function_parameters.h      | 2 +-
 STL_Extension/include/CGAL/type_traits/is_iterator.h        | 6 +++---
 Stream_support/include/CGAL/IO/helpers.h                    | 4 ++--
 10 files changed, 16 insertions(+), 22 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/internal/Has_member_clear.h b/BGL/include/CGAL/boost/graph/internal/Has_member_clear.h
index 9d0288d11712..c0e284b6574d 100644
--- a/BGL/include/CGAL/boost/graph/internal/Has_member_clear.h
+++ b/BGL/include/CGAL/boost/graph/internal/Has_member_clear.h
@@ -29,7 +29,7 @@ class Has_member_clear
 };
 
 template<class T>
-CGAL_CPP17_INLINE constexpr bool Has_member_clear_v = Has_member_clear<T>::value;
+inline constexpr bool Has_member_clear_v = Has_member_clear<T>::value;
 
 }  // internal
 }  // cgal
diff --git a/Box_intersection_d/include/CGAL/Box_intersection_d/segment_tree.h b/Box_intersection_d/include/CGAL/Box_intersection_d/segment_tree.h
index 31b1fb23dd08..43f4061a4497 100644
--- a/Box_intersection_d/include/CGAL/Box_intersection_d/segment_tree.h
+++ b/Box_intersection_d/include/CGAL/Box_intersection_d/segment_tree.h
@@ -326,7 +326,7 @@ class Has_member_report
 };
 
 template <class T>
-CGAL_CPP17_INLINE constexpr bool Has_member_report_v = Has_member_report<T>::value;
+inline constexpr bool Has_member_report_v = Has_member_report<T>::value;
 
 template <typename Callback>
 inline
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h b/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h
index cde06788e0d3..3754a4439d4b 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h
@@ -64,7 +64,7 @@ namespace CGAL {
     typedef typename Dart_container::size_type             size_type;
 
     typedef std::nullptr_t Null_descriptor_type;
-    CGAL_CPP17_INLINE static constexpr Null_descriptor_type null_descriptor=nullptr;
+    inline static constexpr Null_descriptor_type null_descriptor=nullptr;
 
     using Type_for_compact_container=void*;
 
@@ -107,7 +107,7 @@ namespace CGAL {
     template<int i>
     using Attribute_const_handle=Attribute_const_descriptor<i>;
 
-    CGAL_CPP17_INLINE static constexpr Null_descriptor_type null_handle=null_descriptor;
+    inline static constexpr Null_descriptor_type null_handle=null_descriptor;
 
     /// Number of marks
     static const size_type NB_MARKS = 32;
diff --git a/Generalized_map/include/CGAL/Generalized_map_storages.h b/Generalized_map/include/CGAL/Generalized_map_storages.h
index d628b153a5e3..d14cc8ea17c5 100644
--- a/Generalized_map/include/CGAL/Generalized_map_storages.h
+++ b/Generalized_map/include/CGAL/Generalized_map_storages.h
@@ -64,7 +64,7 @@ namespace CGAL {
     typedef typename Dart_container::size_type            size_type;
 
     typedef std::nullptr_t Null_descriptor_type;
-    CGAL_CPP17_INLINE static constexpr Null_descriptor_type null_descriptor=nullptr;
+    inline static constexpr Null_descriptor_type null_descriptor=nullptr;
 
     using Type_for_compact_container=void*;
 
@@ -107,7 +107,7 @@ namespace CGAL {
     template<int i>
     using Attribute_const_handle=Attribute_const_descriptor<i>;
 
-    CGAL_CPP17_INLINE static constexpr Null_descriptor_type null_handle=null_descriptor;
+    inline static constexpr Null_descriptor_type null_handle=null_descriptor;
 
     /// Number of marks
     static const size_type NB_MARKS = 32;
diff --git a/Installation/include/CGAL/config.h b/Installation/include/CGAL/config.h
index d492dafc0466..d48250f1dc13 100644
--- a/Installation/include/CGAL/config.h
+++ b/Installation/include/CGAL/config.h
@@ -488,12 +488,6 @@ namespace cpp11{
 #  define CGAL_FALLTHROUGH while(false){}
 #endif
 
-#if CGAL_CXX17
-#  define CGAL_CPP17_INLINE inline
-#else
-#  define CGAL_CPP17_INLINE
-#endif
-
 #ifndef CGAL_NO_ASSERTIONS
 #  define CGAL_NO_ASSERTIONS_BOOL false
 #else
diff --git a/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h b/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h
index e43fb2790389..6e6884ecbcf1 100644
--- a/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h
+++ b/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h
@@ -74,7 +74,7 @@ namespace CGAL {
     typedef typename Dart_container::size_type             size_type;
 
     typedef std::nullptr_t Null_descriptor_type;
-    CGAL_CPP17_INLINE static constexpr Null_descriptor_type null_descriptor=nullptr;
+    inline static constexpr Null_descriptor_type null_descriptor=nullptr;
 
     using Type_for_compact_container=void*;
 
@@ -128,7 +128,7 @@ namespace CGAL {
     using Vertex_attribute_handle=Vertex_attribute_descriptor;
     using Vertex_attribute_const_handle=Vertex_attribute_const_descriptor;
 
-    CGAL_CPP17_INLINE static constexpr Null_descriptor_type null_handle=null_descriptor;
+    inline static constexpr Null_descriptor_type null_handle=null_descriptor;
 
     /// Number of marks
     static const size_type NB_MARKS = 32;
diff --git a/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h b/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h
index 3b90e193fa29..ca73368b34ab 100644
--- a/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h
+++ b/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h
@@ -74,7 +74,7 @@ namespace CGAL {
     typedef typename Dart_container::size_type             size_type;
 
     typedef std::nullptr_t Null_descriptor_type;
-    CGAL_CPP17_INLINE static constexpr Null_descriptor_type null_descriptor=nullptr;
+    inline static constexpr Null_descriptor_type null_descriptor=nullptr;
 
     using Type_for_compact_container=void*;
 
@@ -128,7 +128,7 @@ namespace CGAL {
     using Vertex_attribute_handle=Vertex_attribute_descriptor;
     using Vertex_attribute_const_handle=Vertex_attribute_const_descriptor;
 
-    CGAL_CPP17_INLINE static constexpr Null_descriptor_type null_handle=null_descriptor;
+    inline static constexpr Null_descriptor_type null_handle=null_descriptor;
 
     /// Number of marks
     static const size_type NB_MARKS = 32;
diff --git a/STL_Extension/include/CGAL/Named_function_parameters.h b/STL_Extension/include/CGAL/Named_function_parameters.h
index 243ed7b4be5e..e48768eaffb4 100644
--- a/STL_Extension/include/CGAL/Named_function_parameters.h
+++ b/STL_Extension/include/CGAL/Named_function_parameters.h
@@ -540,6 +540,6 @@ namespace boost
 // For disambiguation using SFINAE
 BOOST_MPL_HAS_XXX_TRAIT_DEF(CGAL_Named_function_parameters_class)
 template<class T>
-CGAL_CPP17_INLINE constexpr bool is_named_function_parameter = has_CGAL_Named_function_parameters_class<T>::value;
+inline constexpr bool is_named_function_parameter = has_CGAL_Named_function_parameters_class<T>::value;
 
 #endif // CGAL_BOOST_FUNCTION_PARAMS_HPP
diff --git a/STL_Extension/include/CGAL/type_traits/is_iterator.h b/STL_Extension/include/CGAL/type_traits/is_iterator.h
index f8010ab35b3f..e1b43ac7a046 100644
--- a/STL_Extension/include/CGAL/type_traits/is_iterator.h
+++ b/STL_Extension/include/CGAL/type_traits/is_iterator.h
@@ -69,7 +69,7 @@ struct is_iterator
 { };
 
 template <class T>
-CGAL_CPP17_INLINE constexpr bool is_iterator_v = is_iterator<T>::value;
+inline constexpr bool is_iterator_v = is_iterator<T>::value;
 
 template <class T, class Tag>
 struct is_iterator_type
@@ -77,7 +77,7 @@ struct is_iterator_type
 { };
 
 template <class T, class Tag>
-CGAL_CPP17_INLINE constexpr bool is_iterator_type_v = is_iterator_type<T,Tag>::value;
+inline constexpr bool is_iterator_type_v = is_iterator_type<T,Tag>::value;
 
 
 template <class T, class U, bool = is_iterator<T>::value>
@@ -91,7 +91,7 @@ struct is_iterator_to<T, U, true>
 { };
 
 template <class T, class U>
-CGAL_CPP17_INLINE constexpr bool is_iterator_to_v = is_iterator_to<T,U>::value;
+inline constexpr bool is_iterator_to_v = is_iterator_to<T,U>::value;
 
 
 } // namespace CGAL
diff --git a/Stream_support/include/CGAL/IO/helpers.h b/Stream_support/include/CGAL/IO/helpers.h
index 36cd5e2a89ce..175f95b189d9 100644
--- a/Stream_support/include/CGAL/IO/helpers.h
+++ b/Stream_support/include/CGAL/IO/helpers.h
@@ -84,7 +84,7 @@ struct is_Range
 { };
 
 template <class T>
-CGAL_CPP17_INLINE constexpr bool is_Range_v = is_Range<T>::value;
+inline constexpr bool is_Range_v = is_Range<T>::value;
 
 // For polygon meshes
 template <typename T>
@@ -93,7 +93,7 @@ struct is_Point_set_or_Range_or_Iterator
 { };
 
 template <class T>
-CGAL_CPP17_INLINE constexpr bool is_Point_set_or_Range_or_Iterator_v = is_Point_set_or_Range_or_Iterator<T>::value;
+inline constexpr bool is_Point_set_or_Range_or_Iterator_v = is_Point_set_or_Range_or_Iterator<T>::value;
 
 } // end namespace internal
 } // end namespace IO

From e54408370b2583153dc923884a5ec1587bc7898e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 22:50:53 +0200
Subject: [PATCH 0352/1398] remove CGAL_CXX17 macro

... and no longer used macros
---
 .../include/CGAL/Combinatorial_map_storages.h      | 10 ----------
 .../include/CGAL/Generalized_map_storages.h        | 11 -----------
 Installation/include/CGAL/config.h                 |  9 ++-------
 .../CGAL/CMap_linear_cell_complex_storages.h       | 11 -----------
 .../CGAL/GMap_linear_cell_complex_storages.h       | 12 ------------
 Matrix_search/include/CGAL/Cartesian_matrix.h      |  4 ----
 Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h          | 14 --------------
 7 files changed, 2 insertions(+), 69 deletions(-)

diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h b/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h
index 3754a4439d4b..7c505ea51657 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h
@@ -467,16 +467,6 @@ namespace CGAL {
     typename Helper::Attribute_containers mattribute_containers;
   };
 
-#ifndef CGAL_CXX17
-  template<unsigned int d_, class Items_, class Alloc_>
-  constexpr typename Combinatorial_map_storage_1<d_, Items_, Alloc_>::Null_descriptor_type
-  Combinatorial_map_storage_1<d_, Items_, Alloc_>::null_descriptor;
-
-  template<unsigned int d_, class Items_, class Alloc_>
-  constexpr typename Combinatorial_map_storage_1<d_, Items_, Alloc_>::Null_descriptor_type
-  Combinatorial_map_storage_1<d_, Items_, Alloc_>::null_handle;
-#endif
-
 } // namespace CGAL
 
 #if defined(BOOST_GCC)
diff --git a/Generalized_map/include/CGAL/Generalized_map_storages.h b/Generalized_map/include/CGAL/Generalized_map_storages.h
index d14cc8ea17c5..4f40c0a922cc 100644
--- a/Generalized_map/include/CGAL/Generalized_map_storages.h
+++ b/Generalized_map/include/CGAL/Generalized_map_storages.h
@@ -457,17 +457,6 @@ namespace CGAL {
     /// Tuple of attributes containers
     typename Helper::Attribute_containers mattribute_containers;
   };
-
-#ifndef CGAL_CXX17
-  template<unsigned int d_, class Items_, class Alloc_>
-  constexpr typename Generalized_map_storage_1<d_, Items_, Alloc_>::Null_descriptor_type
-  Generalized_map_storage_1<d_, Items_, Alloc_>::null_descriptor;
-
-  template<unsigned int d_, class Items_, class Alloc_>
-  constexpr typename Generalized_map_storage_1<d_, Items_, Alloc_>::Null_descriptor_type
-  Generalized_map_storage_1<d_, Items_, Alloc_>::null_handle;
-#endif
-
 } // namespace CGAL
 
 #if defined(BOOST_GCC)
diff --git a/Installation/include/CGAL/config.h b/Installation/include/CGAL/config.h
index d48250f1dc13..0286ae133c10 100644
--- a/Installation/include/CGAL/config.h
+++ b/Installation/include/CGAL/config.h
@@ -36,11 +36,6 @@
 #  define WIN64
 #endif
 
-#ifdef _MSC_VER
-#define _SILENCE_CXX17_ALLOCATOR_VOID_DEPRECATION_WARNING 1
-#define _SILENCE_CXX17_OLD_ALLOCATOR_MEMBERS_DEPRECATION_WARNING 1
-#endif
-
 #ifdef CGAL_INCLUDE_WINDOWS_DOT_H
 // Mimic users including this file which defines min max macros
 // and other names leading to name clashes
@@ -147,8 +142,8 @@
 #endif
 
 // Same for C++17
-#if __cplusplus >= 201703L || _MSVC_LANG >= 201703L
-#  define CGAL_CXX17 1
+#if !(__cplusplus >= 201703L || _MSVC_LANG >= 201703L)
+#error "CGAL requires C++ 17"
 #endif
 // Same for C++20
 #if __cplusplus >= 202002L || _MSVC_LANG >= 202002L
diff --git a/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h b/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h
index 6e6884ecbcf1..1ec9a1d66af1 100644
--- a/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h
+++ b/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h
@@ -502,17 +502,6 @@ namespace CGAL {
     typename Helper::Attribute_containers mattribute_containers;
   };
 
-#ifndef CGAL_CXX17
-  template<unsigned int d_, unsigned int ambient_dim,
-           class Traits_, class Items_, class Alloc_>
-  constexpr typename CMap_linear_cell_complex_storage_1<d_,ambient_dim, Traits_, Items_, Alloc_>::Null_descriptor_type
-    CMap_linear_cell_complex_storage_1<d_,ambient_dim, Traits_, Items_, Alloc_>::null_descriptor;
-
-  template<unsigned int d_, unsigned int ambient_dim,
-           class Traits_, class Items_, class Alloc_>
-  constexpr typename CMap_linear_cell_complex_storage_1<d_,ambient_dim, Traits_, Items_, Alloc_>::Null_descriptor_type
-    CMap_linear_cell_complex_storage_1<d_,ambient_dim, Traits_, Items_, Alloc_>::null_handle;
-#endif
 } // namespace CGAL
 
 #if defined(BOOST_GCC)
diff --git a/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h b/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h
index ca73368b34ab..c2331a6acfb8 100644
--- a/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h
+++ b/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h
@@ -493,18 +493,6 @@ namespace CGAL {
     typename Helper::Attribute_containers mattribute_containers;
   };
 
-#ifndef CGAL_CXX17
-  template<unsigned int d_, unsigned int ambient_dim,
-           class Traits_, class Items_, class Alloc_>
-  constexpr typename GMap_linear_cell_complex_storage_1<d_, ambient_dim, Traits_, Items_, Alloc_>::Null_descriptor_type
-  GMap_linear_cell_complex_storage_1<d_, ambient_dim, Traits_, Items_, Alloc_>::null_descriptor;
-
-  template<unsigned int d_, unsigned int ambient_dim,
-           class Traits_, class Items_, class Alloc_>
-  constexpr typename GMap_linear_cell_complex_storage_1<d_, ambient_dim, Traits_, Items_, Alloc_>::Null_descriptor_type
-  GMap_linear_cell_complex_storage_1<d_, ambient_dim, Traits_, Items_, Alloc_>::null_handle;
-#endif
-
 } // namespace CGAL
 
 #if defined(BOOST_GCC)
diff --git a/Matrix_search/include/CGAL/Cartesian_matrix.h b/Matrix_search/include/CGAL/Cartesian_matrix.h
index 1aa192ab2c85..be3dba778b4e 100644
--- a/Matrix_search/include/CGAL/Cartesian_matrix.h
+++ b/Matrix_search/include/CGAL/Cartesian_matrix.h
@@ -28,11 +28,7 @@ template < class Operation,
 class Cartesian_matrix {
 public:
 
-#if CGAL_CXX17 && __has_cpp_attribute(nodiscard)
   typedef typename std::invoke_result<Operation, typename std::iterator_traits<RandomAccessIC_row>::value_type, typename std::iterator_traits<RandomAccessIC_column>::value_type>::type Value;
-#else
-  typedef typename Operation::result_type           Value;
-#endif
 
   Cartesian_matrix(RandomAccessIC_row r_f,
                    RandomAccessIC_row r_l,
diff --git a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
index 8e86644477bc..6a812e5581b6 100644
--- a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
+++ b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
@@ -1572,17 +1572,10 @@ class C3T3_helpers
   Cell_vector c3t3_cells(const Cell_vector& cells) const
   {
     Cell_vector c3t3_cells;
-#ifdef CGAL_CXX17
     std::remove_copy_if(cells.begin(),
                         cells.end(),
                         std::back_inserter(c3t3_cells),
                         std::not_fn(Is_in_c3t3<Cell_handle>(c3t3_)));
-#else
-    std::remove_copy_if(cells.begin(),
-                        cells.end(),
-                        std::back_inserter(c3t3_cells),
-                        std::not1(Is_in_c3t3<Cell_handle>(c3t3_)) );
-#endif
     return c3t3_cells;
   }
 
@@ -3665,17 +3658,10 @@ incident_slivers(const Vertex_handle& v,
   std::vector<Cell_handle> incident_cells_;
   tr_.incident_cells(v, std::back_inserter(incident_cells_));
 
-#ifdef CGAL_CXX17
   std::remove_copy_if(incident_cells_.begin(),
                       incident_cells_.end(),
                       out,
                       std::not_fn(Is_sliver<Sc>(c3t3_, criterion, sliver_bound)));
-#else
-  std::remove_copy_if(incident_cells_.begin(),
-                      incident_cells_.end(),
-                      out,
-                      std::not1(Is_sliver<Sc>(c3t3_,criterion,sliver_bound)));
-#endif
 
   return out;
 }

From c8a88b9014607bde800dbbe9fa0e3e92b6003dc0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 22:55:14 +0200
Subject: [PATCH 0353/1398] remove CGAL_static_assertion*

---
 .../internal/AABB_ray_intersection.h          |  2 +-
 ...bb_test_is_ray_intersection_geomtraits.cpp |  8 +--
 .../Algebraic_foundations/fraction_traits.cpp |  4 +-
 .../Algebraic_foundations/interoperable.cpp   |  2 +-
 .../include/CGAL/Algebraic_structure_traits.h |  2 +-
 .../include/CGAL/Coercion_traits.h            |  2 +-
 .../include/CGAL/Scalar_factor_traits.h       |  4 +-
 .../CGAL/Test/_test_algebraic_structure.h     | 52 +++++++++----------
 .../include/CGAL/Test/_test_coercion_traits.h |  8 +--
 .../include/CGAL/Test/_test_fraction_traits.h | 10 ++--
 .../include/CGAL/Test/_test_rational_traits.h |  2 +-
 .../include/CGAL/Test/_test_real_embeddable.h | 16 +++---
 .../Algebraic_extension_traits.cpp            | 24 ++++-----
 .../Algebraic_structure_traits.cpp            | 10 ++--
 .../Algebraic_foundations/Coercion_traits.cpp | 14 ++---
 .../Real_embeddable_traits.cpp                |  6 +--
 .../Scalar_factor_traits.cpp                  | 14 ++---
 .../Algebraic_curve_kernel_2.h                | 12 ++---
 .../Algebraic_kernel_d/Algebraic_real_d_1.h   |  2 +-
 .../algebraic_curve_kernel_2_tools.h          |  6 +--
 .../Real_embeddable_traits_extension.cpp      | 16 +++---
 .../CGAL/_test_algebraic_curve_kernel_2.h     |  8 +--
 .../include/CGAL/_test_algebraic_kernel_1.h   | 10 ++--
 .../include/CGAL/_test_algebraic_kernel_2.h   | 16 +++---
 .../include/CGAL/_test_real_comparable.h      | 16 +++---
 Alpha_shapes_2/include/CGAL/Alpha_shape_2.h   |  6 +--
 .../Alpha_shapes_2/internal/Lazy_alpha_nt_2.h |  4 +-
 Alpha_shapes_3/include/CGAL/Alpha_shape_3.h   |  6 +--
 .../Alpha_shapes_3/internal/Lazy_alpha_nt_3.h |  4 +-
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h |  2 +-
 .../internal/Triangle_mesh_oracle.h           |  2 +-
 .../internal/Triangle_soup_oracle.h           |  2 +-
 .../Get_arithmetic_kernel.cpp                 |  6 +--
 .../Arr_bounded_planar_topology_traits_2.h    |  8 +--
 .../include/CGAL/Arr_dcel_base.h              |  2 +-
 .../include/CGAL/Arr_overlay_2.h              |  8 +--
 .../CGAL/Arr_rat_arc/Base_rational_arc_ds_1.h |  4 +-
 .../CGAL/Arr_rat_arc/Rational_arc_d_1.h       |  4 +-
 .../CGAL/Arr_spherical_topology_traits_2.h    |  8 +--
 .../CGAL/Arr_unb_planar_topology_traits_2.h   |  8 +--
 .../include/CGAL/Arrangement_on_surface_2.h   |  2 +-
 .../include/CGAL/Arrangement_zone_2.h         |  2 +-
 .../Arrangement_on_surface_2/test_tags.cpp    | 16 +++---
 .../graph/IO/Generic_facegraph_builder.h      |  4 +-
 BGL/test/BGL/test_Has_member_clear.cpp        |  8 +--
 BGL/test/BGL/test_Has_member_id.cpp           | 18 +++----
 .../Gps_agg_meta_traits.h                     |  8 +--
 .../Gps_traits_decorator.h                    |  8 +--
 .../include/CGAL/box_intersection_d.h         |  2 +-
 .../test_Has_member_report.cpp                |  6 +--
 Circulator/include/CGAL/circulator.h          | 14 ++---
 .../ETHZ/internal/random-forest/forest.hpp    |  2 +-
 .../Classification/Local_eigen_analysis.h     |  6 +--
 .../Sum_of_weighted_features_classifier.h     |  2 +-
 .../include/CGAL/Cell_iterators.h             |  6 +--
 .../include/CGAL/Combinatorial_map.h          | 32 ++++++------
 .../Combinatorial_map_group_functors.h        | 50 +++++++++---------
 .../Combinatorial_map_internal_functors.h     |  8 +--
 .../CGAL/Combinatorial_map_basic_operations.h |  8 +--
 .../CGAL/Combinatorial_map_iterators_base.h   |  6 +--
 .../CGAL/Combinatorial_map_operations.h       |  4 +-
 .../include/CGAL/Combinatorial_map_storages.h |  6 +--
 .../Combinatorial_map_storages_with_index.h   |  6 +--
 Combinatorial_map/include/CGAL/Dart.h         |  4 +-
 .../include/CGAL/Dart_iterators.h             | 18 +++----
 .../quick_hull_default_traits.cpp             | 14 ++---
 .../include/CGAL/GMap_cell_iterators.h        |  4 +-
 .../include/CGAL/GMap_dart_iterators.h        | 12 ++---
 .../include/CGAL/Generalized_map.h            | 32 ++++++------
 .../internal/Generalized_map_group_functors.h | 28 +++++-----
 .../CGAL/Generalized_map_iterators_base.h     |  2 +-
 .../include/CGAL/Generalized_map_operations.h |  4 +-
 .../include/CGAL/Generalized_map_storages.h   |  6 +--
 .../Generalized_map_storages_with_index.h     |  6 +--
 .../Surface_mesh_geodesic_distances_3.h       |  2 +-
 .../internal/deprecation_warning.h            |  2 +-
 .../Installation/test_configuration_qt5.cpp   |  2 +-
 .../include/CGAL/Intersection_traits.h        |  4 +-
 .../internal/Bbox_3_Segment_3_do_intersect.h  |  2 +-
 .../Test/_test_bigfloat_interval_traits.h     |  2 +-
 .../include/CGAL/Test/_test_convert_to_bfi.h  |  2 +-
 .../include/CGAL/Test/_test_interval_traits.h |  6 +--
 Kernel_23/include/CGAL/Circle_2.h             |  2 +-
 Kernel_23/include/CGAL/Circle_3.h             |  2 +-
 Kernel_23/include/CGAL/Direction_2.h          |  2 +-
 Kernel_23/include/CGAL/Direction_3.h          |  2 +-
 Kernel_23/include/CGAL/Has_conversion.h       |  4 +-
 Kernel_23/include/CGAL/Iso_cuboid_3.h         |  2 +-
 Kernel_23/include/CGAL/Iso_rectangle_2.h      |  2 +-
 Kernel_23/include/CGAL/Line_2.h               |  2 +-
 Kernel_23/include/CGAL/Line_3.h               |  2 +-
 Kernel_23/include/CGAL/Plane_3.h              |  2 +-
 Kernel_23/include/CGAL/Point_2.h              |  2 +-
 Kernel_23/include/CGAL/Point_3.h              |  2 +-
 Kernel_23/include/CGAL/Ray_2.h                |  2 +-
 Kernel_23/include/CGAL/Ray_3.h                |  2 +-
 Kernel_23/include/CGAL/Segment_2.h            |  2 +-
 Kernel_23/include/CGAL/Segment_3.h            |  2 +-
 Kernel_23/include/CGAL/Sphere_3.h             |  2 +-
 Kernel_23/include/CGAL/Tetrahedron_3.h        |  2 +-
 Kernel_23/include/CGAL/Triangle_2.h           |  2 +-
 Kernel_23/include/CGAL/Triangle_3.h           |  2 +-
 Kernel_23/include/CGAL/Vector_2.h             |  2 +-
 Kernel_23/include/CGAL/Vector_3.h             |  2 +-
 Kernel_23/include/CGAL/Weighted_point_2.h     |  2 +-
 Kernel_23/include/CGAL/Weighted_point_3.h     |  2 +-
 .../include/CGAL/_test_cls_point_2.h          |  4 +-
 .../include/CGAL/_test_cls_point_3.h          |  4 +-
 .../CGAL/CMap_linear_cell_complex_storages.h  |  6 +--
 ..._linear_cell_complex_storages_with_index.h |  6 +--
 .../CGAL/GMap_linear_cell_complex_storages.h  |  6 +--
 ..._linear_cell_complex_storages_with_index.h |  6 +--
 .../include/CGAL/Linear_cell_complex_base.h   |  2 +-
 .../CGAL/Linear_cell_complex_constructors.h   |  2 +-
 .../CGAL/Linear_cell_complex_operations.h     |  6 +--
 .../include/CGAL/Compact_mesh_cell_base_3.h   |  2 +-
 Mesh_3/include/CGAL/Mesh_criteria_3.h         |  4 +-
 Mesh_3/test/Mesh_3/test_meshing_3D_image.cpp  |  2 +-
 .../test_meshing_3D_image_deprecated.cpp      |  2 +-
 .../test_meshing_3D_image_with_features.cpp   |  2 +-
 .../test/Mesh_3/test_meshing_polyhedron.cpp   |  2 +-
 Nef_2/include/CGAL/Nef_2/PM_overlayer.h       |  2 +-
 .../CGAL/NewKernel_d/Kernel_d_interface.h     |  4 +-
 .../include/CGAL/NewKernel_d/Vector/array.h   |  2 +-
 .../CGAL/NewKernel_d/Wrapper/Hyperplane_d.h   |  2 +-
 .../CGAL/NewKernel_d/Wrapper/Point_d.h        |  2 +-
 .../CGAL/NewKernel_d/Wrapper/Ref_count_obj.h  |  2 +-
 .../CGAL/NewKernel_d/Wrapper/Segment_d.h      |  2 +-
 .../CGAL/NewKernel_d/Wrapper/Sphere_d.h       |  2 +-
 .../CGAL/NewKernel_d/Wrapper/Vector_d.h       |  2 +-
 NewKernel_d/test/NewKernel_d/Epick_d.cpp      | 10 ++--
 Number_types/include/CGAL/Lazy_exact_nt.h     |  4 +-
 Number_types/include/CGAL/Mpzf.h              |  6 +--
 Number_types/include/CGAL/Root_of_traits.h    |  2 +-
 .../include/CGAL/Test/test_root_of_traits.h   | 12 ++---
 Number_types/include/CGAL/mpq_class.h         |  2 +-
 Number_types/include/CGAL/mpz_class.h         |  2 +-
 .../CGAL/simplest_rational_in_interval.h      |  4 +-
 Number_types/include/CGAL/to_rational.h       |  4 +-
 .../test/Number_types/Lazy_exact_nt_new.cpp   | 10 ++--
 .../test/Number_types/Quotient_new.cpp        |  6 +--
 .../test/Number_types/Sqrt_extension.h        |  8 +--
 .../include/CGAL/Test/test_root_of_2_traits.h |  6 +--
 Number_types/test/Number_types/ioformat.cpp   |  4 +-
 .../Number_types/known_bit_size_integers.cpp  | 16 +++---
 .../Number_types/test_nt_Coercion_traits.cpp  | 14 ++---
 .../internal/optimize_2.h                     |  2 +-
 .../oriented_bounding_box.h                   |  4 +-
 .../compute_registration_transformation.h     |  4 +-
 .../include/CGAL/OpenGR/register_point_sets.h |  4 +-
 .../include/CGAL/cluster_point_set.h          |  2 +-
 .../include/CGAL/jet_estimate_normals.h       |  2 +-
 .../include/CGAL/jet_smooth_point_set.h       |  2 +-
 .../compute_registration_transformation.h     |  6 +--
 .../include/CGAL/structure_point_set.h        |  2 +-
 .../CGAL/Polygon_mesh_processing/clip.h       |  2 +-
 .../connected_components.h                    |  2 +-
 .../Polygon_mesh_processing/corefinement.h    |  4 +-
 .../CGAL/Polygon_mesh_processing/distance.h   |  8 +--
 .../CGAL/Polygon_mesh_processing/fair.h       |  4 +-
 .../intersect_triangle_and_segment_3.h        |  2 +-
 .../Corefinement/intersection_nodes.h         |  6 +--
 .../intersection_of_coplanar_triangles_3.h    |  2 +-
 .../internal/Snapping/snap.h                  |  2 +-
 .../internal/Snapping/snap_vertices.h         |  6 +--
 .../Polygon_mesh_processing/intersection.h    |  8 +--
 .../CGAL/Polygon_mesh_processing/locate.h     |  4 +-
 .../CGAL/Polygon_mesh_processing/measure.h    |  2 +-
 .../orient_polygon_soup_extension.h           |  8 +--
 .../polygon_mesh_to_polygon_soup.h            |  2 +-
 .../polygon_soup_to_polygon_mesh.h            |  6 +--
 .../repair_self_intersections.h               |  2 +-
 .../self_intersections.h                      |  2 +-
 .../Polygon_mesh_processing/smooth_shape.h    |  4 +-
 .../Rigid_triangle_mesh_collision_detection.h |  4 +-
 .../Polyhedral_envelope_filter.h              |  2 +-
 .../test_pmp_locate.cpp                       |  4 +-
 Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h |  2 +-
 Polynomial/include/CGAL/Exponent_vector.h     |  2 +-
 .../Polynomial/Algebraic_structure_traits.h   |  2 +-
 .../include/CGAL/Polynomial/Polynomial_type.h |  2 +-
 .../include/CGAL/Polynomial/subresultants.h   |  2 +-
 Polynomial/include/CGAL/Polynomial_traits_d.h |  4 +-
 .../CGAL/Test/_test_polynomial_traits_d.h     | 48 ++++++++---------
 .../Polynomial/Polynomial_type_generator.cpp  |  6 +--
 Polynomial/test/Polynomial/test_polynomial.h  |  6 +--
 .../test_polynomial_Coercion_traits.cpp       |  2 +-
 .../test_polynomial_Get_arithmetic_kernel.cpp |  4 +-
 Ridges_3/include/CGAL/Ridges.h                |  8 +--
 Ridges_3/include/CGAL/Umbilics.h              |  8 +--
 .../include/CGAL/Handle_with_policy.h         |  8 +--
 .../include/CGAL/Named_function_parameters.h  |  6 +--
 STL_Extension/include/CGAL/assertions.h       |  6 ---
 STL_Extension/include/CGAL/for_each.h         |  4 +-
 STL_Extension/include/CGAL/iterator.h         |  2 +-
 .../include/CGAL/transforming_pair_iterator.h |  2 +-
 .../test/STL_Extension/test_Cache.cpp         | 12 ++---
 .../STL_Extension/test_Compact_container.cpp  |  2 +-
 .../STL_Extension/test_cgal_named_params.cpp  | 20 +++----
 .../test/STL_Extension/test_is_iterator.cpp   | 22 ++++----
 .../test/STL_Extension/test_is_streamable.cpp | 16 +++---
 .../test/STL_Extension/test_stl_extension.cpp | 18 +++----
 .../Weighted_PCA_smoother.h                   |  2 +-
 .../Shape_regularization/regularize_planes.h  |  2 +-
 .../include/CGAL/Snap_rounding_kd_2.h         |  2 +-
 Spatial_searching/include/CGAL/Kd_tree.h      |  2 +-
 .../include/CGAL/Hilbert_sort_median_2.h      |  2 +-
 .../include/CGAL/Hilbert_sort_median_3.h      |  2 +-
 .../test/Stream_support/test_ioformat.cpp     |  4 +-
 .../ARAP_parameterizer_3.h                    |  2 +-
 .../Fixed_border_parameterizer_3.h            |  2 +-
 .../Orbifold_Tutte_parameterizer_3.h          |  2 +-
 .../Bounded_distance_placement.h              |  2 +-
 .../Edge_collapse/FastEnvelope_filter.h       |  2 +-
 .../CGAL/Surface_mesher/Combining_oracle.h    |  2 +-
 .../CGAL/No_intersection_surface_sweep_2.h    |  2 +-
 .../CGAL/Triangulation_data_structure_3.h     |  2 +-
 .../include/CGAL/Triangulation_2_to_lcc.h     |  2 +-
 .../include/CGAL/Triangulation_3_to_lcc.h     |  2 +-
 .../CGAL/Delaunay_triangulation_on_sphere_2.h |  4 +-
 .../internal/arc_on_sphere_2_subsampling.h    |  2 +-
 221 files changed, 658 insertions(+), 664 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
index e738302d5331..ff091ce6c24b 100644
--- a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
+++ b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
@@ -201,7 +201,7 @@ template<typename Ray, typename SkipFunctor>
 boost::optional< typename AABB_tree<AABBTraits>::template Intersection_and_primitive_id<Ray>::Type >
 AABB_tree<AABBTraits>::first_intersection(const Ray& query,
                                           const SkipFunctor& skip) const {
-  CGAL_static_assertion_msg((std::is_same<Ray, typename AABBTraits::Ray_3>::value),
+  static_assert((std::is_same<Ray, typename AABBTraits::Ray_3>::value),
                             "Ray and Ray_3 must be the same type");
 
   switch(size()) // copy-paste from AABB_tree::traversal
diff --git a/AABB_tree/test/AABB_tree/aabb_test_is_ray_intersection_geomtraits.cpp b/AABB_tree/test/AABB_tree/aabb_test_is_ray_intersection_geomtraits.cpp
index c7198fe98e01..35612dc8ded1 100644
--- a/AABB_tree/test/AABB_tree/aabb_test_is_ray_intersection_geomtraits.cpp
+++ b/AABB_tree/test/AABB_tree/aabb_test_is_ray_intersection_geomtraits.cpp
@@ -26,16 +26,16 @@ int main()
 {
   using namespace CGAL::internal::AABB_tree;
 
-  CGAL_static_assertion_msg(
+  static_assert(
     (Is_ray_intersection_geomtraits<CGAL::Epeck>::value),
     "CGAL::Epeck should be a RayIntersectionGeomTraits");
-  CGAL_static_assertion_msg(
+  static_assert(
     (Is_ray_intersection_geomtraits< CGAL::Simple_cartesian<double> >::value),
     "CGAL::Epeck should be a RayIntersectionGeomTraits");
-  CGAL_static_assertion_msg(
+  static_assert(
     (!Is_ray_intersection_geomtraits<AABBGeomTraits>::value),
     "Pure AABBGeomTraits shouldn't be a RayIntersectionGeomTraits");
-  CGAL_static_assertion_msg(
+  static_assert(
     (!Is_ray_intersection_geomtraits<nope>::value),
     "The empty struct shouldn't be a RayIntersectionGeomTraits");
 
diff --git a/Algebraic_foundations/examples/Algebraic_foundations/fraction_traits.cpp b/Algebraic_foundations/examples/Algebraic_foundations/fraction_traits.cpp
index 1bd5f4bd02a2..42c1e8d92883 100644
--- a/Algebraic_foundations/examples/Algebraic_foundations/fraction_traits.cpp
+++ b/Algebraic_foundations/examples/Algebraic_foundations/fraction_traits.cpp
@@ -9,8 +9,8 @@ int main(){
     typedef FT::Numerator_type Numerator_type;
     typedef FT::Denominator_type Denominator_type;
 
-    CGAL_static_assertion((std::is_same<Numerator_type,CGAL::Gmpz>::value));
-    CGAL_static_assertion((std::is_same<Denominator_type,CGAL::Gmpz>::value));
+    static_assert((std::is_same<Numerator_type,CGAL::Gmpz>::value));
+    static_assert((std::is_same<Denominator_type,CGAL::Gmpz>::value));
 
     Numerator_type numerator;
     Denominator_type denominator;
diff --git a/Algebraic_foundations/examples/Algebraic_foundations/interoperable.cpp b/Algebraic_foundations/examples/Algebraic_foundations/interoperable.cpp
index abf8265a837b..0963f5f9d368 100644
--- a/Algebraic_foundations/examples/Algebraic_foundations/interoperable.cpp
+++ b/Algebraic_foundations/examples/Algebraic_foundations/interoperable.cpp
@@ -9,7 +9,7 @@ binary_func(const A& a , const B& b){
     typedef CGAL::Coercion_traits<A,B> CT;
 
     // check for explicit interoperability
-    CGAL_static_assertion((CT::Are_explicit_interoperable::value));
+    static_assert((CT::Are_explicit_interoperable::value));
 
     // CT::Cast is used to to convert both types into the coercion type
     typename CT::Cast cast;
diff --git a/Algebraic_foundations/include/CGAL/Algebraic_structure_traits.h b/Algebraic_foundations/include/CGAL/Algebraic_structure_traits.h
index cdfca7309769..a632e12a1972 100644
--- a/Algebraic_foundations/include/CGAL/Algebraic_structure_traits.h
+++ b/Algebraic_foundations/include/CGAL/Algebraic_structure_traits.h
@@ -353,7 +353,7 @@ class Algebraic_structure_traits_base< Type_,
             typedef Coercion_traits< NT1, NT2 > CT;
             typedef typename CT::Type Coercion_type_NT1_NT2;
             CGAL_USE_TYPE(Coercion_type_NT1_NT2);
-            CGAL_static_assertion((
+            static_assert((
               ::std::is_same<Coercion_type_NT1_NT2 , Type >::value));
 
             typename Coercion_traits< NT1, NT2 >::Cast cast;
diff --git a/Algebraic_foundations/include/CGAL/Coercion_traits.h b/Algebraic_foundations/include/CGAL/Coercion_traits.h
index 14acb431c7c2..09c387b5a092 100644
--- a/Algebraic_foundations/include/CGAL/Coercion_traits.h
+++ b/Algebraic_foundations/include/CGAL/Coercion_traits.h
@@ -35,7 +35,7 @@
 #define CGAL_IMPLICIT_INTEROPERABLE_BINARY_OPERATOR_WITH_RT( NT, Result_type  ) \
   template < class CT_Type_1, class CT_Type_2 >                         \
   Result_type operator()( const CT_Type_1& x, const CT_Type_2& y ) const { \
-    CGAL_static_assertion((::std::is_same<                              \
+    static_assert((::std::is_same<                              \
             typename Coercion_traits< CT_Type_1, CT_Type_2 >::Type, NT  \
             >::value));                                                 \
                                                                         \
diff --git a/Algebraic_foundations/include/CGAL/Scalar_factor_traits.h b/Algebraic_foundations/include/CGAL/Scalar_factor_traits.h
index db6b3df845d0..2d7840511976 100644
--- a/Algebraic_foundations/include/CGAL/Scalar_factor_traits.h
+++ b/Algebraic_foundations/include/CGAL/Scalar_factor_traits.h
@@ -85,13 +85,13 @@ class Scalar_factor_traits {
 
         // determine extractable scalar factor
         Scalar operator () (const NT& a) {
-            CGAL_static_assertion(( ::std::is_same< NT,Scalar >::value));
+            static_assert(( ::std::is_same< NT,Scalar >::value));
             typedef typename Algebraic_structure_traits<NT>::Algebraic_category SAT;
             return scalar_factor(a, SAT());
         }
         // determine extractable scalar factor
         Scalar operator () (const NT& a, const Scalar& d) {
-            CGAL_static_assertion(( ::std::is_same< NT,Scalar >::value));
+            static_assert(( ::std::is_same< NT,Scalar >::value));
             typedef typename Algebraic_structure_traits<NT>::Algebraic_category SAT;
             return scalar_factor(a,d,SAT());
         }
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h b/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h
index 5a5e23c7d8fc..68970af7441c 100644
--- a/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h
+++ b/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h
@@ -44,7 +44,7 @@
 template <typename AdaptableFunctor, typename ResultType>
 void check_result_type(AdaptableFunctor, ResultType){
   typedef typename AdaptableFunctor::result_type result_type;
-  CGAL_static_assertion((::std::is_same<result_type,ResultType>::value));
+  static_assert((::std::is_same<result_type,ResultType>::value));
   CGAL_USE_TYPE(result_type);
 }
 // check nothing for CGAL::Null_functor
@@ -122,12 +122,12 @@ void test_algebraic_structure_intern( const CGAL::Integral_domain_tag& ) {
     CGAL_SNAP_AST_FUNCTORS(AST);
 
     using CGAL::Null_functor;
-    CGAL_static_assertion(
+    static_assert(
         (!::std::is_same< Integral_division, Null_functor >::value));
-    CGAL_static_assertion((!::std::is_same< Divides, Null_functor >::value));
-    CGAL_static_assertion((!::std::is_same< Is_zero, Null_functor >::value));
-    CGAL_static_assertion((!::std::is_same< Is_one, Null_functor >::value));
-    CGAL_static_assertion((!::std::is_same< Square, Null_functor >::value));
+    static_assert((!::std::is_same< Divides, Null_functor >::value));
+    static_assert((!::std::is_same< Is_zero, Null_functor >::value));
+    static_assert((!::std::is_same< Is_one, Null_functor >::value));
+    static_assert((!::std::is_same< Square, Null_functor >::value));
 
     // functor
     const Is_zero is_zero = Is_zero();
@@ -206,7 +206,7 @@ void test_algebraic_structure_intern(
     CGAL_SNAP_AST_FUNCTORS(AST);
 
     using CGAL::Null_functor;
-    CGAL_static_assertion((!::std::is_same< Gcd, Null_functor>::value));
+    static_assert((!::std::is_same< Gcd, Null_functor>::value));
 
     const Gcd gcd = Gcd();
     assert( gcd(  AS ( 0), AS ( 0))  ==  unit_normal( AS (0) ) );
@@ -268,9 +268,9 @@ void test_algebraic_structure_intern( const CGAL::Euclidean_ring_tag&) {
     CGAL_SNAP_AST_FUNCTORS(AST);
 
     using CGAL::Null_functor;
-    CGAL_static_assertion((!::std::is_same< Div,     Null_functor>::value));
-    CGAL_static_assertion((!::std::is_same< Mod,     Null_functor>::value));
-    CGAL_static_assertion((!::std::is_same< Div_mod, Null_functor>::value));
+    static_assert((!::std::is_same< Div,     Null_functor>::value));
+    static_assert((!::std::is_same< Mod,     Null_functor>::value));
+    static_assert((!::std::is_same< Div_mod, Null_functor>::value));
 
     const Div     div=Div();
     const Mod     mod=Mod();
@@ -387,7 +387,7 @@ void test_algebraic_structure_intern( const CGAL::Field_with_sqrt_tag& ) {
 
     CGAL_SNAP_AST_FUNCTORS(AST);
 
-    CGAL_static_assertion((!::std::is_same< Sqrt, Null_functor>::value));
+    static_assert((!::std::is_same< Sqrt, Null_functor>::value));
     const Sqrt sqrt =Sqrt();
     AS  a(4);
 
@@ -613,11 +613,11 @@ class Test_is_square {
         CGAL_USE_TYPE(First_argument_type);
         CGAL_USE_TYPE(Second_argument_type);
 
-        CGAL_static_assertion(
+        static_assert(
                 ( ::std::is_same< AS , First_argument_type>::value));
-        CGAL_static_assertion(
+        static_assert(
                 ( ::std::is_same< AS& , Second_argument_type>::value));
-        //CGAL_static_assertion(( ::std::is_same< bool , Result_type>::value));
+        //static_assert(( ::std::is_same< bool , Result_type>::value));
         bool b = Result_type(true); CGAL_USE(b);
 
         AS test_number = AS(3)*AS(3);
@@ -649,8 +649,8 @@ class Test_sqrt {
         typedef typename Sqrt::result_type   Result_type;
         CGAL_USE_TYPE(Argument_type);
         CGAL_USE_TYPE(Result_type);
-        CGAL_static_assertion(( ::std::is_same< AS , Argument_type>::value));
-        CGAL_static_assertion(( ::std::is_same< AS , Result_type>::value));
+        static_assert(( ::std::is_same< AS , Argument_type>::value));
+        static_assert(( ::std::is_same< AS , Result_type>::value));
         typedef Algebraic_structure_traits<AS> AST;
         typedef typename AST::Is_exact Is_exact;
         assert( !Is_exact::value ||  AS (3) == sqrt( AS (9)));
@@ -675,11 +675,11 @@ class Test_root {
         CGAL_USE_TYPE(First_argument_type);
         CGAL_USE_TYPE(Second_argument_type);
         CGAL_USE_TYPE(Result_type);
-        CGAL_static_assertion(
+        static_assert(
                 ( ::std::is_same<int, First_argument_type>::value));
-        CGAL_static_assertion(
+        static_assert(
                 ( ::std::is_same< AS , Second_argument_type>::value));
-        CGAL_static_assertion(
+        static_assert(
                 ( ::std::is_same< AS , Result_type>::value));
          AS  epsilon(1);
         assert( test_equality_epsilon(  AS (2),
@@ -803,7 +803,7 @@ void test_algebraic_structure(){
     typedef CGAL::Algebraic_structure_traits<  AS  > AST;
     CGAL_SNAP_AST_FUNCTORS(AST);
 
-    CGAL_static_assertion((::std::is_same<AS,typename AST::Type>::value));
+    static_assert((::std::is_same<AS,typename AST::Type>::value));
 
     typedef typename AST::Boolean Boolean;
     assert(!Boolean());
@@ -816,14 +816,14 @@ void test_algebraic_structure(){
     using CGAL::Integral_domain_without_division_tag;
     using CGAL::Null_functor;
     // Test for desired exactness
-    CGAL_static_assertion(
+    static_assert(
             ( ::std::is_same< typename AST::Is_exact, Is_exact >::value));
 
-    CGAL_static_assertion(( ::boost::is_convertible< Tag,
+    static_assert(( ::boost::is_convertible< Tag,
                     Integral_domain_without_division_tag >::value ));
-    CGAL_static_assertion(( ::std::is_same< Tag, Algebraic_category>::value));
-    CGAL_static_assertion((!::std::is_same< Simplify, Null_functor>::value));
-    CGAL_static_assertion((!::std::is_same< Unit_part, Null_functor>::value));
+    static_assert(( ::std::is_same< Tag, Algebraic_category>::value));
+    static_assert((!::std::is_same< Simplify, Null_functor>::value));
+    static_assert((!::std::is_same< Unit_part, Null_functor>::value));
     const Simplify   simplify=Simplify();;
     const Unit_part  unit_part= Unit_part();
 
@@ -943,7 +943,7 @@ void test_algebraic_structure( const  AS & a, const  AS & b, const  AS & c) {
 
     typedef CGAL::Algebraic_structure_traits<AS> AST;
     typedef typename AST::Is_numerical_sensitive Is_numerical_sensitive;
-    CGAL_static_assertion(
+    static_assert(
             !(::std::is_same<Is_numerical_sensitive, CGAL::Null_tag>::value));
     CGAL_USE_TYPE(Is_numerical_sensitive);
 }
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_coercion_traits.h b/Algebraic_foundations/include/CGAL/Test/_test_coercion_traits.h
index 0caa6ced04ed..fab14e92e981 100644
--- a/Algebraic_foundations/include/CGAL/Test/_test_coercion_traits.h
+++ b/Algebraic_foundations/include/CGAL/Test/_test_coercion_traits.h
@@ -326,7 +326,7 @@ void test_implicit_interoperable_one_way() {
   typedef typename CT::Type C;
   typedef typename CT::Are_implicit_interoperable Are_implicit_interoperable;
 
-  CGAL_static_assertion(
+  static_assert(
       (::std::is_same<Are_implicit_interoperable, CGAL::Tag_true>::value));
   assert((::std::is_same<Are_implicit_interoperable, CGAL::Tag_true>::value));
 
@@ -346,9 +346,9 @@ void test_explicit_interoperable_one_way(){
   typedef typename CT::Cast Cast;
   typedef typename Cast::result_type result_type;
   CGAL_USE_TYPE(result_type);
-  CGAL_static_assertion((::std::is_same<result_type,Type>::value));
-  CGAL_static_assertion((::std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value));
-  CGAL_static_assertion((::std::is_same<Type,RT>::value));
+  static_assert((::std::is_same<result_type,Type>::value));
+  static_assert((::std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value));
+  static_assert((::std::is_same<Type,RT>::value));
   typename CT::Cast cast;
 
   A a(3);
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_fraction_traits.h b/Algebraic_foundations/include/CGAL/Test/_test_fraction_traits.h
index e1aa91eb29dd..c12411757b2f 100644
--- a/Algebraic_foundations/include/CGAL/Test/_test_fraction_traits.h
+++ b/Algebraic_foundations/include/CGAL/Test/_test_fraction_traits.h
@@ -37,11 +37,11 @@ void test_fraction_traits(){
     typedef typename FT::Compose   Compose;
 
     CGAL_USE_TYPE(Is_fraction);
-    CGAL_static_assertion( (::std::is_same<Type,T>::value));
-    CGAL_static_assertion( (::std::is_same<Is_fraction,Tag_true>::value));
-    CGAL_static_assertion(!(::std::is_same<Common_factor,Null_functor>::value));
-    CGAL_static_assertion(!(::std::is_same<Decompose,Null_functor>::value));
-    CGAL_static_assertion(!(::std::is_same<Compose,Null_functor>::value));
+    static_assert( (::std::is_same<Type,T>::value));
+    static_assert( (::std::is_same<Is_fraction,Tag_true>::value));
+    static_assert(!(::std::is_same<Common_factor,Null_functor>::value));
+    static_assert(!(::std::is_same<Decompose,Null_functor>::value));
+    static_assert(!(::std::is_same<Compose,Null_functor>::value));
 
 
     // Decompose
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_rational_traits.h b/Algebraic_foundations/include/CGAL/Test/_test_rational_traits.h
index 5efda40bc2f0..26dce67e619b 100644
--- a/Algebraic_foundations/include/CGAL/Test/_test_rational_traits.h
+++ b/Algebraic_foundations/include/CGAL/Test/_test_rational_traits.h
@@ -29,7 +29,7 @@ void test_rational_traits(){
 
     typedef Rational_traits<Rational> Rational_traits;
     typedef typename Rational_traits::RT RT;
-    CGAL_static_assertion((::std::is_same<RT,RT>::value));
+    static_assert((::std::is_same<RT,RT>::value));
 
     assert( Rational_traits().numerator(x) == RT(7));
     assert( Rational_traits().denominator(x) == RT(2));
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_real_embeddable.h b/Algebraic_foundations/include/CGAL/Test/_test_real_embeddable.h
index bb67e3f57a53..1f7e818d2d36 100644
--- a/Algebraic_foundations/include/CGAL/Test/_test_real_embeddable.h
+++ b/Algebraic_foundations/include/CGAL/Test/_test_real_embeddable.h
@@ -48,9 +48,9 @@ namespace CGAL {
         void operator() (const ToDouble& to_double) {
             typedef typename ToDouble::argument_type Argument_type;
             typedef typename ToDouble::result_type   Result_type;
-            CGAL_static_assertion(( ::std::is_same<Type, Argument_type>::value));
+            static_assert(( ::std::is_same<Type, Argument_type>::value));
             CGAL_USE_TYPE(Argument_type);
-            CGAL_static_assertion(( ::std::is_same<double, Result_type>::value));
+            static_assert(( ::std::is_same<double, Result_type>::value));
             CGAL_USE_TYPE(Result_type);
             assert(42.0 == to_double(Type(42)));
         }
@@ -71,9 +71,9 @@ namespace CGAL {
             typedef typename To_interval::argument_type Argument_type;
             typedef typename To_interval::result_type   Result_type;
             typedef std::pair<double,double>  Interval_type;
-            CGAL_static_assertion(( ::std::is_same<Type, Argument_type>::value));
+            static_assert(( ::std::is_same<Type, Argument_type>::value));
             CGAL_USE_TYPE(Argument_type);
-            CGAL_static_assertion(( ::std::is_same<Interval_type, Result_type>::value));
+            static_assert(( ::std::is_same<Interval_type, Result_type>::value));
             CGAL_USE_TYPE(Result_type); CGAL_USE_TYPE(Interval_type);
 
 //            assert(NiX::in(42.0,to_Interval(Type(42))));
@@ -139,7 +139,7 @@ void test_real_embeddable() {
     CGAL_SNAP_RET_FUNCTORS(RET);
     typedef typename RET::Is_real_embeddable Is_real_embeddable;
     using CGAL::Tag_true;
-    CGAL_static_assertion(( ::std::is_same< Is_real_embeddable, Tag_true>::value));
+    static_assert(( ::std::is_same< Is_real_embeddable, Tag_true>::value));
     CGAL_USE_TYPE(Is_real_embeddable);
 
     typedef typename RET::Boolean Boolean;
@@ -246,7 +246,7 @@ void test_not_real_embeddable() {
     typedef CGAL::Real_embeddable_traits<Type> RET;
     typedef typename RET::Is_real_embeddable Is_real_embeddable;
     using CGAL::Tag_false;
-    CGAL_static_assertion(( ::std::is_same< Is_real_embeddable, Tag_false>::value));
+    static_assert(( ::std::is_same< Is_real_embeddable, Tag_false>::value));
     CGAL_USE_TYPE(Is_real_embeddable);
 }
 
@@ -254,13 +254,13 @@ void test_not_real_embeddable() {
 //template <class Type, class CeilLog2Abs>
 //void test_rounded_log2_abs(Type zero, CGAL::Null_functor, CeilLog2Abs) {
 //    typedef CGAL::Null_functor Null_functor;
-//    CGAL_static_assertion(( ::std::is_same< CeilLog2Abs, Null_functor>::value));
+//    static_assert(( ::std::is_same< CeilLog2Abs, Null_functor>::value));
 //}
 //
 //template <class Type, class FloorLog2Abs, class CeilLog2Abs>
 //void test_rounded_log2_abs(Type zero, FloorLog2Abs fl_log, CeilLog2Abs cl_log) {
 //    typedef CGAL::Null_functor Null_functor;
-//    CGAL_static_assertion((!::std::is_same< CeilLog2Abs, Null_functor>::value));
+//    static_assert((!::std::is_same< CeilLog2Abs, Null_functor>::value));
 //
 //    assert( fl_log(Type( 7)) == 2 );
 //    assert( cl_log(Type( 7)) == 3 );
diff --git a/Algebraic_foundations/test/Algebraic_foundations/Algebraic_extension_traits.cpp b/Algebraic_foundations/test/Algebraic_foundations/Algebraic_extension_traits.cpp
index 87e5235cfe1c..03ee581bcbfa 100644
--- a/Algebraic_foundations/test/Algebraic_foundations/Algebraic_extension_traits.cpp
+++ b/Algebraic_foundations/test/Algebraic_foundations/Algebraic_extension_traits.cpp
@@ -9,21 +9,21 @@ int main(){
 
         typedef AET::Type Type;
         CGAL_USE_TYPE(Type);
-        CGAL_static_assertion((::std::is_same<int,Type>::value));
+        static_assert((::std::is_same<int,Type>::value));
 
         typedef AET::Is_extended Is_extended;
         CGAL_USE_TYPE(Is_extended);
-        CGAL_static_assertion(
+        static_assert(
                 (::std::is_same<CGAL::Tag_false,Is_extended>::value));
 
         typedef AET::Normalization_factor Normalization_factor;
         {
             typedef Normalization_factor::argument_type argument_type;
             CGAL_USE_TYPE(argument_type);
-            CGAL_static_assertion((::std::is_same<argument_type,int>::value));
+            static_assert((::std::is_same<argument_type,int>::value));
             typedef Normalization_factor::result_type result_type;
             CGAL_USE_TYPE(result_type);
-            CGAL_static_assertion((::std::is_same<result_type,int>::value));
+            static_assert((::std::is_same<result_type,int>::value));
             Normalization_factor nfac;
             assert(nfac(3)==1);
         }
@@ -31,10 +31,10 @@ int main(){
         {
             typedef DFAI::argument_type argument_type;
             CGAL_USE_TYPE(argument_type);
-            CGAL_static_assertion((::std::is_same<argument_type,int>::value));
+            static_assert((::std::is_same<argument_type,int>::value));
             typedef DFAI::result_type result_type;
             CGAL_USE_TYPE(result_type);
-            CGAL_static_assertion((::std::is_same<result_type,int>::value));
+            static_assert((::std::is_same<result_type,int>::value));
             DFAI dfai;
             assert(dfai(3)==1);
         }
@@ -45,21 +45,21 @@ int main(){
 
         typedef AET::Type Type;
         CGAL_USE_TYPE(Type);
-        CGAL_static_assertion((::std::is_same<EXT,Type>::value));
+        static_assert((::std::is_same<EXT,Type>::value));
 
         typedef AET::Is_extended Is_extended;
         CGAL_USE_TYPE(Is_extended);
-        CGAL_static_assertion(
+        static_assert(
                 (::std::is_same<CGAL::Tag_true,Is_extended>::value));
 
         typedef AET::Normalization_factor Normalization_factor;
         {
             typedef Normalization_factor::argument_type argument_type;
             CGAL_USE_TYPE(argument_type);
-            CGAL_static_assertion((::std::is_same<argument_type,EXT>::value));
+            static_assert((::std::is_same<argument_type,EXT>::value));
             typedef Normalization_factor::result_type result_type;
             CGAL_USE_TYPE(result_type);
-            CGAL_static_assertion((::std::is_same<result_type,EXT>::value));
+            static_assert((::std::is_same<result_type,EXT>::value));
             Normalization_factor nfac;
             assert(nfac(EXT(3))==1);
             assert(nfac(EXT(3,0,5))==1);
@@ -69,10 +69,10 @@ int main(){
         {
             typedef DFAI::argument_type argument_type;
             CGAL_USE_TYPE(argument_type);
-            CGAL_static_assertion((::std::is_same<argument_type,EXT>::value));
+            static_assert((::std::is_same<argument_type,EXT>::value));
             typedef DFAI::result_type result_type;
             CGAL_USE_TYPE(result_type);
-            CGAL_static_assertion((::std::is_same<result_type,EXT>::value));
+            static_assert((::std::is_same<result_type,EXT>::value));
             DFAI dfai;
             assert(dfai(EXT(3))==1);
             assert(dfai(EXT(3,0,5))==1);
diff --git a/Algebraic_foundations/test/Algebraic_foundations/Algebraic_structure_traits.cpp b/Algebraic_foundations/test/Algebraic_foundations/Algebraic_structure_traits.cpp
index bc1e4b85bb09..f8cb5910ce1e 100644
--- a/Algebraic_foundations/test/Algebraic_foundations/Algebraic_structure_traits.cpp
+++ b/Algebraic_foundations/test/Algebraic_foundations/Algebraic_structure_traits.cpp
@@ -7,7 +7,7 @@
     {                                                                   \
         typedef AST::NAME NAME;                                         \
         CGAL_USE_TYPE(NAME);                                             \
-        CGAL_static_assertion(                                            \
+        static_assert(                                            \
                 (::std::is_same<CGAL::Null_functor,NAME>::value));    \
     }
 
@@ -16,19 +16,19 @@ int main(){
 
     typedef AST::Type Type;
     CGAL_USE_TYPE(Type);
-    CGAL_static_assertion((::std::is_same<void,Type>::value));
+    static_assert((::std::is_same<void,Type>::value));
 
     typedef AST::Algebraic_category Algebraic_category;
     CGAL_USE_TYPE(Algebraic_category);
-    CGAL_static_assertion(
+    static_assert(
         (::std::is_same<CGAL::Null_tag,Algebraic_category>::value));
 
     typedef AST::Is_exact Is_exact;
     CGAL_USE_TYPE(Is_exact);
-    CGAL_static_assertion((::std::is_same<CGAL::Null_tag,Is_exact>::value));
+    static_assert((::std::is_same<CGAL::Null_tag,Is_exact>::value));
     typedef AST::Is_numerical_sensitive Is_sensitive;
     CGAL_USE_TYPE(Is_sensitive);
-    CGAL_static_assertion((::std::is_same<CGAL::Null_tag,Is_sensitive>::value));
+    static_assert((::std::is_same<CGAL::Null_tag,Is_sensitive>::value));
 
     CGAL_IS_AST_NULL_FUNCTOR (  Simplify);
     CGAL_IS_AST_NULL_FUNCTOR (  Unit_part);
diff --git a/Algebraic_foundations/test/Algebraic_foundations/Coercion_traits.cpp b/Algebraic_foundations/test/Algebraic_foundations/Coercion_traits.cpp
index 7deecf693cc1..7fcb803e94c4 100644
--- a/Algebraic_foundations/test/Algebraic_foundations/Coercion_traits.cpp
+++ b/Algebraic_foundations/test/Algebraic_foundations/Coercion_traits.cpp
@@ -6,22 +6,22 @@ int main(){
     {
     typedef CGAL::Coercion_traits<int,int> CT;
     CGAL_USE_TYPE(CT);
-    CGAL_static_assertion(( std::is_same<CT::Type,int>::value));
-    CGAL_static_assertion(
+    static_assert(( std::is_same<CT::Type,int>::value));
+    static_assert(
             ( std::is_same<CT::Are_implicit_interoperable,CGAL::Tag_true>::value));
-    CGAL_static_assertion(
+    static_assert(
             ( std::is_same<CT::Are_explicit_interoperable,CGAL::Tag_true>::value));
     assert( 5 == CT::Cast()(5));
     }
     {
     typedef CGAL::Coercion_traits<CGAL::Tag_true,CGAL::Tag_false> CT;
     CGAL_USE_TYPE(CT);
-//    CGAL_static_assertion(( std::is_same<CT::Type,CGAL::Null_type>::value));
-    CGAL_static_assertion(
+//    static_assert(( std::is_same<CT::Type,CGAL::Null_type>::value));
+    static_assert(
             ( std::is_same<CT::Are_implicit_interoperable,CGAL::Tag_false>::value));
-    CGAL_static_assertion(
+    static_assert(
             ( std::is_same<CT::Are_explicit_interoperable,CGAL::Tag_false>::value));
-    CGAL_static_assertion(
+    static_assert(
             ( std::is_same<CT::Cast,CGAL::Null_functor>::value));
     }
 }
diff --git a/Algebraic_foundations/test/Algebraic_foundations/Real_embeddable_traits.cpp b/Algebraic_foundations/test/Algebraic_foundations/Real_embeddable_traits.cpp
index f9288c9eefd4..3d03fb37e388 100644
--- a/Algebraic_foundations/test/Algebraic_foundations/Real_embeddable_traits.cpp
+++ b/Algebraic_foundations/test/Algebraic_foundations/Real_embeddable_traits.cpp
@@ -7,7 +7,7 @@
     {                                                                   \
         typedef RET::NAME NAME;                                         \
         CGAL_USE_TYPE(NAME);                                            \
-        CGAL_static_assertion(                                            \
+        static_assert(                                            \
                 (::std::is_same<CGAL::Null_functor,NAME>::value));    \
     }
 
@@ -16,11 +16,11 @@ int main(){
 
     typedef RET::Type Type;
     CGAL_USE_TYPE(Type);
-    CGAL_static_assertion((::std::is_same<void,Type>::value));
+    static_assert((::std::is_same<void,Type>::value));
 
     typedef RET::Is_real_embeddable Is_real_embeddable;
     CGAL_USE_TYPE(Is_real_embeddable);
-    CGAL_static_assertion((::std::is_same<CGAL::Tag_false,Is_real_embeddable>::value));
+    static_assert((::std::is_same<CGAL::Tag_false,Is_real_embeddable>::value));
 
     CGAL_IS_RET_NULL_FUNCTOR(Abs);
     CGAL_IS_RET_NULL_FUNCTOR(Sgn);
diff --git a/Algebraic_foundations/test/Algebraic_foundations/Scalar_factor_traits.cpp b/Algebraic_foundations/test/Algebraic_foundations/Scalar_factor_traits.cpp
index b2b6ffd0bf3a..af4cc52c0d60 100644
--- a/Algebraic_foundations/test/Algebraic_foundations/Scalar_factor_traits.cpp
+++ b/Algebraic_foundations/test/Algebraic_foundations/Scalar_factor_traits.cpp
@@ -7,32 +7,32 @@
 int main(){
     typedef CGAL::Scalar_factor_traits<int> SFT;
     CGAL_USE_TYPE(SFT);
-    CGAL_static_assertion((::std::is_same<int, SFT::Type>::value));
-    CGAL_static_assertion((::std::is_same<int, SFT::Scalar>::value));
+    static_assert((::std::is_same<int, SFT::Type>::value));
+    static_assert((::std::is_same<int, SFT::Scalar>::value));
 
     typedef SFT::Scalar_factor Scalar_factor;
     {
         typedef Scalar_factor::result_type result_type;
         CGAL_USE_TYPE(result_type);
-        CGAL_static_assertion((::std::is_same<int, result_type>::value));
+        static_assert((::std::is_same<int, result_type>::value));
 
         typedef Scalar_factor::argument_type argument_type;
         CGAL_USE_TYPE(argument_type);
-        CGAL_static_assertion((::std::is_same<int, argument_type>::value));
+        static_assert((::std::is_same<int, argument_type>::value));
     }
     typedef SFT::Scalar_div Scalar_div;
     {
         typedef Scalar_div::result_type result_type;
         CGAL_USE_TYPE(result_type);
-        CGAL_static_assertion((::std::is_same<void, result_type>::value));
+        static_assert((::std::is_same<void, result_type>::value));
 
         typedef Scalar_div::first_argument_type first_argument_type;
         CGAL_USE_TYPE(first_argument_type);
-        CGAL_static_assertion(
+        static_assert(
                 (::std::is_same<int&, first_argument_type>::value));
         typedef Scalar_div::second_argument_type second_argument_type;
         CGAL_USE_TYPE(second_argument_type);
-        CGAL_static_assertion(
+        static_assert(
                 (::std::is_same<int, second_argument_type>::value));
     }
 
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
index 002e108b0ec6..a02edebb8e13 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
@@ -481,16 +481,16 @@ class Algebraic_curve_kernel_2 : public AlgebraicKernel_d_1{
       Curve_analysis_2 _construct_defining_polynomial_from(Bound b) const {
         typedef CGAL::Fraction_traits<Bound> FT;
         // We rely on the fact that the Bound is a fraction
-        CGAL_static_assertion((::std::is_same<typename FT::Is_fraction,
+        static_assert((::std::is_same<typename FT::Is_fraction,
                                              CGAL::Tag_true>::value));
         typedef typename FT::Numerator_type Numerator;
         typedef typename FT::Denominator_type Denominator;
         typedef CGAL::Coercion_traits<Numerator,Coefficient> Num_coercion;
-        CGAL_static_assertion((::std::is_same
+        static_assert((::std::is_same
                               <Coefficient,
                                   typename Num_coercion::Type>::value));
         typedef CGAL::Coercion_traits<Denominator,Coefficient> Denom_coercion;
-        CGAL_static_assertion((::std::is_same
+        static_assert((::std::is_same
                                <Coefficient,
                                 typename Denom_coercion::Type>::value));
         typename Num_coercion::Cast num_cast;
@@ -2541,16 +2541,16 @@ class Algebraic_curve_kernel_2 : public AlgebraicKernel_d_1{
       Polynomial_1 operator() (const Polynomial_2& f, Bound b) const {
         typedef CGAL::Fraction_traits<Bound> FT;
         // We rely on the fact that the Bound is a fraction
-        CGAL_static_assertion((::std::is_same<typename FT::Is_fraction,
+        static_assert((::std::is_same<typename FT::Is_fraction,
                                              CGAL::Tag_true>::value));
         typedef typename FT::Numerator_type Numerator;
         typedef typename FT::Denominator_type Denominator;
         typedef CGAL::Coercion_traits<Numerator,Coefficient> Num_coercion;
-        CGAL_static_assertion((::std::is_same
+        static_assert((::std::is_same
                               <Coefficient,
                                   typename Num_coercion::Type>::value));
         typedef CGAL::Coercion_traits<Denominator,Coefficient> Denom_coercion;
-        CGAL_static_assertion((::std::is_same
+        static_assert((::std::is_same
                                <Coefficient,
                                 typename Denom_coercion::Type>::value));
         typename Num_coercion::Cast num_cast;
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_d_1.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_d_1.h
index 54fcec0b3f58..2b5a30867ce5 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_d_1.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_d_1.h
@@ -71,7 +71,7 @@ class Algebraic_real_d_1 :
     public ::CGAL::Handle_with_policy< AlgebraicRealRep_d_1, HandlePolicy > {
 
   // currently Rational is the only supported Bound type.
-  CGAL_static_assertion(
+  static_assert(
       (   ::std::is_same <Rational_,
           typename Get_arithmetic_kernel<Coefficient_>::Arithmetic_kernel::Rational>::value));
 
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/algebraic_curve_kernel_2_tools.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/algebraic_curve_kernel_2_tools.h
index 1609fdbaa6ba..4a2b7bd038ea 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/algebraic_curve_kernel_2_tools.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/algebraic_curve_kernel_2_tools.h
@@ -186,7 +186,7 @@ template<typename AlgebraicKernel_1,
                                           InputIterator start,
                                           InputIterator end,
                                           OutputIterator output) {
-    CGAL_static_assertion
+    static_assert
       ((::std::is_same
         <typename AlgebraicKernel_1::Algebraic_real_1,
         typename std::iterator_traits<InputIterator>::value_type >::value));
@@ -224,12 +224,12 @@ template<typename Poly_coer_1,typename Polynomial_1>
   void cast_back_utcf(const Poly_coer_1& p,Polynomial_1& q) {
   // We can assume that both template arguments are polynomial types
   typedef CGAL::Fraction_traits<Poly_coer_1> FT;
-  CGAL_static_assertion((::std::is_same<typename FT::Is_fraction,
+  static_assert((::std::is_same<typename FT::Is_fraction,
                        CGAL::Tag_true>::value));
   typedef typename FT::Numerator_type Numerator;
   typedef typename FT::Denominator_type Denominator;
   typedef CGAL::Coercion_traits<Numerator,Polynomial_1> Num_coercion;
-  CGAL_static_assertion((::std::is_same
+  static_assert((::std::is_same
                        <Polynomial_1,
                        typename Num_coercion::Type>::value));
   Numerator p_num;
diff --git a/Algebraic_kernel_d/test/Algebraic_kernel_d/Real_embeddable_traits_extension.cpp b/Algebraic_kernel_d/test/Algebraic_kernel_d/Real_embeddable_traits_extension.cpp
index 2e06d3b6aece..c56969868c1a 100644
--- a/Algebraic_kernel_d/test/Algebraic_kernel_d/Real_embeddable_traits_extension.cpp
+++ b/Algebraic_kernel_d/test/Algebraic_kernel_d/Real_embeddable_traits_extension.cpp
@@ -47,8 +47,8 @@ void test_real_embeddable_extension(const NT_&){
     typedef typename Floor::result_type   Result_type;
     CGAL_USE_TYPE(Argument_type);
     CGAL_USE_TYPE(Result_type);
-    CGAL_static_assertion(( ::std::is_same<NT, Argument_type>::value));
-    CGAL_static_assertion(( ::std::is_same<Integer, Result_type>::value));
+    static_assert(( ::std::is_same<NT, Argument_type>::value));
+    static_assert(( ::std::is_same<Integer, Result_type>::value));
     assert(Integer(42) == floor(NT(42)));
     assert(Integer(-42) == floor(NT(-42)));
   }
@@ -59,8 +59,8 @@ void test_real_embeddable_extension(const NT_&){
     typedef typename Floor_log2_abs::result_type   Result_type;
     CGAL_USE_TYPE(Argument_type);
     CGAL_USE_TYPE(Result_type);
-    CGAL_static_assertion(( ::std::is_same<NT, Argument_type>::value));
-    CGAL_static_assertion(( ::std::is_same<long, Result_type>::value));
+    static_assert(( ::std::is_same<NT, Argument_type>::value));
+    static_assert(( ::std::is_same<long, Result_type>::value));
 
     assert(long(0) == floor_log2_abs(NT(1)));
     assert(long(0) == floor_log2_abs(NT(-1)));
@@ -86,8 +86,8 @@ void test_real_embeddable_extension(const NT_&){
     typedef typename Ceil::result_type   Result_type;
     CGAL_USE_TYPE(Argument_type);
     CGAL_USE_TYPE(Result_type);
-    CGAL_static_assertion(( ::std::is_same<NT, Argument_type>::value));
-    CGAL_static_assertion(( ::std::is_same<Integer, Result_type>::value));
+    static_assert(( ::std::is_same<NT, Argument_type>::value));
+    static_assert(( ::std::is_same<Integer, Result_type>::value));
     assert(Integer(42) == ceil(NT(42)));
     assert(Integer(-42) == ceil(NT(-42)));
   }
@@ -98,8 +98,8 @@ void test_real_embeddable_extension(const NT_&){
     typedef typename Ceil_log2_abs::result_type   Result_type;
     CGAL_USE_TYPE(Argument_type);
     CGAL_USE_TYPE(Result_type);
-    CGAL_static_assertion(( ::std::is_same<NT, Argument_type>::value));
-    CGAL_static_assertion(( ::std::is_same<long, Result_type>::value));
+    static_assert(( ::std::is_same<NT, Argument_type>::value));
+    static_assert(( ::std::is_same<long, Result_type>::value));
 
     assert(long(0) == ceil_log2_abs(NT(1)));
     assert(long(0) == ceil_log2_abs(NT(-1)));
diff --git a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_curve_kernel_2.h b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_curve_kernel_2.h
index 01a27244d746..e110e2b7c955 100644
--- a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_curve_kernel_2.h
+++ b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_curve_kernel_2.h
@@ -62,18 +62,18 @@ void test_algebraic_curve_kernel_2() {
 
     typedef AlgebraicCurveKernel_2 AK_2;
 
-  /*  CGAL_static_assertion( (::std::is_same<
+  /*  static_assert( (::std::is_same<
             Algebraic_real_1, typename AK::Algebraic_real_1 >::value) );
 
-    CGAL_static_assertion((::std::is_same<
+    static_assert((::std::is_same<
             Isolator,
             typename AK::Isolator >::value) );
 
-    CGAL_static_assertion((::std::is_same<
+    static_assert((::std::is_same<
             Coefficient,
             typename AK::Coefficient >::value));
 
-    CGAL_static_assertion((::std::is_same<
+    static_assert((::std::is_same<
             Polynomial_1,
             typename AK::Polynomial_1 >::value));*/
 
diff --git a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_1.h b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_1.h
index 20ecd337223e..7d12134feff2 100644
--- a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_1.h
+++ b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_1.h
@@ -109,8 +109,8 @@ void test_algebraic_kernel_1(const AlgebraicKernel_d_1& ak_1){
     typedef typename Name::result_type   RT_;                     \
     CGAL_USE_TYPE(AT_);                                           \
     CGAL_USE_TYPE(RT_);                                           \
-    {CGAL_static_assertion(( ::std::is_same<AT,AT_>::value));}  \
-    {CGAL_static_assertion(( ::std::is_same<RT,RT_>::value));}  \
+    {static_assert(( ::std::is_same<AT,AT_>::value));}  \
+    {static_assert(( ::std::is_same<RT,RT_>::value));}  \
   }
 #define CGAL_CHECK_BFUNCTION(Name,AT1,AT2,RT)                           \
   {                                                                     \
@@ -120,9 +120,9 @@ void test_algebraic_kernel_1(const AlgebraicKernel_d_1& ak_1){
     CGAL_USE_TYPE(AT1_);                                                \
     CGAL_USE_TYPE(AT2_);                                                \
     CGAL_USE_TYPE(RT_);                                                 \
-    {CGAL_static_assertion(( ::std::is_same<AT1,AT1_>::value));}      \
-    {CGAL_static_assertion(( ::std::is_same<AT2,AT2_>::value));}      \
-    {CGAL_static_assertion(( ::std::is_same<RT,RT_>::value));}        \
+    {static_assert(( ::std::is_same<AT1,AT1_>::value));}      \
+    {static_assert(( ::std::is_same<AT2,AT2_>::value));}      \
+    {static_assert(( ::std::is_same<RT,RT_>::value));}        \
   }
 
   // TODO: missing check for Construct_algebraic_real_1
diff --git a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_2.h b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_2.h
index ff04c8f8c9d6..4db859ddb25c 100644
--- a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_2.h
+++ b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_2.h
@@ -93,8 +93,8 @@ void test_algebraic_kernel_2(const AlgebraicKernel_2& ak_2) {
     typedef typename Name::result_type   RT_;                   \
     CGAL_USE_TYPE(AT_);                                           \
     CGAL_USE_TYPE(RT_);                                           \
-    {CGAL_static_assertion(( ::std::is_same<AT,AT_>::value));}  \
-    {CGAL_static_assertion(( ::std::is_same<RT,RT_>::value));}  \
+    {static_assert(( ::std::is_same<AT,AT_>::value));}  \
+    {static_assert(( ::std::is_same<RT,RT_>::value));}  \
   }
   #define CGAL_CHECK_BFUNCTION(Name,AT1,AT2,RT)                           \
   {                                                                     \
@@ -104,13 +104,13 @@ void test_algebraic_kernel_2(const AlgebraicKernel_2& ak_2) {
     CGAL_USE_TYPE(AT1_);                                                 \
     CGAL_USE_TYPE(AT2_);                                                \
     CGAL_USE_TYPE(RT_);                                                 \
-    {CGAL_static_assertion(( ::std::is_same<AT1,AT1_>::value));}        \
-    {CGAL_static_assertion(( ::std::is_same<AT2,AT2_>::value));}        \
-    {CGAL_static_assertion(( ::std::is_same<RT,RT_>::value));}          \
+    {static_assert(( ::std::is_same<AT1,AT1_>::value));}        \
+    {static_assert(( ::std::is_same<AT2,AT2_>::value));}        \
+    {static_assert(( ::std::is_same<RT,RT_>::value));}          \
   }
 
 
-  CGAL_static_assertion(( ::std::is_same
+  static_assert(( ::std::is_same
                          <Algebraic_real_2,
                          typename Construct_algebraic_real_2::result_type>
                            ::value));
@@ -118,7 +118,7 @@ void test_algebraic_kernel_2(const AlgebraicKernel_2& ak_2) {
   CGAL_CHECK_UFUNCTION(Make_square_free_2,Polynomial_2,Polynomial_2);
   // TODO: missing check for Square_free_factorize_2
   CGAL_CHECK_BFUNCTION(Is_coprime_2,Polynomial_2,Polynomial_2,bool);
-  CGAL_static_assertion(( ::std::is_same
+  static_assert(( ::std::is_same
                          <bool,typename Make_coprime_2::result_type>::value));
   CGAL_CHECK_BFUNCTION(Number_of_solutions_2,Polynomial_2,Polynomial_2,
                        size_type);
@@ -128,7 +128,7 @@ void test_algebraic_kernel_2(const AlgebraicKernel_2& ak_2) {
   CGAL_CHECK_UFUNCTION(Compute_polynomial_y_2,Algebraic_real_2,Polynomial_1);
   CGAL_CHECK_BFUNCTION(Isolate_x_2,Algebraic_real_2,Polynomial_1,BInterval);
   CGAL_CHECK_BFUNCTION(Isolate_y_2,Algebraic_real_2,Polynomial_1,BInterval);
-  CGAL_static_assertion(( ::std::is_same
+  static_assert(( ::std::is_same
                          < BArray,typename Isolate_2::result_type>::value));
   CGAL_CHECK_BFUNCTION(Sign_at_2,Polynomial_2,Algebraic_real_2,Sign);
   CGAL_CHECK_BFUNCTION(Is_zero_at_2,Polynomial_2,Algebraic_real_2,bool);
diff --git a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_real_comparable.h b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_real_comparable.h
index a393abe3653d..dc9f13e3a038 100644
--- a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_real_comparable.h
+++ b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_real_comparable.h
@@ -39,8 +39,8 @@ namespace internal {
         void operator() (ToDouble to_double) {
             typedef typename ToDouble::argument_type Argument_type;
             typedef typename ToDouble::result_type   Result_type;
-            CGAL_static_assertion((::std::is_same<NT, Argument_type>::value));
-            CGAL_static_assertion((::std::is_same<double, Result_type>::value));
+            static_assert((::std::is_same<NT, Argument_type>::value));
+            static_assert((::std::is_same<double, Result_type>::value));
             assert(42.0 == to_double(NT(42)));
         }
     };
@@ -59,8 +59,8 @@ namespace internal {
         void operator() (ToInterval to_Interval) {
             typedef typename ToInterval::argument_type Argument_type;
             typedef typename ToInterval::result_type   Result_type;
-            CGAL_static_assertion((::std::is_same<NT, Argument_type>::value));
-            CGAL_static_assertion((::std::is_same< typename Argument_type::Interval, Result_type>::value));
+            static_assert((::std::is_same<NT, Argument_type>::value));
+            static_assert((::std::is_same< typename Argument_type::Interval, Result_type>::value));
 
             // TODO: NiX::in not available!?
             //assert(NiX::in(42.0,to_Interval(NT(42))));
@@ -99,7 +99,7 @@ void test_real_comparable() {
     typedef CGAL::Real_embeddable_traits<NT> Traits;
     typedef typename Traits::Is_real_embeddable Is_real_comparable;
     using ::CGAL::Tag_true;
-    CGAL_static_assertion((::std::is_same< Is_real_comparable, Tag_true>::value));
+    static_assert((::std::is_same< Is_real_comparable, Tag_true>::value));
     typename Traits::Compare compare;
     typename Traits::Sign    sign;
     typename Traits::Abs     abs;
@@ -168,20 +168,20 @@ void test_not_real_comparable() {
     typedef CGAL::Real_embeddable_traits<NT> Traits;
     typedef typename Traits::Is_real_embeddable Is_real_comparable;
     using ::CGAL::Tag_false;
-    CGAL_static_assertion((::std::is_same< Is_real_comparable, Tag_false>::value));
+    static_assert((::std::is_same< Is_real_comparable, Tag_false>::value));
 }
 
 
 template <class NT, class CeilLog2Abs>
 void test_rounded_log2_abs(NT zero, ::CGAL::Null_functor, CeilLog2Abs) {
     typedef ::CGAL::Null_functor Nulltype;
-    CGAL_static_assertion((::std::is_same< CeilLog2Abs, Nulltype>::value));
+    static_assert((::std::is_same< CeilLog2Abs, Nulltype>::value));
 }
 
 template <class NT, class FloorLog2Abs, class CeilLog2Abs>
 void test_rounded_log2_abs(NT zero, FloorLog2Abs fl_log, CeilLog2Abs cl_log) {
     typedef ::CGAL::Null_functor Null_functor;
-    CGAL_static_assertion((!::std::is_same< CeilLog2Abs, Null_functor>::value));
+    static_assert((!::std::is_same< CeilLog2Abs, Null_functor>::value));
 
     assert( fl_log(NT( 7)) == 2 );
     assert( cl_log(NT( 7)) == 3 );
diff --git a/Alpha_shapes_2/include/CGAL/Alpha_shape_2.h b/Alpha_shapes_2/include/CGAL/Alpha_shape_2.h
index 3c4cb4b7d301..56e52417684c 100644
--- a/Alpha_shapes_2/include/CGAL/Alpha_shape_2.h
+++ b/Alpha_shapes_2/include/CGAL/Alpha_shape_2.h
@@ -61,7 +61,7 @@ class Alpha_shape_2 : public Dt
   // because the periodic triangulations' point() function returns a temporary
   // value while the lazy predicate evaluations that are used when the Exact tag
   // is set to true rely on a permanent and safe access to the points.
-  CGAL_static_assertion(
+  static_assert(
    (std::is_same<ExactAlphaComparisonTag, Tag_false>::value) ||
    (std::is_same<typename Dt::Periodic_tag, Tag_false>::value));
 
@@ -76,8 +76,8 @@ class Alpha_shape_2 : public Dt
   typedef Type_of_alpha               FT;
 
   // check that simplices are correctly instantiated
-  CGAL_static_assertion( (std::is_same<NT, typename Dt::Face::NT>::value) );
-  CGAL_static_assertion( (std::is_same<NT, typename Dt::Vertex::NT>::value) );
+  static_assert( (std::is_same<NT, typename Dt::Face::NT>::value) );
+  static_assert( (std::is_same<NT, typename Dt::Vertex::NT>::value) );
 
   typedef typename Dt::Point Point;
 
diff --git a/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h b/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
index cc734b7f4b63..22565c21d859 100644
--- a/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
+++ b/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
@@ -148,7 +148,7 @@ class Lazy_alpha_nt_2
   Approx_point to_approx(const Input_point& wp) const
   {
     // The traits class' Point_2 must be convertible using the Cartesian converter
-    CGAL_static_assertion((Is_traits_point_convertible_2<
+    static_assert((Is_traits_point_convertible_2<
                             Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value));
 
     To_approx converter;
@@ -158,7 +158,7 @@ class Lazy_alpha_nt_2
   Exact_point to_exact(const Input_point& wp) const
   {
     // The traits class' Point_2 must be convertible using the Cartesian converter
-    CGAL_static_assertion((Is_traits_point_convertible_2<
+    static_assert((Is_traits_point_convertible_2<
                             Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value));
 
     To_exact converter;
diff --git a/Alpha_shapes_3/include/CGAL/Alpha_shape_3.h b/Alpha_shapes_3/include/CGAL/Alpha_shape_3.h
index be6849a58861..a7fdc406b041 100644
--- a/Alpha_shapes_3/include/CGAL/Alpha_shape_3.h
+++ b/Alpha_shapes_3/include/CGAL/Alpha_shape_3.h
@@ -97,7 +97,7 @@ class Alpha_shape_3 : public Dt
   // because the periodic triangulations' point() function returns a temporary
   // value while the lazy predicate evaluations that are used when the Exact tag
   // is set to true rely on a permanent and safe access to the points.
-  CGAL_static_assertion(
+  static_assert(
    (std::is_same<ExactAlphaComparisonTag, Tag_false>::value) ||
    (std::is_same<typename Dt::Periodic_tag, Tag_false>::value));
 
@@ -108,8 +108,8 @@ class Alpha_shape_3 : public Dt
   typedef typename Gt::FT Coord_type;
 
   //checks whether tags are correctly set in Vertex and Cell classes
-  CGAL_static_assertion( (std::is_same<NT,typename Dt::Cell::NT>::value) );
-  CGAL_static_assertion( (std::is_same<NT,typename Dt::Vertex::Alpha_status::NT>::value) );
+  static_assert( (std::is_same<NT,typename Dt::Cell::NT>::value) );
+  static_assert( (std::is_same<NT,typename Dt::Vertex::Alpha_status::NT>::value) );
 
   typedef typename Dt::Point Point;
 
diff --git a/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h b/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
index cd8536243789..f20b050c1a2c 100644
--- a/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
+++ b/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
@@ -139,7 +139,7 @@ class Lazy_alpha_nt_3{
   Approx_point to_approx(const Input_point& wp) const
   {
     // The traits class' Point_3 must be convertible using the Cartesian converter
-    CGAL_static_assertion((Is_traits_point_convertible_3<
+    static_assert((Is_traits_point_convertible_3<
                             Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value));
 
     To_approx converter;
@@ -149,7 +149,7 @@ class Lazy_alpha_nt_3{
   Exact_point to_exact(const Input_point& wp) const
   {
     // The traits class' Point_3 must be convertible using the Cartesian converter
-    CGAL_static_assertion((Is_traits_point_convertible_3<
+    static_assert((Is_traits_point_convertible_3<
                             Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value));
 
     To_exact converter;
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 20982e9beaaa..0d81f8b81936 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -193,7 +193,7 @@ class Alpha_wrap_3
   {
     // Due to the Steiner point computation being a dichotomy, the algorithm is inherently inexact
     // and passing exact kernels is explicitly disabled to ensure no misunderstanding.
-    CGAL_static_assertion((std::is_floating_point<FT>::value));
+    static_assert((std::is_floating_point<FT>::value));
   }
 
 public:
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
index 6d0f65142f69..122599a7d50b 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
@@ -146,7 +146,7 @@ class Triangle_mesh_oracle
 
     VPM vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
                                get_const_property_map(vertex_point, tmesh));
-    CGAL_static_assertion((std::is_same<typename boost::property_traits<VPM>::value_type, Point_3>::value));
+    static_assert((std::is_same<typename boost::property_traits<VPM>::value_type, Point_3>::value));
 
     Splitter_base::reserve(num_faces(tmesh));
 
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
index 57f936306dad..e602b708f955 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
@@ -143,7 +143,7 @@ class Triangle_soup_oracle
 #endif
 
     PPM pm = choose_parameter<PPM>(get_parameter(np, internal_np::point_map));
-    CGAL_static_assertion((std::is_same<typename boost::property_traits<PPM>::value_type, Point_3>::value));
+    static_assert((std::is_same<typename boost::property_traits<PPM>::value_type, Point_3>::value));
 
     Splitter_base::reserve(faces.size());
 
diff --git a/Arithmetic_kernel/test/Arithmetic_kernel/Get_arithmetic_kernel.cpp b/Arithmetic_kernel/test/Arithmetic_kernel/Get_arithmetic_kernel.cpp
index f8b373c9764d..2947c3a3761a 100644
--- a/Arithmetic_kernel/test/Arithmetic_kernel/Get_arithmetic_kernel.cpp
+++ b/Arithmetic_kernel/test/Arithmetic_kernel/Get_arithmetic_kernel.cpp
@@ -18,17 +18,17 @@ int main() {
   {
     typedef CGAL::Get_arithmetic_kernel<Integer>::Arithmetic_kernel AK_;
     CGAL_USE_TYPE(AK_);
-    CGAL_static_assertion((std::is_same<AK,AK_>::value));
+    static_assert((std::is_same<AK,AK_>::value));
   }
   {
     typedef CGAL::Get_arithmetic_kernel<Rational>::Arithmetic_kernel AK_;
     CGAL_USE_TYPE(AK_);
-    CGAL_static_assertion((std::is_same<AK,AK_>::value));
+    static_assert((std::is_same<AK,AK_>::value));
   }
   {
     typedef CGAL::Get_arithmetic_kernel<BFI>::Arithmetic_kernel AK_;
     CGAL_USE_TYPE(AK_);
-    CGAL_static_assertion((std::is_same<AK,AK_>::value));
+    static_assert((std::is_same<AK,AK_>::value));
   }
   return 0;
 }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
index e1582795054c..8b4a3e1eca23 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
@@ -90,10 +90,10 @@ class Arr_bounded_planar_topology_traits_2 :
   typedef typename Gt_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Gt_adaptor_2::Right_side_category  Right_side_category;
 
-  CGAL_static_assertion((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Top_side_category, Arr_oblivious_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value));
+  static_assert((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value));
+  static_assert((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value));
+  static_assert((std::is_same< Top_side_category, Arr_oblivious_side_tag >::value));
+  static_assert((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value));
   //@}
 
   /*! \struct
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_dcel_base.h b/Arrangement_on_surface_2/include/CGAL/Arr_dcel_base.h
index 39a618a754df..af2ea182fa74 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_dcel_base.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_dcel_base.h
@@ -38,7 +38,7 @@ namespace CGAL {
 
 inline void* _clean_pointer(const void* p)
 {
-  CGAL_static_assertion(sizeof(void*) == sizeof(size_t));
+  static_assert(sizeof(void*) == sizeof(size_t));
   const size_t  mask = ~1;
   const size_t  val = (reinterpret_cast<size_t>(p) & mask);
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
index 83358c14b12d..5a32bb997d75 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
@@ -172,14 +172,14 @@ overlay(const Arrangement_on_surface_2<GeometryTraitsA_2, TopologyTraitsA>& arr1
   typedef typename Agt2::Point_2                                A_point;
   typedef typename Bgt2::Point_2                                B_point;
   typedef typename Rgt2::Point_2                                Res_point;
-  CGAL_static_assertion((boost::is_convertible<A_point, Res_point>::value));
-  CGAL_static_assertion((boost::is_convertible<B_point, Res_point>::value));
+  static_assert((boost::is_convertible<A_point, Res_point>::value));
+  static_assert((boost::is_convertible<B_point, Res_point>::value));
 
   typedef typename Agt2::X_monotone_curve_2                     A_xcv;
   typedef typename Bgt2::X_monotone_curve_2                     B_xcv;
   typedef typename Rgt2::X_monotone_curve_2                     Res_xcv;
-  CGAL_static_assertion((boost::is_convertible<A_xcv, Res_xcv>::value));
-  CGAL_static_assertion((boost::is_convertible<B_xcv, Res_xcv>::value));
+  static_assert((boost::is_convertible<A_xcv, Res_xcv>::value));
+  static_assert((boost::is_convertible<B_xcv, Res_xcv>::value));
 
   typedef Arr_traits_basic_adaptor_2<Rgt2>              Gt_adaptor_2;
   typedef Arr_overlay_traits_2<Gt_adaptor_2, Arr_a, Arr_b>
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Base_rational_arc_ds_1.h b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Base_rational_arc_ds_1.h
index 7ebec8a5eb61..f72169eea37e 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Base_rational_arc_ds_1.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Base_rational_arc_ds_1.h
@@ -62,8 +62,8 @@ class Base_rational_arc_ds_1
   typedef std::vector<std::pair<Algebraic_real_1, Multiplicity> >
                                                         Root_multiplicity_vector;
 
-  CGAL_static_assertion((std::is_same<Integer,Coefficient>::value));
-  CGAL_static_assertion((std::is_same<Polynomial_1,
+  static_assert((std::is_same<Integer,Coefficient>::value));
+  static_assert((std::is_same<Polynomial_1,
                        typename FT_poly_rat_1::Numerator_type>::value));
 
 public:
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
index ef568ab6cadc..da8875c47681 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
@@ -100,8 +100,8 @@ class Base_rational_arc_d_1
 
   typedef Algebraic_point_2                                 Point_2;
 
-  CGAL_static_assertion((std::is_same<Integer, Coefficient>::value));
-  CGAL_static_assertion((std::is_same<Polynomial_1,
+  static_assert((std::is_same<Integer, Coefficient>::value));
+  static_assert((std::is_same<Polynomial_1,
                        typename FT_poly_rat_1::Numerator_type>::value));
 
 public:
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
index 9b4ea137450c..d7b170e979b8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
@@ -91,13 +91,13 @@ class Arr_spherical_topology_traits_2 {
   typedef typename Gt_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Gt_adaptor_2::Right_side_category  Right_side_category;
 
-  CGAL_static_assertion((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
+  static_assert((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
                          std::is_same< Left_side_category, Arr_identified_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
+  static_assert((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
                          std::is_same< Bottom_side_category, Arr_contracted_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Top_side_category, Arr_oblivious_side_tag >::value ||
+  static_assert((std::is_same< Top_side_category, Arr_oblivious_side_tag >::value ||
                          std::is_same< Top_side_category, Arr_contracted_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
+  static_assert((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
                          std::is_same< Right_side_category, Arr_identified_side_tag >::value));
   //@}
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
index 355dd76641eb..30181d7270f3 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
@@ -87,13 +87,13 @@ class Arr_unb_planar_topology_traits_2 :
   typedef typename Gt_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Gt_adaptor_2::Right_side_category  Right_side_category;
 
-  CGAL_static_assertion((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
+  static_assert((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
                          std::is_same< Left_side_category, Arr_open_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
+  static_assert((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
                          std::is_same< Bottom_side_category, Arr_open_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Top_side_category, Arr_oblivious_side_tag>::value ||
+  static_assert((std::is_same< Top_side_category, Arr_oblivious_side_tag>::value ||
                          std::is_same< Top_side_category, Arr_open_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
+  static_assert((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
                          std::is_same< Right_side_category, Arr_open_side_tag >::value));
   //@}
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
index 438f46ced1cf..cf4ae5eb11ba 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
@@ -77,7 +77,7 @@ class Arrangement_on_surface_2 {
   typedef typename Traits_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Traits_adaptor_2::Right_side_category  Right_side_category;
 
-  CGAL_static_assertion((Arr_sane_identified_tagging<Left_side_category,
+  static_assert((Arr_sane_identified_tagging<Left_side_category,
                         Bottom_side_category,
                         Top_side_category,
                         Right_side_category>::value));
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
index 2e16e30a823c..8f0185a5a037 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
@@ -67,7 +67,7 @@ class Arrangement_zone_2 {
   typedef typename Traits_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Traits_adaptor_2::Right_side_category  Right_side_category;
 
-  CGAL_static_assertion((Arr_sane_identified_tagging<Left_side_category,
+  static_assert((Arr_sane_identified_tagging<Left_side_category,
                                                     Bottom_side_category,
                                                     Top_side_category,
                                                     Right_side_category>::value));
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_tags.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_tags.cpp
index 84896d26a68d..81eae4204966 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_tags.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_tags.cpp
@@ -272,38 +272,38 @@ int main ()
 
   assert(ident12() == false);
 
-  CGAL_static_assertion(
+  static_assert(
       (std::is_same< CGAL::internal::Arr_complete_left_side_category< Traits5 >::Category,
        CGAL::Arr_oblivious_side_tag >::value)
   );
-  CGAL_static_assertion(
+  static_assert(
       (std::is_same< CGAL::internal::Arr_complete_left_side_category< Traits1 >::Category,
        CGAL::Arr_open_side_tag >::value)
   );
 
-  CGAL_static_assertion(
+  static_assert(
       (std::is_same<CGAL::internal::Arr_complete_bottom_side_category< Traits5 >::Category,
        CGAL::Arr_oblivious_side_tag >::value)
   );
-  CGAL_static_assertion(
+  static_assert(
       (std::is_same<CGAL::internal::Arr_complete_bottom_side_category< Traits1 >::Category,
        CGAL::Arr_open_side_tag >::value)
   );
 
-  CGAL_static_assertion(
+  static_assert(
       (std::is_same< CGAL::internal::Arr_complete_top_side_category< Traits5 >::Category,
        CGAL::Arr_oblivious_side_tag >::value)
   );
-  CGAL_static_assertion(
+  static_assert(
       (std::is_same< CGAL::internal::Arr_complete_top_side_category< Traits1 >::Category,
        CGAL::Arr_open_side_tag >::value)
   );
 
-  CGAL_static_assertion(
+  static_assert(
       (std::is_same< CGAL::internal::Arr_complete_right_side_category< Traits5 >::Category,
        CGAL::Arr_oblivious_side_tag >::value)
   );
-  CGAL_static_assertion(
+  static_assert(
       (std::is_same< CGAL::internal::Arr_complete_right_side_category< Traits1 >::Category,
        CGAL::Arr_open_side_tag >::value)
   );
diff --git a/BGL/include/CGAL/boost/graph/IO/Generic_facegraph_builder.h b/BGL/include/CGAL/boost/graph/IO/Generic_facegraph_builder.h
index 331f8a0f44b0..3ec900827933 100644
--- a/BGL/include/CGAL/boost/graph/IO/Generic_facegraph_builder.h
+++ b/BGL/include/CGAL/boost/graph/IO/Generic_facegraph_builder.h
@@ -49,9 +49,9 @@ class Generic_facegraph_builder
     typedef typename CGAL::GetVertexPointMap<Graph, NamedParameters>::type             VPM;
 
     // usually will be true, but might not be the case if using custom type points
-//    CGAL_static_assertion((std::is_same<typename Kernel::Point_3,
+//    static_assert((std::is_same<typename Kernel::Point_3,
 //                                        typename boost::property_traits<VPM>::value_type>::value));
-//    CGAL_static_assertion((std::is_same<typename Kernel::Point_3,
+//    static_assert((std::is_same<typename Kernel::Point_3,
 //                                        typename boost::range_value<Point_container>::type>::value));
 
     typedef typename internal_np::Lookup_named_param_def<
diff --git a/BGL/test/BGL/test_Has_member_clear.cpp b/BGL/test/BGL/test_Has_member_clear.cpp
index 5a78d9a2d7eb..b8adc423eb78 100644
--- a/BGL/test/BGL/test_Has_member_clear.cpp
+++ b/BGL/test/BGL/test_Has_member_clear.cpp
@@ -19,13 +19,13 @@ struct with_clear_const {
 int main()
 {
   using namespace CGAL::internal;
-  CGAL_static_assertion(Has_member_clear<with_clear>::value);
+  static_assert(Has_member_clear<with_clear>::value);
 
-  CGAL_static_assertion(!Has_member_clear<wo_clear>::value);
+  static_assert(!Has_member_clear<wo_clear>::value);
 
-  CGAL_static_assertion(!Has_member_clear<with_clear_but_args>::value);
+  static_assert(!Has_member_clear<with_clear_but_args>::value);
 
-  CGAL_static_assertion(Has_member_clear<with_clear_const>::value);
+  static_assert(Has_member_clear<with_clear_const>::value);
 
   return 0;
 }
diff --git a/BGL/test/BGL/test_Has_member_id.cpp b/BGL/test/BGL/test_Has_member_id.cpp
index 6ff478d04c21..7cfec0bf8bdd 100644
--- a/BGL/test/BGL/test_Has_member_id.cpp
+++ b/BGL/test/BGL/test_Has_member_id.cpp
@@ -28,17 +28,17 @@ int main()
 {
   using namespace CGAL::internal;
 
-  CGAL_static_assertion(!Has_member_id<StructNoId>::value);
-  CGAL_static_assertion(Has_member_id<StructWithId>::value);
-  CGAL_static_assertion(!Has_member_id<Polyhedron::Face>::value);
-  CGAL_static_assertion(Has_member_id<Polyhedron_with_ids::Facet>::value);
-  CGAL_static_assertion(Has_member_id<Polyhedron_with_ids::FBase>::value);
-  CGAL_static_assertion(
+  static_assert(!Has_member_id<StructNoId>::value);
+  static_assert(Has_member_id<StructWithId>::value);
+  static_assert(!Has_member_id<Polyhedron::Face>::value);
+  static_assert(Has_member_id<Polyhedron_with_ids::Facet>::value);
+  static_assert(Has_member_id<Polyhedron_with_ids::FBase>::value);
+  static_assert(
     (Has_member_id<Polyhedron_with_ids::Items::Face_wrapper<Polyhedron_with_ids::HDS, K>::Face>::value));
 
-  CGAL_static_assertion(!Has_member_id<CGAL::Triangulation_face_base_2<K> >::value);
-  CGAL_static_assertion(Has_member_id<CGAL::Triangulation_vertex_base_with_id_2<K> >::value);
-  CGAL_static_assertion(Has_member_id<CGAL::Triangulation_face_base_with_id_2<K> >::value);
+  static_assert(!Has_member_id<CGAL::Triangulation_face_base_2<K> >::value);
+  static_assert(Has_member_id<CGAL::Triangulation_vertex_base_with_id_2<K> >::value);
+  static_assert(Has_member_id<CGAL::Triangulation_face_base_with_id_2<K> >::value);
 
   return 0;
 }
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
index eeb80bf655d4..ef8cc06083f9 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
@@ -123,13 +123,13 @@ class Gps_agg_meta_traits :
   typedef typename Arr::Right_side_category     Right_side_category;
 
   // a side is either oblivious or open (unbounded)
-  CGAL_static_assertion((std::is_same<Left_side_category, Arr_oblivious_side_tag>::value ||
+  static_assert((std::is_same<Left_side_category, Arr_oblivious_side_tag>::value ||
                          std::is_same<Left_side_category, Arr_open_side_tag>::value));
-  CGAL_static_assertion((std::is_same<Bottom_side_category, Arr_oblivious_side_tag>::value ||
+  static_assert((std::is_same<Bottom_side_category, Arr_oblivious_side_tag>::value ||
                          std::is_same<Bottom_side_category, Arr_open_side_tag>::value));
-  CGAL_static_assertion((std::is_same<Top_side_category, Arr_oblivious_side_tag>::value ||
+  static_assert((std::is_same<Top_side_category, Arr_oblivious_side_tag>::value ||
                          std::is_same<Top_side_category, Arr_open_side_tag>::value));
-  CGAL_static_assertion((std::is_same<Right_side_category, Arr_oblivious_side_tag>::value ||
+  static_assert((std::is_same<Right_side_category, Arr_oblivious_side_tag>::value ||
                          std::is_same<Right_side_category, Arr_open_side_tag>::value));
 
   typedef typename Arr::Halfedge_handle         Halfedge_handle;
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
index c260e4cf8245..9c59b4f32753 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
@@ -53,13 +53,13 @@ class Gps_traits_decorator
   typedef typename Base::Right_side_category       Right_side_category;
 
   // a side is either oblivious or open (unbounded)
-  CGAL_static_assertion((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
+  static_assert((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
                          std::is_same< Left_side_category, Arr_open_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
+  static_assert((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
                          std::is_same< Bottom_side_category, Arr_open_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Top_side_category, Arr_oblivious_side_tag >::value ||
+  static_assert((std::is_same< Top_side_category, Arr_oblivious_side_tag >::value ||
                          std::is_same< Top_side_category, Arr_open_side_tag >::value));
-  CGAL_static_assertion((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
+  static_assert((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
                          std::is_same< Right_side_category, Arr_open_side_tag >::value));
 
   class Ex_point_2
diff --git a/Box_intersection_d/include/CGAL/box_intersection_d.h b/Box_intersection_d/include/CGAL/box_intersection_d.h
index 94752c414623..1ac7a802d7d3 100644
--- a/Box_intersection_d/include/CGAL/box_intersection_d.h
+++ b/Box_intersection_d/include/CGAL/box_intersection_d.h
@@ -63,7 +63,7 @@ void box_intersection_segment_tree_d(
   const NT sup = Box_intersection_d::box_limits<NT>::sup();
 
 #ifndef CGAL_LINKED_WITH_TBB
-  CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+  static_assert (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #else // CGAL_LINKED_WITH_TBB
   if(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value)
diff --git a/Box_intersection_d/test/Box_intersection_d/test_Has_member_report.cpp b/Box_intersection_d/test/Box_intersection_d/test_Has_member_report.cpp
index 12f64d1bc112..d3d5368f9659 100644
--- a/Box_intersection_d/test/Box_intersection_d/test_Has_member_report.cpp
+++ b/Box_intersection_d/test/Box_intersection_d/test_Has_member_report.cpp
@@ -18,8 +18,8 @@ struct With_report_as_a_template_member_function {
 
 int main() {
   using CGAL::Box_intersection_d::Has_member_report;
-  CGAL_static_assertion(!Has_member_report<S>::value);
-  CGAL_static_assertion(Has_member_report<With_report>::value);
-  CGAL_static_assertion(Has_member_report<With_report_as_a_template_member_function>::value);
+  static_assert(!Has_member_report<S>::value);
+  static_assert(Has_member_report<With_report>::value);
+  static_assert(Has_member_report<With_report_as_a_template_member_function>::value);
   return EXIT_SUCCESS;
 }
diff --git a/Circulator/include/CGAL/circulator.h b/Circulator/include/CGAL/circulator.h
index 2b1556218f04..d985eba576c2 100644
--- a/Circulator/include/CGAL/circulator.h
+++ b/Circulator/include/CGAL/circulator.h
@@ -193,45 +193,45 @@ template <class C> inline
 void Assert_circulator( const C &) {
     typedef typename Circulator_traits<C>::category category;
     CGAL_USE_TYPE(category);
-    CGAL_static_assertion((boost::is_convertible<category, Circulator_tag>::value));
+    static_assert((boost::is_convertible<category, Circulator_tag>::value));
 }
 
 template <class I> inline
 void Assert_iterator( const I &) {
     typedef typename Circulator_traits<I>::category category;
     CGAL_USE_TYPE(category);
-    CGAL_static_assertion((boost::is_convertible<category, Iterator_tag>::value));
+    static_assert((boost::is_convertible<category, Iterator_tag>::value));
 }
 template <class I> inline
 void Assert_input_category( const I &/*i*/) {
     typedef typename std::iterator_traits<I>::iterator_category category;
     CGAL_USE_TYPE(category);
-    CGAL_static_assertion((boost::is_convertible<category, std::input_iterator_tag>::value));
+    static_assert((boost::is_convertible<category, std::input_iterator_tag>::value));
 }
 
 template <class I> inline
 void Assert_output_category( const I &/*i*/) {
   typedef typename std::iterator_traits<I>::iterator_category category;
   CGAL_USE_TYPE(category);
-  CGAL_static_assertion((boost::is_convertible<category, std::output_iterator_tag>::value));
+  static_assert((boost::is_convertible<category, std::output_iterator_tag>::value));
 }
 template <class IC> inline
 void Assert_forward_category( const IC &/*ic*/) {
   typedef typename std::iterator_traits<IC>::iterator_category category;
   CGAL_USE_TYPE(category);
-  CGAL_static_assertion((boost::is_convertible<category, std::forward_iterator_tag>::value));
+  static_assert((boost::is_convertible<category, std::forward_iterator_tag>::value));
 }
 template <class IC> inline
 void Assert_bidirectional_category( const IC &/*ic*/) {
   typedef typename std::iterator_traits<IC>::iterator_category category;
   CGAL_USE_TYPE(category);
-  CGAL_static_assertion((boost::is_convertible<category, std::bidirectional_iterator_tag>::value));
+  static_assert((boost::is_convertible<category, std::bidirectional_iterator_tag>::value));
 }
 template <class IC> inline
 void Assert_random_access_category( const IC &/*ic*/) {
   typedef typename std::iterator_traits<IC>::iterator_category category;
   CGAL_USE_TYPE(category);
-  CGAL_static_assertion((boost::is_convertible<category, std::random_access_iterator_tag>::value));
+  static_assert((boost::is_convertible<category, std::random_access_iterator_tag>::value));
 }
 // The assert at-least-category functions use the following
 // functions to resolve properly. Note the proper order of the
diff --git a/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/forest.hpp b/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/forest.hpp
index 4611becf7110..4b8bff71481d 100644
--- a/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/forest.hpp
+++ b/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/forest.hpp
@@ -164,7 +164,7 @@ class RandomForest {
           f (seed_start, sample_idxes, trees, samples, labels, params.n_in_bag_samples, split_generator);
 
 #ifndef CGAL_LINKED_WITH_TBB
-        CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+        static_assert (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                    "Parallel_tag is enabled but TBB is unavailable.");
 #else
         if (std::is_convertible<ConcurrencyTag,Parallel_tag>::value)
diff --git a/Classification/include/CGAL/Classification/Local_eigen_analysis.h b/Classification/include/CGAL/Classification/Local_eigen_analysis.h
index 33e1d706599d..78606ed27490 100644
--- a/Classification/include/CGAL/Classification/Local_eigen_analysis.h
+++ b/Classification/include/CGAL/Classification/Local_eigen_analysis.h
@@ -265,7 +265,7 @@ class Local_eigen_analysis
     out.m_content->mean_range = 0.;
 
 #ifndef CGAL_LINKED_WITH_TBB
-    CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+    static_assert (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                "Parallel_tag is enabled but TBB is unavailable.");
 #else
     if (std::is_convertible<ConcurrencyTag,Parallel_tag>::value)
@@ -353,7 +353,7 @@ class Local_eigen_analysis
     out.m_content->mean_range = 0.;
 
 #ifndef CGAL_LINKED_WITH_TBB
-    CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+    static_assert (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                "Parallel_tag is enabled but TBB is unavailable.");
 #else
     if (std::is_convertible<ConcurrencyTag,Parallel_tag>::value)
@@ -431,7 +431,7 @@ class Local_eigen_analysis
 
 
 #ifndef CGAL_LINKED_WITH_TBB
-    CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+    static_assert (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                "Parallel_tag is enabled but TBB is unavailable.");
 #else
     if (std::is_convertible<ConcurrencyTag,Parallel_tag>::value)
diff --git a/Classification/include/CGAL/Classification/Sum_of_weighted_features_classifier.h b/Classification/include/CGAL/Classification/Sum_of_weighted_features_classifier.h
index 2d30a534a42f..7f16459723ad 100644
--- a/Classification/include/CGAL/Classification/Sum_of_weighted_features_classifier.h
+++ b/Classification/include/CGAL/Classification/Sum_of_weighted_features_classifier.h
@@ -898,7 +898,7 @@ class Sum_of_weighted_features_classifier
       std::size_t gt = j;
 
 #ifndef CGAL_LINKED_WITH_TBB
-      CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+      static_assert (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                  "Parallel_tag is enabled but TBB is unavailable.");
 #else
       if (std::is_convertible<ConcurrencyTag,Parallel_tag>::value)
diff --git a/Combinatorial_map/include/CGAL/Cell_iterators.h b/Combinatorial_map/include/CGAL/Cell_iterators.h
index b54c12bf0c0d..9f7095c1900f 100644
--- a/Combinatorial_map/include/CGAL/Cell_iterators.h
+++ b/Combinatorial_map/include/CGAL/Cell_iterators.h
@@ -82,7 +82,7 @@ namespace CGAL {
       Ite(amap, adart, amap.get_new_mark()),
       mcell_mark_number(amap.get_new_mark())
     {
-      CGAL_static_assertion( (std::is_same<typename Ite::Basic_iterator,
+      static_assert( (std::is_same<typename Ite::Basic_iterator,
                               Tag_true>::value) );
       CGAL_assertion(amap.is_whole_map_unmarked(mcell_mark_number));
 
@@ -196,7 +196,7 @@ namespace CGAL {
       Ite(amap, adart),
       mmark_number(amap.get_new_mark())
     {
-      CGAL_static_assertion( (std::is_same<typename Ite::Basic_iterator,
+      static_assert( (std::is_same<typename Ite::Basic_iterator,
                               Tag_true>::value) );
       CGAL_assertion(amap.is_whole_map_unmarked(mmark_number));
       mark_cell<Map,i,dim>(amap, adart, mmark_number);
@@ -303,7 +303,7 @@ namespace CGAL {
       Base(amap),
       mmark_number(amap.get_new_mark())
     {
-      CGAL_static_assertion( (std::is_same<typename Base::Basic_iterator,
+      static_assert( (std::is_same<typename Base::Basic_iterator,
                               Tag_true>::value) );
       CGAL_assertion(amap.is_whole_map_unmarked(mmark_number));
       mark_cell<Map,i,dim>(amap, (*this), mmark_number);
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map.h b/Combinatorial_map/include/CGAL/Combinatorial_map.h
index 229a8d1a47df..7266c4cd5419 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map.h
@@ -185,7 +185,7 @@ namespace CGAL {
      */
     Combinatorial_map_base()
     {
-      CGAL_static_assertion_msg(Helper::nb_attribs<=dimension+1,
+      static_assert(Helper::nb_attribs<=dimension+1,
                   "Too many attributes in the tuple Attributes_enabled");
       this->init_storage();
 
@@ -803,7 +803,7 @@ namespace CGAL {
     void restricted_set_dart_attribute(Dart_descriptor dh,
                                        typename Attribute_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "set_dart_attribute<i> called but i-attributes are disabled.");
 
       if ( this->template attribute<i>(dh)==ah ) return;
@@ -826,7 +826,7 @@ namespace CGAL {
     void set_dart_attribute(Dart_descriptor dh,
                             typename Attribute_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "set_dart_attribute<i> called but i-attributes are disabled.");
 
       if ( this->template attribute<i>(dh)==ah ) return;
@@ -1524,7 +1524,7 @@ namespace CGAL {
     template < class Ite >
     std::ostream& display_orbits(std::ostream & aos) const
     {
-      CGAL_static_assertion( (std::is_same<typename Ite::Basic_iterator,
+      static_assert( (std::is_same<typename Ite::Basic_iterator,
                               Tag_true>::value) );
       unsigned int nb = 0;
       size_type amark = get_new_mark();
@@ -1584,7 +1584,7 @@ namespace CGAL {
     template<unsigned int i, typename ...Args>
     typename Attribute_descriptor<i>::type create_attribute(const Args&... args)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                   "create_attribute<i> but i-attributes are disabled");
      typename Attribute_descriptor<i>::type res=
        std::get<Helper::template Dimension_index<i>::value>
@@ -1602,7 +1602,7 @@ namespace CGAL {
     template<unsigned int i>
     void erase_attribute(typename Attribute_descriptor<i>::type h)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                   "erase_attribute<i> but i-attributes are disabled");
       std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers).erase(h);
@@ -1612,7 +1612,7 @@ namespace CGAL {
     template<unsigned int i>
     bool is_attribute_used(typename Attribute_const_descriptor< i >::type ah) const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                                 "is_attribute_used<i> but i-attributes are disabled");
       return std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers).is_used(ah);
@@ -1622,7 +1622,7 @@ namespace CGAL {
     template <unsigned int i>
     size_type number_of_attributes() const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                   "number_of_attributes<i> but i-attributes are disabled");
       return std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers).size();
@@ -1636,8 +1636,8 @@ namespace CGAL {
     void set_attribute(Dart_descriptor dh,
                        typename Attribute_descriptor<i>::type ah)
     {
-      CGAL_static_assertion(i<=dimension);
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(i<=dimension);
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                   "set_attribute<i> but i-attributes are disabled");
       for ( typename Dart_of_cell_range<i>::iterator it(*this, dh);
             it.cont(); ++it)
@@ -1651,7 +1651,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_range<i>::type & attributes()
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                                 "attributes<i> but i-attributes are disabled");
       return std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers);
@@ -1660,7 +1660,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_const_range<i>::type & attributes() const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                                 "attributes<i> but i-attributes are disabled");
       return std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers);
@@ -1673,7 +1673,7 @@ namespace CGAL {
                          typename Attribute_type<i>::type&)>&
     onsplit_functor()
     {
-      CGAL_static_assertion_msg
+      static_assert
           (Helper::template Dimension_index<i>::value>=0,
            "onsplit_functor<i> but "
            "i-attributes are disabled");
@@ -1689,7 +1689,7 @@ namespace CGAL {
                                typename Attribute_type<i>::type&)>&
     onsplit_functor() const
     {
-      CGAL_static_assertion_msg
+      static_assert
           (Helper::template Dimension_index<i>::value>=0,
            "onsplit_functor<i> but "
            "i-attributes are disabled");
@@ -1705,7 +1705,7 @@ namespace CGAL {
                                typename Attribute_type<i>::type&)>&
     onmerge_functor()
     {
-      CGAL_static_assertion_msg
+      static_assert
           (Helper::template Dimension_index<i>::value>=0,
            "onsplit_functor<i> but "
            "i-attributes are disabled");
@@ -1720,7 +1720,7 @@ namespace CGAL {
                                typename Attribute_type<i>::type&)>&
     onmerge_functor() const
     {
-      CGAL_static_assertion_msg
+      static_assert
           (Helper::template Dimension_index<i>::value>=0,
            "onsplit_functor<i> but "
            "i-attributes are disabled");
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
index 06f3c4f4dc37..2b55a2c21c96 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_group_functors.h
@@ -64,9 +64,9 @@ struct Group_nonvoid_attribute_functor_of_dart_run
                   typename CMap::Dart_descriptor dh1,
                   typename CMap::Dart_descriptor dh2)
   {
-    CGAL_static_assertion( 1<=i && i<=CMap::dimension );
-    CGAL_static_assertion( i!=j && (i!=1 || j!=0) );
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert( 1<=i && i<=CMap::dimension );
+    static_assert( i!=j && (i!=1 || j!=0) );
+    static_assert(CMap::Helper::template
                               Dimension_index<i>::value>=0,
                               "Group_attribute_functor_of_dart_run<i> but "
                               "i-attributes are disabled");
@@ -90,8 +90,8 @@ struct Group_nonvoid_attribute_functor_of_dart_run<CMap, 0, j, T>
                   typename CMap::Dart_descriptor dh1,
                   typename CMap::Dart_descriptor dh2)
   {
-    CGAL_static_assertion(j!=0 && j!=1);
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert(j!=0 && j!=1);
+    static_assert(CMap::Helper::template
                               Dimension_index<0>::value>=0,
                               "Group_attribute_functor_of_dart_run<0> but "
                               "0-attributes are disabled");
@@ -127,7 +127,7 @@ struct Group_nonvoid_attribute_functor_of_dart_run<CMap, 0, 0, T>
                   typename CMap::Dart_descriptor dh1,
                   typename CMap::Dart_descriptor dh2)
   {
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert(CMap::Helper::template
                               Dimension_index<0>::value>=0,
                               "Group_attribute_functor_of_dart_run<0> but "
                               "0-attributes are disabled");
@@ -152,7 +152,7 @@ struct Group_nonvoid_attribute_functor_of_dart_run<CMap, 0, 1, T>
                   typename CMap::Dart_descriptor dh1,
                   typename CMap::Dart_descriptor dh2)
   {
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert(CMap::Helper::template
                               Dimension_index<0>::value>=0,
                               "Group_attribute_functor_of_dart_run<0> but "
                               "0-attributes are disabled");
@@ -240,9 +240,9 @@ struct Group_nonvoid_attribute_functor_run
                   typename CMap::Dart_descriptor adart1,
                   typename CMap::Dart_descriptor adart2)
   {
-    CGAL_static_assertion( 1<=i && i<=CMap::dimension );
-    CGAL_static_assertion( i!=j );
-    CGAL_static_assertion_msg
+    static_assert( 1<=i && i<=CMap::dimension );
+    static_assert( i!=j );
+    static_assert
         ( CMap::Helper::template Dimension_index<i>::value>=0,
           "Group_attribute_functor_run<i> but i-attributes are disabled" );
     typename CMap::template Attribute_descriptor<i>::type
@@ -279,10 +279,10 @@ struct Group_nonvoid_attribute_functor_run<CMap, 0, j, T>
                    typename CMap::Dart_descriptor dh1,
                    typename CMap::Dart_descriptor dh2 )
   {
-    CGAL_static_assertion_msg
+    static_assert
         ( CMap::Helper::template Dimension_index<0>::value>=0,
           "Group_attribute_functor_run<0> but 0-attributes are disabled" );
-    CGAL_static_assertion(j!=0 && j!=1);
+    static_assert(j!=0 && j!=1);
 
     typename CMap::template Attribute_descriptor<0>::type
         a1=CMap::null_descriptor, a2=CMap::null_descriptor;
@@ -340,7 +340,7 @@ struct Group_nonvoid_attribute_functor_run<CMap, 0, 0, T>
                    typename CMap::Dart_descriptor dh1,
                    typename CMap::Dart_descriptor dh2 )
   {
-    CGAL_static_assertion_msg
+    static_assert
         ( CMap::Helper::template Dimension_index<0>::value>=0,
           "Group_attribute_functor_run<0> but 0-attributes are disabled" );
     typename CMap::Dart_descriptor od=amap.other_extremity(dh2);
@@ -377,7 +377,7 @@ struct Group_nonvoid_attribute_functor_run<CMap, 0, 1, T>
                    typename CMap::Dart_descriptor dh1,
                    typename CMap::Dart_descriptor dh2 )
   {
-    CGAL_static_assertion_msg
+    static_assert
         ( CMap::Helper::template Dimension_index<0>::value>=0,
           "Group_attribute_functor_run<0> but 0-attributes are disabled" );
     typename CMap::Dart_descriptor od =amap.other_extremity(dh1);
@@ -474,9 +474,9 @@ struct Degroup_nonvoid_attribute_functor_run
                   typename CMap::Dart_descriptor adart1,
                   typename CMap::Dart_descriptor adart2)
   {
-    CGAL_static_assertion( i<=CMap::dimension );
-    CGAL_static_assertion( i!=j );
-    CGAL_static_assertion_msg
+    static_assert( i<=CMap::dimension );
+    static_assert( i!=j );
+    static_assert
         ( CMap::Helper::template Dimension_index<i>::value>=0,
           "Degroup_attribute_functor_run<i> but i-attributes are disabled" );
 
@@ -549,7 +549,7 @@ void test_split_attribute_functor_one_dart
                         unsigned int, typename CMap::Hash_function> &
   found_attributes, typename CMap::size_type mark )
 {
-  CGAL_static_assertion_msg(CMap::Helper::template
+  static_assert(CMap::Helper::template
                             Dimension_index<i>::value>=0,
                             "Test_split_attribute_functor_one_dart<i> but "
                             "i-attributes are disabled");
@@ -615,9 +615,9 @@ struct Test_split_nonvoid_attribute_functor_run
                    &modified_darts,
                    typename CMap::size_type mark_modified_darts=CMap::INVALID_MARK)
   {
-    CGAL_static_assertion( 1<=i && i<=CMap::dimension );
+    static_assert( 1<=i && i<=CMap::dimension );
     CGAL_assertion( i!=j );
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert(CMap::Helper::template
                               Dimension_index<i>::value>=0,
                               "Test_split_attribute_functor_run<i> but "
                               "i-attributes are disabled");
@@ -658,9 +658,9 @@ struct Test_split_nonvoid_attribute_functor_run
                    &modified_darts2,
                    typename CMap::size_type mark_modified_darts=CMap::INVALID_MARK)
   {
-    CGAL_static_assertion( 1<=i && i<=CMap::dimension );
+    static_assert( 1<=i && i<=CMap::dimension );
     CGAL_assertion( i!=j );
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert(CMap::Helper::template
                               Dimension_index<i>::value>=0,
                               "Test_split_attribute_functor_run<i> but "
                               "i-attributes are disabled");
@@ -720,7 +720,7 @@ struct Test_split_nonvoid_attribute_functor_run<CMap, 0, j, T>
                    typename CMap::size_type mark_modified_darts=CMap::INVALID_MARK)
   {
     CGAL_assertion( j!=0 && j!=1 );
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert(CMap::Helper::template
                               Dimension_index<0>::value>=0,
                               "Test_split_attribute_functor_run<0> but "
                               "0-attributes are disabled");
@@ -772,7 +772,7 @@ struct Test_split_nonvoid_attribute_functor_run<CMap, 0, j, T>
                    typename CMap::size_type mark_modified_darts=CMap::INVALID_MARK)
   {
     CGAL_assertion( j!=0 && j!=1 );
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert(CMap::Helper::template
                               Dimension_index<0>::value>=0,
                               "Test_split_attribute_functor_run<0> but "
                               "0-attributes are disabled");
@@ -858,7 +858,7 @@ struct Test_split_nonvoid_attribute_functor_run<CMap, 0, 0, T>
                    &modified_darts2,
                    typename CMap::size_type mark_modified_darts=CMap::INVALID_MARK)
   {
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert(CMap::Helper::template
                               Dimension_index<0>::value>=0,
                               "Test_split_attribute_functor_run<0> but "
                               "0-attributes are disabled");
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h
index 3e0b147942c5..c76a210ae6f4 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map/internal/Combinatorial_map_internal_functors.h
@@ -220,7 +220,7 @@ struct Test_is_valid_attribute_functor
                   typename CMap::Dart_const_descriptor adart,
                   std::vector<size_type>& marks, bool& ares)
   {
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert(CMap::Helper::template
                               Dimension_index<i>::value>=0,
                               "Test_is_valid_attribute_functor<i> but "
                               " i-attributes are disabled");
@@ -304,7 +304,7 @@ struct Correct_invalid_attributes_functor
                   typename CMap::Dart_descriptor adart,
                   std::vector<size_type>& marks)
   {
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert(CMap::Helper::template
                               Dimension_index<i>::value>=0,
                               "Correct_invalid_attributes_functor<i> but "
                               " i-attributes are disabled");
@@ -362,7 +362,7 @@ struct Cleanup_useless_attributes
   template <unsigned int i>
   static void run(CMap& amap)
   {
-    CGAL_static_assertion_msg(CMap::Helper::template
+    static_assert(CMap::Helper::template
                               Dimension_index<i>::value>=0,
                               "Cleanup_useless_attributes<i> but "
                               " i-attributes are disabled");
@@ -707,7 +707,7 @@ struct Test_is_same_attribute_point_functor
                   typename Map1::Dart_const_descriptor dh1,
                   typename Map2::Dart_const_descriptor dh2)
   {
-    CGAL_static_assertion( Withpoint1==true && Withpoint2==true );
+    static_assert( Withpoint1==true && Withpoint2==true );
     if (m1.template attribute<i>(dh1)==Map1::null_descriptor &&
         m2.template attribute<i>(dh2)==Map2::null_descriptor)
       return true;
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_basic_operations.h b/Combinatorial_map/include/CGAL/Combinatorial_map_basic_operations.h
index b7974062ae01..56991cc55d16 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_basic_operations.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_basic_operations.h
@@ -34,7 +34,7 @@ namespace CGAL
                             typename Map::Dart_const_descriptor adart1,
                             typename Map::Dart_const_descriptor adart2)
   {
-    CGAL_static_assertion( (std::is_same<typename Iterator::Basic_iterator,
+    static_assert( (std::is_same<typename Iterator::Basic_iterator,
                                            Tag_false>::value) );
     bool found=false;
 
@@ -57,7 +57,7 @@ namespace CGAL
                              typename Map::Dart_const_descriptor adart,
                              typename Map::size_type amark)
   {
-    CGAL_static_assertion( (std::is_same<typename Iterator::Basic_iterator,
+    static_assert( (std::is_same<typename Iterator::Basic_iterator,
                                            Tag_false>::value) );
     bool res=true;
 
@@ -98,7 +98,7 @@ namespace CGAL
                                      typename Map::Dart_const_descriptor adart,
                                      typename Map::size_type amark)
   {
-    CGAL_static_assertion( (std::is_same<typename Iterator::Basic_iterator,
+    static_assert( (std::is_same<typename Iterator::Basic_iterator,
                             Tag_true>::value) );
     CGAL_assertion( (is_whole_orbit_unmarked<Map,
                      CMap_non_basic_iterator<Map,Iterator> >
@@ -305,7 +305,7 @@ namespace CGAL
                                               typename Map::size_type amark,
                                               typename Map::size_type amark2=Map::INVALID_MARK)
   {
-    CGAL_static_assertion( (std::is_same<typename Iterator::Basic_iterator,
+    static_assert( (std::is_same<typename Iterator::Basic_iterator,
                             Tag_true>::value) );
     CGAL_assertion( (is_whole_orbit_unmarked<Map,
                      CMap_non_basic_iterator<Map,Iterator> >
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h b/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
index 0b2c39bc7204..25419ab98c05 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
@@ -305,7 +305,7 @@ namespace CGAL {
 
     typedef typename Map::size_type size_type;
 
-    CGAL_static_assertion( (Bi<=Map::dimension &&
+    static_assert( (Bi<=Map::dimension &&
                             std::is_same<Ite_has_stack,Tag_false>::value) );
 
   public:
@@ -493,7 +493,7 @@ namespace CGAL {
 
     typedef typename Map::size_type size_type;
 
-    CGAL_static_assertion( (std::is_same<typename Base::Basic_iterator,
+    static_assert( (std::is_same<typename Base::Basic_iterator,
                             Tag_true>::value) );
 
     /// Main constructor.
@@ -579,7 +579,7 @@ namespace CGAL {
     /// True iff this iterator is basic
     typedef Tag_false Basic_iterator;
 
-    CGAL_static_assertion( (std::is_same<typename Base::Basic_iterator,
+    static_assert( (std::is_same<typename Base::Basic_iterator,
                             Tag_true>::value) );
 
     /// Main constructor.
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h b/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h
index 2ba09b326500..6a7a1b6f2715 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_operations.h
@@ -77,7 +77,7 @@ namespace CGAL
     static size_t run(CMap& amap, typename CMap::Dart_descriptor adart,
                       bool update_attributes)
     {
-      CGAL_static_assertion ( 1<=i && i<CMap::dimension );
+      static_assert ( 1<=i && i<CMap::dimension );
       CGAL_assertion( (amap.template is_removable<i>(adart)) );
 
       size_t res = 0;
@@ -493,7 +493,7 @@ namespace CGAL
     static size_t run(CMap& amap, typename CMap::Dart_descriptor adart,
                       bool update_attributes)
     {
-      CGAL_static_assertion ( 2<=i && i<=CMap::dimension );
+      static_assert ( 2<=i && i<=CMap::dimension );
       CGAL_assertion( (amap.template is_contractible<i>(adart)) );
 
       size_t res = 0;
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h b/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h
index 7c505ea51657..8de6b7c1f7fd 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_storages.h
@@ -232,7 +232,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_descriptor<i>::type attribute(Dart_descriptor ADart)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (ADart->mattribute_descriptors);
@@ -241,7 +241,7 @@ namespace CGAL {
     typename Attribute_const_descriptor<i>::type
     attribute(Dart_const_descriptor ADart) const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (ADart->mattribute_descriptors);
@@ -252,7 +252,7 @@ namespace CGAL {
     typename Attribute_descriptor<i>::type copy_attribute
     (typename Attribute_const_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "copy_attribute<i> called but i-attributes are disabled.");
       typename Attribute_descriptor<i>::type res=
         std::get<Helper::template Dimension_index<i>::value>
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h b/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h
index 584442412c54..f1e3d62cbab7 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h
@@ -266,7 +266,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_descriptor<i>::type attribute(Dart_descriptor ADart)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (mdarts[ADart].mattribute_descriptors);
@@ -275,7 +275,7 @@ namespace CGAL {
     typename Attribute_const_descriptor<i>::type
     attribute(Dart_const_descriptor ADart) const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (mdarts[ADart].mattribute_descriptors);
@@ -286,7 +286,7 @@ namespace CGAL {
     typename Attribute_descriptor<i>::type copy_attribute
     (typename Attribute_const_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "copy_attribute<i> called but i-attributes are disabled.");
       // We need to do a reserve before the emplace in order to avoid a bug of
       // invalid reference when the container is reallocated.
diff --git a/Combinatorial_map/include/CGAL/Dart.h b/Combinatorial_map/include/CGAL/Dart.h
index 3308def61039..17ffde4b294d 100644
--- a/Combinatorial_map/include/CGAL/Dart.h
+++ b/Combinatorial_map/include/CGAL/Dart.h
@@ -226,7 +226,7 @@ namespace CGAL {
     template<int i>
     typename Attribute_descriptor<i>::type attribute()
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (mattribute_descriptors);
@@ -234,7 +234,7 @@ namespace CGAL {
     template<int i>
     typename Attribute_const_descriptor<i>::type attribute() const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (mattribute_descriptors);
diff --git a/Combinatorial_map/include/CGAL/Dart_iterators.h b/Combinatorial_map/include/CGAL/Dart_iterators.h
index c73a32b383e7..2e552f25950f 100644
--- a/Combinatorial_map/include/CGAL/Dart_iterators.h
+++ b/Combinatorial_map/include/CGAL/Dart_iterators.h
@@ -295,13 +295,13 @@ namespace CGAL {
     /// Main constructor.
     CMap_dart_iterator_basic_of_orbit_generic(Map& amap, Dart_descriptor adart):
       Base(amap, adart)
-    { CGAL_static_assertion( Bi>=2 && Bi<=Map::dimension ); }
+    { static_assert( Bi>=2 && Bi<=Map::dimension ); }
 
     /// Main constructor.
     CMap_dart_iterator_basic_of_orbit_generic(Map& amap, Dart_descriptor adart,
                                               size_type /*amark*/):
       Base(amap, adart)
-    { CGAL_static_assertion( Bi>=2 && Bi<=Map::dimension ); }
+    { static_assert( Bi>=2 && Bi<=Map::dimension ); }
 
     /// Prefix ++ operator.
     Self& operator++()
@@ -346,7 +346,7 @@ namespace CGAL {
 
     typedef Tag_false Use_mark;
 
-    CGAL_static_assertion( Bi>1 && delta>1 && Bi+delta<=Map::dimension );
+    static_assert( Bi>1 && delta>1 && Bi+delta<=Map::dimension );
 
   public:
     /// Main constructor.
@@ -460,7 +460,7 @@ namespace CGAL {
 
     typedef Tag_true Use_mark;
 
-    CGAL_static_assertion( 2<=Map::dimension );
+    static_assert( 2<=Map::dimension );
 
   public:
     /// Main constructor.
@@ -493,7 +493,7 @@ namespace CGAL {
 
     typedef Tag_true Use_mark;
 
-    CGAL_static_assertion( 2<=Map::dimension );
+    static_assert( 2<=Map::dimension );
 
   public:
     /// Main constructor.
@@ -524,7 +524,7 @@ namespace CGAL {
 
     typedef Tag_false Use_mark;
 
-    CGAL_static_assertion( delta>1 && delta<=Map::dimension );
+    static_assert( delta>1 && delta<=Map::dimension );
 
   public:
     /// Main constructor.
@@ -625,7 +625,7 @@ namespace CGAL {
 
     typedef Tag_false Use_mark;
 
-    CGAL_static_assertion( delta>1 && delta+1<=Map::dimension );
+    static_assert( delta>1 && delta+1<=Map::dimension );
 
   public:
     /// Main constructor.
@@ -726,7 +726,7 @@ namespace CGAL {
 
     typedef Tag_false Use_mark;
 
-    CGAL_static_assertion( Bi>1 && Bi+1<=Map::dimension );
+    static_assert( Bi>1 && Bi+1<=Map::dimension );
 
   public:
     /// Main constructor.
@@ -1026,7 +1026,7 @@ namespace CGAL {
 
     typedef Tag_true Use_mark;
 
-    CGAL_static_assertion( i>1 && i<=Map::dimension+1 );
+    static_assert( i>1 && i<=Map::dimension+1 );
 
   public:
     /// Main constructor.
diff --git a/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp b/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp
index d1bca0f468f5..cbb64ac931c7 100644
--- a/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp
+++ b/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp
@@ -23,12 +23,12 @@ using namespace CGAL::Convex_hull_3::internal;
 
 int main()
 {
-  CGAL_static_assertion( (std::is_same<EPEC,Default_traits_for_Chull_3<EPEC::Point_3>::type>::value) );
-  CGAL_static_assertion( (std::is_same<SCD,Default_traits_for_Chull_3<SCD::Point_3>::type>::value) );
-  CGAL_static_assertion( (std::is_same<SHD,Default_traits_for_Chull_3<SHD::Point_3>::type>::value) );
-  CGAL_static_assertion( (std::is_same<SCR,Default_traits_for_Chull_3<SCR::Point_3>::type>::value) );
-  CGAL_static_assertion( (std::is_same<EPEC,Default_traits_for_Chull_3<EPEC::Point_3>::type>::value) );
-  CGAL_static_assertion( (std::is_same<CGAL::Convex_hull_traits_3<EPIC, CGAL::Default, CGAL::Tag_true>,Default_traits_for_Chull_3<EPIC::Point_3>::type>::value) );
-  CGAL_static_assertion( (std::is_same<Is_on_positive_side_of_plane_3<CGAL::Convex_hull_traits_3<EPIC, CGAL::Default, CGAL::Tag_true>, boost::true_type >::Protector,CGAL::Protect_FPU_rounding<true> >::value) );
+  static_assert( (std::is_same<EPEC,Default_traits_for_Chull_3<EPEC::Point_3>::type>::value) );
+  static_assert( (std::is_same<SCD,Default_traits_for_Chull_3<SCD::Point_3>::type>::value) );
+  static_assert( (std::is_same<SHD,Default_traits_for_Chull_3<SHD::Point_3>::type>::value) );
+  static_assert( (std::is_same<SCR,Default_traits_for_Chull_3<SCR::Point_3>::type>::value) );
+  static_assert( (std::is_same<EPEC,Default_traits_for_Chull_3<EPEC::Point_3>::type>::value) );
+  static_assert( (std::is_same<CGAL::Convex_hull_traits_3<EPIC, CGAL::Default, CGAL::Tag_true>,Default_traits_for_Chull_3<EPIC::Point_3>::type>::value) );
+  static_assert( (std::is_same<Is_on_positive_side_of_plane_3<CGAL::Convex_hull_traits_3<EPIC, CGAL::Default, CGAL::Tag_true>, boost::true_type >::Protector,CGAL::Protect_FPU_rounding<true> >::value) );
   return 0;
 }
diff --git a/Generalized_map/include/CGAL/GMap_cell_iterators.h b/Generalized_map/include/CGAL/GMap_cell_iterators.h
index a3851f2c297e..f708a3a1321b 100644
--- a/Generalized_map/include/CGAL/GMap_cell_iterators.h
+++ b/Generalized_map/include/CGAL/GMap_cell_iterators.h
@@ -70,7 +70,7 @@ namespace CGAL {
       Base(amap),
       mmark_number(amap.get_new_mark())
     {
-      CGAL_static_assertion( (std::is_same<typename Base::Basic_iterator,
+      static_assert( (std::is_same<typename Base::Basic_iterator,
                               Tag_true>::value) );
       CGAL_assertion(amap.is_whole_map_unmarked(mmark_number));
       mark_cell<Map,i,dim>(amap, (*this), mmark_number);
@@ -183,7 +183,7 @@ namespace CGAL {
       Base(amap),
       mmark_number(amap.get_new_mark())
     {
-      CGAL_static_assertion( (std::is_same<typename Base::Basic_iterator,
+      static_assert( (std::is_same<typename Base::Basic_iterator,
                               Tag_true>::value) );
       CGAL_assertion(amap.is_whole_map_unmarked(mmark_number));
       mark_cell<Map,i,dim>(amap, (*this), mmark_number);
diff --git a/Generalized_map/include/CGAL/GMap_dart_iterators.h b/Generalized_map/include/CGAL/GMap_dart_iterators.h
index 600288df844f..1545166af3aa 100644
--- a/Generalized_map/include/CGAL/GMap_dart_iterators.h
+++ b/Generalized_map/include/CGAL/GMap_dart_iterators.h
@@ -96,7 +96,7 @@ namespace CGAL {
 
     typedef Tag_false Use_mark;      ///< True iff this iterator uses mark
 
-    CGAL_static_assertion( Ai>=0 && Ai<=Map::dimension );
+    static_assert( Ai>=0 && Ai<=Map::dimension );
 
   public:
     /// Main constructor.
@@ -154,7 +154,7 @@ namespace CGAL {
     typedef Tag_false Use_mark;      ///< True iff this iterator uses mark
     typedef Tag_true Basic_iterator; ///< True iff this iterator is basic
 
-    CGAL_static_assertion( (0<=Ai && Ai+delta<=Map::dimension && delta>1) );
+    static_assert( (0<=Ai && Ai+delta<=Map::dimension && delta>1) );
 
   public:
     /// Main constructor.
@@ -269,7 +269,7 @@ namespace CGAL {
     typedef Tag_false Use_mark;      ///< True iff this iterator uses mark
     typedef Tag_true Basic_iterator; ///< True iff this iterator is basic
 
-    CGAL_static_assertion(0<=Ai && Ai+1<=Map_::dimension);
+    static_assert(0<=Ai && Ai+1<=Map_::dimension);
 
   public:
     /// Main constructor.
@@ -468,7 +468,7 @@ namespace CGAL {
     typedef Tag_false Use_mark;      ///< True iff this iterator uses mark
     typedef Tag_true Basic_iterator; ///< True iff this iterator is basic
 
-    CGAL_static_assertion( (0<=Ai && delta1<delta2 &&
+    static_assert( (0<=Ai && delta1<delta2 &&
                             Ai+delta2<=Map::dimension &&
                             delta1>1) );
 
@@ -508,7 +508,7 @@ namespace CGAL {
 
     typedef Tag_true Basic_iterator; ///< True iff this iterator is basic
 
-    CGAL_static_assertion( Ai<Aj && Aj<Ak && Ak<=Map::dimension );
+    static_assert( Ai<Aj && Aj<Ak && Ak<=Map::dimension );
 
   public:
     /// Main constructor.
@@ -590,7 +590,7 @@ namespace CGAL {
     typedef Tag_true Use_mark; ///< True iff this iterator uses mark
     typedef Tag_true Basic_iterator; ///< True iff this iterator is basic
 
-    CGAL_static_assertion( i>=0 && i<=Map::dimension+1 );
+    static_assert( i>=0 && i<=Map::dimension+1 );
 
   public:
     /// Main constructor.
diff --git a/Generalized_map/include/CGAL/Generalized_map.h b/Generalized_map/include/CGAL/Generalized_map.h
index 3e0f077a9899..bc9b60c0f905 100644
--- a/Generalized_map/include/CGAL/Generalized_map.h
+++ b/Generalized_map/include/CGAL/Generalized_map.h
@@ -161,7 +161,7 @@ namespace CGAL {
      */
     Generalized_map_base()
     {
-      CGAL_static_assertion_msg(Helper::nb_attribs<=dimension+1,
+      static_assert(Helper::nb_attribs<=dimension+1,
                   "Too many attributes in the tuple Attributes_enabled");
       this->init_storage();
 
@@ -689,7 +689,7 @@ namespace CGAL {
     void restricted_set_dart_attribute(Dart_descriptor dh,
                                        typename Attribute_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "set_dart_attribute<i> called but i-attributes are disabled.");
 
       if ( this->template attribute<i>(dh)==ah ) return;
@@ -712,7 +712,7 @@ namespace CGAL {
     void set_dart_attribute(Dart_descriptor dh,
                             typename Attribute_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "set_dart_attribute<i> called but i-attributes are disabled.");
 
       if ( this->template attribute<i>(dh)==ah ) return;
@@ -1347,7 +1347,7 @@ namespace CGAL {
     template < class Ite >
     std::ostream& display_orbits(std::ostream & aos) const
     {
-      CGAL_static_assertion( (std::is_same<typename Ite::Basic_iterator,
+      static_assert( (std::is_same<typename Ite::Basic_iterator,
                               Tag_true>::value) );
       unsigned int nb = 0;
       size_type amark = get_new_mark();
@@ -1409,7 +1409,7 @@ namespace CGAL {
     template<unsigned int i, typename ...Args>
     typename Attribute_descriptor<i>::type create_attribute(const Args&... args)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                   "create_attribute<i> but i-attributes are disabled");
      typename Attribute_descriptor<i>::type res=
        std::get<Helper::template Dimension_index<i>::value>
@@ -1427,7 +1427,7 @@ namespace CGAL {
     template<unsigned int i>
     void erase_attribute(typename Attribute_descriptor<i>::type h)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                   "erase_attribute<i> but i-attributes are disabled");
       std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers).erase(h);
@@ -1437,7 +1437,7 @@ namespace CGAL {
     template<unsigned int i>
     bool is_attribute_used(typename Attribute_const_descriptor< i >::type ah) const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                                 "is_attribute_used<i> but i-attributes are disabled");
       return std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers).is_used(ah);
@@ -1447,7 +1447,7 @@ namespace CGAL {
     template <unsigned int i>
     size_type number_of_attributes() const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                   "number_of_attributes<i> but i-attributes are disabled");
       return std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers).size();
@@ -1461,8 +1461,8 @@ namespace CGAL {
     void set_attribute(Dart_descriptor dh,
                        typename Attribute_descriptor<i>::type ah)
     {
-      CGAL_static_assertion(i<=dimension);
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(i<=dimension);
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                   "set_attribute<i> but i-attributes are disabled");
       for ( typename Dart_of_cell_range<i>::iterator it(*this, dh);
             it.cont(); ++it)
@@ -1476,7 +1476,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_range<i>::type & attributes()
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                                 "attributes<i> but i-attributes are disabled");
       return std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers);
@@ -1485,7 +1485,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_const_range<i>::type & attributes() const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                                 "attributes<i> but i-attributes are disabled");
       return std::get<Helper::template Dimension_index<i>::value>
         (mattribute_containers);
@@ -1498,7 +1498,7 @@ namespace CGAL {
                          typename Attribute_type<i>::type&)>&
     onsplit_functor()
     {
-      CGAL_static_assertion_msg
+      static_assert
           (Helper::template Dimension_index<i>::value>=0,
            "onsplit_functor<i> but "
            "i-attributes are disabled");
@@ -1514,7 +1514,7 @@ namespace CGAL {
                                typename Attribute_type<i>::type&)>&
     onsplit_functor() const
     {
-      CGAL_static_assertion_msg
+      static_assert
           (Helper::template Dimension_index<i>::value>=0,
            "onsplit_functor<i> but "
            "i-attributes are disabled");
@@ -1530,7 +1530,7 @@ namespace CGAL {
                                typename Attribute_type<i>::type&)>&
     onmerge_functor()
     {
-      CGAL_static_assertion_msg
+      static_assert
           (Helper::template Dimension_index<i>::value>=0,
            "onsplit_functor<i> but "
            "i-attributes are disabled");
@@ -1545,7 +1545,7 @@ namespace CGAL {
                                typename Attribute_type<i>::type&)>&
     onmerge_functor() const
     {
-      CGAL_static_assertion_msg
+      static_assert
           (Helper::template Dimension_index<i>::value>=0,
            "onsplit_functor<i> but "
            "i-attributes are disabled");
diff --git a/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h b/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h
index 4a15c8ea733c..4b3c17816e4c 100644
--- a/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h
+++ b/Generalized_map/include/CGAL/Generalized_map/internal/Generalized_map_group_functors.h
@@ -65,9 +65,9 @@ struct GMap_group_attribute_functor_of_dart_run
                   typename GMap::Dart_descriptor dh1,
                   typename GMap::Dart_descriptor dh2)
   {
-    CGAL_static_assertion( i<=GMap::dimension );
-    CGAL_static_assertion( i!=j );
-    CGAL_static_assertion_msg(GMap::Helper::template
+    static_assert( i<=GMap::dimension );
+    static_assert( i!=j );
+    static_assert(GMap::Helper::template
                               Dimension_index<i>::value>=0,
                               "GMap_group_attribute_functor_of_dart_run<i> but "
                               "i-attributes are disabled");
@@ -134,9 +134,9 @@ struct GMap_group_attribute_functor_run
                   typename GMap::Dart_descriptor adart1,
                   typename GMap::Dart_descriptor adart2)
   {
-    CGAL_static_assertion( i<=GMap::dimension );
-    CGAL_static_assertion( i!=j );
-    CGAL_static_assertion_msg
+    static_assert( i<=GMap::dimension );
+    static_assert( i!=j );
+    static_assert
         ( GMap::Helper::template Dimension_index<i>::value>=0,
           "GMap_group_attribute_functor_run<i> but i-attributes are disabled" );
     typename GMap::template Attribute_descriptor<i>::type
@@ -212,9 +212,9 @@ struct GMap_degroup_attribute_functor_run
                   typename GMap::Dart_descriptor adart1,
                   typename GMap::Dart_descriptor adart2)
   {
-    CGAL_static_assertion( i<=GMap::dimension );
-    CGAL_static_assertion( i!=j );
-    CGAL_static_assertion_msg
+    static_assert( i<=GMap::dimension );
+    static_assert( i!=j );
+    static_assert
         ( GMap::Helper::template Dimension_index<i>::value>=0,
           "GMap_degroup_attribute_functor_run<i> but i-attributes are disabled" );
 
@@ -276,7 +276,7 @@ void GMap_test_split_attribute_functor_one_dart
                         unsigned int, typename GMap::Hash_function> &
   found_attributes, typename GMap::size_type mark )
 {
-  CGAL_static_assertion_msg(GMap::Helper::template
+  static_assert(GMap::Helper::template
                             Dimension_index<i>::value>=0,
                             "GMap_test_split_attribute_functor_one_dart<i> but "
                             "i-attributes are disabled");
@@ -340,9 +340,9 @@ struct GMap_test_split_attribute_functor_run
                    &modified_darts,
                    typename GMap::size_type mark_modified_darts=GMap::INVALID_MARK)
   {
-    CGAL_static_assertion( i<=GMap::dimension );
+    static_assert( i<=GMap::dimension );
     CGAL_assertion( i!=j );
-    CGAL_static_assertion_msg(GMap::Helper::template
+    static_assert(GMap::Helper::template
                               Dimension_index<i>::value>=0,
                               "GMap_test_split_attribute_functor_run<i> but "
                               "i-attributes are disabled");
@@ -383,9 +383,9 @@ struct GMap_test_split_attribute_functor_run
                    &modified_darts2,
                    typename GMap::size_type mark_modified_darts=GMap::INVALID_MARK)
   {
-    CGAL_static_assertion( i<=GMap::dimension );
+    static_assert( i<=GMap::dimension );
     CGAL_assertion( i!=j );
-    CGAL_static_assertion_msg(GMap::Helper::template
+    static_assert(GMap::Helper::template
                               Dimension_index<i>::value>=0,
                               "GMap_test_split_attribute_functor_run<i> but "
                               "i-attributes are disabled");
diff --git a/Generalized_map/include/CGAL/Generalized_map_iterators_base.h b/Generalized_map/include/CGAL/Generalized_map_iterators_base.h
index 15f5bb484bf6..6e9976bca4b7 100644
--- a/Generalized_map/include/CGAL/Generalized_map_iterators_base.h
+++ b/Generalized_map/include/CGAL/Generalized_map_iterators_base.h
@@ -59,7 +59,7 @@ namespace CGAL {
 
     typedef Tag_true Use_mark;
 
-    CGAL_static_assertion( (Ai<=Map::dimension &&
+    static_assert( (Ai<=Map::dimension &&
                             std::is_same<Ite_has_stack,Tag_false>::value) );
 
   public:
diff --git a/Generalized_map/include/CGAL/Generalized_map_operations.h b/Generalized_map/include/CGAL/Generalized_map_operations.h
index 8366f3495dfe..0ebec7a7c5c5 100644
--- a/Generalized_map/include/CGAL/Generalized_map_operations.h
+++ b/Generalized_map/include/CGAL/Generalized_map_operations.h
@@ -73,7 +73,7 @@ namespace CGAL
     static size_t run(GMap& amap, typename GMap::Dart_descriptor adart,
                       bool update_attributes)
     {
-      CGAL_static_assertion ( i<GMap::dimension );
+      static_assert ( i<GMap::dimension );
       CGAL_assertion( (amap.template is_removable<i>(adart)) );
 
       size_t res = 0;
@@ -292,7 +292,7 @@ namespace CGAL
     static size_t run(GMap& amap, typename GMap::Dart_descriptor adart,
                       bool update_attributes)
     {
-      CGAL_static_assertion ( 1<=i && i<=GMap::dimension );
+      static_assert ( 1<=i && i<=GMap::dimension );
       CGAL_assertion( (amap.template is_contractible<i>(adart)) );
 
       size_t res = 0;
diff --git a/Generalized_map/include/CGAL/Generalized_map_storages.h b/Generalized_map/include/CGAL/Generalized_map_storages.h
index 4f40c0a922cc..469741cbb165 100644
--- a/Generalized_map/include/CGAL/Generalized_map_storages.h
+++ b/Generalized_map/include/CGAL/Generalized_map_storages.h
@@ -229,7 +229,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_descriptor<i>::type attribute(Dart_descriptor ADart)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (ADart->mattribute_descriptors);
@@ -238,7 +238,7 @@ namespace CGAL {
     typename Attribute_const_descriptor<i>::type
     attribute(Dart_const_descriptor ADart) const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (ADart->mattribute_descriptors);
@@ -249,7 +249,7 @@ namespace CGAL {
     typename Attribute_descriptor<i>::type copy_attribute
     (typename Attribute_const_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "copy_attribute<i> called but i-attributes are disabled.");
       typename Attribute_descriptor<i>::type res=
         std::get<Helper::template Dimension_index<i>::value>
diff --git a/Generalized_map/include/CGAL/Generalized_map_storages_with_index.h b/Generalized_map/include/CGAL/Generalized_map_storages_with_index.h
index 828004b84164..ffd867477f28 100644
--- a/Generalized_map/include/CGAL/Generalized_map_storages_with_index.h
+++ b/Generalized_map/include/CGAL/Generalized_map_storages_with_index.h
@@ -220,7 +220,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_descriptor<i>::type attribute(Dart_descriptor ADart)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (mdarts[ADart].mattribute_descriptors);
@@ -229,7 +229,7 @@ namespace CGAL {
     typename Attribute_const_descriptor<i>::type
     attribute(Dart_const_descriptor ADart) const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (mdarts[ADart].mattribute_descriptors);
@@ -240,7 +240,7 @@ namespace CGAL {
     typename Attribute_descriptor<i>::type copy_attribute
     (typename Attribute_const_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "copy_attribute<i> called but i-attributes are disabled.");
       // We need to do a reserve before the emplace in order to avoid a bug of
       // invalid reference when the container is reallocated.
diff --git a/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h b/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h
index 0dead11c3cab..150efcbf88e0 100644
--- a/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h
+++ b/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h
@@ -752,7 +752,7 @@ class Surface_mesh_geodesic_distances_3
     >
 #endif
 {
-  CGAL_static_assertion((std::is_same<Mode, Direct>::value) ||
+  static_assert((std::is_same<Mode, Direct>::value) ||
                         (std::is_same<Mode, Intrinsic_Delaunay>::value));
 
   // extract real types from Default
diff --git a/Installation/include/CGAL/Installation/internal/deprecation_warning.h b/Installation/include/CGAL/Installation/internal/deprecation_warning.h
index 0206b5629742..6601ff235205 100644
--- a/Installation/include/CGAL/Installation/internal/deprecation_warning.h
+++ b/Installation/include/CGAL/Installation/internal/deprecation_warning.h
@@ -71,7 +71,7 @@
 #endif
 
 #if defined(CGAL_NO_DEPRECATED_CODE) // No deprecated code.
-CGAL_static_assertion_msg(false, CGAL_INTERNAL_DEPRECATED_MESSAGE);
+static_assert(false, CGAL_INTERNAL_DEPRECATED_MESSAGE);
 #elif !defined(CGAL_NO_DEPRECATION_WARNINGS) // don't trigger on NO_DEPRECATION_WARNINGS
 #  if defined(_MSC_VER) || defined(__BORLANDC__) || defined(__DMC__)
 #    pragma message (CGAL_INTERNAL_DEPRECATED_MESSAGE)
diff --git a/Installation/test/Installation/test_configuration_qt5.cpp b/Installation/test/Installation/test_configuration_qt5.cpp
index af10e898b98a..9a869cc25b6d 100644
--- a/Installation/test/Installation/test_configuration_qt5.cpp
+++ b/Installation/test/Installation/test_configuration_qt5.cpp
@@ -13,7 +13,7 @@ template <typename A, typename B>
 typename CGAL::Coercion_traits<A,B>::Type
 binary_func(const A& a , const B& b){
   typedef CGAL::Coercion_traits<A,B> CT;
-  CGAL_static_assertion((CT::Are_explicit_interoperable::value));
+  static_assert((CT::Are_explicit_interoperable::value));
   typename CT::Cast cast;
   return cast(a)*cast(b);
 }
diff --git a/Intersections_2/include/CGAL/Intersection_traits.h b/Intersections_2/include/CGAL/Intersection_traits.h
index 9cc25059be9d..3bfb327db9e6 100644
--- a/Intersections_2/include/CGAL/Intersection_traits.h
+++ b/Intersections_2/include/CGAL/Intersection_traits.h
@@ -181,7 +181,7 @@ do_intersect_impl(const A& a, const B& b, Dynamic_dimension_tag) {
 // inline
 // typename Intersection_traits< typename Kernel_traits<A>::Kernel, A, B>::result_type >::type
 // intersection(const A& a, const B& b) {
-//   CGAL_static_assertion_msg( (std::is_same<typename A::Ambient_dimension, typename B::Ambient_dimension>::value),
+//   static_assert( (std::is_same<typename A::Ambient_dimension, typename B::Ambient_dimension>::value),
 //                               "intersection with objects of different dimensions not supported");
 //   return internal::intersection_impl(a, b, typename A::Ambient_dimension());
 // }
@@ -190,7 +190,7 @@ do_intersect_impl(const A& a, const B& b, Dynamic_dimension_tag) {
 // inline
 // auto // K::Boolean
 // do_intersect(const A& a, const B& b) {
-//   CGAL_static_assertion_msg((std::is_same<typename A::Ambient_dimension, typename B::Ambient_dimension>::value),
+//   static_assert((std::is_same<typename A::Ambient_dimension, typename B::Ambient_dimension>::value),
 //                         "do_intersect with objects of different dimensions not supported");
 //   return internal::do_intersect_impl(a, b, typename A::Ambient_dimension());
 // }
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_do_intersect.h b/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_do_intersect.h
index f7ebc70d25ed..183158050e80 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_do_intersect.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_do_intersect.h
@@ -66,7 +66,7 @@ class Do_intersect_bbox_segment_aux_is_greater<FT, bounded_0, true>
   double dmax;
 
 public:
-  CGAL_static_assertion((std::is_same<FT, double>::value));
+  static_assert((std::is_same<FT, double>::value));
 
   Do_intersect_bbox_segment_aux_is_greater() : error(0.), tmax(0.), dmax(0.) {}
 
diff --git a/Interval_support/include/CGAL/Test/_test_bigfloat_interval_traits.h b/Interval_support/include/CGAL/Test/_test_bigfloat_interval_traits.h
index 11342ed59638..b82269dbf141 100644
--- a/Interval_support/include/CGAL/Test/_test_bigfloat_interval_traits.h
+++ b/Interval_support/include/CGAL/Test/_test_bigfloat_interval_traits.h
@@ -41,7 +41,7 @@ void test_bigfloat_interval_traits() {
   typedef typename BFIT::Is_bigfloat_interval Is_bigfloat_interval;
   CGAL_USE_TYPE(Is_bigfloat_interval);
   // using CGAL::Tag_true;
-  CGAL_static_assertion(( ::std::is_same< Is_bigfloat_interval, CGAL::Tag_true>::value));
+  static_assert(( ::std::is_same< Is_bigfloat_interval, CGAL::Tag_true>::value));
 
   const typename BFIT::Construct construct = typename BFIT::Construct();
   const typename BFIT::Set_precision set_precision = typename BFIT::Set_precision();
diff --git a/Interval_support/include/CGAL/Test/_test_convert_to_bfi.h b/Interval_support/include/CGAL/Test/_test_convert_to_bfi.h
index 34e731dae1a5..59addf6a1fed 100644
--- a/Interval_support/include/CGAL/Test/_test_convert_to_bfi.h
+++ b/Interval_support/include/CGAL/Test/_test_convert_to_bfi.h
@@ -41,7 +41,7 @@ template <typename BFI, typename From>
 void test_convert_to_bfi_from(BFI,From){
   typedef typename CGAL::Coercion_traits<BFI,From>::Type CT_type;
   CGAL_USE_TYPE(CT_type);
-  CGAL_static_assertion(( ::std::is_same<CT_type, BFI>::value));
+  static_assert(( ::std::is_same<CT_type, BFI>::value));
   assert(CGAL::convert_to_bfi(From(0))  == BFI(0));
   assert(CGAL::convert_to_bfi(From(1))  == BFI(1));
   assert(CGAL::convert_to_bfi(From(2))  == BFI(2));
diff --git a/Interval_support/include/CGAL/Test/_test_interval_traits.h b/Interval_support/include/CGAL/Test/_test_interval_traits.h
index d44384dff797..dffa0a292e9d 100644
--- a/Interval_support/include/CGAL/Test/_test_interval_traits.h
+++ b/Interval_support/include/CGAL/Test/_test_interval_traits.h
@@ -36,7 +36,7 @@ void test_with_empty_interval(CGAL::Tag_false) {
     typedef CGAL::Interval_traits<Interval> IT;
     typedef typename IT::Empty Empty;
     CGAL_USE_TYPE(Empty);
-    CGAL_static_assertion(
+    static_assert(
             (::std::is_same< Empty, CGAL::Null_functor>::value));
 
     // this part changes in case we allow empty intersection
@@ -74,8 +74,8 @@ void test_interval_traits() {
     typedef typename IT::With_empty_interval With_empty_interval;
     CGAL_USE_TYPE(Is_interval);
     using CGAL::Tag_true;
-    CGAL_static_assertion(( ::std::is_same< Is_interval, Tag_true>::value));
-    CGAL_static_assertion(( ::std::is_same< Interval_, Interval>::value));
+    static_assert(( ::std::is_same< Is_interval, Tag_true>::value));
+    static_assert(( ::std::is_same< Interval_, Interval>::value));
 
     test_with_empty_interval<Interval>(With_empty_interval());
 
diff --git a/Kernel_23/include/CGAL/Circle_2.h b/Kernel_23/include/CGAL/Circle_2.h
index 921a30d2206f..48a4896fe4e8 100644
--- a/Kernel_23/include/CGAL/Circle_2.h
+++ b/Kernel_23/include/CGAL/Circle_2.h
@@ -35,7 +35,7 @@ class Circle_2 : public R_::Kernel_base::Circle_2
   typedef typename R_::Aff_transformation_2  Aff_transformation_2;
 
   typedef Circle_2                           Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Circle_2>::value));
+  static_assert((std::is_same<Self, typename R_::Circle_2>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Circle_3.h b/Kernel_23/include/CGAL/Circle_3.h
index 3030977c225c..4da79afd351a 100644
--- a/Kernel_23/include/CGAL/Circle_3.h
+++ b/Kernel_23/include/CGAL/Circle_3.h
@@ -43,7 +43,7 @@ template <class R_>
   typedef typename R_::Direction_3           Direction_3;
 
   typedef Circle_3                           Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Circle_3>::value));
+  static_assert((std::is_same<Self, typename R_::Circle_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Direction_2.h b/Kernel_23/include/CGAL/Direction_2.h
index e3478708354f..d3376d740213 100644
--- a/Kernel_23/include/CGAL/Direction_2.h
+++ b/Kernel_23/include/CGAL/Direction_2.h
@@ -38,7 +38,7 @@ class Direction_2 : public R_::Kernel_base::Direction_2
   typedef typename R_::Kernel_base::Direction_2      RDirection_2;
 
   typedef Direction_2                        Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Direction_2>::value));
+  static_assert((std::is_same<Self, typename R_::Direction_2>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Direction_3.h b/Kernel_23/include/CGAL/Direction_3.h
index 6e0eb4930ab6..6c0d13596578 100644
--- a/Kernel_23/include/CGAL/Direction_3.h
+++ b/Kernel_23/include/CGAL/Direction_3.h
@@ -37,7 +37,7 @@ class Direction_3 : public R_::Kernel_base::Direction_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Direction_3                        Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Direction_3>::value));
+  static_assert((std::is_same<Self, typename R_::Direction_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Has_conversion.h b/Kernel_23/include/CGAL/Has_conversion.h
index 8e500c916d2c..0a042781facb 100644
--- a/Kernel_23/include/CGAL/Has_conversion.h
+++ b/Kernel_23/include/CGAL/Has_conversion.h
@@ -23,7 +23,7 @@ namespace internal {
 template<typename K1, typename K2, typename Rep = typename K1::Rep_tag /* Cartesian_tag */>
 struct Converter_selector
 {
-  CGAL_static_assertion_msg((std::is_same<typename K1::Rep_tag,
+  static_assert((std::is_same<typename K1::Rep_tag,
                                             typename K2::Rep_tag>::value),
                             "Kernels must have the same representation");
 
@@ -33,7 +33,7 @@ struct Converter_selector
 template<typename K1, typename K2>
 struct Converter_selector<K1, K2, Homogeneous_tag>
 {
-  CGAL_static_assertion_msg((std::is_same<typename K1::Rep_tag,
+  static_assert((std::is_same<typename K1::Rep_tag,
                                             typename K2::Rep_tag>::value),
                             "Kernels must have the same representation");
 
diff --git a/Kernel_23/include/CGAL/Iso_cuboid_3.h b/Kernel_23/include/CGAL/Iso_cuboid_3.h
index a78404b8db0d..35a157c5e63e 100644
--- a/Kernel_23/include/CGAL/Iso_cuboid_3.h
+++ b/Kernel_23/include/CGAL/Iso_cuboid_3.h
@@ -34,7 +34,7 @@ class Iso_cuboid_3 : public R_::Kernel_base::Iso_cuboid_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Iso_cuboid_3                    Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Iso_cuboid_3>::value));
+  static_assert((std::is_same<Self, typename R_::Iso_cuboid_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Iso_rectangle_2.h b/Kernel_23/include/CGAL/Iso_rectangle_2.h
index 49d2a03b6c3c..b94e3a2086a2 100644
--- a/Kernel_23/include/CGAL/Iso_rectangle_2.h
+++ b/Kernel_23/include/CGAL/Iso_rectangle_2.h
@@ -33,7 +33,7 @@ class Iso_rectangle_2 : public R_::Kernel_base::Iso_rectangle_2
   typedef typename R_::Aff_transformation_2  Aff_transformation_2;
 
   typedef Iso_rectangle_2                    Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Iso_rectangle_2>::value));
+  static_assert((std::is_same<Self, typename R_::Iso_rectangle_2>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Line_2.h b/Kernel_23/include/CGAL/Line_2.h
index 528740a01a9a..81663f033748 100644
--- a/Kernel_23/include/CGAL/Line_2.h
+++ b/Kernel_23/include/CGAL/Line_2.h
@@ -41,7 +41,7 @@ class Line_2 : public R_::Kernel_base::Line_2
   typedef typename R_::Kernel_base::Line_2   RLine_2;
 
   typedef Line_2                             Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Line_2>::value));
+  static_assert((std::is_same<Self, typename R_::Line_2>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Line_3.h b/Kernel_23/include/CGAL/Line_3.h
index 929d658cdc76..6af58a3cfe12 100644
--- a/Kernel_23/include/CGAL/Line_3.h
+++ b/Kernel_23/include/CGAL/Line_3.h
@@ -38,7 +38,7 @@ class Line_3 : public R_::Kernel_base::Line_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Line_3                             Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Line_3>::value));
+  static_assert((std::is_same<Self, typename R_::Line_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Plane_3.h b/Kernel_23/include/CGAL/Plane_3.h
index 104191a5d64d..f41fc96bb813 100644
--- a/Kernel_23/include/CGAL/Plane_3.h
+++ b/Kernel_23/include/CGAL/Plane_3.h
@@ -41,7 +41,7 @@ class Plane_3 : public R_::Kernel_base::Plane_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Plane_3                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Plane_3>::value));
+  static_assert((std::is_same<Self, typename R_::Plane_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Point_2.h b/Kernel_23/include/CGAL/Point_2.h
index 87728264781a..ee8df80b3298 100644
--- a/Kernel_23/include/CGAL/Point_2.h
+++ b/Kernel_23/include/CGAL/Point_2.h
@@ -37,7 +37,7 @@ class Point_2 : public R_::Kernel_base::Point_2
   typedef typename R_::Kernel_base::Point_2  RPoint_2;
 
   typedef Point_2                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Point_2>::value));
+  static_assert((std::is_same<Self, typename R_::Point_2>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Point_3.h b/Kernel_23/include/CGAL/Point_3.h
index 03d00f78f3f2..27d1d19e0dfe 100644
--- a/Kernel_23/include/CGAL/Point_3.h
+++ b/Kernel_23/include/CGAL/Point_3.h
@@ -34,7 +34,7 @@ class Point_3 : public R_::Kernel_base::Point_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Point_3                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Point_3>::value));
+  static_assert((std::is_same<Self, typename R_::Point_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Ray_2.h b/Kernel_23/include/CGAL/Ray_2.h
index d9dae50482ed..73eecc1c025d 100644
--- a/Kernel_23/include/CGAL/Ray_2.h
+++ b/Kernel_23/include/CGAL/Ray_2.h
@@ -42,7 +42,7 @@ class Ray_2 : public R_::Kernel_base::Ray_2
   typedef typename R_::Kernel_base::Ray_2    RRay_2;
 
   typedef Ray_2                              Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Ray_2>::value));
+  static_assert((std::is_same<Self, typename R_::Ray_2>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Ray_3.h b/Kernel_23/include/CGAL/Ray_3.h
index b35ae5e78a90..c2880eab254e 100644
--- a/Kernel_23/include/CGAL/Ray_3.h
+++ b/Kernel_23/include/CGAL/Ray_3.h
@@ -36,7 +36,7 @@ class Ray_3 : public R_::Kernel_base::Ray_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Ray_3                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Ray_3>::value));
+  static_assert((std::is_same<Self, typename R_::Ray_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Segment_2.h b/Kernel_23/include/CGAL/Segment_2.h
index 6209c3a8139f..b789fe25aac8 100644
--- a/Kernel_23/include/CGAL/Segment_2.h
+++ b/Kernel_23/include/CGAL/Segment_2.h
@@ -40,7 +40,7 @@ class Segment_2 : public R_::Kernel_base::Segment_2
   typedef typename R_::Kernel_base::Segment_2 RSegment_2;
 
   typedef Segment_2                           Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Segment_2>::value));
+  static_assert((std::is_same<Self, typename R_::Segment_2>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Segment_3.h b/Kernel_23/include/CGAL/Segment_3.h
index 7023f5fe3fe1..45aa885fe1d2 100644
--- a/Kernel_23/include/CGAL/Segment_3.h
+++ b/Kernel_23/include/CGAL/Segment_3.h
@@ -38,7 +38,7 @@ class Segment_3 : public R_::Kernel_base::Segment_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Segment_3                          Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Segment_3>::value));
+  static_assert((std::is_same<Self, typename R_::Segment_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Sphere_3.h b/Kernel_23/include/CGAL/Sphere_3.h
index 310303fed645..76fa374f831c 100644
--- a/Kernel_23/include/CGAL/Sphere_3.h
+++ b/Kernel_23/include/CGAL/Sphere_3.h
@@ -37,7 +37,7 @@ class Sphere_3 : public R_::Kernel_base::Sphere_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Sphere_3                           Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Sphere_3>::value));
+  static_assert((std::is_same<Self, typename R_::Sphere_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Tetrahedron_3.h b/Kernel_23/include/CGAL/Tetrahedron_3.h
index a8768746f587..58710cbd72ce 100644
--- a/Kernel_23/include/CGAL/Tetrahedron_3.h
+++ b/Kernel_23/include/CGAL/Tetrahedron_3.h
@@ -33,7 +33,7 @@ class Tetrahedron_3 : public R_::Kernel_base::Tetrahedron_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Tetrahedron_3                      Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Tetrahedron_3>::value));
+  static_assert((std::is_same<Self, typename R_::Tetrahedron_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Triangle_2.h b/Kernel_23/include/CGAL/Triangle_2.h
index cf35524a6a42..1e1d38e707e8 100644
--- a/Kernel_23/include/CGAL/Triangle_2.h
+++ b/Kernel_23/include/CGAL/Triangle_2.h
@@ -35,7 +35,7 @@ class Triangle_2 : public R_::Kernel_base::Triangle_2
   typedef typename R_::Kernel_base::Triangle_2  RTriangle_2;
 
   typedef Triangle_2                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Triangle_2>::value));
+  static_assert((std::is_same<Self, typename R_::Triangle_2>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Triangle_3.h b/Kernel_23/include/CGAL/Triangle_3.h
index 1496121d9fe9..1fe15d8ff8d3 100644
--- a/Kernel_23/include/CGAL/Triangle_3.h
+++ b/Kernel_23/include/CGAL/Triangle_3.h
@@ -36,7 +36,7 @@ class Triangle_3 : public R_::Kernel_base::Triangle_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Triangle_3                         Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Triangle_3>::value));
+  static_assert((std::is_same<Self, typename R_::Triangle_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Vector_2.h b/Kernel_23/include/CGAL/Vector_2.h
index 6e62f77fa5d7..dcb85eaeb4ad 100644
--- a/Kernel_23/include/CGAL/Vector_2.h
+++ b/Kernel_23/include/CGAL/Vector_2.h
@@ -42,7 +42,7 @@ class Vector_2 : public R_::Kernel_base::Vector_2
   typedef typename R_::Kernel_base::Vector_2  RVector_2;
 
   typedef Vector_2                    Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Vector_2>::value));
+  static_assert((std::is_same<Self, typename R_::Vector_2>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Vector_3.h b/Kernel_23/include/CGAL/Vector_3.h
index f81aee480f42..0d3f16fc2fc5 100644
--- a/Kernel_23/include/CGAL/Vector_3.h
+++ b/Kernel_23/include/CGAL/Vector_3.h
@@ -42,7 +42,7 @@ class Vector_3 : public R_::Kernel_base::Vector_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Vector_3                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Vector_3>::value));
+  static_assert((std::is_same<Self, typename R_::Vector_3>::value));
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Weighted_point_2.h b/Kernel_23/include/CGAL/Weighted_point_2.h
index ea4364644a80..d2c4f4a48e1d 100644
--- a/Kernel_23/include/CGAL/Weighted_point_2.h
+++ b/Kernel_23/include/CGAL/Weighted_point_2.h
@@ -34,7 +34,7 @@ class Weighted_point_2 : public R_::Kernel_base::Weighted_point_2
   typedef typename R_::FT                             RT;
 
   typedef Weighted_point_2<R_>                        Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Weighted_point_2>::value));
+  static_assert((std::is_same<Self, typename R_::Weighted_point_2>::value));
 
 public:
   typedef Dimension_tag<2>                            Ambient_dimension;
diff --git a/Kernel_23/include/CGAL/Weighted_point_3.h b/Kernel_23/include/CGAL/Weighted_point_3.h
index c57467fb17af..b9358604af8d 100644
--- a/Kernel_23/include/CGAL/Weighted_point_3.h
+++ b/Kernel_23/include/CGAL/Weighted_point_3.h
@@ -34,7 +34,7 @@ class Weighted_point_3 : public R_::Kernel_base::Weighted_point_3
   typedef typename R_::FT                    FT;
 
   typedef Weighted_point_3                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename R_::Weighted_point_3>::value));
+  static_assert((std::is_same<Self, typename R_::Weighted_point_3>::value));
 
 public:
 
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h
index 6ea80be2a414..c6d25336aa28 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_2.h
@@ -60,9 +60,9 @@ _test_cls_point_2(const R& )
  CGAL::Weighted_point_2<R> wp(p1);
  CGAL::Point_2<R> p7(wp);
 
- CGAL_static_assertion(!(boost::is_convertible<CGAL::Weighted_point_2<R>,
+ static_assert(!(boost::is_convertible<CGAL::Weighted_point_2<R>,
                                                CGAL::Point_2<R> >::value));
- CGAL_static_assertion(!(boost::is_convertible<CGAL::Point_2<R>,
+ static_assert(!(boost::is_convertible<CGAL::Point_2<R>,
                                                CGAL::Weighted_point_2<R> >::value));
 
  std::cout << '.';
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h
index b09c11e47a70..f96de09c0d9f 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_cls_point_3.h
@@ -58,9 +58,9 @@ _test_cls_point_3(const R& )
  CGAL::Weighted_point_3<R> wp(p1);
  CGAL::Point_3<R> p7(wp);
 
- CGAL_static_assertion(!(boost::is_convertible<CGAL::Weighted_point_3<R>,
+ static_assert(!(boost::is_convertible<CGAL::Weighted_point_3<R>,
                                                CGAL::Point_3<R> >::value));
- CGAL_static_assertion(!(boost::is_convertible<CGAL::Point_3<R>,
+ static_assert(!(boost::is_convertible<CGAL::Point_3<R>,
                                                CGAL::Weighted_point_3<R> >::value));
 
  std::cout << '.';
diff --git a/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h b/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h
index 1ec9a1d66af1..525c35eaec7b 100644
--- a/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h
+++ b/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages.h
@@ -253,7 +253,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_descriptor<i>::type attribute(Dart_descriptor ADart)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (ADart->mattribute_descriptors);
@@ -262,7 +262,7 @@ namespace CGAL {
     typename Attribute_const_descriptor<i>::type
     attribute(Dart_const_descriptor ADart) const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (ADart->mattribute_descriptors);
@@ -273,7 +273,7 @@ namespace CGAL {
     typename Attribute_descriptor<i>::type copy_attribute
     (typename Attribute_const_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "copy_attribute<i> called but i-attributes are disabled.");
       typename Attribute_descriptor<i>::type res=
         std::get<Helper::template Dimension_index<i>::value>
diff --git a/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages_with_index.h b/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages_with_index.h
index 8417e20b2265..56010ad433ab 100644
--- a/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages_with_index.h
+++ b/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages_with_index.h
@@ -287,7 +287,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_descriptor<i>::type attribute(Dart_descriptor ADart)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                         "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
           (mdarts[ADart].mattribute_descriptors);
@@ -296,7 +296,7 @@ namespace CGAL {
     typename Attribute_const_descriptor<i>::type
     attribute(Dart_const_descriptor ADart) const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                         "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
           (mdarts[ADart].mattribute_descriptors);
@@ -307,7 +307,7 @@ namespace CGAL {
     typename Attribute_descriptor<i>::type copy_attribute
     (typename Attribute_const_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "copy_attribute<i> called but i-attributes are disabled.");
       // We need to do a reserve before the emplace in order to avoid a bug of
       // invalid reference when the container is reallocated.
diff --git a/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h b/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h
index c2331a6acfb8..2d4b0f675379 100644
--- a/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h
+++ b/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages.h
@@ -250,7 +250,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_descriptor<i>::type attribute(Dart_descriptor ADart)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (ADart->mattribute_descriptors);
@@ -259,7 +259,7 @@ namespace CGAL {
     typename Attribute_const_descriptor<i>::type
     attribute(Dart_const_descriptor ADart) const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (ADart->mattribute_descriptors);
@@ -270,7 +270,7 @@ namespace CGAL {
     typename Attribute_descriptor<i>::type copy_attribute
     (typename Attribute_const_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "copy_attribute<i> called but i-attributes are disabled.");
       typename Attribute_descriptor<i>::type res=
         std::get<Helper::template Dimension_index<i>::value>
diff --git a/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages_with_index.h b/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages_with_index.h
index 27d58a7651af..5d260bee1ec0 100644
--- a/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages_with_index.h
+++ b/Linear_cell_complex/include/CGAL/GMap_linear_cell_complex_storages_with_index.h
@@ -239,7 +239,7 @@ namespace CGAL {
     template<unsigned int i>
     typename Attribute_descriptor<i>::type attribute(Dart_descriptor ADart)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (mdarts[ADart].mattribute_descriptors);
@@ -248,7 +248,7 @@ namespace CGAL {
     typename Attribute_const_descriptor<i>::type
     attribute(Dart_const_descriptor ADart) const
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
         (mdarts[ADart].mattribute_descriptors);
@@ -259,7 +259,7 @@ namespace CGAL {
     typename Attribute_descriptor<i>::type copy_attribute
     (typename Attribute_const_descriptor<i>::type ah)
     {
-      CGAL_static_assertion_msg(Helper::template Dimension_index<i>::value>=0,
+      static_assert(Helper::template Dimension_index<i>::value>=0,
                      "copy_attribute<i> called but i-attributes are disabled.");
       // We need to do a reserve before the emplace in order to avoid a bug of
       // invalid reference when the container is reallocated.
diff --git a/Linear_cell_complex/include/CGAL/Linear_cell_complex_base.h b/Linear_cell_complex/include/CGAL/Linear_cell_complex_base.h
index 4569404479d2..4669765f4935 100644
--- a/Linear_cell_complex/include/CGAL/Linear_cell_complex_base.h
+++ b/Linear_cell_complex/include/CGAL/Linear_cell_complex_base.h
@@ -775,7 +775,7 @@ namespace CGAL {
     Dart_descriptor insert_point_in_cell(Dart_descriptor dh, const Point& p,
                                      bool update_attributes=true)
     {
-      CGAL_static_assertion(1<=i && i<=2);
+      static_assert(1<=i && i<=2);
       if (i==1) return insert_point_in_cell_1(dh, p, update_attributes);
       return insert_point_in_cell_2(dh, p, update_attributes);
     }
diff --git a/Linear_cell_complex/include/CGAL/Linear_cell_complex_constructors.h b/Linear_cell_complex/include/CGAL/Linear_cell_complex_constructors.h
index 1bdac283a67e..e770c67e86c8 100644
--- a/Linear_cell_complex/include/CGAL/Linear_cell_complex_constructors.h
+++ b/Linear_cell_complex/include/CGAL/Linear_cell_complex_constructors.h
@@ -48,7 +48,7 @@ namespace CGAL {
     typedef typename std::list<Dart_descriptor>::iterator List_iterator;
     typedef typename LCC::Point Point;
 
-    CGAL_static_assertion( LCC::dimension>=2 && LCC::ambient_dimension==2 );
+    static_assert( LCC::dimension>=2 && LCC::ambient_dimension==2 );
     CGAL_assertion(edge_indices.size() % 2 == 0);
 
     std::vector< typename LCC::Vertex_attribute_descriptor > initVertices;
diff --git a/Linear_cell_complex/include/CGAL/Linear_cell_complex_operations.h b/Linear_cell_complex/include/CGAL/Linear_cell_complex_operations.h
index 4728c9bf2f3f..a895b915b780 100644
--- a/Linear_cell_complex/include/CGAL/Linear_cell_complex_operations.h
+++ b/Linear_cell_complex/include/CGAL/Linear_cell_complex_operations.h
@@ -120,7 +120,7 @@ namespace CGAL {
     static typename LCC::Point run(const LCC& amap,
                                    typename LCC::Dart_const_descriptor adart)
     {
-      CGAL_static_assertion(0<i && i<=LCC::dimension);
+      static_assert(0<i && i<=LCC::dimension);
       CGAL_assertion(adart != LCC::null_descriptor);
 
       typename LCC::Vector vec
@@ -151,7 +151,7 @@ namespace CGAL {
     static typename LCC::Point run(const LCC& amap,
                                    typename LCC::Dart_const_descriptor adart)
     {
-      CGAL_static_assertion(1<=LCC::dimension);
+      static_assert(1<=LCC::dimension);
       CGAL_assertion(adart != LCC::null_descriptor);
       typename LCC::Dart_const_descriptor d2=amap.other_extremity(adart);
       if (d2==amap.null_descriptor) return amap.point(adart);
@@ -168,7 +168,7 @@ namespace CGAL {
     static typename LCC::Point run(const LCC& amap,
                                    typename LCC::Dart_const_descriptor adart)
     {
-      CGAL_static_assertion(2<=LCC::dimension);
+      static_assert(2<=LCC::dimension);
       CGAL_assertion(adart != LCC::null_descriptor);
 
       // We go to the beginning of the face (first dart, case of open face)
diff --git a/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h b/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
index c66d416841c3..e336fe53d397 100644
--- a/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
+++ b/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
@@ -485,7 +485,7 @@ class Compact_mesh_cell_3
   template<typename GT_>
   const Point_3& weighted_circumcenter(const GT_& gt) const
   {
-    CGAL_static_assertion((std::is_same<Point_3,
+    static_assert((std::is_same<Point_3,
       typename GT_::Construct_weighted_circumcenter_3::result_type>::value));
     if (internal_tbb::is_null(weighted_circumcenter_)) {
       this->try_to_set_circumcenter(
diff --git a/Mesh_3/include/CGAL/Mesh_criteria_3.h b/Mesh_3/include/CGAL/Mesh_criteria_3.h
index c7dcfeb33ab6..71e0aa813941 100644
--- a/Mesh_3/include/CGAL/Mesh_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_criteria_3.h
@@ -98,7 +98,7 @@ class Mesh_criteria_3_impl
 
   template <typename Facet_criterion>
   void add_facet_criterion(Facet_criterion* criterion) {
-    CGAL_static_assertion((boost::is_base_of<
+    static_assert((boost::is_base_of<
                            typename Facet_criteria::Abstract_criterion,
                            Facet_criterion
                            >::value));
@@ -107,7 +107,7 @@ class Mesh_criteria_3_impl
 
   template <typename Cell_criterion>
   void add_cell_criterion(Cell_criterion* criterion) {
-    CGAL_static_assertion((boost::is_base_of<
+    static_assert((boost::is_base_of<
                            typename Cell_criteria::Abstract_criterion,
                            Cell_criterion
                            >::value));
diff --git a/Mesh_3/test/Mesh_3/test_meshing_3D_image.cpp b/Mesh_3/test/Mesh_3/test_meshing_3D_image.cpp
index 9885213a25c3..a427fa7327df 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_3D_image.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_3D_image.cpp
@@ -68,7 +68,7 @@ struct Image_tester : public Tester<K_e_i>
     this->verify(c3t3,domain,criteria, Bissection_tag());
 
     typedef typename Mesh_domain::Surface_patch_index Patch_id;
-    CGAL_static_assertion(CGAL::Output_rep<Patch_id>::is_specialized);
+    static_assert(CGAL::Output_rep<Patch_id>::is_specialized);
     CGAL_USE_TYPE(Patch_id);
   }
 
diff --git a/Mesh_3/test/Mesh_3/test_meshing_3D_image_deprecated.cpp b/Mesh_3/test/Mesh_3/test_meshing_3D_image_deprecated.cpp
index ed1a1fbd14b6..d76899203634 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_3D_image_deprecated.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_3D_image_deprecated.cpp
@@ -50,7 +50,7 @@ struct Image_tester : public Tester<K_e_i>
     this->verify(c3t3,domain,criteria, Bissection_tag());
 
     typedef typename Mesh_domain::Surface_patch_index Patch_id;
-    CGAL_static_assertion(CGAL::Output_rep<Patch_id>::is_specialized);
+    static_assert(CGAL::Output_rep<Patch_id>::is_specialized);
     CGAL_USE_TYPE(Patch_id);
   }
 
diff --git a/Mesh_3/test/Mesh_3/test_meshing_3D_image_with_features.cpp b/Mesh_3/test/Mesh_3/test_meshing_3D_image_with_features.cpp
index 1c9607d45cc8..15682e0429be 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_3D_image_with_features.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_3D_image_with_features.cpp
@@ -85,7 +85,7 @@ struct Image_tester : public Tester<K_e_i>
     this->verify(c3t3, domain, criteria, Bissection_tag());
 
     typedef typename Mesh_domain::Surface_patch_index Patch_id;
-    CGAL_static_assertion(CGAL::Output_rep<Patch_id>::is_specialized);
+    static_assert(CGAL::Output_rep<Patch_id>::is_specialized);
     CGAL_USE_TYPE(Patch_id);
   }
 
diff --git a/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp b/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
index 9a0c5677168f..76addcd6f618 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
@@ -35,7 +35,7 @@ struct Polyhedron_tester : public Tester<K>
     typedef CGAL::Polyhedron_3<Gt> Polyhedron;
     typedef CGAL::Polyhedral_mesh_domain_3<Polyhedron, Gt> Mesh_domain;
 
-    CGAL_static_assertion((std::is_same<
+    static_assert((std::is_same<
                             typename Mesh_domain::Surface_patch_index,
                             std::pair<int, int>
                            >::value));
diff --git a/Nef_2/include/CGAL/Nef_2/PM_overlayer.h b/Nef_2/include/CGAL/Nef_2/PM_overlayer.h
index a28160ed477a..5ce03215db3d 100644
--- a/Nef_2/include/CGAL/Nef_2/PM_overlayer.h
+++ b/Nef_2/include/CGAL/Nef_2/PM_overlayer.h
@@ -959,7 +959,7 @@ bool is_forward_edge(const Const_decorator& N,
 
 void assert_type_precondition() const
 { typename PM_decorator_::Point p1; Point p2;
-  CGAL_static_assertion((std::is_same<typename PM_decorator_::Point, Point>::value)); }
+  static_assert((std::is_same<typename PM_decorator_::Point, Point>::value)); }
 
 
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h b/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h
index 50ac9fbedf8f..b00b0af2d161 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h
@@ -135,8 +135,8 @@ template <class Base_> struct Kernel_d_interface : public Base_ {
           typedef typename Base::Point_cartesian_const_iterator result_type;
           // Kernel_d requires a common iterator type for points and vectors
           // TODO: provide this mixed functor in preKernel?
-          // CGAL_static_assertion((std::is_same<typename CGAL::decay<typename boost::result_of<CVI(Vector_d,CGAL::Begin_tag)>::type>::type, result_type>::value));
-          // CGAL_static_assertion((std::is_same<typename CGAL::decay<typename CVI::result_type>::type, result_type>::value));
+          // static_assert((std::is_same<typename CGAL::decay<typename boost::result_of<CVI(Vector_d,CGAL::Begin_tag)>::type>::type, result_type>::value));
+          // static_assert((std::is_same<typename CGAL::decay<typename CVI::result_type>::type, result_type>::value));
           template <class Tag_>
           auto operator()(Point_d const&p, Tag_ t)const{
             return CPI(this->kernel())(p,t);
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h b/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h
index 88a4ed421a99..be1b2b3a6f01 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Vector/array.h
@@ -41,7 +41,7 @@ template<class NT_,class Dim_,class Max_dim_=Dim_> struct Array_vector {
         template<class> struct Property : boost::false_type {};
 
         static const unsigned d_=Max_dim_::value;
-        CGAL_static_assertion(d_ != (unsigned)UNKNOWN_DIMENSION);
+        static_assert(d_ != (unsigned)UNKNOWN_DIMENSION);
 
         typedef std::array<NT,d_> Vector;
         struct Construct_vector {
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Hyperplane_d.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Hyperplane_d.h
index 2eae60f5576f..c4f7a47040b5 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Hyperplane_d.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Hyperplane_d.h
@@ -32,7 +32,7 @@ class Hyperplane_d : public Get_type<typename R_::Kernel_base, Hyperplane_tag>::
   typedef typename Get_functor<Kbase, Hyperplane_translation_tag>::type                        HTBase;
 
   typedef Hyperplane_d                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename Get_type<R_, Hyperplane_tag>::type>::value));
+  static_assert((std::is_same<Self, typename Get_type<R_, Hyperplane_tag>::type>::value));
 
 public:
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Point_d.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Point_d.h
index 42d94a93c73e..ed038e9c95f9 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Point_d.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Point_d.h
@@ -40,7 +40,7 @@ class Point_d : public Get_type<typename R_::Kernel_base, Point_tag>::type
 
 
   typedef Point_d                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename Get_type<R_, Point_tag>::type>::value));
+  static_assert((std::is_same<Self, typename Get_type<R_, Point_tag>::type>::value));
 
 public:
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Ref_count_obj.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Ref_count_obj.h
index fefbca812b78..364a4184e96d 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Ref_count_obj.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Ref_count_obj.h
@@ -33,7 +33,7 @@ class Ref_count_obj
   typedef typename Get_functor<Kbase, Construct_ttag<Tag_> >::type CBase;
 
   typedef Ref_count_obj                        Self;
-  CGAL_static_assertion((std::is_same<Self, typename Get_type<R_, Tag_>::type>::value));
+  static_assert((std::is_same<Self, typename Get_type<R_, Tag_>::type>::value));
 
 public:
   typedef R_ R;
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Segment_d.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Segment_d.h
index 28bd4e8a8a35..a45ce922e124 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Segment_d.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Segment_d.h
@@ -35,7 +35,7 @@ class Segment_d : public Get_type<typename R_::Kernel_base, Segment_tag>::type
   typedef typename Get_functor<Kbase, Segment_extremity_tag>::type CSEBase;
 
   typedef Segment_d                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename Get_type<R_, Segment_tag>::type>::value));
+  static_assert((std::is_same<Self, typename Get_type<R_, Segment_tag>::type>::value));
 
 public:
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Sphere_d.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Sphere_d.h
index 7bcd8568dcc7..409c9b65e3f3 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Sphere_d.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Sphere_d.h
@@ -32,7 +32,7 @@ class Sphere_d : public Get_type<typename R_::Kernel_base, Sphere_tag>::type
   typedef typename Get_functor<Kbase, Squared_radius_tag>::type                        SRBase;
 
   typedef Sphere_d                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename Get_type<R_, Sphere_tag>::type>::value));
+  static_assert((std::is_same<Self, typename Get_type<R_, Sphere_tag>::type>::value));
 
 public:
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Vector_d.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Vector_d.h
index 6d47e86d2f33..9593ef91bbc6 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Vector_d.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Vector_d.h
@@ -39,7 +39,7 @@ class Vector_d : public Get_type<typename R_::Kernel_base, Vector_tag>::type
   typedef typename Get_functor<Kbase, Squared_length_tag>::type SLBase;
 
   typedef Vector_d                            Self;
-  CGAL_static_assertion((std::is_same<Self, typename Get_type<R_, Vector_tag>::type>::value));
+  static_assert((std::is_same<Self, typename Get_type<R_, Vector_tag>::type>::value));
 
 public:
 
diff --git a/NewKernel_d/test/NewKernel_d/Epick_d.cpp b/NewKernel_d/test/NewKernel_d/Epick_d.cpp
index bbc3b6a128c7..1e88061cbf15 100644
--- a/NewKernel_d/test/NewKernel_d/Epick_d.cpp
+++ b/NewKernel_d/test/NewKernel_d/Epick_d.cpp
@@ -740,11 +740,11 @@ template struct CGAL::Epick_d<CGAL::Dynamic_dimension_tag>;
 typedef CGAL::Epick_d<CGAL::Dimension_tag<2> > Ker2;
 typedef CGAL::Epick_d<CGAL::Dimension_tag<3> > Ker3;
 typedef CGAL::Epick_d<CGAL::Dynamic_dimension_tag> Kerd;
-CGAL_static_assertion((std::is_same<CGAL::Dimension_tag<2>,Ker2::Dimension>::value));
-CGAL_static_assertion((std::is_same<CGAL::Dimension_tag<3>,Ker3::Dimension>::value));
-CGAL_static_assertion((std::is_same<CGAL::Dynamic_dimension_tag,Kerd::Dimension>::value));
-CGAL_static_assertion((std::is_same<CGAL::Dimension_tag<2>,CGAL::Ambient_dimension<Ker2::Point_d>::type>::value));
-CGAL_static_assertion((std::is_same<CGAL::Dimension_tag<3>,CGAL::Ambient_dimension<Ker3::Point_d,Ker3>::type>::value));
+static_assert((std::is_same<CGAL::Dimension_tag<2>,Ker2::Dimension>::value));
+static_assert((std::is_same<CGAL::Dimension_tag<3>,Ker3::Dimension>::value));
+static_assert((std::is_same<CGAL::Dynamic_dimension_tag,Kerd::Dimension>::value));
+static_assert((std::is_same<CGAL::Dimension_tag<2>,CGAL::Ambient_dimension<Ker2::Point_d>::type>::value));
+static_assert((std::is_same<CGAL::Dimension_tag<3>,CGAL::Ambient_dimension<Ker3::Point_d,Ker3>::type>::value));
 int main(){
   //Broken with Linear_base_d (output iterator)
   //test2<CGAL::Kernel_d_interface<KK> >();
diff --git a/Number_types/include/CGAL/Lazy_exact_nt.h b/Number_types/include/CGAL/Lazy_exact_nt.h
index 38c55c62d325..be91713a6749 100644
--- a/Number_types/include/CGAL/Lazy_exact_nt.h
+++ b/Number_types/include/CGAL/Lazy_exact_nt.h
@@ -944,7 +944,7 @@ struct Div_mod_selector {
     void operator()( const NT1& x, const NT2& y,
                      NT& q,
                      NT& r ) const {
-      CGAL_static_assertion((::std::is_same<
+      static_assert((::std::is_same<
         typename Coercion_traits< NT1, NT2 >::Type, NT
                                               >::value));
 
@@ -1029,7 +1029,7 @@ template < typename ET > class Real_embeddable_traits< Lazy_exact_nt<ET> >
   : public INTERN_RET::Real_embeddable_traits_base< Lazy_exact_nt<ET> , CGAL::Tag_true > {
 
   // Every type ET of Lazy_exact_nt<ET> has to be real embeddable.
-  CGAL_static_assertion((::std::is_same< typename Real_embeddable_traits< ET >
+  static_assert((::std::is_same< typename Real_embeddable_traits< ET >
                                 ::Is_real_embeddable, Tag_true >::value));
 
   public:
diff --git a/Number_types/include/CGAL/Mpzf.h b/Number_types/include/CGAL/Mpzf.h
index c2689f3ee455..daa0d9222b54 100644
--- a/Number_types/include/CGAL/Mpzf.h
+++ b/Number_types/include/CGAL/Mpzf.h
@@ -148,7 +148,7 @@ template <class T, class = void> struct pool2 {
   static bool empty() { return data() == 0; }
   static const int extra = 1; // TODO: handle the case where a pointer is larger than a mp_limb_t
   private:
-  CGAL_static_assertion(sizeof(T) >= sizeof(T*));
+  static_assert(sizeof(T) >= sizeof(T*));
   static T& data () {
     static CGAL_MPZF_TLS T data_ = 0;
     return data_;
@@ -162,7 +162,7 @@ template <class T, class = void> struct pool3 {
   static bool empty() { return data() == 0; }
   static const int extra = 1; // TODO: handle the case where a pointer is larger than a mp_limb_t
   private:
-  CGAL_static_assertion(sizeof(T) >= sizeof(T*));
+  static_assert(sizeof(T) >= sizeof(T*));
   struct cleaner {
     T data_ = 0;
     ~cleaner(){
@@ -455,7 +455,7 @@ struct Mpzf {
     }
     int e1 = (int)dexp+13;
     // FIXME: make it more general! But not slower...
-    CGAL_static_assertion(GMP_NUMB_BITS == 64);
+    static_assert(GMP_NUMB_BITS == 64);
     int e2 = e1 % 64;
     exp = e1 / 64 - 17;
     // 52+1023+13==17*64 ?
diff --git a/Number_types/include/CGAL/Root_of_traits.h b/Number_types/include/CGAL/Root_of_traits.h
index a1a941277bc2..c014e667293d 100644
--- a/Number_types/include/CGAL/Root_of_traits.h
+++ b/Number_types/include/CGAL/Root_of_traits.h
@@ -150,7 +150,7 @@ struct Root_of_traits_helper < FT, Field_tag >
     // We have the typedef as VC10 fails with
     // static_assert(FrT::Is_fraction::value)
     typedef typename FrT::Is_fraction ISF;
-    CGAL_static_assertion((ISF::value));
+    static_assert((ISF::value));
 
 
     typedef typename FrT::Numerator_type      RT;
diff --git a/Number_types/include/CGAL/Test/test_root_of_traits.h b/Number_types/include/CGAL/Test/test_root_of_traits.h
index ae1c7768852a..23f4b5dafc73 100644
--- a/Number_types/include/CGAL/Test/test_root_of_traits.h
+++ b/Number_types/include/CGAL/Test/test_root_of_traits.h
@@ -28,8 +28,8 @@ void test_root_of_traits(){
     typedef typename RoT::Root_of_1 Root_of_1;
     typedef typename RoT::Root_of_2 Root_of_2;
 
-    CGAL_static_assertion((::std::is_same<RootOf1,Root_of_1>::value));
-    CGAL_static_assertion((::std::is_same<RootOf2,Root_of_2>::value));
+    static_assert((::std::is_same<RootOf1,Root_of_1>::value));
+    static_assert((::std::is_same<RootOf2,Root_of_2>::value));
 
     typedef typename RoT::Make_root_of_2 Make_root_of_2;
     typedef typename RoT::Make_sqrt      Make_sqrt;
@@ -41,10 +41,10 @@ void test_root_of_traits(){
     const Inverse&        inverse        = Inverse();
     const Square&         square         = Square();
 
-    CGAL_static_assertion((::std::is_same<Root_of_2,typename Make_root_of_2::result_type>::value));
-    CGAL_static_assertion((::std::is_same<Root_of_2,typename Make_sqrt::result_type>::value));
-    CGAL_static_assertion((::std::is_same<Root_of_2,typename Inverse::result_type>::value));
-    CGAL_static_assertion((::std::is_same<Root_of_2,typename Square::result_type>::value));
+    static_assert((::std::is_same<Root_of_2,typename Make_root_of_2::result_type>::value));
+    static_assert((::std::is_same<Root_of_2,typename Make_sqrt::result_type>::value));
+    static_assert((::std::is_same<Root_of_2,typename Inverse::result_type>::value));
+    static_assert((::std::is_same<Root_of_2,typename Square::result_type>::value));
 
 
     {
diff --git a/Number_types/include/CGAL/mpq_class.h b/Number_types/include/CGAL/mpq_class.h
index a651b674202c..7348097644e9 100644
--- a/Number_types/include/CGAL/mpq_class.h
+++ b/Number_types/include/CGAL/mpq_class.h
@@ -35,7 +35,7 @@
 // while ::__gmp_expr<T, U> is the others "expressions".
 
 #define CGAL_CHECK_GMP_EXPR_MPQ_CLASS                                     \
-    CGAL_static_assertion(                                                \
+    static_assert(                                                \
             (::std::is_same< ::__gmp_expr< T , T >,Type>::value ));
 
 namespace CGAL {
diff --git a/Number_types/include/CGAL/mpz_class.h b/Number_types/include/CGAL/mpz_class.h
index 9b868199f9f3..c8899fc1b971 100644
--- a/Number_types/include/CGAL/mpz_class.h
+++ b/Number_types/include/CGAL/mpz_class.h
@@ -38,7 +38,7 @@
 #include <type_traits>
 
 #define CGAL_CHECK_GMP_EXPR                                             \
-    CGAL_static_assertion(                                                \
+    static_assert(                                                \
             (::std::is_same< ::__gmp_expr< T , T >,Type>::value ));
 
 namespace CGAL {
diff --git a/Number_types/include/CGAL/simplest_rational_in_interval.h b/Number_types/include/CGAL/simplest_rational_in_interval.h
index 374d89e1fd2c..a93bcc855b49 100644
--- a/Number_types/include/CGAL/simplest_rational_in_interval.h
+++ b/Number_types/include/CGAL/simplest_rational_in_interval.h
@@ -43,10 +43,10 @@ simplest_rational_in_interval(double x, double y) {
 
     // Must be a fraction
     CGAL_USE_TYPE(Is_fraction);
-    CGAL_static_assertion((::std::is_same<Is_fraction, Tag_true>::value));
+    static_assert((::std::is_same<Is_fraction, Tag_true>::value));
     // Numerator_type,Denominator_type must be the same
     CGAL_USE_TYPE(Denominator_type);
-    CGAL_static_assertion((::std::is_same<Numerator_type, Denominator_type>::value));
+    static_assert((::std::is_same<Numerator_type, Denominator_type>::value));
 
 
   if(x == y){
diff --git a/Number_types/include/CGAL/to_rational.h b/Number_types/include/CGAL/to_rational.h
index add67aeb6ccc..d60f56b3eb24 100644
--- a/Number_types/include/CGAL/to_rational.h
+++ b/Number_types/include/CGAL/to_rational.h
@@ -34,9 +34,9 @@ to_rational(double x)
     typedef typename FT::Denominator_type Denominator_type;
     typename FT::Compose compose;
 
-    CGAL_static_assertion((::std::is_same<Is_fraction,Tag_true>::value));
+    static_assert((::std::is_same<Is_fraction,Tag_true>::value));
     CGAL_USE_TYPE(Is_fraction);
-    CGAL_static_assertion((::std::is_same<Numerator_type,Denominator_type>::value));
+    static_assert((::std::is_same<Numerator_type,Denominator_type>::value));
     CGAL_USE_TYPE(Denominator_type);
 
     Numerator_type num(0),den(1);
diff --git a/Number_types/test/Number_types/Lazy_exact_nt_new.cpp b/Number_types/test/Number_types/Lazy_exact_nt_new.cpp
index 54a1ea8581e5..f80b17bc1bae 100644
--- a/Number_types/test/Number_types/Lazy_exact_nt_new.cpp
+++ b/Number_types/test/Number_types/Lazy_exact_nt_new.cpp
@@ -81,9 +81,9 @@ void test_lazy_exact_nt() {
         typedef CGAL::Lazy_exact_nt< typename AK::Integer > LI;
         typedef CGAL::Lazy_exact_nt< typename AK::Rational > LR;
         typedef CGAL::Coercion_traits<LI,LR> CT;
-        CGAL_static_assertion((std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_true>::value));
-        CGAL_static_assertion((std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value));
-        CGAL_static_assertion((std::is_same< typename CT::Type,LR>::value));
+        static_assert((std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_true>::value));
+        static_assert((std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value));
+        static_assert((std::is_same< typename CT::Type,LR>::value));
 
         LI  i(4);
         LR  r(4);
@@ -99,8 +99,8 @@ void test_lazy_exact_nt() {
         typedef CGAL::Lazy_exact_nt<leda_integer> T1;
         typedef CGAL::Lazy_exact_nt<CORE::Expr> T2;
         typedef CGAL::Coercion_traits<T1, T2> CT;
-        CGAL_static_assertion((std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_false>::value));
-        CGAL_static_assertion((std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_false>::value));
+        static_assert((std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_false>::value));
+        static_assert((std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_false>::value));
 #endif
 #endif
     }
diff --git a/Number_types/test/Number_types/Quotient_new.cpp b/Number_types/test/Number_types/Quotient_new.cpp
index 65450205e875..079ea8fbc02b 100644
--- a/Number_types/test/Number_types/Quotient_new.cpp
+++ b/Number_types/test/Number_types/Quotient_new.cpp
@@ -62,9 +62,9 @@ void test_quotient() {
       typedef CGAL::Quotient<typename AT::Integer> QI;
       typedef CGAL::Coercion_traits<I,QI>  CT;
       CGAL_USE_TYPE(CT);
-      CGAL_static_assertion((std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value));
-      CGAL_static_assertion((std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_true>::value));
-      CGAL_static_assertion((std::is_same< typename CT::Type,QI>::value));
+      static_assert((std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value));
+      static_assert((std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_true>::value));
+      static_assert((std::is_same< typename CT::Type,QI>::value));
   }
 }
 
diff --git a/Number_types/test/Number_types/Sqrt_extension.h b/Number_types/test/Number_types/Sqrt_extension.h
index b2c8f42d47d2..547aaf10ab92 100644
--- a/Number_types/test/Number_types/Sqrt_extension.h
+++ b/Number_types/test/Number_types/Sqrt_extension.h
@@ -24,7 +24,7 @@ void convert_to(const NT& x, RT& r){
     typedef CGAL::Coercion_traits<NT,RT> CT;
     typedef typename CT::Type Type;
     CGAL_USE_TYPE(Type);
-    CGAL_static_assertion((::std::is_same<Type,RT>::value));
+    static_assert((::std::is_same<Type,RT>::value));
     r = typename CT::Cast()(x);
 }
 } //namespace CGAL
@@ -700,17 +700,17 @@ void test_get_arithmetic_kernel(){
     typedef CGAL::Sqrt_extension<Integer,Integer,ACDE_TAG> EXT;
     typedef typename CGAL::Get_arithmetic_kernel<EXT>::Arithmetic_kernel AT_;
     CGAL_USE_TYPE(AT_);
-    CGAL_static_assertion((std::is_same<AT,AT_>::value));
+    static_assert((std::is_same<AT,AT_>::value));
   } {
     typedef CGAL::Sqrt_extension<Rational,Integer,ACDE_TAG> EXT;
     typedef typename CGAL::Get_arithmetic_kernel<EXT>::Arithmetic_kernel AT_;
     CGAL_USE_TYPE(AT_);
-    CGAL_static_assertion((std::is_same<AT,AT_>::value));
+    static_assert((std::is_same<AT,AT_>::value));
   } {
     typedef CGAL::Sqrt_extension<Rational,Rational,ACDE_TAG> EXT;
     typedef typename CGAL::Get_arithmetic_kernel<EXT>::Arithmetic_kernel AT_;
     CGAL_USE_TYPE(AT_);
-    CGAL_static_assertion((std::is_same<AT,AT_>::value));
+    static_assert((std::is_same<AT,AT_>::value));
   }
 }
 
diff --git a/Number_types/test/Number_types/include/CGAL/Test/test_root_of_2_traits.h b/Number_types/test/Number_types/include/CGAL/Test/test_root_of_2_traits.h
index bb979e588f36..fddad9865341 100644
--- a/Number_types/test/Number_types/include/CGAL/Test/test_root_of_2_traits.h
+++ b/Number_types/test/Number_types/include/CGAL/Test/test_root_of_2_traits.h
@@ -7,12 +7,12 @@ void test_root_of_traits(){
     typedef typename RoT::Root_of_1 Root_of_1;
     typedef typename RoT::Root_of_2 Root_of_2;
 
-    CGAL_static_assertion((::std::is_same<RootOf1,Root_of_1>::value));
-    CGAL_static_assertion((::std::is_same<RootOf2,Root_of_2>::value));
+    static_assert((::std::is_same<RootOf1,Root_of_1>::value));
+    static_assert((::std::is_same<RootOf2,Root_of_2>::value));
 
     typedef typename RoT::Make_root_of_2 Make_root_of_2;
     typedef typename Make_root_of_2::result_type result_type;
-    CGAL_static_assertion((::std::is_same<Root_of_2,result_type>::value));
+    static_assert((::std::is_same<Root_of_2,result_type>::value));
 
     const Make_root_of_2& make_root_of_2 = Make_root_of_2();
     Root_of_2 r  = make_root_of_2(T(0),T(-1),T(2));        //-sqrt(2)
diff --git a/Number_types/test/Number_types/ioformat.cpp b/Number_types/test/Number_types/ioformat.cpp
index 4d9a66563211..54eaa26bf227 100644
--- a/Number_types/test/Number_types/ioformat.cpp
+++ b/Number_types/test/Number_types/ioformat.cpp
@@ -106,7 +106,7 @@ int main()
 
   // CORE
 #ifdef CGAL_USE_CORE
-  CGAL_static_assertion(CGAL::Output_rep<CORE::BigRat>::is_specialized == true);
+  static_assert(CGAL::Output_rep<CORE::BigRat>::is_specialized == true);
   //bug in io for CORE.
   test_it<CORE::BigInt>("CORE::BigInt");
   test_it<CORE::BigRat>("CORE::BigRat");
@@ -116,7 +116,7 @@ int main()
 
   // LEDA based NTs
 #ifdef CGAL_USE_LEDA
-  CGAL_static_assertion(CGAL::Output_rep<leda_rational>::is_specialized == true);
+  static_assert(CGAL::Output_rep<leda_rational>::is_specialized == true);
   test_it<leda_integer>("leda_integer");
   test_it<leda_rational>("leda_rational");
   test_it<leda_bigfloat>("leda_bigfloat");
diff --git a/Number_types/test/Number_types/known_bit_size_integers.cpp b/Number_types/test/Number_types/known_bit_size_integers.cpp
index 0172db54dac2..fce35d25f647 100644
--- a/Number_types/test/Number_types/known_bit_size_integers.cpp
+++ b/Number_types/test/Number_types/known_bit_size_integers.cpp
@@ -7,18 +7,18 @@ int main()
   std::cout << "Verifying the sizes of boost::[u]int{8,16,32,64}_t"
             << std::endl;
 
-  CGAL_static_assertion(sizeof(boost::int8_t)  == 1);
-  CGAL_static_assertion(sizeof(boost::int16_t) == 2);
-  CGAL_static_assertion(sizeof(boost::int32_t) == 4);
+  static_assert(sizeof(boost::int8_t)  == 1);
+  static_assert(sizeof(boost::int16_t) == 2);
+  static_assert(sizeof(boost::int32_t) == 4);
 #ifndef BOOST_NO_INT64_T
-  CGAL_static_assertion(sizeof(boost::int64_t) == 8);
+  static_assert(sizeof(boost::int64_t) == 8);
 #endif
 
-  CGAL_static_assertion(sizeof(boost::uint8_t)  == 1);
-  CGAL_static_assertion(sizeof(boost::uint16_t) == 2);
-  CGAL_static_assertion(sizeof(boost::uint32_t) == 4);
+  static_assert(sizeof(boost::uint8_t)  == 1);
+  static_assert(sizeof(boost::uint16_t) == 2);
+  static_assert(sizeof(boost::uint32_t) == 4);
 #ifndef BOOST_NO_INT64_T
-  CGAL_static_assertion(sizeof(boost::uint64_t) == 8);
+  static_assert(sizeof(boost::uint64_t) == 8);
 #endif
 
   return 0;
diff --git a/Number_types/test/Number_types/test_nt_Coercion_traits.cpp b/Number_types/test/Number_types/test_nt_Coercion_traits.cpp
index ad73c7555c66..bb7d28b3eab1 100644
--- a/Number_types/test/Number_types/test_nt_Coercion_traits.cpp
+++ b/Number_types/test/Number_types/test_nt_Coercion_traits.cpp
@@ -144,9 +144,9 @@ void AT_coercion_test_for_cgal_types_rat(){
     typedef typename AT::Bigfloat_interval Bigfloat_interval;
 
     CGAL_USE_TYPE(Bigfloat_interval);
-    CGAL_static_assertion(!(::std::is_same<Integer, CGAL::Null_tag>::value));
-    CGAL_static_assertion(!(::std::is_same<Rational, CGAL::Null_tag>::value));
-    CGAL_static_assertion(!(::std::is_same<Bigfloat_interval, CGAL::Null_tag>::value));
+    static_assert(!(::std::is_same<Integer, CGAL::Null_tag>::value));
+    static_assert(!(::std::is_same<Rational, CGAL::Null_tag>::value));
+    static_assert(!(::std::is_same<Bigfloat_interval, CGAL::Null_tag>::value));
 
     CGAL::test_explicit_interoperable_from_to<int     ,Rational>();
     CGAL::test_explicit_interoperable_from_to<double  ,Rational>();
@@ -205,10 +205,10 @@ void AT_coercion_test_for_cgal_types_fws(){
     typedef typename AT::Field_with_sqrt Real;
 
     CGAL_USE_TYPE(Bigfloat_interval);
-    CGAL_static_assertion(!(::std::is_same<Integer, CGAL::Null_tag>::value));
-    CGAL_static_assertion(!(::std::is_same<Rational, CGAL::Null_tag>::value));
-    CGAL_static_assertion(!(::std::is_same<Bigfloat_interval, CGAL::Null_tag>::value));
-    CGAL_static_assertion(!(::std::is_same<Real, CGAL::Null_tag>::value));
+    static_assert(!(::std::is_same<Integer, CGAL::Null_tag>::value));
+    static_assert(!(::std::is_same<Rational, CGAL::Null_tag>::value));
+    static_assert(!(::std::is_same<Bigfloat_interval, CGAL::Null_tag>::value));
+    static_assert(!(::std::is_same<Real, CGAL::Null_tag>::value));
 
 
     typedef CGAL::Sqrt_extension<Integer  , Integer> Extn_1;
diff --git a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h
index 12b37586a41e..110123898a51 100644
--- a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h
+++ b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h
@@ -117,7 +117,7 @@ void optimize_along_OBB_axes(typename Traits::Matrix& rot,
   typedef typename Traits::Matrix                                    Matrix;
   typedef typename Traits::Vector                                    Vector;
 
-  CGAL_static_assertion((std::is_same<typename boost::range_value<PointRange>::type, Point>::value));
+  static_assert((std::is_same<typename boost::range_value<PointRange>::type, Point>::value));
 
   std::vector<Point> rotated_points;
   rotated_points.reserve(points.size());
diff --git a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h
index 037df4524780..08b39186cf4e 100644
--- a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h
+++ b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h
@@ -202,7 +202,7 @@ void construct_oriented_bounding_box(const PointRange& points,
 {
   typedef typename Traits::Point_3                                   Point;
 
-  CGAL_static_assertion((std::is_same<typename boost::range_value<PointRange>::type, Point>::value));
+  static_assert((std::is_same<typename boost::range_value<PointRange>::type, Point>::value));
 
   if(use_ch) // construct the convex hull to reduce the number of points
   {
@@ -341,7 +341,7 @@ void oriented_bounding_box(const PointRange& points,
                                                        NamedParameters,
                                                        Default_traits>::type            Geom_traits;
 
-  CGAL_static_assertion_msg(!(std::is_same<Geom_traits, CGAL::Default>::value),
+  static_assert(!(std::is_same<Geom_traits, CGAL::Default>::value),
                             "You must provide a traits class or have Eigen enabled!");
 
   Geom_traits traits = choose_parameter<Geom_traits>(get_parameter(np, internal_np::geom_traits));
diff --git a/Point_set_processing_3/include/CGAL/OpenGR/compute_registration_transformation.h b/Point_set_processing_3/include/CGAL/OpenGR/compute_registration_transformation.h
index dcda82d9555f..43bf9c7db420 100644
--- a/Point_set_processing_3/include/CGAL/OpenGR/compute_registration_transformation.h
+++ b/Point_set_processing_3/include/CGAL/OpenGR/compute_registration_transformation.h
@@ -309,13 +309,13 @@ compute_registration_transformation (const PointRange1& point_set_1, const Point
   typedef Point_set_processing_3_np_helper<PointRange2, NamedParameters2> NP_helper2;
   typedef typename NP_helper1::Const_point_map PointMap1;
   typedef typename NP_helper2::Const_point_map PointMap2;
-  CGAL_static_assertion_msg((std::is_same< typename boost::property_traits<PointMap1>::value_type,
+  static_assert((std::is_same< typename boost::property_traits<PointMap1>::value_type,
                                            typename boost::property_traits<PointMap2>::value_type> ::value),
                             "The point type of input ranges must be the same");
 
   typedef typename NP_helper1::Normal_map NormalMap1;
   typedef typename NP_helper2::Normal_map NormalMap2;
-  CGAL_static_assertion_msg((std::is_same< typename boost::property_traits<NormalMap1>::value_type,
+  static_assert((std::is_same< typename boost::property_traits<NormalMap1>::value_type,
                                            typename boost::property_traits<NormalMap2>::value_type> ::value),
                             "The vector type of input ranges must be the same");
 
diff --git a/Point_set_processing_3/include/CGAL/OpenGR/register_point_sets.h b/Point_set_processing_3/include/CGAL/OpenGR/register_point_sets.h
index 5e5d7853beef..08012fe33977 100644
--- a/Point_set_processing_3/include/CGAL/OpenGR/register_point_sets.h
+++ b/Point_set_processing_3/include/CGAL/OpenGR/register_point_sets.h
@@ -222,13 +222,13 @@ register_point_sets (const PointRange1& point_set_1, PointRange2& point_set_2,
   typedef Point_set_processing_3_np_helper<PointRange2, NamedParameters2> NP_helper2;
   typedef typename NP_helper1::Const_point_map PointMap1;
   typedef typename NP_helper2::Const_point_map PointMap2;
-  CGAL_static_assertion_msg((std::is_same< typename boost::property_traits<PointMap1>::value_type,
+  static_assert((std::is_same< typename boost::property_traits<PointMap1>::value_type,
                                            typename boost::property_traits<PointMap2>::value_type> ::value),
                             "The point type of input ranges must be the same");
 
   typedef typename NP_helper1::Normal_map NormalMap1;
   typedef typename NP_helper2::Normal_map NormalMap2;
-  CGAL_static_assertion_msg((std::is_same< typename boost::property_traits<NormalMap1>::value_type,
+  static_assert((std::is_same< typename boost::property_traits<NormalMap1>::value_type,
                                            typename boost::property_traits<NormalMap2>::value_type> ::value),
                             "The vector type of input ranges must be the same");
 
diff --git a/Point_set_processing_3/include/CGAL/cluster_point_set.h b/Point_set_processing_3/include/CGAL/cluster_point_set.h
index c79cd850df17..6381c456917d 100644
--- a/Point_set_processing_3/include/CGAL/cluster_point_set.h
+++ b/Point_set_processing_3/include/CGAL/cluster_point_set.h
@@ -145,7 +145,7 @@ std::size_t cluster_point_set (PointRange& points,
   typedef typename NP_helper::Geom_traits Kernel;
   typedef typename Point_set_processing_3::GetAdjacencies<PointRange, NamedParameters>::type Adjacencies;
 
-  CGAL_static_assertion_msg(!(std::is_same<typename GetSvdTraits<NamedParameters>::type,
+  static_assert(!(std::is_same<typename GetSvdTraits<NamedParameters>::type,
                                            typename GetSvdTraits<NamedParameters>::NoTraits>::value),
                             "Error: no SVD traits");
 
diff --git a/Point_set_processing_3/include/CGAL/jet_estimate_normals.h b/Point_set_processing_3/include/CGAL/jet_estimate_normals.h
index d808a6ee46f1..1465fc7e3573 100644
--- a/Point_set_processing_3/include/CGAL/jet_estimate_normals.h
+++ b/Point_set_processing_3/include/CGAL/jet_estimate_normals.h
@@ -197,7 +197,7 @@ jet_estimate_normals(
   typedef typename GetSvdTraits<NamedParameters>::type SvdTraits;
 
   CGAL_assertion_msg(NP_helper::has_normal_map(points, np), "Error: no normal map");
-  CGAL_static_assertion_msg(!(std::is_same<SvdTraits,
+  static_assert(!(std::is_same<SvdTraits,
                               typename GetSvdTraits<NamedParameters>::NoTraits>::value),
                             "Error: no SVD traits");
 
diff --git a/Point_set_processing_3/include/CGAL/jet_smooth_point_set.h b/Point_set_processing_3/include/CGAL/jet_smooth_point_set.h
index c8982be75173..952f2c0d5956 100644
--- a/Point_set_processing_3/include/CGAL/jet_smooth_point_set.h
+++ b/Point_set_processing_3/include/CGAL/jet_smooth_point_set.h
@@ -200,7 +200,7 @@ jet_smooth_point_set(
   typedef typename NP_helper::Geom_traits Kernel;
   typedef typename GetSvdTraits<NamedParameters>::type SvdTraits;
 
-  CGAL_static_assertion_msg(!(std::is_same<SvdTraits,
+  static_assert(!(std::is_same<SvdTraits,
                               typename GetSvdTraits<NamedParameters>::NoTraits>::value),
                             "Error: no SVD traits");
 
diff --git a/Point_set_processing_3/include/CGAL/pointmatcher/compute_registration_transformation.h b/Point_set_processing_3/include/CGAL/pointmatcher/compute_registration_transformation.h
index e8dac2ddc2be..cb47b1a69c1d 100644
--- a/Point_set_processing_3/include/CGAL/pointmatcher/compute_registration_transformation.h
+++ b/Point_set_processing_3/include/CGAL/pointmatcher/compute_registration_transformation.h
@@ -607,13 +607,13 @@ compute_registration_transformation (const PointRange1& point_set_1, const Point
   // property map types
   typedef typename NP_helper1::Const_point_map PointMap1;
   typedef typename NP_helper2::Const_point_map PointMap2;
-  CGAL_static_assertion_msg((std::is_same< typename boost::property_traits<PointMap1>::value_type,
+  static_assert((std::is_same< typename boost::property_traits<PointMap1>::value_type,
                                            typename boost::property_traits<PointMap2>::value_type> ::value),
                             "The point type of input ranges must be the same");
 
   typedef typename NP_helper1::Normal_map NormalMap1;
   typedef typename NP_helper2::Normal_map NormalMap2;
-  CGAL_static_assertion_msg((std::is_same< typename boost::property_traits<NormalMap1>::value_type,
+  static_assert((std::is_same< typename boost::property_traits<NormalMap1>::value_type,
                                            typename boost::property_traits<NormalMap2>::value_type> ::value),
                             "The vector type of input ranges must be the same");
 
@@ -630,7 +630,7 @@ compute_registration_transformation (const PointRange1& point_set_1, const Point
   NormalMap2 normal_map2 = NP_helper2::get_normal_map(point_set_2, np2);
   auto weight_map2 = choose_parameter(get_parameter(np2, internal_np::scalar_map), DefaultWeightMap2(Scalar(1)));
 
-  CGAL_static_assertion_msg((std::is_same< typename boost::property_traits<decltype(weight_map1)>::value_type,
+  static_assert((std::is_same< typename boost::property_traits<decltype(weight_map1)>::value_type,
                                            typename boost::property_traits<decltype(weight_map2)>::value_type> ::value),
                             "The scalar type of input ranges must be the same");
 
diff --git a/Point_set_processing_3/include/CGAL/structure_point_set.h b/Point_set_processing_3/include/CGAL/structure_point_set.h
index 043001e3b04a..58b3cbee86d0 100644
--- a/Point_set_processing_3/include/CGAL/structure_point_set.h
+++ b/Point_set_processing_3/include/CGAL/structure_point_set.h
@@ -234,7 +234,7 @@ class Point_set_with_structure
     typedef typename Point_set_processing_3::GetPlaneIndexMap<NamedParameters>::type PlaneIndexMap;
 
     CGAL_assertion_msg(NP_helper::has_normal_map(points, np), "Error: no normal map");
-    CGAL_static_assertion_msg((!is_default_parameter<NamedParameters, internal_np::plane_index_t>::value),
+    static_assert((!is_default_parameter<NamedParameters, internal_np::plane_index_t>::value),
                               "Error: no plane index map");
 
     PointMap point_map = NP_helper::get_const_point_map(points, np);
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h
index ee92e8e36405..691ddfa6a3bf 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h
@@ -444,7 +444,7 @@ generic_clip_impl(
   typedef typename GetVertexPointMap<TriangleMesh,
                                      NamedParameters2>::type Vpm2;
 
-  CGAL_static_assertion((std::is_same<typename boost::property_traits<Vpm>::value_type,
+  static_assert((std::is_same<typename boost::property_traits<Vpm>::value_type,
                                       typename boost::property_traits<Vpm>::value_type>::value));
 
   Vpm vpm1 = choose_parameter(get_parameter(np1, internal_np::vertex_point),
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/connected_components.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/connected_components.h
index 525f020a342a..991c4b33c4b2 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/connected_components.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/connected_components.h
@@ -553,7 +553,7 @@ std::size_t keep_large_connected_components(PolygonMesh& pmesh,
                                                       >::type             FaceSizeMap;
   typedef typename boost::property_traits<FaceSizeMap>::value_type        Face_size;
 
-  CGAL_static_assertion((std::is_convertible<ThresholdValueType, Face_size>::value));
+  static_assert((std::is_convertible<ThresholdValueType, Face_size>::value));
 
   typedef typename internal_np::Lookup_named_param_def<internal_np::output_iterator_t,
                                                        NamedParameters,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h
index 1100d638cfa7..5167a240f18e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h
@@ -206,7 +206,7 @@ corefine_and_compute_boolean_operations(
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters1>::type  VPM1;
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters2>::type  VPM2;
 
-  CGAL_static_assertion((std::is_same<typename boost::property_traits<VPM1>::value_type,
+  static_assert((std::is_same<typename boost::property_traits<VPM1>::value_type,
                                       typename boost::property_traits<VPM2>::value_type>::value));
 
   VPM1 vpm1 = choose_parameter(get_parameter(np1, internal_np::vertex_point),
@@ -694,7 +694,7 @@ corefine(      TriangleMesh& tm1,
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters1>::type VPM1;
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters2>::type VPM2;
 
-  CGAL_static_assertion((std::is_same<typename boost::property_traits<VPM1>::value_type,
+  static_assert((std::is_same<typename boost::property_traits<VPM1>::value_type,
                                       typename boost::property_traits<VPM2>::value_type>::value));
 
   VPM1 vpm1 = choose_parameter(get_parameter(np1, internal_np::vertex_point),
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
index 4237fa85b6f8..6d221c77bb9e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
@@ -155,7 +155,7 @@ double max_distance_to_mesh_impl(const PointRange& sample_points,
   using FT = typename Kernel::FT;
 
 #if !defined(CGAL_LINKED_WITH_TBB)
-  CGAL_static_assertion_msg (!(boost::is_convertible<Concurrency_tag, Parallel_tag>::value),
+  static_assert (!(boost::is_convertible<Concurrency_tag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #else
   if(boost::is_convertible<Concurrency_tag,Parallel_tag>::value)
@@ -1037,7 +1037,7 @@ sample_triangle_soup(const PointRange& points,
   typedef typename PointRange::value_type         Point_3;
   typedef typename Kernel_traits<Point_3>::Kernel GeomTraits;
 
-  CGAL_static_assertion_msg((std::is_same<Point_3, typename GeomTraits::Point_3>::value), "Wrong point type.");
+  static_assert((std::is_same<Point_3, typename GeomTraits::Point_3>::value), "Wrong point type.");
 
   CGAL_precondition(!triangles.empty());
 
@@ -1995,7 +1995,7 @@ bounded_error_squared_one_sided_Hausdorff_distance_impl(const TriangleMesh1& tm1
                                                         OutputIterator& out)
 {
 #if !defined(CGAL_LINKED_WITH_TBB) || !defined(CGAL_METIS_ENABLED)
-  CGAL_static_assertion_msg(!(boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
+  static_assert(!(boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
                             "Parallel_tag is enabled but at least TBB or METIS is unavailable.");
 #endif
 
@@ -2270,7 +2270,7 @@ bounded_error_squared_symmetric_Hausdorff_distance_impl(const TriangleMesh1& tm1
                                                         OutputIterator2& out2)
 {
 #if !defined(CGAL_LINKED_WITH_TBB) || !defined(CGAL_METIS_ENABLED)
-  CGAL_static_assertion_msg(!(boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
+  static_assert(!(boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
                             "Parallel_tag is enabled but at least TBB or METIS is unavailable.");
 #endif
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/fair.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/fair.h
index 28958df8ac08..60829f726230 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/fair.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/fair.h
@@ -151,11 +151,11 @@ bool fair(TriangleMesh& tmesh,
 #endif
 
 #if defined(CGAL_EIGEN3_ENABLED)
-    CGAL_static_assertion_msg(
+    static_assert(
       (!std::is_same<typename GetSolver<NamedParameters, Default_solver>::type, bool>::value) || EIGEN_VERSION_AT_LEAST(3, 2, 0),
       "The function `fair` requires Eigen3 version 3.2 or later.");
 #else
-    CGAL_static_assertion_msg(
+    static_assert(
       (!std::is_same<typename GetSolver<NamedParameters, Default_solver>::type, bool>::value),
       "The function `fair` requires Eigen3 version 3.2 or later.");
 #endif
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersect_triangle_and_segment_3.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersect_triangle_and_segment_3.h
index 47be440cd3aa..aaf34efd11d7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersect_triangle_and_segment_3.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersect_triangle_and_segment_3.h
@@ -98,7 +98,7 @@ intersection_type(
   typedef typename boost::property_traits<VertexPointMap1>::value_type Point_3;
   typedef typename Kernel_traits<Point_3>::Kernel Kernel;
 
-  CGAL_static_assertion((std::is_same<Point_3, typename boost::property_traits<VertexPointMap2>::value_type>::value));
+  static_assert((std::is_same<Point_3, typename boost::property_traits<VertexPointMap2>::value_type>::value));
 
   halfedge_descriptor h_2=halfedge(f_2,tm2);
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
index 64933af6b3b8..81f3ca6478db 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
@@ -49,7 +49,7 @@ class Intersection_nodes<TriangleMesh, VertexPointMap1, VertexPointMap2, false,
 private:
 //typedefs
   typedef typename boost::property_traits<VertexPointMap1>::value_type  Point_3;
-  CGAL_static_assertion((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
+  static_assert((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
                                       typename boost::property_traits<VertexPointMap2>::value_type>::value));
 
   typedef typename Kernel_traits<Point_3>::Kernel                  Input_kernel;
@@ -151,7 +151,7 @@ class Intersection_nodes<TriangleMesh, VertexPointMap1, VertexPointMap2, true, f
 
 private:
   typedef typename boost::property_traits<VertexPointMap1>::value_type  Point_3;
-  CGAL_static_assertion((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
+  static_assert((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
                                       typename boost::property_traits<VertexPointMap2>::value_type>::value));
 
   typedef typename Kernel_traits<Point_3>::Kernel                  Input_kernel;
@@ -328,7 +328,7 @@ class Intersection_nodes<TriangleMesh, VertexPointMap1, VertexPointMap2,
 {
 //typedefs
   typedef typename boost::property_traits<VertexPointMap1>::value_type  Point_3;
-  CGAL_static_assertion((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
+  static_assert((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
                                       typename boost::property_traits<VertexPointMap2>::value_type>::value));
 
   typedef typename Kernel_traits<Point_3>::Kernel                  Input_kernel;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
index 0e73d4be013c..7929697aec2a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
@@ -32,7 +32,7 @@ struct Intersect_coplanar_faces_3
  // typedefs
   typedef typename boost::property_traits<VertexPointMap1>::value_type Point;
 
-  CGAL_static_assertion((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
+  static_assert((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
                                       typename boost::property_traits<VertexPointMap2>::value_type>::value));
 
   typedef typename CGAL::Kernel_traits<Point>::Kernel Input_kernel;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap.h
index 62c1dc6d3e25..3effaee63d36 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap.h
@@ -925,7 +925,7 @@ std::size_t snap_non_conformal_one_way(const HalfedgeRange& halfedge_range_S,
 #endif
 
 #ifndef CGAL_LINKED_WITH_TBB
-  CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+  static_assert (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #else // CGAL_LINKED_WITH_TBB
   if(std::is_convertible<ConcurrencyTag, Parallel_tag>::value)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap_vertices.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap_vertices.h
index d821f88320b5..a9128a244df1 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap_vertices.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap_vertices.h
@@ -371,7 +371,7 @@ void find_vertex_vertex_matches_with_kd_tree(Unique_positions& unique_positions_
   tree.insert(unique_positions_Bv.begin(), unique_positions_Bv.end());
 
 #if !defined(CGAL_LINKED_WITH_TBB)
-  CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+  static_assert (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #else
   // parallel
@@ -596,7 +596,7 @@ void find_vertex_vertex_matches_with_box_d(const Unique_positions& unique_positi
     boxes_B_ptr.push_back(&b);
 
 #if !defined(CGAL_LINKED_WITH_TBB)
-  CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+  static_assert (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #else // CGAL_LINKED_WITH_TBB
   if(std::is_convertible<ConcurrencyTag, Parallel_tag>::value)
@@ -729,7 +729,7 @@ std::size_t snap_vertices_two_way(const HalfedgeRange_A& halfedge_range_A,
   using parameters::get_parameter;
   using parameters::get_parameter_reference;
 
-  CGAL_static_assertion((std::is_same<Point, typename GT::Point_3>::value));
+  static_assert((std::is_same<Point, typename GT::Point_3>::value));
 
   GT gt = choose_parameter<GT>(get_parameter(np_A, internal_np::geom_traits));
   VPM_A vpm_A = choose_parameter(get_parameter(np_A, internal_np::vertex_point),
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
index 7d1b1b6e6bfd..4f66b558cc7e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
@@ -425,7 +425,7 @@ compute_face_face_intersection(const FaceRange& face_range1,
                                         get_const_property_map(boost::vertex_point, tm1));
   VertexPointMap2 vpmap2 = choose_parameter(get_parameter(np2, internal_np::vertex_point),
                                         get_const_property_map(boost::vertex_point, tm2));
-  CGAL_static_assertion(
+  static_assert(
       (std::is_same<
        typename boost::property_traits<VertexPointMap1>::value_type,
        typename boost::property_traits<VertexPointMap2>::value_type
@@ -543,7 +543,7 @@ compute_face_polyline_intersection(const FaceRange& face_range,
   VertexPointMap vpmap = choose_parameter(get_parameter(np, internal_np::vertex_point),
                                           get_const_property_map(boost::vertex_point, tm));
   typedef typename boost::property_traits<VertexPointMap>::value_type Point;
-  CGAL_static_assertion(
+  static_assert(
         (std::is_same<Point,
         typename boost::range_value<Polyline>::type>::value));
 
@@ -681,7 +681,7 @@ compute_face_polylines_intersection(const FaceRange& face_range,
                                           get_const_property_map(boost::vertex_point, tm));
   typedef typename boost::property_traits<VertexPointMap>::value_type Point;
   typedef typename boost::range_value<PolylineRange>::type Polyline;
-  CGAL_static_assertion((std::is_same<Point, typename boost::range_value<Polyline>::type>::value));
+  static_assert((std::is_same<Point, typename boost::range_value<Polyline>::type>::value));
 
   std::vector<face_descriptor> faces;
   faces.reserve(std::distance( boost::begin(face_range), boost::end(face_range) ));
@@ -1742,7 +1742,7 @@ surface_intersection(const TriangleMesh& tm1,
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters1>::const_type VPM1;
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters2>::const_type VPM2;
 
-  CGAL_static_assertion((std::is_same<typename boost::property_traits<VPM1>::value_type,
+  static_assert((std::is_same<typename boost::property_traits<VPM1>::value_type,
                                       typename boost::property_traits<VPM2>::value_type>::value));
 
   VPM1 vpm1 = parameters::choose_parameter(parameters::get_parameter(np1, internal_np::vertex_point),
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
index 2d5d92374baa..04e5cc6a1441 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
@@ -1661,7 +1661,7 @@ locate_with_AABB_tree(const typename internal::Location_traits<TriangleMesh, Nam
   typedef typename CGAL::AABB_traits<Geom_traits, Primitive>                               AABB_traits;
 
   typedef typename Primitive::Point                                                        Point_3;
-  CGAL_static_assertion((std::is_same<Point_3, typename P_to_P3::Point_3>::value));
+  static_assert((std::is_same<Point_3, typename P_to_P3::Point_3>::value));
 
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters>::const_type            VertexPointMap;
   typedef internal::Point_to_Point_3_VPM<TriangleMesh, VertexPointMap>                     WrappedVPM;
@@ -1754,7 +1754,7 @@ locate(const typename internal::Location_traits<TriangleMesh, NamedParameters>::
   using parameters::get_parameter;
   using parameters::choose_parameter;
 
-  CGAL_static_assertion((std::is_same<Point_3, typename P_to_P3::Point_3>::value));
+  static_assert((std::is_same<Point_3, typename P_to_P3::Point_3>::value));
 
   const VertexPointMap vpm = parameters::choose_parameter(parameters::get_parameter(np, internal_np::vertex_point),
                                                           get_const_property_map(boost::vertex_point, tm));
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h
index ac5a340d8169..96af10bad1e2 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h
@@ -985,7 +985,7 @@ void match_faces(const PolygonMesh1& m1,
                                        get_const_property_map(vertex_point, m1));
   const VPMap2 vpm2 = choose_parameter(get_parameter(np2, internal_np::vertex_point),
                                        get_const_property_map(vertex_point, m2));
-  CGAL_static_assertion_msg((std::is_same<typename boost::property_traits<VPMap1>::value_type,
+  static_assert((std::is_same<typename boost::property_traits<VPMap1>::value_type,
                              typename boost::property_traits<VPMap2>::value_type>::value),
                             "Both vertex point maps must have the same point type.");
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h
index 612620049a0e..e395080f4a72 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h
@@ -159,7 +159,7 @@ void orient_triangle_soup_with_reference_triangle_soup(const ReferencePointRange
   typedef typename boost::property_traits<PointMap2>::reference PM2_Point_ref;
 
   typedef typename boost::property_traits<PointMap1>::value_type Point_3;
-  CGAL_static_assertion((std::is_same<Point_3, typename boost::property_traits<PointMap2>::value_type>::value));
+  static_assert((std::is_same<Point_3, typename boost::property_traits<PointMap2>::value_type>::value));
 
   typedef typename CGAL::Kernel_traits<Point_3>::Kernel K;
   typedef typename K::Triangle_3 Triangle;
@@ -215,7 +215,7 @@ void orient_triangle_soup_with_reference_triangle_soup(const ReferencePointRange
   };
 
 #if !defined(CGAL_LINKED_WITH_TBB)
-  CGAL_static_assertion_msg (!(std::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
+  static_assert (!(std::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #else
   if(std::is_convertible<Concurrency_tag,CGAL::Parallel_tag>::value)
@@ -309,7 +309,7 @@ void orient_triangle_soup_with_reference_triangle_mesh(const TriangleMesh& tm_re
 
   PointMap point_map = NP_helper::get_const_point_map(points, np2);
 
-  CGAL_static_assertion((std::is_same<Point_3, typename boost::property_traits<PointMap>::value_type>::value));
+  static_assert((std::is_same<Point_3, typename boost::property_traits<PointMap>::value_type>::value));
 
   K k = choose_parameter<K>(get_parameter(np1, internal_np::geom_traits));
 
@@ -352,7 +352,7 @@ void orient_triangle_soup_with_reference_triangle_mesh(const TriangleMesh& tm_re
   };
 
 #if !defined(CGAL_LINKED_WITH_TBB)
-  CGAL_static_assertion_msg (!(boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
+  static_assert (!(boost::is_convertible<Concurrency_tag, CGAL::Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #else
   if (boost::is_convertible<Concurrency_tag,CGAL::Parallel_tag>::value)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h
index d0b22f7b5ef3..f247b361f435 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h
@@ -39,7 +39,7 @@ struct PM_to_PS_point_converter
 {
   PS_Point operator()(const PM_Point& p) const
   {
-    CGAL_static_assertion((std::is_convertible<PM_Point, PS_Point>::value));
+    static_assert((std::is_convertible<PM_Point, PS_Point>::value));
     return PS_Point(p);
   }
 };
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
index bd543f5d390d..cc1d299702f5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
@@ -43,7 +43,7 @@ namespace internal {
 template <typename PM_Point, typename PS_Point>
 PM_Point convert_to_pm_point(const PS_Point& p)
 {
-  CGAL_static_assertion((std::is_convertible<PS_Point, PM_Point>::value));
+  static_assert((std::is_convertible<PS_Point, PM_Point>::value));
   return PM_Point(p);
 }
 
@@ -353,10 +353,10 @@ void polygon_soup_to_polygon_mesh(const PointRange& points,
     choose_parameter(get_parameter(np_ps, internal_np::polygon_to_face_output_iterator),
                      impl::make_functor(get_parameter(np_ps, internal_np::polygon_to_face_map))));
 
-  CGAL_static_assertion_msg(
+  static_assert(
       (parameters::is_default_parameter<NamedParameters_PS,internal_np::vertex_to_vertex_map_t>::value),
       "Named parameter vertex_to_vertex_map was renamed point_to_vertex_map");
-  CGAL_static_assertion_msg(
+  static_assert(
       (parameters::is_default_parameter<NamedParameters_PS,internal_np::face_to_face_map_t>::value),
       "Named parameter face_to_face_map was renamed polygon_to_face_map");
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_self_intersections.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_self_intersections.h
index 5a922c7cbffe..edfdb559bf55 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_self_intersections.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_self_intersections.h
@@ -178,7 +178,7 @@ FaceOutputIterator replace_faces_with_patch(const std::vector<typename boost::gr
                                             VertexPointMap vpm,
                                             FaceOutputIterator out)
 {
-  CGAL_static_assertion((std::is_same<typename boost::property_traits<VertexPointMap>::value_type, Point>::value));
+  static_assert((std::is_same<typename boost::property_traits<VertexPointMap>::value_type, Point>::value));
 
   typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor      vertex_descriptor;
   typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor    halfedge_descriptor;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/self_intersections.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/self_intersections.h
index 3524b46c7758..3d085dbb27f4 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/self_intersections.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/self_intersections.h
@@ -423,7 +423,7 @@ self_intersections_impl(const FaceRange& face_range,
   Throwing_filter throwing_filter(tmesh, vpmap, gt, Throwing_output_iterator());
 
 #if !defined(CGAL_LINKED_WITH_TBB)
-  CGAL_static_assertion_msg (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+  static_assert (!(std::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #else
   if(std::is_convertible<ConcurrencyTag, Parallel_tag>::value)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/smooth_shape.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/smooth_shape.h
index bd4e8ad8ab25..5fa0076b537e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/smooth_shape.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/smooth_shape.h
@@ -154,11 +154,11 @@ void smooth_shape(const FaceRange& faces,
 #endif
 
 #if defined(CGAL_EIGEN3_ENABLED)
-  CGAL_static_assertion_msg(
+  static_assert(
       (!std::is_same<typename GetSolver<NamedParameters, Default_solver>::type, bool>::value) || EIGEN_VERSION_AT_LEAST(3, 2, 0),
       "Eigen3 version 3.2 or later is required.");
 #else
-  CGAL_static_assertion_msg(
+  static_assert(
       (!std::is_same<typename GetSolver<NamedParameters, Default_solver>::type, bool>::value),
       "Eigen3 version 3.2 or later is required.");
 #endif
diff --git a/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h b/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h
index d6cbd4204789..3ed4b89f06ed 100644
--- a/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h
+++ b/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h
@@ -250,7 +250,7 @@ class Rigid_triangle_mesh_collision_detection
   {
     // handle vpm
     typedef typename CGAL::GetVertexPointMap<TriangleMesh, NamedParameters>::const_type Local_vpm;
-    CGAL_static_assertion( (std::is_same<Local_vpm,Vpm>::value) );
+    static_assert( (std::is_same<Local_vpm,Vpm>::value) );
 
     Vpm vpm =
       parameters::choose_parameter(parameters::get_parameter(np, internal_np::vertex_point),
@@ -562,7 +562,7 @@ class Rigid_triangle_mesh_collision_detection
         parameters::get_parameter(np, internal_np::apply_per_connected_component), true);
 
     typedef typename CGAL::GetVertexPointMap<TriangleMesh, NamedParameters>::const_type Local_vpm;
-    CGAL_static_assertion((std::is_same<Local_vpm,Vpm>::value));
+    static_assert((std::is_same<Local_vpm,Vpm>::value));
 
     Vpm vpm =
       parameters::choose_parameter(parameters::get_parameter(np, internal_np::vertex_point),
diff --git a/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h b/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
index 00bc1225b142..c12178a1b9cf 100644
--- a/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
+++ b/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
@@ -58,7 +58,7 @@ class Polyhedral_envelope_filter
   template <typename Profile>
   void initialize_envelope(const Profile& profile) const
   {
-    CGAL_static_assertion((std::is_same<GeomTraits, typename Profile::Geom_traits>::value));
+    static_assert((std::is_same<GeomTraits, typename Profile::Geom_traits>::value));
 
     typedef typename Profile::Triangle_mesh                                   Triangle_mesh;
     typedef typename boost::graph_traits<Triangle_mesh>::halfedge_descriptor  halfedge_descriptor;
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
index 2767dad9338f..8aeaab049db5 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
@@ -522,7 +522,7 @@ struct Locate_with_AABB_tree_Tester // 2D case
     typedef CGAL::AABB_face_graph_triangle_primitive<G, WrappedVPM>            AABB_face_graph_primitive;
     typedef CGAL::AABB_traits<K, AABB_face_graph_primitive>                    AABB_face_graph_traits;
 
-    CGAL_static_assertion((std::is_same<typename AABB_face_graph_traits::Point_3, Point_3>::value));
+    static_assert((std::is_same<typename AABB_face_graph_traits::Point_3, Point_3>::value));
 
     Intrinsic_point_to_Point_3 to_p3;
 
@@ -633,7 +633,7 @@ struct Locate_with_AABB_tree_Tester<K, VPM, 3> // 3D
     typedef CGAL::AABB_traits<K, AABB_face_graph_primitive>                    AABB_face_graph_traits;
 
     typedef typename K::Point_3                            Point_3;
-    CGAL_static_assertion((std::is_same<typename AABB_face_graph_traits::Point_3, Point_3>::value));
+    static_assert((std::is_same<typename AABB_face_graph_traits::Point_3, Point_3>::value));
 
     CGAL::AABB_tree<AABB_face_graph_traits> tree_a;
     Point_reference p3_a = get(vpm, v);
diff --git a/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h b/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
index 363ef73cfa27..c284f6e60b19 100644
--- a/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
+++ b/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
@@ -30,7 +30,7 @@ namespace CGAL {
   typename LCC::Dart_descriptor import_from_polyhedron_3(LCC& alcc,
                                                      const Polyhedron &apoly)
   {
-    CGAL_static_assertion( LCC::dimension>=2 && LCC::ambient_dimension==3 );
+    static_assert( LCC::dimension>=2 && LCC::ambient_dimension==3 );
 
     typedef typename Polyhedron::Halfedge_const_handle  Halfedge_handle;
     typedef typename Polyhedron::Facet_const_iterator   Facet_iterator;
diff --git a/Polynomial/include/CGAL/Exponent_vector.h b/Polynomial/include/CGAL/Exponent_vector.h
index 72c5e1d8f260..826a9417ffd6 100644
--- a/Polynomial/include/CGAL/Exponent_vector.h
+++ b/Polynomial/include/CGAL/Exponent_vector.h
@@ -59,7 +59,7 @@ class Exponent_vector :
     :v(begin,end){
     typedef typename std::iterator_traits<InputIterator>::value_type value_type;
     CGAL_USE_TYPE(value_type);
-    CGAL_static_assertion(( ::std::is_same<value_type, int>::value));
+    static_assert(( ::std::is_same<value_type, int>::value));
   }
 
 
diff --git a/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h b/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
index b5576f5489c3..d75f6f291d55 100644
--- a/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
+++ b/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
@@ -273,7 +273,7 @@ class Polynomial_algebraic_structure_traits_base< POLY, Field_tag >
         template < class NT1, class NT2 >
         void operator()( const NT1& x, const NT2& y,
                          POLY& q, POLY& r ) const {
-          CGAL_static_assertion((::std::is_same<
+          static_assert((::std::is_same<
                   typename Coercion_traits< NT1, NT2 >::Type, POLY
                                                >::value));
 
diff --git a/Polynomial/include/CGAL/Polynomial/Polynomial_type.h b/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
index f1055bedbd0e..9c2c27b6fc75 100644
--- a/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
+++ b/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
@@ -545,7 +545,7 @@ class Polynomial
      *  Also available as non-member function.
      */
     CGAL::Sign sign() const {
-//        CGAL_static_assertion( (std::is_same< typename Real_embeddable_traits<NT>::Is_real_embeddable,
+//        static_assert( (std::is_same< typename Real_embeddable_traits<NT>::Is_real_embeddable,
 //                              CGAL::Tag_true>::value) );
       return CGAL::sign(lcoeff());
     }
diff --git a/Polynomial/include/CGAL/Polynomial/subresultants.h b/Polynomial/include/CGAL/Polynomial/subresultants.h
index 4ea568bf2128..e6f4eb40fcd2 100644
--- a/Polynomial/include/CGAL/Polynomial/subresultants.h
+++ b/Polynomial/include/CGAL/Polynomial/subresultants.h
@@ -775,7 +775,7 @@ namespace CGAL {
        CGAL::Integral_domain_without_division_tag) {
         // polynomial_subresultants_with_cofactors requires
         // a model of IntegralDomain as coefficient type;
-        CGAL_static_assertion(sizeof(Polynomial_traits_d)==0);
+        static_assert(sizeof(Polynomial_traits_d)==0);
         return sres_out;
     }
 
diff --git a/Polynomial/include/CGAL/Polynomial_traits_d.h b/Polynomial/include/CGAL/Polynomial_traits_d.h
index 8172dd123955..1a377fc5c179 100644
--- a/Polynomial/include/CGAL/Polynomial_traits_d.h
+++ b/Polynomial/include/CGAL/Polynomial_traits_d.h
@@ -566,7 +566,7 @@ class Polynomial_traits_d_base< Polynomial< Coefficient_type_ >,
     template <class Input_iterator, class NT> Polynomial_d
     construct_value_type(Input_iterator begin, Input_iterator end, NT) const {
       typedef CGAL::Coercion_traits<NT,Coefficient_type> CT;
-      CGAL_static_assertion((std::is_same<typename CT::Type,Coefficient_type>::value));
+      static_assert((std::is_same<typename CT::Type,Coefficient_type>::value));
       typename CT::Cast cast;
       return Polynomial_d(
           boost::make_transform_iterator(begin,cast),
@@ -667,7 +667,7 @@ class Polynomial_traits_d_base< Polynomial< Coefficient_type_ >,
         typedef Polynomial_traits_d<Coefficient_type> PT;
         typename PT::Construct_polynomial construct;
 
-        CGAL_static_assertion(PT::d != 0); // Coefficient_type is a Polynomial
+        static_assert(PT::d != 0); // Coefficient_type is a Polynomial
         std::vector<Coefficient_type> coefficients;
 
         Coefficient_type zero(0);
diff --git a/Polynomial/include/CGAL/Test/_test_polynomial_traits_d.h b/Polynomial/include/CGAL/Test/_test_polynomial_traits_d.h
index c9097031598b..7547bd302815 100644
--- a/Polynomial/include/CGAL/Test/_test_polynomial_traits_d.h
+++ b/Polynomial/include/CGAL/Test/_test_polynomial_traits_d.h
@@ -50,7 +50,7 @@ static CGAL::Random my_rnd(346); // some seed
 
 
 #define ASSERT_IS_NULL_FUNCTOR(T)                                       \
-  CGAL_static_assertion((std::is_same<T,CGAL::Null_functor >::value))
+  static_assert((std::is_same<T,CGAL::Null_functor >::value))
 
 
 
@@ -178,10 +178,10 @@ void test_construct_polynomial(const Polynomial_traits_d&){
   }
   { // Construct_polynomial
     typedef typename PT::Construct_polynomial Constructor;
-    CGAL_static_assertion(
+    static_assert(
         !(std::is_same< Constructor , CGAL::Null_functor >::value));
     typedef typename Constructor::result_type result_type;
-    CGAL_static_assertion(
+    static_assert(
         (std::is_same< result_type , Polynomial_d >::value));
     CGAL_USE_TYPE(result_type);
     typedef typename PT::Shift Shift;
@@ -1802,23 +1802,23 @@ void test_rebind(const PT& /*traits*/){
 {
   typedef typename PT:: template Rebind<IC,1>::Other PT_IC_1;
   CGAL_USE_TYPE(PT_IC_1);
-  CGAL_static_assertion((std::is_same< typename PT_IC_1::Innermost_coefficient_type,
+  static_assert((std::is_same< typename PT_IC_1::Innermost_coefficient_type,
             IC>::value));
-  CGAL_static_assertion((PT_IC_1::d==1));
+  static_assert((PT_IC_1::d==1));
 }
 {
   typedef typename PT:: template Rebind<IC,2>::Other PT_IC_2;
   CGAL_USE_TYPE(PT_IC_2);
-  CGAL_static_assertion((std::is_same< typename PT_IC_2::Innermost_coefficient_type,
+  static_assert((std::is_same< typename PT_IC_2::Innermost_coefficient_type,
             IC>::value));
-  CGAL_static_assertion((PT_IC_2::d==2));
+  static_assert((PT_IC_2::d==2));
 }
 {
   typedef typename PT:: template Rebind<IC,3>::Other PT_IC_3;
   CGAL_USE_TYPE(PT_IC_3);
-  CGAL_static_assertion((std::is_same< typename PT_IC_3::Innermost_coefficient_type,
+  static_assert((std::is_same< typename PT_IC_3::Innermost_coefficient_type,
           IC>::value));
-  CGAL_static_assertion((PT_IC_3::d==3));
+  static_assert((PT_IC_3::d==3));
 }
 {
   typedef typename PT:: template Rebind<IC,1>::Other PT_IC_1;
@@ -1831,11 +1831,11 @@ void test_rebind(const PT& /*traits*/){
   typedef typename  PT_IC_1::Polynomial_d Poly1;
   typedef typename  PT_IC_2::Polynomial_d Poly2;
 
-  CGAL_static_assertion((std::is_same< typename PT_IC_1::Coefficient_type,
+  static_assert((std::is_same< typename PT_IC_1::Coefficient_type,
           IC>::value));
-  CGAL_static_assertion((std::is_same< typename PT_IC_2::Coefficient_type,
+  static_assert((std::is_same< typename PT_IC_2::Coefficient_type,
           Poly1>::value));
-  CGAL_static_assertion((std::is_same< typename PT_IC_3::Coefficient_type,
+  static_assert((std::is_same< typename PT_IC_3::Coefficient_type,
           Poly2>::value));
 
 }
@@ -1850,12 +1850,12 @@ void test_rebind(const PT& /*traits*/){
   CGAL_USE_TYPE(PT_Integer_4);
   typedef typename PT:: template Rebind<Rational,4>::Other PT_Rational_4;
   CGAL_USE_TYPE(PT_Rational_4);
-  CGAL_static_assertion((std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
+  static_assert((std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
           Integer>::value));
-  CGAL_static_assertion((std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
+  static_assert((std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
           Rational>::value));
-  CGAL_static_assertion((PT_Integer_4::d==dimension));
-  CGAL_static_assertion((PT_Rational_4::d==dimension));
+  static_assert((PT_Integer_4::d==dimension));
+  static_assert((PT_Rational_4::d==dimension));
 }
 #endif
 #ifdef CGAL_USE_CORE
@@ -1867,12 +1867,12 @@ void test_rebind(const PT& /*traits*/){
   typedef typename PT:: template Rebind<Rational,4>::Other PT_Rational_4;
   CGAL_USE_TYPE(PT_Integer_4);
   CGAL_USE_TYPE(PT_Rational_4);
-  CGAL_static_assertion((std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
+  static_assert((std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
           Integer>::value));
-  CGAL_static_assertion((std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
+  static_assert((std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
           Rational>::value));
-  CGAL_static_assertion((PT_Integer_4::d==4));
-  CGAL_static_assertion((PT_Rational_4::d==4));
+  static_assert((PT_Integer_4::d==4));
+  static_assert((PT_Rational_4::d==4));
 }
 #endif
 {
@@ -1880,12 +1880,12 @@ void test_rebind(const PT& /*traits*/){
   typedef typename PT:: template Rebind<double,4>::Other PT_Rational_4;
   CGAL_USE_TYPE(PT_Integer_4);
   CGAL_USE_TYPE(PT_Rational_4);
-  CGAL_static_assertion((std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
+  static_assert((std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
           int>::value));
-  CGAL_static_assertion((std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
+  static_assert((std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
           double>::value));
-  CGAL_static_assertion((PT_Integer_4::d==4));
-  CGAL_static_assertion((PT_Rational_4::d==4));
+  static_assert((PT_Integer_4::d==4));
+  static_assert((PT_Rational_4::d==4));
 }
 }
 
diff --git a/Polynomial/test/Polynomial/Polynomial_type_generator.cpp b/Polynomial/test/Polynomial/Polynomial_type_generator.cpp
index d2b0c9315128..56e11a393579 100644
--- a/Polynomial/test/Polynomial/Polynomial_type_generator.cpp
+++ b/Polynomial/test/Polynomial/Polynomial_type_generator.cpp
@@ -12,14 +12,14 @@ int main(){
 
   {
     typedef CGAL::Polynomial_type_generator<int,1>::Type Polynomial;
-    CGAL_static_assertion((::std::is_same<Polynomial, Poly_int_1>::value));
+    static_assert((::std::is_same<Polynomial, Poly_int_1>::value));
   }
   {
     typedef CGAL::Polynomial_type_generator<int,2>::Type Polynomial;
-    CGAL_static_assertion((::std::is_same<Polynomial, Poly_int_2>::value));
+    static_assert((::std::is_same<Polynomial, Poly_int_2>::value));
   }
   {
     typedef CGAL::Polynomial_type_generator<int,3>::Type Polynomial;
-    CGAL_static_assertion((::std::is_same<Polynomial, Poly_int_3>::value));
+    static_assert((::std::is_same<Polynomial, Poly_int_3>::value));
   }
 }
diff --git a/Polynomial/test/Polynomial/test_polynomial.h b/Polynomial/test/Polynomial/test_polynomial.h
index 5637578e945b..7cd7a2e17c2d 100644
--- a/Polynomial/test/Polynomial/test_polynomial.h
+++ b/Polynomial/test/Polynomial/test_polynomial.h
@@ -34,7 +34,7 @@ inline
 void convert_to(const NT& x, RT& r){
     typedef CGAL::Coercion_traits<NT,RT> CT;
     typedef typename CT::Coercion_type RET;
-    CGAL_static_assertion((::std::is_same<RET,RT>::value));
+    static_assert((::std::is_same<RET,RT>::value));
     r = typename CT::Cast()(x);
 }
 } //namespace CGAL
@@ -887,7 +887,7 @@ void test_scalar_factor_traits(){
         typedef CGAL::Scalar_factor_traits<Polynomial> SFT;
         typedef typename AT::Integer Scalar;
         typedef typename SFT::Scalar Scalar_;
-        CGAL_static_assertion((::std::is_same<Scalar_, Scalar>::value));
+        static_assert((::std::is_same<Scalar_, Scalar>::value));
 
         typename SFT::Scalar_factor sfac;
 
@@ -913,7 +913,7 @@ void test_scalar_factor_traits(){
         typedef CGAL::Scalar_factor_traits<Poly_2_ext_1> SFT;
         typedef typename AT::Integer Scalar;
         typedef typename SFT::Scalar Scalar_;
-        CGAL_static_assertion((::std::is_same<Scalar_, Scalar>::value));
+        static_assert((::std::is_same<Scalar_, Scalar>::value));
 
         typename SFT::Scalar_factor sfac;
 
diff --git a/Polynomial/test/Polynomial/test_polynomial_Coercion_traits.cpp b/Polynomial/test/Polynomial/test_polynomial_Coercion_traits.cpp
index 5760a12eda07..d2ad9d2019cb 100644
--- a/Polynomial/test/Polynomial/test_polynomial_Coercion_traits.cpp
+++ b/Polynomial/test/Polynomial/test_polynomial_Coercion_traits.cpp
@@ -147,7 +147,7 @@ void test_coercion_traits(){
   /*
     {
     typedef CGAL::Coercion_traits<POLY_RAT_1,CGAL::Null_functor> CT;
-    CGAL_static_assertion((
+    static_assert((
     ::std::is_same< typename CT::Are_implicit_interoperable,
     CGAL::Tag_false>::value));
     }
diff --git a/Polynomial/test/Polynomial/test_polynomial_Get_arithmetic_kernel.cpp b/Polynomial/test/Polynomial/test_polynomial_Get_arithmetic_kernel.cpp
index 7107ed8f04e4..f52f33ae5846 100644
--- a/Polynomial/test/Polynomial/test_polynomial_Get_arithmetic_kernel.cpp
+++ b/Polynomial/test/Polynomial/test_polynomial_Get_arithmetic_kernel.cpp
@@ -7,11 +7,11 @@ void test_get_arithmetic_kernel(){
   {
     typedef CGAL::Polynomial<Integer> POLY;
     typedef typename CGAL::Get_arithmetic_kernel<POLY>::Arithmetic_kernel AK_;
-    CGAL_static_assertion((std::is_same<AK,AK_>::value));
+    static_assert((std::is_same<AK,AK_>::value));
   }{
     typedef CGAL::Polynomial<CGAL::Polynomial<Integer> > POLY;
     typedef typename CGAL::Get_arithmetic_kernel<POLY>::Arithmetic_kernel AK_;
-    CGAL_static_assertion((std::is_same<AK,AK_>::value));
+    static_assert((std::is_same<AK,AK_>::value));
   }
 }
 
diff --git a/Ridges_3/include/CGAL/Ridges.h b/Ridges_3/include/CGAL/Ridges.h
index e09c6eaf5710..47fd6019ebd2 100644
--- a/Ridges_3/include/CGAL/Ridges.h
+++ b/Ridges_3/include/CGAL/Ridges.h
@@ -190,10 +190,10 @@ class Ridge_approximation
 
 
   //requirements for the templates TriangleMesh and VertexFTMap or VertexVectorMap
-  CGAL_static_assertion((std::is_same<vertex_descriptor, typename VertexFTMap::key_type>::value));
-  CGAL_static_assertion((std::is_same<vertex_descriptor, typename VertexVectorMap::key_type>::value));
-  CGAL_static_assertion((std::is_same<FT, typename VertexFTMap::value_type>::value));
-  CGAL_static_assertion((std::is_same<Vector_3, typename VertexVectorMap::value_type>::value));
+  static_assert((std::is_same<vertex_descriptor, typename VertexFTMap::key_type>::value));
+  static_assert((std::is_same<vertex_descriptor, typename VertexVectorMap::key_type>::value));
+  static_assert((std::is_same<FT, typename VertexFTMap::value_type>::value));
+  static_assert((std::is_same<Vector_3, typename VertexVectorMap::value_type>::value));
 
   typedef std::pair< halfedge_descriptor, FT>    Ridge_halfedge;
   typedef Ridge_halfedge Ridge_halfhedge; // kept for backward compatibility
diff --git a/Ridges_3/include/CGAL/Umbilics.h b/Ridges_3/include/CGAL/Umbilics.h
index 945fb986ae72..424708b2897b 100644
--- a/Ridges_3/include/CGAL/Umbilics.h
+++ b/Ridges_3/include/CGAL/Umbilics.h
@@ -110,10 +110,10 @@ class Umbilic_approximation
   typedef typename boost::graph_traits<TriangleMesh>::vertex_iterator  Vertex_const_iterator;
 
   //requirements for the templates TriangleMesh and VertexFTMap or VertexVectorMap
-  CGAL_static_assertion((std::is_same<vertex_descriptor, typename VertexFTMap::key_type>::value));
-  CGAL_static_assertion((std::is_same<vertex_descriptor, typename VertexVectorMap::key_type>::value));
-  CGAL_static_assertion((std::is_same<FT, typename VertexFTMap::value_type>::value));
-  CGAL_static_assertion((std::is_same<Vector_3, typename VertexVectorMap::value_type>::value));
+  static_assert((std::is_same<vertex_descriptor, typename VertexFTMap::key_type>::value));
+  static_assert((std::is_same<vertex_descriptor, typename VertexVectorMap::key_type>::value));
+  static_assert((std::is_same<FT, typename VertexFTMap::value_type>::value));
+  static_assert((std::is_same<Vector_3, typename VertexVectorMap::value_type>::value));
 
   typedef CGAL::Umbilic<TriangleMesh> Umbilic;
 
diff --git a/STL_Extension/include/CGAL/Handle_with_policy.h b/STL_Extension/include/CGAL/Handle_with_policy.h
index 004c8b4d96fe..978fa9ec1c36 100644
--- a/STL_Extension/include/CGAL/Handle_with_policy.h
+++ b/STL_Extension/include/CGAL/Handle_with_policy.h
@@ -355,7 +355,7 @@ namespace Intern {
             typedef ::CGAL::Reference_counted_hierarchy_with_union<Alloc>
                 Reference_counted_hierarchy_with_union;
             CGAL_USE_TYPE(Reference_counted_hierarchy_with_union);
-            CGAL_static_assertion((
+            static_assert((
               ::CGAL::is_same_or_derived< Reference_counted_hierarchy_with_union, T >::value ));
         }
         typedef T Rep;
@@ -760,7 +760,7 @@ class Handle_with_policy {
     static Rep_allocator allocator;
 
     static Rep* new_rep( const Rep& rep) {
-        CGAL_static_assertion( !(
+        static_assert( !(
            ::CGAL::is_same_or_derived< Reference_counted_hierarchy_base, Handled_type >::value ));
         Rep* p = allocator.allocate(1);
         std::allocator_traits<Rep_allocator>::construct(allocator, p, rep);
@@ -855,7 +855,7 @@ class Handle_with_policy {
     //! argument, and the single argument template constructor no other
     //! constructor will work for class hierarchies of representations.
     Handle_with_policy( Rep* p) : ptr_( p) {
-        CGAL_static_assertion((
+        static_assert((
            ::CGAL::is_same_or_derived< Reference_counted_hierarchy_base, Handled_type >::value ));
         //Bind bind_; // trigger compile-time check
         //(void)bind_;
@@ -869,7 +869,7 @@ class Handle_with_policy {
     //! version of \c initialize_with is applicable in this case except
     //! the template version with one argument.
     void initialize_with( Rep* p) {
-        CGAL_static_assertion((
+        static_assert((
            ::CGAL::is_same_or_derived< Reference_counted_hierarchy_base, Handled_type >::value ));
         //Bind bind_; // trigger compile-time check
         //(void)bind_;
diff --git a/STL_Extension/include/CGAL/Named_function_parameters.h b/STL_Extension/include/CGAL/Named_function_parameters.h
index e48768eaffb4..4d37486ea4fa 100644
--- a/STL_Extension/include/CGAL/Named_function_parameters.h
+++ b/STL_Extension/include/CGAL/Named_function_parameters.h
@@ -179,7 +179,7 @@ typename Get_param<Named_params_impl<T, Tag, Base>, Query_tag>::type
 get_parameter_impl(const Named_params_impl<T, Tag, Base>& np, Query_tag tag)
 {
 #ifndef CGAL_NO_STATIC_ASSERTION_TEST
-  CGAL_static_assertion( (!std::is_same<Query_tag, Tag>::value) );
+  static_assert( (!std::is_same<Query_tag, Tag>::value) );
 #endif
   return get_parameter_impl(static_cast<const typename Base::base&>(np), tag);
 }
@@ -240,7 +240,7 @@ template <typename T, typename Tag, typename Base, typename Query_tag>
 typename Get_param<Named_params_impl<T, Tag, Base>, Query_tag>::reference
 get_parameter_reference_impl(const Named_params_impl<T, Tag, Base>& np, Query_tag tag)
 {
-  CGAL_static_assertion( (!std::is_same<Query_tag, Tag>::value) );
+  static_assert( (!std::is_same<Query_tag, Tag>::value) );
   return get_parameter_reference_impl(static_cast<const typename Base::base&>(np), tag);
 }
 
@@ -532,7 +532,7 @@ namespace boost
   template <typename T, typename Tag, typename Base, typename Tag2, bool B = false>
   void get_param(CGAL::Named_function_parameters<T,Tag,Base>, Tag2)
   {
-    CGAL_static_assertion(B && "You must use CGAL::parameters::get_parameter instead of boost::get_param");
+    static_assert(B && "You must use CGAL::parameters::get_parameter instead of boost::get_param");
   }
 }
 #endif
diff --git a/STL_Extension/include/CGAL/assertions.h b/STL_Extension/include/CGAL/assertions.h
index b64d63a92aa4..6db6e93e3575 100644
--- a/STL_Extension/include/CGAL/assertions.h
+++ b/STL_Extension/include/CGAL/assertions.h
@@ -137,12 +137,6 @@ inline bool possibly(Uncertain<bool> c);
 #    define CGAL_unreachable()  CGAL_assertion(false)
 #  endif // CGAL_UNREACHABLE
 
-# define CGAL_static_assertion(EX) \
-     static_assert(EX, #EX)
-
-# define CGAL_static_assertion_msg(EX,MSG) \
-     static_assert(EX, MSG)
-
 #if defined(CGAL_NO_ASSERTIONS) || !defined(CGAL_CHECK_EXACTNESS)
 #  define CGAL_exactness_assertion(EX) (static_cast<void>(0))
 #  define CGAL_exactness_assertion_msg(EX,MSG) (static_cast<void>(0))
diff --git a/STL_Extension/include/CGAL/for_each.h b/STL_Extension/include/CGAL/for_each.h
index f68bba0e80b9..69a3e7dcdfe9 100644
--- a/STL_Extension/include/CGAL/for_each.h
+++ b/STL_Extension/include/CGAL/for_each.h
@@ -102,7 +102,7 @@ void for_each (const Range& range,
                                         <typename Range::const_iterator>::reference)>& functor)
 {
 #ifndef CGAL_LINKED_WITH_TBB
-  CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+  static_assert (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #endif
 
@@ -118,7 +118,7 @@ void for_each (Range& range,
                                         <typename Range::iterator>::reference)>& functor)
 {
 #ifndef CGAL_LINKED_WITH_TBB
-  CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+  static_assert (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                              "Parallel_tag is enabled but TBB is unavailable.");
 #endif
 
diff --git a/STL_Extension/include/CGAL/iterator.h b/STL_Extension/include/CGAL/iterator.h
index ea9a964c8a38..956cc88a8c20 100644
--- a/STL_Extension/include/CGAL/iterator.h
+++ b/STL_Extension/include/CGAL/iterator.h
@@ -1340,7 +1340,7 @@ class Dispatch_output_iterator < std::tuple<V...>, std::tuple<O...> >
  : private internal::Derivator<Dispatch_output_iterator< std::tuple<V...>, std::tuple<O...> >, std::tuple<V...>, std::tuple<O...> >
  , public std::tuple<O...>
 {
-  CGAL_static_assertion_msg(sizeof...(V) == sizeof...(O),
+  static_assert(sizeof...(V) == sizeof...(O),
                 "The number of explicit template parameters has to match the number of arguments");
 
   static const int size = sizeof...(V);
diff --git a/STL_Extension/include/CGAL/transforming_pair_iterator.h b/STL_Extension/include/CGAL/transforming_pair_iterator.h
index 4e59bb9282a7..abc52a584e3b 100644
--- a/STL_Extension/include/CGAL/transforming_pair_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_pair_iterator.h
@@ -25,7 +25,7 @@ namespace CGAL {
 namespace internal {
 template <class Cat1, class Cat2, bool=boost::is_convertible<Cat1,Cat2>::value>
 struct Min_category {
-        CGAL_static_assertion((boost::is_convertible<Cat2,Cat1>::value));
+        static_assert((boost::is_convertible<Cat2,Cat1>::value));
         typedef Cat1 type;
 };
 
diff --git a/STL_Extension/test/STL_Extension/test_Cache.cpp b/STL_Extension/test/STL_Extension/test_Cache.cpp
index a5c9de6e5a30..609eb6ab8299 100644
--- a/STL_Extension/test/STL_Extension/test_Cache.cpp
+++ b/STL_Extension/test/STL_Extension/test_Cache.cpp
@@ -57,16 +57,16 @@ struct Int_t : public CGAL::Handle_with_policy< Int_rep, Unify > {
 void test_typedefs(){
     typedef CGAL::Cache<int,double> Cache;
     CGAL_USE_TYPE(Cache);
-    CGAL_static_assertion(( ::std::is_same< Cache::Input, int >::value ));
-    CGAL_static_assertion(( ::std::is_same< Cache::Output,double>::value ));
+    static_assert(( ::std::is_same< Cache::Input, int >::value ));
+    static_assert(( ::std::is_same< Cache::Output,double>::value ));
     typedef CGAL::Creator_1<int,double> Creator_double;
     CGAL_USE_TYPE(Creator_double);
-    CGAL_static_assertion(( ::std::is_same<Cache::Creator,Creator_double>::value ));
+    static_assert(( ::std::is_same<Cache::Creator,Creator_double>::value ));
     typedef CGAL::Creator_1<int,int> Creator_int;
     CGAL_USE_TYPE(Creator_int);
-    CGAL_static_assertion(( ::std::is_same<Cache::Canonicalizer,Creator_int>::value ));
-    CGAL_static_assertion(( ::std::is_same<Cache::Compare,std::less<int> >::value ));
-    CGAL_static_assertion(( ::std::is_same<Cache::Self,CGAL::Cache<int,double> >::value ));
+    static_assert(( ::std::is_same<Cache::Canonicalizer,Creator_int>::value ));
+    static_assert(( ::std::is_same<Cache::Compare,std::less<int> >::value ));
+    static_assert(( ::std::is_same<Cache::Self,CGAL::Cache<int,double> >::value ));
 }
 int main(){
     {
diff --git a/STL_Extension/test/STL_Extension/test_Compact_container.cpp b/STL_Extension/test/STL_Extension/test_Compact_container.cpp
index d2d96cdfc4b3..566e15dddc24 100644
--- a/STL_Extension/test/STL_Extension/test_Compact_container.cpp
+++ b/STL_Extension/test/STL_Extension/test_Compact_container.cpp
@@ -346,7 +346,7 @@ int main()
   }
 
   // Check that Compact_container does not require a complete type.
-  CGAL_static_assertion(sizeof(CGAL::Compact_container<Incomplete_struct>) > 0);
+  static_assert(sizeof(CGAL::Compact_container<Incomplete_struct>) > 0);
 
   // Test increment policy
   CGAL::Compact_container<Node_2, CGAL::Default, CGAL::Constant_size_policy<1024> > C5;
diff --git a/STL_Extension/test/STL_Extension/test_cgal_named_params.cpp b/STL_Extension/test/STL_Extension/test_cgal_named_params.cpp
index 2ae445fbfd59..1f474eebabb1 100644
--- a/STL_Extension/test/STL_Extension/test_cgal_named_params.cpp
+++ b/STL_Extension/test/STL_Extension/test_cgal_named_params.cpp
@@ -24,7 +24,7 @@ template <int i, class T>
 void check_same_type(T)
 {
   static const bool b = std::is_same< A<i>, T >::value;
-  CGAL_static_assertion(b);
+  static_assert(b);
   assert(b);
 }
 
@@ -46,7 +46,7 @@ template<class NamedParameters>
 void test_no_copyable(const NamedParameters& np)
 {
   typedef typename inp::Get_param<typename NamedParameters::base,inp::visitor_t>::type NP_type;
-  CGAL_static_assertion( (std::is_same<NP_type,std::reference_wrapper<const B> >::value) );
+  static_assert( (std::is_same<NP_type,std::reference_wrapper<const B> >::value) );
 
   const A<4>& a  = params::choose_parameter(params::get_parameter_reference(np, inp::edge_index), A<4>(4));
   assert(a.v==4);
@@ -60,31 +60,31 @@ void test_references(const NamedParameters& np)
 
   // std::reference_wrapper
   typedef typename inp::Lookup_named_param_def<inp::visitor_t, NamedParameters, Default_type>::reference Visitor_reference_type;
-  CGAL_static_assertion( (std::is_same<B&, Visitor_reference_type>::value) );
+  static_assert( (std::is_same<B&, Visitor_reference_type>::value) );
   Visitor_reference_type vis_ref = params::choose_parameter(params::get_parameter_reference(np, inp::visitor), default_value);
   CGAL_USE(vis_ref);
 
   // std::reference_wrapper of const
   typedef typename inp::Lookup_named_param_def<inp::face_index_t, NamedParameters, Default_type>::reference FIM_reference_type;
-  CGAL_static_assertion( (std::is_same<const B&, FIM_reference_type>::value) );
+  static_assert( (std::is_same<const B&, FIM_reference_type>::value) );
   FIM_reference_type fim_ref = params::choose_parameter(params::get_parameter_reference(np, inp::face_index), default_value);
   CGAL_USE(fim_ref);
 
   // non-copyable
   typedef typename inp::Lookup_named_param_def<inp::vertex_point_t, NamedParameters, Default_type>::reference VPM_reference_type;
-  CGAL_static_assertion( (std::is_same<const B&, VPM_reference_type>::value) );
+  static_assert( (std::is_same<const B&, VPM_reference_type>::value) );
   VPM_reference_type vpm_ref = params::choose_parameter(params::get_parameter_reference(np, inp::vertex_point), default_value);
   CGAL_USE(vpm_ref);
 
   // passed by copy
   typedef typename inp::Lookup_named_param_def<inp::vertex_index_t, NamedParameters, Default_type>::reference VIM_reference_type;
-  CGAL_static_assertion( (std::is_same<A<0>, VIM_reference_type>::value) );
+  static_assert( (std::is_same<A<0>, VIM_reference_type>::value) );
   VIM_reference_type vim_ref = params::choose_parameter(params::get_parameter_reference(np, inp::vertex_index), default_value);
   CGAL_USE(vim_ref);
 
   // default
   typedef typename inp::Lookup_named_param_def<inp::edge_index_t, NamedParameters, Default_type>::reference EIM_reference_type;
-  CGAL_static_assertion(( std::is_same<Default_type&, EIM_reference_type>::value) );
+  static_assert(( std::is_same<Default_type&, EIM_reference_type>::value) );
   EIM_reference_type eim_ref = params::choose_parameter(params::get_parameter_reference(np, inp::edge_index), default_value);
   assert(&eim_ref==&default_value);
 }
@@ -103,12 +103,12 @@ int main()
   );
 
   auto d = CGAL::parameters::default_values();
-  CGAL_static_assertion( (std::is_same<decltype(d),CGAL::parameters::Default_named_parameters>::value) );
+  static_assert( (std::is_same<decltype(d),CGAL::parameters::Default_named_parameters>::value) );
 #ifndef CGAL_NO_DEPRECATED_CODE
   auto d1 = CGAL::parameters::all_default();
-  CGAL_static_assertion( (std::is_same<decltype(d1),CGAL::parameters::Default_named_parameters>::value) );
+  static_assert( (std::is_same<decltype(d1),CGAL::parameters::Default_named_parameters>::value) );
   auto d2 = CGAL::Polygon_mesh_processing::parameters::all_default();
-  CGAL_static_assertion( (std::is_same<decltype(d2),CGAL::parameters::Default_named_parameters>::value) );
+  static_assert( (std::is_same<decltype(d2),CGAL::parameters::Default_named_parameters>::value) );
 #endif
 
   return EXIT_SUCCESS;
diff --git a/STL_Extension/test/STL_Extension/test_is_iterator.cpp b/STL_Extension/test/STL_Extension/test_is_iterator.cpp
index 7305fe62da05..d1c3b157aaaa 100644
--- a/STL_Extension/test/STL_Extension/test_is_iterator.cpp
+++ b/STL_Extension/test/STL_Extension/test_is_iterator.cpp
@@ -17,17 +17,17 @@ int main() {
   CGAL_USE_TYPE(vector_it);
   CGAL_USE_TYPE(list_it);
   CGAL_USE_TYPE(int_p);
-  CGAL_static_assertion(is_iterator<vector_it>::value);
-  CGAL_static_assertion(is_iterator<list_it>::value);
-  CGAL_static_assertion(!is_iterator<void>::value);
-  CGAL_static_assertion(!is_iterator<int>::value);
-  CGAL_static_assertion(is_iterator<int_p>::value);
+  static_assert(is_iterator<vector_it>::value);
+  static_assert(is_iterator<list_it>::value);
+  static_assert(!is_iterator<void>::value);
+  static_assert(!is_iterator<int>::value);
+  static_assert(is_iterator<int_p>::value);
 
-  CGAL_static_assertion((is_iterator_type<vector_it,std::bidirectional_iterator_tag>::value));
-  CGAL_static_assertion((!is_iterator_type<list_it,std::random_access_iterator_tag>::value));
-  CGAL_static_assertion((!is_iterator_type<short,std::output_iterator_tag>::value));
+  static_assert((is_iterator_type<vector_it,std::bidirectional_iterator_tag>::value));
+  static_assert((!is_iterator_type<list_it,std::random_access_iterator_tag>::value));
+  static_assert((!is_iterator_type<short,std::output_iterator_tag>::value));
 
-  CGAL_static_assertion((is_iterator_to<int_p,double>::value));
-  CGAL_static_assertion((!is_iterator_to<A,int>::value));
-  CGAL_static_assertion((!is_iterator_to<A*,int>::value));
+  static_assert((is_iterator_to<int_p,double>::value));
+  static_assert((!is_iterator_to<A,int>::value));
+  static_assert((!is_iterator_to<A*,int>::value));
 }
diff --git a/STL_Extension/test/STL_Extension/test_is_streamable.cpp b/STL_Extension/test/STL_Extension/test_is_streamable.cpp
index 7d1c81a892cc..6e574cfdec15 100644
--- a/STL_Extension/test/STL_Extension/test_is_streamable.cpp
+++ b/STL_Extension/test/STL_Extension/test_is_streamable.cpp
@@ -21,12 +21,12 @@ istream& operator>>(istream& is, const D&) { return is; }
 int main() {
   using CGAL::is_streamable;
 
-  CGAL_static_assertion(!is_streamable<A>::value);
-  CGAL_static_assertion(is_streamable<B>::value);
-  CGAL_static_assertion(!is_streamable<C>::value);
-  CGAL_static_assertion(!is_streamable<D>::value);
-  CGAL_static_assertion(is_streamable<int>::value);
-  CGAL_static_assertion(is_streamable<double>::value);
-  CGAL_static_assertion(! (is_streamable<std::pair<int, int> >::value) );
-  CGAL_static_assertion(  (is_streamable<boost::tuple<int, int> >::value) );
+  static_assert(!is_streamable<A>::value);
+  static_assert(is_streamable<B>::value);
+  static_assert(!is_streamable<C>::value);
+  static_assert(!is_streamable<D>::value);
+  static_assert(is_streamable<int>::value);
+  static_assert(is_streamable<double>::value);
+  static_assert(! (is_streamable<std::pair<int, int> >::value) );
+  static_assert(  (is_streamable<boost::tuple<int, int> >::value) );
 }
diff --git a/STL_Extension/test/STL_Extension/test_stl_extension.cpp b/STL_Extension/test/STL_Extension/test_stl_extension.cpp
index d361ed8b6107..1895935f787e 100644
--- a/STL_Extension/test/STL_Extension/test_stl_extension.cpp
+++ b/STL_Extension/test/STL_Extension/test_stl_extension.cpp
@@ -8117,10 +8117,10 @@ void test_tuple(){
 
   CGAL_USE_TYPE(T0);
   CGAL_USE_TYPE(T2);
-  CGAL_static_assertion( std::tuple_size<T0>::value == 0 );
-  CGAL_static_assertion( std::tuple_size<T1>::value == 2 );
-  CGAL_static_assertion( std::tuple_size<T2>::value == 4 );
-  CGAL_static_assertion( (std::is_same<std::tuple_element<1,T2>::type,My_to_int>::value) );
+  static_assert( std::tuple_size<T0>::value == 0 );
+  static_assert( std::tuple_size<T1>::value == 2 );
+  static_assert( std::tuple_size<T2>::value == 4 );
+  static_assert( (std::is_same<std::tuple_element<1,T2>::type,My_to_int>::value) );
 
   T1 t1=std::make_tuple(1,2);
   T1 t1_2=std::make_tuple(1,2);
@@ -8206,15 +8206,15 @@ void test_make_sorted_pair() {
   assert(p3==p4);
   int i=2;
   assert( CGAL::make_sorted_pair(1,i) == std::make_pair(1,i) );
-  CGAL_static_assertion( (std::is_same<
+  static_assert( (std::is_same<
                           BOOST_TYPEOF(CGAL::make_sorted_pair<long>(1L,i)),
                           std::pair<long,long> >::value) );
   assert( (CGAL::make_sorted_pair<long>(i,1L) == std::pair<long,long>(1L,2L)) );
 
-  CGAL_static_assertion( (std::is_same<
+  static_assert( (std::is_same<
                           BOOST_TYPEOF(CGAL::make_sorted_pair<double>(1,2L)),
                           std::pair<double,double> >::value) );
-  CGAL_static_assertion( (std::is_same<
+  static_assert( (std::is_same<
                           BOOST_TYPEOF(CGAL::make_sorted_pair<int>(1,2L)),
                           std::pair<int,int> >::value) );
 }
@@ -8237,8 +8237,8 @@ void test_result_of() {
   typedef CGAL::cpp11::result_of<Result_functor(int)>::type result_type_float;
   CGAL_USE_TYPE(result_type);
   CGAL_USE_TYPE(result_type_float);
-  CGAL_static_assertion((std::is_same<result_type, int>::value));
-  CGAL_static_assertion((std::is_same<result_type_float, float>::value));
+  static_assert((std::is_same<result_type, int>::value));
+  static_assert((std::is_same<result_type_float, float>::value));
 
 }
 
diff --git a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
index bc4ba9ec616a..a32aacd681ba 100644
--- a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
+++ b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
@@ -198,7 +198,7 @@ class Weighted_PCA_smoother
   void try_parallel (const F& func, std::size_t begin, std::size_t end)
   {
 #ifndef CGAL_LINKED_WITH_TBB
-    CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+    static_assert (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                "Parallel_tag is enabled but TBB is unavailable.");
 #else
     if (boost::is_convertible<ConcurrencyTag,Parallel_tag>::value)
diff --git a/Shape_regularization/include/CGAL/Shape_regularization/regularize_planes.h b/Shape_regularization/include/CGAL/Shape_regularization/regularize_planes.h
index 94713899f344..a5a5c5e58cbd 100644
--- a/Shape_regularization/include/CGAL/Shape_regularization/regularize_planes.h
+++ b/Shape_regularization/include/CGAL/Shape_regularization/regularize_planes.h
@@ -296,7 +296,7 @@ namespace Planes {
 
     using PlaneIndexMap = typename CGAL::Point_set_processing_3::GetPlaneIndexMap<NamedParameters>::type;
 
-    CGAL_static_assertion_msg((!is_default_parameter<NamedParameters, internal_np::plane_index_t>::value),
+    static_assert((!is_default_parameter<NamedParameters, internal_np::plane_index_t>::value),
                               "Error: no plane index map");
 
     const PlaneIndexMap index_map =
diff --git a/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h b/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h
index add923b15e22..ff11623a892b 100644
--- a/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h
+++ b/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h
@@ -107,7 +107,7 @@ class Search_traits_kd_tree_2 {
 
 template<class Traits_, class SAVED_OBJECT>
 class Multiple_kd_tree {
-  CGAL_static_assertion_msg((boost::is_pointer<SAVED_OBJECT>::value), "SAVED_OBJECT is not a pointer.");
+  static_assert((boost::is_pointer<SAVED_OBJECT>::value), "SAVED_OBJECT is not a pointer.");
 private:
   typedef Traits_                                       Traits;
   typedef typename Traits::FT                           NT;
diff --git a/Spatial_searching/include/CGAL/Kd_tree.h b/Spatial_searching/include/CGAL/Kd_tree.h
index b0958bc44ee4..317f6a78bad5 100644
--- a/Spatial_searching/include/CGAL/Kd_tree.h
+++ b/Spatial_searching/include/CGAL/Kd_tree.h
@@ -335,7 +335,7 @@ class Kd_tree {
     }
 
 #ifndef CGAL_TBB_STRUCTURE_IN_KD_TREE
-    CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+    static_assert (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                "Parallel_tag is enabled but TBB is unavailable.");
 #endif
 
diff --git a/Spatial_sorting/include/CGAL/Hilbert_sort_median_2.h b/Spatial_sorting/include/CGAL/Hilbert_sort_median_2.h
index 722ccc3acbce..59df305b5c4c 100644
--- a/Spatial_sorting/include/CGAL/Hilbert_sort_median_2.h
+++ b/Spatial_sorting/include/CGAL/Hilbert_sort_median_2.h
@@ -157,7 +157,7 @@ class Hilbert_sort_median_2
 #ifndef CGAL_LINKED_WITH_TBB
     CGAL_USE(begin);
     CGAL_USE(end);
-    CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+    static_assert (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                "Parallel_tag is enabled but TBB is unavailable.");
 #else
     const int y = (x + 1) % 2;
diff --git a/Spatial_sorting/include/CGAL/Hilbert_sort_median_3.h b/Spatial_sorting/include/CGAL/Hilbert_sort_median_3.h
index ebf71afed5a1..6fc128cd61ad 100644
--- a/Spatial_sorting/include/CGAL/Hilbert_sort_median_3.h
+++ b/Spatial_sorting/include/CGAL/Hilbert_sort_median_3.h
@@ -180,7 +180,7 @@ class CGAL_VISIBILITY_MACRO Hilbert_sort_median_3
 #ifndef CGAL_LINKED_WITH_TBB
     CGAL_USE(begin);
     CGAL_USE(end);
-    CGAL_static_assertion_msg (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
+    static_assert (!(boost::is_convertible<ConcurrencyTag, Parallel_tag>::value),
                                "Parallel_tag is enabled but TBB is unavailable.");
 #else
     const int y = (x + 1) % 3, z = (x + 2) % 3;
diff --git a/Stream_support/test/Stream_support/test_ioformat.cpp b/Stream_support/test/Stream_support/test_ioformat.cpp
index e4e4e13e67eb..d85c7c0577ce 100644
--- a/Stream_support/test/Stream_support/test_ioformat.cpp
+++ b/Stream_support/test/Stream_support/test_ioformat.cpp
@@ -50,8 +50,8 @@ void test_io(const NT& x){
 }
 
 int main() {
-    CGAL_static_assertion(CGAL::Output_rep<int>::is_specialized == false);
-    CGAL_static_assertion(CGAL::Input_rep<int>::is_specialized == false);
+    static_assert(CGAL::Output_rep<int>::is_specialized == false);
+    static_assert(CGAL::Input_rep<int>::is_specialized == false);
 
     std::cout << "test_io: short "<< std::endl;
     test_io<short>(12);
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h
index ca3de4760915..763ed9ac09b1 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h
@@ -176,7 +176,7 @@ class ARAP_parameterizer_3
     Two_vertices_parameterizer_3<TriangleMesh_> >::type       Border_parameterizer;
 
   #if !defined(CGAL_EIGEN3_ENABLED)
-  CGAL_static_assertion_msg(!(std::is_same<SolverTraits_, Default>::value),
+  static_assert(!(std::is_same<SolverTraits_, Default>::value),
                             "Error: You must either provide 'SolverTraits_' or link CGAL with the Eigen library");
   #endif
 
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Fixed_border_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Fixed_border_parameterizer_3.h
index 3bf9f7f8f916..a128e341a7b6 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Fixed_border_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Fixed_border_parameterizer_3.h
@@ -104,7 +104,7 @@ class Fixed_border_parameterizer_3
     Circular_border_arc_length_parameterizer_3<TriangleMesh_> >::type  Border_parameterizer;
 
   #if !defined(CGAL_EIGEN3_ENABLED)
-  CGAL_static_assertion_msg(!(std::is_same<SolverTraits_, Default>::value),
+  static_assert(!(std::is_same<SolverTraits_, Default>::value),
                             "Error: You must either provide 'SolverTraits_' or link CGAL with the Eigen library");
   #endif
 
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h
index c23ce5bf15d8..2f629c9cb64b 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Orbifold_Tutte_parameterizer_3.h
@@ -384,7 +384,7 @@ class Orbifold_Tutte_parameterizer_3
 public:
 #ifndef DOXYGEN_RUNNING
   #if !defined(CGAL_EIGEN3_ENABLED)
-  CGAL_static_assertion_msg(!(std::is_same<SolverTraits_, Default>::value),
+  static_assert(!(std::is_same<SolverTraits_, Default>::value),
                             "Error: You must either provide 'SolverTraits_' or link CGAL with the Eigen library");
   #endif
 
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
index 59a33fa465ce..36f2f855312e 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
@@ -49,7 +49,7 @@ class Bounded_distance_placement
   template <typename Profile>
   void initialize_tree(const Profile& profile) const
   {
-    CGAL_static_assertion((std::is_same<GeomTraits, typename Profile::Geom_traits>::value));
+    static_assert((std::is_same<GeomTraits, typename Profile::Geom_traits>::value));
 
     typedef typename Profile::Triangle_mesh                                   Triangle_mesh;
     typedef typename boost::graph_traits<Triangle_mesh>::halfedge_descriptor  halfedge_descriptor;
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h
index 28b22b3e079d..2f0abb387892 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h
@@ -43,7 +43,7 @@ class FastEnvelope_filter
   template <typename Profile>
   void initialize_envelope(const Profile& profile) const
   {
-    CGAL_static_assertion((std::is_same<GeomTraits, typename Profile::Geom_traits>::value));
+    static_assert((std::is_same<GeomTraits, typename Profile::Geom_traits>::value));
 
     typedef typename Profile::Triangle_mesh                                   Triangle_mesh;
     typedef typename boost::graph_traits<Triangle_mesh>::halfedge_descriptor  halfedge_descriptor;
diff --git a/Surface_mesher/include/CGAL/Surface_mesher/Combining_oracle.h b/Surface_mesher/include/CGAL/Surface_mesher/Combining_oracle.h
index 46c1a253cc40..1340c1700e31 100644
--- a/Surface_mesher/include/CGAL/Surface_mesher/Combining_oracle.h
+++ b/Surface_mesher/include/CGAL/Surface_mesher/Combining_oracle.h
@@ -51,7 +51,7 @@ namespace CGAL {
 
     typedef typename Oracle_a::Intersection_point Intersection_point;
 
-    CGAL_static_assertion((::std::is_same<
+    static_assert((::std::is_same<
                          Intersection_point,
                          typename Oracle_b::Intersection_point>::value));
 
diff --git a/Surface_sweep_2/include/CGAL/No_intersection_surface_sweep_2.h b/Surface_sweep_2/include/CGAL/No_intersection_surface_sweep_2.h
index 21aa9eaa8c72..8730089384e1 100644
--- a/Surface_sweep_2/include/CGAL/No_intersection_surface_sweep_2.h
+++ b/Surface_sweep_2/include/CGAL/No_intersection_surface_sweep_2.h
@@ -129,7 +129,7 @@ class No_intersection_surface_sweep_2 {
   typedef typename Traits_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Traits_adaptor_2::Right_side_category  Right_side_category;
 
-  CGAL_static_assertion((Arr_sane_identified_tagging< Left_side_category, Bottom_side_category,
+  static_assert((Arr_sane_identified_tagging< Left_side_category, Bottom_side_category,
                           Top_side_category, Right_side_category >::value));
 
 protected:
diff --git a/TDS_3/include/CGAL/Triangulation_data_structure_3.h b/TDS_3/include/CGAL/Triangulation_data_structure_3.h
index 6333387f28bd..862ffc711946 100644
--- a/TDS_3/include/CGAL/Triangulation_data_structure_3.h
+++ b/TDS_3/include/CGAL/Triangulation_data_structure_3.h
@@ -130,7 +130,7 @@ class Triangulation_data_structure_3
   >::type                                                Cell_range;
 
 # else
-  CGAL_static_assertion_msg
+  static_assert
     (!(std::is_convertible<Concurrency_tag, Parallel_tag>::value),
      "In CGAL triangulations, `Parallel_tag` can only be used with the Intel TBB library. "
      "Make TBB available in the build system and then define the macro `CGAL_LINKED_WITH_TBB`.");
diff --git a/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h b/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h
index 41a72c1e9de0..86d9a71f51e5 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h
@@ -31,7 +31,7 @@ namespace CGAL {
    std::map<typename Triangulation::Face_handle,
             typename LCC::Dart_descriptor >* aface_to_dart=nullptr)
   {
-    CGAL_static_assertion( LCC::dimension>=2 && LCC::ambient_dimension==2 );
+    static_assert( LCC::dimension>=2 && LCC::ambient_dimension==2 );
 
     // Case of empty triangulations.
     if (atr.number_of_vertices()==0) return LCC::null_descriptor;
diff --git a/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h b/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h
index 01a5dbb8535b..14f718f0b138 100644
--- a/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h
+++ b/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h
@@ -49,7 +49,7 @@ namespace CGAL {
    std::map<typename Triangulation::Cell_handle,
             typename LCC::Dart_descriptor >* avol_to_dart=nullptr)
   {
-    CGAL_static_assertion( LCC::dimension>=3 && LCC::ambient_dimension==3 );
+    static_assert( LCC::dimension>=3 && LCC::ambient_dimension==3 );
 
     // Case of empty triangulations.
     if (atr.number_of_vertices() == 0) return LCC::null_descriptor;
diff --git a/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h b/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h
index a447bc7e3352..ab3fe40ec6cf 100644
--- a/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h
+++ b/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h
@@ -632,8 +632,8 @@ insert(InputIterator first, InputIterator beyond,
 {
   typedef Point_3_with_iterator<Self>                                P3_wit;
 
-  CGAL_static_assertion((std::is_same<typename std::iterator_traits<InputIterator>::value_type, Point>::value));
-  CGAL_static_assertion(!(std::is_same<Point, Point_3>::value));
+  static_assert((std::is_same<typename std::iterator_traits<InputIterator>::value_type, Point>::value));
+  static_assert(!(std::is_same<Point, Point_3>::value));
 
   const size_type n = number_of_vertices();
 
diff --git a/Triangulation_on_sphere_2/include/CGAL/Triangulation_on_sphere_2/internal/arc_on_sphere_2_subsampling.h b/Triangulation_on_sphere_2/include/CGAL/Triangulation_on_sphere_2/internal/arc_on_sphere_2_subsampling.h
index fbe529799391..98dc2f54c651 100644
--- a/Triangulation_on_sphere_2/include/CGAL/Triangulation_on_sphere_2/internal/arc_on_sphere_2_subsampling.h
+++ b/Triangulation_on_sphere_2/include/CGAL/Triangulation_on_sphere_2/internal/arc_on_sphere_2_subsampling.h
@@ -56,7 +56,7 @@ double get_theta(typename Kernel::Point_3& pt,
 #endif
                                 >::type                              Col;
 
-  CGAL_static_assertion_msg(!(std::is_same<Matrix, EigenlessDefault>::value),
+  static_assert(!(std::is_same<Matrix, EigenlessDefault>::value),
                             "Eigen is required to perform arc subsampling!");
 
   auto V1c = V1.cartesian_begin(), V2c = V2.cartesian_begin(), V3c = V3.cartesian_begin();

From f5803d5a8b0fa4b6796e26b82c918d3f6b9118cf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 23:00:44 +0200
Subject: [PATCH 0354/1398] MSVC 2015 is no longer supported

---
 Documentation/doc/Documentation/Third_party.txt       |  2 +-
 Documentation/doc/Documentation/windows.txt           |  2 +-
 Installation/CHANGES.md                               | 11 +++++++++++
 .../cmake/modules/CGAL_SetupCGALDependencies.cmake    |  5 -----
 4 files changed, 13 insertions(+), 7 deletions(-)

diff --git a/Documentation/doc/Documentation/Third_party.txt b/Documentation/doc/Documentation/Third_party.txt
index 1e3fe07e9ba5..eac22ad82928 100644
--- a/Documentation/doc/Documentation/Third_party.txt
+++ b/Documentation/doc/Documentation/Third_party.txt
@@ -14,7 +14,7 @@ supporting <a href="https://isocpp.org/wiki/faq/cpp14">C++14</a> or later.
 | Linux            | \gnu `g++` 10.2.1 or later\cgalFootnote{<A HREF="https://gcc.gnu.org/">\cgalFootnoteCode{https://gcc.gnu.org/}</A>} |
 |                  | `Clang` \cgalFootnote{<A HREF="https://clang.llvm.org/">\cgalFootnoteCode{https://clang.llvm.org/}</A>} compiler version 13.0.1 |
 | \ms Windows      | \gnu `g++` 10.2.1 or later\cgalFootnote{<A HREF="https://gcc.gnu.org/">\cgalFootnoteCode{https://gcc.gnu.org/}</A>} |
-|                  | \ms Visual `C++` 14.0, 15.9, 16.10, 17.0 (\visualstudio 2015, 2017, 2019, and 2022)\cgalFootnote{<A HREF="https://visualstudio.microsoft.com/">\cgalFootnoteCode{https://visualstudio.microsoft.com/}</A>} |
+|                  | \ms Visual `C++` 15.9, 16.10, 17.0 (\visualstudio 2017, 2019, and 2022)\cgalFootnote{<A HREF="https://visualstudio.microsoft.com/">\cgalFootnoteCode{https://visualstudio.microsoft.com/}</A>} |
 | MacOS X          | \gnu `g++` 10.2.1 or later\cgalFootnote{<A HREF="https://gcc.gnu.org/">\cgalFootnoteCode{https://gcc.gnu.org/}</A>} |
 |                  | Apple `Clang` compiler versions 10.0.1, 12.0.5, and 13.0.0 |
 
diff --git a/Documentation/doc/Documentation/windows.txt b/Documentation/doc/Documentation/windows.txt
index c4daa8fc3801..d40059d76cd3 100644
--- a/Documentation/doc/Documentation/windows.txt
+++ b/Documentation/doc/Documentation/windows.txt
@@ -3,7 +3,7 @@
 \cgalAutoToc
 
 \cgal \cgalReleaseNumber is supported for the following \ms Visual `C++` compilers:
-14.0, 15.9, 16.0, 17.0 (\visualstudio 2015, 2017, 2019, and 2022).
+15.9, 16.0, 17.0 (\visualstudio 2017, 2019, and 2022).
 
 \cgal is a library that has mandatory dependencies that must be first installed:
 \ref thirdpartyBoost and \ref thirdpartyMPFR.
diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index c4ce7a51d6d1..a505215bd003 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -1,6 +1,17 @@
 Release History
 ===============
 
+[Release 6.0](https://github.com/CGAL/cgal/releases/tag/v6.0)
+-----------
+
+Release date: October 2023
+
+### General Changes
+
+- **Breaking change**: C++17 is now required
+- Support for Visual `C++` 14.0 (Visual studio 2015) is dropped.
+
+
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------
 
diff --git a/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake b/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
index de0f5eb7fa4f..3664c4b0693c 100644
--- a/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
+++ b/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
@@ -127,11 +127,6 @@ function(CGAL_setup_CGAL_dependencies target)
       $<$<COMPILE_LANGUAGE:CXX>:/fp:except->
       $<$<COMPILE_LANGUAGE:CXX>:/bigobj>  # Use /bigobj by default
       )
-    if(MSVC_TOOLSET_VERSION VERSION_LESS_EQUAL 140) # for MSVC 2015
-      target_compile_options(${target} INTERFACE
-        $<$<COMPILE_LANGUAGE:CXX>:/wd4503>  # Suppress warnings C4503 about "decorated name length exceeded"
-        )
-    endif()
   elseif ("${CMAKE_CXX_COMPILER_ID}" MATCHES "AppleClang")
     if (CMAKE_CXX_COMPILER_VERSION VERSION_LESS 11.0.3)
       message(STATUS "Apple Clang version ${CMAKE_CXX_COMPILER_VERSION} compiler detected")

From cc1cb02ccd147642ddf8cc3530f3fc587eb7681a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 23:08:22 +0200
Subject: [PATCH 0355/1398] missing 6.0 updates

---
 Documentation/doc/resources/1.8.13/menu_version.js  | 3 ++-
 Documentation/doc/resources/1.8.14/menu_version.js  | 3 ++-
 Documentation/doc/resources/1.8.20/menu_version.js  | 3 ++-
 Documentation/doc/resources/1.8.4/menu_version.js   | 3 ++-
 Documentation/doc/resources/1.9.3/menu_version.js   | 3 ++-
 Installation/lib/cmake/CGAL/CGALConfigVersion.cmake | 6 +++---
 6 files changed, 13 insertions(+), 8 deletions(-)

diff --git a/Documentation/doc/resources/1.8.13/menu_version.js b/Documentation/doc/resources/1.8.13/menu_version.js
index a66903b10fee..f3b20c2fe004 100644
--- a/Documentation/doc/resources/1.8.13/menu_version.js
+++ b/Documentation/doc/resources/1.8.13/menu_version.js
@@ -6,7 +6,8 @@
   var current_version_local = 'master'
   var all_versions = [
       'master',
-      '5.6-beta1',
+      '6.0-beta1',
+      '5.6',
       'latest',
       '5.5.2',
       '5.4.4',
diff --git a/Documentation/doc/resources/1.8.14/menu_version.js b/Documentation/doc/resources/1.8.14/menu_version.js
index a66903b10fee..f3b20c2fe004 100644
--- a/Documentation/doc/resources/1.8.14/menu_version.js
+++ b/Documentation/doc/resources/1.8.14/menu_version.js
@@ -6,7 +6,8 @@
   var current_version_local = 'master'
   var all_versions = [
       'master',
-      '5.6-beta1',
+      '6.0-beta1',
+      '5.6',
       'latest',
       '5.5.2',
       '5.4.4',
diff --git a/Documentation/doc/resources/1.8.20/menu_version.js b/Documentation/doc/resources/1.8.20/menu_version.js
index a66903b10fee..f3b20c2fe004 100644
--- a/Documentation/doc/resources/1.8.20/menu_version.js
+++ b/Documentation/doc/resources/1.8.20/menu_version.js
@@ -6,7 +6,8 @@
   var current_version_local = 'master'
   var all_versions = [
       'master',
-      '5.6-beta1',
+      '6.0-beta1',
+      '5.6',
       'latest',
       '5.5.2',
       '5.4.4',
diff --git a/Documentation/doc/resources/1.8.4/menu_version.js b/Documentation/doc/resources/1.8.4/menu_version.js
index a66903b10fee..f3b20c2fe004 100644
--- a/Documentation/doc/resources/1.8.4/menu_version.js
+++ b/Documentation/doc/resources/1.8.4/menu_version.js
@@ -6,7 +6,8 @@
   var current_version_local = 'master'
   var all_versions = [
       'master',
-      '5.6-beta1',
+      '6.0-beta1',
+      '5.6',
       'latest',
       '5.5.2',
       '5.4.4',
diff --git a/Documentation/doc/resources/1.9.3/menu_version.js b/Documentation/doc/resources/1.9.3/menu_version.js
index a66903b10fee..f3b20c2fe004 100644
--- a/Documentation/doc/resources/1.9.3/menu_version.js
+++ b/Documentation/doc/resources/1.9.3/menu_version.js
@@ -6,7 +6,8 @@
   var current_version_local = 'master'
   var all_versions = [
       'master',
-      '5.6-beta1',
+      '6.0-beta1',
+      '5.6',
       'latest',
       '5.5.2',
       '5.4.4',
diff --git a/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake b/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake
index e71784c4c52c..fc443126c186 100644
--- a/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake
+++ b/Installation/lib/cmake/CGAL/CGALConfigVersion.cmake
@@ -1,8 +1,8 @@
-set(CGAL_MAJOR_VERSION 5)
-set(CGAL_MINOR_VERSION 6)
+set(CGAL_MAJOR_VERSION 6)
+set(CGAL_MINOR_VERSION 0)
 set(CGAL_BUGFIX_VERSION 0)
 include(${CMAKE_CURRENT_LIST_DIR}/CGALConfigBuildVersion.cmake)
-set(CGAL_VERSION_PUBLIC_RELEASE_VERSION "5.6-beta1")
+set(CGAL_VERSION_PUBLIC_RELEASE_VERSION "6.0-beta1")
 set(CGAL_VERSION_PUBLIC_RELEASE_NAME "CGAL-${CGAL_VERSION_PUBLIC_RELEASE_VERSION}")
 
 if (CGAL_BUGFIX_VERSION AND CGAL_BUGFIX_VERSION GREATER 0)

From 6df9a0d61cc91a1c3fa19328f4260b0edf4caffa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 May 2023 19:04:30 +0200
Subject: [PATCH 0356/1398] check headers also needs c++17

---
 Installation/CMakeLists.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Installation/CMakeLists.txt b/Installation/CMakeLists.txt
index 0a521d9dd2c2..e06916bd1a3c 100644
--- a/Installation/CMakeLists.txt
+++ b/Installation/CMakeLists.txt
@@ -943,7 +943,7 @@ ${Qt5Widgets_DEFINITIONS} ${Qt5OpenGL_DEFINITIONS} ${Qt5Gui_DEFINITIONS} \
 ${Qt5OpenGL_EXECUTABLE_COMPILE_FLAGS} -fPIC \
 ${Qt5Gui_EXECUTABLE_COMPILE_FLAGS} \
 ${CGAL_3RD_PARTY_DEFINITIONS} ${CGAL_Qt5_3RD_PARTY_DEFINITIONS} \
-${CGAL_DEFINITIONS}")
+${CGAL_DEFINITIONS} -std=c++17")
     message("COMPILATION OPTIONS ARE :  ${compile_options}")
 
     if(NOT RS_FOUND AND NOT RS3_FOUND)

From b45b2c379faaee13a4457ab26c5349541df8a8bc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 May 2023 18:59:54 +0200
Subject: [PATCH 0357/1398] update doc about C++ standard

---
 Documentation/doc/Documentation/Preliminaries.txt | 5 ++---
 Documentation/doc/Documentation/Third_party.txt   | 2 +-
 2 files changed, 3 insertions(+), 4 deletions(-)

diff --git a/Documentation/doc/Documentation/Preliminaries.txt b/Documentation/doc/Documentation/Preliminaries.txt
index 1fccdc134f9b..c8a06bd7d17b 100644
--- a/Documentation/doc/Documentation/Preliminaries.txt
+++ b/Documentation/doc/Documentation/Preliminaries.txt
@@ -39,10 +39,9 @@ If you are using CMake, then you can set the CMake option `CGAL_HAS_NO_THREADS`
 `TRUE`. In addition to defining the preprocessor macro `CGAL_HAS_NO_THREADS`, it will
 also avoid CMake to link with the native threads support library on your system.
 
-\section Preliminaries_cc0x C++14 Support
+\section Preliminaries_cc0x C++17 Support
 
-After being based on the \CC standard released in 1998 (and later refined in 2003) for a long time,
-\cgal is now based on a newer major version of the standard, <a href="https://isocpp.org/wiki/faq/cpp14">C++14</a>.
+\cgal is based on a the version C++17 of the standard.
 
 \section preliminaries_secchecks Checks
 
diff --git a/Documentation/doc/Documentation/Third_party.txt b/Documentation/doc/Documentation/Third_party.txt
index eac22ad82928..9017a5eee91f 100644
--- a/Documentation/doc/Documentation/Third_party.txt
+++ b/Documentation/doc/Documentation/Third_party.txt
@@ -6,7 +6,7 @@
 \section seccompilers Supported Compilers
 
 In order to build a program using \cgal, you need a \cpp compiler
-supporting <a href="https://isocpp.org/wiki/faq/cpp14">C++14</a> or later.
+supporting C++17 or later.
 \cgal \cgalReleaseNumber is supported (continuously tested) for the following compilers/operating systems:
 
 | Operating System | Compiler |

From 5b0786aa9942b5266c219f2cda0763d74ed4cadd Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Wed, 7 Jun 2023 17:21:30 +0200
Subject: [PATCH 0358/1398] Update
 Documentation/doc/Documentation/Preliminaries.txt

Co-authored-by: Laurent Rineau <Laurent.Rineau@cgal.org>
---
 Documentation/doc/Documentation/Preliminaries.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Documentation/doc/Documentation/Preliminaries.txt b/Documentation/doc/Documentation/Preliminaries.txt
index c8a06bd7d17b..2e2ae95e661e 100644
--- a/Documentation/doc/Documentation/Preliminaries.txt
+++ b/Documentation/doc/Documentation/Preliminaries.txt
@@ -41,7 +41,7 @@ also avoid CMake to link with the native threads support library on your system.
 
 \section Preliminaries_cc0x C++17 Support
 
-\cgal is based on a the version C++17 of the standard.
+\cgal is based on the version C++17 of the C++ standard.
 
 \section preliminaries_secchecks Checks
 

From 71b4e4f08f72a0724bfcf9fad0f24252539b7dd7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 20:27:13 +0200
Subject: [PATCH 0359/1398] boost::shared_ptr => std::shared_ptr

---
 CGAL_ipelets/demo/CGAL_ipelets/skeleton.cpp   |  5 +-
 .../random-forest/common-libraries.hpp        |  2 +-
 .../Feature/Gradient_of_feature.h             |  2 +-
 GraphicsView/demo/Polygon/Polygon_2.cpp       |  5 +-
 Installation/CHANGES.md                       |  1 +
 .../examples/Point_set_3/point_set_algo.cpp   |  2 +-
 .../Classification/Cluster_classification.h   |  4 +-
 .../Point_set_average_spacing_plugin.cpp      |  2 +-
 .../Point_set_bilateral_smoothing_plugin.cpp  |  2 +-
 .../Point_set/Point_set_clustering_plugin.cpp |  2 +-
 .../Point_set_outliers_removal_plugin.cpp     |  2 +-
 .../Point_set/Point_set_selection_plugin.cpp  |  4 +-
 .../Point_set_shape_detection_plugin.cpp      | 10 ++--
 .../Point_set_simplification_plugin.cpp       |  6 +--
 .../Point_set/Point_set_wlop_plugin.cpp       |  2 +-
 .../include/run_with_qprogressdialog.h        |  8 ++--
 .../efficient_RANSAC_with_point_access.cpp    |  2 +-
 .../Efficient_RANSAC/Efficient_RANSAC.h       | 44 ++++++++---------
 .../Efficient_RANSAC/property_map.h           |  6 +--
 .../test_efficient_RANSAC_cone_parameters.cpp |  2 +-
 ...t_efficient_RANSAC_cylinder_parameters.cpp |  2 +-
 ...test_efficient_RANSAC_plane_parameters.cpp |  2 +-
 .../test_efficient_RANSAC_scene.cpp           |  2 +-
 ...est_efficient_RANSAC_sphere_parameters.cpp |  2 +-
 ...test_efficient_RANSAC_torus_parameters.cpp |  2 +-
 ...ompare_kernels_simple_polygon_skeleton.cpp |  4 +-
 .../create_exterior_skeleton.cpp              |  6 +--
 ...te_exterior_skeleton_tweaking_skeleton.cpp |  6 +--
 .../CGAL/Polygon_offset_builder_2.h           |  4 +-
 .../CGAL/Straight_skeleton_builder_2.h        |  4 +-
 .../CGAL/Straight_skeleton_converter_2.h      |  4 +-
 .../CGAL/arrange_offset_polygons_2.h          |  6 +--
 .../CGAL/create_offset_polygons_2.h           |  8 ++--
 ...ffset_polygons_from_polygon_with_holes_2.h |  4 +-
 .../CGAL/create_straight_skeleton_2.h         | 10 ++--
 .../Straight_skeleton_2.txt                   |  4 +-
 .../Create_offset_polygons_2.cpp              |  6 +--
 .../Create_saop_from_polygon_with_holes_2.cpp |  6 +--
 .../Create_skeleton_and_offset_polygons_2.cpp |  6 +--
 ...leton_and_offset_polygons_with_holes_2.cpp |  4 +-
 .../Create_straight_skeleton_2.cpp            |  4 +-
 ...ght_skeleton_from_polygon_with_holes_2.cpp |  4 +-
 .../Straight_skeleton_2/Low_level_API.cpp     |  6 +--
 .../Show_offset_polygon.cpp                   |  4 +-
 .../Show_straight_skeleton.cpp                |  4 +-
 .../draw_straight_skeleton_2.cpp              |  4 +-
 .../Straight_skeleton_2/dump_to_eps.h         |  4 +-
 ...offset_of_multiple_polygons_with_holes.cpp |  6 +--
 .../examples/Straight_skeleton_2/print.h      |  8 ++--
 .../include/CGAL/Polygon_offset_builder_2.h   |  4 +-
 .../Straight_skeleton_2/Polygon_iterators.h   | 14 +++---
 .../CGAL/Straight_skeleton_builder_2.h        |  4 +-
 .../CGAL/Straight_skeleton_converter_2.h      |  8 ++--
 .../include/CGAL/arrange_offset_polygons_2.h  | 16 +++----
 .../include/CGAL/create_offset_polygons_2.h   | 40 ++++++++--------
 ...ffset_polygons_from_polygon_with_holes_2.h | 26 +++++-----
 .../include/CGAL/create_straight_skeleton_2.h | 24 +++++-----
 ...aight_skeleton_from_polygon_with_holes_2.h |  4 +-
 .../include/CGAL/test_offset_builder_types.h  |  8 ++--
 .../include/CGAL/test_sls_builder_types.h     |  8 ++--
 .../include/CGAL/test_sls_types.h             | 14 +++---
 .../test/Straight_skeleton_2/issue4533.cpp    |  4 +-
 .../test/Straight_skeleton_2/issue4684.cpp    |  4 +-
 .../test/Straight_skeleton_2/issue7149.cpp    |  2 +-
 .../test/Straight_skeleton_2/print.h          |  8 ++--
 .../Straight_skeleton_2/test_sls_offset.cpp   | 48 +++++++++----------
 .../Straight_skeleton_2/test_sls_simple.cpp   | 10 ++--
 .../test_straight_skeleton_copy.cpp           |  6 +--
 .../internal/Geometry_container.h             |  4 +-
 69 files changed, 246 insertions(+), 259 deletions(-)

diff --git a/CGAL_ipelets/demo/CGAL_ipelets/skeleton.cpp b/CGAL_ipelets/demo/CGAL_ipelets/skeleton.cpp
index 7d2026c59811..71557e659689 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/skeleton.cpp
+++ b/CGAL_ipelets/demo/CGAL_ipelets/skeleton.cpp
@@ -11,7 +11,6 @@
 // Author(s)     : Sebastien Loriot, Sylvain Pion
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include<boost/shared_ptr.hpp>
 #include <CGAL/CGAL_Ipelet_base.h>
 #include<CGAL/create_offset_polygons_2.h>
 #include <boost/format.hpp>
@@ -38,10 +37,10 @@ const std::string Hmsg[] = {
 class SkeletonIpelet
   : public CGAL::Ipelet_base<Kernel,7>{
 
-  typedef boost::shared_ptr<Polygon_2>        PolygonPtr ;
+  typedef std::shared_ptr<Polygon_2>        PolygonPtr ;
   typedef std::vector<PolygonPtr>             PolygonPtrVector ;
   typedef CGAL::Straight_skeleton_2<Kernel>   Skeleton ;
-  typedef boost::shared_ptr<Skeleton>         SkeletonPtr ;
+  typedef std::shared_ptr<Skeleton>         SkeletonPtr ;
 
   void draw_straight_skeleton(const Skeleton& skeleton,double);
 
diff --git a/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp b/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp
index c20b9b7155f9..6d2ebb01acfc 100644
--- a/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp
+++ b/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp
@@ -45,7 +45,7 @@
 #include <boost/serialization/vector.hpp>
 #endif
 #include <boost/scoped_ptr.hpp>
-#include <boost/shared_ptr.hpp>
+#include <memory>
 #include <boost/make_shared.hpp>
 #include <unordered_set>
 #include <iostream>
diff --git a/Classification/include/CGAL/Classification/Feature/Gradient_of_feature.h b/Classification/include/CGAL/Classification/Feature/Gradient_of_feature.h
index 85d703c5ed1e..d87ee8f28301 100644
--- a/Classification/include/CGAL/Classification/Feature/Gradient_of_feature.h
+++ b/Classification/include/CGAL/Classification/Feature/Gradient_of_feature.h
@@ -37,7 +37,7 @@ class Gradient_of_feature : public Feature_base
   const InputRange& m_input;
   ItemMap m_map;
   Feature_handle m_feature;
-  boost::shared_ptr<NeighborQuery> m_query;
+  std::shared_ptr<NeighborQuery> m_query;
 
 public:
   /*!
diff --git a/GraphicsView/demo/Polygon/Polygon_2.cpp b/GraphicsView/demo/Polygon/Polygon_2.cpp
index 9463c2e979b6..67c16d0b3dca 100644
--- a/GraphicsView/demo/Polygon/Polygon_2.cpp
+++ b/GraphicsView/demo/Polygon/Polygon_2.cpp
@@ -1,5 +1,4 @@
 #include <fstream>
-#include<boost/shared_ptr.hpp>
 // CGAL headers
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Polygon_2.h>
@@ -42,9 +41,9 @@ typedef CGAL::Polygon_with_holes_2<K,std::list< Point_2 > > Polygon_with_holes_2
 
 typedef CGAL::Straight_skeleton_2<K> Ss ;
 
-typedef boost::shared_ptr<Ss> SsPtr ;
+typedef std::shared_ptr<Ss> SsPtr ;
 
-typedef boost::shared_ptr<Polygon2> PolygonPtr ;
+typedef std::shared_ptr<Polygon2> PolygonPtr ;
 
 typedef std::vector<PolygonPtr> PolygonPtr_vector ;
 
diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index a505215bd003..486f43ea21f7 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -10,6 +10,7 @@ Release date: October 2023
 
 - **Breaking change**: C++17 is now required
 - Support for Visual `C++` 14.0 (Visual studio 2015) is dropped.
+- **Breaking change**: The usage of `boost::shared_ptr` has been replaced by `std::shared_ptr`. Packages affected are 2D Straight Line Skeleton and Shape Detection.
 
 
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
diff --git a/Point_set_3/examples/Point_set_3/point_set_algo.cpp b/Point_set_3/examples/Point_set_3/point_set_algo.cpp
index 12c98682475b..19f10f5ecfbf 100644
--- a/Point_set_3/examples/Point_set_3/point_set_algo.cpp
+++ b/Point_set_3/examples/Point_set_3/point_set_algo.cpp
@@ -68,7 +68,7 @@ int main (int, char**)
   parameters.normal_threshold = 0.9;
   ransac.detect(parameters);
 
-  for(boost::shared_ptr<Efficient_ransac::Shape> shape : ransac.shapes())
+  for(std::shared_ptr<Efficient_ransac::Shape> shape : ransac.shapes())
     if (Sphere* sphere = dynamic_cast<Sphere*>(shape.get()))
       std::cerr << "Detected sphere of center " << sphere->center() // Center should be approx 0, 0, 0
                 << " and of radius " << sphere->radius() << std::endl; // Radius should be approx 1
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.h b/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.h
index 224a66d20c70..ef4d006e2ce0 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/Classification/Cluster_classification.h
@@ -98,7 +98,7 @@ class Cluster_classification : public Item_classification_base
 
   void add_cluster_features ()
   {
-    m_eigen = boost::make_shared<Local_eigen_analysis>
+    m_eigen = std::make_shared<Local_eigen_analysis>
       (Local_eigen_analysis::create_from_point_clusters(m_clusters,
                                                         Concurrency_tag()));
 
@@ -388,7 +388,7 @@ class Cluster_classification : public Item_classification_base
 
   int m_index_color;
 
-  boost::shared_ptr<Local_eigen_analysis> m_eigen;
+  std::shared_ptr<Local_eigen_analysis> m_eigen;
 
   bool m_input_is_las;
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_average_spacing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_average_spacing_plugin.cpp
index d11f45cd623d..78c0e2482d45 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_average_spacing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_average_spacing_plugin.cpp
@@ -27,7 +27,7 @@ struct Compute_average_spacing_functor
 {
   Point_set* points;
   const int nb_neighbors;
-  boost::shared_ptr<double> result;
+  std::shared_ptr<double> result;
 
   Compute_average_spacing_functor (Point_set* points, const int nb_neighbors)
     : points (points), nb_neighbors (nb_neighbors), result (new double(0)) { }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_bilateral_smoothing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_bilateral_smoothing_plugin.cpp
index c4a13af368d0..03f18810236f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_bilateral_smoothing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_bilateral_smoothing_plugin.cpp
@@ -29,7 +29,7 @@ struct Bilateral_smoothing_functor
   Point_set* points;
   unsigned int neighborhood_size;
   unsigned int sharpness_angle;
-  boost::shared_ptr<double> result;
+  std::shared_ptr<double> result;
 
   Bilateral_smoothing_functor  (Point_set* points,
                                 unsigned int neighborhood_size,
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_clustering_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_clustering_plugin.cpp
index e898807835fa..b998a35750e2 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_clustering_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_clustering_plugin.cpp
@@ -29,7 +29,7 @@ struct Clustering_functor
   Point_set* points;
   Point_set::Property_map<std::size_t> cluster_map;
   const double neighbor_radius;
-  boost::shared_ptr<std::size_t> result;
+  std::shared_ptr<std::size_t> result;
 
   Clustering_functor (Point_set* points,
                       const double neighbor_radius,
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_outliers_removal_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_outliers_removal_plugin.cpp
index 925195e38d4f..c18343a17a95 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_outliers_removal_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_outliers_removal_plugin.cpp
@@ -26,7 +26,7 @@ struct Outlier_removal_functor
   int nb_neighbors;
   double removed_percentage;
   double distance_threshold;
-  boost::shared_ptr<Point_set::iterator> result;
+  std::shared_ptr<Point_set::iterator> result;
 
   Outlier_removal_functor  (Point_set* points,
                             int nb_neighbors,
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_selection_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_selection_plugin.cpp
index 185ce8930fc5..634ae8c699b1 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_selection_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_selection_plugin.cpp
@@ -332,7 +332,7 @@ class Neighborhood
   typedef CGAL::Fuzzy_sphere<Search_traits> Sphere;
 
   Scene_points_with_normal_item* points_item;
-  boost::shared_ptr<Tree> tree;
+  std::shared_ptr<Tree> tree;
 
 public:
 
@@ -351,7 +351,7 @@ class Neighborhood
     {
       this->points_item = points_item;
 
-      tree = boost::make_shared<Tree> (points_item->point_set()->begin(),
+      tree = std::make_shared<Tree> (points_item->point_set()->begin(),
                                        points_item->point_set()->end(),
                                        Tree::Splitter(),
                                        Search_traits (points_item->point_set()->point_map()));
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
index fc344cec857c..b8117997037c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
@@ -440,7 +440,7 @@ class Polyhedron_demo_point_set_shape_detection_plugin :
         Scene_surface_mesh_item* sm_item = nullptr;
         sm_item = new Scene_surface_mesh_item;
 
-        boost::shared_ptr<Plane_3> rg_plane(boost::make_shared<Plane_3>(plane));
+        std::shared_ptr<Plane_3> rg_plane(std::make_shared<Plane_3>(plane));
         build_alpha_shape(
           *(point_item->point_set()), rg_plane,
           sm_item, search_sphere_radius);
@@ -656,7 +656,7 @@ class Polyhedron_demo_point_set_shape_detection_plugin :
     std::map<Kernel::Point_3, QColor> color_map;
 
     int index = 0;
-    for(boost::shared_ptr<typename Ransac::Shape> shape : ransac.shapes())
+    for(std::shared_ptr<typename Ransac::Shape> shape : ransac.shapes())
     {
       CGAL::Shape_detection::Cylinder<Traits> *cyl;
       cyl = dynamic_cast<CGAL::Shape_detection::Cylinder<Traits> *>(shape.get());
@@ -731,7 +731,7 @@ class Polyhedron_demo_point_set_shape_detection_plugin :
         {
           ss << item->name().toStdString() << "_plane_";
 
-          boost::shared_ptr<CGAL::Shape_detection::Plane<Traits> > pshape
+          std::shared_ptr<CGAL::Shape_detection::Plane<Traits> > pshape
             = boost::dynamic_pointer_cast<CGAL::Shape_detection::Plane<Traits> > (shape);
 
           Kernel::Point_3 ref = CGAL::ORIGIN + pshape->plane_normal ();
@@ -901,7 +901,7 @@ class Polyhedron_demo_point_set_shape_detection_plugin :
   }
 
     template<typename Plane>
-    void build_alpha_shape (Point_set& points, boost::shared_ptr<Plane> plane,
+    void build_alpha_shape (Point_set& points, std::shared_ptr<Plane> plane,
                           Scene_surface_mesh_item* sm_item, double epsilon);
 
 }; // end Polyhedron_demo_point_set_shape_detection_plugin
@@ -997,7 +997,7 @@ void Polyhedron_demo_point_set_shape_detection_plugin::on_actionDetect_triggered
 
 template<typename Plane>
 void Polyhedron_demo_point_set_shape_detection_plugin::build_alpha_shape
-(Point_set& points,  boost::shared_ptr<Plane> plane, Scene_surface_mesh_item* sm_item, double epsilon)
+(Point_set& points,  std::shared_ptr<Plane> plane, Scene_surface_mesh_item* sm_item, double epsilon)
 {
   typedef Kernel::Point_2  Point_2;
   typedef CGAL::Alpha_shape_vertex_base_2<Kernel> Vb;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_simplification_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_simplification_plugin.cpp
index cc5431609ac5..05eb2d414937 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_simplification_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_simplification_plugin.cpp
@@ -29,7 +29,7 @@ struct Compute_average_spacing_functor
 {
   Point_set* points;
   const int nb_neighbors;
-  boost::shared_ptr<double> result;
+  std::shared_ptr<double> result;
 
   Compute_average_spacing_functor (Point_set* points, const int nb_neighbors)
     : points (points), nb_neighbors (nb_neighbors), result (new double(0)) { }
@@ -50,7 +50,7 @@ struct Grid_simplify_functor
   Point_set* points;
   double grid_size;
   unsigned int min_points_per_cell;
-  boost::shared_ptr<Point_set::iterator> result;
+  std::shared_ptr<Point_set::iterator> result;
 
   Grid_simplify_functor (Point_set* points, double grid_size, unsigned min_points_per_cell)
     : points (points), grid_size (grid_size), min_points_per_cell(min_points_per_cell)
@@ -72,7 +72,7 @@ struct Hierarchy_simplify_functor
   Point_set* points;
   unsigned int max_cluster_size;
   double max_surface_variation;
-  boost::shared_ptr<Point_set::iterator> result;
+  std::shared_ptr<Point_set::iterator> result;
 
   Hierarchy_simplify_functor (Point_set* points,
                               double max_cluster_size,
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_wlop_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_wlop_plugin.cpp
index 538a48b32b7f..519b4fff4efc 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_wlop_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_wlop_plugin.cpp
@@ -27,7 +27,7 @@ struct Compute_average_spacing_functor
 {
   Point_set* points;
   const int nb_neighbors;
-  boost::shared_ptr<double> result;
+  std::shared_ptr<double> result;
 
   Compute_average_spacing_functor (Point_set* points, const int nb_neighbors)
     : points (points), nb_neighbors (nb_neighbors), result (new double(0)) { }
diff --git a/Polyhedron/demo/Polyhedron/include/run_with_qprogressdialog.h b/Polyhedron/demo/Polyhedron/include/run_with_qprogressdialog.h
index f2657fda3f1d..7a6d9744999a 100644
--- a/Polyhedron/demo/Polyhedron/include/run_with_qprogressdialog.h
+++ b/Polyhedron/demo/Polyhedron/include/run_with_qprogressdialog.h
@@ -20,9 +20,9 @@ class Signal_callback
   mutable std::size_t nb;
 
 public:
-  boost::shared_ptr<double> latest_adv;
-  boost::shared_ptr<bool> state;
-  boost::shared_ptr<Callback_signaler> signaler;
+  std::shared_ptr<double> latest_adv;
+  std::shared_ptr<bool> state;
+  std::shared_ptr<Callback_signaler> signaler;
 
   Signal_callback(bool)
     : latest_adv (new double(0))
@@ -71,7 +71,7 @@ class Signal_callback
 class Functor_with_signal_callback
 {
 protected:
-  boost::shared_ptr<Signal_callback> m_callback;
+  std::shared_ptr<Signal_callback> m_callback;
 public:
 
   Signal_callback* callback() { return m_callback.get(); }
diff --git a/Shape_detection/examples/Shape_detection/efficient_RANSAC_with_point_access.cpp b/Shape_detection/examples/Shape_detection/efficient_RANSAC_with_point_access.cpp
index f4e5a859bca9..34abf4d80490 100644
--- a/Shape_detection/examples/Shape_detection/efficient_RANSAC_with_point_access.cpp
+++ b/Shape_detection/examples/Shape_detection/efficient_RANSAC_with_point_access.cpp
@@ -99,7 +99,7 @@ int main(int argc, char** argv) {
   Efficient_ransac::Shape_range::iterator it = shapes.begin();
   while (it != shapes.end()) {
 
-    boost::shared_ptr<Efficient_ransac::Shape> shape = *it;
+    std::shared_ptr<Efficient_ransac::Shape> shape = *it;
 
     // Use Shape_base::info() to print the parameters of the detected shape.
     std::cout << (*it)->info();
diff --git a/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC.h b/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC.h
index 53331b8d7091..3612ac02c705 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC.h
@@ -37,7 +37,7 @@
 
 // boost --------------
 #include <CGAL/boost/iterator/counting_iterator.hpp>
-#include <boost/shared_ptr.hpp>
+#include <memory>
 #include <boost/make_shared.hpp>
 //---------------------
 
@@ -104,36 +104,36 @@ class Efficient_RANSAC {
 
 #ifdef DOXYGEN_RUNNING
   typedef unspecified_type Shape_range;
-  ///< `Iterator_range` with a bidirectional constant iterator type with value type `boost::shared_ptr<Shape>`.
+  ///< `Iterator_range` with a bidirectional constant iterator type with value type `std::shared_ptr<Shape>`.
   typedef unspecified_type Plane_range;
-  ///< `Iterator_range` with a bidirectional constant iterator type with value type `boost::shared_ptr<Plane_shape>`.
+  ///< `Iterator_range` with a bidirectional constant iterator type with value type `std::shared_ptr<Plane_shape>`.
 #else
 
   struct Shape_range : public Iterator_range<
-          typename std::vector<boost::shared_ptr<Shape> >::const_iterator> {
+          typename std::vector<std::shared_ptr<Shape> >::const_iterator> {
     typedef Iterator_range<
-            typename std::vector<boost::shared_ptr<Shape> >::const_iterator> Base;
+            typename std::vector<std::shared_ptr<Shape> >::const_iterator> Base;
 
-    Shape_range(boost::shared_ptr<std::vector<boost::shared_ptr<Shape> > >
+    Shape_range(std::shared_ptr<std::vector<std::shared_ptr<Shape> > >
                 extracted_shapes) : Base(make_range(extracted_shapes->begin(),
                                                     extracted_shapes->end())), m_extracted_shapes(extracted_shapes) {}
 
   private:
-    boost::shared_ptr<std::vector<boost::shared_ptr<Shape> > >
+    std::shared_ptr<std::vector<std::shared_ptr<Shape> > >
             m_extracted_shapes; // keeps a reference to the shape vector
   };
 
   struct Plane_range : public Iterator_range<
-          typename std::vector<boost::shared_ptr<Plane_shape> >::const_iterator> {
+          typename std::vector<std::shared_ptr<Plane_shape> >::const_iterator> {
     typedef Iterator_range<
-            typename std::vector<boost::shared_ptr<Plane_shape> >::const_iterator> Base;
+            typename std::vector<std::shared_ptr<Plane_shape> >::const_iterator> Base;
 
-    Plane_range(boost::shared_ptr<std::vector<boost::shared_ptr<Plane_shape> > >
+    Plane_range(std::shared_ptr<std::vector<std::shared_ptr<Plane_shape> > >
                 extracted_shapes) : Base(make_range(extracted_shapes->begin(),
                                                     extracted_shapes->end())), m_extracted_shapes(extracted_shapes) {}
 
   private:
-    boost::shared_ptr<std::vector<boost::shared_ptr<Plane_shape> > >
+    std::shared_ptr<std::vector<std::shared_ptr<Plane_shape> > >
             m_extracted_shapes; // keeps a reference to the shape vector
   };
 
@@ -291,7 +291,7 @@ class Efficient_RANSAC {
     clear();
 
     m_extracted_shapes =
-            boost::make_shared<std::vector<boost::shared_ptr<Shape> > >();
+            std::make_shared<std::vector<std::shared_ptr<Shape> > >();
 
     m_num_available_points = m_num_total_points = std::distance(
             m_input_iterator_first, m_input_iterator_beyond);
@@ -435,7 +435,7 @@ class Efficient_RANSAC {
     std::vector<int>().swap(m_shape_index);
 
     m_extracted_shapes =
-            boost::make_shared<std::vector<boost::shared_ptr<Shape> > >();
+            std::make_shared<std::vector<std::shared_ptr<Shape> > >();
 
     m_num_available_points = m_num_total_points;
 
@@ -488,7 +488,7 @@ class Efficient_RANSAC {
 
     // Reset data structures possibly used by former search
     m_extracted_shapes =
-            boost::make_shared<std::vector<boost::shared_ptr<Shape> > >();
+            std::make_shared<std::vector<std::shared_ptr<Shape> > >();
     m_num_available_points = m_num_total_points;
 
     for (std::size_t i = 0; i < m_num_subsets; i++) {
@@ -755,7 +755,7 @@ class Efficient_RANSAC {
 
         //1. add best candidate to final result.
         m_extracted_shapes->push_back(
-                boost::shared_ptr<Shape>(best_candidate));
+                std::shared_ptr<Shape>(best_candidate));
 
         if (callback && !callback(num_invalid / double(m_num_total_points))) {
           clear(num_invalid, candidates);
@@ -874,7 +874,7 @@ class Efficient_RANSAC {
   /// @{
   /*!
     Returns an `Iterator_range` with a bidirectional iterator with value type
-    `boost::shared_ptr<Shape>` over the detected shapes in the order of detection.
+    `std::shared_ptr<Shape>` over the detected shapes in the order of detection.
     Depending on the chosen probability
     for the detection, the shapes are ordered with decreasing size.
   */
@@ -884,21 +884,21 @@ class Efficient_RANSAC {
 
   /*!
     Returns an `Iterator_range` with a bidirectional iterator with
-    value type `boost::shared_ptr<Plane_shape>` over only the
+    value type `std::shared_ptr<Plane_shape>` over only the
     detected planes in the order of detection.  Depending on the
     chosen probability for the detection, the planes are ordered
     with decreasing size.
   */
   Plane_range planes() const {
-    boost::shared_ptr<std::vector<boost::shared_ptr<Plane_shape> > > planes
-            = boost::make_shared<std::vector<boost::shared_ptr<Plane_shape> > >();
+    std::shared_ptr<std::vector<std::shared_ptr<Plane_shape> > > planes
+            = std::make_shared<std::vector<std::shared_ptr<Plane_shape> > >();
 
     for (std::size_t i = 0; i < m_extracted_shapes->size(); ++i) {
-      boost::shared_ptr<Plane_shape> pshape
+      std::shared_ptr<Plane_shape> pshape
               = boost::dynamic_pointer_cast<Plane_shape>((*m_extracted_shapes)[i]);
 
       // Ignore all shapes other than plane
-      if (pshape != boost::shared_ptr<Plane_shape>())
+      if (pshape != std::shared_ptr<Plane_shape>())
         planes->push_back(pshape);
     }
     return Plane_range(planes);
@@ -1218,7 +1218,7 @@ class Efficient_RANSAC {
   //give the index of the subset of point i
   std::vector<int> m_index_subsets;
 
-  boost::shared_ptr<std::vector<boost::shared_ptr<Shape> > > m_extracted_shapes;
+  std::shared_ptr<std::vector<std::shared_ptr<Shape> > > m_extracted_shapes;
 
   std::vector<Shape *(*)()> m_shape_factories;
 
diff --git a/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/property_map.h b/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/property_map.h
index 3fb4ecea249b..774a21437cc9 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/property_map.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/property_map.h
@@ -31,7 +31,7 @@ namespace Shape_detection {
   class Point_to_shape_index_map
   {
     typedef CGAL::Shape_detection::Shape_base<Traits> Shape;
-    boost::shared_ptr<std::vector<int> > m_indices;
+    std::shared_ptr<std::vector<int> > m_indices;
 
   public:
     typedef std::size_t key_type; ///< %Index of the point in the random access point range.
@@ -50,7 +50,7 @@ namespace Shape_detection {
 
       \tparam ShapeRange must be an `Iterator_range` with a bidirectional
       constant iterator type with value type
-      `boost::shared_ptr<CGAL::Shape_detection::Shape_base<Traits> >`.
+      `std::shared_ptr<CGAL::Shape_detection::Shape_base<Traits> >`.
      */
     template <typename PointRange, typename ShapeRange>
     Point_to_shape_index_map (const PointRange& points,
@@ -85,7 +85,7 @@ namespace Shape_detection {
   {
   public:
     typedef CGAL::Shape_detection::Plane<Traits> Plane_shape;
-    typedef boost::shared_ptr<Plane_shape> key_type;
+    typedef std::shared_ptr<Plane_shape> key_type;
     typedef typename Traits::Plane_3 value_type;
     typedef value_type reference;
     typedef boost::read_write_property_map_tag category;
diff --git a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cone_parameters.cpp b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cone_parameters.cpp
index 39ac55d03fc9..e907bbbfe0be 100644
--- a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cone_parameters.cpp
+++ b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cone_parameters.cpp
@@ -74,7 +74,7 @@ bool test_cone_parameters() {
     if (shapes.size() != 1)
       continue;
 
-    boost::shared_ptr<Cone> cone = boost::dynamic_pointer_cast<Cone>((*shapes.first));
+    std::shared_ptr<Cone> cone = boost::dynamic_pointer_cast<Cone>((*shapes.first));
 
     // Check: shape detected is a cone.
     if (!cone)
diff --git a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cylinder_parameters.cpp b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cylinder_parameters.cpp
index 67cbbf249588..4d05c98d0681 100644
--- a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cylinder_parameters.cpp
+++ b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cylinder_parameters.cpp
@@ -73,7 +73,7 @@ bool test_cylinder_parameters() {
     if (shapes.size() != 1)
       continue;
 
-    boost::shared_ptr<Cylinder> cyl = boost::dynamic_pointer_cast<Cylinder>((*shapes.first));
+    std::shared_ptr<Cylinder> cyl = boost::dynamic_pointer_cast<Cylinder>((*shapes.first));
 
     // Check: shape detected is a cylinder.
     if (!cyl)
diff --git a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_plane_parameters.cpp b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_plane_parameters.cpp
index b963ed1e6364..e47a2f472161 100644
--- a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_plane_parameters.cpp
+++ b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_plane_parameters.cpp
@@ -67,7 +67,7 @@ bool test_plane_parameters() {
     if (shapes.size() != 1)
       continue;
 
-    boost::shared_ptr<Plane> pl = boost::dynamic_pointer_cast<Plane>((*shapes.first));
+    std::shared_ptr<Plane> pl = boost::dynamic_pointer_cast<Plane>((*shapes.first));
 
     if (!pl)
       continue;
diff --git a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_scene.cpp b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_scene.cpp
index fbe007b13c79..e78e2e3ca5a2 100644
--- a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_scene.cpp
+++ b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_scene.cpp
@@ -75,7 +75,7 @@ bool test_scene(int argc, char** argv) {
 
   // Iterate through all shapes and access each point.
   while (it != shapes.end()) {
-    boost::shared_ptr<typename Efficient_ransac::Shape> shape = *it;
+    std::shared_ptr<typename Efficient_ransac::Shape> shape = *it;
 
     // Sum distances of points to detected shapes.
     FT sum_distances = 0;
diff --git a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_sphere_parameters.cpp b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_sphere_parameters.cpp
index 0dbc63bb9de1..c6dcb0e0999a 100644
--- a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_sphere_parameters.cpp
+++ b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_sphere_parameters.cpp
@@ -70,7 +70,7 @@ bool test_sphere_parameters() {
     if (shapes.size() != 1)
       continue;
 
-    boost::shared_ptr<Sphere> sphere = boost::dynamic_pointer_cast<Sphere>((*shapes.first));
+    std::shared_ptr<Sphere> sphere = boost::dynamic_pointer_cast<Sphere>((*shapes.first));
 
     // Check: shape detected is a cylinder.
     if (!sphere)
diff --git a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_torus_parameters.cpp b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_torus_parameters.cpp
index 42138f178ffb..c380d26c7f95 100644
--- a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_torus_parameters.cpp
+++ b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_torus_parameters.cpp
@@ -72,7 +72,7 @@ bool test_torus_parameters() {
     if (shapes.size() != 1)
       continue;
 
-    boost::shared_ptr<Torus> torus =
+    std::shared_ptr<Torus> torus =
       boost::dynamic_pointer_cast<Torus>((*shapes.first));
 
     // Check: shape detected is a torus.
diff --git a/Straight_skeleton_2/benchmark/Straight_skeleton_2/compare_kernels_simple_polygon_skeleton.cpp b/Straight_skeleton_2/benchmark/Straight_skeleton_2/compare_kernels_simple_polygon_skeleton.cpp
index c75bc824e4b5..45b78c18a09b 100644
--- a/Straight_skeleton_2/benchmark/Straight_skeleton_2/compare_kernels_simple_polygon_skeleton.cpp
+++ b/Straight_skeleton_2/benchmark/Straight_skeleton_2/compare_kernels_simple_polygon_skeleton.cpp
@@ -10,7 +10,7 @@
 #include <CGAL/Straight_skeleton_2.h>
 #include <CGAL/Straight_skeleton_builder_traits_2.h>
 #include <CGAL/Straight_skeleton_builder_2.h>
-#include <boost/shared_ptr.hpp>
+#include <memory>
 #include <CGAL/gmp.h>
 #include <CGAL/Timer.h>
 
@@ -97,7 +97,7 @@ void build_skeleton(const char* fname)
   time.start();
   SsBuilder ssb;
   ssb.enter_contour(pgn.vertices_begin(), pgn.vertices_end());
-  boost::shared_ptr<Ss> straight_ske = ssb.construct_skeleton();
+  std::shared_ptr<Ss> straight_ske = ssb.construct_skeleton();
   time.stop();
 
   std::cout << "Time spent to build skeleton " << time.time() << "\n";
diff --git a/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton.cpp b/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton.cpp
index c20f36018839..206d7fdaeca5 100644
--- a/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton.cpp
+++ b/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton.cpp
@@ -1,7 +1,5 @@
 #include<vector>
 
-#include<boost/shared_ptr.hpp>
-
 #include<CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include<CGAL/Polygon_2.h>
 #include<CGAL/create_offset_polygons_2.h>
@@ -13,8 +11,8 @@ typedef K::Point_2                   Point ;
 typedef CGAL::Polygon_2<K>           Polygon_2 ;
 typedef CGAL::Straight_skeleton_2<K> Ss ;
 
-typedef boost::shared_ptr<Polygon_2> PolygonPtr ;
-typedef boost::shared_ptr<Ss> SsPtr ;
+typedef std::shared_ptr<Polygon_2> PolygonPtr ;
+typedef std::shared_ptr<Ss> SsPtr ;
 
 typedef std::vector<PolygonPtr> PolygonPtrVector ;
 
diff --git a/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton_tweaking_skeleton.cpp b/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton_tweaking_skeleton.cpp
index 0f8da09cbfc7..438017f36f6a 100644
--- a/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton_tweaking_skeleton.cpp
+++ b/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton_tweaking_skeleton.cpp
@@ -1,7 +1,5 @@
 #include<vector>
 
-#include<boost/shared_ptr.hpp>
-
 #include<CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include<CGAL/Polygon_2.h>
 #include<CGAL/create_offset_polygons_2.h>
@@ -13,8 +11,8 @@ typedef CGAL::Polygon_2<K>           Polygon_2 ;
 typedef CGAL::Straight_skeleton_2<K> Ss ;
 typedef Ss::Halfedge_const_iterator Halfedge_const_iterator ;
 
-typedef boost::shared_ptr<Polygon_2> PolygonPtr ;
-typedef boost::shared_ptr<Ss> SsPtr ;
+typedef std::shared_ptr<Polygon_2> PolygonPtr ;
+typedef std::shared_ptr<Ss> SsPtr ;
 
 typedef std::vector<PolygonPtr> PolygonPtrVector ;
 
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Polygon_offset_builder_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Polygon_offset_builder_2.h
index 3f4db57e8811..65cbf5cbb715 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Polygon_offset_builder_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Polygon_offset_builder_2.h
@@ -91,12 +91,12 @@ or external angle approaches `0`, numerical overflow may prevent some of the pol
 If that happens, the failed contour just won't be added into the resulting sequence.
 
 \tparam OutputIterator must be a model of the <I>OutputIterator</I> category whose `value_type`
-                       is a `boost::shared_ptr` holding the dynamically allocated instances of type `Container`.
+                       is a `std::shared_ptr` holding the dynamically allocated instances of type `Container`.
 
 \param t the offset value
 \param out an output iterator. For each resulting offset contour, a default constructed instance
            of `Container` type, is dynamically allocated and each offset vertex is added to it.
-           A `boost::shared_ptr` holding onto the dynamically allocated container is inserted
+           A `std::shared_ptr` holding onto the dynamically allocated container is inserted
            into the output sequence via the OutputIterator `out`.
 
 \returns an `OutputIterator` past-the-end of the resulting sequence, which contains each offset contour generated.
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h
index 0f832497438b..1c0c422aa365 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h
@@ -195,7 +195,7 @@ must be entered before calling `construct_skeleton()`.
 After `construct_skeleton()` completes, you cannot enter more contours and/or call `construct_skeleton()` again.
 If you need another straight skeleton for another polygon you must instantiate and use another builder.
 
-The result is a dynamically allocated instance of the `Ss` class, wrapped in a `boost::shared_ptr`.
+The result is a dynamically allocated instance of the `Ss` class, wrapped in a `std::shared_ptr`.
 
 If the construction process fails for whatever reason (such as a nearly-degenerate vertex whose internal
 or external angle is almost zero), the return value will be <I>null</I>, represented
@@ -204,7 +204,7 @@ by a default constructed `shared_ptr`.
 The algorithm automatically checks the consistency of the result, thus, if it is not <I>nullptr</I>,
 it is guaranteed to be valid.
 */
-boost::shared_ptr<Ss> construct_skeleton();
+std::shared_ptr<Ss> construct_skeleton();
 
 /// @}
 
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_converter_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_converter_2.h
index d3ff08ad9f40..a5ea28252e2f 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_converter_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_converter_2.h
@@ -14,7 +14,7 @@ using the items converter `ic` to convert the geometric embedding to the types o
 \sa `CGAL::Straight_skeleton_converter_2<SrcSs,TgtSs,ItemsCV>`
 */
 template <class Target_skeleton, class Source_skeleton, class Items_converter>
-boost::shared_ptr<Target_skeleton>
+std::shared_ptr<Target_skeleton>
 convert_straight_skeleton_2( Source_skeleton const& s,
                              Items_converted const& ic = Items_converter() );
 
@@ -77,7 +77,7 @@ Straight_skeleton_converter_2( const Items_converter& c = Items_converter() );
 /*!
 returns a new straight skeleton data structure with the same combinatorial and geometric data as `s` using the items converter to convert the geometric embeeding to the types of the target traits.
 */
-boost::shared_ptr<Target_skeleton> operator()( const Source_skeleton& s) const;
+std::shared_ptr<Target_skeleton> operator()( const Source_skeleton& s) const;
 
 /// @}
 
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/arrange_offset_polygons_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/arrange_offset_polygons_2.h
index 49c4814f04fa..9b558743b362 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/arrange_offset_polygons_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/arrange_offset_polygons_2.h
@@ -8,16 +8,16 @@ by `create_offset_polygons_2()` into 2D polygons with holes by determining geome
 relationships using a simple algorithm based on the particular characteristics of offset polygons.
 
 The function determines parent-hole relationships among the polygons given by `[begin,end]` creating
-`boost::shared_ptr< GeneralPolygonWithHoles_2 >` objects added to the output sequence given `out`.
+`std::shared_ptr< GeneralPolygonWithHoles_2 >` objects added to the output sequence given `out`.
 A `CLOCKWISE` oriented polygon `H` is a hole of a `COUNTERCLOCKWISE` polygon `P`, iff at least one vertex of `H` is `ON_BOUNDED_SIDE` of `P`.
 
 This function should not be used to arrange arbitrary polygons into polygons with holes unless they meet the requirements specified below.
 
 \tparam K must be a model of `Kernel`.
 \tparam InputPolygonPtrIterator must be a model of `InputIterator` whose `value_type` is a smart pointer
-(such as `boost::shared_ptr`) whose `element_type` is a model of `SequenceContainer` with value type `K::Point_2`.
+(such as `std::shared_ptr`) whose `element_type` is a model of `SequenceContainer` with value type `K::Point_2`.
 \tparam OutputPolygonWithHolesPtrIterator must be a model of `OutputIterator` whose `value_type` is a smart pointer
-(such as `boost::shared_ptr`) whose `element_type` is a model of `GeneralPolygonWithHoles_2`.
+(such as `std::shared_ptr`) whose `element_type` is a model of `GeneralPolygonWithHoles_2`.
 
 \pre The input polygons must be simple.
 \pre The set of input polygons are unique and interior disjoint. That is, given distinct polygons
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_offset_polygons_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_offset_polygons_2.h
index 831b3967b62b..1d4b660c8a18 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_offset_polygons_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_offset_polygons_2.h
@@ -25,7 +25,7 @@ of a polygon with holes, the offset polygons will be generated in its exterior.
 \sa `Polygon_offset_builder_2<Ss,Traits,Container>`
 */
 template<class OfKPolygon, class FT, class StraightSkeleton, class OfK>
-std::vector< boost::shared_ptr<OfKPolygon> >
+std::vector< std::shared_ptr<OfKPolygon> >
 create_offset_polygons_2 ( FT offset,
                            const StraightSkeleton& s,
                            OfK k = Exact_predicates_inexact_constructions_kernel ) ;
@@ -63,7 +63,7 @@ polygons to be constructed.
 \sa `Polygon_offset_builder_2<Ss,Traits,Container>`
 */
 template<class OfKPolygon, class FT, class InKPolygon, class OfK, class SsK>
-std::vector< boost::shared_ptr<OfKPolygon> >
+std::vector< std::shared_ptr<OfKPolygon> >
 create_exterior_skeleton_and_offset_polygons_2( FT offset,
                                                 const InKPolygon& poly,
                                                 OfK ofk = Exact_predicates_inexact_constructions_kernel,
@@ -100,7 +100,7 @@ and `create_offset_polygons_2()` instead.
 \sa `Polygon_offset_builder_2<Ss,Traits,Container>`
 */
 template<class OfKPolygon, class FT, class InKPolygon, class HoleIterator, class OfK, class SsK>
-std::vector< boost::shared_ptr<OfKPolygon> >
+std::vector< std::shared_ptr<OfKPolygon> >
 create_interior_skeleton_and_offset_polygons_2 ( FT offset,
                                                  const InKPolygon& outer_boundary,
                                                  HoleIterator holes_begin,
@@ -135,7 +135,7 @@ and `create_offset_polygons_2()` instead.
 \sa `Polygon_offset_builder_2<Ss,Traits,Container>`
 */
 template<class OfKPolygon, class FT, class InKPolygon, class OfK, class SsK>
-std::vector< boost::shared_ptr<OfKPolygon> >
+std::vector< std::shared_ptr<OfKPolygon> >
 create_interior_skeleton_and_offset_polygons_2 ( FT offset,
                                                  const InKPolygon& poly,
                                                  OfK ofk = CGAL::Exact_predicates_inexact_constructions_kernel,
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_offset_polygons_from_polygon_with_holes_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_offset_polygons_from_polygon_with_holes_2.h
index b2eea3ecf4b9..ea2025cb49e0 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_offset_polygons_from_polygon_with_holes_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_offset_polygons_from_polygon_with_holes_2.h
@@ -25,7 +25,7 @@ This is equivalent to `arrange_offset_polygons_2(create_interior_skeleton_and_of
 \sa `Polygon_offset_builder_2<Ss,Traits,Container>`
 */
 template<class OfKPolygon, class FT, class InKPolygon, class OfK, class SsK>
-std::vector< boost::shared_ptr< OfKPolygon > >
+std::vector< std::shared_ptr< OfKPolygon > >
 create_interior_skeleton_and_offset_polygons_with_holes_2(FT offset,
                                                           const InKPolygon& poly_with_holes,
                                                           OfK ofk = CGAL::Exact_predicates_inexact_constructions_kernel,
@@ -63,7 +63,7 @@ having reversed the orientation of all other polygons.
 \sa `Polygon_offset_builder_2<Ss,Traits,Container>`
 */
 template<class OfKPolygon, class FT, class InKPolygon, class OfK, class SsK>
-std::vector<boost::shared_ptr<OfKPolygon> >
+std::vector<std::shared_ptr<OfKPolygon> >
 create_exterior_skeleton_and_offset_polygons_with_holes_2(FT offset,
                                                           const InKPolygon& poly_with_holes,
                                                           OfK ofk = Exact_predicates_inexact_constructions_kernel,
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_straight_skeleton_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_straight_skeleton_2.h
index 3840424cd213..7d175b73f984 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_straight_skeleton_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/create_straight_skeleton_2.h
@@ -26,7 +26,7 @@ from this exterior skeleton, as computed by the function `compute_outer_frame_ma
 \sa `CGAL::Straight_skeleton_builder_2<Traits,Ss,Visitor>`
 */
 template<class FT, class PointIterator, class SsK>
-boost::shared_ptr< Straight_skeleton_2<SsK> >
+std::shared_ptr< Straight_skeleton_2<SsK> >
 create_exterior_straight_skeleton_2( FT max_offset,
                                      PointIterator vertices_begin,
                                      PointIterator vertices_end,
@@ -56,7 +56,7 @@ from this exterior skeleton, as computed by the function `compute_outer_frame_ma
 \sa `CGAL::Straight_skeleton_builder_2<Traits,Ss,Visitor>`
 */
 template<class FT, class Polygon, class SsK>
-boost::shared_ptr< Straight_skeleton_2<SsK> >
+std::shared_ptr< Straight_skeleton_2<SsK> >
 create_exterior_straight_skeleton_2 ( FT max_offset,
                                       const Polygon& P,
                                       SsK k = CGAL::Exact_predicates_inexact_constructions_kernel ) ;
@@ -82,7 +82,7 @@ holes given by `[holes_begin,holes_end]`.
 \sa `CGAL::Straight_skeleton_builder_2<Traits,Ss,Visitor>`
 */
 template<class PointIterator, class HoleIterator, class SsK>
-boost::shared_ptr< Straight_skeleton_2<SsK> >
+std::shared_ptr< Straight_skeleton_2<SsK> >
 create_interior_straight_skeleton_2 ( PointIterator outer_contour_vertices_begin,
                                       PointIterator outer_contour_vertices_end,
                                       HoleIterator holes_begin,
@@ -105,7 +105,7 @@ polygon whose outer boundary is given by the point sequence
 \sa `CGAL::Straight_skeleton_builder_2<Traits,Ss,Visitor>`
 */
 template<class PointIterator, class SsK>
-boost::shared_ptr< Straight_skeleton_2<SsK> >
+std::shared_ptr< Straight_skeleton_2<SsK> >
 create_interior_straight_skeleton_2 ( PointIterator outer_contour_vertices_begin,
                                       PointIterator outer_contour_vertices_end,
                                       SsK k = CGAL::Exact_predicates_inexact_constructions_kernel ) ;
@@ -127,7 +127,7 @@ polygon `outer_contour`.
 \sa `CGAL::Straight_skeleton_builder_2<Traits,Ss,Visitor>`
 */
 template<class Polygon, class SsK>
-boost::shared_ptr< Straight_skeleton_2<SsK> >
+std::shared_ptr< Straight_skeleton_2<SsK> >
 create_interior_straight_skeleton_2 ( const Polygon& outer_contour,
                                       SsK k = CGAL::Exact_predicates_inexact_constructions_kernel ) ;
 
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Straight_skeleton_2.txt b/Straight_skeleton_2/doc/Straight_skeleton_2/Straight_skeleton_2.txt
index 30063a178b51..0c05bf7e5e22 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Straight_skeleton_2.txt
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Straight_skeleton_2.txt
@@ -368,11 +368,11 @@ To construct a set of inward offset contours the user must:
 
 (3) Call `Polygon_offset_builder_2::construct_offset_contours()` passing the desired offset
 distance and an output iterator that can store a
-`boost::shared_ptr` of `Container` instances
+`std::shared_ptr` of `Container` instances
 into a resulting sequence (typically, a back insertion iterator)
 
 Each element in the resulting sequence is an <I>offset contour</I>, given by
-a `boost::shared_ptr` holding a dynamically allocated instance
+a `std::shared_ptr` holding a dynamically allocated instance
 of the Container type. Such a container can be any model of the
 `SequenceContainer` concept, for example, a `CGAL::Polygon_2`,
 or just a `std::vector` of 2D points.
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_offset_polygons_2.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_offset_polygons_2.cpp
index fed811266216..f89d23f00187 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_offset_polygons_2.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_offset_polygons_2.cpp
@@ -4,7 +4,7 @@
 #include <CGAL/create_offset_polygons_2.h>
 #include "print.h"
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <vector>
 #include <cassert>
@@ -15,8 +15,8 @@ typedef K::Point_2                   Point ;
 typedef CGAL::Polygon_2<K>           Polygon_2 ;
 typedef CGAL::Straight_skeleton_2<K> Ss ;
 
-typedef boost::shared_ptr<Polygon_2> PolygonPtr ;
-typedef boost::shared_ptr<Ss> SsPtr ;
+typedef std::shared_ptr<Polygon_2> PolygonPtr ;
+typedef std::shared_ptr<Ss> SsPtr ;
 
 typedef std::vector<PolygonPtr> PolygonPtrVector ;
 
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_saop_from_polygon_with_holes_2.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_saop_from_polygon_with_holes_2.cpp
index 95eca620ae7a..ba3e555ec094 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_saop_from_polygon_with_holes_2.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_saop_from_polygon_with_holes_2.cpp
@@ -4,7 +4,7 @@
 #include <CGAL/create_offset_polygons_from_polygon_with_holes_2.h>
 #include "print.h"
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <cassert>
 #include <vector>
@@ -16,8 +16,8 @@ typedef CGAL::Polygon_2<K>            Polygon_2 ;
 typedef CGAL::Polygon_with_holes_2<K> Polygon_with_holes ;
 typedef CGAL::Straight_skeleton_2<K>  Ss ;
 
-typedef boost::shared_ptr<Polygon_2> PolygonPtr ;
-typedef boost::shared_ptr<Ss> SsPtr ;
+typedef std::shared_ptr<Polygon_2> PolygonPtr ;
+typedef std::shared_ptr<Ss> SsPtr ;
 
 typedef std::vector<PolygonPtr> PolygonPtrVector ;
 
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_skeleton_and_offset_polygons_2.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_skeleton_and_offset_polygons_2.cpp
index d0b1a979669b..572814f66820 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_skeleton_and_offset_polygons_2.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_skeleton_and_offset_polygons_2.cpp
@@ -4,7 +4,7 @@
 #include <CGAL/create_offset_polygons_2.h>
 #include "print.h"
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <cassert>
 #include <vector>
@@ -16,8 +16,8 @@ typedef K::Point_2                   Point ;
 typedef CGAL::Polygon_2<K>           Polygon_2 ;
 typedef CGAL::Straight_skeleton_2<K> Ss ;
 
-typedef boost::shared_ptr<Polygon_2> PolygonPtr ;
-typedef boost::shared_ptr<Ss> SsPtr ;
+typedef std::shared_ptr<Polygon_2> PolygonPtr ;
+typedef std::shared_ptr<Ss> SsPtr ;
 
 typedef std::vector<PolygonPtr> PolygonPtrVector ;
 
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_skeleton_and_offset_polygons_with_holes_2.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_skeleton_and_offset_polygons_with_holes_2.cpp
index bf91a2de00d8..2bdd31e75f74 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_skeleton_and_offset_polygons_with_holes_2.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_skeleton_and_offset_polygons_with_holes_2.cpp
@@ -4,7 +4,7 @@
 #include <CGAL/create_offset_polygons_from_polygon_with_holes_2.h>
 #include "print.h"
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <vector>
 #include <cassert>
@@ -15,7 +15,7 @@ typedef K::Point_2                    Point ;
 typedef CGAL::Polygon_2<K>            Polygon_2 ;
 typedef CGAL::Polygon_with_holes_2<K> PolygonWithHoles ;
 
-typedef boost::shared_ptr<PolygonWithHoles> PolygonWithHolesPtr ;
+typedef std::shared_ptr<PolygonWithHoles> PolygonWithHolesPtr ;
 
 typedef std::vector<PolygonWithHolesPtr> PolygonWithHolesPtrVector;
 
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_straight_skeleton_2.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_straight_skeleton_2.cpp
index ce2e11e57f9a..08e57f794af0 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_straight_skeleton_2.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_straight_skeleton_2.cpp
@@ -4,8 +4,6 @@
 #include<CGAL/create_straight_skeleton_2.h>
 #include "print.h"
 
-#include<boost/shared_ptr.hpp>
-
 #include <cassert>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel K ;
@@ -14,7 +12,7 @@ typedef K::Point_2                   Point ;
 typedef CGAL::Polygon_2<K>           Polygon_2 ;
 typedef CGAL::Straight_skeleton_2<K> Ss ;
 
-typedef boost::shared_ptr<Ss> SsPtr ;
+typedef std::shared_ptr<Ss> SsPtr ;
 
 int main()
 {
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_straight_skeleton_from_polygon_with_holes_2.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_straight_skeleton_from_polygon_with_holes_2.cpp
index 3dfe3b48437b..98dc57fac285 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/Create_straight_skeleton_from_polygon_with_holes_2.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/Create_straight_skeleton_from_polygon_with_holes_2.cpp
@@ -4,7 +4,7 @@
 #include <CGAL/create_straight_skeleton_from_polygon_with_holes_2.h>
 #include "print.h"
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <cassert>
 
@@ -15,7 +15,7 @@ typedef CGAL::Polygon_2<K>            Polygon_2 ;
 typedef CGAL::Polygon_with_holes_2<K> Polygon_with_holes ;
 typedef CGAL::Straight_skeleton_2<K>  Ss ;
 
-typedef boost::shared_ptr<Ss> SsPtr ;
+typedef std::shared_ptr<Ss> SsPtr ;
 
 int main()
 {
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/Low_level_API.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/Low_level_API.cpp
index 798228788ba0..52e405a4dd31 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/Low_level_API.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/Low_level_API.cpp
@@ -7,7 +7,7 @@
 #include <CGAL/compute_outer_frame_margin.h>
 #include "print.h"
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <vector>
 #include <cassert>
@@ -22,7 +22,7 @@ typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
 
 typedef Kernel::Point_2 Point_2;
 typedef CGAL::Polygon_2<Kernel>    Contour;
-typedef boost::shared_ptr<Contour> ContourPtr;
+typedef std::shared_ptr<Contour> ContourPtr;
 typedef std::vector<ContourPtr>    ContourSequence ;
 
 typedef CGAL::Straight_skeleton_2<Kernel> Ss;
@@ -97,7 +97,7 @@ int main()
     ssb.enter_contour(star.rbegin(),star.rend());
 
     // Construct the skeleton
-    boost::shared_ptr<Ss> ss = ssb.construct_skeleton();
+    std::shared_ptr<Ss> ss = ssb.construct_skeleton();
 
     // Proceed only if the skeleton was correctly constructed.
     if ( ss )
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/Show_offset_polygon.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/Show_offset_polygon.cpp
index 296d721cc40f..8a35567dafd5 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/Show_offset_polygon.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/Show_offset_polygon.cpp
@@ -4,7 +4,7 @@
 #include <CGAL/create_offset_polygons_from_polygon_with_holes_2.h>
 #include "dump_to_eps.h"
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <cassert>
 #include <fstream>
@@ -16,7 +16,7 @@ typedef CGAL::Exact_predicates_inexact_constructions_kernel K ;
 
 typedef CGAL::Polygon_with_holes_2<K> Polygon_with_holes ;
 
-typedef boost::shared_ptr<Polygon_with_holes> Polygon_with_holes_ptr ;
+typedef std::shared_ptr<Polygon_with_holes> Polygon_with_holes_ptr ;
 
 typedef std::vector<Polygon_with_holes_ptr> Polygon_with_holes_ptr_vector ;
 
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/Show_straight_skeleton.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/Show_straight_skeleton.cpp
index 080749ec9628..1273b49f7851 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/Show_straight_skeleton.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/Show_straight_skeleton.cpp
@@ -6,8 +6,6 @@
 #include <fstream>
 #include <cassert>
 
-#include<boost/shared_ptr.hpp>
-
 #include<CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include<CGAL/Polygon_with_holes_2.h>
 #include<CGAL/create_straight_skeleton_from_polygon_with_holes_2.h>
@@ -21,7 +19,7 @@ typedef CGAL::Polygon_2<K>            Polygon_2 ;
 typedef CGAL::Polygon_with_holes_2<K> Polygon_with_holes ;
 typedef CGAL::Straight_skeleton_2<K>  Straight_skeleton ;
 
-typedef boost::shared_ptr<Straight_skeleton> Straight_skeleton_ptr ;
+typedef std::shared_ptr<Straight_skeleton> Straight_skeleton_ptr ;
 
 int main( int argc, char* argv[] )
 {
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/draw_straight_skeleton_2.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/draw_straight_skeleton_2.cpp
index c86c3f4593e6..96f3da42c1d2 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/draw_straight_skeleton_2.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/draw_straight_skeleton_2.cpp
@@ -4,8 +4,6 @@
 #include <CGAL/create_straight_skeleton_2.h>
 #include <CGAL/draw_straight_skeleton_2.h>
 
-#include<boost/shared_ptr.hpp>
-
 #include <cassert>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel K ;
@@ -14,7 +12,7 @@ typedef K::Point_2                   Point ;
 typedef CGAL::Polygon_2<K>           Polygon_2 ;
 typedef CGAL::Straight_skeleton_2<K> Ss ;
 
-typedef boost::shared_ptr<Ss> SsPtr ;
+typedef std::shared_ptr<Ss> SsPtr ;
 
 int main()
 {
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/dump_to_eps.h b/Straight_skeleton_2/examples/Straight_skeleton_2/dump_to_eps.h
index 5e94bf72b3dd..efc8694a9212 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/dump_to_eps.h
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/dump_to_eps.h
@@ -84,11 +84,11 @@ void dump_to_eps( CGAL::Straight_skeleton_2<K> const& aSkeleton, char const* aTy
 
 template<class K, class C>
 void dump_to_eps ( CGAL::Polygon_with_holes_2<K,C> const&                                     aInput
-                 , std::vector< boost::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > const& aOutput
+                 , std::vector< std::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > const& aOutput
                  , std::ostream&                                                            rOut
                  )
 {
-  typedef std::vector< boost::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > PolyWH_vector ;
+  typedef std::vector< std::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > PolyWH_vector ;
 
   CGAL::Bbox_2 lBbox = CGAL::bbox_2(aInput);
 
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/exterior_offset_of_multiple_polygons_with_holes.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/exterior_offset_of_multiple_polygons_with_holes.cpp
index f6e0a86a9312..d2da4691924c 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/exterior_offset_of_multiple_polygons_with_holes.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/exterior_offset_of_multiple_polygons_with_holes.cpp
@@ -3,7 +3,7 @@
 #include <CGAL/Polygon_with_holes_2.h>
 #include <CGAL/create_offset_polygons_from_polygon_with_holes_2.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <CGAL/draw_polygon_with_holes_2.h>
 
@@ -17,8 +17,8 @@ typedef K::Point_2                    Point ;
 typedef CGAL::Polygon_2<K>            Polygon_2 ;
 typedef CGAL::Polygon_with_holes_2<K> PolygonWithHoles ;
 
-typedef boost::shared_ptr<PolygonWithHoles> PolygonWithHolesPtr ;
-typedef boost::shared_ptr<Polygon_2> PolygonPtr ;
+typedef std::shared_ptr<PolygonWithHoles> PolygonWithHolesPtr ;
+typedef std::shared_ptr<Polygon_2> PolygonPtr ;
 
 typedef std::vector<PolygonWithHolesPtr> PolygonWithHolesPtrVector;
 typedef std::vector<PolygonPtr> PolygonPtrVector;
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/print.h b/Straight_skeleton_2/examples/Straight_skeleton_2/print.h
index 4afc5e4a3bd5..216e11f0dd6c 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/print.h
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/print.h
@@ -21,9 +21,9 @@ void print_polygon ( CGAL::Polygon_2<K,C> const& poly )
 }
 
 template<class K, class C>
-void print_polygons ( std::vector< boost::shared_ptr< CGAL::Polygon_2<K,C> > > const& polies )
+void print_polygons ( std::vector< std::shared_ptr< CGAL::Polygon_2<K,C> > > const& polies )
 {
-  typedef std::vector< boost::shared_ptr< CGAL::Polygon_2<K,C> > > PolygonVector ;
+  typedef std::vector< std::shared_ptr< CGAL::Polygon_2<K,C> > > PolygonVector ;
 
   std::cout << "Polygon list with " << polies.size() << " polygons" << std::endl ;
 
@@ -45,10 +45,10 @@ void print_polygon_with_holes ( CGAL::Polygon_with_holes_2<K,C> const& polywh )
 }
 
 template<class K, class C>
-void print_polygons_with_holes ( std::vector< boost::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > const& polies )
+void print_polygons_with_holes ( std::vector< std::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > const& polies )
 {
 
-  typedef std::vector< boost::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > PolygonWithHolesVector ;
+  typedef std::vector< std::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > PolygonWithHolesVector ;
 
   std::cout << "Polygon_with_holes list with " << polies.size() << " element" << std::endl ;
 
diff --git a/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_2.h b/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_2.h
index 9d498c8f7ea5..3ddac56aa28d 100644
--- a/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_2.h
+++ b/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_2.h
@@ -17,7 +17,7 @@
 #include <CGAL/Polygon_offset_builder_traits_2.h>
 
 #include <boost/optional/optional.hpp>
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <vector>
 
@@ -71,7 +71,7 @@ public :
 
   typedef boost::optional<Point_2> OptionalPoint_2 ;
 
-  typedef boost::shared_ptr<Container> ContainerPtr ;
+  typedef std::shared_ptr<Container> ContainerPtr ;
 
   Polygon_offset_builder_2( Ss const& aSs, Traits const& aTraits = Traits(), Visitor const& aVisitor = Visitor() )  ;
 
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Polygon_iterators.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Polygon_iterators.h
index 4740194987b2..04aa6864b4cd 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Polygon_iterators.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Polygon_iterators.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/Polygon_with_holes_2.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 namespace CGAL {
 namespace CGAL_SS_i {
@@ -33,11 +33,11 @@ inline typename Poly::const_iterator vertices_end ( Poly const& aPoly )
 { return aPoly.end() ; }
 
 template<class Poly>
-inline typename Poly::const_iterator vertices_begin ( boost::shared_ptr<Poly> const& aPoly )
+inline typename Poly::const_iterator vertices_begin ( std::shared_ptr<Poly> const& aPoly )
 { return aPoly->begin() ; }
 
 template<class Poly>
-inline typename Poly::const_iterator vertices_end ( boost::shared_ptr<Poly> const& aPoly )
+inline typename Poly::const_iterator vertices_end ( std::shared_ptr<Poly> const& aPoly )
 { return aPoly->end() ; }
 
 // Polygon_2
@@ -52,11 +52,11 @@ vertices_end( Polygon_2<K,C> const& aPoly )
 { return aPoly.vertices_end() ; }
 
 template<class K, class C>
-inline typename Polygon_2<K,C>::Vertex_const_iterator vertices_begin ( boost::shared_ptr<Polygon_2<K,C> > const& aPoly )
+inline typename Polygon_2<K,C>::Vertex_const_iterator vertices_begin ( std::shared_ptr<Polygon_2<K,C> > const& aPoly )
 { return aPoly->vertices_begin() ; }
 
 template<class K, class C>
-inline typename Polygon_2<K,C>::Vertex_const_iterator vertices_end( boost::shared_ptr<Polygon_2<K,C> > const& aPoly )
+inline typename Polygon_2<K,C>::Vertex_const_iterator vertices_end( std::shared_ptr<Polygon_2<K,C> > const& aPoly )
 { return aPoly->vertices_end() ; }
 
 // Polygon_with_holes_2
@@ -72,12 +72,12 @@ vertices_end( Polygon_with_holes_2<K,C> const& aPoly )
 
 template<class K, class C>
 inline typename Polygon_with_holes_2<K,C>::Polygon_2::Vertex_const_iterator
-vertices_begin ( boost::shared_ptr<Polygon_with_holes_2<K,C> > const& aPoly )
+vertices_begin ( std::shared_ptr<Polygon_with_holes_2<K,C> > const& aPoly )
 { return aPoly->outer_boundary().vertices_begin() ; }
 
 template<class K, class C>
 inline typename Polygon_with_holes_2<K,C>::Polygon_2::Vertex_const_iterator
-vertices_end( boost::shared_ptr<Polygon_with_holes_2<K,C> > const& aPoly )
+vertices_end( std::shared_ptr<Polygon_with_holes_2<K,C> > const& aPoly )
 { return aPoly->outer_boundary().vertices_end() ; }
 
 } // namespace CGAL_SS_i
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_2.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_2.h
index c0fea4462de9..c7e3f77fbd7b 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_2.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_2.h
@@ -24,7 +24,7 @@
 
 #include <boost/tuple/tuple.hpp>
 #include <boost/intrusive_ptr.hpp>
-#include <boost/shared_ptr.hpp>
+#include <memory>
 #include <boost/scoped_ptr.hpp>
 #include <boost/mpl/bool.hpp>
 
@@ -111,7 +111,7 @@ class Straight_skeleton_builder_2
   typedef SSkel_   SSkel ;
   typedef Visitor_ Visitor ;
 
-  typedef boost::shared_ptr<SSkel> SSkelPtr ;
+  typedef std::shared_ptr<SSkel> SSkelPtr ;
 
 private :
 
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_converter_2.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_converter_2.h
index 650b1894a2a5..0665d6de3742 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_converter_2.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_converter_2.h
@@ -19,7 +19,7 @@
 #include <CGAL/assertions.h>
 #include <CGAL/Cartesian_converter.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 #include <boost/intrusive_ptr.hpp>
 
 #include <vector>
@@ -163,7 +163,7 @@ struct Straight_skeleton_converter_2
   typedef typename Source_skeleton::Traits Source_traits ;
   typedef typename Target_skeleton::Traits Target_traits ;
 
-  typedef boost::shared_ptr<Target_skeleton> Target_skeleton_ptr ;
+  typedef std::shared_ptr<Target_skeleton> Target_skeleton_ptr ;
 
   typedef typename Source_skeleton::Vertex_const_iterator   Source_vertex_const_iterator ;
   typedef typename Source_skeleton::Halfedge_const_iterator Source_halfedge_const_iterator ;
@@ -333,7 +333,7 @@ private :
 } ;
 
 template<class Target_skeleton, class Source_skeleton, class Items_converter>
-boost::shared_ptr<Target_skeleton>
+std::shared_ptr<Target_skeleton>
 convert_straight_skeleton_2 ( Source_skeleton const& aSrc, Items_converter const& ic )
 {
   typedef Straight_skeleton_converter_2<Source_skeleton,Target_skeleton,Items_converter> Skeleton_converter ;
@@ -345,7 +345,7 @@ convert_straight_skeleton_2 ( Source_skeleton const& aSrc, Items_converter const
 }
 
 template<class Target_skeleton, class Source_skeleton>
-boost::shared_ptr<Target_skeleton>
+std::shared_ptr<Target_skeleton>
 convert_straight_skeleton_2 ( Source_skeleton const& aSrc )
 {
   typedef Straight_skeleton_items_converter_2<Source_skeleton,Target_skeleton> Items_converter ;
diff --git a/Straight_skeleton_2/include/CGAL/arrange_offset_polygons_2.h b/Straight_skeleton_2/include/CGAL/arrange_offset_polygons_2.h
index 4ceae69e570c..840e0950b84f 100644
--- a/Straight_skeleton_2/include/CGAL/arrange_offset_polygons_2.h
+++ b/Straight_skeleton_2/include/CGAL/arrange_offset_polygons_2.h
@@ -20,7 +20,7 @@
 #include <CGAL/Polygon_with_holes_2.h>
 
 #include <boost/range/value_type.hpp>
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <algorithm>
 #include <iostream>
@@ -53,7 +53,7 @@ bool arrange_offset_polygons_2 ( InputPolygonPtrIterator           aBegin
   typedef typename std::iterator_traits<InputPolygonPtrIterator>::difference_type difference_type ;
   typedef typename std::iterator_traits<InputPolygonPtrIterator>::value_type PolygonPtr ;
 
-  typedef boost::shared_ptr<PolygonWithHoles> PolygonWithHolesPtr ;
+  typedef std::shared_ptr<PolygonWithHoles> PolygonWithHolesPtr ;
 
   difference_type lSize = std::distance(aBegin,aEnd);
 
@@ -113,18 +113,18 @@ bool arrange_offset_polygons_2 ( InputPolygonPtrIterator           aBegin
 }
 
 template<class PolygonWithHoles, class Polygon>
-std::vector< boost::shared_ptr<PolygonWithHoles> >
+std::vector< std::shared_ptr<PolygonWithHoles> >
 inline
-arrange_offset_polygons_2 ( std::vector<boost::shared_ptr<Polygon> > const& aPolygons,
+arrange_offset_polygons_2 ( std::vector<std::shared_ptr<Polygon> > const& aPolygons,
                             bool& no_error)
 {
-  typedef std::vector< boost::shared_ptr<PolygonWithHoles> > result_type ;
+  typedef std::vector< std::shared_ptr<PolygonWithHoles> > result_type ;
   typedef std::back_insert_iterator<result_type> Back_inserter;
 
   typedef typename PolygonWithHoles::General_polygon_2 Polygon_2 ;
   typedef typename Kernel_traits<typename boost::range_value<Polygon_2>::type>::Kernel K ;
 
-  typedef typename std::vector<boost::shared_ptr<Polygon> >::const_iterator PolygonIterator ;
+  typedef typename std::vector<std::shared_ptr<Polygon> >::const_iterator PolygonIterator ;
 
   result_type rResult ;
   no_error = arrange_offset_polygons_2<K, PolygonIterator, Back_inserter, PolygonWithHoles>(
@@ -134,9 +134,9 @@ arrange_offset_polygons_2 ( std::vector<boost::shared_ptr<Polygon> > const& aPol
 }
 
 template<class PolygonWithHoles, class Polygon>
-std::vector< boost::shared_ptr<PolygonWithHoles> >
+std::vector< std::shared_ptr<PolygonWithHoles> >
 inline
-arrange_offset_polygons_2 ( std::vector<boost::shared_ptr<Polygon> > const& aPolygons)
+arrange_offset_polygons_2 ( std::vector<std::shared_ptr<Polygon> > const& aPolygons)
 {
   bool no_error;
   return arrange_offset_polygons_2<PolygonWithHoles>(aPolygons, no_error);
diff --git a/Straight_skeleton_2/include/CGAL/create_offset_polygons_2.h b/Straight_skeleton_2/include/CGAL/create_offset_polygons_2.h
index dbaa31bbcb8f..9a8a97012cb6 100644
--- a/Straight_skeleton_2/include/CGAL/create_offset_polygons_2.h
+++ b/Straight_skeleton_2/include/CGAL/create_offset_polygons_2.h
@@ -30,7 +30,7 @@
 
 #include <boost/optional/optional.hpp>
 #include <boost/range/value_type.hpp>
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <algorithm>
 #include <iostream>
@@ -103,7 +103,7 @@ struct Default_return_polygon_with_holes_type<Polygon, OfK, false> // Polygon ty
 };
 
 template<class FT, class PointIterator, class HoleIterator, class K>
-boost::shared_ptr< Straight_skeleton_2<K> >
+std::shared_ptr< Straight_skeleton_2<K> >
 create_partial_interior_straight_skeleton_2 ( FT const&     aMaxTime
                                             , PointIterator aOuterContour_VerticesBegin
                                             , PointIterator aOuterContour_VerticesEnd
@@ -139,7 +139,7 @@ create_partial_interior_straight_skeleton_2 ( FT const&     aMaxTime
 }
 
 template<class FT, class PointIterator, class K>
-boost::shared_ptr< Straight_skeleton_2<K> >
+std::shared_ptr< Straight_skeleton_2<K> >
 create_partial_exterior_straight_skeleton_2 ( FT const&      aMaxOffset
                                             , PointIterator  aVerticesBegin
                                             , PointIterator  aVerticesEnd
@@ -152,7 +152,7 @@ create_partial_exterior_straight_skeleton_2 ( FT const&      aMaxOffset
   typedef typename Kernel_traits<Point_2>::Kernel                    IK;
   typedef typename IK::FT                                            IFT;
 
-  boost::shared_ptr<Straight_skeleton_2<K> > rSkeleton;
+  std::shared_ptr<Straight_skeleton_2<K> > rSkeleton;
 
   // That's because we might not have FT == IK::FT (e.g. `double` and `Core`)
   // Note that we can also have IK != K (e.g. `Simple_cartesian<Core>` and `EPICK`)
@@ -199,10 +199,10 @@ create_partial_exterior_straight_skeleton_2 ( FT const&      aMaxOffset
 // Kernel != Skeleton::kernel. The skeleton is converted to Straight_skeleton_2<Kernel>
 //
 template<class OutPolygon, class FT, class Skeleton, class K>
-std::vector< boost::shared_ptr<OutPolygon> >
+std::vector< std::shared_ptr<OutPolygon> >
 create_offset_polygons_2 ( FT const& aOffset, Skeleton const& aSs, K const& , Tag_false )
 {
-  typedef boost::shared_ptr<OutPolygon> OutPolygonPtr ;
+  typedef std::shared_ptr<OutPolygon> OutPolygonPtr ;
   typedef std::vector<OutPolygonPtr>    OutPolygonPtrVector ;
 
   typedef Straight_skeleton_2<K> OfSkeleton ;
@@ -212,7 +212,7 @@ create_offset_polygons_2 ( FT const& aOffset, Skeleton const& aSs, K const& , Ta
 
   OutPolygonPtrVector rR ;
 
-  boost::shared_ptr<OfSkeleton> lConvertedSs = convert_straight_skeleton_2<OfSkeleton>(aSs);
+  std::shared_ptr<OfSkeleton> lConvertedSs = convert_straight_skeleton_2<OfSkeleton>(aSs);
   OffsetBuilder ob( *lConvertedSs );
   ob.construct_offset_contours(aOffset, std::back_inserter(rR) ) ;
 
@@ -223,10 +223,10 @@ create_offset_polygons_2 ( FT const& aOffset, Skeleton const& aSs, K const& , Ta
 // Kernel == Skeleton::kernel, no conversion
 //
 template<class OutPolygon, class FT, class Skeleton, class K>
-std::vector< boost::shared_ptr<OutPolygon> >
+std::vector< std::shared_ptr<OutPolygon> >
 create_offset_polygons_2 ( FT const& aOffset, Skeleton const& aSs, K const& /*k*/, Tag_true )
 {
-  typedef boost::shared_ptr<OutPolygon> OutPolygonPtr ;
+  typedef std::shared_ptr<OutPolygon> OutPolygonPtr ;
   typedef std::vector<OutPolygonPtr>    OutPolygonPtrVector ;
 
   typedef Polygon_offset_builder_traits_2<K>                                OffsetBuilderTraits;
@@ -242,7 +242,7 @@ create_offset_polygons_2 ( FT const& aOffset, Skeleton const& aSs, K const& /*k*
 
 // Allow failure due to invalid straight skeletons to go through the users
 template<class Skeleton>
-Skeleton const& dereference ( boost::shared_ptr<Skeleton> const& ss )
+Skeleton const& dereference ( std::shared_ptr<Skeleton> const& ss )
 {
   CGAL_precondition(ss.get() != 0);
   return *ss;
@@ -251,7 +251,7 @@ Skeleton const& dereference ( boost::shared_ptr<Skeleton> const& ss )
 } // namespace CGAL_SS_i
 
 template<class OutPolygon, class FT, class Skeleton, class K>
-std::vector< boost::shared_ptr<OutPolygon> >
+std::vector< std::shared_ptr<OutPolygon> >
 inline
 create_offset_polygons_2(const FT& aOffset,
                          const Skeleton& aSs,
@@ -263,7 +263,7 @@ create_offset_polygons_2(const FT& aOffset,
 
 template<class Polygon = Polygon_2<Exact_predicates_inexact_constructions_kernel>,
          class FT, class Skeleton>
-std::vector< boost::shared_ptr<Polygon> >
+std::vector< std::shared_ptr<Polygon> >
 inline
 create_offset_polygons_2(const FT& aOffset,
                          const Skeleton& aSs)
@@ -278,7 +278,7 @@ create_offset_polygons_2(const FT& aOffset,
 
 template<class FT, class APolygon, class HoleIterator, class OfK, class SsK,
          class OutPolygon = typename CGAL_SS_i::Default_return_polygon_type<APolygon, OfK>::type>
-std::vector< boost::shared_ptr<OutPolygon> >
+std::vector< std::shared_ptr<OutPolygon> >
 inline
 create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
                                                const APolygon& aOuterBoundary,
@@ -302,7 +302,7 @@ create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
 
 template<class FT, class APolygon, class HoleIterator, class OfK,
          class OutPolygon = typename CGAL_SS_i::Default_return_polygon_type<APolygon, OfK>::type>
-std::vector< boost::shared_ptr<OutPolygon> >
+std::vector< std::shared_ptr<OutPolygon> >
 inline
 create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
                                                const APolygon& aOuterBoundary,
@@ -319,7 +319,7 @@ create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
 // Overload where Polygon actually is a simple polygon (no holes)
 template<class FT, class APolygon, class OfK, class SsK,
          class OutPolygon = typename CGAL_SS_i::Default_return_polygon_type<APolygon, OfK>::type>
-std::vector< boost::shared_ptr<OutPolygon> >
+std::vector< std::shared_ptr<OutPolygon> >
 inline
 create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
                                                const APolygon& aPoly,
@@ -337,7 +337,7 @@ create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
 // Overloads common to both polygons with and without holes, a simple polygon is returned in any case
 template<class FT, class APolygon, class OfK,
          class OutPolygon = typename CGAL_SS_i::Default_return_polygon_type<APolygon, OfK>::type>
-std::vector<boost::shared_ptr<OutPolygon> >
+std::vector<std::shared_ptr<OutPolygon> >
 inline
 create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
                                                const APolygon& aPoly,
@@ -350,7 +350,7 @@ create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
 template<class FT, class APolygon,
          class OutPolygon = typename CGAL_SS_i::Default_return_polygon_type<
                               APolygon, Exact_predicates_inexact_constructions_kernel>::type>
-std::vector<boost::shared_ptr<OutPolygon> >
+std::vector<std::shared_ptr<OutPolygon> >
 inline
 create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
                                                const APolygon& aPoly)
@@ -369,7 +369,7 @@ create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
 // Overload where Polygon actually is a simple polygon (no holes)
 template<class FT, class APolygon, class OfK, class SsK,
          class OutPolygon = typename CGAL_SS_i::Default_return_polygon_type<APolygon, OfK>::type>
-std::vector< boost::shared_ptr<OutPolygon> >
+std::vector< std::shared_ptr<OutPolygon> >
 inline
 create_exterior_skeleton_and_offset_polygons_2(const FT& aOffset,
                                                const APolygon& aPoly,
@@ -392,7 +392,7 @@ create_exterior_skeleton_and_offset_polygons_2(const FT& aOffset,
 // Overloads common to both polygons with and without holes, a simple polygons are returned in any case
 template<class FT, class APolygon, class OfK,
          class OutPolygon = typename CGAL_SS_i::Default_return_polygon_type<APolygon, OfK>::type>
-std::vector< boost::shared_ptr<OutPolygon> >
+std::vector< std::shared_ptr<OutPolygon> >
 inline
 create_exterior_skeleton_and_offset_polygons_2(const FT& aOffset,
                                                const APolygon& aPoly,
@@ -405,7 +405,7 @@ create_exterior_skeleton_and_offset_polygons_2(const FT& aOffset,
 template<class FT, class APolygon,
          class OutPolygon = typename CGAL_SS_i::Default_return_polygon_type<
                               APolygon, Exact_predicates_inexact_constructions_kernel>::type>
-std::vector< boost::shared_ptr<OutPolygon> >
+std::vector< std::shared_ptr<OutPolygon> >
 inline
 create_exterior_skeleton_and_offset_polygons_2(const FT& aOffset,
                                                const APolygon& aPoly)
diff --git a/Straight_skeleton_2/include/CGAL/create_offset_polygons_from_polygon_with_holes_2.h b/Straight_skeleton_2/include/CGAL/create_offset_polygons_from_polygon_with_holes_2.h
index 745ce692b683..1edf67e1129b 100644
--- a/Straight_skeleton_2/include/CGAL/create_offset_polygons_from_polygon_with_holes_2.h
+++ b/Straight_skeleton_2/include/CGAL/create_offset_polygons_from_polygon_with_holes_2.h
@@ -21,7 +21,7 @@
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <type_traits>
 #include <vector>
@@ -38,7 +38,7 @@ namespace CGAL {
 // overload where PolygonWithHoles actually is a type of Polygon that supports holes
 template<class FT, class PolygonWithHoles, class OfK, class SsK,
          class OutPolygon = typename CGAL_SS_i::Default_return_polygon_type<PolygonWithHoles, OfK>::type> // Hole-less polygon type
-std::vector<boost::shared_ptr<OutPolygon> >
+std::vector<std::shared_ptr<OutPolygon> >
 inline
 create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
                                                const PolygonWithHoles& aPoly,
@@ -57,7 +57,7 @@ create_interior_skeleton_and_offset_polygons_2(const FT& aOffset,
 // Polygon might be a Polygon with holes or not, but it returns a Polygon with holes
 template<class FT, class Polygon, class OfK, class SsK,
          class OutPolygonWithHoles = typename CGAL_SS_i::Default_return_polygon_with_holes_type<Polygon, OfK>::type>
-std::vector<boost::shared_ptr<OutPolygonWithHoles> >
+std::vector<std::shared_ptr<OutPolygonWithHoles> >
 inline
 create_interior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
                                                           const Polygon& aPoly,
@@ -70,7 +70,7 @@ create_interior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
 
 template<class FT, class Polygon, class OfK,
          class OutPolygonWithHoles = typename CGAL_SS_i::Default_return_polygon_with_holes_type<Polygon, OfK>::type>
-std::vector<boost::shared_ptr<OutPolygonWithHoles> >
+std::vector<std::shared_ptr<OutPolygonWithHoles> >
 inline
 create_interior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
                                                           const Polygon& aPoly,
@@ -83,7 +83,7 @@ create_interior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
 template<class FT, class Polygon,
          class OutPolygonWithHoles = typename CGAL_SS_i::Default_return_polygon_with_holes_type<
                                        Polygon, Exact_predicates_inexact_constructions_kernel>::type>
-std::vector<boost::shared_ptr<OutPolygonWithHoles> >
+std::vector<std::shared_ptr<OutPolygonWithHoles> >
 inline
 create_interior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
                                                           const Polygon& aPoly)
@@ -102,7 +102,7 @@ create_interior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
 // Polygon might be a Polygon with holes or not, but it returns a Polygon with holes
 template<class FT, class Polygon, class OfK, class SsK,
          class OutPolygonWithHoles = typename CGAL_SS_i::Default_return_polygon_with_holes_type<Polygon, OfK>::type>
-std::vector<boost::shared_ptr<OutPolygonWithHoles> >
+std::vector<std::shared_ptr<OutPolygonWithHoles> >
 inline
 create_exterior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
                                                           const Polygon& aPoly,
@@ -110,7 +110,7 @@ create_exterior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
                                                           const SsK& ssk)
 {
   typedef typename CGAL_SS_i::Default_return_polygon_type<Polygon, OfK>::type Polygon_;
-  std::vector<boost::shared_ptr<Polygon_> > raw_output =
+  std::vector<std::shared_ptr<Polygon_> > raw_output =
     create_exterior_skeleton_and_offset_polygons_2(aOffset, aPoly, ofk, ssk);
 
   // filter offset of the outer frame
@@ -129,7 +129,7 @@ create_exterior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
   if (outer_id != (raw_output.size()-1))
     std::swap(raw_output[outer_id], raw_output.back());
   raw_output.pop_back();
-  for (boost::shared_ptr<Polygon_> ptr : raw_output)
+  for (std::shared_ptr<Polygon_> ptr : raw_output)
     ptr->reverse_orientation();
 
   return arrange_offset_polygons_2<OutPolygonWithHoles>(raw_output);
@@ -140,7 +140,7 @@ create_exterior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
 // overload where PolygonWithHoles actually is a type of Polygon that supports holes
 template<class FT, class PolygonWithHoles, class OfK, class SsK,
          class OutPolygon = typename CGAL_SS_i::Default_return_polygon_type<PolygonWithHoles, OfK>::type>
-std::vector<boost::shared_ptr<OutPolygon> >
+std::vector<std::shared_ptr<OutPolygon> >
 inline
 create_exterior_skeleton_and_offset_polygons_2(const FT& aOffset,
                                                const PolygonWithHoles& aPoly,
@@ -149,14 +149,14 @@ create_exterior_skeleton_and_offset_polygons_2(const FT& aOffset,
                                                std::enable_if_t<
                                                  CGAL_SS_i::has_Hole_const_iterator<PolygonWithHoles>::value>* = nullptr)
 {
-  std::vector<boost::shared_ptr<OutPolygon> > polygons =
+  std::vector<std::shared_ptr<OutPolygon> > polygons =
     create_exterior_skeleton_and_offset_polygons_2(aOffset, aPoly.outer_boundary(), ofk, ssk);
 
   for (typename PolygonWithHoles::Hole_const_iterator hit=aPoly.holes_begin(); hit!=aPoly.holes_end(); ++hit)
   {
     typename PolygonWithHoles::Polygon_2 hole = *hit;
     hole.reverse_orientation();
-    std::vector<boost::shared_ptr<OutPolygon> > hole_polygons =
+    std::vector<std::shared_ptr<OutPolygon> > hole_polygons =
         create_interior_skeleton_and_offset_polygons_2(aOffset,
                                                        hole,
                                                        ofk,ssk);
@@ -168,7 +168,7 @@ create_exterior_skeleton_and_offset_polygons_2(const FT& aOffset,
 
 template<class FT, class Polygon, class OfK,
          class OutPolygonWithHoles = typename CGAL_SS_i::Default_return_polygon_with_holes_type<Polygon, OfK>::type>
-std::vector<boost::shared_ptr<OutPolygonWithHoles> >
+std::vector<std::shared_ptr<OutPolygonWithHoles> >
 inline
 create_exterior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
                                                           const Polygon& aPoly,
@@ -181,7 +181,7 @@ create_exterior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
 template<class FT, class Polygon,
          class OutPolygonWithHoles = typename CGAL_SS_i::Default_return_polygon_with_holes_type<
                                     Polygon, Exact_predicates_inexact_constructions_kernel>::type>
-std::vector<boost::shared_ptr<OutPolygonWithHoles> >
+std::vector<std::shared_ptr<OutPolygonWithHoles> >
 inline
 create_exterior_skeleton_and_offset_polygons_with_holes_2(const FT& aOffset,
                                                           const Polygon& aPoly)
diff --git a/Straight_skeleton_2/include/CGAL/create_straight_skeleton_2.h b/Straight_skeleton_2/include/CGAL/create_straight_skeleton_2.h
index aa73ed322c68..d88fb85ac505 100644
--- a/Straight_skeleton_2/include/CGAL/create_straight_skeleton_2.h
+++ b/Straight_skeleton_2/include/CGAL/create_straight_skeleton_2.h
@@ -22,7 +22,7 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <boost/optional/optional.hpp>
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <algorithm>
 #include <iterator>
@@ -31,7 +31,7 @@
 namespace CGAL {
 
 template<class PointIterator, class HoleIterator, class K>
-boost::shared_ptr< Straight_skeleton_2<K> >
+std::shared_ptr< Straight_skeleton_2<K> >
 create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
                                     , PointIterator aOuterContour_VerticesEnd
                                     , HoleIterator  aHolesBegin
@@ -61,7 +61,7 @@ create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
 }
 
 template<class PointIterator, class HoleIterator>
-boost::shared_ptr< Straight_skeleton_2< Exact_predicates_inexact_constructions_kernel > >
+std::shared_ptr< Straight_skeleton_2< Exact_predicates_inexact_constructions_kernel > >
 inline
 create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
                                     , PointIterator aOuterContour_VerticesEnd
@@ -78,7 +78,7 @@ create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
 }
 
 template<class PointIterator, class K>
-boost::shared_ptr< Straight_skeleton_2<K> >
+std::shared_ptr< Straight_skeleton_2<K> >
 inline
 create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
                                     , PointIterator aOuterContour_VerticesEnd
@@ -98,7 +98,7 @@ create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
 }
 
 template<class PointIterator>
-boost::shared_ptr< Straight_skeleton_2<Exact_predicates_inexact_constructions_kernel> >
+std::shared_ptr< Straight_skeleton_2<Exact_predicates_inexact_constructions_kernel> >
 inline
 create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
                                     , PointIterator aOuterContour_VerticesEnd
@@ -111,7 +111,7 @@ create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
 }
 
 template<class Polygon, class K>
-boost::shared_ptr< Straight_skeleton_2<K> >
+std::shared_ptr< Straight_skeleton_2<K> >
 inline
 create_interior_straight_skeleton_2 ( Polygon const& aOutContour,
                                       K const& k,
@@ -125,7 +125,7 @@ create_interior_straight_skeleton_2 ( Polygon const& aOutContour,
 }
 
 template<class Polygon>
-boost::shared_ptr< Straight_skeleton_2< Exact_predicates_inexact_constructions_kernel > >
+std::shared_ptr< Straight_skeleton_2< Exact_predicates_inexact_constructions_kernel > >
 inline
 create_interior_straight_skeleton_2 ( Polygon const& aOutContour )
 {
@@ -138,7 +138,7 @@ create_interior_straight_skeleton_2 ( Polygon const& aOutContour )
 /// EXTERIOR
 
 template<class FT, class PointIterator, class K>
-boost::shared_ptr< Straight_skeleton_2<K> >
+std::shared_ptr< Straight_skeleton_2<K> >
 create_exterior_straight_skeleton_2 ( FT const&      aMaxOffset
                                     , PointIterator  aVerticesBegin
                                     , PointIterator  aVerticesEnd
@@ -151,7 +151,7 @@ create_exterior_straight_skeleton_2 ( FT const&      aMaxOffset
   typedef typename Kernel_traits<Point_2>::Kernel                    IK;
   typedef typename IK::FT                                            IFT;
 
-  boost::shared_ptr<Straight_skeleton_2<K> > rSkeleton;
+  std::shared_ptr<Straight_skeleton_2<K> > rSkeleton;
 
   // That's because we might not have FT == IK::FT (e.g. `double` and `Core`)
   // Note that we can also have IK != K (e.g. `Simple_cartesian<Core>` and `EPICK`)
@@ -195,7 +195,7 @@ create_exterior_straight_skeleton_2 ( FT const&      aMaxOffset
 }
 
 template<class FT, class PointIterator>
-boost::shared_ptr< Straight_skeleton_2<Exact_predicates_inexact_constructions_kernel> >
+std::shared_ptr< Straight_skeleton_2<Exact_predicates_inexact_constructions_kernel> >
 inline
 create_exterior_straight_skeleton_2 ( FT const&      aMaxOffset
                                     , PointIterator  aVerticesBegin
@@ -210,7 +210,7 @@ create_exterior_straight_skeleton_2 ( FT const&      aMaxOffset
 }
 
 template<class FT, class Polygon, class K>
-boost::shared_ptr< Straight_skeleton_2<K> >
+std::shared_ptr< Straight_skeleton_2<K> >
 inline
 create_exterior_straight_skeleton_2 ( FT const& aMaxOffset, Polygon const& aPoly, K const& k )
 {
@@ -222,7 +222,7 @@ create_exterior_straight_skeleton_2 ( FT const& aMaxOffset, Polygon const& aPoly
 }
 
 template<class FT, class Polygon>
-boost::shared_ptr< Straight_skeleton_2<Exact_predicates_inexact_constructions_kernel> >
+std::shared_ptr< Straight_skeleton_2<Exact_predicates_inexact_constructions_kernel> >
 inline
 create_exterior_straight_skeleton_2 ( FT const& aMaxOffset, Polygon const& aPoly )
 {
diff --git a/Straight_skeleton_2/include/CGAL/create_straight_skeleton_from_polygon_with_holes_2.h b/Straight_skeleton_2/include/CGAL/create_straight_skeleton_from_polygon_with_holes_2.h
index 34ededf3da79..9693981d4e09 100644
--- a/Straight_skeleton_2/include/CGAL/create_straight_skeleton_from_polygon_with_holes_2.h
+++ b/Straight_skeleton_2/include/CGAL/create_straight_skeleton_from_polygon_with_holes_2.h
@@ -20,14 +20,14 @@
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <type_traits>
 
 namespace CGAL {
 
 template<class K, class Polygon>
-boost::shared_ptr< Straight_skeleton_2<K> >
+std::shared_ptr< Straight_skeleton_2<K> >
 inline
 create_interior_straight_skeleton_2 ( Polygon const& aPolyWithHoles,
                                       K const& k,
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_offset_builder_types.h b/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_offset_builder_types.h
index e4470f203664..7f6217477a8b 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_offset_builder_types.h
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_offset_builder_types.h
@@ -21,7 +21,7 @@
 #include <CGAL/compute_outer_frame_margin.h>
 #include <CGAL/HalfedgeDS_const_decorator.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 #include <vector>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
@@ -29,10 +29,10 @@ typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
 typedef K::Point_2                    Point;
 typedef CGAL::Aff_transformation_2<K> Transformation;
 typedef std::vector<Point>            Polygon_2;
-typedef boost::shared_ptr<Polygon_2>  PolygonPtr;
+typedef std::shared_ptr<Polygon_2>  PolygonPtr;
 typedef CGAL::Segment_2<K>            Segment;
 typedef std::vector<PolygonPtr>       Region ;
-typedef boost::shared_ptr<Region>     RegionPtr ;
+typedef std::shared_ptr<Region>     RegionPtr ;
 typedef std::vector<RegionPtr>        Regions ;
 typedef std::vector<double>           Doubles ;
 
@@ -51,7 +51,7 @@ typedef Sls::Vertex_const_handle   Vertex_const_handle ;
 
 typedef CGAL::HalfedgeDS_const_decorator<Sls> Sls_const_decorator ;
 
-typedef boost::shared_ptr<Sls> SlsPtr ;
+typedef std::shared_ptr<Sls> SlsPtr ;
 
 #endif
 
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_builder_types.h b/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_builder_types.h
index f41d7f30f811..7a77342eba14 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_builder_types.h
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_builder_types.h
@@ -20,7 +20,7 @@
 #include <CGAL/Polygon_offset_builder_2.h>
 #include <CGAL/HalfedgeDS_const_decorator.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 #include <vector>
 
 //typedef CGAL::Simple_cartesian<double> K ;
@@ -30,10 +30,10 @@ typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
 typedef K::Point_2                    Point;
 typedef CGAL::Aff_transformation_2<K> Transformation;
 typedef std::vector<Point>            Polygon_2;
-typedef boost::shared_ptr<Polygon_2>  PolygonPtr;
+typedef std::shared_ptr<Polygon_2>  PolygonPtr;
 typedef CGAL::Segment_2<K>            Segment;
 typedef std::vector<PolygonPtr>       Region ;
-typedef boost::shared_ptr<Region>     RegionPtr ;
+typedef std::shared_ptr<Region>     RegionPtr ;
 typedef std::vector<RegionPtr>        Regions ;
 typedef std::vector<double>           Doubles ;
 
@@ -50,7 +50,7 @@ typedef Sls::Vertex_const_handle   Vertex_const_handle ;
 
 typedef CGAL::HalfedgeDS_const_decorator<Sls> Sls_const_decorator ;
 
-typedef boost::shared_ptr<Sls> SlsPtr ;
+typedef std::shared_ptr<Sls> SlsPtr ;
 
 #endif
 
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_types.h b/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_types.h
index c45acacbddab..cc55c28210ad 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_types.h
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_types.h
@@ -24,7 +24,7 @@
 #include <CGAL/compute_outer_frame_margin.h>
 #include <CGAL/HalfedgeDS_const_decorator.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 #include <vector>
 
 #include <CGAL/Real_timer.h>
@@ -50,16 +50,16 @@ typedef std::vector<double>           Doubles ;
 
 typedef CGAL::Segment_2<IK>           ISegment;
 typedef std::vector<IPoint>           IPolygon;
-typedef boost::shared_ptr<IPolygon>   IPolygonPtr;
+typedef std::shared_ptr<IPolygon>   IPolygonPtr;
 typedef std::vector<IPolygonPtr>      IRegion ;
-typedef boost::shared_ptr<IRegion>    IRegionPtr ;
+typedef std::shared_ptr<IRegion>    IRegionPtr ;
 typedef std::vector<IRegionPtr>       IRegions ;
 
 typedef CGAL::Segment_2<OK>           OSegment;
 typedef std::vector<OPoint>           OPolygon;
-typedef boost::shared_ptr<OPolygon>   OPolygonPtr;
+typedef std::shared_ptr<OPolygon>   OPolygonPtr;
 typedef std::vector<OPolygonPtr>      ORegion ;
-typedef boost::shared_ptr<ORegion>    ORegionPtr ;
+typedef std::shared_ptr<ORegion>    ORegionPtr ;
 typedef std::vector<ORegionPtr>       ORegions ;
 
 typedef CGAL::Straight_skeleton_2<IK>                             ISls;
@@ -157,8 +157,8 @@ class IOffsetBuilderVisitor : public VisitorBase
 
 typedef CGAL::HalfedgeDS_const_decorator<ISls> Sls_const_decorator ;
 
-typedef boost::shared_ptr<ISls> ISlsPtr ;
-typedef boost::shared_ptr<OSls> OSlsPtr ;
+typedef std::shared_ptr<ISls> ISlsPtr ;
+typedef std::shared_ptr<OSls> OSlsPtr ;
 
 typedef CGAL::Straight_skeleton_items_converter_2<ISls,OSls> SlsItemsConverter ;
 
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/issue4533.cpp b/Straight_skeleton_2/test/Straight_skeleton_2/issue4533.cpp
index d552e1241a4a..4f59ee87fc22 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/issue4533.cpp
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/issue4533.cpp
@@ -5,7 +5,7 @@
 #include "print.h"
 #include<CGAL/Polygon_2.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <cassert>
 
@@ -15,7 +15,7 @@ typedef K::Point_2                                                  Point;
 typedef CGAL::Polygon_2<K>                                          Polygon_2;
 typedef CGAL::Straight_skeleton_2<K>                                Ss;
 
-typedef boost::shared_ptr<Ss>                                       SsPtr;
+typedef std::shared_ptr<Ss>                                       SsPtr;
 
 int main()
 {
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/issue4684.cpp b/Straight_skeleton_2/test/Straight_skeleton_2/issue4684.cpp
index 560d8c014033..47dd764e525d 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/issue4684.cpp
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/issue4684.cpp
@@ -4,7 +4,7 @@
 #include<CGAL/create_offset_polygons_2.h>
 #include<CGAL/draw_straight_skeleton_2.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <iostream>
 #include <vector>
@@ -13,7 +13,7 @@ typedef CGAL::Exact_predicates_inexact_constructions_kernel     K;
 typedef K::Point_2                                              Point;
 
 typedef CGAL::Polygon_2<K>                                      Polygon_2;
-typedef boost::shared_ptr<Polygon_2>                            PolygonPtr;
+typedef std::shared_ptr<Polygon_2>                            PolygonPtr;
 
 void low_precision_run()
 {
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/issue7149.cpp b/Straight_skeleton_2/test/Straight_skeleton_2/issue7149.cpp
index 9acead190b06..709a1fb0bf7c 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/issue7149.cpp
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/issue7149.cpp
@@ -83,7 +83,7 @@ void test(const PointRange& points,
                   K());
   assert(ss_ptr);
 
-  std::vector<boost::shared_ptr<Polygon_2> > offset_polygons_ptrs =
+  std::vector<std::shared_ptr<Polygon_2> > offset_polygons_ptrs =
     CGAL::create_offset_polygons_2<Polygon_2>(FT(offset), CGAL::CGAL_SS_i::dereference(ss_ptr), K());
 
   std::cout << offset_polygons_ptrs.size() << " polygon(s)" << std::endl;
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/print.h b/Straight_skeleton_2/test/Straight_skeleton_2/print.h
index abaa74d9e46d..a3cc881f4790 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/print.h
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/print.h
@@ -24,9 +24,9 @@ void print_polygon ( CGAL::Polygon_2<K,C> const& poly )
 }
 
 template<class K, class C>
-void print_polygons ( std::vector< boost::shared_ptr< CGAL::Polygon_2<K,C> > > const& polies )
+void print_polygons ( std::vector< std::shared_ptr< CGAL::Polygon_2<K,C> > > const& polies )
 {
-  typedef std::vector< boost::shared_ptr< CGAL::Polygon_2<K,C> > > PolygonVector ;
+  typedef std::vector< std::shared_ptr< CGAL::Polygon_2<K,C> > > PolygonVector ;
 
   std::cout << "Polygon list with " << polies.size() << " polygons" << std::endl ;
 
@@ -48,10 +48,10 @@ void print_polygon_with_holes ( CGAL::Polygon_with_holes_2<K,C> const& polywh )
 }
 
 template<class K, class C>
-void print_polygons_with_holes ( std::vector< boost::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > const& polies )
+void print_polygons_with_holes ( std::vector< std::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > const& polies )
 {
 
-  typedef std::vector< boost::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > PolygonWithHolesVector ;
+  typedef std::vector< std::shared_ptr< CGAL::Polygon_with_holes_2<K,C> > > PolygonWithHolesVector ;
 
   std::cout << "Polygon_with_holes list with " << polies.size() << " element" << std::endl ;
 
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_offset.cpp b/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_offset.cpp
index 02082ff87249..db7ec3b16224 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_offset.cpp
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_offset.cpp
@@ -37,7 +37,7 @@ void Straight_skeleton_traits_external_trace(std::string m)
 #include <CGAL/Polygon_2.h>
 #include <CGAL/draw_polygon_2.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <cassert>
 #include <iostream>
@@ -60,10 +60,10 @@ void test_API()
   Polygon_2 p;
   Polygon_with_holes_2 pwh;
 
-  std::vector< boost::shared_ptr<Polygon_2> > res;
-  std::vector< boost::shared_ptr<Polygon_2_EPICK> > res_EPICK;
-  std::vector< boost::shared_ptr<Polygon_with_holes_2> > res_w;
-  std::vector< boost::shared_ptr<Polygon_with_holes_2_EPICK> > res_w_EPICK;
+  std::vector< std::shared_ptr<Polygon_2> > res;
+  std::vector< std::shared_ptr<Polygon_2_EPICK> > res_EPICK;
+  std::vector< std::shared_ptr<Polygon_with_holes_2> > res_w;
+  std::vector< std::shared_ptr<Polygon_with_holes_2_EPICK> > res_w_EPICK;
 
   // First kernel is the offset construction (and thus output kernel), second kernel is the skeleton construction
 
@@ -135,7 +135,7 @@ void test_API()
 }
 
 template <typename K, typename StraightSkeleton>
-bool is_valid(const boost::shared_ptr<StraightSkeleton>& ss)
+bool is_valid(const std::shared_ptr<StraightSkeleton>& ss)
 {
   typedef typename StraightSkeleton::Traits::Point_2 Point;
 
@@ -176,7 +176,7 @@ void test_offset_square()
 
   typedef typename K::Point_2                                                  Point;
   typedef CGAL::Polygon_2<K>                                                   Polygon_2;
-  typedef boost::shared_ptr<Polygon_2>                                         Polygon_ptr;
+  typedef std::shared_ptr<Polygon_2>                                         Polygon_ptr;
   typedef std::vector<Polygon_ptr>                                             Polygon_ptr_container;
 
   typedef CGAL::Straight_skeleton_2<K>                                         Ss;
@@ -193,7 +193,7 @@ void test_offset_square()
   Skeleton_builder ssb;
   ssb.enter_contour(square.begin(), square.end());
 
-  boost::shared_ptr<Ss> ss = ssb.construct_skeleton();
+  std::shared_ptr<Ss> ss = ssb.construct_skeleton();
   assert(is_valid<K>(ss));
 
   Polygon_ptr_container offset_polys =
@@ -216,7 +216,7 @@ void test_offset_four_square_holes()
 
   typedef CGAL::Polygon_2<K>                                         Polygon_2;
   typedef CGAL::Polygon_with_holes_2<K>                              Polygon_with_holes_2;
-  typedef boost::shared_ptr<Polygon_with_holes_2>                    Polygon_with_holes_2_ptr;
+  typedef std::shared_ptr<Polygon_with_holes_2>                    Polygon_with_holes_2_ptr;
   typedef std::vector<Polygon_with_holes_2_ptr>                      Polygon_with_holes_2_ptr_container;
 
   Polygon_2 outer, hole1, hole2, hole3, hole4;
@@ -275,7 +275,7 @@ void test_offset_L()
 
   typedef typename K::Point_2                                                  Point;
   typedef CGAL::Polygon_2<K>                                                   Polygon_2;
-  typedef boost::shared_ptr<Polygon_2>                                         Polygon_ptr;
+  typedef std::shared_ptr<Polygon_2>                                         Polygon_ptr;
   typedef std::vector<Polygon_ptr>                                             Polygon_ptr_container;
 
   typedef CGAL::Straight_skeleton_2<K>                                         Ss;
@@ -296,7 +296,7 @@ void test_offset_L()
   Skeleton_builder ssb;
   ssb.enter_contour(L.begin(), L.end());
 
-  boost::shared_ptr<Ss> ss = ssb.construct_skeleton();
+  std::shared_ptr<Ss> ss = ssb.construct_skeleton();
   assert(is_valid<K>(ss));
 
   Polygon_ptr_container offset_polys =
@@ -320,7 +320,7 @@ void test_offset_polygon_with_hole()
 
   typedef CGAL::Polygon_2<K>                                         Polygon_2;
   typedef CGAL::Polygon_with_holes_2<K>                              Polygon_with_holes_2;
-  typedef boost::shared_ptr<Polygon_with_holes_2>                    Polygon_with_holes_2_ptr;
+  typedef std::shared_ptr<Polygon_with_holes_2>                    Polygon_with_holes_2_ptr;
   typedef std::vector<Polygon_with_holes_2_ptr>                      Polygon_with_holes_2_ptr_container;
 
   // Square with a non-centered square hole
@@ -409,7 +409,7 @@ void test_offset_pinched()
   typedef typename K::FT                                                       FT;
   typedef typename K::Point_2                                                  Point;
   typedef CGAL::Polygon_2<K>                                                   Polygon_2;
-  typedef boost::shared_ptr<Polygon_2>                                         Polygon_ptr;
+  typedef std::shared_ptr<Polygon_2>                                         Polygon_ptr;
   typedef std::vector<Polygon_ptr>                                             Polygon_ptrs;
 
   typedef CGAL::Straight_skeleton_2<K>                                         Ss;
@@ -447,7 +447,7 @@ void test_offset_pinched()
   Skeleton_builder ssb;
   ssb.enter_contour(input.begin(), input.end());
 
-  boost::shared_ptr<Ss> ss = ssb.construct_skeleton();
+  std::shared_ptr<Ss> ss = ssb.construct_skeleton();
   assert(is_valid<K>(ss));
 
   // The two splitting fronts meet in the middle, and at that time,
@@ -490,7 +490,7 @@ void test_offset_multiple_CCs()
   typedef typename K::FT                                                       FT;
   typedef typename K::Point_2                                                  Point_2;
   typedef CGAL::Polygon_2<K>                                                   Contour;
-  typedef boost::shared_ptr<Contour>                                           ContourPtr;
+  typedef std::shared_ptr<Contour>                                           ContourPtr;
   typedef std::vector<ContourPtr>                                              Contour_sequence;
 
   typedef CGAL::Straight_skeleton_2<K>                                         Ss;
@@ -542,7 +542,7 @@ void test_offset_multiple_CCs()
   ssb.enter_contour(frame, frame+4);
   ssb.enter_contour(input.rbegin(), input.rend());
 
-  boost::shared_ptr<Ss> ss = ssb.construct_skeleton();
+  std::shared_ptr<Ss> ss = ssb.construct_skeleton();
   assert(is_valid<K>(ss));
 
   Contour_sequence offset_contours;
@@ -564,7 +564,7 @@ void test_offset_non_manifold()
   typedef typename K::Point_2                                                  Point;
   typedef CGAL::Polygon_2<K>                                                   Polygon_2;
   typedef CGAL::Polygon_with_holes_2<K>                                        Polygon_with_holes_2;
-  typedef boost::shared_ptr<Polygon_with_holes_2>                              Polygon_with_holes_ptr;
+  typedef std::shared_ptr<Polygon_with_holes_2>                              Polygon_with_holes_ptr;
   typedef std::vector<Polygon_with_holes_ptr>                                  Polygon_with_holes_ptrs;
 
   typedef CGAL::Straight_skeleton_2<K>                                         Ss;
@@ -588,7 +588,7 @@ void test_offset_non_manifold()
   ssb.enter_contour(outer.begin(), outer.end());
   ssb.enter_contour(hole.begin(), hole.end());
 
-  boost::shared_ptr<Ss> ss = ssb.construct_skeleton();
+  std::shared_ptr<Ss> ss = ssb.construct_skeleton();
   assert(is_valid<K>(ss));
 
   // The two splitting fronts meet in the middle, and at that time,
@@ -647,7 +647,7 @@ void test_offset_non_manifold_2()
   typedef typename K::Point_2                                                  Point;
   typedef CGAL::Polygon_2<K>                                                   Polygon_2;
   typedef CGAL::Polygon_with_holes_2<K>                                        Polygon_with_holes_2;
-  typedef boost::shared_ptr<Polygon_with_holes_2>                              Polygon_with_holes_ptr;
+  typedef std::shared_ptr<Polygon_with_holes_2>                              Polygon_with_holes_ptr;
   typedef std::vector<Polygon_with_holes_ptr>                                  Polygon_with_holes_ptrs;
 
   typedef CGAL::Straight_skeleton_2<K>                                         Ss;
@@ -679,7 +679,7 @@ void test_offset_non_manifold_2()
   ssb.enter_contour(outer.begin(), outer.end());
   ssb.enter_contour(hole.begin(), hole.end());
 
-  boost::shared_ptr<Ss> ss = ssb.construct_skeleton();
+  std::shared_ptr<Ss> ss = ssb.construct_skeleton();
   assert(is_valid<K>(ss));
 
   // Similar to the previous function, a split event happens and at that particular time,
@@ -733,7 +733,7 @@ void test_offset_polygon_exterior()
 
   typedef CGAL::Polygon_2<K>                                         Polygon_2;
   typedef CGAL::Polygon_with_holes_2<K>                              Polygon_with_holes_2;
-  typedef boost::shared_ptr<Polygon_with_holes_2>                    Polygon_with_holes_2_ptr;
+  typedef std::shared_ptr<Polygon_with_holes_2>                    Polygon_with_holes_2_ptr;
   typedef std::vector<Polygon_with_holes_2_ptr>                      Polygon_with_holes_2_ptr_container;
 
   Polygon_2 poly;
@@ -815,7 +815,7 @@ void test_offset_polygon_with_holes_exterior()
 
   typedef CGAL::Polygon_2<K>                                         Polygon_2;
   typedef CGAL::Polygon_with_holes_2<K>                              Polygon_with_holes_2;
-  typedef boost::shared_ptr<Polygon_with_holes_2>                    Polygon_with_holes_2_ptr;
+  typedef std::shared_ptr<Polygon_with_holes_2>                    Polygon_with_holes_2_ptr;
   typedef std::vector<Polygon_with_holes_2_ptr>                      Polygon_with_holes_2_ptr_container;
 
   Polygon_2 outer ;
@@ -855,7 +855,7 @@ void test_offset(const char* filename)
 
   typedef CGAL::Polygon_2<K>                                         Polygon_2;
   typedef CGAL::Polygon_with_holes_2<K>                              Polygon_with_holes_2;
-  typedef boost::shared_ptr<Polygon_with_holes_2>                    Polygon_with_holes_2_ptr;
+  typedef std::shared_ptr<Polygon_with_holes_2>                    Polygon_with_holes_2_ptr;
   typedef std::vector<Polygon_with_holes_2_ptr>                      Polygon_with_holes_2_ptr_container;
 
   typedef CGAL::Straight_skeleton_2<K>                               Ss;
@@ -920,7 +920,7 @@ void test_offset(const char* filename)
     ssb.enter_contour(polys[i+1].begin(), polys[i+1].end());
   }
 
-  boost::shared_ptr<Ss> ss = ssb.construct_skeleton();
+  std::shared_ptr<Ss> ss = ssb.construct_skeleton();
   assert(is_valid<K>(ss));
 
   std::set<FT> offset_times;
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_simple.cpp b/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_simple.cpp
index 4bddf279d398..e134a2746a75 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_simple.cpp
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_simple.cpp
@@ -34,7 +34,7 @@ void Straight_skeleton_traits_external_trace(std::string m)
 #include <CGAL/Polygon_2.h>
 #include <CGAL/draw_polygon_2.h>
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 #include <cassert>
 #include <iostream>
@@ -53,10 +53,10 @@ void test_API()
   typedef CGAL::Polygon_with_holes_2<K>                              Polygon_with_holes_2;
 
   typedef CGAL::Straight_skeleton_2<EPICK>                           Straight_skeleton_EPICK;
-  typedef boost::shared_ptr<Straight_skeleton_EPICK>                 Straight_skeleton_Ptr_EPICK;
+  typedef std::shared_ptr<Straight_skeleton_EPICK>                 Straight_skeleton_Ptr_EPICK;
 
   typedef CGAL::Straight_skeleton_2<K>                               Straight_skeleton;
-  typedef boost::shared_ptr<Straight_skeleton>                       Straight_skeleton_Ptr;
+  typedef std::shared_ptr<Straight_skeleton>                       Straight_skeleton_Ptr;
 
   Polygon_2 p;
   Straight_skeleton_Ptr_EPICK ss0 = CGAL::create_interior_straight_skeleton_2(p);
@@ -72,7 +72,7 @@ void test_API()
 }
 
 template <typename K, typename StraightSkeleton>
-bool is_valid(const boost::shared_ptr<StraightSkeleton>& ss)
+bool is_valid(const std::shared_ptr<StraightSkeleton>& ss)
 {
   typedef typename StraightSkeleton::Traits::Point_2                 Point;
   typedef CGAL::Polygon_2<K>                                         Polygon_2;
@@ -136,7 +136,7 @@ void test_skeleton(const char* filename,
   typedef CGAL::Polygon_with_holes_2<K>                              Polygon_with_holes_2;
 
   typedef CGAL::Straight_skeleton_2<K>                               Straight_skeleton;
-  typedef boost::shared_ptr<Straight_skeleton>                       Straight_skeleton_Ptr;
+  typedef std::shared_ptr<Straight_skeleton>                       Straight_skeleton_Ptr;
 
   std::ifstream in(filename);
   assert(in);
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/test_straight_skeleton_copy.cpp b/Straight_skeleton_2/test/Straight_skeleton_2/test_straight_skeleton_copy.cpp
index acbe7d848b2a..b263a98658d7 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/test_straight_skeleton_copy.cpp
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/test_straight_skeleton_copy.cpp
@@ -1,7 +1,5 @@
 #include<vector>
 
-#include<boost/shared_ptr.hpp>
-
 #include<CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include<CGAL/Polygon_2.h>
 #include<CGAL/create_offset_polygons_2.h>
@@ -12,8 +10,8 @@ typedef K::Point_2                   Point ;
 typedef CGAL::Polygon_2<K>           Polygon_2 ;
 typedef CGAL::Straight_skeleton_2<K> Ss ;
 
-typedef boost::shared_ptr<Polygon_2> PolygonPtr ;
-typedef boost::shared_ptr<Ss> SsPtr ;
+typedef std::shared_ptr<Polygon_2> PolygonPtr ;
+typedef std::shared_ptr<Ss> SsPtr ;
 
 typedef std::vector<PolygonPtr> PolygonPtrVector ;
 
diff --git a/Stream_support/include/CGAL/Stream_support/internal/Geometry_container.h b/Stream_support/include/CGAL/Stream_support/internal/Geometry_container.h
index e5be891d9b24..e3e26fe8b615 100644
--- a/Stream_support/include/CGAL/Stream_support/internal/Geometry_container.h
+++ b/Stream_support/include/CGAL/Stream_support/internal/Geometry_container.h
@@ -16,7 +16,7 @@
 #define GEOMETRY_CONTAINER_H
 #include <boost/geometry/io/wkt/write.hpp>
 #include <boost/geometry/io/wkt/read.hpp>
-#include <boost/shared_ptr.hpp>
+#include <memory>
 
 struct Dummy_deleter{
   template<class T>
@@ -45,7 +45,7 @@ struct Geometry_container{
   typedef typename Range::const_reverse_iterator const_reverse_iterator;
   typedef typename Range::size_type size_type;
   typedef typename Range::value_type value_type;
-  boost::shared_ptr<Range>  range;
+  std::shared_ptr<Range>  range;
   bool must_delete;
   //
   // Default constructor.

From 604dcdc4357ad1c24466a5167da0ceb90fa6615a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 20:45:26 +0200
Subject: [PATCH 0360/1398] boost::optional => std::optional

---
 .../doc/AABB_tree/Concepts/AABBGeomTraits.h   |  2 +-
 .../Concepts/AABBRayIntersectionTraits.h      |  6 +-
 AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h |  4 +-
 ..._polyhedron_facet_intersection_example.cpp |  4 +-
 .../AABB_tree/AABB_ray_shooting_example.cpp   |  2 +-
 AABB_tree/include/CGAL/AABB_traits.h          | 18 ++---
 AABB_tree/include/CGAL/AABB_tree.h            | 18 ++---
 .../internal/AABB_ray_intersection.h          | 22 +++---
 .../internal/AABB_traversal_traits.h          | 12 +--
 AABB_tree/test/AABB_tree/AABB_test_util.h     | 22 +++---
 .../test/AABB_tree/aabb_any_all_benchmark.cpp |  2 +-
 .../aabb_correctness_triangle_test.cpp        |  2 +-
 .../AABB_tree/aabb_test_ray_intersection.cpp  | 10 +--
 .../Algebraic_curve_kernel_2.h                |  8 +-
 .../Algebraic_kernel_d/Algebraic_real_d_1.h   |  2 +-
 ...ebraic_real_quadratic_refinement_rep_bfi.h | 24 +++---
 .../Algebraic_kernel_d/Algebraic_real_rep.h   |  4 +-
 .../Bitstream_descartes_E08_tree.h            |  2 +-
 .../Algebraic_kernel_d/Curve_analysis_2.h     | 28 +++----
 .../Curve_pair_analysis_2.h                   | 34 ++++----
 .../Algebraic_kernel_d/Status_line_CA_1.h     |  6 +-
 .../Algebraic_kernel_d/Status_line_CPA_1.h    |  2 +-
 .../CGAL/Algebraic_kernel_d/Xy_coordinate_2.h |  4 +-
 .../Alpha_shapes_2/internal/Lazy_alpha_nt_2.h |  4 +-
 .../Alpha_shapes_3/internal/Lazy_alpha_nt_3.h |  6 +-
 .../AlgebraicCurveParser.cpp                  |  2 +-
 .../AlgebraicCurveParser.h                    |  4 +-
 .../EnvelopeCallback.cpp                      |  2 +-
 .../GraphicsViewCurveInput.cpp                | 36 ++++-----
 .../GraphicsViewCurveInputTyped.h             | 50 ++++++------
 .../Arrangement_on_surface_2/PointSnapper.cpp | 16 ++--
 .../Arrangement_on_surface_2/PointSnapper.h   |  2 +-
 .../Arrangement_on_surface_2/Utils/Utils.cpp  | 16 ++--
 .../Arrangement_on_surface_2/Utils/Utils.h    | 16 ++--
 .../unb_planar_vertical_decomposition.cpp     |  2 +-
 .../CGAL/Arr_algebraic_segment_traits_2.h     | 24 +++---
 .../include/CGAL/Arr_batched_point_location.h |  2 +-
 .../Arr_bounded_planar_topology_traits_2.h    |  4 +-
 .../include/CGAL/Arr_overlay_2.h              | 10 +--
 .../Arr_lm_nearest_neighbor.h                 |  2 +-
 .../CGAL/Arr_point_location/Td_active_edge.h  |  6 +-
 .../Arr_point_location/Td_active_trapezoid.h  | 18 ++---
 .../Trapezoidal_decomposition_2.h             | 38 ++++-----
 .../Trapezoidal_decomposition_2_impl.h        | 10 +--
 .../include/CGAL/Arr_point_location_result.h  | 10 +--
 .../include/CGAL/Arr_simple_point_location.h  |  8 +-
 .../CGAL/Arr_spherical_topology_traits_2.h    |  2 +-
 .../Arr_bounded_planar_vert_decomp_helper.h   |  2 +-
 .../Arr_spherical_topology_traits_2_impl.h    | 10 +--
 .../Arr_spherical_vert_decomp_helper.h        |  2 +-
 .../Arr_unb_planar_topology_traits_2_impl.h   |  6 +-
 .../Arr_unb_planar_vert_decomp_helper.h       |  2 +-
 .../CGAL/Arr_unb_planar_topology_traits_2.h   |  2 +-
 .../include/CGAL/Arrangement_zone_2.h         |  2 +-
 .../CGAL/Curved_kernel_via_analysis_2/Arc_2.h | 16 ++--
 .../Curve_renderer_facade.h                   |  4 +-
 .../Fig_stream_Curve_renderer_2.h             |  2 +-
 .../Generic_arc_2.h                           |  4 +-
 .../Generic_point_2.h                         |  4 +-
 .../Curved_kernel_via_analysis_2/Point_2.h    | 12 +--
 .../Sweep_curves_adapter_2.h                  |  2 +-
 .../gfx/Curve_renderer_2.h                    |  4 +-
 .../Surface_sweep_2/Arr_overlay_ss_visitor.h  |  6 +-
 .../Surface_sweep_2/Arr_overlay_traits_2.h    | 34 ++++----
 .../Arr_vert_decomp_ss_visitor.h              |  2 +-
 .../Vertical_decomposition_test.h             |  2 +-
 BGL/include/CGAL/boost/graph/helpers.h        |  4 +-
 .../Concepts/BarycentricCoordinates_2.h       |  6 +-
 .../Discrete_harmonic_2.h                     | 32 ++++----
 .../Generalized_barycentric_coordinates_2.h   | 78 +++++++++----------
 .../Barycentric_coordinates_2/Mean_value_2.h  | 32 ++++----
 .../Barycentric_coordinates_2/Wachspress_2.h  | 32 ++++----
 .../internal/utils_2.h                        | 14 ++--
 .../segment_coordinates_2.h                   |  8 +-
 .../triangle_coordinates_2.h                  |  8 +-
 .../test_dh_deprecated_api.cpp                |  2 +-
 .../test_mv_deprecated_api.cpp                |  2 +-
 .../test_sc_deprecated_api.cpp                |  2 +-
 .../test_tc_deprecated_api.cpp                |  2 +-
 .../test_wp_deprecated_api.cpp                |  2 +-
 .../include/CGAL/Cartesian_converter.h        |  6 +-
 .../Safe_circulator_from_iterator.h           |  8 +-
 .../dual/halfspace_intersection_3.h           |  2 +-
 ...fspace_intersection_with_constructions_3.h |  2 +-
 .../Convex_hull_3/lloyd_algorithm.cpp         |  2 +-
 .../dual/halfspace_intersection_3.h           | 10 +--
 .../halfspace_intersection_interior_point_3.h |  8 +-
 ...fspace_intersection_with_constructions_3.h |  8 +-
 .../test_halfspace_intersections.cpp          |  6 +-
 .../Envelope_2/Env_divide_and_conquer_2.h     |  2 +-
 .../Env_divide_and_conquer_2_impl.h           |  6 +-
 .../CGAL/Filtered_predicate_with_state.h      |  4 +-
 Filtered_kernel/include/CGAL/Lazy.h           | 42 +++++-----
 Filtered_kernel/include/CGAL/Lazy_kernel.h    |  4 +-
 Installation/CHANGES.md                       |  1 +
 .../Intersections_2/variant_any_object.cpp    |  8 +-
 .../include/CGAL/Intersection_traits.h        |  6 +-
 .../include/CGAL/Intersection_traits_2.h      | 18 ++---
 .../CGAL/Intersections_2/Bbox_2_Bbox_2.h      |  4 +-
 .../include/CGAL/Intersection_traits_3.h      | 72 ++++++++---------
 .../CGAL/Intersections_3/Bbox_3_Bbox_3.h      |  6 +-
 .../CGAL/Intersections_3/Line_3_Plane_3.h     |  6 +-
 .../Intersections_3/Plane_3_Plane_3_Plane_3.h |  2 +-
 .../internal/Bbox_3_Segment_3_intersection.h  |  6 +-
 .../Iso_cuboid_3_Plane_3_intersection.h       |  2 +-
 .../internal/Line_3_Plane_3_intersection.h    |  6 +-
 .../Plane_3_Plane_3_Plane_3_intersection.h    | 12 +--
 .../Plane_3_Tetrahedron_3_intersection.h      |  2 +-
 .../internal/Ray_3_Triangle_3_intersection.h  | 12 +--
 .../Tetrahedron_3_Triangle_3_intersection.h   |  2 +-
 .../test_intersections_Tetrahedron_3.cpp      |  2 +-
 .../Kernel_23/CGAL/Projection_traits_xy_3.h   |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/intersections.h  | 12 +--
 Kernel_23/doc/Kernel_23/Kernel_23.txt         |  2 +-
 Kernel_23/include/CGAL/Kernel/Type_mapper.h   |  6 +-
 .../include/CGAL/Kernel/function_objects.h    | 10 +--
 .../Kernel_23/internal/Projection_traits_3.h  |  8 +-
 .../internal/Projection_traits_base_3.h       | 38 ++++-----
 .../CGAL/_test_all_linear_intersections.h     |  4 +-
 Kernel_d/doc/Kernel_d/CGAL/intersections_d.h  |  4 +-
 Kernel_d/doc/Kernel_d/Kernel_d.txt            |  2 +-
 .../include/CGAL/Kernel_d/function_objects.h  | 18 ++---
 Mesh_3/benchmark/Mesh_3/StdAfx.h              |  2 +-
 .../Concepts/IntersectionGeometricTraits_3.h  |  4 +-
 .../doc/Mesh_3/Concepts/MeshCellCriteria_3.h  |  2 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h     |  8 +-
 .../doc/Mesh_3/Concepts/MeshFacetCriteria_3.h |  2 +-
 .../Concepts/MeshTriangulationTraits_3.h      |  6 +-
 .../Mesh_3/mesh_hybrid_mesh_domain.cpp        |  4 +-
 Mesh_3/include/CGAL/Labeled_mesh_domain_3.h   |  6 +-
 Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h     | 34 ++++----
 .../CGAL/Mesh_3/Protect_edges_sizing_field.h  |  4 +-
 Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h   |  2 +-
 Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h  |  6 +-
 Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h   | 12 +--
 .../Sizing_field_with_aabb_tree.h             |  8 +-
 ...tialize_triangulation_from_labeled_image.h |  4 +-
 .../CGAL/Mesh_3/mesh_standard_criteria.h      |  6 +-
 .../CGAL/Mesh_3/polylines_to_protect.h        | 16 ++--
 .../include/CGAL/Mesh_3/vertex_perturbation.h |  2 +-
 .../CGAL/Polyhedral_complex_mesh_domain_3.h   | 12 +--
 .../include/CGAL/Polyhedral_mesh_domain_3.h   | 12 +--
 .../AABB_traversal_traits_with_join.h         | 12 +--
 .../Minkowski_sum_2/AABB_tree_with_join.h     | 10 +--
 Nef_2/include/CGAL/Nef_2/HDS_items.h          | 10 +--
 ...xact_triangulation_euclidean_traits_xy_3.h | 16 ++--
 ...xact_triangulation_euclidean_traits_xz_3.h | 16 ++--
 ...xact_triangulation_euclidean_traits_yz_3.h | 16 ++--
 Nef_3/include/CGAL/Nef_3/SNC_structure.h      | 34 ++++----
 Nef_S2/include/CGAL/Nef_S2/Sphere_map.h       | 16 ++--
 .../CGAL/Sqrt_extension/Sqrt_extension_type.h |  4 +-
 .../OTR_2/Reconstruction_triangulation_2.h    | 34 ++++----
 .../Protect_edges_sizing_field.h              |  4 +-
 .../voronoi_covariance_3.h                    |  2 +-
 .../include/CGAL/structure_point_set.h        |  4 +-
 ...refinement_mesh_union_and_intersection.cpp |  2 +-
 .../Polygon_mesh_processing/corefinement.h    | 52 ++++++-------
 .../Corefinement/Face_graph_output_builder.h  | 16 ++--
 .../internal/Corefinement/face_graph_utils.h  | 12 +--
 .../Corefinement/intersection_nodes.h         |  4 +-
 .../Hole_filling/Triangulate_hole_polyline.h  | 10 +--
 .../Isotropic_remeshing/remesh_impl.h         |  6 +-
 .../Axis_parallel_plane_traits.h              |  4 +-
 .../Point_inside_vertical_ray_cast.h          | 12 +--
 .../internal/Smoothing/curvature_flow_impl.h  |  8 +-
 .../CGAL/Polygon_mesh_processing/locate.h     |  2 +-
 .../repair_degeneracies.h                     | 18 ++---
 .../include/CGAL/Polygon_mesh_slicer.h        |  4 +-
 .../include/CGAL/Polyhedral_envelope.h        | 16 ++--
 .../include/CGAL/Side_of_triangle_mesh.h      |  6 +-
 .../Polyhedral_envelope_filter.h              | 14 ++--
 .../test_corefinement_and_constraints.cpp     |  6 +-
 .../test_corefinement_bool_op.cpp             |  2 +-
 .../test_pmp_locate.cpp                       |  6 +-
 Polyhedron/demo/Polyhedron/MainWindow.cpp     |  4 +-
 .../Plugins/Mesh_3/Io_image_plugin.cpp        | 10 +--
 .../Plugins/Mesh_3/Mesh_3_plugin.cpp          | 10 +--
 .../PMP/Point_inside_polyhedron_plugin.cpp    |  8 +-
 .../Plugins/PMP/Selection_plugin.cpp          |  4 +-
 .../Edit_polyhedron_plugin.cpp                |  4 +-
 .../Scene_edit_polyhedron_item.cpp            |  4 +-
 .../Scene_edit_polyhedron_item.h              |  4 +-
 .../Scene_polyhedron_selection_item.h         | 14 ++--
 .../Polyhedron/Travel_isolated_components.h   |  2 +-
 .../PolylineSimplificationCostFunction.h      |  4 +-
 .../Hybrid_squared_distance_cost.h            |  2 +-
 .../Scaled_squared_distance_cost.h            |  6 +-
 .../Squared_distance_cost.h                   |  2 +-
 .../CGAL/Polyline_simplification_2/simplify.h |  6 +-
 STL_Extension/doc/STL_Extension/CGAL/Object.h |  4 +-
 .../doc/STL_Extension/CGAL/iterator.h         |  6 +-
 .../Dispatch_output_iterator.cpp              |  2 +-
 .../include/CGAL/Modifiable_priority_queue.h  | 14 ++--
 STL_Extension/include/CGAL/Object.h           |  4 +-
 .../internal/boost/relaxed_heap.hpp           | 14 ++--
 STL_Extension/include/CGAL/iterator.h         |  4 +-
 .../test/STL_Extension/test_Object.cpp        |  6 +-
 .../STL_Extension/test_dispatch_output.cpp    |  4 +-
 .../doc/Spatial_searching/CGAL/Kd_tree.h      |  2 +-
 .../doc/Spatial_searching/CGAL/Kd_tree_node.h |  2 +-
 .../searching_with_circular_query.cpp         |  2 +-
 Spatial_searching/include/CGAL/Kd_tree.h      |  6 +-
 Spatial_searching/include/CGAL/Kd_tree_node.h | 18 ++---
 .../include/CGAL/Point_container.h            |  6 +-
 ...te_exterior_skeleton_tweaking_skeleton.cpp |  4 +-
 .../CGAL/Straight_skeleton_builder_2.h        |  2 +-
 .../CGAL/compute_outer_frame_margin.h         |  2 +-
 .../Concepts/PolygonOffsetBuilderTraits_2.h   |  2 +-
 .../StraightSkeletonBuilderTraits_2.h         |  4 +-
 .../Straight_skeleton_2/Low_level_API.cpp     |  2 +-
 ...offset_of_multiple_polygons_with_holes.cpp |  2 +-
 .../include/CGAL/Polygon_offset_builder_2.h   |  6 +-
 .../CGAL/Polygon_offset_builder_traits_2.h    |  6 +-
 .../Polygon_offset_builder_2_impl.h           |  2 +-
 .../Straight_skeleton_aux.h                   |  2 +-
 .../Straight_skeleton_builder_2_impl.h        |  2 +-
 .../Straight_skeleton_builder_traits_2_aux.h  | 38 ++++-----
 .../include/CGAL/Straight_skeleton_2/debug.h  |  4 +-
 .../CGAL/Straight_skeleton_builder_2.h        |  6 +-
 .../CGAL/Straight_skeleton_builder_traits_2.h | 34 ++++----
 .../include/CGAL/compute_outer_frame_margin.h | 12 +--
 .../constructions/Polygon_offset_cons_ftC2.h  |  8 +-
 .../Straight_skeleton_cons_ftC2.h             | 42 +++++-----
 .../include/CGAL/create_offset_polygons_2.h   |  6 +-
 .../include/CGAL/create_straight_skeleton_2.h |  4 +-
 .../predicates/Polygon_offset_pred_ftC2.h     |  8 +-
 .../predicates/Straight_skeleton_pred_ftC2.h  | 14 ++--
 .../include/CGAL/test_sls_traits_aux.cpp      |  2 +-
 .../test/Straight_skeleton_2/test_sls.cpp     | 10 +--
 .../Straight_skeleton_2/test_sls_offset.cpp   |  2 +-
 .../examples/Surface_mesh/sm_aabbtree.cpp     |  4 +-
 .../CGAL/Variational_shape_approximation.h    | 12 +--
 .../vsa_correctness_test.cpp                  |  4 +-
 .../vsa_teleportation_test.cpp                |  2 +-
 .../Surface_mesh_deformation_test_commons.h   |  2 +-
 .../internal/AABB_traversal_traits.h          |  2 +-
 .../internal/Filters.h                        |  6 +-
 .../internal/SDF_calculation.h                | 22 +++---
 .../Concepts/SurfaceMeshShortestPathTraits.h  |  2 +-
 .../Surface_mesh_shortest_path.h              |  2 +-
 .../Bounded_distance_placement.h              |  2 +-
 .../Bounded_normal_change_filter.h            |  4 +-
 .../Bounded_normal_change_placement.h         |  2 +-
 .../Edge_collapse/Constrained_placement.h     |  2 +-
 .../Policies/Edge_collapse/Edge_length_cost.h |  4 +-
 .../Edge_collapse/LindstromTurk_cost.h        |  4 +-
 .../Edge_collapse/LindstromTurk_placement.h   |  2 +-
 .../Edge_collapse/Midpoint_placement.h        |  2 +-
 .../Polyhedral_envelope_filter.h              |  4 +-
 .../EdgeCollapseSimplificationVisitor.h       |  6 +-
 .../Concepts/GetCost.h                        |  6 +-
 .../Concepts/GetPlacement.h                   |  4 +-
 .../Concepts/PlacementFilter.h                |  6 +-
 .../Surface_mesh_simplification.txt           |  2 +-
 .../edge_collapse_bounded_normal_change.cpp   |  6 +-
 .../edge_collapse_visitor_surface_mesh.cpp    |  6 +-
 .../include/CGAL/Cartesian/MatrixC33.h        |  6 +-
 .../Edge_collapse_visitor_base.h              |  6 +-
 .../Bounded_distance_placement.h              | 14 ++--
 .../Bounded_normal_change_filter.h            |  8 +-
 .../Bounded_normal_change_placement.h         |  8 +-
 .../Edge_collapse/Constrained_placement.h     |  2 +-
 .../Policies/Edge_collapse/Edge_length_cost.h |  4 +-
 .../Edge_collapse/FastEnvelope_filter.h       | 10 +--
 .../Edge_collapse/LindstromTurk_cost.h        |  4 +-
 .../Edge_collapse/LindstromTurk_placement.h   |  2 +-
 .../Edge_collapse/Midpoint_placement.h        |  4 +-
 .../internal/GarlandHeckbert_policy_base.h    | 14 ++--
 .../internal/Lindstrom_Turk_core.h            | 10 +--
 .../internal/Common.h                         |  8 +-
 .../internal/Edge_collapse.h                  | 14 ++--
 .../test_edge_collapse_Envelope.cpp           |  6 +-
 .../test_edge_collapse_Polyhedron_3.cpp       | 12 +--
 .../include/CGAL/AABB_polyhedral_oracle.h     |  6 +-
 .../internal/flip_edges.h                     | 20 ++---
 .../internal/smooth_vertices.h                | 16 ++--
 .../tetrahedral_adaptive_remeshing_impl.h     | 10 +--
 Three/include/CGAL/Three/exceptions.h         |  4 +-
 .../include/CGAL/Delaunay_triangulation.h     |  4 +-
 .../include/CGAL/Regular_triangulation.h      |  4 +-
 Triangulation/include/CGAL/Triangulation.h    |  8 +-
 .../ConstrainedTriangulationTraits_2.h        |  2 +-
 282 files changed, 1257 insertions(+), 1256 deletions(-)

diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
index 2f1fdc3e5c6b..e6d51ffdb756 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
@@ -47,7 +47,7 @@ Provides the operator:
 `return_type operator()(const Query& q, const Primitive::Datum& d)`,
 
 which computes the intersection between `q` and `d`. The type of the returned object
-must be a `boost::optional` of a `boost::variant` of the possible intersection types.
+must be a `std::optional` of a `boost::variant` of the possible intersection types.
 */
 typedef unspecified_type Intersect_3;
 
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
index 215cbd659249..3b186c9ff222 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
@@ -25,15 +25,15 @@ class AABBRayIntersectionTraits {
   /*!
     A functor object to compute the distance between the source of a ray and its
     closest intersection point between the ray and a primitive or a bounding box.
-    An empty `boost::optional` is returned, if there is no intersection.
+    An empty `std::optional` is returned, if there is no intersection.
     When there is an intersection, an object of type `FT` is returned such that
     if `i1` and `i2` are two intersection points, then `i1` is closer to the source
     of the ray than `i2` iff `n1 < n2`, `n1` and `n2` being the numbers returned for `i1` and `i2`
     respectively.
 
     Provides the operators:
-    `boost::optional<FT> operator()(const Ray_3& r, const Bounding_box& bbox)`.
-    `boost::optional<std::pair<FT, Intersection_and_primitive_id<Ray_3>::%Type > >
+    `std::optional<FT> operator()(const Ray_3& r, const Bounding_box& bbox)`.
+    `std::optional<std::pair<FT, Intersection_and_primitive_id<Ray_3>::%Type > >
      operator()(const Ray_3& r, const Primitive& primitive)`.
 
     A common algorithm to compute the intersection between a bounding box and a ray is <A
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
index c7f0e806faf6..c6f74462f551 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
@@ -119,10 +119,10 @@ typedef unspecified_type Do_intersect;
 
 /*!
 A functor object to compute the intersection of a query and a primitive. Provides the operator:
-`boost::optional<Intersection_and_primitive_id<Query>::%Type > operator()(const Query & q, const Primitive& primitive);` which returns the intersection as a pair composed of an object and a primitive id, iff the query intersects the primitive.
+`std::optional<Intersection_and_primitive_id<Query>::%Type > operator()(const Query & q, const Primitive& primitive);` which returns the intersection as a pair composed of an object and a primitive id, iff the query intersects the primitive.
 
 \cgalHeading{Note on Backward Compatibility}
-Before the release 4.3 of \cgal, the return type of this function used to be `boost::optional<Object_and_primitive_id>`.
+Before the release 4.3 of \cgal, the return type of this function used to be `std::optional<Object_and_primitive_id>`.
 */
 typedef unspecified_type Intersection;
 
diff --git a/AABB_tree/examples/AABB_tree/AABB_polyhedron_facet_intersection_example.cpp b/AABB_tree/examples/AABB_tree/AABB_polyhedron_facet_intersection_example.cpp
index 4a4a1e613064..e01e49c0b6ec 100644
--- a/AABB_tree/examples/AABB_tree/AABB_polyhedron_facet_intersection_example.cpp
+++ b/AABB_tree/examples/AABB_tree/AABB_polyhedron_facet_intersection_example.cpp
@@ -19,8 +19,8 @@ typedef CGAL::Polyhedron_3<K> Polyhedron;
 typedef CGAL::AABB_face_graph_triangle_primitive<Polyhedron> Primitive;
 typedef CGAL::AABB_traits<K, Primitive> Traits;
 typedef CGAL::AABB_tree<Traits> Tree;
-typedef boost::optional< Tree::Intersection_and_primitive_id<Segment>::Type > Segment_intersection;
-typedef boost::optional< Tree::Intersection_and_primitive_id<Plane>::Type > Plane_intersection;
+typedef std::optional< Tree::Intersection_and_primitive_id<Segment>::Type > Segment_intersection;
+typedef std::optional< Tree::Intersection_and_primitive_id<Plane>::Type > Plane_intersection;
 typedef Tree::Primitive_id Primitive_id;
 
 int main()
diff --git a/AABB_tree/examples/AABB_tree/AABB_ray_shooting_example.cpp b/AABB_tree/examples/AABB_tree/AABB_ray_shooting_example.cpp
index d3b2af45913f..fc450abd5a80 100644
--- a/AABB_tree/examples/AABB_tree/AABB_ray_shooting_example.cpp
+++ b/AABB_tree/examples/AABB_tree/AABB_ray_shooting_example.cpp
@@ -23,7 +23,7 @@ typedef boost::graph_traits<Mesh>::halfedge_descriptor halfedge_descriptor;
 typedef CGAL::AABB_face_graph_triangle_primitive<Mesh> Primitive;
 typedef CGAL::AABB_traits<K, Primitive> Traits;
 typedef CGAL::AABB_tree<Traits> Tree;
-typedef boost::optional<Tree::Intersection_and_primitive_id<Ray>::Type> Ray_intersection;
+typedef std::optional<Tree::Intersection_and_primitive_id<Ray>::Type> Ray_intersection;
 
 struct Skip
 {
diff --git a/AABB_tree/include/CGAL/AABB_traits.h b/AABB_tree/include/CGAL/AABB_traits.h
index b2eb87dc8f6a..f5c1c1240a14 100644
--- a/AABB_tree/include/CGAL/AABB_traits.h
+++ b/AABB_tree/include/CGAL/AABB_traits.h
@@ -27,7 +27,7 @@
 #include <CGAL/Kernel_23/internal/Has_boolean_tags.h>
 
 
-#include <boost/optional.hpp>
+#include <optional>
 
 /// \file AABB_traits.h
 
@@ -39,7 +39,7 @@ template <class T>
 struct Remove_optional  { typedef T type; };
 
 template <class T>
-struct Remove_optional< ::boost::optional<T> >  { typedef T type; };
+struct Remove_optional< ::std::optional<T> >  { typedef T type; };
 
 //helper controlling whether extra data should be stored in the AABB_tree traits class
 template <class Primitive, bool has_shared_data=Has_nested_type_Shared_data<Primitive>::value>
@@ -85,7 +85,7 @@ struct AABB_traits_base_2<GeomTraits,true>{
   typedef typename CGAL::Bbox_3      Bounding_box;
 
   struct Intersection_distance {
-    boost::optional<FT> operator()(const Ray_3& ray, const Bounding_box& bbox) const {
+    std::optional<FT> operator()(const Ray_3& ray, const Bounding_box& bbox) const {
       FT t_near = -DBL_MAX; // std::numeric_limits<FT>::lowest(); C++1903
       FT t_far = DBL_MAX;
 
@@ -101,7 +101,7 @@ struct AABB_traits_base_2<GeomTraits,true>{
       for(int i = 0; i < 3; ++i, ++source_iter, ++direction_iter) {
         if(*direction_iter == 0) {
           if((*source_iter < (bbox.min)(i)) || (*source_iter > (bbox.max)(i))) {
-            return boost::none;
+            return std::nullopt;
           }
         } else {
           FT t1 = ((bbox.min)(i) - *source_iter) / *direction_iter;
@@ -118,7 +118,7 @@ struct AABB_traits_base_2<GeomTraits,true>{
           //   t_far = t2;
 
           if(t_near > t_far || t_far < FT(0.))
-            return boost::none;
+            return std::nullopt;
         }
       }
 
@@ -193,7 +193,7 @@ class AABB_traits
 
   /// `Intersection_and_primitive_id<Query>::%Type::first_type` is found according to
   /// the result type of `GeomTraits::Intersect_3::operator()`. If it is
-  /// `boost::optional<T>` then it is `T`, and the result type otherwise.
+  /// `std::optional<T>` then it is `T`, and the result type otherwise.
   template<typename Query>
   struct Intersection_and_primitive_id {
     typedef decltype(
@@ -364,12 +364,12 @@ class AABB_traits
     Intersection(const AABB_traits<GeomTraits,AABBPrimitive,BboxMap>& traits)
       :m_traits(traits) {}
     template<typename Query>
-    boost::optional< typename Intersection_and_primitive_id<Query>::Type >
+    std::optional< typename Intersection_and_primitive_id<Query>::Type >
     operator()(const Query& query, const typename AT::Primitive& primitive) const {
       auto inter_res = GeomTraits().intersect_3_object()(query, internal::Primitive_helper<AT>::get_datum(primitive,m_traits));
       if (!inter_res)
-        return boost::none;
-      return boost::make_optional( std::make_pair(*inter_res, primitive.id()) );
+        return std::nullopt;
+      return std::make_optional( std::make_pair(*inter_res, primitive.id()) );
     }
   };
 
diff --git a/AABB_tree/include/CGAL/AABB_tree.h b/AABB_tree/include/CGAL/AABB_tree.h
index 0016d4ecc097..4645264460e5 100644
--- a/AABB_tree/include/CGAL/AABB_tree.h
+++ b/AABB_tree/include/CGAL/AABB_tree.h
@@ -26,7 +26,7 @@
 #include <CGAL/AABB_tree/internal/AABB_search_tree.h>
 #include <CGAL/AABB_tree/internal/Has_nested_type_Shared_data.h>
 #include <CGAL/AABB_tree/internal/Primitive_helper.h>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/lambda/lambda.hpp>
 
 #ifdef CGAL_HAS_THREADS
@@ -271,7 +271,7 @@ namespace CGAL {
     /// \tparam Query must be a type for which `Do_intersect` operators are
     ///               defined in the traits class `AABBTraits`.
     template <typename Query>
-    boost::optional<Primitive_id> any_intersected_primitive(const Query& query) const;
+    std::optional<Primitive_id> any_intersected_primitive(const Query& query) const;
     ///@}
 
     /// \name Intersections
@@ -294,7 +294,7 @@ namespace CGAL {
     /// \tparam Query must be a type for which `Do_intersect` and `Intersection` operators are
     ///               defined in the traits class `AABBTraits`.
     template <typename Query>
-    boost::optional< typename Intersection_and_primitive_id<Query>::Type >
+    std::optional< typename Intersection_and_primitive_id<Query>::Type >
     any_intersection(const Query& query) const;
 
 
@@ -318,12 +318,12 @@ namespace CGAL {
     /// `AABBTraits` must be a model of `AABBRayIntersectionTraits` to
     /// call this member function.
     template<typename Ray, typename SkipFunctor>
-    boost::optional< typename Intersection_and_primitive_id<Ray>::Type >
+    std::optional< typename Intersection_and_primitive_id<Ray>::Type >
     first_intersection(const Ray& query, const SkipFunctor& skip) const;
 
     /// \cond
     template<typename Ray>
-    boost::optional< typename Intersection_and_primitive_id<Ray>::Type >
+    std::optional< typename Intersection_and_primitive_id<Ray>::Type >
     first_intersection(const Ray& query) const
     {
       return first_intersection(query, boost::lambda::constant(false));
@@ -343,12 +343,12 @@ namespace CGAL {
     /// `AABBTraits` must be a model of `AABBRayIntersectionTraits` to
     /// call this member function.
     template<typename Ray, typename SkipFunctor>
-    boost::optional<Primitive_id>
+    std::optional<Primitive_id>
     first_intersected_primitive(const Ray& query, const SkipFunctor& skip) const;
 
     /// \cond
     template<typename Ray>
-    boost::optional<Primitive_id>
+    std::optional<Primitive_id>
     first_intersected_primitive(const Ray& query) const
     {
       return first_intersected_primitive(query, boost::lambda::constant(false));
@@ -964,7 +964,7 @@ namespace CGAL {
 
   template <typename Tr>
   template <typename Query>
-  boost::optional< typename AABB_tree<Tr>::template Intersection_and_primitive_id<Query>::Type >
+  std::optional< typename AABB_tree<Tr>::template Intersection_and_primitive_id<Query>::Type >
     AABB_tree<Tr>::any_intersection(const Query& query) const
   {
     using namespace CGAL::internal::AABB_tree;
@@ -976,7 +976,7 @@ namespace CGAL {
 
   template <typename Tr>
   template <typename Query>
-  boost::optional<typename AABB_tree<Tr>::Primitive_id>
+  std::optional<typename AABB_tree<Tr>::Primitive_id>
     AABB_tree<Tr>::any_intersected_primitive(const Query& query) const
   {
     using namespace CGAL::internal::AABB_tree;
diff --git a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
index ff091ce6c24b..1bc03ff4cf4d 100644
--- a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
+++ b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
@@ -19,7 +19,7 @@
 
 #include <functional>
 #include <type_traits>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/variant/apply_visitor.hpp>
 #  if defined(BOOST_MSVC)
 #    pragma warning(push)
@@ -43,7 +43,7 @@ class AABB_ray_intersection {
 public:
   AABB_ray_intersection(const AABBTree& tree) : tree_(tree) {}
 
-  boost::optional< Ray_intersection_and_primitive_id >
+  std::optional< Ray_intersection_and_primitive_id >
   ray_intersection(const Ray& query, SkipFunctor skip) const {
     // We hit the root, now continue on the children. Keep track of
     // nb_primitives through a variable in each Node on the stack. In
@@ -63,7 +63,7 @@ class AABB_ray_intersection {
 
     Heap_type pq;
     // pq.reserve(tree_.size() / 2);
-    boost::optional< Ray_intersection_and_primitive_id >
+    std::optional< Ray_intersection_and_primitive_id >
       intersection, /* the temporary for calculating the result */
       p; /* the current best intersection */
 
@@ -121,7 +121,7 @@ class AABB_ray_intersection {
 
         // right child
         const Node* child = &(current.node->right_child());
-        boost::optional< FT > dist = intersection_distance_obj(query, child->bbox());
+        std::optional< FT > dist = intersection_distance_obj(query, child->bbox());
         if(dist)
           pq.push(Node_ptr_with_ft(child, *dist, 2));
 
@@ -130,7 +130,7 @@ class AABB_ray_intersection {
       default: // Children both inner nodes
       {
         const Node* child = &(current.node->left_child());
-        boost::optional<FT> dist = intersection_distance_obj(query, child->bbox());
+        std::optional<FT> dist = intersection_distance_obj(query, child->bbox());
         if(dist)
           pq.push(Node_ptr_with_ft(child, *dist, current.nb_primitives/2));
 
@@ -198,7 +198,7 @@ class AABB_ray_intersection {
 
 template<typename AABBTraits>
 template<typename Ray, typename SkipFunctor>
-boost::optional< typename AABB_tree<AABBTraits>::template Intersection_and_primitive_id<Ray>::Type >
+std::optional< typename AABB_tree<AABBTraits>::template Intersection_and_primitive_id<Ray>::Type >
 AABB_tree<AABBTraits>::first_intersection(const Ray& query,
                                           const SkipFunctor& skip) const {
   static_assert((std::is_same<Ray, typename AABBTraits::Ray_3>::value),
@@ -219,22 +219,22 @@ AABB_tree<AABBTraits>::first_intersection(const Ray& query,
       break;
     }
   }
-  return boost::none;
+  return std::nullopt;
 }
 
 template<typename AABBTraits>
 template<typename Ray, typename SkipFunctor>
-boost::optional<typename AABB_tree<AABBTraits>::Primitive_id>
+std::optional<typename AABB_tree<AABBTraits>::Primitive_id>
 AABB_tree<AABBTraits>::first_intersected_primitive(const Ray& query,
                             const SkipFunctor& skip) const
 {
-  boost::optional<
+  std::optional<
     typename AABB_tree<AABBTraits>::
       template Intersection_and_primitive_id<Ray>::Type > res =
         first_intersection(query, skip);
   if ( (bool) res )
-    return boost::make_optional( res->second );
-  return boost::none;
+    return std::make_optional( res->second );
+  return std::nullopt;
 }
 
 }
diff --git a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_traversal_traits.h b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_traversal_traits.h
index fe7e85effddf..645ce1347cb2 100644
--- a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_traversal_traits.h
+++ b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_traversal_traits.h
@@ -17,7 +17,7 @@
 
 
 #include <CGAL/AABB_tree/internal/AABB_node.h>
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 
@@ -69,7 +69,7 @@ class First_intersection_traits
 
 public:
   typedef
-  boost::optional< typename AABBTraits::template Intersection_and_primitive_id<Query>::Type >
+  std::optional< typename AABBTraits::template Intersection_and_primitive_id<Query>::Type >
   Result;
 public:
   First_intersection_traits(const AABBTraits& traits)
@@ -124,7 +124,7 @@ class Listing_intersection_traits
 
   void intersection(const Query& query, const Primitive& primitive)
   {
-    boost::optional< typename AABBTraits::template Intersection_and_primitive_id<Query>::Type >
+    std::optional< typename AABBTraits::template Intersection_and_primitive_id<Query>::Type >
     intersection = m_traits.intersection_object()(query, primitive);
 
     if(intersection)
@@ -211,7 +211,7 @@ class First_primitive_traits
   {
     if( m_traits.do_intersect_object()(query, primitive) )
     {
-      m_result = boost::optional<typename Primitive::Id>(primitive.id());
+      m_result = std::optional<typename Primitive::Id>(primitive.id());
       m_is_found = true;
     }
   }
@@ -221,12 +221,12 @@ class First_primitive_traits
     return m_traits.do_intersect_object()(query, node.bbox());
   }
 
-  boost::optional<typename Primitive::Id> result() const { return m_result; }
+  std::optional<typename Primitive::Id> result() const { return m_result; }
   bool is_intersection_found() const { return m_is_found; }
 
 private:
   bool m_is_found;
-  boost::optional<typename Primitive::Id> m_result;
+  std::optional<typename Primitive::Id> m_result;
   const AABBTraits& m_traits;
 };
 
diff --git a/AABB_tree/test/AABB_tree/AABB_test_util.h b/AABB_tree/test/AABB_tree/AABB_test_util.h
index 5b73a20f9f22..61ddd98f3bd0 100644
--- a/AABB_tree/test/AABB_tree/AABB_test_util.h
+++ b/AABB_tree/test/AABB_tree/AABB_test_util.h
@@ -95,20 +95,20 @@ void test_all_intersection_query_types(Tree& tree)
     tree.all_intersected_primitives(segment,std::back_inserter(primitives));
 
     // any_intersection
-    boost::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Ray>::Type > r = tree.any_intersection(ray);
-    boost::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Line>::Type > l = tree.any_intersection(line);
-    boost::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Segment>::Type > s = tree.any_intersection(segment);
+    std::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Ray>::Type > r = tree.any_intersection(ray);
+    std::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Line>::Type > l = tree.any_intersection(line);
+    std::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Segment>::Type > s = tree.any_intersection(segment);
 
     // any_intersected_primitive
-    boost::optional<typename Primitive::Id> optional_primitive;
+    std::optional<typename Primitive::Id> optional_primitive;
     optional_primitive = tree.any_intersected_primitive(ray);
     optional_primitive = tree.any_intersected_primitive(line);
     optional_primitive = tree.any_intersected_primitive(segment);
 
     // all_intersections
-    std::list< boost::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Ray>::Type > > intersections_r;
-    std::list< boost::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Line>::Type > > intersections_l;
-    std::list< boost::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Segment>::Type > > intersections_s;
+    std::list< std::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Ray>::Type > > intersections_r;
+    std::list< std::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Line>::Type > > intersections_l;
+    std::list< std::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Segment>::Type > > intersections_s;
     tree.all_intersections(ray,std::back_inserter(intersections_r));
     tree.all_intersections(line,std::back_inserter(intersections_l));
     tree.all_intersections(segment,std::back_inserter(intersections_s));
@@ -322,7 +322,7 @@ class Naive_implementations
   typedef typename Traits::Point_3 Point;
   typedef typename Traits::Point_and_primitive_id Point_and_primitive_id;
 
-  typedef boost::optional<Object_and_primitive_id> Intersection_result;
+  typedef std::optional<Object_and_primitive_id> Intersection_result;
 
   const Traits& m_traits;
 public:
@@ -380,7 +380,7 @@ class Naive_implementations
     Polyhedron_primitive_iterator it = Pr_generator().begin(p);
     for ( ; it != Pr_generator().end(p) ; ++it )
     {
-      boost::optional< typename Traits::template Intersection_and_primitive_id<Query>::Type >
+      std::optional< typename Traits::template Intersection_and_primitive_id<Query>::Type >
         intersection  = m_traits.intersection_object()(query, Pr(it,p));
       if ( intersection )
         *out++ = *intersection;
@@ -653,7 +653,7 @@ class Tree_vs_naive
       }
 
       // any_intersected_primitive test (do not count time here)
-      typedef boost::optional<typename Primitive::Id> Any_primitive;
+      typedef std::optional<typename Primitive::Id> Any_primitive;
       Any_primitive primitive = tree.any_intersected_primitive(query);
 
       // Check: verify we do get the result by naive method
@@ -723,7 +723,7 @@ class Tree_vs_naive
       }
 
       // Any intersection test (do not count time here)
-      boost::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Query>::Type >
+      std::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Query>::Type >
         intersection = tree.any_intersection(query);
 
       // Check: verify we do get the result by naive method
diff --git a/AABB_tree/test/AABB_tree/aabb_any_all_benchmark.cpp b/AABB_tree/test/AABB_tree/aabb_any_all_benchmark.cpp
index 5e09d6c22919..eb6fef9082a5 100644
--- a/AABB_tree/test/AABB_tree/aabb_any_all_benchmark.cpp
+++ b/AABB_tree/test/AABB_tree/aabb_any_all_benchmark.cpp
@@ -46,7 +46,7 @@ std::size_t intersect(ForwardIterator b, ForwardIterator e, const Tree& tree, lo
   v.reserve(elements);
   for(; b != e; ++b) {
     tree.all_intersections(*b, std::back_inserter(v));
-    boost::optional<Obj_type> o = tree.any_intersection(*b);
+    std::optional<Obj_type> o = tree.any_intersection(*b);
     if(o)
       ++counter;
   }
diff --git a/AABB_tree/test/AABB_tree/aabb_correctness_triangle_test.cpp b/AABB_tree/test/AABB_tree/aabb_correctness_triangle_test.cpp
index 13eb303b771b..54ef4c600f6b 100644
--- a/AABB_tree/test/AABB_tree/aabb_correctness_triangle_test.cpp
+++ b/AABB_tree/test/AABB_tree/aabb_correctness_triangle_test.cpp
@@ -65,7 +65,7 @@ int test()
     return EXIT_FAILURE;
   }
 
-  boost::optional<Object_and_primitive_id> any;
+  std::optional<Object_and_primitive_id> any;
   any = tree.any_intersection(pq);
   if(!any)
   {
diff --git a/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp b/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp
index 4e86ed22d7fd..cbe92baaf705 100644
--- a/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp
+++ b/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp
@@ -36,7 +36,7 @@ FT point_on_ray_dist(const Ray& ray, const Point& point) {
 
 std::size_t accum = 0;
 
-boost::optional<
+std::optional<
   Tree::Intersection_and_primitive_id<Ray>::Type
   >
 min_intersection(const Tree& tree, const Ray& ray) {
@@ -46,9 +46,9 @@ min_intersection(const Tree& tree, const Ray& ray) {
   tree.all_intersections(ray, std::back_inserter(all_intersections));
   accum += all_intersections.size();
   Tree::FT min_distance = DBL_MAX;
-  boost::optional<
+  std::optional<
     Tree::Intersection_and_primitive_id<Ray>::Type
-    > mini = boost::none;
+    > mini = std::nullopt;
 
   for(IntersectionVector::iterator it2 = all_intersections.begin(); it2 != all_intersections.end(); ++it2) {
     if(Point* point = boost::get<Point>(&(it2->first))) {
@@ -125,7 +125,7 @@ int main()
   rays.reserve(NB_RAYS);
   std::transform(v1.begin(), v1.end(), v2.begin(),
                  std::back_inserter(rays), boost::value_factory<Ray>());
-  std::vector< boost::optional<Tree::Intersection_and_primitive_id<Ray>::Type > > primitives1, primitives2;
+  std::vector< std::optional<Tree::Intersection_and_primitive_id<Ray>::Type > > primitives1, primitives2;
   primitives1.reserve(NB_RAYS); primitives2.reserve(NB_RAYS);
 
 
@@ -140,7 +140,7 @@ int main()
   }
   assert(primitives1.size() == primitives2.size()); //  Different amount of primitives intersected
   assert(std::equal(primitives1.begin(), primitives1.end(), primitives2.begin())); //  Primitives mismatch
-  std::size_t c = primitives1.size() - std::count(primitives1.begin(), primitives1.end(), boost::none);
+  std::size_t c = primitives1.size() - std::count(primitives1.begin(), primitives1.end(), std::nullopt);
   std::cout << "Intersected " << c << " primitives with " << NB_RAYS << " rays" << std::endl;
   std::cout << "Primitive method had to sort " << accum/NB_RAYS
             << " intersections on average." << std::endl;
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
index a02edebb8e13..b249fbf4629d 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
@@ -27,7 +27,7 @@
 #include <type_traits>
 #include <CGAL/iterator.h>
 #include <CGAL/assertions.h>
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <CGAL/basic.h>
 #include <CGAL/config.h>
@@ -359,7 +359,7 @@ class Algebraic_curve_kernel_2 : public AlgebraicKernel_d_1{
        Unary_compose(const Unary_compose& other) = default;
        Unary_compose& operator=(const Unary_compose& other) = default;
 
-       Unary_compose() : _inner(::boost::none),_outer(::boost::none) {}
+       Unary_compose() : _inner(::std::nullopt),_outer(::std::nullopt) {}
 
        typedef typename InnerFunctor::argument_type argument_type;
        typedef typename OuterFunctor::result_type result_type;
@@ -371,8 +371,8 @@ class Algebraic_curve_kernel_2 : public AlgebraicKernel_d_1{
          return _outer.get()(_inner.get()(arg));
        }
     private:
-       ::boost::optional<InnerFunctor> _inner;
-       ::boost::optional<OuterFunctor> _outer;
+       ::std::optional<InnerFunctor> _inner;
+       ::std::optional<OuterFunctor> _outer;
     };
 
     template<typename InnerFunctor,typename OuterFunctor>
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_d_1.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_d_1.h
index 2b5a30867ce5..9c23acc6bd05 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_d_1.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_d_1.h
@@ -174,7 +174,7 @@ public :
       long old_precision = get_precision( BFI() );
       set_precision( BFI(), 53 );
       std::pair<double, double> interval = CGAL::to_interval( convert_to_bfi( (*this)));
-      this->ptr()->interval_option = boost::optional< std::pair<double, double> >(interval);
+      this->ptr()->interval_option = std::optional< std::pair<double, double> >(interval);
       set_precision( BFI(), old_precision );
       return *(this->ptr()->interval_option);
     }
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_quadratic_refinement_rep_bfi.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_quadratic_refinement_rep_bfi.h
index b7e686d42035..9e1cff2083b8 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_quadratic_refinement_rep_bfi.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_quadratic_refinement_rep_bfi.h
@@ -86,10 +86,10 @@ class Algebraic_real_quadratic_refinement_rep_bfi
         CGAL::Polynomial_traits_d<Poly>::template Rebind<BFI,1>
     ::Other::Type BFI_polynomial;
 
-    mutable boost::optional
+    mutable std::optional
         < BFI_polynomial > f_bfi_;
 
-    mutable boost::optional<BFI> low_bfi_, f_low_bfi_,
+    mutable std::optional<BFI> low_bfi_, f_low_bfi_,
         high_bfi_, f_high_bfi_;
 
     mutable long N;
@@ -229,21 +229,21 @@ class Algebraic_real_quadratic_refinement_rep_bfi
 
         bool poly_changed = (P!=this->polynomial());
         if(poly_changed) {
-            f_bfi_ = boost::none;
+            f_bfi_ = std::nullopt;
         }
         if(poly_changed || LOW != this->low()) {
-            f_low_bfi_ = low_bfi_ = boost::none;
+            f_low_bfi_ = low_bfi_ = std::nullopt;
         }
         if(poly_changed || HIGH != this->high()) {
-            f_high_bfi_ = high_bfi_ = boost::none;
+            f_high_bfi_ = high_bfi_ = std::nullopt;
         }
         Base::set_implicit_rep(P,LOW,HIGH,dummy_bool);
     }
 
     virtual void set_explicit_rep(const Field& m) const {
-        f_bfi_ = boost::none;
-        f_low_bfi_ = low_bfi_ = boost::none;
-        f_high_bfi_ = high_bfi_ = boost::none;
+        f_bfi_ = std::nullopt;
+        f_low_bfi_ = low_bfi_ = std::nullopt;
+        f_high_bfi_ = high_bfi_ = std::nullopt;
         Base::set_explicit_rep(m);
     }
 
@@ -256,13 +256,13 @@ class Algebraic_real_quadratic_refinement_rep_bfi
         if(this->is_rational()) return;
 
         if(old_low_!=this->low_) {
-            f_low_bfi_ = low_bfi_ = boost::none;
+            f_low_bfi_ = low_bfi_ = std::nullopt;
         }
         if(old_high_!=this->high_) {
-            f_high_bfi_ = high_bfi_ = boost::none;
+            f_high_bfi_ = high_bfi_ = std::nullopt;
         }
         if(old_pol != this->polynomial()) {
-            f_bfi_ = boost::none;
+            f_bfi_ = std::nullopt;
         }
     }
 
@@ -490,7 +490,7 @@ class Algebraic_real_quadratic_refinement_rep_bfi
         Poly f_old = this->polynomial();
         Base::simplify();
         if(f_old != this->polynomial()) {
-            f_bfi_ = boost::none;
+            f_bfi_ = std::nullopt;
         }
     }
 };
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_rep.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_rep.h
index cecfb57c9717..95e8907ad555 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_rep.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_rep.h
@@ -23,7 +23,7 @@
 #include <CGAL/basic.h>
 #include <CGAL/Polynomial_type_generator.h>
 #include <CGAL/Polynomial_traits_d.h>
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 
@@ -56,7 +56,7 @@ class Algebraic_real_rep{
 
     typedef Algebraic_real_rep <Coefficient,Rational>     Self;
 public:
-    typedef boost::optional< std::pair<double, double> >                  Interval_option;
+    typedef std::optional< std::pair<double, double> >                  Interval_option;
 
     mutable Poly polynomial_;                //!< square free polynomial
     mutable Rational low_;                      //!< lower endpoint of interval
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes_E08_tree.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes_E08_tree.h
index 2f7719bb3626..bf607e75f152 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes_E08_tree.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Bitstream_descartes_E08_tree.h
@@ -31,7 +31,7 @@
 #include <CGAL/Random.h>
 #include <CGAL/tss.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 /*
  *  AUXILIARY CLASSES AND FUNCTIONS
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
index b8bd5995a6f9..a11c4283a988 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
@@ -197,7 +197,7 @@ class Curve_analysis_2_rep {
         size_type index_of_content_root;
         size_type mult_of_prim_lcoeff_root;
         size_type index_of_prim_lcoeff_root;
-        boost::optional<Status_line_1> stack;
+        std::optional<Status_line_1> stack;
     };
 
     // Functor to get the X_coordinate of an Event_coordinate
@@ -211,14 +211,14 @@ class Curve_analysis_2_rep {
 
 
     //! The object holding the information about events, as an optional
-    mutable boost::optional<std::vector<Event_coordinate_1> >
+    mutable std::optional<std::vector<Event_coordinate_1> >
         event_coordinates;
 
     //! The algebraic kernel to use
     Algebraic_kernel_with_analysis_2* _m_kernel;
 
     //! The polynomial defining the curve
-    boost::optional<Polynomial_2> f;
+    std::optional<Polynomial_2> f;
 
     //! How degenerate situations are handled
     CGAL::Degeneracy_strategy degeneracy_strategy;
@@ -231,24 +231,24 @@ class Curve_analysis_2_rep {
      * \c f/cont(f). The corresponding curve is equal to the curve of \c f,
      * only without vertical line components.
      */
-    mutable boost::optional<Polynomial_2> f_primitive;
+    mutable std::optional<Polynomial_2> f_primitive;
 
     //! the polynomial containing all roots of the resultant of the primitive
     //! part of f and its y-derivative
-    mutable boost::optional<Polynomial_1>
+    mutable std::optional<Polynomial_1>
         resultant_of_primitive_and_derivative_y;
 
     //! the polynomial containing all roots of the resultant of the primitive
     //! part of f and its x-derivative
-    mutable boost::optional<Polynomial_1>
+    mutable std::optional<Polynomial_1>
         resultant_of_primitive_and_derivative_x;
 
     //! The Sturm-Habicht polynomials of f
-    mutable boost::optional<std::vector<Polynomial_2> >
+    mutable std::optional<std::vector<Polynomial_2> >
         sturm_habicht_of_primitive;
 
     //! The content of f
-    mutable boost::optional<Polynomial_1> content;
+    mutable std::optional<Polynomial_1> content;
 
     //! The non-working shear factors, as far as known
     mutable std::set<Integer> bad_shears;
@@ -257,10 +257,10 @@ class Curve_analysis_2_rep {
     mutable std::map<Integer,Handle> sheared_curves;
 
     //! Has the curve vertical line components
-    mutable boost::optional<bool> has_vertical_component;
+    mutable std::optional<bool> has_vertical_component;
 
     //! The intermediate values
-    mutable boost::optional<std::vector<boost::optional<Bound> > >
+    mutable std::optional<std::vector<std::optional<Bound> > >
     intermediate_values;
 
     //! stores Y_values at rational coordinate
@@ -273,7 +273,7 @@ class Curve_analysis_2_rep {
      *   are asymptotic to y=beta,
      *   or go to +/- infty also in y-direction
      */
-    mutable boost::optional<std::vector<CGAL::Object> >
+    mutable std::optional<std::vector<CGAL::Object> >
     horizontal_asymptotes_left, horizontal_asymptotes_right;
 
     //! friends
@@ -547,7 +547,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
 
         if(! this->ptr()->intermediate_values) {
             this->ptr()->intermediate_values
-                = std::vector<boost::optional<Bound> >
+                = std::vector<std::optional<Bound> >
                     (number_of_status_lines_with_event()+1);
         }
 
@@ -1720,7 +1720,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
 private:
 
     // Returns the intermediate values for intervals between events
-    std::vector<boost::optional<Bound> >& intermediate_values() const
+    std::vector<std::optional<Bound> >& intermediate_values() const
       {
         if(! this->ptr()->intermediate_values) {
             // This is created during event_coordiantes()
@@ -1916,7 +1916,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
                        static_cast<size_type>(content_roots.size()));
 
         this->ptr()->intermediate_values
-            = std::vector<boost::optional<Bound> >
+            = std::vector<std::optional<Bound> >
             (event_coordinate_vector.size()+1);
         this->ptr()->event_coordinates = event_coordinate_vector;
 
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
index 05b97af9bcd1..a38cf2ab659a 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
@@ -22,7 +22,7 @@
 #include <vector>
 #include <algorithm>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <CGAL/Handle_with_policy.h>
 #include <CGAL/boost/iterator/transform_iterator.hpp>
@@ -136,9 +136,9 @@ class Curve_pair_analysis_2_rep {
 
     typedef std::vector<Slice_element> Slice_info;
 
-    typedef boost::optional<Slice_info> Lazy_slice_info;
+    typedef std::optional<Slice_info> Lazy_slice_info;
 
-    typedef boost::optional<Bound> Lazy_bound;
+    typedef std::optional<Bound> Lazy_bound;
 
     typedef CGAL::internal::Event_indices<size_type> Event_indices;
 
@@ -151,11 +151,11 @@ class Curve_pair_analysis_2_rep {
     typedef std::vector<std::vector<Intersection_info> >
         Intersection_info_container;
 
-    typedef boost::optional<Intersection_info_container>
+    typedef std::optional<Intersection_info_container>
         Lazy_intersection_info_container;
 
     // For lazy evaluation of Status_line_CPA_1s.
-    typedef boost::optional<Status_line_CPA_1> Lazy_status_line_CPA_1;
+    typedef std::optional<Status_line_CPA_1> Lazy_status_line_CPA_1;
 
     //! @}
 
@@ -191,31 +191,31 @@ class Curve_pair_analysis_2_rep {
     Polynomial_2 g;
 
 
-    mutable boost::optional<std::vector<Polynomial_2> > subresultants;
+    mutable std::optional<std::vector<Polynomial_2> > subresultants;
 
-    mutable boost::optional<std::vector<Polynomial_1> >
+    mutable std::optional<std::vector<Polynomial_1> >
         principal_subresultants;
-    mutable boost::optional<std::vector<Polynomial_1> >
+    mutable std::optional<std::vector<Polynomial_1> >
         coprincipal_subresultants;
 
-    mutable boost::optional<Polynomial_1> resultant;
+    mutable std::optional<Polynomial_1> resultant;
 
-    mutable boost::optional<std::vector<Algebraic_real_1> > resultant_roots;
-    mutable boost::optional<std::vector<Algebraic_real_1> >
+    mutable std::optional<std::vector<Algebraic_real_1> > resultant_roots;
+    mutable std::optional<std::vector<Algebraic_real_1> >
         event_x_coordinates;
-    mutable boost::optional<std::vector<size_type> >
+    mutable std::optional<std::vector<size_type> >
         multiplicities_of_resultant_roots;
 
-    mutable boost::optional<std::vector<Bound> > stripe_values;
+    mutable std::optional<std::vector<Bound> > stripe_values;
 
     mutable std::vector< Lazy_status_line_CPA_1 > event_slices;
 
-    mutable boost::optional<std::vector< Lazy_bound > > intermediate_values;
+    mutable std::optional<std::vector< Lazy_bound > > intermediate_values;
 
-    mutable boost::optional< std::vector< Lazy_status_line_CPA_1 > >
+    mutable std::optional< std::vector< Lazy_status_line_CPA_1 > >
         intermediate_slices;
 
-    mutable boost::optional<std::vector<Event_indices> > event_indices;
+    mutable std::optional<std::vector<Event_indices> > event_indices;
 
     mutable Lazy_intersection_info_container intersection_info_container;
 
@@ -530,7 +530,7 @@ class Curve_pair_analysis_2 :
     /*
      * \brief Computes the intermediate x-coordinates and their status lines
      *
-     * In fact, it only fills the data fields with boost::none instances,
+     * In fact, it only fills the data fields with std::nullopt instances,
      * according to the lazy philosophy of the whole class.
      */
     void compute_intermediate_values_and_slices() const;
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CA_1.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CA_1.h
index 2bd1c6515c1c..c1260d26a456 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CA_1.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CA_1.h
@@ -127,7 +127,7 @@ class Status_line_CA_1_rep {
     //Arc_pair _m_num_arcs;
 
     //! sequence of arcs crossing this status line (valid only event lines)
-    mutable boost::optional<Arc_container> _m_arcs;
+    mutable std::optional<Arc_container> _m_arcs;
 
     //! number of arcs intersecting this status line
     mutable int _m_total_arcs;
@@ -160,10 +160,10 @@ class Status_line_CA_1_rep {
     std::vector< int > multiplicities_;*/
 
     // stores algebraic real over the vertical line
-    mutable std::vector<boost::optional< Algebraic_real_2 > >_m_xy_coords;
+    mutable std::vector<std::optional< Algebraic_real_2 > >_m_xy_coords;
 
     // stores the isolator instance
-    mutable boost::optional<Bitstream_descartes> isolator;
+    mutable std::optional<Bitstream_descartes> isolator;
 
      // befriending the handle
     friend class Status_line_CA_1<Curve_analysis_2, Self>;
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CPA_1.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CPA_1.h
index 26fb94416d1d..c3fb08048e7a 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CPA_1.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CPA_1.h
@@ -75,7 +75,7 @@ class Status_line_CPA_1_rep {
 
     // represents x-coordinate of event of rational value over interval
     // computed only by demand
-    mutable boost::optional<Algebraic_real_1> _m_x;
+    mutable std::optional<Algebraic_real_1> _m_x;
 
     // for each event point stores a pair of arcnos of the 1st and 2nd curve
     // or -1 if respective curve is not involved
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Xy_coordinate_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Xy_coordinate_2.h
index 81a74c56c38c..44432d3b2af2 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Xy_coordinate_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Xy_coordinate_2.h
@@ -81,10 +81,10 @@ class Xy_coordinate_2_rep {
     mutable int _m_arcno;
 
     // y-coordinate
-    mutable boost::optional< Algebraic_real_1 > _m_y;
+    mutable std::optional< Algebraic_real_1 > _m_y;
 
     //! A bounding box for the given point
-    mutable boost::optional< std::pair<double,Bbox_2> > _m_bbox_2_pair;
+    mutable std::optional< std::pair<double,Bbox_2> > _m_bbox_2_pair;
 
 };
 
diff --git a/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h b/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
index 22565c21d859..85afa0a60444 100644
--- a/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
+++ b/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
@@ -167,7 +167,7 @@ class Lazy_alpha_nt_2
 
   //members
   //the members can be updated when calling method exact()
-  mutable boost::optional<NT_exact> exact_;
+  mutable std::optional<NT_exact> exact_;
   mutable NT_approx approx_;
 
   //private functions
@@ -235,7 +235,7 @@ class Lazy_alpha_nt_2
 
   const NT_exact& exact() const
   {
-    if (exact_ == boost::none) {
+    if (exact_ == std::nullopt) {
       update_exact();
       approx_=to_interval(*exact_);
     }
diff --git a/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h b/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
index f20b050c1a2c..8d461cd93a59 100644
--- a/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
+++ b/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
@@ -22,7 +22,7 @@
 
 #include <memory>
 #include <boost/type_traits.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <iostream>
 
@@ -158,7 +158,7 @@ class Lazy_alpha_nt_3{
 
 //members
   //the members can be updated when calling method exact()
-  mutable boost::optional<NT_exact> exact_;
+  mutable std::optional<NT_exact> exact_;
   mutable NT_approx approx_;
 
 //private functions
@@ -229,7 +229,7 @@ class Lazy_alpha_nt_3{
   }
 
   const NT_exact& exact() const {
-    if (exact_ == boost::none){
+    if (exact_ == std::nullopt){
       update_exact();
       approx_=to_interval(*exact_);
     }
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.cpp
index 009eede6a798..d22b0d1474eb 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.cpp
@@ -135,7 +135,7 @@ static inline bool hasValidChars(const std::string& expression, int dimension)
 }
 
 template <typename Polynomial_d>
-boost::optional<Polynomial_d>
+std::optional<Polynomial_d>
 AlgebraicCurveParser<Polynomial_d>::operator()(const std::string& expression)
 {
   using Traits = CGAL::Polynomial_traits_d<Polynomial_d>;
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.h b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.h
index e838f2e3c0db..b5406743cb37 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.h
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.h
@@ -22,12 +22,12 @@
 
 #include <vector>
 #include <string>
-#include <boost/optional.hpp>
+#include <optional>
 
 template <typename Polynomial_d>
 struct AlgebraicCurveParser
 {
-  boost::optional<Polynomial_d> operator()(const std::string& expression);
+  std::optional<Polynomial_d> operator()(const std::string& expression);
 };
 
 #endif //ARRANGEMENT_ON_SURFACE_2_DEMO_ALGEBRAICCURVEPARSERNEW_H
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/EnvelopeCallback.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/EnvelopeCallback.cpp
index 71bb0f1d3c91..fe9eee327003 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/EnvelopeCallback.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/EnvelopeCallback.cpp
@@ -223,7 +223,7 @@ void EnvelopeCallback< Arr_>::updateEnvelope( bool lower )
   {
     if (!e->is_empty())
     {
-      boost::optional<Point_2> leftPoint, rightPoint;
+      std::optional<Point_2> leftPoint, rightPoint;
       if (e->left())
         leftPoint = e->left()->point();
 
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/GraphicsViewCurveInput.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/GraphicsViewCurveInput.cpp
index 441cdf5271b5..9c15b61bd94c 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/GraphicsViewCurveInput.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/GraphicsViewCurveInput.cpp
@@ -131,7 +131,7 @@ template <typename Arr_>
 void GraphicsViewCurveInput<Arr_>::curveInputDoneEvent(
   const std::vector<Point_2>& clickedPoints, CurveType type)
 {
-  boost::optional<Curve_2> cv =
+  std::optional<Curve_2> cv =
     this->curveGenerator.generate(clickedPoints, type);
   if (cv)
   {
@@ -144,9 +144,9 @@ void GraphicsViewCurveInput<Arr_>::curveInputDoneEvent(
 template <typename ArrTraits_>
 auto CurveGeneratorBase<ArrTraits_>::generate(
   const std::vector<Point_2>& clickedPoints, CurveType type)
-  -> boost::optional<Curve_2>
+  -> std::optional<Curve_2>
 {
-  boost::optional<Curve_2> res;
+  std::optional<Curve_2> res;
   switch (type)
   {
   case CurveType::Segment:
@@ -190,7 +190,7 @@ void CurveGeneratorBase<ArrTraits_>::setTraits(const ArrTraits* traits_)
 // Curve Generator Segment Traits
 template <typename Kernel_>
 auto CurveGenerator<CGAL::Arr_segment_traits_2<Kernel_>>::generateSegment(
-  const std::vector<Point_2>& clickedPoints) -> boost::optional<Curve_2>
+  const std::vector<Point_2>& clickedPoints) -> std::optional<Curve_2>
 {
   Curve_2 res{clickedPoints[0], clickedPoints[1]};
   return res;
@@ -200,7 +200,7 @@ auto CurveGenerator<CGAL::Arr_segment_traits_2<Kernel_>>::generateSegment(
 template <typename SegmentTraits>
 auto CurveGenerator<CGAL::Arr_polyline_traits_2<SegmentTraits>>::
   generatePolyline(const std::vector<Point_2>& clickedPoints)
-    -> boost::optional<Curve_2>
+    -> std::optional<Curve_2>
 {
   if (clickedPoints.size() < 2) return {};
 
@@ -212,7 +212,7 @@ auto CurveGenerator<CGAL::Arr_polyline_traits_2<SegmentTraits>>::
 // Curve Generator Linear Traits
 template <typename Kernel_>
 auto CurveGenerator<CGAL::Arr_linear_traits_2<Kernel_>>::generateSegment(
-  const std::vector<Point_2>& points) -> boost::optional<Curve_2>
+  const std::vector<Point_2>& points) -> std::optional<Curve_2>
 {
   Curve_2 res = Curve_2(Segment_2(points[0], points[1]));
   return res;
@@ -220,7 +220,7 @@ auto CurveGenerator<CGAL::Arr_linear_traits_2<Kernel_>>::generateSegment(
 
 template <typename Kernel_>
 auto CurveGenerator<CGAL::Arr_linear_traits_2<Kernel_>>::generateRay(
-  const std::vector<Point_2>& points) -> boost::optional<Curve_2>
+  const std::vector<Point_2>& points) -> std::optional<Curve_2>
 {
   Curve_2 res = Curve_2(Ray_2(points[0], points[1]));
   return res;
@@ -228,7 +228,7 @@ auto CurveGenerator<CGAL::Arr_linear_traits_2<Kernel_>>::generateRay(
 
 template <typename Kernel_>
 auto CurveGenerator<CGAL::Arr_linear_traits_2<Kernel_>>::generateLine(
-  const std::vector<Point_2>& points) -> boost::optional<Curve_2>
+  const std::vector<Point_2>& points) -> std::optional<Curve_2>
 {
   Curve_2 res = Curve_2(Line_2(points[0], points[1]));
   return res;
@@ -238,7 +238,7 @@ auto CurveGenerator<CGAL::Arr_linear_traits_2<Kernel_>>::generateLine(
 template <typename RatKernel, typename AlgKernel, typename NtTraits>
 auto CurveGenerator<Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>>::
   generateSegment(const std::vector<Point_2>& points)
-    -> boost::optional<Curve_2>
+    -> std::optional<Curve_2>
 {
   Curve_2 res = Curve_2(Rat_segment_2(points[0], points[1]));
   return res;
@@ -246,7 +246,7 @@ auto CurveGenerator<Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>>::
 
 template <typename RatKernel, typename AlgKernel, typename NtTraits>
 auto CurveGenerator<Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>>::
-  generateCircle(const std::vector<Point_2>& points) -> boost::optional<Curve_2>
+  generateCircle(const std::vector<Point_2>& points) -> std::optional<Curve_2>
 {
   auto sq_rad =
     (points[0].x() - points[1].x()) * (points[0].x() - points[1].x()) +
@@ -258,7 +258,7 @@ auto CurveGenerator<Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>>::
 template <typename RatKernel, typename AlgKernel, typename NtTraits>
 auto CurveGenerator<Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>>::
   generateEllipse(const std::vector<Point_2>& points)
-    -> boost::optional<Curve_2>
+    -> std::optional<Curve_2>
 {
   auto x1 = (CGAL::min)(points[0].x(), points[1].x());
   auto y1 = (CGAL::min)(points[0].y(), points[1].y());
@@ -286,7 +286,7 @@ auto CurveGenerator<Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>>::
 template <typename RatKernel, typename AlgKernel, typename NtTraits>
 auto CurveGenerator<Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>>::
   generateThreePointCircularArc(const std::vector<Point_2>& points)
-    -> boost::optional<Curve_2>
+    -> std::optional<Curve_2>
 {
   auto& qp1 = points[0];
   auto& qp2 = points[1];
@@ -310,7 +310,7 @@ auto CurveGenerator<Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>>::
 template <typename RatKernel, typename AlgKernel, typename NtTraits>
 auto CurveGenerator<Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>>::
   generateFivePointConicArc(const std::vector<Point_2>& points)
-    -> boost::optional<Curve_2>
+    -> std::optional<Curve_2>
 {
   auto& qp0 = points[0];
   auto& qp1 = points[1];
@@ -341,7 +341,7 @@ auto CurveGenerator<Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>>::
 // CurveGenerator Algebraic Traits
 template <typename Coefficient_>
 auto CurveGenerator<CGAL::Arr_algebraic_segment_traits_2<Coefficient_>>::
-  generateLine(const std::vector<Point_2>& points) -> boost::optional<Curve_2>
+  generateLine(const std::vector<Point_2>& points) -> std::optional<Curve_2>
 {
   RationalTraits ratTraits;
 
@@ -379,7 +379,7 @@ auto CurveGenerator<CGAL::Arr_algebraic_segment_traits_2<Coefficient_>>::
 
 template <typename Coefficient_>
 auto CurveGenerator<CGAL::Arr_algebraic_segment_traits_2<Coefficient_>>::
-  generateCircle(const std::vector<Point_2>& points) -> boost::optional<Curve_2>
+  generateCircle(const std::vector<Point_2>& points) -> std::optional<Curve_2>
 {
   auto sq_rad =
     (points[0].x() - points[1].x()) * (points[0].x() - points[1].x()) +
@@ -390,7 +390,7 @@ auto CurveGenerator<CGAL::Arr_algebraic_segment_traits_2<Coefficient_>>::
 template <typename Coefficient_>
 auto CurveGenerator<CGAL::Arr_algebraic_segment_traits_2<Coefficient_>>::
   generateEllipse(const std::vector<Point_2>& points)
-    -> boost::optional<Curve_2>
+    -> std::optional<Curve_2>
 {
   auto rx =
     (points[0].x() - points[1].x()) * (points[0].x() - points[1].x()) / 4.;
@@ -404,7 +404,7 @@ auto CurveGenerator<CGAL::Arr_algebraic_segment_traits_2<Coefficient_>>::
 template <typename Coefficient_>
 auto CurveGenerator<CGAL::Arr_algebraic_segment_traits_2<Coefficient_>>::
   generateEllipse_(const Point_2& center, Rational rxRat, Rational ryRat)
-    -> boost::optional<Curve_2>
+    -> std::optional<Curve_2>
 {
   RationalTraits ratTraits;
 
@@ -438,7 +438,7 @@ template <
 auto CurveGenerator<
   Arr_Bezier_curve_traits_2<RatKernel, AlgKernel, NtTraits, BoundingTraits>>::
   generateBezier(const std::vector<Point_2>& clickedPoints)
-    -> boost::optional<Curve_2>
+    -> std::optional<Curve_2>
 {
   if (clickedPoints.size() < 2) return {};
   return Curve_2{clickedPoints.begin(), clickedPoints.end()};
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/GraphicsViewCurveInputTyped.h b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/GraphicsViewCurveInputTyped.h
index 1c8a1b946993..a62e69ac2770 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/GraphicsViewCurveInputTyped.h
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/GraphicsViewCurveInputTyped.h
@@ -45,26 +45,26 @@ class CurveGeneratorBase
 
   void setTraits(const ArrTraits* traits_);
 
-  boost::optional<Curve_2>
+  std::optional<Curve_2>
   generate(const std::vector<Point_2>& clickedPoints, CurveType type);
 
-  virtual boost::optional<Curve_2>
+  virtual std::optional<Curve_2>
   generateSegment(const std::vector<Point_2>&) { return {}; }
-  virtual boost::optional<Curve_2>
+  virtual std::optional<Curve_2>
   generateRay(const std::vector<Point_2>&) { return {}; }
-  virtual boost::optional<Curve_2>
+  virtual std::optional<Curve_2>
   generateLine(const std::vector<Point_2>&) { return {}; }
-  virtual boost::optional<Curve_2>
+  virtual std::optional<Curve_2>
   generatePolyline(const std::vector<Point_2>&) { return {}; }
-  virtual boost::optional<Curve_2>
+  virtual std::optional<Curve_2>
   generateCircle(const std::vector<Point_2>&) { return {}; }
-  virtual boost::optional<Curve_2>
+  virtual std::optional<Curve_2>
   generateEllipse(const std::vector<Point_2>&) { return {}; }
-  virtual boost::optional<Curve_2>
+  virtual std::optional<Curve_2>
   generateThreePointCircularArc(const std::vector<Point_2>&) { return {}; }
-  virtual boost::optional<Curve_2>
+  virtual std::optional<Curve_2>
   generateFivePointConicArc(const std::vector<Point_2>&) { return {}; }
-  virtual boost::optional<Curve_2>
+  virtual std::optional<Curve_2>
   generateBezier(const std::vector<Point_2>&) { return {}; }
 
   const ArrTraits* traits;
@@ -85,7 +85,7 @@ struct CurveGenerator<CGAL::Arr_segment_traits_2<Kernel_>> :
   using Super = CurveGeneratorBase<ArrTraits>;
   using Point_2 = typename Super::Point_2;
 
-  boost::optional<Curve_2>
+  std::optional<Curve_2>
   generateSegment(const std::vector<Point_2>&) override;
 };
 
@@ -98,7 +98,7 @@ struct CurveGenerator<CGAL::Arr_polyline_traits_2<SegmentTraits>> :
   using Super = CurveGeneratorBase<ArrTraits>;
   using Point_2 = typename Super::Point_2;
 
-  boost::optional<Curve_2>
+  std::optional<Curve_2>
   generatePolyline(const std::vector<Point_2>&) override;
 };
 
@@ -118,14 +118,14 @@ struct CurveGenerator<Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>> :
   using Super = CurveGeneratorBase<ArrTraits>;
   using Point_2 = typename Super::Point_2;
 
-  boost::optional<Curve_2>
+  std::optional<Curve_2>
   generateSegment(const std::vector<Point_2>&) override;
-  boost::optional<Curve_2> generateCircle(const std::vector<Point_2>&) override;
-  boost::optional<Curve_2>
+  std::optional<Curve_2> generateCircle(const std::vector<Point_2>&) override;
+  std::optional<Curve_2>
   generateEllipse(const std::vector<Point_2>&) override;
-  boost::optional<Curve_2>
+  std::optional<Curve_2>
   generateThreePointCircularArc(const std::vector<Point_2>&) override;
-  boost::optional<Curve_2>
+  std::optional<Curve_2>
   generateFivePointConicArc(const std::vector<Point_2>&) override;
 };
 
@@ -143,10 +143,10 @@ struct CurveGenerator<CGAL::Arr_linear_traits_2<Kernel_>> :
   using Super = CurveGeneratorBase<ArrTraits>;
   using Point_2 = typename Super::Point_2;
 
-  boost::optional<Curve_2>
+  std::optional<Curve_2>
   generateSegment(const std::vector<Point_2>&) override;
-  boost::optional<Curve_2> generateRay(const std::vector<Point_2>&) override;
-  boost::optional<Curve_2> generateLine(const std::vector<Point_2>&) override;
+  std::optional<Curve_2> generateRay(const std::vector<Point_2>&) override;
+  std::optional<Curve_2> generateLine(const std::vector<Point_2>&) override;
 };
 
 template <typename Coefficient_>
@@ -165,13 +165,13 @@ struct CurveGenerator<CGAL::Arr_algebraic_segment_traits_2<Coefficient_>> :
   using Super = CurveGeneratorBase<ArrTraits>;
   using Point_2 = typename Super::Point_2;
 
-  boost::optional<Curve_2> generateLine(const std::vector<Point_2>&) override;
-  boost::optional<Curve_2> generateCircle(const std::vector<Point_2>&) override;
-  boost::optional<Curve_2>
+  std::optional<Curve_2> generateLine(const std::vector<Point_2>&) override;
+  std::optional<Curve_2> generateCircle(const std::vector<Point_2>&) override;
+  std::optional<Curve_2>
   generateEllipse(const std::vector<Point_2>&) override;
 
 private:
-  boost::optional<Curve_2> generateEllipse_(const Point_2&, Rational, Rational);
+  std::optional<Curve_2> generateEllipse_(const Point_2&, Rational, Rational);
 };
 
 template <
@@ -188,7 +188,7 @@ struct CurveGenerator<
   using Point_2 = typename Super::Point_2;
   using Curve_2 = typename ArrTraits::Curve_2;
 
-  boost::optional<Curve_2> generateBezier(const std::vector<Point_2>&) override;
+  std::optional<Curve_2> generateBezier(const std::vector<Point_2>&) override;
 };
 
 template <typename ArrTraits>
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PointSnapper.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PointSnapper.cpp
index 9194c35a749d..cefb4e8e5c09 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PointSnapper.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PointSnapper.cpp
@@ -16,7 +16,7 @@
 #include "ArrangementTypesUtils.h"
 #include "PointSnapper.h"
 
-#include <boost/optional.hpp>
+#include <optional>
 
 template <typename Arr_>
 class PointSnapper : public PointSnapperBase
@@ -26,7 +26,7 @@ class PointSnapper : public PointSnapperBase
 
 public:
   PointSnapper(QGraphicsScene*, GridGraphicsItem*, Arrangement*);
-  boost::optional<Point_2> snapToArrangement(const QPointF& qpt) override;
+  std::optional<Point_2> snapToArrangement(const QPointF& qpt) override;
 
 private:
   Arrangement* arr;
@@ -170,7 +170,7 @@ PointSnapper<Arr_>::PointSnapper(
 }
 
 template <typename Arrangement>
-inline boost::optional<PointSnapperBase::Point_2> snapToArrangement(
+inline std::optional<PointSnapperBase::Point_2> snapToArrangement(
   const QPointF& qpt, const QTransform& worldTransform, Arrangement* arr)
 {
   using Point_2 = PointSnapperBase::Point_2;
@@ -215,7 +215,7 @@ struct SnapToArrangement
 {
   using Point_2 = PointSnapperBase::Point_2;
   template <typename Arrangement>
-  boost::optional<Point_2>
+  std::optional<Point_2>
   operator()(const QPointF& qpt, const QTransform&, Arrangement*)
   {
     return Point_2{qpt.x(), qpt.y()};
@@ -226,7 +226,7 @@ struct SnapToArrangement<CGAL::Arr_linear_traits_2<Kernel>>
 {
   using Point_2 = PointSnapperBase::Point_2;
   template <typename Arrangement>
-  boost::optional<Point_2> operator()(
+  std::optional<Point_2> operator()(
     const QPointF& qpt, const QTransform& worldTransform, Arrangement* arr)
   {
     return snapToArrangement(qpt, worldTransform, arr);
@@ -237,7 +237,7 @@ struct SnapToArrangement<CGAL::Arr_segment_traits_2<Kernel>>
 {
   using Point_2 = PointSnapperBase::Point_2;
   template <typename Arrangement>
-  boost::optional<Point_2> operator()(
+  std::optional<Point_2> operator()(
     const QPointF& qpt, const QTransform& worldTransform, Arrangement* arr)
   {
     return snapToArrangement(qpt, worldTransform, arr);
@@ -248,7 +248,7 @@ struct SnapToArrangement<CGAL::Arr_polyline_traits_2<Kernel>>
 {
   using Point_2 = PointSnapperBase::Point_2;
   template <typename Arrangement>
-  boost::optional<Point_2> operator()(
+  std::optional<Point_2> operator()(
     const QPointF& qpt, const QTransform& worldTransform, Arrangement* arr)
   {
     return snapToArrangement(qpt, worldTransform, arr);
@@ -257,7 +257,7 @@ struct SnapToArrangement<CGAL::Arr_polyline_traits_2<Kernel>>
 
 template <typename Arr_>
 auto PointSnapper<Arr_>::snapToArrangement(const QPointF& qpt)
-  -> boost::optional<Point_2>
+  -> std::optional<Point_2>
 {
   using Traits = typename Arrangement::Geometry_traits_2;
   auto view = getView();
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PointSnapper.h b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PointSnapper.h
index 9829f831f5df..2d2a186235ea 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PointSnapper.h
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PointSnapper.h
@@ -50,7 +50,7 @@ class PointSnapperBase : public GraphicsSceneMixin
 protected:
   PointSnapperBase(QGraphicsScene* scene, GridGraphicsItem* grid);
   Point_2 snapToGrid(const QPointF& qpt);
-  virtual boost::optional<Point_2> snapToArrangement(const QPointF& qpt) = 0;
+  virtual std::optional<Point_2> snapToArrangement(const QPointF& qpt) = 0;
 
   GridGraphicsItem* gridGraphicsItem;
   bool snapToGridEnabled;
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.cpp
index 5fcdeb8fc3cb..2b44a70e0fee 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.cpp
@@ -404,8 +404,8 @@ Construct_x_monotone_subcurve_2<ArrTraits>::Construct_x_monotone_subcurve_2(
 
 template <typename ArrTraits>
 auto Construct_x_monotone_subcurve_2<ArrTraits>::operator()(
-  const X_monotone_curve_2& curve, const boost::optional<Point_2>& pLeft,
-  const boost::optional<Point_2>& pRight) -> X_monotone_curve_2
+  const X_monotone_curve_2& curve, const std::optional<Point_2>& pLeft,
+  const std::optional<Point_2>& pRight) -> X_monotone_curve_2
 {
   Point_2 pMin, pMax;
   bool unbounded_min = false;
@@ -457,8 +457,8 @@ template <typename RatKernel, typename AlgKernel, typename NtTraits>
 auto Construct_x_monotone_subcurve_2<
   CGAL::Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>>::
 operator()(
-  const X_monotone_curve_2& curve, const boost::optional<Point_2>& pLeft,
-  const boost::optional<Point_2>& pRight) -> X_monotone_curve_2
+  const X_monotone_curve_2& curve, const std::optional<Point_2>& pLeft,
+  const std::optional<Point_2>& pRight) -> X_monotone_curve_2
 {
   // TODO: handle when pLeft or pRight is null
 
@@ -500,8 +500,8 @@ template <
 auto Construct_x_monotone_subcurve_2<CGAL::Arr_Bezier_curve_traits_2<
   RatKernel, AlgKernel, NtTraits, BoundingTraits>>::
 operator()(
-  const X_monotone_curve_2& curve, const boost::optional<Point_2>& pLeft,
-  const boost::optional<Point_2>& pRight) -> X_monotone_curve_2
+  const X_monotone_curve_2& curve, const std::optional<Point_2>& pLeft,
+  const std::optional<Point_2>& pRight) -> X_monotone_curve_2
 {
   auto pMin = this->construct_min_vertex_2(curve);
   auto pMax = this->construct_max_vertex_2(curve);
@@ -563,8 +563,8 @@ template <typename AlgebraicKernel_d_1>
 auto Construct_x_monotone_subcurve_2<
   CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>>::
 operator()(
-  const X_monotone_curve_2& curve, const boost::optional<Point_2>& pLeft,
-  const boost::optional<Point_2>& pRight) -> X_monotone_curve_2
+  const X_monotone_curve_2& curve, const std::optional<Point_2>& pLeft,
+  const std::optional<Point_2>& pRight) -> X_monotone_curve_2
 {
   Point_2 pMin, pMax;
   bool unbounded_min = false;
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.h b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.h
index 3775dfa43af8..99b66c089d9f 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.h
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.h
@@ -358,8 +358,8 @@ class Construct_x_monotone_subcurve_2
     projection.
   */
   X_monotone_curve_2 operator() ( const X_monotone_curve_2& curve,
-                                  const boost::optional<Point_2>& pLeft,
-                                  const boost::optional<Point_2>& pRight );
+                                  const std::optional<Point_2>& pLeft,
+                                  const std::optional<Point_2>& pRight );
 
 protected:
   const ArrTraits* traits;
@@ -406,8 +406,8 @@ class Construct_x_monotone_subcurve_2< CGAL::Arr_conic_traits_2< RatKernel,
     Return the subcurve of curve bracketed by pLeft and pRight.
   */
   X_monotone_curve_2 operator() ( const X_monotone_curve_2& curve,
-                                  const boost::optional<Point_2>& pLeft,
-                                  const boost::optional<Point_2>& pRight );
+                                  const std::optional<Point_2>& pLeft,
+                                  const std::optional<Point_2>& pRight );
 
 }; // class Construct_x_monotone_subcurve_2 for Arr_conic_traits_2
 
@@ -436,8 +436,8 @@ class Construct_x_monotone_subcurve_2<CGAL::Arr_Bezier_curve_traits_2<
     Return the subcurve of curve bracketed by pLeft and pRight.
   */
   X_monotone_curve_2 operator()(
-    const X_monotone_curve_2& curve, const boost::optional<Point_2>& pLeft,
-    const boost::optional<Point_2>& pRight);
+    const X_monotone_curve_2& curve, const std::optional<Point_2>& pLeft,
+    const std::optional<Point_2>& pRight);
 
 protected:
   const ArrTraits* traits;
@@ -478,8 +478,8 @@ class Construct_x_monotone_subcurve_2<
     projection.
   */
   X_monotone_curve_2 operator() ( const X_monotone_curve_2& curve,
-                                  const boost::optional<Point_2>& pLeft,
-                                  const boost::optional<Point_2>& pRight );
+                                  const std::optional<Point_2>& pLeft,
+                                  const std::optional<Point_2>& pRight );
 
 protected:
   const Traits* traits;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
index 831e0e44395a..95bdc262b299 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
@@ -10,7 +10,7 @@
 
 typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>              Cell_type;
-typedef boost::optional<Cell_type>                       Vert_decomp_type;
+typedef std::optional<Cell_type>                       Vert_decomp_type;
 typedef std::pair<Vert_decomp_type, Vert_decomp_type>    Vert_decomp_pair;
 typedef std::pair<Vertex_const_handle, Vert_decomp_pair> Vert_decomp_entry;
 typedef std::list<Vert_decomp_entry>                     Vert_decomp_list;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
index 85f1b7c5acf6..02e44f64cef6 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
@@ -25,7 +25,7 @@
 
 #include <CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_impl.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/none.hpp>
 
 namespace CGAL {
@@ -267,8 +267,8 @@ class Arr_algebraic_segment_traits_2 {
       template <typename OutputIterator> OutputIterator
       x_monotone_segment(Curve_2 cv,
                          Point_2 p,
-                         boost::optional<Point_2> start,
-                         boost::optional<Point_2> end,
+                         std::optional<Point_2> start,
+                         std::optional<Point_2> end,
                          OutputIterator out) const
       {
         typedef boost::variant<Point_2, X_monotone_curve_2>
@@ -407,19 +407,19 @@ class Arr_algebraic_segment_traits_2 {
                         Site_of_point site_of_p,
                         OutputIterator out) const {
             if(site_of_p==POINT_IN_INTERIOR) {
-                return x_monotone_segment(cv,p,boost::none, boost::none,out);
+                return x_monotone_segment(cv,p,std::nullopt, std::nullopt,out);
             } else if(site_of_p==MIN_ENDPOINT) {
                 return x_monotone_segment(cv,
                                        p,
-                                       boost::optional<Point_2>(p),
-                                       boost::none,
+                                       std::optional<Point_2>(p),
+                                       std::nullopt,
                                        out);
             }
             CGAL_assertion(site_of_p==MAX_ENDPOINT);
             return x_monotone_segment(cv,
                                    p,
-                                   boost::none,
-                                   boost::optional<Point_2>(p),
+                                   std::nullopt,
+                                   std::optional<Point_2>(p),
                                    out);
         }
 
@@ -468,15 +468,15 @@ class Arr_algebraic_segment_traits_2 {
                 return x_monotone_segment
                     (cv,
                      end_left,
-                     boost::optional<Point_2>(end_left),
-                     boost::optional<Point_2>(end_right),
+                     std::optional<Point_2>(end_left),
+                     std::optional<Point_2>(end_right),
                      out);
             } else {
                 return x_monotone_segment
                     (cv,
                      end_right,
-                     boost::optional<Point_2>(end_left),
-                     boost::optional<Point_2>(end_right),
+                     std::optional<Point_2>(end_left),
+                     std::optional<Point_2>(end_right),
                      out);
             }
         }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
index af58c2612406..81fec7a37855 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
@@ -41,7 +41,7 @@ namespace Ss2 = Surface_sweep_2;
  * \param oi Output: An output iterator for the query results.
  * \pre The value-type of PointsIterator is Arrangement::Point_2,
  *      and the value-type of OutputIterator is is pair<Point_2, Result>,
- *      where Result is boost::optional<boost::variant<Vertex_const_handle,
+ *      where Result is std::optional<boost::variant<Vertex_const_handle,
  *                                      Halfedge_const_handle,
  *                                      Face_const_handle> >.
  *      It represents the arrangement feature containing the point.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
index 8b4a3e1eca23..e7aea3a8d19d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
@@ -305,7 +305,7 @@ class Arr_bounded_planar_topology_traits_2 :
    * \pre The curve has a boundary condition in either x or y.
    * \return An object that wraps the curve end.
    */
-  boost::optional<boost::variant<Vertex*, Halfedge*> >
+  std::optional<boost::variant<Vertex*, Halfedge*> >
   place_boundary_vertex(Face*,
                         const X_monotone_curve_2&,
                         Arr_curve_end,
@@ -314,7 +314,7 @@ class Arr_bounded_planar_topology_traits_2 :
   {
     // This function should never be called:
     CGAL_error();
-    return boost::none;
+    return std::nullopt;
   }
 
   /*! Locate the predecessor halfedge for the given curve around a given
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
index 5a32bb997d75..37f0a05f550d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
@@ -24,7 +24,7 @@
  */
 
 #include <vector>
-#include <boost/optional/optional.hpp>
+#include <optional>
 #include <boost/mpl/if.hpp>
 #include <boost/mpl/or.hpp>
 #include <boost/type_traits.hpp>
@@ -284,8 +284,8 @@ overlay(const Arrangement_on_surface_2<GeometryTraitsA_2, TopologyTraitsA>& arr1
     if (vit1->is_isolated()) {
       typename Arr_a::Vertex_const_handle v1 = vit1;
       pts_vec[i++] =
-        Ovl_point_2(vit1->point(), boost::make_optional(Cell_handle_red(v1)),
-                    boost::optional<Cell_handle_blue>());
+        Ovl_point_2(vit1->point(), std::make_optional(Cell_handle_red(v1)),
+                    std::optional<Cell_handle_blue>());
     }
   }
 
@@ -294,8 +294,8 @@ overlay(const Arrangement_on_surface_2<GeometryTraitsA_2, TopologyTraitsA>& arr1
     if (vit2->is_isolated()) {
       typename Arr_b::Vertex_const_handle v2 = vit2;
       pts_vec[i++] =
-        Ovl_point_2(vit2->point(), boost::optional<Cell_handle_red>(),
-                    boost::make_optional(Cell_handle_blue(v2)));
+        Ovl_point_2(vit2->point(), std::optional<Cell_handle_red>(),
+                    std::make_optional(Cell_handle_blue(v2)));
     }
   }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_nearest_neighbor.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_nearest_neighbor.h
index 71059ab2be40..e7c4a5b1dd52 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_nearest_neighbor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_nearest_neighbor.h
@@ -27,7 +27,7 @@
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 
 #include <boost/variant.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
index f901bb72565d..eb161a353c52 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
@@ -145,13 +145,13 @@ class Td_active_edge : public Handle
   //Dag_node* m_dag_node; //pointer to the search structure (DAG) node
 
   /*! Initialize the trapezoid's neighbors. */
-  inline void init_neighbors(boost::optional<Td_map_item&> next)
+  inline void init_neighbors(std::optional<Td_map_item&> next)
   {
     set_next((next) ? *next : Td_map_item(0));
   }
   /*! \copydoc init_neighbors
    *  \deprecated please use #init_neighbors */
-  CGAL_DEPRECATED inline void init_neighbours(boost::optional<Td_map_item&> next)
+  CGAL_DEPRECATED inline void init_neighbours(std::optional<Td_map_item&> next)
   { init_neighbors(next); }
 
   /*! Set the DAG node. */
@@ -199,7 +199,7 @@ class Td_active_edge : public Handle
    /*! Constructor given Vertex & Halfedge handles. */
   Td_active_edge (Halfedge_const_handle he ,
                   Dag_node* node = 0,
-                  boost::optional<Td_map_item&> next = boost::none)
+                  std::optional<Td_map_item&> next = std::nullopt)
   {
 
     PTR = new Data(he, (next) ? *next : Td_map_item(0), node);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
index 06b384daed94..2872d2563109 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
@@ -24,7 +24,7 @@
 #include <CGAL/tuple.h>
 
 #include <boost/variant.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 
 #ifdef CGAL_TD_DEBUG
@@ -163,8 +163,8 @@ class Td_active_trapezoid : public Handle
   //Dag_node* m_dag_node; //pointer to the search structure (DAG) node
 
   /*! Initialize the trapezoid's neighbors. */
-   inline void init_neighbors(boost::optional<Td_map_item&> lb, boost::optional<Td_map_item&> lt,
-                              boost::optional<Td_map_item&> rb, boost::optional<Td_map_item&> rt)
+   inline void init_neighbors(std::optional<Td_map_item&> lb, std::optional<Td_map_item&> lt,
+                              std::optional<Td_map_item&> rb, std::optional<Td_map_item&> rt)
   {
     set_lb((lb) ? *lb : Td_map_item(0));
     set_lt((lt) ? *lt : Td_map_item(0));
@@ -173,8 +173,8 @@ class Td_active_trapezoid : public Handle
   }
   /*! \copydoc init_neighbors
    *  \deprecated please use #init_neighbors */
-   CGAL_DEPRECATED inline void init_neighbours(boost::optional<Td_map_item&> lb, boost::optional<Td_map_item&> lt,
-                                               boost::optional<Td_map_item&> rb, boost::optional<Td_map_item&> rt)
+   CGAL_DEPRECATED inline void init_neighbours(std::optional<Td_map_item&> lb, std::optional<Td_map_item&> lt,
+                                               std::optional<Td_map_item&> rb, std::optional<Td_map_item&> rt)
   { init_neighbors(lb, lt, rb, rt); }
 
   /*! Set the DAG node. */
@@ -267,10 +267,10 @@ class Td_active_trapezoid : public Handle
   /*! Constructor given Vertex & Halfedge handles. */
   Td_active_trapezoid (Vertex_const_handle l, Vertex_const_handle r,
                   Halfedge_const_handle b, Halfedge_const_handle t,
-                  boost::optional<Td_map_item&> lb = boost::none,
-                  boost::optional<Td_map_item&> lt = boost::none,
-                  boost::optional<Td_map_item&> rb = boost::none,
-                  boost::optional<Td_map_item&> rt = boost::none,
+                  std::optional<Td_map_item&> lb = std::nullopt,
+                  std::optional<Td_map_item&> lt = std::nullopt,
+                  std::optional<Td_map_item&> rb = std::nullopt,
+                  std::optional<Td_map_item&> rt = std::nullopt,
                   Dag_node* node = 0)
   {
     PTR = new Data (l, r, b, t, (lb) ? *lb : Td_map_item(0), (lt) ? *lt : Td_map_item(0),
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
index 097e12d0dcb7..7b3b224a2239 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
@@ -25,7 +25,7 @@
 #include <CGAL/Arr_point_location/Td_predicates.h>
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2_misc.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/variant.hpp>
 #include <memory>
 
@@ -272,7 +272,7 @@ class Trapezoidal_decomposition_2
     Base_map_item_iterator() : traits(0), m_cur_item(Td_map_item(0)){ }
 
     Base_map_item_iterator(const Traits* traits_,
-                           boost::optional<Td_map_item&> curr = boost::none)
+                           std::optional<Td_map_item&> curr = std::nullopt)
       :traits(traits_), m_cur_item((curr) ? *curr : Td_map_item(0) ) { }
 
     Base_map_item_iterator(const Base_map_item_iterator &it)
@@ -332,12 +332,12 @@ class Trapezoidal_decomposition_2
   public:
     //constructors
     In_face_iterator(const Traits* traits_, Halfedge_const_handle sep,
-                     boost::optional<Td_map_item&> curr = boost::none)
+                     std::optional<Td_map_item&> curr = std::nullopt)
             :Base_map_item_iterator(traits_,curr), m_sep(sep->curve())
     { }
 
     In_face_iterator(const Traits* traits_, const X_monotone_curve_2& sep,
-                     boost::optional<Td_map_item&> curr = boost::none)
+                     std::optional<Td_map_item&> curr = std::nullopt)
             :Base_map_item_iterator(traits_,curr), m_sep(sep)
     { }
 
@@ -790,25 +790,25 @@ class Trapezoidal_decomposition_2
   };
 
   class curve_end_for_fict_vertex_visitor :
-    public boost::static_visitor<boost::optional<Curve_end> >
+    public boost::static_visitor<std::optional<Curve_end> >
   {
   public:
-    boost::optional<Curve_end> operator()(Td_active_fictitious_vertex& t) const
+    std::optional<Curve_end> operator()(Td_active_fictitious_vertex& t) const
     {
       return t.curve_end();
     }
 
-    boost::optional<Curve_end>
+    std::optional<Curve_end>
     operator()(Td_inactive_fictitious_vertex& t) const
     {
       return t.curve_end();
     }
 
     template < typename T >
-    boost::optional<Curve_end> operator()(T& /* t */) const
+    std::optional<Curve_end> operator()(T& /* t */) const
     {
       CGAL_assertion(false);
-      return boost::none;
+      return std::nullopt;
     }
   };
 
@@ -834,24 +834,24 @@ class Trapezoidal_decomposition_2
   };
 
   class curve_end_for_active_vertex_visitor :
-    public boost::static_visitor<boost::optional<Curve_end> >
+    public boost::static_visitor<std::optional<Curve_end> >
   {
     public:
-    boost::optional<Curve_end> operator()(Td_active_vertex& t) const
+    std::optional<Curve_end> operator()(Td_active_vertex& t) const
     {
       return t.curve_end();
     }
 
-    boost::optional<Curve_end> operator()(Td_active_fictitious_vertex& t) const
+    std::optional<Curve_end> operator()(Td_active_fictitious_vertex& t) const
     {
       return t.curve_end();
     }
 
     template < typename T >
-    boost::optional<Curve_end> operator()(T& /* t */) const
+    std::optional<Curve_end> operator()(T& /* t */) const
     {
       CGAL_assertion(false);
-      return boost::none;
+      return std::nullopt;
     }
   };
 
@@ -878,26 +878,26 @@ class Trapezoidal_decomposition_2
   };
 
   class cv_for_edge_visitor :
-    public boost::static_visitor<boost::optional<const X_monotone_curve_2&> >
+    public boost::static_visitor<std::optional<const X_monotone_curve_2&> >
   {
   public:
-    boost::optional<const X_monotone_curve_2&>
+    std::optional<const X_monotone_curve_2&>
     operator()(Td_active_edge& t) const
     {
       return t.halfedge()->curve();
     }
 
-    boost::optional<const X_monotone_curve_2&>
+    std::optional<const X_monotone_curve_2&>
     operator()(Td_inactive_edge& t) const
     {
       return t.curve();
     }
 
     template <typename T>
-    boost::optional<const X_monotone_curve_2&> operator()(T& /* t */) const
+    std::optional<const X_monotone_curve_2&> operator()(T& /* t */) const
     {
       CGAL_assertion(false);
-      return boost::none;
+      return std::nullopt;
     }
   };
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h
index 15c72e819455..b912b9facc72 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h
@@ -109,7 +109,7 @@ split_trapezoid_by_vertex(Dag_node& split_node,
     //CGAL_warning(left_e.is_on_left_boundary() == e.is_on_left_boundary());
     //CGAL_warning(right_e.is_on_right_boundary() == e.is_on_right_boundary());
 
-    left_e.init_neighbors(boost::none);
+    left_e.init_neighbors(std::nullopt);
     //left_e.init_neighbors(e.lb(),e.lt(),Td_map_item(),right_node.get_data());
     right_e.init_neighbors(e.next());
     //right_e.init_neighbors(left_node.get_data(),left_node.get_data(),e.rb(),e.rt());
@@ -307,9 +307,9 @@ split_trapezoid_by_halfedge(Dag_node& split_node,
   Td_active_trapezoid& top =
     boost::get<Td_active_trapezoid>(top_node.get_data());
 
-  top.init_neighbors(prev_top_tr, split_tr.lt(), boost::none , split_tr.rt());
+  top.init_neighbors(prev_top_tr, split_tr.lt(), std::nullopt , split_tr.rt());
   bottom.init_neighbors(split_tr.lb(), prev_bottom_tr, split_tr.rb(),
-                         boost::none);
+                         std::nullopt);
 
   if (!traits->is_empty_item(prev_bottom_tr)) {
     Td_active_trapezoid&
@@ -1524,7 +1524,7 @@ Trapezoidal_decomposition_2<Td_traits>::insert(Halfedge_const_handle he)
   // create the Td_map_item iterator for traveling along the Trapezoids that
   // intersect the input Halfedge, using left-low to right-high order
   In_face_iterator it = follow_curve(p1_node,he,LARGER);
-  boost::optional<Td_active_trapezoid> curr_trp = boost::none;
+  std::optional<Td_active_trapezoid> curr_trp = std::nullopt;
   Td_map_item prev = p1_item;
   Td_map_item prev_bottom_tr = Td_map_item(0); //active_tr
   Td_map_item prev_top_tr = Td_map_item(0); //active_tr
@@ -1539,7 +1539,7 @@ Trapezoidal_decomposition_2<Td_traits>::insert(Halfedge_const_handle he)
 
   while(!!it) { //this means as long as the iterator is valid
     curr_trp = it.trp();
-    CGAL_assertion(curr_trp != boost::none);
+    CGAL_assertion(curr_trp != std::nullopt);
     prev_bottom_tr = (*curr_trp).lb();
     prev_top_tr = (*curr_trp).lt();
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
index 1fae9de1d305..db555da63f4c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
@@ -19,7 +19,7 @@
 // The macro CGAL_ARR_POINT_LOCATION_VERSION controls which version of the
 // point location is used. Currently two values are supported:
 // 1. Point location with CGAL::Object
-// 2. Point location with boost::optional<boost::variant<...> >
+// 2. Point location with std::optional<boost::variant<...> >
 // The default value is 2.
 
 #if !defined(CGAL_ARR_POINT_LOCATION_VERSION)
@@ -28,7 +28,7 @@
 
 #include <CGAL/Object.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/variant.hpp>
 
 #ifdef CGAL_CFG_BOOST_VARIANT_SWAP_BUG
@@ -73,7 +73,7 @@ struct Arr_point_location_result {
   // This function returns either make_object() or a result_type constructor
   // to generate return values. The Object version takes a dummy template
   // argument, which is needed for the return of the other option, e.g.,
-  // boost::optional<boost::variant> >.
+  // std::optional<boost::variant> >.
   // In theory a one parameter variant could be returned, but this _could_
   // lead to conversion overhead, and so we rather go for the real type.
   // Overloads for empty returns are also provided.
@@ -94,8 +94,8 @@ struct Arr_point_location_result {
   inline Type make_result(T t) { return Type(t); }
 
   static
-  inline boost::optional<Type> empty_optional_result()
-  { return boost::optional<Type>(); }
+  inline std::optional<Type> empty_optional_result()
+  { return std::optional<Type>(); }
 
   template <typename T>
   static
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_simple_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_simple_point_location.h
index 099f46edcd61..efdaa8d65d9b 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_simple_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_simple_point_location.h
@@ -26,7 +26,7 @@
 #include <CGAL/Arr_point_location_result.h>
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 
@@ -60,7 +60,7 @@ class Arr_simple_point_location {
 #if CGAL_ARR_POINT_LOCATION_VERSION < 2
   typedef Result_type                                    Optional_result_type;
 #else
-  typedef typename boost::optional<Result_type>          Optional_result_type;
+  typedef typename std::optional<Result_type>          Optional_result_type;
 #endif
 
   typedef typename Topology_traits::Dcel                 Dcel;
@@ -75,8 +75,8 @@ class Arr_simple_point_location {
   inline bool optional_empty(const CGAL::Object& obj) const { return obj.empty(); }
   inline const Result_type& optional_assign(const CGAL::Object& t) const { return t; }
 #else
-  inline bool optional_empty(const boost::optional<Result_type>& t) const { return (!t); }
-  inline const Result_type& optional_assign(const boost::optional<Result_type>& t) const { return *t; }
+  inline bool optional_empty(const std::optional<Result_type>& t) const { return (!t); }
+  inline const Result_type& optional_assign(const std::optional<Result_type>& t) const { return *t; }
 #endif
 
   template<typename T>
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
index d7b170e979b8..97e451bda5f9 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
@@ -506,7 +506,7 @@ class Arr_spherical_topology_traits_2 {
    * \pre The curve has a boundary condition in either x or y.
    * \return An object that contains the curve end.
    */
-  boost::optional<boost::variant<Vertex*, Halfedge*> >
+  std::optional<boost::variant<Vertex*, Halfedge*> >
   place_boundary_vertex(Face* f,
                         const X_monotone_curve_2& xc,
                         Arr_curve_end ind,
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_bounded_planar_vert_decomp_helper.h b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_bounded_planar_vert_decomp_helper.h
index 2170c332d803..b9f94fd92fcf 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_bounded_planar_vert_decomp_helper.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_bounded_planar_vert_decomp_helper.h
@@ -49,7 +49,7 @@ class Arr_bounded_planar_vert_decomp_helper {
 
   typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>             Cell_type;
-  typedef boost::optional<Cell_type>                    Vert_type;
+  typedef std::optional<Cell_type>                    Vert_type;
 
 protected:
   // Data members:
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h
index 9175587a317a..ef4da091be75 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h
@@ -571,7 +571,7 @@ let_me_decide_the_outer_ccb(std::pair< CGAL::Sign, CGAL::Sign> signs1,
  * represent the curve end along the face boundary.
  */
 template <typename GeomTraits, typename Dcel>
-boost::optional
+std::optional
   <boost::variant
     <typename Arr_spherical_topology_traits_2<GeomTraits, Dcel>::Vertex*,
      typename Arr_spherical_topology_traits_2<GeomTraits, Dcel>::Halfedge*> >
@@ -586,16 +586,16 @@ place_boundary_vertex(Face* /* f */,
                       Arr_parameter_space ps_y)
 {
   typedef boost::variant<Vertex*, Halfedge*>    Non_optional_result;
-  typedef boost::optional<Non_optional_result>  Result;
+  typedef std::optional<Non_optional_result>  Result;
 
   // std::cout << "place_boundary_vertex()" << std::endl;
   if (ps_y == ARR_BOTTOM_BOUNDARY) {
-    if (m_south_pole == nullptr) return boost::none;
+    if (m_south_pole == nullptr) return std::nullopt;
     return Result(Non_optional_result(m_south_pole));
   }
 
   if (ps_y == ARR_TOP_BOUNDARY) {
-    if (m_north_pole == nullptr) return boost::none;
+    if (m_north_pole == nullptr) return std::nullopt;
     return Result(Non_optional_result(m_north_pole));
   }
 
@@ -611,7 +611,7 @@ place_boundary_vertex(Face* /* f */,
   }
 
   // The vertex hasn't been created yet, return a null object:
-  return boost::none;
+  return std::nullopt;
 }
 
 /*! \brief locate the predecessor halfedge for the given curve around a given
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_vert_decomp_helper.h b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_vert_decomp_helper.h
index af8e70a3f13c..f83aab57b858 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_vert_decomp_helper.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_vert_decomp_helper.h
@@ -50,7 +50,7 @@ class Arr_spherical_vert_decomp_helper {
 
   typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>             Cell_type;
-  typedef boost::optional<Cell_type>                    Vert_type;
+  typedef std::optional<Cell_type>                    Vert_type;
 
 protected:
   typedef typename Arrangement_2::Topology_traits       Topology_traits;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_topology_traits_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_topology_traits_2_impl.h
index 4be3568c3a68..f9c7f957c34a 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_topology_traits_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_topology_traits_2_impl.h
@@ -296,7 +296,7 @@ are_equal(const Vertex *v,
 // represent the curve end along the face boundary.
 //
 template <typename GeomTraits, typename Dcel_>
-boost::optional
+std::optional
   <boost::variant
     <typename Arr_unb_planar_topology_traits_2<GeomTraits, Dcel_>::Vertex*,
      typename Arr_unb_planar_topology_traits_2<GeomTraits, Dcel_>::Halfedge*> >
@@ -306,7 +306,7 @@ place_boundary_vertex(Face* f,
                       Arr_parameter_space ps_x, Arr_parameter_space ps_y)
 {
   typedef boost::variant<Vertex*, Halfedge*>    Non_optional_result;
-  typedef boost::optional<Non_optional_result>  Result;
+  typedef std::optional<Non_optional_result>  Result;
 
   // Get a halfedge on the outer CCB of f and start traversing the CCB.
   Halfedge* first = *(f->outer_ccbs_begin());
@@ -331,7 +331,7 @@ place_boundary_vertex(Face* f,
   // If we reached here, we did not find a suitable halfedge, which should
   // never happen.
   CGAL_error();
-  return boost::none;
+  return std::nullopt;
 }
 
 //-----------------------------------------------------------------------------
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_vert_decomp_helper.h b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_vert_decomp_helper.h
index 23fa949e3cd0..befc27bb89f0 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_vert_decomp_helper.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_vert_decomp_helper.h
@@ -48,7 +48,7 @@ class Arr_unb_planar_vert_decomp_helper {
 
   typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>             Cell_type;
-  typedef boost::optional<Cell_type>                    Vert_type;
+  typedef std::optional<Cell_type>                    Vert_type;
 
 protected:
   typedef typename Arrangement_2::Topology_traits       Topology_traits;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
index 30181d7270f3..86df601c06ad 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
@@ -291,7 +291,7 @@ class Arr_unb_planar_topology_traits_2 :
    * \return An object that contains the curve end.
    *         In our case this object always wraps a fictitious edge.
    */
-  boost::optional<boost::variant<Vertex*, Halfedge*> >
+  std::optional<boost::variant<Vertex*, Halfedge*> >
   place_boundary_vertex(Face* f,
                         const X_monotone_curve_2& cv,
                         Arr_curve_end ind,
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
index 8f0185a5a037..71fbfd48f9fa 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
@@ -103,7 +103,7 @@ class Arrangement_zone_2 {
   typedef std::pair<Point_2, Multiplicity>              Intersection_point;
   typedef boost::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
-  typedef boost::optional<Intersection_result>          Optional_intersection;
+  typedef std::optional<Intersection_result>          Optional_intersection;
   typedef std::list<Intersection_result>                Intersect_list;
   typedef std::map<const X_monotone_curve_2*, Intersect_list>
                                                         Intersect_map;
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h
index 2182023925e8..8766eac294d0 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h
@@ -23,7 +23,7 @@
 
 #include <iostream>
 #include <type_traits>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/none.hpp>
 
 #include <CGAL/Bbox_2.h>
@@ -155,13 +155,13 @@ class Arc_2_rep {
     mutable bool _m_left_to_right;
 
     //! stores the index of an interval this arc belongs to
-    mutable boost::optional<int> _m_interval_id;
+    mutable std::optional<int> _m_interval_id;
 
     //! stores boundary value in x-range of non-vertical interval
-    mutable boost::optional< Bound > _m_boundary_in_interval;
+    mutable std::optional< Bound > _m_boundary_in_interval;
 
     //! stores a bbox for an arc
-    mutable boost::optional< CGAL::Bbox_2 > _m_bbox;
+    mutable std::optional< CGAL::Bbox_2 > _m_bbox;
 
     //!@}
 };
@@ -2240,8 +2240,8 @@ class Arc_2 :
         rep._m_is_vertical = this->ptr()->_m_is_vertical;
         rep._m_left_to_right = this->ptr()->_m_left_to_right;
 
-        rep._m_interval_id = boost::none;
-        rep._m_boundary_in_interval = boost::none;
+        rep._m_interval_id = std::nullopt;
+        rep._m_boundary_in_interval = std::nullopt;
 
         return std::make_pair(Kernel_arc_2(rep), cmp);
     }
@@ -2372,8 +2372,8 @@ class Arc_2 :
             this->ptr()->_m_arcno_max = arcno();
 
         // invalidate curve-specific data
-        this->ptr()->_m_interval_id = boost::none;
-        this->ptr()->_m_boundary_in_interval = boost::none;
+        this->ptr()->_m_interval_id = std::nullopt;
+        this->ptr()->_m_boundary_in_interval = std::nullopt;
     }
     //!@}
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
index c1ece0d0d577..df79d30b7713 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
@@ -253,8 +253,8 @@ class Curve_renderer_interface
         class Allocator >
     inline void draw(const Arc_2& arc,
             Container< std::vector< Coord_2 >, Allocator >& pts,
-            boost::optional< Coord_2 > *end_pt1 = nullptr,
-            boost::optional< Coord_2 > *end_pt2 = nullptr) {
+            std::optional< Coord_2 > *end_pt1 = nullptr,
+            std::optional< Coord_2 > *end_pt2 = nullptr) {
 
 #ifndef CGAL_CKVA_DUMMY_RENDERER
         Bbox_2 bbox;
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Fig_stream_Curve_renderer_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Fig_stream_Curve_renderer_2.h
index 55d269ca01b2..a7b9453af479 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Fig_stream_Curve_renderer_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Fig_stream_Curve_renderer_2.h
@@ -43,7 +43,7 @@ operator <<
     typedef std::pair< int, int > Coord_2;
     typedef std::vector< Coord_2 > Coord_vec_2;
 
-    boost::optional < Coord_2 > p1, p2;
+    std::optional < Coord_2 > p1, p2;
     std::list<Coord_vec_2> points;
 
     Bbox_2 bbox (CGAL::to_double(ws.bounding_rect().xmin()),
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h
index c95ee1b85f9a..06ec76eb58f8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h
@@ -83,9 +83,9 @@ class Generic_arc_2_rep
     // end-points (in degenerate case both point to the same object)
     mutable Generic_point_2 _m_min;
 
-    mutable boost::optional<Generic_point_2> _m_max;
+    mutable std::optional<Generic_point_2> _m_max;
     // stores native arc object (only for non-degenerate case)
-    mutable boost::optional<Arc_2> _m_arc;
+    mutable std::optional<Arc_2> _m_arc;
 
     // whether an arc is degenerate
     //bool _m_is_degenerate;
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h
index f993dd009af0..c465cae03009 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h
@@ -67,12 +67,12 @@ class Generic_point_2_rep
         _m_point(p) {
     }
 
-    mutable boost::optional<Arc_2> _m_arc; // supporting arc for points at inf
+    mutable std::optional<Arc_2> _m_arc; // supporting arc for points at inf
 
     // stores respective curve end if this is a point at infinity
     CGAL::Arr_curve_end _m_end;
 
-    mutable boost::optional<Point_2> _m_point; // stores a finite point
+    mutable std::optional<Point_2> _m_point; // stores a finite point
 
     // befriending the handle
     friend class Generic_point_2<Sweep_curves_adaptor_2, Self>;
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
index 53b5d589b136..f96830c3399a 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
@@ -21,7 +21,7 @@
 
 #include <CGAL/config.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/optional/optional_io.hpp>
 
 #include <CGAL/Handle_with_policy.h>
@@ -107,22 +107,22 @@ class Point_2_rep
     //! curve point finite coordinates. They are valid only if boundary in y
     //! is not set (CGAL::NO_BOUNDARY), otherwise only x-coordinate is
     //! accessible, i.e., point is in interior
-    boost::optional< Coordinate_2 > _m_xy;
+    std::optional< Coordinate_2 > _m_xy;
 
     //! x-coordinate of a curve point
-    boost::optional< Coordinate_1 > _m_x;
+    std::optional< Coordinate_1 > _m_x;
 
     //! curve of point at boundary
-    boost::optional< Curve_analysis_2 > _m_curve;
+    std::optional< Curve_analysis_2 > _m_curve;
 
     //! arc of point at boundary
-    boost::optional< int > _m_arcno;
+    std::optional< int > _m_arcno;
 
     //! location of a point in parameter space
     mutable CGAL::Arr_parameter_space _m_location;
 
     //! store a double approximation of point
-    mutable boost::optional< std::pair< double, double > > _m_doubles;
+    mutable std::optional< std::pair< double, double > > _m_doubles;
 };
 
 /*!\brief
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
index 3d1bdff6e912..03d6fcadfbe3 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
@@ -22,7 +22,7 @@
 
 #include <CGAL/config.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/none.hpp>
 #include <CGAL/iterator.h>
 #include <CGAL/Handle_with_policy.h>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h
index f9551ac46fab..32d3d4cc8493 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h
@@ -423,8 +423,8 @@ template < class Coord_2, template < class, class > class Container,
         class Allocator >
 void draw(const Arc_2& arc,
           Container< std::vector< Coord_2 >, Allocator >& points,
-          boost::optional< Coord_2 > *end_pt1 = nullptr,
-          boost::optional< Coord_2 > *end_pt2 = nullptr) {
+          std::optional< Coord_2 > *end_pt1 = nullptr,
+          std::optional< Coord_2 > *end_pt2 = nullptr) {
 
 #ifdef CGAL_CKVA_CR_TIMING
     refine_timer.start();
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
index ab7b56ce9871..7a011211706b 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
@@ -23,7 +23,7 @@
  */
 
 #include <boost/variant.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/variant/apply_visitor.hpp>
 
 #include <unordered_map>
@@ -524,11 +524,11 @@ void Arr_overlay_ss_visitor<OvlHlpr, OvlTr, Vis>::update_event(Event* e,
     CGAL_assertion(sc->color() == Gt2::RED);
 
     Halfedge_handle_red red_he = sc->red_halfedge_handle();
-    pt.set_red_cell(boost::make_optional(Cell_handle_red(red_he)));
+    pt.set_red_cell(std::make_optional(Cell_handle_red(red_he)));
   }
   else if (pt.is_blue_cell_empty()) {
     Halfedge_handle_blue blue_he = sc->blue_halfedge_handle();
-    pt.set_blue_cell(boost::make_optional(Cell_handle_blue(blue_he)));
+    pt.set_blue_cell(std::make_optional(Cell_handle_blue(blue_he)));
   }
 }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
index b38fc25d3444..717b31a0d377 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
@@ -23,7 +23,7 @@
  */
 
 #include <boost/variant.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <CGAL/Arr_tags.h>
 
@@ -107,19 +107,19 @@ class Arr_overlay_traits_2 {
 
   typedef boost::variant<Halfedge_handle_red, Vertex_handle_red,
                          Face_handle_red>           Cell_handle_red;
-  typedef boost::optional<Cell_handle_red>          Optional_cell_red;
+  typedef std::optional<Cell_handle_red>          Optional_cell_red;
 
   typedef boost::variant<Halfedge_handle_blue, Vertex_handle_blue,
                          Face_handle_blue>          Cell_handle_blue;
-  typedef boost::optional<Cell_handle_blue>         Optional_cell_blue;
+  typedef std::optional<Cell_handle_blue>         Optional_cell_blue;
 
   template <typename Handle_red>
   Optional_cell_red make_optional_cell_red(Handle_red handle_red)
-  { return boost::make_optional(Cell_handle_red(handle_red)); }
+  { return std::make_optional(Cell_handle_red(handle_red)); }
 
   template <typename Handle_blue>
   Optional_cell_red make_optional_cell_blue(Handle_blue handle_blue)
-  { return boost::make_optional(Cell_handle_blue(handle_blue)); }
+  { return std::make_optional(Cell_handle_blue(handle_blue)); }
 
 private:
   const Gt2* m_base_traits;        // The base traits object.
@@ -450,16 +450,16 @@ class Arr_overlay_traits_2 {
           if (xcv1.color() == RED) {
             CGAL_assertion(xcv2.color() == BLUE);
             red_cell =
-              boost::make_optional(Cell_handle_red(xcv1.red_halfedge_handle()));
+              std::make_optional(Cell_handle_red(xcv1.red_halfedge_handle()));
             blue_cell =
-              boost::make_optional(Cell_handle_blue(xcv2.blue_halfedge_handle()));
+              std::make_optional(Cell_handle_blue(xcv2.blue_halfedge_handle()));
           }
           else {
             CGAL_assertion((xcv2.color() == RED) && (xcv1.color() == BLUE));
             red_cell =
-              boost::make_optional(Cell_handle_red(xcv2.red_halfedge_handle()));
+              std::make_optional(Cell_handle_red(xcv2.red_halfedge_handle()));
             blue_cell =
-              boost::make_optional(Cell_handle_blue(xcv1.blue_halfedge_handle()));
+              std::make_optional(Cell_handle_blue(xcv1.blue_halfedge_handle()));
           }
 
           // Create the extended point and add the multiplicity.
@@ -574,15 +574,15 @@ class Arr_overlay_traits_2 {
         red_cell =
           (! xcv.red_halfedge_handle()->target()->is_at_open_boundary() &&
            m_base_equal(base_p, xcv.red_halfedge_handle()->target()->point())) ?
-          boost::make_optional(Cell_handle_red(xcv.red_halfedge_handle()->target())) :
-          boost::make_optional(Cell_handle_red(xcv.red_halfedge_handle()));
+          std::make_optional(Cell_handle_red(xcv.red_halfedge_handle()->target())) :
+          std::make_optional(Cell_handle_red(xcv.red_halfedge_handle()));
 
       if ((xcv.color() == BLUE) || (xcv.color() == RB_OVERLAP))
         blue_cell =
           (! xcv.blue_halfedge_handle()->target()->is_at_open_boundary() &&
            m_base_equal(base_p, xcv.blue_halfedge_handle()->target()->point())) ?
-          boost::make_optional(Cell_handle_blue(xcv.blue_halfedge_handle()->target())) :
-          boost::make_optional(Cell_handle_blue(xcv.blue_halfedge_handle()));
+          std::make_optional(Cell_handle_blue(xcv.blue_halfedge_handle()->target())) :
+          std::make_optional(Cell_handle_blue(xcv.blue_halfedge_handle()));
 
       return Point_2(base_p, red_cell, blue_cell);
     }
@@ -631,15 +631,15 @@ class Arr_overlay_traits_2 {
         red_cell =
           (! xcv.red_halfedge_handle()->source()->is_at_open_boundary() &&
            m_base_equal(base_p, xcv.red_halfedge_handle()->source()->point())) ?
-          boost::make_optional(Cell_handle_red(xcv.red_halfedge_handle()->source())) :
-          boost::make_optional(Cell_handle_red(xcv.red_halfedge_handle()));
+          std::make_optional(Cell_handle_red(xcv.red_halfedge_handle()->source())) :
+          std::make_optional(Cell_handle_red(xcv.red_halfedge_handle()));
 
       if ((xcv.color() == BLUE) || (xcv.color() == RB_OVERLAP))
         blue_cell =
           (! xcv.blue_halfedge_handle()->source()->is_at_open_boundary() &&
            m_base_equal(base_p, xcv.blue_halfedge_handle()->source()->point())) ?
-          boost::make_optional(Cell_handle_blue(xcv.blue_halfedge_handle()->source())) :
-          boost::make_optional(Cell_handle_blue(xcv.blue_halfedge_handle()));
+          std::make_optional(Cell_handle_blue(xcv.blue_halfedge_handle()->source())) :
+          std::make_optional(Cell_handle_blue(xcv.blue_halfedge_handle()));
 
       return (Point_2(base_p, red_cell, blue_cell));
     }
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_vert_decomp_ss_visitor.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_vert_decomp_ss_visitor.h
index b6b7be876f6f..952bf00e183e 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_vert_decomp_ss_visitor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_vert_decomp_ss_visitor.h
@@ -69,7 +69,7 @@ class Arr_vert_decomp_ss_visitor :
   typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>
     Cell_type;
-  typedef boost::optional<Cell_type>                    Vert_type;
+  typedef std::optional<Cell_type>                    Vert_type;
   typedef std::pair<Vert_type, Vert_type>               Vert_pair;
   typedef std::pair<Vertex_const_handle, Vert_pair>     Vert_entry;
 
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Vertical_decomposition_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Vertical_decomposition_test.h
index 6ffb18e01f37..881c939b5ffb 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Vertical_decomposition_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Vertical_decomposition_test.h
@@ -46,7 +46,7 @@ class Vertical_decomposition_test : public IO_test<GeomTraits_2> {
 
   typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>               Cell_type;
-  typedef boost::optional<Cell_type>                      Vert_type;
+  typedef std::optional<Cell_type>                      Vert_type;
   typedef typename std::pair<Vert_type, Vert_type>        Vert_pair;
   typedef typename std::pair<Vertex_const_handle, Vert_pair>
                                                           Vert_decomp_entry;
diff --git a/BGL/include/CGAL/boost/graph/helpers.h b/BGL/include/CGAL/boost/graph/helpers.h
index 21644ebf18f4..5ce55025c763 100644
--- a/BGL/include/CGAL/boost/graph/helpers.h
+++ b/BGL/include/CGAL/boost/graph/helpers.h
@@ -60,7 +60,7 @@ bool is_border(typename boost::graph_traits<FaceGraph>::edge_descriptor ed, cons
     returns a halfedge which is on a border and whose target vertex is `vd`, if such a halfedge exists.
   */
 template <typename FaceGraph>
-boost::optional<typename boost::graph_traits<FaceGraph>::halfedge_descriptor>
+std::optional<typename boost::graph_traits<FaceGraph>::halfedge_descriptor>
 is_border(typename boost::graph_traits<FaceGraph>::vertex_descriptor vd,
           const FaceGraph& g)
 {
@@ -72,7 +72,7 @@ is_border(typename boost::graph_traits<FaceGraph>::vertex_descriptor vd,
     }
   }
   // empty
-  return boost::optional<typename boost::graph_traits<FaceGraph>::halfedge_descriptor>();
+  return std::optional<typename boost::graph_traits<FaceGraph>::halfedge_descriptor>();
 }
 
 namespace BGL {
diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
index 7f9ea3dfcbbf..da4b706b9bbb 100644
--- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
+++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
@@ -44,7 +44,7 @@ class BarycentricCoordinates_2 {
     Weights are computed with respect to a query point of the type `Traits::Point_2` and
     stored in the output iterator `output`. The function returns a pointer to the last stored element.
   */
-  boost::optional<OutputIterator>
+  std::optional<OutputIterator>
   weights(
     const Traits::Point_2& query_point, OutputIterator& output) {
 
@@ -57,7 +57,7 @@ class BarycentricCoordinates_2 {
     are computed with respect to a query point of the type `Traits::Point_2` and stored
     in the output iterator `output`. The function returns a pointer to the last stored element.
   */
-  boost::optional<OutputIterator>
+  std::optional<OutputIterator>
   coordinates_on_bounded_side(
     const Traits::Point_2& query_point,
     OutputIterator& output,
@@ -72,7 +72,7 @@ class BarycentricCoordinates_2 {
     are computed with respect to a query point of the type `Traits::Point_2` and stored
     in the output iterator `output`. The function returns a pointer to the last stored element.
   */
-  boost::optional<OutputIterator>
+  std::optional<OutputIterator>
   coordinates_on_unbounded_side(
     const Traits::Point_2& query_point,
     OutputIterator& output,
diff --git a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Discrete_harmonic_2.h b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Discrete_harmonic_2.h
index 91d96c2f1c40..8ef72b0bce5b 100644
--- a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Discrete_harmonic_2.h
+++ b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Discrete_harmonic_2.h
@@ -24,7 +24,7 @@
 #include <CGAL/Barycentric_coordinates_2/barycentric_enum_2.h>
 
 // Boost headers.
-#include <boost/optional/optional.hpp>
+#include <optional>
 
 // CGAL namespace.
 namespace CGAL {
@@ -98,7 +98,7 @@ Discrete_harmonic_2
 
     // This function computes discrete harmonic weights (unnormalized coordinates) for a chosen query point.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> weights(const Point_2 &query_point, OutputIterator &output)
+        inline std::optional<OutputIterator> weights(const Point_2 &query_point, OutputIterator &output)
     {
         return weights_2(query_point, output);
     }
@@ -108,7 +108,7 @@ Discrete_harmonic_2
     // This function computes discrete harmonic barycentric coordinates for a chosen query point on the bounded side of a strictly convex polygon.
     // \pre The provided polygon is strictly convex.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> coordinates_on_bounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
+        inline std::optional<OutputIterator> coordinates_on_bounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
     {
         switch(type_of_algorithm)
         {
@@ -124,14 +124,14 @@ Discrete_harmonic_2
         // Pointer cannot be here. Something went wrong.
         const bool type_of_algorithm_failure = true;
         CGAL_postcondition( !type_of_algorithm_failure );
-        if(!type_of_algorithm_failure) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(!type_of_algorithm_failure) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // This function computes discrete harmonic barycentric coordinates for a chosen query point on the unbounded side of a strictly convex polygon.
     // \pre The provided polygon is strictly convex.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> coordinates_on_unbounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm, const bool warning_tag = true)
+        inline std::optional<OutputIterator> coordinates_on_unbounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm, const bool warning_tag = true)
     {
         switch(type_of_algorithm)
         {
@@ -147,8 +147,8 @@ Discrete_harmonic_2
         // Pointer cannot be here. Something went wrong.
         const bool type_of_algorithm_failure = true;
         CGAL_postcondition( !type_of_algorithm_failure );
-        if(!type_of_algorithm_failure) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(!type_of_algorithm_failure) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // Information Functions
@@ -184,7 +184,7 @@ Discrete_harmonic_2
 
     // Compute discrete harmonic weights without normalization.
     template<class OutputIterator>
-        boost::optional<OutputIterator> weights_2(const Point_2 &query_point, OutputIterator &output)
+        std::optional<OutputIterator> weights_2(const Point_2 &query_point, OutputIterator &output)
     {
         // Get the number of vertices in the polygon.
         const int n = int(number_of_vertices);
@@ -220,7 +220,7 @@ Discrete_harmonic_2
         ++output;
 
         // Return weights.
-        return boost::optional<OutputIterator>(output);
+        return std::optional<OutputIterator>(output);
     }
 
     // COORDINATES ON BOUNDED SIDE.
@@ -228,7 +228,7 @@ Discrete_harmonic_2
     // Compute discrete harmonic coordinates on the bounded side of the polygon with the slow O(n^2) but precise algorithm.
     // Here, n - is the number of the polygon's vertices.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_bounded_side_precise_2(const Point_2 &query_point, OutputIterator &output)
+        std::optional<OutputIterator> coordinates_on_bounded_side_precise_2(const Point_2 &query_point, OutputIterator &output)
     {
         CGAL_precondition( type_of_polygon() == STRICTLY_CONVEX );
 
@@ -281,13 +281,13 @@ Discrete_harmonic_2
         ++output;
 
         // Return coordinates.
-        return boost::optional<OutputIterator>(output);
+        return std::optional<OutputIterator>(output);
     }
 
     // Compute discrete harmonic coordinates on the bounded side of the polygon with the fast O(n) but less precise algorithm.
     // Here, n - is the number of the polygon's vertices. Precision is lost near the boundary (~ 1.0e-10 and closer).
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_bounded_side_fast_2(const Point_2 &query_point, OutputIterator &output)
+        std::optional<OutputIterator> coordinates_on_bounded_side_fast_2(const Point_2 &query_point, OutputIterator &output)
     {
         CGAL_precondition( type_of_polygon() == STRICTLY_CONVEX );
 
@@ -338,7 +338,7 @@ Discrete_harmonic_2
         ++output;
 
         // Return coordinates.
-        return boost::optional<OutputIterator>(output);
+        return std::optional<OutputIterator>(output);
     }
 
     // COORDINATES ON UNBOUNDED SIDE.
@@ -346,7 +346,7 @@ Discrete_harmonic_2
     // Compute discrete harmonic coordinates on the unbounded side of the polygon with the slow O(n^2) but precise algorithm.
     // Here, n - is the number of the polygon's vertices.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_unbounded_side_precise_2(const Point_2 &query_point, OutputIterator &output, bool warning_tag)
+        std::optional<OutputIterator> coordinates_on_unbounded_side_precise_2(const Point_2 &query_point, OutputIterator &output, bool warning_tag)
     {
         if(warning_tag)
             std::cout << std::endl << "ATTENTION: Discrete harmonic coordinates might be not well-defined outside the polygon!" << std::endl;
@@ -358,7 +358,7 @@ Discrete_harmonic_2
     // Compute discrete harmonic coordinates on the unbounded side of the polygon with the fast O(n) but less precise algorithm.
     // Here, n - is the number of the polygon's vertices. Precision is lost near the boundary (~ 1.0e-10 and closer).
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_unbounded_side_fast_2(const Point_2 &query_point, OutputIterator &output, bool warning_tag)
+        std::optional<OutputIterator> coordinates_on_unbounded_side_fast_2(const Point_2 &query_point, OutputIterator &output, bool warning_tag)
     {
         if(warning_tag)
             std::cout << std::endl << "ATTENTION: Discrete harmonic coordinates might be not well-defined outside the polygon!" << std::endl;
diff --git a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Generalized_barycentric_coordinates_2.h b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Generalized_barycentric_coordinates_2.h
index 381291b3a33e..94db271c736c 100644
--- a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Generalized_barycentric_coordinates_2.h
+++ b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Generalized_barycentric_coordinates_2.h
@@ -24,7 +24,7 @@
 #include <CGAL/Barycentric_coordinates_2/barycentric_enum_2.h>
 
 // Boost headers.
-#include <boost/optional.hpp>
+#include <optional>
 
 // CGAL namespace.
 namespace CGAL {
@@ -118,7 +118,7 @@ Generalized_barycentric_coordinates_2
     /// `CGAL::Barycentric_coordinates::PRECISE` - default slow algorithm, which is as precise as possible and
     /// `CGAL::Barycentric_coordinates::FAST` - fast algorithm, which is less precise but much faster.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> operator()(const Point_2 &query_point, OutputIterator output, Query_point_location query_point_location = UNSPECIFIED_LOCATION, Type_of_algorithm type_of_algorithm = PRECISE)
+        inline std::optional<OutputIterator> operator()(const Point_2 &query_point, OutputIterator output, Query_point_location query_point_location = UNSPECIFIED_LOCATION, Type_of_algorithm type_of_algorithm = PRECISE)
     {
         return coordinates_2(query_point, output, query_point_location, type_of_algorithm);
     }
@@ -129,7 +129,7 @@ Generalized_barycentric_coordinates_2
     /// \pre The provided query point belongs to the polygon's boundary.
     /// \pre (0 <= index) && (index < number of the polygon's vertices).
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> compute_on_edge(const Point_2 &query_point, const int index, OutputIterator output) const
+        inline std::optional<OutputIterator> compute_on_edge(const Point_2 &query_point, const int index, OutputIterator output) const
     {
         return coordinates_on_boundary_2(query_point, index, output);
     }
@@ -139,7 +139,7 @@ Generalized_barycentric_coordinates_2
     ///
     /// \pre (0 <= index) && (index < number of the polygon's vertices).
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> compute_on_vertex(const int index, OutputIterator output) const
+        inline std::optional<OutputIterator> compute_on_vertex(const int index, OutputIterator output) const
     {
         return coordinates_on_vertex_2(index, output);
     }
@@ -149,7 +149,7 @@ Generalized_barycentric_coordinates_2
     ///
     /// \pre The provided query point belongs to the polygon's interior, excluding the boundary.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> compute_weights(const Point_2 &query_point, OutputIterator output)
+        inline std::optional<OutputIterator> compute_weights(const Point_2 &query_point, OutputIterator output)
     {
         return weights_2(query_point, output);
     }
@@ -183,7 +183,7 @@ Generalized_barycentric_coordinates_2
     // This function accepts a container of the type <a href="https://en.cppreference.com/w/cpp/container/vector">`std::vector`</a>
     // and returns an iterator of the type <a href="https://en.cppreference.com/w/cpp/iterator/back_insert_iterator">`std::back_insert_iterator`</a>
     // that is placed past-the-end of the resulting sequence of coordinate values.
-    inline boost::optional<std::back_insert_iterator<std::vector<FT> > > operator()(const Point_2 &query_point, std::vector<FT> &output_vector, Query_point_location query_point_location = UNSPECIFIED_LOCATION, Type_of_algorithm type_of_algorithm = PRECISE)
+    inline std::optional<std::back_insert_iterator<std::vector<FT> > > operator()(const Point_2 &query_point, std::vector<FT> &output_vector, Query_point_location query_point_location = UNSPECIFIED_LOCATION, Type_of_algorithm type_of_algorithm = PRECISE)
     {
         output_vector.reserve(output_vector.size() + number_of_vertices);
         typedef typename std::back_insert_iterator<std::vector<FT> > OutputIterator;
@@ -198,7 +198,7 @@ Generalized_barycentric_coordinates_2
     //
     // \pre The provided query point belongs to the polygon's boundary.
     // \pre (0 <= index) && (index < number of the polygon's vertices).
-    inline boost::optional<std::back_insert_iterator<std::vector<FT> > > compute_on_edge(const Point_2 &query_point, const int index, std::vector<FT> &output_vector) const
+    inline std::optional<std::back_insert_iterator<std::vector<FT> > > compute_on_edge(const Point_2 &query_point, const int index, std::vector<FT> &output_vector) const
     {
         output_vector.reserve(output_vector.size() + number_of_vertices);
         typedef typename std::back_insert_iterator<std::vector<FT> > OutputIterator;
@@ -212,7 +212,7 @@ Generalized_barycentric_coordinates_2
     // that is placed past-the-end of the resulting sequence of coordinate values.
     //
     // \pre (0 <= index) && (index < number of the polygon's vertices).
-    inline boost::optional<std::back_insert_iterator<std::vector<FT> > > compute_on_vertex(const int index, std::vector<FT> &output_vector) const
+    inline std::optional<std::back_insert_iterator<std::vector<FT> > > compute_on_vertex(const int index, std::vector<FT> &output_vector) const
     {
         output_vector.reserve(output_vector.size() + number_of_vertices);
         typedef typename std::back_insert_iterator<std::vector<FT> > OutputIterator;
@@ -226,7 +226,7 @@ Generalized_barycentric_coordinates_2
     // that is placed past-the-end of the resulting sequence of weight values.
     //
     // \pre The provided query point belongs to the polygon's interior, excluding the boundary.
-    inline boost::optional<std::back_insert_iterator<std::vector<FT> > > compute_weights(const Point_2 &query_point, std::vector<FT> &output_vector)
+    inline std::optional<std::back_insert_iterator<std::vector<FT> > > compute_weights(const Point_2 &query_point, std::vector<FT> &output_vector)
     {
         output_vector.reserve(output_vector.size() + number_of_vertices);
         typedef typename std::back_insert_iterator<std::vector<FT> > OutputIterator;
@@ -283,7 +283,7 @@ Generalized_barycentric_coordinates_2
 
     // Compute weights on the bounded side of the polygon - see precondition.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> weights_2(const Point_2 &query_point, OutputIterator &output)
+        inline std::optional<OutputIterator> weights_2(const Point_2 &query_point, OutputIterator &output)
     {
         // This is the only global precondition on the computation of weights.
         CGAL_precondition( CGAL::bounded_side_2(vertex.begin(), vertex.end(), query_point, barycentric_traits) == CGAL::ON_BOUNDED_SIDE );
@@ -295,7 +295,7 @@ Generalized_barycentric_coordinates_2
 
     // Compute coordinates at any point in the plane.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_2(const Point_2 &query_point, OutputIterator &output, const Query_point_location query_point_location, const Type_of_algorithm type_of_algorithm)
+        std::optional<OutputIterator> coordinates_2(const Point_2 &query_point, OutputIterator &output, const Query_point_location query_point_location, const Type_of_algorithm type_of_algorithm)
     {
         // Determine a location of the current query point provided by the user.
         switch(query_point_location)
@@ -324,13 +324,13 @@ Generalized_barycentric_coordinates_2
         // Pointer cannot be here. Something went wrong.
         const bool query_point_location_failure = true;
         CGAL_postcondition( !query_point_location_failure );
-        if(!query_point_location_failure) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(!query_point_location_failure) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // Compute coordinates at any point in the plane with unspecified location.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_unspecified_2(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
+        std::optional<OutputIterator> coordinates_unspecified_2(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
     {
         // Determine a global location of the current query point.
         switch(CGAL::bounded_side_2(vertex.begin(), vertex.end(), query_point, barycentric_traits))
@@ -355,15 +355,15 @@ Generalized_barycentric_coordinates_2
         // Pointer cannot be here. Something went wrong.
         const bool query_point_location_failure = true;
         CGAL_postcondition( !query_point_location_failure );
-        if(!query_point_location_failure) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(!query_point_location_failure) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // COORDINATES ON BOUNDED SIDE.
 
     // Compute coordinates on the bounded side of the polygon - precise or fast.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> coordinates_on_bounded_side_2(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
+        inline std::optional<OutputIterator> coordinates_on_bounded_side_2(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
     {
         CGAL_precondition( CGAL::bounded_side_2(vertex.begin(), vertex.end(), query_point, barycentric_traits) == CGAL::ON_BOUNDED_SIDE );
 
@@ -374,7 +374,7 @@ Generalized_barycentric_coordinates_2
 
     // Compute coordinates along the boundary of the polygon with beforehand known index of the edge to which the query point belongs.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_boundary_2(const Point_2 &query_point, const int index, OutputIterator &output) const
+        std::optional<OutputIterator> coordinates_on_boundary_2(const Point_2 &query_point, const int index, OutputIterator &output) const
     {
         CGAL_precondition( CGAL::bounded_side_2(vertex.begin(), vertex.end(), query_point, barycentric_traits) == CGAL::ON_BOUNDARY );
         CGAL_precondition( (0 <= index) && (index < int(number_of_vertices)) );
@@ -393,7 +393,7 @@ Generalized_barycentric_coordinates_2
 
             // Compute segment coordinates along the chosen edge with the index = `index`.
             Segment_coordinates_2<Traits> segment_coordinates(vertex[index], vertex[index+1]);
-            boost::optional<OutputIterator> success = segment_coordinates(query_point, output);
+            std::optional<OutputIterator> success = segment_coordinates(query_point, output);
             ++output;
 
             for(int i = index + 1; i < last; ++i) {
@@ -402,20 +402,20 @@ Generalized_barycentric_coordinates_2
             }
 
             // Return coordinates.
-            if(success) return boost::optional<OutputIterator>(output);
-            else return boost::optional<OutputIterator>();
+            if(success) return std::optional<OutputIterator>(output);
+            else return std::optional<OutputIterator>();
         }
 
         // Pointer cannot be here. Something went wrong.
         const bool coordinates_on_boundary_failure = true;
         CGAL_postcondition( !coordinates_on_boundary_failure );
-        if(!coordinates_on_boundary_failure) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(!coordinates_on_boundary_failure) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // Compute coordinates along the boundary of the polygon without beforehand known index of the edge to which the query point belongs.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_boundary_2(const Point_2 &query_point, OutputIterator &output) const
+        std::optional<OutputIterator> coordinates_on_boundary_2(const Point_2 &query_point, OutputIterator &output) const
     {
         CGAL_precondition( CGAL::bounded_side_2(vertex.begin(), vertex.end(), query_point, barycentric_traits) == CGAL::ON_BOUNDARY );
 
@@ -435,7 +435,7 @@ Generalized_barycentric_coordinates_2
 
                     // Compute segment coordinates along the edge with the query point.
                     Segment_coordinates_2<Traits> segment_coordinates(vertex[index], vertex[index+1]);
-                    boost::optional<OutputIterator> success = segment_coordinates(query_point, output);
+                    std::optional<OutputIterator> success = segment_coordinates(query_point, output);
                     if(success) status = true;
                     ++output;
                     break;
@@ -452,20 +452,20 @@ Generalized_barycentric_coordinates_2
             }
 
             // Return coordinates.
-            if(status == true) return boost::optional<OutputIterator>(output);
-            else return boost::optional<OutputIterator>();
+            if(status == true) return std::optional<OutputIterator>(output);
+            else return std::optional<OutputIterator>();
         }
 
         // Pointer cannot be here. Something went wrong.
         const bool coordinates_on_boundary_failure = true;
         CGAL_postcondition( !coordinates_on_boundary_failure );
-        if(!coordinates_on_boundary_failure) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(!coordinates_on_boundary_failure) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // Compute coordinates for a query point lying on the last edge of the polygon.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_last_edge_2(const Point_2 &query_point, const int last, OutputIterator &output) const
+        std::optional<OutputIterator> coordinates_on_last_edge_2(const Point_2 &query_point, const int last, OutputIterator &output) const
     {
         // Some convenient typedefs.
         typedef std::vector<FT> Coordinate_vector;
@@ -478,7 +478,7 @@ Generalized_barycentric_coordinates_2
 
         // Compute segment coordinates along the last edge of the polygon.
         Segment_coordinates_2<Traits> segment_coordinates(vertex[last], vertex[0]);
-        boost::optional<Vector_insert_iterator> success = segment_coordinates(query_point, std::back_inserter(coordinate));
+        std::optional<Vector_insert_iterator> success = segment_coordinates(query_point, std::back_inserter(coordinate));
 
         // Store all the coordinate values.
         // All the values are zeros apart from those corresponding to the first and the last vertices of the polygon.
@@ -492,15 +492,15 @@ Generalized_barycentric_coordinates_2
         ++output;
 
         // Return computed coordinates.
-        if(success) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(success) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // COORDINATES AT VERTEX.
 
     // Compute coordinates for a query point lying at one of the polygon's vertices with beforehand known vertex's index.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_vertex_2(const int index, OutputIterator &output) const
+        std::optional<OutputIterator> coordinates_on_vertex_2(const int index, OutputIterator &output) const
     {
         CGAL_precondition( (0 <= index) && (index < int(number_of_vertices)) );
 
@@ -519,12 +519,12 @@ Generalized_barycentric_coordinates_2
         }
 
         // Return coordinates.
-        return boost::optional<OutputIterator>(output);
+        return std::optional<OutputIterator>(output);
     }
 
     // Compute coordinates for a query point lying at one of the polygon's vertices without beforehand known vertex's index.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_vertex_2(const Point_2 &query_point, OutputIterator &output) const
+        std::optional<OutputIterator> coordinates_on_vertex_2(const Point_2 &query_point, OutputIterator &output) const
     {
         int index = -1;
         CGAL_precondition( is_query_point_at_vertex(query_point, index) );
@@ -554,15 +554,15 @@ Generalized_barycentric_coordinates_2
 
         // Return coordinates.
         CGAL_postcondition( !coordinates_on_vertex_failure );
-        if(!coordinates_on_vertex_failure) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(!coordinates_on_vertex_failure) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // COORDINATES ON UNBOUNDED SIDE.
 
     // Compute coordinates on the unbounded side of the polygon - precise or fast.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> coordinates_on_unbounded_side_2(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
+        inline std::optional<OutputIterator> coordinates_on_unbounded_side_2(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
     {
         CGAL_precondition( CGAL::bounded_side_2(vertex.begin(), vertex.end(), query_point, barycentric_traits) == CGAL::ON_UNBOUNDED_SIDE );
 
diff --git a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Mean_value_2.h b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Mean_value_2.h
index ef895698b0ae..2dca8b2b8fb3 100644
--- a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Mean_value_2.h
+++ b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Mean_value_2.h
@@ -26,7 +26,7 @@
 
 // Boost headers.
 #include <boost/mpl/has_xxx.hpp>
-#include <boost/optional/optional.hpp>
+#include <optional>
 
 // Barycentric coordinates headers.
 #include <CGAL/Barycentric_coordinates_2/barycentric_enum_2.h>
@@ -154,7 +154,7 @@ Mean_value_2
 
     // This function computes mean value weights (unnormalized coordinates) for a chosen query point.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> weights(const Point_2 &query_point, OutputIterator &output)
+        inline std::optional<OutputIterator> weights(const Point_2 &query_point, OutputIterator &output)
     {
         return weights_2(query_point, output);
     }
@@ -163,7 +163,7 @@ Mean_value_2
 
     // This function computes mean value barycentric coordinates for a chosen query point on the bounded side of a simple polygon.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> coordinates_on_bounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
+        inline std::optional<OutputIterator> coordinates_on_bounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
     {
         switch(type_of_algorithm)
         {
@@ -179,13 +179,13 @@ Mean_value_2
         // Pointer cannot be here. Something went wrong.
         const bool type_of_algorithm_failure = true;
         CGAL_postcondition( !type_of_algorithm_failure );
-        if(!type_of_algorithm_failure) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(!type_of_algorithm_failure) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // This function computes mean value barycentric coordinates for a chosen query point on the unbounded side of a simple polygon.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> coordinates_on_unbounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
+        inline std::optional<OutputIterator> coordinates_on_unbounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
     {
         switch(type_of_algorithm)
         {
@@ -201,8 +201,8 @@ Mean_value_2
         // Pointer cannot be here. Something went wrong.
         const bool type_of_algorithm_failure = true;
         CGAL_postcondition( !type_of_algorithm_failure );
-        if(!type_of_algorithm_failure) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(!type_of_algorithm_failure) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // Information Functions
@@ -243,7 +243,7 @@ Mean_value_2
 
     // Compute mean value weights without normalization.
     template<class OutputIterator>
-        boost::optional<OutputIterator> weights_2(const Point_2 &query_point, OutputIterator &output)
+        std::optional<OutputIterator> weights_2(const Point_2 &query_point, OutputIterator &output)
     {
         // Get the number of vertices in the polygon.
         const int n = int(number_of_vertices);
@@ -293,7 +293,7 @@ Mean_value_2
         ++output;
 
         // Return weights.
-        return boost::optional<OutputIterator>(output);
+        return std::optional<OutputIterator>(output);
     }
 
     // COORDINATES ON BOUNDED SIDE.
@@ -301,7 +301,7 @@ Mean_value_2
     // Compute mean value coordinates on the bounded side of the polygon with the slow O(n^2) but precise algorithm.
     // Here, n - is the number of the polygon's vertices.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_bounded_side_precise_2(const Point_2 &query_point, OutputIterator &output)
+        std::optional<OutputIterator> coordinates_on_bounded_side_precise_2(const Point_2 &query_point, OutputIterator &output)
     {
         // Get the number of vertices in the polygon.
         const int n = int(number_of_vertices);
@@ -368,13 +368,13 @@ Mean_value_2
         ++output;
 
         // Return coordinates.
-        return boost::optional<OutputIterator>(output);
+        return std::optional<OutputIterator>(output);
     }
 
     // Compute mean value coordinates on the bounded side of the polygon with the fast O(n) but less precise algorithm.
     // Here, n - is the number of the polygon's vertices. Precision is lost near the boundary (~ 1.0e-10 and closer).
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_bounded_side_fast_2(const Point_2 &query_point, OutputIterator &output)
+        std::optional<OutputIterator> coordinates_on_bounded_side_fast_2(const Point_2 &query_point, OutputIterator &output)
     {
         // Get the number of vertices in the polygon.
         const int n = int(number_of_vertices);
@@ -437,7 +437,7 @@ Mean_value_2
         ++output;
 
         // Return coordinates.
-        return boost::optional<OutputIterator>(output);
+        return std::optional<OutputIterator>(output);
     }
 
     // COORDINATES ON UNBOUNDED SIDE.
@@ -445,7 +445,7 @@ Mean_value_2
     // Compute mean value coordinates on the unbounded side of the polygon with the slow O(n^2) but precise algorithm.
     // Here, n - is the number of the polygon's vertices.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_unbounded_side_precise_2(const Point_2 &query_point, OutputIterator &output)
+        std::optional<OutputIterator> coordinates_on_unbounded_side_precise_2(const Point_2 &query_point, OutputIterator &output)
     {
         // Use the same formulas as for the bounded side since they are also valid on the unbounded side.
         return coordinates_on_bounded_side_precise_2(query_point, output);
@@ -454,7 +454,7 @@ Mean_value_2
     // Compute mean value coordinates on the unbounded side of the polygon with the fast O(n) but less precise algorithm.
     // Here, n - is the number of the polygon's vertices. Precision is lost near the boundary (~ 1.0e-10 and closer).
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_unbounded_side_fast_2(const Point_2 &query_point, OutputIterator &output)
+        std::optional<OutputIterator> coordinates_on_unbounded_side_fast_2(const Point_2 &query_point, OutputIterator &output)
     {
         // Use the same formulas as for the bounded side since they are also valid on the unbounded side.
         return coordinates_on_bounded_side_fast_2(query_point, output);
diff --git a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Wachspress_2.h b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Wachspress_2.h
index 469b84a09a30..d43f879bdf52 100644
--- a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Wachspress_2.h
+++ b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Wachspress_2.h
@@ -24,7 +24,7 @@
 #include <CGAL/Barycentric_coordinates_2/barycentric_enum_2.h>
 
 // Boost headers.
-#include <boost/optional/optional.hpp>
+#include <optional>
 
 // CGAL namespace.
 namespace CGAL {
@@ -96,7 +96,7 @@ Wachspress_2
 
     // This function computes Wachspress weights (unnormalized coordinates) for a chosen query point.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> weights(const Point_2 &query_point, OutputIterator &output)
+        inline std::optional<OutputIterator> weights(const Point_2 &query_point, OutputIterator &output)
     {
         return weights_2(query_point, output);
     }
@@ -106,7 +106,7 @@ Wachspress_2
     // This function computes Wachspress barycentric coordinates for a chosen query point on the bounded side of a strictly convex polygon.
     // \pre The provided polygon is strictly convex.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> coordinates_on_bounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
+        inline std::optional<OutputIterator> coordinates_on_bounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm)
     {
         switch(type_of_algorithm)
         {
@@ -122,14 +122,14 @@ Wachspress_2
         // Pointer cannot be here. Something went wrong.
         const bool type_of_algorithm_failure = true;
         CGAL_postcondition( !type_of_algorithm_failure );
-        if(!type_of_algorithm_failure) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(!type_of_algorithm_failure) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // This function computes Wachspress barycentric coordinates for a chosen query point on the unbounded side of a strictly convex polygon.
     // \pre The provided polygon is strictly convex.
     template<class OutputIterator>
-        inline boost::optional<OutputIterator> coordinates_on_unbounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm, const bool warning_tag = true)
+        inline std::optional<OutputIterator> coordinates_on_unbounded_side(const Point_2 &query_point, OutputIterator &output, const Type_of_algorithm type_of_algorithm, const bool warning_tag = true)
     {
         switch(type_of_algorithm)
         {
@@ -145,8 +145,8 @@ Wachspress_2
         // Pointer cannot be here. Something went wrong.
         const bool type_of_algorithm_failure = true;
         CGAL_postcondition( !type_of_algorithm_failure );
-        if(!type_of_algorithm_failure) return boost::optional<OutputIterator>(output);
-        else return boost::optional<OutputIterator>();
+        if(!type_of_algorithm_failure) return std::optional<OutputIterator>(output);
+        else return std::optional<OutputIterator>();
     }
 
     // Information Functions
@@ -181,7 +181,7 @@ Wachspress_2
 
     // Compute Wachspress weights without normalization.
     template<class OutputIterator>
-        boost::optional<OutputIterator> weights_2(const Point_2 &query_point, OutputIterator &output)
+        std::optional<OutputIterator> weights_2(const Point_2 &query_point, OutputIterator &output)
     {
         // Get the number of vertices in the polygon.
         const int n = int(number_of_vertices);
@@ -214,7 +214,7 @@ Wachspress_2
         ++output;
 
         // Return weights.
-        return boost::optional<OutputIterator>(output);
+        return std::optional<OutputIterator>(output);
     }
 
     // COORDINATES ON BOUNDED SIDE.
@@ -222,7 +222,7 @@ Wachspress_2
     // Compute Wachspress coordinates on the bounded side of the polygon with the slow O(n^2) but precise algorithm.
     // Here, n - is the number of the polygon's vertices.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_bounded_side_precise_2(const Point_2 &query_point, OutputIterator &output)
+        std::optional<OutputIterator> coordinates_on_bounded_side_precise_2(const Point_2 &query_point, OutputIterator &output)
     {
         CGAL_precondition( type_of_polygon() == STRICTLY_CONVEX );
 
@@ -265,13 +265,13 @@ Wachspress_2
         ++output;
 
         // Return coordinates.
-        return boost::optional<OutputIterator>(output);
+        return std::optional<OutputIterator>(output);
     }
 
     // Compute Wachspress coordinates on the bounded side of the polygon with the fast O(n) but less precise algorithm.
     // Here, n - is the number of the polygon's vertices. Precision is lost near the boundary (~ 1.0e-10 and closer).
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_bounded_side_fast_2(const Point_2 &query_point, OutputIterator &output)
+        std::optional<OutputIterator> coordinates_on_bounded_side_fast_2(const Point_2 &query_point, OutputIterator &output)
     {
         CGAL_precondition( type_of_polygon() == STRICTLY_CONVEX );
 
@@ -319,7 +319,7 @@ Wachspress_2
         ++output;
 
         // Return coordinates.
-        return boost::optional<OutputIterator>(output);
+        return std::optional<OutputIterator>(output);
     }
 
     // COORDINATES ON UNBOUNDED SIDE.
@@ -327,7 +327,7 @@ Wachspress_2
     // Compute Wachspress coordinates on the unbounded side of the polygon with the slow O(n^2) but precise algorithm.
     // Here, n - is the number of the polygon's vertices.
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_unbounded_side_precise_2(const Point_2 &query_point, OutputIterator &output, bool warning_tag)
+        std::optional<OutputIterator> coordinates_on_unbounded_side_precise_2(const Point_2 &query_point, OutputIterator &output, bool warning_tag)
     {
         if(warning_tag)
             std::cout << std::endl << "ATTENTION: Wachspress coordinates might be not well-defined outside the polygon!" << std::endl;
@@ -339,7 +339,7 @@ Wachspress_2
     // Compute Wachspress coordinates on the unbounded side of the polygon with the fast O(n) but less precise algorithm.
     // Here, n - is the number of the polygon's vertices. Precision is lost near the boundary (~ 1.0e-10 and closer).
     template<class OutputIterator>
-        boost::optional<OutputIterator> coordinates_on_unbounded_side_fast_2(const Point_2 &query_point, OutputIterator &output, bool warning_tag)
+        std::optional<OutputIterator> coordinates_on_unbounded_side_fast_2(const Point_2 &query_point, OutputIterator &output, bool warning_tag)
     {
         if(warning_tag)
             std::cout << std::endl << "ATTENTION: Wachspress coordinates might be not well-defined outside the polygon!" << std::endl;
diff --git a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/internal/utils_2.h b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/internal/utils_2.h
index 7faa4f49eb2c..0cc79e16bc08 100644
--- a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/internal/utils_2.h
+++ b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/internal/utils_2.h
@@ -31,7 +31,7 @@
 
 // Boost headers.
 #include <boost/mpl/has_xxx.hpp>
-#include <boost/optional/optional.hpp>
+#include <optional>
 
 // Internal includes.
 #include <CGAL/Weights/internal/polygon_utils_2.h>
@@ -222,7 +222,7 @@ namespace internal {
   typename VertexRange,
   typename GeomTraits,
   typename PointMap>
-  boost::optional< std::pair<Query_point_location, std::size_t> >
+  std::optional< std::pair<Query_point_location, std::size_t> >
   get_edge_index_approximate(
     const VertexRange& polygon,
     const typename GeomTraits::Point_2& query,
@@ -264,7 +264,7 @@ namespace internal {
         return std::make_pair(Query_point_location::ON_EDGE, i);
       }
     }
-    return boost::none;
+    return std::nullopt;
   }
 
   // Why this one does not work for harmonic coordinates? - Due to the imprecisions in the Mesh_2 class.
@@ -273,7 +273,7 @@ namespace internal {
   typename VertexRange,
   typename GeomTraits,
   typename PointMap>
-  boost::optional< std::pair<Query_point_location, std::size_t> >
+  std::optional< std::pair<Query_point_location, std::size_t> >
   get_edge_index_exact(
     const VertexRange& polygon,
     const typename GeomTraits::Point_2& query,
@@ -303,7 +303,7 @@ namespace internal {
         return std::make_pair(Query_point_location::ON_EDGE, i);
       }
     }
-    return boost::none;
+    return std::nullopt;
   }
 
   // Check whether a query point belongs to the last polygon edge.
@@ -409,7 +409,7 @@ namespace internal {
   typename VertexRange,
   typename GeomTraits,
   typename PointMap>
-  boost::optional< std::pair<Query_point_location, std::size_t> >
+  std::optional< std::pair<Query_point_location, std::size_t> >
   locate_wrt_polygon_2(
     const VertexRange& polygon,
     const typename GeomTraits::Point_2& query,
@@ -430,7 +430,7 @@ namespace internal {
       default:
         return std::make_pair(Query_point_location::UNSPECIFIED, std::size_t(-1));
     }
-    return boost::none;
+    return std::nullopt;
   }
 
 } // namespace internal
diff --git a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/segment_coordinates_2.h b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/segment_coordinates_2.h
index b2b3120e0baf..99f9c6fb76fb 100644
--- a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/segment_coordinates_2.h
+++ b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/segment_coordinates_2.h
@@ -245,7 +245,7 @@ namespace Barycentric_coordinates {
     /// Computes segment barycentric coordinates for a chosen query point with respect to both vertices of the segment.
     /// Computed coordinates are stored in the output iterator `output`.
     template<class OutputIterator>
-    inline boost::optional<OutputIterator> operator()(
+    inline std::optional<OutputIterator> operator()(
       const Point_2 &query_point, OutputIterator output)
     {
       return segment_coordinates_2(query_point, output);
@@ -280,7 +280,7 @@ namespace Barycentric_coordinates {
     // This function accepts a container of the type <a href="https://en.cppreference.com/w/cpp/container/vector">`std::vector`</a>
     // and returns an iterator of the type <a href="https://en.cppreference.com/w/cpp/iterator/back_insert_iterator">`std::back_insert_iterator`</a>
     // that is placed past-the-end of the resulting sequence of coordinate values.
-    inline boost::optional<std::back_insert_iterator<std::vector<FT> > > operator()(
+    inline std::optional<std::back_insert_iterator<std::vector<FT> > > operator()(
       const Point_2 &query_point, std::vector<FT> &output_vector)
     {
       output_vector.reserve(output_vector.size() + 2);
@@ -327,7 +327,7 @@ namespace Barycentric_coordinates {
 
     // Compute segment coordinates.
     template<class OutputIterator>
-    boost::optional<OutputIterator> segment_coordinates_2(
+    std::optional<OutputIterator> segment_coordinates_2(
       const Point_2 &query_point, OutputIterator &output) {
 
       // Project point on the segment and compute the first coordinate.
@@ -341,7 +341,7 @@ namespace Barycentric_coordinates {
       ++output;
 
       // Output both coordinates.
-      return boost::optional<OutputIterator>(output);
+      return std::optional<OutputIterator>(output);
     }
   };
 
diff --git a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/triangle_coordinates_2.h b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/triangle_coordinates_2.h
index 33dd658db9a3..bc681d3bf381 100644
--- a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/triangle_coordinates_2.h
+++ b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/triangle_coordinates_2.h
@@ -257,7 +257,7 @@ namespace Barycentric_coordinates {
     /// Computes triangle barycentric coordinates for a chosen query point with respect to all three vertices of the triangle.
     /// Computed coordinates are stored in the output iterator `output`.
     template<class OutputIterator>
-    inline boost::optional<OutputIterator> operator()(
+    inline std::optional<OutputIterator> operator()(
       const Point_2 &query_point, OutputIterator output)
     {
       return triangle_coordinates_2(query_point, output);
@@ -298,7 +298,7 @@ namespace Barycentric_coordinates {
     // This function accepts a container of the type <a href="https://en.cppreference.com/w/cpp/container/vector">`std::vector`</a>
     // and returns an iterator of the type <a href="https://en.cppreference.com/w/cpp/iterator/back_insert_iterator">`std::back_insert_iterator`</a>
     // that is placed past-the-end of the resulting sequence of coordinate values.
-    inline boost::optional<std::back_insert_iterator<std::vector<FT> > > operator()(
+    inline std::optional<std::back_insert_iterator<std::vector<FT> > > operator()(
       const Point_2 &query_point, std::vector<FT> &output_vector)
     {
       output_vector.reserve(output_vector.size() + 3);
@@ -347,7 +347,7 @@ namespace Barycentric_coordinates {
 
     // Compute triangle coordinates.
     template<class OutputIterator>
-    boost::optional<OutputIterator> triangle_coordinates_2(
+    std::optional<OutputIterator> triangle_coordinates_2(
       const Point_2 &query_point, OutputIterator &output) {
 
       // Compute some related sub-areas.
@@ -372,7 +372,7 @@ namespace Barycentric_coordinates {
       ++output;
 
       // Output all coordinates.
-      return boost::optional<OutputIterator>(output);
+      return std::optional<OutputIterator>(output);
     }
   };
 
diff --git a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_dh_deprecated_api.cpp b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_dh_deprecated_api.cpp
index c19f597f43f5..b34ca8c29098 100644
--- a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_dh_deprecated_api.cpp
+++ b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_dh_deprecated_api.cpp
@@ -19,7 +19,7 @@ typedef CGAL::Barycentric_coordinates::Triangle_coordinates_2<Kernel> Triangle_c
 typedef CGAL::Barycentric_coordinates::Discrete_harmonic_2<Kernel> Discrete_harmonic;
 typedef CGAL::Barycentric_coordinates::Generalized_barycentric_coordinates_2<Discrete_harmonic, Kernel> Discrete_harmonic_coordinates;
 
-typedef boost::optional<Vector_insert_iterator> Output_type;
+typedef std::optional<Vector_insert_iterator> Output_type;
 
 using std::cout; using std::endl; using std::string;
 
diff --git a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_mv_deprecated_api.cpp b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_mv_deprecated_api.cpp
index 25436a0bd6e2..c4bac5497a4e 100644
--- a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_mv_deprecated_api.cpp
+++ b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_mv_deprecated_api.cpp
@@ -19,7 +19,7 @@ typedef CGAL::Barycentric_coordinates::Triangle_coordinates_2<Kernel> Triangle_c
 typedef CGAL::Barycentric_coordinates::Mean_value_2<Kernel> Mean_value;
 typedef CGAL::Barycentric_coordinates::Generalized_barycentric_coordinates_2<Mean_value, Kernel> Mean_value_coordinates;
 
-typedef boost::optional<Vector_insert_iterator> Output_type;
+typedef std::optional<Vector_insert_iterator> Output_type;
 
 using std::cout; using std::endl; using std::string;
 
diff --git a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_sc_deprecated_api.cpp b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_sc_deprecated_api.cpp
index d0b363c7a7e7..9b39a907f43b 100644
--- a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_sc_deprecated_api.cpp
+++ b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_sc_deprecated_api.cpp
@@ -12,7 +12,7 @@ typedef std::back_insert_iterator<Coordinate_vector> Vector_insert_iterator;
 
 typedef CGAL::Barycentric_coordinates::Segment_coordinates_2<Kernel> Segment_coordinates;
 
-typedef boost::optional<Vector_insert_iterator> Output_type;
+typedef std::optional<Vector_insert_iterator> Output_type;
 
 using std::cout; using std::endl; using std::string;
 
diff --git a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_tc_deprecated_api.cpp b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_tc_deprecated_api.cpp
index e37784a8adbd..bd83f52a5bd9 100644
--- a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_tc_deprecated_api.cpp
+++ b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_tc_deprecated_api.cpp
@@ -12,7 +12,7 @@ typedef std::back_insert_iterator<Coordinate_vector> Vector_insert_iterator;
 
 typedef CGAL::Barycentric_coordinates::Triangle_coordinates_2<Kernel> Triangle_coordinates;
 
-typedef boost::optional<Vector_insert_iterator> Output_type;
+typedef std::optional<Vector_insert_iterator> Output_type;
 
 using std::cout; using std::endl; using std::string;
 
diff --git a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_wp_deprecated_api.cpp b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_wp_deprecated_api.cpp
index a44bdb5391df..ae349dffb76c 100644
--- a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_wp_deprecated_api.cpp
+++ b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_wp_deprecated_api.cpp
@@ -19,7 +19,7 @@ typedef CGAL::Barycentric_coordinates::Triangle_coordinates_2<Kernel> Triangle_c
 typedef CGAL::Barycentric_coordinates::Wachspress_2<Kernel> Wachspress;
 typedef CGAL::Barycentric_coordinates::Generalized_barycentric_coordinates_2<Wachspress, Kernel> Wachspress_coordinates;
 
-typedef boost::optional<Vector_insert_iterator> Output_type;
+typedef std::optional<Vector_insert_iterator> Output_type;
 
 using std::cout; using std::endl; using std::string;
 
diff --git a/Cartesian_kernel/include/CGAL/Cartesian_converter.h b/Cartesian_kernel/include/CGAL/Cartesian_converter.h
index 916697a972d4..c2e9806c2bb7 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian_converter.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian_converter.h
@@ -140,11 +140,11 @@ class Cartesian_converter : public Enum_converter
     // visit to get the type, and copy construct inside the return type
     template<BOOST_VARIANT_ENUM_PARAMS(typename U)>
     typename
-    Type_mapper< boost::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >,
+    Type_mapper< std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >,
                  K1, K2 >::type
-    operator()(const boost::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const {
+    operator()(const std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const {
       typedef typename
-        Type_mapper< boost::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >,
+        Type_mapper< std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >,
                      K1, K2 >::type result_type;
       result_type res;
       if(!o) {
diff --git a/Circulator/include/CGAL/Circulator/Safe_circulator_from_iterator.h b/Circulator/include/CGAL/Circulator/Safe_circulator_from_iterator.h
index 17b05f8cffbf..f1642bce862b 100644
--- a/Circulator/include/CGAL/Circulator/Safe_circulator_from_iterator.h
+++ b/Circulator/include/CGAL/Circulator/Safe_circulator_from_iterator.h
@@ -22,7 +22,7 @@
 
 #include <CGAL/circulator.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <CGAL/use.h>
 
@@ -53,9 +53,9 @@ class Safe_circulator_from_iterator {
 
 private:
 
-    boost::optional<I> m_begin;
-    boost::optional<I> m_end;
-    boost::optional<I> m_current;
+    std::optional<I> m_begin;
+    std::optional<I> m_end;
+    std::optional<I> m_current;
     bool m_empty;
 
 public:
diff --git a/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h b/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
index 2c1bb1949516..9ba9d483d825 100644
--- a/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
+++ b/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
@@ -26,6 +26,6 @@ Halfspaces are considered as lower halfspaces, that is if the plane equation is
 template <class PlaneIterator, class PolygonMesh>
 void halfspace_intersection_3 (PlaneIterator begin, PlaneIterator end,
                                PolygonMesh &pm,
-                               boost::optional<Kernel_traits<std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3> > origin = boost::none);
+                               std::optional<Kernel_traits<std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3> > origin = std::nullopt);
 
 } /* namespace CGAL */
diff --git a/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_3/dual/halfspace_intersection_with_constructions_3.h b/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_3/dual/halfspace_intersection_with_constructions_3.h
index a234d1905caa..76cd8dff9f3e 100644
--- a/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_3/dual/halfspace_intersection_with_constructions_3.h
+++ b/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_3/dual/halfspace_intersection_with_constructions_3.h
@@ -25,7 +25,7 @@ template <class PlaneIterator, class PolygonMesh, class Traits>
 void halfspace_intersection_with_constructions_3(PlaneIterator pbegin,
                                                  PlaneIterator pend,
                                                  PolygonMesh &pm,
-                                                 boost::optional<Kernel_traits<std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3> > origin = boost::none,
+                                                 std::optional<Kernel_traits<std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3> > origin = std::nullopt,
                                                  const Traits & ch_traits = Default_traits);
 
 } /* namespace CGAL */
diff --git a/Convex_hull_3/examples/Convex_hull_3/lloyd_algorithm.cpp b/Convex_hull_3/examples/Convex_hull_3/lloyd_algorithm.cpp
index 4976b5e4a045..75d8847375d4 100644
--- a/Convex_hull_3/examples/Convex_hull_3/lloyd_algorithm.cpp
+++ b/Convex_hull_3/examples/Convex_hull_3/lloyd_algorithm.cpp
@@ -170,7 +170,7 @@ void lloyd_algorithm (PolyIterator poly_begin,
         CGAL::halfspace_intersection_3(planes.begin(),
                                        planes.end(),
                                        P,
-                                       boost::make_optional(vit->point()));
+                                       std::make_optional(vit->point()));
 
         // Centroid
         apply_function_object_polyhedron(P, centroid_acc);
diff --git a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
index 16a685e08ddf..7a1921c698d9 100644
--- a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
+++ b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
@@ -67,7 +67,7 @@ namespace CGAL
               // Typedefs for intersection
               typedef typename Kernel::Plane_3 Plane_3;
               typedef typename Kernel::Line_3 Line_3;
-              typedef boost::optional< boost::variant< Point_3,
+              typedef std::optional< boost::variant< Point_3,
                                                        Line_3,
                                                        Plane_3 > > result_inter;
 
@@ -228,7 +228,7 @@ namespace CGAL
     template <class PlaneIterator, class Polyhedron>
     void halfspace_intersection_3 (PlaneIterator begin, PlaneIterator end,
                                    Polyhedron &P,
-                                   boost::optional<typename Kernel_traits<typename std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3> origin = boost::none) {
+                                   std::optional<typename Kernel_traits<typename std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3> origin = std::nullopt) {
         // Checks whether the intersection is a polyhedron
         CGAL_assertion_msg(Convex_hull_3::internal::is_intersection_dim_3(begin, end), "halfspace_intersection_3: intersection not a polyhedron");
 
@@ -242,8 +242,8 @@ namespace CGAL
           // find a point inside the intersection
           origin = halfspace_intersection_interior_point_3(begin, end);
 
-          CGAL_assertion_msg(origin!=boost::none, "halfspace_intersection_3: problem when determining a point inside the intersection");
-          if (origin==boost::none)
+          CGAL_assertion_msg(origin!=std::nullopt, "halfspace_intersection_3: problem when determining a point inside the intersection");
+          if (origin==std::nullopt)
             return;
         }
 
@@ -273,7 +273,7 @@ namespace CGAL
   void halfspace_intersection_3 (PlaneIterator begin, PlaneIterator end,
                                  Polyhedron &P,
                                  typename Kernel_traits<typename std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3 const& origin) {
-    halfspace_intersection_3(begin, end , P, boost::make_optional(origin));
+    halfspace_intersection_3(begin, end , P, std::make_optional(origin));
   }
   #endif
 } // namespace CGAL
diff --git a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_interior_point_3.h b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_interior_point_3.h
index afdab1fdee08..db5b53247ab4 100644
--- a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_interior_point_3.h
+++ b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_interior_point_3.h
@@ -165,7 +165,7 @@ class Interior_polyhedron_3 {
 \ingroup PkgConvexHull3Functions
 
 computes a point belonging to the intersection of the halfspaces defined by the planes contained in the range `[begin, end)`.
-If the intersection is empty, `boost::none` is returned.
+If the intersection is empty, `std::nullopt` is returned.
 
 \attention Halfspaces are considered as lower halfspaces that is to say if the plane's equation
 is \f$ a\, x +b\, y +c\, z + d = 0 \f$ then the corresponding halfspace is defined by \f$ a\, x +b\, y +c\, z + d \le 0 \f$ .
@@ -173,7 +173,7 @@ is \f$ a\, x +b\, y +c\, z + d = 0 \f$ then the corresponding halfspace is defin
 \tparam PlaneIterator must be an input iterator with the value type being a `Plane_3` object from \cgal Kernel
 */
 template <class PlaneIterator>
-boost::optional<typename Kernel_traits<typename std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3>
+std::optional<typename Kernel_traits<typename std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3>
 halfspace_intersection_interior_point_3(PlaneIterator begin, PlaneIterator end)
 {
   // Types
@@ -185,9 +185,9 @@ halfspace_intersection_interior_point_3(PlaneIterator begin, PlaneIterator end)
   // find a point inside the intersection
   internal::Interior_polyhedron_3<K, ET> interior;
   if (!interior.find(begin, end))
-    return boost::none;
+    return std::nullopt;
 
-  return boost::make_optional(interior.inside_point());
+  return std::make_optional(interior.inside_point());
 }
 
 } // namespace CGAL
diff --git a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_with_constructions_3.h b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_with_constructions_3.h
index 4a0b9c26d449..d8946af7353c 100644
--- a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_with_constructions_3.h
+++ b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_with_constructions_3.h
@@ -90,7 +90,7 @@ namespace CGAL
           void halfspace_intersection_with_constructions_3(PlaneIterator pbegin,
                                                            PlaneIterator pend,
                                                            Polyhedron &P,
-                                                           boost::optional<typename Kernel_traits<typename std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3> origin,
+                                                           std::optional<typename Kernel_traits<typename std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3> origin,
                                                            const Traits & ch_traits) {
           typedef typename Kernel_traits<typename std::iterator_traits<PlaneIterator>::value_type>::Kernel K;
           typedef typename K::Point_3 Point;
@@ -101,8 +101,8 @@ namespace CGAL
             // find a point inside the intersection
             origin = halfspace_intersection_interior_point_3(pbegin, pend);
 
-            CGAL_assertion_msg(origin!=boost::none, "halfspace_intersection_with_constructions_3: problem when determining a point inside the intersection");
-            if (origin==boost::none)
+            CGAL_assertion_msg(origin!=std::nullopt, "halfspace_intersection_with_constructions_3: problem when determining a point inside the intersection");
+            if (origin==std::nullopt)
               return;
           }
 
@@ -134,7 +134,7 @@ namespace CGAL
           void halfspace_intersection_with_constructions_3 (PlaneIterator pbegin,
                                                             PlaneIterator pend,
                                                             Polyhedron &P,
-                                                            boost::optional<typename Kernel_traits<typename std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3> const& origin = boost::none) {
+                                                            std::optional<typename Kernel_traits<typename std::iterator_traits<PlaneIterator>::value_type>::Kernel::Point_3> const& origin = std::nullopt) {
           typedef typename Kernel_traits<typename std::iterator_traits<PlaneIterator>::value_type>::Kernel K;
           typedef typename K::Point_3 Point_3;
           typedef typename Convex_hull_3::internal::Default_traits_for_Chull_3<Point_3>::type Traits;
diff --git a/Convex_hull_3/test/Convex_hull_3/test_halfspace_intersections.cpp b/Convex_hull_3/test/Convex_hull_3/test_halfspace_intersections.cpp
index a0eef18da7f8..686a2b8c7176 100644
--- a/Convex_hull_3/test/Convex_hull_3/test_halfspace_intersections.cpp
+++ b/Convex_hull_3/test/Convex_hull_3/test_halfspace_intersections.cpp
@@ -32,7 +32,7 @@ void test()
   CGAL::halfspace_intersection_3(planes.begin(),
                                  planes.end(),
                                  P1,
-                                 boost::make_optional(Point(0, 0, 0)) );
+                                 std::make_optional(Point(0, 0, 0)) );
 
   // test halfspace_intersection_3 with non point inside
   CGAL::halfspace_intersection_3(planes.begin(),
@@ -43,7 +43,7 @@ void test()
   CGAL::halfspace_intersection_with_constructions_3( planes.begin(),
                                                      planes.end(),
                                                      P3,
-                                                     boost::make_optional(Point(0, 0, 0)) );
+                                                     std::make_optional(Point(0, 0, 0)) );
 
   // test halfspace_intersection_with_constructions_3 with non point inside
   CGAL::halfspace_intersection_with_constructions_3( planes.begin(),
@@ -54,7 +54,7 @@ void test()
   CGAL::halfspace_intersection_with_constructions_3( planes.begin(),
                                                      planes.end(),
                                                      P5,
-                                                     boost::optional<Point>(),
+                                                     std::optional<Point>(),
                                                      K());
 
   assert(num_vertices(P1)==8 && num_faces(P1)==6);
diff --git a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h
index fc2f04a27ecc..433a6a4949c0 100644
--- a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h
+++ b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h
@@ -18,7 +18,7 @@
 #include <CGAL/Arr_enums.h>
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <vector>
 
diff --git a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h
index 9503e338311b..af0f793f4eda 100644
--- a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h
+++ b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h
@@ -19,7 +19,7 @@
  * Definitions of the functions of the Envelope_divide_and_conquer_2 class.
  */
 
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 
@@ -610,8 +610,8 @@ _merge_two_intervals(Edge_const_handle e1, bool is_leftmost1,
   // The intersection points/curves that interest us are the ones in
   // [v_leftmost, v].
   // Without using make_optional we get a "maybe uninitialized" warning with gcc -Wall
-  boost::optional<Vertex_const_handle>  v_leftmost =
-    boost::make_optional(false, Vertex_const_handle());
+  std::optional<Vertex_const_handle>  v_leftmost =
+    std::make_optional(false, Vertex_const_handle());
 
   if (is_leftmost1 == true) {
     if (is_leftmost2 == false)
diff --git a/Filtered_kernel/include/CGAL/Filtered_predicate_with_state.h b/Filtered_kernel/include/CGAL/Filtered_predicate_with_state.h
index c0b2e2179caf..991fe8247b56 100644
--- a/Filtered_kernel/include/CGAL/Filtered_predicate_with_state.h
+++ b/Filtered_kernel/include/CGAL/Filtered_predicate_with_state.h
@@ -18,7 +18,7 @@
 #include <CGAL/Interval_nt.h>
 #include <CGAL/Uncertain.h>
 #include <CGAL/Profile_counter.h>
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 
@@ -31,7 +31,7 @@ class Filtered_predicate_with_state
   C2E c2e;
   C2A c2a;
   O1  o1;
-  mutable boost::optional<EP>  oep;
+  mutable std::optional<EP>  oep;
   AP  ap;
   typedef typename AP::result_type  Ares;
 
diff --git a/Filtered_kernel/include/CGAL/Lazy.h b/Filtered_kernel/include/CGAL/Lazy.h
index e7024f6220b8..c9ff97618c31 100644
--- a/Filtered_kernel/include/CGAL/Lazy.h
+++ b/Filtered_kernel/include/CGAL/Lazy.h
@@ -30,7 +30,7 @@
 #include <CGAL/type_traits/is_iterator.h>
 #include <CGAL/transforming_iterator.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/variant.hpp>
 #ifdef CGAL_LAZY_KERNEL_DEBUG
 #  include <boost/optional/optional_io.hpp>
@@ -1196,7 +1196,7 @@ struct Lazy_construction_optional_for_polygonal_envelope
   typedef typename LK::Approximate_kernel AK;
   typedef typename LK::Exact_kernel EK;
   typedef typename LK::E2A E2A;
-  typedef boost::optional<typename LK::Point_3> result_type;
+  typedef std::optional<typename LK::Point_3> result_type;
 
   CGAL_NO_UNIQUE_ADDRESS AC ac;
   CGAL_NO_UNIQUE_ADDRESS EC ec;
@@ -1209,9 +1209,9 @@ struct Lazy_construction_optional_for_polygonal_envelope
     {
       Protect_FPU_rounding<Protection> P;
       try {
-        boost::optional<typename AK::Point_3> oap = ac(CGAL::approx(l1),CGAL::approx(l2),CGAL::approx(l3));
-        if(oap == boost::none){
-          return boost::none;
+        std::optional<typename AK::Point_3> oap = ac(CGAL::approx(l1),CGAL::approx(l2),CGAL::approx(l3));
+        if(oap == std::nullopt){
+          return std::nullopt;
         }
         // Now we have to construct a rep for a lazy point with the three lazy planes.
         typedef Lazy_rep_optional_n<typename AK::Point_3, typename EK::Point_3, AC, EC, E2A, L1, L1, L1> LazyPointRep;
@@ -1221,21 +1221,21 @@ struct Lazy_construction_optional_for_polygonal_envelope
         // rep = LazyPointRep(2,ap, ec, l1, l2, l3);
         rep.~LazyPointRep(); new (&rep) LazyPointRep(2, ap, ec, l1, l2, l3);
         typename LK::Point_3 lp(&rep);
-        return boost::make_optional(lp);
+        return std::make_optional(lp);
 
       } catch (Uncertain_conversion_exception&) {}
     }
     Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
     CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    boost::optional<typename EK::Point_3> oep = ec(CGAL::exact(l1), CGAL::exact(l2), CGAL::exact(l3));
-    if(oep == boost::none){
-      return boost::none;
+    std::optional<typename EK::Point_3> oep = ec(CGAL::exact(l1), CGAL::exact(l2), CGAL::exact(l3));
+    if(oep == std::nullopt){
+      return std::nullopt;
     }
     typedef Lazy_rep_0<typename AK::Point_3, typename EK::Point_3, E2A> LazyPointRep;
     const typename EK::Point_3 ep = *oep;
     LazyPointRep *rep = new LazyPointRep(ep);
     typename LK::Point_3 lp(rep);
-    return boost::make_optional(lp);
+    return std::make_optional(lp);
   }
 
   // for Intersect_point_3 with  Plane_3  Line_3
@@ -1246,9 +1246,9 @@ struct Lazy_construction_optional_for_polygonal_envelope
     {
       Protect_FPU_rounding<Protection> P;
       try {
-        boost::optional<typename AK::Point_3> oap = ac(CGAL::approx(l1),CGAL::approx(l2));
-        if(oap == boost::none){
-          return boost::none;
+        std::optional<typename AK::Point_3> oap = ac(CGAL::approx(l1),CGAL::approx(l2));
+        if(oap == std::nullopt){
+          return std::nullopt;
         }
         // Now we have to construct a rep for a lazy point with the line and the plane.
         typedef Lazy_rep_optional_n<typename AK::Point_3, typename EK::Point_3, AC, EC, E2A, L1, L2> LazyPointRep;
@@ -1258,21 +1258,21 @@ struct Lazy_construction_optional_for_polygonal_envelope
         // rep = LazyPointRep(2, ap, ec, l1, l2);
         rep.~LazyPointRep(); new (&rep) LazyPointRep(2, ap, ec, l1, l2);
         typename LK::Point_3 lp(&rep);
-        return boost::make_optional(lp);
+        return std::make_optional(lp);
 
       } catch (Uncertain_conversion_exception&) {}
     }
     Protect_FPU_rounding<!Protection> P2(CGAL_FE_TONEAREST);
     CGAL_expensive_assertion(FPU_get_cw() == CGAL_FE_TONEAREST);
-    boost::optional<typename EK::Point_3> oep = ec(CGAL::exact(l1), CGAL::exact(l2));
-    if(oep == boost::none){
-      return boost::none;
+    std::optional<typename EK::Point_3> oep = ec(CGAL::exact(l1), CGAL::exact(l2));
+    if(oep == std::nullopt){
+      return std::nullopt;
     }
     typedef Lazy_rep_0<typename AK::Point_3, typename EK::Point_3, E2A> LazyPointRep;
     const typename EK::Point_3 ep = *oep;
     LazyPointRep *rep = new LazyPointRep(ep);
     typename LK::Point_3 lp(rep);
-    return boost::make_optional(lp);
+    return std::make_optional(lp);
   }
 };
 
@@ -1427,7 +1427,7 @@ struct Ith_for_intersection_with_variant {
 
   template< BOOST_VARIANT_ENUM_PARAMS(typename U) >
   const T2&
-  operator()(const boost::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const
+  operator()(const std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const
   {
     const std::vector<T2>* ptr = (boost::get<std::vector<T2> >(&(*o)));
     return (*ptr)[i];
@@ -1858,7 +1858,7 @@ struct Variant_cast {
 
   template<BOOST_VARIANT_ENUM_PARAMS(typename U)>
   const T&
-  operator()(const boost::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const {
+  operator()(const std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const {
     // can throw but should never because we always build it inside
     // a static visitor with the right type
     return boost::get<T>(*o);
@@ -1866,7 +1866,7 @@ struct Variant_cast {
 
   template<BOOST_VARIANT_ENUM_PARAMS(typename U)>
   T&
-  operator()(boost::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const {
+  operator()(std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const {
     // can throw but should never because we always build it inside
     // a static visitor with the right type, if it throws bad_get
     return boost::get<T>(*o);
diff --git a/Filtered_kernel/include/CGAL/Lazy_kernel.h b/Filtered_kernel/include/CGAL/Lazy_kernel.h
index 08a6ebb41a0a..6979b6f7b0cf 100644
--- a/Filtered_kernel/include/CGAL/Lazy_kernel.h
+++ b/Filtered_kernel/include/CGAL/Lazy_kernel.h
@@ -178,7 +178,7 @@ class Lazy_kernel_generic_base : protected internal::Enum_holder
   // The case distinction goes as follows:
   // result_type == FT                              => NT
   // result_type == Object                          => Object
-  // result_type == boost::optional                 => OPTIONAL_    Only for Intersect_point_3_for_polyhedral_envelope which returns a handle for a singleton
+  // result_type == std::optional                 => OPTIONAL_    Only for Intersect_point_3_for_polyhedral_envelope which returns a handle for a singleton
   // result_type == Bbox_2 || result_type == Bbox_3 => BBOX
   // default                                        => NONE
   // no result_type                                 => NONE
@@ -188,7 +188,7 @@ class Lazy_kernel_generic_base : protected internal::Enum_holder
   // specializations inside a non-namespace scope.
   // The default implementation does some default handling,
   // the special cases are filtered by partial specializations.
-  template <typename Construction, typename Dummy = boost::none_t>
+  template <typename Construction, typename Dummy = std::nullopt_t>
   struct Lazy_wrapper_traits :
     boost::mpl::eval_if< internal::Has_result_type<Construction>,
                          boost::mpl::eval_if< std::is_same< typename boost::remove_cv<
diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 486f43ea21f7..386d2a272020 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -11,6 +11,7 @@ Release date: October 2023
 - **Breaking change**: C++17 is now required
 - Support for Visual `C++` 14.0 (Visual studio 2015) is dropped.
 - **Breaking change**: The usage of `boost::shared_ptr` has been replaced by `std::shared_ptr`. Packages affected are 2D Straight Line Skeleton and Shape Detection.
+- **Breaking change**: The usage of `boost::optional` has been replaced by `std::optional`. Packages affected are 2D Straight Line Skeleton, 3D Fast Intersection and Distance Computation (AABB Tree), and the Kernel intersection.
 
 
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
diff --git a/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp b/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp
index 11416d859b79..a7765e4b3c1d 100644
--- a/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp
+++ b/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp
@@ -11,7 +11,7 @@
 #include <functional>
 
 #include <boost/variant.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/any.hpp>
 #include <boost/timer.hpp>
 #include <boost/lexical_cast.hpp>
@@ -27,7 +27,7 @@ struct Intersection_traits;
 template<typename K>
 struct Intersection_traits<K, typename K::Segment_2, typename K::Segment_2> {
   typedef typename boost::variant<typename K::Segment_2, typename K::Point_2 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 
@@ -53,7 +53,7 @@ OutputIterator intersect_do_iterator(const typename K::Segment_2 &seg1,
 
 
 template <class K>
-boost::optional<
+std::optional<
   boost::variant<typename K::Segment_2, typename K::Point_2>
   >
 intersection_variant(const typename K::Segment_2 &seg1,
@@ -63,7 +63,7 @@ intersection_variant(const typename K::Segment_2 &seg1,
   typedef CGAL::internal::Segment_2_Segment_2_pair<K> is_t;
 
   typedef boost::variant<typename K::Segment_2, typename K::Point_2> Variant;
-  typedef boost::optional<Variant> OptVariant;
+  typedef std::optional<Variant> OptVariant;
 
   is_t ispair(&seg1, &seg2);
   switch (ispair.intersection_type()) {
diff --git a/Intersections_2/include/CGAL/Intersection_traits.h b/Intersections_2/include/CGAL/Intersection_traits.h
index 3bfb327db9e6..ca313a2c8524 100644
--- a/Intersections_2/include/CGAL/Intersection_traits.h
+++ b/Intersections_2/include/CGAL/Intersection_traits.h
@@ -27,7 +27,7 @@
   struct Intersection_traits<K, typename K::A, typename K::B>  { \
     typedef typename boost::variant<typename K::R1, typename K::R2 >    \
                      variant_type;                                      \
-    typedef typename boost::optional< variant_type > result_type;       \
+    typedef typename std::optional< variant_type > result_type;       \
   };
 
 #define CGAL_INTERSECTION_TRAITS_3(A, B, R1, R2, R3)            \
@@ -35,7 +35,7 @@
   struct Intersection_traits<K, typename K::A, typename K::B>  { \
     typedef typename boost::variant<typename K::R1, typename K::R2,     \
                                     typename K::R3> variant_type;       \
-    typedef typename boost::optional< variant_type > result_type;       \
+    typedef typename std::optional< variant_type > result_type;       \
   };
 
 #define CGAL_INTERSECTION_FUNCTION(A, B, DIM)                           \
@@ -120,7 +120,7 @@ const T* intersect_get(const CGAL::Object& o) {
 
 template<typename T, BOOST_VARIANT_ENUM_PARAMS(typename U)>
 inline
-const T* intersect_get(const boost::optional< boost::variant<BOOST_VARIANT_ENUM_PARAMS(U)> >& v) {
+const T* intersect_get(const std::optional< boost::variant<BOOST_VARIANT_ENUM_PARAMS(U)> >& v) {
   return boost::get<T>(&*v);
 }
 
diff --git a/Intersections_2/include/CGAL/Intersection_traits_2.h b/Intersections_2/include/CGAL/Intersection_traits_2.h
index 921405c27f96..df4d10a6c2a6 100644
--- a/Intersections_2/include/CGAL/Intersection_traits_2.h
+++ b/Intersections_2/include/CGAL/Intersection_traits_2.h
@@ -17,7 +17,7 @@
 #include <CGAL/Bbox_2.h>
 
 #include <boost/variant.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <vector>
 
 namespace CGAL {
@@ -51,7 +51,7 @@ struct Intersection_traits<K, typename K::Triangle_2, typename K::Triangle_2>  {
   typedef typename
   boost::variant< typename K::Point_2, typename K::Segment_2,
                   typename K::Triangle_2, typename std::vector< typename K::Point_2 > > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 
@@ -70,7 +70,7 @@ CGAL_INTERSECTION_TRAITS_2(Ray_2, Iso_rectangle_2, Point_2, Segment_2)
 template<typename K>
 struct Intersection_traits<K, typename K::Iso_rectangle_2, typename K::Iso_rectangle_2>  {
   typedef typename boost::variant<typename K::Iso_rectangle_2> variant_type;
-  typedef boost::optional<variant_type> result_type;
+  typedef std::optional<variant_type> result_type;
 };
 
 
@@ -78,19 +78,19 @@ struct Intersection_traits<K, typename K::Iso_rectangle_2, typename K::Iso_recta
 template<typename K, typename B>
 struct Intersection_traits<K, typename K::Point_2, B> {
   typedef typename boost::variant<typename K::Point_2> variant_type;
-  typedef boost::optional<variant_type> result_type;
+  typedef std::optional<variant_type> result_type;
 };
 
 template<typename K, typename A>
 struct Intersection_traits<K, A, typename K::Point_2> {
   typedef typename boost::variant<typename K::Point_2> variant_type;
-  typedef boost::optional<variant_type> result_type;
+  typedef std::optional<variant_type> result_type;
 };
 
 template<typename K>
 struct Intersection_traits<K, typename K::Point_2, typename K::Point_2> {
   typedef typename boost::variant<typename K::Point_2> variant_type;
-  typedef boost::optional<variant_type> result_type;
+  typedef std::optional<variant_type> result_type;
 };
 
 template<typename K>
@@ -99,7 +99,7 @@ struct Intersection_traits<K, typename K::Iso_rectangle_2, typename K::Triangle_
   typedef typename boost::variant<typename K::Segment_2, typename K::Triangle_2,
                                   typename K::Point_2,
                                   typename std::vector< typename K::Point_2 > > variant_type;
-  typedef typename boost::optional < variant_type > result_type;
+  typedef typename std::optional < variant_type > result_type;
 };
 
 template<typename K>
@@ -119,13 +119,13 @@ struct Intersection_traits<K, A, CGAL::Bbox_2>  {
 template<typename K>
 struct Intersection_traits<K, CGAL::Bbox_2, typename K::Point_2>  {
   typedef typename boost::variant<typename K::Point_2> variant_type;
-  typedef boost::optional<variant_type> result_type;
+  typedef std::optional<variant_type> result_type;
 };
 
 template<typename K>
 struct Intersection_traits<K, typename K::Point_2, CGAL::Bbox_2>  {
   typedef typename boost::variant<typename K::Point_2> variant_type;
-  typedef boost::optional<variant_type> result_type;
+  typedef std::optional<variant_type> result_type;
 };
 
 } // namespace CGAL
diff --git a/Intersections_2/include/CGAL/Intersections_2/Bbox_2_Bbox_2.h b/Intersections_2/include/CGAL/Intersections_2/Bbox_2_Bbox_2.h
index 9b75f968c2ee..4081086aa1c5 100644
--- a/Intersections_2/include/CGAL/Intersections_2/Bbox_2_Bbox_2.h
+++ b/Intersections_2/include/CGAL/Intersections_2/Bbox_2_Bbox_2.h
@@ -25,13 +25,13 @@ do_intersect(const CGAL::Bbox_2& c,
   return CGAL::do_overlap(c, bbox);
 }
 
-typename boost::optional< typename boost::variant<Bbox_2> >
+typename std::optional< typename boost::variant<Bbox_2> >
 inline
 intersection(const CGAL::Bbox_2& a,
              const CGAL::Bbox_2& b)
 {
   typedef typename boost::variant<Bbox_2> variant_type;
-  typedef typename boost::optional<variant_type> result_type;
+  typedef typename std::optional<variant_type> result_type;
 
   if(!do_intersect(a, b))
     return result_type();
diff --git a/Intersections_3/include/CGAL/Intersection_traits_3.h b/Intersections_3/include/CGAL/Intersection_traits_3.h
index 85287e8c044e..a72f5cac9231 100644
--- a/Intersections_3/include/CGAL/Intersection_traits_3.h
+++ b/Intersections_3/include/CGAL/Intersection_traits_3.h
@@ -22,7 +22,7 @@
 #include <CGAL/Intersection_traits.h>
 #include <CGAL/Bbox_3.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/variant.hpp>
 
 #include <vector>
@@ -86,7 +86,7 @@ struct Intersection_traits<K, typename K::Triangle_3, typename K::Triangle_3>  {
   typedef typename
   boost::variant< typename K::Point_3, typename K::Segment_3, typename K::Triangle_3,
                   typename std::vector< typename K::Point_3 > > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 
@@ -109,7 +109,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Iso_cuboid_3>  {
   typedef typename
   boost::variant< typename K::Iso_cuboid_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 
@@ -119,7 +119,7 @@ template<typename K>
 struct Intersection_traits<K, CGAL::Bbox_3, typename K::Line_3>  {
   typedef typename
   boost::variant< typename K::Segment_3, typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 template<typename K>
@@ -149,7 +149,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Iso_cuboid_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Bbox_3 Point_3, variant of one
@@ -157,14 +157,14 @@ template<typename K>
 struct Intersection_traits<K, Bbox_3, typename K::Point_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
   template<typename K>
 struct Intersection_traits<K, typename K::Point_3, Bbox_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 
@@ -173,7 +173,7 @@ template<typename K>
 struct Intersection_traits<K, CGAL::Bbox_3, typename K::Iso_cuboid_3>  {
   typedef typename
   boost::variant<  typename K::Iso_cuboid_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 template<typename K>
@@ -185,7 +185,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Point_3>  {
   typedef typename
     boost::variant< typename K::Point_3 > variant_type;
-    typedef typename boost::optional< variant_type > result_type;
+    typedef typename std::optional< variant_type > result_type;
 };
 
 // Iso_cuboid_3 Plane_3, variant of 4
@@ -195,7 +195,7 @@ struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Plane_3>  {
   boost::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 template<typename K>
@@ -204,7 +204,7 @@ struct Intersection_traits<K, typename K::Plane_3, typename K::Iso_cuboid_3>  {
   boost::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Iso_cuboid_3 Triangle_3, variant of 4
@@ -214,7 +214,7 @@ struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Triangle_3>
   boost::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 template<typename K>
@@ -223,7 +223,7 @@ struct Intersection_traits<K, typename K::Triangle_3, typename K::Iso_cuboid_3>
   boost::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Bbox_3 Plane_3, variant of 4
@@ -233,7 +233,7 @@ struct Intersection_traits<K, typename CGAL::Bbox_3, typename K::Plane_3>  {
   boost::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 template<typename K>
@@ -242,7 +242,7 @@ struct Intersection_traits<K, typename K::Plane_3, typename CGAL::Bbox_3>  {
   boost::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Bbox_3 Triangle_3, variant of 4
@@ -252,7 +252,7 @@ struct Intersection_traits<K, typename CGAL::Bbox_3, typename K::Triangle_3>  {
   boost::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 template<typename K>
@@ -261,7 +261,7 @@ struct Intersection_traits<K, typename K::Triangle_3, typename CGAL::Bbox_3>  {
   boost::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Point_3 Line_3, variant of one
@@ -269,7 +269,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Line_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Line_3 Point_3, variant of one
@@ -277,7 +277,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Line_3, typename K::Point_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Point_3 Ray_3, variant of one
@@ -285,7 +285,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Ray_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Ray_3 Point_3, variant of one
@@ -293,7 +293,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Ray_3, typename K::Point_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Point_3 Segment_3, variant of one
@@ -301,7 +301,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Segment_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Segment_3 Point_3, variant of one
@@ -309,7 +309,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Segment_3, typename K::Point_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Point_3 Point_3, variant of one
@@ -317,7 +317,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Point_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Point_3 Plane_3, variant of one
@@ -325,7 +325,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Plane_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Plane_3 Point_3, variant of one
@@ -333,7 +333,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Plane_3, typename K::Point_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Point_3 Triangle_3, variant of one
@@ -341,7 +341,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Triangle_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Triangle_3 Point_3, variant of one
@@ -349,7 +349,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Triangle_3, typename K::Point_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Point_3 Tetrahedron_3, variant of one
@@ -357,7 +357,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Tetrahedron_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Tetrahedron_3 Point_3, variant of one
@@ -365,7 +365,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Tetrahedron_3, typename K::Point_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Point_3 Sphere_3, variant of one
@@ -373,7 +373,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Sphere_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Sphere_3 Point_3, variant of one
@@ -381,7 +381,7 @@ template<typename K>
 struct Intersection_traits<K, typename K::Sphere_3, typename K::Point_3>  {
   typedef typename
   boost::variant< typename K::Point_3 > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 //Tetrahedron_3 Plane_3, variant of 4
@@ -391,7 +391,7 @@ struct Intersection_traits<K, typename K::Tetrahedron_3, typename K::Plane_3>
   typedef typename
   boost::variant< typename K::Point_3 , typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 //Plane_3 Tetrahedron_3, variant of 4
@@ -401,7 +401,7 @@ struct Intersection_traits<K, typename K::Plane_3,typename K::Tetrahedron_3>
   typedef typename
   boost::variant< typename K::Point_3 , typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 //Triangle_3 Tetrahedron_3, variant of 4
@@ -411,7 +411,7 @@ struct Intersection_traits<K, typename K::Triangle_3,typename K::Tetrahedron_3>
   typedef typename
   boost::variant< typename K::Point_3 , typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 // Tetrahedron_3 Triangle_3, variant of 4
@@ -421,7 +421,7 @@ struct Intersection_traits<K, typename K::Tetrahedron_3,typename K::Triangle_3>
   typedef typename
   boost::variant< typename K::Point_3 , typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
-  typedef typename boost::optional< variant_type > result_type;
+  typedef typename std::optional< variant_type > result_type;
 };
 
 
diff --git a/Intersections_3/include/CGAL/Intersections_3/Bbox_3_Bbox_3.h b/Intersections_3/include/CGAL/Intersections_3/Bbox_3_Bbox_3.h
index bb244628c5ae..44af7d691c05 100644
--- a/Intersections_3/include/CGAL/Intersections_3/Bbox_3_Bbox_3.h
+++ b/Intersections_3/include/CGAL/Intersections_3/Bbox_3_Bbox_3.h
@@ -24,7 +24,7 @@
 
 #include <CGAL/Bbox_3.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/variant.hpp>
 
 #include <utility>
@@ -39,13 +39,13 @@ do_intersect(const CGAL::Bbox_3& c,
   return CGAL::do_overlap(c, bbox);
 }
 
-typename boost::optional< typename boost::variant< Bbox_3> >
+typename std::optional< typename boost::variant< Bbox_3> >
 inline
 intersection(const CGAL::Bbox_3& a,
              const CGAL::Bbox_3& b)
 {
   typedef typename boost::variant<Bbox_3> variant_type;
-  typedef typename boost::optional<variant_type> result_type;
+  typedef typename std::optional<variant_type> result_type;
 
   if(!do_intersect(a,b))
     return result_type();
diff --git a/Intersections_3/include/CGAL/Intersections_3/Line_3_Plane_3.h b/Intersections_3/include/CGAL/Intersections_3/Line_3_Plane_3.h
index ec3806b41f7a..5689ce58935b 100644
--- a/Intersections_3/include/CGAL/Intersections_3/Line_3_Plane_3.h
+++ b/Intersections_3/include/CGAL/Intersections_3/Line_3_Plane_3.h
@@ -27,7 +27,7 @@
 #include <CGAL/Line_3.h>
 #include <CGAL/Plane_3.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 
@@ -36,7 +36,7 @@ CGAL_INTERSECTION_FUNCTION(Line_3, Plane_3, 3)
 
 template <class K>
 inline
-boost::optional<typename K::Point_3>
+std::optional<typename K::Point_3>
 intersection_point_for_polyhedral_envelope(const Plane_3<K>& plane,
                                            const Line_3<K>& line)
 {
@@ -45,7 +45,7 @@ intersection_point_for_polyhedral_envelope(const Plane_3<K>& plane,
 
 template <class K>
 inline
-boost::optional<typename K::Point_3>
+std::optional<typename K::Point_3>
 intersection_point_for_polyhedral_envelope(const Line_3<K>& line,
                                            const Plane_3<K>& plane)
 {
diff --git a/Intersections_3/include/CGAL/Intersections_3/Plane_3_Plane_3_Plane_3.h b/Intersections_3/include/CGAL/Intersections_3/Plane_3_Plane_3_Plane_3.h
index 3030089906c7..9d7351039ffc 100644
--- a/Intersections_3/include/CGAL/Intersections_3/Plane_3_Plane_3_Plane_3.h
+++ b/Intersections_3/include/CGAL/Intersections_3/Plane_3_Plane_3_Plane_3.h
@@ -52,7 +52,7 @@ intersection(const Plane_3<K>& plane1,
 
 template <class K>
 inline
-boost::optional<typename K::Point_3>
+std::optional<typename K::Point_3>
 intersection_point_for_polyhedral_envelope(const Plane_3<K>& p0,
                                            const Plane_3<K>& p1,
                                            const Plane_3<K>& p2)
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_intersection.h
index a82d17dd7597..df219948c4ef 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_intersection.h
@@ -22,7 +22,7 @@
 #include <CGAL/Bbox_3.h>
 #include <CGAL/number_utils.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/variant.hpp>
 
 namespace CGAL {
@@ -34,7 +34,7 @@ namespace internal {
 // But it must be a template function since the original kernel must be
 // taken into account.
 template <class K>
-typename boost::optional< boost::variant<typename K::Segment_3, typename K::Point_3 > >
+typename std::optional< boost::variant<typename K::Segment_3, typename K::Point_3 > >
 intersection_bl(const Bbox_3& box,
                 double lpx, double lpy, double lpz,
                 double ldx, double ldy, double ldz,
@@ -45,7 +45,7 @@ intersection_bl(const Bbox_3& box,
   typedef typename K::Vector_3  Vector_3;
   typedef typename K::Segment_3 Segment_3;
 
-  typedef typename boost::optional<boost::variant< Segment_3, Point_3 > > result_type;
+  typedef typename std::optional<boost::variant< Segment_3, Point_3 > > result_type;
 
   double seg_min = 0.0, seg_max = 1.0;
   // first on x value
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Plane_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Plane_3_intersection.h
index b052243ff0c9..7349337fc848 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Plane_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Plane_3_intersection.h
@@ -180,7 +180,7 @@ intersection(const typename K::Iso_cuboid_3& cub,
   }
 
   if (all_in || all_out)
-    return boost::none;
+    return std::nullopt;
   if (start_id == -1)
     return { result_type(corners[solo_id]) };
 
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Line_3_Plane_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Line_3_Plane_3_intersection.h
index d14c119b56e5..737205703e32 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Line_3_Plane_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Line_3_Plane_3_intersection.h
@@ -24,7 +24,7 @@ namespace Intersections {
 namespace internal {
 
 template <class K>
-boost::optional<typename K::Point_3>
+std::optional<typename K::Point_3>
 intersection_point(const typename K::Plane_3& plane,
                    const typename K::Line_3& line,
                    const K& /*k*/)
@@ -41,9 +41,9 @@ intersection_point(const typename K::Plane_3& plane,
   RT den = plane.a()*line_dir.dx() + plane.b()*line_dir.dy()
            + plane.c()*line_dir.dz();
   if(den == 0)
-    return boost::none;
+    return std::nullopt;
 
-  return boost::make_optional(Point_3(den*line_pt.hx()-num*line_dir.dx(),
+  return std::make_optional(Point_3(den*line_pt.hx()-num*line_dir.dx(),
                                       den*line_pt.hy()-num*line_dir.dy(),
                                       den*line_pt.hz()-num*line_dir.dz(),
                                       wmult_hw((K*)0, den, line_pt)));
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Plane_3_Plane_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Plane_3_Plane_3_intersection.h
index be6ca11f0690..bdc881bf75aa 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Plane_3_Plane_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Plane_3_Plane_3_intersection.h
@@ -18,7 +18,7 @@
 #include <CGAL/Intersections_3/internal/Plane_3_Plane_3_intersection.h>
 #include <CGAL/Intersections_3/internal/Line_3_Plane_3_intersection.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/variant.hpp>
 
 namespace CGAL {
@@ -27,7 +27,7 @@ namespace internal {
 
 //  triple plane intersection
 template <class K>
-boost::optional<typename K::Point_3>
+std::optional<typename K::Point_3>
 intersection_point(const typename K::Plane_3& plane1,
                    const typename K::Plane_3& plane2,
                    const typename K::Plane_3& plane3,
@@ -56,7 +56,7 @@ intersection_point(const typename K::Plane_3& plane1,
   const FT den = minor_0*m22 - minor_1*m12 + minor_2*m02; // determinant of M
 
   if(is_zero(den)){
-    return boost::none;
+    return std::nullopt;
   }
 
   const FT num3 = minor_0*b2 - minor_1*b1 + minor_2*b0;  // determinant of M with M[x:2] swapped with [b0,b1,b2]
@@ -70,17 +70,17 @@ intersection_point(const typename K::Plane_3& plane1,
   const FT num1 = - minor_3*m21 + minor_4*m11 - minor_5*m01;  // determinant of M with M[x:0] swapped with [b0,b1,b2]
   const FT num2 = minor_3*m20 - minor_4*m10 + minor_5*m00;  // determinant of M with M[x:1] swapped with [b0,b1,b2]
 
-  return boost::make_optional(typename K::Point_3(num1/den, num2/den, num3/den));
+  return std::make_optional(typename K::Point_3(num1/den, num2/den, num3/den));
 }
 
 template <class K>
-boost::optional<boost::variant<typename K::Point_3, typename K::Line_3, typename K::Plane_3> >
+std::optional<boost::variant<typename K::Point_3, typename K::Line_3, typename K::Plane_3> >
 intersection(const typename K::Plane_3& plane1,
              const typename K::Plane_3& plane2,
              const typename K::Plane_3& plane3,
              const K& k)
 {
-  typedef typename boost::optional<boost::variant<typename K::Point_3,
+  typedef typename std::optional<boost::variant<typename K::Point_3,
                                                   typename K::Line_3,
                                                   typename K::Plane_3> > result_type;
 
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Tetrahedron_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Tetrahedron_3_intersection.h
index 37e092956d71..0a1afefb0ead 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Tetrahedron_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Tetrahedron_3_intersection.h
@@ -164,7 +164,7 @@ intersection(const typename K::Tetrahedron_3& tet,
   }
 
   if (all_in || all_out)
-    return boost::none;
+    return std::nullopt;
   if (start_id == -1)
     return { result_type(corners[solo_id]) };
 
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Ray_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Ray_3_Triangle_3_intersection.h
index 35983013bba4..5eeb8d85c8e0 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Ray_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Ray_3_Triangle_3_intersection.h
@@ -396,7 +396,7 @@ intersection_coplanar(const typename K::Triangle_3& t,
 
 template <class K>
 inline
-typename boost::optional<typename K::Point_3>
+typename std::optional<typename K::Point_3>
 t3r3_intersection_aux(const typename K::Triangle_3& t,
                       const typename K::Ray_3& r,
                       const K& k)
@@ -410,7 +410,7 @@ t3r3_intersection_aux(const typename K::Triangle_3& t,
       return *p;
   }
 
-  return boost::optional<typename K::Point_3>();
+  return std::optional<typename K::Point_3>();
 }
 
 template <class K>
@@ -455,7 +455,7 @@ intersection(const typename K::Triangle_3& t,
           if ( orientation(p,q,a,b) != POSITIVE
               && orientation(p,q,b,c) != POSITIVE
                && orientation(p,q,c,a) != POSITIVE ) {
-            boost::optional<Point_3> op = t3r3_intersection_aux(t,r,k);
+            std::optional<Point_3> op = t3r3_intersection_aux(t,r,k);
             if(op) return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Ray_3>(*op);
             else return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Ray_3>();
           }
@@ -476,7 +476,7 @@ intersection(const typename K::Triangle_3& t,
           if ( orientation(q,p,a,b) != POSITIVE
               && orientation(q,p,b,c) != POSITIVE
                && orientation(q,p,c,a) != POSITIVE ) {
-            boost::optional<Point_3> op = t3r3_intersection_aux(t,r,k);
+            std::optional<Point_3> op = t3r3_intersection_aux(t,r,k);
             if(op) return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Ray_3>(*op);
             else return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Ray_3>();
           }
@@ -502,7 +502,7 @@ intersection(const typename K::Triangle_3& t,
               && orientation(q,p,b,c) != POSITIVE
               && orientation(q,p,c,a) != POSITIVE )
           {
-            boost::optional<Point_3> op = t3r3_intersection_aux(t,r,k);
+            std::optional<Point_3> op = t3r3_intersection_aux(t,r,k);
             if(op) return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Ray_3>(*op);
             else return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Ray_3>();
           }
@@ -515,7 +515,7 @@ intersection(const typename K::Triangle_3& t,
               && orientation(p,q,b,c) != POSITIVE
               && orientation(p,q,c,a) != POSITIVE )
           {
-            boost::optional<Point_3> op = t3r3_intersection_aux(t,r,k);
+            std::optional<Point_3> op = t3r3_intersection_aux(t,r,k);
             if(op) return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Ray_3>(*op);
             else return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Ray_3>();
           }
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Tetrahedron_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Tetrahedron_3_Triangle_3_intersection.h
index 49bc573489e6..e3668392be02 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Tetrahedron_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Tetrahedron_3_Triangle_3_intersection.h
@@ -148,7 +148,7 @@ intersection(const typename K::Tetrahedron_3& tet,
     supporting_planes.swap(current_sp);
 
     if (res.empty())
-      return boost::none;
+      return std::nullopt;
   }
 
   switch(res.size())
diff --git a/Intersections_3/test/Intersections_3/test_intersections_Tetrahedron_3.cpp b/Intersections_3/test/Intersections_3/test_intersections_Tetrahedron_3.cpp
index 6f45f6200e65..29b21af670f1 100644
--- a/Intersections_3/test/Intersections_3/test_intersections_Tetrahedron_3.cpp
+++ b/Intersections_3/test/Intersections_3/test_intersections_Tetrahedron_3.cpp
@@ -322,7 +322,7 @@ struct Tetrahedron_3_intersection_tester
     Tr tri(P(0.191630, -0.331630, -0.370000), P(-0.124185, -0.385815, -0.185000), P(-0.0700000, -0.0700000, 0.00000));
     Tet tet(P(0, -1, 0), P(-1, 0, 0), P(0, 0, 0), P(0, 0, -1));
     auto res = intersection(tri, tet);
-    assert(res != boost::none);
+    assert(res != std::nullopt);
     const std::vector<P> *vps = boost::get<std::vector<P>>(&*res);
     assert(vps!=nullptr);
   }
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
index ab57d5cfb67a..88afb8e5bfff 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
@@ -81,7 +81,7 @@ typedef Line_3<K> Line_2;
 A construction object.
 Provides the operator :
 
-`boost::optional< boost::variant<Point_2,Segment_2> > operator()(Segment_2 s1, Segment_2 s2);`
+`std::optional< boost::variant<Point_2,Segment_2> > operator()(Segment_2 s1, Segment_2 s2);`
 which returns a 3D object whose projection on the xy-plane
 is the intersection of the projections of `s1` and `s2`.
 If non empty, the returned object is either a segment or a point.
diff --git a/Kernel_23/doc/Kernel_23/CGAL/intersections.h b/Kernel_23/doc/Kernel_23/CGAL/intersections.h
index 1b6c85341a3a..430e37cbcc09 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/intersections.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/intersections.h
@@ -103,7 +103,7 @@ The following tables give the possible values for `Type1` and `Type2`.
 
 The return type of intersecting two objects of the types `Type1` and `Type2` can be
 specified through the placeholder type specifier `auto`. It is equivalent to
-`boost::optional< boost::variant< T... > >`, the last column in the table providing
+`std::optional< boost::variant< T... > >`, the last column in the table providing
 the template parameter pack.
 
 <DIV ALIGN="CENTER">
@@ -193,7 +193,7 @@ the template parameter pack.
 </DIV>
 
 Additional overloads are provided for the type `Point_2` combined with any other type with the result type being
-`boost::optional< boost::variant< Point_2 > >`.
+`std::optional< boost::variant< Point_2 > >`.
 Overloads are also provided for the type `Bbox_2`, for all
 intersections existing with the type `Iso_rectangle_2`. Note that the return type for `Bbox_2` - `Bbox_2`
  is `Bbox_2` and not `Iso_rectangle_2`.
@@ -202,7 +202,7 @@ intersections existing with the type `Iso_rectangle_2`. Note that the return typ
 
 The return type of intersecting two objects of the types `Type1` and `Type2` can be
 specified through the placeholder type specifier `auto`. It is equivalent to
-`boost::optional< boost::variant< T... > >`, the last column in the table providing
+`std::optional< boost::variant< T... > >`, the last column in the table providing
 the template parameter pack.
 
 <DIV ALIGN="CENTER">
@@ -351,7 +351,7 @@ the template parameter pack.
 </DIV>
 
 Additional overloads are provided for the type `Point_3` combined with any other type with the result type being
-`boost::optional< boost::variant< Point_3 > >`. Overloads are also provided for the type `Bbox_3`, for all
+`std::optional< boost::variant< Point_3 > >`. Overloads are also provided for the type `Bbox_3`, for all
 intersections existing with the type `Iso_cuboid_3`. Note that the return type for `Bbox_3` - `Bbox_3`
  is `Bbox_3` and not `Iso_cuboid_3`.
 
@@ -363,10 +363,10 @@ The following examples demonstrate the most common use of
 
 In the first two examples we intersect a segment and a line.
 The result type can be specified through the placeholder type specifier `auto`,
-but you must anyway know that the result type is a `boost::optional<boost::variant<..> >`,
+but you must anyway know that the result type is a `std::optional<boost::variant<..> >`,
 in order to unpack the point or segment.
 
-<A HREF="https://www.boost.org/libs/optional/">`boost::optional`</A> comes in
+<A HREF="https://www.boost.org/libs/optional/">`std::optional`</A> comes in
 as there might be no intersection. <A HREF="https://www.boost.org/libs/variant/">`boost::variant`</A> comes in
 as, if there is an intersection, it is either a point or a segment.
 
diff --git a/Kernel_23/doc/Kernel_23/Kernel_23.txt b/Kernel_23/doc/Kernel_23/Kernel_23.txt
index 51eeea986db2..451829f8eaee 100644
--- a/Kernel_23/doc/Kernel_23/Kernel_23.txt
+++ b/Kernel_23/doc/Kernel_23/Kernel_23.txt
@@ -495,7 +495,7 @@ especially integer types and rationals.
 
 Some functions, for example \link intersection_linear_grp `intersection()`\endlink,
 can return different types of objects. To achieve this in a type-safe way \cgal uses
-return values of type `boost::optional< boost::variant< T...  > >` where `T...` is a
+return values of type `std::optional< boost::variant< T...  > >` where `T...` is a
 list of all possible resulting geometric objects. The exact result type of an intersection
 can be specified through the placeholder type specifier `auto`.
 
diff --git a/Kernel_23/include/CGAL/Kernel/Type_mapper.h b/Kernel_23/include/CGAL/Kernel/Type_mapper.h
index 683b7fe9255c..a33224fcd59d 100644
--- a/Kernel_23/include/CGAL/Kernel/Type_mapper.h
+++ b/Kernel_23/include/CGAL/Kernel/Type_mapper.h
@@ -27,7 +27,7 @@
 #include <boost/mpl/transform.hpp>
 #include <boost/mpl/remove.hpp>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/variant.hpp>
 
 #include <boost/preprocessor/facilities/expand.hpp>
@@ -54,8 +54,8 @@ struct Type_mapper_impl<std::vector< T >, K1, K2 > {
 };
 
 template < typename T, typename K1, typename K2 >
-struct Type_mapper_impl<boost::optional<T>, K1, K2 > {
-  typedef boost::optional< typename Type_mapper_impl<T, K1, K2>::type > type;
+struct Type_mapper_impl<std::optional<T>, K1, K2 > {
+  typedef std::optional< typename Type_mapper_impl<T, K1, K2>::type > type;
 };
 
 
diff --git a/Kernel_23/include/CGAL/Kernel/function_objects.h b/Kernel_23/include/CGAL/Kernel/function_objects.h
index 07468ad23a89..29d74179a87c 100644
--- a/Kernel_23/include/CGAL/Kernel/function_objects.h
+++ b/Kernel_23/include/CGAL/Kernel/function_objects.h
@@ -1764,7 +1764,7 @@ namespace CommonKernelFunctors {
       Line l2 = construct_line(l21, l22);
 
       const auto res = typename K::Intersect_3()(l1,l2);
-      CGAL_assertion(res!=boost::none);
+      CGAL_assertion(res!=std::nullopt);
       const Point* e_pt = boost::get<Point>(&(*res));
       CGAL_assertion(e_pt!=nullptr);
       return *e_pt;
@@ -2172,7 +2172,7 @@ namespace CommonKernelFunctors {
       Line line = construct_line( l1, l2 );
 
       const auto res = typename K::Intersect_3()(plane,line);
-      CGAL_assertion(res!=boost::none);
+      CGAL_assertion(res!=std::nullopt);
       const Point* e_pt = boost::get<Point>(&(*res));
       CGAL_assertion(e_pt!=nullptr);
       return *e_pt;
@@ -2185,7 +2185,7 @@ namespace CommonKernelFunctors {
       Line line = construct_line( l1, l2 );
 
       const auto res = typename K::Intersect_3()(plane,line);
-      CGAL_assertion(res!=boost::none);
+      CGAL_assertion(res!=std::nullopt);
       const Point* e_pt = boost::get<Point>(&(*res));
       CGAL_assertion(e_pt!=nullptr);
       return *e_pt;
@@ -3618,7 +3618,7 @@ namespace CommonKernelFunctors {
     operator()(const T1& t1, const T2& t2) const
     { return Intersections::internal::intersection(t1, t2, K() ); }
 
-    boost::optional<boost::variant<typename K::Point_3, typename K::Line_3, typename K::Plane_3> >
+    std::optional<boost::variant<typename K::Point_3, typename K::Line_3, typename K::Plane_3> >
     operator()(const Plane_3& pl1, const Plane_3& pl2, const Plane_3& pl3)const
     { return Intersections::internal::intersection(pl1, pl2, pl3, K() ); }
   };
@@ -3635,7 +3635,7 @@ namespace CommonKernelFunctors {
     typedef typename K::Point_3     Point_3;
     typedef typename K::Line_3      Line_3;
     typedef typename K::Plane_3     Plane_3;
-    typedef typename boost::optional<Point_3> result_type;
+    typedef typename std::optional<Point_3> result_type;
 
     result_type
     operator()(const Plane_3& pl1, const Plane_3& pl2, const Plane_3& pl3) const
diff --git a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
index 9f9896ac7eb3..d1cb83d135de 100644
--- a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
+++ b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
@@ -428,7 +428,7 @@ class  Intersect_projected_3
 
 
 
-  boost::optional< boost::variant<Point_3,Segment_3> >
+  std::optional< boost::variant<Point_3,Segment_3> >
   operator()(const Segment_3& s1, const Segment_3& s2) const
   {
     typedef  boost::variant<Point_3, Segment_3> variant_type;
@@ -447,7 +447,7 @@ class  Intersect_projected_3
 
     auto o = intersection(s1_2,s2_2);
     if(! o){
-      return boost::none;
+      return std::nullopt;
     }
 
     if(const Segment_2* si = boost::get<Segment_2>(&*o)){
@@ -468,7 +468,7 @@ class  Intersect_projected_3
       src[Projector<R,dim>::y_index] = si->source().y();
       tgt[Projector<R,dim>::x_index] = si->target().x();
       tgt[Projector<R,dim>::y_index] = si->target().y();
-      return boost::make_optional(variant_type(Segment_3( Point_3(src[0],src[1],src[2]),Point_3(tgt[0],tgt[1],tgt[2]) ) ) );
+      return std::make_optional(variant_type(Segment_3( Point_3(src[0],src[1],src[2]),Point_3(tgt[0],tgt[1],tgt[2]) ) ) );
     }
 
 
@@ -484,7 +484,7 @@ class  Intersect_projected_3
 
     Point_3 res(coords[0],coords[1],coords[2]);
     CGAL_assertion(x(res)==pi->x() && y(res)==pi->y());
-    return boost::make_optional(variant_type(res));
+    return std::make_optional(variant_type(res));
   }
 };
 
diff --git a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h
index 42c3bc318592..873ad1bcb144 100644
--- a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h
+++ b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h
@@ -182,7 +182,7 @@ class Projected_intersect_3
     CGAL_TIME_PROFILER("Construct Projected_intersect_3")
   }
 
-  boost::optional<boost::variant<Point,Segment> >
+  std::optional<boost::variant<Point,Segment> >
   operator()(const Segment& s1, const Segment& s2)
   {
     CGAL_PROFILER("Projected_intersect_3::operator()")
@@ -204,7 +204,7 @@ class Projected_intersect_3
 #ifdef CGAL_T2_PTB_3_DEBUG
       std::cerr << "planes_intersection is empty\n";
 #endif
-      return boost::none;
+      return std::nullopt;
     }
     if(const Line* line = boost::get<Line>(&*planes_intersection))
     {
@@ -222,7 +222,7 @@ class Projected_intersect_3
 #ifdef CGAL_T2_PTB_3_DEBUG
         std::cerr << "intersection not inside\n";
 #endif
-        return boost::none;
+        return std::nullopt;
       }
       else
       {
@@ -233,10 +233,10 @@ class Projected_intersect_3
                                                  cross_product(s1.to_vector(),
                                                                s2.to_vector())));
         if(! inter){
-          return boost::none;
+          return std::nullopt;
         }
         if(const Point* point = boost::get<Point>(&*inter)){
-          return boost::make_optional(variant_type(*point));
+          return std::make_optional(variant_type(*point));
         }
       }
     }
@@ -255,50 +255,50 @@ class Projected_intersect_3
       bool src1_in_s2 = is_inside_segment(s2, s1.source());
       bool tgt1_in_s2 = is_inside_segment(s2, s1.target());
 
-      if (src1_in_s2 && tgt1_in_s2) return boost::make_optional(variant_type(s1));
-      if (src2_in_s1 && tgt2_in_s1) return boost::make_optional(variant_type(s2));
+      if (src1_in_s2 && tgt1_in_s2) return std::make_optional(variant_type(s1));
+      if (src2_in_s1 && tgt2_in_s1) return std::make_optional(variant_type(s2));
 
       if (src1_in_s2)
       {
         if (src2_in_s1)
         {
           if (cross_product(normal, Vector_3(s1.source(), s2.source())) != NULL_VECTOR)
-            return boost::make_optional(variant_type(Segment(s1.source(), s2.source())));
+            return std::make_optional(variant_type(Segment(s1.source(), s2.source())));
           else
-            return boost::make_optional(variant_type((s1.source())));
+            return std::make_optional(variant_type((s1.source())));
         }
         if (tgt2_in_s1)
         {
           if (cross_product(normal, Vector_3(s1.source(), s2.target())) != NULL_VECTOR)
-            return boost::make_optional(variant_type(Segment(s1.source(), s2.target())));
+            return std::make_optional(variant_type(Segment(s1.source(), s2.target())));
           else
-            return boost::make_optional(variant_type(s1.source()));
+            return std::make_optional(variant_type(s1.source()));
         }
         // should never get here with a Kernel with exact constructions
-        return boost::make_optional(variant_type(s1.source()));
+        return std::make_optional(variant_type(s1.source()));
       }
       if (tgt1_in_s2)
       {
         if (src2_in_s1)
         {
           if (cross_product(normal, Vector_3(s1.target(), s2.source())) != NULL_VECTOR)
-            return boost::make_optional(variant_type(Segment(s1.target(), s2.source())));
+            return std::make_optional(variant_type(Segment(s1.target(), s2.source())));
           else
-            return boost::make_optional(variant_type(s1.target()));
+            return std::make_optional(variant_type(s1.target()));
         }
         if (tgt2_in_s1)
         {
           if (cross_product(normal, Vector_3(s1.target(), s2.target())) != NULL_VECTOR)
-            return boost::make_optional(variant_type(Segment(s1.target(), s2.target())));
+            return std::make_optional(variant_type(Segment(s1.target(), s2.target())));
           else
-            return boost::make_optional(variant_type(s1.target()));
+            return std::make_optional(variant_type(s1.target()));
         }
         // should never get here with a Kernel with exact constructions
-        return boost::make_optional(variant_type(s1.target()));
+        return std::make_optional(variant_type(s1.target()));
       }
-      return boost::none;
+      return std::nullopt;
     }
-    return boost::none;
+    return std::nullopt;
   }
 }; // end class Projected_intersect_3
 
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_all_linear_intersections.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_all_linear_intersections.h
index 4d2b09ac3b24..2e9aab53fbad 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_all_linear_intersections.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_all_linear_intersections.h
@@ -1,9 +1,9 @@
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Cartesian_converter.h>
-#include <boost/optional.hpp>
+#include <optional>
 
 template <class T>
-bool is_intersection_empty(const boost::optional<T>& t)
+bool is_intersection_empty(const std::optional<T>& t)
 {
   return bool(t);
 }
diff --git a/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h b/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h
index 1ac4f08cf2da..16448e7eff50 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h
@@ -36,7 +36,7 @@ The following table gives the possible values for `Type1` and `Type2`.
 
 The return type of intersecting two objects of the types `Type1` and `Type2` can be
 specified through the placeholder type specifier `auto`. It is equivalent to
-`boost::optional< boost::variant< T... > >`, the last column in the table providing
+`std::optional< boost::variant< T... > >`, the last column in the table providing
 the template parameter pack.
 
 
@@ -155,7 +155,7 @@ void foo(Segment_d<R> seg, Line_d<R> lin)
 
 \sa `do_intersect`
 \sa `Kernel_d::Intersect_d`
-\sa <a HREF="https://www.boost.org/doc/libs/release/libs/optional/index.html">`boost::optional`</a>
+\sa <a HREF="https://www.boost.org/doc/libs/release/libs/optional/index.html">`std::optional`</a>
 \sa <a HREF="https://www.boost.org/doc/html/variant.html">`boost::variant`</a>
 
 */
diff --git a/Kernel_d/doc/Kernel_d/Kernel_d.txt b/Kernel_d/doc/Kernel_d/Kernel_d.txt
index fcfbfe0afecf..1e1e3361096c 100644
--- a/Kernel_d/doc/Kernel_d/Kernel_d.txt
+++ b/Kernel_d/doc/Kernel_d/Kernel_d.txt
@@ -477,7 +477,7 @@ Intersections on kernel objects currently cover only those objects
 that are part of flats (`R::Segment_d`, `R::Ray_d`,
 `R::Line_d`, and `R::Hyperplane_d`). For any pair of objects
 \f$ o1\f$, \f$ o2\f$ of these types the operation `intersection(o1,o2)`
-returns a `boost::optional< boost::variant< T... > >`
+returns a `std::optional< boost::variant< T... > >`
 where `T...` is a list of all possible resulting geometric objects.
 
 The return type of intersecting two objects of the types `Type1` and `Type2` can be
diff --git a/Kernel_d/include/CGAL/Kernel_d/function_objects.h b/Kernel_d/include/CGAL/Kernel_d/function_objects.h
index 221c3c7bbdb2..0e073c0272d4 100644
--- a/Kernel_d/include/CGAL/Kernel_d/function_objects.h
+++ b/Kernel_d/include/CGAL/Kernel_d/function_objects.h
@@ -76,22 +76,22 @@ class Intersect
 
   template <typename F>
   struct result<F(Line_d, Line_d)>
-  { typedef boost::optional< boost::variant< Point_d, Line_d > > type; };
+  { typedef std::optional< boost::variant< Point_d, Line_d > > type; };
 
   template <typename F>
   struct result<F(Segment_d, Line_d)>
-  { typedef boost::optional< boost::variant< Point_d, Segment_d > > type; };
+  { typedef std::optional< boost::variant< Point_d, Segment_d > > type; };
   template <typename F>
   struct result<F(Line_d, Segment_d)> : result<F(Segment_d, Line_d)>
   { };
 
   template <typename F>
   struct result<F(Segment_d, Segment_d)>
-  { typedef boost::optional< boost::variant< Point_d, Segment_d > > type; };
+  { typedef std::optional< boost::variant< Point_d, Segment_d > > type; };
 
   template <typename F>
   struct result<F(Ray_d, Line_d)>
-  { typedef boost::optional< boost::variant< Point_d, Ray_d > > type; };
+  { typedef std::optional< boost::variant< Point_d, Ray_d > > type; };
 
   template <typename F>
   struct result<F(Line_d, Ray_d)> : result<F(Ray_d, Line_d)>
@@ -99,7 +99,7 @@ class Intersect
 
   template <typename F>
   struct result<F(Ray_d, Segment_d)>
-  { typedef boost::optional< boost::variant< Point_d, Segment_d > > type; };
+  { typedef std::optional< boost::variant< Point_d, Segment_d > > type; };
 
   template <typename F>
   struct result<F(Segment_d, Ray_d)> : result<F(Ray_d, Segment_d)>
@@ -107,25 +107,25 @@ class Intersect
 
   template <typename F>
   struct result<F(Ray_d, Ray_d)>
-  { typedef boost::optional< boost::variant< Point_d, Segment_d, Ray_d > > type; };
+  { typedef std::optional< boost::variant< Point_d, Segment_d, Ray_d > > type; };
 
   template <typename F>
   struct result<F(Hyperplane_d, Line_d)>
-  { typedef boost::optional< boost::variant< Point_d, Line_d > > type; };
+  { typedef std::optional< boost::variant< Point_d, Line_d > > type; };
   template <typename F>
   struct result<F(Line_d, Hyperplane_d)> : result<F(Hyperplane_d, Line_d)>
   { };
 
   template <typename F>
   struct result<F(Hyperplane_d, Ray_d)>
-  { typedef boost::optional< boost::variant< Point_d, Ray_d > > type; };
+  { typedef std::optional< boost::variant< Point_d, Ray_d > > type; };
   template <typename F>
   struct result<F(Ray_d, Hyperplane_d)> : result<F(Hyperplane_d, Ray_d)>
   { };
 
   template <typename F>
   struct result<F(Hyperplane_d, Segment_d)>
-  { typedef boost::optional< boost::variant< Point_d, Segment_d > > type; };
+  { typedef std::optional< boost::variant< Point_d, Segment_d > > type; };
   template <typename F>
   struct result<F(Segment_d, Hyperplane_d)> : result<F(Hyperplane_d, Segment_d)>
   { };
diff --git a/Mesh_3/benchmark/Mesh_3/StdAfx.h b/Mesh_3/benchmark/Mesh_3/StdAfx.h
index a07ee4b3f167..9ca9eb02fa71 100644
--- a/Mesh_3/benchmark/Mesh_3/StdAfx.h
+++ b/Mesh_3/benchmark/Mesh_3/StdAfx.h
@@ -63,7 +63,7 @@
 #include <boost/mpl/set/set0.hpp>
 #include <boost/mpl/vector.hpp>
 #include <boost/none.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 //#include <boost/parameter.hpp>
 //#include <boost/parameter/binding.hpp>
 //#include <boost/parameter/config.hpp>
diff --git a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
index a1b35060f858..93b25870c210 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
@@ -53,9 +53,9 @@ Function object that constructs the intersection
 between a 3D segment and a 3D triangle.
 Partial model of `::Kernel::Intersect_3`. Provides the operators:
 
-- `boost::optional< boost::variant< Point_3, Segment_3 > > operator()(Segment_3 seg, Triangle_3 tr)`
+- `std::optional< boost::variant< Point_3, Segment_3 > > operator()(Segment_3 seg, Triangle_3 tr)`
 
-- `boost::optional< boost::variant< Point_3, Segment_3 > > operator()(Triangle_3 tr, Segment_3 seg)`
+- `std::optional< boost::variant< Point_3, Segment_3 > > operator()(Triangle_3 tr, Segment_3 seg)`
 
 which computes the intersection between the triangle and the segment.
 */
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
index d3b0b83f0a64..909f490b3ae4 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
@@ -48,7 +48,7 @@ the cell is good with regard to the criteria.
 In addition, an object of this type must contain an object of type
 `Cell_quality` if it represents
 a bad cell. `Cell_quality` must be accessible by `operator*()`.
-Note that `boost::optional<Cell_quality>` is a natural model of this concept.
+Note that `std::optional<Cell_quality>` is a natural model of this concept.
 */
 typedef unspecified_type Is_cell_bad;
 
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
index 240f9b0f1fbf..3a96bdc4c04d 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
@@ -138,7 +138,7 @@ A function object to query whether a point is in
 the input domain or not. In the positive case, it outputs the
 subdomain which includes the query point. Provides the operator:
 
-`boost::optional<Subdomain_index> operator()(Point_3 p)`
+`std::optional<Subdomain_index> operator()(Point_3 p)`
 */
 typedef unspecified_type Is_in_domain;
 
@@ -148,11 +148,11 @@ intersection queries between the surface patches of the domain and
 objects of type `Segment_3`, `Ray_3` or
 `Line_3`. Provides the operators:
 
-`boost::optional<Surface_patch_index> operator()(Segment_3 s)`
+`std::optional<Surface_patch_index> operator()(Segment_3 s)`
 
-`boost::optional<Surface_patch_index> operator()(Ray_3 r)`
+`std::optional<Surface_patch_index> operator()(Ray_3 r)`
 
-`boost::optional<Surface_patch_index> operator()(Line_3 l)`
+`std::optional<Surface_patch_index> operator()(Line_3 l)`
 
 The return type of the operators tell whether or not the query intersects a
 surface patch. In the positive case, it provides (through operator*()) the
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
index 325dedeff053..f25f9a0f4f39 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
@@ -55,7 +55,7 @@ the facet is good with regard to the criteria.
 In addition, an object of this type must contain an object of type
 `Facet_quality` if it represents
 a bad facet. `Facet_quality` must be accessible by
-`operator*()`. Note that `boost::optional<Facet_quality>` is
+`operator*()`. Note that `std::optional<Facet_quality>` is
 a natural model of this concept.
 */
 typedef unspecified_type Is_facet_bad;
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
index e4d5a977a1c1..63fcddb7a40c 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
@@ -312,11 +312,11 @@ class MeshTriangulationTraits_3
   /*!
   A constructor object that must provide the function operators:
 
-  `boost::optional< boost::variant< T... > > operator()(Segment_3 s, Plane_3 p)`
+  `std::optional< boost::variant< T... > > operator()(Segment_3 s, Plane_3 p)`
 
-  `boost::optional< boost::variant< T... > > operator()(Ray_3 r, Iso_cuboid i)`
+  `std::optional< boost::variant< T... > > operator()(Ray_3 r, Iso_cuboid i)`
 
-  `boost::optional< boost::variant< T... > > operator()(Segment_3 s, Iso_cuboid i)`
+  `std::optional< boost::variant< T... > > operator()(Segment_3 s, Iso_cuboid i)`
 
   which returns the intersection region of two geometrical objects.
   */
diff --git a/Mesh_3/examples/Mesh_3/mesh_hybrid_mesh_domain.cpp b/Mesh_3/examples/Mesh_3/mesh_hybrid_mesh_domain.cpp
index fb528891cd16..32a612b7b1d0 100644
--- a/Mesh_3/examples/Mesh_3/mesh_hybrid_mesh_domain.cpp
+++ b/Mesh_3/examples/Mesh_3/mesh_hybrid_mesh_domain.cpp
@@ -99,9 +99,9 @@ class Hybrid_domain
   {
     Is_in_domain(const Hybrid_domain& domain) : r_domain_(domain) {}
 
-    boost::optional<Subdomain_index> operator()(const K::Point_3& p) const
+    std::optional<Subdomain_index> operator()(const K::Point_3& p) const
     {
-      boost::optional<Subdomain_index> subdomain_index =
+      std::optional<Subdomain_index> subdomain_index =
         r_domain_.implicit_domain.is_in_domain_object()(p);
       if(subdomain_index) return 2;
       else return r_domain_.polyhedron_domain.is_in_domain_object()(p);
diff --git a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
index ecc81e96046f..a6fd33ab1eca 100644
--- a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
@@ -47,7 +47,7 @@
 #ifdef CGAL_MESH_3_VERBOSE
 #  include <boost/format.hpp>
 #endif
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <CGAL/Mesh_3/Null_subdomain_index.h>
 #include <CGAL/Mesh_domain_with_polyline_features_3.h>
@@ -374,11 +374,11 @@ class Labeled_mesh_domain_3
   typedef typename Geom_traits::FT           FT;
 ///@}
 #else
-  typedef boost::optional<Subdomain_index>  Subdomain;
+  typedef std::optional<Subdomain_index>  Subdomain;
 
   // Type of indexes for cells of the input complex
   typedef Surface_patch_index_                  Surface_patch_index;
-  typedef boost::optional<Surface_patch_index>  Surface_patch;
+  typedef std::optional<Surface_patch_index>  Surface_patch;
 
   // Type of indexes to characterize the lowest dimensional face of the input
   // complex on which a vertex lie
diff --git a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
index 6a812e5581b6..4d4ec6d698ec 100644
--- a/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
+++ b/Mesh_3/include/CGAL/Mesh_3/C3T3_helpers.h
@@ -38,7 +38,7 @@
 
 #include <boost/range/begin.hpp>
 #include <boost/range/end.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <CGAL/boost/iterator/transform_iterator.hpp>
 #include <boost/iterator/function_output_iterator.hpp>
 #include <boost/type_traits/is_convertible.hpp>
@@ -643,8 +643,8 @@ class C3T3_helpers
   typedef typename C3T3::Subdomain_index              Subdomain_index;
   typedef typename C3T3::Index                        Index;
 
-  typedef boost::optional<Surface_patch_index>        Surface_patch;
-  typedef boost::optional<Subdomain_index>            Subdomain;
+  typedef std::optional<Surface_patch_index>        Surface_patch;
+  typedef std::optional<Subdomain_index>            Subdomain;
 
   typedef std::vector<Cell_handle>                    Cell_vector;
   typedef std::set<Cell_handle>                       Cell_set;
@@ -683,7 +683,7 @@ class C3T3_helpers
   // -----------------------------------
   // Public interface
   // -----------------------------------
-  typedef boost::optional<Vertex_handle>              Update_mesh;
+  typedef std::optional<Vertex_handle>              Update_mesh;
 
   using Base::try_lock_point;
   using Base::try_lock_vertex;
@@ -1677,7 +1677,7 @@ class C3T3_helpers
   /**
    * Returns the least square plane from v, using adjacent surface points
    */
-  std::pair<boost::optional<Plane_3>, Bare_point>
+  std::pair<std::optional<Plane_3>, Bare_point>
   get_least_square_surface_plane(const Vertex_handle& v,
                                  Surface_patch_index index = Surface_patch_index()) const;
 
@@ -1686,15 +1686,15 @@ class C3T3_helpers
    * @param v The vertex from which p was moved
    * @param p The point to project
    * @param index The index of the surface patch where v lies, if known.
-   * @return a `boost::optional` with the projected point if the projection
-   * was possible, or `boost::none`.
+   * @return a `std::optional` with the projected point if the projection
+   * was possible, or `std::nullopt`.
    *
    * `p` is projected using the normal of least square fitting plane
    * on `v` incident surface points. If `index` is specified, only
    * surface points that are on the same surface patch are used to compute
    * the fitting plane.
    */
-  boost::optional<Bare_point>
+  std::optional<Bare_point>
   project_on_surface_if_possible(const Vertex_handle& v,
                                  const Bare_point& p,
                                  Surface_patch_index index = Surface_patch_index()) const;
@@ -2778,7 +2778,7 @@ rebuild_restricted_delaunay(OutdatedCells& outdated_cells,
        ++it )
   {
     const Weighted_point& initial_position = tr_.point(*it);
-    boost::optional<Bare_point> opt_new_pos = project_on_surface(*it, cp(initial_position));
+    std::optional<Bare_point> opt_new_pos = project_on_surface(*it, cp(initial_position));
 
     if ( opt_new_pos )
     {
@@ -2890,7 +2890,7 @@ rebuild_restricted_delaunay(ForwardIterator first_cell,
   {
     Vertex_handle vh = it->first;
     const Weighted_point& initial_position = tr_.point(vh);
-    boost::optional<Bare_point> opt_new_pos = project_on_surface(vh, cp(initial_position), it->second);
+    std::optional<Bare_point> opt_new_pos = project_on_surface(vh, cp(initial_position), it->second);
 
     if ( opt_new_pos )
     {
@@ -3418,7 +3418,7 @@ project_on_surface_aux(const Bare_point& p,
 
 
 template <typename C3T3, typename MD>
-std::pair<boost::optional<typename C3T3_helpers<C3T3,MD>::Plane_3>,
+std::pair<std::optional<typename C3T3_helpers<C3T3,MD>::Plane_3>,
           typename C3T3_helpers<C3T3, MD>::Bare_point>
 C3T3_helpers<C3T3,MD>::
 get_least_square_surface_plane(const Vertex_handle& v,
@@ -3471,7 +3471,7 @@ get_least_square_surface_plane(const Vertex_handle& v,
 
   // In some cases point is not a real surface point
   if ( triangles.empty() )
-    return std::make_pair(boost::none, Bare_point());
+    return std::make_pair(std::nullopt, Bare_point());
 
   // Compute least square fitting plane
   Plane_3 plane;
@@ -3498,7 +3498,7 @@ project_on_surface(const Vertex_handle& v,
                    const Bare_point& p,
                    Surface_patch_index index) const
 {
-  boost::optional<Bare_point> opt_point =
+  std::optional<Bare_point> opt_point =
     project_on_surface_if_possible(v, p, index);
   if(opt_point) return *opt_point;
   else return p;
@@ -3506,7 +3506,7 @@ project_on_surface(const Vertex_handle& v,
 
 
 template <typename C3T3, typename MD>
-boost::optional<typename C3T3_helpers<C3T3,MD>::Bare_point>
+std::optional<typename C3T3_helpers<C3T3,MD>::Bare_point>
 C3T3_helpers<C3T3,MD>::
 project_on_surface_if_possible(const Vertex_handle& v,
                                const Bare_point& p,
@@ -3518,11 +3518,11 @@ project_on_surface_if_possible(const Vertex_handle& v,
   typename Gt::Equal_3 equal = tr_.geom_traits().equal_3_object();
 
   // Get plane
-  std::pair<boost::optional<Plane_3>, Bare_point> pl_rp
+  std::pair<std::optional<Plane_3>, Bare_point> pl_rp
     = get_least_square_surface_plane(v, index);
 
-  boost::optional<Plane_3> opt_plane = pl_rp.first;
-  if(!opt_plane) return boost::none;
+  std::optional<Plane_3> opt_plane = pl_rp.first;
+  if(!opt_plane) return std::nullopt;
 
   // Project
   const Weighted_point& position = tr_.point(v);
diff --git a/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h b/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
index 2fe2261344c9..d2f1065785a4 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
@@ -53,7 +53,7 @@
 #ifndef CGAL_NO_ASSERTIONS
 #  include <boost/math/special_functions/next.hpp> // for float_prior
 #endif
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/tuple/tuple.hpp>
 #include <boost/unordered_map.hpp>
 #include <boost/unordered_set.hpp>
@@ -1524,7 +1524,7 @@ change_ball_size(const Vertex_handle& v, const FT squared_size, const bool speci
   Bare_point p = cp(c3t3_.triangulation().point(v)); // intentional copy
 
   // Remove v from the set of corners
-  boost::optional<Corner_index> corner_index = boost::make_optional(false, Corner_index());
+  std::optional<Corner_index> corner_index = std::make_optional(false, Corner_index());
   if ( c3t3_.is_in_complex(v) )
   {
     corner_index = c3t3_.corner_index(v);
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
index 4ee48c865ea2..59526d1adc90 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
@@ -926,7 +926,7 @@ void
 Refine_cells_3<Tr,Cr,MD,C3T3_,P_,Ct,C_>::
 treat_new_cell(const Cell_handle& cell)
 {
-  typedef boost::optional<typename MD::Subdomain_index> Subdomain;
+  typedef std::optional<typename MD::Subdomain_index> Subdomain;
 
   // treat cell
   const Subdomain subdomain = r_oracle_.is_in_domain_object()(r_tr_.dual(cell));
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
index ded63f9b139a..1f9c064f1d89 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
@@ -43,7 +43,7 @@
 #include <CGAL/Object.h>
 
 #include <boost/format.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/optional/optional_io.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/mpl/if.hpp>
@@ -397,7 +397,7 @@ class Refine_facets_3_base
   typedef typename MeshDomain::Surface_patch_index Surface_patch_index;
   typedef typename MeshDomain::Index Index;
 
-  typedef typename boost::optional<
+  typedef typename std::optional<
     std::tuple<Surface_patch_index, Index, Bare_point> >
                                                       Facet_properties;
 
@@ -1624,7 +1624,7 @@ compute_facet_properties(const Facet& facet,
   CGAL_assertion( r_tr_.dimension() == 3 );
 
   // types
-  typedef boost::optional<typename MD::Surface_patch_index> Surface_patch;
+  typedef std::optional<typename MD::Surface_patch_index> Surface_patch;
   typedef typename MD::Intersection Intersection;
 
   // Functor
diff --git a/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h b/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h
index e8c2c214e48d..1f420ffd432f 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Slivers_exuder.h
@@ -38,7 +38,7 @@
 
 #include <boost/format.hpp>
 #include <boost/iterator/function_output_iterator.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/type_traits/is_convertible.hpp>
 
 #include <algorithm>
@@ -498,7 +498,7 @@ class Slivers_exuder
   /**
    * Returns the umbrella of internal_facets vector
    */
-  boost::optional<Umbrella>
+  std::optional<Umbrella>
   get_umbrella(const Facet_vector& internal_facets,
                const Vertex_handle& v) const;
 
@@ -1351,7 +1351,7 @@ get_best_weight(const Vertex_handle& v, bool *could_lock_zone) const
 
 
 template <typename C3T3, typename SC, typename V_>
-boost::optional<typename Slivers_exuder<C3T3,SC,V_>::Umbrella >
+std::optional<typename Slivers_exuder<C3T3,SC,V_>::Umbrella >
 Slivers_exuder<C3T3,SC,V_>::
 get_umbrella(const Facet_vector& facets, // internal_facets of conflict zone
              const Vertex_handle& /* v, no longer used */) const
@@ -1387,7 +1387,7 @@ get_umbrella(const Facet_vector& facets, // internal_facets of conflict zone
         {
           std::size_t count = (*uit).second.second;
           if(count == 2) //there will be more than 3 after insertion
-            return boost::none; //non-manifold configuration
+            return std::nullopt; //non-manifold configuration
 
           umbrella.insert(uit,
             std::make_pair(oe,
@@ -1563,8 +1563,8 @@ update_mesh(const Weighted_point& new_point,
   Boundary_facets_from_outside boundary_facets_from_outside =
     get_boundary_facets_from_outside(boundary_facets);
 
-  boost::optional<Umbrella> umbrella = get_umbrella(internal_facets, old_vertex);
-  if(umbrella == boost::none)
+  std::optional<Umbrella> umbrella = get_umbrella(internal_facets, old_vertex);
+  if(umbrella == std::nullopt)
     return false; //abort pumping this vertex
 
   // Delete old cells from queue (they aren't in the triangulation anymore)
diff --git a/Mesh_3/include/CGAL/Mesh_3/experimental/Sizing_field_with_aabb_tree.h b/Mesh_3/include/CGAL/Mesh_3/experimental/Sizing_field_with_aabb_tree.h
index 11319fe065df..a35b11727915 100644
--- a/Mesh_3/include/CGAL/Mesh_3/experimental/Sizing_field_with_aabb_tree.h
+++ b/Mesh_3/include/CGAL/Mesh_3/experimental/Sizing_field_with_aabb_tree.h
@@ -228,11 +228,11 @@ struct Sizing_field_with_aabb_tree
     }
   }
 
-  boost::optional<Point_and_primitive_id>
+  std::optional<Point_and_primitive_id>
   closest_point_on_surfaces(const Point_3& p,
                             const Patches_ids& patch_ids_to_ignore) const
   {
-    boost::optional<Point_and_primitive_id> result{};
+    std::optional<Point_and_primitive_id> result{};
     if(d_ptr->aabb_tree.empty()) return result;
     for(std::size_t i = 0; i < d_ptr->kd_trees_ptrs.size(); ++i) {
       const auto patch_id = static_cast<Patch_index>(i + d_ptr->min_patch_id);
@@ -325,7 +325,7 @@ struct Sizing_field_with_aabb_tree
 
         const auto closest_point_and_primitive = closest_point_on_surfaces(p, ids);
 
-        if(closest_point_and_primitive != boost::none) {
+        if(closest_point_and_primitive != std::nullopt) {
           result =
             (std::min)(0.9 / CGAL::sqrt(CGAL::Mesh_3::internal::weight_modifier) *
                        CGAL_NTS
@@ -379,7 +379,7 @@ struct Sizing_field_with_aabb_tree
       if(!d_ptr->aabb_tree.empty()) {
         //Compute distance to surface patches
         const auto closest_point_and_primitive = closest_point_on_surfaces(p, ids);
-        if(closest_point_and_primitive == boost::none) {
+        if(closest_point_and_primitive == std::nullopt) {
 #ifdef CGAL_MESH_3_PROTECTION_HIGH_VERBOSITY
           std::cerr << result << " (projection not found) ids:";
           for(Patch_index i : ids) {
diff --git a/Mesh_3/include/CGAL/Mesh_3/initialize_triangulation_from_labeled_image.h b/Mesh_3/include/CGAL/Mesh_3/initialize_triangulation_from_labeled_image.h
index d2dfef196e0a..bc705dc40de6 100644
--- a/Mesh_3/include/CGAL/Mesh_3/initialize_triangulation_from_labeled_image.h
+++ b/Mesh_3/include/CGAL/Mesh_3/initialize_triangulation_from_labeled_image.h
@@ -159,8 +159,8 @@ void initialize_triangulation_from_labeled_image(C3T3& c3t3,
         : domain.is_in_domain_object()(
             seed_cell->weighted_circumcenter(tr.geom_traits()));
 
-    if ( seed_label != boost::none
-      && seed_cell_label != boost::none
+    if ( seed_label != std::nullopt
+      && seed_cell_label != std::nullopt
       && *seed_label == *seed_cell_label)
         continue; //this means the connected component has already been initialized
 
diff --git a/Mesh_3/include/CGAL/Mesh_3/mesh_standard_criteria.h b/Mesh_3/include/CGAL/Mesh_3/mesh_standard_criteria.h
index 268bffcc4c14..a3564c1b946c 100644
--- a/Mesh_3/include/CGAL/Mesh_3/mesh_standard_criteria.h
+++ b/Mesh_3/include/CGAL/Mesh_3/mesh_standard_criteria.h
@@ -22,7 +22,7 @@
 
 
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/ptr_container/ptr_vector.hpp>
 
 namespace CGAL {
@@ -41,7 +41,7 @@ class Abstract_criterion
 
 public:
   typedef FT Quality;
-  typedef boost::optional<Quality>  Is_bad;
+  typedef std::optional<Quality>  Is_bad;
   typedef typename Visitor_::Handle Handle;
 
   /// Destructor
@@ -81,7 +81,7 @@ class Criterion_visitor
 
 public:
   typedef std::pair<int, typename Criterion::Quality> Quality;
-  typedef boost::optional<Quality>                    Is_bad;
+  typedef std::optional<Quality>                    Is_bad;
 
 
   // Constructor
diff --git a/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h b/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
index e42bc0acff77..e95871871634 100644
--- a/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
+++ b/Mesh_3/include/CGAL/Mesh_3/polylines_to_protect.h
@@ -30,7 +30,7 @@
 #include <boost/graph/adjacency_list.hpp>
 
 #include <boost/utility.hpp> // for boost::prior
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <CGAL/Search_traits_3.h>
 #include <CGAL/Orthogonal_incremental_neighbor_search.h>
@@ -452,7 +452,7 @@ polylines_to_protect
  InterpolationFunctor interpolate,
  PolylineInputIterator existing_polylines_begin,
  PolylineInputIterator existing_polylines_end,
- boost::optional<Image_word_type> scalar_interpolation_value = boost::none,
+ std::optional<Image_word_type> scalar_interpolation_value = std::nullopt,
  int prec = 10)
 {
   typedef typename DomainFunctor::result_type Domain_type;
@@ -587,7 +587,7 @@ polylines_to_protect
                  pixel[1],
                  pixel[2]);
               square[ii][jj].domain = domain_fct(square[ii][jj].word);
-              if(scalar_interpolation_value != boost::none) {
+              if(scalar_interpolation_value != std::nullopt) {
                 square[ii][jj].word =
                   Image_word_type(square[ii][jj].word -
                                   (*scalar_interpolation_value));
@@ -735,7 +735,7 @@ polylines_to_protect
                                                        square[1][0], null);
 
               Isoline_equation equation =
-                (scalar_interpolation_value == boost::none) ?
+                (scalar_interpolation_value == std::nullopt) ?
                 Isoline_equation(1, -1, -1, 0) :
                 Isoline_equation(v00, v10, v01, v11);
               insert_curve_in_graph.insert_curve(equation,
@@ -745,7 +745,7 @@ polylines_to_protect
                                                  p00,
                                                  p10 - p00,
                                                  p01 - p00);
-              if(scalar_interpolation_value == boost::none) {
+              if(scalar_interpolation_value == std::nullopt) {
                 equation = Isoline_equation(0, -1, -1, 1);
               }
               insert_curve_in_graph.insert_curve(equation,
@@ -872,7 +872,7 @@ polylines_to_protect
                                                          square[1][1], null);
                 vertex_descriptor bottom = g_manip.split(square[0][0],
                                                          square[1][0], null);
-                if(scalar_interpolation_value == boost::none) {
+                if(scalar_interpolation_value == std::nullopt) {
                   g_manip.try_add_edge(top, bottom);
                 } else {
                   insert_curve_in_graph.insert_curve(Isoline_equation(v00, v10,
@@ -891,7 +891,7 @@ polylines_to_protect
                 CGAL_assertion(square[1][0].domain==square[0][1].domain);
                 CGAL_assertion(square[0][0].domain!=square[0][1].domain);
 
-                if(scalar_interpolation_value != boost::none) {
+                if(scalar_interpolation_value != std::nullopt) {
                   // Compute the squared distance between the two branches of
                   // the hyperbola.
                   const double discrimant = double(v00) * v11 - double(v01) * v10;
@@ -964,7 +964,7 @@ polylines_to_protect
                                                        square[1][1], null);
 
               Isoline_equation equation =
-                (scalar_interpolation_value == boost::none) ?
+                (scalar_interpolation_value == std::nullopt) ?
                 Isoline_equation(1, -1, 1, 1) :
                 Isoline_equation(v00, v10, v01, v11);
 
diff --git a/Mesh_3/include/CGAL/Mesh_3/vertex_perturbation.h b/Mesh_3/include/CGAL/Mesh_3/vertex_perturbation.h
index 1b1e53c93052..7dc31bfbf398 100644
--- a/Mesh_3/include/CGAL/Mesh_3/vertex_perturbation.h
+++ b/Mesh_3/include/CGAL/Mesh_3/vertex_perturbation.h
@@ -34,7 +34,7 @@
   #endif
 #endif
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/random/lagged_fibonacci.hpp>
 #include <boost/random/uniform_real.hpp>
 #include <boost/random/variate_generator.hpp>
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 17e69ff984cb..66178d3906f1 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -519,13 +519,13 @@ class Polyhedral_complex_mesh_domain_3
     Is_in_domain(const Polyhedral_complex_mesh_domain_3& domain)
       : r_domain_(domain) {}
 
-    boost::optional<AABB_primitive_id> shoot_a_ray_1(const Ray_3 ray) const {
+    std::optional<AABB_primitive_id> shoot_a_ray_1(const Ray_3 ray) const {
       return r_domain_.bounding_aabb_tree_ptr()->
         first_intersected_primitive(ray);
     }
 
 #if USE_ALL_INTERSECTIONS
-    boost::optional<AABB_primitive_id> shoot_a_ray_2(const Ray_3 ray) const {
+    std::optional<AABB_primitive_id> shoot_a_ray_2(const Ray_3 ray) const {
       const Point_3& p = ray.source();
       typedef typename AABB_tree::
         template Intersection_and_primitive_id<Ray_3>::Type Inter_and_prim;
@@ -533,7 +533,7 @@ class Polyhedral_complex_mesh_domain_3
       r_domain_.bounding_aabb_tree_ptr()->
         all_intersections(ray, std::back_inserter(all_intersections));
       if(all_intersections.empty())
-        return boost::none;
+        return std::nullopt;
       else {
         for(const Inter_and_prim& i_p: all_intersections) {
           if(boost::get<Point_3>( &i_p.first) == 0) return AABB_primitive_id();
@@ -575,13 +575,13 @@ class Polyhedral_complex_mesh_domain_3
 
 #define USE_ALL_INTERSECTIONS 0
 #if USE_ALL_INTERSECTIONS
-        boost::optional<AABB_primitive_id> opt = shoot_a_ray_2(ray_shot);
+        std::optional<AABB_primitive_id> opt = shoot_a_ray_2(ray_shot);
 #else // first_intersected_primitive
-        boost::optional<AABB_primitive_id> opt = shoot_a_ray_1(ray_shot);
+        std::optional<AABB_primitive_id> opt = shoot_a_ray_1(ray_shot);
 #endif // first_intersected_primitive
         // for(int i = 0; i < 20; ++i) {
         //   const Ray_3 ray_shot2 = ray(p, vector(CGAL::ORIGIN,*random_point));
-        //   boost::optional<AABB_primitive_id> opt2 = shoot_a_ray_1(ray_shot2);
+        //   std::optional<AABB_primitive_id> opt2 = shoot_a_ray_1(ray_shot2);
         //   if(opt != opt2) {
         //     if(!opt  && *opt2 == 0) continue;
         //     if(!opt2 && *opt  == 0) continue;
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 2d9bf625f57d..5ac9a12411a5 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -36,7 +36,7 @@
 #include <CGAL/Side_of_triangle_mesh.h>
 #include <CGAL/tuple.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/none.hpp>
 #include <boost/mpl/vector.hpp>
 #include <boost/mpl/contains.hpp>
@@ -136,7 +136,7 @@ class Polyhedral_mesh_domain_3
   //-------------------------------------------------------
   /// Type of indexes for cells of the input complex
   typedef int Subdomain_index;
-  typedef boost::optional<Subdomain_index> Subdomain;
+  typedef std::optional<Subdomain_index> Subdomain;
 
   /// Type of indexes for surface patch of the input complex
   typedef typename boost::property_map<Polyhedron,
@@ -144,7 +144,7 @@ class Polyhedral_mesh_domain_3
                                        >::type            Face_patch_id_pmap;
   typedef typename boost::property_traits<
     Face_patch_id_pmap>::value_type                       Surface_patch_index;
-  typedef boost::optional<Surface_patch_index>            Surface_patch;
+  typedef std::optional<Surface_patch_index>            Surface_patch;
   /// Type of indexes to characterize the lowest dimensional face of the input
   /// complex on which a vertex lie
   typedef typename Mesh_3::internal::Index_generator<
@@ -388,7 +388,7 @@ class Polyhedral_mesh_domain_3
     {
       CGAL_MESH_3_PROFILER(std::string("Mesh_3 profiler: ") + std::string(CGAL_PRETTY_FUNCTION));
 
-      boost::optional<AABB_primitive_id> primitive_id = r_domain_.tree_.any_intersected_primitive(q);
+      std::optional<AABB_primitive_id> primitive_id = r_domain_.tree_.any_intersected_primitive(q);
       if ( primitive_id )
       {
         r_domain_.cache_primitive(q, *primitive_id);
@@ -430,7 +430,7 @@ class Polyhedral_mesh_domain_3
       CGAL_MESH_3_PROFILER(std::string("Mesh_3 profiler: ") + std::string(CGAL_PRETTY_FUNCTION));
       typedef typename AABB_tree_::template Intersection_and_primitive_id<Query>::Type
         Intersection_and_primitive_id;
-      typedef boost::optional<Intersection_and_primitive_id> AABB_intersection;
+      typedef std::optional<Intersection_and_primitive_id> AABB_intersection;
       typedef Point_3 Bare_point;
 
       AABB_intersection intersection;
@@ -447,7 +447,7 @@ class Polyhedral_mesh_domain_3
       {
 #ifndef CGAL_MESH_3_NO_LONGER_CALLS_DO_INTERSECT_3
         CGAL_precondition(r_domain_.do_intersect_surface_object()(q)
-                          != boost::none);
+                          != std::nullopt);
 #endif // NOT CGAL_MESH_3_NO_LONGER_CALLS_DO_INTERSECT_3
 
         intersection = r_domain_.tree_.any_intersection(q);
diff --git a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_traversal_traits_with_join.h b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_traversal_traits_with_join.h
index d2cfbd994369..b44438f24e8e 100644
--- a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_traversal_traits_with_join.h
+++ b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_traversal_traits_with_join.h
@@ -17,7 +17,7 @@
 
 
 #include <CGAL/Minkowski_sum_2/AABB_node_with_join.h>
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 
@@ -69,7 +69,7 @@ class First_intersection_traits
 
 public:
   typedef
-  boost::optional< typename AABBTraits::template Intersection_and_primitive_id<Query>::Type >
+  std::optional< typename AABBTraits::template Intersection_and_primitive_id<Query>::Type >
   Result;
 public:
   First_intersection_traits(const AABBTraits& traits)
@@ -124,7 +124,7 @@ class Listing_intersection_traits
 
   void intersection(const Query& query, const Primitive& primitive)
   {
-    boost::optional< typename AABBTraits::template Intersection_and_primitive_id<Query>::Type >
+    std::optional< typename AABBTraits::template Intersection_and_primitive_id<Query>::Type >
     intersection = m_traits.intersection_object()(query, primitive);
 
     if(intersection)
@@ -211,7 +211,7 @@ class First_primitive_traits
   {
     if( m_traits.do_intersect_object()(query, primitive) )
     {
-      m_result = boost::optional<typename Primitive::Id>(primitive.id());
+      m_result = std::optional<typename Primitive::Id>(primitive.id());
       m_is_found = true;
     }
   }
@@ -221,12 +221,12 @@ class First_primitive_traits
     return m_traits.do_intersect_object()(query, node.bbox());
   }
 
-  boost::optional<typename Primitive::Id> result() const { return m_result; }
+  std::optional<typename Primitive::Id> result() const { return m_result; }
   bool is_intersection_found() const { return m_is_found; }
 
 private:
   bool m_is_found;
-  boost::optional<typename Primitive::Id> m_result;
+  std::optional<typename Primitive::Id> m_result;
   const AABBTraits& m_traits;
 };
 
diff --git a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_tree_with_join.h b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_tree_with_join.h
index a528585c5c6a..8ca02f1b229b 100644
--- a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_tree_with_join.h
+++ b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_tree_with_join.h
@@ -23,7 +23,7 @@
 #include <CGAL/AABB_tree/internal/AABB_search_tree.h>
 #include <CGAL/AABB_tree/internal/Has_nested_type_Shared_data.h>
 #include <CGAL/AABB_tree/internal/Primitive_helper.h>
-#include <boost/optional.hpp>
+#include <optional>
 
 #ifdef CGAL_HAS_THREADS
 #include <CGAL/mutex.h>
@@ -252,7 +252,7 @@ namespace CGAL {
     /// `do_intersect` predicates are defined
     /// in the traits class `AABBTraits`.
     template <typename Query>
-    boost::optional<Primitive_id> any_intersected_primitive(const Query& query) const;
+    std::optional<Primitive_id> any_intersected_primitive(const Query& query) const;
 
     ///@}
 
@@ -276,7 +276,7 @@ namespace CGAL {
     /// for which `do_intersect` predicates
     /// and intersections are defined in the traits class AABBTraits.
     template <typename Query>
-    boost::optional< typename Intersection_and_primitive_id<Query>::Type >
+    std::optional< typename Intersection_and_primitive_id<Query>::Type >
     any_intersection(const Query& query) const;
 
     ///@}
@@ -764,7 +764,7 @@ namespace CGAL {
 
   template <typename Tr>
   template <typename Query>
-  boost::optional< typename AABB_tree_with_join<Tr>::template Intersection_and_primitive_id<Query>::Type >
+  std::optional< typename AABB_tree_with_join<Tr>::template Intersection_and_primitive_id<Query>::Type >
     AABB_tree_with_join<Tr>::any_intersection(const Query& query) const
   {
     using namespace CGAL::internal::AABB_tree_with_join;
@@ -776,7 +776,7 @@ namespace CGAL {
 
   template <typename Tr>
   template <typename Query>
-  boost::optional<typename AABB_tree_with_join<Tr>::Primitive_id>
+  std::optional<typename AABB_tree_with_join<Tr>::Primitive_id>
     AABB_tree_with_join<Tr>::any_intersected_primitive(const Query& query) const
   {
     using namespace CGAL::internal::AABB_tree_with_join;
diff --git a/Nef_2/include/CGAL/Nef_2/HDS_items.h b/Nef_2/include/CGAL/Nef_2/HDS_items.h
index e0b342e9e688..48a44c50fd72 100644
--- a/Nef_2/include/CGAL/Nef_2/HDS_items.h
+++ b/Nef_2/include/CGAL/Nef_2/HDS_items.h
@@ -19,7 +19,7 @@
 #include <CGAL/basic.h>
 #include <CGAL/tags.h>
 #include <list>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/none.hpp>
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
 #include <boost/any.hpp>
@@ -73,7 +73,7 @@ class Nef_vertex_2 {
     Halfedge_handle              _h;
     Face_handle                  _f;
     Point                        _p;
-    boost::optional<iv_iterator> _ivit;
+    std::optional<iv_iterator> _ivit;
     Mark                         _m;
     GenPtr                       _i;
 public:
@@ -127,7 +127,7 @@ class Nef_vertex_2 {
 
     iv_iterator ivit() const { return *_ivit; }
     void set_ivit(iv_iterator it) { _ivit = it; }
-    void reset_ivit() { _ivit = boost::none; }
+    void reset_ivit() { _ivit = std::nullopt; }
 };
 
 
@@ -162,7 +162,7 @@ class Nef_halfedge_2 {
     Halfedge_handle              opp, prv, nxt;
     Vertex_handle                _v;
     Face_handle                  _f;
-    boost::optional<fc_iterator> _fcit;
+    std::optional<fc_iterator> _fcit;
     Mark                         _m;
     GenPtr                       _i;
 public:
@@ -223,7 +223,7 @@ class Nef_halfedge_2 {
 
     fc_iterator fcit() const      { return *_fcit; }
     void set_fcit(fc_iterator it) { _fcit = it; }
-    void reset_fcit()             { _fcit = boost::none; }
+    void reset_fcit()             { _fcit = std::nullopt; }
 
     bool is_hole_entry() const
         /*{\Mop returns true iff |\Mvar| is entry point into a hole face
diff --git a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xy_3.h b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xy_3.h
index 99b71db68a11..7b944428601c 100644
--- a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xy_3.h
+++ b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xy_3.h
@@ -36,7 +36,7 @@ struct Exact_intersect_xy_2 <R,Cartesian_tag>
 
   typedef  boost::variant<Point_3, Segment_3> variant_type;
 
-  boost::optional<variant_type>
+  std::optional<variant_type>
   operator() (const Segment_3& s3, const Segment_3& t3)
    {  Point_2 p2, q2;
       Point_3 p3, q3;
@@ -55,18 +55,18 @@ struct Exact_intersect_xy_2 <R,Cartesian_tag>
       //       so all third components are faked!
       auto obj = intersection (s2,t2);
       if(! obj){
-        return boost::none;
+        return std::nullopt;
       }
       if (const Point_2* pi =  boost::get<Point_2>(&*obj))
       {
-        return boost::make_optional(variant_type(Point_3(p2.x(),p2.y(),0)));
+        return std::make_optional(variant_type(Point_3(p2.x(),p2.y(),0)));
       }
 
       const Segment_2* si = boost::get<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
-      return boost::make_optional(variant_type(Segment_3(Point_3(p2.x(),p2.y(),0),
+      return std::make_optional(variant_type(Segment_3(Point_3(p2.x(),p2.y(),0),
                                                          Point_3(q2.x(),q2.y(),0) ) ));
    }
 };
@@ -82,7 +82,7 @@ struct Exact_intersect_xy_2 <R,Homogeneous_tag>
 
    typedef  boost::variant<Point_3, Segment_3> variant_type;
 
-   boost::optional<variant_type> operator() (Segment_3 s3, Segment_3 t3)
+   std::optional<variant_type> operator() (Segment_3 s3, Segment_3 t3)
    {  Point_2 p2, q2;
       Point_3 p3, q3;
 
@@ -102,18 +102,18 @@ struct Exact_intersect_xy_2 <R,Homogeneous_tag>
       //       so all third components are faked!
       auto obj = intersection (s2,t2);
       if(! obj){
-        return boost::none;
+        return std::nullopt;
       }
       if (const Point_2* pi =  boost::get<Point_2>(&*obj))
       {
-        return boost::make_optional(variant_type(Point_3(p2.hx(),p2.hy(),0,p2.hw())));
+        return std::make_optional(variant_type(Point_3(p2.hx(),p2.hy(),0,p2.hw())));
       }
 
       const Segment_2* si = boost::get<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
-      return boost::make_optional(variant_type(Segment_3(Point_3 (p2.hx(),p2.hy(),0,p2.hw()),
+      return std::make_optional(variant_type(Segment_3(Point_3 (p2.hx(),p2.hy(),0,p2.hw()),
                                                          Point_3 (q2.hx(),q2.hy(),0,q2.hw())) ));
    }
 };
diff --git a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xz_3.h b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xz_3.h
index 7d77eaae669d..773295292490 100644
--- a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xz_3.h
+++ b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xz_3.h
@@ -35,7 +35,7 @@ struct Exact_intersect_xz_2 <R,Cartesian_tag>
 
    typedef  boost::variant<Point_3, Segment_3> variant_type;
 
-   boost::optional<variant_type>
+   std::optional<variant_type>
    operator() (const Segment_3& s3, const Segment_3& t3)
    {  Point_2 p2, q2;
       Point_3 p3, q3;
@@ -54,18 +54,18 @@ struct Exact_intersect_xz_2 <R,Cartesian_tag>
       //       so all third components are faked!
       auto obj = intersection (s2,t2);
       if(! obj){
-        return boost::none;
+        return std::nullopt;
       }
       if (const Point_2* pi =  boost::get<Point_2>(&*obj))
       {
-        return boost::make_optional(variant_type(Point_3(p2.x(),0,p2.y())));
+        return std::make_optional(variant_type(Point_3(p2.x(),0,p2.y())));
       }
 
       const Segment_2* si = boost::get<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
-      return boost::make_optional(variant_type(Segment_3(Point_3(p2.x(),0,p2.y()),
+      return std::make_optional(variant_type(Segment_3(Point_3(p2.x(),0,p2.y()),
                                                          Point_3(q2.x(),0,q2.y()) ) ));
    }
 };
@@ -81,7 +81,7 @@ struct Exact_intersect_xz_2 <R,Homogeneous_tag>
 
    typedef  boost::variant<Point_3, Segment_3> variant_type;
 
-   boost::optional<variant_type> operator() (Segment_3 s3, Segment_3 t3)
+   std::optional<variant_type> operator() (Segment_3 s3, Segment_3 t3)
    {  Point_2 p2, q2;
       Point_3 p3, q3;
 
@@ -101,18 +101,18 @@ struct Exact_intersect_xz_2 <R,Homogeneous_tag>
       //       so all third components are faked!
       auto obj = intersection (s2,t2);
       if(! obj){
-        return boost::none;
+        return std::nullopt;
       }
       if (const Point_2* pi =  boost::get<Point_2>(&*obj))
       {
-        return boost::make_optional(variant_type(Point_3(p2.hx(),0,p2.hy(),p2.hw())));
+        return std::make_optional(variant_type(Point_3(p2.hx(),0,p2.hy(),p2.hw())));
       }
 
       const Segment_2* si = boost::get<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
-      return boost::make_optional(variant_type(Segment_3(Point_3 (p2.hx(),0,p2.hy(),p2.hw()),
+      return std::make_optional(variant_type(Segment_3(Point_3 (p2.hx(),0,p2.hy(),p2.hw()),
                                                          Point_3 (q2.hx(),0,q2.hy(),q2.hw())) ));
    }
 
diff --git a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_yz_3.h b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_yz_3.h
index a98b74fd1443..ac2007ce5565 100644
--- a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_yz_3.h
+++ b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_yz_3.h
@@ -36,7 +36,7 @@ struct Exact_intersect_yz_2 <R,Cartesian_tag>
 
    typedef  boost::variant<Point_3, Segment_3> variant_type;
 
-   boost::optional<variant_type>
+   std::optional<variant_type>
    operator() (const Segment_3& s3, const Segment_3& t3)
    {  Point_2 p2, q2;
       Point_3 p3, q3;
@@ -55,18 +55,18 @@ struct Exact_intersect_yz_2 <R,Cartesian_tag>
       //       so all third components are faked!
       auto obj = intersection (s2,t2);
       if(! obj){
-        return boost::none;
+        return std::nullopt;
       }
       if (const Point_2* pi =  boost::get<Point_2>(&*obj))
       {
-        return boost::make_optional(variant_type(Point_3(0,p2.x(),p2.y())));
+        return std::make_optional(variant_type(Point_3(0,p2.x(),p2.y())));
       }
 
       const Segment_2* si = boost::get<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
-      return boost::make_optional(variant_type(Segment_3(Point_3(0,p2.x(),p2.y()),
+      return std::make_optional(variant_type(Segment_3(Point_3(0,p2.x(),p2.y()),
                                                          Point_3(0,q2.x(),q2.y()) ) ));
    }
 };
@@ -82,7 +82,7 @@ struct Exact_intersect_yz_2 <R,Homogeneous_tag>
 
    typedef  boost::variant<Point_3, Segment_3> variant_type;
 
-   boost::optional<variant_type> operator() (Segment_3 s3, Segment_3 t3)
+   std::optional<variant_type> operator() (Segment_3 s3, Segment_3 t3)
    {  Point_2 p2, q2;
       Point_3 p3, q3;
 
@@ -102,18 +102,18 @@ struct Exact_intersect_yz_2 <R,Homogeneous_tag>
       //       so all third components are faked!
       auto obj = intersection (s2,t2);
       if(! obj){
-        return boost::none;
+        return std::nullopt;
       }
       if (const Point_2* pi =  boost::get<Point_2>(&*obj))
       {
-        return boost::make_optional(variant_type(Point_3(0,p2.hx(),p2.hy(),p2.hw())));
+        return std::make_optional(variant_type(Point_3(0,p2.hx(),p2.hy(),p2.hw())));
       }
 
       const Segment_2* si = boost::get<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
-      return boost::make_optional(variant_type(Segment_3(Point_3 (0,p2.hx(),p2.hy(),p2.hw()),
+      return std::make_optional(variant_type(Segment_3(Point_3 (0,p2.hx(),p2.hy(),p2.hw()),
                                                          Point_3 (0,q2.hx(),q2.hy(),q2.hw())) ));
    }
 };
diff --git a/Nef_3/include/CGAL/Nef_3/SNC_structure.h b/Nef_3/include/CGAL/Nef_3/SNC_structure.h
index 27a3c5c414d7..8806122cadb6 100644
--- a/Nef_3/include/CGAL/Nef_3/SNC_structure.h
+++ b/Nef_3/include/CGAL/Nef_3/SNC_structure.h
@@ -34,7 +34,7 @@
 #include <CGAL/Nef_2/debug.h>
 #include <CGAL/Nef_2/Object_index.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/none.hpp>
 
 namespace CGAL {
@@ -384,13 +384,13 @@ the local graph or added for the comfort of the user.}*/
   expensive operation.}*/
 
   SNC_structure() :
-    boundary_item_(boost::none), sm_boundary_item_(boost::none),
+    boundary_item_(std::nullopt), sm_boundary_item_(std::nullopt),
     vertices_(), halfedges_(), halffacets_(), volumes_(),
     shalfedges_(), shalfloops_(), sfaces_() {}
   ~SNC_structure() { CGAL_NEF_TRACEN("~SNC_structure: clearing "<<this); clear(); }
 
   SNC_structure(const Self& D) :
-    boundary_item_(boost::none), sm_boundary_item_(boost::none),
+    boundary_item_(std::nullopt), sm_boundary_item_(std::nullopt),
     vertices_(D.vertices_), halfedges_(D.halfedges_),
     halffacets_(D.halffacets_), volumes_(D.volumes_),
     shalfedges_(D.shalfedges_), shalfloops_(D.shalfloops_),
@@ -401,8 +401,8 @@ the local graph or added for the comfort of the user.}*/
     if ( this == &D )
       return *this;
     clear();
-    boundary_item_.clear(boost::none);
-    sm_boundary_item_.clear(boost::none);
+    boundary_item_.clear(std::nullopt);
+    sm_boundary_item_.clear(std::nullopt);
     vertices_ = D.vertices_;
     halfedges_ = D.halfedges_;
     halffacets_ = D.halffacets_;
@@ -419,17 +419,17 @@ the local graph or added for the comfort of the user.}*/
   }
 
   void clear_boundary() {
-    boundary_item_.clear(boost::none);
-    sm_boundary_item_.clear(boost::none);
+    boundary_item_.clear(std::nullopt);
+    sm_boundary_item_.clear(std::nullopt);
   }
 
   void clear_snc_boundary() {
-    boundary_item_.clear(boost::none);
+    boundary_item_.clear(std::nullopt);
   }
 
   void clear() {
-    boundary_item_.clear(boost::none);
-    sm_boundary_item_.clear(boost::none);
+    boundary_item_.clear(std::nullopt);
+    sm_boundary_item_.clear(std::nullopt);
     vertices_.destroy();
     halfedges_.destroy();
     halffacets_.destroy();
@@ -441,10 +441,10 @@ the local graph or added for the comfort of the user.}*/
 
   template <typename H>
   bool is_boundary_object(H h) const
-  { return boundary_item_[h]!=boost::none; }
+  { return boundary_item_[h]!=std::nullopt; }
   template <typename H>
   bool is_sm_boundary_object(H h) const
-  { return sm_boundary_item_[h]!=boost::none; }
+  { return sm_boundary_item_[h]!=std::nullopt; }
 
   template <typename H>
   Object_iterator& boundary_item(H h)
@@ -462,12 +462,12 @@ the local graph or added for the comfort of the user.}*/
 
   template <typename H>
   void undef_boundary_item(H h)
-  { CGAL_assertion(boundary_item_[h]!=boost::none);
-    boundary_item_[h] = boost::none; }
+  { CGAL_assertion(boundary_item_[h]!=std::nullopt);
+    boundary_item_[h] = std::nullopt; }
   template <typename H>
   void undef_sm_boundary_item(H h)
-  { CGAL_assertion(sm_boundary_item_[h]!=boost::none);
-    sm_boundary_item_[h] = boost::none; }
+  { CGAL_assertion(sm_boundary_item_[h]!=std::nullopt);
+    sm_boundary_item_[h] = std::nullopt; }
 
   void reset_iterator_hash(Object_iterator it)
   { SVertex_handle sv;
@@ -1035,7 +1035,7 @@ the local graph or added for the comfort of the user.}*/
 protected:
   void pointer_update(const Self& D);
 
-  typedef boost::optional<Object_iterator> Optional_object_iterator ;
+  typedef std::optional<Object_iterator> Optional_object_iterator ;
  private:
   Generic_handle_map<Optional_object_iterator> boundary_item_;
   Generic_handle_map<Optional_object_iterator> sm_boundary_item_;
diff --git a/Nef_S2/include/CGAL/Nef_S2/Sphere_map.h b/Nef_S2/include/CGAL/Nef_S2/Sphere_map.h
index 4c89dbf4ecd4..aaa74f14fe47 100644
--- a/Nef_S2/include/CGAL/Nef_S2/Sphere_map.h
+++ b/Nef_S2/include/CGAL/Nef_S2/Sphere_map.h
@@ -30,7 +30,7 @@
 #define CGAL_NEF_DEBUG 109
 #include <CGAL/Nef_2/debug.h>
 
-#include<boost/optional.hpp>
+#include<optional>
 #include<boost/none.hpp>
 
 namespace CGAL {
@@ -128,7 +128,7 @@ the HDS design of Kettner.}*/
   typedef std::list<Object_handle>                     Object_list;
   typedef typename Object_list::iterator               Object_iterator;
   typedef typename Object_list::const_iterator         Object_const_iterator;
-  typedef boost::optional<Object_iterator>             Optional_object_iterator ;
+  typedef std::optional<Object_iterator>             Optional_object_iterator ;
   typedef Generic_handle_map<Optional_object_iterator> Handle_to_iterator_map;
 
   typedef Sphere_map*       Constructor_parameter;
@@ -226,7 +226,7 @@ the HDS design of Kettner.}*/
   construction means cloning an isomorphic structure and is thus an
   expensive operation.}*/
 
-  Sphere_map(bool = false) : boundary_item_(boost::none),
+  Sphere_map(bool = false) : boundary_item_(std::nullopt),
     svertices_(), sedges_(), sfaces_(), shalfloop_() {}
 
   ~Sphere_map() noexcept(!CGAL_ASSERTIONS_ENABLED)
@@ -236,7 +236,7 @@ the HDS design of Kettner.}*/
     );
   }
 
-  Sphere_map(const Self& D) : boundary_item_(boost::none),
+  Sphere_map(const Self& D) : boundary_item_(std::nullopt),
     svertices_(D.svertices_),
     sedges_(D.sedges_),
     sfaces_(D.sfaces_),
@@ -258,7 +258,7 @@ the HDS design of Kettner.}*/
 
   void clear()
   {
-    boundary_item_.clear(boost::none);
+    boundary_item_.clear(std::nullopt);
     svertices_.destroy();
     sfaces_.destroy();
     while ( shalfedges_begin() != shalfedges_end() )
@@ -268,7 +268,7 @@ the HDS design of Kettner.}*/
 
   template <typename H>
   bool is_sm_boundary_object(H h) const
-  { return boundary_item_[h]!=boost::none; }
+  { return boundary_item_[h]!=std::nullopt; }
 
   template <typename H>
   Object_iterator& sm_boundary_item(H h)
@@ -280,8 +280,8 @@ the HDS design of Kettner.}*/
 
   template <typename H>
   void undef_sm_boundary_item(H h)
-  { CGAL_assertion(boundary_item_[h]!=boost::none);
-    boundary_item_[h] = boost::none; }
+  { CGAL_assertion(boundary_item_[h]!=std::nullopt);
+    boundary_item_[h] = std::nullopt; }
 
   void reset_sm_iterator_hash(Object_iterator it)
   { SVertex_handle sv;
diff --git a/Number_types/include/CGAL/Sqrt_extension/Sqrt_extension_type.h b/Number_types/include/CGAL/Sqrt_extension/Sqrt_extension_type.h
index c49303dd42da..4a562530c75a 100644
--- a/Number_types/include/CGAL/Sqrt_extension/Sqrt_extension_type.h
+++ b/Number_types/include/CGAL/Sqrt_extension/Sqrt_extension_type.h
@@ -32,7 +32,7 @@
 #include <boost/operators.hpp>
 #include <CGAL/Interval_arithmetic.h>
 #include <CGAL/Sqrt_extension_fwd.h>
-#include <boost/optional.hpp>
+#include <optional>
 #include <CGAL/NT_converter.h>
 
 #include <type_traits>
@@ -92,7 +92,7 @@ template <>
 class Interval_optional_caching< ::CGAL::Tag_true >
 {
 protected:
-  typedef boost::optional< std::pair<double,double> > Cached_interval;
+  typedef std::optional< std::pair<double,double> > Cached_interval;
   mutable Cached_interval interval_;
   void invalidate_interval() {interval_=Cached_interval();}
   bool is_cached() const {return (interval_?true:false);}
diff --git a/Optimal_transportation_reconstruction_2/include/CGAL/OTR_2/Reconstruction_triangulation_2.h b/Optimal_transportation_reconstruction_2/include/CGAL/OTR_2/Reconstruction_triangulation_2.h
index 16fe600bb345..fecb03e33a19 100644
--- a/Optimal_transportation_reconstruction_2/include/CGAL/OTR_2/Reconstruction_triangulation_2.h
+++ b/Optimal_transportation_reconstruction_2/include/CGAL/OTR_2/Reconstruction_triangulation_2.h
@@ -35,7 +35,7 @@
 #include <boost/multi_index/identity.hpp>
 #include <boost/multi_index/member.hpp>
 #include <boost/container/deque.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 // STL
 #include <map>
@@ -764,7 +764,7 @@ class Reconstruction_triangulation_2
 
   // signed distance from t to the intersection of line(a,b) and line(t,s)
   // the pair::first is false if sign==-1 and true otherwise
-  std::pair<bool,boost::optional<FT> >
+  std::pair<bool,std::optional<FT> >
   signed_distance_from_intersection(Vertex_handle a, Vertex_handle b,
       Vertex_handle t, Vertex_handle s) const {
     const Point& pa = a->point();
@@ -776,20 +776,20 @@ class Reconstruction_triangulation_2
 
   // signed distance from t to the intersection of line(a,b) and line(t,s)
   // the pair::first is false if sign==-1 and true otherwise
-  std::pair<bool,boost::optional<FT> >
+  std::pair<bool,std::optional<FT> >
   compute_signed_distance_from_intersection(
     const Point& pa, const Point& pb, const Point& pt, const Point& ps) const
   {
     FT Dabt = compute_signed_distance(pa, pb, pt);
     if (Dabt == FT(0))
-      return std::make_pair(true,boost::make_optional(FT(0)));
+      return std::make_pair(true,std::make_optional(FT(0)));
 
     Line lab = geom_traits().construct_line_2_object()(
       pa, geom_traits().construct_vector_2_object()(pa, pb));
     Line lts = geom_traits().construct_line_2_object()(
       pt, geom_traits().construct_vector_2_object()(pt, ps));
 
-    boost::optional<FT> Dqt;
+    std::optional<FT> Dqt;
     const auto result = intersection(lab, lts);
     if (result)
     {
@@ -996,24 +996,24 @@ class Reconstruction_triangulation_2
     std::cout <<"( " << (edge).priority()  <<  ") ( " << a << " , " << b << " )" << std::endl;
   }
 
-  bool is_p_infinity(const std::pair<bool,boost::optional<FT> >& p) const
+  bool is_p_infinity(const std::pair<bool,std::optional<FT> >& p) const
   {
-    return p.first && p.second==boost::none;
+    return p.first && p.second==std::nullopt;
   }
 
-  bool is_m_infinity(const std::pair<bool,boost::optional<FT> >& p) const
+  bool is_m_infinity(const std::pair<bool,std::optional<FT> >& p) const
   {
-    return !p.first && p.second==boost::none;
+    return !p.first && p.second==std::nullopt;
   }
 
-  bool is_infinity(const std::pair<bool,boost::optional<FT> >& p) const
+  bool is_infinity(const std::pair<bool,std::optional<FT> >& p) const
   {
-    return p.second==boost::none;
+    return p.second==std::nullopt;
   }
 
-  std::pair<bool,boost::optional<FT> > m_infinity() const
+  std::pair<bool,std::optional<FT> > m_infinity() const
   {
-    return std::pair<bool,boost::optional<FT> >(false,boost::optional<FT>());
+    return std::pair<bool,std::optional<FT> >(false,std::optional<FT>());
   }
 
   template <class Iterator> // value_type = Edge
@@ -1028,9 +1028,9 @@ class Reconstruction_triangulation_2
       Edge ab = twin_edge(*it);
       Vertex_handle a = source_vertex(ab);
       Vertex_handle b = target_vertex(ab);
-      std::pair<bool,boost::optional<FT> > D = signed_distance_from_intersection(a, b, target, source);
+      std::pair<bool,std::optional<FT> > D = signed_distance_from_intersection(a, b, target, source);
       if (!D.first ) {
-        CGAL_assertion(D.second!=boost::none);
+        CGAL_assertion(D.second!=std::nullopt);
         multi_ind.insert(Rec_edge_2(ab, *D.second));
       }
     }
@@ -1053,11 +1053,11 @@ class Reconstruction_triangulation_2
       Vertex_handle c = target_vertex(bc);
       Vertex_handle d = target_vertex(cd);
 
-      std::pair<bool,boost::optional<FT> > Dac=m_infinity();
+      std::pair<bool,std::optional<FT> > Dac=m_infinity();
       if (a != c && is_triangle_ccw(a, b, c))
         Dac = signed_distance_from_intersection(a, c, target, source);
 
-      std::pair<bool,boost::optional<FT> > Dbd=m_infinity();
+      std::pair<bool,std::optional<FT> > Dbd=m_infinity();
       if (b != d && is_triangle_ccw(b, c, d))
         Dbd = signed_distance_from_intersection(b, d, target, source);
 
diff --git a/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h b/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
index a8936abb6ffd..4a644675add6 100644
--- a/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
+++ b/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
@@ -53,7 +53,7 @@
 #ifndef CGAL_NO_ASSERTIONS
 #  include <boost/math/special_functions/next.hpp> // for float_prior
 #endif
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/tuple/tuple.hpp>
 #include <boost/unordered_map.hpp>
 #include <boost/unordered_set.hpp>
@@ -2479,7 +2479,7 @@ change_ball_size(Vertex_handle& v, const FT squared_size, const bool special_bal
   const Bare_point p = cp(c3t3_.triangulation().point(v)); // intentional copy
 
   // Remove v from the set of corners
-  boost::optional<Corner_index> corner_index = boost::make_optional(false, Corner_index());
+  std::optional<Corner_index> corner_index = std::make_optional(false, Corner_index());
   if(c3t3_.is_in_complex(v))
   {
     corner_index = c3t3_.corner_index(v);
diff --git a/Point_set_processing_3/include/CGAL/Point_set_processing_3/internal/Voronoi_covariance_3/voronoi_covariance_3.h b/Point_set_processing_3/include/CGAL/Point_set_processing_3/internal/Voronoi_covariance_3/voronoi_covariance_3.h
index 93b3f93581ac..ad4badb0431c 100644
--- a/Point_set_processing_3/include/CGAL/Point_set_processing_3/internal/Voronoi_covariance_3/voronoi_covariance_3.h
+++ b/Point_set_processing_3/include/CGAL/Point_set_processing_3/internal/Voronoi_covariance_3/voronoi_covariance_3.h
@@ -166,7 +166,7 @@ namespace CGAL {
                       (planes.begin(),
                        planes.end(),
                        P,
-                       boost::make_optional(Point(CGAL::ORIGIN)));
+                       std::make_optional(Point(CGAL::ORIGIN)));
 
                     // apply f to the triangles on the boundary of P
                     for(typename boost::graph_traits<Polyhedron>::face_descriptor fd : faces(P))
diff --git a/Point_set_processing_3/include/CGAL/structure_point_set.h b/Point_set_processing_3/include/CGAL/structure_point_set.h
index 58b3cbee86d0..335ba8226471 100644
--- a/Point_set_processing_3/include/CGAL/structure_point_set.h
+++ b/Point_set_processing_3/include/CGAL/structure_point_set.h
@@ -58,8 +58,8 @@ is a vertex). The implementation follow \cgalCite{cgal:la-srpss-13}.
 \tparam Kernel a model of `EfficientRANSACTraits` that must provide in
 addition a function `Intersect_3 intersection_3_object() const` and a
 functor `Intersect_3` with:
-- `boost::optional< boost::variant< Traits::Plane_3, Traits::Line_3 > > operator()(typename Traits::Plane_3, typename Traits::Plane_3)`
-- `boost::optional< boost::variant< Traits::Line_3, Traits::Point_3 > > operator()(typename Traits::Line_3, typename Traits::Plane_3)`
+- `std::optional< boost::variant< Traits::Plane_3, Traits::Line_3 > > operator()(typename Traits::Plane_3, typename Traits::Plane_3)`
+- `std::optional< boost::variant< Traits::Line_3, Traits::Point_3 > > operator()(typename Traits::Line_3, typename Traits::Plane_3)`
 
 */
 template <typename Kernel>
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_mesh_union_and_intersection.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_mesh_union_and_intersection.cpp
index ffa6f9aeb2e1..9148d56bd07f 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_mesh_union_and_intersection.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_mesh_union_and_intersection.cpp
@@ -28,7 +28,7 @@ int main(int argc, char* argv[])
   }
 
   Mesh out_union, out_intersection;
-  std::array<boost::optional<Mesh*>, 4> output;
+  std::array<std::optional<Mesh*>, 4> output;
   output[PMP::Corefinement::UNION] = &out_union;
   output[PMP::Corefinement::INTERSECTION] = &out_intersection;
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h
index 5167a240f18e..08068a664f37 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h
@@ -69,7 +69,7 @@ enum Boolean_operation_type {UNION = 0, INTERSECTION=1,
   * \ingroup PMP_corefinement_grp
   *
   * \link coref_def_subsec corefines \endlink `tm1` and `tm2` and for each triangle mesh `tm_out` passed
-  * as an optional in `output` different from `boost::none`, the triangulated surface mesh
+  * as an optional in `output` different from `std::nullopt`, the triangulated surface mesh
   * \link coref_def_subsec bounding \endlink  the result of a particular Boolean operation
   * between the volumes bounded by `tm1` and `tm2` will be put in the corresponding triangle mesh.
   * The positions of the meshes in the array `output` are specific to the Boolean operation to compute
@@ -186,7 +186,7 @@ std::array<bool,4>
 corefine_and_compute_boolean_operations(
         TriangleMesh& tm1,
         TriangleMesh& tm2,
-  const std::array< boost::optional<TriangleMesh*>,4>& output,
+  const std::array< std::optional<TriangleMesh*>,4>& output,
   const NamedParameters1& np1 = parameters::default_values(),
   const NamedParameters2& np2 = parameters::default_values(),
   const std::tuple<NamedParametersOut0,
@@ -229,10 +229,10 @@ corefine_and_compute_boolean_operations(
   > VPM_out_tuple_helper;
 
   typedef std::tuple<
-    boost::optional< typename std::tuple_element<0, VPM_out_tuple_helper>::type::type >,
-    boost::optional< typename std::tuple_element<1, VPM_out_tuple_helper>::type::type >,
-    boost::optional< typename std::tuple_element<2, VPM_out_tuple_helper>::type::type >,
-    boost::optional< typename std::tuple_element<3, VPM_out_tuple_helper>::type::type >
+    std::optional< typename std::tuple_element<0, VPM_out_tuple_helper>::type::type >,
+    std::optional< typename std::tuple_element<1, VPM_out_tuple_helper>::type::type >,
+    std::optional< typename std::tuple_element<2, VPM_out_tuple_helper>::type::type >,
+    std::optional< typename std::tuple_element<3, VPM_out_tuple_helper>::type::type >
   > VPM_out_tuple;
 
   VPM_out_tuple vpm_out_tuple(
@@ -251,24 +251,24 @@ corefine_and_compute_boolean_operations(
     // for now edges in a coplanar patch are not constrained so there is nothing to constrained here
     // \todo marked edges from input to output are not ported
 
-    if (output[Corefinement::UNION] != boost::none)
+    if (output[Corefinement::UNION] != std::nullopt)
       if (&tm1 != *output[Corefinement::UNION])
         copy_face_graph(tm1,
             *(*output[Corefinement::UNION]),
                         parameters::vertex_point_map(vpm1),
                         parameters::vertex_point_map(*std::get<Corefinement::UNION>(vpm_out_tuple)));
-    if (output[Corefinement::INTERSECTION] != boost::none)
+    if (output[Corefinement::INTERSECTION] != std::nullopt)
       if (&tm1 != *output[Corefinement::INTERSECTION])
         copy_face_graph(tm1,
                         *(*output[Corefinement::INTERSECTION]),
                         parameters::vertex_point_map(vpm1),
                         parameters::vertex_point_map(*std::get<Corefinement::INTERSECTION>(vpm_out_tuple)));
 
-    if (output[Corefinement::TM1_MINUS_TM2] != boost::none)
+    if (output[Corefinement::TM1_MINUS_TM2] != std::nullopt)
       if (&tm1 == *output[Corefinement::TM1_MINUS_TM2])
         clear(tm1);
 
-    if (output[Corefinement::TM2_MINUS_TM1] != boost::none)
+    if (output[Corefinement::TM2_MINUS_TM1] != std::nullopt)
       if (&tm1 == *output[Corefinement::TM2_MINUS_TM1])
         clear(tm1);
 
@@ -281,22 +281,22 @@ corefine_and_compute_boolean_operations(
     if(faces(tm2).empty())
     {
       for (int i=0; i<4; ++i)
-        if (output[i] != boost::none)
+        if (output[i] != std::nullopt)
           clear(*(*output[i]));
       return CGAL::make_array(true, true, true, true);
     }
     // tm2 is not empty
-    if (output[Corefinement::UNION] != boost::none)
+    if (output[Corefinement::UNION] != std::nullopt)
       if (&tm2 != *output[Corefinement::UNION])
         copy_face_graph(tm2,
                         *(*output[Corefinement::UNION]),
                         parameters::vertex_point_map(vpm2),
                         parameters::vertex_point_map(*std::get<Corefinement::UNION>(vpm_out_tuple)));
-    if (output[Corefinement::INTERSECTION] != boost::none)
+    if (output[Corefinement::INTERSECTION] != std::nullopt)
       clear(*(*output[Corefinement::INTERSECTION]));
-    if (output[Corefinement::TM1_MINUS_TM2] != boost::none)
+    if (output[Corefinement::TM1_MINUS_TM2] != std::nullopt)
       clear(*(*output[Corefinement::TM1_MINUS_TM2]));
-    if (output[Corefinement::TM2_MINUS_TM1] != boost::none)
+    if (output[Corefinement::TM2_MINUS_TM1] != std::nullopt)
       if (&tm2 != *output[Corefinement::TM2_MINUS_TM1])
         copy_face_graph(tm2,
                         *(*output[Corefinement::TM2_MINUS_TM1]),
@@ -308,17 +308,17 @@ corefine_and_compute_boolean_operations(
     if (faces(tm2).empty())
     {
       // tm1 is not empty
-      if (output[Corefinement::UNION] != boost::none)
+      if (output[Corefinement::UNION] != std::nullopt)
         if (&tm1 != *output[Corefinement::UNION])
           copy_face_graph(tm1,
                           *(*output[Corefinement::UNION]),
                           parameters::vertex_point_map(vpm1),
                           parameters::vertex_point_map(*std::get<Corefinement::UNION>(vpm_out_tuple)));
-      if (output[Corefinement::INTERSECTION] != boost::none)
+      if (output[Corefinement::INTERSECTION] != std::nullopt)
         clear(*(*output[Corefinement::INTERSECTION]));
-      if (output[Corefinement::TM2_MINUS_TM1] != boost::none)
+      if (output[Corefinement::TM2_MINUS_TM1] != std::nullopt)
         clear(*(*output[Corefinement::TM2_MINUS_TM1]));
-      if (output[Corefinement::TM1_MINUS_TM2] != boost::none)
+      if (output[Corefinement::TM1_MINUS_TM2] != std::nullopt)
         if (&tm1 != *output[Corefinement::TM1_MINUS_TM2])
           copy_face_graph(tm1,
                           *(*output[Corefinement::TM1_MINUS_TM2]),
@@ -394,10 +394,10 @@ corefine_and_compute_boolean_operations(
   // special case used for clipping open meshes
   if (choose_parameter(get_parameter(np1, internal_np::use_bool_op_to_clip_surface), false))
   {
-    CGAL_assertion(output[Corefinement::INTERSECTION] != boost::none);
-    CGAL_assertion(output[Corefinement::UNION] == boost::none);
-    CGAL_assertion(output[Corefinement::TM1_MINUS_TM2] == boost::none);
-    CGAL_assertion(output[Corefinement::TM2_MINUS_TM1] == boost::none);
+    CGAL_assertion(output[Corefinement::INTERSECTION] != std::nullopt);
+    CGAL_assertion(output[Corefinement::UNION] == std::nullopt);
+    CGAL_assertion(output[Corefinement::TM1_MINUS_TM2] == std::nullopt);
+    CGAL_assertion(output[Corefinement::TM2_MINUS_TM1] == std::nullopt);
     const bool use_compact_clipper =
       choose_parameter(get_parameter(np1, internal_np::use_compact_clipper), true);
     ob.setup_for_clipping_a_surface(use_compact_clipper);
@@ -523,7 +523,7 @@ corefine_and_compute_union(      TriangleMesh& tm1,
                            const NamedParametersOut& np_out = parameters::default_values())
 {
   using namespace CGAL::parameters;
-  std::array< boost::optional<TriangleMesh*>,4> output;
+  std::array< std::optional<TriangleMesh*>,4> output;
   output[Corefinement::UNION]=&tm_out;
 
   return
@@ -555,7 +555,7 @@ corefine_and_compute_intersection(      TriangleMesh& tm1,
                                   const NamedParametersOut& np_out = parameters::default_values())
 {
   using namespace CGAL::parameters;
-  std::array< boost::optional<TriangleMesh*>,4> output;
+  std::array< std::optional<TriangleMesh*>,4> output;
   output[Corefinement::INTERSECTION]=&tm_out;
 
   return
@@ -588,7 +588,7 @@ corefine_and_compute_difference(      TriangleMesh& tm1,
 {
   using namespace CGAL::parameters;
   using namespace CGAL::Polygon_mesh_processing::Corefinement;
-  std::array< boost::optional<TriangleMesh*>,4> output;
+  std::array< std::optional<TriangleMesh*>,4> output;
   output[TM1_MINUS_TM2]=&tm_out;
 
   return
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Face_graph_output_builder.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Face_graph_output_builder.h
index 89a3cd82904b..3e536e1c19da 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Face_graph_output_builder.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/Face_graph_output_builder.h
@@ -181,7 +181,7 @@ class Face_graph_output_builder
   Node_id_map vertex_to_node_id1, vertex_to_node_id2;
 
   // output meshes
-  const std::array<boost::optional<TriangleMesh*>, 4>& requested_output;
+  const std::array<std::optional<TriangleMesh*>, 4>& requested_output;
   // input meshes closed ?
   /// \todo do we really need this?
   bool is_tm1_closed;
@@ -411,7 +411,7 @@ class Face_graph_output_builder
                             const VpmOutTuple& output_vpms,
                             EdgeMarkMapTuple& out_edge_mark_maps,
                             UserVisitor& user_visitor,
-                            const std::array<boost::optional<TriangleMesh*>, 4 >& requested_output)
+                            const std::array<std::optional<TriangleMesh*>, 4 >& requested_output)
     : tm1(tm1), tm2(tm2)
     , vpm1(vpm1), vpm2(vpm2)
     , fids1(fids1), fids2(fids2)
@@ -513,10 +513,10 @@ class Face_graph_output_builder
     const boost::dynamic_bitset<>& is_node_of_degree_one,
     const Mesh_to_map_node&)
   {
-    const bool used_to_classify_patches =  requested_output[UNION]==boost::none &&
-                                           requested_output[TM1_MINUS_TM2]==boost::none &&
-                                           requested_output[TM2_MINUS_TM1]==boost::none &&
-                                           requested_output[INTERSECTION]==boost::none;
+    const bool used_to_classify_patches =  requested_output[UNION]==std::nullopt &&
+                                           requested_output[TM1_MINUS_TM2]==std::nullopt &&
+                                           requested_output[TM2_MINUS_TM1]==std::nullopt &&
+                                           requested_output[INTERSECTION]==std::nullopt;
 
     CGAL_assertion( vertex_to_node_id1.size() <= nodes.size() );
     CGAL_assertion( vertex_to_node_id2.size() <= nodes.size() );
@@ -1661,8 +1661,8 @@ class Face_graph_output_builder
         // special code to handle non-manifold vertices on the boundary
         for (vertex_descriptor vd : vertices(tm1))
         {
-          boost::optional<halfedge_descriptor> op_h = is_border(vd, tm1);
-          if (op_h == boost::none) continue;
+          std::optional<halfedge_descriptor> op_h = is_border(vd, tm1);
+          if (op_h == std::nullopt) continue;
           halfedge_descriptor h = *op_h;
           CGAL_assertion( target(h, tm1) == vd);
           // check if the target of h is a non-manifold vertex
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
index ee3d3159491a..9bc653058063 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
@@ -399,20 +399,20 @@ struct TweakedGetVertexPointMap
 };
 
 template <class PT, class NP, class PM>
-boost::optional< typename TweakedGetVertexPointMap<PT, NP, PM>::type >
-get_vpm(const NP& np, boost::optional<PM*> opm, std::true_type)
+std::optional< typename TweakedGetVertexPointMap<PT, NP, PM>::type >
+get_vpm(const NP& np, std::optional<PM*> opm, std::true_type)
 {
-  if (boost::none == opm) return boost::none;
+  if (std::nullopt == opm) return std::nullopt;
   return parameters::choose_parameter(
            parameters::get_parameter(np, internal_np::vertex_point),
            get_property_map(boost::vertex_point, *(*opm)) );
 }
 
 template <class PT, class NP, class PM>
-boost::optional< typename TweakedGetVertexPointMap<PT, NP, PM>::type >
-get_vpm(const NP&, boost::optional<PM*> opm, std::false_type)
+std::optional< typename TweakedGetVertexPointMap<PT, NP, PM>::type >
+get_vpm(const NP&, std::optional<PM*> opm, std::false_type)
 {
-  if (boost::none == opm) return boost::none;
+  if (std::nullopt == opm) return std::nullopt;
   return typename TweakedGetVertexPointMap<PT, NP, PM>::type();
 }
 //
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
index 81f3ca6478db..468acfaf5b47 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
@@ -266,7 +266,7 @@ class Intersection_nodes<TriangleMesh, VertexPointMap1, VertexPointMap2, true, f
                to_exact( get(vpm, target(next(h3,tm),tm))));
     const auto inter_res = exact_intersection(p1, p2, p3);
 
-    CGAL_assertion(inter_res != boost::none);
+    CGAL_assertion(inter_res != std::nullopt);
     const Exact_kernel::Point_3* pt =
       boost::get<Exact_kernel::Point_3>(&(*inter_res));
     CGAL_assertion(pt!=nullptr);
@@ -387,7 +387,7 @@ class Intersection_nodes<TriangleMesh, VertexPointMap1, VertexPointMap2,
                get(vpm, target(next(h3,tm),tm)));
     const auto inter_res = intersection(p1, p2, p3);
 
-    CGAL_assertion(inter_res != boost::none);
+    CGAL_assertion(inter_res != std::nullopt);
     const Point_3* pt =
       boost::get<Point_3>(&(*inter_res));
     CGAL_assertion(pt!=nullptr);
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/Triangulate_hole_polyline.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/Triangulate_hole_polyline.h
index 5e84ba9e6947..978ca2cd4b07 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/Triangulate_hole_polyline.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/Triangulate_hole_polyline.h
@@ -797,7 +797,7 @@ class Triangulate_hole_polyline_DT
     Triangulation tr;
     std::vector<bool> edge_exist;
     std::pair<int, int> range(0, n-1);
-    std::tuple<boost::optional<Edge>, bool, bool> res = construct_3D_triangulation(P, range, tr, edge_exist);
+    std::tuple<std::optional<Edge>, bool, bool> res = construct_3D_triangulation(P, range, tr, edge_exist);
     if(!std::get<2>(res)) {
 #ifdef CGAL_HOLE_FILLING_VERBOSE
       #ifndef CGAL_TEST_SUITE
@@ -944,14 +944,14 @@ class Triangulate_hole_polyline_DT
   }
 
   // returns [h.first-h.second edge, true if all edges inside 3D triangulation, true if tr.dimension() >= 2]
-  std::tuple<boost::optional<Edge>, bool, bool>
+  std::tuple<std::optional<Edge>, bool, bool>
   construct_3D_triangulation(const Polyline_3& P,
                              std::pair<int,int> h,
                              Triangulation& tr,
                              std::vector<bool>& edge_exist) const
   {
     // construct 3D tr with P[h.first], P[h.second] also assign ids from h.first to h.second
-    boost::optional<Edge> e;
+    std::optional<Edge> e;
     int n_border = h.second - h.first + 1;
     tr.insert(boost::make_transform_iterator(std::next(P.begin(), h.first), Auto_count(h.first)),
               boost::make_transform_iterator(std::next(P.begin(), h.second +1), Auto_count(h.first)));
@@ -999,7 +999,7 @@ class Triangulate_hole_polyline_DT
   *  + when switched to all-space, we use map based lookup tables.
   ************************************************************************/
   Weight fill_by_incomplete_patches(Triangulation& tr,
-                                    boost::optional<Edge> start_edge,
+                                    std::optional<Edge> start_edge,
                                     std::vector<bool>& edge_exist,
                                     const Polyline_3& P,
                                     const Polyline_3& Q,
@@ -1072,7 +1072,7 @@ class Triangulate_hole_polyline_DT
       // construct tr for next coming hole
       h = remaining_holes.back();
       tr.clear();
-      std::tuple<boost::optional<Edge>, bool, bool> res = construct_3D_triangulation(P, h, tr, edge_exist);
+      std::tuple<std::optional<Edge>, bool, bool> res = construct_3D_triangulation(P, h, tr, edge_exist);
       if(!std::get<0>(res)) {
 #ifdef CGAL_HOLE_FILLING_VERBOSE
         CGAL_warning_msg(false, "Returning no output. Filling hole with incomplete patches is not successful!");
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 9cdb76ac76b0..2a8c5551e90a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -43,7 +43,7 @@
 #include <boost/range/join.hpp>
 #include <memory>
 #include <boost/container/flat_set.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/property_map/function_property_map.hpp>
 
 #include <map>
@@ -1944,7 +1944,7 @@ namespace internal {
     bool check_normals(const HalfedgeRange& hedges) const
     {
       std::size_t nb_patches = patch_id_to_index_map.size();
-      //std::vector<boost::optional<Vector_3> > normal_per_patch(nb_patches,boost::none);
+      //std::vector<std::optional<Vector_3> > normal_per_patch(nb_patches,std::nullopt);
       std::vector<bool> initialized(nb_patches,false);
       std::vector<Vector_3> normal_per_patch(nb_patches);
 
@@ -1968,7 +1968,7 @@ namespace internal {
             return false;
           }
         }
-        //normal_per_patch[index] = boost::make_optional(n);
+        //normal_per_patch[index] = std::make_optional(n);
         normal_per_patch[index] = n;
         initialized[index] = true;
       }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Axis_parallel_plane_traits.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Axis_parallel_plane_traits.h
index 49cfea2a7247..92c5871d2909 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Axis_parallel_plane_traits.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Axis_parallel_plane_traits.h
@@ -14,7 +14,7 @@
 #include <CGAL/Bbox_3.h>
 #include <CGAL/array.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/variant.hpp>
 
 
@@ -96,7 +96,7 @@ class Axis_parallel_plane_traits
     const typename Traits::Construct_target_3 m_target_3;
 
     typedef boost::variant<typename Traits::Point_3, typename Traits::Segment_3> Variant_type;
-    typedef boost::optional< Variant_type > result_type;
+    typedef std::optional< Variant_type > result_type;
 
     Intersect_3(const Axis_parallel_plane_traits<Traits>& traits)
       : m_cst_coord(traits.m_cst_coord)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Side_of_triangle_mesh/Point_inside_vertical_ray_cast.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Side_of_triangle_mesh/Point_inside_vertical_ray_cast.h
index e282e092fa12..aabe4d201998 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Side_of_triangle_mesh/Point_inside_vertical_ray_cast.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Side_of_triangle_mesh/Point_inside_vertical_ray_cast.h
@@ -21,7 +21,7 @@
 #include <CGAL/point_generators_3.h>
 #include <CGAL/Origin.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/none.hpp>
 
 namespace CGAL {
@@ -78,9 +78,9 @@ class Point_inside_vertical_ray_cast
     //the direction of the vertical ray depends on the position of the point in the bbox
     //in order to limit the expected number of nodes visited.
     Ray query = ray_functor(point, vector_functor(0,0,(2*point.z() <  bbox.zmax()+bbox.zmin()?-1:1)));
-    boost::optional<Bounded_side> res = is_inside_ray_tree_traversal<true>(query, tree);
+    std::optional<Bounded_side> res = is_inside_ray_tree_traversal<true>(query, tree);
 
-    if(res == boost::none)
+    if(res == std::nullopt)
     {
       CGAL::Random rg(seed); // seed some value for make it easy to debug
       Random_points_on_sphere_3<Point> random_point(1.,rg);
@@ -88,14 +88,14 @@ class Point_inside_vertical_ray_cast
       do { //retry with a random ray
         query = ray_functor(point, vector_functor(CGAL::ORIGIN,*random_point++));
         res = is_inside_ray_tree_traversal<false>(query, tree);
-      } while (res == boost::none);
+      } while (res == std::nullopt);
     }
     return *res;
   }
 
 private:
   template<bool ray_is_vertical>
-  boost::optional<Bounded_side>
+  std::optional<Bounded_side>
   is_inside_ray_tree_traversal(const Ray& ray, const AABBTree& tree) const
   {
     std::pair<boost::logic::tribool,std::size_t>
@@ -114,7 +114,7 @@ class Point_inside_vertical_ray_cast
       //otherwise the point is on the facet
       return ON_BOUNDARY;
     }
-    return boost::optional<Bounded_side>(); // indeterminate
+    return std::optional<Bounded_side>(); // indeterminate
   }
 };
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h
index 9dea9e3b4c18..3ac7b6b08f80 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Smoothing/curvature_flow_impl.h
@@ -102,7 +102,7 @@ class Shape_smoother
         constrained_flags_[get(vimap_, v)] = true;
 
         // scaling things cannot preserve the position of more than a single constrained point
-        if(anchor_point == boost::none)
+        if(anchor_point == std::nullopt)
           anchor_point = get(vpmap_, v);
         else
           scale_volume_after_smoothing_ = false;
@@ -230,7 +230,7 @@ class Shape_smoother
 
     // If no vertex is constrained, then the smoothed mesh will share the same centroid as the input mesh
     Point pre_smooth_anchor_point;
-    if(anchor_point != boost::none)
+    if(anchor_point != std::nullopt)
       pre_smooth_anchor_point = *anchor_point;
     else
       pre_smooth_anchor_point = PMP::centroid(mesh_, parameters::vertex_point_map(vpmap_).geom_traits(traits_));
@@ -247,7 +247,7 @@ class Shape_smoother
     }
 
     Point post_smooth_anchor_point;
-    if(anchor_point != boost::none)
+    if(anchor_point != std::nullopt)
       post_smooth_anchor_point = *anchor_point;
     else
       post_smooth_anchor_point = PMP::centroid(mesh_, parameters::vertex_point_map(vpmap_).geom_traits(traits_));
@@ -364,7 +364,7 @@ class Shape_smoother
   // of the initial mesh if no vertex is constrained. If there is more than a constrained vertex,
   // then no scaling can be done without violating the constraint.
   bool scale_volume_after_smoothing_;
-  boost::optional<Point> anchor_point;
+  std::optional<Point> anchor_point;
 
   // linear system data
   std::vector<double> diagonal_; // index of vector -> index of vimap_
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
index 04e5cc6a1441..090f0c775e2d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
@@ -1846,7 +1846,7 @@ locate_with_AABB_tree(const typename internal::Location_traits<TriangleMesh, Nam
   typedef typename CGAL::AABB_traits<Geom_traits, Primitive>                                 AABB_traits;
   typedef AABB_tree<AABB_traits>                                                             AABB_face_graph_tree;
   typedef typename AABB_face_graph_tree::template Intersection_and_primitive_id<Ray_3>::Type Intersection_type;
-  typedef boost::optional<Intersection_type>                                                 Ray_intersection;
+  typedef std::optional<Intersection_type>                                                 Ray_intersection;
 
   using parameters::get_parameter;
   using parameters::choose_parameter;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h
index 798499f430b7..860ba20da7a9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h
@@ -197,7 +197,7 @@ bool is_collapse_geometrically_valid(typename boost::graph_traits<TriangleMesh>:
 
 // @todo handle boundary edges
 template <class TriangleMesh, typename VPM, typename Traits>
-boost::optional<typename Traits::FT>
+std::optional<typename Traits::FT>
 get_collapse_volume(typename boost::graph_traits<TriangleMesh>::halfedge_descriptor h,
                     const TriangleMesh& tmesh,
                     const VPM& vpm,
@@ -244,7 +244,7 @@ get_collapse_volume(typename boost::graph_traits<TriangleMesh>::halfedge_descrip
       Vector_3 n1 = gt.construct_cross_product_vector_3_object()(v_ar, v_ab);
       Vector_3 n2 = gt.construct_cross_product_vector_3_object()(v_ak, v_ab);
       if(gt.compute_scalar_product_3_object()(n1, n2) <= 0)
-        return boost::none;
+        return std::nullopt;
 
       delta_vol += volume(b, a, removed, origin) + volume(a, b, kept, origin); // opposite orientation
     }
@@ -268,27 +268,27 @@ get_best_edge_orientation(typename boost::graph_traits<TriangleMesh>::edge_descr
 
   halfedge_descriptor h = halfedge(e, tmesh), ho = opposite(h, tmesh);
 
-  boost::optional<FT> dv1 = get_collapse_volume(h, tmesh, vpm, gt);
-  boost::optional<FT> dv2 = get_collapse_volume(ho, tmesh, vpm, gt);
+  std::optional<FT> dv1 = get_collapse_volume(h, tmesh, vpm, gt);
+  std::optional<FT> dv2 = get_collapse_volume(ho, tmesh, vpm, gt);
 
   // the resulting point of the collapse of a halfedge is the target of the halfedge before collapse
   if(get(vcm, source(h, tmesh)))
-     return dv2 != boost::none ? ho
+     return dv2 != std::nullopt ? ho
                                : boost::graph_traits<TriangleMesh>::null_halfedge();
 
   if(get(vcm, target(h, tmesh)))
-     return dv1 != boost::none ? h
+     return dv1 != std::nullopt ? h
                                : boost::graph_traits<TriangleMesh>::null_halfedge();
 
-  if(dv1 != boost::none)
+  if(dv1 != std::nullopt)
   {
-    if(dv2 != boost::none)
+    if(dv2 != std::nullopt)
       return (*dv1 < *dv2) ? h : ho;
 
     return h;
   }
 
-  if(dv2 != boost::none)
+  if(dv2 != std::nullopt)
     return ho;
 
   return boost::graph_traits<TriangleMesh>::null_halfedge();
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h
index ff04ca9bfcca..56733b660fdd 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h
@@ -63,7 +63,7 @@ namespace CGAL {
 ///        - `Point_3`
 ///        - `Segment_3`
 ///        - `Oriented_side_3` with `Oriented_side operator()(Plane_3, Point_3)`
-///        - `Do_intersect_3` with `boost::optional<variant<Point_3,Segment_3> operator()(Plane_3,Segment_3)`
+///        - `Do_intersect_3` with `std::optional<variant<Point_3,Segment_3> operator()(Plane_3,Segment_3)`
 ///        - `Do_intersect_3` with `bool operator()(Plane_3, Bbox_3)`
 ///
 /// \todo If we keep the traits for plane orthogonal to a frame axis, `Traits` must also provide:
@@ -277,7 +277,7 @@ class Polygon_mesh_slicer
           get(m_vpmap,target(ed, m_tmesh))
         );
         const auto inter = intersect_3(m_plane, s);
-        CGAL_assertion(inter != boost::none);
+        CGAL_assertion(inter != std::nullopt);
         const Point_3* pt_ptr = boost::get<Point_3>(&(*inter));
         current_poly.push_back( *pt_ptr );
       }
diff --git a/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h b/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h
index c8a311a37aee..7a377a935c94 100644
--- a/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h
+++ b/Polygon_mesh_processing/include/CGAL/Polyhedral_envelope.h
@@ -825,7 +825,7 @@ struct Polyhedral_envelope {
     for (unsigned int i = 0; i < cutp.size(); i++){
       const Plane& plane_i = prism[cutp[i]];
 
-      boost::optional<ePoint_3> op = intersection_point_for_polyhedral_envelope(line, plane_i.eplane);
+      std::optional<ePoint_3> op = intersection_point_for_polyhedral_envelope(line, plane_i.eplane);
       if(! op){
         std::cout <<  "there must be an intersection 2" << std::endl;
       }
@@ -950,7 +950,7 @@ struct Polyhedral_envelope {
       }
 
       for (unsigned int j = 0; j < cidl.size(); j++) {
-        boost::optional<ePoint_3> op = intersection_point_for_polyhedral_envelope(line,
+        std::optional<ePoint_3> op = intersection_point_for_polyhedral_envelope(line,
                                                                                   halfspace[prismindex[queue[i]]][cidl[j]].eplane);
         const ePoint_3& ip = *op;
         inter = Implicit_Seg_Facet_interpoint_Out_Prism_return_local_id
@@ -1142,7 +1142,7 @@ struct Polyhedral_envelope {
           const Plane& plane_i = prism[cutp[i]];
           const eLine_3& eline = *(seg[k]);
 
-          boost::optional<ePoint_3> op = intersection_point_for_polyhedral_envelope(eline, plane_i.eplane);
+          std::optional<ePoint_3> op = intersection_point_for_polyhedral_envelope(eline, plane_i.eplane);
           if(! op){
 #ifdef CGAL_ENVELOPE_DEBUG
             std::cout <<  "there must be an intersection 6" << std::endl;
@@ -1227,7 +1227,7 @@ struct Polyhedral_envelope {
 
             }
 
-            boost::optional<ePoint_3>  ipp = intersection_point_for_polyhedral_envelope(tri_eplane, prism[cutp[i]].eplane, prism[cutp[j]].eplane);
+            std::optional<ePoint_3>  ipp = intersection_point_for_polyhedral_envelope(tri_eplane, prism[cutp[i]].eplane, prism[cutp[j]].eplane);
             if(ipp){
                 inter = is_3_triangle_cut_float_fast(etri0, etri1, etri2,
                                                      n,
@@ -1667,7 +1667,7 @@ struct Polyhedral_envelope {
           if (!cut) continue;
 
           for (unsigned int j = 0; j < cidl.size(); j++) {
-            boost::optional<ePoint_3> op = intersection_point_for_polyhedral_envelope(eline,
+            std::optional<ePoint_3> op = intersection_point_for_polyhedral_envelope(eline,
                                                                                       halfspace[prismindex[queue[i]]][cidl[j]].eplane);
             const ePoint_3& ip = *op;
             inter = Implicit_Seg_Facet_interpoint_Out_Prism_return_local_id(ip, idlist, jump1, check_id);
@@ -1751,7 +1751,7 @@ struct Polyhedral_envelope {
           }
           // now we know that there exists an intesection point
 
-          boost::optional<ePoint_3> op = intersection_point_for_polyhedral_envelope(eline,
+          std::optional<ePoint_3> op = intersection_point_for_polyhedral_envelope(eline,
                                                                                     halfspace[filtered_intersection[queue[i]]][intersect_face[queue[i]][j]].eplane);
           const ePoint_3& ip = *op;
 
@@ -1834,7 +1834,7 @@ struct Polyhedral_envelope {
 
             // We moved the intersection here
             // In case there is no intersection point we continue
-            boost::optional<ePoint_3>
+            std::optional<ePoint_3>
               op = intersection_point_for_polyhedral_envelope(etriangle_eplane,
                                                               halfspace[jump1][intersect_face[queue[i]][k]].eplane,
                                                               halfspace[jump2][intersect_face[queue[j]][h]].eplane);
@@ -2113,7 +2113,7 @@ struct Polyhedral_envelope {
     }
     ePoint_3 origin(env_vertices[env_faces[i][0]].x(), env_vertices[env_faces[i][0]].y(),env_vertices[env_faces[i][0]].z());
     Surface_mesh<ePoint_3> esm;
-    halfspace_intersection_3(eplanes.begin(),eplanes.end(),esm , boost::make_optional(origin));
+    halfspace_intersection_3(eplanes.begin(),eplanes.end(),esm , std::make_optional(origin));
 
     copy_face_graph(esm,sm);
   }
diff --git a/Polygon_mesh_processing/include/CGAL/Side_of_triangle_mesh.h b/Polygon_mesh_processing/include/CGAL/Side_of_triangle_mesh.h
index 89e281534089..eff54edea7c2 100644
--- a/Polygon_mesh_processing/include/CGAL/Side_of_triangle_mesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Side_of_triangle_mesh.h
@@ -99,7 +99,7 @@ class Side_of_triangle_mesh
   typename GeomTraits::Construct_ray_3     ray_functor;
   typename GeomTraits::Construct_vector_3  vector_functor;
   const TriangleMesh* tm_ptr;
-  boost::optional<VertexPointMap> opt_vpm;
+  std::optional<VertexPointMap> opt_vpm;
   bool own_tree;
   CGAL::Bbox_3 box;
 #ifdef CGAL_HAS_THREADS
@@ -255,7 +255,7 @@ class Side_of_triangle_mesh
         CGAL_SCOPED_LOCK(tree_mutex);
         tree_ptr = const_cast<AABB_tree_*>(atomic_tree_ptr.load(std::memory_order_relaxed));
 #endif
-        CGAL_assertion(tm_ptr != nullptr && opt_vpm!=boost::none);
+        CGAL_assertion(tm_ptr != nullptr && opt_vpm!=std::nullopt);
         if (tree_ptr==nullptr)
         {
           tree_ptr = new AABB_tree(faces(*tm_ptr).first,
@@ -297,7 +297,7 @@ class Side_of_triangle_mesh
       CGAL_SCOPED_LOCK(tree_mutex);
       tree_ptr = const_cast<AABB_tree_*>(atomic_tree_ptr.load(std::memory_order_relaxed));
 #endif
-      CGAL_assertion(tm_ptr != nullptr && opt_vpm!=boost::none);
+      CGAL_assertion(tm_ptr != nullptr && opt_vpm!=std::nullopt);
       if (tree_ptr==nullptr)
       {
         tree_ptr = new AABB_tree(faces(*tm_ptr).first,
diff --git a/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h b/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
index c12178a1b9cf..c171510f1f91 100644
--- a/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
+++ b/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
@@ -21,7 +21,7 @@
 
 #include <CGAL/Polyhedral_envelope.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <vector>
 #include <type_traits>
@@ -34,8 +34,8 @@ namespace internal {
   struct Dummy_filter2 {
   template <typename Profile>
   inline
-  const boost::optional<typename Profile::Point>
-  operator()(const Profile&, const boost::optional<typename Profile::Point>& op) const
+  const std::optional<typename Profile::Point>
+  operator()(const Profile&, const std::optional<typename Profile::Point>& op) const
   {
     return op;
   }
@@ -109,8 +109,8 @@ class Polyhedral_envelope_filter
 
 
   template <typename Profile>
-  boost::optional<typename Profile::Point>
-  operator()(const Profile& profile, boost::optional<typename Profile::Point> op) const
+  std::optional<typename Profile::Point>
+  operator()(const Profile& profile, std::optional<typename Profile::Point> op) const
   {
     typedef typename Profile::Point Point;
     typedef typename Profile::vertex_descriptor_vector Link;
@@ -127,7 +127,7 @@ class Polyhedral_envelope_filter
 
       if(! (*m_envelope)(p)){
         // the new placement is outside envelope
-        return boost::none;
+        return std::nullopt;
       }
 
       const Link link = profile.link();
@@ -141,7 +141,7 @@ class Polyhedral_envelope_filter
 
         if(! (*m_envelope)(p, pv, pw)){
           // the triangle intersects the envelope
-          return boost::none;
+          return std::nullopt;
         }
         pv = pw;
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
index 1eec758737e8..3f3af6c44ae1 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
@@ -164,11 +164,11 @@ void test_bool_op_no_copy(
   assert( count_constrained_edges(tm1, ecm1)==307 );
   assert( count_constrained_edges(tm2, ecm2)==307 );
 
-  typedef boost::optional<Triangle_mesh*> OTM;
+  typedef std::optional<Triangle_mesh*> OTM;
   Triangle_mesh *ptr = nullptr;
   const std::array<OTM,4> output =
-    reverse ? CGAL::make_array(OTM(&tm2), OTM(&tm1), boost::make_optional(false,ptr), boost::make_optional(false,ptr))
-            : CGAL::make_array(OTM(&tm1), OTM(&tm2), boost::make_optional(false,ptr), boost::make_optional(false,ptr));
+    reverse ? CGAL::make_array(OTM(&tm2), OTM(&tm1), std::make_optional(false,ptr), std::make_optional(false,ptr))
+            : CGAL::make_array(OTM(&tm1), OTM(&tm2), std::make_optional(false,ptr), std::make_optional(false,ptr));
   PMP::corefine_and_compute_boolean_operations(tm1,
                                                tm2,
                                                output,
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_bool_op.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_bool_op.cpp
index cc0123859967..a0f7679dc4c0 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_bool_op.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_bool_op.cpp
@@ -88,7 +88,7 @@ void run_boolean_operations(
 {
   std::cout << "Scenario #" << id << " - " << scenario << "\n";
 
-  typedef boost::optional<Surface_mesh*> OSM;
+  typedef std::optional<Surface_mesh*> OSM;
 
   std::array<OSM,4> output;
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
index 8aeaab049db5..17b357660082 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
@@ -27,7 +27,7 @@
 
 #include <boost/graph/graph_traits.hpp>
 #include <boost/graph/properties.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <fstream>
 #include <iostream>
@@ -393,8 +393,8 @@ void test_predicates(const G& g, CGAL::Random& rnd)
     loc.second[id_of_h] = FT(1);
     loc.second[(id_of_h+1)%3] = FT(0);
     loc.second[(id_of_h+2)%3] = FT(0);
-    boost::optional<halfedge_descriptor> opt_hd = CGAL::is_border(source(h, g), g);
-    assert(PMP::is_on_mesh_border<FT>(loc, g) == (opt_hd != boost::none));
+    std::optional<halfedge_descriptor> opt_hd = CGAL::is_border(source(h, g), g);
+    assert(PMP::is_on_mesh_border<FT>(loc, g) == (opt_hd != std::nullopt));
 
     loc.second[id_of_h] = FT(0.5);
     loc.second[(id_of_h+1)%3] = FT(0.5);
diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index b797ecf7a70e..fe7d8ddad06e 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -1267,7 +1267,7 @@ void MainWindow::open(QString filename)
 
 bool MainWindow::open(QString filename, QString loader_name) {
   QFileInfo fileinfo(filename);
-  boost::optional<bool> item_opt;
+  std::optional<bool> item_opt;
   try {
     item_opt = wrap_a_call_to_cpp
         ([this, fileinfo, loader_name]()
@@ -1890,7 +1890,7 @@ void MainWindow::closeEvent(QCloseEvent *event)
 bool MainWindow::loadScript(QString filename)
 {
   QFileInfo fileinfo(filename);
-  boost::optional<bool> opt = wrap_a_call_to_cpp
+  std::optional<bool> opt = wrap_a_call_to_cpp
       ([this, fileinfo] {
     return loadScript(fileinfo);
   }, this, __FILE__, __LINE__, CGAL::Three::PARENT_CONTEXT);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
index 68c3053d876b..4c13bccee7cb 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
@@ -67,7 +67,7 @@
 #include <CGAL/Three/Three.h>
 
 #include <boost/type_traits.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/filesystem.hpp>
 
 #include <cassert>
@@ -119,13 +119,13 @@ public Q_SLOTS:
   void x(QString);
 
 public:
-  void setIC(const IntConverter& x) { ic = x; fc = boost::optional<DoubleConverter>(); }
-  void setFC(const DoubleConverter& x) { fc = x; ic = boost::optional<IntConverter>(); }
+  void setIC(const IntConverter& x) { ic = x; fc = std::optional<DoubleConverter>(); }
+  void setFC(const DoubleConverter& x) { fc = x; ic = std::optional<IntConverter>(); }
   void setViewer(Viewer_interface* viewer) { this->viewer = viewer; }
 
 private:
-  boost::optional<IntConverter> ic;
-  boost::optional<DoubleConverter> fc;
+  std::optional<IntConverter> ic;
+  std::optional<DoubleConverter> fc;
   Viewer_interface* viewer;
   void getPixel(const QPoint& e)
   {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
index eb3ce6042ae9..da298acf6ff7 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
@@ -29,7 +29,7 @@ auto make_not_null(T&& t) {
 }
 
 #include <boost/variant/variant.hpp>
-#include <boost/optional/optional.hpp>
+#include <optional>
 #include "Scene_polylines_item.h"
 
 #ifdef CGAL_MESH_3_DEMO_ACTIVATE_IMPLICIT_FUNCTIONS
@@ -130,7 +130,7 @@ class Mesh_3_plugin :
   }
 
 public Q_SLOTS:
-  boost::optional<QString> get_items_or_return_error_string() const;
+  std::optional<QString> get_items_or_return_error_string() const;
   void set_defaults();
   void mesh_3_volume();
   void mesh_3_surface();
@@ -231,7 +231,7 @@ public Q_SLOTS:
     IMAGE_MESH_ITEMS,
     IMPLICIT_MESH_ITEMS
   };
-  mutable boost::optional<boost::variant<Polyhedral_mesh_items,
+  mutable std::optional<boost::variant<Polyhedral_mesh_items,
                                          Image_mesh_items,
                                          Implicit_mesh_items>>
       items;
@@ -277,7 +277,7 @@ void Mesh_3_plugin::mesh_3_volume()
   mesh_3(Mesh_type::VOLUME);
 }
 
-boost::optional<QString> Mesh_3_plugin::get_items_or_return_error_string() const
+std::optional<QString> Mesh_3_plugin::get_items_or_return_error_string() const
 {
   using boost::get;
   items = {};
@@ -355,7 +355,7 @@ boost::optional<QString> Mesh_3_plugin::get_items_or_return_error_string() const
   //attach polylines_item to one or the other item
   //if it could not be done in the for loop
   //because of selection order
-  if (polylines_item != nullptr && items != boost::none)
+  if (polylines_item != nullptr && items != std::nullopt)
   {
     auto poly_items_ptr = get<Polyhedral_mesh_items>(&*items);
     auto image_items_ptr = get<Image_mesh_items>(&*items);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp
index 6f2e1eed542b..a25fa8072f02 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp
@@ -23,7 +23,7 @@
 #include <algorithm>
 
 #include <CGAL/boost/iterator/transform_iterator.hpp>
-#include <boost/optional/optional.hpp>
+#include <optional>
 
 using namespace CGAL::Three;
 
@@ -189,11 +189,11 @@ public Q_SLOTS:
   void on_Sample_random_points_from_bbox() {
 
     // calculate bbox of selected polyhedron items
-    boost::optional<CGAL::Three::Scene_interface::Bbox> bbox
-      = boost::make_optional(false, CGAL::Three::Scene_interface::Bbox());
+    std::optional<CGAL::Three::Scene_interface::Bbox> bbox
+      = std::make_optional(false, CGAL::Three::Scene_interface::Bbox());
     // Workaround a bug in g++-4.8.3:
     //   https://stackoverflow.com/a/21755207/1728537
-    // Using boost::make_optional to copy-initialize 'bbox' hides the
+    // Using std::make_optional to copy-initialize 'bbox' hides the
     //   warning about '*bbox' not being initialized.
     // -- Laurent Rineau, 2014/10/30
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp
index 5f543518f2f8..f4134ecfd150 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp
@@ -497,7 +497,7 @@ public Q_SLOTS:
       return;
     }
 
-    boost::optional<std::size_t> minimum =
+    std::optional<std::size_t> minimum =
       selection_item->select_isolated_components(ui_widget.Threshold_size_spin_box->value());
     if(minimum) {
       ui_widget.Threshold_size_spin_box->setValue((int) *minimum);
@@ -512,7 +512,7 @@ public Q_SLOTS:
       print_message("Error: there is no selected polyhedron selection item!");
       return;
     }
-    boost::optional<std::size_t> minimum = selection_item->get_minimum_isolated_component();
+    std::optional<std::size_t> minimum = selection_item->get_minimum_isolated_component();
     if(minimum) {
       ui_widget.Threshold_size_spin_box->setValue((int) *minimum);
     }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp
index 9385ee2442ba..724ed194fc51 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp
@@ -309,7 +309,7 @@ void Polyhedron_demo_edit_polyhedron_plugin::on_Select_isolated_components_butto
   Scene_edit_polyhedron_item* edit_item = qobject_cast<Scene_edit_polyhedron_item*>(scene->item(item_id));
   if(!edit_item) return;                             // the selected item is not of the right type
 
-  boost::optional<std::size_t> minimum =
+  std::optional<std::size_t> minimum =
     edit_item->select_isolated_components(ui_widget.Threshold_size_spin_box->value());
   if(minimum) {
     ui_widget.Threshold_size_spin_box->setValue((int) *minimum);
@@ -321,7 +321,7 @@ void Polyhedron_demo_edit_polyhedron_plugin::on_Get_minimum_button_clicked() {
   Scene_edit_polyhedron_item* edit_item = qobject_cast<Scene_edit_polyhedron_item*>(scene->item(item_id));
   if(!edit_item) return;                             // the selected item is not of the right type
 
-  boost::optional<std::size_t> minimum = edit_item->get_minimum_isolated_component();
+  std::optional<std::size_t> minimum = edit_item->get_minimum_isolated_component();
   if(minimum) {
     ui_widget.Threshold_size_spin_box->setValue((int) *minimum);
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.cpp b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.cpp
index 28163a38043a..c4a060696cdb 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.cpp
@@ -1621,7 +1621,7 @@ void Scene_edit_polyhedron_item::reset_deform_object()
   refresh_all_group_centers();
 }
 
-boost::optional<std::size_t> Scene_edit_polyhedron_item::get_minimum_isolated_component() {
+std::optional<std::size_t> Scene_edit_polyhedron_item::get_minimum_isolated_component() {
   Travel_isolated_components<SMesh>::Minimum_visitor visitor;
   Travel_isolated_components<SMesh>(*surface_mesh()).travel<sm_vertex_descriptor>
       (vertices(*surface_mesh()).first, vertices(*surface_mesh()).second,
@@ -1630,7 +1630,7 @@ boost::optional<std::size_t> Scene_edit_polyhedron_item::get_minimum_isolated_co
 }
 
 
-boost::optional<std::size_t> Scene_edit_polyhedron_item::select_isolated_components(std::size_t threshold) {
+std::optional<std::size_t> Scene_edit_polyhedron_item::select_isolated_components(std::size_t threshold) {
     typedef boost::function_output_iterator<Select_roi_output<SMesh> > Output_iterator;
     Output_iterator out(d->deform_sm_mesh);
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.h b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.h
index 3fc7b02d1ddf..b78d140ffe3d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.h
@@ -379,7 +379,7 @@ public Q_SLOTS:
     }
   };
 
-  boost::optional<std::size_t> get_minimum_isolated_component();
+  std::optional<std::size_t> get_minimum_isolated_component();
   template<typename Mesh>
   struct Select_roi_output{
     typedef typename CGAL::Surface_mesh_deformation<Mesh, CGAL::Default, CGAL::Default, CGAL::ORIGINAL_ARAP
@@ -393,7 +393,7 @@ public Q_SLOTS:
     M_Deform_mesh* dm;
   };
 
-  boost::optional<std::size_t> select_isolated_components(std::size_t threshold) ;
+  std::optional<std::size_t> select_isolated_components(std::size_t threshold) ;
 
 protected:
   // Deformation related functions //
diff --git a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.h b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.h
index 8164cdacf8fc..15b6171cf287 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.h
@@ -289,14 +289,14 @@ friend class Polyhedron_demo_selection_plugin;
   {
     // Workaround a bug in g++-4.8.3:
     //   https://stackoverflow.com/a/21755207/1728537
-    // Using boost::make_optional to copy-initialize 'item_bbox' hides the
+    // Using std::make_optional to copy-initialize 'item_bbox' hides the
     //   warning about '*item_bbox' not being initialized.
     // -- Laurent Rineau, 2014/10/30
 
     constVPmap vpm = get(CGAL::vertex_point, *polyhedron());
 
-    boost::optional<CGAL::Bbox_3> item_bbox
-      = boost::make_optional(false, CGAL::Bbox_3());
+    std::optional<CGAL::Bbox_3> item_bbox
+      = std::make_optional(false, CGAL::Bbox_3());
 
 
     for(Selection_set_vertex::const_iterator v_it = selected_vertices.begin();
@@ -488,7 +488,7 @@ friend class Polyhedron_demo_selection_plugin;
     clear<fg_edge_descriptor>();
   }
 
-  boost::optional<std::size_t> get_minimum_isolated_component() {
+  std::optional<std::size_t> get_minimum_isolated_component() {
     switch(get_active_handle_type()) {
     case Active_handle::VERTEX:
       return get_minimum_isolated_component<fg_vertex_descriptor>();
@@ -499,7 +499,7 @@ friend class Polyhedron_demo_selection_plugin;
     }
   }
   template<class HandleType> // use fg_vertex_descriptor, fg_face_descriptor, fg_edge_descriptor
-  boost::optional<std::size_t> get_minimum_isolated_component() {
+  std::optional<std::size_t> get_minimum_isolated_component() {
     Selection_traits<HandleType, Scene_polyhedron_selection_item> tr(this);
     Travel_isolated_components<Face_graph>::Minimum_visitor visitor;
     Travel_isolated_components<Face_graph>(*polyhedron()).travel<HandleType>
@@ -507,7 +507,7 @@ friend class Polyhedron_demo_selection_plugin;
     return visitor.minimum;
   }
 
-  boost::optional<std::size_t> select_isolated_components(std::size_t threshold) {
+  std::optional<std::size_t> select_isolated_components(std::size_t threshold) {
     switch(get_active_handle_type()) {
     case Active_handle::VERTEX:
       return select_isolated_components<fg_vertex_descriptor>(threshold);
@@ -518,7 +518,7 @@ friend class Polyhedron_demo_selection_plugin;
     }
   }
   template<class HandleType> // use fg_vertex_descriptor, fg_face_descriptor, fg_edge_descriptor
-  boost::optional<std::size_t> select_isolated_components(std::size_t threshold) {
+  std::optional<std::size_t> select_isolated_components(std::size_t threshold) {
     typedef Selection_traits<HandleType, Scene_polyhedron_selection_item> Tr;
     Tr tr(this);
     typedef std::insert_iterator<typename Tr::Container> Output_iterator;
diff --git a/Polyhedron/demo/Polyhedron/Travel_isolated_components.h b/Polyhedron/demo/Polyhedron/Travel_isolated_components.h
index 5cdd2dfdeb92..c1e1124f6b22 100644
--- a/Polyhedron/demo/Polyhedron/Travel_isolated_components.h
+++ b/Polyhedron/demo/Polyhedron/Travel_isolated_components.h
@@ -1,7 +1,7 @@
 #ifndef TRAVEL_ISOLATED_COMPONENTS_H
 #define TRAVEL_ISOLATED_COMPONENTS_H
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <vector>
 #include "One_ring_iterators.h"
 #include <CGAL/Default.h>
diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
index 4722bcaa72c8..b945f7760173 100644
--- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
+++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
@@ -27,7 +27,7 @@ Given a vertex in constraint iterator `viq` computes `vip=std::prev(viq)` and `v
 
 \param ct The underlying constrained Delaunay triangulation which embeds the polyline constraints
 \param viq The vertex in constraint iterator of the vertex to remove
-\returns The cost for removing `*viq`. The value `boost::none` can be returned to indicate an infinite or uncomputable cost.
+\returns The cost for removing `*viq`. The value `std::nullopt` can be returned to indicate an infinite or uncomputable cost.
 
 \tparam CDT must be `CGAL::Constrained_triangulation_plus_2` with a vertex type that
 is model of `PolylineSimplificationVertexBase_2`. `CDT::Geom_traits` must be model of
@@ -35,7 +35,7 @@ the concept `ConstrainedDelaunayTriangulationTraits_2`.
 
 */
   template <typename CDT>
-  boost::optional<CDT::Geom_traits::FT>
+  std::optional<CDT::Geom_traits::FT>
   operator()(CGAL::Constrained_triangulation_plus_2<CDT> const& ct,
              CGAL::Constrained_triangulation_plus_2<CDT>::Vertices_in_constraint_iterator viq) const;}
 
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
index d7f169997b78..9af95a9e422b 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
@@ -49,7 +49,7 @@ class Hybrid_squared_distance_cost
   /// \tparam CDT  must be `CGAL::Constrained_Delaunay_triangulation_2` with a vertex type that
   /// is model of  `PolylineSimplificationVertexBase_2`.
  template<class CDT>
- boost::optional<typename CDT::Geom_traits::FT>
+ std::optional<typename CDT::Geom_traits::FT>
     operator()(  const Constrained_triangulation_plus_2<CDT>& pct
                  , typename Constrained_triangulation_plus_2<CDT>::Vertices_in_constraint_iterator vicq) const
   {
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
index 53ecf34cc6fc..9a5b53e4259a 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
@@ -44,7 +44,7 @@ class Scaled_squared_distance_cost
   /// \tparam CDT  must be `CGAL::Constrained_Delaunay_triangulation_2` with a vertex type that
   /// is model of  `PolylineSimplificationVertexBase_2`.
     template<class CDT>
-    boost::optional<typename CDT::Geom_traits::FT>
+    std::optional<typename CDT::Geom_traits::FT>
     operator()(const Constrained_triangulation_plus_2<CDT>& pct
                , typename Constrained_triangulation_plus_2<CDT>::Vertices_in_constraint_iterator vicq) const
   {
@@ -94,8 +94,8 @@ class Scaled_squared_distance_cost
     }while(vc != done);
 
     return d2_uninitialized ?
-      boost::optional<FT>(boost::none) :
-      boost::optional<FT>(d1 / d2);
+      std::optional<FT>(std::nullopt) :
+      std::optional<FT>(d1 / d2);
   }
 
 };
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
index 08ca152ddd0c..bf1badd8612d 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
@@ -50,7 +50,7 @@ class Squared_distance_cost
   /// is model of  `PolylineSimplificationVertexBase_2`.
 
     template<class CDT>
-    boost::optional<typename CDT::Geom_traits::FT>
+    std::optional<typename CDT::Geom_traits::FT>
     operator()(const Constrained_triangulation_plus_2<CDT>& pct
                , typename Constrained_triangulation_plus_2<CDT>::Vertices_in_constraint_iterator vicq)const
   {
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
index d5497788a02a..02552570841f 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
@@ -211,7 +211,7 @@ class Polyline_simplification_2
         it != pct.vertices_in_constraint_end(cid);
         ++it){
       if((*it)->is_removable()){
-        boost::optional<FT> dist = cost(pct, it);
+        std::optional<FT> dist = cost(pct, it);
         if(dist){
           (*it)->set_cost(*dist);
           if(! (*mpq).contains(*it)){
@@ -326,7 +326,7 @@ operator()()
     pct.simplify(vit);
 
     if((*u)->is_removable()){
-      boost::optional<FT> dist = cost(pct, u);
+      std::optional<FT> dist = cost(pct, u);
       if(! dist){
         // cost is undefined
         if( mpq->contains(*u) ){
@@ -344,7 +344,7 @@ operator()()
     }
 
     if((*w)->is_removable()){
-      boost::optional<FT> dist = cost(pct, w);
+      std::optional<FT> dist = cost(pct, w);
       if(! dist){
         // cost is undefined
         if( mpq->contains(*w) ){
diff --git a/STL_Extension/doc/STL_Extension/CGAL/Object.h b/STL_Extension/doc/STL_Extension/CGAL/Object.h
index c75541b0ae95..ddf919ef64a6 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/Object.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/Object.h
@@ -117,9 +117,9 @@ Object(boost::variant<T...>);
 
 /*!
 Implicit converting constructor for compatibility with
-`boost::optional` and `boost::variant`.
+`std::optional` and `boost::variant`.
  */
-Object(boost::optional< boost::variant<T...> >);
+Object(std::optional< boost::variant<T...> >);
 
 /// @}
 
diff --git a/STL_Extension/doc/STL_Extension/CGAL/iterator.h b/STL_Extension/doc/STL_Extension/CGAL/iterator.h
index fdc82bb1ffda..5e1e1acce56a 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/iterator.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/iterator.h
@@ -107,9 +107,9 @@ The class `Dispatch_or_drop_output_iterator` defines an
 dispatches among those based on the type of the value type which is
 put in it. Besides defining assignment for all parameters of `V`
 and for a tuple of type `V`,  it is also defined for the types `boost::variant<T...>` and
-`boost::optional<boost::variant<T...> >`, where `T...`
+`std::optional<boost::variant<T...> >`, where `T...`
 must be a subset of the parameters of `V`. Should the
-`boost::optional` be empty, it will be discarded.
+`std::optional` be empty, it will be discarded.
 
 \cgalHeading{Parameters}
 
@@ -195,7 +195,7 @@ put in it. Other types are also accepted, and the object is
 discarded in this case. Besides defining assignment for all
 parameters of `V` and for a tuple of type `V`, it is also defined for the types
 `boost::variant<T...>` and
-`boost::optional<boost::variant<T...> >`, where `T...`
+`std::optional<boost::variant<T...> >`, where `T...`
 can be a list of arbitrary types.
 
   It also inherits from `O`, which makes it easy to treat like a
diff --git a/STL_Extension/examples/STL_Extension/Dispatch_output_iterator.cpp b/STL_Extension/examples/STL_Extension/Dispatch_output_iterator.cpp
index f55d06db3923..44ff692c7885 100644
--- a/STL_Extension/examples/STL_Extension/Dispatch_output_iterator.cpp
+++ b/STL_Extension/examples/STL_Extension/Dispatch_output_iterator.cpp
@@ -1,7 +1,7 @@
 #include <vector>
 #include <CGAL/iterator.h>
 #include <boost/variant.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 int main()
 {
diff --git a/STL_Extension/include/CGAL/Modifiable_priority_queue.h b/STL_Extension/include/CGAL/Modifiable_priority_queue.h
index 2f24c67cd77d..e4fe97cda417 100644
--- a/STL_Extension/include/CGAL/Modifiable_priority_queue.h
+++ b/STL_Extension/include/CGAL/Modifiable_priority_queue.h
@@ -12,7 +12,7 @@
 #define CGAL_MODIFIABLE_PRIORITY_QUEUE_H
 
 #include <climits> // Needed by the following Boost header for CHAR_BIT.
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <CGAL/STL_Extension/internal/boost/relaxed_heap.hpp>
 #include <CGAL/STL_Extension/internal/boost/mutable_queue.hpp>
@@ -66,14 +66,14 @@ class Modifiable_priority_queue
 
   bool contains ( value_type const& v ) { return mHeap.contains(v) ; }
 
-  boost::optional<value_type> extract_top()
+  std::optional<value_type> extract_top()
   {
-    boost::optional<value_type> r ;
+    std::optional<value_type> r ;
     if ( !empty() )
     {
       value_type v = top();
       pop();
-      r = boost::optional<value_type>(v) ;
+      r = std::optional<value_type>(v) ;
     }
     return r ;
   }
@@ -238,14 +238,14 @@ struct Modifiable_priority_queue<IndexedType_, Compare_, ID_, CGAL_BOOST_PAIRING
     return (mHandles[vid] != handle_type());
   }
 
-  boost::optional<value_type> extract_top()
+  std::optional<value_type> extract_top()
   {
-    boost::optional<value_type> r;
+    std::optional<value_type> r;
     if(!empty())
     {
       value_type v = top();
       pop();
-      r = boost::optional<value_type>(v);
+      r = std::optional<value_type>(v);
     }
 
     return r;
diff --git a/STL_Extension/include/CGAL/Object.h b/STL_Extension/include/CGAL/Object.h
index fdfd59bd5141..33a01aac875d 100644
--- a/STL_Extension/include/CGAL/Object.h
+++ b/STL_Extension/include/CGAL/Object.h
@@ -28,7 +28,7 @@
 #include <typeinfo>
 
 #include <boost/variant.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/any.hpp>
 #include <memory>
 
@@ -65,7 +65,7 @@ class Object
 
     // implicit constructor from optionals containing variants
     template<BOOST_VARIANT_ENUM_PARAMS(typename T)>
-    Object(const boost::optional< boost::variant<BOOST_VARIANT_ENUM_PARAMS(T) > >& t)
+    Object(const std::optional< boost::variant<BOOST_VARIANT_ENUM_PARAMS(T) > >& t)
       : obj( t ? boost::apply_visitor(Any_from_variant(), *t) : nullptr) { }
 
     // implicit constructor from  variants
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/boost/relaxed_heap.hpp b/STL_Extension/include/CGAL/STL_Extension/internal/boost/relaxed_heap.hpp
index a02a831f0445..96f9f2aa08cc 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/boost/relaxed_heap.hpp
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/boost/relaxed_heap.hpp
@@ -26,7 +26,7 @@
 
 #include <functional>
 #include <boost/property_map/property_map.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <vector>
 #include <climits> // for CHAR_BIT
 #include <boost/none.hpp>
@@ -79,13 +79,13 @@ class relaxed_heap
 
         /** The value associated with this group. This value is only valid
          *  when @c kind!=largest_key (which indicates a deleted
-         *  element). Note that the use of boost::optional increases the
+         *  element). Note that the use of std::optional increases the
          *  memory requirements slightly but does not result in extraneous
          *  memory allocations or deallocations. The optional could be
          *  eliminated when @c value_type is a model of
          *  DefaultConstructible.
          */
-        ::boost::optional< value_type > value;
+        ::std::optional< value_type > value;
 
         /**
          * The kind of key stored at this group. This may be @c
@@ -205,14 +205,14 @@ class relaxed_heap
     value_type& top()
     {
         find_smallest();
-        CGAL_assertion(smallest_value->value != boost::none);
+        CGAL_assertion(smallest_value->value != std::nullopt);
         return *smallest_value->value;
     }
 
     const value_type& top() const
     {
         find_smallest();
-        CGAL_assertion(smallest_value->value != boost::none);
+        CGAL_assertion(smallest_value->value != std::nullopt);
         return *smallest_value->value;
     }
 
@@ -238,7 +238,7 @@ class relaxed_heap
         rank_type r = x->rank;
         group* p = x->parent;
         {
-            CGAL_assertion(x->value != boost::none);
+            CGAL_assertion(x->value != std::nullopt);
 
             // Find x's group
             size_type start = get(id, *x->value) - get(id, *x->value) % log_n;
@@ -727,7 +727,7 @@ class relaxed_heap
      *  are each log_n long, with the last group potentially being
      *  smaller.
      */
-    std::vector< ::boost::optional< value_type > > groups;
+    std::vector< ::std::optional< value_type > > groups;
 
     /** The list of active groups, indexed by rank. When A[r] is null,
      *  there is no active group of rank r. Otherwise, A[r] is the active
diff --git a/STL_Extension/include/CGAL/iterator.h b/STL_Extension/include/CGAL/iterator.h
index 956cc88a8c20..4928d3d519fb 100644
--- a/STL_Extension/include/CGAL/iterator.h
+++ b/STL_Extension/include/CGAL/iterator.h
@@ -28,7 +28,7 @@
 #include <CGAL/use.h>
 
 #include <boost/variant.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/config.hpp>
 
 #include <vector>
@@ -1388,7 +1388,7 @@ class Dispatch_output_iterator < std::tuple<V...>, std::tuple<O...> >
   }
 
   template<BOOST_VARIANT_ENUM_PARAMS(typename T)>
-  Self& operator=(const boost::optional< boost::variant<BOOST_VARIANT_ENUM_PARAMS(T) > >& t) {
+  Self& operator=(const std::optional< boost::variant<BOOST_VARIANT_ENUM_PARAMS(T) > >& t) {
     internal::Output_visitor<Self> visitor(this);
     if(t)  boost::apply_visitor(visitor, *t);
     return *this;
diff --git a/STL_Extension/test/STL_Extension/test_Object.cpp b/STL_Extension/test/STL_Extension/test_Object.cpp
index 705779bee86b..36cacb0f3343 100644
--- a/STL_Extension/test/STL_Extension/test_Object.cpp
+++ b/STL_Extension/test/STL_Extension/test_Object.cpp
@@ -4,14 +4,14 @@
 #include <CGAL/assertions.h>
 
 #include <boost/variant.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <cassert>
 
 void from_opt_var() {
   int i = 0;
   double j = 0.0;
 
-  boost::optional< boost::variant<int, char, double> > v(23);
+  std::optional< boost::variant<int, char, double> > v(23);
   CGAL::Object o = v;
   assert(!o.empty());
   assert(CGAL::assign(i, o));
@@ -23,7 +23,7 @@ void from_opt_var() {
   assert(CGAL::assign(j, o));
   assert(j == 2.0);
   //empty optional
-  boost::optional< boost::variant<int, char, double> > v2;
+  std::optional< boost::variant<int, char, double> > v2;
   CGAL::Object o2 = v2;
   assert(o2.empty());
 }
diff --git a/STL_Extension/test/STL_Extension/test_dispatch_output.cpp b/STL_Extension/test/STL_Extension/test_dispatch_output.cpp
index 9dffd636b515..b4340772add8 100644
--- a/STL_Extension/test/STL_Extension/test_dispatch_output.cpp
+++ b/STL_Extension/test/STL_Extension/test_dispatch_output.cpp
@@ -8,7 +8,7 @@
 #include <CGAL/use.h>
 
 #include <boost/variant.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 struct A{};
 struct B{};
@@ -92,7 +92,7 @@ void complete_test(std::vector<T1> data1,std::list<T2> data2){
 
 void variant_test() {
   typedef boost::variant<int, char, double> var;
-  typedef boost::optional< var > ovar;
+  typedef std::optional< var > ovar;
   std::vector<int> a;
   std::vector<double> b;
   std::vector<char> c;
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree.h b/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree.h
index b36cc8fb9733..0d6141ea2f03 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree.h
@@ -188,7 +188,7 @@ The types `FuzzyQueryItem::Point_d` and `Point_d` must be equivalent.
 To use this function `Traits` must be a model of the concept `RangeSearchTraits`.
 */
 template <class FuzzyQueryItem>
-boost::optional<Point_d> search_any_point(FuzzyQueryItem q) const;
+std::optional<Point_d> search_any_point(FuzzyQueryItem q) const;
 
 /*!
 Reports the points that are approximately contained by `q`.
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree_node.h b/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree_node.h
index 8d7d50f373e5..3d92ae2dc361 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree_node.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Kd_tree_node.h
@@ -45,7 +45,7 @@ OutputIterator search(OutputIterator it, FuzzyQueryItem q) const;
 Reports any point from the subtree of the node, that is approximately contained by `q`.
 */
 template <class FuzzyQueryItem>
-boost::optional<Point_d> search_any_point(OutputIterator it, FuzzyQueryItem q) const;
+std::optional<Point_d> search_any_point(OutputIterator it, FuzzyQueryItem q) const;
 
 /*!
 Reports all the points contained by the subtree of the node.
diff --git a/Spatial_searching/examples/Spatial_searching/searching_with_circular_query.cpp b/Spatial_searching/examples/Spatial_searching/searching_with_circular_query.cpp
index 3f08f1278a4c..de8f75f57db2 100644
--- a/Spatial_searching/examples/Spatial_searching/searching_with_circular_query.cpp
+++ b/Spatial_searching/examples/Spatial_searching/searching_with_circular_query.cpp
@@ -30,7 +30,7 @@ int main()
   Point center(0.2, 0.2);
   Fuzzy_circle default_range(center, 0.2);
 
-  boost::optional<Point> any = tree.search_any_point(default_range);
+  std::optional<Point> any = tree.search_any_point(default_range);
   if(any)
     std::cout << *any << " is in the query circle\n";
   else
diff --git a/Spatial_searching/include/CGAL/Kd_tree.h b/Spatial_searching/include/CGAL/Kd_tree.h
index 317f6a78bad5..54a344f3705c 100644
--- a/Spatial_searching/include/CGAL/Kd_tree.h
+++ b/Spatial_searching/include/CGAL/Kd_tree.h
@@ -31,7 +31,7 @@
 #include <CGAL/Spatial_searching/internal/Get_dimension_tag.h>
 
 #include <boost/container/deque.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 #ifdef CGAL_HAS_THREADS
 #include <CGAL/mutex.h>
@@ -594,7 +594,7 @@ class Kd_tree {
 
 
   template <class FuzzyQueryItem>
-  boost::optional<Point_d>
+  std::optional<Point_d>
   search_any_point(const FuzzyQueryItem& q) const
   {
     if(! pts.empty()){
@@ -605,7 +605,7 @@ class Kd_tree {
       Kd_tree_rectangle<FT,D> b(*bbox);
       return tree_root->search_any_point(q,b,begin(),cache_begin(),dim_);
     }
-    return boost::none;
+    return std::nullopt;
   }
 
 
diff --git a/Spatial_searching/include/CGAL/Kd_tree_node.h b/Spatial_searching/include/CGAL/Kd_tree_node.h
index 02af0663d6ab..8eb6602f17b3 100644
--- a/Spatial_searching/include/CGAL/Kd_tree_node.h
+++ b/Spatial_searching/include/CGAL/Kd_tree_node.h
@@ -175,14 +175,14 @@ namespace CGAL {
     }
 
 
-    boost::optional<Point_d>
+    std::optional<Point_d>
     any_tree_item() const {
-      boost::optional<Point_d> result = boost::none;
+      std::optional<Point_d> result = std::nullopt;
       if (is_leaf()) {
          Leaf_node_const_handle node =
           static_cast<Leaf_node_const_handle>(this);
          if (node->size()>0){
-           return boost::make_optional(*(node->begin()));
+           return std::make_optional(*(node->begin()));
          }
         }
       else {
@@ -273,14 +273,14 @@ namespace CGAL {
 
 
     template <class FuzzyQueryItem>
-    boost::optional<Point_d>
+    std::optional<Point_d>
     search_any_point(const FuzzyQueryItem& q,
                      Kd_tree_rectangle<FT,D>& b,
                      typename Kdt::const_iterator tree_points_begin,
                      typename std::vector<FT>::const_iterator cache_begin,
                      int dim) const
     {
-      boost::optional<Point_d> result = boost::none;
+      std::optional<Point_d> result = std::nullopt;
       if (is_leaf()) {
         Leaf_node_const_handle node =
           static_cast<Leaf_node_const_handle>(this);
@@ -376,7 +376,7 @@ namespace CGAL {
 
     // With cache
     template<class FuzzyQueryItem>
-    boost::optional<Point_d> search_any_point_in_leaf(
+    std::optional<Point_d> search_any_point_in_leaf(
       Leaf_node_const_handle node,
       const FuzzyQueryItem &q,
       typename Kdt::const_iterator tree_points_begin,
@@ -384,7 +384,7 @@ namespace CGAL {
       int dim,
       Tag_true /*has_points_cache*/) const
     {
-      boost::optional<Point_d> result = boost::none;
+      std::optional<Point_d> result = std::nullopt;
       typename Kdt::iterator it_node_point = node->begin(), it_node_point_end = node->end();
       typename std::vector<FT>::const_iterator cache_point_it = cache_begin + dim*(it_node_point - tree_points_begin);
       for (; it_node_point != it_node_point_end; ++it_node_point, cache_point_it += dim)
@@ -401,7 +401,7 @@ namespace CGAL {
 
     // Without cache
     template<class FuzzyQueryItem>
-    boost::optional<Point_d> search_any_point_in_leaf(
+    std::optional<Point_d> search_any_point_in_leaf(
       Leaf_node_const_handle node,
       const FuzzyQueryItem &q,
       typename Kdt::const_iterator /*tree_points_begin*/,
@@ -409,7 +409,7 @@ namespace CGAL {
       int /*dim*/,
       Tag_false /*has_points_cache*/) const
     {
-      boost::optional<Point_d> result = boost::none;
+      std::optional<Point_d> result = std::nullopt;
       for (iterator i = node->begin(); i != node->end(); ++i)
       {
         if (q.contains(*i))
diff --git a/Spatial_searching/include/CGAL/Point_container.h b/Spatial_searching/include/CGAL/Point_container.h
index eb96024348e2..4c2b180b6ba1 100644
--- a/Spatial_searching/include/CGAL/Point_container.h
+++ b/Spatial_searching/include/CGAL/Point_container.h
@@ -25,7 +25,7 @@
 #include <CGAL/Kd_tree_rectangle.h>
 #include <CGAL/Spatial_searching/internal/Get_dimension_tag.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 
@@ -45,8 +45,8 @@ class Point_container {
 private:
   Traits traits;
   // the iterator range of the Point_container
-  boost::optional<iterator> m_b ;
-  boost::optional<iterator> m_e ;
+  std::optional<iterator> m_b ;
+  std::optional<iterator> m_e ;
 
   int built_coord;    // a coordinate for which the pointer list is built
   Kd_tree_rectangle<FT,D> bbox;       // bounding box, i.e. rectangle of node
diff --git a/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton_tweaking_skeleton.cpp b/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton_tweaking_skeleton.cpp
index 438017f36f6a..be86a93b4dd9 100644
--- a/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton_tweaking_skeleton.cpp
+++ b/Straight_skeleton_2/benchmark/Straight_skeleton_2/create_exterior_skeleton_tweaking_skeleton.cpp
@@ -54,7 +54,7 @@ int main()
 
       if ( i->opposite()->vertex()->has_infinite_time() )
       {
-        boost::optional<Point> op=
+        std::optional<Point> op=
           builder.Construct_offset_point(offset , i->opposite());
         if(!op) continue;
         p=*op;
@@ -64,7 +64,7 @@ int main()
 
       if( i->vertex()->has_infinite_time() )
       {
-        boost::optional<Point> op=
+        std::optional<Point> op=
           builder.Construct_offset_point(offset , i);
         if(!op) continue;
         q=*op;
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h
index 1c0c422aa365..0dced9ac3f5f 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h
@@ -154,7 +154,7 @@ typedef Traits::Point_2 Point_2;
 /*!
 constructs the builder class.
 */
-Straight_skeleton_builder_2(boost::optional<FT> max_time = boost::none,
+Straight_skeleton_builder_2(std::optional<FT> max_time = std::nullopt,
                             const Traits& traits = Traits(),
                             const Visitor& visitor = Visitor());
 
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/compute_outer_frame_margin.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/compute_outer_frame_margin.h
index 050c6dfba90b..7db792ad14ec 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/compute_outer_frame_margin.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/compute_outer_frame_margin.h
@@ -47,7 +47,7 @@ the kernel in which the type `InputIterator::value_type` is defined.
 \sa `CGAL::Polygon_offset_builder_traits_2<K>`
 */
 template <class InputIterator, class Traits>
-boost::optional< typename Traits::FT >
+std::optional< typename Traits::FT >
 compute_outer_frame_margin( InputIterator first, InputIterator beyond,
                             typename Traits::FT offset,
                             const Traits& traits = Default_traits );
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
index cc2cf00a120a..2f65f3507bde 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
@@ -33,7 +33,7 @@ typedef unspecified_type Compare_offset_against_event_time_2;
 /*!
 A construction object type.
 
-Must provide `boost::optional<Point_2> operator()(const FT& t, const Segment_2& e0, Segment_2_with_ID const& e1, const Trisegment_2_ptr& et) const`,
+Must provide `std::optional<Point_2> operator()(const FT& t, const Segment_2& e0, Segment_2_with_ID const& e1, const Trisegment_2_ptr& et) const`,
 which constructs the point of intersection of the lines obtained by offsetting
 the oriented lines given by `e0` and `e0` an Euclidean distance `t`.
 
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
index f4fd0166ebbb..4da7ab2118fa 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
@@ -62,7 +62,7 @@ typedef boost::intrusive_ptr<Trisegment_2> Trisegment_2_ptr;
 /*!
 A predicate object type.
 
-Must provide `bool operator()( const Trisegment_2_ptr& tri_segment, boost::optional<FT> max_time ) const`,
+Must provide `bool operator()( const Trisegment_2_ptr& tri_segment, std::optional<FT> max_time ) const`,
 which determines if, given the three <I>oriented</I> lines defined by the three input edges,
 there exists an Euclidean distance `t >= 0` and `t <= max_time` for which the corresponding three
 <I>offset lines at `t`</I> (parallel lines at an Euclidean distance of `t`) intersect in a single point.
@@ -100,7 +100,7 @@ typedef unspecified_type Are_ss_events_simultaneous_2;
 /*!
 A construction object type.
 
-Must provide `boost::optional< boost::tuple<FT, Point_2> > operator()( const Trisegment_2_ptr& e)`,
+Must provide `std::optional< boost::tuple<FT, Point_2> > operator()( const Trisegment_2_ptr& e)`,
 which returns the Euclidean distance `t >= 0` and the intersection point at which the corresponding
 three <I>offset lines at `t`</I> intersect if they do.
 
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/Low_level_API.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/Low_level_API.cpp
index 52e405a4dd31..71e66194c6c5 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/Low_level_API.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/Low_level_API.cpp
@@ -66,7 +66,7 @@ int main()
 
   // First we need to determine the proper separation between the polygon and the frame.
   // We use this helper function provided in the package.
-  boost::optional<double> margin = CGAL::compute_outer_frame_margin(star.begin(),star.end(),offset);
+  std::optional<double> margin = CGAL::compute_outer_frame_margin(star.begin(),star.end(),offset);
 
   // Proceed only if the margin was computed (an extremely sharp corner might cause overflow)
   if ( margin )
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/exterior_offset_of_multiple_polygons_with_holes.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/exterior_offset_of_multiple_polygons_with_holes.cpp
index d2da4691924c..18b4e900b57e 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/exterior_offset_of_multiple_polygons_with_holes.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/exterior_offset_of_multiple_polygons_with_holes.cpp
@@ -31,7 +31,7 @@ exterior_offset_of_disjoint_polygons_with_holes(double lOffset, const std::vecto
     outer_vertices.insert(outer_vertices.end(),
                           pwh.outer_boundary().container().begin(),
                           pwh.outer_boundary().container().end());
-  boost::optional<double> margin = compute_outer_frame_margin(outer_vertices.begin(),
+  std::optional<double> margin = compute_outer_frame_margin(outer_vertices.begin(),
                                                               outer_vertices.end(),
                                                               lOffset);
 
diff --git a/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_2.h b/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_2.h
index 3ddac56aa28d..2eae95de48a5 100644
--- a/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_2.h
+++ b/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_2.h
@@ -16,7 +16,7 @@
 #include <CGAL/Straight_skeleton_2/Straight_skeleton_aux.h>
 #include <CGAL/Polygon_offset_builder_traits_2.h>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 #include <memory>
 
 #include <vector>
@@ -69,7 +69,7 @@ public :
   typedef typename Traits::FT      FT ;
   typedef typename Traits::Point_2 Point_2 ;
 
-  typedef boost::optional<Point_2> OptionalPoint_2 ;
+  typedef std::optional<Point_2> OptionalPoint_2 ;
 
   typedef std::shared_ptr<Container> ContainerPtr ;
 
@@ -149,7 +149,7 @@ public :
     return r ;
   }
 public:
-  boost::optional<Point_2> Construct_offset_point( FT aT, Halfedge_const_handle aBisector ) const
+  std::optional<Point_2> Construct_offset_point( FT aT, Halfedge_const_handle aBisector ) const
   {
     CGAL_assertion(aBisector->is_bisector());
     CGAL_assertion(handle_assigned(aBisector->opposite()));
diff --git a/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_traits_2.h b/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_traits_2.h
index 558a0a6fccba..d8d12c903201 100644
--- a/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_traits_2.h
+++ b/Straight_skeleton_2/include/CGAL/Polygon_offset_builder_traits_2.h
@@ -18,7 +18,7 @@
 #include <CGAL/predicates/Polygon_offset_pred_ftC2.h>
 #include <CGAL/constructions/Polygon_offset_cons_ftC2.h>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 
@@ -51,7 +51,7 @@ struct Construct_offset_point_2 : Functor_base_2<K>
   typedef typename Base::Segment_2_with_ID Segment_2_with_ID ;
   typedef typename Base::Trisegment_2_ptr Trisegment_2_ptr ;
 
-  typedef boost::optional<Point_2> result_type ;
+  typedef std::optional<Point_2> result_type ;
 
 
   result_type operator() ( FT                const& aT
@@ -60,7 +60,7 @@ struct Construct_offset_point_2 : Functor_base_2<K>
                          , Trisegment_2_ptr  const& aNode
                          ) const
   {
-    typedef boost::optional< Line_2<K> > Optional_line;
+    typedef std::optional< Line_2<K> > Optional_line;
     No_cache<Optional_line> lCoeff_cache;
 
     result_type p = construct_offset_pointC2(aT,aE0,aE1,aNode,lCoeff_cache);
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Polygon_offset_builder_2_impl.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Polygon_offset_builder_2_impl.h
index 95fe522f3b33..471ed51ffacd 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Polygon_offset_builder_2_impl.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Polygon_offset_builder_2_impl.h
@@ -312,7 +312,7 @@ OutputIterator Polygon_offset_builder_2<Ss,Gt,Cont,Visitor>::construct_offset_co
 
   mVisitor.on_construction_started(aTime);
 
-  mLastPoint = boost::none ;
+  mLastPoint = std::nullopt ;
 
   ResetBisectorData();
 
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_aux.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_aux.h
index 8a2ad91ab869..2d2741edde48 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_aux.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_aux.h
@@ -20,7 +20,7 @@
 #include <boost/mpl/if.hpp>
 #include <boost/mpl/or.hpp>
 #include <boost/none.hpp>
-#include <boost/optional/optional.hpp>
+#include <optional>
 
 #include <iostream>
 #include <type_traits>
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h
index f36c3d6d1791..47da401bc326 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h
@@ -32,7 +32,7 @@
 namespace CGAL {
 
 template<class Gt, class Ss, class V>
-Straight_skeleton_builder_2<Gt,Ss,V>::Straight_skeleton_builder_2 ( boost::optional<FT> aMaxTime, Traits const& aTraits, Visitor const& aVisitor )
+Straight_skeleton_builder_2<Gt,Ss,V>::Straight_skeleton_builder_2 ( std::optional<FT> aMaxTime, Traits const& aTraits, Visitor const& aVisitor )
   :
   mTraits(aTraits)
  ,mVisitor(aVisitor)
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h
index 7744f44d3773..519085bf934a 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h
@@ -28,7 +28,7 @@
 
 #include <boost/tuple/tuple.hpp>
 #include <boost/intrusive_ptr.hpp>
-#include <boost/optional/optional.hpp>
+#include <optional>
 #include <boost/none.hpp>
 #include <boost/mpl/has_xxx.hpp>
 
@@ -42,7 +42,7 @@ namespace CGAL {
 namespace CGAL_SS_i {
 
 template<class T>
-T const& validate ( boost::optional<T> const& o )
+T const& validate ( std::optional<T> const& o )
 {
   if ( !o )
     throw std::overflow_error("Arithmetic overflow");
@@ -57,17 +57,17 @@ NT const& validate( NT const& n )
   return n ;
 }
 
-// boost::make_optional is provided in Boost >= 1.34, but not before, so we define our own versions here.
+// std::make_optional is provided in Boost >= 1.34, but not before, so we define our own versions here.
 template<class T>
-boost::optional<T> cgal_make_optional( T const& v )
+std::optional<T> cgal_make_optional( T const& v )
 {
-  return boost::optional<T>(v) ;
+  return std::optional<T>(v) ;
 }
 
 template<class T>
-boost::optional<T> cgal_make_optional( bool cond, T const& v )
+std::optional<T> cgal_make_optional( bool cond, T const& v )
 {
-  return cond ? boost::optional<T>(v) : boost::optional<T>() ;
+  return cond ? std::optional<T>(v) : std::optional<T>() ;
 }
 
 template<class K>
@@ -210,7 +210,7 @@ template <class Info>
 struct FPU_checker;
 
 template <class FT>
-struct FPU_checker<boost::optional< CGAL_SS_i::Rational< FT > > >
+struct FPU_checker<std::optional< CGAL_SS_i::Rational< FT > > >
 {
   static bool is_valid()
   {
@@ -220,7 +220,7 @@ struct FPU_checker<boost::optional< CGAL_SS_i::Rational< FT > > >
 };
 
 template <class K>
-struct FPU_checker<boost::optional< Line_2<K> > >
+struct FPU_checker<std::optional< Line_2<K> > >
 {
   static bool is_valid()
   {
@@ -269,10 +269,10 @@ struct Info_cache
 };
 
 template <typename K>
-using Time_cache = Info_cache< boost::optional< CGAL_SS_i::Rational< typename K::FT > > > ;
+using Time_cache = Info_cache< std::optional< CGAL_SS_i::Rational< typename K::FT > > > ;
 
 template <typename K>
-using Coeff_cache = Info_cache< boost::optional< Line_2<K> > > ;
+using Coeff_cache = Info_cache< std::optional< Line_2<K> > > ;
 
 template<class K>
 struct Functor_base_2
@@ -315,17 +315,17 @@ struct SS_converter : Converter
   typedef boost::tuple<Source_FT,Source_point_2> Source_time_and_point_2 ;
   typedef boost::tuple<Target_FT,Target_point_2> Target_time_and_point_2 ;
 
-  typedef boost::optional<Source_FT> Source_opt_FT ;
-  typedef boost::optional<Target_FT> Target_opt_FT ;
+  typedef std::optional<Source_FT> Source_opt_FT ;
+  typedef std::optional<Target_FT> Target_opt_FT ;
 
-  typedef boost::optional<Source_point_2> Source_opt_point_2 ;
-  typedef boost::optional<Target_point_2> Target_opt_point_2 ;
+  typedef std::optional<Source_point_2> Source_opt_point_2 ;
+  typedef std::optional<Target_point_2> Target_opt_point_2 ;
 
-  typedef boost::optional<Source_time_and_point_2> Source_opt_time_and_point_2 ;
-  typedef boost::optional<Target_time_and_point_2> Target_opt_time_and_point_2 ;
+  typedef std::optional<Source_time_and_point_2> Source_opt_time_and_point_2 ;
+  typedef std::optional<Target_time_and_point_2> Target_opt_time_and_point_2 ;
 
-  typedef boost::optional<Source_segment_2> Source_opt_segment_2 ;
-  typedef boost::optional<Target_segment_2> Target_opt_segment_2 ;
+  typedef std::optional<Source_segment_2> Source_opt_segment_2 ;
+  typedef std::optional<Target_segment_2> Target_opt_segment_2 ;
 
   typedef typename Source_trisegment_2::Self_ptr Source_trisegment_2_ptr ;
   typedef typename Target_trisegment_2::Self_ptr Target_trisegment_2_ptr ;
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/debug.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/debug.h
index 72887141335c..b54af3973aa5 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/debug.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/debug.h
@@ -42,11 +42,11 @@ bool sEnableTrace = true ;
        Straight_skeleton_external_trace(s); \
      }
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/intrusive_ptr.hpp>
 
 template<class T>
-inline std::string o2str( boost::optional<T> const& o )
+inline std::string o2str( std::optional<T> const& o )
 {
   std::ostringstream ss ; ss << std::setprecision(19)  ;
   if ( o )
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_2.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_2.h
index c7e3f77fbd7b..6fcb719b7956 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_2.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_2.h
@@ -218,7 +218,7 @@ private :
 
 public:
 
-  Straight_skeleton_builder_2 ( boost::optional<FT> aMaxTime = boost::none, Traits const& = Traits(), Visitor const& aVisitor = Visitor() ) ;
+  Straight_skeleton_builder_2 ( std::optional<FT> aMaxTime = std::nullopt, Traits const& = Traits(), Visitor const& aVisitor = Visitor() ) ;
 
   SSkelPtr construct_skeleton(  bool aNull_if_failed = true ) ;
 
@@ -1011,7 +1011,7 @@ private :
 
   boost::tuple<FT,Point_2> ConstructEventTimeAndPoint( Trisegment_2_ptr const& aS ) const
   {
-    boost::optional< boost::tuple<FT,Point_2> > r = Construct_ss_event_time_and_point_2(mTraits)(aS);
+    std::optional< boost::tuple<FT,Point_2> > r = Construct_ss_event_time_and_point_2(mTraits)(aS);
     CGAL_postcondition_msg(!!r, "Unable to compute skeleton node coordinates");
     return *r ;
   }
@@ -1179,7 +1179,7 @@ private :
   int mEventID  ;
   int mStepID   ;
 
-  boost::optional<FT> mMaxTime ;
+  std::optional<FT> mMaxTime ;
 
   PQ mPQ ;
 
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_traits_2.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_traits_2.h
index a2537158295a..22da0b8fe358 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_traits_2.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_builder_traits_2.h
@@ -22,7 +22,7 @@
 #include <CGAL/Filtered_construction.h>
 #include <CGAL/Uncertain.h>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 #include <boost/tuple/tuple.hpp>
 
 #include <iostream>
@@ -69,7 +69,7 @@ struct Do_ss_event_exist_2 : Functor_base_2<K>
     : mTime_cache(aTime_cache), mCoeff_cache(aCoeff_cache)
   {}
 
-  Uncertain<bool> operator() ( Trisegment_2_ptr const& aTrisegment, boost::optional<FT> aMaxTime ) const
+  Uncertain<bool> operator() ( Trisegment_2_ptr const& aTrisegment, std::optional<FT> aMaxTime ) const
   {
     Uncertain<bool> rResult = exist_offset_lines_isec2(aTrisegment,aMaxTime,mTime_cache,mCoeff_cache) ;
 
@@ -276,7 +276,7 @@ struct Construct_ss_event_time_and_point_2 : Functor_base_2<K>
 
   typedef boost::tuple<FT,Point_2> rtype ;
 
-  typedef boost::optional<rtype> result_type ;
+  typedef std::optional<rtype> result_type ;
 
   Construct_ss_event_time_and_point_2(Time_cache<K>& aTime_cache, Coeff_cache<K>& aCoeff_cache)
     : mTime_cache(aTime_cache), mCoeff_cache(aCoeff_cache)
@@ -289,13 +289,13 @@ struct Construct_ss_event_time_and_point_2 : Functor_base_2<K>
     FT      t(0) ;
     Point_2 i = ORIGIN ;
 
-    boost::optional< Rational<FT> > ot = compute_offset_lines_isec_timeC2(aTrisegment,mTime_cache,mCoeff_cache);
+    std::optional< Rational<FT> > ot = compute_offset_lines_isec_timeC2(aTrisegment,mTime_cache,mCoeff_cache);
 
     if ( !!ot && certainly( CGAL_NTS certified_is_not_zero(ot->d()) ) )
     {
       t = ot->n() / ot->d();
 
-      boost::optional<Point_2> oi = construct_offset_lines_isecC2(aTrisegment,mCoeff_cache);
+      std::optional<Point_2> oi = construct_offset_lines_isecC2(aTrisegment,mCoeff_cache);
       if ( oi )
       {
         i = *oi ;
@@ -509,7 +509,7 @@ class Straight_skeleton_builder_traits_2_impl<Tag_false /*Is_filtered_kernel*/,
     if ( mCoeff_cache.Get( aOtherID ) )
       mCoeff_cache.Set( aID, CGAL_SS_i::cgal_make_optional(*(mCoeff_cache.Get(aOtherID))) ) ;
     else
-      mCoeff_cache.Set( aID, boost::none ) ;
+      mCoeff_cache.Set( aID, std::nullopt ) ;
   }
 
   // functions and tag for filtering split events
@@ -523,7 +523,7 @@ class Straight_skeleton_builder_traits_2_impl<Tag_false /*Is_filtered_kernel*/,
       return false;
 
     typename Base::Trisegment_2_ptr tri = lEvent->trisegment() ;
-    boost::optional<CGAL_SS_i::Rational<typename K::FT> > lOptTime =
+    std::optional<CGAL_SS_i::Rational<typename K::FT> > lOptTime =
         CGAL_SS_i::compute_offset_lines_isec_timeC2(tri, mTime_cache, mCoeff_cache);
 
     if ( lOptTime && lOptTime->to_nt() > *mFilteringBound )
@@ -542,7 +542,7 @@ class Straight_skeleton_builder_traits_2_impl<Tag_false /*Is_filtered_kernel*/,
                              Halfedge_handle_vector_iterator contour_halfedges_begin,
                              Halfedge_handle_vector_iterator contour_halfedges_end) const
   {
-    mFilteringBound = boost::none;
+    mFilteringBound = std::nullopt;
 
     if ( ! aNode->is_contour() )
       return ;
@@ -556,8 +556,8 @@ class Straight_skeleton_builder_traits_2_impl<Tag_false /*Is_filtered_kernel*/,
     Segment_2 s2(aNode->point(), lNext->point());
 
     // @todo? These are not input segments, but it might still worth caching (just gotta assign them an ID)
-    boost::optional< Line_2 > l1 = CGAL_SS_i::compute_normalized_line_ceoffC2(s1);
-    boost::optional< Line_2 > l2 = CGAL_SS_i::compute_normalized_line_ceoffC2(s2);
+    std::optional< Line_2 > l1 = CGAL_SS_i::compute_normalized_line_ceoffC2(s1);
+    std::optional< Line_2 > l2 = CGAL_SS_i::compute_normalized_line_ceoffC2(s2);
 
     Vector_2 lV1(l1->a(), l1->b()) ;
     Vector_2 lV2(l2->a(), l2->b()) ;
@@ -581,7 +581,7 @@ class Straight_skeleton_builder_traits_2_impl<Tag_false /*Is_filtered_kernel*/,
         continue;
 
       // Note that we don't need the normalization
-      boost::optional< Line_2 > lh = CGAL_SS_i::compute_normalized_line_ceoffC2(s_h);
+      std::optional< Line_2 > lh = CGAL_SS_i::compute_normalized_line_ceoffC2(s_h);
 
       typename K::FT lBound = ( - lh->c() - lh->a()*aNode->point().x() - lh->b()*aNode->point().y() ) /
                                 ( lh->a()*lV12.x() + lh->b()*lV12.y() );
@@ -598,7 +598,7 @@ class Straight_skeleton_builder_traits_2_impl<Tag_false /*Is_filtered_kernel*/,
   mutable std::size_t mTrisegment_ID = 0 ;
   mutable CGAL_SS_i::Time_cache<K> mTime_cache ;
   mutable CGAL_SS_i::Coeff_cache<K> mCoeff_cache ;
-  mutable boost::optional< typename K::FT > mFilteringBound ;
+  mutable std::optional< typename K::FT > mFilteringBound ;
 } ;
 
 template<class K>
@@ -817,7 +817,7 @@ class Straight_skeleton_builder_traits_2_impl<Tag_true /*Is_filtered_kernel*/, K
 
     try
     {
-      boost::optional<CGAL_SS_i::Rational<typename FK::FT> > lOptTime =
+      std::optional<CGAL_SS_i::Rational<typename FK::FT> > lOptTime =
           CGAL_SS_i::compute_offset_lines_isec_timeC2(
             tri, mApproximate_traits.mTime_cache, mApproximate_traits.mCoeff_cache);
 
@@ -840,7 +840,7 @@ class Straight_skeleton_builder_traits_2_impl<Tag_true /*Is_filtered_kernel*/, K
                              Halfedge_handle_vector_iterator contour_halfedges_begin,
                              Halfedge_handle_vector_iterator contour_halfedges_end) const
   {
-    mApproximate_traits.mFilteringBound = boost::none;
+    mApproximate_traits.mFilteringBound = std::nullopt;
 
     if ( ! aNode->is_contour() )
       return ;
@@ -860,8 +860,8 @@ class Straight_skeleton_builder_traits_2_impl<Tag_true /*Is_filtered_kernel*/, K
     Target_Segment_2 s2(laP, to_FK(lNext->point()));
 
     // @todo? These are not input segments, but it might still worth caching (just gotta assign them an ID)
-    boost::optional< Target_Line_2 > l1 = CGAL_SS_i::compute_normalized_line_ceoffC2(s1);
-    boost::optional< Target_Line_2 > l2 = CGAL_SS_i::compute_normalized_line_ceoffC2(s2);
+    std::optional< Target_Line_2 > l1 = CGAL_SS_i::compute_normalized_line_ceoffC2(s1);
+    std::optional< Target_Line_2 > l2 = CGAL_SS_i::compute_normalized_line_ceoffC2(s2);
 
     Target_Vector_2 lV1(l1->a(), l1->b()) ;
     Target_Vector_2 lV2(l2->a(), l2->b()) ;
@@ -887,7 +887,7 @@ class Straight_skeleton_builder_traits_2_impl<Tag_true /*Is_filtered_kernel*/, K
           continue;
 
         // Note that we don't need the normalization
-        boost::optional< Target_Line_2 > lh = CGAL_SS_i::compute_normalized_line_ceoffC2(s_h);
+        std::optional< Target_Line_2 > lh = CGAL_SS_i::compute_normalized_line_ceoffC2(s_h);
 
         typename FK::FT lBound = ( - lh->c() - lh->a()*laP.x() - lh->b()*laP.y() ) /
                                    ( lh->a()*lV12.x() + lh->b()*lV12.y() );
diff --git a/Straight_skeleton_2/include/CGAL/compute_outer_frame_margin.h b/Straight_skeleton_2/include/CGAL/compute_outer_frame_margin.h
index dc80fb743136..564bc5adbe7e 100644
--- a/Straight_skeleton_2/include/CGAL/compute_outer_frame_margin.h
+++ b/Straight_skeleton_2/include/CGAL/compute_outer_frame_margin.h
@@ -17,7 +17,7 @@
 #include <CGAL/Polygon_offset_builder_traits_2.h>
 #include <CGAL/Kernel_traits.h>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 
 #include <algorithm>
 #include <iterator>
@@ -25,7 +25,7 @@
 namespace CGAL {
 
 template<class ForwardPointIterator, class Traits>
-boost::optional< typename Traits::FT > compute_outer_frame_margin ( ForwardPointIterator aBegin
+std::optional< typename Traits::FT > compute_outer_frame_margin ( ForwardPointIterator aBegin
                                                                   , ForwardPointIterator aEnd
                                                                   , typename Traits::FT  aOffset
                                                                   , Traits const&        aTraits
@@ -44,7 +44,7 @@ boost::optional< typename Traits::FT > compute_outer_frame_margin ( ForwardPoint
   typename Kernel::Compute_squared_distance_2 squared_distance  = kernel.compute_squared_distance_2_object();
   typename Kernel::Construct_segment_2        construct_segment = kernel.construct_segment_2_object();
 
-  typedef boost::optional<Point_2> OptionalPoint_2 ;
+  typedef std::optional<Point_2> OptionalPoint_2 ;
 
   FT lMaxSDist(0) ;
 
@@ -89,15 +89,15 @@ boost::optional< typename Traits::FT > compute_outer_frame_margin ( ForwardPoint
   {
     FT lDist = CGAL_SS_i::inexact_sqrt(lMaxSDist) ;
 
-    return boost::optional<FT>( lDist + ( aOffset * FT(1.05) ) ) ; // Add a %5 gap
+    return std::optional<FT>( lDist + ( aOffset * FT(1.05) ) ) ; // Add a %5 gap
   }
   else
-    return boost::optional<FT>();
+    return std::optional<FT>();
 
 }
 
 template<class FT, class ForwardPointIterator>
-boost::optional<FT> compute_outer_frame_margin ( ForwardPointIterator aBegin, ForwardPointIterator aEnd,
+std::optional<FT> compute_outer_frame_margin ( ForwardPointIterator aBegin, ForwardPointIterator aEnd,
                                                  FT aOffset )
 {
   typedef typename std::iterator_traits<ForwardPointIterator>::value_type Point_2 ;
diff --git a/Straight_skeleton_2/include/CGAL/constructions/Polygon_offset_cons_ftC2.h b/Straight_skeleton_2/include/CGAL/constructions/Polygon_offset_cons_ftC2.h
index 03b25b3352d4..5b6e79f6f140 100644
--- a/Straight_skeleton_2/include/CGAL/constructions/Polygon_offset_cons_ftC2.h
+++ b/Straight_skeleton_2/include/CGAL/constructions/Polygon_offset_cons_ftC2.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/constructions/Straight_skeleton_cons_ftC2.h>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 #include <boost/intrusive_ptr.hpp>
 
 namespace CGAL {
@@ -32,7 +32,7 @@ namespace CGAL_SS_i {
 // POSTCONDITION: In case of overflow an empty optional is returned.
 //
 template<class K, class CoeffCache>
-boost::optional< Point_2<K> > construct_offset_pointC2 ( typename K::FT const& t,
+std::optional< Point_2<K> > construct_offset_pointC2 ( typename K::FT const& t,
                                                          Segment_2_with_ID<K> const& e0,
                                                          Segment_2_with_ID<K> const& e1,
                                                          boost::intrusive_ptr< Trisegment_2<K, Segment_2_with_ID<K> > > const& tri,
@@ -43,8 +43,8 @@ boost::optional< Point_2<K> > construct_offset_pointC2 ( typename K::FT const& t
   typedef Point_2<K>  Point_2 ;
   typedef Line_2<K>   Line_2 ;
 
-  typedef boost::optional<Point_2> Optional_point_2 ;
-  typedef boost::optional<Line_2>  Optional_line_2 ;
+  typedef std::optional<Point_2> Optional_point_2 ;
+  typedef std::optional<Line_2>  Optional_line_2 ;
 
   FT x(0.0),y(0.0) ;
 
diff --git a/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h b/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h
index 1076f7ae680b..414de78d51b0 100644
--- a/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h
+++ b/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h
@@ -19,7 +19,7 @@
 #include <CGAL/Point_2.h>
 #include <CGAL/Segment_2.h>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 
 #include <cstddef>
 
@@ -112,7 +112,7 @@ inline Lazy_exact_nt<NT> inexact_sqrt( Lazy_exact_nt<NT> const& lz)
 // POSTCONDITION: [a,b] is the leftward normal _unit_ (a²+b²=1) vector.
 // POSTCONDITION: In case of overflow, an empty optional<> is returned.
 template<class K>
-boost::optional< Line_2<K> > compute_normalized_line_ceoffC2( Segment_2<K> const& e )
+std::optional< Line_2<K> > compute_normalized_line_ceoffC2( Segment_2<K> const& e )
 {
   bool finite = true ;
 
@@ -201,13 +201,13 @@ boost::optional< Line_2<K> > compute_normalized_line_ceoffC2( Segment_2<K> const
 }
 
 template<class K, class CoeffCache>
-boost::optional< Line_2<K> > compute_normalized_line_ceoffC2( Segment_2_with_ID<K> const& e,
+std::optional< Line_2<K> > compute_normalized_line_ceoffC2( Segment_2_with_ID<K> const& e,
                                                               CoeffCache& aCoeff_cache )
 {
   if ( aCoeff_cache.IsCached(e.mID) )
     return aCoeff_cache.Get(e.mID) ;
 
-  boost::optional< Line_2<K> > rRes = compute_normalized_line_ceoffC2 ( static_cast<Segment_2<K> const&>(e) ) ;
+  std::optional< Line_2<K> > rRes = compute_normalized_line_ceoffC2 ( static_cast<Segment_2<K> const&>(e) ) ;
 
   aCoeff_cache.Set(e.mID, rRes) ;
 
@@ -266,7 +266,7 @@ construct_trisegment ( Segment_2_with_ID<K> const& e0,
 // NOTE: The segments (e0,e1,e2) are stored in the argument as the trisegment st.event()
 //
 template <class K, class CoeffCache>
-boost::optional< Rational< typename K::FT> >
+std::optional< Rational< typename K::FT> >
 compute_normal_offset_lines_isec_timeC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment_2_with_ID<K> > > const& tri,
                                           CoeffCache& aCoeff_cache )
 {
@@ -274,7 +274,7 @@ compute_normal_offset_lines_isec_timeC2 ( boost::intrusive_ptr< Trisegment_2<K,
 
   typedef Line_2<K> Line_2 ;
 
-  typedef boost::optional<Line_2> Optional_line_2 ;
+  typedef std::optional<Line_2> Optional_line_2 ;
 
   CGAL_STSKEL_TRAITS_TRACE("Computing normal offset lines isec time for: " << tri ) ;
 
@@ -332,7 +332,7 @@ compute_normal_offset_lines_isec_timeC2 ( boost::intrusive_ptr< Trisegment_2<K,
 // POSTCONDITION: In case of overflow an empty optional is returned.
 //
 template<class K>
-boost::optional< Point_2<K> > compute_oriented_midpoint ( Segment_2_with_ID<K> const& e0,
+std::optional< Point_2<K> > compute_oriented_midpoint ( Segment_2_with_ID<K> const& e0,
                                                           Segment_2_with_ID<K> const& e1 )
 {
   bool ok = false ;
@@ -391,12 +391,12 @@ boost::optional< Point_2<K> > compute_oriented_midpoint ( Segment_2_with_ID<K> c
 // If you request the point of such degenerate pseudo seed the oriented midpoint between e0 and e2 is returned.
 //
 template <class K, class CoeffCache>
-boost::optional< Point_2<K> >
+std::optional< Point_2<K> >
 compute_seed_pointC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment_2_with_ID<K> > > const& tri,
                        typename Trisegment_2<K, Segment_2_with_ID<K> >::SEED_ID sid,
                        CoeffCache& aCoeff_cache)
 {
-  boost::optional< Point_2<K> > p ;
+  std::optional< Point_2<K> > p ;
 
   typedef Trisegment_2<K, Segment_2_with_ID<K> > Trisegment_2 ;
 
@@ -430,7 +430,7 @@ compute_seed_pointC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment_2_with_ID<K
 // of the degenerate seed.
 // A normal collinearity occurs when e0,e1 or e1,e2 are collinear.
 template <class K, class CoeffCache>
-boost::optional< Point_2<K> >
+std::optional< Point_2<K> >
 compute_degenerate_seed_pointC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment_2_with_ID<K> > > const& tri,
                                   CoeffCache& aCoeff_cache )
 {
@@ -448,7 +448,7 @@ compute_degenerate_seed_pointC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment_
 // POSTCONDITION: In case of overflow an empty optional is returned.
 //
 template <class K, class CoeffCache>
-boost::optional< Rational< typename K::FT> >
+std::optional< Rational< typename K::FT> >
 compute_degenerate_offset_lines_isec_timeC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment_2_with_ID<K> > > const& tri,
                                               CoeffCache& aCoeff_cache )
 {
@@ -457,8 +457,8 @@ compute_degenerate_offset_lines_isec_timeC2 ( boost::intrusive_ptr< Trisegment_2
   typedef Point_2<K> Point_2 ;
   typedef Line_2 <K> Line_2 ;
 
-  typedef boost::optional<Point_2> Optional_point_2 ;
-  typedef boost::optional<Line_2>  Optional_line_2 ;
+  typedef std::optional<Point_2> Optional_point_2 ;
+  typedef std::optional<Line_2>  Optional_line_2 ;
 
   CGAL_STSKEL_TRAITS_TRACE("Computing degenerate offset lines isec time for: " << tri ) ;
 
@@ -540,7 +540,7 @@ compute_degenerate_offset_lines_isec_timeC2 ( boost::intrusive_ptr< Trisegment_2
 // Calls the appropriate function depending on the collinearity of the edges.
 //
 template<class K, class TimeCache, class CoeffCache>
-boost::optional< Rational< typename K::FT > >
+std::optional< Rational< typename K::FT > >
 compute_offset_lines_isec_timeC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment_2_with_ID<K> > > const& tri,
                                    TimeCache& aTime_cache,
                                    CoeffCache& aCoeff_cache)
@@ -550,7 +550,7 @@ compute_offset_lines_isec_timeC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment
 
   CGAL_precondition ( tri->collinearity() != TRISEGMENT_COLLINEARITY_ALL ) ;
 
-  boost::optional< Rational< typename K::FT > > rRes =
+  std::optional< Rational< typename K::FT > > rRes =
       tri->collinearity() == TRISEGMENT_COLLINEARITY_NONE ? compute_normal_offset_lines_isec_timeC2    (tri, aCoeff_cache)
                                                           : compute_degenerate_offset_lines_isec_timeC2(tri, aCoeff_cache);
 
@@ -571,7 +571,7 @@ compute_offset_lines_isec_timeC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment
 // POSTCONDITION: In case of overflow an empty optional is returned.
 //
 template<class K, class CoeffCache>
-boost::optional< Point_2<K> >
+std::optional< Point_2<K> >
 construct_normal_offset_lines_isecC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment_2_with_ID<K> > > const& tri,
                                        CoeffCache& aCoeff_cache)
 {
@@ -579,7 +579,7 @@ construct_normal_offset_lines_isecC2 ( boost::intrusive_ptr< Trisegment_2<K, Seg
 
   typedef Line_2<K>  Line_2 ;
 
-  typedef boost::optional<Line_2>  Optional_line_2 ;
+  typedef std::optional<Line_2>  Optional_line_2 ;
 
   CGAL_STSKEL_TRAITS_TRACE("Computing normal offset lines isec point for: " << tri ) ;
 
@@ -632,7 +632,7 @@ construct_normal_offset_lines_isecC2 ( boost::intrusive_ptr< Trisegment_2<K, Seg
 // POSTCONDITION: In case of overflow an empty optional is returned.
 //
 template <class K, class CoeffCache>
-boost::optional< Point_2<K> >
+std::optional< Point_2<K> >
 construct_degenerate_offset_lines_isecC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment_2_with_ID<K> > > const& tri,
                                            CoeffCache& aCoeff_cache)
 {
@@ -641,8 +641,8 @@ construct_degenerate_offset_lines_isecC2 ( boost::intrusive_ptr< Trisegment_2<K,
   typedef Point_2<K> Point_2 ;
   typedef Line_2<K>  Line_2 ;
 
-  typedef boost::optional<Point_2> Optional_point_2 ;
-  typedef boost::optional<Line_2>  Optional_line_2 ;
+  typedef std::optional<Point_2> Optional_point_2 ;
+  typedef std::optional<Line_2>  Optional_line_2 ;
 
   CGAL_STSKEL_TRAITS_TRACE("Computing degenerate offset lines isec point for: " << tri )  ;
 
@@ -694,7 +694,7 @@ construct_degenerate_offset_lines_isecC2 ( boost::intrusive_ptr< Trisegment_2<K,
 // Calls the appropriate function depending on the collinearity of the edges.
 //
 template <class K, class CoeffCache>
-boost::optional< Point_2<K> >
+std::optional< Point_2<K> >
 construct_offset_lines_isecC2 ( boost::intrusive_ptr< Trisegment_2<K, Segment_2_with_ID<K> > > const& tri,
                                 CoeffCache& aCoeff_cache)
 {
diff --git a/Straight_skeleton_2/include/CGAL/create_offset_polygons_2.h b/Straight_skeleton_2/include/CGAL/create_offset_polygons_2.h
index 9a8a97012cb6..e0bfb7bdce01 100644
--- a/Straight_skeleton_2/include/CGAL/create_offset_polygons_2.h
+++ b/Straight_skeleton_2/include/CGAL/create_offset_polygons_2.h
@@ -28,7 +28,7 @@
 #include <CGAL/Polygon_with_holes_2.h>
 #include <CGAL/tags.h>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 #include <boost/range/value_type.hpp>
 #include <memory>
 
@@ -126,7 +126,7 @@ create_partial_interior_straight_skeleton_2 ( FT const&     aMaxTime
   Cartesian_converter<InputKernel, K> conv ;
 
   typename InputKernel::FT lMaxTime = aMaxTime;
-  boost::optional<KFT> lOptMaxTime(conv(lMaxTime)) ;
+  std::optional<KFT> lOptMaxTime(conv(lMaxTime)) ;
 
   SsBuilder ssb( lOptMaxTime ) ;
 
@@ -160,7 +160,7 @@ create_partial_exterior_straight_skeleton_2 ( FT const&      aMaxOffset
 
   // @todo This likely should be done in the kernel K rather than the input kernel (i.e. the same
   // converter stuff that is done in `create_partial_exterior_straight_skeleton_2`?).
-  boost::optional<IFT> margin = compute_outer_frame_margin(aVerticesBegin,
+  std::optional<IFT> margin = compute_outer_frame_margin(aVerticesBegin,
                                                            aVerticesEnd,
                                                            lOffset);
 
diff --git a/Straight_skeleton_2/include/CGAL/create_straight_skeleton_2.h b/Straight_skeleton_2/include/CGAL/create_straight_skeleton_2.h
index d88fb85ac505..967c89f1bf01 100644
--- a/Straight_skeleton_2/include/CGAL/create_straight_skeleton_2.h
+++ b/Straight_skeleton_2/include/CGAL/create_straight_skeleton_2.h
@@ -21,7 +21,7 @@
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 #include <memory>
 
 #include <algorithm>
@@ -159,7 +159,7 @@ create_exterior_straight_skeleton_2 ( FT const&      aMaxOffset
 
   // @todo This likely should be done in the kernel K rather than the input kernel (i.e. the same
   // converter stuff that is done in `create_partial_exterior_straight_skeleton_2`?).
-  boost::optional<IFT> margin = compute_outer_frame_margin( aVerticesBegin,
+  std::optional<IFT> margin = compute_outer_frame_margin( aVerticesBegin,
                                                             aVerticesEnd,
                                                             lOffset );
 
diff --git a/Straight_skeleton_2/include/CGAL/predicates/Polygon_offset_pred_ftC2.h b/Straight_skeleton_2/include/CGAL/predicates/Polygon_offset_pred_ftC2.h
index 88edb2da5fdb..51488b838735 100644
--- a/Straight_skeleton_2/include/CGAL/predicates/Polygon_offset_pred_ftC2.h
+++ b/Straight_skeleton_2/include/CGAL/predicates/Polygon_offset_pred_ftC2.h
@@ -17,7 +17,7 @@
 #include <CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h>
 #include <CGAL/Uncertain.h>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 #include <boost/intrusive_ptr.hpp>
 
 namespace CGAL {
@@ -38,12 +38,12 @@ compare_offset_against_isec_timeC2 ( typename K::FT const& t,
   typedef Rational<FT> Rational ;
   typedef Quotient<FT> Quotient ;
 
-  typedef boost::optional<Rational> Optional_rational ;
+  typedef std::optional<Rational> Optional_rational ;
 
   Uncertain<Comparison_result> rResult = Uncertain<Comparison_result>::indeterminate();
 
-  No_cache<boost::optional<CGAL_SS_i::Rational<typename K::FT> > > lTime_cache ;
-  No_cache<boost::optional<Line_2<K> > > lCoeff_cache ;
+  No_cache<std::optional<CGAL_SS_i::Rational<typename K::FT> > > lTime_cache ;
+  No_cache<std::optional<Line_2<K> > > lCoeff_cache ;
 
   Optional_rational et_ = compute_offset_lines_isec_timeC2(tri, lTime_cache, lCoeff_cache);
   if ( et_ )
diff --git a/Straight_skeleton_2/include/CGAL/predicates/Straight_skeleton_pred_ftC2.h b/Straight_skeleton_2/include/CGAL/predicates/Straight_skeleton_pred_ftC2.h
index 16ee90a800ff..c3bdaedf2f33 100644
--- a/Straight_skeleton_2/include/CGAL/predicates/Straight_skeleton_pred_ftC2.h
+++ b/Straight_skeleton_2/include/CGAL/predicates/Straight_skeleton_pred_ftC2.h
@@ -23,7 +23,7 @@
 #include <CGAL/Quotient.h>
 #include <CGAL/Uncertain.h>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 #include <boost/intrusive_ptr.hpp>
 
 #include <stdexcept>
@@ -176,13 +176,13 @@ Uncertain<Trisegment_collinearity> certified_trisegment_collinearity ( Segment_2
 //
 template<class K, class FT, class TimeCache, class CoeffCache>
 Uncertain<bool> exist_offset_lines_isec2 ( boost::intrusive_ptr< Trisegment_2<K, Segment_2_with_ID<K> > > const& tri,
-                                           boost::optional<FT> const& aMaxTime,
+                                           std::optional<FT> const& aMaxTime,
                                            TimeCache& aTime_cache,
                                            CoeffCache& aCoeff_cache )
 {
 
   typedef Rational<FT>              Rational ;
-  typedef boost::optional<Rational> Optional_rational ;
+  typedef std::optional<Rational> Optional_rational ;
   typedef Quotient<FT>              Quotient ;
 
   Uncertain<bool> rResult = Uncertain<bool>::indeterminate();
@@ -247,7 +247,7 @@ compare_offset_lines_isec_timesC2 ( boost::intrusive_ptr< Trisegment_2<K, Segmen
 
   typedef Rational<FT>       Rational ;
   typedef Quotient<FT>       Quotient ;
-  typedef boost::optional<Rational> Optional_rational ;
+  typedef std::optional<Rational> Optional_rational ;
 
   Uncertain<Comparison_result> rResult = Uncertain<Comparison_result>::indeterminate();
 
@@ -301,7 +301,7 @@ Uncertain<Comparison_result> compare_isec_anglesC2 ( Vector_2<K> const& aBV1
 // Returns true if the point aP is on the positive side of the line supporting the edge
 //
 template<class K>
-Uncertain<bool> is_edge_facing_pointC2 ( boost::optional< Point_2<K> > const& aP,
+Uncertain<bool> is_edge_facing_pointC2 ( std::optional< Point_2<K> > const& aP,
                                          Segment_2_with_ID<K> const& aEdge )
 {
   typedef typename K::FT FT ;
@@ -527,8 +527,8 @@ Uncertain<bool> are_events_simultaneousC2 ( boost::intrusive_ptr< Trisegment_2<K
   typedef Rational<FT> Rational ;
   typedef Quotient<FT> Quotient ;
 
-  typedef boost::optional<Rational> Optional_rational ;
-  typedef boost::optional<Point_2>  Optional_point_2 ;
+  typedef std::optional<Rational> Optional_rational ;
+  typedef std::optional<Point_2>  Optional_point_2 ;
 
   Uncertain<bool> rResult = Uncertain<bool>::indeterminate();
 
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_traits_aux.cpp b/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_traits_aux.cpp
index 9569d50c9f57..3726a9500cd5 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_traits_aux.cpp
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/include/CGAL/test_sls_traits_aux.cpp
@@ -36,7 +36,7 @@ void report( int idx, bool ok, std::string const& info = std::string("") )
 
 bool exist_event( Traits const&  aTraits, triple const& aTriple )
 {
-  boost::optional<FT> lMaxTime ;
+  std::optional<FT> lMaxTime ;
   return CGAL::Do_ss_event_exist_2(aTraits)(aTriple.trisegment(), lMaxTime );
 }
 
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/test_sls.cpp b/Straight_skeleton_2/test/Straight_skeleton_2/test_sls.cpp
index 709158ffbc2f..186d7408b430 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/test_sls.cpp
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/test_sls.cpp
@@ -315,7 +315,7 @@ IRegionPtr load_region( string file, int aShift, int& rStatus )
   return rRegion ;
 }
 
-void update_bbox ( IRegionPtr const& aRegion, boost::optional<Bbox_2>& rBBox )
+void update_bbox ( IRegionPtr const& aRegion, std::optional<Bbox_2>& rBBox )
 {
   if ( aRegion )
   {
@@ -396,7 +396,7 @@ string change_extension ( string aFilename, string aNewExt )
 
 void dump_to_eps ( TestCase const& aCase )
 {
-  boost::optional<Bbox_2> lBBox ;
+  std::optional<Bbox_2> lBBox ;
 
   update_bbox(aCase.Inner.Input, lBBox ) ;
   update_bbox(aCase.Outer.Input, lBBox ) ;
@@ -577,7 +577,7 @@ IPolygonPtr create_outer_frame ( IPolygon const& aOuter )
 
     IFT lOffset = s * 0.3 ;
 
-    boost::optional<IFT> lOptMargin = compute_outer_frame_margin(aOuter.begin(),aOuter.end(),lOffset) ;
+    std::optional<IFT> lOptMargin = compute_outer_frame_margin(aOuter.begin(),aOuter.end(),lOffset) ;
 
     if ( lOptMargin )
     {
@@ -667,7 +667,7 @@ bool is_skeleton_valid( IRegion const& aRegion, ISls const& aSkeleton, bool is_p
 }
 
 
-int create_skeleton ( Zone& rZone, boost::optional<IFT> const& aMaxTime = boost::optional<IFT>() )
+int create_skeleton ( Zone& rZone, std::optional<IFT> const& aMaxTime = std::optional<IFT>() )
 {
   int rStatus = cUnknown ;
 
@@ -742,7 +742,7 @@ int test_zone ( Zone& rZone )
 
   if ( sMaxTime > 0 )
   {
-    boost::optional<IFT> lMaxTime = static_cast<IFT>(sMaxTime) ;
+    std::optional<IFT> lMaxTime = static_cast<IFT>(sMaxTime) ;
     rStatus = create_skeleton(rZone,lMaxTime) ;
   }
   else
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_offset.cpp b/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_offset.cpp
index db7ec3b16224..3480435ec814 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_offset.cpp
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_offset.cpp
@@ -517,7 +517,7 @@ void test_offset_multiple_CCs()
   std::vector<Point_2> input(pts, pts+12);
 
   const FT offset = 50;
-  boost::optional<FT> margin = CGAL::compute_outer_frame_margin(input.begin(), input.end(), offset);
+  std::optional<FT> margin = CGAL::compute_outer_frame_margin(input.begin(), input.end(), offset);
   assert(margin);
 
   // Get the bbox of the polygon
diff --git a/Surface_mesh/examples/Surface_mesh/sm_aabbtree.cpp b/Surface_mesh/examples/Surface_mesh/sm_aabbtree.cpp
index 6fe14b01e7a5..60174dc2fc4d 100644
--- a/Surface_mesh/examples/Surface_mesh/sm_aabbtree.cpp
+++ b/Surface_mesh/examples/Surface_mesh/sm_aabbtree.cpp
@@ -16,8 +16,8 @@ typedef CGAL::Surface_mesh<Point> Mesh;
 typedef CGAL::AABB_face_graph_triangle_primitive<Mesh> Primitive;
 typedef CGAL::AABB_traits<K, Primitive> Traits;
 typedef CGAL::AABB_tree<Traits> Tree;
-typedef boost::optional< Tree::Intersection_and_primitive_id<Segment>::Type > Segment_intersection;
-typedef boost::optional< Tree::Intersection_and_primitive_id<Plane>::Type > Plane_intersection;
+typedef std::optional< Tree::Intersection_and_primitive_id<Segment>::Type > Segment_intersection;
+typedef std::optional< Tree::Intersection_and_primitive_id<Plane>::Type > Plane_intersection;
 typedef Tree::Primitive_id Primitive_id;
 
 int main()
diff --git a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
index 566aec602d73..71608d8d80e7 100644
--- a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
+++ b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
@@ -33,7 +33,7 @@
 #include <boost/graph/adjacency_list.hpp>
 #include <CGAL/boost/graph/dijkstra_shortest_paths.h>
 #include <boost/graph/subgraph.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/boost/graph/named_params_helper.h>
@@ -581,9 +581,9 @@ class Variational_shape_approximation {
         return num_teleported;
 
       // find the best merge pair
-      boost::optional< std::pair<std::size_t, std::size_t> > best_proxies =
+      std::optional< std::pair<std::size_t, std::size_t> > best_proxies =
         find_best_merge(!no_threshold_test);
-      if (best_proxies==boost::none)
+      if (best_proxies==std::nullopt)
         return num_teleported;
       if (px_worst == best_proxies->first || px_worst == best_proxies->second)
         return num_teleported;
@@ -662,7 +662,7 @@ class Variational_shape_approximation {
    * it is returned only if the error change after the merge is lower than the half of the maximum proxy error.
    * @return if the best merge pair is found the optional returned contains the proxy indices, and is empty otherwise.
    */
-  boost::optional< std::pair<std::size_t, std::size_t> >
+  std::optional< std::pair<std::size_t, std::size_t> >
   find_best_merge(const bool use_threshold_test) {
     typedef std::pair<std::size_t, std::size_t> Proxy_pair;
     typedef std::set<Proxy_pair> Pair_set;
@@ -705,7 +705,7 @@ class Variational_shape_approximation {
     }
 
     if (merged_set.empty())
-      return boost::none;
+      return std::nullopt;
 
     // test if merge worth it
     if (use_threshold_test) {
@@ -715,7 +715,7 @@ class Variational_shape_approximation {
           max_error = m_proxies[i].err;
       }
       if (min_error_change > max_error / FT(2.0))
-        return boost::none;
+        return std::nullopt;
     }
 
     return std::make_pair(px0, px1);
diff --git a/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_correctness_test.cpp b/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_correctness_test.cpp
index 40e6885e5ec0..4e6717374899 100644
--- a/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_correctness_test.cpp
+++ b/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_correctness_test.cpp
@@ -69,8 +69,8 @@ bool test_shape(const Mesh &mesh, const std::size_t target_num_proxies)
   approx.run(num_iterations);
 
   // eliminate redundant area (local minima) by merging
-  boost::optional<std::pair<std::size_t, std::size_t> > best_pair = boost::none;
-  while ((best_pair = approx.find_best_merge(true)) != boost::none) {
+  std::optional<std::pair<std::size_t, std::size_t> > best_pair = std::nullopt;
+  while ((best_pair = approx.find_best_merge(true)) != std::nullopt) {
     approx.merge(best_pair->first, best_pair->second);
     approx.run(num_iterations);
   }
diff --git a/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_teleportation_test.cpp b/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_teleportation_test.cpp
index 2ea7139f548d..13a43f965574 100644
--- a/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_teleportation_test.cpp
+++ b/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_teleportation_test.cpp
@@ -153,7 +153,7 @@ int main()
   }
 
   // force teleportation test
-  if ( approx.find_best_merge(true) != boost::none )
+  if ( approx.find_best_merge(true) != std::nullopt )
   {
     std::cout << "Failed: should be no possible merge with test." << std::endl;
     return EXIT_FAILURE;
diff --git a/Surface_mesh_deformation/test/Surface_mesh_deformation/Surface_mesh_deformation_test_commons.h b/Surface_mesh_deformation/test/Surface_mesh_deformation/Surface_mesh_deformation_test_commons.h
index a10cdd1f09c1..bdc14cee74e7 100644
--- a/Surface_mesh_deformation/test/Surface_mesh_deformation/Surface_mesh_deformation_test_commons.h
+++ b/Surface_mesh_deformation/test/Surface_mesh_deformation/Surface_mesh_deformation_test_commons.h
@@ -1,6 +1,6 @@
 #include <boost/graph/graph_traits.hpp>
 #include <CGAL/property_map.h>
-#include <boost/optional.hpp>
+#include <optional>
 #include <vector>
 #include <string>
 #include <fstream>
diff --git a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/AABB_traversal_traits.h b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/AABB_traversal_traits.h
index 18a7c1f2fa76..13216a31fdcd 100644
--- a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/AABB_traversal_traits.h
+++ b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/AABB_traversal_traits.h
@@ -54,7 +54,7 @@ class Listing_intersection_traits_ray_or_segment_triangle
 
     if ( GeomTraits().do_intersect_3_object()(query,
          primitive.datum(m_traits.shared_data())) ) {
-      boost::optional<Intersection_and_primitive_id> intersection
+      std::optional<Intersection_and_primitive_id> intersection
         = m_traits.intersection_object()(query, primitive);
       if(intersection) {
         *m_out_it++ = *intersection;
diff --git a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/Filters.h b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/Filters.h
index 2f361642acfc..7afb29eecf20 100644
--- a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/Filters.h
+++ b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/Filters.h
@@ -28,7 +28,7 @@
 #include <queue>
 #include <cmath>
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <CGAL/boost/graph/iterator.h>
 #include <CGAL/number_utils.h>
 #include <CGAL/double.h>
@@ -63,8 +63,8 @@ class Bilateral_filtering
   void operator()(const Polyhedron& mesh,
                   std::size_t window_size,
                   ValuePropertyMap values,
-                  boost::optional<double> spatial_parameter = boost::optional<double>(),
-                  boost::optional<double> range_parameter = boost::optional<double>()
+                  std::optional<double> spatial_parameter = std::optional<double>(),
+                  std::optional<double> range_parameter = std::optional<double>()
                  ) const {
     typedef typename boost::graph_traits<Polyhedron>::face_descriptor face_descriptor;
     typedef typename boost::graph_traits<Polyhedron>::face_iterator face_iterator;
diff --git a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/SDF_calculation.h b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/SDF_calculation.h
index 9ccde9421a5e..f221ee28c45b 100644
--- a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/SDF_calculation.h
+++ b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/SDF_calculation.h
@@ -26,7 +26,7 @@
 #include <algorithm>
 
 #include <boost/tuple/tuple.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 #define CGAL_NUMBER_OF_MAD 1.5
 
@@ -200,7 +200,7 @@ class SDF_calculation
     disk_sampler(number_of_rays, std::back_inserter(disk_samples));
 
     for( ; facet_begin != facet_end; ++facet_begin) {
-      boost::optional<double> sdf_value = calculate_sdf_value_of_facet(*facet_begin,
+      std::optional<double> sdf_value = calculate_sdf_value_of_facet(*facet_begin,
                                           cone_angle, true, disk_samples);
 
       if(sdf_value) {
@@ -233,7 +233,7 @@ class SDF_calculation
    * \note: normal should have unit length
    */
   template<class SkipPrimitiveFunctor, class FirstIntersectionVisitor>
-  boost::optional<double> calculate_sdf_value_of_point(
+  std::optional<double> calculate_sdf_value_of_point(
     Point center,
     Vector normal,
     SkipPrimitiveFunctor skip,
@@ -250,7 +250,7 @@ class SDF_calculation
    * Overload for taking DiskSampling as template parameter
    */
   template<class SkipPrimitiveFunctor, class FirstIntersectionVisitor, class DiskSampling>
-  boost::optional<double> calculate_sdf_value_of_point(
+  std::optional<double> calculate_sdf_value_of_point(
     Point center,
     Vector normal,
     SkipPrimitiveFunctor skip,
@@ -270,7 +270,7 @@ class SDF_calculation
    * Overload for directly taking sampled points from disk as parameter
    */
   template<class SkipPrimitiveFunctor, class FirstIntersectionVisitor>
-  boost::optional<double> calculate_sdf_value_of_point(
+  std::optional<double> calculate_sdf_value_of_point(
     const Point& center,
     const Vector& normal,
     SkipPrimitiveFunctor skip,
@@ -346,10 +346,10 @@ class SDF_calculation
     }
 
     if(ray_distances.empty()) {
-      return boost::none;
+      return std::nullopt;
     }
 
-    return boost::optional<double>(remove_outliers_and_calculate_sdf_value(
+    return std::optional<double>(remove_outliers_and_calculate_sdf_value(
                                      ray_distances));
   }
 
@@ -369,7 +369,7 @@ class SDF_calculation
    * @param samples sampled points from a unit-disk which are corresponds to rays picked from cone
    * @return calculated SDF value
    */
-  boost::optional<double> calculate_sdf_value_of_facet(
+  std::optional<double> calculate_sdf_value_of_facet(
     face_handle facet,
     double cone_angle,
     bool accept_if_acute,
@@ -379,11 +379,11 @@ class SDF_calculation
     const Point p2 = get(vertex_point_map,target(next(halfedge(facet,mesh),mesh),mesh));
     const Point p3 = get(vertex_point_map,target(prev(halfedge(facet,mesh),mesh),mesh));
     const Point center  = centroid_functor(p1, p2, p3);
-    if (collinear_functor(p1, p2, p3)) return boost::none;
+    if (collinear_functor(p1, p2, p3)) return std::nullopt;
     Vector normal = normal_functor(p2, p1, p3);
     normal=scale_functor(normal,
                          FT(1.0/std::sqrt(to_double(normal.squared_length()))));
-    if (normal!=normal) return boost::none;
+    if (normal!=normal) return std::nullopt;
     CGAL::internal::SkipPrimitiveFunctor<face_handle>
     skip(facet);
     CGAL::internal::FirstIntersectionVisitor<face_handle>
@@ -478,7 +478,7 @@ class SDF_calculation
   boost::tuple<bool, bool, double, Primitive_id> ray_casting(
     const Ray& query, SkipFunctor s, bool accept_if_acute) const {
 
-    const boost::optional< typename Tree::template Intersection_and_primitive_id<Ray>::Type >
+    const std::optional< typename Tree::template Intersection_and_primitive_id<Ray>::Type >
       min_intersection = tree.first_intersection(query, s);
     if(!min_intersection)
       return boost::make_tuple(false, false, 0.0, Primitive_id());
diff --git a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
index 652c3457496d..e44cd401304d 100644
--- a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
+++ b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
@@ -152,7 +152,7 @@ class SurfaceMeshShortestPathTraits
   /*!
   Function object type.
   Must provide
-  `boost::optional< boost::variant< T... > > operator()(A obj1, B obj2)`
+  `std::optional< boost::variant< T... > > operator()(A obj1, B obj2)`
   to compute the intersection between `obj1` and `obj2`, where `A` and `B` can be any type amongst
   `Line_2`, `Ray_2`, `Segment_2`.
   */
diff --git a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h
index 0b94bf1d71cd..241c96473501 100644
--- a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h
+++ b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h
@@ -3049,7 +3049,7 @@ class Surface_mesh_shortest_path
     typename Traits::Construct_barycentric_coordinates cbc(traits.construct_barycentric_coordinates_object());
     typename Traits::Compute_squared_distance_3 csd3(traits.compute_squared_distance_3_object());
     typedef typename AABB_face_graph_tree::template Intersection_and_primitive_id<Ray_3>::Type Intersection_type;
-    typedef boost::optional<Intersection_type> Ray_intersection;
+    typedef std::optional<Intersection_type> Ray_intersection;
 
     std::vector<Ray_intersection> intersections;
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
index 5fa7e3c33959..9e62e74917f3 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
@@ -46,7 +46,7 @@ class Bounded_distance_placement
 
   // Returns the placement computed by `base_placement`, provided the distance between the input
   // and this placement is smaller than `d`. Otherwise, nothing is returned.
-  boost::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile) const;
+  std::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile) const;
 
   // @}
 };
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h
index 53cfb706bd68..adc991a675ed 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h
@@ -44,8 +44,8 @@ class Bounded_normal_change_filter {
   returns the placement, if it does not get filtered by the wrapped filter
   and if no triangle in the profile has its normal changed by more than 90 degrees.
   */
-  boost::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile,
-                                                           boost::optional<typename Profile::Point> op) const;
+  std::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile,
+                                                           std::optional<typename Profile::Point> op) const;
 
   /// @}
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h
index 8f08e9a071c5..90e68a5320dc 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h
@@ -46,7 +46,7 @@ class Bounded_normal_change_placement {
   Returns the placement computed by `get_placement`, if no
   triangle in the profile has its normal changed by more than 90 degree.
   */
-  boost::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile) const;
+  std::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile) const;
 
   /// @}
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h
index f9b904bfb3f2..814c64f2793b 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h
@@ -32,7 +32,7 @@ class Constrained_placement
                         const Get_placement_& get_placement = Get_placement_());
   /// @}
 
-  boost::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile) const
+  std::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile) const
 
 };
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h
index 52c7c54dee8f..8c9080554929 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h
@@ -36,8 +36,8 @@ class Edge_length_cost
 
   The argument `placement` is unused.
   */
-  boost::optional<typename Edge_profile::FT> operator()(const Edge_profile& profile,
-                                                        const boost::optional<typename Edge_profile::Point>& placement) const;
+  std::optional<typename Edge_profile::FT> operator()(const Edge_profile& profile,
+                                                        const std::optional<typename Edge_profile::Point>& placement) const;
 
   /// @}
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h
index 36e68f95263b..433a8a64755f 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h
@@ -36,9 +36,9 @@ LindstromTurk_cost<TriangleMesh>(const FT factor = FT(0.5));
 Returns the cost of collapsing the edge (represented by its profile) considering
 the new `placement` computed for it.
 */
-boost::optional<typename Edge_profile::FT>
+std::optional<typename Edge_profile::FT>
 operator()(const Edge_profile& edge_profile,
-           const boost::optional<typename Edge_profile::Point>& placement) const;
+           const std::optional<typename Edge_profile::Point>& placement) const;
 
 /// @}
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h
index 20ae3890439a..8471efae84df 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h
@@ -38,7 +38,7 @@ class LindstromTurk_placement
   Returns the new position for the remaining vertex after collapsing the edge
   (represented by its profile).
   */
-  boost::optional<typename Edge_profile::Point>
+  std::optional<typename Edge_profile::Point>
   operator()(const Edge_profile& profile) const;
 
   /// @}
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h
index 2cd81de679e6..11fda0b9f253 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h
@@ -36,7 +36,7 @@ class Midpoint_placement
   the points of the source and target vertices
   (`profile.p0()` and `profile.p1()`)
   */
-  boost::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile) const;
+  std::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile) const;
 
 /// @}
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
index dadccaa8e4d8..61440bec09e1 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
@@ -50,8 +50,8 @@ class Polyhedral_envelope_filter {
   returns the placement, if it does not get filtered by the wrapped filter,
   and if all triangles in the profile are inside the polyhedral envelope.
   */
-  boost::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile,
-                                                           boost::optional<typename Profile::Point> op) const;
+  std::optional<typename Edge_profile::Point> operator()(const Edge_profile& profile,
+                                                           std::optional<typename Profile::Point> op) const;
 
   /// @}
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/EdgeCollapseSimplificationVisitor.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/EdgeCollapseSimplificationVisitor.h
index 264f56319c71..0bbb8e880785 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/EdgeCollapseSimplificationVisitor.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/EdgeCollapseSimplificationVisitor.h
@@ -47,7 +47,7 @@ for each edge collected.
 
 */
 void OnCollected(const Edge_profile& profile,
-                 boost::optional<Edge_profile::FT> cost);
+                 std::optional<Edge_profile::FT> cost);
 
 /*!
 Called during the <I>processing phase</I> (when edges are collapsed),
@@ -63,7 +63,7 @@ the edge will not be collapsed.
 
 */
 void OnSelected(const Edge_profile& profile,
-                boost::optional<Edge_profile::FT> cost,
+                std::optional<Edge_profile::FT> cost,
                 const Edge_profile::edges_size_type initial_edge_count,
                 const Edge_profile::edges_size_type current_edge_count);
 
@@ -76,7 +76,7 @@ the edge will not be collapsed.
 
 */
 void OnCollapsing(const Edge_profile& profile,
-                  boost::optional<Edge_profile::Point> placement);
+                  std::optional<Edge_profile::Point> placement);
 
 /*!
 Called when an edge has been collapsed and replaced by the vertex `vd`
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
index 24a05f636c29..d07a362bb199 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
@@ -5,7 +5,7 @@
 The concept `GetCost` describes the requirements for the <I>policy function object</I>
 which gets the <I>collapse cost</I> of an edge.
 
-The cost returned is a `boost::optional` value (i.e.\ it can be absent).
+The cost returned is a `std::optional` value (i.e.\ it can be absent).
 An <I>absent</I> cost indicates that the edge should not be collapsed.
 This could be the result of a computational limitation (such as an overflow),
 or can be intentionally returned to prevent the edge from being collapsed.
@@ -31,8 +31,8 @@ class GetCost
   Computes and returns the cost of collapsing the edge (represented by its profile),
   using the calculated placement.
   */
-  boost::optional<typename Edge_profile::FT> operator()(const Edge_profile& edge_profile,
-                                                        const boost::optional<typename Edge_profile::Point>& placement) const;
+  std::optional<typename Edge_profile::FT> operator()(const Edge_profile& edge_profile,
+                                                        const std::optional<typename Edge_profile::Point>& placement) const;
 
 /// @}
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
index e576472cb34e..fa9347cdd284 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
@@ -7,7 +7,7 @@ function object</I> which gets the <I>collapse placement</I> of an edge,
 that is, the new position of the vertex that remains after a
 halfedge-collapse operation.
 
-The placement returned is a `boost::optional` value (i.e., it can
+The placement returned is a `std::optional` value (i.e., it can
 be absent). An absent result indicates that the edge should not be collapsed.
 This could be the result of a computational limitation (such as an overflow),
 or can be intentionally returned to prevent the edge from being collapsed.
@@ -36,7 +36,7 @@ class GetPlacement
   Computes and returns the placement, that is, the position of the vertex
   which replaces the collapsing edge (represented by its profile).
   */
-  boost::optional<Edge_profile::Point>operator()(const Edge_profile& profile) const;
+  std::optional<Edge_profile::Point>operator()(const Edge_profile& profile) const;
 
   /// @}
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
index 324c87f45ee7..a2a493e904d0 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
@@ -9,8 +9,8 @@ an edge is taken from the priority queue in order to get collapsed,
 and neither when the edge is inserted nor when it is updated in the
 priority queue.
 
-The placement returned is a `boost::optional` value (i.e., it can
-be absent). The value `boost::none` indicates that the edge should not be collapsed.
+The placement returned is a `std::optional` value (i.e., it can
+be absent). The value `std::nullopt` indicates that the edge should not be collapsed.
 
 \cgalRefines{DefaultConstructible,CopyConstructible}
 
@@ -33,7 +33,7 @@ class PlacementFilter
   filters the placement.
 
   */
-  boost::optional<Edge_profile::Point> operator()(const Edge_profile& profile, boost::optional<Edge_profile::Point> placement) const;
+  std::optional<Edge_profile::Point> operator()(const Edge_profile& profile, std::optional<Edge_profile::Point> placement) const;
 
   /// @}
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Surface_mesh_simplification.txt b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Surface_mesh_simplification.txt
index 31c3939c9265..4dcf3ccfb12b 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Surface_mesh_simplification.txt
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Surface_mesh_simplification.txt
@@ -369,7 +369,7 @@ Simple mesh before and after the collapse of edge `v-w` into vertex `w`. While t
 The class `Surface_mesh_simplification::Bounded_normal_change_filter` checks if
 a placement would invert the normal of a face around the stars of the
 two vertices of an edge that is candidate for an edge collapse.  It then
-rejects this placement by returning `boost::none`.
+rejects this placement by returning `std::nullopt`.
 
 \note This filter class replaces the usage of the class `Surface_mesh_simplification::Bounded_normal_change_placement`.
 Using the filter is faster as it is only performed on the edge to be collapsed next,
diff --git a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_bounded_normal_change.cpp b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_bounded_normal_change.cpp
index bc89a3b77aa4..04561d2239cf 100644
--- a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_bounded_normal_change.cpp
+++ b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_bounded_normal_change.cpp
@@ -19,13 +19,13 @@ namespace SMS = CGAL::Surface_mesh_simplification;
 struct Dummy_placement {
 
   template <typename Profile>
-  boost::optional<typename Profile::Point> operator()(const Profile&) const
+  std::optional<typename Profile::Point> operator()(const Profile&) const
   {
-    return boost::none;
+    return std::nullopt;
   }
 
  template <typename Profile>
- boost::optional<typename Profile::Point> operator()(const Profile&, const boost::optional<typename Profile::Point>& op) const
+ std::optional<typename Profile::Point> operator()(const Profile&, const std::optional<typename Profile::Point>& op) const
   {
     return op;
   }
diff --git a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_visitor_surface_mesh.cpp b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_visitor_surface_mesh.cpp
index 16427c55226b..ec9993b87ddb 100644
--- a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_visitor_surface_mesh.cpp
+++ b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_visitor_surface_mesh.cpp
@@ -44,7 +44,7 @@ struct My_visitor : SMS::Edge_collapse_visitor_base<Surface_mesh>
   My_visitor(Stats* s) : stats(s) {}
 
   // Called during the collecting phase for each edge collected.
-  void OnCollected(const Profile&, const boost::optional<double>&)
+  void OnCollected(const Profile&, const std::optional<double>&)
   {
     ++(stats->collected);
     std::cerr << "\rEdges collected: " << stats->collected << std::flush;
@@ -53,7 +53,7 @@ struct My_visitor : SMS::Edge_collapse_visitor_base<Surface_mesh>
   // Called during the processing phase for each edge selected.
   // If cost is absent the edge won't be collapsed.
   void OnSelected(const Profile&,
-                  boost::optional<double> cost,
+                  std::optional<double> cost,
                   std::size_t initial,
                   std::size_t current)
   {
@@ -69,7 +69,7 @@ struct My_visitor : SMS::Edge_collapse_visitor_base<Surface_mesh>
   // Called during the processing phase for each edge being collapsed.
   // If placement is absent the edge is left uncollapsed.
   void OnCollapsing(const Profile&,
-                    boost::optional<Point> placement)
+                    std::optional<Point> placement)
   {
     if(!placement)
       ++(stats->placement_uncomputable);
diff --git a/Surface_mesh_simplification/include/CGAL/Cartesian/MatrixC33.h b/Surface_mesh_simplification/include/CGAL/Cartesian/MatrixC33.h
index 34a14497364e..7cc2858020b3 100644
--- a/Surface_mesh_simplification/include/CGAL/Cartesian/MatrixC33.h
+++ b/Surface_mesh_simplification/include/CGAL/Cartesian/MatrixC33.h
@@ -18,7 +18,7 @@
 #include <CGAL/number_utils.h>
 #include <CGAL/Vector_3.h>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 
@@ -200,11 +200,11 @@ MatrixC33<R> adjoint_matrix(const MatrixC33<R>& m)
 }
 
 template<class R>
-boost::optional< MatrixC33<R> > inverse_matrix(const MatrixC33<R>& m)
+std::optional< MatrixC33<R> > inverse_matrix(const MatrixC33<R>& m)
 {
   typedef typename R::RT                                        RT;
   typedef MatrixC33<R>                                          Matrix;
-  typedef boost::optional<Matrix>                               result_type;
+  typedef std::optional<Matrix>                               result_type;
 
   result_type rInverse;
 
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Edge_collapse_visitor_base.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Edge_collapse_visitor_base.h
index 94870fb968cc..87d24f3dd887 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Edge_collapse_visitor_base.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Edge_collapse_visitor_base.h
@@ -46,9 +46,9 @@ struct Edge_collapse_visitor_base
   void OnStarted(Triangle_mesh&) {}
   void OnFinished(Triangle_mesh&) {}
   void OnStopConditionReached(const Profile&) {}
-  void OnCollected(const Profile&, const boost::optional<FT>&) {}
-  void OnSelected(const Profile&, const boost::optional<FT>&, size_type, size_type) {}
-  void OnCollapsing(const Profile&, const boost::optional<Point>&) {}
+  void OnCollected(const Profile&, const std::optional<FT>&) {}
+  void OnSelected(const Profile&, const std::optional<FT>&, size_type, size_type) {}
+  void OnCollapsing(const Profile&, const std::optional<Point>&) {}
   void OnCollapsed(const Profile&, const vertex_descriptor&) {}
   void OnNonCollapsable(const Profile&) {}
 };
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
index 36f2f855312e..103eec6878ba 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
@@ -22,7 +22,7 @@
 #include <CGAL/intersections.h>
 #include <CGAL/boost/graph/named_params_helper.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <vector>
 #include <type_traits>
@@ -93,12 +93,12 @@ class Bounded_distance_placement
   }
 
   template <typename Profile>
-  boost::optional<typename Profile::Point>
+  std::optional<typename Profile::Point>
   operator()(const Profile& profile) const
   {
     typedef typename Profile::Point                                           Point;
 
-    boost::optional<typename Profile::Point> op = m_base_placement(profile);
+    std::optional<typename Profile::Point> op = m_base_placement(profile);
     if(op)
     {
       if(m_tree_ptr == nullptr)
@@ -121,7 +121,7 @@ class Bounded_distance_placement
          m_tree_ptr->do_intersect(CGAL::Sphere_3<Geom_traits>(p, m_sq_threshold_dist)))
         return op;
 
-      return boost::optional<Point>();
+      return std::optional<Point>();
     }
 
     return op;
@@ -153,13 +153,13 @@ class Bounded_distance_placement<BasePlacement, CGAL::AABB_tree<AABBTraits> >
   { }
 
   template <typename Profile>
-  boost::optional<typename Profile::Point>
+  std::optional<typename Profile::Point>
   operator()(const Profile& profile) const
   {
     typedef typename Profile::Geom_traits                                     Geom_traits;
     typedef typename Profile::Point                                           Point;
 
-    boost::optional<typename Profile::Point> op = m_base_placement(profile);
+    std::optional<typename Profile::Point> op = m_base_placement(profile);
     if(op)
     {
       CGAL_assertion(m_tree_ptr != nullptr);
@@ -173,7 +173,7 @@ class Bounded_distance_placement<BasePlacement, CGAL::AABB_tree<AABBTraits> >
          m_tree_ptr->do_intersect(CGAL::Sphere_3<Geom_traits>(p, m_sq_threshold_dist)))
         return op;
 
-      return boost::optional<Point>();
+      return std::optional<Point>();
     }
 
     return op;
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h
index 41e8af443377..036d5bb9b447 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h
@@ -15,7 +15,7 @@
 #include<CGAL/Surface_mesh_simplification/internal/Common.h>
 #include <CGAL/property_map.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 namespace Surface_mesh_simplification {
@@ -31,8 +31,8 @@ class Bounded_normal_change_filter
 
 
   template <typename Profile>
-  boost::optional<typename Profile::Point>
-  operator()(const Profile& profile, boost::optional<typename Profile::Point> op) const
+  std::optional<typename Profile::Point>
+  operator()(const Profile& profile, std::optional<typename Profile::Point> op) const
   {
     typedef typename Profile::VertexPointMap                              Vertex_point_map;
 
@@ -78,7 +78,7 @@ class Bounded_normal_change_filter
            Vector n2 = gt.construct_cross_product_vector_3_object()(eq2p, eq2r);
 
            if(!is_positive(gt.compute_scalar_product_3_object()(n1, n2)))
-             return boost::optional<typename Profile::Point>();
+             return std::optional<typename Profile::Point>();
 
            ++it;
          }
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h
index 379847d3ffee..1a1b9aafd129 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/property_map.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 namespace Surface_mesh_simplification {
@@ -29,7 +29,7 @@ class Bounded_normal_change_placement
   {}
 
   template <typename Profile>
-  boost::optional<typename Profile::Point>
+  std::optional<typename Profile::Point>
   operator()(const Profile& profile) const
   {
     typedef typename Profile::VertexPointMap                              Vertex_point_map;
@@ -43,7 +43,7 @@ class Bounded_normal_change_placement
     const Geom_traits& gt = profile.geom_traits();
     const Vertex_point_map& vpm = profile.vertex_point_map();
 
-    boost::optional<typename Profile::Point> op = m_get_placement(profile);
+    std::optional<typename Profile::Point> op = m_get_placement(profile);
     if(op)
     {
       // triangles returns the triangles of the star of the vertices of the edge to collapse
@@ -76,7 +76,7 @@ class Bounded_normal_change_placement
            Vector n2 = gt.construct_cross_product_vector_3_object()(eq2p, eq2r);
 
            if(!is_positive(gt.compute_scalar_product_3_object()(n1, n2)))
-             return boost::optional<typename Profile::Point>();
+             return std::optional<typename Profile::Point>();
 
            ++it;
          }
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h
index 07749bdc643a..38f4b478ad35 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h
@@ -31,7 +31,7 @@ class Constrained_placement
   {}
 
   template <typename Profile>
-  boost::optional<typename Profile::Point> operator()(const Profile& profile) const
+  std::optional<typename Profile::Point> operator()(const Profile& profile) const
   {
     typedef typename Profile::TM                                    TM;
     typedef typename boost::graph_traits<TM>::halfedge_descriptor   halfedge_descriptor;
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h
index 079f480076ee..7b5cab2ba26d 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h
@@ -27,9 +27,9 @@ class Edge_length_cost
   Edge_length_cost() {}
 
   template <typename Profile, typename T>
-  boost::optional<typename Profile::FT> operator()(const Profile& profile, const T& /*placement*/) const
+  std::optional<typename Profile::FT> operator()(const Profile& profile, const T& /*placement*/) const
   {
-    typedef boost::optional<typename Profile::FT>                     result_type;
+    typedef std::optional<typename Profile::FT>                     result_type;
     return result_type(profile.geom_traits().compute_squared_distance_3_object()(profile.p0(), profile.p1()));
   }
 };
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h
index 2f0abb387892..bd576f56530a 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h
@@ -22,7 +22,7 @@
 #include <fastenvelope/FastEnvelope.h>
 #include <fastenvelope/Types.hpp>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 #include <vector>
 #include <type_traits>
@@ -97,8 +97,8 @@ class FastEnvelope_filter
 
 
   template <typename Profile>
-  boost::optional<typename Profile::Point>
-  operator()(const Profile& profile, boost::optional<typename Profile::Point> op) const
+  std::optional<typename Profile::Point>
+  operator()(const Profile& profile, std::optional<typename Profile::Point> op) const
   {
     typedef typename Profile::Point Point;
     typedef typename Profile::vertex_descriptor_vector Link;
@@ -116,7 +116,7 @@ class FastEnvelope_filter
 
       if(m_fast_envelope->is_outside(vecp)){
         // the new placement is outside envelope
-        return boost::none;
+        return std::nullopt;
       }
 
       const Link link = profile.link();
@@ -134,7 +134,7 @@ class FastEnvelope_filter
 
         if(m_fast_envelope->is_outside(triangle)){
           // the triangle intersects the envelope
-          return boost::none;
+          return std::nullopt;
         }
         vecv = vecw;
 
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h
index 8a3a11a1213f..b1421d750fae 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h
@@ -32,9 +32,9 @@ class LindstromTurk_cost
   {}
 
   template <typename Profile>
-  boost::optional<typename Profile::FT>
+  std::optional<typename Profile::FT>
   operator()(const Profile& profile,
-             const boost::optional<typename Profile::Point>& placement) const
+             const std::optional<typename Profile::Point>& placement) const
   {
     return internal::LindstromTurkCore<TM, Profile>(m_LT_params, profile).compute_cost(placement);
   }
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h
index 9dc14adcf942..82bf9cc33efc 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h
@@ -31,7 +31,7 @@ class LindstromTurk_placement
   {}
 
   template <typename Profile>
-  boost::optional<typename Profile::Point> operator()(const Profile& profile) const
+  std::optional<typename Profile::Point> operator()(const Profile& profile) const
   {
     return internal::LindstromTurkCore<TM,Profile>(m_LT_params, profile).compute_placement();
   }
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h
index 7429f670b5c0..c76fb670318a 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h
@@ -29,9 +29,9 @@ class Midpoint_placement
   Midpoint_placement() {}
 
   template <typename Profile>
-  boost::optional<typename Profile::Point> operator()(const Profile& profile) const
+  std::optional<typename Profile::Point> operator()(const Profile& profile) const
   {
-    typedef boost::optional<typename Profile::Point>              result_type;
+    typedef std::optional<typename Profile::Point>              result_type;
     return result_type(profile.geom_traits().construct_midpoint_3_object()(profile.p0(), profile.p1()));
   }
 };
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h
index d669e44f3178..590747a252b3 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/GarlandHeckbert_policy_base.h
@@ -22,7 +22,7 @@
 
 #include <Eigen/Dense>
 
-#include <boost/optional/optional.hpp>
+#include <optional>
 
 namespace CGAL {
 namespace Surface_mesh_simplification {
@@ -199,14 +199,14 @@ class GarlandHeckbert_cost_and_placement
 public:
   // Cost
   template <typename Profile>
-  boost::optional<typename Profile::FT>
+  std::optional<typename Profile::FT>
   operator()(const Profile& profile,
-             const boost::optional<typename Profile::Point>& placement) const
+             const std::optional<typename Profile::Point>& placement) const
   {
-    typedef boost::optional<typename Profile::FT>                              Optional_FT;
+    typedef std::optional<typename Profile::FT>                              Optional_FT;
 
     if(!placement)
-      return boost::optional<typename Profile::FT>();
+      return std::optional<typename Profile::FT>();
 
     CGAL_precondition(!get(vcm(), profile.v0()).isZero(0));
     CGAL_precondition(!get(vcm(), profile.v1()).isZero(0));
@@ -222,7 +222,7 @@ class GarlandHeckbert_cost_and_placement
 public:
   // Placement
   template <typename Profile>
-  boost::optional<typename Profile::Point> operator()(const Profile& profile) const
+  std::optional<typename Profile::Point> operator()(const Profile& profile) const
   {
     CGAL_precondition(!get(vcm(), profile.v0()).isZero(0));
     CGAL_precondition(!get(vcm(), profile.v1()).isZero(0));
@@ -236,7 +236,7 @@ class GarlandHeckbert_cost_and_placement
 
     const Col_4 opt = construct_optimum(combined_matrix, p0, p1);
 
-    boost::optional<typename Profile::Point> pt = typename Profile::Point(opt(0) / opt(3),
+    std::optional<typename Profile::Point> pt = typename Profile::Point(opt(0) / opt(3),
                                                                           opt(1) / opt(3),
                                                                           opt(2) / opt(3));
 
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
index b0fce64b6d91..59002f636814 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
@@ -55,9 +55,9 @@ class LindstromTurkCore
   typedef typename Geom_traits::FT                                       FT;
   typedef typename Geom_traits::Vector_3                                 Vector;
 
-  typedef boost::optional<FT>                                            Optional_FT;
-  typedef boost::optional<Point>                                         Optional_point;
-  typedef boost::optional<Vector>                                        Optional_vector;
+  typedef std::optional<FT>                                            Optional_FT;
+  typedef std::optional<Point>                                         Optional_point;
+  typedef std::optional<Vector>                                        Optional_vector;
 
   typedef MatrixC33<Geom_traits>                                         Matrix;
 
@@ -152,7 +152,7 @@ private :
   static bool is_finite(const Matrix& m) { return is_finite(m.r0()) && is_finite(m.r1()) && is_finite(m.r2()); }
 
   template<class T>
-  static boost::optional<T> filter_infinity(const T& n) { return is_finite(n) ? boost::optional<T>(n) : boost::optional<T>(); }
+  static std::optional<T> filter_infinity(const T& n) { return is_finite(n) ? std::optional<T>(n) : std::optional<T>(); }
 
 
 private:
@@ -298,7 +298,7 @@ compute_placement()
   if(mConstraints_n == 3)
   {
     // If the matrix is singular it's inverse cannot be computed so an 'absent' value is returned.
-    boost::optional<Matrix> lOptional_Ai = inverse_matrix(mConstraints_A);
+    std::optional<Matrix> lOptional_Ai = inverse_matrix(mConstraints_A);
     if(lOptional_Ai)
     {
       const Matrix& lAi = *lOptional_Ai;
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h
index a11066435a3f..4ed45a02d1e6 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h
@@ -19,7 +19,7 @@
 
 #include <boost/config.hpp>
 #include <boost/iterator_adaptors.hpp>
-#include <boost/optional/optional.hpp>
+#include <optional>
 #include <boost/tuple/tuple.hpp>
 #include <boost/format.hpp>
 #include <boost/graph/graph_traits.hpp>
@@ -40,8 +40,8 @@ namespace internal {
   struct Dummy_filter {
   template <typename Profile>
   inline
-  const boost::optional<typename Profile::Point>
-  operator()(const Profile&, const boost::optional<typename Profile::Point>& op) const
+  const std::optional<typename Profile::Point>
+  operator()(const Profile&, const std::optional<typename Profile::Point>& op) const
   {
     return op;
   }
@@ -94,7 +94,7 @@ inline std::string matrix_to_string(const Matrix& m) {
 }
 
 template<class T>
-inline std::string optional_to_string(const boost::optional<T>& o) {
+inline std::string optional_to_string(const std::optional<T>& o) {
   if(o)
     return boost::str(boost::format("%1%") % *o);
   else return std::string("NONE");
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h
index a662b4c24c0b..0e45e5353ca5 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h
@@ -127,8 +127,8 @@ class EdgeCollapse
   typedef typename Geom_traits::Vector_3                                  Vector;
   typedef typename Geom_traits::Equal_3                                   Equal_3;
 
-  typedef boost::optional<FT>                                             Cost_type;
-  typedef boost::optional<Point>                                          Placement_type;
+  typedef std::optional<FT>                                             Cost_type;
+  typedef std::optional<Point>                                          Placement_type;
 
   struct Compare_id
   {
@@ -149,7 +149,7 @@ class EdgeCollapse
 
     bool operator()(const halfedge_descriptor a, const halfedge_descriptor b) const
     {
-      // NOTE: A cost is a boost::optional<> value.
+      // NOTE: A cost is a std::optional<> value.
       // Absent optionals are ordered first; that is, "none < T" and "T > none" for any defined T != none.
       // In consequence, edges with undefined costs will be promoted to the top of the priority queue and popped out first.
       return m_algorithm->get_data(a).cost() < m_algorithm->get_data(b).cost();
@@ -333,9 +333,9 @@ class EdgeCollapse
     CGAL_expensive_assertion(!mPQ->contains(h));
   }
 
-  boost::optional<halfedge_descriptor> pop_from_PQ()
+  std::optional<halfedge_descriptor> pop_from_PQ()
   {
-    boost::optional<halfedge_descriptor> opt_h = mPQ->extract_top();
+    std::optional<halfedge_descriptor> opt_h = mPQ->extract_top();
     if(opt_h)
     {
       CGAL_assertion(is_primary_edge(*opt_h));
@@ -592,7 +592,7 @@ loop()
 
   // Pops and processes each edge from the PQ
 
-  boost::optional<halfedge_descriptor> opt_h;
+  std::optional<halfedge_descriptor> opt_h;
 
 #ifdef CGAL_SURF_SIMPL_INTERMEDIATE_STEPS_PRINTING
   int i_rm = 0;
@@ -630,7 +630,7 @@ loop()
           std::cout << "step " << i_rm << " " << get(m_vpm, source(*h, m_tm))
                                        << " " << get(m_vpm, target(*h, m_tm)) << "\n";
 #endif
-          if(m_should_ignore(profile, placement)!= boost::none){
+          if(m_should_ignore(profile, placement)!= std::nullopt){
             collapse(profile, placement);
           }
           else
diff --git a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_Envelope.cpp b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_Envelope.cpp
index 0f5c8e99109d..f24432ba3ad3 100644
--- a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_Envelope.cpp
+++ b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_Envelope.cpp
@@ -46,7 +46,7 @@ struct My_visitor : SMS::Edge_collapse_visitor_base<Surface>
   My_visitor(Stats* s) : stats(s) {}
 
   // Called during the collecting phase for each edge collected.
-  void OnCollected(const Profile&, const boost::optional<double>&)
+  void OnCollected(const Profile&, const std::optional<double>&)
   {
     ++(stats->collected);
     std::cerr << "\rEdges collected: " << stats->collected << std::endl;
@@ -55,7 +55,7 @@ struct My_visitor : SMS::Edge_collapse_visitor_base<Surface>
   // Called during the processing phase for each edge selected.
   // If cost is absent the edge won't be collapsed.
   void OnSelected(const Profile&,
-                  boost::optional<double> cost,
+                  std::optional<double> cost,
                   std::size_t /* initial */,
                   std::size_t /* current */)
   {
@@ -67,7 +67,7 @@ struct My_visitor : SMS::Edge_collapse_visitor_base<Surface>
   // Called during the processing phase for each edge being collapsed.
   // If placement is absent the edge is left uncollapsed.
   void OnCollapsing(const Profile&,
-                    boost::optional<Point> placement)
+                    std::optional<Point> placement)
   {
     if(!placement)
       ++(stats->placement_uncomputable);
diff --git a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_Polyhedron_3.cpp b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_Polyhedron_3.cpp
index e1b27a66d551..00e6cf685019 100644
--- a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_Polyhedron_3.cpp
+++ b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_Polyhedron_3.cpp
@@ -198,7 +198,7 @@ void write (SurfaceSP aSurface, string aName)
 }
 
 template<class T>
-string opt2str (const boost::optional<T>& o)
+string opt2str (const std::optional<T>& o)
 {
   ostringstream ss;
   if(o)
@@ -222,7 +222,7 @@ string point2str (const P& p)
 }
 
 template<class P>
-string optpoint2str (const boost::optional<P>& p)
+string optpoint2str (const std::optional<P>& p)
 {
   ostringstream ss;
   if(p)
@@ -232,7 +232,7 @@ string optpoint2str (const boost::optional<P>& p)
   return ss.str();
 }
 template<class N>
-string optfloat2str (const boost::optional<N>& n)
+string optfloat2str (const std::optional<N>& n)
 {
   ostringstream ss;
   if(n)
@@ -258,7 +258,7 @@ string edge2str (const E& e)
   return ss.str();
 }
 
-template<class T> ostream&  operator << (ostream& os, const boost::optional<T>& o) { return os << opt2str(o); }
+template<class T> ostream&  operator << (ostream& os, const std::optional<T>& o) { return os << opt2str(o); }
 
 string normalize_EOL (string line)
 {
@@ -304,12 +304,12 @@ public :
     CHECK(aSurface.is_valid());
   }
 
-  virtual void OnCollected(const Profile& aProfile, const boost::optional<FT>& aCost) const
+  virtual void OnCollected(const Profile& aProfile, const std::optional<FT>& aCost) const
   {
     TEST_TRACE(str (boost::format("Collecting %1% : cost=%2%") % edge2str(aProfile.v0_v1()) % optfloat2str(aCost)));
   }
 
-  virtual void OnCollapsing(const Profile& aProfile, const boost::optional<Point>& aP) const
+  virtual void OnCollapsing(const Profile& aProfile, const std::optional<Point>& aP) const
   {
     TEST_TRACE(str (boost::format("S %1% - Collapsing %2% : placement=%3%") % mStep % edge2str(aProfile.v0_v1()) % optpoint2str(aP)));
 
diff --git a/Surface_mesher/include/CGAL/AABB_polyhedral_oracle.h b/Surface_mesher/include/CGAL/AABB_polyhedral_oracle.h
index a57dc122563d..d03fe0b0fe51 100644
--- a/Surface_mesher/include/CGAL/AABB_polyhedral_oracle.h
+++ b/Surface_mesher/include/CGAL/AABB_polyhedral_oracle.h
@@ -84,7 +84,7 @@ namespace CGAL {
 
       Object operator()(const Surface_3& surface, const Segment_3& segment) const
       {
-        boost::optional< typename AABB_traits::template Intersection_and_primitive_id<Segment_3>::Type >
+        std::optional< typename AABB_traits::template Intersection_and_primitive_id<Segment_3>::Type >
           intersection = surface.tree()->any_intersection(segment);
 
         if ( intersection )
@@ -95,7 +95,7 @@ namespace CGAL {
 
       Object operator()(const Surface_3& surface, const Line_3& line) const
       {
-        boost::optional< typename AABB_traits::template Intersection_and_primitive_id<Line_3>::Type >
+        std::optional< typename AABB_traits::template Intersection_and_primitive_id<Line_3>::Type >
           intersection = surface.tree()->any_intersection(line);
 
         if ( intersection )
@@ -105,7 +105,7 @@ namespace CGAL {
       }
       Object operator()(const Surface_3& surface, const Ray_3& ray) const
       {
-        boost::optional< typename AABB_traits::template Intersection_and_primitive_id<Ray_3>::Type >
+        std::optional< typename AABB_traits::template Intersection_and_primitive_id<Ray_3>::Type >
           intersection = surface.tree()->any_intersection(ray);
 
         if ( intersection )
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 4fbe11807561..17b2c7edd358 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -21,7 +21,7 @@
 #include <CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h>
 
 #include <boost/container/small_vector.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/functional/hash.hpp>
 
 #include <unordered_map>
@@ -317,7 +317,7 @@ Sliver_removal_result flip_3_to_2(typename C3t3::Edge& edge,
       }
       ch->vertex(v)->set_cell(ch);
 
-      inc_cells[ch->vertex(v)] = boost::none;
+      inc_cells[ch->vertex(v)] = std::nullopt;
       ch->reset_cache_validity();
     }
   }
@@ -596,8 +596,8 @@ void find_best_flip_to_improve_dh(C3t3& c3t3,
     if(tr.is_infinite(vh))
       continue;
 
-    boost::optional<boost::container::small_vector<Cell_handle, 64>>& o_inc_vh = inc_cells[vh];
-    if (o_inc_vh == boost::none)
+    std::optional<boost::container::small_vector<Cell_handle, 64>>& o_inc_vh = inc_cells[vh];
+    if (o_inc_vh == std::nullopt)
     {
       boost::container::small_vector<Cell_handle, 64> inc_vec;
       tr.incident_cells(vh, std::back_inserter(inc_vec));
@@ -761,8 +761,8 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
   facet_circulator++;
   facet_circulator++;
 
-  boost::optional<boost::container::small_vector<Cell_handle, 64>>& o_inc_vh = inc_cells[vh];
-  if (o_inc_vh == boost::none)
+  std::optional<boost::container::small_vector<Cell_handle, 64>>& o_inc_vh = inc_cells[vh];
+  if (o_inc_vh == std::nullopt)
   {
     boost::container::small_vector<Cell_handle, 64> inc_vec;
     tr.incident_cells(vh, std::back_inserter(inc_vec));
@@ -948,7 +948,7 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
       }
       ch->vertex(v)->set_cell(ch);
 
-      inc_cells[ch->vertex(v)] = boost::none;
+      inc_cells[ch->vertex(v)] = std::nullopt;
       ch->reset_cache_validity();
     }
   }
@@ -1186,14 +1186,14 @@ std::size_t flip_all_edges(const std::vector<VertexPair>& edges,
   Tr& tr = c3t3.triangulation();
 
   std::unordered_map<Vertex_handle,
-    boost::optional<boost::container::small_vector<Cell_handle, 64> > > inc_cells;
+    std::optional<boost::container::small_vector<Cell_handle, 64> > > inc_cells;
 
   std::size_t count = 0;
   for (const VertexPair& vp : edges)
   {
-    boost::optional<boost::container::small_vector<Cell_handle, 64>>&
+    std::optional<boost::container::small_vector<Cell_handle, 64>>&
       o_inc_vh = inc_cells[vp.first];
-    if (o_inc_vh == boost::none)
+    if (o_inc_vh == std::nullopt)
     {
       boost::container::small_vector<Cell_handle, 64> inc_vec;
       tr.incident_cells(vp.first, std::back_inserter(inc_vec));
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/smooth_vertices.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/smooth_vertices.h
index 24874936248b..7628e653699a 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/smooth_vertices.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/smooth_vertices.h
@@ -21,7 +21,7 @@
 #include <CGAL/Tetrahedral_remeshing/internal/FMLS.h>
 
 
-#include <boost/optional.hpp>
+#include <optional>
 #include <boost/container/small_vector.hpp>
 #include <boost/functional/hash.hpp>
 
@@ -91,7 +91,7 @@ class Tetrahedral_remeshing_smoother
   }
 
   template<typename CellSelector>
-  boost::optional<Facet>
+  std::optional<Facet>
   find_adjacent_facet_on_surface(const Facet& f,
                                  const Edge& edge,
                                  const C3t3& c3t3,
@@ -211,7 +211,7 @@ class Tetrahedral_remeshing_smoother
         for (const std::array<int, 2>& ei : edges)
         {
           Edge edge(ch, ei[0], ei[1]);
-          if (boost::optional<Facet> neighbor
+          if (std::optional<Facet> neighbor
               = find_adjacent_facet_on_surface(f, edge, c3t3, cell_selector))
           {
             const Facet neigh = *neighbor; //already a canonical_facet
@@ -307,7 +307,7 @@ class Tetrahedral_remeshing_smoother
 #endif
   }
 
-  boost::optional<Vector_3> project(const Surface_patch_index& si,
+  std::optional<Vector_3> project(const Surface_patch_index& si,
                                     const Vector_3& gi)
   {
     CGAL_assertion(subdomain_FMLS_indices.find(si) != subdomain_FMLS_indices.end());
@@ -537,7 +537,7 @@ class Tetrahedral_remeshing_smoother
               = project_on_tangent_plane(smoothed_position, current_pos, vertices_normals[v][si]);
 
             //Check if the mls surface exists to avoid degenerated cases
-            if (boost::optional<Vector_3> mls_projection = project(si, normal_projection)) {
+            if (std::optional<Vector_3> mls_projection = project(si, normal_projection)) {
               final_position = final_position + *mls_projection;
             }
             else {
@@ -574,7 +574,7 @@ class Tetrahedral_remeshing_smoother
           {
             //Check if the mls surface exists to avoid degenerated cases
 
-            if (boost::optional<Vector_3> mls_projection = project(si, current_pos)) {
+            if (std::optional<Vector_3> mls_projection = project(si, current_pos)) {
               final_position = final_position + *mls_projection;
             }
             else {
@@ -660,7 +660,7 @@ class Tetrahedral_remeshing_smoother
                                        current_pos,
                                        vertices_normals[v][si]);
 
-          if (boost::optional<Vector_3> mls_projection = project(si, normal_projection))
+          if (std::optional<Vector_3> mls_projection = project(si, normal_projection))
             final_position = final_position + *mls_projection;
           else
             final_position = smoothed_position;
@@ -682,7 +682,7 @@ class Tetrahedral_remeshing_smoother
 
           const Vector_3 current_pos(CGAL::ORIGIN, point(v->point()));
 
-          if (boost::optional<Vector_3> mls_projection = project(si, current_pos))
+          if (std::optional<Vector_3> mls_projection = project(si, current_pos))
           {
             const typename Tr::Point new_pos(CGAL::ORIGIN + *mls_projection);
             if(check_inversion_and_move(v, new_pos, inc_cells[vid], tr, total_move)){
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
index 4c8fac7609cf..b9147708c012 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
@@ -30,7 +30,7 @@
 #include <CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h>
 #include <CGAL/Tetrahedral_remeshing/internal/compute_c3t3_statistics.h>
 
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace CGAL
 {
@@ -321,15 +321,15 @@ class Adaptive_remesher
       Cell_handle c = c_i.first;
       const std::array<bool, 4>& f_on_surface = c_i.second;
 
-      boost::optional<Surface_patch_index> patch;
+      std::optional<Surface_patch_index> patch;
       for (int i = 0; i < 4; ++i)
       {
         if (f_on_surface[i])
         {
           Surface_patch_index spi = m_c3t3.surface_patch_index(c, i);
-          if (patch != boost::none && patch != spi)
+          if (patch != std::nullopt && patch != spi)
           {
-            patch = boost::none;
+            patch = std::nullopt;
             break;
           }
           else
@@ -338,7 +338,7 @@ class Adaptive_remesher
           }
         }
       }
-      if(patch == boost::none)
+      if(patch == std::nullopt)
         continue;
 
       for (int i = 0; i < 4; ++i)
diff --git a/Three/include/CGAL/Three/exceptions.h b/Three/include/CGAL/Three/exceptions.h
index cf3640d5b46a..dd923aa5b2b9 100644
--- a/Three/include/CGAL/Three/exceptions.h
+++ b/Three/include/CGAL/Three/exceptions.h
@@ -22,7 +22,7 @@
 #include <QScriptable>
 #include <QScriptContext>
 #include <QScriptEngine>
-#include <boost/optional.hpp>
+#include <optional>
 #include <QStringList>
 
 namespace CGAL{
@@ -44,7 +44,7 @@ class Script_exception : public std::runtime_error {
 
 template <typename T>
 struct Optional_or_bool {
-  typedef boost::optional<T> type;
+  typedef std::optional<T> type;
 
   template <typename Callable>
   static type invoke(Callable f) { return type(f()); }
diff --git a/Triangulation/include/CGAL/Delaunay_triangulation.h b/Triangulation/include/CGAL/Delaunay_triangulation.h
index 262f451fdc10..1dd1929cb682 100644
--- a/Triangulation/include/CGAL/Delaunay_triangulation.h
+++ b/Triangulation/include/CGAL/Delaunay_triangulation.h
@@ -130,12 +130,12 @@ class Delaunay_triangulation
     // Wrapper
     struct Side_of_oriented_subsphere_d
     {
-      boost::optional<Flat_orientation_d>* fop;
+      std::optional<Flat_orientation_d>* fop;
       Construct_flat_orientation_d cfo;
       In_flat_side_of_oriented_sphere_d ifsoos;
 
       Side_of_oriented_subsphere_d(
-        boost::optional<Flat_orientation_d>& x,
+        std::optional<Flat_orientation_d>& x,
         Construct_flat_orientation_d const&y,
         In_flat_side_of_oriented_sphere_d const&z)
       : fop(&x), cfo(y), ifsoos(z) {}
diff --git a/Triangulation/include/CGAL/Regular_triangulation.h b/Triangulation/include/CGAL/Regular_triangulation.h
index 2d63893e38aa..8294cb655980 100644
--- a/Triangulation/include/CGAL/Regular_triangulation.h
+++ b/Triangulation/include/CGAL/Regular_triangulation.h
@@ -129,12 +129,12 @@ class Regular_triangulation
   // Wrapper
   struct Power_side_of_power_sphere_for_non_maximal_dim_d
   {
-    boost::optional<Flat_orientation_d>* fop;
+    std::optional<Flat_orientation_d>* fop;
     Construct_flat_orientation_d cfo;
     In_flat_power_side_of_power_sphere_d ifpt;
 
     Power_side_of_power_sphere_for_non_maximal_dim_d(
-      boost::optional<Flat_orientation_d>& x,
+      std::optional<Flat_orientation_d>& x,
       Construct_flat_orientation_d const&y,
       In_flat_power_side_of_power_sphere_d const&z)
     : fop(&x), cfo(y), ifpt(z) {}
diff --git a/Triangulation/include/CGAL/Triangulation.h b/Triangulation/include/CGAL/Triangulation.h
index 55a118a7b69c..1dc8e1a34592 100644
--- a/Triangulation/include/CGAL/Triangulation.h
+++ b/Triangulation/include/CGAL/Triangulation.h
@@ -88,12 +88,12 @@ class Triangulation
     // Wrapper
     struct Coaffine_orientation_d
     {
-      boost::optional<Flat_orientation_d>* fop;
+      std::optional<Flat_orientation_d>* fop;
       Construct_flat_orientation_d cfo;
       In_flat_orientation_d ifo;
 
       Coaffine_orientation_d(
-        boost::optional<Flat_orientation_d>& x,
+        std::optional<Flat_orientation_d>& x,
         Construct_flat_orientation_d const&y,
         In_flat_orientation_d const&z)
       : fop(&x), cfo(y), ifo(z) {}
@@ -117,7 +117,7 @@ class Triangulation
         flat_orientation_ = *preset_flat_orientation_.second;
       }
       else
-        flat_orientation_ = boost::none;
+        flat_orientation_ = std::nullopt;
     }
 
     typedef typename TriangulationTraits::Orientation_d
@@ -188,7 +188,7 @@ class Triangulation
     Triangulation_ds                            tds_;
     const Geom_traits                           kernel_;
     Vertex_handle                               infinity_;
-    mutable boost::optional<Flat_orientation_d> flat_orientation_;
+    mutable std::optional<Flat_orientation_d> flat_orientation_;
     // The user can specify a Flat_orientation_d object to be used for
     // orienting simplices of a specific dimension
     // (= preset_flat_orientation_.first)
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
index 6f7a9e5ea858..652cb033ab83 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
@@ -40,7 +40,7 @@ class ConstrainedTriangulationTraits_2 {
 /*!
 A function object whose `operator()` computes the intersection of two segments.
 
-`boost::optional<boost::variant<Point_2,Segment_2> > operator()(Segment_2 s1, Segment_2 s2);`
+`std::optional<boost::variant<Point_2,Segment_2> > operator()(Segment_2 s1, Segment_2 s2);`
 Returns the intersection of `s1` and `s2`.
 */
 typedef unspecified_type Intersect_2;

From 557b64e4a67febfe1e8940b21adc8267206aa17f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 20:54:15 +0200
Subject: [PATCH 0361/1398] boost::any ==> std::any

---
 .../Option_parser.cpp                         | 12 +++++-----
 .../Option_parser.hpp                         |  2 +-
 .../include/CGAL/sibson_gradient_fitting.h    | 10 ++++-----
 .../Intersections_2/variant_any_object.cpp    | 16 +++++++-------
 Nef_2/include/CGAL/Nef_2/HDS_items.h          |  8 +++----
 Nef_2/include/CGAL/Nef_2/PM_const_decorator.h |  4 ++--
 Nef_2/include/CGAL/Nef_2/PM_decorator.h       |  2 +-
 Nef_2/include/CGAL/Nef_2/PM_overlayer.h       | 22 +++++++++----------
 Nef_2/include/CGAL/Nef_2/PM_point_locator.h   | 16 +++++++-------
 Nef_2/include/CGAL/Nef_2/gen_point_location.h | 16 +++++++-------
 Nef_2/include/CGAL/Nef_2/geninfo.h            |  2 +-
 Nef_3/include/CGAL/Nef_3/Halfedge.h           |  4 ++--
 Nef_3/include/CGAL/Nef_3/SFace.h              |  4 ++--
 Nef_3/include/CGAL/Nef_3/SHalfedge.h          |  4 ++--
 Nef_3/include/CGAL/Nef_3/SNC_FM_decorator.h   |  6 ++---
 Nef_3/include/CGAL/Nef_3/SNC_SM_overlayer.h   |  2 +-
 .../include/CGAL/Nef_3/SNC_const_decorator.h  |  4 ++--
 Nef_3/include/CGAL/Nef_3/SNC_decorator.h      |  4 ++--
 Nef_3/include/CGAL/Nef_3/SNC_io_parser.h      |  4 ++--
 Nef_3/include/CGAL/Nef_3/Vertex.h             |  4 ++--
 .../include/CGAL/Nef_S2/SM_const_decorator.h  |  4 ++--
 Nef_S2/include/CGAL/Nef_S2/SM_decorator.h     |  4 ++--
 Nef_S2/include/CGAL/Nef_S2/SM_items.h         | 10 ++++-----
 Nef_S2/include/CGAL/Nef_S2/SM_overlayer.h     | 22 +++++++++----------
 Nef_S2/include/CGAL/Nef_S2/SM_point_locator.h |  2 +-
 Nef_S2/include/CGAL/Nef_S2/SM_triangulator.h  | 14 ++++++------
 .../CGAL/Polygon_mesh_processing/distance.h   | 16 +++++++-------
 .../Polyhedron/Plugins/Mesh_3/Mesh_function.h |  8 +++----
 STL_Extension/doc/STL_Extension/CGAL/Object.h |  2 +-
 .../doc/STL_Extension/STL_Extension.txt       |  2 +-
 STL_Extension/include/CGAL/Object.h           | 20 ++++++++---------
 31 files changed, 125 insertions(+), 125 deletions(-)

diff --git a/Arrangement_on_surface_2/benchmark/Arrangement_on_surface_2/Option_parser.cpp b/Arrangement_on_surface_2/benchmark/Arrangement_on_surface_2/Option_parser.cpp
index 8a2bb5dd03ca..a1032551da22 100644
--- a/Arrangement_on_surface_2/benchmark/Arrangement_on_surface_2/Option_parser.cpp
+++ b/Arrangement_on_surface_2/benchmark/Arrangement_on_surface_2/Option_parser.cpp
@@ -18,7 +18,7 @@ char * Option_parser::s_strategy_opts[] = {
 };
 
 template <class MyId>
-void Option_parser::my_validate(boost::any & v,
+void Option_parser::my_validate(std::any & v,
                                 const std::vector<std::string> & values)
 {
   typedef std::vector<MyId>     Vector_id;
@@ -28,11 +28,11 @@ void Option_parser::my_validate(boost::any & v,
       if (v.empty()) {
         Vector_id vec;
         vec.push_back(MyId(i));
-        v = boost::any(vec);
+        v = std::any(vec);
       } else {
-        Vector_id vec = boost::any_cast<Vector_id>(v);
+        Vector_id vec = std::any_cast<Vector_id>(v);
         vec.push_back(MyId(i));
-        v = boost::any(vec);
+        v = std::any(vec);
       }
       return;
     }
@@ -41,14 +41,14 @@ void Option_parser::my_validate(boost::any & v,
 }
 
 /* Overload the 'validate' function for the user-defined class */
-void validate(boost::any & v, const std::vector<std::string> & values,
+void validate(std::any & v, const std::vector<std::string> & values,
               Option_parser::Vector_type_id * target_type, int)
 {
   Option_parser::my_validate<Option_parser::Type_id>(v, values);
 }
 
 /* Overload the 'validate' function for the user-defined class */
-void validate(boost::any & v, const std::vector<std::string> & values,
+void validate(std::any & v, const std::vector<std::string> & values,
               Option_parser::Vector_strategy_id * target_type, int)
 {
   Option_parser::my_validate<Option_parser::Strategy_id>(v, values);
diff --git a/Arrangement_on_surface_2/benchmark/Arrangement_on_surface_2/Option_parser.hpp b/Arrangement_on_surface_2/benchmark/Arrangement_on_surface_2/Option_parser.hpp
index 4fcfc0aafd6a..a20f3b804c22 100644
--- a/Arrangement_on_surface_2/benchmark/Arrangement_on_surface_2/Option_parser.hpp
+++ b/Arrangement_on_surface_2/benchmark/Arrangement_on_surface_2/Option_parser.hpp
@@ -124,7 +124,7 @@ class Option_parser : public cb::Option_parser {
   unsigned int get_height() const { return m_win_height; }
 
   template <class MyId>
-  static void my_validate(boost::any & v,
+  static void my_validate(std::any & v,
                           const std::vector<std::string> & values);
 
 protected:
diff --git a/Interpolation/include/CGAL/sibson_gradient_fitting.h b/Interpolation/include/CGAL/sibson_gradient_fitting.h
index 074ca037afb1..f08600a4603c 100644
--- a/Interpolation/include/CGAL/sibson_gradient_fitting.h
+++ b/Interpolation/include/CGAL/sibson_gradient_fitting.h
@@ -22,7 +22,7 @@
 #include <CGAL/Origin.h>
 #include <functional>
 
-#include <boost/any.hpp>
+#include <any>
 #include <boost/mpl/if.hpp>
 #include <boost/utility/result_of.hpp>
 
@@ -229,7 +229,7 @@ sibson_gradient_fitting_nn_2(const Dt& dt,
                              // of the value functor is 'DT::Point' or 'DT::Vertex_handle'
                              std::enable_if_t<
                                std::is_constructible<
-                                 std::function<boost::any(typename Dt::Point)>,
+                                 std::function<std::any(typename Dt::Point)>,
                                  ValueFunctor
                              >::value>* = nullptr)
 {
@@ -255,7 +255,7 @@ sibson_gradient_fitting_nn_2(const Dt& dt,
                              const Traits& traits,
                              std::enable_if_t<
                                std::is_constructible<
-                                 std::function<boost::any(typename Dt::Vertex_handle)>,
+                                 std::function<std::any(typename Dt::Vertex_handle)>,
                                  ValueFunctor
                              >::value>* = nullptr)
 {
@@ -299,7 +299,7 @@ sibson_gradient_fitting_rn_2(const Rt& rt,
                              // of the value functor is 'Rt::Point' (weighted point) or 'Rt::Vertex_handle'
                              std::enable_if_t<
                                std::is_constructible<
-                                 std::function<boost::any(typename Rt::Point)>,
+                                 std::function<std::any(typename Rt::Point)>,
                                  ValueFunctor
                              >::value>* = nullptr)
 {
@@ -325,7 +325,7 @@ sibson_gradient_fitting_rn_2(const Rt& rt,
                              const Traits& traits,
                              std::enable_if_t<
                                std::is_constructible<
-                                 std::function<boost::any(typename Rt::Vertex_handle)>,
+                                 std::function<std::any(typename Rt::Vertex_handle)>,
                                  ValueFunctor
                              >::value>* = nullptr)
 {
diff --git a/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp b/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp
index a7765e4b3c1d..c5176eda212c 100644
--- a/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp
+++ b/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp
@@ -12,7 +12,7 @@
 
 #include <boost/variant.hpp>
 #include <optional>
-#include <boost/any.hpp>
+#include <any>
 #include <boost/timer.hpp>
 #include <boost/lexical_cast.hpp>
 
@@ -78,7 +78,7 @@ intersection_variant(const typename K::Segment_2 &seg1,
 }
 
 template <class K>
-boost::any intersection_any(const typename K::Segment_2 &seg1,
+std::any intersection_any(const typename K::Segment_2 &seg1,
                             const typename K::Segment_2 &seg2,
                             const K&)
 {
@@ -88,11 +88,11 @@ boost::any intersection_any(const typename K::Segment_2 &seg1,
   switch (ispair.intersection_type()) {
   case is_t::NO_INTERSECTION:
   default:
-    return boost::any();
+    return std::any();
   case is_t::POINT:
-    return boost::any(ispair.intersection_point());
+    return std::any(ispair.intersection_point());
   case is_t::SEGMENT:
-    return boost::any(ispair.intersection_segment());
+    return std::any(ispair.intersection_segment());
   }
 }
 
@@ -165,10 +165,10 @@ struct Any_f : Vec_holder {
     Vec_holder(p, s) { }
 
   void operator()(const Segment& s1, const Segment& s2) {
-    boost::any obj = intersection_any(s1, s2, K());
-    if (const Point * point = boost::any_cast<Point>(&obj)) {
+    std::any obj = intersection_any(s1, s2, K());
+    if (const Point * point = std::any_cast<Point>(&obj)) {
        p->push_back(*point);
-    } else if (const Segment * segment = boost::any_cast<Segment>(&obj)) {
+    } else if (const Segment * segment = std::any_cast<Segment>(&obj)) {
       s->push_back(*segment);
     }
   }
diff --git a/Nef_2/include/CGAL/Nef_2/HDS_items.h b/Nef_2/include/CGAL/Nef_2/HDS_items.h
index 48a44c50fd72..12e1d32d8735 100644
--- a/Nef_2/include/CGAL/Nef_2/HDS_items.h
+++ b/Nef_2/include/CGAL/Nef_2/HDS_items.h
@@ -22,7 +22,7 @@
 #include <optional>
 #include <boost/none.hpp>
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 namespace CGAL {
@@ -62,7 +62,7 @@ class Nef_vertex_2 {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     typedef void*  GenPtr;
     #else
-    typedef boost::any GenPtr;
+    typedef std::any GenPtr;
     #endif
 
     typedef typename Traits::Point Point;   // geometric embedding
@@ -151,7 +151,7 @@ class Nef_halfedge_2 {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     typedef void*  GenPtr;
     #else
-    typedef boost::any GenPtr;
+    typedef std::any GenPtr;
     #endif
 
     typedef typename std::list<Halfedge_handle>::iterator fc_iterator;
@@ -248,7 +248,7 @@ class Nef_face_2 {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     typedef void*  GenPtr;
     #else
-    typedef boost::any GenPtr;
+    typedef std::any GenPtr;
     #endif
 
     typedef typename Traits::Mark  Mark;  // mark information
diff --git a/Nef_2/include/CGAL/Nef_2/PM_const_decorator.h b/Nef_2/include/CGAL/Nef_2/PM_const_decorator.h
index 7748f4b1f611..5a685f9e3108 100644
--- a/Nef_2/include/CGAL/Nef_2/PM_const_decorator.h
+++ b/Nef_2/include/CGAL/Nef_2/PM_const_decorator.h
@@ -28,7 +28,7 @@
 #include <CGAL/Nef_2/debug.h>
 
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 #include <CGAL/use.h>
@@ -137,7 +137,7 @@ typedef size_t Size_type;
 /*{\Mtypemember The size type.}*/
 typedef void*  GenPtr;
 #else
-typedef boost::any GenPtr;
+typedef std::any GenPtr;
 #endif
 
 
diff --git a/Nef_2/include/CGAL/Nef_2/PM_decorator.h b/Nef_2/include/CGAL/Nef_2/PM_decorator.h
index 914a6a58d6ab..6cc528c7dabd 100644
--- a/Nef_2/include/CGAL/Nef_2/PM_decorator.h
+++ b/Nef_2/include/CGAL/Nef_2/PM_decorator.h
@@ -19,7 +19,7 @@
 #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
 #include <CGAL/Nef_2/geninfo.h>
 #else
-#include <boost/any.hpp>
+#include <any>
 #endif
 #include <CGAL/Unique_hash_map.h>
 #include <vector>
diff --git a/Nef_2/include/CGAL/Nef_2/PM_overlayer.h b/Nef_2/include/CGAL/Nef_2/PM_overlayer.h
index 5ce03215db3d..882a349c9c99 100644
--- a/Nef_2/include/CGAL/Nef_2/PM_overlayer.h
+++ b/Nef_2/include/CGAL/Nef_2/PM_overlayer.h
@@ -23,7 +23,7 @@
 #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
 #include <CGAL/Nef_2/geninfo.h>
 #else
-#include <boost/any.hpp>
+#include <any>
 #endif
 #undef CGAL_NEF_DEBUG
 #define CGAL_NEF_DEBUG 13
@@ -92,7 +92,7 @@ struct PMO_from_segs {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     geninfo<Halfedge_handle>::access(G.info(v)) = e;
     #else
-    *boost::any_cast<Halfedge_handle>(&G.info(v)) = e;
+    *std::any_cast<Halfedge_handle>(&G.info(v)) = e;
     #endif
   }
 
@@ -102,7 +102,7 @@ struct PMO_from_segs {
     return geninfo<Halfedge_handle>::access(G.info(v));
     #else
     return
-      boost::any_cast<Halfedge_handle>(G.info(v));
+      std::any_cast<Halfedge_handle>(G.info(v));
     #endif
   }
 
@@ -112,7 +112,7 @@ struct PMO_from_segs {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
       geninfo<Halfedge_handle>::clear(G.info(v));
     #else
-      G.info(v)=boost::any();
+      G.info(v)=std::any();
     #endif
   }
 
@@ -674,7 +674,7 @@ void discard_info(Vertex_handle v) const
   #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
   geninfo<vertex_info>::clear(info(v));
   #else
-  info(v)=boost::any();
+  info(v)=std::any();
   #endif
 }
 
@@ -684,7 +684,7 @@ vertex_info& ginfo(Vertex_handle v) const
   return geninfo<vertex_info>::access(info(v));
   #else
   return
-    *boost::any_cast<vertex_info>(&info(v));
+    *std::any_cast<vertex_info>(&info(v));
   #endif
 }
 
@@ -729,8 +729,8 @@ void discard_info(Halfedge_handle e)  const
   geninfo<halfedge_info>::clear(info(e));
   geninfo<halfedge_info>::clear(info(twin(e)));
   #else
-  info(e)=boost::any();
-  info(twin(e))=boost::any();
+  info(e)=std::any();
+  info(twin(e))=std::any();
   #endif
 }
 
@@ -740,7 +740,7 @@ halfedge_info& ginfo(Halfedge_handle e)  const
   return geninfo<halfedge_info>::access(info(e));
   #else
   return
-    *boost::any_cast<halfedge_info>(&info(e));
+    *std::any_cast<halfedge_info>(&info(e));
   #endif
 }
 
@@ -782,7 +782,7 @@ void discard_info(Face_handle f)  const
   #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
   geninfo<face_info>::clear(info(f));
   #else
-  info(f)=boost::any();
+  info(f)=std::any();
   #endif
 }
 
@@ -792,7 +792,7 @@ face_info& ginfo(Face_handle f)  const
   return geninfo<face_info>::access(info(f));
   #else
   return
-    *boost::any_cast<face_info>(&info(f));
+    *std::any_cast<face_info>(&info(f));
   #endif
 }
 
diff --git a/Nef_2/include/CGAL/Nef_2/PM_point_locator.h b/Nef_2/include/CGAL/Nef_2/PM_point_locator.h
index ede8d2b033a9..12a4a0812675 100644
--- a/Nef_2/include/CGAL/Nef_2/PM_point_locator.h
+++ b/Nef_2/include/CGAL/Nef_2/PM_point_locator.h
@@ -28,7 +28,7 @@
 #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
 #include <CGAL/Nef_2/geninfo.h>
 #else
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 #ifdef CGAL_USE_LEDA_LIBRARY
@@ -497,7 +497,7 @@ class PM_point_locator : public
     return geninfo<VF_pair>::const_access(CT.info(v)).first;
     #else
     return
-      boost::any_cast<VF_pair>(CT.info(v)).first;
+      std::any_cast<VF_pair>(CT.info(v)).first;
     #endif
   }
 
@@ -507,7 +507,7 @@ class PM_point_locator : public
     return geninfo<EF_pair>::const_access(CT.info(e)).first;
     #else
     return
-      boost::any_cast<EF_pair>(CT.info(e)).first;
+      std::any_cast<EF_pair>(CT.info(e)).first;
     #endif
   }
 
@@ -517,7 +517,7 @@ class PM_point_locator : public
     return geninfo<EF_pair>::const_access(CT.info(e)).second;
     #else
     return
-      boost::any_cast<EF_pair>(CT.info(e)).second;
+      std::any_cast<EF_pair>(CT.info(e)).second;
     #endif
   }
 
@@ -584,10 +584,10 @@ class PM_point_locator : public
         f = geninfo<EF_pair>::access(info(e_from)).second;
         #else
         f =
-          boost::any_cast<VF_pair>(info(source(e))).second;
+          std::any_cast<VF_pair>(info(source(e))).second;
       else
         f =
-          boost::any_cast<EF_pair>(info(e_from)).second;
+          std::any_cast<EF_pair>(info(e_from)).second;
         #endif
       mark(e) = _DP.mark(f);
       #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
@@ -968,7 +968,7 @@ PM_point_locator<PMD,GEO>::
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     geninfo<VF_pair>::clear(CT.info(vit));
     #else
-    CT.info(vit)=boost::any();
+    CT.info(vit)=std::any();
     #endif
   }
   Halfedge_iterator eit, eend = CT.halfedges_end();
@@ -976,7 +976,7 @@ PM_point_locator<PMD,GEO>::
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     geninfo<EF_pair>::clear(CT.info(eit));
     #else
-    CT.info(eit)=boost::any();
+    CT.info(eit)=std::any();
     #endif
   }
   CT.clear();
diff --git a/Nef_2/include/CGAL/Nef_2/gen_point_location.h b/Nef_2/include/CGAL/Nef_2/gen_point_location.h
index c479a9af62a2..1430b785ae07 100644
--- a/Nef_2/include/CGAL/Nef_2/gen_point_location.h
+++ b/Nef_2/include/CGAL/Nef_2/gen_point_location.h
@@ -27,7 +27,7 @@
 #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
 #include <CGAL/Nef_2/geninfo.h>
 #else
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 
@@ -55,7 +55,7 @@ class GenericLocation {
   #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
   typedef void*  GenPtr;
   #else
-  typedef boost::any GenPtr;
+  typedef std::any GenPtr;
   #endif
 public:
 /*{\Mtypes}*/
@@ -89,7 +89,7 @@ class GenericLocation {
       return geninfo<Node>::const_access(value);
       #else
       return
-        *boost::any_cast<Node>(&value);
+        *std::any_cast<Node>(&value);
       #endif
     }
     /*{\Mconversion converts |\Mvar| into a node.\\
@@ -105,7 +105,7 @@ class GenericLocation {
       return geninfo<Edge>::const_access(value);
       #else
       return
-        *boost::any_cast<Edge>(&value);
+        *std::any_cast<Edge>(&value);
       #endif
     }
     /*{\Mconversion converts |\Mvar| into an edge.\\
@@ -159,8 +159,8 @@ class GenericLocation {
        case NODE: geninfo<Node>::clear(value); break;
        case EDGE: geninfo<Edge>::clear(value); break;
       #else
-       case NODE: value=boost::any(); break;
-       case EDGE: value=boost::any(); break;
+       case NODE: value=std::any(); break;
+       case EDGE: value=std::any(); break;
       #endif
        case NIL: break;
       }
@@ -174,14 +174,14 @@ class GenericLocation {
         #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
          geninfo<Node>::access(value) = geninfo<Node>::const_access(L.value);
         #else
-         *boost_any_cast<Node>(&value) = boost::any_cast<Node>(L.value);
+         *boost_any_cast<Node>(&value) = std::any_cast<Node>(L.value);
         #endif
          break;
        case EDGE:
         #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
          geninfo<Edge>::access(value) = geninfo<Edge>::const_access(L.value);
         #else
-         *boost::any_cast<Edge>(&value) = boost::any_cast<Edge>(L.value);
+         *std::any_cast<Edge>(&value) = std::any_cast<Edge>(L.value);
         #endif
          break;
        case NIL: break;
diff --git a/Nef_2/include/CGAL/Nef_2/geninfo.h b/Nef_2/include/CGAL/Nef_2/geninfo.h
index 08273c2e23ed..41fab418e915 100644
--- a/Nef_2/include/CGAL/Nef_2/geninfo.h
+++ b/Nef_2/include/CGAL/Nef_2/geninfo.h
@@ -17,7 +17,7 @@
 
 #define CGAL_DEPRECATED_HEADER "<CGAL/Nef_2/geninfo.h>"
 #define CGAL_DEPRECATED_MESSAGE_DETAILS \
-  "Something like boost::any or boost::variant should be used instead."
+  "Something like std::any or boost::variant should be used instead."
 #include <CGAL/Installation/internal/deprecation_warning.h>
 
 #include <CGAL/config.h>
diff --git a/Nef_3/include/CGAL/Nef_3/Halfedge.h b/Nef_3/include/CGAL/Nef_3/Halfedge.h
index b4fc70657408..01c8df55785d 100644
--- a/Nef_3/include/CGAL/Nef_3/Halfedge.h
+++ b/Nef_3/include/CGAL/Nef_3/Halfedge.h
@@ -31,7 +31,7 @@
 #include <CGAL/Nef_2/debug.h>
 
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 namespace CGAL {
@@ -42,7 +42,7 @@ class Halfedge_base
   #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
   typedef void* GenPtr;
   #else
-  typedef boost::any GenPtr;
+  typedef std::any GenPtr;
   #endif
   typedef typename Refs::Mark  Mark;
   typedef typename Refs::Vector_3  Vector_3;
diff --git a/Nef_3/include/CGAL/Nef_3/SFace.h b/Nef_3/include/CGAL/Nef_3/SFace.h
index 3ee882271d61..c723b2cd4d0f 100644
--- a/Nef_3/include/CGAL/Nef_3/SFace.h
+++ b/Nef_3/include/CGAL/Nef_3/SFace.h
@@ -29,7 +29,7 @@
 #include <CGAL/Nef_2/debug.h>
 
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 namespace CGAL {
@@ -39,7 +39,7 @@ class SFace_base {
   #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
   typedef void* GenPtr;
   #else
-  typedef boost::any GenPtr;
+  typedef std::any GenPtr;
   #endif
   typedef typename Refs::Mark  Mark;
   typedef typename Refs::Vertex_handle        Vertex_handle;
diff --git a/Nef_3/include/CGAL/Nef_3/SHalfedge.h b/Nef_3/include/CGAL/Nef_3/SHalfedge.h
index 19339312f20d..2191e73bbe67 100644
--- a/Nef_3/include/CGAL/Nef_3/SHalfedge.h
+++ b/Nef_3/include/CGAL/Nef_3/SHalfedge.h
@@ -30,7 +30,7 @@
 #include <CGAL/Nef_2/debug.h>
 
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 namespace CGAL {
@@ -40,7 +40,7 @@ class SHalfedge_base  {
   #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
   typedef void* GenPtr;
   #else
-  typedef boost::any GenPtr;
+  typedef std::any GenPtr;
   #endif
   typedef typename Refs::Mark  Mark;
   typedef typename Refs::Sphere_circle  Sphere_circle;
diff --git a/Nef_3/include/CGAL/Nef_3/SNC_FM_decorator.h b/Nef_3/include/CGAL/Nef_3/SNC_FM_decorator.h
index 6f60c1885706..6cbc6be0ed84 100644
--- a/Nef_3/include/CGAL/Nef_3/SNC_FM_decorator.h
+++ b/Nef_3/include/CGAL/Nef_3/SNC_FM_decorator.h
@@ -18,7 +18,7 @@
 #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
 #include <CGAL/Nef_2/geninfo.h>
 #else
-#include <boost/any.hpp>
+#include <any>
 #endif
 #include <CGAL/Nef_2/Segment_overlay_traits.h>
 #include <CGAL/Nef_3/SNC_decorator.h>
@@ -413,7 +413,7 @@ class SNC_FM_decorator : public SNC_decorator<SNC_structure_> {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
       Edge_of[geninfo<unsigned>::access(info(e_min->twin()->source()->twin()->source()))];
     #else
-      Edge_of[ boost::any_cast<unsigned>(info(e_min->twin()->source()->twin()->source())) ];
+      Edge_of[ std::any_cast<unsigned>(info(e_min->twin()->source()->twin()->source())) ];
     #endif
     CGAL_assertion( e_below != SHalfedge_handle() );
     CGAL_NEF_TRACEN("  edge below " << debug(e_below));
@@ -652,7 +652,7 @@ create_facet_objects(const Plane_3& plane_supporting_facet,
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
       Edge_of[geninfo<unsigned>::access(info(l->incident_sface()->center_vertex()))];
     #else
-      Edge_of[ boost::any_cast<unsigned>(info(l->incident_sface()->center_vertex())) ];
+      Edge_of[ std::any_cast<unsigned>(info(l->incident_sface()->center_vertex())) ];
     #endif
 
     CGAL_assertion( e_below != SHalfedge_handle() );
diff --git a/Nef_3/include/CGAL/Nef_3/SNC_SM_overlayer.h b/Nef_3/include/CGAL/Nef_3/SNC_SM_overlayer.h
index 8c45ba71566b..2c29bca697c1 100644
--- a/Nef_3/include/CGAL/Nef_3/SNC_SM_overlayer.h
+++ b/Nef_3/include/CGAL/Nef_3/SNC_SM_overlayer.h
@@ -23,7 +23,7 @@
 #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
 #include <CGAL/Nef_2/geninfo.h>
 #else
-#include <boost/any.hpp>
+#include <any>
 #endif
 #include <CGAL/Nef_S2/Sphere_geometry.h>
 #include <CGAL/Nef_S2/SM_decorator.h>
diff --git a/Nef_3/include/CGAL/Nef_3/SNC_const_decorator.h b/Nef_3/include/CGAL/Nef_3/SNC_const_decorator.h
index 83f89e413b34..47e85c817ae3 100644
--- a/Nef_3/include/CGAL/Nef_3/SNC_const_decorator.h
+++ b/Nef_3/include/CGAL/Nef_3/SNC_const_decorator.h
@@ -32,7 +32,7 @@
 #include <CGAL/Nef_2/debug.h>
 
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 namespace CGAL {
@@ -118,7 +118,7 @@ class SNC_const_decorator {
   #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
   typedef void* GenPtr;
   #else
-  typedef boost::any GenPtr;
+  typedef std::any GenPtr;
   #endif
 
   SNC_const_decorator() : sncp_(0) {}
diff --git a/Nef_3/include/CGAL/Nef_3/SNC_decorator.h b/Nef_3/include/CGAL/Nef_3/SNC_decorator.h
index 61dcbb983ef4..281fb0d0dcd0 100644
--- a/Nef_3/include/CGAL/Nef_3/SNC_decorator.h
+++ b/Nef_3/include/CGAL/Nef_3/SNC_decorator.h
@@ -36,7 +36,7 @@
 #include <CGAL/Nef_2/debug.h>
 
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 namespace CGAL {
@@ -157,7 +157,7 @@ class SNC_decorator : public SNC_const_decorator<Map> {
   #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
   typedef void* GenPtr;
   #else
-  typedef boost::any GenPtr;
+  typedef std::any GenPtr;
   #endif
 
   SNC_decorator() : Base(), sncp_() {}
diff --git a/Nef_3/include/CGAL/Nef_3/SNC_io_parser.h b/Nef_3/include/CGAL/Nef_3/SNC_io_parser.h
index 9aa445f38a1d..c546843ffc5e 100644
--- a/Nef_3/include/CGAL/Nef_3/SNC_io_parser.h
+++ b/Nef_3/include/CGAL/Nef_3/SNC_io_parser.h
@@ -37,7 +37,7 @@
 #include <CGAL/Nef_2/debug.h>
 
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 #include <boost/mpl/has_xxx.hpp>
@@ -963,7 +963,7 @@ class SNC_io_parser : public SNC_decorator<SNC_structure_>
   #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
   typedef void* GenPtr;
   #else
-  typedef boost::any GenPtr;
+  typedef std::any GenPtr;
   #endif
 
   using Base::visit_shell_objects;
diff --git a/Nef_3/include/CGAL/Nef_3/Vertex.h b/Nef_3/include/CGAL/Nef_3/Vertex.h
index 0a1d7bc280ee..fdccc06bd036 100644
--- a/Nef_3/include/CGAL/Nef_3/Vertex.h
+++ b/Nef_3/include/CGAL/Nef_3/Vertex.h
@@ -30,7 +30,7 @@
 #include <CGAL/Nef_2/debug.h>
 
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 namespace CGAL {
@@ -41,7 +41,7 @@ class Vertex_base {
   #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
   typedef void* GenPtr;
   #else
-  typedef boost::any GenPtr;
+  typedef std::any GenPtr;
   #endif
   typedef typename Refs::Mark  Mark;
   typedef typename Refs::Point_3 Point_3;
diff --git a/Nef_S2/include/CGAL/Nef_S2/SM_const_decorator.h b/Nef_S2/include/CGAL/Nef_S2/SM_const_decorator.h
index e1e1762dc8fa..eb83d34928f3 100644
--- a/Nef_S2/include/CGAL/Nef_S2/SM_const_decorator.h
+++ b/Nef_S2/include/CGAL/Nef_S2/SM_const_decorator.h
@@ -32,7 +32,7 @@
 #define CGAL_NEF_DEBUG 67
 #include <CGAL/Nef_2/debug.h>
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 namespace CGAL {
@@ -75,7 +75,7 @@ typedef size_t Size_type;
 #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
 typedef void*  GenPtr;
 #else
-typedef boost::any GenPtr;
+typedef std::any GenPtr;
 #endif
 
 
diff --git a/Nef_S2/include/CGAL/Nef_S2/SM_decorator.h b/Nef_S2/include/CGAL/Nef_S2/SM_decorator.h
index 4328b38f44cc..8576d4488c8a 100644
--- a/Nef_S2/include/CGAL/Nef_S2/SM_decorator.h
+++ b/Nef_S2/include/CGAL/Nef_S2/SM_decorator.h
@@ -31,7 +31,7 @@
 #include <CGAL/Unique_hash_map.h>
 #include <CGAL/IO/Verbose_ostream.h>
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 namespace CGAL {
@@ -84,7 +84,7 @@ typedef typename Sphere_kernel::Aff_transformation_3 Aff_transformation_3;
 #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
 typedef void*  GenPtr;
 #else
-typedef boost::any GenPtr;
+typedef std::any GenPtr;
 #endif
 typedef typename Map::SVertex                   SVertex;
 typedef typename Map::SVertex_handle            SVertex_handle;
diff --git a/Nef_S2/include/CGAL/Nef_S2/SM_items.h b/Nef_S2/include/CGAL/Nef_S2/SM_items.h
index d1141a21311f..4508f4cc1155 100644
--- a/Nef_S2/include/CGAL/Nef_S2/SM_items.h
+++ b/Nef_S2/include/CGAL/Nef_S2/SM_items.h
@@ -27,7 +27,7 @@
 #include <string>
 #include <sstream>
 #ifndef CGAL_I_DO_WANT_TO_USE_GENINFO
-#include <boost/any.hpp>
+#include <any>
 #endif
 
 namespace CGAL {
@@ -45,7 +45,7 @@ struct SM_items {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     typedef void*  GenPtr;
     #else
-    typedef boost::any GenPtr;
+    typedef std::any GenPtr;
     #endif
     typedef typename Refs::Mark                    Mark;
     typedef typename Refs::Sphere_point            Sphere_point;
@@ -127,7 +127,7 @@ struct SM_items {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     typedef void*  GenPtr;
     #else
-    typedef boost::any GenPtr;
+    typedef std::any GenPtr;
     #endif
     typedef typename Refs::Mark             Mark;
     typedef typename Refs::Sphere_circle    Sphere_circle;
@@ -228,7 +228,7 @@ struct SM_items {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     typedef void*  GenPtr;
     #else
-    typedef boost::any GenPtr;
+    typedef std::any GenPtr;
     #endif
     typedef typename Refs::Mark             Mark;
     typedef typename Refs::Sphere_circle    Sphere_circle;
@@ -306,7 +306,7 @@ struct SM_items {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     typedef void*  GenPtr;
     #else
-    typedef boost::any GenPtr;
+    typedef std::any GenPtr;
     #endif
     typedef typename Refs::Mark                  Mark;
     typedef typename Refs::Object_handle         Object_handle;
diff --git a/Nef_S2/include/CGAL/Nef_S2/SM_overlayer.h b/Nef_S2/include/CGAL/Nef_S2/SM_overlayer.h
index 52c94bad7086..24496cae9878 100644
--- a/Nef_S2/include/CGAL/Nef_S2/SM_overlayer.h
+++ b/Nef_S2/include/CGAL/Nef_S2/SM_overlayer.h
@@ -23,7 +23,7 @@
 #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
 #include <CGAL/Nef_2/geninfo.h>
 #else
-#include <boost/any.hpp>
+#include <any>
 #endif
 #include <CGAL/Nef_S2/Sphere_geometry.h>
 #include <CGAL/Nef_S2/SM_decorator.h>
@@ -106,7 +106,7 @@ struct SMO_from_segs {
     return geninfo<Halfedge_handle>::access(G.info(v));
     #else
     return
-      boost::any_cast<Halfedge_handle>( G.info(v) );
+      std::any_cast<Halfedge_handle>( G.info(v) );
     #endif
   }
 
@@ -122,7 +122,7 @@ struct SMO_from_segs {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     geninfo<Halfedge_handle>::clear(G.info(v));
     #else
-    G.info(v)=boost::any();
+    G.info(v)=std::any();
     #endif
   }
 
@@ -141,7 +141,7 @@ struct SMO_from_segs {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
       geninfo<Halfedge_handle>::clear(G.info(v));
     #else
-    G.info(v)=boost::any();
+    G.info(v)=std::any();
     #endif
 
   }
@@ -564,7 +564,7 @@ class SM_overlayer : public SM_decorator_ {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     geninfo<vertex_info>::clear(info(v));
     #else
-    info(v)=boost::any();
+    info(v)=std::any();
     #endif
   }
 
@@ -574,7 +574,7 @@ class SM_overlayer : public SM_decorator_ {
     return geninfo<vertex_info>::access(info(v));
     #else
     return
-      *boost::any_cast<vertex_info>(&info(v));
+      *std::any_cast<vertex_info>(&info(v));
     #endif
   }
 
@@ -618,8 +618,8 @@ class SM_overlayer : public SM_decorator_ {
     geninfo<edge_info>::clear(info(e));
     geninfo<edge_info>::clear(info(e->twin()));
     #else
-    info(e)=boost::any();
-    info(e->twin())=boost::any();
+    info(e)=std::any();
+    info(e->twin())=std::any();
     #endif
   }
 
@@ -629,7 +629,7 @@ class SM_overlayer : public SM_decorator_ {
     return geninfo<edge_info>::access(info(e));
     #else
     return
-      *boost::any_cast<edge_info>(&info(e));
+      *std::any_cast<edge_info>(&info(e));
     #endif
   }
 
@@ -671,7 +671,7 @@ class SM_overlayer : public SM_decorator_ {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     geninfo<face_info>::clear(info(f));
     #else
-    info(f)=boost::any();
+    info(f)=std::any();
     #endif
   }
 
@@ -681,7 +681,7 @@ class SM_overlayer : public SM_decorator_ {
     return geninfo<face_info>::access(info(f));
     #else
     return
-      *boost::any_cast<face_info>(&info(f));
+      *std::any_cast<face_info>(&info(f));
     #endif
   }
 
diff --git a/Nef_S2/include/CGAL/Nef_S2/SM_point_locator.h b/Nef_S2/include/CGAL/Nef_S2/SM_point_locator.h
index 8dbce0ced5ed..ef9d45a7a6d6 100644
--- a/Nef_S2/include/CGAL/Nef_S2/SM_point_locator.h
+++ b/Nef_S2/include/CGAL/Nef_S2/SM_point_locator.h
@@ -21,7 +21,7 @@
 #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
 #include <CGAL/Nef_2/geninfo.h>
 #else
-#include <boost/any.hpp>
+#include <any>
 #endif
 #include <CGAL/Nef_2/Object_handle.h>
 #include <CGAL/Nef_S2/SM_decorator_traits.h>
diff --git a/Nef_S2/include/CGAL/Nef_S2/SM_triangulator.h b/Nef_S2/include/CGAL/Nef_S2/SM_triangulator.h
index af50600aa4ad..8c33ff31cc71 100644
--- a/Nef_S2/include/CGAL/Nef_S2/SM_triangulator.h
+++ b/Nef_S2/include/CGAL/Nef_S2/SM_triangulator.h
@@ -22,7 +22,7 @@
 #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
 #include <CGAL/Nef_2/geninfo.h>
 #else
-#include <boost/any.hpp>
+#include <any>
 #endif
 #include <CGAL/Nef_S2/SM_decorator.h>
 #include <CGAL/Nef_S2/SM_const_decorator.h>
@@ -213,7 +213,7 @@ class SM_triangulator : public Decorator_ {
     #ifdef CGAL_I_DO_WANT_TO_USE_GENINFO
     geninfo<vertex_info>::clear(info(v));
     #else
-    info(v)=boost::any();
+    info(v)=std::any();
     #endif
   }
 
@@ -223,7 +223,7 @@ class SM_triangulator : public Decorator_ {
     return geninfo<vertex_info>::access(info(v));
     #else
     return
-      *boost::any_cast<vertex_info>(&info(v));
+      *std::any_cast<vertex_info>(&info(v));
     #endif
   }
 
@@ -258,8 +258,8 @@ class SM_triangulator : public Decorator_ {
     geninfo<edge_info>::clear(info(e));
     geninfo<edge_info>::clear(info(e->twin()));
     #else
-    info(e)=boost::any();
-    info(e->twin())=boost::any();
+    info(e)=std::any();
+    info(e->twin())=std::any();
     #endif
   }
 
@@ -269,7 +269,7 @@ class SM_triangulator : public Decorator_ {
     return geninfo<edge_info>::access(info(e));
     #else
     return
-      *boost::any_cast<edge_info>(&info(e));
+      *std::any_cast<edge_info>(&info(e));
     #endif
   }
 
@@ -288,7 +288,7 @@ class SM_triangulator : public Decorator_ {
     return geninfo<edge_info>::const_access(info(e));
     #else
     return
-      *boost::any_cast<edge_info>(&info(e));
+      *std::any_cast<edge_info>(&info(e));
     #endif
   }
   const Mark& incident_mark(SHalfedge_const_handle e)  const
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
index 6d221c77bb9e..28b6195b540c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
@@ -43,7 +43,7 @@
 #include <tbb/blocked_range.h>
 #endif // CGAL_LINKED_WITH_TBB
 
-#include <boost/any.hpp>
+#include <any>
 
 #include <unordered_set>
 #include <algorithm>
@@ -1818,10 +1818,10 @@ struct Bounded_error_preprocessing
 #ifdef CGAL_HAUSDORFF_DEBUG
   using Timer = CGAL::Real_timer;
 #endif
-  std::vector<boost::any>& tm_wrappers;
+  std::vector<std::any>& tm_wrappers;
 
   // Constructor.
-  Bounded_error_preprocessing(std::vector<boost::any>& tm_wrappers)
+  Bounded_error_preprocessing(std::vector<std::any>& tm_wrappers)
     : tm_wrappers(tm_wrappers)
   { }
 
@@ -1830,8 +1830,8 @@ struct Bounded_error_preprocessing
     : tm_wrappers(s.tm_wrappers)
   { }
 
-  bool is_tm1_wrapper(const boost::any& operand) const { return operand.type() == typeid(TM1Wrapper); }
-  bool is_tm2_wrapper(const boost::any& operand) const { return operand.type() == typeid(TM2Wrapper); }
+  bool is_tm1_wrapper(const std::any& operand) const { return operand.type() == typeid(TM1Wrapper); }
+  bool is_tm2_wrapper(const std::any& operand) const { return operand.type() == typeid(TM2Wrapper); }
 
   // TODO: make AABB tree build parallel!
   void operator()(const tbb::blocked_range<std::size_t>& range)
@@ -1849,12 +1849,12 @@ struct Bounded_error_preprocessing
       auto& tm_wrapper = tm_wrappers[i];
       if(is_tm1_wrapper(tm_wrapper))
       {
-        TM1Wrapper& object = boost::any_cast<TM1Wrapper&>(tm_wrapper);
+        TM1Wrapper& object = std::any_cast<TM1Wrapper&>(tm_wrapper);
         object.build_tree();
       }
       else if(is_tm2_wrapper(tm_wrapper))
       {
-        TM2Wrapper& object = boost::any_cast<TM2Wrapper&>(tm_wrapper);
+        TM2Wrapper& object = std::any_cast<TM2Wrapper&>(tm_wrapper);
         object.build_tree();
       }
       else
@@ -2031,7 +2031,7 @@ bounded_error_squared_one_sided_Hausdorff_distance_impl(const TriangleMesh1& tm1
 
   std::vector<TMF> tm1_parts;
   std::vector<TMF_tree> tm1_trees;
-  std::vector<boost::any> tm_wrappers;
+  std::vector<std::any> tm_wrappers;
 #endif // defined(CGAL_LINKED_WITH_TBB) && defined(CGAL_METIS_ENABLED)
 
 #ifdef CGAL_HAUSDORFF_DEBUG
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_function.h b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_function.h
index db87cc01bfd2..c7fa41d15d52 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_function.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_function.h
@@ -34,7 +34,7 @@
 #include <CGAL/make_mesh_3.h> // for C3t3_initializer
 #include <CGAL/use.h>
 
-#include <boost/any.hpp>
+#include <any>
 
 namespace CGAL {
   class Image_3;
@@ -114,7 +114,7 @@ class Mesh_function
   void tweak_criteria(Mesh_criteria&, Mesh_fnt::Domain_tag) {}
   void tweak_criteria(Mesh_criteria&, Mesh_fnt::Polyhedral_domain_tag);
 private:
-  boost::any object_to_destroy;
+  std::any object_to_destroy;
   C3t3& c3t3_;
   Domain* const domain_;
   Mesh_parameters const p_;
@@ -268,10 +268,10 @@ edge_criteria(double edge_size, Mesh_fnt::Polyhedral_domain_tag)
                             domain_->aabb_tree(),
                             *domain_);
     // The sizing field object, as well as the `patch_ids_vector` are
-    // allocated on the heap, and the following `boost::any` object,
+    // allocated on the heap, and the following `std::any` object,
     // containing two shared pointers, is used to make the allocated
     // objects be destroyed at the destruction of the thread object, using
-    // type erasure (`boost::any`).
+    // type erasure (`std::any`).
     object_to_destroy =
       std::make_pair(QSharedPointer<Mesh_sizing_field>(sizing_field_ptr),
                      QSharedPointer<Patches_ids_vector>(patches_ids_vector_p));
diff --git a/STL_Extension/doc/STL_Extension/CGAL/Object.h b/STL_Extension/doc/STL_Extension/CGAL/Object.h
index ddf919ef64a6..7a329af795f8 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/Object.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/Object.h
@@ -19,7 +19,7 @@ this is done with the global function `make_object()`. This
 encapsulation mechanism requires the use of `assign` or
 `object_cast` to use the functionality of the encapsulated class.
 
-This class is similar in spirit to `boost::any`.
+This class is similar in spirit to `std::any`.
 
 \cgalHeading{Example}
 
diff --git a/STL_Extension/doc/STL_Extension/STL_Extension.txt b/STL_Extension/doc/STL_Extension/STL_Extension.txt
index b793a86550a7..b37ecb282e88 100644
--- a/STL_Extension/doc/STL_Extension/STL_Extension.txt
+++ b/STL_Extension/doc/STL_Extension/STL_Extension.txt
@@ -142,7 +142,7 @@ For handles and indices of vertices, halfedges, faces, etc., we provide speciali
 The class `Object` can store an object of whatever other type.
 It can be used by a function to return objects of different types.
 A mechanism to extract the stored object based on its type is also provided.
-This class is similar to `boost::any`.
+This class is similar to `std::any`.
 
 \section stl_uncertainty Uncertainty Management
 
diff --git a/STL_Extension/include/CGAL/Object.h b/STL_Extension/include/CGAL/Object.h
index 33a01aac875d..24d6ecc1b127 100644
--- a/STL_Extension/include/CGAL/Object.h
+++ b/STL_Extension/include/CGAL/Object.h
@@ -29,20 +29,20 @@
 
 #include <boost/variant.hpp>
 #include <optional>
-#include <boost/any.hpp>
+#include <any>
 #include <memory>
 
 namespace CGAL {
 
 class Object
 {
-    std::shared_ptr<boost::any> obj;
+    std::shared_ptr<std::any> obj;
 
     // returns an any pointer from a variant
-    struct Any_from_variant : public boost::static_visitor<boost::any*> {
+    struct Any_from_variant : public boost::static_visitor<std::any*> {
       template<typename T>
-      boost::any* operator()(const T& t) const {
-        return new boost::any(t);
+      std::any* operator()(const T& t) const {
+        return new std::any(t);
       }
     };
 
@@ -61,7 +61,7 @@ class Object
     Object() : obj() { }
 
     template <class T>
-    Object(T && t, private_tag) : obj(new boost::any(std::forward<T>(t))) { }
+    Object(T && t, private_tag) : obj(new std::any(std::forward<T>(t))) { }
 
     // implicit constructor from optionals containing variants
     template<BOOST_VARIANT_ENUM_PARAMS(typename T)>
@@ -76,7 +76,7 @@ class Object
     template <class T>
     bool assign(T &t) const
     {
-      const T* res = boost::any_cast<T>(obj.get());
+      const T* res = std::any_cast<T>(obj.get());
       if (!res) return false;
       t = *res;
       return true;
@@ -105,7 +105,7 @@ class Object
     template <class T>
     bool is() const
     {
-      return obj && boost::any_cast<T>(obj.get());
+      return obj && std::any_cast<T>(obj.get());
     }
 
     const std::type_info & type() const
@@ -159,14 +159,14 @@ template <class T>
 inline
 const T * object_cast(const Object * o)
 {
-  return boost::any_cast<T>((o->obj).get());
+  return std::any_cast<T>((o->obj).get());
 }
 
 template <class T>
 inline
 T object_cast(const Object & o)
 {
-  const T * result = boost::any_cast<T>((o.obj).get());
+  const T * result = std::any_cast<T>((o.obj).get());
   if (!result)
     throw Bad_object_cast();
   return *result;

From 9a0bdb5d96ce92734cb9dd7dd26b4a53ba8c6f8a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 28 Apr 2023 21:36:57 +0200
Subject: [PATCH 0362/1398] boost::variant ---> std::variant

---
 .../doc/AABB_tree/Concepts/AABBGeomTraits.h   |   2 +-
 ..._polyhedron_facet_intersection_example.cpp |   4 +-
 .../AABB_tree/AABB_ray_shooting_example.cpp   |   4 +-
 .../internal/AABB_ray_intersection.h          |   7 +-
 .../AABB_tree/aabb_test_ray_intersection.cpp  |   2 +-
 .../Arrangement_on_surface_2.txt              |  16 +-
 .../CGAL/Arr_circular_line_arc_traits_2.h     |   2 +-
 .../CGAL/Arr_point_location_result.h          |   4 +-
 .../Concepts/ArrTraits--Intersect_2.h         |   2 +-
 .../Concepts/ArrTraits--MakeXMonotone_2.h     |   2 +-
 .../algebraic_segments.cpp                    |   4 +-
 .../circular_line_arcs.cpp                    |   8 +-
 .../edge_manipulation_curve_history.cpp       |   2 +-
 .../incremental_insertion.cpp                 |   2 +-
 .../point_location_utils.h                    |  12 +-
 .../polycurve_bezier.cpp                      |   4 +-
 .../sgm_point_location.cpp                    |   6 +-
 .../unb_planar_vertical_decomposition.cpp     |  10 +-
 .../include/CGAL/Arr_Bezier_curve_traits_2.h  |   2 +-
 .../include/CGAL/Arr_accessor.h               |   6 +-
 .../CGAL/Arr_algebraic_segment_traits_2.h     |  16 +-
 .../include/CGAL/Arr_batched_point_location.h |   2 +-
 .../Arr_bounded_planar_topology_traits_2.h    |   8 +-
 .../CGAL/Arr_circle_segment_traits_2.h        |   2 +-
 .../include/CGAL/Arr_circular_arc_traits_2.h  |   2 +-
 .../CGAL/Arr_circular_line_arc_traits_2.h     |  97 +++---
 .../include/CGAL/Arr_conic_traits_2.h         |   2 +-
 .../include/CGAL/Arr_curve_data_traits_2.h    |  18 +-
 .../Arr_geodesic_arc_on_sphere_traits_2.h     |   8 +-
 .../CGAL/Arr_geometry_traits/Arr_plane_3.h    |   4 +-
 .../Bezier_bounding_rational_traits.h         |   8 +-
 .../Arr_geometry_traits/Bezier_x_monotone_2.h |   2 +-
 .../Arr_geometry_traits/Circle_segment_2.h    |   2 +-
 .../Conic_x_monotone_arc_2.h                  |   4 +-
 .../include/CGAL/Arr_line_arc_traits_2.h      |   2 +-
 .../include/CGAL/Arr_linear_traits_2.h        |   8 +-
 .../CGAL/Arr_non_caching_segment_traits_2.h   |  10 +-
 .../Arr_lm_nearest_neighbor.h                 |   2 +-
 .../Arr_trapezoid_ric_pl_impl.h               |  26 +-
 .../CGAL/Arr_point_location/Td_X_trapezoid.h  |  54 +--
 .../CGAL/Arr_point_location/Td_active_edge.h  |   2 +-
 .../Td_active_fictitious_vertex.h             |   2 +-
 .../Arr_point_location/Td_active_trapezoid.h  |   6 +-
 .../Arr_point_location/Td_active_vertex.h     |   2 +-
 .../CGAL/Arr_point_location/Td_dag_node.h     |   6 +-
 .../Arr_point_location/Td_inactive_edge.h     |   2 +-
 .../Td_inactive_fictitious_vertex.h           |   2 +-
 .../Td_inactive_trapezoid.h                   |   2 +-
 .../Arr_point_location/Td_inactive_vertex.h   |   2 +-
 .../CGAL/Arr_point_location/Td_traits.h       |  14 +-
 .../Trapezoidal_decomposition_2.h             | 116 +++----
 .../Trapezoidal_decomposition_2_impl.h        | 318 +++++++++---------
 .../include/CGAL/Arr_point_location_result.h  |  10 +-
 .../include/CGAL/Arr_polycurve_traits_2.h     |  32 +-
 .../CGAL/Arr_rat_arc/Rational_arc_d_1.h       |   2 +-
 .../CGAL/Arr_rational_function_traits_2.h     |   2 +-
 .../include/CGAL/Arr_segment_traits_2.h       |   8 +-
 .../Arr_spherical_gaussian_map_3.h            |  28 +-
 .../Arr_transform_on_sphere.h                 |   6 +-
 .../CGAL/Arr_spherical_topology_traits_2.h    |   4 +-
 .../Arr_bounded_planar_vert_decomp_helper.h   |   2 +-
 .../Arr_spherical_topology_traits_2_impl.h    |   8 +-
 .../Arr_spherical_vert_decomp_helper.h        |   2 +-
 .../Arr_unb_planar_topology_traits_2_impl.h   |   8 +-
 .../Arr_unb_planar_vert_decomp_helper.h       |   2 +-
 .../include/CGAL/Arr_tracing_traits_2.h       |  14 +-
 .../CGAL/Arr_unb_planar_topology_traits_2.h   |   4 +-
 .../Arrangement_2/Arr_compute_zone_visitor.h  |   8 +-
 .../CGAL/Arrangement_2/Arr_traits_adaptor_2.h |   6 +-
 .../Arrangement_on_surface_2_global.h         |  38 +--
 .../Arrangement_on_surface_2_impl.h           |   6 +-
 .../Arrangement_2/Arrangement_zone_2_impl.h   |  24 +-
 .../include/CGAL/Arrangement_zone_2.h         |   2 +-
 .../Curved_kernel_via_analysis_2_functors.h   |   6 +-
 .../Make_x_monotone_2.h                       |   8 +-
 .../Sweep_curves_adapter_2.h                  |   6 +-
 .../Surface_sweep_2/Arr_insertion_traits_2.h  |   8 +-
 .../Surface_sweep_2/Arr_overlay_ss_visitor.h  |  19 +-
 .../Surface_sweep_2/Arr_overlay_traits_2.h    |  18 +-
 .../Arr_vert_decomp_ss_visitor.h              |   4 +-
 .../Batched_point_location_test.h             |  32 +-
 .../Arrangement_on_surface_2/IO_base_test.h   |  12 +-
 .../Point_location_test.h                     |  38 +--
 .../Arrangement_on_surface_2/Traits_test.h    |  12 +-
 .../Vertical_decomposition_test.h             |  36 +-
 .../test_arc_polycurve.cpp                    |  24 +-
 .../test_bezier_polycurve.cpp                 |   6 +-
 .../test_circular_arc_polycurve.cpp           |   2 +-
 .../test_conic_polycurve.cpp                  |   4 +-
 .../test_vert_ray_shoot_vert_segments.cpp     |   6 +-
 .../Arrangement_on_surface_2/test_zone.cpp    |   2 +-
 BGL/examples/BGL_triangulation_2/dijkstra.cpp |   4 +-
 .../ArrDirectionalTraits--Intersect_2.h       |   2 +-
 .../Gps_agg_meta_traits.h                     |   8 +-
 .../Gps_simplifier_traits.h                   |   8 +-
 .../Polygon_conversions.h                     |   4 +-
 .../test_general_polygon_constructions.cpp    |   6 +-
 CGAL_ImageIO/include/CGAL/SEP_header.h        |   6 +-
 .../include/CGAL/Cartesian_converter.h        |  22 +-
 .../benchmark/DxfArrayBenchmarks/benchmark.h  |   2 +-
 .../benchmarks_arrangement.cpp                |   4 +-
 .../benchmark/arrangement_traits/benchmark.h  |   2 +-
 .../benchmarks_arrangement.cpp                |   2 +-
 Circular_kernel_2/benchmark/benchmark.h       |   2 +-
 Circular_kernel_2/benchmark/benchmark_CK2.cpp |   4 +-
 .../benchmark/benchmarks_arrangement.cpp      |   4 +-
 .../benchmark/bff_reader/Breader.cpp          |   2 +-
 .../benchmark/dxf_to_bff/dxf_converter.h      |   2 +-
 .../incremental_insertion/benchmark.h         |   2 +-
 .../benchmarks_arrangement.cpp                |   2 +-
 .../Circular_kernel_2/Intersection_traits.h   |  18 +-
 .../internal_functions_on_line_arc_2.h        |  12 +-
 .../include/CGAL/IO/Dxf_variant_reader.h      |   4 +-
 .../CGAL/Circular_kernel_3/Circular_arc_3.h   |   8 +-
 .../Circular_kernel_3/Circular_arc_point_3.h  |  24 +-
 .../Circular_kernel_3/Intersection_traits.h   |  20 +-
 .../CGAL/Circular_kernel_3/Line_arc_3.h       |  12 +-
 .../internal_functions_on_sphere_3.h          |  16 +-
 .../dual/halfspace_intersection_3.h           |   6 +-
 .../Cartesian_coordinate_iterator_2.h         |  10 +-
 .../Cartesian_coordinate_iterator_3.h         |  10 +-
 Filtered_kernel/include/CGAL/Lazy.h           |  38 +--
 .../test_lazy_vector_objects.cpp              |   4 +-
 .../internal/Qt/HyperbolicPainterOstream.h    |   4 +-
 .../internal/Qt/HyperbolicPainterOstreamCK.h  |   4 +-
 ...bolic_Delaunay_triangulation_CK_traits_2.h |   2 +-
 ...perbolic_Delaunay_triangulation_traits_2.h |   2 +-
 ...bolic_Delaunay_triangulation_CK_traits_2.h |  22 +-
 ...perbolic_Delaunay_triangulation_traits_2.h |  34 +-
 Installation/CHANGES.md                       |   1 +
 .../Intersections_2/variant_any_object.cpp    |  14 +-
 .../include/CGAL/Intersection_traits.h        |  18 +-
 .../include/CGAL/Intersection_traits_2.h      |  18 +-
 .../CGAL/Intersections_2/Bbox_2_Bbox_2.h      |   4 +-
 .../Intersections_2/test_intersections_2.cpp  |   2 +-
 .../include/CGAL/Intersection_traits_3.h      |  72 ++--
 .../CGAL/Intersections_3/Bbox_3_Bbox_3.h      |   6 +-
 .../internal/Bbox_3_Segment_3_intersection.h  |   6 +-
 .../Iso_cuboid_3_Triangle_3_intersection.h    |   4 +-
 .../Plane_3_Plane_3_Plane_3_intersection.h    |   6 +-
 .../Segment_3_Segment_3_intersection.h        |   4 +-
 .../Triangle_3_Triangle_3_intersection.h      |   2 +-
 .../tetrahedron_lines_intersections_3.h       |   4 +-
 .../intersection_test_helper.h                |   4 +-
 .../test_intersections_Iso_cuboid_3.cpp       |  18 +-
 .../test_intersections_Plane_3.cpp            |   2 +-
 .../test_intersections_Tetrahedron_3.cpp      |  14 +-
 .../Kernel_23/CGAL/Projection_traits_xy_3.h   |   2 +-
 .../CGAL/Spherical_kernel_intersections.h     |   2 +-
 Kernel_23/doc/Kernel_23/CGAL/intersections.h  |  16 +-
 Kernel_23/doc/Kernel_23/Kernel_23.txt         |   6 +-
 .../Kernel_23/cartesian_converter.cpp         |   2 +-
 .../examples/Kernel_23/intersection_get.cpp   |   4 +-
 .../Kernel_23/intersection_visitor.cpp        |   2 +-
 Kernel_23/include/CGAL/Kernel/Type_mapper.h   |  16 +-
 .../include/CGAL/Kernel/function_objects.h    |  10 +-
 .../Kernel_23/internal/Projection_traits_3.h  |   8 +-
 .../internal/Projection_traits_base_3.h       |  10 +-
 .../test/Kernel_23/include/CGAL/_test_depth.h |   2 +-
 Kernel_d/doc/Kernel_d/CGAL/intersections_d.h  |   6 +-
 Kernel_d/doc/Kernel_d/Kernel_d.txt            |   6 +-
 .../include/CGAL/Kernel_d/function_objects.h  |  18 +-
 Mesh_3/benchmark/Mesh_3/StdAfx.h              |   2 +-
 .../Concepts/IntersectionGeometricTraits_3.h  |   4 +-
 .../Concepts/MeshTriangulationTraits_3.h      |   6 +-
 Mesh_3/include/CGAL/Labeled_mesh_domain_3.h   |   8 +-
 .../Sizing_field_with_aabb_tree.h             |   2 +-
 .../Mesh_domain_with_polyline_features_3.h    |  10 +-
 .../CGAL/Polyhedral_complex_mesh_domain_3.h   |   6 +-
 .../include/CGAL/Polyhedral_mesh_domain_3.h   |  12 +-
 .../Mesh_3/test_labeled_mesh_domain_3.cpp     |  12 +-
 .../Minkowski_sum_2/Arr_labeled_traits_2.h    |   8 +-
 Nef_2/include/CGAL/Nef_2/geninfo.h            |   2 +-
 ...xact_triangulation_euclidean_traits_xy_3.h |  12 +-
 ...xact_triangulation_euclidean_traits_xz_3.h |  12 +-
 ...xact_triangulation_euclidean_traits_yz_3.h |  12 +-
 .../CGAL/NewKernel_d/KernelD_converter.h      |   2 +-
 .../OTR_2/Reconstruction_triangulation_2.h    |   2 +-
 .../Protect_edges_sizing_field.h              |  14 +-
 .../include/CGAL/refine_periodic_3_mesh_3.h   |   2 +-
 .../internal/Qt/HyperbolicPainterOstream.h    |   4 +-
 .../hyperbolic_free_motion_animation.h        |   6 +-
 ...perbolic_Delaunay_triangulation_traits_2.h |  24 +-
 .../include/CGAL/structure_point_set.h        |  14 +-
 .../Corefinement/intersection_nodes.h         |   4 +-
 .../Axis_parallel_plane_traits.h              |   4 +-
 .../CGAL/Polygon_mesh_processing/locate.h     |  30 +-
 .../include/CGAL/Polygon_mesh_slicer.h        |  22 +-
 .../test_pmp_locate.cpp                       |   6 +-
 .../Plugins/Mesh_3/C3t3_io_plugin.cpp         |   6 +-
 .../Plugins/Mesh_3/Mesh_3_plugin.cpp          |   2 +-
 .../PMP/Surface_intersection_plugin.cpp       |   8 +-
 Polyhedron/demo/Polyhedron/Scene.h            |   2 +-
 .../Polyhedron/Scene_surface_mesh_item.cpp    |   8 +-
 .../demo/Polyhedron/include/id_printing.h     |   4 +-
 SMDS_3/include/CGAL/IO/output_to_vtu.h        |  16 +-
 .../internal/Handle_IO_for_pair_of_int.h      |  10 +-
 .../CGAL/SMDS_3/internal/indices_management.h |  23 +-
 SMDS_3/include/CGAL/SMDS_3/io_signature.h     |  14 +-
 .../CGAL/Simplicial_mesh_vertex_base_3.h      |   4 +-
 SMDS_3/test/SMDS_3/data/c3t3_io-hetero.cgal   |   2 +-
 SMDS_3/test/SMDS_3/test_c3t3_io.cpp           |   6 +-
 STL_Extension/doc/STL_Extension/CGAL/Object.h |   8 +-
 .../doc/STL_Extension/CGAL/iterator.h         |   8 +-
 .../Dispatch_output_iterator.cpp              |   4 +-
 STL_Extension/include/CGAL/Object.h           |  16 +-
 STL_Extension/include/CGAL/iterator.h         |  16 +-
 .../test/STL_Extension/test_Object.cpp        |   8 +-
 .../STL_Extension/test_dispatch_output.cpp    |   4 +-
 .../internal/Contour_base_2.h                 |   4 +-
 .../examples/Surface_mesh/sm_aabbtree.cpp     |   8 +-
 .../internal/SDF_calculation.h                |   4 +-
 .../Concepts/SurfaceMeshShortestPathTraits.h  |   2 +-
 .../shortest_path_sequence.cpp                |  11 +-
 .../Surface_mesh_shortest_path.h              |  12 +-
 .../function_objects.h                        |   4 +-
 .../include/CGAL/Surface_sweep_2.h            |   2 +-
 .../Surface_sweep_2/Surface_sweep_2_impl.h    |  14 +-
 .../Surface_sweep_2/Surface_sweep_2_utils.h   |   6 +-
 .../internal/tetrahedral_remeshing_helpers.h  |   2 +-
 .../ConstrainedTriangulationTraits_2.h        |   2 +-
 .../CGAL/Constrained_triangulation_2.h        |   6 +-
 .../simple_polygon_visibility_2.cpp           |   2 +-
 .../CGAL/Simple_polygon_visibility_2.h        |   4 +-
 .../CGAL/Voronoi_diagram_2.h                  |   2 +-
 .../Concepts/AdaptationTraits_2.h             |   2 +-
 .../Voronoi_diagram_2/vd_2_point_location.cpp |   6 +-
 .../vd_2_point_location_sdg_linf.cpp          |   6 +-
 .../include/CGAL/Voronoi_diagram_2.h          |  10 +-
 .../Apollonius_graph_nearest_site_2.h         |   4 +-
 .../Delaunay_triangulation_nearest_site_2.h   |   4 +-
 .../Regular_triangulation_nearest_site_2.h    |   4 +-
 .../Segment_Delaunay_graph_nearest_site_2.h   |   4 +-
 .../include/vda_test_concept.h                |   8 +-
 .../include/vda_test_locate.h                 |  14 +-
 .../Voronoi_diagram_2/include/vda_test_vda.h  |   6 +-
 236 files changed, 1249 insertions(+), 1273 deletions(-)

diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
index e6d51ffdb756..5c7a45edb671 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
@@ -47,7 +47,7 @@ Provides the operator:
 `return_type operator()(const Query& q, const Primitive::Datum& d)`,
 
 which computes the intersection between `q` and `d`. The type of the returned object
-must be a `std::optional` of a `boost::variant` of the possible intersection types.
+must be a `std::optional` of a `std::variant` of the possible intersection types.
 */
 typedef unspecified_type Intersect_3;
 
diff --git a/AABB_tree/examples/AABB_tree/AABB_polyhedron_facet_intersection_example.cpp b/AABB_tree/examples/AABB_tree/AABB_polyhedron_facet_intersection_example.cpp
index e01e49c0b6ec..6ced34c02340 100644
--- a/AABB_tree/examples/AABB_tree/AABB_polyhedron_facet_intersection_example.cpp
+++ b/AABB_tree/examples/AABB_tree/AABB_polyhedron_facet_intersection_example.cpp
@@ -57,7 +57,7 @@ int main()
     if(intersection)
     {
         // gets intersection object
-      const Point* p = boost::get<Point>(&(intersection->first));
+      const Point* p = std::get_if<Point>(&(intersection->first));
       if(p)
         std::cout << "intersection object is a point " << *p << std::endl;
 
@@ -81,7 +81,7 @@ int main()
     if(plane_intersection)
     {
 
-      if(boost::get<Segment>(&(plane_intersection->first)))
+      if(std::get_if<Segment>(&(plane_intersection->first)))
             std::cout << "intersection object is a segment" << std::endl;
     }
 
diff --git a/AABB_tree/examples/AABB_tree/AABB_ray_shooting_example.cpp b/AABB_tree/examples/AABB_tree/AABB_ray_shooting_example.cpp
index fc450abd5a80..e9ed0fe87c5d 100644
--- a/AABB_tree/examples/AABB_tree/AABB_ray_shooting_example.cpp
+++ b/AABB_tree/examples/AABB_tree/AABB_ray_shooting_example.cpp
@@ -70,8 +70,8 @@ int main(int argc, char* argv[])
     Ray_intersection intersection = tree.first_intersection(ray, skip);
     if(intersection)
     {
-      if(boost::get<Point>(&(intersection->first))){
-        const Point* p =  boost::get<Point>(&(intersection->first) );
+      if(std::get_if<Point>(&(intersection->first))){
+        const Point* p =  std::get_if<Point>(&(intersection->first) );
         std::cout <<  *p << std::endl;
       }
     }
diff --git a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
index 1bc03ff4cf4d..075d48ffda33 100644
--- a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
+++ b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
@@ -20,7 +20,6 @@
 #include <functional>
 #include <type_traits>
 #include <optional>
-#include <boost/variant/apply_visitor.hpp>
 #  if defined(BOOST_MSVC)
 #    pragma warning(push)
 #    pragma warning(disable: 4996)
@@ -84,7 +83,7 @@ class AABB_ray_intersection {
         if(!skip(current.node->left_data().id()) /* && do_intersect_obj(query, current.node->left_data()) */) {
           intersection = intersection_obj(query, current.node->left_data());
           if(intersection) {
-            FT ray_distance = boost::apply_visitor(param_visitor, intersection->first);
+            FT ray_distance = std::visit(param_visitor, intersection->first);
             if(ray_distance < t) {
               t = ray_distance;
               p = intersection;
@@ -96,7 +95,7 @@ class AABB_ray_intersection {
         if(!skip(current.node->right_data().id()) /* && do_intersect_obj(query, current.node->right_data()) */) {
           intersection = intersection_obj(query, current.node->right_data());
           if(intersection) {
-            FT ray_distance = boost::apply_visitor(param_visitor, intersection->first);
+            FT ray_distance = std::visit(param_visitor, intersection->first);
             if(ray_distance < t) {
               t = ray_distance;
               p = intersection;
@@ -111,7 +110,7 @@ class AABB_ray_intersection {
         if(!skip(current.node->left_data().id()) /* && do_intersect_obj(query, current.node->left_data()) */) {
           intersection = intersection_obj(query, current.node->left_data());
           if(intersection) {
-            FT ray_distance = boost::apply_visitor(param_visitor, intersection->first);
+            FT ray_distance = std::visit(param_visitor, intersection->first);
             if(ray_distance < t) {
               t = ray_distance;
               p = intersection;
diff --git a/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp b/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp
index cbe92baaf705..da3b5436eddf 100644
--- a/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp
+++ b/AABB_tree/test/AABB_tree/aabb_test_ray_intersection.cpp
@@ -51,7 +51,7 @@ min_intersection(const Tree& tree, const Ray& ray) {
     > mini = std::nullopt;
 
   for(IntersectionVector::iterator it2 = all_intersections.begin(); it2 != all_intersections.end(); ++it2) {
-    if(Point* point = boost::get<Point>(&(it2->first))) {
+    if(Point* point = std::get_if<Point>(&(it2->first))) {
       Vector i_ray(*point, ray.source());
       Tree::FT new_distance = i_ray.squared_length();
       if(new_distance < min_distance) {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index 2050328161b8..bd0c7339172c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -1320,7 +1320,7 @@ Arrangement_on_surface_2::Face_const_handle
 `Face_const_handle`\endlink. Depending on whether the query point is
 located inside a face, lies on an edge, or coincides with a vertex,
 the appropriate handle can be obtained with <em>value retrieval</em>
-by `boost::get` as demonstrated in the example below.
+by `std::get` as demonstrated in the example below.
 
 Note that the handles returned by the \link
 ArrangementPointLocation_2::locate() `locate()`\endlink functions are
@@ -1361,7 +1361,7 @@ The function template `locate_point()` calls an instance of the
 function template `print_point_location()`, which inserts the
 result of the query into the standard output-stream. It is listed
 below, and defined in the header file `point_location_utils.h`.
-Observe how the function `boost::get()` is used to cast the
+Observe how the function `std::get()` is used to cast the
 resulting object into a handle to an arrangement feature. The
 point-location object `pl` is assumed to be already attached
 to an arrangement.
@@ -1383,13 +1383,13 @@ void print_point_location
   const Face_const_handle*     f;
 
   std::cout << "The point (" << q << ") is located ";
-  if (f = boost::get<Face_const_handle>(&obj)) // located inside a face
+  if (f = std::get_if<Face_const_handle>(&obj)) // located inside a face
     std::cout << "inside "
               << (((*f)->is_unbounded()) ? "the unbounded" : "a bounded")
               << " face.\n";
-  else if (e = boost::get<Halfedge_const_handle>(&obj)) // located on an edge
+  else if (e = std::get_if<Halfedge_const_handle>(&obj)) // located on an edge
     std::cout << "on an edge: " << (*e)->curve() << std::endl;
-  else if (v = boost::get<Vertex_const_handle>(&obj)) // located on a vertex
+  else if (v = std::get_if<Vertex_const_handle>(&obj)) // located on a vertex
     std::cout << "on " << (((*v)->is_isolated()) ? "an isolated" : "a")
               << " vertex: " << (*v)->point() << std::endl;
   else CGAL_error_msg("Invalid object.");
@@ -1603,12 +1603,12 @@ void shoot_vertical_ray(const RayShoot& vrs,
   const Face_const_handle* f;
 
   std::cout << "Shooting up from (" << q << ") : ";
-  if (v = boost::get<Vertex_const_handle>(&obj))         // we hit a vertex
+  if (v = std::get_if<Vertex_const_handle>(&obj))         // we hit a vertex
     std::cout << "hit " << (((*v)->is_isolated()) ? "an isolated" : "a")
               << " vertex: " << (*v)->point() << std::endl;
-  else if (e = boost::get<Halfedge_const_handle>(&obj))  // we hit an edge
+  else if (e = std::get_if<Halfedge_const_handle>(&obj))  // we hit an edge
     std::cout << "hit an edge: " << (*e)->curve() << std::endl;
-  else if (f = boost::get<Face_const_handle>(&obj)) {    // we hit nothing
+  else if (f = std::get_if<Face_const_handle>(&obj)) {    // we hit nothing
     CGAL_assertion((*f)->is_unbounded());
     std::cout << "hit nothing.\n";
   }
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h
index b12a51541cf4..90abb7e19e2b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h
@@ -10,7 +10,7 @@ of both types
 `CGAL::Line_arc_2<CircularKernel>` or
 `CGAL::Circular_arc_2<CircularKernel>`.
 
-It uses the <A HREF="https://www.boost.org/doc/html/variant.html">boost::variant</A>.
+It uses the <A HREF="https://www.boost.org/doc/html/variant.html">std::variant</A>.
 
 \cgalModels `ArrangementTraits_2`
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
index 20a6787d7e5c..32b4e443326e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
@@ -11,7 +11,7 @@ is included.
 
 - `CGAL_ARR_POINT_LOCATION_VERSION` == 1, the result type is set to be `CGAL::Object`.
 - `CGAL_ARR_POINT_LOCATION_VERSION` == 2, the result type is set to be
-`boost::variant<Vertex_const_handle,Halfedge_const_handle,Face_const_handle>`, where `Vertex_const_handle`, `Halfedge_const_handle`, and
+`std::variant<Vertex_const_handle,Halfedge_const_handle,Face_const_handle>`, where `Vertex_const_handle`, `Halfedge_const_handle`, and
 `Face_const_handle` are the corresponding nested types in a `CGAL::Arrangement_2` instance.
 
 
@@ -44,7 +44,7 @@ struct Arr_point_location_result
 {
   /*! The type of the arrangement feature that is the result of a
    * point-location query or a vertical ray-shoot query, namely,
-   * `boost::variant<Arrangement::Vertex_const_handle, Arrangement::Halfedge_const_handle, Arrangement::Face_const_handle>`
+   * `std::variant<Arrangement::Vertex_const_handle, Arrangement::Halfedge_const_handle, Arrangement::Face_const_handle>`
    * if `::CGAL_ARR_POINT_LOCATION_VERSION` == 2, which is the default, otherwise
    * `CGAL::Object`.
    */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
index 0350b6ce6543..a4bfaebef7ac 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
@@ -17,7 +17,7 @@ class Intersect_2 {
   /*! computes the intersections of `xc1` and `xc2` and writes them <I>in an
    * ascending lexicographic \f$xy\f$-order</I> into a range beginning at
    * `oi`. The type `OutputIterator` must dereference a polymorphic object of
-   * type `boost::variant` that wraps objects of type either type
+   * type `std::variant` that wraps objects of type either type
    * `pair<ArrTraits::Point_2, ArrTraits::Multiplicity>` or
    * `ArrTraits::X_monotone_curve_2`. An object of the former type represents an
    * intersection point with its multiplicity (in case the multiplicity is
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
index db0df3c8cc80..32c5efccb0b3 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
@@ -16,7 +16,7 @@ class MakeXMonotone_2 {
   /*! subdivides the input curve `c` into \f$x\f$-monotone subcurves and
    * isolated points, and inserts the results into a range beginning at the given
    * output iterator `oi`. The type `OutputIterator` dereferences a
-   * `boost::variant` that wraps either an `ArrTraits::Point_2` object or an
+   * `std::variant` that wraps either an `ArrTraits::Point_2` object or an
    * `ArrTraits::X_monotone_curve_2` object. The operator returns a past-the-end
    * iterator for the output sequence.
    */
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp
index 95eb729bb66f..c1bc7c4779d9 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp
@@ -29,7 +29,7 @@ typedef Traits::Algebraic_real_1                      Algebraic_real;
 typedef Traits::X_monotone_curve_2                    X_monotone_curve;
 typedef Traits::Point_2                               Point;
 
-typedef boost::variant<Point, X_monotone_curve>       Make_x_monotone_result;
+typedef std::variant<Point, X_monotone_curve>       Make_x_monotone_result;
 
 int main() {
   Traits traits;
@@ -52,7 +52,7 @@ int main() {
   // but not in this case).
   std::vector<X_monotone_curve> segs;
   for(size_t i = 0; i < pre_segs.size(); ++i) {
-    auto* curr_p = boost::get<X_monotone_curve>(&pre_segs[i]);
+    auto* curr_p = std::get<X_monotone_curve>(&pre_segs[i]);
     assert(curr_p);
     segs.push_back(*curr_p);
   }
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp
index 1e7854b74826..735403352577 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp
@@ -10,7 +10,7 @@
 #include <CGAL/Arr_circular_line_arc_traits_2.h>
 #include <CGAL/Arrangement_2.h>
 #include <CGAL/Arr_naive_point_location.h>
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/Random.h>
 
@@ -25,7 +25,7 @@ typedef Circular_k::Circle_2                                Circle_2;
 typedef Circular_k::Circular_arc_2                          Circular_arc_2;
 typedef Circular_k::Line_arc_2                              Line_arc_2;
 
-typedef boost::variant< Circular_arc_2, Line_arc_2>         Arc_2;
+typedef std::variant< Circular_arc_2, Line_arc_2>         Arc_2;
 typedef std::vector< Arc_2>                                 ArcContainer;
 
 typedef CGAL::Arr_circular_line_arc_traits_2<Circular_k>    Traits;
@@ -52,7 +52,7 @@ int main() {
     } while((x1 == x2) && (y1 == y2));
 
     std::cout << x1 << " " << y1 << " " << x2 << " " << y2 << std::endl;
-    boost::variant< Circular_arc_2, Line_arc_2 > v =
+    std::variant< Circular_arc_2, Line_arc_2 > v =
       Line_arc_2(Point_2(x1,y1), Point_2(x2,y2));
     ac.push_back( v);
   }
@@ -63,7 +63,7 @@ int main() {
       y1 = theRandom.get_int(random_min,random_max);
     }
     while(x1==0 && y1==0);
-    boost::variant< Circular_arc_2, Line_arc_2 > v =
+    std::variant< Circular_arc_2, Line_arc_2 > v =
       Circle_2( Point_2(x1,y1), x1*x1 + y1*y1);
     ac.push_back(v);
   }
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp
index e89d8b57d89a..c1ee293fd271 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp
@@ -45,7 +45,7 @@ int main() {
   Point_location pl(arr);
   const Point q{_7_halves, 7};
   Point_location::result_type obj = pl.locate(q);
-  auto* e = boost::get<Arr_with_hist::Halfedge_const_handle>(&obj);
+  auto* e = std::get<Arr_with_hist::Halfedge_const_handle>(&obj);
 
   // Split the edge e to two edges e1 and e2;
   auto e1 = arr.split_edge(arr.non_const_handle(*e), q);
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp
index 51112be6c50f..425b187d17ed 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp
@@ -32,7 +32,7 @@ int main() {
   // the boundary of the face that contains it.
   Point q(4, 1);
   auto obj = pl.locate(q);
-  auto* f = boost::get<Arrangement::Face_const_handle>(&obj);
+  auto* f = std::get<Arrangement::Face_const_handle>(&obj);
 
   std::cout << "The query point (" << q << ") is located in: ";
   print_face<Arrangement>(*f);
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
index 70bc38bce3f3..f50236bb3e51 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
@@ -46,13 +46,13 @@ void print_point_location
   const Face_const_handle* f;
 
   std::cout << "The point (" << q << ") is located ";
-  if ((f = boost::get<Face_const_handle>(&obj)))          // inside a face
+  if ((f = std::get<Face_const_handle>(&obj)))          // inside a face
     std::cout << "inside "
               << (((*f)->is_unbounded()) ? "the unbounded" : "a bounded")
               << " face." << std::endl;
-  else if ((e = boost::get<Halfedge_const_handle>(&obj))) // on an edge
+  else if ((e = std::get<Halfedge_const_handle>(&obj))) // on an edge
     std::cout << "on an edge: " << (*e)->curve() << std::endl;
-  else if ((v = boost::get<Vertex_const_handle>(&obj)))   // on a vertex
+  else if ((v = std::get<Vertex_const_handle>(&obj)))   // on a vertex
     std::cout << "on " << (((*v)->is_isolated()) ? "an isolated" : "a")
               << " vertex: " << (*v)->point() << std::endl;
   else CGAL_error_msg("Invalid object.");
@@ -101,12 +101,12 @@ void shoot_vertical_ray(const VerticalRayShooting& vrs,
 
   std::cout << "Shooting up from (" << q << ") : hit ";
 
-  if ((v = boost::get<Vertex_const_handle>(&obj)))         // hit a vertex
+  if ((v = std::get<Vertex_const_handle>(&obj)))         // hit a vertex
     std::cout << (((*v)->is_isolated()) ? "an isolated" : "a")
               << " vertex: " << (*v)->point() << std::endl;
-  else if ((e = boost::get<Halfedge_const_handle>(&obj)) ) // hit an edge
+  else if ((e = std::get<Halfedge_const_handle>(&obj)) ) // hit an edge
     std::cout << "an edge: " << (*e)->curve() << std::endl;
-  else if ((f = boost::get<Face_const_handle>(&obj))) {    // hit nothing
+  else if ((f = std::get<Face_const_handle>(&obj))) {    // hit nothing
     assert((*f)->is_unbounded());
     std::cout << "nothing." << std::endl;
   }
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp
index 287fd51786ac..bc4168f2da0e 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp
@@ -24,7 +24,7 @@ typedef Polycurve_bezier_traits::Point_2                Point;
 typedef Polycurve_bezier_traits::X_monotone_curve_2     X_mono_polycurve;
 typedef CGAL::Arrangement_2<Polycurve_bezier_traits>    Arrangement_2;
 
-typedef boost::variant<Point, Bezier_x_monotone_curve>  Make_x_monotone_result;
+typedef std::variant<Point, Bezier_x_monotone_curve>  Make_x_monotone_result;
 
 int main() {
   Polycurve_bezier_traits pc_traits;
@@ -58,7 +58,7 @@ int main() {
     // convert it into x-monotone bezier curve.
     std::vector<Make_x_monotone_result> obj_vector;
     bezier_traits.make_x_monotone_2_object()(B, std::back_inserter(obj_vector));
-    auto* x_seg_p = boost::get<Bezier_x_monotone_curve>(&obj_vector[0]);
+    auto* x_seg_p = std::get<Bezier_x_monotone_curve>(&obj_vector[0]);
     x_curves.push_back(*x_seg_p);
   }
 
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
index 1ba6d9b52322..5cd1a8367c24 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
@@ -99,15 +99,15 @@ int main() {
   for (auto it = results.begin(); it != results.end(); ++it) {
     std::cout << "The point (" << it->first << ") is located ";
     if (const Face_const_handle* f =
-        boost::get<Face_const_handle>(&(it->second)))       // inside a face
+        std::get<Face_const_handle>(&(it->second)))       // inside a face
       std::cout << "inside "
                 << (((*f)->is_unbounded()) ? "the unbounded" : "a bounded")
                 << " face.\n";
     else if (const Halfedge_const_handle* e =
-             boost::get<Halfedge_const_handle>(&(it->second))) // on an edge
+             std::get<Halfedge_const_handle>(&(it->second))) // on an edge
       std::cout << "on an edge: " << (*e)->curve() << std::endl;
     else if (const Vertex_const_handle* v =
-             boost::get<Vertex_const_handle>(&(it->second)))  // on a vertex
+             std::get<Vertex_const_handle>(&(it->second)))  // on a vertex
       std::cout << "on "
                 << (((*v)->is_isolated()) ? "an isolated" : "a")
                 << " vertex: " << (*v)->point() << std::endl;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
index 95bdc262b299..d51f4fae3894 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
@@ -8,7 +8,7 @@
 
 #include "arr_linear.h"
 
-typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
+typedef std::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>              Cell_type;
 typedef std::optional<Cell_type>                       Vert_decomp_type;
 typedef std::pair<Vert_decomp_type, Vert_decomp_type>    Vert_decomp_pair;
@@ -41,10 +41,10 @@ int main() {
     std::cout << " feature below: ";
     if (! curr.first) std::cout << "EMPTY";
     else {
-      auto* vh = boost::get<Vertex_const_handle>(&*(curr.first));;
+      auto* vh = std::get<Vertex_const_handle>(&*(curr.first));;
       if (vh) std::cout << '(' << (*vh)->point() << ')';
       else {
-        auto* hh = boost::get<Halfedge_const_handle>(&*(curr.first));
+        auto* hh = std::get<Halfedge_const_handle>(&*(curr.first));
         if (! (*hh)->is_fictitious())
           std::cout << '[' << (*hh)->curve() << ']';
         else std::cout << "NONE";
@@ -54,10 +54,10 @@ int main() {
     std::cout << "   feature above: ";
     if (! curr.second) std::cout << "EMPTY\n";
     else {
-      auto* vh = boost::get<Vertex_const_handle>(&*(curr.second));;
+      auto* vh = std::get<Vertex_const_handle>(&*(curr.second));;
       if (vh) std::cout << '(' << (*vh)->point() << ")\n";
       else {
-        auto* hh = boost::get<Halfedge_const_handle>(&*(curr.second));
+        auto* hh = std::get<Halfedge_const_handle>(&*(curr.second));
         if (! (*hh)->is_fictitious())
           std::cout << '[' << (*hh)->curve() << "]\n";
         else std::cout << "NONE\n";
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_Bezier_curve_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_Bezier_curve_traits_2.h
index 7aedff1530de..461cadf34a10 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_Bezier_curve_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_Bezier_curve_traits_2.h
@@ -499,7 +499,7 @@ class Arr_Bezier_curve_traits_2
     template <typename OutputIterator>
     OutputIterator operator() (const Curve_2& B, OutputIterator oi) const
     {
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
                                                 Make_x_monotone_result;
       typedef typename Bounding_traits::Vertical_tangency_point
                                                 Vertical_tangency_point;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_accessor.h b/Arrangement_on_surface_2/include/CGAL/Arr_accessor.h
index 90ae69d90cac..202ca448b5e9 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_accessor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_accessor.h
@@ -114,13 +114,13 @@ class Arr_accessor {
     auto obj = p_arr->topology_traits()->locate_curve_end(cv, ind, ps_x, ps_y);
 
     // Return a handle to the DCEL feature.
-    DFace** f_p = boost::get<DFace*>(&obj);
+    DFace** f_p = std::get<DFace*>(&obj);
     if (f_p) return (Pl_result::make_result(p_arr->_const_handle_for(*f_p)));
 
-    DHalfedge** he_p = boost::get<DHalfedge*>(&obj);
+    DHalfedge** he_p = std::get<DHalfedge*>(&obj);
     if (he_p) return (Pl_result::make_result(p_arr->_const_handle_for(*he_p)));
 
-    DVertex** v_p = boost::get<DVertex*>(&obj);
+    DVertex** v_p = std::get<DVertex*>(&obj);
     if (v_p) return (Pl_result::make_result(p_arr->_const_handle_for(*v_p)));
 
     // We should never reach here:
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
index 02e44f64cef6..b1678fe4acdd 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
@@ -271,7 +271,7 @@ class Arr_algebraic_segment_traits_2 {
                          std::optional<Point_2> end,
                          OutputIterator out) const
       {
-        typedef boost::variant<Point_2, X_monotone_curve_2>
+        typedef std::variant<Point_2, X_monotone_curve_2>
                                                         Make_x_monotone_result;
         //CGAL_assertion(is_one_one(cv,p));
 
@@ -286,11 +286,11 @@ class Arr_algebraic_segment_traits_2 {
         this->_ckva()->make_x_monotone_2_object()(cv, std::back_inserter(arcs));
         auto it = arcs.begin();
         auto helper = it;
-        const auto* it_seg_p = boost::get<X_monotone_curve_2>(&(*it));
+        const auto* it_seg_p = std::get<X_monotone_curve_2>(&(*it));
         while (it != arcs.end()) {
           if ( on_arc(p, *it_seg_p) ) break;
           it++;
-          it_seg_p = boost::get<X_monotone_curve_2>(&(*it));
+          it_seg_p = std::get<X_monotone_curve_2>(&(*it));
         }
 
         bool left_on_arc = start && on_arc(start.get(), *it_seg_p);
@@ -348,11 +348,11 @@ class Arr_algebraic_segment_traits_2 {
             }
             CGAL_assertion(it != arcs.begin());
             it--;
-            it_seg_p = boost::get<X_monotone_curve_2>(&(*it));
+            it_seg_p = std::get<X_monotone_curve_2>(&(*it));
             while (! on_arc(point_it, *it_seg_p)) {
               CGAL_assertion(it != arcs.begin());
               it--;
-              it_seg_p = boost::get<X_monotone_curve_2>(&(*it));
+              it_seg_p = std::get<X_monotone_curve_2>(&(*it));
             }
             if (start && on_arc(start.get(),*it_seg_p)) {
               segs.push_front(it_seg_p->trim(start.get(), right(*it_seg_p)));
@@ -365,7 +365,7 @@ class Arr_algebraic_segment_traits_2 {
         }
         if (! right_on_arc) {
           it = helper; // reset
-          it_seg_p = boost::get<X_monotone_curve_2>(&(*it));
+          it_seg_p = std::get<X_monotone_curve_2>(&(*it));
           Point_2 point_it;
           while (true) {
             if (it_seg_p->is_finite(CGAL::ARR_MAX_END) &&
@@ -378,11 +378,11 @@ class Arr_algebraic_segment_traits_2 {
             }
             it++;
             CGAL_assertion(it != arcs.end());
-            it_seg_p = boost::get<X_monotone_curve_2>(&(*it));
+            it_seg_p = std::get<X_monotone_curve_2>(&(*it));
             while(! on_arc(point_it, *it_seg_p)) {
               it++;
               CGAL_assertion(it != arcs.end());
-              it_seg_p = boost::get<X_monotone_curve_2>(&(*it));
+              it_seg_p = std::get<X_monotone_curve_2>(&(*it));
             }
             if(end && on_arc(end.get(),*it_seg_p)) {
               segs.push_back(it_seg_p->trim(left(*it_seg_p),end.get()));
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
index 81fec7a37855..e1f9ad986a31 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
@@ -41,7 +41,7 @@ namespace Ss2 = Surface_sweep_2;
  * \param oi Output: An output iterator for the query results.
  * \pre The value-type of PointsIterator is Arrangement::Point_2,
  *      and the value-type of OutputIterator is is pair<Point_2, Result>,
- *      where Result is std::optional<boost::variant<Vertex_const_handle,
+ *      where Result is std::optional<std::variant<Vertex_const_handle,
  *                                      Halfedge_const_handle,
  *                                      Face_const_handle> >.
  *      It represents the arrangement feature containing the point.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
index e7aea3a8d19d..8f1339b6a227 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
@@ -14,7 +14,7 @@
 #ifndef CGAL_ARR_BOUNDED_PLANAR_TOPOLOGY_TRAITS_2_H
 #define CGAL_ARR_BOUNDED_PLANAR_TOPOLOGY_TRAITS_2_H
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/license/Arrangement_on_surface_2.h>
 
@@ -305,7 +305,7 @@ class Arr_bounded_planar_topology_traits_2 :
    * \pre The curve has a boundary condition in either x or y.
    * \return An object that wraps the curve end.
    */
-  std::optional<boost::variant<Vertex*, Halfedge*> >
+  std::optional<std::variant<Vertex*, Halfedge*> >
   place_boundary_vertex(Face*,
                         const X_monotone_curve_2&,
                         Arr_curve_end,
@@ -347,13 +347,13 @@ class Arr_bounded_planar_topology_traits_2 :
    * \pre The curve end is incident to the boundary.
    * \return An object that contains the curve end.
    */
-  boost::variant<Vertex*, Halfedge*, Face*>
+  std::variant<Vertex*, Halfedge*, Face*>
   locate_curve_end(const X_monotone_curve_2&,
                    Arr_curve_end,
                    Arr_parameter_space /* ps_x */,
                    Arr_parameter_space /* ps_y */)
   {
-    typedef boost::variant<Vertex*, Halfedge*, Face*>   Result;
+    typedef std::variant<Vertex*, Halfedge*, Face*>   Result;
     // This function should never be called:
     CGAL_error();
     Vertex* v(nullptr);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_circle_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_circle_segment_traits_2.h
index 3dabf7971842..7eb42ef70845 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_circle_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_circle_segment_traits_2.h
@@ -404,7 +404,7 @@ class Arr_circle_segment_traits_2 {
     template <typename OutputIterator>
     OutputIterator operator()(const Curve_2& cv, OutputIterator oi) const
     {
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
 
       // Increment the serial number of the curve cv, which will serve as its
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_circular_arc_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_circular_arc_traits_2.h
index 6827889a4f1b..f790bcac2460 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_circular_arc_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_circular_arc_traits_2.h
@@ -178,7 +178,7 @@ class Arr_circular_arc_traits_2 {
     template <typename OutputIterator>
     OutputIterator operator()(const Curve_2& arc, OutputIterator oi) const
     {
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
 
       std::vector<CGAL::Object> objs;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
index e913bc9f7db5..4efc598b81d4 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
@@ -35,7 +35,7 @@
 
 #include <vector>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/basic.h>
 #include <CGAL/Arr_tags.h>
@@ -51,17 +51,17 @@ namespace CGAL {
                              OutputIterator res2)
     {
       typedef typename CK::Circular_arc_point_2         Point_2;
-      typedef boost::variant<Arc1, Arc2>                X_monotone_curve_2;
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Arc1, Arc2>                X_monotone_curve_2;
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
 
       for (auto it = res1.begin(); it != res1.end(); ++it) {
         if (const Arc1* arc = CGAL::object_cast<Arc1>(&*it)) {
-          boost::variant<Arc1, Arc2> v =  *arc;
+          std::variant<Arc1, Arc2> v =  *arc;
           *res2++ = Make_x_monotone_result(v);
         }
         else if (const Arc2* line = CGAL::object_cast<Arc2>(&*it)) {
-          boost::variant<Arc1, Arc2> v =  *line;
+          std::variant<Arc1, Arc2> v =  *line;
           *res2++ = Make_x_monotone_result(v);
         }
         else if (const Point_2* p = CGAL::object_cast<Point_2>(&*it)) {
@@ -81,27 +81,27 @@ namespace CGAL {
                                                   Circular_arc_point_2;
 
       result_type
-        operator()(const boost::variant< Arc1, Arc2 > &a1,
-                   const boost::variant< Arc1, Arc2 > &a2,
+        operator()(const std::variant< Arc1, Arc2 > &a1,
+                   const std::variant< Arc1, Arc2 > &a2,
                    const Circular_arc_point_2 &p) const
       {
-        if ( const Arc1* arc1 = boost::get<Arc1>( &a1 ) ){
-          if ( const Arc1* arc2 = boost::get<Arc1>( &a2 ) ){
+        if ( const Arc1* arc1 = std::get<Arc1>( &a1 ) ){
+          if ( const Arc1* arc2 = std::get<Arc1>( &a2 ) ){
             return CircularKernel()
               .compare_y_to_right_2_object()(*arc1, *arc2, p);
           }
           else {
-            const Arc2* arc2e = boost::get<Arc2>( &a2 );
+            const Arc2* arc2e = std::get<Arc2>( &a2 );
             return CircularKernel()
               .compare_y_to_right_2_object()(*arc1, *arc2e, p);
           }
         }
-        const Arc2* arc1 = boost::get<Arc2>( &a1 );
-        if ( const Arc1* arc2 = boost::get<Arc1>( &a2 ) ){
+        const Arc2* arc1 = std::get<Arc2>( &a1 );
+        if ( const Arc1* arc2 = std::get<Arc1>( &a2 ) ){
           return CircularKernel()
             .compare_y_to_right_2_object()(*arc1, *arc2, p);
         }
-        const Arc2* arc2e = boost::get<Arc2>( &a2 );
+        const Arc2* arc2e = std::get<Arc2>( &a2 );
         return CircularKernel()
           .compare_y_to_right_2_object()(*arc1, *arc2e, p);
       }
@@ -110,7 +110,6 @@ namespace CGAL {
 
     template <class CircularKernel>
     class Variant_Equal_2
-      : public boost::static_visitor<bool>
     {
     public :
 
@@ -136,7 +135,7 @@ namespace CGAL {
       : public CircularKernel::Equal_2
     {
     public:
-      typedef boost::variant< Arc1, Arc2 >  Curve_2;
+      typedef std::variant< Arc1, Arc2 >  Curve_2;
       typedef bool result_type;
       using CircularKernel::Equal_2::operator();
       typedef typename CircularKernel::Circular_arc_point_2
@@ -169,7 +168,7 @@ namespace CGAL {
       result_type
       operator()(const Curve_2 &a0, const Curve_2 &a1) const
       {
-        return boost::apply_visitor
+        return std::visit
           ( Variant_Equal_2<CircularKernel>(), a0, a1 );
       }
 
@@ -188,20 +187,20 @@ namespace CGAL {
 
       result_type
       operator() (const Circular_arc_point_2 &p,
-                  const boost::variant< Arc1, Arc2 > &A1) const
+                  const std::variant< Arc1, Arc2 > &A1) const
       {
-        if ( const Arc1* arc1 = boost::get<Arc1>( &A1 ) ){
+        if ( const Arc1* arc1 = std::get<Arc1>( &A1 ) ){
           return CircularKernel().compare_y_at_x_2_object()(p, *arc1);
         }
         else {
-          const Arc2* arc2 = boost::get<Arc2>( &A1 );
+          const Arc2* arc2 = std::get<Arc2>( &A1 );
           return CircularKernel().compare_y_at_x_2_object()(p, *arc2);
         }
       }
     };
 
     template <class CircularKernel>
-    class Variant_Do_overlap_2 : public boost::static_visitor<bool>
+    class Variant_Do_overlap_2
     {
     public:
       template < typename T >
@@ -229,10 +228,10 @@ namespace CGAL {
       typedef bool result_type;
 
       result_type
-      operator()(const boost::variant< Arc1, Arc2 > &A0,
-                 const boost::variant< Arc1, Arc2 > &A1) const
+      operator()(const std::variant< Arc1, Arc2 > &A0,
+                 const std::variant< Arc1, Arc2 > &A1) const
       {
-        return boost::apply_visitor
+        return std::visit
           ( Variant_Do_overlap_2<CircularKernel>(), A0, A1 );
       }
     };
@@ -248,10 +247,10 @@ namespace CGAL {
 
       template < class OutputIterator,class Not_X_Monotone >
       OutputIterator
-      operator()(const boost::variant<Arc1, Arc2, Not_X_Monotone> &A,
+      operator()(const std::variant<Arc1, Arc2, Not_X_Monotone> &A,
                  OutputIterator res) const
       {
-        if ( const Arc1* arc1 = boost::get<Arc1>( &A ) ) {
+        if ( const Arc1* arc1 = std::get<Arc1>( &A ) ) {
           std::vector<CGAL::Object> container;
           CircularKernel().
             make_x_monotone_2_object()(*arc1,std::back_inserter(container));
@@ -259,7 +258,7 @@ namespace CGAL {
                                           (container, res);
         }
         else {
-          const Arc2* arc2 = boost::get<Arc2>( &A );
+          const Arc2* arc2 = std::get<Arc2>( &A );
           std::vector<CGAL::Object> container;
           CircularKernel().
             make_x_monotone_2_object()(*arc2,std::back_inserter(container));
@@ -278,23 +277,23 @@ namespace CGAL {
 
       template < class OutputIterator >
         OutputIterator
-        operator()(const boost::variant< Arc1, Arc2 > &c1,
-                   const boost::variant< Arc1, Arc2 > &c2,
+        operator()(const std::variant< Arc1, Arc2 > &c1,
+                   const std::variant< Arc1, Arc2 > &c2,
                    OutputIterator oi) const
       {
-        if ( const Arc1* arc1 = boost::get<Arc1>( &c1 ) ){
-          if ( const Arc1* arc2 = boost::get<Arc1>( &c2 ) ){
+        if ( const Arc1* arc1 = std::get<Arc1>( &c1 ) ){
+          if ( const Arc1* arc2 = std::get<Arc1>( &c2 ) ){
             return CircularKernel().intersect_2_object()(*arc1, *arc2, oi);
           }
-          const Arc2* arc2 = boost::get<Arc2>( &c2 );
+          const Arc2* arc2 = std::get<Arc2>( &c2 );
           return CircularKernel().intersect_2_object()(*arc1, *arc2, oi);
         }
 
-        const Arc2* arc1e = boost::get<Arc2>( &c1 );
-        if ( const Arc1* arc2 = boost::get<Arc1>( &c2 ) ){
+        const Arc2* arc1e = std::get<Arc2>( &c1 );
+        if ( const Arc1* arc2 = std::get<Arc1>( &c2 ) ){
           return CircularKernel().intersect_2_object()(*arc1e, *arc2, oi);
         }
-        const Arc2* arc2 = boost::get<Arc2>( &c2 );
+        const Arc2* arc2 = std::get<Arc2>( &c2 );
         return CircularKernel().intersect_2_object()(*arc1e, *arc2, oi);
       }
 
@@ -309,13 +308,13 @@ namespace CGAL {
                                                 Circular_arc_point_2;
       typedef void result_type;
       result_type
-        operator()(const boost::variant< Arc1, Arc2 > &A,
+        operator()(const std::variant< Arc1, Arc2 > &A,
                    const Circular_arc_point_2 &p,
-                   boost::variant< Arc1, Arc2 > &ca1,
-                   boost::variant< Arc1, Arc2 > &ca2) const
+                   std::variant< Arc1, Arc2 > &ca1,
+                   std::variant< Arc1, Arc2 > &ca2) const
       {
         // TODO : optimize by extracting the references from the variants ?
-        if ( const Arc1* arc1 = boost::get<Arc1>( &A ) ){
+        if ( const Arc1* arc1 = std::get<Arc1>( &A ) ){
           Arc1 carc1;
           Arc1 carc2;
           CircularKernel().split_2_object()(*arc1, p, carc1, carc2);
@@ -325,7 +324,7 @@ namespace CGAL {
 
         }
         else{
-          const Arc2* arc2 = boost::get<Arc2>( &A );
+          const Arc2* arc2 = std::get<Arc2>( &A );
           Arc2 cline1;
           Arc2 cline2;
           CircularKernel().split_2_object()(*arc2, p, cline1, cline2);
@@ -340,7 +339,6 @@ namespace CGAL {
 
      template <class CircularKernel>
     class Variant_Construct_min_vertex_2
-      : public boost::static_visitor
       <const typename CircularKernel::Circular_arc_point_2&>
     {
       typedef typename CircularKernel::Circular_arc_point_2
@@ -372,9 +370,9 @@ namespace CGAL {
 
       //typename boost::remove_reference<qualified_result_type>::type
       result_type
-      operator() (const boost::variant< Arc1, Arc2 > & cv) const
+      operator() (const std::variant< Arc1, Arc2 > & cv) const
       {
-        return boost::apply_visitor
+        return std::visit
           ( Variant_Construct_min_vertex_2<CircularKernel>(), cv );
       }
     };
@@ -385,8 +383,6 @@ namespace CGAL {
 
      template <class CircularKernel>
     class Variant_Construct_max_vertex_2
-       : public boost::static_visitor<const typename
-                                      CircularKernel::Circular_arc_point_2&>
     {
       typedef typename CircularKernel::Circular_arc_point_2
                                                   Circular_arc_point_2;
@@ -422,16 +418,15 @@ namespace CGAL {
 
        //typename boost::remove_reference<qualified_result_type>::type
       result_type
-       operator() (const boost::variant< Arc1, Arc2 > & cv) const
+       operator() (const std::variant< Arc1, Arc2 > & cv) const
       {
-        return boost::apply_visitor
+        return std::visit
           ( Variant_Construct_max_vertex_2<CircularKernel>(), cv );
       }
     };
 
       template <class CircularKernel>
     class Variant_Is_vertical_2
-      : public boost::static_visitor<bool>
     {
     public :
 
@@ -449,9 +444,9 @@ namespace CGAL {
     public:
       typedef bool result_type;
 
-      bool operator() (const boost::variant< Arc1, Arc2 >& cv) const
+      bool operator() (const std::variant< Arc1, Arc2 >& cv) const
       {
-        return boost::apply_visitor
+        return std::visit
           ( Variant_Is_vertical_2<CircularKernel>(), cv );
       }
     };
@@ -499,8 +494,8 @@ namespace CGAL {
 
     typedef internal_Argt_traits::Not_X_Monotone                Not_X_Monotone;
 
-    typedef boost::variant< Arc1, Arc2, Not_X_Monotone >        Curve_2;
-    typedef boost::variant< Arc1, Arc2 >                        X_monotone_curve_2;
+    typedef std::variant< Arc1, Arc2, Not_X_Monotone >        Curve_2;
+    typedef std::variant< Arc1, Arc2 >                        X_monotone_curve_2;
 
   private:
     CircularKernel ck;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
index 8c3e7f6533e5..19b2ade6c275 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
@@ -469,7 +469,7 @@ class Arr_conic_traits_2
     template <typename OutputIterator>
     OutputIterator operator()(const Curve_2& cv, OutputIterator oi) const
     {
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
 
       // Increment the serial number of the curve cv, which will serve as its
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
index 1455a276f6db..f487c0552215 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
@@ -23,7 +23,7 @@
 
 #include <list>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <boost/mpl/has_xxx.hpp>
 
 #include <CGAL/tags.h>
@@ -126,9 +126,9 @@ class Arr_curve_data_traits_2 : public Traits_ {
     template <typename OutputIterator>
     OutputIterator operator()(const Curve_2& cv, OutputIterator oi) const
     {
-      typedef boost::variant<Point_2, Base_x_monotone_curve_2>
+      typedef std::variant<Point_2, Base_x_monotone_curve_2>
         Base_make_x_monotone_result;
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
 
       // Make the original curve x-monotone.
@@ -138,12 +138,12 @@ class Arr_curve_data_traits_2 : public Traits_ {
       // Attach the data to each of the resulting x-monotone curves.
       X_monotone_curve_data xdata = Convert()(cv.data());
       for (const auto& base_obj : base_objects) {
-        if (const auto* bxcv = boost::get<Base_x_monotone_curve_2>(&base_obj)) {
+        if (const auto* bxcv = std::get<Base_x_monotone_curve_2>(&base_obj)) {
           *oi++ = Make_x_monotone_result(X_monotone_curve_2(*bxcv, xdata));
           continue;
         }
         // Current object is an isolated point: Leave it as is.
-        const auto* bp = boost::get<Point_2>(&base_obj);
+        const auto* bp = std::get<Point_2>(&base_obj);
         CGAL_assertion(bp);
         *oi++ = Make_x_monotone_result(*bp);
       }
@@ -208,9 +208,9 @@ class Arr_curve_data_traits_2 : public Traits_ {
                               OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
-      typedef boost::variant<Intersection_point, Base_x_monotone_curve_2>
+      typedef std::variant<Intersection_point, Base_x_monotone_curve_2>
         Intersection_base_result;
 
       // Use the base functor to obtain all intersection objects.
@@ -223,7 +223,7 @@ class Arr_curve_data_traits_2 : public Traits_ {
       // Go over all intersection objects and prepare the output.
       for (const auto& item : base_objects) {
         const Base_x_monotone_curve_2* base_cv =
-          boost::get<Base_x_monotone_curve_2>(&item);
+          std::get<Base_x_monotone_curve_2>(&item);
         if (base_cv != nullptr) {
           // The current intersection object is an overlapping x-monotone
           // curve: Merge the data fields of both intersecting curves and
@@ -234,7 +234,7 @@ class Arr_curve_data_traits_2 : public Traits_ {
         }
         // The current intersection object is an intersection point:
         // Copy it as is.
-        const Intersection_point* ip = boost::get<Intersection_point>(&item);
+        const Intersection_point* ip = std::get<Intersection_point>(&item);
         *oi++ = Intersection_result(*ip);
       }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
index 1468d38bc67e..3d4634ee6652 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
@@ -26,7 +26,7 @@
 
 #include <fstream>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/config.h>
 #include <CGAL/tags.h>
@@ -2062,7 +2062,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      */
     template <typename OutputIterator>
     OutputIterator operator()(const Curve_2& c, OutputIterator oi) const {
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
       // std::cout << "full: " << c.is_full() << std::endl;
       // std::cout << "vert: " << c.is_vertical() << std::endl;
@@ -2320,7 +2320,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
                                         OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
       const Kernel& kernel = m_traits;
       typename Kernel::Equal_2 equal = kernel.equal_2_object();
@@ -2559,7 +2559,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       typedef typename Kernel::Equal_3                  Equal_3;
 
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
 
       const Kernel& kernel = m_traits;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Arr_plane_3.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Arr_plane_3.h
index ba37b21f1870..d966a52b41a0 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Arr_plane_3.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Arr_plane_3.h
@@ -201,7 +201,7 @@ class Arr_plane_3 {
  * intersection or a plane in case plane1 and plane2 coincide.
  */
 template <typname Kernel>
-boost::variant<typename Kernel::Line_3, Arr_plane_3<Kernel> >
+std::variant<typename Kernel::Line_3, Arr_plane_3<Kernel> >
 intersect(const Arr_plane_3<Kernel> & plane1,
                        const Arr_plane_3<Kernel> & plane2)
 {
@@ -209,7 +209,7 @@ intersect(const Arr_plane_3<Kernel> & plane1,
   typedef typename Kernel::Direction_3  Direction_3;
   typedef typename Kernel::Line_3       Line_3;
   typedef typename Kernel::FT           FT;
-  typedef boost::variant<Line_3, Arr_plane_3<Kernel> >  Intersection_result;
+  typedef std::variant<Line_3, Arr_plane_3<Kernel> >  Intersection_result;
 
   // We know that the plane goes through the origin
   const FT& a1 = plane1.a();
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_bounding_rational_traits.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_bounding_rational_traits.h
index e287978f9e30..8b3abe1f57f2 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_bounding_rational_traits.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_bounding_rational_traits.h
@@ -1264,22 +1264,22 @@ class Bezier_bounding_rational_traits
         Control_points  aux_vec;
 
         auto res1 = f_intersect(skew1a, skew2a);
-        const Point_2* p1 = boost::get<Point_2>(&*res1);
+        const Point_2* p1 = std::get<Point_2>(&*res1);
         if (! p1) CGAL_error();
         aux_vec.push_back(*p1);
 
         auto res2 = f_intersect(skew1a, skew2b);
-        const Point_2* p2 = boost::get<Point_2>(&*res2);
+        const Point_2* p2 = std::get<Point_2>(&*res2);
         if (! p2) CGAL_error();
         aux_vec.push_back(*p2);
 
         auto res3 = f_intersect(skew1b, skew2a);
-        const Point_2* p3 = boost::get<Point_2>(&*res3);
+        const Point_2* p3 = std::get<Point_2>(&*res3);
         if (! p3) CGAL_error();
         aux_vec.push_back(*p3);
 
         auto res4 = f_intersect (skew1b, skew2b);
-        const Point_2* p4 = boost::get<Point_2>(&*res4);
+        const Point_2* p4 = std::get<Point_2>(&*res4);
         if (! p4) CGAL_error();
         aux_vec.push_back(*p4);
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_x_monotone_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_x_monotone_2.h
index cf7d00135b0d..12f3f3a7c66d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_x_monotone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_x_monotone_2.h
@@ -318,7 +318,7 @@ class _Bezier_x_monotone_2
                            Bezier_cache& cache,
                            OutputIterator oi) const
   {
-    typedef boost::variant<Intersection_point, Self>    Intersection_result;
+    typedef std::variant<Intersection_point, Self>    Intersection_result;
 
     // In case we have two x-monotone subcurves of the same Bezier curve,
     // check if they have a common left endpoint.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Circle_segment_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Circle_segment_2.h
index c6f11cc8a342..051390155d5b 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Circle_segment_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Circle_segment_2.h
@@ -996,7 +996,7 @@ class _X_monotone_circle_segment_2 {
                            Intersection_map* inter_map = nullptr) const
   {
     typedef std::pair<Point_2, Multiplicity>            Intersection_point;
-    typedef boost::variant<Intersection_point, Self>    Intersection_result;
+    typedef std::variant<Intersection_point, Self>    Intersection_result;
 
     // First check whether the two arcs have the same supporting curve.
     if (has_same_supporting_curve(cv)) {
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_x_monotone_arc_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_x_monotone_arc_2.h
index 7579788a8a43..57352a12ece8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_x_monotone_arc_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Conic_x_monotone_arc_2.h
@@ -21,7 +21,7 @@
 #include <map>
 #include <ostream>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/Arr_geometry_traits/Conic_intersections_2.h>
 
@@ -813,7 +813,7 @@ class _Conic_x_monotone_arc_2 : private Conic_arc_ {
                            Intersection_map& inter_map,
                            OutputIterator oi) const
   {
-    typedef boost::variant<Intersection_point, Self>  Intersection_result;
+    typedef std::variant<Intersection_point, Self>  Intersection_result;
 
     if (_has_same_supporting_conic(arc)) {
       // Check for overlaps between the two arcs.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_line_arc_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_line_arc_traits_2.h
index 20ccbe9c7583..9c0cda934db4 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_line_arc_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_line_arc_traits_2.h
@@ -125,7 +125,7 @@ class Arr_line_arc_traits_2 {
     template <typename OutputIterator>
     OutputIterator operator()(const Curve_2& line, OutputIterator oi) const
     {
-      typedef boost::variant<Point_2, X_monotone_curve_2> Make_x_monotone_result;
+      typedef std::variant<Point_2, X_monotone_curve_2> Make_x_monotone_result;
       *oi++ = Make_x_monotone_result(line);
       return oi;
     }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h
index b2354fe98950..079f5534e832 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h
@@ -26,7 +26,7 @@
 
 #include <fstream>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/tags.h>
 #include <CGAL/intersections.h>
@@ -1249,7 +1249,7 @@ class Arr_linear_traits_2 : public Kernel_ {
     OutputIterator operator()(const Curve_2& cv, OutputIterator oi) const
     {
       // Wrap the segment with a variant.
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
       *oi++ = Make_x_monotone_result(cv);
       return oi;
@@ -1326,7 +1326,7 @@ class Arr_linear_traits_2 : public Kernel_ {
                               OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
 
       CGAL_precondition(! cv1.is_degenerate());
@@ -1340,7 +1340,7 @@ class Arr_linear_traits_2 : public Kernel_ {
       if (! res) return oi;
 
       // Check whether we have a single intersection point.
-      const Point_2* ip = boost::get<Point_2>(&*res);
+      const Point_2* ip = std::get<Point_2>(&*res);
       if (ip != nullptr) {
         // Check whether the intersection point ip lies on both segments.
         const bool ip_on_cv1 = cv1.is_vertical() ?
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h
index 42d0457c32b9..636d669eb36f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h
@@ -27,7 +27,7 @@
  * functors required by the concept it models.
  */
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 #include <CGAL/tags.h>
@@ -131,7 +131,7 @@ class Arr_non_caching_segment_traits_2 :
     OutputIterator operator()(const Curve_2& cv, OutputIterator oi) const
     {
       // Wrap the segment with a variant.
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
       *oi++ = Make_x_monotone_result(cv);
       return oi;
@@ -224,7 +224,7 @@ class Arr_non_caching_segment_traits_2 :
                               OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
 
       const Kernel& kernel = m_traits;
@@ -234,7 +234,7 @@ class Arr_non_caching_segment_traits_2 :
       if (! res) return oi;
 
       // Check if the intersection is a point:
-      const Point_2* p_p = boost::get<Point_2>(&*res);
+      const Point_2* p_p = std::get<Point_2>(&*res);
       if (p_p != nullptr) {
         // Create a pair representing the point with its multiplicity,
         // which is always 1 for line segments for all practical purposes.
@@ -246,7 +246,7 @@ class Arr_non_caching_segment_traits_2 :
       }
 
       // The intersection is a segment.
-      const X_monotone_curve_2* cv_p = boost::get<X_monotone_curve_2>(&*res);
+      const X_monotone_curve_2* cv_p = std::get<X_monotone_curve_2>(&*res);
       CGAL_assertion(cv_p != nullptr);
 
       Comparison_result cmp1 = m_traits.compare_endpoints_xy_2_object()(cv1);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_nearest_neighbor.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_nearest_neighbor.h
index e7c4a5b1dd52..61fe87106b54 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_nearest_neighbor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_nearest_neighbor.h
@@ -26,7 +26,7 @@
 #include <CGAL/Arr_point_location_result.h>
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <optional>
 
 namespace CGAL {
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_trapezoid_ric_pl_impl.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_trapezoid_ric_pl_impl.h
index 8f28269f1998..a52086ce117f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_trapezoid_ric_pl_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_trapezoid_ric_pl_impl.h
@@ -75,7 +75,7 @@ Arr_trapezoid_ric_point_location<Arrangement_2>::locate(const Point_2& p) const
   case TD::POINT:
     {
       //p is interior so it should fall on Td_active_vertex
-      Td_active_vertex& v (boost::get<Td_active_vertex>(tr));
+      Td_active_vertex& v (std::get<Td_active_vertex>(tr));
       CGAL_TRAP_PRINT_DEBUG("POINT");
       CGAL_assertion(!v.vertex()->is_at_open_boundary());
       return make_result(v.vertex());
@@ -84,7 +84,7 @@ Arr_trapezoid_ric_point_location<Arrangement_2>::locate(const Point_2& p) const
 
   case TD::CURVE:
     {
-      Td_active_edge& e (boost::get<Td_active_edge>(tr));
+      Td_active_edge& e (std::get<Td_active_edge>(tr));
       Halfedge_const_handle h = e.halfedge();
       CGAL_TRAP_PRINT_DEBUG("CURVE");
       if ( m_traits->is_in_x_range_2_object()(h->curve(),p) &&
@@ -100,7 +100,7 @@ Arr_trapezoid_ric_point_location<Arrangement_2>::locate(const Point_2& p) const
 
   case TD::TRAPEZOID:
     {
-      Td_active_trapezoid t (boost::get<Td_active_trapezoid>(tr));
+      Td_active_trapezoid t (std::get<Td_active_trapezoid>(tr));
       Halfedge_const_handle h = t.top();
       CGAL_TRAP_PRINT_DEBUG("TRAPEZOID");
       bool is_p_above_h = (m_traits->is_in_x_range_2_object()(h->curve(),p))
@@ -160,7 +160,7 @@ Arr_trapezoid_ric_point_location<Arrangement>::
 _get_unbounded_face(const Td_map_item& item,const Point_2& p,
                     Arr_not_all_sides_oblivious_tag) const
 {
-  Td_active_trapezoid tr (boost::get<Td_active_trapezoid>(item));
+  Td_active_trapezoid tr (std::get<Td_active_trapezoid>(item));
   // Halfedge_const_handle h = tr.top();
   if (!tr.is_on_top_boundary() || !tr.is_on_bottom_boundary()) {
     //if one of top or bottom edges is defined
@@ -184,13 +184,13 @@ _get_unbounded_face(const Td_map_item& item,const Point_2& p,
     Td_map_item& left_v_item = td.locate(tr.left(),td_lt);
     CGAL_assertion(td_lt == TD::POINT);
     Halfedge_const_handle he;
-    if (boost::get<Td_active_vertex>(&left_v_item) != nullptr) {
-      Td_active_vertex v(boost::get<Td_active_vertex>(left_v_item));
+    if (std::get<Td_active_vertex>(&left_v_item) != nullptr) {
+      Td_active_vertex v(std::get<Td_active_vertex>(left_v_item));
       he = v.cw_he();
     }
     else {
       Td_active_fictitious_vertex
-        v(boost::get<Td_active_fictitious_vertex>(left_v_item));
+        v(std::get<Td_active_fictitious_vertex>(left_v_item));
       he = v.cw_he();
     }
     //cw_he() holds the "smallest" curve clockwise starting from 12 o'clock
@@ -216,13 +216,13 @@ _get_unbounded_face(const Td_map_item& item,const Point_2& p,
     Td_map_item& right_v_item = td.locate(tr.right(),td_lt);
     CGAL_assertion(td_lt == TD::POINT);
     Halfedge_const_handle he;
-    if (boost::get<Td_active_vertex>(&right_v_item)!= nullptr) {
-      Td_active_vertex v(boost::get<Td_active_vertex>(right_v_item));
+    if (std::get<Td_active_vertex>(&right_v_item)!= nullptr) {
+      Td_active_vertex v(std::get<Td_active_vertex>(right_v_item));
       he = v.cw_he();
     }
     else {
       Td_active_fictitious_vertex
-        v(boost::get<Td_active_fictitious_vertex>(right_v_item));
+        v(std::get<Td_active_fictitious_vertex>(right_v_item));
       he = v.cw_he();
     }
     //its cw_he() holds the "smallest" curve clockwise starting from
@@ -270,13 +270,13 @@ _vertical_ray_shoot(const Point_2& p, bool shoot_up) const
   case TD::POINT:
     {
       //p fell on Td_active_vertex
-      Td_active_vertex& v (boost::get<Td_active_vertex>(item));
+      Td_active_vertex& v (std::get<Td_active_vertex>(item));
       return (make_result(v.vertex()));
     }
     break;
  case TD::CURVE:
     {
-      Td_active_edge& e (boost::get<Td_active_edge>(item));
+      Td_active_edge& e (std::get<Td_active_edge>(item));
       Halfedge_const_handle h = e.halfedge();
 
       if ((shoot_up && h->direction() == ARR_LEFT_TO_RIGHT) ||
@@ -289,7 +289,7 @@ _vertical_ray_shoot(const Point_2& p, bool shoot_up) const
     break;
   case TD::TRAPEZOID:
     {
-      Td_active_trapezoid trpz (boost::get<Td_active_trapezoid>(item));
+      Td_active_trapezoid trpz (std::get<Td_active_trapezoid>(item));
       Halfedge_const_handle h = (shoot_up) ? trpz.top() : trpz.bottom();
 
       bool is_p_above_h = (m_traits->is_in_x_range_2_object()(h->curve(),p))
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_X_trapezoid.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_X_trapezoid.h
index 169864e1de1e..9904b1705420 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_X_trapezoid.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_X_trapezoid.h
@@ -22,7 +22,7 @@
  */
 
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2.h>
-#include <boost/variant.hpp>
+#include <variant>
 #include <memory>
 
 
@@ -92,9 +92,9 @@ class Td_X_trapezoid : public Handle
   //  type flag + on boundaries flags,
   //  left-bottom neighbor trapezoid, left-top neighbor trapezoid,
   //  right-bottom neighbor trapezoid, right-top neighbor trapezoid
-  typedef Td_ninetuple<boost::variant<Vertex_const_handle,Point>,
-                       boost::variant<Vertex_const_handle,unsigned char>,
-                       boost::variant<Halfedge_const_handle,
+  typedef Td_ninetuple<std::variant<Vertex_const_handle,Point>,
+                       std::variant<Vertex_const_handle,unsigned char>,
+                       std::variant<Halfedge_const_handle,
                                       std::shared_ptr<X_monotone_curve_2> >,
                        Halfedge_const_handle,
                        unsigned char,
@@ -239,7 +239,7 @@ class Td_X_trapezoid : public Handle
 
     Curve_end v_ce(left()->curve_end());
     ptr()->e2 = (std::shared_ptr<X_monotone_curve_2>)(new X_monotone_curve_2(v_ce.cv()));
-    //CGAL_assertion(boost::get<std::shared_ptr<X_monotone_curve_2>>( &(ptr()->e2)) != nullptr);
+    //CGAL_assertion(std::get<std::shared_ptr<X_monotone_curve_2>>( &(ptr()->e2)) != nullptr);
 
     ptr()->e1 = (v_ce.ce() == ARR_MIN_END ) ? CGAL_TD_CV_MIN_END : CGAL_TD_CV_MAX_END;
 
@@ -443,8 +443,8 @@ class Td_X_trapezoid : public Handle
   CGAL_TD_INLINE Vertex_const_handle left_unsafe() const
     {
     CGAL_precondition(is_active());
-    CGAL_assertion(boost::get<Vertex_const_handle>(&(ptr()->e0)) != nullptr);
-    return boost::get<Vertex_const_handle>(ptr()->e0);
+    CGAL_assertion(std::get<Vertex_const_handle>(&(ptr()->e0)) != nullptr);
+    return std::get<Vertex_const_handle>(ptr()->e0);
     }
 
   /*! Access trapezoid left.
@@ -466,8 +466,8 @@ class Td_X_trapezoid : public Handle
   CGAL_TD_INLINE Vertex_const_handle right_unsafe() const
     {
     CGAL_precondition(is_active());
-    CGAL_assertion(boost::get<Vertex_const_handle>(&(ptr()->e1)) != nullptr);
-    return boost::get<Vertex_const_handle>(ptr()->e1);
+    CGAL_assertion(std::get<Vertex_const_handle>(&(ptr()->e1)) != nullptr);
+    return std::get<Vertex_const_handle>(ptr()->e1);
     }
 
   /*! Access trapezoid right.
@@ -489,8 +489,8 @@ class Td_X_trapezoid : public Handle
   CGAL_TD_INLINE Halfedge_const_handle bottom_unsafe () const
   {
     CGAL_precondition(is_active());
-    CGAL_assertion(boost::get<Halfedge_const_handle>(&(ptr()->e2)) != nullptr);
-    return boost::get<Halfedge_const_handle>(ptr()->e2);
+    CGAL_assertion(std::get<Halfedge_const_handle>(&(ptr()->e2)) != nullptr);
+    return std::get<Halfedge_const_handle>(ptr()->e2);
     }
 
   /*! Access trapezoid bottom.
@@ -526,8 +526,8 @@ class Td_X_trapezoid : public Handle
     CGAL_precondition(type() == TD_VERTEX);
     CGAL_precondition(!is_on_boundaries());
 
-    CGAL_assertion(boost::get<Point>( &(ptr()->e0)) != nullptr);
-    return boost::get<Point>( ptr()->e0 );
+    CGAL_assertion(std::get<Point>( &(ptr()->e0)) != nullptr);
+    return std::get<Point>( ptr()->e0 );
     }
 
   CGAL_TD_INLINE std::pair<X_monotone_curve_2*,Arr_curve_end> curve_end_pair_for_boundary_rem_vtx() const
@@ -536,13 +536,13 @@ class Td_X_trapezoid : public Handle
     CGAL_precondition(type() == TD_VERTEX);
     CGAL_precondition(is_on_boundaries());
 
-    CGAL_assertion(boost::get<unsigned char>( &(ptr()->e1)) != nullptr);
-    CGAL_assertion(boost::get<std::shared_ptr<X_monotone_curve_2> >(&(ptr()->e2)) != nullptr);
-    X_monotone_curve_2* cv_ptr = (boost::get<std::shared_ptr<X_monotone_curve_2> >(ptr()->e2)).get();
+    CGAL_assertion(std::get<unsigned char>( &(ptr()->e1)) != nullptr);
+    CGAL_assertion(std::get<std::shared_ptr<X_monotone_curve_2> >(&(ptr()->e2)) != nullptr);
+    X_monotone_curve_2* cv_ptr = (std::get<std::shared_ptr<X_monotone_curve_2> >(ptr()->e2)).get();
     CGAL_assertion(cv_ptr != nullptr);
 
     Arr_curve_end ce =
-      (boost::get<unsigned char>(ptr()->e1) == CGAL_TD_CV_MIN_END) ?
+      (std::get<unsigned char>(ptr()->e1) == CGAL_TD_CV_MIN_END) ?
         ARR_MIN_END : ARR_MAX_END;
 
     return std::make_pair(cv_ptr, ce);
@@ -554,13 +554,13 @@ class Td_X_trapezoid : public Handle
     CGAL_precondition(type() == TD_VERTEX);
     CGAL_precondition(is_on_boundaries());
 
-    CGAL_assertion(boost::get<unsigned char>( &(ptr()->e1)) != nullptr);
-    CGAL_assertion(boost::get<std::shared_ptr<X_monotone_curve_2> >(&(ptr()->e2)) != nullptr);
-    X_monotone_curve_2* cv_ptr = (boost::get<std::shared_ptr<X_monotone_curve_2> >(ptr()->e2)).get();
+    CGAL_assertion(std::get<unsigned char>( &(ptr()->e1)) != nullptr);
+    CGAL_assertion(std::get<std::shared_ptr<X_monotone_curve_2> >(&(ptr()->e2)) != nullptr);
+    X_monotone_curve_2* cv_ptr = (std::get<std::shared_ptr<X_monotone_curve_2> >(ptr()->e2)).get();
     CGAL_assertion(cv_ptr != nullptr);
 
     Arr_curve_end ce =
-      (boost::get<unsigned char>(ptr()->e1) == CGAL_TD_CV_MIN_END) ?
+      (std::get<unsigned char>(ptr()->e1) == CGAL_TD_CV_MIN_END) ?
         ARR_MIN_END : ARR_MAX_END;
 
     return Curve_end(*cv_ptr, ce);
@@ -571,13 +571,13 @@ class Td_X_trapezoid : public Handle
     CGAL_precondition(!is_active());
     CGAL_precondition(type() == TD_VERTEX);
 
-    CGAL_assertion(boost::get<unsigned char>( &(ptr()->e1)) != nullptr);
-    CGAL_assertion(boost::get<std::shared_ptr<X_monotone_curve_2> >(&(ptr()->e2)) != nullptr);
-    X_monotone_curve_2* cv_ptr = (boost::get<std::shared_ptr<X_monotone_curve_2> >(ptr()->e2)).get();
+    CGAL_assertion(std::get<unsigned char>( &(ptr()->e1)) != nullptr);
+    CGAL_assertion(std::get<std::shared_ptr<X_monotone_curve_2> >(&(ptr()->e2)) != nullptr);
+    X_monotone_curve_2* cv_ptr = (std::get<std::shared_ptr<X_monotone_curve_2> >(ptr()->e2)).get();
     CGAL_assertion(cv_ptr != nullptr);
 
     Arr_curve_end ce =
-      (boost::get<unsigned char>(ptr()->e1) == CGAL_TD_CV_MIN_END) ?
+      (std::get<unsigned char>(ptr()->e1) == CGAL_TD_CV_MIN_END) ?
         ARR_MIN_END : ARR_MAX_END;
 
     return Curve_end(*cv_ptr, ce);
@@ -587,8 +587,8 @@ class Td_X_trapezoid : public Handle
   {
     CGAL_precondition(!is_active() && type() == TD_EDGE);
 
-    CGAL_assertion(boost::get<std::shared_ptr<X_monotone_curve_2> >(&(ptr()->e2)) != nullptr);
-    X_monotone_curve_2* cv_ptr = (boost::get<std::shared_ptr<X_monotone_curve_2> >(ptr()->e2)).get();
+    CGAL_assertion(std::get<std::shared_ptr<X_monotone_curve_2> >(&(ptr()->e2)) != nullptr);
+    X_monotone_curve_2* cv_ptr = (std::get<std::shared_ptr<X_monotone_curve_2> >(ptr()->e2)).get();
     CGAL_assertion(cv_ptr != nullptr);
     return *cv_ptr;
   }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
index eb161a353c52..b026673d4a6b 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
@@ -21,7 +21,7 @@
  */
 
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2.h>
-#include <boost/variant.hpp>
+#include <variant>
 #include <memory>
 
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_fictitious_vertex.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_fictitious_vertex.h
index 06e13b29c241..f709a463bc11 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_fictitious_vertex.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_fictitious_vertex.h
@@ -21,7 +21,7 @@
  */
 
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2.h>
-#include <boost/variant.hpp>
+#include <variant>
 #include <memory>
 
 #ifdef CGAL_TD_DEBUG
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
index 2872d2563109..44834852a2b4 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
@@ -23,7 +23,7 @@
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2.h>
 #include <CGAL/tuple.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <optional>
 
 
@@ -461,12 +461,12 @@ class Td_active_trapezoid : public Handle
 
     if (ptr()->rb.which() != 0)
     {
-      Self tr(boost::get<Self>(rb()));
+      Self tr(std::get<Self>(rb()));
       tr.set_lb(item);
     }
     if (ptr()->rt.which() != 0)
     {
-      Self tr(boost::get<Self>(rt()));
+      Self tr(std::get<Self>(rt()));
       tr.set_lt(item);
     }
     CGAL_assertion(is_on_right_boundary() == right.is_on_right_boundary());
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_vertex.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_vertex.h
index 514686d303d1..23cbc480c9ba 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_vertex.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_vertex.h
@@ -21,7 +21,7 @@
  */
 
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2.h>
-#include <boost/variant.hpp>
+#include <variant>
 #include <memory>
 
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_dag_node.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_dag_node.h
index 72fd48526c87..340bb0b6d7a2 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_dag_node.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_dag_node.h
@@ -28,7 +28,7 @@
 #include <list>
 #include <functional>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 
@@ -112,7 +112,7 @@ class Td_dag_node : public Td_dag_node_base<Traits>
 
   public:
 
-    class clear_neighbors_visitor : public boost::static_visitor< void  >
+    class clear_neighbors_visitor
     {
     public:
       void operator()(Td_active_trapezoid& t) const
@@ -142,7 +142,7 @@ class Td_dag_node : public Td_dag_node_base<Traits>
     //d'tor
     ~Node()
     {
-      boost::apply_visitor(clear_neighbors_visitor(), m_data);
+      std::visit(clear_neighbors_visitor(), m_data);
     }
 
     bool is_inner_node() const //MICHAL: a node with only left child (like removed node) will be considered as a leaf
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_edge.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_edge.h
index 55c8e5a457b7..97de5cae60a4 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_edge.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_edge.h
@@ -21,7 +21,7 @@
  */
 
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2.h>
-#include <boost/variant.hpp>
+#include <variant>
 #include <memory>
 
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_fictitious_vertex.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_fictitious_vertex.h
index db3019d46b7c..eea96c8327fc 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_fictitious_vertex.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_fictitious_vertex.h
@@ -21,7 +21,7 @@
  */
 
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2.h>
-#include <boost/variant.hpp>
+#include <variant>
 
 
 #ifdef CGAL_TD_DEBUG
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_trapezoid.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_trapezoid.h
index 908be87c0789..312d7d8c5062 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_trapezoid.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_trapezoid.h
@@ -21,7 +21,7 @@
  */
 
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2.h>
-#include <boost/variant.hpp>
+#include <variant>
 
 
 #ifdef CGAL_TD_DEBUG
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_vertex.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_vertex.h
index e9cad94daf81..766401446041 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_vertex.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_inactive_vertex.h
@@ -21,7 +21,7 @@
  */
 
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2.h>
-#include <boost/variant.hpp>
+#include <variant>
 
 
 #ifdef CGAL_TD_DEBUG
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_traits.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_traits.h
index 45ba665a1d5a..59a3dd7f6b6d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_traits.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_traits.h
@@ -113,7 +113,7 @@ class Td_traits : public Pm_traits_
                                           Td_inactive_fictitious_vertex;
 
   //! type of td map item (Td_halfedge, Td_vertex or Td_trapezoid)
-  typedef boost::variant< Td_nothing,
+  typedef std::variant< Td_nothing,
                           Td_active_trapezoid, Td_inactive_trapezoid,
                           Td_active_edge, Td_inactive_edge,
                           Td_active_vertex, Td_active_fictitious_vertex,
@@ -895,8 +895,8 @@ class Td_traits : public Pm_traits_
     CGAL_precondition(is_active(left_item) && is_active(right_item));
     CGAL_precondition(is_td_trapezoid(left_item) && is_td_trapezoid(right_item));
 
-    Td_active_trapezoid left (boost::get<Td_active_trapezoid>(left_item));
-    Td_active_trapezoid right(boost::get<Td_active_trapezoid>(right_item));
+    Td_active_trapezoid left (std::get<Td_active_trapezoid>(left_item));
+    Td_active_trapezoid right(std::get<Td_active_trapezoid>(right_item));
 
     if (left.is_on_bottom_boundary())
       return (right.is_on_bottom_boundary());
@@ -915,8 +915,8 @@ class Td_traits : public Pm_traits_
     CGAL_precondition(is_active(left_item) && is_active(right_item));
     CGAL_precondition(is_td_trapezoid(left_item) && is_td_trapezoid(right_item));
 
-    Td_active_trapezoid left (boost::get<Td_active_trapezoid>(left_item));
-    Td_active_trapezoid right(boost::get<Td_active_trapezoid>(right_item));
+    Td_active_trapezoid left (std::get<Td_active_trapezoid>(left_item));
+    Td_active_trapezoid right(std::get<Td_active_trapezoid>(right_item));
 
     if (left.is_on_top_boundary())
       return (right.is_on_top_boundary());
@@ -1049,7 +1049,7 @@ class Td_traits : public Pm_traits_
     CGAL_precondition(is_active(item));
     //MICHAL: assumes item is of active edge item - also fails in case of a vertical asymptote
     //MICHAL: check when this is used exactly
-    Td_active_edge& e (boost::get<Td_active_edge>(item));
+    Td_active_edge& e (std::get<Td_active_edge>(item));
     Halfedge_const_handle he = e.halfedge();
     return (this->compare_curve_end_x_2_object()
                (Curve_end(he,ARR_MIN_END), Curve_end(he,ARR_MAX_END))== EQUAL);
@@ -1061,7 +1061,7 @@ class Td_traits : public Pm_traits_
   {
     CGAL_precondition( is_active(item) );
     CGAL_precondition( is_td_trapezoid(item) );
-    Td_active_trapezoid tr (boost::get<Td_active_trapezoid>(item));
+    Td_active_trapezoid tr (std::get<Td_active_trapezoid>(item));
 
     return
       ( tr.is_on_left_boundary() ||
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
index 7b3b224a2239..be7d7ac72b3c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
@@ -26,7 +26,7 @@
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2_misc.h>
 
 #include <optional>
-#include <boost/variant.hpp>
+#include <variant>
 #include <memory>
 
 #include <cstdlib>
@@ -93,16 +93,16 @@ struct Non_recursive_td_map_item_destructor
 
     void operator()(Td_active_trapezoid& item)
     {
-      boost::apply_visitor(m_child_visitor, item.lb());
-      boost::apply_visitor(m_child_visitor, item.lt());
-      boost::apply_visitor(m_child_visitor, item.rb());
-      boost::apply_visitor(m_child_visitor, item.rt());
+      std::visit(m_child_visitor, item.lb());
+      std::visit(m_child_visitor, item.lt());
+      std::visit(m_child_visitor, item.rb());
+      std::visit(m_child_visitor, item.rt());
       item.clear_neighbors();
     }
 
     void operator()(Td_active_edge& item)
     {
-      boost::apply_visitor(m_child_visitor, item.next());
+      std::visit(m_child_visitor, item.next());
       item.set_next(Td_map_item(0));
     }
 
@@ -124,7 +124,7 @@ struct Non_recursive_td_map_item_destructor
     {
       Td_map_item item = queue.back();
       queue.pop_back();
-      boost::apply_visitor(item_visitor, item);
+      std::visit(item_visitor, item);
     }
   }
 
@@ -138,7 +138,7 @@ struct Non_recursive_td_map_item_destructor
     {
       Td_map_item item = queue.back();
       queue.pop_back();
-      boost::apply_visitor(item_visitor, item);
+      std::visit(item_visitor, item);
     }
   }
 };
@@ -384,7 +384,7 @@ class Trapezoidal_decomposition_2
       if (traits->is_td_trapezoid(m_cur_item))
       {
         //if the map item is a trapezoid
-        Td_active_trapezoid tr (boost::get<Td_active_trapezoid>(m_cur_item));
+        Td_active_trapezoid tr (std::get<Td_active_trapezoid>(m_cur_item));
 
 #ifndef CGAL_TD_DEBUG
         CGAL_warning_code(Dag_node* tt = tr.dag_node();)
@@ -436,7 +436,7 @@ class Trapezoidal_decomposition_2
       {
         //if the map item is an edge
 
-        Td_active_edge e (boost::get<Td_active_edge>(m_cur_item));
+        Td_active_edge e (std::get<Td_active_edge>(m_cur_item));
         CGAL_assertion_code(Dag_node* tt = e.dag_node();)
         CGAL_assertion(tt != nullptr);
         CGAL_assertion(tt->is_inner_node());
@@ -453,7 +453,7 @@ class Trapezoidal_decomposition_2
           while(traits->is_td_vertex(m_cur_item))
           {
             Dag_node* node =
-              boost::apply_visitor(dag_node_visitor(),m_cur_item);
+              std::visit(dag_node_visitor(),m_cur_item);
             m_cur_item = node->left_child().get_data();
           }
 
@@ -481,7 +481,7 @@ class Trapezoidal_decomposition_2
       CGAL_precondition (!traits->is_empty_item(m_cur_item));
       CGAL_precondition (traits->is_active(m_cur_item) &&
                          traits->is_td_trapezoid(m_cur_item));
-      return boost::get<Td_active_trapezoid>(m_cur_item);
+      return std::get<Td_active_trapezoid>(m_cur_item);
     }
 
     Td_active_edge& e()
@@ -489,13 +489,13 @@ class Trapezoidal_decomposition_2
       CGAL_precondition (!traits->is_empty_item(m_cur_item));
       CGAL_precondition (traits->is_active(m_cur_item) &&
                          traits->is_td_edge(m_cur_item));
-      return boost::get<Td_active_edge>(m_cur_item);
+      return std::get<Td_active_edge>(m_cur_item);
     }
 
   };
 
   /*!  Visitors for accessing td map items methods */
-  class rb_visitor : public boost::static_visitor<Td_map_item>
+  class rb_visitor
   {
   public:
     Td_map_item operator()(Td_active_trapezoid& t) const
@@ -511,7 +511,7 @@ class Trapezoidal_decomposition_2
     }
   };
 
-  class set_rb_visitor : public boost::static_visitor<void>
+  class set_rb_visitor
   {
   public:
     set_rb_visitor (const Td_map_item& rb) : m_rb(rb) {}
@@ -532,7 +532,7 @@ class Trapezoidal_decomposition_2
     const Td_map_item& m_rb;
   };
 
-  class rt_visitor : public boost::static_visitor<Td_map_item>
+  class rt_visitor
   {
   public:
     Td_map_item operator()(Td_active_trapezoid& t) const
@@ -548,7 +548,7 @@ class Trapezoidal_decomposition_2
     }
   };
 
-  class set_rt_visitor : public boost::static_visitor<void>
+  class set_rt_visitor
   {
   public:
     set_rt_visitor (const Td_map_item& rt) : m_rt(rt) {}
@@ -568,7 +568,7 @@ class Trapezoidal_decomposition_2
     const Td_map_item& m_rt;
   };
 
-  class lb_visitor : public boost::static_visitor<Td_map_item>
+  class lb_visitor
   {
   public:
     Td_map_item operator()(Td_active_trapezoid& t) const
@@ -584,7 +584,7 @@ class Trapezoidal_decomposition_2
     }
   };
 
-  class set_lb_visitor : public boost::static_visitor<void>
+  class set_lb_visitor
   {
   public:
     set_lb_visitor (const Td_map_item& lb) : m_lb(lb) {}
@@ -604,7 +604,7 @@ class Trapezoidal_decomposition_2
     const Td_map_item& m_lb;
   };
 
-  class set_lt_visitor : public boost::static_visitor<void>
+  class set_lt_visitor
   {
   public:
     set_lt_visitor (const Td_map_item& lt) : m_lt(lt) {}
@@ -624,7 +624,7 @@ class Trapezoidal_decomposition_2
     const Td_map_item& m_lt;
   };
 
-  class bottom_he_visitor : public boost::static_visitor<Halfedge_const_handle>
+  class bottom_he_visitor
   {
   public:
     Halfedge_const_handle operator()(Td_active_trapezoid& t) const
@@ -640,7 +640,7 @@ class Trapezoidal_decomposition_2
     }
   };
 
-  class set_bottom_he_visitor : public boost::static_visitor< void  >
+  class set_bottom_he_visitor
   {
   public:
     set_bottom_he_visitor (Halfedge_const_handle he) : m_bottom_he(he) {}
@@ -659,7 +659,7 @@ class Trapezoidal_decomposition_2
     Halfedge_const_handle m_bottom_he;
   };
 
-  class top_he_visitor : public boost::static_visitor<Halfedge_const_handle>
+  class top_he_visitor
   {
   public:
      Halfedge_const_handle operator()(Td_active_trapezoid& t) const
@@ -675,7 +675,7 @@ class Trapezoidal_decomposition_2
     }
   };
 
-  class set_top_he_visitor : public boost::static_visitor<void>
+  class set_top_he_visitor
   {
   public:
     set_top_he_visitor (Halfedge_const_handle he) : m_top_he(he) {}
@@ -694,7 +694,7 @@ class Trapezoidal_decomposition_2
     Halfedge_const_handle m_top_he;
   };
 
-  class cw_he_visitor : public boost::static_visitor< Halfedge_const_handle  >
+  class cw_he_visitor
   {
   public:
     Halfedge_const_handle operator()(Td_active_vertex& t) const
@@ -716,7 +716,7 @@ class Trapezoidal_decomposition_2
 
   /*! A visitor to set the cw halfedge of a vertex node.
    */
-  class set_cw_he_visitor : public boost::static_visitor<void> {
+  class set_cw_he_visitor
   public:
     set_cw_he_visitor(Halfedge_const_handle he) : m_cw_he(he) {}
 
@@ -734,7 +734,7 @@ class Trapezoidal_decomposition_2
 
   /*! A visitor to reset the cw halfedge of a vertex node.
    */
-  class reset_cw_he_visitor : public boost::static_visitor<void> {
+  class reset_cw_he_visitor
   public:
     void operator()(Td_active_vertex& t) const { t.reset_cw_he(); }
 
@@ -744,7 +744,7 @@ class Trapezoidal_decomposition_2
     void operator()(T& /*t*/) const { CGAL_assertion(false); }
   };
 
-  class dag_node_visitor : public boost::static_visitor<Dag_node*>
+  class dag_node_visitor
   {
   public:
     Dag_node* operator()(Td_nothing& /* t */) const
@@ -765,7 +765,7 @@ class Trapezoidal_decomposition_2
     }
   };
 
-  class set_dag_node_visitor : public boost::static_visitor<void>
+  class set_dag_node_visitor
   {
   public:
     set_dag_node_visitor(Dag_node* node):m_node(node) {}
@@ -789,8 +789,7 @@ class Trapezoidal_decomposition_2
     Dag_node* m_node;
   };
 
-  class curve_end_for_fict_vertex_visitor :
-    public boost::static_visitor<std::optional<Curve_end> >
+  class curve_end_for_fict_vertex_visitor
   {
   public:
     std::optional<Curve_end> operator()(Td_active_fictitious_vertex& t) const
@@ -812,7 +811,7 @@ class Trapezoidal_decomposition_2
     }
   };
 
-  class point_for_vertex_visitor : public boost::static_visitor< Point  >
+  class point_for_vertex_visitor
   {
   public:
     Point operator()(Td_active_vertex& t) const
@@ -833,8 +832,7 @@ class Trapezoidal_decomposition_2
     }
   };
 
-  class curve_end_for_active_vertex_visitor :
-    public boost::static_visitor<std::optional<Curve_end> >
+  class curve_end_for_active_vertex_visitor
   {
     public:
     std::optional<Curve_end> operator()(Td_active_vertex& t) const
@@ -855,8 +853,7 @@ class Trapezoidal_decomposition_2
     }
   };
 
-  class vertex_for_active_vertex_visitor :
-    public boost::static_visitor<Vertex_const_handle>
+  class vertex_for_active_vertex_visitor
   {
     public:
     Vertex_const_handle operator()(Td_active_vertex& t) const
@@ -877,8 +874,7 @@ class Trapezoidal_decomposition_2
     }
   };
 
-  class cv_for_edge_visitor :
-    public boost::static_visitor<std::optional<const X_monotone_curve_2&> >
+  class cv_for_edge_visitor
   {
   public:
     std::optional<const X_monotone_curve_2&>
@@ -998,11 +994,11 @@ class Trapezoidal_decomposition_2
     bool is_fict_vtx = traits->is_fictitious_vertex(vtx_item);
     if (is_fict_vtx) {
       return (compare(t,
-                      *(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),
+                      *(std::visit(curve_end_for_fict_vertex_visitor(),
                                              vtx_item))) == SMALLER);
     }
     else {
-      return (compare(t, boost::apply_visitor(point_for_vertex_visitor(),
+      return (compare(t, std::visit(point_for_vertex_visitor(),
                                               vtx_item)) == SMALLER);
     }
   }
@@ -1039,12 +1035,12 @@ class Trapezoidal_decomposition_2
     bool is_fict_vtx = traits->is_fictitious_vertex(vtx_item);
     if (is_fict_vtx) {
       return (compare(t,
-                 *(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),
+                 *(std::visit(curve_end_for_fict_vertex_visitor(),
                                         vtx_item)))  == LARGER);
     }
     else {
       return (compare(t,
-                  boost::apply_visitor(point_for_vertex_visitor(),
+                  std::visit(point_for_vertex_visitor(),
                                        vtx_item)) == LARGER);
     }
   }
@@ -1058,12 +1054,12 @@ class Trapezoidal_decomposition_2
     bool is_fict_vtx = traits->is_fictitious_vertex(vtx_item);
     if (is_fict_vtx) {
       return equal(t,
-                   *(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),
+                   *(std::visit(curve_end_for_fict_vertex_visitor(),
                                           vtx_item)));
     }
     else {
       return equal(t,
-                   boost::apply_visitor(point_for_vertex_visitor(),
+                   std::visit(point_for_vertex_visitor(),
                                         vtx_item));
     }
   }
@@ -1090,24 +1086,24 @@ class Trapezoidal_decomposition_2
     //if ( traits->is_fictitious_vertex(item) )
     //{
     //  CGAL_precondition(traits->equal_curve_end_2_object()
-    //    (Curve_end(cv,ARR_MIN_END), *(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),item))));
+    //    (Curve_end(cv,ARR_MIN_END), *(std::visit(curve_end_for_fict_vertex_visitor(),item))));
     //}
     //else
     //{
     //  CGAL_precondition(traits->equal_curve_end_2_object()
-    //     (Curve_end(cv,ARR_MIN_END), boost::apply_visitor(point_for_vertex_visitor(), item)));
+    //     (Curve_end(cv,ARR_MIN_END), std::visit(point_for_vertex_visitor(), item)));
     //}
     //find the node of the curve's leftmost trapezoid
     Dag_node cv_leftmost_node(left_cv_end_node.right_child());
     if (traits->is_fictitious_vertex(item) )
     {
-      Curve_end ce( *(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),
+      Curve_end ce( *(std::visit(curve_end_for_fict_vertex_visitor(),
                                            item)));
       search_using_dag_with_cv(cv_leftmost_node, traits, ce, &cv, cres);
     }
     else
     {
-      Point p( boost::apply_visitor(point_for_vertex_visitor(), item));
+      Point p( std::visit(point_for_vertex_visitor(), item));
       search_using_dag_with_cv(cv_leftmost_node, traits, p, &cv, cres);
     }
     return cv_leftmost_node;
@@ -1159,8 +1155,8 @@ class Trapezoidal_decomposition_2
     if (traits->is_empty_item(left_item) || traits->is_empty_item(right_item))
       return false;
 
-    Td_active_trapezoid& left  (boost::get<Td_active_trapezoid>(left_item));
-    Td_active_trapezoid& right (boost::get<Td_active_trapezoid>(right_item));
+    Td_active_trapezoid& left  (std::get<Td_active_trapezoid>(left_item));
+    Td_active_trapezoid& right (std::get<Td_active_trapezoid>(right_item));
 
     if (traits->is_trapezoids_top_equal(left,right) &&
         traits->is_trapezoids_bottom_equal(left,right) &&
@@ -1966,7 +1962,7 @@ class Trapezoidal_decomposition_2
       for (typename std::list<Td_map_item>::iterator it =
              representatives.begin(); it != representatives.end(); ++it)
       {
-        Td_active_edge e(boost::get<Td_active_edge>(*it));
+        Td_active_edge e(std::get<Td_active_edge>(*it));
         container.push_back(e.halfedge()); //it represents an active trapezoid
       }
     }
@@ -2152,7 +2148,7 @@ class Trapezoidal_decomposition_2
     // traits may be initialized later
     m_dag_root = new Dag_node(Td_active_trapezoid());
     //(*m_dag_root)->set_dag_node(m_dag_root);
-    boost::apply_visitor(set_dag_node_visitor(m_dag_root),
+    std::visit(set_dag_node_visitor(m_dag_root),
                          m_dag_root->get_data());
 
     m_number_of_curves = 0;
@@ -2200,11 +2196,11 @@ class Trapezoidal_decomposition_2
       //{
       //  if ( traits->is_fictitious_vertex(item) )
       //  {
-      //    res = traits->equal_curve_end_2_object()(ce, *(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),item)));
+      //    res = traits->equal_curve_end_2_object()(ce, *(std::visit(curve_end_for_fict_vertex_visitor(),item)));
       //  }
       //  else
       //  {
-      //    res = traits->equal_curve_end_2_object()(ce, boost::apply_visitor(point_for_vertex_visitor(), item));
+      //    res = traits->equal_curve_end_2_object()(ce, std::visit(point_for_vertex_visitor(), item));
       //  }
       //}
       if (traits->is_td_trapezoid(item))
@@ -2218,11 +2214,11 @@ class Trapezoidal_decomposition_2
       //{
       //  if ( traits->is_fictitious_vertex(item) )
       //  {
-      //    res = traits->equal_curve_end_2_object()(ce, *(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),item)));
+      //    res = traits->equal_curve_end_2_object()(ce, *(std::visit(curve_end_for_fict_vertex_visitor(),item)));
       //  }
       //  else
       //  {
-      //    res = traits->equal_curve_end_2_object()(ce, boost::apply_visitor(point_for_vertex_visitor(), item));
+      //    res = traits->equal_curve_end_2_object()(ce, std::visit(point_for_vertex_visitor(), item));
       //  }
       //}
       if (traits->is_td_trapezoid(item))
@@ -2234,7 +2230,7 @@ class Trapezoidal_decomposition_2
         lt=POINT;
       else
       {
-        Td_active_trapezoid tr (boost::get<Td_active_trapezoid>(item));
+        Td_active_trapezoid tr (std::get<Td_active_trapezoid>(item));
         lt = tr.is_on_boundaries()? UNBOUNDED_TRAPEZOID : TRAPEZOID;
       }
     }
@@ -2343,12 +2339,12 @@ class Trapezoidal_decomposition_2
       // if the map item represents a fictitious vertex
       if (traits->is_fictitious_vertex(item))
       {
-        const Curve_end left_ce(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),item)));
+        const Curve_end left_ce(*(std::visit(curve_end_for_fict_vertex_visitor(),item)));
         print_ce_data(left_ce.cv(), left_ce.ce(), out);
       }
       else // if the map item represents a vertex
       {
-        Point p = boost::apply_visitor(point_for_vertex_visitor(),item);
+        Point p = std::visit(point_for_vertex_visitor(),item);
         print_point_data(p, out);
       }
       out << "          (void *)left_child: " << (void*)(&(curr.left_child()))
@@ -2363,7 +2359,7 @@ class Trapezoidal_decomposition_2
     {
       // bool is_active = traits->is_active(item);
       // if the map item represents an edge
-      const X_monotone_curve_2& he_cv = *(boost::apply_visitor(cv_for_edge_visitor(), item));
+      const X_monotone_curve_2& he_cv = *(std::visit(cv_for_edge_visitor(), item));
 
       //   so top() is a real Halfedge with a curve() if curr is active
       //   or curr holds the curve if curr is not active
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h
index b912b9facc72..7da418861f07 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h
@@ -52,7 +52,7 @@ split_trapezoid_by_vertex(Dag_node& split_node,
   Dag_node left_node, right_node;
 
   if (traits->is_td_trapezoid(curr_item)) {
-    Td_active_trapezoid& tr(boost::get<Td_active_trapezoid>(curr_item));
+    Td_active_trapezoid& tr(std::get<Td_active_trapezoid>(curr_item));
 
     CGAL_warning(traits->is_in_closure(tr, traits->vtx_to_ce(v)));
 
@@ -63,9 +63,9 @@ split_trapezoid_by_vertex(Dag_node& split_node,
                         (v, tr.right(), tr.bottom(), tr.top()));
 
     Td_active_trapezoid&
-      left_tr(boost::get<Td_active_trapezoid>(left_node.get_data()));
+      left_tr(std::get<Td_active_trapezoid>(left_node.get_data()));
     Td_active_trapezoid&
-      right_tr(boost::get<Td_active_trapezoid>(right_node.get_data()));
+      right_tr(std::get<Td_active_trapezoid>(right_node.get_data()));
 
     CGAL_warning(traits->is_trapezoids_top_equal(left_tr,right_tr));
     CGAL_warning(traits->is_trapezoids_bottom_equal(left_tr,right_tr));
@@ -77,25 +77,25 @@ split_trapezoid_by_vertex(Dag_node& split_node,
     right_tr.init_neighbors(left_node.get_data(), left_node.get_data(),
                             tr.rb(), tr.rt());
     if (!traits->is_empty_item(tr.lb())) {
-      Td_active_trapezoid& lb(boost::get<Td_active_trapezoid>(tr.lb()));
+      Td_active_trapezoid& lb(std::get<Td_active_trapezoid>(tr.lb()));
       lb.set_rb(left_node.get_data());
     }
     if (!traits->is_empty_item(tr.lt())) {
-      Td_active_trapezoid& lt(boost::get<Td_active_trapezoid>(tr.lt()));
+      Td_active_trapezoid& lt(std::get<Td_active_trapezoid>(tr.lt()));
       lt.set_rt(left_node.get_data());
     }
     if (!traits->is_empty_item(tr.rb())) {
-      Td_active_trapezoid& rb(boost::get<Td_active_trapezoid>(tr.rb()));
+      Td_active_trapezoid& rb(std::get<Td_active_trapezoid>(tr.rb()));
       rb.set_lb(right_node.get_data());
     }
     if (!traits->is_empty_item(tr.rt())) {
-      Td_active_trapezoid& rt(boost::get<Td_active_trapezoid>(tr.rt()));
+      Td_active_trapezoid& rt(std::get<Td_active_trapezoid>(tr.rt()));
       rt.set_lt(right_node.get_data());
     }
   }
   else {
     // the curr_item is an edge
-    Td_active_edge& e(boost::get<Td_active_edge>(curr_item));
+    Td_active_edge& e(std::get<Td_active_edge>(curr_item));
 
     CGAL_warning(traits->is_in_closure(e, traits->vtx_to_ce(v)));
 
@@ -103,8 +103,8 @@ split_trapezoid_by_vertex(Dag_node& split_node,
 
     right_node.set_data(Td_active_edge(e.halfedge()));
 
-    Td_active_edge& left_e(boost::get<Td_active_edge>(left_node.get_data()));
-    Td_active_edge& right_e(boost::get<Td_active_edge>(right_node.get_data()));
+    Td_active_edge& left_e(std::get<Td_active_edge>(left_node.get_data()));
+    Td_active_edge& right_e(std::get<Td_active_edge>(right_node.get_data()));
 
     //CGAL_warning(left_e.is_on_left_boundary() == e.is_on_left_boundary());
     //CGAL_warning(right_e.is_on_right_boundary() == e.is_on_right_boundary());
@@ -132,10 +132,10 @@ split_trapezoid_by_vertex(Dag_node& split_node,
   const Dag_node* left_ptr  = &split_node.left_child();
   const Dag_node* right_ptr = &split_node.right_child();
 
-  boost::apply_visitor(set_dag_node_visitor((Dag_node*)left_ptr),
+  std::visit(set_dag_node_visitor((Dag_node*)left_ptr),
                        left_ptr->get_data());
   //(*left_ptr)->set_dag_node((Dag_node*)left_ptr);
-  boost::apply_visitor(set_dag_node_visitor((Dag_node*)right_ptr),
+  std::visit(set_dag_node_visitor((Dag_node*)right_ptr),
                        right_ptr->get_data());
   //(*right_ptr)->set_dag_node((Dag_node*)right_ptr);
 
@@ -219,7 +219,7 @@ deactivate_trapezoid(Dag_node& trpz_node, Dag_node* active_node) const
   CGAL_precondition(traits->is_active(trpz_node.get_data()));
   CGAL_precondition(traits->is_td_trapezoid(trpz_node.get_data()));
   if (Td_active_trapezoid* trap =
-      boost::get<Td_active_trapezoid>(&trpz_node.get_data()))
+      std::get<Td_active_trapezoid>(&trpz_node.get_data()))
     trap->non_recursive_clear_neighbors();
   trpz_node.set_data(Td_inactive_trapezoid());
   if (active_node) trpz_node.set_left_child(*active_node);
@@ -233,11 +233,11 @@ deactivate_vertex(Dag_node& vtx_node) const
   CGAL_precondition(traits->is_td_vertex(vtx_node.get_data()));
   if (traits->is_fictitious_vertex(vtx_node.get_data())) {
     Td_active_fictitious_vertex&
-      v(boost::get<Td_active_fictitious_vertex>(vtx_node.get_data()));
+      v(std::get<Td_active_fictitious_vertex>(vtx_node.get_data()));
     vtx_node.set_data(Td_inactive_fictitious_vertex(v.vertex(), &vtx_node));
   }
   else {
-    Td_active_vertex& v(boost::get<Td_active_vertex>(vtx_node.get_data()));
+    Td_active_vertex& v(std::get<Td_active_vertex>(vtx_node.get_data()));
     vtx_node.set_data(Td_inactive_vertex(v.vertex(), &vtx_node));
   }
 }
@@ -274,7 +274,7 @@ split_trapezoid_by_halfedge(Dag_node& split_node,
   CGAL_precondition(traits->is_td_trapezoid(split_node.get_data()));
 
   Td_map_item curr_item(split_node.get_data());
-  Td_active_trapezoid& split_tr = boost::get<Td_active_trapezoid>(curr_item);
+  Td_active_trapezoid& split_tr = std::get<Td_active_trapezoid>(curr_item);
 
   // sets left and right according to td_edge's source and target positions
   // sets bottom and top to Halfedge itself
@@ -303,9 +303,9 @@ split_trapezoid_by_halfedge(Dag_node& split_node,
                          //  CGAL_TD_ON_BOTTOM_BOUNDARY )));
 
   Td_active_trapezoid& bottom =
-    boost::get<Td_active_trapezoid>(bottom_node.get_data());
+    std::get<Td_active_trapezoid>(bottom_node.get_data());
   Td_active_trapezoid& top =
-    boost::get<Td_active_trapezoid>(top_node.get_data());
+    std::get<Td_active_trapezoid>(top_node.get_data());
 
   top.init_neighbors(prev_top_tr, split_tr.lt(), std::nullopt , split_tr.rt());
   bottom.init_neighbors(split_tr.lb(), prev_bottom_tr, split_tr.rb(),
@@ -313,27 +313,27 @@ split_trapezoid_by_halfedge(Dag_node& split_node,
 
   if (!traits->is_empty_item(prev_bottom_tr)) {
     Td_active_trapezoid&
-      prev_btm(boost::get<Td_active_trapezoid>(prev_bottom_tr));
+      prev_btm(std::get<Td_active_trapezoid>(prev_bottom_tr));
     prev_btm.set_rt(bottom_node.get_data());
   }
   if (!traits->is_empty_item(prev_top_tr)) {
-    Td_active_trapezoid& prev_top(boost::get<Td_active_trapezoid>(prev_top_tr));
+    Td_active_trapezoid& prev_top(std::get<Td_active_trapezoid>(prev_top_tr));
     prev_top.set_rb(top_node.get_data());
   }
   if (!traits->is_empty_item(split_tr.lb())) {
-    Td_active_trapezoid& lb(boost::get<Td_active_trapezoid>(split_tr.lb()));
+    Td_active_trapezoid& lb(std::get<Td_active_trapezoid>(split_tr.lb()));
     lb.set_rb(bottom_node.get_data());
   }
   if (!traits->is_empty_item(split_tr.lt())) {
-    Td_active_trapezoid& lt(boost::get<Td_active_trapezoid>(split_tr.lt()));
+    Td_active_trapezoid& lt(std::get<Td_active_trapezoid>(split_tr.lt()));
     lt.set_rt(top_node.get_data());
   }
   if (!traits->is_empty_item(split_tr.rb())) {
-    Td_active_trapezoid& rb(boost::get<Td_active_trapezoid>(split_tr.rb()));
+    Td_active_trapezoid& rb(std::get<Td_active_trapezoid>(split_tr.rb()));
     rb.set_lb(bottom_node.get_data());
   }
   if (!traits->is_empty_item(split_tr.rt())) {
-    Td_active_trapezoid& rt(boost::get<Td_active_trapezoid>(split_tr.rt()));
+    Td_active_trapezoid& rt(std::get<Td_active_trapezoid>(split_tr.rt()));
     rt.set_lt(top_node.get_data());
   }
   split_node.replace(sep,bottom_node,top_node); //nodes depth are updated here
@@ -348,14 +348,14 @@ split_trapezoid_by_halfedge(Dag_node& split_node,
   const Dag_node* bottomPtr = &split_node.left_child();
   const Dag_node* topPtr    = &split_node.right_child();
 
-  boost::apply_visitor(set_dag_node_visitor((Dag_node*)bottomPtr),
+  std::visit(set_dag_node_visitor((Dag_node*)bottomPtr),
                        bottomPtr->get_data());
-  boost::apply_visitor(set_dag_node_visitor((Dag_node*)topPtr),
+  std::visit(set_dag_node_visitor((Dag_node*)topPtr),
                        topPtr->get_data());
 
-  // Td_active_edge& new_e = boost::get<Td_active_edge>(split_node.get_data());
+  // Td_active_edge& new_e = std::get<Td_active_edge>(split_node.get_data());
   if (!traits->is_empty_item(prev_e)) {
-    Td_active_edge& e( boost::get<Td_active_edge>(prev_e));
+    Td_active_edge& e( std::get<Td_active_edge>(prev_e));
     e.set_next(split_node.get_data());
   }
   //update these trapezoids pointers.
@@ -404,14 +404,14 @@ update_vtx_with_new_edge(Halfedge_const_handle he,
 
   //set cw to hold the halfedge whose source is p,
   // which is clockwise "smallest" starting from top (12 o'clock)
-  Halfedge_const_handle cw_he(boost::apply_visitor(cw_he_visitor(), vtx_item));
+  Halfedge_const_handle cw_he(std::visit(cw_he_visitor(), vtx_item));
   if (traits->compare_cw_around_point_2_object()(he->curve(),
                                                  is_edge_to_right(he,p),
                                                  cw_he->curve(),
                                                  is_edge_to_right(cw_he,p),
                                                  p) == SMALLER)
   {
-    boost::apply_visitor(set_cw_he_visitor(he),vtx_item);//v_tr->set_top(he);
+    std::visit(set_cw_he_visitor(he),vtx_item);//v_tr->set_top(he);
   }
 
   return vtx_item;
@@ -430,7 +430,7 @@ insert_curve_at_vtx_using_dag(Halfedge_const_handle he,
 {
   CGAL_precondition(lt==TRAPEZOID || lt==UNBOUNDED_TRAPEZOID);
 
-  Dag_node* node = boost::apply_visitor(dag_node_visitor(), item);
+  Dag_node* node = std::visit(dag_node_visitor(), item);
 
   CGAL_assertion(node != nullptr);
   CGAL_assertion(he != m_empty_he_handle);
@@ -458,13 +458,13 @@ insert_curve_at_vtx_using_dag(Halfedge_const_handle he,
 //  CGAL_precondition(traits->is_td_vertex(vtx_item));
 //  CGAL_precondition(traits->is_active(vtx_item));
 //
-//  Halfedge_const_handle cw_he (boost::apply_visitor(cw_he_visitor(), vtx_item));
+//  Halfedge_const_handle cw_he (std::visit(cw_he_visitor(), vtx_item));
 //
 //  //make sure the cw_he is added in same direction as before
 //  //  such that vtx_item is the source (done inside the set methods)
 //  if (cw_he == old_he || cw_he->twin() == old_he)
 //  {
-//    boost::apply_visitor(set_cw_he_visitor(new_he), vtx_item);
+//    std::visit(set_cw_he_visitor(new_he), vtx_item);
 //  }
 //}
 
@@ -479,12 +479,12 @@ update_vtx_cw_he_after_merge(const X_monotone_curve_2& old_cv,
   CGAL_precondition(traits->is_td_vertex(vtx_item));
   CGAL_precondition(traits->is_active(vtx_item));
 
-  Halfedge_const_handle cw_he(boost::apply_visitor(cw_he_visitor(), vtx_item));
+  Halfedge_const_handle cw_he(std::visit(cw_he_visitor(), vtx_item));
 
   //make sure the cw_he is added in same direction as before
   //  such that v_tr is the source (done inside the set methods)
   if (traits->equal_2_object()(cw_he->curve(), old_cv))
-    boost::apply_visitor(set_cw_he_visitor(new_he), vtx_item);
+    std::visit(set_cw_he_visitor(new_he), vtx_item);
 }
 
 //-----------------------------------------------------------------------------
@@ -499,12 +499,12 @@ update_vtx_cw_he_after_remove(Halfedge_const_handle old_he,
   CGAL_precondition(traits->is_td_vertex(vtx_item));
   CGAL_precondition(traits->is_active(vtx_item));
 
-  Halfedge_const_handle cw_he(boost::apply_visitor(cw_he_visitor(), vtx_item));
+  Halfedge_const_handle cw_he(std::visit(cw_he_visitor(), vtx_item));
   if ((old_he == cw_he) || (old_he->twin() == cw_he)) {
     Halfedge_const_handle new_he = cw_he->twin()->next();
     if (new_he != cw_he)
-      boost::apply_visitor(set_cw_he_visitor(new_he), vtx_item);
-    else boost::apply_visitor(reset_cw_he_visitor(), vtx_item); // dangling edge removed
+      std::visit(set_cw_he_visitor(new_he), vtx_item);
+    else std::visit(reset_cw_he_visitor(), vtx_item); // dangling edge removed
   }
 }
 
@@ -520,20 +520,20 @@ update_vtx_cw_he_after_remove(Halfedge_const_handle old_he,
 //  CGAL_precondition(traits->is_td_vertex(vtx_item));
 //  CGAL_precondition(traits->is_active(vtx_item));
 //
-//  Halfedge_const_handle top_he (boost::apply_visitor(top_he_visitor(), vtx_item));
-//  Halfedge_const_handle bottom_he (boost::apply_visitor(bottom_he_visitor(), vtx_item));
+//  Halfedge_const_handle top_he (std::visit(top_he_visitor(), vtx_item));
+//  Halfedge_const_handle bottom_he (std::visit(bottom_he_visitor(), vtx_item));
 //
 //  //make sure the top & bottom are added in same direction as before
 //  //  such that sep is the source (done inside the set methods)
 //  if ((top_he == he1) || (top_he == he1->twin()) ||
 //      (top_he == he2) || (top_he == he2->twin()) )
 //  {
-//     boost::apply_visitor(set_top_he_visitor(new_he), vtx_item); //v_tr.set_top(new_he);
+//     std::visit(set_top_he_visitor(new_he), vtx_item); //v_tr.set_top(new_he);
 //  }
 //  if ((bottom_he == he1) || (bottom_he == he1->twin()) ||
 //      (bottom_he == he2) || (bottom_he == he2->twin()) )
 //  {
-//    boost::apply_visitor(set_bottom_he_visitor(new_he), vtx_item); //v_tr.set_bottom(new_he);
+//    std::visit(set_bottom_he_visitor(new_he), vtx_item); //v_tr.set_bottom(new_he);
 //  }
 //}
 
@@ -561,22 +561,22 @@ update_map_items_after_merge(In_face_iterator& it,
     CGAL_assertion(traits->is_active(curr_item));
 
     if (traits->is_td_edge(curr_item)) {
-      Td_active_edge& e(boost::get<Td_active_edge>(curr_item));
+      Td_active_edge& e(std::get<Td_active_edge>(curr_item));
       if (e.halfedge() == old_he || e.halfedge() == old_he->twin())
         e.set_halfedge(new_he);
     }
     else if (traits->is_td_trapezoid(curr_item)) {
-      Td_active_trapezoid& tr(boost::get<Td_active_trapezoid>(curr_item));
+      Td_active_trapezoid& tr(std::get<Td_active_trapezoid>(curr_item));
       if (tr.bottom() == old_he || tr.bottom() == old_he->twin())
         tr.set_bottom(new_he);
       if (tr.top() == old_he || tr.top() == old_he->twin()) tr.set_top(new_he);
     }
     else {
       //if is_td_vertex
-      Halfedge_const_handle cw_he(boost::apply_visitor(cw_he_visitor(),
+      Halfedge_const_handle cw_he(std::visit(cw_he_visitor(),
                                                        curr_item));
       if (cw_he == old_he || cw_he == old_he->twin())
-        boost::apply_visitor(set_cw_he_visitor(new_he), curr_item);
+        std::visit(set_cw_he_visitor(new_he), curr_item);
     }
 
     last_item = *it;
@@ -615,20 +615,20 @@ search_using_dag(Dag_node& curr_node,
     if (traits->is_td_vertex(curr_item)) {
       // the curr_item represents a vertex
       //bool is_fict_vtx = traits->is_fictitious_vertex(curr_item);
-      //if ((is_fict_vtx  && is_end_point_left_low(p, *(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)))) ||
-      //    (!is_fict_vtx &&  is_end_point_left_low(p, boost::apply_visitor(point_for_vertex_visitor(), curr_item))) )
+      //if ((is_fict_vtx  && is_end_point_left_low(p, *(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)))) ||
+      //    (!is_fict_vtx &&  is_end_point_left_low(p, std::visit(point_for_vertex_visitor(), curr_item))) )
       if (is_end_point_left_low(p, curr_node)) {
         curr_node = curr_node.left_child();
         continue;
       }
-      //else if ((is_fict_vtx  && is_end_point_right_top(p, *(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)))) ||
-      //         (!is_fict_vtx && is_end_point_right_top(p, boost::apply_visitor(point_for_vertex_visitor(), curr_item))) )
+      //else if ((is_fict_vtx  && is_end_point_right_top(p, *(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)))) ||
+      //         (!is_fict_vtx && is_end_point_right_top(p, std::visit(point_for_vertex_visitor(), curr_item))) )
       else if (is_end_point_right_top(p, curr_node)) {
         curr_node = curr_node.right_child();
         continue;
       }
-      //else if ((is_fict_vtx  && traits->equal_curve_end_2_object()(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), p)) ||
-      //         (!is_fict_vtx && traits->equal_2_object()(boost::apply_visitor(point_for_vertex_visitor(), curr_item), p)) )
+      //else if ((is_fict_vtx  && traits->equal_curve_end_2_object()(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), p)) ||
+      //         (!is_fict_vtx && traits->equal_2_object()(std::visit(point_for_vertex_visitor(), curr_item), p)) )
       else if (are_equal_end_points(p, curr_node)) {
         if (he == m_empty_he_handle) {
           // he is the empty handle
@@ -663,13 +663,13 @@ search_using_dag(Dag_node& curr_node,
                        are_equal_end_points(p,curr_node));
 
                     //(is_fict_vtx &&
-                    //  (is_end_point_left_low(p,*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item))) ||
-                    //   is_end_point_right_top(p,*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item))) ||
-                    //   traits->equal_curve_end_2_object()(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)),p))) ||
+                    //  (is_end_point_left_low(p,*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item))) ||
+                    //   is_end_point_right_top(p,*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item))) ||
+                    //   traits->equal_curve_end_2_object()(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)),p))) ||
                     // (!is_fict_vtx &&
-                    //  (is_end_point_left_low(p,boost::apply_visitor(point_for_vertex_visitor(), curr_item)) ||
-                    //   is_end_point_right_top(p,boost::apply_visitor(point_for_vertex_visitor(), curr_item)) ||
-                    //   traits->equal_2_object()(boost::apply_visitor(point_for_vertex_visitor(), curr_item),p))));
+                    //  (is_end_point_left_low(p,std::visit(point_for_vertex_visitor(), curr_item)) ||
+                    //   is_end_point_right_top(p,std::visit(point_for_vertex_visitor(), curr_item)) ||
+                    //   traits->equal_2_object()(std::visit(point_for_vertex_visitor(), curr_item),p))));
 
         return Locate_type();
       }
@@ -678,7 +678,7 @@ search_using_dag(Dag_node& curr_node,
       // curr_item represents an edge,
       //   so top() is a real Halfedge with a curve() if curr_item is active
       //   or curr_item holds the curve if it is not active
-      const X_monotone_curve_2& he_cv = *(boost::apply_visitor(cv_for_edge_visitor(), curr_item));
+      const X_monotone_curve_2& he_cv = *(std::visit(cv_for_edge_visitor(), curr_item));
 
       Comparison_result cres = traits->compare_y_at_x_2_object()(p, he_cv);
       if (cres == SMALLER) {
@@ -753,7 +753,7 @@ search_using_dag(Dag_node& curr_node,
     else {
       // if is_degenerate() == 0, meaning: curr_item is a real trapezoid
       if (traits->is_active(curr_item)) {
-        Td_active_trapezoid& tr = boost::get<Td_active_trapezoid>(curr_item);
+        Td_active_trapezoid& tr = std::get<Td_active_trapezoid>(curr_item);
         return tr.is_on_boundaries() ? UNBOUNDED_TRAPEZOID : TRAPEZOID;
       }
       curr_node = curr_node.left_child();
@@ -810,30 +810,30 @@ search_using_dag(Dag_node& curr_node,
 //      bool is_fict_vtx = traits->is_fictitious_vertex(curr_item);
 //      if (is_fict_vtx)
 //      {
-//        Curve_end vtx_ce(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)));
+//        Curve_end vtx_ce(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)));
 //        print_ce_data(vtx_ce.cv(), vtx_ce.ce(), out);
 //      }
 //      else
 //      {
-//        print_point_data(boost::apply_visitor(point_for_vertex_visitor(),curr_item), out);
+//        print_point_data(std::visit(point_for_vertex_visitor(),curr_item), out);
 //      }
 //
-//      if ((is_fict_vtx && is_end_point_left_low(p, *(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)))) ||
-//        (!is_fict_vtx &&  is_end_point_left_low(p, boost::apply_visitor(point_for_vertex_visitor(),curr_item))) )
+//      if ((is_fict_vtx && is_end_point_left_low(p, *(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)))) ||
+//        (!is_fict_vtx &&  is_end_point_left_low(p, std::visit(point_for_vertex_visitor(),curr_item))) )
 //      {
 //        out << " Going left " << std::endl;
 //        curr_node = curr_node.left_child();
 //        continue;
 //      }
-//      else if ((is_fict_vtx && is_end_point_right_top(p, *(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)))) ||
-//               (!is_fict_vtx &&  is_end_point_right_top(p, boost::apply_visitor(point_for_vertex_visitor(),curr_item))) )
+//      else if ((is_fict_vtx && is_end_point_right_top(p, *(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)))) ||
+//               (!is_fict_vtx &&  is_end_point_right_top(p, std::visit(point_for_vertex_visitor(),curr_item))) )
 //      {
 //        out << " Going right " << std::endl;
 //        curr_node = curr_node.right_child();
 //        continue;
 //      }
-//      else if ((is_fict_vtx && traits->equal_curve_end_2_object()(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), p)) ||
-//               (!is_fict_vtx &&  traits->equal_2_object()(boost::apply_visitor(point_for_vertex_visitor(),curr_item), p)) )
+//      else if ((is_fict_vtx && traits->equal_curve_end_2_object()(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), p)) ||
+//               (!is_fict_vtx &&  traits->equal_2_object()(std::visit(point_for_vertex_visitor(),curr_item), p)) )
 //      {
 //        out << " Equal to query " << std::endl;
 //        if (he == m_empty_he_handle) //if he is the empty handle
@@ -876,7 +876,7 @@ search_using_dag(Dag_node& curr_node,
 //      // if curr_item represents an edge,
 //      //   so top() is a real Halfedge with a curve() if curr_item is active
 //      //   or curr_item holds the curve if it is not active
-//      const X_monotone_curve_2& he_cv = *(boost::apply_visitor(cv_for_edge_visitor(), curr_item));
+//      const X_monotone_curve_2& he_cv = *(std::visit(cv_for_edge_visitor(), curr_item));
 //
 //      out << " EDGE : " ;
 //      if (traits->is_active(curr_item))
@@ -951,7 +951,7 @@ search_using_dag(Dag_node& curr_node,
 //      if (traits->is_active(curr_item))
 //      {
 //        out << " (active) ";
-//        Td_active_trapezoid tr =  boost::get<Td_active_trapezoid>(curr_item);
+//        Td_active_trapezoid tr =  std::get<Td_active_trapezoid>(curr_item);
 //        if (tr.is_on_boundaries())
 //          out << " UNBOUNDED! ";
 //        else
@@ -1023,20 +1023,20 @@ search_using_dag_with_cv(Dag_node& curr_node,
     if (traits->is_td_vertex(curr_item)) {
       // the curr_item represents a vertex
       //bool is_fict_vtx = traits->is_fictitious_vertex(curr_item);
-      //if ((is_fict_vtx  && is_end_point_right_top(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), ce)) ||
-      //    (!is_fict_vtx && is_end_point_right_top(boost::apply_visitor(point_for_vertex_visitor(), curr_item), ce)) )
+      //if ((is_fict_vtx  && is_end_point_right_top(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), ce)) ||
+      //    (!is_fict_vtx && is_end_point_right_top(std::visit(point_for_vertex_visitor(), curr_item), ce)) )
       if (is_end_point_left_low(ce, curr_node)) {
         curr_node = curr_node.left_child();
         continue;
       }
-      //else if ((is_fict_vtx  && is_end_point_left_low(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), ce)) ||
-      //         (!is_fict_vtx && is_end_point_left_low(boost::apply_visitor(point_for_vertex_visitor(), curr_item), ce)) )
+      //else if ((is_fict_vtx  && is_end_point_left_low(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), ce)) ||
+      //         (!is_fict_vtx && is_end_point_left_low(std::visit(point_for_vertex_visitor(), curr_item), ce)) )
       else if (is_end_point_right_top(ce, curr_node)) {
         curr_node = curr_node.right_child();
         continue;
       }
-      //else if ((is_fict_vtx && traits->equal_curve_end_2_object()(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), ce)) ||
-      //         (!is_fict_vtx &&  traits->equal_curve_end_2_object()(boost::apply_visitor(point_for_vertex_visitor(), curr_item), ce)) )
+      //else if ((is_fict_vtx && traits->equal_curve_end_2_object()(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), ce)) ||
+      //         (!is_fict_vtx &&  traits->equal_curve_end_2_object()(std::visit(point_for_vertex_visitor(), curr_item), ce)) )
       else if (are_equal_end_points(ce, curr_node)) {
         if (!p_cv) {
           // p_cv was not given
@@ -1070,13 +1070,13 @@ search_using_dag_with_cv(Dag_node& curr_node,
                        is_end_point_right_top(ce, curr_node) ||
                        are_equal_end_points(ce, curr_node));
           //(is_fict_vtx &&
-          //            (is_end_point_left_low(ce,*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item))) ||
-          //             is_end_point_right_top(ce,*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item))) ||
-          //             traits->equal_curve_end_2_object()(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)),ce))) ||
+          //            (is_end_point_left_low(ce,*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item))) ||
+          //             is_end_point_right_top(ce,*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item))) ||
+          //             traits->equal_curve_end_2_object()(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)),ce))) ||
           //           (!is_fict_vtx &&
-          //            (is_end_point_left_low(ce,boost::apply_visitor(point_for_vertex_visitor(), curr_item)) ||
-          //             is_end_point_right_top(ce,boost::apply_visitor(point_for_vertex_visitor(), curr_item)) ||
-          //             traits->equal_curve_end_2_object()(boost::apply_visitor(point_for_vertex_visitor(), curr_item),ce))));
+          //            (is_end_point_left_low(ce,std::visit(point_for_vertex_visitor(), curr_item)) ||
+          //             is_end_point_right_top(ce,std::visit(point_for_vertex_visitor(), curr_item)) ||
+          //             traits->equal_curve_end_2_object()(std::visit(point_for_vertex_visitor(), curr_item),ce))));
         return Locate_type();
       }
     }
@@ -1086,7 +1086,7 @@ search_using_dag_with_cv(Dag_node& curr_node,
       //   or curr_item holds the curve if it is not active
 
       const X_monotone_curve_2& he_cv =
-        *(boost::apply_visitor(cv_for_edge_visitor(), curr_item));
+        *(std::visit(cv_for_edge_visitor(), curr_item));
       Comparison_result cres =
         traits->compare_curve_end_y_at_x_2_object()(ce, he_cv);
       if (cres == SMALLER) {
@@ -1174,7 +1174,7 @@ search_using_dag_with_cv(Dag_node& curr_node,
     else {
       // if is_degenerate() == 0, meaning: curr_item is a real trapezoid
       if (traits->is_active(curr_item)) {
-        Td_active_trapezoid& tr = boost::get<Td_active_trapezoid>(curr_item);
+        Td_active_trapezoid& tr = std::get<Td_active_trapezoid>(curr_item);
         return tr.is_on_boundaries() ? UNBOUNDED_TRAPEZOID : TRAPEZOID;
       }
       curr_node = curr_node.left_child();
@@ -1213,20 +1213,20 @@ search_using_dag_with_cv(Dag_node& curr_node,
     if (traits->is_td_vertex(curr_item)) {
       // the curr_item represents a vertex
       //bool is_fict_vtx = traits->is_fictitious_vertex(curr_item);
-      //if ((is_fict_vtx  && is_end_point_right_top(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), p)) ||
-      //    (!is_fict_vtx && is_end_point_right_top(boost::apply_visitor(point_for_vertex_visitor(), curr_item), p)) )
+      //if ((is_fict_vtx  && is_end_point_right_top(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), p)) ||
+      //    (!is_fict_vtx && is_end_point_right_top(std::visit(point_for_vertex_visitor(), curr_item), p)) )
       if (is_end_point_left_low(p, curr_node)) {
         curr_node = curr_node.left_child();
         continue;
       }
-      //else if ((is_fict_vtx  && is_end_point_left_low(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), p)) ||
-      //         (!is_fict_vtx && is_end_point_left_low(boost::apply_visitor(point_for_vertex_visitor(), curr_item), p)) )
+      //else if ((is_fict_vtx  && is_end_point_left_low(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), p)) ||
+      //         (!is_fict_vtx && is_end_point_left_low(std::visit(point_for_vertex_visitor(), curr_item), p)) )
       else if (is_end_point_right_top(p, curr_node)) {
         curr_node = curr_node.right_child();
         continue;
       }
-      //else if ((is_fict_vtx && traits->equal_curve_end_2_object()(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), p)) ||
-      //         (!is_fict_vtx &&  traits->equal_2_object()(boost::apply_visitor(point_for_vertex_visitor(), curr_item), p)) )
+      //else if ((is_fict_vtx && traits->equal_curve_end_2_object()(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), p)) ||
+      //         (!is_fict_vtx &&  traits->equal_2_object()(std::visit(point_for_vertex_visitor(), curr_item), p)) )
       else if (are_equal_end_points(p, curr_node)) {
         if (!p_cv) {
           // p_cv was not given
@@ -1260,13 +1260,13 @@ search_using_dag_with_cv(Dag_node& curr_node,
                        is_end_point_right_top(p, curr_node) ||
                        are_equal_end_points(p, curr_node));
         //CGAL_assertion((is_fict_vtx &&
-        //              (is_end_point_left_low(p,*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item))) ||
-        //               is_end_point_right_top(p,*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item))) ||
-        //               traits->equal_curve_end_2_object()(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)),p))) ||
+        //              (is_end_point_left_low(p,*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item))) ||
+        //               is_end_point_right_top(p,*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item))) ||
+        //               traits->equal_curve_end_2_object()(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)),p))) ||
         //             (!is_fict_vtx &&
-        //              (is_end_point_left_low(p,boost::apply_visitor(point_for_vertex_visitor(), curr_item)) ||
-        //               is_end_point_right_top(p,boost::apply_visitor(point_for_vertex_visitor(), curr_item)) ||
-        //               traits->equal_2_object()(boost::apply_visitor(point_for_vertex_visitor(), curr_item),p))));
+        //              (is_end_point_left_low(p,std::visit(point_for_vertex_visitor(), curr_item)) ||
+        //               is_end_point_right_top(p,std::visit(point_for_vertex_visitor(), curr_item)) ||
+        //               traits->equal_2_object()(std::visit(point_for_vertex_visitor(), curr_item),p))));
         return Locate_type();
       }
     }
@@ -1275,7 +1275,7 @@ search_using_dag_with_cv(Dag_node& curr_node,
       //   so top() is a real Halfedge with a curve() if curr_item is active
       //   or curr_item holds the curve if it is not active
       const X_monotone_curve_2& he_cv =
-        *(boost::apply_visitor(cv_for_edge_visitor(), curr_item));
+        *(std::visit(cv_for_edge_visitor(), curr_item));
       Comparison_result cres = traits->compare_y_at_x_2_object()(p, he_cv);
       if (cres == SMALLER) {
         curr_node = curr_node.left_child();
@@ -1351,7 +1351,7 @@ search_using_dag_with_cv(Dag_node& curr_node,
     else {
       // is_degenerate() == 0, meaning: curr_item is a real trapezoid
       if (traits->is_active(curr_item)) {
-        Td_active_trapezoid& tr = boost::get<Td_active_trapezoid>(curr_item);
+        Td_active_trapezoid& tr = std::get<Td_active_trapezoid>(curr_item);
         return tr.is_on_boundaries() ? UNBOUNDED_TRAPEZOID : TRAPEZOID;
       }
       curr_node = curr_node.left_child();
@@ -1377,7 +1377,7 @@ container2dag(Nodes_map& ar, int left, int right, int& num_of_new_nodes) const
     CGAL_assertion(traits->is_active(item));
     CGAL_assertion(traits->is_td_trapezoid(item));
     Dag_node& tr_node( ar.find(d)->second);
-    Td_active_trapezoid& tr(boost::get<Td_active_trapezoid>(tr_node.get_data()));
+    Td_active_trapezoid& tr(std::get<Td_active_trapezoid>(tr_node.get_data()));
     Vertex_const_handle v = tr.right();
 
     Curve_end ce(traits->vtx_to_ce(v));
@@ -1397,15 +1397,15 @@ container2dag(Nodes_map& ar, int left, int right, int& num_of_new_nodes) const
     }
 
     num_of_new_nodes++;
-    boost::apply_visitor(set_dag_node_visitor((Dag_node*)&(curr_node.left_child())), curr_node.left_child().get_data());
-    boost::apply_visitor(set_dag_node_visitor((Dag_node*)&(curr_node.right_child())), curr_node.right_child().get_data());
-    boost::apply_visitor(set_dag_node_visitor((Dag_node*)&curr_node),
+    std::visit(set_dag_node_visitor((Dag_node*)&(curr_node.left_child())), curr_node.left_child().get_data());
+    std::visit(set_dag_node_visitor((Dag_node*)&(curr_node.right_child())), curr_node.right_child().get_data());
+    std::visit(set_dag_node_visitor((Dag_node*)&curr_node),
                          curr_node.get_data());
     //curr_node.left_child()->set_dag_node(&curr_node.left_child());
     //curr_node.right_child()->set_dag_node(&curr_node.right_child());
     //curr_node->set_dag_node(&curr_node);// fake temporary node
     deactivate_vertex(curr_node); //curr_node->remove(); // mark as deleted
-    boost::apply_visitor(set_dag_node_visitor((Dag_node*)nullptr),
+    std::visit(set_dag_node_visitor((Dag_node*)nullptr),
                          curr_node.get_data());//curr_node->set_dag_node(0);
 
     return curr_node;
@@ -1423,7 +1423,7 @@ is_last_edge(Halfedge_const_handle /* he */ , Td_map_item& vtx_item)
   CGAL_precondition(traits->is_active(vtx_item));
 
   Vertex_const_handle
-    v(boost::apply_visitor(vertex_for_active_vertex_visitor(), vtx_item));
+    v(std::visit(vertex_for_active_vertex_visitor(), vtx_item));
 
   typename Arrangement_on_surface_2::Halfedge_around_vertex_const_circulator
     first, second;
@@ -1518,8 +1518,8 @@ Trapezoidal_decomposition_2<Td_traits>::insert(Halfedge_const_handle he)
 
   // locate and insert end points of the input halfedge to the Td_map_item
   // Dag if needed
-  Dag_node p1_node(*(boost::apply_visitor(dag_node_visitor(), p1_item)));
-  //Dag_node p2_node(*(boost::apply_visitor(dag_node_visitor(), p2_item)));// Not in use
+  Dag_node p1_node(*(std::visit(dag_node_visitor(), p1_item)));
+  //Dag_node p2_node(*(std::visit(dag_node_visitor(), p2_item)));// Not in use
 
   // create the Td_map_item iterator for traveling along the Trapezoids that
   // intersect the input Halfedge, using left-low to right-high order
@@ -1568,7 +1568,7 @@ Trapezoidal_decomposition_2<Td_traits>::insert(Halfedge_const_handle he)
                      traits->is_active(new_btm_item));
       if (merge_if_possible(prev_bottom_tr, new_btm_item)) {
         Dag_node* left_child_node =
-          boost::apply_visitor(dag_node_visitor(),prev_bottom_tr);
+          std::visit(dag_node_visitor(),prev_bottom_tr);
         node->set_left_child(*left_child_node);
         old_bottom_tr = prev_bottom_tr;
         m_number_of_dag_nodes--; //update number of nodes in the DAG after merge
@@ -1581,7 +1581,7 @@ Trapezoidal_decomposition_2<Td_traits>::insert(Halfedge_const_handle he)
       CGAL_assertion(traits->is_td_trapezoid(new_top_item) &&
                      traits->is_active(new_top_item));
       if (merge_if_possible(prev_top_tr, new_top_item)) {
-        Dag_node* right_child_node = boost::apply_visitor(dag_node_visitor(),
+        Dag_node* right_child_node = std::visit(dag_node_visitor(),
                                                           prev_top_tr);
         node->set_right_child(*right_child_node);
         old_top_tr = prev_top_tr;
@@ -1654,12 +1654,12 @@ void Trapezoidal_decomposition_2<Td_traits>::remove(Halfedge_const_handle he)
 
   if (lt1 != POINT || lt2 != POINT) return;
 
-  CGAL_warning(boost::apply_visitor(dag_node_visitor(), p1_item) != nullptr);
-  CGAL_warning(boost::apply_visitor(dag_node_visitor(), p2_item) != nullptr);
+  CGAL_warning(std::visit(dag_node_visitor(), p1_item) != nullptr);
+  CGAL_warning(std::visit(dag_node_visitor(), p2_item) != nullptr);
 
   //retrieve the Dag_nodes of the two point-degenerate trapezoid
-  Dag_node& p1_node = *(boost::apply_visitor(dag_node_visitor(), p1_item));
-  Dag_node& p2_node = *(boost::apply_visitor(dag_node_visitor(), p2_item));
+  Dag_node& p1_node = *(std::visit(dag_node_visitor(), p1_item));
+  Dag_node& p2_node = *(std::visit(dag_node_visitor(), p2_item));
 
   //calculate the immediate lower, central and upper neighborhood of
   // the curve in the data structure
@@ -1725,7 +1725,7 @@ void Trapezoidal_decomposition_2<Td_traits>::remove(Halfedge_const_handle he)
     //copy trapezoid data from btm and top trapezoids
     Dag_node& new_node = (new_array.find(sz))->second;
     ++sz;
-    Td_active_trapezoid& tr(boost::get<Td_active_trapezoid>(new_node.get_data()));
+    Td_active_trapezoid& tr(std::get<Td_active_trapezoid>(new_node.get_data()));
     tr.set_dag_node(&new_node);
     tr.set_lb(btm_it_tr.lb());
     tr.set_lt(top_it_tr.lt());
@@ -1741,13 +1741,13 @@ void Trapezoidal_decomposition_2<Td_traits>::remove(Halfedge_const_handle he)
     }
     if (!traits->is_empty_item(tr.lb())) {
       Td_map_item lb_item = tr.lb();
-      Td_active_trapezoid& lb_tr(boost::get<Td_active_trapezoid>(lb_item));
+      Td_active_trapezoid& lb_tr(std::get<Td_active_trapezoid>(lb_item));
       lb_tr.set_rb(new_node.get_data());
     }
     if (!traits->is_empty_item(tr.lt()))
     {
       Td_map_item lt_item = tr.lt();
-      Td_active_trapezoid& lt_tr(boost::get<Td_active_trapezoid>(lt_item));
+      Td_active_trapezoid& lt_tr(std::get<Td_active_trapezoid>(lt_item));
       lt_tr.set_rt(new_node.get_data());
     }
 
@@ -1769,23 +1769,23 @@ void Trapezoidal_decomposition_2<Td_traits>::remove(Halfedge_const_handle he)
     if (!btm_it ||
         (inc_btm && !traits->is_trpz_bottom_equal(old_tr_item, *curr_it)))
     {
-      Td_map_item rb(boost::apply_visitor(rb_visitor(), old_tr_item));
+      Td_map_item rb(std::visit(rb_visitor(), old_tr_item));
       if (!traits->is_empty_item(rb)) {
-        boost::apply_visitor(set_lb_visitor(last_new_tr_item), rb);
+        std::visit(set_lb_visitor(last_new_tr_item), rb);
         //rb->set_lb(last_new_tr);
-        boost::apply_visitor(set_rb_visitor(rb), last_new_tr_item);
+        std::visit(set_rb_visitor(rb), last_new_tr_item);
         //last_new_tr->set_rb(rb);
       }
     }
     if (!top_it ||
         (!inc_btm && !traits->is_trpz_top_equal(old_tr_item,*curr_it)))
     {
-      Td_map_item rt(boost::apply_visitor(rt_visitor(), old_tr_item));
+      Td_map_item rt(std::visit(rt_visitor(), old_tr_item));
       if (!traits->is_empty_item(rt))
       {
-        boost::apply_visitor(set_lt_visitor(last_new_tr_item), rt);
+        std::visit(set_lt_visitor(last_new_tr_item), rt);
         //rt->set_lt(last_new_tr);
-        boost::apply_visitor(set_rt_visitor(rt), last_new_tr_item);
+        std::visit(set_rt_visitor(rt), last_new_tr_item);
         //last_new_tr->set_rt(rt);
       }
     }
@@ -1793,7 +1793,7 @@ void Trapezoidal_decomposition_2<Td_traits>::remove(Halfedge_const_handle he)
     //set the no longer relevant trapezoids as removed and add the new nodes
     //  as their replacement
 
-    Dag_node* last_tr_node(boost::apply_visitor(dag_node_visitor(),
+    Dag_node* last_tr_node(std::visit(dag_node_visitor(),
                                                 last_tr_item));
 
     if (prev_inc_btm != inc_btm) {
@@ -1827,7 +1827,7 @@ void Trapezoidal_decomposition_2<Td_traits>::remove(Halfedge_const_handle he)
 
     // update the dag node pointer in the trapezoid
     const Dag_node* real = &last_tr_node->left_child();
-    boost::apply_visitor(set_dag_node_visitor((Dag_node*)real),real->get_data()); //(*real)->set_dag_node((Dag_node*)real);
+    std::visit(set_dag_node_visitor((Dag_node*)real),real->get_data()); //(*real)->set_dag_node((Dag_node*)real);
   }
   while(!end_reached);
 
@@ -1853,18 +1853,18 @@ void Trapezoidal_decomposition_2<Td_traits>::remove(Halfedge_const_handle he)
   m_number_of_dag_nodes += num_of_new_nodes; //new node (tmp) was added
 
   const Dag_node* real = &tr.dag_node()->left_child();
-  boost::apply_visitor(set_dag_node_visitor((Dag_node*)real),real->get_data()); //(*real)->set_dag_node((Dag_node*)real);
+  std::visit(set_dag_node_visitor((Dag_node*)real),real->get_data()); //(*real)->set_dag_node((Dag_node*)real);
 
   if (!traits->is_empty_item(rb)) {
-    boost::apply_visitor(set_rb_visitor(rb),last_new_tr_item);
+    std::visit(set_rb_visitor(rb),last_new_tr_item);
     //last_new_tr->set_rb(rb);
-    boost::apply_visitor(set_lb_visitor(last_new_tr_item),rb);
+    std::visit(set_lb_visitor(last_new_tr_item),rb);
     //rb->set_lb(last_new_tr);
   }
   if (!traits->is_empty_item(rt)) {
-    boost::apply_visitor(set_rt_visitor(rt),last_new_tr_item);
+    std::visit(set_rt_visitor(rt),last_new_tr_item);
     //last_new_tr->set_rt(rt);
-    boost::apply_visitor(set_lt_visitor(last_new_tr_item),rt);
+    std::visit(set_lt_visitor(last_new_tr_item),rt);
     //rt->set_lt(last_new_tr);
   }
 
@@ -1876,7 +1876,7 @@ void Trapezoidal_decomposition_2<Td_traits>::remove(Halfedge_const_handle he)
   //Base_trapezoid_iterator last_mid = mid_it;
   Dag_node* e_node = nullptr;
   while (!!++mid_it) {
-    e_node = boost::apply_visitor(dag_node_visitor(),*last_edge_fragment_it);
+    e_node = std::visit(dag_node_visitor(),*last_edge_fragment_it);
     deactivate_edge(removed_cv_ptr,*e_node); //last_mid->remove();
     last_edge_fragment_it = mid_it;
   }
@@ -1885,7 +1885,7 @@ void Trapezoidal_decomposition_2<Td_traits>::remove(Halfedge_const_handle he)
   //4. remove adjacency at right end point
 
   //remove the final trapezoid representing the removed halfedge
-  e_node = boost::apply_visitor(dag_node_visitor(),*last_edge_fragment_it);
+  e_node = std::visit(dag_node_visitor(),*last_edge_fragment_it);
   deactivate_edge(removed_cv_ptr,*e_node); //last_mid->remove();
 
   //-----------------------------------
@@ -1945,7 +1945,7 @@ vertical_ray_shoot(const Point & p,Locate_type & lt,
        p
        x------x
     */
-    Td_active_trapezoid& tr(boost::get<Td_active_trapezoid>(item));
+    Td_active_trapezoid& tr(std::get<Td_active_trapezoid>(item));
 
     if ((up_direction && !tr.is_on_right_boundary() &&
          (traits->compare_curve_end_x_2_object()
@@ -2637,9 +2637,9 @@ merge_edge(Halfedge_const_handle he1,
   Td_map_item mrgp_item = locate(ce, lt);
 
   //varifying that all trapezoids are not nullptr and are of type POINT
-  CGAL_warning(boost::apply_visitor(dag_node_visitor(), leftp_item) != nullptr);
-  CGAL_warning(boost::apply_visitor(dag_node_visitor(), rightp_item)!= nullptr);
-  CGAL_warning(boost::apply_visitor(dag_node_visitor(), mrgp_item)  != nullptr);
+  CGAL_warning(std::visit(dag_node_visitor(), leftp_item) != nullptr);
+  CGAL_warning(std::visit(dag_node_visitor(), rightp_item)!= nullptr);
+  CGAL_warning(std::visit(dag_node_visitor(), mrgp_item)  != nullptr);
 
   //define the left curve and the right curve, according
   //  to the common point (that is merged)
@@ -2679,8 +2679,8 @@ merge_edge(Halfedge_const_handle he1,
 #endif
 
   //get the nodes of leftmost point and merge point
-  Dag_node& leftp_node = *(boost::apply_visitor(dag_node_visitor(), leftp_item));
-  Dag_node& mrgp_node = *(boost::apply_visitor(dag_node_visitor(), mrgp_item));
+  Dag_node& leftp_node = *(std::visit(dag_node_visitor(), leftp_item));
+  Dag_node& mrgp_node = *(std::visit(dag_node_visitor(), mrgp_item));
 
   //set iterators for below left curve, on left curve & above left curve
   In_face_iterator
@@ -2760,15 +2760,15 @@ merge_edge(Halfedge_const_handle he1,
   merge_if_possible(below_cv_left, below_cv_right);
 
   // mark older trapezoids as inactive - nodes depth are updated here
-  Dag_node* above_cv_right_node(boost::apply_visitor(dag_node_visitor(),
+  Dag_node* above_cv_right_node(std::visit(dag_node_visitor(),
                                                      above_cv_right));
-  Dag_node* above_cv_left_node(boost::apply_visitor(dag_node_visitor(),
+  Dag_node* above_cv_left_node(std::visit(dag_node_visitor(),
                                                     above_cv_left));
   deactivate_trapezoid( *above_cv_right_node, above_cv_left_node);
   //above_cv_right->remove(above_cv_left->dag_node());
-  Dag_node* below_cv_right_node(boost::apply_visitor(dag_node_visitor(),
+  Dag_node* below_cv_right_node(std::visit(dag_node_visitor(),
                                                      below_cv_right));
-  Dag_node* below_cv_left_node(boost::apply_visitor(dag_node_visitor(),
+  Dag_node* below_cv_left_node(std::visit(dag_node_visitor(),
                                                     below_cv_left));
   deactivate_trapezoid( *below_cv_right_node, below_cv_left_node);
   //below_cv_right->remove(below_cv_left->dag_node());
@@ -2788,7 +2788,7 @@ merge_edge(Halfedge_const_handle he1,
   CGAL_assertion(traits->is_td_edge(on_cv_left) &&
                  traits->is_active(on_cv_left));
 
-  Td_active_edge& e_left(boost::get<Td_active_edge>(on_cv_left));
+  Td_active_edge& e_left(std::get<Td_active_edge>(on_cv_left));
   e_left.set_next(on_cv_right);
 
   CGAL_assertion(traits->is_td_edge(on_cv_right) &&
@@ -2830,17 +2830,17 @@ longest_query_path_length_rec(bool minus_inf, Dag_node& min_node,
   if (!minus_inf && !plus_inf) {
     Td_map_item min_node_item(min_node.get_data());
     if (traits->is_fictitious_vertex(min_node_item)) {
-      const Curve_end min_ce(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),min_node_item)));
+      const Curve_end min_ce(*(std::visit(curve_end_for_fict_vertex_visitor(),min_node_item)));
 
       Td_map_item max_node_item(max_node.get_data());
       if (traits->is_fictitious_vertex(max_node_item)) {
-        const Curve_end max_ce(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),max_node_item)));
+        const Curve_end max_ce(*(std::visit(curve_end_for_fict_vertex_visitor(),max_node_item)));
 
         //min-fict, max-fict
         if (!is_end_point_left_low(min_ce, max_ce)) return 0;
       }
       else {
-        const Point& max_p(boost::apply_visitor(point_for_vertex_visitor(),
+        const Point& max_p(std::visit(point_for_vertex_visitor(),
                                                 max_node_item));
 
         //min-fict, max-pt
@@ -2849,18 +2849,18 @@ longest_query_path_length_rec(bool minus_inf, Dag_node& min_node,
       }
     }
     else {
-      const Point& min_p(boost::apply_visitor(point_for_vertex_visitor(),
+      const Point& min_p(std::visit(point_for_vertex_visitor(),
                                               min_node_item));
 
       Td_map_item max_node_item(max_node.get_data());
       if (traits->is_fictitious_vertex(max_node_item)) {
-        const Curve_end max_ce(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),max_node_item)));
+        const Curve_end max_ce(*(std::visit(curve_end_for_fict_vertex_visitor(),max_node_item)));
 
         //min-pt, max-fict
         if (!is_end_point_left_low(min_p, max_ce)) return 0;
       }
       else {
-        const Point& max_p(boost::apply_visitor(point_for_vertex_visitor(),
+        const Point& max_p(std::visit(point_for_vertex_visitor(),
                                                 max_node_item));
 
         //min-pt, max-pt
@@ -2893,19 +2893,19 @@ longest_query_path_length_rec(bool minus_inf, Dag_node& min_node,
   if (!minus_inf) {
     Td_map_item min_node_item(min_node.get_data());
     if (traits->is_fictitious_vertex(min_node_item)) {
-      const Curve_end min_ce(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),min_node_item)));
+      const Curve_end min_ce(*(std::visit(curve_end_for_fict_vertex_visitor(),min_node_item)));
       //if smaller than the point represented by min_node
-      //if ((is_fict_vtx  && is_end_point_left_low(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), min_ce)) ||
-      //    (!is_fict_vtx && is_end_point_left_low(boost::apply_visitor(point_for_vertex_visitor(), curr_item), min_ce) ))
+      //if ((is_fict_vtx  && is_end_point_left_low(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), min_ce)) ||
+      //    (!is_fict_vtx && is_end_point_left_low(std::visit(point_for_vertex_visitor(), curr_item), min_ce) ))
       if (is_end_point_right_top(min_ce, node)) {
         new_min_node = min_node;
       }
     }
     else {
-      const Point& min_p(boost::apply_visitor(point_for_vertex_visitor(),min_node_item));
+      const Point& min_p(std::visit(point_for_vertex_visitor(),min_node_item));
       //if smaller than the point represented by min_node
-      //if ((is_fict_vtx  && is_end_point_left_low(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), min_p)) ||
-      //    (!is_fict_vtx && is_end_point_left_low(boost::apply_visitor(point_for_vertex_visitor(), curr_item), min_p) ))
+      //if ((is_fict_vtx  && is_end_point_left_low(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), min_p)) ||
+      //    (!is_fict_vtx && is_end_point_left_low(std::visit(point_for_vertex_visitor(), curr_item), min_p) ))
       if (is_end_point_right_top(min_p, node)) {
         new_min_node = min_node;
       }
@@ -2917,21 +2917,21 @@ longest_query_path_length_rec(bool minus_inf, Dag_node& min_node,
   if (!plus_inf) {
     Td_map_item max_node_item(max_node.get_data());
     if (traits->is_fictitious_vertex(max_node_item)) {
-      const Curve_end max_ce(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),max_node_item)));
+      const Curve_end max_ce(*(std::visit(curve_end_for_fict_vertex_visitor(),max_node_item)));
       //if larger than the point represented by max_node
-      //if ((is_fict_vtx  && is_end_point_right_top(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), max_ce)) ||
-      //    (!is_fict_vtx && is_end_point_right_top(boost::apply_visitor(point_for_vertex_visitor(), curr_item), max_ce) ))
+      //if ((is_fict_vtx  && is_end_point_right_top(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), max_ce)) ||
+      //    (!is_fict_vtx && is_end_point_right_top(std::visit(point_for_vertex_visitor(), curr_item), max_ce) ))
       if (is_end_point_left_low(max_ce, node))
       {
         new_max_node = max_node;
       }
     }
     else {
-      const Point& max_p(boost::apply_visitor(point_for_vertex_visitor(),
+      const Point& max_p(std::visit(point_for_vertex_visitor(),
                                               max_node_item));
       //if smaller than the point represented by min_node
-      //if ((is_fict_vtx  && is_end_point_right_top(*(boost::apply_visitor(curve_end_for_fict_vertex_visitor(),curr_item)), max_p)) ||
-      //    (!is_fict_vtx && is_end_point_right_top(boost::apply_visitor(point_for_vertex_visitor(), curr_item), max_p) ))
+      //if ((is_fict_vtx  && is_end_point_right_top(*(std::visit(curve_end_for_fict_vertex_visitor(),curr_item)), max_p)) ||
+      //    (!is_fict_vtx && is_end_point_right_top(std::visit(point_for_vertex_visitor(), curr_item), max_p) ))
       if (is_end_point_left_low(max_p, node)) {
         new_max_node = max_node;
       }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
index db555da63f4c..8516cc85be2d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
@@ -19,7 +19,7 @@
 // The macro CGAL_ARR_POINT_LOCATION_VERSION controls which version of the
 // point location is used. Currently two values are supported:
 // 1. Point location with CGAL::Object
-// 2. Point location with std::optional<boost::variant<...> >
+// 2. Point location with std::optional<std::variant<...> >
 // The default value is 2.
 
 #if !defined(CGAL_ARR_POINT_LOCATION_VERSION)
@@ -29,7 +29,7 @@
 #include <CGAL/Object.h>
 
 #include <optional>
-#include <boost/variant.hpp>
+#include <variant>
 
 #ifdef CGAL_CFG_BOOST_VARIANT_SWAP_BUG
 #if CGAL_ARR_POINT_LOCATION_VERSION > 1
@@ -64,7 +64,7 @@ struct Arr_point_location_result {
 #if CGAL_ARR_POINT_LOCATION_VERSION < 2
   typedef CGAL::Object                                   Type;
 #else
-  typedef typename boost::variant<Vertex_const_handle,
+  typedef typename std::variant<Vertex_const_handle,
                                   Halfedge_const_handle,
                                   Face_const_handle>     Type;
 #endif
@@ -73,7 +73,7 @@ struct Arr_point_location_result {
   // This function returns either make_object() or a result_type constructor
   // to generate return values. The Object version takes a dummy template
   // argument, which is needed for the return of the other option, e.g.,
-  // std::optional<boost::variant> >.
+  // std::optional<std::variant> >.
   // In theory a one parameter variant could be returned, but this _could_
   // lead to conversion overhead, and so we rather go for the real type.
   // Overloads for empty returns are also provided.
@@ -99,7 +99,7 @@ struct Arr_point_location_result {
 
   template <typename T>
   static
-  inline const T* assign(const Type* obj) { return boost::get<T>(obj); }
+  inline const T* assign(const Type* obj) { return std::get<T>(obj); }
 #endif // CGAL_ARR_POINT_LOCATION_VERSION < 2
 
   //this one is only to remove warnings in functions
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
index db9b12395f9c..4998f53d6463 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
@@ -27,7 +27,7 @@
 #include <iterator>
 #include <type_traits>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/basic.h>
 #include <CGAL/tags.h>
@@ -185,9 +185,9 @@ class Arr_polycurve_traits_2 :
     OutputIterator operator_impl(const Curve_2& cv, OutputIterator oi,
                                  Arr_all_sides_oblivious_tag) const
     {
-      typedef boost::variant<Point_2, X_monotone_subcurve_2>
+      typedef std::variant<Point_2, X_monotone_subcurve_2>
         Make_x_monotone_subresult;
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
 
       // If the polycurve is empty, return.
@@ -212,7 +212,7 @@ class Arr_polycurve_traits_2 :
       for (auto its = cv.subcurves_begin(); its != cv.subcurves_end(); ++its)
         make_seg_x_monotone(*its, std::back_inserter(x_seg_objects));
       auto it = x_seg_objects.begin();
-      const auto* x_seg_p = boost::get<X_monotone_subcurve_2>(&(*it));
+      const auto* x_seg_p = std::get<X_monotone_subcurve_2>(&(*it));
 #if ! defined (CGAL_NO_ASSERTIONS)
       CGAL_assertion(x_seg_p != nullptr);
 #endif
@@ -260,7 +260,7 @@ class Arr_polycurve_traits_2 :
 #endif
 
       for (++it; it != x_seg_objects.end(); ++it) {
-        const auto* x_seg_p = boost::get<X_monotone_subcurve_2>(&(*it));
+        const auto* x_seg_p = std::get<X_monotone_subcurve_2>(&(*it));
 #if ! defined (CGAL_NO_ASSERTIONS)
         CGAL_assertion(x_seg_p != nullptr);
 #endif
@@ -318,9 +318,9 @@ class Arr_polycurve_traits_2 :
     OutputIterator operator_impl(const Curve_2& cv, OutputIterator oi,
                                  Arr_not_all_sides_oblivious_tag) const
     {
-      typedef boost::variant<Point_2, X_monotone_subcurve_2>
+      typedef std::variant<Point_2, X_monotone_subcurve_2>
         Make_x_monotone_subresult;
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
 
       // If the polycurve is empty, return.
@@ -350,7 +350,7 @@ class Arr_polycurve_traits_2 :
       for (auto its = cv.subcurves_begin(); its != cv.subcurves_end(); ++its)
         make_seg_x_monotone(*its, std::back_inserter(x_seg_objects));
       auto it = x_seg_objects.begin();
-      const auto* x_seg_p = boost::get<X_monotone_subcurve_2>(&(*it));
+      const auto* x_seg_p = std::get<X_monotone_subcurve_2>(&(*it));
 #if ! defined (CGAL_NO_ASSERTIONS)
       CGAL_assertion(x_seg_p != nullptr);
 #endif
@@ -398,7 +398,7 @@ class Arr_polycurve_traits_2 :
 #endif
 
       for (++it; it != x_seg_objects.end(); ++it) {
-        const auto* x_seg_p = boost::get<X_monotone_subcurve_2>(&(*it));
+        const auto* x_seg_p = std::get<X_monotone_subcurve_2>(&(*it));
 #if ! defined (CGAL_NO_ASSERTIONS)
         CGAL_assertion(x_seg_p != nullptr);
 #endif
@@ -696,9 +696,9 @@ class Arr_polycurve_traits_2 :
                OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>        Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_subcurve_2>
+      typedef std::variant<Intersection_point, X_monotone_subcurve_2>
                                                       Intersection_base_result;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                       Intersection_result;
 
       const Subcurve_traits_2* geom_traits = m_poly_traits.subcurve_traits_2();
@@ -824,7 +824,7 @@ class Arr_polycurve_traits_2 :
           intersect(cv1[i1], cv2[i2], std::back_inserter(xections));
           for (const auto& xection : xections) {
             const X_monotone_subcurve_2* subcv_p =
-              boost::get<X_monotone_subcurve_2>(&xection);
+              std::get<X_monotone_subcurve_2>(&xection);
             if (subcv_p != nullptr) {
               ocv.push_back(*subcv_p);
               oi = output_ocv (ocv, invert_ocv, oi);
@@ -832,7 +832,7 @@ class Arr_polycurve_traits_2 :
             }
 
             const Intersection_point* p_p =
-              boost::get<Intersection_point>(&xection);
+              std::get<Intersection_point>(&xection);
             if (p_p != nullptr) *oi++ = Intersection_result(*p_p);
           }
         }
@@ -846,7 +846,7 @@ class Arr_polycurve_traits_2 :
 
           for (const auto& item : sub_xections) {
             const X_monotone_subcurve_2* x_seg =
-              boost::get<X_monotone_subcurve_2>(&item);
+              std::get<X_monotone_subcurve_2>(&item);
             if (x_seg != nullptr) {
               X_monotone_subcurve_2 seg = *x_seg;
               // We maintain the variant that if the input curves have opposite
@@ -863,7 +863,7 @@ class Arr_polycurve_traits_2 :
             }
 
             const Intersection_point* p_ptr =
-              boost::get<Intersection_point>(&item);
+              std::get<Intersection_point>(&item);
             if (p_ptr != nullptr) {
               // Any point that is not equal to the max_vertex of the
               // subcurve should be inserted into oi.
@@ -990,7 +990,7 @@ class Arr_polycurve_traits_2 :
     (std::vector<X_monotone_subcurve_2>& ocv, bool invert_ocv, OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>        Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                       Intersection_result;
       X_monotone_curve_2 curve;
       if (invert_ocv)
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
index da8875c47681..bb418c5d87ba 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
@@ -2038,7 +2038,7 @@ class Continuous_rational_arc_d_1:
   OutputIterator intersect(const Self& arc, OutputIterator oi,
                            const Cache& cache) const
   {
-    typedef boost::variant<Intersection_point, Self>    Intersection_result;
+    typedef std::variant<Intersection_point, Self>    Intersection_result;
 
     CGAL_precondition(this->is_valid());
     CGAL_precondition(this->is_continuous());
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_rational_function_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_rational_function_traits_2.h
index 6e775b4917f9..f908224fe265 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_rational_function_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_rational_function_traits_2.h
@@ -827,7 +827,7 @@ class Arr_rational_function_traits_2
     template <typename OutputIterator>
     OutputIterator operator()(const Curve_2& cv, OutputIterator oi) const
     {
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
 
       // Make the rational arc continuous.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h
index 1e3b908faa6e..b34649af583e 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h
@@ -25,7 +25,7 @@
 
 #include <fstream>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 #include <CGAL/tags.h>
@@ -565,7 +565,7 @@ class Arr_segment_traits_2 : public Kernel_ {
     OutputIterator operator()(const Curve_2& cv, OutputIterator oi) const
     {
       // Wrap the segment with a variant.
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
       *oi++ = Make_x_monotone_result(cv);
       return oi;
@@ -705,7 +705,7 @@ class Arr_segment_traits_2 : public Kernel_ {
                               OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
 
       // Early ending with Bbox overlapping test
@@ -723,7 +723,7 @@ class Arr_segment_traits_2 : public Kernel_ {
       CGAL_assertion(bool(res));
 
       // Check if we have a single intersection point.
-      const Point_2* ip = boost::get<Point_2>(&*res);
+      const Point_2* ip = std::get<Point_2>(&*res);
       if (ip != nullptr) {
         CGAL_assertion(cv1.is_vertical() ?
                        m_traits.is_in_y_range_2_object()(cv1, *ip) :
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_spherical_gaussian_map_3.h b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_spherical_gaussian_map_3.h
index 54264ab18e6c..a042f80a5845 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_spherical_gaussian_map_3.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_spherical_gaussian_map_3.h
@@ -154,14 +154,14 @@ class Arr_sgm_initializer {
   OutputIterator insert(const Vector_3 & normal1, const Vector_3 & normal2,
                         OutputIterator oi)
   {
-    typedef boost::variant<Point_2, X_monotone_curve_2>
+    typedef std::variant<Point_2, X_monotone_curve_2>
       Make_x_monotone_result;
 
     std::list<Make_x_monotone_result> x_objects;
     make_x_monotone(normal1, normal2, std::back_inserter(x_objects));
 
     auto it = x_objects.begin();
-    const auto* xc = boost::get<X_monotone_curve_2>(&(*it));
+    const auto* xc = std::get<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "1.a. insert_in_face_interior(" << *xc << ")" << std::endl;
 #endif
@@ -172,7 +172,7 @@ class Arr_sgm_initializer {
     ++it;
     if (it == x_objects.end()) return oi;
 
-    xc = boost::get<X_monotone_curve_2>(&(*it));
+    xc = std::get<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "1.b. insert_from_vertex(" << *xc << ")" << std::endl;
 #endif
@@ -195,14 +195,14 @@ class Arr_sgm_initializer {
                         const Vector_3 & normal2,
                         OutputIterator oi)
   {
-    typedef boost::variant<Point_2, X_monotone_curve_2>
+    typedef std::variant<Point_2, X_monotone_curve_2>
       Make_x_monotone_result;
 
     std::list<Make_x_monotone_result> x_objects;
     make_x_monotone(normal1, normal2, std::back_inserter(x_objects));
 
     auto it = x_objects.begin();
-    const auto* xc = boost::get<X_monotone_curve_2>(&(*it));
+    const auto* xc = std::get<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "2.a. insert_from_vertex(" << *xc << ", "
               << vertex1->point() << ")" << std::endl;
@@ -216,7 +216,7 @@ class Arr_sgm_initializer {
     ++it;
     if (it == x_objects.end()) return oi;
 
-    xc = boost::get<X_monotone_curve_2>(&(*it));
+    xc = std::get<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "2.b. insert_from_vertex(" << *xc << ")" << std::endl;
 #endif
@@ -239,7 +239,7 @@ class Arr_sgm_initializer {
                         const Vector_3 & normal2, Vertex_handle vertex2,
                         OutputIterator oi)
   {
-    typedef boost::variant<Point_2, X_monotone_curve_2>
+    typedef std::variant<Point_2, X_monotone_curve_2>
       Make_x_monotone_result;
 
     std::list<Make_x_monotone_result> x_objects;
@@ -247,7 +247,7 @@ class Arr_sgm_initializer {
 
     auto it = x_objects.begin();
     if (x_objects.size() == 1) {
-      const auto* xc = boost::get<X_monotone_curve_2>(&(*it));
+      const auto* xc = std::get<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
       std::cout << "3. insert_from_vertex(" << *xc << ")" << std::endl;
 #endif
@@ -258,8 +258,8 @@ class Arr_sgm_initializer {
       return oi;
     }
 
-    const X_monotone_curve_2* xc1 = boost::get<X_monotone_curve_2>(&(*it++));
-    const X_monotone_curve_2* xc2 = boost::get<X_monotone_curve_2>(&(*it));
+    const X_monotone_curve_2* xc1 = std::get<X_monotone_curve_2>(&(*it++));
+    const X_monotone_curve_2* xc2 = std::get<X_monotone_curve_2>(&(*it));
 
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "3.a. insert_from_vertex(" << *xc2 << ")" << std::endl;
@@ -294,13 +294,13 @@ class Arr_sgm_initializer {
                         const Vector_3 & normal2, Vertex_handle vertex2,
                         OutputIterator oi)
   {
-    typedef boost::variant<Point_2, X_monotone_curve_2>
+    typedef std::variant<Point_2, X_monotone_curve_2>
       Make_x_monotone_result;
     std::list<Make_x_monotone_result> x_objects;
     make_x_monotone(normal1, normal2, std::back_inserter(x_objects));
     auto it = x_objects.begin();
     if (x_objects.size() == 1) {
-      const auto* xc = boost::get<X_monotone_curve_2>(&(*it));
+      const auto* xc = std::get<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
       std::cout << "4. insert_at_vertices(" << *xc << ")" << std::endl;
 #endif
@@ -308,8 +308,8 @@ class Arr_sgm_initializer {
       return oi;
     }
 
-    const X_monotone_curve_2 * xc1 = boost::get<X_monotone_curve_2>(&(*it++));
-    const X_monotone_curve_2 * xc2 = boost::get<X_monotone_curve_2>(&(*it));
+    const X_monotone_curve_2 * xc1 = std::get<X_monotone_curve_2>(&(*it++));
+    const X_monotone_curve_2 * xc2 = std::get<X_monotone_curve_2>(&(*it));
 
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "4.a. insert_from_vertex(" << *xc1
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_transform_on_sphere.h b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_transform_on_sphere.h
index 5116ef4ca45e..78eb6bc2f473 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_transform_on_sphere.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_transform_on_sphere.h
@@ -46,7 +46,7 @@ void Arr_transform_on_sphere(Arrangement & arr,
   typedef typename Arrangement::Halfedge_around_vertex_circulator
     Halfedge_around_vertex_circulator;
 
-  typedef boost::variant<Point_2, X_monotone_curve_2>     Make_x_monotone_result;
+  typedef std::variant<Point_2, X_monotone_curve_2>     Make_x_monotone_result;
 
   const Geometry_traits_2 * geom_traits = arr.geometry_traits();
   Topology_traits * topol_traits = arr.topology_traits();
@@ -156,10 +156,10 @@ void Arr_transform_on_sphere(Arrangement & arr,
       auto it = objects.begin();
 
       // The curve that its left vertex lies on the identification curve
-      const auto* sub_cv1 = boost::get<X_monotone_curve_2>(&(*it));
+      const auto* sub_cv1 = std::get<X_monotone_curve_2>(&(*it));
       ++it;
       //The curve that its right vertex lies on the identification curve
-      const auto* sub_cv2 = boost::get<X_monotone_curve_2>(&(*it));
+      const auto* sub_cv2 = std::get<X_monotone_curve_2>(&(*it));
 
       bool eq1 = (*sub_cv1).source() == hei1->source()->point();
       bool eq2 = (*sub_cv2).target() == hei1->target()->point();
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
index 97e451bda5f9..edb2a63f9956 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
@@ -506,7 +506,7 @@ class Arr_spherical_topology_traits_2 {
    * \pre The curve has a boundary condition in either x or y.
    * \return An object that contains the curve end.
    */
-  std::optional<boost::variant<Vertex*, Halfedge*> >
+  std::optional<std::variant<Vertex*, Halfedge*> >
   place_boundary_vertex(Face* f,
                         const X_monotone_curve_2& xc,
                         Arr_curve_end ind,
@@ -538,7 +538,7 @@ class Arr_spherical_topology_traits_2 {
    * \pre The curve end is incident to the boundary.
    * \return An object that contains the curve end.
    */
-  boost::variant<Vertex*, Halfedge*, Face*>
+  std::variant<Vertex*, Halfedge*, Face*>
   locate_curve_end(const X_monotone_curve_2& xc, Arr_curve_end ce,
                    Arr_parameter_space ps_x,
                    Arr_parameter_space ps_y);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_bounded_planar_vert_decomp_helper.h b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_bounded_planar_vert_decomp_helper.h
index b9f94fd92fcf..ba76651f9d77 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_bounded_planar_vert_decomp_helper.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_bounded_planar_vert_decomp_helper.h
@@ -47,7 +47,7 @@ class Arr_bounded_planar_vert_decomp_helper {
   typedef typename Arrangement_2::Face_const_handle     Face_const_handle;
   typedef typename Arrangement_2::Topology_traits       Topology_traits;
 
-  typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
+  typedef std::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>             Cell_type;
   typedef std::optional<Cell_type>                    Vert_type;
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h
index ef4da091be75..34149d15af30 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_topology_traits_2_impl.h
@@ -572,7 +572,7 @@ let_me_decide_the_outer_ccb(std::pair< CGAL::Sign, CGAL::Sign> signs1,
  */
 template <typename GeomTraits, typename Dcel>
 std::optional
-  <boost::variant
+  <std::variant
     <typename Arr_spherical_topology_traits_2<GeomTraits, Dcel>::Vertex*,
      typename Arr_spherical_topology_traits_2<GeomTraits, Dcel>::Halfedge*> >
 Arr_spherical_topology_traits_2<GeomTraits, Dcel>::
@@ -585,7 +585,7 @@ place_boundary_vertex(Face* /* f */,
                       ,
                       Arr_parameter_space ps_y)
 {
-  typedef boost::variant<Vertex*, Halfedge*>    Non_optional_result;
+  typedef std::variant<Vertex*, Halfedge*>    Non_optional_result;
   typedef std::optional<Non_optional_result>  Result;
 
   // std::cout << "place_boundary_vertex()" << std::endl;
@@ -647,7 +647,7 @@ locate_around_boundary_vertex(Vertex* v,
 
 /*! \brief locates a DCEL feature that contains a given curve end. */
 template <typename GeomTraits, typename Dcel>
-boost::variant
+std::variant
 <typename Arr_spherical_topology_traits_2<GeomTraits, Dcel>::Vertex*,
  typename Arr_spherical_topology_traits_2<GeomTraits, Dcel>::Halfedge*,
  typename Arr_spherical_topology_traits_2<GeomTraits, Dcel>::Face*>
@@ -660,7 +660,7 @@ locate_curve_end(const X_monotone_curve_2& xc, Arr_curve_end ind,
                  ,
                  Arr_parameter_space ps_y)
 {
-  typedef boost::variant<Vertex*, Halfedge*, Face*>     Result;
+  typedef std::variant<Vertex*, Halfedge*, Face*>     Result;
   // Act according to the boundary conditions.
   if (ps_y == ARR_TOP_BOUNDARY) {
     // In case the curve end coincides with the north pole, return the vertex
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_vert_decomp_helper.h b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_vert_decomp_helper.h
index f83aab57b858..931359c3f116 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_vert_decomp_helper.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_spherical_vert_decomp_helper.h
@@ -48,7 +48,7 @@ class Arr_spherical_vert_decomp_helper {
   typedef typename Arrangement_2::Halfedge_const_handle Halfedge_const_handle;
   typedef typename Arrangement_2::Face_const_handle     Face_const_handle;
 
-  typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
+  typedef std::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>             Cell_type;
   typedef std::optional<Cell_type>                    Vert_type;
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_topology_traits_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_topology_traits_2_impl.h
index f9c7f957c34a..2736919a601f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_topology_traits_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_topology_traits_2_impl.h
@@ -297,7 +297,7 @@ are_equal(const Vertex *v,
 //
 template <typename GeomTraits, typename Dcel_>
 std::optional
-  <boost::variant
+  <std::variant
     <typename Arr_unb_planar_topology_traits_2<GeomTraits, Dcel_>::Vertex*,
      typename Arr_unb_planar_topology_traits_2<GeomTraits, Dcel_>::Halfedge*> >
 Arr_unb_planar_topology_traits_2<GeomTraits, Dcel_>::
@@ -305,7 +305,7 @@ place_boundary_vertex(Face* f,
                       const X_monotone_curve_2& cv, Arr_curve_end ind,
                       Arr_parameter_space ps_x, Arr_parameter_space ps_y)
 {
-  typedef boost::variant<Vertex*, Halfedge*>    Non_optional_result;
+  typedef std::variant<Vertex*, Halfedge*>    Non_optional_result;
   typedef std::optional<Non_optional_result>  Result;
 
   // Get a halfedge on the outer CCB of f and start traversing the CCB.
@@ -338,7 +338,7 @@ place_boundary_vertex(Face* f,
 // Locate a DCEL feature that contains the given unbounded curve end.
 //
 template <typename GeomTraits, typename Dcel_>
-boost::variant
+std::variant
 <typename Arr_unb_planar_topology_traits_2<GeomTraits, Dcel_>::Vertex*,
  typename Arr_unb_planar_topology_traits_2<GeomTraits, Dcel_>::Halfedge*,
  typename Arr_unb_planar_topology_traits_2<GeomTraits, Dcel_>::Face*>
@@ -346,7 +346,7 @@ Arr_unb_planar_topology_traits_2<GeomTraits, Dcel_>::
 locate_curve_end (const X_monotone_curve_2& cv, Arr_curve_end ind,
                   Arr_parameter_space ps_x, Arr_parameter_space ps_y)
 {
-  typedef boost::variant<Vertex*, Halfedge*, Face*>     Result;
+  typedef std::variant<Vertex*, Halfedge*, Face*>     Result;
 
   // Start traversing the inner CCB of the fictitious face and try to locate
   // a feature that contains the curve end.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_vert_decomp_helper.h b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_vert_decomp_helper.h
index befc27bb89f0..2b0abaceb4bd 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_vert_decomp_helper.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_topology_traits/Arr_unb_planar_vert_decomp_helper.h
@@ -46,7 +46,7 @@ class Arr_unb_planar_vert_decomp_helper {
   typedef typename Arrangement_2::Halfedge_const_handle Halfedge_const_handle;
   typedef typename Arrangement_2::Face_const_handle     Face_const_handle;
 
-  typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
+  typedef std::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>             Cell_type;
   typedef std::optional<Cell_type>                    Vert_type;
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h
index f631bef376ad..06f095fb54c4 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h
@@ -26,7 +26,7 @@
 #include <iostream>
 #include <list>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/basic.h>
 #include <CGAL/Arr_enums.h>
@@ -531,7 +531,7 @@ class Arr_tracing_traits_2 : public Base_traits {
       std::cout << "make_x_monotone" << std::endl
                 << "  cv: " << cv << std::endl;
 
-      typedef boost::variant<Point_2, X_monotone_curve_2>
+      typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
 
       std::list<Make_x_monotone_result> container;
@@ -540,12 +540,12 @@ class Arr_tracing_traits_2 : public Base_traits {
 
       size_t i = 0;
       for (auto it = container.begin(); it != container.end(); ++it) {
-        if (const auto* xcv = boost::get<X_monotone_curve_2>(&*it)) {
+        if (const auto* xcv = std::get<X_monotone_curve_2>(&*it)) {
           std::cout << "  result[" << i++ << "]: xcv: " << *xcv << std::endl;
           continue;
         }
 
-        if (const auto* p = boost::get<Point_2>(&*it)) {
+        if (const auto* p = std::get<Point_2>(&*it)) {
           std::cout << "  result[" << i++ << "]: p: " << *p << std::endl;
           continue;
         }
@@ -618,7 +618,7 @@ class Arr_tracing_traits_2 : public Base_traits {
                               OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
 
       if (! m_enabled) return m_object(xcv1, xcv2, oi);
@@ -632,13 +632,13 @@ class Arr_tracing_traits_2 : public Base_traits {
 
       unsigned int i = 0;
       for (const auto& item : container) {
-        const X_monotone_curve_2* xcv = boost::get<X_monotone_curve_2>(&item);
+        const X_monotone_curve_2* xcv = std::get<X_monotone_curve_2>(&item);
         if (xcv != nullptr) {
           std::cout << "  result[" << i++ << "]: xcv: " << *xcv << std::endl;
           continue;
         }
 
-        const Intersection_point* ip = boost::get<Intersection_point>(&item);
+        const Intersection_point* ip = std::get<Intersection_point>(&item);
         if (ip != nullptr) {
           std::cout << "  result[" << i++ << "]: p: " << ip->first
                     << ", multiplicity: " << ip->second << std::endl;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
index 86df601c06ad..cfe427625df3 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
@@ -291,7 +291,7 @@ class Arr_unb_planar_topology_traits_2 :
    * \return An object that contains the curve end.
    *         In our case this object always wraps a fictitious edge.
    */
-  std::optional<boost::variant<Vertex*, Halfedge*> >
+  std::optional<std::variant<Vertex*, Halfedge*> >
   place_boundary_vertex(Face* f,
                         const X_monotone_curve_2& cv,
                         Arr_curve_end ind,
@@ -330,7 +330,7 @@ class Arr_unb_planar_topology_traits_2 :
    *         In our case this object may either wrap an unbounded face,
    *         or an edge with an end-vertex at infinity (in case of an overlap).
    */
-  boost::variant<Vertex*, Halfedge*, Face*>
+  std::variant<Vertex*, Halfedge*, Face*>
   locate_curve_end(const X_monotone_curve_2& cv,
                    Arr_curve_end ind,
                    Arr_parameter_space ps_x,
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_compute_zone_visitor.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_compute_zone_visitor.h
index 27f1a980debc..2abcd426bf4d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_compute_zone_visitor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_compute_zone_visitor.h
@@ -20,7 +20,7 @@
  * Definition of the Arr_compute_zone_visitor class.
  */
 
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 
@@ -55,7 +55,7 @@ class Arr_compute_zone_visitor
   const Vertex_handle        invalid_v;    // Invalid vertex.
 
   OutputIterator&            out_iter;     // for outputting the zone objects.
-                                           // Its value type is boost::variant.
+                                           // Its value type is std::variant.
   bool                       output_left;  // Determines whether we should
                                            // output the left end point of a
                                            // subcurve (to avoid outputting
@@ -97,7 +97,7 @@ class Arr_compute_zone_visitor
                         Vertex_handle left_v, Halfedge_handle left_he,
                         Vertex_handle right_v, Halfedge_handle right_he)
   {
-    typedef boost::variant<Vertex_handle, Halfedge_handle, Face_handle>
+    typedef std::variant<Vertex_handle, Halfedge_handle, Face_handle>
                                                                 Zone_result;
 
     if (output_left) {
@@ -138,7 +138,7 @@ class Arr_compute_zone_visitor
                         Halfedge_handle he,
                         Vertex_handle left_v, Vertex_handle right_v)
   {
-    typedef boost::variant<Vertex_handle, Halfedge_handle, Face_handle>
+    typedef std::variant<Vertex_handle, Halfedge_handle, Face_handle>
                                                                 Zone_result;
 
     if (output_left) {
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h
index d98f1c1307c0..9c74e4ef9d71 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h
@@ -643,7 +643,7 @@ class Arr_traits_basic_adaptor_2 : public ArrangementBasicTraits_ {
                            Tag_false) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
       std::list<Intersection_result> intersections;
       m_self->intersect_2_object()(xcv1, xcv2, back_inserter(intersections));
@@ -3370,7 +3370,7 @@ class Arr_traits_adaptor_2 :
    */
   class Compare_xy_2 {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
 
   public:
@@ -3580,7 +3580,7 @@ class Arr_traits_adaptor_2 :
       // Verify the first intersection is an overlap, remove it, and
       // recursively call.
       const X_monotone_curve_2* xcv =
-        boost::get<X_monotone_curve_2>(&(intersections.front()));
+        std::get<X_monotone_curve_2>(&(intersections.front()));
       if (! xcv) {
         CGAL_error_msg("The first intersection is not an overlap!");
         return SMALLER;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
index c39c34099a53..0338b67e73e7 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
@@ -83,7 +83,7 @@ void insert(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 
   typedef typename Gt2::Point_2                         Point_2;
   typedef typename Gt2::X_monotone_curve_2              X_monotone_curve_2;
-  typedef boost::variant<Point_2, X_monotone_curve_2>   Make_x_monotone_result;
+  typedef std::variant<Point_2, X_monotone_curve_2>   Make_x_monotone_result;
 
   // Obtain an arrangement accessor.
   Arr_accessor<Arr> arr_access(arr);
@@ -100,7 +100,7 @@ void insert(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
   // Insert each x-monotone curve into the arrangement.
   for (const auto& x_obj : x_objects) {
     // Act according to the type of the current object.
-    const auto* x_curve = boost::get<X_monotone_curve_2>(&x_obj);
+    const auto* x_curve = std::get<X_monotone_curve_2>(&x_obj);
     if (x_curve != nullptr) {
       // Inserting an x-monotone curve:
       // Initialize the zone-computation object with the given curve.
@@ -118,7 +118,7 @@ void insert(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
       arr_access.notify_after_global_change();
       continue;
     }
-    const auto* iso_p = boost::get<Point_2>(&x_obj);
+    const auto* iso_p = std::get<Point_2>(&x_obj);
     CGAL_assertion(iso_p != nullptr);
 
     // Inserting a point into the arrangement:
@@ -683,7 +683,7 @@ insert_non_intersecting_curve
 
     // The endpoint must not lie on an existing edge, but may coincide with
     // and existing vertex vh1.
-    CGAL_precondition_msg(boost::get<Halfedge_const_handle>(&obj1) == nullptr,
+    CGAL_precondition_msg(std::get<Halfedge_const_handle>(&obj1) == nullptr,
                           "The curve must not intersect an existing edge.");
 
   }
@@ -691,7 +691,7 @@ insert_non_intersecting_curve
     // We have a left end with boundary conditions. Use the accessor to locate
     // the feature that contains it.
     obj1 = arr_access.locate_curve_end(c, ARR_MIN_END, bx1, by1);
-    CGAL_precondition_msg(boost::get<Halfedge_const_handle>(&obj1) == nullptr,
+    CGAL_precondition_msg(std::get<Halfedge_const_handle>(&obj1) == nullptr,
                           "The curve must not overlap an existing edge.");
   }
   vh1 = Pl_result::template assign<Vertex_const_handle>(&obj1);
@@ -710,7 +710,7 @@ insert_non_intersecting_curve
 
     // The endpoint must not lie on an existing edge, but may coincide with
     // and existing vertex vh2.
-    CGAL_precondition_msg(boost::get<Halfedge_const_handle>(&obj2) == nullptr,
+    CGAL_precondition_msg(std::get<Halfedge_const_handle>(&obj2) == nullptr,
                           "The curve must not intersect an existing edge.");
   }
   else {
@@ -721,7 +721,7 @@ insert_non_intersecting_curve
     //           << ", by2: " << by2
     //           << std::endl;
     obj2 = arr_access.locate_curve_end(c, ARR_MAX_END, bx2, by2);
-    CGAL_precondition_msg(boost::get<Halfedge_const_handle>(&obj2) == nullptr,
+    CGAL_precondition_msg(std::get<Halfedge_const_handle>(&obj2) == nullptr,
                           "The curve must not overlap an existing edge.");
   }
   vh2 = Pl_result::template assign<Vertex_const_handle>(&obj2);
@@ -766,8 +766,8 @@ insert_non_intersecting_curve
       // we must insert the curve in the interior of a face.
       // In this case insert_in_face_interior() already returns a halfedge
       // directed from left to right.
-      const Face_const_handle* fh1 = boost::get<Face_const_handle>(&obj1);
-      const Face_const_handle* fh2 = boost::get<Face_const_handle>(&obj2);
+      const Face_const_handle* fh1 = std::get<Face_const_handle>(&obj1);
+      const Face_const_handle* fh2 = std::get<Face_const_handle>(&obj2);
 
       // std::cout << arr << std::endl;
       // std::cout << "(*fh1)->number_of_outer_ccbs(): "
@@ -1144,14 +1144,14 @@ insert_point(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 
   arr_access.notify_before_global_change();
 
-  const Face_const_handle* fh = boost::get<Face_const_handle>(&obj);
+  const Face_const_handle* fh = std::get<Face_const_handle>(&obj);
   if (fh != nullptr) {
     // p lies inside a face: Insert it as an isolated vertex it the interior of
     // this face.
     vh_for_p = arr.insert_in_face_interior(p, arr.non_const_handle(*fh));
   }
   else {
-    const Halfedge_const_handle* hh = boost::get<Halfedge_const_handle>(&obj);
+    const Halfedge_const_handle* hh = std::get<Halfedge_const_handle>(&obj);
     if (hh != nullptr) {
       // p lies in the interior of an edge: Split this edge to create a new
       // vertex associated with p.
@@ -1167,7 +1167,7 @@ insert_point(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
     }
     else {
       // p lies on an existing vertex, so we just update this vertex.
-      const Vertex_const_handle* vh = boost::get<Vertex_const_handle>(&obj);
+      const Vertex_const_handle* vh = std::get<Vertex_const_handle>(&obj);
       CGAL_assertion(vh != nullptr);
       vh_for_p = arr.modify_vertex (arr.non_const_handle (*vh), p);
     }
@@ -1381,14 +1381,14 @@ is_valid(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr)
     auto obj = def_pl.ray_shoot_down(curr_v->point());
 
     // if (CGAL::assign(he_below, obj)) {
-    if (auto* he_below_p = boost::get<Halfedge_const_handle>(&obj)) {
+    if (auto* he_below_p = std::get<Halfedge_const_handle>(&obj)) {
       // Hit an edge; take the incident face of the halfedge directed to the
       // right.
       auto he_below = *he_below_p;
       in_face = (he_below->direction() == ARR_RIGHT_TO_LEFT) ?
         he_below->twin()->face() : he_below->face();
     }
-    else if (auto* v_below_p = boost::get<Vertex_const_handle>(&obj)) {
+    else if (auto* v_below_p = std::get<Vertex_const_handle>(&obj)) {
       auto v_below = *v_below_p;
       // Hit a vertex.
       if (v_below->is_isolated()) in_face = v_below->face();
@@ -1446,7 +1446,7 @@ is_valid(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr)
       }
     }
     else {
-      auto* in_face_p = boost::get<Face_const_handle>(&obj);
+      auto* in_face_p = std::get<Face_const_handle>(&obj);
       CGAL_assertion(in_face_p);
       in_face = *in_face_p;
       // Hit nothing (an unbounded face is returned).
@@ -1584,7 +1584,7 @@ do_intersect(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 
   typedef typename Gt2::Point_2                         Point_2;
   typedef typename Gt2::X_monotone_curve_2              X_monotone_curve_2;
-  typedef boost::variant<Point_2, X_monotone_curve_2>   Make_x_monotone_result;
+  typedef std::variant<Point_2, X_monotone_curve_2>   Make_x_monotone_result;
   typedef typename Arr::Face_const_handle               Face_const_handle;
 
   const Traits_adaptor_2* traits =
@@ -1596,20 +1596,20 @@ do_intersect(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
   // Insert each x-monotone curve into the arrangement.
   for (const auto& x_obj : x_objects) {
     // Act according to the type of the current object.
-    const X_monotone_curve_2* x_curve = boost::get<X_monotone_curve_2>(&x_obj);
+    const X_monotone_curve_2* x_curve = std::get<X_monotone_curve_2>(&x_obj);
     if (x_curve != nullptr) {
       // Check if the x-monotone subcurve intersects the arrangement.
       if (do_intersect(arr, *x_curve, pl) == true) return true;
       continue;
     }
 
-    const Point_2* iso_p = boost::get<Point_2>(&x_obj);
+    const Point_2* iso_p = std::get<Point_2>(&x_obj);
     CGAL_assertion(iso_p != nullptr);
 
     // Check whether the isolated point lies inside a face (otherwise,
     // it coincides with a vertex or an edge).
     auto obj = pl.locate(*iso_p);
-    if (boost::get<Face_const_handle>(&x_obj) != nullptr) return true;
+    if (std::get<Face_const_handle>(&x_obj) != nullptr) return true;
   }
 
   // If we reached here, the curve does not intersect the arrangement.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h
index 78e0850352dc..cbadba8f07ac 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h
@@ -31,7 +31,7 @@
  * class-template.
  */
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/function_objects.h>
 #include <CGAL/use.h>
@@ -2253,7 +2253,7 @@ _place_and_set_curve_end(DFace* f,
     return v;
   }
 
-  DHalfedge** fict_he_p = boost::get<DHalfedge*>(&*obj);
+  DHalfedge** fict_he_p = std::get<DHalfedge*>(&*obj);
   if (fict_he_p != nullptr) {
     DHalfedge* fict_he = *fict_he_p;
     CGAL_assertion(fict_he != nullptr);
@@ -2273,7 +2273,7 @@ _place_and_set_curve_end(DFace* f,
                                         Halfedge_handle((*p_pred)->next()));
     return v;
   }
-  DVertex** v_p = boost::get<DVertex*>(&*obj);
+  DVertex** v_p = std::get<DVertex*>(&*obj);
   CGAL_assertion(v_p != nullptr);
   DVertex* v = *v_p;
   CGAL_assertion(v != nullptr);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
index feb429273eec..484f2a46efe4 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
@@ -103,7 +103,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
   const Vertex_const_handle* vh;
   const Halfedge_const_handle* hh;
 
-  if ((vh = boost::get<Vertex_const_handle>(&m_obj)) != nullptr) {
+  if ((vh = std::get<Vertex_const_handle>(&m_obj)) != nullptr) {
     CGAL_assertion(m_has_left_pt);
 
     // The left endpoint coincides with an existing vertex:
@@ -125,7 +125,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
 #endif
 
   }
-  else if ((hh = boost::get<Halfedge_const_handle>(&m_obj)) != nullptr) {
+  else if ((hh = std::get<Halfedge_const_handle>(&m_obj)) != nullptr) {
     if (m_has_left_pt) {
       // Obtain the right halfedge from the halfedge-pair containing m_left_pt
       // in their interior.
@@ -139,7 +139,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
         // Compute the overlapping subcurve.
         bool dummy;
         auto obj = _compute_next_intersection(m_intersect_he, false, dummy);
-        m_overlap_cv = boost::get<X_monotone_curve_2>(*obj);
+        m_overlap_cv = std::get<X_monotone_curve_2>(*obj);
 
         // Remove the overlap from the map.
         _remove_next_intersection(m_intersect_he);
@@ -155,7 +155,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
 
       bool dummy;
       auto obj = _compute_next_intersection(m_intersect_he, false, dummy);
-      m_overlap_cv = boost::get<X_monotone_curve_2>(*obj);
+      m_overlap_cv = std::get<X_monotone_curve_2>(*obj);
 
       // Remove the overlap from the map.
       _remove_next_intersection(m_intersect_he);
@@ -166,7 +166,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
   }
   else {
     // The left endpoint lies inside a face.
-    const Face_const_handle* fh = boost::get<Face_const_handle>(&m_obj);
+    const Face_const_handle* fh = std::get<Face_const_handle>(&m_obj);
 
     CGAL_assertion_msg(fh != nullptr,
                        "Invalid object returned by the point-location query.");
@@ -213,7 +213,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
         // Compute the overlapping subcurve to the right of curr_v.
         bool dummy;
         auto obj = _compute_next_intersection(m_intersect_he, false, dummy);
-        m_overlap_cv = boost::get<X_monotone_curve_2>(*obj);
+        m_overlap_cv = std::get<X_monotone_curve_2>(*obj);
 
         // Remove the overlap from the map.
         _remove_next_intersection(m_intersect_he);
@@ -546,7 +546,7 @@ _compute_next_intersection(Halfedge_handle he,
     // (if the left point exists).
     while (! inter_list.empty()) {
       // Compare that current object with m_left_pt (if exists).
-      ip = boost::get<Intersection_point>(&(inter_list.front()));
+      ip = std::get<Intersection_point>(&(inter_list.front()));
       if (ip != nullptr) {
         // We have an intersection point
         if (m_left_on_boundary) {
@@ -570,7 +570,7 @@ _compute_next_intersection(Halfedge_handle he,
       }
       else {
         // We have an overlapping subcurve.
-        icv = boost::get<X_monotone_curve_2>(&(inter_list.front()));
+        icv = std::get<X_monotone_curve_2>(&(inter_list.front()));
         CGAL_assertion(icv != nullptr);
 
         if (is_closed(*icv, ARR_MIN_END)) {
@@ -608,7 +608,7 @@ _compute_next_intersection(Halfedge_handle he,
   // Discard all intersection lying to the left of m_left_pt (if exists).
   while (! inter_list.empty()) {
     // Compare that current object with m_left_pt (if exists).
-    ip = boost::get<Intersection_point>(&(inter_list.front()));
+    ip = std::get<Intersection_point>(&(inter_list.front()));
 
     if (ip != nullptr) {
       // We have an intersection point -
@@ -638,7 +638,7 @@ _compute_next_intersection(Halfedge_handle he,
     }
     else {
       // We have an overlapping subcurve.
-      icv = boost::get<X_monotone_curve_2>(&(inter_list.front()));
+      icv = std::get<X_monotone_curve_2>(&(inter_list.front()));
       CGAL_assertion(icv != nullptr);
 
       if (is_closed(*icv, ARR_MIN_END)) {
@@ -832,7 +832,7 @@ _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
   if (iobj) {
     // We have found an intersection (either a simple point or an
     // overlapping x-monotone curve).
-    const Intersection_point* int_p = boost::get<Intersection_point>(&*iobj);
+    const Intersection_point* int_p = std::get<Intersection_point>(&*iobj);
     if (int_p != nullptr) {
       Point_2 ip = int_p->first;
 
@@ -854,7 +854,7 @@ _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
     else {
       // We have located an overlapping curve. Assign ip as its left
       // endpoint.
-      const X_monotone_curve_2* icv = boost::get<X_monotone_curve_2>(&*iobj);
+      const X_monotone_curve_2* icv = std::get<X_monotone_curve_2>(&*iobj);
       CGAL_assertion(icv != nullptr);
       Point_2 ip = min_vertex(*icv);
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
index 71fbfd48f9fa..b8acaece4aa8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
@@ -101,7 +101,7 @@ class Arrangement_zone_2 {
 
   // Types used for caching intersection points:
   typedef std::pair<Point_2, Multiplicity>              Intersection_point;
-  typedef boost::variant<Intersection_point, X_monotone_curve_2>
+  typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
   typedef std::optional<Intersection_result>          Optional_intersection;
   typedef std::list<Intersection_result>                Intersect_list;
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
index 89c4b6595f83..a26e51a1e4ba 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
@@ -1426,7 +1426,7 @@ class Intersect_2 :
 
     typedef unsigned int                              Multiplicity;
     typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-    typedef boost::variant<Intersection_point, Arc_2> Intersection_result;
+    typedef std::variant<Intersection_point, Arc_2> Intersection_result;
 
     //! the result type
     typedef CGAL::cpp98::iterator<std::output_iterator_tag, Intersection_result>
@@ -1905,7 +1905,7 @@ Curved_kernel_via_analysis_2_functor_base<CurvedKernelViaAnalysis_2> {
   {
     typedef typename Curved_kernel_via_analysis_2::Point_2      Point_2;
     typedef typename Curved_kernel_via_analysis_2::Arc_2        Arc_2;
-    typedef boost::variant<Point_2, Arc_2>      Make_x_monotone_result;
+    typedef std::variant<Point_2, Arc_2>      Make_x_monotone_result;
     *oi++ = Make_x_monotone_result(cv);
     return oi;
   }
@@ -1945,7 +1945,7 @@ Curved_kernel_via_analysis_2_functor_base<CurvedKernelViaAnalysis_2> {
     typedef typename Curved_kernel_via_analysis_2::Arc_2        Arc_2;
     typedef typename Curved_kernel_via_analysis_2::Non_x_monotone_arc_2
       Non_x_monotone_arc_2;
-    typedef boost::variant<Point_2, Arc_2>
+    typedef std::variant<Point_2, Arc_2>
       Make_x_monotone_result;
 
     Curve_analysis_2 curve;
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h
index 69f9db2015e5..aae3aea01e9d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h
@@ -54,11 +54,11 @@ struct Make_x_monotone_2 :
     public CGAL::cpp98::binary_function<
         typename CurvedKernelViaAnalysis_2::Curve_2,
         CGAL::cpp98::iterator<std::output_iterator_tag,
-                              boost::variant<
+                              std::variant<
                                 typename CurvedKernelViaAnalysis_2::Point_2,
                                 typename CurvedKernelViaAnalysis_2::Arc_2> >,
         CGAL::cpp98::iterator<std::output_iterator_tag,
-                              boost::variant<
+                              std::variant<
                                 typename CurvedKernelViaAnalysis_2::Point_2,
                                 typename CurvedKernelViaAnalysis_2::Arc_2> > >
 {
@@ -132,7 +132,7 @@ struct Make_x_monotone_2 :
   template <typename OutputIterator>
   OutputIterator operator()(Curve_analysis_2 curve, OutputIterator oi)
   {
-    typedef boost::variant<Point_2, Arc_2>      Make_x_monotone_result;
+    typedef std::variant<Point_2, Arc_2>      Make_x_monotone_result;
 
     Construct_arc_2 construct_arc_2 =
       _m_curved_kernel->construct_arc_2_object();
@@ -290,7 +290,7 @@ struct Make_x_monotone_2 :
                                 Coordinate_1 x, std::vector<Point_2> pts,
                                 OutputIterator oi) const
   {
-    typedef boost::variant<Point_2, Arc_2>      Make_x_monotone_result;
+    typedef std::variant<Point_2, Arc_2>      Make_x_monotone_result;
 
     Construct_arc_2 construct_arc_2 =
       _m_curved_kernel->construct_arc_2_object();
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
index 03d6fcadfbe3..018992c467b4 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
@@ -726,7 +726,7 @@ class Make_x_monotone_2
         typedef typename SweepCurvesAdapter_2::Native_arc_2     Native_arc_2;
         typedef typename SweepCurvesAdapter_2::Native_point_2   Native_point_2;
         typedef typename SweepCurvesAdapter_2::Generic_point_2  Generic_point_2;
-        typedef boost::variant<Native_arc_2, Native_point_2>
+        typedef std::variant<Native_arc_2, Native_point_2>
           Make_x_monotone_result;
 
         std::vector<Make_x_monotone_result> objs;
@@ -734,11 +734,11 @@ class Make_x_monotone_2
         make_x_monotone(cv, std::back_inserter(objs));
         // sort out normal and degenerate arcs
         for (auto& obj : objs) {
-          if (auto* arc = boost::get<Native_arc_2>(&obj)) {
+          if (auto* arc = std::get<Native_arc_2>(&obj)) {
             *oi++ = Generic_arc_2(*arc);
             continue;
           }
-          auto* pt = boost::get<Native_point_2>(&obj);
+          auto* pt = std::get<Native_point_2>(&obj);
           CGAL_assertion(pt);
           *oi++ = Generic_arc_2(Generic_point_2(*pt));
         }
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_insertion_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_insertion_traits_2.h
index f3de33d7fe72..b7c2907bf583 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_insertion_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_insertion_traits_2.h
@@ -98,9 +98,9 @@ class Arr_insertion_traits_2 :
                               OutputIterator oi)
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
-      typedef boost::variant<Intersection_point, Base_x_monotone_curve_2>
+      typedef std::variant<Intersection_point, Base_x_monotone_curve_2>
                                                         Intersection_base_result;
 
       Halfedge_handle invalid_he;
@@ -120,13 +120,13 @@ class Arr_insertion_traits_2 :
       // X_monotone_curve_2
       for (const auto& xection : xections) {
         const Intersection_point*
-          p_p = boost::get<Intersection_point>(&xection);
+          p_p = std::get<Intersection_point>(&xection);
         if (p_p != nullptr) {
           *oi++ = Intersection_result(xection);
           continue;
         }
         const Base_x_monotone_curve_2* base_cv_p =
-          boost::get<Base_x_monotone_curve_2>(&xection);
+          std::get<Base_x_monotone_curve_2>(&xection);
         CGAL_assertion(base_cv_p);
 
         // Add halfedge handles to the resulting curve.
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
index 7a011211706b..e0b85f393906 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
@@ -22,9 +22,8 @@
  * Definition of the Arr_overlay_ss_visitor class-template.
  */
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <optional>
-#include <boost/variant/apply_visitor.hpp>
 
 #include <unordered_map>
 
@@ -344,7 +343,7 @@ class Arr_overlay_ss_visitor :
   //@}
 
   /*! A visitor class to facilitate the call to create_vertex(). */
-  class Create_vertex_visitor : public boost::static_visitor<> {
+  class Create_vertex_visitor {
   private:
     Overlay_traits* m_overlay_traits;
     Vertex_handle m_vertex_handle;
@@ -563,7 +562,7 @@ void Arr_overlay_ss_visitor<OvlHlpr, OvlTr, Vis>::after_sweep()
     const Cell_handle_blue& blue_handle = info.second;
     Vertex_handle v = (*it).first;
     Create_vertex_visitor visitor(m_overlay_traits, v);
-    boost::apply_visitor(visitor, red_handle, blue_handle);
+    std::visit(visitor, red_handle, blue_handle);
   }
 
   // When the sweep-line process is over, the remaining arrangement face
@@ -938,8 +937,8 @@ _map_boundary_vertices(Event* event, Vertex_handle v, boost::mpl::bool_<true>)
     const Cell_handle_red* red_handle_p = pt.red_cell_handle();
     if (red_handle_p) info.first = *red_handle_p;
 
-    if (!boost::get<Face_handle_red>(&(info.first)) &&
-        !boost::get<Face_handle_blue>(&(info.second)))
+    if (!std::get<Face_handle_red>(&(info.first)) &&
+        !std::get<Face_handle_blue>(&(info.second)))
     {
       // If both, the red and blue, variants do not represent face handles,
       // they must represt either vertex or edge handles. In this case it is
@@ -949,7 +948,7 @@ _map_boundary_vertices(Event* event, Vertex_handle v, boost::mpl::bool_<true>)
       const Cell_handle_blue& blue_handle = info.second;
       Vertex_handle v = (*it).first;
       Create_vertex_visitor visitor(m_overlay_traits, v);
-      boost::apply_visitor(visitor, red_handle, blue_handle);
+      std::visit(visitor, red_handle, blue_handle);
       m_vertices_map.erase(it);
     }
   }
@@ -1035,7 +1034,7 @@ _create_vertex(Event* event,
 
     CGAL_assertion(blue_handle != nullptr);
     const Vertex_handle_blue& blue_v =
-      boost::get<Vertex_handle_blue>(*blue_handle);
+      std::get<Vertex_handle_blue>(*blue_handle);
     m_overlay_traits->create_vertex(red_f, blue_v, new_v);
     return;
   }
@@ -1049,13 +1048,13 @@ _create_vertex(Event* event,
 
     CGAL_assertion(red_handle != nullptr);
     const Vertex_handle_red& red_v =
-      boost::get<Vertex_handle_red>(*red_handle);
+      std::get<Vertex_handle_red>(*red_handle);
     m_overlay_traits->create_vertex(red_v, blue_f, new_v);
     return;
   }
 
   Create_vertex_visitor visitor(m_overlay_traits, new_v);
-  boost::apply_visitor(visitor, *red_handle, *blue_handle);
+  std::visit(visitor, *red_handle, *blue_handle);
 }
 
 //-----------------------------------------------------------------------------
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
index 717b31a0d377..e981e5326581 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
@@ -22,7 +22,7 @@
  * Definition of the Arr_overlay_traits_2 class-template.
  */
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <optional>
 
 #include <CGAL/Arr_tags.h>
@@ -105,11 +105,11 @@ class Arr_overlay_traits_2 {
     RB_OVERLAP    // Red-blue overlap.
   };
 
-  typedef boost::variant<Halfedge_handle_red, Vertex_handle_red,
+  typedef std::variant<Halfedge_handle_red, Vertex_handle_red,
                          Face_handle_red>           Cell_handle_red;
   typedef std::optional<Cell_handle_red>          Optional_cell_red;
 
-  typedef boost::variant<Halfedge_handle_blue, Vertex_handle_blue,
+  typedef std::variant<Halfedge_handle_blue, Vertex_handle_blue,
                          Face_handle_blue>          Cell_handle_blue;
   typedef std::optional<Cell_handle_blue>         Optional_cell_blue;
 
@@ -323,14 +323,14 @@ class Arr_overlay_traits_2 {
     /*! Obtain the red vertex handle or nullptr if it doesn't exist. */
     const Vertex_handle_red* red_vertex_handle() const
     {
-      return m_red_cell ? boost::get<Vertex_handle_red>(&(*m_red_cell)) : nullptr;
+      return m_red_cell ? std::get<Vertex_handle_red>(&(*m_red_cell)) : nullptr;
     }
 
     /*! Obtain the blue vertex handle or nullptr if it doesn't exist. */
     const Vertex_handle_blue* blue_vertex_handle() const
     {
       return
-        m_blue_cell ? boost::get<Vertex_handle_blue>(&(*m_blue_cell)) : nullptr;
+        m_blue_cell ? std::get<Vertex_handle_blue>(&(*m_blue_cell)) : nullptr;
     }
   };
 
@@ -371,10 +371,10 @@ class Arr_overlay_traits_2 {
                               OutputIterator oi)
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
       typedef std::pair<Base_point_2, Multiplicity>     Intersection_base_point;
-      typedef boost::variant<Intersection_base_point, Base_x_monotone_curve_2>
+      typedef std::variant<Intersection_base_point, Base_x_monotone_curve_2>
                                                         Intersection_base_result;
 
       // In case the curves originate from the same arrangement, they are
@@ -440,7 +440,7 @@ class Arr_overlay_traits_2 {
       // the extended X_monotone_curve_2.
       for (const auto& xection : xections) {
         const Intersection_base_point* base_ipt =
-          boost::get<Intersection_base_point>(&xection);
+          std::get<Intersection_base_point>(&xection);
         if (base_ipt != nullptr) {
           // We have a red-blue intersection point, so we attach the
           // intersecting red and blue halfedges to it.
@@ -470,7 +470,7 @@ class Arr_overlay_traits_2 {
         }
 
         const Base_x_monotone_curve_2* overlap_xcv =
-          boost::get<Base_x_monotone_curve_2>(&xection);
+          std::get<Base_x_monotone_curve_2>(&xection);
         CGAL_assertion(overlap_xcv != nullptr);
 
         // We have a red-blue overlap, so we mark the curve accordingly.
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_vert_decomp_ss_visitor.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_vert_decomp_ss_visitor.h
index 952bf00e183e..cf26fa9a7739 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_vert_decomp_ss_visitor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_vert_decomp_ss_visitor.h
@@ -20,7 +20,7 @@
  * Definition of the Arr_vert_decomp_ss_visitor class-template.
  */
 
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 
@@ -66,7 +66,7 @@ class Arr_vert_decomp_ss_visitor :
   typedef typename Arrangement_2::Halfedge_const_handle Halfedge_const_handle;
   typedef typename Arrangement_2::Face_const_handle     Face_const_handle;
 
-  typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
+  typedef std::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>
     Cell_type;
   typedef std::optional<Cell_type>                    Vert_type;
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Batched_point_location_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Batched_point_location_test.h
index 256d101a3863..f84aee4da6dd 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Batched_point_location_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Batched_point_location_test.h
@@ -45,7 +45,7 @@ class Batched_point_location_test : public IO_test<GeomTraits_T> {
 
   typedef typename Points_vector::iterator                Point_iterator;
 
-  typedef typename boost::variant<Vertex_const_handle,
+  typedef typename std::variant<Vertex_const_handle,
                                   Halfedge_const_handle,
                                   Face_const_handle>      Cell_handle;
 
@@ -226,10 +226,10 @@ compare(const Cell_handle& expected, const Cell_handle& actual)
 {
   // Assign object to a face
   const Face_const_handle* fh_expected =
-    boost::get<Face_const_handle>(&(expected));
+    std::get_if<Face_const_handle>(&(expected));
   if (fh_expected) {
     const Face_const_handle* fh_actual =
-      boost::get<Face_const_handle>(&(actual));
+      std::get_if<Face_const_handle>(&(actual));
     if (fh_actual) {
       if ((*fh_actual) == (*fh_expected)) return true;
 
@@ -241,13 +241,13 @@ compare(const Cell_handle& expected, const Cell_handle& actual)
     std::cout << "Error: batched point location!" << std::endl;
     std::cout << "Expected a face."  << std::endl;
     const Halfedge_const_handle* hh_actual =
-      boost::get<Halfedge_const_handle>(&(actual));
+      std::get_if<Halfedge_const_handle>(&(actual));
     if (hh_actual) {
       std::cout << "Actual: a halfedge." << std::endl;
       return false;
     }
     const Vertex_const_handle* vh_actual =
-      boost::get<Vertex_const_handle>(&(actual));
+      std::get_if<Vertex_const_handle>(&(actual));
     if (vh_actual) {
       std::cout << "Actual: a vertex." << std::endl;
       return false;
@@ -258,10 +258,10 @@ compare(const Cell_handle& expected, const Cell_handle& actual)
 
   // Assign object to a halfedge
   const Halfedge_const_handle* hh_expected =
-    boost::get<Halfedge_const_handle>(&(expected));
+    std::get_if<Halfedge_const_handle>(&(expected));
   if (hh_expected) {
     const Halfedge_const_handle* hh_actual =
-      boost::get<Halfedge_const_handle>(&(actual));
+      std::get_if<Halfedge_const_handle>(&(actual));
     if (hh_actual) {
       if (((*hh_actual) == (*hh_expected)) ||
           ((*hh_actual)->twin() == (*hh_expected)))
@@ -279,13 +279,13 @@ compare(const Cell_handle& expected, const Cell_handle& actual)
     std::cout << "Expected: a halfedge, " << (*hh_expected)->curve()
               << std::endl;
     const Face_const_handle* fh_actual =
-      boost::get<Face_const_handle>(&(actual));
+      std::get_if<Face_const_handle>(&(actual));
     if (fh_actual) {
       std::cout << "Actual: a face." << std::endl;
       return false;
     }
     const Vertex_const_handle* vh_actual =
-      boost::get<Vertex_const_handle>(&(actual));
+      std::get_if<Vertex_const_handle>(&(actual));
     if (vh_actual) {
       std::cout << "Actual: a vertex." << std::endl;
       return false;
@@ -296,10 +296,10 @@ compare(const Cell_handle& expected, const Cell_handle& actual)
 
   // Assign object to a vertex
   const Vertex_const_handle* vh_expected =
-    boost::get<Vertex_const_handle>(&(expected));
+    std::get_if<Vertex_const_handle>(&(expected));
   if (vh_expected) {
     const Vertex_const_handle* vh_actual =
-      boost::get<Vertex_const_handle>(&(actual));
+      std::get_if<Vertex_const_handle>(&(actual));
     if (vh_actual) {
       if ((*vh_actual) == (*vh_expected)) return true;
 
@@ -313,13 +313,13 @@ compare(const Cell_handle& expected, const Cell_handle& actual)
     std::cout << "Error: batched point location!";
     std::cout << "Expected: a vertex, "<< (*vh_expected)->point() << std::endl;
     const Face_const_handle* fh_actual =
-      boost::get<Face_const_handle>(&(actual));
+      std::get_if<Face_const_handle>(&(actual));
     if (fh_actual) {
       std::cout << "Actual: a face" << std::endl;
       return false;
     }
     const Halfedge_const_handle* hh_actual =
-      boost::get<Halfedge_const_handle>(&(actual));
+      std::get_if<Halfedge_const_handle>(&(actual));
     if (hh_actual) {
       std::cout << "Actual: a halfedge." << std::endl;
       return false;
@@ -436,15 +436,15 @@ print(const std::pair<Point_2, Cell_handle>& res)
   // Print the results.
   std::cout << "The point (" << res.first << ") is located ";
   if (const Face_const_handle* f =
-      boost::get<Face_const_handle>(&(res.second)))       // inside a face
+      std::get_if<Face_const_handle>(&(res.second)))       // inside a face
     std::cout << "inside "
               << (((*f)->is_unbounded()) ? "the unbounded" : "a bounded")
               << " face." << std::endl;
   else if (const Halfedge_const_handle* e =
-           boost::get<Halfedge_const_handle>(&(res.second))) // on an edge
+           std::get_if<Halfedge_const_handle>(&(res.second))) // on an edge
     std::cout << "on an edge: " << (*e)->curve() << std::endl;
   else if (const Vertex_const_handle* v =
-           boost::get<Vertex_const_handle>(&(res.second)))  // on a vertex
+           std::get_if<Vertex_const_handle>(&(res.second)))  // on a vertex
     std::cout << "on "
               << (((*v)->is_isolated()) ? "an isolated" : "a")
               << " vertex: " << (*v)->point() << std::endl;
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/IO_base_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/IO_base_test.h
index 9065587101ed..c7fdc1eab1e0 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/IO_base_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/IO_base_test.h
@@ -693,11 +693,11 @@ bool IO_base_test<Base_geom_traits>::read_xsegment(InputStream_& is,
   Subcurve_2 seg(point_vector.begin(), point_vector.end());
 
   //convert it into x-monotone bezier segment.
-  typedef boost::variant<Point_2, X_monotone_subcurve_2> Make_x_monotone_result;
+  typedef std::variant<Point_2, X_monotone_subcurve_2> Make_x_monotone_result;
   std::vector<Make_x_monotone_result> objs;
   bezier_traits.make_x_monotone_2_object()(seg, std::back_inserter(objs));
   assert(! objs.empty());
-  const auto* x_seg_p = boost::get<X_monotone_subcurve_2>(&(objs[0]));
+  const auto* x_seg_p = std::get_if<X_monotone_subcurve_2>(&(objs[0]));
   assert(x_seg_p);
   xseg = *x_seg_p;
 
@@ -720,7 +720,7 @@ bool IO_base_test<Base_geom_traits>::read_xcurve(InputStream_& is,
   unsigned int number_of_segments;
   is >> number_of_segments;
 
-  typedef boost::variant<Point_2, X_monotone_subcurve_2> Make_x_monotone_result;
+  typedef std::variant<Point_2, X_monotone_subcurve_2> Make_x_monotone_result;
   auto make_x_monotone = bezier_traits.make_x_monotone_2_object();
   if ((type == 'x') || (type == 'X')) {
     for (unsigned int i=0; i<number_of_segments; ++i) {
@@ -741,7 +741,7 @@ bool IO_base_test<Base_geom_traits>::read_xcurve(InputStream_& is,
       std::vector<Make_x_monotone_result> objs;
       make_x_monotone(seg, std::back_inserter(objs));
       assert(! objs.empty());
-      const auto* x_seg_p = boost::get<X_monotone_subcurve_2>(&(objs[0]));
+      const auto* x_seg_p = std::get_if<X_monotone_subcurve_2>(&(objs[0]));
       assert(x_seg_p);
       x_segments.push_back(*x_seg_p);
 
@@ -1470,7 +1470,7 @@ bool IO_base_test<Base_geom_traits>::read_xcurve(InputStream_& is,
                                                  X_monotone_curve_2& xcv)
 {
   std::cout << std::endl;
-  typedef boost::variant<Point_2, X_monotone_curve_2> Make_x_monotone_result;
+  typedef std::variant<Point_2, X_monotone_curve_2> Make_x_monotone_result;
   std::list<Make_x_monotone_result> x_objs;
   Curve_2 tmp_cv;
   is >> tmp_cv;
@@ -1488,7 +1488,7 @@ bool IO_base_test<Base_geom_traits>::read_xcurve(InputStream_& is,
   size_t id(0);
   if (! is.eof()) is >> id;
   std::advance(xoit, id);
-  const auto* xcv_p = boost::get<X_monotone_curve_2>(&*xoit);
+  const auto* xcv_p = std::get_if<X_monotone_curve_2>(&*xoit);
   assert(xcv_p);
   xcv = *xcv_p;
   return false;
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h
index f4b717db1806..6b7628a05193 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h
@@ -70,7 +70,7 @@ class Point_location_test : public IO_test<GeomTraits> {
   typedef std::vector<CGAL::Object>                     Objects_vector;
   typedef Objects_vector::iterator                      Object_iterator;
 
-  typedef typename boost::variant<Vertex_const_handle,
+  typedef typename std::variant<Vertex_const_handle,
                                   Halfedge_const_handle,
                                   Face_const_handle>    Cell_handle;
   typedef std::vector<Cell_handle>                      Variants_vector;
@@ -148,7 +148,7 @@ class Point_location_test : public IO_test<GeomTraits> {
     NUM_PL_STRATEGIES
   };
 
-  typedef boost::variant<Naive_pl*,
+  typedef std::variant<Naive_pl*,
                          Simple_pl*,
                          Walk_pl*,
 #if (TEST_GEOM_TRAITS == SEGMENT_GEOM_TRAITS) || \
@@ -290,7 +290,7 @@ class Point_location_test : public IO_test<GeomTraits> {
   template <typename Strategy, Pl_strategy id>
   void deallocate_pl()
   {
-    Strategy* strategy = boost::get<Strategy*>(m_locators[id].m_variant);
+    Strategy* strategy = std::get<Strategy*>(m_locators[id].m_variant);
     if (strategy) {
       delete strategy;
       m_locators[id].m_variant = static_cast<Strategy*>(nullptr);
@@ -302,7 +302,7 @@ class Point_location_test : public IO_test<GeomTraits> {
   void attach_pl()
   {
     if (! m_locators[id].m_active) return;
-    Strategy* strategy = boost::get<Strategy*>(m_locators[id].m_variant);
+    Strategy* strategy = std::get<Strategy*>(m_locators[id].m_variant);
     strategy->attach(*m_arr);
   }
 
@@ -311,7 +311,7 @@ class Point_location_test : public IO_test<GeomTraits> {
   void attach_pl(Generator* generator)
   {
     if (! m_locators[id].m_active) return;
-    Strategy* strategy = boost::get<Strategy*>(m_locators[id].m_variant);
+    Strategy* strategy = std::get<Strategy*>(m_locators[id].m_variant);
     strategy->attach(*m_arr, generator);
   }
 
@@ -321,7 +321,7 @@ class Point_location_test : public IO_test<GeomTraits> {
   {
     if (! m_locators[id].m_active) return;
     const std::string& name = m_locators[id].m_name;
-    Strategy* strategy = boost::get<Strategy*>(m_locators[id].m_variant);
+    Strategy* strategy = std::get<Strategy*>(m_locators[id].m_variant);
     query(*strategy, name.c_str(), m_query_points.begin(), m_query_points.end(),
           std::back_inserter(objs));
   }
@@ -625,7 +625,7 @@ class Point_location_test : public IO_test<GeomTraits> {
 
 #define ATTACH_PL_TRAPEZOID_RIC_NO_GUARANTEE()                           \
   Pl_variant& var = m_locators[TRAPEZOID_RIC_NO_GUARANTEE_PL].m_variant; \
-  Trapezoid_ric_pl* strategy = boost::get<Trapezoid_ric_pl*>(var);       \
+  Trapezoid_ric_pl* strategy = std::get<Trapezoid_ric_pl*>(var);       \
   strategy->with_guarantees(false);                                      \
   attach_pl<Trapezoid_ric_pl, TRAPEZOID_RIC_NO_GUARANTEE_PL>()
 
@@ -1088,11 +1088,11 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
   // Assign and check results
   for (size_t qi = 0; qi < size; ++qi) {
     // Assign object to a face
-    Face_const_handle* fh_ref = boost::get<Face_const_handle>(&(objs[0][qi]));
+    Face_const_handle* fh_ref = std::get_ifFace_const_handle>(&(objs[0][qi]));
     if (fh_ref) {
       for (size_t pl = 1; pl < pls_num; ++pl) {
         Face_const_handle* fh_cur =
-          boost::get<Face_const_handle>(&(objs[pl][qi]));
+          std::get_ifFace_const_handle>(&(objs[pl][qi]));
         if (fh_cur) {
           if ((*fh_cur) != (*fh_ref)) {
             std::cout << "Error: point location number " << pl << std::endl;
@@ -1107,13 +1107,13 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
         std::cout << "Expected: a face." << std::endl;
         result += -1;
         Halfedge_const_handle* hh_cur =
-          boost::get<Halfedge_const_handle>(&(objs[pl][qi]));
+          std::get_ifHalfedge_const_handle>(&(objs[pl][qi]));
         if (hh_cur) {
           std::cout << "Actual: a halfedge." << std::endl;
           continue;
         }
         Vertex_const_handle* vh_cur =
-          boost::get<Vertex_const_handle>(&(objs[pl][qi]));
+          std::get_ifVertex_const_handle>(&(objs[pl][qi]));
         if (vh_cur) {
           std::cout << "Actual: a vertex." << std::endl;
           continue;
@@ -1129,11 +1129,11 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
 
     // Assign object to a halfedge
     Halfedge_const_handle* hh_ref =
-      boost::get<Halfedge_const_handle>(&(objs[0][qi]));
+      std::get_ifHalfedge_const_handle>(&(objs[0][qi]));
     if (hh_ref) {
       for (size_t pl = 1; pl < pls_num; ++pl) {
         Halfedge_const_handle* hh_cur =
-          boost::get<Halfedge_const_handle>(&(objs[pl][qi]));
+          std::get_ifHalfedge_const_handle>(&(objs[pl][qi]));
         if (hh_cur) {
           if (((*hh_cur) != (*hh_ref)) && ((*hh_cur)->twin() != (*hh_ref))) {
             std::cout << "Error: point location number " << pl << std::endl;
@@ -1150,13 +1150,13 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
                   << std::endl;
         result += -1;
         Face_const_handle* fh_cur =
-          boost::get<Face_const_handle>(&(objs[pl][qi]));
+          std::get_ifFace_const_handle>(&(objs[pl][qi]));
         if (fh_cur) {
           std::cout << "Actual: a face." << std::endl;
           continue;
         }
         Vertex_const_handle* vh_cur =
-          boost::get<Vertex_const_handle>(&(objs[pl][qi]));
+          std::get_ifVertex_const_handle>(&(objs[pl][qi]));
         if (vh_cur) {
           std::cout << "Actual: a vertex." << std::endl;
           continue;
@@ -1168,11 +1168,11 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
 
     // Assign object to a vertex
     Vertex_const_handle* vh_ref =
-      boost::get<Vertex_const_handle>(&(objs[0][qi]));
+      std::get_ifVertex_const_handle>(&(objs[0][qi]));
     if (vh_ref) {
       for (size_t pl = 1; pl < pls_num; ++pl) {
         Vertex_const_handle* vh_cur =
-          boost::get<Vertex_const_handle>(&(objs[pl][qi]));
+          std::get_ifVertex_const_handle>(&(objs[pl][qi]));
         if (vh_cur) {
           if ((*vh_cur) != (*vh_ref)) {
             std::cout << "Error: point location number " << pl << std::endl;
@@ -1188,13 +1188,13 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
         std::cout << "Expected: a vertex: "<< (*vh_ref)->point() << std::endl;
         result += -1;
         Face_const_handle* fh_cur =
-          boost::get<Face_const_handle>(&(objs[pl][qi]));
+          std::get_ifFace_const_handle>(&(objs[pl][qi]));
         if (fh_cur) {
           std::cout << "Actual: a face." << std::endl;
           continue;
         }
         Halfedge_const_handle* hh_cur =
-          boost::get<Halfedge_const_handle>(&(objs[pl][qi]));
+          std::get_ifHalfedge_const_handle>(&(objs[pl][qi]));
         if (hh_cur) {
           std::cout << "Actual: a halfedge." << std::endl;
           continue;
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h
index 680ae201d405..fb912860f591 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h
@@ -913,7 +913,7 @@ make_x_monotone_wrapper(std::istringstream& str_stream)
   typedef Geom_traits_T                                 Traits;
   typedef typename Traits::Point_2                      Point_2;
   typedef typename Traits::X_monotone_curve_2           X_monotone_curve_2;
-  typedef boost::variant<Point_2, X_monotone_curve_2>   Make_x_monotone_result;
+  typedef std::variant<Point_2, X_monotone_curve_2>   Make_x_monotone_result;
   CGAL_USE_TYPE(typename Traits::Curve_2);
 
   unsigned int id;
@@ -934,14 +934,14 @@ make_x_monotone_wrapper(std::istringstream& str_stream)
     unsigned int id;                    // The id of the point or x-monotone
     str_stream >> id;                   // ... curve respectively
 
-    const auto* xcv_ptr = boost::get<X_monotone_curve_2>(&(objs[i]));
+    const auto* xcv_ptr = std::get_if<X_monotone_curve_2>(&(objs[i]));
     if (xcv_ptr != nullptr) {
       if (!this->compare(type, 1u, "type")) return false;
       if (!this->compare_curves(this->m_xcurves[id], *xcv_ptr)) return false;
       continue;
     }
 
-    const auto* pt_ptr = boost::get<Point_2>(&(objs[i]));
+    const auto* pt_ptr = std::get_if<Point_2>(&(objs[i]));
     assert(pt_ptr != nullptr);
     if (!this->compare(type, 0u, "type")) return false;
     if (!this->compare_points(this->m_points[id], *pt_ptr)) return false;
@@ -969,7 +969,7 @@ intersect_wrapper(std::istringstream& str_stream)
   typedef typename Traits::Multiplicity         Multiplicity;
 
   typedef std::pair<Point_2, Multiplicity>      Intersection_point;
-  typedef boost::variant<Intersection_point, X_monotone_curve_2>
+  typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                 Intersection_result;
 
   unsigned int id1, id2;
@@ -995,7 +995,7 @@ intersect_wrapper(std::istringstream& str_stream)
 
     unsigned int exp_type = 1;
     const X_monotone_curve_2* cv_p =
-      boost::get<X_monotone_curve_2>(&(xections[i]));
+      std::get_if<X_monotone_curve_2>(&(xections[i]));
 
     if (cv_p != nullptr) {
       if (! this->compare(type, exp_type, "type")) return false;
@@ -1005,7 +1005,7 @@ intersect_wrapper(std::istringstream& str_stream)
 
     exp_type = 0;
     const Intersection_point* p_p =
-      boost::get<Intersection_point>(&(xections[i]));
+      std::get_if<Intersection_point>(&(xections[i]));
     assert(p_p != nullptr);
     if (! this->compare(type, exp_type, "type")) return false;
     if (! this->compare_points(this->m_points[id], p_p->first)) return false;
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Vertical_decomposition_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Vertical_decomposition_test.h
index 881c939b5ffb..1fd487652e8b 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Vertical_decomposition_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Vertical_decomposition_test.h
@@ -44,7 +44,7 @@ class Vertical_decomposition_test : public IO_test<GeomTraits_2> {
   typedef typename Arrangement::Edge_const_iterator       Edge_const_iterator;
   typedef typename Arrangement::Vertex_const_iterator     Vertex_const_iterator;
 
-  typedef boost::variant<Vertex_const_handle, Halfedge_const_handle,
+  typedef std::variant<Vertex_const_handle, Halfedge_const_handle,
                          Face_const_handle>               Cell_type;
   typedef std::optional<Cell_type>                      Vert_type;
   typedef typename std::pair<Vert_type, Vert_type>        Vert_pair;
@@ -196,14 +196,14 @@ compare(const Result_type& expected, Vert_type actual)
 
   auto obj = *actual;
   // Assign object to a face.
-  if (const auto* fh_expected = boost::get<Face_const_handle>(&(expected))) {
-    if (boost::get<Vertex_const_handle>(&obj)) {
+  if (const auto* fh_expected = std::get_if<Face_const_handle>(&(expected))) {
+    if (std::get_if<Vertex_const_handle>(&obj)) {
       std::cout << "Error: vertical decomposition!" << std::endl;
       std::cout << "Expected: a face."  << std::endl;
       std::cout << "Actual: a vertex." << std::endl;
       return false;
     }
-    if (boost::get<Halfedge_const_handle>(&obj)) {
+    if (std::get_if<Halfedge_const_handle>(&obj)) {
       std::cout << "Error: vertical decomposition!" << std::endl;
       std::cout << "Expected: a face."  << std::endl;
       std::cout << "Actual: a halfedge." << std::endl;
@@ -213,9 +213,9 @@ compare(const Result_type& expected, Vert_type actual)
   }
 
   // Assign object to a halfedge.
-  const auto* hh_expected = boost::get<Halfedge_const_handle>(&(expected));
+  const auto* hh_expected = std::get_if<Halfedge_const_handle>(&(expected));
   if (hh_expected) {
-    if (const auto* hh_actual = boost::get<Halfedge_const_handle>(&obj)) {
+    if (const auto* hh_actual = std::get_if<Halfedge_const_handle>(&obj)) {
       if (*hh_expected == *hh_actual) return true;
 
       std::cout << "Error: vertical decomposition!" << std::endl;
@@ -230,13 +230,13 @@ compare(const Result_type& expected, Vert_type actual)
     std::cout << "Expected: a halfedge, " << (*hh_expected)->curve()
               << std::endl;
 
-    if (const auto* vh_actual = boost::get<Vertex_const_handle>(&obj)) {
+    if (const auto* vh_actual = std::get_if<Vertex_const_handle>(&obj)) {
       std::cout << "Actual: a vertex, " << (*vh_actual)->point() << std::endl;
       return false;
     }
 
     Face_const_handle fh_actual;
-    if (boost::get<Face_const_handle>(&obj)) {
+    if (std::get_if<Face_const_handle>(&obj)) {
       std::cout << "Actual: a face." << std::endl;
       return false;
     }
@@ -245,9 +245,9 @@ compare(const Result_type& expected, Vert_type actual)
   }
 
   // Assign object to a vertex.
-  const auto* vh_expected = boost::get<Vertex_const_handle>(&(expected));
+  const auto* vh_expected = std::get_if<Vertex_const_handle>(&(expected));
   if (vh_expected) {
-    if (const auto* vh_actual = boost::get<Vertex_const_handle>(&obj)) {
+    if (const auto* vh_actual = std::get_if<Vertex_const_handle>(&obj)) {
       if (*vh_expected == *vh_actual) return true;
 
       std::cout << "Error: vertical decomposition!" << std::endl;
@@ -261,12 +261,12 @@ compare(const Result_type& expected, Vert_type actual)
     std::cout << "Error: vertical decomposition!" << std::endl;
     std::cout << "Expected: a vertex, " << (*vh_expected)->point() << std::endl;
 
-    if (const auto* hh_actual = boost::get<Halfedge_const_handle>(&obj)) {
+    if (const auto* hh_actual = std::get_if<Halfedge_const_handle>(&obj)) {
       std::cout << "Actual: a halfedge, " << (*hh_actual)->curve() << std::endl;
       return false;
     }
 
-    if (boost::get<Face_const_handle>(&obj)) {
+    if (std::get_if<Face_const_handle>(&obj)) {
       std::cout << "Actual: a face." << std::endl;
       return false;
     }
@@ -291,22 +291,22 @@ print(const Vert_decomp_entry& result)
   assert(obj_below);
   auto obj = *obj_below;
   std::cout << "  feature below: ";
-  if (const auto* hh  = boost::get<Halfedge_const_handle>(&obj))
+  if (const auto* hh  = std::get_if<Halfedge_const_handle>(&obj))
     std::cout << '[' << (*hh)->curve() << ']';
-  else if (const auto* vh = boost::get<Vertex_const_handle>(&obj))
+  else if (const auto* vh = std::get_if<Vertex_const_handle>(&obj))
     std::cout << '(' << (*vh)->point() << ')';
-  else if (const auto* fh = boost::get<Face_const_handle>(&obj))
+  else if (const auto* fh = std::get_if<Face_const_handle>(&obj))
     std::cout << "NONE";
   else std::cout << "EMPTY";
 
   assert(obj_above);
   obj = *obj_above;
   std::cout << "  feature above: ";
-  if (const auto* hh  = boost::get<Halfedge_const_handle>(&obj))
+  if (const auto* hh  = std::get_if<Halfedge_const_handle>(&obj))
     std::cout << '[' << (*hh)->curve() << ']';
-  else if (const auto* vh = boost::get<Vertex_const_handle>(&obj))
+  else if (const auto* vh = std::get_if<Vertex_const_handle>(&obj))
     std::cout << '(' << (*vh)->point() << ')';
-  else if (const auto* vh = boost::get<Face_const_handle>(&obj))
+  else if (const auto* vh = std::get_if<Face_const_handle>(&obj))
     std::cout << "NONE";
   else std::cout << "EMPTY";
 
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_arc_polycurve.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_arc_polycurve.cpp
index 2856f82b0761..ff71cbf9ac9e 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_arc_polycurve.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_arc_polycurve.cpp
@@ -19,7 +19,7 @@ typedef Sub_traits_2::CoordNT                        CoordNT;
 typedef Sub_traits_2::Point_2                        Point_2;
 typedef Sub_traits_2::Curve_2                        Subcurve_2;
 typedef Sub_traits_2::X_monotone_curve_2             Subcurve_x_monotone_2;
-typedef boost::variant<Point_2, Subcurve_x_monotone_2>
+typedef std::variant<Point_2, Subcurve_x_monotone_2>
   Make_sub_x_monotone_result;
 
 void check_equal()
@@ -81,8 +81,8 @@ void check_intersect(Traits_2::Make_x_monotone_2
   make_x_monotone_2(curve1, std::back_inserter(x_monotone_curves));
   make_x_monotone_2(curve2, std::back_inserter(x_monotone_curves));
 
-  const auto* x_curve1 = boost::get<Subcurve_x_monotone_2>(curves[0]);
-  const auto* x_curve2 = boost::get<Subcurve_x_monotone_2>(curves[1]);
+  const auto* x_curve1 = std::get<Subcurve_x_monotone_2>(curves[0]);
+  const auto* x_curve2 = std::get<Subcurve_x_monotone_2>(curves[1]);
 
   std::vector<Intersection_result> Points_of_intersection;
 
@@ -100,7 +100,7 @@ void check_intersect(Traits_2::Make_x_monotone_2
 
   curve3 = Subcurve_2(c6, 1, CGAL::CLOCKWISE, s6, t6);
   make_x_monotone_2(curve3, std::back_inserter(x_curves));
-  const auto* x_curve2 = boost::get<>(&x_curves[2]);
+  const auto* x_curve2 = std::get<>(&x_curves[2]);
 
   Points_of_intersection.clear();
   //intersect_2(X_monotone_curve1, X_monotone_curve2,
@@ -131,8 +131,8 @@ check_compare_end_points_xy_2(Traits_2::Compare_endpoints_xy_2
   std::vector<Make_sub_x_monotone_result> x_curves;
   make_x_monotone_2(curve1, std::back_inserter(x_curves));
 
-  const auto* x_curve1 = boost::get<Subcurve_x_monotone_2>(&x_curves[0]);
-  const auto* x_curve2 = boost::get<Subcurve_x_monotone_2>(&x_curves[1]);
+  const auto* x_curve1 = std::get_if<Subcurve_x_monotone_2>(&x_curves[0]);
+  const auto* x_curve2 = std::get_if<Subcurve_x_monotone_2>(&x_curves[1]);
 
   auto res = compare_endpoints_xy_2(x_curve1);
   std::cout<< "The first result is: " << res << std::endl;
@@ -143,7 +143,7 @@ check_compare_end_points_xy_2(Traits_2::Compare_endpoints_xy_2
   Point_2 s2 = Point_2(one_plus_sqrt_3, CoordNT(1));
   curve2 = Subcurve_2(circ2, s1, t1);
   make_x_monotone_2(curve2, std::back_inserter(x_curves));
-  const auto* x_curve2 = boost::get<Subcurve_x_monotone_2>(&x_curves[1]);
+  const auto* x_curve2 = std::get_if<Subcurve_x_monotone_2>(&x_curves[1]);
 
   res = compare_endpoints_xy_2(x_curve2);
 
@@ -170,7 +170,7 @@ void check_split(Traits_2::Split_2  split_2,
   //make x_monotone
   std::vector<Make_sub_x_monotone_result> x_curves;
   make_x_monotone_2(curve, std::back_inserter(x_curves));
-  const auto* x_curve1 = boost::get<Subcurve_x_monotone_2>(&x_curves[0]);
+  const auto* x_curve1 = std::get_if<Subcurve_x_monotone_2>(&x_curves[0]);
 
   // Subcurve_x_monotone_2 split_x_monotone_curve1, split_x_monotone_curve2 ;
   //split_2(X_monotone_curve, Kernel::Point_2::Kernel::Point_2(1, 4),
@@ -200,8 +200,8 @@ void check_is_vertical(Traits_2::Make_x_monotone_2
 
   //std::vector<Subcurve_x_monotone_2> x_monotone_polycurves;
 
-  const auto* x_polycurve1 = boost::get<Subcurve_x_monotone_2>(&x_curves[0]);
-  const auto* x_polycurve2 = boost::get<Subcurve_x_monotone_2>(&x_curves[1]);
+  const auto* x_polycurve1 = std::get_if<Subcurve_x_monotone_2>(&x_curves[0]);
+  const auto* x_polycurve2 = std::get_if<Subcurve_x_monotone_2>(&x_curves[1]);
 
   bool res = is_vertical(x_polycurve1);
   std::cout << "Is_verticle:: The xmonotone curve (quarter circle) is : "
@@ -232,8 +232,8 @@ void check_compare_y_at_x_2(Traits_2::Make_x_monotone_2 make_x_monotone_2,
   for (const auto& cv : curves)
     make_x_monotone_2(cv, std::back_inserter(x_curves));
 
-  const auto* x_polycurve1 = boost::get<Subcurve_x_monotone_2>(&x_curves[0]);
-  const auto* x_polycurve2 = boost::get<Subcurve_x_monotone_2>(&x_curves[1]);
+  const auto* x_polycurve1 = std::get_if<Subcurve_x_monotone_2>(&x_curves[0]);
+  const auto* x_polycurve2 = std::get_if<Subcurve_x_monotone_2>(&x_curves[1]);
 
   Kernel::Point_2 p_test = Kernel::Point_2(3, 1);
 
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_bezier_polycurve.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_bezier_polycurve.cpp
index 9936d4648ecf..f36f4cc5b2a5 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_bezier_polycurve.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_bezier_polycurve.cpp
@@ -34,7 +34,7 @@ typedef CGAL::Arr_polyline_traits_2<Bezier_traits_2>    Bezier_polycurve_traits;
 typedef Bezier_polycurve_traits::Curve_2                Polycurve_bezier;
 typedef Bezier_polycurve_traits::X_monotone_curve_2     X_polycurve_bezier;
 
-typedef boost::variant<Bezier_point, Bezier_x_monotone_curve>
+typedef std::variant<Bezier_point, Bezier_x_monotone_curve>
                                                         Make_x_monotone_result;
 
 int main (int argc, char *argv[])
@@ -60,7 +60,7 @@ int main (int argc, char *argv[])
   //creating x-mono bezier
   bezier_traits.make_x_monotone_2_object()(curve_1, std::back_inserter(objs));
   //std::cout << "number of x_curves: " << obj_vector.size() << std::endl;
-  const auto* x_curve_1 = boost::get<Bezier_x_monotone_curve>(&(obj_vector[0]));
+  const auto* x_curve_1 = std::get_if<Bezier_x_monotone_curve>(&(obj_vector[0]));
   assert(x_curve_1);
 
   //std::cout << x_curve << std::endl;
@@ -74,7 +74,7 @@ int main (int argc, char *argv[])
   //creating x-monotne
   obj_vector.clear();
   bezier_traits.make_x_monotone_2_object()( curve_2, std::back_inserter(objs));
-  const auto* x_curve_2 = boost::get<Bezier_x_monotone_curve>(&(obj_vector[0]));
+  const auto* x_curve_2 = std::get_if<Bezier_x_monotone_curve>(&(obj_vector[0]));
 
   //push curves into polyline vectors
   curves_vector.push_back(curve_1);
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_circular_arc_polycurve.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_circular_arc_polycurve.cpp
index 32395799ae57..9c65e0f3ca9b 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_circular_arc_polycurve.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_circular_arc_polycurve.cpp
@@ -92,7 +92,7 @@ void check_make_x_monotone(typename GeometryTraits::Curve_2 cv,
   typedef typename Geometry_traits_2::Point_2               Point_2;
   typedef typename Geometry_traits_2::X_monotone_traits_2   X_monotone_traits_2;
 
-  typedef boost::variant<Point_2, X_monotone_traits_2>
+  typedef std::variant<Point_2, X_monotone_traits_2>
     Make_x_monotone_result;
 
   std::vector<Make_x_monotone_result> objs;
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_conic_polycurve.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_conic_polycurve.cpp
index 02f85dc22e7d..0ef7631c479b 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_conic_polycurve.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_conic_polycurve.cpp
@@ -110,7 +110,7 @@ void check_equal()
    typedef typename Traits::Point_2                     Point_2;
    typedef typename Traits::X_monotone_curve_2          X_monotone_curve_2;
    typedef std::pair<Multiplicity, Point_2>             Intersection_point;
-   typedef boost::variant<Intersection_point, X_monotone_curve_2>
+   typedef std::variant<Intersection_point, X_monotone_curve_2>
      Intersection_result;
 
    std::vector<Intersection_result> intersection_points;
@@ -644,7 +644,7 @@ void check_make_x_monotne_curve(const typename GeometryTraits::Curve_2& c1)
 {
   typename GeometryTraits::Point_2                      Point_2;
   typename GeometryTraits::X_monotone_curve_2           X_monotone_curve_2;
-  typedef boost::variant<Point_2, X_monotone_curve_2>   Make_x_monotone_result;
+  typedef std::variant<Point_2, X_monotone_curve_2>   Make_x_monotone_result;
   Polycurve_conic_traits_2 traits;
   std::vector<Make_x_monotone_result> objs;
   traits.make_x_monotone_2_object()(c1, std::back_inserter(objs));
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_vert_ray_shoot_vert_segments.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_vert_ray_shoot_vert_segments.cpp
index 07cfc97e199d..3dd0399d9dd8 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_vert_ray_shoot_vert_segments.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_vert_ray_shoot_vert_segments.cpp
@@ -22,17 +22,17 @@ void vertical_ray_shooting_query
   if (shoot_up) std::cout << "  Shooting up from (" << q << ") : ";
   else std::cout << "  Shooting down from (" << q << ") : ";
 
-  if (auto* e_p = boost::get<Halfedge_const_handle>(&obj)) {
+  if (auto* e_p = std::get_if<Halfedge_const_handle>(&obj)) {
     // We hit an edge:
     std::cout << "hit an edge: " << (*e_p)->curve() << std::endl;
   }
-  else if (auto* v_p = boost::get<Vertex_const_handle>(&obj)) {
+  else if (auto* v_p = std::get_if<Vertex_const_handle>(&obj)) {
     // We hit a vertex:
     if ((*v_p)->is_isolated())
       std::cout << "hit an isolated vertex: " << (*v_p)->point() << std::endl;
     else std::cout << "hit a vertex: " << (*v_p)->point() << std::endl;
   }
-  else if (auto* f_p = boost::get<Face_const_handle>(&obj)) {
+  else if (auto* f_p = std::get_if<Face_const_handle>(&obj)) {
     // We did not hit anything:
     assert((*f_p)->is_unbounded());
 
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_zone.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_zone.cpp
index 54291b4bf5a3..78b9cbadd4d0 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_zone.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_zone.cpp
@@ -17,7 +17,7 @@ typedef CGAL::Arrangement_2<Traits_2>                   Arrangement_2;
 typedef Arrangement_2::Vertex_handle                    Vertex_handle;
 typedef Arrangement_2::Halfedge_handle                  Halfedge_handle;
 typedef Arrangement_2::Face_handle                      Face_handle;
-typedef boost::variant<Vertex_handle, Halfedge_handle, Face_handle>
+typedef std::variant<Vertex_handle, Halfedge_handle, Face_handle>
                                                         Zone_result;
 
 #define N_SEGMENTS 3
diff --git a/BGL/examples/BGL_triangulation_2/dijkstra.cpp b/BGL/examples/BGL_triangulation_2/dijkstra.cpp
index 3a1b061eb9e3..87c308e18bb2 100644
--- a/BGL/examples/BGL_triangulation_2/dijkstra.cpp
+++ b/BGL/examples/BGL_triangulation_2/dijkstra.cpp
@@ -60,9 +60,9 @@ int main(int argc,char* argv[])
   for(vertex_descriptor vd : vertices(tr))
   {
     std::cout << vd->point() << " [" <<  vertex_id_map[vd] << "] ";
-    std::cout << " has distance = " << boost::get(distance_pmap,vd)
+    std::cout << " has distance = " << std::get(distance_pmap,vd)
               << " and predecessor ";
-    vd = boost::get(predecessor_pmap,vd);
+    vd = std::get(predecessor_pmap,vd);
     std::cout << vd->point() << " [" <<  vertex_id_map[vd] << "]\n ";
   }
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
index 0d90fbacb2f9..0ceae84b195e 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
@@ -18,7 +18,7 @@ class Intersect_2 {
 
 /*! computes the intersections of `xc1` and `xc2` and inserts them <I>in an
  * ascending lexicographic \f$ xy\f$-order</I> into a range beginning at
- * `oi`. The type `OutputIterator` dereferences a `boost::variant` of either the
+ * `oi`. The type `OutputIterator` dereferences a `std::variant` of either the
  * type `pair<ArrDirectionalTraits::Point_2,
  * ArrDirectionalTraits::Multiplicity>` or the type
  * `ArrDirectionalTraits::X_monotone_curve_2`. An object of the former type
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
index ef8cc06083f9..d5372d0be793 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
@@ -160,10 +160,10 @@ class Gps_agg_meta_traits :
 
       typedef const std::pair<Base_point_2, Multiplicity>
         Intersection_base_point;
-      typedef boost::variant<Intersection_base_point, Base_x_monotone_curve_2>
+      typedef std::variant<Intersection_base_point, Base_x_monotone_curve_2>
                                                         Intersection_base_result;
       typedef const std::pair<Point_2, Multiplicity>    Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
 
       const auto* base_traits = m_traits.m_base_traits;
@@ -183,7 +183,7 @@ class Gps_agg_meta_traits :
       // the extenede X_monotone_curve_2
       for (const auto& xection : xections) {
         const Intersection_base_point* base_pt =
-          boost::get<Intersection_base_point>(&xection);
+          std::get_if<Intersection_base_point>(&xection);
         if (base_pt != nullptr) {
           Point_2 point_plus(base_pt->first); // the extended point
           *oi++ =
@@ -192,7 +192,7 @@ class Gps_agg_meta_traits :
         }
 
         const Base_x_monotone_curve_2* overlap_cv =
-          boost::get<Base_x_monotone_curve_2>(&xection);
+          std::get_if<Base_x_monotone_curve_2>(&xection);
         CGAL_assertion(overlap_cv != nullptr);
         unsigned int ov_bc;
         unsigned int ov_twin_bc;
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_simplifier_traits.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_simplifier_traits.h
index fdc111751de8..0776b8336130 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_simplifier_traits.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_simplifier_traits.h
@@ -133,10 +133,10 @@ class Gps_simplifier_traits :
     {
       typedef const std::pair<Base_point_2, Multiplicity>
         Intersection_base_point;
-      typedef boost::variant<Intersection_base_point, Base_x_monotone_curve_2>
+      typedef std::variant<Intersection_base_point, Base_x_monotone_curve_2>
                                                         Intersection_base_result;
       typedef const std::pair<Point_2, Multiplicity>    Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
 
       const auto* base_traits = m_traits.m_base_traits;
@@ -170,7 +170,7 @@ class Gps_simplifier_traits :
       // the extenede X_monotone_curve_2
       for (const auto& xection : xections) {
         const Intersection_base_point* base_pt =
-          boost::get<Intersection_base_point>(&xection);
+          std::get_if<Intersection_base_point>(&xection);
         if (base_pt != nullptr) {
           Point_data pt_data(m_traits.invalid_index());
           Point_2 point_plus(base_pt->first, pt_data); // the extended point
@@ -180,7 +180,7 @@ class Gps_simplifier_traits :
         }
 
         const Base_x_monotone_curve_2* overlap_cv =
-          boost::get<Base_x_monotone_curve_2>(&xection);
+          std::get_if<Base_x_monotone_curve_2>(&xection);
 
         CGAL_assertion(overlap_cv != nullptr);
         unsigned int ov_bc;
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Polygon_conversions.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Polygon_conversions.h
index f974c628e319..0f880d66ad20 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Polygon_conversions.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Polygon_conversions.h
@@ -92,7 +92,7 @@ convert_polygon(const Polygon_2<Kernel, Container>& polygon,
   if (polygon.is_empty()) return General_polygon_2<ArrTraits>();
   using Point = typename ArrTraits::Point_2;
   using X_monotone_curve = typename ArrTraits::X_monotone_curve_2;
-  using Make_x_monotone_result = boost::variant<Point, X_monotone_curve>;
+  using Make_x_monotone_result = std::variant<Point, X_monotone_curve>;
   auto cv = ctr(boost::range::join(CGAL::make_range(polygon.vertices_begin(),
                                                     polygon.vertices_end()),
                                    CGAL::make_single(*polygon.vertices_begin())));
@@ -101,7 +101,7 @@ convert_polygon(const Polygon_2<Kernel, Container>& polygon,
   make_x_mtn(cv,
              boost::make_function_output_iterator
              ([&](const Make_x_monotone_result& obj)
-              { gpgn.push_back(*(boost::get<X_monotone_curve>(&obj))); }));
+              { gpgn.push_back(*(std::get_if<X_monotone_curve>(&obj))); }));
   return gpgn;
 }
 
diff --git a/Boolean_set_operations_2/test/Boolean_set_operations_2/test_general_polygon_constructions.cpp b/Boolean_set_operations_2/test/Boolean_set_operations_2/test_general_polygon_constructions.cpp
index be2fb2d3e5b0..81add300c235 100644
--- a/Boolean_set_operations_2/test/Boolean_set_operations_2/test_general_polygon_constructions.cpp
+++ b/Boolean_set_operations_2/test/Boolean_set_operations_2/test_general_polygon_constructions.cpp
@@ -66,11 +66,11 @@ int main() {
     ctr(boost::range::join(CGAL::make_range(points.begin(), points.end()),
                            CGAL::make_single(*points.begin())));
   General_pgn gpgn2;
-  using Make_x_monotone_result = boost::variant<Point_2, X_monotone_curve_2>;
+  using Make_x_monotone_result = std::variant<Point_2, X_monotone_curve_2>;
   make_x_mtn(curve2,
              boost::make_function_output_iterator
              ([&](const Make_x_monotone_result& obj)
-              { gpgn2.push_back(*(boost::get<X_monotone_curve_2>(&obj))); }));
+              { gpgn2.push_back(*(std::get_if<X_monotone_curve_2>(&obj))); }));
   std::cout << "gpgn2: " << gpgn2 << std::endl;
 
   // Case 3: Polyline-based GPS from polyline of segments
@@ -81,7 +81,7 @@ int main() {
   make_x_mtn(curve3,
              boost::make_function_output_iterator
              ([&](const Make_x_monotone_result& obj)
-              { gpgn3.push_back(*(boost::get<X_monotone_curve_2>(&obj))); }));
+              { gpgn3.push_back(*(std::get_if<X_monotone_curve_2>(&obj))); }));
   std::cout << "gpgn3: " << gpgn3 << std::endl;
 
   if (! eql(gpgn2, gpgn3)) {
diff --git a/CGAL_ImageIO/include/CGAL/SEP_header.h b/CGAL_ImageIO/include/CGAL/SEP_header.h
index 17c40493ef54..d7a26eda8ffd 100644
--- a/CGAL_ImageIO/include/CGAL/SEP_header.h
+++ b/CGAL_ImageIO/include/CGAL/SEP_header.h
@@ -57,12 +57,12 @@ struct SEP_header_aux
   {
     using boost::get;
     visitor vis(this, get<0>(tuple));
-    boost::apply_visitor(vis, get<1>(tuple));
+    std::visit(vis, get<1>(tuple));
     return *this;
   }
 
 private:
-  struct visitor : public boost::static_visitor<> {
+  struct visitor {
     SEP_header_aux* self;
     std::string key;
     visitor(SEP_header_aux* header, std::string key)
@@ -262,7 +262,7 @@ class SEP_header {
 #endif // CGAL_SEP_READER_DEBUG
     } // end constructor of sep_header_grammar
 
-    typedef boost::variant<double,
+    typedef std::variant<double,
                            int,
                            std::string> value;
     typedef boost::tuple<std::string, value> entry_type;
diff --git a/Cartesian_kernel/include/CGAL/Cartesian_converter.h b/Cartesian_kernel/include/CGAL/Cartesian_converter.h
index c2e9806c2bb7..9333fa9f5437 100644
--- a/Cartesian_kernel/include/CGAL/Cartesian_converter.h
+++ b/Cartesian_kernel/include/CGAL/Cartesian_converter.h
@@ -55,7 +55,7 @@ struct Default_converter {
 
 // Out will be a variant, source kernel and target kernel
 template<typename Converter, typename Output>
-struct Converting_visitor : boost::static_visitor<> {
+struct Converting_visitor{
   Converting_visitor(const Converter& conv, Output& out) : conv(&conv), out(&out) {}
   const Converter* conv;
   Output* out;
@@ -138,13 +138,13 @@ class Cartesian_converter : public Enum_converter
     // from the sequence, transform with the type mapper and throw the
     // new list into a variant
     // visit to get the type, and copy construct inside the return type
-    template<BOOST_VARIANT_ENUM_PARAMS(typename U)>
+    template<typename ... U>
     typename
-    Type_mapper< std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >,
+    Type_mapper< std::optional< std::variant< U ... > >,
                  K1, K2 >::type
-    operator()(const std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const {
+    operator()(const std::optional< std::variant< U ... > >& o) const {
       typedef typename
-        Type_mapper< std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >,
+        Type_mapper< std::optional< std::variant< U ... > >,
                      K1, K2 >::type result_type;
       result_type res;
       if(!o) {
@@ -154,22 +154,22 @@ class Cartesian_converter : public Enum_converter
 
       internal::Converting_visitor<Self, result_type>
         conv_visitor = internal::Converting_visitor<Self, result_type>(*this, res);
-      boost::apply_visitor(conv_visitor, *o);
+      std::visit(conv_visitor, *o);
       return res;
     }
 
-    template<BOOST_VARIANT_ENUM_PARAMS(typename U)>
+    template<typename ... U>
     typename
-    Type_mapper< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) >,
+    Type_mapper< std::variant< U ... >,
                  K1, K2 >::type
-    operator()(const boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > & o) const {
+    operator()(const std::variant< U ... > & o) const {
       typedef typename
-        Type_mapper< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) >,
+        Type_mapper< std::variant< U ... >,
                      K1, K2 >::type result_type;
       result_type res;
       internal::Converting_visitor<Self, result_type>
         conv_visitor = internal::Converting_visitor<Self, result_type>(*this, res);
-      boost::apply_visitor(conv_visitor, o);
+      std::visit(conv_visitor, o);
       return res;
     }
 
diff --git a/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmark.h b/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmark.h
index 1e7db3856c0e..a20f96ce0dda 100644
--- a/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmark.h
+++ b/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmark.h
@@ -11,7 +11,7 @@
 #include <iomanip>
 #include <fstream>
 #include "Input_data.h"
-#include <boost/variant.hpp>
+#include <variant>
 
 
 
diff --git a/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmarks_arrangement.cpp b/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmarks_arrangement.cpp
index 674e5a0ea533..a0958077ead5 100644
--- a/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmarks_arrangement.cpp
+++ b/Circular_kernel_2/benchmark/DxfArrayBenchmarks/benchmarks_arrangement.cpp
@@ -72,7 +72,7 @@ for(i=1;i<6;i++){
   typedef CircularKernel::Line_arc_2                                      Line_arc_2;
   typedef CGAL::Variant_traits<CircularKernel,Line_arc_2,Circular_arc_2>  CircularK_Variant_Traits;
 
-  typedef boost::variant< Circular_arc_2, Line_arc_2 >        CircularKVarArc;
+  typedef std::variant< Circular_arc_2, Line_arc_2 >        CircularKVarArc;
   typedef std::vector<CircularKVarArc>                        CircularKVarArcContainer;
 
   bench.kernel("CK VarTraits");
@@ -93,7 +93,7 @@ for(i=1;i<6;i++){
 
   typedef BBCircularKernel::Circular_arc_2                                        Circular_arc_6;
   typedef BBCircularKernel::Line_arc_2                                            Line_arc_6;
-  typedef boost::variant<Circular_arc_6,Line_arc_6 >                  BBCircVarArc;
+  typedef std::variant<Circular_arc_6,Line_arc_6 >                  BBCircVarArc;
   typedef std::vector<BBCircVarArc>                                   BBCircVarContainer;
   typedef CGAL::Variant_traits<BBCircularKernel,Line_arc_6,Circular_arc_6>  BBCircVariantTraits;
 
diff --git a/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h b/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h
index 36210feffcb8..3e51c351e485 100644
--- a/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h
+++ b/Circular_kernel_2/benchmark/arrangement_traits/benchmark.h
@@ -11,7 +11,7 @@
 #include <iomanip>
 #include <fstream>
 #include "Input_data.h"
-#include <boost/variant.hpp>
+#include <variant>
 
 class Bench
 {
diff --git a/Circular_kernel_2/benchmark/arrangement_traits/benchmarks_arrangement.cpp b/Circular_kernel_2/benchmark/arrangement_traits/benchmarks_arrangement.cpp
index 5ebf26838bcf..056ae74e3920 100644
--- a/Circular_kernel_2/benchmark/arrangement_traits/benchmarks_arrangement.cpp
+++ b/Circular_kernel_2/benchmark/arrangement_traits/benchmarks_arrangement.cpp
@@ -166,7 +166,7 @@ Bench bench(Htmlfilename,Texfilename,Dxffilename[i]);
   typedef CircularKernel::Line_arc_2                                      Line_arc_2;
   typedef CGAL::Variant_traits<CircularKernel,Line_arc_2,Circular_arc_2>  CircularK_Variant_Traits;
 
-  typedef boost::variant< Circular_arc_2, Line_arc_2 >        CircularKVarArc;
+  typedef std::variant< Circular_arc_2, Line_arc_2 >        CircularKVarArc;
   typedef std::vector<CircularKVarArc>                        CircularKVarArcContainer;
 
   bench.kernel("Circular kernel  Variant traits");
diff --git a/Circular_kernel_2/benchmark/benchmark.h b/Circular_kernel_2/benchmark/benchmark.h
index 9d13d728f659..94b00a889060 100644
--- a/Circular_kernel_2/benchmark/benchmark.h
+++ b/Circular_kernel_2/benchmark/benchmark.h
@@ -11,7 +11,7 @@
 #include <iomanip>
 #include <fstream>
 #include "Input_data.h"
-#include <boost/variant.hpp>
+#include <variant>
 #include <exception>
 
 
diff --git a/Circular_kernel_2/benchmark/benchmark_CK2.cpp b/Circular_kernel_2/benchmark/benchmark_CK2.cpp
index 54a4137e4ce8..814bb3c0481f 100644
--- a/Circular_kernel_2/benchmark/benchmark_CK2.cpp
+++ b/Circular_kernel_2/benchmark/benchmark_CK2.cpp
@@ -38,7 +38,7 @@ typedef std::vector<CircularKArc> CircularKArcContainer;
 typedef CircularKernel::Circular_arc_2 Circular_arc_2;
 typedef CircularKernel::Line_arc_2 Line_arc_2;
 typedef CGAL::Arr_circular_line_arc_traits_2<CircularKernel>   CircularK_Variant_Traits;
-typedef boost::variant< Circular_arc_2, Line_arc_2 > CircularKVarArc;
+typedef std::variant< Circular_arc_2, Line_arc_2 > CircularKVarArc;
 typedef std::vector<CircularKVarArc> CircularKVarArcContainer;
 
 
@@ -55,7 +55,7 @@ typedef BBCircularKernel::Circular_arc_2
   Circular_arc_6;
 typedef BBCircularKernel::Line_arc_2
   Line_arc_6;
-typedef boost::variant<Circular_arc_6,Line_arc_6 >
+typedef std::variant<Circular_arc_6,Line_arc_6 >
   BBCircVarArc;
 typedef std::vector<BBCircVarArc>
   BBCircVarContainer;
diff --git a/Circular_kernel_2/benchmark/benchmarks_arrangement.cpp b/Circular_kernel_2/benchmark/benchmarks_arrangement.cpp
index 3b548a20e2aa..59867dbd1e3d 100644
--- a/Circular_kernel_2/benchmark/benchmarks_arrangement.cpp
+++ b/Circular_kernel_2/benchmark/benchmarks_arrangement.cpp
@@ -163,7 +163,7 @@ Bench bench;                        //If you want create table with all datasets
   typedef CircularKernel::Line_arc_2                                      Line_arc_2;
   typedef CGAL::Arr_circular_line_arc_traits_2<CircularKernel>  CircularK_Variant_Traits;
 
-  typedef boost::variant< Circular_arc_2, Line_arc_2 >        CircularKVarArc;
+  typedef std::variant< Circular_arc_2, Line_arc_2 >        CircularKVarArc;
   typedef std::vector<CircularKVarArc>                        CircularKVarArcContainer;
 
   bench.kernel("CKVar");
@@ -197,7 +197,7 @@ bench.Compute_no_dxf<CircularKernel,CircularK_Variant_Traits,CircularKVarArcCont
 
   typedef BBCircularKernel::Circular_arc_2                                        Circular_arc_6;
   typedef BBCircularKernel::Line_arc_2                                            Line_arc_6;
-  typedef boost::variant<Circular_arc_6,Line_arc_6 >                  BBCircVarArc;
+  typedef std::variant<Circular_arc_6,Line_arc_6 >                  BBCircVarArc;
   typedef std::vector<BBCircVarArc>                                   BBCircVarContainer;
   typedef CGAL::Arr_circular_line_arc_traits_2<BBCircularKernel>  BBCircVariantTraits;
 
diff --git a/Circular_kernel_2/benchmark/bff_reader/Breader.cpp b/Circular_kernel_2/benchmark/bff_reader/Breader.cpp
index 3fac248eb683..ac18cceab92f 100644
--- a/Circular_kernel_2/benchmark/bff_reader/Breader.cpp
+++ b/Circular_kernel_2/benchmark/bff_reader/Breader.cpp
@@ -189,7 +189,7 @@ int main( int argc, char* argv[] ) {
   typedef CK::Circular_arc_2                                  Circular_arc_2;
   typedef CK::Line_arc_2                                      Line_arc_2;
   typedef CGAL::Variant_traits<CK,Line_arc_2,Circular_arc_2>  CircularK_Variant_Traits;
-  typedef boost::variant< Circular_arc_2, Line_arc_2 >        CircularKVarArc;
+  typedef std::variant< Circular_arc_2, Line_arc_2 >        CircularKVarArc;
   typedef std::vector<CircularKVarArc>                        CircularKVarArcContainer;
         CircularKVarArcContainer arc;
         typedef CGAL::Arrangement_2<CircularK_Variant_Traits>                 Pmwx;
diff --git a/Circular_kernel_2/benchmark/dxf_to_bff/dxf_converter.h b/Circular_kernel_2/benchmark/dxf_to_bff/dxf_converter.h
index b8ad60ea3c13..3b54da14f930 100644
--- a/Circular_kernel_2/benchmark/dxf_to_bff/dxf_converter.h
+++ b/Circular_kernel_2/benchmark/dxf_to_bff/dxf_converter.h
@@ -5,7 +5,7 @@
 #include <sstream>
 #include <cassert>
 #include <CGAL/Cartesian.h>
-#include <boost/variant.hpp>
+#include <variant>
 #include <CGAL/intersections.h>
 #include <CGAL/MP_Float.h>
 #include <CGAL/Circular_kernel_2.h>
diff --git a/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h b/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h
index 3787adde5222..75218b2430b4 100644
--- a/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h
+++ b/Circular_kernel_2/benchmark/incremental_insertion/benchmark.h
@@ -11,7 +11,7 @@
 #include <iomanip>
 #include <fstream>
 #include "Input_data.h"
-#include <boost/variant.hpp>
+#include <variant>
 
 class Bench
 {
diff --git a/Circular_kernel_2/benchmark/incremental_insertion/benchmarks_arrangement.cpp b/Circular_kernel_2/benchmark/incremental_insertion/benchmarks_arrangement.cpp
index 8895b11f3725..c00db5e079a0 100644
--- a/Circular_kernel_2/benchmark/incremental_insertion/benchmarks_arrangement.cpp
+++ b/Circular_kernel_2/benchmark/incremental_insertion/benchmarks_arrangement.cpp
@@ -157,7 +157,7 @@ Bench bench(Htmlfilename,Texfilename,Dxffilename[i],true);
   typedef CircularKernel::Line_arc_2                                      Line_arc_2;
   typedef CGAL::Variant_traits<CircularKernel,Line_arc_2,Circular_arc_2>  CircularK_Variant_Traits;
 
-  typedef boost::variant< Circular_arc_2, Line_arc_2 >        CircularKVarArc;
+  typedef std::variant< Circular_arc_2, Line_arc_2 >        CircularKVarArc;
   typedef std::vector<CircularKVarArc>                        CircularKVarArcContainer;
 
   bench.kernel("Circular kernel  Variant traits");
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h
index 674b4ca27b20..34ba0ccc3868 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h
@@ -19,7 +19,7 @@
 
 #include <CGAL/Intersection_traits.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 
@@ -40,7 +40,7 @@ template<typename CK>
 struct CK2_Intersection_traits<CK, typename CK::Circle_2, typename CK::Circle_2>
 {
   typedef typename
-  boost::variant< typename CK::Circle_2,
+  std::variant< typename CK::Circle_2,
                   typename std::pair< typename CK::Circular_arc_point_2,
                                       unsigned int >
                   CGAL_ADDITIONAL_VARIANT_FOR_ICL
@@ -52,7 +52,7 @@ template<typename CK>
 struct CK2_Intersection_traits<CK, typename CK::Circular_arc_2, typename CK::Circular_arc_2>
 {
   typedef typename
-  boost::variant< typename CK::Circular_arc_2,
+  std::variant< typename CK::Circular_arc_2,
                   typename std::pair< typename CK::Circular_arc_point_2,
                                       unsigned int >
                   CGAL_ADDITIONAL_VARIANT_FOR_ICL
@@ -64,7 +64,7 @@ template<typename CK>
 struct CK2_Intersection_traits<CK, typename CK::Line_arc_2, typename CK::Line_arc_2>
 {
   typedef typename
-  boost::variant< typename CK::Line_arc_2,
+  std::variant< typename CK::Line_arc_2,
                   typename std::pair< typename CK::Circular_arc_point_2,
                                       unsigned int >
                   CGAL_ADDITIONAL_VARIANT_FOR_ICL
@@ -76,7 +76,7 @@ template<typename CK>
 struct CK2_Intersection_traits<CK, typename CK::Line_arc_2, typename CK::Circle_2>
 {
   typedef typename
-  boost::variant< typename std::pair< typename CK::Circular_arc_point_2,
+  std::variant< typename std::pair< typename CK::Circular_arc_point_2,
                                       unsigned int >
                   CGAL_ADDITIONAL_VARIANT_FOR_ICL
                   >
@@ -92,7 +92,7 @@ template<typename CK>
 struct CK2_Intersection_traits<CK, typename CK::Line_arc_2, typename CK::Circular_arc_2>
 {
   typedef typename
-  boost::variant< typename std::pair< typename CK::Circular_arc_point_2,
+  std::variant< typename std::pair< typename CK::Circular_arc_point_2,
                                       unsigned int >
                   CGAL_ADDITIONAL_VARIANT_FOR_ICL
                   >
@@ -108,7 +108,7 @@ template<typename CK>
 struct CK2_Intersection_traits<CK, typename CK::Line_arc_2, typename CK::Line_2>
 {
   typedef typename
-  boost::variant< typename CK::Line_arc_2,
+  std::variant< typename CK::Line_arc_2,
                   typename std::pair< typename CK::Circular_arc_point_2,
                                       unsigned int >
                   CGAL_ADDITIONAL_VARIANT_FOR_ICL
@@ -125,7 +125,7 @@ template<typename CK>
 struct CK2_Intersection_traits<CK, typename CK::Line_2, typename CK::Circular_arc_2>
 {
   typedef typename
-  boost::variant< typename std::pair< typename CK::Circular_arc_point_2,
+  std::variant< typename std::pair< typename CK::Circular_arc_point_2,
                                       unsigned int >
                   CGAL_ADDITIONAL_VARIANT_FOR_ICL
                   >
@@ -155,7 +155,7 @@ template<typename CK>
 struct CK2_Intersection_traits<CK, typename CK::Line_2, typename CK::Circle_2>
 {
   typedef typename
-  boost::variant< typename std::pair< typename CK::Circular_arc_point_2,
+  std::variant< typename std::pair< typename CK::Circular_arc_point_2,
                                       unsigned int >
                   CGAL_ADDITIONAL_VARIANT_FOR_ICL
                   >
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h
index baecb2157250..ce3bb2e507fe 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h
@@ -497,7 +497,7 @@ namespace CircularFunctors {
   }
 
   template<typename CK, typename T>
-  struct Has_on_visitor : public boost::static_visitor<bool> {
+  struct Has_on_visitor {
     Has_on_visitor(const T* l) : l(l){}
     const T* l;
     bool operator()(const std::pair<typename CK::Circular_arc_point_2, unsigned>& pair) const {
@@ -527,7 +527,7 @@ namespace CircularFunctors {
 
     for (typename solutions_container::iterator it = solutions.begin();
          it != solutions.end(); ++it) {
-      if(boost::apply_visitor(Has_on_visitor<CK, typename CK::Line_arc_2>(&l), *it))
+      if(std::visit(Has_on_visitor<CK, typename CK::Line_arc_2>(&l), *it))
         *res++ = *it;
     }
 
@@ -681,8 +681,8 @@ namespace CircularFunctors {
     for (typename solutions_container::iterator it = solutions.begin();
          it != solutions.end(); ++it)
     {
-      if(boost::apply_visitor(Has_on_visitor<CK, typename CK::Line_arc_2>(&l), *it) &&
-         boost::apply_visitor(Has_on_visitor<CK, typename CK::Circular_arc_2>(&c), *it) )
+      if(std::visit(Has_on_visitor<CK, typename CK::Line_arc_2>(&l), *it) &&
+         std::visit(Has_on_visitor<CK, typename CK::Circular_arc_2>(&c), *it) )
       {
         *res++ = *it;
       }
@@ -757,7 +757,7 @@ namespace CircularFunctors {
       v = intersection(l, la.supporting_line());
 
     if(!v) return res;
-    const Point_2 *pt = boost::get<Point_2>(&*v);
+    const Point_2 *pt = std::get_if<Point_2>(&*v);
     if(pt == nullptr) return res;
 
     Circular_arc_point_2 intersect_point = Circular_arc_point_2(*pt);
@@ -790,7 +790,7 @@ namespace CircularFunctors {
 
     for (typename solutions_container::const_iterator it = solutions.begin();
          it != solutions.end(); ++it) {
-      if(boost::apply_visitor(Has_on_visitor<CK, Circular_arc_2>(&c), *it))
+      if(std::visit(Has_on_visitor<CK, Circular_arc_2>(&c), *it))
         *res++ = *it;
     }
     return res;
diff --git a/Circular_kernel_2/include/CGAL/IO/Dxf_variant_reader.h b/Circular_kernel_2/include/CGAL/IO/Dxf_variant_reader.h
index d0ace79c85c3..f6eb3d8fd78c 100644
--- a/Circular_kernel_2/include/CGAL/IO/Dxf_variant_reader.h
+++ b/Circular_kernel_2/include/CGAL/IO/Dxf_variant_reader.h
@@ -29,7 +29,7 @@
 #include <iostream>
 #include <string>
 #include <list>
-#include <boost/variant.hpp>
+#include <variant>
 #include <CGAL/array.h>
 
 
@@ -47,7 +47,7 @@ template<class CK,class Circular_arc_2, class Line_arc_2, class OutputIterator>
   typedef typename CK::Line_2  Line_2;
   typedef typename CK::Point_2 Point_2;
   typedef typename CK::Circle_2 Circle_2;
-  typedef typename boost::variant< Circular_arc_2, Line_arc_2 >        Arc;
+  typedef typename std::variant< Circular_arc_2, Line_arc_2 >        Arc;
   typedef std::list<Triplet> Polygon;
   typedef std::list<Polygon> Polygons;
   typedef std::list<Triplet> Circles;
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_3.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_3.h
index 9ef9b35f1340..fb5420471dbb 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_3.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_3.h
@@ -167,11 +167,11 @@ namespace CGAL {
          CGAL_kernel_precondition(sols1.size() > 0);
          CGAL_kernel_precondition(sols2.size() > 0);
          const std::pair<typename SK::Circular_arc_point_3, unsigned>& pair1=
-            *boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(
+            *std::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(
               &sols1[(sols1.size()==1)?(0):(less_xyz_s1?0:1)]
             );
          const std::pair<typename SK::Circular_arc_point_3, unsigned>& pair2=
-            *boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(
+            *std::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(
               &sols2[(sols2.size()==1)?(0):(less_xyz_s2?0:1)]
             );
          // the source and target must be different
@@ -194,11 +194,11 @@ namespace CGAL {
          CGAL_kernel_precondition(sols1.size() > 0);
          CGAL_kernel_precondition(sols2.size() > 0);
          const std::pair<typename SK::Circular_arc_point_3, unsigned>& pair1=
-           *boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(
+           *std::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(
               &sols1[(sols1.size()==1)?(0):(less_xyz_p1?0:1)]
             );
          const std::pair<typename SK::Circular_arc_point_3, unsigned>& pair2=
-           *boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(
+           *std::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(
               &sols2[(sols2.size()==1)?(0):(less_xyz_p2?0:1)]
             );
          // the source and target must be different
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_point_3.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_point_3.h
index bfb44edf9245..99eb521e1fa6 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_point_3.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Circular_arc_point_3.h
@@ -81,13 +81,13 @@ class Circular_arc_point_3
     if(sols.size() == 1) {
       // the intersection must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     } else {
       // the intersections must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     }
@@ -104,13 +104,13 @@ class Circular_arc_point_3
     if(sols.size() == 1) {
       // the intersection must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     } else {
       // the intersections must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     }
@@ -127,13 +127,13 @@ class Circular_arc_point_3
     if(sols.size() == 1) {
       // the intersection must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     } else {
       // the intersections must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     }
@@ -149,13 +149,13 @@ class Circular_arc_point_3
     if(sols.size() == 1) {
       // the intersection must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     } else {
       // the intersections must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     }
@@ -171,13 +171,13 @@ class Circular_arc_point_3
     if(sols.size() == 1) {
       // the intersection must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     } else {
       // the intersections must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     }
@@ -193,13 +193,13 @@ class Circular_arc_point_3
     if(sols.size() == 1) {
       // the intersection must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     } else {
       // the intersections must be a point
       const std::pair<typename SK::Circular_arc_point_3, unsigned>* pair=
-        boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
+        std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[less_xyz?0:1]);
       CGAL_kernel_precondition(pair!=nullptr);
       *this = pair->first.rep();
     }
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
index 7a90c240e03a..02da04e08975 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/Intersection_traits.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <utility>
 
 namespace CGAL {
@@ -36,7 +36,7 @@ struct SK3_Intersection_traits
 template <typename SK>
 struct SK3_Intersection_traits<SK, typename SK::Sphere_3, typename SK::Line_3>
 {
-  typedef boost::variant<
+  typedef std::variant<
             std::pair< typename SK::Circular_arc_point_3, unsigned int >
             CGAL_ADDITIONAL_VARIANT_FOR_ICL
           > type;
@@ -49,7 +49,7 @@ struct SK3_Intersection_traits<SK, typename SK::Line_3, typename SK::Sphere_3>
 template <typename SK>
 struct SK3_Intersection_traits<SK, typename SK::Circle_3, typename SK::Plane_3>
 {
-  typedef boost::variant<
+  typedef std::variant<
             std::pair< typename SK::Circular_arc_point_3, unsigned int >,
             typename SK::Circle_3
             CGAL_ADDITIONAL_VARIANT_FOR_ICL
@@ -63,7 +63,7 @@ struct SK3_Intersection_traits<SK, typename SK::Plane_3, typename SK::Circle_3>
 template <typename SK>
 struct SK3_Intersection_traits<SK, typename SK::Circle_3, typename SK::Sphere_3>
 {
-  typedef boost::variant<
+  typedef std::variant<
             std::pair< typename SK::Circular_arc_point_3, unsigned int >,
             typename SK::Circle_3
             CGAL_ADDITIONAL_VARIANT_FOR_ICL
@@ -77,7 +77,7 @@ struct SK3_Intersection_traits<SK, typename SK::Sphere_3, typename SK::Circle_3>
 template <typename SK>
 struct SK3_Intersection_traits<SK, typename SK::Circle_3, typename SK::Circle_3>
 {
-  typedef boost::variant<
+  typedef std::variant<
             std::pair <typename SK::Circular_arc_point_3, unsigned int >,
             typename SK::Circle_3
             CGAL_ADDITIONAL_VARIANT_FOR_ICL
@@ -87,7 +87,7 @@ struct SK3_Intersection_traits<SK, typename SK::Circle_3, typename SK::Circle_3>
 template <typename SK>
 struct SK3_Intersection_traits<SK, typename SK::Circle_3, typename SK::Line_3>
 {
-  typedef boost::variant<
+  typedef std::variant<
             std::pair <typename SK::Circular_arc_point_3, unsigned int >
             CGAL_ADDITIONAL_VARIANT_FOR_ICL
           > type;
@@ -100,7 +100,7 @@ struct SK3_Intersection_traits<SK, typename SK::Line_3, typename SK::Circle_3>
 template <typename SK>
 struct SK3_Intersection_traits<SK, typename SK::Circular_arc_3, typename SK::Circular_arc_3>
 {
-  typedef boost::variant<
+  typedef std::variant<
             typename SK::Circle_3,
             std::pair <typename SK::Circular_arc_point_3, unsigned int >,
             typename SK::Circular_arc_3
@@ -111,7 +111,7 @@ struct SK3_Intersection_traits<SK, typename SK::Circular_arc_3, typename SK::Cir
 template <typename SK>
 struct SK3_Intersection_traits<SK, typename SK::Circular_arc_3, typename SK::Plane_3>
 {
-  typedef boost::variant<
+  typedef std::variant<
             std::pair <typename SK::Circular_arc_point_3, unsigned int >,
             typename SK::Circular_arc_3
             CGAL_ADDITIONAL_VARIANT_FOR_ICL
@@ -125,7 +125,7 @@ struct SK3_Intersection_traits<SK, typename SK::Plane_3, typename SK::Circular_a
 template <typename SK>
 struct SK3_Intersection_traits<SK, typename SK::Line_arc_3, typename SK::Line_arc_3>
 {
-  typedef boost::variant<
+  typedef std::variant<
             std::pair <typename SK::Circular_arc_point_3, unsigned int >,
             typename SK::Line_arc_3
             CGAL_ADDITIONAL_VARIANT_FOR_ICL
@@ -136,7 +136,7 @@ struct SK3_Intersection_traits<SK, typename SK::Line_arc_3, typename SK::Line_ar
 template <typename SK>
 struct SK3_intersect_ternary
 {
-  typedef boost::variant<
+  typedef std::variant<
             typename SK::Circle_3,
             typename SK::Plane_3,
             typename SK::Sphere_3,
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Line_arc_3.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Line_arc_3.h
index 9d10940f0aaf..de30249490da 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Line_arc_3.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Line_arc_3.h
@@ -94,9 +94,9 @@ namespace CGAL {
          // l must intersect s in 2 points
          CGAL_kernel_precondition(sols.size() == 2);
          const std::pair<typename SK::Circular_arc_point_3, unsigned>& pair1=
-           *boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
+           *std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[0]);
          const std::pair<typename SK::Circular_arc_point_3, unsigned>& pair2=
-            *boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[1]);
+            *std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols[1]);
          if(less_xyz_first) {
            *this = Line_arc_3(l, pair1.first, pair2.first);
          } else {
@@ -115,9 +115,9 @@ namespace CGAL {
          CGAL_kernel_precondition(sols1.size() > 0);
          CGAL_kernel_precondition(sols2.size() > 0);
          const std::pair<typename SK::Circular_arc_point_3, unsigned>& pair1=
-            *boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols1[(sols1.size()==1)?(0):(less_xyz_s1?0:1)]);
+            *std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols1[(sols1.size()==1)?(0):(less_xyz_s1?0:1)]);
          const std::pair<typename SK::Circular_arc_point_3, unsigned>& pair2=
-            *boost::get<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols2[(sols2.size()==1)?(0):(less_xyz_s2?0:1)]);
+            *std::get_if<std::pair<typename SK::Circular_arc_point_3, unsigned> >(&sols2[(sols2.size()==1)?(0):(less_xyz_s2?0:1)]);
          // the source and target must be different
          CGAL_kernel_precondition(pair1.first != pair2.first);
          *this = Line_arc_3(l, pair1.first, pair2.first);
@@ -134,8 +134,8 @@ namespace CGAL {
          typedef typename SK3_Intersection_traits<SK, Line_3, Plane_3>::type Intersection;
          Intersection i1 = SK().intersect_3_object()(l, p1);
          Intersection i2 = SK().intersect_3_object()(l, p2);
-         const typename SK::Point_3* point1=boost::get<typename SK::Point_3>( & *i1 );
-         const typename SK::Point_3* point2=boost::get<typename SK::Point_3>( & *i2 );
+         const typename SK::Point_3* point1=std::get_if<typename SK::Point_3>( & *i1 );
+         const typename SK::Point_3* point2=std::get_if<typename SK::Point_3>( & *i2 );
          CGAL_assertion(point1!=nullptr);
          CGAL_assertion(point2!=nullptr);
          // the source and target must be different
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h
index 43a371937ecf..f17acf269084 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h
@@ -223,7 +223,7 @@ namespace CGAL {
    // (again: converting to RT before assigning to the Iterator is
    // just to keep object working)
    template<typename SK, typename RT, typename OutputIterator>
-   struct Point_conversion_visitor : public boost::static_visitor<OutputIterator> {
+   struct Point_conversion_visitor {
      Point_conversion_visitor(const OutputIterator& it) : it(it) {}
      template<typename T>
      OutputIterator operator()(const T& t) { *it++ = RT(t); return it; }
@@ -291,7 +291,7 @@ namespace CGAL {
          if(typename Intersection_traits<SK, Sphere_3, Sphere_3>::result_type v =
             SK().intersect_3_object()(s1, s3)) {
            internal::Point_conversion_visitor<SK, result_type, OutputIterator> visitor(res);
-           return boost::apply_visitor(visitor,
+           return std::visit(visitor,
              *v);
          }
          return res;
@@ -300,7 +300,7 @@ namespace CGAL {
          if(typename Intersection_traits<SK, Sphere_3, Sphere_3>::result_type v =
             SK().intersect_3_object()(s1, s2)) {
            internal::Point_conversion_visitor<SK, result_type, OutputIterator> visitor(res);
-           return boost::apply_visitor(
+           return std::visit(
              visitor,
              *v);
          }
@@ -342,7 +342,7 @@ namespace CGAL {
                 const typename SK::Sphere_3 & s2,
                 OutputIterator res)
     {
-      typedef typename boost::variant< std::pair< typename SK::Circular_arc_point_3, unsigned int>,
+      typedef typename std::variant< std::pair< typename SK::Circular_arc_point_3, unsigned int>,
                                        typename SK::Circle_3 > result_type;
       typedef typename SK::Root_for_spheres_2_3  Root_for_spheres_2_3;
       typedef typename SK::Polynomial_for_spheres_2_3  Equation_sphere;
@@ -357,7 +357,7 @@ namespace CGAL {
         if(typename Intersection_traits<SK, Plane_3, Sphere_3>::result_type v =
             SK().intersect_3_object()(p, s1)) {
            internal::Point_conversion_visitor<SK, result_type, OutputIterator> visitor(res);
-           return boost::apply_visitor(
+           return std::visit(
              visitor,
              *v);
          }
@@ -368,7 +368,7 @@ namespace CGAL {
         if(typename Intersection_traits<SK, Plane_3, Sphere_3>::result_type v =
             SK().intersect_3_object()(p, s1)) {
            internal::Point_conversion_visitor<SK, result_type, OutputIterator> visitor(res);
-           return boost::apply_visitor(
+           return std::visit(
              visitor,
              *v);
          }
@@ -391,7 +391,7 @@ namespace CGAL {
                 const typename SK::Sphere_3 & s,
                 OutputIterator res)
     {
-      typedef typename boost::variant< std::pair< typename SK::Circular_arc_point_3, unsigned int>,
+      typedef typename std::variant< std::pair< typename SK::Circular_arc_point_3, unsigned int>,
                                        typename SK::Circle_3 > result_type;
       typedef typename SK::Root_for_spheres_2_3  Root_for_spheres_2_3;
       typedef typename SK::Polynomial_for_spheres_2_3  Equation_sphere;
@@ -406,7 +406,7 @@ namespace CGAL {
         if(typename Intersection_traits<SK, Plane_3, Sphere_3>::result_type v =
             SK().intersect_3_object()(p1, s)) {
            internal::Point_conversion_visitor<SK, result_type, OutputIterator> visitor(res);
-           return boost::apply_visitor(
+           return std::visit(
              visitor,
              *v);
          }
diff --git a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
index 7a1921c698d9..be2ca1e37fb4 100644
--- a/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
+++ b/Convex_hull_3/include/CGAL/Convex_hull_3/dual/halfspace_intersection_3.h
@@ -67,7 +67,7 @@ namespace CGAL
               // Typedefs for intersection
               typedef typename Kernel::Plane_3 Plane_3;
               typedef typename Kernel::Line_3 Line_3;
-              typedef std::optional< boost::variant< Point_3,
+              typedef std::optional< std::variant< Point_3,
                                                        Line_3,
                                                        Plane_3 > > result_inter;
 
@@ -97,10 +97,10 @@ namespace CGAL
                 result_inter result = CGAL::intersection(pp1, pp2, pp3);
                 CGAL_assertion_msg(bool(result),
                                    "halfspace_intersection_3: no intersection");
-                CGAL_assertion_msg(boost::get<Point_3>(& *result) != nullptr,
+                CGAL_assertion_msg(std::get_if<Point_3>(& *result) != nullptr,
                                    "halfspace_intersection_3: intersection is not a point");
 
-                const Point_3* pp = boost::get<Point_3>(& *result);
+                const Point_3* pp = std::get_if<Point_3>(& *result);
 
                 // Primal vertex associated to the current dual plane
                 Point_3 ppp(origin.x() + pp->x(),
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/Cartesian_coordinate_iterator_2.h b/Filtered_kernel/include/CGAL/Filtered_kernel/Cartesian_coordinate_iterator_2.h
index e2909ff4dd0d..b21d123ab68d 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/Cartesian_coordinate_iterator_2.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/Cartesian_coordinate_iterator_2.h
@@ -15,14 +15,14 @@
 
 #include <cstddef>
 #include <iterator>
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 
 // This class should go away.
 // It is now only used by the Filtered_kernel.
 // It allows to iterate over the coordinates of both a Point_2 and a Vector_2,
-// using a boost::variant, as the iterator types are the same at the kernel level.
+// using a std::variant, as the iterator types are the same at the kernel level.
 
 template <class K>
 class Cartesian_coordinate_iterator_2
@@ -31,7 +31,7 @@ class Cartesian_coordinate_iterator_2
 protected:
   typedef typename K::Point_2 P;
   typedef typename K::Vector_2 V;
-  boost::variant<const P*, const V*> var;
+  std::variant<const P*, const V*> var;
   int index;
   typedef Cartesian_coordinate_iterator_2<K> Self;
 
@@ -57,9 +57,9 @@ class Cartesian_coordinate_iterator_2
 
   reference
   operator*() const {
-    if (const P* const* p = boost::get<const P*>(&var))
+    if (const P* const* p = std::get_if<const P*>(&var))
       return (*p)->cartesian(index);
-    const V* const* v = boost::get<const V*>(&var);
+    const V* const* v = std::get_if<const V*>(&var);
     CGAL_assertion(v != 0);
     return (*v)->cartesian(index);
   }
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/Cartesian_coordinate_iterator_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/Cartesian_coordinate_iterator_3.h
index c5a16320dc0d..2dfc7bcf27d1 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/Cartesian_coordinate_iterator_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/Cartesian_coordinate_iterator_3.h
@@ -15,14 +15,14 @@
 
 #include <cstddef>
 #include <iterator>
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 
 // This class should go away.
 // It is now only used by the Filtered_kernel.
 // It allows to iterate over the coordinates of both a Point_3 and a Vector_3,
-// using a boost::variant, as the iterator types are the same at the kernel level.
+// using a std::variant, as the iterator types are the same at the kernel level.
 
 template <class K>
 class Cartesian_coordinate_iterator_3
@@ -31,7 +31,7 @@ class Cartesian_coordinate_iterator_3
 protected:
   typedef typename K::Point_3 P;
   typedef typename K::Vector_3 V;
-  boost::variant<const P*, const V*> var;
+  std::variant<const P*, const V*> var;
   int index;
   typedef Cartesian_coordinate_iterator_3<K> Self;
 
@@ -57,9 +57,9 @@ class Cartesian_coordinate_iterator_3
 
   reference
   operator*() const {
-    if (const P* const* p = boost::get<const P*>(&var))
+    if (const P* const* p = std::get_if<const P*>(&var))
       return (*p)->cartesian(index);
-    const V* const* v = boost::get<const V*>(&var);
+    const V* const* v = std::get_if<const V*>(&var);
     CGAL_assertion(v != 0);
     return (*v)->cartesian(index);
   }
diff --git a/Filtered_kernel/include/CGAL/Lazy.h b/Filtered_kernel/include/CGAL/Lazy.h
index c9ff97618c31..41e1e371db75 100644
--- a/Filtered_kernel/include/CGAL/Lazy.h
+++ b/Filtered_kernel/include/CGAL/Lazy.h
@@ -31,7 +31,7 @@
 #include <CGAL/transforming_iterator.h>
 
 #include <optional>
-#include <boost/variant.hpp>
+#include <variant>
 #ifdef CGAL_LAZY_KERNEL_DEBUG
 #  include <boost/optional/optional_io.hpp>
 #endif
@@ -1425,19 +1425,19 @@ struct Ith_for_intersection_with_variant {
     : i(i_)
   {}
 
-  template< BOOST_VARIANT_ENUM_PARAMS(typename U) >
+  template< typename ... U >
   const T2&
-  operator()(const std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const
+  operator()(const std::optional< std::variant< U ... > >& o) const
   {
-    const std::vector<T2>* ptr = (boost::get<std::vector<T2> >(&(*o)));
+    const std::vector<T2>* ptr = (std::get_if<std::vector<T2> >(&(*o)));
     return (*ptr)[i];
   }
 
-  template< BOOST_VARIANT_ENUM_PARAMS(typename U) >
+  template< typename ... U >
   const T2&
-  operator()(const boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) >& o) const
+  operator()(const std::variant< U ... >& o) const
   {
-    const std::vector<T2>* ptr = (boost::get<std::vector<T2> >(&o));
+    const std::vector<T2>* ptr = (std::get_if<std::vector<T2> >(&o));
     return (*ptr)[i];
   }
 };
@@ -1856,26 +1856,26 @@ template<typename T>
 struct Variant_cast {
   typedef T result_type;
 
-  template<BOOST_VARIANT_ENUM_PARAMS(typename U)>
+  template<typename ... U>
   const T&
-  operator()(const std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const {
+  operator()(const std::optional< std::variant< U ... > >& o) const {
     // can throw but should never because we always build it inside
     // a static visitor with the right type
-    return boost::get<T>(*o);
+    return std::get<T>(*o);
   }
 
-  template<BOOST_VARIANT_ENUM_PARAMS(typename U)>
+  template<typename ... U>
   T&
-  operator()(std::optional< boost::variant< BOOST_VARIANT_ENUM_PARAMS(U) > >& o) const {
+  operator()(std::optional< std::variant< U ... > >& o) const {
     // can throw but should never because we always build it inside
     // a static visitor with the right type, if it throws bad_get
-    return boost::get<T>(*o);
+    return std::get<T>(*o);
   }
 };
 
 
 template<typename Result, typename AK, typename LK, typename EK, typename Origin>
-struct Fill_lazy_variant_visitor_2 : boost::static_visitor<> {
+struct Fill_lazy_variant_visitor_2 {
   Fill_lazy_variant_visitor_2(Result& r, Origin& o) : r(&r), o(&o) {}
   Result* r;
   Origin* o;
@@ -1912,7 +1912,7 @@ struct Fill_lazy_variant_visitor_2 : boost::static_visitor<> {
 };
 
 template<typename Result, typename AK, typename LK, typename EK>
-struct Fill_lazy_variant_visitor_0 : boost::static_visitor<> {
+struct Fill_lazy_variant_visitor_0 {
   Fill_lazy_variant_visitor_0(Result& r) : r(&r) {}
   Result* r;
 
@@ -1998,7 +1998,7 @@ struct Lazy_construction_variant {
 
         // the static visitor fills the result_type with the correct unwrapped type
         internal::Fill_lazy_variant_visitor_2< result_type, AK, LK, EK, Lazy<AT, ET, E2A> > visitor(res, lazy);
-        boost::apply_visitor(visitor, *approx_v);
+        std::visit(visitor, *approx_v);
 
         return res;
       } catch (Uncertain_conversion_exception&) {}
@@ -2014,7 +2014,7 @@ struct Lazy_construction_variant {
     }
 
     internal::Fill_lazy_variant_visitor_0<result_type, AK, LK, EK> visitor(res);
-    boost::apply_visitor(visitor, *exact_v);
+    std::visit(visitor, *exact_v);
     return res;
   }
 
@@ -2052,7 +2052,7 @@ struct Lazy_construction_variant {
 
         // the static visitor fills the result_type with the correct unwrapped type
         internal::Fill_lazy_variant_visitor_2< result_type, AK, LK, EK, Lazy<AT, ET, E2A> > visitor(res, lazy);
-        boost::apply_visitor(visitor, *approx_v);
+        std::visit(visitor, *approx_v);
 
         return res;
       } catch (Uncertain_conversion_exception&) {}
@@ -2068,7 +2068,7 @@ struct Lazy_construction_variant {
     }
 
     internal::Fill_lazy_variant_visitor_0< result_type, AK, LK, EK> visitor(res);
-    boost::apply_visitor(visitor, *exact_v);
+    std::visit(visitor, *exact_v);
     return res;
   }
 };
diff --git a/Filtered_kernel/test/Filtered_kernel/test_lazy_vector_objects.cpp b/Filtered_kernel/test/Filtered_kernel/test_lazy_vector_objects.cpp
index 041f6022a0ec..dd998fce87c8 100644
--- a/Filtered_kernel/test/Filtered_kernel/test_lazy_vector_objects.cpp
+++ b/Filtered_kernel/test/Filtered_kernel/test_lazy_vector_objects.cpp
@@ -42,7 +42,7 @@ int main()
     }
 
     V = nullptr;
-    if( !(V = boost::get<std::vector<Point_2> >(&(*o_variant)))  ){
+    if( !(V = std::get_if<std::vector<Point_2> >(&(*o_variant)))  ){
       std::cerr << "ERROR, something other than vector< point_2 >" << std::endl;
       return EXIT_FAILURE;
     }
@@ -82,7 +82,7 @@ int main()
     }
 
     V = nullptr;
-    if( !(V = boost::get<std::vector<Point_3> > (&(*o_variant)))  ){
+    if( !(V = std::get_if<std::vector<Point_3> > (&(*o_variant)))  ){
       std::cerr << "ERROR" << std::endl;
       return EXIT_FAILURE;
     }
diff --git a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h
index 73eea1976402..81522776a5b3 100644
--- a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h
+++ b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h
@@ -80,12 +80,12 @@ class PainterOstream< Hyperbolic_Delaunay_triangulation_traits_2<K> >
 
   PainterOstream& operator<<(const Hyperbolic_segment_2& s)
   {
-    if(const Euclidean_segment_2* seg = boost::get<Euclidean_segment_2>(&s)) {
+    if(const Euclidean_segment_2* seg = std::get_if<Euclidean_segment_2>(&s)) {
       CGAL::Qt::PainterOstream<K>::operator << (*seg);
       return *this;
     }
 
-    const Circular_arc_2& arc = boost::get<const Circular_arc_2&>(s);
+    const Circular_arc_2& arc = std::get<const Circular_arc_2&>(s);
 
     if(arc.squared_radius() > 100) {
       Euclidean_segment_2 seg(arc.source(), arc.target());
diff --git a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstreamCK.h b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstreamCK.h
index 8f434a5a41f1..61d6630eeb3a 100644
--- a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstreamCK.h
+++ b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstreamCK.h
@@ -44,12 +44,12 @@ namespace Qt {
 
     PainterOstream& operator <<(const Hyperbolic_segment_2& s)
       {
-        if(const Line_arc* seg = boost::get<Line_arc>(&s)) {
+        if(const Line_arc* seg = std::get_if<Line_arc>(&s)) {
           operator << (*seg);
           return *this;
         }
 
-        const Circular_arc& arc = boost::get<const Circular_arc&>(s);
+        const Circular_arc& arc = std::get<const Circular_arc&>(s);
 
         if(arc.squared_radius() > 10)
         {
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h
index 8913899a2710..3dcd277ab47b 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h
@@ -35,7 +35,7 @@ class Hyperbolic_Delaunay_triangulation_CK_traits_2  : public K {
     typedef typename K::Circular_arc_point_2        Hyperbolic_Voronoi_point_2;
     typedef typename K::Circular_arc_2              Circular_arc_2;
     typedef typename K::Line_arc_2                  Line_arc_2;
-    typedef boost::variant<Circular_arc_2,
+    typedef std::variant<Circular_arc_2,
                            Line_arc_2>              Hyperbolic_segment_2;
     typedef typename K::Triangle_2                  Hyperbolic_triangle_2;
   /// @}
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
index 8eab67ea0836..c1131a1e1ef1 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
@@ -35,7 +35,7 @@ class Hyperbolic_Delaunay_triangulation_traits_2 : public K {
           typedef Hyperbolic_point_2                                                                       Hyperbolic_Voronoi_point_2;
     typedef unspecified_type                                                                         Circular_arc_2;
     typedef typename K::Segment_2                    Euclidean_segment_2;
-          typedef boost::variant< Circular_arc_2,
+          typedef std::variant< Circular_arc_2,
                             Euclidean_segment_2 >           Hyperbolic_segment_2;
     typedef typename K::Triangle_2                   Hyperbolic_triangle_2;
   /// @}
diff --git a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h
index da42c7429f98..ee95f6c0f859 100644
--- a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h
+++ b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h
@@ -24,7 +24,7 @@
 #include <CGAL/determinant.h>
 
 #include <boost/tuple/tuple.hpp>
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <CGAL/Hyperbolic_triangulation_2/internal/Hyperbolic_Delaunay_triangulation_traits_2_functions.h>
 
@@ -69,9 +69,9 @@ namespace internal {
       Euclidean_line_2* l;
       Circle_2* c;
 
-      if(Circle_2* c_pq = boost::get<Circle_2>(&bis_pq))
+      if(Circle_2* c_pq = std::get_if<Circle_2>(&bis_pq))
       {
-        if(Circle_2* c_qr = boost::get<Circle_2>(&bis_qr))
+        if(Circle_2* c_qr = std::get_if<Circle_2>(&bis_qr))
         {
           typedef typename CK2_Intersection_traits<Traits, Circle_2, Circle_2>::type Intersection_result;
           std::vector< Intersection_result > inters;
@@ -90,14 +90,14 @@ namespace internal {
         }
 
         // here bis_qr is a line
-        l = boost::get<Euclidean_line_2>(&bis_qr);
+        l = std::get_if<Euclidean_line_2>(&bis_qr);
         c = c_pq;
       }
       else
       {
         // here bis_pq is a line, and bis_qr is necessarily a circle
-        l = boost::get<Euclidean_line_2>(&bis_pq);
-        c = boost::get<Circle_2>(&bis_qr);
+        l = std::get_if<Euclidean_line_2>(&bis_pq);
+        c = std::get_if<Circle_2>(&bis_qr);
       }
 
       typedef typename CK2_Intersection_traits<Traits, Euclidean_line_2, Circle_2>::type Intersection_result;
@@ -157,7 +157,7 @@ namespace internal {
       }
 
       Euclidean_circle_or_line_2 bis_pq = cclsb(p, q);
-      Circle_2* c = boost::get<Circle_2>(&bis_pq);
+      Circle_2* c = std::get_if<Circle_2>(&bis_pq);
 
       if(_gt.less_y_2_object()(po, c->center()))
         return Circular_arc_2(*c, l_inf, true, l_inf, false);
@@ -200,7 +200,7 @@ namespace internal {
 
       Euclidean_circle_or_line_2
           bis_pq = cclsb(p, q);
-      Circle_2* c_pq = boost::get<Circle_2>(&bis_pq);
+      Circle_2* c_pq = std::get_if<Circle_2>(&bis_pq);
 
       if(_gt.compare_distance_2_object()(po, p, q) == POSITIVE)
       {
@@ -251,7 +251,7 @@ namespace internal {
       }
 
       Euclidean_circle_or_line_2 bis_pq = cclsb(p, q);
-      Circle_2* c_pq = boost::get<Circle_2>(&bis_pq);
+      Circle_2* c_pq = std::get_if<Circle_2>(&bis_pq);
 
       Hyperbolic_point_2 approx_a(to_double(a.x()),to_double(a.y()));
 
@@ -311,14 +311,14 @@ class Hyperbolic_Delaunay_triangulation_CK_traits_2
   typedef typename R::Point_2                                 Hyperbolic_point_2;
   typedef typename R::Circle_2                                Circle_2;
   typedef typename R::Line_2                                  Euclidean_line_2;
-  typedef boost::variant<Circle_2, Euclidean_line_2>          Euclidean_circle_or_line_2;
+  typedef std::variant<Circle_2, Euclidean_line_2>          Euclidean_circle_or_line_2;
 
   typedef typename R::Circular_arc_2                          Circular_arc_2;
   typedef typename R::Line_arc_2                              Line_arc_2;
   typedef typename R::Circular_arc_point_2                    Circular_arc_point_2;
   typedef Circular_arc_point_2                                Hyperbolic_Voronoi_point_2;
   typedef typename R::Segment_2                               Euclidean_segment_2; // only used internally here
-  typedef boost::variant<Circular_arc_2, Line_arc_2>          Hyperbolic_segment_2;
+  typedef std::variant<Circular_arc_2, Line_arc_2>          Hyperbolic_segment_2;
 
   typedef typename R::Triangle_2                              Hyperbolic_triangle_2;
 
diff --git a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
index 801ee71d9934..e54c4cb75a8d 100644
--- a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
+++ b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
@@ -28,7 +28,7 @@
 #include <CGAL/utility.h>
 
 #include <boost/tuple/tuple.hpp>
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <utility>
 
@@ -187,9 +187,9 @@ class Construct_intersection_2
 
   Hyperbolic_point_2 operator()(Hyperbolic_segment_2 s1, Hyperbolic_segment_2 s2)
   {
-    if(Circular_arc_2* c1 = boost::get<Circular_arc_2>(&s1))
+    if(Circular_arc_2* c1 = std::get_if<Circular_arc_2>(&s1))
     {
-      if(Circular_arc_2* c2 = boost::get<Circular_arc_2>(&s2))
+      if(Circular_arc_2* c2 = std::get_if<Circular_arc_2>(&s2))
       {
         std::pair<Hyperbolic_point_2, Hyperbolic_point_2> res = operator()(c1->supporting_circle(), c2->supporting_circle());
         Hyperbolic_point_2 p1 = res.first;
@@ -202,7 +202,7 @@ class Construct_intersection_2
       }
       else
       {
-        Euclidean_segment_2* ell2 = boost::get<Euclidean_segment_2>(&s2);
+        Euclidean_segment_2* ell2 = std::get_if<Euclidean_segment_2>(&s2);
         std::pair<Hyperbolic_point_2, Hyperbolic_point_2> res = operator()(c1->supporting_circle(),
                                                                       ell2->supporting_line());
         Hyperbolic_point_2 p1 = res.first;
@@ -216,8 +216,8 @@ class Construct_intersection_2
     }
     else
     {
-      Euclidean_segment_2* ell1 = boost::get<Euclidean_segment_2>(&s1);
-      if(Circular_arc_2* c2 = boost::get<Circular_arc_2>(&s2))
+      Euclidean_segment_2* ell1 = std::get_if<Euclidean_segment_2>(&s1);
+      if(Circular_arc_2* c2 = std::get_if<Circular_arc_2>(&s2))
       {
         std::pair<Hyperbolic_point_2, Hyperbolic_point_2> res = operator()(ell1->supporting_line(),
                                                                       c2->supporting_circle());
@@ -231,7 +231,7 @@ class Construct_intersection_2
       }
       else
       {
-        Euclidean_segment_2* ell2 = boost::get<Euclidean_segment_2>(&s2);
+        Euclidean_segment_2* ell2 = std::get_if<Euclidean_segment_2>(&s2);
         Hyperbolic_point_2 p1 = operator()(ell1->supporting_line(), ell2->supporting_line());
         CGAL_assertion(p1.x()*p1.x() + p1.y()*p1.y() < FT(1));
         return p1;
@@ -279,9 +279,9 @@ class Construct_hyperbolic_circumcenter_2
     Euclidean_line_2* l;
     Circle_2* c;
 
-    if(Circle_2* c_pq = boost::get<Circle_2>(&bis_pq))
+    if(Circle_2* c_pq = std::get_if<Circle_2>(&bis_pq))
     {
-      if(Circle_2* c_qr = boost::get<Circle_2>(&bis_qr))
+      if(Circle_2* c_qr = std::get_if<Circle_2>(&bis_qr))
       {
         std::pair<Hyperbolic_point_2, Hyperbolic_point_2> inters = ci(*c_pq, *c_qr);
 
@@ -291,14 +291,14 @@ class Construct_hyperbolic_circumcenter_2
         return inters.second;
       }
 
-      l = boost::get<Euclidean_line_2>(&bis_qr);
+      l = std::get_if<Euclidean_line_2>(&bis_qr);
       c = c_pq;
     }
     else
     {
       // here bis_pq is a line
-      l = boost::get<Euclidean_line_2>(&bis_pq);
-      c = boost::get<Circle_2>(&bis_qr);
+      l = std::get_if<Euclidean_line_2>(&bis_pq);
+      c = std::get_if<Circle_2>(&bis_qr);
     }
 
     std::pair<Hyperbolic_point_2, Hyperbolic_point_2> inters = ci(*c, *l);
@@ -348,7 +348,7 @@ class Construct_hyperbolic_bisector_2
     }
 
     Euclidean_circle_or_line_2 bis_pq = cclsb(p, q);
-    Circle_2* c = boost::get<Circle_2>(&bis_pq);
+    Circle_2* c = std::get_if<Circle_2>(&bis_pq);
     std::pair<Hyperbolic_point_2, Hyperbolic_point_2> inters = ci(*c, l_inf);
 
     if(_gt.orientation_2_object()(c->center(), inters.first, inters.second) == POSITIVE)
@@ -388,7 +388,7 @@ class Construct_hyperbolic_bisector_2
     }
 
     Euclidean_circle_or_line_2 bis_pq = cclsb(p, q);
-    Circle_2* c_pq = boost::get<Circle_2>(&bis_pq);
+    Circle_2* c_pq = std::get_if<Circle_2>(&bis_pq);
 
     if(_gt.compare_distance_2_object()(po, p, q) == POSITIVE) {
       // then p is inside the supporting circle
@@ -430,7 +430,7 @@ class Construct_hyperbolic_bisector_2
     }
 
     Euclidean_circle_or_line_2 bis_pq = cclsb(p, q);
-    Circle_2* c_pq = boost::get<Circle_2>(&bis_pq);
+    Circle_2* c_pq = std::get_if<Circle_2>(&bis_pq);
 
     std::pair<Hyperbolic_point_2,Hyperbolic_point_2> inters = ci(*c_pq, l_inf);
     Hyperbolic_point_2 approx_pinf = inters.first;
@@ -468,10 +468,10 @@ class Hyperbolic_Delaunay_triangulation_traits_2
   typedef Hyperbolic_point_2                                    Hyperbolic_Voronoi_point_2;
   typedef typename Kernel::Circle_2                             Circle_2;
   typedef typename Kernel::Line_2                               Euclidean_line_2;
-  typedef boost::variant<Circle_2,Euclidean_line_2>             Euclidean_circle_or_line_2;
+  typedef std::variant<Circle_2,Euclidean_line_2>             Euclidean_circle_or_line_2;
   typedef internal::HDT_2_Circular_arc_2<Self>                  Circular_arc_2;
   typedef typename Kernel::Segment_2                            Euclidean_segment_2; // only used internally here
-  typedef boost::variant<Circular_arc_2, Euclidean_segment_2>   Hyperbolic_segment_2;
+  typedef std::variant<Circular_arc_2, Euclidean_segment_2>   Hyperbolic_segment_2;
 
   typedef typename Kernel::Triangle_2                           Hyperbolic_triangle_2;
 
diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 386d2a272020..d4f9b06a8435 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -12,6 +12,7 @@ Release date: October 2023
 - Support for Visual `C++` 14.0 (Visual studio 2015) is dropped.
 - **Breaking change**: The usage of `boost::shared_ptr` has been replaced by `std::shared_ptr`. Packages affected are 2D Straight Line Skeleton and Shape Detection.
 - **Breaking change**: The usage of `boost::optional` has been replaced by `std::optional`. Packages affected are 2D Straight Line Skeleton, 3D Fast Intersection and Distance Computation (AABB Tree), and the Kernel intersection.
+- **Breaking change**: The usage of `boost::variant` has been replaced by `std::variant`. Packages affected are 2D Arrangements, and the Kernel intersection.
 
 
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
diff --git a/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp b/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp
index c5176eda212c..7fa07b4760a5 100644
--- a/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp
+++ b/Intersections_2/benchmark/Intersections_2/variant_any_object.cpp
@@ -10,7 +10,7 @@
 #include <vector>
 #include <functional>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <optional>
 #include <any>
 #include <boost/timer.hpp>
@@ -26,7 +26,7 @@ struct Intersection_traits;
 
 template<typename K>
 struct Intersection_traits<K, typename K::Segment_2, typename K::Segment_2> {
-  typedef typename boost::variant<typename K::Segment_2, typename K::Point_2 > variant_type;
+  typedef typename std::variant<typename K::Segment_2, typename K::Point_2 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -54,7 +54,7 @@ OutputIterator intersect_do_iterator(const typename K::Segment_2 &seg1,
 
 template <class K>
 std::optional<
-  boost::variant<typename K::Segment_2, typename K::Point_2>
+  std::variant<typename K::Segment_2, typename K::Point_2>
   >
 intersection_variant(const typename K::Segment_2 &seg1,
              const typename K::Segment_2 &seg2,
@@ -62,7 +62,7 @@ intersection_variant(const typename K::Segment_2 &seg1,
 {
   typedef CGAL::internal::Segment_2_Segment_2_pair<K> is_t;
 
-  typedef boost::variant<typename K::Segment_2, typename K::Point_2> Variant;
+  typedef std::variant<typename K::Segment_2, typename K::Point_2> Variant;
   typedef std::optional<Variant> OptVariant;
 
   is_t ispair(&seg1, &seg2);
@@ -122,7 +122,7 @@ struct Vec_holder {
   std::vector<Segment>* s;
 };
 
-struct Visitor : public boost::static_visitor<>, Vec_holder
+struct Visitor
 {
   Visitor(std::vector<Point>* p, std::vector<Segment>* s) :
     Vec_holder(p, s) { }
@@ -141,7 +141,7 @@ struct Variant_f {
   void operator()(const Segment& s1, const Segment& s2) {
     result_type obj = intersection_variant(s1, s2, K());
     if(obj) {
-      boost::apply_visitor(v, *obj);
+      std::visit(v, *obj);
     }
   }
 };
@@ -224,7 +224,7 @@ std::tuple<int, int, int> intersect_each_variant_overload(const Vector& segs) {
                           std::function<void(const Point&)>(
                             [&ret](const Point& p) { (void)p; ++(std::get<0>(ret)); })));
 
-        boost::apply_visitor(v, *obj);
+        std::visit(v, *obj);
       } else {
         ++(std::get<2>(ret));
       }
diff --git a/Intersections_2/include/CGAL/Intersection_traits.h b/Intersections_2/include/CGAL/Intersection_traits.h
index ca313a2c8524..35dcf6540fad 100644
--- a/Intersections_2/include/CGAL/Intersection_traits.h
+++ b/Intersections_2/include/CGAL/Intersection_traits.h
@@ -18,14 +18,14 @@
 #include <CGAL/assertions.h>
 #include <CGAL/Dimension.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <type_traits>
 
 #define CGAL_INTERSECTION_TRAITS_2(A, B, R1, R2)                \
   template<typename K>     \
   struct Intersection_traits<K, typename K::A, typename K::B>  { \
-    typedef typename boost::variant<typename K::R1, typename K::R2 >    \
+    typedef typename std::variant<typename K::R1, typename K::R2 >    \
                      variant_type;                                      \
     typedef typename std::optional< variant_type > result_type;       \
   };
@@ -33,7 +33,7 @@
 #define CGAL_INTERSECTION_TRAITS_3(A, B, R1, R2, R3)            \
   template<typename K>     \
   struct Intersection_traits<K, typename K::A, typename K::B>  { \
-    typedef typename boost::variant<typename K::R1, typename K::R2,     \
+    typedef typename std::variant<typename K::R1, typename K::R2,     \
                                     typename K::R3> variant_type;       \
     typedef typename std::optional< variant_type > result_type;       \
   };
@@ -118,16 +118,16 @@ const T* intersect_get(const CGAL::Object& o) {
   return CGAL::object_cast<T>(&o);
 }
 
-template<typename T, BOOST_VARIANT_ENUM_PARAMS(typename U)>
+template<typename T, typename ... U>
 inline
-const T* intersect_get(const std::optional< boost::variant<BOOST_VARIANT_ENUM_PARAMS(U)> >& v) {
-  return boost::get<T>(&*v);
+const T* intersect_get(const std::optional< std::variant<U...> >& v) {
+  return std::get_if<T>(&*v);
 }
 
-template<typename T, BOOST_VARIANT_ENUM_PARAMS(typename U)>
+template<typename T, typename ... U>
 inline
-const T* intersect_get(const boost::variant<BOOST_VARIANT_ENUM_PARAMS(U)> & v) {
-  return boost::get<T>(&v);
+const T* intersect_get(const std::variant<U...> & v) {
+  return std::get_if<T>(&v);
 }
 
 template<typename A, typename B>
diff --git a/Intersections_2/include/CGAL/Intersection_traits_2.h b/Intersections_2/include/CGAL/Intersection_traits_2.h
index df4d10a6c2a6..bf43d9a079ac 100644
--- a/Intersections_2/include/CGAL/Intersection_traits_2.h
+++ b/Intersections_2/include/CGAL/Intersection_traits_2.h
@@ -16,7 +16,7 @@
 #include <CGAL/Intersection_traits.h>
 #include <CGAL/Bbox_2.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <optional>
 #include <vector>
 
@@ -49,7 +49,7 @@ CGAL_INTERSECTION_TRAITS_2(Ray_2, Triangle_2, Point_2, Segment_2)
 template<typename K>
 struct Intersection_traits<K, typename K::Triangle_2, typename K::Triangle_2>  {
   typedef typename
-  boost::variant< typename K::Point_2, typename K::Segment_2,
+  std::variant< typename K::Point_2, typename K::Segment_2,
                   typename K::Triangle_2, typename std::vector< typename K::Point_2 > > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
@@ -69,7 +69,7 @@ CGAL_INTERSECTION_TRAITS_2(Ray_2, Iso_rectangle_2, Point_2, Segment_2)
 // Variants of one for backwards compatibility
 template<typename K>
 struct Intersection_traits<K, typename K::Iso_rectangle_2, typename K::Iso_rectangle_2>  {
-  typedef typename boost::variant<typename K::Iso_rectangle_2> variant_type;
+  typedef typename std::variant<typename K::Iso_rectangle_2> variant_type;
   typedef std::optional<variant_type> result_type;
 };
 
@@ -77,26 +77,26 @@ struct Intersection_traits<K, typename K::Iso_rectangle_2, typename K::Iso_recta
 // Point_2 is special
 template<typename K, typename B>
 struct Intersection_traits<K, typename K::Point_2, B> {
-  typedef typename boost::variant<typename K::Point_2> variant_type;
+  typedef typename std::variant<typename K::Point_2> variant_type;
   typedef std::optional<variant_type> result_type;
 };
 
 template<typename K, typename A>
 struct Intersection_traits<K, A, typename K::Point_2> {
-  typedef typename boost::variant<typename K::Point_2> variant_type;
+  typedef typename std::variant<typename K::Point_2> variant_type;
   typedef std::optional<variant_type> result_type;
 };
 
 template<typename K>
 struct Intersection_traits<K, typename K::Point_2, typename K::Point_2> {
-  typedef typename boost::variant<typename K::Point_2> variant_type;
+  typedef typename std::variant<typename K::Point_2> variant_type;
   typedef std::optional<variant_type> result_type;
 };
 
 template<typename K>
 struct Intersection_traits<K, typename K::Iso_rectangle_2, typename K::Triangle_2>
 {
-  typedef typename boost::variant<typename K::Segment_2, typename K::Triangle_2,
+  typedef typename std::variant<typename K::Segment_2, typename K::Triangle_2,
                                   typename K::Point_2,
                                   typename std::vector< typename K::Point_2 > > variant_type;
   typedef typename std::optional < variant_type > result_type;
@@ -118,13 +118,13 @@ struct Intersection_traits<K, A, CGAL::Bbox_2>  {
 
 template<typename K>
 struct Intersection_traits<K, CGAL::Bbox_2, typename K::Point_2>  {
-  typedef typename boost::variant<typename K::Point_2> variant_type;
+  typedef typename std::variant<typename K::Point_2> variant_type;
   typedef std::optional<variant_type> result_type;
 };
 
 template<typename K>
 struct Intersection_traits<K, typename K::Point_2, CGAL::Bbox_2>  {
-  typedef typename boost::variant<typename K::Point_2> variant_type;
+  typedef typename std::variant<typename K::Point_2> variant_type;
   typedef std::optional<variant_type> result_type;
 };
 
diff --git a/Intersections_2/include/CGAL/Intersections_2/Bbox_2_Bbox_2.h b/Intersections_2/include/CGAL/Intersections_2/Bbox_2_Bbox_2.h
index 4081086aa1c5..2ebd27332ad2 100644
--- a/Intersections_2/include/CGAL/Intersections_2/Bbox_2_Bbox_2.h
+++ b/Intersections_2/include/CGAL/Intersections_2/Bbox_2_Bbox_2.h
@@ -25,12 +25,12 @@ do_intersect(const CGAL::Bbox_2& c,
   return CGAL::do_overlap(c, bbox);
 }
 
-typename std::optional< typename boost::variant<Bbox_2> >
+typename std::optional< typename std::variant<Bbox_2> >
 inline
 intersection(const CGAL::Bbox_2& a,
              const CGAL::Bbox_2& b)
 {
-  typedef typename boost::variant<Bbox_2> variant_type;
+  typedef typename std::variant<Bbox_2> variant_type;
   typedef typename std::optional<variant_type> result_type;
 
   if(!do_intersect(a, b))
diff --git a/Intersections_2/test/Intersections_2/test_intersections_2.cpp b/Intersections_2/test/Intersections_2/test_intersections_2.cpp
index 5c15555404af..38a81c0a29a5 100644
--- a/Intersections_2/test/Intersections_2/test_intersections_2.cpp
+++ b/Intersections_2/test/Intersections_2/test_intersections_2.cpp
@@ -490,7 +490,7 @@ struct Test
     std::set<double> ds;
     auto test = [&ds](S s1, S s2)
     {
-      P i = boost::get<P>(*CGAL::intersection(s1,s2));
+      P i = std::get<P>(*CGAL::intersection(s1,s2));
       ds.insert(CGAL::to_double(i.x())); ds.insert(CGAL::to_double(i.y()));
       assert(ds.size()==2);
     };
diff --git a/Intersections_3/include/CGAL/Intersection_traits_3.h b/Intersections_3/include/CGAL/Intersection_traits_3.h
index a72f5cac9231..2d2b8ca64ff3 100644
--- a/Intersections_3/include/CGAL/Intersection_traits_3.h
+++ b/Intersections_3/include/CGAL/Intersection_traits_3.h
@@ -23,7 +23,7 @@
 #include <CGAL/Bbox_3.h>
 
 #include <optional>
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <vector>
 
@@ -84,7 +84,7 @@ CGAL_INTERSECTION_TRAITS_3(Sphere_3, Sphere_3, Point_3, Circle_3, Sphere_3)
 template<typename K>
 struct Intersection_traits<K, typename K::Triangle_3, typename K::Triangle_3>  {
   typedef typename
-  boost::variant< typename K::Point_3, typename K::Segment_3, typename K::Triangle_3,
+  std::variant< typename K::Point_3, typename K::Segment_3, typename K::Triangle_3,
                   typename std::vector< typename K::Point_3 > > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
@@ -108,7 +108,7 @@ CGAL_INTERSECTION_TRAITS_2(Iso_cuboid_3, Ray_3, Point_3, Segment_3)
 template<typename K>
 struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Iso_cuboid_3>  {
   typedef typename
-  boost::variant< typename K::Iso_cuboid_3 > variant_type;
+  std::variant< typename K::Iso_cuboid_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -118,7 +118,7 @@ struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Iso_cuboid_3
 template<typename K>
 struct Intersection_traits<K, CGAL::Bbox_3, typename K::Line_3>  {
   typedef typename
-  boost::variant< typename K::Segment_3, typename K::Point_3 > variant_type;
+  std::variant< typename K::Segment_3, typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -148,7 +148,7 @@ struct Intersection_traits<K, CGAL::Bbox_3, typename K::Ray_3> :
 template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Iso_cuboid_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -156,14 +156,14 @@ struct Intersection_traits<K, typename K::Point_3, typename K::Iso_cuboid_3>  {
 template<typename K>
 struct Intersection_traits<K, Bbox_3, typename K::Point_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
   template<typename K>
 struct Intersection_traits<K, typename K::Point_3, Bbox_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -172,7 +172,7 @@ struct Intersection_traits<K, typename K::Point_3, Bbox_3>  {
 template<typename K>
 struct Intersection_traits<K, CGAL::Bbox_3, typename K::Iso_cuboid_3>  {
   typedef typename
-  boost::variant<  typename K::Iso_cuboid_3 > variant_type;
+  std::variant<  typename K::Iso_cuboid_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -184,7 +184,7 @@ struct Intersection_traits<K, typename K::Iso_cuboid_3, CGAL::Bbox_3>
 template<typename K>
 struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Point_3>  {
   typedef typename
-    boost::variant< typename K::Point_3 > variant_type;
+    std::variant< typename K::Point_3 > variant_type;
     typedef typename std::optional< variant_type > result_type;
 };
 
@@ -192,7 +192,7 @@ struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Point_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Plane_3>  {
   typedef typename
-  boost::variant< typename K::Point_3, typename K::Segment_3,
+  std::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
   typedef typename std::optional< variant_type > result_type;
@@ -201,7 +201,7 @@ struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Plane_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Plane_3, typename K::Iso_cuboid_3>  {
   typedef typename
-  boost::variant< typename K::Point_3, typename K::Segment_3,
+  std::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
   typedef typename std::optional< variant_type > result_type;
@@ -211,7 +211,7 @@ struct Intersection_traits<K, typename K::Plane_3, typename K::Iso_cuboid_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Triangle_3>  {
   typedef typename
-  boost::variant< typename K::Point_3, typename K::Segment_3,
+  std::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
   typedef typename std::optional< variant_type > result_type;
@@ -220,7 +220,7 @@ struct Intersection_traits<K, typename K::Iso_cuboid_3, typename K::Triangle_3>
 template<typename K>
 struct Intersection_traits<K, typename K::Triangle_3, typename K::Iso_cuboid_3>  {
   typedef typename
-  boost::variant< typename K::Point_3, typename K::Segment_3,
+  std::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
   typedef typename std::optional< variant_type > result_type;
@@ -230,7 +230,7 @@ struct Intersection_traits<K, typename K::Triangle_3, typename K::Iso_cuboid_3>
 template<typename K>
 struct Intersection_traits<K, typename CGAL::Bbox_3, typename K::Plane_3>  {
   typedef typename
-  boost::variant< typename K::Point_3, typename K::Segment_3,
+  std::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
   typedef typename std::optional< variant_type > result_type;
@@ -239,7 +239,7 @@ struct Intersection_traits<K, typename CGAL::Bbox_3, typename K::Plane_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Plane_3, typename CGAL::Bbox_3>  {
   typedef typename
-  boost::variant< typename K::Point_3, typename K::Segment_3,
+  std::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
   typedef typename std::optional< variant_type > result_type;
@@ -249,7 +249,7 @@ struct Intersection_traits<K, typename K::Plane_3, typename CGAL::Bbox_3>  {
 template<typename K>
 struct Intersection_traits<K, typename CGAL::Bbox_3, typename K::Triangle_3>  {
   typedef typename
-  boost::variant< typename K::Point_3, typename K::Segment_3,
+  std::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
   typedef typename std::optional< variant_type > result_type;
@@ -258,7 +258,7 @@ struct Intersection_traits<K, typename CGAL::Bbox_3, typename K::Triangle_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Triangle_3, typename CGAL::Bbox_3>  {
   typedef typename
-  boost::variant< typename K::Point_3, typename K::Segment_3,
+  std::variant< typename K::Point_3, typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
 
   typedef typename std::optional< variant_type > result_type;
@@ -268,7 +268,7 @@ struct Intersection_traits<K, typename K::Triangle_3, typename CGAL::Bbox_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Line_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -276,7 +276,7 @@ struct Intersection_traits<K, typename K::Point_3, typename K::Line_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Line_3, typename K::Point_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -284,7 +284,7 @@ struct Intersection_traits<K, typename K::Line_3, typename K::Point_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Ray_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -292,7 +292,7 @@ struct Intersection_traits<K, typename K::Point_3, typename K::Ray_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Ray_3, typename K::Point_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -300,7 +300,7 @@ struct Intersection_traits<K, typename K::Ray_3, typename K::Point_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Segment_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -308,7 +308,7 @@ struct Intersection_traits<K, typename K::Point_3, typename K::Segment_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Segment_3, typename K::Point_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -316,7 +316,7 @@ struct Intersection_traits<K, typename K::Segment_3, typename K::Point_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Point_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -324,7 +324,7 @@ struct Intersection_traits<K, typename K::Point_3, typename K::Point_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Plane_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -332,7 +332,7 @@ struct Intersection_traits<K, typename K::Point_3, typename K::Plane_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Plane_3, typename K::Point_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -340,7 +340,7 @@ struct Intersection_traits<K, typename K::Plane_3, typename K::Point_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Triangle_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -348,7 +348,7 @@ struct Intersection_traits<K, typename K::Point_3, typename K::Triangle_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Triangle_3, typename K::Point_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -356,7 +356,7 @@ struct Intersection_traits<K, typename K::Triangle_3, typename K::Point_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Tetrahedron_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -364,7 +364,7 @@ struct Intersection_traits<K, typename K::Point_3, typename K::Tetrahedron_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Tetrahedron_3, typename K::Point_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -372,7 +372,7 @@ struct Intersection_traits<K, typename K::Tetrahedron_3, typename K::Point_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Point_3, typename K::Sphere_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -380,7 +380,7 @@ struct Intersection_traits<K, typename K::Point_3, typename K::Sphere_3>  {
 template<typename K>
 struct Intersection_traits<K, typename K::Sphere_3, typename K::Point_3>  {
   typedef typename
-  boost::variant< typename K::Point_3 > variant_type;
+  std::variant< typename K::Point_3 > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
 
@@ -389,7 +389,7 @@ template<class K>
 struct Intersection_traits<K, typename K::Tetrahedron_3, typename K::Plane_3>
 {
   typedef typename
-  boost::variant< typename K::Point_3 , typename K::Segment_3,
+  std::variant< typename K::Point_3 , typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
@@ -399,7 +399,7 @@ template<class K>
 struct Intersection_traits<K, typename K::Plane_3,typename K::Tetrahedron_3>
 {
   typedef typename
-  boost::variant< typename K::Point_3 , typename K::Segment_3,
+  std::variant< typename K::Point_3 , typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
@@ -409,7 +409,7 @@ template<class K>
 struct Intersection_traits<K, typename K::Triangle_3,typename K::Tetrahedron_3>
 {
   typedef typename
-  boost::variant< typename K::Point_3 , typename K::Segment_3,
+  std::variant< typename K::Point_3 , typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
@@ -419,7 +419,7 @@ template<class K>
 struct Intersection_traits<K, typename K::Tetrahedron_3,typename K::Triangle_3>
 {
   typedef typename
-  boost::variant< typename K::Point_3 , typename K::Segment_3,
+  std::variant< typename K::Point_3 , typename K::Segment_3,
                   typename K::Triangle_3, std::vector<typename K::Point_3> > variant_type;
   typedef typename std::optional< variant_type > result_type;
 };
diff --git a/Intersections_3/include/CGAL/Intersections_3/Bbox_3_Bbox_3.h b/Intersections_3/include/CGAL/Intersections_3/Bbox_3_Bbox_3.h
index 44af7d691c05..c3303e93e80a 100644
--- a/Intersections_3/include/CGAL/Intersections_3/Bbox_3_Bbox_3.h
+++ b/Intersections_3/include/CGAL/Intersections_3/Bbox_3_Bbox_3.h
@@ -25,7 +25,7 @@
 #include <CGAL/Bbox_3.h>
 
 #include <optional>
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <utility>
 
@@ -39,12 +39,12 @@ do_intersect(const CGAL::Bbox_3& c,
   return CGAL::do_overlap(c, bbox);
 }
 
-typename std::optional< typename boost::variant< Bbox_3> >
+typename std::optional< typename std::variant< Bbox_3> >
 inline
 intersection(const CGAL::Bbox_3& a,
              const CGAL::Bbox_3& b)
 {
-  typedef typename boost::variant<Bbox_3> variant_type;
+  typedef typename std::variant<Bbox_3> variant_type;
   typedef typename std::optional<variant_type> result_type;
 
   if(!do_intersect(a,b))
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_intersection.h
index df219948c4ef..1ec423af9c96 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_intersection.h
@@ -23,7 +23,7 @@
 #include <CGAL/number_utils.h>
 
 #include <optional>
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 namespace Intersections {
@@ -34,7 +34,7 @@ namespace internal {
 // But it must be a template function since the original kernel must be
 // taken into account.
 template <class K>
-typename std::optional< boost::variant<typename K::Segment_3, typename K::Point_3 > >
+typename std::optional< std::variant<typename K::Segment_3, typename K::Point_3 > >
 intersection_bl(const Bbox_3& box,
                 double lpx, double lpy, double lpz,
                 double ldx, double ldy, double ldz,
@@ -45,7 +45,7 @@ intersection_bl(const Bbox_3& box,
   typedef typename K::Vector_3  Vector_3;
   typedef typename K::Segment_3 Segment_3;
 
-  typedef typename std::optional<boost::variant< Segment_3, Point_3 > > result_type;
+  typedef typename std::optional<std::variant< Segment_3, Point_3 > > result_type;
 
   double seg_min = 0.0, seg_max = 1.0;
   // first on x value
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Triangle_3_intersection.h
index ccdba585679f..2c834588f6ba 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Iso_cuboid_3_Triangle_3_intersection.h
@@ -67,7 +67,7 @@ void clip_poly_halfspace(
       SP_type inter = k.intersect_3_object()(seg, pl);
       if(inter)
       {
-        Point* p_inter = boost::get<Point>(&*inter);
+        Point* p_inter = std::get_if<Point>(&*inter);
         if(p_inter
            && !(k.equal_3_object()(*p_inter, p1))
            && !(k.equal_3_object()(*p_inter, p2)))
@@ -90,7 +90,7 @@ void clip_poly_halfspace(
       SP_type inter = typename K::Intersect_3()(seg, pl);
       if(inter)
       {
-        Point* p_inter = boost::get<Point>(&*inter);
+        Point* p_inter = std::get_if<Point>(&*inter);
         if(p_inter
            && !(k.equal_3_object()(*p_inter, p1))
            && !(k.equal_3_object()(*p_inter, p2)))
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Plane_3_Plane_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Plane_3_Plane_3_intersection.h
index bdc881bf75aa..b0cc8f3ec226 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Plane_3_Plane_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Plane_3_Plane_3_Plane_3_intersection.h
@@ -19,7 +19,7 @@
 #include <CGAL/Intersections_3/internal/Line_3_Plane_3_intersection.h>
 
 #include <optional>
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 namespace Intersections {
@@ -74,13 +74,13 @@ intersection_point(const typename K::Plane_3& plane1,
 }
 
 template <class K>
-std::optional<boost::variant<typename K::Point_3, typename K::Line_3, typename K::Plane_3> >
+std::optional<std::variant<typename K::Point_3, typename K::Line_3, typename K::Plane_3> >
 intersection(const typename K::Plane_3& plane1,
              const typename K::Plane_3& plane2,
              const typename K::Plane_3& plane3,
              const K& k)
 {
-  typedef typename std::optional<boost::variant<typename K::Point_3,
+  typedef typename std::optional<std::variant<typename K::Point_3,
                                                   typename K::Line_3,
                                                   typename K::Plane_3> > result_type;
 
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Segment_3_Segment_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Segment_3_Segment_3_intersection.h
index 9bf2ed97ac70..c231137fd7d5 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Segment_3_Segment_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Segment_3_Segment_3_intersection.h
@@ -76,8 +76,6 @@ intersection_collinear_segments(const typename K::Segment_3& s1,
 
 template<class K>
 struct L_p_visitor
-  : public boost::static_visitor<
-      typename Intersection_traits<K, typename K::Segment_3, typename K::Segment_3>::result_type>
 {
   typedef typename Intersection_traits<K, typename K::Segment_3, typename K::Segment_3>::result_type result_type;
 
@@ -117,7 +115,7 @@ intersection(const typename K::Segment_3& s1,
       v = internal::intersection(s1.supporting_line(), s2.supporting_line(), k);
 
   if(v)
-    return apply_visitor(L_p_visitor<K>(s1, s2) , *v);
+    return std::visit(L_p_visitor<K>(s1, s2) , *v);
 
   return intersection_return<typename K::Intersect_3, typename K::Segment_3, typename K::Segment_3>();
 }
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index 424e1fc93616..41a25d4eca05 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -209,7 +209,7 @@ intersection(const typename K::Triangle_3& t1,
       return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>();
     }
 
-    return boost::apply_visitor(Triangle_Line_visitor<K>(), *inter1, *inter2);
+    return std::visit(Triangle_Line_visitor<K>(), *inter1, *inter2);
   }
 
   return intersection_return<typename K::Intersect_3, typename K::Triangle_3, typename K::Triangle_3>();
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/tetrahedron_lines_intersections_3.h b/Intersections_3/include/CGAL/Intersections_3/internal/tetrahedron_lines_intersections_3.h
index 1dc059a20f16..4aba04c9e1a7 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/tetrahedron_lines_intersections_3.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/tetrahedron_lines_intersections_3.h
@@ -68,7 +68,7 @@ struct Tetrahedron_lines_intersection_3_base
       if(do_intersect(o, triangle))
       {
         tr_seg[i] = typename K::Intersect_3()(o, triangle);
-        if(boost::get<typename K::Segment_3>(&*tr_seg[i]) != nullptr)
+        if(std::get_if<typename K::Segment_3>(&*tr_seg[i]) != nullptr)
         {
           res_id = i;
           break;
@@ -91,7 +91,7 @@ struct Tetrahedron_lines_intersection_3_base
     {
       if(tr_seg[i])
       {
-        if(const typename K::Point_3* p = boost::get<typename K::Point_3>(&*tr_seg[i]))
+        if(const typename K::Point_3* p = std::get_if<typename K::Point_3>(&*tr_seg[i]))
         {
           if(res_points.empty())
           {
diff --git a/Intersections_3/test/Intersections_3/intersection_test_helper.h b/Intersections_3/test/Intersections_3/intersection_test_helper.h
index a38e2bad55f3..2e9806ad03b6 100644
--- a/Intersections_3/test/Intersections_3/intersection_test_helper.h
+++ b/Intersections_3/test/Intersections_3/intersection_test_helper.h
@@ -311,7 +311,7 @@ struct Intersection_3_tester
     {
       if(ov->type() == typeid(T))
       {
-        auto* r = boost::get<T>(&*ov); // ov is an optional<variant>
+        auto* r = std::get_if<T>(&*ov); // ov is an optional<variant>
         assert(r);
         return (t == *r);
       }
@@ -363,7 +363,7 @@ struct Intersection_3_tester
         assert(ires12 && ires34);
 
         Variant_visitor<decltype(ires12)> vis(ires12);
-        boost::apply_visitor(vis, *ires34);
+        std::visit(vis, *ires34);
         assert(vis.equal);
       }
     }
diff --git a/Intersections_3/test/Intersections_3/test_intersections_Iso_cuboid_3.cpp b/Intersections_3/test/Intersections_3/test_intersections_Iso_cuboid_3.cpp
index 91e91913a48c..e5ef0e492844 100644
--- a/Intersections_3/test/Intersections_3/test_intersections_Iso_cuboid_3.cpp
+++ b/Intersections_3/test/Intersections_3/test_intersections_Iso_cuboid_3.cpp
@@ -208,7 +208,7 @@ struct Iso_cuboid_3_intersection_tester
       // face
       auto res = CGAL::intersection(cub, Pl(p(1,1,1), p(1,2,1), p(1,2,2)));
 
-      const std::vector<P>* poly = boost::get<std::vector<P> >(&*res);
+      const std::vector<P>* poly = std::get_if<std::vector<P> >(&*res);
       assert(poly != nullptr);
       assert(poly->size() == 4);
       for(const P& pt : *poly)
@@ -217,7 +217,7 @@ struct Iso_cuboid_3_intersection_tester
       }
       res = CGAL::intersection(cub, Pl(p(1,1,1), p(1,2,1), p(2,2,2)));
 
-      poly = boost::get<std::vector<P> >(&*res);
+      poly = std::get_if<std::vector<P> >(&*res);
       assert(poly != nullptr);
       assert(poly->size() == 4);
       for(const P& pt : *poly) {
@@ -227,7 +227,7 @@ struct Iso_cuboid_3_intersection_tester
       // other edge
       Pl pln(p(1,1,1), p(1,2,1), P(1.5, 1, 2));
       res = CGAL::intersection(cub, pln);
-      poly = boost::get<std::vector<P> >(&*res);
+      poly = std::get_if<std::vector<P> >(&*res);
       assert(poly != nullptr);
       assert(poly->size() == 4);
       for(const P& pt : *poly) {
@@ -245,7 +245,7 @@ struct Iso_cuboid_3_intersection_tester
       // random
       pln = Pl(0.265189, 0.902464, 0.33946, -2.47551);
       res = CGAL::intersection(cub, pln);
-      poly = boost::get<std::vector<P> >(&*res);
+      poly = std::get_if<std::vector<P> >(&*res);
       assert(poly != nullptr);
       assert(poly->size() == 5);
       for(const P& pt : *poly) {
@@ -575,7 +575,7 @@ struct Iso_cuboid_3_intersection_tester
     // face in a tr
     Tr tr(p(-3, -3, 1), p(3, -3, 1), P(1.5, 6, 1));
     Res res = CGAL::intersection(cub, tr);
-    Pol* poly = boost::get<std::vector<P> >(&*res);
+    Pol* poly = std::get_if<std::vector<P> >(&*res);
     assert(poly != nullptr);
     assert(poly->size() == 4);
     if(this->has_exact_c)
@@ -618,7 +618,7 @@ struct Iso_cuboid_3_intersection_tester
     // tr through
     tr = Tr(p(2, 4, 2), P(1, 3.5, -0.5), p(1, -1, 1));
     res = CGAL::intersection(cub, tr);
-    poly = boost::get<std::vector<P> >(&*res);
+    poly = std::get_if<std::vector<P> >(&*res);
     assert(poly != nullptr);
     assert(poly->size() == 4);
     if(this->has_exact_c)
@@ -635,7 +635,7 @@ struct Iso_cuboid_3_intersection_tester
     // cutting in half along diagonal (intersection included in triangle)
     tr = Tr(p(1, 1, 10), p(10, 10, 1), p(1, 1, 1));
     res = CGAL::intersection(cub, tr);
-    poly = boost::get<std::vector<P> >(&*res);
+    poly = std::get_if<std::vector<P> >(&*res);
     assert(poly != nullptr);
     assert(poly->size() == 4);
     if(this->has_exact_c)
@@ -647,7 +647,7 @@ struct Iso_cuboid_3_intersection_tester
     // 6 points intersection
     tr = Tr(P(18.66, -5.4, -11.33), P(-2.41, -7.33, 19.75), P(-10.29, 20.15, -10.33));
     res = CGAL::intersection(cub, tr);
-    poly = boost::get<std::vector<P> >(&*res);
+    poly = std::get_if<std::vector<P> >(&*res);
     assert(poly != nullptr);
     assert(poly->size() == 6);
     if(this->has_exact_c)
@@ -659,7 +659,7 @@ struct Iso_cuboid_3_intersection_tester
     // triangle clipping a cuboid corner
     tr = Tr(P(1.02, 1.33, 0.62), P(1.95, 2.54, 0.95), P(0.79, 2.36, 1.92));
     res = CGAL::intersection(cub, tr);
-    Tr* tr_res = boost::get<Tr>(&*res);
+    Tr* tr_res = std::get_if<Tr>(&*res);
     assert(tr_res != nullptr);
     if(this->has_exact_c)
     {
diff --git a/Intersections_3/test/Intersections_3/test_intersections_Plane_3.cpp b/Intersections_3/test/Intersections_3/test_intersections_Plane_3.cpp
index fc32a571b4c5..265435329e50 100644
--- a/Intersections_3/test/Intersections_3/test_intersections_Plane_3.cpp
+++ b/Intersections_3/test/Intersections_3/test_intersections_Plane_3.cpp
@@ -286,7 +286,7 @@ struct Plane_3_intersection_tester
 
       // Don't have the right values to test further.
       auto res = CGAL::intersection(tet, pln);
-      const std::vector<P>* poly = boost::get<std::vector<P> >(&*res);
+      const std::vector<P>* poly = std::get_if<std::vector<P> >(&*res);
       assert(poly != nullptr);
       assert(poly->size() == 4);
     }
diff --git a/Intersections_3/test/Intersections_3/test_intersections_Tetrahedron_3.cpp b/Intersections_3/test/Intersections_3/test_intersections_Tetrahedron_3.cpp
index 29b21af670f1..f6b40f5e7789 100644
--- a/Intersections_3/test/Intersections_3/test_intersections_Tetrahedron_3.cpp
+++ b/Intersections_3/test/Intersections_3/test_intersections_Tetrahedron_3.cpp
@@ -226,7 +226,7 @@ struct Tetrahedron_3_intersection_tester
 
       Tr tr(p(-2,2,0), p(2,2,0), P(0.25,0.25,0));
       auto res = CGAL::intersection(tet, tr);
-      const Poly* poly = boost::get<Poly>(&*res);
+      const Poly* poly = std::get_if<Poly>(&*res);
       assert(poly != nullptr);
       assert(poly->size() == 4);
       for(const P& pt : *poly) {
@@ -235,7 +235,7 @@ struct Tetrahedron_3_intersection_tester
 
       tr = Tr(P(0.45, 0.20, 0.1), P(0.1, 0.20, 0.5), P(-0.5, 0.25, -0.5));
       res = CGAL::intersection(tet, tr);
-      const Poly* inter = boost::get<Poly>(&*res);
+      const Poly* inter = std::get_if<Poly>(&*res);
       assert(inter != nullptr);
       assert(inter->size() == 5);
       for(const P& pt : *inter) {
@@ -287,22 +287,22 @@ struct Tetrahedron_3_intersection_tester
         auto res = CGAL::intersection(tet, tr);
 
         std::vector<P> points;
-        if(const P* pt = boost::get<P>(&*res))
+        if(const P* pt = std::get_if<P>(&*res))
         {
           points.push_back(*pt);
         }
-        else if(const S* s = boost::get<S>(&*res))
+        else if(const S* s = std::get_if<S>(&*res))
         {
           points.push_back(s->source());
           points.push_back(s->target());
         }
-        else if(const Tr* itr = boost::get<Tr>(&*res))
+        else if(const Tr* itr = std::get_if<Tr>(&*res))
         {
           points.push_back(itr->operator[](0));
           points.push_back(itr->operator[](1));
           points.push_back(itr->operator[](2));
         }
-        else if(const Poly* poly = boost::get<Poly>(&*res))
+        else if(const Poly* poly = std::get_if<Poly>(&*res))
         {
           points = *poly;
 
@@ -323,7 +323,7 @@ struct Tetrahedron_3_intersection_tester
     Tet tet(P(0, -1, 0), P(-1, 0, 0), P(0, 0, 0), P(0, 0, -1));
     auto res = intersection(tri, tet);
     assert(res != std::nullopt);
-    const std::vector<P> *vps = boost::get<std::vector<P>>(&*res);
+    const std::vector<P> *vps = std::get_if<std::vector<P>>(&*res);
     assert(vps!=nullptr);
   }
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
index 88afb8e5bfff..fec8c6c80a11 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
@@ -81,7 +81,7 @@ typedef Line_3<K> Line_2;
 A construction object.
 Provides the operator :
 
-`std::optional< boost::variant<Point_2,Segment_2> > operator()(Segment_2 s1, Segment_2 s2);`
+`std::optional< std::variant<Point_2,Segment_2> > operator()(Segment_2 s1, Segment_2 s2);`
 which returns a 3D object whose projection on the xy-plane
 is the intersection of the projections of `s1` and `s2`.
 If non empty, the returned object is either a segment or a point.
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Spherical_kernel_intersections.h b/Kernel_23/doc/Kernel_23/CGAL/Spherical_kernel_intersections.h
index f235beb0e798..855543689845 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Spherical_kernel_intersections.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Spherical_kernel_intersections.h
@@ -102,7 +102,7 @@ intersection(const SphericalType1 &obj1, const SphericalType2 &obj2,
 /*!
 Copies in the output iterator the intersection elements between the
 three objects. `intersections` iterates on
-elements of type `boost::variant< Circle_3, Plane_3, Sphere_3, std::pair< Circular_arc_point_3, unsigned > >`, in lexicographic order
+elements of type `std::variant< Circle_3, Plane_3, Sphere_3, std::pair< Circular_arc_point_3, unsigned > >`, in lexicographic order
 when this ordering is defined on the computed objects
 
 where `Type1`, `Type2` and `Type3`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/intersections.h b/Kernel_23/doc/Kernel_23/CGAL/intersections.h
index 430e37cbcc09..160bb35d7ebc 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/intersections.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/intersections.h
@@ -103,7 +103,7 @@ The following tables give the possible values for `Type1` and `Type2`.
 
 The return type of intersecting two objects of the types `Type1` and `Type2` can be
 specified through the placeholder type specifier `auto`. It is equivalent to
-`std::optional< boost::variant< T... > >`, the last column in the table providing
+`std::optional< std::variant< T... > >`, the last column in the table providing
 the template parameter pack.
 
 <DIV ALIGN="CENTER">
@@ -193,7 +193,7 @@ the template parameter pack.
 </DIV>
 
 Additional overloads are provided for the type `Point_2` combined with any other type with the result type being
-`std::optional< boost::variant< Point_2 > >`.
+`std::optional< std::variant< Point_2 > >`.
 Overloads are also provided for the type `Bbox_2`, for all
 intersections existing with the type `Iso_rectangle_2`. Note that the return type for `Bbox_2` - `Bbox_2`
  is `Bbox_2` and not `Iso_rectangle_2`.
@@ -202,7 +202,7 @@ intersections existing with the type `Iso_rectangle_2`. Note that the return typ
 
 The return type of intersecting two objects of the types `Type1` and `Type2` can be
 specified through the placeholder type specifier `auto`. It is equivalent to
-`std::optional< boost::variant< T... > >`, the last column in the table providing
+`std::optional< std::variant< T... > >`, the last column in the table providing
 the template parameter pack.
 
 <DIV ALIGN="CENTER">
@@ -351,7 +351,7 @@ the template parameter pack.
 </DIV>
 
 Additional overloads are provided for the type `Point_3` combined with any other type with the result type being
-`std::optional< boost::variant< Point_3 > >`. Overloads are also provided for the type `Bbox_3`, for all
+`std::optional< std::variant< Point_3 > >`. Overloads are also provided for the type `Bbox_3`, for all
 intersections existing with the type `Iso_cuboid_3`. Note that the return type for `Bbox_3` - `Bbox_3`
  is `Bbox_3` and not `Iso_cuboid_3`.
 
@@ -363,18 +363,18 @@ The following examples demonstrate the most common use of
 
 In the first two examples we intersect a segment and a line.
 The result type can be specified through the placeholder type specifier `auto`,
-but you must anyway know that the result type is a `std::optional<boost::variant<..> >`,
+but you must anyway know that the result type is a `std::optional<std::variant<..> >`,
 in order to unpack the point or segment.
 
 <A HREF="https://www.boost.org/libs/optional/">`std::optional`</A> comes in
-as there might be no intersection. <A HREF="https://www.boost.org/libs/variant/">`boost::variant`</A> comes in
+as there might be no intersection. <A HREF="https://www.boost.org/libs/variant/">`std::variant`</A> comes in
 as, if there is an intersection, it is either a point or a segment.
 
-As explained in the boost manual pages for <A HREF="https://www.boost.org/libs/variant/">`boost::variant`</A>, there are two ways to access the variants. The first examples uses `boost::get`.
+As explained in the boost manual pages for <A HREF="https://www.boost.org/libs/variant/">`std::variant`</A>, there are two ways to access the variants. The first examples uses `boost::get`.
 
 \cgalExample{Kernel_23/intersection_get.cpp}
 
-The second example uses `boost::apply_visitor`.
+The second example uses `std::visit`.
 
 \cgalExample{Kernel_23/intersection_visitor.cpp}
 
diff --git a/Kernel_23/doc/Kernel_23/Kernel_23.txt b/Kernel_23/doc/Kernel_23/Kernel_23.txt
index 451829f8eaee..0919077d3ab3 100644
--- a/Kernel_23/doc/Kernel_23/Kernel_23.txt
+++ b/Kernel_23/doc/Kernel_23/Kernel_23.txt
@@ -495,7 +495,7 @@ especially integer types and rationals.
 
 Some functions, for example \link intersection_linear_grp `intersection()`\endlink,
 can return different types of objects. To achieve this in a type-safe way \cgal uses
-return values of type `std::optional< boost::variant< T...  > >` where `T...` is a
+return values of type `std::optional< std::variant< T...  > >` where `T...` is a
 list of all possible resulting geometric objects. The exact result type of an intersection
 can be specified through the placeholder type specifier `auto`.
 
@@ -521,10 +521,10 @@ std::cin >> segment_1 >> segment_2;
 auto v = intersection(segment_1, segment_2);
 if (v) {
   /* not empty */
-  if (const Point_2 *p = boost::get<Point_2>(&*v) ) {
+  if (const Point_2 *p = std::get_if<Point_2>(&*v) ) {
     /* do something with *p */
   } else {
-    const Segment_2 *s = boost::get<Segment_2>(&*v);
+    const Segment_2 *s = std::get_if<Segment_2>(&*v);
     /* do something with *s */
   }
 } else {
diff --git a/Kernel_23/examples/Kernel_23/cartesian_converter.cpp b/Kernel_23/examples/Kernel_23/cartesian_converter.cpp
index ebd4343d3040..6d13c05bce16 100644
--- a/Kernel_23/examples/Kernel_23/cartesian_converter.cpp
+++ b/Kernel_23/examples/Kernel_23/cartesian_converter.cpp
@@ -30,7 +30,7 @@ int main(){
   // As we are sure that there IS an intersection
   // and that the intersection IS a point
   // we do not have to check for this, or put it in a try/catch
-  const EK::Point_3& exact_pt = boost::get<EK::Point_3>(*inter);
+  const EK::Point_3& exact_pt = std::get<EK::Point_3>(*inter);
 
   EK_to_IK to_inexact;
 
diff --git a/Kernel_23/examples/Kernel_23/intersection_get.cpp b/Kernel_23/examples/Kernel_23/intersection_get.cpp
index ff2332a153cc..b245edd4a56d 100644
--- a/Kernel_23/examples/Kernel_23/intersection_get.cpp
+++ b/Kernel_23/examples/Kernel_23/intersection_get.cpp
@@ -14,10 +14,10 @@ int main()
 
   const auto result = intersection(seg, lin);
   if (result) {
-    if (const Segment_2* s = boost::get<Segment_2>(&*result)) {
+    if (const Segment_2* s = std::get_if<Segment_2>(&*result)) {
       std::cout << *s << std::endl;
     } else {
-      const Point_2* p = boost::get<Point_2 >(&*result);
+      const Point_2* p = std::get_if<Point_2 >(&*result);
       std::cout << *p << std::endl;
     }
   }
diff --git a/Kernel_23/examples/Kernel_23/intersection_visitor.cpp b/Kernel_23/examples/Kernel_23/intersection_visitor.cpp
index ffe5c09c7d89..61d0dbba7e27 100644
--- a/Kernel_23/examples/Kernel_23/intersection_visitor.cpp
+++ b/Kernel_23/examples/Kernel_23/intersection_visitor.cpp
@@ -28,7 +28,7 @@ int main()
 
   const auto result = intersection(seg, lin);
   if (result) {
-    boost::apply_visitor(Intersection_visitor(), *result);
+    std::visit(Intersection_visitor(), *result);
   } else {
     // no intersection
   }
diff --git a/Kernel_23/include/CGAL/Kernel/Type_mapper.h b/Kernel_23/include/CGAL/Kernel/Type_mapper.h
index a33224fcd59d..af76c7469566 100644
--- a/Kernel_23/include/CGAL/Kernel/Type_mapper.h
+++ b/Kernel_23/include/CGAL/Kernel/Type_mapper.h
@@ -28,7 +28,7 @@
 #include <boost/mpl/remove.hpp>
 
 #include <optional>
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <boost/preprocessor/facilities/expand.hpp>
 #include <boost/preprocessor/repetition/repeat_from_to.hpp>
@@ -66,9 +66,9 @@ struct Type_mapper_impl<std::optional<T>, K1, K2 > {
 
 #define CGAL_VARIANT_TYPEMAP(z, n, d) \
 template< typename K1, typename K2, BOOST_PP_ENUM_PARAMS(n, class T) >            \
-struct Type_mapper_impl<boost::variant<BOOST_PP_ENUM_PARAMS(n, T)>, K1, K2> {                    \
+struct Type_mapper_impl<std::variant<BOOST_PP_ENUM_PARAMS(n, T)>, K1, K2> {                    \
   BOOST_PP_REPEAT(n, CGAL_TYPEMAP_TYPEDEFS, T)                            \
-  typedef boost::variant<BOOST_PP_ENUM_PARAMS(n, A)> type; \
+  typedef std::variant<BOOST_PP_ENUM_PARAMS(n, A)> type; \
 };
 
 BOOST_PP_REPEAT_FROM_TO(1, 10, CGAL_VARIANT_TYPEMAP, _)
@@ -76,16 +76,6 @@ BOOST_PP_REPEAT_FROM_TO(1, 10, CGAL_VARIANT_TYPEMAP, _)
 #undef CGAL_TYPEMAP_TYPEDEFS
 #undef CGAL_VARIANT_TYPEMAP
 
-// CODE_TAG
-//template<typename K1, typename K2, BOOST_VARIANT_ENUM_PARAMS(typename U) >
-//struct Type_mapper_impl<boost::variant<BOOST_VARIANT_ENUM_PARAMS(U)>, K1, K2 > {
-//  typedef typename boost::make_variant_over<
-//    typename boost::mpl::transform<
-//      typename boost::variant<BOOST_VARIANT_ENUM_PARAMS(U)>::types,
-//      Type_mapper_impl<boost::mpl::_1, K1, K2> >::type
-//    >::type type;
-//};
-
 // Then we specialize for all kernel objects.
 // More details on why it is like that are here: https://github.com/CGAL/cgal/pull/4878#discussion_r459986501
 #define CGAL_Kernel_obj(X) \
diff --git a/Kernel_23/include/CGAL/Kernel/function_objects.h b/Kernel_23/include/CGAL/Kernel/function_objects.h
index 29d74179a87c..b60b44a28259 100644
--- a/Kernel_23/include/CGAL/Kernel/function_objects.h
+++ b/Kernel_23/include/CGAL/Kernel/function_objects.h
@@ -1765,7 +1765,7 @@ namespace CommonKernelFunctors {
 
       const auto res = typename K::Intersect_3()(l1,l2);
       CGAL_assertion(res!=std::nullopt);
-      const Point* e_pt = boost::get<Point>(&(*res));
+      const Point* e_pt = std::get_if<Point>(&(*res));
       CGAL_assertion(e_pt!=nullptr);
       return *e_pt;
     }
@@ -2173,7 +2173,7 @@ namespace CommonKernelFunctors {
 
       const auto res = typename K::Intersect_3()(plane,line);
       CGAL_assertion(res!=std::nullopt);
-      const Point* e_pt = boost::get<Point>(&(*res));
+      const Point* e_pt = std::get_if<Point>(&(*res));
       CGAL_assertion(e_pt!=nullptr);
       return *e_pt;
     }
@@ -2186,7 +2186,7 @@ namespace CommonKernelFunctors {
 
       const auto res = typename K::Intersect_3()(plane,line);
       CGAL_assertion(res!=std::nullopt);
-      const Point* e_pt = boost::get<Point>(&(*res));
+      const Point* e_pt = std::get_if<Point>(&(*res));
       CGAL_assertion(e_pt!=nullptr);
       return *e_pt;
     }
@@ -3413,7 +3413,7 @@ namespace CommonKernelFunctors {
       const Plane_3& plane = circ.supporting_plane();
       const auto optional = K().intersect_3_object()(plane, Segment_3(a, b));
       CGAL_kernel_assertion_msg(bool(optional) == true, "the segment does not intersect the supporting plane");
-      const Point_3* p = boost::get<Point_3>(&*optional);
+      const Point_3* p = std::get_if<Point_3>(&*optional);
       CGAL_kernel_assertion_msg(p != 0, "the segment intersection with the plane is not a point");
       return squared_distance(circ.center(), *p) < circ.squared_radius();
     }
@@ -3618,7 +3618,7 @@ namespace CommonKernelFunctors {
     operator()(const T1& t1, const T2& t2) const
     { return Intersections::internal::intersection(t1, t2, K() ); }
 
-    std::optional<boost::variant<typename K::Point_3, typename K::Line_3, typename K::Plane_3> >
+    std::optional<std::variant<typename K::Point_3, typename K::Line_3, typename K::Plane_3> >
     operator()(const Plane_3& pl1, const Plane_3& pl2, const Plane_3& pl3)const
     { return Intersections::internal::intersection(pl1, pl2, pl3, K() ); }
   };
diff --git a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
index d1cb83d135de..dd4e24005a48 100644
--- a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
+++ b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
@@ -428,10 +428,10 @@ class  Intersect_projected_3
 
 
 
-  std::optional< boost::variant<Point_3,Segment_3> >
+  std::optional< std::variant<Point_3,Segment_3> >
   operator()(const Segment_3& s1, const Segment_3& s2) const
   {
-    typedef  boost::variant<Point_3, Segment_3> variant_type;
+    typedef  std::variant<Point_3, Segment_3> variant_type;
 
     Point_2 s1_source = project(s1.source());
     Point_2 s1_target = project(s1.target());
@@ -450,7 +450,7 @@ class  Intersect_projected_3
       return std::nullopt;
     }
 
-    if(const Segment_2* si = boost::get<Segment_2>(&*o)){
+    if(const Segment_2* si = std::get_if<Segment_2>(&*o)){
       FT src[3],tgt[3];
       //the third coordinate is the midpoint between the points on s1 and s2
       FT z1 = s1.source()[dim] + ( alpha(si->source(), s1_source, s1_target) * ( s1.target()[dim] - s1.source()[dim] ));
@@ -472,7 +472,7 @@ class  Intersect_projected_3
     }
 
 
-    const Point_2* pi = boost::get<Point_2>(&*o);
+    const Point_2* pi = std::get_if<Point_2>(&*o);
     FT coords[3];
     //compute the third coordinate of the projected intersection point onto 3D segments
     FT z1 = s1.source()[dim] + ( alpha(*pi, s1_source, s1_target) * ( s1.target()[dim] - s1.source()[dim] ));
diff --git a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h
index 873ad1bcb144..089fe5ba6cb0 100644
--- a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h
+++ b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_base_3.h
@@ -182,12 +182,12 @@ class Projected_intersect_3
     CGAL_TIME_PROFILER("Construct Projected_intersect_3")
   }
 
-  std::optional<boost::variant<Point,Segment> >
+  std::optional<std::variant<Point,Segment> >
   operator()(const Segment& s1, const Segment& s2)
   {
     CGAL_PROFILER("Projected_intersect_3::operator()")
     CGAL_TIME_PROFILER("Projected_intersect_3::operator()")
-    typedef boost::variant<Point, Segment> variant_type;
+    typedef std::variant<Point, Segment> variant_type;
     const Vector_3 u1 = cross_product(s1.to_vector(), normal);
     if(u1 == NULL_VECTOR)
       return K().intersect_3_object()(s1.supporting_line(), s2);
@@ -206,7 +206,7 @@ class Projected_intersect_3
 #endif
       return std::nullopt;
     }
-    if(const Line* line = boost::get<Line>(&*planes_intersection))
+    if(const Line* line = std::get_if<Line>(&*planes_intersection))
     {
       // check if the intersection line intersects both segments by
       // checking if a point on the intersection line is between
@@ -235,12 +235,12 @@ class Projected_intersect_3
         if(! inter){
           return std::nullopt;
         }
-        if(const Point* point = boost::get<Point>(&*inter)){
+        if(const Point* point = std::get_if<Point>(&*inter)){
           return std::make_optional(variant_type(*point));
         }
       }
     }
-    if(boost::get<Plane_3>(&*planes_intersection))
+    if(std::get_if<Plane_3>(&*planes_intersection))
     {
 #ifdef CGAL_T2_PTB_3_DEBUG
       std::cerr << "coplanar supporting lines\n";
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_depth.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_depth.h
index 313d448c8715..b3e519f29792 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_depth.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_depth.h
@@ -14,7 +14,7 @@ _test_depth(const R& )
   Point_3 m = CGAL::midpoint(p,q);
 
   auto result = CGAL::intersection(s0, s1);
-  const Point_3* ip = boost::get<Point_3>(&*result);
+  const Point_3* ip = std::get_if<Point_3>(&*result);
 
   assert(CGAL::depth(p) == 0);
   assert(CGAL::depth(q) == 0);
diff --git a/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h b/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h
index 16448e7eff50..769b4a3d0a2b 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/intersections_d.h
@@ -36,7 +36,7 @@ The following table gives the possible values for `Type1` and `Type2`.
 
 The return type of intersecting two objects of the types `Type1` and `Type2` can be
 specified through the placeholder type specifier `auto`. It is equivalent to
-`std::optional< boost::variant< T... > >`, the last column in the table providing
+`std::optional< std::variant< T... > >`, the last column in the table providing
 the template parameter pack.
 
 
@@ -147,7 +147,7 @@ void foo(Segment_d<R> seg, Line_d<R> lin)
 {
   // use auto
   auto result = intersection(seg, lin);
-  if(result) { boost::apply_visitor(Intersection_visitor<R>(), *result); }
+  if(result) { std::visit(Intersection_visitor<R>(), *result); }
   else { // no intersection
   }
 }
@@ -156,7 +156,7 @@ void foo(Segment_d<R> seg, Line_d<R> lin)
 \sa `do_intersect`
 \sa `Kernel_d::Intersect_d`
 \sa <a HREF="https://www.boost.org/doc/libs/release/libs/optional/index.html">`std::optional`</a>
-\sa <a HREF="https://www.boost.org/doc/html/variant.html">`boost::variant`</a>
+\sa <a HREF="https://www.boost.org/doc/html/variant.html">`std::variant`</a>
 
 */
 decltype(auto)
diff --git a/Kernel_d/doc/Kernel_d/Kernel_d.txt b/Kernel_d/doc/Kernel_d/Kernel_d.txt
index 1e1e3361096c..ab2154269a8d 100644
--- a/Kernel_d/doc/Kernel_d/Kernel_d.txt
+++ b/Kernel_d/doc/Kernel_d/Kernel_d.txt
@@ -477,7 +477,7 @@ Intersections on kernel objects currently cover only those objects
 that are part of flats (`R::Segment_d`, `R::Ray_d`,
 `R::Line_d`, and `R::Hyperplane_d`). For any pair of objects
 \f$ o1\f$, \f$ o2\f$ of these types the operation `intersection(o1,o2)`
-returns a `std::optional< boost::variant< T... > >`
+returns a `std::optional< std::variant< T... > >`
 where `T...` is a list of all possible resulting geometric objects.
 
 The return type of intersecting two objects of the types `Type1` and `Type2` can be
@@ -501,10 +501,10 @@ std::cin >> s1 >> s2;
 auto v = intersection(s1, s2);
 if (v) {
   // not empty
-  if (const Point *p = boost::get<Point>(&*v) ) {
+  if (const Point *p = std::get_if<Point>(&*v) ) {
     // do something with *p
   } else {
-    const Segment *s = boost::get<Segment>(&*v) ) {
+    const Segment *s = std::get_if<Segment>(&*v) ) {
     // do something with *s
   }
 } else {
diff --git a/Kernel_d/include/CGAL/Kernel_d/function_objects.h b/Kernel_d/include/CGAL/Kernel_d/function_objects.h
index 0e073c0272d4..0a20e339cf01 100644
--- a/Kernel_d/include/CGAL/Kernel_d/function_objects.h
+++ b/Kernel_d/include/CGAL/Kernel_d/function_objects.h
@@ -76,22 +76,22 @@ class Intersect
 
   template <typename F>
   struct result<F(Line_d, Line_d)>
-  { typedef std::optional< boost::variant< Point_d, Line_d > > type; };
+  { typedef std::optional< std::variant< Point_d, Line_d > > type; };
 
   template <typename F>
   struct result<F(Segment_d, Line_d)>
-  { typedef std::optional< boost::variant< Point_d, Segment_d > > type; };
+  { typedef std::optional< std::variant< Point_d, Segment_d > > type; };
   template <typename F>
   struct result<F(Line_d, Segment_d)> : result<F(Segment_d, Line_d)>
   { };
 
   template <typename F>
   struct result<F(Segment_d, Segment_d)>
-  { typedef std::optional< boost::variant< Point_d, Segment_d > > type; };
+  { typedef std::optional< std::variant< Point_d, Segment_d > > type; };
 
   template <typename F>
   struct result<F(Ray_d, Line_d)>
-  { typedef std::optional< boost::variant< Point_d, Ray_d > > type; };
+  { typedef std::optional< std::variant< Point_d, Ray_d > > type; };
 
   template <typename F>
   struct result<F(Line_d, Ray_d)> : result<F(Ray_d, Line_d)>
@@ -99,7 +99,7 @@ class Intersect
 
   template <typename F>
   struct result<F(Ray_d, Segment_d)>
-  { typedef std::optional< boost::variant< Point_d, Segment_d > > type; };
+  { typedef std::optional< std::variant< Point_d, Segment_d > > type; };
 
   template <typename F>
   struct result<F(Segment_d, Ray_d)> : result<F(Ray_d, Segment_d)>
@@ -107,25 +107,25 @@ class Intersect
 
   template <typename F>
   struct result<F(Ray_d, Ray_d)>
-  { typedef std::optional< boost::variant< Point_d, Segment_d, Ray_d > > type; };
+  { typedef std::optional< std::variant< Point_d, Segment_d, Ray_d > > type; };
 
   template <typename F>
   struct result<F(Hyperplane_d, Line_d)>
-  { typedef std::optional< boost::variant< Point_d, Line_d > > type; };
+  { typedef std::optional< std::variant< Point_d, Line_d > > type; };
   template <typename F>
   struct result<F(Line_d, Hyperplane_d)> : result<F(Hyperplane_d, Line_d)>
   { };
 
   template <typename F>
   struct result<F(Hyperplane_d, Ray_d)>
-  { typedef std::optional< boost::variant< Point_d, Ray_d > > type; };
+  { typedef std::optional< std::variant< Point_d, Ray_d > > type; };
   template <typename F>
   struct result<F(Ray_d, Hyperplane_d)> : result<F(Hyperplane_d, Ray_d)>
   { };
 
   template <typename F>
   struct result<F(Hyperplane_d, Segment_d)>
-  { typedef std::optional< boost::variant< Point_d, Segment_d > > type; };
+  { typedef std::optional< std::variant< Point_d, Segment_d > > type; };
   template <typename F>
   struct result<F(Segment_d, Hyperplane_d)> : result<F(Hyperplane_d, Segment_d)>
   { };
diff --git a/Mesh_3/benchmark/Mesh_3/StdAfx.h b/Mesh_3/benchmark/Mesh_3/StdAfx.h
index 9ca9eb02fa71..53157d070a2f 100644
--- a/Mesh_3/benchmark/Mesh_3/StdAfx.h
+++ b/Mesh_3/benchmark/Mesh_3/StdAfx.h
@@ -143,7 +143,7 @@
 #include <boost/type_traits/remove_const.hpp>
 #include <boost/type_traits/remove_reference.hpp>
 #include <boost/utility.hpp>
-#include <boost/variant.hpp>
+#include <variant>
 #include <boost/version.hpp>
 
 // CGAL
diff --git a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
index 93b25870c210..5212ed6ea861 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
@@ -53,9 +53,9 @@ Function object that constructs the intersection
 between a 3D segment and a 3D triangle.
 Partial model of `::Kernel::Intersect_3`. Provides the operators:
 
-- `std::optional< boost::variant< Point_3, Segment_3 > > operator()(Segment_3 seg, Triangle_3 tr)`
+- `std::optional< std::variant< Point_3, Segment_3 > > operator()(Segment_3 seg, Triangle_3 tr)`
 
-- `std::optional< boost::variant< Point_3, Segment_3 > > operator()(Triangle_3 tr, Segment_3 seg)`
+- `std::optional< std::variant< Point_3, Segment_3 > > operator()(Triangle_3 tr, Segment_3 seg)`
 
 which computes the intersection between the triangle and the segment.
 */
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
index 63fcddb7a40c..8958ab919a7c 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
@@ -312,11 +312,11 @@ class MeshTriangulationTraits_3
   /*!
   A constructor object that must provide the function operators:
 
-  `std::optional< boost::variant< T... > > operator()(Segment_3 s, Plane_3 p)`
+  `std::optional< std::variant< T... > > operator()(Segment_3 s, Plane_3 p)`
 
-  `std::optional< boost::variant< T... > > operator()(Ray_3 r, Iso_cuboid i)`
+  `std::optional< std::variant< T... > > operator()(Ray_3 r, Iso_cuboid i)`
 
-  `std::optional< boost::variant< T... > > operator()(Segment_3 s, Iso_cuboid i)`
+  `std::optional< std::variant< T... > > operator()(Segment_3 s, Iso_cuboid i)`
 
   which returns the intersection region of two geometrical objects.
   */
diff --git a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
index a6fd33ab1eca..7e7f98b86e57 100644
--- a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
@@ -1096,7 +1096,7 @@ class Labeled_mesh_domain_3
     {
       const auto clipped = CGAL::intersection(query, r_domain_.bbox_);
       if(clipped)
-        if(const Segment_3* s = boost::get<Segment_3>(&*clipped))
+        if(const Segment_3* s = std::get_if<Segment_3>(&*clipped))
           return this->operator()(*s);
 
       return Surface_patch();
@@ -1224,7 +1224,7 @@ class Labeled_mesh_domain_3
     {
       const auto clipped = CGAL::intersection(query, r_domain_.bbox_);
       if(clipped)
-        if(const Segment_3* s = boost::get<Segment_3>(&*clipped))
+        if(const Segment_3* s = std::get_if<Segment_3>(&*clipped))
           return this->operator()(*s);
 
       return Intersection();
@@ -1259,14 +1259,14 @@ class Labeled_mesh_domain_3
    * where lies a vertex with dimension 2 and index `index`.
    */
   Surface_patch_index surface_patch_index(const Index& index) const
-  { return boost::get<Surface_patch_index>(index); }
+  { return std::get<Surface_patch_index>(index); }
 
   /*
    * Returns the index of the subdomain containing a vertex
    *  with dimension 3 and index `index`.
    */
   Subdomain_index subdomain_index(const Index& index) const
-  { return boost::get<Subdomain_index>(index); }
+  { return std::get<Subdomain_index>(index); }
 
   // -----------------------------------
   // Backward Compatibility
diff --git a/Mesh_3/include/CGAL/Mesh_3/experimental/Sizing_field_with_aabb_tree.h b/Mesh_3/include/CGAL/Mesh_3/experimental/Sizing_field_with_aabb_tree.h
index a35b11727915..344654e42b12 100644
--- a/Mesh_3/include/CGAL/Mesh_3/experimental/Sizing_field_with_aabb_tree.h
+++ b/Mesh_3/include/CGAL/Mesh_3/experimental/Sizing_field_with_aabb_tree.h
@@ -501,7 +501,7 @@ struct Sizing_field_with_aabb_tree
         const auto int_res = CGAL::intersection(prim.datum(), curr_ortho_plane);
         if (int_res)
         {
-          if (const Point_3* pp = boost::get<Point_3>(&*int_res))
+          if (const Point_3* pp = std::get_if<Point_3>(&*int_res))
           {
             FT new_sqd = CGAL::squared_distance(p, *pp);
             FT dist = CGAL::abs(d_ptr->domain.signed_geodesic_distance(p, *pp, curve_id));
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 47b9bf495ade..47e8fe5d205e 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -38,7 +38,7 @@
 #include <type_traits>
 
 #include <boost/next_prior.hpp> // for boost::prior and boost::next
-#include <boost/variant.hpp>
+#include <variant>
 #include <memory>
 
 namespace CGAL {
@@ -772,22 +772,22 @@ class Mesh_domain_with_polyline_features_3
    * where lies a vertex with dimension 2 and index `index`.
    */
   Surface_patch_index surface_patch_index(const Index& index) const
-  { return boost::get<Surface_patch_index>(index); }
+  { return std::get<Surface_patch_index>(index); }
 
   /**
    * Returns the index of the subdomain containing a vertex
    *  with dimension 3 and index `index`.
    */
   Subdomain_index subdomain_index(const Index& index) const
-  { return boost::get<Subdomain_index>(index); }
+  { return std::get<Subdomain_index>(index); }
 
   /// Returns a `Curve_index` from an `Index`
   Curve_index curve_index(const Index& index) const
-  { return boost::get<Curve_index>(index); }
+  { return std::get<Curve_index>(index); }
 
   /// Returns a `Corner_index` from an `Index`
   Corner_index corner_index(const Index& index) const
-  { return boost::get<Corner_index>(index); }
+  { return std::get<Corner_index>(index); }
 
   /// @cond DEVELOPERS
 #ifndef CGAL_NO_DEPRECATED_CODE
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 66178d3906f1..73430e2aec56 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -536,15 +536,15 @@ class Polyhedral_complex_mesh_domain_3
         return std::nullopt;
       else {
         for(const Inter_and_prim& i_p: all_intersections) {
-          if(boost::get<Point_3>( &i_p.first) == 0) return AABB_primitive_id();
+          if(std::get_if<Point_3>( &i_p.first) == 0) return AABB_primitive_id();
         }
         auto it = std::min_element
           (all_intersections.begin(), all_intersections.end(),
            [p](const Inter_and_prim& a,
                const Inter_and_prim& b)
            {
-             const Point_3& pa = boost::get<Point_3>(a.first);
-             const Point_3& pb = boost::get<Point_3>(b.first);
+             const Point_3& pa = std::get<Point_3>(a.first);
+             const Point_3& pb = std::get<Point_3>(b.first);
              return compare_distance_to_point(p, pa, pb)
              == CGAL::SMALLER;
            });
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 5ac9a12411a5..417c27777a61 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -42,7 +42,7 @@
 #include <boost/mpl/contains.hpp>
 #include <boost/mpl/or.hpp>
 #include <boost/format.hpp>
-#include <boost/variant.hpp>
+#include <variant>
 #include <boost/math/special_functions/round.hpp>
 
 #include <iostream>
@@ -459,7 +459,7 @@ class Polyhedral_mesh_domain_3
 
         // intersection may be either a point or a segment
         if ( const Bare_point* p_intersect_pt =
-             boost::get<Bare_point>( &(intersection->first) ) )
+             std::get_if<Bare_point>( &(intersection->first) ) )
         {
           return Intersection(*p_intersect_pt,
                               r_domain_.index_from_surface_patch_index(
@@ -467,7 +467,7 @@ class Polyhedral_mesh_domain_3
                               2);
         }
         else if ( const Segment_3* p_intersect_seg =
-                  boost::get<Segment_3>(&(intersection->first)))
+                  std::get_if<Segment_3>(&(intersection->first)))
         {
           CGAL_MESH_3_PROFILER("Mesh_3 profiler: Intersection is a segment");
 
@@ -533,14 +533,14 @@ class Polyhedral_mesh_domain_3
    * where lies a vertex with dimension 2 and index `index`.
    */
   Surface_patch_index surface_patch_index(const Index& index) const
-  { return boost::get<Surface_patch_index>(index); }
+  { return std::get<Surface_patch_index>(index); }
 
   /**
    * Returns the index of the subdomain containing a vertex
    *  with dimension 3 and index `index`.
    */
   Subdomain_index subdomain_index(const Index& index) const
-  { return boost::get<Subdomain_index>(index); }
+  { return std::get<Subdomain_index>(index); }
 
   // -----------------------------------
   // Backward Compatibility
@@ -607,7 +607,7 @@ class Polyhedral_mesh_domain_3
   AABB_tree_* bounding_tree_;
 
   // cache queries and intersected primitive
-  typedef typename boost::make_variant_over<Allowed_query_types>::type Cached_query;
+  typedef typename std::variant<Segment_3, Ray_3, Line_3>::type Cached_query;
   struct Query_cache
   {
     Query_cache() : has_cache(false) {}
diff --git a/Mesh_3/test/Mesh_3/test_labeled_mesh_domain_3.cpp b/Mesh_3/test/Mesh_3/test_labeled_mesh_domain_3.cpp
index 25a468bbf6f4..e5e5cf7f04fb 100644
--- a/Mesh_3/test/Mesh_3/test_labeled_mesh_domain_3.cpp
+++ b/Mesh_3/test/Mesh_3/test_labeled_mesh_domain_3.cpp
@@ -205,7 +205,7 @@ struct LM3_tester
       Intersection i = construct_intersection(s);
       assert(std::get<0>(i) != Point_3(1., 0., 0.));
       Index ii = std::get<1>(i);
-      assert(boost::get<Surface_patch_index>(&ii));
+      assert(std::get_if<Surface_patch_index>(&ii));
       assert(std::get<2>(i) == 2);
     }
 
@@ -213,7 +213,7 @@ struct LM3_tester
       Segment_3 s(Point_3(1.5, 1.5, 0.), Point_3(1.5, 0., 0.));
       Intersection i = construct_intersection(s);
       Index ii = std::get<1>(i);
-      assert(boost::get<Subdomain_index>(&ii));
+      assert(std::get_if<Subdomain_index>(&ii));
       assert(std::get<2>(i) == 0);
     }
 
@@ -222,7 +222,7 @@ struct LM3_tester
       Intersection i = construct_intersection(r);
       assert(std::get<0>(i) != Point_3(1., 0., 0.));
       Index ii = std::get<1>(i);
-      assert(boost::get<Surface_patch_index>(&ii));
+      assert(std::get_if<Surface_patch_index>(&ii));
       assert(std::get<2>(i) == 2);
     }
 
@@ -230,7 +230,7 @@ struct LM3_tester
       Ray_3 r(Point_3(1.5, 0., 0.), Vector_3(0., 1., 0.));
       Intersection i = construct_intersection(r);
       Index ii = std::get<1>(i);
-      assert(boost::get<Subdomain_index>(&ii));
+      assert(std::get_if<Subdomain_index>(&ii));
       assert(std::get<2>(i) == 0);
     }
 
@@ -239,7 +239,7 @@ struct LM3_tester
       Intersection i = construct_intersection(l);
       assert(std::get<0>(i) != Point_3(1., 0., 0.));
       Index ii = std::get<1>(i);
-      assert(boost::get<Surface_patch_index>(&ii));
+      assert(std::get_if<Surface_patch_index>(&ii));
       assert(std::get<2>(i) == 2);
     }
 
@@ -247,7 +247,7 @@ struct LM3_tester
       Line_3 l(Point_3(1.5, 0., 0.), Point_3(1.5, 0.5, 0.));
       Intersection i = construct_intersection(l);
       Index ii = std::get<1>(i);
-      assert(boost::get<Subdomain_index>(&ii));
+      assert(std::get_if<Subdomain_index>(&ii));
       assert(std::get<2>(i) == 0);
     }
   }
diff --git a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Arr_labeled_traits_2.h b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Arr_labeled_traits_2.h
index 8db0bd9849af..1cb47858c429 100644
--- a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Arr_labeled_traits_2.h
+++ b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Arr_labeled_traits_2.h
@@ -297,10 +297,10 @@ class Arr_labeled_traits_2 : public Traits_ {
                               OutputIterator oi) const
     {
       typedef std::pair<Base_point_2, Multiplicity>     Intersection_base_point;
-      typedef boost::variant<Intersection_base_point, Base_x_monotone_curve_2>
+      typedef std::variant<Intersection_base_point, Base_x_monotone_curve_2>
                                                         Intersection_base_result;
       typedef std::pair<Point_2, Multiplicity>     Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
+      typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
 
       // In case the curves are adjacent in their curve sequence, we do
@@ -317,7 +317,7 @@ class Arr_labeled_traits_2 : public Traits_ {
       // Attach labels to the intersection objects.
       for (const auto& xection : xections) {
         const Intersection_base_point* base_pt =
-          boost::get<Intersection_base_point>(&xection);
+          std::get_if<Intersection_base_point>(&xection);
 
         if (base_pt != nullptr) {
           // Attach an invalid label to an itersection point.
@@ -327,7 +327,7 @@ class Arr_labeled_traits_2 : public Traits_ {
         }
 
         const Base_x_monotone_curve_2* base_xcv =
-          boost::get<Base_x_monotone_curve_2>(&xection);
+          std::get_if<Base_x_monotone_curve_2>(&xection);
         CGAL_assertion(base_xcv != nullptr);
 
         // Attach a merged label to the overlapping curve.
diff --git a/Nef_2/include/CGAL/Nef_2/geninfo.h b/Nef_2/include/CGAL/Nef_2/geninfo.h
index 41fab418e915..eb723de0fcd7 100644
--- a/Nef_2/include/CGAL/Nef_2/geninfo.h
+++ b/Nef_2/include/CGAL/Nef_2/geninfo.h
@@ -17,7 +17,7 @@
 
 #define CGAL_DEPRECATED_HEADER "<CGAL/Nef_2/geninfo.h>"
 #define CGAL_DEPRECATED_MESSAGE_DETAILS \
-  "Something like std::any or boost::variant should be used instead."
+  "Something like std::any or std::variant should be used instead."
 #include <CGAL/Installation/internal/deprecation_warning.h>
 
 #include <CGAL/config.h>
diff --git a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xy_3.h b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xy_3.h
index 7b944428601c..c35cfd303f5f 100644
--- a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xy_3.h
+++ b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xy_3.h
@@ -34,7 +34,7 @@ struct Exact_intersect_xy_2 <R,Cartesian_tag>
   typedef typename R::Point_3     Point_3;
   typedef typename R::Segment_3   Segment_3;
 
-  typedef  boost::variant<Point_3, Segment_3> variant_type;
+  typedef  std::variant<Point_3, Segment_3> variant_type;
 
   std::optional<variant_type>
   operator() (const Segment_3& s3, const Segment_3& t3)
@@ -57,12 +57,12 @@ struct Exact_intersect_xy_2 <R,Cartesian_tag>
       if(! obj){
         return std::nullopt;
       }
-      if (const Point_2* pi =  boost::get<Point_2>(&*obj))
+      if (const Point_2* pi =  std::get_if<Point_2>(&*obj))
       {
         return std::make_optional(variant_type(Point_3(p2.x(),p2.y(),0)));
       }
 
-      const Segment_2* si = boost::get<Segment_2>(&*obj);
+      const Segment_2* si = std::get_if<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
@@ -80,7 +80,7 @@ struct Exact_intersect_xy_2 <R,Homogeneous_tag>
    typedef typename R::Point_3     Point_3;
    typedef typename R::Segment_3   Segment_3;
 
-   typedef  boost::variant<Point_3, Segment_3> variant_type;
+   typedef  std::variant<Point_3, Segment_3> variant_type;
 
    std::optional<variant_type> operator() (Segment_3 s3, Segment_3 t3)
    {  Point_2 p2, q2;
@@ -104,12 +104,12 @@ struct Exact_intersect_xy_2 <R,Homogeneous_tag>
       if(! obj){
         return std::nullopt;
       }
-      if (const Point_2* pi =  boost::get<Point_2>(&*obj))
+      if (const Point_2* pi =  std::get_if<Point_2>(&*obj))
       {
         return std::make_optional(variant_type(Point_3(p2.hx(),p2.hy(),0,p2.hw())));
       }
 
-      const Segment_2* si = boost::get<Segment_2>(&*obj);
+      const Segment_2* si = std::get_if<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
diff --git a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xz_3.h b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xz_3.h
index 773295292490..b68849ee87ed 100644
--- a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xz_3.h
+++ b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_xz_3.h
@@ -33,7 +33,7 @@ struct Exact_intersect_xz_2 <R,Cartesian_tag>
    typedef typename R::Point_3     Point_3;
    typedef typename R::Segment_3   Segment_3;
 
-   typedef  boost::variant<Point_3, Segment_3> variant_type;
+   typedef  std::variant<Point_3, Segment_3> variant_type;
 
    std::optional<variant_type>
    operator() (const Segment_3& s3, const Segment_3& t3)
@@ -56,12 +56,12 @@ struct Exact_intersect_xz_2 <R,Cartesian_tag>
       if(! obj){
         return std::nullopt;
       }
-      if (const Point_2* pi =  boost::get<Point_2>(&*obj))
+      if (const Point_2* pi =  std::get_if<Point_2>(&*obj))
       {
         return std::make_optional(variant_type(Point_3(p2.x(),0,p2.y())));
       }
 
-      const Segment_2* si = boost::get<Segment_2>(&*obj);
+      const Segment_2* si = std::get_if<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
@@ -79,7 +79,7 @@ struct Exact_intersect_xz_2 <R,Homogeneous_tag>
    typedef typename R::Point_3     Point_3;
    typedef typename R::Segment_3   Segment_3;
 
-   typedef  boost::variant<Point_3, Segment_3> variant_type;
+   typedef  std::variant<Point_3, Segment_3> variant_type;
 
    std::optional<variant_type> operator() (Segment_3 s3, Segment_3 t3)
    {  Point_2 p2, q2;
@@ -103,12 +103,12 @@ struct Exact_intersect_xz_2 <R,Homogeneous_tag>
       if(! obj){
         return std::nullopt;
       }
-      if (const Point_2* pi =  boost::get<Point_2>(&*obj))
+      if (const Point_2* pi =  std::get_if<Point_2>(&*obj))
       {
         return std::make_optional(variant_type(Point_3(p2.hx(),0,p2.hy(),p2.hw())));
       }
 
-      const Segment_2* si = boost::get<Segment_2>(&*obj);
+      const Segment_2* si = std::get_if<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
diff --git a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_yz_3.h b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_yz_3.h
index ac2007ce5565..6b396bf9dd92 100644
--- a/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_yz_3.h
+++ b/Nef_3/include/CGAL/Nef_3/Exact_triangulation_euclidean_traits_yz_3.h
@@ -34,7 +34,7 @@ struct Exact_intersect_yz_2 <R,Cartesian_tag>
    typedef typename R::Point_3     Point_3;
    typedef typename R::Segment_3   Segment_3;
 
-   typedef  boost::variant<Point_3, Segment_3> variant_type;
+   typedef  std::variant<Point_3, Segment_3> variant_type;
 
    std::optional<variant_type>
    operator() (const Segment_3& s3, const Segment_3& t3)
@@ -57,12 +57,12 @@ struct Exact_intersect_yz_2 <R,Cartesian_tag>
       if(! obj){
         return std::nullopt;
       }
-      if (const Point_2* pi =  boost::get<Point_2>(&*obj))
+      if (const Point_2* pi =  std::get_if<Point_2>(&*obj))
       {
         return std::make_optional(variant_type(Point_3(0,p2.x(),p2.y())));
       }
 
-      const Segment_2* si = boost::get<Segment_2>(&*obj);
+      const Segment_2* si = std::get_if<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
@@ -80,7 +80,7 @@ struct Exact_intersect_yz_2 <R,Homogeneous_tag>
    typedef typename R::Point_3     Point_3;
    typedef typename R::Segment_3   Segment_3;
 
-   typedef  boost::variant<Point_3, Segment_3> variant_type;
+   typedef  std::variant<Point_3, Segment_3> variant_type;
 
    std::optional<variant_type> operator() (Segment_3 s3, Segment_3 t3)
    {  Point_2 p2, q2;
@@ -104,12 +104,12 @@ struct Exact_intersect_yz_2 <R,Homogeneous_tag>
       if(! obj){
         return std::nullopt;
       }
-      if (const Point_2* pi =  boost::get<Point_2>(&*obj))
+      if (const Point_2* pi =  std::get_if<Point_2>(&*obj))
       {
         return std::make_optional(variant_type(Point_3(0,p2.hx(),p2.hy(),p2.hw())));
       }
 
-      const Segment_2* si = boost::get<Segment_2>(&*obj);
+      const Segment_2* si = std::get_if<Segment_2>(&*obj);
       p2 = si->source();
       q2 = si->target();
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/KernelD_converter.h b/NewKernel_d/include/CGAL/NewKernel_d/KernelD_converter.h
index 09ed5664c46a..d62b8215cc52 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/KernelD_converter.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/KernelD_converter.h
@@ -182,7 +182,7 @@ typename typeset_intersection<typename K1::Object_list, typename K2::Object_list
                 return Object_converter<Possibilities>()(obj,*this);
         }
 
-        //TODO: convert boost::variant
+        //TODO: convert std::variant
 
 };
 
diff --git a/Optimal_transportation_reconstruction_2/include/CGAL/OTR_2/Reconstruction_triangulation_2.h b/Optimal_transportation_reconstruction_2/include/CGAL/OTR_2/Reconstruction_triangulation_2.h
index fecb03e33a19..979ec116b108 100644
--- a/Optimal_transportation_reconstruction_2/include/CGAL/OTR_2/Reconstruction_triangulation_2.h
+++ b/Optimal_transportation_reconstruction_2/include/CGAL/OTR_2/Reconstruction_triangulation_2.h
@@ -793,7 +793,7 @@ class Reconstruction_triangulation_2
     const auto result = intersection(lab, lts);
     if (result)
     {
-      const Point* iq = boost::get<Point>(&(*result));
+      const Point* iq = std::get_if<Point>(&(*result));
       if (iq)
         Dqt = CGAL::approximate_sqrt(geom_traits().compute_squared_distance_2_object()(*iq, pt));
     }
diff --git a/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h b/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
index 4a644675add6..d46e847a2c09 100644
--- a/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
+++ b/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
@@ -980,7 +980,7 @@ dump_dummy_points(const std::string filename) const
   for(; vit!=vend; ++vit)
   {
     Index index = c3t3_.index(vit);
-    const int* i = boost::get<int>(&index);
+    const int* i = std::get_if<int>(&index);
     if(i && *i == 0)
       dummy_out << cp(c3t3_.triangulation().point(vit)) << std::endl;
   }
@@ -994,7 +994,7 @@ try_to_remove_dummy_vertex(const Vertex_handle dummy_vertex) const
 {
   // 'dummy_vertex' must correspond to a dummy point
   CGAL_precondition_code(Index index = c3t3_.index(dummy_vertex);)
-  CGAL_precondition_code(if(const int* i = boost::get<int>(&index)) {)
+  CGAL_precondition_code(if(const int* i = std::get_if<int>(&index)) {)
   CGAL_precondition(*i == 0);
   CGAL_precondition_code(})
 
@@ -1340,7 +1340,7 @@ try_to_solve_close_dummy_point(Vertex_handle& protection_vertex,
 {
   // dummy_vertex must be a dummy point
   CGAL_precondition_code(Index index = c3t3_.index(dummy_vertex);)
-  CGAL_precondition_code(if(const int* i = boost::get<int>(&index)) {)
+  CGAL_precondition_code(if(const int* i = std::get_if<int>(&index)) {)
   CGAL_precondition(*i == 0);
   CGAL_precondition_code(})
 
@@ -1608,7 +1608,7 @@ smart_insert_point(const Bare_point& p, Weight w, int dim, const Index& index,
     Vertex_handle v = ch->vertex(li);
 
     Index existing_vertex_index = c3t3_.index(v);
-    const int* i = boost::get<int>(&existing_vertex_index);
+    const int* i = std::get_if<int>(&existing_vertex_index);
 
     if(i && *i == 0)
     {
@@ -1677,7 +1677,7 @@ smart_insert_point(const Bare_point& p, Weight w, int dim, const Index& index,
             << "at distance: " << sq_d << std::endl;
 
   Index nearest_vh_index = c3t3_.index(nearest_vh);
-  int* i = boost::get<int>(&nearest_vh_index);
+  int* i = std::get_if<int>(&nearest_vh_index);
   if(i && *i == 0)
     std::cerr << "Nearest power vertex is a dummy point" << std::endl;
 #endif
@@ -1745,7 +1745,7 @@ smart_insert_point(const Bare_point& p, Weight w, int dim, const Index& index,
 
 #ifdef CGAL_PERIODIC_PROTECTION_ATTEMPT_TO_REMOVE_DUMMY_PTS
       Index v_index = c3t3_.index(v);
-      const int* id = boost::get<int>(&v_index);
+      const int* id = std::get_if<int>(&v_index);
       bool is_v_dummy_vertex(id && *id == 0);
 #endif
 
@@ -1792,7 +1792,7 @@ smart_insert_point(const Bare_point& p, Weight w, int dim, const Index& index,
               << c3t3_.triangulation().point(nearest_vertex) << ")\n";
 
     Index nearest_vertex_index = c3t3_.index(nearest_vertex);
-    i = boost::get<int>(&nearest_vertex_index);
+    i = std::get_if<int>(&nearest_vertex_index);
     if(i && *i == 0)
       std::cerr << "reduced due to dummy" << std::endl;
 #endif
diff --git a/Periodic_3_mesh_3/include/CGAL/refine_periodic_3_mesh_3.h b/Periodic_3_mesh_3/include/CGAL/refine_periodic_3_mesh_3.h
index 5197b36d7522..0e907a9b3740 100644
--- a/Periodic_3_mesh_3/include/CGAL/refine_periodic_3_mesh_3.h
+++ b/Periodic_3_mesh_3/include/CGAL/refine_periodic_3_mesh_3.h
@@ -69,7 +69,7 @@ void find_points_to_project(C3T3& c3t3, OutputIterator vertices)
       Vertex_handle v = c->vertex((ind+i)&3);
 
       typename C3T3::Index index = c3t3.index(v);
-      if(const int* i = boost::get<int>(&index))
+      if(const int* i = std::get_if<int>(&index))
       {
         if(*i == 0) // '0' is the index of dummies
           *vertices++ = v;
diff --git a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h
index 36cfbb488e98..97fc3e0d06ad 100644
--- a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h
+++ b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h
@@ -77,12 +77,12 @@ namespace Qt {
   using Base::operator <<;
 
   PainterOstream& operator << (Hyperbolic_segment_2 s) {
-    if(const Euclidean_segment_2* seg = boost::get<Euclidean_segment_2>(&s)) {
+    if(const Euclidean_segment_2* seg = std::get_if<Euclidean_segment_2>(&s)) {
     CGAL::Qt::PainterOstream<K>::operator << (*seg);
     return *this;
     }
 
-    Circular_arc_2* arc = boost::get<Circular_arc_2>(&s);
+    Circular_arc_2* arc = std::get_if<Circular_arc_2>(&s);
 
     if(arc->squared_radius() > 100) {
       Euclidean_segment_2 seg(arc->source(), arc->target());
diff --git a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/hyperbolic_free_motion_animation.h b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/hyperbolic_free_motion_animation.h
index 5651f2c614a9..80f9808370b1 100644
--- a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/hyperbolic_free_motion_animation.h
+++ b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/include/internal/hyperbolic_free_motion_animation.h
@@ -28,7 +28,7 @@ MainWindow::initialize_animation_parameters() {
   source = Point(rx1, ry1);
   target = Point(rx2, ry2);
   Segment_2 seg = Construct_hyperbolic_segment_2()(source, target);
-  Circular_arc_2* carc = boost::get<Circular_arc_2>(&seg);
+  Circular_arc_2* carc = std::get_if<Circular_arc_2>(&seg);
 
   source = carc->source();
   target = carc->target();
@@ -118,7 +118,7 @@ Point
 MainWindow::get_image(Point src, Point tgt, double time) {
   //std::cout << "  ..getting image "; std::cout.flush();
   Segment_2 seg = Construct_hyperbolic_segment_2()(src, tgt);
-  Circular_arc_2* carc = boost::get<Circular_arc_2>(&seg);
+  Circular_arc_2* carc = std::get_if<Circular_arc_2>(&seg);
   Circle_2 crc = carc->supporting_circle();
 
   double sx = CGAL::to_double(((src.x()) - crc.center().x())/sqrt(crc.squared_radius()));
@@ -233,7 +233,7 @@ MainWindow::animate() {
     // Correct in case of wrong orientation.
     //std::cout << "  ..making line..." << std::endl;
     Segment_2 seg = Construct_hyperbolic_segment_2()(source, target);
-    Circular_arc_2* carc = boost::get<Circular_arc_2>(&seg);
+    Circular_arc_2* carc = std::get_if<Circular_arc_2>(&seg);
     std::pair<Point,Point> inters = Construct_inexact_intersection_2()(carc->supporting_circle(), poincare);
     if(squared_distance(source, inters.first) < squared_distance(source, inters.second)) {
       source = inters.first;
diff --git a/Periodic_4_hyperbolic_triangulation_2/include/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h b/Periodic_4_hyperbolic_triangulation_2/include/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h
index 8304f78bf989..9c89cc574d08 100644
--- a/Periodic_4_hyperbolic_triangulation_2/include/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/include/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h
@@ -24,7 +24,7 @@
 #include <CGAL/Cartesian.h>
 
 #include <boost/tuple/tuple.hpp>
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <utility>
 
@@ -371,9 +371,9 @@ class Compute_approximate_hyperbolic_diameter
     Hyperbolic_point_2 operator()(const Hyperbolic_segment_2& s1,
                                   const Hyperbolic_segment_2& s2)
     {
-      if(Circular_arc_2* c1 = boost::get<Circular_arc_2>(&s1))
+      if(Circular_arc_2* c1 = std::get_if<Circular_arc_2>(&s1))
       {
-        if(Circular_arc_2* c2 = boost::get<Circular_arc_2>(&s2))
+        if(Circular_arc_2* c2 = std::get_if<Circular_arc_2>(&s2))
         {
           std::pair<Hyperbolic_point_2, Hyperbolic_point_2> res = operator()(c1->circle(),
                                                                              c2->circle());
@@ -387,7 +387,7 @@ class Compute_approximate_hyperbolic_diameter
         }
         else
         {
-          Euclidean_segment_2* ell2 = boost::get<Euclidean_segment_2>(&s2);
+          Euclidean_segment_2* ell2 = std::get_if<Euclidean_segment_2>(&s2);
           std::pair<Hyperbolic_point_2, Hyperbolic_point_2> res = operator()(c1->circle(),
                                                                              ell2->supporting_line());
           Hyperbolic_point_2 p1 = res.first;
@@ -401,8 +401,8 @@ class Compute_approximate_hyperbolic_diameter
       }
       else
       {
-        Euclidean_segment_2* ell1 = boost::get<Euclidean_segment_2>(&s1);
-        if(Circular_arc_2* c2 = boost::get<Circular_arc_2>(&s2))
+        Euclidean_segment_2* ell1 = std::get_if<Euclidean_segment_2>(&s1);
+        if(Circular_arc_2* c2 = std::get_if<Circular_arc_2>(&s2))
         {
           std::pair<Hyperbolic_point_2, Hyperbolic_point_2> res = operator()(ell1->supporting_line(),
                                                                              c2->circle());
@@ -416,7 +416,7 @@ class Compute_approximate_hyperbolic_diameter
         }
         else
         {
-          Euclidean_segment_2* ell2 = boost::get<Euclidean_segment_2>(&s2);
+          Euclidean_segment_2* ell2 = std::get_if<Euclidean_segment_2>(&s2);
           Hyperbolic_point_2 p1 = operator()(ell1->supporting_line(), ell2->supporting_line());
           CGAL_assertion(p1.x()*p1.x() + p1.y()*p1.y()) < FT(1);
           return p1;
@@ -465,9 +465,9 @@ class Compute_approximate_hyperbolic_diameter
       Euclidean_line_2* l;
       Circle_2* c;
 
-      if(Circle_2* c_pq = boost::get<Circle_2>(&bis_pq))
+      if(Circle_2* c_pq = std::get_if<Circle_2>(&bis_pq))
       {
-        if(Circle_2* c_qr = boost::get<Circle_2>(&bis_qr))
+        if(Circle_2* c_qr = std::get_if<Circle_2>(&bis_qr))
         {
           std::pair<Hyperbolic_point_2, Hyperbolic_point_2> inters = _gt.construct_inexact_intersection_2_object()(*c_pq, *c_qr);
 
@@ -477,14 +477,14 @@ class Compute_approximate_hyperbolic_diameter
           return inters.second;
         }
         // here bis_qr is a line
-        l = boost::get<Euclidean_line_2>(&bis_qr);
+        l = std::get_if<Euclidean_line_2>(&bis_qr);
         c = c_pq;
       }
       else
       {
         // here bis_pq is a line
-        l = boost::get<Euclidean_line_2>(&bis_pq);
-        c = boost::get<Circle_2>(&bis_qr);
+        l = std::get_if<Euclidean_line_2>(&bis_pq);
+        c = std::get_if<Circle_2>(&bis_qr);
       }
 
       std::pair<Hyperbolic_point_2, Hyperbolic_point_2> inters = _gt.construct_inexact_intersection_2_object()(*c, *l);
diff --git a/Point_set_processing_3/include/CGAL/structure_point_set.h b/Point_set_processing_3/include/CGAL/structure_point_set.h
index 335ba8226471..59fba116ed9a 100644
--- a/Point_set_processing_3/include/CGAL/structure_point_set.h
+++ b/Point_set_processing_3/include/CGAL/structure_point_set.h
@@ -58,8 +58,8 @@ is a vertex). The implementation follow \cgalCite{cgal:la-srpss-13}.
 \tparam Kernel a model of `EfficientRANSACTraits` that must provide in
 addition a function `Intersect_3 intersection_3_object() const` and a
 functor `Intersect_3` with:
-- `std::optional< boost::variant< Traits::Plane_3, Traits::Line_3 > > operator()(typename Traits::Plane_3, typename Traits::Plane_3)`
-- `std::optional< boost::variant< Traits::Line_3, Traits::Point_3 > > operator()(typename Traits::Line_3, typename Traits::Plane_3)`
+- `std::optional< std::variant< Traits::Plane_3, Traits::Line_3 > > operator()(typename Traits::Plane_3, typename Traits::Plane_3)`
+- `std::optional< std::variant< Traits::Line_3, Traits::Point_3 > > operator()(typename Traits::Line_3, typename Traits::Plane_3)`
 
 */
 template <typename Kernel>
@@ -808,7 +808,7 @@ class Point_set_with_structure
             continue;
           }
 
-        if (const Line* l = boost::get<Line>(&*result))
+        if (const Line* l = std::get_if<Line>(&*result))
           m_edges[i].support = *l;
         else
           {
@@ -1029,7 +1029,7 @@ class Point_set_with_structure
             auto result = CGAL::intersection (plane1, ortho);
             if (result)
               {
-                if (const Line* l = boost::get<Line>(&*result))
+                if (const Line* l = std::get_if<Line>(&*result))
                   {
                     if (!(pts1.empty()))
                       {
@@ -1066,7 +1066,7 @@ class Point_set_with_structure
             result = CGAL::intersection (plane2,ortho);
             if (result)
               {
-                if (const Line* l = boost::get<Line>(&*result))
+                if (const Line* l = std::get_if<Line>(&*result))
                   {
                     if (!(pts2.empty()))
                       {
@@ -1193,12 +1193,12 @@ class Point_set_with_structure
         const auto result = CGAL::intersection(plane1, plane2);
         if (result)
           {
-            if (const Line* l = boost::get<Line>(&*result))
+            if (const Line* l = std::get_if<Line>(&*result))
               {
                 const auto result2 = CGAL::intersection(*l, plane3);
                 if (result2)
                   {
-                    if (const Point* p = boost::get<Point>(&*result2))
+                    if (const Point* p = std::get_if<Point>(&*result2))
                       m_corners[i].support = *p;
                     else
                       {
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
index 468acfaf5b47..9c32aa05b3a5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
@@ -268,7 +268,7 @@ class Intersection_nodes<TriangleMesh, VertexPointMap1, VertexPointMap2, true, f
 
     CGAL_assertion(inter_res != std::nullopt);
     const Exact_kernel::Point_3* pt =
-      boost::get<Exact_kernel::Point_3>(&(*inter_res));
+      std::get_if<Exact_kernel::Point_3>(&(*inter_res));
     CGAL_assertion(pt!=nullptr);
     add_new_node(*pt);
   }
@@ -389,7 +389,7 @@ class Intersection_nodes<TriangleMesh, VertexPointMap1, VertexPointMap2,
 
     CGAL_assertion(inter_res != std::nullopt);
     const Point_3* pt =
-      boost::get<Point_3>(&(*inter_res));
+      std::get_if<Point_3>(&(*inter_res));
     CGAL_assertion(pt!=nullptr);
     add_new_node(*pt);
   }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Axis_parallel_plane_traits.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Axis_parallel_plane_traits.h
index 92c5871d2909..99483e93abce 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Axis_parallel_plane_traits.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Axis_parallel_plane_traits.h
@@ -15,7 +15,7 @@
 #include <CGAL/array.h>
 
 #include <optional>
-#include <boost/variant.hpp>
+#include <variant>
 
 
 #ifndef CGAL_INTERNAL_POLYGON_MESH_SLICER_AXIS_PARALLEL_PLANE_TRAITS_H
@@ -95,7 +95,7 @@ class Axis_parallel_plane_traits
     const typename Traits::Construct_source_3 m_source_3;
     const typename Traits::Construct_target_3 m_target_3;
 
-    typedef boost::variant<typename Traits::Point_3, typename Traits::Segment_3> Variant_type;
+    typedef std::variant<typename Traits::Point_3, typename Traits::Segment_3> Variant_type;
     typedef std::optional< Variant_type > result_type;
 
     Intersect_3(const Axis_parallel_plane_traits<Traits>& traits)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
index 090f0c775e2d..670556ecec4a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
@@ -31,7 +31,7 @@
 
 #include <boost/graph/graph_traits.hpp>
 #include <boost/mpl/if.hpp>
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <array>
 #include <iostream>
@@ -95,7 +95,7 @@ struct Location_traits
 ///
 /// A variant used in the function `get_descriptor_from_location()`.
 template <typename TriangleMesh>
-using descriptor_variant = boost::variant<typename boost::graph_traits<TriangleMesh>::vertex_descriptor,
+using descriptor_variant = std::variant<typename boost::graph_traits<TriangleMesh>::vertex_descriptor,
                                           typename boost::graph_traits<TriangleMesh>::halfedge_descriptor,
                                           typename boost::graph_traits<TriangleMesh>::face_descriptor>;
 
@@ -149,13 +149,13 @@ incident_faces(const std::pair<typename boost::graph_traits<TriangleMesh>::face_
 
   const descriptor_variant<TriangleMesh> dv = get_descriptor_from_location(location, tm);
 
-  if(const vertex_descriptor* vd_ptr = boost::get<vertex_descriptor>(&dv))
+  if(const vertex_descriptor* vd_ptr = std::get_if<vertex_descriptor>(&dv))
   {
     const vertex_descriptor vd = *vd_ptr;
     for(face_descriptor fd : faces_around_target(halfedge(vd, tm), tm))
       *out++ = fd;
   }
-  else if(const halfedge_descriptor* hd_ptr = boost::get<halfedge_descriptor>(&dv))
+  else if(const halfedge_descriptor* hd_ptr = std::get_if<halfedge_descriptor>(&dv))
   {
     const halfedge_descriptor hd = *hd_ptr;
     *out++ = face(hd, tm);
@@ -163,7 +163,7 @@ incident_faces(const std::pair<typename boost::graph_traits<TriangleMesh>::face_
   }
   else
   {
-    const face_descriptor fd = boost::get<face_descriptor>(dv);
+    const face_descriptor fd = std::get<face_descriptor>(dv);
     *out++ = fd;
   }
 
@@ -664,7 +664,7 @@ is_on_vertex(const std::pair<typename boost::graph_traits<TriangleMesh>::face_de
 
   const descriptor_variant<TriangleMesh> dv = get_descriptor_from_location(loc, tm);
 
-  if(const vertex_descriptor* vd_ptr = boost::get<vertex_descriptor>(&dv))
+  if(const vertex_descriptor* vd_ptr = std::get_if<vertex_descriptor>(&dv))
     return (vd == *vd_ptr);
 
   return false;
@@ -709,9 +709,9 @@ is_on_halfedge(const std::pair<typename boost::graph_traits<TriangleMesh>::face_
 
   const descriptor_variant<TriangleMesh> dv = get_descriptor_from_location(loc, tm);
 
-  if(const vertex_descriptor* vd_ptr = boost::get<vertex_descriptor>(&dv))
+  if(const vertex_descriptor* vd_ptr = std::get_if<vertex_descriptor>(&dv))
     return (*vd_ptr == source(hd, tm) || *vd_ptr == target(hd, tm));
-  else if(const halfedge_descriptor* hd_ptr = boost::get<halfedge_descriptor>(&dv))
+  else if(const halfedge_descriptor* hd_ptr = std::get_if<halfedge_descriptor>(&dv))
     return (*hd_ptr == hd);
 
   return false;
@@ -1193,14 +1193,14 @@ locate_in_adjacent_face(const std::pair<typename boost::graph_traits<TriangleMes
   Face_location<TriangleMesh, FT> loc_in_fd = std::make_pair(fd, CGAL::make_array(FT(0), FT(0), FT(0)));
   const descriptor_variant<TriangleMesh> dv = get_descriptor_from_location(loc, tm);
 
-  if(const vertex_descriptor* vd_ptr = boost::get<vertex_descriptor>(&dv))
+  if(const vertex_descriptor* vd_ptr = std::get_if<vertex_descriptor>(&dv))
   {
     int index_of_vd = vertex_index_in_face(*vd_ptr, fd, tm);
     loc_in_fd.second[index_of_vd] = FT(1);
     // Note that the barycentric coordinates were initialized to 0,
     // so the second and third coordinates are already set up properly.
   }
-  else if(const halfedge_descriptor* hd_ptr = boost::get<halfedge_descriptor>(&dv))
+  else if(const halfedge_descriptor* hd_ptr = std::get_if<halfedge_descriptor>(&dv))
   {
     // Note that, here, we know that we are _not_ on a vertex
     const halfedge_descriptor hd = *hd_ptr;
@@ -1225,7 +1225,7 @@ locate_in_adjacent_face(const std::pair<typename boost::graph_traits<TriangleMes
   }
   else
   {
-    CGAL_assertion_code(const face_descriptor fd2 = boost::get<face_descriptor>(dv);)
+    CGAL_assertion_code(const face_descriptor fd2 = std::get<face_descriptor>(dv);)
     CGAL_assertion(fd2 != boost::graph_traits<TriangleMesh>::null_face());
     CGAL_assertion(fd2 != fd);
 
@@ -1264,7 +1264,7 @@ locate_in_common_face(std::pair<typename boost::graph_traits<TriangleMesh>::face
 
   bool is_query_location_in_face = false;
 
-  if(const vertex_descriptor* vd_ptr = boost::get<vertex_descriptor>(&dv))
+  if(const vertex_descriptor* vd_ptr = std::get_if<vertex_descriptor>(&dv))
   {
     const vertex_descriptor vd = *vd_ptr;
     halfedge_descriptor hd = halfedge(vd, tm);
@@ -1284,7 +1284,7 @@ locate_in_common_face(std::pair<typename boost::graph_traits<TriangleMesh>::face
         break;
     }
   }
-  else if(const halfedge_descriptor* hd_ptr = boost::get<halfedge_descriptor>(&dv))
+  else if(const halfedge_descriptor* hd_ptr = std::get_if<halfedge_descriptor>(&dv))
   {
     const halfedge_descriptor hd = *hd_ptr;
     if(!is_border(hd, tm))
@@ -1304,7 +1304,7 @@ locate_in_common_face(std::pair<typename boost::graph_traits<TriangleMesh>::face
   }
   else
   {
-    const face_descriptor fd = boost::get<face_descriptor>(dv);
+    const face_descriptor fd = std::get<face_descriptor>(dv);
     CGAL_precondition(fd != boost::graph_traits<TriangleMesh>::null_face());
 
     query_location = locate_in_face(query, fd, tm, np);
@@ -1866,7 +1866,7 @@ locate_with_AABB_tree(const typename internal::Location_traits<TriangleMesh, Nam
   {
     if(intersections[i])
     {
-      Point_3* intersection_point = boost::get<Point_3>(&(intersections[i]->first));
+      Point_3* intersection_point = std::get_if<Point_3>(&(intersections[i]->first));
 
       if(intersection_point)
       {
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h
index 56733b660fdd..f1b88540a606 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h
@@ -29,7 +29,7 @@
 #include <CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Traversal_traits.h>
 #include <CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Axis_parallel_plane_traits.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <boost/mpl/if.hpp>
 
 #include <CGAL/boost/graph/split_graph_into_polylines.h>
@@ -102,7 +102,7 @@ class Polygon_mesh_slicer
   typedef typename Traits::FT                                                FT;
 
 /// typedefs for internal graph to get connectivity of the polylines
-  typedef boost::variant<vertex_descriptor, edge_descriptor>     AL_vertex_info;
+  typedef std::variant<vertex_descriptor, edge_descriptor>     AL_vertex_info;
   typedef boost::adjacency_list <
                               boost::vecS,
                               boost::vecS,
@@ -181,9 +181,9 @@ class Polygon_mesh_slicer
       AL_vertex_info v1 = al_graph[nodes_for_orient.first];
       AL_vertex_info v2 = al_graph[nodes_for_orient.second];
 
-      if (const vertex_descriptor* vd1_ptr = boost::get<vertex_descriptor>(&v1) )
+      if (const vertex_descriptor* vd1_ptr = std::get_if<vertex_descriptor>(&v1) )
       {
-        if (const vertex_descriptor* vd2_ptr = boost::get<vertex_descriptor>(&v2) )
+        if (const vertex_descriptor* vd2_ptr = std::get_if<vertex_descriptor>(&v2) )
         {
           CGAL_assertion( halfedge(*vd1_ptr, *vd2_ptr, m_tmesh).second );
           halfedge_descriptor h_opp = halfedge(*vd1_ptr, *vd2_ptr, m_tmesh).first;
@@ -207,7 +207,7 @@ class Polygon_mesh_slicer
         else
         {
           // e2 is intersected in its interior
-          edge_descriptor e2 = boost::get<edge_descriptor>(v2);
+          edge_descriptor e2 = std::get<edge_descriptor>(v2);
           halfedge_descriptor h2 = halfedge(e2, m_tmesh);
           if ( target(next(h2, m_tmesh), m_tmesh) != *vd1_ptr )
             h2=opposite(h2, m_tmesh);
@@ -216,9 +216,9 @@ class Polygon_mesh_slicer
       }
       else
       {
-        edge_descriptor e1 = boost::get<edge_descriptor>(v1);
+        edge_descriptor e1 = std::get<edge_descriptor>(v1);
         halfedge_descriptor h1 = halfedge(e1, m_tmesh);
-        if (const vertex_descriptor* vd2_ptr = boost::get<vertex_descriptor>(&v2) )
+        if (const vertex_descriptor* vd2_ptr = std::get_if<vertex_descriptor>(&v2) )
         {
           // e1 is intersected in its interior
           if ( target(next(h1, m_tmesh), m_tmesh) != *vd2_ptr )
@@ -228,7 +228,7 @@ class Polygon_mesh_slicer
         else
         {
           // intersection in the interior of both edges
-          edge_descriptor e2 = boost::get<edge_descriptor>(v2);
+          edge_descriptor e2 = std::get<edge_descriptor>(v2);
           halfedge_descriptor h2 = halfedge(e2, m_tmesh);
           if ( face(h1, m_tmesh) != face(h2,m_tmesh) )
           {
@@ -265,20 +265,20 @@ class Polygon_mesh_slicer
           nodes_for_orient.second=node_id;
 
       AL_vertex_info v = al_graph[node_id];
-      if (const vertex_descriptor* vd_ptr = boost::get<vertex_descriptor>(&v) )
+      if (const vertex_descriptor* vd_ptr = std::get_if<vertex_descriptor>(&v) )
       {
         current_poly.push_back( get(m_vpmap, *vd_ptr) );
       }
       else
       {
-        edge_descriptor ed = boost::get<edge_descriptor>(v);
+        edge_descriptor ed = std::get<edge_descriptor>(v);
         Segment_3 s(
           get(m_vpmap, source(ed, m_tmesh)),
           get(m_vpmap,target(ed, m_tmesh))
         );
         const auto inter = intersect_3(m_plane, s);
         CGAL_assertion(inter != std::nullopt);
-        const Point_3* pt_ptr = boost::get<Point_3>(&(*inter));
+        const Point_3* pt_ptr = std::get_if<Point_3>(&(*inter));
         current_poly.push_back( *pt_ptr );
       }
     }
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
index 17b357660082..93e4b9eded25 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
@@ -209,19 +209,19 @@ void test_constructions(const G& g,
   // ---------------------------------------------------------------------------
   loc = std::make_pair(f, CGAL::make_array(FT(0.3), FT(0.4), FT(0.3)));
   descriptor_variant dv = PMP::get_descriptor_from_location(loc, g);
-  const face_descriptor* fd = boost::get<face_descriptor>(&dv);
+  const face_descriptor* fd = std::get_if<face_descriptor>(&dv);
   assert(fd);
 
   loc = std::make_pair(f, CGAL::make_array(FT(0.5), FT(0.5), FT(0)));
   dv = PMP::get_descriptor_from_location(loc, g);
-  const halfedge_descriptor* hd = boost::get<halfedge_descriptor>(&dv);
+  const halfedge_descriptor* hd = std::get_if<halfedge_descriptor>(&dv);
   assert(hd);
 
   loc = std::make_pair(f, CGAL::make_array(FT(1), FT(0), FT(0)));
   assert(PMP::is_on_vertex(loc, source(halfedge(f, g), g), g));
 
   dv = PMP::get_descriptor_from_location(loc, g);
-  if(const vertex_descriptor* v = boost::get<vertex_descriptor>(&dv)) { } else { assert(false); }
+  if(const vertex_descriptor* v = std::get_if<vertex_descriptor>(&dv)) { } else { assert(false); }
 
   // ---------------------------------------------------------------------------
   // just to check the API
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
index 7a889e4da14d..c83911ea93f1 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
@@ -265,7 +265,7 @@ struct Fake_mesh_domain {
   typedef std::pair<int,int> Surface_patch_index;
   typedef int Curve_index;
   typedef int Corner_index;
-  typedef boost::variant<Subdomain_index,Surface_patch_index> Index;
+  typedef std::variant<Subdomain_index,Surface_patch_index> Index;
 };
 
 typedef Geom_traits Fake_gt;
@@ -417,12 +417,12 @@ struct Update_vertex
     case 2:
     {
       const typename V1::Index& index = v1.index();
-      const Sp_index sp_index = boost::get<Sp_index>(index);
+      const Sp_index sp_index = std::get<Sp_index>(index);
       v2.set_index((std::max)(sp_index.first, sp_index.second));
     }
       break;
     default:// -1, 0, 1, 3
-      v2.set_index(boost::get<int>(v1.index()));
+      v2.set_index(std::get<int>(v1.index()));
     }
     return true;
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
index da298acf6ff7..cb10a9a806a1 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
@@ -231,7 +231,7 @@ public Q_SLOTS:
     IMAGE_MESH_ITEMS,
     IMPLICIT_MESH_ITEMS
   };
-  mutable std::optional<boost::variant<Polyhedral_mesh_items,
+  mutable std::optional<std::variant<Polyhedral_mesh_items,
                                          Image_mesh_items,
                                          Implicit_mesh_items>>
       items;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Surface_intersection_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Surface_intersection_plugin.cpp
index b39fd8b8f0a5..036cdc430261 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Surface_intersection_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Surface_intersection_plugin.cpp
@@ -216,13 +216,13 @@ void Polyhedron_demo_intersection_plugin::intersectionPolylines()
         CGAL::cpp11::result_of<Kernel::Intersect_3(Kernel::Segment_3, Kernel::Segment_3)>::type
             result = CGAL::intersection(segA, segB);
         if (result) {
-          if (const Kernel::Segment_3* s = boost::get<Kernel::Segment_3>(&*result)) {
+          if (const Kernel::Segment_3* s = std::get_if<Kernel::Segment_3>(&*result)) {
             Polyline_3 p;
             p.push_back(s->point(0));
             p.push_back(s->point(1));
             new_pol_item->polylines.push_back(p);
           } else {
-            const Kernel::Point_3* p = boost::get<Kernel::Point_3 >(&*result);
+            const Kernel::Point_3* p = std::get_if<Kernel::Point_3 >(&*result);
             new_point_item->point_set()->insert(*p);
           }
         }
@@ -326,13 +326,13 @@ void Polyhedron_demo_intersection_plugin::intersectionSurfacePolyline()
     CGAL::cpp11::result_of<Kernel::Intersect_3(Kernel::Segment_3, Kernel::Segment_3)>::type
         result = CGAL::intersection(triangle, segment);
     if (result) {
-      if (const Kernel::Segment_3* s = boost::get<Kernel::Segment_3>(&*result)) {
+      if (const Kernel::Segment_3* s = std::get_if<Kernel::Segment_3>(&*result)) {
         Polyline_3 p;
         p.push_back(s->point(0));
         p.push_back(s->point(1));
         new_pol_item->polylines.push_back(p);
       } else {
-        const Kernel::Point_3* p = boost::get<Kernel::Point_3 >(&*result);
+        const Kernel::Point_3* p = std::get_if<Kernel::Point_3 >(&*result);
         new_point_item->point_set()->insert(*p);
       }
     }
diff --git a/Polyhedron/demo/Polyhedron/Scene.h b/Polyhedron/demo/Polyhedron/Scene.h
index b661ed7baa83..af6a0b55f0ec 100644
--- a/Polyhedron/demo/Polyhedron/Scene.h
+++ b/Polyhedron/demo/Polyhedron/Scene.h
@@ -21,7 +21,7 @@
 #include <QDebug>
 #include <iostream>
 #include <cmath>
-#include <boost/variant.hpp>
+#include <variant>
 #include <CGAL/Three/Scene_group_item.h>
 class QEvent;
 class QMouseEvent;
diff --git a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
index 75db7480aaa0..c1b8d2a46193 100644
--- a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
@@ -1214,7 +1214,7 @@ Scene_surface_mesh_item::select(double orig_x,
     {
 
       const EPICK::Point_3* closest_point =
-          boost::get<EPICK::Point_3>(&(closest->first));
+          std::get_if<EPICK::Point_3>(&(closest->first));
       for(Intersections::iterator
           it = boost::next(intersections.begin()),
           end = intersections.end();
@@ -1225,7 +1225,7 @@ Scene_surface_mesh_item::select(double orig_x,
         }
         else {
           const EPICK::Point_3* it_point =
-              boost::get<EPICK::Point_3>(&it->first);
+              std::get_if<EPICK::Point_3>(&it->first);
           if(it_point &&
              (ray_dir * (*it_point - *closest_point)) < 0)
           {
@@ -1923,7 +1923,7 @@ void Scene_surface_mesh_item::zoomToPosition(const QPoint &point, CGAL::Three::V
     if(!intersections.empty()) {
       Intersections::iterator closest = intersections.begin();
       const EPICK::Point_3* closest_point =
-          boost::get<EPICK::Point_3>(&closest->first);
+          std::get_if<EPICK::Point_3>(&closest->first);
       for(Intersections::iterator
           it = boost::next(intersections.begin()),
           end = intersections.end();
@@ -1934,7 +1934,7 @@ void Scene_surface_mesh_item::zoomToPosition(const QPoint &point, CGAL::Three::V
         }
         else {
           const EPICK::Point_3* it_point =
-              boost::get<EPICK::Point_3>(&it->first);
+              std::get_if<EPICK::Point_3>(&it->first);
           if(it_point &&
              (ray_dir * (*it_point - *closest_point)) < 0)
           {
diff --git a/Polyhedron/demo/Polyhedron/include/id_printing.h b/Polyhedron/demo/Polyhedron/include/id_printing.h
index 46d142a24bb0..89276883dc36 100644
--- a/Polyhedron/demo/Polyhedron/include/id_printing.h
+++ b/Polyhedron/demo/Polyhedron/include/id_printing.h
@@ -153,7 +153,7 @@ bool find_primitive_id(const QPoint& point,
     return false;
   typename Intersections::iterator closest = intersections.begin();
   const Point* closest_point =
-      boost::get<Point>(&closest->first);
+      std::get_if<Point>(&closest->first);
   for(typename Intersections::iterator
       it = boost::next(intersections.begin()),
       end = intersections.end();
@@ -164,7 +164,7 @@ bool find_primitive_id(const QPoint& point,
     }
     else {
       const Point* it_point =
-          boost::get<Point>(&it->first);
+          std::get_if<Point>(&it->first);
       if(it_point &&
          (ray_dir * (*it_point - *closest_point)) < 0)
       {
diff --git a/SMDS_3/include/CGAL/IO/output_to_vtu.h b/SMDS_3/include/CGAL/IO/output_to_vtu.h
index e78f1b680a24..37cd018570f8 100644
--- a/SMDS_3/include/CGAL/IO/output_to_vtu.h
+++ b/SMDS_3/include/CGAL/IO/output_to_vtu.h
@@ -20,7 +20,7 @@
 #include <CGAL/IO/io.h>
 #include <CGAL/IO/VTK.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <iostream>
 #include <vector>
@@ -273,7 +273,7 @@ enum VTU_ATTRIBUTE_TYPE{
   SIZE_TYPE
 };
 
-typedef boost::variant<const std::vector<double>*, const std::vector<uint8_t>*, const std::vector<std::size_t>* > Vtu_attributes;
+typedef std::variant<const std::vector<double>*, const std::vector<uint8_t>*, const std::vector<std::size_t>* > Vtu_attributes;
 
 template <class C3T3>
 void output_to_vtu_with_attributes(std::ostream& os,
@@ -316,13 +316,13 @@ void output_to_vtu_with_attributes(std::ostream& os,
   {
     switch(attributes[i].second.which()){
     case 0:
-      write_attribute_tag(os,attributes[i].first, *boost::get<const std::vector<double>* >(attributes[i].second), binary,offset);
+      write_attribute_tag(os,attributes[i].first, *std::get<const std::vector<double>* >(attributes[i].second), binary,offset);
       break;
     case 1:
-      write_attribute_tag(os,attributes[i].first, *boost::get<const std::vector<uint8_t>* >(attributes[i].second), binary,offset);
+      write_attribute_tag(os,attributes[i].first, *std::get<const std::vector<uint8_t>* >(attributes[i].second), binary,offset);
       break;
     default:
-      write_attribute_tag(os,attributes[i].first, *boost::get<const std::vector<std::size_t>* >(attributes[i].second), binary,offset);
+      write_attribute_tag(os,attributes[i].first, *std::get<const std::vector<std::size_t>* >(attributes[i].second), binary,offset);
       break;
     }
   }
@@ -336,13 +336,13 @@ void output_to_vtu_with_attributes(std::ostream& os,
     for(std::size_t i = 0; i< attributes.size(); ++i)
       switch(attributes[i].second.which()){
       case 0:
-        write_attributes(os, *boost::get<const std::vector<double>* >(attributes[i].second));
+        write_attributes(os, *std::get<const std::vector<double>* >(attributes[i].second));
         break;
       case 1:
-        write_attributes(os, *boost::get<const std::vector<uint8_t>* >(attributes[i].second));
+        write_attributes(os, *std::get<const std::vector<uint8_t>* >(attributes[i].second));
         break;
       default:
-        write_attributes(os, *boost::get<const std::vector<std::size_t>* >(attributes[i].second));
+        write_attributes(os, *std::get<const std::vector<std::size_t>* >(attributes[i].second));
         break;
       }
   }
diff --git a/SMDS_3/include/CGAL/SMDS_3/internal/Handle_IO_for_pair_of_int.h b/SMDS_3/include/CGAL/SMDS_3/internal/Handle_IO_for_pair_of_int.h
index cd3c8f135a9d..977909a463d1 100644
--- a/SMDS_3/include/CGAL/SMDS_3/internal/Handle_IO_for_pair_of_int.h
+++ b/SMDS_3/include/CGAL/SMDS_3/internal/Handle_IO_for_pair_of_int.h
@@ -21,7 +21,7 @@
 #include <CGAL/SMDS_3/io_signature.h>
 #include <ostream>
 #include <istream>
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 template <>
@@ -52,19 +52,19 @@ class Output_rep<std::pair<int, int> > : public IO_rep_is_specialized {
 };
 
 template <>
-class Output_rep<boost::variant<int,
+class Output_rep<std::variant<int,
                                 std::pair<int, int> > >
   : public IO_rep_is_specialized
 {
-  typedef boost::variant<int, std::pair<int, int> > Variant;
+  typedef std::variant<int, std::pair<int, int> > Variant;
   const Variant& v;
 public:
   Output_rep(const Variant& v) : v(v) {}
   std::ostream& operator()( std::ostream& out) const {
     if(v.which() == 1) {
-      out << IO::oformat(boost::get<std::pair<int, int> >(v));
+      out << IO::oformat(std::get<std::pair<int, int> >(v));
     } else {
-      out << boost::get<int>(v);
+      out << std::get<int>(v);
     }
     return out;
   }
diff --git a/SMDS_3/include/CGAL/SMDS_3/internal/indices_management.h b/SMDS_3/include/CGAL/SMDS_3/internal/indices_management.h
index 0e4e8901ce57..5ea95241e696 100644
--- a/SMDS_3/include/CGAL/SMDS_3/internal/indices_management.h
+++ b/SMDS_3/include/CGAL/SMDS_3/internal/indices_management.h
@@ -23,7 +23,6 @@
 
 #include <boost/variant/variant.hpp>
 #include <boost/variant/get.hpp>
-#include <boost/variant/apply_visitor.hpp>
 #include <CGAL/STL_Extension/internal/Has_features.h>
 #include <CGAL/IO/io.h>
 
@@ -36,12 +35,12 @@ namespace internal {
 
 // -----------------------------------
 // Index_generator
-// Don't use boost::variant if types are the same type
+// Don't use std::variant if types are the same type
 // -----------------------------------
 template < typename Subdomain_index, typename Surface_patch_index >
 struct Index_generator
 {
-  typedef boost::variant<Subdomain_index,Surface_patch_index> Index;
+  typedef std::variant<Subdomain_index,Surface_patch_index> Index;
   typedef Index                                               type;
 };
 
@@ -72,19 +71,19 @@ struct Indices_tuple_generator<MD, false>
 template <typename MD>
 using Indices_tuple_t = typename Indices_tuple_generator<MD>::type;
 
-// Nasty meta-programming to get a boost::variant of four types that
+// Nasty meta-programming to get a std::variant of four types that
 // may not be all different.
 template <typename T0> struct seq1 {
   typedef T0 type;
 };
 template <typename T0, typename T1> struct seq2 {
-  typedef boost::variant<T0, T1> type;
+  typedef std::variant<T0, T1> type;
 };
 template <typename T0, typename T1, typename T2> struct seq3 {
-  typedef boost::variant<T0, T1, T2> type;
+  typedef std::variant<T0, T1, T2> type;
 };
 template <typename T0, typename T1, typename T2, typename T3> struct seq4 {
-  typedef boost::variant<T0, T1, T2, T3> type;
+  typedef std::variant<T0, T1, T2, T3> type;
 };
 
 template <typename T, typename U> struct insert;
@@ -145,7 +144,7 @@ struct Index_generator_with_features<T, T, T, T>
 template <typename T, typename Boost_variant>
 const T& get_index(const Boost_variant& x,
                    std::enable_if_t<!std::is_same<T, Boost_variant>::value > * = 0)
-{ return boost::get<T>(x); }
+{ return std::get<T>(x); }
 
 template <typename T>
 const T& get_index(const T& x) { return x; }
@@ -305,8 +304,8 @@ struct Variant_read_visitor {
 };
 
 template <typename Indices_types, typename... Args>
-struct Read_write_index<Indices_types, boost::variant<Args...>> {
-  using Index = boost::variant<Args...>;
+struct Read_write_index<Indices_types, std::variant<Args...>> {
+  using Index = std::variant<Args...>;
   using index_seq = std::make_index_sequence<std::tuple_size<Indices_types>::value>;
 
   template <std::size_t... Is>
@@ -317,12 +316,12 @@ struct Read_write_index<Indices_types, boost::variant<Args...>> {
 
   void operator()(std::ostream& os, int, Index index) const {
     Variant_write_visitor visitor{os};
-    apply_visitor(visitor, index);
+    std::visit(visitor, index);
   }
   Index operator()(std::istream& is, int dimension) const {
     Index index = get_index(dimension, index_seq{});
     Variant_read_visitor<Index> visitor{is, index};
-    apply_visitor(visitor, index);
+    std::visit(visitor, index);
     return index;
   }
 };
diff --git a/SMDS_3/include/CGAL/SMDS_3/io_signature.h b/SMDS_3/include/CGAL/SMDS_3/io_signature.h
index ba50d850123c..22022ba6051f 100644
--- a/SMDS_3/include/CGAL/SMDS_3/io_signature.h
+++ b/SMDS_3/include/CGAL/SMDS_3/io_signature.h
@@ -33,7 +33,7 @@
 #include <CGAL/Periodic_3_regular_triangulation_3.h>
 #endif
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <boost/tuple/tuple.hpp>
 #include <utility>
 
@@ -149,10 +149,10 @@ struct Get_io_signature<double>
 };
 
 template <typename T, typename U>
-struct Get_io_signature<boost::variant<T,U> >
+struct Get_io_signature<std::variant<T,U> >
 {
     std::string operator()() {
-      return std::string("boost::variant<") +
+      return std::string("std::variant<") +
         Get_io_signature<T>()() + "," +
         Get_io_signature<U>()() + ">";
   }
@@ -179,10 +179,10 @@ struct Get_io_signature<boost::tuple<T,U> >
 };
 
 template <typename T, typename U, typename V>
-struct Get_io_signature<boost::variant<T,U,V> >
+struct Get_io_signature<std::variant<T,U,V> >
 {
     std::string operator()() {
-      return std::string("boost::variant<") +
+      return std::string("std::variant<") +
         Get_io_signature<T>()() + "," +
         Get_io_signature<U>()() + "," +
         Get_io_signature<V>()() + ">";
@@ -191,10 +191,10 @@ struct Get_io_signature<boost::variant<T,U,V> >
 
 template <typename T, typename U,
           typename V, typename W>
-struct Get_io_signature<boost::variant<T,U,V,W> >
+struct Get_io_signature<std::variant<T,U,V,W> >
 {
     std::string operator()() {
-      return std::string("boost::variant<") +
+      return std::string("std::variant<") +
         Get_io_signature<T>()() + "," +
         Get_io_signature<U>()() + "," +
         Get_io_signature<V>()() + "," +
diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
index 3f1a9c92d428..04b6f19af185 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
@@ -28,7 +28,7 @@
 #include <CGAL/SMDS_3/io_signature.h>
 #include <CGAL/Has_timestamp.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <tuple>
 
 namespace CGAL {
@@ -53,7 +53,7 @@ private :
   using Vertex_handle = typename Vb::Vertex_handle;
 
   // Types
-  using Index = boost::variant<Subdomain_index, Surface_patch_index, Curve_index, Corner_index>;
+  using Index = std::variant<Subdomain_index, Surface_patch_index, Curve_index, Corner_index>;
   using FT = typename GT::FT;
 
   // Constructor
diff --git a/SMDS_3/test/SMDS_3/data/c3t3_io-hetero.cgal b/SMDS_3/test/SMDS_3/data/c3t3_io-hetero.cgal
index f0c10161e35f..e32557d8173d 100644
--- a/SMDS_3/test/SMDS_3/data/c3t3_io-hetero.cgal
+++ b/SMDS_3/test/SMDS_3/data/c3t3_io-hetero.cgal
@@ -1,4 +1,4 @@
-CGAL c3t3 Triangulation_3(Weighted_point<Point_3>,Vb(Tvb_3+i+boost::variant<enum,std::pair<i,i>,i,d>),Cb(enum+RTcb_3+(std::pair<i,i>)[4]))
+CGAL c3t3 Triangulation_3(Weighted_point<Point_3>,Vb(Tvb_3+i+std::variant<enum,std::pair<i,i>,i,d>),Cb(enum+RTcb_3+(std::pair<i,i>)[4]))
 3
 6
 10 11 12 0 0 7
diff --git a/SMDS_3/test/SMDS_3/test_c3t3_io.cpp b/SMDS_3/test/SMDS_3/test_c3t3_io.cpp
index ef8d9e16d7a4..7105303ee34e 100644
--- a/SMDS_3/test/SMDS_3/test_c3t3_io.cpp
+++ b/SMDS_3/test/SMDS_3/test_c3t3_io.cpp
@@ -4,7 +4,7 @@
 #include <CGAL/Mesh_complex_3_in_triangulation_3.h>
 #include <CGAL/IO/File_binary_mesh_3.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 #include <string>
 
@@ -48,7 +48,7 @@ struct MD_heterogeneous_types {
   typedef std::pair<int, int> Surface_patch_index;
   typedef int Curve_index;
   typedef double Corner_index;
-  typedef boost::variant<Subdomain_index,
+  typedef std::variant<Subdomain_index,
                          Surface_patch_index,
                          Curve_index,
                          Corner_index> Index;
@@ -63,7 +63,7 @@ struct MD_heterogeneous_types {
 
   static std::string reference_format_string()
   {
-    return "Triangulation_3(Weighted_point<Point_3>,Vb(Tvb_3+i+boost::variant<enum,std::pair<i,i>,i,d>),Cb(enum+RTcb_3+(std::pair<i,i>)[4]))";
+    return "Triangulation_3(Weighted_point<Point_3>,Vb(Tvb_3+i+std::variant<enum,std::pair<i,i>,i,d>),Cb(enum+RTcb_3+(std::pair<i,i>)[4]))";
   }
 };
 
diff --git a/STL_Extension/doc/STL_Extension/CGAL/Object.h b/STL_Extension/doc/STL_Extension/CGAL/Object.h
index 7a329af795f8..4c8439359962 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/Object.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/Object.h
@@ -110,16 +110,16 @@ Object(const Object &o);
 
 /*!
 Implicit converting constructor for compatibility with
-`boost::variant`.
+`std::variant`.
 */
-Object(boost::variant<T...>);
+Object(std::variant<T...>);
 
 
 /*!
 Implicit converting constructor for compatibility with
-`std::optional` and `boost::variant`.
+`std::optional` and `std::variant`.
  */
-Object(std::optional< boost::variant<T...> >);
+Object(std::optional< std::variant<T...> >);
 
 /// @}
 
diff --git a/STL_Extension/doc/STL_Extension/CGAL/iterator.h b/STL_Extension/doc/STL_Extension/CGAL/iterator.h
index 5e1e1acce56a..2ba1736893dd 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/iterator.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/iterator.h
@@ -106,8 +106,8 @@ The class `Dispatch_or_drop_output_iterator` defines an
 `OutputIterator` that contains a tuple of output iterators, and
 dispatches among those based on the type of the value type which is
 put in it. Besides defining assignment for all parameters of `V`
-and for a tuple of type `V`,  it is also defined for the types `boost::variant<T...>` and
-`std::optional<boost::variant<T...> >`, where `T...`
+and for a tuple of type `V`,  it is also defined for the types `std::variant<T...>` and
+`std::optional<std::variant<T...> >`, where `T...`
 must be a subset of the parameters of `V`. Should the
 `std::optional` be empty, it will be discarded.
 
@@ -194,8 +194,8 @@ dispatches among those based on the type of the value type which is
 put in it. Other types are also accepted, and the object is
 discarded in this case. Besides defining assignment for all
 parameters of `V` and for a tuple of type `V`, it is also defined for the types
-`boost::variant<T...>` and
-`std::optional<boost::variant<T...> >`, where `T...`
+`std::variant<T...>` and
+`std::optional<std::variant<T...> >`, where `T...`
 can be a list of arbitrary types.
 
   It also inherits from `O`, which makes it easy to treat like a
diff --git a/STL_Extension/examples/STL_Extension/Dispatch_output_iterator.cpp b/STL_Extension/examples/STL_Extension/Dispatch_output_iterator.cpp
index 44ff692c7885..89abf64fbcc8 100644
--- a/STL_Extension/examples/STL_Extension/Dispatch_output_iterator.cpp
+++ b/STL_Extension/examples/STL_Extension/Dispatch_output_iterator.cpp
@@ -1,6 +1,6 @@
 #include <vector>
 #include <CGAL/iterator.h>
-#include <boost/variant.hpp>
+#include <variant>
 #include <optional>
 
 int main()
@@ -21,7 +21,7 @@ int main()
     std::back_inserter(b),
     std::back_inserter(c));
 
-  typedef boost::variant<int, double, char> var;
+  typedef std::variant<int, double, char> var;
   var va = 23; var vb = 4.2; var vc = 'x';
 
   // goes to a
diff --git a/STL_Extension/include/CGAL/Object.h b/STL_Extension/include/CGAL/Object.h
index 24d6ecc1b127..7b6bdc37bba2 100644
--- a/STL_Extension/include/CGAL/Object.h
+++ b/STL_Extension/include/CGAL/Object.h
@@ -27,7 +27,7 @@
 #include <iterator>
 #include <typeinfo>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <optional>
 #include <any>
 #include <memory>
@@ -39,7 +39,7 @@ class Object
     std::shared_ptr<std::any> obj;
 
     // returns an any pointer from a variant
-    struct Any_from_variant : public boost::static_visitor<std::any*> {
+    struct Any_from_variant {
       template<typename T>
       std::any* operator()(const T& t) const {
         return new std::any(t);
@@ -64,14 +64,14 @@ class Object
     Object(T && t, private_tag) : obj(new std::any(std::forward<T>(t))) { }
 
     // implicit constructor from optionals containing variants
-    template<BOOST_VARIANT_ENUM_PARAMS(typename T)>
-    Object(const std::optional< boost::variant<BOOST_VARIANT_ENUM_PARAMS(T) > >& t)
-      : obj( t ? boost::apply_visitor(Any_from_variant(), *t) : nullptr) { }
+    template<typename ... T>
+    Object(const std::optional< std::variant<T...> >& t)
+      : obj( t ? std::visit(Any_from_variant(), *t) : nullptr) { }
 
     // implicit constructor from  variants
-    template<BOOST_VARIANT_ENUM_PARAMS(typename T)>
-    Object(const boost::variant<BOOST_VARIANT_ENUM_PARAMS(T) >& v)
-      : obj(boost::apply_visitor(Any_from_variant(), v)) { }
+    template<typename ... T>
+    Object(const std::variant<T...>& v)
+      : obj(std::visit(Any_from_variant(), v)) { }
 
     template <class T>
     bool assign(T &t) const
diff --git a/STL_Extension/include/CGAL/iterator.h b/STL_Extension/include/CGAL/iterator.h
index 4928d3d519fb..95295f89f836 100644
--- a/STL_Extension/include/CGAL/iterator.h
+++ b/STL_Extension/include/CGAL/iterator.h
@@ -27,7 +27,7 @@
 #include <CGAL/tuple.h>
 #include <CGAL/use.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <optional>
 #include <boost/config.hpp>
 
@@ -1262,7 +1262,7 @@ filter_output_iterator(I e, const P& p)
 namespace internal {
 
 template<typename OutputIterator>
-struct Output_visitor : boost::static_visitor<OutputIterator&> {
+struct Output_visitor {
   Output_visitor(OutputIterator* it) : out(it) {}
   OutputIterator* out;
 
@@ -1380,17 +1380,17 @@ class Dispatch_output_iterator < std::tuple<V...>, std::tuple<O...> >
     return *this;
   }
 
-  template<BOOST_VARIANT_ENUM_PARAMS(typename T)>
-  Self& operator=(const boost::variant<BOOST_VARIANT_ENUM_PARAMS(T) >& t) {
+  template<typename ... T>
+  Self& operator=(const std::variant< T ... >& t) {
     internal::Output_visitor<Self> visitor(this);
-    t.apply_visitor(visitor);
+    std::visit(visitor, t);
     return *this;
   }
 
-  template<BOOST_VARIANT_ENUM_PARAMS(typename T)>
-  Self& operator=(const std::optional< boost::variant<BOOST_VARIANT_ENUM_PARAMS(T) > >& t) {
+  template<typename ... T>
+  Self& operator=(const std::optional< std::variant< T ... > >& t) {
     internal::Output_visitor<Self> visitor(this);
-    if(t)  boost::apply_visitor(visitor, *t);
+    if(t)  std::visit(visitor, *t);
     return *this;
   }
 
diff --git a/STL_Extension/test/STL_Extension/test_Object.cpp b/STL_Extension/test/STL_Extension/test_Object.cpp
index 36cacb0f3343..1e65bf5cf97f 100644
--- a/STL_Extension/test/STL_Extension/test_Object.cpp
+++ b/STL_Extension/test/STL_Extension/test_Object.cpp
@@ -3,7 +3,7 @@
 #include <CGAL/Object.h>
 #include <CGAL/assertions.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <optional>
 #include <cassert>
 
@@ -11,7 +11,7 @@ void from_opt_var() {
   int i = 0;
   double j = 0.0;
 
-  std::optional< boost::variant<int, char, double> > v(23);
+  std::optional< std::variant<int, char, double> > v(23);
   CGAL::Object o = v;
   assert(!o.empty());
   assert(CGAL::assign(i, o));
@@ -23,7 +23,7 @@ void from_opt_var() {
   assert(CGAL::assign(j, o));
   assert(j == 2.0);
   //empty optional
-  std::optional< boost::variant<int, char, double> > v2;
+  std::optional< std::variant<int, char, double> > v2;
   CGAL::Object o2 = v2;
   assert(o2.empty());
 }
@@ -31,7 +31,7 @@ void from_opt_var() {
 void from_var() {
   int i = 0;
 
-  boost::variant<int, char, double> v(23);
+  std::variant<int, char, double> v(23);
   CGAL::Object o = v;
   assert(!o.empty());
   assert(CGAL::assign(i, o));
diff --git a/STL_Extension/test/STL_Extension/test_dispatch_output.cpp b/STL_Extension/test/STL_Extension/test_dispatch_output.cpp
index b4340772add8..250fe0a57ca6 100644
--- a/STL_Extension/test/STL_Extension/test_dispatch_output.cpp
+++ b/STL_Extension/test/STL_Extension/test_dispatch_output.cpp
@@ -7,7 +7,7 @@
 #include <CGAL/iterator.h>
 #include <CGAL/use.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <optional>
 
 struct A{};
@@ -91,7 +91,7 @@ void complete_test(std::vector<T1> data1,std::list<T2> data2){
 }
 
 void variant_test() {
-  typedef boost::variant<int, char, double> var;
+  typedef std::variant<int, char, double> var;
   typedef std::optional< var > ovar;
   std::vector<int> a;
   std::vector<double> b;
diff --git a/Shape_regularization/include/CGAL/Shape_regularization/internal/Contour_base_2.h b/Shape_regularization/include/CGAL/Shape_regularization/internal/Contour_base_2.h
index 1f8a5b8aafd5..bbd1a13132ee 100644
--- a/Shape_regularization/include/CGAL/Shape_regularization/internal/Contour_base_2.h
+++ b/Shape_regularization/include/CGAL/Shape_regularization/internal/Contour_base_2.h
@@ -755,10 +755,10 @@ namespace internal {
       typename CGAL::cpp11::result_of<Intersect_2(Line_2, Line_2)>::type result
       = CGAL::intersection(line_1, line_2);
       if (result) {
-        if (const Line_2* line = boost::get<Line_2>(&*result)) {
+        if (const Line_2* line = std::get_if<Line_2>(&*result)) {
           return false;
         } else {
-          const Point_2* point = boost::get<Point_2>(&*result);
+          const Point_2* point = std::get_if<Point_2>(&*result);
           in_point = *point; return true;
         }
       }
diff --git a/Surface_mesh/examples/Surface_mesh/sm_aabbtree.cpp b/Surface_mesh/examples/Surface_mesh/sm_aabbtree.cpp
index 60174dc2fc4d..eba06f7b5780 100644
--- a/Surface_mesh/examples/Surface_mesh/sm_aabbtree.cpp
+++ b/Surface_mesh/examples/Surface_mesh/sm_aabbtree.cpp
@@ -53,8 +53,8 @@ int main()
         tree.any_intersection(segment_query);
     if(intersection){
       // gets intersection object
-      if(boost::get<Point>(&(intersection->first))){
-        Point* p = boost::get<Point>(&(intersection->first));
+      if(std::get_if<Point>(&(intersection->first))){
+        Point* p = std::get_if<Point>(&(intersection->first));
         std::cout << "intersection object is a point " << *p <<  std::endl;
         std::cout << "with face "<< intersection->second  <<  std::endl;
       }
@@ -77,8 +77,8 @@ int main()
     // (generally a segment)
     Plane_intersection plane_intersection = tree.any_intersection(plane_query);
     if(plane_intersection){
-      if(boost::get<Segment>(&(plane_intersection->first))){
-        Segment* s = boost::get<Segment>(&(plane_intersection->first));
+      if(std::get_if<Segment>(&(plane_intersection->first))){
+        Segment* s = std::get_if<Segment>(&(plane_intersection->first));
         std::cout << "one intersection object is the segment " << s << std::endl;
         std::cout << "with face "<< intersection->second  <<  std::endl;
       }
diff --git a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/SDF_calculation.h b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/SDF_calculation.h
index f221ee28c45b..5709694f491f 100644
--- a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/SDF_calculation.h
+++ b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/SDF_calculation.h
@@ -434,7 +434,7 @@ class SDF_calculation
       }
 
       const Point* i_point;
-      if(!(i_point = boost::get<Point>(&object))) {
+      if(!(i_point = std::get_if<Point>(&object))) {
         continue;  // continue in case of segment.
       }
 
@@ -483,7 +483,7 @@ class SDF_calculation
     if(!min_intersection)
       return boost::make_tuple(false, false, 0.0, Primitive_id());
 
-    const Point* i_point = boost::get<Point>( &min_intersection->first );
+    const Point* i_point = std::get_if<Point>( &min_intersection->first );
     if (!i_point) //segment case ignored
       return boost::make_tuple(false, false, 0.0, Primitive_id());
 
diff --git a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
index e44cd401304d..2095e3389432 100644
--- a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
+++ b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
@@ -152,7 +152,7 @@ class SurfaceMeshShortestPathTraits
   /*!
   Function object type.
   Must provide
-  `std::optional< boost::variant< T... > > operator()(A obj1, B obj2)`
+  `std::optional< std::variant< T... > > operator()(A obj1, B obj2)`
   to compute the intersection between `obj1` and `obj2`, where `A` and `B` can be any type amongst
   `Line_2`, `Ray_2`, `Segment_2`.
   */
diff --git a/Surface_mesh_shortest_path/examples/Surface_mesh_shortest_path/shortest_path_sequence.cpp b/Surface_mesh_shortest_path/examples/Surface_mesh_shortest_path/shortest_path_sequence.cpp
index 98340eb00006..857321096b2f 100644
--- a/Surface_mesh_shortest_path/examples/Surface_mesh_shortest_path/shortest_path_sequence.cpp
+++ b/Surface_mesh_shortest_path/examples/Surface_mesh_shortest_path/shortest_path_sequence.cpp
@@ -4,7 +4,7 @@
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Surface_mesh_shortest_path.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <boost/lexical_cast.hpp>
 
 #include <cstdlib>
@@ -26,10 +26,10 @@ typedef Graph_traits::face_descriptor face_descriptor;
 typedef Graph_traits::halfedge_descriptor halfedge_descriptor;
 
 // A model of SurfacemeshShortestPathVisitor storing simplicies
-// using boost::variant
+// using std::variant
 struct Sequence_collector
 {
-  typedef boost::variant< vertex_descriptor,
+  typedef std::variant< vertex_descriptor,
                          std::pair<halfedge_descriptor,double>,
                          std::pair<face_descriptor, Barycentric_coordinates> > Simplex;
   std::vector< Simplex > sequence;
@@ -50,9 +50,8 @@ struct Sequence_collector
   }
 };
 
-// A visitor to print what a variant contains using boost::apply_visitor
+// A visitor to print what a variant contains using std::visit
 struct Print_visitor
-  : public boost::static_visitor<>
 {
   int i;
   Triangle_mesh& g;
@@ -123,7 +122,7 @@ int main(int argc, char** argv)
   // print the sequence using the visitor pattern
   Print_visitor print_visitor(tmesh);
   for (size_t i = 0; i < sequence_collector.sequence.size(); ++i)
-    boost::apply_visitor(print_visitor, sequence_collector.sequence[i]);
+    std::visit(print_visitor, sequence_collector.sequence[i]);
 
   return 0;
 }
diff --git a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h
index 241c96473501..7c16da8876cb 100644
--- a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h
+++ b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h
@@ -1082,7 +1082,7 @@ class Surface_mesh_shortest_path
     {
       const auto cgalIntersection = i2(cl2(segment), cl2(leftBoundary));
 
-      if (!cgalIntersection || !boost::get<Point_2>(&*cgalIntersection))
+      if (!cgalIntersection || !std::get_if<Point_2>(&*cgalIntersection))
       {
         if (m_debugOutput)
         {
@@ -1092,7 +1092,7 @@ class Surface_mesh_shortest_path
       }
       else
       {
-        const Point_2* result = boost::get<Point_2>(&*cgalIntersection);
+        const Point_2* result = std::get_if<Point_2>(&*cgalIntersection);
         FT t0 = pdas2(cs2(segment), ct2(segment), *result);
 
         if (t0 >= FT(1))
@@ -1140,7 +1140,7 @@ class Surface_mesh_shortest_path
     {
       const auto cgalIntersection = i2(cl2(segment), cl2(rightBoundary));
 
-      if (!cgalIntersection || !boost::get<Point_2>(&*cgalIntersection))
+      if (!cgalIntersection || !std::get_if<Point_2>(&*cgalIntersection))
       {
         if (m_debugOutput)
         {
@@ -1150,7 +1150,7 @@ class Surface_mesh_shortest_path
       }
       else
       {
-        const Point_2* result = boost::get<Point_2>(&*cgalIntersection);
+        const Point_2* result = std::get_if<Point_2>(&*cgalIntersection);
         FT t0 = pdas2(cs2(segment), ct2(segment), *result);
 
         if (t0 <= FT(0))
@@ -1778,7 +1778,7 @@ class Surface_mesh_shortest_path
 
           CGAL_assertion(bool(cgalIntersection));
 
-          const Point_2* result = boost::get<Point_2>(&*cgalIntersection);
+          const Point_2* result = std::get_if<Point_2>(&*cgalIntersection);
           if (!result)
             result = &currentSourceImage;
 
@@ -3064,7 +3064,7 @@ class Surface_mesh_shortest_path
     {
       if (intersections[i])
       {
-        Point_3* intersectionPoint = boost::get<Point_3>(&(intersections[i]->first));
+        Point_3* intersectionPoint = std::get_if<Point_3>(&(intersections[i]->first));
 
         if (intersectionPoint)
         {
diff --git a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/function_objects.h b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/function_objects.h
index 19a2ed5105b3..227d20833c46 100644
--- a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/function_objects.h
+++ b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/function_objects.h
@@ -465,7 +465,7 @@ class Compare_relative_intersection_along_segment_2
     CGAL_assertion(bool(intersectResult1));
     if (!intersectResult1) return CGAL::SMALLER;
 
-    const Point_2* p1_ptr = boost::get<Point_2>(&*intersectResult1);
+    const Point_2* p1_ptr = std::get_if<Point_2>(&*intersectResult1);
 
     CGAL_assertion(p1_ptr && "Intersection should have been a point");
     if (!p1_ptr) return CGAL::SMALLER;
@@ -477,7 +477,7 @@ class Compare_relative_intersection_along_segment_2
     CGAL_assertion(bool(intersectResult2));
     if (!intersectResult2) return CGAL::SMALLER;
 
-    const Point_2* p2_ptr = boost::get<Point_2>(&*intersectResult2);
+    const Point_2* p2_ptr = std::get_if<Point_2>(&*intersectResult2);
 
     CGAL_assertion(p2_ptr && "Intersection should have been a point");
     if (!p2_ptr) return CGAL::SMALLER;
diff --git a/Surface_sweep_2/include/CGAL/Surface_sweep_2.h b/Surface_sweep_2/include/CGAL/Surface_sweep_2.h
index 16c2fdedb385..2241424c8e4e 100644
--- a/Surface_sweep_2/include/CGAL/Surface_sweep_2.h
+++ b/Surface_sweep_2/include/CGAL/Surface_sweep_2.h
@@ -102,7 +102,7 @@ class Surface_sweep_2 : public No_intersection_surface_sweep_2<Visitor_> {
   typedef typename Base::Status_line_iterator           Status_line_iterator;
 
   typedef std::pair<Point_2, Multiplicity>              Intersection_point;
-  typedef boost::variant<Intersection_point, X_monotone_curve_2>
+  typedef std::variant<Intersection_point, X_monotone_curve_2>
                                                         Intersection_result;
   typedef std::vector<Intersection_result>              Intersection_vector;
   typedef Random_access_output_iterator<Intersection_vector>
diff --git a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h
index 52f2dde71b16..9eece3004a92 100644
--- a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h
+++ b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_impl.h
@@ -624,7 +624,7 @@ void Surface_sweep_2<Vis>::_intersect(Subcurve* c1, Subcurve* c2,
         intersector(xc, (*sc_it)->last_curve(), vector_inserter(xections));
         CGAL_assertion(xections.size() == 1);
         auto& item = xections.front();
-        xc = *boost::get<X_monotone_curve_2>(&item);
+        xc = *std::get_if<X_monotone_curve_2>(&item);
       }
 
       CGAL_assertion
@@ -667,7 +667,7 @@ void Surface_sweep_2<Vis>::_intersect(Subcurve* c1, Subcurve* c2,
       this->m_traits->is_closed_2_object()(c1->last_curve(), ARR_MIN_END) &&
       this->m_traits->is_closed_2_object()(c2->last_curve(), ARR_MIN_END))
   {
-    if ((boost::get<Intersection_point>(&(*vi)) != nullptr) &&
+    if ((std::get_if<Intersection_point>(&(*vi)) != nullptr) &&
         this->m_traits->equal_2_object()(ctr_min(c1->last_curve()),
                                          ctr_min(c2->last_curve())))
     {
@@ -685,7 +685,7 @@ void Surface_sweep_2<Vis>::_intersect(Subcurve* c1, Subcurve* c2,
     vector_inserter vi_last = vi_end;
 
     --vi_last;
-    if (boost::get<Intersection_point>(&(*vi_last)) != nullptr) {
+    if (std::get_if<Intersection_point>(&(*vi_last)) != nullptr) {
       CGAL_SS_PRINT_TEXT("Skipping common right endpoint...");
       CGAL_SS_PRINT_EOL();
       --vi_end;
@@ -712,7 +712,7 @@ void Surface_sweep_2<Vis>::_intersect(Subcurve* c1, Subcurve* c2,
         vector_inserter vi_last = vi_end;
 
         --vi_last;
-        if (boost::get<Intersection_point>(&(*vi_last)) != nullptr) {
+        if (std::get_if<Intersection_point>(&(*vi_last)) != nullptr) {
           CGAL_SS_PRINT_TEXT("Skipping common right endpoint on boundary...");
           CGAL_SS_PRINT_EOL();
           --vi_end;
@@ -725,7 +725,7 @@ void Surface_sweep_2<Vis>::_intersect(Subcurve* c1, Subcurve* c2,
   // SL: curves are split and no event strictly before the current event should
   //     be reported
   if (vi != vi_end) {
-    const Intersection_point* xp_point = boost::get<Intersection_point>(&(*vi));
+    const Intersection_point* xp_point = std::get_if<Intersection_point>(&(*vi));
     if (xp_point != nullptr) {
       // Skip the intersection point if it is not larger than the current event.
       // To correctly do so, we have to set the ps_x and ps_y for xp_point->first
@@ -744,7 +744,7 @@ void Surface_sweep_2<Vis>::_intersect(Subcurve* c1, Subcurve* c2,
   bool first_i = true;
   for (; vi != vi_end; ++vi) {
     Multiplicity multiplicity = 0;
-    const Intersection_point* xp_point = boost::get<Intersection_point>(&(*vi));
+    const Intersection_point* xp_point = std::get_if<Intersection_point>(&(*vi));
     if (xp_point != nullptr) {
       Point_2 xp = xp_point->first;
       multiplicity = xp_point->second;
@@ -753,7 +753,7 @@ void Surface_sweep_2<Vis>::_intersect(Subcurve* c1, Subcurve* c2,
       _create_intersection_point(xp, multiplicity, c1, c2);
     }
     else {
-      const X_monotone_curve_2 icv = *boost::get<X_monotone_curve_2>(&(*vi));
+      const X_monotone_curve_2 icv = *std::get_if<X_monotone_curve_2>(&(*vi));
       // CGAL_assertion(icv != nullptr);
 
       CGAL_SS_PRINT_TEXT("Found an overlap");
diff --git a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_utils.h b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_utils.h
index d3c785ea8f2c..1fdbd1ab0944 100644
--- a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_utils.h
+++ b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Surface_sweep_2_utils.h
@@ -51,7 +51,7 @@ void make_x_monotone(CurveInputIter begin, CurveInputIter end,
 {
   typedef typename Traits::Point_2                      Point_2;
   typedef typename Traits::X_monotone_curve_2           X_monotone_curve_2;
-  typedef boost::variant<Point_2, X_monotone_curve_2>   Make_x_monotone_result;
+  typedef std::variant<Point_2, X_monotone_curve_2>   Make_x_monotone_result;
 
   // Split the input curves into x-monotone objects.
   std::size_t num_of_curves = std::distance(begin, end);
@@ -63,14 +63,14 @@ void make_x_monotone(CurveInputIter begin, CurveInputIter end,
 
   // Transform each object to either a point or an x-monotone curve.
   for (const auto& obj : object_vec) {
-    const X_monotone_curve_2* xcv = boost::get<X_monotone_curve_2>(&obj);
+    const X_monotone_curve_2* xcv = std::get_if<X_monotone_curve_2>(&obj);
     if (xcv != nullptr) {
       // The object is an x-monotone curve.
       *x_curves++ = *xcv;
       continue;
     }
     // The object is an isolated point.
-    const Point_2* pt = boost::get<Point_2>(&obj);
+    const Point_2* pt = std::get_if<Point_2>(&obj);
     CGAL_assertion(pt != nullptr);
     *iso_points++ = *pt;
   }
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index be81a7809a4a..5cf73bf46517 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -535,7 +535,7 @@ void set_index(typename C3t3::Vertex_handle v, const C3t3& c3t3)
     v->set_index(typename C3t3::Curve_index(1));
     break;
   case 0:
-    v->set_index(boost::get<typename C3t3::Corner_index>(v->index()));
+    v->set_index(std::get<typename C3t3::Corner_index>(v->index()));
     break;
   default:
     CGAL_assertion(false);
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
index 652cb033ab83..e57a8ebb6f40 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
@@ -40,7 +40,7 @@ class ConstrainedTriangulationTraits_2 {
 /*!
 A function object whose `operator()` computes the intersection of two segments.
 
-`std::optional<boost::variant<Point_2,Segment_2> > operator()(Segment_2 s1, Segment_2 s2);`
+`std::optional<std::variant<Point_2,Segment_2> > operator()(Segment_2 s1, Segment_2 s2);`
 Returns the intersection of `s1` and `s2`.
 */
 typedef unspecified_type Intersect_2;
diff --git a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
index 42867cfbb074..692b34199c09 100644
--- a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
@@ -1891,16 +1891,16 @@ compute_intersection(const Gt& gt,
 #ifdef CGAL_CDT_2_DEBUG_INTERSECTIONS
   typedef typename Gt::Segment_2 Segment_2;
   if(result){
-    if (const Segment_2* s = boost::get<Segment_2>(&*result)){
+    if (const Segment_2* s = std::get_if<Segment_2>(&*result)){
       std::cerr << CGAL::internal::cdt_2_indent_level
                 << "compute_intersection: " << *s << '\n';
-    }else if(const Point_2* p = boost::get<Point_2 >(&*result))
+    }else if(const Point_2* p = std::get_if<Point_2 >(&*result))
       std::cerr << CGAL::internal::cdt_2_indent_level
                 << "compute_intersection: " << *p << '\n';
   }
 #endif // CGAL_CDT_2_DEBUG_INTERSECTIONS
   if(result){
-    if(const Point_2* p = boost::get<Point_2 >(&*result)){
+    if(const Point_2* p = std::get_if<Point_2 >(&*result)){
       pi = *p;
       return true;
     }
diff --git a/Visibility_2/examples/Visibility_2/simple_polygon_visibility_2.cpp b/Visibility_2/examples/Visibility_2/simple_polygon_visibility_2.cpp
index be460a836261..9df70f7f868d 100644
--- a/Visibility_2/examples/Visibility_2/simple_polygon_visibility_2.cpp
+++ b/Visibility_2/examples/Visibility_2/simple_polygon_visibility_2.cpp
@@ -38,7 +38,7 @@ int main() {
   CGAL::Arr_naive_point_location<Arrangement_2> pl(env);
   CGAL::Arr_point_location_result<Arrangement_2>::Type obj = pl.locate(q);
   // The query point locates in the interior of a face
-  face = boost::get<Arrangement_2::Face_const_handle> (&obj);
+  face = std::get<Arrangement_2::Face_const_handle> (&obj);
 
   // compute non regularized visibility area
   // Define visibility object type that computes non-regularized visibility area
diff --git a/Visibility_2/include/CGAL/Simple_polygon_visibility_2.h b/Visibility_2/include/CGAL/Simple_polygon_visibility_2.h
index f5cf4d1873dc..384d99acb305 100644
--- a/Visibility_2/include/CGAL/Simple_polygon_visibility_2.h
+++ b/Visibility_2/include/CGAL/Simple_polygon_visibility_2.h
@@ -306,7 +306,7 @@ namespace CGAL {
     Location_result result = point_location.ray_shoot_up(q);
 
     if(const Halfedge_const_handle* e =
-       boost::get<Halfedge_const_handle>(&(result)))
+       std::get_if<Halfedge_const_handle>(&(result)))
       {
         CGAL_assertion((*e)->face() == face);
         Point_2 p(q.x(),
@@ -321,7 +321,7 @@ namespace CGAL {
         return (*e)->next()->ccb();
       }
     else if (const Vertex_const_handle* v =
-             boost::get<Vertex_const_handle>(&(result)))
+             std::get_if<Vertex_const_handle>(&(result)))
       {
         Halfedge_around_vertex_const_circulator cir =
         (*v)->incident_halfedges();
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h
index e0dd1cdc4616..344fed3378c6 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h
@@ -720,7 +720,7 @@ typedef unspecified_type Site_iterator;
 /*!
 The result type of the point location queries.
 */
-typedef boost::variant<Face_handle,Halfedge_handle,Vertex_handle>
+typedef std::variant<Face_handle,Halfedge_handle,Vertex_handle>
 Locate_result;
 
 /// @}
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
index bdd875609361..45693eaf6f98 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
@@ -113,7 +113,7 @@ It must provide the following operator:
 <CENTER>`result_type operator()(Delaunay_graph dg, Point_2 p)`</CENTER>
 
 where the result type `result_type` is
-`boost::variant<Delaunay_vertex_handle,Delaunay_edge,Delaunay_face_handle>`.
+`std::variant<Delaunay_vertex_handle,Delaunay_edge,Delaunay_face_handle>`.
 
 This type is required only if
 `Has_nearest_site_2` is equal to `CGAL::Tag_true`.
diff --git a/Voronoi_diagram_2/examples/Voronoi_diagram_2/vd_2_point_location.cpp b/Voronoi_diagram_2/examples/Voronoi_diagram_2/vd_2_point_location.cpp
index 8451c216bded..967660d2efb3 100644
--- a/Voronoi_diagram_2/examples/Voronoi_diagram_2/vd_2_point_location.cpp
+++ b/Voronoi_diagram_2/examples/Voronoi_diagram_2/vd_2_point_location.cpp
@@ -60,17 +60,17 @@ int main()
               << ") lies on a Voronoi " << std::flush;
 
     Locate_result lr = vd.locate(p);
-    if ( Vertex_handle* v = boost::get<Vertex_handle>(&lr) ) {
+    if ( Vertex_handle* v = std::get_if<Vertex_handle>(&lr) ) {
       std::cout << "vertex." << std::endl;
       std::cout << "The Voronoi vertex is:" << std::endl;
       std::cout << "\t" << (*v)->point() << std::endl;
-    } else if ( Halfedge_handle* e = boost::get<Halfedge_handle>(&lr) ) {
+    } else if ( Halfedge_handle* e = std::get_if<Halfedge_handle>(&lr) ) {
       std::cout << "edge." << std::endl;
       std::cout << "The source and target vertices "
                 << "of the Voronoi edge are:" << std::endl;
       print_endpoint(*e, true);
       print_endpoint(*e, false);
-    } else if ( Face_handle* f = boost::get<Face_handle>(&lr) ) {
+    } else if ( Face_handle* f = std::get_if<Face_handle>(&lr) ) {
       std::cout << "face." << std::endl;
       std::cout << "The vertices of the Voronoi face are"
                 << " (in counterclockwise order):" << std::endl;
diff --git a/Voronoi_diagram_2/examples/Voronoi_diagram_2/vd_2_point_location_sdg_linf.cpp b/Voronoi_diagram_2/examples/Voronoi_diagram_2/vd_2_point_location_sdg_linf.cpp
index 3fa8850e2cc7..59ec3453781b 100644
--- a/Voronoi_diagram_2/examples/Voronoi_diagram_2/vd_2_point_location_sdg_linf.cpp
+++ b/Voronoi_diagram_2/examples/Voronoi_diagram_2/vd_2_point_location_sdg_linf.cpp
@@ -62,17 +62,17 @@ int main()
               << ") lies on a Voronoi " << std::flush;
 
     Locate_result lr = vd.locate(p);
-    if ( Vertex_handle* v = boost::get<Vertex_handle>(&lr) ) {
+    if ( Vertex_handle* v = std::get_if<Vertex_handle>(&lr) ) {
       std::cout << "vertex." << std::endl;
       std::cout << "The Voronoi vertex is:" << std::endl;
       std::cout << "\t" << (*v)->point() << std::endl;
-    } else if ( Halfedge_handle* e = boost::get<Halfedge_handle>(&lr) ) {
+    } else if ( Halfedge_handle* e = std::get_if<Halfedge_handle>(&lr) ) {
       std::cout << "edge." << std::endl;
       std::cout << "The source and target vertices "
                 << "of the Voronoi edge are:" << std::endl;
       print_endpoint(*e, true);
       print_endpoint(*e, false);
-    } else if ( Face_handle* f = boost::get<Face_handle>(&lr) ) {
+    } else if ( Face_handle* f = std::get_if<Face_handle>(&lr) ) {
       std::cout << "face." << std::endl;
       std::cout << "The vertices of the Voronoi face are"
                 << " (in counterclockwise order):" << std::endl;
diff --git a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2.h b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2.h
index 82f0bdc6d678..9d4e37852152 100644
--- a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2.h
+++ b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2.h
@@ -41,7 +41,7 @@
 
 #include <CGAL/Identity_policy_2.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 #include <CGAL/boost/iterator/transform_iterator.hpp>
 
 namespace CGAL {
@@ -268,7 +268,7 @@ class Voronoi_diagram_2
 public:
   typedef typename Adaptation_traits::Point_2             Point_2;
 
-  typedef boost::variant<Face_handle,Halfedge_handle,Vertex_handle>
+  typedef std::variant<Face_handle,Halfedge_handle,Vertex_handle>
   Locate_result;
 
 private:
@@ -634,15 +634,15 @@ class Voronoi_diagram_2
     Query_result ns_qr = nearest_site(dual_, p);
 
     if ( const Delaunay_vertex_handle* dv =
-         boost::get<Delaunay_vertex_handle>(&ns_qr) ) {
+         std::get_if<Delaunay_vertex_handle>(&ns_qr) ) {
       return Face_handle( Face(this, *dv) );
     } else if ( const Delaunay_face_handle *df =
-                boost::get<Delaunay_face_handle>(&ns_qr) ) {
+                std::get_if<Delaunay_face_handle>(&ns_qr) ) {
       Find_valid_vertex vertex_finder;
       Delaunay_face_handle dfvalid = vertex_finder(this, *df);
       return Vertex_handle( Vertex(this, dfvalid) );
     } else if ( const Delaunay_edge* de =
-                boost::get<Delaunay_edge>(&ns_qr) ) {
+                std::get_if<Delaunay_edge>(&ns_qr) ) {
       CGAL_assertion(  !edge_rejector()(dual_, *de)  );
       if ( dual_.dimension() == 1 ) {
         Delaunay_vertex_handle v1 =
diff --git a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Apollonius_graph_nearest_site_2.h b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Apollonius_graph_nearest_site_2.h
index d0f1fbf11a64..6bf63d83fdee 100644
--- a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Apollonius_graph_nearest_site_2.h
+++ b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Apollonius_graph_nearest_site_2.h
@@ -20,7 +20,7 @@
 #include <CGAL/Triangulation_utils_2.h>
 #include <CGAL/Apollonius_graph_2/Orientation_2.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 
@@ -48,7 +48,7 @@ class Apollonius_graph_nearest_site_2
   typedef typename Delaunay_graph::Edge_circulator    Edge_circulator;
 
 public:
-  typedef boost::variant<Vertex_handle,Edge,Face_handle> result_type;
+  typedef std::variant<Vertex_handle,Edge,Face_handle> result_type;
 
   result_type operator()(const Delaunay_graph& dg, const Point_2& p) const {
     CGAL_precondition( dg.dimension() >= 0 );
diff --git a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Delaunay_triangulation_nearest_site_2.h b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Delaunay_triangulation_nearest_site_2.h
index 6014724302f6..f3739a2da68b 100644
--- a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Delaunay_triangulation_nearest_site_2.h
+++ b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Delaunay_triangulation_nearest_site_2.h
@@ -19,7 +19,7 @@
 #include <CGAL/Voronoi_diagram_2/basic.h>
 #include <CGAL/Triangulation_utils_2.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 
@@ -48,7 +48,7 @@ class Delaunay_triangulation_nearest_site_2
   typedef typename Delaunay_graph::Edge_circulator    Edge_circulator;
 
  public:
-  typedef boost::variant<Vertex_handle,Edge,Face_handle>  result_type;
+  typedef std::variant<Vertex_handle,Edge,Face_handle>  result_type;
 
   result_type operator()(const Delaunay_graph& dg, const Point_2& p) const {
     CGAL_precondition( dg.dimension() >= 0 );
diff --git a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Regular_triangulation_nearest_site_2.h b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Regular_triangulation_nearest_site_2.h
index 9b9c88965d92..ebc19ed6e1fc 100644
--- a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Regular_triangulation_nearest_site_2.h
+++ b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Regular_triangulation_nearest_site_2.h
@@ -19,7 +19,7 @@
 #include <CGAL/Voronoi_diagram_2/basic.h>
 #include <CGAL/Triangulation_utils_2.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 
@@ -50,7 +50,7 @@ class Regular_triangulation_nearest_site_2
   typedef typename Geom_traits::Weighted_point_2      Weighted_point_2;
 
  public:
-  typedef boost::variant<Vertex_handle,Edge,Face_handle>  result_type;
+  typedef std::variant<Vertex_handle,Edge,Face_handle>  result_type;
 
   result_type operator()(const Delaunay_graph& dg, const Point_2& p) const {
     CGAL_precondition( dg.dimension() >= 0 );
diff --git a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h
index 8031047d03b0..5d89d1c737a6 100644
--- a/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h
+++ b/Voronoi_diagram_2/include/CGAL/Voronoi_diagram_2/Segment_Delaunay_graph_nearest_site_2.h
@@ -19,7 +19,7 @@
 #include <CGAL/Voronoi_diagram_2/basic.h>
 #include <CGAL/Triangulation_utils_2.h>
 
-#include <boost/variant.hpp>
+#include <variant>
 
 namespace CGAL {
 
@@ -95,7 +95,7 @@ class Segment_Delaunay_graph_nearest_site_2
   }
 
 public:
-  typedef boost::variant<Vertex_handle,Edge,Face_handle>  result_type;
+  typedef std::variant<Vertex_handle,Edge,Face_handle>  result_type;
 
   result_type operator()(const Delaunay_graph& dg, const Point_2& p) const {
     CGAL_precondition( dg.dimension() >= 0 );
diff --git a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_concept.h b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_concept.h
index 9628e9ab45fa..b97617522045 100644
--- a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_concept.h
+++ b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_concept.h
@@ -17,7 +17,7 @@
 #include <cassert>
 #include "helper_functions.h"
 #include <list>
-#include <boost/variant.hpp>
+#include <variant>
 
 
 template<class DG, class AS>
@@ -567,11 +567,11 @@ void test_ns_concept(const DG& dg, const AT& at, CGAL::Tag_true)
 
   result_type qr = ns(dg, p);
 
-  if ( Face_handle* f = boost::get<Face_handle>(&qr) ) {
+  if ( Face_handle* f = std::get_if<Face_handle>(&qr) ) {
     kill_warning(f);
-  } else if ( Edge* e = boost::get<Edge>(&qr) ) {
+  } else if ( Edge* e = std::get_if<Edge>(&qr) ) {
     kill_warning(e);
-  } else if ( Vertex_handle* v = boost::get<Vertex_handle>(&qr) ) {
+  } else if ( Vertex_handle* v = std::get_if<Vertex_handle>(&qr) ) {
     kill_warning(v);
   } else {
     // we should have reached this line
diff --git a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_locate.h b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_locate.h
index 285e03cb62ba..cfcff23df763 100644
--- a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_locate.h
+++ b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_locate.h
@@ -15,7 +15,7 @@
 
 #include <iostream>
 #include <vector>
-#include <boost/variant.hpp>
+#include <variant>
 
 #include "helper_functions.h"
 
@@ -81,13 +81,13 @@ void test_locate_dg(const VDA& vda, const Projector& ,
   for (unsigned int i = 0; i < vecp.size(); ++i) {
     os << vecp[i] << "\t --> \t" << std::flush;
     ns_qr = nearest_site(vda.dual(), vecp[i]);
-    if ( Vertex_handle* v = boost::get<Vertex_handle>(&ns_qr) ) {
+    if ( Vertex_handle* v = std::get_if<Vertex_handle>(&ns_qr) ) {
       os << "FACE";
       kill_warning( v );
-    } else if ( Edge* e = boost::get<Edge>(&ns_qr) ) {
+    } else if ( Edge* e = std::get_if<Edge>(&ns_qr) ) {
       os << "EDGE";
       kill_warning( e );
-    } else if ( Face_handle* f = boost::get<Face_handle>(&ns_qr) ) {
+    } else if ( Face_handle* f = std::get_if<Face_handle>(&ns_qr) ) {
       os << "VERTEX";
       kill_warning( f );
     } else {
@@ -114,7 +114,7 @@ void test_locate_vd(const VDA& vda, const Point_vector& vecp,
   for (unsigned int i = 0; i < vecp.size(); ++i) {
     os << vecp[i] << "\t --> \t" << std::flush;
     lr = vda.locate(vecp[i]);
-    if ( Halfedge_handle* ee = boost::get<Halfedge_handle>(&lr) ) {
+    if ( Halfedge_handle* ee = std::get_if<Halfedge_handle>(&lr) ) {
       Halfedge_handle e = *ee;
       os << "VORONOI EDGE";
       if ( print_sites ) {
@@ -135,7 +135,7 @@ void test_locate_vd(const VDA& vda, const Point_vector& vecp,
         }
       } // if ( print_sites )
       kill_warning( e );
-    } else if ( Vertex_handle* vv = boost::get<Vertex_handle>(&lr) ) {
+    } else if ( Vertex_handle* vv = std::get_if<Vertex_handle>(&lr) ) {
       os << "VORONOI VERTEX";
       Vertex_handle v = *vv;
       if ( print_sites ) {
@@ -145,7 +145,7 @@ void test_locate_vd(const VDA& vda, const Point_vector& vecp,
         }
       }
       kill_warning( v );
-    } else if ( Face_handle* ff = boost::get<Face_handle>(&lr) ) {
+    } else if ( Face_handle* ff = std::get_if<Face_handle>(&lr) ) {
       typename VDA::Face_handle f = *ff;
       kill_warning( f );
       os << "VORONOI FACE";
diff --git a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_vda.h b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_vda.h
index 2b2974ae273c..bb9ea6b426ea 100644
--- a/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_vda.h
+++ b/Voronoi_diagram_2/test/Voronoi_diagram_2/include/vda_test_vda.h
@@ -223,13 +223,13 @@ void test_vdqr_concept(const VDA& vda, const CGAL::Tag_true&)
   Point_2 p(0,0);
   Locate_result lr = vda.locate(p);
 
-  if ( Vertex_handle* vv = boost::get<Vertex_handle>(&lr) ) {
+  if ( Vertex_handle* vv = std::get_if<Vertex_handle>(&lr) ) {
     Vertex_handle v = *vv;
     kill_warning(v);
-  } else if ( Halfedge_handle* ee = boost::get<Halfedge_handle>(&lr) ) {
+  } else if ( Halfedge_handle* ee = std::get_if<Halfedge_handle>(&lr) ) {
     Halfedge_handle e = *ee;
     kill_warning(e);
-  } else if ( Face_handle* ff = boost::get<Face_handle>(&lr) ) {
+  } else if ( Face_handle* ff = std::get_if<Face_handle>(&lr) ) {
     Face_handle f = *ff;
     kill_warning(f);
   }

From 56499e017d1992cb578324b49b4420f2e78e2c02 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 May 2023 18:52:01 +0200
Subject: [PATCH 0363/1398] do not use API that did not go into the standard

---
 .../include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h   | 4 +---
 Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h       | 2 +-
 .../CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h       | 2 +-
 .../test_corefinement_and_constraints.cpp                     | 4 ++--
 .../Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp | 3 +--
 Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.h  | 4 +---
 6 files changed, 7 insertions(+), 12 deletions(-)

diff --git a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h
index af0f793f4eda..f813f8ccc9a5 100644
--- a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h
+++ b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h
@@ -609,9 +609,7 @@ _merge_two_intervals(Edge_const_handle e1, bool is_leftmost1,
   // This is the rightmost vertex in the current minimization diagram (out_d).
   // The intersection points/curves that interest us are the ones in
   // [v_leftmost, v].
-  // Without using make_optional we get a "maybe uninitialized" warning with gcc -Wall
-  std::optional<Vertex_const_handle>  v_leftmost =
-    std::make_optional(false, Vertex_const_handle());
+  std::optional<Vertex_const_handle>  v_leftmost;
 
   if (is_leftmost1 == true) {
     if (is_leftmost2 == false)
diff --git a/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h b/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
index d2f1065785a4..81140cdc66e1 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Protect_edges_sizing_field.h
@@ -1524,7 +1524,7 @@ change_ball_size(const Vertex_handle& v, const FT squared_size, const bool speci
   Bare_point p = cp(c3t3_.triangulation().point(v)); // intentional copy
 
   // Remove v from the set of corners
-  std::optional<Corner_index> corner_index = std::make_optional(false, Corner_index());
+  std::optional<Corner_index> corner_index;
   if ( c3t3_.is_in_complex(v) )
   {
     corner_index = c3t3_.corner_index(v);
diff --git a/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h b/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
index d46e847a2c09..e35eb180ba6b 100644
--- a/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
+++ b/Periodic_3_mesh_3/include/CGAL/Periodic_3_mesh_3/Protect_edges_sizing_field.h
@@ -2479,7 +2479,7 @@ change_ball_size(Vertex_handle& v, const FT squared_size, const bool special_bal
   const Bare_point p = cp(c3t3_.triangulation().point(v)); // intentional copy
 
   // Remove v from the set of corners
-  std::optional<Corner_index> corner_index = std::make_optional(false, Corner_index());
+  std::optional<Corner_index> corner_index;
   if(c3t3_.is_in_complex(v))
   {
     corner_index = c3t3_.corner_index(v);
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
index 3f3af6c44ae1..7642f81f4939 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
@@ -167,8 +167,8 @@ void test_bool_op_no_copy(
   typedef std::optional<Triangle_mesh*> OTM;
   Triangle_mesh *ptr = nullptr;
   const std::array<OTM,4> output =
-    reverse ? CGAL::make_array(OTM(&tm2), OTM(&tm1), std::make_optional(false,ptr), std::make_optional(false,ptr))
-            : CGAL::make_array(OTM(&tm1), OTM(&tm2), std::make_optional(false,ptr), std::make_optional(false,ptr));
+    reverse ? CGAL::make_array(OTM(&tm2), OTM(&tm1), std::optional<Triangle_mesh*>(), std::optional<Triangle_mesh*>())
+            : CGAL::make_array(OTM(&tm1), OTM(&tm2), std::optional<Triangle_mesh*>(), std::optional<Triangle_mesh*>());
   PMP::corefine_and_compute_boolean_operations(tm1,
                                                tm2,
                                                output,
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp
index a25fa8072f02..85238d26ff43 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp
@@ -189,8 +189,7 @@ public Q_SLOTS:
   void on_Sample_random_points_from_bbox() {
 
     // calculate bbox of selected polyhedron items
-    std::optional<CGAL::Three::Scene_interface::Bbox> bbox
-      = std::make_optional(false, CGAL::Three::Scene_interface::Bbox());
+    std::optional<CGAL::Three::Scene_interface::Bbox> bbox;
     // Workaround a bug in g++-4.8.3:
     //   https://stackoverflow.com/a/21755207/1728537
     // Using std::make_optional to copy-initialize 'bbox' hides the
diff --git a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.h b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.h
index 15b6171cf287..a65e7adf764b 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.h
@@ -295,9 +295,7 @@ friend class Polyhedron_demo_selection_plugin;
 
     constVPmap vpm = get(CGAL::vertex_point, *polyhedron());
 
-    std::optional<CGAL::Bbox_3> item_bbox
-      = std::make_optional(false, CGAL::Bbox_3());
-
+    std::optional<CGAL::Bbox_3> item_bbox;
 
     for(Selection_set_vertex::const_iterator v_it = selected_vertices.begin();
         v_it != selected_vertices.end(); ++v_it) {

From edc317d771fb9b4d747c4c3d240c9e246a694edc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 May 2023 10:26:16 +0200
Subject: [PATCH 0364/1398] variant::which() => variant::index() + typos

---
 .../include/CGAL/Arr_circular_line_arc_traits_2.h  |  1 -
 .../CGAL/Arr_point_location/Td_active_trapezoid.h  |  4 ++--
 .../include/CGAL/Arr_point_location/Td_traits.h    | 14 +++++++-------
 .../Trapezoidal_decomposition_2.h                  |  2 ++
 .../CGAL/Hyperbolic_triangulation_face_base_2.h    |  2 +-
 SMDS_3/include/CGAL/IO/output_to_vtu.h             |  4 ++--
 .../SMDS_3/internal/Handle_IO_for_pair_of_int.h    |  2 +-
 7 files changed, 15 insertions(+), 14 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
index 4efc598b81d4..c48fa96917c7 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
@@ -339,7 +339,6 @@ namespace CGAL {
 
      template <class CircularKernel>
     class Variant_Construct_min_vertex_2
-      <const typename CircularKernel::Circular_arc_point_2&>
     {
       typedef typename CircularKernel::Circular_arc_point_2
                                                   Circular_arc_point_2;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
index 44834852a2b4..d8a775c41793 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
@@ -459,12 +459,12 @@ class Td_active_trapezoid : public Handle
 
     Td_map_item item (*this);
 
-    if (ptr()->rb.which() != 0)
+    if (ptr()->rb.index() != 0)
     {
       Self tr(std::get<Self>(rb()));
       tr.set_lb(item);
     }
-    if (ptr()->rt.which() != 0)
+    if (ptr()->rt.index() != 0)
     {
       Self tr(std::get<Self>(rt()));
       tr.set_lt(item);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_traits.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_traits.h
index 59a3dd7f6b6d..391fb2646580 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_traits.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_traits.h
@@ -957,13 +957,13 @@ class Td_traits : public Pm_traits_
   //returns true if the trapezoid is a curve
   bool is_empty_item(const Td_map_item& tr) const
   {
-    return (tr.which() == 0);
+    return (tr.index() == 0);
   }
 
   //returns true if the trapezoid is a point or a curve
   bool is_trapezoid(const Td_map_item& tr) const
   {
-    switch (tr.which())
+    switch (tr.index())
     {
     case TD_ACTIVE_TRAPEZOID:
     case TD_INACTIVE_TRAPEZOID:
@@ -976,7 +976,7 @@ class Td_traits : public Pm_traits_
   //returns true if the map item is a vertex
   bool is_td_vertex(const Td_map_item& tr) const
   {
-    switch (tr.which())
+    switch (tr.index())
     {
     case TD_ACTIVE_VERTEX:
     case TD_ACTIVE_FICTITIOUS_VERTEX:
@@ -991,7 +991,7 @@ class Td_traits : public Pm_traits_
   //returns true if the map item is an edge
   bool is_td_edge(const Td_map_item& tr) const
   {
-    switch (tr.which())
+    switch (tr.index())
     {
     case TD_ACTIVE_EDGE:
     case TD_INACTIVE_EDGE:
@@ -1004,7 +1004,7 @@ class Td_traits : public Pm_traits_
   //returns true if the map item is an edge
   bool is_td_trapezoid(const Td_map_item& tr) const
   {
-    switch (tr.which())
+    switch (tr.index())
     {
     case TD_ACTIVE_TRAPEZOID:
     case TD_INACTIVE_TRAPEZOID:
@@ -1017,7 +1017,7 @@ class Td_traits : public Pm_traits_
   //returns true if the trapezoid is a curve
   bool is_fictitious_vertex(const Td_map_item& tr) const
   {
-    switch (tr.which())
+    switch (tr.index())
     {
     case TD_ACTIVE_FICTITIOUS_VERTEX:
     case TD_INACTIVE_FICTITIOUS_VERTEX:
@@ -1030,7 +1030,7 @@ class Td_traits : public Pm_traits_
   //returns true if the trapezoid is a curve
   bool is_active(const Td_map_item& tr) const
   {
-    switch (tr.which())
+    switch (tr.index())
     {
       case TD_ACTIVE_TRAPEZOID:
       case TD_ACTIVE_EDGE:
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
index be7d7ac72b3c..3888b097bb8b 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
@@ -717,6 +717,7 @@ class Trapezoidal_decomposition_2
   /*! A visitor to set the cw halfedge of a vertex node.
    */
   class set_cw_he_visitor
+  {
   public:
     set_cw_he_visitor(Halfedge_const_handle he) : m_cw_he(he) {}
 
@@ -735,6 +736,7 @@ class Trapezoidal_decomposition_2
   /*! A visitor to reset the cw halfedge of a vertex node.
    */
   class reset_cw_he_visitor
+  {
   public:
     void operator()(Td_active_vertex& t) const { t.reset_cw_he(); }
 
diff --git a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_face_base_2.h b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_face_base_2.h
index 32d730aab7c3..724f45794e65 100644
--- a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_face_base_2.h
+++ b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_triangulation_face_base_2.h
@@ -23,7 +23,7 @@ namespace CGAL {
 
 class Hyperbolic_data
 {
-  typedef boost::int8_t Id;
+  typedef std::int8_t Id;
 
 private:
   // - 2 for infinite face
diff --git a/SMDS_3/include/CGAL/IO/output_to_vtu.h b/SMDS_3/include/CGAL/IO/output_to_vtu.h
index 37cd018570f8..863bba2cebbb 100644
--- a/SMDS_3/include/CGAL/IO/output_to_vtu.h
+++ b/SMDS_3/include/CGAL/IO/output_to_vtu.h
@@ -314,7 +314,7 @@ void output_to_vtu_with_attributes(std::ostream& os,
   os << "    <CellData Scalars=\""<<attributes.front().first<<"\">\n";
   for(std::size_t i = 0; i< attributes.size(); ++i)
   {
-    switch(attributes[i].second.which()){
+    switch(attributes[i].second.index()){
     case 0:
       write_attribute_tag(os,attributes[i].first, *std::get<const std::vector<double>* >(attributes[i].second), binary,offset);
       break;
@@ -334,7 +334,7 @@ void output_to_vtu_with_attributes(std::ostream& os,
     write_c3t3_points(os,tr,V); // fills V if the mode is BINARY
     write_cells(os,c3t3,V);
     for(std::size_t i = 0; i< attributes.size(); ++i)
-      switch(attributes[i].second.which()){
+      switch(attributes[i].second.index()){
       case 0:
         write_attributes(os, *std::get<const std::vector<double>* >(attributes[i].second));
         break;
diff --git a/SMDS_3/include/CGAL/SMDS_3/internal/Handle_IO_for_pair_of_int.h b/SMDS_3/include/CGAL/SMDS_3/internal/Handle_IO_for_pair_of_int.h
index 977909a463d1..87d4e5863d5b 100644
--- a/SMDS_3/include/CGAL/SMDS_3/internal/Handle_IO_for_pair_of_int.h
+++ b/SMDS_3/include/CGAL/SMDS_3/internal/Handle_IO_for_pair_of_int.h
@@ -61,7 +61,7 @@ class Output_rep<std::variant<int,
 public:
   Output_rep(const Variant& v) : v(v) {}
   std::ostream& operator()( std::ostream& out) const {
-    if(v.which() == 1) {
+    if(v.index() == 1) {
       out << IO::oformat(std::get<std::pair<int, int> >(v));
     } else {
       out << std::get<int>(v);

From bbc48b2c7e3479db56b993f55829a5ca44ce1939 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 May 2023 13:03:22 +0200
Subject: [PATCH 0365/1398] more fixes

use Mesh_3::internal::get_index
std::dynamic_point_cast
std::get_if
---
 Mesh_3/include/CGAL/Labeled_mesh_domain_3.h   |  4 +-
 .../Mesh_domain_with_polyline_features_3.h    |  8 +--
 .../include/CGAL/Polyhedral_mesh_domain_3.h   |  2 +-
 .../Plugins/Mesh_3/Mesh_3_plugin.cpp          | 53 +++++++++----------
 .../Point_set_shape_detection_plugin.cpp      |  2 +-
 .../CGAL/SMDS_3/internal/indices_management.h |  6 +--
 .../Efficient_RANSAC/Efficient_RANSAC.h       |  2 +-
 .../test_efficient_RANSAC_cone_parameters.cpp |  2 +-
 ...t_efficient_RANSAC_cylinder_parameters.cpp |  2 +-
 ...test_efficient_RANSAC_plane_parameters.cpp |  2 +-
 ...est_efficient_RANSAC_sphere_parameters.cpp |  2 +-
 ...test_efficient_RANSAC_torus_parameters.cpp |  2 +-
 .../internal/flip_edges.h                     |  6 +--
 .../tetrahedral_adaptive_remeshing_impl.h     |  2 +-
 .../internal/tetrahedral_remeshing_helpers.h  |  2 +-
 15 files changed, 48 insertions(+), 49 deletions(-)

diff --git a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
index 7e7f98b86e57..0455d1711bbe 100644
--- a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
@@ -1259,14 +1259,14 @@ class Labeled_mesh_domain_3
    * where lies a vertex with dimension 2 and index `index`.
    */
   Surface_patch_index surface_patch_index(const Index& index) const
-  { return std::get<Surface_patch_index>(index); }
+  { return Mesh_3::internal::get_index<Surface_patch_index>(index); }
 
   /*
    * Returns the index of the subdomain containing a vertex
    *  with dimension 3 and index `index`.
    */
   Subdomain_index subdomain_index(const Index& index) const
-  { return std::get<Subdomain_index>(index); }
+  { return Mesh_3::internal::get_index<Subdomain_index>(index); }
 
   // -----------------------------------
   // Backward Compatibility
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 47e8fe5d205e..183be5170165 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -772,22 +772,22 @@ class Mesh_domain_with_polyline_features_3
    * where lies a vertex with dimension 2 and index `index`.
    */
   Surface_patch_index surface_patch_index(const Index& index) const
-  { return std::get<Surface_patch_index>(index); }
+  { return Mesh_3::internal::get_index<Surface_patch_index>(index); }
 
   /**
    * Returns the index of the subdomain containing a vertex
    *  with dimension 3 and index `index`.
    */
   Subdomain_index subdomain_index(const Index& index) const
-  { return std::get<Subdomain_index>(index); }
+  { return Mesh_3::internal::get_index<Subdomain_index>(index); }
 
   /// Returns a `Curve_index` from an `Index`
   Curve_index curve_index(const Index& index) const
-  { return std::get<Curve_index>(index); }
+  { return Mesh_3::internal::get_index<Curve_index>(index); }
 
   /// Returns a `Corner_index` from an `Index`
   Corner_index corner_index(const Index& index) const
-  { return std::get<Corner_index>(index); }
+  { return Mesh_3::internal::get_index<Corner_index>(index); }
 
   /// @cond DEVELOPERS
 #ifndef CGAL_NO_DEPRECATED_CODE
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 417c27777a61..723290bbd357 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -607,7 +607,7 @@ class Polyhedral_mesh_domain_3
   AABB_tree_* bounding_tree_;
 
   // cache queries and intersected primitive
-  typedef typename std::variant<Segment_3, Ray_3, Line_3>::type Cached_query;
+  typedef std::variant<Segment_3, Ray_3, Line_3> Cached_query;
   struct Query_cache
   {
     Query_cache() : has_cache(false) {}
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
index cb10a9a806a1..a51be995cc11 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
@@ -279,7 +279,6 @@ void Mesh_3_plugin::mesh_3_volume()
 
 std::optional<QString> Mesh_3_plugin::get_items_or_return_error_string() const
 {
-  using boost::get;
   items = {};
   features_protection_available = false;
   item = nullptr;
@@ -322,7 +321,7 @@ std::optional<QString> Mesh_3_plugin::get_items_or_return_error_string() const
       {
         if (!items)
           continue;
-        auto poly_items_ptr = get<Polyhedral_mesh_items>(&*items);
+        auto poly_items_ptr = std::get_if<Polyhedral_mesh_items>(&items.value());
         if(poly_items_ptr) {
           if (poly_items_ptr->polylines_item) {
             return tr("Only one polyline item is accepted");
@@ -331,7 +330,7 @@ std::optional<QString> Mesh_3_plugin::get_items_or_return_error_string() const
           }
         }
         else {
-          if(auto image_items_ptr = get<Image_mesh_items>(&*items))
+          if(auto image_items_ptr = std::get_if<Image_mesh_items>(&items.value()))
           {
             if (image_items_ptr->polylines_item) {
               return tr("Only one polyline item is accepted");
@@ -357,8 +356,8 @@ std::optional<QString> Mesh_3_plugin::get_items_or_return_error_string() const
   //because of selection order
   if (polylines_item != nullptr && items != std::nullopt)
   {
-    auto poly_items_ptr = get<Polyhedral_mesh_items>(&*items);
-    auto image_items_ptr = get<Image_mesh_items>(&*items);
+    auto poly_items_ptr = std::get_if<Polyhedral_mesh_items>(&items.value());
+    auto image_items_ptr = std::get_if<Image_mesh_items>(&items.value());
     if(poly_items_ptr && poly_items_ptr == nullptr)
       poly_items_ptr->polylines_item = polylines_item;
     else if(image_items_ptr && image_items_ptr == nullptr)
@@ -368,7 +367,7 @@ std::optional<QString> Mesh_3_plugin::get_items_or_return_error_string() const
   if (!items) { return tr("Selected objects can't be meshed"); }
   item = nullptr;
   features_protection_available = false;
-  if (auto poly_items = get<Polyhedral_mesh_items>(&*items)) {
+  if (auto poly_items = std::get_if<Polyhedral_mesh_items>(&items.value())) {
     auto& sm_items = poly_items->sm_items;
     if(sm_items.empty()) {
       return tr("ERROR: there must be at least one surface mesh item.");
@@ -389,12 +388,12 @@ std::optional<QString> Mesh_3_plugin::get_items_or_return_error_string() const
     features_protection_available = true;
   }
 #  ifdef CGAL_MESH_3_DEMO_ACTIVATE_IMPLICIT_FUNCTIONS
-  else if (auto implicit_mesh_items = get<Implicit_mesh_items>(&*items)) {
+  else if (auto implicit_mesh_items = std::get_if<Implicit_mesh_items>(&items.value())) {
     item = implicit_mesh_items->function_item;
   }
 #  endif
 #  ifdef CGAL_MESH_3_DEMO_ACTIVATE_SEGMENTED_IMAGES
-  else if (auto image_mesh_items = get<Image_mesh_items>(&*items)) {
+  else if (auto image_mesh_items = std::get_if<Image_mesh_items>(&items.value())) {
     auto& image_item = image_mesh_items->image_item;
     item = image_item;
     features_protection_available = true;
@@ -403,7 +402,7 @@ std::optional<QString> Mesh_3_plugin::get_items_or_return_error_string() const
 
   if(item) {
     bbox = item->bbox();
-    if (auto poly_items = get<Polyhedral_mesh_items>(&*items)) {
+    if (auto poly_items = std::get_if<Polyhedral_mesh_items>(&items.value())) {
       for (auto it : poly_items->sm_items) {
         bbox = bbox + it->bbox();
       }
@@ -435,28 +434,28 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
     QMessageBox::warning(mw, tr("Mesh_3 plugin"), *error_string);
     return;
   }
-  using boost::get;
+
   const bool more_than_one_item =
-      get<Polyhedral_mesh_items>(&*items) &&
-      (get<Polyhedral_mesh_items>(&*items)->sm_items.size() > 1);
+      std::get_if<Polyhedral_mesh_items>(&items.value()) &&
+      (std::get_if<Polyhedral_mesh_items>(&items.value())->sm_items.size() > 1);
 
   Scene_image_item* image_item =
-      get<Image_mesh_items>(&*items)
-          ? get<Image_mesh_items>(&*items)->image_item.get()
+      std::get_if<Image_mesh_items>(&items.value())
+          ? std::get_if<Image_mesh_items>(&items.value())->image_item.get()
           : nullptr;
   Scene_surface_mesh_item* bounding_sm_item =
-      get<Polyhedral_mesh_items>(&*items)
-          ? get<Polyhedral_mesh_items>(&*items)->bounding_sm_item
+      std::get_if<Polyhedral_mesh_items>(&items.value())
+          ? std::get_if<Polyhedral_mesh_items>(&items.value())->bounding_sm_item
           : nullptr;
   Scene_polylines_item* polylines_item =
-      get<Polyhedral_mesh_items>(&*items)
-          ? get<Polyhedral_mesh_items>(&*items)->polylines_item
+      std::get_if<Polyhedral_mesh_items>(&items.value())
+          ? std::get_if<Polyhedral_mesh_items>(&items.value())->polylines_item
           : nullptr;
-  if (polylines_item == nullptr && get<Image_mesh_items>(&*items) != nullptr)
-    polylines_item = get<Image_mesh_items>(&*items)->polylines_item;
+  if (polylines_item == nullptr && std::get_if<Image_mesh_items>(&items.value()) != nullptr)
+    polylines_item = std::get_if<Image_mesh_items>(&items.value())->polylines_item;
   Scene_implicit_function_item* function_item =
-      get<Implicit_mesh_items>(&*items)
-          ? get<Implicit_mesh_items>(&*items)->function_item.get()
+      std::get_if<Implicit_mesh_items>(&items.value())
+          ? std::get_if<Implicit_mesh_items>(&items.value())->function_item.get()
           : nullptr;
   // -----------------------------------
   // Create Mesh dialog
@@ -576,13 +575,13 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
   ui.initializationGroup->setVisible(input_is_labeled_img);
   ui.grayImgGroup->setVisible(input_is_gray_img);
 
-  if (items->which() == POLYHEDRAL_MESH_ITEMS)
+  if (items->index() == POLYHEDRAL_MESH_ITEMS)
     ui.volumeGroup->setVisible(mesh_type == Mesh_type::VOLUME &&
                                nullptr != bounding_sm_item);
   else
     ui.volumeGroup->setVisible(mesh_type == Mesh_type::VOLUME);
   ui.sharpEdgesAngle->setValue(sharp_edges_angle_bound);
-  if (items->which() != POLYHEDRAL_MESH_ITEMS || polylines_item != nullptr) {
+  if (items->index() != POLYHEDRAL_MESH_ITEMS || polylines_item != nullptr) {
     ui.sharpEdgesAngleLabel->setVisible(false);
     ui.sharpEdgesAngle->setVisible(false);
 
@@ -604,13 +603,13 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
   const QString on_cube("Polylines on cube");
   const QString triple_lines("Triple+ lines");
   if (features_protection_available) {
-    if (items->which() == POLYHEDRAL_MESH_ITEMS) {
+    if (items->index() == POLYHEDRAL_MESH_ITEMS) {
       if (mesh_type == Mesh_type::SURFACE_ONLY) {
         ui.protectEdges->addItem(sharp_and_boundary);
         ui.protectEdges->addItem(boundary_only);
       } else
         ui.protectEdges->addItem(sharp_edges);
-    } else if (items->which() == IMAGE_MESH_ITEMS) {
+    } else if (items->index() == IMAGE_MESH_ITEMS) {
       if (polylines_item != nullptr) {
         ui.protectEdges->addItem(QString(input_polylines).append(" only"));
         ui.protectEdges->addItem(QString(on_cube).append(" and input polylines"));
@@ -688,7 +687,7 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
                      : false;
 
   Meshing_thread* thread = nullptr;
-  switch (items->which()) {
+  switch (items->index()) {
   case POLYHEDRAL_MESH_ITEMS: {
     auto& poly_items = get<Polyhedral_mesh_items>(*items);
     auto& sm_items = poly_items.sm_items;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
index b8117997037c..8a46fc95c379 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
@@ -732,7 +732,7 @@ class Polyhedron_demo_point_set_shape_detection_plugin :
           ss << item->name().toStdString() << "_plane_";
 
           std::shared_ptr<CGAL::Shape_detection::Plane<Traits> > pshape
-            = boost::dynamic_pointer_cast<CGAL::Shape_detection::Plane<Traits> > (shape);
+            = std::dynamic_pointer_cast<CGAL::Shape_detection::Plane<Traits> > (shape);
 
           Kernel::Point_3 ref = CGAL::ORIGIN + pshape->plane_normal ();
 
diff --git a/SMDS_3/include/CGAL/SMDS_3/internal/indices_management.h b/SMDS_3/include/CGAL/SMDS_3/internal/indices_management.h
index 5ea95241e696..18d5e4b6cc83 100644
--- a/SMDS_3/include/CGAL/SMDS_3/internal/indices_management.h
+++ b/SMDS_3/include/CGAL/SMDS_3/internal/indices_management.h
@@ -141,9 +141,9 @@ struct Index_generator_with_features<T, T, T, T>
   typedef Index                                         type;
 };
 
-template <typename T, typename Boost_variant>
-const T& get_index(const Boost_variant& x,
-                   std::enable_if_t<!std::is_same<T, Boost_variant>::value > * = 0)
+template <typename T, typename Variant>
+const T& get_index(const Variant& x,
+                   std::enable_if_t<!std::is_same<T, Variant>::value > * = 0)
 { return std::get<T>(x); }
 
 template <typename T>
diff --git a/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC.h b/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC.h
index 3612ac02c705..88089e89e01a 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC.h
@@ -895,7 +895,7 @@ class Efficient_RANSAC {
 
     for (std::size_t i = 0; i < m_extracted_shapes->size(); ++i) {
       std::shared_ptr<Plane_shape> pshape
-              = boost::dynamic_pointer_cast<Plane_shape>((*m_extracted_shapes)[i]);
+              = std::dynamic_pointer_cast<Plane_shape>((*m_extracted_shapes)[i]);
 
       // Ignore all shapes other than plane
       if (pshape != std::shared_ptr<Plane_shape>())
diff --git a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cone_parameters.cpp b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cone_parameters.cpp
index e907bbbfe0be..5d995f6faa38 100644
--- a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cone_parameters.cpp
+++ b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cone_parameters.cpp
@@ -74,7 +74,7 @@ bool test_cone_parameters() {
     if (shapes.size() != 1)
       continue;
 
-    std::shared_ptr<Cone> cone = boost::dynamic_pointer_cast<Cone>((*shapes.first));
+    std::shared_ptr<Cone> cone = std::dynamic_pointer_cast<Cone>((*shapes.first));
 
     // Check: shape detected is a cone.
     if (!cone)
diff --git a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cylinder_parameters.cpp b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cylinder_parameters.cpp
index 4d05c98d0681..8c3780e0368d 100644
--- a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cylinder_parameters.cpp
+++ b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_cylinder_parameters.cpp
@@ -73,7 +73,7 @@ bool test_cylinder_parameters() {
     if (shapes.size() != 1)
       continue;
 
-    std::shared_ptr<Cylinder> cyl = boost::dynamic_pointer_cast<Cylinder>((*shapes.first));
+    std::shared_ptr<Cylinder> cyl = std::dynamic_pointer_cast<Cylinder>((*shapes.first));
 
     // Check: shape detected is a cylinder.
     if (!cyl)
diff --git a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_plane_parameters.cpp b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_plane_parameters.cpp
index e47a2f472161..f0a8e772baa1 100644
--- a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_plane_parameters.cpp
+++ b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_plane_parameters.cpp
@@ -67,7 +67,7 @@ bool test_plane_parameters() {
     if (shapes.size() != 1)
       continue;
 
-    std::shared_ptr<Plane> pl = boost::dynamic_pointer_cast<Plane>((*shapes.first));
+    std::shared_ptr<Plane> pl = std::dynamic_pointer_cast<Plane>((*shapes.first));
 
     if (!pl)
       continue;
diff --git a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_sphere_parameters.cpp b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_sphere_parameters.cpp
index c6dcb0e0999a..88f78d5326a9 100644
--- a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_sphere_parameters.cpp
+++ b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_sphere_parameters.cpp
@@ -70,7 +70,7 @@ bool test_sphere_parameters() {
     if (shapes.size() != 1)
       continue;
 
-    std::shared_ptr<Sphere> sphere = boost::dynamic_pointer_cast<Sphere>((*shapes.first));
+    std::shared_ptr<Sphere> sphere = std::dynamic_pointer_cast<Sphere>((*shapes.first));
 
     // Check: shape detected is a cylinder.
     if (!sphere)
diff --git a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_torus_parameters.cpp b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_torus_parameters.cpp
index c380d26c7f95..3d39f70b4735 100644
--- a/Shape_detection/test/Shape_detection/test_efficient_RANSAC_torus_parameters.cpp
+++ b/Shape_detection/test/Shape_detection/test_efficient_RANSAC_torus_parameters.cpp
@@ -73,7 +73,7 @@ bool test_torus_parameters() {
       continue;
 
     std::shared_ptr<Torus> torus =
-      boost::dynamic_pointer_cast<Torus>((*shapes.first));
+      std::dynamic_pointer_cast<Torus>((*shapes.first));
 
     // Check: shape detected is a torus.
     if (!torus)
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 17b2c7edd358..798284fa04ea 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -620,7 +620,7 @@ void find_best_flip_to_improve_dh(C3t3& c3t3,
                                       indices(facet_circulator->second, i));
         if (curr_vertex != vh0  && curr_vertex != vh1)
         {
-          if (is_edge_uv(vh, curr_vertex, boost::get(o_inc_vh)))
+          if (is_edge_uv(vh, curr_vertex, o_inc_vh.value()))
           {
             is_edge = true;
             break;
@@ -778,7 +778,7 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
                                     indices(facet_circulator->second, i));
       if (curr_vertex != vh0  && curr_vertex != vh1)
       {
-        if (is_edge_uv(vh, curr_vertex, boost::get(o_inc_vh)))
+        if (is_edge_uv(vh, curr_vertex, o_inc_vh.value()))
           return NOT_FLIPPABLE;
       }
     }
@@ -1202,7 +1202,7 @@ std::size_t flip_all_edges(const std::vector<VertexPair>& edges,
 
     Cell_handle ch;
     int i0, i1;
-    if (is_edge_uv(vp.first, vp.second, boost::get(o_inc_vh), ch, i0, i1))
+    if (is_edge_uv(vp.first, vp.second, o_inc_vh.value(), ch, i0, i1))
     {
       Edge edge(ch, i0, i1);
 
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
index b9147708c012..d06a9c52a977 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
@@ -346,7 +346,7 @@ class Adaptive_remesher
         if(f_on_surface[i])
           m_c3t3.remove_from_complex(c, i);
         else
-          m_c3t3.add_to_complex(c, i, patch.get());
+          m_c3t3.add_to_complex(c, i, patch.value());
       }
 
       m_c3t3.remove_from_complex(c);
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 5cf73bf46517..07848cbe492f 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -535,7 +535,7 @@ void set_index(typename C3t3::Vertex_handle v, const C3t3& c3t3)
     v->set_index(typename C3t3::Curve_index(1));
     break;
   case 0:
-    v->set_index(std::get<typename C3t3::Corner_index>(v->index()));
+    v->set_index(Mesh_3::internal::get_index<typename C3t3::Corner_index>(v->index()));
     break;
   default:
     CGAL_assertion(false);

From bdfa15c08f020308eb2899c30e212c9eb72fc6c6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 13 Jun 2023 18:28:11 +0200
Subject: [PATCH 0366/1398] fixes after merge

---
 .../test/Intersections_3/intersection_test_helper.h       | 4 +---
 Intersections_3/test/Intersections_3/issue_5428.cpp       | 2 +-
 Mesh_3/include/CGAL/Labeled_mesh_domain_3.h               | 2 +-
 Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h               | 2 +-
 Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h              | 4 ++--
 .../CGAL/constructions/Straight_skeleton_cons_ftC2.h      | 8 ++++----
 6 files changed, 10 insertions(+), 12 deletions(-)

diff --git a/Intersections_3/test/Intersections_3/intersection_test_helper.h b/Intersections_3/test/Intersections_3/intersection_test_helper.h
index 2e9806ad03b6..167e18661fc4 100644
--- a/Intersections_3/test/Intersections_3/intersection_test_helper.h
+++ b/Intersections_3/test/Intersections_3/intersection_test_helper.h
@@ -309,10 +309,8 @@ struct Intersection_3_tester
     template<typename T>
     bool compare_to_other_variant(const T& t) const
     {
-      if(ov->type() == typeid(T))
+      if(auto* r = std::get_if<T>(&*ov))
       {
-        auto* r = std::get_if<T>(&*ov); // ov is an optional<variant>
-        assert(r);
         return (t == *r);
       }
 
diff --git a/Intersections_3/test/Intersections_3/issue_5428.cpp b/Intersections_3/test/Intersections_3/issue_5428.cpp
index ba39e1bd1096..ba905ed12c5b 100644
--- a/Intersections_3/test/Intersections_3/issue_5428.cpp
+++ b/Intersections_3/test/Intersections_3/issue_5428.cpp
@@ -15,7 +15,7 @@ int main(int, char**)
 
   auto result = intersection(cub, pl);
 
-  const std::vector<Point>* res = boost::get <std::vector<Point> >(&*result);
+  const std::vector<Point>* res = std::get_if <std::vector<Point> >(&*result);
   for(const Point& p : *res)
     std::cout << p << std::endl;
 
diff --git a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
index 49584ff06a7a..8e51389c173c 100644
--- a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
@@ -1148,7 +1148,7 @@ class Labeled_mesh_domain_3
     Intersection operator()(const Segment_3& s) const
     {
 #ifndef CGAL_MESH_3_NO_LONGER_CALLS_DO_INTERSECT_3
-      CGAL_precondition(r_domain_.do_intersect_surface_object()(s) != boost::none);
+      CGAL_precondition(r_domain_.do_intersect_surface_object()(s) != std::nullopt);
 #endif // NOT CGAL_MESH_3_NO_LONGER_CALLS_DO_INTERSECT_3
       return this->operator()(s.source(),s.target());
     }
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
index 309e39ae64f5..60abbe5d0bef 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
@@ -751,7 +751,7 @@ Refine_cells_3<Tr,Cr,MD,C3T3_,P_,Ct,C_>::
 number_of_bad_elements_impl()
 {
   typedef typename MD::Subdomain_index        Subdomain_index;
-  typedef boost::optional<Subdomain_index>    Subdomain;
+  typedef std::optional<Subdomain_index>    Subdomain;
   typedef typename Tr::Finite_cells_iterator  Finite_cell_iterator;
 
   int count = 0;
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
index 9802c09dd60a..5d242c1a604b 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
@@ -1053,7 +1053,7 @@ Refine_facets_3<Tr,Cr,MD,C3T3_,P_,Ct,B_,C_>::
 number_of_bad_elements_impl()
 {
   typedef typename MD::Subdomain_index        Subdomain_index;
-  typedef boost::optional<Subdomain_index>    Subdomain;
+  typedef std::optional<Subdomain_index>    Subdomain;
   typedef typename Tr::Finite_facets_iterator Finite_facet_iterator;
 
   int count = 0, count_num_bad_surface_facets = 0;
@@ -1735,7 +1735,7 @@ is_facet_encroached(const Facet& facet,
                     const Weighted_point& point) const
 {
   typedef typename MD::Subdomain_index        Subdomain_index;
-  typedef boost::optional<Subdomain_index>    Subdomain;
+  typedef std::optional<Subdomain_index>    Subdomain;
 
   if ( r_tr_.is_infinite(facet) || ! this->is_facet_on_surface(facet) )
     return false;
diff --git a/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h b/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h
index 53397c44c21c..54ed84a64eaf 100644
--- a/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h
+++ b/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h
@@ -572,7 +572,7 @@ compute_artifical_isec_timeC2 ( Trisegment_2_ptr< Trisegment_2<K, Segment_2_with
 
   FT t;
 
-  if(const Segment_2* seg = std::get<Segment_2>(&*inter_res))
+  if(const Segment_2* seg = std::get_if<Segment_2>(&*inter_res))
   {
     // get the segment extremity closest to the seed
     Boolean res = (K().compare_distance_2_object()(*seed, seg->source(), seg->target()) == CGAL::SMALLER);
@@ -581,7 +581,7 @@ compute_artifical_isec_timeC2 ( Trisegment_2_ptr< Trisegment_2<K, Segment_2_with
   }
   else
   {
-    const Point_2* inter_pt = std::get<const Point_2>(&*inter_res);
+    const Point_2* inter_pt = std::get_if<Point_2>(&*inter_res);
     if(!CGAL_NTS is_finite(inter_pt->x()) || !CGAL_NTS is_finite(inter_pt->y()))
       return std::nullopt;
     t = l0->a() * inter_pt->x() + l0->b() * inter_pt->y() + l0->c() ;
@@ -879,12 +879,12 @@ construct_artifical_isecC2 ( Trisegment_2_ptr< Trisegment_2<K, Segment_2_with_ID
   if (!inter_res) // shouldn't be here if there is no intersection
     return std::nullopt;
 
-  if(const Point_2* inter_pt = std::get<Point_2>(&*inter_res))
+  if(const Point_2* inter_pt = std::get_if<Point_2>(&*inter_res))
   {
     bool ok = CGAL_NTS is_finite(inter_pt->x()) && CGAL_NTS is_finite(inter_pt->y()) ;
     return cgal_make_optional(ok, *inter_pt) ;
   }
-  else if(const Segment_2* seg = std::get<Segment_2>(&*inter_res))
+  else if(const Segment_2* seg = std::get_if<Segment_2>(&*inter_res))
   {
     // get the segment extremity closest to the seed
     const Point_2& pt = (K().compare_distance_2_object()(*seed,

From 640c98f21e37d078e186e39c113f3025684f9d9e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 14 Jun 2023 18:36:38 +0200
Subject: [PATCH 0367/1398] add utility to avoid duplicate in variant + use it
 in SMDS_3

---
 .../CGAL/Simplicial_mesh_vertex_base_3.h      |  4 +-
 STL_Extension/include/CGAL/variant.h          | 87 +++++++++++++++++++
 2 files changed, 89 insertions(+), 2 deletions(-)
 create mode 100644 STL_Extension/include/CGAL/variant.h

diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
index 04b6f19af185..24656da85e17 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
@@ -26,9 +26,9 @@
 
 #include <CGAL/SMDS_3/internal/indices_management.h>
 #include <CGAL/SMDS_3/io_signature.h>
+#include <CGAL/variant.h>
 #include <CGAL/Has_timestamp.h>
 
-#include <variant>
 #include <tuple>
 
 namespace CGAL {
@@ -53,7 +53,7 @@ private :
   using Vertex_handle = typename Vb::Vertex_handle;
 
   // Types
-  using Index = std::variant<Subdomain_index, Surface_patch_index, Curve_index, Corner_index>;
+  using Index = Variant_with_no_duplicate_t<Subdomain_index, Surface_patch_index, Curve_index, Corner_index>;
   using FT = typename GT::FT;
 
   // Constructor
diff --git a/STL_Extension/include/CGAL/variant.h b/STL_Extension/include/CGAL/variant.h
new file mode 100644
index 000000000000..41bd836d8ccf
--- /dev/null
+++ b/STL_Extension/include/CGAL/variant.h
@@ -0,0 +1,87 @@
+// Copyright (c) 2023  GeometryFactory Sarl (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Sébastien Loriot
+//
+
+#ifndef CGAL_VARIANT_H
+#define CGAL_VARIANT_H
+
+#include <variant>
+
+namespace CGAL
+{
+
+template <class T, class Variant>
+struct Is_in_variant;
+
+template <class T, class V1, class ... Vn>
+struct Is_in_variant<T, std::variant<V1,Vn...>>
+{
+  inline static constexpr bool value =
+    std::is_same_v<T, V1> || Is_in_variant<T, std::variant<Vn...>>::value;
+};
+
+template <class T, class V>
+struct Is_in_variant<T, std::variant<V>>
+{
+  inline static constexpr bool value = std::is_same_v<T, V>;
+};
+
+/// equals true iif `T` is a possible type in `Variant` with `Variant` being a `std::variant`
+template <class T, class Variant>
+inline constexpr bool Is_in_variant_v = Is_in_variant<T, Variant>::value;
+
+// --
+template <class T, class Variant>
+struct Add_to_variant;
+
+template <class T, class ... Vn>
+struct Add_to_variant<T, std::variant<Vn...>>
+{
+  using type = std::variant<Vn..., T>;
+};
+
+/// a `std::variant` with `T` appended to the types of the `std::variant` `Variant`
+template< class T, class Variant >
+using Add_to_variant_t = typename Add_to_variant<T,Variant>::type;
+
+namespace internal{
+template <class Variant, class T1, class ... Tn>
+struct Get_variant_impl
+{
+  using type = typename Get_variant_impl<
+    std::conditional_t<Is_in_variant_v<T1, Variant>,
+                       Variant,
+                       Add_to_variant_t<T1,Variant>>,
+    Tn...>::type;
+};
+
+template <class Variant, class T1>
+struct Get_variant_impl<Variant, T1>
+{
+  using type = std::conditional_t<Is_in_variant_v<T1, Variant>,
+                                  Variant,
+                                  Add_to_variant_t<T1,Variant>>;
+};
+} // end of internal namespace
+
+template <class T1, class ... Tn>
+struct Variant_with_no_duplicate
+{
+  using type = typename internal::Get_variant_impl<std::variant<T1>, Tn ...>::type;
+};
+
+/// a `std::variant` with types being all different
+template< class ... Tn >
+using Variant_with_no_duplicate_t = typename Variant_with_no_duplicate<Tn ... >::type;
+
+} //end of CGAL namespace
+
+#endif

From cb840ac84b153c286dd1e5879083df04c74462de Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 14 Jun 2023 18:42:13 +0200
Subject: [PATCH 0368/1398] boost::optional::get -> std::optional::value

---
 .../Algebraic_kernel_d/Curve_analysis_2.h     | 20 +++++++-------
 .../Curve_pair_analysis_2.h                   |  6 ++---
 .../CGAL/Arr_algebraic_segment_traits_2.h     | 26 +++++++++----------
 BGL/examples/BGL_triangulation_2/dijkstra.cpp |  4 +--
 .../include/CGAL/Delaunay_triangulation.h     |  2 +-
 .../include/CGAL/Regular_triangulation.h      |  2 +-
 Triangulation/include/CGAL/Triangulation.h    |  4 +--
 7 files changed, 32 insertions(+), 32 deletions(-)

diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
index a11c4283a988..ef940f968877 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
@@ -584,7 +584,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
      */
     void set_f(Polynomial_2 f) {
         CGAL_precondition(! has_defining_polynomial());
-        if((! this->ptr()->f) || f!=this->ptr()->f.get()) {
+        if((! this->ptr()->f) || f!=this->ptr()->f.value()) {
             this->copy_on_write();
             this->ptr()->f=f;
         }
@@ -639,7 +639,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
     //! Returns the defining polynomial
     Polynomial_2 polynomial_2() const {
         CGAL_precondition(bool(this->ptr()->f));
-        return this->ptr()->f.get();
+        return this->ptr()->f.value();
     }
 
 public:
@@ -714,8 +714,8 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
                 = event_line;
             event_coordinates()[i].stack = event_line;
         }
-        CGAL_postcondition(event_coordinates()[i].stack.get().is_event());
-        return event_coordinates()[i].stack.get();
+        CGAL_postcondition(event_coordinates()[i].stack.value().is_event());
+        return event_coordinates()[i].stack.value();
     }
 
 public:
@@ -1349,7 +1349,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
                 }
             }
         }
-        return intermediate_values()[i].get();
+        return intermediate_values()[i].value();
     }
 
 
@@ -1370,7 +1370,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
         if(! this->ptr()->content) {
             compute_content_and_primitive_part();
         }
-        return this->ptr()->content.get();
+        return this->ptr()->content.value();
     }
 
 public:
@@ -1389,7 +1389,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
         if(! this->ptr()->f_primitive) {
             compute_content_and_primitive_part();
         }
-        return this->ptr()->f_primitive.get();
+        return this->ptr()->f_primitive.value();
     }
 
     Algebraic_kernel_with_analysis_2* kernel() const {
@@ -1582,7 +1582,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
         if(! this->ptr()->resultant_of_primitive_and_derivative_y) {
             compute_resultant_of_primitive_and_derivative_y();
         }
-        return this->ptr()->resultant_of_primitive_and_derivative_y.get();
+        return this->ptr()->resultant_of_primitive_and_derivative_y.value();
     }
 
 private:
@@ -1714,7 +1714,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
         if(! this->ptr()->event_coordinates) {
             compute_event_coordinates();
         }
-        return this->ptr()->event_coordinates.get();
+        return this->ptr()->event_coordinates.value();
     }
 
 private:
@@ -1727,7 +1727,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
             event_coordinates();
             CGAL_assertion(bool(this->ptr()->intermediate_values));
         }
-        return this->ptr()->intermediate_values.get();
+        return this->ptr()->intermediate_values.value();
     }
 
 
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
index a38cf2ab659a..d350a27a2df8 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
@@ -1030,7 +1030,7 @@ class Curve_pair_analysis_2 :
             this->ptr()->event_slices[i] = create_event_slice(i);
         }
         CGAL_assertion(bool(this->ptr()->event_slices[i]));
-        return this->ptr()->event_slices[i].get();
+        return this->ptr()->event_slices[i].value();
     }
 
 
@@ -1045,7 +1045,7 @@ class Curve_pair_analysis_2 :
 
         }
 
-        return intermediate_slices()[i].get();
+        return intermediate_slices()[i].valuen();
     }
 
     //!  Returns bound representative value at the <tt>i</tt>th interval
@@ -1074,7 +1074,7 @@ class Curve_pair_analysis_2 :
             }
         }
         CGAL_assertion(bool(intermediate_values()[i]));
-        return intermediate_values()[i].get();
+        return intermediate_values()[i].value();
 
     }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
index b1678fe4acdd..ca15a9b2752a 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
@@ -293,39 +293,39 @@ class Arr_algebraic_segment_traits_2 {
           it_seg_p = std::get<X_monotone_curve_2>(&(*it));
         }
 
-        bool left_on_arc = start && on_arc(start.get(), *it_seg_p);
-        bool right_on_arc = end && on_arc(end.get(), *it_seg_p);
+        bool left_on_arc = start && on_arc(start.value(), *it_seg_p);
+        bool right_on_arc = end && on_arc(end.value(), *it_seg_p);
 
         if ( left_on_arc && right_on_arc ) {
-          segs.push_back(it_seg_p->trim(start.get(),end.get()));
+          segs.push_back(it_seg_p->trim(start.value(),end.value()));
         }
         if (left_on_arc && (!right_on_arc)) {
           if (!it_seg_p->is_finite(CGAL::ARR_MAX_END) ||
-             !equal(start.get(),right(*it_seg_p))) {
+             !equal(start.value(),right(*it_seg_p))) {
             if (it_seg_p->is_finite(CGAL::ARR_MIN_END) &&
-                equal(start.get(),left(*it_seg_p)))
+                equal(start.value(),left(*it_seg_p)))
             {
               segs.push_back(*it_seg_p);
             }
             else {
               X_monotone_curve_2 split1,split2;
-              it_seg_p->split(start.get(),split1,split2);
+              it_seg_p->split(start.value(),split1,split2);
               segs.push_back(split2);
             }
           }
         }
         if ((!left_on_arc) && right_on_arc) {
           if (!it_seg_p->is_finite(CGAL::ARR_MIN_END) ||
-              ! equal(left(*it_seg_p), end.get()))
+              ! equal(left(*it_seg_p), end.value()))
           {
             if (it_seg_p->is_finite(CGAL::ARR_MAX_END) &&
-                equal(end.get(), right(*it_seg_p)))
+                equal(end.value(), right(*it_seg_p)))
             {
               segs.push_back(*it_seg_p);
             }
             else {
               X_monotone_curve_2 split1,split2;
-              it_seg_p->split(end.get(), split1, split2);
+              it_seg_p->split(end.value(), split1, split2);
               segs.push_back(split1);
             }
           }
@@ -354,8 +354,8 @@ class Arr_algebraic_segment_traits_2 {
               it--;
               it_seg_p = std::get<X_monotone_curve_2>(&(*it));
             }
-            if (start && on_arc(start.get(),*it_seg_p)) {
-              segs.push_front(it_seg_p->trim(start.get(), right(*it_seg_p)));
+            if (start && on_arc(start.value(),*it_seg_p)) {
+              segs.push_front(it_seg_p->trim(start.value(), right(*it_seg_p)));
               break;
             }
             else {
@@ -384,8 +384,8 @@ class Arr_algebraic_segment_traits_2 {
               CGAL_assertion(it != arcs.end());
               it_seg_p = std::get<X_monotone_curve_2>(&(*it));
             }
-            if(end && on_arc(end.get(),*it_seg_p)) {
-              segs.push_back(it_seg_p->trim(left(*it_seg_p),end.get()));
+            if(end && on_arc(end.value(),*it_seg_p)) {
+              segs.push_back(it_seg_p->trim(left(*it_seg_p),end.value()));
               break;
             }
             else {
diff --git a/BGL/examples/BGL_triangulation_2/dijkstra.cpp b/BGL/examples/BGL_triangulation_2/dijkstra.cpp
index 87c308e18bb2..1e63fc8810f1 100644
--- a/BGL/examples/BGL_triangulation_2/dijkstra.cpp
+++ b/BGL/examples/BGL_triangulation_2/dijkstra.cpp
@@ -60,9 +60,9 @@ int main(int argc,char* argv[])
   for(vertex_descriptor vd : vertices(tr))
   {
     std::cout << vd->point() << " [" <<  vertex_id_map[vd] << "] ";
-    std::cout << " has distance = " << std::get(distance_pmap,vd)
+    std::cout << " has distance = " << get(distance_pmap,vd)
               << " and predecessor ";
-    vd = std::get(predecessor_pmap,vd);
+    vd = get(predecessor_pmap,vd);
     std::cout << vd->point() << " [" <<  vertex_id_map[vd] << "]\n ";
   }
 
diff --git a/Triangulation/include/CGAL/Delaunay_triangulation.h b/Triangulation/include/CGAL/Delaunay_triangulation.h
index 1dd1929cb682..a2203ee762ef 100644
--- a/Triangulation/include/CGAL/Delaunay_triangulation.h
+++ b/Triangulation/include/CGAL/Delaunay_triangulation.h
@@ -145,7 +145,7 @@ class Delaunay_triangulation
       {
         if(!*fop)
           *fop=cfo(a,b);
-        return ifsoos(fop->get(),a,b,p);
+        return ifsoos(fop->value(),a,b,p);
       }
     };
 public:
diff --git a/Triangulation/include/CGAL/Regular_triangulation.h b/Triangulation/include/CGAL/Regular_triangulation.h
index 8294cb655980..b2e6a651d492 100644
--- a/Triangulation/include/CGAL/Regular_triangulation.h
+++ b/Triangulation/include/CGAL/Regular_triangulation.h
@@ -144,7 +144,7 @@ class Regular_triangulation
     {
       if(!*fop)
         *fop=cfo(a,b);
-      return ifpt(fop->get(),a,b,p);
+      return ifpt(fop->value(),a,b,p);
     }
   };
 
diff --git a/Triangulation/include/CGAL/Triangulation.h b/Triangulation/include/CGAL/Triangulation.h
index 1dc8e1a34592..9a3e4aecb47b 100644
--- a/Triangulation/include/CGAL/Triangulation.h
+++ b/Triangulation/include/CGAL/Triangulation.h
@@ -101,10 +101,10 @@ class Triangulation
       template<class Iter>
       CGAL::Orientation operator()(Iter a, Iter b) const
       {
+          return ifo(fop->value(),a,b);
         if (*fop)
-          return ifo(fop->get(),a,b);
         *fop = cfo(a,b);
-        CGAL_assertion(ifo(fop->get(),a,b) == CGAL::POSITIVE);
+        CGAL_assertion(ifo(fop->value(),a,b) == CGAL::POSITIVE);
         return CGAL::POSITIVE;
       }
     };

From f240a47451a2323d6ac589cfdd885e2b10428e8b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 14 Jun 2023 18:45:35 +0200
Subject: [PATCH 0369/1398] boost::get -> std::get_if

---
 .../algebraic_segments.cpp                    |  2 +-
 .../edge_manipulation_curve_history.cpp       |  2 +-
 .../point_location_utils.h                    | 12 +++----
 .../unb_planar_vertical_decomposition.cpp     |  8 ++---
 .../include/CGAL/Arr_accessor.h               |  6 ++--
 .../CGAL/Arr_algebraic_segment_traits_2.h     | 14 ++++----
 .../CGAL/Arr_circular_line_arc_traits_2.h     | 36 +++++++++----------
 .../include/CGAL/Arr_curve_data_traits_2.h    |  4 +--
 .../Bezier_bounding_rational_traits.h         |  8 ++---
 .../include/CGAL/Arr_linear_traits_2.h        |  2 +-
 .../CGAL/Arr_non_caching_segment_traits_2.h   |  4 +--
 .../Trapezoidal_decomposition_2_impl.h        |  2 +-
 .../include/CGAL/Arr_point_location_result.h  |  2 +-
 .../include/CGAL/Arr_polycurve_traits_2.h     | 16 ++++-----
 .../include/CGAL/Arr_segment_traits_2.h       |  2 +-
 .../include/CGAL/Arr_tracing_traits_2.h       |  8 ++---
 .../Arrangement_on_surface_2_global.h         | 34 +++++++++---------
 .../Arrangement_on_surface_2_impl.h           |  4 +--
 .../Arrangement_2/Arrangement_zone_2_impl.h   | 18 +++++-----
 .../Surface_sweep_2/Arr_insertion_traits_2.h  |  6 ++--
 .../Surface_sweep_2/Arr_overlay_ss_visitor.h  |  4 +--
 .../Surface_sweep_2/Arr_overlay_traits_2.h    |  8 ++---
 .../simple_polygon_visibility_2.cpp           |  2 +-
 23 files changed, 102 insertions(+), 102 deletions(-)

diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp
index c1bc7c4779d9..69c4a66ea689 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp
@@ -52,7 +52,7 @@ int main() {
   // but not in this case).
   std::vector<X_monotone_curve> segs;
   for(size_t i = 0; i < pre_segs.size(); ++i) {
-    auto* curr_p = std::get<X_monotone_curve>(&pre_segs[i]);
+    auto* curr_p = std::get_if<X_monotone_curve>(&pre_segs[i]);
     assert(curr_p);
     segs.push_back(*curr_p);
   }
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp
index c1ee293fd271..bd636bc94fe5 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp
@@ -45,7 +45,7 @@ int main() {
   Point_location pl(arr);
   const Point q{_7_halves, 7};
   Point_location::result_type obj = pl.locate(q);
-  auto* e = std::get<Arr_with_hist::Halfedge_const_handle>(&obj);
+  auto* e = std::get_if<Arr_with_hist::Halfedge_const_handle>(&obj);
 
   // Split the edge e to two edges e1 and e2;
   auto e1 = arr.split_edge(arr.non_const_handle(*e), q);
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
index f50236bb3e51..d6c29e08bac7 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
@@ -46,13 +46,13 @@ void print_point_location
   const Face_const_handle* f;
 
   std::cout << "The point (" << q << ") is located ";
-  if ((f = std::get<Face_const_handle>(&obj)))          // inside a face
+  if ((f = std::get_if<Face_const_handle>(&obj)))          // inside a face
     std::cout << "inside "
               << (((*f)->is_unbounded()) ? "the unbounded" : "a bounded")
               << " face." << std::endl;
-  else if ((e = std::get<Halfedge_const_handle>(&obj))) // on an edge
+  else if ((e = std::get_if<Halfedge_const_handle>(&obj))) // on an edge
     std::cout << "on an edge: " << (*e)->curve() << std::endl;
-  else if ((v = std::get<Vertex_const_handle>(&obj)))   // on a vertex
+  else if ((v = std::get_if<Vertex_const_handle>(&obj)))   // on a vertex
     std::cout << "on " << (((*v)->is_isolated()) ? "an isolated" : "a")
               << " vertex: " << (*v)->point() << std::endl;
   else CGAL_error_msg("Invalid object.");
@@ -101,12 +101,12 @@ void shoot_vertical_ray(const VerticalRayShooting& vrs,
 
   std::cout << "Shooting up from (" << q << ") : hit ";
 
-  if ((v = std::get<Vertex_const_handle>(&obj)))         // hit a vertex
+  if ((v = std::get_if<Vertex_const_handle>(&obj)))         // hit a vertex
     std::cout << (((*v)->is_isolated()) ? "an isolated" : "a")
               << " vertex: " << (*v)->point() << std::endl;
-  else if ((e = std::get<Halfedge_const_handle>(&obj)) ) // hit an edge
+  else if ((e = std::get_if<Halfedge_const_handle>(&obj)) ) // hit an edge
     std::cout << "an edge: " << (*e)->curve() << std::endl;
-  else if ((f = std::get<Face_const_handle>(&obj))) {    // hit nothing
+  else if ((f = std::get_if<Face_const_handle>(&obj))) {    // hit nothing
     assert((*f)->is_unbounded());
     std::cout << "nothing." << std::endl;
   }
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
index d51f4fae3894..0b31dc9655bf 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
@@ -41,10 +41,10 @@ int main() {
     std::cout << " feature below: ";
     if (! curr.first) std::cout << "EMPTY";
     else {
-      auto* vh = std::get<Vertex_const_handle>(&*(curr.first));;
+      auto* vh = std::get_if<Vertex_const_handle>(&*(curr.first));;
       if (vh) std::cout << '(' << (*vh)->point() << ')';
       else {
-        auto* hh = std::get<Halfedge_const_handle>(&*(curr.first));
+        auto* hh = std::get_if<Halfedge_const_handle>(&*(curr.first));
         if (! (*hh)->is_fictitious())
           std::cout << '[' << (*hh)->curve() << ']';
         else std::cout << "NONE";
@@ -54,10 +54,10 @@ int main() {
     std::cout << "   feature above: ";
     if (! curr.second) std::cout << "EMPTY\n";
     else {
-      auto* vh = std::get<Vertex_const_handle>(&*(curr.second));;
+      auto* vh = std::get_if<Vertex_const_handle>(&*(curr.second));;
       if (vh) std::cout << '(' << (*vh)->point() << ")\n";
       else {
-        auto* hh = std::get<Halfedge_const_handle>(&*(curr.second));
+        auto* hh = std::get_if<Halfedge_const_handle>(&*(curr.second));
         if (! (*hh)->is_fictitious())
           std::cout << '[' << (*hh)->curve() << "]\n";
         else std::cout << "NONE\n";
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_accessor.h b/Arrangement_on_surface_2/include/CGAL/Arr_accessor.h
index 202ca448b5e9..bb60e54d2245 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_accessor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_accessor.h
@@ -114,13 +114,13 @@ class Arr_accessor {
     auto obj = p_arr->topology_traits()->locate_curve_end(cv, ind, ps_x, ps_y);
 
     // Return a handle to the DCEL feature.
-    DFace** f_p = std::get<DFace*>(&obj);
+    DFace** f_p = std::get_if<DFace*>(&obj);
     if (f_p) return (Pl_result::make_result(p_arr->_const_handle_for(*f_p)));
 
-    DHalfedge** he_p = std::get<DHalfedge*>(&obj);
+    DHalfedge** he_p = std::get_if<DHalfedge*>(&obj);
     if (he_p) return (Pl_result::make_result(p_arr->_const_handle_for(*he_p)));
 
-    DVertex** v_p = std::get<DVertex*>(&obj);
+    DVertex** v_p = std::get_if<DVertex*>(&obj);
     if (v_p) return (Pl_result::make_result(p_arr->_const_handle_for(*v_p)));
 
     // We should never reach here:
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
index ca15a9b2752a..af9b28db6f21 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
@@ -286,11 +286,11 @@ class Arr_algebraic_segment_traits_2 {
         this->_ckva()->make_x_monotone_2_object()(cv, std::back_inserter(arcs));
         auto it = arcs.begin();
         auto helper = it;
-        const auto* it_seg_p = std::get<X_monotone_curve_2>(&(*it));
+        const auto* it_seg_p = std::get_if<X_monotone_curve_2>(&(*it));
         while (it != arcs.end()) {
           if ( on_arc(p, *it_seg_p) ) break;
           it++;
-          it_seg_p = std::get<X_monotone_curve_2>(&(*it));
+          it_seg_p = std::get_if<X_monotone_curve_2>(&(*it));
         }
 
         bool left_on_arc = start && on_arc(start.value(), *it_seg_p);
@@ -348,11 +348,11 @@ class Arr_algebraic_segment_traits_2 {
             }
             CGAL_assertion(it != arcs.begin());
             it--;
-            it_seg_p = std::get<X_monotone_curve_2>(&(*it));
+            it_seg_p = std::get_if<X_monotone_curve_2>(&(*it));
             while (! on_arc(point_it, *it_seg_p)) {
               CGAL_assertion(it != arcs.begin());
               it--;
-              it_seg_p = std::get<X_monotone_curve_2>(&(*it));
+              it_seg_p = std::get_if<X_monotone_curve_2>(&(*it));
             }
             if (start && on_arc(start.value(),*it_seg_p)) {
               segs.push_front(it_seg_p->trim(start.value(), right(*it_seg_p)));
@@ -365,7 +365,7 @@ class Arr_algebraic_segment_traits_2 {
         }
         if (! right_on_arc) {
           it = helper; // reset
-          it_seg_p = std::get<X_monotone_curve_2>(&(*it));
+          it_seg_p = std::get_if<X_monotone_curve_2>(&(*it));
           Point_2 point_it;
           while (true) {
             if (it_seg_p->is_finite(CGAL::ARR_MAX_END) &&
@@ -378,11 +378,11 @@ class Arr_algebraic_segment_traits_2 {
             }
             it++;
             CGAL_assertion(it != arcs.end());
-            it_seg_p = std::get<X_monotone_curve_2>(&(*it));
+            it_seg_p = std::get_if<X_monotone_curve_2>(&(*it));
             while(! on_arc(point_it, *it_seg_p)) {
               it++;
               CGAL_assertion(it != arcs.end());
-              it_seg_p = std::get<X_monotone_curve_2>(&(*it));
+              it_seg_p = std::get_if<X_monotone_curve_2>(&(*it));
             }
             if(end && on_arc(end.value(),*it_seg_p)) {
               segs.push_back(it_seg_p->trim(left(*it_seg_p),end.value()));
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
index c48fa96917c7..ba387ee0804e 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
@@ -85,23 +85,23 @@ namespace CGAL {
                    const std::variant< Arc1, Arc2 > &a2,
                    const Circular_arc_point_2 &p) const
       {
-        if ( const Arc1* arc1 = std::get<Arc1>( &a1 ) ){
-          if ( const Arc1* arc2 = std::get<Arc1>( &a2 ) ){
+        if ( const Arc1* arc1 = std::get_if<Arc1>( &a1 ) ){
+          if ( const Arc1* arc2 = std::get_if<Arc1>( &a2 ) ){
             return CircularKernel()
               .compare_y_to_right_2_object()(*arc1, *arc2, p);
           }
           else {
-            const Arc2* arc2e = std::get<Arc2>( &a2 );
+            const Arc2* arc2e = std::get_if<Arc2>( &a2 );
             return CircularKernel()
               .compare_y_to_right_2_object()(*arc1, *arc2e, p);
           }
         }
-        const Arc2* arc1 = std::get<Arc2>( &a1 );
-        if ( const Arc1* arc2 = std::get<Arc1>( &a2 ) ){
+        const Arc2* arc1 = std::get_if<Arc2>( &a1 );
+        if ( const Arc1* arc2 = std::get_if<Arc1>( &a2 ) ){
           return CircularKernel()
             .compare_y_to_right_2_object()(*arc1, *arc2, p);
         }
-        const Arc2* arc2e = std::get<Arc2>( &a2 );
+        const Arc2* arc2e = std::get_if<Arc2>( &a2 );
         return CircularKernel()
           .compare_y_to_right_2_object()(*arc1, *arc2e, p);
       }
@@ -189,11 +189,11 @@ namespace CGAL {
       operator() (const Circular_arc_point_2 &p,
                   const std::variant< Arc1, Arc2 > &A1) const
       {
-        if ( const Arc1* arc1 = std::get<Arc1>( &A1 ) ){
+        if ( const Arc1* arc1 = std::get_if<Arc1>( &A1 ) ){
           return CircularKernel().compare_y_at_x_2_object()(p, *arc1);
         }
         else {
-          const Arc2* arc2 = std::get<Arc2>( &A1 );
+          const Arc2* arc2 = std::get_if<Arc2>( &A1 );
           return CircularKernel().compare_y_at_x_2_object()(p, *arc2);
         }
       }
@@ -250,7 +250,7 @@ namespace CGAL {
       operator()(const std::variant<Arc1, Arc2, Not_X_Monotone> &A,
                  OutputIterator res) const
       {
-        if ( const Arc1* arc1 = std::get<Arc1>( &A ) ) {
+        if ( const Arc1* arc1 = std::get_if<Arc1>( &A ) ) {
           std::vector<CGAL::Object> container;
           CircularKernel().
             make_x_monotone_2_object()(*arc1,std::back_inserter(container));
@@ -258,7 +258,7 @@ namespace CGAL {
                                           (container, res);
         }
         else {
-          const Arc2* arc2 = std::get<Arc2>( &A );
+          const Arc2* arc2 = std::get_if<Arc2>( &A );
           std::vector<CGAL::Object> container;
           CircularKernel().
             make_x_monotone_2_object()(*arc2,std::back_inserter(container));
@@ -281,19 +281,19 @@ namespace CGAL {
                    const std::variant< Arc1, Arc2 > &c2,
                    OutputIterator oi) const
       {
-        if ( const Arc1* arc1 = std::get<Arc1>( &c1 ) ){
-          if ( const Arc1* arc2 = std::get<Arc1>( &c2 ) ){
+        if ( const Arc1* arc1 = std::get_if<Arc1>( &c1 ) ){
+          if ( const Arc1* arc2 = std::get_if<Arc1>( &c2 ) ){
             return CircularKernel().intersect_2_object()(*arc1, *arc2, oi);
           }
-          const Arc2* arc2 = std::get<Arc2>( &c2 );
+          const Arc2* arc2 = std::get_if<Arc2>( &c2 );
           return CircularKernel().intersect_2_object()(*arc1, *arc2, oi);
         }
 
-        const Arc2* arc1e = std::get<Arc2>( &c1 );
-        if ( const Arc1* arc2 = std::get<Arc1>( &c2 ) ){
+        const Arc2* arc1e = std::get_if<Arc2>( &c1 );
+        if ( const Arc1* arc2 = std::get_if<Arc1>( &c2 ) ){
           return CircularKernel().intersect_2_object()(*arc1e, *arc2, oi);
         }
-        const Arc2* arc2 = std::get<Arc2>( &c2 );
+        const Arc2* arc2 = std::get_if<Arc2>( &c2 );
         return CircularKernel().intersect_2_object()(*arc1e, *arc2, oi);
       }
 
@@ -314,7 +314,7 @@ namespace CGAL {
                    std::variant< Arc1, Arc2 > &ca2) const
       {
         // TODO : optimize by extracting the references from the variants ?
-        if ( const Arc1* arc1 = std::get<Arc1>( &A ) ){
+        if ( const Arc1* arc1 = std::get_if<Arc1>( &A ) ){
           Arc1 carc1;
           Arc1 carc2;
           CircularKernel().split_2_object()(*arc1, p, carc1, carc2);
@@ -324,7 +324,7 @@ namespace CGAL {
 
         }
         else{
-          const Arc2* arc2 = std::get<Arc2>( &A );
+          const Arc2* arc2 = std::get_if<Arc2>( &A );
           Arc2 cline1;
           Arc2 cline2;
           CircularKernel().split_2_object()(*arc2, p, cline1, cline2);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
index f487c0552215..e8bb9a707035 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
@@ -138,12 +138,12 @@ class Arr_curve_data_traits_2 : public Traits_ {
       // Attach the data to each of the resulting x-monotone curves.
       X_monotone_curve_data xdata = Convert()(cv.data());
       for (const auto& base_obj : base_objects) {
-        if (const auto* bxcv = std::get<Base_x_monotone_curve_2>(&base_obj)) {
+        if (const auto* bxcv = std::get_if<Base_x_monotone_curve_2>(&base_obj)) {
           *oi++ = Make_x_monotone_result(X_monotone_curve_2(*bxcv, xdata));
           continue;
         }
         // Current object is an isolated point: Leave it as is.
-        const auto* bp = std::get<Point_2>(&base_obj);
+        const auto* bp = std::get_if<Point_2>(&base_obj);
         CGAL_assertion(bp);
         *oi++ = Make_x_monotone_result(*bp);
       }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_bounding_rational_traits.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_bounding_rational_traits.h
index 8b3abe1f57f2..705682f05ca9 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_bounding_rational_traits.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_bounding_rational_traits.h
@@ -1264,22 +1264,22 @@ class Bezier_bounding_rational_traits
         Control_points  aux_vec;
 
         auto res1 = f_intersect(skew1a, skew2a);
-        const Point_2* p1 = std::get<Point_2>(&*res1);
+        const Point_2* p1 = std::get_if<Point_2>(&*res1);
         if (! p1) CGAL_error();
         aux_vec.push_back(*p1);
 
         auto res2 = f_intersect(skew1a, skew2b);
-        const Point_2* p2 = std::get<Point_2>(&*res2);
+        const Point_2* p2 = std::get_if<Point_2>(&*res2);
         if (! p2) CGAL_error();
         aux_vec.push_back(*p2);
 
         auto res3 = f_intersect(skew1b, skew2a);
-        const Point_2* p3 = std::get<Point_2>(&*res3);
+        const Point_2* p3 = std::get_if<Point_2>(&*res3);
         if (! p3) CGAL_error();
         aux_vec.push_back(*p3);
 
         auto res4 = f_intersect (skew1b, skew2b);
-        const Point_2* p4 = std::get<Point_2>(&*res4);
+        const Point_2* p4 = std::get_if<Point_2>(&*res4);
         if (! p4) CGAL_error();
         aux_vec.push_back(*p4);
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h
index 079f5534e832..ef830934d74b 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h
@@ -1340,7 +1340,7 @@ class Arr_linear_traits_2 : public Kernel_ {
       if (! res) return oi;
 
       // Check whether we have a single intersection point.
-      const Point_2* ip = std::get<Point_2>(&*res);
+      const Point_2* ip = std::get_if<Point_2>(&*res);
       if (ip != nullptr) {
         // Check whether the intersection point ip lies on both segments.
         const bool ip_on_cv1 = cv1.is_vertical() ?
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h
index 636d669eb36f..d3397599ae68 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h
@@ -234,7 +234,7 @@ class Arr_non_caching_segment_traits_2 :
       if (! res) return oi;
 
       // Check if the intersection is a point:
-      const Point_2* p_p = std::get<Point_2>(&*res);
+      const Point_2* p_p = std::get_if<Point_2>(&*res);
       if (p_p != nullptr) {
         // Create a pair representing the point with its multiplicity,
         // which is always 1 for line segments for all practical purposes.
@@ -246,7 +246,7 @@ class Arr_non_caching_segment_traits_2 :
       }
 
       // The intersection is a segment.
-      const X_monotone_curve_2* cv_p = std::get<X_monotone_curve_2>(&*res);
+      const X_monotone_curve_2* cv_p = std::get_if<X_monotone_curve_2>(&*res);
       CGAL_assertion(cv_p != nullptr);
 
       Comparison_result cmp1 = m_traits.compare_endpoints_xy_2_object()(cv1);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h
index 7da418861f07..9b0a76171141 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2_impl.h
@@ -219,7 +219,7 @@ deactivate_trapezoid(Dag_node& trpz_node, Dag_node* active_node) const
   CGAL_precondition(traits->is_active(trpz_node.get_data()));
   CGAL_precondition(traits->is_td_trapezoid(trpz_node.get_data()));
   if (Td_active_trapezoid* trap =
-      std::get<Td_active_trapezoid>(&trpz_node.get_data()))
+      std::get_if<Td_active_trapezoid>(&trpz_node.get_data()))
     trap->non_recursive_clear_neighbors();
   trpz_node.set_data(Td_inactive_trapezoid());
   if (active_node) trpz_node.set_left_child(*active_node);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
index 8516cc85be2d..15320d02bcdb 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
@@ -99,7 +99,7 @@ struct Arr_point_location_result {
 
   template <typename T>
   static
-  inline const T* assign(const Type* obj) { return std::get<T>(obj); }
+  inline const T* assign(const Type* obj) { return std::get_if<T>(obj); }
 #endif // CGAL_ARR_POINT_LOCATION_VERSION < 2
 
   //this one is only to remove warnings in functions
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
index 4998f53d6463..a7aa0c32786d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
@@ -212,7 +212,7 @@ class Arr_polycurve_traits_2 :
       for (auto its = cv.subcurves_begin(); its != cv.subcurves_end(); ++its)
         make_seg_x_monotone(*its, std::back_inserter(x_seg_objects));
       auto it = x_seg_objects.begin();
-      const auto* x_seg_p = std::get<X_monotone_subcurve_2>(&(*it));
+      const auto* x_seg_p = std::get_if<X_monotone_subcurve_2>(&(*it));
 #if ! defined (CGAL_NO_ASSERTIONS)
       CGAL_assertion(x_seg_p != nullptr);
 #endif
@@ -260,7 +260,7 @@ class Arr_polycurve_traits_2 :
 #endif
 
       for (++it; it != x_seg_objects.end(); ++it) {
-        const auto* x_seg_p = std::get<X_monotone_subcurve_2>(&(*it));
+        const auto* x_seg_p = std::get_if<X_monotone_subcurve_2>(&(*it));
 #if ! defined (CGAL_NO_ASSERTIONS)
         CGAL_assertion(x_seg_p != nullptr);
 #endif
@@ -350,7 +350,7 @@ class Arr_polycurve_traits_2 :
       for (auto its = cv.subcurves_begin(); its != cv.subcurves_end(); ++its)
         make_seg_x_monotone(*its, std::back_inserter(x_seg_objects));
       auto it = x_seg_objects.begin();
-      const auto* x_seg_p = std::get<X_monotone_subcurve_2>(&(*it));
+      const auto* x_seg_p = std::get_if<X_monotone_subcurve_2>(&(*it));
 #if ! defined (CGAL_NO_ASSERTIONS)
       CGAL_assertion(x_seg_p != nullptr);
 #endif
@@ -398,7 +398,7 @@ class Arr_polycurve_traits_2 :
 #endif
 
       for (++it; it != x_seg_objects.end(); ++it) {
-        const auto* x_seg_p = std::get<X_monotone_subcurve_2>(&(*it));
+        const auto* x_seg_p = std::get_if<X_monotone_subcurve_2>(&(*it));
 #if ! defined (CGAL_NO_ASSERTIONS)
         CGAL_assertion(x_seg_p != nullptr);
 #endif
@@ -824,7 +824,7 @@ class Arr_polycurve_traits_2 :
           intersect(cv1[i1], cv2[i2], std::back_inserter(xections));
           for (const auto& xection : xections) {
             const X_monotone_subcurve_2* subcv_p =
-              std::get<X_monotone_subcurve_2>(&xection);
+              std::get_if<X_monotone_subcurve_2>(&xection);
             if (subcv_p != nullptr) {
               ocv.push_back(*subcv_p);
               oi = output_ocv (ocv, invert_ocv, oi);
@@ -832,7 +832,7 @@ class Arr_polycurve_traits_2 :
             }
 
             const Intersection_point* p_p =
-              std::get<Intersection_point>(&xection);
+              std::get_if<Intersection_point>(&xection);
             if (p_p != nullptr) *oi++ = Intersection_result(*p_p);
           }
         }
@@ -846,7 +846,7 @@ class Arr_polycurve_traits_2 :
 
           for (const auto& item : sub_xections) {
             const X_monotone_subcurve_2* x_seg =
-              std::get<X_monotone_subcurve_2>(&item);
+              std::get_if<X_monotone_subcurve_2>(&item);
             if (x_seg != nullptr) {
               X_monotone_subcurve_2 seg = *x_seg;
               // We maintain the variant that if the input curves have opposite
@@ -863,7 +863,7 @@ class Arr_polycurve_traits_2 :
             }
 
             const Intersection_point* p_ptr =
-              std::get<Intersection_point>(&item);
+              std::get_if<Intersection_point>(&item);
             if (p_ptr != nullptr) {
               // Any point that is not equal to the max_vertex of the
               // subcurve should be inserted into oi.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h
index ccaa389826aa..15a3cffe63d8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h
@@ -724,7 +724,7 @@ class Arr_segment_traits_2 : public Kernel_ {
       CGAL_assertion(bool(res));
 
       // Check if we have a single intersection point.
-      const Point_2* ip = std::get<Point_2>(&*res);
+      const Point_2* ip = std::get_if<Point_2>(&*res);
       if (ip != nullptr) {
         CGAL_assertion(cv1.is_vertical() ?
                        m_traits.is_in_y_range_2_object()(cv1, *ip) :
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h
index 06f095fb54c4..4778a4fe9131 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h
@@ -540,12 +540,12 @@ class Arr_tracing_traits_2 : public Base_traits {
 
       size_t i = 0;
       for (auto it = container.begin(); it != container.end(); ++it) {
-        if (const auto* xcv = std::get<X_monotone_curve_2>(&*it)) {
+        if (const auto* xcv = std::get_if<X_monotone_curve_2>(&*it)) {
           std::cout << "  result[" << i++ << "]: xcv: " << *xcv << std::endl;
           continue;
         }
 
-        if (const auto* p = std::get<Point_2>(&*it)) {
+        if (const auto* p = std::get_if<Point_2>(&*it)) {
           std::cout << "  result[" << i++ << "]: p: " << *p << std::endl;
           continue;
         }
@@ -632,13 +632,13 @@ class Arr_tracing_traits_2 : public Base_traits {
 
       unsigned int i = 0;
       for (const auto& item : container) {
-        const X_monotone_curve_2* xcv = std::get<X_monotone_curve_2>(&item);
+        const X_monotone_curve_2* xcv = std::get_if<X_monotone_curve_2>(&item);
         if (xcv != nullptr) {
           std::cout << "  result[" << i++ << "]: xcv: " << *xcv << std::endl;
           continue;
         }
 
-        const Intersection_point* ip = std::get<Intersection_point>(&item);
+        const Intersection_point* ip = std::get_if<Intersection_point>(&item);
         if (ip != nullptr) {
           std::cout << "  result[" << i++ << "]: p: " << ip->first
                     << ", multiplicity: " << ip->second << std::endl;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
index 0338b67e73e7..ee81a3e8a874 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
@@ -100,7 +100,7 @@ void insert(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
   // Insert each x-monotone curve into the arrangement.
   for (const auto& x_obj : x_objects) {
     // Act according to the type of the current object.
-    const auto* x_curve = std::get<X_monotone_curve_2>(&x_obj);
+    const auto* x_curve = std::get_if<X_monotone_curve_2>(&x_obj);
     if (x_curve != nullptr) {
       // Inserting an x-monotone curve:
       // Initialize the zone-computation object with the given curve.
@@ -118,7 +118,7 @@ void insert(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
       arr_access.notify_after_global_change();
       continue;
     }
-    const auto* iso_p = std::get<Point_2>(&x_obj);
+    const auto* iso_p = std::get_if<Point_2>(&x_obj);
     CGAL_assertion(iso_p != nullptr);
 
     // Inserting a point into the arrangement:
@@ -683,7 +683,7 @@ insert_non_intersecting_curve
 
     // The endpoint must not lie on an existing edge, but may coincide with
     // and existing vertex vh1.
-    CGAL_precondition_msg(std::get<Halfedge_const_handle>(&obj1) == nullptr,
+    CGAL_precondition_msg(std::get_if<Halfedge_const_handle>(&obj1) == nullptr,
                           "The curve must not intersect an existing edge.");
 
   }
@@ -691,7 +691,7 @@ insert_non_intersecting_curve
     // We have a left end with boundary conditions. Use the accessor to locate
     // the feature that contains it.
     obj1 = arr_access.locate_curve_end(c, ARR_MIN_END, bx1, by1);
-    CGAL_precondition_msg(std::get<Halfedge_const_handle>(&obj1) == nullptr,
+    CGAL_precondition_msg(std::get_if<Halfedge_const_handle>(&obj1) == nullptr,
                           "The curve must not overlap an existing edge.");
   }
   vh1 = Pl_result::template assign<Vertex_const_handle>(&obj1);
@@ -710,7 +710,7 @@ insert_non_intersecting_curve
 
     // The endpoint must not lie on an existing edge, but may coincide with
     // and existing vertex vh2.
-    CGAL_precondition_msg(std::get<Halfedge_const_handle>(&obj2) == nullptr,
+    CGAL_precondition_msg(std::get_if<Halfedge_const_handle>(&obj2) == nullptr,
                           "The curve must not intersect an existing edge.");
   }
   else {
@@ -721,7 +721,7 @@ insert_non_intersecting_curve
     //           << ", by2: " << by2
     //           << std::endl;
     obj2 = arr_access.locate_curve_end(c, ARR_MAX_END, bx2, by2);
-    CGAL_precondition_msg(std::get<Halfedge_const_handle>(&obj2) == nullptr,
+    CGAL_precondition_msg(std::get_if<Halfedge_const_handle>(&obj2) == nullptr,
                           "The curve must not overlap an existing edge.");
   }
   vh2 = Pl_result::template assign<Vertex_const_handle>(&obj2);
@@ -766,8 +766,8 @@ insert_non_intersecting_curve
       // we must insert the curve in the interior of a face.
       // In this case insert_in_face_interior() already returns a halfedge
       // directed from left to right.
-      const Face_const_handle* fh1 = std::get<Face_const_handle>(&obj1);
-      const Face_const_handle* fh2 = std::get<Face_const_handle>(&obj2);
+      const Face_const_handle* fh1 = std::get_if<Face_const_handle>(&obj1);
+      const Face_const_handle* fh2 = std::get_if<Face_const_handle>(&obj2);
 
       // std::cout << arr << std::endl;
       // std::cout << "(*fh1)->number_of_outer_ccbs(): "
@@ -1144,14 +1144,14 @@ insert_point(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 
   arr_access.notify_before_global_change();
 
-  const Face_const_handle* fh = std::get<Face_const_handle>(&obj);
+  const Face_const_handle* fh = std::get_if<Face_const_handle>(&obj);
   if (fh != nullptr) {
     // p lies inside a face: Insert it as an isolated vertex it the interior of
     // this face.
     vh_for_p = arr.insert_in_face_interior(p, arr.non_const_handle(*fh));
   }
   else {
-    const Halfedge_const_handle* hh = std::get<Halfedge_const_handle>(&obj);
+    const Halfedge_const_handle* hh = std::get_if<Halfedge_const_handle>(&obj);
     if (hh != nullptr) {
       // p lies in the interior of an edge: Split this edge to create a new
       // vertex associated with p.
@@ -1167,7 +1167,7 @@ insert_point(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
     }
     else {
       // p lies on an existing vertex, so we just update this vertex.
-      const Vertex_const_handle* vh = std::get<Vertex_const_handle>(&obj);
+      const Vertex_const_handle* vh = std::get_if<Vertex_const_handle>(&obj);
       CGAL_assertion(vh != nullptr);
       vh_for_p = arr.modify_vertex (arr.non_const_handle (*vh), p);
     }
@@ -1381,14 +1381,14 @@ is_valid(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr)
     auto obj = def_pl.ray_shoot_down(curr_v->point());
 
     // if (CGAL::assign(he_below, obj)) {
-    if (auto* he_below_p = std::get<Halfedge_const_handle>(&obj)) {
+    if (auto* he_below_p = std::get_if<Halfedge_const_handle>(&obj)) {
       // Hit an edge; take the incident face of the halfedge directed to the
       // right.
       auto he_below = *he_below_p;
       in_face = (he_below->direction() == ARR_RIGHT_TO_LEFT) ?
         he_below->twin()->face() : he_below->face();
     }
-    else if (auto* v_below_p = std::get<Vertex_const_handle>(&obj)) {
+    else if (auto* v_below_p = std::get_if<Vertex_const_handle>(&obj)) {
       auto v_below = *v_below_p;
       // Hit a vertex.
       if (v_below->is_isolated()) in_face = v_below->face();
@@ -1446,7 +1446,7 @@ is_valid(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr)
       }
     }
     else {
-      auto* in_face_p = std::get<Face_const_handle>(&obj);
+      auto* in_face_p = std::get_if<Face_const_handle>(&obj);
       CGAL_assertion(in_face_p);
       in_face = *in_face_p;
       // Hit nothing (an unbounded face is returned).
@@ -1596,20 +1596,20 @@ do_intersect(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
   // Insert each x-monotone curve into the arrangement.
   for (const auto& x_obj : x_objects) {
     // Act according to the type of the current object.
-    const X_monotone_curve_2* x_curve = std::get<X_monotone_curve_2>(&x_obj);
+    const X_monotone_curve_2* x_curve = std::get_if<X_monotone_curve_2>(&x_obj);
     if (x_curve != nullptr) {
       // Check if the x-monotone subcurve intersects the arrangement.
       if (do_intersect(arr, *x_curve, pl) == true) return true;
       continue;
     }
 
-    const Point_2* iso_p = std::get<Point_2>(&x_obj);
+    const Point_2* iso_p = std::get_if<Point_2>(&x_obj);
     CGAL_assertion(iso_p != nullptr);
 
     // Check whether the isolated point lies inside a face (otherwise,
     // it coincides with a vertex or an edge).
     auto obj = pl.locate(*iso_p);
-    if (std::get<Face_const_handle>(&x_obj) != nullptr) return true;
+    if (std::get_if<Face_const_handle>(&x_obj) != nullptr) return true;
   }
 
   // If we reached here, the curve does not intersect the arrangement.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h
index cbadba8f07ac..7ac1332586d8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h
@@ -2253,7 +2253,7 @@ _place_and_set_curve_end(DFace* f,
     return v;
   }
 
-  DHalfedge** fict_he_p = std::get<DHalfedge*>(&*obj);
+  DHalfedge** fict_he_p = std::get_if<DHalfedge*>(&*obj);
   if (fict_he_p != nullptr) {
     DHalfedge* fict_he = *fict_he_p;
     CGAL_assertion(fict_he != nullptr);
@@ -2273,7 +2273,7 @@ _place_and_set_curve_end(DFace* f,
                                         Halfedge_handle((*p_pred)->next()));
     return v;
   }
-  DVertex** v_p = std::get<DVertex*>(&*obj);
+  DVertex** v_p = std::get_if<DVertex*>(&*obj);
   CGAL_assertion(v_p != nullptr);
   DVertex* v = *v_p;
   CGAL_assertion(v != nullptr);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
index 484f2a46efe4..5d1e19f73c73 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
@@ -103,7 +103,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
   const Vertex_const_handle* vh;
   const Halfedge_const_handle* hh;
 
-  if ((vh = std::get<Vertex_const_handle>(&m_obj)) != nullptr) {
+  if ((vh = std::get_if<Vertex_const_handle>(&m_obj)) != nullptr) {
     CGAL_assertion(m_has_left_pt);
 
     // The left endpoint coincides with an existing vertex:
@@ -125,7 +125,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
 #endif
 
   }
-  else if ((hh = std::get<Halfedge_const_handle>(&m_obj)) != nullptr) {
+  else if ((hh = std::get_if<Halfedge_const_handle>(&m_obj)) != nullptr) {
     if (m_has_left_pt) {
       // Obtain the right halfedge from the halfedge-pair containing m_left_pt
       // in their interior.
@@ -166,7 +166,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
   }
   else {
     // The left endpoint lies inside a face.
-    const Face_const_handle* fh = std::get<Face_const_handle>(&m_obj);
+    const Face_const_handle* fh = std::get_if<Face_const_handle>(&m_obj);
 
     CGAL_assertion_msg(fh != nullptr,
                        "Invalid object returned by the point-location query.");
@@ -546,7 +546,7 @@ _compute_next_intersection(Halfedge_handle he,
     // (if the left point exists).
     while (! inter_list.empty()) {
       // Compare that current object with m_left_pt (if exists).
-      ip = std::get<Intersection_point>(&(inter_list.front()));
+      ip = std::get_if<Intersection_point>(&(inter_list.front()));
       if (ip != nullptr) {
         // We have an intersection point
         if (m_left_on_boundary) {
@@ -570,7 +570,7 @@ _compute_next_intersection(Halfedge_handle he,
       }
       else {
         // We have an overlapping subcurve.
-        icv = std::get<X_monotone_curve_2>(&(inter_list.front()));
+        icv = std::get_if<X_monotone_curve_2>(&(inter_list.front()));
         CGAL_assertion(icv != nullptr);
 
         if (is_closed(*icv, ARR_MIN_END)) {
@@ -608,7 +608,7 @@ _compute_next_intersection(Halfedge_handle he,
   // Discard all intersection lying to the left of m_left_pt (if exists).
   while (! inter_list.empty()) {
     // Compare that current object with m_left_pt (if exists).
-    ip = std::get<Intersection_point>(&(inter_list.front()));
+    ip = std::get_if<Intersection_point>(&(inter_list.front()));
 
     if (ip != nullptr) {
       // We have an intersection point -
@@ -638,7 +638,7 @@ _compute_next_intersection(Halfedge_handle he,
     }
     else {
       // We have an overlapping subcurve.
-      icv = std::get<X_monotone_curve_2>(&(inter_list.front()));
+      icv = std::get_if<X_monotone_curve_2>(&(inter_list.front()));
       CGAL_assertion(icv != nullptr);
 
       if (is_closed(*icv, ARR_MIN_END)) {
@@ -832,7 +832,7 @@ _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
   if (iobj) {
     // We have found an intersection (either a simple point or an
     // overlapping x-monotone curve).
-    const Intersection_point* int_p = std::get<Intersection_point>(&*iobj);
+    const Intersection_point* int_p = std::get_if<Intersection_point>(&*iobj);
     if (int_p != nullptr) {
       Point_2 ip = int_p->first;
 
@@ -854,7 +854,7 @@ _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
     else {
       // We have located an overlapping curve. Assign ip as its left
       // endpoint.
-      const X_monotone_curve_2* icv = std::get<X_monotone_curve_2>(&*iobj);
+      const X_monotone_curve_2* icv = std::get_if<X_monotone_curve_2>(&*iobj);
       CGAL_assertion(icv != nullptr);
       Point_2 ip = min_vertex(*icv);
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_insertion_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_insertion_traits_2.h
index b7c2907bf583..0abc509bcd59 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_insertion_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_insertion_traits_2.h
@@ -120,13 +120,13 @@ class Arr_insertion_traits_2 :
       // X_monotone_curve_2
       for (const auto& xection : xections) {
         const Intersection_point*
-          p_p = std::get<Intersection_point>(&xection);
+          p_p = std::get_if<Intersection_point>(&xection);
         if (p_p != nullptr) {
-          *oi++ = Intersection_result(xection);
+          *oi++ = Intersection_result(*p_p);
           continue;
         }
         const Base_x_monotone_curve_2* base_cv_p =
-          std::get<Base_x_monotone_curve_2>(&xection);
+          std::get_if<Base_x_monotone_curve_2>(&xection);
         CGAL_assertion(base_cv_p);
 
         // Add halfedge handles to the resulting curve.
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
index e0b85f393906..30c8b38b4a0d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
@@ -937,8 +937,8 @@ _map_boundary_vertices(Event* event, Vertex_handle v, boost::mpl::bool_<true>)
     const Cell_handle_red* red_handle_p = pt.red_cell_handle();
     if (red_handle_p) info.first = *red_handle_p;
 
-    if (!std::get<Face_handle_red>(&(info.first)) &&
-        !std::get<Face_handle_blue>(&(info.second)))
+    if (!std::get_if<Face_handle_red>(&(info.first)) &&
+        !std::get_if<Face_handle_blue>(&(info.second)))
     {
       // If both, the red and blue, variants do not represent face handles,
       // they must represt either vertex or edge handles. In this case it is
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
index e981e5326581..3067ba6715d3 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
@@ -323,14 +323,14 @@ class Arr_overlay_traits_2 {
     /*! Obtain the red vertex handle or nullptr if it doesn't exist. */
     const Vertex_handle_red* red_vertex_handle() const
     {
-      return m_red_cell ? std::get<Vertex_handle_red>(&(*m_red_cell)) : nullptr;
+      return m_red_cell ? std::get_if<Vertex_handle_red>(&(*m_red_cell)) : nullptr;
     }
 
     /*! Obtain the blue vertex handle or nullptr if it doesn't exist. */
     const Vertex_handle_blue* blue_vertex_handle() const
     {
       return
-        m_blue_cell ? std::get<Vertex_handle_blue>(&(*m_blue_cell)) : nullptr;
+        m_blue_cell ? std::get_if<Vertex_handle_blue>(&(*m_blue_cell)) : nullptr;
     }
   };
 
@@ -440,7 +440,7 @@ class Arr_overlay_traits_2 {
       // the extended X_monotone_curve_2.
       for (const auto& xection : xections) {
         const Intersection_base_point* base_ipt =
-          std::get<Intersection_base_point>(&xection);
+          std::get_if<Intersection_base_point>(&xection);
         if (base_ipt != nullptr) {
           // We have a red-blue intersection point, so we attach the
           // intersecting red and blue halfedges to it.
@@ -470,7 +470,7 @@ class Arr_overlay_traits_2 {
         }
 
         const Base_x_monotone_curve_2* overlap_xcv =
-          std::get<Base_x_monotone_curve_2>(&xection);
+          std::get_if<Base_x_monotone_curve_2>(&xection);
         CGAL_assertion(overlap_xcv != nullptr);
 
         // We have a red-blue overlap, so we mark the curve accordingly.
diff --git a/Visibility_2/examples/Visibility_2/simple_polygon_visibility_2.cpp b/Visibility_2/examples/Visibility_2/simple_polygon_visibility_2.cpp
index 9df70f7f868d..dc23e31bfaff 100644
--- a/Visibility_2/examples/Visibility_2/simple_polygon_visibility_2.cpp
+++ b/Visibility_2/examples/Visibility_2/simple_polygon_visibility_2.cpp
@@ -38,7 +38,7 @@ int main() {
   CGAL::Arr_naive_point_location<Arrangement_2> pl(env);
   CGAL::Arr_point_location_result<Arrangement_2>::Type obj = pl.locate(q);
   // The query point locates in the interior of a face
-  face = std::get<Arrangement_2::Face_const_handle> (&obj);
+  face = std::get_if<Arrangement_2::Face_const_handle> (&obj);
 
   // compute non regularized visibility area
   // Define visibility object type that computes non-regularized visibility area

From 522183bd002fce8c6b013761a094ee959a342fbe Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 15 Jun 2023 16:08:55 +0200
Subject: [PATCH 0370/1398] add version_enforcer.h to ease the use of forked
 headers in external code

---
 Installation/include/CGAL/config.h           |  1 +
 Installation/include/CGAL/version_enforcer.h | 41 ++++++++++++++++++++
 2 files changed, 42 insertions(+)
 create mode 100644 Installation/include/CGAL/version_enforcer.h

diff --git a/Installation/include/CGAL/config.h b/Installation/include/CGAL/config.h
index af4a81c86070..f37531001398 100644
--- a/Installation/include/CGAL/config.h
+++ b/Installation/include/CGAL/config.h
@@ -117,6 +117,7 @@
 #include <boost/version.hpp>
 
 #include <CGAL/version.h>
+#include <CGAL/version_enforcer.h>
 
 //----------------------------------------------------------------------//
 //  platform specific workaround flags (CGAL_CFG_...)
diff --git a/Installation/include/CGAL/version_enforcer.h b/Installation/include/CGAL/version_enforcer.h
new file mode 100644
index 000000000000..a07979fb1f62
--- /dev/null
+++ b/Installation/include/CGAL/version_enforcer.h
@@ -0,0 +1,41 @@
+// Copyright (c) 2023 GeometryFactory.
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : -
+
+#ifndef CGAL_VERSION_ENFORCER_H
+#define CGAL_VERSION_ENFORCER_H
+
+#include <CGAL/version_macros.h>
+
+// All files including this header are meant to work with a given version of CGAL
+// When using forked headers, set the 4 following macros to the version of CGAL
+// you want to use.
+#define CGAL_AUTHORIZED_VERSION CGAL_VERSION_STR
+#define CGAL_AUTHORIZED_VERSION_MAJOR CGAL_VERSION_MAJOR
+#define CGAL_AUTHORIZED_VERSION_MINOR CGAL_VERSION_MINOR
+#define CGAL_AUTHORIZED_VERSION_PATCH CGAL_VERSION_PATCH
+
+// Check that the version of CGAL used is the one expected
+#if (CGAL_VERSION_MAJOR != CGAL_AUTHORIZED_VERSION_MAJOR)
+#pragma message "You are using CGAL version: " CGAL_STR(CGAL_VERSION) "."
+#error This header is meant to be with used with CGAL 5.5 only.
+#endif
+
+#if (CGAL_VERSION_MINOR != CGAL_AUTHORIZED_VERSION_MINOR)
+#pragma message "You are using CGAL version: " CGAL_STR(CGAL_VERSION) "."
+#error This header is meant to be with used with CGAL 5.5 only.
+#endif
+
+#if (CGAL_VERSION_PATCH != CGAL_AUTHORIZED_VERSION_PATCH)
+#pragma message "You are using CGAL version: " CGAL_STR(CGAL_VERSION) "."
+#error This header is meant to be with used with CGAL 5.5 only.
+#endif
+
+#endif // CGAL_VERSION_ENFORCER_H

From 5a7f0252ac2b13481f6d6a0db9dc2150e3a463c5 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 15 Jun 2023 16:27:08 +0200
Subject: [PATCH 0371/1398] fix error message

---
 Installation/include/CGAL/version_enforcer.h | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Installation/include/CGAL/version_enforcer.h b/Installation/include/CGAL/version_enforcer.h
index a07979fb1f62..c5c1181cee4f 100644
--- a/Installation/include/CGAL/version_enforcer.h
+++ b/Installation/include/CGAL/version_enforcer.h
@@ -17,7 +17,7 @@
 // All files including this header are meant to work with a given version of CGAL
 // When using forked headers, set the 4 following macros to the version of CGAL
 // you want to use.
-#define CGAL_AUTHORIZED_VERSION CGAL_VERSION_STR
+#define CGAL_AUTHORIZED_VERSION_STR CGAL_VERSION_STR
 #define CGAL_AUTHORIZED_VERSION_MAJOR CGAL_VERSION_MAJOR
 #define CGAL_AUTHORIZED_VERSION_MINOR CGAL_VERSION_MINOR
 #define CGAL_AUTHORIZED_VERSION_PATCH CGAL_VERSION_PATCH
@@ -25,17 +25,17 @@
 // Check that the version of CGAL used is the one expected
 #if (CGAL_VERSION_MAJOR != CGAL_AUTHORIZED_VERSION_MAJOR)
 #pragma message "You are using CGAL version: " CGAL_STR(CGAL_VERSION) "."
-#error This header is meant to be with used with CGAL 5.5 only.
+#error This header is meant to be with used with CGAL "CGAL_AUTHORIZED_VERSION_STR" only."
 #endif
 
 #if (CGAL_VERSION_MINOR != CGAL_AUTHORIZED_VERSION_MINOR)
 #pragma message "You are using CGAL version: " CGAL_STR(CGAL_VERSION) "."
-#error This header is meant to be with used with CGAL 5.5 only.
+#error This header is meant to be with used with CGAL "CGAL_AUTHORIZED_VERSION_STR" only.
 #endif
 
 #if (CGAL_VERSION_PATCH != CGAL_AUTHORIZED_VERSION_PATCH)
 #pragma message "You are using CGAL version: " CGAL_STR(CGAL_VERSION) "."
-#error This header is meant to be with used with CGAL 5.5 only.
+#error This header is meant to be with used with CGAL "CGAL_AUTHORIZED_VERSION_STR" only."
 #endif
 
 #endif // CGAL_VERSION_ENFORCER_H

From 11a5b394b844d4d49c8fa4b0343240cb7200cc8f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 15 Jun 2023 18:44:20 +0200
Subject: [PATCH 0372/1398] use Range::size()

---
 BGL/include/CGAL/boost/graph/Dual.h    |  2 +-
 BGL/test/BGL/test_Euler_operations.cpp | 20 ++++++++++----------
 2 files changed, 11 insertions(+), 11 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/Dual.h b/BGL/include/CGAL/boost/graph/Dual.h
index 1255e0b08d93..7d7481b1625d 100644
--- a/BGL/include/CGAL/boost/graph/Dual.h
+++ b/BGL/include/CGAL/boost/graph/Dual.h
@@ -458,7 +458,7 @@ out_degree(typename boost::graph_traits<Dual<P> >::vertex_descriptor v,
            const Dual<P>& dual)
 {
   const typename Dual<P>::Primal& primal = dual.primal();
-  return std::distance(halfedges_around_face(halfedge(v,primal),primal));
+  return halfedges_around_face(halfedge(v,primal),primal).size();
 }
 
  template <typename P>
diff --git a/BGL/test/BGL/test_Euler_operations.cpp b/BGL/test/BGL/test_Euler_operations.cpp
index a72d33306476..fe7c3275dd12 100644
--- a/BGL/test/BGL/test_Euler_operations.cpp
+++ b/BGL/test/BGL/test_Euler_operations.cpp
@@ -270,8 +270,8 @@ join_vertex_interior_test()
   assert(CGAL::internal::exact_num_faces(f.m) == 2);
   assert(CGAL::internal::exact_num_vertices(f.m) == 5);
   assert(CGAL::internal::exact_num_edges(f.m) == 6);
-  assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m)) == 3);
-  assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m)) == 3);
+  assert(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m).size() == 3);
+  assert(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m).size() == 3);
   assert(degree(f.x, f.m) == 4);
   assert(CGAL::is_valid_polygon_mesh(f.m));
 }
@@ -295,8 +295,8 @@ join_vertex_exterior_test()
     assert(CGAL::internal::exact_num_faces(f.m) == 2);
     assert(CGAL::internal::exact_num_vertices(f.m) == 5);
     assert(CGAL::internal::exact_num_edges(f.m) == 6);
-    assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m)) == 4);
-    assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m)) == 3);
+    assert(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m).size() == 4);
+    assert(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m).size() == 3);
     assert(degree(f.y, f.m) == 3);
     assert(CGAL::is_valid_polygon_mesh(f.m));
   }
@@ -314,8 +314,8 @@ join_vertex_exterior_test()
     assert(CGAL::internal::exact_num_faces(f.m) == 2);
     assert(CGAL::internal::exact_num_vertices(f.m) == 5);
     assert(CGAL::internal::exact_num_edges(f.m) == 6);
-    assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m)) == 4);
-    assert(std::distance(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m)) == 3);
+    assert(CGAL::halfedges_around_face(halfedge(f.f1, f.m), f.m).size() == 4);
+    assert(CGAL::halfedges_around_face(halfedge(f.f2, f.m), f.m).size() == 3);
 
     assert(CGAL::is_valid_polygon_mesh(f.m));
     assert(degree(f.w, f.m) == 3);
@@ -344,8 +344,8 @@ split_vertex()
   assert(CGAL::is_valid_polygon_mesh(f.m));
   assert(CGAL::internal::exact_num_vertices(f.m) == 7);
   assert(CGAL::internal::exact_num_edges(f.m) == 8);
-  assert(std::distance(CGAL::halfedges_around_face(h1, f.m)) == 5);
-  assert(std::distance(CGAL::halfedges_around_face(h2, f.m)) == 7);
+  assert(CGAL::halfedges_around_face(h1, f.m).size() == 5);
+  assert(CGAL::halfedges_around_face(h2, f.m).size() == 7);
 }
 
 template <typename T>
@@ -371,8 +371,8 @@ split_join_vertex_inverse()
   assert(CGAL::internal::exact_num_faces(f.m) == 2);
   assert(CGAL::internal::exact_num_edges(f.m) == 6);
   assert(CGAL::internal::exact_num_halfedges(f.m) == 12);
-  assert(std::distance(CGAL::halfedges_around_face(h1, f.m)) == 3);
-  assert(std::distance(CGAL::halfedges_around_face(h2, f.m)) == 3);
+  assert(CGAL::halfedges_around_face(h1, f.m).size() == 3);
+  assert(CGAL::halfedges_around_face(h2, f.m).size() == 3);
 }
 
 

From 0ee31a5d4fd8b3290351902baeca75829a869cad Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 19 Jun 2023 19:17:49 +0200
Subject: [PATCH 0373/1398] remove extra parenthesis

---
 .../internal/AABB_ray_intersection.h          |  2 +-
 .../Algebraic_foundations/fraction_traits.cpp |  4 +-
 .../Algebraic_foundations/interoperable.cpp   |  2 +-
 .../include/CGAL/Algebraic_structure_traits.h |  3 +-
 .../include/CGAL/Coercion_traits.h            |  4 +-
 .../include/CGAL/Scalar_factor_traits.h       |  4 +-
 .../CGAL/Test/_test_algebraic_structure.h     | 45 ++++++------
 .../include/CGAL/Test/_test_coercion_traits.h |  6 +-
 .../include/CGAL/Test/_test_fraction_traits.h | 10 +--
 .../include/CGAL/Test/_test_rational_traits.h |  2 +-
 .../include/CGAL/Test/_test_real_embeddable.h | 16 ++---
 .../Algebraic_extension_traits.cpp            | 20 +++---
 .../Algebraic_structure_traits.cpp            |  6 +-
 .../Algebraic_foundations/Coercion_traits.cpp | 19 ++----
 .../Real_embeddable_traits.cpp                |  4 +-
 .../Scalar_factor_traits.cpp                  | 16 ++---
 .../Algebraic_curve_kernel_2.h                | 24 +++----
 .../algebraic_curve_kernel_2_tools.h          |  8 +--
 .../Real_embeddable_traits_extension.cpp      | 16 ++---
 .../CGAL/_test_algebraic_curve_kernel_2.h     | 16 ++---
 .../include/CGAL/_test_algebraic_kernel_1.h   | 10 +--
 .../include/CGAL/_test_algebraic_kernel_2.h   | 22 +++---
 .../include/CGAL/_test_real_comparable.h      | 16 ++---
 Alpha_shapes_2/include/CGAL/Alpha_shape_2.h   |  4 +-
 .../Alpha_shapes_2/internal/Lazy_alpha_nt_2.h |  8 +--
 Alpha_shapes_3/include/CGAL/Alpha_shape_3.h   |  4 +-
 .../Alpha_shapes_3/internal/Lazy_alpha_nt_3.h |  8 +--
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h |  2 +-
 .../internal/Triangle_mesh_oracle.h           |  2 +-
 .../internal/Triangle_soup_oracle.h           |  2 +-
 .../Get_arithmetic_kernel.cpp                 |  6 +-
 .../Arr_bounded_planar_topology_traits_2.h    |  8 +--
 .../include/CGAL/Arr_overlay_2.h              |  8 +--
 .../CGAL/Arr_rat_arc/Base_rational_arc_ds_1.h |  6 +-
 .../CGAL/Arr_rat_arc/Rational_arc_d_1.h       |  6 +-
 .../CGAL/Arr_spherical_topology_traits_2.h    | 16 ++---
 .../CGAL/Arr_unb_planar_topology_traits_2.h   | 16 ++---
 .../include/CGAL/Arrangement_on_surface_2.h   |  4 +-
 .../include/CGAL/Arrangement_zone_2.h         |  4 +-
 .../graph/IO/Generic_facegraph_builder.h      |  8 +--
 BGL/test/BGL/test_Properties.cpp              |  8 +--
 .../Gps_agg_meta_traits.h                     | 16 ++---
 .../Gps_traits_decorator.h                    | 16 ++---
 Circulator/include/CGAL/circulator.h          | 14 ++--
 .../include/CGAL/Cell_iterators.h             | 12 ++--
 .../include/CGAL/Combinatorial_map.h          |  4 +-
 .../CGAL/Combinatorial_map_basic_operations.h | 16 ++---
 .../CGAL/Combinatorial_map_iterators_base.h   | 12 ++--
 .../quick_hull_default_traits.cpp             | 14 ++--
 .../include/CGAL/GMap_cell_iterators.h        |  8 +--
 .../include/CGAL/GMap_dart_iterators.h        |  6 +-
 .../include/CGAL/Generalized_map.h            |  4 +-
 .../CGAL/Generalized_map_iterators_base.h     |  4 +-
 .../Surface_mesh_geodesic_distances_3.h       |  4 +-
 .../Installation/test_configuration_qt5.cpp   |  2 +-
 .../include/CGAL/Intersection_traits.h        |  6 +-
 .../internal/Bbox_3_Segment_3_do_intersect.h  |  2 +-
 .../Test/_test_bigfloat_interval_traits.h     |  2 +-
 .../include/CGAL/Test/_test_convert_to_bfi.h  |  2 +-
 .../include/CGAL/Test/_test_interval_traits.h |  4 +-
 Kernel_23/include/CGAL/Circle_2.h             |  2 +-
 Kernel_23/include/CGAL/Circle_3.h             |  2 +-
 Kernel_23/include/CGAL/Direction_2.h          |  2 +-
 Kernel_23/include/CGAL/Direction_3.h          |  2 +-
 Kernel_23/include/CGAL/Has_conversion.h       | 12 ++--
 Kernel_23/include/CGAL/Iso_cuboid_3.h         |  2 +-
 Kernel_23/include/CGAL/Iso_rectangle_2.h      |  2 +-
 Kernel_23/include/CGAL/Line_2.h               |  2 +-
 Kernel_23/include/CGAL/Line_3.h               |  2 +-
 Kernel_23/include/CGAL/Plane_3.h              |  2 +-
 Kernel_23/include/CGAL/Point_2.h              |  2 +-
 Kernel_23/include/CGAL/Point_3.h              |  2 +-
 Kernel_23/include/CGAL/Ray_2.h                |  2 +-
 Kernel_23/include/CGAL/Ray_3.h                |  2 +-
 Kernel_23/include/CGAL/Segment_2.h            |  2 +-
 Kernel_23/include/CGAL/Segment_3.h            |  2 +-
 Kernel_23/include/CGAL/Sphere_3.h             |  2 +-
 Kernel_23/include/CGAL/Tetrahedron_3.h        |  2 +-
 Kernel_23/include/CGAL/Triangle_2.h           |  2 +-
 Kernel_23/include/CGAL/Triangle_3.h           |  2 +-
 Kernel_23/include/CGAL/Vector_2.h             |  2 +-
 Kernel_23/include/CGAL/Vector_3.h             |  2 +-
 Kernel_23/include/CGAL/Weighted_point_2.h     |  2 +-
 Kernel_23/include/CGAL/Weighted_point_3.h     |  2 +-
 .../Kernel_23/test_RT_or_FT_predicates.cpp    |  4 +-
 .../include/CGAL/Compact_mesh_cell_base_3.h   |  4 +-
 Mesh_3/include/CGAL/Mesh_criteria_3.h         |  8 +--
 .../test/Mesh_3/test_meshing_polyhedron.cpp   |  4 +-
 Nef_2/include/CGAL/Nef_2/PM_overlayer.h       |  2 +-
 .../CGAL/NewKernel_d/Kernel_d_interface.h     |  4 +-
 .../CGAL/NewKernel_d/Wrapper/Hyperplane_d.h   |  2 +-
 .../CGAL/NewKernel_d/Wrapper/Point_d.h        |  2 +-
 .../CGAL/NewKernel_d/Wrapper/Ref_count_obj.h  |  2 +-
 .../CGAL/NewKernel_d/Wrapper/Segment_d.h      |  2 +-
 .../CGAL/NewKernel_d/Wrapper/Sphere_d.h       |  2 +-
 .../CGAL/NewKernel_d/Wrapper/Vector_d.h       |  2 +-
 NewKernel_d/test/NewKernel_d/Epick_d.cpp      | 10 +--
 Number_types/include/CGAL/Lazy_exact_nt.h     |  8 +--
 Number_types/include/CGAL/Root_of_traits.h    |  2 +-
 .../include/CGAL/Test/test_root_of_traits.h   | 12 ++--
 .../CGAL/simplest_rational_in_interval.h      |  4 +-
 Number_types/include/CGAL/to_rational.h       |  4 +-
 .../test/Number_types/Lazy_exact_nt_new.cpp   | 10 +--
 .../test/Number_types/Quotient_new.cpp        |  6 +-
 .../test/Number_types/Sqrt_extension.h        |  8 +--
 .../include/CGAL/Test/test_root_of_2_traits.h |  6 +-
 .../internal/optimize_2.h                     |  2 +-
 .../oriented_bounding_box.h                   |  2 +-
 .../compute_registration_transformation.h     |  8 +--
 .../include/CGAL/OpenGR/register_point_sets.h |  8 +--
 .../compute_registration_transformation.h     | 12 ++--
 .../include/CGAL/structure_point_set.h        |  2 +-
 .../CGAL/Polygon_mesh_processing/clip.h       |  4 +-
 .../connected_components.h                    |  2 +-
 .../Polygon_mesh_processing/corefinement.h    |  8 +--
 .../CGAL/Polygon_mesh_processing/distance.h   |  2 +-
 .../intersect_triangle_and_segment_3.h        |  2 +-
 .../Corefinement/intersection_nodes.h         | 12 ++--
 .../intersection_of_coplanar_triangles_3.h    |  4 +-
 .../internal/Snapping/snap_vertices.h         |  2 +-
 .../Polygon_mesh_processing/intersection.h    |  6 +-
 .../CGAL/Polygon_mesh_processing/locate.h     |  4 +-
 .../CGAL/Polygon_mesh_processing/measure.h    |  4 +-
 .../orient_polygon_soup_extension.h           |  4 +-
 .../polygon_mesh_to_polygon_soup.h            |  2 +-
 .../polygon_soup_to_polygon_mesh.h            |  2 +-
 .../repair_self_intersections.h               |  2 +-
 .../Rigid_triangle_mesh_collision_detection.h |  4 +-
 .../Polyhedral_envelope_filter.h              |  2 +-
 .../test_pmp_locate.cpp                       |  4 +-
 Polynomial/include/CGAL/Exponent_vector.h     |  2 +-
 .../Polynomial/Algebraic_structure_traits.h   |  4 +-
 .../include/CGAL/Polynomial/Polynomial_type.h |  4 +-
 Polynomial/include/CGAL/Polynomial_traits_d.h |  2 +-
 .../CGAL/Test/_test_polynomial_traits_d.h     | 68 +++++++++----------
 .../Polynomial/Polynomial_type_generator.cpp  |  6 +-
 Polynomial/test/Polynomial/test_polynomial.h  |  6 +-
 .../test_polynomial_Coercion_traits.cpp       |  4 +-
 .../test_polynomial_Get_arithmetic_kernel.cpp |  4 +-
 Ridges_3/include/CGAL/Ridges.h                |  8 +--
 Ridges_3/include/CGAL/Umbilics.h              |  8 +--
 .../include/CGAL/Handle_with_policy.h         | 12 ++--
 .../include/CGAL/Named_function_parameters.h  |  4 +-
 .../include/CGAL/transforming_pair_iterator.h |  2 +-
 .../test/STL_Extension/test_Cache.cpp         | 12 ++--
 .../STL_Extension/test_cgal_named_params.cpp  | 18 ++---
 .../test/STL_Extension/test_is_iterator.cpp   | 12 ++--
 .../test/STL_Extension/test_is_streamable.cpp |  4 +-
 .../test/STL_Extension/test_stl_extension.cpp | 18 ++---
 .../Shape_regularization/regularize_planes.h  |  2 +-
 .../include/CGAL/Snap_rounding_kd_2.h         |  2 +-
 .../Bounded_distance_placement.h              |  2 +-
 .../Edge_collapse/FastEnvelope_filter.h       |  2 +-
 .../CGAL/Surface_mesher/Combining_oracle.h    |  4 +-
 .../CGAL/No_intersection_surface_sweep_2.h    |  4 +-
 .../CGAL/Delaunay_triangulation_on_sphere_2.h |  4 +-
 156 files changed, 510 insertions(+), 521 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
index ff091ce6c24b..87ebbe012ab8 100644
--- a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
+++ b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_ray_intersection.h
@@ -201,7 +201,7 @@ template<typename Ray, typename SkipFunctor>
 boost::optional< typename AABB_tree<AABBTraits>::template Intersection_and_primitive_id<Ray>::Type >
 AABB_tree<AABBTraits>::first_intersection(const Ray& query,
                                           const SkipFunctor& skip) const {
-  static_assert((std::is_same<Ray, typename AABBTraits::Ray_3>::value),
+  static_assert(std::is_same<Ray, typename AABBTraits::Ray_3>::value,
                             "Ray and Ray_3 must be the same type");
 
   switch(size()) // copy-paste from AABB_tree::traversal
diff --git a/Algebraic_foundations/examples/Algebraic_foundations/fraction_traits.cpp b/Algebraic_foundations/examples/Algebraic_foundations/fraction_traits.cpp
index 42c1e8d92883..4ecbef7420c7 100644
--- a/Algebraic_foundations/examples/Algebraic_foundations/fraction_traits.cpp
+++ b/Algebraic_foundations/examples/Algebraic_foundations/fraction_traits.cpp
@@ -9,8 +9,8 @@ int main(){
     typedef FT::Numerator_type Numerator_type;
     typedef FT::Denominator_type Denominator_type;
 
-    static_assert((std::is_same<Numerator_type,CGAL::Gmpz>::value));
-    static_assert((std::is_same<Denominator_type,CGAL::Gmpz>::value));
+    static_assert(std::is_same<Numerator_type,CGAL::Gmpz>::value);
+    static_assert(std::is_same<Denominator_type,CGAL::Gmpz>::value);
 
     Numerator_type numerator;
     Denominator_type denominator;
diff --git a/Algebraic_foundations/examples/Algebraic_foundations/interoperable.cpp b/Algebraic_foundations/examples/Algebraic_foundations/interoperable.cpp
index 0963f5f9d368..e85c2e8d73b8 100644
--- a/Algebraic_foundations/examples/Algebraic_foundations/interoperable.cpp
+++ b/Algebraic_foundations/examples/Algebraic_foundations/interoperable.cpp
@@ -9,7 +9,7 @@ binary_func(const A& a , const B& b){
     typedef CGAL::Coercion_traits<A,B> CT;
 
     // check for explicit interoperability
-    static_assert((CT::Are_explicit_interoperable::value));
+    static_assert(CT::Are_explicit_interoperable::value);
 
     // CT::Cast is used to to convert both types into the coercion type
     typename CT::Cast cast;
diff --git a/Algebraic_foundations/include/CGAL/Algebraic_structure_traits.h b/Algebraic_foundations/include/CGAL/Algebraic_structure_traits.h
index a632e12a1972..e0d5eee6706c 100644
--- a/Algebraic_foundations/include/CGAL/Algebraic_structure_traits.h
+++ b/Algebraic_foundations/include/CGAL/Algebraic_structure_traits.h
@@ -353,8 +353,7 @@ class Algebraic_structure_traits_base< Type_,
             typedef Coercion_traits< NT1, NT2 > CT;
             typedef typename CT::Type Coercion_type_NT1_NT2;
             CGAL_USE_TYPE(Coercion_type_NT1_NT2);
-            static_assert((
-              ::std::is_same<Coercion_type_NT1_NT2 , Type >::value));
+            static_assert(::std::is_same<Coercion_type_NT1_NT2 , Type >::value);
 
             typename Coercion_traits< NT1, NT2 >::Cast cast;
             operator()( cast(x), cast(y), q, r );
diff --git a/Algebraic_foundations/include/CGAL/Coercion_traits.h b/Algebraic_foundations/include/CGAL/Coercion_traits.h
index 09c387b5a092..f6c9092dec6e 100644
--- a/Algebraic_foundations/include/CGAL/Coercion_traits.h
+++ b/Algebraic_foundations/include/CGAL/Coercion_traits.h
@@ -35,9 +35,9 @@
 #define CGAL_IMPLICIT_INTEROPERABLE_BINARY_OPERATOR_WITH_RT( NT, Result_type  ) \
   template < class CT_Type_1, class CT_Type_2 >                         \
   Result_type operator()( const CT_Type_1& x, const CT_Type_2& y ) const { \
-    static_assert((::std::is_same<                              \
+    static_assert(::std::is_same<                              \
             typename Coercion_traits< CT_Type_1, CT_Type_2 >::Type, NT  \
-            >::value));                                                 \
+            >::value) ;                                                 \
                                                                         \
     typename Coercion_traits< CT_Type_1, CT_Type_2 >::Cast cast;        \
     return operator()( cast(x), cast(y) );                              \
diff --git a/Algebraic_foundations/include/CGAL/Scalar_factor_traits.h b/Algebraic_foundations/include/CGAL/Scalar_factor_traits.h
index 2d7840511976..5453868a1324 100644
--- a/Algebraic_foundations/include/CGAL/Scalar_factor_traits.h
+++ b/Algebraic_foundations/include/CGAL/Scalar_factor_traits.h
@@ -85,13 +85,13 @@ class Scalar_factor_traits {
 
         // determine extractable scalar factor
         Scalar operator () (const NT& a) {
-            static_assert(( ::std::is_same< NT,Scalar >::value));
+            static_assert(::std::is_same< NT,Scalar >::value);
             typedef typename Algebraic_structure_traits<NT>::Algebraic_category SAT;
             return scalar_factor(a, SAT());
         }
         // determine extractable scalar factor
         Scalar operator () (const NT& a, const Scalar& d) {
-            static_assert(( ::std::is_same< NT,Scalar >::value));
+            static_assert(::std::is_same< NT,Scalar >::value);
             typedef typename Algebraic_structure_traits<NT>::Algebraic_category SAT;
             return scalar_factor(a,d,SAT());
         }
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h b/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h
index 68970af7441c..82483c0dccee 100644
--- a/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h
+++ b/Algebraic_foundations/include/CGAL/Test/_test_algebraic_structure.h
@@ -44,7 +44,7 @@
 template <typename AdaptableFunctor, typename ResultType>
 void check_result_type(AdaptableFunctor, ResultType){
   typedef typename AdaptableFunctor::result_type result_type;
-  static_assert((::std::is_same<result_type,ResultType>::value));
+  static_assert(::std::is_same<result_type,ResultType>::value);
   CGAL_USE_TYPE(result_type);
 }
 // check nothing for CGAL::Null_functor
@@ -122,12 +122,11 @@ void test_algebraic_structure_intern( const CGAL::Integral_domain_tag& ) {
     CGAL_SNAP_AST_FUNCTORS(AST);
 
     using CGAL::Null_functor;
-    static_assert(
-        (!::std::is_same< Integral_division, Null_functor >::value));
-    static_assert((!::std::is_same< Divides, Null_functor >::value));
-    static_assert((!::std::is_same< Is_zero, Null_functor >::value));
-    static_assert((!::std::is_same< Is_one, Null_functor >::value));
-    static_assert((!::std::is_same< Square, Null_functor >::value));
+    static_assert(!::std::is_same< Integral_division, Null_functor >::value);
+    static_assert(!::std::is_same< Divides, Null_functor >::value);
+    static_assert(!::std::is_same< Is_zero, Null_functor >::value);
+    static_assert(!::std::is_same< Is_one, Null_functor >::value);
+    static_assert(!::std::is_same< Square, Null_functor >::value);
 
     // functor
     const Is_zero is_zero = Is_zero();
@@ -206,7 +205,7 @@ void test_algebraic_structure_intern(
     CGAL_SNAP_AST_FUNCTORS(AST);
 
     using CGAL::Null_functor;
-    static_assert((!::std::is_same< Gcd, Null_functor>::value));
+    static_assert(!::std::is_same< Gcd, Null_functor>::value);
 
     const Gcd gcd = Gcd();
     assert( gcd(  AS ( 0), AS ( 0))  ==  unit_normal( AS (0) ) );
@@ -268,9 +267,9 @@ void test_algebraic_structure_intern( const CGAL::Euclidean_ring_tag&) {
     CGAL_SNAP_AST_FUNCTORS(AST);
 
     using CGAL::Null_functor;
-    static_assert((!::std::is_same< Div,     Null_functor>::value));
-    static_assert((!::std::is_same< Mod,     Null_functor>::value));
-    static_assert((!::std::is_same< Div_mod, Null_functor>::value));
+    static_assert(!::std::is_same< Div,     Null_functor>::value);
+    static_assert(!::std::is_same< Mod,     Null_functor>::value);
+    static_assert(!::std::is_same< Div_mod, Null_functor>::value);
 
     const Div     div=Div();
     const Mod     mod=Mod();
@@ -387,7 +386,7 @@ void test_algebraic_structure_intern( const CGAL::Field_with_sqrt_tag& ) {
 
     CGAL_SNAP_AST_FUNCTORS(AST);
 
-    static_assert((!::std::is_same< Sqrt, Null_functor>::value));
+    static_assert(!::std::is_same< Sqrt, Null_functor>::value);
     const Sqrt sqrt =Sqrt();
     AS  a(4);
 
@@ -617,7 +616,7 @@ class Test_is_square {
                 ( ::std::is_same< AS , First_argument_type>::value));
         static_assert(
                 ( ::std::is_same< AS& , Second_argument_type>::value));
-        //static_assert(( ::std::is_same< bool , Result_type>::value));
+        //static_assert(::std::is_same< bool , Result_type>::value);
         bool b = Result_type(true); CGAL_USE(b);
 
         AS test_number = AS(3)*AS(3);
@@ -649,8 +648,8 @@ class Test_sqrt {
         typedef typename Sqrt::result_type   Result_type;
         CGAL_USE_TYPE(Argument_type);
         CGAL_USE_TYPE(Result_type);
-        static_assert(( ::std::is_same< AS , Argument_type>::value));
-        static_assert(( ::std::is_same< AS , Result_type>::value));
+        static_assert(::std::is_same< AS , Argument_type>::value);
+        static_assert(::std::is_same< AS , Result_type>::value);
         typedef Algebraic_structure_traits<AS> AST;
         typedef typename AST::Is_exact Is_exact;
         assert( !Is_exact::value ||  AS (3) == sqrt( AS (9)));
@@ -803,7 +802,7 @@ void test_algebraic_structure(){
     typedef CGAL::Algebraic_structure_traits<  AS  > AST;
     CGAL_SNAP_AST_FUNCTORS(AST);
 
-    static_assert((::std::is_same<AS,typename AST::Type>::value));
+    static_assert(::std::is_same<AS,typename AST::Type>::value);
 
     typedef typename AST::Boolean Boolean;
     assert(!Boolean());
@@ -816,14 +815,12 @@ void test_algebraic_structure(){
     using CGAL::Integral_domain_without_division_tag;
     using CGAL::Null_functor;
     // Test for desired exactness
-    static_assert(
-            ( ::std::is_same< typename AST::Is_exact, Is_exact >::value));
-
-    static_assert(( ::boost::is_convertible< Tag,
-                    Integral_domain_without_division_tag >::value ));
-    static_assert(( ::std::is_same< Tag, Algebraic_category>::value));
-    static_assert((!::std::is_same< Simplify, Null_functor>::value));
-    static_assert((!::std::is_same< Unit_part, Null_functor>::value));
+    static_assert(::std::is_same< typename AST::Is_exact, Is_exact >::value);
+    static_assert(::std::is_convertible< Tag,
+                    Integral_domain_without_division_tag >::value );
+    static_assert(::std::is_same< Tag, Algebraic_category>::value);
+    static_assert(!::std::is_same< Simplify, Null_functor>::value);
+    static_assert(!::std::is_same< Unit_part, Null_functor>::value);
     const Simplify   simplify=Simplify();;
     const Unit_part  unit_part= Unit_part();
 
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_coercion_traits.h b/Algebraic_foundations/include/CGAL/Test/_test_coercion_traits.h
index fab14e92e981..cff190a023d0 100644
--- a/Algebraic_foundations/include/CGAL/Test/_test_coercion_traits.h
+++ b/Algebraic_foundations/include/CGAL/Test/_test_coercion_traits.h
@@ -346,9 +346,9 @@ void test_explicit_interoperable_one_way(){
   typedef typename CT::Cast Cast;
   typedef typename Cast::result_type result_type;
   CGAL_USE_TYPE(result_type);
-  static_assert((::std::is_same<result_type,Type>::value));
-  static_assert((::std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value));
-  static_assert((::std::is_same<Type,RT>::value));
+  static_assert(::std::is_same<result_type,Type>::value);
+  static_assert(::std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value);
+  static_assert(::std::is_same<Type,RT>::value);
   typename CT::Cast cast;
 
   A a(3);
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_fraction_traits.h b/Algebraic_foundations/include/CGAL/Test/_test_fraction_traits.h
index c12411757b2f..6d11b6f2c555 100644
--- a/Algebraic_foundations/include/CGAL/Test/_test_fraction_traits.h
+++ b/Algebraic_foundations/include/CGAL/Test/_test_fraction_traits.h
@@ -37,11 +37,11 @@ void test_fraction_traits(){
     typedef typename FT::Compose   Compose;
 
     CGAL_USE_TYPE(Is_fraction);
-    static_assert( (::std::is_same<Type,T>::value));
-    static_assert( (::std::is_same<Is_fraction,Tag_true>::value));
-    static_assert(!(::std::is_same<Common_factor,Null_functor>::value));
-    static_assert(!(::std::is_same<Decompose,Null_functor>::value));
-    static_assert(!(::std::is_same<Compose,Null_functor>::value));
+    static_assert(::std::is_same<Type,T>::value);
+    static_assert(::std::is_same<Is_fraction,Tag_true>::value);
+    static_assert(!::std::is_same<Common_factor,Null_functor>::value);
+    static_assert(!::std::is_same<Decompose,Null_functor>::value);
+    static_assert(!::std::is_same<Compose,Null_functor>::value);
 
 
     // Decompose
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_rational_traits.h b/Algebraic_foundations/include/CGAL/Test/_test_rational_traits.h
index 26dce67e619b..68e648e69c5b 100644
--- a/Algebraic_foundations/include/CGAL/Test/_test_rational_traits.h
+++ b/Algebraic_foundations/include/CGAL/Test/_test_rational_traits.h
@@ -29,7 +29,7 @@ void test_rational_traits(){
 
     typedef Rational_traits<Rational> Rational_traits;
     typedef typename Rational_traits::RT RT;
-    static_assert((::std::is_same<RT,RT>::value));
+    static_assert(::std::is_same<RT,RT>::value);
 
     assert( Rational_traits().numerator(x) == RT(7));
     assert( Rational_traits().denominator(x) == RT(2));
diff --git a/Algebraic_foundations/include/CGAL/Test/_test_real_embeddable.h b/Algebraic_foundations/include/CGAL/Test/_test_real_embeddable.h
index 1f7e818d2d36..fbe5b66132b8 100644
--- a/Algebraic_foundations/include/CGAL/Test/_test_real_embeddable.h
+++ b/Algebraic_foundations/include/CGAL/Test/_test_real_embeddable.h
@@ -48,9 +48,9 @@ namespace CGAL {
         void operator() (const ToDouble& to_double) {
             typedef typename ToDouble::argument_type Argument_type;
             typedef typename ToDouble::result_type   Result_type;
-            static_assert(( ::std::is_same<Type, Argument_type>::value));
+            static_assert( ::std::is_same<Type, Argument_type>::value);
             CGAL_USE_TYPE(Argument_type);
-            static_assert(( ::std::is_same<double, Result_type>::value));
+            static_assert( ::std::is_same<double, Result_type>::value);
             CGAL_USE_TYPE(Result_type);
             assert(42.0 == to_double(Type(42)));
         }
@@ -71,9 +71,9 @@ namespace CGAL {
             typedef typename To_interval::argument_type Argument_type;
             typedef typename To_interval::result_type   Result_type;
             typedef std::pair<double,double>  Interval_type;
-            static_assert(( ::std::is_same<Type, Argument_type>::value));
+            static_assert( ::std::is_same<Type, Argument_type>::value);
             CGAL_USE_TYPE(Argument_type);
-            static_assert(( ::std::is_same<Interval_type, Result_type>::value));
+            static_assert( ::std::is_same<Interval_type, Result_type>::value);
             CGAL_USE_TYPE(Result_type); CGAL_USE_TYPE(Interval_type);
 
 //            assert(NiX::in(42.0,to_Interval(Type(42))));
@@ -139,7 +139,7 @@ void test_real_embeddable() {
     CGAL_SNAP_RET_FUNCTORS(RET);
     typedef typename RET::Is_real_embeddable Is_real_embeddable;
     using CGAL::Tag_true;
-    static_assert(( ::std::is_same< Is_real_embeddable, Tag_true>::value));
+    static_assert(::std::is_same< Is_real_embeddable, Tag_true>::value);
     CGAL_USE_TYPE(Is_real_embeddable);
 
     typedef typename RET::Boolean Boolean;
@@ -246,7 +246,7 @@ void test_not_real_embeddable() {
     typedef CGAL::Real_embeddable_traits<Type> RET;
     typedef typename RET::Is_real_embeddable Is_real_embeddable;
     using CGAL::Tag_false;
-    static_assert(( ::std::is_same< Is_real_embeddable, Tag_false>::value));
+    static_assert(::std::is_same< Is_real_embeddable, Tag_false>::value);
     CGAL_USE_TYPE(Is_real_embeddable);
 }
 
@@ -254,13 +254,13 @@ void test_not_real_embeddable() {
 //template <class Type, class CeilLog2Abs>
 //void test_rounded_log2_abs(Type zero, CGAL::Null_functor, CeilLog2Abs) {
 //    typedef CGAL::Null_functor Null_functor;
-//    static_assert(( ::std::is_same< CeilLog2Abs, Null_functor>::value));
+//    static_assert(::std::is_same< CeilLog2Abs, Null_functor>::value);
 //}
 //
 //template <class Type, class FloorLog2Abs, class CeilLog2Abs>
 //void test_rounded_log2_abs(Type zero, FloorLog2Abs fl_log, CeilLog2Abs cl_log) {
 //    typedef CGAL::Null_functor Null_functor;
-//    static_assert((!::std::is_same< CeilLog2Abs, Null_functor>::value));
+//    static_assert(!::std::is_same< CeilLog2Abs, Null_functor>::value);
 //
 //    assert( fl_log(Type( 7)) == 2 );
 //    assert( cl_log(Type( 7)) == 3 );
diff --git a/Algebraic_foundations/test/Algebraic_foundations/Algebraic_extension_traits.cpp b/Algebraic_foundations/test/Algebraic_foundations/Algebraic_extension_traits.cpp
index 03ee581bcbfa..95c89235190b 100644
--- a/Algebraic_foundations/test/Algebraic_foundations/Algebraic_extension_traits.cpp
+++ b/Algebraic_foundations/test/Algebraic_foundations/Algebraic_extension_traits.cpp
@@ -9,7 +9,7 @@ int main(){
 
         typedef AET::Type Type;
         CGAL_USE_TYPE(Type);
-        static_assert((::std::is_same<int,Type>::value));
+        static_assert(::std::is_same<int,Type>::value);
 
         typedef AET::Is_extended Is_extended;
         CGAL_USE_TYPE(Is_extended);
@@ -20,10 +20,10 @@ int main(){
         {
             typedef Normalization_factor::argument_type argument_type;
             CGAL_USE_TYPE(argument_type);
-            static_assert((::std::is_same<argument_type,int>::value));
+            static_assert(::std::is_same<argument_type,int>::value);
             typedef Normalization_factor::result_type result_type;
             CGAL_USE_TYPE(result_type);
-            static_assert((::std::is_same<result_type,int>::value));
+            static_assert(::std::is_same<result_type,int>::value);
             Normalization_factor nfac;
             assert(nfac(3)==1);
         }
@@ -31,10 +31,10 @@ int main(){
         {
             typedef DFAI::argument_type argument_type;
             CGAL_USE_TYPE(argument_type);
-            static_assert((::std::is_same<argument_type,int>::value));
+            static_assert(::std::is_same<argument_type,int>::value);
             typedef DFAI::result_type result_type;
             CGAL_USE_TYPE(result_type);
-            static_assert((::std::is_same<result_type,int>::value));
+            static_assert(::std::is_same<result_type,int>::value);
             DFAI dfai;
             assert(dfai(3)==1);
         }
@@ -45,7 +45,7 @@ int main(){
 
         typedef AET::Type Type;
         CGAL_USE_TYPE(Type);
-        static_assert((::std::is_same<EXT,Type>::value));
+        static_assert(::std::is_same<EXT,Type>::value);
 
         typedef AET::Is_extended Is_extended;
         CGAL_USE_TYPE(Is_extended);
@@ -56,10 +56,10 @@ int main(){
         {
             typedef Normalization_factor::argument_type argument_type;
             CGAL_USE_TYPE(argument_type);
-            static_assert((::std::is_same<argument_type,EXT>::value));
+            static_assert(::std::is_same<argument_type,EXT>::value);
             typedef Normalization_factor::result_type result_type;
             CGAL_USE_TYPE(result_type);
-            static_assert((::std::is_same<result_type,EXT>::value));
+            static_assert(::std::is_same<result_type,EXT>::value);
             Normalization_factor nfac;
             assert(nfac(EXT(3))==1);
             assert(nfac(EXT(3,0,5))==1);
@@ -69,10 +69,10 @@ int main(){
         {
             typedef DFAI::argument_type argument_type;
             CGAL_USE_TYPE(argument_type);
-            static_assert((::std::is_same<argument_type,EXT>::value));
+            static_assert(::std::is_same<argument_type,EXT>::value);
             typedef DFAI::result_type result_type;
             CGAL_USE_TYPE(result_type);
-            static_assert((::std::is_same<result_type,EXT>::value));
+            static_assert(::std::is_same<result_type,EXT>::value);
             DFAI dfai;
             assert(dfai(EXT(3))==1);
             assert(dfai(EXT(3,0,5))==1);
diff --git a/Algebraic_foundations/test/Algebraic_foundations/Algebraic_structure_traits.cpp b/Algebraic_foundations/test/Algebraic_foundations/Algebraic_structure_traits.cpp
index f8cb5910ce1e..efd31636c51d 100644
--- a/Algebraic_foundations/test/Algebraic_foundations/Algebraic_structure_traits.cpp
+++ b/Algebraic_foundations/test/Algebraic_foundations/Algebraic_structure_traits.cpp
@@ -16,7 +16,7 @@ int main(){
 
     typedef AST::Type Type;
     CGAL_USE_TYPE(Type);
-    static_assert((::std::is_same<void,Type>::value));
+    static_assert(::std::is_same<void,Type>::value);
 
     typedef AST::Algebraic_category Algebraic_category;
     CGAL_USE_TYPE(Algebraic_category);
@@ -25,10 +25,10 @@ int main(){
 
     typedef AST::Is_exact Is_exact;
     CGAL_USE_TYPE(Is_exact);
-    static_assert((::std::is_same<CGAL::Null_tag,Is_exact>::value));
+    static_assert(::std::is_same<CGAL::Null_tag,Is_exact>::value);
     typedef AST::Is_numerical_sensitive Is_sensitive;
     CGAL_USE_TYPE(Is_sensitive);
-    static_assert((::std::is_same<CGAL::Null_tag,Is_sensitive>::value));
+    static_assert(::std::is_same<CGAL::Null_tag,Is_sensitive>::value);
 
     CGAL_IS_AST_NULL_FUNCTOR (  Simplify);
     CGAL_IS_AST_NULL_FUNCTOR (  Unit_part);
diff --git a/Algebraic_foundations/test/Algebraic_foundations/Coercion_traits.cpp b/Algebraic_foundations/test/Algebraic_foundations/Coercion_traits.cpp
index 7fcb803e94c4..a0ec9d741a4e 100644
--- a/Algebraic_foundations/test/Algebraic_foundations/Coercion_traits.cpp
+++ b/Algebraic_foundations/test/Algebraic_foundations/Coercion_traits.cpp
@@ -6,22 +6,17 @@ int main(){
     {
     typedef CGAL::Coercion_traits<int,int> CT;
     CGAL_USE_TYPE(CT);
-    static_assert(( std::is_same<CT::Type,int>::value));
-    static_assert(
-            ( std::is_same<CT::Are_implicit_interoperable,CGAL::Tag_true>::value));
-    static_assert(
-            ( std::is_same<CT::Are_explicit_interoperable,CGAL::Tag_true>::value));
+    static_assert( std::is_same<CT::Type,int>::value);
+    static_assert( std::is_same<CT::Are_implicit_interoperable,CGAL::Tag_true>::value);
+    static_assert( std::is_same<CT::Are_explicit_interoperable,CGAL::Tag_true>::value);
     assert( 5 == CT::Cast()(5));
     }
     {
     typedef CGAL::Coercion_traits<CGAL::Tag_true,CGAL::Tag_false> CT;
     CGAL_USE_TYPE(CT);
-//    static_assert(( std::is_same<CT::Type,CGAL::Null_type>::value));
-    static_assert(
-            ( std::is_same<CT::Are_implicit_interoperable,CGAL::Tag_false>::value));
-    static_assert(
-            ( std::is_same<CT::Are_explicit_interoperable,CGAL::Tag_false>::value));
-    static_assert(
-            ( std::is_same<CT::Cast,CGAL::Null_functor>::value));
+//    static_assert( std::is_same<CT::Type,CGAL::Null_type>::value);
+    static_assert(std::is_same<CT::Are_implicit_interoperable,CGAL::Tag_false>::value);
+    static_assert(std::is_same<CT::Are_explicit_interoperable,CGAL::Tag_false>::value);
+    static_assert(std::is_same<CT::Cast,CGAL::Null_functor>::value);
     }
 }
diff --git a/Algebraic_foundations/test/Algebraic_foundations/Real_embeddable_traits.cpp b/Algebraic_foundations/test/Algebraic_foundations/Real_embeddable_traits.cpp
index 3d03fb37e388..f215c8484582 100644
--- a/Algebraic_foundations/test/Algebraic_foundations/Real_embeddable_traits.cpp
+++ b/Algebraic_foundations/test/Algebraic_foundations/Real_embeddable_traits.cpp
@@ -16,11 +16,11 @@ int main(){
 
     typedef RET::Type Type;
     CGAL_USE_TYPE(Type);
-    static_assert((::std::is_same<void,Type>::value));
+    static_assert(::std::is_same<void,Type>::value);
 
     typedef RET::Is_real_embeddable Is_real_embeddable;
     CGAL_USE_TYPE(Is_real_embeddable);
-    static_assert((::std::is_same<CGAL::Tag_false,Is_real_embeddable>::value));
+    static_assert(::std::is_same<CGAL::Tag_false,Is_real_embeddable>::value);
 
     CGAL_IS_RET_NULL_FUNCTOR(Abs);
     CGAL_IS_RET_NULL_FUNCTOR(Sgn);
diff --git a/Algebraic_foundations/test/Algebraic_foundations/Scalar_factor_traits.cpp b/Algebraic_foundations/test/Algebraic_foundations/Scalar_factor_traits.cpp
index af4cc52c0d60..1fe2fcf620d8 100644
--- a/Algebraic_foundations/test/Algebraic_foundations/Scalar_factor_traits.cpp
+++ b/Algebraic_foundations/test/Algebraic_foundations/Scalar_factor_traits.cpp
@@ -7,33 +7,31 @@
 int main(){
     typedef CGAL::Scalar_factor_traits<int> SFT;
     CGAL_USE_TYPE(SFT);
-    static_assert((::std::is_same<int, SFT::Type>::value));
-    static_assert((::std::is_same<int, SFT::Scalar>::value));
+    static_assert(::std::is_same<int, SFT::Type>::value);
+    static_assert(::std::is_same<int, SFT::Scalar>::value);
 
     typedef SFT::Scalar_factor Scalar_factor;
     {
         typedef Scalar_factor::result_type result_type;
         CGAL_USE_TYPE(result_type);
-        static_assert((::std::is_same<int, result_type>::value));
+        static_assert(::std::is_same<int, result_type>::value);
 
         typedef Scalar_factor::argument_type argument_type;
         CGAL_USE_TYPE(argument_type);
-        static_assert((::std::is_same<int, argument_type>::value));
+        static_assert(::std::is_same<int, argument_type>::value);
     }
     typedef SFT::Scalar_div Scalar_div;
     {
         typedef Scalar_div::result_type result_type;
         CGAL_USE_TYPE(result_type);
-        static_assert((::std::is_same<void, result_type>::value));
+        static_assert(::std::is_same<void, result_type>::value);
 
         typedef Scalar_div::first_argument_type first_argument_type;
         CGAL_USE_TYPE(first_argument_type);
-        static_assert(
-                (::std::is_same<int&, first_argument_type>::value));
+        static_assert(::std::is_same<int&, first_argument_type>::value);
         typedef Scalar_div::second_argument_type second_argument_type;
         CGAL_USE_TYPE(second_argument_type);
-        static_assert(
-                (::std::is_same<int, second_argument_type>::value));
+        static_assert(::std::is_same<int, second_argument_type>::value);
     }
 
     int i;
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
index a02edebb8e13..e92e01e0669b 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
@@ -481,18 +481,18 @@ class Algebraic_curve_kernel_2 : public AlgebraicKernel_d_1{
       Curve_analysis_2 _construct_defining_polynomial_from(Bound b) const {
         typedef CGAL::Fraction_traits<Bound> FT;
         // We rely on the fact that the Bound is a fraction
-        static_assert((::std::is_same<typename FT::Is_fraction,
-                                             CGAL::Tag_true>::value));
+        static_assert(::std::is_same<typename FT::Is_fraction,
+                                             CGAL::Tag_true>::value);
         typedef typename FT::Numerator_type Numerator;
         typedef typename FT::Denominator_type Denominator;
         typedef CGAL::Coercion_traits<Numerator,Coefficient> Num_coercion;
-        static_assert((::std::is_same
+        static_assert(::std::is_same
                               <Coefficient,
-                                  typename Num_coercion::Type>::value));
+                                  typename Num_coercion::Type>::value);
         typedef CGAL::Coercion_traits<Denominator,Coefficient> Denom_coercion;
-        static_assert((::std::is_same
+        static_assert(::std::is_same
                                <Coefficient,
-                                typename Denom_coercion::Type>::value));
+                                typename Denom_coercion::Type>::value);
         typename Num_coercion::Cast num_cast;
         typename Denom_coercion::Cast denom_cast;
         typename FT::Decompose decompose;
@@ -2541,18 +2541,18 @@ class Algebraic_curve_kernel_2 : public AlgebraicKernel_d_1{
       Polynomial_1 operator() (const Polynomial_2& f, Bound b) const {
         typedef CGAL::Fraction_traits<Bound> FT;
         // We rely on the fact that the Bound is a fraction
-        static_assert((::std::is_same<typename FT::Is_fraction,
-                                             CGAL::Tag_true>::value));
+        static_assert(::std::is_same<typename FT::Is_fraction,
+                                             CGAL::Tag_true>::value);
         typedef typename FT::Numerator_type Numerator;
         typedef typename FT::Denominator_type Denominator;
         typedef CGAL::Coercion_traits<Numerator,Coefficient> Num_coercion;
-        static_assert((::std::is_same
+        static_assert(::std::is_same
                               <Coefficient,
-                                  typename Num_coercion::Type>::value));
+                                  typename Num_coercion::Type>::value);
         typedef CGAL::Coercion_traits<Denominator,Coefficient> Denom_coercion;
-        static_assert((::std::is_same
+        static_assert(::std::is_same
                                <Coefficient,
-                                typename Denom_coercion::Type>::value));
+                                typename Denom_coercion::Type>::value);
         typename Num_coercion::Cast num_cast;
         typename Denom_coercion::Cast denom_cast;
         typename FT::Decompose decompose;
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/algebraic_curve_kernel_2_tools.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/algebraic_curve_kernel_2_tools.h
index 4a2b7bd038ea..e9ff71e3e66c 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/algebraic_curve_kernel_2_tools.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/algebraic_curve_kernel_2_tools.h
@@ -224,14 +224,14 @@ template<typename Poly_coer_1,typename Polynomial_1>
   void cast_back_utcf(const Poly_coer_1& p,Polynomial_1& q) {
   // We can assume that both template arguments are polynomial types
   typedef CGAL::Fraction_traits<Poly_coer_1> FT;
-  static_assert((::std::is_same<typename FT::Is_fraction,
-                       CGAL::Tag_true>::value));
+  static_assert(::std::is_same<typename FT::Is_fraction,
+                       CGAL::Tag_true>::value);
   typedef typename FT::Numerator_type Numerator;
   typedef typename FT::Denominator_type Denominator;
   typedef CGAL::Coercion_traits<Numerator,Polynomial_1> Num_coercion;
-  static_assert((::std::is_same
+  static_assert(::std::is_same
                        <Polynomial_1,
-                       typename Num_coercion::Type>::value));
+                       typename Num_coercion::Type>::value);
   Numerator p_num;
   Denominator p_denom;
   typename FT::Decompose()(p,p_num,p_denom);
diff --git a/Algebraic_kernel_d/test/Algebraic_kernel_d/Real_embeddable_traits_extension.cpp b/Algebraic_kernel_d/test/Algebraic_kernel_d/Real_embeddable_traits_extension.cpp
index c56969868c1a..d5917a016e50 100644
--- a/Algebraic_kernel_d/test/Algebraic_kernel_d/Real_embeddable_traits_extension.cpp
+++ b/Algebraic_kernel_d/test/Algebraic_kernel_d/Real_embeddable_traits_extension.cpp
@@ -47,8 +47,8 @@ void test_real_embeddable_extension(const NT_&){
     typedef typename Floor::result_type   Result_type;
     CGAL_USE_TYPE(Argument_type);
     CGAL_USE_TYPE(Result_type);
-    static_assert(( ::std::is_same<NT, Argument_type>::value));
-    static_assert(( ::std::is_same<Integer, Result_type>::value));
+    static_assert(::std::is_same<NT, Argument_type>::value);
+    static_assert(::std::is_same<Integer, Result_type>::value);
     assert(Integer(42) == floor(NT(42)));
     assert(Integer(-42) == floor(NT(-42)));
   }
@@ -59,8 +59,8 @@ void test_real_embeddable_extension(const NT_&){
     typedef typename Floor_log2_abs::result_type   Result_type;
     CGAL_USE_TYPE(Argument_type);
     CGAL_USE_TYPE(Result_type);
-    static_assert(( ::std::is_same<NT, Argument_type>::value));
-    static_assert(( ::std::is_same<long, Result_type>::value));
+    static_assert(::std::is_same<NT, Argument_type>::value);
+    static_assert(::std::is_same<long, Result_type>::value);
 
     assert(long(0) == floor_log2_abs(NT(1)));
     assert(long(0) == floor_log2_abs(NT(-1)));
@@ -86,8 +86,8 @@ void test_real_embeddable_extension(const NT_&){
     typedef typename Ceil::result_type   Result_type;
     CGAL_USE_TYPE(Argument_type);
     CGAL_USE_TYPE(Result_type);
-    static_assert(( ::std::is_same<NT, Argument_type>::value));
-    static_assert(( ::std::is_same<Integer, Result_type>::value));
+    static_assert(::std::is_same<NT, Argument_type>::value);
+    static_assert(::std::is_same<Integer, Result_type>::value);
     assert(Integer(42) == ceil(NT(42)));
     assert(Integer(-42) == ceil(NT(-42)));
   }
@@ -98,8 +98,8 @@ void test_real_embeddable_extension(const NT_&){
     typedef typename Ceil_log2_abs::result_type   Result_type;
     CGAL_USE_TYPE(Argument_type);
     CGAL_USE_TYPE(Result_type);
-    static_assert(( ::std::is_same<NT, Argument_type>::value));
-    static_assert(( ::std::is_same<long, Result_type>::value));
+    static_assert(::std::is_same<NT, Argument_type>::value);
+    static_assert(::std::is_same<long, Result_type>::value);
 
     assert(long(0) == ceil_log2_abs(NT(1)));
     assert(long(0) == ceil_log2_abs(NT(-1)));
diff --git a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_curve_kernel_2.h b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_curve_kernel_2.h
index e110e2b7c955..f3332c1a4d28 100644
--- a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_curve_kernel_2.h
+++ b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_curve_kernel_2.h
@@ -62,20 +62,20 @@ void test_algebraic_curve_kernel_2() {
 
     typedef AlgebraicCurveKernel_2 AK_2;
 
-  /*  static_assert( (::std::is_same<
-            Algebraic_real_1, typename AK::Algebraic_real_1 >::value) );
+  /*  static_assert(::std::is_same<
+            Algebraic_real_1, typename AK::Algebraic_real_1 >::value);
 
-    static_assert((::std::is_same<
+    static_assert(::std::is_same<
             Isolator,
-            typename AK::Isolator >::value) );
+            typename AK::Isolator >::value);
 
-    static_assert((::std::is_same<
+    static_assert(::std::is_same<
             Coefficient,
-            typename AK::Coefficient >::value));
+            typename AK::Coefficient >::value);
 
-    static_assert((::std::is_same<
+    static_assert(::std::is_same<
             Polynomial_1,
-            typename AK::Polynomial_1 >::value));*/
+            typename AK::Polynomial_1 >::value);*/
 
     typedef typename AK_2::Polynomial_2 Poly_2;
     typedef typename AK_2::Curve_analysis_2 Curve_analysis_2;
diff --git a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_1.h b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_1.h
index 7d12134feff2..abe5ebfd32d4 100644
--- a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_1.h
+++ b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_1.h
@@ -109,8 +109,8 @@ void test_algebraic_kernel_1(const AlgebraicKernel_d_1& ak_1){
     typedef typename Name::result_type   RT_;                     \
     CGAL_USE_TYPE(AT_);                                           \
     CGAL_USE_TYPE(RT_);                                           \
-    {static_assert(( ::std::is_same<AT,AT_>::value));}  \
-    {static_assert(( ::std::is_same<RT,RT_>::value));}  \
+    {static_assert(::std::is_same<AT,AT_>::value);}  \
+    {static_assert(::std::is_same<RT,RT_>::value);}  \
   }
 #define CGAL_CHECK_BFUNCTION(Name,AT1,AT2,RT)                           \
   {                                                                     \
@@ -120,9 +120,9 @@ void test_algebraic_kernel_1(const AlgebraicKernel_d_1& ak_1){
     CGAL_USE_TYPE(AT1_);                                                \
     CGAL_USE_TYPE(AT2_);                                                \
     CGAL_USE_TYPE(RT_);                                                 \
-    {static_assert(( ::std::is_same<AT1,AT1_>::value));}      \
-    {static_assert(( ::std::is_same<AT2,AT2_>::value));}      \
-    {static_assert(( ::std::is_same<RT,RT_>::value));}        \
+    {static_assert(::std::is_same<AT1,AT1_>::value);}      \
+    {static_assert(::std::is_same<AT2,AT2_>::value);}      \
+    {static_assert(::std::is_same<RT,RT_>::value);}        \
   }
 
   // TODO: missing check for Construct_algebraic_real_1
diff --git a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_2.h b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_2.h
index 4db859ddb25c..bebcd0118e74 100644
--- a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_2.h
+++ b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_algebraic_kernel_2.h
@@ -93,8 +93,8 @@ void test_algebraic_kernel_2(const AlgebraicKernel_2& ak_2) {
     typedef typename Name::result_type   RT_;                   \
     CGAL_USE_TYPE(AT_);                                           \
     CGAL_USE_TYPE(RT_);                                           \
-    {static_assert(( ::std::is_same<AT,AT_>::value));}  \
-    {static_assert(( ::std::is_same<RT,RT_>::value));}  \
+    {static_assert(::std::is_same<AT,AT_>::value);}  \
+    {static_assert(::std::is_same<RT,RT_>::value);}  \
   }
   #define CGAL_CHECK_BFUNCTION(Name,AT1,AT2,RT)                           \
   {                                                                     \
@@ -104,22 +104,22 @@ void test_algebraic_kernel_2(const AlgebraicKernel_2& ak_2) {
     CGAL_USE_TYPE(AT1_);                                                 \
     CGAL_USE_TYPE(AT2_);                                                \
     CGAL_USE_TYPE(RT_);                                                 \
-    {static_assert(( ::std::is_same<AT1,AT1_>::value));}        \
-    {static_assert(( ::std::is_same<AT2,AT2_>::value));}        \
-    {static_assert(( ::std::is_same<RT,RT_>::value));}          \
+    {static_assert(::std::is_same<AT1,AT1_>::value);}        \
+    {static_assert(::std::is_same<AT2,AT2_>::value);}        \
+    {static_assert(::std::is_same<RT,RT_>::value);}          \
   }
 
 
-  static_assert(( ::std::is_same
+  static_assert(::std::is_same
                          <Algebraic_real_2,
                          typename Construct_algebraic_real_2::result_type>
-                           ::value));
+                           ::value);
   CGAL_CHECK_UFUNCTION(Is_square_free_2,Polynomial_2,bool);
   CGAL_CHECK_UFUNCTION(Make_square_free_2,Polynomial_2,Polynomial_2);
   // TODO: missing check for Square_free_factorize_2
   CGAL_CHECK_BFUNCTION(Is_coprime_2,Polynomial_2,Polynomial_2,bool);
-  static_assert(( ::std::is_same
-                         <bool,typename Make_coprime_2::result_type>::value));
+  static_assert(::std::is_same
+                         <bool,typename Make_coprime_2::result_type>::value);
   CGAL_CHECK_BFUNCTION(Number_of_solutions_2,Polynomial_2,Polynomial_2,
                        size_type);
   CGAL_CHECK_UFUNCTION(Compute_x_2,Algebraic_real_2,Algebraic_real_1);
@@ -128,8 +128,8 @@ void test_algebraic_kernel_2(const AlgebraicKernel_2& ak_2) {
   CGAL_CHECK_UFUNCTION(Compute_polynomial_y_2,Algebraic_real_2,Polynomial_1);
   CGAL_CHECK_BFUNCTION(Isolate_x_2,Algebraic_real_2,Polynomial_1,BInterval);
   CGAL_CHECK_BFUNCTION(Isolate_y_2,Algebraic_real_2,Polynomial_1,BInterval);
-  static_assert(( ::std::is_same
-                         < BArray,typename Isolate_2::result_type>::value));
+  static_assert(::std::is_same
+                         < BArray,typename Isolate_2::result_type>::value);
   CGAL_CHECK_BFUNCTION(Sign_at_2,Polynomial_2,Algebraic_real_2,Sign);
   CGAL_CHECK_BFUNCTION(Is_zero_at_2,Polynomial_2,Algebraic_real_2,bool);
   CGAL_CHECK_BFUNCTION(Compare_x_2,Algebraic_real_2,Algebraic_real_2,Sign);
diff --git a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_real_comparable.h b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_real_comparable.h
index dc9f13e3a038..fa5bd929abef 100644
--- a/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_real_comparable.h
+++ b/Algebraic_kernel_d/test/Algebraic_kernel_d/include/CGAL/_test_real_comparable.h
@@ -39,8 +39,8 @@ namespace internal {
         void operator() (ToDouble to_double) {
             typedef typename ToDouble::argument_type Argument_type;
             typedef typename ToDouble::result_type   Result_type;
-            static_assert((::std::is_same<NT, Argument_type>::value));
-            static_assert((::std::is_same<double, Result_type>::value));
+            static_assert(::std::is_same<NT, Argument_type>::value);
+            static_assert(::std::is_same<double, Result_type>::value);
             assert(42.0 == to_double(NT(42)));
         }
     };
@@ -59,8 +59,8 @@ namespace internal {
         void operator() (ToInterval to_Interval) {
             typedef typename ToInterval::argument_type Argument_type;
             typedef typename ToInterval::result_type   Result_type;
-            static_assert((::std::is_same<NT, Argument_type>::value));
-            static_assert((::std::is_same< typename Argument_type::Interval, Result_type>::value));
+            static_assert(::std::is_same<NT, Argument_type>::value);
+            static_assert(::std::is_same< typename Argument_type::Interval, Result_type>::value);
 
             // TODO: NiX::in not available!?
             //assert(NiX::in(42.0,to_Interval(NT(42))));
@@ -99,7 +99,7 @@ void test_real_comparable() {
     typedef CGAL::Real_embeddable_traits<NT> Traits;
     typedef typename Traits::Is_real_embeddable Is_real_comparable;
     using ::CGAL::Tag_true;
-    static_assert((::std::is_same< Is_real_comparable, Tag_true>::value));
+    static_assert(::std::is_same< Is_real_comparable, Tag_true>::value);
     typename Traits::Compare compare;
     typename Traits::Sign    sign;
     typename Traits::Abs     abs;
@@ -168,20 +168,20 @@ void test_not_real_comparable() {
     typedef CGAL::Real_embeddable_traits<NT> Traits;
     typedef typename Traits::Is_real_embeddable Is_real_comparable;
     using ::CGAL::Tag_false;
-    static_assert((::std::is_same< Is_real_comparable, Tag_false>::value));
+    static_assert(::std::is_same< Is_real_comparable, Tag_false>::value);
 }
 
 
 template <class NT, class CeilLog2Abs>
 void test_rounded_log2_abs(NT zero, ::CGAL::Null_functor, CeilLog2Abs) {
     typedef ::CGAL::Null_functor Nulltype;
-    static_assert((::std::is_same< CeilLog2Abs, Nulltype>::value));
+    static_assert(::std::is_same< CeilLog2Abs, Nulltype>::value);
 }
 
 template <class NT, class FloorLog2Abs, class CeilLog2Abs>
 void test_rounded_log2_abs(NT zero, FloorLog2Abs fl_log, CeilLog2Abs cl_log) {
     typedef ::CGAL::Null_functor Null_functor;
-    static_assert((!::std::is_same< CeilLog2Abs, Null_functor>::value));
+    static_assert(!::std::is_same< CeilLog2Abs, Null_functor>::value);
 
     assert( fl_log(NT( 7)) == 2 );
     assert( cl_log(NT( 7)) == 3 );
diff --git a/Alpha_shapes_2/include/CGAL/Alpha_shape_2.h b/Alpha_shapes_2/include/CGAL/Alpha_shape_2.h
index 56e52417684c..43be24070229 100644
--- a/Alpha_shapes_2/include/CGAL/Alpha_shape_2.h
+++ b/Alpha_shapes_2/include/CGAL/Alpha_shape_2.h
@@ -76,8 +76,8 @@ class Alpha_shape_2 : public Dt
   typedef Type_of_alpha               FT;
 
   // check that simplices are correctly instantiated
-  static_assert( (std::is_same<NT, typename Dt::Face::NT>::value) );
-  static_assert( (std::is_same<NT, typename Dt::Vertex::NT>::value) );
+  static_assert(std::is_same<NT, typename Dt::Face::NT>::value);
+  static_assert(std::is_same<NT, typename Dt::Vertex::NT>::value);
 
   typedef typename Dt::Point Point;
 
diff --git a/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h b/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
index 22565c21d859..7ce92e13c347 100644
--- a/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
+++ b/Alpha_shapes_2/include/CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h
@@ -148,8 +148,8 @@ class Lazy_alpha_nt_2
   Approx_point to_approx(const Input_point& wp) const
   {
     // The traits class' Point_2 must be convertible using the Cartesian converter
-    static_assert((Is_traits_point_convertible_2<
-                            Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value));
+    static_assert(Is_traits_point_convertible_2<
+                            Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value);
 
     To_approx converter;
     return converter(wp);
@@ -158,8 +158,8 @@ class Lazy_alpha_nt_2
   Exact_point to_exact(const Input_point& wp) const
   {
     // The traits class' Point_2 must be convertible using the Cartesian converter
-    static_assert((Is_traits_point_convertible_2<
-                            Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value));
+    static_assert(Is_traits_point_convertible_2<
+                            Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value);
 
     To_exact converter;
     return converter(wp);
diff --git a/Alpha_shapes_3/include/CGAL/Alpha_shape_3.h b/Alpha_shapes_3/include/CGAL/Alpha_shape_3.h
index a7fdc406b041..a4a93f825158 100644
--- a/Alpha_shapes_3/include/CGAL/Alpha_shape_3.h
+++ b/Alpha_shapes_3/include/CGAL/Alpha_shape_3.h
@@ -108,8 +108,8 @@ class Alpha_shape_3 : public Dt
   typedef typename Gt::FT Coord_type;
 
   //checks whether tags are correctly set in Vertex and Cell classes
-  static_assert( (std::is_same<NT,typename Dt::Cell::NT>::value) );
-  static_assert( (std::is_same<NT,typename Dt::Vertex::Alpha_status::NT>::value) );
+  static_assert(std::is_same<NT,typename Dt::Cell::NT>::value);
+  static_assert(std::is_same<NT,typename Dt::Vertex::Alpha_status::NT>::value);
 
   typedef typename Dt::Point Point;
 
diff --git a/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h b/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
index f20b050c1a2c..cf732c40d67f 100644
--- a/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
+++ b/Alpha_shapes_3/include/CGAL/Alpha_shapes_3/internal/Lazy_alpha_nt_3.h
@@ -139,8 +139,8 @@ class Lazy_alpha_nt_3{
   Approx_point to_approx(const Input_point& wp) const
   {
     // The traits class' Point_3 must be convertible using the Cartesian converter
-    static_assert((Is_traits_point_convertible_3<
-                            Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value));
+    static_assert(Is_traits_point_convertible_3<
+                            Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value);
 
     To_approx converter;
     return converter(wp);
@@ -149,8 +149,8 @@ class Lazy_alpha_nt_3{
   Exact_point to_exact(const Input_point& wp) const
   {
     // The traits class' Point_3 must be convertible using the Cartesian converter
-    static_assert((Is_traits_point_convertible_3<
-                            Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value));
+    static_assert(Is_traits_point_convertible_3<
+                            Input_traits, Kernel_approx, Kernel_exact, Weighted_tag>::value);
 
     To_exact converter;
     return converter(wp);
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 0d81f8b81936..648835842e3b 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -193,7 +193,7 @@ class Alpha_wrap_3
   {
     // Due to the Steiner point computation being a dichotomy, the algorithm is inherently inexact
     // and passing exact kernels is explicitly disabled to ensure no misunderstanding.
-    static_assert((std::is_floating_point<FT>::value));
+    static_assert(std::is_floating_point<FT>::value);
   }
 
 public:
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
index 122599a7d50b..c87f82ac75fe 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
@@ -146,7 +146,7 @@ class Triangle_mesh_oracle
 
     VPM vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
                                get_const_property_map(vertex_point, tmesh));
-    static_assert((std::is_same<typename boost::property_traits<VPM>::value_type, Point_3>::value));
+    static_assert(std::is_same<typename boost::property_traits<VPM>::value_type, Point_3>::value);
 
     Splitter_base::reserve(num_faces(tmesh));
 
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
index e602b708f955..0a8f589fc2df 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
@@ -143,7 +143,7 @@ class Triangle_soup_oracle
 #endif
 
     PPM pm = choose_parameter<PPM>(get_parameter(np, internal_np::point_map));
-    static_assert((std::is_same<typename boost::property_traits<PPM>::value_type, Point_3>::value));
+    static_assert(std::is_same<typename boost::property_traits<PPM>::value_type, Point_3>::value);
 
     Splitter_base::reserve(faces.size());
 
diff --git a/Arithmetic_kernel/test/Arithmetic_kernel/Get_arithmetic_kernel.cpp b/Arithmetic_kernel/test/Arithmetic_kernel/Get_arithmetic_kernel.cpp
index 2947c3a3761a..7c48e66a2c12 100644
--- a/Arithmetic_kernel/test/Arithmetic_kernel/Get_arithmetic_kernel.cpp
+++ b/Arithmetic_kernel/test/Arithmetic_kernel/Get_arithmetic_kernel.cpp
@@ -18,17 +18,17 @@ int main() {
   {
     typedef CGAL::Get_arithmetic_kernel<Integer>::Arithmetic_kernel AK_;
     CGAL_USE_TYPE(AK_);
-    static_assert((std::is_same<AK,AK_>::value));
+    static_assert(std::is_same<AK,AK_>::value);
   }
   {
     typedef CGAL::Get_arithmetic_kernel<Rational>::Arithmetic_kernel AK_;
     CGAL_USE_TYPE(AK_);
-    static_assert((std::is_same<AK,AK_>::value));
+    static_assert(std::is_same<AK,AK_>::value);
   }
   {
     typedef CGAL::Get_arithmetic_kernel<BFI>::Arithmetic_kernel AK_;
     CGAL_USE_TYPE(AK_);
-    static_assert((std::is_same<AK,AK_>::value));
+    static_assert(std::is_same<AK,AK_>::value);
   }
   return 0;
 }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
index 8b4a3e1eca23..8686132cc41f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
@@ -90,10 +90,10 @@ class Arr_bounded_planar_topology_traits_2 :
   typedef typename Gt_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Gt_adaptor_2::Right_side_category  Right_side_category;
 
-  static_assert((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value));
-  static_assert((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value));
-  static_assert((std::is_same< Top_side_category, Arr_oblivious_side_tag >::value));
-  static_assert((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value));
+  static_assert(std::is_same< Left_side_category, Arr_oblivious_side_tag >::value);
+  static_assert(std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value);
+  static_assert(std::is_same< Top_side_category, Arr_oblivious_side_tag >::value);
+  static_assert(std::is_same< Right_side_category, Arr_oblivious_side_tag >::value);
   //@}
 
   /*! \struct
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
index 5a32bb997d75..19a95a662f66 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
@@ -172,14 +172,14 @@ overlay(const Arrangement_on_surface_2<GeometryTraitsA_2, TopologyTraitsA>& arr1
   typedef typename Agt2::Point_2                                A_point;
   typedef typename Bgt2::Point_2                                B_point;
   typedef typename Rgt2::Point_2                                Res_point;
-  static_assert((boost::is_convertible<A_point, Res_point>::value));
-  static_assert((boost::is_convertible<B_point, Res_point>::value));
+  static_assert(std::is_convertible<A_point, Res_point>::value);
+  static_assert(std::is_convertible<B_point, Res_point>::value);
 
   typedef typename Agt2::X_monotone_curve_2                     A_xcv;
   typedef typename Bgt2::X_monotone_curve_2                     B_xcv;
   typedef typename Rgt2::X_monotone_curve_2                     Res_xcv;
-  static_assert((boost::is_convertible<A_xcv, Res_xcv>::value));
-  static_assert((boost::is_convertible<B_xcv, Res_xcv>::value));
+  static_assert(std::is_convertible<A_xcv, Res_xcv>::value);
+  static_assert(std::is_convertible<B_xcv, Res_xcv>::value);
 
   typedef Arr_traits_basic_adaptor_2<Rgt2>              Gt_adaptor_2;
   typedef Arr_overlay_traits_2<Gt_adaptor_2, Arr_a, Arr_b>
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Base_rational_arc_ds_1.h b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Base_rational_arc_ds_1.h
index f72169eea37e..f0ff24f1291b 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Base_rational_arc_ds_1.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Base_rational_arc_ds_1.h
@@ -62,9 +62,9 @@ class Base_rational_arc_ds_1
   typedef std::vector<std::pair<Algebraic_real_1, Multiplicity> >
                                                         Root_multiplicity_vector;
 
-  static_assert((std::is_same<Integer,Coefficient>::value));
-  static_assert((std::is_same<Polynomial_1,
-                       typename FT_poly_rat_1::Numerator_type>::value));
+  static_assert(std::is_same<Integer,Coefficient>::value);
+  static_assert(std::is_same<Polynomial_1,
+                       typename FT_poly_rat_1::Numerator_type>::value);
 
 public:
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
index da8875c47681..8b0765062279 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
@@ -100,9 +100,9 @@ class Base_rational_arc_d_1
 
   typedef Algebraic_point_2                                 Point_2;
 
-  static_assert((std::is_same<Integer, Coefficient>::value));
-  static_assert((std::is_same<Polynomial_1,
-                       typename FT_poly_rat_1::Numerator_type>::value));
+  static_assert(std::is_same<Integer, Coefficient>::value);
+  static_assert(std::is_same<Polynomial_1,
+                       typename FT_poly_rat_1::Numerator_type>::value);
 
 public:
   const Rational_function& get_rational_function(const Polynomial_1& numerator,
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
index d7b170e979b8..67202ce862f5 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_topology_traits_2.h
@@ -91,14 +91,14 @@ class Arr_spherical_topology_traits_2 {
   typedef typename Gt_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Gt_adaptor_2::Right_side_category  Right_side_category;
 
-  static_assert((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
-                         std::is_same< Left_side_category, Arr_identified_side_tag >::value));
-  static_assert((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
-                         std::is_same< Bottom_side_category, Arr_contracted_side_tag >::value));
-  static_assert((std::is_same< Top_side_category, Arr_oblivious_side_tag >::value ||
-                         std::is_same< Top_side_category, Arr_contracted_side_tag >::value));
-  static_assert((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
-                         std::is_same< Right_side_category, Arr_identified_side_tag >::value));
+  static_assert(std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
+                         std::is_same< Left_side_category, Arr_identified_side_tag >::value);
+  static_assert(std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
+                         std::is_same< Bottom_side_category, Arr_contracted_side_tag >::value);
+  static_assert(std::is_same< Top_side_category, Arr_oblivious_side_tag >::value ||
+                         std::is_same< Top_side_category, Arr_contracted_side_tag >::value);
+  static_assert(std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
+                         std::is_same< Right_side_category, Arr_identified_side_tag >::value);
   //@}
 
   /*! \struct
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
index 30181d7270f3..09cc7c94710f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
@@ -87,14 +87,14 @@ class Arr_unb_planar_topology_traits_2 :
   typedef typename Gt_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Gt_adaptor_2::Right_side_category  Right_side_category;
 
-  static_assert((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
-                         std::is_same< Left_side_category, Arr_open_side_tag >::value));
-  static_assert((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
-                         std::is_same< Bottom_side_category, Arr_open_side_tag >::value));
-  static_assert((std::is_same< Top_side_category, Arr_oblivious_side_tag>::value ||
-                         std::is_same< Top_side_category, Arr_open_side_tag >::value));
-  static_assert((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
-                         std::is_same< Right_side_category, Arr_open_side_tag >::value));
+  static_assert(std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
+                         std::is_same< Left_side_category, Arr_open_side_tag >::value);
+  static_assert(std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
+                         std::is_same< Bottom_side_category, Arr_open_side_tag >::value);
+  static_assert(std::is_same< Top_side_category, Arr_oblivious_side_tag>::value ||
+                         std::is_same< Top_side_category, Arr_open_side_tag >::value);
+  static_assert(std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
+                         std::is_same< Right_side_category, Arr_open_side_tag >::value);
   //@}
 
   /*! \struct
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
index cf4ae5eb11ba..ae87c8ddb28c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
@@ -77,10 +77,10 @@ class Arrangement_on_surface_2 {
   typedef typename Traits_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Traits_adaptor_2::Right_side_category  Right_side_category;
 
-  static_assert((Arr_sane_identified_tagging<Left_side_category,
+  static_assert(Arr_sane_identified_tagging<Left_side_category,
                         Bottom_side_category,
                         Top_side_category,
-                        Right_side_category>::value));
+                        Right_side_category>::value);
 
 public:
   typedef Arrangement_on_surface_2<Geometry_traits_2, Topology_traits>
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
index d011306472ee..81f1c8bad04f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
@@ -67,10 +67,10 @@ class Arrangement_zone_2 {
   typedef typename Traits_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Traits_adaptor_2::Right_side_category  Right_side_category;
 
-  static_assert((Arr_sane_identified_tagging<Left_side_category,
+  static_assert(Arr_sane_identified_tagging<Left_side_category,
                                                     Bottom_side_category,
                                                     Top_side_category,
-                                                    Right_side_category>::value));
+                                                    Right_side_category>::value);
 
 public:
   typedef ZoneVisitor_                                   Visitor;
diff --git a/BGL/include/CGAL/boost/graph/IO/Generic_facegraph_builder.h b/BGL/include/CGAL/boost/graph/IO/Generic_facegraph_builder.h
index 3ec900827933..1dd6235a28cd 100644
--- a/BGL/include/CGAL/boost/graph/IO/Generic_facegraph_builder.h
+++ b/BGL/include/CGAL/boost/graph/IO/Generic_facegraph_builder.h
@@ -49,10 +49,10 @@ class Generic_facegraph_builder
     typedef typename CGAL::GetVertexPointMap<Graph, NamedParameters>::type             VPM;
 
     // usually will be true, but might not be the case if using custom type points
-//    static_assert((std::is_same<typename Kernel::Point_3,
-//                                        typename boost::property_traits<VPM>::value_type>::value));
-//    static_assert((std::is_same<typename Kernel::Point_3,
-//                                        typename boost::range_value<Point_container>::type>::value));
+//    static_assert(std::is_same<typename Kernel::Point_3,
+//                                        typename boost::property_traits<VPM>::value_type>::value);
+//    static_assert(std::is_same<typename Kernel::Point_3,
+//                                        typename boost::range_value<Point_container>::type>::value);
 
     typedef typename internal_np::Lookup_named_param_def<
       internal_np::vertex_normal_map_t, NamedParameters,
diff --git a/BGL/test/BGL/test_Properties.cpp b/BGL/test/BGL/test_Properties.cpp
index ca63a2f78032..04c8ae7beb67 100644
--- a/BGL/test/BGL/test_Properties.cpp
+++ b/BGL/test/BGL/test_Properties.cpp
@@ -98,7 +98,7 @@ void test_vertex_index_map_uniqueness(const Graph& g,
   typedef typename CGAL::GetInitializedVertexIndexMap<Graph, NamedParameters>::const_type CVIM;
 
   // in the case where the map is passed by NP, its type doesn't depend on whether the mesh is const or not
-  static_assert((std::is_same<VIM, CVIM>::value), "VIM, CVIM must be the same type");
+  static_assert(std::is_same<VIM, CVIM>::value, "VIM, CVIM must be the same type");
 
   VIM ivim = CGAL::get_initialized_vertex_index_map(g, np);
 
@@ -114,7 +114,7 @@ void test_halfedge_index_map_uniqueness(const Graph& g,
   typedef typename CGAL::GetInitializedHalfedgeIndexMap<Graph, NamedParameters>::const_type CHIM;
 
   // in the case where the map is passed by NP, its type doesn't depend on whether the mesh is const or not
-  static_assert((std::is_same<HIM, CHIM>::value), "HIM, CHIM must be the same type");
+  static_assert(std::is_same<HIM, CHIM>::value, "HIM, CHIM must be the same type");
 
   HIM ihim = CGAL::get_initialized_halfedge_index_map(g, np);
 
@@ -130,7 +130,7 @@ void test_edge_index_map_uniqueness(const Graph& g,
   typedef typename CGAL::GetInitializedEdgeIndexMap<Graph, NamedParameters>::const_type CEIM;
 
   // in the case where the map is passed by NP, its type doesn't depend on whether the mesh is const or not
-  static_assert((std::is_same<EIM, CEIM>::value), "EIM, CEIM must be the same type");
+  static_assert(std::is_same<EIM, CEIM>::value, "EIM, CEIM must be the same type");
 
   EIM ieim = CGAL::get_initialized_edge_index_map(g, np);
 
@@ -146,7 +146,7 @@ void test_face_index_map_uniqueness(const Graph& g,
   typedef typename CGAL::GetInitializedFaceIndexMap<Graph, NamedParameters>::const_type CFIM;
 
   // in the case where the map is passed by NP, its type doesn't depend on whether the mesh is const or not
-  static_assert((std::is_same<FIM, CFIM>::value), "FIM, CFIM must be the same type");
+  static_assert(std::is_same<FIM, CFIM>::value, "FIM, CFIM must be the same type");
 
   FIM ifim = CGAL::get_initialized_face_index_map(g, np);
 
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
index ef8cc06083f9..8a0744933e3a 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
@@ -123,14 +123,14 @@ class Gps_agg_meta_traits :
   typedef typename Arr::Right_side_category     Right_side_category;
 
   // a side is either oblivious or open (unbounded)
-  static_assert((std::is_same<Left_side_category, Arr_oblivious_side_tag>::value ||
-                         std::is_same<Left_side_category, Arr_open_side_tag>::value));
-  static_assert((std::is_same<Bottom_side_category, Arr_oblivious_side_tag>::value ||
-                         std::is_same<Bottom_side_category, Arr_open_side_tag>::value));
-  static_assert((std::is_same<Top_side_category, Arr_oblivious_side_tag>::value ||
-                         std::is_same<Top_side_category, Arr_open_side_tag>::value));
-  static_assert((std::is_same<Right_side_category, Arr_oblivious_side_tag>::value ||
-                         std::is_same<Right_side_category, Arr_open_side_tag>::value));
+  static_assert(std::is_same<Left_side_category, Arr_oblivious_side_tag>::value ||
+                         std::is_same<Left_side_category, Arr_open_side_tag>::value);
+  static_assert(std::is_same<Bottom_side_category, Arr_oblivious_side_tag>::value ||
+                         std::is_same<Bottom_side_category, Arr_open_side_tag>::value);
+  static_assert(std::is_same<Top_side_category, Arr_oblivious_side_tag>::value ||
+                         std::is_same<Top_side_category, Arr_open_side_tag>::value);
+  static_assert(std::is_same<Right_side_category, Arr_oblivious_side_tag>::value ||
+                         std::is_same<Right_side_category, Arr_open_side_tag>::value);
 
   typedef typename Arr::Halfedge_handle         Halfedge_handle;
   typedef typename Arr::Vertex_handle           Vertex_handle;
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
index 9c59b4f32753..d9d6f19c1c90 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
@@ -53,14 +53,14 @@ class Gps_traits_decorator
   typedef typename Base::Right_side_category       Right_side_category;
 
   // a side is either oblivious or open (unbounded)
-  static_assert((std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
-                         std::is_same< Left_side_category, Arr_open_side_tag >::value));
-  static_assert((std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
-                         std::is_same< Bottom_side_category, Arr_open_side_tag >::value));
-  static_assert((std::is_same< Top_side_category, Arr_oblivious_side_tag >::value ||
-                         std::is_same< Top_side_category, Arr_open_side_tag >::value));
-  static_assert((std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
-                         std::is_same< Right_side_category, Arr_open_side_tag >::value));
+  static_assert(std::is_same< Left_side_category, Arr_oblivious_side_tag >::value ||
+                         std::is_same< Left_side_category, Arr_open_side_tag >::value);
+  static_assert(std::is_same< Bottom_side_category, Arr_oblivious_side_tag >::value ||
+                         std::is_same< Bottom_side_category, Arr_open_side_tag >::value);
+  static_assert(std::is_same< Top_side_category, Arr_oblivious_side_tag >::value ||
+                         std::is_same< Top_side_category, Arr_open_side_tag >::value);
+  static_assert(std::is_same< Right_side_category, Arr_oblivious_side_tag >::value ||
+                         std::is_same< Right_side_category, Arr_open_side_tag >::value);
 
   class Ex_point_2
   {
diff --git a/Circulator/include/CGAL/circulator.h b/Circulator/include/CGAL/circulator.h
index d985eba576c2..2dcb0200ba67 100644
--- a/Circulator/include/CGAL/circulator.h
+++ b/Circulator/include/CGAL/circulator.h
@@ -193,45 +193,45 @@ template <class C> inline
 void Assert_circulator( const C &) {
     typedef typename Circulator_traits<C>::category category;
     CGAL_USE_TYPE(category);
-    static_assert((boost::is_convertible<category, Circulator_tag>::value));
+    static_assert(boost::is_convertible<category, Circulator_tag>::value);
 }
 
 template <class I> inline
 void Assert_iterator( const I &) {
     typedef typename Circulator_traits<I>::category category;
     CGAL_USE_TYPE(category);
-    static_assert((boost::is_convertible<category, Iterator_tag>::value));
+    static_assert(boost::is_convertible<category, Iterator_tag>::value);
 }
 template <class I> inline
 void Assert_input_category( const I &/*i*/) {
     typedef typename std::iterator_traits<I>::iterator_category category;
     CGAL_USE_TYPE(category);
-    static_assert((boost::is_convertible<category, std::input_iterator_tag>::value));
+    static_assert(boost::is_convertible<category, std::input_iterator_tag>::value);
 }
 
 template <class I> inline
 void Assert_output_category( const I &/*i*/) {
   typedef typename std::iterator_traits<I>::iterator_category category;
   CGAL_USE_TYPE(category);
-  static_assert((boost::is_convertible<category, std::output_iterator_tag>::value));
+  static_assert(boost::is_convertible<category, std::output_iterator_tag>::value);
 }
 template <class IC> inline
 void Assert_forward_category( const IC &/*ic*/) {
   typedef typename std::iterator_traits<IC>::iterator_category category;
   CGAL_USE_TYPE(category);
-  static_assert((boost::is_convertible<category, std::forward_iterator_tag>::value));
+  static_assert(boost::is_convertible<category, std::forward_iterator_tag>::value);
 }
 template <class IC> inline
 void Assert_bidirectional_category( const IC &/*ic*/) {
   typedef typename std::iterator_traits<IC>::iterator_category category;
   CGAL_USE_TYPE(category);
-  static_assert((boost::is_convertible<category, std::bidirectional_iterator_tag>::value));
+  static_assert(boost::is_convertible<category, std::bidirectional_iterator_tag>::value);
 }
 template <class IC> inline
 void Assert_random_access_category( const IC &/*ic*/) {
   typedef typename std::iterator_traits<IC>::iterator_category category;
   CGAL_USE_TYPE(category);
-  static_assert((boost::is_convertible<category, std::random_access_iterator_tag>::value));
+  static_assert(boost::is_convertible<category, std::random_access_iterator_tag>::value);
 }
 // The assert at-least-category functions use the following
 // functions to resolve properly. Note the proper order of the
diff --git a/Combinatorial_map/include/CGAL/Cell_iterators.h b/Combinatorial_map/include/CGAL/Cell_iterators.h
index 9f7095c1900f..93104ba01e20 100644
--- a/Combinatorial_map/include/CGAL/Cell_iterators.h
+++ b/Combinatorial_map/include/CGAL/Cell_iterators.h
@@ -82,8 +82,8 @@ namespace CGAL {
       Ite(amap, adart, amap.get_new_mark()),
       mcell_mark_number(amap.get_new_mark())
     {
-      static_assert( (std::is_same<typename Ite::Basic_iterator,
-                              Tag_true>::value) );
+      static_assert(std::is_same<typename Ite::Basic_iterator,
+                              Tag_true>::value);
       CGAL_assertion(amap.is_whole_map_unmarked(mcell_mark_number));
 
       mark_cell<Map,i,dim>(amap, adart, mcell_mark_number);
@@ -196,8 +196,8 @@ namespace CGAL {
       Ite(amap, adart),
       mmark_number(amap.get_new_mark())
     {
-      static_assert( (std::is_same<typename Ite::Basic_iterator,
-                              Tag_true>::value) );
+      static_assert(std::is_same<typename Ite::Basic_iterator,
+                              Tag_true>::value);
       CGAL_assertion(amap.is_whole_map_unmarked(mmark_number));
       mark_cell<Map,i,dim>(amap, adart, mmark_number);
     }
@@ -303,8 +303,8 @@ namespace CGAL {
       Base(amap),
       mmark_number(amap.get_new_mark())
     {
-      static_assert( (std::is_same<typename Base::Basic_iterator,
-                              Tag_true>::value) );
+      static_assert(std::is_same<typename Base::Basic_iterator,
+                              Tag_true>::value);
       CGAL_assertion(amap.is_whole_map_unmarked(mmark_number));
       mark_cell<Map,i,dim>(amap, (*this), mmark_number);
     }
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map.h b/Combinatorial_map/include/CGAL/Combinatorial_map.h
index 7266c4cd5419..e2145afb1f3c 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map.h
@@ -1524,8 +1524,8 @@ namespace CGAL {
     template < class Ite >
     std::ostream& display_orbits(std::ostream & aos) const
     {
-      static_assert( (std::is_same<typename Ite::Basic_iterator,
-                              Tag_true>::value) );
+      static_assert(std::is_same<typename Ite::Basic_iterator,
+                              Tag_true>::value);
       unsigned int nb = 0;
       size_type amark = get_new_mark();
       for ( typename Dart_range::const_iterator it1(darts().begin()),
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_basic_operations.h b/Combinatorial_map/include/CGAL/Combinatorial_map_basic_operations.h
index 56991cc55d16..7cb121ff1d80 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_basic_operations.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_basic_operations.h
@@ -34,8 +34,8 @@ namespace CGAL
                             typename Map::Dart_const_descriptor adart1,
                             typename Map::Dart_const_descriptor adart2)
   {
-    static_assert( (std::is_same<typename Iterator::Basic_iterator,
-                                           Tag_false>::value) );
+    static_assert(std::is_same<typename Iterator::Basic_iterator,
+                                           Tag_false>::value);
     bool found=false;
 
     for (Iterator it(amap, adart1); !found && it.cont(); ++it)
@@ -57,8 +57,8 @@ namespace CGAL
                              typename Map::Dart_const_descriptor adart,
                              typename Map::size_type amark)
   {
-    static_assert( (std::is_same<typename Iterator::Basic_iterator,
-                                           Tag_false>::value) );
+    static_assert(std::is_same<typename Iterator::Basic_iterator,
+                                           Tag_false>::value);
     bool res=true;
 
     for ( Iterator it(amap, adart); res && it.cont(); ++it )
@@ -98,8 +98,8 @@ namespace CGAL
                                      typename Map::Dart_const_descriptor adart,
                                      typename Map::size_type amark)
   {
-    static_assert( (std::is_same<typename Iterator::Basic_iterator,
-                            Tag_true>::value) );
+    static_assert(std::is_same<typename Iterator::Basic_iterator,
+                            Tag_true>::value);
     CGAL_assertion( (is_whole_orbit_unmarked<Map,
                      CMap_non_basic_iterator<Map,Iterator> >
                      (amap, adart, amark)) );
@@ -305,8 +305,8 @@ namespace CGAL
                                               typename Map::size_type amark,
                                               typename Map::size_type amark2=Map::INVALID_MARK)
   {
-    static_assert( (std::is_same<typename Iterator::Basic_iterator,
-                            Tag_true>::value) );
+    static_assert(std::is_same<typename Iterator::Basic_iterator,
+                            Tag_true>::value);
     CGAL_assertion( (is_whole_orbit_unmarked<Map,
                      CMap_non_basic_iterator<Map,Iterator> >
                      (amap, adart, amark)) );
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h b/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
index 25419ab98c05..a50266f76592 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
@@ -305,8 +305,8 @@ namespace CGAL {
 
     typedef typename Map::size_type size_type;
 
-    static_assert( (Bi<=Map::dimension &&
-                            std::is_same<Ite_has_stack,Tag_false>::value) );
+    static_assert(Bi<=Map::dimension &&
+                            std::is_same<Ite_has_stack,Tag_false>::value);
 
   public:
     /// Main constructor.
@@ -493,8 +493,8 @@ namespace CGAL {
 
     typedef typename Map::size_type size_type;
 
-    static_assert( (std::is_same<typename Base::Basic_iterator,
-                            Tag_true>::value) );
+    static_assert(std::is_same<typename Base::Basic_iterator,
+                            Tag_true>::value);
 
     /// Main constructor.
     CMap_non_basic_iterator(Map& amap, Dart_descriptor adart1):
@@ -579,8 +579,8 @@ namespace CGAL {
     /// True iff this iterator is basic
     typedef Tag_false Basic_iterator;
 
-    static_assert( (std::is_same<typename Base::Basic_iterator,
-                            Tag_true>::value) );
+    static_assert(std::is_same<typename Base::Basic_iterator,
+                            Tag_true>::value);
 
     /// Main constructor.
     CMap_non_basic_iterator(Map& amap, Dart_descriptor adart):
diff --git a/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp b/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp
index cbb64ac931c7..c52ef82bf227 100644
--- a/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp
+++ b/Convex_hull_3/test/Convex_hull_3/quick_hull_default_traits.cpp
@@ -23,12 +23,12 @@ using namespace CGAL::Convex_hull_3::internal;
 
 int main()
 {
-  static_assert( (std::is_same<EPEC,Default_traits_for_Chull_3<EPEC::Point_3>::type>::value) );
-  static_assert( (std::is_same<SCD,Default_traits_for_Chull_3<SCD::Point_3>::type>::value) );
-  static_assert( (std::is_same<SHD,Default_traits_for_Chull_3<SHD::Point_3>::type>::value) );
-  static_assert( (std::is_same<SCR,Default_traits_for_Chull_3<SCR::Point_3>::type>::value) );
-  static_assert( (std::is_same<EPEC,Default_traits_for_Chull_3<EPEC::Point_3>::type>::value) );
-  static_assert( (std::is_same<CGAL::Convex_hull_traits_3<EPIC, CGAL::Default, CGAL::Tag_true>,Default_traits_for_Chull_3<EPIC::Point_3>::type>::value) );
-  static_assert( (std::is_same<Is_on_positive_side_of_plane_3<CGAL::Convex_hull_traits_3<EPIC, CGAL::Default, CGAL::Tag_true>, boost::true_type >::Protector,CGAL::Protect_FPU_rounding<true> >::value) );
+  static_assert(std::is_same<EPEC,Default_traits_for_Chull_3<EPEC::Point_3>::type>::value);
+  static_assert(std::is_same<SCD,Default_traits_for_Chull_3<SCD::Point_3>::type>::value);
+  static_assert(std::is_same<SHD,Default_traits_for_Chull_3<SHD::Point_3>::type>::value);
+  static_assert(std::is_same<SCR,Default_traits_for_Chull_3<SCR::Point_3>::type>::value);
+  static_assert(std::is_same<EPEC,Default_traits_for_Chull_3<EPEC::Point_3>::type>::value);
+  static_assert(std::is_same<CGAL::Convex_hull_traits_3<EPIC, CGAL::Default, CGAL::Tag_true>,Default_traits_for_Chull_3<EPIC::Point_3>::type>::value);
+  static_assert(std::is_same<Is_on_positive_side_of_plane_3<CGAL::Convex_hull_traits_3<EPIC, CGAL::Default, CGAL::Tag_true>, boost::true_type >::Protector,CGAL::Protect_FPU_rounding<true> >::value);
   return 0;
 }
diff --git a/Generalized_map/include/CGAL/GMap_cell_iterators.h b/Generalized_map/include/CGAL/GMap_cell_iterators.h
index f708a3a1321b..55dbbff83086 100644
--- a/Generalized_map/include/CGAL/GMap_cell_iterators.h
+++ b/Generalized_map/include/CGAL/GMap_cell_iterators.h
@@ -70,8 +70,8 @@ namespace CGAL {
       Base(amap),
       mmark_number(amap.get_new_mark())
     {
-      static_assert( (std::is_same<typename Base::Basic_iterator,
-                              Tag_true>::value) );
+      static_assert(std::is_same<typename Base::Basic_iterator,
+                              Tag_true>::value);
       CGAL_assertion(amap.is_whole_map_unmarked(mmark_number));
       mark_cell<Map,i,dim>(amap, (*this), mmark_number);
     }
@@ -183,8 +183,8 @@ namespace CGAL {
       Base(amap),
       mmark_number(amap.get_new_mark())
     {
-      static_assert( (std::is_same<typename Base::Basic_iterator,
-                              Tag_true>::value) );
+      static_assert(std::is_same<typename Base::Basic_iterator,
+                              Tag_true>::value);
       CGAL_assertion(amap.is_whole_map_unmarked(mmark_number));
       mark_cell<Map,i,dim>(amap, (*this), mmark_number);
     }
diff --git a/Generalized_map/include/CGAL/GMap_dart_iterators.h b/Generalized_map/include/CGAL/GMap_dart_iterators.h
index 1545166af3aa..b2eaaf97b70a 100644
--- a/Generalized_map/include/CGAL/GMap_dart_iterators.h
+++ b/Generalized_map/include/CGAL/GMap_dart_iterators.h
@@ -154,7 +154,7 @@ namespace CGAL {
     typedef Tag_false Use_mark;      ///< True iff this iterator uses mark
     typedef Tag_true Basic_iterator; ///< True iff this iterator is basic
 
-    static_assert( (0<=Ai && Ai+delta<=Map::dimension && delta>1) );
+    static_assert(0<=Ai && Ai+delta<=Map::dimension && delta>1);
 
   public:
     /// Main constructor.
@@ -468,9 +468,9 @@ namespace CGAL {
     typedef Tag_false Use_mark;      ///< True iff this iterator uses mark
     typedef Tag_true Basic_iterator; ///< True iff this iterator is basic
 
-    static_assert( (0<=Ai && delta1<delta2 &&
+    static_assert(0<=Ai && delta1<delta2 &&
                             Ai+delta2<=Map::dimension &&
-                            delta1>1) );
+                            delta1>1);
 
   public:
     /// Main constructor.
diff --git a/Generalized_map/include/CGAL/Generalized_map.h b/Generalized_map/include/CGAL/Generalized_map.h
index bc9b60c0f905..d7f75bd151ac 100644
--- a/Generalized_map/include/CGAL/Generalized_map.h
+++ b/Generalized_map/include/CGAL/Generalized_map.h
@@ -1347,8 +1347,8 @@ namespace CGAL {
     template < class Ite >
     std::ostream& display_orbits(std::ostream & aos) const
     {
-      static_assert( (std::is_same<typename Ite::Basic_iterator,
-                              Tag_true>::value) );
+      static_assert(std::is_same<typename Ite::Basic_iterator,
+                              Tag_true>::value);
       unsigned int nb = 0;
       size_type amark = get_new_mark();
       for ( typename Dart_range::const_iterator it1(darts().begin()),
diff --git a/Generalized_map/include/CGAL/Generalized_map_iterators_base.h b/Generalized_map/include/CGAL/Generalized_map_iterators_base.h
index 6e9976bca4b7..034b1600f936 100644
--- a/Generalized_map/include/CGAL/Generalized_map_iterators_base.h
+++ b/Generalized_map/include/CGAL/Generalized_map_iterators_base.h
@@ -59,8 +59,8 @@ namespace CGAL {
 
     typedef Tag_true Use_mark;
 
-    static_assert( (Ai<=Map::dimension &&
-                            std::is_same<Ite_has_stack,Tag_false>::value) );
+    static_assert(Ai<=Map::dimension &&
+                            std::is_same<Ite_has_stack,Tag_false>::value);
 
   public:
     /// Main constructor.
diff --git a/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h b/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h
index 150efcbf88e0..0d688be64ede 100644
--- a/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h
+++ b/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h
@@ -752,8 +752,8 @@ class Surface_mesh_geodesic_distances_3
     >
 #endif
 {
-  static_assert((std::is_same<Mode, Direct>::value) ||
-                        (std::is_same<Mode, Intrinsic_Delaunay>::value));
+  static_assert(std::is_same<Mode, Direct>::value) ||
+                        (std::is_same<Mode, Intrinsic_Delaunay>::value);
 
   // extract real types from Default
 #ifdef CGAL_EIGEN3_ENABLED
diff --git a/Installation/test/Installation/test_configuration_qt5.cpp b/Installation/test/Installation/test_configuration_qt5.cpp
index 9a869cc25b6d..73206ca0b4fe 100644
--- a/Installation/test/Installation/test_configuration_qt5.cpp
+++ b/Installation/test/Installation/test_configuration_qt5.cpp
@@ -13,7 +13,7 @@ template <typename A, typename B>
 typename CGAL::Coercion_traits<A,B>::Type
 binary_func(const A& a , const B& b){
   typedef CGAL::Coercion_traits<A,B> CT;
-  static_assert((CT::Are_explicit_interoperable::value));
+  static_assert(CT::Are_explicit_interoperable::value);
   typename CT::Cast cast;
   return cast(a)*cast(b);
 }
diff --git a/Intersections_2/include/CGAL/Intersection_traits.h b/Intersections_2/include/CGAL/Intersection_traits.h
index 3bfb327db9e6..67dc75125819 100644
--- a/Intersections_2/include/CGAL/Intersection_traits.h
+++ b/Intersections_2/include/CGAL/Intersection_traits.h
@@ -181,8 +181,8 @@ do_intersect_impl(const A& a, const B& b, Dynamic_dimension_tag) {
 // inline
 // typename Intersection_traits< typename Kernel_traits<A>::Kernel, A, B>::result_type >::type
 // intersection(const A& a, const B& b) {
-//   static_assert( (std::is_same<typename A::Ambient_dimension, typename B::Ambient_dimension>::value),
-//                               "intersection with objects of different dimensions not supported");
+//   static_assert(std::is_same<typename A::Ambient_dimension, typename B::Ambient_dimension>::value),
+//                               "intersection with objects of different dimensions not supported";
 //   return internal::intersection_impl(a, b, typename A::Ambient_dimension());
 // }
 
@@ -190,7 +190,7 @@ do_intersect_impl(const A& a, const B& b, Dynamic_dimension_tag) {
 // inline
 // auto // K::Boolean
 // do_intersect(const A& a, const B& b) {
-//   static_assert((std::is_same<typename A::Ambient_dimension, typename B::Ambient_dimension>::value),
+//   static_assert(std::is_same<typename A::Ambient_dimension, typename B::Ambient_dimension>::value,
 //                         "do_intersect with objects of different dimensions not supported");
 //   return internal::do_intersect_impl(a, b, typename A::Ambient_dimension());
 // }
diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_do_intersect.h b/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_do_intersect.h
index 183158050e80..b62510e78923 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_do_intersect.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Bbox_3_Segment_3_do_intersect.h
@@ -66,7 +66,7 @@ class Do_intersect_bbox_segment_aux_is_greater<FT, bounded_0, true>
   double dmax;
 
 public:
-  static_assert((std::is_same<FT, double>::value));
+  static_assert(std::is_same<FT, double>::value);
 
   Do_intersect_bbox_segment_aux_is_greater() : error(0.), tmax(0.), dmax(0.) {}
 
diff --git a/Interval_support/include/CGAL/Test/_test_bigfloat_interval_traits.h b/Interval_support/include/CGAL/Test/_test_bigfloat_interval_traits.h
index b82269dbf141..ba0ac8f14e73 100644
--- a/Interval_support/include/CGAL/Test/_test_bigfloat_interval_traits.h
+++ b/Interval_support/include/CGAL/Test/_test_bigfloat_interval_traits.h
@@ -41,7 +41,7 @@ void test_bigfloat_interval_traits() {
   typedef typename BFIT::Is_bigfloat_interval Is_bigfloat_interval;
   CGAL_USE_TYPE(Is_bigfloat_interval);
   // using CGAL::Tag_true;
-  static_assert(( ::std::is_same< Is_bigfloat_interval, CGAL::Tag_true>::value));
+  static_assert(::std::is_same< Is_bigfloat_interval, CGAL::Tag_true>::value);
 
   const typename BFIT::Construct construct = typename BFIT::Construct();
   const typename BFIT::Set_precision set_precision = typename BFIT::Set_precision();
diff --git a/Interval_support/include/CGAL/Test/_test_convert_to_bfi.h b/Interval_support/include/CGAL/Test/_test_convert_to_bfi.h
index 59addf6a1fed..8235c825644a 100644
--- a/Interval_support/include/CGAL/Test/_test_convert_to_bfi.h
+++ b/Interval_support/include/CGAL/Test/_test_convert_to_bfi.h
@@ -41,7 +41,7 @@ template <typename BFI, typename From>
 void test_convert_to_bfi_from(BFI,From){
   typedef typename CGAL::Coercion_traits<BFI,From>::Type CT_type;
   CGAL_USE_TYPE(CT_type);
-  static_assert(( ::std::is_same<CT_type, BFI>::value));
+  static_assert(::std::is_same<CT_type, BFI>::value);
   assert(CGAL::convert_to_bfi(From(0))  == BFI(0));
   assert(CGAL::convert_to_bfi(From(1))  == BFI(1));
   assert(CGAL::convert_to_bfi(From(2))  == BFI(2));
diff --git a/Interval_support/include/CGAL/Test/_test_interval_traits.h b/Interval_support/include/CGAL/Test/_test_interval_traits.h
index dffa0a292e9d..e90f8616ff2e 100644
--- a/Interval_support/include/CGAL/Test/_test_interval_traits.h
+++ b/Interval_support/include/CGAL/Test/_test_interval_traits.h
@@ -74,8 +74,8 @@ void test_interval_traits() {
     typedef typename IT::With_empty_interval With_empty_interval;
     CGAL_USE_TYPE(Is_interval);
     using CGAL::Tag_true;
-    static_assert(( ::std::is_same< Is_interval, Tag_true>::value));
-    static_assert(( ::std::is_same< Interval_, Interval>::value));
+    static_assert(::std::is_same< Is_interval, Tag_true>::value);
+    static_assert(::std::is_same< Interval_, Interval>::value);
 
     test_with_empty_interval<Interval>(With_empty_interval());
 
diff --git a/Kernel_23/include/CGAL/Circle_2.h b/Kernel_23/include/CGAL/Circle_2.h
index 48a4896fe4e8..b6020ff75282 100644
--- a/Kernel_23/include/CGAL/Circle_2.h
+++ b/Kernel_23/include/CGAL/Circle_2.h
@@ -35,7 +35,7 @@ class Circle_2 : public R_::Kernel_base::Circle_2
   typedef typename R_::Aff_transformation_2  Aff_transformation_2;
 
   typedef Circle_2                           Self;
-  static_assert((std::is_same<Self, typename R_::Circle_2>::value));
+  static_assert(std::is_same<Self, typename R_::Circle_2>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Circle_3.h b/Kernel_23/include/CGAL/Circle_3.h
index 4da79afd351a..b23e651e9fc8 100644
--- a/Kernel_23/include/CGAL/Circle_3.h
+++ b/Kernel_23/include/CGAL/Circle_3.h
@@ -43,7 +43,7 @@ template <class R_>
   typedef typename R_::Direction_3           Direction_3;
 
   typedef Circle_3                           Self;
-  static_assert((std::is_same<Self, typename R_::Circle_3>::value));
+  static_assert(std::is_same<Self, typename R_::Circle_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Direction_2.h b/Kernel_23/include/CGAL/Direction_2.h
index d3376d740213..407d4e31ed10 100644
--- a/Kernel_23/include/CGAL/Direction_2.h
+++ b/Kernel_23/include/CGAL/Direction_2.h
@@ -38,7 +38,7 @@ class Direction_2 : public R_::Kernel_base::Direction_2
   typedef typename R_::Kernel_base::Direction_2      RDirection_2;
 
   typedef Direction_2                        Self;
-  static_assert((std::is_same<Self, typename R_::Direction_2>::value));
+  static_assert(std::is_same<Self, typename R_::Direction_2>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Direction_3.h b/Kernel_23/include/CGAL/Direction_3.h
index 6c0d13596578..18a88f7954d5 100644
--- a/Kernel_23/include/CGAL/Direction_3.h
+++ b/Kernel_23/include/CGAL/Direction_3.h
@@ -37,7 +37,7 @@ class Direction_3 : public R_::Kernel_base::Direction_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Direction_3                        Self;
-  static_assert((std::is_same<Self, typename R_::Direction_3>::value));
+  static_assert(std::is_same<Self, typename R_::Direction_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Has_conversion.h b/Kernel_23/include/CGAL/Has_conversion.h
index 0a042781facb..4e5d46032545 100644
--- a/Kernel_23/include/CGAL/Has_conversion.h
+++ b/Kernel_23/include/CGAL/Has_conversion.h
@@ -23,9 +23,9 @@ namespace internal {
 template<typename K1, typename K2, typename Rep = typename K1::Rep_tag /* Cartesian_tag */>
 struct Converter_selector
 {
-  static_assert((std::is_same<typename K1::Rep_tag,
-                                            typename K2::Rep_tag>::value),
-                            "Kernels must have the same representation");
+  static_assert(std::is_same<typename K1::Rep_tag,
+                             typename K2::Rep_tag>::value,
+                             "Kernels must have the same representation");
 
   typedef CGAL::Cartesian_converter<K1, K2> type;
 };
@@ -33,9 +33,9 @@ struct Converter_selector
 template<typename K1, typename K2>
 struct Converter_selector<K1, K2, Homogeneous_tag>
 {
-  static_assert((std::is_same<typename K1::Rep_tag,
-                                            typename K2::Rep_tag>::value),
-                            "Kernels must have the same representation");
+  static_assert(std::is_same<typename K1::Rep_tag,
+                             typename K2::Rep_tag>::value,
+                             "Kernels must have the same representation");
 
   typedef CGAL::Homogeneous_converter<K1, K2> type;
 };
diff --git a/Kernel_23/include/CGAL/Iso_cuboid_3.h b/Kernel_23/include/CGAL/Iso_cuboid_3.h
index 22eeefbd4aaa..d279426727f0 100644
--- a/Kernel_23/include/CGAL/Iso_cuboid_3.h
+++ b/Kernel_23/include/CGAL/Iso_cuboid_3.h
@@ -35,7 +35,7 @@ class Iso_cuboid_3 : public R_::Kernel_base::Iso_cuboid_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Iso_cuboid_3                    Self;
-  static_assert((std::is_same<Self, typename R_::Iso_cuboid_3>::value));
+  static_assert(std::is_same<Self, typename R_::Iso_cuboid_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Iso_rectangle_2.h b/Kernel_23/include/CGAL/Iso_rectangle_2.h
index e02aad3d267f..7d3dc5a47096 100644
--- a/Kernel_23/include/CGAL/Iso_rectangle_2.h
+++ b/Kernel_23/include/CGAL/Iso_rectangle_2.h
@@ -33,7 +33,7 @@ class Iso_rectangle_2 : public R_::Kernel_base::Iso_rectangle_2
   typedef typename R_::Aff_transformation_2  Aff_transformation_2;
 
   typedef Iso_rectangle_2                    Self;
-  static_assert((std::is_same<Self, typename R_::Iso_rectangle_2>::value));
+  static_assert(std::is_same<Self, typename R_::Iso_rectangle_2>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Line_2.h b/Kernel_23/include/CGAL/Line_2.h
index 141e6d6fb130..33406d119a5b 100644
--- a/Kernel_23/include/CGAL/Line_2.h
+++ b/Kernel_23/include/CGAL/Line_2.h
@@ -41,7 +41,7 @@ class Line_2 : public R_::Kernel_base::Line_2
   typedef typename R_::Kernel_base::Line_2   RLine_2;
 
   typedef Line_2                             Self;
-  static_assert((std::is_same<Self, typename R_::Line_2>::value));
+  static_assert(std::is_same<Self, typename R_::Line_2>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Line_3.h b/Kernel_23/include/CGAL/Line_3.h
index 8ceb47b6280e..ebfb32c7972a 100644
--- a/Kernel_23/include/CGAL/Line_3.h
+++ b/Kernel_23/include/CGAL/Line_3.h
@@ -38,7 +38,7 @@ class Line_3 : public R_::Kernel_base::Line_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Line_3                             Self;
-  static_assert((std::is_same<Self, typename R_::Line_3>::value));
+  static_assert(std::is_same<Self, typename R_::Line_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Plane_3.h b/Kernel_23/include/CGAL/Plane_3.h
index f41fc96bb813..b391b4388d28 100644
--- a/Kernel_23/include/CGAL/Plane_3.h
+++ b/Kernel_23/include/CGAL/Plane_3.h
@@ -41,7 +41,7 @@ class Plane_3 : public R_::Kernel_base::Plane_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Plane_3                            Self;
-  static_assert((std::is_same<Self, typename R_::Plane_3>::value));
+  static_assert(std::is_same<Self, typename R_::Plane_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Point_2.h b/Kernel_23/include/CGAL/Point_2.h
index ee8df80b3298..96bffa243e22 100644
--- a/Kernel_23/include/CGAL/Point_2.h
+++ b/Kernel_23/include/CGAL/Point_2.h
@@ -37,7 +37,7 @@ class Point_2 : public R_::Kernel_base::Point_2
   typedef typename R_::Kernel_base::Point_2  RPoint_2;
 
   typedef Point_2                            Self;
-  static_assert((std::is_same<Self, typename R_::Point_2>::value));
+  static_assert(std::is_same<Self, typename R_::Point_2>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Point_3.h b/Kernel_23/include/CGAL/Point_3.h
index 27d1d19e0dfe..f2444a9506c0 100644
--- a/Kernel_23/include/CGAL/Point_3.h
+++ b/Kernel_23/include/CGAL/Point_3.h
@@ -34,7 +34,7 @@ class Point_3 : public R_::Kernel_base::Point_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Point_3                            Self;
-  static_assert((std::is_same<Self, typename R_::Point_3>::value));
+  static_assert(std::is_same<Self, typename R_::Point_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Ray_2.h b/Kernel_23/include/CGAL/Ray_2.h
index 73eecc1c025d..626730bbc864 100644
--- a/Kernel_23/include/CGAL/Ray_2.h
+++ b/Kernel_23/include/CGAL/Ray_2.h
@@ -42,7 +42,7 @@ class Ray_2 : public R_::Kernel_base::Ray_2
   typedef typename R_::Kernel_base::Ray_2    RRay_2;
 
   typedef Ray_2                              Self;
-  static_assert((std::is_same<Self, typename R_::Ray_2>::value));
+  static_assert(std::is_same<Self, typename R_::Ray_2>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Ray_3.h b/Kernel_23/include/CGAL/Ray_3.h
index c2880eab254e..b415af7ad01b 100644
--- a/Kernel_23/include/CGAL/Ray_3.h
+++ b/Kernel_23/include/CGAL/Ray_3.h
@@ -36,7 +36,7 @@ class Ray_3 : public R_::Kernel_base::Ray_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Ray_3                            Self;
-  static_assert((std::is_same<Self, typename R_::Ray_3>::value));
+  static_assert(std::is_same<Self, typename R_::Ray_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Segment_2.h b/Kernel_23/include/CGAL/Segment_2.h
index b789fe25aac8..d5d89246f3ba 100644
--- a/Kernel_23/include/CGAL/Segment_2.h
+++ b/Kernel_23/include/CGAL/Segment_2.h
@@ -40,7 +40,7 @@ class Segment_2 : public R_::Kernel_base::Segment_2
   typedef typename R_::Kernel_base::Segment_2 RSegment_2;
 
   typedef Segment_2                           Self;
-  static_assert((std::is_same<Self, typename R_::Segment_2>::value));
+  static_assert(std::is_same<Self, typename R_::Segment_2>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Segment_3.h b/Kernel_23/include/CGAL/Segment_3.h
index 45aa885fe1d2..61e02d657db1 100644
--- a/Kernel_23/include/CGAL/Segment_3.h
+++ b/Kernel_23/include/CGAL/Segment_3.h
@@ -38,7 +38,7 @@ class Segment_3 : public R_::Kernel_base::Segment_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Segment_3                          Self;
-  static_assert((std::is_same<Self, typename R_::Segment_3>::value));
+  static_assert(std::is_same<Self, typename R_::Segment_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Sphere_3.h b/Kernel_23/include/CGAL/Sphere_3.h
index 76fa374f831c..b0a7c271e246 100644
--- a/Kernel_23/include/CGAL/Sphere_3.h
+++ b/Kernel_23/include/CGAL/Sphere_3.h
@@ -37,7 +37,7 @@ class Sphere_3 : public R_::Kernel_base::Sphere_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Sphere_3                           Self;
-  static_assert((std::is_same<Self, typename R_::Sphere_3>::value));
+  static_assert(std::is_same<Self, typename R_::Sphere_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Tetrahedron_3.h b/Kernel_23/include/CGAL/Tetrahedron_3.h
index 58710cbd72ce..549680d25544 100644
--- a/Kernel_23/include/CGAL/Tetrahedron_3.h
+++ b/Kernel_23/include/CGAL/Tetrahedron_3.h
@@ -33,7 +33,7 @@ class Tetrahedron_3 : public R_::Kernel_base::Tetrahedron_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Tetrahedron_3                      Self;
-  static_assert((std::is_same<Self, typename R_::Tetrahedron_3>::value));
+  static_assert(std::is_same<Self, typename R_::Tetrahedron_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Triangle_2.h b/Kernel_23/include/CGAL/Triangle_2.h
index 1e1d38e707e8..8deabe91f6ea 100644
--- a/Kernel_23/include/CGAL/Triangle_2.h
+++ b/Kernel_23/include/CGAL/Triangle_2.h
@@ -35,7 +35,7 @@ class Triangle_2 : public R_::Kernel_base::Triangle_2
   typedef typename R_::Kernel_base::Triangle_2  RTriangle_2;
 
   typedef Triangle_2                            Self;
-  static_assert((std::is_same<Self, typename R_::Triangle_2>::value));
+  static_assert(std::is_same<Self, typename R_::Triangle_2>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Triangle_3.h b/Kernel_23/include/CGAL/Triangle_3.h
index 93d30cc4de2a..19bbd8064eca 100644
--- a/Kernel_23/include/CGAL/Triangle_3.h
+++ b/Kernel_23/include/CGAL/Triangle_3.h
@@ -36,7 +36,7 @@ class Triangle_3 : public R_::Kernel_base::Triangle_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Triangle_3                         Self;
-  static_assert((std::is_same<Self, typename R_::Triangle_3>::value));
+  static_assert(std::is_same<Self, typename R_::Triangle_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Vector_2.h b/Kernel_23/include/CGAL/Vector_2.h
index dcb85eaeb4ad..4449fc3ef9f0 100644
--- a/Kernel_23/include/CGAL/Vector_2.h
+++ b/Kernel_23/include/CGAL/Vector_2.h
@@ -42,7 +42,7 @@ class Vector_2 : public R_::Kernel_base::Vector_2
   typedef typename R_::Kernel_base::Vector_2  RVector_2;
 
   typedef Vector_2                    Self;
-  static_assert((std::is_same<Self, typename R_::Vector_2>::value));
+  static_assert(std::is_same<Self, typename R_::Vector_2>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Vector_3.h b/Kernel_23/include/CGAL/Vector_3.h
index 0d3f16fc2fc5..9220f3e8527b 100644
--- a/Kernel_23/include/CGAL/Vector_3.h
+++ b/Kernel_23/include/CGAL/Vector_3.h
@@ -42,7 +42,7 @@ class Vector_3 : public R_::Kernel_base::Vector_3
   typedef typename R_::Aff_transformation_3  Aff_transformation_3;
 
   typedef Vector_3                            Self;
-  static_assert((std::is_same<Self, typename R_::Vector_3>::value));
+  static_assert(std::is_same<Self, typename R_::Vector_3>::value);
 
 public:
 
diff --git a/Kernel_23/include/CGAL/Weighted_point_2.h b/Kernel_23/include/CGAL/Weighted_point_2.h
index d2c4f4a48e1d..32ca07df1535 100644
--- a/Kernel_23/include/CGAL/Weighted_point_2.h
+++ b/Kernel_23/include/CGAL/Weighted_point_2.h
@@ -34,7 +34,7 @@ class Weighted_point_2 : public R_::Kernel_base::Weighted_point_2
   typedef typename R_::FT                             RT;
 
   typedef Weighted_point_2<R_>                        Self;
-  static_assert((std::is_same<Self, typename R_::Weighted_point_2>::value));
+  static_assert(std::is_same<Self, typename R_::Weighted_point_2>::value);
 
 public:
   typedef Dimension_tag<2>                            Ambient_dimension;
diff --git a/Kernel_23/include/CGAL/Weighted_point_3.h b/Kernel_23/include/CGAL/Weighted_point_3.h
index b9358604af8d..28e8f9489a55 100644
--- a/Kernel_23/include/CGAL/Weighted_point_3.h
+++ b/Kernel_23/include/CGAL/Weighted_point_3.h
@@ -34,7 +34,7 @@ class Weighted_point_3 : public R_::Kernel_base::Weighted_point_3
   typedef typename R_::FT                    FT;
 
   typedef Weighted_point_3                            Self;
-  static_assert((std::is_same<Self, typename R_::Weighted_point_3>::value));
+  static_assert(std::is_same<Self, typename R_::Weighted_point_3>::value);
 
 public:
 
diff --git a/Kernel_23/test/Kernel_23/test_RT_or_FT_predicates.cpp b/Kernel_23/test/Kernel_23/test_RT_or_FT_predicates.cpp
index 03b2787cc0b3..b0771f329ca7 100644
--- a/Kernel_23/test/Kernel_23/test_RT_or_FT_predicates.cpp
+++ b/Kernel_23/test/Kernel_23/test_RT_or_FT_predicates.cpp
@@ -229,12 +229,12 @@ void generate_atomic_compilation_test(const std::string& FT_name,
 
   if(check != NO_CHECK)
   {
-    out << "  static_assert((std::is_same<decltype(";
+    out << "  static_assert(std::is_same<decltype(";
 
     out << "p(";
     for(std::size_t j=0, i=parameters.size(); j<i; ++j)
       out << ((j != 0) ? ", o" : "o") << j;
-    out << "))";
+    out << ")";
 
     if(check == CHECK_NO_NEEDS_FT)
       out << ", B>::value));\n";
diff --git a/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h b/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
index e336fe53d397..d30acbcb141c 100644
--- a/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
+++ b/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
@@ -485,8 +485,8 @@ class Compact_mesh_cell_3
   template<typename GT_>
   const Point_3& weighted_circumcenter(const GT_& gt) const
   {
-    static_assert((std::is_same<Point_3,
-      typename GT_::Construct_weighted_circumcenter_3::result_type>::value));
+    static_assert(std::is_same<Point_3,
+      typename GT_::Construct_weighted_circumcenter_3::result_type>::value);
     if (internal_tbb::is_null(weighted_circumcenter_)) {
       this->try_to_set_circumcenter(
         new Point_3(gt.construct_weighted_circumcenter_3_object()
diff --git a/Mesh_3/include/CGAL/Mesh_criteria_3.h b/Mesh_3/include/CGAL/Mesh_criteria_3.h
index cd46b813cd64..0fa4cf439021 100644
--- a/Mesh_3/include/CGAL/Mesh_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_criteria_3.h
@@ -101,19 +101,19 @@ class Mesh_criteria_3_impl
 
   template <typename Facet_criterion>
   void add_facet_criterion(Facet_criterion* criterion) {
-    static_assert((boost::is_base_of<
+    static_assert(boost::is_base_of<
                            typename Facet_criteria::Abstract_criterion,
                            Facet_criterion
-                           >::value));
+                           >::value);
     facet_criteria_.add(criterion);
   }
 
   template <typename Cell_criterion>
   void add_cell_criterion(Cell_criterion* criterion) {
-    static_assert((boost::is_base_of<
+    static_assert(boost::is_base_of<
                            typename Cell_criteria::Abstract_criterion,
                            Cell_criterion
-                           >::value));
+                           >::value);
     cell_criteria_.add(criterion);
   }
 
diff --git a/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp b/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
index 76addcd6f618..cb8bcbe6125b 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_polyhedron.cpp
@@ -35,10 +35,10 @@ struct Polyhedron_tester : public Tester<K>
     typedef CGAL::Polyhedron_3<Gt> Polyhedron;
     typedef CGAL::Polyhedral_mesh_domain_3<Polyhedron, Gt> Mesh_domain;
 
-    static_assert((std::is_same<
+    static_assert(std::is_same<
                             typename Mesh_domain::Surface_patch_index,
                             std::pair<int, int>
-                           >::value));
+                           >::value);
 
     typedef typename CGAL::Mesh_triangulation_3<
       Mesh_domain,
diff --git a/Nef_2/include/CGAL/Nef_2/PM_overlayer.h b/Nef_2/include/CGAL/Nef_2/PM_overlayer.h
index 5ce03215db3d..a1aced0e3ff2 100644
--- a/Nef_2/include/CGAL/Nef_2/PM_overlayer.h
+++ b/Nef_2/include/CGAL/Nef_2/PM_overlayer.h
@@ -959,7 +959,7 @@ bool is_forward_edge(const Const_decorator& N,
 
 void assert_type_precondition() const
 { typename PM_decorator_::Point p1; Point p2;
-  static_assert((std::is_same<typename PM_decorator_::Point, Point>::value)); }
+  static_assert(std::is_same<typename PM_decorator_::Point, Point>::value); }
 
 
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h b/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h
index b00b0af2d161..31f86c5c43a0 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Kernel_d_interface.h
@@ -135,8 +135,8 @@ template <class Base_> struct Kernel_d_interface : public Base_ {
           typedef typename Base::Point_cartesian_const_iterator result_type;
           // Kernel_d requires a common iterator type for points and vectors
           // TODO: provide this mixed functor in preKernel?
-          // static_assert((std::is_same<typename CGAL::decay<typename boost::result_of<CVI(Vector_d,CGAL::Begin_tag)>::type>::type, result_type>::value));
-          // static_assert((std::is_same<typename CGAL::decay<typename CVI::result_type>::type, result_type>::value));
+          // static_assert(std::is_same<typename CGAL::decay<typename boost::result_of<CVI(Vector_d,CGAL::Begin_tag)>::type>::type, result_type>::value);
+          // static_assert(std::is_same<typename CGAL::decay<typename CVI::result_type>::type, result_type>::value);
           template <class Tag_>
           auto operator()(Point_d const&p, Tag_ t)const{
             return CPI(this->kernel())(p,t);
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Hyperplane_d.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Hyperplane_d.h
index c4f7a47040b5..4efc63d87a64 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Hyperplane_d.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Hyperplane_d.h
@@ -32,7 +32,7 @@ class Hyperplane_d : public Get_type<typename R_::Kernel_base, Hyperplane_tag>::
   typedef typename Get_functor<Kbase, Hyperplane_translation_tag>::type                        HTBase;
 
   typedef Hyperplane_d                            Self;
-  static_assert((std::is_same<Self, typename Get_type<R_, Hyperplane_tag>::type>::value));
+  static_assert(std::is_same<Self, typename Get_type<R_, Hyperplane_tag>::type>::value);
 
 public:
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Point_d.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Point_d.h
index ed038e9c95f9..af2d970f3f28 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Point_d.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Point_d.h
@@ -40,7 +40,7 @@ class Point_d : public Get_type<typename R_::Kernel_base, Point_tag>::type
 
 
   typedef Point_d                            Self;
-  static_assert((std::is_same<Self, typename Get_type<R_, Point_tag>::type>::value));
+  static_assert(std::is_same<Self, typename Get_type<R_, Point_tag>::type>::value);
 
 public:
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Ref_count_obj.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Ref_count_obj.h
index 364a4184e96d..097a41f97554 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Ref_count_obj.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Ref_count_obj.h
@@ -33,7 +33,7 @@ class Ref_count_obj
   typedef typename Get_functor<Kbase, Construct_ttag<Tag_> >::type CBase;
 
   typedef Ref_count_obj                        Self;
-  static_assert((std::is_same<Self, typename Get_type<R_, Tag_>::type>::value));
+  static_assert(std::is_same<Self, typename Get_type<R_, Tag_>::type>::value);
 
 public:
   typedef R_ R;
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Segment_d.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Segment_d.h
index a45ce922e124..c450300b5873 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Segment_d.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Segment_d.h
@@ -35,7 +35,7 @@ class Segment_d : public Get_type<typename R_::Kernel_base, Segment_tag>::type
   typedef typename Get_functor<Kbase, Segment_extremity_tag>::type CSEBase;
 
   typedef Segment_d                            Self;
-  static_assert((std::is_same<Self, typename Get_type<R_, Segment_tag>::type>::value));
+  static_assert(std::is_same<Self, typename Get_type<R_, Segment_tag>::type>::value);
 
 public:
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Sphere_d.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Sphere_d.h
index 409c9b65e3f3..611217e9acd4 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Sphere_d.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Sphere_d.h
@@ -32,7 +32,7 @@ class Sphere_d : public Get_type<typename R_::Kernel_base, Sphere_tag>::type
   typedef typename Get_functor<Kbase, Squared_radius_tag>::type                        SRBase;
 
   typedef Sphere_d                            Self;
-  static_assert((std::is_same<Self, typename Get_type<R_, Sphere_tag>::type>::value));
+  static_assert(std::is_same<Self, typename Get_type<R_, Sphere_tag>::type>::value);
 
 public:
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Vector_d.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Vector_d.h
index 9593ef91bbc6..1b150be0aae5 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Vector_d.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Vector_d.h
@@ -39,7 +39,7 @@ class Vector_d : public Get_type<typename R_::Kernel_base, Vector_tag>::type
   typedef typename Get_functor<Kbase, Squared_length_tag>::type SLBase;
 
   typedef Vector_d                            Self;
-  static_assert((std::is_same<Self, typename Get_type<R_, Vector_tag>::type>::value));
+  static_assert(std::is_same<Self, typename Get_type<R_, Vector_tag>::type>::value);
 
 public:
 
diff --git a/NewKernel_d/test/NewKernel_d/Epick_d.cpp b/NewKernel_d/test/NewKernel_d/Epick_d.cpp
index 1e88061cbf15..18ac1657ee63 100644
--- a/NewKernel_d/test/NewKernel_d/Epick_d.cpp
+++ b/NewKernel_d/test/NewKernel_d/Epick_d.cpp
@@ -740,11 +740,11 @@ template struct CGAL::Epick_d<CGAL::Dynamic_dimension_tag>;
 typedef CGAL::Epick_d<CGAL::Dimension_tag<2> > Ker2;
 typedef CGAL::Epick_d<CGAL::Dimension_tag<3> > Ker3;
 typedef CGAL::Epick_d<CGAL::Dynamic_dimension_tag> Kerd;
-static_assert((std::is_same<CGAL::Dimension_tag<2>,Ker2::Dimension>::value));
-static_assert((std::is_same<CGAL::Dimension_tag<3>,Ker3::Dimension>::value));
-static_assert((std::is_same<CGAL::Dynamic_dimension_tag,Kerd::Dimension>::value));
-static_assert((std::is_same<CGAL::Dimension_tag<2>,CGAL::Ambient_dimension<Ker2::Point_d>::type>::value));
-static_assert((std::is_same<CGAL::Dimension_tag<3>,CGAL::Ambient_dimension<Ker3::Point_d,Ker3>::type>::value));
+static_assert(std::is_same<CGAL::Dimension_tag<2>,Ker2::Dimension>::value);
+static_assert(std::is_same<CGAL::Dimension_tag<3>,Ker3::Dimension>::value);
+static_assert(std::is_same<CGAL::Dynamic_dimension_tag,Kerd::Dimension>::value);
+static_assert(std::is_same<CGAL::Dimension_tag<2>,CGAL::Ambient_dimension<Ker2::Point_d>::type>::value);
+static_assert(std::is_same<CGAL::Dimension_tag<3>,CGAL::Ambient_dimension<Ker3::Point_d,Ker3>::type>::value);
 int main(){
   //Broken with Linear_base_d (output iterator)
   //test2<CGAL::Kernel_d_interface<KK> >();
diff --git a/Number_types/include/CGAL/Lazy_exact_nt.h b/Number_types/include/CGAL/Lazy_exact_nt.h
index be91713a6749..0bca67f5c930 100644
--- a/Number_types/include/CGAL/Lazy_exact_nt.h
+++ b/Number_types/include/CGAL/Lazy_exact_nt.h
@@ -944,9 +944,9 @@ struct Div_mod_selector {
     void operator()( const NT1& x, const NT2& y,
                      NT& q,
                      NT& r ) const {
-      static_assert((::std::is_same<
+      static_assert(::std::is_same<
         typename Coercion_traits< NT1, NT2 >::Type, NT
-                                              >::value));
+                                              >::value);
 
       typename Coercion_traits< NT1, NT2 >::Cast cast;
       operator()( cast(x), cast(y), q, r );
@@ -1029,8 +1029,8 @@ template < typename ET > class Real_embeddable_traits< Lazy_exact_nt<ET> >
   : public INTERN_RET::Real_embeddable_traits_base< Lazy_exact_nt<ET> , CGAL::Tag_true > {
 
   // Every type ET of Lazy_exact_nt<ET> has to be real embeddable.
-  static_assert((::std::is_same< typename Real_embeddable_traits< ET >
-                                ::Is_real_embeddable, Tag_true >::value));
+  static_assert(::std::is_same< typename Real_embeddable_traits< ET >
+                                ::Is_real_embeddable, Tag_true >::value);
 
   public:
     typedef Lazy_exact_nt<ET> Type;
diff --git a/Number_types/include/CGAL/Root_of_traits.h b/Number_types/include/CGAL/Root_of_traits.h
index c014e667293d..32d81e481a97 100644
--- a/Number_types/include/CGAL/Root_of_traits.h
+++ b/Number_types/include/CGAL/Root_of_traits.h
@@ -150,7 +150,7 @@ struct Root_of_traits_helper < FT, Field_tag >
     // We have the typedef as VC10 fails with
     // static_assert(FrT::Is_fraction::value)
     typedef typename FrT::Is_fraction ISF;
-    static_assert((ISF::value));
+    static_assert(ISF::value);
 
 
     typedef typename FrT::Numerator_type      RT;
diff --git a/Number_types/include/CGAL/Test/test_root_of_traits.h b/Number_types/include/CGAL/Test/test_root_of_traits.h
index 23f4b5dafc73..58c1340335f7 100644
--- a/Number_types/include/CGAL/Test/test_root_of_traits.h
+++ b/Number_types/include/CGAL/Test/test_root_of_traits.h
@@ -28,8 +28,8 @@ void test_root_of_traits(){
     typedef typename RoT::Root_of_1 Root_of_1;
     typedef typename RoT::Root_of_2 Root_of_2;
 
-    static_assert((::std::is_same<RootOf1,Root_of_1>::value));
-    static_assert((::std::is_same<RootOf2,Root_of_2>::value));
+    static_assert(::std::is_same<RootOf1,Root_of_1>::value);
+    static_assert(::std::is_same<RootOf2,Root_of_2>::value);
 
     typedef typename RoT::Make_root_of_2 Make_root_of_2;
     typedef typename RoT::Make_sqrt      Make_sqrt;
@@ -41,10 +41,10 @@ void test_root_of_traits(){
     const Inverse&        inverse        = Inverse();
     const Square&         square         = Square();
 
-    static_assert((::std::is_same<Root_of_2,typename Make_root_of_2::result_type>::value));
-    static_assert((::std::is_same<Root_of_2,typename Make_sqrt::result_type>::value));
-    static_assert((::std::is_same<Root_of_2,typename Inverse::result_type>::value));
-    static_assert((::std::is_same<Root_of_2,typename Square::result_type>::value));
+    static_assert(::std::is_same<Root_of_2,typename Make_root_of_2::result_type>::value);
+    static_assert(::std::is_same<Root_of_2,typename Make_sqrt::result_type>::value);
+    static_assert(::std::is_same<Root_of_2,typename Inverse::result_type>::value);
+    static_assert(::std::is_same<Root_of_2,typename Square::result_type>::value);
 
 
     {
diff --git a/Number_types/include/CGAL/simplest_rational_in_interval.h b/Number_types/include/CGAL/simplest_rational_in_interval.h
index a93bcc855b49..fbb5206ffbee 100644
--- a/Number_types/include/CGAL/simplest_rational_in_interval.h
+++ b/Number_types/include/CGAL/simplest_rational_in_interval.h
@@ -43,10 +43,10 @@ simplest_rational_in_interval(double x, double y) {
 
     // Must be a fraction
     CGAL_USE_TYPE(Is_fraction);
-    static_assert((::std::is_same<Is_fraction, Tag_true>::value));
+    static_assert(::std::is_same<Is_fraction, Tag_true>::value);
     // Numerator_type,Denominator_type must be the same
     CGAL_USE_TYPE(Denominator_type);
-    static_assert((::std::is_same<Numerator_type, Denominator_type>::value));
+    static_assert(::std::is_same<Numerator_type, Denominator_type>::value);
 
 
   if(x == y){
diff --git a/Number_types/include/CGAL/to_rational.h b/Number_types/include/CGAL/to_rational.h
index d60f56b3eb24..3ce75dd80327 100644
--- a/Number_types/include/CGAL/to_rational.h
+++ b/Number_types/include/CGAL/to_rational.h
@@ -34,9 +34,9 @@ to_rational(double x)
     typedef typename FT::Denominator_type Denominator_type;
     typename FT::Compose compose;
 
-    static_assert((::std::is_same<Is_fraction,Tag_true>::value));
+    static_assert(::std::is_same<Is_fraction,Tag_true>::value);
     CGAL_USE_TYPE(Is_fraction);
-    static_assert((::std::is_same<Numerator_type,Denominator_type>::value));
+    static_assert(::std::is_same<Numerator_type,Denominator_type>::value);
     CGAL_USE_TYPE(Denominator_type);
 
     Numerator_type num(0),den(1);
diff --git a/Number_types/test/Number_types/Lazy_exact_nt_new.cpp b/Number_types/test/Number_types/Lazy_exact_nt_new.cpp
index f80b17bc1bae..fffb0108143f 100644
--- a/Number_types/test/Number_types/Lazy_exact_nt_new.cpp
+++ b/Number_types/test/Number_types/Lazy_exact_nt_new.cpp
@@ -81,9 +81,9 @@ void test_lazy_exact_nt() {
         typedef CGAL::Lazy_exact_nt< typename AK::Integer > LI;
         typedef CGAL::Lazy_exact_nt< typename AK::Rational > LR;
         typedef CGAL::Coercion_traits<LI,LR> CT;
-        static_assert((std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_true>::value));
-        static_assert((std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value));
-        static_assert((std::is_same< typename CT::Type,LR>::value));
+        static_assert(std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_true>::value);
+        static_assert(std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value);
+        static_assert(std::is_same< typename CT::Type,LR>::value);
 
         LI  i(4);
         LR  r(4);
@@ -99,8 +99,8 @@ void test_lazy_exact_nt() {
         typedef CGAL::Lazy_exact_nt<leda_integer> T1;
         typedef CGAL::Lazy_exact_nt<CORE::Expr> T2;
         typedef CGAL::Coercion_traits<T1, T2> CT;
-        static_assert((std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_false>::value));
-        static_assert((std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_false>::value));
+        static_assert(std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_false>::value);
+        static_assert(std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_false>::value);
 #endif
 #endif
     }
diff --git a/Number_types/test/Number_types/Quotient_new.cpp b/Number_types/test/Number_types/Quotient_new.cpp
index 079ea8fbc02b..dfa2c37da05b 100644
--- a/Number_types/test/Number_types/Quotient_new.cpp
+++ b/Number_types/test/Number_types/Quotient_new.cpp
@@ -62,9 +62,9 @@ void test_quotient() {
       typedef CGAL::Quotient<typename AT::Integer> QI;
       typedef CGAL::Coercion_traits<I,QI>  CT;
       CGAL_USE_TYPE(CT);
-      static_assert((std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value));
-      static_assert((std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_true>::value));
-      static_assert((std::is_same< typename CT::Type,QI>::value));
+      static_assert(std::is_same< typename CT::Are_explicit_interoperable,CGAL::Tag_true>::value);
+      static_assert(std::is_same< typename CT::Are_implicit_interoperable,CGAL::Tag_true>::value);
+      static_assert(std::is_same< typename CT::Type,QI>::value);
   }
 }
 
diff --git a/Number_types/test/Number_types/Sqrt_extension.h b/Number_types/test/Number_types/Sqrt_extension.h
index 547aaf10ab92..825ba19d2522 100644
--- a/Number_types/test/Number_types/Sqrt_extension.h
+++ b/Number_types/test/Number_types/Sqrt_extension.h
@@ -24,7 +24,7 @@ void convert_to(const NT& x, RT& r){
     typedef CGAL::Coercion_traits<NT,RT> CT;
     typedef typename CT::Type Type;
     CGAL_USE_TYPE(Type);
-    static_assert((::std::is_same<Type,RT>::value));
+    static_assert(::std::is_same<Type,RT>::value);
     r = typename CT::Cast()(x);
 }
 } //namespace CGAL
@@ -700,17 +700,17 @@ void test_get_arithmetic_kernel(){
     typedef CGAL::Sqrt_extension<Integer,Integer,ACDE_TAG> EXT;
     typedef typename CGAL::Get_arithmetic_kernel<EXT>::Arithmetic_kernel AT_;
     CGAL_USE_TYPE(AT_);
-    static_assert((std::is_same<AT,AT_>::value));
+    static_assert(std::is_same<AT,AT_>::value);
   } {
     typedef CGAL::Sqrt_extension<Rational,Integer,ACDE_TAG> EXT;
     typedef typename CGAL::Get_arithmetic_kernel<EXT>::Arithmetic_kernel AT_;
     CGAL_USE_TYPE(AT_);
-    static_assert((std::is_same<AT,AT_>::value));
+    static_assert(std::is_same<AT,AT_>::value);
   } {
     typedef CGAL::Sqrt_extension<Rational,Rational,ACDE_TAG> EXT;
     typedef typename CGAL::Get_arithmetic_kernel<EXT>::Arithmetic_kernel AT_;
     CGAL_USE_TYPE(AT_);
-    static_assert((std::is_same<AT,AT_>::value));
+    static_assert(std::is_same<AT,AT_>::value);
   }
 }
 
diff --git a/Number_types/test/Number_types/include/CGAL/Test/test_root_of_2_traits.h b/Number_types/test/Number_types/include/CGAL/Test/test_root_of_2_traits.h
index fddad9865341..2ffb9133345a 100644
--- a/Number_types/test/Number_types/include/CGAL/Test/test_root_of_2_traits.h
+++ b/Number_types/test/Number_types/include/CGAL/Test/test_root_of_2_traits.h
@@ -7,12 +7,12 @@ void test_root_of_traits(){
     typedef typename RoT::Root_of_1 Root_of_1;
     typedef typename RoT::Root_of_2 Root_of_2;
 
-    static_assert((::std::is_same<RootOf1,Root_of_1>::value));
-    static_assert((::std::is_same<RootOf2,Root_of_2>::value));
+    static_assert(::std::is_same<RootOf1,Root_of_1>::value);
+    static_assert(::std::is_same<RootOf2,Root_of_2>::value);
 
     typedef typename RoT::Make_root_of_2 Make_root_of_2;
     typedef typename Make_root_of_2::result_type result_type;
-    static_assert((::std::is_same<Root_of_2,result_type>::value));
+    static_assert(::std::is_same<Root_of_2,result_type>::value);
 
     const Make_root_of_2& make_root_of_2 = Make_root_of_2();
     Root_of_2 r  = make_root_of_2(T(0),T(-1),T(2));        //-sqrt(2)
diff --git a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h
index c4ce9993cf03..ae450d781e8d 100644
--- a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h
+++ b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/internal/optimize_2.h
@@ -119,7 +119,7 @@ void optimize_along_OBB_axes(typename Traits::Matrix& rot,
   typedef typename Traits::Matrix                                    Matrix;
   typedef typename Traits::Vector                                    Vector;
 
-  static_assert((std::is_same<typename boost::range_value<PointRange>::type, Point>::value));
+  static_assert(std::is_same<typename boost::range_value<PointRange>::type, Point>::value);
 
   std::vector<Point> rotated_points;
   rotated_points.reserve(points.size());
diff --git a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h
index 0e59be503105..d64b73e699bf 100644
--- a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h
+++ b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/oriented_bounding_box.h
@@ -202,7 +202,7 @@ void construct_oriented_bounding_box(const PointRange& points,
 {
   typedef typename Traits::Point_3                                   Point;
 
-  static_assert((std::is_same<typename boost::range_value<PointRange>::type, Point>::value));
+  static_assert(std::is_same<typename boost::range_value<PointRange>::type, Point>::value);
 
   if(use_ch) // construct the convex hull to reduce the number of points
   {
diff --git a/Point_set_processing_3/include/CGAL/OpenGR/compute_registration_transformation.h b/Point_set_processing_3/include/CGAL/OpenGR/compute_registration_transformation.h
index 43bf9c7db420..229ceab85ff6 100644
--- a/Point_set_processing_3/include/CGAL/OpenGR/compute_registration_transformation.h
+++ b/Point_set_processing_3/include/CGAL/OpenGR/compute_registration_transformation.h
@@ -309,14 +309,14 @@ compute_registration_transformation (const PointRange1& point_set_1, const Point
   typedef Point_set_processing_3_np_helper<PointRange2, NamedParameters2> NP_helper2;
   typedef typename NP_helper1::Const_point_map PointMap1;
   typedef typename NP_helper2::Const_point_map PointMap2;
-  static_assert((std::is_same< typename boost::property_traits<PointMap1>::value_type,
-                                           typename boost::property_traits<PointMap2>::value_type> ::value),
+  static_assert(std::is_same< typename boost::property_traits<PointMap1>::value_type,
+                                           typename boost::property_traits<PointMap2>::value_type> ::value,
                             "The point type of input ranges must be the same");
 
   typedef typename NP_helper1::Normal_map NormalMap1;
   typedef typename NP_helper2::Normal_map NormalMap2;
-  static_assert((std::is_same< typename boost::property_traits<NormalMap1>::value_type,
-                                           typename boost::property_traits<NormalMap2>::value_type> ::value),
+  static_assert(std::is_same< typename boost::property_traits<NormalMap1>::value_type,
+                                           typename boost::property_traits<NormalMap2>::value_type> ::value,
                             "The vector type of input ranges must be the same");
 
   typedef typename NP_helper1::Geom_traits Kernel;
diff --git a/Point_set_processing_3/include/CGAL/OpenGR/register_point_sets.h b/Point_set_processing_3/include/CGAL/OpenGR/register_point_sets.h
index 08012fe33977..5f45ba40acbe 100644
--- a/Point_set_processing_3/include/CGAL/OpenGR/register_point_sets.h
+++ b/Point_set_processing_3/include/CGAL/OpenGR/register_point_sets.h
@@ -222,14 +222,14 @@ register_point_sets (const PointRange1& point_set_1, PointRange2& point_set_2,
   typedef Point_set_processing_3_np_helper<PointRange2, NamedParameters2> NP_helper2;
   typedef typename NP_helper1::Const_point_map PointMap1;
   typedef typename NP_helper2::Const_point_map PointMap2;
-  static_assert((std::is_same< typename boost::property_traits<PointMap1>::value_type,
-                                           typename boost::property_traits<PointMap2>::value_type> ::value),
+  static_assert(std::is_same< typename boost::property_traits<PointMap1>::value_type,
+                                           typename boost::property_traits<PointMap2>::value_type> ::value,
                             "The point type of input ranges must be the same");
 
   typedef typename NP_helper1::Normal_map NormalMap1;
   typedef typename NP_helper2::Normal_map NormalMap2;
-  static_assert((std::is_same< typename boost::property_traits<NormalMap1>::value_type,
-                                           typename boost::property_traits<NormalMap2>::value_type> ::value),
+  static_assert(std::is_same< typename boost::property_traits<NormalMap1>::value_type,
+                                           typename boost::property_traits<NormalMap2>::value_type> ::value,
                             "The vector type of input ranges must be the same");
 
   typedef typename NP_helper1::Geom_traits Kernel;
diff --git a/Point_set_processing_3/include/CGAL/pointmatcher/compute_registration_transformation.h b/Point_set_processing_3/include/CGAL/pointmatcher/compute_registration_transformation.h
index cb47b1a69c1d..6130aadaaf17 100644
--- a/Point_set_processing_3/include/CGAL/pointmatcher/compute_registration_transformation.h
+++ b/Point_set_processing_3/include/CGAL/pointmatcher/compute_registration_transformation.h
@@ -607,14 +607,14 @@ compute_registration_transformation (const PointRange1& point_set_1, const Point
   // property map types
   typedef typename NP_helper1::Const_point_map PointMap1;
   typedef typename NP_helper2::Const_point_map PointMap2;
-  static_assert((std::is_same< typename boost::property_traits<PointMap1>::value_type,
-                                           typename boost::property_traits<PointMap2>::value_type> ::value),
+  static_assert(std::is_same< typename boost::property_traits<PointMap1>::value_type,
+                                           typename boost::property_traits<PointMap2>::value_type> ::value,
                             "The point type of input ranges must be the same");
 
   typedef typename NP_helper1::Normal_map NormalMap1;
   typedef typename NP_helper2::Normal_map NormalMap2;
-  static_assert((std::is_same< typename boost::property_traits<NormalMap1>::value_type,
-                                           typename boost::property_traits<NormalMap2>::value_type> ::value),
+  static_assert(std::is_same< typename boost::property_traits<NormalMap1>::value_type,
+                                           typename boost::property_traits<NormalMap2>::value_type> ::value,
                             "The vector type of input ranges must be the same");
 
   typedef typename std::iterator_traits<typename PointRange1::iterator>::value_type key_type1;
@@ -630,8 +630,8 @@ compute_registration_transformation (const PointRange1& point_set_1, const Point
   NormalMap2 normal_map2 = NP_helper2::get_normal_map(point_set_2, np2);
   auto weight_map2 = choose_parameter(get_parameter(np2, internal_np::scalar_map), DefaultWeightMap2(Scalar(1)));
 
-  static_assert((std::is_same< typename boost::property_traits<decltype(weight_map1)>::value_type,
-                                           typename boost::property_traits<decltype(weight_map2)>::value_type> ::value),
+  static_assert(std::is_same< typename boost::property_traits<decltype(weight_map1)>::value_type,
+                                           typename boost::property_traits<decltype(weight_map2)>::value_type> ::value,
                             "The scalar type of input ranges must be the same");
 
   // initial transformation
diff --git a/Point_set_processing_3/include/CGAL/structure_point_set.h b/Point_set_processing_3/include/CGAL/structure_point_set.h
index 58b3cbee86d0..0b5174363943 100644
--- a/Point_set_processing_3/include/CGAL/structure_point_set.h
+++ b/Point_set_processing_3/include/CGAL/structure_point_set.h
@@ -234,7 +234,7 @@ class Point_set_with_structure
     typedef typename Point_set_processing_3::GetPlaneIndexMap<NamedParameters>::type PlaneIndexMap;
 
     CGAL_assertion_msg(NP_helper::has_normal_map(points, np), "Error: no normal map");
-    static_assert((!is_default_parameter<NamedParameters, internal_np::plane_index_t>::value),
+    static_assert(!is_default_parameter<NamedParameters, internal_np::plane_index_t>::value,
                               "Error: no plane index map");
 
     PointMap point_map = NP_helper::get_const_point_map(points, np);
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h
index 691ddfa6a3bf..988e6c3a7eee 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/clip.h
@@ -444,8 +444,8 @@ generic_clip_impl(
   typedef typename GetVertexPointMap<TriangleMesh,
                                      NamedParameters2>::type Vpm2;
 
-  static_assert((std::is_same<typename boost::property_traits<Vpm>::value_type,
-                                      typename boost::property_traits<Vpm>::value_type>::value));
+  static_assert(std::is_same<typename boost::property_traits<Vpm>::value_type,
+                             typename boost::property_traits<Vpm>::value_type>::value);
 
   Vpm vpm1 = choose_parameter(get_parameter(np1, internal_np::vertex_point),
                               get_property_map(boost::vertex_point, tm1));
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/connected_components.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/connected_components.h
index 991c4b33c4b2..bffa8e6dca16 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/connected_components.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/connected_components.h
@@ -553,7 +553,7 @@ std::size_t keep_large_connected_components(PolygonMesh& pmesh,
                                                       >::type             FaceSizeMap;
   typedef typename boost::property_traits<FaceSizeMap>::value_type        Face_size;
 
-  static_assert((std::is_convertible<ThresholdValueType, Face_size>::value));
+  static_assert(std::is_convertible<ThresholdValueType, Face_size>::value);
 
   typedef typename internal_np::Lookup_named_param_def<internal_np::output_iterator_t,
                                                        NamedParameters,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h
index 5167a240f18e..81f9438a1982 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/corefinement.h
@@ -206,8 +206,8 @@ corefine_and_compute_boolean_operations(
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters1>::type  VPM1;
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters2>::type  VPM2;
 
-  static_assert((std::is_same<typename boost::property_traits<VPM1>::value_type,
-                                      typename boost::property_traits<VPM2>::value_type>::value));
+  static_assert(std::is_same<typename boost::property_traits<VPM1>::value_type,
+                             typename boost::property_traits<VPM2>::value_type>::value);
 
   VPM1 vpm1 = choose_parameter(get_parameter(np1, internal_np::vertex_point),
                                get_property_map(boost::vertex_point, tm1));
@@ -694,8 +694,8 @@ corefine(      TriangleMesh& tm1,
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters1>::type VPM1;
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters2>::type VPM2;
 
-  static_assert((std::is_same<typename boost::property_traits<VPM1>::value_type,
-                                      typename boost::property_traits<VPM2>::value_type>::value));
+  static_assert(std::is_same<typename boost::property_traits<VPM1>::value_type,
+                             typename boost::property_traits<VPM2>::value_type>::value);
 
   VPM1 vpm1 = choose_parameter(get_parameter(np1, internal_np::vertex_point),
                                get_property_map(boost::vertex_point, tm1));
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
index 6d221c77bb9e..21024ad5c046 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
@@ -1037,7 +1037,7 @@ sample_triangle_soup(const PointRange& points,
   typedef typename PointRange::value_type         Point_3;
   typedef typename Kernel_traits<Point_3>::Kernel GeomTraits;
 
-  static_assert((std::is_same<Point_3, typename GeomTraits::Point_3>::value), "Wrong point type.");
+  static_assert(std::is_same<Point_3, typename GeomTraits::Point_3>::value, "Wrong point type.");
 
   CGAL_precondition(!triangles.empty());
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersect_triangle_and_segment_3.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersect_triangle_and_segment_3.h
index aaf34efd11d7..652d0b09952c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersect_triangle_and_segment_3.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersect_triangle_and_segment_3.h
@@ -98,7 +98,7 @@ intersection_type(
   typedef typename boost::property_traits<VertexPointMap1>::value_type Point_3;
   typedef typename Kernel_traits<Point_3>::Kernel Kernel;
 
-  static_assert((std::is_same<Point_3, typename boost::property_traits<VertexPointMap2>::value_type>::value));
+  static_assert(std::is_same<Point_3, typename boost::property_traits<VertexPointMap2>::value_type>::value);
 
   halfedge_descriptor h_2=halfedge(f_2,tm2);
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
index 81f3ca6478db..38f137cad012 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_nodes.h
@@ -49,8 +49,8 @@ class Intersection_nodes<TriangleMesh, VertexPointMap1, VertexPointMap2, false,
 private:
 //typedefs
   typedef typename boost::property_traits<VertexPointMap1>::value_type  Point_3;
-  static_assert((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
-                                      typename boost::property_traits<VertexPointMap2>::value_type>::value));
+  static_assert(std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
+                                      typename boost::property_traits<VertexPointMap2>::value_type>::value);
 
   typedef typename Kernel_traits<Point_3>::Kernel                  Input_kernel;
   typedef std::vector <Point_3>                                    Nodes_vector;
@@ -151,8 +151,8 @@ class Intersection_nodes<TriangleMesh, VertexPointMap1, VertexPointMap2, true, f
 
 private:
   typedef typename boost::property_traits<VertexPointMap1>::value_type  Point_3;
-  static_assert((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
-                                      typename boost::property_traits<VertexPointMap2>::value_type>::value));
+  static_assert(std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
+                             typename boost::property_traits<VertexPointMap2>::value_type>::value);
 
   typedef typename Kernel_traits<Point_3>::Kernel                  Input_kernel;
 
@@ -328,8 +328,8 @@ class Intersection_nodes<TriangleMesh, VertexPointMap1, VertexPointMap2,
 {
 //typedefs
   typedef typename boost::property_traits<VertexPointMap1>::value_type  Point_3;
-  static_assert((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
-                                      typename boost::property_traits<VertexPointMap2>::value_type>::value));
+  static_assert(std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
+                             typename boost::property_traits<VertexPointMap2>::value_type>::value);
 
   typedef typename Kernel_traits<Point_3>::Kernel                  Input_kernel;
   typedef std::vector <Point_3>                                    Nodes_vector;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
index 7929697aec2a..b2047d2627ea 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/intersection_of_coplanar_triangles_3.h
@@ -32,8 +32,8 @@ struct Intersect_coplanar_faces_3
  // typedefs
   typedef typename boost::property_traits<VertexPointMap1>::value_type Point;
 
-  static_assert((std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
-                                      typename boost::property_traits<VertexPointMap2>::value_type>::value));
+  static_assert(std::is_same<typename boost::property_traits<VertexPointMap1>::value_type,
+                             typename boost::property_traits<VertexPointMap2>::value_type>::value);
 
   typedef typename CGAL::Kernel_traits<Point>::Kernel Input_kernel;
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap_vertices.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap_vertices.h
index 9a724ee2a4a2..5adbf99ff6f5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap_vertices.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Snapping/snap_vertices.h
@@ -730,7 +730,7 @@ std::size_t snap_vertices_two_way(const HalfedgeRange_A& halfedge_range_A,
   using parameters::get_parameter;
   using parameters::get_parameter_reference;
 
-  static_assert((std::is_same<Point, typename GT::Point_3>::value));
+  static_assert(std::is_same<Point, typename GT::Point_3>::value);
 
   GT gt = choose_parameter<GT>(get_parameter(np_A, internal_np::geom_traits));
   VPM_A vpm_A = choose_parameter(get_parameter(np_A, internal_np::vertex_point),
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
index 4f66b558cc7e..d4fc6d730e44 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
@@ -681,7 +681,7 @@ compute_face_polylines_intersection(const FaceRange& face_range,
                                           get_const_property_map(boost::vertex_point, tm));
   typedef typename boost::property_traits<VertexPointMap>::value_type Point;
   typedef typename boost::range_value<PolylineRange>::type Polyline;
-  static_assert((std::is_same<Point, typename boost::range_value<Polyline>::type>::value));
+  static_assert(std::is_same<Point, typename boost::range_value<Polyline>::type>::value);
 
   std::vector<face_descriptor> faces;
   faces.reserve(std::distance( boost::begin(face_range), boost::end(face_range) ));
@@ -1742,8 +1742,8 @@ surface_intersection(const TriangleMesh& tm1,
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters1>::const_type VPM1;
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters2>::const_type VPM2;
 
-  static_assert((std::is_same<typename boost::property_traits<VPM1>::value_type,
-                                      typename boost::property_traits<VPM2>::value_type>::value));
+  static_assert(std::is_same<typename boost::property_traits<VPM1>::value_type,
+                                      typename boost::property_traits<VPM2>::value_type>::value);
 
   VPM1 vpm1 = parameters::choose_parameter(parameters::get_parameter(np1, internal_np::vertex_point),
                                            get_const_property_map(CGAL::vertex_point, tm1));
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
index 3f1a66508725..26d0266e03ad 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
@@ -1661,7 +1661,7 @@ locate_with_AABB_tree(const typename internal::Location_traits<TriangleMesh, Nam
   typedef typename CGAL::AABB_traits<Geom_traits, Primitive>                               AABB_traits;
 
   typedef typename Primitive::Point                                                        Point_3;
-  static_assert((std::is_same<Point_3, typename P_to_P3::Point_3>::value));
+  static_assert(std::is_same<Point_3, typename P_to_P3::Point_3>::value);
 
   typedef typename GetVertexPointMap<TriangleMesh, NamedParameters>::const_type            VertexPointMap;
   typedef internal::Point_to_Point_3_VPM<TriangleMesh, VertexPointMap>                     WrappedVPM;
@@ -1754,7 +1754,7 @@ locate(const typename internal::Location_traits<TriangleMesh, NamedParameters>::
   using parameters::get_parameter;
   using parameters::choose_parameter;
 
-  static_assert((std::is_same<Point_3, typename P_to_P3::Point_3>::value));
+  static_assert(std::is_same<Point_3, typename P_to_P3::Point_3>::value);
 
   const VertexPointMap vpm = parameters::choose_parameter(parameters::get_parameter(np, internal_np::vertex_point),
                                                           get_const_property_map(boost::vertex_point, tm));
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h
index 8e4f54ed5a16..8f1c60347eed 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h
@@ -989,8 +989,8 @@ void match_faces(const PolygonMesh1& m1,
                                        get_const_property_map(vertex_point, m1));
   const VPMap2 vpm2 = choose_parameter(get_parameter(np2, internal_np::vertex_point),
                                        get_const_property_map(vertex_point, m2));
-  static_assert((std::is_same<typename boost::property_traits<VPMap1>::value_type,
-                             typename boost::property_traits<VPMap2>::value_type>::value),
+  static_assert(std::is_same<typename boost::property_traits<VPMap1>::value_type,
+                             typename boost::property_traits<VPMap2>::value_type>::value,
                             "Both vertex point maps must have the same point type.");
 
   const VIMap1 vim1 = get_initialized_vertex_index_map(m1, np1);
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h
index e395080f4a72..a7e9cf2480a3 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h
@@ -159,7 +159,7 @@ void orient_triangle_soup_with_reference_triangle_soup(const ReferencePointRange
   typedef typename boost::property_traits<PointMap2>::reference PM2_Point_ref;
 
   typedef typename boost::property_traits<PointMap1>::value_type Point_3;
-  static_assert((std::is_same<Point_3, typename boost::property_traits<PointMap2>::value_type>::value));
+  static_assert(std::is_same<Point_3, typename boost::property_traits<PointMap2>::value_type>::value);
 
   typedef typename CGAL::Kernel_traits<Point_3>::Kernel K;
   typedef typename K::Triangle_3 Triangle;
@@ -309,7 +309,7 @@ void orient_triangle_soup_with_reference_triangle_mesh(const TriangleMesh& tm_re
 
   PointMap point_map = NP_helper::get_const_point_map(points, np2);
 
-  static_assert((std::is_same<Point_3, typename boost::property_traits<PointMap>::value_type>::value));
+  static_assert(std::is_same<Point_3, typename boost::property_traits<PointMap>::value_type>::value);
 
   K k = choose_parameter<K>(get_parameter(np1, internal_np::geom_traits));
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h
index f247b361f435..eed98878632b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h
@@ -39,7 +39,7 @@ struct PM_to_PS_point_converter
 {
   PS_Point operator()(const PM_Point& p) const
   {
-    static_assert((std::is_convertible<PM_Point, PS_Point>::value));
+    static_assert(std::is_convertible<PM_Point, PS_Point>::value);
     return PS_Point(p);
   }
 };
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
index cc1d299702f5..df32555bc530 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h
@@ -43,7 +43,7 @@ namespace internal {
 template <typename PM_Point, typename PS_Point>
 PM_Point convert_to_pm_point(const PS_Point& p)
 {
-  static_assert((std::is_convertible<PS_Point, PM_Point>::value));
+  static_assert(std::is_convertible<PS_Point, PM_Point>::value);
   return PM_Point(p);
 }
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_self_intersections.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_self_intersections.h
index 9d4f5837d8ee..3a5f9fca82fa 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_self_intersections.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/repair_self_intersections.h
@@ -178,7 +178,7 @@ FaceOutputIterator replace_faces_with_patch(const std::vector<typename boost::gr
                                             VertexPointMap vpm,
                                             FaceOutputIterator out)
 {
-  static_assert((std::is_same<typename boost::property_traits<VertexPointMap>::value_type, Point>::value));
+  static_assert(std::is_same<typename boost::property_traits<VertexPointMap>::value_type, Point>::value);
 
   typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor      vertex_descriptor;
   typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor    halfedge_descriptor;
diff --git a/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h b/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h
index 3ed4b89f06ed..761ca6ec9bf3 100644
--- a/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h
+++ b/Polygon_mesh_processing/include/CGAL/Rigid_triangle_mesh_collision_detection.h
@@ -250,7 +250,7 @@ class Rigid_triangle_mesh_collision_detection
   {
     // handle vpm
     typedef typename CGAL::GetVertexPointMap<TriangleMesh, NamedParameters>::const_type Local_vpm;
-    static_assert( (std::is_same<Local_vpm,Vpm>::value) );
+    static_assert(std::is_same<Local_vpm,Vpm>::value);
 
     Vpm vpm =
       parameters::choose_parameter(parameters::get_parameter(np, internal_np::vertex_point),
@@ -562,7 +562,7 @@ class Rigid_triangle_mesh_collision_detection
         parameters::get_parameter(np, internal_np::apply_per_connected_component), true);
 
     typedef typename CGAL::GetVertexPointMap<TriangleMesh, NamedParameters>::const_type Local_vpm;
-    static_assert((std::is_same<Local_vpm,Vpm>::value));
+    static_assert(std::is_same<Local_vpm,Vpm>::value);
 
     Vpm vpm =
       parameters::choose_parameter(parameters::get_parameter(np, internal_np::vertex_point),
diff --git a/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h b/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
index c12178a1b9cf..458fc0a703cf 100644
--- a/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
+++ b/Polygon_mesh_processing/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
@@ -58,7 +58,7 @@ class Polyhedral_envelope_filter
   template <typename Profile>
   void initialize_envelope(const Profile& profile) const
   {
-    static_assert((std::is_same<GeomTraits, typename Profile::Geom_traits>::value));
+    static_assert(std::is_same<GeomTraits, typename Profile::Geom_traits>::value);
 
     typedef typename Profile::Triangle_mesh                                   Triangle_mesh;
     typedef typename boost::graph_traits<Triangle_mesh>::halfedge_descriptor  halfedge_descriptor;
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
index 8aeaab049db5..60c14ec9604a 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
@@ -522,7 +522,7 @@ struct Locate_with_AABB_tree_Tester // 2D case
     typedef CGAL::AABB_face_graph_triangle_primitive<G, WrappedVPM>            AABB_face_graph_primitive;
     typedef CGAL::AABB_traits<K, AABB_face_graph_primitive>                    AABB_face_graph_traits;
 
-    static_assert((std::is_same<typename AABB_face_graph_traits::Point_3, Point_3>::value));
+    static_assert(std::is_same<typename AABB_face_graph_traits::Point_3, Point_3>::value);
 
     Intrinsic_point_to_Point_3 to_p3;
 
@@ -633,7 +633,7 @@ struct Locate_with_AABB_tree_Tester<K, VPM, 3> // 3D
     typedef CGAL::AABB_traits<K, AABB_face_graph_primitive>                    AABB_face_graph_traits;
 
     typedef typename K::Point_3                            Point_3;
-    static_assert((std::is_same<typename AABB_face_graph_traits::Point_3, Point_3>::value));
+    static_assert(std::is_same<typename AABB_face_graph_traits::Point_3, Point_3>::value);
 
     CGAL::AABB_tree<AABB_face_graph_traits> tree_a;
     Point_reference p3_a = get(vpm, v);
diff --git a/Polynomial/include/CGAL/Exponent_vector.h b/Polynomial/include/CGAL/Exponent_vector.h
index 826a9417ffd6..1a06965514d6 100644
--- a/Polynomial/include/CGAL/Exponent_vector.h
+++ b/Polynomial/include/CGAL/Exponent_vector.h
@@ -59,7 +59,7 @@ class Exponent_vector :
     :v(begin,end){
     typedef typename std::iterator_traits<InputIterator>::value_type value_type;
     CGAL_USE_TYPE(value_type);
-    static_assert(( ::std::is_same<value_type, int>::value));
+    static_assert(::std::is_same<value_type, int>::value);
   }
 
 
diff --git a/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h b/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
index d75f6f291d55..f989b8ff2019 100644
--- a/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
+++ b/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
@@ -273,9 +273,9 @@ class Polynomial_algebraic_structure_traits_base< POLY, Field_tag >
         template < class NT1, class NT2 >
         void operator()( const NT1& x, const NT2& y,
                          POLY& q, POLY& r ) const {
-          static_assert((::std::is_same<
+          static_assert(::std::is_same<
                   typename Coercion_traits< NT1, NT2 >::Type, POLY
-                                               >::value));
+                                               >::value);
 
           typename Coercion_traits< NT1, NT2 >::Cast cast;
           operator()( cast(x), cast(y), q, r );
diff --git a/Polynomial/include/CGAL/Polynomial/Polynomial_type.h b/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
index 9c2c27b6fc75..e2529d2e3495 100644
--- a/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
+++ b/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
@@ -545,8 +545,8 @@ class Polynomial
      *  Also available as non-member function.
      */
     CGAL::Sign sign() const {
-//        static_assert( (std::is_same< typename Real_embeddable_traits<NT>::Is_real_embeddable,
-//                              CGAL::Tag_true>::value) );
+//        static_assert(std::is_same< typename Real_embeddable_traits<NT>::Is_real_embeddable,
+//                              CGAL::Tag_true>::value);
       return CGAL::sign(lcoeff());
     }
 
diff --git a/Polynomial/include/CGAL/Polynomial_traits_d.h b/Polynomial/include/CGAL/Polynomial_traits_d.h
index 1a377fc5c179..f7a4d3993e32 100644
--- a/Polynomial/include/CGAL/Polynomial_traits_d.h
+++ b/Polynomial/include/CGAL/Polynomial_traits_d.h
@@ -566,7 +566,7 @@ class Polynomial_traits_d_base< Polynomial< Coefficient_type_ >,
     template <class Input_iterator, class NT> Polynomial_d
     construct_value_type(Input_iterator begin, Input_iterator end, NT) const {
       typedef CGAL::Coercion_traits<NT,Coefficient_type> CT;
-      static_assert((std::is_same<typename CT::Type,Coefficient_type>::value));
+      static_assert(std::is_same<typename CT::Type,Coefficient_type>::value);
       typename CT::Cast cast;
       return Polynomial_d(
           boost::make_transform_iterator(begin,cast),
diff --git a/Polynomial/include/CGAL/Test/_test_polynomial_traits_d.h b/Polynomial/include/CGAL/Test/_test_polynomial_traits_d.h
index 7547bd302815..b40a6d882f78 100644
--- a/Polynomial/include/CGAL/Test/_test_polynomial_traits_d.h
+++ b/Polynomial/include/CGAL/Test/_test_polynomial_traits_d.h
@@ -50,7 +50,7 @@ static CGAL::Random my_rnd(346); // some seed
 
 
 #define ASSERT_IS_NULL_FUNCTOR(T)                                       \
-  static_assert((std::is_same<T,CGAL::Null_functor >::value))
+  static_assert(std::is_same<T,CGAL::Null_functor >::value)
 
 
 
@@ -1802,23 +1802,23 @@ void test_rebind(const PT& /*traits*/){
 {
   typedef typename PT:: template Rebind<IC,1>::Other PT_IC_1;
   CGAL_USE_TYPE(PT_IC_1);
-  static_assert((std::is_same< typename PT_IC_1::Innermost_coefficient_type,
-            IC>::value));
-  static_assert((PT_IC_1::d==1));
+  static_assert(std::is_same< typename PT_IC_1::Innermost_coefficient_type,
+            IC>::value);
+  static_assert(PT_IC_1::d==1);
 }
 {
   typedef typename PT:: template Rebind<IC,2>::Other PT_IC_2;
   CGAL_USE_TYPE(PT_IC_2);
-  static_assert((std::is_same< typename PT_IC_2::Innermost_coefficient_type,
-            IC>::value));
-  static_assert((PT_IC_2::d==2));
+  static_assert(std::is_same< typename PT_IC_2::Innermost_coefficient_type,
+            IC>::value);
+  static_assert(PT_IC_2::d==2);
 }
 {
   typedef typename PT:: template Rebind<IC,3>::Other PT_IC_3;
   CGAL_USE_TYPE(PT_IC_3);
-  static_assert((std::is_same< typename PT_IC_3::Innermost_coefficient_type,
-          IC>::value));
-  static_assert((PT_IC_3::d==3));
+  static_assert(std::is_same< typename PT_IC_3::Innermost_coefficient_type,
+          IC>::value);
+  static_assert(PT_IC_3::d==3);
 }
 {
   typedef typename PT:: template Rebind<IC,1>::Other PT_IC_1;
@@ -1831,12 +1831,12 @@ void test_rebind(const PT& /*traits*/){
   typedef typename  PT_IC_1::Polynomial_d Poly1;
   typedef typename  PT_IC_2::Polynomial_d Poly2;
 
-  static_assert((std::is_same< typename PT_IC_1::Coefficient_type,
-          IC>::value));
-  static_assert((std::is_same< typename PT_IC_2::Coefficient_type,
-          Poly1>::value));
-  static_assert((std::is_same< typename PT_IC_3::Coefficient_type,
-          Poly2>::value));
+  static_assert(std::is_same< typename PT_IC_1::Coefficient_type,
+          IC>::value);
+  static_assert(std::is_same< typename PT_IC_2::Coefficient_type,
+          Poly1>::value);
+  static_assert(std::is_same< typename PT_IC_3::Coefficient_type,
+          Poly2>::value);
 
 }
 
@@ -1850,12 +1850,12 @@ void test_rebind(const PT& /*traits*/){
   CGAL_USE_TYPE(PT_Integer_4);
   typedef typename PT:: template Rebind<Rational,4>::Other PT_Rational_4;
   CGAL_USE_TYPE(PT_Rational_4);
-  static_assert((std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
-          Integer>::value));
-  static_assert((std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
-          Rational>::value));
-  static_assert((PT_Integer_4::d==dimension));
-  static_assert((PT_Rational_4::d==dimension));
+  static_assert(std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
+          Integer>::value);
+  static_assert(std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
+          Rational>::value);
+  static_assert(PT_Integer_4::d==dimension);
+  static_assert(PT_Rational_4::d==dimension);
 }
 #endif
 #ifdef CGAL_USE_CORE
@@ -1867,12 +1867,12 @@ void test_rebind(const PT& /*traits*/){
   typedef typename PT:: template Rebind<Rational,4>::Other PT_Rational_4;
   CGAL_USE_TYPE(PT_Integer_4);
   CGAL_USE_TYPE(PT_Rational_4);
-  static_assert((std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
-          Integer>::value));
-  static_assert((std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
-          Rational>::value));
-  static_assert((PT_Integer_4::d==4));
-  static_assert((PT_Rational_4::d==4));
+  static_assert(std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
+          Integer>::value);
+  static_assert(std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
+          Rational>::value);
+  static_assert(PT_Integer_4::d==4);
+  static_assert(PT_Rational_4::d==4);
 }
 #endif
 {
@@ -1880,12 +1880,12 @@ void test_rebind(const PT& /*traits*/){
   typedef typename PT:: template Rebind<double,4>::Other PT_Rational_4;
   CGAL_USE_TYPE(PT_Integer_4);
   CGAL_USE_TYPE(PT_Rational_4);
-  static_assert((std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
-          int>::value));
-  static_assert((std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
-          double>::value));
-  static_assert((PT_Integer_4::d==4));
-  static_assert((PT_Rational_4::d==4));
+  static_assert(std::is_same< typename PT_Integer_4::Innermost_coefficient_type,
+          int>::value);
+  static_assert(std::is_same< typename PT_Rational_4::Innermost_coefficient_type,
+          double>::value);
+  static_assert(PT_Integer_4::d==4);
+  static_assert(PT_Rational_4::d==4);
 }
 }
 
diff --git a/Polynomial/test/Polynomial/Polynomial_type_generator.cpp b/Polynomial/test/Polynomial/Polynomial_type_generator.cpp
index 56e11a393579..8d8497ed139e 100644
--- a/Polynomial/test/Polynomial/Polynomial_type_generator.cpp
+++ b/Polynomial/test/Polynomial/Polynomial_type_generator.cpp
@@ -12,14 +12,14 @@ int main(){
 
   {
     typedef CGAL::Polynomial_type_generator<int,1>::Type Polynomial;
-    static_assert((::std::is_same<Polynomial, Poly_int_1>::value));
+    static_assert(::std::is_same<Polynomial, Poly_int_1>::value);
   }
   {
     typedef CGAL::Polynomial_type_generator<int,2>::Type Polynomial;
-    static_assert((::std::is_same<Polynomial, Poly_int_2>::value));
+    static_assert(::std::is_same<Polynomial, Poly_int_2>::value);
   }
   {
     typedef CGAL::Polynomial_type_generator<int,3>::Type Polynomial;
-    static_assert((::std::is_same<Polynomial, Poly_int_3>::value));
+    static_assert(::std::is_same<Polynomial, Poly_int_3>::value);
   }
 }
diff --git a/Polynomial/test/Polynomial/test_polynomial.h b/Polynomial/test/Polynomial/test_polynomial.h
index 7cd7a2e17c2d..c1943d96ae94 100644
--- a/Polynomial/test/Polynomial/test_polynomial.h
+++ b/Polynomial/test/Polynomial/test_polynomial.h
@@ -34,7 +34,7 @@ inline
 void convert_to(const NT& x, RT& r){
     typedef CGAL::Coercion_traits<NT,RT> CT;
     typedef typename CT::Coercion_type RET;
-    static_assert((::std::is_same<RET,RT>::value));
+    static_assert(::std::is_same<RET,RT>::value);
     r = typename CT::Cast()(x);
 }
 } //namespace CGAL
@@ -887,7 +887,7 @@ void test_scalar_factor_traits(){
         typedef CGAL::Scalar_factor_traits<Polynomial> SFT;
         typedef typename AT::Integer Scalar;
         typedef typename SFT::Scalar Scalar_;
-        static_assert((::std::is_same<Scalar_, Scalar>::value));
+        static_assert(::std::is_same<Scalar_, Scalar>::value);
 
         typename SFT::Scalar_factor sfac;
 
@@ -913,7 +913,7 @@ void test_scalar_factor_traits(){
         typedef CGAL::Scalar_factor_traits<Poly_2_ext_1> SFT;
         typedef typename AT::Integer Scalar;
         typedef typename SFT::Scalar Scalar_;
-        static_assert((::std::is_same<Scalar_, Scalar>::value));
+        static_assert(::std::is_same<Scalar_, Scalar>::value);
 
         typename SFT::Scalar_factor sfac;
 
diff --git a/Polynomial/test/Polynomial/test_polynomial_Coercion_traits.cpp b/Polynomial/test/Polynomial/test_polynomial_Coercion_traits.cpp
index d2ad9d2019cb..ca30d9e8ed03 100644
--- a/Polynomial/test/Polynomial/test_polynomial_Coercion_traits.cpp
+++ b/Polynomial/test/Polynomial/test_polynomial_Coercion_traits.cpp
@@ -147,9 +147,9 @@ void test_coercion_traits(){
   /*
     {
     typedef CGAL::Coercion_traits<POLY_RAT_1,CGAL::Null_functor> CT;
-    static_assert((
+    static_assert(
     ::std::is_same< typename CT::Are_implicit_interoperable,
-    CGAL::Tag_false>::value));
+    CGAL::Tag_false>::value);
     }
   */
 
diff --git a/Polynomial/test/Polynomial/test_polynomial_Get_arithmetic_kernel.cpp b/Polynomial/test/Polynomial/test_polynomial_Get_arithmetic_kernel.cpp
index f52f33ae5846..5edd4a40835e 100644
--- a/Polynomial/test/Polynomial/test_polynomial_Get_arithmetic_kernel.cpp
+++ b/Polynomial/test/Polynomial/test_polynomial_Get_arithmetic_kernel.cpp
@@ -7,11 +7,11 @@ void test_get_arithmetic_kernel(){
   {
     typedef CGAL::Polynomial<Integer> POLY;
     typedef typename CGAL::Get_arithmetic_kernel<POLY>::Arithmetic_kernel AK_;
-    static_assert((std::is_same<AK,AK_>::value));
+    static_assert(std::is_same<AK,AK_>::value);
   }{
     typedef CGAL::Polynomial<CGAL::Polynomial<Integer> > POLY;
     typedef typename CGAL::Get_arithmetic_kernel<POLY>::Arithmetic_kernel AK_;
-    static_assert((std::is_same<AK,AK_>::value));
+    static_assert(std::is_same<AK,AK_>::value);
   }
 }
 
diff --git a/Ridges_3/include/CGAL/Ridges.h b/Ridges_3/include/CGAL/Ridges.h
index 47fd6019ebd2..d4052642864c 100644
--- a/Ridges_3/include/CGAL/Ridges.h
+++ b/Ridges_3/include/CGAL/Ridges.h
@@ -190,10 +190,10 @@ class Ridge_approximation
 
 
   //requirements for the templates TriangleMesh and VertexFTMap or VertexVectorMap
-  static_assert((std::is_same<vertex_descriptor, typename VertexFTMap::key_type>::value));
-  static_assert((std::is_same<vertex_descriptor, typename VertexVectorMap::key_type>::value));
-  static_assert((std::is_same<FT, typename VertexFTMap::value_type>::value));
-  static_assert((std::is_same<Vector_3, typename VertexVectorMap::value_type>::value));
+  static_assert(std::is_same<vertex_descriptor, typename VertexFTMap::key_type>::value);
+  static_assert(std::is_same<vertex_descriptor, typename VertexVectorMap::key_type>::value);
+  static_assert(std::is_same<FT, typename VertexFTMap::value_type>::value);
+  static_assert(std::is_same<Vector_3, typename VertexVectorMap::value_type>::value);
 
   typedef std::pair< halfedge_descriptor, FT>    Ridge_halfedge;
   typedef Ridge_halfedge Ridge_halfhedge; // kept for backward compatibility
diff --git a/Ridges_3/include/CGAL/Umbilics.h b/Ridges_3/include/CGAL/Umbilics.h
index 424708b2897b..f815b9c18cac 100644
--- a/Ridges_3/include/CGAL/Umbilics.h
+++ b/Ridges_3/include/CGAL/Umbilics.h
@@ -110,10 +110,10 @@ class Umbilic_approximation
   typedef typename boost::graph_traits<TriangleMesh>::vertex_iterator  Vertex_const_iterator;
 
   //requirements for the templates TriangleMesh and VertexFTMap or VertexVectorMap
-  static_assert((std::is_same<vertex_descriptor, typename VertexFTMap::key_type>::value));
-  static_assert((std::is_same<vertex_descriptor, typename VertexVectorMap::key_type>::value));
-  static_assert((std::is_same<FT, typename VertexFTMap::value_type>::value));
-  static_assert((std::is_same<Vector_3, typename VertexVectorMap::value_type>::value));
+  static_assert(std::is_same<vertex_descriptor, typename VertexFTMap::key_type>::value);
+  static_assert(std::is_same<vertex_descriptor, typename VertexVectorMap::key_type>::value);
+  static_assert(std::is_same<FT, typename VertexFTMap::value_type>::value);
+  static_assert(std::is_same<Vector_3, typename VertexVectorMap::value_type>::value);
 
   typedef CGAL::Umbilic<TriangleMesh> Umbilic;
 
diff --git a/STL_Extension/include/CGAL/Handle_with_policy.h b/STL_Extension/include/CGAL/Handle_with_policy.h
index 978fa9ec1c36..5f952a66e15f 100644
--- a/STL_Extension/include/CGAL/Handle_with_policy.h
+++ b/STL_Extension/include/CGAL/Handle_with_policy.h
@@ -355,8 +355,8 @@ namespace Intern {
             typedef ::CGAL::Reference_counted_hierarchy_with_union<Alloc>
                 Reference_counted_hierarchy_with_union;
             CGAL_USE_TYPE(Reference_counted_hierarchy_with_union);
-            static_assert((
-              ::CGAL::is_same_or_derived< Reference_counted_hierarchy_with_union, T >::value ));
+            static_assert(
+              ::CGAL::is_same_or_derived< Reference_counted_hierarchy_with_union, T >::value );
         }
         typedef T Rep;
     };
@@ -855,8 +855,8 @@ class Handle_with_policy {
     //! argument, and the single argument template constructor no other
     //! constructor will work for class hierarchies of representations.
     Handle_with_policy( Rep* p) : ptr_( p) {
-        static_assert((
-           ::CGAL::is_same_or_derived< Reference_counted_hierarchy_base, Handled_type >::value ));
+        static_assert(
+           ::CGAL::is_same_or_derived< Reference_counted_hierarchy_base, Handled_type >::value );
         //Bind bind_; // trigger compile-time check
         //(void)bind_;
         (void)Bind();
@@ -869,8 +869,8 @@ class Handle_with_policy {
     //! version of \c initialize_with is applicable in this case except
     //! the template version with one argument.
     void initialize_with( Rep* p) {
-        static_assert((
-           ::CGAL::is_same_or_derived< Reference_counted_hierarchy_base, Handled_type >::value ));
+        static_assert(
+           ::CGAL::is_same_or_derived< Reference_counted_hierarchy_base, Handled_type >::value );
         //Bind bind_; // trigger compile-time check
         //(void)bind_;
         (void)Bind();
diff --git a/STL_Extension/include/CGAL/Named_function_parameters.h b/STL_Extension/include/CGAL/Named_function_parameters.h
index b116f6d51495..d0f1648f816e 100644
--- a/STL_Extension/include/CGAL/Named_function_parameters.h
+++ b/STL_Extension/include/CGAL/Named_function_parameters.h
@@ -182,7 +182,7 @@ typename Get_param<Named_params_impl<T, Tag, Base>, Query_tag>::type
 get_parameter_impl(const Named_params_impl<T, Tag, Base>& np, Query_tag tag)
 {
 #ifndef CGAL_NO_STATIC_ASSERTION_TEST
-  static_assert( (!std::is_same<Query_tag, Tag>::value) );
+  static_assert(!std::is_same<Query_tag, Tag>::value);
 #endif
   return get_parameter_impl(static_cast<const typename Base::base&>(np), tag);
 }
@@ -243,7 +243,7 @@ template <typename T, typename Tag, typename Base, typename Query_tag>
 typename Get_param<Named_params_impl<T, Tag, Base>, Query_tag>::reference
 get_parameter_reference_impl(const Named_params_impl<T, Tag, Base>& np, Query_tag tag)
 {
-  static_assert( (!std::is_same<Query_tag, Tag>::value) );
+  static_assert(!std::is_same<Query_tag, Tag>::value);
   return get_parameter_reference_impl(static_cast<const typename Base::base&>(np), tag);
 }
 
diff --git a/STL_Extension/include/CGAL/transforming_pair_iterator.h b/STL_Extension/include/CGAL/transforming_pair_iterator.h
index abc52a584e3b..020a0b6d7c72 100644
--- a/STL_Extension/include/CGAL/transforming_pair_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_pair_iterator.h
@@ -25,7 +25,7 @@ namespace CGAL {
 namespace internal {
 template <class Cat1, class Cat2, bool=boost::is_convertible<Cat1,Cat2>::value>
 struct Min_category {
-        static_assert((boost::is_convertible<Cat2,Cat1>::value));
+        static_assert(std::is_convertible<Cat2,Cat1>::value);
         typedef Cat1 type;
 };
 
diff --git a/STL_Extension/test/STL_Extension/test_Cache.cpp b/STL_Extension/test/STL_Extension/test_Cache.cpp
index 609eb6ab8299..fc645fe5be0b 100644
--- a/STL_Extension/test/STL_Extension/test_Cache.cpp
+++ b/STL_Extension/test/STL_Extension/test_Cache.cpp
@@ -57,16 +57,16 @@ struct Int_t : public CGAL::Handle_with_policy< Int_rep, Unify > {
 void test_typedefs(){
     typedef CGAL::Cache<int,double> Cache;
     CGAL_USE_TYPE(Cache);
-    static_assert(( ::std::is_same< Cache::Input, int >::value ));
-    static_assert(( ::std::is_same< Cache::Output,double>::value ));
+    static_assert(::std::is_same< Cache::Input, int >::value );
+    static_assert(::std::is_same< Cache::Output,double>::value );
     typedef CGAL::Creator_1<int,double> Creator_double;
     CGAL_USE_TYPE(Creator_double);
-    static_assert(( ::std::is_same<Cache::Creator,Creator_double>::value ));
+    static_assert(::std::is_same<Cache::Creator,Creator_double>::value );
     typedef CGAL::Creator_1<int,int> Creator_int;
     CGAL_USE_TYPE(Creator_int);
-    static_assert(( ::std::is_same<Cache::Canonicalizer,Creator_int>::value ));
-    static_assert(( ::std::is_same<Cache::Compare,std::less<int> >::value ));
-    static_assert(( ::std::is_same<Cache::Self,CGAL::Cache<int,double> >::value ));
+    static_assert(::std::is_same<Cache::Canonicalizer,Creator_int>::value );
+    static_assert(::std::is_same<Cache::Compare,std::less<int> >::value );
+    static_assert(::std::is_same<Cache::Self,CGAL::Cache<int,double> >::value );
 }
 int main(){
     {
diff --git a/STL_Extension/test/STL_Extension/test_cgal_named_params.cpp b/STL_Extension/test/STL_Extension/test_cgal_named_params.cpp
index 1f474eebabb1..c5fba6ce23b1 100644
--- a/STL_Extension/test/STL_Extension/test_cgal_named_params.cpp
+++ b/STL_Extension/test/STL_Extension/test_cgal_named_params.cpp
@@ -46,7 +46,7 @@ template<class NamedParameters>
 void test_no_copyable(const NamedParameters& np)
 {
   typedef typename inp::Get_param<typename NamedParameters::base,inp::visitor_t>::type NP_type;
-  static_assert( (std::is_same<NP_type,std::reference_wrapper<const B> >::value) );
+  static_assert(std::is_same<NP_type,std::reference_wrapper<const B> >::value);
 
   const A<4>& a  = params::choose_parameter(params::get_parameter_reference(np, inp::edge_index), A<4>(4));
   assert(a.v==4);
@@ -60,31 +60,31 @@ void test_references(const NamedParameters& np)
 
   // std::reference_wrapper
   typedef typename inp::Lookup_named_param_def<inp::visitor_t, NamedParameters, Default_type>::reference Visitor_reference_type;
-  static_assert( (std::is_same<B&, Visitor_reference_type>::value) );
+  static_assert(std::is_same<B&, Visitor_reference_type>::value);
   Visitor_reference_type vis_ref = params::choose_parameter(params::get_parameter_reference(np, inp::visitor), default_value);
   CGAL_USE(vis_ref);
 
   // std::reference_wrapper of const
   typedef typename inp::Lookup_named_param_def<inp::face_index_t, NamedParameters, Default_type>::reference FIM_reference_type;
-  static_assert( (std::is_same<const B&, FIM_reference_type>::value) );
+  static_assert(std::is_same<const B&, FIM_reference_type>::value);
   FIM_reference_type fim_ref = params::choose_parameter(params::get_parameter_reference(np, inp::face_index), default_value);
   CGAL_USE(fim_ref);
 
   // non-copyable
   typedef typename inp::Lookup_named_param_def<inp::vertex_point_t, NamedParameters, Default_type>::reference VPM_reference_type;
-  static_assert( (std::is_same<const B&, VPM_reference_type>::value) );
+  static_assert(std::is_same<const B&, VPM_reference_type>::value);
   VPM_reference_type vpm_ref = params::choose_parameter(params::get_parameter_reference(np, inp::vertex_point), default_value);
   CGAL_USE(vpm_ref);
 
   // passed by copy
   typedef typename inp::Lookup_named_param_def<inp::vertex_index_t, NamedParameters, Default_type>::reference VIM_reference_type;
-  static_assert( (std::is_same<A<0>, VIM_reference_type>::value) );
+  static_assert(std::is_same<A<0>, VIM_reference_type>::value);
   VIM_reference_type vim_ref = params::choose_parameter(params::get_parameter_reference(np, inp::vertex_index), default_value);
   CGAL_USE(vim_ref);
 
   // default
   typedef typename inp::Lookup_named_param_def<inp::edge_index_t, NamedParameters, Default_type>::reference EIM_reference_type;
-  static_assert(( std::is_same<Default_type&, EIM_reference_type>::value) );
+  static_assert(std::is_same<Default_type&, EIM_reference_type>::value);
   EIM_reference_type eim_ref = params::choose_parameter(params::get_parameter_reference(np, inp::edge_index), default_value);
   assert(&eim_ref==&default_value);
 }
@@ -103,12 +103,12 @@ int main()
   );
 
   auto d = CGAL::parameters::default_values();
-  static_assert( (std::is_same<decltype(d),CGAL::parameters::Default_named_parameters>::value) );
+  static_assert(std::is_same<decltype(d),CGAL::parameters::Default_named_parameters>::value);
 #ifndef CGAL_NO_DEPRECATED_CODE
   auto d1 = CGAL::parameters::all_default();
-  static_assert( (std::is_same<decltype(d1),CGAL::parameters::Default_named_parameters>::value) );
+  static_assert(std::is_same<decltype(d1),CGAL::parameters::Default_named_parameters>::value);
   auto d2 = CGAL::Polygon_mesh_processing::parameters::all_default();
-  static_assert( (std::is_same<decltype(d2),CGAL::parameters::Default_named_parameters>::value) );
+  static_assert(std::is_same<decltype(d2),CGAL::parameters::Default_named_parameters>::value);
 #endif
 
   return EXIT_SUCCESS;
diff --git a/STL_Extension/test/STL_Extension/test_is_iterator.cpp b/STL_Extension/test/STL_Extension/test_is_iterator.cpp
index d1c3b157aaaa..f308d9b48807 100644
--- a/STL_Extension/test/STL_Extension/test_is_iterator.cpp
+++ b/STL_Extension/test/STL_Extension/test_is_iterator.cpp
@@ -23,11 +23,11 @@ int main() {
   static_assert(!is_iterator<int>::value);
   static_assert(is_iterator<int_p>::value);
 
-  static_assert((is_iterator_type<vector_it,std::bidirectional_iterator_tag>::value));
-  static_assert((!is_iterator_type<list_it,std::random_access_iterator_tag>::value));
-  static_assert((!is_iterator_type<short,std::output_iterator_tag>::value));
+  static_assert(is_iterator_type<vector_it,std::bidirectional_iterator_tag>::value);
+  static_assert(!is_iterator_type<list_it,std::random_access_iterator_tag>::value);
+  static_assert(!is_iterator_type<short,std::output_iterator_tag>::value);
 
-  static_assert((is_iterator_to<int_p,double>::value));
-  static_assert((!is_iterator_to<A,int>::value));
-  static_assert((!is_iterator_to<A*,int>::value));
+  static_assert(is_iterator_to<int_p,double>::value);
+  static_assert(!is_iterator_to<A,int>::value);
+  static_assert(!is_iterator_to<A*,int>::value);
 }
diff --git a/STL_Extension/test/STL_Extension/test_is_streamable.cpp b/STL_Extension/test/STL_Extension/test_is_streamable.cpp
index 6e574cfdec15..fc248fc7e6e2 100644
--- a/STL_Extension/test/STL_Extension/test_is_streamable.cpp
+++ b/STL_Extension/test/STL_Extension/test_is_streamable.cpp
@@ -27,6 +27,6 @@ int main() {
   static_assert(!is_streamable<D>::value);
   static_assert(is_streamable<int>::value);
   static_assert(is_streamable<double>::value);
-  static_assert(! (is_streamable<std::pair<int, int> >::value) );
-  static_assert(  (is_streamable<boost::tuple<int, int> >::value) );
+  static_assert(!is_streamable<std::pair<int, int> >::value);
+  static_assert(is_streamable<boost::tuple<int, int> >::value);
 }
diff --git a/STL_Extension/test/STL_Extension/test_stl_extension.cpp b/STL_Extension/test/STL_Extension/test_stl_extension.cpp
index 1895935f787e..29e078c46c7a 100644
--- a/STL_Extension/test/STL_Extension/test_stl_extension.cpp
+++ b/STL_Extension/test/STL_Extension/test_stl_extension.cpp
@@ -8120,7 +8120,7 @@ void test_tuple(){
   static_assert( std::tuple_size<T0>::value == 0 );
   static_assert( std::tuple_size<T1>::value == 2 );
   static_assert( std::tuple_size<T2>::value == 4 );
-  static_assert( (std::is_same<std::tuple_element<1,T2>::type,My_to_int>::value) );
+  static_assert( std::is_same<std::tuple_element<1,T2>::type,My_to_int>::value );
 
   T1 t1=std::make_tuple(1,2);
   T1 t1_2=std::make_tuple(1,2);
@@ -8206,17 +8206,17 @@ void test_make_sorted_pair() {
   assert(p3==p4);
   int i=2;
   assert( CGAL::make_sorted_pair(1,i) == std::make_pair(1,i) );
-  static_assert( (std::is_same<
+  static_assert( std::is_same<
                           BOOST_TYPEOF(CGAL::make_sorted_pair<long>(1L,i)),
-                          std::pair<long,long> >::value) );
+                          std::pair<long,long> >::value);
   assert( (CGAL::make_sorted_pair<long>(i,1L) == std::pair<long,long>(1L,2L)) );
 
-  static_assert( (std::is_same<
+  static_assert(  std::is_same<
                           BOOST_TYPEOF(CGAL::make_sorted_pair<double>(1,2L)),
-                          std::pair<double,double> >::value) );
-  static_assert( (std::is_same<
+                          std::pair<double,double> >::value) ;
+  static_assert(  std::is_same<
                           BOOST_TYPEOF(CGAL::make_sorted_pair<int>(1,2L)),
-                          std::pair<int,int> >::value) );
+                          std::pair<int,int> >::value);
 }
 
 void test_result_of() {
@@ -8237,8 +8237,8 @@ void test_result_of() {
   typedef CGAL::cpp11::result_of<Result_functor(int)>::type result_type_float;
   CGAL_USE_TYPE(result_type);
   CGAL_USE_TYPE(result_type_float);
-  static_assert((std::is_same<result_type, int>::value));
-  static_assert((std::is_same<result_type_float, float>::value));
+  static_assert(std::is_same<result_type, int>::value);
+  static_assert(std::is_same<result_type_float, float>::value);
 
 }
 
diff --git a/Shape_regularization/include/CGAL/Shape_regularization/regularize_planes.h b/Shape_regularization/include/CGAL/Shape_regularization/regularize_planes.h
index a5a5c5e58cbd..b86325e6d390 100644
--- a/Shape_regularization/include/CGAL/Shape_regularization/regularize_planes.h
+++ b/Shape_regularization/include/CGAL/Shape_regularization/regularize_planes.h
@@ -296,7 +296,7 @@ namespace Planes {
 
     using PlaneIndexMap = typename CGAL::Point_set_processing_3::GetPlaneIndexMap<NamedParameters>::type;
 
-    static_assert((!is_default_parameter<NamedParameters, internal_np::plane_index_t>::value),
+    static_assert(!is_default_parameter<NamedParameters, internal_np::plane_index_t>::value,
                               "Error: no plane index map");
 
     const PlaneIndexMap index_map =
diff --git a/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h b/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h
index ff11623a892b..f7894c74eb51 100644
--- a/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h
+++ b/Snap_rounding_2/include/CGAL/Snap_rounding_kd_2.h
@@ -107,7 +107,7 @@ class Search_traits_kd_tree_2 {
 
 template<class Traits_, class SAVED_OBJECT>
 class Multiple_kd_tree {
-  static_assert((boost::is_pointer<SAVED_OBJECT>::value), "SAVED_OBJECT is not a pointer.");
+  static_assert(boost::is_pointer<SAVED_OBJECT>::value, "SAVED_OBJECT is not a pointer.");
 private:
   typedef Traits_                                       Traits;
   typedef typename Traits::FT                           NT;
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
index 36f2f855312e..04303b903534 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
@@ -49,7 +49,7 @@ class Bounded_distance_placement
   template <typename Profile>
   void initialize_tree(const Profile& profile) const
   {
-    static_assert((std::is_same<GeomTraits, typename Profile::Geom_traits>::value));
+    static_assert(std::is_same<GeomTraits, typename Profile::Geom_traits>::value);
 
     typedef typename Profile::Triangle_mesh                                   Triangle_mesh;
     typedef typename boost::graph_traits<Triangle_mesh>::halfedge_descriptor  halfedge_descriptor;
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h
index 2f0abb387892..86fd7c87544c 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/FastEnvelope_filter.h
@@ -43,7 +43,7 @@ class FastEnvelope_filter
   template <typename Profile>
   void initialize_envelope(const Profile& profile) const
   {
-    static_assert((std::is_same<GeomTraits, typename Profile::Geom_traits>::value));
+    static_assert(std::is_same<GeomTraits, typename Profile::Geom_traits>::value);
 
     typedef typename Profile::Triangle_mesh                                   Triangle_mesh;
     typedef typename boost::graph_traits<Triangle_mesh>::halfedge_descriptor  halfedge_descriptor;
diff --git a/Surface_mesher/include/CGAL/Surface_mesher/Combining_oracle.h b/Surface_mesher/include/CGAL/Surface_mesher/Combining_oracle.h
index 1340c1700e31..2541ef6ff30e 100644
--- a/Surface_mesher/include/CGAL/Surface_mesher/Combining_oracle.h
+++ b/Surface_mesher/include/CGAL/Surface_mesher/Combining_oracle.h
@@ -51,9 +51,9 @@ namespace CGAL {
 
     typedef typename Oracle_a::Intersection_point Intersection_point;
 
-    static_assert((::std::is_same<
+    static_assert(::std::is_same<
                          Intersection_point,
-                         typename Oracle_b::Intersection_point>::value));
+                         typename Oracle_b::Intersection_point>::value);
 
 
     typedef ::CGAL::Multi_surface_3<typename Oracle_a::Surface_3,
diff --git a/Surface_sweep_2/include/CGAL/No_intersection_surface_sweep_2.h b/Surface_sweep_2/include/CGAL/No_intersection_surface_sweep_2.h
index 8730089384e1..33a85cde6ff3 100644
--- a/Surface_sweep_2/include/CGAL/No_intersection_surface_sweep_2.h
+++ b/Surface_sweep_2/include/CGAL/No_intersection_surface_sweep_2.h
@@ -129,8 +129,8 @@ class No_intersection_surface_sweep_2 {
   typedef typename Traits_adaptor_2::Top_side_category    Top_side_category;
   typedef typename Traits_adaptor_2::Right_side_category  Right_side_category;
 
-  static_assert((Arr_sane_identified_tagging< Left_side_category, Bottom_side_category,
-                          Top_side_category, Right_side_category >::value));
+  static_assert(Arr_sane_identified_tagging< Left_side_category, Bottom_side_category,
+                          Top_side_category, Right_side_category >::value);
 
 protected:
   /*!
diff --git a/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h b/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h
index f85c473285e2..c6751c2a3cbd 100644
--- a/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h
+++ b/Triangulation_on_sphere_2/include/CGAL/Delaunay_triangulation_on_sphere_2.h
@@ -631,8 +631,8 @@ insert(InputIterator first, InputIterator beyond,
 {
   typedef Point_3_with_iterator<Self>                                P3_wit;
 
-  static_assert((std::is_same<typename std::iterator_traits<InputIterator>::value_type, Point>::value));
-  static_assert(!(std::is_same<Point, Point_3>::value));
+  static_assert(std::is_same<typename std::iterator_traits<InputIterator>::value_type, Point>::value);
+  static_assert(!std::is_same<Point, Point_3>::value);
 
   const size_type n = number_of_vertices();
 

From 11586736c746cf2a7eb2ea9697d0a7af46ca7cb5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 20 Jun 2023 10:48:41 +0200
Subject: [PATCH 0374/1398] add missing include

---
 Alpha_shapes_2/include/CGAL/Alpha_shape_vertex_base_2.h | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Alpha_shapes_2/include/CGAL/Alpha_shape_vertex_base_2.h b/Alpha_shapes_2/include/CGAL/Alpha_shape_vertex_base_2.h
index e96dfaa5fcbf..919fec145ec4 100644
--- a/Alpha_shapes_2/include/CGAL/Alpha_shape_vertex_base_2.h
+++ b/Alpha_shapes_2/include/CGAL/Alpha_shape_vertex_base_2.h
@@ -19,6 +19,7 @@
 #include <utility>
 #include <CGAL/Triangulation_vertex_base_2.h>
 #include <CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h>
+#include <CGAL/Default.h>
 
 //-------------------------------------------------------------------
 namespace CGAL {

From 6abf126e102afb46d5b1e8f71447075ccf86ec41 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 20 Jun 2023 10:48:49 +0200
Subject: [PATCH 0375/1398] fix typo

---
 .../CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h    | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h b/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h
index 0d688be64ede..330e5005d537 100644
--- a/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h
+++ b/Heat_method_3/include/CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h
@@ -752,8 +752,8 @@ class Surface_mesh_geodesic_distances_3
     >
 #endif
 {
-  static_assert(std::is_same<Mode, Direct>::value) ||
-                        (std::is_same<Mode, Intrinsic_Delaunay>::value);
+  static_assert(std::is_same<Mode, Direct>::value ||
+                std::is_same<Mode, Intrinsic_Delaunay>::value);
 
   // extract real types from Default
 #ifdef CGAL_EIGEN3_ENABLED

From b994bc35745b424a7480057f96f314c626a3bc1f Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Tue, 20 Jun 2023 11:47:31 +0200
Subject: [PATCH 0376/1398] True and on-merge in doc

---
 .../Combinatorial_map/Concepts/GenericMap.h   | 54 +++++++++----------
 1 file changed, 27 insertions(+), 27 deletions(-)

diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
index 790d378bd074..adccc875cd0f 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
@@ -267,12 +267,12 @@ using One_dart_per_cell_const_range = unspecified_type;
 /// @{
 
 /*!
-Returns true iff the generic map is empty, i.e.\ it contains no dart.
+Returns `true` iff the generic map is empty, i.e.\ it contains no dart.
 */
 bool is_empty() const;
 
 /*!
-Returns true iff the generic map is without <I>i</I>-boundary.
+Returns `true` iff the generic map is without <I>i</I>-boundary.
 
 The map is without <I>i</I>-boundary if there is no `i`-free dart.
 \pre 1\f$ \leq \f$ <I>i</I> \f$ \leq \f$ \link GenericMap::dimension `dimension`\endlink.
@@ -280,7 +280,7 @@ The map is without <I>i</I>-boundary if there is no `i`-free dart.
 bool is_without_boundary(unsigned int i) const;
 
 /*!
-Returns true iff the generic map is without boundary in all dimensions.
+Returns `true` iff the generic map is without boundary in all dimensions.
 */
 bool is_without_boundary() const;
 
@@ -308,18 +308,18 @@ Returns an upper bound of the id of <I>i</I>-attributes descriptors if indices a
 template <unsigned int i>
 size_type upper_bound_on_attribute_ids() const;
 
-/*! Returns true if `d` is a descriptor of a used dart (i.e.\ valid).
+/*! Returns `true` if `d` is a descriptor of a used dart (i.e.\ valid).
  */
 bool is_dart_used(Dart_const_descriptor d) const;
 
 /*!
-Returns true iff dart `d` is <I>i</I>-free.
+Returns `true` iff dart `d` is <I>i</I>-free.
 \pre 0 \f$ \leq \f$ <I>i</I> \f$ \leq \f$ \link GenericMap::dimension `dimension`\endlink.
 */
 bool is_free(Dart_const_descriptor d, unsigned int i) const;
 
 /*!
-Returns true iff dart `d` is <I>i</I>-free.
+Returns `true` iff dart `d` is <I>i</I>-free.
 \pre 0 \f$ \leq \f$ <I>i</I> \f$ \leq \f$ \link GenericMap::dimension `dimension`\endlink.
 */
 template<unsigned int i>
@@ -477,7 +477,7 @@ A shortcut for \link GenericMap::dart_of_attribute(typename Attribute_const_desc
 template<unsigned int i>
 Dart_const_descriptor dart(Dart_const_descriptor adart) const;
 
-/*! Returns true if ah points to a used i-attribute (i.e.\ valid).
+/*! Returns `true` if ah points to a used i-attribute (i.e.\ valid).
 \pre 0 \f$ \leq \f$ <I>i</I> \f$ \leq \f$ \link GenericMap::dimension `dimension`\endlink, and <I>i</I>-attributes are non `void`.
  */
 template<unsigned int i>
@@ -703,13 +703,13 @@ void correct_invalid_attributes();
 
 /// \cond SKIP_IN_MANUAL boost::function \endcond
 
-/// \name Dynamic Onmerge/Onsplit functors
+/// \name Dynamic On-Merge/On-Split functors
 /// @{
 
 /*!
-  Return the current dynamic onsplit function associated with i-attributes.
+  Return the current dynamic on-split function associated with i-attributes.
   This is a boost::function returning void and having two references to \link GenericMap::Attribute_type `Attribute_type<i>::type`\endlink as parameters.
-  The onsplit function is returned by reference so that we can modify it.
+  The on-split function is returned by reference so that we can modify it.
 */
   template<int i>
   boost::function<void(typename Attribute_type< i >::type&,
@@ -717,7 +717,7 @@ void correct_invalid_attributes();
   onsplit_function();
 
 /*!
-  Return the current dynamic onsplit function associated with i-attributes, when *this is const.
+  Return the current dynamic on-split function associated with i-attributes, when *this is const.
   This is a boost::function returning void and having two references to \link GenericMap::Attribute_type `Attribute_type<i>::type`\endlink as parameters.
 */
   template<int i>
@@ -726,9 +726,9 @@ void correct_invalid_attributes();
   onsplit_function() const;
 
 /*!
-  Return the current dynamic onmerge function associated with i-attributes.
+  Return the current dynamic on-merge function associated with i-attributes.
   This is a boost::function returning void and having two references to \link GenericMap::Attribute_type `Attribute_type<i>::type`\endlink as parameters.
-  The onmerge function is returned by reference so that we can modify it.
+  The on-merge function is returned by reference so that we can modify it.
 */
   template<int i>
   boost::function<void(typename Attribute_type< i >::type&,
@@ -736,7 +736,7 @@ void correct_invalid_attributes();
   onmerge_function();
 
 /*!
-  Return the current dynamic onmerge function associated with i-attributes, when *this is const.
+  Return the current dynamic on-merge function associated with i-attributes, when *this is const.
   This is a boost::function returning void and having two references to \link GenericMap::Attribute_type `Attribute_type<i>::type`\endlink as parameters.
 */
   template<int i>
@@ -756,13 +756,13 @@ index. If there is no more available free mark, throw the exception Exception_no
 size_type get_new_mark() const;
 
 /*!
-Returns true iff `m` is a reserved mark of the generic map.
+Returns `true` iff `m` is a reserved mark of the generic map.
 \pre 0\f$ \leq \f$ <I>m</I> \f$ < \f$ \link GenericMap::NB_MARKS `NB_MARKS`\endlink.
 */
 bool is_reserved(size_type m) const;
 
 /*!
-Returns true iff dart `d` is marked for `m`.
+Returns `true` iff dart `d` is marked for `m`.
 \pre \link GenericMap::is_reserved `is_reserved(m)`\endlink and `d`\f$ \in \f$ `darts()`.
 */
 bool is_marked(Dart_const_descriptor d, size_type m) const;
@@ -868,7 +868,7 @@ Inserts a 0-cell in the 1-cell containing `d`. Returns `next(d)`, a descriptor o
 
 See examples for combinatorial map in \cgalFigureRef{fig_cmap_insert_vertex} and for generalized map in \cgalFigureRef{fig_gmap_insert_vertex}.
 
-If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if 1-attributes are non `void`, \link CellAttribute::On_split `Attribute_type<1>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called, with <I>a</I> the original 1-attribute associated with <I>d</I> and <I>a'</I> the new 1-attribute created during the operation. If set, the dynamic onsplit function of 1-attributes is also called on <I>a</I> and <I>a'</I>.
+If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if 1-attributes are non `void`, \link CellAttribute::On_split `Attribute_type<1>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called, with <I>a</I> the original 1-attribute associated with <I>d</I> and <I>a'</I> the new 1-attribute created during the operation. If set, the dynamic on-split function of 1-attributes is also called on <I>a</I> and <I>a'</I>.
 
 \cgalAdvancedBegin
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
@@ -889,7 +889,7 @@ Inserts a 0-cell in the 2-cell containing `d`. The 2-cell is split in triangles,
 
 See examples for combinatorial map in \cgalFigureRef{fig_cmap_triangulation} and for generalized map in \cgalFigureRef{fig_gmap_triangulation}.
 
-If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if 2-attributes are non `void`, \link CellAttribute::On_split `Attribute_type<2>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called, with <I>a</I> the original 2-attribute associated with `d` and <I>a'</I> each new 2-attribute created during the operation. If set, the dynamic onsplit function of 2-attributes is also called on <I>a</I> and <I>a'</I>.
+If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if 2-attributes are non `void`, \link CellAttribute::On_split `Attribute_type<2>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called, with <I>a</I> the original 2-attribute associated with `d` and <I>a'</I> each new 2-attribute created during the operation. If set, the dynamic on-split function of 2-attributes is also called on <I>a</I> and <I>a'</I>.
 
 \cgalAdvancedBegin
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
@@ -910,7 +910,7 @@ Inserts a 1-cell in the 2-cell containing `d1` and `d2`. Returns `previous(d1)`,
 
 See examples for combinatorial map in \cgalFigureRef{fig_cmap_insert_edge} and for generalized map in \cgalFigureRef{fig_gmap_insert_edge}.
 
-If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if 2-attributes are non `void`, \link CellAttribute::On_split `Attribute_type<2>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called, with <I>a</I> the original 2-attribute associated with `d` and <I>a'</I> the new 2-attribute created during the operation. If set, the dynamic onsplit function of 2-attributes is also called on <I>a</I> and <I>a'</I>.
+If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if 2-attributes are non `void`, \link CellAttribute::On_split `Attribute_type<2>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called, with <I>a</I> the original 2-attribute associated with `d` and <I>a'</I> the new 2-attribute created during the operation. If set, the dynamic on-split function of 2-attributes is also called on <I>a</I> and <I>a'</I>.
 
 \cgalAdvancedBegin
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
@@ -930,7 +930,7 @@ Dart_descriptor insert_cell_1_in_cell_2(Dart_descriptor d1, Dart_descriptor d2);
 Inserts a 1-cell between the 2-cell containing `d1` and the one containing `d2`. Returns `previous(d1)`, a descriptor on one dart belonging to the new 1-cell.
 \pre `is_insertable_cell_1_between_two_cells_2(d1,d2)`.
 
-If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, call \link CellAttribute::On_merge `Attribute_type<i>::type::On_merge`\endlink(<I>a</I>,<I>a'</I>) is called for all enabled i-attributes, for i>=2, with <I>a</I> the original 2-attribute associated with `d` and <I>a'</I> the new 2-attribute created during the operation. If set, the dynamic onmerge function of i-attributes is also called on <I>a</I> and <I>a'</I>.
+If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, call \link CellAttribute::On_merge `Attribute_type<i>::type::On_merge`\endlink(<I>a</I>,<I>a'</I>) is called for all enabled i-attributes, for i>=2, with <I>a</I> the original 2-attribute associated with `d` and <I>a'</I> the new 2-attribute created during the operation. If set, the dynamic on-merge function of i-attributes is also called on <I>a</I> and <I>a'</I>.
 
 \cgalAdvancedBegin
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
@@ -959,7 +959,7 @@ Inserts a 2-cell along the path of 1-cells containing darts given by the range `
 
 See examples for combinatorial map in \cgalFigureRef{fig_cmap_insert_facet} and for generalized map in \cgalFigureRef{fig_gmap_insert_facet}.
 
-If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if 3-attributes are non `void`, \link CellAttribute::On_split `Attribute_type<3>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called, with <I>a</I> the original 3-attribute associated with `d` and <I>a'</I> the new 3-attribute created during the operation. If set, the dynamic onsplit function of 3-attributes is also called on <I>a</I> and <I>a'</I>.
+If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if 3-attributes are non `void`, \link CellAttribute::On_split `Attribute_type<3>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called, with <I>a</I> the original 3-attribute associated with `d` and <I>a'</I> the new 3-attribute created during the operation. If set, the dynamic on-split function of 3-attributes is also called on <I>a</I> and <I>a'</I>.
 
 \cgalAdvancedBegin
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
@@ -997,7 +997,7 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 Dart_descriptor insert_dangling_cell_1_in_cell_2(Dart_descriptor d);
 
 /*!
-Returns true iff it is possible to insert a 1-cell in the generic map between `d1` and `d2`.
+Returns `true` iff it is possible to insert a 1-cell in the generic map between `d1` and `d2`.
 
 This is possible if `d1`\f$ \neq \f$ `d2` and `d1` can be reached from `d2` by using some `previous` and `next` calls.
 \pre \link GenericMap::dimension `dimension`\endlink \f$ \geq\f$ 2, `d1`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink, and `d2`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink.
@@ -1009,7 +1009,7 @@ This is possible if `d1`\f$ \neq \f$ `d2` and `d1` can be reached from `d2` by u
 bool is_insertable_cell_1_in_cell_2(Dart_const_descriptor d1, Dart_const_descriptor d2);
 
 /*!
-Returns true iff it is possible to insert a 1-cell in the generic map between `d1` and `d2`.
+Returns `true` iff it is possible to insert a 1-cell in the generic map between `d1` and `d2`.
 
 This is possible if `d1`\f$ \neq \f$ `d2` and `d1` can not be reached from `d2` by using some `previous` and `next` calls.
 \pre \link GenericMap::dimension `dimension`\endlink \f$ \geq\f$ 2, `d1`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink, and `d2`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink.
@@ -1020,7 +1020,7 @@ This is possible if `d1`\f$ \neq \f$ `d2` and `d1` can not be reached from `d2`
 bool is_insertable_cell_1_between_two_cells_2(Dart_const_descriptor d1, Dart_const_descriptor d2);
 
 /*!
-Returns true iff it is possible to insert a 2-cell in the generic map along the path of darts given by the range `[afirst,alast)`. The 2-cell can be inserted iff the ordered list of darts form a closed path of edges inside a same volume.
+Returns `true` iff it is possible to insert a 2-cell in the generic map along the path of darts given by the range `[afirst,alast)`. The 2-cell can be inserted iff the ordered list of darts form a closed path of edges inside a same volume.
 \pre \link GenericMap::dimension `dimension`\endlink \f$ \geq\f$ 3.
 
 \sa `insert_cell_2_in_cell_3<InputIterator>`
@@ -1031,7 +1031,7 @@ template <class InputIterator>
 bool is_insertable_cell_2_in_cell_3(InputIterator afirst, InputIterator alast);
 
 /*!
-Returns true iff the <I>i</I>-cell containing `d` can be removed.
+Returns `true` iff the <I>i</I>-cell containing `d` can be removed.
 
 An <I>i</I>-cell can be removed if `i`==\link GenericMap::dimension `dimension`\endlink or if `i`==\link GenericMap::dimension `dimension`\endlink-1 or if `i`\f$ < \f$ \link GenericMap::dimension `dimension`\endlink-1 and the <I>i</I>-cell containing `d` is incident to at most two (<I>i+1</I>)-cells.
 \pre 0\f$ \leq \f$ `i`\f$ \leq \f$ \link GenericMap::dimension `dimension`\endlink and `d`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink.
@@ -1047,9 +1047,9 @@ Removes the <I>i</I>-cell containing `d`. Returns the number of darts removed fr
 
 See examples in \cgalFigureRef{fig_cmap_insert_vertex}, \cgalFigureRef{fig_cmap_insert_edge} and \cgalFigureRef{fig_cmap_insert_facet}.
 
-If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if `i`\f$ < \f$ \link GenericMap::dimension `dimension`\endlink, and <I>i+1</I>-attributes are non `void`, and if there are two distinct (<I>i+1</I>)-cells around dart `d`, \link CellAttribute::On_merge `Attribute_type<i+1>::type::On_merge`\endlink(<I>a1</I>,<I>a2</I>) is called, with <I>a1</I> the (<I>i+1</I>)-attribute associated to `d`, and <I>a2</I> the (<I>i+1</I>)-attribute associated to \f$ \beta_{i+1}\f$(<I>d</I>). If set, the dynamic onmerge function of <I>i+1</I>-attributes is also called on <I>a1</I> and <I>a2</I>.
+If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if `i`\f$ < \f$ \link GenericMap::dimension `dimension`\endlink, and <I>i+1</I>-attributes are non `void`, and if there are two distinct (<I>i+1</I>)-cells around dart `d`, \link CellAttribute::On_merge `Attribute_type<i+1>::type::On_merge`\endlink(<I>a1</I>,<I>a2</I>) is called, with <I>a1</I> the (<I>i+1</I>)-attribute associated to `d`, and <I>a2</I> the (<I>i+1</I>)-attribute associated to \f$ \beta_{i+1}\f$(<I>d</I>). If set, the dynamic on-merge function of <I>i+1</I>-attributes is also called on <I>a1</I> and <I>a2</I>.
 
-If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if a <I>j</I>-cell is disconnected in two <I>j</I>-cells during the operation, and if <I>j</I>-attributes are non void, \link CellAttribute::On_split `Attribute_type<j>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called with <I>a</I> the original <I>j</I>-attribute and <I>a'</I> the new <I>j</I>-attribute created due to the disconnection. If set, the dynamic onsplit function of <i>j</i>-attributes is also called on <I>a</I> and <I>a'</I>.
+If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if a <I>j</I>-cell is disconnected in two <I>j</I>-cells during the operation, and if <I>j</I>-attributes are non void, \link CellAttribute::On_split `Attribute_type<j>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called with <I>a</I> the original <I>j</I>-attribute and <I>a'</I> the new <I>j</I>-attribute created due to the disconnection. If set, the dynamic on-split function of <i>j</i>-attributes is also called on <I>a</I> and <I>a'</I>.
 
 \cgalAdvancedBegin
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.

From 32655a75b85c77684ce5c09fcd1904b851e4dc69 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Tue, 20 Jun 2023 12:03:00 +0200
Subject: [PATCH 0377/1398] Add () after function names in sa

---
 .../Combinatorial_map/Concepts/GenericMap.h   | 136 +++++++++---------
 1 file changed, 68 insertions(+), 68 deletions(-)

diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
index adccc875cd0f..c080e2166d4c 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
@@ -820,9 +820,9 @@ void free_mark(size_type m) const;
 Creates a combinatorial hexahedron (six combinatorial quadrangles 2-sewn together), and adds it in the generic map. Returns a descriptor on one dart of this combinatorial hexahedron.
 \pre `dimension` \f$\geq\f$ 2.
 
-\sa `make_edge`
-\sa `make_combinatorial_polygon`
-\sa `make_combinatorial_tetrahedron`
+\sa `make_edge()`
+\sa `make_combinatorial_polygon()`
+\sa `make_combinatorial_tetrahedron()`
 
 */
 Dart_descriptor make_combinatorial_hexahedron();
@@ -831,9 +831,9 @@ Dart_descriptor make_combinatorial_hexahedron();
 Creates a combinatorial polygon of length `lg` (a cycle of `lg` edges), and adds it in the generic map. Returns a descriptor on one dart of this combinatorial polygon.
 \pre `dimension`\f$ \geq\f$ 1 and `lg`\f$ >\f$ 0.
 
-\sa `make_edge`
-\sa `make_combinatorial_tetrahedron`
-\sa `make_combinatorial_hexahedron`
+\sa `make_edge()`
+\sa `make_combinatorial_tetrahedron()`
+\sa `make_combinatorial_hexahedron()`
 */
 Dart_descriptor make_combinatorial_polygon(unsigned int lg);
 
@@ -841,9 +841,9 @@ Dart_descriptor make_combinatorial_polygon(unsigned int lg);
 Creates a combinatorial tetrahedron (four combinatorial triangles 2-sewn together), and adds it in the generic map. Returns a descriptor on one dart of this combinatorial tetrahedron.
 \pre `dimension`\f$ \geq\f$ 2.
 
-\sa `make_edge`
-\sa `make_combinatorial_polygon`
-\sa `make_combinatorial_hexahedron`
+\sa `make_edge()`
+\sa `make_combinatorial_polygon()`
+\sa `make_combinatorial_hexahedron()`
 */
 Dart_descriptor make_combinatorial_tetrahedron();
 
@@ -851,9 +851,9 @@ Dart_descriptor make_combinatorial_tetrahedron();
 Creates an isolated edge (two darts sewn to represent one edge and two vertices) and adds it in the generic map. Returns a descriptor on one dart of this edge.
 \pre `dimension`\f$ \geq\f$ 2.
 
-\sa `make_combinatorial_polygon`
-\sa `make_combinatorial_tetrahedron`
-\sa `make_combinatorial_hexahedron`
+\sa `make_combinatorial_polygon()`
+\sa `make_combinatorial_tetrahedron()`
+\sa `make_combinatorial_hexahedron()`
 */
 Dart_descriptor make_edge();
 
@@ -874,12 +874,12 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
 \cgalAdvancedEnd
 
-\sa `insert_cell_0_in_cell_2`
-\sa `insert_cell_1_in_cell_2`
-\sa `insert_cell_1_between_two_cells_2`
-\sa `insert_dangling_cell_1_in_cell_2`
-\sa `insert_cell_2_in_cell_3<InputIterator>`
-\sa `remove_cell<i>`
+\sa `insert_cell_0_in_cell_2()`
+\sa `insert_cell_1_in_cell_2()`
+\sa `insert_cell_1_between_two_cells_2()`
+\sa `insert_dangling_cell_1_in_cell_2()`
+\sa `insert_cell_2_in_cell_3<InputIterator>()`
+\sa `remove_cell<i>()`
 */
 Dart_descriptor insert_cell_0_in_cell_1(Dart_descriptor d);
 
@@ -895,12 +895,12 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
 \cgalAdvancedEnd
 
-\sa `insert_cell_0_in_cell_2`
-\sa `insert_cell_1_in_cell_2`
-\sa `insert_cell_1_between_two_cells_2`
-\sa `insert_dangling_cell_1_in_cell_2`
-\sa `insert_cell_2_in_cell_3<InputIterator>`
-\sa `remove_cell<i>`
+\sa `insert_cell_0_in_cell_2()`
+\sa `insert_cell_1_in_cell_2()`
+\sa `insert_cell_1_between_two_cells_2()`
+\sa `insert_dangling_cell_1_in_cell_2()`
+\sa `insert_cell_2_in_cell_3<InputIterator>()`
+\sa `remove_cell<i>()`
 */
 Dart_descriptor insert_cell_0_in_cell_2(Dart_descriptor d);
 
@@ -916,13 +916,13 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
 \cgalAdvancedEnd
 
-\sa `is_insertable_cell_1_in_cell_2`
-\sa `insert_cell_0_in_cell_1`
-\sa `insert_cell_0_in_cell_2`
-\sa `insert_cell_1_between_two_cells_2`
-\sa `insert_dangling_cell_1_in_cell_2`
-\sa `insert_cell_2_in_cell_3<InputIterator>`
-\sa `remove_cell<i>`
+\sa `is_insertable_cell_1_in_cell_2()`
+\sa `insert_cell_0_in_cell_1()`
+\sa `insert_cell_0_in_cell_2()`
+\sa `insert_cell_1_between_two_cells_2()`
+\sa `insert_dangling_cell_1_in_cell_2()`
+\sa `insert_cell_2_in_cell_3<InputIterator>()`
+\sa `remove_cell<i>()`
 */
 Dart_descriptor insert_cell_1_in_cell_2(Dart_descriptor d1, Dart_descriptor d2);
 
@@ -936,20 +936,20 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
 \cgalAdvancedEnd
 
-\sa `is_insertable_cell_1_between_two_cells_2`
-\sa `insert_cell_0_in_cell_1`
-\sa `insert_cell_0_in_cell_2`
-\sa `insert_cell_1_in_cell_2`
-\sa `insert_dangling_cell_1_in_cell_2`
-\sa `insert_cell_2_in_cell_3<InputIterator>`
-\sa `remove_cell<i>`
+\sa `is_insertable_cell_1_between_two_cells_2()`
+\sa `insert_cell_0_in_cell_1()`
+\sa `insert_cell_0_in_cell_2()`
+\sa `insert_cell_1_in_cell_2()`
+\sa `insert_dangling_cell_1_in_cell_2()`
+\sa `insert_cell_2_in_cell_3<InputIterator>()`
+\sa `remove_cell<i>()`
 */
 Dart_descriptor insert_cell_1_between_two_cells_2(Dart_descriptor d1, Dart_descriptor d2);
 
-/*! Call `insert_cell_1_in_cell_2` if `is_insertable_cell_1_in_cell_2(d1, d2)`, otherwise call `insert_cell_1_between_two_cells_2`.
-\sa `insert_cell_1_in_cell_2`
-\sa `insert_cell_1_between_two_cells_2`
-\sa `is_insertable_cell_1_in_cell_2`
+/*! Call `insert_cell_1_in_cell_2()` if `is_insertable_cell_1_in_cell_2(d1, d2)`, otherwise call `insert_cell_1_between_two_cells_2()`.
+\sa `insert_cell_1_in_cell_2()`
+\sa `insert_cell_1_between_two_cells_2()`
+\sa `is_insertable_cell_1_in_cell_2()`
 */
 Dart_descriptor insert_cell_1(Dart_descriptor d1, Dart_descriptor d2);
 
@@ -965,13 +965,13 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
 \cgalAdvancedEnd
 
-\sa `is_insertable_cell_2_in_cell_3<InputIterator>`
-\sa `insert_cell_0_in_cell_1`
-\sa `insert_cell_0_in_cell_2`
-\sa `insert_cell_1_in_cell_2`
-\sa `insert_cell_1_between_two_cells_2`
-\sa `insert_dangling_cell_1_in_cell_2`
-\sa `remove_cell<i>`
+\sa `is_insertable_cell_2_in_cell_3<InputIterator>()`
+\sa `insert_cell_0_in_cell_1()`
+\sa `insert_cell_0_in_cell_2()`
+\sa `insert_cell_1_in_cell_2()`
+\sa `insert_cell_1_between_two_cells_2()`
+\sa `insert_dangling_cell_1_in_cell_2()`
+\sa `remove_cell<i>()`
 */
 template <class InputIterator>
 Dart_descriptor insert_cell_2_in_cell_3(InputIterator afirst, InputIterator alast);
@@ -986,12 +986,12 @@ See examples for combinatorial map in \cgalFigureRef{fig_cmap_insert_edge} and f
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
 \cgalAdvancedEnd
 
-\sa `insert_cell_0_in_cell_1`
-\sa `insert_cell_0_in_cell_2`
-\sa `insert_cell_1_in_cell_2`
-\sa `insert_cell_1_between_two_cells_2`
-\sa `insert_cell_2_in_cell_3<InputIterator>`
-\sa `remove_cell<i>`
+\sa `insert_cell_0_in_cell_1()`
+\sa `insert_cell_0_in_cell_2()`
+\sa `insert_cell_1_in_cell_2()`
+\sa `insert_cell_1_between_two_cells_2()`
+\sa `insert_cell_2_in_cell_3<InputIterator>()`
+\sa `remove_cell<i>()`
 
 */
 Dart_descriptor insert_dangling_cell_1_in_cell_2(Dart_descriptor d);
@@ -1002,8 +1002,8 @@ Returns `true` iff it is possible to insert a 1-cell in the generic map between
 This is possible if `d1`\f$ \neq \f$ `d2` and `d1` can be reached from `d2` by using some `previous` and `next` calls.
 \pre \link GenericMap::dimension `dimension`\endlink \f$ \geq\f$ 2, `d1`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink, and `d2`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink.
 
-\sa `insert_cell_1_in_cell_2`
-\sa `is_insertable_cell_2_in_cell_3<InputIterator>`
+\sa `insert_cell_1_in_cell_2()`
+\sa `is_insertable_cell_2_in_cell_3<InputIterator>()`
 
 */
 bool is_insertable_cell_1_in_cell_2(Dart_const_descriptor d1, Dart_const_descriptor d2);
@@ -1014,7 +1014,7 @@ Returns `true` iff it is possible to insert a 1-cell in the generic map between
 This is possible if `d1`\f$ \neq \f$ `d2` and `d1` can not be reached from `d2` by using some `previous` and `next` calls.
 \pre \link GenericMap::dimension `dimension`\endlink \f$ \geq\f$ 2, `d1`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink, and `d2`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink.
 
-\sa `insert_cell_1_between_two_cells_2`
+\sa `insert_cell_1_between_two_cells_2()`
 
 */
 bool is_insertable_cell_1_between_two_cells_2(Dart_const_descriptor d1, Dart_const_descriptor d2);
@@ -1023,8 +1023,8 @@ bool is_insertable_cell_1_between_two_cells_2(Dart_const_descriptor d1, Dart_con
 Returns `true` iff it is possible to insert a 2-cell in the generic map along the path of darts given by the range `[afirst,alast)`. The 2-cell can be inserted iff the ordered list of darts form a closed path of edges inside a same volume.
 \pre \link GenericMap::dimension `dimension`\endlink \f$ \geq\f$ 3.
 
-\sa `insert_cell_2_in_cell_3<InputIterator>`
-\sa `is_insertable_cell_1_in_cell_2`
+\sa `insert_cell_2_in_cell_3<InputIterator>()`
+\sa `is_insertable_cell_1_in_cell_2()`
 
 */
 template <class InputIterator>
@@ -1036,7 +1036,7 @@ Returns `true` iff the <I>i</I>-cell containing `d` can be removed.
 An <I>i</I>-cell can be removed if `i`==\link GenericMap::dimension `dimension`\endlink or if `i`==\link GenericMap::dimension `dimension`\endlink-1 or if `i`\f$ < \f$ \link GenericMap::dimension `dimension`\endlink-1 and the <I>i</I>-cell containing `d` is incident to at most two (<I>i+1</I>)-cells.
 \pre 0\f$ \leq \f$ `i`\f$ \leq \f$ \link GenericMap::dimension `dimension`\endlink and `d`\f$ \in \f$ \link GenericMap::darts `darts()`\endlink.
 
-\sa `remove_cell<i>`
+\sa `remove_cell<i>()`
 */
 template <unsigned int i>
 bool is_removable(Dart_const_descriptor d);
@@ -1055,13 +1055,13 @@ If \link GenericMap::are_attributes_automatically_managed `are_attributes_automa
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
 \cgalAdvancedEnd
 
-\sa `is_removable<i>`
-\sa `insert_cell_0_in_cell_1`
-\sa `insert_cell_0_in_cell_2`
-\sa `insert_cell_1_in_cell_2`
-\sa `insert_cell_1_between_two_cells_2`
-\sa `insert_dangling_cell_1_in_cell_2`
-\sa `insert_cell_2_in_cell_3<InputIterator>`
+\sa `is_removable<i>()`
+\sa `insert_cell_0_in_cell_1()`
+\sa `insert_cell_0_in_cell_2()`
+\sa `insert_cell_1_in_cell_2()`
+\sa `insert_cell_1_between_two_cells_2()`
+\sa `insert_dangling_cell_1_in_cell_2()`
+\sa `insert_cell_2_in_cell_3<InputIterator>()`
 */
 template <unsigned int i>
 size_type remove_cell(Dart_descriptor d);

From 936ff74dde3ba5aea89099854491cb8fc93ef905 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 20 Jun 2023 13:42:58 +0200
Subject: [PATCH 0378/1398] add missing include

---
 Filtered_kernel/include/CGAL/Filtered_kernel.h | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel.h b/Filtered_kernel/include/CGAL/Filtered_kernel.h
index 182ba3c4d99b..69b4cb9925ac 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel.h
@@ -21,9 +21,7 @@
 #include <CGAL/Kernel/Type_equality_wrapper.h>
 #include <CGAL/Exact_kernel_selector.h>
 
-#include <CGAL/MP_Float.h>
-#include <CGAL/Quotient.h>
-#include <CGAL/Number_types/internal/Exact_type_selector.h>
+#include <CGAL/Lazy_exact_nt.h>
 
 #include <CGAL/Filtered_kernel/internal/Static_filters/Static_filters.h>
 #include <boost/type_traits.hpp>

From 846dd8025338928d855d645c8f81314f878033b1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 20 Jun 2023 13:57:56 +0200
Subject: [PATCH 0379/1398] move it to a more suitable place

---
 Filtered_kernel/include/CGAL/Filtered_kernel.h | 2 --
 Filtered_kernel/include/CGAL/Lazy_kernel.h     | 1 +
 2 files changed, 1 insertion(+), 2 deletions(-)

diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel.h b/Filtered_kernel/include/CGAL/Filtered_kernel.h
index 69b4cb9925ac..3a41cabf3f08 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel.h
@@ -21,8 +21,6 @@
 #include <CGAL/Kernel/Type_equality_wrapper.h>
 #include <CGAL/Exact_kernel_selector.h>
 
-#include <CGAL/Lazy_exact_nt.h>
-
 #include <CGAL/Filtered_kernel/internal/Static_filters/Static_filters.h>
 #include <boost/type_traits.hpp>
 
diff --git a/Filtered_kernel/include/CGAL/Lazy_kernel.h b/Filtered_kernel/include/CGAL/Lazy_kernel.h
index 08a6ebb41a0a..183c322257e8 100644
--- a/Filtered_kernel/include/CGAL/Lazy_kernel.h
+++ b/Filtered_kernel/include/CGAL/Lazy_kernel.h
@@ -31,6 +31,7 @@
 #include <boost/mpl/or.hpp>
 #include <boost/type_traits/remove_reference.hpp>
 #include <boost/type_traits/remove_cv.hpp>
+#include <CGAL/Lazy_exact_nt.h>
 
 #if defined(BOOST_MSVC)
 #  pragma warning(push)

From 27e303b5984fab1cb9a9dc5d3a174bcd282034ce Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 20 Jun 2023 14:18:39 +0200
Subject: [PATCH 0380/1398] add more missing include directives

---
 NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h            | 1 +
 .../Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h | 1 +
 .../test/Surface_mesher/implicit_surface_mesher_test.cpp         | 1 +
 3 files changed, 3 insertions(+)

diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h b/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h
index 26741caf72a3..6e6b496840e1 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h
@@ -15,6 +15,7 @@
 #include <CGAL/basic.h>
 #include <CGAL/algorithm.h>
 #include <CGAL/Lazy.h>
+#include <CGAL/Lazy_exact_nt.h>
 #include <CGAL/Default.h>
 #include <CGAL/NewKernel_d/Filtered_predicate2.h>
 #include <CGAL/iterator_from_indices.h>
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h
index 37a9307dcaf0..d521dc4257c1 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_traits_2_aux.h
@@ -25,6 +25,7 @@
 #include <CGAL/tags.h>
 #include <CGAL/Uncertain.h>
 #include <CGAL/Unfiltered_predicate_adaptor.h>
+#include <CGAL/Lazy_exact_nt.h>
 
 #include <boost/tuple/tuple.hpp>
 #include <boost/optional/optional.hpp>
diff --git a/Surface_mesher/test/Surface_mesher/implicit_surface_mesher_test.cpp b/Surface_mesher/test/Surface_mesher/implicit_surface_mesher_test.cpp
index 31dd6c116525..374c5b6941ca 100644
--- a/Surface_mesher/test/Surface_mesher/implicit_surface_mesher_test.cpp
+++ b/Surface_mesher/test/Surface_mesher/implicit_surface_mesher_test.cpp
@@ -1,6 +1,7 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Cartesian.h>
 #include <CGAL/Filtered_kernel.h>
+#include <CGAL/Lazy_exact_nt.h>
 
 #include <CGAL/make_surface_mesh.h>
 

From ccc5462b28f701ceca3394c0f5d0fb72c6d86b5d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 20 Jun 2023 14:45:43 +0200
Subject: [PATCH 0381/1398] add missing include directives

---
 Convex_hull_3/include/CGAL/Convex_hull_vertex_base_2.h          | 1 +
 .../include/CGAL/Regular_triangulation_vertex_base_2.h          | 2 +-
 Triangulation_2/include/CGAL/Triangulation_vertex_base_2.h      | 1 +
 .../include/CGAL/Regular_triangulation_vertex_base_3.h          | 1 +
 Triangulation_3/include/CGAL/Triangulation_vertex_base_3.h      | 1 +
 5 files changed, 5 insertions(+), 1 deletion(-)

diff --git a/Convex_hull_3/include/CGAL/Convex_hull_vertex_base_2.h b/Convex_hull_3/include/CGAL/Convex_hull_vertex_base_2.h
index a7f311246463..cef5f5eeac86 100644
--- a/Convex_hull_3/include/CGAL/Convex_hull_vertex_base_2.h
+++ b/Convex_hull_3/include/CGAL/Convex_hull_vertex_base_2.h
@@ -18,6 +18,7 @@
 #include <CGAL/license/Convex_hull_3.h>
 
 #include <CGAL/Triangulation_ds_vertex_base_2.h>
+#include <CGAL/IO/io.h>
 
 #include <iostream>
 
diff --git a/Triangulation_2/include/CGAL/Regular_triangulation_vertex_base_2.h b/Triangulation_2/include/CGAL/Regular_triangulation_vertex_base_2.h
index a2ca48dac151..cc937b133c6c 100644
--- a/Triangulation_2/include/CGAL/Regular_triangulation_vertex_base_2.h
+++ b/Triangulation_2/include/CGAL/Regular_triangulation_vertex_base_2.h
@@ -16,8 +16,8 @@
 
 #include <CGAL/license/Triangulation_2.h>
 
-
 #include <CGAL/Triangulation_ds_vertex_base_2.h>
+#include <CGAL/IO/io.h>
 
 namespace CGAL {
 
diff --git a/Triangulation_2/include/CGAL/Triangulation_vertex_base_2.h b/Triangulation_2/include/CGAL/Triangulation_vertex_base_2.h
index ecbb1083689d..0e2bb5e03332 100644
--- a/Triangulation_2/include/CGAL/Triangulation_vertex_base_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_vertex_base_2.h
@@ -18,6 +18,7 @@
 
 #include <CGAL/config.h>
 #include <CGAL/Triangulation_ds_vertex_base_2.h>
+#include <CGAL/IO/io.h>
 
 namespace CGAL {
 
diff --git a/Triangulation_3/include/CGAL/Regular_triangulation_vertex_base_3.h b/Triangulation_3/include/CGAL/Regular_triangulation_vertex_base_3.h
index cd697f179781..cdd1bce326b4 100644
--- a/Triangulation_3/include/CGAL/Regular_triangulation_vertex_base_3.h
+++ b/Triangulation_3/include/CGAL/Regular_triangulation_vertex_base_3.h
@@ -18,6 +18,7 @@
 #include <CGAL/basic.h>
 #include <CGAL/Triangulation_vertex_base_3.h>
 #include <CGAL/Triangulation_ds_vertex_base_3.h>
+#include <CGAL/IO/io.h>
 
 namespace CGAL {
 
diff --git a/Triangulation_3/include/CGAL/Triangulation_vertex_base_3.h b/Triangulation_3/include/CGAL/Triangulation_vertex_base_3.h
index 60e11f6233eb..99a589740e26 100644
--- a/Triangulation_3/include/CGAL/Triangulation_vertex_base_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_vertex_base_3.h
@@ -17,6 +17,7 @@
 
 #include <CGAL/basic.h>
 #include <CGAL/Triangulation_ds_vertex_base_3.h>
+#include <CGAL/IO/io.h>
 
 namespace CGAL {
 

From ec8c01a71949726d307240e74099a26fb1a004e4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 20 Jun 2023 10:48:41 +0200
Subject: [PATCH 0382/1398] add missing include

---
 Alpha_shapes_2/include/CGAL/Alpha_shape_vertex_base_2.h | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Alpha_shapes_2/include/CGAL/Alpha_shape_vertex_base_2.h b/Alpha_shapes_2/include/CGAL/Alpha_shape_vertex_base_2.h
index e96dfaa5fcbf..919fec145ec4 100644
--- a/Alpha_shapes_2/include/CGAL/Alpha_shape_vertex_base_2.h
+++ b/Alpha_shapes_2/include/CGAL/Alpha_shape_vertex_base_2.h
@@ -19,6 +19,7 @@
 #include <utility>
 #include <CGAL/Triangulation_vertex_base_2.h>
 #include <CGAL/Alpha_shapes_2/internal/Lazy_alpha_nt_2.h>
+#include <CGAL/Default.h>
 
 //-------------------------------------------------------------------
 namespace CGAL {

From cedad3eee0a2afd339434e65b7884103cd0a502f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 20 Jun 2023 17:34:36 +0200
Subject: [PATCH 0383/1398] remove dependency

---
 Alpha_shapes_2/package_info/Alpha_shapes_2/dependencies | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Alpha_shapes_2/package_info/Alpha_shapes_2/dependencies b/Alpha_shapes_2/package_info/Alpha_shapes_2/dependencies
index eee8e076278c..6c1597376389 100644
--- a/Alpha_shapes_2/package_info/Alpha_shapes_2/dependencies
+++ b/Alpha_shapes_2/package_info/Alpha_shapes_2/dependencies
@@ -2,7 +2,6 @@ Algebraic_foundations
 Alpha_shapes_2
 Arithmetic_kernel
 Cartesian_kernel
-Filtered_kernel
 Hash_map
 Homogeneous_kernel
 Installation

From 76f16d7c3850411dc572d64f387b1cf6407ed800 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 16 Jun 2023 18:57:15 +0200
Subject: [PATCH 0384/1398] use std::get_if, get()->value()  and remove
 CGAL::Object usage in Envelope

changes in arrangement based packages
---
 .../Algebraic_kernel_d/Curve_analysis_2.h     |  12 +-
 .../Curve_pair_analysis_2.h                   |  64 ++--
 .../Algebraic_kernel_d/Status_line_CA_1.h     |   2 +-
 .../CGAL/Arr_batched_point_location.h         |  12 -
 .../CGAL/Arr_landmarks_point_location.h       |   1 -
 .../CGAL/Arr_naive_point_location.h           |   1 -
 .../CGAL/Arr_point_location_result.h          |  24 --
 .../CGAL/Arr_trapezoid_ric_point_location.h   |   1 -
 .../CGAL/Arr_triangulation_point_location.h   |   1 -
 .../CGAL/Arr_walk_along_line_point_location.h |   1 -
 .../Concepts/ArrangementPointLocation_2.h     |  11 -
 .../Concepts/ArrangementVerticalRayShoot_2.h  |  11 -
 .../PackageDescription.txt                    |   3 -
 .../circular_line_arcs.cpp                    |   3 +-
 .../incremental_insertion.cpp                 |   2 +-
 .../point_location_utils.h                    |  28 --
 .../polycurve_bezier.cpp                      |   2 +-
 .../sgm_point_location.cpp                    |   6 +-
 .../include/CGAL/Arr_conic_traits_2.h         |  50 ++--
 .../include/CGAL/Arr_curve_data_traits_2.h    |  10 +-
 .../Arr_geodesic_arc_on_sphere_traits_2.h     |  49 ++--
 .../Arr_geometry_traits/Bezier_x_monotone_2.h |  10 +-
 .../Arr_geometry_traits/Circle_segment_2.h    |  11 +-
 .../include/CGAL/Arr_linear_traits_2.h        |   8 +-
 .../CGAL/Arr_point_location/Td_active_edge.h  |   6 +-
 .../Arr_point_location/Td_active_trapezoid.h  |  16 +-
 .../Trapezoidal_decomposition_2.h             |  12 +-
 .../include/CGAL/Arr_point_location_result.h  |  55 +---
 .../CGAL/Arr_rat_arc/Rational_arc_d_1.h       |   8 +-
 .../include/CGAL/Arr_segment_traits_2.h       |  12 +-
 .../include/CGAL/Arr_simple_point_location.h  |   9 -
 .../Arr_spherical_gaussian_map_3.h            |  20 +-
 .../include/CGAL/Arr_tracing_traits_2.h       |   4 +-
 .../Curved_kernel_via_analysis_2_functors.h   |   4 +-
 .../Point_location_test.h                     |   5 -
 .../Arrangement_on_surface_2/cgal_test.cmake  |  10 -
 .../cgal_test_with_cmake                      |  11 -
 .../Gps_agg_meta_traits.h                     |   7 +-
 .../Gps_simplifier_traits.h                   |   7 +-
 .../Envelope_2/Env_divide_and_conquer_2.h     |  10 +-
 .../Env_divide_and_conquer_2_impl.h           |  10 +-
 Envelope_3/include/CGAL/Env_plane_traits_3.h  |  88 +++---
 Envelope_3/include/CGAL/Env_sphere_traits_3.h |  71 +++--
 .../include/CGAL/Env_tracing_traits_3.h       |  16 +-
 .../include/CGAL/Env_triangle_traits_3.h      | 276 ++++++++----------
 .../Envelope_3/Env_plane_traits_3_functions.h | 136 ++++-----
 .../Envelope_divide_and_conquer_3.h           |  21 +-
 .../Envelope_3/Envelope_element_visitor_3.h   |  69 ++---
 Envelope_3/test/Envelope_3/Envelope_test_3.h  |  29 +-
 .../Envelope_3/Envelope_triangles_test_3.h    |  40 +--
 Installation/CHANGES.md                       |   8 +
 .../Minkowski_sum_2/Arr_labeled_traits_2.h    |  13 +-
 52 files changed, 503 insertions(+), 793 deletions(-)

diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
index ef940f968877..c4a8a3a84cdb 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_analysis_2.h
@@ -631,7 +631,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
             event_coordinates();
             CGAL_assertion(this->ptr()->has_vertical_component);
         }
-        return this->ptr()->has_vertical_component.get();
+        return this->ptr()->has_vertical_component.value();
     }
 
 public:
@@ -1437,7 +1437,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
         if(! this->ptr()->sturm_habicht_of_primitive) {
             compute_sturm_habicht_of_primitive();
         }
-        return this->ptr()->sturm_habicht_of_primitive.get();
+        return this->ptr()->sturm_habicht_of_primitive.value();
     }
 
 public:
@@ -1558,7 +1558,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
         if(! this->ptr()->resultant_of_primitive_and_derivative_y) {
             this->ptr()->resultant_of_primitive_and_derivative_y = stha[0][0];
             if(this->ptr()->resultant_of_primitive_and_derivative_y.
-                   get().is_zero()) {
+                   value().is_zero()) {
                 throw internal::Zero_resultant_exception<Polynomial_2>
                     (polynomial_2());
             }
@@ -1593,7 +1593,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
         if(! this->ptr()->resultant_of_primitive_and_derivative_x) {
             compute_resultant_of_primitive_and_derivative_x();
         }
-        return this->ptr()->resultant_of_primitive_and_derivative_x.get();
+        return this->ptr()->resultant_of_primitive_and_derivative_x.value();
     }
 
 private:
@@ -2111,7 +2111,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
                 compute_horizontal_asymptotes();
             }
             std::vector<Asymptote_y>& asym_info
-                = this->ptr()->horizontal_asymptotes_left.get();
+                = this->ptr()->horizontal_asymptotes_left.value();
             CGAL_precondition(arcno>=0 &&
                               arcno<static_cast<size_type>(asym_info.size()));
             return asym_info[arcno];
@@ -2121,7 +2121,7 @@ class Curve_analysis_2 : public ::CGAL::Handle_with_policy< Rep_ > {
             compute_horizontal_asymptotes();
         }
         std::vector<Asymptote_y>& asym_info
-            = this->ptr()->horizontal_asymptotes_right.get();
+            = this->ptr()->horizontal_asymptotes_right.value();
         CGAL_precondition(arcno>=0 &&
                           arcno<static_cast<size_type>(asym_info.size()));
         return asym_info[arcno];
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
index d350a27a2df8..e3ef4a0f4bc0 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
@@ -547,7 +547,7 @@ class Curve_pair_analysis_2 :
             compute_resultant();
         }
         CGAL_assertion(bool(this->ptr()->resultant));
-        return this->ptr()->resultant.get();
+        return this->ptr()->resultant.value();
     }
 
     std::vector<Algebraic_real_1>& resultant_roots() const {
@@ -555,7 +555,7 @@ class Curve_pair_analysis_2 :
             compute_resultant_roots_with_multiplicities();
         }
         CGAL_assertion(bool(this->ptr()->resultant_roots));
-        return this->ptr()->resultant_roots.get();
+        return this->ptr()->resultant_roots.value();
     }
 
     Algebraic_real_1& resultant_roots(size_type i) const {
@@ -569,7 +569,7 @@ class Curve_pair_analysis_2 :
             compute_resultant_roots_with_multiplicities();
         }
         CGAL_assertion(bool(this->ptr()->multiplicities_of_resultant_roots));
-        return this->ptr()->multiplicities_of_resultant_roots.get();
+        return this->ptr()->multiplicities_of_resultant_roots.value();
     }
 
     size_type multiplicities_of_resultant_roots(size_type i) const {
@@ -586,10 +586,10 @@ class Curve_pair_analysis_2 :
               (kernel(),
                resultant_roots().begin(),
                resultant_roots().end(),
-               std::back_inserter(this->ptr()->stripe_values.get()));
+               std::back_inserter(this->ptr()->stripe_values.value()));
         }
         CGAL_assertion(bool(this->ptr()->stripe_values));
-        return this->ptr()->stripe_values.get();
+        return this->ptr()->stripe_values.value();
     }
 
     std::vector<Algebraic_real_1>& event_x_coordinates() const {
@@ -597,7 +597,7 @@ class Curve_pair_analysis_2 :
             compute_event_x_coordinates_with_event_indices();
         }
         CGAL_assertion(bool(this->ptr()->event_x_coordinates));
-        return this->ptr()->event_x_coordinates.get();
+        return this->ptr()->event_x_coordinates.value();
     }
 
     std::vector<Event_indices>& event_indices() const {
@@ -605,7 +605,7 @@ class Curve_pair_analysis_2 :
             compute_event_x_coordinates_with_event_indices();
         }
         CGAL_assertion(bool(this->ptr()->event_indices));
-        return this->ptr()->event_indices.get();
+        return this->ptr()->event_indices.value();
     }
 
 public:
@@ -633,7 +633,7 @@ class Curve_pair_analysis_2 :
             compute_intermediate_values_and_slices();
         }
         CGAL_assertion(bool(this->ptr()->intermediate_values));
-        return this->ptr()->intermediate_values.get();
+        return this->ptr()->intermediate_values.value();
     }
 
     std::vector<Lazy_status_line_CPA_1>& intermediate_slices() const {
@@ -641,7 +641,7 @@ class Curve_pair_analysis_2 :
             compute_intermediate_values_and_slices();
         }
         CGAL_assertion(bool(this->ptr()->intermediate_slices));
-        return this->ptr()->intermediate_slices.get();
+        return this->ptr()->intermediate_slices.value();
     }
 
 
@@ -652,7 +652,7 @@ class Curve_pair_analysis_2 :
             compute_subresultants();
         }
         CGAL_assertion(bool(this->ptr()->subresultants));
-        return this->ptr()->subresultants.get();
+        return this->ptr()->subresultants.value();
     }
 
     Polynomial_2& subresultants(size_type i) const {
@@ -666,7 +666,7 @@ class Curve_pair_analysis_2 :
             compute_subresultants();
         }
         CGAL_assertion(bool(this->ptr()->principal_subresultants));
-        return this->ptr()->principal_subresultants.get();
+        return this->ptr()->principal_subresultants.value();
     }
 
     Polynomial_1& principal_subresultants(size_type i) const {
@@ -681,7 +681,7 @@ class Curve_pair_analysis_2 :
             compute_subresultants();
         }
         CGAL_assertion(bool(this->ptr()->coprincipal_subresultants));
-        return this->ptr()->coprincipal_subresultants.get();
+        return this->ptr()->coprincipal_subresultants.value();
     }
 
     Polynomial_1& coprincipal_subresultants(size_type i) const {
@@ -1045,7 +1045,7 @@ class Curve_pair_analysis_2 :
 
         }
 
-        return intermediate_slices()[i].valuen();
+        return intermediate_slices()[i].value();
     }
 
     //!  Returns bound representative value at the <tt>i</tt>th interval
@@ -1312,11 +1312,11 @@ void Curve_pair_analysis_2<AlgebraicKernelWithAnalysis_2>::compute_resultant()
         compute_subresultants();
 
         this->ptr()->resultant
-            = this->ptr()->principal_subresultants.get()[0];
+            = this->ptr()->principal_subresultants.value()[0];
     }
 
 
-    if(this->ptr()->resultant.get().is_zero()) {
+    if(this->ptr()->resultant.value().is_zero()) {
         throw CGAL::internal::Zero_resultant_exception<Polynomial_2>
             (this->ptr()->f,
              this->ptr()->g);
@@ -1345,8 +1345,8 @@ compute_resultant_roots_with_multiplicities() const {
     solve_1(resultant(), std::back_inserter(res_pairs));
 
     for(int i=0; i < static_cast<int>(res_pairs.size()); i++ ) {
-        this->ptr()->resultant_roots.get().push_back(res_pairs[i].first);
-        this->ptr()->multiplicities_of_resultant_roots.get()
+        this->ptr()->resultant_roots.value().push_back(res_pairs[i].first);
+        this->ptr()->multiplicities_of_resultant_roots.value()
             .push_back(res_pairs[i].second);
     }
 
@@ -1357,13 +1357,13 @@ compute_resultant_roots_with_multiplicities() const {
 #if CGAL_ACK_DEBUG_FLAG
     for(size_type i = 0;
         i<static_cast<size_type>
-            (this->ptr()->resultant_roots.get().size());
+            (this->ptr()->resultant_roots.value().size());
         i++) {
         CGAL_ACK_DEBUG_PRINT
             << "Root at "
-            << CGAL::to_double(this->ptr()->resultant_roots.get()[i])
+            << CGAL::to_double(this->ptr()->resultant_roots.value()[i])
             << " with multiplicity "
-            << this->ptr()->multiplicities_of_resultant_roots.get()[i]
+            << this->ptr()->multiplicities_of_resultant_roots.value()[i]
             << std::endl;
     }
 #endif
@@ -1401,18 +1401,18 @@ compute_event_x_coordinates_with_event_indices() const {
          one_curve_events.end(),
          resultant_roots().begin(),
          resultant_roots().end(),
-         std::back_inserter(this->ptr()->event_x_coordinates.get()),
+         std::back_inserter(this->ptr()->event_x_coordinates.value()),
          std::back_inserter(events_type),
          compare);
     std::vector<Algebraic_real_1>& events
-        = this->ptr()->event_x_coordinates.get();
+        = this->ptr()->event_x_coordinates.value();
 
     typename std::vector<CGAL::internal::Three_valued>::iterator one_curve_it
         =one_curve_events_type.begin();
     size_type inter_count=0, f_count=0,g_count=0;
     this->ptr()->event_indices = std::vector<Event_indices>();
     std::vector<Event_indices>& event_indices
-        = this->ptr()->event_indices.get();
+        = this->ptr()->event_indices.value();
     for(size_type i=0;i<static_cast<size_type>(events.size());i++) {
 /*
         #if CGAL_ACK_DEBUG_FLAG
@@ -1519,8 +1519,8 @@ compute_intermediate_values_and_slices() const {
     std::size_t size = event_x_coordinates().size()+1;
     this->ptr()->intermediate_values=std::vector<Lazy_bound>();
     this->ptr()->intermediate_slices=std::vector<Lazy_status_line_CPA_1>();
-    this->ptr()->intermediate_values.get().resize(size);
-    this->ptr()->intermediate_slices.get().resize(size);
+    this->ptr()->intermediate_values.value().resize(size);
+    this->ptr()->intermediate_slices.value().resize(size);
 #if CGAL_ACK_DEBUG_FLAG
     CGAL_ACK_DEBUG_PRINT << "done" << std::endl;
 #endif
@@ -1539,25 +1539,25 @@ compute_subresultants() const {
     if(CGAL::degree(f,1)<CGAL::degree(g,1)) {
 #if CGAL_ACK_USE_BEZOUT_MATRIX_FOR_SUBRESULTANTS
         CGAL::internal::bezout_polynomial_subresultants
-            (g,f,std::back_inserter(this->ptr()->subresultants.get()));
+            (g,f,std::back_inserter(this->ptr()->subresultants.value()));
 #else
         typename CGAL::Polynomial_traits_d<Polynomial_2>
             ::Polynomial_subresultants()
-            (g,f,std::back_inserter(this->ptr()->subresultants.get()));
+            (g,f,std::back_inserter(this->ptr()->subresultants.value()));
 #endif
     } else {
 #if CGAL_ACK_USE_BEZOUT_MATRIX_FOR_SUBRESULTANTS
         CGAL::internal::bezout_polynomial_subresultants
-            (f,g,std::back_inserter(this->ptr()->subresultants.get()));
+            (f,g,std::back_inserter(this->ptr()->subresultants.value()));
 #else
         typename CGAL::Polynomial_traits_d<Polynomial_2>
             ::Polynomial_subresultants()
-            (f,g,std::back_inserter(this->ptr()->subresultants.get()));
+            (f,g,std::back_inserter(this->ptr()->subresultants.value()));
 #endif
     }
 
     std::vector<Polynomial_2>& subresultants
-        = this->ptr()->subresultants.get();
+        = this->ptr()->subresultants.value();
 
     size_type n = static_cast<size_type>(subresultants.size());
 
@@ -1584,11 +1584,11 @@ compute_subresultants() const {
     // This must be corrected, if f and g have same degree:
     if(CGAL::degree(f,1) == CGAL::degree(g,1)) {
         if(n>=1) {
-            this->ptr()->principal_subresultants.get()[n-1]
+            this->ptr()->principal_subresultants.value()[n-1]
                 = Polynomial_1(CGAL::leading_coefficient(g));
         }
         if(n>=2) {
-            this->ptr()->coprincipal_subresultants.get()[n-2]
+            this->ptr()->coprincipal_subresultants.value()[n-2]
                 = Polynomial_1(g[CGAL::degree(g,1)-1]);
         }
     }
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CA_1.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CA_1.h
index c1260d26a456..a8ecf22eac1c 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CA_1.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Status_line_CA_1.h
@@ -555,7 +555,7 @@ class Status_line_CA_1
     //! Returns the isolator instance
     Bitstream_descartes& isolator() const {
         CGAL_assertion(bool(this->ptr()->isolator));
-        return this->ptr()->isolator.get();
+        return this->ptr()->isolator.value();
     }
 
     //! Returns whether an isolator has been given for that status line
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_batched_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_batched_point_location.h
index 82c932fca8b2..bafb54b7db7b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_batched_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_batched_point_location.h
@@ -22,19 +22,7 @@ the output sequence.
 `std::pair<Arrangement_2::Point_2, Arr_point_location_result<Arrangement_2>::%Type>`.
 </UL>
 
-\cgalHeading{A Note on Backwards Compatibility}
-This function used to return `CGAL::Object` up to
-\cgal version 4.2. Starting with \cgal version 4.3 the return type
-is determined by the metafunction `CGAL::Arr_point_location_result`.
-To preserve backwards compatibility
-`CGAL::Object` can be constructed from the new return type
-implicitly, but switching to the new style is recommended. To enable
-the old style without any overhead, the macro
-`::CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any
-\cgal header is included.
-
 \sa `CGAL::Arr_point_location_result<Arrangement>`
-\sa `CGAL_ARR_POINT_LOCATION_VERSION`
 
 */
 template<typename Traits, typename Dcel,
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_landmarks_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_landmarks_point_location.h
index 92490f47f2a1..96796cf5213c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_landmarks_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_landmarks_point_location.h
@@ -53,7 +53,6 @@ insertions of curves and not deletions of them.
 \sa `ArrangementPointLocation_2`
 \sa `ArrangementVerticalRayShoot_2`
 \sa `CGAL::Arr_point_location_result<Arrangement>`
-\sa `CGAL_ARR_POINT_LOCATION_VERSION`
 
 */
 template< typename Arrangement, typename Generator >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_naive_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_naive_point_location.h
index 1ef49902c8cf..b79e948e3e79 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_naive_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_naive_point_location.h
@@ -19,7 +19,6 @@ time-consuming process when applied to dense arrangements.
 \sa `ArrangementPointLocation_2`
 \sa `ArrangementVerticalRayShoot_2`
 \sa `CGAL::Arr_point_location_result<Arrangement>`
-\sa `CGAL_ARR_POINT_LOCATION_VERSION`
 
 */
 template< typename Arrangement >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
index 32b4e443326e..ed8cc09f5d06 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
@@ -1,25 +1,4 @@
 /*!
-\ingroup PkgArrangementOnSurface2PointLocation
-
-The macro `CGAL_ARR_POINT_LOCATION_VERSION` can be used to configure
-the point-location query API. In particular, it determines which version
-of the result type of the point-location and vertical ray-shooting queries
-should be used by models of the concepts `ArrangementPointLocation_2`
-and `ArrangementVerticalRayShoot_2`, and by the free function
-`locate`. The `CGAL_ARR_POINT_LOCATION_VERSION` should be defined before any \cgal header
-is included.
-
-- `CGAL_ARR_POINT_LOCATION_VERSION` == 1, the result type is set to be `CGAL::Object`.
-- `CGAL_ARR_POINT_LOCATION_VERSION` == 2, the result type is set to be
-`std::variant<Vertex_const_handle,Halfedge_const_handle,Face_const_handle>`, where `Vertex_const_handle`, `Halfedge_const_handle`, and
-`Face_const_handle` are the corresponding nested types in a `CGAL::Arrangement_2` instance.
-
-
-\sa `ArrangementPointLocation_2`
-\sa `ArrangementVerticalRayShoot_2`
-\sa `CGAL::Arr_point_location_result<Arrangement>`
-*/
-#define CGAL_ARR_POINT_LOCATION_VERSION
 
 namespace CGAL {
 
@@ -37,7 +16,6 @@ or vertical ray-shoot query.
 \sa `CGAL::Arr_walk_along_line_point_location<Arrangement>`
 \sa `CGAL::Arr_landmarks_point_location<Arrangement,Generator>`
 \sa `CGAL::Arr_trapezoid_ric_point_location<Arrangement>`
-\sa `CGAL_ARR_POINT_LOCATION_VERSION`
 */
 template <class Arrangement>
 struct Arr_point_location_result
@@ -45,8 +23,6 @@ struct Arr_point_location_result
   /*! The type of the arrangement feature that is the result of a
    * point-location query or a vertical ray-shoot query, namely,
    * `std::variant<Arrangement::Vertex_const_handle, Arrangement::Halfedge_const_handle, Arrangement::Face_const_handle>`
-   * if `::CGAL_ARR_POINT_LOCATION_VERSION` == 2, which is the default, otherwise
-   * `CGAL::Object`.
    */
   typedef unspecified_type Type;
 }; /* end Arr_point_location_result */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h
index 0027ec53409c..45c0d8c8470f 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h
@@ -32,7 +32,6 @@ This strategy supports arbitrary subdivisions, including unbounded ones.
 \sa `ArrangementPointLocation_2`
 \sa `ArrangementVerticalRayShoot_2`
 \sa `CGAL::Arr_point_location_result<Arrangement>`
-\sa `CGAL_ARR_POINT_LOCATION_VERSION`
 
 */
 template< typename Arrangement >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
index ed9c1e12e3d1..4ad6dfeb8eb7 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
@@ -21,7 +21,6 @@ namespace CGAL {
  * \sa `ArrangementPointLocation_2`
  * \sa `ArrangementVerticalRayShoot_2`
  * \sa `CGAL::Arr_point_location_result<Arrangement>`
- * \sa `CGAL_ARR_POINT_LOCATION_VERSION`
  */
 
 template <typename Arrangement_>
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_walk_along_line_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_walk_along_line_point_location.h
index ed5df33be960..e6141a6779d8 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_walk_along_line_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_walk_along_line_point_location.h
@@ -29,7 +29,6 @@ of issued queries is not large.
 \sa `ArrangementPointLocation_2`
 \sa `ArrangementVerticalRayShoot_2`
 \sa `CGAL::Arr_point_location_result<Arrangement>`
-\sa `CGAL_ARR_POINT_LOCATION_VERSION`
 
 */
 template< typename Arrangement >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
index c2f6a0437f2c..b2fa1c3aae49 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
@@ -10,16 +10,6 @@ containing it. In the general case, the query point is contained inside an
 arrangement face, but in degenerate situations it may lie on an edge or
 coincide with an arrangement vertex.
 
-\cgalHeading{A note on Backwards compatibility}
-The `locate` member function used to return `CGAL::Object` up to
-\cgal version 4.2. Starting with \cgal version 4.3 the return type
-is determined by a metafunction. To preserve backwards compatibility
-`CGAL::Object` can be constructed from the new return types
-implicitly, but switching to the new style is recommended. To enable
-the old style without any overhead, the macro
-`CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any
-\cgal header is included.
-
 \cgalHasModel `CGAL::Arr_naive_point_location<Arrangement>`
 \cgalHasModel `CGAL::Arr_walk_along_line_point_location<Arrangement>`
 \cgalHasModel `CGAL::Arr_trapezoid_ric_point_location<Arrangement>`
@@ -30,7 +20,6 @@ the old style without any overhead, the macro
 \sa `CGAL::Arr_trapezoid_ric_point_location<Arrangement>`
 \sa `CGAL::Arr_landmarks_point_location<Arrangement,Generator>`
 \sa `CGAL::Arr_point_location_result<Arrangement>`
-\sa `CGAL_ARR_POINT_LOCATION_VERSION`
 
 */
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
index 4a1febdc2d23..e676fefcf164 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
@@ -18,16 +18,6 @@ emanating from the query point goes to infinity without hitting any
 arrangement feature on its way. In this case the unbounded face is
 returned.
 
-\cgalHeading{A Note on Backwards Compatibility}
-The `ray_shoot_up` and `ray_shoot_down` member functions used
-to return `CGAL::Object` up to \cgal version 4.2. Starting with
-\cgal version 4.3 the return type is determined by a metafunction. To
-preserve backwards compatibility `CGAL::Object` can be constructed
-from the new return types implicitly, but switching to the new style
-is recommended. To enable the old style without any overhead, the macro
-`CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any
-\cgal header is included.
-
 \cgalHasModel `CGAL::Arr_naive_point_location<Arrangement>`
 \cgalHasModel `CGAL::Arr_walk_along_line_point_location<Arrangement>`
 \cgalHasModel `CGAL::Arr_trapezoid_ric_point_location<Arrangement>`
@@ -38,7 +28,6 @@ is recommended. To enable the old style without any overhead, the macro
 \sa `CGAL::Arr_trapezoid_ric_point_location<Arrangement>`
 \sa `CGAL::Arr_landmarks_point_location<Arrangement,Generator>`
 \sa `CGAL::Arr_point_location_result<Arrangement>`
-\sa `CGAL_ARR_POINT_LOCATION_VERSION`
 */
 
 class ArrangementVerticalRayShoot_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
index 04ce3c47c289..4427a20e151b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
@@ -239,9 +239,6 @@ implemented as peripheral classes or as free (global) functions.
 - `CGAL::Arr_unb_planar_topology_traits_2<GeometryTraits_2,Dcel>`
 - `CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2,Dcel>`
 
-\cgalCRPSection{Macros}
-- \link CGAL_ARR_POINT_LOCATION_VERSION `CGAL_ARR_POINT_LOCATION_VERSION` \endlink
-
 \cgalCRPSection{Functions}
 
 - `CGAL::is_valid()`
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp
index 735403352577..750986dda1eb 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp
@@ -72,7 +72,8 @@ int main() {
   Point_location _pl(arr);
   for (ArcContainer::const_iterator it = ac.begin(); it != ac.end(); ++it) {
     //insert(arr,_pl,*it);
-    insert(arr, *it, _pl);
+    //DONOTCOMMIT
+    //~ insert(arr, *it, _pl);
   };
 
   return 0;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp
index 425b187d17ed..59a0203a4b45 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp
@@ -32,7 +32,7 @@ int main() {
   // the boundary of the face that contains it.
   Point q(4, 1);
   auto obj = pl.locate(q);
-  auto* f = std::get<Arrangement::Face_const_handle>(&obj);
+  auto* f = std::get_if<Arrangement::Face_const_handle>(&obj);
 
   std::cout << "The query point (" << q << ") is located in: ";
   print_face<Arrangement>(*f);
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
index d6c29e08bac7..d5a729edc6d9 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
@@ -4,33 +4,6 @@
 //-----------------------------------------------------------------------------
 // Print the result of a point-location query.
 //
-#if CGAL_ARR_POINT_LOCATION_VERSION < 2
-template <typename Arrangement_>
-void print_point_location(const typename Arrangement_::Point_2& q,
-                          CGAL::Object obj)
-{
-  typedef Arrangement_                                  Arrangement_2;
-  typename Arrangement_2::Vertex_const_handle v;
-  typename Arrangement_2::Halfedge_const_handle e;
-  typename Arrangement_2::Face_const_handle f;
-
-  std::cout << "The point (" << q << ") is located ";
-  if (CGAL::assign(f, obj)) {           // q is located inside a face
-    if (f->is_unbounded())
-      std::cout << "inside the unbounded face." << std::endl;
-    else std::cout << "inside a bounded face." << std::endl;
-  }
-  else if (CGAL::assign(e, obj)) {      // q is located on an edge
-    std::cout << "on an edge: " << e->curve() << std::endl;
-  }
-  else if (CGAL::assign(v, obj)) {      // q is located on a vertex
-    if (v->is_isolated())
-      std::cout << "on an isolated vertex: " << v->point() << std::endl;
-    else std::cout << "on a vertex: " << v->point() << std::endl;
-  }
-  else CGAL_error_msg( "Invalid object.");
-}
-#else
 template <typename Arrangement_>
 void print_point_location
 (const typename Arrangement_::Point_2& q,
@@ -57,7 +30,6 @@ void print_point_location
               << " vertex: " << (*v)->point() << std::endl;
   else CGAL_error_msg("Invalid object.");
 }
-#endif
 
 //-----------------------------------------------------------------------------
 // Perform a point-location query and print the result.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp
index bc4168f2da0e..70184f7f4bb5 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp
@@ -58,7 +58,7 @@ int main() {
     // convert it into x-monotone bezier curve.
     std::vector<Make_x_monotone_result> obj_vector;
     bezier_traits.make_x_monotone_2_object()(B, std::back_inserter(obj_vector));
-    auto* x_seg_p = std::get<Bezier_x_monotone_curve>(&obj_vector[0]);
+    auto* x_seg_p = std::get_if<Bezier_x_monotone_curve>(&obj_vector[0]);
     x_curves.push_back(*x_seg_p);
   }
 
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
index 5cd1a8367c24..98515d5d0c9d 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
@@ -99,15 +99,15 @@ int main() {
   for (auto it = results.begin(); it != results.end(); ++it) {
     std::cout << "The point (" << it->first << ") is located ";
     if (const Face_const_handle* f =
-        std::get<Face_const_handle>(&(it->second)))       // inside a face
+        std::get_if<Face_const_handle>(&(it->second)))       // inside a face
       std::cout << "inside "
                 << (((*f)->is_unbounded()) ? "the unbounded" : "a bounded")
                 << " face.\n";
     else if (const Halfedge_const_handle* e =
-             std::get<Halfedge_const_handle>(&(it->second))) // on an edge
+             std::get_if<Halfedge_const_handle>(&(it->second))) // on an edge
       std::cout << "on an edge: " << (*e)->curve() << std::endl;
     else if (const Vertex_const_handle* v =
-             std::get<Vertex_const_handle>(&(it->second)))  // on a vertex
+             std::get_if<Vertex_const_handle>(&(it->second)))  // on a vertex
       std::cout << "on "
                 << (((*v)->is_isolated()) ? "an isolated" : "a")
                 << " vertex: " << (*v)->point() << std::endl;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
index 2445f06cfa33..462101d028e8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
@@ -862,8 +862,6 @@ class Arr_conic_traits_2 {
      */
     template <typename OutputIterator>
     OutputIterator operator()(const Curve_2& cv, OutputIterator oi) const {
-      typedef std::variant<Point_2, X_monotone_curve_2>
-        Make_x_monotone_result;
 
       auto ctr_xcv = m_traits.construct_x_monotone_curve_2_object();
 
@@ -877,7 +875,7 @@ class Arr_conic_traits_2 {
       auto n_vtan_ps = m_traits.vertical_tangency_points(cv, vtan_ps);
       if (n_vtan_ps == 0) {
         // In case the given curve is already x-monotone:
-        *oi++ = Make_x_monotone_result(ctr_xcv(cv, conic_id));
+        *oi++ = ctr_xcv(cv, conic_id);
         return oi;
       }
 
@@ -889,19 +887,15 @@ class Arr_conic_traits_2 {
         // In case the curve is a full conic, split it into two x-monotone
         // arcs, one going from ps[0] to ps[1], and the other from ps[1] to
         // ps[0].
-        *oi++ = Make_x_monotone_result(ctr_xcv(cv, vtan_ps[0], vtan_ps[1],
-                                               conic_id));
-        *oi++ = Make_x_monotone_result(ctr_xcv(cv, vtan_ps[1], vtan_ps[0],
-                                               conic_id));
+        *oi++ = ctr_xcv(cv, vtan_ps[0], vtan_ps[1], conic_id);
+        *oi++ = ctr_xcv(cv, vtan_ps[1], vtan_ps[0], conic_id);
       }
       else {
         if (n_vtan_ps == 1) {
           // Split the arc into two x-monotone sub-curves: one going from the
           // arc source to ps[0], and the other from ps[0] to the target.
-          *oi++ = Make_x_monotone_result(ctr_xcv(cv, cv.source(), vtan_ps[0],
-                                                 conic_id));
-          *oi++ = Make_x_monotone_result(ctr_xcv(cv, vtan_ps[0], cv.target(),
-                                                 conic_id));
+          *oi++ = ctr_xcv(cv, cv.source(), vtan_ps[0], conic_id);
+          *oi++ = ctr_xcv(cv, vtan_ps[0], cv.target(), conic_id);
         }
         else {
           CGAL_assertion(n_vtan_ps == 2);
@@ -931,16 +925,16 @@ class Arr_conic_traits_2 {
           }
 
           // Split the arc into three x-monotone sub-curves.
-          *oi++ = Make_x_monotone_result(ctr_xcv(cv, cv.source(),
-                                                 vtan_ps[ind_first],
-                                                 conic_id));
+          *oi++ = ctr_xcv(cv, cv.source(),
+                          vtan_ps[ind_first],
+                          conic_id);
 
-          *oi++ = Make_x_monotone_result(ctr_xcv(cv, vtan_ps[ind_first],
-                                                 vtan_ps[ind_second],
-                                                 conic_id));
+          *oi++ = ctr_xcv(cv, vtan_ps[ind_first],
+                          vtan_ps[ind_second],
+                          conic_id);
 
-          *oi++ = Make_x_monotone_result(ctr_xcv(cv, vtan_ps[ind_second],
-                                                 cv.target(), conic_id));
+          *oi++ = ctr_xcv(cv, vtan_ps[ind_second],
+                          cv.target(), conic_id);
         }
       }
 
@@ -1314,17 +1308,15 @@ class Arr_conic_traits_2 {
     OutputIterator intersect(const X_monotone_curve_2& xcv1,
                              const X_monotone_curve_2& xcv2,
                              Intersection_map& inter_map,
-                             OutputIterator oi) const {
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-        Intersection_result;
-
+                             OutputIterator oi) const
+    {
       if (m_traits.has_same_supporting_conic(xcv1, xcv2)) {
         // Check for overlaps between the two arcs.
         X_monotone_curve_2 overlap;
 
         if (compute_overlap(xcv1, xcv2, overlap)) {
           // There can be just a single overlap between two x-monotone arcs:
-          *oi++ = Intersection_result(overlap);
+          *oi++ = overlap;
           return oi;
         }
 
@@ -1337,22 +1329,22 @@ class Arr_conic_traits_2 {
         auto eq = alg_kernel->equal_2_object();
         if (eq(xcv1.left(), xcv2.left())) {
           Intersection_point ip(xcv1.left(), 0);
-          *oi++ = Intersection_result(ip);
+          *oi++ = ip;
         }
 
         if (eq(xcv1.right(), xcv2.right())) {
           Intersection_point ip(xcv1.right(), 0);
-          *oi++ = Intersection_result(ip);
+          *oi++ = ip;
         }
 
         if (eq(xcv1.left(), xcv2.right())) {
           Intersection_point ip(xcv1.left(), 0);
-          *oi++ = Intersection_result(ip);
+          *oi++ = ip;
         }
 
         if (eq(xcv1.right(), xcv2.left())) {
           Intersection_point ip(xcv1.right(), 0);
-          *oi++ = Intersection_result(ip);
+          *oi++ = ip;
         }
 
         return oi;
@@ -1395,7 +1387,7 @@ class Arr_conic_traits_2 {
         if (m_traits.is_between_endpoints(xcv1, (*iter).first) &&
             m_traits.is_between_endpoints(xcv2, (*iter).first))
         {
-          *oi++ = Intersection_result(*iter);
+          *oi++ = *iter;
         }
       }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
index e8bb9a707035..d0a68b2885ba 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
@@ -208,8 +208,6 @@ class Arr_curve_data_traits_2 : public Traits_ {
                               OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
       typedef std::variant<Intersection_point, Base_x_monotone_curve_2>
         Intersection_base_result;
 
@@ -223,19 +221,19 @@ class Arr_curve_data_traits_2 : public Traits_ {
       // Go over all intersection objects and prepare the output.
       for (const auto& item : base_objects) {
         const Base_x_monotone_curve_2* base_cv =
-          std::get<Base_x_monotone_curve_2>(&item);
+          std::get_if<Base_x_monotone_curve_2>(&item);
         if (base_cv != nullptr) {
           // The current intersection object is an overlapping x-monotone
           // curve: Merge the data fields of both intersecting curves and
           // associate the result with the overlapping curve.
           X_monotone_curve_2 cv(*base_cv, Merge()(cv1.data(), cv2.data()));
-          *oi++ = Intersection_result(cv);
+          *oi++ = cv;
           continue;
         }
         // The current intersection object is an intersection point:
         // Copy it as is.
-        const Intersection_point* ip = std::get<Intersection_point>(&item);
-        *oi++ = Intersection_result(*ip);
+        const Intersection_point* ip = std::get_if<Intersection_point>(&item);
+        *oi++ = *ip;
       }
 
       return oi;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
index 5c07971538e3..7d94b289992d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
@@ -2321,8 +2321,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
                                         OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
+
       const Kernel& kernel = m_traits;
       typename Kernel::Equal_2 equal = kernel.equal_2_object();
 
@@ -2337,14 +2336,14 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       if (equal(l1, r1)) {
         bool is_full = equal(l2, r2);
         X_monotone_curve_2 xc(l2_3, r2_3, normal, vertical, true, is_full);
-        *oi++ = Intersection_result(xc);
+        *oi++ = xc;
         return oi;
       }
 
       if (equal(l2, r2)) {
         CGAL_assertion(! equal(l1, r1));        // already handled above
         X_monotone_curve_2 xc(l1_3, r1_3, normal, vertical, true);
-        *oi++ = Intersection_result(xc);
+        *oi++ = xc;
         return oi;
       }
 
@@ -2358,19 +2357,19 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
         // 5. l1 = r2 < r1 < l2 = l1 | One overlap (handled above)
         if (in_between(r1, r2, l2)) {
           // Case 1.
-          *oi++ = Intersection_result(Intersection_point(l1_3, 1));
+          *oi++ = Intersection_point(l1_3, 1);
           return oi;
         }
         if (equal(r1, l2)) {
           // Case 2.
-          *oi++ = Intersection_result(Intersection_point(l1_3, 1));
-          *oi++ = Intersection_result(Intersection_point(l2_3, 1));
+          *oi++ = Intersection_point(l1_3, 1);
+          *oi++ = Intersection_point(l2_3, 1);
           return oi;
         }
         CGAL_assertion(in_between(r1, l2, r2));
         // Case 3.
         X_monotone_curve_2 xc(l2_3, r1_3, normal, vertical, true);
-        *oi++ = Intersection_result(xc);
+        *oi++ = xc;
         return oi;
       }
 
@@ -2383,12 +2382,12 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
         // 5. l1 < l1 = r1 = l2 < r2 | One overlap (handled above)
         if (in_between(r2, r1, l1)) {
           // Case 1.
-          *oi++ = Intersection_result(Intersection_point(l2_3, 1));
+          *oi++ = Intersection_point(l2_3, 1);
           return oi;
         }
         // Case 3.
         X_monotone_curve_2 xc(l1_3, r2_3, normal, vertical, true);
-        *oi++ = Intersection_result(xc);
+        *oi++ = xc;
         return oi;
       }
 
@@ -2400,13 +2399,13 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
         if (in_between(r1, l2, r2) || equal(r1, r2)) {
           // Cases 1 & 2
           X_monotone_curve_2 xc(l1_3, r1_3, normal, vertical, true);
-          *oi++ = Intersection_result(xc);
+          *oi++ = xc;
           return oi;
         }
         // Case 3
         CGAL_assertion(in_between(r2, l2, r1));
         X_monotone_curve_2 xc(l2_3, r2_3, normal, vertical, true);
-        *oi++ = Intersection_result(xc);
+        *oi++ = xc;
         return oi;
       }
 
@@ -2418,13 +2417,13 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
         if (in_between(l1, r2, l2)) {
           // Cases 1
           X_monotone_curve_2 xc(l2_3, r2_3, normal, vertical, true);
-          *oi++ = Intersection_result(xc);
+          *oi++ = xc;
           return oi;
         }
         // Case 3
         CGAL_assertion(in_between(l1, l2, l2));
         X_monotone_curve_2 xc(l1_3, r1_3, normal, vertical, true);
-        *oi++ = Intersection_result(xc);
+        *oi++ = xc;
         return oi;
       }
 
@@ -2442,12 +2441,12 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
         if (in_between(l2, r2, l1)) {
           // Case 2
           X_monotone_curve_2 xc(l1_3, r1_3, normal, vertical, true);
-          *oi++ = Intersection_result(xc);
+          *oi++ = xc;
           return oi;
         }
         // Case 3
         X_monotone_curve_2 xc(l2_3, r1_3, normal, vertical, true);
-        *oi++ = Intersection_result(xc);
+        *oi++ = xc;
         return oi;
       }
 
@@ -2457,12 +2456,12 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       // Case 4
       if (in_between(l1, r1, l2)) {
         X_monotone_curve_2 xc(l2_3, r2_3, normal, vertical, true);
-        *oi++ = Intersection_result(xc);
+        *oi++ = xc;
         return oi;
       }
       // Case 5
       X_monotone_curve_2 xc(l1_3, r2_3, normal, vertical, true);
-      *oi++ = Intersection_result(xc);
+      *oi++ = xc;
       return oi;
     }
 
@@ -2560,8 +2559,6 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       typedef typename Kernel::Equal_3                  Equal_3;
 
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
 
       const Kernel& kernel = m_traits;
 
@@ -2584,9 +2581,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
               (res && (xc1.is_directed_right() != xc2.is_directed_right())))
           {
             if (xc1.left().is_min_boundary() && xc2.left().is_min_boundary())
-              *oi++ = Intersection_result(Intersection_point(xc1.left(), 1));
+              *oi++ = Intersection_point(xc1.left(), 1);
             if (xc1.right().is_max_boundary() && xc2.right().is_max_boundary())
-              *oi++ = Intersection_result(Intersection_point(xc1.right(), 1));
+              *oi++ = Intersection_point(xc1.right(), 1);
             return oi;
           }
 
@@ -2594,11 +2591,11 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
            * the other arc is completely overlapping.
            */
           if (xc1.left().is_min_boundary() && xc1.right().is_max_boundary()) {
-            *oi++ = Intersection_result(xc2);
+            *oi++ = xc2;
             return oi;
           }
           if (xc2.left().is_min_boundary() && xc2.right().is_max_boundary()) {
-            *oi++ = Intersection_result(xc1);
+            *oi++ = xc1;
             return oi;
           }
           /*! Find an endpoint that does not coincide with a pole, and project
@@ -2646,12 +2643,12 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       // Observe that xc1 and xc2 may share two endpoints.
       Point_2 ed = m_traits.construct_point_2_object()(v.direction());
       if (is_in_between(ed, xc1) && is_in_between(ed, xc2))
-        *oi++ = Intersection_result(Intersection_point(ed, 1));
+        *oi++ = Intersection_point(ed, 1);
 
       Vector_3 vo(kernel.construct_opposite_vector_3_object()(v));
       Point_2 edo = m_traits.construct_point_2_object()(vo.direction());
       if (is_in_between(edo, xc1) && is_in_between(edo, xc2))
-        *oi++ = Intersection_result(Intersection_point(edo, 1));
+        *oi++ = Intersection_point(edo, 1);
 
       return oi;
     }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_x_monotone_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_x_monotone_2.h
index 12f3f3a7c66d..f8589b2953b6 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_x_monotone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Bezier_x_monotone_2.h
@@ -318,13 +318,11 @@ class _Bezier_x_monotone_2
                            Bezier_cache& cache,
                            OutputIterator oi) const
   {
-    typedef std::variant<Intersection_point, Self>    Intersection_result;
-
     // In case we have two x-monotone subcurves of the same Bezier curve,
     // check if they have a common left endpoint.
     if (_curve.is_same(cv._curve)) {
       if (left().is_same(cv.left()) || left().is_same(cv.right()))
-        *oi++ = Intersection_result(Intersection_point(left(), 0));
+        *oi++ = Intersection_point(left(), 0);
     }
 
     // Compute the intersections of the two sucurves. Note that for caching
@@ -341,7 +339,7 @@ class _Bezier_x_monotone_2
 
     // In case of overlap, just report the overlapping subcurve.
     if (do_ovlp) {
-      *oi++ = Intersection_result(ovlp_cv);
+      *oi++ = ovlp_cv;
       return oi;
     }
 
@@ -349,14 +347,14 @@ class _Bezier_x_monotone_2
     // xy-lexicorgraphical order, and insert them to the output iterator.
     std::sort(ipts.begin(), ipts.end(), Less_intersection_point(cache));
     for (auto ip_it = ipts.begin(); ip_it != ipts.end(); ++ip_it) {
-      *oi++ = Intersection_result(*ip_it);
+      *oi++ = *ip_it;
     }
 
     // In case we have two x-monotone subcurves of the same Bezier curve,
     // check if they have a common right endpoint.
     if (_curve.is_same(cv._curve)) {
       if (right().is_same(cv.left()) || right().is_same(cv.right())) {
-        *oi++ = Intersection_result(Intersection_point(right(), 0));
+        *oi++ = Intersection_point(right(), 0);
       }
     }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Circle_segment_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Circle_segment_2.h
index 051390155d5b..f46489ba9690 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Circle_segment_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geometry_traits/Circle_segment_2.h
@@ -995,9 +995,6 @@ class _X_monotone_circle_segment_2 {
   OutputIterator intersect(const Self& cv, OutputIterator oi,
                            Intersection_map* inter_map = nullptr) const
   {
-    typedef std::pair<Point_2, Multiplicity>            Intersection_point;
-    typedef std::variant<Intersection_point, Self>    Intersection_result;
-
     // First check whether the two arcs have the same supporting curve.
     if (has_same_supporting_curve(cv)) {
       // Check for overlaps between the two arcs.
@@ -1005,7 +1002,7 @@ class _X_monotone_circle_segment_2 {
 
       if (_compute_overlap(cv, overlap)) {
         // There can be just a single overlap between two x-monotone arcs:
-        *oi++ = Intersection_result(overlap);
+        *oi++ = overlap;
         return oi;
       }
 
@@ -1016,11 +1013,11 @@ class _X_monotone_circle_segment_2 {
       // intersection points we report.
       Multiplicity mult = 0;
       if (left().equals(cv.left()) || left().equals(cv.right())) {
-        *oi++ = Intersection_result(std::make_pair(left(), mult));
+        *oi++ = std::make_pair(left(), mult);
       }
 
       if (right().equals(cv.right()) || right().equals(cv.left())) {
-        *oi++ = Intersection_result(std::make_pair(right(), mult));
+        *oi++ = std::make_pair(right(), mult);
       }
 
       return oi;
@@ -1072,7 +1069,7 @@ class _X_monotone_circle_segment_2 {
       if (this->_is_between_endpoints (iter->first) &&
           cv._is_between_endpoints (iter->first))
       {
-        *oi++ = Intersection_result(*iter);
+        *oi++ = *iter;
       }
     }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h
index ef830934d74b..f712190f0df0 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_linear_traits_2.h
@@ -1326,8 +1326,6 @@ class Arr_linear_traits_2 : public Kernel_ {
                               OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
 
       CGAL_precondition(! cv1.is_degenerate());
       CGAL_precondition(! cv2.is_degenerate());
@@ -1354,7 +1352,7 @@ class Arr_linear_traits_2 : public Kernel_ {
             // Create a pair representing the point with its multiplicity,
             // which is always 1 for line segments.
             Intersection_point ip_mult(*ip, 1);
-            *oi++ = Intersection_result(ip_mult);
+            *oi++ = ip_mult;
           }
         }
         return oi;
@@ -1398,14 +1396,14 @@ class Arr_linear_traits_2 : public Kernel_ {
 
       if (cmp_res == SMALLER) {
         // We have discovered a true overlapping subcurve:
-        *oi++ = Intersection_result(ovlp);
+        *oi++ = ovlp;
       }
       else if (cmp_res == EQUAL) {
         // The two objects have the same supporting line, but they just share
         // a common endpoint. Thus we have an intersection point, but we leave
         // the multiplicity of this point undefined.
         Intersection_point ip_mult(ovlp.left(), 0);
-        *oi++ = Intersection_result(ip_mult);
+        *oi++ = ip_mult;
       }
 
       return oi;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
index b026673d4a6b..c1a177e5ab62 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
@@ -145,13 +145,13 @@ class Td_active_edge : public Handle
   //Dag_node* m_dag_node; //pointer to the search structure (DAG) node
 
   /*! Initialize the trapezoid's neighbors. */
-  inline void init_neighbors(std::optional<Td_map_item&> next)
+  inline void init_neighbors(std::optional<std::reference_wrapper<Td_map_item>> next)
   {
     set_next((next) ? *next : Td_map_item(0));
   }
   /*! \copydoc init_neighbors
    *  \deprecated please use #init_neighbors */
-  CGAL_DEPRECATED inline void init_neighbours(std::optional<Td_map_item&> next)
+  CGAL_DEPRECATED inline void init_neighbours(std::optional<std::reference_wrapper<Td_map_item>> next)
   { init_neighbors(next); }
 
   /*! Set the DAG node. */
@@ -199,7 +199,7 @@ class Td_active_edge : public Handle
    /*! Constructor given Vertex & Halfedge handles. */
   Td_active_edge (Halfedge_const_handle he ,
                   Dag_node* node = 0,
-                  std::optional<Td_map_item&> next = std::nullopt)
+                  std::optional<std::reference_wrapper<Td_map_item>> next = std::nullopt)
   {
 
     PTR = new Data(he, (next) ? *next : Td_map_item(0), node);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
index d8a775c41793..f226db992d9c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
@@ -163,8 +163,8 @@ class Td_active_trapezoid : public Handle
   //Dag_node* m_dag_node; //pointer to the search structure (DAG) node
 
   /*! Initialize the trapezoid's neighbors. */
-   inline void init_neighbors(std::optional<Td_map_item&> lb, std::optional<Td_map_item&> lt,
-                              std::optional<Td_map_item&> rb, std::optional<Td_map_item&> rt)
+   inline void init_neighbors(std::optional<std::reference_wrapper<Td_map_item>> lb, std::optional<std::reference_wrapper<Td_map_item>> lt,
+                              std::optional<std::reference_wrapper<Td_map_item>> rb, std::optional<std::reference_wrapper<Td_map_item>> rt)
   {
     set_lb((lb) ? *lb : Td_map_item(0));
     set_lt((lt) ? *lt : Td_map_item(0));
@@ -173,8 +173,8 @@ class Td_active_trapezoid : public Handle
   }
   /*! \copydoc init_neighbors
    *  \deprecated please use #init_neighbors */
-   CGAL_DEPRECATED inline void init_neighbours(std::optional<Td_map_item&> lb, std::optional<Td_map_item&> lt,
-                                               std::optional<Td_map_item&> rb, std::optional<Td_map_item&> rt)
+   CGAL_DEPRECATED inline void init_neighbours(std::optional<std::reference_wrapper<Td_map_item>> lb, std::optional<std::reference_wrapper<Td_map_item>> lt,
+                                               std::optional<std::reference_wrapper<Td_map_item>> rb, std::optional<std::reference_wrapper<Td_map_item>> rt)
   { init_neighbors(lb, lt, rb, rt); }
 
   /*! Set the DAG node. */
@@ -267,10 +267,10 @@ class Td_active_trapezoid : public Handle
   /*! Constructor given Vertex & Halfedge handles. */
   Td_active_trapezoid (Vertex_const_handle l, Vertex_const_handle r,
                   Halfedge_const_handle b, Halfedge_const_handle t,
-                  std::optional<Td_map_item&> lb = std::nullopt,
-                  std::optional<Td_map_item&> lt = std::nullopt,
-                  std::optional<Td_map_item&> rb = std::nullopt,
-                  std::optional<Td_map_item&> rt = std::nullopt,
+                  std::optional<std::reference_wrapper<Td_map_item>> lb = std::nullopt,
+                  std::optional<std::reference_wrapper<Td_map_item>> lt = std::nullopt,
+                  std::optional<std::reference_wrapper<Td_map_item>> rb = std::nullopt,
+                  std::optional<std::reference_wrapper<Td_map_item>> rt = std::nullopt,
                   Dag_node* node = 0)
   {
     PTR = new Data (l, r, b, t, (lb) ? *lb : Td_map_item(0), (lt) ? *lt : Td_map_item(0),
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
index 3888b097bb8b..e461b86a4432 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
@@ -272,7 +272,7 @@ class Trapezoidal_decomposition_2
     Base_map_item_iterator() : traits(0), m_cur_item(Td_map_item(0)){ }
 
     Base_map_item_iterator(const Traits* traits_,
-                           std::optional<Td_map_item&> curr = std::nullopt)
+                           std::optional<std::reference_wrapper<Td_map_item>> curr = std::nullopt)
       :traits(traits_), m_cur_item((curr) ? *curr : Td_map_item(0) ) { }
 
     Base_map_item_iterator(const Base_map_item_iterator &it)
@@ -332,12 +332,12 @@ class Trapezoidal_decomposition_2
   public:
     //constructors
     In_face_iterator(const Traits* traits_, Halfedge_const_handle sep,
-                     std::optional<Td_map_item&> curr = std::nullopt)
+                     std::optional<std::reference_wrapper<Td_map_item>> curr = std::nullopt)
             :Base_map_item_iterator(traits_,curr), m_sep(sep->curve())
     { }
 
     In_face_iterator(const Traits* traits_, const X_monotone_curve_2& sep,
-                     std::optional<Td_map_item&> curr = std::nullopt)
+                     std::optional<std::reference_wrapper<Td_map_item>> curr = std::nullopt)
             :Base_map_item_iterator(traits_,curr), m_sep(sep)
     { }
 
@@ -879,20 +879,20 @@ class Trapezoidal_decomposition_2
   class cv_for_edge_visitor
   {
   public:
-    std::optional<const X_monotone_curve_2&>
+    std::optional<std::reference_wrapper<const X_monotone_curve_2>>
     operator()(Td_active_edge& t) const
     {
       return t.halfedge()->curve();
     }
 
-    std::optional<const X_monotone_curve_2&>
+    std::optional<std::reference_wrapper<const X_monotone_curve_2>>
     operator()(Td_inactive_edge& t) const
     {
       return t.curve();
     }
 
     template <typename T>
-    std::optional<const X_monotone_curve_2&> operator()(T& /* t */) const
+    std::optional<std::reference_wrapper<const X_monotone_curve_2>> operator()(T& /* t */) const
     {
       CGAL_assertion(false);
       return std::nullopt;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
index 15320d02bcdb..4651b64c4dd6 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
@@ -16,41 +16,9 @@
 
 #include <CGAL/disable_warnings.h>
 
-// The macro CGAL_ARR_POINT_LOCATION_VERSION controls which version of the
-// point location is used. Currently two values are supported:
-// 1. Point location with CGAL::Object
-// 2. Point location with std::optional<std::variant<...> >
-// The default value is 2.
-
-#if !defined(CGAL_ARR_POINT_LOCATION_VERSION)
-#define CGAL_ARR_POINT_LOCATION_VERSION 2
-#endif
-
-#include <CGAL/Object.h>
-
 #include <optional>
 #include <variant>
 
-#ifdef CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-#if CGAL_ARR_POINT_LOCATION_VERSION > 1
-#include <CGAL/Arrangement_2/Arrangement_2_iterators.h>
-// workaround for this bug:
-// https://svn.boost.org/trac/boost/ticket/2839
-namespace boost{ namespace detail { namespace variant {
-
-template <class CI, class F, class MI, class V, class D, class C>
-inline void move_swap(
-  ::CGAL::I_Filtered_const_iterator<CI, F, MI, V, D, C>& lhs,
-  ::CGAL::I_Filtered_const_iterator<CI, F, MI,  V, D, C>& rhs)
-{
-    ::CGAL::I_Filtered_const_iterator<CI, F, MI, V, D, C> tmp( boost::detail::variant::move(lhs) );
-    lhs = boost::detail::variant::move(rhs);
-    rhs = boost::detail::variant::move(tmp);
-}
-} } }
-#endif
-#endif
-
 namespace CGAL {
 
 template <typename Arrangement_>
@@ -61,34 +29,16 @@ struct Arr_point_location_result {
   typedef typename Arrangement_2::Halfedge_const_handle  Halfedge_const_handle;
   typedef typename Arrangement_2::Face_const_handle      Face_const_handle;
 
-#if CGAL_ARR_POINT_LOCATION_VERSION < 2
-  typedef CGAL::Object                                   Type;
-#else
   typedef typename std::variant<Vertex_const_handle,
                                   Halfedge_const_handle,
                                   Face_const_handle>     Type;
-#endif
   typedef Type                                           type;
 
-  // This function returns either make_object() or a result_type constructor
-  // to generate return values. The Object version takes a dummy template
-  // argument, which is needed for the return of the other option, e.g.,
-  // std::optional<std::variant> >.
+  // This function returns a result_type constructor
+  // to generate return values.
   // In theory a one parameter variant could be returned, but this _could_
   // lead to conversion overhead, and so we rather go for the real type.
   // Overloads for empty returns are also provided.
-#if CGAL_ARR_POINT_LOCATION_VERSION < 2
-  template <typename T>
-  static
-  inline Type make_result(T t) { return CGAL::make_object(t); }
-
-  static
-  inline CGAL::Object empty_optional_result() { return CGAL::Object(); }
-
-  template <typename T>
-  static
-  inline const T* assign(const Type* obj) { return CGAL::object_cast<T>(obj); }
-#else
   template <typename T>
   static
   inline Type make_result(T t) { return Type(t); }
@@ -100,7 +50,6 @@ struct Arr_point_location_result {
   template <typename T>
   static
   inline const T* assign(const Type* obj) { return std::get_if<T>(obj); }
-#endif // CGAL_ARR_POINT_LOCATION_VERSION < 2
 
   //this one is only to remove warnings in functions
   static
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
index bb418c5d87ba..345d9d89caf8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
@@ -2047,7 +2047,7 @@ class Continuous_rational_arc_d_1:
 
     if (this->equals(arc)) {
       Self overlap_arc(*this);
-      *oi++ = Intersection_result(overlap_arc);
+      *oi++ = overlap_arc;
       return oi;
     }
 
@@ -2170,7 +2170,7 @@ class Continuous_rational_arc_d_1:
               (this->SRC_AT_Y_MINUS_INFTY | this->SRC_AT_Y_PLUS_INFTY) == 0)
           {
             Intersection_point ip(p_left, 0);
-            *oi++ = Intersection_result(ip);
+            *oi++ = ip;
           }
 
           return oi;
@@ -2189,7 +2189,7 @@ class Continuous_rational_arc_d_1:
                            this->IS_DIRECTED_RIGHT | this->IS_CONTINUOUS |
                            this->IS_VALID);
 
-      *oi++ = Intersection_result(overlap_arc);
+      *oi++ = overlap_arc;
       return oi;
     }
 
@@ -2221,7 +2221,7 @@ class Continuous_rational_arc_d_1:
         Algebraic_point_2 p(this->_f, *x_iter);
         // Output the intersection point:
         Intersection_point ip(p, *m_iter);
-        *oi++ = Intersection_result(ip);
+        *oi++ = ip;
       }
     }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h
index 15a3cffe63d8..b080305c6f8f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_segment_traits_2.h
@@ -706,8 +706,6 @@ class Arr_segment_traits_2 : public Kernel_ {
                               OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
 
       // Early ending with Bbox overlapping test
       if (! do_bboxes_overlap(cv1, cv2)) return oi;
@@ -733,7 +731,7 @@ class Arr_segment_traits_2 : public Kernel_ {
                        m_traits.is_in_y_range_2_object()(cv2, *ip) :
                        m_traits.is_in_x_range_2_object()(cv2, *ip));
         Intersection_point ip_mult(*ip, 1);
-        *oi++ = Intersection_result(ip_mult);
+        *oi++ = ip_mult;
         return oi;
       }
 
@@ -754,7 +752,7 @@ class Arr_segment_traits_2 : public Kernel_ {
         // a common endpoint. Thus we have an intersection point, but we leave
         // the multiplicity of this point undefined.
         Intersection_point ip_mult(p_r, 0);
-        *oi++ = Intersection_result(ip_mult);
+        *oi++ = ip_mult;
         return oi;
       }
 
@@ -765,17 +763,17 @@ class Arr_segment_traits_2 : public Kernel_ {
         // in the overlap segment
         if (cv1.is_directed_right()) {
           X_monotone_curve_2 overlap_seg(cv1.line(), p_l, p_r);
-          *oi++ = Intersection_result(overlap_seg);
+          *oi++ = overlap_seg;
           return oi;
         }
         X_monotone_curve_2 overlap_seg(cv1.line(), p_r, p_l);
-        *oi++ = Intersection_result(overlap_seg);
+        *oi++ = overlap_seg;
         return oi;
       }
       // cv1 and cv2 have opposite directions, the overlap segment
       // will be directed from left to right
       X_monotone_curve_2 overlap_seg(cv1.line(), p_l, p_r);
-      *oi++ = Intersection_result(overlap_seg);
+      *oi++ = overlap_seg;
       return oi;
     }
   };
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_simple_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_simple_point_location.h
index efdaa8d65d9b..ab14028c0805 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_simple_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_simple_point_location.h
@@ -57,11 +57,7 @@ class Arr_simple_point_location {
   typedef Result_type                                    result_type;
 
 protected:
-#if CGAL_ARR_POINT_LOCATION_VERSION < 2
-  typedef Result_type                                    Optional_result_type;
-#else
   typedef typename std::optional<Result_type>          Optional_result_type;
-#endif
 
   typedef typename Topology_traits::Dcel                 Dcel;
   typedef Arr_traits_basic_adaptor_2<Geometry_traits_2>  Traits_adaptor_2;
@@ -71,13 +67,8 @@ class Arr_simple_point_location {
   const Traits_adaptor_2* m_geom_traits;    // Its associated geometry traits.
   const Topology_traits*  m_topol_traits;   // Its associated topology traits.
 
-#if CGAL_ARR_POINT_LOCATION_VERSION < 2
-  inline bool optional_empty(const CGAL::Object& obj) const { return obj.empty(); }
-  inline const Result_type& optional_assign(const CGAL::Object& t) const { return t; }
-#else
   inline bool optional_empty(const std::optional<Result_type>& t) const { return (!t); }
   inline const Result_type& optional_assign(const std::optional<Result_type>& t) const { return *t; }
-#endif
 
   template<typename T>
   Result_type make_result(T t) const { return Result::make_result(t); }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_spherical_gaussian_map_3.h b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_spherical_gaussian_map_3.h
index a042f80a5845..f9f587347382 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_spherical_gaussian_map_3.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_spherical_gaussian_map_3/Arr_spherical_gaussian_map_3.h
@@ -161,7 +161,7 @@ class Arr_sgm_initializer {
     make_x_monotone(normal1, normal2, std::back_inserter(x_objects));
 
     auto it = x_objects.begin();
-    const auto* xc = std::get<X_monotone_curve_2>(&(*it));
+    const auto* xc = std::get_if<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "1.a. insert_in_face_interior(" << *xc << ")" << std::endl;
 #endif
@@ -172,7 +172,7 @@ class Arr_sgm_initializer {
     ++it;
     if (it == x_objects.end()) return oi;
 
-    xc = std::get<X_monotone_curve_2>(&(*it));
+    xc = std::get_if<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "1.b. insert_from_vertex(" << *xc << ")" << std::endl;
 #endif
@@ -202,7 +202,7 @@ class Arr_sgm_initializer {
     make_x_monotone(normal1, normal2, std::back_inserter(x_objects));
 
     auto it = x_objects.begin();
-    const auto* xc = std::get<X_monotone_curve_2>(&(*it));
+    const auto* xc = std::get_if<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "2.a. insert_from_vertex(" << *xc << ", "
               << vertex1->point() << ")" << std::endl;
@@ -216,7 +216,7 @@ class Arr_sgm_initializer {
     ++it;
     if (it == x_objects.end()) return oi;
 
-    xc = std::get<X_monotone_curve_2>(&(*it));
+    xc = std::get_if<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "2.b. insert_from_vertex(" << *xc << ")" << std::endl;
 #endif
@@ -247,7 +247,7 @@ class Arr_sgm_initializer {
 
     auto it = x_objects.begin();
     if (x_objects.size() == 1) {
-      const auto* xc = std::get<X_monotone_curve_2>(&(*it));
+      const auto* xc = std::get_if<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
       std::cout << "3. insert_from_vertex(" << *xc << ")" << std::endl;
 #endif
@@ -258,8 +258,8 @@ class Arr_sgm_initializer {
       return oi;
     }
 
-    const X_monotone_curve_2* xc1 = std::get<X_monotone_curve_2>(&(*it++));
-    const X_monotone_curve_2* xc2 = std::get<X_monotone_curve_2>(&(*it));
+    const X_monotone_curve_2* xc1 = std::get_if<X_monotone_curve_2>(&(*it++));
+    const X_monotone_curve_2* xc2 = std::get_if<X_monotone_curve_2>(&(*it));
 
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "3.a. insert_from_vertex(" << *xc2 << ")" << std::endl;
@@ -300,7 +300,7 @@ class Arr_sgm_initializer {
     make_x_monotone(normal1, normal2, std::back_inserter(x_objects));
     auto it = x_objects.begin();
     if (x_objects.size() == 1) {
-      const auto* xc = std::get<X_monotone_curve_2>(&(*it));
+      const auto* xc = std::get_if<X_monotone_curve_2>(&(*it));
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
       std::cout << "4. insert_at_vertices(" << *xc << ")" << std::endl;
 #endif
@@ -308,8 +308,8 @@ class Arr_sgm_initializer {
       return oi;
     }
 
-    const X_monotone_curve_2 * xc1 = std::get<X_monotone_curve_2>(&(*it++));
-    const X_monotone_curve_2 * xc2 = std::get<X_monotone_curve_2>(&(*it));
+    const X_monotone_curve_2 * xc1 = std::get_if<X_monotone_curve_2>(&(*it++));
+    const X_monotone_curve_2 * xc2 = std::get_if<X_monotone_curve_2>(&(*it));
 
 #if CGAL_ARR_SPHERICAL_GAUSSIAN_MAP_3_DEBUG==1
     std::cout << "4.a. insert_from_vertex(" << *xc1
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h
index 4778a4fe9131..66dd1834a8c8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_tracing_traits_2.h
@@ -635,6 +635,7 @@ class Arr_tracing_traits_2 : public Base_traits {
         const X_monotone_curve_2* xcv = std::get_if<X_monotone_curve_2>(&item);
         if (xcv != nullptr) {
           std::cout << "  result[" << i++ << "]: xcv: " << *xcv << std::endl;
+          *oi++ = *xcv;
           continue;
         }
 
@@ -642,12 +643,11 @@ class Arr_tracing_traits_2 : public Base_traits {
         if (ip != nullptr) {
           std::cout << "  result[" << i++ << "]: p: " << ip->first
                     << ", multiplicity: " << ip->second << std::endl;
+          *oi++ = *ip;
           continue;
         }
       }
 
-      for (auto it = container.begin(); it != container.end(); ++it) *oi++ = *it;
-      container.clear();
       return oi;
     }
   };
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
index a26e51a1e4ba..8fe1efa48c79 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
@@ -1469,13 +1469,13 @@ class Intersect_2 :
         // point-wise intersections
         std::vector<Arc_2> arcs;
         if (cv1._trim_if_overlapped(cv2, std::back_inserter(arcs))) {
-            for (const auto& item : arcs) *oi++ = Intersection_result(item);
+            for (const auto& item : arcs) *oi++ = item;
             return oi;
         }
         // process non-ov erlapping case
         std::vector<Intersection_point> vec;
         Arc_2::_intersection_points(cv1, cv2, std::back_inserter(vec));
-        for (const auto& item : vec) *oi++ = Intersection_result(item);
+        for (const auto& item : vec) *oi++ = item;
         return oi;
     }
 
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h
index 6b7628a05193..eedde5108af7 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h
@@ -901,12 +901,7 @@ bool Point_location_test<GeomTraits, TopolTraits>::attach_pl_strategies()
 template <typename GeomTraits, typename TopolTraits>
 bool Point_location_test<GeomTraits, TopolTraits>::perform()
 {
-#if ((CGAL_ARR_POINT_LOCATION_VERSION < 2) || \
-     defined(CGAL_ARR_POINT_LOCATION_CONVERSION))
-  Objects_vector objs[NUM_PL_STRATEGIES];
-#else
   Variants_vector objs[NUM_PL_STRATEGIES];
-#endif
 
   // Locate the points in the list using all point location strategies.
 
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
index 898b96445fee..783ba994ab88 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
@@ -706,15 +706,6 @@ function(test_point_location_segments)
   compile_and_run_with_flags(test_point_location segments "${flags}" segments)
 endfunction()
 
-# For backward compatibility
-function(test_point_location_segments_version)
-  set(nt ${CGAL_GMPQ_NT})
-  set(kernel ${CARTESIAN_KERNEL})
-  set(geom_traits ${SEGMENT_GEOM_TRAITS})
-  set(flags "-DTEST_NT=${nt} -DTEST_KERNEL=${kernel} -DTEST_GEOM_TRAITS=${geom_traits} -DCGAL_ARR_POINT_LOCATION_VERSION=1")
-  compile_and_run_with_flags(test_point_location segments "${flags}" segments_version)
-endfunction()
-
 # For backward compatibility
 function(test_point_location_segments_conversion)
   set(nt ${CGAL_GMPQ_NT})
@@ -1366,7 +1357,6 @@ test_overlay_segments()
 test_overlay_spherical_arcs()
 
 test_point_location_segments()
-test_point_location_segments_version()
 test_point_location_segments_conversion()
 test_point_location_circle_segments()
 test_point_location_linear()
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake
index ee92d955c823..4d62ce617774 100755
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake
@@ -911,16 +911,6 @@ test_point_location_segments()
   compile_and_run_with_flags test_point_location segments "$flags"
 }
 
-# For backward compatibility
-test_point_location_segments_version()
-{
-  local nt=$CGAL_GMPQ_NT;
-  local kernel=$CARTESIAN_KERNEL;
-  local geom_traits=$SEGMENT_GEOM_TRAITS;
-  local flags="-DTEST_NT=$nt -DTEST_KERNEL=$kernel -DTEST_GEOM_TRAITS=$geom_traits -DCGAL_ARR_POINT_LOCATION_VERSION=1";
-  compile_and_run_with_flags test_point_location segments "$flags"
-}
-
 # For backward compatibility
 test_point_location_segments_conversion()
 {
@@ -1706,7 +1696,6 @@ test_overlay_segments
 test_overlay_spherical_arcs
 
 test_point_location_segments
-test_point_location_segments_version
 test_point_location_segments_conversion
 test_point_location_circle_segments
 test_point_location_linear
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
index d5372d0be793..06606b659151 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_agg_meta_traits.h
@@ -162,9 +162,6 @@ class Gps_agg_meta_traits :
         Intersection_base_point;
       typedef std::variant<Intersection_base_point, Base_x_monotone_curve_2>
                                                         Intersection_base_result;
-      typedef const std::pair<Point_2, Multiplicity>    Intersection_point;
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
 
       const auto* base_traits = m_traits.m_base_traits;
       auto base_cmp_xy = base_traits->compare_xy_2_object();
@@ -187,7 +184,7 @@ class Gps_agg_meta_traits :
         if (base_pt != nullptr) {
           Point_2 point_plus(base_pt->first); // the extended point
           *oi++ =
-            Intersection_result(std::make_pair(point_plus, base_pt->second));
+            std::make_pair(point_plus, base_pt->second);
           continue;
         }
 
@@ -214,7 +211,7 @@ class Gps_agg_meta_traits :
 
         Curve_data cv_data(cv1.data().arr(), Halfedge_handle(),
                            ov_bc, ov_twin_bc);
-        *oi++ = Intersection_result(X_monotone_curve_2(*overlap_cv, cv_data));
+        *oi++ = X_monotone_curve_2(*overlap_cv, cv_data);
       }
 
       return oi;
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_simplifier_traits.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_simplifier_traits.h
index 0776b8336130..24b69369a43a 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_simplifier_traits.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_simplifier_traits.h
@@ -135,9 +135,6 @@ class Gps_simplifier_traits :
         Intersection_base_point;
       typedef std::variant<Intersection_base_point, Base_x_monotone_curve_2>
                                                         Intersection_base_result;
-      typedef const std::pair<Point_2, Multiplicity>    Intersection_point;
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
 
       const auto* base_traits = m_traits.m_base_traits;
       auto base_cmp_xy = base_traits->compare_xy_2_object();
@@ -175,7 +172,7 @@ class Gps_simplifier_traits :
           Point_data pt_data(m_traits.invalid_index());
           Point_2 point_plus(base_pt->first, pt_data); // the extended point
           *oi++ =
-            Intersection_result(std::make_pair(point_plus, base_pt->second));
+            std::make_pair(point_plus, base_pt->second);
           continue;
         }
 
@@ -202,7 +199,7 @@ class Gps_simplifier_traits :
         }
 
         Curve_data cv_data(ov_bc, ov_twin_bc, m_traits.invalid_index());
-        *oi++ = Intersection_result(X_monotone_curve_2(*overlap_cv, cv_data));
+        *oi++ = X_monotone_curve_2(*overlap_cv, cv_data);
       }
 
       return oi;
diff --git a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h
index 433a6a4949c0..4e17e189b114 100644
--- a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h
+++ b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h
@@ -116,9 +116,7 @@ class Envelope_divide_and_conquer_2
   {
     // Subdivide the curves into x-monotone subcurves.
     CurvesIterator                     it;
-    std::list<CGAL::Object>            objects;
-    std::list<CGAL::Object>::iterator  obj_it;
-    X_monotone_curve_2                 xcv;
+    std::list<std::variant<Point_2, X_monotone_curve_2>> objects;
     std::list<X_monotone_curve_2>      x_curves;
 
     for (it = begin; it != end; it++)
@@ -127,10 +125,10 @@ class Envelope_divide_and_conquer_2
       objects.clear();
       traits->make_x_monotone_2_object()(*it, std::back_inserter(objects));
 
-      for (obj_it = objects.begin(); obj_it != objects.end(); ++obj_it)
+      for (auto obj_it = objects.begin(); obj_it != objects.end(); ++obj_it)
       {
-        if(CGAL::assign (xcv, *obj_it))
-          x_curves.push_back (xcv);
+        if(const X_monotone_curve_2* xcv_ptr = std::get_if<X_monotone_curve_2>(&(*obj_it)))
+          x_curves.push_back (*xcv_ptr);
       }
     }
 
diff --git a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h
index f813f8ccc9a5..657bb0168ea0 100644
--- a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h
+++ b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2_impl.h
@@ -630,9 +630,7 @@ _merge_two_intervals(Edge_const_handle e1, bool is_leftmost1,
 
   // Find the next intersection of the envelopes to the right of the current
   // rightmost point in the merged diagram.
-  // \todo Use the faster object_cast.
-  std::list<CGAL::Object>           objects;
-  CGAL::Object                      obj;
+  std::list<std::variant<Intersection_point, X_monotone_curve_2>> objects;
   const X_monotone_curve_2*         intersection_curve;
   const Intersection_point*         intersection_point;
 
@@ -641,10 +639,10 @@ _merge_two_intervals(Edge_const_handle e1, bool is_leftmost1,
 
   while (! objects.empty()) {
     // Pop the xy-lexicographically smallest intersection object.
-    obj = objects.front();
+    auto obj = objects.front();
     objects.pop_front();
 
-    if ((intersection_point = CGAL::object_cast<Intersection_point>(&obj)) !=
+    if ((intersection_point = std::get_if<Intersection_point>(&obj)) !=
         nullptr)
     {
       // We have a simple intersection point.
@@ -725,7 +723,7 @@ _merge_two_intervals(Edge_const_handle e1, bool is_leftmost1,
     else {
       // We have an x-monotone curve representing an overlap of the two
       // curves.
-      intersection_curve = CGAL::object_cast<X_monotone_curve_2>(&obj);
+      intersection_curve = std::get_if<X_monotone_curve_2>(&obj);
 
       if (intersection_curve == nullptr)
         CGAL_error_msg("unrecognized intersection object.");
diff --git a/Envelope_3/include/CGAL/Env_plane_traits_3.h b/Envelope_3/include/CGAL/Env_plane_traits_3.h
index 1bf7f790a10b..85fbbf161be3 100644
--- a/Envelope_3/include/CGAL/Env_plane_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_plane_traits_3.h
@@ -47,7 +47,6 @@ class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_>
   typedef typename Kernel::Ray_2               Ray_2;
   typedef typename Kernel::Line_2              Line_2;
   typedef typename Kernel::Line_3              Line_3;
-  typedef typename Kernel::Object_3            Object_3;
   typedef std::pair<Curve_2, Multiplicity>     Intersection_curve;
 
   typedef typename Base::Left_side_category    Left_side_category;
@@ -326,8 +325,8 @@ class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_>
 
         const Plane_3& h = s.plane();
         Line_2 proj_line(h.a(), h.b(), h.d());
-        *o++ = make_object(std::make_pair(X_monotone_curve_2(proj_line),
-                                          ON_ORIENTED_BOUNDARY));
+        *o++ = std::make_pair(X_monotone_curve_2(proj_line),
+                              ON_ORIENTED_BOUNDARY);
         return o;
       }
 
@@ -339,7 +338,7 @@ class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_>
 
       Oriented_side side =
         (res == SMALLER) ? ON_POSITIVE_SIDE : ON_NEGATIVE_SIDE;
-      *o++ = make_object(std::make_pair(X_monotone_curve_2(s.line()), side));
+      *o++ = std::make_pair(X_monotone_curve_2(s.line()), side);
       return o;
     }
   };
@@ -369,11 +368,10 @@ class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_>
       {
         Line_2 l1(h1.a(), h1.b(), h1.d());
         Line_2 l2(h2.a(), h2.b(), h2.d());
-        Object obj = k.intersect_2_object()(l1, l2);
+        auto obj = k.intersect_2_object()(l1, l2);
 
-        Point_2 p;
-        if(assign(p, obj))
-          *o++ = make_object(p);
+        if(const Point_2* p = std::get_if<Point_2>(&(*obj)))
+          *o++ = *p;
 
         // otherwise, the vertical planes are parallel or overlap, so we return
         // nothing.
@@ -382,90 +380,82 @@ class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_>
 
       if(s1.is_all_plane() && s2.is_all_plane())
       {
-        Object obj = k.intersect_3_object()(h1, h2);
-        Line_3 l;
-        if(assign(l, obj))
-          *o++ = make_object(Intersection_curve(project_xy(l, k), 1));
+        auto obj = k.intersect_3_object()(h1, h2);
+        CGAL_assertion(obj != std::nullopt);
+        if(const Line_3* l = std::get_if<Line_3>(&(*obj)))
+          *o++ = Intersection_curve(project_xy(*l, k), 1);
 
         return o;
       }
 
       if(s1.is_all_plane() && !s2.is_all_plane())
       {
-        Object obj = plane_half_plane_proj_intersection(h1,
-                                                        h2,
-                                                        s2.line(),
-                                                        k);
-        if(obj.is_empty())
+        auto obj = plane_half_plane_proj_intersection(h1,
+                                                      h2,
+                                                      s2.line(),
+                                                      k);
+        if(obj ==std::nullopt)
           return o;
-        Line_2 temp_l;
-        if(assign(temp_l, obj))
+        if(const Line_2* line = std::get_if<Line_2>(&(*obj)))
         {
-          *o++ = make_object(Intersection_curve(temp_l, 1));
+          *o++ = Intersection_curve(*line, 1);
           return o;
         }
-        Ray_2 ray;
-        if(assign(ray, obj))
+        if(const Ray_2* ray = std::get_if<Ray_2>(&(*obj)))
         {
-          *o++ = make_object(Intersection_curve(ray, 1));
+          *o++ = Intersection_curve(*ray, 1);
           return o;
         }
         return o;
       }
       if(!s2.is_all_plane() && s2.is_all_plane())
       {
-        Object obj = plane_half_plane_proj_intersection(h2,
-                                                        h1,
-                                                        s1.line(),
-                                                        k);
-        if(obj.is_empty())
+        auto obj = plane_half_plane_proj_intersection(h2,
+                                                      h1,
+                                                      s1.line(),
+                                                      k);
+        if(obj == std::nullopt)
           return o;
-        Line_2 line;
-        if(assign(line, obj))
+        if(const Line_2* line = std::get_if<Line_2>(&(*obj)))
         {
-          *o++ = make_object(Intersection_curve(line, 1));
+          *o++ = Intersection_curve(*line, 1);
           return o;
         }
-        Ray_2 ray;
-        if(assign(ray, obj))
+        if(const Ray_2* ray = std::get_if<Ray_2>(&(*obj)))
         {
-          *o++ = make_object(Intersection_curve(ray, 1));
+          *o++ = Intersection_curve(*ray, 1);
           return o;
         }
         return o;
-
       }
 
       CGAL_assertion(!s2.is_all_plane() && !s2.is_all_plane());
-      Object obj =
+      auto obj =
         half_plane_half_plane_proj_intersection(h1, s1.line(), h2, s2.line(), k);
 
-      if(obj.is_empty())
+      if(obj ==std::nullopt )
         return o;
-      Line_2 line;
-      if(assign(line, obj))
+
+      if(const Line_2* line = std::get_if<Line_2>(&(*obj)))
       {
-        *o++ = make_object(Intersection_curve(line, 1));
+        *o++ = Intersection_curve(*line, 1);
         return o;
       }
-      Ray_2 ray;
-      if(assign(ray, obj))
+      if(const Ray_2* ray = std::get_if<Ray_2>(&(*obj)))
       {
-        *o++ = make_object(Intersection_curve(ray, 1));
+        *o++ = Intersection_curve(*ray, 1);
         return o;
       }
 
-      Segment_2 seg;
-      if(assign(seg, obj))
+      if(const Segment_2* seg = std::get_if<Segment_2>(&(*obj)))
       {
-        *o++ = make_object(Intersection_curve(seg, 1));
+        *o++ = Intersection_curve(*seg, 1);
         return o;
       }
 
-      Point_2 p;
-      if(assign(p, obj))
+      if(const Point_2* p = std::get_if<Point_2>(&(*obj)))
       {
-        *o++ = make_object(p);
+        *o++ = *p;
         return o;
       }
       return o;
diff --git a/Envelope_3/include/CGAL/Env_sphere_traits_3.h b/Envelope_3/include/CGAL/Env_sphere_traits_3.h
index 9dcfa59fe5cd..bec2a5b72a94 100644
--- a/Envelope_3/include/CGAL/Env_sphere_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_sphere_traits_3.h
@@ -18,7 +18,6 @@
 #include <CGAL/license/Envelope_3.h>
 
 
-#include <CGAL/Object.h>
 #include <CGAL/enum.h>
 #include <CGAL/Bbox_3.h>
 #include <CGAL/Sphere_3.h>
@@ -109,28 +108,28 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
       Rat_point_2 proj_center = parent.project(s.center());
       Rat_circle_2 circ(proj_center, s.squared_radius());
       Curve_2 curve = gt_2->construct_curve_2_object()(circ);
-      Object objs[2];
-      CGAL_assertion_code(Object *p = )
+      typedef std::variant<X_monotone_curve_2, Point_2> Variant;
+      Variant objs[2];
+
+      CGAL_assertion_code(Variant* p = )
       parent.make_x_monotone_2_object()(curve, objs);
       CGAL_assertion(p == objs + 2);
 
-      X_monotone_curve_2 cv1, cv2;
-
-      CGAL_assertion(assign(cv1, objs[0]));
-      CGAL_assertion(assign(cv2, objs[1]));
+      const X_monotone_curve_2* cv1 = std::get_if<X_monotone_curve_2>(&(objs[0]));
+      const X_monotone_curve_2* cv2 = std::get_if<X_monotone_curve_2>(&(objs[1]));
 
-      assign(cv1, objs[0]);
-      assign(cv2, objs[1]);
+      CGAL_assertion(cv1!=nullptr);
+      CGAL_assertion(cv2!=nullptr);
 
-      if (cv1.is_lower()) {
-        CGAL_assertion(cv2.is_upper());
-        *o++ = make_object(std::make_pair(cv1, ON_POSITIVE_SIDE));
-        *o++ = make_object(std::make_pair(cv2, ON_NEGATIVE_SIDE));
+      if (cv1->is_lower()) {
+        CGAL_assertion(cv2->is_upper());
+        *o++ = std::make_pair(*cv1, ON_POSITIVE_SIDE);
+        *o++ = std::make_pair(*cv2, ON_NEGATIVE_SIDE);
       }
       else {
-        CGAL_assertion(cv2.is_lower());
-        *o++ = make_object(std::make_pair(cv1, ON_NEGATIVE_SIDE));
-        *o++ = make_object(std::make_pair(cv2, ON_POSITIVE_SIDE));
+        CGAL_assertion(cv2->is_lower());
+        *o++ = std::make_pair(*cv1, ON_NEGATIVE_SIDE);
+        *o++ = std::make_pair(*cv2, ON_POSITIVE_SIDE);
       }
 
       return o;
@@ -237,7 +236,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           if (n_ys == 1) {
             // intersection is a point
             Point_2 inter_point(xs , ys[0]);
-            *o++ = make_object(inter_point);
+            *o++ = inter_point;
             return o;
           }
 
@@ -254,7 +253,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           Curve_2 res = ctr_cv(0, 0, 0, 2*a_diff, 0, -m, COLLINEAR, end1, end2);
 
           parent.add_curve_to_output(res, o);
-          //*o++ = make_object(Intersection_curve(res, TRANSVERSAL));
+          //*o++ = Intersection_curve(res, TRANSVERSAL);
         }
         else {
           // here we have c1 == c2, b1 != b2.
@@ -308,7 +307,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           if (n_xs == 1) {
             // intersection is a point
             Point_2 inter_point(xs[0], (-2*a_diff*xs[0] + m)/(2*b_diff) );
-            *o++ = make_object(inter_point);
+            *o++ = inter_point;
             return o;
           }
 
@@ -328,7 +327,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           Curve_2 res =
             ctr_cv(0,0,0, 2*a_diff, 2*b_diff, -m, COLLINEAR, end1, end2);
           parent.add_curve_to_output(res, o);
-          //*o++ = make_object(Intersection_curve(res, TRANSVERSAL));
+          //*o++ = Intersection_curve(res, TRANSVERSAL);
         }
       }
       // now the potential intersection is (a part of) a circle,
@@ -439,7 +438,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           // should check if the point is in the non-negative side of the
           // line
           if (CGAL_NTS sign(la*px + lb*py +lc) != NEGATIVE)
-            *o++ = make_object(Point_2(px, py));
+            *o++ = Point_2(px, py);
           return o;
         }
 
@@ -460,7 +459,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           if (sign_lc != NEGATIVE) {
             Curve_2 res = ctr_cv(R, S, T, U, V, W);
             parent.add_curve_to_output(res, o);
-            //*o++ = make_object(Intersection_curve(res, TRANSVERSAL));
+            //*o++ = Intersection_curve(res, TRANSVERSAL);
           }
           return o;
         }
@@ -609,13 +608,13 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           if (lval_sign == POSITIVE) {
             // the full ellipse is in the positive side
             parent.add_curve_to_output(inter_cv, o);
-            //*o++ = make_object(Intersection_curve(inter_cv, TRANSVERSAL));
+            //*o++ = Intersection_curve(inter_cv, TRANSVERSAL);
             return o;
           }
           else if (lval_sign == NEGATIVE) {
             // the full ellipse is in the negative side, except maybe the point
             // source in the case n_inter_points = 1 (which lies on the line)
-            if (n_inter_points == 1) *o++ = make_object(Point_2(source));
+            if (n_inter_points == 1) *o++ = Point_2(source);
             return o;
           }
 
@@ -630,8 +629,8 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           CGAL_assertion(lval_sign != ZERO);
 
           if (lval_sign == POSITIVE) parent.add_curve_to_output(inter_cv, o);
-            //*o++ = make_object(Intersection_curve(inter_cv, TRANSVERSAL));
-          else *o++ = make_object(Point_2(source));
+            //*o++ = Intersection_curve(inter_cv, TRANSVERSAL);
+          else *o++ = Point_2(source);
 
           return o;
         }
@@ -651,7 +650,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
         Curve_2 res = ctr_cv(R, S, T, U, V, W, orient, source, target);
         CGAL_assertion(res.is_valid());
         parent.add_curve_to_output(res, o);
-        //*o++ = make_object(Intersection_curve(res, TRANSVERSAL));
+        //*o++ = Intersection_curve(res, TRANSVERSAL);
       }
 
       return o;
@@ -1118,16 +1117,16 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
 
   template <typename OutputIterator>
   OutputIterator add_curve_to_output(const Curve_2& c, OutputIterator oi) const {
-    Object objs[2];
-    Object* p_obj = this->make_x_monotone_2_object()(c, objs);
-    for(Object* o = objs; o != p_obj; ++o) {
-      X_monotone_curve_2 cv;
-      if(assign(cv, *o)) *oi++ = make_object(Intersection_curve(cv, 1));
+    std::variant<X_monotone_curve_2, Point_2> objs[2];
+
+    std::variant<X_monotone_curve_2, Point_2>* p_obj = this->make_x_monotone_2_object()(c, objs);
+    for(std::variant<X_monotone_curve_2, Point_2>* o = objs; o != p_obj; ++o) {
+      if(const X_monotone_curve_2* cv = std::get_if<X_monotone_curve_2>(o))
+        *oi++ = Intersection_curve(*cv, 1);
       else {
-        Point_2 pt;
-        CGAL_assertion(assign(pt, *o));
-        assign(pt, *o);
-        *oi++ = make_object(pt);
+        const Point_2* pt = std::get_if<Point_2>(o);
+        CGAL_assertion(pt!=nullptr);
+        *oi++ = *pt;
       }
     }
     return oi;
diff --git a/Envelope_3/include/CGAL/Env_tracing_traits_3.h b/Envelope_3/include/CGAL/Env_tracing_traits_3.h
index 06171831a1a1..471299a7484b 100644
--- a/Envelope_3/include/CGAL/Env_tracing_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_tracing_traits_3.h
@@ -194,14 +194,15 @@ class Env_tracing_traits_3 : public Traits_
       Base base;
       std::cerr << "Construct_projected_boundary_2: JUST FIRST" << std::endl;
       std::cerr << "Surface: " << s << std::endl;
-      std::list<CGAL::Object> l;
+      // TODO UPDATE CONCEPT + CHANGES.md
+      std::list< std::variant<std::pair<X_monotone_curve_2, Oriented_side>, Point_2 > > l;
       base.construct_projected_boundary_2_object() (s, std::back_inserter(l));
 
       if (l.size() > 0)
       {
-        std::pair<X_monotone_curve_2, CGAL::Oriented_side> i;
-        if (CGAL::assign(i, l.front()))
-          std::cerr << "First: " << i.first << std::endl;
+        if (const std::pair<X_monotone_curve_2, CGAL::Oriented_side>* i =
+            std::get_if<std::pair<X_monotone_curve_2, CGAL::Oriented_side>>(&l.front()))
+          std::cerr << "First: " << i->first << std::endl;
         else
           std::cerr << "First intersection is a point" << std::endl;
       }
@@ -232,15 +233,14 @@ class Env_tracing_traits_3 : public Traits_
                 << std::endl;
       std::cerr << "Surface1: " << s1 << std::endl;
       std::cerr << "Surface2: " << s2 << std::endl;
-      std::list<CGAL::Object> l;
+      std::list< std::variant<Intersection_curve, Point_2 > > l;
       base.construct_projected_intersections_2_object() (s1, s2,
                                                          std::back_inserter(l));
 
       if (l.size() > 0)
       {
-        Intersection_curve i;
-        if (CGAL::assign(i, l.front()))
-          std::cerr << "First: " << i.first << std::endl;
+        if (const Intersection_curve* i = std::get_if<Intersection_curve>(&l.front()))
+          std::cerr << "First: " << i->first << std::endl;
         else
           std::cerr << "First intersection is not a point" << std::endl;
       }
diff --git a/Envelope_3/include/CGAL/Env_triangle_traits_3.h b/Envelope_3/include/CGAL/Env_triangle_traits_3.h
index 3587d9224154..00ccc69e8faf 100644
--- a/Envelope_3/include/CGAL/Env_triangle_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_triangle_traits_3.h
@@ -20,8 +20,6 @@
 
 #include <CGAL/license/Envelope_3.h>
 
-
-#include <CGAL/Object.h>
 #include <CGAL/enum.h>
 #include <CGAL/Bbox_3.h>
 #include <CGAL/Arr_segment_traits_2.h>
@@ -546,9 +544,9 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
                        s2 != ON_ORIENTED_BOUNDARY &&
                        s3 != ON_ORIENTED_BOUNDARY);
 
-        *o++ = make_object(std::make_pair(A, s1));
-        *o++ = make_object(std::make_pair(B, s2));
-        *o++ = make_object(std::make_pair(C, s3));
+        *o++ = std::make_pair(A, s1);
+        *o++ = std::make_pair(B, s2);
+        *o++ = std::make_pair(C, s3);
       }
       else
       {
@@ -561,8 +559,8 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
                 b2 = parent->project(a2);
         CGAL_assertion(b1 != b2);
 
-        *o++ = make_object(std::make_pair(X_monotone_curve_2(b1, b2),
-                                          ON_ORIENTED_BOUNDARY));
+        *o++ = std::make_pair(X_monotone_curve_2(b1, b2),
+                              ON_ORIENTED_BOUNDARY);
       }
       return o;
     }
@@ -611,32 +609,30 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
         return o;
       }
 
-      Object inter_obj = parent->intersection(s1,s2);
-      if (inter_obj.is_empty())
+      std::optional<std::variant<Point_3, Segment_3>> inter_obj
+        = parent->intersection(s1,s2);
+      if (inter_obj == std::nullopt)
       {
         return o;
       }
 
-      Point_3 point;
-      Segment_3 curve;
-      if (k.assign_3_object()(point, inter_obj))
-        *o++ = make_object(parent->project(point));
+      if (const Point_3* point = std::get_if<Point_3>(&(*inter_obj)))
+        *o++ = parent->project(*point);
       else
       {
-        CGAL_assertion_code(bool b = )
-        k.assign_3_object()(curve, inter_obj);
-        CGAL_assertion(b);
+        const Segment_3* curve = std::get_if<Segment_3>(&(*inter_obj));
+        CGAL_assertion(curve != nullptr);
 
-        Segment_2  proj_seg = parent->project(curve);
+        Segment_2  proj_seg = parent->project(*curve);
         if (! k.is_degenerate_2_object() (proj_seg))
         {
           Intersection_curve inter_cv (proj_seg, 1);
-          *o++ = make_object(inter_cv);
+          *o++ = inter_cv;
         }
         else
         {
           const Point_2&  p = k.construct_point_on_2_object() (proj_seg, 0);
-          *o++ = make_object(p);
+          *o++ = p;
         }
       }
 
@@ -1044,8 +1040,9 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
   // intersect two xy-monotone surfaces (3D-triangles or segments)
   // if the triangles overlap, the result is empty
   // the result can be a segment or a point
-  Object intersection(const Xy_monotone_surface_3& s1,
-                      const Xy_monotone_surface_3& s2) const
+  std::optional< std::variant<Point_3, Segment_3>>
+  intersection(const Xy_monotone_surface_3& s1,
+               const Xy_monotone_surface_3& s2) const
   {
     CGAL_precondition(s1.is_xy_monotone());
     CGAL_precondition(s2.is_xy_monotone());
@@ -1054,14 +1051,13 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     // first, try to intersect the bounding boxes of the triangles,
     // efficiently return empty object when the triangles are faraway
     if (!CGAL::do_overlap(s1.bbox(), s2.bbox()))
-      return Object();
+      return std::nullopt;
 
     // if intersecting two segment - alculate the intersection
     // as in the case of dimension 2
     if (s1.is_segment() && s2.is_segment())
     {
-      Object res = intersection_of_segments(s1, s2);
-      return res;
+      return intersection_of_segments(s1, s2);
     }
 
     // if both triangles lie on the same (non-vertical) plane, they overlap
@@ -1070,96 +1066,92 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     Plane_3 p1 = s1.plane();
     Plane_3 p2 = s2.plane();
     if  (p1 == p2 || p1 == p2.opposite())
-        return Object();
+        return std::nullopt;
 
     // calculate intersection between a triangle and the other triangle's
     // supporting plane
     // if there is no intersection - then the triangles have no intersection
     // between them.
-    Object inter_obj = intersection(p1, s2);
+    auto inter_obj = intersection(p1, s2);
 
-    if (inter_obj.is_empty())
-      return Object();
+    if (inter_obj == std::nullopt)
+      return std::nullopt;
 
     // otherwise, if the intersection in a point, we should check if it lies
     // inside the first triangle
-    Assign_3 assign_obj = k.assign_3_object();
-    Point_3 inter_point;
-    if (assign_obj(inter_point, inter_obj))
+    if (const Point_3* inter_point = std::get_if<Point_3>(&(*inter_obj)))
     {
-      Object res = intersection_on_plane_3(p1, s1, inter_point);
-      return res;
+      std::optional<Point_3> res = intersection_on_plane_3(p1, s1, *inter_point);
+      if (res != std::nullopt)
+        return res.value();
     }
     else
     {
       // if the intersection is a segment, we check the intersection of the
       // other plane-triangle pair
-      Segment_3 inter_seg;
-      CGAL_assertion(assign_obj(inter_seg, inter_obj));
-      assign_obj(inter_seg, inter_obj);
+      const Segment_3* inter_seg = std::get_if<Segment_3>(&(*inter_obj));
+      CGAL_assertion(inter_seg != nullptr);
 
-      inter_obj = intersection(p2, s1);
+      auto inter_obj2 = intersection(p2, s1);
 
       // if there is no intersection - then the triangles have no intersection
       // between them.
-      if (inter_obj.is_empty())
-              return Object();
+      if (inter_obj2 == std::nullopt)
+        return std::nullopt;
 
-      if (assign_obj(inter_point, inter_obj))
+      if (const Point_3* inter_point = std::get_if<Point_3>(&(*inter_obj2)))
       {
-              // if the intersection is a point, which lies on the segment,
-              // than it is the result,
-              // otherwise, empty result
-               if (k.has_on_3_object()(inter_seg, inter_point))
-                 return make_object(inter_point);
-               else
-                 return Object();
+        // if the intersection is a point, which lies on the segment,
+        // than it is the result,
+        // otherwise, empty result
+         if (k.has_on_3_object()(*inter_seg, *inter_point))
+           return *inter_point;
+         else
+           return std::nullopt;
       }
       else
       {
-              // both plane-triangle intersections are segments, which are collinear,
-              // and lie on the line which is the intersection of the two supporting
-              // planes
-        Segment_3 inter_seg2;
-              CGAL_assertion(assign_obj(inter_seg2, inter_obj));
-              assign_obj(inter_seg2, inter_obj);
-
-              Point_3 min1 = k.construct_min_vertex_3_object()(inter_seg),
-                      max1 = k.construct_max_vertex_3_object()(inter_seg);
-              Point_3 min2 = k.construct_min_vertex_3_object()(inter_seg2),
-                      max2 = k.construct_max_vertex_3_object()(inter_seg2);
-
-               CGAL_assertion((k.collinear_3_object()(min1, min2, max1) &&
+        // both plane-triangle intersections are segments, which are collinear,
+        // and lie on the line which is the intersection of the two supporting
+        // planes
+        const Segment_3* inter_seg2 = std::get_if<Segment_3>(&(*inter_obj));
+        CGAL_assertion(inter_seg2 != nullptr);
+
+        Point_3 min1 = k.construct_min_vertex_3_object()(*inter_seg),
+                max1 = k.construct_max_vertex_3_object()(*inter_seg);
+        Point_3 min2 = k.construct_min_vertex_3_object()(*inter_seg2),
+                max2 = k.construct_max_vertex_3_object()(*inter_seg2);
+
+         CGAL_assertion((k.collinear_3_object()(min1, min2, max1) &&
                          k.collinear_3_object()(min1, max2, max1)));
 
-               // we need to find the overlapping part, if exists
-               Point_3 min, max;
-               if (k.less_xyz_3_object()(min1, min2))
-                 min = min2;
-               else
-                 min = min1;
-               if (k.less_xyz_3_object()(max1, max2))
-                 max = max1;
-               else
-                 max = max2;
-
-               Object res;
-               Comparison_result comp_res = k.compare_xyz_3_object()(min, max);
-               if (comp_res == EQUAL)
-                 res = make_object(min);
-               else if (comp_res == SMALLER)
-                 res = make_object(Segment_3(min, max));
-               // else - empty result
-
-               return res;
+         // we need to find the overlapping part, if exists
+         Point_3 min, max;
+         if (k.less_xyz_3_object()(min1, min2))
+           min = min2;
+         else
+           min = min1;
+         if (k.less_xyz_3_object()(max1, max2))
+           max = max1;
+         else
+           max = max2;
+
+         Comparison_result comp_res = k.compare_xyz_3_object()(min, max);
+         if (comp_res == EQUAL)
+           return min;
+         else if (comp_res == SMALLER)
+           return Segment_3(min, max);
+         // else - empty result
       }
     }
+    return std::nullopt;
   }
 
   // calculate intersection between triangle & point on the same plane plane
-  Object intersection_on_plane_3(const Plane_3& plane,
-                                 const Xy_monotone_surface_3& triangle,
-                                 const Point_3& point) const
+  std::optional<Point_3>
+  intersection_on_plane_3(const Plane_3& plane,
+                          const Xy_monotone_surface_3& triangle,
+                          const Point_3& point) const
   {
     Kernel k;
     CGAL_precondition( triangle.is_xy_monotone() );
@@ -1177,14 +1169,15 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     else
       has_on = k.has_on_3_object()(static_cast<Triangle_3>(triangle), point);
     if (has_on)
-      return make_object(point);
+      return point;
     else
-      return Object();
+      return std::nullopt;
   }
 
   // calculate intersection between 2 segments on the same vertical plane plane
-  Object intersection_of_segments(const Xy_monotone_surface_3& s1,
-                                  const Xy_monotone_surface_3& s2) const
+  std::optional< std::variant<Point_3, Segment_3>>
+  intersection_of_segments(const Xy_monotone_surface_3& s1,
+                           const Xy_monotone_surface_3& s2) const
   {
     Kernel k;
     CGAL_precondition( s1.is_xy_monotone() && s1.is_segment());
@@ -1193,14 +1186,14 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     // if the segments are not coplanar, they cannot intersect
     if (!k.coplanar_3_object()(s1.vertex(0), s1.vertex(1),
                                s2.vertex(0), s2.vertex(1)))
-      return Object();
+      return std::nullopt;
 
     const Plane_3& plane = s1.plane();
     if (s2.plane() != plane &&
         s2.plane() != plane.opposite())
       // todo: this case is not needed in the algorithm,
       // so we don't implement it
-      return Object();
+      return std::nullopt;
 
     CGAL_precondition( !k.is_degenerate_3_object()(plane) );
     CGAL_precondition( s2.plane() == plane ||
@@ -1212,30 +1205,24 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
             v2 = plane.to_2d(s1.vertex(1));
     Segment_2 seg1_t(v1, v2);
 
-          Point_2 u1 = plane.to_2d(s2.vertex(0)),
+    Point_2 u1 = plane.to_2d(s2.vertex(0)),
             u2 = plane.to_2d(s2.vertex(1));
-          Segment_2 seg2_t(u1, u2);
+    Segment_2 seg2_t(u1, u2);
 
-          Object inter_obj = k.intersect_2_object()(seg1_t, seg2_t);
-          Assign_2 assign_2 = k.assign_2_object();
-          if (inter_obj.is_empty())
-                  return inter_obj;
+    auto inter_obj = k.intersect_2_object()(seg1_t, seg2_t);
+    if (inter_obj == std::nullopt)
+        return std::nullopt;
 
-          Point_2 inter_point;
-    Segment_2 inter_segment;
-
-    if (assign_2(inter_point, inter_obj))
-            return make_object(plane.to_3d(inter_point));
+    if (const Point_2* inter_point = std::get_if<Point_2>(&(*inter_obj)))
+      return plane.to_3d(*inter_point);
     else
     {
-      CGAL_assertion_code(bool b = )
-      assign_2(inter_segment, inter_obj);
-      CGAL_assertion(b);
-
-      return make_object
-        (Segment_3
-         (plane.to_3d(k.construct_vertex_2_object()(inter_segment, 0)),
-          plane.to_3d(k.construct_vertex_2_object()(inter_segment, 1))));
+      const Segment_2* inter_segment = std::get_if<Segment_2>(&(*inter_obj));
+      CGAL_assertion(inter_segment!=nullptr);
+
+      return Segment_3
+         (plane.to_3d(k.construct_vertex_2_object()(*inter_segment, 0)),
+          plane.to_3d(k.construct_vertex_2_object()(*inter_segment, 1)));
     }
 
   }
@@ -1244,8 +1231,9 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
   // and a (non degenerate) plane in 3d
   // the result object can be empty, a point, a segment or the original
   // triangle
-  Object intersection(const Plane_3& pl,
-                                  const Xy_monotone_surface_3& tri) const
+  std::optional<std::variant<Point_3, Segment_3>>
+  intersection(const Plane_3& pl,
+               const Xy_monotone_surface_3& tri) const
   {
     Kernel k;
     CGAL_precondition( tri.is_xy_monotone() );
@@ -1278,24 +1266,23 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
         points_on_plane[n_points_on_plane++] = i;
     }
 
-    CGAL_assertion(n_points_on_plane +
-            n_points_on_positive + n_points_on_negative == 3);
+    CGAL_assertion(n_points_on_plane + n_points_on_positive + n_points_on_negative == 3);
 
     // if all vertices of tri lie on the same size (positive/negative) of pl,
     // there is no intersection
     if (n_points_on_positive == 3 || n_points_on_negative == 3)
-      return Object();
+      return std::nullopt;
 
     // if all vertices of tri lie on pl then we return tri
     if (n_points_on_plane == 3)
-       return make_object(tri);
+       return tri;
 
     // if 2 vertices lie on pl, then return the segment between them
     if (n_points_on_plane == 2)
     {
       int point_idx1 = points_on_plane[0], point_idx2 = points_on_plane[1];
-      return make_object (Segment_3(tri.vertex(point_idx1),
-                                    tri.vertex(point_idx2)));
+      return Segment_3(tri.vertex(point_idx1),
+                       tri.vertex(point_idx2));
     }
 
     // if only 1 lie on pl, should check the segment opposite to it on tri
@@ -1306,7 +1293,7 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       // if the other 2 vertices are on the same side of pl,
       // then the answer is just this vertex
       if (n_points_on_negative == 2 || n_points_on_positive == 2)
-        return make_object(tri.vertex(point_on_plane_idx));
+        return tri.vertex(point_on_plane_idx);
 
       // now it is known that one vertex is on pl, and the segment of tri
       // opposite to it should intersect pl
@@ -1315,15 +1302,14 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       Segment_3 tri_segment(tri.vertex(point_on_plane_idx+1),
                             tri.vertex(point_on_plane_idx+2));
 
-      Object inter_result = k.intersect_3_object()(pl, tri_segment);
-      Point_3 inter_point;
-      CGAL_assertion( k.assign_3_object()(inter_point, inter_result) );
-      k.assign_3_object()(inter_point, inter_result);
+      auto inter_result = k.intersect_3_object()(pl, tri_segment);
+      const Point_3* inter_point = std::get_if<Point_3>(&(*inter_result));
+      CGAL_assertion( inter_point != nullptr );
 
       // create the resulting segment
       // (between tri[point_on_plane_idx] and inter_point)
-      return make_object(Segment_3(tri.vertex(point_on_plane_idx),
-                                   inter_point));
+      return Segment_3(tri.vertex(point_on_plane_idx),
+                                   *inter_point);
 
     }
 
@@ -1341,16 +1327,14 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       {
         Segment_3 seg(tri.vertex(points_on_positive[pos_it]),
                       tri.vertex(points_on_negative[neg_it]));
-        Object inter_result = k.intersect_3_object()(pl, seg);
-        Point_3 inter_point;
-        // the result of the intersection must be a point
-        CGAL_assertion( k.assign_3_object()(inter_point, inter_result) );
-        k.assign_3_object()(inter_point, inter_result);
-        inter_points[n_inter_points++] = inter_point;
+        auto inter_result = k.intersect_3_object()(pl, seg);
+        const Point_3* inter_point = std::get_if<Point_3>(&(*inter_result));
+        CGAL_assertion( inter_point != nullptr );
+        inter_points[n_inter_points++] = *inter_point;
       }
 
     CGAL_assertion( n_inter_points == 2 );
-    return make_object(Segment_3(inter_points[0], inter_points[1]));
+    return Segment_3(inter_points[0], inter_points[1]);
   }
 
   // compare the value of s1 in p1 to the value of s2 in p2
@@ -1394,13 +1378,12 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       Line_3      vl = k.construct_line_3_object() (point, dir);
 
       const Plane_3& plane = s.plane();
-      Object    res = k.intersect_3_object()(plane, vl);
-      CGAL_assertion(!res.is_empty());
-      Point_3 ip;
-      CGAL_assertion(k.assign_3_object()(ip, res));
-      k.assign_3_object()(ip, res);
+      auto res = k.intersect_3_object()(plane, vl);
+      CGAL_assertion(res != std::nullopt);
+      const Point_3* ip = std::get_if<Point_3>(&(*res));
+      CGAL_assertion(ip != nullptr);
 
-      return ip;
+      return *ip;
     }
   }
 
@@ -1438,12 +1421,10 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     Line_2 l(tvl_point1, tvl_point2);
 
     Segment_2 seg(t1, t2);
-    Object inter_obj = k.intersect_2_object()(seg, l);
-    Point_2 inter_point;
-    CGAL_assertion_code(bool is_inter_point =)
-    k.assign_2_object()(inter_point, inter_obj);
-    CGAL_assertion(is_inter_point);
-    return plane.to_3d(inter_point);
+    auto inter_obj = k.intersect_2_object()(seg, l);
+    const Point_2* inter_point = std::get_if<Point_2>(&(*inter_obj));
+    CGAL_assertion(inter_point != nullptr);
+    return plane.to_3d(*inter_point);
   }
 
   Point_2 construct_middle_point(const Point_2& p1, const Point_2& p2) const
@@ -1495,14 +1476,11 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     typename Kernel::Line_2        vl = k.construct_line_2_object() (pt, dir);
 
     // Compute the intersetion between the vertical line and the given curve.
-    Object    res = k.intersect_2_object()(seg, vl);
-    Point_2   ip;
-    bool      ray_shoot_successful = k.assign_2_object()(ip, res);
-
-    if (! ray_shoot_successful)
-      CGAL_assertion (ray_shoot_successful);
+    auto res = k.intersect_2_object()(seg, vl);
+    const Point_2* ip = std::get_if<Point_2>(&(*res));
+    CGAL_assertion (ip != nullptr);
 
-    return (ip);
+    return *ip;
   }
 };
 
diff --git a/Envelope_3/include/CGAL/Envelope_3/Env_plane_traits_3_functions.h b/Envelope_3/include/CGAL/Envelope_3/Env_plane_traits_3_functions.h
index e0caf43d5cd6..8ca94fb2049e 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Env_plane_traits_3_functions.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Env_plane_traits_3_functions.h
@@ -16,65 +16,62 @@
 
 
 #include <CGAL/basic.h>
-#include <CGAL/Object.h>
 #include <CGAL/use.h>
 
 namespace CGAL {
 
 template <class K>
-Object plane_half_plane_proj_intersection(const typename K::Plane_3 &h1,
-                                          const typename K::Plane_3 &h2,
-                                          const typename K::Line_2  &l,
-                                          const K& k)
+std::optional< std::variant<typename K::Line_2, typename K::Ray_2, typename K::Segment_2, typename K::Point_2> >
+plane_half_plane_proj_intersection(const typename K::Plane_3 &h1,
+                                   const typename K::Plane_3 &h2,
+                                   const typename K::Line_2  &l,
+                                   const K& k)
 {
   typedef typename K::Line_3     Line_3;
   typedef typename K::Line_2     Line_2;
   typedef typename K::Plane_3    Plane_3;
 
   // intersect the two planes
-  Object h_obj = k.intersect_3_object()(h1, h2);
-  if(h_obj.is_empty())
-    return Object(); // no intersection at all (parallel planes)
+  auto h_obj = k.intersect_3_object()(h1, h2);
+  if(h_obj == std::nullopt)
+    return std::nullopt; // no intersection at all (parallel planes)
 
   Plane_3 p;
-  if(assign(p, h_obj))
-    return Object();
+  if(std::get_if<Plane_3>(&(*h_obj))==nullptr)
+    return std::nullopt;
 
   // if two planes are not parallel they must intersect at a 3D line
-  Line_3 l3;
-  CGAL_assertion_code(bool b =)
-    assign(l3, h_obj);
-  CGAL_assertion(b);
+  const Line_3* l3 = std::get_if<Line_3>(&(*h_obj));
+  CGAL_assertion(l3!=nullptr);
 
-  const Line_2& proj_inter_line = project_xy(l3, k);
+  const Line_2& proj_inter_line = project_xy(*l3, k);
 
-  return line_under_linear_constraint(proj_inter_line, l, k);
+  return line_under_linear_constraint(proj_inter_line, l, k); //LR
 }
 
 template <class K>
-Object half_plane_half_plane_proj_intersection(const typename K::Plane_3 &h1,
-                                               const typename K::Line_2  &l1,
-                                               const typename K::Plane_3 &h2,
-                                               const typename K::Line_2  &l2,
-                                               const K& k)
+std::optional< std::variant<typename K::Line_2, typename K::Ray_2, typename K::Segment_2, typename K::Point_2> >
+half_plane_half_plane_proj_intersection(const typename K::Plane_3 &h1,
+                                        const typename K::Line_2  &l1,
+                                        const typename K::Plane_3 &h2,
+                                        const typename K::Line_2  &l2,
+                                        const K& k)
 {
   typedef typename K::Ray_2      Ray_2;
   typedef typename K::Line_2     Line_2;
 
-  Object obj = plane_half_plane_proj_intersection(h1, h2, l2, k);
-  if(obj.is_empty())
-    return Object();
+  auto obj = plane_half_plane_proj_intersection(h1, h2, l2, k);
+  if(obj == std::nullopt)
+    return std::nullopt;
 
-  Line_2 l;
-  if(assign(l, obj))
-    return line_under_linear_constraint(l, l1, k);
+  if(const Line_2* line = std::get_if<Line_2>(&(*obj)))
+    return line_under_linear_constraint(*line, l1, k);
 
-  Ray_2 ray;
-  if(assign(ray, obj))
-    return ray_under_linear_constraint(ray, l1, k);
+  if(const Ray_2* ray = std::get_if<Ray_2>(&(*obj)))
+    return ray_under_linear_constraint(*ray, l1, k);
 
   CGAL_error(); // doesn't suppose to reach here
-  return Object();
+  return std::nullopt;
 }
 
 template <class K>
@@ -97,96 +94,91 @@ typename K::Line_2 project_xy(const typename K::Line_3& l,
 // l1 is a line, l2 is a linear constraint (determined by the direction
 // of the line).
 template <class K>
-Object line_under_linear_constraint(const typename K::Line_2& l1,
-                                    const typename K::Line_2& l2,
-                                    const K& k)
+std::optional< std::variant<typename K::Line_2, typename K::Ray_2, typename K::Segment_2, typename K::Point_2> >
+line_under_linear_constraint(const typename K::Line_2& l1,
+                             const typename K::Line_2& l2,
+                             const K& k)
 {
   typedef typename K::Ray_2         Ray_2;
-  typedef typename K::Line_2        Line_2;
   typedef typename K::Vector_2      Vector_2;
   typedef typename K::Point_2       Point_2;
 
-  Object obj = k.intersect_2_object()(l1, l2);
-  Point_2 p;
-  if(assign(p, obj))
+  auto obj = k.intersect_2_object()(l1, l2);
+
+  if(obj == std::nullopt)// the two lines are parallel
   {
-    const Vector_2& vec = k.construct_vector_2_object()(l1);
-    const Point_2& s = k.construct_translated_point_2_object()(p, vec);
-    const Ray_2& ray = k.construct_ray_2_object()(p, s);
+    const Point_2& s = k.construct_point_on_2_object()(l1, 0);
     Oriented_side side = k.oriented_side_2_object()(l2, s);
+
     if(side == ON_NEGATIVE_SIDE)
-    {
-      return make_object(k.construct_opposite_ray_2_object()(ray));
-    }
+      return std::nullopt;
 
-    CGAL_assertion(side == ON_POSITIVE_SIDE); //the two lines are not parallel
-    return make_object(ray);
+    CGAL_assertion(side == ON_POSITIVE_SIDE); // the two lines are parallel
+    return l1;
   }
 
-  if(obj.is_empty()) // the two lines are parallel
+  if(const Point_2* p = std::get_if<Point_2>(&(*obj)))
   {
-    const Point_2& s = k.construct_point_on_2_object()(l1, 0);
+    const Vector_2& vec = k.construct_vector_2_object()(l1);
+    const Point_2& s = k.construct_translated_point_2_object()(*p, vec);
+    const Ray_2& ray = k.construct_ray_2_object()(*p, s);
     Oriented_side side = k.oriented_side_2_object()(l2, s);
-
     if(side == ON_NEGATIVE_SIDE)
-      return Object();
+    {
+      return k.construct_opposite_ray_2_object()(ray);
+    }
 
-    CGAL_assertion(side == ON_POSITIVE_SIDE); // the two lines are parallel
-    return make_object(l1);
+    CGAL_assertion(side == ON_POSITIVE_SIDE); //the two lines are not parallel
+    return ray;
   }
 
   // the two lines overlap
-  CGAL_USE_TYPE(Line_2);
-  CGAL_assertion_code(Line_2 dummy;);
-  CGAL_assertion_code(bool b =  assign(dummy, obj););
-  CGAL_assertion(b);
-
-  return make_object(l1);
+  return l1;
 }
 
 template <class K>
-Object ray_under_linear_constraint(const typename K::Ray_2&  ray,
-                                   const typename K::Line_2& l,
-                                   const K& k)
+std::optional< std::variant<typename K::Line_2, typename K::Ray_2, typename K::Segment_2, typename K::Point_2> >
+ray_under_linear_constraint(const typename K::Ray_2&  ray,
+                            const typename K::Line_2& l,
+                            const K& k)
 {
   typedef typename K::Vector_2      Vector_2;
   typedef typename K::Point_2       Point_2;
 
   const Point_2& s = k.construct_point_on_2_object()(ray, 0);
   Oriented_side side = k.oriented_side_2_object()(l, s);
-  Object obj = k.intersect_2_object()(ray, l);
-  if(obj.is_empty())
+  auto obj = k.intersect_2_object()(ray, l);
+  if(obj == std::nullopt)
   {
     if(side == ON_NEGATIVE_SIDE)
-      return Object();
+      return std::nullopt;
 
     CGAL_assertion(side == ON_POSITIVE_SIDE);
-    return make_object(ray);
+    return ray;
   }
 
-  Point_2 p;
-  if(assign(p, obj))
+  if(const Point_2* p = std::get_if<Point_2>(&(*obj)))
   {
     if(side == ON_POSITIVE_SIDE)
-      return make_object(k.construct_segment_2_object()(s, p));
+      return k.construct_segment_2_object()(s, *p);
 
     Vector_2 vec = k.construct_vector_2_object()(ray);
     if(side == ON_NEGATIVE_SIDE)
-      return make_object(k.construct_ray_2_object()(p, vec));
+      return k.construct_ray_2_object()(*p, vec);
 
     CGAL_assertion(side == ON_ORIENTED_BOUNDARY);
     const Vector_2& vec_of_l = k.construct_vector_2_object()(l);
 
     Orientation orient = k.orientation_2_object()(vec_of_l, vec);
     if(orient == LEFT_TURN)
-      return make_object(ray);
+      return ray;
 
     CGAL_assertion(orient == RIGHT_TURN);
-    return make_object(s);
+    return s;
   }
 
   // the ray and the line overlap
-  return make_object(ray);
+  return ray;
 }
 
 
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
index 35b172c62336..a15422a19d2f 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
@@ -27,7 +27,6 @@
 #include <map>
 #include <time.h>
 
-#include <CGAL/Object.h>
 #include <CGAL/enum.h>
 #include <CGAL/Arr_observer.h>
 #include <CGAL/Envelope_3/Envelope_base.h>
@@ -307,9 +306,8 @@ class Envelope_divide_and_conquer_3
   void deal_with_one_surface(Xy_monotone_surface_3& surf,
                              Minimization_diagram_2& result)
   {
-    typedef std::list<Object>                            Boundary_list;
     typedef std::pair<X_monotone_curve_2, Oriented_side> Boundary_xcurve;
-    typedef Boundary_list::iterator                      Boundary_iterator;
+    typedef std::list<std::variant<Boundary_xcurve,Point_2>> Boundary_list;
 
     Boundary_list     boundary;
     m_geom_traits->
@@ -325,17 +323,15 @@ class Envelope_divide_and_conquer_3
       return;
     }
 
-    for (Boundary_iterator boundary_it = boundary.begin();
+    for (auto boundary_it = boundary.begin();
          boundary_it != boundary.end();
          ++boundary_it)
     {
-      const Object& obj = *boundary_it;
-      Boundary_xcurve boundary_cv;
-      if (assign(boundary_cv, obj))
+      if (const Boundary_xcurve* boundary_cv = std::get_if<Boundary_xcurve>(&(*boundary_it)))
       {
-        Oriented_side side = boundary_cv.second;
+        Oriented_side side = boundary_cv->second;
         Halfedge_handle he =
-          insert_non_intersecting_curve(result, boundary_cv.first);
+          insert_non_intersecting_curve(result, boundary_cv->first);
 
         if (side == ON_ORIENTED_BOUNDARY)
         {
@@ -408,10 +404,9 @@ class Envelope_divide_and_conquer_3
       else
       {
         // the xy-surface is an isolated point
-        Point_2 p;
-        CGAL_assertion(assign(p, obj));
-        assign(p, obj);
-        insert_point(result, p);
+        const Point_2* p = std::get_if<Point_2>(&(*boundary_it));
+        CGAL_assertion(p!=nullptr);
+        insert_point(result, *p);
       }
     }
 
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
index 0376a0c11193..e5184ba9a2a7 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
@@ -131,7 +131,8 @@ class Envelope_element_visitor_3
                                                         Vertices_to_edges_map;
 
   typedef std::pair<X_monotone_curve_2, Multiplicity>   Intersection_curve;
-  typedef std::list<Object>                             Intersections_list;
+  typedef std::list<std::variant<Intersection_curve,
+                    Point_2>>                           Intersections_list;
 
   // this is used in the resolve edge process
   typedef Triple<Point_2, bool, bool>                   Point_2_with_info;
@@ -199,7 +200,8 @@ class Envelope_element_visitor_3
     // find the projected intersections of the surfaces. if none - we have
     // a simple case:
     // need only resolve non-intersecting and return
-    std::list<Object> inter_objs;
+    std::list<std::variant<Intersection_curve, Point_2>> inter_objs;
+
     get_projected_intersections(surf1, surf2, std::back_inserter(inter_objs));
 
     if (inter_objs.size() == 0)
@@ -243,11 +245,6 @@ class Envelope_element_visitor_3
     map_copied_to_orig_faces[copied_face] = face;
 
 
-    // insert the projected intersections into the temporary minimization diagram
-    Point_2 point;
-    Intersection_curve curve;
-    Object cur_obj;
-
     // we use our zone visitor, which only inserts into the arrangement the
     // points and curves which are inside the copied face
     // it updates the result arrangement at the same time (action after action
@@ -287,12 +284,10 @@ class Envelope_element_visitor_3
                                           this);
 
     Md_point_location pl(copied_face_arr);
-    std::list<Object>::iterator inter_objs_it = inter_objs.begin();
-    for (; inter_objs_it != inter_objs.end(); ++inter_objs_it)
+    for (auto inter_objs_it = inter_objs.begin();
+              inter_objs_it != inter_objs.end(); ++inter_objs_it)
     {
-      cur_obj = *inter_objs_it;
-      CGAL_assertion(!cur_obj.is_empty());
-      if (assign(point, cur_obj))
+      if (const Point_2* point = std::get_if<Point_2>(&(*inter_objs_it)))
       {
         // intersection can be a point when the surfaces only touch each other.
         // we are only interested in the points that are inside the face or
@@ -302,12 +297,12 @@ class Envelope_element_visitor_3
         // should use observer for split_edge
         // if not in a sub-face of "face", shouldn't insert it
         // the above information is available in zone_visitor
-        insert_point(copied_face_arr, point, pl, zone_visitor);
+        insert_point(copied_face_arr, *point, pl, zone_visitor);
       }
-      else if (assign(curve, cur_obj))
+      else if (const Intersection_curve* curve = std::get_if<Intersection_curve>(&(*inter_objs_it)))
       {
-        zone_visitor.set_current_intersection_type(curve.second);
-        insert(copied_face_arr, curve.first, pl, zone_visitor);
+        zone_visitor.set_current_intersection_type(curve->second);
+        insert(copied_face_arr, curve->first, pl, zone_visitor);
         CGAL_assertion(copied_face_arr.is_valid());
         CGAL_assertion(result.is_valid());
       }
@@ -485,7 +480,7 @@ class Envelope_element_visitor_3
     const Xy_monotone_surface_3& surf2 = get_aux_surface(edge, 1);
 
     // find the projected intersections
-    std::list<Object> inter_objs;
+    std::list<std::variant<Intersection_curve, Point_2>> inter_objs;
     get_projected_intersections(surf1, surf2, std::back_inserter(inter_objs));
 
     if (inter_objs.size() == 0)
@@ -522,48 +517,38 @@ class Envelope_element_visitor_3
     bool is_min_end_at_inf = false;
     bool is_max_end_at_inf = false;
 
-    Point_2 point;
-    Intersection_curve icurve;
-    Object cur_obj;
-
-    std::list<Object>::iterator inter_objs_it = inter_objs.begin();
-    for (; inter_objs_it != inter_objs.end(); ++inter_objs_it)
+    for (auto inter_objs_it = inter_objs.begin();
+              inter_objs_it != inter_objs.end(); ++inter_objs_it)
     {
-      cur_obj = *inter_objs_it;
-      CGAL_assertion(!cur_obj.is_empty());
-      if (assign(point, cur_obj))
+      if (const Point_2* point = std::get_if<Point_2>(&(*inter_objs_it)))
       {
         // if the point is on the curve, should add it the split points
         // list, otherwise, it is irrelevant and should be ignored
-        if (is_point_on_curve(point, original_cv))
-          split_points.push_back(Point_2_with_info(point, false, false));
+        if (is_point_on_curve(*point, original_cv))
+          split_points.push_back(Point_2_with_info(*point, false, false));
       }
-      else if (assign(icurve, cur_obj))
+      else if (const Intersection_curve* icurve = std::get_if<Intersection_curve>(&(*inter_objs_it)))
       {
-        const X_monotone_curve_2& x_curve = icurve.first;
+        const X_monotone_curve_2& x_curve = icurve->first;
 
         // find the intersection points and overlapping segments with the
         // original curve and insert them to the list of split points
         // intersect the x-monotone curve with the edge's curve
         typedef std::pair<Point_2, unsigned int> Intersect_point_2;
-        std::list<Object> intersections_list;
-        const Intersect_point_2* ip;
-        const X_monotone_curve_2* icv;
+        std::list<std::variant<X_monotone_curve_2, Intersect_point_2>> intersections_list;
 
         m_traits->intersect_2_object()(x_curve, original_cv,
                                        std::back_inserter(intersections_list));
 
-        std::list<Object>::iterator inter_it = intersections_list.begin();
-        for (; inter_it != intersections_list.end(); ++inter_it)
+        for (auto inter_it = intersections_list.begin(); inter_it != intersections_list.end(); ++inter_it)
         {
-          ip = object_cast<Intersect_point_2>(&(*inter_it));
-          if (ip != nullptr)
+          if (const Intersect_point_2* ip = std::get_if<Intersect_point_2>(&(*inter_it)))
           {
             split_points.push_back(Point_2_with_info(ip->first, false, false));
           }
           else
           {
-            icv = object_cast<X_monotone_curve_2>(&(*inter_it));
+            const X_monotone_curve_2* icv = std::get_if<X_monotone_curve_2>(&(*inter_it));
             CGAL_assertion(icv != nullptr);
 
             // we will add the *icv end points to the split_points, unless
@@ -791,15 +776,15 @@ class Envelope_element_visitor_3
     const Vertex_const_handle* vh;
     Vertex_handle vh_for_p;
 
-    CGAL::Object obj = pl.locate(p);
+    auto obj = pl.locate(p);
     visitor.init(&arr);
 
-    if ((fh = object_cast<Face_const_handle>(&obj))
+    if ((fh = std::get_if<Face_const_handle>(&obj))
         != nullptr)
     {
       vh_for_p = visitor.found_point_in_face(p, arr.non_const_handle(*fh));
     }
-    else if ((hh = object_cast<Halfedge_const_handle>(&obj)) != nullptr)
+    else if ((hh = std::get_if<Halfedge_const_handle>(&obj)))
     {
       vh_for_p = visitor.found_point_on_edge(p , arr.non_const_handle(*hh));
     }
@@ -807,7 +792,7 @@ class Envelope_element_visitor_3
     {
       // In this case p lies on an existing vertex, so we just update this
       // vertex.
-      vh = object_cast<Vertex_const_handle>(&obj);
+      vh = std::get_if<Vertex_const_handle>(&obj);
       CGAL_assertion(vh != nullptr);
       vh_for_p = visitor.found_point_on_vertex(p, arr.non_const_handle(*vh));
     }
diff --git a/Envelope_3/test/Envelope_3/Envelope_test_3.h b/Envelope_3/test/Envelope_3/Envelope_test_3.h
index 997c4aced68f..80656676ca7d 100644
--- a/Envelope_3/test/Envelope_3/Envelope_test_3.h
+++ b/Envelope_3/test/Envelope_3/Envelope_test_3.h
@@ -18,7 +18,6 @@
 #include <CGAL/Envelope_3/Envelope_overlay_2.h>
 
 #include <CGAL/Arr_walk_along_line_point_location.h>
-#include <CGAL/Object.h>
 #include <CGAL/enum.h>
 
 #include <iostream>
@@ -116,49 +115,41 @@ class Envelope_test_3
       Xy_monotone_surface_3 &cur_surface = surfaces[i];
       // first insert all the projected curves of the boundary of the current surface
       // collect the curve in this list, and use sweepline at the end
-      std::list<Object>                            boundary_list;
       typedef std::pair<X_monotone_curve_2, Oriented_side> Boundary_xcurve;
+      std::list<std::variant<Boundary_xcurve, Point_2>> boundary_list;
 
-      typedef std::list<Object>::const_iterator Boundary_iterator;
       traits.construct_projected_boundary_2_object()(cur_surface, std::back_inserter(boundary_list));
-      for(Boundary_iterator boundary_it = boundary_list.begin();
+      for(auto boundary_it = boundary_list.begin();
           boundary_it != boundary_list.end();
           ++boundary_it)
       {
-        const Object& obj = *boundary_it;
-        Boundary_xcurve boundary_cv;
-        assert(assign(boundary_cv, obj));
-        assign(boundary_cv, obj);
-        curves_col.push_back(boundary_cv.first);
+        const Boundary_xcurve* boundary_cv = std::get_if<Boundary_xcurve>(&(*boundary_it));
+        assert(boundary_cv!=nullptr);
+        curves_col.push_back(boundary_cv->first);
       }
 
       // second, intersect it with all surfaces before it
-      Object cur_obj;
       for(j=0; j<i; ++j)
       {
         Xy_monotone_surface_3& prev_surface = surfaces[j];
 
-        std::vector<Object> inter_objs;
+        std::vector<std::variant<Intersection_curve,Point_2>> inter_objs;
         traits.construct_projected_intersections_2_object()(cur_surface, prev_surface, std::back_inserter(inter_objs));
 
         // we collect all intersections and use sweep to insert them
-        Point_2 point;
-        Intersection_curve curve;
         for(std::size_t k=0; k<inter_objs.size(); ++k)
         {
-          cur_obj = inter_objs[k];
-          assert(!cur_obj.is_empty());
-          if (CGAL::assign(point, cur_obj))
+          if (const Point_2* point = std::get_if<Point_2>(&inter_objs[k]))
           {
             #ifdef CGAL_DEBUG_ENVELOPE_TEST_3
               std::cout << "intersection between surfaces is a point: " << point << std::endl;
             #endif
             //insert_vertex(result, point, pl);
-            points_col.push_back(point);
+            points_col.push_back(*point);
           }
-          else if (CGAL::assign(curve, cur_obj))
+          else if (const Intersection_curve* curve = std::get_if<Intersection_curve>(&inter_objs[k]))
           {
-            curves_col.push_back(curve.first);
+            curves_col.push_back(curve->first);
             /*#ifdef CGAL_DEBUG_ENVELOPE_TEST_3
               std::cout << "intersection between surfaces is a curve: " << curve.first << std::endl;
             #endif
diff --git a/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h b/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h
index 29577fefa43a..194b9fb7a120 100644
--- a/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h
+++ b/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h
@@ -17,7 +17,6 @@
 #include <CGAL/Envelope_3/Envelope_overlay_2.h>
 
 #include <CGAL/Arr_walk_along_line_point_location.h>
-#include <CGAL/Object.h>
 #include <CGAL/enum.h>
 
 #include <iostream>
@@ -130,48 +129,40 @@ class Envelope_triangles_test_3 {
 #endif
 
       // collect the curve in this list, and use sweepline at the end
-      std::list<Object> boundary_list;
       typedef std::pair<X_monotone_curve_2, Oriented_side>     Boundary_xcurve;
+      std::list<std::variant<Boundary_xcurve, Point_2>> boundary_list;
       traits.construct_projected_boundary_2_object()
         (cur_surface, std::back_inserter(boundary_list));
-      std::list<Object>::const_iterator bit;
-      for (bit = boundary_list.begin(); bit != boundary_list.end(); ++bit) {
-        const Object& obj = *bit;
-        Boundary_xcurve boundary_cv;
-        assert(assign(boundary_cv, obj));
-        assign(boundary_cv, obj);
-        curves_col.push_back(boundary_cv.first);
+      for (auto bit = boundary_list.begin(); bit != boundary_list.end(); ++bit) {
+        const Boundary_xcurve* boundary_cv = std::get_if<Boundary_xcurve>(&(*bit));
+        assert(boundary_cv!=nullptr);
+        curves_col.push_back(boundary_cv->first);
       }
       // second, intersect it with all surfaces before it
-      Object cur_obj;
       for (unsigned int j = 0; j < i; ++j) {
         Xy_monotone_surface_3& prev_surface = surfaces[j];
 
-        std::vector<Object> inter_objs;
+        std::vector<std::variant<Intersection_curve,Point_2>> inter_objs;
         traits.construct_projected_intersections_2_object()
           (cur_surface, prev_surface, std::back_inserter(inter_objs));
 
         // we collect all intersections and use sweep to insert them
-        Point_2 point;
-        Intersection_curve curve;
         for(std::size_t k=0; k<inter_objs.size(); ++k)
         {
-          cur_obj = inter_objs[k];
-          assert(!cur_obj.is_empty());
-          if (CGAL::assign(point, cur_obj)) {
+          if (const Point_2* point = std::get_if<Point_2>(&inter_objs[k])) {
 #ifdef CGAL_DEBUG_ENVELOPE_TRIANGLES_TEST_3
               std::cout << "intersection between surfaces is a point: "
                         << point << std::endl;
 #endif
             //insert_vertex(result, point, pl);
-            points_col.push_back(point);
+            points_col.push_back(*point);
           }
-          else if (CGAL::assign(curve, cur_obj)) {
+          else if (const Intersection_curve* curve = std::get_if<Intersection_curve>(&inter_objs[k])) {
 #ifdef CGAL_DEBUG_ENVELOPE_TRIANGLES_TEST_3
               std::cout << "intersection between surfaces is a curve: "
                         << curve.first << std::endl;
 #endif
-            curves_col.push_back(curve.first);
+            curves_col.push_back(curve->first);
             //insert(result, curve.first, pl);
           }
           else
@@ -262,20 +253,17 @@ class Envelope_triangles_test_3 {
     // foreach face in the test envelope, compute a point inside the face,
     // locate it in the other envelope and compare the surfaces over the 2 faces
     Md_point_location pl(env);
-    Object pl_obj;
-    Face_const_handle pl_fh;
-
     Face_iterator fi = test_env.faces_begin();
     bool eq, result = true;
     for (; fi != test_env.faces_end(); ++fi) {
       Face_handle fh = fi;
       if (!fh->is_unbounded()) {
         Point_2 inside_test = compute_point_inside_face(test_env, fh);
-        pl_obj = pl.locate(inside_test);
+        auto pl_obj = pl.locate(inside_test);
         // faces of env must contain the faces of test
-        bool located_in_face = assign(pl_fh, pl_obj);
-        assert(located_in_face);
-        eq = fh->is_equal_data(pl_fh->begin_data(), pl_fh->end_data());
+        const Face_const_handle* pl_fh = std::get_if<Face_const_handle>(&pl_obj);
+        assert(pl_fh!=nullptr);
+        eq = fh->is_equal_data((*pl_fh)->begin_data(), (*pl_fh)->end_data());
         assert(eq);
         result &= eq;
       }
diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 3d9dc82938a0..55f5daa8da7c 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -14,6 +14,14 @@ Release date: October 2023
 - **Breaking change**: The usage of `boost::optional` has been replaced by `std::optional`. Packages affected are 2D Straight Line Skeleton, 3D Fast Intersection and Distance Computation (AABB Tree), and the Kernel intersection.
 - **Breaking change**: The usage of `boost::variant` has been replaced by `std::variant`. Packages affected are 2D Arrangements, and the Kernel intersection.
 
+#### 2D Arrangements
+
+- **Breaking change**: The type of the result of point location queries changed to
+    `std::variant`. The support for the old macro `CGAL_ARR_POINT_LOCATION_VERSION`
+    has been removed.
+
+#### Envelopes of Surfaces in 3D
+- ** Breaking change**: Construct_projected_boundary_2 in `EnvelopeTraits_3` is now using `std::variant` instead of `Object`
 
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------
diff --git a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Arr_labeled_traits_2.h b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Arr_labeled_traits_2.h
index 1cb47858c429..72a3c3758ac3 100644
--- a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Arr_labeled_traits_2.h
+++ b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Arr_labeled_traits_2.h
@@ -299,9 +299,6 @@ class Arr_labeled_traits_2 : public Traits_ {
       typedef std::pair<Base_point_2, Multiplicity>     Intersection_base_point;
       typedef std::variant<Intersection_base_point, Base_x_monotone_curve_2>
                                                         Intersection_base_result;
-      typedef std::pair<Point_2, Multiplicity>     Intersection_point;
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
 
       // In case the curves are adjacent in their curve sequence, we do
       // not have to compute their intersection (we already know that they
@@ -321,8 +318,7 @@ class Arr_labeled_traits_2 : public Traits_ {
 
         if (base_pt != nullptr) {
           // Attach an invalid label to an itersection point.
-          *oi++ = Intersection_result(std::make_pair(Point_2(base_pt->first),
-                                                     base_pt->second));
+          *oi++ = std::make_pair(Point_2(base_pt->first), base_pt->second);
           continue;
         }
 
@@ -331,10 +327,9 @@ class Arr_labeled_traits_2 : public Traits_ {
         CGAL_assertion(base_xcv != nullptr);
 
         // Attach a merged label to the overlapping curve.
-        *oi++ =
-          Intersection_result(X_monotone_curve_2(*base_xcv,
-                                                 X_curve_label(cv1.label(),
-                                                               cv2.label())));
+        *oi++ = X_monotone_curve_2(*base_xcv,
+                                   X_curve_label(cv1.label(),
+                                   cv2.label()));
       }
 
       return oi;

From fb2f2c6642c73b3421860025d736d018e4fd3c5c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 20 Jun 2023 19:11:00 +0200
Subject: [PATCH 0385/1398] remove Object from Minkowski_sum_2

---
 .../CGAL/Arr_circle_segment_traits_2.h        | 95 +++++++++----------
 .../Minkowski_sum_2/Approx_offset_base_2.h    | 26 +++--
 .../Minkowski_sum_2/Exact_offset_base_2.h     | 22 ++---
 3 files changed, 65 insertions(+), 78 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_circle_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_circle_segment_traits_2.h
index dbb909f1e524..f6fbe6217396 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_circle_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_circle_segment_traits_2.h
@@ -584,9 +584,6 @@ class Arr_circle_segment_traits_2 {
     template <typename OutputIterator>
     OutputIterator operator()(const Curve_2& cv, OutputIterator oi) const
     {
-      typedef std::variant<Point_2, X_monotone_curve_2>
-        Make_x_monotone_result;
-
       // Increment the serial number of the curve cv, which will serve as its
       // unique identifier.
       unsigned int index = 0;
@@ -594,10 +591,10 @@ class Arr_circle_segment_traits_2 {
 
       if (cv.orientation() == COLLINEAR) {
         // The curve is a line segment.
-        *oi++ = Make_x_monotone_result(X_monotone_curve_2(cv.supporting_line(),
-                                                          cv.source(),
-                                                          cv.target(),
-                                                          index));
+        *oi++ = X_monotone_curve_2(cv.supporting_line(),
+                                   cv.source(),
+                                   cv.target(),
+                                   index);
         return oi;
       }
 
@@ -608,8 +605,8 @@ class Arr_circle_segment_traits_2 {
 
       if (sign_rad == ZERO) {
         // Create an isolated point.
-        *oi++ = Make_x_monotone_result(Point_2(circ.center().x(),
-                                               circ.center().y()));
+        *oi++ = Point_2(circ.center().x(),
+                        circ.center().y());
         return oi;
       }
 
@@ -622,59 +619,59 @@ class Arr_circle_segment_traits_2 {
         CGAL_assertion (n_vpts == 2);
 
         // Subdivide the circle into two arcs (an upper and a lower half).
-        *oi++ = Make_x_monotone_result(X_monotone_curve_2(circ,
-                                                          vpts[0], vpts[1],
-                                                          cv.orientation(),
-                                                          index));
-
-        *oi++ = Make_x_monotone_result(X_monotone_curve_2(circ,
-                                                          vpts[1], vpts[0],
-                                                          cv.orientation(),
-                                                          index));
+        *oi++ = X_monotone_curve_2(circ,
+                                   vpts[0], vpts[1],
+                                   cv.orientation(),
+                                   index);
+
+        *oi++ = X_monotone_curve_2(circ,
+                                   vpts[1], vpts[0],
+                                   cv.orientation(),
+                                   index);
       }
       else {
         // Act according to the number of vertical tangency points.
         if (n_vpts == 2) {
           // Subdivide the circular arc into three x-monotone arcs.
-          *oi++ = Make_x_monotone_result(X_monotone_curve_2(circ,
-                                                            cv.source(), vpts[0],
-                                                            cv.orientation(),
-                                                            index));
-
-          *oi++ = Make_x_monotone_result(X_monotone_curve_2(circ,
-                                                            vpts[0], vpts[1],
-                                                            cv.orientation(),
-                                                            index));
-
-          *oi++ = Make_x_monotone_result(X_monotone_curve_2(circ,
-                                                            vpts[1],
-                                                            cv.target(),
-                                                            cv.orientation(),
-                                                            index));
+          *oi++ = X_monotone_curve_2(circ,
+                                     cv.source(), vpts[0],
+                                     cv.orientation(),
+                                     index);
+
+          *oi++ = X_monotone_curve_2(circ,
+                                     vpts[0], vpts[1],
+                                     cv.orientation(),
+                                     index);
+
+          *oi++ = X_monotone_curve_2(circ,
+                                     vpts[1],
+                                     cv.target(),
+                                     cv.orientation(),
+                                     index);
         }
         else if (n_vpts == 1) {
           // Subdivide the circular arc into two x-monotone arcs.
-          *oi++ = Make_x_monotone_result(X_monotone_curve_2(circ,
-                                                            cv.source(),
-                                                            vpts[0],
-                                                            cv.orientation(),
-                                                            index));
-
-          *oi++ = Make_x_monotone_result(X_monotone_curve_2(circ,
-                                                            vpts[0],
-                                                            cv.target(),
-                                                            cv.orientation(),
-                                                            index));
+          *oi++ = X_monotone_curve_2(circ,
+                                     cv.source(),
+                                     vpts[0],
+                                     cv.orientation(),
+                                     index);
+
+          *oi++ = X_monotone_curve_2(circ,
+                                     vpts[0],
+                                     cv.target(),
+                                     cv.orientation(),
+                                     index);
         }
         else {
           CGAL_assertion(n_vpts == 0);
 
           // The arc is already x-monotone:
-          *oi++ = Make_x_monotone_result(X_monotone_curve_2(circ,
-                                                            cv.source(),
-                                                            cv.target(),
-                                                            cv.orientation(),
-                                                            index));
+          *oi++ = X_monotone_curve_2(circ,
+                                     cv.source(),
+                                     cv.target(),
+                                     cv.orientation(),
+                                     index);
         }
       }
 
diff --git a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Approx_offset_base_2.h b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Approx_offset_base_2.h
index ffbb4e4249fe..8a9ed4a74552 100644
--- a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Approx_offset_base_2.h
+++ b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Approx_offset_base_2.h
@@ -168,12 +168,10 @@ class Approx_offset_base_2
     typename Kernel::Orientation_2    f_orient = ker.orientation_2_object();
 
     Traits_2                        traits;
-    std::list<Object>               xobjs;
-    std::list<Object>::iterator     xobj_it;
+    std::list<std::variant<Tr_point_2, X_monotone_curve_2>>               xobjs;
     typename Traits_2::Make_x_monotone_2
                        f_make_x_monotone = traits.make_x_monotone_2_object();
     Curve_2                         arc;
-    X_monotone_curve_2              xarc;
 
     do
     {
@@ -517,12 +515,11 @@ class Approx_offset_base_2
           // convolution cycle.
           xobjs.clear();
           f_make_x_monotone (arc, std::back_inserter(xobjs));
-          for (xobj_it = xobjs.begin(); xobj_it != xobjs.end(); ++xobj_it) {
-            assign_success = CGAL::assign (xarc, *xobj_it);
-            CGAL_assertion (assign_success);
-            CGAL_USE(assign_success);
-            *oi++ = Labeled_curve_2 (xarc,
-                                     X_curve_label (xarc.is_directed_right(),
+          for (auto xobj_it = xobjs.begin(); xobj_it != xobjs.end(); ++xobj_it) {
+            const X_monotone_curve_2* xarc = std::get_if<X_monotone_curve_2>(&(*xobj_it));
+            CGAL_assertion(xarc!=nullptr);
+            *oi++ = Labeled_curve_2 (*xarc,
+                                     X_curve_label (xarc->is_directed_right(),
                                                     cycle_id, curve_index++));
           }
         }
@@ -571,18 +568,17 @@ class Approx_offset_base_2
     xobjs.clear();
     f_make_x_monotone (arc, std::back_inserter(xobjs));
 
-    xobj_it = xobjs.begin();
+    auto xobj_it = xobjs.begin();
     while (xobj_it != xobjs.end())
     {
-      assign_success = CGAL::assign (xarc, *xobj_it);
-      CGAL_assertion (assign_success);
-      CGAL_USE(assign_success);
+      const X_monotone_curve_2* xarc = std::get_if<X_monotone_curve_2>(&(*xobj_it));
+      CGAL_assertion (xarc != nullptr);
 
       ++xobj_it;
       bool is_last = (xobj_it == xobjs.end());
 
-      *oi++ = Labeled_curve_2 (xarc,
-                               X_curve_label (xarc.is_directed_right(),
+      *oi++ = Labeled_curve_2 (*xarc,
+                               X_curve_label (xarc->is_directed_right(),
                                               cycle_id, curve_index++, is_last));
     }
 
diff --git a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Exact_offset_base_2.h b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Exact_offset_base_2.h
index ca77157ec5c0..2220f1f536e9 100644
--- a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Exact_offset_base_2.h
+++ b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/Exact_offset_base_2.h
@@ -117,7 +117,7 @@ class Exact_offset_base_2 {
     Algebraic a, b, c;
 
     unsigned int curve_index(0);
-    std::list<Object> xobjs;
+    std::list<std::variant<typename Traits_2::Point_2,X_monotone_curve_2>> xobjs;
 
     Traits_2 traits;
     auto nt_traits = traits.nt_traits();
@@ -127,8 +127,6 @@ class Exact_offset_base_2 {
     auto alg_ker = traits.alg_kernel();
     auto f_equal = alg_ker->equal_2_object();
 
-    bool assign_success;
-
     do {
       // Get a circulator for the next vertex (in the proper orientation).
       if (forward) ++next;
@@ -185,13 +183,11 @@ class Exact_offset_base_2 {
           f_make_x_monotone(arc, std::back_inserter(xobjs));
 
           for (auto xobj_it = xobjs.begin(); xobj_it != xobjs.end(); ++xobj_it) {
-            X_monotone_curve_2 xarc;
-            assign_success = CGAL::assign(xarc, *xobj_it);
-            CGAL_assertion (assign_success);
-            CGAL_USE(assign_success);
+            const X_monotone_curve_2* xarc = std::get_if<X_monotone_curve_2>(&(*xobj_it));
+            CGAL_assertion (xarc!=nullptr);
 
-            *oi++ = Labeled_curve_2(xarc, X_curve_label(xarc.is_directed_right(),
-                                                        cycle_id, curve_index));
+            *oi++ = Labeled_curve_2(*xarc, X_curve_label(xarc->is_directed_right(),
+                                                         cycle_id, curve_index));
             curve_index++;
           }
         }
@@ -237,15 +233,13 @@ class Exact_offset_base_2 {
 
       auto xobj_it = xobjs.begin();
       while (xobj_it != xobjs.end()) {
-        X_monotone_curve_2 xarc;
-        assign_success = CGAL::assign(xarc, *xobj_it);
-        CGAL_assertion (assign_success);
-        CGAL_USE(assign_success);
+        const X_monotone_curve_2* xarc = std::get_if<X_monotone_curve_2>(&(*xobj_it));
+        CGAL_assertion (xarc!=nullptr);
 
         ++xobj_it;
         is_last = (xobj_it == xobjs.end());
 
-        *oi++ = Labeled_curve_2(xarc, X_curve_label(xarc.is_directed_right(),
+        *oi++ = Labeled_curve_2(*xarc, X_curve_label(xarc->is_directed_right(),
                                                     cycle_id, curve_index,
                                                     is_last));
         curve_index++;

From 9969210023349623cb0d6670b68abd78fc8231f2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 21 Jun 2023 11:17:55 +0200
Subject: [PATCH 0386/1398] make is compatible with back inserter

---
 Boolean_set_operations_2/include/CGAL/General_polygon_2.h | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Boolean_set_operations_2/include/CGAL/General_polygon_2.h b/Boolean_set_operations_2/include/CGAL/General_polygon_2.h
index 93469d5e93b5..f43a41e27098 100644
--- a/Boolean_set_operations_2/include/CGAL/General_polygon_2.h
+++ b/Boolean_set_operations_2/include/CGAL/General_polygon_2.h
@@ -38,6 +38,7 @@ class General_polygon_2
   typedef std::list<X_monotone_curve_2>              Containter;
   typedef typename Containter::iterator              Curve_iterator;
   typedef typename Containter::const_iterator        Curve_const_iterator;
+  typedef X_monotone_curve_2                         value_type;
 
 protected:
   std::list<X_monotone_curve_2>    m_xcurves;

From 7d0dd109b3ce554bd62550e59c0865a76d28717b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 21 Jun 2023 11:19:58 +0200
Subject: [PATCH 0387/1398] fix for variant/optional<variant>

---
 STL_Extension/include/CGAL/iterator.h | 13 +++++++++++++
 1 file changed, 13 insertions(+)

diff --git a/STL_Extension/include/CGAL/iterator.h b/STL_Extension/include/CGAL/iterator.h
index 95295f89f836..e8651c072939 100644
--- a/STL_Extension/include/CGAL/iterator.h
+++ b/STL_Extension/include/CGAL/iterator.h
@@ -1457,6 +1457,19 @@ class Dispatch_or_drop_output_iterator < std::tuple<V...>, std::tuple<O...> >
   template <class T>
   Self& operator=(const T&) { return *this; }
 
+  template<typename ... T>
+  Self& operator=(const std::variant< T ... >& t) {
+    internal::Output_visitor<Self> visitor(this);
+    std::visit(visitor, t);
+    return *this;
+  }
+
+  template<typename ... T>
+  Self& operator=(const std::optional< std::variant< T ... > >& t) {
+    internal::Output_visitor<Self> visitor(this);
+    if(t)  std::visit(visitor, *t);
+    return *this;
+  }
 };
 
 

From f65aa68bd23f6e26fbbf0966d3c13db2ee00d526 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 21 Jun 2023 11:20:31 +0200
Subject: [PATCH 0388/1398] use dispatch_or_drop_output to replace Object

---
 .../bezier_traits_adapter2.cpp                | 12 ++-----
 .../circle_segment.cpp                        | 18 ++++------
 .../conic_traits_adapter.cpp                  | 11 ++----
 .../Boolean_set_operations_2/set_union.cpp    | 16 +++------
 .../include/CGAL/IO/Dxf_bsop_reader.h         | 34 +++++--------------
 5 files changed, 23 insertions(+), 68 deletions(-)

diff --git a/Boolean_set_operations_2/examples/Boolean_set_operations_2/bezier_traits_adapter2.cpp b/Boolean_set_operations_2/examples/Boolean_set_operations_2/bezier_traits_adapter2.cpp
index 853340f86d22..d99e287d40b3 100644
--- a/Boolean_set_operations_2/examples/Boolean_set_operations_2/bezier_traits_adapter2.cpp
+++ b/Boolean_set_operations_2/examples/Boolean_set_operations_2/bezier_traits_adapter2.cpp
@@ -3,6 +3,7 @@
  */
 
 #include <CGAL/config.h>
+#include <CGAL/iterator.h>
 
 #ifndef CGAL_USE_CORE
 #include <iostream>
@@ -108,22 +109,13 @@ bool read_bezier(char const* aFileName, Bezier_polygon_set& rSet)
           for (unsigned int k = 0; k < n_curves; ++k) {
             // Read the current curve and subdivide it into x-monotone subcurves.
 
-            std::list<CGAL::Object>                 x_objs;
-            std::list<CGAL::Object>::const_iterator xoit;
-            Bezier_X_monotone_curve                 xcv;
             Bezier_traits                           traits;
             Bezier_traits::Make_x_monotone_2        make_x_monotone =
               traits.make_x_monotone_2_object();
 
             Bezier_curve B = read_bezier_curve(in_file, lDoubleFormat);
             if (B.number_of_control_points() >= 2) {
-
-              make_x_monotone(B, std::back_inserter(x_objs));
-
-              for (xoit = x_objs.begin(); xoit != x_objs.end(); ++xoit) {
-                if (CGAL::assign(xcv, *xoit))
-                  xcvs.push_back(xcv);
-              }
+              make_x_monotone(B, CGAL::dispatch_or_drop_output<Bezier_X_monotone_curve>(std::back_inserter(xcvs)));
             }
           }
 
diff --git a/Boolean_set_operations_2/examples/Boolean_set_operations_2/circle_segment.cpp b/Boolean_set_operations_2/examples/Boolean_set_operations_2/circle_segment.cpp
index 7cf3ec3dc7be..02bf08f58caf 100644
--- a/Boolean_set_operations_2/examples/Boolean_set_operations_2/circle_segment.cpp
+++ b/Boolean_set_operations_2/examples/Boolean_set_operations_2/circle_segment.cpp
@@ -6,6 +6,7 @@
 #include <CGAL/Gps_circle_segment_traits_2.h>
 #include <CGAL/General_polygon_set_2.h>
 #include <CGAL/Lazy_exact_nt.h>
+#include <CGAL/iterator.h>
 
 #include <list>
 #include <cassert>
@@ -24,22 +25,15 @@ typedef Traits_2::X_monotone_curve_2                      X_monotone_curve_2;
 // Construct a polygon from a circle.
 Polygon_2 construct_polygon (const Circle_2& circle)
 {
-  // Subdivide the circle into two x-monotone arcs.
+  // Subdivide the circle into two x-monotone arcs and construct the polygon.
   Traits_2 traits;
   Curve_2 curve (circle);
-  std::list<CGAL::Object>  objects;
-  traits.make_x_monotone_2_object() (curve, std::back_inserter(objects));
-  assert(objects.size() == 2);
-
-  // Construct the polygon.
   Polygon_2 pgn;
-  X_monotone_curve_2 arc;
-  std::list<CGAL::Object>::iterator iter;
 
-  for (iter = objects.begin(); iter != objects.end(); ++iter) {
-    CGAL::assign (arc, *iter);
-    pgn.push_back (arc);
-  }
+  traits.make_x_monotone_2_object() (curve,
+    CGAL::dispatch_or_drop_output<X_monotone_curve_2>(std::back_inserter(pgn)));
+  std::cout << "size: " << pgn.size() << "\n";
+  assert(pgn.size() == 2);
 
   return pgn;
 }
diff --git a/Boolean_set_operations_2/examples/Boolean_set_operations_2/conic_traits_adapter.cpp b/Boolean_set_operations_2/examples/Boolean_set_operations_2/conic_traits_adapter.cpp
index a35c90e29c64..f215b1a5267b 100644
--- a/Boolean_set_operations_2/examples/Boolean_set_operations_2/conic_traits_adapter.cpp
+++ b/Boolean_set_operations_2/examples/Boolean_set_operations_2/conic_traits_adapter.cpp
@@ -3,6 +3,7 @@
  */
 
 #include <CGAL/config.h>
+#include <CGAL/iterator.h>
 
 #ifndef CGAL_USE_CORE
 #include <iostream>
@@ -42,14 +43,8 @@ typedef Traits_2::Point_2                               Point_2;
 // sub-arcs and append these sub-arcs as polygon edges.
 void append_conic_arc(Polygon_2& polygon, const Curve_2& arc) {
   Conic_traits_2 traits;
-  std::list<CGAL::Object> objects;
-  X_monotone_curve_2 xarc;
-
-  traits.make_x_monotone_2_object() (arc, std::back_inserter(objects));
-  for (auto it = objects.begin(); it != objects.end(); ++it) {
-    if (CGAL::assign (xarc, *it))
-      polygon.push_back (xarc);
-  }
+  traits.make_x_monotone_2_object() (arc,
+    CGAL::dispatch_or_drop_output<X_monotone_curve_2>(std::back_inserter(polygon)));
 }
 
 int main() {
diff --git a/Boolean_set_operations_2/examples/Boolean_set_operations_2/set_union.cpp b/Boolean_set_operations_2/examples/Boolean_set_operations_2/set_union.cpp
index cecacc9a107d..8ff0ced217f7 100644
--- a/Boolean_set_operations_2/examples/Boolean_set_operations_2/set_union.cpp
+++ b/Boolean_set_operations_2/examples/Boolean_set_operations_2/set_union.cpp
@@ -25,22 +25,14 @@ typedef Traits_2::X_monotone_curve_2                      X_monotone_curve_2;
 // Construct a polygon from a circle.
 Polygon_2 construct_polygon (const Circle_2& circle)
 {
-  // Subdivide the circle into two x-monotone arcs.
+  // Subdivide the circle into two x-monotone arcs and construct the polygon
   Traits_2 traits;
   Curve_2 curve (circle);
-  std::list<CGAL::Object> objects;
-  traits.make_x_monotone_2_object() (curve, std::back_inserter(objects));
-  assert(objects.size() == 2);
-
-  // Construct the polygon.
   Polygon_2 pgn;
-  X_monotone_curve_2 arc;
-  std::list<CGAL::Object>::iterator iter;
 
-  for (iter = objects.begin(); iter != objects.end(); ++iter) {
-    CGAL::assign (arc, *iter);
-    pgn.push_back (arc);
-  }
+  traits.make_x_monotone_2_object() (curve,
+    CGAL::dispatch_or_drop_output<X_monotone_curve_2>(std::back_inserter(pgn)));
+  assert(pgn.size() == 2);
 
   return pgn;
 }
diff --git a/Boolean_set_operations_2/include/CGAL/IO/Dxf_bsop_reader.h b/Boolean_set_operations_2/include/CGAL/IO/Dxf_bsop_reader.h
index 1645afc1354e..986ba9e86e12 100644
--- a/Boolean_set_operations_2/include/CGAL/IO/Dxf_bsop_reader.h
+++ b/Boolean_set_operations_2/include/CGAL/IO/Dxf_bsop_reader.h
@@ -25,6 +25,7 @@
 #include <CGAL/Gps_circle_segment_traits_2.h>
 #include <CGAL/General_polygon_set_2.h>
 #include <CGAL/squared_distance_2.h>
+#include <CGAL/iterator.h>
 
 namespace CGAL {
 
@@ -97,29 +98,19 @@ class Dxf_bsop_reader
     typename Traits_2::Make_x_monotone_2 make_x_monotone =
                                              traits.make_x_monotone_2_object();
     typename Dxf_circles_list::iterator  circ_it;
-    CGAL::Object                         obj_vec[3];
-    CGAL::Object                        *obj_begin = (obj_vec + 0);
-    CGAL::Object                        *obj_end;
-    X_monotone_curve_2                   cv1, cv2;
 
     for (circ_it = circles.begin(); circ_it != circles.end(); ++circ_it)
     {
       // Break the circle into two x-monotone circular arcs.
       const Dxf_circle_2&  dxf_circ = *circ_it;
       Curve_2              circ (dxf_circ.first, dxf_circ.second);
+      Circ_polygon_2       pgn;
 
-      obj_end = make_x_monotone (circ, obj_begin);
-      CGAL_assertion(obj_end - obj_begin == 2);
-
-      CGAL::assign(cv1, obj_vec[0]);
-      CGAL::assign(cv2, obj_vec[1]);
+      make_x_monotone (circ,
+        CGAL::dispatch_or_drop_output<X_monotone_curve_2>(std::back_inserter(pgn)));
+      CGAL_assertion(pgn.size() == 2);
 
-      // Generate the corresponding polygon.
-      Circ_polygon_2       pgn;
-      pgn.push_back (cv1);
-      pgn.push_back (cv2);
-      *pgns = pgn;
-      ++pgns;
+      *pgns++ = pgn;
     }
 
     circles.clear();
@@ -131,8 +122,6 @@ class Dxf_bsop_reader
     typename Dxf_polygon_2::iterator      curr, next;
     Point_2                               ps, pt;
     Circle_2                              supp_circ;
-    std::size_t                           n_subarcs;
-    std::size_t                           i;
 
     for (pgn_it = polygons.begin(); pgn_it != polygons.end(); ++pgn_it)
     {
@@ -184,15 +173,8 @@ class Dxf_bsop_reader
 
           // Break the arc into x-monotone subarcs (there can be at most
           // three subarcs) and add them to the polygon.
-          obj_end = make_x_monotone (circ_arc, obj_begin);
-          n_subarcs = (obj_end - obj_begin);
-          CGAL_assertion (n_subarcs <= 3);
-
-          for (i = 0; i < n_subarcs; i++)
-          {
-            if (CGAL::assign (cv1, obj_vec[i]))
-              pgn.push_back (cv1);
-          }
+          make_x_monotone (circ_arc,
+            CGAL::dispatch_or_drop_output<X_monotone_curve_2>(std::back_inserter(pgn)));
         }
         else
         {

From c4f4bc4cac82b8226d605cdb72fb713bc0c5ddaf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 21 Jun 2023 13:15:56 +0200
Subject: [PATCH 0389/1398] Work on display property plugin (+ heat method)

- separated property display and Heat method into two independent plugins
- redesigned UIs
- added "Largest Angle per face" and "face areas" to the display properties
- enable using a selection item to select heat method's source vertices
- fixed smallest angle computation
- fixed storing wrong display values
- fixed applicable() returning true too often
- fixed zoom not working for property maps other than the plugin's
- fixed zoom not working for simplices other than faces
- fixed zoom not working for point sets
- fixed color map ignoring the user's color choice
- fixed property combobox resetting on pretty much other action
- fixed not resetting colors when items are modified
- fixed broken connections in the heat method plugin
- fixed not actually emitting anything when a list selection is changed
- much more stuff
---
 Polyhedron/demo/Polyhedron/Color_map.h        |   32 +-
 Polyhedron/demo/Polyhedron/MainWindow.cpp     |    4 +-
 .../Polyhedron/Plugins/Display/CMakeLists.txt |   21 +-
 .../Plugins/Display/Display_property.ui       |  448 +--
 .../Display/Display_property_plugin.cpp       | 2833 +++++++----------
 .../Polyhedron/Plugins/Display/Heat_method.ui |  294 ++
 .../Plugins/Display/Heat_method_plugin.cpp    |  822 +++++
 .../PMP/Join_and_split_polyhedra_plugin.cpp   |    2 +-
 Polyhedron/demo/Polyhedron/SMesh_type.h       |   10 +-
 Polyhedron/demo/Polyhedron/Scene.cpp          |   97 +-
 Polyhedron/demo/Polyhedron/Scene.h            |   37 +-
 .../Polyhedron/Scene_surface_mesh_item.cpp    |   13 +-
 .../demo/Polyhedron/include/id_printing.h     |  415 ++-
 .../demo/Polyhedron/triangulate_primitive.h   |  320 +-
 Three/include/CGAL/Three/Scene_interface.h    |    1 -
 Three/include/CGAL/Three/Scene_item.h         |    2 +-
 Three/include/CGAL/Three/Viewer_interface.h   |    2 +-
 17 files changed, 2982 insertions(+), 2371 deletions(-)
 create mode 100644 Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method.ui
 create mode 100644 Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp

diff --git a/Polyhedron/demo/Polyhedron/Color_map.h b/Polyhedron/demo/Polyhedron/Color_map.h
index a55f0c658d28..150d1424b92f 100644
--- a/Polyhedron/demo/Polyhedron/Color_map.h
+++ b/Polyhedron/demo/Polyhedron/Color_map.h
@@ -3,13 +3,17 @@
 
 #include <QColor>
 
-inline QColor generate_color(double h, double s_min = 0.35)
+#include <stdlib.h>
+#include <iostream>
+
+inline QColor generate_color(double h,
+                             double s_min = 0.35)
 {
-  std::size_t s_max=255;
-  if(h >0.8 && h < 0.95) //span of ugly pink, desaturates make it less garish IMO
+  std::size_t s_max = 255;
+  if(h > 0.8 && h < 0.95) // span of ugly pink, desaturates make it less garish IMO
     s_max = 160;
   std::size_t s = std::rand() % (s_max-static_cast<std::size_t>(s_min*255)) + static_cast<int>(s_min*255);
-  return QColor::fromHsvF(h,s/255.0,1.0);
+  return QColor::fromHsvF(h, s/255.0, 1.0);
 }
 
 
@@ -22,19 +26,23 @@ compute_color_map(QColor base_color,
   qreal hue = base_color.hueF();
   const qreal step = (static_cast<qreal>(1)) / nb_of_colors;
 
-  qreal h = hue==-1 ? 0
-                    :hue;
-  for(unsigned i = 0; i < nb_of_colors; ++i) {
-    if (h!=-1) h += step;
-    if ( h > 1 ) { h -= 1; }
+  qreal h = (hue == -1) ? 0 : hue;
+  for(std::size_t i=0; i<nb_of_colors; ++i)
+  {
+    if(h != -1)
+      h += step;
+    if(h > 1)
+      h -= 1;
     *out++ = generate_color(h);
   }
+
   return out;
 }
 
-inline QColor generate_random_color() {
+inline QColor generate_random_color()
+{
   std::size_t h = static_cast<std::size_t>(std::rand() % 360);
-  return generate_color(h/359.0);
+  return generate_color(h / 359.0);
 }
 
-#endif
+#endif // _COLOR_MAP_H
diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index 39c537dea5b0..99c722048ee3 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -1440,7 +1440,7 @@ QList<int> MainWindow::getSelectedSceneItemIndices() const
 void MainWindow::selectionChanged()
 {
   scene->setSelectedItemIndex(getSelectedSceneItemIndex());
-  scene->setSelectedItemsList(getSelectedSceneItemIndices());
+  scene->setSelectedItemIndices(getSelectedSceneItemIndices());
   CGAL::Three::Scene_item* item = scene->item(getSelectedSceneItemIndex());
   Q_FOREACH(CGAL::QGLViewer* vi, CGAL::QGLViewer::QGLViewerPool())
   {
@@ -2193,7 +2193,7 @@ void MainWindow::on_actionEraseAll_triggered()
   QList<int> all_ids;
   for(int i = 0; i < scene->numberOfEntries(); ++i)
     all_ids.push_back(i);
-  scene->setSelectedItemsList(all_ids);
+  scene->setSelectedItemIndices(all_ids);
   on_actionErase_triggered();
 }
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Display/CMakeLists.txt
index 6e1c99909175..10b1c254b1e1 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/CMakeLists.txt
@@ -1,11 +1,16 @@
 include(polyhedron_demo_macros)
+
+qt5_wrap_ui(display_propertyUI_FILES Display_property.ui)
+polyhedron_demo_plugin(display_property_plugin Display_property_plugin ${display_propertyUI_FILES} KEYWORDS Viewer)
+target_link_libraries(display_property_plugin PUBLIC scene_surface_mesh_item
+                                                     scene_points_with_normal_item
+                                                     scene_color_ramp)
+
 if(TARGET CGAL::Eigen3_support)
-  qt5_wrap_ui( display_propertyUI_FILES Display_property.ui )
-  polyhedron_demo_plugin(display_property_plugin Display_property_plugin ${display_propertyUI_FILES} KEYWORDS Viewer)
-  target_link_libraries(display_property_plugin
-    PUBLIC
-    scene_surface_mesh_item
-    scene_points_with_normal_item
-    scene_color_ramp
-    CGAL::Eigen3_support)
+  qt5_wrap_ui(heat_methodUI_FILES Heat_method.ui)
+  polyhedron_demo_plugin(heat_method_plugin Heat_method_plugin ${heat_methodUI_FILES} KEYWORDS Viewer)
+  target_link_libraries(heat_method_plugin PUBLIC scene_surface_mesh_item
+                                                  scene_selection_item
+                                                  scene_color_ramp
+                                                  CGAL::Eigen3_support)
 endif()
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
index 7a5a19621f42..656ec4827c55 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
@@ -2,26 +2,202 @@
 <ui version="4.0">
  <class>DisplayPropertyWidget</class>
  <widget class="QDockWidget" name="DisplayPropertyWidget">
+  <property name="enabled">
+   <bool>false</bool>
+  </property>
   <property name="geometry">
    <rect>
     <x>0</x>
     <y>0</y>
-    <width>292</width>
-    <height>508</height>
+    <width>514</width>
+    <height>695</height>
    </rect>
   </property>
+  <property name="minimumSize">
+   <size>
+    <width>514</width>
+    <height>695</height>
+   </size>
+  </property>
   <property name="windowTitle">
-   <string>Property Displaying</string>
+   <string>Property Display</string>
   </property>
   <widget class="QWidget" name="dockWidgetContents">
-   <layout class="QVBoxLayout" name="verticalLayout" stretch="0,0,0">
-    <item>
-     <layout class="QHBoxLayout" name="horizontalLayout_3" stretch="0,0">
-      <item>
-       <widget class="QScrollArea" name="scrollArea">
-        <property name="horizontalScrollBarPolicy">
-         <enum>Qt::ScrollBarAlwaysOff</enum>
+   <layout class="QGridLayout" name="gridLayout_3">
+    <item row="9" column="0" colspan="2">
+     <widget class="QPushButton" name="colorizeButton">
+      <property name="font">
+       <font>
+        <family>Cantarell</family>
+        <bold>true</bold>
+       </font>
+      </property>
+      <property name="text">
+       <string>Color Item</string>
+      </property>
+     </widget>
+    </item>
+    <item row="0" column="0" colspan="2">
+     <widget class="QGroupBox" name="propertyGroup">
+      <property name="title">
+       <string>Property</string>
+      </property>
+      <layout class="QVBoxLayout" name="verticalLayout_2">
+       <property name="leftMargin">
+        <number>6</number>
+       </property>
+       <property name="topMargin">
+        <number>6</number>
+       </property>
+       <property name="rightMargin">
+        <number>6</number>
+       </property>
+       <property name="bottomMargin">
+        <number>6</number>
+       </property>
+       <item>
+        <widget class="QComboBox" name="propertyBox">
+         <property name="sizeAdjustPolicy">
+          <enum>QComboBox::AdjustToContents</enum>
+         </property>
+         <item>
+          <property name="text">
+           <string>Smallest Angle Per Face</string>
+          </property>
+         </item>
+         <item>
+          <property name="text">
+           <string>Scaled Jacobian</string>
+          </property>
+         </item>
+         <item>
+          <property name="text">
+           <string>Heat Intensity</string>
+          </property>
+         </item>
+         <item>
+          <property name="text">
+           <string>Heat Intensity (Intrinsic Delaunay)</string>
+          </property>
+         </item>
+        </widget>
+       </item>
+      </layout>
+     </widget>
+    </item>
+    <item row="1" column="0">
+     <layout class="QGridLayout" name="ColoringGroup" columnstretch="50,50">
+      <item row="0" column="0">
+       <spacer name="verticalSpacer">
+        <property name="orientation">
+         <enum>Qt::Vertical</enum>
         </property>
+        <property name="sizeHint" stdset="0">
+         <size>
+          <width>20</width>
+          <height>40</height>
+         </size>
+        </property>
+       </spacer>
+      </item>
+      <item row="1" column="0">
+       <widget class="QGroupBox" name="coloringChoiceGroup">
+        <property name="title">
+         <string>Color Visualization</string>
+        </property>
+        <layout class="QGridLayout" name="gridLayout_2" columnstretch="50,50">
+         <property name="leftMargin">
+          <number>0</number>
+         </property>
+         <property name="topMargin">
+          <number>0</number>
+         </property>
+         <property name="rightMargin">
+          <number>0</number>
+         </property>
+         <property name="bottomMargin">
+          <number>0</number>
+         </property>
+         <item row="8" column="0">
+          <widget class="QRadioButton" name="randomColorsRadioButton">
+           <property name="text">
+            <string>Random colors</string>
+           </property>
+          </widget>
+         </item>
+         <item row="3" column="1">
+          <widget class="QPushButton" name="minColorButton">
+           <property name="styleSheet">
+            <string notr="true"/>
+           </property>
+           <property name="text">
+            <string/>
+           </property>
+          </widget>
+         </item>
+         <item row="9" column="0">
+          <widget class="QLabel" name="initColorLabel">
+           <property name="text">
+            <string>First color</string>
+           </property>
+          </widget>
+         </item>
+         <item row="5" column="0">
+          <widget class="QLabel" name="maxColorLabel">
+           <property name="text">
+            <string>Max color</string>
+           </property>
+          </widget>
+         </item>
+         <item row="2" column="0" colspan="2">
+          <widget class="QRadioButton" name="colorRampRadioButton">
+           <property name="text">
+            <string>Color Ramp</string>
+           </property>
+           <property name="checked">
+            <bool>true</bool>
+           </property>
+          </widget>
+         </item>
+         <item row="9" column="1">
+          <widget class="QPushButton" name="initColorButton">
+           <property name="text">
+            <string/>
+           </property>
+          </widget>
+         </item>
+         <item row="5" column="1">
+          <widget class="QPushButton" name="maxColorButton">
+           <property name="text">
+            <string/>
+           </property>
+          </widget>
+         </item>
+         <item row="3" column="0">
+          <widget class="QLabel" name="minColorLabel">
+           <property name="text">
+            <string>Min color</string>
+           </property>
+          </widget>
+         </item>
+        </layout>
+       </widget>
+      </item>
+      <item row="2" column="0">
+       <spacer name="verticalSpacer_4">
+        <property name="orientation">
+         <enum>Qt::Vertical</enum>
+        </property>
+        <property name="sizeHint" stdset="0">
+         <size>
+          <width>20</width>
+          <height>40</height>
+         </size>
+        </property>
+       </spacer>
+      </item>
+      <item row="0" column="1" rowspan="3">
+       <widget class="QScrollArea" name="scrollArea">
         <property name="widgetResizable">
          <bool>true</bool>
         </property>
@@ -30,12 +206,12 @@
           <rect>
            <x>0</x>
            <y>0</y>
-           <width>127</width>
-           <height>430</height>
+           <width>236</width>
+           <height>397</height>
           </rect>
          </property>
-         <layout class="QVBoxLayout" name="verticalLayout_7">
-          <item>
+         <layout class="QGridLayout" name="gridLayout_5">
+          <item row="0" column="0" alignment="Qt::AlignHCenter">
            <widget class="QLabel" name="legendLabel">
             <property name="text">
              <string>RAMP DISPLAYING</string>
@@ -46,206 +222,70 @@
         </widget>
        </widget>
       </item>
-      <item>
-       <layout class="QGridLayout" name="gridLayout">
-        <item row="4" column="0">
-         <widget class="QLabel" name="label_3">
-          <property name="text">
-           <string/>
-          </property>
-         </widget>
-        </item>
-        <item row="3" column="0">
-         <widget class="QLabel" name="label_2">
-          <property name="text">
-           <string/>
-          </property>
-         </widget>
-        </item>
-        <item row="4" column="1">
-         <widget class="QPushButton" name="colorizeButton">
-          <property name="text">
-           <string>Colorize</string>
-          </property>
-         </widget>
-        </item>
-        <item row="2" column="1">
-         <widget class="QTabWidget" name="colorChoiceWidget">
-          <property name="currentIndex">
-           <number>0</number>
-          </property>
-          <widget class="QWidget" name="ramp_tab">
-           <attribute name="title">
-            <string>Ramp</string>
-           </attribute>
-           <layout class="QVBoxLayout" name="verticalLayout_5">
-            <item>
-             <widget class="QGroupBox" name="groupBox_2">
-              <property name="title">
-               <string>Ramp Colors</string>
-              </property>
-              <layout class="QVBoxLayout" name="verticalLayout_3">
-               <item>
-                <widget class="QPushButton" name="minColorButton">
-                 <property name="text">
-                  <string>Color Min...</string>
-                 </property>
-                </widget>
-               </item>
-               <item>
-                <widget class="QPushButton" name="maxColorButton">
-                 <property name="text">
-                  <string>Color Max...</string>
-                 </property>
-                </widget>
-               </item>
-              </layout>
-             </widget>
-            </item>
-           </layout>
-          </widget>
-          <widget class="QWidget" name="map_tab">
-           <attribute name="title">
-            <string>Map</string>
-           </attribute>
-           <layout class="QVBoxLayout" name="verticalLayout_6">
-            <item>
-             <widget class="QPushButton" name="initColorButton">
-              <property name="text">
-               <string>Initial Color...</string>
-              </property>
-             </widget>
-            </item>
-           </layout>
-          </widget>
-         </widget>
-        </item>
-        <item row="6" column="1">
-         <widget class="QPushButton" name="sourcePointsButton">
-          <property name="text">
-           <string>Select Source Points</string>
-          </property>
-          <property name="checkable">
-           <bool>true</bool>
-          </property>
-         </widget>
-        </item>
-        <item row="3" column="1">
-         <widget class="QGroupBox" name="groupBox_3">
-          <property name="title">
-           <string>Zoom </string>
-          </property>
-          <layout class="QVBoxLayout" name="verticalLayout_4">
-           <item>
-            <widget class="QPushButton" name="zoomToMinButton">
-             <property name="text">
-              <string>Zoom to min</string>
-             </property>
-            </widget>
-           </item>
-           <item>
-            <widget class="QPushButton" name="zoomToMaxButton">
-             <property name="text">
-              <string>Zoom to max</string>
-             </property>
-            </widget>
-           </item>
-          </layout>
-         </widget>
-        </item>
-        <item row="1" column="1">
-         <widget class="QGroupBox" name="groupBox">
-          <property name="title">
-           <string>Ramp Extrema</string>
-          </property>
-          <layout class="QVBoxLayout" name="verticalLayout_2">
-           <item>
-            <widget class="DoubleEdit" name="minBox">
-             <property name="text">
-              <string>0.00</string>
-             </property>
-            </widget>
-           </item>
-           <item>
-            <widget class="DoubleEdit" name="maxBox">
-             <property name="text">
-              <string>2.00</string>
-             </property>
-            </widget>
-           </item>
-          </layout>
-         </widget>
-        </item>
-        <item row="7" column="1">
-         <widget class="QPushButton" name="deleteButton">
-          <property name="enabled">
-           <bool>false</bool>
-          </property>
-          <property name="text">
-           <string>Delete Group</string>
-          </property>
-         </widget>
-        </item>
-       </layout>
-      </item>
      </layout>
     </item>
-    <item>
-     <layout class="QHBoxLayout" name="horizontalLayout" stretch="0,0">
-      <item>
-       <spacer name="horizontalSpacer_2">
-        <property name="orientation">
-         <enum>Qt::Horizontal</enum>
-        </property>
-        <property name="sizeHint" stdset="0">
-         <size>
-          <width>40</width>
-          <height>20</height>
-         </size>
-        </property>
-       </spacer>
-      </item>
-      <item>
-       <widget class="QComboBox" name="propertyBox">
-        <property name="sizeAdjustPolicy">
-         <enum>QComboBox::AdjustToContents</enum>
-        </property>
-        <item>
+    <item row="11" column="0">
+     <widget class="QGroupBox" name="extremeValuesGroup">
+      <property name="enabled">
+       <bool>false</bool>
+      </property>
+      <property name="title">
+       <string>Extreme Values</string>
+      </property>
+      <layout class="QGridLayout" name="gridLayout">
+       <item row="0" column="0">
+        <widget class="QLabel" name="extremeValuesMinLabel">
          <property name="text">
-          <string>Smallest Angle Per Face</string>
+          <string>Min Value</string>
          </property>
-        </item>
-        <item>
+        </widget>
+       </item>
+       <item row="2" column="0">
+        <widget class="QLabel" name="extremeValuesMaxLabel">
          <property name="text">
-          <string>Scaled Jacobian</string>
+          <string>Max Value</string>
          </property>
-        </item>
-        <item>
+        </widget>
+       </item>
+       <item row="2" column="1">
+        <widget class="DoubleEdit" name="maxBox">
          <property name="text">
-          <string>Heat Intensity</string>
+          <string>2.00</string>
+         </property>
+         <property name="readOnly">
+          <bool>true</bool>
          </property>
-        </item>
-        <item>
+        </widget>
+       </item>
+       <item row="2" column="2">
+        <widget class="QPushButton" name="zoomToMaxButton">
          <property name="text">
-          <string>Heat Intensity (Intrinsic Delaunay)</string>
+          <string>Zoom to max value</string>
          </property>
-        </item>
-       </widget>
-      </item>
-     </layout>
-    </item>
-    <item>
-     <spacer name="verticalSpacer">
-      <property name="orientation">
-       <enum>Qt::Vertical</enum>
-      </property>
-      <property name="sizeHint" stdset="0">
-       <size>
-        <width>20</width>
-        <height>40</height>
-       </size>
-      </property>
-     </spacer>
+        </widget>
+       </item>
+       <item row="0" column="2">
+        <widget class="QPushButton" name="zoomToMinButton">
+         <property name="text">
+          <string>Zoom to min value</string>
+         </property>
+        </widget>
+       </item>
+       <item row="0" column="1">
+        <widget class="DoubleEdit" name="minBox">
+         <property name="text">
+          <string>0.00</string>
+         </property>
+         <property name="frame">
+          <bool>true</bool>
+         </property>
+         <property name="readOnly">
+          <bool>true</bool>
+         </property>
+        </widget>
+       </item>
+      </layout>
+     </widget>
     </item>
    </layout>
   </widget>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index af1eef9e115c..5924212cb398 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -1,400 +1,148 @@
-#include <CGAL/Three/Polyhedron_demo_plugin_helper.h>
-#include <CGAL/Three/Three.h>
-#include <QApplication>
-#include <QObject>
-#include <QAction>
-#include <QMainWindow>
-#include <QInputDialog>
-#include <QColorDialog>
-#include <QPalette>
-#include <QColor>
-#include <QStyleFactory>
-#include <QMessageBox>
-#include <QAbstractItemView>
-
-#include <CGAL/boost/graph/helpers.h>
-#include <CGAL/Polygon_mesh_processing/compute_normal.h>
-#include <CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h>
 
-#include "Scene_points_with_normal_item.h"
+#include "ui_Display_property.h"
 
-#include "Messages_interface.h"
-#include "Scene_surface_mesh_item.h"
-#include "Color_ramp.h"
 #include "Color_map.h"
-#include "ui_Display_property.h"
+#include "Color_ramp.h"
 #include "id_printing.h"
+#include "Messages_interface.h"
+
 #include "Scene.h"
+#include "Scene_surface_mesh_item.h"
+#include "Scene_points_with_normal_item.h"
 #include "triangulate_primitive.h"
-#include <CGAL/Buffer_for_vao.h>
-#include <CGAL/Three/Triangle_container.h>
-#include <CGAL/Dynamic_property_map.h>
-#include <type_traits>
-#include <unordered_map>
-
-#define ARBITRARY_DBL_MIN 1.0E-30
-#define ARBITRARY_DBL_MAX 1.0E+30
-
-
-
-//Item for heat values
-typedef CGAL::Three::Triangle_container Tri;
-typedef CGAL::Three::Viewer_interface VI;
-
-class Scene_heat_item
-    : public CGAL::Three::Scene_item_rendering_helper
-{
-  Q_OBJECT
-
-public:
-  Scene_heat_item(Scene_surface_mesh_item* item)
-    :sm(item->face_graph()), parent(item)
-  {
-    setTriangleContainer(0, new Triangle_container(VI::PROGRAM_HEAT_INTENSITY,
-                                                   true));
-    setRenderingMode(Gouraud);
-  }
-  Scene_item* clone() const Q_DECL_OVERRIDE {return nullptr;}
-  QString toolTip() const Q_DECL_OVERRIDE{return QString(); }
-  void select(double orig_x,
-             double orig_y,
-             double orig_z,
-             double dir_x,
-             double dir_y,
-             double dir_z) Q_DECL_OVERRIDE
-  {
-    parent->select( orig_x, orig_y, orig_z,
-                    dir_x, dir_y, dir_z);
-  }
-
-  void initializeBuffers(CGAL::Three::Viewer_interface *viewer) const Q_DECL_OVERRIDE
-  {
-    getTriangleContainer(0)->initializeBuffers(viewer);
-    getTriangleContainer(0)->setIdxSize(nb_idx);
-    verts.resize(0);
-    normals .resize(0);
-    colors.resize(0);
-    idx.clear();
-    idx.shrink_to_fit();
-    colors.shrink_to_fit();
-    verts.shrink_to_fit();
-    normals.shrink_to_fit();
-  }
-
-  void draw(CGAL::Three::Viewer_interface *viewer) const Q_DECL_OVERRIDE
-  {
-    if(!visible())
-      return;
-    if(!isInit(viewer))
-      initGL(viewer);
-    if ( getBuffersFilled() &&
-         ! getBuffersInit(viewer))
-    {
-      initializeBuffers(viewer);
-      setBuffersInit(viewer, true);
-    }
-    if(!getBuffersFilled())
-    {
-      computeElements();
-      initializeBuffers(viewer);
-    }
-
-    getTriangleContainer(0)->setAlpha(1.0f);
-    getTriangleContainer(0)->draw(viewer, false);
-  }
-  void compute_bbox() const Q_DECL_OVERRIDE
-  {
-    SMesh::Property_map<vertex_descriptor, Point_3> pprop = sm->points();
-    CGAL::Bbox_3 bbox ;
-
-    for(vertex_descriptor vd :vertices(*sm))
-    {
-      bbox = bbox + pprop[vd].bbox();
-    }
-    _bbox = Bbox(bbox.xmin(),bbox.ymin(),bbox.zmin(),
-                 bbox.xmax(),bbox.ymax(),bbox.zmax());
-    is_bbox_computed = true;
-  }
-  Scene_item::Bbox bbox() const Q_DECL_OVERRIDE {
-    if(!is_bbox_computed)
-      compute_bbox();
-    is_bbox_computed = true;
-    return _bbox;
-  }
-
-  ~Scene_heat_item(){}
-  virtual bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE { return m==Gouraud; }
-  virtual void invalidateOpenGLBuffers() Q_DECL_OVERRIDE
-  {
-
-    setBuffersFilled(false);
-    compute_bbox();
-    getTriangleContainer(0)->reset_vbos(NOT_INSTANCED);
-    is_bbox_computed = false;
-  }
-  void triangulate_convex_facet(face_descriptor fd,
-                                boost::property_map< SMesh, boost::vertex_index_t >::type *im) const
-  {
-    const CGAL::qglviewer::Vec v_offset = static_cast<CGAL::Three::Viewer_interface*>(CGAL::QGLViewer::QGLViewerPool().first())->offset();
-    EPICK::Vector_3 offset = EPICK::Vector_3(v_offset.x, v_offset.y, v_offset.z);
 
-    EPICK::Point_3 p0,p1,p2;
-    SMesh::Halfedge_around_face_circulator he(halfedge(fd, *sm), *sm);
-    SMesh::Halfedge_around_face_circulator he_end = he;
-
-    while(next(*he, *sm) != prev(*he_end, *sm))
-    {
-      ++he;
-      vertex_descriptor v0(target(*he_end, *sm)),
-          v1(target(*he, *sm)),
-          v2(target(next(*he, *sm), *sm));
-      p0 = sm->point(v0) + offset;
-      p1 = sm->point(v1) + offset;
-      p2 = sm->point(v2) + offset;
-      idx.push_back((*im)[v0]);
-      idx.push_back((*im)[v1]);
-      idx.push_back((*im)[v2]);
-    }
-  }
-  void triangulate_facet(face_descriptor fd,
-                         SMesh::Property_map<face_descriptor, EPICK::Vector_3> *fnormals,
-                         boost::property_map< SMesh, boost::vertex_index_t >::type *im) const
-  {
-    //Computes the normal of the facet
-    EPICK::Vector_3 normal = get(*fnormals, fd);
+#include <CGAL/Three/Polyhedron_demo_plugin_interface.h>
+#include <CGAL/Three/Polyhedron_demo_plugin_helper.h>
+#include <CGAL/Three/Three.h>
+#include <CGAL/Three/Triangle_container.h>
+#include <CGAL/Buffer_for_vao.h>
 
-    //check if normal contains NaN values
-    if (normal.x() != normal.x() || normal.y() != normal.y() || normal.z() != normal.z())
-    {
-      qDebug()<<"Warning : normal is not valid. Facet not displayed";
-      return;
-    }
+#include <CGAL/boost/graph/helpers.h>
+#include <CGAL/Dynamic_property_map.h>
+#include <CGAL/Polygon_mesh_processing/compute_normal.h>
+#include <CGAL/Polygon_mesh_processing/measure.h>
+#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
 
-    typedef FacetTriangulator<SMesh, EPICK, boost::graph_traits<SMesh>::vertex_descriptor> FT;
-    const CGAL::qglviewer::Vec off = static_cast<CGAL::Three::Viewer_interface*>(CGAL::QGLViewer::QGLViewerPool().first())->offset();
-    EPICK::Vector_3 offset(off.x,off.y,off.z);
-    FT triangulation(fd,normal,sm, offset);
-    //iterates on the internal faces
-    for(FT::CDT::Finite_faces_iterator
-        ffit = triangulation.cdt->finite_faces_begin(),
-        end = triangulation.cdt->finite_faces_end();
-        ffit != end; ++ffit)
-    {
-      if(ffit->info().is_external)
-        continue;
-      //add the vertices to the positions
-      //adds the vertices, normals and colors to the appropriate vectors
-      //adds the indices to the appropriate vector
-      idx.push_back((*im)[triangulation.v2v[ffit->vertex(0)]]);
-      idx.push_back((*im)[triangulation.v2v[ffit->vertex(1)]]);
-      idx.push_back((*im)[triangulation.v2v[ffit->vertex(2)]]);
-    }
-  }
+#include <QAbstractItemView>
+#include <QAction>
+#include <QApplication>
+#include <QColor>
+#include <QColorDialog>
+#include <QInputDialog>
+#include <QMainWindow>
+#include <QMessageBox>
+#include <QObject>
+#include <QPalette>
+#include <QStyleFactory>
 
-  void computeElements() const Q_DECL_OVERRIDE
-  {
-    typedef EPICK::Point_3 Point;
-    QApplication::setOverrideCursor(Qt::WaitCursor);
-    const CGAL::qglviewer::Vec o = static_cast<CGAL::Three::Viewer_interface*>(CGAL::QGLViewer::QGLViewerPool().first())->offset();
-    EPICK::Vector_3 offset(o.x, o.y, o.z);
-    SMesh::Property_map<vertex_descriptor, SMesh::Point> positions =
-        sm->points();
-    SMesh::Property_map<vertex_descriptor, EPICK::Vector_3 > vnormals =
-        sm->property_map<vertex_descriptor, EPICK::Vector_3 >("v:normal").first;
-    SMesh::Property_map<face_descriptor, EPICK::Vector_3 > fnormals =
-        sm->property_map<face_descriptor, EPICK::Vector_3 >("f:normal").first;
-    typedef boost::graph_traits<SMesh>::face_descriptor face_descriptor;
-    typedef boost::graph_traits<SMesh>::halfedge_descriptor halfedge_descriptor;
-    typedef boost::graph_traits<SMesh>::vertex_descriptor vertex_descriptor;
-    SMesh::Property_map<vertex_descriptor, CGAL::IO::Color> vcolors =
-        sm->property_map<vertex_descriptor, CGAL::IO::Color >("v:color").first;
-    SMesh::Property_map<vertex_descriptor, float> vdist=
-        sm->property_map<vertex_descriptor, float >("v:dist").first;
-    typedef CGAL::Buffer_for_vao<float, unsigned int> CPF;
-    verts.clear();
-    normals.clear();
-    idx.clear();
-    colors.clear();
-    boost::property_map< SMesh, boost::vertex_index_t >::type
-        im = get(boost::vertex_index, *sm);
-
-    idx.reserve(num_faces(*sm) * 3);
-    for(face_descriptor fd : faces(*sm))
-    {
-      if(is_triangle(halfedge(fd,*sm),*sm))
-      {
-        for(halfedge_descriptor hd : halfedges_around_face(halfedge(fd, *sm),*sm))
-        {
-          idx.push_back(source(hd, *sm));
-        }
-      }
-      else
-      {
-        std::vector<Point> facet_points;
-        for(halfedge_descriptor hd : halfedges_around_face(halfedge(fd, *sm),*sm))
-        {
-          facet_points.push_back(positions[target(hd, *sm)]);
-        }
-        bool is_convex = CPF::is_facet_convex(facet_points, fnormals[fd]);
+#include <boost/algorithm/clamp.hpp>
+#include <boost/range/value_type.hpp>
 
-        if(is_convex && is_quad(halfedge(fd,*sm),*sm) )
-        {
-          halfedge_descriptor hd = halfedge(fd,*sm);
-          //1st half
-          idx.push_back(source(hd, *sm));
-          idx.push_back(source(next(hd, *sm), *sm));
-          idx.push_back(source(next(next(hd, *sm), *sm), *sm));
-
-          //2nd half
-          idx.push_back(source(hd, *sm));
-          idx.push_back(source(next(next(hd, *sm), *sm), *sm));
-          idx.push_back(source(prev(hd, *sm), *sm));
-        }
-        else if(is_convex)
-        {
-          triangulate_convex_facet(fd, &im);
-        }
-        else
-        {
-          triangulate_facet(fd, &fnormals, &im);
-        }
-      }
-    }
-    for(vertex_descriptor vd : vertices(*sm))
-    {
-      CGAL::IO::Color c = vcolors[vd];
-      colors.push_back((float)c.red()/255);
-      colors.push_back((float)c.green()/255);
-      colors.push_back((float)c.blue()/255);
+#include <type_traits>
+#include <unordered_map>
+#include <vector>
 
+#define ARBITRARY_DBL_MIN 1.0E-17
+#define ARBITRARY_DBL_MAX 1.0E+17
 
-      Point p = positions[vd] + offset;
-      CPF::add_point_in_buffer(p, verts);
-      EPICK::Vector_3 n = vnormals[vd];
-      CPF::add_normal_in_buffer(n, normals);
-      heat_values.push_back(vdist[vd]);
-    }
-    nb_idx = idx.size();
-    getTriangleContainer(0)->allocate(Tri::Vertex_indices, idx.data(),
-                                      static_cast<int>(idx.size()*sizeof(unsigned int)));
-    getTriangleContainer(0)->allocate(Tri::Smooth_vertices, verts.data(),
-                                      static_cast<int>(num_vertices(*sm)*3*sizeof(float)));
-
-    getTriangleContainer(0)->allocate(Tri::Smooth_normals, normals.data(),
-                                      static_cast<int>(num_vertices(*sm)*3*sizeof(float)));
-    getTriangleContainer(0)->allocate(Tri::VColors, colors.data(),
-                                      static_cast<int>(colors.size()*sizeof(float)));
-    getTriangleContainer(0)->allocate(Tri::Distances, heat_values.data(),
-                                      static_cast<int>(heat_values.size()*sizeof(float)));
-    compute_bbox();
-    setBuffersFilled(true);
-     QApplication::restoreOverrideCursor();
-  }
+using namespace CGAL::Three;
 
-  bool isEmpty() const Q_DECL_OVERRIDE {return false;}
-  SMesh *face_graph() { return sm;}
-  Scene_surface_mesh_item* getParent() { return parent; }
+Viewer_interface* (&getActiveViewer)() = Three::activeViewer;
 
-private:
-  SMesh* sm;
-  Scene_surface_mesh_item* parent;
-  mutable std::vector<float> normals;
-  mutable std::vector<unsigned int> idx;
-  mutable std::vector<float> verts;
-  mutable std::vector<float> colors;
-  mutable std::vector<float> heat_values;
-  mutable std::size_t nb_idx;
-}; // end class Scene_heat_item
-
-class DockWidget :
-    public QDockWidget,
+class DockWidget
+  : public QDockWidget,
     public Ui::DisplayPropertyWidget
 {
 public:
-  DockWidget(QString name, QWidget *parent)
-    :QDockWidget(name,parent)
+  DockWidget(const QString& name, QWidget *parent)
+    : QDockWidget(name, parent)
   {
     setupUi(this);
   }
 };
 
-typedef boost::graph_traits<SMesh>::halfedge_descriptor halfedge_descriptor;
-typedef boost::graph_traits<SMesh>::face_descriptor face_descriptor;
-CGAL::Three::Viewer_interface* (&getActiveViewer)() = CGAL::Three::Three::activeViewer;
-class DisplayPropertyPlugin :
-    public QObject,
-    public CGAL::Three::Polyhedron_demo_plugin_helper
+class Display_property_plugin
+  : public QObject,
+    public Polyhedron_demo_plugin_helper
 {
   Q_OBJECT
   Q_INTERFACES(CGAL::Three::Polyhedron_demo_plugin_interface)
   Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0")
-  typedef SMesh::Property_map<boost::graph_traits<SMesh>::vertex_descriptor, double> Vertex_distance_map;
-  typedef CGAL::Heat_method_3::Surface_mesh_geodesic_distances_3<SMesh> Heat_method;
-  typedef CGAL::Heat_method_3::Surface_mesh_geodesic_distances_3<SMesh, CGAL::Heat_method_3::Intrinsic_Delaunay> Heat_method_idt;
-  typedef CGAL::dynamic_vertex_property_t<bool>                        Vertex_source_tag;
-  typedef boost::property_map<SMesh, Vertex_source_tag>::type Vertex_source_map;
 
-public:
+private:
+  QAction* actionDisplayProperties;
+
+  DockWidget* dock_widget;
+
+  // coloring choice and legend
+  double rm = 1.;
+  double gm = 0.;
+  double bm = 0.;
+  double rM = 0.;
+  double gM = 1.;
+  double bM = 0.;
+  double rI = 0.;
+  double gI = 1.;
+  double bI = 0.;
 
-  bool applicable(QAction* action) const Q_DECL_OVERRIDE
+  Color_ramp color_ramp;
+  std::vector<QColor> color_map;
+  QPixmap legend;
+
+  // tracks whether property 'i' (aka i-th in propertyBox) applies to vertices or faces
+  enum class Property_simplex_type { VERTEX, FACE };
+  std::vector<Property_simplex_type> property_simplex_types;
+
+  enum Extremum
   {
-    CGAL::Three::Scene_item* item = scene->item(scene->mainSelectionIndex());
-    if(action == _actions.back())
-      return qobject_cast<Scene_surface_mesh_item*>(item);
-    else
-      return qobject_cast<Scene_surface_mesh_item*>(item)
-          || qobject_cast<Scene_points_with_normal_item*>(item);
-  }
+    MIN_VALUE,
+    MAX_VALUE
+  };
 
-  QList<QAction*> actions() const Q_DECL_OVERRIDE
+public:
+  bool applicable(QAction*) const Q_DECL_OVERRIDE
   {
-    return _actions;
+    Scene_item* item = scene->item(scene->mainSelectionIndex());
+    if(!item)
+      return false;
+
+    return qobject_cast<Scene_surface_mesh_item*>(item) ||
+           qobject_cast<Scene_points_with_normal_item*>(item);
   }
 
-  QColor textColor(const QColor& color)
+  QList<QAction*> actions() const Q_DECL_OVERRIDE
   {
-    QColor text_color (255, 255, 255);
-    if (color.red() * 0.299 + color.green() * 0.587 + color.blue() * 0.114 > 128)
-      text_color = QColor (0, 0, 0);
-    return text_color;
+    return QList<QAction*>() << actionDisplayProperties;
   }
 
-  void init(QMainWindow* mw, CGAL::Three::Scene_interface* sc, Messages_interface*) Q_DECL_OVERRIDE
+  void init(QMainWindow* mw,
+            Scene_interface* sc,
+            Messages_interface*) Q_DECL_OVERRIDE
   {
     this->scene = sc;
     this->mw = mw;
-    this->current_item = nullptr;
-
-    QAction *actionDisplayProperties= new QAction(QString("Display Properties"), mw);
-    QAction *actionHeatMethod= new QAction(QString("Heat Method"), mw);
-    actionHeatMethod->setProperty("submenuName", "Color");
-
-    rm = 1.0;
-    rM = 0.0;
-    gm = 0.0;
-    gM = 1.0;
-    bm = 0.0;
-    bM = 0.0;
+
+    // Main action
+    actionDisplayProperties = new QAction(QString("Display Properties"), mw);
     actionDisplayProperties->setProperty("submenuName", "Color");
 
-    if(actionDisplayProperties) {
-      connect(actionDisplayProperties, SIGNAL(triggered()),
-              this, SLOT(openDialog()));
-      if(actionHeatMethod)
-      {
-        connect(actionHeatMethod, &QAction::triggered,
-                this, [this](){
-          this->dock_widget->propertyBox->setCurrentIndex(2);
-          this->dock_widget->show();
-        });
-      }
-      _actions << actionDisplayProperties;
-      _actions << actionHeatMethod;
+    connect(actionDisplayProperties, SIGNAL(triggered()),
+            this, SLOT(openDialog()));
 
-    }
-    dock_widget = new DockWidget("Property Displaying", mw);
-    dock_widget->setVisible(false);
+    Scene* scene_item = static_cast<Scene*>(scene);
+    connect(scene_item, SIGNAL(itemIndexSelected(int)),
+            this, SLOT(onItemIndexSelected(int)));
+
+    // Dock Widget
+    dock_widget = new DockWidget("Property Display", mw);
     addDockWidget(dock_widget);
+
+    dock_widget->setVisible(false);
+    dock_widget->setEnabled(false);
+
+    connect(dock_widget->propertyBox, SIGNAL(currentIndexChanged(int)),
+            this, SLOT(onNewPropertySelected(int)));
+
     QPalette palette(Qt::red);
     dock_widget->minColorButton->setPalette(palette);
     dock_widget->minColorButton->setStyle(QStyleFactory::create("Fusion"));
@@ -410,1288 +158,1066 @@ class DisplayPropertyPlugin :
     dock_widget->initColorButton->setStyle(QStyleFactory::create("Fusion"));
     dock_widget->initColorButton->update();
 
-    connect(dock_widget->colorizeButton, SIGNAL(clicked(bool)),
-            this, SLOT(colorize()));
+    displayRampLegend();
 
-    connect(dock_widget->propertyBox, SIGNAL(currentIndexChanged(int)),
-            this, SLOT(on_propertyBox_currentIndexChanged(int)));
-    connect(dock_widget->zoomToMinButton, &QPushButton::pressed,
-            this, &DisplayPropertyPlugin::on_zoomToMinButton_pressed);
-    connect(dock_widget->zoomToMaxButton, &QPushButton::pressed,
-            this, &DisplayPropertyPlugin::on_zoomToMaxButton_pressed);
-    connect(dock_widget->minColorButton, &QPushButton::pressed,
-            this, [this]()
-    {
-      QColor minColor = QColorDialog::getColor();
-      if (!minColor.isValid())
-      {
-        return;
-      }
+    // lambda to generate the three connect(), for each color button (min, max, map)
+    auto connect_color_buttons = [this](QPushButton* colorButton,
+                                        double& r, double& g, double& b)
+                                 {
+                                    connect(colorButton, &QPushButton::pressed,
+                                            this, [this, colorButton, &r, &g, &b]()
+                                                  {
+                                                    QColor color = QColorDialog::getColor();
+                                                    if(!color.isValid())
+                                                      return;
 
-      rm = minColor.redF();
-      gm = minColor.greenF();
-      bm = minColor.blueF();
-      QPalette palette(minColor);
-      dock_widget->minColorButton->setPalette(palette);
-      dock_widget->minColorButton->update();
-      replaceRamp();
-    });
-    connect(dock_widget->maxColorButton, &QPushButton::pressed,
-            this, [this]()
-    {
-      QColor maxColor = QColorDialog::getColor();
-      if(!maxColor.isValid())
-        return;
-      QPalette palette(maxColor);
-      rM = maxColor.redF();
-      gM = maxColor.greenF();
-      bM = maxColor.blueF();
-
-      dock_widget->maxColorButton->setPalette(palette);
-      dock_widget->maxColorButton->update();
-      replaceRamp();
-    });
-
-    connect(dock_widget->initColorButton, &QPushButton::pressed,
-            this, [this]()
-    {
-      QColor initColor = QColorDialog::getColor();
-      if (!initColor.isValid())
-      {
-        return;
-      }
+                                                    r = color.redF();
+                                                    g = color.greenF();
+                                                    b = color.blueF();
 
-      QPalette palette(initColor);
-      rI = initColor.redF();
-      gI = initColor.greenF();
-      bI = initColor.blueF();
-      dock_widget->initColorButton->setPalette(palette);
-      dock_widget->initColorButton->update();
-    });
+                                                    QPalette palette(color);
+                                                    colorButton->setPalette(palette);
+                                                    colorButton->update();
 
-    connect(dock_widget->sourcePointsButton, SIGNAL(toggled(bool)),
-            this, SLOT(on_sourcePointsButton_toggled(bool)));
-    connect(dock_widget->deleteButton, &QPushButton::clicked,
-            this, &DisplayPropertyPlugin::delete_group);
+                                                    displayLegend();
+                                                  });
+                                 };
 
-    dock_widget->zoomToMaxButton->setEnabled(false);
-    dock_widget->zoomToMinButton->setEnabled(false);
-    Scene* scene_obj =static_cast<Scene*>(scene);
-    connect(scene_obj, SIGNAL(itemIndexSelected(int)),
-            this,SLOT(enableButtons(int)));
-    connect(scene_obj, SIGNAL(itemIndexSelected(int)),
-            this,SLOT(detectScalarProperties(int)));
+    connect_color_buttons(dock_widget->minColorButton, rm, gm, bm);
+    connect_color_buttons(dock_widget->maxColorButton, rM, gM, bM);
+    connect_color_buttons(dock_widget->initColorButton, rI, gI, bI);
 
-    on_propertyBox_currentIndexChanged(0);
+    displayLegend();
 
+    connect(dock_widget->colorizeButton, SIGNAL(clicked(bool)),
+            this, SLOT(colorize()));
 
+    connect(dock_widget->zoomToMinButton, &QPushButton::pressed,
+            this, &Display_property_plugin::on_zoomToMinButton_pressed);
+    connect(dock_widget->zoomToMaxButton, &QPushButton::pressed,
+            this, &Display_property_plugin::on_zoomToMaxButton_pressed);
   }
-private:
 
-  void detectSMScalarProperties(SMesh* smesh)
+private Q_SLOTS:
+  void openDialog()
   {
-    std::vector<std::string> vprop = smesh->properties<vertex_descriptor>();
-    std::vector<std::string> fprop = smesh->properties<face_descriptor>();
-    for(auto s : vprop)
-      if(is_property_scalar<vertex_descriptor>(s, smesh))
-      {
-        dock_widget->propertyBox->addItem(s.c_str());
-      }
-    for(auto s : fprop)
-      if(is_property_scalar<face_descriptor>(s, smesh))
-      {
-        dock_widget->propertyBox->addItem(s.c_str());
-      }
+    if(!dock_widget->isVisible())
+      dock_widget->show();
+    dock_widget->raise();
   }
 
-  void detectPSScalarProperties(Point_set* ps)
+  void closure() Q_DECL_OVERRIDE
   {
-    for(auto s : ps->properties())
-      if(is_property_scalar(s, ps))
-      {
-        dock_widget->propertyBox->addItem(s.c_str());
-      }
+    dock_widget->hide();
   }
-private Q_SLOTS:
-  void detectScalarProperties(int i)
-  {
-    for(int j = dock_widget->propertyBox->count(); j>=0; --j)
-      dock_widget->propertyBox->removeItem(j);
-
-    Scene_surface_mesh_item* sm_item =
-        qobject_cast<Scene_surface_mesh_item*>(scene->item(i));
-    Scene_points_with_normal_item* p_item =
-        qobject_cast<Scene_points_with_normal_item*>(scene->item(i));
 
-    if(sm_item)
-    {
-        dock_widget->propertyBox->addItem("Smallest Angle Per Face");
-        dock_widget->propertyBox->addItem("Scaled Jacobian");
-        dock_widget->propertyBox->addItem("Heat Intensity");
-        dock_widget->propertyBox->addItem("Heat Intensity (Intrinsic Delaunay)");
-      detectSMScalarProperties(sm_item->face_graph());
-
-    }
-    else if(p_item)
-    {
-      detectPSScalarProperties(p_item->point_set());
-    }
-    int width = dock_widget->propertyBox->minimumSizeHint().width();
-    dock_widget->propertyBox->view()->setMinimumWidth(width);
+private:
+    void disableExtremeValues()
+  {
+    dock_widget->extremeValuesGroup->setEnabled(false);
+    dock_widget->zoomToMinButton->setEnabled(false);
+    dock_widget->zoomToMaxButton->setEnabled(false);
   }
 
-  void openDialog()
+  void enableExtremeValues()
   {
-    if(dock_widget->isVisible()) { dock_widget->hide(); }
-    else{
-      dock_widget->show();
-      dock_widget->raise(); }
+    dock_widget->extremeValuesGroup->setEnabled(true);
+    dock_widget->zoomToMinButton->setEnabled(true);
+    dock_widget->zoomToMaxButton->setEnabled(true);
   }
 
-  void colorizePS(Scene_points_with_normal_item* ps_item)
+  void resetExtremeValues()
   {
-    ps_item->point_set()->add_colors();
-    if(!treat_point_property(dock_widget->propertyBox->currentText().toStdString(), ps_item->point_set()))
+    // setup some dummy values such that the legend can be displayed
+    const std::string& property_name = dock_widget->propertyBox->currentText().toStdString();
+
+    if(property_name == "Smallest Angle Per Face" || property_name == "Largest Angle Per Face")
     {
-      QApplication::restoreOverrideCursor();
-      return;
+      dock_widget->minBox->setRange(0, 360);
+      dock_widget->minBox->setValue(0);
+      dock_widget->maxBox->setRange(0, 360);
+      dock_widget->maxBox->setValue(0);
     }
-    ps_item->setPointsMode();
-    ps_item->invalidateOpenGLBuffers();
-    ps_item->itemChanged();
-  }
-  void colorize()
-  {
-    Scene_points_with_normal_item* p_item =
-        qobject_cast<Scene_points_with_normal_item*>(scene->item(scene->mainSelectionIndex()));
-    if(p_item)
+    else if(property_name == "Scaled Jacobian")
     {
-      colorizePS(p_item);
-      return;
+      dock_widget->minBox->setRange(-1000, 1000);
+      dock_widget->minBox->setValue(0);
+      dock_widget->maxBox->setRange(-1000, 1000);
+      dock_widget->maxBox->setValue(0);
     }
-    Scene_heat_item* h_item = nullptr;
-    Scene_surface_mesh_item* sm_item =
-        qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex()));
-    if(!sm_item)
+    else if(property_name == "Face Area")
     {
-      h_item = qobject_cast<Scene_heat_item*>(scene->item(scene->mainSelectionIndex()));
-      if(!h_item)
-        return;
-      sm_item = h_item->getParent();
+      dock_widget->minBox->setRange(-1000, 1000);
+      dock_widget->minBox->setValue(0);
+      dock_widget->maxBox->setRange(-1000, 1000);
+      dock_widget->maxBox->setValue(0);
     }
-    QApplication::setOverrideCursor(Qt::WaitCursor);
-    sm_item->face_graph()->collect_garbage();
-
-    switch(dock_widget->propertyBox->currentIndex()){
-    case 0:
-      displayAngles(sm_item);
-      break;
-      case 1:
-        displayScaledJacobian(sm_item);
-        break;
-    case 2:
-      dock_widget->colorChoiceWidget->setCurrentIndex(0);
-      if(!displayHeatIntensity(sm_item)){
-        QApplication::restoreOverrideCursor();
-        return;
-      }
-      sm_item->setRenderingMode(Gouraud);
-      break;
-    case 3:// Heat Method (Intrinsic Delaunay)
-      dock_widget->colorChoiceWidget->setCurrentIndex(0);
-      if(!displayHeatIntensity(sm_item, true))
-        return;
-      sm_item->setRenderingMode(Gouraud);
-      break;
-    default:
-      if(dock_widget->propertyBox->currentText().contains("v:"))
-      {
-        if(!treat_sm_property<vertex_descriptor>(dock_widget->propertyBox->currentText().toStdString(), sm_item->face_graph()))
-        {
-          QApplication::restoreOverrideCursor();
-          return;
-        }
-        sm_item->setRenderingMode(Gouraud);
-      }
-      else if(dock_widget->propertyBox->currentText().contains("f:"))
-      {
-        if(!treat_sm_property<face_descriptor>(dock_widget->propertyBox->currentText().toStdString(), sm_item->face_graph()))
-        {
-          QApplication::restoreOverrideCursor();
-          return;
-        }
-        sm_item->setRenderingMode(Flat);
-      }
-      break;
+    else
+    {
+      dock_widget->minBox->setRange(-99999999, 99999999);
+      dock_widget->minBox->setValue(0);
+      dock_widget->maxBox->setRange(-99999999, 99999999);
+      dock_widget->maxBox->setValue(0);
     }
-
-    connect(sm_item, &Scene_surface_mesh_item::itemChanged,
-            this, [sm_item](){
-      bool does_exist;
-      SMesh::Property_map<face_descriptor, double> pmap;
-      std::tie(pmap, does_exist) =
-          sm_item->face_graph()->property_map<face_descriptor,double>("f:jacobian");
-      if(does_exist)
-        sm_item->face_graph()->remove_property_map(pmap);
-      std::tie(pmap, does_exist) =
-          sm_item->face_graph()->property_map<face_descriptor,double>("f:angle");
-      if(does_exist)
-        sm_item->face_graph()->remove_property_map(pmap);
-    });
-    QApplication::restoreOverrideCursor();
-    sm_item->invalidateOpenGLBuffers();
-    sm_item->redraw();
-    if(dock_widget->propertyBox->currentIndex() != 2){
-      dock_widget->zoomToMinButton->setEnabled(true);
-      dock_widget->zoomToMaxButton->setEnabled(true);}
   }
 
-  void enableButtons(int i)
+  void displayRampLegend()
   {
-    Scene_surface_mesh_item* sm_item =
-        qobject_cast<Scene_surface_mesh_item*>(scene->item(i));
+    color_ramp = Color_ramp(rm, rM, gm, gM, bm, bM);
+
+    const int height = 256;
+    const int width = 140;
+    const int cell_width = width / 3;
+    const int top_margin = 5;
+    const int left_margin = 5;
+    const int drawing_height = height - 2*top_margin;
+    const int text_height = 20;
 
-    Scene_points_with_normal_item* ps_item =
-        qobject_cast<Scene_points_with_normal_item*>(scene->item(i));
+    legend = QPixmap(width, height + text_height);
+    legend.fill(QColor(200, 200, 200));
 
-    if(! sm_item && ! ps_item)
-    {
-      dock_widget->zoomToMinButton->setEnabled(false);
-      dock_widget->zoomToMaxButton->setEnabled(false);
-    }
-    else if(ps_item)
+    QPainter painter(&legend);
+    painter.setPen(Qt::black);
+    painter.setBrush(QColor(200, 200, 200));
+
+    const double min_value = dock_widget->minBox->value();
+    const double max_value = dock_widget->maxBox->value();
+
+    // Build legend data
+    std::vector<double> graduations(100);
+    for(int i=0; i<100; ++i)
+      graduations[i] = i / 100.0;
+
+    int i = 0;
+    for(std::vector<double>::iterator it = graduations.begin(), end = graduations.end(); it != end; ++it, i+=2)
     {
-      dock_widget->zoomToMinButton->setEnabled(false);
-      dock_widget->zoomToMaxButton->setEnabled(false);
-    }
-    else if(sm_item){
-      switch(dock_widget->propertyBox->currentIndex())
-      {
-      case 0:
-        dock_widget->zoomToMinButton->setEnabled(angles_max.count(sm_item)>0 );
-        dock_widget->zoomToMaxButton->setEnabled(angles_max.count(sm_item)>0 );
-        break;
-      case 1:
-        dock_widget->zoomToMinButton->setEnabled(jacobian_max.count(sm_item)>0);
-        dock_widget->zoomToMaxButton->setEnabled(jacobian_max.count(sm_item)>0);
-        break;
-      default:
-        break;
-      }
+      QColor color(255 * color_ramp.r(*it),
+                   255 * color_ramp.g(*it),
+                   255 * color_ramp.b(*it));
+      painter.fillRect(left_margin, drawing_height - top_margin - i, cell_width, 2, color);
     }
-  }
 
-  void resetProperty()
-  {
-    Scene_surface_mesh_item* item =
-        qobject_cast<Scene_surface_mesh_item*>(sender());
-    if(!item)
-      return;
-    SMesh& smesh = *item->face_graph();
-    SMesh::Property_map<face_descriptor, double> jacobians;
-    bool found;
-    std::tie(jacobians, found) = smesh.property_map<face_descriptor,double>("f:jacobian");
-    if(found)
-    {
-      smesh.remove_property_map(jacobians);
-    }
-    SMesh::Property_map<face_descriptor, double> angles;
-    std::tie(angles, found) = smesh.property_map<face_descriptor,double>("f:angle");
-    if(found)
-    {
-      smesh.remove_property_map(angles);
-    }
+    // draw right vertical line
+    painter.setPen(Qt::blue);
+    painter.drawLine(QPoint(left_margin + cell_width + 10,
+                            drawing_height - top_margin + 2),
+                     QPoint(left_margin + cell_width + 10,
+                            drawing_height - top_margin - static_cast<int>(graduations.size())*2 + 2));
+
+    // draw min value and max value
+    painter.setPen(Qt::blue);
+    QRect min_text_rect(left_margin + cell_width + 10,
+                        drawing_height - top_margin, 100, text_height);
+    painter.drawText(min_text_rect, Qt::AlignCenter, QObject::tr("%1").arg(min_value, 0, 'f', 3));
+
+    QRect max_text_rect(left_margin + cell_width + 10,
+                        drawing_height - top_margin - 200, 100, text_height);
+    painter.drawText(max_text_rect, Qt::AlignCenter, QObject::tr("%1").arg(max_value, 0, 'f', 3));
+
+    dock_widget->legendLabel->setPixmap(legend);
   }
 
-  void displayScaledJacobian(Scene_surface_mesh_item* item)
+  template<typename ValueType>
+  void displayMapLegend(const std::vector<ValueType>& values)
   {
+    const std::size_t size = (std::min)(color_map.size(), std::size_t(1024));
 
-    SMesh& smesh = *item->face_graph();
-    //compute and store the jacobian per face
-    bool non_init;
-    SMesh::Property_map<face_descriptor, double> fjacobian;
-    std::tie(fjacobian, non_init) = smesh.add_property_map<face_descriptor, double>("f:jacobian", 0);
-    if(non_init)
+    const int text_height = 20;
+    const int height = text_height * static_cast<int>(size) + text_height;
+    const int width = 140;
+    const int cell_width = width / 3;
+    const int top_margin = 15;
+    const int left_margin = 5;
+    const int drawing_height = height - text_height + top_margin;
+
+    legend = QPixmap(width, height);
+    legend.fill(QColor(200, 200, 200));
+
+    QPainter painter(&legend);
+    painter.setPen(Qt::black);
+    painter.setBrush(QColor(200, 200, 200));
+
+    int j = 0;
+    int tick_height = text_height;
+    for(std::size_t i=0; i<size; ++i, j+=tick_height)
     {
-      double res_min = ARBITRARY_DBL_MAX,
-          res_max = -ARBITRARY_DBL_MAX;
-      SMesh::Face_index min_index, max_index;
-      for(boost::graph_traits<SMesh>::face_iterator fit = faces(smesh).begin();
-          fit != faces(smesh).end();
-          ++fit)
-      {
-        fjacobian[*fit] = scaled_jacobian(*fit, smesh);
-        if(fjacobian[*fit] > res_max)
-        {
-          res_max = fjacobian[*fit];
-          max_index = *fit;
-        }
-        if(fjacobian[*fit] < res_min)
-        {
-          res_min = fjacobian[*fit];
-          min_index = *fit;
-        }
-      }
-      jacobian_min.erase(item);
-      jacobian_min.insert(std::make_pair(item, std::make_pair(res_min, min_index)));
-      jacobian_max.erase(item);
-      jacobian_max.insert(std::make_pair(item, std::make_pair(res_max, max_index)));
-      connect(item, &Scene_surface_mesh_item::itemChanged,
-              this, &DisplayPropertyPlugin::resetProperty);
+      QColor color(color_map[i].red(),
+                   color_map[i].green(),
+                   color_map[i].blue());
+
+      painter.fillRect(left_margin,
+                       drawing_height - top_margin - j,
+                       cell_width,
+                       tick_height,
+                       color);
+
+      QRect text_rect(left_margin + cell_width + 10, drawing_height - top_margin - j, 50, text_height);
+      painter.drawText(text_rect, Qt::AlignCenter, QObject::tr("%1").arg(values[i], 0, 'f', 3, QLatin1Char(' ')));
     }
-    treat_sm_property<face_descriptor>("f:jacobian", item->face_graph());
-  }
 
-  bool resetScaledJacobian(Scene_surface_mesh_item* item)
-  {
-    SMesh& smesh = *item->face_graph();
-    if(!smesh.property_map<face_descriptor, double>("f:jacobian").second)
+    if(color_map.size() > size)
     {
-      return false;
+      QRect text_rect(left_margin + cell_width + 10, 0, 50, text_height);
+      painter.drawText(text_rect, Qt::AlignCenter, QObject::tr("[...]"));
     }
-    dock_widget->minBox->setValue(jacobian_min[item].first-0.01);
-    dock_widget->maxBox->setValue(jacobian_max[item].first);
-    return true;
+
+    // draw right vertical line
+    painter.setPen(Qt::blue);
+    painter.drawLine(QPoint(left_margin + cell_width + 10,
+                            drawing_height - top_margin + tick_height),
+                     QPoint(left_margin + cell_width + 10,
+                            drawing_height - top_margin  - static_cast<int>(size)*tick_height + tick_height));
+
+    dock_widget->legendLabel->setPixmap(legend);
   }
 
+  void displayLegend()
+  {
+    if(dock_widget->colorRampRadioButton->isChecked())
+      displayRampLegend();
+    else
+      color_map.clear();
+  }
 
-  void displayAngles(Scene_surface_mesh_item* item)
+private:
+  template<typename Simplex>
+  bool isSMPropertyScalar(const std::string& name,
+                          const SMesh& mesh) const;
+
+  void detectSMScalarProperties(SMesh& mesh)
   {
-    SMesh& smesh = *item->face_graph();
-    typedef boost::property_map<SMesh, boost::vertex_point_t>::type PMap;
-    PMap pmap = get(boost::vertex_point, smesh);
-    //compute and store smallest angle per face
-    bool non_init;
-    SMesh::Property_map<face_descriptor, double> fangle;
-    std::tie(fangle, non_init) = smesh.add_property_map<face_descriptor, double>("f:angle", 0);
-    if(non_init)
+    std::vector<std::string> vprop = mesh.properties<vertex_descriptor>();
+    for(const std::string& s : vprop)
     {
-      double res_min = ARBITRARY_DBL_MAX,
-          res_max = -ARBITRARY_DBL_MAX;
-      SMesh::Face_index index_min, index_max;
-      for(boost::graph_traits<SMesh>::face_iterator fit = faces(smesh).begin();
-          fit != faces(smesh).end();
-          ++fit)
+      if(isSMPropertyScalar<vertex_descriptor>(s, mesh))
       {
-        bool is_face_triangle = is_triangle(halfedge(*fit, smesh), smesh);
-        bool normal_is_ok = true;
-        EPICK::Vector_3 normal(0,0,0);
-
-        EPICK::Orientation orientation = CGAL::POSITIVE;
-        if(!is_face_triangle)
-        {
-          face_descriptor f = *fit;
-          CGAL::Halfedge_around_face_circulator<SMesh>
-              he(halfedge(f, smesh), smesh),
-              he_end(he);
-          do{
-            normal_is_ok = true;
-
-            //Initializes the facet orientation
-
-            EPICK::Point_3 S,T;
-            T = get(pmap, source(*he, smesh));
-            S = get(pmap, target(*he, smesh));
-            EPICK::Vector_3 V1((T-S).x(), (T-S).y(), (T-S).z());
-            S = get(pmap,source(next(*he,smesh), smesh));
-            T = get(pmap, target(next(*he,smesh), smesh));
-            EPICK::Vector_3 V2((T-S).x(), (T-S).y(), (T-S).z());
-
-            if(normal == EPICK::Vector_3(0,0,0))
-              normal_is_ok = false;
-            {
-              normal = CGAL::cross_product(V1, V2);
-            }
-            if(normal_is_ok)
-            {
-              orientation = EPICK::Orientation_3()(V1, V2, normal);
-              if( orientation == CGAL::COPLANAR )
-                normal_is_ok = false;
-            }
-          }while( ++he != he_end && !normal_is_ok);
-        }
-
-        std::vector<float> local_angles;
-        local_angles.reserve(degree(*fit, smesh));
-        for(halfedge_descriptor hd :
-                      halfedges_around_face(halfedge(*fit, smesh),smesh))
-        {
-          halfedge_descriptor hdn = next(hd, smesh);
-          EPICK::Vector_3 v1(get(pmap, source(hd, smesh)), get(pmap, target(hd, smesh))),
-              v2(get(pmap, target(hdn, smesh)), get(pmap, source(hdn, smesh)));
-          float norm1(CGAL::approximate_sqrt(v1.squared_length())), norm2(CGAL::approximate_sqrt(v2.squared_length()));
-          float dot_prod = v1*v2;
-          float angle = std::acos(dot_prod/(norm1*norm2));
-          if(is_face_triangle || !normal_is_ok)
-            local_angles.push_back(angle * 180/CGAL_PI);
-          else
-          {
-            bool is_convex = true;
-            EPICK::Orientation res = EPICK::Orientation_3()(v1, v2, normal) ;
-            if(res!= orientation && res != CGAL::ZERO)
-              is_convex = false;
-            local_angles.push_back(is_convex ? angle * 180/CGAL_PI : 360 - angle * 180/CGAL_PI );
-          }
-        }
-        std::sort(local_angles.begin(), local_angles.end());
-        fangle[*fit]=local_angles.front();
-
-        if(fangle[*fit] > res_max)
-        {
-          res_max = fangle[*fit];
-          index_max = *fit;
-        }
-        if(fangle[*fit] < res_min)
-        {
-          res_min = fangle[*fit];
-          index_min = *fit;
-        }
+        dock_widget->propertyBox->addItem(s.c_str());
+        property_simplex_types.push_back(Property_simplex_type::VERTEX);
       }
-      angles_min.erase(item);
-      angles_min.insert(std::make_pair(item, std::make_pair(res_min, index_min)));
-      angles_max.erase(item);
-      angles_max.insert(std::make_pair(item, std::make_pair(res_max, index_max)));
+    }
 
-      connect(item, &Scene_surface_mesh_item::itemChanged,
-              this, &DisplayPropertyPlugin::resetProperty);
+    std::vector<std::string> fprop = mesh.properties<face_descriptor>();
+    for(const std::string& s : fprop)
+    {
+      if(isSMPropertyScalar<face_descriptor>(s, mesh))
+      {
+        dock_widget->propertyBox->addItem(s.c_str());
+        property_simplex_types.push_back(Property_simplex_type::FACE);
+      }
     }
-    treat_sm_property<face_descriptor>("f:angle", item->face_graph());
   }
 
-  bool resetAngles(Scene_surface_mesh_item* item)
+  bool isPSPropertyScalar(const std::string& name,
+                          const Point_set& ps) const;
+
+  void detectPSScalarProperties(const Point_set& ps)
   {
-    SMesh& smesh = *item->face_graph();
-    if(!smesh.property_map<face_descriptor, double>("f:angle").second)
-    {
-      return false;
-    }
-    dock_widget->minBox->setValue(angles_min[item].first);
-    dock_widget->maxBox->setValue(angles_max[item].first);
-    return true;
+    for(const auto& s : ps.properties())
+      if(isPSPropertyScalar(s, ps))
+        dock_widget->propertyBox->addItem(s.c_str());
   }
 
-  // AF: This function gets called when we click on the button "Colorize"
-  bool displayHeatIntensity(Scene_surface_mesh_item* item, bool iDT = false)
+private:
+  // This fills "dock_widget->propertyBox" with the properties that can be displayed for the item at position 'item_index'
+  void detectScalarProperties(int item_index)
   {
-    SMesh& mesh = *item->face_graph();
-    bool found = is_source.find(item) != is_source.end();
-    if(!found
-       || ! source_points
-       || source_points->point_set()->is_empty())
+    dock_widget->propertyBox->clear(); // calls onNewPropertySelected(-1)
+    property_simplex_types.clear();
+
+    Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(scene->item(item_index));
+    Scene_points_with_normal_item* ps_item = qobject_cast<Scene_points_with_normal_item*>(scene->item(item_index));
+
+    if(sm_item)
     {
-      QApplication::restoreOverrideCursor();
-      QMessageBox::warning(mw, "Warning","Source vertices are needed for this property.");
-      return false;
+      dock_widget->propertyBox->addItems({"Smallest Angle Per Face",
+                                          "Largest Angle Per Face",
+                                          "Scaled Jacobian",
+                                          "Face Area"});
+      property_simplex_types = { Property_simplex_type::FACE,
+                                 Property_simplex_type::FACE,
+                                 Property_simplex_type::FACE,
+                                 Property_simplex_type::FACE };
+      detectSMScalarProperties(*(sm_item->face_graph()));
     }
-    if(!is_triangle_mesh(mesh))
+    else if(ps_item)
     {
-      QApplication::restoreOverrideCursor();
-      QMessageBox::warning(mw,"Error","The mesh must be triangulated.");
-      return false;
-    }
-    Heat_method * hm = nullptr;
-    Heat_method_idt * hm_idt = nullptr;
-    SMesh::Property_map<vertex_descriptor, double> heat_intensity =
-      mesh.add_property_map<vertex_descriptor, double>("v:heat_intensity", 0).first;
-    if(! iDT){
-      if(mesh_heat_method_map.find(item) != mesh_heat_method_map.end()){
-        hm = mesh_heat_method_map[item];
-      }else {
-        hm = new Heat_method(mesh);
-        mesh_heat_method_map[item] = hm;
-      }
-      connect(item, &Scene_surface_mesh_item::aboutToBeDestroyed,
-              [this,item](){
-                auto it =  mesh_heat_method_map.find(item);
-                if(it == mesh_heat_method_map.end())
-                  return;
-                delete it->second;
-                mesh_heat_method_map.erase(it);
-              }
-              );
-    } else {
-      if(mesh_heat_method_idt_map.find(item) != mesh_heat_method_idt_map.end()){
-        hm_idt = mesh_heat_method_idt_map[item];
-      }else {
-        hm_idt = new Heat_method_idt(mesh);
-        mesh_heat_method_idt_map[item] = hm_idt;
-      }
-      connect(item, &Scene_surface_mesh_item::aboutToBeDestroyed,
-              [this,item](){
-                auto it = mesh_heat_method_idt_map.find(item);
-                if(it == mesh_heat_method_idt_map.end())
-                  return;
-                Heat_method_idt *hm_idt = it->second;
-                delete hm_idt;
-                mesh_heat_method_idt_map.erase(it);
-              }
-              );
+      detectPSScalarProperties(*(ps_item->point_set()));
     }
 
-    for(vertex_descriptor vd : vertices(mesh)){
-      if(get(is_source[item], vd)){
-        if(iDT){
-          hm_idt->add_source(vd);
-        } else
-          hm->add_source(vd);
-      }
-      else
-      {
-        if(iDT){
-          hm_idt->remove_source(vd);
-        } else
-          hm->remove_source(vd);
-      }
-    }
+    int width = dock_widget->propertyBox->minimumSizeHint().width();
+    dock_widget->propertyBox->view()->setMinimumWidth(width);
+  }
 
-    if(iDT){
-      hm_idt->estimate_geodesic_distances(heat_intensity);
-    }else{
-      hm->estimate_geodesic_distances(heat_intensity);
-    }
+private Q_SLOTS:
+  // Called when a new geometric object is selected in the scene
+  void onItemIndexSelected(int item_index)
+  {
+    // try to keep the same selected property, if possible
+    const QString selected_property = dock_widget->propertyBox->currentText();
 
-    double max = 0;
-    double min = (std::numeric_limits<double>::max)();
+    detectScalarProperties(item_index);
 
-    for(vertex_descriptor vd : vertices(mesh)){
-      double hi = heat_intensity[vd];
-      if(hi < min)
-        min = hi;
-      if(hi > max)
-        max = hi;
-    }
-    color_ramp = Color_ramp(rm, rM, gm, gM, bm, bM);
-    dock_widget->minBox->setValue(min);
-    dock_widget->maxBox->setValue(max);
+    if(dock_widget->propertyBox->count() == 0)
+      return;
+
+    const int property_index = dock_widget->propertyBox->findText(selected_property);
+    if(property_index == -1)
+      dock_widget->propertyBox->setCurrentIndex(0);
+    else
+      dock_widget->propertyBox->setCurrentIndex(property_index);
+  }
+
+  // Called when a new property is selected in the combo box.
+  // This function is only called if the index actually changed (doesn't trigger
+  // if you click again the item)
+  void onNewPropertySelected(int property_index)
+  {
+    resetExtremeValues(); // reset extreme value before the legend to get the proper values
     displayLegend();
-    //}
-    SMesh::Property_map<vertex_descriptor, CGAL::IO::Color> vcolors =
-        mesh.add_property_map<vertex_descriptor, CGAL::IO::Color >("v:color", CGAL::IO::Color()).first;
-    SMesh::Property_map<vertex_descriptor, float> vdist=
-        mesh.add_property_map<vertex_descriptor, float >("v:dist", 0.0).first;
-    for(boost::graph_traits<SMesh>::vertex_iterator vit = vertices(mesh).begin();
-        vit != vertices(mesh).end();
-        ++vit)
-    {
-      double h =(heat_intensity[*vit]-min)/(max-min);
-      CGAL::IO::Color color(
-            255*color_ramp.r(h),
-            255*color_ramp.g(h),
-            255*color_ramp.b(h));
-      vcolors[*vit] = color;
-      vdist[*vit]=h;
-    }
-    Scene_group_item* group;
-    if(mesh_heat_item_map.find(item) != mesh_heat_item_map.end())
+
+    if(property_index >= 0 && property_index < dock_widget->propertyBox->count()) // valid property
     {
-      group = mesh_heat_item_map[item]->parentGroup();
-      group->unlockChild(mesh_heat_item_map[item]);
-      scene->erase(scene->item_id(mesh_heat_item_map[item]));
+      dock_widget->setEnabled(true);
+      disableExtremeValues(); // only available after coloring
     }
-    else
+    else // no or broken property
     {
-      group = new Scene_group_item("Heat Visualization");
-      group->setProperty("heat_group", true);
-      scene->addItem(group);
-      scene->changeGroup(item, group);
-      scene->changeGroup(source_points, group);
-      group->lockChild(item);
-      group->lockChild(source_points);
-      dock_widget->deleteButton->setEnabled(true);
-      connect(group, &Scene_group_item::aboutToBeDestroyed,
-              this, [this](){
-        this->dock_widget->deleteButton->setEnabled(false);
-      });
+      dock_widget->setEnabled(false);
+      dock_widget->propertyBox->setEnabled(true);
     }
-    mesh_heat_item_map[item] = new Scene_heat_item(item);
-    mesh_heat_item_map[item]->setName(tr("%1 heat").arg(item->name()));
-    scene->addItem(mesh_heat_item_map[item]);
-    scene->changeGroup(mesh_heat_item_map[item], group);
-    group->lockChild(mesh_heat_item_map[item]);
-    item->setVisible(false);
-    displayLegend();
-    if(dock_widget->sourcePointsButton->isChecked())
-      dock_widget->sourcePointsButton->toggle();
-    return true;
   }
 
-  void replaceRamp()
+private:
+  void colorizePS(Scene_points_with_normal_item* ps_item)
   {
-    if(dock_widget->colorChoiceWidget->currentIndex() == 0)
+    ps_item->point_set()->add_colors();
+    if(!displayPSProperty(dock_widget->propertyBox->currentText().toStdString(),
+                          *(ps_item->point_set())))
     {
-      color_ramp = Color_ramp(rm, rM, gm, gM, bm, bM);
-      displayLegend();
-      minBox = dock_widget->minBox->value();
-      maxBox = dock_widget->maxBox->value();
+      return;
     }
-  }
 
-  void on_propertyBox_currentIndexChanged(int)
-  {
-    dock_widget->sourcePointsButton->setEnabled(false);
-    Scene_surface_mesh_item* item =
-        qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex()));
-    if(! item )
-      dock_widget->maxBox->setValue(180);
-    else{
-      switch(dock_widget->propertyBox->currentIndex())
-      {
-      case 0:
-      {
-        dock_widget->groupBox->  setEnabled(true);
-        dock_widget->groupBox_3->setEnabled(true);
-
-        dock_widget->minBox->setMinimum(0);
-        dock_widget->minBox->setMaximum(360);
-        dock_widget->minBox->setValue(0);
-        dock_widget->maxBox->setMinimum(0);
-        dock_widget->maxBox->setMaximum(360);
-        if(is_triangle_mesh(*item->face_graph()))
-          dock_widget->maxBox->setValue(60);
-        else if(is_quad_mesh(*item->face_graph()))
-          dock_widget->maxBox->setValue(90);
-        replaceRamp();
-        break;
-      }
-      case 1:
-        dock_widget->groupBox->  setEnabled(true);
-        dock_widget->groupBox_3->setEnabled(true);
-
-        dock_widget->minBox->setMinimum(-1000);
-        dock_widget->minBox->setMaximum(1000);
-        dock_widget->minBox->setValue(0);
-
-        dock_widget->maxBox->setMinimum(-1000);
-        dock_widget->maxBox->setMaximum(1000);
-        dock_widget->maxBox->setValue(2);
-        break;
-      case 2:
-      case 3:
-        dock_widget->sourcePointsButton->setEnabled(true);
-        CGAL_FALLTHROUGH;
-      default:
-        dock_widget->maxBox->setMinimum(-99999999);
-        dock_widget->maxBox->setMaximum(99999999);
-        dock_widget->minBox->setMinimum(-99999999);
-        dock_widget->minBox->setMaximum(99999999);
-        dock_widget->groupBox->  setEnabled(false);
-        dock_widget->groupBox_3->setEnabled(false);
-      }
-    }
+    ps_item->invalidateOpenGLBuffers();
+    ps_item->setRenderingMode(Points);
+    ps_item->redraw();
   }
 
-  void closure()Q_DECL_OVERRIDE
+  void colorizeSM(Scene_surface_mesh_item* sm_item)
   {
-    dock_widget->hide();
-  }
+    CGAL_assertion(static_cast<std::size_t>(dock_widget->propertyBox->count()) == property_simplex_types.size());
 
-  void on_zoomToMinButton_pressed()
-  {
+    // leave it flat if it was, otherwise set to flat+edges
+    if(sm_item->renderingMode() != Flat && sm_item->renderingMode() != FlatPlusEdges)
+      sm_item->setRenderingMode(FlatPlusEdges);
 
-    Scene_surface_mesh_item* item =
-        qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex()));
-    if(!item)
-      return;
-    face_descriptor dummy_fd;
-    Point_3 dummy_p;
-    switch(dock_widget->propertyBox->currentIndex())
+    const std::string& property_name = dock_widget->propertyBox->currentText().toStdString();
+    if(property_name == "Smallest Angle Per Face")
     {
-    case 0:
+      displayExtremumAnglePerFace(sm_item, MIN_VALUE);
+    }
+    else if(property_name == "Largest Angle Per Face")
     {
-      ::zoomToId(*item->face_graph(),
-                 QString("f%1").arg(angles_min[item].second),
-                 getActiveViewer(),
-                 dummy_fd,
-                 dummy_p);
+      displayExtremumAnglePerFace(sm_item, MAX_VALUE);
     }
-      break;
-    case 1:
+    else if(property_name == "Scaled Jacobian")
     {
-      ::zoomToId(*item->face_graph(),
-                 QString("f%1").arg(jacobian_min[item].second),
-                 getActiveViewer(),
-                 dummy_fd,
-                 dummy_p);
+      displayScaledJacobian(sm_item);
     }
-      break;
-    default:
-      break;
+    else if(property_name == "Face Area")
+    {
+      displayArea(sm_item);
+    }
+    else
+    {
+      const int property_index = dock_widget->propertyBox->currentIndex();
+      if(property_simplex_types.at(property_index) == Property_simplex_type::VERTEX)
+      {
+        if(!displaySMProperty<vertex_descriptor>(dock_widget->propertyBox->currentText().toStdString(),
+                                                 *(sm_item->face_graph())))
+        {
+          return;
+        }
+        sm_item->setRenderingMode(GouraudPlusEdges);
+      }
+      else if(property_simplex_types.at(property_index) == Property_simplex_type::FACE)
+      {
+        if(!displaySMProperty<face_descriptor>(dock_widget->propertyBox->currentText().toStdString(),
+                                               *(sm_item->face_graph())))
+        {
+          return;
+        }
+      }
     }
+
+    sm_item->invalidateOpenGLBuffers();
+    sm_item->redraw();
   }
 
-  void on_zoomToMaxButton_pressed()
+private Q_SLOTS:
+  void colorize()
   {
-    Scene_surface_mesh_item* item =
-        qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex()));
-    if(!item)
+    const int property_index = dock_widget->propertyBox->currentIndex();
+    if(property_index < 0 || property_index >= dock_widget->propertyBox->count())
       return;
-    face_descriptor dummy_fd;
-    Point_3 dummy_p;
-    switch(dock_widget->propertyBox->currentIndex())
-    {
-    case 0:
-    {
-      ::zoomToId(*item->face_graph(),
-                 QString("f%1").arg(angles_max[item].second),
-                 getActiveViewer(),
-                 dummy_fd,
-                 dummy_p);
-    }
-      break;
-    case 1:
-    {
-      ::zoomToId(*item->face_graph(),
-                 QString("f%1").arg(jacobian_max[item].second),
-                 getActiveViewer(),
-                 dummy_fd,
-                 dummy_p);
-    }
-      break;
-    default:
-      break;
-    }
+
+    QApplication::setOverrideCursor(Qt::WaitCursor);
+
+    enableExtremeValues();
+
+    Scene_item* item = scene->item(scene->mainSelectionIndex());
+    Scene_points_with_normal_item* ps_item = qobject_cast<Scene_points_with_normal_item*>(item);
+    Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
+
+    if(sm_item)
+      colorizeSM(sm_item);
+    else if(ps_item)
+      colorizePS(ps_item);
+
+    // @todo emit a new SIGNAL on successful coloring, something like "colorChanged()"
+    // itemChanged is too strong and would conflict with the connection below
+
+    QApplication::restoreOverrideCursor();
+
+    // below is a hackish way to call the connection only once.
+    // This is required because the itemChanged signal is currently emitted when the colors are reset...
+    //
+    // @todo do not emit itemChanged when the colors are reset
+    // @todo with qt6, single connection can be performed with `static_cast<Qt::ConnectionType>(Qt::SingleShotConnection)`
+    // see https://www.kdab.com/single-shot-connections/
+    auto connection = std::make_shared<QMetaObject::Connection>();
+    *connection = connect(item, &Scene_surface_mesh_item::itemChanged,
+                          this, [this, item, ps_item, sm_item, connection]()
+                                {
+                                  QObject::disconnect(*connection);
+
+                                  this->removeDisplayPluginProperties(item); // meaningful only for sm_item
+
+                                  // @todo Scene_item doesn't have resetColors()...
+                                  if(ps_item)
+                                    ps_item->resetColors();
+                                  else if(sm_item)
+                                    sm_item->resetColors();
+
+                                  if(item == scene->item(scene->mainSelectionIndex()))
+                                    onItemIndexSelected(scene->item_id(item));
+                                });
   }
 
-  void delete_group()
+private:
+  void removeDisplayPluginProperty(Scene_item* item,
+                                   const std::string& property_name)
   {
-    if(scene->selectionIndices().empty())
+    Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
+    if(!sm_item)
       return;
-    Scene_item* item = scene->item(scene->selectionIndices().first());
-    Scene_group_item* group = qobject_cast<Scene_group_item*>(item);
-    if(!group || !group->property("heat_group").toBool())
+
+    SMesh* sm = sm_item->face_graph();
+    if(sm == nullptr)
       return;
-    for(auto child_id : group->getChildren())
-    {
-      if(Scene_surface_mesh_item* child = qobject_cast<Scene_surface_mesh_item*>(scene->item(child_id))){
-        auto it =  mesh_heat_method_map.find(child);
-        if(it != mesh_heat_method_map.end())
-          mesh_heat_method_map.erase(it);
-
-        auto it2 =  mesh_heat_item_map.find(child);
-        if(it2 != mesh_heat_item_map.end())
-          mesh_heat_item_map.erase(it2);
-
-        auto it3 =  mesh_heat_method_idt_map.find(child);
-        if(it3 != mesh_heat_method_idt_map.end())
-          mesh_heat_method_idt_map.erase(it3);
-
-        group->unlockChild(child);
-         group->removeChild(child);
-         scene->addChild(child);
-         child->setVisible(true);
-         child->resetColors();
-        break;
-      }
-    }
-    scene->erase(scene->item_id(group));
-    source_points = nullptr;
 
+    // Here we only target the property maps added by this plugin, so 'double' is fine
+    SMesh::Property_map<face_descriptor, double> property;
+    bool found;
+    std::tie(property, found) = sm->property_map<face_descriptor, double>(property_name);
+    if(found)
+      sm->remove_property_map(property);
   }
 
-  void on_sourcePointsButton_toggled(bool b)
+  void removeDisplayPluginProperties(Scene_item* item)
   {
-    if(b)
+    removeDisplayPluginProperty(item, "f:display_plugin_smallest_angle");
+    removeDisplayPluginProperty(item, "f:display_plugin_largest_angle");
+    removeDisplayPluginProperty(item, "f:display_plugin_scaled_jacobian");
+    removeDisplayPluginProperty(item, "f:display_plugin_area");
+  }
+
+  void displayExtremumAnglePerFace(Scene_surface_mesh_item* sm_item,
+                                   const Extremum extremum)
+  {
+    SMesh* sm = sm_item->face_graph();
+    if(sm == nullptr)
+      return;
+
+    // if the face is already a triangle, do not extract it from the mesh
+    auto triangular_face_sector_angle = [](halfedge_descriptor h,
+                                           const SMesh& mesh) -> double
+                                        {
+                                          auto vpm = get(boost::vertex_point, mesh);
+                                          return CGAL::approximate_angle(get(vpm, source(h, mesh)),
+                                                                        get(vpm, target(h, mesh)),
+                                                                        get(vpm, target(next(h, mesh), mesh)));
+                                        };
+
+    // for non-triangular faces, extract a one-face mesh and triangulate it
+    auto single_face_sector_angle = [](halfedge_descriptor h,
+                                       const SMesh& mesh) -> double
+                                    {
+                                      CGAL_precondition(!is_border(h, mesh) && is_border(opposite(h, mesh), mesh));
+
+                                      auto vpm = get(boost::vertex_point, mesh);
+
+                                      double sector_angle = 0;
+                                      do
+                                      {
+                                        sector_angle += CGAL::approximate_angle(get(vpm, source(h, mesh)),
+                                                                                get(vpm, target(h, mesh)),
+                                                                                get(vpm, target(next(h, mesh), mesh)));
+                                        h = opposite(next(h, mesh), mesh);
+                                      }
+                                      while(!is_border(h, mesh));
+
+                                      return sector_angle;
+                                    };
+
+    bool not_initialized;
+    SMesh::Property_map<face_descriptor, double> fangle;
+
+    if(extremum == MIN_VALUE)
+      std::tie(fangle, not_initialized) = sm->add_property_map<face_descriptor, double>("f:display_plugin_smallest_angle", 0);
+    else
+      std::tie(fangle, not_initialized) = sm->add_property_map<face_descriptor, double>("f:display_plugin_largest_angle", 0);
+
+    SMesh& mesh = *sm;
+    auto vpm = get(boost::vertex_point, mesh);
+
+    if(not_initialized)
     {
-      Scene_heat_item* h_item = nullptr;
-      Scene_surface_mesh_item* item =
-          qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex()));
-      if(!item)
-      {
-        h_item = qobject_cast<Scene_heat_item*>(scene->item(scene->mainSelectionIndex()));
-        if(h_item)
-          item = h_item->getParent();
-      }
-      if(!item)
-      {
-        QMessageBox::warning(mw, "Warning", "You must select a Surface_mesh_item to make this work. Aborting.");
-        dock_widget->sourcePointsButton->setChecked(false);
-        return;
-      }
-      current_item = item;
-      connect(current_item, &Scene_surface_mesh_item::aboutToBeDestroyed,
-              this, [this]()
-      {
-        dock_widget->sourcePointsButton->setChecked(false);
-      });
-      if(mesh_sources_map.find(item) == mesh_sources_map.end())
+      for(face_descriptor f : faces(mesh))
       {
-        source_points = new Scene_points_with_normal_item();
-        source_points->setName(QString("Source vertices for %1").arg(current_item->name()));
-        source_points->setColor(QColor(Qt::red));
-        source_points->setPointSize(5);
-        scene->addItem(source_points);
-        connect(source_points, &Scene_points_with_normal_item::aboutToBeDestroyed,
-                [this](){
-          std::unordered_map<Scene_surface_mesh_item*, Scene_points_with_normal_item*>::iterator it;
-          for(it = mesh_sources_map.begin();
-              it != mesh_sources_map.end();
-              ++it)
+        if(CGAL::is_triangle(halfedge(f, mesh), mesh))
+        {
+          if(extremum == MIN_VALUE)
           {
-            if(it->second == source_points)
-            {
-              mesh_sources_map.erase(it);
-              break;
-            }
+            fangle[f] = (std::min)({triangular_face_sector_angle(halfedge(f, mesh), mesh),
+                                    triangular_face_sector_angle(next(halfedge(f, mesh), mesh), mesh),
+                                    triangular_face_sector_angle(prev(halfedge(f, mesh), mesh), mesh)});
           }
-        });
-      mesh_sources_map[current_item] = source_points;
-      }
-      else
-      {
-        source_points=mesh_sources_map[current_item];
-      }
-      connect(item, SIGNAL(selected_vertex(void*)), this, SLOT(on_vertex_selected(void*)));
-      bool non_init = is_source.find(item) == is_source.end();
-      if(non_init)
-      {
-        Vertex_source_map map = get(Vertex_source_tag(), *item->face_graph());
-        is_source.insert(std::make_pair(item, map));
-        connect(item, &Scene_surface_mesh_item::itemChanged,
-                this, &DisplayPropertyPlugin::resetProperty);
-        connect(item, &Scene_surface_mesh_item::aboutToBeDestroyed,
-                [this, item](){
-          if(is_source.find(item) != is_source.end())
+          else
+          {
+            fangle[f] = (std::max)({triangular_face_sector_angle(halfedge(f, mesh), mesh),
+                                    triangular_face_sector_angle(next(halfedge(f, mesh), mesh), mesh),
+                                    triangular_face_sector_angle(prev(halfedge(f, mesh), mesh), mesh)});
+          }
+        }
+        else
+        {
+          SMesh local_smesh;
+          auto local_vpm = get(boost::vertex_point, local_smesh);
+          std::vector<vertex_descriptor> local_vertices;
+
+          for(halfedge_descriptor h : halfedges_around_face(halfedge(f, mesh), mesh))
+          {
+            local_vertices.push_back(CGAL::add_vertex(local_smesh));
+            put(local_vpm, local_vertices.back(), get(vpm, target(h, mesh)));
+          }
+
+          face_descriptor local_f = CGAL::Euler::add_face(local_vertices, local_smesh);
+
+          // walk the border of the face to walk the halfedge of the pre-triangulation face
+          halfedge_descriptor local_border_h = opposite(halfedge(local_f, local_smesh), local_smesh);
+          CGAL_assertion(is_border(local_border_h, local_smesh));
+
+          CGAL::Polygon_mesh_processing::triangulate_faces(local_smesh);
+
+          double extremum_angle_in_face = ARBITRARY_DBL_MAX;
+          halfedge_descriptor local_border_end_h = local_border_h;
+          do
           {
-            is_source.erase(item);
+            double angle = single_face_sector_angle(opposite(local_border_h, local_smesh), local_smesh);
+            if(extremum == MIN_VALUE)
+              extremum_angle_in_face = (std::min)(extremum_angle_in_face, angle);
+            else
+              extremum_angle_in_face = (std::max)(extremum_angle_in_face, angle);
+
+            local_border_h = next(local_border_h, local_smesh);
           }
-        });
+          while(local_border_h != local_border_end_h);
+
+          fangle[f] = extremum_angle_in_face;
+        }
       }
     }
+
+    if(extremum == MIN_VALUE)
+      displaySMProperty<face_descriptor>("f:display_plugin_smallest_angle", mesh);
     else
+      displaySMProperty<face_descriptor>("f:display_plugin_largest_angle", mesh);
+  }
+
+  double scaled_jacobian(const face_descriptor f,
+                         const SMesh& mesh) const;
+
+  void displayScaledJacobian(Scene_surface_mesh_item* sm_item)
+  {
+    SMesh* sm = sm_item->face_graph();
+    if(sm == nullptr)
+      return;
+
+    bool not_initialized;
+    SMesh::Property_map<face_descriptor, double> fjacobian;
+    std::tie(fjacobian, not_initialized) = sm->add_property_map<face_descriptor, double>("f:display_plugin_scaled_jacobian", 0);
+
+    if(not_initialized)
     {
-      if(!current_item)
-        return;
-      disconnect(current_item, SIGNAL(selected_vertex(void*)), this, SLOT(on_vertex_selected(void*)));
-      current_item = nullptr;
+      for(face_descriptor f : faces(*sm))
+        fjacobian[f] = scaled_jacobian(f, *sm);
     }
+
+    displaySMProperty<face_descriptor>("f:display_plugin_scaled_jacobian", *sm);
   }
 
-  void on_vertex_selected(void* void_ptr)
+  double area(const face_descriptor f,
+              const SMesh& mesh) const
   {
-    typedef boost::graph_traits<SMesh>::vertices_size_type size_type;
-    size_type h = static_cast<size_type>(reinterpret_cast<std::size_t>(void_ptr));
-    vertex_descriptor vd = static_cast<vertex_descriptor>(h) ;
-    bool found = is_source.find(current_item) != is_source.end();
-    if(found)
+    if(CGAL::is_triangle(halfedge(f, mesh), mesh))
+      return CGAL::Polygon_mesh_processing::face_area(f, mesh);
+
+    auto vpm = get(boost::vertex_point, mesh);
+
+    // create a local version of the mesh, triangulate it, sum the triangle areas
+    SMesh local_smesh;
+    auto local_vpm = get(boost::vertex_point, local_smesh);
+    std::vector<vertex_descriptor> local_vertices;
+
+    for(halfedge_descriptor h : halfedges_around_face(halfedge(f, mesh), mesh))
     {
-      if(!get(is_source[current_item], vd))
-      {
-        put(is_source[current_item], vd, true);
-        source_points->point_set()->insert(current_item->face_graph()->point(vd));
-      }
-      else
-      {
-        put(is_source[current_item], vd, false);
-        Point_set::iterator it;
-        for(it = source_points->point_set()->begin(); it != source_points->point_set()->end(); ++it)
-          if(source_points->point_set()->point(*it) == current_item->face_graph()->point(vd))
-          {
-            source_points->point_set()->remove(it);
-            source_points->point_set()->collect_garbage();
-            break;
-          }
-      }
+      local_vertices.push_back(CGAL::add_vertex(local_smesh));
+      put(local_vpm, local_vertices.back(), get(vpm, target(h, mesh)));
     }
 
-   source_points->invalidateOpenGLBuffers();
-   source_points->itemChanged();
+    CGAL::Euler::add_face(local_vertices, local_smesh);
+    CGAL::Polygon_mesh_processing::triangulate_faces(local_smesh);
+    return CGAL::Polygon_mesh_processing::area(local_smesh);
   }
+
+  void displayArea(Scene_surface_mesh_item* sm_item)
+  {
+    SMesh* sm = sm_item->face_graph();
+    if(sm == nullptr)
+      return;
+
+    bool not_initialized;
+    SMesh::Property_map<face_descriptor, double> farea;
+    std::tie(farea, not_initialized) = sm->add_property_map<face_descriptor, double>("f:display_plugin_area", 0);
+
+    if(not_initialized)
+    {
+      for(face_descriptor f : faces(*sm))
+        farea[f] = area(f, *sm);
+    }
+
+    displaySMProperty<face_descriptor>("f:display_plugin_area", *sm);
+  }
+
+private:
+  template<typename Functor>
+  bool call_on_PS_property(const std::string& name,
+                           const Point_set& ps,
+                           const Functor& functor) const;
+
+  template<typename Simplex, typename Functor>
+  bool call_on_SM_property(const std::string& name,
+                           const SMesh& sm,
+                           const Functor& functor) const;
+
 private:
   template<typename PM>
-  bool displayPSProperty(Point_set* ps, PM pm);
+  bool displayPSProperty(Point_set& ps,
+                         PM pm)
+  {
+    PSDisplayer<PM> display_property(ps, pm, this);
+    return display_property();
+  }
+
+  bool displayPSProperty(const std::string& name,
+                         Point_set& ps);
+
+  // -
   template<typename PM>
-  bool displaySMProperty(SMesh& smesh, PM pm, vertex_descriptor);
+  bool displaySMProperty(SMesh& mesh,
+                         PM pm,
+                         vertex_descriptor)
+  {
+    SMVertexDisplayer<PM> display_property(mesh, pm, this);
+    return display_property();
+  }
+
   template<typename PM>
-  bool displaySMProperty(SMesh& smesh, PM pm, face_descriptor);
-  template<typename TAG>
-  bool treat_sm_property(std::string name, SMesh* sm);
-  //cannot be treated as a sm_property because the property_map<>() function takes only 1 template arg.
-  bool treat_point_property(std::string name, Point_set* sm);
+  bool displaySMProperty(SMesh& mesh,
+                         PM pm,
+                         face_descriptor)
+  {
+    SMFaceDisplayer<PM> display_property(mesh, pm, this);
+    return display_property();
+  }
+
   template<typename Simplex>
-  bool is_property_scalar(std::string name, const SMesh* sm);
-  //same problem of number of templates
-  bool is_property_scalar(std::string name, const Point_set* ps);
-  template<typename Value_type>
-  void displayMapLegend(const std::vector<Value_type>& values)
+  bool displaySMProperty(const std::string& name,
+                         SMesh& mesh);
+
+private:
+  template <typename SimplexRange>
+  auto SimplexWithPropertyExtremum(const SimplexRange& simplex_range,
+                                   const SMesh& mesh,
+                                   const std::string& property_name,
+                                   const Extremum extremum) const
   {
-    // Create a legend_ and display it
-    const std::size_t size = (std::min)(color_map.size(), (std::size_t)256);
-    const int text_height = 20;
-    const int height = text_height*static_cast<int>(size) + text_height;
-    const int width = 140;
-    const int cell_width = width/3;
-    const int top_margin = 15;
-    const int left_margin = 5;
-    const int drawing_height = height - text_height + top_margin;
+    using Simplex = typename boost::range_value<SimplexRange>::type;
+
+    // We don't know what's the type of the property map so we can't simply do
+    //   mesh.property_map<Simplex, TYPE>(property_name),
+    // we have to try all acceptable types.
+    Simplex extremum_s;
+    call_on_SM_property<Simplex>(property_name, mesh,
+                                 [extremum, &extremum_s, &simplex_range](const auto pmap) -> bool
+                                 {
+                                   double extremum_value = (extremum == MIN_VALUE) ? ARBITRARY_DBL_MAX : - ARBITRARY_DBL_MAX;
+
+                                   for(Simplex s : simplex_range)
+                                   {
+                                     if((extremum == MIN_VALUE && get(pmap, s) < extremum_value) ||
+                                       (extremum == MAX_VALUE && get(pmap, s) > extremum_value))
+                                     {
+                                       extremum_value = get(pmap, s);
+                                       extremum_s = s;
+                                     }
+                                   }
+
+                                    return true;
+                                  });
+
+    CGAL_assertion(extremum_s != Simplex());
+    return extremum_s;
+  }
 
-    legend_ = QPixmap(width, height );
-    legend_.fill(QColor(200, 200, 200));
+  template <typename SimplexRange>
+  void zoomToSimplexWithPropertyExtremum(const SimplexRange& simplex_range,
+                                         const SMesh& mesh,
+                                         const std::string& property_name,
+                                         const Extremum extremum) const
+  {
+    using Simplex = typename boost::range_value<SimplexRange>::type;
 
-    QPainter painter(&legend_);
-    painter.setPen(Qt::black);
-    painter.setBrush(QColor(200, 200, 200));
+    const Simplex extremum_s = SimplexWithPropertyExtremum(simplex_range, mesh, property_name, extremum);
 
-    int j = 0;
-    int tick_height = text_height;
-    for (std::size_t i = 0; i< size; ++i, j+=tick_height)
-    {
-      QColor color(color_map[i].red(),
-                   color_map[i].green(),
-                   color_map[i].blue());
-      painter.fillRect(left_margin,
-                       drawing_height - top_margin - j,
-                       cell_width,
-                       tick_height,
-                       color);
-      QRect text_rect(left_margin + cell_width+10, drawing_height - top_margin - j,
-                          50, text_height);
-      painter.drawText(text_rect, Qt::AlignCenter, tr("%1").arg(values[i], 0, 'f', 3, QLatin1Char(' ')));
-    }
-    if(color_map.size() > size){
-      QRect text_rect(left_margin + cell_width+10, 0,
-                          50, text_height);
-      painter.drawText(text_rect, Qt::AlignCenter, tr("[...]"));
-    }
-    // draw right vertical line
-    painter.setPen(Qt::blue);
+    QString sid;
+    if(std::is_same<Simplex, vertex_descriptor>::value)
+      sid = QString("v%1").arg(extremum_s);
+    else
+      sid = QString("f%1").arg(extremum_s);
 
-    painter.drawLine(QPoint(left_margin + cell_width+10, drawing_height - top_margin +tick_height),
-                     QPoint(left_margin + cell_width+10,
-                            drawing_height - top_margin  - static_cast<int>(size)*tick_height+tick_height));
-    dock_widget->legendLabel->setPixmap(legend_);
-  }
-  void displayLegend()
+    face_descriptor unused_fd;
+    Point_3 unused_p;
+    ::zoomToId(mesh, sid,
+               getActiveViewer(),
+               unused_fd, unused_p);
+  };
+
+  void zoomToPointWithPropertyExtremum(const Point_set& ps,
+                                       const std::string& property_name,
+                                       const Extremum extremum) const
   {
-    // Create a legend_ and display it
-    const int height = 256;
-    const int width = 140;
-    const int cell_width = width/3;
-    const int top_margin = 5;
-    const int left_margin = 5;
-    const int drawing_height = height - top_margin * 2;
-    const int text_height = 20;
+    Point_set::Index extremum_i = -1;
+    call_on_PS_property(property_name, ps,
+                        [extremum, &extremum_i, &ps](const auto pmap) -> bool
+                        {
+                          double extremum_value = (extremum == MIN_VALUE) ? ARBITRARY_DBL_MAX : - ARBITRARY_DBL_MAX;
+
+                          for(Point_set::Index i : ps)
+                          {
+                            if((extremum == MIN_VALUE && get(pmap, i) < extremum_value) ||
+                              (extremum == MAX_VALUE && get(pmap, i) > extremum_value))
+                            {
+                              extremum_value = get(pmap, i);
+                              extremum_i = i;
+                            }
+                          }
+
+                          return true;
+                        });
+
+    CGAL_assertion(extremum_i != Point_set::Index(-1));
+    Point_3 unused_p;
+    ::zoomToPoint(ps, extremum_i,
+                  getActiveViewer(),
+                  unused_p);
+  }
 
-    legend_ = QPixmap(width, height + text_height);
-    legend_.fill(QColor(200, 200, 200));
+  void on_zoomToButton_pressed(const Extremum extremum)
+  {
+    const int property_index = dock_widget->propertyBox->currentIndex();
+    if(property_index < 0 || property_index >= dock_widget->propertyBox->count())
+      return;
 
-    QPainter painter(&legend_);
-    painter.setPen(Qt::black);
-    painter.setBrush(QColor(200, 200, 200));
+    Scene_item* item = scene->item(scene->mainSelectionIndex());
+    Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
+    if(sm_item)
+    {
+      const SMesh& mesh = *sm_item->face_graph();
 
-    double min_value(dock_widget->minBox->value()),
-        max_value(dock_widget->maxBox->value());
-    // Build legend_ data
-    std::vector<double> graduations(100);
-    for(int i=0; i<100; ++i)
-      graduations[i] = i/100.0;
+      const std::string& property_name = dock_widget->propertyBox->currentText().toStdString();
+      if(property_name == "Smallest Angle Per Face")
+        zoomToSimplexWithPropertyExtremum(faces(mesh), mesh, "f:display_plugin_smallest_angle", extremum);
+      else if(property_name == "Largest Angle Per Face")
+        zoomToSimplexWithPropertyExtremum(faces(mesh), mesh, "f:display_plugin_largest_angle", extremum);
+      else if(property_name == "Scaled Jacobian")
+        zoomToSimplexWithPropertyExtremum(faces(mesh), mesh, "f:display_plugin_scaled_jacobian", extremum);
+      else if(property_name == "Face Area")
+        zoomToSimplexWithPropertyExtremum(faces(mesh), mesh, "f:display_plugin_area", extremum);
+      else if(property_simplex_types.at(property_index) == Property_simplex_type::VERTEX)
+        zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, property_name, extremum);
+      else if(property_simplex_types.at(property_index) == Property_simplex_type::FACE)
+        zoomToSimplexWithPropertyExtremum(faces(mesh), mesh, property_name, extremum);
+    }
 
-    int i=0;
-    for (std::vector<double>::iterator it = graduations.begin(), end = graduations.end();
-         it != end; ++it, i+=2)
+    Scene_points_with_normal_item* ps_item = qobject_cast<Scene_points_with_normal_item*>(item);
+    if(ps_item)
     {
-      QColor color(255*color_ramp.r(*it),
-                   255*color_ramp.g(*it),
-                   255*color_ramp.b(*it));
-      painter.fillRect(left_margin,
-                       drawing_height - top_margin - i,
-                       cell_width,
-                       2,
-                       color);
-    }
-    // draw right vertical line
-    painter.setPen(Qt::blue);
+      const Point_set& ps = *ps_item->point_set();
 
-    painter.drawLine(QPoint(left_margin + cell_width+10, drawing_height - top_margin + 2),
-                     QPoint(left_margin + cell_width+10,
-                            drawing_height - top_margin - static_cast<int>(graduations.size())*2 + 2));
-    // draw min value and max value
-    painter.setPen(Qt::blue);
-    QRect min_text_rect(left_margin + cell_width+10,drawing_height - top_margin,
-                        100, text_height);
-    painter.drawText(min_text_rect, Qt::AlignCenter, tr("%1").arg(min_value, 0, 'f', 1));
+      const std::string& property_name = dock_widget->propertyBox->currentText().toStdString();
+      zoomToPointWithPropertyExtremum(ps, property_name, extremum);
+    }
+  }
 
-    QRect max_text_rect(left_margin + cell_width+10, drawing_height - top_margin - 200,
-                        100, text_height);
-    painter.drawText(max_text_rect, Qt::AlignCenter, tr("%1").arg(max_value, 0, 'f', 1));
+private Q_SLOTS:
+  void on_zoomToMinButton_pressed()
+  {
+    on_zoomToButton_pressed(MIN_VALUE);
+  }
 
-    dock_widget->legendLabel->setPixmap(legend_);
+  void on_zoomToMaxButton_pressed()
+  {
+    on_zoomToButton_pressed(MAX_VALUE);
   }
 
-  double scaled_jacobian(const face_descriptor& f , const SMesh &mesh);
-  QList<QAction*> _actions;
-  Color_ramp color_ramp;
-  std::vector<QColor> color_map;
-  DockWidget* dock_widget;
-  double rm;
-  double rM;
-  double rI;
-  double gm;
-  double gM;
-  double gI;
-  double bm;
-  double bM;
-  double bI;
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > jacobian_min;
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > jacobian_max;
-
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > angles_min;
-  std::unordered_map<Scene_surface_mesh_item*, std::pair<double, SMesh::Face_index> > angles_max;
-  std::unordered_map<Scene_surface_mesh_item*, Vertex_source_map> is_source;
-
-
-  double minBox;
-  double maxBox;
-  QPixmap legend_;
-
-  Scene_surface_mesh_item* current_item;
-  Scene_points_with_normal_item* source_points;
-  std::unordered_map<Scene_surface_mesh_item*, Scene_points_with_normal_item*> mesh_sources_map;
-  std::unordered_map<Scene_surface_mesh_item*, Scene_heat_item*> mesh_heat_item_map;
-
-  std::unordered_map<Scene_surface_mesh_item*, Heat_method*> mesh_heat_method_map;
-  std::unordered_map<Scene_surface_mesh_item*, Heat_method_idt*> mesh_heat_method_idt_map;
-
-  template<typename, typename, typename> friend class PropertyDisplayer;
-
-  //CRTP used to display properties of surface meshes(vertex and face) and point set.
+private:
+  template<typename, typename, typename>
+  friend class PropertyDisplayer;
+
+  // CRTP used to display properties of surface meshes (vertex and face) and point sets.
   template <class DataSet, class PM, class CRTP_derived_class>
   struct PropertyDisplayer
   {
-    typedef typename PM::value_type Value_type;
-    PropertyDisplayer(DataSet& ds, PM pm, DisplayPropertyPlugin* parent)
-      :dataset(ds), property_map(pm), parent(parent)
-    {}
+    using value_type = typename PM::value_type;
+
+    DataSet& dataset;
+    PM property_map;
+    std::vector<value_type> values;
+    Display_property_plugin* parent;
+
+    PropertyDisplayer(DataSet& ds,
+                      PM pm,
+                      Display_property_plugin* parent)
+      : dataset(ds), property_map(pm), parent(parent)
+    { }
 
-    virtual void fill_values(){}
-    virtual void set_colors_map(std::unordered_map<Value_type, std::size_t> &){}
-    virtual void set_colors_ramp(){}
     bool operator()()
     {
-      parent->minBox = ARBITRARY_DBL_MAX;
-      parent->maxBox = -ARBITRARY_DBL_MAX;
       static_cast<CRTP_derived_class*>(this)->fill_values();
       std::sort(values.begin(), values.end());
       auto end = std::unique(values.begin(), values.end());
 
+      parent->dock_widget->minBox->setValue(*values.begin());
+      parent->dock_widget->maxBox->setValue(*(std::prev(end)));
 
-      parent->minBox = *values.begin();
-      parent->maxBox = *(end-1);
-      parent->dock_widget->minBox->setValue(parent->minBox);
-      parent->dock_widget->maxBox->setValue(parent->maxBox);
-
-      //fill color pmap
-      if(parent->dock_widget->colorChoiceWidget->currentIndex() == 1)
+      // fill color pmap
+      if(parent->dock_widget->colorRampRadioButton->isChecked())
       {
-        std::unordered_map<Value_type, std::size_t> value_index_map;
-        //fill map
-        std::size_t counter = 0;
-        for(auto it = values.begin(); it != end; ++it)
-        {
-          value_index_map[*it] = counter++;
-        }
-        parent->color_map.clear();
-        compute_color_map(QColor(parent->rI, parent->gI, parent->bI),std::distance(values.begin(), end),
-                          std::back_inserter(parent->color_map));
-        static_cast<CRTP_derived_class*>(this)->set_colors_map(value_index_map);
-        parent->displayMapLegend(values);
+        // scale a color ramp between min and max
+        parent->displayRampLegend();
+        static_cast<CRTP_derived_class*>(this)->color_with_ramp();
       }
       else
       {
-        //scale a color ramp between min and max
-        parent->replaceRamp();
-        static_cast<CRTP_derived_class*>(this)->set_colors_ramp();
+        CGAL_assertion(parent->dock_widget->randomColorsRadioButton->isChecked());
+
+        // generate color map
+        parent->color_map.clear();
+        compute_color_map(QColor(255 * parent->rI, 255 * parent->gI, 255 * parent->bI),
+                          std::distance(values.begin(), end),
+                          std::back_inserter(parent->color_map));
+
+        // fill map
+        std::unordered_map<value_type, std::size_t> value_index_map;
+        std::size_t counter = 0;
+        for(auto it=values.begin(); it!=end; ++it)
+          value_index_map[*it] = counter++;
+
+        static_cast<CRTP_derived_class*>(this)->color_with_map(value_index_map);
+        parent->displayMapLegend(values);
       }
+
       return true;
     }
-
-
-    DataSet& dataset;
-    PM property_map;
-    std::vector<Value_type> values;
-    DisplayPropertyPlugin* parent;
-  };
+  }; // struct PropertyDisplayer
 
   template <class PM>
   struct PSDisplayer
     : public PropertyDisplayer<Point_set, PM, PSDisplayer<PM> >
   {
-    typedef typename PM::value_type Value_type;
-    typedef PropertyDisplayer<Point_set, PM, PSDisplayer<PM> > Base;
-    PSDisplayer(Point_set& ds, PM pm, DisplayPropertyPlugin* parent)
-      :Base(ds, pm, parent)
+    using Base = PropertyDisplayer<Point_set, PM, PSDisplayer<PM> >;
+    using value_type = typename PM::value_type;
+
+    PSDisplayer(Point_set& ps,
+                PM pm,
+                Display_property_plugin* parent)
+      : Base(ps, pm, parent)
     {}
+
     void fill_values()
     {
-      for(auto p : this->dataset)
-      {
+      for(const auto& p : this->dataset)
         this->values.push_back(this->property_map[p]);
-      }
     }
 
-    void set_colors_map(std::unordered_map<Value_type, std::size_t> &value_index_map)
+    void color_with_map(std::unordered_map<value_type, std::size_t>& value_index_map)
     {
-      for(Point_set::iterator pit = this->dataset.begin();
-          pit != this->dataset.end();
-          ++pit)
+      for(const auto& p : this->dataset)
       {
-        CGAL::IO::Color color(
-              this->parent->color_map[value_index_map[this->property_map[*pit]]].red(),
-              this->parent->color_map[value_index_map[this->property_map[*pit]]].green(),
-              this->parent->color_map[value_index_map[this->property_map[*pit]]].blue());
-        this->dataset.set_color(*pit, color.red(), color.green(), color.blue());
+        CGAL::IO::Color color(this->parent->color_map[value_index_map[this->property_map[p]]].red(),
+                              this->parent->color_map[value_index_map[this->property_map[p]]].green(),
+                              this->parent->color_map[value_index_map[this->property_map[p]]].blue());
+        this->dataset.set_color(p, color.red(), color.green(), color.blue());
       }
     }
 
-    void set_colors_ramp()
+    void color_with_ramp() const
     {
-      float max = this->parent->maxBox;
-      float min = this->parent->minBox;
-      for(Point_set::iterator pit = this->dataset.begin();
-          pit != this->dataset.end();
-          ++pit)
+      double min = this->parent->dock_widget->minBox->value();
+      double max = this->parent->dock_widget->maxBox->value();
+      for(const auto& p : this->dataset)
       {
         if(min == max)
-          --min;
-        float f = (static_cast<float>(this->property_map[*pit])-min)/(max-min);
-        if(f<0)
-          f = 0;
-        if(f>1)
-          f = 1;
-        CGAL::IO::Color color(
-              255*this->parent->color_ramp.r(f),
-              255*this->parent->color_ramp.g(f),
-              255*this->parent->color_ramp.b(f));
-        this->dataset.set_color(*pit, color.red(), color.green(), color.blue());
-      }
-    }
+          min -= 1.;
 
-  };
+        double val = (this->property_map[p] - min) / (max - min);
+        val = boost::algorithm::clamp<double>(val, 0., 1.);
 
+        CGAL::IO::Color color(255 * this->parent->color_ramp.r(val),
+                              255 * this->parent->color_ramp.g(val),
+                              255 * this->parent->color_ramp.b(val));
+        this->dataset.set_color(p, color.red(), color.green(), color.blue());
+      }
+    }
+  }; // PSDisplayer
 
   template <class PM>
   struct SMVertexDisplayer
     : public PropertyDisplayer<SMesh, PM, SMVertexDisplayer<PM> >
   {
-    typedef typename PM::value_type Value_type;
-    typedef PropertyDisplayer<SMesh, PM, SMVertexDisplayer<PM> > Base;
-    SMVertexDisplayer(SMesh& ds, PM pm, DisplayPropertyPlugin* parent)
-      :Base(ds, pm, parent)
+    using Base = PropertyDisplayer<SMesh, PM, SMVertexDisplayer<PM> > ;
+    using value_type = typename PM::value_type;
+
+    SMVertexDisplayer(SMesh& mesh,
+                      PM pm,
+                      Display_property_plugin* parent)
+      : Base(mesh, pm, parent)
     {}
 
     void fill_values()
     {
-      for(auto v : vertices(this->dataset))
-      {
+      for(vertex_descriptor v : vertices(this->dataset))
         this->values.push_back(this->property_map[v]);
-      }
     }
 
-    void set_colors_map(std::unordered_map<Value_type, std::size_t> &value_index_map)
+    void color_with_map(std::unordered_map<value_type, std::size_t>& value_index_map) const
     {
       SMesh::Property_map<vertex_descriptor, CGAL::IO::Color> vcolors =
           this->dataset.template add_property_map<vertex_descriptor, CGAL::IO::Color >("v:color", CGAL::IO::Color()).first;
-      for(boost::graph_traits<SMesh>::vertex_iterator vit = vertices(this->dataset).begin();
-          vit != vertices(this->dataset).end();
-          ++vit)
+      for(vertex_descriptor v : vertices(this->dataset))
       {
-        CGAL::IO::Color color(
-              this->parent->color_map[value_index_map[this->property_map[*vit]]].red(),
-              this->parent->color_map[value_index_map[this->property_map[*vit]]].green(),
-              this->parent->color_map[value_index_map[this->property_map[*vit]]].blue());
-        vcolors[*vit] = color;
+        CGAL::IO::Color color(this->parent->color_map[value_index_map[this->property_map[v]]].red(),
+                              this->parent->color_map[value_index_map[this->property_map[v]]].green(),
+                              this->parent->color_map[value_index_map[this->property_map[v]]].blue());
+        vcolors[v] = color;
       }
     }
 
-    void set_colors_ramp()
+    void color_with_ramp() const
     {
       SMesh::Property_map<vertex_descriptor, CGAL::IO::Color> vcolors =
           this->dataset.template add_property_map<vertex_descriptor, CGAL::IO::Color >("v:color", CGAL::IO::Color()).first;
-      float max = this->parent->maxBox;
-      float min = this->parent->minBox;
-      for(boost::graph_traits<SMesh>::vertex_iterator vit = vertices(this->dataset).begin();
-          vit != vertices(this->dataset).end();
-          ++vit)
+
+      double min = this->parent->dock_widget->minBox->value();
+      double max = this->parent->dock_widget->maxBox->value();
+
+      if(min == max)
+        min -= 1.;
+
+      for(vertex_descriptor v : vertices(this->dataset))
       {
-        if(min == max)
-          --min;
-        float f = (static_cast<float>(this->property_map[*vit])-min)/(max-min);
-        if(f<0)
-          f = 0;
-        if(f>1)
-          f = 1;
-        CGAL::IO::Color color(
-              255*this->parent->color_ramp.r(f),
-              255*this->parent->color_ramp.g(f),
-              255*this->parent->color_ramp.b(f));
-        vcolors[*vit] = color;
+        double val = (this->property_map[v] - min) / (max - min);
+        val = boost::algorithm::clamp<double>(val, 0., 1.);
+
+        CGAL::IO::Color color(255 * this->parent->color_ramp.r(val),
+                              255 * this->parent->color_ramp.g(val),
+                              255 * this->parent->color_ramp.b(val));
+        vcolors[v] = color;
       }
     }
-  };
+  }; // struct SMVertexDisplayer
 
   template <class PM>
   struct SMFaceDisplayer
     : public PropertyDisplayer<SMesh, PM, SMFaceDisplayer<PM> >
   {
-    typedef PropertyDisplayer<SMesh, PM, SMFaceDisplayer<PM> > Base;
-    typedef typename PM::value_type Value_type;
-    SMFaceDisplayer(SMesh& ds, PM pm, DisplayPropertyPlugin* parent)
-      :Base(ds, pm, parent)
-    {}
+    using Base = PropertyDisplayer<SMesh, PM, SMFaceDisplayer<PM> >;
+    using value_type = typename PM::value_type;
+
+    SMFaceDisplayer(SMesh& mesh,
+                    PM pm,
+                    Display_property_plugin* parent)
+      : Base(mesh, pm, parent)
+    { }
+
     void fill_values()
     {
-      for(auto f : faces(this->dataset))
-      {
+      for(face_descriptor f : faces(this->dataset))
         this->values.push_back(this->property_map[f]);
-      }
     }
 
-    void set_colors_map(std::unordered_map<Value_type, std::size_t> &value_index_map)
+    void color_with_map(std::unordered_map<value_type, std::size_t>& value_index_map) const
     {
       SMesh::Property_map<face_descriptor, CGAL::IO::Color> fcolors =
           this->dataset.template add_property_map<face_descriptor, CGAL::IO::Color >("f:color", CGAL::IO::Color()).first;
-      for(boost::graph_traits<SMesh>::face_iterator fit = faces(this->dataset).begin();
-          fit != faces(this->dataset).end();
-          ++fit)
+      for(face_descriptor f : faces(this->dataset))
       {
-        CGAL::IO::Color color(
-              this->parent->color_map[value_index_map[this->property_map[*fit]]].red(),
-              this->parent->color_map[value_index_map[this->property_map[*fit]]].green(),
-              this->parent->color_map[value_index_map[this->property_map[*fit]]].blue());
-        fcolors[*fit] = color;
+        CGAL::IO::Color color(this->parent->color_map[value_index_map[this->property_map[f]]].red(),
+                              this->parent->color_map[value_index_map[this->property_map[f]]].green(),
+                              this->parent->color_map[value_index_map[this->property_map[f]]].blue());
+        fcolors[f] = color;
       }
     }
 
-    void set_colors_ramp()
+    void color_with_ramp() const
     {
       SMesh::Property_map<face_descriptor, CGAL::IO::Color> fcolors =
           this->dataset.template add_property_map<face_descriptor, CGAL::IO::Color >("f:color", CGAL::IO::Color()).first;
-      float max = this->parent->maxBox;
-      float min = this->parent->minBox;
-      for(boost::graph_traits<SMesh>::face_iterator fit = faces(this->dataset).begin();
-          fit != faces(this->dataset).end();
-          ++fit)
+
+      double min = this->parent->dock_widget->minBox->value();
+      double max = this->parent->dock_widget->maxBox->value();
+
+      if(min == max)
+        min -= 1.;
+
+      for(face_descriptor f : faces(this->dataset))
       {
-        if(min == max)
-          --min;
-        float f = (static_cast<float>(this->property_map[*fit])-min)/(max-min);
-        if(f<0)
-          f = 0;
-        if(f>1)
-          f = 1;
-        CGAL::IO::Color color(
-              255*this->parent->color_ramp.r(f),
-              255*this->parent->color_ramp.g(f),
-              255*this->parent->color_ramp.b(f));
-        fcolors[*fit] = color;
+        double val = (this->property_map[f] - min) / (max - min);
+        val = boost::algorithm::clamp<double>(val, 0., 1.);
+
+        CGAL::IO::Color color(255 * this->parent->color_ramp.r(val),
+                              255 * this->parent->color_ramp.g(val),
+                              255 * this->parent->color_ramp.b(val));
+        fcolors[f] = color;
       }
     }
-  };
-
+  }; // struct SMFaceDisplayer
 };
 
   /// Code based on the verdict module of vtk
 
-  /*=========================================================================
+/*=========================================================================
   Copyright (c) 2006 Sandia Corporation.
   All rights reserved.
   See Copyright.txt or https://www.kitware.com/Copyright.htm for details.
@@ -1701,381 +1227,170 @@ private Q_SLOTS:
      PURPOSE.  See the above copyright notice for more information.
 =========================================================================*/
 
-  double DisplayPropertyPlugin::scaled_jacobian( const face_descriptor& f , const SMesh& mesh)
-  {
-    boost::property_map<SMesh, boost::vertex_point_t>::type
-        pmap = get(boost::vertex_point, mesh);
-    std::vector<double> corner_areas(degree(f, mesh));
-    std::vector<EPICK::Vector_3> edges;
-    for(halfedge_descriptor hd : CGAL::halfedges_around_face(halfedge(f, mesh), mesh))
-    {
-      edges.push_back(EPICK::Vector_3(get(pmap, source(hd, mesh)), get(pmap, target(hd, mesh))));
-    }
-    std::vector<EPICK::Vector_3> corner_normals;
-    for(std::size_t i = 0; i < edges.size(); ++i)
-    {
-      corner_normals.push_back(CGAL::cross_product(edges[i], edges[(i+1)%(edges.size())]));
-    }
-
+double
+Display_property_plugin::
+scaled_jacobian(const face_descriptor f,
+                const SMesh& mesh) const
+{
+  boost::property_map<SMesh, boost::vertex_point_t>::type vpm = get(boost::vertex_point, mesh);
+  std::vector<double> corner_areas(degree(f, mesh));
 
-    EPICK::Vector_3 unit_center_normal = CGAL::Polygon_mesh_processing::compute_face_normal(f, mesh);
-    unit_center_normal *= 1.0/CGAL::approximate_sqrt(unit_center_normal.squared_length());
+  std::vector<EPICK::Vector_3> edges;
+  for(halfedge_descriptor hd : CGAL::halfedges_around_face(halfedge(f, mesh), mesh))
+  {
+    edges.emplace_back(get(vpm, source(hd, mesh)),
+                       get(vpm, target(hd, mesh)));
+  }
 
-    for(std::size_t i = 0; i < corner_areas.size(); ++i)
-    {
-      corner_areas[i] =  unit_center_normal*corner_normals[i];
-    }
-    std::vector<double> length;
-    for(std::size_t i=0; i<edges.size(); ++i)
-    {
-      length.push_back(CGAL::approximate_sqrt(edges[i].squared_length()));
-      if( length[i] < ARBITRARY_DBL_MIN)
-        return 0.0;
-    }
-    double min_scaled_jac = ARBITRARY_DBL_MAX;
-    for(std::size_t i=0; i<edges.size(); ++i)
-    {
-      double scaled_jac = corner_areas[i] / (length[i] * length[(i+edges.size()-1)%(edges.size())]);
-      min_scaled_jac = (std::min)( scaled_jac, min_scaled_jac );
-    }
+  std::vector<EPICK::Vector_3> corner_normals;
+  for(std::size_t i=0; i<edges.size(); ++i)
+    corner_normals.push_back(CGAL::cross_product(edges[i], edges[(i+1)%(edges.size())]));
 
-    if( min_scaled_jac > 0 )
-      return (double) (std::min)( min_scaled_jac, ARBITRARY_DBL_MAX );
-    return (double) (std::max)( min_scaled_jac, -ARBITRARY_DBL_MAX );
+  EPICK::Vector_3 unit_center_normal = CGAL::Polygon_mesh_processing::compute_face_normal(f, mesh);
 
-  }
+  for(std::size_t i=0; i<corner_areas.size(); ++i)
+    corner_areas[i] =  unit_center_normal*corner_normals[i];
 
-  bool DisplayPropertyPlugin::is_property_scalar(std::string name, const Point_set* ps)
+  std::vector<double> length;
+  for(std::size_t i=0; i<edges.size(); ++i)
   {
-    if(name == "red"
-       || name == "green"
-       || name == "blue")
-    {
-      return false;
-    }
-
-    if(ps->template property_map<boost::int8_t>(name).second)
-    {
-      return true;
-    }
-    if(ps->template property_map<boost::uint8_t>(name).second)
-    {
-      return true;
-    }
-    if(ps->template property_map<boost::int16_t>(name).second)
-    {
-      return true;
-    }
-    if(ps->template property_map<boost::uint16_t>(name).second)
-    {
-      return true;
-    }
-    if(ps->template property_map<boost::int32_t>(name).second)
-    {
-      return true;
-    }
-    if(ps->template property_map<boost::uint32_t>(name).second)
-    {
-      return true;
-    }
-    if(ps->template property_map<boost::int64_t>(name).second)
-    {
-      return true;
-    }
-    if(ps->template property_map<boost::uint64_t>(name).second)
-    {
-      return true;
-    }
-    if(ps->template property_map<float>(name).second)
-    {
-      return true;
-    }
-    if(ps->template property_map<double>(name).second)
-    {
-      return true;
-    }
-    return false;
+    length.push_back(CGAL::approximate_sqrt(edges[i].squared_length()));
+    if(length[i] < ARBITRARY_DBL_MIN)
+      return 0.;
   }
 
-  template<typename Simplex>
-  bool DisplayPropertyPlugin::is_property_scalar(std::string name, const SMesh* sm)
+  double min_scaled_jac = ARBITRARY_DBL_MAX;
+  for(std::size_t i=0; i<edges.size(); ++i)
   {
-
-    if(sm->template property_map<Simplex,boost::int8_t>(name).second)
-    {
-      return true;
-    }
-    if(sm->template property_map<Simplex,boost::uint8_t>(name).second)
-    {
-      return true;
-    }
-    if(sm->template property_map<Simplex,boost::int16_t>(name).second)
-    {
-      return true;
-    }
-    if(sm->template property_map<Simplex,boost::uint16_t>(name).second)
-    {
-      return true;
-    }
-    if(sm->template property_map<Simplex,boost::int32_t>(name).second)
-    {
-      return true;
-    }
-    if(sm->template property_map<Simplex,boost::uint32_t>(name).second)
-    {
-      return true;
-    }
-    if(sm->template property_map<Simplex,boost::int64_t>(name).second)
-    {
-      return true;
-    }
-    if(sm->template property_map<Simplex,boost::uint64_t>(name).second)
-    {
-      return true;
-    }
-    if(sm->template property_map<Simplex,float>(name).second)
-    {
-      return true;
-    }
-    if(sm->template property_map<Simplex,double>(name).second)
-    {
-      return true;
-    }
-    return false;
+    double scaled_jac = corner_areas[i] / (length[i] * length[(i+edges.size()-1)%(edges.size())]);
+    min_scaled_jac = (std::min)(scaled_jac, min_scaled_jac);
   }
 
-  bool DisplayPropertyPlugin::treat_point_property(std::string name, Point_set* ps)
-  {
-    typedef typename Point_set::template Property_map<boost::int8_t>   Int8_map;
-    typedef typename Point_set::template Property_map<boost::uint8_t>  Uint8_map;
-    typedef typename Point_set::template Property_map<boost::int16_t>  Int16_map;
-    typedef typename Point_set::template Property_map<boost::uint16_t> Uint16_map;
-    typedef typename Point_set::template Property_map<boost::int32_t>  Int32_map;
-    typedef typename Point_set::template Property_map<boost::uint32_t> Uint32_map;
-    typedef typename Point_set::template Property_map<boost::int64_t>  Int64_map;
-    typedef typename Point_set::template Property_map<boost::uint64_t> Uint64_map;
-    typedef typename Point_set::template Property_map<float>           Float_map;
-    typedef typename Point_set::template Property_map<double>          Double_map;
-
-    bool okay = false;
-    {
-      Int8_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::int8_t>(name);
-      if(okay)
-      {
-        return displayPSProperty(ps, pmap);
-      }
-    }
-
-    {
-      Uint8_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::uint8_t>(name);
-      if(okay)
-      {
-        return displayPSProperty(ps, pmap);
-      }
-    }
-
-    {
-      Int16_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::int16_t>(name);
-      if(okay)
-      {
-        return displayPSProperty(ps, pmap);
-      }
-    }
-
-    {
-      Uint16_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::uint16_t>(name);
-      if(okay)
-      {
-        return displayPSProperty(ps, pmap);
-      }
-    }
-
-    {
-      Int32_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::int32_t>(name);
-      if(okay)
-      {
-        return displayPSProperty(ps, pmap);
-      }
-    }
-
-    {
-      Uint32_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::uint32_t>(name);
-      if(okay)
-      {
-        return displayPSProperty(ps, pmap);
-      }
-    }
-
-    {
-      Int64_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::int64_t>(name);
-      if(okay)
-      {
-        return displayPSProperty(ps, pmap);
-      }
-    }
-
-    {
-      Uint64_map pmap;
-      std::tie(pmap, okay) = ps->property_map<boost::uint64_t>(name);
-      if(okay)
-      {
-        return displayPSProperty(ps, pmap);
-      }
-    }
+  if(min_scaled_jac > 0)
+    return (std::min)(min_scaled_jac, ARBITRARY_DBL_MAX);
 
-    {
-      Float_map pmap;
-      std::tie(pmap, okay) = ps->property_map<float>(name);
-      if(okay)
-      {
-        return displayPSProperty(ps, pmap);
-      }
-    }
+  return (std::max)(min_scaled_jac, -ARBITRARY_DBL_MAX);
+}
 
-    {
-      Double_map pmap;
-      std::tie(pmap, okay) = ps->property_map<double>(name);
-      if(okay)
-      {
-        return displayPSProperty(ps, pmap);
-      }
-    }
+bool
+Display_property_plugin::
+isPSPropertyScalar(const std::string& name,
+                   const Point_set& ps) const
+{
+  if(name == "red" || name == "green" || name == "blue")
     return false;
-  }
-
-  template<typename TAG>
-  bool DisplayPropertyPlugin::treat_sm_property(std::string name, SMesh* sm)
-  {
-    typedef typename SMesh::template Property_map<TAG, boost::int8_t>   Int8_map;
-    typedef typename SMesh::template Property_map<TAG, boost::uint8_t>  Uint8_map;
-    typedef typename SMesh::template Property_map<TAG, boost::int16_t>  Int16_map;
-    typedef typename SMesh::template Property_map<TAG, boost::uint16_t> Uint16_map;
-    typedef typename SMesh::template Property_map<TAG, boost::int32_t>  Int32_map;
-    typedef typename SMesh::template Property_map<TAG, boost::uint32_t> Uint32_map;
-    typedef typename SMesh::template Property_map<TAG, boost::int64_t>  Int64_map;
-    typedef typename SMesh::template Property_map<TAG, boost::uint64_t> Uint64_map;
-    typedef typename SMesh::template Property_map<TAG, float>           Float_map;
-    typedef typename SMesh::template Property_map<TAG, double>          Double_map;
-
-    bool okay = false;
-    {
-      Int8_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::int8_t>(name);
-      if(okay)
-      {
-        return displaySMProperty(*sm, pmap, TAG());
-      }
-    }
-
-    {
-      Uint8_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::uint8_t>(name);
-      if(okay)
-      {
-        return displaySMProperty(*sm, pmap, TAG());
-      }
-    }
-
-    {
-      Int16_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::int16_t>(name);
-      if(okay)
-      {
-        return displaySMProperty(*sm, pmap, TAG());
-      }
-    }
-
-    {
-      Uint16_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::uint16_t>(name);
-      if(okay)
-      {
-        return displaySMProperty(*sm, pmap, TAG());
-      }
-    }
-
-    {
-      Int32_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::int32_t>(name);
-      if(okay)
-      {
-        return displaySMProperty(*sm, pmap, TAG());
-      }
-    }
-
-    {
-      Uint32_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::uint32_t>(name);
-      if(okay)
-      {
-        return displaySMProperty(*sm, pmap, TAG());
-      }
-    }
-
-    {
-      Int64_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::int64_t>(name);
-      if(okay)
-      {
-        return displaySMProperty(*sm, pmap, TAG());
-      }
-    }
-
-    {
-      Uint64_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,boost::uint64_t>(name);
-      if(okay)
-      {
-        return displaySMProperty(*sm, pmap, TAG());
-      }
-    }
-
-    {
-      Float_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,float>(name);
-      if(okay)
-      {
-        return displaySMProperty(*sm, pmap, TAG());
-      }
-    }
 
-    {
-      Double_map pmap;
-      std::tie(pmap, okay) = sm->property_map<TAG,double>(name);
-      if(okay)
-      {
-        return displaySMProperty(*sm, pmap, TAG());
-      }
-    }
+  // the dispatch function does the filtering we want: if it founds a property
+  // with which it can call the functor, then it already has a property we want
+  return call_on_PS_property(name, ps, [](auto) -> bool { return true; });
+}
+
+// Shenanigans to deal with the fact that the value type is not known
+//
+// find the property map with the correct value, and call the functor
+template<typename Simplex>
+bool
+Display_property_plugin::
+isSMPropertyScalar(const std::string& name,
+                   const SMesh& mesh) const
+{
+  // do not detect this plugin's properties
+  if(name == "f:display_plugin_smallest_angle" ||
+     name == "f:display_plugin_largest_angle" ||
+     name == "f:display_plugin_scaled_jacobian" ||
+     name == "f:display_plugin_area")
     return false;
-  }
-
-  template<typename PM>
-  bool DisplayPropertyPlugin::displayPSProperty(Point_set* ps, PM pm)
-  {
-    PSDisplayer<PM> display_property(*ps, pm, this);
-    return display_property();
-  }
 
-  template<typename PM>
-  bool DisplayPropertyPlugin::displaySMProperty(SMesh& smesh, PM pm, vertex_descriptor)
-  {
-    SMVertexDisplayer<PM> display_property(smesh, pm, this);
-    return display_property();
-  }
+  // the dispatch function does the filtering we want: if it founds a property
+  // with which it can call the functor, then it already has a property we want
+  return call_on_SM_property<Simplex>(name, mesh, [](auto) -> bool { return true; });
+}
 
-  template<typename PM>
-  bool DisplayPropertyPlugin::displaySMProperty(SMesh& smesh, PM pm, face_descriptor)
-  {
-    SMFaceDisplayer<PM> display_property(smesh, pm, this);
-    return display_property();
-  }
+bool
+Display_property_plugin::
+displayPSProperty(const std::string& name,
+                  Point_set& ps)
+{
+  return call_on_PS_property(name, ps,
+                             [this, &ps](auto pmap) -> bool
+                             {
+                                return this->displayPSProperty(ps, pmap);
+                             });
+}
+
+template<typename Simplex>
+bool
+Display_property_plugin::
+displaySMProperty(const std::string& name,
+                  SMesh& mesh)
+{
+  return call_on_SM_property<Simplex>(name, mesh,
+                                      [this, &mesh](auto pmap) -> bool
+                                      {
+                                        return this->displaySMProperty(mesh, pmap, Simplex());
+                                      });
+}
+
+template<typename Functor>
+bool
+Display_property_plugin::
+call_on_PS_property(const std::string& name,
+                    const Point_set& ps,
+                    const Functor& functor) const
+{
+  if(ps.template property_map<boost::int8_t>(name).second)
+    return functor(ps.template property_map<boost::int8_t>(name).first);
+  else if(ps.template property_map<boost::uint8_t>(name).second)
+    return functor(ps.template property_map<boost::uint8_t>(name).first);
+  else if(ps.template property_map<boost::int16_t>(name).second)
+    return functor(ps.template property_map<boost::int16_t>(name).first);
+  else if(ps.template property_map<boost::uint16_t>(name).second)
+    return functor(ps.template property_map<boost::uint16_t>(name).first);
+  else if(ps.template property_map<boost::int32_t>(name).second)
+    return functor(ps.template property_map<boost::int32_t>(name).first);
+  else if(ps.template property_map<boost::uint32_t>(name).second)
+    return functor(ps.template property_map<boost::uint32_t>(name).first);
+  else if(ps.template property_map<boost::int64_t>(name).second)
+    return functor(ps.template property_map<boost::int64_t>(name).first);
+  else if(ps.template property_map<boost::uint64_t>(name).second)
+    return functor(ps.template property_map<boost::uint64_t>(name).first);
+  else if(ps.template property_map<float>(name).second)
+    return functor(ps.template property_map<float>(name).first);
+  else if(ps.template property_map<double>(name).second)
+    return functor(ps.template property_map<double>(name).first);
+
+  return false;
+}
+
+template <typename Simplex, typename Functor>
+bool
+Display_property_plugin::
+call_on_SM_property(const std::string& name,
+                    const SMesh& mesh,
+                    const Functor& functor) const
+{
+  if(mesh.template property_map<Simplex, boost::int8_t>(name).second)
+    return functor(mesh.template property_map<Simplex, boost::int8_t>(name).first);
+  else if(mesh.template property_map<Simplex, boost::uint8_t>(name).second)
+    return functor(mesh.template property_map<Simplex, boost::uint8_t>(name).first);
+  else if(mesh.template property_map<Simplex, boost::int16_t>(name).second)
+    return functor(mesh.template property_map<Simplex, boost::int16_t>(name).first);
+  else if(mesh.template property_map<Simplex, boost::uint16_t>(name).second)
+    return functor(mesh.template property_map<Simplex, boost::uint16_t>(name).first);
+  else if(mesh.template property_map<Simplex, boost::int32_t>(name).second)
+    return functor(mesh.template property_map<Simplex, boost::int32_t>(name).first);
+  else if(mesh.template property_map<Simplex, boost::uint32_t>(name).second)
+    return functor(mesh.template property_map<Simplex, boost::uint32_t>(name).first);
+  else if(mesh.template property_map<Simplex, boost::int64_t>(name).second)
+    return functor(mesh.template property_map<Simplex, boost::int64_t>(name).first);
+  else if(mesh.template property_map<Simplex, boost::uint64_t>(name).second)
+    return functor(mesh.template property_map<Simplex, boost::uint64_t>(name).first);
+  else if(mesh.template property_map<Simplex, float>(name).second)
+    return functor(mesh.template property_map<Simplex, float>(name).first);
+  else if(mesh.template property_map<Simplex, double>(name).second)
+    return functor(mesh.template property_map<Simplex, double>(name).first);
+
+  return false;
+}
 
 #include "Display_property_plugin.moc"
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method.ui b/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method.ui
new file mode 100644
index 000000000000..0c7440b2236b
--- /dev/null
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method.ui
@@ -0,0 +1,294 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<ui version="4.0">
+ <class>HeatMethodWidget</class>
+ <widget class="QDockWidget" name="HeatMethodWidget">
+  <property name="enabled">
+   <bool>true</bool>
+  </property>
+  <property name="geometry">
+   <rect>
+    <x>0</x>
+    <y>0</y>
+    <width>365</width>
+    <height>708</height>
+   </rect>
+  </property>
+  <property name="minimumSize">
+   <size>
+    <width>365</width>
+    <height>708</height>
+   </size>
+  </property>
+  <property name="windowTitle">
+   <string>Heat Method</string>
+  </property>
+  <widget class="QWidget" name="dockWidgetContents">
+   <layout class="QGridLayout" name="gridLayout_3">
+    <item row="3" column="0">
+     <layout class="QGridLayout" name="coloringGroup" columnstretch="50,50">
+      <item row="2" column="0">
+       <spacer name="verticalSpacer_4">
+        <property name="enabled">
+         <bool>true</bool>
+        </property>
+        <property name="orientation">
+         <enum>Qt::Vertical</enum>
+        </property>
+        <property name="sizeHint" stdset="0">
+         <size>
+          <width>20</width>
+          <height>40</height>
+         </size>
+        </property>
+       </spacer>
+      </item>
+      <item row="0" column="1" rowspan="3">
+       <widget class="QScrollArea" name="scrollArea">
+        <property name="enabled">
+         <bool>true</bool>
+        </property>
+        <property name="widgetResizable">
+         <bool>true</bool>
+        </property>
+        <widget class="QWidget" name="scrollAreaWidgetContents">
+         <property name="geometry">
+          <rect>
+           <x>0</x>
+           <y>0</y>
+           <width>161</width>
+           <height>371</height>
+          </rect>
+         </property>
+         <layout class="QGridLayout" name="gridLayout_5">
+          <item row="0" column="0" alignment="Qt::AlignHCenter">
+           <widget class="QLabel" name="legendLabel">
+            <property name="enabled">
+             <bool>true</bool>
+            </property>
+            <property name="text">
+             <string>RAMP DISPLAYING</string>
+            </property>
+           </widget>
+          </item>
+         </layout>
+        </widget>
+       </widget>
+      </item>
+      <item row="1" column="0">
+       <widget class="QGroupBox" name="coloringChoiceGroup">
+        <property name="enabled">
+         <bool>true</bool>
+        </property>
+        <property name="title">
+         <string>Color Ramp</string>
+        </property>
+        <layout class="QGridLayout" name="gridLayout_2" columnstretch="50,50">
+         <property name="leftMargin">
+          <number>0</number>
+         </property>
+         <property name="topMargin">
+          <number>0</number>
+         </property>
+         <property name="rightMargin">
+          <number>0</number>
+         </property>
+         <property name="bottomMargin">
+          <number>0</number>
+         </property>
+         <item row="2" column="0">
+          <widget class="QLabel" name="minColorLabel">
+           <property name="enabled">
+            <bool>true</bool>
+           </property>
+           <property name="text">
+            <string>Min color</string>
+           </property>
+          </widget>
+         </item>
+         <item row="2" column="1">
+          <widget class="QPushButton" name="minColorButton">
+           <property name="enabled">
+            <bool>true</bool>
+           </property>
+           <property name="styleSheet">
+            <string notr="true"/>
+           </property>
+           <property name="text">
+            <string/>
+           </property>
+          </widget>
+         </item>
+         <item row="4" column="0">
+          <widget class="QLabel" name="maxColorLabel">
+           <property name="enabled">
+            <bool>true</bool>
+           </property>
+           <property name="text">
+            <string>Max color</string>
+           </property>
+          </widget>
+         </item>
+         <item row="4" column="1">
+          <widget class="QPushButton" name="maxColorButton">
+           <property name="enabled">
+            <bool>true</bool>
+           </property>
+           <property name="text">
+            <string/>
+           </property>
+          </widget>
+         </item>
+        </layout>
+       </widget>
+      </item>
+      <item row="0" column="0">
+       <spacer name="verticalSpacer">
+        <property name="enabled">
+         <bool>true</bool>
+        </property>
+        <property name="orientation">
+         <enum>Qt::Vertical</enum>
+        </property>
+        <property name="sizeHint" stdset="0">
+         <size>
+          <width>20</width>
+          <height>40</height>
+         </size>
+        </property>
+       </spacer>
+      </item>
+     </layout>
+    </item>
+    <item row="0" column="0" colspan="2">
+     <widget class="QGroupBox" name="methodGroup">
+      <property name="enabled">
+       <bool>true</bool>
+      </property>
+      <property name="title">
+       <string>Method</string>
+      </property>
+      <layout class="QVBoxLayout" name="verticalLayout_2">
+       <property name="leftMargin">
+        <number>6</number>
+       </property>
+       <property name="topMargin">
+        <number>6</number>
+       </property>
+       <property name="rightMargin">
+        <number>6</number>
+       </property>
+       <property name="bottomMargin">
+        <number>6</number>
+       </property>
+       <item>
+        <widget class="QComboBox" name="methodBox">
+         <property name="enabled">
+          <bool>true</bool>
+         </property>
+        </widget>
+       </item>
+      </layout>
+     </widget>
+    </item>
+    <item row="13" column="0">
+     <widget class="QGroupBox" name="extremeValueGroup">
+      <property name="enabled">
+       <bool>true</bool>
+      </property>
+      <property name="title">
+       <string>Extreme Value</string>
+      </property>
+      <layout class="QGridLayout" name="gridLayout">
+       <item row="1" column="2">
+        <widget class="QPushButton" name="zoomToMaxButton">
+         <property name="enabled">
+          <bool>true</bool>
+         </property>
+         <property name="text">
+          <string>Zoom to max value</string>
+         </property>
+        </widget>
+       </item>
+       <item row="1" column="0">
+        <widget class="QLabel" name="extremeValueMaxLabel">
+         <property name="enabled">
+          <bool>true</bool>
+         </property>
+         <property name="text">
+          <string>Max Value</string>
+         </property>
+        </widget>
+       </item>
+       <item row="1" column="1">
+        <widget class="DoubleEdit" name="maxBox">
+         <property name="enabled">
+          <bool>true</bool>
+         </property>
+         <property name="text">
+          <string>0</string>
+         </property>
+         <property name="readOnly">
+          <bool>true</bool>
+         </property>
+        </widget>
+       </item>
+      </layout>
+     </widget>
+    </item>
+    <item row="11" column="0" colspan="2">
+     <widget class="QPushButton" name="estimateDistancesButton">
+      <property name="enabled">
+       <bool>true</bool>
+      </property>
+      <property name="font">
+       <font>
+        <family>Cantarell</family>
+        <bold>true</bold>
+       </font>
+      </property>
+      <property name="text">
+       <string>Estimate Geodesic Distances</string>
+      </property>
+     </widget>
+    </item>
+    <item row="2" column="0">
+     <widget class="QGroupBox" name="sourcesGroup">
+      <property name="enabled">
+       <bool>true</bool>
+      </property>
+      <property name="title">
+       <string>Source Vertices</string>
+      </property>
+      <layout class="QGridLayout" name="gridLayout_4">
+       <item row="0" column="0">
+        <widget class="QPushButton" name="createSourceVerticesButton">
+         <property name="enabled">
+          <bool>true</bool>
+         </property>
+         <property name="toolTip">
+          <string extracomment="Use 'Shift + Left Click'"/>
+         </property>
+         <property name="toolTipDuration">
+          <number>1</number>
+         </property>
+         <property name="text">
+          <string>Create Source Vertices Selection Item</string>
+         </property>
+        </widget>
+       </item>
+      </layout>
+     </widget>
+    </item>
+   </layout>
+  </widget>
+ </widget>
+ <customwidgets>
+  <customwidget>
+   <class>DoubleEdit</class>
+   <extends>QLineEdit</extends>
+   <header>CGAL_double_edit.h</header>
+  </customwidget>
+ </customwidgets>
+ <resources/>
+ <connections/>
+</ui>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp
new file mode 100644
index 000000000000..4de8e8fe41f4
--- /dev/null
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp
@@ -0,0 +1,822 @@
+#include "ui_Heat_method.h"
+
+#include "Color_ramp.h"
+#include "id_printing.h"
+#include "Messages_interface.h"
+#include "triangulate_primitive.h"
+
+#include "Scene.h"
+#include "Scene_polyhedron_selection_item.h"
+#include "Scene_surface_mesh_item.h"
+
+#include <CGAL/Three/Polyhedron_demo_plugin_interface.h>
+#include <CGAL/Three/Polyhedron_demo_plugin_helper.h>
+#include <CGAL/Three/Three.h>
+#include <CGAL/Three/Triangle_container.h>
+#include <CGAL/Buffer_for_vao.h>
+
+#include <CGAL/boost/bimap.hpp>
+#include <CGAL/boost/graph/helpers.h>
+#include <CGAL/Dynamic_property_map.h>
+#include <CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h>
+
+#include <QAbstractItemView>
+#include <QAction>
+#include <QApplication>
+#include <QColor>
+#include <QColorDialog>
+#include <QInputDialog>
+#include <QMainWindow>
+#include <QMessageBox>
+#include <QObject>
+#include <QPalette>
+#include <QStyleFactory>
+
+// @fixme multiple selection items are broken, so don't create a selection item if there is already one
+
+using namespace CGAL::Three;
+
+Viewer_interface* (&getActiveViewer)() = Three::activeViewer;
+
+class Scene_heat_item
+  : public Scene_item_rendering_helper
+{
+  Q_OBJECT
+
+private:
+  Scene_surface_mesh_item* parent;
+  SMesh* sm;
+
+  mutable std::vector<float> verts;
+  mutable std::vector<float> normals;
+  mutable std::vector<unsigned int> idx;
+  mutable std::vector<float> colors;
+  mutable std::vector<float> heat_values;
+  mutable std::size_t nb_idx;
+
+public:
+  Scene_heat_item(Scene_surface_mesh_item* item)
+    : parent(item), sm(item->face_graph())
+  {
+    CGAL_precondition(is_triangle_mesh(*sm));
+
+    setTriangleContainer(0, new Triangle_container(Viewer_interface::PROGRAM_HEAT_INTENSITY, true));
+    setRenderingMode(Gouraud);
+  }
+
+  ~Scene_heat_item(){}
+
+  Scene_item* clone() const Q_DECL_OVERRIDE { return nullptr; }
+  QString toolTip() const Q_DECL_OVERRIDE{ return QString(); }
+  Scene_surface_mesh_item* getParent() { return parent; }
+  bool isEmpty() const Q_DECL_OVERRIDE { return false; }
+
+  SMesh* face_graph() { return sm; }
+
+  void initializeBuffers(Viewer_interface *viewer) const Q_DECL_OVERRIDE
+  {
+    getTriangleContainer(0)->initializeBuffers(viewer);
+    getTriangleContainer(0)->setIdxSize(nb_idx);
+
+    verts.resize(0);
+    verts.shrink_to_fit();
+    normals.resize(0);
+    normals.shrink_to_fit();
+    colors.resize(0);
+    colors.shrink_to_fit();
+    idx.clear();
+    idx.shrink_to_fit();
+  }
+
+  void draw(Viewer_interface *viewer) const Q_DECL_OVERRIDE
+  {
+    if(!visible())
+      return;
+
+    if(!isInit(viewer))
+      initGL(viewer);
+
+    if(getBuffersFilled() && !getBuffersInit(viewer))
+    {
+      initializeBuffers(viewer);
+      setBuffersInit(viewer, true);
+    }
+
+    if(!getBuffersFilled())
+    {
+      computeElements();
+      initializeBuffers(viewer);
+    }
+
+    getTriangleContainer(0)->setAlpha(1.0f);
+    getTriangleContainer(0)->draw(viewer, false);
+  }
+
+  void compute_bbox() const Q_DECL_OVERRIDE
+  {
+    setBbox(parent->bbox());
+  }
+
+  virtual bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE
+  {
+    return (m == Gouraud);
+  }
+
+  virtual void invalidateOpenGLBuffers() Q_DECL_OVERRIDE
+  {
+    setBuffersFilled(false);
+    compute_bbox();
+    getTriangleContainer(0)->reset_vbos(NOT_INSTANCED);
+  }
+
+  void computeElements() const Q_DECL_OVERRIDE
+  {
+    typedef CGAL::Buffer_for_vao<float, unsigned int> CPF;
+
+    QApplication::setOverrideCursor(Qt::WaitCursor);
+
+    auto vpm = CGAL::get(CGAL::vertex_point, *sm);
+    auto vnormals = sm->property_map<vertex_descriptor, EPICK::Vector_3>("v:normal").first;
+    auto fnormals = sm->property_map<face_descriptor, EPICK::Vector_3>("f:normal").first;
+
+    auto [vcolors, vcolors_found] = sm->property_map<vertex_descriptor, CGAL::IO::Color>("v:color");
+    CGAL_assertion(vcolors_found);
+    auto [vdist, vdist_found] = sm->property_map<vertex_descriptor, double>("v:HM_Plugin_heat_intensity");
+    CGAL_assertion(vdist_found);
+
+    verts.clear();
+    normals.clear();
+    idx.clear();
+    colors.clear();
+
+    idx.reserve(3 * num_faces(*sm));
+    for(face_descriptor fd : faces(*sm))
+    {
+      for(halfedge_descriptor hd : halfedges_around_face(halfedge(fd, *sm),*sm))
+        idx.push_back(source(hd, *sm));
+    }
+
+    const CGAL::qglviewer::Vec& o = static_cast<Viewer_interface*>(CGAL::QGLViewer::QGLViewerPool().first())->offset();
+    EPICK::Vector_3 offset(o.x, o.y, o.z);
+
+    for(vertex_descriptor vd : vertices(*sm))
+    {
+      const CGAL::IO::Color& c = vcolors[vd];
+      colors.push_back(float(c.red()) / 255);
+      colors.push_back(float(c.green()) / 255);
+      colors.push_back(float(c.blue()) / 255);
+
+      const EPICK::Point_3& p = get(vpm, vd) + offset;
+      CPF::add_point_in_buffer(p, verts);
+
+      const EPICK::Vector_3& n = vnormals[vd];
+      CPF::add_normal_in_buffer(n, normals);
+
+      heat_values.push_back(vdist[vd]);
+    }
+
+    nb_idx = idx.size();
+    getTriangleContainer(0)->allocate(Triangle_container::Vertex_indices, idx.data(),
+                                      static_cast<int>(idx.size()*sizeof(unsigned int)));
+    getTriangleContainer(0)->allocate(Triangle_container::Smooth_vertices, verts.data(),
+                                      static_cast<int>(num_vertices(*sm)*3*sizeof(float)));
+    getTriangleContainer(0)->allocate(Triangle_container::Smooth_normals, normals.data(),
+                                      static_cast<int>(num_vertices(*sm)*3*sizeof(float)));
+    getTriangleContainer(0)->allocate(Triangle_container::VColors, colors.data(),
+                                      static_cast<int>(colors.size()*sizeof(float)));
+    getTriangleContainer(0)->allocate(Triangle_container::Distances, heat_values.data(),
+                                      static_cast<int>(heat_values.size()*sizeof(float)));
+
+    compute_bbox();
+    setBuffersFilled(true);
+
+    QApplication::restoreOverrideCursor();
+  }
+}; // class Scene_heat_item
+
+class DockWidget
+  : public QDockWidget,
+    public Ui::HeatMethodWidget
+{
+public:
+  DockWidget(const QString& name, QWidget *parent)
+    : QDockWidget(name, parent)
+  {
+    setupUi(this);
+  }
+};
+
+class Heat_method_plugin
+  : public QObject,
+    public Polyhedron_demo_plugin_helper
+{
+  Q_OBJECT
+  Q_INTERFACES(CGAL::Three::Polyhedron_demo_plugin_interface)
+  Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0")
+
+  using Vertex_distance_map = SMesh::Property_map<vertex_descriptor, double>;
+  using Heat_method = CGAL::Heat_method_3::Surface_mesh_geodesic_distances_3<SMesh>;
+  using Heat_method_idt = CGAL::Heat_method_3::Surface_mesh_geodesic_distances_3<SMesh, CGAL::Heat_method_3::Intrinsic_Delaunay>;
+
+private:
+  QAction* actionHeatMethod;
+
+  DockWidget* dock_widget;
+
+  // coloring choice and legend
+  double rm = 1.;
+  double gm = 0.;
+  double bm = 0.;
+  double rM = 0.;
+  double gM = 1.;
+  double bM = 0.;
+
+  Color_ramp color_ramp;
+  QPixmap legend;
+
+  // tracking which scene items have which sources, and which heat method builders
+  boost::bimap<boost::bimaps::set_of<Scene_surface_mesh_item*>,
+               boost::bimaps::set_of<Scene_polyhedron_selection_item*> > item_source_vertices;
+
+  // the point of storing this is that in the Heat Method(s), a number of computations are only
+  // dependent on the mesh, and not the sources, and such can be performed just once.
+  std::unordered_map<Scene_surface_mesh_item*, Heat_method*> heat_methods;
+  std::unordered_map<Scene_surface_mesh_item*, Heat_method_idt*> idt_heat_methods;
+
+public:
+  bool applicable(QAction*) const Q_DECL_OVERRIDE
+  {
+    // Single item => it must be a mesh and the selection item will be created through the plugin's button
+    if(scene->selectionIndices().size() == 1)
+    {
+      Scene_item* item = scene->item(scene->mainSelectionIndex());
+      return qobject_cast<Scene_surface_mesh_item*>(item);
+    }
+    // Two items => it must be a surface mesh and a selection item (in any order)
+    else if(scene->selectionIndices().size() == 2)
+    {
+      Scene_item* item1 = scene->item(scene->selectionIndices().front());
+      Scene_item* item2 = scene->item(scene->selectionIndices().back());
+      return ((qobject_cast<Scene_surface_mesh_item*>(item1) &&
+               qobject_cast<Scene_polyhedron_selection_item*>(item2)) ||
+              (qobject_cast<Scene_polyhedron_selection_item*>(item1) &&
+               qobject_cast<Scene_surface_mesh_item*>(item2)));
+    }
+
+    return false;
+  }
+
+  QList<QAction*> actions() const Q_DECL_OVERRIDE
+  {
+    return QList<QAction*>() << actionHeatMethod;
+  }
+
+  void init(QMainWindow* mw,
+            Scene_interface* sc,
+            Messages_interface*) Q_DECL_OVERRIDE
+  {
+    this->scene = sc;
+    this->mw = mw;
+
+    actionHeatMethod = new QAction(QString("Heat Method"), mw);
+    actionHeatMethod->setProperty("submenuName", "Color");
+
+    connect(actionHeatMethod, SIGNAL(triggered()),
+            this, SLOT(openDialog()));
+
+    Scene* scene_item = static_cast<Scene*>(scene);
+    connect(scene_item, SIGNAL(itemIndicesSelected(QList<int>)),
+            this, SLOT(onItemIndicesSelected(QList<int>)));
+
+    // Dock Widget
+    dock_widget = new DockWidget("Heat Method", mw);
+    addDockWidget(dock_widget);
+    dock_widget->setVisible(false);
+
+    connect(dock_widget->methodBox, SIGNAL(currentIndexChanged(int)),
+            this, SLOT(onNewMethodSelected(int)));
+
+    dock_widget->methodBox->addItems({"Heat Method",
+                                      "Heat Method (Intrinsic Delaunay)"});
+
+    connect(dock_widget->createSourceVerticesButton, SIGNAL(clicked()),
+            this, SLOT(createSourceVerticesSelectionItem()));
+
+    QPalette palette(Qt::red);
+    dock_widget->minColorButton->setPalette(palette);
+    dock_widget->minColorButton->setStyle(QStyleFactory::create("Fusion"));
+    dock_widget->minColorButton->update();
+
+    palette = QPalette(Qt::green);
+    dock_widget->maxColorButton->setPalette(palette);
+    dock_widget->maxColorButton->setStyle(QStyleFactory::create("Fusion"));
+    dock_widget->maxColorButton->update();
+
+    // lambda to generate the three connect(), for each color button (min, max, map)
+    auto connect_color_buttons = [this](QPushButton* colorButton,
+                                        double& r, double& g, double& b)
+                                 {
+                                    connect(colorButton, &QPushButton::pressed,
+                                            this, [this, colorButton, &r, &g, &b]()
+                                                  {
+                                                    QColor color = QColorDialog::getColor();
+                                                    if(!color.isValid())
+                                                      return;
+
+                                                    r = color.redF();
+                                                    g = color.greenF();
+                                                    b = color.blueF();
+
+                                                    QPalette palette(color);
+                                                    colorButton->setPalette(palette);
+                                                    colorButton->update();
+
+                                                    displayRampLegend();
+                                                  });
+                                 };
+
+    connect_color_buttons(dock_widget->minColorButton, rm, gm, bm);
+    connect_color_buttons(dock_widget->maxColorButton, rM, gM, bM);
+
+    // Main action connection
+    connect(dock_widget->estimateDistancesButton, SIGNAL(clicked(bool)),
+            this, SLOT(estimateDistances()));
+
+    // Post coloring connection
+    connect(dock_widget->zoomToMaxButton, &QPushButton::pressed,
+            this, &Heat_method_plugin::on_zoomToMaxButton_pressed);
+  }
+
+private Q_SLOTS:
+  void openDialog()
+  {
+    if(!dock_widget->isVisible())
+      dock_widget->show();
+    dock_widget->raise();
+  }
+
+  void closure() Q_DECL_OVERRIDE
+  {
+    dock_widget->hide();
+  }
+
+private:
+    void disableExtremeValue()
+  {
+    dock_widget->extremeValueGroup->setEnabled(false);
+    dock_widget->zoomToMaxButton->setEnabled(false);
+  }
+
+  void enableExtremeValue()
+  {
+    dock_widget->extremeValueGroup->setEnabled(true);
+    dock_widget->zoomToMaxButton->setEnabled(true);
+  }
+
+  void resetExtremeValue()
+  {
+    dock_widget->maxBox->setRange(0, 99999999);
+    dock_widget->maxBox->setValue(0);
+  }
+
+  void displayRampLegend()
+  {
+    color_ramp = Color_ramp(rm, rM, gm, gM, bm, bM);
+
+    const int height = 256;
+    const int width = 140;
+    const int cell_width = width / 3;
+    const int top_margin = 5;
+    const int left_margin = 5;
+    const int drawing_height = height - 2*top_margin;
+    const int text_height = 20;
+
+    legend = QPixmap(width, height + text_height);
+    legend.fill(QColor(200, 200, 200));
+
+    QPainter painter(&legend);
+    painter.setPen(Qt::black);
+    painter.setBrush(QColor(200, 200, 200));
+
+    const double min_value = 0;
+    const double max_value = dock_widget->maxBox->value();
+
+    // Build legend data
+    std::vector<double> graduations(100);
+    for(int i=0; i<100; ++i)
+      graduations[i] = i / 100.0;
+
+    int i = 0;
+    for(std::vector<double>::iterator it = graduations.begin(), end = graduations.end(); it != end; ++it, i+=2)
+    {
+      QColor color(255 * color_ramp.r(*it),
+                   255 * color_ramp.g(*it),
+                   255 * color_ramp.b(*it));
+      painter.fillRect(left_margin, drawing_height - top_margin - i, cell_width, 2, color);
+    }
+
+    // draw right vertical line
+    painter.setPen(Qt::blue);
+    painter.drawLine(QPoint(left_margin + cell_width + 10,
+                            drawing_height - top_margin + 2),
+                     QPoint(left_margin + cell_width + 10,
+                            drawing_height - top_margin - static_cast<int>(graduations.size())*2 + 2));
+
+    // draw min value and max value
+    painter.setPen(Qt::blue);
+    QRect min_text_rect(left_margin + cell_width + 10,
+                        drawing_height - top_margin, 100, text_height);
+    painter.drawText(min_text_rect, Qt::AlignCenter, QObject::tr("%1").arg(min_value, 0, 'f', 3));
+
+    QRect max_text_rect(left_margin + cell_width + 10,
+                        drawing_height - top_margin - 200, 100, text_height);
+    painter.drawText(max_text_rect, Qt::AlignCenter, QObject::tr("%1").arg(max_value, 0, 'f', 3));
+
+    dock_widget->legendLabel->setPixmap(legend);
+  }
+
+private Q_SLOTS:
+  // Called when new geometric objects are selected in the scene
+  void onItemIndicesSelected(QList<int> selected_items)
+  {
+    resetExtremeValue();
+    dock_widget->setEnabled(false);
+
+    Scene_surface_mesh_item* sm_item = nullptr;
+    Scene_polyhedron_selection_item* source_vertices = nullptr;
+
+    if(selected_items.size() == 1)
+    {
+      Scene_item* item = scene->item(scene->mainSelectionIndex());
+      source_vertices = qobject_cast<Scene_polyhedron_selection_item*>(item);
+      if(source_vertices)
+      {
+        // While selecting a selection item, enable coloring if the selection item is linked to a sm_item
+        if(item_source_vertices.right.count(source_vertices) == 0)
+          return;
+
+        dock_widget->setEnabled(true);
+        dock_widget->createSourceVerticesButton->setEnabled(false);
+        dock_widget->estimateDistancesButton->setEnabled(true);
+        disableExtremeValue();
+        return;
+      }
+      else if(qobject_cast<Scene_heat_item*>(item))
+      {
+        dock_widget->setEnabled(true);
+        dock_widget->createSourceVerticesButton->setEnabled(false);
+        dock_widget->estimateDistancesButton->setEnabled(false);
+        disableExtremeValue();
+        return;
+      }
+
+      sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
+    }
+    else if(selected_items.size() == 2)
+    {
+      Scene_item* item1 = scene->item(selected_items.front());
+      Scene_item* item2 = scene->item(selected_items.back());
+      sm_item = qobject_cast<Scene_surface_mesh_item*>(item1);
+      source_vertices = qobject_cast<Scene_polyhedron_selection_item*>(item2);
+      if(!sm_item)
+      {
+        sm_item = qobject_cast<Scene_surface_mesh_item*>(item2);
+        source_vertices = qobject_cast<Scene_polyhedron_selection_item*>(item1);
+      }
+    }
+
+    if(!sm_item)
+      return;
+
+    dock_widget->setEnabled(true);
+    const bool has_sources = (source_vertices || item_source_vertices.left.count(sm_item) != 0);
+    dock_widget->estimateDistancesButton->setEnabled(has_sources);
+    dock_widget->createSourceVerticesButton->setEnabled(!has_sources);
+    disableExtremeValue();
+  }
+
+  // This function is only called if the index actually changed (doesn't trigger
+  // if you click again the item)
+  void onNewMethodSelected(int method_index)
+  {
+    resetExtremeValue(); // reset extreme value before the legend to get the proper values
+    displayRampLegend();
+
+    if(method_index >= 0 && method_index < dock_widget->methodBox->count()) // valid method
+    {
+      dock_widget->setEnabled(true);
+      disableExtremeValue(); // only available after displaying geodesic distances
+    }
+    else // no or broken method?
+    {
+      dock_widget->setEnabled(false);
+      dock_widget->methodBox->setEnabled(true);
+    }
+  }
+
+private:
+  bool displayHeatIntensity(Scene_surface_mesh_item* sm_item,
+                            Scene_polyhedron_selection_item* source_vertices,
+                            const bool use_iDT = false)
+  {
+    SMesh& mesh = *sm_item->face_graph();
+
+    SMesh::Property_map<vertex_descriptor, double> heat_intensity =
+      mesh.add_property_map<vertex_descriptor, double>("v:HM_Plugin_heat_intensity", 0).first;
+
+    auto initialize_hm_map = [this, sm_item, &mesh] (auto*& hm_ptr, auto& hm_map) -> void
+                             {
+                               using Method = std::decay_t<decltype(*hm_ptr)>;
+
+                               auto it = hm_map.find(sm_item);
+                               if(it != hm_map.end()) // method already exists
+                               {
+                                 hm_ptr = it->second;
+
+                                 for(vertex_descriptor v : vertices(mesh))
+                                    hm_ptr->remove_source(v);
+                               }
+                               else
+                               {
+                                 hm_ptr = new Method(mesh);
+                                 hm_map[sm_item] = hm_ptr;
+                               }
+
+                               connect(sm_item, &Scene_surface_mesh_item::aboutToBeDestroyed,
+                                       this, [this, sm_item, &hm_map]()
+                                             {
+                                               item_source_vertices.left.erase(sm_item);
+
+                                               auto it = hm_map.find(sm_item);
+                                               if(it == hm_map.end())
+                                                 return;
+                                               delete it->second;
+                                               hm_map.erase(it);
+                                             });
+                             };
+
+    Heat_method* hm = nullptr;
+    Heat_method_idt* hm_idt = nullptr;
+
+    if(use_iDT)
+      initialize_hm_map(hm_idt, idt_heat_methods);
+    else
+      initialize_hm_map(hm, heat_methods);
+
+    for(auto v : source_vertices->selected_vertices)
+    {
+      if(use_iDT)
+        hm_idt->add_source(v);
+      else
+        hm->add_source(v);
+    }
+
+    if(use_iDT)
+      hm_idt->estimate_geodesic_distances(heat_intensity);
+    else
+      hm->estimate_geodesic_distances(heat_intensity);
+
+    // Post treatment
+    double max = 0;
+    for(vertex_descriptor v : vertices(mesh))
+    {
+      double hi = heat_intensity[v];
+      if(hi > max)
+        max = hi;
+    }
+
+    displayRampLegend();
+
+    auto [vcolors, vcolors_added] = mesh.add_property_map<vertex_descriptor, CGAL::IO::Color >("v:color", CGAL::IO::Color());
+    for(vertex_descriptor v : vertices(mesh))
+    {
+      double h = heat_intensity[v] / max;
+      CGAL::IO::Color color(255 * color_ramp.r(h),
+                            255 * color_ramp.g(h),
+                            255 * color_ramp.b(h));
+      vcolors[v] = color;
+    }
+
+    // Create the colored item
+    Scene_heat_item* heat_item = new Scene_heat_item(sm_item);
+    heat_item->setName(tr("%1 (distance isolines)").arg(sm_item->name()));
+    heat_item->setVisible(false);
+
+    sm_item->invalidateOpenGLBuffers();
+    sm_item->setRenderingMode(GouraudPlusEdges);
+    sm_item->redraw();
+
+    scene->addItem(heat_item);
+    scene->setSelectedItem(scene->item_id(sm_item));
+
+    // any change of sm_item destroys everything
+    connect(sm_item, &Scene_surface_mesh_item::itemChanged,
+            this, [this, sm_item, heat_item]()
+                  {
+                    sm_item->resetColors();
+                    removePluginProperties(sm_item);
+                    scene->erase(scene->item_id(heat_item));
+                    onItemIndicesSelected(scene->selectionIndices());
+                  });
+
+    connect(sm_item, &Scene_surface_mesh_item::aboutToBeDestroyed,
+            this, [this, heat_item]()
+                  {
+                    scene->erase(scene->item_id(heat_item));
+                    onItemIndicesSelected(scene->selectionIndices());
+                  });
+
+    // here because if it's put above, the setSelectedItem() might reset the value
+    dock_widget->maxBox->setValue(max);
+
+    return true;
+  }
+
+private Q_SLOTS:
+  void estimateDistances()
+  {
+    // Get the mesh and source vertices items
+    Scene_surface_mesh_item* sm_item = nullptr;
+    Scene_polyhedron_selection_item* source_vertices = nullptr;
+
+    if(scene->selectionIndices().size() == 1)
+    {
+      Scene_item* item = scene->item(scene->mainSelectionIndex());
+      sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
+      if(sm_item)
+      {
+        // a surface mesh item is selected, an existing associated selection item must exist
+        source_vertices = item_source_vertices.left.at(sm_item);
+      }
+      else
+      {
+        // a selection item is selected, an existing associated mesh item must exist
+        source_vertices = qobject_cast<Scene_polyhedron_selection_item*>(item);
+        if(source_vertices)
+          sm_item = item_source_vertices.right.at(source_vertices);
+      }
+    }
+    else if(scene->selectionIndices().size() == 2)
+    {
+      // two items, for (possibly unlinked) sm_item and its associated selection
+      Scene_item* item1 = scene->item(scene->selectionIndices().front());
+      Scene_item* item2 = scene->item(scene->selectionIndices().back());
+      sm_item = qobject_cast<Scene_surface_mesh_item*>(item1);
+      source_vertices = qobject_cast<Scene_polyhedron_selection_item*>(item2);
+      if(!sm_item)
+      {
+        sm_item = qobject_cast<Scene_surface_mesh_item*>(item2);
+        source_vertices = qobject_cast<Scene_polyhedron_selection_item*>(item1);
+      }
+
+      link_mesh_and_selection(sm_item, source_vertices);
+    }
+    else
+    {
+      QMessageBox::critical(mw, "Error","Unsupported selection of items.");
+      return;
+    }
+
+    CGAL_assertion(sm_item && source_vertices);
+
+    if(!is_triangle_mesh(*sm_item->face_graph()))
+    {
+      QApplication::restoreOverrideCursor();
+      QMessageBox::critical(mw, "Error","The mesh must be triangulated.");
+      return;
+    }
+
+    if(source_vertices->selected_vertices.empty())
+    {
+      QApplication::restoreOverrideCursor();
+      QMessageBox::critical(mw, "Error","At least one source vertex is required.");
+      return;
+    }
+
+    QApplication::setOverrideCursor(Qt::WaitCursor);
+
+    enableExtremeValue();
+
+    const std::string& method_name = dock_widget->methodBox->currentText().toStdString();
+    if(method_name == "Heat Method")
+      displayHeatIntensity(sm_item, source_vertices);
+    else if(method_name == "Heat Method (Intrinsic Delaunay)")
+      displayHeatIntensity(sm_item, source_vertices, true /*use IDT*/);
+
+    // @todo emit a new SIGNAL on successful coloring, something like "colorChanged()"
+    // itemChanged is too strong and would conflict with the connection below
+    sm_item->invalidateOpenGLBuffers();
+    sm_item->redraw();
+
+    QApplication::restoreOverrideCursor();
+  }
+
+private:
+  void removePluginProperty(Scene_item* item,
+                            const std::string& property_name)
+  {
+    Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
+    if(!sm_item)
+      return;
+
+    SMesh* sm = sm_item->face_graph();
+    if(sm == nullptr)
+      return;
+
+    // Here we only target the property maps added by this plugin, so 'double' is fine
+    SMesh::Property_map<face_descriptor, double> property;
+    bool found;
+    std::tie(property, found) = sm->property_map<face_descriptor, double>(property_name);
+    if(found)
+      sm->remove_property_map(property);
+  }
+
+  void removePluginProperties(Scene_item* item)
+  {
+    removePluginProperty(item, "v:HM_Plugin_heat_intensity");
+  }
+
+private Q_SLOTS:
+  // deletion of the selection item removes the pair from the map
+  void link_mesh_and_selection(Scene_surface_mesh_item* sm_item,
+                               Scene_polyhedron_selection_item* source_vertices)
+  {
+    item_source_vertices.left.insert(std::make_pair(sm_item, source_vertices));
+
+    connect(source_vertices, &Scene_polyhedron_selection_item::aboutToBeDestroyed,
+            this, [this, sm_item]()
+                  {
+                    item_source_vertices.left.erase(sm_item);
+                    onItemIndicesSelected(scene->selectionIndices());
+                  });
+  }
+
+  void createSourceVerticesSelectionItem()
+  {
+    Scene_item* item = scene->item(scene->mainSelectionIndex());
+    Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
+    if(!sm_item)
+    {
+      QMessageBox::warning(mw, "Warning", "Select a surface mesh to add source vertices");
+      dock_widget->createSourceVerticesButton->setChecked(false);
+      return;
+    }
+
+    CGAL_assertion(item_source_vertices.left.count(sm_item) == 0);
+
+    Scene_polyhedron_selection_item* source_vertices = new Scene_polyhedron_selection_item(sm_item, mw);
+    source_vertices->setName(tr("%1 (source vertices)").arg(sm_item->name()));
+    scene->addItem(source_vertices);
+
+    link_mesh_and_selection(sm_item, source_vertices);
+
+    dock_widget->createSourceVerticesButton->setEnabled(false);
+    dock_widget->estimateDistancesButton->setEnabled(true);
+  }
+
+private Q_SLOTS:
+  void on_zoomToMaxButton_pressed()
+  {
+    Scene_surface_mesh_item* sm_item = nullptr;
+    if(scene->selectionIndices().size() == 1)
+    {
+      Scene_item* item = scene->item(scene->mainSelectionIndex());
+      sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
+    }
+    else if(scene->selectionIndices().size() == 2)
+    {
+      Scene_item* item1 = scene->item(scene->selectionIndices().front());
+      Scene_item* item2 = scene->item(scene->selectionIndices().back());
+      sm_item = qobject_cast<Scene_surface_mesh_item*>(item1);
+      if(!sm_item)
+        sm_item = qobject_cast<Scene_surface_mesh_item*>(item2);
+    }
+
+    const SMesh& mesh = *(sm_item->face_graph());
+
+    auto [heat_intensity, found] = mesh.property_map<vertex_descriptor, double>("v:HM_Plugin_heat_intensity");
+    CGAL_assertion(found);
+
+    double max = 0;
+    vertex_descriptor max_v = boost::graph_traits<SMesh>::null_vertex();
+    for(vertex_descriptor v : vertices(mesh))
+    {
+      if(heat_intensity[v] > max)
+      {
+        max = heat_intensity[v];
+        max_v = v;
+      }
+    }
+
+    CGAL_assertion(max_v != boost::graph_traits<SMesh>::null_vertex());
+
+    face_descriptor unused_fd;
+    Point_3 unused_p;
+    ::zoomToId(mesh,
+               QString("v%1").arg(max_v),
+               getActiveViewer(),
+               unused_fd, unused_p);
+  }
+};
+
+#include "Heat_method_plugin.moc"
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Join_and_split_polyhedra_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Join_and_split_polyhedra_plugin.cpp
index 15f65cb1df81..49e21cc66351 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Join_and_split_polyhedra_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Join_and_split_polyhedra_plugin.cpp
@@ -217,7 +217,7 @@ void Polyhedron_demo_join_and_split_polyhedra_plugin::on_actionColorConnectedCom
       item->computeItemColorVectorAutomatically(true);
       item->invalidateOpenGLBuffers();
       item->setProperty("NbPatchIds", nb_patch_ids);
-      scene->itemChanged(item);
+      scene->itemChanged(item); // @todo emits
     }
     else
     {
diff --git a/Polyhedron/demo/Polyhedron/SMesh_type.h b/Polyhedron/demo/Polyhedron/SMesh_type.h
index f79a819cb9a6..c6fd5020b8ed 100644
--- a/Polyhedron/demo/Polyhedron/SMesh_type.h
+++ b/Polyhedron/demo/Polyhedron/SMesh_type.h
@@ -7,21 +7,20 @@
 #include <CGAL/boost/graph/properties.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
-
 typedef CGAL::Exact_predicates_inexact_constructions_kernel EPICK;
 typedef EPICK::Point_3 Point_3;
+
 typedef CGAL::Surface_mesh<Point_3> SMesh;
+
 typedef boost::graph_traits<SMesh>::face_descriptor face_descriptor;
 typedef boost::graph_traits<SMesh>::vertex_descriptor vertex_descriptor;
 typedef boost::graph_traits<SMesh>::halfedge_descriptor halfedge_descriptor;
 
-
 namespace boost {
 
 template <typename P>
 struct property_map<CGAL::Surface_mesh<P>, CGAL::vertex_selection_t>
 {
-
   typedef typename boost::graph_traits<CGAL::Surface_mesh<P> >::vertex_descriptor vertex_descriptor;
 
   typedef typename CGAL::Surface_mesh<P>::template Property_map<vertex_descriptor, int> type;
@@ -32,7 +31,6 @@ struct property_map<CGAL::Surface_mesh<P>, CGAL::vertex_selection_t>
 template <typename P>
 struct property_map<CGAL::Surface_mesh<P>, CGAL::face_selection_t>
 {
-
   typedef typename boost::graph_traits<CGAL::Surface_mesh<P> >::face_descriptor face_descriptor;
 
   typedef typename CGAL::Surface_mesh<P>::template Property_map<face_descriptor, int> type;
@@ -41,11 +39,11 @@ struct property_map<CGAL::Surface_mesh<P>, CGAL::face_selection_t>
 
 } // namespace boost
 
-
 namespace CGAL {
 
 template <typename P, typename Property_tag>
-struct Get_pmap_of_surface_mesh_ {
+struct Get_pmap_of_surface_mesh_
+{
   typedef typename boost::property_map<Surface_mesh<P>, Property_tag >::type type;
 };
 
diff --git a/Polyhedron/demo/Polyhedron/Scene.cpp b/Polyhedron/demo/Polyhedron/Scene.cpp
index c70929ab4a5e..dc601ccbf758 100644
--- a/Polyhedron/demo/Polyhedron/Scene.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene.cpp
@@ -172,20 +172,22 @@ Scene::replaceItem(Scene::Item_id index, CGAL::Three::Scene_item* item, bool emi
 Scene::Item_id
 Scene::erase(Scene::Item_id index)
 {
-  if(index <0 || index >= numberOfEntries())
+  if(index < 0 || index >= numberOfEntries())
     return -1;
 
   CGAL::Three::Scene_item* item = m_entries[index];
+
   if(qobject_cast<Scene_group_item*>(item))
   {
-    setSelectedItemsList(QList<Scene_interface::Item_id>()<<item_id(item));
+    setSelectedItemIndices(QList<Scene_interface::Item_id>() << item_id(item));
     return erase(selectionIndices());
   }
+
   m_groups.removeAll(index);
-  if(item->parentGroup()
-     && item->parentGroup()->isChildLocked(item))
+  if(item->parentGroup() && item->parentGroup()->isChildLocked(item))
     return -1;
-  //clears the Scene_view
+
+  // clears the Scene_view
   clear();
   index_map.clear();
   if(item->parentGroup())
@@ -286,12 +288,12 @@ Scene::erase(QList<int> indices)
 
 void Scene::remove_item_from_groups(Scene_item* item)
 {
-    CGAL::Three::Scene_group_item* group = item->parentGroup();
-    if(group)
-    {
-        group->removeChild(item);
-        children.push_back(item_id(item));
-    }
+  CGAL::Three::Scene_group_item* group = item->parentGroup();
+  if(group)
+  {
+    group->removeChild(item);
+    children.push_back(item_id(item));
+  }
 }
 Scene::~Scene()
 {
@@ -315,19 +317,19 @@ Scene::~Scene()
 CGAL::Three::Scene_item*
 Scene::item(Item_id index) const
 {
-    return m_entries.value(index); // QList::value checks bounds
+  return m_entries.value(index); // QList::value checks bounds
 }
 
 Scene::Item_id
 Scene::item_id(CGAL::Three::Scene_item* scene_item) const
 {
-    return m_entries.indexOf(scene_item);
+  return m_entries.indexOf(scene_item);
 }
 
 int
 Scene::numberOfEntries() const
 {
-    return m_entries.size();
+  return m_entries.size();
 }
 
 // Duplicate a scene item.
@@ -335,20 +337,23 @@ Scene::numberOfEntries() const
 Scene::Item_id
 Scene::duplicate(Item_id index)
 {
-    if(index < 0 || index >= m_entries.size())
-        return -1;
-
-    const CGAL::Three::Scene_item* item = m_entries[index];
-    CGAL::Three::Scene_item* new_item = item->clone();
-    if(new_item) {
-        new_item->setName(tr("%1 (copy)").arg(item->name()));
-        new_item->setColor(item->color());
-        new_item->setVisible(item->visible());
-        addItem(new_item);
-        return m_entries.size() - 1;
-    }
-    else
-        return -1;
+  if(index < 0 || index >= m_entries.size())
+    return -1;
+
+  const CGAL::Three::Scene_item* item = m_entries[index];
+  CGAL::Three::Scene_item* new_item = item->clone();
+  if(new_item)
+  {
+    new_item->setName(tr("%1 (copy)").arg(item->name()));
+    new_item->setColor(item->color());
+    new_item->setVisible(item->visible());
+    addItem(new_item);
+    return m_entries.size() - 1;
+  }
+  else
+  {
+    return -1;
+  }
 }
 
 void Scene::initializeGL(CGAL::Three::Viewer_interface* viewer)
@@ -486,33 +491,33 @@ void Scene::initializeGL(CGAL::Three::Viewer_interface* viewer)
 
 void Scene::s_itemAboutToBeDestroyed(CGAL::Three::Scene_item *rmv_itm)
 {
- Q_FOREACH(CGAL::Three::Scene_item* item, m_entries)
- {
-   if(item == rmv_itm)
-     item->itemAboutToBeDestroyed(item);
- }
+  Q_FOREACH(CGAL::Three::Scene_item* item, m_entries)
+  {
+    if(item == rmv_itm)
+      item->itemAboutToBeDestroyed(item);
+  }
 }
 bool
-Scene::keyPressEvent(QKeyEvent* e){
-    bool res=false;
-    for (QList<int>::iterator it=selected_items_list.begin(),endit=selected_items_list.end();
-         it!=endit;++it)
-    {
-        CGAL::Three::Scene_item* item=m_entries[*it];
-        res |= item->keyPressEvent(e);
-    }
-    return res;
+Scene::keyPressEvent(QKeyEvent* e)
+{
+  bool res = false;
+  Q_FOREACH(int i, selected_items_list)
+  {
+    CGAL::Three::Scene_item* item = m_entries[i];
+    res |= item->keyPressEvent(e);
+  }
+  return res;
 }
 
 void
 Scene::draw(CGAL::Three::Viewer_interface* viewer)
 {
-    draw_aux(false, viewer);
+  draw_aux(false, viewer);
 }
 void
 Scene::drawWithNames(CGAL::Three::Viewer_interface* viewer)
 {
-    draw_aux(true, viewer);
+  draw_aux(true, viewer);
 }
 
 bool item_should_be_skipped_in_draw(Scene_item* item) {
@@ -615,12 +620,10 @@ void Scene::renderWireScene(const QList<Scene_interface::Item_id> &items,
                viewer->setGlPointSize(2.f);
                if(index == selected_item || selected_items_list.contains(index))
                {
-
                  item.selection_changed(true);
                }
                else
                {
-
                  item.selection_changed(false);
                }
                item.drawEdges(viewer);
@@ -1122,12 +1125,14 @@ bool Scene::dropMimeData(const QMimeData * /*data*/,
     if(group)
     {
       Q_FOREACH(int id, selected_items_list)
+      {
         if(group->getChildren().contains(id))
         {
           one_contained = true;
           break;
 
         }
+      }
     }
     //if the drop item is not a group_item or if it already contains the item, then the drop action must be ignored
     if(!group ||one_contained)
diff --git a/Polyhedron/demo/Polyhedron/Scene.h b/Polyhedron/demo/Polyhedron/Scene.h
index b661ed7baa83..38114309886e 100644
--- a/Polyhedron/demo/Polyhedron/Scene.h
+++ b/Polyhedron/demo/Polyhedron/Scene.h
@@ -195,8 +195,10 @@ public Q_SLOTS:
       ++i;
     }
   }
+
   //! Sets the target list of indices as the selected indices.
-  QList<int> setSelectedItemsList(QList<int> l )
+  const QList<int>& setSelectedItemIndices(QList<int> l,
+                                           const bool do_emit = true)
   {
     Q_FOREACH(int i,l)
     {
@@ -206,13 +208,38 @@ public Q_SLOTS:
        {
          QList<int> list;
          Q_FOREACH(Item_id id, group->getChildrenForSelection())
-           list<<id;
-         l << setSelectedItemsList(list);
+           list << id;
+         l << setSelectedItemIndices(list, false /*do not emit*/);
        }
 
     }
     selected_items_list = l;
-    return l;
+    if(do_emit)
+      Q_EMIT itemIndicesSelected(selected_items_list);
+    return selected_items_list;
+  }
+
+    //! Sets the target list of indices as the selected indices.
+  const QList<int>& setSelectedItemList(QList<int> l,
+                                        const bool do_emit = true)
+  {
+    Q_FOREACH(int i,l)
+    {
+       CGAL::Three::Scene_group_item* group =
+               qobject_cast<CGAL::Three::Scene_group_item*>(item(i));
+       if(group)
+       {
+         QList<int> list;
+         Q_FOREACH(Item_id id, group->getChildrenForSelection())
+           list << id;
+         l << setSelectedItemList(list, false /*do not emit*/);
+       }
+    }
+
+    selected_items_list = l;
+    if(do_emit)
+      Q_EMIT selectionChanged(selected_items_list);
+    return selected_items_list;
   }
 
   // Accessors (setters)
@@ -249,6 +276,8 @@ public Q_SLOTS:
   void selectionChanged(QList<int> is);
   //! Used when you don't want to update the selectedItem in the Geometric Objects view.
   void itemIndexSelected(int i);
+  //! Used when you don't want to update the selectedItem in the Geometric Objects view.
+  void itemIndicesSelected(QList<int> is);
   //! Emit this to reset the collapsed state of all groups after the Geometric Objects view has been redrawn.
   void restoreCollapsedState();
   //! Is emitted when draw() is finished.
diff --git a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
index 21a550c6b70c..3d228f88a860 100644
--- a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
@@ -1175,11 +1175,11 @@ void* Scene_surface_mesh_item_priv::get_aabb_tree()
 
 void
 Scene_surface_mesh_item::select(double orig_x,
-                              double orig_y,
-                              double orig_z,
-                              double dir_x,
-                              double dir_y,
-                              double dir_z)
+                                double orig_y,
+                                double orig_z,
+                                double dir_x,
+                                double dir_y,
+                                double dir_z)
 {
   SMesh *sm = d->smesh_;
   std::size_t vertex_to_emit = 0;
@@ -2005,7 +2005,7 @@ void Scene_surface_mesh_item::resetColors()
     d->has_feature_edges = false;
   }
   invalidate(COLORS);
-  itemChanged();
+  itemChanged(); // @fixme really shouldn't call something that strong
 }
 
 QMenu* Scene_surface_mesh_item::contextMenu()
@@ -2387,7 +2387,6 @@ void Scene_surface_mesh_item::computeElements() const
 {
   d->compute_elements(ALL);
   setBuffersFilled(true);
-  const_cast<Scene_surface_mesh_item*>(this)->itemChanged();
 }
 
 void
diff --git a/Polyhedron/demo/Polyhedron/include/id_printing.h b/Polyhedron/demo/Polyhedron/include/id_printing.h
index 46d142a24bb0..2418496aa5ea 100644
--- a/Polyhedron/demo/Polyhedron/include/id_printing.h
+++ b/Polyhedron/demo/Polyhedron/include/id_printing.h
@@ -1,79 +1,96 @@
-#ifndef ID_PRINTING_H
-#define ID_PRINTING_H
+#ifndef CGAL_POLYHEDRON_DEMO_ID_PRINTING_H
+#define CGAL_POLYHEDRON_DEMO_ID_PRINTING_H
+
 #include <CGAL/boost/graph/selection.h>
+#include <CGAL/Kernel_traits.h>
+#include <CGAL/Kernel/global_functions.h>
+#include <CGAL/Polygon_mesh_processing/compute_normal.h>
+
 #include <CGAL/Three/Viewer_interface.h>
 #include <CGAL/Three/TextRenderer.h>
 #include <CGAL/Three/Three.h>
-#include <CGAL/Kernel_traits.h>
-#include <CGAL/Polygon_mesh_processing/compute_normal.h>
+
 #include <vector>
 
 #define POINT_SIZE 11
 
 template<class Mesh>
-struct VKRingPMAP{
-  typedef typename boost::graph_traits<Mesh>::vertex_descriptor key_type;
-  typedef bool                                                  value_type;
-  typedef value_type                                            reference;
-  typedef boost::read_write_property_map_tag                    category;
-  typedef typename boost::property_map<Mesh, boost::vertex_index_t>::type IDmap;
+struct VKRingPMAP
+{
+  using key_type = typename boost::graph_traits<Mesh>::vertex_descriptor;
+  using value_type = bool;
+  using reference = value_type;
+  using category = boost::read_write_property_map_tag;
+
+  using IDmap = typename boost::property_map<Mesh, boost::vertex_index_t>::type;
 
   std::vector<bool>* vec;
   Mesh* poly;
   IDmap idmap;
 
   VKRingPMAP(std::vector<bool>* vec, Mesh* poly)
-    :vec(vec), poly(poly)
+    : vec(vec), poly(poly)
   {
     idmap = get(boost::vertex_index, *poly);
   }
 
-  friend value_type get(const VKRingPMAP<Mesh>& map, const key_type& v){
+  friend value_type get(const VKRingPMAP<Mesh>& map, const key_type& v)
+  {
     return (*map.vec)[get(map.idmap, v)];
   }
-  friend void put(VKRingPMAP<Mesh>& map, const key_type& v, const value_type i){
+
+  friend void put(VKRingPMAP<Mesh>& map, const key_type& v, const value_type i)
+  {
     (*map.vec)[get(map.idmap, v)] = i;
   }
 };
+
 template<class Mesh>
-struct EdgeKRingPMAP{
-  typedef typename boost::graph_traits<Mesh>::edge_descriptor  key_type;
-  typedef bool                                                 value_type;
-  typedef value_type                                           reference;
-  typedef boost::read_write_property_map_tag                   category;
-  typedef typename boost::property_map<Mesh, boost::halfedge_index_t>::type IDmap;
+struct EdgeKRingPMAP
+{
+  using key_type = typename boost::graph_traits<Mesh>::edge_descriptor;
+  using value_type = bool;
+  using reference = value_type;
+  using category = boost::read_write_property_map_tag;
+
+  using IDmap = typename boost::property_map<Mesh, boost::halfedge_index_t>::type;
 
   std::vector<bool>* vec;
   Mesh* poly;
   IDmap idmap;
 
   EdgeKRingPMAP(std::vector<bool>* vec, Mesh* poly)
-    :vec(vec), poly(poly)
+    : vec(vec), poly(poly)
   {
     idmap = get(boost::halfedge_index, *poly);
   }
 
-  friend value_type get(const EdgeKRingPMAP<Mesh>& map, const key_type& e){
+  friend value_type get(const EdgeKRingPMAP<Mesh>& map, const key_type& e)
+  {
     return (*map.vec)[get(map.idmap, halfedge(e, *map.poly))/2];
   }
-  friend void put(EdgeKRingPMAP<Mesh>& map, const key_type& e, const value_type i){
+
+  friend void put(EdgeKRingPMAP<Mesh>& map, const key_type& e, const value_type i)
+  {
     (*map.vec)[get(map.idmap, halfedge(e, *map.poly))/2] = i;
   }
 };
 template<class Mesh>
-struct FKRingPMAP{
-  typedef typename boost::graph_traits<Mesh>::face_descriptor key_type;
-  typedef bool                                                value_type;
-  typedef value_type                                          reference;
-  typedef boost::read_write_property_map_tag                  category;
-  typedef typename boost::property_map<Mesh, boost::face_index_t>::type IDmap;
+struct FKRingPMAP
+{
+  using key_type = typename boost::graph_traits<Mesh>::face_descriptor;
+  using value_type = bool;
+  using reference = value_type;
+  using category = boost::read_write_property_map_tag;
+
+  using IDmap = typename boost::property_map<Mesh, boost::face_index_t>::type;
 
   std::vector<bool>* vec;
   Mesh* poly;
   IDmap idmap;
 
   FKRingPMAP(std::vector<bool>* vec, Mesh* poly)
-    :vec(vec), poly(poly)
+    : vec(vec), poly(poly)
   {
     idmap = get(boost::face_index, *poly);
   }
@@ -81,7 +98,9 @@ struct FKRingPMAP{
   friend value_type get(const FKRingPMAP<Mesh>& map, const key_type& f){
     return (*map.vec)[get(map.idmap, f)];
   }
-  friend void put(FKRingPMAP<Mesh>& map, const key_type& f, const value_type i){
+
+  friend void put(FKRingPMAP<Mesh>& map, const key_type& f, const value_type i)
+  {
     (*map.vec)[get(map.idmap, f)] = i;
   }
 };
@@ -91,26 +110,28 @@ void deleteIds(CGAL::Three::Viewer_interface* viewer,
                TextListItem* fitems,
                std::vector<TextItem*>* targeted_ids)
 {
-  TextRenderer *renderer = viewer->textRenderer();
+  TextRenderer* renderer = viewer->textRenderer();
+
   for(TextItem* it : vitems->textList())
-      delete it;
+    delete it;
   for(TextItem* it : eitems->textList())
-      delete it;
+    delete it;
   for(TextItem* it : fitems->textList())
-      delete it;
+    delete it;
+
   vitems->clear();
   renderer->removeTextList(vitems);
+
   eitems->clear();
   renderer->removeTextList(eitems);
+
   fitems->clear();
   renderer->removeTextList(fitems);
+
   targeted_ids->clear();
   viewer->update();
 }
 
-
-
-
 template<typename Handle, typename Point, typename Tree>
 bool find_primitive_id(const QPoint& point,
                        Tree* aabb_tree,
@@ -118,12 +139,13 @@ bool find_primitive_id(const QPoint& point,
                        Handle& selected_fh,
                        Point& pt_under)
 {
-  typedef typename CGAL::Kernel_traits<Point>::Kernel Traits;
+  using Traits = typename CGAL::Kernel_traits<Point>::Kernel;
+
   bool found = false;
   CGAL::qglviewer::Vec point_under = viewer->camera()->pointUnderPixel(point,found);
   const CGAL::qglviewer::Vec offset = static_cast<CGAL::Three::Viewer_interface*>(CGAL::QGLViewer::QGLViewerPool().first())->offset();
 
-  //find clicked facet
+  // find clicked facet
   CGAL::qglviewer::Vec dir;
   Point ray_origin;
   if(viewer->camera()->type() == CGAL::qglviewer::Camera::PERSPECTIVE)
@@ -151,38 +173,39 @@ bool find_primitive_id(const QPoint& point,
 
   if(intersections.empty())
     return false;
+
   typename Intersections::iterator closest = intersections.begin();
-  const Point* closest_point =
-      boost::get<Point>(&closest->first);
-  for(typename Intersections::iterator
-      it = boost::next(intersections.begin()),
-      end = intersections.end();
-      it != end; ++it)
-  {
-    if(! closest_point) {
+  const Point* closest_point = boost::get<Point>(&closest->first);
+  for(typename Intersections::iterator it = boost::next(intersections.begin()),
+                                       end = intersections.end(); it != end; ++it)
+  {
+    if(! closest_point)
+    {
       closest = it;
     }
-    else {
-      const Point* it_point =
-          boost::get<Point>(&it->first);
-      if(it_point &&
-         (ray_dir * (*it_point - *closest_point)) < 0)
+    else
+    {
+      const Point* it_point = boost::get<Point>(&it->first);
+      if(it_point && (ray_dir * (*it_point - *closest_point)) < 0)
       {
         closest = it;
         closest_point = it_point;
       }
     }
   }
+
   if(!closest_point)
     return false;
+
   pt_under = Point(point_under.x, point_under.y, point_under.z);
   selected_fh = closest->second;
+
   return true;
 }
 
-template<typename Mesh, typename Point >
+template<typename Mesh, typename Point>
 void compute_displayed_ids(Mesh& mesh,
-                           CGAL::Three::Viewer_interface *viewer,
+                           CGAL::Three::Viewer_interface* viewer,
                            const typename boost::graph_traits<Mesh>::face_descriptor& selected_fh,
                            const Point& pt_under,
                            const CGAL::qglviewer::Vec& offset,
@@ -191,21 +214,21 @@ void compute_displayed_ids(Mesh& mesh,
                            TextListItem* fitems,
                            std::vector<TextItem*>* targeted_ids)
 {
-  typedef typename boost::graph_traits<Mesh>::face_descriptor face_descriptor;
-  typedef typename boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
-  typedef typename boost::graph_traits<Mesh>::edge_descriptor edge_descriptor;
-  typedef typename boost::graph_traits<Mesh>::halfedge_descriptor halfedge_descriptor;
+  using vertex_descriptor = typename boost::graph_traits<Mesh>::vertex_descriptor;
+  using halfedge_descriptor = typename boost::graph_traits<Mesh>::halfedge_descriptor;
+  using edge_descriptor = typename boost::graph_traits<Mesh>::edge_descriptor;
+  using face_descriptor = typename boost::graph_traits<Mesh>::face_descriptor;
 
-  typedef typename boost::property_map<Mesh, boost::vertex_point_t>::type Ppmap;
+  using Ppmap = typename boost::property_map<Mesh, boost::vertex_point_t>::type;
   Ppmap ppmap = get(boost::vertex_point, mesh);
 
-  typedef typename boost::property_map<Mesh, boost::vertex_index_t>::type VIDmap;
+  using VIDmap = typename boost::property_map<Mesh, boost::vertex_index_t>::type;
   VIDmap vidmap = get(boost::vertex_index, mesh);
 
-  typedef typename boost::property_map<Mesh, boost::halfedge_index_t>::type HIDmap;
+  using HIDmap = typename boost::property_map<Mesh, boost::halfedge_index_t>::type;
   HIDmap hidmap = get(boost::halfedge_index, mesh);
 
-  typedef typename boost::property_map<Mesh, boost::face_index_t>::type FIDmap;
+  using FIDmap = typename boost::property_map<Mesh, boost::face_index_t>::type;
   FIDmap fidmap = get(boost::face_index, mesh);
 
   QFont font;
@@ -214,70 +237,77 @@ void compute_displayed_ids(Mesh& mesh,
   std::vector<vertex_descriptor> displayed_vertices;
   std::vector<edge_descriptor> displayed_edges;
   std::vector<face_descriptor> displayed_faces;
-  //Test spots around facet to find the closest to point
+  // Test spots around facet to find the closest to point
 
   double min_dist = (std::numeric_limits<double>::max)();
 
   // test the vertices of the closest face
   for(vertex_descriptor vh : vertices_around_face(halfedge(selected_fh, mesh), mesh))
   {
-    Point test=Point(get(ppmap, vh).x()+offset.x,
-                     get(ppmap, vh).y()+offset.y,
-                     get(ppmap, vh).z()+offset.z);
+    Point test=Point(get(ppmap, vh).x() + offset.x,
+                     get(ppmap, vh).y() + offset.y,
+                     get(ppmap, vh).z() + offset.z);
     double dist = CGAL::squared_distance(test, pt_under);
-    if( dist < min_dist){
+    if(dist < min_dist)
+    {
       min_dist = dist;
       displayed_vertices.clear();
       displayed_vertices.push_back(vh);
     }
   }
-  QVector3D point(
-      float(get(ppmap, displayed_vertices[0]).x() + offset.x),
-      float(get(ppmap, displayed_vertices[0]).y() + offset.y),
-      float(get(ppmap, displayed_vertices[0]).z() + offset.z));
 
-  //test if we want to erase or not
+  QVector3D point(float(get(ppmap, displayed_vertices[0]).x() + offset.x),
+                  float(get(ppmap, displayed_vertices[0]).y() + offset.y),
+                  float(get(ppmap, displayed_vertices[0]).z() + offset.z));
+
+  // test if we want to erase or not
   for(TextItem* text_item : *targeted_ids)
   {
     if(text_item->position() == point)
     {
-      //hide and stop
+      // hide and stop
       deleteIds(viewer, vitems, eitems, fitems, targeted_ids);
       return;
     }
   }
+
   deleteIds(viewer, vitems, eitems, fitems, targeted_ids);
+
   // test the midpoint of edges of the closest face
   for(halfedge_descriptor e : halfedges_around_face(halfedge(selected_fh, mesh), mesh))
   {
-    Point test=CGAL::midpoint(get(ppmap, source(e, mesh)),get(ppmap, target(e, mesh)));
+    Point test = CGAL::midpoint(get(ppmap, source(e, mesh)),get(ppmap, target(e, mesh)));
     test = Point(test.x()+offset.x,
                  test.y()+offset.y,
                  test.z()+offset.z);
     double dist = CGAL::squared_distance(test, pt_under);
-    if(dist < min_dist){
+    if(dist < min_dist)
+    {
       min_dist = dist;
       displayed_vertices.clear();
       displayed_edges.clear();
       displayed_edges.push_back(edge(e, mesh));
     }
   }
+
   // test the centroid of the closest face
   double x(0), y(0), z(0);
   int total(0);
   for(vertex_descriptor vh : vertices_around_face(halfedge(selected_fh, mesh), mesh))
   {
-    x+=get(ppmap, vh).x();
-    y+=get(ppmap, vh).y();
-    z+=get(ppmap, vh).z();
+    x += get(ppmap, vh).x();
+    y += get(ppmap, vh).y();
+    z += get(ppmap, vh).z();
     ++total;
   }
 
-  Point test(x/total+offset.x,
-             y/total+offset.y,
-             z/total+offset.z);
+  Point test(x / total+offset.x,
+             y / total+offset.y,
+             z / total+offset.z);
+
   double dist = CGAL::squared_distance(test, pt_under);
-  if(dist < min_dist){
+  if(dist < min_dist)
+  {
     min_dist = dist;
     displayed_vertices.clear();
     displayed_edges.clear();
@@ -293,23 +323,21 @@ void compute_displayed_ids(Mesh& mesh,
       if(f != boost::graph_traits<Mesh>::null_face())
         displayed_faces.push_back(f);
     }
+
     for(halfedge_descriptor h : CGAL::halfedges_around_target(halfedge(displayed_vertices[0], mesh), mesh))
-    {
       displayed_edges.push_back(edge(h, mesh));
-    }
   }
   else if(!displayed_edges.empty())
   {
     displayed_vertices.push_back(target(halfedge(displayed_edges[0], mesh), mesh));
     displayed_vertices.push_back(target(opposite(halfedge(displayed_edges[0], mesh), mesh),mesh));
     face_descriptor f1(face(halfedge(displayed_edges[0], mesh),mesh)),
-        f2(face(opposite(halfedge(displayed_edges[0], mesh), mesh),mesh));
+                    f2(face(opposite(halfedge(displayed_edges[0], mesh), mesh),mesh));
     if(f1 != boost::graph_traits<Mesh>::null_face())
       displayed_faces.push_back(f1);
     if(f2 != boost::graph_traits<Mesh>::null_face())
       displayed_faces.push_back(f2);
   }
-
   else if(!displayed_faces.empty())
   {
     for(halfedge_descriptor h : CGAL::halfedges_around_face(halfedge(displayed_faces[0], mesh), mesh))
@@ -318,7 +346,8 @@ void compute_displayed_ids(Mesh& mesh,
       displayed_vertices.push_back(target(h, mesh));
     }
   }
-  //fill TextItems
+
+  // fill TextItems
   std::vector<bool> vertex_selection(false);
   vertex_selection.resize(num_vertices(mesh));
   VKRingPMAP<Mesh> vpmap(&vertex_selection, &mesh);
@@ -345,9 +374,7 @@ void compute_displayed_ids(Mesh& mesh,
   face_selection.resize(num_faces(mesh));
   FKRingPMAP<Mesh> fpmap(&face_selection, &mesh);
   for(face_descriptor f_h : displayed_faces)
-  {
-      put(fpmap, f_h, true);
-  }
+    put(fpmap, f_h, true);
   CGAL::expand_face_selection(displayed_faces,
                               mesh,
                               1,
@@ -356,9 +383,9 @@ void compute_displayed_ids(Mesh& mesh,
 
   for(vertex_descriptor vh : displayed_vertices)
   {
-    Point pos=Point(get(ppmap, vh).x()+offset.x,
-                    get(ppmap, vh).y()+offset.y,
-                    get(ppmap, vh).z()+offset.z);
+    Point pos = Point(get(ppmap, vh).x() + offset.x,
+                      get(ppmap, vh).y() + offset.y,
+                      get(ppmap, vh).z() + offset.z);
     TextItem* text_item = new TextItem(float(pos.x()),
                                        float(pos.y()),
                                        float(pos.z()),
@@ -366,13 +393,14 @@ void compute_displayed_ids(Mesh& mesh,
     vitems->append(text_item);
     targeted_ids->push_back(text_item);
   }
+
   for(edge_descriptor e : displayed_edges)
   {
-    halfedge_descriptor  h(halfedge(e, mesh));
-    Point pos=CGAL::midpoint(get(ppmap, source(h, mesh)),get(ppmap, target(h, mesh)));
-    pos = Point(pos.x()+offset.x,
-                pos.y()+offset.y,
-                pos.z()+offset.z);
+    halfedge_descriptor h(halfedge(e, mesh));
+    Point pos = CGAL::midpoint(get(ppmap, source(h, mesh)),get(ppmap, target(h, mesh)));
+    pos = Point(pos.x() + offset.x,
+                pos.y() + offset.y,
+                pos.z() + offset.z);
 
     TextItem* text_item = new TextItem(float(pos.x()),
                                        float(pos.y()),
@@ -387,15 +415,15 @@ void compute_displayed_ids(Mesh& mesh,
     int total(0);
     for(vertex_descriptor vh :vertices_around_face(halfedge(f, mesh), mesh))
     {
-      x+=get(ppmap, vh).x();
-      y+=get(ppmap, vh).y();
-      z+=get(ppmap, vh).z();
+      x += get(ppmap, vh).x();
+      y += get(ppmap, vh).y();
+      z += get(ppmap, vh).z();
       ++total;
     }
 
-    Point pos(x/total+offset.x,
-              y/total+offset.y,
-              z/total+offset.z);
+    Point pos(x/total + offset.x,
+              y/total + offset.y,
+              z/total + offset.z);
     TextItem* text_item = new TextItem(float(pos.x()),
                                        float(pos.y()),
                                        float(pos.z()),
@@ -408,18 +436,20 @@ template<class Mesh>
 bool printVertexIds(const Mesh& mesh,
                     TextListItem* vitems)
 {
-  typedef typename boost::property_map<Mesh, boost::vertex_point_t>::const_type Ppmap;
-  typedef typename boost::property_traits<Ppmap>::value_type Point;
-  typedef typename boost::property_map<Mesh, boost::vertex_index_t>::type IDmap;
+  using Ppmap = typename boost::property_map<Mesh, boost::vertex_point_t>::const_type;
+  using Point = typename boost::property_traits<Ppmap>::value_type;
+  using IDmap = typename boost::property_map<Mesh, boost::vertex_index_t>::type;
 
   Ppmap ppmap = get(boost::vertex_point, mesh);
   IDmap idmap = get(boost::vertex_index, mesh);
+
   const CGAL::qglviewer::Vec offset = CGAL::Three::Three::mainViewer()->offset();
+
   QFont font;
   font.setBold(true);
   font.setPointSize(POINT_SIZE);
 
-  //fills textItems
+  // fills textItems
   for(typename boost::graph_traits<Mesh>::vertex_descriptor vh : vertices(mesh))
   {
     const Point& p = get(ppmap, vh);
@@ -429,7 +459,8 @@ bool printVertexIds(const Mesh& mesh,
                                 QString("%1").arg(get(idmap, vh)), true, font, Qt::red));
 
   }
-  //add the QList to the render's pool
+
+  // add the QList to the render's pool
   bool res = true;
   Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
   {
@@ -437,10 +468,9 @@ bool printVertexIds(const Mesh& mesh,
     renderer->addTextList(vitems);
     v->update();
     if(vitems->size() > static_cast<std::size_t>(renderer->getMax_textItems()))
-    {
       res = false;
-    }
   }
+
   return res;
 }
 
@@ -448,13 +478,15 @@ template<class Mesh>
 bool printEdgeIds(const Mesh& mesh,
                   TextListItem* eitems)
 {
-  typedef typename boost::property_map<Mesh, boost::vertex_point_t>::const_type Ppmap;
-  typedef typename boost::property_traits<Ppmap>::value_type Point;
-  typedef typename boost::property_map<Mesh, boost::halfedge_index_t>::type IDmap;
+  using Ppmap = typename boost::property_map<Mesh, boost::vertex_point_t>::const_type;
+  using Point = typename boost::property_traits<Ppmap>::value_type;
+  using IDmap = typename boost::property_map<Mesh, boost::halfedge_index_t>::type;
 
   Ppmap ppmap = get(boost::vertex_point, mesh);
   IDmap idmap = get(boost::halfedge_index, mesh);
+
   const CGAL::qglviewer::Vec offset = CGAL::Three::Three::mainViewer()->offset();
+
   QFont font;
   font.setBold(true);
   font.setPointSize(POINT_SIZE);
@@ -468,7 +500,8 @@ bool printEdgeIds(const Mesh& mesh,
                                 float((p1.z() + p2.z()) / 2 + offset.z),
                                 QString("%1").arg(get(idmap, halfedge(e, mesh)) / 2), true, font, Qt::green));
   }
-  //add the QList to the render's pool
+
+  // add the QList to the render's pool
   bool res = true;
   Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
   {
@@ -476,10 +509,9 @@ bool printEdgeIds(const Mesh& mesh,
     renderer->addTextList(eitems);
     v->update();
     if(eitems->size() > static_cast<std::size_t>(renderer->getMax_textItems()))
-    {
       res = false;
-    }
   }
+
   return res;
 }
 
@@ -487,15 +519,18 @@ template<class Mesh>
 bool printFaceIds(const Mesh& mesh,
                   TextListItem* fitems)
 {
-  typedef typename boost::property_map<Mesh, boost::vertex_point_t>::const_type Ppmap;
-  typedef typename boost::property_map<Mesh, boost::face_index_t>::type IDmap;
+  using Ppmap = typename boost::property_map<Mesh, boost::vertex_point_t>::const_type;
+  using IDmap = typename boost::property_map<Mesh, boost::face_index_t>::type;
 
   Ppmap ppmap = get(boost::vertex_point, mesh);
   IDmap idmap = get(boost::face_index, mesh);
+
   const CGAL::qglviewer::Vec offset = CGAL::Three::Three::mainViewer()->offset();
+
   QFont font;
   font.setBold(true);
   font.setPointSize(POINT_SIZE);
+
   for(typename boost::graph_traits<Mesh>::face_descriptor fh : faces(mesh))
   {
     double x(0), y(0), z(0);
@@ -513,7 +548,8 @@ bool printFaceIds(const Mesh& mesh,
                                 float(z / total + offset.z),
                                 QString("%1").arg(get(idmap, fh)), true, font, Qt::blue));
   }
-  //add the QList to the render's pool
+
+  // add the QList to the render's pool
   bool res = true;
   Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
   {
@@ -521,9 +557,7 @@ bool printFaceIds(const Mesh& mesh,
     renderer->addTextList(fitems);
     v->update();
     if(fitems->size() > static_cast<std::size_t>(renderer->getMax_textItems()))
-    {
       res = false;
-    }
   }
   return res;
 }
@@ -535,14 +569,15 @@ int zoomToId(const Mesh& mesh,
              typename boost::graph_traits<Mesh>::face_descriptor& selected_fh,
              Point& p)
 {
-  typedef typename boost::graph_traits<Mesh>::face_descriptor face_descriptor;
-  typedef typename boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
-  typedef typename boost::property_map<Mesh, boost::vertex_point_t>::const_type Ppmap;
-  typedef typename boost::property_map<Mesh, boost::vertex_index_t>::type VIDmap;
-  typedef typename boost::property_map<Mesh, boost::halfedge_index_t>::type EIDmap;
-  typedef typename boost::property_map<Mesh, boost::face_index_t>::type FIDmap;
-  typedef typename CGAL::Kernel_traits<Point>::Kernel Traits;
+  using vertex_descriptor = typename boost::graph_traits<Mesh>::vertex_descriptor;
+  using face_descriptor = typename boost::graph_traits<Mesh>::face_descriptor;
 
+  using Ppmap = typename boost::property_map<Mesh, boost::vertex_point_t>::const_type;
+  using VIDmap = typename boost::property_map<Mesh, boost::vertex_index_t>::type;
+  using EIDmap = typename boost::property_map<Mesh, boost::halfedge_index_t>::type;
+  using FIDmap = typename boost::property_map<Mesh, boost::face_index_t>::type;
+
+  using Traits = typename CGAL::Kernel_traits<Point>::Kernel;
 
   Ppmap ppmap = get(boost::vertex_point, mesh);
   VIDmap vidmap = get(boost::vertex_index, mesh);
@@ -555,10 +590,11 @@ int zoomToId(const Mesh& mesh,
   if((first != QString("v") &&
       first != QString("e") &&
       first != QString("f")) ||
-     !is_int)
+      !is_int)
   {
     return 1; //("Input must be of the form [v/e/f][int]"
   }
+
   const CGAL::qglviewer::Vec offset = viewer->offset();
   typename Traits::Vector_3 normal;
   if(first == QString("v"))
@@ -567,26 +603,25 @@ int zoomToId(const Mesh& mesh,
     for(vertex_descriptor vh : vertices(mesh))
     {
       std::size_t cur_id = get(vidmap, vh);
-      if( cur_id == id)
+      if(cur_id == id)
       {
         p = Point(get(ppmap, vh).x() + offset.x,
                   get(ppmap, vh).y() + offset.y,
                   get(ppmap, vh).z() + offset.z);
+
         typename boost::graph_traits<Mesh>::halfedge_descriptor hf = halfedge(vh, mesh);
         if(CGAL::is_border(hf, mesh))
-        {
           hf = opposite(hf, mesh);
-        }
+
         selected_fh = face(hf, mesh);
         normal = CGAL::Polygon_mesh_processing::compute_vertex_normal(vh, mesh);
         found = true;
         break;
       }
     }
+
     if(!found)
-    {
-      return 2;//"No vertex with id %1").arg(id)
-    }
+      return 2; // "No vertex with id %1").arg(id)
   }
   else if(first == QString("e"))
   {
@@ -604,10 +639,10 @@ int zoomToId(const Mesh& mesh,
         typename Traits::Vector_3 normal1(0,0,0);
         if(!is_border(hf, mesh))
         {
-          normal1= CGAL::Polygon_mesh_processing::compute_face_normal(face(hf,mesh),
-                                                                      mesh);
+          normal1 = CGAL::Polygon_mesh_processing::compute_face_normal(face(hf,mesh), mesh);
           selected_fh = face(hf, mesh);
         }
+
         typename Traits::Vector_3 normal2(0,0,0);
         if(!is_border(opposite(hf, mesh), mesh))
         {
@@ -615,15 +650,15 @@ int zoomToId(const Mesh& mesh,
                                                                        mesh);
           selected_fh = face(hf, mesh);
         }
-        normal = 0.5*normal1+0.5*normal2;
+
+        normal = 0.5*normal1 + 0.5*normal2;
         found = true;
         break;
       }
     }
+
     if(!found)
-    {
-      return 3;//"No edge with id %1").arg(id)
-    }
+      return 3; // "No edge with id %1").arg(id)
   }
   else if(first == QString("f"))
   {
@@ -634,30 +669,30 @@ int zoomToId(const Mesh& mesh,
     {
       if(get(fidmap, fh) != id)
         continue;
+
       for(vertex_descriptor vh : vertices_around_face(halfedge(fh, mesh), mesh))
       {
-        x+=get(ppmap, vh).x();
-        y+=get(ppmap, vh).y();
-        z+=get(ppmap, vh).z();
+        x += get(ppmap, vh).x();
+        y += get(ppmap, vh).y();
+        z += get(ppmap, vh).z();
         ++total;
       }
+
       p = Point(x/total + offset.x,
-                          y/total + offset.y,
-                          z/total + offset.z);
-      normal = CGAL::Polygon_mesh_processing::compute_face_normal(
-            fh,
-            mesh);
+                y/total + offset.y,
+                z/total + offset.z);
+      normal = CGAL::Polygon_mesh_processing::compute_face_normal(fh, mesh);
       selected_fh = fh;
       found = true;
       break;
     }
+
     if(!found)
-    {
-      return 4; //"No face with id %1").arg(id)
-    }
+      return 4; // "No face with id %1").arg(id)
   }
+
   CGAL::qglviewer::Quaternion new_orientation(CGAL::qglviewer::Vec(0,0,-1),
-                                        CGAL::qglviewer::Vec(-normal.x(), -normal.y(), -normal.z()));
+                                              CGAL::qglviewer::Vec(-normal.x(), -normal.y(), -normal.z()));
   Point new_pos = p +
       0.25*CGAL::qglviewer::Vec(
         viewer->camera()->position().x - viewer->camera()->pivotPoint().x,
@@ -665,19 +700,69 @@ int zoomToId(const Mesh& mesh,
         viewer->camera()->position().z - viewer->camera()->pivotPoint().z)
       .norm() * normal ;
 
-  viewer->camera()->setPivotPoint(CGAL::qglviewer::Vec(p.x(),
-                                                 p.y(),
-                                                 p.z()));
+  viewer->camera()->setPivotPoint(CGAL::qglviewer::Vec(p.x(), p.y(), p.z()));
 
   viewer->moveCameraToCoordinates(QString("%1 %2 %3 %4 %5 %6 %7").arg(new_pos.x())
-                                  .arg(new_pos.y())
-                                  .arg(new_pos.z())
-                                  .arg(new_orientation[0])
-      .arg(new_orientation[1])
-      .arg(new_orientation[2])
-      .arg(new_orientation[3]));
+                                                                 .arg(new_pos.y())
+                                                                 .arg(new_pos.z())
+                                                                 .arg(new_orientation[0])
+                                                                 .arg(new_orientation[1])
+                                                                 .arg(new_orientation[2])
+                                                                 .arg(new_orientation[3]));
   viewer->update();
-  return 0; //all clear;
+
+  return 0; // all clear;
 }
-#endif // ID_PRINTING_H
+
+template<class PointSet>
+int zoomToPoint(const PointSet& ps,
+                const typename PointSet::Index& index,
+                CGAL::Three::Viewer_interface* viewer,
+                typename PointSet::Point_3& p)
+{
+  const CGAL::qglviewer::Vec offset = viewer->offset();
+
+  using Point_3 = typename PointSet::Point_3;
+  using Vector_3 = typename PointSet::Vector_3;
+
+  const Point_3& op = ps.point(index);
+
+  p = Point_3(op.x() + offset.x,
+              op.y() + offset.y,
+              op.z() + offset.z);
+
+  Vector_3 normal;
+  if(ps.has_normal_map())
+    normal = ps.normal(index);
+  else
+    normal = { viewer->camera()->position().x - viewer->camera()->pivotPoint().x,
+               viewer->camera()->position().y - viewer->camera()->pivotPoint().y,
+               viewer->camera()->position().z - viewer->camera()->pivotPoint().z };
+
+  Point_3 new_pos = p +
+      0.25 * CGAL::qglviewer::Vec(
+        viewer->camera()->position().x - viewer->camera()->pivotPoint().x,
+        viewer->camera()->position().y - viewer->camera()->pivotPoint().y,
+        viewer->camera()->position().z - viewer->camera()->pivotPoint().z)
+      .norm() * normal ;
+
+  viewer->camera()->setPivotPoint(CGAL::qglviewer::Vec(p.x(), p.y(), p.z()));
+
+  CGAL::qglviewer::Quaternion new_orientation(CGAL::qglviewer::Vec(0,0,-1),
+                                              CGAL::qglviewer::Vec(-normal.x(), -normal.y(), -normal.z()));
+
+  viewer->moveCameraToCoordinates(QString("%1 %2 %3 %4 %5 %6 %7").arg(new_pos.x())
+                                                                 .arg(new_pos.y())
+                                                                 .arg(new_pos.z())
+                                                                 .arg(new_orientation[0])
+                                                                 .arg(new_orientation[1])
+                                                                 .arg(new_orientation[2])
+                                                                 .arg(new_orientation[3]));
+
+  viewer->update();
+
+  return 0;
+}
+
+#endif // CGAL_POLYHEDRON_DEMO_ID_PRINTING_H
 
diff --git a/Polyhedron/demo/Polyhedron/triangulate_primitive.h b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
index c80ceb08acac..cf7aa8a457bb 100644
--- a/Polyhedron/demo/Polyhedron/triangulate_primitive.h
+++ b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
@@ -1,234 +1,246 @@
-#ifndef TRIANGULATE_PRIMITIVE
-#define TRIANGULATE_PRIMITIVE
+#ifndef CGAL_DEMO_TRIANGULATE_PRIMITIVE_H
+#define CGAL_DEMO_TRIANGULATE_PRIMITIVE_H
+
+#include <CGAL/Three/Scene_item.h>
+
 #include <CGAL/Triangulation_vertex_base_with_info_2.h>
 #include <CGAL/Triangulation_face_base_with_info_2.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
+
 #include <CGAL/Projection_traits_3.h>
-#include <CGAL/Three/Scene_item.h>
-#include <queue>
 
 #include <QColor>
 
-//Make sure all the facets are triangles
+#include <CGAL/boost/graph/properties.h>
+#include <boost/graph/graph_traits.hpp>
+
+#include <iostream>
+#include <queue>
+#include <vector>
+
+// Ensure that all the facets are triangles
+// @todo just use PMP::triangulate_face()...?
+// or at least mark_faces_in_domain()
+
 template<class Mesh, typename Kernel, typename Index_type>
 class FacetTriangulator
 {
- typedef Kernel Traits;
+public:
+  using Traits = Kernel;
+  using Point = typename Kernel::Point_3;
+  using Vector = typename Kernel::Vector_3;
 
- typedef typename boost::graph_traits<Mesh>::halfedge_descriptor halfedge_descriptor;
+  using P_traits = CGAL::Projection_traits_3<Traits>;
 
- typedef typename Kernel::Vector_3 Vector;
+  using halfedge_descriptor = typename boost::graph_traits<Mesh>::halfedge_descriptor;
+  using face_descriptor = typename boost::graph_traits<Mesh>::face_descriptor;
 
+  struct Face_info
+  {
+    typename boost::graph_traits<Mesh>::halfedge_descriptor e[3];
+    bool is_external;
+  };
 
- typedef CGAL::Projection_traits_3<Traits>   P_traits;
+  using Vb = CGAL::Triangulation_vertex_base_with_info_2<halfedge_descriptor, P_traits>;
+  using Fbb = CGAL::Triangulation_face_base_with_info_2<Face_info, P_traits>;
+  using Fb = CGAL::Constrained_triangulation_face_base_2<P_traits, Fbb>;
+  using TDS = CGAL::Triangulation_data_structure_2<Vb, Fb>;
+  using Itag = CGAL::Exact_predicates_tag;
+  using CDT = CGAL::Constrained_Delaunay_triangulation_2<P_traits, TDS, Itag>;
 
- typedef CGAL::Triangulation_vertex_base_with_info_2<halfedge_descriptor,
-                                                     P_traits>        Vb;
+  using Vertex_handle = typename CDT::Vertex_handle;
+  using Face_handle = typename CDT::Face_handle;
 
- struct Face_info {
-   typename boost::graph_traits<Mesh>::halfedge_descriptor e[3];
-   bool is_external;
- };
+  struct PointAndId
+  {
+    Point point;
+    Index_type id;
+    PointAndId() = default;
+    PointAndId(const Point& point, const Index_type id) : point(point), id(id) { }
+  };
 
- typedef CGAL::Triangulation_face_base_with_info_2<Face_info,
-                                                   P_traits>          Fb1;
- typedef CGAL::Constrained_triangulation_face_base_2<P_traits, Fb1>   Fb;
- typedef CGAL::Triangulation_data_structure_2<Vb,Fb>                  TDS;
- typedef CGAL::Exact_predicates_tag                                   Itag;
+public:
+  CDT* cdt;
+  CGAL::Unique_hash_map<Vertex_handle, Index_type> v2v;
 
 public:
- struct PointAndId {
-  typename Kernel::Point_3 point;
-  Index_type id;
- };
-
- typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits,
-                                                     TDS,
-                                                     Itag>             CDT;
-  CDT *cdt;
-  CGAL::Unique_hash_map<typename CDT::Vertex_handle, Index_type> v2v;
-
-  //Constructor
-  FacetTriangulator(typename boost::graph_traits<Mesh>::face_descriptor fd,
+  // Constructor
+  FacetTriangulator(face_descriptor fd,
                     const Vector& normal,
-                    Mesh *poly,
+                    Mesh* poly,
                     Vector offset = Vector(0,0,0))
   {
     std::vector<PointAndId> idPoints;
-    for(halfedge_descriptor he_circ : halfedges_around_face( halfedge(fd, *poly), *poly))
-    {
-      PointAndId idPoint;
-      idPoint.point = get(boost::vertex_point,*poly,source(he_circ, *poly))+offset;
-      idPoint.id = source(he_circ, *poly);
-      idPoints.push_back(idPoint);
+    for(halfedge_descriptor he_circ : halfedges_around_face(halfedge(fd, *poly), *poly))
+      idPoints.emplace_back(get(CGAL::vertex_point, *poly, source(he_circ, *poly)) + offset,
+                            source(he_circ, *poly));
 
-    }
     if(!triangulate(idPoints, normal))
-      std::cerr<<"Facet not displayed"<<std::endl;
+      std::cerr << "Facet not displayed" << std::endl;
   }
-  FacetTriangulator(typename boost::graph_traits<Mesh>::face_descriptor fd,
-                    const std::vector<typename Kernel::Point_3>& more_points,
+
+  FacetTriangulator(face_descriptor fd,
+                    const std::vector<Point>& more_points,
                     const Vector& normal,
-                    Mesh *poly,
+                    Mesh* poly,
                     Vector offset = Vector(0,0,0))
   {
-   std::vector<PointAndId> idPoints;
-   for(halfedge_descriptor he_circ : halfedges_around_face( halfedge(fd, *poly), *poly))
-   {
-    PointAndId idPoint;
-    idPoint.point = get(boost::vertex_point,*poly,source(he_circ, *poly))+offset;
-    idPoint.id = source(he_circ, *poly);
-    idPoints.push_back(idPoint);
-
-   }
-   if(!triangulate_with_points(idPoints,more_points, normal))
-     std::cerr<<"Facet not displayed"<<std::endl;
+    std::vector<PointAndId> idPoints;
+    for(halfedge_descriptor he_circ : halfedges_around_face(halfedge(fd, *poly), *poly))
+      idPoints.emplace_back(get(CGAL::vertex_point, *poly, source(he_circ, *poly)) + offset,
+                            source(he_circ, *poly));
+
+    if(!triangulate_with_points(idPoints, more_points, normal))
+      std::cerr << "Facet not displayed" << std::endl;
   }
 
-  FacetTriangulator(std::vector<PointAndId > &idPoints,
-                  const Vector& normal)
+  FacetTriangulator(std::vector<PointAndId>& idPoints,
+                    const Vector& normal)
   {
     if(!triangulate(idPoints, normal))
-      std::cerr<<"Facet not displayed"<<std::endl;
+      std::cerr << "Facet not displayed" << std::endl;
   }
-  FacetTriangulator(std::vector<PointAndId > &idPoints,
-                    const std::vector<typename Kernel::Point_3>& more_points,
+  FacetTriangulator(std::vector<PointAndId>& idPoints,
+                    const std::vector<Point>& more_points,
                     const Vector& normal)
   {
-   if(!triangulate_with_points(idPoints, more_points, normal))
-     std::cerr<<"Facet not displayed"<<std::endl;
-
+    if(!triangulate_with_points(idPoints, more_points, normal))
+      std::cerr << "Facet not displayed" << std::endl;
   }
+
   ~FacetTriangulator()
   {
-   if (cdt )
-     delete cdt;
+    if(cdt)
+      delete cdt;
   }
 
 private:
-  bool triangulate( std::vector<PointAndId > &idPoints,
-              const Vector& normal )
+  bool triangulate(std::vector<PointAndId>& idPoints,
+                   const Vector& normal)
   {
     P_traits cdt_traits(normal);
     cdt = new CDT(cdt_traits);
-    typename CDT::Vertex_handle previous, first, last_inserted;
+
+    Vertex_handle previous, first, last_inserted;
 
     // Iterate the points of the facet and decide if they must be inserted in the CDT
     typename Kernel::FT x(0), y(0), z(0);
 
-    for(PointAndId idPoint : idPoints)
+    for(const PointAndId& idPoint : idPoints)
     {
-
       x += idPoint.point.x();
-     y += idPoint.point.y();
-     z += idPoint.point.z();
-     typename CDT::Vertex_handle vh;
-     //Always insert the first point, then only insert
-     // if the distance with the previous is reasonable.
-     if(first == typename CDT::Vertex_handle() || idPoint.point != previous->point())
-     {
-       vh = cdt->insert(idPoint.point);
-       v2v[vh] = idPoint.id;
-       if(first == typename CDT::Vertex_handle()) {
-         first = vh;
-       }
-       if(previous != nullptr && previous != vh) {
-         cdt->insert_constraint(previous, vh);
-         last_inserted = previous;
-       }
-       previous = vh;
-     }
+      y += idPoint.point.y();
+      z += idPoint.point.z();
+
+      Vertex_handle vh;
+      // Always insert the first point, then only insert if the distance with the previous is reasonable.
+      if(first == Vertex_handle() || idPoint.point != previous->point())
+      {
+        vh = cdt->insert(idPoint.point);
+        v2v[vh] = idPoint.id;
+        if(first == Vertex_handle())
+          first = vh;
+
+        if(previous != nullptr && previous != vh)
+        {
+          cdt->insert_constraint(previous, vh);
+          last_inserted = previous;
+        }
+        previous = vh;
+      }
     }
-    if(last_inserted == typename CDT::Vertex_handle())
+
+    if(last_inserted == Vertex_handle())
       return false;
+
     if(previous != first)
       cdt->insert_constraint(previous, first);
+
     // sets mark is_external
-    for(typename CDT::All_faces_iterator
-        fit2 = cdt->all_faces_begin(),
-        end = cdt->all_faces_end();
-        fit2 != end; ++fit2)
-    {
-      fit2->info().is_external = false;
-    }
-    //check if the facet is external or internal
+    for(Face_handle f2 : cdt->all_face_handles())
+      f2->info().is_external = false;
+
+    // check if the facet is external or internal
     std::queue<typename CDT::Face_handle> face_queue;
     face_queue.push(cdt->infinite_vertex()->face());
-    while(! face_queue.empty() ) {
+    while(! face_queue.empty())
+    {
       typename CDT::Face_handle fh = face_queue.front();
       face_queue.pop();
-      if(fh->info().is_external) continue;
+      if(fh->info().is_external)
+        continue;
+
       fh->info().is_external = true;
-      for(int i = 0; i <3; ++i) {
+      for(int i = 0; i <3; ++i)
+      {
         if(!cdt->is_constrained(std::make_pair(fh, i)))
-        {
           face_queue.push(fh->neighbor(i));
-        }
       }
     }
+
     return true;
   }
 
-  bool triangulate_with_points( std::vector<PointAndId > &idPoints,
-               const std::vector<typename Kernel::Point_3>& more_points,
-               const Vector& normal)
-   {
-     P_traits cdt_traits(normal);
-     cdt = new CDT(cdt_traits);
-     typename CDT::Vertex_handle previous, first, last_inserted;
-     // Iterate the points of the facet and decide if they must be inserted in the CDT
-     for(PointAndId idPoint : idPoints)
-     {
-      typename CDT::Vertex_handle vh;
-      //Always insert the first point, then only insert
-      // if the distance with the previous is reasonable.
-      if(first == typename CDT::Vertex_handle() || idPoint.point != previous->point())
+  bool triangulate_with_points(std::vector<PointAndId >& idPoints,
+                               const std::vector<Point>& more_points,
+                               const Vector& normal)
+  {
+    P_traits cdt_traits(normal);
+    cdt = new CDT(cdt_traits);
+
+    // Iterate the points of the facet and decide if they must be inserted in the CDT
+    Vertex_handle previous, first, last_inserted;
+    for(const PointAndId& idPoint : idPoints)
+    {
+      Vertex_handle vh;
+      // Always insert the first point, then only insert if the distance with the previous is reasonable.
+      if(first == Vertex_handle() || idPoint.point != previous->point())
       {
         vh = cdt->insert(idPoint.point);
         v2v[vh] = idPoint.id;
-        if(first == typename CDT::Vertex_handle()) {
+        if(first == Vertex_handle())
           first = vh;
-        }
-        if(previous != nullptr && previous != vh) {
+
+        if(previous != nullptr && previous != vh)
+        {
           cdt->insert_constraint(previous, vh);
           last_inserted = previous;
         }
-      previous = vh;
+        previous = vh;
+      }
+    }
+
+    if(last_inserted == Vertex_handle())
+      return false;
+
+    cdt->insert_constraint(previous, first);
+    for(const Point& point : more_points)
+      cdt->insert(point);
+
+    // sets mark is_external
+    for(Face_handle f2 : cdt->all_face_handles())
+      f2->info().is_external = false;
+
+    // check if the facet is external or internal
+    std::queue<typename CDT::Face_handle> face_queue;
+    face_queue.push(cdt->infinite_vertex()->face());
+    while(!face_queue.empty())
+    {
+      typename CDT::Face_handle fh = face_queue.front();
+      face_queue.pop();
+      if(fh->info().is_external)
+        continue;
+      fh->info().is_external = true;
+      for(int i = 0; i <3; ++i)
+      {
+        if(!cdt->is_constrained(std::make_pair(fh, i)))
+          face_queue.push(fh->neighbor(i));
       }
-     }
-     if(last_inserted == typename CDT::Vertex_handle())
-       return false;
-     cdt->insert_constraint(previous, first);
-     for(typename Kernel::Point_3 point : more_points)
-     {
-       cdt->insert(point);
-     }
-     // sets mark is_external
-     for(typename CDT::All_faces_iterator
-         fit2 = cdt->all_faces_begin(),
-         end = cdt->all_faces_end();
-         fit2 != end; ++fit2)
-     {
-       fit2->info().is_external = false;
-     }
-     //check if the facet is external or internal
-     std::queue<typename CDT::Face_handle> face_queue;
-     face_queue.push(cdt->infinite_vertex()->face());
-     while(! face_queue.empty() ) {
-       typename CDT::Face_handle fh = face_queue.front();
-       face_queue.pop();
-       if(fh->info().is_external) continue;
-       fh->info().is_external = true;
-       for(int i = 0; i <3; ++i) {
-         if(!cdt->is_constrained(std::make_pair(fh, i)))
-         {
-           face_queue.push(fh->neighbor(i));
-         }
-       }
-     }
-     return true;
+    }
+
+    return true;
   }
 };
 
-#endif // TRIANGULATE_PRIMITIVE
+#endif // CGAL_DEMO_TRIANGULATE_PRIMITIVE_H
 
diff --git a/Three/include/CGAL/Three/Scene_interface.h b/Three/include/CGAL/Three/Scene_interface.h
index e60049c91a0a..64441fe197db 100644
--- a/Three/include/CGAL/Three/Scene_interface.h
+++ b/Three/include/CGAL/Three/Scene_interface.h
@@ -58,7 +58,6 @@ namespace Three{
  * */
 class Scene_interface {
 public:
-
   //!A bounding box is a box with each face corresponding to an extremum of its contents.
 
   typedef CGAL::Bbox_3 Bbox;
diff --git a/Three/include/CGAL/Three/Scene_item.h b/Three/include/CGAL/Three/Scene_item.h
index f22b9be5f52d..c7920cbefed8 100644
--- a/Three/include/CGAL/Three/Scene_item.h
+++ b/Three/include/CGAL/Three/Scene_item.h
@@ -81,7 +81,7 @@ class SCENE_ITEM_EXPORT Scene_item : public QObject{
     PROGRAM_OLD_FLAT,            /** Used to render flat shading without pre computing normals without geometry shader*/
     PROGRAM_SOLID_WIREFRAME,     //! Used to render edges with width superior to 1.
     PROGRAM_NO_INTERPOLATION,   //! Used to render faces without interpolating their color.
-    PROGRAM_HEAT_INTENSITY,      //! Used to render special item in Display_property_plugin
+    PROGRAM_HEAT_INTENSITY,      //! Used to render special item in Heat_method_plugin
     NB_OF_PROGRAMS               //! Holds the number of different programs in this enum.
   };
   typedef CGAL::Bbox_3 Bbox;
diff --git a/Three/include/CGAL/Three/Viewer_interface.h b/Three/include/CGAL/Three/Viewer_interface.h
index c1330a12301f..2bdba0aadd39 100644
--- a/Three/include/CGAL/Three/Viewer_interface.h
+++ b/Three/include/CGAL/Three/Viewer_interface.h
@@ -70,7 +70,7 @@ class VIEWER_EXPORT Viewer_interface : public CGAL::QGLViewer{
    PROGRAM_OLD_FLAT,            /** Used to render flat shading without pre computing normals without geometry shader*/
    PROGRAM_SOLID_WIREFRAME,     //! Used to render edges with width superior to 1.
    PROGRAM_NO_INTERPOLATION,   //! Used to render faces without interpolating their color.
-   PROGRAM_HEAT_INTENSITY,      //! Used to render special item in Display_property_plugin
+   PROGRAM_HEAT_INTENSITY,      //! Used to render special item in Heat_method_plugin
    PROGRAM_TETRA_FILTERING,     //! Used in Scene_tetrahedra_item with Tetrahedra_filtering_plugin
    NB_OF_PROGRAMS               //! Holds the number of different programs in this enum.
   };

From 96ce2a28afde8747435ed68c9cec6206864becf1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 21 Jun 2023 14:36:17 +0200
Subject: [PATCH 0390/1398] Apply suggestion from @lrineau

---
 .../Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index bbee40716425..a105d1ba12e4 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -485,7 +485,7 @@ public Q_SLOTS:
   // This is for the message box and thread interruption
   void wrapping_done(Wrapper_thread* wrapper_thread)
   {
-    Scene_surface_mesh_item* wrap_item = new Scene_surface_mesh_item(wrapper_thread->wrap);
+    Scene_surface_mesh_item* wrap_item = new Scene_surface_mesh_item(std::move(wrapper_thread->wrap));
     wrap_item->setName(tr("Wrap with alpha %2 offset %3").arg(wrapper_thread->alpha)
                                                          .arg(wrapper_thread->offset));
     wrap_item->setColor(Qt::gray);

From e4d98ef92a1dcc81e0fae1cfe7ad5f0cd6652040 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 21 Jun 2023 15:32:58 +0200
Subject: [PATCH 0391/1398] add an example for cmap insert cell 1 between two
 cells 2

---
 .../Combinatorial_map/map_3_insert.cpp        | 34 +++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 Combinatorial_map/examples/Combinatorial_map/map_3_insert.cpp

diff --git a/Combinatorial_map/examples/Combinatorial_map/map_3_insert.cpp b/Combinatorial_map/examples/Combinatorial_map/map_3_insert.cpp
new file mode 100644
index 000000000000..4963fcb23a70
--- /dev/null
+++ b/Combinatorial_map/examples/Combinatorial_map/map_3_insert.cpp
@@ -0,0 +1,34 @@
+#include <CGAL/Combinatorial_map.h>
+#include <iostream>
+#include <cstdlib>
+#include <cassert>
+
+typedef CGAL::Combinatorial_map<3> CMap_3;
+typedef CMap_3::Dart_descriptor    Dart_descriptor;
+
+int main()
+{
+  CMap_3 cm;
+
+  // Create one combinatorial hexahedron
+  Dart_descriptor d1 = cm.make_combinatorial_hexahedron();
+
+  // Create one square face
+  Dart_descriptor d2=cm.make_combinatorial_polygon(4);
+
+  assert(cm.is_insertable_cell_1_between_two_cells_2(d1,d2));
+
+  // Insert the square face as a hole of the face of the hexahedron containing d1
+  cm.insert_cell_1_between_two_cells_2(d1, d2);
+
+  // Display the combinatorial map characteristics.
+  cm.display_characteristics(std::cout)<<", valid="
+                                       <<cm.is_valid()<<std::endl;
+
+  std::size_t nb=0;
+  for(Dart_descriptor dh=cm.darts().begin(); dh!=cm.darts().end(); ++dh)
+  { if (cm.is_free<2>(dh)) ++nb; }
+  std::cout<<"Number of 2-free darts: "<<nb<<std::endl;
+
+  return EXIT_SUCCESS;
+}

From e3c36d387bf0af8ab546a5ecacca0e20ffeda18c Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 21 Jun 2023 15:33:03 +0200
Subject: [PATCH 0392/1398] add one example in the user manual

---
 .../doc/Combinatorial_map/Combinatorial_map.txt  | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)

diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
index 2e36037ea231..0ff995a3cddb 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
@@ -393,6 +393,8 @@ Example of \link GenericMap::insert_cell_1_in_cell_2 `insert_cell_1_in_cell_2`\e
 
 `cm.`\link GenericMap::insert_dangling_cell_1_in_cell_2 `insert_dangling_cell_1_in_cell_2(d0)`\endlink adds a 1-cell in the 2-cell containing dart `d0`, the 1-cell being attached by only one of its vertex to the 0-cell containing dart `d0`.  This operation is possible if `d0`\f$ \in \f$ \link GenericMap::darts `cm.darts()`\endlink.
 
+`cm.`\link GenericMap::insert_cell_1_between_two_cells_2 `insert_cell_1_between_two_cells_2(d1,d2)`\endlink adds a 1-cell between the two faces containing containing darts `d1` and `d2`, between the two 0-cells containing darts `d1` and `d2`. The 2-cells are merged in one. This operation is possible if <I>d1</I>\f$ \not \in \f$ \f$ \langle{}\f$\f$ \beta_1\f$\f$ \rangle{}\f$(<I>d2</I>) which can be tested thanks to `cm.`\link GenericMap::is_insertable_cell_1_between_two_cells_2 `is_insertable_cell_1_between_two_cells_2(d1,d2)`\endlink.
+
 `cm.`\link GenericMap::insert_cell_2_in_cell_3 `insert_cell_2_in_cell_3(itbegin,itend)`\endlink adds a 2-cell in the 3-cell containing all the darts between `itbegin` and `itend`, along the path of 1-cells containing darts in [`itbegin`,`itend`). The 3-cell is split in two. This operation is possible if all the  darts in [`itbegin`,`itend`) form a closed path inside a same 3-cell  which can be tested thanks to `cm.`\link GenericMap::is_insertable_cell_2_in_cell_3 `is_insertable_cell_2_in_cell_3(itbegin,itend)`\endlink (see example on \cgalFigureRef{fig_cmap_insert_facet}).
 
 \cgalFigureBegin{fig_cmap_insert_facet,cmap_insert_facet.svg}
@@ -456,6 +458,20 @@ The second line is the result after the removal operations. We retrieve the orig
 Example of high level operations. Left: Initial 3D combinatorial map after the creation of the combinatorial hexahedron. Middle: Combinatorial map obtained after the two 1-cell insertions. The two 2-cells were split in two. Right: Combinatorial map obtained after the 2-cell insertion. The 3-cell was split in two.
 \cgalFigureEnd
 
+\subsection Combinatorial_mapHighLevelOperations Insert an edge between two different faces
+
+\anchor ssecexempleinsertion
+
+This example shows the use of \link GenericMap::insert_cell_1_between_two_cells_2 `insert_cell_1_between_two_cells_2`\endlink operation. First we create a combinatorial hexahedron and a face with 4 edges. This face is inserted in the face of the hexahedron containing dart d1. We display the characteristics of the combinatorial map and check its validity. Then we count and display the number of 2-free darts.
+
+The output is:
+\verbatim
+#Darts=30, #0-cells=12, #1-cells=17, #2-cells=6, #3-cells=1, #ccs=1, valid=1
+Number of 2-free darts: 4
+\endverbatim
+
+We can verify that there are 6 2-cells after the insertion since the squared face was inserted as a hole in one face of the hexahedron. We can also see that there are 4 2-free darts, which are the 4 darts of the squared face. Since they bounded an hole, there is no face filling the hole and thus there 4 darts are 2-free.
+
 \subsection Combinatorial_mapA4DGenericMap A 4D Combinatorial Map
 
 In this example, a 4-dimensional combinatorial map is used. Two tetrahedral cells are created and sewn by \f$ \beta_4\f$. Then the numbers of cells of the combinatorial map are displayed, and its validity is checked.

From 24b38f2d93cef2236193dced6b51864d2344231d Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 21 Jun 2023 15:34:39 +0200
Subject: [PATCH 0393/1398] add example

---
 Combinatorial_map/doc/Combinatorial_map/examples.txt | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Combinatorial_map/doc/Combinatorial_map/examples.txt b/Combinatorial_map/doc/Combinatorial_map/examples.txt
index ce72b6a64a2b..c77e4e6c5221 100644
--- a/Combinatorial_map/doc/Combinatorial_map/examples.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/examples.txt
@@ -6,4 +6,5 @@
 \example Combinatorial_map/map_3_with_colored_facets.cpp
 \example Combinatorial_map/map_3_dynamic_onmerge.cpp
 \example Combinatorial_map/map_3_index.cpp
+\example Combinatorial_map/map_3_insert.cpp
 */

From 8fb08a14055a3bf515398136edff281c736c5cac Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 21 Jun 2023 15:37:11 +0200
Subject: [PATCH 0394/1398] Update changes.md

---
 Installation/CHANGES.md | 9 +++++++++
 1 file changed, 9 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index c4ce7a51d6d1..229d1145c8a3 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -1,6 +1,15 @@
 Release History
 ===============
 
+[Release 6.0](https://github.com/CGAL/cgal/releases/tag/v6.0)
+-----------
+
+Release date: XXX
+
+### [Combinatorial Maps](https://doc.cgal.org/6.0/Manual/packages.html#PkgCombinatorialMaps)
+
+- Added the function `insert_cell_1_between_two_cells_2()` to the `GenericMap` concept, which enables users to insert an edge between two different faces in order to create faces with holes.
+
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------
 

From 4798874609572913e41a863919132855437e9caa Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 21 Jun 2023 15:44:56 +0200
Subject: [PATCH 0395/1398] add the example and update the anchor

---
 Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
index 0ff995a3cddb..6b95790b57be 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
@@ -458,12 +458,14 @@ The second line is the result after the removal operations. We retrieve the orig
 Example of high level operations. Left: Initial 3D combinatorial map after the creation of the combinatorial hexahedron. Middle: Combinatorial map obtained after the two 1-cell insertions. The two 2-cells were split in two. Right: Combinatorial map obtained after the 2-cell insertion. The 3-cell was split in two.
 \cgalFigureEnd
 
-\subsection Combinatorial_mapHighLevelOperations Insert an edge between two different faces
+\subsection Combinatorial_mapInsertion Insert an edge between two different faces
 
 \anchor ssecexempleinsertion
 
 This example shows the use of \link GenericMap::insert_cell_1_between_two_cells_2 `insert_cell_1_between_two_cells_2`\endlink operation. First we create a combinatorial hexahedron and a face with 4 edges. This face is inserted in the face of the hexahedron containing dart d1. We display the characteristics of the combinatorial map and check its validity. Then we count and display the number of 2-free darts.
 
+\cgalExample{Combinatorial_map/map_3_insert.cpp}
+
 The output is:
 \verbatim
 #Darts=30, #0-cells=12, #1-cells=17, #2-cells=6, #3-cells=1, #ccs=1, valid=1

From 61a39cc95bcf5a0e72e1f13d2e921423c24bc04b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 22 Jun 2023 10:11:24 +0200
Subject: [PATCH 0396/1398] disable MSVC 2015 starting with CGAL 6.0

---
 .../run_testsuite_with_ctest                  | 19 +++++++++++++------
 1 file changed, 13 insertions(+), 6 deletions(-)

diff --git a/Scripts/developer_scripts/run_testsuite_with_ctest b/Scripts/developer_scripts/run_testsuite_with_ctest
index 8c93c47f0747..9c47517049e1 100644
--- a/Scripts/developer_scripts/run_testsuite_with_ctest
+++ b/Scripts/developer_scripts/run_testsuite_with_ctest
@@ -105,6 +105,13 @@ collect_all_current_platforms()
 build_platforms_list()
 {
   for LOCAL_PLATFORM in $1; do
+    # MSVC2015 does not support C++17
+    if [ $1 \> "CGAL-6.0" ]; then
+      if [ "LOCAL_PLATFORM" = "MSVC2015-Release-64bits" ]; then
+        continue
+      fi
+    fi
+
     if [ "${LOCAL_PLATFORM}" = "all" ] ; then
       USE_REFERENCE_PLATFORMS='y'
     else
@@ -116,7 +123,7 @@ build_platforms_list()
 
 # ----------------------------------------------------------------------------------------
 # Sets up the variables indicating the directories to use.
-# Crates all platform directories under the current release binary folder.
+# Creates all platform directories under the current release binary folder.
 # ----------------------------------------------------------------------------------------
 setup_dirs()
 {
@@ -170,8 +177,8 @@ setup_dirs()
   # directories existing in the reference release are added to $PLATFORMS
   #
   PLATFORMS=""
-  build_platforms_list "`value_of BUILD_ON_${HOST}`"
-  build_platforms_list "`value_of COMPILERS_${HOST}`"
+  build_platforms_list "`value_of BUILD_ON_${HOST}`" "${CGAL_RELEASE_ID}"
+  build_platforms_list "`value_of COMPILERS_${HOST}`" "${CGAL_RELEASE_ID}"
 
   if [ -n "${USE_REFERENCE_PLATFORMS}" ]; then
     collect_all_reference_platforms
@@ -214,17 +221,17 @@ put_demos_on_web()
 collect_demos_binaries()
 {
   PLATFORM=${1}
-  
+
   cd "${CGAL_TEST_DIR}"
 
   echo "COLLECT_DEMOS_BINARIES=$COLLECT_DEMOS_BINARIES"
   if [ -n "$COLLECT_DEMOS_BINARIES" ]; then
     echo 'COLLECTING DEMOS BINARIES'
 
-    
+
     DEMOS_TEST_DIR="${CGAL_DIR}/cmake/platforms/${PLATFORM}/test"
     cp "${CGAL_DIR}/${SCRIPTS_DIR}developer_scripts/cgal_demo_copy_all_dlls_cygwin.sh" "${DEMOS_TEST_DIR}"
-    
+
     cd ${DEMOS_TEST_DIR}
 
     for demo_dir in *_Demo; do

From 98e3dbb6e372732741f3400be83c6974a5cbde12 Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Thu, 22 Jun 2023 10:26:19 +0200
Subject: [PATCH 0397/1398] D'oh!

Co-authored-by: Laurent Rineau <Laurent.Rineau@cgal.org>
---
 Scripts/developer_scripts/run_testsuite_with_ctest | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Scripts/developer_scripts/run_testsuite_with_ctest b/Scripts/developer_scripts/run_testsuite_with_ctest
index 9c47517049e1..b86a5b9f705e 100644
--- a/Scripts/developer_scripts/run_testsuite_with_ctest
+++ b/Scripts/developer_scripts/run_testsuite_with_ctest
@@ -106,7 +106,7 @@ build_platforms_list()
 {
   for LOCAL_PLATFORM in $1; do
     # MSVC2015 does not support C++17
-    if [ $1 \> "CGAL-6.0" ]; then
+    if [ $2 \> "CGAL-6.0" ]; then
       if [ "LOCAL_PLATFORM" = "MSVC2015-Release-64bits" ]; then
         continue
       fi

From a2ab7a2090532ff7f75f0ef7ae9934dad9ea2007 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Thu, 22 Jun 2023 10:47:28 +0200
Subject: [PATCH 0398/1398] Small corrections in the doc

---
 Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt | 2 +-
 Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
index 6b95790b57be..08afd5085870 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
@@ -472,7 +472,7 @@ The output is:
 Number of 2-free darts: 4
 \endverbatim
 
-We can verify that there are 6 2-cells after the insertion since the squared face was inserted as a hole in one face of the hexahedron. We can also see that there are 4 2-free darts, which are the 4 darts of the squared face. Since they bounded an hole, there is no face filling the hole and thus there 4 darts are 2-free.
+We can verify that there are 6 2-cells after the insertion since the squared face was inserted as a hole in one face of the hexahedron. We can also see that there are 4 2-free darts, which are the 4 darts of the squared face. Since they bound an hole, there is no face filling the hole and thus 4 darts are 2-free.
 
 \subsection Combinatorial_mapA4DGenericMap A 4D Combinatorial Map
 
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
index c080e2166d4c..2439a614f03c 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
@@ -910,7 +910,7 @@ Inserts a 1-cell in the 2-cell containing `d1` and `d2`. Returns `previous(d1)`,
 
 See examples for combinatorial map in \cgalFigureRef{fig_cmap_insert_edge} and for generalized map in \cgalFigureRef{fig_gmap_insert_edge}.
 
-If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if 2-attributes are non `void`, \link CellAttribute::On_split `Attribute_type<2>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called, with <I>a</I> the original 2-attribute associated with `d` and <I>a'</I> the new 2-attribute created during the operation. If set, the dynamic on-split function of 2-attributes is also called on <I>a</I> and <I>a'</I>.
+If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, if 2-attributes are non `void`, \link CellAttribute::On_split `Attribute_type<2>::type::On_split`\endlink(<I>a</I>,<I>a'</I>) is called, with <I>a</I> the original 2-attribute associated with `d1` and <I>a'</I> the new 2-attribute created during the operation. If set, the dynamic on-split function of 2-attributes is also called on <I>a</I> and <I>a'</I>.
 
 \cgalAdvancedBegin
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.
@@ -930,7 +930,7 @@ Dart_descriptor insert_cell_1_in_cell_2(Dart_descriptor d1, Dart_descriptor d2);
 Inserts a 1-cell between the 2-cell containing `d1` and the one containing `d2`. Returns `previous(d1)`, a descriptor on one dart belonging to the new 1-cell.
 \pre `is_insertable_cell_1_between_two_cells_2(d1,d2)`.
 
-If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, call \link CellAttribute::On_merge `Attribute_type<i>::type::On_merge`\endlink(<I>a</I>,<I>a'</I>) is called for all enabled i-attributes, for i>=2, with <I>a</I> the original 2-attribute associated with `d` and <I>a'</I> the new 2-attribute created during the operation. If set, the dynamic on-merge function of i-attributes is also called on <I>a</I> and <I>a'</I>.
+If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==true`, call \link CellAttribute::On_merge `Attribute_type<i>::type::On_merge`\endlink(<I>a</I>,<I>a'</I>) is called for all enabled i-attributes, for i>=2, with <I>a</I> the original 2-attribute associated with `d1` and <I>a'</I> the original 2-attribute associated with `d2`. If set, the dynamic on-merge function of i-attributes is also called on <I>a</I> and <I>a'</I>.
 
 \cgalAdvancedBegin
 If \link GenericMap::are_attributes_automatically_managed `are_attributes_automatically_managed()`\endlink`==false`, non void attributes are not updated; thus the generic map can be no more valid after this operation.

From 28ea0d42e02985677056b3b8b28c7fcb6fbe656c Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Thu, 22 Jun 2023 12:11:57 +0200
Subject: [PATCH 0399/1398] Using

---
 Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
index 08afd5085870..6e7960fe4b02 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
@@ -168,7 +168,7 @@ Considering these different advantages and drawbacks, you can choose to use gene
 
 The diagram in \cgalFigureRef{fig_cmap_diagramme_class} shows the different classes of the package. `Combinatorial_map` is the main class (see Section \ref sseccombinatorialmap "Combinatorial Maps"). It allows to manage darts and attributes (see Section \ref ssecattributes "Cell Attributes"). Users can customize a combinatorial map thanks to an items class (see Section \ref ssecitem "Combinatorial Map Items"), which defines the information associated with darts and the attribute types. These types may be different for different dimensions, and they may also be void (note that the main concepts of `GenericMap`, `GenericMapItems` and `CellAttribute` are shared between combinatorial maps and generalized maps).
 
-The darts and attributes are accessed through <I>descriptors</I> (either Indices or Handles). A handle is a model of the `Handle` concept, thus supporting the two dereference operators `operator*` and `operator->`. All handles are model of `LessThanComparable` and `Hashable`, that is they can be used as keys in containers such as `std::map` and `std::unordered_map`. An index is a model of the `Index` concept, which is mainly an integer which is convertible from and to std::size_t. Indices can be used as index into vectors which store properties (cf. one example in Section \ref ssecexample3DCMWI "3D Combinatorial Map using Indices").
+The darts and attributes are accessed through <I>descriptors</I> (either Indices or Handles). A handle is a model of the `Handle` concept, thus supporting the two dereference operators `operator*` and `operator->`. All handles are model of `LessThanComparable` and `Hashable`, that is they can be used as keys in containers such as `std::map` and `std::unordered_map`. An index is a model of the `Index` concept, which is mainly an integer which is convertible from and to std::size_t. Indices can be used as index into vectors which store properties (cf. one example in Section \ref ssecexample3DCMWI "3D Combinatorial Map Using Indices").
 
 \cgalFigureBegin{fig_cmap_diagramme_class,cmap_diagramme_class.svg}
 UML diagram of the main classes of the package. k is the number of non void attributes.
@@ -520,7 +520,7 @@ Lastly we remove the dynamic onmerge functor (step 7). This is done by initializ
 
 \cgalExample{Combinatorial_map/map_3_dynamic_onmerge.cpp}
 
-\subsection ssecexample3DCMWI 3D Combinatorial Map using Indices
+\subsection ssecexample3DCMWI 3D Combinatorial Map Using Indices
 
 In this example, a 3-dimensional combinatorial map is used, but using indices instead of handles. Two vectors are created to store some external information associated with darts and 3-attributes. Since descriptors are indices, they can directly be used to access elements of the vector.
 

From 571536f09c2b0afc7f42485276d95f74d1e159ca Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 22 Jun 2023 14:38:23 +0200
Subject: [PATCH 0400/1398] fix version checker

the 3 major/minor/patch are needed to compare integrals

if they are defined, the version check is done and warning or error are displayed
---
 Installation/include/CGAL/config.h           |  2 +-
 Installation/include/CGAL/version_checker.h  | 53 ++++++++++++++++++++
 Installation/include/CGAL/version_enforcer.h | 41 ---------------
 3 files changed, 54 insertions(+), 42 deletions(-)
 create mode 100644 Installation/include/CGAL/version_checker.h
 delete mode 100644 Installation/include/CGAL/version_enforcer.h

diff --git a/Installation/include/CGAL/config.h b/Installation/include/CGAL/config.h
index f37531001398..13379cf2a3c8 100644
--- a/Installation/include/CGAL/config.h
+++ b/Installation/include/CGAL/config.h
@@ -117,7 +117,7 @@
 #include <boost/version.hpp>
 
 #include <CGAL/version.h>
-#include <CGAL/version_enforcer.h>
+#include <CGAL/version_checker.h>
 
 //----------------------------------------------------------------------//
 //  platform specific workaround flags (CGAL_CFG_...)
diff --git a/Installation/include/CGAL/version_checker.h b/Installation/include/CGAL/version_checker.h
new file mode 100644
index 000000000000..9061ee89c54d
--- /dev/null
+++ b/Installation/include/CGAL/version_checker.h
@@ -0,0 +1,53 @@
+// Copyright (c) 2023 GeometryFactory.
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : -
+
+#ifndef CGAL_VERSION_CHECKER_H
+#define CGAL_VERSION_CHECKER_H
+
+#include <CGAL/version_macros.h>
+
+// All files including this header are meant to work with a given version of CGAL
+// When using forked headers, set the following macro to the version of CGAL
+// you want to use.
+
+//// Set the 3 following macros to the version of CGAL you want to use
+//#define CGAL_AUTHORIZED_VERSION_MAJOR 6
+//#define CGAL_AUTHORIZED_VERSION_MINOR 0
+//#define CGAL_AUTHORIZED_VERSION_PATCH 0
+
+// Set the following macros to 1 to get a warning/an error
+// when using a bad version of CGAL
+#define CGAL_VERSION_CHECKER_ERROR 0
+#define CGAL_VERSION_CHECKER_WARNING 0
+
+#define CGAL_AUTHORIZED_VERSION_STR CGAL_STR(CGAL_AUTHORIZED_VERSION_MAJOR) "." \
+                                    CGAL_STR(CGAL_AUTHORIZED_VERSION_MINOR) "." \
+                                    CGAL_STR(CGAL_AUTHORIZED_VERSION_PATCH)
+
+
+// Check that the version of CGAL used is the one expected
+#if  CGAL_AUTHORIZED_VERSION_MAJOR != CGAL_VERSION_MAJOR \
+  || CGAL_AUTHORIZED_VERSION_MINOR != CGAL_VERSION_MINOR \
+  || CGAL_AUTHORIZED_VERSION_PATCH != CGAL_VERSION_PATCH
+
+    #if CGAL_VERSION_CHECKER_WARNING || CGAL_VERSION_CHECKER_ERROR
+      #pragma message("These headers are meant to be used with CGAL " CGAL_AUTHORIZED_VERSION_STR " only."\
+                       " You are using CGAL version: " CGAL_STR(CGAL_VERSION) ".")
+
+      #ifdef CGAL_VERSION_CHECKER_ERROR
+        #error "Wrong version of CGAL"
+      #endif
+
+    #endif
+
+#endif
+
+#endif // CGAL_VERSION_CHECKER_H
diff --git a/Installation/include/CGAL/version_enforcer.h b/Installation/include/CGAL/version_enforcer.h
deleted file mode 100644
index c5c1181cee4f..000000000000
--- a/Installation/include/CGAL/version_enforcer.h
+++ /dev/null
@@ -1,41 +0,0 @@
-// Copyright (c) 2023 GeometryFactory.
-// All rights reserved.
-//
-// This file is part of CGAL (www.cgal.org)
-//
-// $URL$
-// $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
-//
-// Author(s)     : -
-
-#ifndef CGAL_VERSION_ENFORCER_H
-#define CGAL_VERSION_ENFORCER_H
-
-#include <CGAL/version_macros.h>
-
-// All files including this header are meant to work with a given version of CGAL
-// When using forked headers, set the 4 following macros to the version of CGAL
-// you want to use.
-#define CGAL_AUTHORIZED_VERSION_STR CGAL_VERSION_STR
-#define CGAL_AUTHORIZED_VERSION_MAJOR CGAL_VERSION_MAJOR
-#define CGAL_AUTHORIZED_VERSION_MINOR CGAL_VERSION_MINOR
-#define CGAL_AUTHORIZED_VERSION_PATCH CGAL_VERSION_PATCH
-
-// Check that the version of CGAL used is the one expected
-#if (CGAL_VERSION_MAJOR != CGAL_AUTHORIZED_VERSION_MAJOR)
-#pragma message "You are using CGAL version: " CGAL_STR(CGAL_VERSION) "."
-#error This header is meant to be with used with CGAL "CGAL_AUTHORIZED_VERSION_STR" only."
-#endif
-
-#if (CGAL_VERSION_MINOR != CGAL_AUTHORIZED_VERSION_MINOR)
-#pragma message "You are using CGAL version: " CGAL_STR(CGAL_VERSION) "."
-#error This header is meant to be with used with CGAL "CGAL_AUTHORIZED_VERSION_STR" only.
-#endif
-
-#if (CGAL_VERSION_PATCH != CGAL_AUTHORIZED_VERSION_PATCH)
-#pragma message "You are using CGAL version: " CGAL_STR(CGAL_VERSION) "."
-#error This header is meant to be with used with CGAL "CGAL_AUTHORIZED_VERSION_STR" only."
-#endif
-
-#endif // CGAL_VERSION_ENFORCER_H

From 3ed60dc64908e65c1ae2d003585b576bd979b67a Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Fri, 23 Jun 2023 08:22:00 +0200
Subject: [PATCH 0401/1398] Examples for insert between two different 2-cells

---
 .../Generalized_map/gmap_3_insert.cpp         | 34 ++++++++++++++++++
 .../Linear_cell_complex/CMakeLists.txt        |  4 ++-
 .../linear_cell_complex_3_insert.cpp          | 35 +++++++++++++++++++
 3 files changed, 72 insertions(+), 1 deletion(-)
 create mode 100644 Generalized_map/examples/Generalized_map/gmap_3_insert.cpp
 create mode 100644 Linear_cell_complex/examples/Linear_cell_complex/linear_cell_complex_3_insert.cpp

diff --git a/Generalized_map/examples/Generalized_map/gmap_3_insert.cpp b/Generalized_map/examples/Generalized_map/gmap_3_insert.cpp
new file mode 100644
index 000000000000..56c4a5cbd2f8
--- /dev/null
+++ b/Generalized_map/examples/Generalized_map/gmap_3_insert.cpp
@@ -0,0 +1,34 @@
+#include <CGAL/Generalized_map.h>
+#include <iostream>
+#include <cstdlib>
+#include <cassert>
+
+typedef CGAL::Generalized_map<3> GMap_3;
+typedef GMap_3::Dart_descriptor  Dart_descriptor;
+
+int main()
+{
+  GMap_3 gm;
+
+  // Create one combinatorial hexahedron
+  Dart_descriptor d1 = gm.make_combinatorial_hexahedron();
+
+  // Create one square face
+  Dart_descriptor d2=gm.make_combinatorial_polygon(4);
+
+  assert(gm.is_insertable_cell_1_between_two_cells_2(d1,d2));
+
+  // Insert the square face as a hole of the face of the hexahedron containing d1
+  gm.insert_cell_1_between_two_cells_2(d1, d2);
+
+  // Display the combinatorial map characteristics.
+  gm.display_characteristics(std::cout)<<", valid="
+                                       <<gm.is_valid()<<std::endl;
+
+  std::size_t nb=0;
+  for(Dart_descriptor dh=gm.darts().begin(); dh!=gm.darts().end(); ++dh)
+  { if (gm.is_free<2>(dh)) ++nb; }
+  std::cout<<"Number of 2-free darts: "<<nb<<std::endl;
+
+  return EXIT_SUCCESS;
+}
diff --git a/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt b/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt
index d0ed1c3a028c..871ba893bfdd 100644
--- a/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt
+++ b/Linear_cell_complex/examples/Linear_cell_complex/CMakeLists.txt
@@ -17,11 +17,12 @@ create_single_source_cgal_program("gmap_linear_cell_complex_3.cpp")
 create_single_source_cgal_program("linear_cell_complex_3.cpp")
 create_single_source_cgal_program(
   "linear_cell_complex_3_attributes_management.cpp")
+create_single_source_cgal_program("linear_cell_complex_3_incremental_builder.cpp")
+create_single_source_cgal_program("linear_cell_complex_3_insert.cpp")
 create_single_source_cgal_program("linear_cell_complex_3_operations.cpp")
 create_single_source_cgal_program(
   "linear_cell_complex_3_with_colored_vertices.cpp")
 create_single_source_cgal_program("linear_cell_complex_3_with_mypoint.cpp")
-create_single_source_cgal_program("linear_cell_complex_3_incremental_builder.cpp")
 create_single_source_cgal_program("linear_cell_complex_4.cpp")
 create_single_source_cgal_program("plane_graph_to_lcc_2.cpp")
 create_single_source_cgal_program("voronoi_2.cpp")
@@ -31,4 +32,5 @@ create_single_source_cgal_program("draw_linear_cell_complex.cpp")
 if(CGAL_Qt5_FOUND)
   target_link_libraries(draw_linear_cell_complex PUBLIC CGAL::CGAL_Basic_viewer)
   target_link_libraries(linear_cell_complex_3_incremental_builder PUBLIC CGAL::CGAL_Basic_viewer)
+  target_link_libraries(linear_cell_complex_3_insert PUBLIC CGAL::CGAL_Basic_viewer)
 endif()
diff --git a/Linear_cell_complex/examples/Linear_cell_complex/linear_cell_complex_3_insert.cpp b/Linear_cell_complex/examples/Linear_cell_complex/linear_cell_complex_3_insert.cpp
new file mode 100644
index 000000000000..686ca8ce03a3
--- /dev/null
+++ b/Linear_cell_complex/examples/Linear_cell_complex/linear_cell_complex_3_insert.cpp
@@ -0,0 +1,35 @@
+#include <CGAL/Linear_cell_complex_for_combinatorial_map.h>
+#include <CGAL/Linear_cell_complex_for_generalized_map.h>
+#include <CGAL/draw_linear_cell_complex.h>
+
+typedef CGAL::Linear_cell_complex_for_combinatorial_map<3> LCC1;
+typedef CGAL::Linear_cell_complex_for_generalized_map<3> LCC2;
+
+template<typename LCC>
+void test()
+{
+  LCC lcc;
+  using Point=typename LCC::Point;
+
+  typename LCC::Dart_descriptor d1=
+    lcc.make_hexahedron(Point(0,0,0), Point(5,0,0),
+                        Point(5,5,0), Point(0,5,0),
+                        Point(0,5,4), Point(0,0,4),
+                        Point(5,0,4), Point(5,5,4));
+  typename LCC::Dart_descriptor d2=
+    lcc.make_quadrangle(Point(5,2,2), Point(5,1,2),
+                        Point(5,1,1), Point(5,2,1));
+
+  lcc.insert_cell_1_between_two_cells_2
+    (lcc.template opposite<2>(lcc.next(lcc.next(d1))),
+     lcc.next(lcc.next(d2)));
+
+  CGAL::draw(lcc);
+}
+
+int main()
+{
+  test<LCC1>();
+  test<LCC2>();
+  return EXIT_SUCCESS;
+}

From edc11a8bc002d47f1d57da3cfe313bb9817b6af0 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Fri, 23 Jun 2023 08:43:36 +0200
Subject: [PATCH 0402/1398] Example of insert edge between two different
 2-cells, for cmap, gmap and lcc

---
 .../Combinatorial_map/Combinatorial_map.txt   |   6 ++++--
 .../doc/Generalized_map/Generalized_map.txt   |  20 ++++++++++++++++++
 .../doc/Generalized_map/examples.txt          |   1 +
 .../Linear_cell_complex.txt                   |  11 +++++++++-
 .../doc/Linear_cell_complex/examples.txt      |   1 +
 .../fig/lcc_insert_example.png                | Bin 0 -> 19200 bytes
 6 files changed, 36 insertions(+), 3 deletions(-)
 create mode 100644 Linear_cell_complex/doc/Linear_cell_complex/fig/lcc_insert_example.png

diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
index 6e7960fe4b02..d1216129f48f 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
@@ -458,7 +458,7 @@ The second line is the result after the removal operations. We retrieve the orig
 Example of high level operations. Left: Initial 3D combinatorial map after the creation of the combinatorial hexahedron. Middle: Combinatorial map obtained after the two 1-cell insertions. The two 2-cells were split in two. Right: Combinatorial map obtained after the 2-cell insertion. The 3-cell was split in two.
 \cgalFigureEnd
 
-\subsection Combinatorial_mapInsertion Insert an edge between two different faces
+\subsection Combinatorial_mapInsertion Insert an Edge Between Two Different Faces
 
 \anchor ssecexempleinsertion
 
@@ -472,7 +472,9 @@ The output is:
 Number of 2-free darts: 4
 \endverbatim
 
-We can verify that there are 6 2-cells after the insertion since the squared face was inserted as a hole in one face of the hexahedron. We can also see that there are 4 2-free darts, which are the 4 darts of the squared face. Since they bound an hole, there is no face filling the hole and thus 4 darts are 2-free.
+We can verify that there are 6 2-cells after the insertion since the squared face was inserted as a hole in one face of the hexahedron. We can also see that there are 4 2-free darts, which are the darts of the squared face. Since they bound an hole, there is no face filling the hole and thus 4 darts are 2-free.
+
+See also a similar example for Linear cell complex \ref Linear_cell_complexInsert "Insert an Edge Between Two Different Faces".
 
 \subsection Combinatorial_mapA4DGenericMap A 4D Combinatorial Map
 
diff --git a/Generalized_map/doc/Generalized_map/Generalized_map.txt b/Generalized_map/doc/Generalized_map/Generalized_map.txt
index 491a8c9ed3d3..39aa3e1b2e0d 100644
--- a/Generalized_map/doc/Generalized_map/Generalized_map.txt
+++ b/Generalized_map/doc/Generalized_map/Generalized_map.txt
@@ -399,6 +399,8 @@ Example of \link GenericMap::insert_cell_1_in_cell_2 `insert_cell_1_in_cell_2`\e
 
 `gm.`\link GenericMap::insert_dangling_cell_1_in_cell_2 `insert_dangling_cell_1_in_cell_2(d0)`\endlink adds a 1-cell in the 2-cell containing dart `d0`, the 1-cell being attached by only one of its vertex to the 0-cell containing dart `d0`.  This operation is possible if `d0` \f$ \in \f$ \link GenericMap::darts `gm.darts()`\endlink.
 
+`gm.`\link GenericMap::insert_cell_1_between_two_cells_2 `insert_cell_1_between_two_cells_2(d1,d2)`\endlink adds a 1-cell between the two faces containing containing darts `d1` and `d2`, between the two 0-cells containing darts `d1` and `d2`. The 2-cells are merged in one. This operation is possible if <I>d1</I>\f$ \not \in \f$ \f$ \langle{}\f$\f$ \alpha_0, \alpha_1\f$\f$ \rangle{}\f$(<I>d2</I>) which can be tested thanks to `gm.`\link GenericMap::is_insertable_cell_1_between_two_cells_2 `is_insertable_cell_1_between_two_cells_2(d1,d2)`\endlink.
+
 `gm.`\link GenericMap::insert_cell_2_in_cell_3 `insert_cell_2_in_cell_3(itbegin,itend)`\endlink adds a 2-cell in the 3-cell containing all the darts between `itbegin` and `itend`, along the path of 1-cells containing darts in [`itbegin`,`itend`). The 3-cell is split in two. This operation is possible if all the  darts in [`itbegin`,`itend`) form a closed path inside a same 3-cell  which can be tested thanks to `gm.`\link GenericMap::is_insertable_cell_2_in_cell_3 `is_insertable_cell_2_in_cell_3(itbegin,itend)`\endlink (see example on \cgalFigureRef{fig_gmap_insert_facet}).
 
 \cgalFigureBegin{fig_gmap_insert_facet,gmap_insert_facet.svg}
@@ -478,6 +480,24 @@ The second line is the result after the removal operations. We retrieve the orig
 Example of high level operations. Left: Initial 3D generalized map after the creation of the generalized hexahedron. Middle: Generalized map obtained after the two 1-cell insertions. The two 2-cells were split in two. Right: Generalized map obtained after the 2-cell insertion. The 3-cell was split in two.
 \cgalFigureEnd
 
+\subsection Generalized_mapInsertion Insert an edge between two different faces
+
+\anchor ssecexempleinsertiongmap
+
+This example shows the use of \link GenericMap::insert_cell_1_between_two_cells_2 `insert_cell_1_between_two_cells_2`\endlink operation. First we create a combinatorial hexahedron and a face with 4 edges. This face is inserted in the face of the hexahedron containing dart d1. We display the characteristics of the generalized map and check its validity. Then we count and display the number of 2-free darts.
+
+\cgalExample{Generalized_map/gmap_3_insert.cpp}
+
+The output is:
+\verbatim
+#Darts=60, #0-cells=12, #1-cells=17, #2-cells=6, #3-cells=1, #ccs=1, orientable=true, valid=1
+Number of 2-free darts: 8
+\endverbatim
+
+We can verify that there are 6 2-cells after the insertion since the squared face was inserted as a hole in one face of the hexahedron. We can also see that there are 8 2-free darts, which are the darts of the squared face. Since they bound an hole, there is no face filling the hole and thus 8 darts are 2-free.
+
+See also a similar example for Linear cell complex \ref Linear_cell_complexInsert "Insert an Edge Between Two Different Faces".
+
 \subsection Generalized_mapA4DGeneralizedMap A 4D Generalized Map
 
 In this example, a 4-dimensional generalized map is used. Two tetrahedral cells are created and sewn by \f$ \alpha_4\f$. Then the numbers of cells of the generalized map are displayed, and its validity is checked.
diff --git a/Generalized_map/doc/Generalized_map/examples.txt b/Generalized_map/doc/Generalized_map/examples.txt
index c38131ac9fbc..1ea597a39759 100644
--- a/Generalized_map/doc/Generalized_map/examples.txt
+++ b/Generalized_map/doc/Generalized_map/examples.txt
@@ -7,4 +7,5 @@
 \example Generalized_map/gmap_3_with_colored_facets.cpp
 \example Generalized_map/gmap_3_dynamic_onmerge.cpp
 \example Generalized_map/gmap_3_index.cpp
+\example Generalized_map/gmap_3_insert.cpp
 */
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Linear_cell_complex.txt b/Linear_cell_complex/doc/Linear_cell_complex/Linear_cell_complex.txt
index 6eae9275a757..0cb7753c302a 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/Linear_cell_complex.txt
+++ b/Linear_cell_complex/doc/Linear_cell_complex/Linear_cell_complex.txt
@@ -76,7 +76,7 @@ The class `Linear_cell_complex_min_items<d>` is a model of `LinearCellComplexIte
 
 \section Linear_cell_complexOperations Operations
 
-Several operations defined in the combinatorial maps or generalized maps package can be used on a linear cell complex. This is the case for all the iteration operations that do not modify the model (see example in Section \ref ssec3Dlcc "A 3D Linear Cell Complex"). This is also the case for all the operations that do not create new 0-cells: `sew`, `unsew`, \link GenericMap::remove_cell `remove_cell`\endlink,  \link GenericMap::insert_cell_1_in_cell_2 `insert_cell_1_in_cell_2`\endlink or \link GenericMap::insert_cell_2_in_cell_3 `insert_cell_2_in_cell_3`\endlink. Indeed, all these operations update non `void` attributes, and thus update vertex attributes of a linear cell complex. Note that some existing 0-attributes can be duplicated by the `unsew` method, but these 0-attributes are not new but copies of existing old 0-attributes.
+Several operations defined in the combinatorial maps or generalized maps package can be used on a linear cell complex. This is the case for all the iteration operations that do not modify the model (see example in Section \ref ssec3Dlcc "A 3D Linear Cell Complex"). This is also the case for all the operations that do not create new 0-cells: `sew`, `unsew`, \link GenericMap::remove_cell `remove_cell`\endlink,  \link GenericMap::insert_cell_1_in_cell_2 `insert_cell_1_in_cell_2`\endlink, \link GenericMap::insert_cell_1_between_two_cells_2 `insert_cell_1_between_two_cells_2`\endlink or \link GenericMap::insert_cell_2_in_cell_3 `insert_cell_2_in_cell_3`\endlink. Indeed, all these operations update non `void` attributes, and thus update vertex attributes of a linear cell complex. Note that some existing 0-attributes can be duplicated by the `unsew` method, but these 0-attributes are not new but copies of existing old 0-attributes.
 
 However, operations that create a new 0-cell can not be directly used since the new 0-cell would not be associated with a vertex attribute. Indeed, it is not possible for these operations to automatically decide which point to create. These operations are: \link GenericMap::insert_cell_0_in_cell_1 `insert_cell_0_in_cell_1`\endlink, \link GenericMap::insert_cell_0_in_cell_2 `insert_cell_0_in_cell_2`\endlink, \link GenericMap::insert_dangling_cell_1_in_cell_2 `insert_dangling_cell_1_in_cell_2`\endlink, plus all the creation operations. For these operations, new versions are proposed taking some points as additional parameters. Lastly, some new operations are defined, which use the geometry (see sections \ref ssecconstructionsop "Construction Operations" and \ref ssecmodifop "Modification Operations").
 
@@ -278,6 +278,15 @@ The following example shows the incremental builder.
 
 \cgalExample{Linear_cell_complex/linear_cell_complex_3_incremental_builder.cpp}
 
+\subsection Linear_cell_complexInsert Insert an Edge Between Two Different Faces
+
+The following example shows the use of \link GenericMap::insert_cell_1_between_two_cells_2 `insert_cell_1_between_two_cells_2`\endlink operation that inserts an edge between two different faces, thus creating an hole in the first face.
+
+\cgalExample{Linear_cell_complex/linear_cell_complex_3_insert.cpp}
+
+\cgalFigureBegin{fig_lcc_insert,lcc_insert_example.png}
+Result of the run of the linear_cell_complex_3_insert program. A window shows the 3D cube where one face has a hole.
+\cgalFigureEnd
 
 \section Linear_cell_complexDesign Design and Implementation History
 
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/examples.txt b/Linear_cell_complex/doc/Linear_cell_complex/examples.txt
index 4f178f666d19..def1f1a28fee 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/examples.txt
+++ b/Linear_cell_complex/doc/Linear_cell_complex/examples.txt
@@ -5,4 +5,5 @@
 \example Linear_cell_complex/linear_cell_complex_3_attributes_management.cpp
 \example Linear_cell_complex/linear_cell_complex_3_incremental_builder.cpp
 \example Linear_cell_complex/draw_linear_cell_complex.cpp
+\example Linear_cell_complex/linear_cell_complex_3_insert.cpp
 */
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/fig/lcc_insert_example.png b/Linear_cell_complex/doc/Linear_cell_complex/fig/lcc_insert_example.png
new file mode 100644
index 0000000000000000000000000000000000000000..959598345aaa333b01be13f721ce70577bf7e52a
GIT binary patch
literal 19200
zcmagGbyQT}7dAfR&<r60A7X|OP!N!ih9QKZ8v$t$0THCThLVtBP*9MR?(P&M6{L|y
zK)So%JAU84-t}ASw^Wv%d+#|rp8f2-&pFF?n(B(AMD#=;5Qr3^B(DtuVH1ErSQiBN
zz{tvUw=D3FP&+v}O@y2r)Y--9rQK^A5QsD0KVDL)Q<FMOL&rhkAsG$z+g{C7?#L(+
z`+HHEurZ<%u}{s%imygc+4UksrFh^#nj*5tgN<VKL?Mghkwwu7S<xT7%(P!oEF%Z5
zMD|iU{m-yuTYd-@S&{s5n^EPUvJ|dk2{#*l7f{G4`=lzy5TV@R=|9KXe%2&1bl7&b
zwyAYQgM-a-Kq8=;;+5)UKPoJ;N2O?p(0@1dPEpMsbsoPJ)#LOf`Z2MDfc?u6*Dfu~
zim7hp|Ekah6dII0x@viTu&s)I@8~N1(#n_V*J1I^t<7ETg)p{?AO$5zW=0h02Mbp9
zCiSQ=!Bh^vYh<YzOOk9UDWA)auh^uOTi`q7LRAeB)v~EJ8&;?(!<rQ>!5(&O^0FVZ
zxcV|KffSB`&wyD0&S-k}q><4!!TKEj<5J_~O7M$a5ROLp>;6*eY)T@$#haK`F7WXj
z_FU2YZ1S3jKj?{I(HN<-GeHbBm+#NDIg=gNt21@i0BP{0i=U=T79-#md`lHYdC(o^
zS4K--0x&}8tYqj40zGEM{K4|dk@f%v!EOjO1@IdFeSB)c_c8M7z!06A!gDt{Cr3w{
zH*O#~7aI#V8*8Yio!cv@B0^2mAeihv2m}Qo<l(wr(>tl&ZYJaYdu?m>`)tOQt5`#-
z7S-OLI)tAKW1(dcN+S<=_H0^YQmWOI<V?dKz(f$E9u?@PD<z7JrmqkQ)RYY9Nqps8
zVJz$l0%2OYPyAC*QFDBaO6vi1Nz(!|n%iW~b(e1U^UzvVV)-vg+w`I$-=W(td$&9O
z+<KOMOhw&ySKdE%)&Q|JV-NOSsrLD2(yw-Y?6lTNyxvkELSYcPHaJs8KpPh~Q|mOo
z{-q@<_?{*$1Q!Gfy2Q;)gnSZ{?|3e?k}=U1V1va4yiV|d*fa;4&!_9YYr2{-ab_xy
z#SaYUYf#U2wIiq{RAj#@ik4Gh@k$qcWPuU_k8W4mxg^V}a0Nytlj#wmLc0|Q3kC$T
zJfhBMtUTTZHX<c#5J*O(FF1ig<Xtca;#KwUsWOu1=m#pvFuTU=2Z*0&<;Ql|A;46S
z7m#Odyejk`+~l>(vT@L4lMwu67Q%akA*(uM%B*+l@q%|T0)x*z=G-T5mR6I@0_KYi
ztEO|+Q^jgBGc$wR9sw&=laP{<GK#sa|4NheJ-yqum7Y0_b@E$Q9FjQtp@a57Y%*`0
z4@jYLRamQNl>yxacNg$D()|ua{}X<Fek{87#kH1g;FHA#?G4~-P*zW6@xfg(k8!QU
zNiezJVi9li{<jGVEzUS9ygKU+C2gereb&U+txjmSYYyp)KIyijL2;)S_0CJ*TpC`(
z@PH}$EMwyNyN!UMW{0wtQ<IjKmerprPdyQv|Hb1BJP`dAnjy1{*TE&psdiomA31os
z;CGZ%+ID;Cz$OI6_;7;?Z=jO?anp9C9x)B~r=!vI+han6B>jJ~`E*LE)VOu9Fm!fU
z`gs?Jl-JG4q?uI=*8vCcos!T*!&;iJkCW40d#+ka8Z&~jc}IkW(1ij=Wn@f8L-J&#
z#JDb?si2_X^CSZR?Ee@<U98P74p*6HE3A6_(PVbTOdSQnnf4DYOV}(rc<N>k`B#96
zp~iwjLTZ;2b*(4-2x47Bv-SEktv;CECr;7?4e6U>0fREr7IYFF@TTtzucfd@8ltNo
z1caJB;zxNX-!FY<;YO4gnE9XBB-&_s0`sBZ+ynOYf0G>oG&+g@YdpPSC*Oc0v<H%f
z9MqRq0UP!{-kK;8SLiHaN}AOUMMpEl1PC#E&c1c^vcm#_DhFm8Tx}iBJqT)czq+YH
znrCAQ>`u3T6JU@R{#n3wP=b`#Yu%?xp$Qi*T>0zQ$jFn}BpN`vrkLYZQekb)RqR-y
zY#AYXP%kgCY$LwuPC<I%Fl&BYDEY~iV9U`o`Bv6){%~we=ZxFg<Q?K{&n)Yav`5Kf
z(_g5aWl(5)uYF`I^N~zR>%1y;sL=+N3+O;QKtcMZ-{3f50nyX87Jd1{=IHg>a`LS~
z&B?r({j$}N-P*1x;{;pHph@AV{);Tn7p<y0>`pVP<v1<QXFnTHTA%9HCJQ-UQg1jX
z7#VdY;qVUa{K|D&znn=M8}6n$-u>@ZIVm>j11s-FX_=o|+mwyqS>@2C%AR4N5_R|X
zu-w80_~!MD)Ctq}q<KU3-vR+a-=#jIx5M{*W}>{4b@$T!?#LuZ=ZbC*iG6CD%$!Vq
z{n_cVx~yJJ<lUHwI~y=MC-c7z_p~3bzn|H>WqY|9D?Ksjk|HK``t*{w3Y!T`^u1=%
z)cEKi#i>=4M)dr0vaJ*VzlOs^ae>!%2bg&*k;nM>ATCgX8&U2G8hy^nlP@Yw3Dv6F
z^_KOVJ?3$o6%yH1XN{=d^BmfU@78huy*eP_sPkR3jw#TuE_^KONb1<efB%bJeDg(%
zWL@Ry-dtW~{EzsglcGB>Wrs2;6`csDiQF{Bz|z<<(!O5pq1_g-!kj4UdjhV{eLZ(Z
zcGD{9^QvEUXQSUUO_v#@2R<)*?Q7a3<%X1U+l^^7%^PVZyE)K{sHw4ypD5lRwln4t
zvs(R}d^*FkIa8w-ce6{xWAwzHz-DLq@{=heT6yP@+b!46heEg#WYlCFgw6>O<>lNe
zYw3ZlZ`y7=0OGNmYjj6vFI@k9I$dsoEN$E@^jVd8%oQ@eURk9?0rmIzRn&94>H%oZ
zsb*OG{;X9a=}Uu52`SF>Rnz?%ojm)}Rg3?wp38!-e(rzVczUO7%=Yo6Y4P2uXJD~T
zF_UA{-okN$nRG#^zoKBljeJS{igJs?4q@_3#KX2s#l1%3wt&CvEsa+}WTZlNm*46(
zhi*4b#2SXzj(ABuoh7fxVrIMM*4rn{HZwiBCv&QJ?AGr&Hm}j0q%8HkKi$?Ti=QsR
zlJq=#dfcg2X7A+G7M^S*xYy-+d@Ai%r_b|=?W5Un_sp#xd26*wlkcTl{cJJak;X(r
z(u;ye`j1CGB&Q$ax2%#+Y&F)DRKDLG&2<V?sFU=N(U7b)Q5-bMeA&QYY_sEgn0MI`
z7x>k&$wz2xHmi1daQsT@P>Lu05FOyZ##`;3VKPDY=y;y$KQ>oQ6Y^Vm>DzHDpMzMb
z&s;lVOC`*|6w5>!WJ7b)Dzpb|B?=>aOeen@H@SaDFGozq@wR1^7@Liwl#_jTFT^Ue
zMzm6vKlmQc@&;xzJNYS#`-Tg;4<d{XPNjb}8Ssu+pKLx|I1gz(8`G*WyX5k}@aO3B
zS-yX17U-K~YH|zrU+rA8>(7ihA%A*Z72s=KJAb;-HsKq$=lW)7=n9u;DD1u|C!+D@
zbcP)f8yk!Hi~G2q0V7qo*eK385f(jTXgf~;NNJFq>{>rn<GBC%PqEd0@~s<(X~p>r
zo@5`NCK|*O$<)#r5oYtL)V!LSq8!7@>0Af&WzCM_(~Z5onVhfozp}a1#E!eGE>9T6
ztB)4*P6`&xin|ZDd@5awY8eyhIW#7Z|6-jaJ#cu|cX!16H`0gvSmmMJvl+LOlkHz+
z%u|`s^S<c!60YfDW;_lq4n_T7AGho>1OI3Cb@Y0h3tw*(Q^rPw5y+OS<IT~tttMZN
zt@@L_5$!62nRG98lZYIEKgKLi9PS1=+=fbc3!C=Jjt^AU2K;qfi#w2#V$NPl=$s7!
zW5v?~|7~{vl;azxyB8W{g84S5en0JYC+BYz$6q<H<M?cF1eT=)%;#Wz9Fwp~P6nS9
zEF|meiR2*i>`p|hsxJ(DkN<v+E8I%$+3I>`mw%-td1++$kY}v_D5<}7PqNt2b3Xgd
zckeN&Q0*&y<Ah7oK>f48vwJ7P{-(@gPT}g}Rt5BF0r0D)rg1CvvFxO}t?|m?_)^Ac
z?_-J7<Nkq7DNAcLX*FAJsXrs8Mci?FR6$w@zV26@;iTy7v$ne%JvlOWf{;<AjtUsQ
zs5~jCAp5$z$mb?MUb$zZdi3RVt6|G)ovY>1T;kj9=uU%A=pU`%<CEC3jeH@UwVMsw
zV~(|&S3@{=`F97%ypzM0wqFTOHz<9<*xi}Zx`6EgpS^eNjFLwBR$Pm&0^o7qU%mO+
z>|2jN26*SC&AYXwHNQ^0++8TdnP4!vt`#_5Nj-Bo>o8^HR(UA2&J%cCcR9_>INmXj
zq!%gIs|(yQJK0X*UH^XbOvSh-ZMiWnz;I8}LT2V}=fT`@^qZFbXy4=QY4TT}mqos7
zNj5F{_`7vZaeaNO9#Pu39ZCVu_uu~R@3i?7&RTRqZF14qHrDu={c|SlGd@C*<9bsv
zZk^-I!$D@W=DJX0Q*P_816s8B_G`lHP3~m3k<E|EXYE5Z4tx5Nl{Y402f8Y}j^4UX
zi9AB7)kcr*PoK5Eyz9I?Gi%Gu?4~-|9SW39`swtmbui_`^S`tSCvj$jp@#bfJI4am
z<;Nk7fpu~wI1XdYJ2s^BeGF5jJ5Ee`Gb+4WGQUTvb&@thk>p!6b*C#k{@4&!DkPSG
z6nx*F7R2TC$hc=7m7C`1$9LQ`T+}7t-tk*t9BQ}Qf8;*WCiRu$vgzc|!KUQ-iyI32
z*RKg~XMeyLC3F*u5y_3_HG^hv%hCeY3FkZwzLH5w=jT#Q+Rbg?_#8Y&;DFs<DQVla
zr8Qm&-z?s)ReQF_)GY921jAFl8tS<JQMkVz>f2PaV_w(jnN;%{-goeU&wWt)XS&wN
zucaHG<r;sn>MOYaUK7W<0CR)PPVQ-i%F)o+VZ+(_$z<9%quFf;lWE1Xr0aQhqY887
zldZWH6JBz9Lmu0WETJQzKD4#k1U1;(?zvy^V~HiEn^#v-lBd1GEo-<cDa><4l|qKL
z9>rs?BLt>?4JM7bclCZ^Y}|5^E^X?T)Ss?0_8riknYA(Un2j5+*|OPLpDzf%e`T%q
zx$tjincdatTyn#W-p7(YvDM;)@%p2?hB^))7C?Fv3^8Q<F=Yq>et3RXMK}VKjn=+m
zs7d19q4QCjsoj~}8%ozZ$vvr5OHRLY9{W`$ck`_Bfy3qpF0q>|V)xnH^sVpUr-%u`
zlKNL4|EkVq^(9*ON4T$-Yu#0OZq}Mf6d`pq#u`1%vJ*J=#&D#Y4S1OfELcfnJ2|ke
ztov)yypf5mH>{mP1Wz^teUNXipXHrO+ypUs`+t1w^K*6TC&!j#`sIhe3rECrXTNl&
zD=s*u56-C?|0JXji{DrO@bz$il#xTHM#HnJ#(rnx^7nfVx5a~n^`&JMpXNMnhi;-0
z@up{3tG#cF|0;;B{aL-|&NWe;AXvrLXOyuz@OOQ!Y<r?sjl6%_WaJ>}F3l+L#L4Hj
zz<2C=Bty`yVNlFHs=8CoSI#dyRjG43xVkUc<Y&h#HQ7}3;`G^57F<*VDAV!tpwxkS
zOSz-w%<gS&z^`jl6PLf(YEBY`NGFf2?`faKoEjn=2aPz(ge*v-)qkOLfBKZ}*-0Ls
zOQrhEyX|<NQ?z)E^(I$7SNZ$#oBypXkM7q?_i{6IvXGrNf;3v(ZP<8soIH*BgOEec
zypMi#aR;Ik&o|fXCL&_&syk)#sdgt?@A9UuRCh}=I<3tiJE63ioRm=r9bSF*j$=%S
z%`jnYquwK~EkZPF{>ER-GF<#XyI?zDI}^ECL$ehkeO~^!{?EOe?cB2U9^RHLj<f(B
z164@q$lGYawk3+4bzkMS-<8HrhLXl=VuiQ2l@B!RYDMh~lLJl_#Li0d#(p1#-kz9c
z!*xcQ$G6<3SLg#LFQOyjT&oQfU#1q-m6_yoCAw96#$6`AEO1=Ot&1MK)kr=XFtcC#
z`x9LwWALTLXlG7(a#=$vdx73=<j~daui$`{FA5JU(xEnFS@8$0<L}Cx!oTL#4=e@}
zd5oGo93=(lUTEn3uneNs(VuL)DJgC8osG*a9aC&|iJiC}{&=~gCOuNynsn0cXf}$o
zyii_p|JC%ui=Eb=1qKccJ%rc#GZ&4ofBO3z+)mc4&X|qqEI5q}-*$=>zT{~*-!YQX
z(_3DzDfMWPsI!ra5aP3DD?+HnqKiL^-JLxiAI*7O^Tjt_{Y@gbP*ERRSE~57lf8z=
zu$V3<srs%#{6zZhO8;jHP=%8JZmGU<yITlUH#Sz@+!M`*3%%OibQg0~F5!^MzQ21}
z*t)-$7=G#NzPPVNXJt2CaDVg5@7Uxem+j2myI+&HXJtaagpD0_;$H0)+4Lo6or;dy
z*m>qae;DS}r5`==KZ^JFIj(J+NVprxLaYXmrd<cjdF^a28M0D+c1wP2+N6{cFj5kX
z)tBtn__*~IV(0DH?;^L0{;QKX@||HS&)NK;`SC2Si6FAmrw-$aZCOQ0q<eGaD-5ZU
zYfLviTQ(p6rWV)`zkK!AkfUIuz*aDyOKhiEK<MY;JQMU`X&&Lgi2J08?IRG-2n++&
z5p6d;!TXJla(Y&Llu=9!SJ4Zmt0!`uqTWYYbsM~8cPcG;%c?wS<5_>h(e%lAg^nFu
zVr$oR`8BU49G7pF1r_pI_NW?9`;Xkd6(hvNG$&SmI}PLQwWu@uM%<l%B_!*D14xz7
z$zx-J*YRI`x|@!N<IM7kCS$mn^z5~DzOsMDVw8HJe^jtHk>0k4ohsO*)goTE@q5kF
z&U~7INAiT4=abm(@@t_YM~~?K2r`w?znjO=ck;|PNF5vB3P&~VndS!j)RBzL+nedS
zGDYx!j-bOZUE^YZ+b`Q&%aWH#D?Zzqhq^z--xLBh^vK}CPSUjcFK>g}&$mYn!dn#2
z1>8;pZ$3y}zjt-FywcrpPQNUn`RTwF+x*}(uj+y^Y4ZnHXI|-qEAQ}yfQh=rgd0!b
zUEayCXW4}D-`aeO{R}cDN9~z!IrdIsPlO-p7!`kfbic6Uq1{BKjnRurL8}X*)LH93
zdr_79-2YuLHrIj|wJ1X*Xc9SrZ5F%jTs2bGg{P|LM#3T@=X=);peKXF94ABREru!J
z>62QGz>6tvQV=KE&!0b&RD6^>@9{6U^|Rj5BUaJIT|jpZ3d{WCF@*VxUM`<l7vF6(
z4A_+jV)*l<%XvE*7ihpig)$J#b2#S5zX8k^6X^dPr2KYN@;%M})X<a%^Ij&pYEUfN
zfEWbIfb#uY2-C2GpuqMjC<qGt0AV(TK>uHZC|7R7f8#4)%yLld$}dd+zU#%pd=td*
z|MQQ3(_54CZou`a@c+%gBHH`p|5>Tt%COT+itm5JS(@C4fBJ08cMQB_BDz=gkRrAj
zkR3$leBM9^Y_z}(Wgt+U*QQMq2Nin%Jw3$6k~u##SA_+-htmSD&9Zgu_K<ZFdl#r+
z<_Q{<F5Yp$l_Npf>3e#-uLAZXfnm}0?XleVWF<Zui4+}igZr^?X^?qLGdVAm0A(l2
zN1PsSN`ITLj5a(kUW=>U)4@8#0<jT*e!o4huYF3Kt|$eHQpJ*1A;7kd0z~Mq<Yu;m
zGq7lt`86+A5Z(<DUx4<19b8?1p|<eCf`cf-alg0wQt2-)EO1XV{ob=ucrhLuB$Lb@
zjEe<zG-+KshPEz6xV?irf8O_3H>v*mez}1;;TXp<DRk*6QyE?eC>uW#o_r<{ZA!NB
zY5a<nxwHI<9m-RSKm0xfw^z$2h<3%b&H1~zs#GKEl`#u*gCy3yQcVhAWt=W(PO5KX
z_BV&Bmj{E8bVVC+i-8_M^~()=VyjPB@SxXu;7GXCcWBmo$&ogzsiBSr#;Ws=nlm%S
z(o&~4>))*G5`x`K-c#EGngo&b!>7C2U#5>m!nMLF&?>}#P$44I#^Wb)2;wKKIEb8^
zZgeqr>=VF@?0PaJ5F|q`p1x&zf(1XSIF;B^gIqiHkHC*0sEqyya!ost9*W;bsDP^-
zp9Kp&R(f{1+FlS_pMaOJJktdu(EJsO#m{-E8oo^q3w?xFBra~1!cMV@#;KXMrX&af
zg{hE30QG*_!HsgD7h|wpwgrRD#r>5i-3ZOB|3Y4K;OqO%_)gD7oqG~AYP9r3ZFy1b
zY!!(X4K7EFKa+4Y6kprwPIRFB7@A$S%`<R2aMJK-Ay*~@M5juA$Y&G(0e1apT9AZQ
zGhH)|bF8r+hyZ9;0;44=kY9$Vk{i$NKAy_6XWxZraIv1CnXFp|LHxZ*v`{?6yO0@Y
z`6){a4#IA2*h8iQc+iId`1B@8R)Eyo-Gr3@*!cZ(`^P_~L-@pwR<@{$Q;$x}uYMNX
z$CLIySU;s|3&O=Z{7OWpK{E2?$qLkt)6EFtp^b{2ubNkHow$8dAg33l30Ve$AZ!C3
z<BlJRWeKrU{6XErJrH4|h6)W~rvPv%C>q%aqTpAGrA5&|@wlik(w`nLUc}_$+kJdj
z&(5~8W;j(1W#TILV0x+@XkOjAH!-EJg$uma;Re&NM4kFqa^tJM#Rb+`-oUa%sq-rp
zwnBOB;4Yq+!3^^PU{I95cZ^R~Y7`rv1_Td^$pO0$T63ymu~=$0S7+ST7N_=XJl%P^
zc58|a_`Gxly46V-33q<W$`h%`2Lhm*_!tTxTfGZfq8(%n(9mZU@)5x=n#W5K+);3P
zv6F3{$gV|fD1e1A5WfsbR5H!jn}KOjr|esh9zcNFpP61qE0O$Jucts-Mq@cJ15=<%
zLo*@n_=eB<`J*jSJ=GcW9-le^a<hISsWj@0y~T`6RV$H=XO}=cf-M6H8iR(61)Y#X
zkd`VPuWqn_3Fwr`^93;2eU%VWaoSDJ!}kODd_|rNKpTilsZ<i+k3YlV1UfjmqAd6d
z_i&^g<1q^tD3eDCe+i-mFs%|?<66pOe+T~i7<k~VL>e_U%pvlVg1^_>C?o27{4b1E
z**D;c5mZEcKZm0>pBpAcz0So0)<MzpeL-3BLwS_U#8>bEtJ#kr?*l7mm|LQDt22C}
zSVw@jve{(v_t>6~i2)BpEFrDt&&Ah7XgF_u7AXd`fRC^@unOSVmgZGvkH14T>b%u0
zZ*b5!z@mhr&yQu_>mW%;IiUDqD#Tv`x;EbdA55QMVX)G5aScIEWw)O|*0F#XE<A>+
zrFy>KB4IHb2)YdA&c?eZy_?pFjR1JP0B)g!-v#Y?hYaM}$8H3KV*A9D&4t%{@H$*~
zg07rTJKKe^+#C4-us}9GhQOl4jzdSWF>XUKVcb59al3inW?D(a^j(KeB9M$^u(Xk1
z$N<qI;q7ZHZV3+ru^_mSFiEfYF=(Mxwo5;YCCY;fU~p)jOS`jdH3ox|)iRIizR6FV
z%{{d0r37GTEy(h1hfZCF<jE(IE+`(=7I{5_3ecwVI4JA8TO>U3RK@6FB@g~TYp-zG
zV0=B59kc=fQi)p<Dx?&_0L9P78x#xrpX@+@Y35hAqsQk;)pqWl3l&gs0ZLFRkw3@5
z0ziqT!MQWU>i;(z3ShLQwgsI>c=L?`$H0V<oWO*f`u6R*J=~GOCTBy`ih%GBM1jFX
zT5EpC-mkP?4n3{6K?E2@O{s{`^j-V_h*k_pibJJbX)#_<@+nUpgSujLRpTefV|+7$
ziwSUx-p@)<{0j(@goG7^k(5q_yi)8M62YJu6iF+;F!=lii}L?UW&K!4hUA+DF?Ww!
zyB$8xCNM1jg^Aj$(8^vLhejz%kz_<9MpMz47Kk+&dsNsMlo%7Kwcpzp2>`E*ZNTAq
zVlM+ku=pd}<l;1ligyjC$8O_FQ`_JafW`M$gT^wvQvJxXS=KBU*+pe=fI-fW!DG;h
zHC^0HC_h2l|D={rW0D^aP5`VF37^{W>LdOIfD(wo(E_Zn=*ZxnmL^*}*YB6$aTfEZ
z4F??^ilRS(LL*=lM;k{QDX6TF)&-r_qf)c}4<`h)c-5s~A4JPm@3d`+THSc>p~FxC
z#8tb2PdRc78n2$RgxdveuKl0y4?|(ATyjg=K*E@@G+%f>E~%3;<8%;DkU<FOx4r?7
z52vP8SBlkz;-}TEJWvA$`&Xd@1@L)FP#1KbOtJtEt*WN5`0okzr3|oeSD@;n(zP${
z`~;wIz@B62OelJ5jR#R5=vNRVAvMb-w;)ywPE^Q%`2P&3Y^O>bleZU-56I~0gBpk7
z0n%hlS<1KoUt9ADMK(BUBainYXhY`{>*z>68kg)f>2*UX0a1P)L&0)H`u%C-mKoN>
zkRwiftDWa_j?=RN(Yy*WctAafu}|oCXx|t#?#!rMA_sdgj@}J`)P4dW6^g#A+$=Yo
zs`BY-e2O4o&|WM6OhL5g+jk9^$bj_qMZoa7p!T9NBv}+B|L}FLPHxH~6xo6^cr^CC
zc!JK_n52-Hx+Nc!3`pDM^NmG_^Ce(}Y%czN@z+5Q0r*LcB0rFESyw_TpwVnF{C82o
z#^b?9YRQ@yvWrCkgwdgmES{vZwlcJ7`|m4&tDuPEAXwOnm?L0_b~9sr&myKbZ8?R=
zGhrka0HA7itbkfxRhVTr#%)47^*pgF5=blsz^E@qal)w&d8rT>UUAv^6j=x4HxyDg
z7hg*{sW}H<fnL3LW~Bdi`al@jF;nsd1PQftkh`p97lHzTAW@@Z7`SMIkE0FfQlASZ
z;X=``D3FYl2fDlqZc|VHXQKiQ(g&}HP_mcWNLdn&6?aM8`-J9EtUxYGW#Y>Qf+PY+
zN&Cr!B7t!<fc9@6VD-Xl&)%_P0_~M;{q17PW5yOwLYey@IH$GGzRRWjH|1ehu548R
zC3+;y?uXrL`u|9l5Fi63TZ}CgNs0*>n+|4IzXItpXy`b|2k<KG`=o~VlK;t3zDaF;
zJ8Qpfn}W~0oJ~l8?E*0X)8;T>+)E9x#V(ys{Y?tf5$Gi!AWnQ*JFRwaZV;dtKY#vs
zgRc&LH9$ur$f;Gp<bQGjvt9q$HNpAzc?+-siXmH_tp1~bOAxJ>3e|NX$OjnQfWJ5a
zcsm=v;6AdtH|)-%aErWo$XtdPaLr2TL_E$45V-ms`vOSdL>o8w7+^JXrGJE|!n9dK
zsC*9#4i%LFz)zV3xbL;-zP_6I<||SVyw}c0rUl-bfZrAf)<#N129Hb1#Z?E6%6Y!|
z7p$6P4AwRCK|p*U|3r3N8Z-e1lmEL5aPDEx0S*uk1dtudvLP!m^CTN}EtQQ=;ofUV
zi*`=y&{V;<x9hrWHMSuEGLo$ND9%a--xIh!YGe#5%U^EqesL;&B!<M|0R&#jXmu3O
zbJ9G9g>k#@M+V>LFK^7<ivPW!D{}vW6ChqZCGy5U8z5H`r*@RAuntmUobGvRGN~Z4
z;~+2|PX?ky%hF_NqXc6tfPWc^8-qUSDBo<^x5dYS5@dtZfTf{TE*PTlQYX9iyj=&V
zl?_bsr9A&><TY(JJ{M)Q_4ka*+l*E^5)2Nq!Tm4!Ee~j<rkjt+8JUg8{W%KYrjzpd
zRfbLiwDy70r+2-;6ut0b7eJiQz0favNr~?zLxe3`?&0(S6F{DU-!o*3*(p7H@tm7$
zOj!1n@GKn(XrAkU(pprKGlbzeg%k7fMTBe2cxoz)nWJC~`p&;onUO`AwAg%yWRm$>
zM_z!I)*M8Mi$=D)XlDB$t!=rAcQKvPdqOl{-sOi@>!$^9eQlga&1>IC03L(N_{i{E
z3a_*`9ML|0#*i4S#>m(c5U{t*p;tE|IdikpX03r;07o0#T--zU?|z{p!6cK^CnxxQ
z{qi3fyw-sFdp2%jj!6dkX%6*;_IyUPn2rRaW`i2};bX99b57OjSmw}hEYIZnd{3wM
zP(30vMTSJB%TyaFuY=RKX-`)wO)&PZi36OEu_1mhoZkAI@{oA1F%ka&QhuBGTI`MK
zp?VLGzWZJFFH1=CK-~qQ04)%c${5k-SK2qz68g{5p1%9EAqTBA4gK_m7WZ?<;w=H@
zB^fdla>e>v|C#TYKWC>QRG4Q&Dc4Fvl`KR$4k|#aI;RMfB9&Rh6z-aCr*<ghf5xT5
z0Qe+LYSt8?waiy<+@kUX1H3Y)Itj;9J-q~INr1qTH66i;qM+JYXWdfbHk_++<-mg%
z6pJevQdnVIF6w5i0|>(8?LI6Q6kIfjR_wHE1-j8z=Ih^a&cj6K7gEPm|4n-UC^st~
zfD<dFt+jgiCHAD6hr5o=-9BZ$0zCG?uu_`6AXsl<23DPu+`<mJeaVM{fe2+gO0$6@
z`FMa=Z~|jWD1R5|{&X%!`!S90d}_4ioAMvRc=bs#lba$G{6jbL^%clPW(PjY!uWUL
zi4P_|>;|?24}Wd=0w&7EdWG$UgoPKU(YkVh?OI%|{9QDovq%MsfxPt+q0xR8*is;8
z6i&50Q_$Q^?tqW{)B!Zn7wY6$XdG?)p{wUwOyH<b^j@%a$E3}MEmlwnN<q{-S2k)j
zqx<rbgcph*PxIt5r318hFPyg0B}AUga#m{IvMY;3;QT++-e`t;a+R0~=9s<C&zOm`
z!CXmzVYejlf#Ns#PQKm$Q8*n4zR32DfvrOF1pjvuQWeNa@tM99mOSp}pRlgKLF6_^
zkj(?|e%ps^Y+!HZm-&*-kPebC`4wofA=&Uxa}X5X+c~cDW)-Sd0EdX~2atr{S0a6J
zR#<Thrxu`vV62tIWUWP(|1^jVcu660$<ohp&3!S$CHlm_uAkNo%f1sLmy1Sn?)e8X
zgnGw7H{hlbbcGT3ztL*v=f#m(aY93U`Dmrdz0*51TQn&x0Zr(D(h~Fzpx2E0g5Y~l
zQ9gHFHekD^7t3X_wdG^tS}1K-5`DG;N%%}<WA6JRX+AQ8yBgwqbGCeZo>(Ekdi3gv
zy>Oyc==nBbQIn+eTg&-yy6}kmWT9u?gnr~<f;sr6(}is+dGZuW82O>#1GCJYiYF|6
z@Jg0cJpTMV*Q6~Xu=+wKI0$OJ6WW8V)bIi6GlG-9wwFjQ8fk@(1Nf@(ID>!~%GEMs
z%PBfFHk>)0+Sy5Bm>6r`N&H=jG<=J^H7EJ0*?uw}9}*};&;T8(xj=4EAxS==emVEN
z<8jIy&s&VKF>%&w=o7@iR_p&m;NCZS)8}))y^9&^PVEWhYgb?!urM|U((NSu_xAWW
z*jWGK0)ogxm0ETgQKGCb7yZ35UlqX1aiO!Kq?`bC5axl!1s;GEzI4-?azONb%7M=I
zm)P!c9{G1w(!x#hO-h0*I+ARlw}OIu;qV0Hb{_djFMLoN=S)nYCl&jrc{|X|Dj|8G
zU<DLXLfx^L!ylz<<%N;NdT)Ncg1GE}_Mg-NfYkEWFAkF!LPeWVgU2v(IU<V|X4Ri0
z?ILfOUkC#U7mXzGIQ{;m`}q{PLa+|b+9l5NVObRc#w4M|*}(dlE6~{Q?-1IOzL>8M
z2=Os9|I3>|=0qVI8+|xZomEINMbsa4a+*DPGNK3ISx?wQQBD-?Cum<VVH&YH#!Zin
zWXNQ9URMgm@|$%Mx45?!Uwp(Va)@F|y(x)uxQ6Qdw{tf+rc2Pt2jnL^RdN*4uOCZ}
zVyR6YF#w;f!OwlRW_scENr1MN$vgS%!9Tb`#-;SnxWn(eu;L%|1s@#eAI$!fulL4~
zQnWXmAvB$S<&9Tnxr=7tfACGnw}E>=q4jA5aP^Rjj1MY&1!^on-MvYkwY?eZa2f<O
z!!j;G4A~N*y*fUSz@9I0W9^@yPZpi<<w|;l%S?Q?uYlb&mrZ<J*z_^f!9}zB>Y-)~
z?Z@>`IW2VY$m~fWzBH#Q-KwH9eq@KIE>;kfS`w%*Lbf~iWfR5EtaXsn(GOCH{0Us~
zada49ob09{e1I@PEA4lBo)z+6=Y5dd{Xmxwrw!#tE{#;xxw3$PWCzp;OrlfGD<*nz
zuZ>1vc1^qf*KG5bhfkU@wZY<stgZkpuy<&$qX>2~m4Rfbk)wcSdIae=0GHnbQ#~`_
zos{UfS_UW^P>$^(81J%cCBusR>SodL-Kq#sjzI|uL@r=p?|3ATdC~F`;vq--vS=4n
z=?O(~Y2UpQFhI{DKfLm-@H^L^45&Kb;=<6!&}c>}7f83%%f9)g5^-C^X7yaR<2v-N
zlejn7M7-lApO*?QK&U`Gz)2V%xbVg60Y|HjPKn#DZ%TY$Lf>-M(ykbj&AMXWeF}1T
zQu?o#APRzp0vovC-r$I)<KO*A_M)beKWwS)-uVosy*@4Q%dU(xI+F1^AAr}CfZRuY
zGx+i9Gy9c8Hksr5xEwPkTJ8Or_Y1^cRx>*W4?!5HDzQnPGXi?c&sga8B8A{gMmpT&
zz3>v@hd{T$Q}G&`4d2u?d>9+3+A~pHI4-E4Rw8@0iN|9~Oh!}`5lc&9tt12R=7QiP
zbmt}(Rzy+2E})d`1mHK2D1jN-Y(fOn?*(4VXZZ!4T{+&odJ)1~E{KuB)Vuc#V_^ql
z(GmQ}U~B~$2ns-5#d|3!(fpb?Lzj$an~+io>mn<Sg+B=RUl!cd4q$tstB4XHQPe|G
z=b0hy4fogGo5^p|q4})cLkOuA^FP=Ks;h(jhs4{p=J+_FIG(N~|BMB%U1=|&tE!$n
zb&&X4gm|e)_N|`Ex@Cy<oN~b8hdGK<6ZapApsX&CJWa0zoU*Ir9REr&V+k6rN-y-=
z`bzRg{QH&nxd3vi$N?L^prpf~R*=8BvrAUKs#-%oDTU3s>cQT$d0_z4DG5FiHH?6S
z-?~!g8Q=r273l4Ip(_`@7lHdbzYejMm##Mb>%l+}^XGyMRdJ$3K2nHA%8@<O3EjLw
zn@Vu;2oZPCs0as7D*y)tP&=h969&UID2K~pnQQR}+)dJ1v14-;?kl~B%@8FbYAm>t
znvZ5V_OlhJq6=z#P;&0fnxM9;@@PK57K2>CUO^09kHIfD;D#onC}jNc_swLt;@kEG
z$^oiC%6W{mSn$Ya%z*ttqRzjceqsyNDnqRbQO10QIFkcF(oV-94#-{ZW`Stb*^C7E
zk&xTWpqHuhJ30~wSuql|NoKa;@E>54`kz&I!V=sS4Brn2s5!9-W%D<%irBhmC|H5u
z!8xObEx4GwtBp)Vosh@mMPZ-4i=O?LTaeXtj_emNP)Kez@E}?<W~Ci>d(ojr8z^Up
zs56;}M7zxYuMntK|529v7S&YUlmqh#1l1rVh;}MN_J;R!3aJvoQm;scP)~`#EB#yo
zZ$nmC^I3g?gE*$4g1GviYRIG=RXFoXsuao4{%IB^ai~;_cNLd7YlDqx*x!MA5Ma(I
zCNfCq<qFhcl&;}I`|w)`gV*l`Zb`Nx2m3<t)AebBB6GfLZ*q_+*STO1x5s%eTzE7*
z3rItG{QY(ttas5c-``~ur(YMeG6>iRf=6*^WMu&m<gd1yMWI$dQrxg(J!tp%pVk22
zC*F%Y?$uqhgXh^`P2VHOx0ug|=$e0;?*|auQ3EMPW&=JSL4-nX?<Fvc_IBS|)KL7S
z9H^<Q;El?bp@4*{J^*vwBL^H8>1?(}4bwQYDc_i<O2)*>xib0lE$B_Eqzh_oCBumF
zkQ4mT;B1(u;ziSkcuc@4v468m(W8t<emZ4L2=(j55bKWbV_akV-(EDtKok$7QtaNR
zOqSN%TmT0S1<^HRA$w5_K(X<{-IiB$e<pl}a=<hS5}RiQLP1xANh1qfYbsBZS;4;(
zkxPcyFYVfjOSuT$x3$#5NXle}1HgL%v`je|v77s`1ZYsm=KhX)bsiL(HE{HXMNAzF
z=2>JSfq)xK5O3XW*QRV=@&nj~g1@(<SP25a5t=CuG=H&45z<3oYRjjYK|l~foFXRH
zE!CS!TqLa-ZT2oxNB?sA?=4X;T=|qyjpE11?GNDE!Tnu-eA#M%>>#+zv-6FumtR{)
z)#**u@{v(ocIJdOD^Q!OiNw(3f#5UTb_Y7k6OWpt=PxmBAU~oL`zmhtkAYsj1;GmR
z(i&+IMvq42d?pHLd>N<04gNrZiJo$c@$T67aV53f#;|=BQuROPG<*Fr;9c9vW)dnk
z6gCtLyPF%~1)rXP$C(!Em^!A!BF=!;jv&OWO!!%%&Bp1(f7q!a+oRzZ!Xx`eQDT*x
zc>*+&gfe8`<~_L;M80GK9a@ucYpsXRY-@{=04=~+xS4Md`FCuVyrez9nP>DFDkZF7
zye_DAsa`lKLWH}>!6g+9DPx#gNU4}l;lE0u?UMx9o<NJTb<zh}Y{gu-FV=G~Vjg?d
zt<Lb{&!oUZu&QlLUZ>@ASd-&<A4PMtLU|$vfM`BHF+Pefv=4hIpH`Qawcd0LdXw38
zZn-nu6ID8q(*MxYAHjgDLh&cHKoi)MS?m6h`*PQO^5W`qhfFXFlmMpk?GuwcD^ZVB
zckUCtsb9dgz%FYJvX=+{;caXmC1Q7Rfe|J`5$O!)3Am5&%HaD&{!~U1GPytwu||CJ
zx?h(?jfc?x7#(wCE;n<(P{Txgtx-vCdUvqb2z;<`#1j3~v9Kl*eIKEezz`#j3@z`f
zOyc2?lEtk3wpT8UGc+*#jD=|V;2|m6I<eU>h%G1#b;u1qXyq+wl<o;2qHd`(alpsH
z!jO9&!FxvUE_WhRg$^}(HehF)N`}62;`gJl9*ip%L>0=P?5FLgfW0<0fR=?owvY{`
zt|g+Mw<t&59EofZ+*XI%4jBRI*$kniPZn~Y(`Nt{QkwqH5QNII3|Y?Gv{Xd&k2DBx
z<Lr1zt9If7RT(~2pfp64&=Paw!%puP1K-*FOQ79s7Jn24`a-&WXn9E!qeVWk`)WIn
zD3GBwK<M89C}@=m7(Nv`sS&7on_2$G1cPicTjn7$IW45S@jYzgs@6`fNp8Aa@yBy>
zShffnr^-!6e==K)4VFB#+JzO8A%|;0q7Nhpt`DL8>cTgG(()D(3!dDOuj}H&Tkz1x
z3^gbieoFqBaLJFx#OW8c49Rxg(Nn+ub?6CDuV$N4{(*#9^$;|ucWlV(7v(6wrKNkl
zk)|g{e<(=JZy~(`)fQE%C2iaB;*}7r^$va70wiT90o{kt=L+xxQfaT>hgXhf)d>2R
zzxOJv&4@<AAz~ztx~=ZLAiK^X(CQB++~+!M?W!Cd(gMzTTv!M{GOu5cah?BU-p;mo
z&hT;qg`X=xqr*LWcJ_eqEjxG+FY1K5;)O3N^H2*Dl)dF_T^}EI8Rji&&}`RLYy9_8
zESvP|>(08)Bk=4v|7YQcGZl@=)$XUBD>sQM^WWRA(8>WWU=S`WWrU)FlR^Ahs5?=I
zHr^Re>S%Z^{RmL^<{{(qtUT2zSd_@Pc~jpqsBjxFBQaF!@_~hog-CgCA8F7Xjnvbj
z_sL2^zSvDV9&fwzFJgx&i|$|9?WZu%rYpikffdfsn%?%D%BiycJwnUb9fivDMmuMs
z56HaJ2R|u@<}XWns#4-xeZY|}qN)GL<YPG3exbEV4isyj+5GBG!h0vJRZ7(}Z>_=s
z?L7Cy86r519J7~XLJd9`DuWJPY`b5rwEHw5;(p$~SF?3uxN_E!BM5n15rYr3eK17i
z;aK8}R9Wo;S^tnf9$&;?6SLTQp~6{IZGTiUJb$7Bws9AljAwaXs?m3TUH7=?w3r;g
zdKCN85ygBg?4_1wYdCZB_KqG9A>2D^Z*5J+=!lmM3`rgmCidj%1_oPB0X)y>hfd%J
z8kMBb3i3B@m8d!~yubokkxp{c{KWA1HoHl;xRG|Z?$_JQ3JC#CSMO#nfQ<s64N{_f
zFyF}a)Sak@EdE%q?@~L=N6_jy!$afpgm8<u>vCk2QwxDni&B2NCV`Ma$B*BhTYkp4
z;0Xue1w~lBPM9D7Ezwg(N3+U3-9{rnB^(#X-`jb1Sl2XV5BB#>B0O<-g2r}Az!HXt
ze44O)>r9_>*i6<UuU@3ndB@hg#~*WEQZSWQ-An(E^5lVx28ewQu)3!@L5a-pQq^mF
zDWC{nk)iyv`E6MX-ApDe-*P5zSI!0$R}5kzPv7>AToPF@iLVG3Lj%{$i5cjUhR_SA
z7{Z1bpv@P;1g<q>bUWT`iBGp$H`Szy#31BoCdDGn$hLKG16>xIZ-Wi+2=p`7{RV-p
zsi-WfNZFMFS#%ae;_f_n2NISl$k5+D9_Z2s&jIQ*SIEoYEY}oM8pSM3TAj@$Q0MsI
zr<!1W4)ZEptgdMhRCQmcCC@2F8hq=CbE+sZ!ize+yQHH0M=?um!Md<khm+U2M2DQ1
ztd)4m@k^A$Z0uDcQ~dZiTh*~r#^0C$y}NY<KiWDUVX0H#u!o3?FcKR;j-_R~u<F}&
znJd>v;IEDh38BkzUJIj{x9vkbi4yMn-M0}n_)N9`cxjkD(}+3?9cD=;y&|Bu4}4b<
zAKuvzk5nRUdhg&zr7aG?E0evWm6$_MN#iUfOt+&+<auS|gGm_a#s?hNYYIc&D;0`s
z&-q;{Xsn9qVs+QydAbfjdD!ShF1=nPr@Z%;oi^UxkcBFJ_bNhoM3aYXL!E3h3D+r*
z{LJQa=L;i3U^9^Ng*@z`VWidh($rha#*^x{-KXzMrA!J!Op2smT{&FsP6<2GDy{4M
zT`JpzQvz+T{TlW>F*TCA;s<714HZhz=p4@cZCi7BcXRafLy;OWErxJ|$S>3~^s?&A
z#eCBRZ8H45dG!-N{?*i+L2R=VmlwT_llAhj_rB6ydSgn3kU>{I))8|(cG86HIx{gy
z6N5+|0Yz&Z<NVD0A<)YHGw|@2<Ue!)ky}dHM8B2qZ8P0uE<?ghruk^E?Yyt?ir71d
zrr=Ga^7SoI-II^hFqsbTL+GorQ%-x;Eq9+*Z9Jz+J|^+E<&DXVBjFv>&miB*Lrz@2
zGNs(4ikT8FYY8-SSHuv2LNwj<@<reZb1mJ{*N`Qrg#N5<mOP@}wy>myVNu6dwejJs
z!GZ58sF(7s6!)eIQj9L(tE}BGRod{P0FPPdgl-k7r)Z_OFaH;y)R-Ty3!^h6NPBor
z0WK=)t6e@zW_Z21{_ADS$&`jL&*rb7R(6Daz%EjFuEkhgbK%kI7fxCXQFGR^O{GuK
z1?(TppdOC7UuP5jhip}@9octDu(E_~+0Lx`KkS*s1`f%3*g9@M^zF+%FOZ#8h|MN4
zH6~r=T@jJDU?oeTamQ_L^$g%H4ol*YdWNxyQpgsUz~xdzMdH!thuIc|Yz49<YZTvo
zXH6M)B~Rxz2h|-n*YlTMmuqAy#CZ9Hq@#gm9KFa%IG6{3Njt3GNU5=$zyB;V`=Kbo
zSDA{_w%a3I;Oq+FjKW<TwV6-=qNh(6RzDqjWpF5kOL5{m+|YDpz_EA|u2%S&9Rq!A
zuSDFn1fR5UW~F;0=?~>O@(#uxaUPyI?|@q#SC9ak=^%u&lpgva>Y=r?p0iU!+OmhV
zyWRJ@yMx=d;fdc1r>J}9yqd+f<QPK*iLrHD=pwXO3ozUbaB3nf()@d<>MP*V2PG=h
zFOTRgx%7&Vo{}t0r6BH7{cfgJaF%gjmM>zt%TbE}*zQk!^d(y!5c{UG9TIxxS#wYk
zF<|*KEfXLQ+(@W`v$R_G+mQ!)kwsfJ1S}GUe3=qBfirZ9KS4?%l)P{cwx!LqvVP8(
z^<j~;v@B7^&sKSj`5K<jmT`=zZr&D>QSH8sEu&GJ>(R&x%U|#eNZTNvxiwnbzBPy9
z?d!f-w|KYuE(Nd)8^NL|qQ2(j67_B8`o0kQVV6)4WM1ICxE?{;{W0T5=Gaoe?p{zd
zTc|5#ng0{pLhGRAm1=$1APxEhUeB(ybMT)on%E-z44@8?;Y34r35B?{pnAREgnTG$
zGH<aJmah`{i14ER_w<b|)7ie9mQI-S`_!(LPBx=Ri-zLf1y^fe4Vf&oOd;x{F6`O>
z4U7EXaU_-WT=)slx`u#;5dh7-)xo<9^tA5q_1yD^z={<<WBm!YdoLOv>fqD*ke90a
zTZ(q#m~P*Co(jF%mrry%Y!X(!pV;zL!d<WTjrb^bwSJOMw`RL~2KLqtc|6uUp7>c+
ziiLv8gdo1HNtiqhm%f%Mg!C8DT3LLpqZvg#JRgz`*;%?)7f6fyds=q0Wm(tt<ewh$
z=*63{FG&Sxt$x`THAMHy?#n?kt0A5(AqVFI04PVY$VJuf{V|>pWh{_ApZ>UG2zlEl
zD{=&Beq5o7i3Z5qD9AST=Nny%Vt4H@&ZfC)Qg|1Pc;2a9cZhNTKt3Cka6{!@*0%n#
z>b*ljlaava3v}4KR9|<!;00_2Gi5B4$Pdfj3bq%cM+^R6G}V-h@x)CTj__2~ooMwW
ziCL}<1p0tQhjRGPyRWX$g9|sdM0GO5SCs#D0)QJYh<(phg+f%RZss4MfhCB1awVa(
z;z2UunC}1wpur|OH1N&Mi}ttrk3vgA7<tnQ&{icnQ?%V?JW_^{22Zn$IDZFd{ELGr
z_Kv%EfYY`LWG^T5m2@5~)_uGL3i<zq6bo82@I<&kR^JBZF9+$f!A>(G)XaFUK?&?P
z$~;7eF6RAp%OM)>mpzW=)4OFn6vbUC8Lu9Dr20XDS5ZJn0N+WLznK&-3PtnjyQU1{
zoGRrvX-Cobgmf&5H&^OBJ>obln^!Wr43EMMA-8wWmIf^dM*4wzW2|2?kV%uPSuI$w
z)fzVlbHjvkv+a^aFH#ElZK!kxk=O2%-3N9WQl<X+)Sf-F5lJ*(Gv21RzpT(=wCrUV
znWqoqk%L^shlv<y9yfM90gi%y#}jJfkr#Y>zIBm~M-dy4Q&Z31jIH2HDgz|7Ak|!g
zY$CWd%q%SSUQgks*4N>(*VIpa`f$6qf_(q}>pW1hi1XKrI;;gDSMCA3+IZh}$`;Kw
zza`=Ay$d=T>CeUk>_W!YaW~Fc5R#;8u}$!uK7?TJ95Ma~_a33N3U}Nam0*@^!d%gB
z{D|{}v^)N#<9m}`f=<5SPcH^rbLt<^bn}~NS2o${QtCX&;mlKgcC&jOFmu1ge#op>
zBRFgBnKhwI2uM_!a<i#>(6mtVw~-X_f6FBXkyh{4>d|=8cu{YXw{$bkdl#v`gaSHo
zE6cvfvkdeNpIN2OE9Wm|?QUq5ZQj!?!;50W1g!;I=B+Nw-murDkgs*CHtSZrhm-j2
z<fASQ;x~9v-D_`w^NQX`Hov@+DyGg`^Ge8fh<t!{SOserJ8>TwT%MO$Uw%&@&<^{b
z8{V^Z%y5af6v*DpsZkbuJ6C60kb`WP#c=)D@@E58VpY+$>rvji&2Hld*1bFwPmyqV
z8WZJ8Bj5Zqwo*Fl-I^Ewf<%AG_+Fhqyy(nt$}BkRAP)z#`-Q!t$RJ_%ZdFvz`S#{e
z3>W^^3Z>f-K!z)d4crQfrndN_iM$)+^RFRV@>oHT!@GEiy~_;t4|fanGG6&nb7}_y
zVY#AD8InUZud)4G^&T1>#xnUxo`cww3TN5X7YG_67~yT%kA&x;T!e;^fdrO*lc|%i
zND&)Y@%#BVm{T557&`PgmuSA}RX7wC1|8}&<SYyXn&a$yFZpGli1X2?D`79`;AB+Y
zmwLs^J)EUkquH|%&I#4XOVcG%N3&mezEW9>qfA_wJyIw_Nl-6;uduCN4)XQ^vA(Lo
z$#7|frthl!vK70+ztCh*`DTlq{%TazWaR4L@Ch!zDb1h%LLzM+$U7S5uTfFfc7Q+x
z?U?@;pj+)WZ~^)oBcmuP^iuu!t!mQo9Z9qZvE?>_cacH9SGrzH#!1_^?w&_6Ou$=s
z38Bs!m4>Fquos5qEE3Q7Z2%%E)}g`F)>!SXXiYPN?Y6Mvk}2B3M~eYJ>JuL+XPLtM
zD;IhBY3HIaw<lyMxm6b4+^DWkHc<;V)+P4%gz5Ilj?;82fMXo4s5xbmEs|N~J<viz
z%>3?kjNjG1Zu)v?&G+}4IUJ~cj@kRG^|8(1$LIrg$5$q0#Ah!YMo+GIj6dYd07vee
zZc&Q?dIJ#o`c9nh1qS)oj#g>H8_RDeqyRT%gtOIq>XN{__;D#(QQ2}d+j(l;Ib5fB
zQKqKM7`uVkIt(IGCUs#Zm5?<d&nMqw`+7sF9-%Pz5*H0A577_DIEWFdpJR+^&?XHP
z+BC(#jGjJjE12{6m#Y@#D4X+$yg!6lPCR1cAU<KP@d##Nlv)7;PUc4Mcck5IY~gN8
z5ofgyvJ|E~8$Tl%bzRQikJGuDGW<;V)_2RtefuImTClzVn-UASCmoE&buy?Xfrkcu
zH!J?r&4<RLTCDqusS<)vY#l8LmIN%14I}I7`Q<7XUEkRN8bYlR&U@MDPk0onG+D`b
z6u0-JD>b(~J?Ce<-`V`rFj9$fR=hw&C(PW$<uq4S>@MwlLYOi|ehJPB0ZNTiJ5(Mx
zgyh$*r=7PGC>ju-1fZZlE8_8iEzyVUQa}((2?Fv<b1s=u-U%_;0JlBNtLHBxeuC%i
z@%0YaQv{w$WD_uNUYLnlT|7vw@Efhyd39bOt2^0XnEvE*nKdlUSk%Al1ixhND5+M3
z8|WSYJz>frY$d>P`xqCZv0{~;agvYYc&o#5FofWAJB#}b$(=||T&im2KNbaLMtv*i
zo;5m{0xmPW3h4auOZ|WZUcbj^^47{G`t3r*uzYrEw+*|38-TPRKJ^Bw(o*h$N{a9X
zev{>JR$?uU&+;_r`2RCjaA0UO7%WNVP^##fxcAX98+Gn)UJyI<*4)}*xb@J4uZkVN
z=A{N{o2P|{^?ZNQ@CRh3j4DqducOOV+2gTyB=+g3nCEVqrc(p*)9ufOwg#`?XTOPG
z%K}ai6Os}qh-8SmzY?7^p|xbq#sF`zH(VmUdsMiAMT*0!7R8<^inU+4UQTP>vCLOZ
z5iHsm#J2v>gn3o1500O{?9-u=a`5l+!~Ni9tb=2#;_I(mC!BWdN?7%eyFr0LBu?U!
z3U?silqZ2=bEbeNa2N#G`ekzkyQKHpA6|3vP<gcd`tEOW%YUcW#y(EhTLA3bGbr%v
zYdILb*XhdjH=d_}b$3LERip!OvX;R?qK4Dis#|(uYgL~ssJX%*u*zV`@;Jswj&QLP
zz>yDzh6yc-b2m-cH&Y;U66@nhsuI8fcHlmQ78RaLH?sNz#m(Jriaw7O(*hN4Anh9s
zESB<cuS)Y$;Qn~3>3bMx!4HGN#3>7-Bo0O1uy~a@`R26NQ(^hpfA{F!`+dLU{+ih`
z+d+fVEDRo<1}VVQ<-ZBMvX23{Qqw_f(bU$Dy8UO97l2iqm|&p5{qPjH{$Ox;*8+5=
zHN+zgb2ty%q$s*XLKHekaA|RG-x{~x`&*sU_jAAOp8%K5F)$oz&<V-URr@m?G;+bP
zpx}^#=l#sTISW%47G=8tqZ$|<ulyuGX@KH|q2ZA9v=j4mEVdi$5(QOQ3=AzAJU1t>
zS|@(^B>^lS7&x3`4^5DbT%i*%1zZ*~D2OF`Y}UDR>zC!;-1q9G=hyuAtpl0l5Oiq5
z(iGs*JO&022Z>86+~BmrFu^I&qg}_~09Z*@t0HHlL@U@~3_&_Pmp)|m7oKGL30$26
z+`=KiW}PXq-=<{7rVr=W&cA&7d!3j0wwS~6Oh7j`tnqBVyuszlNhXk^CKM({yx3*4
zWqay$U~LR^v*V<amp5;huC&@x`8EnT0oW^DIT2X!0lf<HFhk42r&6(1-@ZNk|MJP#
zrau9XR2djPsPjDD4_p^q^=2b*VN%rHPF0Y}4F*0Q5@w|(9~OalK<_gF2@#eq5k`hr
zEh~E_xC6@qAOISTZ;uVgPT&X&ND(nAfkhlpC00#IVl0PG17!m;&bT-lm`zGhs{!&H
z>{Je{t6yKxIB7P>e1~_f3%e$@^Lm18{G`fq%vZ?E)T;gnkhdTLI4o?a@66Ky^oT><
z(F3I&iAe_!9eEElMM1tvq22C&p;+_fb0B{@>=R-MKF#RGXRXK%)OvJMOV_`BD*4$8
z;3H;!PG&y7Rp5=77kDd<!$OvYStkzWt$f-kJ>7jDP`SeIo^P-FiVU<k%J?V90R=?V
zT~`z}9OIOZ7XD}ZEj99*tFpa*?;q=rzdy#$`d|xG;d1@r?b2UqPC)_FPH#B$BjCWK
zD;bv$PS5#Q`fJ}bg%fT<6F^&>5{weQ|Bqu?81uL~x-w(RUx7m}&Yw~iGKgvpkh<=X
z8FTA_JILP(Hi-qZGYkw}HFm3Tg*x;2O*4uUGx1~U@ojpb!sY?;pGl^ZZlK2QKl_u{
zCN6f)F`Rc%B=Jjic9Y5#FW{^_(5ed6gQvr9J}orud;KK4(<$<sGv^XeP`vaL{8J;F
zeLhpnd9C_mGholx1*DqwpdX*gb4l*J&5~Me5^JP@vE$JI9D@ZOmEto=K|FB9t?RiR
z2R?l?R@Zb80g5j27nsB1xN5J)qPO3KSsmr9{x5hfqX0V8>S9OZ-SfT&>QztvsaJ8<
V@pu|;^a&`;;OXk;vd$@?2>{a8I)wlL

literal 0
HcmV?d00001


From 21f945ef99c05a070c1ffd0b8ad0413f2def27be Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Fri, 23 Jun 2023 08:48:00 +0200
Subject: [PATCH 0403/1398] Update change (insert concerns both cmap and gmap)

---
 Installation/CHANGES.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 02f9b3654ec5..72aa6cf6103b 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -11,7 +11,7 @@ Release date: October 2023
 - **Breaking change**: C++17 is now required
 - Support for Visual `C++` 14.0 (Visual studio 2015) is dropped.
 
-### [Combinatorial Maps](https://doc.cgal.org/6.0/Manual/packages.html#PkgCombinatorialMaps)
+### [Combinatorial Maps](https://doc.cgal.org/6.0/Manual/packages.html#PkgCombinatorialMaps) and [Generalized Maps](https://doc.cgal.org/6.0/Manual/packages.html#PkgGeneralizedMaps)
 
 - Added the function `insert_cell_1_between_two_cells_2()` to the `GenericMap` concept, which enables users to insert an edge between two different faces in order to create faces with holes.
 

From 518c32e193d80b74c0bfded1fbffb42d9b38b2cc Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Sat, 24 Jun 2023 10:21:22 +0100
Subject: [PATCH 0404/1398] Update change log

---
 Installation/CHANGES.md | 9 +++++++++
 1 file changed, 9 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 3c60725161c5..e909d9ea8f52 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -1,6 +1,15 @@
 Release History
 ===============
 
+### [3D Mesh Generation](https://doc.cgal.org/6.0/Manual/packages.html#PkgMesh3)
+
+-   **Breaking change**: Removed the concept `TriangleAccessor`, the template parameter `TriangleAccessor`, as well
+    as the class `Triangle_accessor`. They were no longer used for several releases.
+
+-   Removed the class templates `Gray_image_mesh_domain_3` and `Labeled_image_mesh_domain_3`
+    which are deprecated since CGAL-4.13.
+
+
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------
 

From 28dbd6b8eef13b78c6318efda196e423548e1aec Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Sat, 24 Jun 2023 10:37:39 +0100
Subject: [PATCH 0405/1398] allow -> enable

---
 Mesh_3/doc/Mesh_3/CGAL/Mesh_3/parameters.h    | 24 +++++++++----------
 Mesh_3/doc/Mesh_3/Mesh_3.txt                  |  4 ++--
 Mesh_3/doc/Mesh_3/PackageDescription.txt      |  2 +-
 .../include/CGAL/Compact_mesh_cell_base_3.h   |  2 +-
 Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h   |  2 +-
 .../Mesh_domain_with_polyline_features_3.h    |  2 +-
 Mesh_3/include/CGAL/Mesh_triangulation_3.h    |  2 +-
 .../include/CGAL/Polyhedral_mesh_domain_3.h   |  2 +-
 Mesh_3/include/CGAL/refine_mesh_3.h           |  6 ++---
 9 files changed, 23 insertions(+), 23 deletions(-)

diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_3/parameters.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_3/parameters.h
index 65fa962d5125..acfb0b6efd8b 100644
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_3/parameters.h
+++ b/Mesh_3/doc/Mesh_3/CGAL/Mesh_3/parameters.h
@@ -60,9 +60,9 @@ unspecified_type manifold_with_boundary();
 /*!
  * \ingroup PkgMesh3Parameters
  *
- * The function `parameters::exude()` allows the user to trigger a call to `exude_mesh_3()` in the
+ * The function `parameters::exude()` enables the user to trigger a call to `exude_mesh_3()` in the
  * `make_mesh_3()` and `refine_mesh_3()` mesh generation functions.
- * It also allows the user to pass parameters
+ * It also enables the user to pass parameters
  * to the optimization function `exude_mesh_3()` through these mesh generation functions.
  *
  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
@@ -131,9 +131,9 @@ unspecified_type features();
 /*!
  * \ingroup PkgMesh3Parameters
  *
- * The function `parameters::lloyd()` allows the user to trigger a call of
+ * The function `parameters::lloyd()` enables the user to trigger a call of
  * `lloyd_optimize_mesh_3()` in the mesh generation functions
- * `make_mesh_3()` and `refine_mesh_3()`. It also allows the user to pass
+ * `make_mesh_3()` and `refine_mesh_3()`. It also enables the user to pass
  * parameters to the optimization function
  * `lloyd_optimize_mesh_3()` through these mesh generation functions.
  *
@@ -210,7 +210,7 @@ unspecified_type lloyd(const Named_function_parameters& np = parameters::default
 /*!
  * \ingroup PkgMesh3Parameters
  *
- * The function `parameters::no_exude()` allows the user to tell the mesh generation functions
+ * The function `parameters::no_exude()` enables the user to tell the mesh generation functions
  * `make_mesh_3()` and `refine_mesh_3()` that no exudation must be done.
  *
  * \cgalHeading{Example}
@@ -246,7 +246,7 @@ unspecified_type no_features();
 /*!
  * \ingroup PkgMesh3Parameters
  *
- * The function `parameters::no_lloyd()` allows the user to tell the mesh generation functions
+ * The function `parameters::no_lloyd()` enables the user to tell the mesh generation functions
  * `make_mesh_3()` and `refine_mesh_3()` that no lloyd optimization must be done.
  *
  * \cgalHeading{Example}
@@ -269,7 +269,7 @@ unspecified_type no_lloyd();
 /*!
  * \ingroup PkgMesh3Parameters
  *
- * The function `parameters::no_odt()` allows the user to tell the mesh generation functions
+ * The function `parameters::no_odt()` enables the user to tell the mesh generation functions
  * `make_mesh_3()` and `refine_mesh_3()` that no ODT optimization must be done.
  *
  * \cgalHeading{Example}
@@ -292,7 +292,7 @@ unspecified_type no_odt();
 /*!
  * \ingroup PkgMesh3Parameters
  *
- * The function `parameters::no_perturb()` allows the user to tell mesh generation global functions
+ * The function `parameters::no_perturb()` enables the user to tell mesh generation global functions
  * `make_mesh_3()` and `refine_mesh_3()` that no perturbation must be done.
  *
  * \cgalHeading{Example}
@@ -315,10 +315,10 @@ unspecified_type no_perturb();
 /*!
  * \ingroup PkgMesh3Parameters
  *
- * The function `parameters::odt()` allows the user to trigger a call to
+ * The function `parameters::odt()` enables the user to trigger a call to
  * `CGAL::odt_optimize_mesh_3()` in
  * `CGAL::make_mesh_3()` and `CGAL::refine_mesh_3()` mesh optimization functions. It also
- * allows the user to pass parameters to the optimization function
+ * enables the user to pass parameters to the optimization function
  * `odt_optimize_mesh_3()` through these mesh generation functions.
  *
  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
@@ -395,10 +395,10 @@ unspecified_type odt(const Named_function_parameters& np = parameters::default_v
 /*!
  * \ingroup PkgMesh3Parameters
  *
- * The function `parameters::perturb()` allows the user to trigger a call to
+ * The function `parameters::perturb()` enables the user to trigger a call to
  * `perturb_mesh_3()` in
  * `make_mesh_3()` and `refine_mesh_3()` mesh generation functions. It also
- * allows the user to pass parameters
+ * enables the user to pass parameters
  * to the optimization function `perturb_mesh_3()` through these mesh generation functions.
  *
  * \tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
diff --git a/Mesh_3/doc/Mesh_3/Mesh_3.txt b/Mesh_3/doc/Mesh_3/Mesh_3.txt
index a802ac4df08b..43660034018c 100644
--- a/Mesh_3/doc/Mesh_3/Mesh_3.txt
+++ b/Mesh_3/doc/Mesh_3/Mesh_3.txt
@@ -494,7 +494,7 @@ protecting ball centers that are consecutive on a 1-feature. This parameter has
 
 The four additional parameters are optimization parameters.
 They control which optimization processes are performed
-and allow the user to tune the parameters of the activated optimization processes.
+and enables the user to tune the parameters of the activated optimization processes.
 These parameters have internal types which are not described
 but the library provides global functions to generate
 appropriate values of these types:
@@ -679,7 +679,7 @@ View of 3D meshes produced from a polyhedral domain with a nested surface.
 
 The following code creates a polyhedral domain, with only one polyhedron,
 and no "bounding polyhedron", so the volumetric part of the domain will be empty.
-This allows to remesh a surface, and is equivalent to the function `make_surface_mesh()`.
+This enables to remesh a surface, and is equivalent to the function `make_surface_mesh()`.
 
 \cgalExample{Mesh_3/remesh_polyhedral_surface.cpp}
 
diff --git a/Mesh_3/doc/Mesh_3/PackageDescription.txt b/Mesh_3/doc/Mesh_3/PackageDescription.txt
index 63141c257e05..c4221f3cfbf2 100644
--- a/Mesh_3/doc/Mesh_3/PackageDescription.txt
+++ b/Mesh_3/doc/Mesh_3/PackageDescription.txt
@@ -27,7 +27,7 @@
 /// \defgroup PkgMesh3Functions Mesh Generation Functions
 /// \ingroup PkgMesh3Ref
 /// The two main functions to generate a mesh are `make_mesh_3()` and `refine_mesh_3()`.
-/// The other functions allow to optimize an existing mesh.
+/// The other functions enable to optimize an existing mesh.
 
 /// \defgroup PkgMesh3Parameters Parameter Functions
 /// \ingroup PkgMesh3Ref
diff --git a/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h b/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
index d30acbcb141c..1e5ee7657311 100644
--- a/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
+++ b/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
@@ -437,7 +437,7 @@ class Compact_mesh_cell_3
 
   // CHECKING
 
-  // the following trivial is_valid allows
+  // the following trivial is_valid enables
   // the user of derived cell base classes
   // to add their own purpose checking
   bool is_valid(bool = false, int = 0) const
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
index 2abcb9f3241d..dad06a5540b3 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
@@ -673,7 +673,7 @@ scan_triangulation_impl()
     typedef typename Tr::All_cells_iterator All_cells_iterator;
 
     // WITH PARALLEL_FOR
-    // Copy cells into an std::vector to allow the use of tbb::parallel_for
+    // Copy cells into an std::vector to enable the use of tbb::parallel_for
     // which requires random-access.
     // Note that we're using all_cells_begin() instead of finite_cells_begin()
     // because it's faster to do the is_infinite() test in parallel.
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index f6de5e1a0785..7e5a82c03bf1 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -517,7 +517,7 @@ struct Display_incidences_to_curves_aux<MDwPF, false> {
 /*!
 \ingroup PkgMesh3Domains
 
-The class `Mesh_domain_with_polyline_features_3` is designed to allow the user
+The class `Mesh_domain_with_polyline_features_3` enables the user
 to add some 0- and 1-dimensional
 features into any model of the `MeshDomain_3` concept.
 The 1-dimensional features are described as polylines
diff --git a/Mesh_3/include/CGAL/Mesh_triangulation_3.h b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
index a63c09a07826..db6db640c79d 100644
--- a/Mesh_3/include/CGAL/Mesh_triangulation_3.h
+++ b/Mesh_3/include/CGAL/Mesh_triangulation_3.h
@@ -77,7 +77,7 @@ class Mesh_3_regular_triangulation_3_wrapper
   // because of Periodic_3_mesh_3: they are functions for which both triangulations
   // have fundamentally different implementations (usually, Periodic_3_mesh_3
   // does not know the offset of a point and must brute-force check for all
-  // possibilities). To allow Periodic_3_mesh_3 to use Mesh_3's files,
+  // possibilities). To enable Periodic_3_mesh_3 to use Mesh_3's files,
   // each mesh triangulation implements its own version.
 
   const Bare_point& get_closest_point(const Bare_point& /*p*/, const Bare_point& q) const
diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 2abd37c3d77b..8ffc5d6f93a7 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -262,7 +262,7 @@ class Polyhedral_mesh_domain_3
     Construction from a polyhedral surface, and a bounding polyhedral surface.
     The first polyhedron must be entirely included inside `bounding_polyhedron`, which must be closed
     and free of intersections.
-    Using this constructor allows to mesh a polyhedral surface which is not closed, or has holes.
+    Using this constructor enables to mesh a polyhedral surface which is not closed, or has holes.
     The inside of `bounding_polyhedron` will be meshed.
   */
   Polyhedral_mesh_domain_3(const Polyhedron& p,
diff --git a/Mesh_3/include/CGAL/refine_mesh_3.h b/Mesh_3/include/CGAL/refine_mesh_3.h
index 3f11e81ce8a2..78778059d351 100644
--- a/Mesh_3/include/CGAL/refine_mesh_3.h
+++ b/Mesh_3/include/CGAL/refine_mesh_3.h
@@ -170,11 +170,11 @@ class Insert_vertex_in_c3t3
  *                 of 1-dimensional exposed features.
  * \param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below.
  *           They control which optimization processes are performed
- *           and allow the user to tune the parameters of the optimization processes.
+ *           and enable the user to tune the parameters of the optimization processes.
  *           Individual optimization parameters are not described here as they are
  *           internal types (see instead the documentation page of each optimizer).
  *           For each optimization algorithm, there exist two global functions
- *           that allow to enable or disable the optimizer.
+ *           that enable to enable or disable the optimizer.
  *
  * \cgalNamedParamsBegin
  *   \cgalParamSectionBegin{Topological options (manifoldness)}
@@ -310,7 +310,7 @@ void refine_mesh_3(C3T3& c3t3, const MeshDomain& domain, const MeshCriteria& cri
  *   done at the end of refinement process
  * @param reset_c3t3 if `true`, a new C3T3 will be construct from param c3t3.
  *   The new c3t3 keeps only the vertices (as NON-weighted points with their
- *   dimension and Index) of the triangulation. That allows to refine a mesh
+ *   dimension and Index) of the triangulation. That enables to refine a mesh
  *   which has been exuded.
  * @param mesh_3_options is a struct object used to pass non-documented options,
  *   for debugging purpose.

From aa0d50b84c40d7962ad5c8e7aade3189aefadb0d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 26 Jun 2023 15:08:05 +0100
Subject: [PATCH 0406/1398] Fix Arrangement_on_surface_2 examples

---
 .../examples/Arrangement_on_surface_2/CMakeLists.txt          | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/CMakeLists.txt b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/CMakeLists.txt
index bd3e707c4b45..a7d1965c8cd4 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/CMakeLists.txt
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Arrangement_on_surface_2_Examples)
 
-find_package(CGAL REQUIRED COMPONENTS Core OPTIONAL_COMPONENTS Qt5)
+find_package(CGAL REQUIRED COMPONENTS Core OPTIONAL_COMPONENTS Qt6)
 
 # create a target per cppfile
 file(
@@ -15,7 +15,7 @@ foreach(cppfile ${cppfiles})
   create_single_source_cgal_program("${cppfile}")
 endforeach()
 
-if(CGAL_Qt5_FOUND)
+if(CGAL_Qt6_FOUND)
   target_link_libraries(draw_arr PUBLIC CGAL::CGAL_Basic_viewer)
   target_link_libraries(linear_conics PUBLIC CGAL::CGAL_Basic_viewer)
   target_link_libraries(parabolas PUBLIC CGAL::CGAL_Basic_viewer)

From 1066af14f4c04f827a27d288792eb03597f2ff15 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 26 Jun 2023 15:09:10 +0100
Subject: [PATCH 0407/1398] Add #include

---
 Polyhedron/demo/Polyhedron/MainWindow.h | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Polyhedron/demo/Polyhedron/MainWindow.h b/Polyhedron/demo/Polyhedron/MainWindow.h
index ea43c7a482f6..b58fa02912fc 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.h
+++ b/Polyhedron/demo/Polyhedron/MainWindow.h
@@ -9,6 +9,7 @@
 #include <QOpenGLWidget>
 #include <CGAL/Qt/DemosMainWindow.h>
 #include <CGAL/Three/Three.h>
+#include <CGAL/Three/Scene_item.h>
 
 #include <QJSEngine>
 

From a015b1de233e2bbf5fba397833c60f041dd67c76 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 26 Jun 2023 15:37:44 +0100
Subject: [PATCH 0408/1398] Fix Straight_skeleton_extrusion test

---
 .../test/Straight_skeleton_extrusion_2/CMakeLists.txt         | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/CMakeLists.txt b/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/CMakeLists.txt
index f29dcb4e9296..8dd920fdf64f 100644
--- a/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/CMakeLists.txt
+++ b/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/CMakeLists.txt
@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Straight_skeleton_extrusion_2_Tests)
 
-find_package(CGAL REQUIRED COMPONENTS Qt5 Core)
+find_package(CGAL REQUIRED COMPONENTS Qt6 Core)
 
 include_directories(BEFORE "include")
 
@@ -17,6 +17,6 @@ foreach(cppfile ${cppfiles})
   create_single_source_cgal_program("${cppfile}")
 endforeach()
 
-if(CGAL_Qt5_FOUND)
+if(CGAL_Qt6_FOUND)
   target_link_libraries(test_sls_extrude PUBLIC CGAL::CGAL_Basic_viewer)
 endif()

From 4854c500b0b275b80c0de677763c32d5cf836b2a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 26 Jun 2023 17:41:16 +0200
Subject: [PATCH 0409/1398] restore usage of boost prior/next that breaks at
 runtime

---
 .../include/CGAL/Polyline_simplification_2/simplify.h | 11 ++++++-----
 1 file changed, 6 insertions(+), 5 deletions(-)

diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
index 85404f86c2d1..17ddecd3ba46 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
@@ -30,6 +30,7 @@
 #include <CGAL/algorithm.h>
 
 // Needed for Polygon_2
+#include <boost/next_prior.hpp>
 
 #include <CGAL/Polygon_with_holes_2.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
@@ -154,11 +155,11 @@ class Polyline_simplification_2
       (*it)->set_removable(false);
       ++it;
       for(; it != ite; ++it){
-        if((std::next(it) != ite) && (std::prev(it)== std::next(it))){
+        if((boost::next(it) != ite) && (boost::prior(it)==boost::prior(it))){
           (*it)->set_removable(false);
         }
       }
-      it = std::prev(it);
+      it = boost::prior(it);
       (*it)->set_removable(false);
     }
 
@@ -245,9 +246,9 @@ class Polyline_simplification_2
     }
 
     Vertex_handle vh = *it;
-    Vertices_in_constraint_iterator u = std::prev(it);
+    Vertices_in_constraint_iterator u = boost::prior(it);
     Vertex_handle uh = *u;
-    Vertices_in_constraint_iterator w = std::next(it);
+    Vertices_in_constraint_iterator w = boost::next(it);
     Vertex_handle wh = *w;
 
     typename Geom_traits::Orientation_2 orientation_2 = pct.geom_traits().orientation_2_object();
@@ -322,7 +323,7 @@ operator()()
 
   Vertices_in_constraint_iterator vit = vertex_to_iterator[v].front();
   if(is_removable(vit)){
-    Vertices_in_constraint_iterator u = std::prev(vit), w = std::next(vit);
+    Vertices_in_constraint_iterator u = boost::prior(vit), w = boost::next(vit);
     pct.simplify(vit);
 
     if((*u)->is_removable()){

From 04f52791d6793a8198cb7cf98414fd8234a90159 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 27 Jun 2023 09:40:27 +0200
Subject: [PATCH 0410/1398] manually fix iterator category that seems to not
 work correctly when stacking boost::iterator_adaptor

also restore std::prev
---
 .../include/CGAL/Polyline_simplification_2/simplify.h | 11 +++++------
 .../internal/Polyline_constraint_hierarchy_2.h        |  2 +-
 2 files changed, 6 insertions(+), 7 deletions(-)

diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
index 17ddecd3ba46..85404f86c2d1 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/simplify.h
@@ -30,7 +30,6 @@
 #include <CGAL/algorithm.h>
 
 // Needed for Polygon_2
-#include <boost/next_prior.hpp>
 
 #include <CGAL/Polygon_with_holes_2.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
@@ -155,11 +154,11 @@ class Polyline_simplification_2
       (*it)->set_removable(false);
       ++it;
       for(; it != ite; ++it){
-        if((boost::next(it) != ite) && (boost::prior(it)==boost::prior(it))){
+        if((std::next(it) != ite) && (std::prev(it)== std::next(it))){
           (*it)->set_removable(false);
         }
       }
-      it = boost::prior(it);
+      it = std::prev(it);
       (*it)->set_removable(false);
     }
 
@@ -246,9 +245,9 @@ class Polyline_simplification_2
     }
 
     Vertex_handle vh = *it;
-    Vertices_in_constraint_iterator u = boost::prior(it);
+    Vertices_in_constraint_iterator u = std::prev(it);
     Vertex_handle uh = *u;
-    Vertices_in_constraint_iterator w = boost::next(it);
+    Vertices_in_constraint_iterator w = std::next(it);
     Vertex_handle wh = *w;
 
     typename Geom_traits::Orientation_2 orientation_2 = pct.geom_traits().orientation_2_object();
@@ -323,7 +322,7 @@ operator()()
 
   Vertices_in_constraint_iterator vit = vertex_to_iterator[v].front();
   if(is_removable(vit)){
-    Vertices_in_constraint_iterator u = boost::prior(vit), w = boost::next(vit);
+    Vertices_in_constraint_iterator u = std::prev(vit), w = std::next(vit);
     pct.simplify(vit);
 
     if((*u)->is_removable()){
diff --git a/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h b/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
index 2280ed0cf9eb..0c5b174e92c2 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
@@ -85,7 +85,7 @@ class Polyline_constraint_hierarchy_2
     Vertex_it
     , typename Vertex_list::skip_iterator
     , Vertex_handle
-    , boost::use_default
+    , std::bidirectional_iterator_tag
     , Vertex_handle>
   {
   public:

From 891fd47365ae2d722023e45f1853db18e5b245d2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 27 Jun 2023 10:01:58 +0200
Subject: [PATCH 0411/1398] add missing test

---
 STL_Extension/test/STL_Extension/CMakeLists.txt | 1 +
 1 file changed, 1 insertion(+)

diff --git a/STL_Extension/test/STL_Extension/CMakeLists.txt b/STL_Extension/test/STL_Extension/CMakeLists.txt
index d25906091092..88bfc93ca5dc 100644
--- a/STL_Extension/test/STL_Extension/CMakeLists.txt
+++ b/STL_Extension/test/STL_Extension/CMakeLists.txt
@@ -50,6 +50,7 @@ create_single_source_cgal_program("test_Uncertain.cpp")
 create_single_source_cgal_program("test_vector.cpp")
 create_single_source_cgal_program("test_join_iterators.cpp")
 create_single_source_cgal_program("test_for_each.cpp")
+create_single_source_cgal_program("test_skiplist.cpp")
 if(TARGET CGAL::TBB_support)
   message(STATUS "Found TBB")
   target_link_libraries(test_for_each PUBLIC CGAL::TBB_support)

From 0cddd1abf5e7674ddc791aba84a5774354e0a1eb Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 27 Jun 2023 10:38:24 +0200
Subject: [PATCH 0412/1398] don't recurse

---
 BGL/examples/BGL_LCC/CMakeLists.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/BGL/examples/BGL_LCC/CMakeLists.txt b/BGL/examples/BGL_LCC/CMakeLists.txt
index f9230373e23e..84a67c0f9606 100644
--- a/BGL/examples/BGL_LCC/CMakeLists.txt
+++ b/BGL/examples/BGL_LCC/CMakeLists.txt
@@ -9,7 +9,7 @@ find_package(CGAL REQUIRED)
 
 # create a target per cppfile
 file(
-  GLOB_RECURSE cppfiles
+  GLOB cppfiles
   RELATIVE ${CMAKE_CURRENT_SOURCE_DIR}
   *.cpp)
 foreach(cppfile ${cppfiles})

From efd8b2d38b1ba5bca886fed4c5d307d7a38ecaa1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 27 Jun 2023 11:18:20 +0200
Subject: [PATCH 0413/1398] add more missing tests

---
 Arithmetic_kernel/test/Arithmetic_kernel/CMakeLists.txt     | 1 +
 BGL/test/BGL/CMakeLists.txt                                 | 1 +
 Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt | 1 +
 Mesh_3/examples/Mesh_3/CMakeLists.txt                       | 3 +++
 Mesh_3/test/Mesh_3/CMakeLists.txt                           | 1 +
 Number_types/test/Number_types/CMakeLists.txt               | 2 ++
 .../test/Point_set_processing_3/CMakeLists.txt              | 3 +++
 STL_Extension/test/STL_Extension/CMakeLists.txt             | 2 ++
 .../test/Shape_regularization/CMakeLists.txt                | 3 ++-
 Skin_surface_3/examples/Skin_surface_3/CMakeLists.txt       | 1 +
 Spatial_searching/examples/Spatial_searching/CMakeLists.txt | 2 ++
 Triangulation/examples/Triangulation/CMakeLists.txt         | 6 +++++-
 Triangulation_3/test/Triangulation_3/CMakeLists.txt         | 3 +++
 13 files changed, 27 insertions(+), 2 deletions(-)

diff --git a/Arithmetic_kernel/test/Arithmetic_kernel/CMakeLists.txt b/Arithmetic_kernel/test/Arithmetic_kernel/CMakeLists.txt
index 08d054ea54cb..d23762f811ec 100644
--- a/Arithmetic_kernel/test/Arithmetic_kernel/CMakeLists.txt
+++ b/Arithmetic_kernel/test/Arithmetic_kernel/CMakeLists.txt
@@ -39,6 +39,7 @@ if(GMP_FOUND)
   create_single_source_cgal_program("Arithmetic_kernel.cpp")
   create_single_source_cgal_program("LEDA_arithmetic_kernel.cpp")
   create_single_source_cgal_program("CORE_arithmetic_kernel.cpp")
+  create_single_source_cgal_program("GMPXX_arithmetic_kernel.cpp")
   create_single_source_cgal_program("Get_arithmetic_kernel.cpp")
 
 else()
diff --git a/BGL/test/BGL/CMakeLists.txt b/BGL/test/BGL/CMakeLists.txt
index 3b4304b5056b..0cbb7c3b9fc4 100644
--- a/BGL/test/BGL/CMakeLists.txt
+++ b/BGL/test/BGL/CMakeLists.txt
@@ -35,6 +35,7 @@ create_single_source_cgal_program("test_test_face.cpp" )
 create_single_source_cgal_program("test_Collapse_edge.cpp" )
 create_single_source_cgal_program("test_Collapse_edge_with_constraints.cpp" )
 create_single_source_cgal_program("test_graph_traits.cpp")
+create_single_source_cgal_program("test_Surface_mesh.cpp")
 create_single_source_cgal_program("test_Properties.cpp")
 create_single_source_cgal_program("bench_read_from_stream_vs_add_face_and_add_faces.cpp")
 create_single_source_cgal_program("graph_traits_inheritance.cpp" )
diff --git a/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt b/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt
index 9adb636537f1..b5adbf664ec6 100644
--- a/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt
+++ b/Linear_cell_complex/test/Linear_cell_complex/CMakeLists.txt
@@ -14,6 +14,7 @@ create_single_source_cgal_program(Linear_cell_complex_2_test.cpp ${hfiles})
 create_single_source_cgal_program(Linear_cell_complex_3_test.cpp ${hfiles})
 create_single_source_cgal_program(Linear_cell_complex_4_test.cpp ${hfiles})
 create_single_source_cgal_program(Linear_cell_complex_copy_test.cpp ${hfiles})
+create_single_source_cgal_program(LCC_3_incremental_builder_test.cpp ${hfiles})
 
 # Same targets, defining USE_COMPACT_CONTAINER_WITH_INDEX to test index version
 add_executable(Linear_cell_complex_2_test_index Linear_cell_complex_2_test.cpp ${hfiles})
diff --git a/Mesh_3/examples/Mesh_3/CMakeLists.txt b/Mesh_3/examples/Mesh_3/CMakeLists.txt
index dbcd3ea7cfa9..0b59088e04a2 100644
--- a/Mesh_3/examples/Mesh_3/CMakeLists.txt
+++ b/Mesh_3/examples/Mesh_3/CMakeLists.txt
@@ -49,6 +49,9 @@ target_link_libraries(mesh_hybrid_mesh_domain PUBLIC CGAL::Eigen3_support)
 create_single_source_cgal_program("mesh_implicit_sphere.cpp")
 target_link_libraries(mesh_implicit_sphere PUBLIC CGAL::Eigen3_support)
 
+create_single_source_cgal_program("mesh_implicit_ellipsoid.cpp")
+target_link_libraries(mesh_implicit_ellipsoid PUBLIC CGAL::Eigen3_support)
+
 create_single_source_cgal_program("mesh_implicit_sphere_variable_size.cpp")
 target_link_libraries(mesh_implicit_sphere_variable_size PUBLIC CGAL::Eigen3_support)
 
diff --git a/Mesh_3/test/Mesh_3/CMakeLists.txt b/Mesh_3/test/Mesh_3/CMakeLists.txt
index 2a8e19e1c383..5332a40702ac 100644
--- a/Mesh_3/test/Mesh_3/CMakeLists.txt
+++ b/Mesh_3/test/Mesh_3/CMakeLists.txt
@@ -55,6 +55,7 @@ create_single_source_cgal_program( "test_mesh_polyhedral_domain_with_features_de
 create_single_source_cgal_program( "test_meshing_with_one_step.cpp" )
 create_single_source_cgal_program( "test_mesh_cell_base_3.cpp")
 create_single_source_cgal_program( "test_min_edge_length.cpp")
+create_single_source_cgal_program( "implicit_functions.cpp")
 
 foreach(target
     test_boost_has_xxx
diff --git a/Number_types/test/Number_types/CMakeLists.txt b/Number_types/test/Number_types/CMakeLists.txt
index 400d76fdd1c6..b3dd989c7664 100644
--- a/Number_types/test/Number_types/CMakeLists.txt
+++ b/Number_types/test/Number_types/CMakeLists.txt
@@ -63,6 +63,8 @@ create_single_source_cgal_program("_test_valid_finite_float.cpp")
 create_single_source_cgal_program("to_interval_test.cpp")
 create_single_source_cgal_program("unsigned.cpp")
 create_single_source_cgal_program("utilities.cpp")
+create_single_source_cgal_program("Exact_rational.cpp")
+create_single_source_cgal_program("Mpzf_new.cpp")
 
 find_package( GMP )
 if( GMP_FOUND AND NOT CGAL_DISABLE_GMP )
diff --git a/Point_set_processing_3/test/Point_set_processing_3/CMakeLists.txt b/Point_set_processing_3/test/Point_set_processing_3/CMakeLists.txt
index 3f5583bb8b8b..cbd77792290f 100644
--- a/Point_set_processing_3/test/Point_set_processing_3/CMakeLists.txt
+++ b/Point_set_processing_3/test/Point_set_processing_3/CMakeLists.txt
@@ -68,6 +68,9 @@ if(TARGET CGAL::Eigen3_support)
 
   create_single_source_cgal_program("jet_pointer_as_property_map.cpp")
   target_link_libraries(jet_pointer_as_property_map PUBLIC CGAL::Eigen3_support)
+
+  create_single_source_cgal_program("psp_jet_includes.cpp")
+  target_link_libraries(psp_jet_includes PUBLIC CGAL::Eigen3_support)
 else()
   message(STATUS "NOTICE: Some tests require Eigen 3.1 (or greater), and will not be compiled.")
 endif()
diff --git a/STL_Extension/test/STL_Extension/CMakeLists.txt b/STL_Extension/test/STL_Extension/CMakeLists.txt
index 88bfc93ca5dc..efa222f2e7bc 100644
--- a/STL_Extension/test/STL_Extension/CMakeLists.txt
+++ b/STL_Extension/test/STL_Extension/CMakeLists.txt
@@ -51,6 +51,8 @@ create_single_source_cgal_program("test_vector.cpp")
 create_single_source_cgal_program("test_join_iterators.cpp")
 create_single_source_cgal_program("test_for_each.cpp")
 create_single_source_cgal_program("test_skiplist.cpp")
+create_single_source_cgal_program("test_leak.cpp")
+create_single_source_cgal_program("test_nth_element.cpp")
 if(TARGET CGAL::TBB_support)
   message(STATUS "Found TBB")
   target_link_libraries(test_for_each PUBLIC CGAL::TBB_support)
diff --git a/Shape_regularization/test/Shape_regularization/CMakeLists.txt b/Shape_regularization/test/Shape_regularization/CMakeLists.txt
index ddaa6f3ea31a..b465c7cfa16c 100644
--- a/Shape_regularization/test/Shape_regularization/CMakeLists.txt
+++ b/Shape_regularization/test/Shape_regularization/CMakeLists.txt
@@ -22,7 +22,8 @@ if(TARGET CGAL::OSQP_support)
   test_3_segments
   test_4_segments
   test_100_segments_angles
-  test_100_segments_offsets)
+  test_100_segments_offsets
+  test_cgal_solver)
 
   foreach(osqp_target ${osqp_targets})
     create_single_source_cgal_program("${osqp_target}.cpp")
diff --git a/Skin_surface_3/examples/Skin_surface_3/CMakeLists.txt b/Skin_surface_3/examples/Skin_surface_3/CMakeLists.txt
index f637565bc518..0041dc4ccd07 100644
--- a/Skin_surface_3/examples/Skin_surface_3/CMakeLists.txt
+++ b/Skin_surface_3/examples/Skin_surface_3/CMakeLists.txt
@@ -19,6 +19,7 @@ create_single_source_cgal_program("skin_surface_subdiv.cpp")
 create_single_source_cgal_program("skin_surface_subdiv_with_normals.cpp")
 create_single_source_cgal_program("union_of_balls_simple.cpp")
 create_single_source_cgal_program("union_of_balls_subdiv.cpp")
+create_single_source_cgal_program("skin_surface_retrieve_defining_weighted_points.cpp")
 
 find_package(ESBTL QUIET)
 if(ESBTL_FOUND)
diff --git a/Spatial_searching/examples/Spatial_searching/CMakeLists.txt b/Spatial_searching/examples/Spatial_searching/CMakeLists.txt
index 33a3969adc60..f9546507bd49 100644
--- a/Spatial_searching/examples/Spatial_searching/CMakeLists.txt
+++ b/Spatial_searching/examples/Spatial_searching/CMakeLists.txt
@@ -27,6 +27,8 @@ create_single_source_cgal_program("searching_polyhedron_vertices_with_fuzzy_sphe
 create_single_source_cgal_program("user_defined_point_and_distance.cpp")
 create_single_source_cgal_program("using_fair_splitting_rule.cpp")
 create_single_source_cgal_program("weighted_Minkowski_distance.cpp")
+create_single_source_cgal_program("searching_sphere_orthogonally.cpp")
+create_single_source_cgal_program("splitter_worst_cases.cpp")
 
 find_package(Eigen3 3.1.91 QUIET) #(requires 3.1.91 or greater)
 include(CGAL_Eigen3_support)
diff --git a/Triangulation/examples/Triangulation/CMakeLists.txt b/Triangulation/examples/Triangulation/CMakeLists.txt
index 3ad27172e581..bed700a1b857 100644
--- a/Triangulation/examples/Triangulation/CMakeLists.txt
+++ b/Triangulation/examples/Triangulation/CMakeLists.txt
@@ -21,6 +21,8 @@ if(TARGET CGAL::Eigen3_support)
   create_single_source_cgal_program("triangulation.cpp")
   create_single_source_cgal_program("triangulation_data_structure_dynamic.cpp")
   create_single_source_cgal_program("triangulation_data_structure_static.cpp")
+  create_single_source_cgal_program("triangulation1.cpp")
+  create_single_source_cgal_program("triangulation2.cpp")
 
   foreach(
     target
@@ -30,7 +32,9 @@ if(TARGET CGAL::Eigen3_support)
     regular_triangulation
     triangulation
     triangulation_data_structure_dynamic
-    triangulation_data_structure_static)
+    triangulation_data_structure_static
+    triangulation1
+    triangulation2)
     target_link_libraries(${target} PUBLIC CGAL::Eigen3_support)
   endforeach()
 else()
diff --git a/Triangulation_3/test/Triangulation_3/CMakeLists.txt b/Triangulation_3/test/Triangulation_3/CMakeLists.txt
index 88d63413f646..f6da43d10cea 100644
--- a/Triangulation_3/test/Triangulation_3/CMakeLists.txt
+++ b/Triangulation_3/test/Triangulation_3/CMakeLists.txt
@@ -29,6 +29,9 @@ create_single_source_cgal_program("test_static_filters.cpp")
 create_single_source_cgal_program("test_triangulation_3.cpp")
 create_single_source_cgal_program("test_io_triangulation_3.cpp")
 create_single_source_cgal_program("test_triangulation_serialization_3.cpp")
+create_single_source_cgal_program("test_dt_deterministic_3.cpp")
+create_single_source_cgal_program("test_Triangulation_with_transform_iterator.cpp")
+create_single_source_cgal_program("test_Triangulation_with_zip_iterator.cpp")
 
 if(TARGET CGAL::TBB_support)
   message(STATUS "Found TBB")

From 6ed484250ecb62259088f16e422d3739ce1e6752 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 27 Jun 2023 11:24:30 +0200
Subject: [PATCH 0414/1398] test that all .cpp in examples and test are
 compiled

---
 .../developer_scripts/test_merge_of_branch    | 27 +++++++++++++++++++
 1 file changed, 27 insertions(+)

diff --git a/Scripts/developer_scripts/test_merge_of_branch b/Scripts/developer_scripts/test_merge_of_branch
index cdf1070fa875..2b3d91ecd0b5 100755
--- a/Scripts/developer_scripts/test_merge_of_branch
+++ b/Scripts/developer_scripts/test_merge_of_branch
@@ -92,6 +92,33 @@ for i in `ls -d ^build*/examples/*/ ^build*/test/*/ ^build*/demo/^(icons|resourc
   fi
 done
 
+#check all tests/examples are tested
+echo '.. Checking if all .cpp files in examples/test are compiled...'
+CML_ERRORS=""
+for CML in `grep -L "GLOB cppfiles" */test/*/CMakeLists.txt */examples/*/CMakeLists.txt`; do
+  DIR=`dirname $CML`
+
+  if [ "Arrangement_on_surface_2/test/Arrangement_on_surface_2" = $DIR ]; then
+    continue
+  fi
+  if [ "Installation/test/Installation" = $DIR ]; then
+    continue
+  fi
+
+  for i in `ls ${DIR}/*.cpp`; do
+    f=`basename $i .cpp`
+    if ! grep -q $f ${CML}; then
+      CML_ERRORS=`echo "${CML_ERRORS}\n$i is not tested!"`
+    fi
+  done
+done
+
+
+if [ -n "${CML_ERRORS}" ]; then
+  echo -n "Some tests/examples are not tested:"
+  echo ${CML_ERRORS}
+  exit 1
+fi
 
 # check project in cmake scripts is correct
 echo '.. Checking if all CMakeLists.txt project names are correct...'

From 61ec729952daadbc7a3b31453bb11e8959967fe7 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 27 Jun 2023 12:55:18 +0100
Subject: [PATCH 0415/1398] The category is just bidirectional when the
 reference IS a reference, otherwise input

---
 BGL/examples/BGL_triangulation_2/dijkstra.cpp          |  4 ++++
 .../internal/Polyline_constraint_hierarchy_2.h         | 10 +++++-----
 2 files changed, 9 insertions(+), 5 deletions(-)

diff --git a/BGL/examples/BGL_triangulation_2/dijkstra.cpp b/BGL/examples/BGL_triangulation_2/dijkstra.cpp
index 3a1b061eb9e3..5f9ab2a55fd9 100644
--- a/BGL/examples/BGL_triangulation_2/dijkstra.cpp
+++ b/BGL/examples/BGL_triangulation_2/dijkstra.cpp
@@ -32,6 +32,10 @@ int main(int argc,char* argv[])
   VertexIndexMap vertex_id_map;
   VertexIdPropertyMap vertex_index_pmap(vertex_id_map);
   int index = 0;
+  {
+      vertex_iterator vit = vertices(tr).begin();
+      vit = std::prev(vit);
+  }
 
   for(vertex_descriptor vd : vertices(tr))
     vertex_id_map[vd] = index++;
diff --git a/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h b/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
index 0c5b174e92c2..531cc089f871 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
@@ -51,7 +51,7 @@ class Polyline_constraint_hierarchy_2
       : vertex_(vh), point_(vertex_->point()), input(input)
     {}
     const Point& point() const { return point_; }
-    Vertex_handle vertex() const { return vertex_; }
+    const Vertex_handle& vertex() const { return vertex_; }
   private:
     Vertex_handle vertex_;
     Point point_;
@@ -68,7 +68,7 @@ class Polyline_constraint_hierarchy_2
     : public boost::iterator_adaptor<
     Point_it
     , typename Vertex_list::all_iterator
-    , const Point
+    , const Point&
     >
   {
   public:
@@ -85,8 +85,8 @@ class Polyline_constraint_hierarchy_2
     Vertex_it
     , typename Vertex_list::skip_iterator
     , Vertex_handle
-    , std::bidirectional_iterator_tag
-    , Vertex_handle>
+    , boost::use_default
+    , const Vertex_handle&>
   {
   public:
     Vertex_it() : Vertex_it::iterator_adaptor_() {}
@@ -95,7 +95,7 @@ class Polyline_constraint_hierarchy_2
     bool& input() { return this->base()->input; }
   private:
     friend class boost::iterator_core_access;
-    Vertex_handle dereference() const { return this->base()->vertex(); }
+    const Vertex_handle& dereference() const { return this->base()->vertex(); }
   };
 
   typedef typename Constraint_list::iterator Constraint_it;

From be83ab856ee9f35a013b4f0929bb87e89184d953 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 27 Jun 2023 12:57:54 +0100
Subject: [PATCH 0416/1398] Undo of accidental change

---
 BGL/examples/BGL_triangulation_2/dijkstra.cpp | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/BGL/examples/BGL_triangulation_2/dijkstra.cpp b/BGL/examples/BGL_triangulation_2/dijkstra.cpp
index 5f9ab2a55fd9..3a1b061eb9e3 100644
--- a/BGL/examples/BGL_triangulation_2/dijkstra.cpp
+++ b/BGL/examples/BGL_triangulation_2/dijkstra.cpp
@@ -32,10 +32,6 @@ int main(int argc,char* argv[])
   VertexIndexMap vertex_id_map;
   VertexIdPropertyMap vertex_index_pmap(vertex_id_map);
   int index = 0;
-  {
-      vertex_iterator vit = vertices(tr).begin();
-      vit = std::prev(vit);
-  }
 
   for(vertex_descriptor vd : vertices(tr))
     vertex_id_map[vd] = index++;

From 46b756da123ad8b3a5a51ea56fc5d8fcc2014627 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 27 Jun 2023 13:24:27 +0100
Subject: [PATCH 0417/1398] We know that it is bidirectional, and we prefer
 that to using const Vertex_handle&

---
 .../internal/Polyline_constraint_hierarchy_2.h            | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h b/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
index 531cc089f871..b8bcaac8f18a 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
@@ -51,7 +51,7 @@ class Polyline_constraint_hierarchy_2
       : vertex_(vh), point_(vertex_->point()), input(input)
     {}
     const Point& point() const { return point_; }
-    const Vertex_handle& vertex() const { return vertex_; }
+    Vertex_handle vertex() const { return vertex_; }
   private:
     Vertex_handle vertex_;
     Point point_;
@@ -85,8 +85,8 @@ class Polyline_constraint_hierarchy_2
     Vertex_it
     , typename Vertex_list::skip_iterator
     , Vertex_handle
-    , boost::use_default
-    , const Vertex_handle&>
+    , std::bidirectional_iterator_tag
+    , Vertex_handle>
   {
   public:
     Vertex_it() : Vertex_it::iterator_adaptor_() {}
@@ -95,7 +95,7 @@ class Polyline_constraint_hierarchy_2
     bool& input() { return this->base()->input; }
   private:
     friend class boost::iterator_core_access;
-    const Vertex_handle& dereference() const { return this->base()->vertex(); }
+    Vertex_handle dereference() const { return this->base()->vertex(); }
   };
 
   typedef typename Constraint_list::iterator Constraint_it;

From c7eb4f9fdd4f9dcc199430685fb5b0c05e01396c Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 27 Jun 2023 13:33:48 +0100
Subject: [PATCH 0418/1398] Deal with prev() for graph_traits<T2>::iterator

---
 .../graph/internal/graph_traits_2D_triangulation_helper.h    | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h b/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h
index 8585bc33db10..0c2904243c5f 100644
--- a/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h
+++ b/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h
@@ -156,7 +156,7 @@ struct Dereference_to_handle_enforcer
       Dereference_to_handle_enforcer<Tr, Iterator, Handle>,
       Iterator /*base*/,
       Handle /*value*/,
-      boost::use_default,
+      typename std::iterator_traits<Iterator>::iterator_category,
       Handle /*reference*/
     >
 {
@@ -166,7 +166,8 @@ struct Dereference_to_handle_enforcer
 private:
   typedef Dereference_to_handle_enforcer<Tr, Iterator, Handle>                         Self;
   typedef Iterator                                                                     I;
-  typedef boost::iterator_adaptor<Self, I, value_type, boost::use_default, value_type> Base;
+  typedef typename std::iterator_traits<I>::iterator_category                          Category;
+  typedef boost::iterator_adaptor<Self, I, value_type, Category, value_type>           Base;
 
 public:
   Dereference_to_handle_enforcer() { }

From 28383a9faf348a68142014265cf5f9ed6084253d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 09:07:34 +0100
Subject: [PATCH 0419/1398] Remove a test_Surface_mesh.cpp as incomplete code

---
 BGL/test/BGL/CMakeLists.txt        |   1 -
 BGL/test/BGL/test_Surface_mesh.cpp | 125 -----------------------------
 2 files changed, 126 deletions(-)
 delete mode 100644 BGL/test/BGL/test_Surface_mesh.cpp

diff --git a/BGL/test/BGL/CMakeLists.txt b/BGL/test/BGL/CMakeLists.txt
index 0cbb7c3b9fc4..3b4304b5056b 100644
--- a/BGL/test/BGL/CMakeLists.txt
+++ b/BGL/test/BGL/CMakeLists.txt
@@ -35,7 +35,6 @@ create_single_source_cgal_program("test_test_face.cpp" )
 create_single_source_cgal_program("test_Collapse_edge.cpp" )
 create_single_source_cgal_program("test_Collapse_edge_with_constraints.cpp" )
 create_single_source_cgal_program("test_graph_traits.cpp")
-create_single_source_cgal_program("test_Surface_mesh.cpp")
 create_single_source_cgal_program("test_Properties.cpp")
 create_single_source_cgal_program("bench_read_from_stream_vs_add_face_and_add_faces.cpp")
 create_single_source_cgal_program("graph_traits_inheritance.cpp" )
diff --git a/BGL/test/BGL/test_Surface_mesh.cpp b/BGL/test/BGL/test_Surface_mesh.cpp
deleted file mode 100644
index f47f4f49f94c..000000000000
--- a/BGL/test/BGL/test_Surface_mesh.cpp
+++ /dev/null
@@ -1,125 +0,0 @@
-#define BOOST_TEST_MODULE graph_traits test
-#include <boost/test/unit_test.hpp>
-#include <boost/test/floating_point_comparison.hpp>
-
-BOOST_AUTO_TEST_CASE( edges_test )
-{
-  edge_iterator eb, ee;
-  vertex_iterator vb, ve;
-
-  Surface_fixture f;
-  boost::tie(eb, ee) = edges(f.m);
-  boost::tie(vb, ve) = vertices(f.m);
-  BOOST_CHECK(std::distance(eb, ee) == 7);
-  BOOST_CHECK(std::distance(vb, ve) == 5);
-
-  Cube_fixture cf;
-  boost::tie(eb, ee) = edges(cf.m);
-  boost::tie(vb, ve) = vertices(cf.m);
-  BOOST_CHECK(std::distance(eb, ee) == 18);
-  BOOST_CHECK(std::distance(vb, ve) == 8);
-}
-
-BOOST_AUTO_TEST_CASE( out_edges_test )
-{
-  Surface_fixture f;
-
-  BOOST_CHECK(out_degree(f.u, f.m) == 2);
-  BOOST_CHECK(out_degree(f.v, f.m) == 4);
-  std::pair<out_edge_iterator, out_edge_iterator> out = out_edges(f.v, f.m);
-  BOOST_CHECK(std::distance(out.first, out.second) == 4);
-  out_edge_iterator it = out.first;
-  while(it != out.second) {
-    // the source should always be u
-    BOOST_CHECK(source(*it, f.m) == f.v);
-    // the target never
-    BOOST_CHECK(target(*it, f.m) != f.v);
-   ++it;
-  }
-}
-
-BOOST_AUTO_TEST_CASE( in_edges_test )
-{
-  Surface_fixture f;
-  BOOST_CHECK(in_degree(f.u, f.m) == 2);
-  BOOST_CHECK(in_degree(f.x, f.m) == 3);
-  BOOST_CHECK(in_degree(f.v, f.m) == 4);
-  std::pair<in_edge_iterator, in_edge_iterator> in = in_edges(f.v, f.m);
-  BOOST_CHECK(std::distance(in.first, in.second) == 4);
-
-  in_edge_iterator it = in.first;
-  while(it != in.second) {
-    // the source should never be u
-    BOOST_CHECK(source(*it, f.m) != f.v);
-    // the target must always be u
-    BOOST_CHECK(target(*it, f.m) == f.v);
-    ++it;
-  }
-}
-
-BOOST_AUTO_TEST_CASE( in_out_equality )
-{
-  // in and out degrees must be equal for each vertex
-  Cube_fixture f;
-  for(Sm::Vertex_iterator it = f.m.vertices_begin();
-      it != f.m.vertices_end(); ++it) {
-    BOOST_CHECK(in_degree(*it, f.m) == out_degree(*it, f.m));
-  }
-}
-
-BOOST_AUTO_TEST_CASE( face_test )
-{
-  Surface_fixture f;
-  std::pair<enclosure_iterator, enclosure_iterator>
-    enc = enclosure(f.f1, f.m);
-  BOOST_CHECK(enc.first != enc.second);
-  BOOST_CHECK(std::distance(enc.first, enc.second) == 3);
-  enclosure_iterator begin = enc.first;
-  while(begin != enc.second)
-  {
-    BOOST_CHECK(face(*begin, f.m) == f.f1);
-    ++begin;
-  }
-}
-
-BOOST_AUTO_TEST_CASE( weight_map_test )
-{
-  Surface_fixture f;
-  Cube_fixture c;
-
-  CGAL::SM_edge_weight_pmap<K> wm1 = boost::get(boost::edge_weight, c.m);
-  edge_iterator eb, ee;
-  boost::test_tools::check_is_close_t check_close;
-  for(boost::tie(eb, ee) = edges(c.m); eb != ee; ++eb) {
-    BOOST_CHECK(
-      check_close(wm1[*eb], 2.0, boost::test_tools::percent_tolerance_t<double>(0.00001))
-      || check_close(wm1[*eb], 2.82843, boost::test_tools::percent_tolerance_t<double>(0.001)));
-  }
-}
-
-
-BOOST_AUTO_TEST_CASE( vertices_test )
-{
-  Surface_fixture f;
-
-  // boost::property_map<Sm,boost::vertex_index_t>::type vi_map = get(f.m, boost::vertex_index);
-
-  // vertex_iterator b,e;
-
-  // for(boost::tie(b,e) = vertices(f.m);
-  //     b!= e;
-  //     ++b){
-  //   std::cout << boost::get(vi_map, *(b)) << std::endl;
-  // }
-
-  // boost::property_map<Sm,boost::edge_weight_t>::type ew_map = get(f.m, boost::edge_weight);
-
-  // edge_iterator be, ee;
-
-  // for(boost::tie(be,ee) = edges(f.m);
-  //     be!= ee;
-  //     ++be){
-  //   std::cout << boost::get(ew_map, *(be)) << std::endl;
-  // }
-
-}

From a469d128e79f9049fea54a2b33256b3980d0bfa5 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 09:11:07 +0100
Subject: [PATCH 0420/1398] Deduplicate  file names for IO test

---
 BGL/test/BGL/test_deprecated_io.cpp | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/BGL/test/BGL/test_deprecated_io.cpp b/BGL/test/BGL/test_deprecated_io.cpp
index 65459a997fd0..8c22b9f17df6 100644
--- a/BGL/test/BGL/test_deprecated_io.cpp
+++ b/BGL/test/BGL/test_deprecated_io.cpp
@@ -21,18 +21,18 @@ int main()
   SM sm_in, sm_out;
   Point_3 p0(0,0,0), p1(1,0,0), p2(0,1,0);
   CGAL::make_triangle(p0, p1, p2, sm_out);
-  bool ok = CGAL::write_off("tmp.off", sm_out);
+  bool ok = CGAL::write_off("tmp_deprecated.off", sm_out);
   assert(ok);
-  ok = CGAL::read_off("tmp.off", sm_in);
+  ok = CGAL::read_off("tmp_deprecated.off", sm_in);
   assert(ok);
   assert(num_vertices(sm_in) == 3 && num_faces(sm_in) == 1);
   sm_in.clear();
 
-  std::ofstream os("tmp.off");
+  std::ofstream os("tmp_deprecated.off");
   ok = CGAL::write_off(os, sm_out);
   assert(ok);
   os.close();
-  std::ifstream is("tmp.off");
+  std::ifstream is("tmp_deprecated.off");
   ok = CGAL::read_off(is, sm_in);
   assert(ok);
   assert(num_vertices(sm_in) == 3 && num_faces(sm_in) == 1);
@@ -40,18 +40,18 @@ int main()
   sm_in.clear();
 #ifdef CGAL_USE_VTK
   //vtk
-  os.open("tmp.vtp");
+  os.open("tmp_deprecated.vtp");
   ok = CGAL::write_vtp(os, sm_out);
   assert(ok);
   os.close();
 
-  ok = CGAL::IO::read_VTP("tmp.vtp", sm_in);
+  ok = CGAL::IO::read_VTP("tmp_deprecated.vtp", sm_in);
   assert(ok);
   assert(num_vertices(sm_in) == 3 && num_faces(sm_in) == 1);
   sm_in.clear();
 #endif
   //wrl
-  os.open("tmp.wrl");
+  os.open("tmp_deprecated.wrl");
   ok = CGAL::write_wrl(os, sm_out);
   assert(ok);
   os.close();

From a9d99b3ece594c7965e02344065c44cdf6992b04 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 09:24:15 +0100
Subject: [PATCH 0421/1398] int -> std::size_t

---
 .../test/STL_Extension/{leak.cpp => test_leak.cpp}          | 0
 STL_Extension/test/STL_Extension/test_nth_element.cpp       | 6 +++---
 2 files changed, 3 insertions(+), 3 deletions(-)
 rename STL_Extension/test/STL_Extension/{leak.cpp => test_leak.cpp} (100%)

diff --git a/STL_Extension/test/STL_Extension/leak.cpp b/STL_Extension/test/STL_Extension/test_leak.cpp
similarity index 100%
rename from STL_Extension/test/STL_Extension/leak.cpp
rename to STL_Extension/test/STL_Extension/test_leak.cpp
diff --git a/STL_Extension/test/STL_Extension/test_nth_element.cpp b/STL_Extension/test/STL_Extension/test_nth_element.cpp
index 67077424ddfa..f9f0e8230daa 100644
--- a/STL_Extension/test/STL_Extension/test_nth_element.cpp
+++ b/STL_Extension/test/STL_Extension/test_nth_element.cpp
@@ -12,18 +12,18 @@ int test() {
   CGAL::nth_element(nbs, nbs+pivot, nbs+sizeof(nbs) / sizeof(int), cmp);
   std::cerr << "After nth_element, nbs["<< pivot << "] = " << nbs[pivot] << std::endl;
   assert(nbs[pivot]==expected_value);
-  for(int i = 0; i < sizeof(nbs) / sizeof(int); ++i) {
+  for(std::size_t i = 0; i < sizeof(nbs) / sizeof(int); ++i) {
     std::cerr << " " << nbs[i];
   }
   std::cerr << std::endl;
   for(pivot=0; pivot < 10; ++pivot)
     CGAL::nth_element(nbs, nbs+pivot, nbs+sizeof(nbs) / sizeof(int), cmp);
   std::cerr << "After sort:\n";
-  for(int i = 0; i < sizeof(nbs) / sizeof(int); ++i) {
+  for(std::size_t i = 0; i < sizeof(nbs) / sizeof(int); ++i) {
     std::cerr << " " << nbs[i];
   }
   std::cerr << std::endl;
-  for(int i = 1; i < sizeof(nbs) / sizeof(int); ++i) {
+  for(std::size_t i = 1; i < sizeof(nbs) / sizeof(int); ++i) {
     assert(nbs[i]>=nbs[i-1]);
   }
   return 0;

From e8b64d2e2807b095cca4912064d3517fd53f8426 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 09:29:22 +0100
Subject: [PATCH 0422/1398] @soesau can you please test that locally

---
 .../test/Shape_regularization/test_cgal_solver.cpp              | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Shape_regularization/test/Shape_regularization/test_cgal_solver.cpp b/Shape_regularization/test/Shape_regularization/test_cgal_solver.cpp
index 35904a073938..84a09fdda246 100644
--- a/Shape_regularization/test/Shape_regularization/test_cgal_solver.cpp
+++ b/Shape_regularization/test/Shape_regularization/test_cgal_solver.cpp
@@ -21,7 +21,7 @@ void test_cgal_solver() {
 
   using NQ = SR::Segments::Delaunay_neighbor_query_2<Traits, Segments>;
   using AR = SR::Segments::Angle_regularization_2<Traits, Segments>;
-  using QP = CGAL::CGAL_quadratic_program_traits<FT>;
+  using QP = CGAL::OSQP_quadratic_program_traits<FT>;
 
   using QP_AR = SR::QP_regularization<Traits, Segments, NQ, AR, QP>;
 

From 11a5bfc84f6e2e73282569f246c491f4661f6929 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 10:42:25 +0200
Subject: [PATCH 0423/1398] fix warnings

---
 AABB_tree/test/AABB_tree/AABB_test_util.h | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/AABB_tree/test/AABB_tree/AABB_test_util.h b/AABB_tree/test/AABB_tree/AABB_test_util.h
index 61ddd98f3bd0..fae5abfe17c6 100644
--- a/AABB_tree/test/AABB_tree/AABB_test_util.h
+++ b/AABB_tree/test/AABB_tree/AABB_test_util.h
@@ -98,6 +98,9 @@ void test_all_intersection_query_types(Tree& tree)
     std::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Ray>::Type > r = tree.any_intersection(ray);
     std::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Line>::Type > l = tree.any_intersection(line);
     std::optional< typename Tree::AABB_traits::template Intersection_and_primitive_id<Segment>::Type > s = tree.any_intersection(segment);
+    CGAL_USE(r);
+    CGAL_USE(l);
+    CGAL_USE(s);
 
     // any_intersected_primitive
     std::optional<typename Primitive::Id> optional_primitive;

From 84abdc75822c3c153ad922a0daf9701b6b3918c7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 10:43:21 +0200
Subject: [PATCH 0424/1398] add partial specialization of Output_rep for
 optional and variant

---
 Stream_support/include/CGAL/IO/io.h | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)

diff --git a/Stream_support/include/CGAL/IO/io.h b/Stream_support/include/CGAL/IO/io.h
index e287fe8e16f2..8634c38f88dd 100644
--- a/Stream_support/include/CGAL/IO/io.h
+++ b/Stream_support/include/CGAL/IO/io.h
@@ -32,6 +32,8 @@
 #include <string>
 #include <locale>
 #include <iostream>
+#include <optional>
+#include <variant>
 
 namespace CGAL {
 
@@ -186,6 +188,30 @@ class Output_rep
   std::ostream& operator()( std::ostream& os) const { return (os << t); }
 };
 
+template <class T, class F>
+class Output_rep<std::optional<T>, F>
+{
+   const std::optional<T>& t;
+
+public:
+  Output_rep( const std::optional<T>& tt) : t(tt) {}
+  std::ostream& operator()( std::ostream& os) const {
+    if (t==std::nullopt) return (os << "--");
+    return (os << t.value()); }
+};
+
+template <class ... T, class F>
+class Output_rep<std::variant<T...>, F>
+{
+   const std::variant<T...>& t;
+
+public:
+  Output_rep( const std::variant<T...>& tt) : t(tt) {}
+  std::ostream& operator()( std::ostream& os) const {
+    return (os << "--");
+  }
+};
+
 /*!
   \relates Output_rep
   \brief stream output of the \c Output_rep calls its \c operator().

From 62f22e9a6cbf09081c31e882552a011b30a99933 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 10:43:56 +0200
Subject: [PATCH 0425/1398] use oformat for optional

---
 Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h | 4 ++--
 Mesh_3/test/Mesh_3/test_meshing_utilities.h  | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
index 5d242c1a604b..ef64b75890f6 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
@@ -1149,9 +1149,9 @@ number_of_bad_elements_impl()
         const Subdomain mc_subdomain = this->r_oracle_.is_in_domain_object()(this->r_tr_.dual(mc));
 
         std::cerr << "*** Is in complex? c is marked in domain: " << this->r_c3t3_.is_in_complex(c)
-          << " / c is really in subdomain: " << c_subdomain
+          << " / c is really in subdomain: " << oformat(c_subdomain)
           << " / mc is marked in domain: " << this->r_c3t3_.is_in_complex(mc)
-          << " / mc is really in subdomain: " << mc_subdomain
+          << " / mc is really in subdomain: " << oformat(mc_subdomain)
           << std::endl;
 
 
diff --git a/Mesh_3/test/Mesh_3/test_meshing_utilities.h b/Mesh_3/test/Mesh_3/test_meshing_utilities.h
index a9c545a75553..8450754a767d 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_utilities.h
+++ b/Mesh_3/test/Mesh_3/test_meshing_utilities.h
@@ -333,13 +333,13 @@ struct Tester
           else {
             std::cerr << "\nc1 circumcenter: " << tr.dual(c1);
             std::cerr << "\nc1 is in domain: "
-                      << domain.is_in_domain_object()(tr.dual(c1));
+                      << CGAL::oformat(domain.is_in_domain_object()(tr.dual(c1)));
           }
           if(tr.is_infinite(c2)) std::cerr << "\nc2 is infinite";
           else {
             std::cerr << "\nc2 circumcenter: "<< tr.dual(c2);
             std::cerr << "\nc2 is in domain: "
-                      << domain.is_in_domain_object()(tr.dual(c2));
+                      <<  CGAL::oformat(domain.is_in_domain_object()(tr.dual(c2)));
           }
           std::cerr << std::endl;
           assert(false);

From 209549df22409830954a666ae79cd99cd2149242 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 10:44:25 +0200
Subject: [PATCH 0426/1398] use value instead of get_ptr

---
 Triangulation/include/CGAL/Delaunay_triangulation.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Triangulation/include/CGAL/Delaunay_triangulation.h b/Triangulation/include/CGAL/Delaunay_triangulation.h
index a2203ee762ef..8fa25e4d08ca 100644
--- a/Triangulation/include/CGAL/Delaunay_triangulation.h
+++ b/Triangulation/include/CGAL/Delaunay_triangulation.h
@@ -416,7 +416,7 @@ ::remove( Vertex_handle v )
     Dark_triangulation dark_side(
       maximal_dimension(),
       flat_orientation_ ?
-      std::pair<int, const Flat_orientation_d *>(current_dimension(), flat_orientation_.get_ptr())
+      std::pair<int, const Flat_orientation_d *>(current_dimension(), &flat_orientation_.value())
       : std::pair<int, const Flat_orientation_d *>((std::numeric_limits<int>::max)(), (Flat_orientation_d*) nullptr) );
 
     Dark_s_handle dark_s;

From 39878ed33a458eb1c7b7502198c456f3241c0b76 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 10:48:36 +0200
Subject: [PATCH 0427/1398] fix typos

---
 .../Point_location_test.h                     | 24 +++++++++----------
 1 file changed, 12 insertions(+), 12 deletions(-)

diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h
index eedde5108af7..72f8306f6987 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Point_location_test.h
@@ -1083,11 +1083,11 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
   // Assign and check results
   for (size_t qi = 0; qi < size; ++qi) {
     // Assign object to a face
-    Face_const_handle* fh_ref = std::get_ifFace_const_handle>(&(objs[0][qi]));
+    Face_const_handle* fh_ref = std::get_if<Face_const_handle>(&(objs[0][qi]));
     if (fh_ref) {
       for (size_t pl = 1; pl < pls_num; ++pl) {
         Face_const_handle* fh_cur =
-          std::get_ifFace_const_handle>(&(objs[pl][qi]));
+          std::get_if<Face_const_handle>(&(objs[pl][qi]));
         if (fh_cur) {
           if ((*fh_cur) != (*fh_ref)) {
             std::cout << "Error: point location number " << pl << std::endl;
@@ -1102,13 +1102,13 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
         std::cout << "Expected: a face." << std::endl;
         result += -1;
         Halfedge_const_handle* hh_cur =
-          std::get_ifHalfedge_const_handle>(&(objs[pl][qi]));
+          std::get_if<Halfedge_const_handle>(&(objs[pl][qi]));
         if (hh_cur) {
           std::cout << "Actual: a halfedge." << std::endl;
           continue;
         }
         Vertex_const_handle* vh_cur =
-          std::get_ifVertex_const_handle>(&(objs[pl][qi]));
+          std::get_if<Vertex_const_handle>(&(objs[pl][qi]));
         if (vh_cur) {
           std::cout << "Actual: a vertex." << std::endl;
           continue;
@@ -1124,11 +1124,11 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
 
     // Assign object to a halfedge
     Halfedge_const_handle* hh_ref =
-      std::get_ifHalfedge_const_handle>(&(objs[0][qi]));
+      std::get_if<Halfedge_const_handle>(&(objs[0][qi]));
     if (hh_ref) {
       for (size_t pl = 1; pl < pls_num; ++pl) {
         Halfedge_const_handle* hh_cur =
-          std::get_ifHalfedge_const_handle>(&(objs[pl][qi]));
+          std::get_if<Halfedge_const_handle>(&(objs[pl][qi]));
         if (hh_cur) {
           if (((*hh_cur) != (*hh_ref)) && ((*hh_cur)->twin() != (*hh_ref))) {
             std::cout << "Error: point location number " << pl << std::endl;
@@ -1145,13 +1145,13 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
                   << std::endl;
         result += -1;
         Face_const_handle* fh_cur =
-          std::get_ifFace_const_handle>(&(objs[pl][qi]));
+          std::get_if<Face_const_handle>(&(objs[pl][qi]));
         if (fh_cur) {
           std::cout << "Actual: a face." << std::endl;
           continue;
         }
         Vertex_const_handle* vh_cur =
-          std::get_ifVertex_const_handle>(&(objs[pl][qi]));
+          std::get_if<Vertex_const_handle>(&(objs[pl][qi]));
         if (vh_cur) {
           std::cout << "Actual: a vertex." << std::endl;
           continue;
@@ -1163,11 +1163,11 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
 
     // Assign object to a vertex
     Vertex_const_handle* vh_ref =
-      std::get_ifVertex_const_handle>(&(objs[0][qi]));
+      std::get_if<Vertex_const_handle>(&(objs[0][qi]));
     if (vh_ref) {
       for (size_t pl = 1; pl < pls_num; ++pl) {
         Vertex_const_handle* vh_cur =
-          std::get_ifVertex_const_handle>(&(objs[pl][qi]));
+          std::get_if<Vertex_const_handle>(&(objs[pl][qi]));
         if (vh_cur) {
           if ((*vh_cur) != (*vh_ref)) {
             std::cout << "Error: point location number " << pl << std::endl;
@@ -1183,13 +1183,13 @@ verify(Variants_vector objs[NUM_PL_STRATEGIES], size_t size, size_t pls_num)
         std::cout << "Expected: a vertex: "<< (*vh_ref)->point() << std::endl;
         result += -1;
         Face_const_handle* fh_cur =
-          std::get_ifFace_const_handle>(&(objs[pl][qi]));
+          std::get_if<Face_const_handle>(&(objs[pl][qi]));
         if (fh_cur) {
           std::cout << "Actual: a face." << std::endl;
           continue;
         }
         Halfedge_const_handle* hh_cur =
-          std::get_ifHalfedge_const_handle>(&(objs[pl][qi]));
+          std::get_if<Halfedge_const_handle>(&(objs[pl][qi]));
         if (hh_cur) {
           std::cout << "Actual: a halfedge." << std::endl;
           continue;

From 9526dc8661b74598d74f4a2ad5970f7ad779bde2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 10:49:26 +0200
Subject: [PATCH 0428/1398] use oformat

---
 .../include/CGAL/Curved_kernel_via_analysis_2/Point_2.h  | 9 ++++-----
 .../test/Arrangement_on_surface_2/Traits_base_test.h     | 4 ++--
 2 files changed, 6 insertions(+), 7 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
index a3c07a486906..c134c8cc9011 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
@@ -700,14 +700,13 @@ class Point_2 :
         default:
           // ASCII
           os << "Point_2(";
-
-          os << this->ptr()->_m_xy;
+          os << oformat(this->ptr()->_m_xy);
           os << ",";
-          os << this->ptr()->_m_x;
+          os << oformat(this->ptr()->_m_x);
           os << ",";
-          os << this->ptr()->_m_curve;
+          os << oformat(this->ptr()->_m_curve);
           os << ",";
-          os << this->ptr()->_m_arcno;
+          os << oformat(this->ptr()->_m_arcno);
           os << ",";
           os << this->ptr()->_m_location;
 
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_base_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_base_test.h
index 9bfe463e3bf3..696c03ebb69e 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_base_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_base_test.h
@@ -136,8 +136,8 @@ class Traits_base_test : public IO_test<Geom_traits_T> {
     typename Traits::Equal_2 equal = this->m_geom_traits.equal_2_object();
     if (equal(exp_answer, real_answer)) return true;
 
-    std::string exp_answer_str = boost::lexical_cast<std::string>(exp_answer);
-    std::string real_answer_str = boost::lexical_cast<std::string>(real_answer);
+    std::string exp_answer_str  = boost::lexical_cast<std::string>( oformat(exp_answer) );
+    std::string real_answer_str = boost::lexical_cast<std::string>( oformat(real_answer) );
     this->print_answer(exp_answer_str, real_answer_str, "x-monotone curve");
     return false;
   }

From f8323e7df8e4d646b9f8e2cbb757f27e78a2ca60 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 10:52:25 +0200
Subject: [PATCH 0429/1398] use std API

---
 .../Algebraic_curve_kernel_2.h                 |  2 +-
 ...gebraic_real_quadratic_refinement_rep_bfi.h | 18 +++++++++---------
 .../Arr_trapezoid_ric_pl_impl.h                |  4 ++--
 .../CGAL/Arrangement_2/Arr_traits_adaptor_2.h  |  2 +-
 4 files changed, 13 insertions(+), 13 deletions(-)

diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
index b249fbf4629d..01798000c555 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_curve_kernel_2.h
@@ -368,7 +368,7 @@ class Algebraic_curve_kernel_2 : public AlgebraicKernel_d_1{
        result_type operator() (const argument_type& arg) const {
          CGAL_assertion(bool(_inner));
          CGAL_assertion(bool(_outer));
-         return _outer.get()(_inner.get()(arg));
+         return _outer.value()(_inner.value()(arg));
        }
     private:
        ::std::optional<InnerFunctor> _inner;
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_quadratic_refinement_rep_bfi.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_quadratic_refinement_rep_bfi.h
index 9e1cff2083b8..06effd6b5dd5 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_quadratic_refinement_rep_bfi.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Algebraic_real_quadratic_refinement_rep_bfi.h
@@ -113,8 +113,8 @@ class Algebraic_real_quadratic_refinement_rep_bfi
         low_bfi_ = CGAL::convert_to_bfi(this->low());
 
         high_bfi_ = CGAL::convert_to_bfi(this->high());
-        f_low_bfi_ = f_bfi_.get().evaluate(low_bfi_.get());
-        f_high_bfi_ = f_bfi_.get().evaluate(high_bfi_.get());
+        f_low_bfi_ = f_bfi_.value().evaluate(low_bfi_.value());
+        f_high_bfi_ = f_bfi_.value().evaluate(high_bfi_.value());
 
     }
 
@@ -125,7 +125,7 @@ class Algebraic_real_quadratic_refinement_rep_bfi
         }
 
         m_bfi = CGAL::convert_to_bfi(m);
-        f_m_bfi = f_bfi_.get().evaluate(m_bfi);
+        f_m_bfi = f_bfi_.value().evaluate(m_bfi);
 
         if(CGAL::zero_in(f_m_bfi)) {
 
@@ -329,25 +329,25 @@ class Algebraic_real_quadratic_refinement_rep_bfi
             low_bfi_ = CGAL::convert_to_bfi(this->low());
         }
         if(! f_low_bfi_) {
-            f_low_bfi_ = f_bfi_.get().evaluate(low_bfi_.get());
+            f_low_bfi_ = f_bfi_.value().evaluate(low_bfi_.value());
         }
         if(! high_bfi_) {
             high_bfi_ = CGAL::convert_to_bfi(this->high());
         }
         if(! f_high_bfi_) {
-            f_high_bfi_ = f_bfi_.get().evaluate(high_bfi_.get());
+            f_high_bfi_ = f_bfi_.value().evaluate(high_bfi_.value());
         }
         Integer i;
         while(true) {
 
-            if(CGAL::zero_in(f_low_bfi_.get() - f_high_bfi_.get())) {
+            if(CGAL::zero_in(f_low_bfi_.value() - f_high_bfi_.value())) {
                 _set_prec(2*prec_);
                 continue;
             }
 
-            BFI denom = f_low_bfi_.get()-f_high_bfi_.get();
+            BFI denom = f_low_bfi_.value()-f_high_bfi_.value();
 
-            BFI z = f_low_bfi_.get() / denom;
+            BFI z = f_low_bfi_.value() / denom;
 
             std::pair<Integer, Integer> int_pair = _to_integer_interval(z,N);
             Integer i_low = int_pair.first;
@@ -458,7 +458,7 @@ class Algebraic_real_quadratic_refinement_rep_bfi
             f_bfi_ = _convert_polynomial_to_bfi(this->polynomial());
         }
 
-        BFI eval = f_bfi_.get().evaluate(convert_to_bfi(m));
+        BFI eval = f_bfi_.value().evaluate(convert_to_bfi(m));
 
         CGAL::Sign s = CGAL::sign(CGAL::lower(eval));
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_trapezoid_ric_pl_impl.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_trapezoid_ric_pl_impl.h
index a52086ce117f..188343887bc2 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_trapezoid_ric_pl_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_trapezoid_ric_pl_impl.h
@@ -184,7 +184,7 @@ _get_unbounded_face(const Td_map_item& item,const Point_2& p,
     Td_map_item& left_v_item = td.locate(tr.left(),td_lt);
     CGAL_assertion(td_lt == TD::POINT);
     Halfedge_const_handle he;
-    if (std::get<Td_active_vertex>(&left_v_item) != nullptr) {
+    if (std::get_if<Td_active_vertex>(&left_v_item) != nullptr) {
       Td_active_vertex v(std::get<Td_active_vertex>(left_v_item));
       he = v.cw_he();
     }
@@ -216,7 +216,7 @@ _get_unbounded_face(const Td_map_item& item,const Point_2& p,
     Td_map_item& right_v_item = td.locate(tr.right(),td_lt);
     CGAL_assertion(td_lt == TD::POINT);
     Halfedge_const_handle he;
-    if (std::get<Td_active_vertex>(&right_v_item)!= nullptr) {
+    if (std::get_if<Td_active_vertex>(&right_v_item)!= nullptr) {
       Td_active_vertex v(std::get<Td_active_vertex>(right_v_item));
       he = v.cw_he();
     }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h
index 9c74e4ef9d71..8f88642aed8a 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h
@@ -3580,7 +3580,7 @@ class Arr_traits_adaptor_2 :
       // Verify the first intersection is an overlap, remove it, and
       // recursively call.
       const X_monotone_curve_2* xcv =
-        std::get<X_monotone_curve_2>(&(intersections.front()));
+        std::get_if<X_monotone_curve_2>(&(intersections.front()));
       if (! xcv) {
         CGAL_error_msg("The first intersection is not an overlap!");
         return SMALLER;

From 63bf2a85b92f559e09c08ceacc9742fc3612ee9d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 09:54:50 +0100
Subject: [PATCH 0430/1398] Fix for deprecated warning

---
 .../include/CGAL/Qt/manipulatedFrame_impl.h    | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/GraphicsView/include/CGAL/Qt/manipulatedFrame_impl.h b/GraphicsView/include/CGAL/Qt/manipulatedFrame_impl.h
index dbf263c30d49..c1cd449d0016 100644
--- a/GraphicsView/include/CGAL/Qt/manipulatedFrame_impl.h
+++ b/GraphicsView/include/CGAL/Qt/manipulatedFrame_impl.h
@@ -93,10 +93,10 @@ illustration. */
 CGAL_INLINE_FUNCTION
 void ManipulatedFrame::checkIfGrabsMouse(int x, int y,
                                          const Camera *const camera) {
-  const int thresold = 10;
+  const int threshold = 10;
   const Vec proj = camera->projectedCoordinatesOf(position());
-  setGrabsMouse(keepsGrabbingMouse_ || ((fabs(x - proj.x) < thresold) &&
-                                        (fabs(y - proj.y) < thresold)));
+  setGrabsMouse(keepsGrabbingMouse_ || ((fabs(x - proj.x) < threshold) &&
+                                        (fabs(y - proj.y) < threshold)));
 }
 
 
@@ -219,8 +219,8 @@ int ManipulatedFrame::mouseOriginalDirection(const QMouseEvent *const e) {
 CGAL_INLINE_FUNCTION
 qreal ManipulatedFrame::deltaWithPrevPos(QMouseEvent *const event,
                                          Camera *const camera) const {
-  qreal dx = qreal(event->x() - prevPos_.x()) / camera->screenWidth();
-  qreal dy = qreal(event->y() - prevPos_.y()) / camera->screenHeight();
+  qreal dx = qreal(event->position().x() - prevPos_.x()) / camera->screenWidth();
+  qreal dy = qreal(event->position().y() - prevPos_.y()) / camera->screenHeight();
 
   qreal value = fabs(dx) > fabs(dy) ? dx : dy;
   return value * zoomSensitivity();
@@ -319,7 +319,7 @@ void ManipulatedFrame::mouseMoveEvent(QMouseEvent *const event,
 
     const qreal prev_angle =
         atan2(prevPos_.y() - trans[1], prevPos_.x() - trans[0]);
-    const qreal angle = atan2(event->y() - trans[1], event->x() - trans[0]);
+    const qreal angle = atan2(event->position().y() - trans[1], event->position().x() - trans[0]);
 
     const Vec axis =
         transformOf(camera->frame()->inverseTransformOf(Vec(0.0, 0.0, -1.0)));
@@ -336,9 +336,9 @@ void ManipulatedFrame::mouseMoveEvent(QMouseEvent *const event,
     Vec trans;
     int dir = mouseOriginalDirection(event);
     if (dir == 1)
-      trans.setValue(event->x() - prevPos_.x(), 0.0, 0.0);
+      trans.setValue(event->position().x() - prevPos_.x(), 0.0, 0.0);
     else if (dir == -1)
-      trans.setValue(0.0, prevPos_.y() - event->y(), 0.0);
+      trans.setValue(0.0, prevPos_.y() - event->position().y(), 0.0);
 
     switch (camera->type()) {
     case Camera::PERSPECTIVE:
@@ -367,7 +367,7 @@ void ManipulatedFrame::mouseMoveEvent(QMouseEvent *const event,
 
   case ROTATE: {
     Vec trans = camera->projectedCoordinatesOf(position());
-    Quaternion rot = deformedBallQuaternion(event->x(), event->y(), trans[0],
+    Quaternion rot = deformedBallQuaternion(event->position().x(), event->position().y(), trans[0],
                                             trans[1], camera);
     trans = Vec(-rot[0], -rot[1], -rot[2]);
     trans = camera->frame()->orientation().rotate(trans);

From 2a1cf486bb10c32205cf5dc167c20e7194b39a94 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 10:05:13 +0100
Subject: [PATCH 0431/1398] These .cpp files are used like .h files

---
 Triangulation/examples/Triangulation/CMakeLists.txt | 2 --
 1 file changed, 2 deletions(-)

diff --git a/Triangulation/examples/Triangulation/CMakeLists.txt b/Triangulation/examples/Triangulation/CMakeLists.txt
index bed700a1b857..d473f6864187 100644
--- a/Triangulation/examples/Triangulation/CMakeLists.txt
+++ b/Triangulation/examples/Triangulation/CMakeLists.txt
@@ -21,8 +21,6 @@ if(TARGET CGAL::Eigen3_support)
   create_single_source_cgal_program("triangulation.cpp")
   create_single_source_cgal_program("triangulation_data_structure_dynamic.cpp")
   create_single_source_cgal_program("triangulation_data_structure_static.cpp")
-  create_single_source_cgal_program("triangulation1.cpp")
-  create_single_source_cgal_program("triangulation2.cpp")
 
   foreach(
     target

From 7a26a6af583852f17559a3baf462b4283c434a54 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 10:14:48 +0100
Subject: [PATCH 0432/1398] Remove files in test that are also in examples (and
 compiled there)

---
 Mesh_3/test/Mesh_3/CMakeLists.txt         |   1 -
 Mesh_3/test/Mesh_3/implicit_functions.cpp | 303 ----------------------
 Mesh_3/test/Mesh_3/implicit_functions.h   |  36 ---
 3 files changed, 340 deletions(-)
 delete mode 100644 Mesh_3/test/Mesh_3/implicit_functions.cpp
 delete mode 100644 Mesh_3/test/Mesh_3/implicit_functions.h

diff --git a/Mesh_3/test/Mesh_3/CMakeLists.txt b/Mesh_3/test/Mesh_3/CMakeLists.txt
index 5332a40702ac..2a8e19e1c383 100644
--- a/Mesh_3/test/Mesh_3/CMakeLists.txt
+++ b/Mesh_3/test/Mesh_3/CMakeLists.txt
@@ -55,7 +55,6 @@ create_single_source_cgal_program( "test_mesh_polyhedral_domain_with_features_de
 create_single_source_cgal_program( "test_meshing_with_one_step.cpp" )
 create_single_source_cgal_program( "test_mesh_cell_base_3.cpp")
 create_single_source_cgal_program( "test_min_edge_length.cpp")
-create_single_source_cgal_program( "implicit_functions.cpp")
 
 foreach(target
     test_boost_has_xxx
diff --git a/Mesh_3/test/Mesh_3/implicit_functions.cpp b/Mesh_3/test/Mesh_3/implicit_functions.cpp
deleted file mode 100644
index 0ede1606d8b2..000000000000
--- a/Mesh_3/test/Mesh_3/implicit_functions.cpp
+++ /dev/null
@@ -1,303 +0,0 @@
-///////////////// Code for functions of famous surfaces /////////////////
-
-
-// Sphere (r=1)
-
-double sphere_function (double x, double y, double z) {
-  double x2=x*x, y2=y*y, z2=z*z;
-
-  return x2+y2+z2-1;
-}
-
-
-// Ellipsoid (r=1)
-
-double ellipsoid_function (double x, double y, double z) {
-  double x2=x*x, y2=y*y, z2=z*z;
-
-  return x2+2*y2+4*z2-1;
-}
-
-
-// Torus (r=2)
-
-double torus_function (double x, double y, double z) {
-  double x2=x*x, y2=y*y, z2=z*z;
-  double x4=x2*x2, y4=y2*y2, z4=z2*z2;
-
-  return x4  + y4  + z4  + 2 *x2*  y2  + 2*
-    x2*z2  + 2*y2*  z2  - 5 *x2  + 4* y2  - 5*z2+4;
-}
-
-
-// "Chair" (r=6)
-
-double chair_function (double x, double y, double z) {
-  double x2=x*x, y2=y*y, z2=z*z;
-  double x4=x2*x2, y4=y2*y2, z4=z2*z2;
-
-  return x4-1.2*x2*y2+3.6*x2*z2-7.50*x2+y4+3.6*y2*z2-7.50*y2+.2*z4-7.50*z2+64.0625-16.0*z*y2+16.0*x2*z;
-}
-
-
-// "Tanglecube" (r=4)
-
-double tanglecube_function (double x, double y, double z) {
-  double x2=x*x, y2=y*y, z2=z*z;
-  double x4=x2*x2, y4=y2*y2, z4=z2*z2;
-
-  return x4 - 5*x2 + y4 - 5*y2 + z4 - 5*z2 + 11.8;
-}
-
-double cube_function (double x, double y, double z){
-  if( x < 1 && -x < 1 &&
-      y < 1 && -y < 1 &&
-      z < 1 && -z < 1 )
-    return -1.;
-  return 1.;
-}
-
-// Barth's octic surface (degree 8)
-
-double octic_function (double x, double y, double z) {  // r=2
-  double x2=x*x, y2=y*y, z2=z*z;
-  double x4=x2*x2, y4=y2*y2, z4=z2*z2;
-  double x6=x4*x2, y6=y4*y2, z6=z4*z2;
-  double x8=x4*x4, y8=y4*y4, z8=z4*z4;
-
-  return 43.30495169 *x2*  y2  + 43.30495169 *x2*  z2  + 43.30495169 *y2 *    z2 + 44.36067980 *x6*  y2     + 44.36067980* x6 * z2  + 66.54101970* x4*  y4  + 66.54101970* x4 * z4    + 44.36067980 *x2 * y6  - 11.70820393* x2  - 11.70820393* y2  - 11.70820393* z2     + 37.65247585 *x4 + 37.65247585 *y4  + 37.65247585* z4  + 11.09016995* x8     + 11.09016995  *y8  + 11.09016995* z8  + 133.0820394 *x2*  y4*  z2     + 133.0820394   *x2 * y2 * z4  + 44.36067980* x2 * z6  + 44.36067980 *y6 * z2     + 66.54101970 *y4 * z4  + 44.36067980 *y2 * z6  + 133.0820394*    x4*  y2 * z2     - 91.95742756 *x4 * y2  - 91.95742756 *x4  *z2  - 91.95742756* x2 * y4     - 91.95742756 *x2  *z4  - 91.95742756* y4 *   z2  - 183.9148551* x2  *y2  *z2     - 30.65247585 *x6  - 30.65247585* y6  - 91.95742756 *y2 * z4  - 30.65247585* z6   + 1.618033988;
-}
-
-
-// "Heart"
-
-double heart_function (double x, double y, double z) {  // radius = 2
-
-  return (2*x*x+y*y+z*z-1)*(2*x*x+y*y+z*z-1)*(2*x*x+y*y+z*z-1) - (0.1*x*x+y*y)*z*z*z;
-}
-
-
-// Klein's bottle
-
-double klein_function (double x, double y, double z) {  // radius = 4
-
-  return (x*x+y*y+z*z+2*y-1)*((x*x+y*y+z*z-2*y-1)*(x*x+y*y+z*z-2*y-1)-8*z*z)+16*x*z*(x*x+y*y+z*z-2*y-1);
-}
-
-
-// Ring
-
-double ring_function (double x, double y, double z) {  // radius = ?
-  double e=0.1;
-
-  double f1 = x*x+y*y+z*z-1;
-  double f2 = x;
-
-  f1 = f1*f1-e*e;
-  f2 = f2*f2-e*e;
-
-  if (f1 < 0 && f2 < 0)
-    return -1.;
-  else if (f1 > 0 || f2 > 0)
-    return 1.;
-  else
-    return 0.;
-}
-
-
-// False knot
-
-double false_knot_function (double x, double y, double z) {  // radius = 1
-  double d=1.2, e=0.1;
-
-  double f1 = x*(x*x-z*z)-2*x*z*z-y*y+d*d-x*x-z*z-y*y;
-
-  double m2 = z*(x*x-z*z)+2*x*x*z;
-  double f2 = 4*y*y*(d*d-x*x-z*z-y*y) - m2*m2;
-
-  f1 = f1*f1-e*e;
-  f2 = f2*f2-e*e;
-
-  if (f1 < 0 && f2 < 0)
-    return -1.;
-  else if (f1 > 0 || f2 > 0)
-    return 1.;
-  else
-    return 0.;
-}
-
-
-// Knot 1
-
-void puiss(double& x, double& y, int n) {
-
-  double xx = 1, yy = 0;
-
-  while(n>0) {
-    if (n&1) {
-      double xxx = xx, yyy = yy;
-      xx = xxx*x - yyy*y;
-      yy = xxx*y + yyy*x;
-    }
-
-    double xxx = x, yyy = y;
-    x=xxx*xxx-yyy*yyy;
-    y=2*xxx*yyy;
-
-    n/=2;
-  }
-
-  x = xx;
-  y = yy;
-}
-
-
-
-double knot1_function (double a, double b, double c) {  // radius = 4
-  double e=0.1;
-
-  double x, y, z, t, den;
-  den=1+a*a+b*b+c*c;
-  x=2*a/den;
-  y=2*b/den;
-  z=2*c/den;
-  t=(1-a*a-b*b-c*c)/den;
-
-  double x3=x, y3=y, z2=z, t2=t;
-  puiss(x3,y3,3);
-  puiss(z2,t2,2);
-
-  double f1 = z2-x3;
-  double f2 = t2-y3;
-
-  f1 = f1*f1;
-  f2 = f2*f2;
-  e=e*e/(den-1);
-
-  if (f1+f2-e < 0)
-    return -1.;
-  else if (f1+f2-e > 0)
-    return 1.;
-  else
-    return 0.;
-}
-
-/*
-double knot1_function (double x, double y, double z) {  // radius = 4
-  double e=0.1;
-
-  double c1, c2, c3, c4, den;
-  den=1+x*x+y*y+z*z;
-  c1=2*x/den;
-  c2=2*y/den;
-  c3=2*z/den;
-  c4=(1-x*x-y*y-z*z)/den;
-
-  double f1 = c1*(c1*c1-c2*c2)-2*c1*c2*c2-c3*c3+c4*c4;
-  double f2 = c2*(c1*c1-c2*c2)+2*c1*c1*c2-2*c3*c4;
-
-  f1 = f1*f1;
-  f2 = f2*f2;
-  e=e*e/(den-1);
-
-  if (f1+f2-e < 0)
-    return -1.;
-  else if (f1+f2-e > 0)
-    return 1.;
-  else
-    return 0.;
-}
-*/
-
-double knot1_surf1_function (double x, double y, double z) {  // radius = 4
-  double c1, c2, c3, c4, den;
-  den=1+x*x+y*y+z*z;
-  c1=2*x/den;
-  c2=2*y/den;
-  c3=2*z/den;
-  c4=(1-x*x-y*y-z*z)/den;
-
-  return c1*(c1*c1-c2*c2)-2*c1*c2*c2-c3*c3+c4*c4;
-}
-
-
-double knot1_surf2_function (double x, double y, double z) {  // radius = 4
-  double c1, c2, c3, c4, den;
-  den=1+x*x+y*y+z*z;
-  c1=2*x/den;
-  c2=2*y/den;
-  c3=2*z/den;
-  c4=(1-x*x-y*y-z*z)/den;
-
-  return c2*(c1*c1-c2*c2)+2*c1*c1*c2-2*c3*c4;
-}
-
-
-// Knot 2
-
-double knot2_function (double a, double b, double c) {  // radius = 4
-  double e=0.025;
-
-  double x, y, z, t, den;
-  den=1+a*a+b*b+c*c;
-  x=2*a/den;
-  y=2*b/den;
-  z=2*c/den;
-  t=(1-a*a-b*b-c*c)/den;
-
-  double x7=x, y7=y, x13=x, y13=y;
-  puiss(x7,y7,7);
-  puiss(x13,y13,13);
-
-  double z3=z, t3=t;
-  puiss(z3,t3,3);
-
-  double f1t = (z3-x7)*(z3-x7+100*x13) - (t3-y7)*(t3-y7+100*y13);
-  double f2t = (z3-x7)*(t3-y7+100*y13) + (t3-y7)*(z3-x7+100*x13);
-  double f1 = f1t*(z3-x7-100*x13) - f2t*(t3-y7-100*y13);
-  double f2 = f1t*(t3-y7-100*y13) + f2t*(z3-x7-100*x13);
-
-  f1 = f1*f1;
-  f2 = f2*f2;
-  e=e*e/(den-1);
-
-  if (f1+f2-e < 0)
-    return -1.;
-  else if (f1+f2-e > 0)
-    return 1.;
-  else
-    return 0.;
-}
-
-
-// Knot 3
-
-
-double knot3_function (double a, double b, double c) {  // radius = 4
-  double e=0.025;
-
-  double x, y, z, t, den;
-  den=1+a*a+b*b+c*c;
-  x=2*a/den;
-  y=2*b/den;
-  z=2*c/den;
-  t=(1-a*a-b*b-c*c)/den;
-
-  double x19=x, y19=y, z17=z, t17=t;
-  puiss(x19,y19,19);
-  puiss(z17,t17,17);
-
-  double f1 = z17-x19;
-  double f2 = t17-y19;
-
-  f1 = f1*f1;
-  f2 = f2*f2;
-  e=e*e/(den-1);
-
-  if (f1+f2-e < 0)
-    return -1.;
-  else if (f1+f2-e > 0)
-    return 1.;
-  else
-    return 0.;
-}
diff --git a/Mesh_3/test/Mesh_3/implicit_functions.h b/Mesh_3/test/Mesh_3/implicit_functions.h
deleted file mode 100644
index f5293a87028f..000000000000
--- a/Mesh_3/test/Mesh_3/implicit_functions.h
+++ /dev/null
@@ -1,36 +0,0 @@
-///////////////// Definitions of several famous surfaces /////////////////
-double sphere_function (double, double, double);  // (c=(0,0,0), r=1)
-double ellipsoid_function (double, double, double);  // (c=(0,0,0), r=1)
-double torus_function (double, double, double);  // (c=(0,0,0), r=2)
-double chair_function (double, double, double);  // (c=(0,0,0), r=6)
-double tanglecube_function (double, double, double);  // (c=(0,0,0), r=4)
-double octic_function (double, double, double);  // (c=(0,0,0), r=2)
-double heart_function (double, double, double);  // (c=(0,0,0), r=2)
-double klein_function (double, double, double);  // (c=(0,0,0), r=4)
-double ring_function (double, double, double);  // (c=(0,0,0), r=?)
-double false_knot_function (double, double, double);  // (c=(0,0,0), r=1)
-double knot1_function (double, double, double);  // (c=(0,0,0), r=4)
-double knot2_function (double, double, double);  // (c=(0,0,0), r=4)
-double knot3_function (double, double, double);  // (c=(0,0,0), r=4)
-double cube_function (double, double, double);  // (c=(0,0,0), r=2)
-
-
-template <int Sq_radius>
-double sphere_function (double x, double y, double z) // (c=(0,0,0), r=Sq_radius)
-{
-  double x2=x*x, y2=y*y, z2=z*z;
-  return (x2+y2+z2)/Sq_radius - 1;
-}
-
-
-
-template <typename FT, typename P>
-class FT_to_point_function_wrapper : public CGAL::cpp98::unary_function<P, FT>
-{
-  typedef FT (*Implicit_function)(FT, FT, FT);
-  Implicit_function function;
-public:
-  typedef P Point;
-  FT_to_point_function_wrapper(Implicit_function f) : function(f) {}
-  FT operator()(Point p) const { return function(p.x(), p.y(), p.z()); }
-};

From d88d2157bf9357d8bac958d42e7e266ab7b82e5e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 10:16:45 +0100
Subject: [PATCH 0433/1398] Fix CMakeLists.txt

---
 Triangulation/examples/Triangulation/CMakeLists.txt | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/Triangulation/examples/Triangulation/CMakeLists.txt b/Triangulation/examples/Triangulation/CMakeLists.txt
index d473f6864187..3ad27172e581 100644
--- a/Triangulation/examples/Triangulation/CMakeLists.txt
+++ b/Triangulation/examples/Triangulation/CMakeLists.txt
@@ -30,9 +30,7 @@ if(TARGET CGAL::Eigen3_support)
     regular_triangulation
     triangulation
     triangulation_data_structure_dynamic
-    triangulation_data_structure_static
-    triangulation1
-    triangulation2)
+    triangulation_data_structure_static)
     target_link_libraries(${target} PUBLIC CGAL::Eigen3_support)
   endforeach()
 else()

From 65680a428b1c1733b64be4f5e51ad7bd0d303560 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 11:19:21 +0200
Subject: [PATCH 0434/1398] more oformat use

---
 .../Arrangement_on_surface_2/Traits_test.h    | 44 +++++++++----------
 1 file changed, 22 insertions(+), 22 deletions(-)

diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h
index fb912860f591..fe340b4a88cd 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h
@@ -733,7 +733,7 @@ min_vertex_wrapper(std::istringstream& str_stream)
   unsigned int id1, id2;
   str_stream >> id1 >> id2;
   Point_2& exp_answer = this->m_points[id2];
-  std::cout << "Test: min_vertex( " << this->m_xcurves[id1] << " ) ? "
+  std::cout << "Test: min_vertex( " << CGAL::oformat(this->m_xcurves[id1]) << " ) ? "
             << exp_answer << " ";
 
   Point_2 real_answer =
@@ -751,7 +751,7 @@ max_vertex_wrapper(std::istringstream& str_stream)
   unsigned int id1, id2;
   str_stream >> id1 >> id2;
   Point_2& exp_answer = this->m_points[id2];
-  std::cout << "Test: max_vertex( " << this->m_xcurves[id1] << " ) ? "
+  std::cout << "Test: max_vertex( " << CGAL::oformat(this->m_xcurves[id1]) << " ) ? "
             << exp_answer << " ";
 
   Point_2 real_answer =
@@ -767,7 +767,7 @@ is_vertical_wrapper(std::istringstream& str_stream)
   unsigned int id;
   str_stream >> id;
   bool exp_answer = this->get_expected_boolean(str_stream);
-  std::cout << "Test: is_vertical( " << this->m_xcurves[id] << " ) ? "
+  std::cout << "Test: is_vertical( " << CGAL::oformat(this->m_xcurves[id]) << " ) ? "
             << exp_answer << " ";
 
   bool real_answer =
@@ -789,7 +789,7 @@ compare_y_at_x_wrapper(std::istringstream& str_stream)
   str_stream >> id1 >> id2;
   unsigned int exp_answer = this->get_expected_enum(str_stream);
   std::cout << "Test: compare_y_at_x( " << this->m_points[id1] << ","
-           << this->m_xcurves[id2] << " ) ? " << exp_answer << " ";
+           << CGAL::oformat(this->m_xcurves[id2]) << " ) ? " << exp_answer << " ";
 
   unsigned int real_answer =
     this->m_geom_traits.compare_y_at_x_2_object()(this->m_points[id1],
@@ -853,8 +853,8 @@ compare_y_at_x_right_wrapper(std::istringstream& str_stream)
   unsigned int id1, id2, id3;
   str_stream >> id1 >> id2 >> id3;
   unsigned int exp_answer = this->get_expected_enum(str_stream);
-  std::cout << "Test: compare_y_at_x_right( " << this->m_xcurves[id1] << ","
-            << this->m_xcurves[id2] << ", " << this->m_points[id3] << " ) ? "
+  std::cout << "Test: compare_y_at_x_right( " << CGAL::oformat(this->m_xcurves[id1]) << ","
+            << CGAL::oformat(this->m_xcurves[id2]) << ", " << this->m_points[id3] << " ) ? "
             << exp_answer << " ";
 
   unsigned int real_answer =
@@ -891,8 +891,8 @@ equal_curves_wrapper(std::istringstream& str_stream)
   unsigned int id1, id2;
   str_stream >> id1 >> id2;
   bool exp_answer = this->get_expected_boolean(str_stream);
-  std::cout << "Test: equal( " << this->m_xcurves[id1] << ", "
-            << this->m_xcurves[id2] << " ) ? " << exp_answer << " ";
+  std::cout << "Test: equal( " << CGAL::oformat(this->m_xcurves[id1]) << ", "
+            << CGAL::oformat(this->m_xcurves[id2]) << " ) ? " << exp_answer << " ";
 
   bool real_answer = this->m_geom_traits.equal_2_object()(this->m_xcurves[id1],
                                                           this->m_xcurves[id2]);
@@ -918,7 +918,7 @@ make_x_monotone_wrapper(std::istringstream& str_stream)
 
   unsigned int id;
   str_stream >> id;
-  std::cout << "Test: make_x_monotone( " << this->m_curves[id] << " ) ? ";
+  std::cout << "Test: make_x_monotone( " << CGAL::oformat(this->m_curves[id]) << " ) ? ";
   std::vector<Make_x_monotone_result> objs;
   this->m_geom_traits.make_x_monotone_2_object()(this->m_curves[id],
                                                  std::back_inserter(objs));
@@ -979,8 +979,8 @@ intersect_wrapper(std::istringstream& str_stream)
                                            this->m_xcurves[id2],
                                            std::back_inserter(xections));
 
-  std::cout << "Test: intersect( " << this->m_xcurves[id1] << ","
-            << this->m_xcurves[id2] << " ) ? ";
+  std::cout << "Test: intersect( " << CGAL::oformat(this->m_xcurves[id1]) << ","
+            << CGAL::oformat(this->m_xcurves[id2]) << " ) ? ";
   size_t num;
   str_stream >> num;
   if (! this->compare(num, xections.size(), "size")) return false;
@@ -1031,7 +1031,7 @@ bool Traits_test<Geom_traits_T>::split_wrapper(std::istringstream& str_stream)
   unsigned int id1, id2, id3, id4;
   str_stream >> id1 >> id2 >> id3 >> id4;
   X_monotone_curve_2 cv1, cv2;
-  std::cout << "Test: split( " << this->m_xcurves[id1] << ","
+  std::cout << "Test: split( " << CGAL::oformat(this->m_xcurves[id1]) << ","
             << this->m_points[id2] << " ) ? ";
 
   this->m_geom_traits.split_2_object()(this->m_xcurves[id1],
@@ -1069,8 +1069,8 @@ are_mergeable_wrapper_imp(std::istringstream& str_stream, CGAL::Tag_true)
   unsigned int id1, id2;
   str_stream >> id1 >> id2;
   bool exp_answer = this->get_expected_boolean(str_stream);
-  std::cout << "Test: are_mergeable( " << this->m_xcurves[id1] << ", "
-            << this->m_xcurves[id2] << " ) ? " << exp_answer << " ";
+  std::cout << "Test: are_mergeable( " << CGAL::oformat(this->m_xcurves[id1]) << ", "
+            << CGAL::oformat(this->m_xcurves[id2]) << " ) ? " << exp_answer << " ";
 
   bool real_answer =
     this->m_geom_traits.are_mergeable_2_object()(this->m_xcurves[id1],
@@ -1107,8 +1107,8 @@ Traits_test<Geom_traits_T>::merge_wrapper_imp(std::istringstream& str_stream,
   unsigned int id1, id2, id;
   str_stream >> id1 >> id2 >> id;
   X_monotone_curve_2 cv;
-  std::cout << "Test: merge( " << this->m_xcurves[id1] << ", "
-            << this->m_xcurves[id2] << " ) ? " << this->m_xcurves[id] << " ";
+  std::cout << "Test: merge( " << CGAL::oformat(this->m_xcurves[id1]) << ", "
+            << CGAL::oformat(this->m_xcurves[id2]) << " ) ? " << CGAL::oformat(this->m_xcurves[id]) << " ";
 
   this->m_geom_traits.merge_2_object()(this->m_xcurves[id1],
                                        this->m_xcurves[id2], cv);
@@ -1181,7 +1181,7 @@ parameter_space_in_x_wrapper_imp(std::istringstream& str_stream,
   CGAL::Arr_curve_end cv_end = CGAL::ARR_MIN_END;
   if (curves_op) {
     cv_end = static_cast<CGAL::Arr_curve_end>(next_input.second);
-    std::cout << "Test: parameter_space_x( " << this->m_xcurves[id] << " , "
+    std::cout << "Test: parameter_space_x( " << CGAL::oformat(this->m_xcurves[id]) << " , "
               << (cv_end == CGAL::ARR_MIN_END ? "MIN_END" : "MAX_END")
               << " ) ? ";
     next_input = this->get_next_input(str_stream);
@@ -1248,8 +1248,8 @@ compare_y_near_boundary_wrapper_imp(std::istringstream& str_stream,
   assert(next_input.first == Base::CURVE_END);
   CGAL::Arr_curve_end cv_end =
     static_cast<CGAL::Arr_curve_end>(next_input.second);
-  std::cout << "Test: compare_y_near_boundary( " << this->m_xcurves[id1]
-            << " , " << this->m_xcurves[id2] << " , "
+  std::cout << "Test: compare_y_near_boundary( " << CGAL::oformat(this->m_xcurves[id1])
+            << " , " << CGAL::oformat(this->m_xcurves[id2]) << " , "
             << (cv_end == CGAL::ARR_MIN_END ? "MIN_END" : "MAX_END")
             << " ) ? ";
   next_input = this->get_next_input(str_stream);
@@ -1309,7 +1309,7 @@ parameter_space_in_y_wrapper_imp(std::istringstream& str_stream,
   CGAL::Arr_curve_end cv_end = CGAL::ARR_MIN_END;
   if (curves_op) {
     cv_end = static_cast<CGAL::Arr_curve_end>(next_input.second);
-    std::cout << "Test: parameter_space_y( " << this->m_xcurves[id] << " , "
+    std::cout << "Test: parameter_space_y( " << CGAL::oformat(this->m_xcurves[id]) << " , "
               << (cv_end == CGAL::ARR_MIN_END ? "MIN_END" : "MAX_END")
               << " ) ? ";
     next_input = this->get_next_input(str_stream);
@@ -1381,8 +1381,8 @@ compare_x_near_boundary_wrapper_imp(std::istringstream& str_stream,
   CGAL::Arr_curve_end cv_end =
     static_cast<CGAL::Arr_curve_end>(next_input.second);
 
-  std::cout << this->m_xcurves[id1] << ", "
-            << this->m_xcurves[id2] << " , "
+  std::cout << CGAL::oformat(this->m_xcurves[id1]) << ", "
+            << CGAL::oformat(this->m_xcurves[id2]) << " , "
             << this->curve_end_str(cv_end) << " ) ? ";
 
   next_input = this->get_next_input(str_stream);

From 60571eeea2d7041b0273f9de4f6a49f89e5ac866 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 10:28:17 +0100
Subject: [PATCH 0435/1398] Rename file extensions

---
 Triangulation/examples/Triangulation/triangulation.cpp        | 4 ++--
 .../Triangulation/{triangulation1.cpp => triangulation1.h}    | 0
 .../Triangulation/{triangulation2.cpp => triangulation2.h}    | 0
 3 files changed, 2 insertions(+), 2 deletions(-)
 rename Triangulation/examples/Triangulation/{triangulation1.cpp => triangulation1.h} (100%)
 rename Triangulation/examples/Triangulation/{triangulation2.cpp => triangulation2.h} (100%)

diff --git a/Triangulation/examples/Triangulation/triangulation.cpp b/Triangulation/examples/Triangulation/triangulation.cpp
index 0044bc1da770..0e791d871a28 100644
--- a/Triangulation/examples/Triangulation/triangulation.cpp
+++ b/Triangulation/examples/Triangulation/triangulation.cpp
@@ -36,8 +36,8 @@ int main()
     std::cout << "There are " << edges.size()
               << " vertices on the convex hull." << std::endl;
 
-#include "triangulation1.cpp" // See below
-#include "triangulation2.cpp"
+#include "triangulation1.h" // See below
+#include "triangulation2.h"
 
     return 0;
 }
diff --git a/Triangulation/examples/Triangulation/triangulation1.cpp b/Triangulation/examples/Triangulation/triangulation1.h
similarity index 100%
rename from Triangulation/examples/Triangulation/triangulation1.cpp
rename to Triangulation/examples/Triangulation/triangulation1.h
diff --git a/Triangulation/examples/Triangulation/triangulation2.cpp b/Triangulation/examples/Triangulation/triangulation2.h
similarity index 100%
rename from Triangulation/examples/Triangulation/triangulation2.cpp
rename to Triangulation/examples/Triangulation/triangulation2.h

From 7f7e2efefc63be0a5e37bf83fbcf9b3b5b08db62 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 11:05:13 +0100
Subject: [PATCH 0436/1398] SLS: Fix warnings

---
 .../examples/Straight_skeleton_2/extrude_skeleton.cpp          | 3 ++-
 .../examples/Straight_skeleton_2/include/CGAL/input_helpers.h  | 2 +-
 .../test_sls_weighted_polygons_with_holes.cpp                  | 2 +-
 3 files changed, 4 insertions(+), 3 deletions(-)

diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp
index 073b50964c09..0be087a09ebf 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp
@@ -12,6 +12,7 @@
 #include <CGAL/boost/graph/IO/polygon_mesh_io.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/Real_timer.h>
+#include <CGAL/Random.h>
 
 #include <boost/shared_ptr.hpp>
 
@@ -62,7 +63,7 @@ int main(int argc, char** argv)
 
   // below is only used for random weight generation
   double min_weight = 1., max_weight = 10.;
-  int seed = std::time(nullptr);
+  int seed = CGAL::get_default_random().get_seed();
 
   for(int i = 1; i < argc; ++i)
   {
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/include/CGAL/input_helpers.h b/Straight_skeleton_2/examples/Straight_skeleton_2/include/CGAL/input_helpers.h
index b42c29df4a48..35077e38c2e3 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/include/CGAL/input_helpers.h
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/include/CGAL/input_helpers.h
@@ -247,7 +247,7 @@ void generate_random_weights(const PolygonWithHoles& p,
 
     std::vector<FT> weights;
     for(auto it=c.begin(); it<c.end(); ++it)
-      weights.push_back(weight[it]);
+      weights.push_back(FT(weight[it]));
 
     return weights;
   };
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_weighted_polygons_with_holes.cpp b/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_weighted_polygons_with_holes.cpp
index 30fda42afd36..d088ba368c25 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_weighted_polygons_with_holes.cpp
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/test_sls_weighted_polygons_with_holes.cpp
@@ -54,7 +54,7 @@ int main(int argc, char** argv)
 
   int hole_n = (argc > 1) ? std::atoi(argv[1]) : 2;
   int hole_nv = (argc > 2) ? std::atoi(argv[2]) : 10;
-  int seed = (argc > 3) ? std::atoi(argv[3]) : std::time(nullptr);
+  int seed = (argc > 3) ? std::atoi(argv[3]) : CGAL::get_default_random().get_seed();
 
   CGAL::Random rnd(seed);
 

From e759fb46fab445fd269c6cf835c213a94aeda5ca Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 12:57:53 +0200
Subject: [PATCH 0437/1398] remove usage of old Object API

---
 .../include/CGAL/Arr_circular_arc_traits_2.h  |   6 +-
 .../CGAL/Arr_circular_line_arc_traits_2.h     |  14 +-
 .../CGAL/Arr_non_caching_segment_traits_2.h   |   8 +-
 .../include/CGAL/Arr_polycurve_traits_2.h     |  28 +-
 .../CGAL/Arr_rat_arc/Rational_arc_d_1.h       |   2 -
 .../test_polycurve_intersection.cpp           |  13 +-
 .../function_objects_polynomial_circular.h    |   2 +-
 .../internal_functions_on_circle_2.h          |   8 +-
 .../internal_functions_on_circular_arc_2.h    | 226 +++++-----
 .../internal_functions_on_line_arc_2.h        |  71 ++-
 .../CGAL/_test_circles_constructions.h        | 163 +++----
 .../include/CGAL/_test_circles_extention.h    |  25 +-
 .../test/Circular_kernel_2/test_Line_arc.cpp  | 220 +++++-----
 .../functor_compare_theta_3.cpp               |  18 +-
 .../intersecting_spheres.cpp                  |  12 +-
 .../Circular_kernel_3/Intersection_traits.h   |  21 -
 .../internal_functions_on_circular_arc_3.h    |  52 ++-
 .../internal_functions_on_line_arc_3.h        |  33 +-
 .../internal_functions_on_sphere_3.h          |  64 +--
 .../CGAL/_test_functionalities_on_sphere.h    |  76 ++--
 .../include/CGAL/_test_sphere_constructions.h | 403 ++++++++++--------
 21 files changed, 717 insertions(+), 748 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_circular_arc_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_circular_arc_traits_2.h
index f790bcac2460..151bcf5644a0 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_circular_arc_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_circular_arc_traits_2.h
@@ -181,14 +181,14 @@ class Arr_circular_arc_traits_2 {
       typedef std::variant<Point_2, X_monotone_curve_2>
         Make_x_monotone_result;
 
-      std::vector<CGAL::Object> objs;
+      std::vector<Make_x_monotone_result> objs;
       CircularKernel().make_x_monotone_2_object()(arc, std::back_inserter(objs));
       for (const auto& obj : objs) {
-        if (const auto* p = CGAL::object_cast<Point_2>(&obj)) {
+        if (const auto* p = std::get_if<Point_2>(&obj)) {
           *oi++ = Make_x_monotone_result(*p);
           continue;
         }
-        if (const auto* xcv = CGAL::object_cast<X_monotone_curve_2>(&obj)) {
+        if (const auto* xcv = std::get_if<X_monotone_curve_2>(&obj)) {
           *oi++ = Make_x_monotone_result(*xcv);
           continue;
         }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
index ba387ee0804e..5fb30dd0bd7a 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
@@ -251,19 +251,13 @@ namespace CGAL {
                  OutputIterator res) const
       {
         if ( const Arc1* arc1 = std::get_if<Arc1>( &A ) ) {
-          std::vector<CGAL::Object> container;
-          CircularKernel().
-            make_x_monotone_2_object()(*arc1,std::back_inserter(container));
-          return object_to_object_variant<CircularKernel, Arc1, Arc2>
-                                          (container, res);
+          return CircularKernel().
+            make_x_monotone_2_object()(*arc1, res);
         }
         else {
           const Arc2* arc2 = std::get_if<Arc2>( &A );
-          std::vector<CGAL::Object> container;
-          CircularKernel().
-            make_x_monotone_2_object()(*arc2,std::back_inserter(container));
-          return object_to_object_variant<CircularKernel, Arc1, Arc2>
-                                          (container, res);
+            return CircularKernel().
+              make_x_monotone_2_object()(*arc2, res);
         }
       }
     };
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h
index d3397599ae68..58acefda211f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_non_caching_segment_traits_2.h
@@ -224,8 +224,6 @@ class Arr_non_caching_segment_traits_2 :
                               OutputIterator oi) const
     {
       typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
 
       const Kernel& kernel = m_traits;
       auto res = kernel.intersect_2_object()(cv1, cv2);
@@ -241,7 +239,7 @@ class Arr_non_caching_segment_traits_2 :
         // If the two segments intersect at their endpoints, then the
         // multiplicity is undefined, but we deliberately ignore it for
         // efficiency reasons.
-        *oi++ = Intersection_result(Intersection_point(*p_p, 1));
+        *oi++ = Intersection_point(*p_p, 1);
         return oi;
       }
 
@@ -257,11 +255,11 @@ class Arr_non_caching_segment_traits_2 :
         // in the overlap segment
         if (m_traits.compare_endpoints_xy_2_object()(*cv_p) != cmp1) {
           auto ctr_opposite = kernel.construct_opposite_segment_2_object();
-          *oi++ = Intersection_result(ctr_opposite(*cv_p));
+          *oi++ = ctr_opposite(*cv_p);
           return oi;
         }
       }
-      *oi++ = Intersection_result(*cv_p);
+      *oi++ = *cv_p;
       return oi;
     }
   };
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
index a7aa0c32786d..488ed21dea79 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
@@ -698,8 +698,7 @@ class Arr_polycurve_traits_2 :
       typedef std::pair<Point_2, Multiplicity>        Intersection_point;
       typedef std::variant<Intersection_point, X_monotone_subcurve_2>
                                                       Intersection_base_result;
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-                                                      Intersection_result;
+
 
       const Subcurve_traits_2* geom_traits = m_poly_traits.subcurve_traits_2();
       auto cmp_y_at_x = m_poly_traits.compare_y_at_x_2_object();
@@ -744,7 +743,7 @@ class Arr_polycurve_traits_2 :
             // cv1's right endpoint equals cv2's left endpoint
             // Thus we can return this single(!) intersection point
             Intersection_point p(max_vertex(cv1[i1]), 0);
-            *oi++ = Intersection_result(p);
+            *oi++ = p;
             return oi;
           }
           dir1 == SMALLER ?
@@ -767,7 +766,7 @@ class Arr_polycurve_traits_2 :
             // cv2's right endpoint equals cv1's left endpoint
             // Thus we can return this single(!) intersection point
             Intersection_point p(max_vertex(cv2[i2]), 0);
-            *oi++ = Intersection_result(p);
+            *oi++ = p;
             return oi;
           }
 
@@ -833,7 +832,7 @@ class Arr_polycurve_traits_2 :
 
             const Intersection_point* p_p =
               std::get_if<Intersection_point>(&xection);
-            if (p_p != nullptr) *oi++ = Intersection_result(*p_p);
+            if (p_p != nullptr) *oi++ = *p_p;
           }
         }
         else if (right_coincides && left_coincides) {
@@ -871,7 +870,7 @@ class Arr_polycurve_traits_2 :
               // will be taken care of as the min_vertex of in the next
               // iteration.
               if (! equal(p_ptr->first, max_vertex(cv1[i1])))
-                *oi++ = Intersection_result(*p_ptr);
+                *oi++ = *p_ptr;
             }
           }
         }
@@ -896,11 +895,11 @@ class Arr_polycurve_traits_2 :
             // it multiplicity 0.
             if (left_res == SMALLER) {
               Intersection_point p(min_vertex(cv2[i2]), 0);
-              *oi++ = Intersection_result(p);
+              *oi++ = p;
             }
             else {
               Intersection_point p(min_vertex(cv1[i1]), 0);
-              *oi++ = Intersection_result(p);
+              *oi++ = p;
             }
           }
         }
@@ -941,7 +940,7 @@ class Arr_polycurve_traits_2 :
             (i1 != Polycurve_traits_2::INVALID_INDEX) ?
             return_point(max_vertex(cv1[i1+1]), 0) :
             return_point(max_vertex(cv1[0]), 0);
-          *oi++ = Intersection_result(ip);
+          *oi++ = ip;
         }
         else if (right_res == LARGER) {
           ip = (dir2 == SMALLER) ?
@@ -949,7 +948,7 @@ class Arr_polycurve_traits_2 :
             (i2 != Polycurve_traits_2::INVALID_INDEX) ?
             return_point(max_vertex(cv2[i2+1]), 0) :
             return_point(max_vertex(cv2[0]), 0);
-          *oi++ = Intersection_result(ip);
+          *oi++ = ip;
         }
         else if (((i1 > 0) && (dir1 == SMALLER)) ||
                  ((i1 < n1) && (dir1 != SMALLER)) ||
@@ -961,7 +960,7 @@ class Arr_polycurve_traits_2 :
             (i1 != Polycurve_traits_2::INVALID_INDEX) ?
             return_point(max_vertex(cv1[i1+1]), 0) :
             return_point(max_vertex(cv1[0]), 0);
-          *oi++ = Intersection_result(ip);
+          *oi++ = ip;
         }
         else {
           CGAL_assertion_msg((dir2 == SMALLER && i2 > 0) ||
@@ -976,7 +975,7 @@ class Arr_polycurve_traits_2 :
             (i2 != Polycurve_traits_2::INVALID_INDEX) ?
             return_point(max_vertex(cv2[i2+1]), 0) :
             return_point(max_vertex(cv2[0]), 0);
-          *oi++ = Intersection_result(ip);
+          *oi++ = ip;
         }
       }
 
@@ -989,15 +988,12 @@ class Arr_polycurve_traits_2 :
     inline OutputIterator output_ocv
     (std::vector<X_monotone_subcurve_2>& ocv, bool invert_ocv, OutputIterator oi) const
     {
-      typedef std::pair<Point_2, Multiplicity>        Intersection_point;
-      typedef std::variant<Intersection_point, X_monotone_curve_2>
-                                                      Intersection_result;
       X_monotone_curve_2 curve;
       if (invert_ocv)
         std::reverse (ocv.begin(), ocv.end());
       for (X_monotone_subcurve_2& sc : ocv)
         curve.push_back (sc);
-      *(oi ++) = Intersection_result(curve);
+      *(oi ++) = curve;
 
       ocv.clear();
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
index 345d9d89caf8..c71c4f4f268d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_rat_arc/Rational_arc_d_1.h
@@ -2038,8 +2038,6 @@ class Continuous_rational_arc_d_1:
   OutputIterator intersect(const Self& arc, OutputIterator oi,
                            const Cache& cache) const
   {
-    typedef std::variant<Intersection_point, Self>    Intersection_result;
-
     CGAL_precondition(this->is_valid());
     CGAL_precondition(this->is_continuous());
     CGAL_precondition(arc.is_valid());
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_polycurve_intersection.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_polycurve_intersection.cpp
index 2c0a68510c79..dda2f0c27c9f 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_polycurve_intersection.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_polycurve_intersection.cpp
@@ -26,18 +26,19 @@ struct Test_functor
   Test_functor (const X_monotone_polyline& reference)
     : reference (&reference) { }
 
-  void operator() (const CGAL::Object& obj) const
+  void operator()(std::pair<Point_2, unsigned int>)
   {
-     const X_monotone_polyline* poly
-      = CGAL::object_cast<X_monotone_polyline>(&obj);
-     assert(poly != nullptr); //  Intersection is not a polyline
+    assert(!"This overload should not be called");
+  }
 
+  void operator() (const X_monotone_polyline& poly) const
+  {
     typename X_monotone_polyline::Point_const_iterator
       itref = reference->points_begin(),
-      itpoly = poly->points_begin();
+      itpoly = poly.points_begin();
 
     for (; itref != reference->points_end()
-           && itpoly != poly->points_end();
+           && itpoly != poly.points_end();
          ++ itref, ++ itpoly)
       assert(*itref == *itpoly);
   }
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h
index 09696e5069c3..b68746e4a3d5 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h
@@ -308,7 +308,7 @@ namespace CircularFunctors {
     operator()(const Circular_arc_2 &A, OutputIterator res) const
       {
         typedef std::pair<bool, bool>                  relat_pos;
-        typedef std::pair< CGAL::Object, relat_pos>    Obj_descr_2;
+        typedef std::pair< Circular_arc_2, relat_pos>    Obj_descr_2;
         std::vector<Obj_descr_2> vec;
 
         CircularFunctors::advanced_make_xy_monotone<CK> (A, std::back_inserter(vec));
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circle_2.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circle_2.h
index 9ced0754a2c6..9e799e497f0d 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circle_2.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circle_2.h
@@ -120,8 +120,6 @@ namespace CircularFunctors {
                const typename CK::Circle_2 & c2,
                OutputIterator res )
   {
-    typedef typename CK2_Intersection_traits<CK, typename CK::Circle_2, typename CK::Circle_2>
-      ::type result_type;
     typedef typename CK::Algebraic_kernel            AK;
     typedef typename CK::Polynomial_for_circles_2_2  Equation;
     typedef typename CK::Root_for_circles_2_2        Root_for_circles_2_2;
@@ -129,7 +127,7 @@ namespace CircularFunctors {
     Equation e2 = CircularFunctors::get_equation<CK>(c2);
 
     if (e1 == e2) {
-      *res++ = CGAL::internal::ck2_intersection_return<result_type>(c1);
+      *res++ = c1;
       return res;
     }
 
@@ -145,9 +143,7 @@ namespace CircularFunctors {
     for ( typename solutions_container::iterator it = solutions.begin();
           it != solutions.end(); ++it )
       {
-        *res++ = CGAL::internal::ck2_intersection_return<result_type>
-          (std::make_pair(Circular_arc_point_2(it->first),
-                                            it->second ));
+        *res++ = std::make_pair(Circular_arc_point_2(it->first), it->second );
       }
 
     return res;
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h
index 61fdc75b4b6d..1e577eea5b3a 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h
@@ -536,17 +536,15 @@ namespace CircularFunctors {
                const typename CK::Circular_arc_2 &a2,
                OutputIterator res )
   {
-    typedef typename CK2_Intersection_traits<CK, typename CK::Circular_arc_2,
-                                                 typename CK::Circular_arc_2>::type result_type;
-
-    typedef std::vector<CGAL::Object> solutions_container;
     typedef typename CK::Circular_arc_2 Circular_arc_2;
+    typedef typename CK::Circle_2 Circle_2;
 
 
 #ifdef CGAL_INTERSECTION_MAP_FOR_XMONOTONIC_ARC_WITH_SAME_SUPPORTING_CIRCLE
+    typedef std::vector<CGAL::Object> solutions_container;
     // same curve
     if(a1.number() == a2.number()) {
-      *res++ = result_type(a1);
+      *res++ = a1;
        return res;
     }
 
@@ -571,14 +569,14 @@ namespace CircularFunctors {
 
     if((a1s_a2s && a1t_a2t) || (a1s_a2t && a1t_a2s)){ // Case 1
       if( (a1.supporting_circle() == a2.supporting_circle()) && ((a1.on_upper_part() && a2.on_upper_part())|| (! a1.on_upper_part() && (! a2.on_upper_part())))){
-        *res++ = result_type(a1);
+        *res++ = a1;
       } else {
         if(compare_x<CK>(a1.source(), a1.target()) == SMALLER){
-          *res++ = result_type(std::make_pair(a1.source(),1u));
-          *res++ = result_type(std::make_pair(a1.target(),1u));
+          *res++ = std::make_pair(a1.source(),1u);
+          *res++ = std::make_pair(a1.target(),1u);
         } else {
-          *res++ = result_type(std::make_pair(a1.target(),1u));
-          *res++ = result_type(std::make_pair(a1.source(),1u));
+          *res++ = std::make_pair(a1.target(),1u);
+          *res++ = std::make_pair(a1.source(),1u);
         }
       }
       return res;
@@ -625,7 +623,7 @@ namespace CircularFunctors {
 
       if(return_q){
 
-        *res++ = result_type(std::make_pair(q,1u));
+        *res++ = std::make_pair(q,1u);
         return res;
       }
 
@@ -634,16 +632,14 @@ namespace CircularFunctors {
 
     const bool sqr1_eq_sqr2 = (a1.squared_radius() == a2.squared_radius());
     const bool c1_eq_c2 = (a1.center() == a2.center());
-    typedef typename CK2_Intersection_traits<CK, typename CK::Circular_arc_2,
-                                                 typename CK::Circular_arc_2>::type result_type;
 
     if(sqr1_eq_sqr2 && c1_eq_c2) {
       if(a1.is_full()) {
-        *res++ =CGAL::internal::ck2_intersection_return<result_type>(a2);
+        *res++ = a2;
         //return res;
       }
       else if(a2.is_full()) {
-        *res++ =CGAL::internal::ck2_intersection_return<result_type>(a1);
+        *res++ = a1;
         //return res;
       } else {
         bool t2_in_a1 = has_on<CK>(a1,a2.target(),true);
@@ -656,66 +652,66 @@ namespace CircularFunctors {
               CircularFunctors::compare_xy<CK>(a1.source(), a2.source());
             if(comp < 0) {
               if(a1.source() == a2.target()) {
-                *res++ =CGAL::internal::ck2_intersection_return<result_type>(std::make_pair(a1.source(),1u));
+                *res++ = std::make_pair(a1.source(),1u);
               } else {
                 const Circular_arc_2 & arc =
                 Circular_arc_2(a1.supporting_circle(),a1.source(),a2.target());
-                *res++ =CGAL::internal::ck2_intersection_return<result_type>(arc);
+                *res++ = arc;
               }
               if(a2.source() == a1.target()) {
-                *res++ =CGAL::internal::ck2_intersection_return<result_type>(std::make_pair(a2.source(),1u));
+                *res++ = std::make_pair(a2.source(),1u);
               } else {
                 const Circular_arc_2 & arc =
                 Circular_arc_2(a1.supporting_circle(),a2.source(),a1.target());
-                *res++ =CGAL::internal::ck2_intersection_return<result_type>(arc);
+                *res++ = arc;
               }
             } else if (comp > 0) {
               if(a2.source() == a1.target()) {
-                *res++ =CGAL::internal::ck2_intersection_return<result_type>(std::make_pair(a2.source(),1u));
+                *res++ = std::make_pair(a2.source(),1u);
               } else {
                 const Circular_arc_2 & arc =
                 Circular_arc_2(a1.supporting_circle(),a2.source(),a1.target());
-                *res++ =CGAL::internal::ck2_intersection_return<result_type>(arc);
+                *res++ = arc;
               }
               if(a1.source() == a2.target()) {
-                *res++ =CGAL::internal::ck2_intersection_return<result_type>(std::make_pair(a1.source(),1u));
+                *res++ = std::make_pair(a1.source(),1u);
               } else {
                 const Circular_arc_2 & arc =
                 Circular_arc_2(a1.supporting_circle(),a1.source(),a2.target());
-                *res++ =CGAL::internal::ck2_intersection_return<result_type>(arc);
+                *res++ = arc;
               }
             } else {
-              *res++ =CGAL::internal::ck2_intersection_return<result_type>(a1);
+              *res++ = a1;
             }
           } else {
-            *res++ =CGAL::internal::ck2_intersection_return<result_type>(a2);
+            *res++ = a2;
           //return res;
           }
         }
         else if(t2_in_a1) {
           if(a1.source() == a2.target())
-            *res++ =CGAL::internal::ck2_intersection_return<result_type>(std::make_pair(a1.source(),1u));
+            *res++ = std::make_pair(a1.source(),1u);
           else {
             const Circular_arc_2 & arc =
               Circular_arc_2(a1.supporting_circle(),a1.source(),a2.target());
-            *res++ =CGAL::internal::ck2_intersection_return<result_type>(arc);
+            *res++ = arc;
           } //return res;
         } else if(s2_in_a1) {
           if(a2.source() == a1.target()) {
-            *res++ =CGAL::internal::ck2_intersection_return<result_type>(std::make_pair(a2.source(),1u));
+            *res++ = std::make_pair(a2.source(),1u);
           } else {
             const Circular_arc_2 & arc =
               Circular_arc_2(a1.supporting_circle(),a2.source(),a1.target());
-            *res++ =CGAL::internal::ck2_intersection_return<result_type>(arc);
+            *res++ = arc;
           } //return res;
         } else if(has_on<CK>(a2,a1.source(),true)) {
-          *res++ =CGAL::internal::ck2_intersection_return<result_type>(a1);
+          *res++ = a1;
         //return res;
         }
       //return res;
       }
     } else if(!c1_eq_c2) {
-      solutions_container solutions;
+      std::vector< std::variant<Circle_2, std::pair<typename CK::Circular_arc_point_2, unsigned>> > solutions;
 
 #ifdef CGAL_INTERSECTION_MAP_FOR_SUPPORTING_CIRCLES
       if(!Circular_arc_2::template
@@ -736,24 +732,23 @@ namespace CircularFunctors {
       if(solutions.size() == 0) return res;
       else {
         // The supporting circles are not the same and intersects
-        for (typename solutions_container::iterator it = solutions.begin();
-         it != solutions.end(); ++it) {
+        for (const auto& v : solutions) {
           const std::pair<typename CK::Circular_arc_point_2, unsigned>
-            *result = CGAL::object_cast
-              <std::pair<typename CK::Circular_arc_point_2, unsigned> > (&(*it));
+            *result = std::get_if
+              <std::pair<typename CK::Circular_arc_point_2, unsigned> > (&v);
 
 #ifdef CGAL_CK_TEST_BBOX_BEFORE_HAS_ON
           Bbox_2 rb = result->first.bbox();
           if(do_overlap(a1.bbox(), rb) && do_overlap(a2.bbox(),rb)){
             if (has_on<CK>(a1,result->first,true) &&
                 has_on<CK>(a2,result->first,true)) {
-              *res++ =CGAL::internal::ck2_intersection_return<result_type>(*result);
+              *res++ = *result;
             }
           }
 #else
           if (has_on<CK>(a1,result->first,true) &&
               has_on<CK>(a2,result->first,true)) {
-            *res++ =CGAL::internal::ck2_intersection_return<result_type>(*result);
+            *res++ = *result;
           }
 #endif
         }
@@ -1069,7 +1064,7 @@ template < class CK, class OutputIterator >
       A.circle_number();
 #endif
 
-      *res++ = make_object(A);
+      *res++ = A;
       return res;
     }
 
@@ -1101,8 +1096,8 @@ template < class CK, class OutputIterator >
       ca2.set_circle_number(cn);
 #endif
 
-      *res++ = make_object(ca1);
-      *res++ = make_object(ca2);
+      *res++ = ca1;
+      *res++ = ca2;
 
 #ifdef CGAL_INTERSECTION_MAP_FOR_XMONOTONIC_ARC_WITH_SAME_SUPPORTING_CIRCLE
       intersecs1.push_back(make_object(std::make_pair(x_extremal_point1,1u)));
@@ -1131,7 +1126,7 @@ template < class CK, class OutputIterator >
       unsigned int cn = ca1.circle_number();
 #endif
 
-      *res++ = make_object(ca1);
+      *res++ = ca1;
       if (cmp_end > 0) {
         // We must cut in 3 parts.
         const Circular_arc_2 &ca2 = Circular_arc_2(A.supporting_circle(),
@@ -1148,8 +1143,8 @@ template < class CK, class OutputIterator >
         ca3.set_circle_number(cn);
 #endif
 
-        *res++ = make_object(ca2);
-        *res++ = make_object(ca3);
+        *res++ = ca2;
+        *res++ = ca3;
 #ifdef CGAL_INTERSECTION_MAP_FOR_XMONOTONIC_ARC_WITH_SAME_SUPPORTING_CIRCLE
         intersecs1.push_back(make_object(std::make_pair(x_extremal_point1,1u)));
         intersecs2.push_back(make_object(std::make_pair(x_extremal_point2,1u)));
@@ -1171,7 +1166,7 @@ template < class CK, class OutputIterator >
         ca2.set_circle_number(cn);
 #endif
 
-        *res++ = make_object(ca2);
+        *res++ = ca2;
 
 #ifdef CGAL_INTERSECTION_MAP_FOR_XMONOTONIC_ARC_WITH_SAME_SUPPORTING_CIRCLE
         intersecs1.push_back(make_object(std::make_pair(x_extremal_point1,1u)));
@@ -1191,7 +1186,7 @@ template < class CK, class OutputIterator >
       unsigned int cn = ca1.circle_number();
 #endif
 
-      *res++ = make_object(ca1);
+      *res++ = ca1;
       if (cmp_end < 0) {
         const Circular_arc_2 &ca2 = Circular_arc_2(A.supporting_circle(),
                                                    x_extremal_point2,
@@ -1207,8 +1202,8 @@ template < class CK, class OutputIterator >
         ca3.set_circle_number(cn);
 #endif
 
-        *res++ = make_object(ca2);
-        *res++ = make_object(ca3);
+        *res++ = ca2;
+        *res++ = ca3;
 
 #ifdef CGAL_INTERSECTION_MAP_FOR_XMONOTONIC_ARC_WITH_SAME_SUPPORTING_CIRCLE
         intersecs1.push_back(make_object(std::make_pair(x_extremal_point2,1u)));
@@ -1232,7 +1227,7 @@ template < class CK, class OutputIterator >
         ca2.set_circle_number(cn);
 #endif
 
-        *res++ = make_object(ca2);
+        *res++ = ca2;
 
 #ifdef CGAL_INTERSECTION_MAP_FOR_XMONOTONIC_ARC_WITH_SAME_SUPPORTING_CIRCLE
         intersecs1.push_back(make_object(std::make_pair(x_extremal_point2,1u)));
@@ -1259,8 +1254,8 @@ template < class CK, class OutputIterator >
         ca2.set_circle_number(cn);
 #endif
 
-        *res++ = make_object(ca1);
-        *res++ = make_object(ca2);
+        *res++ = ca1;
+        *res++ = ca2;
 
 #ifdef CGAL_INTERSECTION_MAP_FOR_XMONOTONIC_ARC_WITH_SAME_SUPPORTING_CIRCLE
         intersecs1.push_back(make_object(std::make_pair(x_extremal_point2,1u)));
@@ -1287,8 +1282,8 @@ template < class CK, class OutputIterator >
         ca2.set_circle_number(cn);
 #endif
 
-        *res++ = make_object(ca1);
-        *res++ = make_object(ca2);
+        *res++ = ca1;
+        *res++ = ca2;
 
 #ifdef CGAL_INTERSECTION_MAP_FOR_XMONOTONIC_ARC_WITH_SAME_SUPPORTING_CIRCLE
         intersecs1.push_back(make_object(std::make_pair(x_extremal_point1,1u)));
@@ -1317,7 +1312,7 @@ template < class CK, class OutputIterator >
                             OutputIterator res )
   {
     typedef typename CK::Circular_arc_2           Circular_arc_2;
-    typedef std::pair<CGAL::Object,bool >         S_pair;
+    typedef std::pair<Circular_arc_2,bool >         S_pair;
 
 
     int cmp_begin_y = CGAL::compare
@@ -1332,13 +1327,13 @@ template < class CK, class OutputIterator >
         ((((cmp_begin_y > 0) || (cmp_end_y > 0)) && (cmp_x > 0)) ||
          (((cmp_begin_y < 0) || (cmp_end_y < 0)) &&
          (cmp_x < 0)))) {
-      *res++ = S_pair(make_object(A),(cmp_begin_y>0 || cmp_end_y>0) );
+      *res++ = S_pair(A,(cmp_begin_y>0 || cmp_end_y>0) );
       return res;
     }
 
     // Half circles
     if (cmp_begin_y == 0 && cmp_end_y == 0 && cmp_x != 0) {
-      *res++ = std::make_pair(make_object(A), cmp_x>0 );
+      *res++ = std::make_pair(A, cmp_x>0 );
       return res;
     }
 
@@ -1347,67 +1342,67 @@ template < class CK, class OutputIterator >
     if (cmp_begin_y > 0) {
 
       *res++ = S_pair
-        (make_object(Circular_arc_2(A.supporting_circle(), A.source(),
-                                    CircularFunctors::x_extremal_point<CK>
-                                    (A.supporting_circle(),true))),
+        (Circular_arc_2(A.supporting_circle(), A.source(),
+                        CircularFunctors::x_extremal_point<CK>
+                        (A.supporting_circle(),true)),
          true);
 
       if (cmp_end_y > 0) {
         // We must cut in 3 parts.
         *res++ = std::make_pair
-          (make_object(Circular_arc_2 (A.supporting_circle(),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),true),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),false))),
+          (Circular_arc_2 (A.supporting_circle(),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),true),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),false)),
            false);
 
         *res++ = std::make_pair
-          (make_object(Circular_arc_2 (A.supporting_circle(),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),false),
-                                       A.target())),
+          (Circular_arc_2 (A.supporting_circle(),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),false),
+                           A.target()),
            true);
       } else {
         *res++ = std::make_pair
-          (make_object(Circular_arc_2 (A.supporting_circle(),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),true),
-                                       A.target())),
+          (Circular_arc_2 (A.supporting_circle(),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),true),
+                           A.target()),
            false);
       }
     }
     else if (cmp_begin_y < 0) {
       // Very similar to the previous case.
       *res++ = std::make_pair
-        (make_object(Circular_arc_2 (A.supporting_circle(),
-                                     A.source(),
-                                     CircularFunctors::x_extremal_point<CK>
-                                     (A.supporting_circle(),false))),
+        (Circular_arc_2 (A.supporting_circle(),
+                         A.source(),
+                         CircularFunctors::x_extremal_point<CK>
+                         (A.supporting_circle(),false)),
          false);
 
       if (cmp_end_y < CGAL::EQUAL) {
         // We must cut in 3 parts.
         *res++ = std::make_pair
-          (make_object(Circular_arc_2 (A.supporting_circle(),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),false),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),true))) ,
+          (Circular_arc_2 (A.supporting_circle(),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),false),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),true)) ,
            true );
 
         *res++ = std::make_pair
-          (make_object(Circular_arc_2 (A.supporting_circle(),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),true),
-                                       A.target())),
+          (Circular_arc_2 (A.supporting_circle(),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),true),
+                           A.target()),
            false);
       } else {
         *res++ = std::make_pair
-          (make_object(Circular_arc_2 (A.supporting_circle(),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),false),
-                                       A.target())),
+          (Circular_arc_2 (A.supporting_circle(),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),false),
+                           A.target()),
            true);
       }
     }
@@ -1415,34 +1410,34 @@ template < class CK, class OutputIterator >
       if ( compare(A.source().x(),A.supporting_circle().center().x())< 0) {
         CGAL_assertion(cmp_end_y >= 0);
         *res++ = std::make_pair
-          (make_object(Circular_arc_2 (A.supporting_circle(),
-                                       A.source(),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),false))),
+          (Circular_arc_2 (A.supporting_circle(),
+                           A.source(),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),false)),
            false);
 
         *res++ = std::make_pair
-          (make_object(Circular_arc_2 (A.supporting_circle(),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),false),
-                                       A.target())),
+          (Circular_arc_2 (A.supporting_circle(),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),false),
+                           A.target()),
            true);
       }
       else {
         CGAL_assertion( compare(A.source().x(),A.supporting_circle().center().x())< 0);
         CGAL_assertion(cmp_end_y != LARGER);
         *res++ = std::make_pair
-          (make_object(Circular_arc_2 (A.supporting_circle(),
-                                       A.source(),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),true))),
+          (Circular_arc_2 (A.supporting_circle(),
+                           A.source(),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),true)),
            true);
 
         *res++ = std::make_pair
-          (make_object(Circular_arc_2 (A.supporting_circle(),
-                                       CircularFunctors::x_extremal_point<CK>
-                                       (A.supporting_circle(),true),
-                                       A.target())),
+          (Circular_arc_2 (A.supporting_circle(),
+                           CircularFunctors::x_extremal_point<CK>
+                           (A.supporting_circle(),true),
+                           A.target()),
            false);
       }
     }
@@ -1469,8 +1464,8 @@ advanced_make_xy_monotone( const typename CK::Circular_arc_2 &a,
 
   typedef typename CK::Circular_arc_2            Circular_arc_2;
   typedef std::pair<bool, bool>                  relat_pos;
-  typedef std::pair< CGAL::Object, bool>         Obj_descr_1;
-  typedef std::pair< CGAL::Object, relat_pos>    Obj_descr_2;
+  typedef std::pair< Circular_arc_2, bool>         Obj_descr_1;
+  typedef std::pair< Circular_arc_2, relat_pos>    Obj_descr_2;
   typedef std::vector<Obj_descr_1>               Obj_vector_1;
   typedef std::vector<Obj_descr_2>               Obj_vector_2;
 
@@ -1481,8 +1476,7 @@ advanced_make_xy_monotone( const typename CK::Circular_arc_2 &a,
   advanced_make_x_monotone<CK>(a,std::back_inserter(vec));
 
   for(unsigned int i=0;i<vec.size();i++) {
-    const Circular_arc_2 *tmp_arc =
-      CGAL::object_cast<Circular_arc_2>(&vec.at(i).first);
+    const Circular_arc_2 *tmp_arc = (&vec.at(i).first);
 
     int cmp_begin_x = CGAL::compare
       (tmp_arc->source().x(), tmp_arc->supporting_circle().center().x());
@@ -1501,22 +1495,21 @@ advanced_make_xy_monotone( const typename CK::Circular_arc_2 &a,
 
       Obj_descr_1 tmp=vec.at(i);
       Obj_descr_2 tmp1,tmp2;
-      const Circular_arc_2 *tmp_arc =
-        CGAL::object_cast<Circular_arc_2>(&tmp.first);
+      const Circular_arc_2 *tmp_arc = &tmp.first;
 
-      tmp1.first = make_object
-        (Circular_arc_2(a.supporting_circle(),tmp_arc->source(),
+      tmp1.first =
+        Circular_arc_2(a.supporting_circle(),tmp_arc->source(),
                         CircularFunctors::y_extremal_point<CK>
-                        (a.supporting_circle(),!tmp.second)));
+                        (a.supporting_circle(),!tmp.second));
 
       tmp1.second.first=tmp.second;
       tmp1.second.second= (tmp.second)? false : true ;
 
-      tmp2.first = make_object
-        (Circular_arc_2(a.supporting_circle(),
+      tmp2.first =
+        Circular_arc_2(a.supporting_circle(),
                         CircularFunctors::y_extremal_point<CK>
                         (a.supporting_circle(),!tmp.second),
-                        tmp_arc->target()));
+                        tmp_arc->target());
 
       tmp2.second.first=tmp.second;
       tmp2.second.second= (tmp.second)? true  : false ;
@@ -1528,7 +1521,6 @@ advanced_make_xy_monotone( const typename CK::Circular_arc_2 &a,
   }
 
   return res;
-
 }
 
   template <class CK>
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h
index ce3bb2e507fe..6b3d632cbfb9 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h
@@ -377,8 +377,6 @@ namespace CircularFunctors {
                const typename CK::Circle_2 & c,
                OutputIterator res )
   {
-    typedef typename CK2_Intersection_traits<CK, typename CK::Line_2, typename CK::Circle_2>
-      ::type result_type;
     typedef typename CK::Algebraic_kernel            AK;
     typedef typename CK::Polynomial_1_2              Equation_line;
     typedef typename CK::Polynomial_for_circles_2_2  Equation_circle;
@@ -399,8 +397,7 @@ namespace CircularFunctors {
     for ( typename solutions_container::iterator it = solutions.begin();
           it != solutions.end(); ++it )
       {
-        *res++ = CGAL::internal::ck2_intersection_return<result_type>
-          (std::make_pair(Circular_arc_point_2(it->first), it->second ));
+        *res++ = std::make_pair(Circular_arc_point_2(it->first), it->second );
       }
 
     return res;
@@ -412,8 +409,6 @@ namespace CircularFunctors {
                const typename CK::Line_arc_2 &a2,
                OutputIterator res )
   {
-    typedef typename CK2_Intersection_traits<CK, typename CK::Line_arc_2, typename CK::Line_arc_2>
-      ::type result_type;
     typedef typename CK::Circular_arc_point_2  Circular_arc_point_2;
     typedef typename CK::Line_arc_2               Line_arc_2;
     typedef typename CK::Point_2                  Point_2;
@@ -427,13 +422,13 @@ namespace CircularFunctors {
 
     if((a1s_a2s && a1t_a2t) || (a1s_a2t && a1t_a2s)){
 
-      *res++ = result_type(a1);
+      *res++ = a1;
       return res;
     }
     if(a1s_a2s || a1s_a2t || a1t_a2s || a1t_a2t) {
       if(! LinearFunctors::non_oriented_equal<CK>(a1.supporting_line(),a2.supporting_line())){
-        if(a1s_a2s || a1s_a2t) *res++ = CGAL::internal::ck2_intersection_return<result_type>(std::make_pair(a1.source(), 1u));
-        if(a1t_a2s || a1t_a2t) *res++ = CGAL::internal::ck2_intersection_return<result_type>(std::make_pair(a1.target(), 1u));
+        if(a1s_a2s || a1s_a2t) *res++ = std::make_pair(a1.source(), 1u);
+        if(a1t_a2s || a1t_a2t) *res++ = std::make_pair(a1.target(), 1u);
       return res;
       }
     }
@@ -445,16 +440,13 @@ namespace CircularFunctors {
         int comparison = compare_xy(a2.left(),a1.right());
         if(comparison < 0){
           if(compare_xy(a1.right(),a2.right()) <= 0){
-            *res++ = CGAL::internal::ck2_intersection_return<result_type>
-              (Line_arc_2(a1.supporting_line(), a2.left(), a1.right() ));
+            *res++ = Line_arc_2(a1.supporting_line(), a2.left(), a1.right() );
           } else{
-            *res++ = CGAL::internal::ck2_intersection_return<result_type>
-              (Line_arc_2(a1.supporting_line(), a2.left(), a2.right() ));
+            *res++ = Line_arc_2(a1.supporting_line(), a2.left(), a2.right() );
           }
         }
         else if (comparison == 0){
-          *res++ =CGAL::internal::ck2_intersection_return<result_type>
-            ( std::make_pair(a2.left(),1u));
+          *res++ = std::make_pair(a2.left(),1u);
         }
         return res;
       }
@@ -462,17 +454,14 @@ namespace CircularFunctors {
         int comparison = compare_xy(a1.left(),a2.right());
         if(comparison < 0){
           if(compare_xy(a1.right(),a2.right()) <= 0){
-            *res++ = CGAL::internal::ck2_intersection_return<result_type>
-              (Line_arc_2(a1.supporting_line(), a1.left(), a1.right() ));
+            *res++ = Line_arc_2(a1.supporting_line(), a1.left(), a1.right() );
           }
           else{
-            *res++ = CGAL::internal::ck2_intersection_return<result_type>
-              (Line_arc_2(a1.supporting_line(), a1.left(), a2.right() ));
+            *res++ = Line_arc_2(a1.supporting_line(), a1.left(), a2.right() );
           }
         }
         else if (comparison == 0){
-          *res++ = CGAL::internal::ck2_intersection_return<result_type>
-            ( std::make_pair(a1.left(),1u));
+          *res++ = std::make_pair(a1.left(),1u);
         }
         return res;
       }
@@ -491,7 +480,7 @@ namespace CircularFunctors {
          CircularFunctors::compare_xy<CK>(intersect_point, a1.target())) &&
         (CircularFunctors::compare_xy<CK>(intersect_point, a2.source()) !=
          CircularFunctors::compare_xy<CK>(intersect_point, a2.target())))
-      *res++ = CGAL::internal::ck2_intersection_return<result_type>(std::make_pair(intersect_point, 1u));
+      *res++ = std::make_pair(intersect_point, 1u);
 
     return res;
   }
@@ -528,7 +517,7 @@ namespace CircularFunctors {
     for (typename solutions_container::iterator it = solutions.begin();
          it != solutions.end(); ++it) {
       if(std::visit(Has_on_visitor<CK, typename CK::Line_arc_2>(&l), *it))
-        *res++ = *it;
+        *res++ = std::get<std::pair<typename CK::Circular_arc_point_2, unsigned>>(*it);
     }
 
     return res;
@@ -565,11 +554,11 @@ namespace CircularFunctors {
 
     if((ls_cs && lt_ct) || (ls_ct && lt_cs)){ // Case 0
       if (compare_xy<CK>(l.source(), l.target()) == SMALLER){
-        *res++ = result_type(std::make_pair(l.source(), 1u));
-        *res++ = result_type(std::make_pair(l.target(), 1u));
+        *res++ = std::make_pair(l.source(), 1u);
+        *res++ = std::make_pair(l.target(), 1u);
       } else {
-        *res++ = result_type(std::make_pair(l.target(), 1u));
-        *res++ = result_type(std::make_pair(l.source(), 1u));
+        *res++ = std::make_pair(l.target(), 1u);
+        *res++ = std::make_pair(l.source(), 1u);
       }
       return res;
     } else if (ls_cs || lt_ct || ls_ct || lt_cs) {
@@ -594,20 +583,20 @@ namespace CircularFunctors {
       }
 
       if( (CircularFunctors::compare_x<CK>(p,q) == EQUAL) || CircularFunctors::point_in_x_range<CK>(p,r,q)){ // Case 1
-        *res++ = result_type(std::make_pair(q,1u));
+        *res++ = std::make_pair(q,1u);
         return res;
       }
        else if(c.on_upper_part()){ // Case 2
         if(CircularFunctors::compare_x<CK>(r,q) == LARGER){
           if(CircularFunctors::orientation<CK>(q,r,p) == RIGHT_TURN   // Case 2
              || CircularFunctors::compare_y_to_right<CK>(l,c,q) == LARGER){ // Case 3a
-            *res++ = result_type(std::make_pair(q,1u));
+            *res++ = std::make_pair(q,1u);
             return res;
           }
         } else {
           if(CircularFunctors::orientation<CK>(r,q,p) == RIGHT_TURN  // Case 2
           || CircularFunctors::compare_y_to_left<CK>(l,c,q) == LARGER){ // Case 3c
-            *res++ = result_type(std::make_pair(q,1u));
+            *res++ = std::make_pair(q,1u);
             return res;
           }
         }
@@ -615,13 +604,13 @@ namespace CircularFunctors {
         if(CircularFunctors::compare_x<CK>(r,q) == LARGER){
           if (CircularFunctors::orientation<CK>(q,r,p) == LEFT_TURN // Case 2
             || CircularFunctors::compare_y_to_right<CK>(l,c,q) == SMALLER){  // Case 3b
-            *res++ = result_type(std::make_pair(q,1u));
+            *res++ = std::make_pair(q,1u);
             return res;
           }
         } else {
           if(CircularFunctors::orientation<CK>(r,q,p) == LEFT_TURN
              || CircularFunctors::compare_y_to_left<CK>(l,c,q) == SMALLER){ // Case 3d
-            *res++ = result_type(std::make_pair(q,1u));
+            *res++ = std::make_pair(q,1u);
             return res;
           }
         }
@@ -629,7 +618,7 @@ namespace CircularFunctors {
 
       typename CK::Linear_kernel::Bounded_side bs = CircularFunctors::bounded_side<CK>(c.supporting_circle(),p);
       if(bs == ON_BOUNDED_SIDE){
-        *res++ = result_type(std::make_pair(q,1u));
+        *res++ = std::make_pair(q,1u);
         return res;
       } else { //Case 4b
         typedef std::vector<typename CK2_Intersection_traits<CK, typename CK::Line_2, typename CK::Circle_2>::type>
@@ -639,12 +628,12 @@ namespace CircularFunctors {
                                                std::back_inserter(solutions) );
 
         if(CircularFunctors::compare_x<CK>(r,q) == LARGER){
-          *res++ = result_type(std::make_pair(q,1u));
+          *res++ = std::make_pair(q,1u);
           *res++ = solutions.back();
           return res;
         } else {
           *res++ = solutions.front();
-          *res++ = result_type(std::make_pair(q,1u));
+          *res++ = std::make_pair(q,1u);
           return res;
         }
 
@@ -684,7 +673,7 @@ namespace CircularFunctors {
       if(std::visit(Has_on_visitor<CK, typename CK::Line_arc_2>(&l), *it) &&
          std::visit(Has_on_visitor<CK, typename CK::Circular_arc_2>(&c), *it) )
       {
-        *res++ = *it;
+        *res++ = std::get<std::pair<typename CK::Circular_arc_point_2, unsigned>>(*it);
       }
     }
     return res;
@@ -746,11 +735,9 @@ namespace CircularFunctors {
     typedef typename CK::Circular_arc_point_2  Circular_arc_point_2;
     typedef typename CK::Point_2                  Point_2;
     typedef typename CK::Line_2                   Line_2;
-    typedef typename CK::Line_arc_2               Line_arc_2;
-    typedef typename CK2_Intersection_traits<CK, Line_2, Line_arc_2>::type result_type;
 
     if(LinearFunctors::non_oriented_equal<CK>(l, la.supporting_line())) {
-      *res++ = result_type(la);
+      *res++ = la;
     }
 
     typename Intersection_traits<CK, Line_2, Line_2>::result_type
@@ -764,7 +751,7 @@ namespace CircularFunctors {
 
     if (CircularFunctors::compare_xy<CK>(intersect_point, la.source()) !=
          CircularFunctors::compare_xy<CK>(intersect_point, la.target()))
-      *res++ = result_type(std::make_pair(intersect_point, 1u));
+      *res++ = std::make_pair(intersect_point, 1u);
 
     return res;
   }
@@ -791,7 +778,7 @@ namespace CircularFunctors {
     for (typename solutions_container::const_iterator it = solutions.begin();
          it != solutions.end(); ++it) {
       if(std::visit(Has_on_visitor<CK, Circular_arc_2>(&c), *it))
-        *res++ = *it;
+        *res++ = std::get<std::pair<typename CK::Circular_arc_point_2, unsigned>>(*it);
     }
     return res;
   }
@@ -810,7 +797,7 @@ namespace CircularFunctors {
   make_x_monotone( const typename CK::Line_arc_2 &A,
                    OutputIterator res )
   {
-    *res++ = make_object(A);
+    *res++ = A;
     return res;
   }
 
diff --git a/Circular_kernel_2/test/Circular_kernel_2/include/CGAL/_test_circles_constructions.h b/Circular_kernel_2/test/Circular_kernel_2/include/CGAL/_test_circles_constructions.h
index 6755d3634447..dfc1c688ea80 100644
--- a/Circular_kernel_2/test/Circular_kernel_2/include/CGAL/_test_circles_constructions.h
+++ b/Circular_kernel_2/test/Circular_kernel_2/include/CGAL/_test_circles_constructions.h
@@ -19,6 +19,17 @@
 #include <cassert>
 #include <CGAL/use.h>
 
+template <class Expected, class V>
+bool assign_variant(Expected& e, const V& v)
+{
+  if (std::get_if<Expected>(&v) != nullptr)
+  {
+    e = std::get<Expected>(v);
+    return true;
+  }
+  return false;
+}
+
 //#define typename
 template <class CK>
 void _test_circle_construct(CK ck)
@@ -33,8 +44,9 @@ void _test_circle_construct(CK ck)
   typedef typename CK::FT                          FT;
   typedef typename CK::Construct_circle_2          Construct_circle_2;
   typedef typename CK::Intersect_2   Intersect_2;
+  typedef std::variant<Circular_arc_2, Circle_2, std::pair<Circular_arc_point_2, unsigned >> Intersection_result;
   typedef typename CK::Make_x_monotone_2           Make_x_monotone_2;
-  typedef typename CK::Make_xy_monotone_2           Make_xy_monotone_2;
+  typedef typename CK::Make_xy_monotone_2          Make_xy_monotone_2;
   typedef typename CK::Split_2                     Split_2;
   typedef typename CK::Get_equation                Get_equation;
   typedef typename CK::Compare_xy_2                Compare_xy_2;
@@ -107,8 +119,7 @@ void _test_circle_construct(CK ck)
   Circle_2 circ_intersections_2_2(center_circ_intersections_2_2,
                                   circ_intersection_2_1_r);
 
-  std::vector< CGAL::Object >
-    vector_for_intersection_1, vector_for_intersection_1l;
+  std::vector< Intersection_result > vector_for_intersection_1, vector_for_intersection_1l;
 
   theConstruct_intersect_2(circ_intersections_2_1,
                            circ_intersections_2_2,
@@ -120,12 +131,12 @@ void _test_circle_construct(CK ck)
         assert(theDo_intersect_2(circ_intersections_2_1, circ_intersections_2_1));
         assert(do_intersect(circ_intersections_2_1, circ_intersections_2_1));
   std::pair<Circular_arc_point_2, unsigned > the_pair;
-  assert(assign(the_pair, vector_for_intersection_1[0]));
-  assert(assign(the_pair, vector_for_intersection_1l[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_1[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_1l[0]));
   Circular_arc_point_2 first = the_pair.first;
   std::cout << first << std::endl;
-  assert(assign(the_pair, vector_for_intersection_1[1]));
-  assert(assign(the_pair, vector_for_intersection_1l[1]));
+  assert(assign_variant(the_pair, vector_for_intersection_1[1]));
+  assert(assign_variant(the_pair, vector_for_intersection_1l[1]));
   Circular_arc_point_2 second = the_pair.first;
   std::cout << second << std::endl;
   Compare_xy_2 theCompare_xy_2 = ck.compare_xy_2_object();
@@ -146,14 +157,13 @@ void _test_circle_construct(CK ck)
           CGAL::circle_intersect<CK>(circ_intersections_2_1,
                                      circ_intersections_2_3,
                                      false);
-  std::vector< CGAL::Object >
-    vector_for_intersection_2;
+  std::vector< Intersection_result > vector_for_intersection_2;
   theConstruct_intersect_2(circ_intersections_2_1,
                            circ_intersections_2_3,
                            std::back_inserter(vector_for_intersection_2));
         assert(theDo_intersect_2(circ_intersections_2_1, circ_intersections_2_3));
   assert(vector_for_intersection_2.size() == 1);
-  assign(the_pair, vector_for_intersection_2[0]);
+  assign_variant(the_pair, vector_for_intersection_2[0]);
   assert(the_pair.first == the_intersection_point_1);
   assert(the_pair.first == the_intersection_point_2);
 
@@ -163,14 +173,13 @@ void _test_circle_construct(CK ck)
   Circle_2 circ_intersections_2_3_bis(center_circ_intersections_2_3_bis,
                                       circ_intersection_2_1_r
                                       * circ_intersection_2_1_r * 4);
-  std::vector< CGAL::Object >
-    vector_for_intersection_2_bis;
+  std::vector< Intersection_result > vector_for_intersection_2_bis;
   theConstruct_intersect_2(circ_intersections_2_1,
                            circ_intersections_2_3_bis,
                            std::back_inserter(vector_for_intersection_2_bis));
         assert(theDo_intersect_2(circ_intersections_2_1, circ_intersections_2_3_bis));
   assert(vector_for_intersection_2_bis.size() == 1);
-  assign(the_pair, vector_for_intersection_2_bis[0]);
+  assign_variant(the_pair, vector_for_intersection_2_bis[0]);
   assert(the_pair.second == 2u);
 
 
@@ -202,8 +211,7 @@ void _test_circle_construct(CK ck)
   //////////////  std::cout << "OH NO!" << std::endl;
   //////////////} else std::cout << "OK" << std::endl;
 
-  std::vector< CGAL::Object >
-    vector_for_intersection_3;
+  std::vector< Intersection_result > vector_for_intersection_3;
   theConstruct_intersect_2(circ_arc_2_1_part_low,
                            circ_arc_2_1_low_part_high,
                            std::back_inserter(vector_for_intersection_3));
@@ -211,12 +219,12 @@ void _test_circle_construct(CK ck)
 
   /////////////std::cout << "The size: " << vector_for_intersection_3.size() << std::endl;
   assert(vector_for_intersection_3.size() == 2);
-  assign(the_pair, vector_for_intersection_3[0]);
+  assign_variant(the_pair, vector_for_intersection_3[0]);
   assert(the_pair.second == 1u);
   assert(the_pair.first == CGAL::circle_intersect<CK>(circ_intersections_2_1,
                                                       circ_intersections_2_1_low,
                                                       true));
-  assign(the_pair, vector_for_intersection_3[1]);
+  assign_variant(the_pair, vector_for_intersection_3[1]);
   assert(the_pair.second == 1u);
   assert(the_pair.first == CGAL::circle_intersect<CK>(circ_intersections_2_1,
                                                       circ_intersections_2_1_low,
@@ -270,23 +278,21 @@ void _test_circle_construct(CK ck)
          );
 
   std::cout << "Intersection : same circular arc" << std::endl;
-  std::vector< CGAL::Object >
-    vector_for_intersection_the_same_arc;
+  std::vector< Intersection_result > vector_for_intersection_the_same_arc;
   theConstruct_intersect_2(circ_arc_overlap_1,
                             circ_arc_overlap_1,
                             std::back_inserter(vector_for_intersection_the_same_arc));
   assert(theDo_intersect_2(circ_arc_overlap_1, circ_arc_overlap_1));
   assert(vector_for_intersection_the_same_arc.size() == 1);
   Circular_arc_2 res_same;
-  assert(assign(res_same, vector_for_intersection_the_same_arc[0]));
+  assert(assign_variant(res_same, vector_for_intersection_the_same_arc[0]));
   assert(res_same.source() == circ_arc_overlap_1.source());
   assert(res_same.target() == circ_arc_overlap_1.target());
 
   std::cout << "Intersection : overlap on a circular arc" << std::endl;
   Circular_arc_2 circ_arc_in_overlap;
   Circular_arc_2 circ_arc_in_overlap_2;
-  std::vector< CGAL::Object >
-    vector_for_intersection_overlap_1_1;
+  std::vector< Intersection_result > vector_for_intersection_overlap_1_1;
   theConstruct_intersect_2(circ_arc_overlap_2,
                             circ_arc_overlap_1,
                             std::back_inserter(vector_for_intersection_overlap_1_1));
@@ -295,30 +301,29 @@ void _test_circle_construct(CK ck)
                                     line_arc_overlap_low_left, true,
                                     line_arc_overlap_low_right, false);
   assert(vector_for_intersection_overlap_1_1.size() == 1);
-  assign(circ_arc_in_overlap, vector_for_intersection_overlap_1_1[0]);
+  assign_variant(circ_arc_in_overlap, vector_for_intersection_overlap_1_1[0]);
   assert(circ_arc_in_overlap.source() == circ_arc_overlap_result.source());
   assert(circ_arc_in_overlap.target() == circ_arc_overlap_result.target());
-  std::vector< CGAL::Object >
-    vector_for_intersection_overlap_1_2;
+  std::vector< Intersection_result > vector_for_intersection_overlap_1_2;
   theConstruct_intersect_2(circ_arc_overlap_2,
                             circ_arc_overlap_1,
                             std::back_inserter(vector_for_intersection_overlap_1_2));
   assert(theDo_intersect_2(circ_arc_overlap_2, circ_arc_overlap_1));
   assert(vector_for_intersection_overlap_1_2.size() == 1);
-  assign(circ_arc_in_overlap, vector_for_intersection_overlap_1_2[0]);
+  assign_variant(circ_arc_in_overlap, vector_for_intersection_overlap_1_2[0]);
   assert(circ_arc_in_overlap.source() == circ_arc_overlap_result.source());
   assert(circ_arc_in_overlap.target() == circ_arc_overlap_result.target());
 
 
   std::cout << "Intersection : overlap in one point" << std::endl;
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_overlap_2_1;
   theConstruct_intersect_2(circ_arc_overlap_1,
                            circ_arc_overlap_3,
                            std::back_inserter(vector_for_intersection_overlap_2_1));
   assert(theDo_intersect_2(circ_arc_overlap_1, circ_arc_overlap_3));
   assert(vector_for_intersection_overlap_2_1.size() == 1);
-  assign(the_pair, vector_for_intersection_overlap_2_1[0]);
+  assign_variant(the_pair, vector_for_intersection_overlap_2_1[0]);
   std::cout << "x = " << the_pair.first.x() << " the result must be = " <<
     center_circ_intersection_2_1_x + circ_intersection_2_1_r * sqrt2
             << std::endl;
@@ -337,14 +342,14 @@ void _test_circle_construct(CK ck)
   assert(square(the_pair.first.y() - RT(center_circ_intersection_2_1_y))
          == (circ_intersection_2_1_r * circ_intersection_2_1_r / typename CK::RT(2)));
 
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_overlap_2_2;
   theConstruct_intersect_2(circ_arc_overlap_3,
                            circ_arc_overlap_1,
                            std::back_inserter(vector_for_intersection_overlap_2_2));
         assert(theDo_intersect_2(circ_arc_overlap_3, circ_arc_overlap_1));
   assert(vector_for_intersection_overlap_2_2.size() == 1);
-  assign(the_pair, vector_for_intersection_overlap_2_2[0]);
+  assign_variant(the_pair, vector_for_intersection_overlap_2_2[0]);
   std::cout << "x = " << the_pair.first.x() << " the result must be = " <<
     center_circ_intersection_2_1_x + circ_intersection_2_1_r * sqrt2 << std::endl;
 
@@ -362,7 +367,7 @@ void _test_circle_construct(CK ck)
 
   std::cout << "Intersection : overlap in two points: " <<
     "lower_part_arc , upper_part_arc" << std::endl;
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_overlap_3_1;
   theConstruct_intersect_2(circ_arc_overlap_upper_part,
                            circ_arc_overlap_lower_part,
@@ -370,13 +375,13 @@ void _test_circle_construct(CK ck)
   assert(theDo_intersect_2(circ_arc_overlap_upper_part, circ_arc_overlap_lower_part));
   assert(vector_for_intersection_overlap_3_1.size() == 2);
 
-  assign(the_pair, vector_for_intersection_overlap_3_1[0]);
+  assign_variant(the_pair, vector_for_intersection_overlap_3_1[0]);
   assert(the_pair.first == circ_arc_overlap_lower_part.source());
   //assert(the_pair.first.is_left());
-  assign(the_pair, vector_for_intersection_overlap_3_1[1]);
+  assign_variant(the_pair, vector_for_intersection_overlap_3_1[1]);
   assert(the_pair.first == circ_arc_overlap_lower_part.target());
   //assert(!the_pair.first.is_left());
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_overlap_3_2;
   theConstruct_intersect_2(circ_arc_overlap_lower_part,
                            circ_arc_overlap_upper_part,
@@ -384,10 +389,10 @@ void _test_circle_construct(CK ck)
         assert(theDo_intersect_2(circ_arc_overlap_lower_part, circ_arc_overlap_upper_part));
 
   assert(vector_for_intersection_overlap_3_2.size() == 2);
-  assign(the_pair, vector_for_intersection_overlap_3_2[0]);
+  assign_variant(the_pair, vector_for_intersection_overlap_3_2[0]);
   assert(the_pair.first == circ_arc_overlap_lower_part.source());
   //assert(the_pair.first.is_left());
-  assign(the_pair, vector_for_intersection_overlap_3_2[1]);
+  assign_variant(the_pair, vector_for_intersection_overlap_3_2[1]);
   assert(the_pair.first == circ_arc_overlap_lower_part.target());
   //assert(!the_pair.first.is_left());
 
@@ -404,20 +409,20 @@ void _test_circle_construct(CK ck)
   Circle_2 circ_intersections_2_4(center_circ_intersections_2_4,
                                   circ_intersection_2_1_r
                                   * circ_intersection_2_1_r);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_1_1;
   theConstruct_intersect_2(circ_arc_no_x_monotone_1,
                             circ_intersections_2_4,
                             std::back_inserter(vector_for_intersection_no_x_monotone_1_1));
   assert(theDo_intersect_2(circ_arc_no_x_monotone_1, circ_intersections_2_4));
   assert(vector_for_intersection_no_x_monotone_1_1.size() == 2);
-  assert(assign(the_pair, vector_for_intersection_no_x_monotone_1_1[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_no_x_monotone_1_1[0]));
   assert(the_pair.first == CGAL::circle_intersect<CK>(circ_intersections_2_1,
                                                       circ_intersections_2_4,
                                                       true));
   assert(the_pair.second == 1u);
   //assert(the_pair.first.is_left());
-  assert(assign(the_pair, vector_for_intersection_no_x_monotone_1_1[1]));
+  assert(assign_variant(the_pair, vector_for_intersection_no_x_monotone_1_1[1]));
   assert(the_pair.first == CGAL::circle_intersect<CK>(circ_intersections_2_1,
                                                       circ_intersections_2_4,
                                                       false));
@@ -432,14 +437,14 @@ void _test_circle_construct(CK ck)
   Circle_2 circ_intersections_2_5(center_circ_intersections_2_5,
                                   circ_intersection_2_1_r
                                   * circ_intersection_2_1_r);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_1_2;
   theConstruct_intersect_2(circ_arc_no_x_monotone_1,
                             circ_intersections_2_5,
                             std::back_inserter(vector_for_intersection_no_x_monotone_1_2));
   assert(theDo_intersect_2(circ_arc_no_x_monotone_1, circ_intersections_2_5));
   assert(vector_for_intersection_no_x_monotone_1_2.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_no_x_monotone_1_2[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_no_x_monotone_1_2[0]));
   assert(the_pair.first == CGAL::circle_intersect<CK>(circ_intersections_2_1,
                                                       circ_intersections_2_5,
                                                       true));
@@ -454,14 +459,14 @@ void _test_circle_construct(CK ck)
   Circle_2 circ_intersections_2_6(center_circ_intersections_2_6,
                                   circ_intersection_2_1_r
                                   * circ_intersection_2_1_r);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_1_3;
   theConstruct_intersect_2(circ_arc_no_x_monotone_1,
                             circ_intersections_2_6,
                             std::back_inserter(vector_for_intersection_no_x_monotone_1_3));
   assert(theDo_intersect_2(circ_arc_no_x_monotone_1, circ_intersections_2_6));
   assert(vector_for_intersection_no_x_monotone_1_3.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_no_x_monotone_1_3[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_no_x_monotone_1_3[0]));
   assert(the_pair.first == CGAL::circle_intersect<CK>(circ_intersections_2_1,
                                                       circ_intersections_2_6,
                                                       true));
@@ -475,14 +480,14 @@ void _test_circle_construct(CK ck)
   Circle_2 circ_intersections_2_7(center_circ_intersections_2_7,
                                   circ_intersection_2_1_r
                                   * circ_intersection_2_1_r);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_1_4;
   theConstruct_intersect_2(circ_arc_no_x_monotone_1,
                             circ_intersections_2_7,
                             std::back_inserter(vector_for_intersection_no_x_monotone_1_4));
   assert(theDo_intersect_2(circ_arc_no_x_monotone_1, circ_intersections_2_7));
   assert(vector_for_intersection_no_x_monotone_1_4.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_no_x_monotone_1_4[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_no_x_monotone_1_4[0]));
   assert(the_pair.first == CGAL::circle_intersect<CK>(circ_intersections_2_1,
                                                       circ_intersections_2_7,
                                                       true));
@@ -495,14 +500,14 @@ void _test_circle_construct(CK ck)
   Circle_2 circ_intersections_2_8(center_circ_intersections_2_8,
                                   circ_intersection_2_1_r
                                   * circ_intersection_2_1_r * 4);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_1_5;
   theConstruct_intersect_2(circ_arc_no_x_monotone_1,
                             circ_intersections_2_8,
                             std::back_inserter(vector_for_intersection_no_x_monotone_1_5));
   assert(theDo_intersect_2(circ_arc_no_x_monotone_1, circ_intersections_2_8));
   assert(vector_for_intersection_no_x_monotone_1_5.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_no_x_monotone_1_5[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_no_x_monotone_1_5[0]));
   assert(the_pair.first == CGAL::circle_intersect<CK>(circ_intersections_2_1,
                                                       circ_intersections_2_8,
                                                       true));
@@ -515,14 +520,14 @@ void _test_circle_construct(CK ck)
   Circle_2 circ_intersections_2_9(center_circ_intersections_2_9,
                                   circ_intersection_2_1_r
                                   * circ_intersection_2_1_r * 4);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_1_6;
   theConstruct_intersect_2(circ_arc_no_x_monotone_1,
                             circ_intersections_2_9,
                             std::back_inserter(vector_for_intersection_no_x_monotone_1_6));
   assert(theDo_intersect_2(circ_arc_no_x_monotone_1, circ_intersections_2_9));
   assert(vector_for_intersection_no_x_monotone_1_6.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_no_x_monotone_1_6[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_no_x_monotone_1_6[0]));
   assert(the_pair.first == CGAL::circle_intersect<CK>(circ_intersections_2_1,
                                                       circ_intersections_2_9,
                                                       true));
@@ -535,14 +540,14 @@ void _test_circle_construct(CK ck)
   Circular_arc_2 circ_arc_no_x_monotone_2(circ_intersections_2_1,
                                           line_arc_overlap_low_left, true,
                                           line_arc_overlap_low_left, false);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_2_1;
   theConstruct_intersect_2(circ_arc_no_x_monotone_1,
                             circ_arc_no_x_monotone_2,
                             std::back_inserter(vector_for_intersection_no_x_monotone_2_1));
   assert(theDo_intersect_2(circ_arc_no_x_monotone_1, circ_arc_no_x_monotone_2));
   assert(vector_for_intersection_no_x_monotone_2_1.size() == 1);
-  assert(assign(circ_arc_in_overlap, vector_for_intersection_no_x_monotone_2_1[0]));
+  assert(assign_variant(circ_arc_in_overlap, vector_for_intersection_no_x_monotone_2_1[0]));
   assert(circ_arc_in_overlap.is_x_monotone());
   assert(circ_arc_in_overlap.source() == circ_arc_overlap_result.source());
   assert(circ_arc_in_overlap.target() == circ_arc_overlap_result.target());
@@ -556,14 +561,14 @@ void _test_circle_construct(CK ck)
                                            line_arc_overlap_low_left, true);
 
 
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_2_2;
   theConstruct_intersect_2(circ_arc_no_x_monotone_1,
                             circ_arc_no_x_monotone_3,
                             std::back_inserter(vector_for_intersection_no_x_monotone_2_2));
   assert(theDo_intersect_2(circ_arc_no_x_monotone_1, circ_arc_no_x_monotone_3));
   assert(vector_for_intersection_no_x_monotone_2_2.size() == 1);
-  assert(assign(circ_arc_in_overlap, vector_for_intersection_no_x_monotone_2_2[0]));
+  assert(assign_variant(circ_arc_in_overlap, vector_for_intersection_no_x_monotone_2_2[0]));
   assert(circ_arc_in_overlap.source() == circ_arc_no_x_monotone_1.source());
   assert(circ_arc_in_overlap.target() == circ_arc_no_x_monotone_3.target());
 
@@ -575,7 +580,7 @@ void _test_circle_construct(CK ck)
   Circular_arc_2 circ_arc_no_x_monotone_4(circ_intersections_2_1,
                                            line_arc_overlap_low_left, true,
                                            line_arc_overlap_low_right, true);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_2_3;
   theConstruct_intersect_2(circ_arc_no_x_monotone_1,
                             circ_arc_no_x_monotone_4,
@@ -586,9 +591,9 @@ void _test_circle_construct(CK ck)
   std::cout << vector_for_intersection_no_x_monotone_2_3.size() << std::endl;
 
   assert(vector_for_intersection_no_x_monotone_2_3.size() == 2);
-  assert(assign(circ_arc_in_overlap,
+  assert(assign_variant(circ_arc_in_overlap,
                 vector_for_intersection_no_x_monotone_2_3[0]));
-  assert(assign(the_pair,
+  assert(assign_variant(the_pair,
                 vector_for_intersection_no_x_monotone_2_3[1]));
   assert(circ_arc_in_overlap.is_x_monotone());
   assert(circ_arc_in_overlap.source()
@@ -605,7 +610,7 @@ void _test_circle_construct(CK ck)
   Circular_arc_2 circ_arc_no_x_monotone_5(circ_intersections_2_1,
                                           line_arc_overlap_low_right, true,
                                           line_arc_overlap_low_left, true);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_2_4;
   theConstruct_intersect_2(circ_arc_no_x_monotone_4,
                            circ_arc_no_x_monotone_5,
@@ -613,10 +618,10 @@ void _test_circle_construct(CK ck)
         assert(theDo_intersect_2(circ_arc_no_x_monotone_4, circ_arc_no_x_monotone_5));
   std::cout << vector_for_intersection_no_x_monotone_2_4.size() << std::endl;
   assert(vector_for_intersection_no_x_monotone_2_4.size() == 2);
-  assert(assign(the_pair, vector_for_intersection_no_x_monotone_2_4[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_no_x_monotone_2_4[0]));
   assert(the_pair.first == circ_arc_no_x_monotone_5.target());
   assert(the_pair.second == 1u);
-  assert(assign(the_pair, vector_for_intersection_no_x_monotone_2_4[1]));
+  assert(assign_variant(the_pair, vector_for_intersection_no_x_monotone_2_4[1]));
   assert(the_pair.first == circ_arc_no_x_monotone_5.source());
   assert(the_pair.second == 1u);
 
@@ -626,7 +631,7 @@ void _test_circle_construct(CK ck)
   Circular_arc_2 circ_arc_no_x_monotone_6(circ_intersections_2_1,
                                           line_arc_overlap_low_right, false,
                                           line_arc_overlap_low_right, true);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_2_5;
   theConstruct_intersect_2(circ_arc_no_x_monotone_6,
                            circ_arc_no_x_monotone_5,
@@ -634,7 +639,7 @@ void _test_circle_construct(CK ck)
         assert(theDo_intersect_2(circ_arc_no_x_monotone_6, circ_arc_no_x_monotone_5));
   std::cout << vector_for_intersection_no_x_monotone_2_5.size() << std::endl;
   assert(vector_for_intersection_no_x_monotone_2_5.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_no_x_monotone_2_5[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_no_x_monotone_2_5[0]));
   assert(the_pair.first == circ_arc_no_x_monotone_5.source());
   assert(the_pair.second == 1u);
 
@@ -644,7 +649,7 @@ void _test_circle_construct(CK ck)
   Circular_arc_2 circ_arc_no_x_monotone_7(circ_intersections_2_1,
                                           line_arc_overlap_low_left, false,
                                           line_arc_overlap_low_right, false);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_no_x_monotone_2_6;
   theConstruct_intersect_2(circ_arc_no_x_monotone_7,
                            circ_arc_no_x_monotone_4,
@@ -652,8 +657,8 @@ void _test_circle_construct(CK ck)
         assert(theDo_intersect_2(circ_arc_no_x_monotone_7, circ_arc_no_x_monotone_4));
   std::cout << vector_for_intersection_no_x_monotone_2_6.size() << std::endl;
   assert(vector_for_intersection_no_x_monotone_2_6.size() == 2);
-  assign(circ_arc_in_overlap,vector_for_intersection_no_x_monotone_2_6[0]);
-  assign(circ_arc_in_overlap_2,vector_for_intersection_no_x_monotone_2_6[1]);
+  assign_variant(circ_arc_in_overlap,vector_for_intersection_no_x_monotone_2_6[0]);
+  assign_variant(circ_arc_in_overlap_2,vector_for_intersection_no_x_monotone_2_6[1]);
   assert((circ_arc_in_overlap.source() == circ_arc_no_x_monotone_7.source() &&
           circ_arc_in_overlap.target() == circ_arc_no_x_monotone_4.target()) ||
          (circ_arc_in_overlap_2.source() == circ_arc_no_x_monotone_7.source() &&
@@ -692,7 +697,7 @@ void _test_circle_construct(CK ck)
   Point_2 center_circ_monotone(x,y);
   Circle_2 circ_monotone(center_circ_monotone, r*r);
   Circular_arc_2 theCircular_arc_2_full(circ_monotone);
-  std::vector< CGAL::Object > outputIterator1, outputIterator1l;
+  std::vector< Intersection_result > outputIterator1, outputIterator1l;
   theMake_x_monotone(theCircular_arc_2_full,
                      std::back_inserter(outputIterator1));
         make_x_monotone(theCircular_arc_2_full,        std::back_inserter(outputIterator1l));
@@ -701,8 +706,8 @@ void _test_circle_construct(CK ck)
             << circ_monotone << std::endl;
   Circular_arc_2 circular_arc_2_full, circular_arc_2_fulll;
   for(std::size_t i = 0; i < outputIterator1.size(); i++){
-    assign(circular_arc_2_full,  outputIterator1[i]);
-    assign(circular_arc_2_fulll,  outputIterator1l[i]);
+    assign_variant(circular_arc_2_full,  outputIterator1[i]);
+    assign_variant(circular_arc_2_fulll,  outputIterator1l[i]);
     std::cout << "Circular_arc_2_" << i << " : "
               << circular_arc_2_full << std::endl;
    std::cout << "Circular_arc_2_" << i << "source : "
@@ -723,8 +728,8 @@ void _test_circle_construct(CK ck)
                      std::back_inserter(outputIterator1l));
         assert(outputIterator1.size() == 4);
   for(std::size_t i = 0; i < outputIterator1.size(); i++){
-    assign(circular_arc_2_full,  outputIterator1[i]);
-    assign(circular_arc_2_fulll,  outputIterator1l[i]);
+    assign_variant(circular_arc_2_full,  outputIterator1[i]);
+    assign_variant(circular_arc_2_fulll,  outputIterator1l[i]);
     assert(circular_arc_2_full.is_x_monotone());
     assert(circular_arc_2_full.is_y_monotone());
     assert(circular_arc_2_full == circular_arc_2_fulll);
@@ -767,7 +772,7 @@ void _test_circle_construct(CK ck)
                         std::cout << "T: " << i << " " << j << std::endl;
             assert(outputIterator1.size() == isize[i][j]);
       for(std::size_t k = 0; k < outputIterator1.size(); k++) {
-        assign(circular_arc_2_full,  outputIterator1[k]);
+        assign_variant(circular_arc_2_full,  outputIterator1[k]);
         assert(circular_arc_2_full.is_x_monotone());
         assert(circular_arc_2_full.is_y_monotone());
       }
@@ -782,7 +787,7 @@ void _test_circle_construct(CK ck)
   Circular_arc_2 theCircular_arc_2_quarter(circ_monotone,
                                            theLine_2_1, true,
                                            theLine_2_2, true);
-  std::vector< CGAL::Object > vector_of_object_1;
+  std::vector< Intersection_result > vector_of_object_1;
   theMake_x_monotone(theCircular_arc_2_quarter,
                      std::back_inserter(vector_of_object_1));
   std::cout << std::endl;
@@ -791,7 +796,7 @@ void _test_circle_construct(CK ck)
   std::cout << vector_of_object_1.size() << std::endl;
   Circular_arc_2 circular_arc_2_quarter;
   for(std::size_t i = 0; i < vector_of_object_1.size(); i++){
-    assign(circular_arc_2_quarter,  vector_of_object_1[i]);
+    assign_variant(circular_arc_2_quarter,  vector_of_object_1[i]);
     std::cout << "Circular_arc_2_" << i << " : "
               << circular_arc_2_quarter << std::endl;
     assert(circular_arc_2_quarter.is_x_monotone());
@@ -801,13 +806,13 @@ void _test_circle_construct(CK ck)
   Circular_arc_2 theCircular_arc_2_half(circ_monotone,
                                         theLine_2_2, false,
                                         theLine_2_2, true);
-   std::vector< CGAL::Object > vector_of_object_1_half;
+   std::vector< Intersection_result > vector_of_object_1_half;
   theMake_x_monotone(theCircular_arc_2_half,
                      std::back_inserter(vector_of_object_1_half));
   std::cout << std::endl;
   std::cout << "x_monotone a half circle" << std::endl;
   assert(vector_of_object_1_half.size() == 1);
-  assign(circular_arc_2_quarter,  vector_of_object_1_half[0]);
+  assign_variant(circular_arc_2_quarter,  vector_of_object_1_half[0]);
   assert(circular_arc_2_quarter.is_x_monotone());
   assert(circular_arc_2_quarter.source() == theCircular_arc_2_half.source());
   assert(circular_arc_2_quarter.target() == theCircular_arc_2_half.target());
@@ -837,7 +842,7 @@ void _test_circle_construct(CK ck)
   Circular_arc_2 theCircular_arc_2_random(circ_monotone,
                                           theLine_2_3, true,
                                           theLine_2_4, true);
-  std::vector< CGAL::Object > vector_of_object_2;
+  std::vector< Intersection_result > vector_of_object_2;
   theMake_x_monotone(theCircular_arc_2_random,
                      std::back_inserter(vector_of_object_2));
   std::cout << std::endl;
@@ -845,7 +850,7 @@ void _test_circle_construct(CK ck)
             << circ_monotone << std::endl;
   Circular_arc_2 circular_arc_2_random;
   for(std::size_t i = 0; i < vector_of_object_2.size(); i++){
-    assign(circular_arc_2_random,  vector_of_object_2[i]);
+    assign_variant(circular_arc_2_random,  vector_of_object_2[i]);
     std::cout << "Circular_arc_2_" << i << " : "
               << circular_arc_2_random << std::endl;
     assert(circular_arc_2_random.is_x_monotone());
@@ -911,7 +916,7 @@ void _test_circle_construct(CK ck)
   Circular_arc_2 cao8 = Circular_arc_2(Point_2(11,10), Point_2(1,0), Point_2(11,-10)); // = no intersection
 
   std::cout << "Testing intersect with lines" << std::endl;
-  std::vector< CGAL::Object > v_ll1, v_ll2, v_ll3, v_ll4, v_ll5, v_ll6, v_ll7, v_ll8;
+  std::vector< Intersection_result > v_ll1, v_ll2, v_ll3, v_ll4, v_ll5, v_ll6, v_ll7, v_ll8;
   theConstruct_intersect_2(lo1, cao1, std::back_inserter(v_ll1));
   theConstruct_intersect_2(lo1, cao2, std::back_inserter(v_ll2));
   theConstruct_intersect_2(lo1, cao3, std::back_inserter(v_ll3));
@@ -942,7 +947,7 @@ void _test_circle_construct(CK ck)
         Line_arc_2 llu3 = Line_arc_2(Point_2(-2,-1), Point_2(-2,1));
         Circle_2 ccu = Circle_2(Point_2(0,-1), Point_2(-1,0), Point_2(0,1));
 
-        std::vector< CGAL::Object > v_llc1, v_llc2, v_llc3;
+        std::vector< Intersection_result > v_llc1, v_llc2, v_llc3;
   theConstruct_intersect_2(llu1, ccu, std::back_inserter(v_llc1));
   theConstruct_intersect_2(llu2, ccu, std::back_inserter(v_llc2));
   theConstruct_intersect_2(llu3, ccu, std::back_inserter(v_llc3));
@@ -957,7 +962,7 @@ void _test_circle_construct(CK ck)
   assert(!theDo_intersect_2(llu3, ccu));
   assert(!CGAL::do_intersect(llu3, ccu));
 
-        std::vector< CGAL::Object > v_rllc1, v_rllc2, v_rllc3, v_rllc1l, v_rllc2l, v_rllc3l;
+        std::vector< Intersection_result > v_rllc1, v_rllc2, v_rllc3, v_rllc1l, v_rllc2l, v_rllc3l;
   theConstruct_intersect_2(llu1.supporting_line(), ccu, std::back_inserter(v_rllc1));
   theConstruct_intersect_2(llu2.supporting_line(), ccu, std::back_inserter(v_rllc2));
   theConstruct_intersect_2(llu3.supporting_line(), ccu, std::back_inserter(v_rllc3));
diff --git a/Circular_kernel_2/test/Circular_kernel_2/include/CGAL/_test_circles_extention.h b/Circular_kernel_2/test/Circular_kernel_2/include/CGAL/_test_circles_extention.h
index 2329bca2acbd..02471d6f61db 100644
--- a/Circular_kernel_2/test/Circular_kernel_2/include/CGAL/_test_circles_extention.h
+++ b/Circular_kernel_2/test/Circular_kernel_2/include/CGAL/_test_circles_extention.h
@@ -24,7 +24,9 @@ void _test_circle_bbox(CK ck)
   typedef typename CK::Circle_2                    Circle_2;
   typedef typename CK::Circular_arc_2              Circular_arc_2;
   typedef typename CK::Point_2                     Point_2;
+  typedef typename CK::Circular_arc_point_2        Circular_arc_point_2;
   typedef typename CK::Intersect_2   Intersect_2;
+  typedef std::variant<Circular_arc_2, std::pair<Circular_arc_point_2, unsigned>> Intersection_result;
 
   CGAL::Random generatorOfgenerator;
   int random_seed = generatorOfgenerator.get_int(0, 123456);
@@ -55,7 +57,7 @@ void _test_circle_bbox(CK ck)
     bool box_overlap = do_overlap(box1, box2);
     Intersect_2 theConstruct_intersect_2
       = ck.intersect_2_object();
-    std::vector< CGAL::Object >
+    std::vector< Intersection_result >
       vector_for_intersection_1;
     theConstruct_intersect_2(arc1,
                              arc2,
@@ -143,6 +145,7 @@ template <class CK>
     typedef typename CK::Intersect_2   Intersect_2;
     typedef typename CK::Make_x_monotone_2           Make_x_monotone_2;
     typedef typename CK::Line_arc_2              Line_arc_2;
+    typedef std::variant<std::pair<Circular_arc_point_2, unsigned>, Circular_arc_2> Intersection_result;
 
     Point_2 center_circ(0,0);
     Circle_2 circ(center_circ, 100);
@@ -151,7 +154,7 @@ template <class CK>
                              Point_2(0, -15));
     Intersect_2 theConstruct_intersect_2
       = ck.intersect_2_object();
-    std::vector< CGAL::Object >
+    std::vector< Intersection_result >
       vector_for_intersection_1;
     theConstruct_intersect_2(arc,
                              line_vertical,
@@ -159,18 +162,18 @@ template <class CK>
     Circular_arc_point_2 point_top;
     Circular_arc_point_2 point_down;
     std::pair< Circular_arc_point_2, unsigned int> aux;
-    assign(aux, vector_for_intersection_1[0]);
+    assign_variant(aux, vector_for_intersection_1[0]);
     point_down = aux.first;
-    assign(aux, vector_for_intersection_1[1]);
+    assign_variant(aux, vector_for_intersection_1[1]);
     point_top = aux.first;
     Make_x_monotone_2 theMake_x_monotone = ck.make_x_monotone_2_object();
-    std::vector< CGAL::Object > outputIterator1;
+    std::vector< Intersection_result > outputIterator1;
     theMake_x_monotone(arc,
                        std::back_inserter(outputIterator1));
     Circular_arc_2 arc_top;
     Circular_arc_2 arc_down;
-    assign(arc_top,outputIterator1[1]);
-    assign(arc_down, outputIterator1[0]);
+    assign_variant(arc_top,outputIterator1[1]);
+    assign_variant(arc_down, outputIterator1[0]);
     assert(!ck.has_on_2_object()(arc_top,
                                 line_vertical.source()));
     assert(ck.has_on_2_object()(arc_top,
@@ -195,7 +198,7 @@ template <class CK>
     typedef typename CK::Point_2                     Point_2;
     typedef typename CK::Circular_arc_point_2     Circular_arc_point_2;
     typedef typename CK::Intersect_2   Intersect_2;
-
+    typedef std::variant<Circular_arc_2, std::pair<Circular_arc_point_2, unsigned>> Intersection_result;
 
 
     int test_suite_cases[3][2][3] = {{{-7,-8,113},{9,9,162}},
@@ -213,20 +216,20 @@ template <class CK>
 
       Intersect_2 theConstruct_intersect_2
         = ck.intersect_2_object();
-      std::vector< CGAL::Object >
+      std::vector< Intersection_result >
         vector_for_intersection_1;
       theConstruct_intersect_2(arc,
                                arc2,
                              std::back_inserter(vector_for_intersection_1));
       std::pair< Circular_arc_point_2, unsigned int> aux;
-      assign(aux, vector_for_intersection_1[0]);
+      assign_variant(aux, vector_for_intersection_1[0]);
       CGAL::Bbox_2 box1 = aux.first.bbox();
       assert(typename CK::FT(box1.xmin()) <= aux.first.x());
       assert(typename CK::FT(box1.xmax()) >= aux.first.x());
       assert(typename CK::FT(box1.ymin()) <= aux.first.y());
       assert(typename CK::FT(box1.ymax()) >= aux.first.y());
       std::cout << "Ok" << std::endl;
-      assign(aux, vector_for_intersection_1[1]);
+      assign_variant(aux, vector_for_intersection_1[1]);
       CGAL::Bbox_2 box2 = aux.first.bbox();
       assert(typename CK::FT(box2.xmin()) <= aux.first.x());
       assert(typename CK::FT(box2.xmax()) >= aux.first.x());
diff --git a/Circular_kernel_2/test/Circular_kernel_2/test_Line_arc.cpp b/Circular_kernel_2/test/Circular_kernel_2/test_Line_arc.cpp
index 38a2174b586f..b1633d4b08fe 100644
--- a/Circular_kernel_2/test/Circular_kernel_2/test_Line_arc.cpp
+++ b/Circular_kernel_2/test/Circular_kernel_2/test_Line_arc.cpp
@@ -27,6 +27,17 @@
 
 #include <CGAL/Random.h>
 
+template <class Expected, class V>
+bool assign_variant(Expected& e, const V& v)
+{
+  if (std::get_if<Expected>(&v) != nullptr)
+  {
+    e = std::get<Expected>(v);
+    return true;
+  }
+  return false;
+}
+
 template <class CK>
 void _test_Line_arc(CK ck)
 {
@@ -87,41 +98,42 @@ void _test_Line_arc(CK ck)
   //////////////Intersection Line_arc Line_arc//////////////////
 
    Intersect_2 theConstruct_intersect_2 = ck.intersect_2_object();
+   typedef std::variant<std::pair<Circular_arc_point_2, unsigned int>, Line_arc_2> Intersection_result;
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_1;
    theConstruct_intersect_2(line_arc_horizontal,
                             line_arc_vertical,
                             std::back_inserter(vector_for_intersection_1));
    std::pair<Circular_arc_point_2, unsigned int> the_pair;
-   assert(assign(the_pair, vector_for_intersection_1[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_1[0]));
    Circular_arc_point_2 first = the_pair.first;
    assert(first.x() == 0);
    assert(first.y() == 0);
 
    Line_arc_2 line_arc_3(Point_2(-1, -2), Point_2(2,1));
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_2;
    theConstruct_intersect_2(line_arc_horizontal,
                             line_arc_3,
                             std::back_inserter(vector_for_intersection_2));
-   assert(assign(the_pair, vector_for_intersection_2[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_2[0]));
    first = the_pair.first;
    assert(first.x() == 1);
    assert(first.y() == 0);
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_3;
    theConstruct_intersect_2(line_arc_vertical,
                             line_arc_3,
                             std::back_inserter(vector_for_intersection_3));
-   assert(assign(the_pair, vector_for_intersection_3[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_3[0]));
    first = the_pair.first;
    assert(first.x() == 0);
    assert(first.y() == -1);
 
    Line_arc_2 line_arc_4(Point_2(20, -2), Point_2(20,10));
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_4;
    theConstruct_intersect_2(line_arc_horizontal,
                             line_arc_4,
@@ -131,14 +143,14 @@ void _test_Line_arc(CK ck)
 
 
    ////////////intersection in overlap///////////////
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_5;
    theConstruct_intersect_2(line_arc_horizontal,
                             line_arc_horizontal,
                             std::back_inserter(vector_for_intersection_5));
    Line_arc_2 line_arc_tmp;
    assert(vector_for_intersection_5.size() == 1);
-   assert(assign(line_arc_tmp, vector_for_intersection_5[0]));
+   assert(assign_variant(line_arc_tmp, vector_for_intersection_5[0]));
    assert(line_arc_tmp == line_arc_horizontal);
 
    Line_arc_2 line_arc_horizontal2(Line_2(center_circle1, p2_line_horizontal),
@@ -146,25 +158,25 @@ void _test_Line_arc(CK ck)
                         true,
                         circle1,
                         false);
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_6;
    theConstruct_intersect_2(line_arc_horizontal,
                             line_arc_horizontal2,
                             std::back_inserter(vector_for_intersection_6));
    assert(vector_for_intersection_6.size() == 1);
-   assert(assign(line_arc_tmp, vector_for_intersection_6[0]));
+   assert(assign_variant(line_arc_tmp, vector_for_intersection_6[0]));
    assert(line_arc_tmp.source() == line_arc_horizontal.source());
    assert(line_arc_tmp.target() == line_arc_horizontal2.target());
 
 
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_6_reverse;
    theConstruct_intersect_2(line_arc_horizontal2,
                             line_arc_horizontal,
                             std::back_inserter(vector_for_intersection_6_reverse));
    assert(vector_for_intersection_6_reverse.size() == 1);
-   assert(assign(line_arc_tmp, vector_for_intersection_6_reverse[0]));
+   assert(assign_variant(line_arc_tmp, vector_for_intersection_6_reverse[0]));
    assert(line_arc_tmp.source() == line_arc_horizontal.source());
    assert(line_arc_tmp.target() == line_arc_horizontal2.target());
 
@@ -175,43 +187,43 @@ void _test_Line_arc(CK ck)
                         true,
                         circle1,
                         false);
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_7;
    theConstruct_intersect_2(line_arc_horizontal,
                             line_arc_horizontal3,
                             std::back_inserter(vector_for_intersection_7));
    assert(vector_for_intersection_7.size() == 1);
-   assert(assign(line_arc_tmp, vector_for_intersection_7[0]));
+   assert(assign_variant(line_arc_tmp, vector_for_intersection_7[0]));
    assert(line_arc_tmp.source() == line_arc_horizontal.source());
    assert(line_arc_tmp.target() == line_arc_horizontal3.target());
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_8;
    theConstruct_intersect_2(line_arc_horizontal3,
                             line_arc_horizontal,
                             std::back_inserter(vector_for_intersection_8));
    assert(vector_for_intersection_8.size() == 1);
-   assert(assign(line_arc_tmp, vector_for_intersection_8[0]));
+   assert(assign_variant(line_arc_tmp, vector_for_intersection_8[0]));
    assert(line_arc_tmp.source() == line_arc_horizontal.source());
    assert(line_arc_tmp.target() == line_arc_horizontal3.target());
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_8_bis_1;
    theConstruct_intersect_2(line_arc_horizontal3,
                             line_arc_horizontal2,
                             std::back_inserter(vector_for_intersection_8_bis_1));
    assert(vector_for_intersection_8_bis_1.size() == 1);
-   assert(assign(line_arc_tmp, vector_for_intersection_8_bis_1[0]));
+   assert(assign_variant(line_arc_tmp, vector_for_intersection_8_bis_1[0]));
    assert(line_arc_tmp.source() == line_arc_horizontal2.source());
    assert(line_arc_tmp.target() == line_arc_horizontal3.target());
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_8_bis_2;
    theConstruct_intersect_2(line_arc_horizontal2,
                             line_arc_horizontal3,
                             std::back_inserter(vector_for_intersection_8_bis_2));
    assert(vector_for_intersection_8_bis_2.size() == 1);
-   assert(assign(line_arc_tmp, vector_for_intersection_8_bis_2[0]));
+   assert(assign_variant(line_arc_tmp, vector_for_intersection_8_bis_2[0]));
    assert(line_arc_tmp.source() == line_arc_horizontal2.source());
    assert(line_arc_tmp.target() == line_arc_horizontal3.target());
 
@@ -221,45 +233,45 @@ void _test_Line_arc(CK ck)
                                    true,
                                    circle1,
                                    true);
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_9;
    theConstruct_intersect_2(line_arc_horizontal4,
                             line_arc_horizontal,
                             std::back_inserter(vector_for_intersection_9));
    assert(vector_for_intersection_9.size() == 1);
-   assert(assign(the_pair, vector_for_intersection_9[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_9[0]));
    assert(the_pair.second == 1);
    assert(the_pair.first == line_arc_horizontal.source());
 
-    std::vector< CGAL::Object >
+    std::vector< Intersection_result >
      vector_for_intersection_10;
    theConstruct_intersect_2(line_arc_horizontal,
                             line_arc_horizontal4,
                             std::back_inserter(vector_for_intersection_10));
    assert(vector_for_intersection_10.size() == 1);
-   assert(assign(the_pair, vector_for_intersection_10[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_10[0]));
    assert(the_pair.second == 1);
    assert(the_pair.first == line_arc_horizontal.source());
 
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_11;
    theConstruct_intersect_2(Line_arc_2(Point_2(-1, -1),Point_2(2, 2)),
                             Line_arc_2(Point_2(0, 0), Point_2(1, 1)),
                             std::back_inserter(vector_for_intersection_11));
    assert(vector_for_intersection_11.size() == 1);
-   assert(assign(line_arc_tmp, vector_for_intersection_11[0]));
+   assert(assign_variant(line_arc_tmp, vector_for_intersection_11[0]));
    assert(line_arc_tmp == Line_arc_2(Point_2(0, 0), Point_2(1, 1)));
 
 
    //////Split/////////////
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_split_1;
    theConstruct_intersect_2(line_arc_horizontal,
                             line_arc_3,
                             std::back_inserter(vector_for_intersection_split_1));
-   assert(assign(the_pair, vector_for_intersection_split_1[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_split_1[0]));
    Circular_arc_point_2 point_of_split = the_pair.first;
    Split_2 theSplit_2 = ck.split_2_object();
    Line_arc_2 first_part_line_arc_horizontal;
@@ -291,6 +303,8 @@ void _test_intersection_Line_arc_Circle(CK ck)
   typedef CGAL::Line_arc_2<CK>                 Line_arc_2;
   typedef CGAL::Circular_arc_point_2<CK>       Circular_arc_point_2;
   typedef typename CK::Intersect_2   Intersect_2;
+  typedef std::variant<std::pair<Circular_arc_point_2, unsigned int>, Line_arc_2> Intersection_result;
+
   CGAL::Random generatorOfgenerator;
   int random_seed = generatorOfgenerator.get_int(0, 123456);
   std::cout << "random_seed = " << random_seed << std::endl;
@@ -368,53 +382,53 @@ void _test_intersection_Line_arc_Circle(CK ck)
                                 false);
 
   ////////test horizontal//////
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_1;
   theConstruct_intersect_2(line_arc_horizontal,
                            circle1,
                            std::back_inserter(vector_for_intersection_1));
   std::pair<Circular_arc_point_2, unsigned int> the_pair;
   assert(vector_for_intersection_1.size() == 2);
-  assert(assign(the_pair, vector_for_intersection_1[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_1[0]));
   Circular_arc_point_2 first = the_pair.first;
   assert(first == line_arc_horizontal.source());
   assert(the_pair.second == 1);
-  assert(assign(the_pair, vector_for_intersection_1[1]));
+  assert(assign_variant(the_pair, vector_for_intersection_1[1]));
   first = the_pair.first;
   assert(first == line_arc_horizontal2.target());
   assert(the_pair.second == 1);
 
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_2;
   theConstruct_intersect_2(line_arc_horizontal,
                            circle2,
                            std::back_inserter(vector_for_intersection_2));
   assert(vector_for_intersection_2.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_2[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_2[0]));
   first = the_pair.first;
   assert(first == line_arc_horizontal.target());
   assert(the_pair.second == 1);
 
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_3;
   theConstruct_intersect_2(line_arc_horizontal2,
                            circle2,
                            std::back_inserter(vector_for_intersection_3));
   assert(vector_for_intersection_3.size() == 0);
 
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_4;
   theConstruct_intersect_2(line_arc_horizontal3,
                            circle2,
                            std::back_inserter(vector_for_intersection_4));
   assert(vector_for_intersection_4.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_4[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_4[0]));
   first = the_pair.first;
   assert(first == line_arc_horizontal3.source());
   assert(the_pair.second == 1);
 
   Line_arc_2 line_arc_aux(p2_high_circle2,p2_high_right_circle2);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_5;
   theConstruct_intersect_2(Line_arc_2(p2_high_left_circle2,p2_high_right_circle2),
                            circle2,
@@ -424,17 +438,17 @@ void _test_intersection_Line_arc_Circle(CK ck)
                            circle2,
                            std::back_inserter(vector_for_intersection_5));
   assert(vector_for_intersection_5.size() == 2);
-  assert(assign(the_pair, vector_for_intersection_5[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_5[0]));
   first = the_pair.first;
   assert(first == line_arc_aux.source());
   assert(the_pair.second == 2);
-  assert(assign(the_pair, vector_for_intersection_5[1]));
+  assert(assign_variant(the_pair, vector_for_intersection_5[1]));
   first = the_pair.first;
   assert(first == line_arc_aux.source());
   assert(the_pair.second == 2);
 
   line_arc_aux = Line_arc_2(p2_low_circle2,p2_low_right_circle2);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_6;
   theConstruct_intersect_2(Line_arc_2(p2_low_left_circle2,p2_low_right_circle2),
                            circle2,
@@ -444,63 +458,63 @@ void _test_intersection_Line_arc_Circle(CK ck)
                            circle2,
                            std::back_inserter(vector_for_intersection_6));
   assert(vector_for_intersection_6.size() == 2);
-  assert(assign(the_pair, vector_for_intersection_6[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_6[0]));
   first = the_pair.first;
   assert(first == line_arc_aux.source());
   assert(the_pair.second == 2);
-  assert(assign(the_pair, vector_for_intersection_6[1]));
+  assert(assign_variant(the_pair, vector_for_intersection_6[1]));
   first = the_pair.first;
   assert(first == line_arc_aux.source());
   assert(the_pair.second == 2);
 
   ////////test vertical//////
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_7;
   theConstruct_intersect_2(line_arc_vertical,
                            circle1,
                            std::back_inserter(vector_for_intersection_7));
   assert(vector_for_intersection_7.size() == 2);
-  assert(assign(the_pair, vector_for_intersection_7[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_7[0]));
   first = the_pair.first;
   assert(first == line_arc_vertical.source());
   assert(the_pair.second == 1);
-  assert(assign(the_pair, vector_for_intersection_7[1]));
+  assert(assign_variant(the_pair, vector_for_intersection_7[1]));
   first = the_pair.first;
   assert(first == line_arc_vertical2.target());
   assert(the_pair.second == 1);
 
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_8;
   theConstruct_intersect_2(line_arc_vertical,
                            circle2,
                            std::back_inserter(vector_for_intersection_8));
   std::cout << vector_for_intersection_8.size() << std::endl;
   assert(vector_for_intersection_8.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_8[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_8[0]));
   first = the_pair.first;
   assert(first == line_arc_vertical.target());
   assert(the_pair.second == 1);
 
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_9;
   theConstruct_intersect_2(line_arc_vertical2,
                            circle2,
                            std::back_inserter(vector_for_intersection_9));
   assert(vector_for_intersection_9.size() == 0);
 
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_10;
   theConstruct_intersect_2(line_arc_vertical3,
                            circle2,
                            std::back_inserter(vector_for_intersection_10));
   assert(vector_for_intersection_10.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_10[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_10[0]));
   first = the_pair.first;
   assert(first == line_arc_vertical3.source());
   assert(the_pair.second == 1);
 
   line_arc_aux = Line_arc_2(p2_right_circle2,p2_high_right_circle2);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_11;
   theConstruct_intersect_2(Line_arc_2(p2_low_right_circle2,p2_high_right_circle2),
                             circle2,
@@ -510,17 +524,17 @@ void _test_intersection_Line_arc_Circle(CK ck)
                             circle2,
                             std::back_inserter(vector_for_intersection_11));
   assert(vector_for_intersection_11.size() == 2);
-  assert(assign(the_pair, vector_for_intersection_11[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_11[0]));
   first = the_pair.first;
   assert(first == line_arc_aux.source());
   assert(the_pair.second == 2);
-  assert(assign(the_pair, vector_for_intersection_11[1]));
+  assert(assign_variant(the_pair, vector_for_intersection_11[1]));
   first = the_pair.first;
   assert(first == line_arc_aux.source());
   assert(the_pair.second == 2);
 
   line_arc_aux = Line_arc_2(p2_left_circle2,p2_high_left_circle2);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_12;
   theConstruct_intersect_2(Line_arc_2(p2_low_left_circle2,p2_high_left_circle2),
                            circle2,
@@ -530,56 +544,56 @@ void _test_intersection_Line_arc_Circle(CK ck)
                            circle2,
                            std::back_inserter(vector_for_intersection_12));
   assert(vector_for_intersection_12.size() == 2);
-  assert(assign(the_pair, vector_for_intersection_12[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_12[0]));
   first = the_pair.first;
   assert(first == line_arc_aux.source());
   assert(the_pair.second == 2);
-  assert(assign(the_pair, vector_for_intersection_12[1]));
+  assert(assign_variant(the_pair, vector_for_intersection_12[1]));
   first = the_pair.first;
   assert(first == line_arc_aux.source());
   assert(the_pair.second == 2);
 
   //test diagonal
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_13;
   theConstruct_intersect_2(line_arc_diagonal,
                            circle1,
                            std::back_inserter(vector_for_intersection_13));
   assert(vector_for_intersection_13.size() == 2);
-  assert(assign(the_pair, vector_for_intersection_13[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_13[0]));
   first = the_pair.first;
   assert(first == line_arc_diagonal.source());
   assert(the_pair.second == 1);
-  assert(assign(the_pair, vector_for_intersection_13[1]));
+  assert(assign_variant(the_pair, vector_for_intersection_13[1]));
   first = the_pair.first;
   assert(first == line_arc_diagonal2.target());
   assert(the_pair.second == 1);
 
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_14;
   theConstruct_intersect_2(line_arc_diagonal,
                            circle2,
                            std::back_inserter(vector_for_intersection_14));
   assert(vector_for_intersection_14.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_14[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_14[0]));
   first = the_pair.first;
   assert(first == line_arc_diagonal.target());
   assert(the_pair.second == 1);
 
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_15;
   theConstruct_intersect_2(line_arc_diagonal2,
                            circle2,
                            std::back_inserter(vector_for_intersection_15));
   assert(vector_for_intersection_15.size() == 0);
 
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
     vector_for_intersection_16;
   theConstruct_intersect_2(line_arc_diagonal3,
                            circle2,
                            std::back_inserter(vector_for_intersection_16));
   assert(vector_for_intersection_16.size() == 1);
-  assert(assign(the_pair, vector_for_intersection_16[0]));
+  assert(assign_variant(the_pair, vector_for_intersection_16[0]));
   first = the_pair.first;
   assert(first == line_arc_diagonal3.source());
   assert(the_pair.second == 1);
@@ -587,42 +601,42 @@ void _test_intersection_Line_arc_Circle(CK ck)
 
   //Diagonal tangent
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_17;
    theConstruct_intersect_2(Line_arc_2(Point_2(-10, -5), Point_2(5, 15)),
                              circle1,
                              std::back_inserter(vector_for_intersection_17));
    assert(vector_for_intersection_17.size() == 1);
-   assert(assign(the_pair, vector_for_intersection_17[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_17[0]));
    assert(the_pair.second == 2);
 
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_18;
    theConstruct_intersect_2(Line_arc_2(Point_2(10, -5), Point_2(-5, 15)),
                              circle1,
                              std::back_inserter(vector_for_intersection_18));
    assert(vector_for_intersection_18.size() == 1);
-   assert(assign(the_pair, vector_for_intersection_18[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_18[0]));
    assert(the_pair.second == 2);
 
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_19;
    theConstruct_intersect_2(Line_arc_2(Point_2(10, 5), Point_2(-5, -15)),
                              circle1,
                              std::back_inserter(vector_for_intersection_19));
    assert(vector_for_intersection_19.size() == 1);
-   assert(assign(the_pair, vector_for_intersection_19[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_19[0]));
    assert(the_pair.second == 2);
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_20;
    theConstruct_intersect_2(Line_arc_2(Point_2(-10, 5), Point_2(5, -15)),
                              circle1,
                              std::back_inserter(vector_for_intersection_20));
    assert(vector_for_intersection_20.size() == 1);
-   assert(assign(the_pair, vector_for_intersection_20[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_20[0]));
    assert(the_pair.second == 2);
 
 }
@@ -638,6 +652,7 @@ void _test_intersection_Line_arc_Circular_arc(CK ck)
   typedef CGAL::Line_arc_2<CK>                 Line_arc_2;
   typedef CGAL::Circular_arc_point_2<CK>       Circular_arc_point_2;
   typedef typename CK::Intersect_2   Intersect_2;
+  typedef std::variant<std::pair<Circular_arc_point_2, unsigned int>, Circular_arc_2> Intersection_result;
   typedef typename CK::Make_x_monotone_2           Make_x_monotone_2;
   CGAL::Random generatorOfgenerator;
   int random_seed = generatorOfgenerator.get_int(0, 123456);
@@ -699,58 +714,58 @@ void _test_intersection_Line_arc_Circular_arc(CK ck)
                        Line_2(center_circle1,
                               p2_line_vertical),
                        false);
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_1;
    theConstruct_intersect_2(line_arc_horizontal3,
                             arc_1,
                             std::back_inserter(vector_for_intersection_1));
    std::pair<Circular_arc_point_2, unsigned int> the_pair;
    assert(vector_for_intersection_1.size() == 2);
-   assert(assign(the_pair, vector_for_intersection_1[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_1[0]));
    Circular_arc_point_2 first = the_pair.first;
    assert(first == line_arc_horizontal3.source());
    assert(the_pair.second == 1);
-   assert(assign(the_pair, vector_for_intersection_1[1]));
+   assert(assign_variant(the_pair, vector_for_intersection_1[1]));
    first = the_pair.first;
    assert(first == line_arc_horizontal3.target());
    assert(the_pair.second == 1);
 
- std::vector< CGAL::Object >
+ std::vector< Intersection_result >
      vector_for_intersection_2;
    theConstruct_intersect_2(line_arc_horizontal,
                             arc_1,
                             std::back_inserter(vector_for_intersection_2));
    assert(vector_for_intersection_2.size() == 1);
-   assert(assign(the_pair, vector_for_intersection_2[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_2[0]));
    first = the_pair.first;
    assert(first == line_arc_horizontal.target());
    assert(the_pair.second == 1);
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_3;
    theConstruct_intersect_2(line_arc_vertical,
                             arc_1,
                             std::back_inserter(vector_for_intersection_3));
    assert(vector_for_intersection_3.size() == 1);
-   assert(assign(the_pair, vector_for_intersection_3[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_3[0]));
    first = the_pair.first;
    assert(first == arc_1.target());
    assert(the_pair.second == 1);
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_4;
    theConstruct_intersect_2(Line_arc_2(Point_2(-10, -5), Point_2(5, 15)),
                             arc_2,
                             std::back_inserter(vector_for_intersection_4));
    assert(vector_for_intersection_4.size() == 0);
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_5;
    theConstruct_intersect_2(Line_arc_2(Point_2(10, -5), Point_2(-5, 15)),
                             arc_2,
                             std::back_inserter(vector_for_intersection_5));
    assert(vector_for_intersection_5.size() == 1);
-   assert(assign(the_pair, vector_for_intersection_5[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_5[0]));
    assert(the_pair.second == 2);
 
    //random
@@ -778,31 +793,31 @@ void _test_intersection_Line_arc_Circular_arc(CK ck)
                                false);
 
    Circular_arc_point_2 first2;
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_random1;
    theConstruct_intersect_2(Line_arc_2(Point_2(-p_random1.x(),-p_random1.y()),
                                        p_random1),
                             arc_random_1,
                             std::back_inserter(vector_for_intersection_random1));
    assert(vector_for_intersection_random1.size() > 0);
-   assert(assign(the_pair, vector_for_intersection_random1[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_random1[0]));
    first = the_pair.first;
    assert(the_pair.second == 1);
    assert(first == arc_random_1.source());
 
 
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_random2;
    theConstruct_intersect_2(Line_arc_2(Point_2(-p_random2.x(),-p_random2.y()),p_random2),
                             arc_random_1,
                             std::back_inserter(vector_for_intersection_random2));
    assert(vector_for_intersection_random2.size() > 0);
-   assert(assign(the_pair, vector_for_intersection_random2[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_random2[0]));
    first = the_pair.first;
    assert(the_pair.second == 1);
    if(vector_for_intersection_random2.size() == 2){
-     assert(assign(the_pair, vector_for_intersection_random2[1]));
+     assert(assign_variant(the_pair, vector_for_intersection_random2[1]));
      first2 = the_pair.first;
      assert(the_pair.second == 1);
      assert((first == arc_random_1.target()) || (first2 == arc_random_1.target()));
@@ -825,20 +840,20 @@ void _test_intersection_Line_arc_Circular_arc(CK ck)
                            theRandom.get_int(random_min, random_max));
      } while (p_random4 == center_circle_random1 || (p_random3 == p_random4));
 
-     std::vector< CGAL::Object >
+     std::vector< Intersection_result >
        vector_for_intersection_random3;
      theConstruct_intersect_2(Line_arc_2(p_random3,p_random4),
                               arc_random_1,
                               std::back_inserter(vector_for_intersection_random3));
      for( std::size_t i = 0; i < vector_for_intersection_random3.size(); i++){
-       assert(assign(the_pair, vector_for_intersection_random3[i]));
+       assert(assign_variant(the_pair, vector_for_intersection_random3[i]));
        first = the_pair.first;
-       std::vector<CGAL::Object > objects_x_monotone;
+       std::vector<Intersection_result> objects_x_monotone;
        theMake_x_monotone( arc_random_1, std::back_inserter(objects_x_monotone));
        bool is_on_arc = false;
        for(std::size_t j = 0; j < objects_x_monotone.size(); j++){
          Circular_arc_2 aux;
-         assign(aux, objects_x_monotone[j]);
+         assign_variant(aux, objects_x_monotone[j]);
          if(CGAL::CircularFunctors::has_on<CK>(aux, first)){
            is_on_arc = true;
            break;
@@ -860,6 +875,7 @@ void _test_compare_y_to_right(CK ck)
   typedef CGAL::Line_arc_2<CK>                 Line_arc_2;
   typedef CGAL::Circular_arc_point_2<CK>       Circular_arc_point_2;
   typedef typename CK::Intersect_2   Intersect_2;
+  typedef std::variant<std::pair<Circular_arc_point_2, unsigned int>, Line_arc_2> Intersection_result;
 
   CGAL::Random generatorOfgenerator;
   int random_seed = generatorOfgenerator.get_int(0, 123456);
@@ -883,13 +899,13 @@ void _test_compare_y_to_right(CK ck)
                                       p2_line_diagonal),
                                circle1,true,
                                circle2,false);
-  std::vector< CGAL::Object >
+  std::vector< Intersection_result >
      vector_for_intersection_1;
    theConstruct_intersect_2(line_arc_horizontal,
                             line_arc_diagonal,
                             std::back_inserter(vector_for_intersection_1));
    std::pair<Circular_arc_point_2, unsigned int> the_pair;
-   assert(assign(the_pair, vector_for_intersection_1[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_1[0]));
    Circular_arc_point_2 first = the_pair.first;
 
    assert(CGAL::CircularFunctors::compare_y_to_right<CK>(line_arc_horizontal,
@@ -934,22 +950,22 @@ void _test_compare_y_to_right(CK ck)
                                              part_low,
                                              line_arc_horizontal_low.source()) == CGAL::SMALLER);
 
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_2;
    theConstruct_intersect_2(part_high,
                             line_arc_diagonal,
                             std::back_inserter(vector_for_intersection_2));
-   assert(assign(the_pair, vector_for_intersection_2[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_2[0]));
    first = the_pair.first;
    assert(CGAL::CircularFunctors::compare_y_to_right<CK>(line_arc_diagonal,
                                                          part_high,
                                                          first) == CGAL::LARGER);
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_3;
    theConstruct_intersect_2(part_low,
                             line_arc_diagonal,
                             std::back_inserter(vector_for_intersection_3));
-   assert(assign(the_pair, vector_for_intersection_3[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_3[0]));
    first = the_pair.first;
    assert(CGAL::CircularFunctors::compare_y_to_right<CK>(line_arc_diagonal,
                                                          part_low,
@@ -959,22 +975,22 @@ void _test_compare_y_to_right(CK ck)
                                        p2_line_diagonal2),
                                 circle1,true,
                                 circle2,false);
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_4;
    theConstruct_intersect_2(part_high,
                             line_arc_diagonal2,
                             std::back_inserter(vector_for_intersection_4));
-   assert(assign(the_pair, vector_for_intersection_4[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_4[0]));
    first = the_pair.first;
    assert(CGAL::CircularFunctors::compare_y_to_right<CK>(line_arc_diagonal2,
                                                          part_high,
                                                          first) == CGAL::SMALLER);
-   std::vector< CGAL::Object >
+   std::vector< Intersection_result >
      vector_for_intersection_5;
    theConstruct_intersect_2(part_low,
                             line_arc_diagonal2,
                             std::back_inserter(vector_for_intersection_5));
-   assert(assign(the_pair, vector_for_intersection_5[0]));
+   assert(assign_variant(the_pair, vector_for_intersection_5[0]));
    first = the_pair.first;
    assert(CGAL::CircularFunctors::compare_y_to_right<CK>(line_arc_diagonal2,
                                                          part_low,
diff --git a/Circular_kernel_3/examples/Circular_kernel_3/functor_compare_theta_3.cpp b/Circular_kernel_3/examples/Circular_kernel_3/functor_compare_theta_3.cpp
index d318216621fc..439b1a55793f 100644
--- a/Circular_kernel_3/examples/Circular_kernel_3/functor_compare_theta_3.cpp
+++ b/Circular_kernel_3/examples/Circular_kernel_3/functor_compare_theta_3.cpp
@@ -1,4 +1,5 @@
 #include <CGAL/Exact_spherical_kernel_3.h>
+#include <CGAL/iterator.h>
 
 typedef CGAL::Exact_spherical_kernel_3               SK;
 
@@ -15,15 +16,20 @@ int main(){
   SK::Intersect_3 inter;
   //create a functor to compare theta-coordinates on sphere s1
   SK::Compare_theta_z_3 cmp(s1);
-  std::vector< CGAL::Object > intersections;
-  inter(C1,C2,std::back_inserter(intersections));
+
+
 
   //unsigned integer indicates multiplicity of intersection point
-  std::pair<SK::Circular_arc_point_3,unsigned> p1=
-    CGAL::object_cast< std::pair<SK::Circular_arc_point_3,unsigned> >(intersections[0]);
-  std::pair<SK::Circular_arc_point_3,unsigned> p2=
-    CGAL::object_cast< std::pair<SK::Circular_arc_point_3,unsigned> >(intersections[1]);
+  typedef std::pair<SK::Circular_arc_point_3,unsigned> Point_and_multiplicity;
+
+  // only recover points
+  std::vector< Point_and_multiplicity > intersections;
+  inter(C1,C2,
+        CGAL::dispatch_or_drop_output<Point_and_multiplicity>(std::back_inserter(intersections)));
+
 
+  const Point_and_multiplicity& p1=intersections[0];
+  const Point_and_multiplicity& p2=intersections[1];
 
   SK::Circular_arc_point_3 t_extreme[2];
   //Compute theta extremal points of circle C1 on sphere s1
diff --git a/Circular_kernel_3/examples/Circular_kernel_3/intersecting_spheres.cpp b/Circular_kernel_3/examples/Circular_kernel_3/intersecting_spheres.cpp
index 587e53cbe856..a31eef6daf38 100644
--- a/Circular_kernel_3/examples/Circular_kernel_3/intersecting_spheres.cpp
+++ b/Circular_kernel_3/examples/Circular_kernel_3/intersecting_spheres.cpp
@@ -1,10 +1,12 @@
 #include <CGAL/Exact_spherical_kernel_3.h>
 #include <CGAL/Random.h>
 
-typedef CGAL::Exact_spherical_kernel_3         Spherical_k;
+typedef CGAL::Exact_spherical_kernel_3         SK;
 
-typedef CGAL::Point_3<Spherical_k>             Point_3;
-typedef CGAL::Sphere_3<Spherical_k>            Sphere_3;
+typedef CGAL::Point_3<SK>               Point_3;
+typedef CGAL::Sphere_3<SK>              Sphere_3;
+typedef CGAL::Circle_3<SK>              Circle_3;
+typedef CGAL::Circular_arc_point_3<SK>  Circular_arc_point_3;
 
 int main() {
 
@@ -33,9 +35,9 @@ int main() {
     Sphere_3 s2 = Sphere_3(Point_3(x2,y2,z2), r);
     Sphere_3 s3 = Sphere_3(Point_3(x3,y3,z3), r);
 
-    std::vector< CGAL::Object > intersecs;
+    std::vector< std::variant<Sphere_3, Circle_3, std::pair<Circular_arc_point_3, unsigned> > > intersecs;
     CGAL::intersection(s1, s2, s3, std::back_inserter(intersecs));
-    if(intersecs.size() > 0) count++;
+    if(intersecs.size() > 0) ++count;
   }
 
   std::cout << "The approximate probability that 3 spheres with radius 1"
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
index 02da04e08975..9612d2ca5787 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
@@ -167,25 +167,4 @@ struct SK3_Intersection_traits<SK, typename SK::Sphere_3, typename SK::Plane_3,
 
 } //end of namespace CGAL
 
-namespace CGAL{
-namespace internal{
-
-// this function is used to call either make_object or a
-// CK2_Intersection_traits::result_type constructor to create return
-// values. The Object version takes some dummy template arguments
-// that are needed for the return of the Intersection_traits. In
-// theory a one parameter variant could be returned, but this
-// _could_ come with conversion overhead and so we rather go for
-// the real type.
-// Overloads for empty returns are also provided.
-  template<typename RT, typename T>
-  inline RT
-  sk3_intersection_return(T&& t) { return RT(std::forward<T>(t)); }
-  template<typename RT>
-  inline RT
-  sk3_intersection_return() { return RT(); }
-
-} } //end of namespace CGAL::internal
-
-
 #endif // CGAL_CIRCULAR_KERNEL_2_INTERSECTION_TRAITS_H
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_circular_arc_3.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_circular_arc_3.h
index 33e0451fc3f7..56fd4d712ff8 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_circular_arc_3.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_circular_arc_3.h
@@ -189,8 +189,6 @@ namespace CGAL {
                 const typename SK::Circular_arc_3 & ca,
                 OutputIterator res)
     {
-      typedef typename SK3_Intersection_traits<SK, typename SK::Plane_3, typename SK::Circular_arc_3
-        >::type result_type;
       typedef typename SK::Circular_arc_point_3 Circular_arc_point_3;
       typedef std::vector<
         typename SK3_Intersection_traits<SK, typename SK::Circle_3, typename SK::Plane_3>::type
@@ -198,7 +196,7 @@ namespace CGAL {
 
       typedef std::pair<Circular_arc_point_3, unsigned> Solution;
       if(SK().has_on_3_object()(p,ca.supporting_circle())) {
-        *res++ = CGAL::internal::sk3_intersection_return<result_type>(ca);
+        *res++ = ca;
       }
       solutions_container solutions;
 
@@ -208,14 +206,14 @@ namespace CGAL {
       if(solutions.size() == 1) {
          const Solution& sol=*CGAL::Intersections::internal::intersect_get<Solution>(solutions[0]);
          if(SK().has_on_3_object()(ca,sol.first,true))
-           *res++ = CGAL::internal::sk3_intersection_return<result_type>(sol);
+           *res++ = sol;
       } else {
          const Solution& sol1=*CGAL::Intersections::internal::intersect_get<Solution>(solutions[0]);
          const Solution& sol2=*CGAL::Intersections::internal::intersect_get<Solution>(solutions[1]);
          if(SK().has_on_3_object()(ca,sol1.first,true))
-           *res++ = CGAL::internal::sk3_intersection_return<result_type>(sol1);
+           *res++ = sol1;
          if(SK().has_on_3_object()(ca,sol2.first,true))
-           *res++ = CGAL::internal::sk3_intersection_return<result_type>(sol2);
+           *res++ = sol2;
       }
       return res;
     }
@@ -261,8 +259,6 @@ namespace CGAL {
                 const typename SK::Circular_arc_3 & a2,
                 OutputIterator res)
     {
-      typedef typename SK3_Intersection_traits<SK, typename SK::Circular_arc_3, typename SK::Circular_arc_3
-        >::type result_type;
       typedef typename SK::Circular_arc_point_3 Circular_arc_point_3;
       typedef typename SK::Circular_arc_3 Circular_arc_3;
       typedef std::vector< typename SK3_Intersection_traits<SK, typename SK::Circle_3, typename SK::Circle_3>
@@ -272,11 +268,11 @@ namespace CGAL {
 
       if(non_oriented_equal<SK>(a1.supporting_circle(), a2.supporting_circle())) {
         if(a1.rep().is_full()) {
-          *res++ = CGAL::internal::sk3_intersection_return<result_type>(a2);
+          *res++ = a2;
           //return res;
         }
         else if(a2.rep().is_full()) {
-          *res++ = CGAL::internal::sk3_intersection_return<result_type>(a1);
+          *res++ = a1;
           //return res;
         } else {
           bool t2_in_a1 = SK().has_on_3_object()(a1,a2.target(),true);
@@ -289,58 +285,58 @@ namespace CGAL {
                 SK().compare_xyz_3_object()(a1.source(), a2.source());
               if(comp < 0) {
                 if(a1.source() == a2.target()) {
-                  *res++ = CGAL::internal::sk3_intersection_return<result_type>(std::make_pair(a1.source(),1u));
+                  *res++ = std::make_pair(a1.source(),1u);
                 } else {
                   const Circular_arc_3 & arc =
                   Circular_arc_3(a1.supporting_circle(),a1.source(),a2.target());
-                  *res++ = CGAL::internal::sk3_intersection_return<result_type>(arc);
+                  *res++ = arc;
                 }
                 if(a2.source() == a1.target()) {
-                  *res++ = CGAL::internal::sk3_intersection_return<result_type>(std::make_pair(a2.source(),1u));
+                  *res++ = std::make_pair(a2.source(),1u);
                 } else {
                   const Circular_arc_3 & arc =
                   Circular_arc_3(a1.supporting_circle(),a2.source(),a1.target());
-                  *res++ = CGAL::internal::sk3_intersection_return<result_type>(arc);
+                  *res++ = arc;
                 }
               } else if(comp > 0) {
                 if(a2.source() == a1.target()) {
-                  *res++ = CGAL::internal::sk3_intersection_return<result_type>(std::make_pair(a2.source(),1u));
+                  *res++ = std::make_pair(a2.source(),1u);
                 } else {
                   const Circular_arc_3 & arc =
                   Circular_arc_3(a1.supporting_circle(),a2.source(),a1.target());
-                  *res++ = CGAL::internal::sk3_intersection_return<result_type>(arc);
+                  *res++ = arc;
                 }
                 if(a1.source() == a2.target()) {
-                  *res++ = CGAL::internal::sk3_intersection_return<result_type>(std::make_pair(a1.source(),1u));
+                  *res++ = std::make_pair(a1.source(),1u);
                 } else {
                   const Circular_arc_3 & arc =
                   Circular_arc_3(a1.supporting_circle(),a1.source(),a2.target());
-                  *res++ = CGAL::internal::sk3_intersection_return<result_type>(arc);
+                  *res++ = arc;
                 }
               } else {
-                *res++ = CGAL::internal::sk3_intersection_return<result_type>(a1);
+                *res++ = a1;
               }
             } else {
-              *res++ = CGAL::internal::sk3_intersection_return<result_type>(a2);
+              *res++ = a2;
             }
           } else if(t2_in_a1) {
             if(a1.source() == a2.target())
-              *res++ = CGAL::internal::sk3_intersection_return<result_type>(std::make_pair(a1.source(),1u));
+              *res++ = std::make_pair(a1.source(),1u);
             else {
               const Circular_arc_3 & arc =
                 Circular_arc_3(a1.supporting_circle(),a1.source(),a2.target());
-              *res++ = CGAL::internal::sk3_intersection_return<result_type>(arc);
+              *res++ = arc;
             } //return res;
           } else if(s2_in_a1) {
             if(a2.source() == a1.target()) {
-              *res++ = CGAL::internal::sk3_intersection_return<result_type>(std::make_pair(a2.source(),1u));
+              *res++ = std::make_pair(a2.source(),1u);
             } else {
               const Circular_arc_3 & arc =
                 Circular_arc_3(a1.supporting_circle(),a2.source(),a1.target());
-              *res++ = CGAL::internal::sk3_intersection_return<result_type>(arc);
+              *res++ = arc;
             }
           } else if(SK().has_on_3_object()(a2,a1.source(),true)) {
-              *res++ = CGAL::internal::sk3_intersection_return<result_type>(a1);
+              *res++ = a1;
           }
         }
       } else {
@@ -353,16 +349,16 @@ namespace CGAL {
           const Solution& sol=*CGAL::Intersections::internal::intersect_get<Solution>(solutions[0]);
           if(SK().has_on_3_object()(a1,sol.first,true) &&
              SK().has_on_3_object()(a2,sol.first,true))
-            *res++ = solutions[0];
+            *res++ = sol;
         } else {
           const Solution& sol1=*CGAL::Intersections::internal::intersect_get<Solution>(solutions[0]);
           const Solution& sol2=*CGAL::Intersections::internal::intersect_get<Solution>(solutions[1]);
           if(SK().has_on_3_object()(a1,sol1.first,true) &&
              SK().has_on_3_object()(a2,sol1.first,true))
-            *res++ = solutions[0];
+            *res++ = sol1;
           if(SK().has_on_3_object()(a1,sol2.first,true) &&
              SK().has_on_3_object()(a2,sol2.first,true))
-            *res++ = solutions[1];
+            *res++ = sol2;
         }
       }
       return res;
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_line_arc_3.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_line_arc_3.h
index f26063282b15..8491e83d5db6 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_line_arc_3.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_line_arc_3.h
@@ -83,7 +83,6 @@ namespace CGAL {
       typedef typename SK::Circular_arc_point_3 Circular_arc_point_3;
       typedef typename SK::Line_3 Line_3;
       typedef typename SK::Line_arc_3 Line_arc_3;
-      typedef typename SK3_Intersection_traits<SK, Line_arc_3, Line_arc_3>::type result_type;
 
       typename Intersection_traits<SK, Line_3, Line_3>::result_type o =
         SK().intersect_3_object()(l1.supporting_line(),
@@ -96,7 +95,7 @@ namespace CGAL {
           Circular_arc_point_3 p = *inters_p;
         if(!SK().has_on_3_object()(l1,p,true)) return res;
         if(!SK().has_on_3_object()(l2,p,true)) return res;
-          *res++ = CGAL::internal::sk3_intersection_return<result_type>(std::make_pair(p,1u));
+          *res++ = std::make_pair(p,1u);
       } else if( CGAL::Intersections::internal::intersect_get<Line_3>(o) ) {
         if(SK().compare_xyz_3_object()(l1.lower_xyz_extremity(),
                                        l2.lower_xyz_extremity()) < 0) {
@@ -106,15 +105,15 @@ namespace CGAL {
           if(comparison < 0) {
             if(SK().compare_xyz_3_object()(l1.higher_xyz_extremity(),
                                            l2.higher_xyz_extremity()) <= 0) {
-              *res++ = CGAL::internal::sk3_intersection_return<result_type>
-                (Line_arc_3(l1.supporting_line(),
-                            l2.lower_xyz_extremity(),
-                            l1.higher_xyz_extremity()));
+              *res++ =
+                Line_arc_3(l1.supporting_line(),
+                           l2.lower_xyz_extremity(),
+                           l1.higher_xyz_extremity());
             } else {
-              *res++ = CGAL::internal::sk3_intersection_return<result_type>(l2);
+              *res++ = l2;
             }
           } else if (comparison == 0) {
-            *res++ = CGAL::internal::sk3_intersection_return<result_type>(std::make_pair(l2.lower_xyz_extremity(),1u));
+            *res++ = std::make_pair(l2.lower_xyz_extremity(),1u);
           }
         }
         else {
@@ -124,16 +123,16 @@ namespace CGAL {
           if(comparison < 0){
             if(SK().compare_xyz_3_object()(l1.higher_xyz_extremity(),
                                            l2.higher_xyz_extremity()) <= 0) {
-              *res++ = CGAL::internal::sk3_intersection_return<result_type>(l1);
+              *res++ = l1;
             } else {
-              *res++ = CGAL::internal::sk3_intersection_return<result_type>
-                (Line_arc_3(l1.supporting_line(),
-                            l1.lower_xyz_extremity(),
-                            l2.higher_xyz_extremity() ));
+              *res++ =
+                Line_arc_3(l1.supporting_line(),
+                           l1.lower_xyz_extremity(),
+                           l2.higher_xyz_extremity() );
             }
           }
           else if (comparison == 0){
-            *res++ = CGAL::internal::sk3_intersection_return<result_type>(std::make_pair(l1.lower_xyz_extremity(),1u));
+            *res++ = std::make_pair(l1.lower_xyz_extremity(),1u);
           }
         }
       }
@@ -149,8 +148,6 @@ namespace CGAL {
       typedef typename SK::Point_3 Point_3;
       typedef typename SK::Circular_arc_point_3 Circular_arc_point_3;
       typedef typename SK::Line_3 Line_3;
-      typedef typename SK::Line_arc_3 Line_arc_3;
-      typedef typename SK3_Intersection_traits<SK, Line_3, Line_arc_3>::type result_type;
 
       typename Intersection_traits<SK, Line_3, Line_3>::result_type o =
         SK().intersect_3_object()(l, la.supporting_line());
@@ -159,11 +156,11 @@ namespace CGAL {
         return res;
 
       if(const Line_3* inters_l = CGAL::Intersections::internal::intersect_get<Line_3>(o)) {
-        *res++ = CGAL::internal::sk3_intersection_return<result_type>(la);
+        *res++ = la;
       } else if(const Point_3* inters_p = CGAL::Intersections::internal::intersect_get<Point_3>(o)) {
         Circular_arc_point_3 p = *inters_p;
         if(!SK().has_on_3_object()(la,p,true)) return res;
-        *res++ = CGAL::internal::sk3_intersection_return<result_type>(std::make_pair(p,1u));
+        *res++ = std::make_pair(p,1u);
       }
 
       return res;
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h
index f17acf269084..3fb21589539c 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/internal_functions_on_sphere_3.h
@@ -202,17 +202,10 @@ namespace CGAL {
    namespace internal {
      // we need to pass the result_type, to hack around the fact that
      // object doesn't support operator=(const T&) and so we keep backwards compatibility
-     template<typename SK, typename RT>
-     struct pair_transform {
-       RT operator()(const std::pair< typename SK::Root_for_spheres_2_3, unsigned >& p) {
-         return RT(std::make_pair(typename SK::Circular_arc_point_3(p.first), p.second));
-       }
-     };
-
      template<typename SK>
-     struct pair_transform<SK, CGAL::Object> {
-       CGAL::Object operator()(const std::pair< typename SK::Root_for_spheres_2_3, unsigned >& p) {
-         return CGAL::make_object(std::make_pair(typename SK::Circular_arc_point_3(p.first), p.second));
+     struct pair_transform {
+       auto operator()(const std::pair< typename SK::Root_for_spheres_2_3, unsigned >& p) {
+         return std::make_pair(typename SK::Circular_arc_point_3(p.first), p.second);
        }
      };
 
@@ -222,15 +215,15 @@ namespace CGAL {
    // pair, otherwise just dump the value with conversion to RT
    // (again: converting to RT before assigning to the Iterator is
    // just to keep object working)
-   template<typename SK, typename RT, typename OutputIterator>
+   template<typename SK, typename OutputIterator>
    struct Point_conversion_visitor {
      Point_conversion_visitor(const OutputIterator& it) : it(it) {}
      template<typename T>
-     OutputIterator operator()(const T& t) { *it++ = RT(t); return it; }
+     OutputIterator operator()(const T& t) { *it++ = t; return it; }
 
      OutputIterator operator()(const typename SK::Point_3& p) {
        // 2 multiplicities
-       *it++ = RT(std::make_pair(typename SK::Circular_arc_point_3(p), 2u));
+       *it++ = std::make_pair(typename SK::Circular_arc_point_3(p), 2u);
        return it;
      }
      OutputIterator it;
@@ -244,8 +237,6 @@ namespace CGAL {
                 const typename SK::Line_3 & l,
                 OutputIterator res)
     {
-      typedef typename SK3_Intersection_traits<SK, typename SK::Sphere_3, typename SK::Line_3>
-        ::type result_type;
       typedef typename SK::Algebraic_kernel                          Algebraic_kernel;
       typedef typename SK::Polynomial_for_spheres_2_3  Equation_sphere;
       typedef typename SK::Polynomials_for_line_3      Equation_line;
@@ -259,7 +250,7 @@ namespace CGAL {
       solutions_container solutions;
       Algebraic_kernel().solve_object()(e1, e2, std::back_inserter(solutions));
 
-      return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK, result_type>());
+      return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK>());
     }
 
     // The special 3 object functions
@@ -278,19 +269,18 @@ namespace CGAL {
        typedef typename SK::Point_3  Point_3;
        typedef typename SK::Sphere_3  Sphere_3;
        typedef typename SK::Algebraic_kernel  Algebraic_kernel;
-       typedef typename SK3_Intersection_traits<SK, Sphere_3, Sphere_3, Sphere_3>::type result_type;
 
        CGAL_kernel_precondition(!s1.is_degenerate());
        CGAL_kernel_precondition(!s2.is_degenerate());
        CGAL_kernel_precondition(!s3.is_degenerate());
        if(non_oriented_equal<SK>(s1,s2) && non_oriented_equal<SK>(s2,s3)) {
-         *res++ = result_type(s1);
+         *res++ = s1;
          return res;
        }
        if(non_oriented_equal<SK>(s1,s2)) {
          if(typename Intersection_traits<SK, Sphere_3, Sphere_3>::result_type v =
             SK().intersect_3_object()(s1, s3)) {
-           internal::Point_conversion_visitor<SK, result_type, OutputIterator> visitor(res);
+           internal::Point_conversion_visitor<SK, OutputIterator> visitor(res);
            return std::visit(visitor,
              *v);
          }
@@ -299,7 +289,7 @@ namespace CGAL {
        if(non_oriented_equal<SK>(s1,s3) || non_oriented_equal<SK>(s2,s3)) {
          if(typename Intersection_traits<SK, Sphere_3, Sphere_3>::result_type v =
             SK().intersect_3_object()(s1, s2)) {
-           internal::Point_conversion_visitor<SK, result_type, OutputIterator> visitor(res);
+           internal::Point_conversion_visitor<SK, OutputIterator> visitor(res);
            return std::visit(
              visitor,
              *v);
@@ -312,13 +302,13 @@ namespace CGAL {
          if(!v) return res;
          if(const Point_3* p = CGAL::Intersections::internal::intersect_get<Point_3>(v)) {
             if(SK().has_on_3_object()(s3, *p)) {
-              *res++ = result_type(std::make_pair(Circular_arc_point_3(*p),2u));
+              *res++ = std::make_pair(Circular_arc_point_3(*p),2u);
             }
              return res;
          }
          if(const Circle_3* c = CGAL::Intersections::internal::intersect_get<Circle_3>(v)) {
             if(SK().has_on_3_object()(s3, *c)) {
-              *res++ = result_type(*c);
+              *res++ = *c;
             }
            return res;
          }
@@ -332,7 +322,7 @@ namespace CGAL {
        algebraic_solutions_container solutions;
        Algebraic_kernel().solve_object()(e1, e2, e3, std::back_inserter(solutions));
 
-       return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK, result_type>());
+       return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK>());
     }
 
     template < class SK, class OutputIterator >
@@ -342,8 +332,6 @@ namespace CGAL {
                 const typename SK::Sphere_3 & s2,
                 OutputIterator res)
     {
-      typedef typename std::variant< std::pair< typename SK::Circular_arc_point_3, unsigned int>,
-                                       typename SK::Circle_3 > result_type;
       typedef typename SK::Root_for_spheres_2_3  Root_for_spheres_2_3;
       typedef typename SK::Polynomial_for_spheres_2_3  Equation_sphere;
       typedef typename SK::Polynomial_1_3  Equation_plane;
@@ -356,7 +344,7 @@ namespace CGAL {
       if(non_oriented_equal<SK>(s1,s2)) {
         if(typename Intersection_traits<SK, Plane_3, Sphere_3>::result_type v =
             SK().intersect_3_object()(p, s1)) {
-           internal::Point_conversion_visitor<SK, result_type, OutputIterator> visitor(res);
+           internal::Point_conversion_visitor<SK, OutputIterator> visitor(res);
            return std::visit(
              visitor,
              *v);
@@ -367,7 +355,7 @@ namespace CGAL {
       if(non_oriented_equal<SK>(p,radical_p)) {
         if(typename Intersection_traits<SK, Plane_3, Sphere_3>::result_type v =
             SK().intersect_3_object()(p, s1)) {
-           internal::Point_conversion_visitor<SK, result_type, OutputIterator> visitor(res);
+           internal::Point_conversion_visitor<SK, OutputIterator> visitor(res);
            return std::visit(
              visitor,
              *v);
@@ -381,7 +369,7 @@ namespace CGAL {
         algebraic_solutions_container;
       algebraic_solutions_container solutions;
       Algebraic_kernel().solve_object()(e1, e2, e3, std::back_inserter(solutions));
-      return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK, result_type>());
+      return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK>());
     }
 
     template < class SK, class OutputIterator >
@@ -391,8 +379,6 @@ namespace CGAL {
                 const typename SK::Sphere_3 & s,
                 OutputIterator res)
     {
-      typedef typename std::variant< std::pair< typename SK::Circular_arc_point_3, unsigned int>,
-                                       typename SK::Circle_3 > result_type;
       typedef typename SK::Root_for_spheres_2_3  Root_for_spheres_2_3;
       typedef typename SK::Polynomial_for_spheres_2_3  Equation_sphere;
       typedef typename SK::Polynomial_1_3  Equation_plane;
@@ -405,7 +391,7 @@ namespace CGAL {
       if(non_oriented_equal<SK>(p1,p2)) {
         if(typename Intersection_traits<SK, Plane_3, Sphere_3>::result_type v =
             SK().intersect_3_object()(p1, s)) {
-           internal::Point_conversion_visitor<SK, result_type, OutputIterator> visitor(res);
+           internal::Point_conversion_visitor<SK, OutputIterator> visitor(res);
            return std::visit(
              visitor,
              *v);
@@ -419,7 +405,7 @@ namespace CGAL {
         algebraic_solutions_container;
       algebraic_solutions_container solutions;
       Algebraic_kernel().solve_object()(e1, e2, e3, std::back_inserter(solutions));
-      return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK, result_type>());
+      return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK>());
     }
 
     template < class SK, class OutputIterator >
@@ -449,13 +435,9 @@ namespace CGAL {
       typedef typename SK::Root_for_spheres_2_3     Root_for_spheres_2_3;
       typedef typename SK::Polynomials_for_circle_3 Equation_circle;
       typedef typename SK::Algebraic_kernel         Algebraic_kernel;
-      typedef typename SK::Circle_3                 Circle_3;
-
-      typedef typename SK3_Intersection_traits<SK, Circle_3, Circle_3>
-        ::type result_type;
 
       if(non_oriented_equal<SK>(c1,c2)) {
-         *res++ = CGAL::internal::sk3_intersection_return<result_type>(c1);
+         *res++ = c1;
          return res;
       }
       Equation_circle e1 = get_equation<SK>(c1);
@@ -464,7 +446,7 @@ namespace CGAL {
         algebraic_solutions_container;
       algebraic_solutions_container solutions;
       Algebraic_kernel().solve_object()(e1, e2, std::back_inserter(solutions));
-      return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK, result_type>());
+      return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK>());
     }
 
     template < class SK, class OutputIterator >
@@ -476,10 +458,6 @@ namespace CGAL {
       typedef typename SK::Root_for_spheres_2_3     Root_for_spheres_2_3;
       typedef typename SK::Polynomials_for_circle_3 Equation_circle;
       typedef typename SK::Polynomials_for_line_3   Equation_line;
-      typedef typename SK::Circle_3                 Circle_3;
-
-      typedef typename SK3_Intersection_traits<SK, Circle_3, typename SK::Line_3>
-        ::type result_type;
 
       typedef typename SK::Algebraic_kernel  Algebraic_kernel;
       CGAL_kernel_precondition(!l.is_degenerate());
@@ -489,7 +467,7 @@ namespace CGAL {
         algebraic_solutions_container;
       algebraic_solutions_container solutions;
       Algebraic_kernel().solve_object()(e1, e2, std::back_inserter(solutions));
-      return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK, result_type>());
+      return std::transform(solutions.begin(), solutions.end(), res, internal::pair_transform<SK>());
     }
 
     // At the moment we dont need those functions
diff --git a/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_functionalities_on_sphere.h b/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_functionalities_on_sphere.h
index d02daa9fe8a2..a4ba682726df 100644
--- a/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_functionalities_on_sphere.h
+++ b/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_functionalities_on_sphere.h
@@ -66,21 +66,21 @@ void test_normal_circle_monotonicity(const typename SK::Circle_3& circle,
                                      const typename SK::Sphere_3& ref_sphere)
 {
   typename SK::Is_theta_monotone_3 is_t_mon=SK().is_theta_monotone_3_object(ref_sphere);
-  std::vector<CGAL::Object> vect_obj;
+  std::vector<std::variant<typename SK::Circle_3, std::pair<typename SK::Circular_arc_point_3, unsigned>>> vect_obj;
   typename SK::FT zcoord = CGAL::SphericalFunctors::extremal_points_z_coordinate<SK>(circle,ref_sphere);
   //create extremal points of circle
   SK().intersect_3_object()(circle,typename SK::Plane_3(0,0,1,-zcoord),std::back_inserter(vect_obj));
   assert(vect_obj.size()==2);
   typename SK::Circular_arc_point_3 extrems[2];
-  extrems[0]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[0])->first;
-  extrems[1]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[1])->first;
+  extrems[0]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[0])->first;
+  extrems[1]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[1])->first;
   //create non extremal points on circle
   vect_obj.clear();
   SK().intersect_3_object()(circle,typename SK::Plane_3(0,0,1,-zcoord-typename SK::FT(0.1)),std::back_inserter(vect_obj));
   assert(vect_obj.size()==2);
   typename SK::Circular_arc_point_3 other_pts[2];
-  other_pts[0]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[0])->first;
-  other_pts[1]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[1])->first;
+  other_pts[0]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[0])->first;
+  other_pts[1]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[1])->first;
 
   //Test Make_theta_monotone+[Ii]s_theta_monotone(_3) on monotone arcs
   test_make_monotone_an_already_monotone_arc<SK>(typename SK::Circular_arc_3(circle,extrems[0],extrems[1]),ref_sphere);
@@ -122,18 +122,18 @@ void test_threaded_circle_monotonicity(const typename SK::Circle_3& circle,
                                        const typename SK::Sphere_3& ref_sphere)
 {
   typename SK::Is_theta_monotone_3 is_t_mon=SK().is_theta_monotone_3_object(ref_sphere);
-  std::vector<CGAL::Object> vect_obj;
+  std::vector<std::variant<typename SK::Circle_3, std::pair<typename SK::Circular_arc_point_3,unsigned>>> vect_obj;
   SK().intersect_3_object()(circle,typename SK::Plane_3(1,0,0,-ref_sphere.center().x()),std::back_inserter(vect_obj));
   assert(vect_obj.size()==2);
   typename SK::Circular_arc_point_3 pts1[2];
-  pts1[0]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[0])->first;
-  pts1[1]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[1])->first;
+  pts1[0]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[0])->first;
+  pts1[1]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[1])->first;
   vect_obj.clear();
   SK().intersect_3_object()(circle,typename SK::Plane_3(1,1,0,-ref_sphere.center().x()-ref_sphere.center().y()),std::back_inserter(vect_obj));
   assert(vect_obj.size()==2);
   typename SK::Circular_arc_point_3 pts2[2];
-  pts2[0]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[0])->first;
-  pts2[1]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[1])->first;
+  pts2[0]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[0])->first;
+  pts2[1]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[1])->first;
   //assertions
   test_make_monotone_an_already_monotone_arc<SK>(typename SK::Circular_arc_3(circle,pts1[0],pts1[1]),ref_sphere);
   test_make_monotone_an_already_monotone_arc<SK>(typename SK::Circular_arc_3(circle,pts2[0],pts2[1]),ref_sphere);
@@ -154,12 +154,12 @@ void test_polar_circle_monotonicity(const typename SK::Circle_3& circle,
                                     const typename SK::Sphere_3& ref_sphere)
 {
   typename SK::Is_theta_monotone_3 is_t_mon=SK().is_theta_monotone_3_object(ref_sphere);
-  std::vector<CGAL::Object> vect_obj;
+  std::vector<std::variant<typename SK::Circle_3, std::pair<typename SK::Circular_arc_point_3,unsigned>>> vect_obj;
   SK().intersect_3_object()(circle,typename SK::Plane_3(0,0,1,-circle.center().z()),std::back_inserter(vect_obj));
   assert(vect_obj.size()==2);
   typename SK::Circular_arc_point_3 pts[2];
-  pts[0]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[0])->first;
-  pts[1]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[1])->first;
+  pts[0]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[0])->first;
+  pts[1]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&vect_obj[1])->first;
 
 
 
@@ -262,11 +262,11 @@ void fill_intersections(const typename SK::Circle_3& circle,
                         typename SK::Circular_arc_point_3* inters,unsigned i)
 {
   typename SK::Plane_3 meridians=get_meridians<SK>(i,ref.center());
-  std::vector<CGAL::Object> objs;
+  std::vector<std::variant<typename SK::Circle_3, std::pair<typename SK::Circular_arc_point_3,unsigned>>> objs;
   SK().intersect_3_object()(circle,meridians,std::back_inserter(objs));
   assert(objs.size()==2);
-  inters[get_num(i,0)]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
-  inters[get_num(i,1)]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+  inters[get_num(i,0)]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
+  inters[get_num(i,1)]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
 }
 
 
@@ -316,7 +316,7 @@ void test_extremal_points(const typename SK::Circle_3& circle,
   const typename SK::Circular_arc_point_3& inter2=cut_by_M0?xtrms[0]:xtrms[1];
 
   typename SK::Intersect_3 func=SK().intersect_3_object();
-  std::vector<CGAL::Object> intersections;
+  std::vector<std::variant<typename SK::Circle_3, std::pair<typename SK::Circular_arc_point_3,unsigned>>> intersections;
 
   std::pair<typename SK::Vector_3,typename SK::Vector_3> vect_pair=get_bounding_vectors<SK>(inter1,ref_sphere);
   func(circle,typename SK::Plane_3(ref_sphere.center(),ref_sphere.center()+typename SK::Vector_3(0,0,1),ref_sphere.center()+vect_pair.first),std::back_inserter(intersections));
@@ -391,11 +391,11 @@ test_functionalities_on_a_reference_sphere(const typename SK::Point_3& ref_spher
     assert( cmp_theta(y_xtrems[0],y_xtrems[1])==CGAL::LARGER );
 
     typename SK::FT zcoord=CGAL::SphericalFunctors::extremal_points_z_coordinate<SK>(normal_cut_M0,ref_sphere);
-    CGAL::Object objs[2];
+    std::variant<typename SK::Circle_3, std::pair<typename SK::Circular_arc_point_3,unsigned>> objs[2];
     SK().intersect_3_object()(normal_cut_M0,typename SK::Plane_3(0,0,1,-zcoord),objs);
     typename SK::Circular_arc_point_3 xtrms[2];
-    xtrms[0]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
-    xtrms[1]=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+    xtrms[0]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
+    xtrms[1]=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
 
     assert( cmp_theta(xtrms[0],xtrms[1])==CGAL::LARGER );
     assert( cmp_theta(xtrms[0],y_xtrems[0])==CGAL::SMALLER );
@@ -440,11 +440,11 @@ test_functionalities_on_a_reference_sphere(const typename SK::Point_3& ref_spher
     //polar circle
     typename SK::Line_3 line_n(ref_sphere_center,north_polar.center()-ref_sphere_center);
     typename SK::Line_3 line_s(ref_sphere_center,south_polar.center()-ref_sphere_center);
-    CGAL::Object objs[2];
+    std::variant<typename SK::Circle_3, std::pair<typename SK::Circular_arc_point_3,unsigned>> objs[2];
     SK().intersect_3_object()(line_n,ref_sphere,objs);
-    typename SK::Circular_arc_point_3 cn=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+    typename SK::Circular_arc_point_3 cn=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
     SK().intersect_3_object()(line_s,ref_sphere,objs);
-    typename SK::Circular_arc_point_3 cs=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+    typename SK::Circular_arc_point_3 cs=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
 
     assert (cmp_z_at_theta(cn,typename SK::Circular_arc_3(north_polar,north_pole))==CGAL::LARGER );
     assert (cmp_z_at_theta(cs,typename SK::Circular_arc_3(north_polar,north_pole))==CGAL::SMALLER );
@@ -472,9 +472,9 @@ test_functionalities_on_a_reference_sphere(const typename SK::Point_3& ref_spher
     typename SK::Line_3 line_1(ref_sphere_center,normal1.center()-ref_sphere_center);
     typename SK::Line_3 line_2(ref_sphere_center,normal2.center()-ref_sphere_center);
     SK().intersect_3_object()(line_1,ref_sphere,objs);
-    typename SK::Circular_arc_point_3 c1=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+    typename SK::Circular_arc_point_3 c1=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
     SK().intersect_3_object()(line_2,ref_sphere,objs);
-    typename SK::Circular_arc_point_3 c2=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+    typename SK::Circular_arc_point_3 c2=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
 
     typename SK::Circular_arc_point_3 xtrms1[2];
     typename SK::Circular_arc_point_3 xtrms2[2];
@@ -541,10 +541,10 @@ test_functionalities_on_a_reference_sphere(const typename SK::Point_3& ref_spher
     //normal vs normal
     typename SK::Circle_3 normal3 (ref_sphere,typename SK::Plane_3(0.08,1.1,0.9  ,-1-FT(0.08)*ref_sphere_center.x() -FT(1.1)*ref_sphere_center.y()-FT(0.9)*ref_sphere_center.z()));
     typename SK::Circle_3 normal4 (ref_sphere,typename SK::Plane_3(0.05,1.1,-0.9 ,-1-FT(0.05)*ref_sphere_center.x() -FT(1.1)*ref_sphere_center.y()+FT(0.9)*ref_sphere_center.z()));
-    std::vector<CGAL::Object> objs;
+    std::vector<std::variant<typename SK::Circle_3, std::pair<typename SK::Circular_arc_point_3,unsigned>>> objs;
     SK().intersect_3_object()(normal3,normal4,std::back_inserter(objs));
-    typename SK::Circular_arc_point_3 int1=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
-    typename SK::Circular_arc_point_3 int2=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
+    typename SK::Circular_arc_point_3 int1=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+    typename SK::Circular_arc_point_3 int2=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
     typename SK::Circular_arc_point_3 xtrms3[2];
     typename SK::Circular_arc_point_3 xtrms4[2];
     CGAL::theta_extremal_points(normal3,ref_sphere,xtrms3);
@@ -554,8 +554,8 @@ test_functionalities_on_a_reference_sphere(const typename SK::Point_3& ref_spher
     //normal vs threaded
     objs.clear();
     SK().intersect_3_object()(threaded,normal4,std::back_inserter(objs));
-    int1=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
-    int2=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
+    int1=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+    int2=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
     assert ( cmp_right(typename SK::Circular_arc_3(threaded),typename SK::Circular_arc_3(normal4,xtrms4[1],xtrms4[0]),int1)==CGAL::SMALLER );
     assert ( cmp_right(typename SK::Circular_arc_3(threaded),typename SK::Circular_arc_3(normal4,xtrms4[1],xtrms4[0]),int2)==CGAL::LARGER );
     //normal vs polar
@@ -563,8 +563,8 @@ test_functionalities_on_a_reference_sphere(const typename SK::Point_3& ref_spher
     typename SK::Circular_arc_point_3 xtrms2[2];
     CGAL::theta_extremal_points(normal2,ref_sphere,xtrms2);
     SK().intersect_3_object()(south_polar,normal2,std::back_inserter(objs));
-    int1=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
-    int2=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
+    int1=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+    int2=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
     assert ( cmp_right(typename SK::Circular_arc_3(south_polar,south_pole),typename SK::Circular_arc_3(normal2,xtrms2[0],xtrms2[1]),int1)==CGAL::LARGER );
     assert ( cmp_right(typename SK::Circular_arc_3(south_polar,south_pole),typename SK::Circular_arc_3(normal2,xtrms2[0],xtrms2[1]),int2)==CGAL::SMALLER );
     //polar vs polar
@@ -574,15 +574,15 @@ test_functionalities_on_a_reference_sphere(const typename SK::Point_3& ref_spher
     assert(CGAL::classify(spolar,ref_sphere)==CGAL::POLAR);
     objs.clear();
     SK().intersect_3_object()(npolar,spolar,std::back_inserter(objs));
-    int1=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
-    int2=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
+    int1=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+    int2=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
     assert ( cmp_right(typename SK::Circular_arc_3(npolar,north_pole),typename SK::Circular_arc_3(spolar,south_pole),int1)==CGAL::SMALLER );
     assert ( cmp_right(typename SK::Circular_arc_3(npolar,north_pole),typename SK::Circular_arc_3(spolar,south_pole),int2)==CGAL::LARGER );
     //polar vs threaded
     objs.clear();
     SK().intersect_3_object()(south_polar,threaded,std::back_inserter(objs));
-    int1=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
-    int2=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
+    int1=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+    int2=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
     assert ( cmp_right(typename SK::Circular_arc_3(south_polar,south_pole),typename SK::Circular_arc_3(threaded),int1)==CGAL::LARGER );
     assert ( cmp_right(typename SK::Circular_arc_3(south_polar,south_pole),typename SK::Circular_arc_3(threaded),int2)==CGAL::SMALLER );
     //threaded vs threaded
@@ -590,8 +590,8 @@ test_functionalities_on_a_reference_sphere(const typename SK::Point_3& ref_spher
     typename SK::Circle_3 threaded2 (ref_sphere,typename SK::Plane_3(0,1.1,-0.9,-FT(1.1)*ref_sphere_center.y()+FT(0.9)*ref_sphere_center.z()));
     objs.clear();
     SK().intersect_3_object()(threaded1,threaded2,std::back_inserter(objs));
-    int1=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
-    int2=CGAL::object_cast<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
+    int1=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[1])->first;
+    int2=std::get_if<std::pair<typename SK::Circular_arc_point_3,unsigned> >(&objs[0])->first;
     assert ( cmp_right(typename SK::Circular_arc_3(threaded1),typename SK::Circular_arc_3(threaded2),int1)==CGAL::SMALLER );
     assert ( cmp_right(typename SK::Circular_arc_3(threaded1),typename SK::Circular_arc_3(threaded2),int2)==CGAL::LARGER );
   //tangency tests global
diff --git a/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_sphere_constructions.h b/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_sphere_constructions.h
index 363d4b2087b1..cac9217e3711 100644
--- a/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_sphere_constructions.h
+++ b/Circular_kernel_3/test/Circular_kernel_3/include/CGAL/_test_sphere_constructions.h
@@ -15,6 +15,31 @@
 
 #include <CGAL/Random.h>
 #include <cassert>
+#include <variant>
+#include <optional>
+
+template <class Expected, class V>
+bool assign_variant(Expected& e, const V& v)
+{
+  if (std::get_if<Expected>(&v) != nullptr)
+  {
+    e = std::get<Expected>(v);
+    return true;
+  }
+  return false;
+}
+
+template <class Expected, class V>
+bool assign_variant(Expected& e, const std::optional<V>& ov)
+{
+  if (ov==std::nullopt) return false;
+  if (std::get_if<Expected>(&(ov.value())) != nullptr)
+  {
+    e = std::get<Expected>(ov.value());
+    return true;
+  }
+  return false;
+}
 
 template <class SK>
 void _test_circular_arc_point_construct(SK sk) {
@@ -547,7 +572,7 @@ void _test_intersection_construct(SK sk) {
         const FT z = FT(vz);
         Line_3 l1 = theConstruct_line_3(Point_3(-1,0,0), Point_3(x,y,z));
         Line_3 l2 = theConstruct_line_3(Point_3(FT(-1)-FT(FT(1) / FT(1000000)),FT(0),FT(0)), Point_3(x,y,z));
-        std::vector< CGAL::Object > intersection_1, intersection_2;
+        std::vector< std::variant< std::pair<Circular_arc_point_3, unsigned> > > intersection_1, intersection_2;
         theIntersect_3(s, l1, std::back_inserter(intersection_1));
         theIntersect_3(s, l2, std::back_inserter(intersection_2));
 
@@ -557,7 +582,7 @@ void _test_intersection_construct(SK sk) {
           assert(theDo_intersect_3(s, l1));
           assert(intersection_1.size() == 1);
           std::pair<Circular_arc_point_3, unsigned > the_pair1;
-          assert(assign(the_pair1, intersection_1[0]));
+          assert(assign_variant(the_pair1, intersection_1[0]));
           assert(theHas_on_3(s,the_pair1.first));
           assert(theHas_on_3(l1,the_pair1.first));
 
@@ -572,8 +597,8 @@ void _test_intersection_construct(SK sk) {
           assert(theDo_intersect_3(s, l1));
           std::pair<Circular_arc_point_3, unsigned > the_pair1;
           std::pair<Circular_arc_point_3, unsigned > the_pair2;
-          assert(assign(the_pair1, intersection_1[0]));
-          assert(assign(the_pair2, intersection_1[1]));
+          assert(assign_variant(the_pair1, intersection_1[0]));
+          assert(assign_variant(the_pair2, intersection_1[1]));
           assert(theHas_on_3(s,the_pair1.first));
           assert(theHas_on_3(l1,the_pair1.first));
           assert(theHas_on_3(s,the_pair2.first));
@@ -583,8 +608,8 @@ void _test_intersection_construct(SK sk) {
           assert(theDo_intersect_3(s, l2));
           std::pair<Circular_arc_point_3, unsigned > the_pair3;
           std::pair<Circular_arc_point_3, unsigned > the_pair4;
-          assert(assign(the_pair3, intersection_2[0]));
-          assert(assign(the_pair4, intersection_2[1]));
+          assert(assign_variant(the_pair3, intersection_2[0]));
+          assert(assign_variant(the_pair4, intersection_2[1]));
           assert(theHas_on_3(s,the_pair3.first));
           assert(theHas_on_3(l2,the_pair3.first));
           assert(theHas_on_3(s,the_pair4.first));
@@ -604,7 +629,7 @@ void _test_intersection_construct(SK sk) {
         const FT z = FT(vz);
         Line_3 l1 = theConstruct_line_3(Point_3(-1,0,0), Point_3(x,y,z));
         Line_3 l2 = theConstruct_line_3(Point_3(FT(-1)-FT(FT(1) / FT(1000000)),FT(0),FT(0)), Point_3(x,y,z));
-        std::vector< CGAL::Object > intersection_1, intersection_2;
+        std::vector< std::variant< std::pair<Circular_arc_point_3, unsigned> > > intersection_1, intersection_2;
         intersection(s, l1, std::back_inserter(intersection_1));
         intersection(s, l2, std::back_inserter(intersection_2));
 
@@ -614,7 +639,7 @@ void _test_intersection_construct(SK sk) {
                                         assert(do_intersect(s, l1));
           assert(intersection_1.size() == 1);
           std::pair<Circular_arc_point_3, unsigned > the_pair1;
-          assert(assign(the_pair1, intersection_1[0]));
+          assert(assign_variant(the_pair1, intersection_1[0]));
           assert(theHas_on_3(s,the_pair1.first));
           assert(theHas_on_3(l1,the_pair1.first));
 
@@ -629,8 +654,8 @@ void _test_intersection_construct(SK sk) {
           assert(do_intersect(s, l1));
           std::pair<Circular_arc_point_3, unsigned > the_pair1;
           std::pair<Circular_arc_point_3, unsigned > the_pair2;
-          assert(assign(the_pair1, intersection_1[0]));
-          assert(assign(the_pair2, intersection_1[1]));
+          assert(assign_variant(the_pair1, intersection_1[0]));
+          assert(assign_variant(the_pair2, intersection_1[1]));
           assert(theHas_on_3(s,the_pair1.first));
           assert(theHas_on_3(l1,the_pair1.first));
           assert(theHas_on_3(s,the_pair2.first));
@@ -640,8 +665,8 @@ void _test_intersection_construct(SK sk) {
           assert(do_intersect(s, l2));
           std::pair<Circular_arc_point_3, unsigned > the_pair3;
           std::pair<Circular_arc_point_3, unsigned > the_pair4;
-          assert(assign(the_pair3, intersection_2[0]));
-          assert(assign(the_pair4, intersection_2[1]));
+          assert(assign_variant(the_pair3, intersection_2[0]));
+          assert(assign_variant(the_pair4, intersection_2[1]));
           assert(theHas_on_3(s,the_pair3.first));
           assert(theHas_on_3(l2,the_pair3.first));
           assert(theHas_on_3(s,the_pair4.first));
@@ -665,20 +690,20 @@ void _test_intersection_construct(SK sk) {
           const FT r = 4*FT(vr) / FT(2);
           Sphere_3 sl = theConstruct_sphere_3(
             Polynomial_for_spheres_2_3(x,y,z,r*r));
-          std::vector< CGAL::Object > intersection_1;
-          std::vector< CGAL::Object > intersection_2;
+          std::vector< std::variant<Circle_3, Sphere_3, std::pair<Circular_arc_point_3, unsigned> > > intersection_1;
+          std::vector< std::variant<Circle_3, Sphere_3, std::pair<Circular_arc_point_3, unsigned> > > intersection_2;
           theIntersect_3(s1, s2, sl, std::back_inserter(intersection_1));
           theIntersect_3(s1, s3, sl, std::back_inserter(intersection_2));
           if(intersection_1.size() == 1) {
                   assert(theDo_intersect_3(s1, s2, sl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_1[0])) {
+            if(assign_variant(circle,intersection_1[0])) {
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(s2,circle));
               assert(theHas_on_3(sl,circle));
             }
-            if(assign(cap,intersection_1[0])) {
+            if(assign_variant(cap,intersection_1[0])) {
               // This case must never happen
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(s2,cap.first));
@@ -688,8 +713,8 @@ void _test_intersection_construct(SK sk) {
           if(intersection_1.size() == 2) {
                   assert(theDo_intersect_3(s1, s2, sl));
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_1[0]));
-            assert(assign(cap2,intersection_1[1]));
+            assert(assign_variant(cap1,intersection_1[0]));
+            assert(assign_variant(cap2,intersection_1[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(s2,cap1.first));
             assert(theHas_on_3(sl,cap1.first));
@@ -702,13 +727,13 @@ void _test_intersection_construct(SK sk) {
                   assert(theDo_intersect_3(s1, s3, sl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_2[0])) {
+            if(assign_variant(circle,intersection_2[0])) {
               // This case must never happen
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(s3,circle));
               assert(theHas_on_3(sl,circle));
             }
-            if(assign(cap,intersection_2[0])) {
+            if(assign_variant(cap,intersection_2[0])) {
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(s3,cap.first));
               assert(theHas_on_3(sl,cap.first));
@@ -718,8 +743,8 @@ void _test_intersection_construct(SK sk) {
                   assert(theDo_intersect_3(s1, s3, sl));
             // This case must never happen
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_2[0]));
-            assert(assign(cap2,intersection_2[1]));
+            assert(assign_variant(cap1,intersection_2[0]));
+            assert(assign_variant(cap2,intersection_2[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(s3,cap1.first));
             assert(theHas_on_3(sl,cap1.first));
@@ -743,20 +768,20 @@ void _test_intersection_construct(SK sk) {
           const FT r = 4*FT(vr) / FT(2);
           Sphere_3 sl = theConstruct_sphere_3(
             Polynomial_for_spheres_2_3(x,y,z,r*r));
-          std::vector< CGAL::Object > intersection_1;
-          std::vector< CGAL::Object > intersection_2;
+          std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3, Sphere_3> > intersection_1;
+          std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3, Sphere_3> > intersection_2;
           intersection(s1, s2, sl, std::back_inserter(intersection_1));
           intersection(s1, s3, sl, std::back_inserter(intersection_2));
           if(intersection_1.size() == 1) {
             assert(CGAL::do_intersect(s1, s2, sl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_1[0])) {
+            if(assign_variant(circle,intersection_1[0])) {
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(s2,circle));
               assert(theHas_on_3(sl,circle));
             }
-            if(assign(cap,intersection_1[0])) {
+            if(assign_variant(cap,intersection_1[0])) {
               // This case must never happen
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(s2,cap.first));
@@ -766,8 +791,8 @@ void _test_intersection_construct(SK sk) {
           if(intersection_1.size() == 2) {
             assert(CGAL::do_intersect(s1, s2, sl));
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_1[0]));
-            assert(assign(cap2,intersection_1[1]));
+            assert(assign_variant(cap1,intersection_1[0]));
+            assert(assign_variant(cap2,intersection_1[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(s2,cap1.first));
             assert(theHas_on_3(sl,cap1.first));
@@ -780,13 +805,13 @@ void _test_intersection_construct(SK sk) {
             assert(CGAL::do_intersect(s1, s3, sl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_2[0])) {
+            if(assign_variant(circle,intersection_2[0])) {
               // This case must never happen
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(s3,circle));
               assert(theHas_on_3(sl,circle));
             }
-            if(assign(cap,intersection_2[0])) {
+            if(assign_variant(cap,intersection_2[0])) {
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(s3,cap.first));
               assert(theHas_on_3(sl,cap.first));
@@ -796,8 +821,8 @@ void _test_intersection_construct(SK sk) {
             assert(CGAL::do_intersect(s1, s3, sl));
             // This case must never happen
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_2[0]));
-            assert(assign(cap2,intersection_2[1]));
+            assert(assign_variant(cap1,intersection_2[0]));
+            assert(assign_variant(cap2,intersection_2[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(s3,cap1.first));
             assert(theHas_on_3(sl,cap1.first));
@@ -823,20 +848,20 @@ void _test_intersection_construct(SK sk) {
           if(a == 0 && b == 0 && c == 0) continue;
           Plane_3 pl = theConstruct_plane_3(
             Polynomial_1_3(a,b,c,d));
-          std::vector< CGAL::Object > intersection_1;
-          std::vector< CGAL::Object > intersection_2;
+          std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_1;
+          std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_2;
           theIntersect_3(s1, s2, pl, std::back_inserter(intersection_1));
           theIntersect_3(s1, s3, pl, std::back_inserter(intersection_2));
           if(intersection_1.size() == 1) {
                   assert(theDo_intersect_3(s1, s2, pl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_1[0])) {
+            if(assign_variant(circle,intersection_1[0])) {
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(s2,circle));
               assert(theHas_on_3(pl,circle));
             }
-            if(assign(cap,intersection_1[0])) {
+            if(assign_variant(cap,intersection_1[0])) {
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(s2,cap.first));
               assert(theHas_on_3(pl,cap.first));
@@ -845,8 +870,8 @@ void _test_intersection_construct(SK sk) {
           if(intersection_1.size() == 2) {
                   assert(theDo_intersect_3(s1, s2, pl));
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_1[0]));
-            assert(assign(cap2,intersection_1[1]));
+            assert(assign_variant(cap1,intersection_1[0]));
+            assert(assign_variant(cap2,intersection_1[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(s2,cap1.first));
             assert(theHas_on_3(pl,cap1.first));
@@ -858,12 +883,12 @@ void _test_intersection_construct(SK sk) {
                   assert(theDo_intersect_3(s1, s3, pl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_2[0])) {
+            if(assign_variant(circle,intersection_2[0])) {
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(s3,circle));
               assert(theHas_on_3(pl,circle));
             }
-            if(assign(cap,intersection_2[0])) {
+            if(assign_variant(cap,intersection_2[0])) {
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(s3,cap.first));
               assert(theHas_on_3(pl,cap.first));
@@ -872,8 +897,8 @@ void _test_intersection_construct(SK sk) {
           if(intersection_2.size() == 2) {
                   assert(theDo_intersect_3(s1, s3, pl));
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_2[0]));
-            assert(assign(cap2,intersection_2[1]));
+            assert(assign_variant(cap1,intersection_2[0]));
+            assert(assign_variant(cap2,intersection_2[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(s3,cap1.first));
             assert(theHas_on_3(pl,cap1.first));
@@ -898,20 +923,20 @@ void _test_intersection_construct(SK sk) {
           if(a == 0 && b == 0 && c == 0) continue;
           Plane_3 pl = theConstruct_plane_3(
             Polynomial_1_3(a,b,c,d));
-          std::vector< CGAL::Object > intersection_1;
-          std::vector< CGAL::Object > intersection_2;
+          std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_1;
+          std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_2;
           intersection(s1, s2, pl, std::back_inserter(intersection_1));
           intersection(s1, s3, pl, std::back_inserter(intersection_2));
           if(intersection_1.size() == 1) {
                   assert(CGAL::do_intersect(s1, s2, pl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_1[0])) {
+            if(assign_variant(circle,intersection_1[0])) {
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(s2,circle));
               assert(theHas_on_3(pl,circle));
             }
-            if(assign(cap,intersection_1[0])) {
+            if(assign_variant(cap,intersection_1[0])) {
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(s2,cap.first));
               assert(theHas_on_3(pl,cap.first));
@@ -920,8 +945,8 @@ void _test_intersection_construct(SK sk) {
           if(intersection_1.size() == 2) {
                   assert(CGAL::do_intersect(s1, s2, pl));
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_1[0]));
-            assert(assign(cap2,intersection_1[1]));
+            assert(assign_variant(cap1,intersection_1[0]));
+            assert(assign_variant(cap2,intersection_1[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(s2,cap1.first));
             assert(theHas_on_3(pl,cap1.first));
@@ -933,12 +958,12 @@ void _test_intersection_construct(SK sk) {
                   assert(CGAL::do_intersect(s1, s3, pl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_2[0])) {
+            if(assign_variant(circle,intersection_2[0])) {
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(s3,circle));
               assert(theHas_on_3(pl,circle));
             }
-            if(assign(cap,intersection_2[0])) {
+            if(assign_variant(cap,intersection_2[0])) {
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(s3,cap.first));
               assert(theHas_on_3(pl,cap.first));
@@ -947,8 +972,8 @@ void _test_intersection_construct(SK sk) {
           if(intersection_2.size() == 2) {
                   assert(CGAL::do_intersect(s1, s3, pl));
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_2[0]));
-            assert(assign(cap2,intersection_2[1]));
+            assert(assign_variant(cap1,intersection_2[0]));
+            assert(assign_variant(cap2,intersection_2[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(s3,cap1.first));
             assert(theHas_on_3(pl,cap1.first));
@@ -976,20 +1001,20 @@ void _test_intersection_construct(SK sk) {
           if(a == 0 && b == 0 && c == 0) continue;
           Plane_3 pl = theConstruct_plane_3(
             Polynomial_1_3(a,b,c,d));
-          std::vector< CGAL::Object > intersection_1;
-          std::vector< CGAL::Object > intersection_2;
+          std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_1;
+          std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_2;
           theIntersect_3(s1, p1, pl, std::back_inserter(intersection_1));
           theIntersect_3(s1, p2, pl, std::back_inserter(intersection_2));
           if(intersection_1.size() == 1) {
                   assert(theDo_intersect_3(s1, p1, pl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_1[0])) {
+            if(assign_variant(circle,intersection_1[0])) {
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(p1,circle));
               assert(theHas_on_3(pl,circle));
             }
-            if(assign(cap,intersection_1[0])) {
+            if(assign_variant(cap,intersection_1[0])) {
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(p1,cap.first));
               assert(theHas_on_3(pl,cap.first));
@@ -998,8 +1023,8 @@ void _test_intersection_construct(SK sk) {
           if(intersection_1.size() == 2) {
                   assert(theDo_intersect_3(s1, p1, pl));
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_1[0]));
-            assert(assign(cap2,intersection_1[1]));
+            assert(assign_variant(cap1,intersection_1[0]));
+            assert(assign_variant(cap2,intersection_1[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(p1,cap1.first));
             assert(theHas_on_3(pl,cap1.first));
@@ -1011,12 +1036,12 @@ void _test_intersection_construct(SK sk) {
                   assert(theDo_intersect_3(s1, p2, pl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_2[0])) {
+            if(assign_variant(circle,intersection_2[0])) {
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(p2,circle));
               assert(theHas_on_3(pl,circle));
             }
-            if(assign(cap,intersection_2[0])) {
+            if(assign_variant(cap,intersection_2[0])) {
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(p2,cap.first));
               assert(theHas_on_3(pl,cap.first));
@@ -1025,8 +1050,8 @@ void _test_intersection_construct(SK sk) {
           if(intersection_2.size() == 2) {
                   assert(theDo_intersect_3(s1, p2, pl));
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_2[0]));
-            assert(assign(cap2,intersection_2[1]));
+            assert(assign_variant(cap1,intersection_2[0]));
+            assert(assign_variant(cap2,intersection_2[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(p2,cap1.first));
             assert(theHas_on_3(pl,cap1.first));
@@ -1051,20 +1076,20 @@ void _test_intersection_construct(SK sk) {
           if(a == 0 && b == 0 && c == 0) continue;
           Plane_3 pl = theConstruct_plane_3(
             Polynomial_1_3(a,b,c,d));
-          std::vector< CGAL::Object > intersection_1;
-          std::vector< CGAL::Object > intersection_2;
+          std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_1;
+          std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_2;
           intersection(s1, p1, pl, std::back_inserter(intersection_1));
           intersection(s1, p2, pl, std::back_inserter(intersection_2));
           if(intersection_1.size() == 1) {
                   assert(CGAL::do_intersect(s1, p1, pl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_1[0])) {
+            if(assign_variant(circle,intersection_1[0])) {
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(p1,circle));
               assert(theHas_on_3(pl,circle));
             }
-            if(assign(cap,intersection_1[0])) {
+            if(assign_variant(cap,intersection_1[0])) {
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(p1,cap.first));
               assert(theHas_on_3(pl,cap.first));
@@ -1073,8 +1098,8 @@ void _test_intersection_construct(SK sk) {
           if(intersection_1.size() == 2) {
                   assert(CGAL::do_intersect(s1, p1, pl));
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_1[0]));
-            assert(assign(cap2,intersection_1[1]));
+            assert(assign_variant(cap1,intersection_1[0]));
+            assert(assign_variant(cap2,intersection_1[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(p1,cap1.first));
             assert(theHas_on_3(pl,cap1.first));
@@ -1086,12 +1111,12 @@ void _test_intersection_construct(SK sk) {
                   assert(CGAL::do_intersect(s1, p2, pl));
             Circle_3 circle;
             std::pair<Circular_arc_point_3, unsigned> cap;
-            if(assign(circle,intersection_2[0])) {
+            if(assign_variant(circle,intersection_2[0])) {
               assert(theHas_on_3(s1,circle));
               assert(theHas_on_3(p2,circle));
               assert(theHas_on_3(pl,circle));
             }
-            if(assign(cap,intersection_2[0])) {
+            if(assign_variant(cap,intersection_2[0])) {
               assert(theHas_on_3(s1,cap.first));
               assert(theHas_on_3(p2,cap.first));
               assert(theHas_on_3(pl,cap.first));
@@ -1100,8 +1125,8 @@ void _test_intersection_construct(SK sk) {
           if(intersection_2.size() == 2) {
                   assert(CGAL::do_intersect(s1, p2, pl));
             std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-            assert(assign(cap1,intersection_2[0]));
-            assert(assign(cap2,intersection_2[1]));
+            assert(assign_variant(cap1,intersection_2[0]));
+            assert(assign_variant(cap2,intersection_2[1]));
             assert(theHas_on_3(s1,cap1.first));
             assert(theHas_on_3(p2,cap1.first));
             assert(theHas_on_3(pl,cap1.first));
@@ -1134,27 +1159,27 @@ void _test_intersection_construct(SK sk) {
     Circle_3 c2 = theConstruct_circle_3(std::make_pair(es2, pol));
     Circle_3 c3 = theConstruct_circle_3(std::make_pair(es3, pol));
 
-    std::vector< CGAL::Object > intersection_1;
+    std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_1;
     theIntersect_3(c1, c1, std::back_inserter(intersection_1));
     assert(intersection_1.size() == 1);
     assert(theDo_intersect_3(c1, c1));
     Circle_3 circle;
-    assert(assign(circle,intersection_1[0]));
+    assert(assign_variant(circle,intersection_1[0]));
     assert(circle == c1);
 
-    std::vector< CGAL::Object > intersection_2;
+    std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_2;
     theIntersect_3(c1, c2, std::back_inserter(intersection_2));
     assert(intersection_2.size() == 2);
     assert(theDo_intersect_3(c1, c2));
     std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-    assert(assign(cap1,intersection_2[0]));
-    assert(assign(cap2,intersection_2[1]));
+    assert(assign_variant(cap1,intersection_2[0]));
+    assert(assign_variant(cap2,intersection_2[1]));
     assert(theHas_on_3(c1,cap1.first));
     assert(theHas_on_3(c2,cap1.first));
     assert(theHas_on_3(c1,cap2.first));
     assert(theHas_on_3(c2,cap2.first));
 
-    std::vector< CGAL::Object > intersection_3;
+    std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_3;
     theIntersect_3(c1, c3, std::back_inserter(intersection_3));
     if(a != 0) {
             assert(!theDo_intersect_3(c1, c3));
@@ -1163,7 +1188,7 @@ void _test_intersection_construct(SK sk) {
             assert(theDo_intersect_3(c1, c3));
       assert(intersection_3.size() == 1);
       std::pair<Circular_arc_point_3, unsigned> cap;
-      assert(assign(cap,intersection_3[0]));
+      assert(assign_variant(cap,intersection_3[0]));
       assert(theHas_on_3(c1,cap.first));
       assert(theHas_on_3(c3,cap.first));
     }
@@ -1175,12 +1200,12 @@ void _test_intersection_construct(SK sk) {
       const FT dl = 0;
       Polynomial_1_3 pol2 = Polynomial_1_3(al,bl,cl,dl);
       Circle_3 c4 = theConstruct_circle_3(std::make_pair(es1, pol2));
-      std::vector< CGAL::Object > intersection_4;
+      std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_4;
       theIntersect_3(c1, c4, std::back_inserter(intersection_4));
       assert(theDo_intersect_3(c1, c4));
       assert(intersection_4.size() == 2);
-      assert(assign(cap1,intersection_4[0]));
-      assert(assign(cap2,intersection_4[1]));
+      assert(assign_variant(cap1,intersection_4[0]));
+      assert(assign_variant(cap2,intersection_4[1]));
       assert(theHas_on_3(c1,cap1.first));
       assert(theHas_on_3(c4,cap1.first));
       assert(theHas_on_3(c1,cap2.first));
@@ -1193,12 +1218,12 @@ void _test_intersection_construct(SK sk) {
     const FT d_c = -FT(va) / FT(10);
     Polynomial_1_3 pol2 = Polynomial_1_3(a_c,b_c,c_c,d_c);
     Circle_3 c5 = theConstruct_circle_3(std::make_pair(es2, pol2));
-    std::vector< CGAL::Object > intersection_5;
+    std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_5;
     theIntersect_3(c1, c5, std::back_inserter(intersection_5));
     assert(theDo_intersect_3(c1, c5));
     assert(intersection_5.size() == 2);
-    assert(assign(cap1,intersection_5[0]));
-    assert(assign(cap2,intersection_5[1]));
+    assert(assign_variant(cap1,intersection_5[0]));
+    assert(assign_variant(cap2,intersection_5[1]));
     assert(theHas_on_3(c1,cap1.first));
     assert(theHas_on_3(c5,cap1.first));
     assert(theHas_on_3(c1,cap2.first));
@@ -1217,27 +1242,27 @@ void _test_intersection_construct(SK sk) {
     Circle_3 c2 = theConstruct_circle_3(std::make_pair(es2, pol));
     Circle_3 c3 = theConstruct_circle_3(std::make_pair(es3, pol));
 
-    std::vector< CGAL::Object > intersection_1;
+    std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_1;
     intersection(c1, c1, std::back_inserter(intersection_1));
     assert(intersection_1.size() == 1);
     assert(CGAL::do_intersect(c1, c1));
     Circle_3 circle;
-    assert(assign(circle,intersection_1[0]));
+    assert(assign_variant(circle,intersection_1[0]));
     assert(circle == c1);
 
-    std::vector< CGAL::Object > intersection_2;
+    std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_2;
     intersection(c1, c2, std::back_inserter(intersection_2));
     assert(intersection_2.size() == 2);
     assert(CGAL::do_intersect(c1, c2));
     std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-    assert(assign(cap1,intersection_2[0]));
-    assert(assign(cap2,intersection_2[1]));
+    assert(assign_variant(cap1,intersection_2[0]));
+    assert(assign_variant(cap2,intersection_2[1]));
     assert(theHas_on_3(c1,cap1.first));
     assert(theHas_on_3(c2,cap1.first));
     assert(theHas_on_3(c1,cap2.first));
     assert(theHas_on_3(c2,cap2.first));
 
-    std::vector< CGAL::Object > intersection_3;
+    std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_3;
     intersection(c1, c3, std::back_inserter(intersection_3));
     if(a != 0) {
             assert(!do_intersect(c1, c3));
@@ -1246,7 +1271,7 @@ void _test_intersection_construct(SK sk) {
             assert(CGAL::do_intersect(c1, c3));
       assert(intersection_3.size() == 1);
       std::pair<Circular_arc_point_3, unsigned> cap;
-      assert(assign(cap,intersection_3[0]));
+      assert(assign_variant(cap,intersection_3[0]));
       assert(theHas_on_3(c1,cap.first));
       assert(theHas_on_3(c3,cap.first));
     }
@@ -1258,12 +1283,12 @@ void _test_intersection_construct(SK sk) {
       const FT dl = 0;
       Polynomial_1_3 pol2 = Polynomial_1_3(al,bl,cl,dl);
       Circle_3 c4 = theConstruct_circle_3(std::make_pair(es1, pol2));
-      std::vector< CGAL::Object > intersection_4;
+      std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_4;
       intersection(c1, c4, std::back_inserter(intersection_4));
       assert(CGAL::do_intersect(c1, c4));
       assert(intersection_4.size() == 2);
-      assert(assign(cap1,intersection_4[0]));
-      assert(assign(cap2,intersection_4[1]));
+      assert(assign_variant(cap1,intersection_4[0]));
+      assert(assign_variant(cap2,intersection_4[1]));
       assert(theHas_on_3(c1,cap1.first));
       assert(theHas_on_3(c4,cap1.first));
       assert(theHas_on_3(c1,cap2.first));
@@ -1276,12 +1301,12 @@ void _test_intersection_construct(SK sk) {
     const FT d_c = -FT(va) / FT(10);
     Polynomial_1_3 pol2 = Polynomial_1_3(a_c,b_c,c_c,d_c);
     Circle_3 c5 = theConstruct_circle_3(std::make_pair(es2, pol2));
-    std::vector< CGAL::Object > intersection_5;
+    std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> , Circle_3> > intersection_5;
     intersection(c1, c5, std::back_inserter(intersection_5));
     assert(CGAL::do_intersect(c1, c5));
     assert(intersection_5.size() == 2);
-    assert(assign(cap1,intersection_5[0]));
-    assert(assign(cap2,intersection_5[1]));
+    assert(assign_variant(cap1,intersection_5[0]));
+    assert(assign_variant(cap2,intersection_5[1]));
     assert(theHas_on_3(c1,cap1.first));
     assert(theHas_on_3(c5,cap1.first));
     assert(theHas_on_3(c1,cap2.first));
@@ -1310,7 +1335,7 @@ void _test_intersection_construct(SK sk) {
         Circle_3 c1 = theConstruct_circle_3(std::make_pair(pol_s, pol_pl1));
         Circle_3 c2 = theConstruct_circle_3(std::make_pair(pol_s, pol_pl2));
 
-        std::vector< CGAL::Object > intersection_1, intersection_2;
+        std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> > > intersection_1, intersection_2;
         theIntersect_3(c1, l1, std::back_inserter(intersection_1));
         theIntersect_3(c2, l2, std::back_inserter(intersection_2));
 
@@ -1320,7 +1345,7 @@ void _test_intersection_construct(SK sk) {
                 assert(theDo_intersect_3(c1, l1));
           assert(intersection_1.size() == 1);
           std::pair<Circular_arc_point_3, unsigned > the_pair1;
-          assert(assign(the_pair1, intersection_1[0]));
+          assert(assign_variant(the_pair1, intersection_1[0]));
           assert(theHas_on_3(c1,the_pair1.first));
           assert(theHas_on_3(l1,the_pair1.first));
 
@@ -1336,8 +1361,8 @@ void _test_intersection_construct(SK sk) {
           assert(theDo_intersect_3(c1, l1));
           std::pair<Circular_arc_point_3, unsigned > the_pair1;
           std::pair<Circular_arc_point_3, unsigned > the_pair2;
-          assert(assign(the_pair1, intersection_1[0]));
-          assert(assign(the_pair2, intersection_1[1]));
+          assert(assign_variant(the_pair1, intersection_1[0]));
+          assert(assign_variant(the_pair2, intersection_1[1]));
           assert(theHas_on_3(c1,the_pair1.first));
           assert(theHas_on_3(l1,the_pair1.first));
           assert(theHas_on_3(c1,the_pair2.first));
@@ -1347,8 +1372,8 @@ void _test_intersection_construct(SK sk) {
           assert(theDo_intersect_3(c2, l2));
           std::pair<Circular_arc_point_3, unsigned > the_pair3;
           std::pair<Circular_arc_point_3, unsigned > the_pair4;
-          assert(assign(the_pair3, intersection_2[0]));
-          assert(assign(the_pair4, intersection_2[1]));
+          assert(assign_variant(the_pair3, intersection_2[0]));
+          assert(assign_variant(the_pair4, intersection_2[1]));
           assert(theHas_on_3(c2,the_pair3.first));
           assert(theHas_on_3(l2,the_pair3.first));
           assert(theHas_on_3(c2,the_pair4.first));
@@ -1378,7 +1403,7 @@ void _test_intersection_construct(SK sk) {
         Circle_3 c1 = theConstruct_circle_3(std::make_pair(pol_s, pol_pl1));
         Circle_3 c2 = theConstruct_circle_3(std::make_pair(pol_s, pol_pl2));
 
-        std::vector< CGAL::Object > intersection_1, intersection_2;
+        std::vector< std::variant<std::pair<Circular_arc_point_3, unsigned> > > intersection_1, intersection_2;
         intersection(c1, l1, std::back_inserter(intersection_1));
         intersection(c2, l2, std::back_inserter(intersection_2));
 
@@ -1388,7 +1413,7 @@ void _test_intersection_construct(SK sk) {
                 assert(CGAL::do_intersect(c1, l1));
           assert(intersection_1.size() == 1);
           std::pair<Circular_arc_point_3, unsigned > the_pair1;
-          assert(assign(the_pair1, intersection_1[0]));
+          assert(assign_variant(the_pair1, intersection_1[0]));
           assert(theHas_on_3(c1,the_pair1.first));
           assert(theHas_on_3(l1,the_pair1.first));
 
@@ -1404,8 +1429,8 @@ void _test_intersection_construct(SK sk) {
           assert(CGAL::do_intersect(c1, l1));
           std::pair<Circular_arc_point_3, unsigned > the_pair1;
           std::pair<Circular_arc_point_3, unsigned > the_pair2;
-          assert(assign(the_pair1, intersection_1[0]));
-          assert(assign(the_pair2, intersection_1[1]));
+          assert(assign_variant(the_pair1, intersection_1[0]));
+          assert(assign_variant(the_pair2, intersection_1[1]));
           assert(theHas_on_3(c1,the_pair1.first));
           assert(theHas_on_3(l1,the_pair1.first));
           assert(theHas_on_3(c1,the_pair2.first));
@@ -1415,8 +1440,8 @@ void _test_intersection_construct(SK sk) {
           assert(CGAL::do_intersect(c2, l2));
           std::pair<Circular_arc_point_3, unsigned > the_pair3;
           std::pair<Circular_arc_point_3, unsigned > the_pair4;
-          assert(assign(the_pair3, intersection_2[0]));
-          assert(assign(the_pair4, intersection_2[1]));
+          assert(assign_variant(the_pair3, intersection_2[0]));
+          assert(assign_variant(the_pair4, intersection_2[1]));
           assert(theHas_on_3(c2,the_pair3.first));
           assert(theHas_on_3(l2,the_pair3.first));
           assert(theHas_on_3(c2,the_pair4.first));
@@ -1444,13 +1469,13 @@ void _test_intersection_construct(SK sk) {
         for(int t4=t3+1;t4<3;t4++) {
           Point_3 targetl = Point_3(a*t4,b*t4,c*t4);
           Line_arc_3 lb = theConstruct_line_arc_3(l,sourcel,targetl);
-          std::vector< CGAL::Object > intersection_1;
+          std::vector< std::variant<Line_arc_3, std::pair<Circular_arc_point_3, unsigned> > > intersection_1;
           theIntersect_3(la, lb, std::back_inserter(intersection_1));
           if(t1 == t3) {
             Line_arc_3 line_a;
             assert(theDo_intersect_3(la, lb));
             assert(intersection_1.size() == 1);
-            assert(assign(line_a, intersection_1[0]));
+            assert(assign_variant(line_a, intersection_1[0]));
             if(t2 <= t4) {
               assert(theEqual_3(line_a, la));
             } else {
@@ -1460,7 +1485,7 @@ void _test_intersection_construct(SK sk) {
             Line_arc_3 line_a;
             assert(theDo_intersect_3(la, lb));
             assert(intersection_1.size() == 1);
-            assert(assign(line_a, intersection_1[0]));
+            assert(assign_variant(line_a, intersection_1[0]));
             if(t1 > t3) {
               assert(theEqual_3(line_a, la));
             } else {
@@ -1471,14 +1496,14 @@ void _test_intersection_construct(SK sk) {
                   assert(theDo_intersect_3(la, lb));
             std::pair<Circular_arc_point_3, unsigned> pair;
             assert(intersection_1.size() == 1);
-            assert(assign(pair, intersection_1[0]));
+            assert(assign_variant(pair, intersection_1[0]));
             if(t2 == t3) assert(theEqual_3(pair.first,target));
             if(t1 == t4) assert(theEqual_3(pair.first,source));
           } else if((t1 < t3) && (t3 < t2 )) {
             Line_arc_3 line_a;
             assert(theDo_intersect_3(la, lb));
             assert(intersection_1.size() == 1);
-            assert(assign(line_a, intersection_1[0]));
+            assert(assign_variant(line_a, intersection_1[0]));
             if(t2 < t4) {
               Line_arc_3 line_b;
               line_b = theConstruct_line_arc_3(l,sourcel,target);
@@ -1490,7 +1515,7 @@ void _test_intersection_construct(SK sk) {
             Line_arc_3 line_a;
             assert(intersection_1.size() == 1);
             assert(theDo_intersect_3(la, lb));
-            assert(assign(line_a, intersection_1[0]));
+            assert(assign_variant(line_a, intersection_1[0]));
             if(t4 < t2) {
               Line_arc_3 line_b;
               line_b = theConstruct_line_arc_3(l,source,targetl);
@@ -1562,7 +1587,7 @@ void _test_intersection_construct(SK sk) {
                     int n_of_intersection = 0;
                     for(int j=0;j<6;j++) {
                       if(i == j) continue;
-                      std::vector< CGAL::Object > intersection_1;
+                      std::vector< std::variant<Line_arc_3, std::pair<Circular_arc_point_3, unsigned> > > intersection_1;
                       theIntersect_3(l[i], l[j], std::back_inserter(intersection_1));
                       assert((intersection_1.size() == 0) ||
                              (intersection_1.size() == 1));
@@ -1570,7 +1595,7 @@ void _test_intersection_construct(SK sk) {
                               assert(theDo_intersect_3(l[i], l[j]));
                         n_of_intersection++;
                         std::pair<Circular_arc_point_3, unsigned> pair;
-                        assert(assign(pair, intersection_1[0]));
+                        assert(assign_variant(pair, intersection_1[0]));
                         assert(theHas_on_3(l[i],pair.first));
                         assert(theHas_on_3(l[j],pair.first));
                         int n_of_edges = 2;
@@ -1611,13 +1636,13 @@ void _test_intersection_construct(SK sk) {
         for(int t4=t3+1;t4<3;t4++) {
           Point_3 targetl = Point_3(a*t4,b*t4,c*t4);
           Line_arc_3 lb = theConstruct_line_arc_3(l,sourcel,targetl);
-          std::vector< CGAL::Object > intersection_1;
+          std::vector< std::variant<Line_arc_3, std::pair<Circular_arc_point_3, unsigned> > > intersection_1;
           intersection(la, lb, std::back_inserter(intersection_1));
           if(t1 == t3) {
             Line_arc_3 line_a;
             assert(CGAL::do_intersect(la, lb));
             assert(intersection_1.size() == 1);
-            assert(assign(line_a, intersection_1[0]));
+            assert(assign_variant(line_a, intersection_1[0]));
             if(t2 <= t4) {
               assert(theEqual_3(line_a, la));
             } else {
@@ -1627,7 +1652,7 @@ void _test_intersection_construct(SK sk) {
             Line_arc_3 line_a;
             assert(CGAL::do_intersect(la, lb));
             assert(intersection_1.size() == 1);
-            assert(assign(line_a, intersection_1[0]));
+            assert(assign_variant(line_a, intersection_1[0]));
             if(t1 > t3) {
               assert(theEqual_3(line_a, la));
             } else {
@@ -1638,14 +1663,14 @@ void _test_intersection_construct(SK sk) {
             assert(CGAL::do_intersect(la, lb));
             std::pair<Circular_arc_point_3, unsigned> pair;
             assert(intersection_1.size() == 1);
-            assert(assign(pair, intersection_1[0]));
+            assert(assign_variant(pair, intersection_1[0]));
             if(t2 == t3) assert(theEqual_3(pair.first,target));
             if(t1 == t4) assert(theEqual_3(pair.first,source));
           } else if((t1 < t3) && (t3 < t2 )) {
             Line_arc_3 line_a;
             assert(CGAL::do_intersect(la, lb));
             assert(intersection_1.size() == 1);
-            assert(assign(line_a, intersection_1[0]));
+            assert(assign_variant(line_a, intersection_1[0]));
             if(t2 < t4) {
               Line_arc_3 line_b;
               line_b = theConstruct_line_arc_3(l,sourcel,target);
@@ -1657,7 +1682,7 @@ void _test_intersection_construct(SK sk) {
             Line_arc_3 line_a;
             assert(intersection_1.size() == 1);
             assert(CGAL::do_intersect(la, lb));
-            assert(assign(line_a, intersection_1[0]));
+            assert(assign_variant(line_a, intersection_1[0]));
             if(t4 < t2) {
               Line_arc_3 line_b;
               line_b = theConstruct_line_arc_3(l,source,targetl);
@@ -1729,7 +1754,7 @@ void _test_intersection_construct(SK sk) {
                     int n_of_intersection = 0;
                     for(int j=0;j<6;j++) {
                       if(i == j) continue;
-                      std::vector< CGAL::Object > intersection_1;
+                      std::vector< std::variant<Line_arc_3, std::pair<Circular_arc_point_3, unsigned> > > intersection_1;
                       intersection(l[i], l[j], std::back_inserter(intersection_1));
                       assert((intersection_1.size() == 0) ||
                              (intersection_1.size() == 1));
@@ -1737,7 +1762,7 @@ void _test_intersection_construct(SK sk) {
                               assert(CGAL::do_intersect(l[i], l[j]));
                         n_of_intersection++;
                         std::pair<Circular_arc_point_3, unsigned> pair;
-                        assert(assign(pair, intersection_1[0]));
+                        assert(assign_variant(pair, intersection_1[0]));
                         assert(theHas_on_3(l[i],pair.first));
                         assert(theHas_on_3(l[j],pair.first));
                         int n_of_edges = 2;
@@ -1801,7 +1826,7 @@ void _test_intersection_construct(SK sk) {
         for(int t2=0;t2<8;t2++) {
           if(t1 == t2) continue;
           Circular_arc_3 cb = theConstruct_circular_arc_3(cc,cp[t1],cp[t2]);
-          std::vector< CGAL::Object > intersection_1;
+          std::vector< std::variant<Circular_arc_3, std::pair<Circular_arc_point_3, unsigned> > > intersection_1;
           theIntersect_3(ca, cb, std::back_inserter(intersection_1));
           Circular_arc_3 cres, cres2;
           std::pair< Circular_arc_point_3, unsigned > cp1, cp2;
@@ -1809,37 +1834,37 @@ void _test_intersection_construct(SK sk) {
             if(t2 == j) {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(ca,cres));
             } else if(simulate_has_on(i,j,t2)) {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(cb, cres));
             } else {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(ca, cres));
             }
           } else if(t2 == j) {
             if(simulate_has_on(i,j,t1)) {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(cb, cres));
             } else {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(ca, cres));
             }
           } else if(t1 == j) {
             if(t2 == i) {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 2);
-              assert(assign(cp1,intersection_1[0]));
-              assert(assign(cp2,intersection_1[1]));
+              assert(assign_variant(cp1,intersection_1[0]));
+              assert(assign_variant(cp2,intersection_1[1]));
               assert(theEqual_3(cp1.first, cp[i]) ||
                      theEqual_3(cp1.first, cp[j]));
               assert(theEqual_3(cp2.first, cp[i]) ||
@@ -1848,13 +1873,13 @@ void _test_intersection_construct(SK sk) {
             } else if(simulate_has_on(t1,i,t2)) {
               assert(intersection_1.size() == 1);
               assert(theDo_intersect_3(ca, cb));
-              assert(assign(cp1,intersection_1[0]));
+              assert(assign_variant(cp1,intersection_1[0]));
               assert(theEqual_3(cp1.first, cp[t1]));
             } else {
               assert(intersection_1.size() == 2);
               assert(theDo_intersect_3(ca, cb));
-              if(assign(cp1,intersection_1[0]) && assign(cres,intersection_1[1]));
-              else if(assign(cres,intersection_1[0]) && assign(cp1,intersection_1[1]));
+              if(assign_variant(cp1,intersection_1[0]) && assign_variant(cres,intersection_1[1]));
+              else if(assign_variant(cres,intersection_1[0]) && assign_variant(cp1,intersection_1[1]));
               else assert(false);
               Circular_arc_3 conf = theConstruct_circular_arc_3(cc,cp[i],cp[t2]);
               assert(theEqual_3(conf, cres));
@@ -1864,8 +1889,8 @@ void _test_intersection_construct(SK sk) {
             if(t1 == j) {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 2);
-              assert(assign(cp1,intersection_1[0]));
-              assert(assign(cp2,intersection_1[1]));
+              assert(assign_variant(cp1,intersection_1[0]));
+              assert(assign_variant(cp2,intersection_1[1]));
               assert(theEqual_3(cp1.first, cp[i]) ||
                      theEqual_3(cp1.first, cp[j]));
               assert(theEqual_3(cp2.first, cp[i]) ||
@@ -1874,13 +1899,13 @@ void _test_intersection_construct(SK sk) {
             } else if(simulate_has_on(j,i,t1)) {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cp1,intersection_1[0]));
+              assert(assign_variant(cp1,intersection_1[0]));
               assert(theEqual_3(cp1.first, cp[i]));
             } else {
               assert(intersection_1.size() == 2);
               assert(theDo_intersect_3(ca, cb));
-              if(assign(cp1,intersection_1[0]) && assign(cres,intersection_1[1]));
-              else if(assign(cres,intersection_1[0]) && assign(cp1,intersection_1[1]));
+              if(assign_variant(cp1,intersection_1[0]) && assign_variant(cres,intersection_1[1]));
+              else if(assign_variant(cres,intersection_1[0]) && assign_variant(cp1,intersection_1[1]));
               else assert(false);
               Circular_arc_3 conf = theConstruct_circular_arc_3(cc,cp[t1],cp[j]);
               assert(theEqual_3(conf, cres));
@@ -1890,19 +1915,19 @@ void _test_intersection_construct(SK sk) {
             if(simulate_has_on(t1,j,t2)) {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(cb, cres));
             } else if(simulate_has_on(t2,j,i)) {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               Circular_arc_3 conf = theConstruct_circular_arc_3(cc,cp[t1],cp[j]);
               assert(theEqual_3(cres, conf));
             } else {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 2);
-              assert(assign(cres,intersection_1[0]));
-              assert(assign(cres2,intersection_1[1]));
+              assert(assign_variant(cres,intersection_1[0]));
+              assert(assign_variant(cres2,intersection_1[1]));
               Circular_arc_3 conf1 = theConstruct_circular_arc_3(cc,cp[t1],cp[j]);
               Circular_arc_3 conf2 = theConstruct_circular_arc_3(cc,cp[i],cp[t2]);
               assert((theEqual_3(cres, conf1) && theEqual_3(cres2, conf2)) ||
@@ -1912,20 +1937,20 @@ void _test_intersection_construct(SK sk) {
             if(simulate_has_on(i,t2,t1)) {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(cb, cres));
             } else if(simulate_has_on(j,i,t1)) {
                     assert(theDo_intersect_3(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               Circular_arc_3 conf = theConstruct_circular_arc_3(cc,cp[i],cp[t2]);
               assert(theEqual_3(cres, conf));
             } else {
               // This case should never happen, because it already happen before
               assert(intersection_1.size() == 2);
               assert(theDo_intersect_3(ca, cb));
-              assert(assign(cres,intersection_1[0]));
-              assert(assign(cres2,intersection_1[1]));
+              assert(assign_variant(cres,intersection_1[0]));
+              assert(assign_variant(cres2,intersection_1[1]));
               Circular_arc_3 conf1 = theConstruct_circular_arc_3(cc,cp[t1],cp[j]);
               Circular_arc_3 conf2 = theConstruct_circular_arc_3(cc,cp[i],cp[t2]);
               assert((theEqual_3(cres, conf1) && theEqual_3(cres2, conf2)) ||
@@ -1935,7 +1960,7 @@ void _test_intersection_construct(SK sk) {
             // the case whether (i,j) contains (t1,t2) is handled before
             assert(intersection_1.size() == 1);
             assert(theDo_intersect_3(ca, cb));
-            assert(assign(cres,intersection_1[0]));
+            assert(assign_variant(cres,intersection_1[0]));
             assert(theEqual_3(ca, cres));
           } else {
             assert(intersection_1.size() == 0);
@@ -1956,7 +1981,7 @@ void _test_intersection_construct(SK sk) {
         for(int t2=0;t2<8;t2++) {
           if(t1 == t2) continue;
           Circular_arc_3 cb = theConstruct_circular_arc_3(cc,cp[t1],cp[t2]);
-          std::vector< CGAL::Object > intersection_1;
+          std::vector< std::variant<Circular_arc_3, std::pair<Circular_arc_point_3, unsigned> > > intersection_1;
           intersection(ca, cb, std::back_inserter(intersection_1));
           Circular_arc_3 cres, cres2;
           std::pair< Circular_arc_point_3, unsigned > cp1, cp2;
@@ -1964,37 +1989,37 @@ void _test_intersection_construct(SK sk) {
             if(t2 == j) {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(ca,cres));
             } else if(simulate_has_on(i,j,t2)) {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(cb, cres));
             } else {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(ca, cres));
             }
           } else if(t2 == j) {
             if(simulate_has_on(i,j,t1)) {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(cb, cres));
             } else {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(ca, cres));
             }
           } else if(t1 == j) {
             if(t2 == i) {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 2);
-              assert(assign(cp1,intersection_1[0]));
-              assert(assign(cp2,intersection_1[1]));
+              assert(assign_variant(cp1,intersection_1[0]));
+              assert(assign_variant(cp2,intersection_1[1]));
               assert(theEqual_3(cp1.first, cp[i]) ||
                      theEqual_3(cp1.first, cp[j]));
               assert(theEqual_3(cp2.first, cp[i]) ||
@@ -2003,13 +2028,13 @@ void _test_intersection_construct(SK sk) {
             } else if(simulate_has_on(t1,i,t2)) {
               assert(intersection_1.size() == 1);
               assert(CGAL::do_intersect(ca, cb));
-              assert(assign(cp1,intersection_1[0]));
+              assert(assign_variant(cp1,intersection_1[0]));
               assert(theEqual_3(cp1.first, cp[t1]));
             } else {
               assert(intersection_1.size() == 2);
               assert(CGAL::do_intersect(ca, cb));
-              if(assign(cp1,intersection_1[0]) && assign(cres,intersection_1[1]));
-              else if(assign(cres,intersection_1[0]) && assign(cp1,intersection_1[1]));
+              if(assign_variant(cp1,intersection_1[0]) && assign_variant(cres,intersection_1[1]));
+              else if(assign_variant(cres,intersection_1[0]) && assign_variant(cp1,intersection_1[1]));
               else assert(false);
               Circular_arc_3 conf = theConstruct_circular_arc_3(cc,cp[i],cp[t2]);
               assert(theEqual_3(conf, cres));
@@ -2019,8 +2044,8 @@ void _test_intersection_construct(SK sk) {
             if(t1 == j) {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 2);
-              assert(assign(cp1,intersection_1[0]));
-              assert(assign(cp2,intersection_1[1]));
+              assert(assign_variant(cp1,intersection_1[0]));
+              assert(assign_variant(cp2,intersection_1[1]));
               assert(theEqual_3(cp1.first, cp[i]) ||
                      theEqual_3(cp1.first, cp[j]));
               assert(theEqual_3(cp2.first, cp[i]) ||
@@ -2029,13 +2054,13 @@ void _test_intersection_construct(SK sk) {
             } else if(simulate_has_on(j,i,t1)) {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cp1,intersection_1[0]));
+              assert(assign_variant(cp1,intersection_1[0]));
               assert(theEqual_3(cp1.first, cp[i]));
             } else {
               assert(intersection_1.size() == 2);
               assert(CGAL::do_intersect(ca, cb));
-              if(assign(cp1,intersection_1[0]) && assign(cres,intersection_1[1]));
-              else if(assign(cres,intersection_1[0]) && assign(cp1,intersection_1[1]));
+              if(assign_variant(cp1,intersection_1[0]) && assign_variant(cres,intersection_1[1]));
+              else if(assign_variant(cres,intersection_1[0]) && assign_variant(cp1,intersection_1[1]));
               else assert(false);
               Circular_arc_3 conf = theConstruct_circular_arc_3(cc,cp[t1],cp[j]);
               assert(theEqual_3(conf, cres));
@@ -2045,19 +2070,19 @@ void _test_intersection_construct(SK sk) {
             if(simulate_has_on(t1,j,t2)) {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(cb, cres));
             } else if(simulate_has_on(t2,j,i)) {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               Circular_arc_3 conf = theConstruct_circular_arc_3(cc,cp[t1],cp[j]);
               assert(theEqual_3(cres, conf));
             } else {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 2);
-              assert(assign(cres,intersection_1[0]));
-              assert(assign(cres2,intersection_1[1]));
+              assert(assign_variant(cres,intersection_1[0]));
+              assert(assign_variant(cres2,intersection_1[1]));
               Circular_arc_3 conf1 = theConstruct_circular_arc_3(cc,cp[t1],cp[j]);
               Circular_arc_3 conf2 = theConstruct_circular_arc_3(cc,cp[i],cp[t2]);
               assert((theEqual_3(cres, conf1) && theEqual_3(cres2, conf2)) ||
@@ -2067,20 +2092,20 @@ void _test_intersection_construct(SK sk) {
             if(simulate_has_on(i,t2,t1)) {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               assert(theEqual_3(cb, cres));
             } else if(simulate_has_on(j,i,t1)) {
                     assert(CGAL::do_intersect(ca, cb));
               assert(intersection_1.size() == 1);
-              assert(assign(cres,intersection_1[0]));
+              assert(assign_variant(cres,intersection_1[0]));
               Circular_arc_3 conf = theConstruct_circular_arc_3(cc,cp[i],cp[t2]);
               assert(theEqual_3(cres, conf));
             } else {
               // This case should never happen, because it already happen before
               assert(intersection_1.size() == 2);
               assert(CGAL::do_intersect(ca, cb));
-              assert(assign(cres,intersection_1[0]));
-              assert(assign(cres2,intersection_1[1]));
+              assert(assign_variant(cres,intersection_1[0]));
+              assert(assign_variant(cres2,intersection_1[1]));
               Circular_arc_3 conf1 = theConstruct_circular_arc_3(cc,cp[t1],cp[j]);
               Circular_arc_3 conf2 = theConstruct_circular_arc_3(cc,cp[i],cp[t2]);
               assert((theEqual_3(cres, conf1) && theEqual_3(cres2, conf2)) ||
@@ -2090,7 +2115,7 @@ void _test_intersection_construct(SK sk) {
             // the case whether (i,j) contains (t1,t2) is handled before
             assert(intersection_1.size() == 1);
             assert(CGAL::do_intersect(ca, cb));
-            assert(assign(cres,intersection_1[0]));
+            assert(assign_variant(cres,intersection_1[0]));
             assert(theEqual_3(ca, cres));
           } else {
             assert(intersection_1.size() == 0);
@@ -2280,11 +2305,11 @@ void _test_bounding_box_construct(SK sk)
     Circle_3 c1 = theConstruct_circle_3(std::make_pair(es1, pol));
     Circle_3 c2 = theConstruct_circle_3(std::make_pair(es2, pol));
 
-    std::vector< CGAL::Object > intersection_2;
+    std::vector< std::variant<Circle_3, std::pair<Circular_arc_point_3, unsigned> > > intersection_2;
     theIntersect_3(c1, c2, std::back_inserter(intersection_2));
     std::pair<Circular_arc_point_3, unsigned> cap1, cap2;
-    assign(cap1,intersection_2[0]);
-    assign(cap2,intersection_2[1]);
+    assign_variant(cap1,intersection_2[0]);
+    assign_variant(cap2,intersection_2[1]);
     _test_bbox<SK>(cap1.first);
     _test_bbox<SK>(cap2.first);
 
@@ -2295,10 +2320,10 @@ void _test_bounding_box_construct(SK sk)
       const FT dl = 0;
       Polynomial_1_3 pol2 = Polynomial_1_3(al,bl,cl,dl);
       Circle_3 c4 = theConstruct_circle_3(std::make_pair(es1, pol2));
-      std::vector< CGAL::Object > intersection_4;
+      std::vector< std::variant<Circle_3, std::pair<Circular_arc_point_3, unsigned> > > intersection_4;
       theIntersect_3(c1, c4, std::back_inserter(intersection_4));
-      assign(cap1,intersection_4[0]);
-      assign(cap2,intersection_4[1]);
+      assign_variant(cap1,intersection_4[0]);
+      assign_variant(cap2,intersection_4[1]);
       _test_bbox<SK>(cap1.first);
       _test_bbox<SK>(cap2.first);
     }
@@ -2309,10 +2334,10 @@ void _test_bounding_box_construct(SK sk)
     const FT d_c = -FT(va) / FT(10);
     Polynomial_1_3 pol2 = Polynomial_1_3(a_c,b_c,c_c,d_c);
     Circle_3 c5 = theConstruct_circle_3(std::make_pair(es2, pol2));
-    std::vector< CGAL::Object > intersection_5;
+    std::vector< std::variant<Circle_3, std::pair<Circular_arc_point_3, unsigned> > > intersection_5;
     theIntersect_3(c1, c5, std::back_inserter(intersection_5));
-    assign(cap1,intersection_5[0]);
-    assign(cap2,intersection_5[1]);
+    assign_variant(cap1,intersection_5[0]);
+    assign_variant(cap2,intersection_5[1]);
     _test_bbox<SK>(cap1.first);
     _test_bbox<SK>(cap2.first);
   }
@@ -2334,15 +2359,15 @@ void _test_bounding_box_construct(SK sk)
           Sphere_3 sl_2 = theConstruct_sphere_3(
             Polynomial_for_spheres_2_3(x+10,y+10,z+10,r*r));
           int d2 = (vx*vx + vy*vy + vz*vz);
-          CGAL::Object intersection_1 = theIntersect_3(s, sl_1);
-          CGAL::Object intersection_2 = theIntersect_3(s_t10, sl_2);
+          std::optional<std::variant<Point_3, Circle_3, Sphere_3 >> intersection_1 = theIntersect_3(s, sl_1);
+          std::optional<std::variant<Point_3, Circle_3, Sphere_3 >> intersection_2 = theIntersect_3(s_t10, sl_2);
           // No intersection
           if((d2 > (r+1)*(r+1)) || (d2 < (r-1)*(r-1))) continue;
           if(x == 0 && y == 0 && z == 0) continue;
           if((d2 == (r+1)*(r+1)) || (d2 == (r-1)*(r-1))) continue;
           Circle_3 circle1, circle2;
-          assign(circle1, intersection_1);
-          assign(circle2, intersection_2);
+          assign_variant(circle1, intersection_1);
+          assign_variant(circle2, intersection_2);
           _test_bbox<SK>(circle1);
           _test_bbox<SK>(circle2);
         }

From 41e8a11e6531d61b7509606befb88940e57a5dbf Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 15:15:34 +0100
Subject: [PATCH 0438/1398] Fix warnings in Arrangement_on_surface

---
 .../examples/Arrangement_on_surface_2/draw_arr.cpp       | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
index ea99cca39a85..b62ba6aadc17 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
@@ -22,8 +22,8 @@ std::tuple<float, float, float>
 hsv_to_rgb(float hue, float sat, float value) {
   float red, green, blue;
   float fc = value * sat; // Chroma
-  float hue_prime = fmod(hue / 60.0, 6);
-  float fx = fc * (1.0 - fabs(fmod(hue_prime, 2) - 1.0));
+  float hue_prime = fmod(hue / 60.0f, 6);
+  float fx = fc * (1.0f - fabs(fmod(hue_prime, 2) - 1.0));
   float fm = value - fc;
 
   if(0 <= hue_prime && hue_prime < 1) {
@@ -98,12 +98,13 @@ int main() {
 
   std::size_t id(0);
   CGAL::draw(arr, [&] (Arrangement_2::Face_const_handle) -> CGAL::IO::Color {
-                    float h = 360.0 * id++ / arr.number_of_faces();
+                    float h = 360.0f * id++ / arr.number_of_faces();
                     float s = 0.5;
                     float v = 0.5;
                     float r, g, b;
+                    typedef unsigned char uchar;
                     std::tie(r, g, b) = hsv_to_rgb(h, s, v);
-                    return CGAL::IO::Color(r, g, b);
+                    return CGAL::IO::Color(uchar(r*255), uchar(g*255), uchar(b*255));
                   }, "hsv colors", true);
 
   return EXIT_SUCCESS;

From 00b540d79185574d66216408c2990daec6b7fd93 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 29 Jun 2023 15:34:03 +0100
Subject: [PATCH 0439/1398] Fix precomputed data

---
 .../test_dt_deterministic_3.cpp               |     6 +-
 .../test_dt_deterministic_3.in                | 21152 ++++++++--------
 2 files changed, 10579 insertions(+), 10579 deletions(-)

diff --git a/Triangulation_3/test/Triangulation_3/test_dt_deterministic_3.cpp b/Triangulation_3/test/Triangulation_3/test_dt_deterministic_3.cpp
index 35d2acc07c92..e1532362bb7d 100644
--- a/Triangulation_3/test/Triangulation_3/test_dt_deterministic_3.cpp
+++ b/Triangulation_3/test/Triangulation_3/test_dt_deterministic_3.cpp
@@ -27,9 +27,9 @@ int main()
 
   std::stringstream buffer;
   buffer << dt3;
-  //~ std::ofstream out ("test_dt_deterministic_3.in");
-  //~ out << dt3;
-
+  //std::ofstream out ("test_dt_deterministic_3.in");
+  //out << dt3;
+  //out.close();
 
   //reading the result from a file
   std::ifstream file ("test_dt_deterministic_3.in");
diff --git a/Triangulation_3/test/Triangulation_3/test_dt_deterministic_3.in b/Triangulation_3/test/Triangulation_3/test_dt_deterministic_3.in
index ec9008c87fe3..c04c6f739de2 100644
--- a/Triangulation_3/test/Triangulation_3/test_dt_deterministic_3.in
+++ b/Triangulation_3/test/Triangulation_3/test_dt_deterministic_3.in
@@ -1001,10698 +1001,10698 @@
 8 1 0
 9 0 0
 5346
-509 200 354 331
-66 533 547 545
-201 206 27 203
-911 613 923 919
-283 259 282 263
-352 43 445 350
-645 8 648 649
-978 967 968 600
-203 27 193 206
-520 506 522 25
-230 229 224 130
-554 461 459 552
-191 205 190 181
-765 116 12 75
-762 604 12 765
-71 667 73 690
-669 625 14 624
-725 724 723 728
-374 366 373 372
-507 356 505 20
-301 0 289 36
-582 580 0 581
-694 756 695 704
-71 688 686 690
-26 143 0 216
-961 945 929 203
-748 46 757 4
-95 764 705 680
-141 133 147 149
-714 732 721 675
-198 518 40 362
-351 359 368 370
-703 749 702 93
-191 22 205 181
-763 758 429 366
-442 444 57 350
-225 16 0 140
-95 703 702 92
-94 102 99 93
-76 75 12 72
-249 241 335 28
-428 435 360 367
-328 317 329 40
-216 209 210 142
-566 71 686 690
-375 367 365 361
-733 751 93 744
-759 366 364 747
-615 77 74 612
-90 674 722 721
-99 94 93 92
-44 6 360 367
-224 222 226 229
-321 302 312 304
-321 303 39 314
-563 568 0 564
-70 435 559 433
-757 420 366 4
-0 725 723 728
-902 915 984 897
-147 145 0 151
-292 293 282 259
-804 803 812 805
-541 543 540 536
-219 220 223 336
-612 74 610 646
-751 97 734 770
-129 130 131 0
-765 766 767 758
-841 110 843 837
-193 195 181 22
-460 457 454 455
-5 54 421 374
-0 672 674 84
-546 468 0 58
-93 94 102 748
-362 517 510 44
-554 546 465 556
-0 819 821 101
-885 886 840 839
-204 162 195 22
-415 706 417 45
-67 58 546 555
-158 146 153 154
-241 336 335 28
-709 700 88 711
-728 723 0 724
-617 909 619 910
-687 775 764 774
-68 575 577 576
-0 305 852 270
-0 254 248 253
-0 836 846 111
-615 606 607 609
-107 106 851 850
-173 170 134 152
-476 481 479 475
-486 494 0 493
-948 180 177 182
-442 350 435 44
-413 421 373 372
-736 91 735 727
-639 79 80 78
-174 1 171 179
-163 164 174 153
-196 200 203 199
-990 999 987 1000
-812 39 306 814
-176 178 168 0
-798 803 805 795
-491 500 523 156
-307 308 37 383
-492 490 493 148
-737 735 731 727
-290 295 297 390
-0 735 823 736
-192 205 193 190
-262 283 264 263
-284 338 243 337
-388 49 389 48
-0 641 637 643
-278 288 281 280
-303 302 321 304
-306 310 36 37
-170 152 0 135
-135 151 132 133
-755 756 96 773
-485 475 0 473
-178 129 169 0
-156 211 155 202
-410 0 412 409
-544 540 543 537
-520 519 527 602
-600 633 594 9
-957 958 0 164
-673 683 682 672
-160 153 165 163
-231 235 239 221
-204 166 195 162
-160 529 524 523
-195 162 180 22
-21 178 176 0
-132 137 140 151
-899 901 915 938
-183 188 187 28
-178 169 168 0
-213 331 206 200
-368 442 367 44
-465 556 0 458
-184 232 231 0
-295 333 318 282
-686 687 96 566
-318 324 331 329
-218 220 26 0
-694 686 695 756
-795 798 938 797
-304 271 3 269
-675 730 722 714
-302 289 3 304
-613 761 604 605
-287 237 245 34
-196 198 200 199
-0 253 248 256
-255 31 257 263
-187 22 208 191
-155 202 209 186
-202 212 22 27
-732 731 91 727
-733 99 820 102
-338 284 339 0
-364 376 308 747
-134 178 175 230
-121 974 970 960
-187 191 208 28
-406 449 0 405
-242 246 237 238
-0 816 817 38
-216 26 210 209
-27 195 194 193
-538 544 0 475
-205 326 192 206
-353 504 509 356
-881 796 797 805
-379 745 749 708
-805 812 866 814
-0 894 895 898
-361 375 309 364
-206 205 193 192
-201 200 206 203
-83 677 673 679
-751 750 743 741
-692 685 698 696
-329 328 370 313
-301 0 385 289
-322 314 30 39
-274 281 283 262
-36 0 305 38
-37 0 36 38
-264 266 269 273
-501 499 462 61
-294 312 263 282
-206 324 192 199
-34 287 277 278
-318 317 319 324
-944 932 118 943
-324 323 325 199
-346 393 348 0
-209 215 219 336
-302 303 289 304
-791 784 826 831
-365 5 421 374
-671 683 0 665
-68 561 550 549
-558 557 57 70
-185 187 28 183
-0 933 189 253
-251 205 190 191
-20 212 202 27
-263 267 259 260
-211 507 505 20
-346 297 387 0
-302 316 290 41
-0 79 643 8
-435 44 511 516
-387 388 394 386
-326 324 192 206
-33 285 288 286
-283 267 259 263
-360 6 605 761
-328 30 323 363
-287 33 284 0
-301 384 37 310
-517 24 515 516
-45 709 707 703
-210 209 219 17
-185 219 17 175
-353 356 344 349
-56 447 402 0
+469 466 0 471
+316 313 302 321
+229 222 221 231
+251 189 190 253
+129 128 0 131
+0 262 255 267
+175 17 150 219
+136 0 126 138
+310 39 303 314
+629 623 14 641
+831 0 832 833
+63 43 358 359
+316 290 41 390
+467 459 468 546
+897 899 902 915
+176 168 0 178
+191 22 187 208
+648 0 585 653
+826 734 770 827
+116 12 77 618
+233 226 229 234
+512 506 461 520
+79 8 0 80
+522 161 526 527
+23 196 519 927
+762 434 360 763
+168 169 0 178
+244 284 33 293
+361 322 6 801
+628 617 619 629
+806 790 769 829
+26 209 210 216
+171 17 173 175
+301 37 36 310
+85 676 675 777
+792 790 769 794
+0 277 34 287
+218 150 26 219
+83 668 666 670
+4 366 372 373
+202 186 207 209
+621 566 96 687
+698 681 0 699
+304 303 265 311
+458 556 557 558
+526 159 529 596
+19 591 600 601
+322 6 357 361
+199 323 324 325
+28 191 208 249
+924 918 799 931
+95 86 85 97
 50 373 46 380
-758 76 429 694
-143 210 217 149
-0 245 34 278
-405 409 0 408
-355 504 358 509
-565 689 688 432
-569 82 662 571
-316 290 294 302
-815 810 807 100
-545 66 541 543
-7 543 0 66
-774 780 625 10
-755 781 792 794
-783 627 787 794
-416 417 706 52
-233 235 221 0
-803 322 39 309
-645 654 650 649
-160 158 153 525
-290 298 300 299
-385 0 300 289
-0 650 649 637
-404 418 0 424
+198 40 323 363
+306 36 37 310
+292 259 288 293
+154 149 146 173
+163 162 155 174
+21 176 0 178
+480 61 62 500
+456 0 462 497
+240 223 220 336
+645 8 638 648
+601 527 519 602
+398 396 47 399
+303 39 311 321
+175 171 21 178
+16 132 137 140
+192 193 205 206
+324 192 199 325
+677 10 0 776
+639 0 81 647
+17 171 173 174
+153 0 146 158
+131 132 16 225
+167 171 176 179
+249 243 242 258
+596 527 161 965
+218 217 150 227
+0 489 158 524
+387 386 41 388
+794 793 773 910
+603 24 19 616
+0 400 401 407
+774 771 96 781
+66 7 0 543
+640 622 629 644
+511 63 350 558
+149 133 150 217
+287 244 33 288
+615 604 614 618
+974 120 952 997
+27 22 202 204
+757 754 752 759
+490 147 149 492
+80 79 78 639
+211 142 209 216
+139 16 137 140
+770 97 734 778
+131 130 129 132
+144 141 0 145
+0 177 948 950
+263 262 264 283
+771 92 768 772
+897 0 898 988
+489 0 484 524
+644 622 623 662
+136 128 0 137
+933 870 0 935
+417 52 416 424
+211 209 214 216
+126 0 127 138
+503 460 461 513
+97 770 772 779
+0 218 220 221
+477 469 467 537
+206 199 200 324
+332 345 2 353
+252 319 325 326
+202 22 162 204
+48 391 392 403
+283 282 259 292
+724 722 0 730
+169 129 0 178
+0 147 146 490
+397 47 382 421
+626 621 14 628
+22 180 181 187
+96 755 756 773
+145 140 139 151
+937 117 873 943
+223 222 184 231
+368 369 357 391
+0 34 237 287
+51 417 52 697
+294 3 264 304
+8 80 638 648
+968 927 967 969
+139 137 0 151
+314 30 39 321
+0 21 178 230
+245 34 278 287
+490 149 148 492
+198 362 363 517
+376 382 372 397
+312 257 263 319
+514 511 515 516
+136 131 128 137
+595 541 528 602
+180 22 181 195
+200 25 196 201
+178 129 0 230
+703 95 705 709
+154 148 142 525
+36 271 289 303
+426 433 428 443
+432 430 431 437
+363 322 30 799
+888 0 877 890
+245 244 237 287
+37 0 36 38
+257 255 31 263
+866 807 811 881
+461 498 503 506
+340 296 332 345
+259 244 258 280
+313 41 302 315
+324 323 317 325
+186 202 207 208
+222 175 184 230
+13 809 810 819
+813 807 818 866
+309 364 308 760
+869 868 109 871
+757 694 756 758
+215 214 209 216
+0 128 135 137
+373 4 46 380
+0 826 831 832
+0 33 285 287
+187 22 186 208
+373 50 46 420
+392 388 48 394
+255 262 263 267
+83 670 673 677
+193 181 22 195
+0 386 387 394
+436 0 69 557
+286 0 275 291
+807 100 806 808
+20 27 202 204
+185 28 186 336
+2 329 354 370
+34 277 278 287
+36 289 301 303
+0 548 549 555
+282 294 312 316
+302 312 316 321
+760 807 100 815
+162 22 180 195
+671 665 670 683
+526 522 527 532
+0 414 416 706
+47 396 395 400
+294 290 291 300
+520 532 536 602
+239 231 223 247
+237 34 245 287
+200 199 40 324
+267 263 259 283
+302 294 290 316
+392 401 403 448
+264 294 304 312
+40 362 198 518
+180 162 1 187
+262 0 255 266
+143 149 210 217
+552 64 67 554
+27 20 202 212
+22 162 180 187
+795 798 799 924
+39 265 303 311
+245 278 244 287
+445 56 439 452
+367 361 365 375
+397 396 47 421
+748 46 379 749
+277 0 285 287
+316 282 318 319
+54 405 422 423
+700 87 699 709
+665 83 666 670
+32 305 265 858
+467 0 465 546
+693 690 692 696
+699 87 53 705
+0 291 298 300
+511 514 70 559
+346 345 0 348
+351 43 347 352
+534 512 64 552
+310 301 37 384
+397 382 372 421
+376 371 310 384
+917 789 114 919
+350 57 435 511
+932 873 190 933
+52 50 414 424
+864 863 867 869
+785 784 782 792
+73 71 564 568
+269 0 272 273
+103 0 101 104
+0 379 380 414
+186 28 187 208
+386 299 0 387
+5 54 428 443
+607 609 612 615
+645 649 652 654
+301 36 303 310
+209 26 210 219
+426 54 374 427
+362 40 198 363
+486 0 488 493
+323 317 40 324
+983 908 912 985
+318 332 295 390
+377 747 752 815
+388 369 42 392
+322 314 309 375
+638 571 644 645
+286 35 0 298
+0 35 33 339
+278 0 245 280
+30 314 39 322
+319 312 257 320
+275 0 272 291
+348 2 345 353
+56 0 439 452
+537 59 468 543
+149 148 143 210
+68 577 588 610
+167 164 0 172
+75 116 12 620
+856 108 109 867
+367 5 428 442
+515 512 64 534
+800 613 604 911
+607 606 559 609
+660 665 666 670
+43 63 358 498
+241 238 242 337
+631 630 0 643
+445 57 350 558
+360 44 367 435
+251 252 190 326
+552 533 534 602
+393 0 387 394
+573 68 550 575
+41 300 302 385
+51 53 0 417
+791 784 785 792
+46 378 379 380
+243 284 293 339
+516 435 360 559
+212 20 202 505
+401 0 402 448
+213 201 20 508
+395 371 48 397
+43 350 352 359
+96 619 620 621
+451 447 445 452
+447 445 43 451
+348 347 351 355
+331 330 332 353
+515 510 23 517
+446 43 355 498
+335 241 240 336
+0 436 438 440
+372 382 381 413
+0 385 386 389
+560 561 573 609
+2 331 332 353
+315 302 289 385
+826 825 827 832
+732 731 742 750
+400 399 396 407
+342 0 344 496
+694 695 704 756
+579 571 574 586
+679 719 720 721
+407 402 55 441
+573 565 560 607
+163 155 154 174
+573 563 570 588
+623 642 82 661
+468 59 7 543
+543 537 536 545
+99 92 93 733
+527 520 519 602
+519 23 19 534
+154 146 148 158
+158 153 0 160
+217 149 141 492
+69 551 549 561
+67 545 58 547
+615 614 115 618
+438 433 425 440
+471 464 0 479
+679 86 85 720
+43 63 350 359
+351 347 393 448
+149 141 133 217
+547 67 535 551
+175 222 224 230
+241 335 240 337
+524 523 18 525
+160 523 524 525
+515 511 510 516
+478 60 0 479
+17 154 155 174
+523 482 491 526
+176 1 177 179
+445 43 352 447
+69 551 553 555
+367 360 428 763
+372 4 373 381
+364 361 365 763
+46 50 52 419
+504 503 498 506
+25 512 23 519
+577 576 578 581
+756 755 754 767
+913 908 912 923
+458 0 439 557
+115 614 611 616
+547 65 542 548
+0 574 575 578
+744 743 741 751
+640 630 631 643
+16 131 136 137
+724 718 714 725
+153 163 164 165
+870 0 253 933
+217 0 143 492
+150 17 210 219
+540 538 539 544
+157 161 159 526
+560 70 436 561
+439 445 452 458
+455 451 446 498
+488 487 489 493
+19 23 515 534
+543 66 7 545
+58 0 7 468
+153 146 154 158
+344 342 496 505
+463 455 456 503
+483 61 500 523
+132 131 16 137
+469 468 467 537
+560 436 438 562
+438 425 0 440
+355 348 347 446
+477 463 464 501
+47 410 413 421
+618 74 77 632
+53 45 417 697
+467 468 0 546
+403 391 368 442
+468 58 0 546
+195 22 27 204
+702 695 696 764
 0 625 10 668
-34 287 237 0
-41 315 302 313
-365 428 374 763
-412 0 414 411
-939 914 990 970
-93 708 749 745
-606 604 12 762
-703 751 743 744
-292 286 298 35
-391 5 397 365
-346 387 393 0
-278 276 277 0
-269 266 268 273
-390 2 42 329
-0 273 269 268
-223 241 240 239
-527 965 596 597
-81 599 634 592
-711 750 726 742
-357 314 375 369
-53 699 0 87
-718 724 716 713
-924 918 931 920
-247 236 239 235
-521 201 508 20
-543 7 59 468
-64 534 515 512
-756 94 695 704
-324 40 329 317
-892 878 901 900
-199 945 930 937
-459 554 465 460
-464 466 463 477
-537 543 59 468
-114 911 793 910
-540 541 0 543
-447 43 445 352
-419 424 50 52
-522 161 527 197
-351 355 359 354
-160 524 158 525
-307 0 38 816
-440 436 0 438
-399 406 408 398
-451 454 0 452
-198 362 40 363
-412 409 404 422
-493 486 494 18
-508 509 25 506
-309 310 308 376
-348 349 345 0
+23 24 19 515
+595 533 541 602
+309 364 375 376
+515 23 24 517
+668 10 677 775
+379 706 708 749
+566 621 669 687
+315 41 302 385
+816 106 0 817
+92 93 94 99
+767 756 755 773
+607 565 560 689
+71 565 72 688
+524 18 158 525
+545 459 67 546
+53 51 0 692
+547 535 533 590
+366 364 763 766
+739 734 738 827
+790 785 783 792
+629 628 617 630
+338 340 341 342
+260 256 257 263
+581 576 0 582
+24 608 614 616
+94 704 748 749
+672 673 674 682
+908 122 124 982
+548 551 547 589
+711 726 742 750
+59 0 7 543
+677 676 673 679
+759 100 752 815
+688 686 690 693
+51 419 418 431
+737 0 727 741
+628 621 14 629
+75 72 12 76
+375 364 365 376
+299 0 300 385
+796 802 803 814
+511 64 514 515
+422 50 373 427
+14 623 624 642
+952 951 119 953
+581 578 585 653
+893 935 117 943
+12 116 604 618
+169 134 129 178
+78 631 632 635
+23 519 19 927
+228 0 130 234
+455 454 451 457
+0 786 884 885
+559 434 360 606
+434 429 428 763
+630 628 617 909
+613 605 604 614
+0 66 541 583
+0 630 907 909
+962 120 946 972
+135 129 128 169
+549 551 548 589
+294 264 263 312
+73 662 663 667
+0 634 636 639
+418 50 404 427
+0 540 541 543
+93 92 94 702
+242 245 246 261
+122 0 907 985
+729 728 0 730
+837 835 13 841
+707 88 0 711
+701 90 714 721
+0 624 625 668
+756 754 94 757
+755 99 768 771
+99 93 94 102
+76 429 430 689
+724 723 725 728
+658 665 670 671
+755 94 99 771
+780 768 774 781
+282 290 294 316
+661 82 662 663
+549 0 550 575
+374 426 427 429
+374 373 366 420
+0 779 780 784
+417 45 52 697
+427 420 374 429
+368 44 350 442
+427 423 418 437
+584 587 592 610
+53 87 0 417
+51 0 418 424
+822 791 827 831
+404 405 0 423
+47 0 399 400
+767 75 756 773
+673 83 677 679
+673 671 670 683
+621 623 14 629
+687 667 566 690
+674 673 0 676
+777 731 97 778
+719 679 682 721
+776 97 772 779
+676 675 674 721
+722 717 718 724
+603 9 572 611
+84 0 717 722
+434 433 426 689
+676 86 85 679
+772 771 764 774
+688 76 686 694
+45 415 417 706
+738 103 0 739
+742 726 732 750
+709 703 95 750
+710 701 712 714
+762 761 604 765
+669 666 667 678
+11 728 729 730
+727 91 11 729
+615 12 604 618
+508 25 506 509
+790 786 830 839
+0 981 989 993
+193 27 194 195
+141 145 147 151
+705 696 680 764
+747 366 4 759
+341 207 342 505
+265 304 311 853
+638 586 571 645
+326 324 206 327
+698 696 680 705
+44 357 367 368
+92 768 99 771
+754 752 748 757
+730 675 91 732
+645 637 649 650
+706 379 52 749
+52 45 706 749
+718 714 722 724
+708 706 45 749
+674 0 84 722
+654 651 0 656
+667 71 566 690
+46 704 748 757
+323 799 872 931
+606 559 434 607
+321 314 30 328
+257 256 255 263
+7 66 0 542
+369 328 313 370
+747 364 366 759
+840 839 13 841
+177 176 179 950
+828 753 100 829
+245 237 242 246
+704 52 46 749
+129 132 134 135
+832 827 822 834
+83 678 666 775
+909 787 627 910
+80 586 638 648
+75 686 694 756
+704 694 756 757
+815 377 307 821
+50 46 52 414
+379 745 748 749
+162 163 155 204
+201 27 203 206
 42 392 393 394
-345 344 340 0
-511 558 57 70
-395 397 371 48
-358 498 43 63
-2 348 353 345
-212 205 22 27
-543 541 0 66
-64 63 512 510
-440 70 433 57
-345 330 353 332
-63 350 445 43
-411 0 414 416
-487 144 0 490
-559 511 514 516
-684 685 567 678
-404 423 0 418
-673 83 679 683
-551 572 589 68
-573 560 607 565
-955 957 950 947
-224 230 130 129
-235 247 236 0
-0 91 735 736
-514 609 559 608
-160 153 0 165
-557 70 436 440
-550 563 0 562
-750 731 742 741
-462 478 0 464
-510 517 23 515
-548 542 582 65
-704 419 693 694
-490 146 0 158
-131 130 228 0
-539 540 531 538
-757 366 759 4
-498 457 451 43
-425 440 0 438
-461 460 554 459
+0 377 746 821
+11 725 728 730
+725 724 728 730
+11 714 725 730
+748 745 93 749
+740 93 102 745
+725 0 11 728
+708 703 743 744
+723 0 725 728
+102 99 93 733
+0 107 849 855
+714 724 725 730
+24 603 608 616
+791 733 99 820
+834 832 824 838
+594 0 81 633
+241 29 28 249
+238 241 242 246
+508 201 25 509
+728 724 0 730
+72 75 12 620
+850 107 857 861
+62 462 0 497
+91 727 731 735
+819 0 101 821
+291 286 0 298
+99 755 768 792
+251 191 189 254
+3 0 269 271
+817 816 106 818
+879 876 874 936
+241 29 242 246
+110 105 836 846
+852 0 270 854
+34 237 245 279
+0 268 269 270
+311 39 265 812
+176 21 171 178
+106 810 816 819
+838 833 0 846
+856 864 867 869
+196 199 200 203
+796 806 807 881
+667 623 661 669
+116 12 604 765
+909 627 619 910
+844 843 841 845
+770 768 92 772
+195 27 194 204
+760 747 308 815
+822 809 830 837
+835 13 809 837
+881 806 811 886
+835 104 105 837
+722 675 0 730
+724 714 722 730
+805 804 798 864
+106 13 819 835
+716 715 713 723
+833 110 105 837
+105 110 836 837
+811 839 840 886
+818 13 106 850
+836 0 111 846
+187 182 181 191
+165 163 164 166
+799 363 322 801
+764 772 774 775
+181 189 182 934
+615 74 77 618
+866 859 805 880
+81 599 633 634
+113 918 15 940
+983 915 916 992
+759 760 100 815
+141 140 0 145
+841 110 836 845
+170 171 134 178
+83 680 678 775
+592 78 74 635
+615 77 12 618
+125 976 914 992
+601 19 519 927
+190 252 253 933
+9 599 600 633
+20 156 202 211
+521 491 522 526
+182 188 189 191
+611 599 115 616
+841 839 837 843
+0 986 987 989
+0 136 137 138
+912 911 114 913
+579 578 0 653
+636 635 78 639
+995 0 998 1000
+634 0 81 639
+615 115 74 618
+304 311 312 321
+264 262 255 266
+270 265 271 305
+17 185 186 219
+0 182 183 188
+80 0 639 647
+592 584 78 639
+890 0 877 891
+972 952 0 974
+468 459 537 545
 140 139 0 145
-232 247 231 0
-152 133 135 134
-375 391 369 371
-525 142 148 154
-354 355 359 358
-971 120 960 962
-78 635 639 636
-24 19 23 515
-507 211 156 20
-208 205 22 212
-196 25 200 518
-69 70 436 557
-366 758 757 759
-425 438 433 440
-69 557 556 553
-0 1000 987 999
-405 423 0 404
-440 557 0 436
-74 78 584 646
-478 501 462 61
-479 481 485 475
-491 521 522 508
-446 347 451 0
-19 23 515 534
-471 472 0 470
-536 543 540 537
-665 670 683 83
-761 604 762 765
-214 216 0 495
-421 413 422 410
-532 520 502 522
-679 681 683 83
-469 59 0 468
-513 477 539 501
-476 471 466 469
-453 460 454 455
-463 453 455 460
-532 536 528 540
-471 470 0 469
-486 493 488 489
-353 356 509 213
-522 519 25 197
-640 646 644 638
-629 644 623 641
-587 572 590 9
-546 465 0 467
-362 6 517 44
-62 495 500 507
-580 576 581 582
-702 704 94 749
-77 74 646 640
-0 725 728 11
-580 577 647 585
-452 56 447 445
-65 582 0 542
-337 240 238 0
-158 146 154 148
-570 71 565 72
-438 436 433 440
-80 638 8 648
-802 795 796 803
-156 521 491 20
-434 435 559 360
-350 511 57 435
-704 757 694 756
-696 678 698 680
-367 6 361 357
-720 699 700 719
-370 328 357 369
-141 144 0 492
-707 709 88 711
-68 551 561 549
-459 467 465 546
-546 545 468 58
-463 466 0 453
-648 638 8 645
-783 794 787 788
-585 647 80 584
-608 609 611 572
-623 621 14 669
-694 686 756 75
-929 196 197 203
-432 688 564 691
-80 79 0 8
-733 827 791 770
-62 495 496 0
-0 177 182 948
-646 588 612 570
-573 565 570 563
-549 575 0 550
-891 877 882 901
-793 911 765 116
-386 49 389 388
-417 51 0 53
-510 515 64 511
-502 508 491 522
-523 483 61 482
-86 679 676 677
-660 658 657 664
-698 685 684 678
-482 502 539 501
-491 523 61 482
-56 402 55 0
-136 127 138 126
-106 13 818 810
-668 670 666 83
-429 374 763 366
-633 81 594 9
-591 601 600 19
-124 983 984 985
-526 157 521 491
-963 960 929 962
-631 632 635 122
-894 996 893 939
-617 913 909 910
-169 135 0 128
-137 131 16 136
-140 145 0 141
-952 974 997 999
-75 773 756 767
-27 205 193 206
-0 737 741 727
-0 668 677 670
-687 690 678 667
-0 637 649 8
-616 922 614 24
-593 590 594 9
-94 695 771 756
-243 293 258 333
-6 44 362 357
-574 563 0 575
-705 53 87 699
-585 586 653 578
-844 885 840 843
-618 116 911 913
-360 6 761 361
-263 257 256 260
-830 792 790 828
-321 314 39 30
-115 614 921 923
-375 364 365 376
-569 663 0 568
-696 687 695 690
-53 692 698 696
-769 794 788 793
-719 701 0 700
-611 609 610 572
-733 751 744 739
-816 821 810 815
-53 698 0 699
-424 51 0 417
-448 401 394 392
-373 381 372 4
-755 99 94 754
-373 420 50 46
-41 313 302 316
-409 0 408 410
-418 51 0 424
-408 406 405 398
-442 367 5 391
-592 599 635 115
-548 582 576 589
-681 684 0 683
-138 127 16 0
-726 732 710 742
-702 705 703 95
-675 777 91 732
-770 768 791 99
-861 860 857 862
-359 362 370 354
-788 794 787 910
-603 616 608 24
-105 837 835 104
-280 258 261 244
-104 103 820 101
-98 786 843 839
-695 686 96 756
-683 670 673 83
-792 790 783 785
-726 714 710 732
-75 765 767 758
-684 681 680 83
-606 516 605 360
-822 98 837 830
-141 147 144 492
-794 788 783 790
-697 419 693 704
-101 746 0 740
-839 886 840 811
-743 744 0 708
-86 679 680 720
-811 818 850 13
-670 665 666 83
-753 754 752 102
-261 242 246 245
-906 910 787 909
-762 758 76 429
-438 433 689 426
-378 377 381 4
-431 688 693 430
-757 758 756 767
-95 86 85 97
-620 773 96 75
-560 433 434 689
-705 53 699 698
-718 717 724 722
-116 617 619 910
-829 769 100 828
-679 677 673 676
-676 679 674 673
-588 577 584 610
-93 102 745 748
-753 752 746 102
-710 712 0 725
-94 754 99 102
-635 632 78 74
-840 841 839 13
-734 778 825 826
-830 98 837 839
-802 322 803 309
-253 252 260 256
-814 39 306 309
-0 728 729 11
-89 701 0 712
-380 46 378 4
-272 275 283 274
-310 371 384 376
-704 46 757 748
-310 301 36 37
-306 308 310 37
-809 753 810 819
-788 794 910 793
-733 827 103 820
-252 933 870 253
-0 627 626 628
-0 103 104 101
-728 730 729 11
-730 728 725 11
-793 808 767 765
-0 846 105 838
-711 89 0 710
-905 915 917 912
-0 730 729 728
-756 755 94 754
-757 46 420 4
-105 822 837 104
-730 724 722 714
-892 936 900 895
-735 91 731 727
-741 750 731 751
-686 695 690 693
-809 822 837 830
-0 898 988 994
-810 13 829 809
-0 836 835 105
-269 0 268 270
-117 875 937 873
-744 740 0 745
-984 912 905 985
-0 274 272 273
-741 739 0 744
-101 820 753 102
-381 0 382 383
-134 178 129 169
-171 176 178 168
-130 234 229 226
-251 250 191 249
-0 833 110 846
-618 116 77 12
-0 852 854 270
-278 285 277 276
-329 324 331 40
-283 275 281 274
-259 258 280 244
-805 814 866 796
-815 760 747 759
-258 249 251 254
-155 204 156 202
-225 234 226 0
-280 261 245 244
-817 107 852 857
-603 19 534 591
-0 738 103 739
-723 716 0 724
-729 91 727 11
-857 32 818 866
-0 103 740 739
-617 907 630 909
-606 516 360 559
-894 898 994 991
-604 618 615 12
-184 231 232 223
-267 260 256 248
-280 248 267 0
-853 270 108 858
-639 79 78 636
-111 845 836 110
-0 902 897 896
-0 845 847 848
-0 112 842 844
-0 845 848 111
-628 621 14 629
-141 145 144 147
-634 599 635 592
-120 961 944 928
-618 116 617 77
-877 878 882 901
-514 561 559 609
-141 151 147 133
-609 573 607 612
-0 627 628 909
-908 985 122 907
-527 597 602 601
-796 760 807 808
-76 758 75 694
-620 96 619 621
-321 317 320 312
-27 204 194 195
-373 366 420 4
-585 584 80 586
-842 840 865 850
-202 204 156 20
-173 170 152 172
-229 234 130 0
-800 604 765 911
-580 647 577 587
-604 116 618 12
-234 228 130 0
-930 196 927 929
-516 24 605 517
-516 517 605 6
-640 643 641 630
-123 967 966 121
-961 195 942 193
-258 249 254 261
-224 229 226 130
-21 183 184 0
-494 480 0 495
-199 324 200 206
-94 702 771 695
-94 756 771 755
-598 966 0 123
-234 229 233 0
-216 215 214 0
-939 894 990 991
-143 216 210 142
-210 219 150 17
-141 145 0 144
-154 174 155 17
-135 169 129 128
-909 910 787 627
-184 231 229 0
-216 26 209 215
-225 140 132 16
+81 592 599 634
+215 209 26 216
+138 16 137 139
+634 635 636 639
+229 226 130 234
+170 171 172 173
+152 134 170 173
+839 829 790 886
+133 149 150 173
+899 897 991 992
+528 536 532 602
+907 617 632 913
+141 147 133 151
+794 619 627 910
+649 637 0 650
+655 0 569 663
+882 878 797 901
+552 536 533 602
+0 487 488 493
+967 960 121 977
+894 990 991 994
+619 626 627 628
+627 626 0 628
+115 599 592 635
+668 83 666 775
+147 144 141 492
+483 480 60 486
+870 252 873 933
+74 632 78 640
+634 592 599 635
+524 158 160 525
+133 135 151 152
+142 209 155 211
+18 483 484 486
+130 129 0 131
+128 131 132 137
+130 224 225 226
+117 876 935 936
+146 149 152 173
+479 475 476 481
+0 275 276 285
+185 184 183 232
+132 133 134 135
+0 144 145 147
+252 190 873 933
+131 128 0 136
+134 135 152 170
+253 252 870 933
+21 171 1 176
+0 126 127 136
 131 127 16 136
-82 637 645 650
-734 826 827 770
-132 137 16 140
-211 209 216 142
-587 590 593 9
-160 165 159 157
-226 222 221 229
-137 136 0 128
-126 127 138 0
-128 131 136 0
-131 127 136 0
-600 599 633 9
-598 123 633 600
-211 209 142 155
-597 596 0 965
-580 593 647 587
-78 632 635 631
-0 628 14 641
-569 571 645 82
-0 738 737 823
-147 152 146 149
-140 139 145 151
-145 147 0 144
-137 138 0 136
-175 21 184 230
-154 174 172 153
-640 617 629 77
-151 147 133 152
-129 131 128 0
-242 245 237 246
-292 295 35 290
-135 137 0 128
-522 526 521 491
+132 129 128 135
+128 129 0 169
+250 249 191 251
+178 134 129 230
+181 189 190 191
+219 215 26 220
+486 18 480 494
+355 351 354 359
+131 0 127 136
+128 132 135 137
+27 193 194 203
+132 140 133 151
+131 129 128 132
+136 16 137 138
+136 126 127 138
+217 150 26 218
+139 0 16 140
+133 140 141 151
+137 0 138 139
+22 27 202 212
+183 177 1 187
+191 187 28 208
+156 155 202 211
+372 365 364 376
+479 473 475 485
+934 181 942 948
+140 16 132 225
+137 132 135 151
+252 256 257 260
+176 171 168 178
+135 132 133 151
 136 127 16 138
-132 131 16 137
-490 146 158 148
-19 968 616 24
-336 240 241 335
-201 213 206 200
-292 286 291 298
-40 317 324 323
-138 126 0 136
-151 145 0 139
-484 489 0 524
-135 137 132 151
-929 203 197 194
-140 151 141 133
-175 21 178 171
-185 186 17 219
-128 137 132 135
-164 172 0 167
-128 131 129 132
-129 130 132 131
-143 217 492 149
-139 16 0 138
-141 145 147 151
-160 165 0 159
-154 163 174 153
-598 595 0 597
-132 151 140 133
-128 131 132 137
-128 131 137 136
-263 319 260 282
-135 134 133 132
-128 129 135 132
-135 129 134 132
-173 133 152 134
-183 232 184 0
-139 137 16 138
-131 225 132 16
-139 138 0 137
-162 179 166 180
-990 914 125 970
-185 183 184 21
-136 127 126 0
-298 0 291 300
-160 163 165 157
-962 946 964 959
-634 635 982 980
-147 133 152 149
-149 152 146 173
-501 503 499 502
-26 218 0 217
-140 137 16 139
-136 138 16 137
-140 16 0 139
-527 519 601 602
-494 486 480 18
-147 152 0 146
-172 170 0 167
-17 1 175 171
-170 171 178 168
-489 490 158 148
-140 145 141 151
-195 180 181 22
-474 488 0 484
-494 495 216 142
-227 140 0 141
-534 601 602 591
-961 193 945 203
-174 167 172 164
-226 221 218 0
-137 151 0 139
-526 157 159 161
-143 148 492 493
-503 513 506 502
-143 142 148 494
-530 484 0 524
-623 644 662 82
-464 479 471 476
-492 493 0 143
-149 147 492 490
-471 476 470 469
-137 135 0 151
-328 30 363 322
-355 43 359 358
-142 210 154 155
-170 178 134 169
-149 173 154 210
-142 210 148 154
-338 243 334 339
-223 221 220 222
-143 26 210 216
-156 142 155 211
-201 194 203 27
-535 603 590 572
-180 187 181 22
-163 164 153 165
-194 961 929 203
-913 908 985 912
-349 504 355 353
-946 947 195 166
-202 209 211 155
-942 949 941 948
-60 485 474 473
-288 275 285 276
-158 153 0 160
-767 755 756 754
-175 178 134 171
-252 933 873 870
-618 604 911 116
-209 26 219 215
-490 489 493 148
-0 183 188 182
-148 149 146 154
-199 206 203 192
-171 167 172 174
-1 21 175 171
-174 164 172 153
-478 479 0 464
-210 149 148 154
-156 211 202 20
-223 222 220 219
-140 137 139 151
-173 134 175 150
-172 152 0 170
-147 151 0 152
+127 0 16 138
+145 139 0 151
+148 154 142 210
+147 141 133 149
+149 147 141 492
+970 914 125 977
+157 491 521 526
+148 149 154 210
+152 133 134 173
+160 159 157 165
+145 144 141 147
+96 566 686 687
+168 167 170 171
+197 194 201 521
+830 785 791 831
+138 0 16 139
+145 0 147 151
+246 241 29 247
+462 499 501 503
+175 184 185 222
+0 130 131 228
+488 0 484 489
+149 146 148 154
+135 133 134 152
+60 479 481 485
+160 153 0 165
+521 161 157 526
+161 521 522 526
+533 541 66 583
+457 445 63 558
+490 487 492 493
+592 587 9 611
+467 460 453 477
+187 183 182 188
+562 550 0 563
+137 139 140 151
+148 490 492 493
+60 474 484 486
+148 489 490 493
+145 141 140 151
+180 166 162 195
+216 142 143 494
+540 0 538 544
+194 197 201 203
+140 132 137 151
+523 491 157 526
+207 202 209 211
+924 916 919 938
+27 22 205 212
+489 148 18 493
+195 166 946 947
+185 183 1 187
+150 134 173 175
+142 156 155 525
+201 197 196 203
+464 471 476 479
+160 157 163 165
+226 130 224 229
+0 474 486 488
+134 129 135 169
+251 250 249 258
+487 0 492 493
+195 180 166 947
+225 130 226 234
+26 0 217 218
+1 162 17 186
+522 519 197 527
+26 218 219 220
+496 342 214 505
+0 158 160 524
+141 144 0 492
+170 167 0 172
+355 446 498 504
+134 133 150 173
+219 209 215 336
+930 15 920 931
+171 168 167 176
+132 131 130 225
+17 155 162 174
+173 154 17 174
+135 0 137 151
+149 147 146 152
+133 147 149 152
 151 135 0 152
-526 161 522 521
-135 151 133 152
-534 552 533 602
-0 786 884 885
-187 22 191 181
-526 482 529 523
-169 129 128 0
-149 173 146 154
-187 177 182 183
-180 187 182 181
-523 157 526 491
-125 977 976 975
-252 190 933 253
-163 166 164 165
-990 986 970 125
-482 523 526 491
-485 538 0 475
-160 523 525 157
-490 149 146 148
-474 488 484 486
-505 344 330 356
-69 561 550 436
-233 229 231 0
-27 22 193 205
-175 171 134 173
-947 166 180 195
-146 153 0 158
-556 465 0 546
-143 149 492 148
-479 485 473 475
-537 476 477 469
-171 21 178 176
-170 178 169 168
-479 60 473 485
-520 519 602 534
-573 565 607 612
-591 600 603 19
-158 525 148 154
-0 994 894 898
-483 485 484 60
-531 482 530 529
-60 486 0 474
-536 513 459 537
-541 540 528 536
-959 964 165 958
-869 864 856 867
-164 165 0 153
-173 175 17 150
-183 188 182 187
-526 522 502 491
-217 227 0 141
-874 872 871 804
-17 171 175 173
-878 900 798 938
-64 535 514 515
-479 60 485 481
-594 595 0 598
-171 170 173 172
-179 1 176 177
-173 172 152 146
-23 926 24 517
-249 191 188 28
-167 170 0 168
-296 332 295 334
-1 177 183 21
-170 135 0 169
-605 614 606 604
-482 526 502 491
-193 22 181 205
-187 22 186 208
-864 874 871 804
-232 241 28 223
-179 167 171 174
-175 185 184 21
-171 168 170 167
-0 183 182 177
-935 117 876 936
-134 169 129 135
-219 150 175 222
-62 507 499 497
-26 215 216 0
-231 247 235 0
-800 911 765 793
-257 325 252 319
-968 922 616 24
-182 188 189 191
-840 887 865 811
-918 931 872 799
-903 882 901 891
-201 521 522 197
-163 162 174 166
-211 207 209 202
-220 239 223 240
-227 225 0 140
-170 169 0 168
-152 170 134 135
-134 170 169 135
-180 1 179 177
-179 1 171 176
-247 246 236 0
-171 167 170 172
-174 162 155 17
-153 172 0 164
-153 146 0 172
-182 189 181 191
-154 153 172 146
-172 146 0 152
-154 172 173 146
-17 1 174 162
-174 155 163 154
-261 280 245 0
-176 168 171 167
-891 877 901 892
-878 797 805 880
-163 166 174 164
-133 134 173 150
-130 224 132 225
-370 368 369 357
-149 150 133 173
+151 0 147 152
+147 0 146 152
+151 147 133 152
+160 0 159 165
+148 142 143 210
+156 142 155 211
+156 491 500 507
+513 506 502 520
+153 0 164 172
+635 634 636 980
+146 149 148 490
+158 146 148 490
+27 194 201 203
+153 160 163 165
+18 158 489 524
+963 962 161 965
+329 331 2 354
+484 0 474 485
+489 18 486 493
+61 481 482 483
+563 550 0 575
+147 149 146 490
+186 1 162 187
+18 148 142 494
+502 491 482 526
+176 168 167 956
+358 355 498 504
+466 464 0 471
+495 494 480 500
+334 338 339 340
+260 319 326 333
+172 167 164 174
+522 491 502 526
+235 0 236 239
+951 952 119 972
+502 520 522 532
+502 513 520 532
+951 119 946 972
+502 522 526 532
+597 601 527 963
+162 22 186 187
+521 197 161 522
+121 0 123 973
+134 171 173 175
+854 852 0 855
+581 0 578 653
+160 153 163 525
+601 519 534 602
+972 120 952 974
+970 960 969 977
+597 0 598 966
+165 0 159 959
+512 25 506 520
+154 163 153 525
+481 479 475 485
+892 878 877 901
+166 163 164 174
+687 669 678 775
+959 159 161 965
+177 1 21 183
+0 153 164 165
+229 130 224 230
+963 601 927 967
+966 0 121 971
+209 202 155 211
+179 162 1 180
+224 132 130 225
+128 0 135 169
+965 597 963 966
+173 17 150 175
 149 133 152 173
-170 171 134 178
+541 536 528 602
+185 1 17 186
 171 170 134 173
-17 1 171 174
-17 174 171 173
-173 174 171 172
-154 173 172 174
-17 174 173 154
-162 155 163 174
-0 177 950 176
-257 320 325 319
-179 176 171 167
-226 233 221 0
-182 191 181 187
-1 21 171 176
-118 943 935 893
-162 1 179 180
-176 1 21 177
-0 21 177 176
-942 180 948 181
-292 298 290 35
-249 208 191 28
-29 241 249 28
-118 943 873 935
-936 117 876 874
-0 870 933 253
-162 1 174 179
-162 179 174 166
-166 179 174 164
-179 167 174 164
-965 596 0 159
-179 176 950 177
-950 948 947 180
-520 527 519 522
-966 965 971 963
-879 936 876 874
-930 196 199 198
-879 874 864 878
-259 260 258 333
-182 188 191 187
-878 938 798 797
-353 355 354 509
-960 929 969 927
-972 951 952 120
-0 262 274 273
-864 798 874 804
-202 162 22 186
-874 798 872 804
-0 21 183 177
-971 120 974 960
-972 946 951 120
-344 496 342 0
-922 921 976 968
-223 222 184 231
-1 185 175 21
-1 183 185 21
-217 227 141 133
-144 490 487 492
-186 1 187 185
-1 177 187 183
-1 187 185 183
-184 185 175 222
-1 185 17 175
-162 187 22 186
-185 187 186 28
-162 187 180 22
-186 1 185 17
-162 1 186 17
-155 162 186 17
-194 27 193 203
-197 203 196 201
-180 187 177 182
+222 229 184 231
+221 229 231 233
+177 21 0 183
+491 508 521 522
+0 127 16 228
+172 171 167 174
+798 805 864 878
+170 169 168 178
+175 134 171 178
+1 21 176 177
+798 797 805 878
+246 29 242 261
+948 942 941 949
+152 0 146 172
+927 601 19 967
+202 155 186 209
+204 163 157 964
+162 1 17 174
+312 31 257 320
+135 134 169 170
+166 162 163 174
+179 1 177 180
+154 146 172 173
+146 153 154 172
+146 152 172 173
+152 135 0 170
+0 153 146 172
+0 152 170 172
+171 167 170 172
+169 168 0 170
+167 0 168 170
+210 209 142 216
+203 27 193 206
+169 0 135 170
+171 17 1 174
+174 162 1 179
+189 181 182 191
+206 192 199 324
+155 17 162 186
+174 166 162 179
+920 918 113 924
+382 372 381 383
+172 152 170 173
+33 0 284 287
+144 147 490 492
+134 175 224 230
+174 171 167 179
+171 21 1 175
+183 182 177 187
+164 153 172 174
+163 153 164 174
+172 153 154 174
+163 154 153 174
+173 171 172 174
+172 154 173 174
+1 171 174 179
+17 171 1 175
+170 168 171 178
+179 166 162 180
+170 134 169 178
+890 882 889 903
+168 176 0 956
+533 536 541 602
+895 893 0 936
+908 122 907 985
+182 177 0 183
+181 22 187 191
+925 363 198 931
+35 292 290 298
+0 118 933 935
+176 21 0 177
+932 118 873 933
+188 0 182 189
+864 804 798 874
+962 959 161 965
+177 180 948 950
+164 166 174 179
+174 167 164 179
+965 959 0 971
+946 942 195 947
+176 171 1 179
+959 958 0 972
+118 932 873 943
+537 477 476 539
+156 20 202 204
+284 244 33 287
+354 353 2 355
+320 317 312 321
+27 205 206 212
+951 944 941 954
+182 187 188 191
+521 204 157 964
+950 949 0 955
+193 22 27 195
+29 246 0 261
+487 144 490 492
+870 875 876 935
+980 634 979 982
+183 21 0 184
+931 323 199 937
+28 185 183 232
+183 1 21 185
+175 21 1 185
+184 21 175 185
+184 183 21 185
+1 17 175 185
+182 180 177 187
 180 1 177 187
-162 1 180 187
-162 1 187 186
-118 933 873 932
-191 190 189 181
-261 242 258 249
-327 330 213 212
-187 208 186 28
-869 874 871 864
-890 887 882 888
-155 162 202 186
-292 293 295 282
-187 191 28 188
-331 40 324 200
-0 182 188 189
-902 896 899 897
-899 900 938 113
-296 339 35 0
-197 194 203 201
-339 295 35 293
-29 249 188 28
-0 254 261 248
-134 178 230 129
-227 140 133 132
-386 0 385 389
-506 508 509 504
-799 918 931 924
-27 212 205 206
-290 299 300 41
-520 519 25 522
-210 26 217 150
-532 602 528 536
-967 966 601 598
-520 461 513 506
-605 24 608 614
-27 195 193 22
-949 941 954 951
-195 162 166 180
-526 161 527 522
-242 237 245 244
-919 795 924 938
-193 205 181 190
-202 27 204 20
-865 861 857 862
-475 538 544 476
-27 204 195 22
-204 162 202 155
-247 241 223 239
-644 643 637 641
-194 961 195 946
-96 566 687 621
-373 366 374 420
-88 415 0 87
-750 742 743 741
-674 673 0 676
-115 618 923 908
-198 200 40 518
-562 550 573 560
-40 328 323 363
-204 162 22 202
-27 204 22 202
-203 206 193 192
-196 200 201 203
-220 215 26 0
-318 324 327 331
-774 772 771 768
-373 427 50 420
-101 753 746 102
-198 40 200 199
-0 118 935 893
-522 527 519 197
-196 25 201 200
+182 181 180 187
+330 344 345 353
+277 276 278 285
+296 334 339 340
+185 17 175 219
+491 156 500 523
+795 797 798 938
+19 24 926 968
+154 173 17 210
+608 605 24 614
+185 28 183 187
+195 162 22 204
+28 185 186 187
+186 185 1 187
+244 242 243 258
+226 221 0 233
+232 223 231 247
+221 226 229 233
+188 28 183 232
+187 28 183 188
+966 965 0 971
+220 219 215 336
+274 272 262 283
+258 244 242 261
+324 319 318 326
+188 187 28 191
+23 196 198 518
+862 859 857 865
+323 198 363 931
+319 252 260 326
+274 262 0 281
+296 0 35 297
+298 297 0 299
+872 804 871 874
+125 988 989 993
+804 864 871 874
+26 215 0 220
+186 155 17 209
+225 131 130 228
+220 221 222 223
+213 200 201 509
+185 223 28 336
+388 48 369 392
+880 882 887 888
+259 248 258 260
+970 120 960 974
+852 107 0 855
+605 604 606 761
+205 193 27 206
+203 200 201 206
+203 199 200 206
+798 864 874 878
+798 804 872 874
+918 15 117 937
+942 932 944 961
+360 516 559 606
+242 243 335 337
+906 114 787 910
+143 26 210 216
+500 61 62 507
+155 156 202 204
+250 191 205 251
+202 162 155 204
+928 944 945 961
+163 157 156 204
+429 366 374 763
 197 196 25 201
-175 222 150 224
-437 689 430 426
-2 332 331 329
-199 40 200 324
-328 322 314 30
-6 357 363 322
-759 366 747 4
-598 633 0 594
-678 764 680 696
-68 561 572 609
-211 214 209 207
-375 357 369 391
-330 327 213 331
-201 522 25 197
-494 142 148 18
-149 150 173 210
-232 29 247 0
-330 332 340 334
-208 191 22 205
-31 304 312 264
-186 208 22 202
-186 207 208 202
-322 357 328 314
-508 356 509 504
-359 362 368 370
-210 26 219 209
-203 200 206 199
-239 240 220 0
-155 186 209 17
-231 247 223 239
-231 247 239 235
-121 971 974 960
-522 506 508 25
-157 204 156 163
-163 204 156 155
-162 204 163 155
-163 166 204 162
-161 962 965 963
-600 967 601 598
-521 161 522 197
-327 250 212 205
-202 212 207 208
-141 217 133 149
-492 147 144 490
-210 150 217 149
-262 267 283 263
-29 241 242 249
-189 191 188 254
-287 237 284 244
-239 238 240 0
-29 246 242 241
-104 822 809 820
-214 216 209 215
-211 216 209 214
-209 186 219 17
-143 142 210 148
-142 209 210 155
-336 207 186 209
-134 230 224 129
-493 494 0 143
-219 26 150 218
-202 207 209 186
-201 20 27 213
-155 209 210 17
-143 210 149 148
-155 210 154 17
-210 173 154 17
-230 130 129 0
-276 285 277 0
-219 150 17 175
-210 150 173 17
-217 150 133 149
-284 243 338 339
-280 278 245 0
-356 499 508 507
-149 490 492 148
-210 26 150 219
-495 480 0 62
-143 26 217 210
-26 217 0 143
-412 0 380 414
-347 43 447 352
-356 507 508 20
-213 509 508 356
-331 200 354 40
-208 212 22 202
-20 213 212 27
-213 206 212 27
-201 213 27 206
-368 362 357 370
-391 357 369 368
-389 48 395 371
-396 399 400 47
-752 759 747 4
-496 344 497 0
-251 191 254 249
-241 238 240 239
-339 295 334 296
-16 127 228 0
-241 246 238 247
-130 228 234 225
-213 212 505 20
-287 288 33 285
-218 222 221 226
-227 226 225 224
-227 140 132 225
-214 215 209 207
-223 185 184 222
-185 219 175 222
-278 244 288 280
-131 228 127 0
-224 227 132 225
-219 26 218 220
+604 605 606 614
+17 173 150 210
+963 927 960 967
+773 116 619 910
+196 197 25 519
+281 275 274 283
+116 617 77 620
+431 0 51 692
+432 438 562 689
+705 45 703 709
+364 309 308 376
+375 310 309 376
+240 220 215 336
+669 667 566 687
+196 200 201 203
+645 82 637 650
+757 752 4 759
+209 207 211 214
+0 33 284 339
+205 250 251 326
+205 190 192 326
+192 252 325 326
+22 191 205 208
+560 573 607 609
+757 366 758 759
+188 28 29 249
+196 25 23 519
+209 155 17 210
+209 142 155 210
+199 198 196 200
+199 40 198 200
+291 3 294 300
+495 214 211 496
+186 22 202 208
+423 54 405 449
+276 275 274 281
+210 142 143 216
+150 210 26 219
+209 186 207 336
+17 186 209 219
+192 199 203 206
+203 193 192 206
+130 225 228 234
+854 0 108 860
+606 605 608 614
+162 155 186 202
+22 162 186 202
+21 175 178 230
 219 218 150 222
-134 175 150 224
-221 220 218 0
-237 284 337 0
-337 343 240 0
-224 226 225 130
-184 222 175 230
-219 26 220 215
-284 237 337 242
-230 229 130 0
-183 188 232 0
-33 0 286 35
-150 26 217 218
-230 129 178 0
-133 134 224 132
-16 228 225 0
-178 21 175 230
-227 140 141 133
-218 222 220 221
-218 219 220 222
-129 130 224 132
-239 235 236 0
-222 218 150 224
-130 234 226 225
-129 224 134 132
-247 29 246 0
-189 190 251 253
-231 247 232 223
-223 185 222 219
-237 337 238 0
-21 184 230 0
-218 222 226 224
-226 234 233 0
-21 230 178 0
-221 222 223 231
-231 222 184 229
+913 906 912 985
+195 166 162 204
+162 166 163 204
+156 155 163 204
+522 520 519 527
+522 197 161 527
+521 508 201 522
+157 160 523 529
+190 181 191 205
+191 181 22 205
+181 190 193 205
+181 193 22 205
+193 190 192 205
+22 193 27 205
+17 209 210 219
+349 345 344 353
+259 281 283 288
+212 207 341 505
+318 329 331 332
+6 44 360 516
+483 60 484 486
+0 214 215 216
+143 0 26 216
+215 26 0 216
+184 21 0 230
+209 215 26 219
+206 201 27 213
+455 453 460 463
+27 201 20 213
+508 213 201 509
+223 184 185 232
+205 22 208 212
+208 22 202 212
+154 17 155 210
+142 154 155 210
+173 154 149 210
+218 26 0 220
+173 149 150 210
+206 200 201 213
+334 243 293 339
+132 140 225 227
+50 418 404 424
+338 284 243 339
+490 489 487 493
+299 297 0 387
+396 391 5 397
+269 3 271 304
+857 852 858 860
+208 202 207 212
+520 519 25 522
+353 356 504 509
+210 149 150 217
+210 150 26 217
+376 375 371 397
+206 27 212 213
+212 27 20 213
+410 409 412 422
+421 374 54 422
+504 499 503 506
+550 0 436 562
+257 260 263 319
+0 183 184 232
+804 311 320 871
+320 319 317 325
+317 319 324 325
+344 349 353 356
+214 209 207 215
+0 143 26 217
+850 842 861 865
+248 259 258 280
+856 311 804 871
+241 238 239 247
+317 316 313 329
+249 29 254 261
+26 143 210 217
+0 131 127 228
+140 0 16 225
+16 131 225 228
+150 133 224 227
 133 134 150 224
-224 227 133 132
-184 229 230 0
-131 130 132 225
-28 185 232 223
-218 226 227 224
-150 218 227 224
-150 227 133 224
-150 227 217 133
-150 217 227 218
-217 218 0 227
-227 226 218 0
-225 226 227 0
-292 275 291 286
-228 130 131 225
-228 225 131 16
-127 228 131 16
-232 185 184 223
-188 29 232 0
-221 222 231 229
-230 222 175 224
-134 175 224 230
-230 222 224 229
-184 222 230 229
-225 228 234 0
-229 231 221 233
-185 232 184 183
-185 28 232 183
-183 188 28 232
-188 29 28 232
-229 233 221 226
-231 235 233 0
-229 234 233 226
-235 233 221 231
-278 288 287 285
-829 839 811 886
-253 190 251 252
-221 239 220 0
-281 288 259 280
-287 285 277 278
-238 239 236 0
-232 29 28 241
-220 240 215 0
-223 239 220 221
-518 509 25 200
-361 322 802 309
-241 246 242 238
-251 205 191 250
-935 875 873 870
-286 0 298 35
-253 256 260 248
-247 241 232 223
-0 188 29 254
-186 28 208 336
-850 841 840 13
-246 236 238 247
-247 29 232 241
-247 29 241 246
-0 188 254 189
-33 287 284 244
-248 260 258 259
-0 278 281 280
-0 266 273 268
-285 33 287 0
-231 239 223 221
-221 235 239 0
-361 6 801 322
-246 236 279 238
-342 341 340 338
-244 287 245 278
-261 249 254 29
-253 252 251 260
-272 283 294 264
-342 330 340 341
-304 302 312 294
-275 286 285 0
-288 244 259 280
-270 265 271 305
-320 319 257 312
-278 244 280 245
-241 247 238 239
-219 336 186 209
-209 215 336 207
-0 904 905 903
-388 392 369 42
-255 267 262 263
-311 321 320 312
-186 336 208 207
-296 297 346 0
-33 284 339 293
-0 109 266 108
-220 215 336 219
-220 240 223 336
-264 266 273 262
-281 267 280 259
-305 858 265 32
-876 875 868 871
-243 341 338 334
-791 831 830 785
-244 237 284 242
-865 840 811 850
-247 236 238 239
-109 869 856 867
-31 311 312 304
-250 205 191 208
-0 118 934 933
-189 190 191 251
-276 275 285 0
-34 277 287 0
-237 287 284 0
-254 191 188 249
-254 249 188 29
-257 260 252 256
-267 248 259 260
-212 250 208 205
-249 250 191 208
-335 336 208 28
-294 290 300 302
-292 294 291 283
-850 865 818 811
-248 258 251 254
-866 880 805 881
-244 288 287 278
-340 339 334 296
-697 51 417 53
-258 242 261 244
-261 242 245 244
-853 311 304 265
-369 391 48 371
-244 237 245 287
-295 334 318 333
-295 318 316 282
-867 864 856 859
-35 298 290 297
-241 223 336 28
-336 185 223 219
-336 219 186 185
+175 185 219 222
+132 130 129 224
+133 132 134 224
+28 188 29 232
+140 133 141 227
+341 338 342 343
+183 0 188 232
+259 280 281 288
+132 129 134 224
+150 175 219 222
+241 239 223 247
+175 150 134 224
+0 141 217 227
+253 251 189 254
+256 252 253 260
+220 0 221 239
+224 129 134 230
+225 0 16 228
+224 130 129 230
+222 221 218 226
+127 131 16 228
+221 218 220 222
+220 218 219 222
+223 221 222 231
+184 229 0 231
+224 222 218 226
+222 184 185 223
+806 796 807 808
+222 185 219 223
+241 240 238 337
+219 220 222 223
+222 218 150 224
+226 222 221 229
+223 185 28 232
+226 224 222 229
+217 141 133 227
+222 150 175 224
+221 0 218 226
+140 132 133 227
+217 133 150 227
+224 133 132 227
+225 224 132 227
+140 141 0 227
+218 0 217 227
+225 140 0 227
+226 0 218 227
+226 225 0 227
+218 224 226 227
+226 224 225 227
+224 218 150 227
+229 224 222 230
+178 175 134 230
+229 222 184 230
+228 225 0 234
+225 226 0 234
+29 188 0 232
+184 223 231 232
+229 0 130 230
+229 184 0 230
+21 184 175 230
+129 130 0 230
+0 229 130 234
+0 226 233 234
+239 238 236 247
+333 243 293 334
+0 184 231 232
+191 188 189 254
+231 229 0 233
+0 276 277 285
+233 229 0 234
+238 242 237 246
+239 220 0 240
+248 0 253 256
+0 231 233 235
+241 223 232 247
+231 221 233 235
+233 221 0 235
+254 251 249 258
+0 238 239 240
+312 294 302 316
+235 221 0 239
+238 236 0 239
+246 238 241 247
+188 29 0 254
+231 223 221 239
+266 264 262 273
+236 238 246 247
+250 243 249 258
+251 249 191 254
+223 220 221 239
+338 243 335 341
+261 258 244 280
+275 286 291 292
+498 461 358 506
+235 231 221 239
+252 251 190 253
+862 859 863 867
+29 188 249 254
+246 29 0 247
+900 117 874 918
+239 235 231 247
+28 188 191 249
+338 337 0 343
+191 190 205 251
+29 241 242 249
+335 28 241 336
+290 297 298 299
+278 245 244 280
+379 378 0 380
+240 239 223 241
+303 271 289 304
+236 235 239 247
+248 258 261 280
+36 265 271 303
+191 189 190 251
+261 244 245 280
+219 186 209 336
+0 235 236 247
+246 0 236 247
+235 0 231 247
+215 209 207 336
+239 223 220 240
 223 240 241 336
-557 440 57 70
-28 336 186 185
-321 30 320 317
-253 251 254 248
-264 269 272 273
-275 288 281 276
-0 254 253 189
-189 251 254 253
-189 191 254 251
-248 258 254 261
-29 242 261 249
-0 266 262 273
-29 242 246 261
-271 265 36 305
-0 254 29 261
-246 29 261 0
-336 335 208 207
-246 261 245 0
-284 243 293 244
-238 279 237 0
-288 278 281 276
-810 13 818 811
-312 321 317 316
-991 898 988 897
-321 30 39 311
-303 39 311 321
-321 311 304 312
-44 6 367 357
-0 869 868 109
-0 867 869 109
-310 375 371 376
-311 30 320 321
-0 267 262 255
-0 272 269 273
-102 754 752 748
-400 47 395 396
-0 256 248 267
-242 243 244 258
-858 812 265 32
-248 258 260 251
-253 260 251 248
-853 856 265 858
-249 243 258 250
-258 250 251 249
-242 243 258 249
-266 109 853 108
+220 215 0 240
+240 238 239 241
+320 312 311 321
+253 248 251 254
+249 188 191 254
+29 28 232 241
+28 223 232 241
+208 205 212 250
+0 29 232 247
+232 29 241 247
+231 0 232 247
+244 237 242 245
+262 264 272 273
+249 191 208 250
+293 284 33 339
+272 264 269 273
+291 290 298 300
+207 186 208 336
+237 0 238 279
+40 324 329 331
+327 206 213 331
+200 206 324 331
+391 371 375 397
+213 206 200 331
+440 57 433 443
+795 796 789 800
+335 241 242 337
+386 385 41 388
+219 185 186 336
+280 259 244 288
+242 244 245 261
+282 259 263 283
+255 31 109 868
+295 35 290 297
+0 267 280 281
+328 362 40 370
+257 868 870 875
+252 256 253 870
+265 39 303 306
+249 254 258 261
+868 256 257 870
+246 245 0 261
+869 856 864 871
+208 191 205 250
+254 248 251 258
+258 243 293 333
+454 452 451 457
+34 0 237 279
+293 259 258 333
+919 916 915 938
+915 899 901 938
+284 0 237 287
+266 269 264 273
+285 33 286 288
+892 0 879 936
+244 278 280 288
+283 281 275 288
+278 277 285 287
+253 189 0 254
+189 188 0 254
+0 248 253 254
+284 243 337 338
+236 238 0 279
+359 350 352 368
+242 29 249 261
+281 280 278 288
+855 107 849 861
 263 260 256 267
-327 341 330 212
-262 283 272 264
-275 291 286 0
-0 854 268 270
-271 0 3 269
-255 263 256 267
-255 263 264 31
-255 263 262 264
-264 269 3 272
-37 0 301 36
-265 39 311 303
-245 237 279 34
-264 273 272 262
-0 105 834 838
-262 267 281 283
-271 0 269 270
-0 838 834 824
-236 246 279 0
-88 89 0 711
-854 860 108 858
-255 257 256 263
-283 267 281 259
-208 341 207 335
-0 256 267 255
-264 266 262 255
-0 255 262 266
-0 109 255 266
-255 109 31 266
-31 266 264 255
-271 270 853 265
-304 303 289 271
-261 248 280 0
-306 39 303 310
-0 272 3 269
-238 236 279 0
-243 335 337 338
-19 616 603 24
-800 795 796 802
-274 283 272 262
-801 795 803 799
-297 299 290 41
-279 246 245 0
-38 306 36 37
-850 857 818 865
-53 692 0 698
-36 0 289 271
+260 248 256 267
+276 274 0 281
+31 263 264 312
+294 302 304 312
+30 317 320 321
+312 302 304 321
+311 304 303 321
+304 302 303 321
+311 30 320 321
+829 806 790 886
+242 249 258 261
+258 254 248 261
+254 0 248 261
+863 0 867 869
+0 109 867 869
+880 866 865 881
+262 255 263 264
+256 248 0 267
+253 252 251 260
+248 253 251 260
+0 271 36 305
+253 248 256 260
+258 248 251 260
+0 255 256 267
+207 208 212 341
+254 29 0 261
+268 0 269 273
+774 768 771 781
+857 850 861 865
+263 255 31 264
+263 256 255 267
+271 3 0 289
+298 290 299 300
+745 93 102 748
+327 324 206 331
+285 0 275 286
+271 0 270 305
+755 754 94 756
+845 841 847 848
+272 262 273 274
+38 0 36 305
+275 272 283 291
+108 109 0 266
+109 255 0 266
+31 255 109 266
+125 970 977 986
+268 269 266 273
+264 262 272 283
+266 262 0 273
+267 259 248 280
+266 108 109 853
+268 0 108 854
+272 274 275 283
+312 263 282 319
+266 0 268 273
+275 274 0 276
+237 238 246 279
+269 0 270 271
+272 0 3 291
+292 35 286 298
+267 262 263 283
+329 318 316 390
+281 274 262 283
+281 267 259 283
+264 255 31 266
+263 259 260 267
+260 259 248 267
+303 302 315 321
+753 752 815 821
+868 109 0 869
+760 813 807 815
+854 108 858 860
+307 38 37 308
+429 76 430 694
+860 857 855 861
+328 322 30 363
 0 108 266 268
-0 305 817 852
-854 852 858 270
-305 852 858 32
-274 272 275 0
-346 390 296 332
-265 311 304 303
-208 250 341 335
+845 111 836 848
+850 847 841 851
+264 3 269 304
+0 3 269 272
+878 863 864 879
+274 0 272 275
+25 508 506 522
+262 267 281 283
+346 0 387 393
+273 0 272 274
+3 264 269 272
 33 0 285 286
-304 289 3 271
-276 274 275 0
-248 280 267 259
-34 237 279 0
-248 258 280 259
-262 273 272 274
-246 279 237 238
-386 299 387 41
-25 509 201 200
-298 0 297 35
-288 285 275 286
-290 300 302 41
-292 295 290 282
-272 3 291 0
-817 106 107 818
-291 0 3 300
-279 245 34 0
-245 279 237 246
-300 0 3 289
-34 278 277 0
-0 849 855 107
-332 295 334 318
-342 343 338 0
+0 37 36 301
+35 0 33 286
+270 0 268 854
+304 31 264 312
+238 236 246 279
+273 262 0 274
+342 338 0 343
+292 283 282 294
+389 48 49 395
+245 246 0 279
+0 246 236 279
+0 34 245 279
+506 25 358 509
+297 290 41 299
+289 0 36 301
+246 245 237 279
+290 292 291 298
+277 0 34 278
+276 0 277 278
+293 35 295 339
+148 149 143 492
+278 276 0 281
+284 244 243 293
+289 3 0 300
+301 289 0 385
+271 0 36 289
+288 259 244 293
+244 259 258 293
+293 33 35 339
 259 263 260 282
-267 281 280 0
-267 262 281 0
-0 281 274 262
-243 258 293 244
-868 257 256 255
-244 284 243 242
-327 318 334 333
-244 288 33 287
-271 265 303 36
-327 331 206 213
-351 43 359 355
-292 291 290 298
-248 258 261 280
-457 63 498 461
-330 332 327 331
-340 330 344 345
-289 0 3 271
-0 278 276 281
-0 281 276 274
-275 281 274 276
-271 0 270 305
-344 330 353 345
-365 366 374 372
-353 348 349 345
-264 304 312 294
-321 328 313 314
-40 323 199 198
-38 817 32 813
-339 33 35 0
-249 335 242 243
-260 326 251 333
-337 338 343 0
-2 393 42 351
-332 2 390 329
-272 291 275 0
-283 291 292 275
-283 292 282 259
-346 345 2 332
-384 0 389 301
-214 215 343 0
-42 394 387 388
-272 294 3 264
-272 291 294 283
-327 333 334 250
-287 277 285 0
-278 287 245 34
-296 345 340 0
-399 0 400 47
-278 288 285 276
-275 283 281 288
-283 288 259 281
-288 293 292 259
-288 244 293 259
-316 319 317 312
-388 48 389 371
-301 303 289 315
-497 462 0 456
-293 292 33 288
-33 293 35 292
-244 293 33 288
-33 284 293 244
-293 258 259 244
-303 36 289 271
-23 24 515 517
-391 367 5 365
-343 215 240 0
-272 275 291 283
-300 299 385 41
-283 288 292 259
-283 292 288 275
-288 275 292 286
-33 288 292 286
-33 286 292 35
-413 373 381 372
-294 283 282 263
-855 857 860 852
-272 291 3 294
-264 283 294 263
-290 294 291 292
-282 294 290 292
-282 294 292 283
-36 0 271 305
-849 851 847 850
-821 815 307 377
-301 36 289 303
-315 301 303 310
-31 320 257 312
-250 335 208 249
-357 370 362 328
-292 293 35 295
-340 338 339 0
-337 242 238 241
-385 386 389 388
-304 265 303 271
-296 35 297 0
-297 298 290 299
-298 0 299 297
-47 0 400 395
-312 316 282 294
-614 613 604 605
-316 321 313 302
-319 320 325 317
-290 295 35 297
-297 295 35 296
-335 341 243 250
-33 339 35 293
-299 0 298 300
-286 0 291 298
-290 291 300 298
-290 300 291 294
-300 3 291 294
-250 326 251 205
-385 388 389 315
-383 382 381 372
-548 589 576 549
-303 311 304 321
-331 324 206 200
-424 416 0 411
-401 448 394 0
-380 0 378 379
-760 309 814 308
-385 301 289 315
-316 318 390 329
-313 317 329 328
-268 854 108 270
-31 311 320 312
-294 304 3 264
-294 302 3 304
-620 619 96 773
-881 796 789 797
-853 858 108 856
-0 108 854 860
-324 329 318 317
-264 304 3 269
-520 25 519 512
-249 335 208 28
-499 491 508 507
-302 300 3 289
-294 300 3 302
-313 369 315 314
-332 318 327 331
-306 309 310 308
-206 327 212 205
-306 305 265 32
-38 305 306 32
-305 306 36 38
-305 265 36 306
-265 303 36 306
-265 39 303 306
-385 315 289 302
-377 0 383 307
-400 396 395 48
-379 745 748 749
-37 0 38 307
-398 47 421 410
-263 319 257 260
-38 306 37 308
-38 308 37 307
-94 704 757 748
-302 300 289 385
-808 800 766 765
-620 116 773 75
-694 758 75 756
-306 39 310 309
-306 303 36 310
-506 509 358 504
-922 924 916 613
-781 627 794 619
-391 48 392 369
-397 5 421 365
-429 374 428 763
-775 83 86 677
-724 716 0 717
-303 310 39 314
-310 384 37 376
-309 310 314 39
-833 838 832 834
-303 301 36 310
-263 312 257 319
-508 20 201 213
-282 290 294 316
-312 302 316 294
-809 753 819 101
-118 935 873 933
-260 319 326 333
-378 0 381 377
-704 702 695 697
-606 604 762 761
-752 747 815 377
-751 97 770 92
-31 312 257 263
-31 312 263 264
-264 312 263 294
-302 315 303 321
-977 960 969 967
-475 481 538 476
-321 315 314 313
-329 316 318 317
-318 326 319 333
-293 259 258 333
-41 388 385 315
-410 0 408 399
-333 327 326 250
-334 333 243 250
-315 303 289 302
-41 386 385 388
-316 282 319 312
-494 216 143 142
-353 355 349 348
 303 310 314 315
-282 295 290 316
-206 326 327 205
-495 214 496 0
-318 324 319 326
-348 345 346 0
-316 282 318 319
-496 214 495 211
-40 323 324 199
-243 333 258 250
-309 314 322 39
-40 328 317 323
-42 392 394 388
-997 944 939 928
-771 768 755 781
-327 330 334 332
-450 439 440 57
-320 317 319 312
-326 250 327 205
-258 250 333 251
-263 312 319 282
-341 207 335 343
-257 319 252 260
-316 318 317 319
-251 326 190 205
-303 315 314 321
+260 252 251 326
+34 0 245 278
+267 248 0 280
+261 0 248 280
+261 245 0 280
+267 0 262 281
+280 267 259 281
+275 285 286 288
+292 290 282 295
+208 28 249 335
+280 278 0 281
+327 318 324 331
+335 243 250 341
+391 365 5 397
+284 237 244 287
+33 35 286 292
+243 244 258 293
+0 452 454 458
+335 337 338 343
+332 329 2 390
+337 243 335 338
+375 365 391 397
+212 250 327 341
+237 244 242 284
+242 244 243 284
+270 268 108 854
+293 292 282 295
+292 35 290 295
+35 292 293 295
+207 335 208 341
+495 0 214 496
+302 3 294 304
+334 250 243 341
+212 208 250 341
+302 289 3 304
+357 361 367 375
+350 435 44 511
+305 32 265 306
+281 276 275 288
+281 278 276 288
+285 276 278 288
+285 275 276 288
+285 278 287 288
+287 33 285 288
+287 278 244 288
+288 244 33 293
+292 288 33 293
+292 33 35 293
+329 324 318 331
+251 260 326 333
+35 295 296 297
+288 33 286 292
+283 259 288 292
+297 0 35 298
+292 282 259 293
+302 290 41 316
+389 371 48 395
+292 286 291 298
+286 275 288 292
+289 271 3 304
+212 206 213 327
+321 313 314 328
+314 303 315 321
+445 451 452 457
+295 290 282 316
+313 314 315 321
+283 275 291 292
+275 283 288 292
+201 200 25 509
+264 263 283 294
+263 282 283 294
+272 264 283 294
+272 3 264 294
+3 272 291 294
+291 272 283 294
+290 292 282 294
+292 290 291 294
+306 37 38 308
+291 283 292 294
 316 317 313 321
-302 315 321 313
-841 837 839 13
-841 835 837 13
-822 831 98 830
-800 795 802 801
-312 321 316 302
-333 326 251 250
-194 195 961 193
+309 39 310 314
+357 369 375 391
+43 351 347 355
+334 293 295 339
+106 107 817 818
+32 813 817 818
+317 318 316 329
+40 200 324 331
+419 46 50 420
+752 4 748 757
+752 747 4 759
+38 37 0 307
+315 313 41 388
+332 327 318 334
+334 327 250 341
+250 208 335 341
+297 35 290 298
+291 0 3 300
+0 298 299 300
+299 290 41 300
+320 30 804 872
+382 376 372 383
+381 0 382 383
+316 41 313 390
+48 392 394 401
+707 0 708 743
+315 289 301 385
+312 311 31 320
+334 330 327 341
+31 311 304 853
+385 299 0 386
+48 369 371 388
+0 289 300 385
+314 309 39 322
+289 302 303 304
+619 617 116 620
+0 87 88 415
+369 313 42 370
+294 263 282 312
+326 250 251 333
+265 36 271 305
+817 813 816 818
+300 3 294 302
+300 289 3 302
+300 294 290 302
+300 290 41 302
+369 315 371 388
+444 56 445 447
+282 263 260 319
+258 250 243 333
+312 317 316 321
+740 103 101 820
+303 265 271 304
+305 38 32 306
+36 38 305 306
+305 265 36 306
+303 36 265 306
+100 806 769 829
+36 37 38 306
+207 215 336 343
+369 314 357 375
+685 684 0 698
+42 346 387 393
+380 373 4 381
+920 914 15 969
+760 759 100 808
+306 39 303 310
+39 306 309 310
+306 303 36 310
+308 306 37 310
+44 350 359 368
+306 308 309 310
+708 93 703 744
+395 49 0 400
+695 96 687 771
+357 314 322 375
+755 781 792 794
+759 364 366 766
+30 323 328 363
+326 319 318 333
+875 871 868 876
+354 200 509 518
+13 810 106 819
+361 322 309 375
+362 44 359 368
+695 686 96 756
+807 760 100 808
+443 57 442 444
+405 398 54 422
+914 928 15 969
+330 212 327 341
+72 565 570 612
+335 208 28 336
+499 491 502 508
+2 351 354 355
+632 74 78 635
+761 361 801 802
+769 788 793 794
+322 30 314 328
+302 313 315 321
+31 257 263 312
+729 0 91 730
+311 31 304 312
+25 197 201 522
+327 213 330 331
+257 252 260 319
+759 747 364 760
+804 798 803 805
+319 317 312 320
+333 293 295 334
+326 318 327 333
+382 0 47 395
+258 259 260 333
+366 374 420 429
+303 301 310 315
+303 289 301 315
+302 289 303 315
+313 42 41 388
+5 398 396 421
+0 386 49 389
+258 251 250 333
+282 295 316 318
+251 258 260 333
+551 69 553 561
+296 332 334 340
+41 313 302 316
+401 396 48 403
+869 864 863 879
+321 30 317 328
+803 795 796 805
+369 371 375 391
+416 411 0 424
+381 380 373 413
+28 241 249 335
+311 39 30 321
+760 364 766 802
+312 282 316 319
 325 319 324 326
-321 317 313 328
-751 770 733 92
-913 910 911 114
+317 312 316 319
+318 317 316 319
+260 282 319 333
+687 621 669 774
+369 48 371 391
+40 199 198 323
+332 295 296 334
+388 315 371 389
+0 296 35 339
+769 767 755 773
+6 360 361 761
+796 795 789 797
+875 117 874 876
+314 39 303 321
+156 20 491 507
+331 327 318 332
+108 856 858 867
+768 92 99 770
+192 190 252 326
+251 190 205 326
+769 755 792 794
+295 318 333 334
+506 499 502 508
+319 257 252 325
+206 205 326 327
+344 340 330 345
+320 317 323 325
+870 868 0 876
+257 319 320 325
 317 30 320 323
-0 889 890 112
-328 30 317 323
+357 362 328 370
+319 318 317 324
+241 28 223 336
+323 40 199 324
+340 0 296 345
+321 317 313 328
+61 491 499 507
+324 206 192 326
+205 192 206 326
 325 324 192 326
-324 325 192 199
-733 770 99 92
-319 325 324 317
-327 324 206 331
-324 325 323 317
-325 320 323 317
-313 316 329 317
-326 192 190 205
-317 328 321 30
-328 314 321 30
-252 325 192 326
-252 192 190 326
-251 252 190 326
-260 326 252 251
-260 319 252 326
-326 319 252 325
-212 327 206 213
-332 318 331 329
-206 324 327 326
+212 205 206 327
+326 205 250 327
+250 205 212 327
 318 324 326 327
-384 397 371 395
-282 318 319 333
-35 296 295 339
-351 43 347 352
-61 480 483 500
-559 435 511 516
-373 420 46 4
-56 452 0 439
-425 433 426 443
-367 375 365 391
-2 351 355 348
-444 445 57 350
-435 511 57 70
-351 359 370 354
-284 33 339 0
-2 348 345 346
-509 213 201 200
-477 513 503 501
-384 382 397 395
-296 340 345 332
-214 207 342 343
-519 23 25 196
-258 333 260 251
-449 423 0 405
-354 331 40 329
-376 371 384 397
-339 334 295 293
+333 318 327 334
+317 323 40 328
+323 317 30 328
+534 64 535 552
+378 4 377 381
+295 35 296 339
+335 338 341 343
+346 2 348 393
+324 318 317 329
+324 317 40 329
+583 0 65 593
+353 349 348 355
+365 5 367 391
+40 317 328 329
+328 317 313 329
+344 0 340 345
+0 342 214 496
+282 293 295 333
+250 326 327 333
+260 259 282 333
+293 282 259 333
+857 855 852 860
+330 327 331 332
+405 409 410 422
+213 212 327 330
+365 367 375 391
+499 502 503 506
+334 295 296 339
+243 249 242 335
+242 237 284 337
+243 242 284 337
+338 243 334 339
+339 0 296 340
+52 379 46 749
+331 329 2 332
+243 338 334 341
+319 282 318 333
+208 249 250 335
+318 282 295 333
+243 250 249 335
 249 241 242 335
-296 345 346 332
-243 335 250 249
-395 396 397 48
-338 337 284 0
-336 335 207 343
-482 501 481 61
-389 395 384 371
-367 357 391 368
-293 333 295 282
-293 259 333 282
-259 260 333 282
-282 260 333 319
-318 327 326 333
-341 334 243 250
-214 343 342 0
-28 185 223 336
-340 332 296 334
-339 243 334 293
-293 243 334 333
-293 334 295 333
-284 243 339 293
-327 332 334 318
-392 48 394 388
-342 207 341 343
-337 237 238 242
-510 358 512 518
-498 506 461 358
-240 337 238 241
-344 342 340 0
-220 240 336 215
-241 337 335 240
-241 242 335 337
-335 242 243 337
-243 284 337 242
-296 340 339 0
-475 476 544 470
-392 352 403 368
-2 353 354 331
-341 340 338 334
-330 340 341 334
-336 240 343 215
-340 330 345 332
-296 346 345 0
-341 327 250 212
-208 212 341 250
-387 299 297 41
-342 338 340 0
-54 423 449 405
-338 339 334 340
-208 212 207 341
-341 327 334 250
-341 330 334 327
-214 207 343 215
-336 343 207 215
-392 403 391 368
-243 335 338 341
-336 240 335 343
+345 0 296 346
+335 207 208 336
+223 185 219 336
+340 332 330 345
+353 2 331 354
+333 250 243 334
+327 250 333 334
+332 318 295 334
+332 330 327 334
+0 340 342 344
+338 0 284 339
+340 338 0 342
+512 510 23 515
+297 296 0 346
+407 403 402 441
+223 219 220 336
+208 186 28 336
+242 238 237 337
+0 284 237 337
+0 237 238 337
+240 0 238 337
+340 330 341 342
+215 240 336 343
+240 335 336 343
+345 332 330 353
+49 388 386 394
 337 335 240 343
-337 335 343 338
-338 335 343 341
-342 341 338 343
-348 393 347 0
-410 409 422 405
-439 452 0 458
-398 441 54 5
-396 403 441 5
-370 313 369 42
-451 452 447 445
-404 427 418 50
-526 532 502 522
-358 43 359 63
-309 376 308 364
-726 721 701 714
-62 496 497 0
-342 330 344 340
-450 444 439 57
+382 384 395 397
+597 595 528 602
+391 396 5 403
+337 0 284 338
+499 61 462 501
+339 338 0 340
+20 156 491 521
+334 332 330 340
+337 240 0 343
+395 384 371 397
+550 563 573 575
+240 215 0 343
+341 207 335 343
+336 335 207 343
+340 334 338 341
+330 334 340 341
+342 0 214 343
+214 0 215 343
+342 214 207 343
+207 214 215 343
+207 341 342 343
+342 340 330 344
 367 357 375 391
-403 442 441 5
-389 0 385 301
-446 348 347 0
-353 330 213 331
-353 330 331 332
-2 353 331 332
-345 353 2 332
-349 348 446 0
-497 344 349 0
-349 344 345 0
-387 394 393 0
-347 393 348 351
-2 348 393 351
-2 370 351 42
-354 2 331 329
-353 355 509 504
-505 356 213 20
-330 353 213 356
-359 43 350 63
-457 63 43 498
-678 687 764 696
-802 796 808 760
-359 43 352 350
-351 43 352 359
-496 214 342 0
-357 328 363 322
-301 371 310 315
-2 355 354 353
-2 355 353 348
-520 513 502 506
-355 347 348 351
-375 361 365 364
-353 349 344 345
-92 772 770 768
-359 63 510 358
-390 318 295 332
-503 499 462 501
-2 351 354 355
-968 922 24 926
-355 347 351 43
-309 375 376 364
-83 668 670 677
-510 63 511 64
-362 328 40 363
-394 48 49 388
-518 358 25 509
-352 445 444 350
-370 368 392 369
-383 0 384 37
-704 94 695 702
-83 775 666 668
-380 378 381 4
-376 397 382 372
-521 201 522 508
-498 461 503 460
-356 344 330 353
-62 462 0 497
-709 699 87 700
-728 724 0 730
-434 763 762 429
-518 358 512 25
-6 357 362 363
-6 357 322 361
-588 573 610 612
-375 365 391 397
-367 6 360 361
-314 371 315 310
-419 52 50 46
-370 328 369 313
-441 442 443 5
-359 352 368 350
-359 350 368 44
-368 44 367 357
-93 749 94 748
-689 429 430 426
-757 756 94 754
-433 435 57 70
-512 358 506 25
-364 361 802 309
-44 511 350 435
-436 70 560 433
-86 83 679 677
-322 375 314 309
-510 515 511 516
-491 521 508 20
-521 161 197 194
-559 435 516 360
-357 328 362 363
-360 516 605 6
-559 516 608 606
-40 323 198 363
-607 559 606 434
-434 360 762 763
-615 611 609 610
-516 608 606 605
-0 104 819 101
-748 378 46 4
-295 332 296 390
+454 451 0 455
+0 297 346 387
+352 403 442 444
+2 345 346 348
+0 384 389 395
+506 358 504 509
+365 375 376 397
+444 352 402 447
+384 376 371 397
+352 43 347 447
+360 434 428 763
+345 296 332 346
+401 48 392 403
+345 332 2 346
+368 357 367 391
+48 396 391 403
+331 213 330 353
+200 198 196 518
+331 40 200 354
+354 362 40 518
+348 345 0 349
+456 349 0 497
+516 6 44 517
+345 344 0 349
+350 44 359 510
+495 62 0 496
+329 40 331 354
+358 355 354 359
+396 395 48 397
+25 196 23 518
+872 798 874 918
+353 348 2 355
+43 355 358 359
+355 43 351 359
+2 348 351 355
+520 25 506 522
+423 0 425 449
+0 473 472 479
+519 197 25 522
+349 348 345 353
+352 351 43 359
+428 54 426 443
+399 396 47 400
+498 358 504 506
+422 373 374 427
+373 4 366 420
+388 387 386 394
+423 418 404 427
+0 56 402 447
+685 667 678 690
+211 207 202 505
+313 369 42 388
+328 323 40 363
+444 402 56 447
+372 364 366 747
+341 330 212 505
+384 301 0 389
+328 313 314 369
+704 94 702 749
+357 328 369 370
+351 2 354 370
+360 6 361 367
+347 0 348 393
+720 709 95 750
+362 357 44 368
+486 474 484 488
+353 330 344 356
+455 460 498 503
+353 213 330 356
+70 433 435 559
+457 460 461 498
+399 398 396 407
+707 87 88 709
+44 6 362 517
+930 198 199 931
+307 37 0 383
 362 354 40 370
-372 366 373 4
-54 443 425 426
-361 375 322 309
-412 422 404 50
-370 368 351 392
-422 427 404 50
-840 843 839 841
-361 357 322 375
-357 367 375 361
-314 375 369 371
-322 357 314 375
-351 352 368 359
-791 784 831 785
-354 329 40 370
-362 370 40 328
-329 313 370 42
-2 329 370 42
-420 757 758 694
-354 2 329 370
-412 0 413 380
-370 329 40 328
-48 396 397 391
-403 401 396 407
-364 366 372 747
-351 352 392 368
-732 85 777 731
+314 322 328 357
+70 553 69 561
+726 720 85 750
+387 42 393 394
+420 694 704 757
+386 0 49 394
+359 351 354 370
+313 328 329 370
+412 409 404 422
+359 352 351 368
+42 329 2 370
+23 512 515 534
+510 63 350 511
+204 156 20 521
+6 357 44 362
+45 707 703 709
+367 368 391 442
+201 27 20 521
+510 44 362 517
+422 54 423 427
+201 197 521 522
+371 310 314 375
+357 322 361 375
+48 388 49 394
+600 598 594 633
+678 667 687 690
+362 328 40 363
+362 357 328 363
+357 322 328 363
+362 6 357 363
+6 322 357 363
+757 4 366 759
+797 795 798 805
 310 309 314 375
-406 449 405 398
-359 44 368 362
-368 44 357 362
-433 428 434 426
-383 308 37 376
-373 46 380 4
+314 313 315 369
+379 52 46 414
+359 354 362 370
+351 359 368 370
+313 329 42 370
+378 4 748 752
+422 405 404 423
+705 87 45 709
+369 368 357 370
+384 382 376 397
+380 4 378 381
+359 362 368 370
+368 362 357 370
+310 308 309 376
+37 308 310 376
+357 6 44 367
+361 6 357 367
+746 377 378 752
+381 372 4 747
+391 48 371 397
+102 93 94 748
+44 6 360 367
 328 314 357 369
-328 314 369 313
-389 384 301 371
-299 0 387 297
-354 2 370 351
-392 391 369 368
-404 412 411 409
-376 364 365 372
-314 369 315 371
-396 5 397 391
-388 371 389 315
-379 380 46 378
-308 310 37 376
-309 310 376 375
-364 366 365 372
-387 386 394 0
-370 392 351 42
-370 369 392 42
-416 706 414 52
-390 318 332 329
-376 365 397 372
-412 0 411 409
-314 375 371 310
-686 695 693 694
-420 374 427 429
-373 422 50 427
-404 423 418 427
-425 437 426 438
-90 721 722 714
-725 712 0 713
-422 54 427 374
-373 422 427 374
-420 419 50 46
-76 686 694 75
-422 54 423 427
-54 426 423 427
-760 802 814 309
-850 818 106 13
-401 49 400 0
-386 0 299 385
-376 384 37 383
-375 391 371 397
-383 0 37 307
-388 48 369 392
-301 371 384 310
-745 102 746 748
-315 369 313 388
-307 308 383 747
-383 308 376 747
-413 421 422 373
-373 380 381 4
-446 347 355 43
-50 412 411 404
-703 708 749 93
-742 710 0 11
-395 47 397 396
-50 418 404 424
-384 0 301 37
-374 421 372 373
-377 0 381 383
-378 0 380 381
-376 382 383 372
-101 753 819 821
-605 604 606 761
-380 0 379 414
-373 422 412 50
-41 42 313 390
-390 329 42 313
-386 385 299 41
-41 315 313 388
-41 313 316 390
-316 329 390 313
-2 390 346 332
-382 0 384 383
-376 384 383 382
-299 0 300 385
-302 300 385 41
-41 315 385 302
-389 371 301 315
-385 389 301 315
-316 295 290 390
-299 0 386 387
-382 0 395 384
-393 392 42 351
-395 0 389 384
-388 369 313 42
-41 388 313 42
-42 388 387 41
-387 388 386 41
-395 47 382 397
-400 0 49 395
-398 421 422 410
-42 393 346 387
-371 48 369 388
-315 371 369 388
-316 318 295 390
-382 413 381 372
-702 749 94 93
-49 0 386 389
-297 295 296 390
-346 297 296 390
-346 387 297 390
-390 387 297 41
-290 390 297 41
-316 390 290 41
-42 387 390 41
-42 387 346 390
-2 42 346 390
-376 397 384 382
-54 426 427 374
-398 54 449 405
-413 422 412 373
-49 395 389 48
-395 0 49 389
-0 777 735 91
-48 391 397 371
-5 428 54 374
-394 386 49 0
-394 388 49 386
-368 367 442 391
-42 393 387 394
-403 444 441 442
-47 0 395 382
-2 348 346 393
-2 393 346 42
-406 55 0 449
-448 393 394 0
-447 445 444 352
-396 398 399 47
-781 619 794 773
-447 347 448 0
-368 350 442 44
-420 427 419 430
-398 410 422 405
-711 700 88 89
-498 504 358 355
-449 425 0 423
-89 701 712 710
-49 400 395 48
-410 409 405 408
-375 397 371 376
-375 365 397 376
-367 442 435 44
-89 726 700 701
-706 0 379 708
-400 401 407 396
-591 600 9 603
-394 49 401 0
-560 70 561 559
-428 443 54 426
-367 442 428 435
+396 398 47 421
+5 396 397 421
+371 314 369 375
+700 88 709 711
+705 95 702 764
+95 705 680 764
+364 361 309 375
+328 40 329 370
+354 329 40 370
+396 47 395 397
+375 371 310 376
+41 299 300 385
+415 0 87 417
+399 406 0 408
+365 364 366 372
+361 364 365 375
+351 42 2 370
+401 400 396 407
+315 301 310 371
+315 314 369 371
+315 310 314 371
+46 4 378 380
+290 297 41 390
+711 709 726 750
+420 374 373 427
+743 703 750 751
+42 388 392 394
+421 373 374 422
+423 405 0 449
+50 418 419 427
+762 758 429 763
+377 307 0 383
+759 366 758 766
+378 377 0 381
+379 46 380 414
+601 591 595 602
+434 360 428 435
+412 50 373 422
 421 54 398 422
-48 394 401 392
-54 425 449 423
-48 394 49 401
-48 401 49 400
-48 401 400 396
-398 47 410 399
-398 410 408 399
-412 373 380 413
-403 396 391 5
-403 48 391 396
-48 401 396 403
-406 405 0 408
-406 55 449 441
-456 349 446 0
-19 926 24 23
-48 401 403 392
-392 48 391 403
-163 155 156 525
+409 405 404 422
+373 366 372 374
+366 365 372 374
+428 426 374 429
+433 426 428 434
+584 586 588 646
+438 433 560 689
+439 444 57 450
+739 0 737 741
+88 707 709 711
+703 702 93 749
+308 364 376 747
+369 313 315 388
+766 760 802 808
+745 378 379 748
+378 46 379 748
+0 301 385 389
+410 0 47 413
+318 295 316 390
+381 377 0 383
+12 75 76 762
+380 378 0 381
+434 559 560 607
+371 48 388 389
+42 387 388 394
+366 4 372 747
+703 45 702 749
+388 386 385 389
+50 411 412 414
+440 439 57 450
+412 380 50 414
+405 398 406 449
+385 41 299 386
+302 300 289 385
+37 307 308 383
+388 48 49 389
+376 37 308 383
+412 0 410 413
+447 43 347 451
+371 301 310 384
+329 316 313 390
+310 37 376 384
+383 376 37 384
+383 37 0 384
+301 0 37 384
+383 0 382 384
+383 382 376 384
+435 428 433 443
+376 372 365 397
+332 318 329 390
+371 315 301 389
+56 55 0 402
+398 410 421 422
+625 621 14 626
+384 0 382 395
+386 41 299 387
+41 297 299 387
+384 371 301 389
+290 295 297 390
+346 297 296 390
+297 295 296 390
+385 315 41 388
+329 42 2 390
+329 313 42 390
+316 295 290 390
+414 50 411 424
+389 384 371 395
+0 346 348 393
+387 41 42 388
+388 385 315 389
+301 315 385 389
+388 49 386 389
+42 346 2 390
+346 332 2 390
+387 41 297 390
+387 297 346 390
+41 387 42 390
+346 42 387 390
+295 332 296 390
+42 313 41 390
+346 296 332 390
+47 382 395 397
+416 52 414 424
+49 0 389 395
+42 351 2 393
+346 42 2 393
+348 2 351 393
+368 352 351 392
+391 368 369 392
+370 369 368 392
+368 351 370 392
+42 369 370 392
+370 351 42 392
+391 369 48 392
+392 351 42 393
+0 405 406 449
+347 348 351 393
+415 87 45 417
+412 380 0 413
+421 410 413 422
+392 391 368 403
+408 405 0 409
+440 433 425 443
+400 0 399 407
+398 405 406 408
+367 44 368 442
+373 372 381 413
+435 367 428 442
+395 0 47 400
+398 406 399 408
+54 374 5 428
+406 398 399 407
+404 411 50 424
+411 0 412 414
+396 48 391 397
+395 48 49 400
+395 396 48 400
+402 56 55 444
+411 404 0 424
+416 414 411 424
+0 380 381 413
+417 51 52 424
+400 396 48 401
+400 48 49 401
+49 48 394 401
+400 49 0 401
+394 0 49 401
+398 54 441 449
+398 405 54 449
+392 368 352 403
+497 456 349 504
+684 681 0 698
+401 394 0 448
+410 398 405 422
+441 402 55 444
+65 0 66 542
+0 406 55 449
+446 0 347 451
+60 473 0 479
+441 406 398 449
+441 55 406 449
+430 418 419 431
+409 408 405 410
+372 373 374 421
+0 415 416 417
+380 50 373 412
+45 87 53 417
+510 350 44 511
+380 412 0 414
+710 714 11 732
 405 404 0 409
-410 409 412 422
-399 406 0 408
-699 700 0 87
-45 697 417 53
-450 444 56 439
-391 403 5 442
-347 393 448 0
-400 407 399 396
-399 407 398 396
-399 406 398 407
-407 399 406 0
-407 406 55 0
-402 407 55 0
-401 407 402 0
-401 400 407 0
-407 400 399 0
-403 401 407 402
-398 410 405 408
-430 418 427 419
-411 50 404 424
-447 445 56 444
-47 0 410 399
-47 0 413 410
-424 417 0 416
-398 54 405 422
-428 426 54 374
-422 409 404 405
-413 0 412 410
-422 413 412 410
-413 373 380 381
+0 401 402 407
+403 402 401 407
+403 401 396 407
+447 56 445 452
+442 403 441 444
+406 399 0 407
+406 0 55 407
+402 55 0 407
+393 347 0 448
+57 350 435 442
+408 398 405 410
+405 0 406 408
+412 404 50 422
+420 429 430 694
+399 398 408 410
+0 408 409 410
+0 399 408 410
+0 47 399 410
+47 398 399 410
+701 0 89 712
+412 373 413 422
+0 739 740 744
+410 412 413 422
+0 381 382 413
+421 413 373 422
 409 404 0 411
-413 0 381 380
-421 54 422 374
-414 380 46 379
-50 380 46 414
-724 723 716 713
-414 379 46 52
-421 422 373 374
-418 430 431 419
-441 444 55 450
-50 414 46 52
-365 421 372 374
-431 432 430 437
-50 412 414 411
-50 412 380 414
-50 412 373 380
-47 0 382 413
-382 0 381 413
-87 417 0 53
-721 726 720 85
-415 417 87 45
-397 5 396 421
-45 417 87 53
-416 417 0 415
-415 417 0 87
-397 421 372 365
-421 47 413 410
-437 438 0 432
-404 424 0 411
-771 764 92 772
-373 374 427 420
-425 438 0 437
-693 430 688 694
-393 448 394 392
-757 767 754 759
-419 418 50 424
-424 416 414 52
-50 424 414 52
-572 561 514 609
-427 418 50 419
-428 442 443 435
-5 398 396 421
-443 435 57 433
-421 396 47 398
-422 54 405 423
-437 438 689 426
-441 443 54 5
-422 423 404 427
-562 689 432 438
-767 100 759 808
-85 86 679 676
-690 685 692 696
-702 95 92 764
-422 423 405 404
-455 451 0 446
-5 54 398 421
-382 421 47 413
-382 421 413 372
-382 397 421 372
-382 397 47 421
-397 396 47 421
-426 428 443 433
-561 70 514 559
-424 417 416 52
-424 51 417 52
-419 51 424 52
-419 51 418 424
-424 411 414 416
-50 411 414 424
-427 419 50 420
-425 450 440 443
-425 449 450 443
-443 450 440 57
-490 158 0 489
-442 444 443 57
-429 374 427 426
-426 374 428 429
-18 158 524 525
-702 93 94 92
-574 568 571 569
-434 435 360 428
-694 430 688 76
-425 438 426 433
 5 374 365 428
-428 435 443 433
-5 428 365 367
-627 782 626 781
-420 374 429 366
-418 431 0 51
-418 431 51 419
-762 606 360 434
-45 705 87 709
-442 352 444 350
-54 425 423 426
-434 428 429 426
-731 85 777 97
-69 70 553 561
-510 516 517 515
-512 23 515 510
-430 693 419 694
-429 427 430 426
-675 85 777 732
-691 685 692 690
-418 437 0 431
-73 568 71 564
-532 526 527 522
-562 565 564 432
-420 427 430 429
-426 437 427 430
-620 686 75 96
-620 686 96 566
-686 687 695 96
-432 565 564 688
-443 440 433 57
-435 44 360 367
-433 435 434 428
-437 418 427 430
-437 432 0 431
-431 437 430 418
-448 401 402 0
-407 402 441 403
-515 514 64 511
-511 44 510 516
-512 515 64 510
-566 690 687 667
+418 404 0 423
+5 365 367 428
+391 5 367 442
+411 409 404 412
+0 409 411 412
+409 0 410 412
+730 91 11 732
+46 50 380 414
+307 0 816 821
+414 411 0 416
+692 685 0 698
+411 404 50 412
+373 380 412 413
+0 382 47 413
+803 39 30 804
+765 758 762 766
+307 377 0 821
+11 710 732 742
+0 51 417 424
+413 382 47 421
+688 690 691 693
+433 425 426 438
+413 372 382 421
+50 419 420 427
+680 696 678 764
+430 419 420 694
+347 43 355 446
+4 373 46 420
+427 426 423 437
+420 373 50 427
+403 368 352 442
+444 443 57 450
+0 418 423 437
+0 423 425 437
+426 423 54 427
+374 54 5 421
+437 0 432 438
+422 374 54 427
 436 70 433 440
-805 803 814 796
-931 925 198 363
-361 801 802 322
-512 461 520 506
-368 352 442 350
-396 441 398 5
+410 47 398 421
+413 373 372 421
+425 443 449 450
+404 422 423 427
+422 404 50 427
+54 426 374 428
+0 51 418 431
+415 0 416 706
+0 69 549 550
+397 365 5 421
+397 372 365 421
+374 5 365 421
+374 365 372 421
+5 54 398 421
+360 367 428 435
+72 566 71 686
+442 5 428 443
+710 0 89 711
+770 791 826 827
+696 687 678 764
+416 0 417 424
+419 52 51 424
+419 51 418 424
+419 50 52 424
+418 50 419 424
+404 418 0 424
+436 0 438 562
+57 433 70 440
+576 68 549 589
+460 457 455 498
+5 391 403 442
+5 403 441 442
+691 690 692 693
+667 73 71 690
+425 0 437 438
+355 349 348 446
+535 64 67 552
+702 93 92 703
+705 702 696 764
+696 695 687 764
+686 96 687 695
+709 95 705 720
+442 57 350 444
+426 433 438 689
+428 435 442 443
+425 423 54 426
+360 761 762 763
+538 475 476 544
+778 776 0 779
+435 57 442 443
+429 428 426 434
+99 791 820 828
+68 549 551 561
+586 579 571 645
+575 549 0 576
+570 563 568 574
+427 418 419 430
+437 426 425 438
+429 426 427 430
+429 427 420 430
+427 419 420 430
+685 678 684 698
+693 419 430 694
+439 440 57 557
+696 678 685 698
+548 0 549 576
+512 64 510 515
+436 433 438 440
+55 441 444 450
+605 360 6 761
+442 350 352 444
 426 425 423 437
-423 425 0 437
-5 443 54 428
-423 437 0 418
-427 437 423 418
-427 426 423 437
-458 452 0 454
-402 56 444 447
-556 69 0 557
-555 69 553 551
-492 217 141 149
-446 498 43 355
-531 482 526 532
-481 501 478 61
-355 509 358 354
-442 444 441 443
-5 442 443 428
-443 442 57 435
-425 450 0 440
-442 350 57 435
-444 445 56 439
-12 607 72 612
-396 407 441 403
-396 407 398 441
-406 441 398 407
-406 55 441 407
-407 55 441 402
-402 444 352 447
-447 448 402 0
-414 0 379 706
-449 450 0 425
-444 56 55 450
-441 450 55 449
-56 439 0 450
-450 439 0 440
-55 450 0 449
-449 441 450 443
-403 352 442 368
-391 403 442 368
-442 428 5 367
-451 455 0 454
-451 347 447 0
-425 440 433 443
-403 352 444 442
-402 352 444 403
-402 444 441 403
-55 444 441 402
-55 56 444 402
-443 444 450 57
-450 441 444 443
-445 452 56 439
-444 445 439 57
-217 492 0 143
-349 446 348 355
-446 347 348 355
-448 392 393 351
-471 475 470 476
-347 448 393 351
-347 448 351 352
-448 392 351 352
-392 448 403 352
-403 448 402 352
-402 447 352 448
-448 447 352 347
-403 448 401 402
-448 403 401 392
-447 347 451 43
-451 347 446 43
-445 447 451 43
-455 453 0 454
-54 449 425 443
-54 441 449 443
-398 54 441 449
-406 441 449 398
+430 426 427 437
+431 430 418 437
+430 427 418 437
+444 439 57 445
+418 0 431 437
+513 501 477 539
+0 160 159 529
+24 516 517 605
+516 515 24 517
+510 515 516 517
+362 510 517 518
+435 433 57 443
+433 57 70 435
+428 433 434 435
+468 537 543 545
+147 0 144 490
+401 392 394 448
+431 0 432 437
+352 444 445 447
+552 461 64 554
+0 348 349 446
+447 0 56 452
+458 439 445 558
+0 347 348 446
+933 118 873 935
+553 70 69 557
+546 58 0 555
+495 480 62 500
+0 455 456 463
+394 393 0 448
+503 502 501 513
+0 56 439 450
+449 0 425 450
+449 443 441 450
+441 403 402 444
+449 441 55 450
+440 425 0 450
+440 0 439 450
+352 402 403 444
+396 403 407 441
+407 398 396 441
+403 396 5 441
+398 5 396 441
+54 5 398 441
+425 433 426 443
+54 425 426 443
+407 406 398 441
+55 406 407 441
+425 440 443 450
+443 440 57 450
+444 350 352 445
+402 403 401 448
+63 43 350 445
+435 434 360 559
+435 44 367 442
+435 350 44 442
+368 350 352 442
+350 43 352 445
+441 5 442 443
+441 54 5 443
+444 441 443 450
 55 56 0 450
-458 454 0 465
-483 480 60 486
-451 447 452 0
-452 447 56 0
-503 499 456 462
-463 464 0 466
-468 7 0 58
-533 67 547 545
-67 535 547 551
-67 546 545 459
-459 546 465 554
-66 547 542 58
-456 455 0 446
-453 467 0 465
-474 485 0 473
-559 435 434 433
-499 497 456 462
-69 70 557 553
-456 463 0 455
-462 499 62 61
-458 445 439 452
-457 445 458 452
-454 457 458 452
-358 461 498 63
-498 451 446 43
-355 498 43 358
-212 207 505 202
-464 479 0 471
-455 463 0 453
-538 530 531 482
-465 454 0 453
-523 156 525 157
-629 641 623 14
-445 63 43 457
-504 499 456 503
-18 142 148 525
-63 461 554 64
-457 445 451 43
-457 445 452 451
-454 457 452 451
-454 457 451 455
-44 510 350 511
-561 560 559 609
-525 142 154 155
-554 459 67 552
-67 556 553 555
-330 356 213 505
-562 573 565 560
-467 469 0 468
-59 7 0 468
-70 511 553 514
-456 462 0 463
-66 545 547 58
-216 143 0 494
-70 435 511 559
-479 472 471 475
-341 505 330 212
-359 510 44 362
-507 500 61 491
-545 67 547 58
-538 539 544 476
-465 453 467 460
-918 15 931 920
-478 462 62 61
-476 479 471 475
-462 464 0 463
-551 69 561 549
-70 511 514 559
-465 457 458 454
-460 457 465 454
-453 460 465 454
-467 453 477 460
-493 487 488 489
-64 534 535 515
-69 556 0 555
-61 62 478 480
-557 439 57 440
-499 356 508 504
-459 465 467 460
-584 639 78 592
-568 73 0 564
-216 494 0 495
-466 471 0 469
-532 536 540 539
-453 466 0 467
-546 468 545 459
-752 754 100 759
-466 469 0 467
-459 467 477 460
-156 157 491 521
-60 474 0 473
-469 470 0 59
-499 508 506 504
-472 473 0 475
-141 147 492 149
-464 471 466 476
-561 70 560 436
-464 471 0 466
-522 201 25 508
-66 7 545 58
-530 529 0 531
-472 475 0 470
-525 158 153 154
-349 504 446 355
-529 526 523 157
-486 493 0 488
-18 525 148 158
-479 472 0 471
-486 483 484 60
-495 211 216 142
-62 478 0 462
-473 472 479 475
-464 476 466 477
-501 513 503 502
-531 529 526 482
-18 483 484 486
-474 484 0 485
-537 477 539 513
-521 194 201 27
-544 539 537 476
-483 481 485 60
-534 552 602 520
-503 455 456 498
-144 487 0 492
-466 453 463 477
-467 453 466 477
-477 469 466 467
+55 0 449 450
+442 441 443 444
+355 353 349 504
+439 56 444 450
+452 451 0 454
+444 57 350 445
+56 439 444 445
+394 392 393 448
+66 65 542 547
+451 445 43 457
+563 0 564 568
+451 0 447 452
+393 392 351 448
+392 352 351 448
+347 351 352 448
+352 392 403 448
+447 0 347 448
+402 0 447 448
+447 352 402 448
+347 352 447 448
+402 352 403 448
+0 447 347 451
+446 347 43 451
+423 425 54 449
+443 54 425 449
+443 441 54 449
+67 546 554 556
+461 460 459 513
+453 454 455 460
+444 56 55 450
+489 487 0 490
+457 455 454 460
+476 466 464 477
+455 0 453 463
+454 0 453 455
+451 446 0 455
+469 0 59 470
+498 456 455 503
+349 0 446 456
+497 62 462 499
+445 439 57 558
+457 63 43 498
+43 446 451 498
+598 0 594 633
+556 69 0 557
 476 469 466 477
-67 556 554 553
-62 500 61 507
-477 453 463 460
-354 200 518 40
-487 490 0 489
-475 472 471 470
-530 481 482 538
-473 472 0 479
-479 60 0 473
-478 60 0 479
-500 523 61 491
-62 480 0 478
-480 60 0 478
-156 142 525 155
-493 489 18 148
-486 493 489 18
-490 489 487 493
-495 214 216 211
-20 212 505 202
-580 576 582 589
-147 490 0 144
-489 158 18 148
-507 491 508 20
-433 434 689 426
-61 478 483 480
-481 478 483 61
-157 163 156 525
-513 539 532 502
-539 501 476 481
-484 485 474 60
-483 481 61 482
-562 564 0 432
-483 478 60 480
-359 518 510 362
-499 507 61 491
+436 550 560 561
+452 0 439 458
+452 445 457 458
+457 454 452 458
+474 60 0 486
+477 459 460 513
+70 435 511 559
+503 501 477 513
+548 542 0 582
+641 14 0 642
+455 446 0 456
+553 551 67 555
+510 64 63 511
+465 0 458 556
+463 0 453 466
+530 485 481 538
+464 0 463 466
+62 495 500 507
+473 60 0 474
+468 0 59 469
+0 456 462 463
+476 475 470 544
+63 64 461 554
+445 63 43 457
+342 330 341 505
+200 40 198 518
+354 40 200 518
+557 70 57 558
+72 76 565 607
+556 0 458 557
+465 457 460 554
+212 202 207 505
+440 0 436 557
+0 470 471 472
+0 59 7 468
+563 562 550 573
+468 467 0 469
+462 61 62 478
+460 463 477 503
+496 495 62 507
+456 455 446 498
+545 58 468 546
+469 467 466 477
+470 0 59 544
+471 475 476 479
+200 331 354 509
+464 462 0 478
+462 0 463 464
+472 473 475 479
+515 64 514 535
+454 0 458 465
+0 454 453 465
+460 453 454 465
+454 457 460 465
+458 457 454 465
+436 69 70 557
+440 436 70 557
+435 433 434 559
+556 553 69 557
+609 606 608 615
+542 58 66 547
+476 481 538 539
+471 472 475 479
+216 0 214 495
+466 0 453 467
+453 0 465 467
+479 478 60 481
+465 460 453 467
+465 459 460 467
+141 0 217 492
+453 466 467 477
+470 469 0 471
+467 466 0 469
+491 500 61 523
+23 198 517 518
+511 57 70 558
+148 154 158 525
+539 537 536 540
+0 79 80 639
+519 25 512 520
+471 0 472 479
+453 463 466 477
+501 499 61 502
+446 355 349 504
+363 362 6 517
+467 459 460 477
+471 466 464 476
+471 469 466 476
+475 470 471 476
+574 578 579 586
+471 470 469 476
+481 475 476 538
+478 61 62 480
+523 18 483 524
+489 158 148 490
+475 481 485 538
+462 62 0 478
+478 62 0 480
+606 360 605 761
+463 453 460 477
+463 464 466 477
+60 478 0 480
+472 470 471 475
+473 0 472 475
+472 0 470 475
+487 0 488 489
+489 486 488 493
+545 66 58 547
+144 0 487 490
+0 464 478 479
+545 67 58 546
+493 486 0 494
+217 143 149 492
+204 27 194 521
+644 622 571 646
+60 483 484 485
+519 512 23 534
+60 481 483 485
+537 536 513 539
+0 473 474 485
+158 0 146 490
+0 484 474 488
+474 473 60 485
+494 216 142 495
+20 212 213 505
+216 211 142 495
+211 156 142 500
+159 157 526 529
+500 18 483 523
+478 462 61 501
+500 491 61 507
+18 480 483 486
+7 468 543 545
+0 60 480 486
+154 142 155 525
+489 0 158 490
+477 476 469 537
+540 528 0 541
+0 648 649 652
 481 478 60 483
-483 480 486 18
-60 480 0 486
-481 479 60 478
-481 464 479 478
+536 513 459 537
+479 60 473 485
+474 60 484 485
+482 526 529 531
+475 473 0 485
+588 577 584 610
+489 484 18 524
+480 478 61 483
+491 482 61 502
+501 61 482 502
 476 464 479 481
-540 528 0 541
-459 477 467 537
-629 630 640 641
-147 146 0 490
-486 488 0 474
-493 494 148 18
-204 194 521 27
-496 344 505 356
-537 477 467 469
-486 484 474 60
+479 464 478 481
+481 61 478 483
+480 60 478 483
+552 459 461 554
+58 66 7 542
+67 64 553 554
+493 18 486 494
+435 57 70 511
+59 469 470 544
+539 536 532 540
+538 476 539 544
+482 501 502 539
+527 532 528 596
+475 0 470 544
+481 61 482 501
+459 461 513 552
+62 61 499 507
+484 486 488 489
+484 18 486 489
+446 349 456 504
+493 148 18 494
+216 143 0 494
+158 148 18 489
+157 163 156 525
+492 0 143 493
+460 455 463 503
+501 463 462 503
+910 617 909 913
+200 213 331 509
+536 528 532 540
+201 508 25 522
+349 356 497 504
+160 0 524 529
+482 529 530 531
+627 787 794 910
+483 18 484 524
+66 58 7 545
+641 0 630 643
+499 462 456 503
+516 44 510 517
+356 213 330 505
+501 477 463 503
+463 456 462 503
+0 144 487 492
+463 462 464 501
+67 459 552 554
+446 456 498 504
+214 211 216 495
+143 148 492 493
+480 0 486 494
+493 0 143 494
+493 143 148 494
+142 148 143 494
+494 480 0 495
+480 62 0 495
+0 216 494 495
 331 353 354 509
-163 155 525 154
-158 160 0 524
-524 489 0 158
-529 530 524 523
-486 489 484 18
-143 494 148 493
-503 506 499 502
-488 487 0 489
-488 489 0 484
-486 488 484 489
-465 554 458 457
-147 149 146 490
-64 461 552 512
-524 484 483 530
-530 524 0 529
-464 463 501 477
-476 464 481 501
+517 198 362 518
+330 213 212 505
+496 62 0 497
+496 0 344 497
+349 344 0 497
+344 356 496 497
+356 344 349 497
+356 349 353 504
+495 211 142 500
+494 18 480 500
+480 18 483 500
+509 200 25 518
+142 18 494 500
+61 480 483 500
+202 20 211 505
+506 502 503 513
+356 213 20 508
+507 491 499 508
+25 200 196 518
+511 510 64 515
+433 436 438 560
+451 455 457 498
+43 451 457 498
+63 457 461 498
+355 43 358 498
+461 358 63 498
+462 456 497 499
+330 342 344 505
+214 342 207 505
+61 462 62 499
+538 482 531 539
+142 494 495 500
+481 476 464 501
+464 476 477 501
 481 464 478 501
-502 508 499 491
-354 518 362 40
-500 142 156 211
-500 483 61 523
-539 502 513 501
-485 484 0 530
-491 507 156 20
-476 464 501 477
-495 211 500 507
-463 455 456 503
-462 463 456 503
-501 463 462 503
-217 141 0 492
-493 487 0 488
-487 493 0 492
-492 490 487 493
-497 349 456 0
-330 505 213 212
-486 480 0 494
-966 965 963 597
-584 592 78 74
-505 214 496 211
-562 560 565 689
-446 504 498 355
-491 500 156 507
-498 504 506 358
-510 63 350 511
-0 787 909 906
-20 505 211 202
-505 207 211 202
-356 497 344 349
-356 496 344 497
-204 27 521 20
-214 207 211 505
-456 455 446 498
-455 451 446 498
-455 457 451 498
-455 457 498 460
-457 461 498 460
-511 558 553 64
-349 356 504 353
-527 963 965 597
-521 27 201 20
-551 69 553 561
-157 161 526 521
-500 142 494 18
-500 480 483 18
-500 494 495 480
-500 495 62 480
-500 494 480 18
-61 500 62 480
-459 477 537 513
-62 507 61 499
-482 502 61 491
-502 499 61 491
-499 62 497 462
-494 142 500 495
-495 142 500 211
-464 501 462 478
-464 463 462 501
-64 461 554 552
+61 481 478 501
+478 464 462 501
+504 355 353 509
+500 495 211 507
+356 353 213 509
+496 356 505 507
+211 495 496 507
+491 61 499 502
+559 606 608 609
+502 501 499 503
+511 435 44 516
+508 506 504 509
+498 460 461 503
+499 456 497 504
+456 499 503 504
+503 498 456 504
+499 497 356 504
+211 20 156 507
 500 211 156 507
-498 504 456 503
-507 356 499 497
-501 502 499 61
-482 502 501 61
-555 556 553 69
-560 70 559 433
-160 529 523 157
-477 463 503 460
-463 455 503 460
-503 455 498 460
-477 463 501 503
-688 689 76 430
-446 456 498 504
-349 456 446 504
-349 456 504 497
-504 497 456 499
-497 356 499 504
-349 497 504 356
-341 207 505 212
-342 207 505 341
-342 505 330 341
-342 344 330 505
-342 344 505 496
-342 496 505 214
-214 207 505 342
-509 358 25 506
-504 499 503 506
-498 504 503 506
-498 503 461 506
-356 507 496 497
-507 62 496 497
-495 62 496 507
-507 496 495 211
-507 505 496 211
-356 505 496 507
-213 200 509 331
-633 81 0 594
-526 529 159 157
-518 23 512 510
-502 506 499 508
-213 356 508 20
-512 23 25 519
-197 519 25 196
-331 353 509 213
-508 213 201 509
-25 508 201 509
-513 461 460 503
-477 513 460 503
-538 531 0 540
-196 518 200 198
-537 468 59 469
-438 436 0 562
-527 528 596 532
-515 514 511 516
-512 506 520 25
-350 510 44 359
-350 63 510 359
-510 63 512 358
-512 63 461 358
-512 358 461 506
-78 632 631 640
-590 591 594 9
-44 6 517 516
-67 546 556 555
-517 362 363 6
-521 194 197 201
-198 362 363 517
-64 63 461 512
+356 344 496 505
+356 330 344 505
+496 214 211 505
+358 63 359 510
+214 207 211 505
+507 356 20 508
+213 356 20 505
+155 156 163 525
+477 460 503 513
+476 470 469 544
+353 331 213 509
+211 496 505 507
+505 20 211 507
+505 356 20 507
+497 496 62 507
+497 356 496 507
+499 497 62 507
+497 499 356 507
+359 63 350 510
+506 504 499 508
+356 499 504 508
+507 20 491 508
+507 499 356 508
+355 354 353 509
+504 358 355 509
+355 358 354 509
+508 356 213 509
+504 356 508 509
+44 362 359 510
+922 24 616 968
+204 20 27 521
+546 0 465 556
+508 201 20 521
+0 546 555 556
 503 461 506 513
-527 161 965 963
-156 157 521 204
-561 560 550 436
-459 461 460 513
-459 513 460 477
-532 513 536 539
-695 687 764 771
-436 550 0 562
-44 517 510 516
-198 517 518 362
-560 559 607 434
-72 622 71 566
-550 560 562 436
-599 921 115 616
-510 518 517 362
-620 617 619 116
-25 23 512 518
-44 6 516 360
-435 44 516 360
-542 582 0 548
-709 87 88 700
-574 568 570 571
-596 528 531 532
-782 768 780 781
-359 518 362 354
-359 358 518 354
-518 354 358 509
-518 354 509 200
-359 358 510 518
-23 518 517 510
-23 518 198 517
-23 518 196 198
-23 25 196 518
-160 159 0 529
-529 160 159 157
-591 595 594 598
-481 482 483 530
-64 554 67 552
+528 531 532 540
+513 477 459 537
+539 532 531 540
+538 481 482 539
+508 20 491 521
+73 667 685 690
+612 74 77 615
+506 461 358 512
+485 481 483 530
+25 506 358 512
+510 358 63 512
+358 461 63 512
+64 510 63 512
+64 63 461 512
+523 160 524 529
+160 157 523 525
+160 158 153 525
+491 156 157 521
 520 506 502 522
+204 157 156 521
+555 69 0 556
+508 491 502 522
+438 0 432 562
+618 115 74 632
+584 78 74 592
+509 358 354 518
+565 72 607 612
+517 516 6 605
+78 584 80 639
+354 359 362 518
+44 510 511 516
+661 660 659 664
+70 436 433 560
+435 360 44 516
+565 563 570 573
+586 574 578 588
+157 160 163 525
+513 461 506 520
+364 759 760 766
+587 577 68 610
+354 358 359 518
+359 358 510 518
+510 362 359 518
+509 25 358 518
+358 25 512 518
+512 510 358 518
+512 25 23 518
+510 512 23 518
+517 510 23 518
+155 163 154 525
+482 491 61 523
+482 61 483 523
+532 527 528 602
+543 537 59 544
+157 523 526 529
+459 467 468 537
+194 27 201 521
+966 598 601 967
+526 523 482 529
+601 963 966 967
+197 161 194 521
 502 506 508 522
-481 530 483 485
-156 204 521 20
-482 481 539 538
-602 519 601 534
-491 156 523 157
-18 483 500 523
-59 470 0 544
-585 647 0 80
-523 530 483 482
-67 553 535 551
-482 532 502 526
-607 565 76 72
-570 565 573 612
-529 482 530 523
-588 575 574 578
-615 607 612 609
-537 477 476 539
-544 470 0 475
-163 525 153 154
-18 524 483 523
-18 484 483 524
-18 489 484 524
-18 158 489 524
-160 525 153 163
-157 525 160 163
-160 524 525 523
-18 525 524 523
-523 500 18 525
+561 550 560 573
+0 595 597 598
+565 560 562 573
+64 515 534 535
+986 973 125 989
+590 535 533 591
+589 587 572 590
+909 906 787 910
+189 253 0 933
+530 529 0 531
+159 160 157 529
+156 491 157 523
+512 519 520 534
+537 513 477 539
+907 630 617 909
+501 481 476 539
+123 0 598 633
+154 153 158 525
+148 18 142 525
 500 142 18 525
-500 142 525 156
-523 500 525 156
-577 576 580 589
-485 530 483 484
-532 539 531 482
-538 481 539 476
-513 532 520 502
-476 469 537 544
-523 524 483 530
-564 570 71 565
-12 606 607 615
-160 529 0 524
-9 81 592 599
-539 477 476 501
-583 595 0 594
-591 595 583 594
-652 648 0 649
-520 519 534 512
-534 23 512 519
-515 23 512 534
-577 586 578 588
-533 595 541 583
-595 541 0 528
-588 571 586 574
-460 554 465 457
-553 511 64 514
-520 532 527 522
-482 501 539 481
-545 468 537 459
-545 7 468 58
-69 70 561 436
-558 554 553 64
-540 544 0 538
-538 544 539 540
-527 602 532 520
-535 591 590 603
-19 23 534 519
-481 538 485 475
-611 592 115 599
-544 469 59 470
+500 156 142 525
+523 500 18 525
+523 156 500 525
+148 158 18 525
+157 156 523 525
+460 457 461 554
+513 502 501 539
+538 0 475 544
+670 83 673 683
+573 609 610 612
+585 577 584 586
+482 481 501 539
+551 69 549 555
+483 523 524 530
+484 483 524 530
+483 482 523 530
+553 67 554 556
+7 58 468 545
+476 537 539 544
+540 539 537 544
+611 115 74 615
+594 583 0 595
+194 204 521 964
+485 483 484 530
+531 0 538 540
+527 522 520 532
+59 468 469 537
+532 531 482 539
+482 502 526 532
+483 481 482 530
+524 0 484 530
+485 484 0 530
+477 467 459 537
+529 0 524 530
+529 523 482 530
+524 523 529 530
+537 476 469 544
+958 0 165 959
+0 530 531 538
+531 482 526 532
+540 536 528 541
+562 0 432 564
+587 68 572 610
+816 810 815 821
+531 538 539 540
+459 536 537 545
+564 0 73 568
+0 58 7 542
+501 476 477 539
+545 468 459 546
+532 502 513 539
+0 440 439 557
+467 465 459 546
+514 515 535 603
+595 591 533 602
+548 0 58 555
 531 528 0 540
-579 569 0 574
-586 646 584 638
-601 519 19 534
-540 537 539 536
-459 468 467 546
-546 467 0 468
-556 554 458 465
-537 467 468 469
-459 467 468 537
-476 469 544 470
-539 537 513 536
-539 482 532 502
-0 14 625 624
-531 538 0 530
-485 530 0 538
-537 469 59 544
-544 543 59 537
-544 537 539 540
-539 538 531 482
-458 439 558 557
-64 553 514 535
-870 257 252 256
-588 573 612 570
-520 513 536 532
-540 543 0 544
-67 555 553 551
-511 558 70 553
-553 514 535 551
-458 556 557 558
+536 532 513 539
+459 545 67 552
+532 482 502 539
+67 553 555 556
+532 513 520 536
+551 547 67 555
+546 67 58 555
+439 458 557 558
 58 67 547 555
-350 558 57 511
-481 530 485 538
-545 537 536 459
-532 540 531 539
-532 540 528 531
-533 66 541 545
-589 580 577 587
-660 665 666 670
-662 623 667 566
-542 66 0 65
-436 433 560 438
-432 564 0 691
-7 66 542 58
-7 542 0 58
-7 66 0 542
-7 59 0 543
-67 545 546 58
-577 586 584 585
+553 69 555 556
+58 547 548 555
+551 549 548 555
+781 773 619 794
+364 365 366 763
+469 59 537 544
+520 513 461 552
+530 481 482 538
+530 482 531 538
 543 59 0 544
-545 543 541 536
-533 545 541 536
-545 536 537 543
-537 543 468 545
-543 7 468 545
-66 7 543 545
-562 550 563 573
-548 576 0 549
-513 459 552 536
+0 475 485 538
+0 485 530 538
+610 587 592 611
+543 0 540 544
+660 658 657 664
+547 542 58 548
+0 436 69 550
+547 66 65 583
+576 0 578 581
+837 13 809 839
+32 306 813 814
+642 0 637 650
+598 594 591 600
+66 0 541 543
+540 537 536 543
+541 540 536 543
+543 540 537 544
+578 575 577 588
+541 66 543 545
+541 533 66 545
+536 541 543 545
+536 533 541 545
+555 546 67 556
+350 63 445 558
+545 67 533 547
 67 535 533 547
-557 70 558 553
-66 547 65 542
-9 603 611 572
-578 579 0 574
-547 548 65 542
-547 548 542 58
-58 542 0 548
+560 550 562 573
+526 531 532 596
+545 533 66 547
+605 613 604 761
+542 0 58 548
+69 436 70 561
+693 686 690 695
+430 429 426 689
+0 575 576 578
+564 0 432 691
+461 512 520 552
+461 64 512 552
+68 550 561 573
+686 566 71 690
+565 562 563 573
+550 549 68 561
+520 512 534 552
+554 458 457 558
+57 439 557 558
+458 445 457 558
+772 10 776 779
+549 68 551 589
+465 458 457 554
+571 644 82 662
+0 562 563 564
+789 788 114 793
+514 551 553 561
+513 536 459 552
+545 459 536 552
+67 545 533 552
+545 536 533 552
+757 756 754 767
+572 9 587 611
+535 533 534 552
+536 513 520 552
 535 67 533 552
-572 603 590 9
-64 552 534 512
-552 461 513 520
-552 461 520 512
-533 552 67 545
-68 572 589 587
-911 800 789 793
-556 546 0 555
-67 545 552 459
-552 545 536 459
-552 520 534 512
-561 560 573 550
-561 69 550 549
-436 69 0 550
-550 69 0 549
-552 513 536 520
-553 70 514 561
-562 563 564 565
-563 564 0 562
-552 461 459 513
-555 546 0 58
-58 548 0 555
-64 67 535 552
-64 535 534 552
-534 535 533 552
-615 606 609 608
-533 536 552 545
-555 551 548 549
-555 551 547 548
-58 555 547 548
-555 67 547 551
-67 546 554 556
-555 69 551 549
-555 549 0 69
-64 67 553 535
-555 548 0 549
-558 63 554 64
-557 69 0 436
-558 439 57 557
-350 63 558 511
-511 63 558 64
-918 799 872 798
-434 360 763 428
-554 67 553 64
-557 458 0 556
-67 546 459 554
-63 457 554 461
-461 457 554 460
-620 72 686 566
-556 557 558 553
-439 557 0 440
-439 458 0 557
-556 558 554 553
-458 556 558 554
-457 458 558 554
-63 457 558 554
-457 558 445 63
-63 350 558 445
-558 350 57 445
-439 57 445 558
-439 558 445 458
-458 558 445 457
-0 936 892 895
-0 660 670 658
-68 561 573 550
-551 553 514 561
-560 559 434 433
-123 633 0 598
-436 560 562 438
-438 562 0 432
-602 536 532 520
-576 68 575 549
-577 587 610 68
-514 603 608 515
-659 660 657 664
-645 648 579 652
-551 549 68 589
-68 573 575 550
-566 690 686 687
-581 578 0 576
-568 574 570 563
-645 648 652 649
-610 577 584 587
-12 615 612 77
-575 68 550 549
-762 765 12 75
-788 769 806 790
-515 24 608 516
-620 72 75 686
-861 842 862 865
-562 573 563 565
-578 574 0 575
-584 592 610 587
-576 578 0 575
-576 575 0 549
+511 350 57 558
+69 0 549 555
+551 548 547 555
+771 755 96 781
+52 419 51 697
+686 687 690 695
+550 436 69 561
+554 546 465 556
+551 535 514 553
+551 67 535 553
+535 64 514 553
+64 535 67 553
+514 511 70 553
+64 511 514 553
+70 514 553 561
+546 459 67 554
+546 465 459 554
+899 901 902 915
+559 514 70 561
+459 465 460 554
+460 461 459 554
+457 63 461 554
+554 465 458 556
+76 72 12 607
+70 57 440 557
+458 554 556 558
+557 556 553 558
+554 553 556 558
+554 457 63 558
+554 63 64 558
+511 64 63 558
+554 64 553 558
+553 64 511 558
+553 511 70 558
+557 553 70 558
+550 69 549 561
+516 511 435 559
+516 514 511 559
+560 559 70 561
+630 629 628 641
+10 677 86 776
+611 610 609 615
+437 432 430 689
+438 437 426 689
+85 95 97 750
+685 692 696 698
+559 433 434 560
+640 77 622 646
+645 638 586 648
+589 572 551 590
+550 436 560 562
+559 70 433 560
+576 575 577 578
+571 568 569 574
+77 612 622 646
+697 52 419 704
+638 8 637 643
 568 563 0 574
-72 76 607 12
-687 669 667 678
-683 684 0 665
-575 573 563 550
-72 71 686 566
-0 625 668 624
-620 72 566 622
-683 684 665 83
-547 535 533 590
-629 644 622 623
-678 666 567 684
-666 665 684 83
-678 666 684 83
-575 563 0 550
-589 547 65 590
-0 907 630 631
-567 661 663 664
-949 942 941 951
-115 616 921 614
-125 914 992 976
-613 604 800 911
-568 571 662 570
-0 668 10 677
-582 581 0 576
-578 586 579 574
-527 596 526 532
-612 615 609 610
-582 576 0 548
-569 655 0 663
-579 571 569 574
-12 607 612 615
-90 682 84 674
-564 563 570 565
-640 78 646 638
-589 68 576 549
-568 563 570 564
-568 570 71 564
-762 758 765 75
-12 612 72 77
-613 800 919 911
-650 637 645 649
-590 547 65 583
-585 577 586 578
+674 675 0 722
+74 584 592 610
+621 623 566 669
+77 72 12 620
+571 570 568 574
+581 580 576 582
+586 578 579 653
+645 586 579 648
+564 562 563 565
+432 562 564 565
+687 566 686 690
+437 430 426 689
+566 620 96 686
+620 75 96 686
+566 72 620 686
+620 72 75 686
+72 566 620 622
+672 671 673 683
+676 674 673 679
+805 803 812 814
+617 116 77 618
+86 680 95 720
+0 672 84 682
+756 75 96 773
+565 71 72 570
+586 578 577 588
+533 535 534 591
+549 550 68 575
+655 569 82 663
+636 79 0 639
+755 773 781 794
+599 592 9 611
+73 0 567 663
+591 19 600 603
+527 526 532 596
+590 583 593 594
+589 551 547 590
+528 531 0 596
+924 920 918 931
+533 583 590 591
+0 65 580 582
+657 0 655 664
+588 571 570 646
+588 586 571 646
+159 0 529 596
+565 564 71 570
+563 564 565 570
+568 71 564 570
+564 563 568 570
+574 563 0 575
+631 122 632 635
+594 591 583 595
+591 19 534 601
+586 638 571 646
+921 115 614 923
+587 9 81 592
+583 533 541 595
+535 551 514 572
+551 68 561 572
+561 514 551 572
+82 650 654 655
+80 585 586 648
+579 569 571 645
 569 568 0 574
-587 572 610 68
-654 652 0 651
-577 576 578 581
-68 572 561 551
-572 514 561 551
-551 514 535 572
-612 565 607 72
-606 559 360 434
-916 922 923 921
-646 644 622 640
-551 590 547 589
-587 572 589 590
-615 612 74 610
-68 576 577 589
-921 614 922 923
-593 81 587 9
-588 574 570 571
-547 551 589 548
-645 586 648 638
-551 535 547 590
-581 577 585 578
-551 549 589 548
-586 571 579 574
-65 580 0 582
-660 658 665 670
-577 575 578 576
-622 646 612 570
-68 587 589 577
-653 586 579 578
-646 78 584 638
-596 531 526 532
-656 650 655 654
-639 635 78 592
-644 646 571 638
-577 588 584 586
-592 9 611 587
-634 635 639 592
-646 588 610 612
-577 576 581 580
-535 591 533 590
-587 81 592 9
-533 66 583 541
-583 66 0 541
-65 66 0 583
-157 964 521 204
-547 66 65 583
-551 572 590 589
-587 9 611 572
-594 81 593 9
-547 66 583 533
-74 632 78 640
-588 586 578 574
-577 575 588 578
-12 116 77 620
-653 579 648 652
-585 80 0 648
-601 595 602 591
-580 585 0 581
-580 577 585 581
-830 831 98 785
-593 594 0 81
-583 594 0 593
-579 648 645 586
-533 541 602 536
-533 591 583 590
-650 82 655 654
-533 591 595 583
-592 611 74 610
-601 597 602 595
-673 682 674 672
-843 786 885 839
-702 764 771 695
-9 592 611 599
-68 575 588 577
-68 573 588 575
-575 573 588 563
-588 573 570 563
-574 588 570 563
-574 575 588 563
-547 589 65 548
-548 582 589 65
-580 589 582 65
-604 116 12 765
-531 596 0 528
-638 78 643 640
-608 614 611 615
-611 115 74 615
-551 535 590 572
-990 939 991 914
-590 547 583 533
-514 535 572 603
-535 534 533 591
-648 586 80 638
-653 585 648 586
-65 593 0 580
-65 580 589 593
-593 580 589 587
-587 589 593 590
-593 589 65 590
-593 590 65 583
-65 583 0 593
-583 541 0 595
-927 960 929 963
-593 590 583 594
-590 591 583 594
-0 893 935 936
-534 19 601 591
-602 597 528 595
-527 526 596 161
-596 526 159 161
-596 529 159 526
-596 531 529 526
+68 549 575 576
+995 994 0 1000
+12 607 612 615
+586 571 574 588
+574 571 570 588
+535 547 551 590
 531 529 0 596
-529 159 0 596
-535 534 591 603
-603 591 590 9
+0 65 66 583
+575 68 576 577
+580 576 577 581
+549 548 576 589
+585 578 577 586
+612 610 74 615
+761 360 361 763
+662 71 566 667
+542 65 0 582
+548 65 542 582
+657 655 656 659
+648 585 586 653
+593 9 590 594
+569 571 574 579
+578 0 574 579
+0 569 574 579
+576 548 0 582
+572 535 551 590
+9 572 587 590
+0 580 581 582
+547 533 66 583
+583 547 533 590
+618 614 115 923
+644 623 82 662
+531 528 532 596
+584 577 587 610
+608 606 614 615
+577 575 68 588
+597 598 601 966
+591 583 590 594
+591 590 9 594
+575 573 68 588
+585 577 580 647
+527 161 526 596
+578 574 575 588
+575 563 573 588
+585 584 80 586
+567 73 663 667
+577 580 581 585
+578 577 581 585
+686 693 694 695
+597 528 527 602
+580 0 581 585
+189 181 190 934
+582 576 548 589
+572 551 68 589
+582 580 576 589
+577 68 576 589
+582 548 65 589
+577 587 68 589
+65 0 580 593
+609 607 606 615
+548 547 65 589
+649 648 645 652
+575 574 563 588
+574 570 563 588
+577 585 584 647
+586 577 584 588
+635 634 592 639
+607 12 606 615
+12 116 77 620
+123 598 600 633
+599 115 592 611
+582 65 580 589
+576 580 577 589
+81 9 593 594
+587 577 580 589
+68 587 572 589
+589 547 65 590
+65 547 583 590
+601 595 597 602
+632 115 74 635
+644 82 637 645
+970 928 120 997
+541 528 0 595
+591 533 583 595
+80 0 585 648
+80 8 0 648
+9 587 81 593
+541 0 583 595
+587 9 590 593
+583 65 590 593
+590 589 587 593
+65 589 590 593
+589 65 580 593
+580 587 589 593
+951 120 952 972
+593 583 0 594
+531 526 529 596
+593 0 81 594
+595 594 591 598
+0 594 595 598
+526 161 159 596
+988 0 898 994
+939 928 914 970
+612 77 12 615
+965 0 597 966
+520 527 532 602
+9 591 594 600
+601 597 527 602
+528 527 596 597
+534 519 520 602
+0 528 596 597
 595 528 0 597
-597 528 0 596
-966 121 0 123
-598 966 601 597
-943 117 873 935
-959 946 964 958
-166 946 958 964
-527 596 528 597
-602 552 533 536
-602 541 528 536
-909 628 619 627
-895 893 940 894
-602 533 534 591
-360 761 762 763
-611 115 615 614
-632 908 907 913
-794 627 787 910
-592 635 78 74
-592 115 635 74
-123 600 598 967
-591 594 600 598
-0 643 637 8
-644 638 571 645
-591 594 9 600
-639 636 0 79
-533 602 595 591
-602 552 536 520
-917 919 938 797
-974 999 0 986
-930 196 203 199
-944 961 932 945
-932 942 934 181
-0 981 989 993
-965 966 0 597
-959 965 0 159
+946 120 951 972
+974 0 121 986
+788 884 883 904
+19 519 534 601
+592 9 81 599
+115 592 74 635
+928 120 960 970
+967 123 600 978
+514 535 572 603
+117 15 940 943
+918 900 117 940
+610 612 74 646
+635 592 78 639
+872 323 931 937
+610 588 573 612
+997 995 954 998
+0 973 986 989
+101 0 740 746
+771 96 687 774
+420 4 366 757
+612 609 610 615
+570 573 588 612
+607 573 565 612
+165 159 157 964
+165 157 163 964
+323 363 799 931
+515 24 19 603
+600 9 591 603
 591 595 598 601
-601 595 598 597
-591 601 598 600
-602 528 541 595
-533 602 541 595
-527 597 528 602
-527 528 532 602
-994 898 988 991
-68 609 572 610
-514 535 603 515
-535 534 603 515
-603 534 19 515
-24 19 515 603
-606 360 761 762
-788 806 769 793
-702 764 92 771
-757 759 752 4
-516 24 608 605
-514 572 608 603
-434 763 429 428
-19 968 926 927
-603 600 616 19
-678 684 680 83
-0 641 642 637
-605 608 606 614
-684 567 0 665
-434 762 76 429
-755 792 769 794
-669 621 625 774
-651 650 656 654
-609 607 559 606
-609 560 559 607
-608 609 559 606
-919 915 917 938
-603 608 611 572
-609 560 607 573
-561 560 609 573
-603 24 608 515
-611 615 74 610
-577 610 588 68
-68 573 610 588
-923 913 618 911
+598 595 597 601
+19 591 534 603
+515 19 534 603
+204 195 166 964
+591 598 600 601
+534 520 552 602
+520 536 552 602
+534 591 601 602
+534 533 591 602
+535 515 534 603
+590 591 9 603
+590 9 572 603
+591 590 535 603
+590 572 535 603
+591 535 534 603
+600 123 633 978
+633 123 0 979
+616 599 115 921
+572 514 603 608
+794 773 619 910
+516 360 605 606
+561 68 573 609
+570 565 573 612
+572 68 561 609
+608 572 514 609
+572 587 610 611
+921 614 922 923
+785 782 783 792
+572 561 514 609
+763 762 758 766
+325 323 872 937
+360 6 516 605
+763 364 361 766
+754 100 752 759
+374 428 429 763
+619 96 620 773
+116 619 620 773
+592 74 610 611
+592 115 74 611
+614 115 611 615
+605 516 606 608
+605 24 516 608
+515 516 24 608
+515 514 516 608
+606 516 559 608
 559 516 514 608
-516 514 608 515
-788 910 787 114
-80 639 78 584
-610 573 609 612
-570 565 612 72
-68 561 609 573
-572 609 514 608
-587 611 610 572
-592 611 610 587
-921 976 975 983
-638 643 637 644
-584 592 74 610
-82 659 642 650
-914 992 976 113
-622 644 571 662
-922 926 920 925
-816 813 38 307
-616 614 608 24
-68 573 609 610
-615 608 609 611
-581 653 0 578
-883 789 114 917
-599 81 633 9
-780 772 779 10
-611 115 592 74
-0 985 124 984
-906 905 114 912
-615 618 77 12
-95 764 772 92
-704 757 756 94
-623 642 641 644
-606 615 12 604
-606 614 615 604
-107 851 849 850
-92 770 99 768
-908 913 618 923
-908 913 923 912
-923 613 916 919
-614 604 613 923
-960 120 929 962
-606 608 615 614
-957 166 179 947
-124 984 983 993
-906 114 787 910
-916 924 938 919
-9 600 616 603
-9 616 611 603
-603 611 608 616
-616 611 608 614
-611 616 115 614
-611 599 115 616
+603 515 24 608
+120 946 951 961
+784 779 770 826
+603 514 515 608
+607 559 560 609
+561 560 559 609
+561 559 514 609
+752 377 815 821
+514 559 608 609
+607 72 12 612
+609 573 607 612
+977 121 973 986
+609 572 68 610
+609 68 573 610
+588 573 68 610
+763 758 366 766
+374 366 365 763
+120 929 928 960
+875 870 873 935
+610 609 572 611
+609 608 572 611
+611 74 610 615
+819 810 816 821
+603 572 608 611
+72 77 12 612
+0 971 972 974
+980 122 635 982
+916 921 922 923
+894 939 940 991
+621 619 620 629
+686 75 96 756
+611 609 608 615
+12 604 606 615
+203 194 197 929
+611 608 614 615
+606 604 614 615
+922 613 605 925
+604 116 765 911
+12 607 606 762
+46 4 420 757
+30 799 803 804
+608 611 614 616
+608 603 611 616
+603 19 600 616
+611 603 9 616
+603 600 9 616
+616 115 614 921
+942 944 951 961
+916 613 919 923
+918 799 798 924
 9 599 611 616
-9 599 616 600
-77 617 620 116
-613 924 916 919
-916 983 976 921
-930 196 929 203
-614 115 615 618
-615 115 74 618
-615 618 74 77
-604 618 614 615
-620 72 622 77
-72 77 612 622
-639 635 634 636
-12 72 620 77
-12 72 75 620
-12 116 620 75
-82 655 659 650
-0 122 907 631
-0 787 627 909
-566 96 620 621
-617 628 630 629
-580 647 0 585
-647 577 584 585
-81 639 0 647
-593 81 647 587
-72 612 570 622
-72 570 71 622
-664 658 0 665
-662 644 571 82
-593 81 0 647
-71 622 662 566
-628 626 619 627
-619 620 629 617
-620 77 629 617
-0 626 14 628
-640 632 631 630
-629 628 641 14
-570 571 662 622
-639 79 0 80
-634 636 0 639
-756 686 96 75
-782 784 780 768
-641 644 642 637
-669 621 14 625
-671 672 0 683
-666 665 567 684
-74 78 646 640
-0 626 625 14
-621 626 14 625
-669 774 625 775
-781 774 771 768
-668 669 625 775
-631 635 636 122
-78 635 636 631
-626 621 14 628
-621 623 14 629
-598 633 594 600
-107 861 857 850
-646 584 74 610
-619 621 626 628
-619 629 628 617
-619 621 628 629
-619 620 621 629
-566 629 621 620
-566 622 629 620
-622 77 629 620
-569 82 663 662
-665 658 671 670
-622 623 566 629
-629 623 566 621
-874 117 918 900
-642 644 82 637
-0 981 124 980
-617 630 640 629
-651 652 0 649
-629 640 644 641
-644 643 641 640
-632 618 617 77
-74 618 632 77
-74 115 632 618
-0 907 909 630
-951 961 944 120
-617 116 913 910
-914 920 976 969
-617 909 630 628
-974 120 970 960
-773 619 910 116
-973 975 981 979
-944 943 996 939
-987 989 125 988
-638 79 8 643
-633 978 123 979
-0 636 631 79
-636 79 78 631
-917 915 905 902
-629 628 630 641
-788 910 114 793
-81 633 634 599
-908 985 907 913
-983 982 921 908
-81 633 0 634
-635 115 632 74
-644 645 571 82
-0 122 631 636
-0 628 641 630
-0 14 624 642
-623 642 624 14
-648 80 0 8
-81 634 0 639
-77 640 622 629
-81 634 639 592
-0 624 659 642
-638 637 8 645
-623 661 669 624
-0 631 630 643
-584 78 80 638
-80 79 638 78
-80 79 8 638
+599 9 600 616
+687 764 771 774
+599 9 81 633
+905 902 903 917
+798 900 918 938
+594 81 9 633
+905 903 904 917
+323 199 198 931
+604 765 800 911
+773 765 116 793
+612 72 77 622
+620 77 72 622
+570 71 72 622
+610 74 584 646
+570 72 612 622
+729 727 91 736
+116 773 793 910
+644 637 638 645
+622 644 571 662
+620 566 96 621
+566 72 71 622
+82 569 662 663
+661 655 82 663
+679 674 673 682
+81 587 592 647
+587 584 592 647
+593 587 81 647
+585 580 0 647
+577 584 587 647
+0 593 81 647
+593 0 580 647
+607 434 76 689
+577 587 580 647
+593 580 587 647
 586 584 80 638
-586 571 646 638
-647 639 0 80
-78 631 643 640
-640 631 643 630
+655 654 0 656
+661 624 666 669
+77 622 629 640
+665 660 658 670
+0 665 671 683
+683 665 83 684
+683 0 665 684
+770 92 97 772
+625 668 669 775
+624 14 0 625
+668 625 10 775
+774 10 625 775
+639 81 592 647
+644 571 82 645
+630 640 641 643
+973 975 125 989
+626 619 621 628
+628 619 621 629
+625 14 0 626
+6 605 761 801
+941 932 118 944
+968 922 920 976
+14 628 629 641
+626 14 0 628
+620 619 617 629
+620 617 77 629
+622 620 77 629
+623 566 622 629
+623 621 566 629
+638 79 8 643
 78 79 638 643
-0 643 630 641
-586 571 638 645
-623 641 642 14
-622 623 662 566
-645 637 8 649
-80 647 639 584
-664 657 0 658
-653 579 0 578
-655 659 650 656
-647 584 577 587
-74 632 640 77
-632 617 640 77
+594 9 600 633
+622 566 620 629
+621 620 566 629
+641 629 623 644
+77 617 618 632
+971 960 120 974
+568 0 73 663
+622 623 629 644
+628 14 0 641
+640 631 78 643
+627 619 628 909
+793 116 910 911
+617 628 619 909
+0 870 876 935
+630 631 0 907
+631 0 122 636
+907 906 0 909
+635 78 631 636
+571 569 82 645
+631 78 79 636
+631 79 0 636
+630 617 632 907
+992 975 983 993
+924 919 795 938
+568 569 0 663
+906 787 0 909
+637 8 0 643
+628 0 630 641
+971 120 972 974
+0 628 630 909
+633 0 81 634
+979 975 973 981
+635 631 122 636
+122 635 636 980
+971 0 121 974
+992 984 897 993
+990 988 125 991
+0 637 641 642
+637 82 642 650
+634 81 592 639
+78 631 79 643
+612 610 588 646
+8 79 0 643
+650 651 654 656
+655 82 650 659
+652 0 648 653
+636 78 79 639
+638 586 584 646
+584 588 610 646
+74 612 77 646
+655 650 654 656
+588 570 612 646
+622 570 571 646
+80 79 8 638
+79 80 78 638
+639 592 584 647
+0 80 585 647
+584 78 80 638
+14 624 0 642
+78 638 640 643
+650 0 651 656
+641 623 14 642
+76 75 72 686
+631 78 632 640
+632 630 631 640
+584 585 80 647
+639 584 80 647
+632 74 77 640
+632 77 617 640
+629 617 77 640
 617 630 632 640
-584 647 639 592
-0 14 642 641
+617 629 630 640
+640 629 630 641
+79 631 0 643
+8 638 637 645
+637 0 641 643
+641 640 629 644
+643 640 641 644
+643 638 640 644
+641 637 643 644
+637 638 643 644
+642 637 641 644
+82 637 642 644
+612 570 622 646
+642 641 623 644
+642 623 82 644
+656 650 0 659
+651 649 650 654
+679 681 682 683
+656 0 657 659
+640 74 77 646
+644 640 622 646
+78 74 640 646
+78 584 74 646
+638 78 640 646
+638 584 78 646
+644 638 640 646
+571 638 644 646
+8 637 0 649
+585 0 581 653
+649 645 650 654
+648 579 652 653
+652 579 0 653
+637 8 645 649
+648 645 8 649
 648 8 0 649
-638 643 8 637
-0 631 643 79
-78 631 79 643
-77 646 622 640
-71 662 667 566
-647 81 639 592
-638 643 644 640
-587 81 647 592
-587 647 584 592
-629 640 622 644
-580 593 0 647
-648 585 80 586
-623 644 82 642
-569 571 579 645
-579 571 586 645
-644 645 82 637
-644 638 645 637
-571 646 622 570
-571 588 646 570
-588 571 646 586
-588 646 584 586
-646 584 610 588
-622 646 571 644
-77 646 612 622
-77 74 612 646
-0 659 650 642
-0 659 656 650
-664 665 0 567
-653 652 0 579
-581 585 653 578
-581 585 0 653
-645 652 654 649
-569 654 0 655
-82 642 637 650
-0 642 650 637
-932 190 181 934
-0 650 656 651
-0 650 651 649
-653 585 0 648
-579 653 648 586
-652 653 0 648
-663 664 0 567
-656 655 0 654
-654 651 650 649
-651 656 0 654
-568 569 662 571
-569 82 654 655
-652 651 654 649
-645 579 654 652
-654 579 0 652
-569 579 0 654
+86 676 677 679
+667 666 567 678
+651 0 649 652
+670 83 668 677
+586 585 578 653
+648 586 579 653
+650 642 0 659
+0 649 650 651
+83 680 681 684
+654 0 569 655
+656 655 650 659
+569 568 662 663
+579 645 648 652
+649 651 652 654
+650 645 82 654
+645 569 82 654
+652 579 645 654
 645 579 569 654
-82 645 569 654
-82 645 654 650
-655 657 0 664
-82 661 659 655
-86 83 680 679
-662 82 661 623
-0 624 660 659
-71 570 662 622
-721 675 722 714
-0 624 668 660
-656 657 0 655
-655 657 659 656
-0 657 656 659
-661 624 659 660
-90 682 0 84
-568 662 663 73
+579 652 0 654
+579 0 569 654
+652 651 0 654
+657 658 0 664
+654 569 82 655
+566 623 622 662
+71 566 622 662
+661 666 667 669
+570 568 71 662
+667 566 623 669
+663 655 0 664
+0 671 672 683
+0 655 656 657
+622 570 71 662
+82 623 661 662
+662 568 73 663
+650 82 642 659
+642 624 0 659
+665 567 666 684
+569 571 82 662
+570 571 568 662
+663 567 661 664
+659 624 0 660
+659 0 657 660
+658 657 0 660
+729 91 11 730
+665 0 567 684
+568 73 71 662
+642 623 624 661
+659 642 624 661
+659 82 642 661
+662 73 71 667
+432 437 438 689
+660 659 624 661
+0 676 677 776
+659 655 82 661
+664 0 567 665
+664 658 0 665
+0 564 73 691
+624 660 661 666
+568 571 569 662
+659 657 655 664
+657 659 660 664
+570 622 571 662
+661 659 655 664
 663 661 655 664
-682 683 0 672
-669 661 666 624
-0 785 782 783
-668 625 669 624
-666 668 669 624
-0 660 658 657
-0 659 660 657
-622 644 662 623
-568 71 662 73
-71 568 662 570
-655 664 0 663
-569 82 655 663
-663 73 0 568
-567 73 0 663
-0 677 676 673
-663 82 655 661
-663 82 661 662
-623 642 82 661
-82 661 642 659
-661 624 642 659
-623 642 661 624
-568 569 663 662
-86 677 676 776
-661 660 659 664
-659 664 657 655
-661 664 659 655
-666 664 567 665
-623 669 14 624
-661 664 567 666
-658 671 0 665
-566 669 667 687
-760 308 747 364
-660 658 664 665
-764 678 680 775
-661 660 666 624
-72 686 76 75
-83 775 668 677
-772 774 775 10
-660 664 666 665
-660 664 661 666
-666 660 668 624
-748 94 754 757
+663 0 567 664
 0 660 668 670
-660 670 666 668
-674 682 84 672
-667 661 567 666
-663 661 567 667
-663 667 567 73
-663 662 667 73
-662 71 667 73
-663 661 667 662
+567 663 661 667
+664 660 658 665
+564 432 565 688
+778 97 776 779
+660 666 668 670
+688 432 565 689
+670 0 658 671
+683 681 0 684
+52 417 416 706
+71 73 564 691
+567 664 665 666
+664 567 661 666
+665 664 660 666
+664 661 660 666
+662 661 663 667
+672 0 84 674
+677 83 86 679
+666 567 661 667
+662 566 623 667
 662 623 661 667
-800 604 761 765
-792 768 782 781
-0 670 673 671
-673 679 674 682
-0 670 671 658
-721 674 722 675
-717 84 0 722
-431 693 419 430
-706 52 417 45
-566 623 669 621
-566 623 667 669
-667 623 661 669
-667 669 661 666
-71 564 691 73
-682 672 0 84
-432 689 430 437
-684 683 681 83
-0 672 673 674
-0 673 672 671
-776 676 85 777
-721 676 674 675
-882 881 887 883
-710 725 0 11
-0 677 673 670
-726 719 701 721
-97 776 779 772
-0 103 101 740
-726 719 700 701
-97 779 770 772
-718 713 0 712
-773 755 756 767
-722 84 0 674
-722 724 0 717
-621 96 781 774
-0 784 782 785
+83 677 86 775
+0 658 660 670
+607 76 565 689
+665 658 0 671
+83 681 683 684
+666 624 660 668
+660 624 0 668
+661 623 624 669
+805 797 796 881
+668 666 624 669
+668 624 625 669
+625 624 14 669
+623 14 624 669
+621 625 14 669
+623 621 14 669
+721 714 726 732
+560 434 607 689
+741 739 0 744
+673 0 672 674
+10 86 772 776
+671 0 672 673
+671 670 0 673
+735 727 731 737
+94 755 756 771
+679 676 674 721
+742 741 0 743
+676 673 0 677
+669 687 774 775
+673 670 0 677
+709 700 711 726
+732 675 91 777
+668 0 670 677
+734 770 778 826
+75 620 96 773
+744 708 93 745
+85 731 97 777
+731 85 732 777
 675 674 0 676
-777 675 0 676
-732 714 710 11
-0 776 10 779
-773 756 96 75
-71 565 688 564
-83 677 670 673
-51 697 693 692
-693 694 695 704
-841 844 843 845
-687 566 669 621
-923 614 922 613
-782 792 783 785
-51 697 419 693
-669 666 667 678
-667 666 567 678
-667 567 685 678
-0 626 780 625
-431 432 688 430
-566 71 690 667
-680 681 679 83
-774 772 780 10
-776 86 85 676
-690 691 685 73
-757 758 767 759
-51 693 419 431
-86 720 95 85
-690 678 685 696
-690 667 73 685
-822 832 831 827
-429 76 430 694
-87 700 0 88
-0 780 10 625
-698 681 0 699
-703 95 705 709
-828 830 809 829
-700 89 0 88
-416 417 415 706
-71 691 688 690
-681 683 0 682
-679 681 682 683
-673 683 679 682
-683 670 671 673
-683 671 672 673
-665 670 671 683
-434 429 689 426
+732 85 675 777
+778 770 97 779
+625 0 10 780
+777 0 735 778
+755 769 773 794
+10 0 668 677
+90 0 84 682
+680 83 678 684
+680 679 83 681
+434 429 76 689
+677 10 86 775
+772 770 768 779
+75 758 762 765
+676 86 677 776
+690 71 688 691
+685 73 690 691
+564 565 71 688
+690 73 71 691
+685 0 73 691
+712 710 714 725
+670 665 83 683
+565 432 562 689
+688 564 432 691
+704 695 94 756
+565 76 688 689
+560 565 562 689
+84 672 674 682
+84 674 90 682
+679 83 86 680
+773 767 765 793
+426 429 434 689
+560 433 434 689
+700 699 719 720
+438 560 562 689
+87 45 53 705
+0 89 88 700
+731 735 734 778
+87 0 88 700
+681 679 83 683
+673 679 682 683
+679 673 83 683
+681 0 682 683
+682 0 672 683
+682 672 673 683
+83 665 666 684
+678 666 567 684
+678 83 666 684
+0 431 432 691
 71 564 688 691
-678 687 696 690
-607 560 689 565
-562 689 565 432
-689 429 76 430
-432 689 688 430
-73 685 0 691
-562 560 689 438
-432 438 689 437
-688 694 686 693
-688 76 686 694
-560 433 689 438
-432 691 0 431
+567 667 678 685
 667 567 73 685
-685 73 0 567
-684 685 0 567
-434 429 76 689
-689 607 76 434
-560 607 689 434
-431 432 691 688
-51 692 693 431
-73 691 0 564
-854 858 108 270
-365 367 428 763
-71 691 690 73
-829 828 100 753
-692 685 0 698
-688 686 76 72
-565 688 76 72
-565 71 688 72
-688 71 686 72
-690 667 685 678
-693 704 695 697
-698 684 681 680
-690 687 695 686
-607 689 76 565
-565 689 76 688
-696 693 695 697
-51 53 697 692
-690 692 693 696
-697 692 53 696
-680 698 684 678
-430 694 419 420
-429 694 430 420
-431 692 0 51
-692 53 0 51
-607 762 606 12
-361 763 365 364
-680 698 699 681
-707 743 0 708
-685 692 0 691
-691 692 0 431
-714 701 712 718
+567 678 684 685
+684 0 567 685
+0 73 567 685
+0 53 692 698
+667 669 678 687
+718 717 716 724
+703 92 95 751
+417 51 53 697
+45 417 52 706
+45 87 707 709
+52 46 419 704
+71 72 686 688
+72 76 686 688
+76 72 565 688
 431 691 692 693
-693 691 692 690
-693 692 697 696
-703 93 702 92
-768 771 92 772
-696 678 685 698
-695 696 690 693
-686 688 693 690
-688 691 693 690
-431 691 693 688
-741 731 727 737
-86 679 720 85
-698 684 0 681
-685 684 0 698
-757 767 756 754
-752 746 102 748
-775 669 666 668
-696 697 702 705
-846 110 111 836
-89 712 0 710
-780 772 768 779
-699 705 698 680
-705 696 698 680
-96 774 771 781
-52 51 697 419
-52 51 417 697
-52 697 417 45
-742 741 0 743
-772 10 776 779
-732 85 721 675
-416 0 706 415
-700 701 0 89
-699 720 681 719
-720 681 719 679
-86 680 95 720
-680 681 720 679
-90 84 0 717
-414 706 379 52
-45 53 87 705
-53 697 705 45
-730 724 725 728
-0 713 723 725
-724 722 0 730
-696 695 702 697
-416 0 414 706
-705 697 702 45
-770 779 784 768
-45 705 709 703
+693 688 686 694
+731 85 97 750
+431 688 691 693
+52 416 414 706
+693 430 688 694
+702 697 704 749
+696 680 678 698
+686 76 75 694
+430 432 431 688
+688 432 431 691
+0 675 676 777
+692 690 685 696
+431 430 688 693
+430 76 688 694
+76 430 688 689
+688 430 432 689
+701 89 710 712
+680 86 95 764
+429 434 76 762
+686 71 688 690
+678 685 690 696
+0 87 699 700
+691 0 431 692
+691 685 0 692
+766 765 758 767
+417 415 416 706
+94 102 748 754
+762 604 12 765
+606 434 360 762
+88 87 700 709
+690 685 691 692
+690 693 695 696
+751 97 734 770
+53 698 699 705
+0 675 91 730
+419 430 431 693
+51 431 692 693
+431 51 419 693
+692 53 696 698
+684 680 681 698
+678 680 684 698
+732 726 85 750
+781 768 755 792
+759 754 100 767
+719 700 720 726
+751 92 97 770
+695 687 690 696
+687 678 690 696
+922 616 921 968
+761 765 766 800
 740 102 101 746
-378 752 377 4
-45 705 703 702
+713 712 0 718
+693 51 419 697
+692 51 693 697
+692 53 51 697
+698 53 696 705
+53 692 696 697
+692 693 696 697
+696 693 695 697
+698 680 681 699
+698 0 53 699
+87 53 0 699
+414 379 52 706
+724 0 723 728
+709 705 699 720
+719 699 681 720
+86 95 85 720
+680 699 705 720
+86 679 680 720
+700 0 89 701
+697 53 45 705
+699 698 680 705
+731 97 734 751
+696 53 697 705
+702 696 697 705
+695 696 697 702
+762 12 75 765
+415 87 88 707
+706 45 415 707
+0 103 101 740
+702 92 95 703
+737 727 731 741
+414 0 379 706
+739 737 734 741
+768 782 784 792
+95 702 703 705
+45 703 702 705
+420 419 46 704
+694 419 420 704
+419 693 697 704
+694 693 419 704
+697 693 695 704
+695 693 694 704
+697 695 702 704
+695 94 702 704
+428 374 365 763
+45 702 697 705
+116 75 12 765
+87 415 45 707
+0 710 89 712
+694 75 756 758
+716 713 0 718
+0 90 84 717
+713 716 723 724
+706 415 0 707
+88 0 415 707
 705 699 87 709
-801 803 802 322
-743 708 707 703
-749 706 708 45
-0 843 786 885
-743 709 750 703
-52 419 704 46
-704 46 419 420
-704 419 694 420
-760 308 364 309
-0 677 776 676
-52 419 697 704
-95 750 709 703
-53 697 696 705
-696 53 705 698
-415 707 706 45
-707 415 87 45
-714 724 725 730
-727 742 0 11
-711 726 710 742
-88 415 87 707
-415 0 707 88
-415 0 706 707
-707 87 88 709
-45 87 707 709
-707 709 743 703
-379 748 46 749
-750 732 726 742
-45 703 707 708
-378 379 0 745
-703 744 708 93
-740 746 0 745
-735 734 778 825
-714 732 730 11
-756 695 771 96
-706 0 708 707
-706 707 708 45
-747 377 752 4
-711 709 750 743
-711 750 742 743
-38 817 305 32
-88 711 0 707
-710 714 725 11
-699 719 0 700
-714 718 712 725
-0 91 729 730
-718 717 716 724
-716 715 0 713
+705 95 680 720
+752 748 102 754
+747 4 377 752
+4 378 377 752
+707 706 45 708
+0 706 707 708
+706 0 379 708
+102 740 745 746
+720 95 85 750
+709 720 726 750
+748 93 94 749
+707 45 703 708
+700 89 88 711
 711 710 0 742
-719 681 682 679
-0 729 727 11
-714 710 701 726
-675 722 0 674
-91 730 0 675
-718 716 0 713
-95 97 751 92
-719 90 0 701
-718 722 724 714
-89 710 726 701
-710 701 712 714
-721 719 701 90
-90 719 682 721
-714 721 701 90
-714 730 725 11
-381 747 372 4
-90 722 718 714
-701 718 0 712
-720 719 726 721
-701 90 718 714
+89 0 88 711
+97 731 734 778
+739 103 0 740
+743 0 708 744
+716 717 0 724
+719 90 701 721
+761 605 613 801
+722 0 717 724
+727 91 731 732
+97 731 750 751
+719 701 700 726
+753 102 101 820
+715 713 0 716
+85 679 720 721
+0 710 11 742
+0 715 716 723
+85 731 732 750
+699 700 709 720
+816 813 810 818
+717 90 84 722
+674 84 90 722
+710 726 732 742
+309 322 802 803
+0 778 779 826
 701 90 0 718
-90 717 0 718
-718 717 0 716
-750 97 731 751
-721 719 682 679
-90 721 682 674
-721 679 682 674
-675 732 730 714
-679 721 719 720
-730 732 91 11
-85 676 721 675
-679 721 720 85
+716 0 723 724
+714 701 712 718
+90 701 714 718
+726 85 721 732
+712 701 0 718
+717 0 90 718
+717 716 0 718
+713 715 0 723
+722 714 675 730
+719 682 90 721
+682 674 90 721
+712 0 710 725
+676 85 675 721
+701 700 0 719
+699 0 700 719
+699 681 0 719
+682 679 674 721
+712 713 0 725
+718 716 713 724
+681 679 682 719
+0 681 682 719
+682 90 0 719
+721 714 675 722
 85 676 679 721
-730 722 0 675
-681 719 0 699
-719 681 0 682
-90 719 0 682
-710 714 712 725
-679 676 674 721
-95 680 705 720
-705 680 699 720
+90 701 0 719
 699 680 681 720
-705 699 709 720
-709 699 700 720
-709 95 705 720
-742 732 11 727
-754 100 769 828
-90 674 84 722
-90 722 84 717
+719 681 679 720
+681 680 679 720
+718 713 712 725
+720 700 709 726
+91 0 735 777
+721 674 90 722
+726 710 711 742
+712 714 718 725
 90 717 718 722
-93 751 733 92
-703 95 750 751
-723 715 0 716
-716 723 715 713
-0 713 715 723
-718 725 724 713
-724 725 723 713
-725 718 712 713
-718 714 724 725
-753 752 815 821
-91 675 0 777
-95 772 97 92
-708 744 0 745
-45 708 749 703
-93 703 751 92
-11 732 91 727
-703 95 751 92
-709 720 700 726
-720 719 700 726
-711 709 700 726
-89 711 700 726
-89 711 726 710
-75 767 756 758
-730 91 729 11
-0 824 738 823
-102 733 93 740
-381 377 747 4
-751 741 743 744
-731 91 735 777
-0 826 784 831
-773 769 767 793
-735 737 736 727
-0 738 739 737
-0 729 736 727
-703 751 744 93
-732 11 710 742
-75 773 767 765
-822 834 827 103
-695 687 771 96
-760 814 813 308
-45 749 702 703
-0 736 737 727
-93 733 99 92
-102 99 93 733
-751 741 739 734
-703 750 743 751
-95 97 750 751
-721 732 726 85
-721 714 726 732
-675 732 91 730
-76 762 12 75
-740 733 744 739
-827 826 791 770
-0 737 739 741
-734 735 731 737
-752 754 759 757
-696 695 764 702
-707 711 0 743
-741 731 737 734
-739 741 737 734
-760 796 807 814
-621 781 626 774
-755 756 771 96
-837 809 835 104
-729 91 736 727
-0 91 736 729
-776 777 0 676
-97 778 734 770
-0 776 778 777
-772 779 770 768
-769 790 794 792
-740 733 739 103
-742 731 732 727
-0 104 835 819
-794 792 782 781
-889 882 883 903
-0 835 106 819
-814 803 812 39
-753 828 100 754
-739 734 737 738
-822 832 833 831
-740 733 93 744
-833 838 834 105
-727 741 0 742
-741 731 742 727
-744 739 0 740
-741 744 0 743
-45 749 697 702
-749 704 94 748
-621 626 625 774
-378 746 377 752
-52 704 749 46
-749 704 697 702
-747 366 372 4
-731 97 734 751
-759 760 747 364
-707 709 711 743
-711 742 0 743
-703 743 708 744
-745 379 0 708
-749 706 379 708
-751 741 744 739
-52 379 46 749
-865 866 818 811
-93 102 740 745
-93 740 744 745
-93 744 708 745
-52 697 749 704
-745 746 0 378
-746 377 0 378
-745 102 740 746
-749 46 704 748
-93 749 748 745
-814 802 803 309
-0 842 861 847
-816 815 307 821
-307 747 383 377
-377 383 381 747
-747 383 381 372
-747 376 383 372
+714 90 718 722
+721 675 674 722
+721 90 714 722
+713 718 724 725
+714 710 11 725
+104 103 0 834
+723 713 724 725
+0 713 723 725
+710 0 11 725
+903 883 904 917
+701 719 721 726
+721 719 720 726
+714 701 721 726
+85 97 776 777
+720 85 721 726
+89 701 710 726
+89 700 701 726
+711 700 89 726
+89 710 711 726
+86 676 85 776
+91 727 11 732
+750 95 97 751
+95 92 97 751
+714 710 701 726
+94 93 702 749
+730 714 675 732
+714 721 675 732
+721 85 675 732
+730 11 714 732
+726 714 710 732
+810 106 816 818
+735 731 734 737
+11 0 727 729
+729 0 727 736
+190 932 933 934
+308 376 383 747
+728 0 11 729
+758 429 76 762
+791 820 822 827
+915 902 905 917
+626 627 0 782
+796 803 805 814
+917 915 901 938
+744 741 739 751
+0 11 727 742
+739 734 733 751
+743 741 0 744
+734 739 741 751
+741 731 734 751
+750 703 95 751
+711 707 709 743
+694 686 695 756
+765 116 75 773
+0 842 112 888
+741 743 750 751
+697 45 52 749
+0 737 738 739
+735 91 727 736
+784 0 779 826
+778 0 735 825
+0 729 91 736
+0 91 735 736
+756 695 94 771
+94 695 702 771
+94 99 102 754
+747 308 364 760
+383 372 381 747
+835 0 106 851
+739 733 103 740
+848 841 847 851
+727 735 736 737
+704 697 52 749
+736 0 727 737
+383 376 372 747
+93 102 733 740
+819 104 0 835
+0 104 105 835
+98 0 831 833
+104 0 105 834
+791 784 770 826
+0 711 742 743
+383 381 377 747
+737 731 734 741
+737 734 738 739
+792 791 99 828
+732 727 11 742
+741 0 727 742
+741 727 731 742
+731 727 732 742
+744 703 743 751
+744 739 733 751
+744 733 93 751
+744 93 703 751
+0 707 711 743
+709 707 703 743
 364 372 376 747
-613 801 761 605
-696 687 764 695
-750 85 731 97
-420 758 429 694
-95 85 750 97
-750 85 732 731
-816 815 810 813
-750 731 732 742
-379 378 46 748
-379 378 748 745
-378 745 746 748
-52 706 749 45
-52 697 45 749
-52 706 379 749
-720 750 95 85
-720 726 750 85
-750 85 726 732
-750 726 720 709
-95 750 720 709
-711 709 726 750
-733 751 739 734
-751 731 741 734
-360 761 763 361
-694 758 756 757
-378 748 752 4
-378 748 746 752
-762 763 758 429
-102 94 754 748
-816 819 810 821
-808 760 807 100
-816 813 307 815
-858 857 860 859
-806 769 100 829
-760 814 807 813
-751 734 733 770
-791 784 785 792
-823 825 737 735
-753 100 752 754
-377 0 307 821
-92 97 770 772
-762 766 761 765
-911 604 765 116
-791 768 784 792
-771 768 99 755
-782 792 784 768
-746 0 821 101
-774 775 764 772
-76 607 762 434
-607 76 762 12
-763 761 766 361
-361 761 802 801
-762 758 766 765
-97 778 770 779
-755 794 769 773
-821 0 307 816
-771 99 92 94
-94 702 92 771
-92 768 99 771
-822 827 791 820
-755 768 792 781
-764 680 95 86
-748 757 752 4
-748 754 752 757
-704 46 420 757
-420 757 694 704
-104 822 820 103
-104 835 819 809
+733 93 740 744
+812 804 805 864
+733 92 93 751
+740 739 733 744
+703 707 708 743
+740 0 744 745
+94 92 99 771
+708 0 379 745
+378 379 0 745
+702 45 697 749
+379 708 745 749
+744 0 708 745
+744 93 740 745
+0 378 745 746
+377 378 0 746
+745 740 0 746
+381 4 377 747
+383 377 307 747
+383 307 308 747
+810 807 813 815
+738 737 823 825
+100 759 767 808
+834 833 832 838
 361 367 365 763
-420 366 758 757
+859 856 812 864
+708 45 703 749
+4 46 378 748
+746 378 745 748
+815 307 816 821
+819 816 0 821
+306 39 309 814
+678 669 666 775
+803 309 39 814
+802 760 309 814
+46 420 704 757
+111 110 0 845
+745 102 746 748
+745 708 93 749
+704 46 748 749
+93 708 703 749
+709 711 743 750
+743 711 742 750
+703 709 743 750
+731 741 742 750
+748 94 754 757
+743 742 741 750
+750 731 741 751
+703 93 92 751
+748 746 378 752
+694 76 75 758
+942 181 180 948
+704 94 748 757
+781 627 782 794
+620 75 116 773
+748 102 746 752
+800 761 613 801
+13 840 841 850
+752 100 753 815
+811 829 839 886
+813 760 807 814
+752 102 746 753
+746 102 101 753
+114 789 793 911
+753 752 102 754
+100 752 753 754
+748 4 46 757
+754 94 99 755
+822 103 104 834
+99 768 770 791
+932 941 942 944
+764 695 687 771
+755 96 756 771
+86 97 772 776
+791 99 768 792
+797 796 795 805
+801 800 761 802
+798 795 799 803
+887 865 880 888
+733 99 92 770
+751 733 92 770
+434 607 76 762
+763 761 762 766
+252 192 325 873
+434 606 607 762
+12 76 607 762
+765 762 761 766
+948 947 942 949
+747 377 307 815
+758 757 759 767
+100 807 806 829
+94 704 756 757
+366 420 757 758
 420 366 429 758
-764 696 705 680
+757 420 694 758
+694 420 429 758
+756 757 758 767
+761 604 606 762
+765 75 758 767
+758 366 429 763
+839 98 837 843
+813 306 308 814
+0 38 307 816
+100 810 807 829
+694 429 76 758
+762 429 434 763
+428 365 367 763
 361 360 367 763
-360 428 367 763
-767 766 759 758
-754 100 759 767
-763 366 365 364
-365 763 374 366
-814 309 306 308
-808 802 766 800
-762 607 606 434
-76 758 762 75
-813 306 38 308
-311 804 39 812
-805 803 796 795
-912 917 114 919
-252 192 873 190
-323 799 931 363
-732 777 91 731
-0 106 816 819
-104 820 809 101
-881 796 805 866
-893 117 936 940
-0 817 305 38
-984 915 905 912
-763 361 766 364
-798 799 803 795
-0 819 816 821
-606 360 605 761
-377 0 821 746
-696 702 764 705
-764 702 95 705
-96 687 774 621
-0 844 843 885
-687 669 774 621
-75 116 773 765
-913 116 911 910
-605 801 761 6
-0 779 10 780
-801 799 803 322
-364 766 759 760
-366 766 759 364
-366 763 766 364
-366 763 758 766
-762 766 758 763
-762 761 766 763
-366 766 758 759
-863 879 869 864
-775 86 764 772
-772 775 86 10
-813 814 306 308
-755 99 771 94
-755 769 767 773
-777 676 85 675
-764 775 680 86
-775 83 678 680
-95 86 772 764
-95 86 97 772
-775 677 86 10
-668 775 625 10
-97 776 85 777
-620 619 773 116
-783 782 627 794
-687 774 764 771
-767 808 766 765
-97 777 778 776
-774 772 764 771
-687 774 771 96
-805 803 812 814
-613 800 761 801
-889 890 112 887
-912 913 923 911
-782 792 785 784
-782 794 783 792
-125 977 914 976
-613 924 919 795
-769 790 788 794
-822 827 831 791
-796 795 800 789
-769 100 754 767
-755 769 754 767
-810 829 100 753
-810 809 829 753
-775 774 625 10
-677 775 668 10
-86 83 775 680
-782 780 626 781
-822 827 820 103
-814 803 39 309
-780 774 626 781
-784 779 780 768
-733 734 827 770
-0 786 785 783
-733 770 791 99
-97 86 776 772
+361 761 763 766
+604 12 606 762
+758 76 75 762
+746 101 0 821
+886 881 883 887
+776 0 676 777
+15 918 920 931
+761 606 360 762
+789 795 800 919
+827 738 103 834
+758 75 756 767
+759 757 754 767
+758 759 766 767
+0 98 110 833
+830 791 822 831
+916 915 912 919
+613 911 919 923
+934 932 118 941
+92 702 95 764
+675 0 91 777
+669 668 666 775
+901 899 900 938
+677 83 668 775
+751 734 733 770
+883 114 904 917
+86 10 772 775
+834 0 105 838
+114 787 788 904
+625 669 774 775
+103 822 827 834
+767 765 75 773
+0 625 626 780
+308 813 760 815
+788 787 884 904
+731 91 735 777
+732 91 731 777
+702 92 94 771
+764 702 695 771
+626 0 780 782
+96 695 756 771
+784 770 768 791
+95 92 764 772
+771 764 92 772
+92 95 97 772
+790 788 769 794
+911 114 789 919
+627 626 781 782
+764 92 702 771
+768 755 771 781
+618 116 604 911
+776 676 85 777
+769 790 828 829
+803 798 795 805
+945 932 193 961
+855 854 852 860
+794 787 788 910
+773 769 767 793
+669 621 625 774
+805 859 864 880
+767 755 754 769
+767 754 100 769
+789 806 796 881
+811 806 807 829
+768 784 791 792
+626 625 621 774
+776 10 0 779
+806 881 883 886
+626 780 781 782
+782 0 780 784
+949 953 0 955
+39 306 812 814
+764 86 95 772
+97 95 86 772
+772 764 86 775
+774 772 10 775
+781 780 768 782
+773 96 755 781
+825 734 826 827
+976 113 914 992
+322 309 39 803
+812 306 32 814
+779 10 0 780
+768 771 772 774
+806 811 807 881
+96 621 687 774
+680 83 86 775
+764 680 86 775
+678 680 764 775
+764 687 678 775
+774 687 764 775
 97 86 85 776
-774 772 768 780
-687 678 764 775
-678 775 687 669
-687 669 775 774
-669 666 678 775
-775 666 678 83
-772 86 776 10
-86 677 776 10
-0 677 10 776
-0 782 627 783
-830 822 791 820
-820 102 101 740
-0 892 879 877
-755 792 768 99
-792 791 768 99
-731 735 734 778
-731 778 734 97
-731 777 778 97
-731 777 735 778
-0 778 735 777
-842 847 840 850
+785 791 792 830
+777 97 776 778
+0 782 783 785
+735 731 777 778
+932 190 181 934
+777 776 0 778
+823 0 738 824
+772 774 10 780
+10 774 625 780
+768 772 779 780
+779 772 10 780
+925 922 920 926
+203 193 194 961
 774 626 625 780
-97 776 778 779
-0 776 779 778
-806 796 789 881
-755 781 773 96
-773 781 619 96
+772 768 774 780
+781 619 627 794
+919 795 613 924
+784 782 0 785
+773 619 96 781
+774 96 621 781
 621 96 619 781
-621 619 626 781
-627 781 626 619
-820 733 740 103
-910 913 906 114
-768 774 780 781
-771 781 755 96
-809 822 830 820
-0 782 780 626
-0 627 782 626
-630 632 631 907
-822 831 830 791
-0 784 779 780
-0 782 784 780
-795 798 797 805
-807 806 100 829
-0 824 832 838
+621 626 774 781
+619 626 621 781
+780 774 626 781
+832 822 831 833
+626 619 627 781
+0 894 895 898
+363 6 322 801
+770 734 733 827
+783 788 790 794
+766 361 761 802
+782 627 0 783
+782 780 768 784
+779 768 780 784
+792 781 782 794
+517 24 605 925
+779 770 768 784
+876 875 117 935
+807 796 760 808
+859 32 857 866
+308 309 760 814
+792 782 783 794
+306 265 39 812
+306 32 265 812
+793 765 116 911
+937 15 117 943
+785 0 98 786
+783 0 785 786
+617 907 909 913
+619 617 909 910
+0 627 628 909
+787 627 0 909
+15 914 113 940
+783 627 0 787
+877 882 888 890
+735 0 736 823
+0 825 826 832
+105 833 834 838
+825 778 0 826
+826 827 831 832
+881 880 797 882
+892 895 0 936
+101 746 753 821
+766 759 760 808
+865 880 881 887
+865 840 842 887
+768 781 782 792
+307 813 815 816
+785 783 786 790
+920 922 916 976
+106 816 0 819
+752 746 377 821
+614 613 605 922
+995 998 999 1000
+916 976 983 992
+765 761 604 800
+813 810 815 816
+767 766 765 808
+767 759 766 808
+783 782 627 794
+176 167 179 956
+783 787 788 794
+787 783 627 794
+822 98 830 831
+813 308 760 814
+806 100 769 808
+800 765 766 808
+834 824 0 838
+770 733 99 791
+783 790 792 794
+793 773 769 794
+910 909 906 913
+98 0 110 843
+788 769 793 806
+871 872 874 875
+0 784 785 831
+804 39 311 812
+733 102 99 820
+800 766 802 808
+887 112 842 888
+822 820 103 827
+110 841 843 845
+13 811 810 829
+812 803 39 814
+828 809 753 829
+734 778 825 826
+796 807 760 814
+802 309 803 814
+807 810 811 829
+819 101 753 821
+983 975 124 993
+753 810 100 829
 361 6 761 801
-769 100 767 808
-813 760 308 815
-632 913 618 908
-815 747 307 377
-931 323 872 799
-905 917 114 912
-755 781 794 773
-792 794 783 790
-838 833 846 105
-0 98 785 786
-987 990 125 986
-907 632 631 122
-0 989 987 988
-617 628 619 909
-972 971 120 974
-0 627 787 783
-844 112 840 885
-746 752 821 377
-795 797 789 796
-836 835 837 841
-807 806 808 100
-795 798 924 938
-782 627 794 781
-786 790 785 783
-773 793 767 765
-910 911 793 116
-828 99 820 791
-797 883 789 881
-804 803 39 812
-923 922 916 613
-114 789 788 793
-32 814 306 813
-803 30 39 322
-760 815 807 100
-940 117 936 900
-769 794 793 773
-364 802 760 309
-24 926 922 925
-799 363 322 801
-799 924 931 925
-813 308 38 307
-766 802 808 760
-830 785 786 790
-803 799 30 322
-810 811 807 829
-0 104 105 835
-613 604 761 800
-101 753 821 746
-983 912 984 985
-114 789 919 917
-100 760 815 759
-788 789 806 793
-759 766 808 760
-801 363 322 6
-793 765 773 116
-831 832 826 827
-881 883 789 806
-983 915 912 916
-936 940 900 895
-125 990 991 914
-809 820 828 753
-795 805 797 796
-733 827 820 791
-827 834 822 832
-0 825 778 826
-821 752 815 377
-753 828 754 102
-809 837 13 839
-827 734 739 738
-770 768 784 791
-0 98 831 785
-800 761 766 765
-944 961 945 928
-823 735 737 736
-98 785 786 830
-953 955 949 119
-819 753 810 821
-852 857 858 32
-100 815 752 759
-922 921 916 976
-0 786 783 884
-866 865 880 881
-0 862 888 863
-887 881 886 883
-866 814 807 796
-875 320 325 257
-799 363 30 322
-802 761 800 801
-799 323 30 363
-753 100 815 752
-806 796 881 807
-941 934 932 942
-880 888 862 863
-15 930 945 937
-265 39 306 812
-815 308 747 760
-0 877 888 890
-976 969 968 977
-958 165 0 164
+801 361 322 802
+832 738 827 834
+793 789 788 806
+874 864 869 879
+30 311 320 804
+109 856 867 869
+882 880 877 888
+322 361 309 802
+159 165 959 964
+935 893 118 943
+935 118 873 943
+940 939 893 943
+747 307 308 815
+857 861 862 865
+363 30 323 799
+270 305 852 858
+766 364 361 802
+970 939 928 997
+960 970 121 977
+761 613 604 800
+102 740 101 820
+38 305 32 817
+39 30 322 803
+934 0 182 948
 613 795 800 801
-265 812 306 32
-364 802 766 760
-364 361 766 802
-361 761 766 802
+801 605 613 925
+0 843 844 845
 766 761 800 802
-821 753 810 815
-753 752 821 746
-0 826 778 779
-850 861 857 865
-0 868 255 109
-759 808 100 760
-311 39 265 812
-32 812 306 814
-806 769 808 100
-798 803 804 805
-801 795 802 803
-804 30 39 803
-804 30 803 799
-804 799 803 798
-876 875 871 874
-252 190 873 933
-181 195 942 180
-117 875 873 935
-311 30 804 320
-0 862 861 842
-0 256 255 868
-863 877 879 878
-873 190 932 933
-311 30 39 804
-815 753 810 100
-814 802 796 803
-809 820 753 101
-810 13 811 829
-793 800 808 765
-808 800 793 789
-806 808 793 789
-796 808 806 789
-796 800 808 789
-800 808 802 796
-807 806 796 808
-769 806 808 793
-769 808 767 793
-767 808 759 766
-838 824 832 834
-103 820 101 740
-0 823 737 736
-858 859 860 867
-104 809 819 101
-811 806 807 829
-829 790 886 806
-0 831 784 785
-849 848 847 851
-825 738 827 832
-860 862 867 859
-268 853 269 270
-760 802 796 814
-875 257 870 868
-0 836 105 846
-837 809 13 835
-941 932 118 944
-816 106 810 819
-830 792 785 790
-0 838 832 833
-829 790 839 886
-877 878 901 892
-867 863 859 862
-115 632 618 908
-0 108 268 854
-106 13 810 819
-819 13 810 809
-0 861 855 849
-0 862 860 861
-854 860 858 852
-814 866 32 812
-817 818 857 32
-752 815 747 759
-846 833 110 105
-807 829 100 810
-877 879 878 892
-266 268 108 853
-38 816 817 813
-843 885 840 839
-38 813 32 306
-815 810 813 807
-760 815 813 807
-853 268 108 270
+760 309 364 802
+361 364 309 802
+39 311 30 804
+859 812 32 866
+866 805 796 881
+810 100 807 815
+801 795 800 802
+800 795 796 802
+799 322 30 803
+322 801 802 803
+322 799 801 803
+802 801 795 803
+801 799 795 803
+802 795 796 803
+810 13 106 818
+861 842 0 862
+912 915 917 919
+323 30 320 872
+799 798 803 804
+802 796 760 814
+740 733 103 820
+788 790 769 806
+826 791 784 831
+308 306 309 814
+796 802 760 808
+822 104 105 834
+746 752 753 821
+784 791 785 831
+804 803 39 812
+869 109 856 871
+100 769 828 829
+793 765 800 808
+793 767 765 808
+793 769 767 808
+806 769 793 808
+806 793 789 808
+800 789 793 808
+806 789 796 808
+800 796 789 808
+796 800 802 808
+100 767 769 808
+809 13 810 829
+0 824 825 832
+818 32 813 866
+737 0 738 823
+832 0 824 838
+753 810 819 821
+815 810 753 821
+778 735 734 825
+737 735 736 823
+105 0 835 836
+828 792 791 830
+828 790 792 830
+740 102 733 820
+101 753 809 819
+833 0 832 838
+734 739 733 827
+809 753 820 828
+831 822 98 833
+839 786 98 843
+829 811 806 886
+841 837 110 843
+880 877 878 882
+860 0 108 867
+786 790 884 886
+810 809 753 819
+803 804 805 812
+109 31 266 853
+810 753 100 815
+107 0 106 817
+104 101 809 819
+98 785 786 830
+305 38 0 817
+38 813 816 817
+826 784 0 831
+816 0 38 817
+308 307 38 813
+38 306 308 813
+104 0 101 819
+827 791 826 831
+306 38 32 813
+859 812 805 864
+855 852 107 857
+760 759 747 815
+759 752 747 815
 813 308 307 815
-815 308 307 747
-809 828 829 753
-269 270 853 271
-0 106 107 817
-0 106 817 816
-810 811 818 807
-813 810 818 807
-858 860 108 867
-0 867 860 862
-877 888 882 880
-981 980 982 124
-856 812 265 858
-855 107 857 852
-789 795 919 797
-0 867 108 860
-817 818 32 813
-816 818 817 813
-813 818 810 816
-818 106 810 816
-816 106 817 818
-827 738 834 832
-829 790 806 769
-828 790 829 769
-791 99 820 733
-828 99 754 102
-820 99 828 102
-813 807 866 814
-835 13 819 809
-753 820 828 102
-102 733 740 820
-0 784 826 779
-770 826 784 779
-791 826 784 770
-835 13 106 819
-827 738 739 103
-105 834 822 104
-833 832 822 834
-104 834 822 103
-0 851 836 848
-734 778 826 770
-822 833 98 831
-0 824 823 825
-823 738 825 824
-825 734 737 735
-738 825 737 823
-0 107 106 851
-770 778 826 779
-881 796 866 807
-738 734 737 825
-733 827 739 103
-733 734 739 827
-0 825 735 778
-0 823 735 825
-0 98 833 831
-825 734 827 738
-734 825 827 826
-837 822 809 104
-832 825 826 827
-828 830 791 820
-0 107 851 849
-828 792 790 769
+813 307 38 816
+813 38 32 817
+817 107 0 852
+839 837 13 841
+878 864 874 879
+850 106 107 851
+109 108 0 867
+862 0 860 867
+857 32 818 866
+850 107 849 851
+810 807 811 818
+807 810 813 818
+864 859 856 867
+858 856 859 867
+860 108 858 867
+860 858 859 867
+871 869 868 876
+852 817 107 857
+811 13 810 818
+753 101 809 820
+101 104 809 820
+101 103 104 820
+734 737 738 825
+823 735 0 825
+737 736 0 823
+790 792 769 828
+786 785 790 830
+830 98 785 831
+847 841 840 850
+779 778 770 826
+791 770 733 827
+103 738 0 834
+817 305 32 852
+811 840 850 865
+820 104 809 822
+820 103 104 822
+0 785 98 831
+0 106 819 835
+868 257 31 871
+809 810 753 829
+733 739 103 827
+836 105 0 846
+738 823 824 825
+792 790 785 830
+823 737 735 825
+734 735 737 825
+820 733 103 827
+824 0 738 834
+820 791 733 827
+739 738 103 827
+824 823 0 825
+819 13 809 835
+0 305 817 852
+835 106 13 851
+829 809 13 839
+829 13 811 839
+738 734 825 827
+837 98 110 843
+753 100 754 828
+820 753 102 828
+102 753 754 828
+820 102 99 828
+754 99 102 828
+769 754 100 828
+769 755 754 828
+99 754 755 828
 755 769 792 828
-755 828 792 99
-792 828 791 99
-831 827 826 791
-830 829 828 790
-880 797 805 881
-754 828 755 99
-754 769 755 828
-0 833 832 831
-809 830 828 820
-791 792 830 828
-791 792 785 830
-0 834 103 738
-0 834 738 824
-832 738 834 824
-834 738 827 103
-0 832 824 825
-825 738 832 824
-0 832 825 826
-0 831 832 826
-829 839 13 811
-836 110 841 837
-0 833 98 110
-833 834 822 105
-845 841 848 836
-809 830 837 839
-0 104 834 105
-0 104 103 834
-841 844 840 843
-841 843 839 837
-0 844 845 843
-842 112 840 844
-930 199 937 931
-817 818 107 857
-0 833 846 838
-0 846 110 111
-111 845 848 836
-786 884 790 783
-822 98 833 837
+792 99 755 828
+827 822 831 832
+829 828 809 830
+820 809 828 830
+809 820 822 830
+828 791 820 830
+820 791 822 830
+789 796 797 881
+829 790 828 830
+825 738 827 832
+824 738 825 832
+809 104 819 835
+0 107 106 851
+840 811 886 887
+811 881 886 887
+841 836 835 851
+832 824 738 834
+830 829 790 839
+110 833 105 846
+833 822 105 834
+833 832 822 834
+836 835 837 841
+840 13 811 850
+305 0 270 852
+853 265 270 858
+850 13 106 851
+786 0 98 843
+110 0 833 846
+848 0 836 851
+110 111 0 846
+848 836 841 851
+835 809 104 837
+104 822 105 837
+822 104 809 837
+98 822 830 837
+833 822 98 837
+835 105 836 837
+255 257 31 868
+822 833 105 837
 833 98 110 837
-105 833 110 837
-105 110 836 837
-0 845 110 843
-836 835 105 837
-105 822 833 837
-840 839 811 13
-110 98 843 837
-265 270 853 858
-850 840 811 13
-786 884 886 790
-889 882 890 887
-0 895 892 896
-829 830 839 790
-830 790 786 839
-98 830 786 839
-809 830 839 829
-809 839 13 829
-0 111 110 845
-841 845 843 110
-811 881 866 807
-105 110 846 836
-0 848 836 111
-850 106 851 13
-860 857 858 852
-884 788 886 790
-843 98 839 837
-0 98 786 843
-0 110 98 843
-886 788 806 790
-845 841 836 110
-847 841 840 850
-109 871 856 869
-859 805 812 866
-875 257 252 870
-118 933 932 934
-864 878 805 880
-862 860 857 859
-0 898 895 896
-0 844 885 112
-845 841 847 848
-857 861 855 860
-849 847 861 850
-271 853 304 265
-0 855 854 852
-0 844 847 845
-845 847 841 844
-841 847 840 844
-847 842 840 844
-0 844 842 847
-851 835 841 13
-850 851 847 841
-879 876 869 874
-883 788 789 806
-0 849 851 848
-0 851 835 836
-850 851 841 13
-851 106 835 13
-107 849 861 850
-0 849 848 847
-851 848 847 841
-851 836 848 841
-851 835 836 841
-866 865 881 811
-0 107 855 852
-0 860 854 855
-0 851 106 835
-0 817 107 852
-852 305 817 32
-305 270 858 852
-858 32 859 812
-857 818 107 850
-107 818 106 850
-861 842 865 850
-817 857 852 32
-861 847 842 850
-856 858 859 812
-854 855 860 852
-266 109 31 853
-31 853 264 266
+838 105 833 846
+836 111 110 846
+837 809 830 839
+809 829 830 839
+806 788 790 886
+934 118 0 941
+786 98 830 839
+837 110 836 841
+847 840 842 850
+830 98 837 839
+847 0 845 848
+32 812 814 866
+841 840 839 843
+843 0 110 845
+850 840 842 865
+818 106 107 850
+839 13 811 840
+856 804 812 864
+885 112 840 887
+871 868 257 875
+849 848 847 851
+0 836 111 848
+0 111 845 848
+836 841 845 848
+818 107 817 857
+256 252 257 870
+807 813 814 866
+818 807 811 866
+838 0 105 846
+842 0 112 844
+112 840 842 844
+111 836 110 845
+843 841 840 844
+887 885 112 889
+841 844 845 847
+844 841 840 847
+844 840 842 847
+841 835 13 851
+841 13 850 851
+305 270 265 858
+849 0 855 861
+844 0 845 847
+844 842 0 847
+857 818 850 865
+968 920 969 976
+107 818 850 857
+850 849 847 851
+265 270 271 853
+836 0 835 851
+304 265 271 853
+271 269 304 853
+31 304 264 853
+107 0 849 851
+850 818 811 865
+256 257 255 868
+866 796 807 881
+848 847 0 849
+0 848 849 851
+887 886 885 889
+852 305 32 858
+806 789 788 883
+817 32 818 857
+32 817 852 857
+858 852 854 860
+323 320 325 872
+818 811 13 850
+270 269 271 853
+269 264 304 853
 269 266 264 853
-269 853 264 304
-31 853 304 264
-31 311 304 853
-269 853 304 271
-268 266 269 853
-868 31 257 255
-934 190 181 189
-876 870 868 875
-882 797 880 881
+270 268 269 853
+269 268 266 853
+268 270 108 853
+268 108 266 853
+31 264 266 853
+860 859 862 867
+0 854 855 860
 0 862 863 867
-865 862 857 859
-947 166 179 180
-117 874 875 876
-31 856 853 109
-853 856 108 109
-0 109 108 867
-305 270 265 858
-31 311 853 856
-853 311 265 856
-856 311 265 812
-856 311 812 804
-109 31 868 255
-919 800 789 911
-979 975 978 973
-108 856 867 109
-799 804 872 798
-882 883 797 881
-869 876 868 871
-0 861 849 847
-0 860 855 861
+862 861 842 865
+811 865 866 881
+311 804 812 856
+853 31 311 856
+311 265 853 856
+265 311 812 856
+911 912 114 919
+880 862 863 888
+856 265 853 858
+812 32 265 858
+852 32 857 858
+812 265 856 858
+856 853 108 858
+857 858 859 860
+853 270 108 858
+858 812 32 859
 858 32 857 859
-0 870 256 868
-813 866 32 814
-859 32 866 812
-858 859 867 856
-0 877 879 863
-865 857 866 859
-15 931 930 937
-857 32 866 859
-107 861 855 857
-107 849 855 861
-813 818 32 866
-805 878 798 797
-806 881 811 807
-939 943 940 15
-866 807 818 811
-863 864 869 867
-31 257 871 868
-0 863 869 867
-938 918 113 900
-873 875 252 870
-916 915 919 938
-868 257 870 256
-870 256 252 253
-938 797 901 917
-0 253 256 870
-856 864 812 859
-859 864 812 805
-864 804 812 805
-864 805 798 804
-856 804 812 864
-932 190 934 933
-813 807 818 866
-865 857 818 866
-858 867 108 856
-867 864 859 863
-31 871 856 109
-613 795 919 800
-31 868 871 109
-31 871 311 856
-934 189 181 182
-897 993 992 984
-109 868 871 869
-871 864 856 869
-786 886 885 839
-916 924 113 938
-871 257 875 868
-875 325 252 257
-933 935 873 870
-900 936 879 874
-943 15 928 945
-919 795 789 800
-869 876 871 874
-804 320 872 871
-252 325 875 873
-0 890 888 112
-179 177 950 180
-114 911 919 789
-856 871 311 804
-871 320 311 804
-31 320 311 871
-31 257 320 871
-804 871 864 856
-119 947 949 951
-871 320 875 257
-892 936 879 900
-928 945 15 930
-323 30 872 799
-872 30 804 799
-872 30 320 804
-323 30 320 872
-323 320 325 872
-899 938 915 113
-252 325 873 192
-884 788 790 783
-865 842 862 888
-879 874 869 864
-874 871 872 875
-872 320 875 871
+853 108 109 856
+853 109 31 856
+270 852 854 858
+108 270 854 858
+255 109 0 868
+107 855 857 861
+856 812 858 859
+847 842 0 861
+855 0 860 861
+842 847 850 861
+849 847 0 861
+849 850 847 861
+889 882 883 903
 872 320 325 875
-117 874 872 875
-874 900 798 878
-0 876 868 869
-0 870 868 876
-0 948 182 934
-24 922 614 605
-941 942 932 944
-909 627 619 910
-181 193 932 942
-937 192 945 873
-112 887 890 888
-863 879 864 878
-918 872 931 937
-773 910 793 116
-0 876 869 879
-24 925 605 517
-0 879 869 863
-0 893 936 895
-886 881 887 811
-882 880 887 881
-887 880 865 881
-917 789 919 797
-179 950 947 180
-863 878 864 880
-864 874 798 878
-805 864 798 878
-904 917 883 114
-887 881 865 811
-0 863 888 877
-0 948 934 941
-199 945 937 192
+881 811 865 887
+880 865 862 888
+862 842 0 888
+255 0 256 868
+856 109 31 871
+320 31 257 871
+865 818 811 866
+812 859 805 866
+866 865 859 880
+865 859 857 866
+107 850 849 861
+861 0 860 862
+804 30 799 872
+320 804 871 872
+861 860 857 862
+859 857 860 862
+805 796 814 866
+865 857 818 866
+812 805 814 866
+840 112 842 887
+870 252 257 875
+880 878 797 882
+877 0 879 892
+813 32 814 866
+814 796 807 866
+864 856 804 871
+320 311 31 871
+918 872 799 931
+843 839 786 885
+799 30 323 872
+863 859 864 867
+856 31 311 871
+868 31 109 871
+801 799 363 925
+190 192 252 873
+181 180 195 942
+874 869 871 876
+865 811 840 887
+949 948 947 950
+875 868 870 876
+892 879 900 936
+868 0 256 870
+947 119 949 955
+939 990 894 995
+256 0 253 870
+864 869 871 874
+843 786 0 885
+114 912 917 919
+881 789 806 883
+909 907 906 913
+797 881 882 883
+935 0 893 936
+941 0 948 949
+0 868 869 876
+871 320 872 875
+189 0 182 934
+874 871 875 876
+873 117 875 935
+865 862 859 880
+0 634 979 980
+882 883 887 889
+804 799 798 872
+113 916 920 924
+787 114 788 910
+325 257 252 875
+257 320 871 875
+887 882 889 890
+320 257 325 875
+947 179 166 957
+252 870 873 875
+325 252 873 875
+919 915 917 938
+872 117 874 875
+900 899 113 938
+876 0 935 936
+917 797 789 919
+940 893 117 943
+933 932 118 934
+0 189 933 934
+869 863 0 879
+876 874 869 879
+805 866 880 881
+885 840 839 886
+883 886 887 889
+883 884 886 889
+933 189 190 934
+958 959 946 972
+894 893 0 895
+890 877 882 891
+114 906 912 913
+874 878 879 900
+944 943 928 945
+0 631 122 907
+879 0 876 936
+869 0 876 879
+614 605 24 922
 859 862 863 880
 859 863 864 880
-859 864 805 880
-859 880 805 866
-859 865 880 866
-859 862 880 865
-0 124 985 122
-877 863 880 878
-950 179 956 176
-901 899 896 892
-890 877 882 891
-0 885 889 112
-0 988 897 993
+0 863 877 879
 788 789 114 883
-886 887 840 811
-885 887 840 886
-0 888 842 112
-773 619 794 910
-112 842 887 888
-887 842 865 888
-829 886 811 806
-886 806 881 811
-786 790 886 839
-884 786 886 885
-991 898 895 894
-882 878 877 880
-882 797 878 880
-787 884 783 788
-0 884 783 787
-890 888 882 877
-15 918 931 937
-891 896 901 902
-895 940 991 894
-0 862 842 888
-922 613 614 605
-881 883 806 886
-883 788 806 886
+797 789 881 883
+877 863 878 879
+891 0 877 892
+790 788 884 886
+112 887 889 890
+843 840 839 885
+122 631 632 907
+790 783 786 884
+990 994 995 1000
+844 0 112 885
 884 788 883 886
-888 887 882 880
-877 888 880 863
-865 888 862 880
-887 888 865 880
-885 887 112 840
-112 842 840 887
-840 842 865 887
-0 950 948 949
-885 889 112 887
-892 900 879 878
-889 882 887 883
-889 887 886 883
-884 886 883 889
-0 891 902 896
+843 0 844 885
+878 797 805 880
+878 805 864 880
+863 878 864 880
+863 877 878 880
+882 881 880 887
+880 797 805 881
+883 881 882 887
+844 112 840 885
+117 872 874 918
+840 843 844 885
+884 885 886 889
+944 928 939 997
+908 907 913 985
+787 783 788 884
+842 865 887 888
+880 863 877 888
+886 885 840 887
+888 882 887 890
+889 0 112 890
+888 887 112 890
+788 783 790 884
+900 899 895 940
+0 783 787 884
+786 783 0 884
+958 119 0 972
+788 806 883 886
+839 790 786 886
+614 616 921 922
+885 786 884 886
+931 15 918 937
+863 0 877 888
+113 899 940 991
+862 0 863 888
+885 839 786 886
+873 192 325 937
+842 862 865 888
+874 798 878 900
+181 182 180 948
+179 167 164 957
+112 0 888 890
+114 788 883 904
+878 877 879 892
+953 119 0 955
+0 896 897 898
+981 975 973 989
+947 942 180 948
+877 891 892 901
+930 203 929 945
+989 981 975 993
+885 0 112 889
+884 0 885 889
+939 914 15 940
+182 181 934 948
 0 950 955 956
-874 918 798 900
-878 900 879 874
-0 885 884 889
-884 886 889 885
-885 887 886 889
-0 892 877 891
-912 915 919 916
-204 166 964 195
-0 896 892 891
-985 983 908 124
-892 900 901 899
-0 891 903 902
-0 891 877 890
-950 177 948 180
-0 898 896 897
-0 903 891 890
-0 893 895 894
-891 901 896 892
-914 928 939 15
-943 117 935 893
+882 891 901 903
+892 899 900 901
+891 890 0 903
+891 877 882 901
+911 800 613 919
+990 914 939 991
+921 922 968 976
+943 15 928 945
+896 0 897 902
+936 893 117 940
+900 918 113 940
+953 949 119 955
+911 789 800 919
+943 118 932 944
+949 119 951 953
+983 124 908 985
+0 902 903 905
+892 896 899 901
+900 895 892 936
+896 891 0 902
+899 895 892 900
+879 878 892 900
+325 192 199 937
+895 892 0 896
+892 891 0 896
+0 895 896 898
+979 0 980 981
+999 0 987 1000
+882 877 878 901
+632 122 907 908
+795 613 800 919
+910 906 114 913
+902 891 0 903
+935 873 117 943
+896 895 892 899
+899 896 897 902
+891 896 901 902
 901 896 899 902
-974 972 0 952
-199 323 937 931
-945 15 937 943
-914 991 992 113
-908 124 122 985
-0 953 952 119
-957 179 167 956
-0 952 953 998
-955 947 950 949
-899 940 900 113
-991 899 992 113
-892 900 899 895
-527 161 596 965
-900 117 936 874
-117 943 940 893
-941 118 996 944
-899 940 113 991
-891 902 901 903
-992 897 984 915
-918 940 113 900
-617 116 618 913
-903 890 882 891
-889 890 882 903
-952 972 120 974
-632 908 122 907
-923 604 911 618
-913 912 906 114
-794 627 910 619
-925 198 363 517
-23 198 926 517
-909 913 906 910
-896 899 895 892
-123 973 0 979
-878 797 882 901
-899 896 895 898
-897 896 899 898
-913 906 907 909
-912 913 911 114
-993 125 992 975
-773 794 793 910
-904 883 788 114
-0 909 628 630
+905 0 902 984
+951 946 942 961
+913 911 618 923
+0 903 904 905
+882 890 891 903
+890 889 0 903
+799 801 795 924
+912 905 114 917
+600 599 616 978
+898 895 896 899
+898 896 897 899
+944 943 118 996
+943 939 893 996
+984 897 915 992
+789 800 793 911
+936 895 893 940
+24 23 19 926
+896 892 891 901
+900 878 892 901
+901 891 902 903
+883 889 903 904
+889 883 884 904
+903 889 0 904
+889 884 0 904
+787 0 884 904
+901 797 917 938
+798 918 924 938
+873 870 933 935
+921 908 115 923
+928 914 15 939
+635 122 632 908
+765 793 800 911
+617 619 116 910
+630 632 631 907
+794 788 793 910
+908 913 912 985
+905 114 904 906
+904 114 787 906
+904 0 905 906
+904 787 0 906
+913 907 906 985
+635 632 115 908
+971 121 960 974
+970 960 121 974
+981 0 124 993
+906 907 0 985
+253 189 190 933
+876 117 874 936
+910 114 911 913
+618 617 116 913
+926 925 198 931
+906 905 114 912
+632 618 115 908
+936 117 900 940
+924 795 798 938
+872 799 798 918
+915 113 916 992
+793 788 114 910
+939 893 894 940
+908 632 618 913
+604 618 911 923
+116 617 910 913
+936 900 895 940
+907 632 908 913
 632 617 618 913
-0 889 903 890
-787 904 788 114
-0 898 897 988
-114 911 789 793
-0 787 904 884
-787 884 788 904
-884 883 788 904
-884 889 883 904
-904 889 883 903
-0 903 889 904
-0 904 889 884
-933 190 934 189
-927 197 963 929
-914 970 969 977
-0 905 902 903
-0 909 907 906
-632 907 630 617
-918 15 113 940
-121 986 0 973
-0 787 906 904
-906 787 114 904
-905 906 114 904
-0 906 905 904
-992 984 983 915
-902 901 915 899
-939 943 893 940
-801 925 363 6
-926 925 24 517
-932 945 873 943
-895 940 899 991
-975 989 981 993
-635 115 908 632
-635 632 908 122
-0 989 981 973
-925 517 363 6
-614 616 921 922
-253 190 933 189
-902 899 915 897
-125 976 992 975
-983 915 984 912
-903 917 904 905
-924 795 801 799
-971 966 0 965
-117 918 872 874
-903 917 883 904
-986 121 977 973
-613 795 801 924
-918 798 872 874
-922 976 916 920
-121 960 970 977
-903 917 905 902
-913 909 907 617
-632 913 907 617
-992 915 983 916
-918 15 940 117
-918 940 900 117
-912 911 919 114
-614 604 923 618
-0 985 907 122
-902 915 905 984
-882 797 917 901
-955 956 950 957
-903 882 917 901
-917 901 915 902
-0 933 934 189
-903 901 917 902
-882 797 883 917
-883 789 917 797
+114 793 910 911
+203 197 196 929
+932 181 193 942
+928 15 930 945
+911 116 910 913
+911 618 116 913
+114 905 904 917
+921 916 922 976
+915 905 912 917
+915 901 902 917
+902 901 903 917
+954 951 944 997
+901 882 903 917
 903 882 883 917
-904 917 114 905
-931 15 930 920
-931 926 930 198
-23 196 926 198
-900 940 899 895
-920 931 926 930
-939 970 990 997
-953 949 954 951
-943 937 873 117
-922 920 916 924
-920 930 926 969
-940 893 939 894
-0 177 948 950
-961 942 932 193
-929 961 928 945
-942 947 180 195
-908 923 921 983
-929 120 928 961
-125 970 914 977
-799 925 931 363
-952 954 997 951
-912 915 917 919
-323 931 199 198
-919 795 938 797
-926 198 925 517
-192 190 932 873
-982 635 908 122
-924 798 918 938
-970 120 928 960
-979 978 123 973
-119 946 947 951
+797 882 901 917
+882 797 883 917
+519 196 197 927
+0 934 941 948
+926 196 23 927
+618 908 913 923
+883 797 789 917
+924 113 916 938
+947 946 942 951
+954 952 951 997
+801 613 795 924
+883 789 114 917
+999 998 0 1000
+925 799 363 931
+614 24 616 922
+965 962 959 971
+117 900 874 936
+968 926 927 969
+925 924 799 931
+177 182 0 948
+945 203 929 961
+0 953 954 998
+0 893 118 935
+924 799 801 925
+900 874 798 918
+15 939 940 943
+978 973 123 979
+967 968 969 977
+920 924 925 931
+797 795 789 919
+908 618 115 923
+897 898 899 991
+926 198 930 931
+164 167 0 957
+600 19 601 967
+918 900 113 938
+912 916 919 923
+15 918 117 940
+919 911 912 923
+913 912 911 923
+942 195 193 961
+940 895 894 991
+924 613 922 925
+962 946 194 964
+634 599 633 979
 914 15 113 920
-920 15 113 918
+918 113 15 920
+161 157 159 964
+604 613 614 923
+922 614 613 923
+911 613 604 923
+926 23 19 927
+618 604 614 923
+325 199 323 937
+969 920 914 976
+922 613 916 923
+943 928 939 944
+915 113 899 938
+196 23 198 926
+613 922 916 924
+922 920 916 924
+613 916 919 924
+900 798 878 938
+801 6 605 925
+6 517 605 925
+801 363 6 925
+6 363 517 925
+363 198 517 925
+922 605 24 925
 924 922 920 925
-605 925 801 6
-605 517 925 6
-115 614 923 618
-970 960 969 977
-893 117 935 936
-912 923 916 919
-0 902 905 984
-945 961 932 193
-912 911 923 919
-115 923 921 908
-969 928 15 930
-936 893 940 895
-923 604 613 911
-916 920 113 924
-924 920 113 918
-323 931 198 363
-931 930 199 198
-918 799 798 924
-924 799 798 795
-193 190 181 932
-24 922 605 925
-922 613 605 925
-613 605 925 801
-613 801 925 924
-924 801 925 799
-799 801 925 363
-901 917 915 938
-613 922 924 925
-0 118 933 935
-938 798 918 900
-916 915 938 113
-972 119 946 958
-927 196 197 929
+924 801 613 925
+930 920 926 931
+113 915 916 938
 920 925 926 931
-924 920 931 925
-925 926 931 198
-121 960 977 967
-194 946 195 964
-161 962 194 964
-927 519 197 196
-927 23 519 196
-926 23 927 196
-19 23 927 926
-19 23 519 927
-19 519 601 927
-194 946 964 962
-964 946 195 166
-600 968 616 19
-945 937 873 943
-946 942 195 947
-943 15 937 117
-951 946 961 120
-921 922 616 968
-997 928 939 970
-951 942 941 944
-964 194 521 204
-947 948 942 180
-926 196 930 198
-926 196 927 930
-914 920 113 976
-959 971 0 965
-945 192 932 873
-0 933 870 935
-192 190 193 932
-161 959 964 159
-972 120 962 946
-944 942 932 961
+925 198 517 926
+198 23 517 926
+925 517 24 926
+517 23 24 926
+927 929 960 969
+24 922 925 926
+204 166 163 964
+159 959 161 964
+920 926 968 969
+967 927 960 969
+926 922 920 968
+976 125 914 977
+19 927 967 968
+616 24 19 968
+944 120 951 961
+946 194 195 961
+929 203 194 961
+927 196 197 929
+15 928 930 969
+978 633 599 979
+971 962 959 972
+997 954 952 998
+945 193 203 961
+194 193 195 961
+944 928 120 961
+198 196 926 930
+198 199 196 930
+203 196 199 930
+928 960 969 970
+969 914 928 970
+929 927 196 930
+927 926 196 930
+196 203 929 930
+901 900 878 938
+901 878 797 938
+873 190 192 932
+190 193 192 932
+190 181 193 932
+941 934 932 942
+124 0 122 985
+181 932 934 942
+118 0 933 934
+195 193 181 942
+958 946 119 972
+0 121 123 966
+949 941 0 954
+878 798 797 938
+959 0 159 965
+180 179 166 947
+879 874 900 936
+935 893 117 936
+945 929 928 961
+325 872 875 937
+873 325 875 937
+117 873 875 937
+875 872 117 937
+199 930 931 937
+950 0 176 956
+161 197 194 962
+942 941 934 948
+119 946 947 951
+958 166 946 964
+918 117 872 937
+931 930 15 937
+931 918 872 937
+919 797 795 938
+919 917 797 938
 924 918 113 938
-947 942 949 951
-0 950 949 955
-166 958 164 165
-876 875 935 870
-0 935 870 876
-0 995 994 1000
-0 934 182 189
-194 193 961 203
-937 323 872 931
-117 875 935 876
-929 197 962 194
-944 943 939 928
-0 935 876 936
-0 936 876 879
-0 936 879 892
-875 325 937 873
-873 325 937 192
-199 325 192 937
-960 928 969 929
-161 962 959 965
-161 962 964 959
-194 962 961 946
-199 323 325 937
-937 323 325 872
-875 325 872 937
-117 875 872 937
-918 872 937 117
-15 918 937 117
-947 942 951 946
-899 900 901 938
-878 938 901 900
-878 797 901 938
-940 939 991 894
-0 955 953 119
-165 959 0 159
-914 940 113 15
-914 939 940 15
-998 953 954 952
-996 943 893 939
-119 958 0 957
-968 922 926 920
-0 955 949 953
-951 941 954 944
-928 943 939 15
-928 945 930 929
-941 934 118 932
-0 934 118 941
-117 943 15 940
-942 947 949 948
-929 120 961 962
-181 193 942 195
-118 932 873 943
-119 972 0 958
-929 945 930 203
+990 939 894 991
+932 943 944 945
+194 929 961 962
+15 928 939 943
+895 894 893 940
+976 916 113 992
+976 975 983 992
+899 900 113 940
+0 176 177 950
+941 949 951 954
+179 164 166 957
+120 944 951 997
+599 634 635 982
+928 944 120 997
+177 179 180 950
+180 947 948 950
+942 180 195 947
+974 970 120 997
+193 932 942 961
+961 946 194 962
+601 598 600 967
+961 929 120 962
+961 120 946 962
+937 199 930 945
 199 203 930 945
-199 203 945 192
-203 193 945 192
-945 192 193 932
-969 930 926 927
+937 192 199 945
+199 192 203 945
+193 203 192 945
+932 193 192 945
+937 873 192 945
+192 873 932 945
+943 932 873 945
+873 937 943 945
+161 527 963 965
+929 194 197 962
+943 937 15 945
+930 929 928 945
+937 930 15 945
+967 600 19 968
 596 161 159 965
-161 965 959 159
-962 120 961 946
-914 977 969 976
-123 121 0 973
-957 167 0 956
-194 929 961 962
-962 197 161 194
-943 944 945 928
-943 944 932 945
-967 963 601 966
-165 958 0 959
-527 963 597 601
-123 967 598 966
-958 972 959 946
-990 995 999 1000
-941 948 934 942
-948 180 182 181
-947 950 949 948
-934 948 182 181
-942 948 934 181
-974 971 0 972
-0 948 941 949
-119 953 952 951
-981 975 124 982
-119 949 953 951
-947 179 957 950
-990 988 125 991
-956 167 168 176
-0 176 956 168
-957 956 0 955
-956 167 0 168
-119 957 955 947
-121 971 0 974
-981 980 979 982
-966 960 971 121
-913 985 906 912
-997 995 990 939
-990 1000 987 994
-952 953 954 951
+983 984 992 993
+636 0 122 980
+180 182 177 948
+596 159 0 965
+194 946 195 964
+194 195 204 964
+521 161 194 964
+959 958 946 964
+951 949 953 954
+977 975 973 978
+987 986 125 989
+119 947 949 951
+988 987 125 989
+963 597 601 966
+947 949 950 955
+947 180 179 950
+949 0 948 950
+950 176 179 956
+944 932 945 961
+949 942 941 951
+944 941 942 951
+949 947 942 951
+120 951 952 997
+994 990 987 1000
+977 973 125 986
+916 113 920 976
+971 959 0 972
+914 969 976 977
+914 939 970 990
+975 973 125 977
+120 962 971 972
 0 954 995 998
-119 947 955 949
-981 975 982 979
-958 972 0 959
-982 980 122 124
-972 971 0 959
-899 898 895 991
-957 179 956 950
-119 957 0 955
-954 996 997 944
-990 999 970 986
-0 949 954 953
-0 941 954 949
-956 179 167 176
-0 906 985 905
-960 120 928 929
-0 176 950 956
-963 197 962 929
-951 942 961 946
-946 195 942 961
-959 972 962 946
-0 985 984 905
-957 164 0 167
-164 179 167 957
-164 166 179 957
-966 598 0 597
-951 942 944 961
-958 946 947 119
-957 958 947 119
-957 166 947 958
-958 166 947 946
-164 166 957 958
-959 972 971 962
-972 120 971 962
-966 963 601 597
-967 927 968 19
-966 971 960 963
-964 959 165 159
-969 927 968 967
-19 968 24 926
-985 912 905 906
-633 978 599 600
-977 969 968 967
-960 927 969 967
-990 995 1000 994
-967 960 966 121
-157 964 165 159
-157 161 964 159
-204 964 194 195
-163 166 964 204
-163 166 165 964
-157 964 204 163
-166 964 958 165
-976 992 983 916
-600 967 968 19
-601 519 963 927
-927 519 963 197
-963 519 527 197
-963 527 161 197
-963 197 161 962
-119 946 951 972
-601 519 527 963
-157 964 163 165
-157 161 521 964
-964 161 521 194
-927 968 926 969
-969 968 926 920
-975 125 989 993
-920 969 15 930
-969 928 930 929
-960 971 962 963
-19 967 601 600
-19 927 601 967
-967 927 601 963
-967 927 963 960
-967 960 963 966
-969 929 930 927
-983 923 916 912
-983 908 124 982
-982 908 124 122
-123 977 121 973
-970 928 939 914
-999 995 998 1000
-970 928 969 960
-914 969 15 920
-914 928 15 969
-971 965 962 963
-914 928 969 970
-971 959 962 965
-969 920 976 968
-634 599 982 635
-599 115 982 635
-990 994 988 991
+953 952 951 954
+954 953 952 998
+953 949 0 954
+952 119 0 953
+15 930 920 969
+940 914 113 991
+898 897 988 991
+994 0 894 995
+986 974 0 999
+902 897 915 984
+977 970 121 986
+616 19 600 968
+0 167 168 956
+929 120 928 961
+956 167 179 957
+179 950 956 957
+179 947 950 957
+956 950 955 957
+950 947 955 957
+955 947 119 957
+955 0 956 957
+955 119 0 957
+956 0 167 957
+902 915 905 984
+970 969 914 977
+958 165 166 964
+596 0 597 965
+164 165 166 958
+957 164 166 958
+166 947 957 958
+947 166 946 958
+0 164 957 958
+164 0 165 958
+957 947 119 958
+946 119 947 958
+957 119 0 958
+959 962 946 972
+942 946 195 961
+166 195 946 964
+527 601 519 963
+197 519 927 963
+527 519 197 963
+519 601 927 963
+969 968 976 977
+962 959 946 964
+165 958 959 964
+960 120 929 962
+194 161 962 964
+119 952 0 972
+973 123 977 978
+527 197 161 963
+962 161 197 963
+197 929 962 963
+197 927 929 963
+929 960 962 963
+929 927 960 963
+19 926 927 968
+926 24 922 968
+161 521 157 964
+166 165 163 964
+959 962 161 964
+527 597 963 965
+597 527 596 965
+0 123 598 966
+920 930 926 969
+967 121 123 977
+929 930 928 969
+960 929 928 969
+930 929 927 969
+930 927 926 969
+975 125 976 977
+991 990 988 994
+966 963 960 967
+966 121 123 967
+960 121 966 967
+966 123 598 967
+598 123 600 967
+997 974 970 999
+976 975 977 978
+122 908 124 985
+634 633 0 979
+968 616 921 978
+978 975 973 979
+973 0 123 979
+633 599 600 978
+965 963 962 971
+963 960 962 971
+963 966 960 971
+963 965 966 971
+113 914 920 976
+962 960 120 971
+121 960 966 971
+990 987 988 994
+984 905 0 985
+0 987 988 989
+902 0 897 984
+960 967 969 977
+912 906 905 985
+991 898 894 994
+635 115 599 982
+599 978 979 982
+908 921 115 982
+115 635 908 982
+921 599 115 982
 979 973 0 981
-616 600 599 978
-976 920 113 916
-971 121 0 966
-972 119 0 952
-119 951 952 972
-980 635 982 122
-616 978 599 921
-634 982 979 980
-0 993 897 984
-636 635 980 122
-977 978 976 975
-978 921 976 975
-922 968 976 920
-125 986 977 973
-0 902 984 897
-982 115 921 908
-982 115 908 635
-975 983 124 982
-992 976 983 975
-633 599 978 979
-121 967 977 123
-633 979 0 634
-633 123 0 979
-967 600 978 123
-633 123 978 600
-978 968 616 600
-921 968 616 978
-975 989 973 981
-0 994 988 987
-125 977 975 973
-124 993 983 975
-990 994 987 988
-123 978 977 973
-634 980 0 636
-0 980 122 636
+973 121 0 986
+968 967 600 978
+600 616 968 978
+983 124 984 993
+915 916 912 983
+988 0 989 993
+0 984 124 993
+987 990 999 1000
+914 970 125 990
+634 0 636 980
+978 921 975 982
 0 124 122 980
-978 975 977 973
-636 635 634 980
-634 979 0 980
-921 923 916 983
-993 992 983 975
-977 967 978 123
-978 977 968 967
-978 976 968 977
-921 976 968 978
-633 599 979 634
-987 999 990 986
-999 995 997 998
-897 988 992 993
-989 986 125 973
-979 981 0 980
-975 978 982 979
-979 599 978 982
-978 599 921 982
-599 115 921 982
-975 978 921 982
-634 599 979 982
-0 988 993 989
-975 125 973 989
-0 954 998 953
-992 897 915 899
-908 923 983 912
-985 906 907 913
-0 993 984 124
-0 981 993 124
-975 993 981 124
-975 982 921 983
-908 985 912 983
-0 985 906 907
-999 974 970 986
-894 994 990 991
-984 992 983 993
+979 978 975 982
+992 897 988 993
+980 635 634 982
+123 121 973 977
+979 634 599 982
+599 921 978 982
+912 905 984 985
+921 616 599 978
+123 967 977 978
+983 912 984 985
+124 983 984 985
+986 125 970 990
+912 915 983 984
+988 898 991 994
+905 915 912 984
+921 975 976 978
+977 968 976 978
+968 921 976 978
+977 967 968 978
+978 123 633 979
+952 974 997 999
+952 997 998 999
+899 898 895 991
+989 975 125 993
+980 0 124 981
+980 124 122 982
+980 979 981 982
+124 980 981 982
+981 979 975 982
+981 975 124 982
+908 635 122 982
+976 921 916 983
+923 912 916 983
+923 916 921 983
+923 908 912 983
+923 921 908 983
+975 921 976 983
+982 921 975 983
+982 908 921 983
+124 908 982 983
+982 975 124 983
+906 0 905 985
+984 0 124 985
+121 970 974 986
+940 899 895 991
+898 894 895 991
+975 981 124 993
+988 897 0 993
+940 939 914 991
+984 0 897 993
+113 915 899 992
+970 990 997 999
+992 125 975 993
+986 987 125 990
+981 973 0 989
+898 0 894 994
+987 0 988 994
+943 893 118 996
+939 943 944 996
+125 975 976 992
+915 897 899 992
+991 113 899 992
+991 125 914 992
+984 915 983 992
+994 987 0 1000
+999 990 995 1000
+994 894 990 995
+998 0 952 999
+941 118 0 996
+893 0 118 996
+893 939 894 996
+987 988 125 990
 992 988 125 993
-125 986 970 977
-986 121 970 977
-974 121 970 986
-0 998 1000 999
-121 974 0 986
-991 939 940 914
-991 940 113 914
-997 996 939 944
-0 986 989 973
-0 986 987 989
-986 989 125 987
-0 995 1000 998
-997 998 954 952
-997 995 954 998
-996 894 995 939
-954 941 996 944
-0 999 987 986
-999 998 997 952
-951 954 997 944
-990 987 125 988
-976 992 916 113
-992 915 916 113
-992 899 915 113
-993 988 125 989
-897 898 899 991
-991 897 992 899
-991 988 992 897
+125 914 990 991
+118 941 944 996
 991 988 125 992
-125 991 992 914
-995 894 990 939
-0 1000 994 987
-894 994 995 990
-0 995 894 994
-944 118 996 943
-996 118 893 943
-0 118 893 996
-0 996 893 894
-0 996 894 995
-0 954 996 995
-0 941 996 954
-0 118 996 941
-120 928 997 970
-997 974 120 970
-952 974 120 997
-951 997 952 120
-951 944 997 120
-120 944 997 928
-997 996 995 939
-954 996 995 997
-997 974 970 999
-997 999 970 990
+991 897 988 992
+991 914 113 992
+986 970 974 999
 990 995 997 999
+998 997 995 999
+990 986 987 999
+954 941 0 996
+954 944 941 996
+0 952 953 998
+893 894 0 996
+995 0 894 996
+954 0 995 996
+894 939 995 996
+944 939 996 997
+996 954 944 997
+995 954 996 997
+996 939 995 997
+990 939 970 997
+970 986 990 999
 974 952 0 999
-0 952 998 999
-1216 2641 2757 2818
-2469 2514 2936 3157
-8 834 188 1220
-3339 4966 3103 4970
-1544 1619 227 1581
-325 1968 1944 299
-3492 3049 3481 430
-5179 5244 5242 5261
-475 1120 2 1056
-1164 1088 2776 2829
-690 335 1254 1303
-2987 2506 2720 353
-1100 1063 33 216
-3368 3053 4123 3190
-3190 3053 382 269
-3677 3719 3668 3611
-2913 3589 3565 3396
-86 58 3788 3904
-2021 2112 1567 1110
-1938 219 1214 2756
-1511 1629 1475 193
-3165 3087 403 3131
-290 3657 419 154
-3755 44 3687 3725
-2515 948 832 1211
-5079 838 809 4938
-599 4080 2018 582
-4089 3887 4079 4119
-789 2556 1174 663
-3777 3553 3875 3946
-2661 308 2800 1115
-1156 2025 1830 2032
-2151 3751 2107 3938
-936 12 872 1150
-4088 461 4131 4045
-1828 2406 2347 2329
-795 961 708 1260
-3751 2307 3914 520
-3941 50 75 569
-3367 3064 3597 3948
-84 1680 1009 1844
-2369 4091 2204 2335
-291 2041 1765 1668
-1188 700 713 177
-23 3046 3668 3068
-4086 1953 2029 1826
-3932 3979 502 3898
-2044 3993 1138 4129
-3517 3120 3051 3361
-3619 2082 3873 3895
-2333 3940 4074 38
-1987 2369 1446 2808
-716 690 1303 1276
-1355 1445 122 1786
-1718 493 1779 1444
-2542 2986 3099 3063
-2477 2727 1998 2516
-673 350 599 4087
-17 86 406 3789
-4830 5233 4892 4914
-752 866 765 732
-1854 1581 1596 1070
-4156 4655 4343 4257
-380 911 2950 298
-1373 1416 1372 862
-3411 3145 3517 3120
-3965 4053 1734 3992
-348 738 1199 762
-4092 535 4070 4152
-4523 4506 4498 4535
-804 936 1094 5076
-2502 390 2697 2531
-2257 210 2170 2310
-3606 3645 3628 3631
-2468 2988 428 2906
-4046 566 1995 38
-2799 2519 401 2805
-895 2907 2999 2472
-2116 4064 2017 4115
-543 4410 4671 4753
-140 1104 1118 138
-3622 2275 3814 3686
-2988 2785 2930 2947
-973 2564 411 894
-1397 40 1415 747
-2188 425 3917 2811
-638 1980 17 58
-4714 561 469 4242
-4065 4151 4187 4185
-3133 3121 3039 3181
-4585 624 1565 1513
-1422 162 1425 1080
-3766 4512 4538 4386
-3289 2846 2993 2870
-4539 3335 4588 4461
-963 776 677 989
-375 2526 1740 2630
-1191 2567 310 2678
-1058 441 5102 4804
-2001 2196 2185 2406
-2112 1618 2312 2103
-603 3929 3962 337
-3469 3304 650 3391
-966 940 1013 990
-858 767 837 982
-1158 3253 161 1121
-370 5123 5100 5265
-576 4341 3975 4323
-145 5114 141 619
-4102 4225 4114 4343
-2861 2835 2684 2600
-2052 2096 2101 1702
-852 814 1207 2675
-603 3758 3929 3952
-2153 2157 2134 1647
-4302 4374 337 4468
-1100 5021 1804 187
-1622 1473 1177 1467
-1501 1878 1848 1204
-2166 1599 1966 447
-1107 3245 3477 3282
-1319 1342 1241 1439
-53 1660 208 1738
-583 1508 584 1709
-867 933 963 865
-769 773 869 754
-3653 4209 3644 3960
-2555 2476 897 884
-874 145 1258 618
-842 632 861 833
-2075 2225 511 2252
-380 2917 2918 2925
-796 2894 902 1020
-462 3247 721 3409
-4327 5147 5156 5065
-3562 3177 3692 3690
-837 786 2854 339
-1346 1345 1314 1162
-1096 80 1168 4798
-2645 2856 2728 2871
-1052 804 80 1096
-108 1005 1278 899
-863 769 754 712
-4984 4699 5055 4879
-1071 214 1309 916
-962 108 128 900
-1661 748 2757 1554
-2196 1994 2185 2173
-3012 2462 2907 895
-355 706 777 646
-1818 1412 1853 1411
-1109 2365 3046 2366
-626 1814 1677 1123
-1122 792 1247 1244
-531 22 435 2077
-1027 4947 4225 4250
-1470 1678 4600 1521
-601 3553 3875 3881
-1521 1672 208 1682
-2117 1644 4019 4275
-1477 1590 263 1410
-1127 105 1023 2771
-1331 1455 4652 91
-1735 1486 1472 4602
-1150 173 872 937
-1193 1160 1069 842
-320 1119 217 1217
-603 3913 3970 4106
-4441 4445 3941 4439
-1831 1635 1848 1204
-2102 3593 4018 1916
-1261 1302 1081 848
-3438 4904 1163 5294
-1008 1066 1071 164
-1840 2217 2048 2179
-1527 1869 1327 739
-4409 4111 304 4420
-1157 43 707 832
-1788 1056 1094 672
-2848 884 1103 2892
-225 187 1756 1804
-1155 395 2700 1937
-4290 4482 4109 1674
-268 3998 3997 1697
-4402 629 4156 4549
-4762 4554 906 4807
-1962 2000 1953 2023
-116 1120 180 475
-1158 2 1121 748
-563 331 2003 3655
-1112 3925 604 3943
-3753 498 2306 3721
-1990 2036 1668 2041
-259 1666 20 1923
-493 4261 1764 1136
-1480 1504 1547 627
-4111 1690 197 1626
-196 1508 1698 1475
-275 1423 1374 4596
-2481 374 2724 1958
-1774 1619 1643 1737
-1797 855 693 225
-1320 1540 1590 1389
-1799 1758 1677 1777
-5077 5325 5094 4388
-5048 1797 1762 1801
-1906 1759 273 2177
-1372 1362 1363 851
-1496 158 122 1749
-3927 4480 2033 4448
-72 2266 2338 1714
-3066 3591 3693 3397
-2980 3052 426 3032
-1419 316 2960 3006
-144 1308 1047 1051
-4891 1425 1012 4919
-12 1387 1328 1778
-166 1101 1218 2608
-1394 1544 1465 227
-19 2688 363 2755
-2057 273 1369 2155
-2158 1532 510 246
-3443 3245 438 3494
-2377 1822 2809 2001
-2172 2069 2142 1585
-201 180 1815 1796
-1531 1616 1520 1234
-218 4 1177 1487
-4125 4116 490 2010
-4317 1117 824 1795
-1831 1390 1344 1340
-1719 583 2098 2111
-3055 2352 684 1608
-3824 3827 3795 3823
-1186 701 1195 1157
-1201 1049 1240 758
-2690 1954 2700 1977
-2415 457 2465 2394
-2053 2259 2270 509
-3679 4022 669 551
-1176 763 1196 1210
-1590 1540 1205 1537
-511 2217 2193 2224
-1710 2401 1937 2189
-3700 2367 3698 3731
-3381 3538 728 3419
-1398 1726 221 1725
-4406 4262 4358 4412
-321 2950 2955 2936
-321 2945 2955 2946
-3681 4171 3670 4205
-3972 3286 4235 4078
-3240 431 4150 4244
-3622 2072 2318 3686
-1346 999 1312 1314
-1764 4176 574 4261
-3536 3104 3524 3546
-2564 2854 303 846
-1651 1087 1640 1653
-1539 1704 193 2129
-3104 479 3527 3530
-512 2283 2110 330
-4147 3086 3069 3681
-1390 1524 1389 160
-1781 510 2123 2131
-1715 4095 3718 2338
-326 2268 2075 1212
-782 4930 5206 3196
-183 4010 4004 2107
-14 3741 1732 3333
-3925 3996 3932 3943
-1330 1007 1617 749
-1714 1986 1609 2063
-1932 206 220 2146
-1200 1540 1562 625
-1343 277 198 4601
-2037 2121 1578 2161
-275 610 1343 1452
-1228 960 1106 1418
-724 3231 2701 4824
-658 3463 2872 3450
-3826 3818 3838 4038
-2030 1143 2054 2031
-2227 2273 486 504
-2260 3853 3903 3845
-2524 4992 4972 1085
-1266 1162 336 1382
-1724 2006 2702 1975
-2511 296 2954 2946
-2879 2378 2969 2535
-1971 22 3331 482
-42 1677 750 626
-5056 4801 4785 4393
-4322 4509 4737 5080
-2884 2540 353 2472
-2586 2657 2574 2467
-288 2772 2953 2917
-4254 3449 1792 4858
-321 2925 63 2631
-5 2181 1213 2455
-2292 1989 2320 2290
-5183 1129 1171 1097
-359 1830 1959 1555
-2332 257 2856 2643
-176 3318 4073 1698
-2773 352 413 372
-513 2212 2234 2226
-2393 2464 2501 2427
-1965 2012 2788 30
-2251 2024 2225 2060
-797 2636 2605 97
-2747 1164 1084 2767
-2066 1916 2067 1686
-1931 1759 1929 1568
-2288 2174 1766 2137
-1873 1591 1931 1560
-213 1829 2927 2931
-2169 1223 1847 1817
-1941 1915 2485 2487
-1568 1928 1832 1950
-891 166 1086 364
-3150 249 248 298
-2779 2378 1964 2789
-1998 2368 1419 2380
-1926 1928 1886 1566
-5 2495 1940 3025
-3792 2322 1662 266
-2610 2594 1044 2585
-2775 3301 1822 2529
-3665 3074 454 3710
-2390 261 2080 371
-386 3690 532 189
-2973 3044 3111 3154
-3697 903 2509 3294
-5111 4820 5117 4916
-1199 1265 1190 10
-967 1266 949 286
-101 115 3963 2168
-3291 3301 3308 662
-914 766 136 846
-2380 372 1419 366
-2986 2798 2956 3077
-3982 1112 604 4026
-859 2527 2718 2572
-1608 2353 2352 2820
-409 3188 2964 2810
-2354 3657 3807 541
-894 2328 745 2634
-682 1242 67 1295
-2770 2919 2893 2934
-1138 3275 57 367
-2499 2486 1941 2696
-305 2286 368 2405
-294 11 2794 3015
-752 472 731 795
-949 149 1148 1272
-773 963 776 869
-1409 2030 2095 1143
-829 905 2505 2497
-825 2816 2401 302
-3341 5195 5158 1036
-3365 650 3406 3140
-378 1608 3271 2220
-861 2666 219 2721
-320 1217 1395 1150
-1325 2771 2823 1130
-340 3005 2479 2890
-3673 350 4134 4087
-413 2429 352 2337
-3017 2726 2479 2395
-106 5308 5295 5322
-330 2224 2308 1840
-3005 305 340 3018
-3137 3411 3399 2680
-199 2525 2400 2718
-2897 897 96 923
-1975 450 2006 742
-2428 2309 1924 2454
-2879 3270 2896 362
-2563 393 2595 2569
-131 2904 2952 63
-532 3071 547 3693
-14 4059 3614 1732
-2543 1757 2607 698
-2253 2145 2281 2103
-2829 1914 2886 2866
-3630 331 3669 3689
-2511 2510 2772 2553
-2873 2664 1834 2579
-2544 2589 822 2557
-71 2456 391 2532
-390 2730 2592 2490
-911 2935 2545 1090
-2553 2544 822 379
-2534 2651 2605 2567
-1215 2765 1939 181
-2764 1145 1129 1088
-3141 3499 3097 3117
-3332 2494 3428 3073
-2968 714 3155 3119
-2475 2906 427 895
-2784 76 484 2786
-2668 2591 2753 2708
-3087 21 2609 3146
-3986 2151 3990 1971
-3399 3496 3487 3517
-592 577 3636 58
-3375 3374 3166 680
-2245 1912 2437 2465
-2810 2940 345 3131
-1181 1274 1249 1872
-854 905 745 83
-3724 3306 3379 2869
-2380 368 305 2941
-430 3460 3200 3470
-4102 4359 4344 1503
-2006 2666 2832 2551
-2008 3115 2335 2477
-1829 2406 2001 2931
-4042 22 3331 4083
-3736 3770 1140 3753
-1984 2029 1446 1987
-3842 3916 3780 3891
-2054 985 1990 1633
-2585 2672 539 702
-85 3840 3994 3822
-2528 212 3044 3111
-400 2472 2905 2540
-2889 74 2947 2547
-2546 2490 2586 2467
-3465 6 3126 414
-525 4765 540 252
-3482 674 3375 2838
-501 3293 3308 3321
-3396 3589 3623 3408
-3393 1707 2087 154
-1057 755 3358 4990
-3695 2942 3714 2367
-222 3460 3470 3391
-3950 4181 4179 4291
-1757 1918 1209 2753
-98 4711 4936 943
-2923 3134 3511 3145
-3096 3184 3058 2843
-3077 2982 3052 3062
-661 956 980 4748
-4060 4283 4254 950
-119 1637 2172 2152
-3740 2273 1405 505
-2376 1964 2005 2378
-376 917 2830 2660
-2620 456 2839 2663
-563 3584 2003 2305
-3483 3042 3594 3567
-329 3736 3753 3761
-2664 2887 2725 2912
-451 2713 883 2600
-2237 2461 237 2434
-718 751 784 743
-1440 4434 4397 2091
-547 1972 1963 3605
-4095 34 2342 1715
-3156 133 3324 2758
-5196 904 3214 3261
-4277 3327 4800 3344
-2551 742 878 2704
-3341 5142 5195 3210
-4887 3405 4240 726
-5064 4935 5306 5328
-4842 87 3435 4906
-741 874 704 933
-709 794 771 744
-702 807 803 354
-5341 5309 5344 5335
-3644 3920 3934 3653
-187 8 1086 891
-3758 3981 3939 3951
-1963 3637 3604 3086
-3726 3065 2379 3696
-3481 3492 3245 260
-4712 3319 952 4890
-2783 3156 714 3211
-3833 695 290 694
-1744 1763 1863 1548
-2050 1983 1446 401
-3077 3059 3186 3063
-283 3799 559 3786
-3136 3522 3106 3201
-4410 4505 4121 4245
-4124 3300 4832 850
-4228 4041 1987 228
-1393 1465 1700 1486
-4476 4481 4487 4390
-194 1443 1806 54
-3122 4967 4960 3082
-2061 2195 1962 1953
-3574 3107 3583 3092
-3729 3754 3696 4020
-191 3813 3735 1510
-586 3273 4264 4164
-3779 3842 3641 3855
-3267 3309 433 2015
-3999 3949 4039 46
-4334 4025 4013 4047
-3682 283 559 1510
-448 2248 2319 512
-2206 2288 2452 1663
-3863 2021 2104 1618
-569 598 4483 4139
-2086 238 1823 1125
-1645 221 2124 264
-1746 2193 130 242
-505 261 2321 2343
-2048 2242 306 2217
-1609 2230 2173 2426
-5216 3242 2898 658
-2609 1659 3188 3091
-3066 3688 3630 3760
-1230 764 718 743
-3933 3818 3826 534
-3683 37 4119 3798
-4106 3947 2356 3908
-4198 4181 3336 4298
-4553 1102 4400 4557
-2020 1830 2815 1156
-3240 3303 586 431
-3319 3296 1502 3349
-3961 4274 600 4520
-1406 634 628 1557
-4373 4108 590 4084
-3178 4542 4531 4543
-3393 3833 154 2366
-3655 331 381 3691
-4252 3661 4390 4236
-3651 519 3946 3850
-68 3920 3101 3934
-3669 3281 3630 3728
-2010 4116 643 2016
-573 606 1784 4515
-1175 424 2556 657
-4701 4236 4164 431
-346 3727 3810 3662
-3830 3640 3796 4064
-4752 4522 1316 79
-3910 3744 3996 3984
-3783 3782 3759 3549
-2091 4525 1440 1400
-3075 460 381 2938
-1453 567 4295 4056
-739 1436 1407 1431
-705 2687 4842 3345
-239 3285 4045 4099
-2613 2300 2337 3706
-3924 1973 3797 1730
-2287 3621 3667 3757
-3920 3762 3673 4042
-4183 4023 4145 3675
-3653 2364 1706 1673
-2613 3713 3706 3034
-504 3769 3813 486
-3646 3856 3897 3845
-87 3439 3435 2806
-3894 3720 4438 4051
-3576 564 452 189
-3617 1113 563 3886
-3050 3514 3298 3142
-2099 4010 75 4002
-3763 1126 548 4335
-2083 3636 3885 3767
-4440 38 4046 508
-3158 3241 3454 726
-1782 4522 1335 2027
-4293 4471 4455 3831
-4542 4502 4531 538
-255 4011 1326 3800
-1393 1331 4650 1352
-1708 4096 4176 107
-591 3849 406 597
-3865 3767 2191 3779
-2018 1973 2053 2065
-627 1504 1516 1611
-1842 1719 1449 2098
-26 1703 4009 4082
-1475 123 231 1722
-2066 123 1701 1686
-4305 4398 1727 4170
-4851 3449 499 525
-4175 4214 4291 4465
-1012 4650 880 849
-3384 3387 665 4220
-529 2017 3640 4504
-3921 577 592 597
-406 3862 591 3788
-4152 4253 4362 4370
-4237 1479 4511 4386
-3767 3847 3919 1484
-4945 4234 4112 3447
-591 577 1980 3844
-508 1997 847 695
-1823 57 26 4082
-4472 527 4451 4521
-3856 157 3816 3790
-4287 4823 3030 4692
-167 113 101 3926
-3871 4040 190 342
-3754 3755 2077 3729
-538 4502 4218 4472
-3266 5247 906 4857
-4533 4170 4398 4361
-4520 4274 4386 4571
-1469 4383 1481 277
-5041 4932 4351 5051
-3830 3910 4003 3983
-5165 5146 4277 4112
-1526 1452 1031 1516
-3983 3984 3999 3951
-4444 1126 4195 4360
-2127 1658 2113 2272
-128 945 827 1081
-108 801 979 899
-1313 690 1268 678
-1396 1227 1462 1328
-4405 4512 4511 4499
-3161 3329 681 660
-1514 1469 90 4560
-1200 274 1593 1320
-1072 1841 291 152
-1564 195 580 1594
-528 1357 1606 1525
-4313 4109 2381 184
-3993 4404 4279 4324
-1227 1401 689 1462
-676 129 1105 1166
-1277 1293 1305 1268
-1407 1360 528 978
-4428 4590 4510 4583
-3214 3222 904 3270
-4450 641 3930 4489
-1717 86 2260 3900
-3913 3849 3921 3962
-4638 4660 4635 4403
-3969 3983 637 3640
-3433 3437 4906 4871
-2008 3115 2011 537
-3266 5289 4762 906
-3329 3333 681 3362
-1272 1298 1040 149
-1331 1455 1394 1465
-1455 1545 1497 1523
-3717 1675 4524 4414
-3446 361 3248 102
-4546 3766 4534 4513
-1074 4805 4789 5233
-4556 4575 655 4561
-4508 4565 4555 4754
-4513 4538 4534 653
-3408 3389 3414 3407
-732 539 765 702
-515 3144 280 5215
-4301 5338 4941 3434
-3355 3430 623 4832
-4845 445 4393 4763
-2504 338 2293 2317
-737 28 756 765
-903 2846 3305 3294
-3234 4853 3371 589
-4913 4836 3451 4816
-3176 796 5097 3264
-4048 4368 1943 3958
-1707 2087 239 4099
-4211 3415 3372 1673
-1771 1367 1441 1421
-5173 178 1104 2637
-57 1823 2021 1110
-3471 3504 2948 432
-1381 4589 4204 4782
-2832 861 1101 632
-865 927 925 95
-682 1254 697 620
-4060 950 3084 3614
-3486 2937 725 407
-623 645 3190 850
-348 678 1305 1232
-4990 5201 3358 5016
-4722 685 232 3276
-4959 2010 2784 684
-3477 2633 3475 3429
-5170 3226 5239 5098
-5076 4937 1788 5144
-1351 1428 1064 631
-620 1250 10 52
-777 1275 1035 783
-1209 2543 2707 2678
-1661 1158 201 1135
-3179 482 1971 4075
-3960 4139 598 482
-3226 3035 5098 5150
-890 1277 678 1313
-1584 383 948 1184
-5289 3196 5058 5321
-43 1187 1752 832
-1201 1202 234 1208
-732 424 657 472
-969 1197 994 977
-874 774 470 945
-3240 3371 4714 550
-890 1283 149 1280
-851 1184 948 177
-712 779 36 1237
-743 471 720 1297
-3104 3546 3526 3508
-3950 4179 4455 4471
-793 708 142 744
-43 2571 723 1185
-481 3123 399 3205
-5171 2825 786 766
-1300 1311 52 1235
-719 741 771 733
-518 751 784 458
-720 717 738 771
-784 719 1242 709
-3324 133 3354 5166
-5243 3409 3243 3035
-1188 833 842 713
-1017 3257 279 3225
-3377 680 3204 3503
-467 3406 2782 570
-3389 3491 3457 3387
-3455 3545 245 3506
-4460 4374 3922 3930
-790 2653 789 798
-752 803 863 354
-2610 702 657 60
-751 717 794 780
-1275 1251 1261 941
-858 973 767 993
-3386 3462 3488 3426
-789 869 866 663
-719 874 67 761
-1538 175 549 1098
-1647 1007 1533 1634
-717 470 759 823
-465 376 917 868
-518 794 458 709
-471 712 770 779
-411 802 886 347
-952 1502 5164 5005
-1875 84 1901 1418
-146 188 1833 1220
-1652 1556 271 1294
-1801 1762 1765 291
-784 733 458 718
-354 812 731 60
-2644 817 2852 2650
-142 125 823 759
-1077 5036 838 436
-663 1262 769 803
-899 848 857 1261
-1186 235 1417 1053
-754 774 741 770
-799 5147 810 970
-762 774 770 738
-1284 761 67 1265
-2397 896 240 2439
-518 780 778 795
-60 663 803 657
-5060 2824 715 339
-104 735 2849 977
-3224 5150 3260 924
-756 1082 125 142
-744 759 771 761
-471 717 719 770
-1856 1544 1774 1700
-1259 125 775 356
-775 759 761 704
-1269 773 774 945
-356 95 983 987
-149 691 1255 1307
-794 764 780 793
-708 744 1296 1284
-733 812 778 764
-4608 1096 1003 1014
-4942 882 267 4288
-691 941 1042 1307
-718 751 720 458
-1536 1653 1651 1652
-5187 715 2855 136
-3229 5046 5145 5003
-5224 5226 5256 5215
-987 730 28 737
-927 875 987 730
-2648 2724 2575 1958
-1291 1211 1257 153
-778 795 863 712
-778 471 733 743
-764 354 793 36
-2834 667 132 5186
-2626 2709 310 2678
-974 2634 730 866
-930 760 968 865
-857 920 990 1049
-619 900 942 988
-745 2611 852 2328
-765 756 731 472
-836 70 140 4350
-2650 2578 887 2635
-2571 1752 2716 2543
-472 918 1262 961
-3164 3236 3214 2834
-5082 25 5033 4965
-760 858 1016 856
-1247 1292 999 1235
-752 780 863 823
-5172 3217 2704 2759
-112 820 2647 896
-1951 2648 2575 2790
-1146 2647 1752 1187
-753 2656 2655 2665
-3381 3550 3505 3569
-2526 2557 2630 2489
-1191 2439 814 2674
-1175 1207 2653 2556
-2910 393 389 2443
-867 812 754 741
-4315 1947 1136 229
-1915 359 2487 1555
-1197 2505 1188 829
-618 964 900 988
-1198 860 1147 875
-860 358 826 1187
-1862 1893 1204 1378
-1263 862 1279 1324
-177 700 24 1210
-723 129 2662 2603
-1056 2 2580 1077
-2968 3195 3198 2895
-872 804 1052 877
-914 136 881 104
-25 755 5033 5091
-5286 5121 3338 3451
-1937 1753 2700 2565
-893 5004 5155 5007
-723 129 165 959
-5107 5101 5074 3081
-2476 2552 901 2619
-1388 1593 1424 1531
-339 2643 257 894
-598 3762 4168 3644
-988 892 757 171
-4675 4647 588 4349
-4060 489 681 4837
-1252 207 707 1157
-2604 112 802 2606
-916 1073 943 1255
-875 411 860 886
-1120 5081 201 1158
-810 992 940 968
-757 800 1001 1041
-970 735 104 810
-2489 343 2629 2599
-854 829 828 1196
-2688 676 363 129
-1264 64 1273 831
-812 731 142 793
-1246 915 983 892
-124 799 677 974
-867 798 737 60
-124 866 869 823
-1171 742 2704 1097
-737 356 867 125
-3232 3236 2583 2992
-4761 4793 3803 4309
-33 1000 836 164
-2844 2566 883 2576
-738 470 128 704
-975 854 828 790
-943 916 1046 1058
-1000 5102 836 1058
-465 883 2835 2566
-5229 4893 5248 4162
-4891 588 1317 4349
-5028 837 5175 982
-5292 782 4239 5135
-878 935 456 873
-179 127 2897 2915
-2493 2855 2728 2856
-854 745 1207 2653
-2651 2640 2635 805
-1977 2508 2638 2743
-2793 2981 2890 2980
-706 1312 697 1306
-936 475 320 1094
-989 864 920 848
-1096 4939 841 4608
-846 347 83 971
-400 2975 77 148
-1207 814 1196 763
-127 2573 375 901
-2589 2639 2867 2847
-141 619 1001 757
-145 962 801 827
-844 897 923 2598
-2834 2583 2877 132
-3114 664 2843 333
-3280 636 463 2200
-358 411 2564 2568
-644 185 607 5324
-2619 2570 2582 2863
-2844 2562 2576 2491
-2635 2552 2640 2627
-2711 2933 2911 2958
-392 3233 63 2631
-5177 5096 3229 5162
-1413 1383 4643 4670
-339 970 837 4327
-1201 1202 864 920
-1026 876 144 853
-450 935 742 1914
-807 2672 1043 1291
-4680 938 1034 4704
-892 915 991 800
-4987 1027 5056 4708
-3268 2376 2535 2921
-2582 375 2628 901
-768 1139 2826 2874
-677 992 968 989
-1004 1018 965 966
-974 790 975 677
-4882 1608 4841 2220
-1071 1079 1008 1391
-962 5116 942 799
-1542 1229 1861 2019
-1035 1042 1004 1046
-470 962 964 124
-3334 2117 1644 3283
-917 2713 883 2841
-33 1100 891 70
-1152 1066 164 1050
-919 4689 1032 1067
-1415 1285 1332 1322
-856 103 1016 998
-783 734 1041 1048
-930 968 979 801
-876 441 1035 853
-1011 5038 4962 5035
-704 775 964 618
-1132 1240 1245 1201
-2723 2715 2752 2712
-698 24 1122 707
-336 1312 355 1162
-446 4362 2974 679
-1812 1776 997 4674
-480 746 1960 5010
-1179 972 1026 1073
-4734 1381 4752 4782
-4233 3009 1085 4719
-445 4829 4833 4917
-1171 1145 2787 1975
-1014 982 1168 995
-1193 842 2689 1142
-278 1373 1159 1324
-36 807 1237 1293
-145 930 900 933
-964 356 124 95
-933 945 963 827
-926 4683 1059 1003
-1001 998 926 103
-1483 336 1270 1336
-799 925 856 942
-1055 703 976 995
-760 914 858 971
-974 970 973 894
-1063 1000 953 4667
-971 975 83 735
-798 865 927 971
-927 875 973 993
-1013 969 1054 990
-2642 767 703 995
-1205 1436 1497 634
-942 998 5113 619
-4393 4808 4796 445
-4482 4552 4764 4639
-1015 104 881 958
-864 986 1281 776
-1243 1284 1250 1265
-1222 423 1221 1969
-983 987 1147 1203
-776 790 986 789
-848 827 801 989
-95 892 925 988
-103 991 976 800
-992 920 994 990
-856 925 993 991
-992 735 994 975
-993 1198 703 991
-977 958 969 1167
-1018 5141 1005 4936
-1646 951 1359 4314
-979 940 5138 966
-254 811 1277 1311
-872 877 1026 972
-899 966 1004 857
-4810 1128 5326 1010
-965 781 1060 1013
-932 1005 926 1001
-1004 996 141 1035
-5102 5105 4350 5014
-1414 740 271 1556
-173 929 1680 1396
-40 1079 1322 1178
-3228 1728 1002 5077
-4609 1022 4825 944
-588 215 4652 5020
-103 1014 1003 976
-1015 958 781 1013
-1016 982 5149 1014
-810 1015 5148 940
-3221 3258 5085 724
-996 4683 926 4746
-5014 4729 4804 5103
-1129 1088 2886 132
-5211 5161 2679 4897
-1011 4568 4676 5039
-161 4974 5015 3253
-4731 4718 4792 4703
-1839 1744 1855 1341
-1071 1000 916 953
-155 4639 5057 921
-2401 2641 1937 1949
-5201 5168 3210 5044
-5336 4835 1037 5223
-1526 614 1430 1547
-1034 938 4656 4731
-1050 1152 1069 1118
-4622 919 1032 4902
-932 943 1005 691
-3438 1163 360 4243
-5009 1030 5023 5185
-1946 1873 1226 2744
-5263 5231 5010 4308
-1280 646 1279 1239
-941 857 1042 1049
-783 1041 932 1047
-1262 1174 1289 918
-2675 2585 1175 327
-1047 1051 1053 1061
-876 1047 932 1059
-214 1042 1046 1045
-1240 1251 1239 941
-235 800 1041 1053
-937 1033 1061 1052
-1066 1420 214 1045
-836 140 1050 1060
-1049 758 1054 1045
-1053 1055 976 1061
-1054 1160 969 1069
-8 5033 834 178
-1121 1131 1077 436
-876 98 877 1059
-1046 1058 1060 965
-1059 1052 1061 1003
-1045 1050 1054 1060
-4356 5077 4551 1728
-4603 972 12 1387
-1463 689 1429 1406
-2677 1813 1466 1144
-1334 1051 173 937
-938 4670 4703 4679
-4776 4767 4717 4527
-1033 165 1055 1105
-1853 1533 61 1634
-929 144 1026 173
-1135 1661 1216 626
-953 1339 5032 853
-4847 4892 652 4811
-4646 4699 4821 5055
-1573 1639 1879 1819
-834 1057 2787 755
-1634 1650 1843 1819
-929 1310 1009 1392
-1428 1497 91 1433
-1258 1190 618 171
-769 1282 1237 1262
-1923 1637 2152 2093
-1155 1710 2554 311
-285 4268 4975 955
-1687 475 1219 320
-1612 1532 1506 258
-396 9 1020 1679
-1257 1176 1208 1210
-3233 392 3038 3265
-3227 1170 5098 5095
-2790 1951 2384 2970
-3319 3283 4712 3276
-70 891 1104 178
-5068 4931 3081 5137
-781 893 140 138
-301 2360 868 3216
-1410 1407 1380 739
-4250 3346 4947 4163
-12 4977 116 936
-2692 676 217 1119
-523 4607 3057 4337
-2522 1880 1740 179
-80 1094 1119 672
-1069 632 1167 1118
-278 1161 1361 1332
-120 3395 3429 3312
-5144 4995 5047 1788
-3659 4120 3372 151
-2342 2285 673 18
-2279 3680 3819 3820
-3775 190 342 3838
-3576 3649 564 3631
-3337 4967 4395 4960
-2593 30 2771 1127
-2979 2509 2803 2956
-229 2012 1965 1765
-1033 1119 1105 80
-1118 166 1101 1104
-187 5082 855 8
-188 1057 105 1130
-948 153 1323 1252
-1800 1685 152 1816
-3752 3403 4184 4154
-2324 509 2285 2079
-567 3796 616 4276
-1135 161 1571 1115
-1002 3213 5327 4986
-5182 396 301 1020
-1529 1121 365 1131
-1130 1145 1057 2764
-1267 1246 1301 946
-1996 2363 2300 3629
-1814 1936 1578 1927
-1072 693 1762 1127
-194 1806 824 1154
-1947 4282 1984 1983
-3991 1225 350 47
-2758 924 3409 3035
-4089 420 1942 3595
-2293 3267 3307 3111
-1238 959 2693 1185
-1222 357 1921 282
-1554 1925 1559 1065
-396 1131 957 2560
-2497 2636 2705 816
-1202 828 1176 986
-1270 355 1299 1337
-1861 1884 1769 1886
-33 364 1385 164
-1569 1736 4598 1384
-1217 1033 1153 937
-1173 1152 1193 1368
-2054 1136 2031 1947
-181 1084 2539 1215
-1221 31 524 2049
-851 234 177 1208
-693 855 105 188
-1323 1318 1181 960
-1186 1195 1055 165
-1106 1345 1162 1272
-286 137 949 1161
-1036 172 5120 5118
-311 2560 9 2830
-1166 2616 5176 2792
-632 2223 1167 1165
-1166 995 1105 1168
-138 1167 958 5174
-5211 2791 5184 5045
-1091 3261 3243 5196
-301 957 2007 868
-1395 1687 1772 1888
-1894 1153 1217 2488
-1203 28 2397 1043
-2610 1044 821 539
-1203 240 1147 1089
-227 117 1366 1480
-1844 1429 1009 1182
-1391 1339 1427 953
-1380 1340 1410 1390
-410 1159 1321 1228
-1327 1178 1338 1431
-4218 4108 4084 4472
-707 1238 698 1185
-1184 1142 2607 713
-758 234 1160 1362
-829 1196 816 700
-1195 826 723 43
-1193 1362 1363 1368
-335 1269 1081 1302
-2515 820 2647 97
-1257 1245 1244 1208
-1189 165 1153 959
-1218 1220 1724 2702
-234 1197 1160 1188
-860 896 1187 240
-1198 703 1195 826
-994 1197 1202 828
-67 1258 1254 335
-1589 274 1388 625
-915 235 946 701
-915 1198 701 1147
-986 1174 1176 1289
-830 169 1865 118
-241 978 1342 1360
-1681 1214 2723 2539
-112 896 886 821
-1192 701 1157 1089
-2601 440 2708 692
-1089 240 832 1211
-2439 24 1210 792
-2118 2269 266 2040
-299 2450 1820 2453
-2612 2762 19 1206
-1155 2762 395 2766
-2593 1841 1072 0
-166 1152 1173 364
-1219 217 1194 1233
-1086 1218 1220 1813
-1219 2 748 1194
-1633 985 1156 2050
-985 2059 1852 1143
-317 1851 1599 2166
-1592 1454 2182 2232
-1138 3836 3275 4404
-1930 1918 1038 2691
-1391 631 621 1427
-1181 278 1361 1872
-931 1404 1819 1843
-1242 1260 518 1297
-1336 1361 1338 1327
-1305 1268 1295 682
-2608 1938 1218 2677
-226 1344 1315 1552
-716 811 1276 1263
-1250 1243 1286 1293
-708 1243 961 1082
-1363 1142 1897 1184
-1048 1040 1273 1298
-946 1048 1273 235
-1357 121 1360 1403
-1230 720 348 1297
-1237 984 1236 1282
-153 1264 1252 1192
-1267 946 1264 1192
-1132 1281 1302 864
-153 811 1318 1263
-1848 1274 1390 1253
-1610 410 1576 1902
-1268 984 690 1236
-1301 734 1304 1048
-1122 1372 851 1244
-1869 1878 1380 1248
-678 1199 1283 10
-1299 777 853 1309
-1330 1617 1573 1520
-792 1290 1192 1089
-128 1278 1199 1081
-1269 1282 773 1281
-1305 36 1230 1296
-734 171 1278 757
-756 1043 1082 807
-831 1247 1235 1264
-862 1263 1245 1244
-984 1269 762 335
-336 1321 1346 286
-1287 1132 1276 1245
-633 1250 1232 620
-1259 775 1265 1190
-1434 967 1148 1338
-1317 1426 4891 1387
-1332 646 1161 355
-1240 862 1416 1239
-410 1438 1248 1869
-1283 1278 691 734
-52 1286 1267 1235
-697 999 633 1313
-1258 141 1275 1261
-1040 1345 1300 831
-1304 706 1300 1040
-1246 1288 1259 983
-1082 1259 1243 1288
-1254 1275 706 1304
-984 779 1295 762
-1298 939 1860 1308
-1236 1287 1276 1292
-1286 1288 1267 1290
-1282 1281 1287 1289
-1043 1203 1288 1290
-1291 1287 1257 1289
-1292 918 1290 792
-811 1291 1293 1286
-1292 961 633 1236
-1468 749 1615 1580
-1284 1296 1232 348
-779 1297 1260 1295
-1296 709 1230 1242
-1239 646 1285 1307
-1148 1255 1333 1310
-1280 1306 716 1279
-1132 1302 1303 1251
-1301 1190 171 1246
-52 10 1304 1301
-1303 1283 1280 1251
-682 633 1260 1232
-1314 1311 890 1300
-777 783 1308 1298
-1309 1307 214 1285
-1310 1308 1255 144
-1322 1309 1299 1079
-999 716 1313 1306
-254 890 949 1314
-1277 1311 620 697
-1306 137 1312 254
-1234 1320 1593 1403
-543 4758 4392 4497
-1809 1352 880 1271
-1159 1247 1346 1324
-1357 1375 121 1595
-625 202 1315 1589
-1266 1500 1181 1382
-1009 939 1337 1310
-1610 1122 1159 1874
-1318 831 1345 960
-1529 365 2818 1967
-574 2000 2023 2383
-175 1636 1231 1182
-1385 621 1656 216
-4647 4675 5029 4351
-1530 271 1256 1652
-647 1459 162 575
-939 1272 1106 1337
-1392 1433 1339 1299
-1397 1368 1420 1066
-571 4525 4572 4547
-1382 1231 967 1348
-1322 1332 1338 1148
-1182 1231 1270 1337
-1179 1425 1073 1333
-1180 1605 1552 230
-1025 1525 1394 1458
-121 1545 1205 1562
-275 277 1512 1430
-230 1589 1520 1234
-1324 1279 137 1161
-1266 1318 254 137
-4282 2383 1984 4228
-1500 1527 1336 1483
-1883 1891 1905 1354
-1590 1360 1403 1410
-1392 1433 1429 689
-1810 1459 575 1317
-1622 1586 1467 1587
-1884 1349 2742 1919
-1726 1569 1672 53
-1520 1388 1468 1531
-628 1319 1241 1597
-1432 1565 4613 1495
-1723 1631 1771 997
-634 1205 1350 1241
-1382 1228 1106 1231
-1189 1186 207 1417
-1898 1189 1238 207
-4895 4869 4864 4877
-2071 2139 1766 2097
-1177 1473 1471 1451
-671 1670 1445 1450
-1435 1153 1189 1334
-220 1887 1639 2154
-1865 1650 1605 1831
-1464 1512 4612 1492
-207 64 1252 1874
-1418 64 1874 960
-1430 1478 1490 198
-1523 1319 1487 1545
-1457 1688 1515 4613
-4673 4624 4348 4604
-1883 830 1858 1900
-3167 4488 2033 4222
-1253 1550 1098 1180
-4525 1400 675 954
-1321 1361 286 1336
-913 4621 1448 4548
-1445 1151 4599 1670
-1150 1396 1395 1328
-4551 4919 4986 5072
-216 1427 1271 1063
-1356 1200 1522 845
-1589 263 1540 202
-230 1248 263 1180
-929 1392 1227 1179
-1079 1333 1351 1391
-575 2922 491 1776
-1341 218 647 1523
-1385 364 1172 1889
-1385 1008 1632 621
-1334 1680 84 1435
-1532 1683 246 1654
-1587 1580 1625 1623
-4001 546 1381 1509
-631 1422 1428 1458
-4482 4109 4310 4741
-1315 1350 1241 1552
-1229 1861 1879 1893
-448 2228 3733 3773
-1407 528 1456 1064
-1098 634 1406 549
-1518 4559 4615 4599
-2169 2147 357 1713
-160 1350 1180 1098
-1551 150 1864 1542
-1760 1755 150 2149
-4653 4631 4662 913
-1640 1647 1530 1007
-1860 84 939 1418
-1273 64 1417 1860
-758 1420 1416 1362
-747 1415 1373 278
-323 213 340 2538
-1417 1051 1860 1334
-1793 671 1805 1450
-1401 91 1459 1426
-1452 1478 198 1474
-1439 1564 845 1594
-1426 215 1339 91
-1422 1425 1271 1427
-1227 1426 1387 1179
-689 1080 1557 1401
-1064 1351 1178 1431
-1374 1031 1343 1491
-549 1434 1429 1182
-1691 1626 1358 1553
-1351 1434 1080 1333
-1433 1436 1270 1431
-1488 1368 1849 1397
-978 1507 1434 549
-1548 1605 1550 1865
-1524 1274 1500 1527
-1562 1424 1593 121
-546 4421 4361 459
-1780 1598 1786 671
-4857 5318 5316 3266
-4357 1444 1450 493
-1443 1660 54 1476
-1384 53 1367 1660
-421 1994 484 51
-4669 4338 1448 4709
-1383 1447 4612 4645
-2194 581 2067 2076
-1421 1367 1443 4352
-1366 1491 1489 1546
-1423 277 614 1499
-4081 3763 4046 548
-2109 1696 1224 1642
-647 648 1489 162
-1548 1406 1463 1550
-4329 1376 4586 4427
-1839 1459 1401 1341
-1458 1422 1331 1352
-4427 4524 1675 4615
-1763 1462 1846 1463
-621 631 1461 1773
-1461 1064 1574 1456
-4611 4408 1371 4594
-647 1471 218 491
-2518 1065 1888 1896
-1353 1478 117 1504
-1652 1356 1579 1294
-1669 610 624 4396
-1499 156 1481 1561
-1465 1489 1366 1486
-1736 1494 163 1473
-117 1490 1472 1366
-1499 1586 1423 1678
-20 583 197 2111
-1444 1518 1693 4340
-1524 1537 160 1538
-1526 1467 1374 1423
-3980 1482 594 4503
-1487 195 1177 1546
-610 4418 1565 1470
-4372 4490 4227 1479
-1507 1500 967 1348
-595 3840 2188 3685
-4423 3717 4401 1676
-491 1471 163 1549
-1375 1595 227 1480
-1775 1435 1519 1894
-1471 1451 4354 1455
-1491 1473 1494 1374
-1490 1430 1492 1451
-1493 1491 1371 4338
-4594 1494 1492 4618
-1490 1472 1493 4595
-4524 4559 1358 4418
-1607 1521 1638 208
-648 978 1080 1557
-1718 1709 1708 1693
-1474 1470 1452 1534
-1483 1438 1321 1348
-1903 118 1900 1877
-526 3271 746 3280
-415 4367 1785 4166
-1467 1526 195 580
-4114 4127 4896 4344
-1087 2157 1890 1640
-1436 1537 1483 1538
-123 197 1701 1690
-4660 1400 4337 4587
-3721 504 498 3740
-1561 1607 1626 20
-4408 1343 4396 1371
-4584 4583 90 4111
-4585 3717 624 4401
-4306 1376 4584 4585
-1579 1522 614 580
-2019 1845 2126 2154
-1660 1638 1476 1408
-1649 1488 1632 1889
-1356 226 1256 1344
-1561 156 1496 158
-1516 1388 1563 1564
-1375 1394 1525 648
-1438 1537 263 1477
-628 1523 1341 1557
-614 1504 1031 1478
-1438 175 1348 1538
-1890 2142 2122 2135
-1833 1130 1325 2767
-1639 1414 1330 1641
-1356 1615 226 845
-2130 221 1087 1398
-1755 1624 1070 740
-1536 1579 1499 1621
-4588 4510 4435 4419
-1539 1655 785 1534
-241 1524 1507 1477
-1527 739 1507 1477
-1561 1682 259 1536
-274 1389 241 202
-4637 4580 4475 4399
-1411 1866 1957 931
-1576 1891 1859 1905
-772 1855 4 218
-1342 648 1546 1375
-1547 1545 1451 1480
-195 1031 1546 1563
-1606 1437 1456 483
-1486 4354 4602 4649
-1878 1456 1380 1437
-1411 1588 1857 1866
-1234 1340 1403 1604
-1692 1607 1432 1638
-146 1813 1144 1800
-825 302 1961 1945
-1653 1007 749 1623
-528 1497 1525 1428
-2485 2698 3014 1941
-1685 1144 1926 1769
-1566 315 1886 1919
-1470 1521 1511 1539
-1439 1563 1342 274
-1564 1522 1547 1562
-1563 1522 1424 627
-90 1358 1626 1481
-324 1954 1560 1977
-18 2266 2068 4095
-313 1954 319 1753
-1355 1737 1671 1151
-2055 1741 1806 1790
-4946 1127 2012 1762
-4431 4411 4409 3839
-1256 1076 1831 1650
-1877 1463 1846 1844
-1787 1839 1729 1810
-1543 1249 1848 1903
-2137 1935 1934 2178
-276 2073 1134 2126
-1468 1516 1534 1611
-1294 1614 1611 1399
-61 4 1613 1625
-1928 2126 1845 1832
-1923 2056 2111 2138
-1610 1859 698 1897
-224 2141 1766 2174
-1671 1474 1353 1621
-1399 1353 1611 1621
-1748 1895 1747 1551
-1200 1344 1389 1320
-160 241 202 1350
-315 1879 1887 1836
-1642 1224 2246 2240
-845 625 1439 1315
-1595 1424 1614 627
-1319 1487 1594 1613
-61 1613 1597 1602
-1606 1596 1357 1604
-1771 1441 1751 1777
-1223 2064 2147 119
-1749 1666 1630 1629
-2513 2676 2478 1978
-1616 1604 1596 1603
-1634 1617 1602 1650
-1602 1552 1597 1605
-1437 1604 1340 1370
-628 1597 1548 1744
-1511 1496 1553 1629
-232 344 928 362
-2340 272 1826 514
-1323 1249 1584 1885
-1580 1587 580 1579
-2122 2130 1087 2129
-1596 1581 1595 1614
-1615 1594 1580 1613
-1294 1616 1531 1614
-1615 1617 226 1602
-271 1603 1256 1616
-507 2150 100 2254
-4 200 1622 1625
-4540 4593 4428 4557
-1655 1586 1587 1534
-1619 1737 117 1353
-1399 1556 1624 1654
-1623 1533 1625 1725
-1399 1581 1619 1624
-1565 1432 196 1511
-4567 4558 3335 4380
-4232 4057 4294 4013
-1607 1600 1722 20
-1722 1754 1948 1600
-1359 1735 1670 4688
-1680 1396 1846 1519
-2035 2009 423 1221
-1078 740 1070 1603
-169 1879 1891 1893
-1327 1872 1876 1869
-447 1657 1750 1083
-1553 1496 4559 1518
-1530 1369 1076 1648
-258 1506 1641 1414
-2057 1640 1530 1651
-2144 1454 2176 1592
-1725 200 1726 1751
-159 934 4772 3340
-1781 510 1786 1780
-1802 1799 1771 997
-1648 1414 114 740
-1819 1639 2153 1647
-1858 1846 1519 1900
-1078 1603 1370 1573
-785 258 2129 1641
-785 749 1330 1468
-785 258 1556 1654
-1655 1623 1398 1653
-1621 1654 1683 1536
-1778 1328 1772 1787
-2064 2133 1745 1637
-2150 4016 2115 617
-3098 2957 3129 516
-1445 122 1444 1518
-693 146 1072 1800
-326 2283 2322 2248
-2180 2201 2374 506
-3828 2065 2118 2114
-4096 3937 3808 2090
-1600 1694 2133 193
-2073 2125 1742 2149
-42 192 1790 1803
-3717 4414 1469 4396
-1367 1631 1384 4687
-1678 1586 1569 1672
-158 1671 1355 1683
-4210 557 4149 670
-4247 4256 182 4208
-4661 4611 1460 649
-1485 4581 4430 4396
-1742 203 291 152
-156 1474 4597 1671
-2763 2877 2776 1088
-1397 1008 40 1632
-2612 1206 2624 2660
-1539 158 1704 1683
-1682 1672 1398 1655
-2062 1741 2055 2100
-1123 1559 1814 1866
-312 584 4096 1708
-1172 1086 1756 1813
-1376 4329 1689 1691
-1688 4411 3839 1690
-1508 196 1689 1691
-1692 1690 1688 1432
-1709 1691 1693 1553
-1498 1692 4323 1476
-1749 1704 2131 1666
-2096 4014 4057 2113
-1847 2192 2210 1454
-4010 3825 183 4028
-304 1702 2096 197
-2281 2145 2211 2298
-1776 491 772 1723
-584 1702 4100 1508
-111 1698 4269 1701
-582 3603 3986 3331
-259 1694 2130 1682
-4300 4152 4362 4097
-4123 557 3368 4149
-3920 435 4042 669
-1720 1686 576 1498
-1722 123 1498 1692
-243 2685 1084 2747
-3356 4258 4985 4933
-4839 2183 4213 4251
-2097 2059 1409 2222
-210 2280 272 2276
-265 3278 461 2331
-2003 4146 3598 4173
-3870 3646 3845 638
-1720 54 1754 1498
-2094 2066 581 231
-1718 1764 1708 2047
-4372 4452 3980 4391
-583 1709 1630 1629
-1359 1700 1774 1735
-1194 2766 2762 287
-246 1643 1755 1624
-246 1643 1355 1786
-2116 4376 4360 585
-4675 1062 4986 1010
-1743 1575 1856 1811
-2113 553 4007 2114
-3791 3727 3990 1971
-382 3272 2117 269
-4232 4294 3836 4404
-4058 1791 3854 66
-1723 163 1736 1631
-1737 1472 1151 1735
-200 1622 1569 1736
-1779 122 1781 1749
-5168 5167 4994 4961
-2865 1103 96 2897
-1684 1570 1781 1779
-1777 1677 1803 1667
-1729 1818 1857 1758
-1025 483 1854 1606
-1657 2131 2123 1750
-2226 2212 2246 511
-1772 1787 1588 1857
-1763 1858 1588 1863
-208 1694 1738 1600
-1637 1745 2142 2122
-1774 1598 1643 1760
-700 816 806 2515
-2440 1568 1950 840
-1988 1779 1630 1718
-2134 1725 1412 1533
-1772 1687 180 1815
-1946 440 383 1761
-1789 1743 1816 203
-1887 206 313 1832
-1818 1777 1751 1412
-2607 2754 2681 1757
-205 1135 1571 750
-1773 1461 1748 483
-194 255 1720 2004
-1795 750 1117 42
-1867 1585 1365 314
-5037 5011 5338 5299
-4078 4217 3403 4062
-1149 1866 1559 1896
-2538 2327 1920 2421
-1598 1359 671 1646
-1172 1756 1656 1747
-1787 1839 1462 1763
-1751 772 200 1723
-1849 1904 1868 1488
-1811 1393 1700 951
-203 1598 1760 1742
-1804 216 1656 1809
-1741 54 1738 1754
-1790 1645 1441 1803
-1741 1645 264 1738
-4296 571 1783 4506
-4387 1782 4566 4248
-3167 538 4222 4456
-4344 4316 4328 1503
-1645 1726 53 1441
-1656 1773 1747 1575
-688 5033 178 1108
-1758 1796 1812 1799
-1668 1570 1805 1780
-1798 3898 1734 4053
-297 4849 4215 4124
-4697 1802 1795 1421
-4158 4682 4749 4855
-1793 1765 229 1805
-225 1807 1789 1797
-5043 201 205 1796
-3336 3940 1791 4181
-1801 203 1646 1789
-1661 1554 1123 1815
-1802 750 1799 205
-1793 1801 1646 4698
-1742 1668 1780 2125
-116 1778 180 1808
-1806 1421 1795 1790
-493 1805 1136 1570
-1796 1808 1812 4700
-1804 1809 1807 4104
-1808 1778 1810 1317
-1809 1352 1575 1811
-1812 1810 1729 1776
-951 1807 1789 1811
-1554 1219 1065 1687
-152 1134 2073 1685
-1816 1756 225 1800
-1815 1857 1123 1758
-317 1851 1835 1842
-1743 1856 150 1760
-1229 1078 1076 1648
-1213 2445 1945 1961
-2706 2663 2710 2614
-223 328 2008 2516
-599 2053 673 509
-1908 2420 2437 2465
-2316 2022 2429 2337
-1986 1609 1921 45
-1952 1950 1934 1959
-3026 35 1968 2438
-316 1998 2516 418
-524 2058 302 31
-1573 169 230 1370
-1759 1582 2177 319
-748 1529 2757 2766
-2575 2732 388 2769
-2143 1817 2136 2162
-1886 1845 1861 1591
-1868 1859 1897 2746
-2823 2764 4998 2763
-1575 1458 1773 1025
-371 174 1892 2190
-626 2034 1936 1216
-1817 2162 2194 581
-1864 1078 1862 1229
-1876 1574 40 1178
-1582 1517 1836 1887
-1632 1461 1574 1649
-2042 317 1696 2109
-1248 169 1576 118
-1775 1898 1901 1435
-2400 2620 2725 2887
-1817 2056 1223 2138
-1222 2173 1994 1921
-150 1070 1854 1864
-1855 1853 61 1744
-1856 1854 1544 1025
-1729 1818 772 1855
-1747 1743 1551 1816
-1748 1649 1895 1378
-1543 1946 1584 1837
-1416 1415 1420 1285
-931 1404 1149 1836
-1863 1843 1865 830
-1748 1864 483 1862
-1411 1853 1863 1843
-1862 1370 1437 1204
-1542 1551 1685 1769
-1966 1766 2097 2206
-1775 1905 1837 2741
-175 1636 1253 1274
-1982 2760 2819 2779
-2781 2485 2685 2750
-1636 1228 1875 410
-1891 315 1038 1919
-1885 1372 1323 1373
-1902 747 1872 1876
-1877 1875 1636 1844
-1878 1501 1876 1574
-1253 1877 1550 118
-1635 1076 1591 1404
-2910 2848 2443 1103
-2424 1899 2045 2447
-2641 1936 1927 1949
-1893 1378 1884 1349
-1883 1896 1149 1354
-1610 1898 1874 1901
-324 1836 1149 1560
-1759 1591 1369 1845
-1172 1889 1466 1895
-1888 1519 1395 1894
-1506 2156 1528 2057
-1635 1873 1543 1349
-1840 2164 2299 2207
-1404 1883 1635 830
-2740 1488 1889 1173
-1588 1858 1888 1896
-1769 1895 1466 1884
-1898 1584 1238 1837
-1897 1363 1885 1849
-2425 2059 1881 2222
-1904 1378 1649 1501
-1902 1849 1885 747
-1901 1249 1903 1875
-1904 1576 1501 1902
-1775 1905 1900 1903
-1904 1543 1868 1349
-2231 1924 206 1933
-2251 2187 2193 2225
-2393 3019 2482 1824
-2301 2310 2386 2459
-1922 2386 2214 2409
-2139 2071 2036 1990
-408 2455 2500 2464
-2294 2110 2026 2080
-385 917 2360 2841
-1940 1956 318 825
-170 3808 1962 312
-3861 3850 3946 3638
-1226 1978 440 2752
-1560 1873 1354 2743
-2438 1770 2435 2229
-1143 1826 1852 2029
-1991 1910 2230 2175
-193 2133 1583 1083
-1906 377 1929 2441
-1144 2765 1926 1939
-1559 1927 324 1925
-1926 1134 1928 1882
-1927 1582 324 319
-1924 2219 313 2440
-1931 2676 1226 2690
-315 313 1930 1954
-2180 273 2069 2174
-1934 1952 2444 1906
-1933 1577 1827 2177
-2070 1577 2037 2058
-1134 1841 2039 1882
-243 181 840 1028
-2762 1233 19 2508
-395 2508 1977 1925
-325 2778 1915 1944
-318 351 1558 2495
-4020 1140 3696 4185
-668 4270 4384 4367
-5 1992 1940 1945
-1944 2032 1555 1820
-1859 1038 1757 2745
-824 1137 1154 2009
-1988 1630 2132 2098
-1028 1882 1950 1959
-1753 319 1827 1949
-815 2829 1092 2866
-1933 1827 1961 2441
-3742 495 186 45
-1931 1566 1568 236
-3967 3336 3752 4058
-2779 2819 1915 2778
-1542 2019 2073 2149
-199 2671 791 2466
-302 1949 1827 2058
-4266 5164 5066 952
-1820 1555 2105 1952
-495 1916 186 2067
-477 3655 3598 460
-3008 449 322 2686
-1117 308 2009 2035
-119 2172 1867 2208
-2747 1325 2817 1982
-1828 2347 5 2181
-2059 2071 985 2025
-2111 2094 2096 2127
-694 1731 404 290
-3764 460 3598 4189
-553 2104 579 2114
-2313 2115 2074 2162
-2560 376 287 957
-2768 2731 2698 2750
-1566 1939 236 888
-1601 1918 2715 2572
-2227 2811 3891 3799
-3790 597 3788 86
-4045 3285 3278 2014
-1999 2807 1967 1870
-2009 2786 1137 484
-2028 1347 421 1137
-3305 3145 2923 3299
-272 2095 2195 1826
-490 4090 421 51
-1948 1754 2076 2062
-2265 2086 3805 300
-2055 1911 192 423
-2403 2301 1922 2402
-2385 1993 1944 2032
-2185 2049 2777 1992
-1446 1852 2050 147
-3986 75 4010 2151
-2355 1133 3694 3699
-598 3603 3762 3331
-1829 323 56 2297
-2747 2776 1982 2781
-1326 4265 186 4331
-418 99 223 2503
-2727 2941 2380 2558
-189 452 1716 3549
-2047 1764 2023 2031
-2775 2377 2352 449
-287 2612 416 376
-5092 2787 5189 1171
-2809 643 417 1822
-1965 1983 1947 1633
-685 228 2808 537
-2016 3291 643 3301
-4973 308 1117 1571
-3115 4098 2801 3289
-3237 1981 3010 2345
-501 3090 3297 3321
-3283 537 3276 2011
-4376 78 590 3971
-579 26 4043 4027
-1517 2153 1957 931
-2034 2035 524 2661
-673 507 3991 18
-1825 2348 2203 2457
-2004 1326 186 2028
-2026 2106 2119 309
-2045 2070 1969 31
-1913 2024 2079 2302
-4506 571 4505 4410
-2031 2023 2029 1984
-45 2028 421 1921
-357 2062 2076 282
-282 2004 2028 1154
-1992 31 1945 2045
-4379 1379 4054 209
-2041 2020 2039 1841
-2041 1965 1633 2020
-1911 2037 2121 192
-2036 1935 276 2039
-4042 4022 4083 4087
-2037 2034 2058 1936
-2256 2213 1212 2252
-42 2035 192 2034
-2063 2169 2215 1847
-2199 2409 2241 2216
-3991 4018 47 2068
-1881 2025 2032 2446
-2350 4106 4024 2356
-2004 2076 2067 1720
-2164 513 2460 174
-2050 1156 2519 1993
-484 1221 2049 1994
-2349 2613 2316 2370
-2066 2094 2102 111
-579 2104 1823 238
-282 423 2055 1154
-1684 1990 1570 2054
-2098 2132 1851 1583
-220 1890 1641 2135
-1935 1830 1959 2039
-1222 1969 1899 1713
-2075 2255 309 2106
-2068 2074 4018 495
-2148 1988 2030 1684
-272 2042 2214 2276
-2132 1657 2148 1599
-579 4027 1664 2258
-1719 2052 312 584
-1449 1962 2047 312
-1567 2061 2044 4094
-2171 1932 2135 224
-2137 1935 2071 2025
-1365 2070 1911 1969
-3785 2291 253 3792
-1814 1578 1667 1957
-2280 1974 2061 2195
-2255 2060 130 266
-1449 1988 2047 2030
-3657 3704 154 605
-2330 2362 2342 2285
-2026 1125 2085 2119
-2391 1913 2302 330
-2300 2337 2286 2387
-3553 3864 3861 49
-3643 3789 3905 568
-2163 2085 2257 2088
-2084 2285 2262 2079
-1989 509 3806 2324
-435 669 3597 3705
-2089 2302 2084 2299
-2392 2088 2163 2348
-4011 1665 4265 4384
-459 4539 546 4588
-2144 2239 2201 2209
-2129 2122 1083 2135
-1970 2052 2128 1719
-2169 2194 1986 357
-1698 111 1695 1970
-1713 1365 1867 2147
-581 231 1948 2056
-3763 4029 566 4008
-2139 2123 2148 1684
-2102 4014 4416 111
-170 4017 2101 2052
-2262 2165 100 384
-1973 507 2053 2254
-1961 2398 2454 2441
-2060 2244 2024 2268
-268 32 3829 3911
-3636 3817 3933 3847
-2315 1847 1454 2143
-261 2244 2290 1913
-1475 231 1970 1583
-100 18 2262 2266
-617 4015 1695 1730
-2256 1973 1730 1664
-1658 4017 1974 2128
-4305 78 4276 1727
-1732 4116 159 934
-2416 2258 1212 1664
-2024 2270 2079 2165
-2121 2124 2159 2140
-2036 2120 2125 276
-1612 1528 1750 2093
-2100 2140 1745 264
-2125 2158 2120 510
-2121 2124 1803 1667
-1517 1582 1578 2161
-1970 2128 617 2136
-2127 2115 2162 2094
-259 1612 2093 1651
-1612 2131 1532 1704
-1694 2130 264 1745
-1948 2133 2064 2056
-2132 1666 1657 1923
-114 2158 2149 1755
-2069 1528 2057 2093
-2138 1835 2127 2176
-2070 1577 2442 314
-1583 1851 2136 2167
-1911 2140 1365 2100
-2139 2120 2141 2123
-2142 2159 2140 1585
-1750 1528 2141 224
-2314 1835 2109 2176
-2167 2192 1642 2092
-384 2187 1699 2205
-273 2160 2174 2178
-2097 2148 1599 1409
-2147 2100 2064 2062
-1957 2134 1667 1412
-1618 1658 2312 2272
-1995 2333 32 404
-1083 447 2167 2171
-2019 2154 114 1648
-2153 1517 2155 1369
-2156 2154 2160 220
-1890 2157 2159 2155
-2156 1506 2158 114
-2157 221 2124 2134
-2156 2120 2141 2160
-2155 2161 2159 2146
-2160 2126 276 2178
-1835 2128 1974 1842
-2330 2084 2250 2089
-1892 2048 2249 2459
-2119 2213 2103 2253
-1223 119 2192 2167
-2152 2166 2138 2144
-3926 337 3908 4203
-2095 317 1409 2042
-2250 72 2338 2389
-2152 2201 2069 2172
-447 2171 224 1966
-514 2425 1852 147
-1932 1585 314 2146
-2402 1922 2430 2432
-2136 2143 2271 1642
-206 2178 1934 1832
-2146 2161 1577 2177
-2422 174 2218 2236
-1932 1663 2231 2288
-1968 2414 299 2245
-2211 1224 2298 2233
-4755 4235 4210 1712
-2231 2415 2428 2450
-99 147 1993 2385
-2243 3737 2362 2324
-1907 2249 2242 2145
-3685 1484 3918 85
-243 2487 2683 2685
-2388 1840 2207 2417
-3858 3767 3857 578
-1696 2166 2209 2144
-242 2242 511 1907
-1842 1449 2195 2095
-2074 2194 495 1986
-99 2369 147 2204
-3641 3779 3857 3918
-3997 3998 3834 2416
-2043 2232 2210 2239
-3347 3223 904 3247
-2092 1663 2171 2208
-2317 2504 2727 2558
-2022 2250 2316 2389
-2295 41 2196 2426
-2249 2145 2257 2310
-506 2221 1867 2208
-2190 1892 2348 2457
-2201 2209 2206 1966
-2092 2192 2210 2208
-2199 1696 2216 2209
-2246 2212 2182 1699
-1746 306 2211 2242
-2254 2040 2165 2270
-2063 2230 1910 2215
-2042 2214 2216 2222
-2043 2215 2221 2210
-242 2226 513 174
-2419 2460 2412 2179
-1929 2474 2676 2735
-928 362 5000 5164
-2452 2222 2206 2216
-2215 1899 2221 1713
-2603 2616 2642 1166
-2255 242 2251 371
-309 2253 1907 130
-2217 1746 306 2235
-3680 283 1979 3842
-1405 2277 3787 3774
-2407 2420 1920 2418
-1922 514 2425 2214
-2180 2184 1906 2444
-2233 1224 2199 2240
-2410 2182 2232 2234
-2411 2233 2235 306
-2226 2236 2240 2234
-2179 2237 2235 2412
-2236 457 2238 2413
-2237 2374 2239 2241
-2240 2238 2092 2199
-1592 2235 2239 2232
-2238 2375 2451 2043
-2193 513 2212 2187
-2294 2186 2263 2371
-2110 2283 2323 2106
-2407 2394 2181 408
-1746 2211 1592 2247
-2252 2281 2246 2271
-2278 1662 2318 505
-2299 2187 2205 2164
-2163 2170 2331 2203
-2224 2308 1907 309
-130 2253 2247 2040
-2252 2225 384 2165
-2104 2256 1618 2213
-2283 2075 2060 2224
-2114 2254 2040 2272
-2084 2262 72 2205
-2065 2261 2118 2259
-2258 2265 2269 238
-3901 284 3904 638
-4000 2265 3785 2258
-2085 2112 2257 2103
-3621 2344 2243 2373
-2418 2419 2436 2433
-2261 1989 2292 2259
-2112 1567 210 2280
-3629 2373 2372 3667
-266 2323 2106 2269
-1212 2259 2268 2270
-2213 238 2269 2119
-2272 2311 2247 2176
-2256 2150 2271 617
-448 283 2277 2279
-4034 3879 3945 3866
-2277 3815 81 2279
-2296 2315 1714 2063
-2273 3786 2228 2275
-2279 3778 3686 2248
-2273 1111 2275 2278
-2266 2074 1714 2313
-2247 384 1699 2311
-3037 2372 3703 2286
-1662 2255 2244 261
-3330 3752 4154 3274
-2078 1125 1110 2085
-2282 2388 2081 352
-2336 3704 2354 554
-506 314 2442 2180
-4093 3953 3673 3762
-2110 300 2321 2294
-2072 2292 2318 2322
-2291 2265 300 2323
-662 3308 1141 3112
-2290 2324 2243 1913
-2404 2339 2204 2403
-2298 2276 2310 2386
-1998 2368 2339 2404
-2182 1699 2296 2315
-1892 2308 2088 2249
-552 1133 2081 3703
-2389 1909 1991 2458
-2080 2026 2088 2308
-3703 3037 3702 3698
-4339 4371 4229 4093
-452 3880 3671 3759
-191 3734 3676 2357
-3330 3274 4119 37
-371 2251 2302 2299
-377 2474 2695 2427
-2205 2296 72 1909
-2281 2271 2312 2314
-100 2150 2313 2311
-2280 2312 1974 2314
-2315 2311 2313 2143
-2298 2314 2276 2109
-2339 1825 2051 2203
-2529 662 2202 2984
-253 2291 2319 2248
-3773 2318 2320 505
-2319 300 3772 2321
-512 2290 2320 2344
-326 2291 1662 2323
-2322 2292 2244 2268
-2086 1125 2186 2294
-2327 2429 2326 2405
-2423 2325 2457 2417
-1770 2368 2435 2325
-2644 2594 802 347
-2435 2404 35 2402
-2163 2355 2331 2078
-1715 2349 2330 2250
-303 2857 2568 2853
-50 4075 3751 2151
-3538 3093 3107 2812
-41 3010 2370 417
-2733 3705 3679 2287
-552 1825 368 2081
-265 2340 2170 210
-2297 2316 2370 2295
-3718 1609 2426 2338
-4174 4213 4251 4220
-461 4088 1110 2078
-3739 512 2344 2358
-3674 2321 2263 2343
-3115 2014 4098 3272
-3799 3823 3795 3786
-1968 35 2385 2430
-2387 2089 2022 2207
-2331 3694 2051 3278
-4148 4201 4021 2046
-2984 2703 2890 2479
-232 344 2005 2799
-344 2378 2760 2879
-346 3737 2287 3621
-2363 1996 2330 2362
-2046 521 3777 4141
-2306 3749 3672 3745
-2372 2343 2373 2390
-3100 3627 2542 3570
-1097 2886 1914 3089
-2367 2621 3698 2985
-2355 3738 2078 2186
-2371 2355 1133 2392
-3393 557 2365 3056
-151 3372 3016 2364
-3936 531 151 3729
-3654 437 244 2361
-323 2297 2327 2429
-51 41 2196 2809
-2335 2051 2339 2477
-2243 2363 2373 2391
-3707 2358 2267 2282
-2371 2263 2358 2267
-2238 2415 1663 2451
-2432 2409 2241 2413
-2885 449 2775 922
-2799 2005 223 2503
-449 322 2353 289
-478 3592 3668 3046
-323 413 340 2002
-4359 629 4102 4156
-4840 4973 4943 4993
-3800 1326 1347 4069
-1092 2776 2781 2971
-2347 2185 1992 2424
-1909 2296 1910 2410
-2388 2392 2081 2348
-2286 2390 2387 2190
-2203 2170 2403 2301
-2358 330 2391 2388
-2390 2080 2371 2392
-2387 2391 2363 2089
-307 2462 2484 1908
-2245 2414 237 2434
-3005 3012 369 2536
-2703 2926 3000 2726
-1174 2556 763 2672
-2487 2105 2683 2486
-2841 3138 2864 2576
-374 2615 1850 2659
-2817 359 1028 243
-2436 1991 2329 2175
-2295 2389 2426 1991
-2406 2297 2295 2329
-2421 352 2325 2417
-418 2404 99 35
-2437 2229 2438 2245
-3114 3102 3094 3064
-2375 1910 2043 2410
-2411 2386 2409 2233
-2410 2234 2412 2460
-2413 2411 2236 2218
-2433 2375 2237 2412
-2181 2449 2394 2431
-2374 237 2184 2449
-2198 3785 3792 2118
-2405 2190 2326 2422
-2461 2264 2229 2434
-2422 2218 2423 2264
-2421 2461 2229 1824
-3018 2405 1770 2420
-2417 2179 2419 2461
-2436 2326 2458 2419
-2385 2425 1881 2430
-2424 2173 1899 2230
-2340 514 2204 2403
-2456 307 2502 2309
-2184 2464 377 2453
-2368 1825 2325 368
-2347 2175 2424 2431
-2430 2432 2448 2414
-2175 2375 2431 2433
-2432 2413 2434 2264
-2394 2433 457 2418
-1920 2327 2329 2436
-2402 2435 2423 2264
-1824 2407 2482 408
-3027 1920 1828 2407
-820 1211 763 2672
-2441 1753 2565 1929
-1952 2440 2105 1924
-2137 2444 2446 2288
-1880 822 2526 2595
-2442 1933 2445 2231
-2446 1820 2450 2444
-2045 2445 2447 2442
-2448 1881 2446 2452
-2449 2431 2447 2451
-2450 2448 2415 2414
-1213 2445 2184 2449
-2374 2241 2448 2452
-2221 506 2447 2451
-2454 2455 1213 2428
-2105 2486 2453 377
-2453 2499 299 1912
-2492 2427 390 2490
-2326 2022 2458 2207
-2423 2457 2301 2459
-2458 2460 2164 1909
-2459 2048 2411 2218
-2420 2422 2418 457
-2492 148 2530 2393
-2627 2570 2626 2622
-2465 307 2428 1912
-237 1824 2464 408
-2478 2670 1958 2496
-2559 429 295 2527
-2944 74 2889 2511
-2521 1 2972 2959
-3127 2998 2840 2959
-2547 2976 3013 2947
-77 294 3013 427
-2965 2943 2514 2961
-2309 2219 2694 2480
-400 2492 2523 2546
-127 2552 844 2578
-2370 3034 56 417
-1601 2466 2715 2737
-2960 369 2351 366
-2490 2474 2669 2513
-2712 2525 199 2715
-2437 1908 2483 3028
-2482 2484 2500 3029
-2483 2393 2501 2530
-1558 318 2780 1871
-2454 2398 351 2695
-318 825 2189 2398
-2689 2608 1173 2740
-2569 2559 819 859
-429 2456 391 2480
-908 2919 2596 2914
-2456 2475 2532 2462
-2616 885 2835 2861
-3479 3408 3389 398
-1941 2499 3024 325
-2466 2722 2748 2737
-358 2568 2859 1146
-2720 3004 2789 3014
-2455 351 2495 2500
-1912 2501 2499 2483
-2500 307 2502 2484
-2696 2427 71 2501
-2686 2001 2377 2777
-3290 662 3295 2202
-826 2642 2603 358
-2976 2828 11 3013
-2726 2926 2785 2590
-1938 2677 888 1939
-333 2682 1116 3058
-387 2906 2908 2549
-2468 387 288 2946
-2885 2984 2529 2927
-2527 2480 2670 1601
-2521 2473 2561 1
-1191 2543 1752 24
-1822 2529 56 1829
-2595 2526 2573 2569
-2677 1466 2740 2742
-76 2049 2623 2777
-2600 2624 2684 2591
-2930 2514 2947 2469
-2581 1103 2865 2893
-2533 2540 2532 2475
-4925 285 4956 4768
-2481 2537 374 2572
-2517 2443 96 819
-2467 2513 2719 343
-2980 426 3000 2703
-328 2317 2516 2512
-2484 2462 2531 2652
-2530 2532 71 2884
-2531 2492 390 2523
-2592 2550 2523 2587
-2649 394 2606 2673
-3269 922 289 2991
-2975 3001 2726 2395
-2601 2614 2710 2525
-1770 1419 3018 3006
-1155 2554 2738 1206
-2523 2550 294 427
-3140 2680 3490 3304
-3716 55 2359 3574
-692 383 806 2515
-393 2549 389 2559
-2904 2934 2796 392
-2549 2475 2587 429
-2888 2471 2905 428
-4093 4307 3953 4056
-2510 2546 2588 2544
-2533 2795 2540 2632
-465 416 2792 2835
-2476 2598 844 909
-2837 387 2899 393
-1084 2748 2539 2761
-127 2563 2573 2597
-821 2397 28 539
-389 2574 819 2559
-2002 2793 2890 2202
-2544 2467 2557 2489
-2767 1164 1975 1145
-2889 2514 2943 2955
-3220 2914 908 2656
-2848 379 2595 2555
-83 2849 905 257
-2683 2440 840 2735
-878 2728 2759 873
-2673 2635 394 97
-905 2611 2332 2497
-379 2489 2517 2597
-907 2640 2463 2577
-713 806 2717 2607
-343 1978 2525 2601
-2517 897 2555 2597
-2589 295 2667 2557
-815 791 2664 1834
-873 2399 908 3219
-2570 2646 2626 2851
-2665 2476 2619 805
-388 2911 2711 2847
-834 2702 2637 2787
-2847 2867 2522 2918
-923 907 2625 2831
-3250 902 2978 870
-2694 2722 2731 2669
-2674 424 1044 327
-2592 295 2587 429
-2586 2588 2533 2546
-2549 2587 2639 2589
-2588 2574 898 389
-3020 3011 2507 2999
-2520 2712 402 2710
-391 2729 2533 2586
-1115 2661 1216 2818
-2328 2649 2606 327
-379 2443 2563 2517
-2833 2491 2932 2827
-2569 2598 2573 2555
-2552 2597 901 2599
-2598 859 2628 2602
-456 2520 110 2663
-2602 2572 2537 1209
-2599 2601 2622 2627
-2505 2223 833 2860
-2611 2636 852 2605
-2604 2646 310 394
-2534 2675 852 2594
-1185 2571 1761 383
-2488 2688 217 1233
-516 3189 2862 403
-327 732 1175 2634
-2568 2604 802 2853
-2006 1214 2666 1681
-3694 552 2051 558
-2622 1821 2537 2615
-2614 2620 2400 2625
-2223 2493 2855 1165
-2912 2866 2664 2796
-2658 2865 2887 2873
-844 2640 907 2578
-1850 451 2827 2615
-2942 3037 2361 2986
-2602 2463 2614 2625
-2805 2519 2815 2819
-2520 2714 1681 2712
-2622 2582 2615 2628
-797 2577 2706 2463
-2678 909 2463 2602
-2599 2625 2629 923
-859 2628 2659 2630
-2629 96 2658 819
-2882 298 911 2900
-2639 2909 2711 2550
-686 3428 3448 3426
-347 2610 2653 798
-805 909 887 2567
-1146 2604 310 2647
-2580 2692 672 5013
-888 2756 2691 2744
-2588 2908 898 2632
-2619 909 2570 887
-1028 0 2765 1882
-2505 2849 977 2223
-2871 2644 303 846
-2328 2643 2853 753
-2868 139 2844 2656
-2852 2577 2605 2651
-2636 814 1191 816
-2761 791 815 2748
-2594 2650 2534 2673
-753 805 2651 2649
-2650 2646 394 887
-3022 2530 2884 2907
-886 2634 821 730
-2971 2969 2789 2720
-2863 2868 817 2851
-2871 2562 2645 817
-2732 2667 295 2719
-2659 2618 2667 2630
-2718 2400 2658 2629
-1681 2714 450 2761
-30 2020 2593 2815
-833 2721 2717 2860
-451 2600 2836 1821
-2575 388 455 2617
-817 2915 2863 2578
-363 416 2612 2684
-2657 2873 2574 2658
-2721 402 2754 2717
-2584 2670 2730 2480
-2669 2466 2671 2513
-2670 1958 2732 2719
-424 2439 2397 918
-2649 2567 2534 2674
-820 2585 2675 2673
-2606 2674 112 1044
-2219 1601 1930 2736
-1233 1065 2518 2508
-692 97 797 2627
-2701 5159 3257 1021
-3241 373 3313 2541
-1761 2755 2693 2745
-3697 3698 3702 2509
-2189 2398 2565 2734
-2721 2666 2520 110
-1710 1871 2189 2749
-3007 2503 1964 2778
-550 4870 4874 3371
-2689 861 2608 219
-959 2688 2488 2693
-1930 236 2739 2691
-1226 2690 2751 2638
-2702 2832 1101 2637
-2689 2681 2746 1142
-2695 2734 2584 2474
-2486 2694 2696 2309
-351 2695 2697 2502
-2698 2731 71 2696
-1976 2697 3015 1558
-2891 2885 3008 2927
-181 840 236 2739
-2679 279 5097 2791
-1194 287 2692 2580
-2351 3033 2528 2396
-868 465 5188 813
-1146 2709 2859 2716
-2626 2836 2709 1821
-692 2708 2709 2716
-1209 2710 2707 402
-797 2706 2705 2707
-2708 2537 1821 2591
-2579 910 2795 2632
-2624 2481 947 2591
-2714 456 935 2725
-2624 2713 2660 2724
-1978 2478 2481 947
-2717 2707 806 2705
-2662 2668 2571 2716
-374 343 2659 2719
-2671 2718 2657 2527
-11 2828 2654 2498
-363 2684 2668 2662
-2496 2584 2749 2734
-2738 947 2751 1206
-2714 199 2725 791
-2724 1850 2713 455
-369 2396 2536 2507
-56 3034 2002 2202
-2566 885 2825 139
-2730 2769 2592 2732
-2731 2729 391 2669
-2697 1976 2730 2584
-2671 1834 2729 2657
-3699 2336 3700 3731
-2722 2683 2735 2694
-2734 2565 2736 2219
-2737 2739 2676 2735
-2478 2496 2738 2736
-2539 2737 2739 2723
-2738 2700 2690 2736
-2488 2518 1894 2741
-2740 2742 1868 2746
-2518 1354 2741 2743
-888 2742 2744 1919
-2638 2745 1038 2743
-2681 2746 1946 2744
-2741 2745 1837 2693
-1999 311 1710 1967
-2648 2749 2554 2496
-2748 2750 2685 2722
-2790 1871 2749 1976
-2752 2691 2723 2756
-1918 2751 947 2753
-2752 2754 402 440
-1761 2668 2755 2753
-2681 2754 219 2756
-2755 2751 19 2638
-0 2765 146 1833
-3168 1139 462 3453
-2825 813 2566 3218
-2353 1870 2820 2807
-2554 2660 2830 2648
-1214 1724 1938 1215
-1838 1679 2878 2807
-1838 1131 4997 396
-395 2757 1925 2641
-1833 2767 1215 1724
-2766 1529 311 2560
-1976 2769 2790 2794
-2768 2729 1834 2795
-2900 2892 349 2914
-1115 161 2822 365
-387 2916 2908 296
-2798 3037 3036 305
-2813 3089 3265 3231
-328 2005 3302 2376
-9 1679 1999 2384
-2519 1993 2778 2503
-1956 2777 1940 2686
-2780 1870 1956 322
-2485 2781 2779 2789
-1871 2384 1999 2780
-3388 3474 3158 726
-3247 481 3223 3212
-685 2799 2808 401
-2975 2507 82 2999
-1983 4889 401 2788
-1077 957 2580 2007
-2786 4840 2800 308
-2780 2654 322 2498
-1092 815 2768 2750
-1169 2701 5183 4824
-3152 2832 1165 2551
-2803 889 2558 2979
-2768 2795 2987 353
-2769 2550 2711 2794
-2911 2545 2617 2924
-4151 3179 3936 4020
-341 2773 2803 2981
-2352 2377 2784 76
-2805 30 2788 2821
-2013 3713 3034 3290
-3383 3068 3070 3379
-3036 2798 2793 1116
-3082 3352 5225 5273
-2800 76 2623 2820
-561 4149 3355 3385
-2760 1982 2823 2763
-2010 2809 51 2784
-2808 2008 2369 223
-3091 2966 345 409
-3680 85 1979 3822
-3085 3124 2334 3048
-2935 3138 2774 3191
-4216 4174 3615 3394
-2661 524 2816 2623
-2817 2815 359 2819
-2401 1967 2818 2816
-0 1325 2593 2817
-1870 2623 2816 1956
-2805 344 2760 2821
-2800 4841 2820 2822
-2771 4927 2821 2823
-365 2822 2807 1838
-3221 2871 2825 766
-715 2759 2728 2824
-924 3244 3259 2875
-2839 2831 2596 2620
-2506 2990 2720 3011
-2830 385 9 1951
-1164 450 2829 2761
-2863 2582 2932 2827
-2692 416 676 2792
-2865 2919 2596 2887
-2903 808 902 796
-2493 878 2551 110
-2663 2858 2850 2706
-2848 2949 2899 2553
-3473 3163 432 3374
-2827 451 2844 2868
-2928 2470 2926 3002
-1914 935 2399 2912
-3723 3064 3114 3730
-903 2923 3306 443
-2839 2645 873 908
-3059 3159 3160 3186
-664 3090 93 3094
-2873 2581 2579 898
-2563 179 1880 2837
-2564 767 2642 2854
-2868 2836 2857 2851
-2655 2850 2852 2577
-753 2851 2853 2646
-2644 2852 2332 2611
-2849 136 2855 257
-2854 786 2616 885
-2857 885 139 303
-2856 2850 2858 2332
-2859 2857 2861 2836
-2497 2858 2860 2705
-2603 2861 2662 2859
-2860 2493 110 2858
-2609 2937 3121 3146
-2655 907 2665 2831
-2919 2399 2912 2934
-2618 2522 1740 2833
-385 1951 2617 2924
-2916 2581 2910 898
-2655 2839 2645 2850
-412 3654 3096 3100
-93 3094 3333 3741
-2656 2643 139 2824
-280 3180 3324 3148
-2667 2618 388 2847
-924 3169 2875 3209
-2874 3212 2826 3174
-3492 3427 3049 3533
-2878 2978 1679 902
-2763 2877 2896 2879
-2878 289 378 2353
-3159 3160 3142 3106
-3209 3149 3174 3263
-2631 3224 3262 3209
-3130 3159 3124 3512
-2652 2531 3015 294
-2376 2921 2512 2699
-2360 1020 385 2894
-2618 2833 1850 455
-2909 2933 2547 2953
-2468 428 2561 2954
-2558 889 366 2351
-3011 2699 3004 3020
-179 2770 2893 2925
-2918 349 2892 2522
-3038 2886 132 3265
-3223 835 3222 3147
-2878 2903 5001 378
-884 375 1740 2932
-515 3352 3180 3326
-2553 2837 2910 2916
-2631 2770 2935 3191
-3107 2963 3093 3543
-3137 3471 3472 3513
-2896 3214 2834 5002
-2911 2545 380 2918
-2906 427 2547 2909
-2510 74 2905 400
-2652 148 77 3021
-2510 2772 2639 2909
-2908 2888 2632 2905
-2899 1880 822 2867
-910 2796 2904 2579
-2841 2617 455 2864
-16 3069 3458 3400
-2915 2562 2491 2770
-2914 884 2932 2665
-2899 2917 2867 2772
-296 2916 131 2949
-2904 2893 131 2581
-2491 2864 2833 349
-3006 2929 3019 3028
-2928 922 3002 2885
-1393 4650 4649 4550
-2843 442 3184 1985
-2796 3038 2866 2983
-2949 2892 131 298
-2396 2840 2998 2507
-2960 2512 2699 316
-3113 2840 3033 2921
-3017 2920 3021 3012
-2998 2997 82 2521
-316 418 3007 3026
-2915 2897 2596 2831
-910 2977 2888 2952
-349 2864 2545 2935
-2900 2813 2934 392
-248 2951 1 3149
-680 3135 3204 2862
-547 3605 3132 3600
-3624 3497 3480 3613
-3151 409 2961 2945
-3706 3036 413 2002
-3716 3707 437 2621
-2473 2944 2561 2945
-2966 2468 2943 2945
-2940 2944 2943 249
-2949 249 288 2511
-428 82 2521 2471
-674 3375 3106 3142
-2837 2925 2917 2946
-63 2951 2952 248
-2950 3171 2994 2936
-380 2953 2950 2933
-2954 2888 2952 296
-2889 2953 2955 288
-2954 248 2561 249
-3067 3058 1116 341
-3062 3003 1659 3091
-2977 2983 910 2987
-3072 2469 2470 2967
-2927 3017 2479 213
-2964 2940 2473 3153
-3293 3155 2968 3348
-2901 3059 3088 3484
-345 2961 2965 3187
-2966 2473 2997 2964
-2810 2989 2965 2944
-2972 2992 2990 2959
-3223 399 2962 835
-2978 289 2654 2991
-1092 2983 2971 2987
-2384 2978 2654 2970
-2976 2469 2994 2967
-3119 3135 3108 332
-4363 4858 950 4619
-2988 2536 2785 895
-2977 2506 2471 2972
-2933 2958 2976 2994
-2877 2969 2971 2583
-1116 3032 2793 3295
-2982 212 2528 889
-2982 2798 889 3005
-3001 444 2980 2981
-2924 3250 2970 2958
-2317 3033 2351 2512
-3096 2361 3058 2986
-2621 341 2985 55
-2794 2958 2970 11
-74 2989 82 2975
-3003 2988 2997 2966
-2967 2991 2828 3002
-2992 2969 2990 2535
-2967 870 2991 3199
-3291 3321 3342 93
-2977 2972 2951 3232
-3129 3003 3000 2996
-3125 2997 2995 2998
-2996 2965 2989 2930
-2470 2996 2926 2930
-77 2590 2785 3013
-2528 2995 3001 2396
-2982 2536 3000 3003
-2840 2921 2990 3011
-2957 3001 2995 2989
-2498 2891 3008 3023
-2981 372 366 2395
-2538 213 2920 3027
-3008 2931 2686 3025
-3004 2699 1964 3007
-4622 4902 4975 955
-4091 3278 2335 2014
-3002 2891 2828 2590
-148 2395 2929 3019
-2472 2506 2999 2471
-3015 2498 1558 3023
-2884 353 2698 3014
-3068 2365 3070 3056
-2960 3020 369 2929
-372 2421 2538 3019
-3012 3018 2920 1908
-2891 2590 3017 3021
-3020 3022 2907 2929
-3021 3023 2652 3029
-3022 3004 3014 3024
-3025 2495 3023 3029
-3026 3024 325 3007
-1828 3027 3025 2931
-3026 3028 3006 2438
-3029 2482 2920 3027
-3024 2483 3022 3028
-602 4528 4724 5040
-3132 3618 3567 3604
-2979 3045 212 3307
-2984 3112 2703 2928
-2477 558 2727 2801
-1139 696 722 5241
-3702 2773 2941 2803
-2621 2282 2303 2773
-2924 2894 3250 1090
-3052 3062 3098 89
-3108 3298 3135 3050
-3296 3302 3268 3277
-453 3586 3585 3568
-3162 3541 3049 3170
-3098 332 3129 426
-3067 3052 3032 3182
-3729 151 2379 44
-3061 3087 3110 3322
-3185 3099 3063 2812
-2876 3524 6 3043
-3486 3060 3040 565
-48 3102 3329 3094
-212 444 3039 3045
-13 3948 3101 14
-4437 4545 4164 3273
-3276 3302 232 3296
-3597 2364 3016 3367
-4702 1102 4589 4353
-443 2985 2509 2956
-485 3061 2845 2963
-3310 3050 3501 3313
-3059 3062 3133 3047
-444 2957 3039 3061
-485 3107 3048 55
-4067 2408 39 2842
-3663 478 4186 3592
-3284 211 3071 517
-2956 3077 3045 3183
-44 3016 2802 3725
-3565 3554 2913 262
-2802 3417 3363 3016
-3075 381 3630 3066
-3147 3197 3127 2959
-3569 3421 398 3502
-3398 329 3076 3664
-3071 3076 547 3398
-3075 3281 4189 3074
-341 444 3067 485
-3105 3206 3118 3187
-4221 3467 3370 3433
-3561 3534 3590 3608
-5012 1095 5026 843
-4890 494 3351 2804
-3315 4893 4162 5320
-679 3103 4970 4275
-3390 3571 2812 3538
-4172 4192 477 262
-3047 3091 403 21
-3130 2963 3159 3136
-3138 2360 2774 3216
-2015 3305 3120 2846
-2957 2810 516 3087
-3572 496 3573 3525
-2334 2901 3130 3506
-2846 3051 2870 2408
-3606 3895 3873 3559
-443 2869 2985 3099
-3137 397 3192 3399
-3039 1659 3044 3121
-3096 3100 55 3048
-2869 2359 3099 3571
-535 3053 4099 4070
-3364 3366 3051 2408
-4619 3 3084 4664
-3481 256 260 710
-3153 3207 3197 3078
-2880 487 3128 2948
-3063 2901 2334 496
-3267 3040 2973 3309
-3427 3537 3540 3542
-3047 3128 3146 3133
-3112 426 332 1141
-3033 3111 3113 2293
-3198 3195 3112 2928
-2842 2408 3306 903
-417 2345 2013 643
-3122 5258 4308 4258
-3502 3496 397 3515
-3078 3125 3154 3127
-3154 3205 399 2973
-65 3297 3090 48
-2862 3135 3098 89
-3660 3116 494 4890
-3148 714 3156 3377
-2812 3511 2883 3185
-3129 3187 2996 3118
-3200 430 3478 3170
-3072 3118 3195 2470
-3106 3522 3110 3166
-1659 3125 2995 3044
-3093 3088 2883 3507
-21 409 3189 3202
-3420 2938 3031 3594
-3061 3110 89 3160
-442 3378 3510 3516
-2937 3121 3040 2973
-3088 3484 487 3532
-3468 2902 3097 373
-2399 3089 2813 3219
-3173 3535 3288 3485
-3241 2541 3144 361
-3472 3246 397 3515
-3513 2948 2880 565
-3155 3310 3148 3180
-3140 3463 658 3365
-1985 65 442 3514
-403 3166 2862 3110
-3172 3072 2895 3199
-2872 3143 3123 3500
-3150 2881 2936 3157
-321 3209 3149 3151
-3150 3208 3153 2940
-5013 2792 5176 5188
-3151 3105 3157 2961
-3119 3118 332 3195
-2962 3309 399 3143
-3123 481 462 3168
-3149 3197 1 3153
-2782 3399 3487 570
-3088 2845 2883 2880
-2845 2880 3133 3181
-3355 3366 3368 623
-3043 3533 3521 3532
-3460 3531 3504 2838
-3249 808 3259 3176
-3523 21 3166 3374
-3128 3165 3146 407
-4299 4303 1379 1784
-2758 3382 3156 3169
-3168 3208 3211 2874
-3126 3507 3532 3043
-3233 3232 2951 3263
-3212 3197 3147 3174
-3539 3139 3546 3369
-2875 2881 3172 3249
-3297 3313 3310 3326
-3215 3164 3260 667
-3606 3631 135 3617
-4671 4410 530 3803
-2797 694 3954 3274
-2898 3353 2872 3143
-3160 3298 89 3182
-3183 3181 3045 3299
-3184 3186 3067 3182
-443 3185 3183 2923
-3184 3048 3186 3124
-3183 3185 485 2845
-3188 2964 3125 3078
-3189 3187 345 516
-3188 3131 3203 2609
-13 14 4060 681
-3225 2900 2813 3220
-3474 3499 3097 3476
-3238 3321 3342 3350
-3360 3297 3238 3326
-835 3154 3113 3127
-5297 4288 267 699
-3157 3172 3072 3105
-835 3277 3268 3113
-3236 3147 3222 2992
-3471 414 3126 3504
-3504 3532 487 3531
-3503 3131 3203 3208
-3204 3206 3202 3189
-2937 3205 725 3203
-3206 714 3119 3204
-3078 3207 3205 3203
-3105 3208 3211 3206
-3169 3202 3207 3151
-2882 2874 2881 3150
-466 4867 5199 1029
-3212 3169 481 3207
-2875 3211 2783 3172
-4962 5038 4724 1128
-463 808 636 2903
-3224 3262 3176 3264
-3217 4824 1097 3089
-813 5085 3216 3218
-2759 3217 3219 3221
-2576 3218 3138 3220
-3221 3191 3219 2562
-1017 3220 3218 2824
-636 2895 3269 3199
-2783 2968 2200 2895
-3225 768 3215 2882
-3191 724 3231 3224
-5089 696 687 5221
-5159 3260 5150 1091
-4351 1010 4810 4932
-3230 912 5099 787
-3229 5177 5004 5155
-3225 3264 279 2774
-2994 3171 3250 870
-911 1090 3171 3262
-3384 4714 665 4242
-4935 4770 4807 4969
-3199 808 3249 870
-4133 2014 4041 3272
-3359 3193 3351 3194
-3451 4907 4231 4836
-705 525 4839 252
-570 2680 3242 3140
-3454 3241 3326 515
-1170 5098 5242 722
-3409 3261 2826 3247
-3493 479 222 120
-3478 3455 3509 3141
-133 2200 3244 2783
-3445 3391 650 3392
-3164 3174 3236 3263
-2983 3038 2583 3232
-4947 4651 4728 3292
-5308 5296 5288 5344
-105 5080 1023 3358
-4965 5094 4301 5024
-5105 3528 4715 4320
-4885 5276 5283 4888
-5150 724 2679 4897
-1017 5060 5086 5018
-3260 3261 3164 2826
-768 3227 3176 3259
-1170 3244 463 3259
-2882 3263 3215 3233
-3262 2881 3249 3171
-3215 3265 667 3231
-1090 2894 3264 2774
-1442 5217 644 607
-501 3108 3320 1141
-3269 3041 922 3198
-3270 3268 2535 3222
-378 3271 3269 636
-3270 3296 1502 362
-3237 1732 2345 4116
-4369 499 4280 3054
-2284 4075 3179 2307
-1225 4080 350 3953
-1093 2016 684 3055
-3293 3041 3198 3308
-1715 2349 3010 1981
-5190 5000 5160 5164
-5005 1502 904 3347
-536 4143 3076 3736
-3395 3527 120 3491
-3342 934 1093 2016
-3520 3066 3398 3710
-551 3711 1981 4066
-3968 4072 251 4477
-3987 3402 4122 3396
-3139 3537 3536 3529
-2013 3291 93 3290
-2801 3289 3294 2504
-3289 2011 2993 338
-4984 3251 4648 4945
-433 2962 3277 3349
-333 664 3295 3290
-3294 3307 2979 2504
-3055 3041 3271 526
-3120 3175 2015 3194
-3299 3181 3040 565
-1985 3298 3182 3320
-489 4837 4159 3337
-3302 338 2011 328
-3041 3055 2775 3301
-3345 4856 3449 525
-2541 3468 3482 102
-664 3090 1985 3320
-3114 3378 412 2843
-3295 3320 3032 1141
-338 3277 433 2293
-501 3108 3155 3310
-3309 3060 3143 3175
-5237 5285 3357 5230
-1107 3509 3499 3493
-3175 3411 3060 2680
-3518 3526 3369 3580
-5312 5017 4815 3083
-3381 3390 3569 3515
-4991 4957 4266 5066
-4269 304 4049 4409
-1093 526 480 3350
-3305 3267 3299 3307
-433 2015 3193 2993
-3484 3047 3522 3523
-4278 4733 4922 4751
-462 721 2872 3450
-3776 4126 3670 3768
-3242 3175 3194 2898
-464 5282 5146 4744
-4234 4838 5165 4876
-623 3051 645 3361
-2284 3909 2307 4144
-1997 290 1703 419
-3395 398 3505 3479
-645 269 3334 2870
-3362 3333 934 3342
-1627 4574 94 4475
-522 4076 1955 1798
-3300 1114 3338 4231
-4159 5280 839 3337
-3356 4963 3 4258
-4970 3660 4912 1644
-5075 466 360 5140
-3193 3334 3283 2993
-4608 5111 5154 5149
-5290 5249 5282 464
-3303 550 4215 4875
-1099 4648 3356 4672
-3280 3348 2200 3354
-3349 2962 3347 3353
-3350 526 3348 3293
-3193 3319 3351 3349
-3082 3238 3350 3352
-2804 3351 3353 2898
-3352 3348 3354 3180
-5219 3347 721 3353
-2806 3161 660 3386
-3346 3339 4163 1711
-3311 4308 5258 5178
-436 5079 3253 683
-3360 3362 4960 3238
-3432 3361 3359 3194
-3431 48 3329 3360
-3359 3334 645 4912
-3364 3418 3366 3070
-3516 3378 3363 3102
-5256 3392 361 3144
-3363 3161 3102 3367
-3056 3368 3366 39
-1706 3367 13 3161
-3485 3314 3173 3548
-4240 3079 3456 4913
-705 665 2687 4244
-670 3416 1109 2365
-3448 3426 3413 3437
-2838 3165 407 3503
-2948 432 407 3486
-3473 3382 3498 3461
-3500 725 3123 3382
-3134 3379 3364 3306
-3552 2802 3378 412
-3591 3520 3594 3483
-3455 245 818 3316
-3376 3503 3377 3168
-3480 3497 2802 3552
-4213 3234 589 3412
-3386 3413 2806 3415
-736 3385 3355 3418
-3407 727 589 3400
-4221 3475 3489 2782
-727 2494 656 3448
-3316 3552 3510 3085
-438 3473 102 3248
-3248 3461 3365 5252
-2364 3653 435 531
-4178 2814 4063 4224
-3424 3282 1107 3332
-3401 16 3287 434
-3562 211 3692 3632
-3284 3074 3075 3588
-3097 405 3158 373
-3401 2913 3387 3666
-3400 3396 3987 3407
-4171 3404 4187 3287
-1124 1768 4216 3771
-3402 4147 3764 3565
-5228 3456 467 3406
-3405 3446 726 361
-656 3387 3412 3401
-2494 656 3422 434
-133 3244 722 1139
-4337 4587 4574 4636
-3313 65 3514 373
-3407 3384 3414 4212
-3373 4242 3385 3414
-656 3413 3415 3412
-3416 3414 3385 670
-3415 3372 3417 3422
-3418 3416 3070 3421
-3386 3417 3363 3462
-3578 3583 245 3573
-3618 3693 3132 3591
-3422 3417 3073 3480
-3623 3416 3408 3421
-4910 4791 4825 4898
-3508 3526 3395 3505
-4426 5254 5269 5283
-2633 736 3373 3489
-2876 3530 3540 3109
-3429 398 2633 3502
-686 3428 3499 1107
-660 3488 3431 4854
-3430 3487 3361 3432
-4395 3431 3360 3454
-642 4853 3079 4870
-659 5337 5009 5151
-4124 469 561 4832
-5214 5088 5209 5017
-4853 3373 4242 642
-4952 172 1036 5334
-561 4720 4149 4755
-5127 5218 4620 5246
-5064 5299 5037 5325
-5315 5311 4241 5302
-222 3493 3476 3470
-4953 5241 5238 5243
-3446 3494 3248 3456
-3495 3406 3445 650
-4914 4905 4918 596
-3457 2633 3389 3373
-297 4259 586 3303
-5264 280 3324 3453
-5281 3239 839 666
-5234 4940 5203 5285
-5240 3461 3450 2758
-3432 570 3242 4886
-728 3381 3508 3246
-3405 3445 5253 3370
-3448 3477 4853 727
-3459 3464 3491 2913
-3458 3589 3479 3582
-438 3492 414 3163
-3392 3376 3463 3453
-3502 3418 736 3496
-3144 3498 280 3461
-3581 3518 3458 3551
-3481 430 3509 3493
-3563 3589 3582 3625
-3475 3477 3494 3079
-3469 3471 3137 3304
-3476 3468 102 3470
-3443 414 3469 438
-3468 3200 2902 674
-3141 2902 3478 3512
-3391 2838 3482 3376
-3475 3192 2782 3495
-3467 686 3388 3474
-3443 3192 3495 3469
-686 3457 120 3467
-3246 3126 3507 3472
-3491 3459 2494 3332
-2939 3383 3421 3569
-479 6 3104 3465
-3490 3304 432 3473
-3567 3380 453 3547
-2963 3322 3136 3521
-3519 3139 3556 3369
-3050 680 3501 3375
-3488 405 3431 3158
-736 3487 3430 3489
-3388 3488 3426 4871
-3498 2541 3501 3482
-3479 3282 727 3458
-479 2876 6 3460
-3245 3465 3312 3443
-3495 222 3445 3467
-3494 3476 3474 3446
-3117 3462 405 3516
-2939 3668 3383 3611
-3463 3490 3500 3376
-3429 397 3192 3312
-3498 3501 3148 3377
-3490 3060 3500 3486
-3117 3073 3428 3462
-3382 3374 725 3202
-674 3200 3201 3163
-3424 3579 3332 818
-3507 3544 728 3093
-3478 3170 3506 3130
-710 3424 3509 3455
-3465 3508 3312 3246
-3134 3390 3511 3515
-442 3510 3124 3512
-3472 3513 2883 3511
-2902 3142 3512 3514
-565 3145 3513 3411
-3141 3316 3117 3510
-3134 3364 3496 3517
-65 3516 405 48
-3314 3527 3464 3519
-3485 3529 3518 3557
-3284 3534 3588 3380
-3542 3484 3162 3533
-487 3322 3128 3523
-3531 3322 3522 3165
-3540 256 3049 3541
-3535 3092 3539 3543
-3527 710 3314 3424
-3526 260 3282 3518
-4603 3255 4658 4977
-3288 3537 3530 3519
-3536 3427 260 3529
-3163 3533 3201 3523
-3201 3170 3136 3162
-3531 2876 3162 3521
-3520 3575 3080 3572
-3525 3537 3139 3555
-3530 256 3540 3288
-3535 3109 3288 3529
-245 3085 2334 3583
-3173 3525 3573 3545
-3536 3524 3427 3109
-3542 3524 3043 3544
-3521 3109 3541 3543
-3542 3525 3544 2901
-3543 3545 3541 3506
-3544 3539 3546 728
-256 3173 710 3545
-3483 3572 3586 3555
-3587 3369 3577 3580
-3669 545 2003 4173
-3579 3613 818 3578
-3558 3568 3464 3554
-3390 3383 3379 3571
-157 2082 29 3619
-3602 3604 3551 3069
-3547 3535 3556 3557
-3557 3485 3555 3586
-3556 3519 3568 3555
-3551 3585 3596 3581
-3628 3784 3095 3884
-3610 3574 3570 3583
-3587 3572 3080 3577
-3397 3628 135 3688
-3596 3566 3466 3626
-3661 4193 4180 3648
-16 3566 3069 3404
-3565 3563 3602 3764
-453 3483 3568 3031
-3042 3567 3557 3551
-818 3480 3073 3316
-3611 3560 2359 3571
-3085 3552 3100 3570
-3534 3092 3561 3547
-3577 3092 3419 3539
-2542 496 3560 3575
-3574 3534 3609 3709
-563 1113 3637 3809
-3548 3561 3578 3573
-3550 3612 3419 3577
-3580 3550 3582 3505
-3581 3314 3548 3579
-3464 3580 3558 3582
-3581 3466 3459 3579
-3419 3560 3538 496
-3809 3671 4191 452
-3042 3587 3601 3558
-3547 3556 3587 3042
-3586 3548 3561 3585
-3520 3398 3600 3590
-16 3459 3466 434
-3588 3607 3601 3080
-211 3380 3420 3618
-3065 2379 3659 3624
-170 3993 3808 4324
-3380 3600 3132 453
-4143 4142 4185 1140
-3602 3563 3558 3601
-2087 39 3056 3722
-4172 1963 1716 1972
-4171 4137 3670 4065
-3588 2938 3594 3601
-3590 3596 3600 3585
-3554 3566 3596 3605
-1997 4081 1703 4046
-3605 477 3031 3554
-460 3602 3604 2938
-3628 73 3177 3095
-3590 3664 3626 3608
-3607 3609 3612 3080
-3708 3575 3610 3608
-3611 3609 3560 3612
-15 3610 3570 3497
-3613 3610 3578 3608
-3625 3612 2939 3550
-382 4300 679 4275
-2814 3972 4078 4063
-3691 3632 3618 3637
-3874 3177 3690 564
-3420 3591 3031 3616
-3851 3553 3634 49
-3645 3646 3896 3784
-2354 2263 554 3674
-3774 81 4030 253
-434 3659 3422 3624
-3625 3592 3623 2939
-3466 3626 3624 3613
-3563 3607 3663 3625
-3716 3719 2359 3695
-73 3559 3606 3562
-1133 2267 3703 3700
-386 536 3071 517
-3177 1113 73 3632
-3692 3397 3616 3631
-4141 4148 3964 3671
-3649 3619 3878 3886
-4312 4786 4623 4726
-406 2108 3841 568
-3655 3616 477 3576
-3859 1917 3866 3641
-3776 3642 4182 4206
-4373 542 641 590
-500 2197 3638 3916
-3967 4058 3639 4071
-2083 3865 3905 3853
-847 474 4140 126
-73 3851 3895 3620
-1717 3620 560 3790
-3771 3959 4120 4211
-4160 3564 4379 4224
-1113 3650 3634 3851
-3649 3964 4141 3908
-3841 3933 3832 534
-3776 4126 4207 4192
-3393 557 474 126
-2367 3695 2869 3724
-3637 532 189 1963
-3750 3715 3733 3662
-22 3727 346 2077
-4507 4535 4562 4505
-3623 4122 1109 3592
-4772 4258 3340 3122
-533 3564 4160 4161
-541 3674 3656 3772
-3664 3065 4188 3626
-3074 3665 3663 3607
-329 3726 3664 3708
-4205 3681 3400 4219
-3700 554 2267 3714
-15 2379 3497 44
-386 3549 536 3783
-3325 250 3599 4184
-2305 3633 3584 4183
-3701 3677 3719 2357
-4092 2289 367 555
-3621 2344 3715 3662
-4033 556 3759 3782
-3753 2306 3696 3726
-3708 3672 3726 15
-4284 4165 4292 3978
-2336 3738 239 3699
-3685 1111 2811 2227
-250 262 3666 4126
-3882 504 3743 3760
-3892 3795 3811 520
-4532 4417 4481 4486
-1484 3680 2188 3779
-81 3778 253 2278
-3756 23 3719 3695
-3562 3883 3689 517
-3688 3690 386 3848
-3689 3617 135 331
-3616 3692 532 3693
-3632 135 3691 3397
-3691 211 381 3420
-1996 2613 2349 3711
-437 3687 3627 3654
-497 3676 478 1942
-2682 3730 333 3713
-244 2361 2303 2682
-3679 2733 1996 3711
-2733 3667 3629 244
-3745 3716 3672 3709
-3706 2303 3036 2682
-2300 3629 2282 2303
-2077 3755 2287 3705
-2087 3704 2336 3722
-552 3702 2941 558
-3746 2372 3714 2942
-3709 3677 3665 3609
-3575 3710 3708 3701
-3709 3284 329 3761
-3699 3712 3694 3285
-4066 3711 3713 3730
-3712 558 2801 3697
-437 3757 3667 3707
-3748 3674 3739 3656
-2942 2542 3627 3701
-649 1669 1514 1485
-4091 265 4086 2340
-3672 15 3627 3687
-3976 4169 4417 562
-3761 1510 191 3745
-3597 3723 3725 3705
-3722 2842 3724 3731
-3725 3723 412 3654
-3068 3722 3724 23
-3665 3676 478 3677
-1731 3732 541 3657
-536 3743 3736 3760
-2366 605 3046 497
-3731 2842 3697 3712
-2733 3723 244 3730
-3727 3791 3750 3754
-3735 3656 3740 1405
-3750 3754 2306 3749
-498 3812 3750 3733
-454 3281 420 3728
-3807 2186 3738 2354
-3737 2362 4022 3679
-3740 2343 3715 3746
-448 3739 3733 1510
-269 2870 4067 4098
-4094 1953 4113 4086
-3682 3889 3728 3769
-544 3834 3801 3955
-3746 3701 2357 3721
-3739 3707 3748 3745
-3865 3843 3867 3858
-3749 3715 3757 3746
-2357 3734 3756 3748
-3735 3732 3734 3656
-2333 37 3912 32
-2284 1955 1124 4076
-454 191 420 3676
-3734 605 3732 497
-3756 605 23 3704
-3749 3755 3687 3757
-3756 554 3714 3748
-113 476 3956 3982
-3879 3675 2305 545
-517 3682 3728 3761
-3760 3721 454 3710
-847 1997 2289 555
-2099 1453 4044 567
-3566 1972 3404 4188
-3793 4118 3812 3791
-651 92 4537 4512
-568 595 2191 578
-3967 4178 3325 4184
-3770 3743 3888 559
-420 3769 4089 3813
-3403 4217 3647 4155
-3662 3810 2320 3773
-1405 3774 3772 2319
-2228 3622 4031 3773
-3984 3995 1112 3981
-3652 3639 3325 4190
-3878 29 2356 3945
-3821 3686 2278 3792
-578 3685 2197 500
-3781 3882 422 3889
-3848 3876 3783 3780
-3887 3675 545 4079
-3781 545 3669 3889
-3620 3869 3896 3559
-4032 2261 2072 2416
-486 2346 3787 2277
-3793 3786 2228 3812
-17 592 1980 3816
-3904 58 2083 3902
-3881 1980 601 3646
-1731 3765 3732 3954
-2416 2072 3778 326
-3985 3798 3787 3765
-4178 4298 3967 4447
-3683 233 3798 2346
-1126 542 4008 4195
-3836 553 4043 3988
-520 3938 3793 3795
-1979 2346 3890 486
-574 2383 4127 4344
-3827 3824 3996 3744
-3835 3911 4030 3998
-3178 871 4121 4543
-3811 3943 3824 3837
-3806 3989 1989 3810
-2086 3807 4082 3805
-3737 4083 3806 346
-1916 4265 1665 3593
-3584 3964 3576 4192
-541 4005 3805 3772
-3804 3683 3899 4037
-3765 3813 3787 3735
-559 3770 498 3812
-3835 81 3815 3821
-2275 3823 3814 3819
-3788 3862 601 3906
-2108 3849 3893 3981
-519 3847 281 3919
-3815 3822 3820 1111
-3840 3819 1111 3821
-3834 3814 3820 3778
-2811 425 3823 3819
-3822 233 2346 3815
-3804 3801 233 3994
-4009 4000 1697 4027
-519 281 4026 4035
-3801 3835 3911 233
-3997 4006 4028 1664
-4004 2107 3932 3996
-4006 612 4008 542
-572 4467 4459 4199
-3877 3862 3651 3875
-3936 3960 531 482
-3744 3835 3821 2198
-3827 3802 3814 3834
-3797 1225 3924 1733
-3804 3838 3994 4038
-1112 3995 3837 281
-4584 1689 1572 4111
-3955 3820 425 1484
-3862 3636 3651 3885
-500 2227 422 3882
-3905 3885 3906 3747
-3921 597 3852 3963
-1717 284 560 3870
-3902 3853 3901 3900
-2108 3995 3818 595
-3689 3872 3781 3883
-639 3817 577 3931
-3857 1917 534 3858
-3645 3649 3619 3881
-3881 3908 3947 3844
-3846 3643 284 3870
-1734 3914 3909 3944
-3868 500 3859 3884
-601 3906 3864 560
-3850 2197 2191 3919
-3747 3885 3850 2191
-3855 3861 3860 3638
-3872 3873 3859 3884
-3859 3867 2082 1917
-592 3841 3832 3816
-3991 507 3924 4016
-3856 3867 2082 3897
-3643 578 3747 3868
-3638 2274 3876 3916
-3864 3747 3861 3868
-3869 3865 3867 3855
-3870 3868 3897 3784
-1717 3853 3845 3869
-3992 604 3944 4021
-3848 3874 3876 3860
-3874 3095 49 3860
-3617 3873 3886 3872
-3832 157 29 3947
-3866 3781 3879 3872
-3913 3921 3832 3947
-3634 3777 4141 3880
-2274 3759 3880 3876
-3886 3879 3878 2305
-3851 3852 157 3790
-3842 3682 3780 3883
-3688 3884 3848 3882
-3883 3559 3860 3855
-3843 568 3841 3858
-3634 3874 3880 564
-3888 3892 3782 27
-3889 3890 3887 3769
-3783 3780 3888 3743
-3891 3892 3888 3799
-422 3915 3890 1979
-3887 3890 4037 3683
-3913 3817 3970 3933
-562 4484 3976 4167
-3645 3896 49 3095
-3620 3784 3897 3895
-560 3864 3896 3869
-1791 3940 3912 46
-3944 3943 3914 3811
-3846 638 3901 3902
-3902 3846 2260 3900
-3901 3900 3789 3846
-3904 284 3905 3906
-3789 2260 3903 17
-3643 2083 3903 3843
-3816 3903 3843 3856
-4294 4334 4335 4318
-3650 2168 521 3852
-4058 3854 3330 4145
-612 3997 4004 544
-2107 3938 3827 3802
-3914 3898 3751 3932
-167 639 3893 3877
-3854 3912 37 3899
-3916 3917 4036 3891
-3641 3915 3866 422
-3915 3918 4038 85
-3917 2197 3919 2188
-3818 3857 595 3918
-555 1707 535 474
-639 591 3877 3844
-4458 729 4457 4490
-3979 4002 4445 3941
-3836 3863 553 4015
-3984 270 3999 190
-2168 4202 4106 603
-209 4379 4496 4446
-4370 4253 4264 4140
-3939 101 113 4302
-3977 3951 729 637
-3962 3939 3849 3963
-46 3829 3912 270
-2108 519 3893 3651
-4253 535 4123 474
-4492 4175 4453 4292
-4155 3833 2366 2797
-4138 4230 1665 4052
-32 3798 3911 3985
-3929 476 3931 4374
-1798 50 3898 3941
-3940 3923 168 38
-3957 4039 4040 3999
-190 270 3899 3804
-3871 3899 3854 4023
-4035 2274 3777 3946
-534 3945 29 1917
-3877 3852 3875 521
-3053 39 4099 4067
-502 3983 3969 3979
-4448 439 711 4480
-3957 615 476 3930
-113 3956 4459 4199
-2289 3275 4081 2548
-3179 4118 3791 4020
-3995 3744 3994 3840
-3952 3957 4040 3758
-3956 3977 3942 3951
-4313 4052 4384 668
-4177 3987 3647 4212
-3833 4217 126 695
-4085 527 4472 4387
-101 3931 639 3963
-3962 3931 3844 337
-3650 3809 3633 3966
-4455 66 4071 4200
-4153 4203 3964 4207
-3794 1955 3768 3642
-4236 3286 4476 4164
-4465 641 4214 3949
-167 3893 3982 4026
-4085 3974 2017 4274
-3615 4251 251 4161
-4923 4863 4834 4786
-4449 4107 3971 4582
-4257 107 4176 4156
-3894 4056 4295 3720
-4464 3930 4297 3957
-4485 4456 3678 4452
-46 4003 3949 3923
-1479 4500 4237 1721
-3775 3817 3982 476
-3970 3981 3758 342
-641 612 3949 615
-544 3775 3925 615
-3990 3793 3938 4031
-1703 1995 4009 404
-4205 3287 3959 3401
-4246 3797 4044 4007
-4009 4000 3805 4005
-1731 3985 404 4005
-2021 3863 1138 2044
-66 4040 3871 4200
-3593 47 4128 630
-3837 3955 3824 425
-3775 3955 3838 3847
-544 3829 270 3801
-2198 3910 183 3828
-2198 183 3802 4032
-615 502 3942 3925
-3825 3989 4032 2261
-4642 1400 4579 4660
-4008 4003 566 3923
-612 4004 4002 3979
-3910 268 4003 3829
-3990 3989 3810 4031
-4007 3828 4029 3830
-1730 4006 3988 4117
-3796 3830 2099 4002
-582 3986 3825 3989
-1697 566 268 1995
-574 4176 2090 4359
-4591 4625 4565 4353
-1628 4073 503 4049
-4015 1695 4232 2101
-4016 3924 4014 2113
-1658 3863 4017 4015
-2115 4016 4018 2102
-4017 170 2044 2061
-4125 159 4980 4157
-2797 3954 497 1942
-2350 3871 4023 4024
-239 3738 2038 4088
-4021 3944 556 4033
-2046 4026 4021 4035
-4412 4433 4049 503
-3970 3826 342 4024
-2018 3825 4028 2065
-4029 1697 3828 4027
-2099 4044 4028 4006
-3802 4031 3622 4032
-3985 4030 4005 3774
-3998 4000 4030 3785
-4023 3675 4034 4037
-4035 4033 2274 4036
-3945 3826 4024 4034
-3915 4037 4038 4034
-4036 3892 3811 4033
-4036 281 3837 3917
-3942 4466 4053 502
-3956 3942 3992 604
-4068 4090 490 3237
-555 419 2038 1707
-4080 3797 2018 4044
-3763 3988 4043 4029
-34 551 1981 4132
-3603 1453 75 569
-4305 503 4115 4389
-4262 4249 4339 668
-4415 4013 4025 3318
-4553 4375 4627 4540
-562 4226 4437 4342
-4442 4413 3937 3958
-4179 1791 66 4039
-4160 4488 4061 2033
-4459 4302 4468 4460
-2548 548 3976 4318
-4073 1628 4117 1695
-3642 1955 3909 1734
-4300 382 4070 4133
-3190 446 850 679
-4063 4054 4198 4298
-4197 4139 1768 4076
-4061 3394 3615 4160
-78 4276 542 4117
-4136 4154 3599 88
-4098 3285 3712 4067
-3948 3741 3064 4066
-4332 4113 4041 4133
-4316 2383 4228 4332
-68 4059 3101 4132
-4462 3642 4206 3965
-4264 4140 4235 3286
-304 4013 4115 4057
-50 4075 4139 4076
-3274 4074 694 2333
-4062 4074 3752 3336
-4291 4194 4175 4165
-3615 251 1768 4197
-3782 4144 4142 27
-3275 4043 26 4081
-3953 4080 3603 1453
-599 4083 582 3806
-419 3807 4082 2038
-4175 529 4453 1183
-4443 4376 3961 3971
-3718 3742 4090 45
-367 2038 57 4088
-34 4022 4087 2342
-3770 27 1140 4118
-4091 4086 4041 1987
-3718 4090 3010 41
-4134 3673 68 4371
-2304 2289 4167 2548
-2068 3742 4130 4095
-461 1567 4094 265
-1686 4138 1665 576
-4333 1705 4367 4270
-2013 2345 4066 3741
-3101 3948 669 551
-1701 4269 4138 4411
-4257 4340 4617 4357
-415 4290 109 2381
-4278 4911 4945 4234
-4949 4349 1808 4700
-4943 4973 4317 4233
-3926 167 2046 521
-4389 4115 3974 4420
-4360 4376 529 1183
-629 1402 4463 182
-4263 4969 4826 4962
-3839 196 176 1513
-596 613 4894 4914
-4331 4130 3742 4068
-1505 109 4976 4347
-4047 4073 78 4107
-228 2117 3272 537
-4064 4246 4007 4057
-4119 4089 3765 3954
-520 27 4118 2307
-4122 3647 1109 4155
-488 3803 4555 4507
-3287 4120 3659 4187
-4283 3934 13 1706
-4254 1792 3435 489
-4228 228 4958 4019
-3325 3681 4223 3652
-4272 3800 4267 1505
-4281 3993 4330 4129
-4128 47 4130 4134
-4113 4129 4094 4131
-4132 4134 4130 34
-4131 4045 4133 4070
-4068 4132 3237 4059
-4092 367 4129 4131
-4703 4643 4718 4723
-4144 4065 4137 4142
-4146 4190 3599 4136
-4096 4100 3937 4260
-4074 695 508 4062
-3928 3644 4072 4168
-3878 2356 3650 3633
-4173 4079 4136 3595
-3281 3595 4173 4189
-4136 3330 4079 4145
-4182 3909 4144 556
-4191 4137 4172 1716
-4171 262 4172 3404
-3633 2350 4153 4183
-3439 1706 2806 1673
-4251 252 4161 4193
-4154 2797 4155 88
-1705 68 593 4371
-3966 4206 4148 4201
-2284 4151 1124 4065
-3771 3936 4120 4151
-3975 184 2381 62
-4316 4019 4328 4275
-4717 4784 4527 1794
-3300 4966 4849 3338
-4054 3648 4063 3661
-4236 3661 3972 4150
-5088 3083 879 4942
-1099 4664 4901 3356
-540 499 3968 3054
-4480 4222 4077 3678
-4678 4366 4247 1503
-4093 4168 4229 3894
-4167 847 4140 4484
-3720 4358 4170 4406
-4417 4169 585 608
-250 4147 3599 3402
-4147 3086 4146 3598
-4143 4142 3549 1716
-4177 2341 2814 4219
-587 4084 3935 4077
-255 576 4011 3975
-3959 4174 4216 4205
-3768 3394 3794 4223
-711 439 4053 4466
-4252 3564 4309 4238
-522 4439 1798 439
-4190 3639 4145 4183
-3671 4148 4182 556
-3768 4216 3670 1124
-3595 88 4186 1942
-4187 3065 4188 4185
-3402 88 4122 4186
-4189 4186 3764 3663
-3076 4143 1972 4188
-4191 3776 4137 4182
-4192 4190 4146 3584
-4191 3652 3809 3086
-4150 4244 3564 4220
-4077 4474 4218 4222
-3796 4373 4445 616
-4407 4632 4796 5040
-4198 4062 4478 4078
-522 4197 4479 4061
-3831 4200 4202 3952
-3965 3992 4201 4199
-4153 4200 2350 4202
-4203 4199 4201 3926
-4202 2168 3966 4467
-4547 675 4591 4564
-3666 250 4177 3987
-4207 4071 3639 4153
-4206 4336 3966 3652
-1674 4285 4319 4365
-4210 126 4217 4235
-4211 1673 4209 2183
-4210 4212 3647 670
-4213 3959 4211 3412
-4212 3384 1712 2341
-3969 4373 587 4445
-4838 3345 1792 4842
-4177 2814 3403 4184
-4209 3960 3771 1768
-4194 4486 1183 606
-4174 3666 4220 4224
-2341 4219 589 4193
-4240 3079 4871 3388
-1379 4194 4165 1784
-4178 4126 4224 4446
-3394 4223 4219 3648
-4639 4290 109 155
-4051 4406 4377 4249
-4372 4391 1482 4493
-4125 4069 1347 490
-2304 4370 4342 4167
-4324 4415 4413 3937
-3337 4395 3239 4854
-4014 1628 1733 4416
-4694 955 4105 5034
-4103 3328 596 4924
-2183 4072 4209 251
-540 533 3968 4161
-4405 594 3980 4511
-4303 4180 4543 4299
-882 5302 5265 5311
-467 3370 4836 4221
-3442 5247 5276 5301
-3234 87 3437 3413
-1036 4835 5106 5158
-252 4766 4193 3371
-4780 488 4555 4508
-4294 4117 3988 4335
-1674 4166 4290 4429
-1783 4498 4578 4520
-4342 4048 4226 4368
-4951 1099 155 4976
-1712 3972 2341 4150
-533 4180 4514 4271
-593 3934 4283 3928
-446 4720 4124 297
-4439 4474 4479 4441
-4285 1674 4623 4922
-3975 4101 62 4345
-1711 3339 3660 3116
-4280 3449 4858 4751
-4138 4411 4629 4341
-194 255 4272 4345
-247 4048 4279 4413
-4825 4287 4910 4110
-4851 3928 4072 499
-2090 3808 2000 4330
-3317 4978 4882 1960
-4282 4127 4983 4315
-4992 4943 4982 1085
-1702 3318 4415 4100
-1943 4281 4330 4097
-4252 4530 4390 4303
-4315 4261 4127 4346
-4377 4406 4361 4421
-527 609 3971 4503
-3614 4157 3084 159
-4335 4064 1126 2116
-613 464 5286 4894
-4728 4103 3323 4684
-630 4307 4339 4262
-4364 3273 4259 4569
-4270 4339 4128 4371
-1137 1347 4881 4267
-4123 4720 446 4253
-4473 4480 3678 4496
-4569 4208 4773 4256
-4797 5202 4908 4894
-4928 602 4969 4263
-3196 5320 782 5112
-4444 4417 4360 4486
-182 4247 4102 4225
-4077 4439 439 587
-4452 3678 4436 3935
-572 4336 4495 4467
-1733 1628 4246 3907
-4440 548 4444 3976
-1782 4533 4502 4387
-3977 4450 4470 4466
-4061 4448 522 3794
-3167 4379 4238 4469
-4059 1705 3614 4333
-4938 5093 659 3254
-3929 4374 115 4055
-4271 4531 3167 4238
-5126 5110 5059 5067
-4334 4047 2116 585
-4627 1515 4590 4540
-4404 2548 4279 4318
-3357 4903 1039 3116
-4514 4766 871 4180
-4727 1402 4579 4742
-4321 4735 4606 4771
-4773 4787 3635 4725
-3958 4463 629 4442
-997 4674 4691 4706
-824 4272 4267 4317
-4157 1785 4069 4333
-229 4315 4105 4694
-4307 3907 4056 4358
-4463 4640 4368 4208
-3255 4713 5101 5071
-4311 4738 4777 4778
-293 4814 4634 4693
-107 4329 4340 1693
-3593 630 4230 4416
-4767 4682 4803 4735
-5167 5262 5088 5214
-914 134 5028 5096
-1785 4157 4901 4664
-4341 1688 1457 4323
-4270 4128 4265 4331
-4332 4330 2000 4113
-4333 4331 4069 4068
-4316 4097 4332 4300
-4358 503 3907 4305
-4246 4276 567 3907
-4462 4207 4446 4293
-1102 1509 4589 3410
-4618 1492 1447 4354
-4048 4279 4281 2304
-4323 4616 4101 1476
-107 4260 4402 4329
-4229 4249 4051 4369
-62 4656 109 4347
-415 3800 1505 1785
-4261 4257 4346 4357
-4272 4347 4695 4345
-4114 4343 4622 4346
-4704 4679 4609 1377
-4356 849 880 4104
-4939 1006 804 5076
-1329 3228 5035 611
-4696 4686 1450 4357
-3057 4012 4771 4400
-1549 4338 4628 1489
-4407 4718 4745 4632
-4658 1062 4349 4949
-4345 4101 4352 1443
-4169 247 4318 4334
-415 2381 4011 4384
-616 1727 4108 4289
-4497 4273 608 1440
-1705 593 950 4363
-2974 4364 4366 4362
-4363 4280 4365 4369
-4364 4208 4366 4368
-4363 4365 4166 4367
-1943 1503 4366 4097
-4365 668 4249 4319
-4364 4370 3273 4342
-593 3928 4369 4229
-4281 4092 4152 2304
-4491 1721 1482 4227
-4195 3640 4214 529
-4302 3939 115 729
-4382 4423 4631 4050
-1727 2017 4108 4085
-4226 4273 4758 4640
-4545 4758 4437 4392
-2033 3648 4299 3927
-4576 1627 4570 4575
-4436 4473 4494 4470
-4394 4375 4553 4424
-4418 610 4414 4601
-4359 3958 2090 1943
-4649 4604 4673 4550
-4537 594 92 609
-4443 1783 3961 4296
-204 4827 4713 5071
-4397 4047 4107 4434
-533 4271 492 4488
-1721 4485 4511 4227
-4760 1316 4378 4529
-292 980 4407 661
-4738 4382 4606 4662
-4231 1114 4886 3432
-1669 1469 1676 1512
-4398 4389 4449 459
-608 585 4443 4397
-4637 1541 4625 4626
-523 4626 4353 4424
-4540 1514 4593 1485
-4630 4341 184 4629
-640 4590 4431 4510
-630 1225 4307 1733
-4517 4537 4237 622
-4169 247 4273 4226
-4785 4393 4196 4355
-4414 1464 4601 1512
-4432 1572 3318 176
-79 2027 3178 488
-4260 1689 4100 1572
-4422 4413 247 4025
-4412 4052 4262 4230
-1669 649 4383 4408
-4416 4049 4230 4269
-2101 4232 4324 4415
-3720 4170 4289 3684
-1495 4600 1481 4383
-1535 4583 4420 4461
-4435 176 4107 4419
-4642 4422 4273 1440
-4421 4659 4412 4433
-4430 4661 4375 1485
-4382 4400 4606 4430
-4776 4763 4777 4767
-5129 5109 3425 5119
-1457 1460 4592 4616
-635 1620 4580 4636
-4947 4728 4247 4678
-4423 1676 4424 4612
-4638 1572 4432 4403
-4431 4409 4433 4435
-4434 4025 4432 4422
-4389 4433 4435 459
-1535 4432 4434 4420
-4491 4292 4381 4492
-3054 4051 4438 4378
-4437 562 4476 4481
-168 4291 4181 4255
-569 4295 4441 4483
-4440 4444 168 4255
-4313 4629 4052 4659
-4398 4085 4387 4449
-4441 4295 616 4289
-4214 4195 168 3923
-4447 4336 4223 3927
-4446 3794 4462 4448
-4447 4298 3950 209
-4397 3974 4443 4573
-637 4465 4492 4297
-4453 600 4503 4500
-4292 4500 1721 3978
-3935 4084 4504 4451
-4577 4538 4570 4571
-4462 711 3965 572
-4469 1784 3978 4515
-4458 4468 4493 3922
-4494 4457 3922 4460
-3952 4055 3831 4464
-4055 729 4458 4464
-94 4582 4475 4419
-4336 4447 4071 4455
-4313 4536 4319 4109
-4459 4460 4470 3977
-4450 3969 587 4466
-4297 4465 4179 4039
-3831 4203 4293 4468
-4055 4467 4457 115
-4456 4485 4299 4499
-4297 4381 4464 4471
-4473 711 572 4470
-1183 3961 600 606
-4471 4284 4381 4495
-4194 4255 4486 4487
-3335 4570 1541 4461
-3968 4438 4477 492
-4476 4478 4484 3286
-4479 4197 4483 4477
-4255 4198 4478 4487
-3950 209 4165 4284
-4438 492 4529 3684
-182 1402 4605 981
-4478 508 4440 4484
-4477 4483 3894 4168
-3978 4496 4469 4391
-4474 4289 4218 3684
-492 4474 4479 4488
-4390 1379 4487 4054
-4492 637 4490 4504
-4491 3922 1482 4489
-4490 4372 4494 4436
-4450 3935 4489 4436
-4494 4457 4495 4227
-4491 4493 4458 4381
-4473 4293 4496 4493
-4284 4495 3927 4485
-4522 4361 1316 4533
-69 4248 4518 4546
-4516 4544 622 4469
-4451 4521 3980 4452
-4577 4513 4546 4556
-573 4296 4532 606
-4451 1479 4274 4504
-4453 4489 4503 590
-488 2027 3658 4563
-4542 1782 69 2027
-3658 4519 4121 4561
-4245 4564 654 4781
-4813 4634 4974 293
-4587 635 4403 1535
-4237 594 4391 622
-3766 4534 92 622
-4501 4538 651 655
-4701 4252 4309 4526
-4516 4521 538 4456
-4523 4517 4515 4499
-4516 4518 4521 4405
-4498 4520 4517 4537
-4535 4544 4507 4534
-527 4518 4248 609
-4515 4517 600 4500
-4497 4525 571 543
-4542 69 4516 4544
-649 1460 4613 1495
-4522 546 1335 1381
-4541 4760 4514 4761
-1068 4158 4786 4834
-4843 4799 4554 3030
-4530 4392 4481 4532
-4760 4531 4529 4271
-4530 530 573 4303
-4529 4533 3684 4502
-4497 608 4532 4296
-651 4519 655 4512
-4519 69 4546 3658
-4463 4642 4640 4579
-3766 4386 4518 4405
-4513 92 655 4454
-4573 4572 2091 94
-4306 4401 1620 4050
-4545 4526 4701 4775
-573 4506 4523 530
-530 3803 4544 4238
-4523 4543 4519 4499
-3054 4378 4541 4774
-4498 651 4535 4501
-1335 4204 4567 4563
-4670 1383 4669 4663
-184 4630 4741 4654
-2922 4647 4385 4674
-4658 5071 1386 1062
-981 4740 4730 4732
-4050 4607 4382 523
-4846 4528 4805 185
-4245 4749 654 4121
-4576 653 4501 4562
-4626 1620 523 4636
-4591 4574 1627 4625
-1408 1638 1495 4600
-4593 624 4580 4581
-4562 653 4507 4565
-4563 3658 4561 4556
-4564 4505 4562 4547
-4508 4563 4565 4204
-4564 4012 4561 654
-1783 4572 4573 4578
-4576 4547 4572 1627
-4679 4703 1022 4721
-4280 4285 4774 4751
-4380 4454 4575 4475
-4578 609 4454 4582
-4566 1335 4539 4567
-4449 4566 4539 4582
-4558 3410 3335 4637
-4380 653 4625 4570
-4556 4567 4577 4380
-4501 4576 4578 4454
-4248 4577 4566 4571
-4734 4536 4001 4310
-4428 4560 4583 1541
-4593 4560 4626 1676
-4573 3974 4571 4461
-635 4580 1513 4419
-3839 4590 1515 1513
-1514 1515 90 4613
-4630 4592 1457 4627
-4588 3410 1509 4510
-2091 94 4587 1535
-675 4337 4591 3057
-4306 4584 4403 635
-4204 4589 4558 4012
-4586 4653 4427 4631
-1620 4401 4560 4581
-4610 4595 1464 1493
-4596 1494 4594 4598
-4595 4597 4601 198
-4598 1678 4600 4596
-4597 1151 4595 4599
-1408 4598 4614 1384
-4559 156 4418 4597
-4596 4383 4408 275
-163 1549 4618 4644
-1063 4667 4866 3528
-4385 1377 5029 4710
-4482 4726 4623 4764
-4394 4645 4424 4311
-4553 4633 4743 1102
-781 4729 893 3343
-4348 5035 1011 4707
-4611 4594 4663 4614
-4621 1464 4610 1675
-4621 4430 1448 1371
-4524 1376 4585 1358
-4615 4610 4666 4599
-4616 1460 4614 1408
-4340 4427 4617 4615
-4101 4657 4685 4616
-4602 4338 1493 4665
-2974 4684 3103 4678
-5255 4953 3440 5270
-1383 4612 4611 4661
-1034 3009 4347 4695
-4256 4605 3635 4921
-1377 4669 4679 4709
-4558 4575 4012 4399
-4557 4399 4400 4581
-4635 4050 4586 4306
-4649 4354 4710 4652
-4402 4260 4442 4638
-4402 4549 4586 4635
-1413 4661 4592 4375
-4355 4723 4735 4196
-4635 4742 4607 4660
-4509 4322 4768 4925
-4630 4633 4627 640
-4557 4428 3410 4637
-4399 4636 4574 1541
-640 4629 4659 4431
-1027 4225 981 4732
-4536 4377 4319 4759
-5073 5062 5069 4880
-4421 4001 4536 4659
-913 4645 4662 4135
-4673 4665 4602 4688
-4643 1448 4606 4723
-4831 1075 4987 5025
-4550 849 1329 4681
-3292 3346 4988 4797
-2922 4628 1549 4385
-575 588 4652 2922
-4915 4984 3251 5057
-4650 4628 1012 162
-4654 4592 1413 4657
-4655 4549 4740 4653
-62 4654 4656 4657
-4343 1032 4655 4732
-4655 4653 4689 4617
-4866 4551 4356 3528
-4642 4638 4442 4422
-640 4001 4633 1509
-4621 1675 4631 4423
-4739 4394 4643 1413
-4548 4610 4665 4666
-4678 3103 4328 4163
-4669 4663 4618 4644
-4685 4614 4663 4687
-972 5104 5032 4603
-5290 4830 5227 5267
-4624 4548 1447 4665
-913 4548 1067 4689
-79 3178 4760 4761
-5025 4988 3346 4971
-4385 1377 4644 4691
-951 4550 4314 4681
-1329 849 5020 1728
-1022 4792 4825 4692
-4693 5093 4814 5069
-4166 4619 4664 4429
-4348 1067 4568 4624
-4705 919 4686 4696
-5041 4647 4700 4674
-4717 4754 1794 4325
-4804 4729 965 1018
-4619 4278 4858 4911
-4686 4617 4689 4666
-4352 4685 4680 4687
-4686 4666 4688 1670
-4691 4687 4644 1631
-4670 4657 4685 938
-5026 5110 4954 5126
-4314 4673 4688 4705
-4676 4785 602 5040
-4322 4968 5070 4677
-4695 4233 4317 4697
-4346 4622 4694 4696
-4352 4680 4695 4697
-4696 4698 4694 1793
-4706 5049 4697 1802
-4988 5314 1075 143
-5042 4104 1807 4681
-540 4514 4765 4541
-4771 4778 4757 3057
-1067 4135 1024 4568
-4705 4707 4348 919
-4691 4704 4680 4706
-4314 5050 4705 4698
-4704 5051 4609 4898
-921 4731 4792 4791
-4624 1447 4721 4710
-4604 4709 5030 4628
-5104 5032 4736 441
-4772 1093 4978 480
-5024 4388 5012 4320
-4839 87 705 3234
-4937 3255 5076 4977
-5019 5006 5042 4737
-1068 4682 4756 4158
-1024 4730 4355 4135
-5034 4768 5052 955
-4254 4283 3439 4851
-4568 4723 5039 4709
-4959 684 4882 4978
-4135 4645 4632 4721
-4969 3030 4807 3213
-4734 4752 4759 4312
-4727 3635 4605 4776
-4310 4734 4726 4779
-4429 3251 4922 4278
-1019 4608 4683 5111
-4552 4739 4745 4718
-4708 4732 1024 1032
-4731 4639 4552 4656
-3323 4852 4924 4899
-4579 954 4725 4727
-4777 4325 4632 4311
-5101 5072 5107 4711
-4716 5043 5081 293
-4321 4739 4743 4394
-4730 4740 4738 4662
-4552 4741 4739 4654
-1402 4549 4742 4740
-4310 4741 4633 4743
-4778 4742 4607 4738
-4816 4913 5254 3327
-4730 4763 4355 4777
-5138 5141 1018 5132
-4843 4808 4801 4811
-445 4833 4803 4767
-4784 1794 4555 4793
-5267 5227 5276 4857
-3323 4852 4569 4259
-954 543 4725 4753
-4752 79 4795 4780
-4756 654 4682 4771
-4839 4851 3439 2183
-4757 4717 4754 4781
-4702 4779 4756 4782
-4759 4377 4378 1316
-4640 4725 4758 4773
-4392 4671 4530 4526
-4671 4794 871 4526
-185 4770 644 5131
-4745 4425 4764 661
-981 4763 4605 4845
-4701 431 4860 4766
-4765 4244 4859 4309
-4425 4748 4325 1068
-4719 4634 5053 2524
-4811 4829 4789 4808
-5058 4762 3235 4884
-4702 4754 4311 4353
-1644 4712 4979 3660
-4774 4759 4312 4285
-4545 4773 4775 4569
-4774 4788 4541 4861
-4726 4425 4779 1068
-4321 4745 4735 4425
-4321 4743 4779 4702
-4778 4727 4776 4757
-4781 4245 4753 4784
-4782 4780 4756 4508
-4757 954 4781 675
-5103 5107 5027 4936
-4158 4780 4795 4749
-4792 4407 292 4692
-3635 4787 3973 4527
-4312 4788 4786 4795
-4787 4862 4794 4775
-4769 652 4799 4802
-4916 5115 5141 5027
-4987 4708 3423 4902
-4676 1024 4708 4785
-4794 4865 4749 871
-4795 4793 4761 4788
-4787 4794 4784 4753
-980 4803 4799 4196
-4648 4963 4286 4945
-5004 5173 138 5174
-4808 4796 4789 4528
-5203 4816 464 5286
-5055 4747 4823 292
-4829 4869 4789 4806
-4748 4325 4806 4796
-98 1019 4683 4936
-4847 652 4857 4554
-4833 4803 4855 4802
-3235 185 5328 4724
-4747 4799 980 4769
-5069 5062 5210 5206
-4962 1002 4826 3228
-1074 4879 4769 4747
-5222 5344 4835 5106
-5034 4509 4946 5048
-5008 5006 4677 4322
-4822 3315 5298 5320
-4744 666 4800 5204
-5108 5222 5059 4819
-5138 5090 5132 5148
-5063 5278 5345 4817
-5103 5027 5126 334
-4831 1075 4828 4928
-5314 4815 4828 5317
-4928 4843 602 4801
-5085 279 2791 3216
-1011 4676 3423 4263
-4880 4110 4810 5073
-5325 5307 4388 5332
-5298 4822 4884 4821
-4920 956 4802 4769
-59 4878 5279 4668
-4821 4646 4910 4872
-489 4854 3435 660
-4748 956 4806 4834
-4833 3973 4855 4527
-4243 5335 4812 1030
-666 4240 3239 4887
-850 3300 4912 4970
-3328 4215 4849 5121
-4714 4755 1712 3240
-2788 4889 4948 2382
-4948 928 2821 4927
-4215 550 469 4848
-4823 4528 4747 4846
-5218 5241 4953 5089
-4915 661 5057 4764
-4554 5131 4847 4843
-4846 5316 4805 1074
-4870 4906 4842 5281
-1792 4911 4838 4159
-4893 5259 5192 5291
-586 4720 4755 4264
-4751 4856 4733 4861
-3437 3457 3433 665
-4832 4231 4907 3430
-4834 4806 1794 4864
-4852 3303 4875 4860
-1442 4750 607 4805
-2974 4259 297 4684
-4860 4865 4766 4874
-4861 4856 4859 4765
-4852 4860 4862 4775
-4863 4861 4865 4788
-3973 4899 4864 4862
-4863 4865 1364 4855
-4862 4793 4859 4864
-4603 4919 4891 4658
-5142 3210 4990 5181
-4961 5088 4942 5212
-4905 4802 1364 4964
-4848 5287 2687 3433
-642 3489 4907 4221
-5061 4831 4909 4956
-5300 5089 4900 5296
-4875 4877 4859 2687
-4856 4876 4874 3345
-4875 4924 4877 3328
-4876 1364 4874 5139
-4894 4908 4830 5290
-143 4892 4811 4918
-4826 4935 4641 5064
-4889 4282 4958 4983
-4722 928 4948 4266
-5006 5077 5094 5019
-4828 5131 4770 4928
-3256 5284 5192 5246
-4395 4887 3454 5235
-4836 4950 467 4886
-5246 5218 5300 3256
-2786 4881 4959 4840
-5010 3122 480 3082
-4866 215 1271 880
-5279 59 1074 4879
-5237 4850 879 3083
-4112 4277 4286 4878
-4924 1364 4905 4899
-1505 4982 4976 4901
-3257 5018 1021 5221
-4902 4707 3423 5052
-4733 4863 4895 4923
-5205 5232 4873 5293
-4896 4981 4163 4328
-1034 4898 4791 3009
-5220 4933 5231 4308
-4961 5293 4994 172
-3447 4869 4920 4895
-642 4907 469 4848
-4906 4871 4854 3239
-4286 5178 5313 4878
-5073 4910 5053 4872
-4263 3423 4909 4831
-4684 4103 4849 4966
-4837 4960 3362 3340
-666 3370 4744 5287
-4112 4964 59 3447
-4651 4917 4845 4921
-5132 334 5115 4790
-4915 4920 956 4923
-4879 3447 4920 4984
-4866 5032 215 1386
-4918 4905 4829 4917
-4922 4923 4915 4623
-4728 4921 4256 3323
-4921 4899 4917 3973
-4234 4876 4895 4733
-5193 4929 2524 4634
-5015 4974 4993 4929
-5015 4841 2822 4999
-4884 4823 4287 4821
-4926 4934 4925 4991
-5342 5122 5011 267
-1095 5124 5110 5136
-611 3228 5008 5006
-4971 1711 4957 4903
-5084 5191 5193 4929
-468 5058 3235 4880
-4804 4783 996 441
-4715 4965 688 5024
-4301 5070 25 4941
-893 4350 5007 5014
-5258 3452 5280 4967
-659 4938 5075 5140
-4868 4162 5292 782
-2382 4105 4983 4268
-5310 5336 5124 5304
-3292 4103 4797 596
-4974 1571 4973 4813
-155 3251 4429 1099
-4840 4882 4841 4993
-4356 5019 4104 5021
-4887 5204 5224 5235
-4987 5025 4250 4975
-5140 5208 3438 5333
-5251 4844 4620 3444
-5054 4690 5185 5152
-4956 5017 5209 5061
-4872 4972 2524 4955
-3317 4992 4985 4933
-4881 4125 4959 4980
-4889 4958 685 4722
-4912 1114 3359 494
-1739 4868 4904 5208
-944 3213 4110 4810
-3339 4797 4966 5202
-4914 5146 5233 4869
-4937 5083 809 3254
-3 4963 4911 4159
-4940 5234 1114 494
-4693 5193 5194 5210
-3235 4287 4724 4110
-3084 3 4837 3340
-4972 4672 4933 5220
-4956 5025 285 4971
-2382 2012 4105 4946
-1023 4946 4926 4509
-4976 4951 1085 3009
-4114 4250 4896 4975
-3528 4715 5021 1100
-4979 4722 4266 4712
-4980 4978 4985 4772
-4958 4981 4019 4979
-4982 4985 4901 4980
-4983 4268 4896 4981
-4881 4943 4267 4982
-3292 143 4651 4918
-4957 4981 4979 1711
-1728 5020 1128 1386
-4791 4646 921 4951
-4699 4672 5313 4648
-5152 5099 5078 5185
-436 4867 683 4997
-4993 4929 4992 3317
-4991 4268 4957 285
-4926 2382 4948 4991
-1739 5239 5170 4904
-5004 5173 5003 1108
-5003 5189 5046 5092
-2764 4990 4998 5181
-1838 4997 4999 5001
-4998 5016 4927 5000
-4999 3279 2220 5001
-4998 5002 5000 2896
-5180 5197 5001 2903
-787 4996 5047 4995
-841 4798 3230 4995
-746 3280 5179 5244
-4932 4883 4814 4716
-4939 841 5054 5144
-5053 4932 5073 4814
-5087 3434 1037 5143
-952 5245 1039 4890
-5206 4930 5333 1767
-4713 5068 5151 3081
-2637 3152 5173 5189
-1006 4939 1019 5074
-1023 4926 4927 5016
-683 5084 5015 4999
-5220 3315 3436 4955
-4897 3258 5213 5130
-4949 4883 4716 5083
-4675 5030 4986 1012
-4977 5083 4949 116
-5162 5172 5086 5046
-5087 5145 1037 5158
-4937 3254 5151 4713
-4646 4672 4951 4972
-3081 4690 5054 5074
-4820 5067 4790 4783
-4327 881 5177 5156
-1329 5030 4604 5035
-5029 4710 5038 5020
-5169 5322 5303 5324
-4667 1073 4919 4711
-809 838 1056 1788
-4233 4719 4813 5049
-5029 944 4609 4351
-5092 5091 755 5142
-5069 1767 5093 3441
-944 5039 3213 5030
-1022 4721 5040 5038
-4692 4196 3030 5039
-5042 611 4681 5050
-5043 4716 4700 5041
-5042 4737 5048 1797
-5194 1029 5140 5208
-5213 5086 1169 5046
-787 5022 5045 4996
-5087 1108 5003 5091
-5049 5043 4813 205
-4698 5050 5034 5048
-5049 5051 5041 4706
-5050 5052 611 4707
-5051 5053 4898 4719
-5052 5008 4909 4768
-5143 4954 5007 5026
-5056 143 1075 4801
-5055 292 921 5057
-4651 5056 1027 4845
-699 4770 4935 5297
-4304 4817 5133 5067
-3258 766 5162 5096
-4872 4955 5062 5298
-4641 5061 4809 5297
-5124 5304 4819 5278
-4880 468 3441 5326
-134 5133 5153 5078
-3317 5191 5231 1960
-4304 5136 5059 5027
-5307 5310 5012 1095
-4641 4809 4677 5037
-5079 5194 4938 4693
-4551 4388 4320 5072
-5071 5332 4736 1386
-4641 4909 4826 5008
-5103 843 5014 5026
-5087 5091 3341 4941
-688 4350 70 4715
-4883 1010 204 1062
-5128 5065 4989 5222
-5080 3358 25 5070
-5079 293 5081 3253
-5082 4737 855 5080
-5083 5081 1120 809
-5021 4965 5019 5082
-5016 5190 5201 4934
-5086 1017 4824 3217
-3258 5022 5085 5045
-5009 5047 5023 5075
-4326 3436 4162 4868
-4873 4844 5205 3226
-5116 5115 4818 5147
-5075 5047 5036 838
-2007 4996 5036 5184
-4301 4677 5037 5094
-3254 4883 5093 204
-5159 1091 5200 5198
-5128 5060 912 4327
-5159 667 5186 2701
-1091 696 687 3243
-5145 3229 4989 5128
-5207 106 5169 5343
-5105 4320 843 4736
-877 5104 1006 98
-4783 5074 1019 4820
-5102 4667 5105 4711
-5104 3255 1006 5101
-5130 4812 4243 5118
-843 5137 4783 4736
-5124 5223 5110 4817
-5236 4426 5127 5284
-4931 5108 4690 4304
-5132 334 4729 3343
-5319 4288 5217 5311
-979 5114 5138 5116
-5113 5116 108 5141
-4790 5133 4916 5090
-930 5114 5113 5090
-334 5126 5153 5133
-5106 5296 1163 5221
-5226 5127 4426 5269
-1163 5221 5170 5161
-5165 4838 839 5281
-5321 4930 5339 5343
-5322 5250 5169 106
-4931 4944 5108 5063
-5305 5303 5278 5330
-4820 4304 4690 5117
-5270 5119 3440 5109
-5130 5096 5099 5078
-5254 5204 4426 5224
-5018 5128 5157 5106
-4762 4884 5316 4846
-4746 4916 5111 4818
-5115 5059 5117 5065
-5299 5310 5307 5340
-5288 882 5265 5342
-4931 5278 5067 5137
-1095 5136 5107 5331
-998 5113 4746 4818
-5165 5146 4877 5287
-4941 5044 3341 4952
-4746 4790 5114 996
-5036 466 4867 5184
-5144 5009 5054 5151
-688 5143 1108 5007
-5023 787 5099 5157
-613 4964 5139 3327
-760 5090 5148 134
-4818 5147 5149 1016
-3343 5148 5156 1015
-768 3257 3227 696
-5024 3434 5143 5012
-4954 5153 4989 5155
-5152 5117 5065 5154
-5155 5153 5156 3343
-841 5152 3230 5154
-5154 134 5028 5149
-5158 5213 5145 5130
-360 5157 5023 4243
-5097 3227 2679 5095
-3279 5179 5197 5163
-5195 5200 1021 5120
-5060 5171 5022 912
-5160 5167 5168 5190
-1960 2220 3279 746
-3328 5139 5121 613
-5219 721 5243 5238
-5163 5261 1739 4326
-5163 1739 5199 1029
-5031 5123 5323 5100
-5120 687 4994 5200
-5162 715 5172 5187
-5022 5171 813 5188
-4995 672 4798 5013
-4798 5176 1168 5175
-5177 5187 5174 881
-5174 1165 5187 3152
-912 5028 5175 3230
-4908 3357 5312 5237
-5160 5005 5196 7
-5181 5198 5002 5186
-5182 4867 4997 5180
-1129 5183 5181 5186
-301 5184 5182 2791
-5092 1169 5142 5183
-1037 5223 4989 4954
-5182 5097 5180 796
-5175 786 5171 5176
-5189 3152 5172 2704
-2007 5013 4996 5188
-5191 5084 5163 3279
-5066 4934 5214 5190
-5315 4885 4850 5277
-4968 4925 4934 5209
-5070 5201 5044 4968
-5211 466 5161 360
-1170 463 5179 5197
-5198 5196 5160 5002
-5180 5095 5199 5197
-3210 5200 5168 5198
-5161 5095 5170 5199
-683 5084 1029 5194
-4963 4286 5280 5258
-5204 5236 3452 4800
-4816 5129 4950 5203
-4900 5089 5251 5239
-4809 267 5212 5011
-5303 5295 5100 5266
-5044 4961 4952 5212
-5193 4955 3436 5210
-4968 5209 5212 4809
-1169 5195 1021 5213
-5208 4868 5206 5210
-5045 5211 5018 5157
-5231 4326 5191 3436
-5216 788 658 5275
-5235 5215 515 5273
-3266 5112 5289 5250
-4888 5269 3440 4844
-5166 5225 5244 3354
-4971 5312 4903 5017
-3226 4897 5120 5118
-4817 4812 5223 5078
-1030 5222 5185 5108
-4950 5129 5228 788
-5272 2804 5245 5219
-5119 5257 788 5275
-4668 5233 5282 4750
-5224 5253 3405 5256
-5230 879 5255 5262
-3311 5229 5274 5263
-5214 4903 5066 1039
-4900 5248 5268 5292
-59 5227 652 4964
-4967 3452 5235 5273
-4886 4950 5216 5234
-5203 5109 5285 5249
-3311 5259 4893 5178
-5271 3444 5264 5166
-5260 5205 687 4994
-5257 3453 5264 5241
-4844 5240 3444 3035
-5243 5260 3243 7
-5242 5166 722 3444
-5005 5219 7 5245
-5244 5225 5263 5010
-4888 3440 4885 5277
-5250 4241 5322 607
-5255 5277 5232 879
-5259 5236 5284 3344
-5247 5311 5217 5123
-5255 5205 4953 5260
-5253 3392 5256 5257
-5228 3456 5252 5254
-5129 5253 3425 4744
-5248 5251 4620 5229
-788 5252 5228 3365
-5269 5252 5226 5240
-5202 3357 4940 3116
-5237 5249 4850 5290
-5242 5251 5239 5261
-5167 7 5260 5262
-4326 5261 5229 5263
-5262 5245 5230 1039
-5275 5240 3450 5238
-5135 4239 5308 106
-5305 5309 5207 5343
-5291 4668 4750 5318
-5232 5277 5300 5302
-3425 5257 5119 5218
-5271 5127 4620 5274
-5272 5270 5275 5238
-5273 5274 5271 5225
-5234 5272 5216 2804
-5272 5285 5270 5230
-5271 5226 5215 5264
-5315 3256 4241 4750
-5268 5246 5192 5248
-5063 4819 5136 5125
-4892 5314 5317 4830
-5202 5286 3338 4940
-4848 3451 5121 5287
-3344 3327 5283 5227
-5284 5282 3425 3256
-5283 5109 5249 4885
-3452 3311 5236 5274
-4277 5280 4800 839
-5281 4870 4913 5139
-5294 5135 3252 5341
-5217 699 644 5323
-5259 3344 4668 4878
-5315 4850 5267 5319
-5293 4942 5232 882
-4904 5292 4900 5294
-5293 5288 5296 172
-5207 370 5345 5303
-3252 4873 5294 5118
-5062 5298 3196 5058
-5061 4815 5297 4828
-3441 1767 5134 5339
-5268 4888 4873 5301
-5302 4241 5300 5308
-3442 4239 5301 5268
-5207 5295 5125 5031
-5063 4944 5309 5305
-5125 5304 5266 5340
-5321 5339 468 5329
-4827 5134 5068 5331
-5265 5301 3252 370
-5304 473 5345 5266
-5134 5337 5068 4944
-3442 5112 5250 4239
-5313 5220 3315 5178
-4988 5312 5314 4908
-4699 5313 4822 5279
-3442 5192 5276 5291
-5131 5317 1442 4847
-5279 4822 5316 5318
-5267 5317 1442 5319
-5291 5320 5318 5112
-4815 3083 4288 5319
-699 5122 5306 5323
-5123 5247 370 5031
-5169 5321 5289 5324
-5323 906 5031 5329
-5326 3441 204 4827
-1002 5064 5325 5327
-5326 5328 5332 1128
-468 4807 5329 5327
-5306 5324 5330 5328
-5340 5329 5125 5331
-5307 5330 5137 5332
-4827 5331 5072 5327
-5011 5334 4952 5338
-3438 5333 5341 5335
-5334 5336 473 4835
-5335 1030 5337 4944
-5338 5336 3434 5310
-1767 5333 659 5337
-5306 5122 5299 5340
-5339 5305 5134 5330
-5288 5342 473 5334
-5135 4930 5343 5341
-5266 5342 5100 5122
-5345 3252 473 4812
-5309 5295 5344 4819
+995 939 990 997
+986 0 987 999
+894 2550 2566 2551
+1735 197 1635 1761
+1268 942 941 1277
+4884 1340 1258 1359
+745 734 763 752
+183 1459 1561 215
+385 1254 1053 936
+111 765 682 749
+1787 1555 1636 1702
+3482 3412 3424 517
+4388 4216 3975 178
+1941 2744 350 290
+2065 1659 2146 1611
+2907 408 2910 2831
+3013 5140 5308 4835
+26 58 780 1002
+180 772 1138 1007
+3520 3136 3466 3201
+4220 2317 4178 3645
+671 3074 461 3185
+704 1314 1307 1066
+2813 2970 919 2783
+3202 2557 3474 3463
+3158 201 1170 810
+4919 464 4921 1142
+1919 2345 4098 3745
+123 15 948 970
+1382 1601 1547 1026
+4219 4304 4305 47
+3414 3407 434 3433
+4152 1693 1445 4354
+972 1107 701 260
+936 910 997 72
+54 259 241 1525
+3727 3651 4151 3875
+4145 1794 4281 4444
+193 133 227 1542
+1153 850 1164 766
+3597 231 3530 724
+2083 366 1954 2107
+1154 829 956 168
+794 4185 420 3374
+3878 3777 3776 2213
+221 549 1442 1688
+3022 2922 3021 2508
+3098 3213 3217 2606
+3262 4951 3106 3087
+2036 2008 28 2016
+167 69 4970 1807
+1381 1565 1346 772
+4661 4935 3092 3353
+4191 3040 4173 3783
+177 2267 2227 181
+1961 1077 262 1779
+33 1705 1704 1694
+1551 1602 1610 1608
+738 963 1200 805
+861 333 961 588
+15 140 628 1011
+1108 2398 2700 2571
+613 2713 1930 2499
+1874 1128 1367 1366
+136 3044 3525 3495
+339 914 3224 5170
+1951 2251 1980 2043
+1770 1442 1787 221
+628 1163 949 988
+827 97 777 399
+1097 1812 1157 1177
+4822 48 1813 978
+4166 3579 3036 3656
+3384 3402 694 687
+994 862 975 32
+2599 395 342 967
+777 1242 860 399
+1021 4272 987 859
+1063 1446 1332 1846
+5092 5098 5193 3158
+1284 1294 1288 766
+881 852 105 2614
+1395 2150 1955 2137
+3371 3277 4872 4282
+5004 3347 603 3255
+2060 2233 2185 2207
+2999 4211 1463 3247
+444 2947 393 570
+3428 3497 3512 3392
+2957 2996 3026 1998
+1284 1216 352 708
+1601 1599 1600 1026
+4969 346 540 3339
+5121 5268 5076 915
+119 190 411 770
+3291 1132 4112 555
+787 142 985 888
+3467 2804 2557 3475
+972 110 2604 732
+67 818 767 702
+3839 3645 3652 3749
+1246 763 860 734
+666 743 793 853
+1016 5115 5067 4936
+1483 1625 1496 1452
+638 4183 4143 554
+3218 5137 5295 4789
+2888 2625 79 804
+3550 3148 3373 3428
+176 682 147 745
+3434 1010 4865 383
+2164 2319 2203 3601
+175 2677 96 1133
+783 765 7 749
+2460 2775 2749 2734
+3662 522 3652 3397
+1266 1260 1282 1201
+400 2890 2615 2521
+208 1389 978 1099
+277 322 1883 1922
+1773 1137 1078 1797
+1060 1111 92 1162
+2182 1921 1924 2175
+1610 1608 1532 1399
+645 610 646 3845
+151 26 462 752
+888 2599 2386 868
+2279 242 225 2163
+450 3413 3406 2135
+1049 1007 219 149
+424 3077 4177 4065
+818 784 822 699
+4833 5091 4237 5045
+941 1301 1268 1271
+1637 1923 2170 2028
+207 1419 36 1415
+504 3000 3709 2203
+1515 212 1587 1628
+582 62 3202 3474
+5000 4944 4934 5003
+863 784 818 769
+1770 1787 568 274
+1163 151 1189 58
+193 222 207 1557
+1545 819 94 877
+2563 4984 2687 262
+242 2130 2029 1657
+1225 1489 275 1736
+358 3301 3033 455
+735 107 380 745
+938 1887 415 3199
+185 4669 199 127
+1115 1130 1624 2705
+1305 140 754 123
+2340 1125 534 3802
+2856 2613 2555 785
+1355 194 1358 1550
+2129 1950 2415 2086
+2372 2388 3038 3725
+4341 4319 657 1511
+696 4246 4785 4776
+1570 207 222 1379
+1476 1694 1647 1525
+1465 1736 569 4523
+4184 4604 4581 4553
+369 2775 1338 2734
+1920 1862 1808 1760
+1336 1234 1397 1552
+421 1735 1648 1761
+1800 1229 48 264
+1213 1385 1149 40
+1304 1297 354 802
+4398 1718 4470 4374
+4553 4376 4552 4430
+3963 4232 4333 1126
+4666 4362 4435 1505
+3817 4089 4087 584
+110 701 1186 1231
+760 863 107 934
+2064 52 1699 2287
+4251 10 4248 4407
+1599 227 984 1524
+1149 254 16 907
+1644 2287 2289 52
+2009 1660 2069 1091
+1496 1466 5 1452
+3641 515 3530 2866
+149 1034 5033 1176
+1955 297 1991 255
+2477 2534 2511 2940
+276 1337 616 1471
+4277 1272 1722 4083
+92 1025 2771 218
+1875 1396 1090 1061
+2051 1969 1996 883
+1425 141 36 1542
+1751 259 154 1539
+2926 2997 2913 2364
+1324 1772 498 1674
+1686 1 1441 1324
+4338 665 1506 1722
+149 823 1060 219
+3671 516 3394 495
+2883 3088 905 23
+3720 2306 3799 2269
+2198 2190 1951 2052
+1384 1147 1680 1632
+710 3264 3222 2919
+1065 1255 1345 1329
+141 159 133 625
+1807 1643 116 1146
+1399 1499 1496 1501
+498 1611 1324 1680
+2422 2448 2387 1921
+1439 1528 477 135
+2687 2504 1928 262
+889 1048 219 932
+1479 690 1484 5
+1216 1239 2591 280
+2635 2675 2390 2335
+305 770 1220 190
+214 127 907 199
+3353 4844 4892 4070
+43 65 627 1406
+1600 159 141 1352
+278 389 2236 2439
+2058 1843 1591 4017
+2043 125 2044 2052
+1851 587 4032 2097
+179 1425 36 1313
+1854 1775 1772 1757
+2026 2005 1150 1724
+3823 3855 3746 3738
+38 289 3671 3695
+4565 4612 4585 1593
+2772 2910 408 2544
+3728 3774 3748 2331
+3685 3750 3823 3778
+1384 1654 1653 616
+3014 2485 3033 3008
+1929 2149 1912 1859
+1918 2447 1949 1638
+2971 1821 2976 286
+2126 2123 2121 33
+2282 2309 125 144
+2121 2123 1917 2053
+4146 4681 4709 4928
+2637 1592 2996 2242
+744 3932 1012 5026
+2147 2164 2322 586
+1449 631 1763 4664
+3801 3285 301 4209
+3101 2904 3572 3602
+1522 1383 1462 1516
+4411 4440 3903 3796
+2077 2230 3799 1353
+772 180 1875 1061
+1209 186 2137 1666
+1950 2315 2430 2192
+3249 3120 3176 3314
+3540 3543 3521 3178
+1704 1750 33 194
+1153 1179 1190 31
+2297 501 2294 2304
+53 143 2012 213
+718 2585 2590 841
+1827 1807 167 1819
+4873 5257 4815 5282
+2160 2100 2131 1866
+4417 3311 4081 3826
+2173 2069 1091 1960
+2019 1719 1711 1669
+3403 3372 550 3518
+1609 616 1495 1526
+1553 1134 1782 1526
+1560 1352 1566 1557
+1669 4327 1734 139
+959 1802 1744 145
+1494 1477 188 1518
+117 1948 1940 1912
+2480 223 2392 2402
+336 2385 2829 2884
+871 216 790 1545
+2624 3318 2815 3152
+875 854 898 4950
+3185 611 4047 3814
+4425 4310 1790 4620
+2315 2189 2262 2261
+240 2841 1997 2365
+4967 3363 4804 4324
+2730 3308 3176 567
+231 3597 3393 3605
+2712 2711 2474 11
+1876 1394 1274 608
+2667 3494 379 3435
+2996 2957 2473 2438
+2425 2313 2809 2041
+1792 1793 1556 1340
+3266 3263 717 2993
+186 1989 2400 1521
+3081 1896 3156 2972
+2115 421 2054 1681
+509 2278 3709 429
+249 4192 4164 4360
+1353 2077 2064 2097
+1382 1204 1207 1547
+2424 1104 3032 2809
+2701 2510 2603 218
+2450 2422 2214 2233
+2773 2703 1194 1193
+2039 1937 1895 1612
+1431 1949 350 2428
+3333 3374 4212 3293
+2236 1619 2444 312
+2442 2120 311 363
+1638 1943 403 2178
+1883 322 1925 1840
+2824 417 2380 1871
+2711 855 2475 2286
+1367 1882 1350 355
+2366 402 2511 2325
+2256 2188 2282 982
+2109 1755 2098 1666
+3279 1139 3309 2838
+314 117 1863 1852
+2115 1662 421 1752
+4495 4251 4248 4178
+4037 533 3854 3986
+1980 2060 2185 1951
+2690 396 1834 1868
+3674 584 3949 3809
+3121 2568 2352 3138
+3909 3851 521 3889
+2216 2418 1873 2240
+425 1139 3251 2840
+360 993 57 2825
+3180 3250 3160 2810
+3575 3559 3573 3506
+444 2611 279 2513
+2903 2954 2385 2948
+3996 600 4072 423
+3226 63 3222 1169
+392 3232 2595 464
+878 2555 395 805
+808 852 2792 73
+787 2548 2591 352
+2351 3031 1759 2870
+2586 2923 2958 2589
+3147 688 90 3297
+2184 402 2366 2281
+2588 2559 838 894
+3783 3851 3785 528
+2759 309 11 2423
+2241 2445 2447 2178
+1280 88 343 786
+3005 3123 2920 2959
+1295 986 169 1281
+1885 1274 1394 317
+2859 427 357 2572
+356 730 2791 2790
+2806 2380 146 2706
+2220 2588 2545 2580
+333 861 862 1198
+891 828 2834 2826
+962 574 1021 950
+1918 2389 312 2428
+2490 2924 2870 1759
+1919 4099 4100 2313
+1699 2188 2038 39
+4017 2928 3290 2058
+2322 3712 1644 586
+163 1952 1223 2737
+2595 1142 2558 2822
+2942 3164 3127 3048
+4160 2991 424 1473
+5282 4956 4922 4873
+2909 2922 2508 2480
+3345 679 3350 3297
+3134 2939 3177 2441
+3159 2968 3139 3103
+3952 3941 3987 3944
+292 3430 3404 3485
+147 764 399 750
+3896 602 3901 560
+656 927 880 991
+2846 747 108 4678
+2654 2591 2548 1232
+1179 1153 6 1117
+2640 2877 825 2902
+3217 2606 809 4964
+2965 2479 3034 2808
+2481 2480 2393 223
+2475 2519 2708 2468
+1208 2585 718 2584
+1997 3260 340 414
+2666 2611 2952 85
+2513 2875 410 2905
+341 2855 73 964
+851 2741 2714 327
+2470 2672 2655 2399
+2552 2607 2827 2700
+380 67 735 74
+2831 115 2884 2515
+2325 3684 3046 2707
+2407 318 347 2333
+2394 2286 2334 313
+2674 2720 2671 2579
+2181 2279 2299 2099
+3488 3425 2799 660
+504 3709 3787 2228
+410 233 13 2515
+2002 2290 2329 2182
+2397 408 2520 394
+92 639 1060 1034
+2338 2337 4138 3792
+3400 3656 489 3653
+3255 392 417 4854
+1003 148 2912 3110
+452 1127 1126 2049
+4994 2379 315 414
+3661 4123 3400 3656
+561 4004 558 3830
+1777 1129 41 3056
+299 323 2143 166
+4402 4408 620 4262
+492 4000 338 482
+128 1783 514 372
+3676 3629 3615 332
+3715 3713 3667 3078
+2861 730 356 881
+3011 2589 2907 2916
+1123 3705 3771 300
+2843 3146 3123 2959
+3290 3319 1713 2928
+4475 4468 4389 3981
+3285 4281 4462 4260
+470 3492 3035 29
+1880 1250 1870 1900
+569 1225 1435 779
+3141 3144 3059 2942
+3345 4931 603 1058
+4032 3834 1967 4045
+3378 3677 3694 3631
+5273 5287 5278 5210
+3090 3177 476 2998
+533 4035 2066 3895
+85 336 2933 2513
+3072 515 3527 3639
+4051 4417 665 3291
+2966 2280 3717 3736
+2223 2305 3754 2321
+3984 3798 2090 3970
+517 3412 3407 126
+3019 2102 3483 611
+774 1915 416 2058
+1668 2054 1666 1654
+4299 3939 4352 4346
+2528 146 2706 3009
+2289 1953 2303 2080
+3573 3479 3482 3625
+4814 5134 5131 901
+3531 3520 912 3164
+4833 4710 4314 5041
+4150 540 19 635
+754 123 1000 842
+3104 1731 3438 3484
+673 4968 24 340
+1306 1158 1298 803
+1414 2708 2464 1909
+4774 4796 4680 4769
+3745 1104 567 2424
+3292 1919 4098 2349
+3433 2852 3450 434
+1116 4965 4264 2963
+811 3204 3125 2947
+2852 3437 3450 3435
+3229 5167 5129 5081
+752 934 842 751
+442 3128 2981 2926
+1438 1674 212 1625
+3607 3162 3576 3560
+703 3083 687 5245
+2303 1956 2072 1206
+2949 2947 2937 2616
+4137 3922 2336 423
+1409 952 1398 576
+4883 1005 5030 4726
+610 1737 538 3934
+4563 4422 4507 642
+3838 3991 2091 3822
+3900 3910 3843 3865
+3623 413 3619 3399
+4038 4084 2991 1473
+554 4149 496 617
+2040 3962 600 423
+2967 3731 3660 1509
+599 593 3780 3904
+200 3599 3616 3393
+4000 491 3636 4060
+1463 4215 4176 4206
+210 196 1620 1631
+3376 3607 3377 3559
+887 3081 2353 2307
+2357 505 2085 261
+1954 1749 2067 2083
+4225 4169 3956 4182
+3953 134 407 3710
+1749 501 2358 2067
+2426 2427 2187 1706
+2292 2373 2288 1956
+2936 3055 3150 3380
+2055 300 2228 3778
+2324 2321 2278 2305
+4412 4487 4115 3936
+2071 2260 2026 2232
+2185 1951 2190 2250
+3077 424 4131 4111
+3609 445 3691 184
+200 2866 3071 3634
+9 450 3418 3627
+564 3064 2011 1129
+3639 3650 3072 3631
+3839 4193 4195 3648
+3879 3872 330 3882
+113 2980 3596 4066
+3899 3637 3875 3650
+3707 560 3845 3897
+2992 3327 3348 3269
+3845 3857 562 3819
+2342 3681 3682 2086
+349 3886 3527 3917
+3356 658 4183 4143
+3724 3717 3730 3714
+3742 3710 3795 2179
+3840 3954 4468 4450
+3758 325 443 3859
+3947 1972 4036 152
+3864 3670 3921 3733
+4267 3744 4079 4090
+3528 3706 4025 3552
+485 3570 592 3934
+3570 3930 3370 3918
+461 90 671 3336
+1537 2733 609 1519
+4532 4503 4772 4445
+4794 5241 4882 5302
+639 5014 1034 761
+799 712 822 793
+2284 2048 2337 552
+2017 1646 572 2107
+2715 2503 1182 1906
+1665 4607 4575 43
+2352 270 3044 3107
+1470 1798 1817 1811
+546 3788 3772 3723
+1923 2187 1973 2035
+491 4000 103 1791
+1645 4038 93 3825
+3643 2266 3923 3751
+714 3521 1131 3524
+1851 559 419 3779
+561 558 3953 3710
+646 524 381 3898
+559 4019 419 3828
+526 3858 3054 3608
+3481 3390 3464 3547
+2973 518 2332 3132
+4045 4059 4028 4032
+4661 3242 3254 4663
+2104 4077 288 468
+1734 1764 1617 139
+1466 161 436 4580
+2217 2905 2634 85
+1993 1673 1968 1966
+1713 547 1742 1963
+4422 4050 4538 4542
+5116 5073 5067 362
+4303 4363 4296 4477
+1315 483 1540 1379
+1851 4032 3969 3712
+742 842 751 1253
+4130 4506 4306 4487
+4025 724 669 3697
+2664 636 2845 4243
+3044 136 3115 3389
+3949 3817 3334 3724
+174 4084 1990 328
+2276 4022 3311 4081
+2021 247 2267 368
+595 226 4004 2096
+1168 1111 1167 57
+973 1098 1191 879
+2440 1989 2069 2176
+4263 4104 2276 4008
+593 538 594 597
+610 592 602 494
+602 592 3926 3902
+4031 3834 587 1469
+1469 3831 4006 3972
+3934 592 599 3906
+3987 3841 1708 3998
+597 494 3780 3905
+338 3972 4289 492
+1434 4566 1095 4578
+593 594 646 381
+3346 438 82 3304
+4289 2350 4467 4280
+4378 4279 4016 4502
+3451 3360 2476 3214
+1141 1769 1349 1373
+622 1315 1327 291
+1624 541 1194 2660
+122 485 593 3780
+283 3057 3069 451
+4625 1464 4644 4571
+60 2689 2472 2575
+3635 4135 3955 3846
+4104 4301 4023 4411
+271 236 1613 188
+3759 4067 4486 491
+1311 1258 1333 1359
+1493 1211 1467 1516
+3928 1640 1677 422
+4885 5040 4727 4714
+952 608 800 1349
+4460 4527 4504 651
+1527 4622 911 4509
+1540 1536 1415 207
+4595 1493 1527 1462
+4234 4608 4288 221
+66 780 58 748
+3326 4262 1718 3928
+4513 4554 4526 4388
+248 4310 1410 4431
+1099 1130 5018 1145
+4184 4581 4162 1272
+3620 3552 3554 3612
+3744 3341 3814 461
+713 4241 581 3431
+4293 4560 4331 4558
+103 3397 3662 1791
+2592 5104 411 544
+4317 4133 4416 3963
+4528 4520 4519 4490
+2943 4517 486 4470
+4393 4500 4167 4184
+4518 4522 4517 3974
+3751 122 3871 3054
+3871 122 602 560
+1014 947 3995 1743
+4470 4456 4472 1718
+3870 3820 3853 3850
+651 4524 4525 4504
+4533 4522 650 623
+4716 4499 4052 4542
+4511 4541 4591 4347
+4515 4527 4460 4547
+977 1007 1031 1049
+923 5158 5190 382
+4219 4343 4667 157
+4175 4190 4174 529
+4689 4798 3168 977
+406 671 688 2782
+4159 4715 4642 4641
+4961 3451 700 3357
+4954 4244 4810 4963
+4894 4266 5311 5240
+198 446 4416 1701
+699 100 822 1287
+4557 4549 4293 4533
+949 1000 998 940
+4188 580 4186 3658
+1731 3234 3241 2800
+19 540 660 3220
+4179 5310 5307 5002
+464 5173 955 3232
+747 4884 744 1340
+5215 3421 3357 3355
+773 2701 2739 1025
+899 810 789 944
+1311 977 1031 1013
+3275 375 3354 3187
+4093 4394 4538 4422
+5109 5225 3245 5345
+764 769 7 107
+4886 4723 4956 4609
+912 3523 3060 3139
+3241 3467 703 3438
+4929 4265 3119 5130
+71 3460 479 3451
+2799 660 346 2878
+1370 1441 1442 1738
+215 1500 1330 1452
+1676 1472 4565 4573
+1396 1155 1053 939
+816 1251 1013 1006
+71 3487 3477 2557
+2804 3241 3476 2800
+4736 4722 4802 158
+5343 3329 915 5179
+2903 2385 2907 2831
+784 666 129 767
+729 662 3460 3233
+31 1188 175 1190
+97 769 798 764
+685 479 3183 876
+846 1306 20 840
+994 983 940 969
+940 983 791 746
+1445 4772 4052 4503
+1202 856 937 88
+5324 5309 5308 4948
+205 2828 938 2659
+4902 4901 4240 3442
+869 768 545 786
+636 2664 3277 4207
+2945 3534 557 3519
+3445 3082 3555 3536
+5025 4917 4828 4655
+1003 296 3264 2990
+391 263 844 2584
+4323 5196 5227 5205
+5202 5229 5314 5059
+722 3431 3406 4217
+3413 4242 721 3938
+729 3234 5230 3187
+580 4121 4123 38
+853 787 985 793
+2612 1185 2610 2632
+744 4865 747 4703
+3484 3513 3488 1731
+723 5071 3183 700
+2792 357 427 852
+866 869 806 781
+931 872 96 1144
+1185 2648 2610 2665
+4 803 99 1305
+399 760 147 763
+1293 846 840 933
+4708 5041 4885 4229
+937 965 56 864
+2570 2629 921 2523
+1597 1313 1471 1491
+1226 1041 1195 1045
+806 578 781 1247
+793 799 2386 100
+246 727 674 4668
+107 759 147 4
+966 706 960 806
+727 383 674 1405
+1021 950 628 988
+765 759 7 111
+782 380 759 1265
+475 760 578 763
+123 934 475 4
+1333 1110 843 1381
+1261 151 1296 462
+1359 1173 977 3168
+1085 850 1070 1190
+2696 2679 2636 2610
+1992 1936 1942 1730
+749 750 745 1240
+778 176 735 751
+4204 879 973 544
+768 781 827 1283
+751 735 99 4
+702 682 782 380
+111 782 7 749
+37 847 78 1217
+1241 97 699 798
+822 712 762 1249
+798 702 138 682
+218 1197 831 92
+1048 834 989 926
+254 49 16 1074
+931 676 872 1109
+452 3993 2130 2057
+2623 921 2620 2527
+4044 5050 4798 5031
+74 1205 1241 67
+781 863 827 760
+436 1741 1259 4551
+998 15 628 859
+762 731 778 742
+783 764 765 750
+798 782 111 945
+138 799 129 699
+1199 871 790 153
+352 865 787 712
+725 343 94 786
+5002 1481 5155 5244
+677 809 828 2793
+1200 785 280 805
+856 706 937 806
+3252 839 870 2848
+725 545 743 100
+3064 2339 41 3066
+969 998 859 971
+2832 2006 2836 826
+4360 4115 4446 4192
+767 702 769 783
+867 545 784 743
+1377 1343 1327 622
+2731 2656 2668 1890
+1271 1245 169 1044
+1087 1240 465 734
+105 2647 2584 2600
+341 790 56 877
+791 746 731 742
+921 2596 2620 2545
+927 870 880 342
+387 789 810 5189
+677 23 809 908
+472 3145 3110 2953
+2957 3024 2979 2502
+844 819 1208 1036
+2992 3085 2936 3109
+2578 2549 2564 2546
+693 1031 1068 989
+887 2984 2514 1224
+129 827 138 97
+813 2678 821 142
+1974 1185 2483 2621
+1208 819 832 2573
+768 129 545 666
+1166 199 845 999
+2682 2651 2602 1152
+2865 386 2937 2882
+837 879 3337 796
+778 818 762 67
+789 2830 361 2849
+931 1133 1959 40
+1417 3444 4924 4978
+1196 1029 770 1178
+2650 885 821 2652
+5161 1020 845 5169
+771 1062 1059 1042
+910 936 1256 856
+2748 2613 2858 872
+4904 1130 826 1115
+2523 2629 348 2565
+3253 880 792 2812
+928 1279 704 736
+1974 263 2600 2483
+475 960 462 578
+1332 1322 1756 753
+2654 813 718 2673
+5039 833 5075 823
+704 1299 1158 736
+1288 766 1201 1232
+979 939 889 958
+5172 1170 1169 1947
+1267 756 1201 37
+2715 2743 396 1834
+730 2662 79 342
+2673 2548 725 100
+282 968 969 971
+2676 893 2562 316
+708 835 791 1244
+1365 1070 1361 1190
+4107 4988 5054 5135
+892 75 780 795
+1087 933 74 99
+57 958 360 979
+360 72 995 1057
+138 778 866 176
+868 738 865 888
+864 937 869 786
+966 867 731 863
+868 869 866 799
+954 864 867 124
+865 731 867 712
+918 792 808 2377
+1152 280 785 2682
+732 773 2605 836
+2609 2740 1788 1054
+2794 903 2813 2702
+282 990 967 927
+5245 3454 5250 703
+142 878 888 805
+877 2573 2599 341
+826 589 761 2832
+839 382 808 913
+79 2625 427 2652
+1015 5092 5216 5182
+1863 192 1935 1852
+2598 2621 2889 2600
+2636 2585 832 2648
+2887 2827 2631 2644
+500 3103 1896 817
+877 124 94 864
+214 907 1062 848
+2682 2699 2650 2856
+361 2886 899 2627
+5143 4272 1002 859
+855 1952 2765 2711
+348 0 2565 2495
+2696 2398 2718 2683
+1891 1052 1900 1849
+1715 1605 1776 1078
+1018 990 946 282
+891 905 677 2797
+1326 1356 1325 1362
+5179 904 3211 458
+2883 905 903 2794
+2919 902 2908 874
+5034 3229 901 5051
+201 2886 902 899
+5170 5192 5112 3224
+180 889 219 1162
+1170 810 2006 2836
+5214 5251 5236 5035
+32 835 949 940
+1095 4601 4155 624
+684 459 3520 2942
+920 2812 2792 880
+3226 3265 63 3232
+91 697 3449 3211
+5227 5155 4323 5019
+5194 3153 3221 2839
+5038 4313 2895 870
+1944 21 2558 2785
+913 2855 2825 993
+775 2574 807 739
+4828 4792 4856 4787
+991 1017 961 656
+4025 4189 3640 3706
+5098 1015 5038 4998
+1042 943 771 950
+382 5163 808 875
+1263 1295 1302 840
+955 1118 2835 5173
+3455 5222 1069 5035
+773 732 829 956
+214 962 999 976
+860 736 1286 1246
+974 475 752 176
+5112 5219 3221 5192
+6 835 32 1117
+791 738 708 865
+710 148 1003 2898
+848 692 1062 1046
+706 910 705 668
+1269 131 2 1297
+1312 1320 1066 2
+1039 1006 926 1011
+1171 677 2797 2780
+1265 1262 1240 783
+987 898 994 969
+4747 1100 951 647
+26 998 1000 970
+668 66 1296 910
+1011 362 926 748
+4746 947 5037 2018
+1432 483 1035 622
+5118 4686 4080 5050
+967 965 968 868
+4951 5003 929 673
+1086 40 931 1161
+3253 1032 4997 1113
+975 861 976 848
+4639 275 1663 1736
+1000 974 746 842
+57 923 980 1167
+1048 5073 932 362
+965 995 56 964
+992 963 967 395
+983 963 738 954
+974 968 746 866
+964 954 875 73
+983 854 954 966
+854 705 946 795
+971 974 948 26
+970 795 854 5143
+96 1152 31 1144
+1097 1157 589 761
+966 960 970 934
+958 996 72 997
+932 996 980 958
+655 678 755 659
+69 116 1811 1156
+848 1161 1086 861
+999 976 1017 961
+5058 4696 3092 4963
+3964 1658 1657 319
+706 705 965 968
+1419 1026 179 1134
+94 1036 725 2386
+354 1261 1296 1256
+75 1018 996 946
+1043 997 66 748
+1047 771 816 1006
+992 898 991 875
+990 923 993 382
+993 995 990 964
+992 991 333 920
+946 995 72 705
+862 994 992 963
+987 976 1021 975
+988 1046 32 975
+780 668 948 795
+823 932 5039 980
+462 948 668 960
+4632 4843 4842 4700
+5048 5143 892 15
+938 415 717 2955
+4685 4253 4853 4721
+484 4758 5210 4829
+943 693 989 4936
+16 655 1174 127
+1077 4888 4930 4984
+1541 1652 1495 1583
+2395 108 4939 5032
+943 5067 950 58
+2395 246 4711 1023
+4689 678 1427 693
+1101 1100 1084 647
+925 882 4932 5191
+5074 101 5073 5101
+980 1018 5069 923
+4784 1017 987 898
+5125 1069 4932 5038
+5075 833 4925 5168
+996 362 75 748
+4770 5125 4720 2895
+5090 4315 4813 1012
+2906 2876 2851 2615
+190 1109 1999 676
+89 984 1570 27
+1940 1730 2764 1863
+1686 1370 1440 1744
+1814 1219 831 1097
+5331 5068 4914 5119
+1074 678 655 816
+957 5189 2880 2795
+4170 4799 5113 5115
+411 544 185 1178
+1409 1461 952 1343
+985 813 2673 2587
+4229 3434 3322 4673
+5252 5274 5250 4693
+1189 1226 1045 943
+4970 5047 3242 3362
+741 1067 1278 1059
+1043 1045 834 926
+1042 1046 1044 988
+1043 802 1045 1304
+1042 1044 741 1039
+1053 1043 939 997
+1048 989 1049 5101
+771 1047 214 962
+127 1047 655 4783
+1180 1883 1975 1799
+1596 1425 1313 1543
+896 1850 1760 1845
+6 1245 692 1046
+2860 2552 2849 873
+5037 4892 5056 2018
+5188 5187 5004 4854
+1117 1198 1200 862
+4729 438 1160 3299
+1068 834 1061 1041
+119 411 1166 199
+1062 254 1059 191
+834 889 1061 939
+76 1572 1072 1580
+1321 1307 1066 1282
+206 1378 1319 1301
+20 942 1064 1277
+1041 1251 1248 1068
+1067 816 1074 1059
+1019 930 5219 3221
+857 1128 1874 756
+1483 1498 1488 1475
+1398 1446 1336 1063
+1715 1817 1773 1805
+772 1346 1031 1068
+1926 2553 1938 4975
+4643 4318 4692 4649
+1008 3254 3362 53
+1556 897 118 1741
+1561 1437 1498 1530
+1609 1606 1872 1782
+1209 1654 1351 1609
+1084 4286 1101 4647
+5241 5271 5320 5111
+4679 1082 1014 4659
+1368 1201 756 1188
+1143 1155 956 979
+803 1158 1242 860
+1268 1275 1334 1266
+1624 1194 2658 1203
+1806 191 1861 1278
+2175 268 182 1667
+4763 4071 4311 4750
+1458 1748 1502 1234
+3426 4881 5076 3235
+601 911 4415 4421
+4090 2577 2963 1116
+973 1029 68 1178
+1203 589 1099 1130
+116 1098 1156 632
+4423 4782 947 1014
+1082 1939 1014 4695
+4237 5053 4775 4954
+5117 3351 5077 4063
+3302 468 3278 304
+1576 1394 1848 1846
+4697 2845 4831 4875
+31 1152 1187 1239
+2646 2496 2609 59
+1025 1111 1168 773
+1348 1135 753 1411
+588 1109 119 1161
+5117 5042 5015 4725
+2795 1168 957 2653
+3320 3292 4092 1749
+150 1739 837 1120
+1160 3339 471 1096
+1202 385 1057 936
+5000 5203 929 5186
+4870 3277 3371 3294
+1947 1142 4919 1115
+1488 1498 1424 1151
+3415 3185 1671 3074
+429 3753 3739 2305
+3684 3672 3577 2798
+2001 152 2027 3803
+2033 2093 416 172
+2033 416 2053 2019
+1070 1881 61 1368
+518 420 3706 3554
+1098 837 632 150
+3459 557 3541 3197
+1646 2017 93 1645
+2745 110 1231 829
+1382 1869 272 984
+1675 1793 1815 1110
+1792 1812 1793 1177
+118 1813 1792 4076
+1411 1196 16 1174
+3314 3308 321 332
+2075 4082 2017 4085
+607 1342 1346 1248
+370 24 1120 1938
+1198 1179 1144 1086
+1199 1143 972 732
+1926 632 1146 5017
+2504 1145 208 1779
+1678 204 1653 1629
+2743 2728 1586 2677
+1197 168 180 1162
+2210 2071 2456 229
+1121 1437 1594 1491
+824 1107 972 871
+260 37 385 1217
+1385 1365 1361 40
+1361 1179 692 1086
+1099 1157 978 5085
+68 1156 973 5086
+1298 465 846 1087
+4396 1507 4601 1487
+1058 3151 1116 3298
+956 1162 1111 979
+1161 1149 119 907
+1296 140 1304 66
+1276 1254 1267 37
+5228 4873 4878 4723
+1167 1060 3261 823
+4997 588 1166 961
+588 1113 1109 2748
+339 849 2883 1214
+5181 23 849 908
+2660 2006 944 2773
+2790 2830 2848 2791
+1174 1348 1175 755
+1176 1138 1173 1007
+1177 1176 1173 5028
+1178 1174 1175 185
+1136 68 1175 5027
+1097 831 1176 1034
+260 385 1155 1143
+1050 1230 1948 1932
+1424 1608 1252 1499
+548 1964 2510 1460
+1852 1789 2131 1604
+2809 3289 1931 2041
+820 733 726 2594
+175 1188 2542 1903
+1188 1107 2651 1232
+1187 1186 701 1085
+140 1303 1304 1039
+756 260 857 701
+1193 1219 1203 589
+2578 2655 2466 2461
+307 1220 1191 2003
+1089 609 2767 307
+741 1278 1301 1271
+1197 1375 831 1138
+770 1213 1196 1149
+1143 1199 1057 360
+1198 1144 785 2613
+790 1202 1057 56
+1085 114 850 847
+1216 1117 1200 708
+1089 1191 1391 1098
+303 1639 1849 1309
+1289 1286 1283 777
+2324 2194 2323 480
+303 1849 1869 1429
+391 813 821 2463
+1910 255 2138 1081
+1569 2044 2196 1888
+1615 4576 1515 619
+4589 4616 1839 4613
+2510 1460 1197 168
+1947 1944 1169 2558
+2768 2724 2726 2694
+88 1217 216 1202
+766 1239 1216 1153
+1390 1917 1915 2053
+1220 1616 1191 1029
+1193 2603 1219 218
+1994 2255 1841 2265
+2297 2081 2070 2295
+1844 369 2760 2736
+2325 3046 817 2940
+1684 145 1741 436
+741 1310 1251 1039
+4660 4647 1235 4309
+1229 1800 1802 1744
+1773 167 1228 1805
+2694 1975 2693 1180
+1365 1905 175 1133
+1239 847 384 1187
+4603 1464 4540 4629
+165 1357 1485 1093
+1227 4659 4665 4605
+1308 1255 1327 1369
+2122 1832 1642 1635
+1461 1407 1432 1342
+216 1217 1232 1107
+1265 945 803 759
+1262 777 1289 767
+1087 1262 1265 74
+1285 1294 1284 1244
+1256 1243 1247 856
+1273 1254 802 1053
+1263 1253 933 99
+1253 1244 1285 742
+1300 1373 1067 1141
+1280 1287 1283 768
+1531 1906 1824 435
+1300 1067 1226 693
+1433 1181 1397 1562
+1261 1247 1246 578
+1245 1164 1281 6
+206 1319 1236 1354
+1244 986 1281 835
+1280 1288 1287 2548
+618 1426 1371 3
+1454 1457 779 1405
+1325 1334 1316 114
+754 986 1263 1253
+945 1242 1298 1241
+1305 1261 928 1246
+1282 1270 1277 1266
+1242 945 1240 750
+1267 1088 1264 114
+1164 1275 1266 850
+2 131 1329 1088
+1312 1310 941 1303
+1264 1292 1279 1276
+1195 1273 131 802
+4230 189 4370 633
+1861 1275 1271 1245
+1879 291 355 1369
+1088 1273 1874 1267
+1294 1281 1270 1164
+2 1066 1279 1264
+1041 1374 1195 1090
+1295 1277 840 1270
+1249 1284 1257 352
+1256 354 1276 1254
+1290 1264 1064 114
+1285 1249 1205 762
+1243 78 1280 88
+1283 1286 1243 1247
+1285 1205 1293 933
+1257 1289 1249 666
+1257 78 1290 847
+1287 1291 1205 1241
+1288 1292 1291 1282
+1289 1290 1293 1299
+1293 1290 1294 1270
+1286 1291 1292 736
+78 1243 1292 1276
+354 1297 928 1279
+986 754 1163 949
+169 1303 1295 941
+1299 465 1158 1262
+1307 1298 846 1291
+1251 1376 1248 1328
+1065 1310 1195 131
+1305 928 1303 1306
+1189 1302 1297 1269
+169 1163 1189 1044
+1302 151 1263 734
+704 465 1314 1302
+20 1314 1299 1064
+1331 1356 1236 1326
+1204 1745 1864 1413
+1301 1378 1226 1269
+1427 618 1372 678
+1314 1318 942 1269
+1051 227 740 1543
+1306 1307 20 1312
+576 1492 608 1876
+1368 1323 1366 1260
+4678 1457 1453 1428
+1320 1321 1364 1312
+1065 1377 1255 1374
+1321 1318 1339 942
+1325 1318 1320 1064
+843 1407 1412 1333
+1369 1316 1879 1326
+210 197 196 1439
+1260 900 1339 1321
+900 1323 1308 1430
+1236 800 1331 608
+1461 1427 1342 1300
+1334 1339 206 1268
+1380 1484 1420 690
+1327 1363 1308 1529
+76 843 1685 1857
+1372 618 1322 753
+1260 1329 1366 1088
+1568 1824 1853 1576
+165 1360 1357 1072
+1613 1622 1614 188
+2783 1952 163 2712
+1329 1325 1345 1320
+3 674 1454 295
+4664 4602 4600 4730
+1372 1238 1328 1141
+1376 1363 800 1035
+4754 4941 3239 4933
+1364 206 1356 1339
+1372 49 1141 1074
+1894 1531 1574 1889
+1793 1110 1359 1173
+1858 1432 607 622
+1806 317 1728 1769
+1081 1468 1538 1652
+1360 1423 273 222
+2103 253 302 4002
+1255 1367 1369 1366
+1615 1670 1688 154
+1345 1308 1362 900
+1336 1559 1234 1447
+1688 154 1692 1676
+3 1348 618 755
+1352 1560 1336 1398
+1154 857 1396 1155
+1356 1363 1364 900
+1362 1331 1343 1535
+1378 1345 1362 1318
+1154 1695 857 1231
+61 1316 1354 1334
+317 1806 61 1354
+1897 1316 1128 1085
+1236 1354 1274 1323
+689 1444 1028 1663
+1412 1258 1428 1455
+1311 1333 1342 1346
+1374 1377 607 1248
+1319 1373 1806 1278
+1816 1589 1411 1196
+1377 1378 1343 1300
+800 1319 1376 1373
+1376 1065 1364 1310
+576 1398 159 1579
+1383 1475 1330 1483
+1411 1855 753 49
+1134 1553 303 27
+1420 251 1380 1523
+1468 236 204 1541
+1875 1860 1154 168
+1430 1492 1415 1878
+1604 1935 1643 1827
+1391 1740 1470 1616
+1470 1643 1391 116
+1218 1577 2039 1766
+1389 2658 1388 1203
+2382 2184 2420 2326
+4371 4109 4340 1785
+291 1105 355 1858
+2143 80 2109 2114
+191 1361 1861 692
+1551 1423 1252 165
+1360 483 1072 1379
+209 1626 121 1554
+4666 4624 4523 1480
+1652 2140 1606 1583
+1562 1566 1561 1558
+1985 2050 1804 2012
+4673 4654 4545 1408
+4678 747 4551 1259
+1702 1692 4234 221
+1447 1446 1238 1322
+4551 1404 4675 4580
+1560 1035 483 1534
+4659 4679 4362 631
+1110 1375 1381 1138
+1458 1322 1447 1371
+1309 1416 1685 1572
+1619 466 2482 2437
+1386 625 1536 133
+1748 1413 1838 1552
+4989 4705 830 4116
+4122 3940 4974 3013
+133 1570 984 1877
+1383 1330 1482 4594
+1607 1563 1599 1524
+4727 4674 4253 4656
+1433 1397 1600 1352
+1594 1623 1181 1121
+227 1598 193 1051
+1427 1428 1258 2846
+1328 1426 1311 1013
+1371 1426 1448 1317
+1576 1889 1207 1848
+1386 1535 1529 1326
+2427 1995 1706 309
+1238 1446 952 1349
+1423 1595 1252 1566
+4644 4566 4625 601
+1436 1466 1501 436
+1453 1435 1502 1457
+1079 1546 1151 1491
+477 1528 1736 1465
+1441 212 1324 1587
+1028 1444 1764 1803
+1443 689 197 1439
+1443 65 689 43
+1503 1442 1441 1670
+1440 1370 1770 4309
+4530 707 4393 30
+1407 1072 1432 76
+1448 1357 1407 1412
+1559 1447 1461 1428
+1450 248 4713 4602
+4310 1449 1505 4425
+4604 4256 4715 4642
+1465 102 690 183
+1558 1459 1436 1317
+1556 1455 1259 1340
+1454 1458 1457 1371
+1676 1476 1472 1550
+1436 1259 1455 1317
+1455 1758 1093 1412
+1466 1453 5 4637
+1589 1182 1585 1213
+1035 1448 1238 1328
+251 1482 1490 626
+4149 84 497 4183
+1233 4318 4569 612
+1500 1438 1452 161
+1459 183 1435 569
+1548 1550 1615 619
+1655 1654 1384 1351
+2040 4030 595 596
+1389 1388 1567 551
+188 1563 1524 740
+4509 691 1456 1493
+490 3636 372 4060
+3967 4536 4549 4560
+1530 1522 1071 1380
+1456 1690 4405 160
+1630 1622 276 1488
+1479 1512 1486 4425
+215 1478 1480 4624
+1479 4400 1500 1400
+5141 5123 5259 788
+1420 1490 1462 4596
+1071 1627 102 1380
+1530 1490 1330 215
+1234 1558 1562 1502
+4620 4400 4598 1478
+1159 1581 1527 1512
+1121 1477 1071 1518
+1684 1772 145 1674
+1462 1482 1484 1512
+1437 740 1151 1518
+1529 1540 1386 1315
+1472 4592 619 626
+1653 1629 276 1516
+271 1613 1009 1571
+102 209 1520 183
+2100 2122 2131 1642
+1071 1520 1121 1079
+209 1181 1520 1562
+1480 4599 690 1465
+1502 1435 209 1554
+1485 1436 1501 1093
+1735 1618 1443 1752
+3311 4380 4359 4051
+1450 4687 173 4624
+4013 198 4133 4053
+4433 4589 1159 4623
+1633 2116 4409 1647
+3730 2246 4097 493
+4625 4628 4648 1839
+157 1714 2014 1734
+4598 1490 1487 1478
+4547 4549 4548 4557
+3967 4564 4572 4447
+1211 4593 135 1523
+1523 251 1494 619
+1763 4423 4735 4748
+276 1488 1491 1522
+2837 1944 2660 541
+1499 1498 1496 1561
+297 1698 2149 1910
+1518 1475 1530 251
+1383 1516 1628 1515
+1471 1421 1526 179
+33 1539 2126 160
+1524 1571 271 272
+1487 1581 624 626
+1438 212 1738 4577
+1535 1492 1430 1331
+1079 1522 1475 1484
+1347 1902 1250 1870
+1626 1631 1634 121
+2197 2165 1612 2117
+1535 1536 1540 1409
+1529 1430 1534 1363
+625 1534 1415 1557
+2819 1914 541 2785
+1655 2138 1351 2065
+1525 194 1549 1550
+625 1492 1534 576
+1613 1384 1009 1632
+1557 193 1543 36
+1542 1051 1546 1313
+1823 1639 1553 1584
+2591 2678 142 280
+1437 1566 1595 1543
+1572 303 27 1580
+1653 1668 1679 1467
+1668 2098 1662 1539
+1539 154 1467 1456
+1552 1601 55 1397
+1416 1572 1551 165
+272 1544 1382 1603
+1684 1837 1399 1501
+2063 1618 1750 8
+295 1605 1078 1454
+273 141 1542 1536
+1559 1402 1485 1453
+1558 1357 1560 1448
+273 1559 1360 1409
+1079 1520 1402 5
+1499 1252 1402 1485
+1421 1614 1597 1471
+1620 1582 1583 1631
+1769 1855 1728 49
+1546 1402 1433 273
+1604 1470 1789 1817
+1588 1651 1335 1857
+2308 1210 1577 1830
+159 1026 1419 1579
+1495 1607 1603 1526
+1552 1413 1547 1063
+2482 2529 2480 2437
+1347 1824 1885 1576
+2144 2155 2131 1852
+1335 1574 1429 1105
+1569 1390 1915 1843
+1650 1726 1589 1816
+1580 1847 1570 1379
+1547 1848 1579 1063
+1487 4623 1527 4597
+1564 1835 1584 1610
+1401 1564 1584 1009
+1582 1544 1583 1603
+1651 1460 1898 1860
+1834 1148 1934 2542
+135 1439 1590 1678
+1568 1853 1650 1864
+1651 1578 1460 1375
+1615 1587 1670 1679
+224 1908 2008 2036
+2732 2229 245 2426
+4235 1691 1689 232
+1597 1424 1595 1151
+1596 1594 1433 1546
+1595 1598 1597 1051
+1594 1596 1563 740
+1600 1599 1596 1425
+1421 1598 89 179
+1423 89 1598 222
+27 1602 1551 89
+1601 1603 55 1607
+1553 1584 1602 1571
+1567 1183 1387 1826
+897 1675 1758 1556
+2142 1080 1401 1823
+1571 1614 1602 1421
+55 1623 121 1181
+271 1652 1081 1080
+1838 55 1582 121
+12 1761 210 1681
+308 1533 2148 2105
+616 1541 1495 1337
+1623 1607 1337 1563
+1211 1590 1355 1467
+1388 1842 1814 1219
+1966 568 1809 1621
+1503 1621 1787 1555
+1414 2481 2442 311
+498 1757 2146 1564
+1618 1735 1617 2020
+1337 1634 1623 1477
+1608 1614 1622 1424
+2698 609 1089 150
+1626 1627 477 102
+1532 1625 1674 1399
+1625 1630 1628 1483
+135 1627 1629 1523
+1630 1147 1628 1494
+1627 1634 1629 1477
+1532 498 1632 1564
+204 1634 1631 1541
+1508 4410 1705 1694
+1532 1632 1630 1622
+1809 1 1686 1237
+8 2019 1669 1703
+1766 1908 132 1696
+313 2286 1942 239
+1544 1845 1204 1745
+4550 620 4541 4402
+1677 4587 4376 4420
+1497 1237 1826 1775
+1389 1387 1927 208
+181 2283 3804 368
+4059 555 1132 2025
+547 1132 4417 3826
+1984 4095 1508 160
+1753 2143 2094 166
+1818 1866 1867 1789
+1578 1588 1664 1865
+1585 1568 1589 1855
+1009 1351 1609 1401
+1548 1147 236 1494
+1468 453 236 1081
+1681 2054 1468 1538
+4646 4647 4350 4309
+3971 982 2128 144
+2127 982 2101 2256
+2161 2122 12 1761
+2387 2206 1921 182
+3841 3998 3991 3829
+1549 2152 323 1751
+4660 959 1370 1738
+1726 1650 1901 1867
+549 4577 4606 1738
+255 320 2114 453
+1682 2105 1091 1778
+2115 453 1549 1548
+4180 274 269 1636
+1443 1355 1590 1752
+1122 3294 3414 4870
+3794 3822 2055 3688
+2024 2173 571 1960
+1489 196 477 1626
+1756 1605 1836 1135
+1456 691 1691 1358
+3856 620 1641 4406
+1587 1680 1679 1147
+1590 1678 2115 1548
+210 1681 1678 204
+1611 299 1680 1655
+1781 1667 2094 2062
+2236 2389 1962 2439
+1225 1776 1489 1554
+1864 1413 1756 1332
+1635 197 1028 1774
+4440 4325 4353 3796
+4575 1355 43 1358
+4413 1593 1690 4326
+1689 1691 1694 1476
+1692 1690 1593 1676
+1691 1406 1704 1358
+30 4363 4083 4277
+1633 1690 54 160
+1881 1899 1905 1365
+1711 1637 2045 2042
+2213 2270 2360 3703
+1521 1989 2167 2159
+366 2030 1768 177
+1725 5135 4971 4962
+4015 1722 4255 665
+8 1704 1703 1406
+1707 1636 1702 4024
+259 54 1702 1692
+54 2034 1707 1633
+1431 1720 506 1933
+2033 1703 1705 4356
+3990 598 3647 4033
+2207 2190 2197 2165
+3247 4064 4140 2339
+269 2008 1696 1986
+4226 1794 3084 3759
+431 2075 2814 572
+1961 1511 4319 1820
+1854 1746 897 1073
+4435 4673 4690 4545
+2698 2801 2505 2524
+629 648 170 4347
+269 2049 2008 4312
+1706 2031 1973 2769
+3334 4140 3949 2339
+1701 189 4230 198
+2341 2434 2291 2348
+2081 229 2215 2210
+5009 1700 5020 4867
+1578 1664 1964 1842
+3280 3369 2802 3078
+1875 1350 1860 1565
+2797 1796 2704 2729
+758 1027 1943 1969
+670 463 3196 728
+4305 4069 4222 4304
+4872 4282 4145 4285
+568 1986 1511 274
+1621 1503 1 166
+145 1438 959 161
+3751 3570 485 3958
+1528 689 1663 1665
+2006 2660 1947 1115
+1925 1840 1388 1842
+1078 1225 1797 779
+3963 2814 4416 572
+4153 4399 647 4351
+1028 275 1228 1774
+1639 1795 1309 1835
+1818 1836 1715 1817
+2190 2163 2136 2273
+1837 1758 1416 1093
+505 4086 1114 502
+2061 1555 1751 259
+1662 1750 1752 194
+1751 1503 323 1670
+2150 1648 1960 2161
+2043 2044 2312 2413
+2153 2165 320 1991
+1675 1685 1758 843
+2100 228 1856 1620
+1748 1605 1756 1458
+1987 2986 344 364
+1893 1052 164 1780
+1 1611 1659 166
+1924 1921 2235 2204
+1517 4713 4308 248
+1820 1809 568 1440
+4068 3939 4153 4346
+1390 1637 1778 2045
+2200 2319 2201 2269
+2272 2188 2202 1699
+1858 1565 1350 607
+139 1444 65 4335
+4321 2095 4333 2814
+228 1774 1489 196
+1073 1813 118 1229
+1772 1775 1744 1686
+1774 228 1805 1642
+1854 897 1837 1684
+4158 3640 4185 420
+2039 1766 2175 1667
+3362 53 1807 1146
+1845 1760 1866 2160
+2132 2105 2151 1682
+1823 272 1850 1080
+424 3655 4157 4160
+3131 4304 2368 1970
+4946 4493 4068 1393
+4885 4690 4229 4706
+65 1618 139 8
+2762 873 2739 1892
+1649 1183 1840 1567
+4432 4433 284 4615
+4072 4062 638 554
+295 1137 1136 4668
+1136 1135 295 1348
+1712 35 3655 4485
+1818 1745 1866 1856
+1729 2837 2760 1844
+4698 118 1802 1741
+1815 551 1814 1812
+1862 1050 1833 1907
+167 4590 1228 1803
+4687 3434 4673 4675
+1228 4701 1797 275
+4350 1800 1820 1440
+1403 1968 2032 2013
+1826 1229 1073 1775
+1090 1367 1350 1374
+208 48 264 1779
+1859 164 1833 1850
+1832 1617 1764 1635
+2704 2646 2609 2729
+1812 1813 551 978
+1811 1798 1136 68
+1811 1137 1773 69
+1798 1616 1816 1029
+1816 1836 1798 1135
+1814 1578 1815 1375
+551 1746 1567 1073
+1649 1865 1795 1746
+1961 1831 1820 264
+1764 1714 1819 1803
+2335 2993 240 2841
+4010 2076 2030 3827
+1782 1845 1544 1606
+1250 1898 1574 1335
+2168 2149 2167 1912
+1642 1827 1604 1805
+1831 1387 1826 264
+3175 3206 3212 3125
+2334 1940 2435 1948
+2262 1843 1569 2261
+1832 2050 1827 1819
+1237 1993 1831 1809
+1808 1799 1932 1868
+851 1586 327 1902
+1745 1856 1838 1582
+1746 1865 1675 1815
+1838 1776 1748 1554
+1837 1416 1835 1610
+4155 1212 1510 4415
+1789 314 1867 1740
+1221 2215 2082 2224
+1726 1740 2688 1616
+1908 1577 1830 224
+2702 1223 1796 2731
+1823 1052 1639 1780
+1858 1105 1857 76
+1877 1848 1876 1579
+1847 1429 1105 1580
+1204 896 1207 1853
+1808 1052 1891 1782
+226 577 558 2021
+1575 322 1183 883
+1900 1588 1335 1849
+1856 1715 1776 228
+1857 1651 1565 1381
+1835 1795 1854 1757
+1855 1846 1568 1332
+1394 1846 1769 1349
+1872 1920 238 1808
+1385 1728 1899 1585
+1396 1874 1090 1273
+1883 1799 164 1893
+883 2686 1027 322
+1588 1309 1865 1685
+1864 1818 1650 1836
+1795 1780 1649 266
+1664 1649 1893 1840
+1907 327 1833 1870
+1134 1207 1891 1889
+1531 1868 435 1891
+315 1997 2365 2823
+1859 1910 2141 1080
+2405 331 2410 2234
+1070 61 1861 1275
+191 1728 1385 254
+1878 1847 291 1315
+1847 1878 1889 1419
+1876 1879 1877 1386
+1878 1274 1894 1323
+2503 435 1907 1901
+1882 1695 1897 1128
+1899 1881 1885 317
+314 1050 117 1862
+1955 1991 2009 2153
+1882 1894 1574 355
+1895 2163 2029 2136
+148 3166 3195 3228
+2412 2329 1924 1210
+1869 1429 1347 1877
+2608 801 2561 2716
+1870 1850 896 1869
+2793 2780 1999 1788
+1862 1901 1760 1867
+1897 1347 1885 1879
+1917 308 1886 2148
+3160 298 887 2514
+1903 1894 1881 1368
+1899 1824 1906 1585
+1898 1695 1882 1860
+1853 435 1901 896
+1900 1880 1664 1893
+1903 1904 1531 1834
+1897 1905 1902 1186
+1905 1906 1902 2715
+1903 1695 1904 1231
+1250 1904 1898 548
+1799 2714 1868 1880
+1637 1843 1923 1591
+2468 2467 466 2437
+2157 1521 1209 1872
+2237 2369 2409 2290
+238 1825 277 1922
+2148 2165 2136 1965
+2765 2733 1537 1952
+1218 2130 1577 452
+2451 1962 2389 2409
+1218 1895 2029 243
+2120 2452 363 239
+469 365 25 2079
+2162 1922 1859 164
+120 211 1762 1660
+2155 1912 1920 117
+1908 2002 132 553
+1888 120 1762 2196
+1977 314 2751 1740
+1075 2705 2504 1145
+2505 2524 1935 1643
+213 2505 2805 1985
+1932 2391 1948 238
+2691 60 2212 2471
+1982 2669 2803 1184
+2691 1929 1180 1833
+2769 2759 2229 1706
+2689 1586 2518 2684
+1927 883 2051 1387
+758 2816 1941 2766
+308 2196 2052 2198
+1075 2822 2705 1142
+4941 4754 4893 1101
+1943 1027 1829 277
+1936 11 1942 2711
+1949 758 1941 1638
+313 1730 1940 2168
+1519 2794 1214 919
+2403 2456 2071 2293
+2527 2559 2220 2582
+1739 1214 849 1120
+277 1180 1829 1929
+1942 309 1995 239
+2416 155 256 2304
+203 513 326 64
+1914 369 1338 893
+2067 2297 456 2070
+3248 502 2287 39
+186 1884 2106 80
+480 2302 507 2260
+1962 2450 2392 2133
+2011 3737 2781 3700
+2510 2701 2745 829
+268 1753 2094 1673
+53 2012 1714 1819
+1957 1683 1916 2199
+572 2107 3993 2057
+2688 1182 2503 1726
+2098 1913 2139 2126
+2020 2042 571 1617
+3922 3722 439 3811
+571 2028 1804 2042
+192 1992 2059 1730
+2036 4100 2041 1784
+2149 2178 2241 2394
+534 3832 3833 2340
+553 1720 2032 2000
+2600 2647 841 820
+2742 1230 1977 1050
+2734 2470 2655 2328
+2670 1975 2726 1925
+2536 2485 3047 2383
+2734 2710 2328 2863
+2411 326 2193 64
+3746 2091 3711 3794
+2563 2004 1931 2000
+3362 5047 4949 5017
+2125 2074 2116 1647
+2051 1403 2022 1928
+2014 2042 1711 1734
+1759 2965 3010 2396
+3832 3758 3833 3912
+590 297 2106 1698
+584 4028 4087 3805
+2208 1884 186 1755
+1969 2022 2023 758
+2050 2024 571 1832
+2082 2245 1221 2263
+2169 2023 1431 1949
+192 2059 2024 2144
+286 392 2595 1871
+87 2229 2491 2759
+1892 2771 2795 1025
+1973 1982 2015 2035
+3992 1125 3711 3835
+409 2262 2187 1923
+2771 2773 2832 1193
+1982 2381 2669 2769
+2294 2302 2297 229
+908 1171 1739 796
+2019 2045 2053 2063
+1719 1591 1711 47
+1884 2206 182 2117
+2476 3421 3186 2946
+518 3764 1958 3706
+1961 262 2013 1403
+2014 2012 2015 1804
+1511 2013 2016 1986
+2016 2013 2563 2000
+2014 2015 4219 47
+547 1140 1132 3248
+4153 951 4068 1055
+269 2007 1127 1636
+2094 2062 1966 1621
+586 2077 3779 1851
+1985 2031 1992 2805
+2031 2172 1992 1995
+1996 1673 1993 2145
+1645 4042 3827 4020
+512 2302 229 2082
+3711 1125 3823 3685
+2032 1968 2171 132
+144 1917 1886 2128
+1822 2103 1699 2064
+2032 2023 2022 1720
+1804 2028 2031 1973
+1126 1127 2034 1707
+2033 2123 2118 1705
+2041 553 2036 2000
+2035 1591 1970 47
+3827 4042 4263 4008
+2107 4010 3964 366
+308 1390 2196 1778
+3834 3743 1469 492
+1970 294 2035 1184
+1696 1968 1966 1986
+2299 225 1754 64
+225 2308 1754 1210
+1696 1766 2007 2062
+2091 3642 3836 3746
+4119 2337 2048 3802
+546 3734 2047 3824
+1719 416 2058 4334
+2051 1993 1403 1831
+2050 1985 192 1935
+2163 1937 225 203
+243 1127 1218 2007
+453 299 2114 1655
+509 2179 2226 1672
+2244 2249 2191 2238
+1963 2084 774 2928
+452 224 2049 367
+1996 1969 2174 2166
+326 2235 83 2204
+2121 2063 2132 1750
+2045 1682 2063 2020
+2007 2062 2061 1555
+2030 302 177 4020
+2156 12 2140 1538
+3833 443 4034 3642
+1953 2289 505 502
+3947 3952 3987 4036
+182 590 2106 268
+1953 1222 2257 2225
+2177 1945 1150 512
+2355 2283 480 2323
+4092 4098 3287 3935
+1984 2101 4011 2276
+3319 4113 1713 1140
+2101 2103 1822 4008
+2267 253 2021 302
+2912 3195 3265 3257
+2313 2384 2424 1919
+456 2253 2245 2227
+1724 2134 1222 2312
+2026 1994 1841 2232
+2084 2225 502 39
+2311 2083 3320 2057
+501 3292 2349 2304
+2349 2384 527 155
+3097 3469 3468 3182
+3682 3684 2342 2707
+2291 2111 2436 2374
+449 3800 3630 3954
+3948 2046 487 1981
+3922 4033 2108 2336
+3993 3933 3963 1126
+1648 1682 1960 2020
+4357 4290 4255 1771
+2097 587 4021 4002
+226 2096 4020 302
+2152 320 1965 1549
+2273 405 2119 2250
+2146 1497 266 1757
+2074 1658 3979 2076
+4103 4078 3793 451
+2076 2202 2030 1353
+3308 3629 567 3042
+2117 1781 1612 1667
+1955 2069 1989 2150
+2038 1963 547 39
+4003 2092 4019 3803
+320 2151 2153 1395
+2195 2112 2147 2271
+2089 2420 2408 2362
+2267 2110 2230 2227
+2221 2177 2210 2186
+2137 1666 1395 2054
+1668 323 299 1679
+4012 2118 1984 1508
+1533 2153 2105 2009
+2116 3933 2124 2034
+2099 2255 2180 2265
+2455 2454 312 1918
+241 243 2139 2061
+1659 2145 1497 1237
+2124 243 241 2034
+2123 2125 2128 2118
+2126 2127 2124 1984
+2125 241 1965 1525
+2136 2128 2125 1658
+2029 2124 2127 1657
+155 2382 2343 2384
+2309 1915 144 774
+1497 1575 266 1183
+2152 2139 1781 2061
+2240 1957 2199 2432
+2181 2081 2215 2299
+126 3408 4165 3626
+1747 1886 1913 2127
+2138 255 80 2114
+1209 2137 2156 1538
+2132 1965 2148 2121
+2142 2065 2146 1401
+2142 2162 2157 1872
+2160 2141 2140 1606
+1648 1395 2151 421
+2154 1575 2145 1996
+2161 2144 2122 2024
+2140 12 2100 1620
+2194 2201 247 2110
+1895 1612 1913 2139
+1825 1971 1521 238
+1753 2106 80 2158
+2152 1781 2109 2143
+2151 2098 2132 1662
+1755 2109 2117 1884
+2155 2144 2159 2167
+1575 2154 2162 1922
+2065 2157 2158 2138
+2141 2159 2156 1910
+2159 2161 2156 2150
+2158 2157 2154 1698
+2162 2142 266 1780
+1659 2158 2145 1753
+2160 2155 2141 1920
+1886 2052 125 1747
+247 2201 109 3720
+1913 1533 1709 1755
+2168 2167 2176 2059
+2166 1825 1698 2154
+2166 2178 1825 1943
+2446 2172 2211 1995
+2171 2175 2182 132
+2170 2172 2173 2028
+2174 2171 2169 2023
+2171 2174 268 1673
+2176 2173 2172 2059
+1091 120 2170 1778
+2166 590 2445 2174
+2113 2218 2071 2244
+2168 351 1971 313
+2228 531 2055 3815
+2202 2119 2272 2230
+2255 2257 2134 405
+409 2211 120 2170
+2232 2248 2224 2244
+2415 2419 1392 347
+2238 326 83 513
+2244 2191 2243 2113
+506 2002 2425 553
+319 1768 2300 366
+285 2343 2425 2313
+513 203 1709 1747
+2056 2247 2186 2193
+2259 256 2304 2295
+1980 2238 2417 2191
+2147 1206 2200 2271
+2230 2110 2269 2264
+2039 1210 1937 1924
+2205 1709 2198 1533
+2204 2197 203 1937
+2462 2216 1962 2133
+2324 1767 2194 2258
+2147 1767 2164 2269
+1768 2256 2180 2103
+2320 109 2278 134
+1762 2205 2060 2198
+2206 2207 2204 2197
+1660 2208 2205 2009
+2208 83 2205 1709
+2207 2206 2214 1991
+2458 2221 2210 2414
+1150 2209 2113 1724
+2290 2448 2182 2169
+2649 2661 2735 1930
+42 1697 3756 3600
+2400 306 2387 2208
+1724 1841 2134 2243
+2199 2367 2405 331
+570 2441 3133 3125
+2222 2433 2177 2239
+2454 2455 2468 2394
+1946 359 2620 2497
+2113 2209 2222 2417
+2218 2221 2406 2418
+448 3752 2372 2355
+2243 1841 2248 2183
+2070 2311 2300 2083
+3742 2319 2055 2306
+2080 2272 2112 52
+509 407 2179 3685
+1592 2806 1998 1933
+2195 253 2112 2180
+3926 2277 3927 3902
+2258 2183 2082 512
+2234 2240 83 306
+2233 2235 1873 2422
+2060 2410 2234 1762
+223 311 2392 1683
+2405 2434 1911 2330
+2185 2239 2193 2056
+2240 2418 2238 2218
+2239 2233 331 2133
+2449 2400 351 1971
+2426 2348 2341 245
+2215 2224 2247 2186
+2056 2186 2183 2177
+2303 2080 1994 2271
+1509 2285 4088 2358
+2243 2249 2251 2191
+2224 2265 2249 2183
+2247 2248 2250 2056
+2251 2249 2099 513
+2247 2250 2299 64
+3816 3733 3867 3786
+2257 2255 2080 2272
+3997 3999 3630 3840
+2253 2181 1221 2119
+319 2273 2202 1658
+2253 2070 2181 2300
+2200 2264 2263 2232
+3812 2261 2192 2310
+512 2292 1956 2324
+4099 285 2259 1830
+285 2002 2329 1830
+1994 2271 2264 2258
+2263 2195 2265 2258
+2119 1221 2264 2248
+3918 3926 556 3570
+2112 2077 586 52
+4023 4022 2276 4095
+1767 202 2201 2195
+1697 3705 3041 3740
+2245 2110 2263 2194
+2180 2253 1768 2227
+2279 2099 2256 1747
+4335 3344 4361 4327
+3287 4079 3741 3663
+591 2268 585 2074
+3859 3983 3852 2231
+2203 2319 510 300
+125 405 2282 2273
+2331 3719 447 3665
+2356 2342 347 2415
+242 2279 2300 319
+2359 2289 2072 1644
+2318 4188 546 3723
+3805 2246 2361 2359
+316 403 2455 1638
+181 3343 1954 177
+2370 507 2371 2294
+456 2283 2067 181
+2427 1911 409 2211
+2420 2089 2431 1723
+507 2293 2375 2260
+2370 2333 2292 1945
+2005 261 2288 2344
+2312 2310 1222 2192
+2798 3577 2333 2388
+261 2005 1953 1222
+2326 2366 2535 2808
+2043 2134 405 2251
+2225 2282 2257 2188
+2404 2403 2419 2457
+2005 1956 2303 2026
+480 456 2302 2245
+2085 2192 1950 261
+448 2375 1123 510
+202 3742 3821 2226
+3031 500 2940 2997
+2310 2044 2309 1569
+2311 2308 242 2130
+2308 2311 2295 2259
+2309 2225 2310 2084
+2081 1754 2295 2414
+2189 2079 294 365
+2973 3713 3068 3375
+256 2343 2429 285
+3838 3916 3837 3816
+4412 18 4449 3977
+4189 2284 2338 3764
+2278 109 1767 2226
+2203 2321 2322 3000
+510 2323 2320 448
+247 2320 2323 368
+2322 2321 1206 2072
+510 2200 1206 2260
+2798 401 1224 318
+2298 3020 1392 2383
+2981 3128 3172 3118
+2708 1976 1979 2464
+409 2330 2262 1888
+2237 2429 2329 2412
+234 3716 2280 3747
+3668 564 2781 3576
+2296 2356 402 2293
+2391 403 2562 1829
+217 2995 1821 3007
+4041 3797 2092 482
+412 546 2047 3791
+4064 2318 412 3763
+1710 3001 1721 794
+3824 3781 1972 152
+2438 2369 1723 2242
+2088 3039 527 2281
+2348 2315 2129 2189
+2294 2416 2370 2456
+4075 25 3131 4108
+2500 2640 2865 2570
+4166 3861 3596 4197
+1723 2343 2382 2242
+2086 3681 469 2085
+4491 4480 3982 604
+344 3112 2975 2981
+3116 550 3061 329
+2364 2968 3118 500
+3053 3058 3180 3102
+2223 2359 2373 2072
+2281 2333 3039 2370
+2371 2358 2967 501
+2359 2246 2357 505
+2285 2358 2355 2283
+3757 1697 2363 3702
+2285 3721 3807 3752
+3020 2978 2909 2111
+2360 3041 3723 3737
+2353 3128 3141 195
+2706 1871 286 2788
+347 318 2298 2707
+2431 2462 2406 2216
+1784 3409 2577 3289
+2421 1911 2341 2427
+2293 2288 2356 2344
+2288 2373 3065 2357
+2373 2375 156 2223
+507 2372 2371 2355
+2473 2438 2439 2089
+2388 2372 2292 2305
+2906 2851 2864 2486
+2848 3098 2662 870
+2803 4227 3299 2379
+417 2378 2380 3300
+2379 2669 315 358
+2824 2687 2818 2004
+1392 2348 2129 2383
+2637 1978 2382 2326
+2536 2079 2129 2086
+337 2611 698 279
+2587 985 124 743
+2440 2214 211 1660
+2296 156 2375 3698
+1683 363 1916 2421
+2501 217 2633 2971
+2334 2471 2394 1929
+278 2236 2444 1957
+2473 2979 2922 389
+403 2391 2219 1971
+4315 4865 1010 1012
+2534 2537 3030 1987
+2913 2774 2921 410
+59 2496 895 2684
+397 2499 2466 2489
+2241 2214 2440 297
+2864 2486 2702 2731
+2436 2408 2432 278
+2407 2301 2433 1945
+2431 2406 2301 2458
+2409 2216 2237 1873
+2367 2433 2404 2222
+2403 2408 2419 402
+2402 2111 2407 2909
+2405 1911 1916 2453
+1873 2411 2412 2235
+2413 2410 2417 1980
+2413 2330 2410 1888
+2412 2411 2414 1754
+2413 2209 2430 2312
+155 2416 2184 2281
+2415 1950 2457 2344
+2221 2411 2418 2193
+2417 331 2222 2239
+2420 2301 2407 2184
+2111 2291 2419 1392
+2428 2389 2438 2369
+211 306 2453 2234
+2428 2957 2502 350
+468 304 2536 2079
+2187 2189 2426 294
+506 2425 2242 1592
+2369 2290 506 1431
+363 2421 2423 309
+2315 2434 2430 2330
+256 2429 2458 2414
+2404 2291 2367 2434
+2402 2433 2462 2133
+2403 2406 2432 2218
+2431 1723 2237 2429
+2694 2562 2724 1829
+2462 2089 2402 2439
+1909 1573 1414 2444
+293 2421 2374 2341
+2374 1683 223 2436
+2445 2400 2387 590
+376 2539 2941 2217
+2502 2709 1619 312
+2904 3102 3053 2984
+2392 311 2437 2454
+2446 351 2440 2176
+2447 2445 2448 2169
+2446 2452 351 239
+211 2453 2446 2211
+2241 2452 2450 2454
+2449 2451 306 1957
+2453 2450 2452 1916
+2451 2449 2447 1918
+2448 2422 2451 2409
+2120 2219 2444 2449
+2120 2475 2219 2286
+2457 1150 1945 2344
+2456 2301 2458 2416
+2209 2457 2404 2430
+3003 2874 2956 3011
+2484 2645 112 3016
+2464 1192 2531 2467
+2432 2367 2436 2199
+2587 2614 1208 2584
+2461 2532 2328 466
+2579 2720 2478 2565
+2493 1192 2399 2467
+2466 2461 1909 2530
+2489 1909 390 2219
+2522 2638 2550 2498
+397 1976 2737 2519
+2489 2649 1930 2391
+2716 2713 2757 613
+2978 293 2393 2374
+290 2709 2710 2502
+390 2709 316 2455
+606 2010 2854 3216
+187 2508 2537 2796
+2521 2465 2615 2566
+2838 388 3002 3046
+374 389 1573 278
+2979 2482 389 1619
+1573 2481 2533 1414
+2612 841 820 2497
+2460 2749 2777 2564
+3032 237 1978 2637
+2376 2749 2401 2671
+3133 3141 3134 2964
+3479 3458 3482 3429
+2471 2399 2519 2468
+2920 2918 364 3005
+3026 1998 2706 2788
+2508 3018 2772 2529
+2543 2560 2495 2466
+2574 2931 2935 2784
+2493 2579 894 2526
+2725 1108 2518 2398
+2483 2598 2601 2220
+2469 2884 2515 2513
+2672 2526 2399 60
+2643 2750 2346 2567
+2390 3017 3025 2789
+2474 2442 812 2423
+1964 548 2714 1880
+213 1926 2505 1146
+2504 1717 1928 1927
+2554 2978 3030 3020
+3615 2802 3019 3715
+374 44 2477 2492
+2863 3015 2982 2532
+1959 1182 305 1213
+187 2535 2909 318
+2581 2559 2583 2550
+336 394 2498 444
+2960 1896 2974 817
+2551 2498 400 408
+2571 2575 2608 2716
+2671 2749 2655 2578
+2496 2755 2728 1934
+390 2676 2470 2489
+410 2907 2589 2875
+2549 2478 115 2551
+2933 2638 2643 2469
+739 838 2541 2567
+2686 1717 2658 1927
+2575 2588 2723 2526
+2495 2674 2525 2499
+775 2541 1946 2582
+3006 2911 2841 455
+2492 2533 2530 1573
+2531 2544 2529 2467
+2530 2532 2546 2461
+2509 2531 2533 2464
+2532 2529 2982 2482
+2396 2535 187 2965
+2534 3020 2511 2298
+3042 2424 1978 2384
+2396 2477 3022 2924
+3151 3335 3176 2730
+2586 2441 2939 2634
+2779 2640 2853 2570
+2527 2523 2559 2581
+1586 2677 2685 1186
+2544 2549 2551 2493
+233 2546 2543 2530
+2618 807 2630 359
+815 2544 2547 2531
+2564 2546 2910 3015
+384 343 853 1257
+2521 815 2560 2543
+0 2512 2569 2469
+0 2515 2521 2543
+398 2826 1054 2609
+2687 2824 1075 4992
+2506 3029 2996 2637
+2855 2861 153 341
+2948 2639 2877 2597
+95 694 3083 22
+919 2850 1214 370
+1946 2541 348 2512
+2579 2549 2578 2493
+2729 2628 2731 1890
+2435 2649 855 2334
+1982 4983 143 2015
+2484 815 2890 2547
+2465 838 2566 894
+2478 2565 2569 0
+2569 2523 2500 2581
+3060 329 2811 3139
+2750 2566 2567 2550
+2346 2540 2574 739
+59 2576 2626 2516
+2665 2871 356 2607
+878 821 2614 2652
+2494 2934 2570 921
+2576 2525 2516 613
+2684 2580 2571 2575
+2368 1096 4108 3278
+815 2517 2560 1192
+2465 2560 404 2495
+2576 2612 2632 359
+2567 2541 2583 2512
+2583 2527 2623 1946
+2643 2581 2582 2512
+804 391 2463 718
+263 391 885 2647
+2539 345 2962 2666
+2463 1036 2386 2673
+2630 359 348 2525
+2921 2520 428 345
+2679 2680 2636 263
+1545 343 384 216
+2832 2880 2771 639
+3473 3518 3512 3373
+2881 2621 2596 1185
+1997 340 2850 370
+2784 2594 807 2618
+2915 2851 2556 2619
+2601 884 2623 2497
+124 878 2614 73
+1974 841 804 884
+2620 2621 2598 2497
+2604 2718 2685 824
+2688 2747 305 1220
+2695 2602 2677 96
+2858 2695 2740 872
+2830 45 2848 387
+2572 398 2859 2697
+1890 2722 2723 2516
+1810 1108 873 2552
+726 733 757 2697
+2385 393 2875 336
+726 2679 2483 2580
+836 2825 153 1199
+2599 2573 2463 79
+2894 115 1024 2478
+3199 481 2898 2914
+3178 3529 3466 3526
+2632 2596 2631 2545
+2777 2903 2597 2987
+2601 775 807 2220
+2594 884 2601 820
+3213 2663 2897 2834
+2598 2934 775 2582
+3150 3469 281 3182
+2665 881 105 2648
+2631 2700 2632 2571
+2628 2729 891 2826
+2627 2641 2561 2644
+2630 739 2719 838
+2721 2545 2629 2588
+2626 2618 886 2722
+2618 2626 726 2580
+3016 2390 2675 2645
+570 2905 2539 2666
+3027 2874 217 3007
+757 2590 2650 885
+2554 2485 245 2383
+2750 2522 2929 2469
+2659 2778 2556 2915
+2876 386 2346 2540
+2864 2917 2869 2628
+3149 3225 3088 2828
+2522 2500 2865 2583
+2628 2869 2722 886
+2930 2987 2633 2460
+1810 2757 1108 2716
+2585 804 2648 1974
+885 2647 2625 733
+2212 2676 2562 2471
+890 2636 2681 832
+2680 2685 824 1187
+832 881 2573 2861
+2748 2862 2812 1113
+2680 2678 844 384
+397 2517 1976 1192
+2672 801 2671 2674
+4240 4283 4899 4241
+2751 2524 1089 1391
+2776 2639 2898 710
+1519 1739 1171 609
+2738 2212 2694 2693
+2891 2790 2377 852
+2847 2932 2622 2892
+4156 713 581 4274
+2625 2872 2572 733
+2875 393 2586 2634
+292 3404 3496 3448
+2672 2736 801 2713
+2004 2380 1931 2806
+2688 2742 2747 1977
+2517 2656 2486 404
+2668 2656 397 2499
+1036 844 853 2587
+2723 404 2656 2526
+2633 217 3011 2916
+2737 855 2649 2519
+2604 2542 1148 110
+819 2654 2681 1545
+2590 757 2683 2612
+2651 2681 2590 2654
+2682 2650 2680 2678
+2681 824 890 871
+2684 2685 895 2679
+1934 2683 2398 2576
+2602 2683 2542 2651
+2764 2524 2751 1863
+213 2381 2553 143
+2603 1964 2670 1842
+613 2690 2755 1934
+2691 2692 2689 327
+2690 1930 2693 1932
+2756 2690 2693 2741
+2691 2661 2692 1230
+2435 1215 2661 1230
+2605 2718 2725 2604
+2697 895 2699 757
+2607 2700 2696 2610
+2705 2819 1717 1624
+2696 2718 2857 890
+2697 398 59 2626
+2753 1959 305 676
+2401 2775 874 1844
+307 2746 2767 2747
+1729 2763 2762 1810
+1926 1938 2698 150
+2365 455 358 2491
+401 2088 2808 2366
+2328 2709 390 466
+2708 2474 2475 2442
+1979 2712 2474 3017
+290 893 316 1941
+290 2710 1338 2787
+2735 2472 2668 60
+396 2742 2503 1907
+548 2745 851 1904
+2472 2646 1890 2516
+2885 2902 2779 2932
+895 2695 2699 2602
+2720 2721 2853 2629
+2906 404 2719 2465
+2723 2722 2719 2630
+2721 2608 2644 2631
+2674 2608 2721 2525
+2764 1215 2765 2435
+2728 2740 2496 2695
+2751 2767 1215 1977
+2754 2752 2756 2741
+2518 2752 2725 1148
+2561 1729 2627 1810
+2538 3312 288 3302
+801 1844 2401 2561
+2809 2806 3032 1592
+1914 2768 541 2760
+112 163 1976 1979
+2212 2738 2736 2713
+1223 2737 2735 2668
+2676 2736 369 2470
+2661 2761 2735 2758
+1788 2740 2753 676
+2739 873 2725 2605
+396 2727 2742 2692
+2714 2741 2670 1975
+2745 2752 851 1148
+2759 2817 2786 11
+1959 2743 2715 1133
+2703 2762 2763 2754
+2754 2603 2670 2703
+2653 2825 836 1168
+112 2486 2484 2517
+2638 2894 2500 2569
+2658 2726 2686 1925
+2727 2753 2728 2743
+2739 2752 2754 2701
+2746 2753 2727 2747
+2518 2757 2756 2689
+2727 2755 2758 2692
+2755 2646 2758 2472
+2763 2756 2757 2738
+1998 1933 2744 350
+2761 1796 2733 1223
+2760 2768 2763 2738
+2780 2704 2746 1788
+2761 2746 2704 2758
+2686 2724 2766 1027
+2766 2724 1914 893
+2801 2764 2765 1936
+2726 1194 2768 2703
+2767 2733 1215 2761
+2818 1933 2004 1720
+5004 3765 5188 4931
+2003 2592 1999 190
+2492 3003 2774 233
+2003 2780 1171 307
+2956 2796 2772 2397
+2813 2702 112 163
+2778 2659 2914 3149
+2890 2619 2851 2484
+2776 2902 2639 2885
+2869 2717 2540 2931
+1892 944 2773 2762
+1958 3666 2332 3701
+660 3220 3130 3470
+2787 2785 21 1338
+2887 2881 2494 2596
+2783 2820 919 1537
+2787 2788 2821 2744
+2789 2786 2783 2712
+2786 2789 2365 2491
+2787 2971 2788 2501
+2662 2893 1172 357
+2862 357 2812 1172
+2855 913 730 342
+2795 789 1892 2849
+2837 902 1944 874
+2793 1999 1032 1113
+2477 2774 2924 2997
+899 2837 944 1729
+2899 1124 2325 2296
+3196 406 4890 688
+670 3055 695 3514
+2816 1717 2819 2766
+3313 3251 1727 2507
+3289 4981 2378 1931
+3487 95 695 3478
+2818 1928 2816 2022
+358 2732 2669 2229
+3587 3589 3606 3578
+2707 3047 388 2298
+1184 2732 304 294
+334 3280 2974 3100
+3159 3079 3121 2568
+913 2653 2791 839
+21 874 2930 2775
+4255 1771 1713 1742
+281 2900 3150 3174
+2817 2805 2801 1936
+2821 2818 2816 2744
+2805 2817 2381 2769
+2820 2801 2698 1537
+2822 2821 2819 2785
+2817 2820 2823 2786
+1938 2823 2820 370
+2822 2824 2821 1871
+2823 2553 2381 315
+920 2613 2748 333
+2552 2827 361 2627
+398 2873 2826 886
+3166 710 3222 2642
+2929 2933 2950 279
+2834 2606 1172 828
+400 698 2890 13
+2003 796 2592 879
+5079 2835 5206 3153
+2892 2622 2830 361
+5203 2833 929 5112
+5105 796 908 5049
+1519 2797 2794 1796
+2960 321 2972 2479
+3258 917 3216 3228
+2960 2974 332 3676
+3267 1821 2528 286
+3405 5109 3245 5123
+3080 3093 3270 430
+3143 3045 3207 3192
+1106 581 4283 3446
+383 4712 4884 1426
+3124 2896 2663 2891
+1172 2606 2377 792
+828 2862 1054 2793
+3226 2976 2595 2558
+2376 1024 2597 2777
+470 4240 473 3442
+2540 2906 2869 2719
+2476 3186 3274 5194
+2792 2555 920 395
+2857 153 2861 890
+2856 2859 2858 2699
+836 2857 2860 2605
+2857 356 2860 2607
+2858 2859 2862 1054
+427 2856 2555 2652
+2860 2791 2653 2849
+3017 3016 2509 1979
+2641 2376 2908 2401
+2643 2346 825 2934
+3691 516 3671 184
+3249 3243 3314 3317
+3182 3161 3129 3181
+2853 2641 2779 2644
+2997 2926 364 344
+2893 2872 2873 2572
+2871 2888 2881 2665
+2892 2871 2887 2827
+2459 3023 2918 2635
+2520 2611 2666 394
+2877 2640 2894 1024
+2876 2950 386 2556
+688 3325 3297 3296
+3204 3216 3105 3212
+1032 5105 5104 2592
+2872 2889 2784 2594
+825 2902 2914 2896
+902 3222 201 1169
+400 2929 279 2498
+2717 2917 2778 2897
+905 2897 2917 891
+2931 2873 2784 886
+2889 2872 2891 105
+2888 2935 2881 884
+2831 2777 115 2564
+2888 2893 2847 2662
+2873 2663 2893 2834
+2892 2891 2871 2790
+2750 2929 2876 2615
+918 5176 1022 5163
+2932 2882 2935 2847
+2886 2961 2885 2622
+938 2616 2949 2659
+2969 3063 2984 2798
+3316 3283 2815 3192
+4380 4022 3326 4268
+386 2778 2882 2717
+337 698 2988 2619
+3427 250 2443 3583
+2634 570 2964 394
+1024 2376 2853 2720
+13 428 2520 698
+2864 2915 2917 903
+2362 374 2511 2408
+3012 13 233 2547
+3267 3237 3307 2528
+3266 415 2078 3200
+2397 2925 195 2964
+2616 2882 2776 3091
+2908 2597 2639 2919
+2989 2675 2988 428
+2641 2908 2885 2886
+2924 2956 2874 2490
+2994 205 2915 903
+2923 2490 2998 353
+2923 2397 2956 2589
+44 2978 2393 374
+2920 2925 2921 345
+2796 2918 2537 364
+2998 2913 2923 2939
+195 2998 2870 476
+3277 4207 3084 4210
+3320 431 367 2057
+2829 2894 2638 2884
+2645 2970 2994 2813
+2779 2932 2494 2887
+2717 2896 2931 2663
+2522 2937 2829 444
+2574 2935 2865 2623
+2494 2896 2934 2889
+814 3295 3283 508
+825 2950 2933 481
+3548 3587 3594 3569
+2964 2925 376 2539
+3002 2307 1224 187
+3125 3194 3145 2441
+912 371 437 2968
+4473 4528 4422 642
+4094 4657 4181 4413
+714 3459 3533 3458
+3223 3262 2010 3215
+481 2952 85 472
+337 2949 2950 2556
+2948 2954 481 2898
+2877 2829 2937 2948
+3152 3079 3159 3048
+393 2954 2953 2947
+2962 2952 2955 811
+2952 337 2955 2949
+2953 2954 2990 1003
+2459 2918 2774 2921
+812 293 87 2423
+2959 2962 345 2989
+430 2958 353 2995
+2514 2840 2838 3046
+3149 3088 3213 2897
+3145 2586 2958 2953
+4324 1096 3844 471
+2913 2939 2487 2905
+388 1987 3002 2534
+3001 3748 3165 447
+3681 3065 493 2357
+3048 2942 377 2353
+3698 3673 3583 2899
+2976 2930 2971 21
+240 2970 2390 2789
+2838 3279 298 2975
+564 3736 3064 2314
+2514 2810 2840 3062
+2351 2972 3031 3081
+240 3263 2970 2850
+2979 3024 3021 2982
+2922 2506 2473 2362
+812 2977 2393 2481
+4166 522 4202 3632
+3170 476 2327 2351
+2977 2509 3018 2533
+3148 3564 3373 3403
+3062 2443 2899 817
+4895 4056 4307 4733
+1759 3010 3113 3004
+2988 2645 2994 2619
+2987 2990 2916 2903
+2990 2995 2916 2958
+717 2989 2988 2955
+372 4112 4089 490
+814 3283 525 3143
+296 1821 2995 3080
+2930 3264 2987 2919
+2989 2993 2335 2959
+293 2554 87 245
+195 2870 2796 2307
+2925 2920 2926 442
+4177 84 4149 4065
+3769 134 3051 2320
+3763 2966 2339 3064
+2965 3031 2479 2940
+2772 3018 2459 3012
+3006 2986 3005 3111
+3007 3004 2490 353
+3009 3004 3007 2528
+3005 2635 3006 2335
+3029 3010 3009 237
+3008 3006 3028 455
+2986 1987 3014 3008
+2675 2459 3012 428
+3015 3011 3003 2910
+4912 14 1418 4837
+3010 3034 3310 237
+2509 3016 3012 2547
+2633 3015 2863 2460
+2501 2863 3024 2710
+2492 3021 3003 2982
+3313 4078 2507 451
+2362 2535 2506 2326
+3023 44 2977 3018
+3023 3030 44 2537
+3022 3021 3027 2874
+812 3025 2977 3017
+3026 3027 3024 2501
+3025 87 3028 2491
+3028 3023 3025 2635
+3026 3029 3027 3009
+2554 3030 3028 3008
+3029 2506 3022 2396
+344 2975 3002 2307
+2485 304 3033 2732
+237 3032 3303 146
+3014 388 3309 3047
+3412 3448 3493 434
+3664 3632 70 3661
+3249 3335 3325 3323
+3732 3065 3577 156
+3065 2342 3577 2356
+3919 3718 3832 51
+3755 2363 2270 3728
+3682 2104 3047 2536
+3050 3512 3511 3392
+582 3061 62 550
+3142 3090 2844 3170
+401 2960 1224 2479
+2808 3042 3034 1978
+2951 371 2968 3126
+3117 3138 3058 3585
+3504 3043 3470 3365
+3712 3806 3969 3000
+3447 3501 3419 3495
+3103 3117 2354 2443
+645 562 3899 3650
+508 3295 3368 2800
+3554 420 3627 3418
+611 3185 3366 3328
+2354 3049 3122 3565
+3171 437 3144 3127
+684 3532 3531 2568
+3532 3539 3044 2352
+2974 3100 3063 2984
+3062 3595 3672 2899
+2973 3001 518 794
+2967 3039 3038 2371
+3067 794 3068 3374
+3334 3066 3069 3646
+3069 3066 2314 3070
+3483 3067 3068 611
+3422 3366 3375 3068
+516 3694 3556 3633
+3378 445 3637 519
+4295 4652 3939 4399
+19 3425 4887 1122
+3824 3783 3785 3734
+3677 3657 3693 3608
+3646 128 514 3334
+3367 1727 3099 426
+2951 3182 2811 3129
+3272 3266 2843 2993
+298 3118 500 2975
+3376 3377 715 3549
+2557 479 3467 3441
+2927 1712 3655 4177
+814 3354 3187 3233
+3591 3162 3427 3704
+3347 3256 3259 46
+2961 2642 3158 201
+3212 3137 3154 3206
+3123 3193 3045 442
+3124 3227 3149 2914
+4107 50 4945 981
+3154 2843 3200 3146
+3188 3144 3133 3175
+3555 3586 3548 3557
+3473 3472 3097 3122
+3107 3096 2087 3121
+3124 45 5102 2377
+3101 3078 3100 3667
+3099 2810 3102 3062
+3099 3102 3553 250
+2354 3101 3100 2443
+887 377 3179 3053
+4868 463 3453 4740
+3200 2879 3215 3154
+3232 3265 46 3259
+3518 3097 3468 550
+3147 3284 4866 3350
+3233 3379 814 3203
+415 3204 3200 811
+3113 3237 3142 3004
+3281 3113 3170 2351
+3111 3112 3286 2986
+3471 3549 3465 3541
+3136 582 3201 3161
+3439 2352 3544 3138
+3053 3140 3049 3445
+2353 3126 2327 3081
+5312 686 4742 5138
+257 3220 3184 3313
+3122 2811 3097 329
+3096 3180 3121 3058
+3090 3142 430 353
+3098 3091 3213 2847
+2941 472 1828 2217
+3172 3048 3152 3118
+371 3163 3059 3189
+3169 2327 476 2364
+3079 2868 3531 3164
+3325 2782 3249 3240
+4100 4101 2345 1784
+564 3611 3576 3551
+3094 2487 3134 2217
+3133 2487 3173 376
+3537 3510 3586 3557
+3531 3532 17 3115
+3155 3089 3190 3205
+329 3140 3116 3049
+3140 2568 684 377
+3138 3139 3546 3117
+2487 437 3169 2364
+3123 3045 3271 3111
+2844 3205 3269 2992
+3059 437 3094 3167
+811 2941 3146 2962
+430 3093 3194 3145
+3108 4947 4969 346
+3559 2983 106 3506
+2642 2961 3091 2776
+2815 508 2624 3383
+3339 3338 2538 1160
+3156 281 2951 3126
+2833 5112 917 3258
+3089 3155 3105 3093
+3137 3223 3154 3268
+3318 3152 3160 298
+3387 3382 3181 3163
+3217 3088 77 23
+3179 2951 2811 377
+334 3156 3179 1896
+3389 3115 2868 3486
+478 3593 3701 3086
+3167 3164 3157 3127
+3163 459 3129 371
+3809 3949 2966 3717
+2828 3224 1887 3225
+3520 3163 3382 3144
+4196 4719 659 755
+3128 3173 3171 3141
+2981 3192 3045 3112
+3189 3169 3188 3059
+2327 3189 3174 3126
+3177 3188 3169 3134
+3192 3172 3191 2815
+3385 3209 1828 3094
+3184 2538 257 288
+3193 3173 442 376
+3539 258 2617 3525
+3180 3160 3159 3103
+334 3179 3122 2354
+3486 3383 3157 2868
+2624 2087 3079 2868
+3460 3241 703 729
+3336 3176 3120 3342
+1122 3057 283 19
+2010 3273 2854 5207
+3296 3085 679 723
+3209 3171 3173 3094
+3191 3172 3171 3127
+3137 3214 3360 3203
+3189 3210 3174 3387
+2844 3170 3174 2900
+3194 3208 3090 3177
+3146 3206 3193 2941
+1887 3224 2078 3258
+3234 1731 4879 2799
+1131 3372 3403 3503
+5072 5076 4322 3235
+3228 3204 148 2616
+3110 3105 2912 3093
+17 3115 3202 3477
+3526 3201 136 22
+3381 3190 3205 3109
+2879 3110 3199 472
+3137 3207 3203 3143
+3208 3089 1828 3194
+3210 3205 3208 2844
+3207 3206 3209 3193
+3175 3210 3208 3188
+3207 3209 3388 3191
+915 901 3229 5121
+2879 3214 3089 1828
+45 3124 2961 2622
+606 3190 3212 3384
+2946 3257 3216 3105
+3215 2839 2476 2879
+5098 45 3158 387
+5303 5261 5304 104
+5020 5127 4322 4867
+671 3120 2782 3328
+917 935 1069 5157
+2828 205 339 2883
+2946 3421 3256 3155
+3166 63 3195 906
+5193 3227 3166 2642
+339 3263 914 2850
+3225 5157 3228 3091
+3227 2839 1887 3199
+3211 904 474 3305
+5236 5291 5139 3455
+4859 4786 4134 4744
+914 3106 673 340
+3357 700 3085 3109
+670 3196 723 3296
+1094 5019 3198 3321
+3273 5237 5256 5207
+3271 3276 2911 3111
+4942 4710 4237 4954
+4891 4954 4810 1344
+3470 3368 3462 3130
+695 685 3183 670
+1040 5055 3288 566
+3250 2867 3462 3318
+5130 5012 5328 5339
+2842 681 5302 5236
+4009 3767 4104 3796
+4185 3356 84 1710
+2017 4085 3343 1954
+3037 3130 257 2867
+3243 3472 3280 334
+3280 2802 3314 332
+4964 3253 4313 792
+957 5190 3252 839
+4930 566 1077 4319
+82 3260 3304 414
+3268 3087 3349 3223
+3258 3262 2078 3215
+3195 3153 3257 2839
+3272 3260 3087 3106
+3259 3267 3255 392
+5169 4997 5104 1166
+5079 46 3257 2946
+3264 296 3226 2976
+717 3263 205 2994
+2078 914 3266 3106
+2912 3265 296 3080
+3260 3272 2911 2841
+3256 3269 3270 3155
+525 3271 3268 3143
+3271 3272 3268 2843
+3237 3270 3269 3142
+3267 3259 3270 3080
+5267 5215 3236 3186
+5214 5211 5267 2854
+5234 3350 5255 679
+3307 3327 3282 3237
+1119 713 81 2927
+2577 3298 1104 3289
+3317 321 3281 2972
+3251 3250 1727 2810
+3279 3286 3316 3112
+3286 3312 3324 3276
+2936 3323 2992 2900
+4966 3331 3108 4773
+4233 433 249 4194
+3310 3282 3281 3113
+2275 3319 4075 2073
+3242 5043 4970 4590
+2803 3278 2368 1184
+4321 4101 431 367
+446 93 3760 4058
+469 1114 3812 2085
+3646 3294 4210 310
+3293 4047 1119 1671
+3325 2936 3296 3055
+2878 3295 3187 3234
+2878 3338 346 375
+3302 1160 3299 3278
+3300 3298 1058 2378
+3299 3304 3301 2379
+3303 3300 3307 146
+3303 2730 3298 1104
+3301 3312 3302 3033
+3300 603 3307 3255
+4839 5005 5081 3229
+4448 3977 3956 4228
+3301 3304 3276 2911
+3309 1139 288 2104
+3308 3310 321 3034
+3312 3286 3309 3014
+585 1504 4263 267
+2730 3282 3310 3303
+3328 3120 2802 3019
+3251 257 2867 1139
+5236 5123 5141 5251
+2900 3317 3323 3281
+3318 2867 3316 3279
+3317 281 3243 3156
+2075 431 3287 4092
+2928 3812 1114 2084
+5198 3235 5177 5144
+4865 4691 1037 4703
+3324 3283 3037 3316
+3327 3323 3335 3282
+3130 3037 2878 3295
+2901 4023 4379 629
+3324 3346 525 3276
+3220 3313 3365 3057
+3449 697 3455 5125
+5278 5250 5273 3454
+3284 4972 5281 4910
+5296 4958 5059 4896
+3414 3423 3407 310
+3077 1721 583 3067
+2538 3338 3037 3324
+3339 3184 540 4102
+5093 4904 5007 826
+3151 3297 3335 3345
+90 3151 3336 1116
+4330 4985 4959 4264
+4236 3363 4150 635
+4077 4102 4078 3184
+3248 4028 4059 2287
+4351 2274 4646 4341
+375 438 3346 3338
+3348 3345 603 3327
+5142 3349 82 3087
+3349 3354 3346 525
+3355 3348 3347 3256
+3108 4773 3275 375
+5005 4839 1103 5119
+4117 4953 4972 4978
+220 4864 50 4893
+679 3348 3355 3085
+3349 4846 3354 675
+529 3247 4190 4064
+3360 662 675 3233
+4913 3361 3937 4816
+4952 4864 4979 4941
+3357 3421 606 3190
+3907 4909 3358 4841
+1983 1077 1040 1779
+4869 287 3341 4267
+4236 3371 3680 3950
+3366 3050 3369 3328
+3365 3070 3416 3057
+3375 3369 3558 3078
+3514 3469 3240 3055
+3365 3504 3367 1727
+3955 3958 3931 539
+81 3432 1119 3364
+3495 270 3197 3501
+2983 3588 106 2593
+41 310 3423 3066
+3367 3551 3070 2314
+3538 499 3082 3564
+3082 499 3590 3580
+440 3690 3879 3072
+3380 3402 3381 3109
+3476 3379 3383 508
+3379 3384 3388 3203
+3385 3477 3157 3167
+3380 3387 3181 3150
+3381 71 3385 3214
+3382 3388 3384 3175
+3660 3615 3629 4074
+3388 3157 3383 3191
+3387 3381 3385 3210
+3478 582 3468 3161
+563 3557 3471 3536
+3622 3552 3620 3584
+86 3490 3043 3416
+3614 495 289 3594
+200 3556 3396 3616
+3695 3617 3396 3671
+3571 3395 3600 3394
+4144 113 638 3762
+4121 4129 3400 3623
+3408 489 3624 3479
+3401 418 3398 413
+3400 4129 4175 4200
+3379 3476 71 3460
+3439 3197 270 2983
+3498 2667 379 3493
+5271 2842 4790 5128
+3407 126 721 4214
+3333 450 29 3406
+3413 4132 2135 3399
+3844 4304 4980 2368
+4813 5322 4063 4118
+4261 4570 4806 5001
+3035 9 3429 450
+3429 722 126 3408
+29 3415 3333 1671
+3490 3416 3414 1122
+3415 3392 3422 3366
+3422 3428 3418 3550
+3423 3417 517 3056
+3463 3052 3420 3474
+3419 3480 3461 3475
+675 2010 3360 3223
+3423 3416 3417 3070
+3422 3418 3333 3374
+3428 3505 3497 9
+4902 406 3489 3074
+1094 3449 4880 5221
+3086 3560 3445 2904
+3424 86 106 3417
+2488 3448 3412 3413
+3461 3480 379 3484
+3433 4242 636 721
+4907 4903 4236 3371
+3431 4241 470 29
+1037 4708 108 1801
+4726 473 4871 292
+5100 3453 3441 4726
+3446 473 4683 4883
+3440 3453 685 463
+3542 3403 3116 3564
+3467 3441 3438 3461
+3083 3436 3440 3494
+711 4871 2852 3491
+4302 5099 5300 5065
+5056 4892 830 4208
+715 3427 3538 3117
+4243 3437 2845 4877
+3463 3496 3052 3519
+2667 3035 3429 3450
+915 3329 3426 5129
+470 473 4242 3448
+687 662 5211 606
+4790 5235 5276 5213
+3436 3454 3438 3104
+876 5100 3330 3453
+3230 4880 3329 930
+5297 5249 5099 4851
+5323 5321 5202 5319
+3502 2488 2945 3496
+3561 2945 1131 3503
+3402 3183 687 700
+3494 3420 3430 3440
+3469 3472 3240 3243
+3494 3447 3419 22
+563 3471 3481 3508
+3561 3537 3580 3114
+17 3522 3523 2617
+95 3083 685 3440
+2087 3516 3107 3389
+3462 3368 2087 2624
+3050 3511 3240 2782
+3464 3390 3537 3114
+3504 3462 3096 3250
+3096 2593 3504 3588
+3419 136 3475 22
+3478 3420 3474 95
+3380 3487 3402 695
+3486 3382 694 3201
+3475 3389 3516 2804
+3562 2488 457 3399
+3499 3430 3420 3515
+563 3464 3507 3534
+457 2488 3505 9
+3069 3714 3724 451
+728 3485 3430 463
+379 3484 3491 4871
+3477 3487 3181 3161
+3486 694 3476 2804
+3511 3489 728 406
+3490 3491 3488 3425
+3489 3392 3492 3415
+3485 3489 3492 3442
+3493 3491 3490 434
+3035 3404 3497 3492
+292 3463 3461 3441
+3372 3524 62 3052
+2667 3500 3447 3458
+86 3424 3498 3493
+3497 3500 3499 3404
+3517 3498 3501 3480
+3501 3498 3502 3496
+3499 3500 3372 3052
+3500 3505 3503 3458
+3502 3506 3197 3459
+3473 3050 3472 3369
+3424 3506 3502 3482
+3148 3503 3505 335
+3533 3510 3537 3481
+3521 3464 3540 3534
+3692 3690 3689 3882
+3568 3135 3507 3557
+3470 3043 3513 3488
+3043 2593 3517 86
+3511 3515 3514 728
+3368 3513 3516 2800
+3513 3517 3516 3480
+3514 3515 3468 3478
+3515 3512 3518 3499
+3517 2593 3107 270
+714 3526 3524 3447
+912 459 17 3167
+3541 3508 258 557
+3523 3466 3532 3539
+684 3466 3522 3545
+3525 557 3519 3495
+3524 3526 3178 62
+3519 2617 3525 3202
+445 3609 528 3664
+3696 3700 537 3610
+2617 3540 3547 3534
+4123 3644 184 38
+459 3060 3136 3129
+3060 3522 3136 3061
+3562 3507 3561 2945
+3508 3481 3529 714
+3756 3617 3658 3659
+715 3549 3390 3546
+3465 3507 3135 3471
+3560 3376 3445 3585
+3178 3522 3543 3061
+3547 258 3508 3529
+3542 3114 3521 1131
+3549 3541 3544 3439
+3544 258 3545 3539
+3546 3542 3543 3116
+3547 3546 3543 3523
+3536 3544 3545 3140
+563 3545 3540 3529
+3582 3095 2938 3569
+3082 3114 3536 3542
+106 3551 3611 3417
+3550 3558 3132 3375
+537 634 3391 3610
+3572 3558 3565 3101
+3056 634 1129 3611
+3095 3591 3590 715
+3071 3693 3394 3633
+3135 3510 3095 3390
+3553 3551 3588 3367
+3612 499 3148 335
+3427 478 3538 3572
+3575 3533 3465 3459
+3567 3533 3574 3479
+3696 3695 3571 3603
+2983 3376 3585 3439
+3585 3553 3588 3058
+3604 3590 3591 3593
+3619 3568 3578 3562
+3569 3587 3567 3510
+3568 3614 2938 3548
+2266 538 1737 539
+3703 3563 3396 3581
+3576 3553 3560 250
+3620 3574 335 457
+3573 3578 3575 3562
+335 3574 3580 3561
+2332 3132 478 3572
+3039 1124 3038 2296
+3574 3584 2807 3567
+3664 70 4106 3639
+3377 3575 3589 3465
+3571 3603 3582 3591
+3616 3581 3594 3548
+3602 3669 2969 2904
+3606 3391 3618 3578
+3564 3538 3565 3049
+3095 3589 3587 3135
+2807 2938 3586 3568
+3373 3565 3558 3473
+3586 3590 2807 3580
+3589 3555 3566 3377
+3581 3566 3555 3086
+3597 3644 3614 3619
+3607 3610 3162 3566
+3393 3582 3605 2938
+3598 3667 3673 3063
+522 2347 3652 4193
+38 3592 289 3618
+3672 3675 3732 3595
+3616 495 3634 3614
+2213 3396 3617 3692
+3742 3720 3710 109
+3583 3699 3668 250
+3605 3563 3604 3581
+3610 3606 3603 3566
+3606 289 3603 3594
+3584 3605 3604 2807
+3593 478 3612 499
+562 3677 3631 3076
+3679 3527 515 3613
+3593 3552 3528 3604
+3554 3612 3132 3550
+634 3607 3611 3559
+3661 4186 4123 3609
+3393 3592 3599 3569
+3675 425 3386 2507
+3599 3394 495 3582
+3600 3395 3535 3689
+3619 3597 3622 3584
+489 3592 3618 3567
+3625 3391 634 3573
+4493 4337 4751 4068
+3391 3623 4121 3618
+3624 3398 3622 489
+3625 3626 3623 3399
+3624 3620 3627 457
+3624 3627 4158 2135
+3626 3625 3056 517
+3927 3866 3924 3910
+3386 425 3682 2104
+2254 3944 3941 2090
+3608 440 519 3633
+4066 2980 3036 4126
+3631 3071 3634 3556
+3641 3633 516 3599
+3798 3929 3968 614
+4065 3960 496 1473
+523 3879 3886 3072
+3944 3978 4039 3984
+3641 3579 445 519
+4190 4129 924 1777
+3644 3639 184 3634
+3915 2066 3892 2046
+4120 4136 3651 556
+3641 3530 3656 3592
+4448 4297 18 98
+3293 3077 4047 3067
+4031 4006 4005 1708
+520 3911 3649 3718
+3651 4136 3648 3854
+519 3727 523 3054
+34 3643 3649 3925
+113 3596 4448 98
+4182 4200 4132 413
+3957 4195 4197 3893
+4282 3084 1794 1783
+3644 418 70 413
+3076 3678 3884 3819
+3697 3757 3535 669
+3689 3535 3890 3679
+493 3386 3681 3735
+4126 3613 418 3036
+4228 4201 113 638
+2275 3793 4091 4103
+3036 3579 3917 3527
+3699 2280 3668 3736
+3668 3747 3669 2781
+426 3699 3595 3099
+3602 3665 3666 2332
+3583 3666 3740 3704
+3902 3896 3874 535
+3395 2866 200 231
+1124 3676 3598 3063
+2969 3726 3699 3595
+3960 4084 328 3811
+3731 3598 3615 3715
+3672 3684 425 2840
+440 3678 3076 3608
+3873 3657 3677 3858
+4186 3785 3659 3609
+4365 3364 4157 4131
+3660 527 2967 2349
+527 3629 2088 3042
+3782 3761 3855 3877
+3676 1124 2088 401
+3787 235 2027 2228
+3836 3688 3786 3838
+4381 3839 4195 3929
+3686 3746 3738 1672
+3691 3617 3509 3659
+3509 3694 3691 3378
+2866 3689 3690 515
+3693 3509 3600 3883
+3556 3694 3692 3076
+3071 3690 3693 440
+3563 3697 3395 231
+3563 3702 3697 3528
+3695 3696 3658 580
+3726 2969 3739 2388
+3673 3665 3602 3667
+1958 3702 3701 3528
+3704 2781 3700 3162
+2360 3703 3700 3696
+3704 3702 1697 3571
+3701 3703 3669 3086
+3755 2270 3777 429
+924 2011 1129 537
+3842 3881 524 3869
+3920 3947 4041 3797
+3771 407 134 300
+3601 559 531 504
+1981 2001 2027 3815
+3804 3051 577 368
+3714 3736 426 2314
+530 3713 3715 3483
+426 3675 3714 2507
+2331 3753 3719 3739
+530 3165 3721 447
+3040 3847 3854 3648
+2280 3716 3729 3726
+202 3779 3601 2164
+3730 3717 2361 3729
+3969 1967 4003 3810
+3757 2363 552 2284
+4043 583 530 3483
+3726 3729 3732 156
+3698 3719 3673 3725
+34 4106 4120 3650
+3737 3041 234 3747
+3721 3719 3752 3725
+530 3721 1509 3731
+3732 3675 493 3730
+3038 3598 3731 3725
+3816 535 2252 3913
+4172 2048 4187 3075
+4074 3935 4098 3660
+3665 447 2973 3713
+3728 3764 2363 1958
+230 3877 3688 3778
+1123 3716 3740 3698
+2270 3739 3747 3669
+4091 4113 4269 2275
+2306 3601 531 2226
+3825 4038 3962 2040
+635 3793 536 4102
+25 4108 4077 468
+230 2046 1981 3688
+3740 2331 3728 3666
+3775 3763 234 2966
+98 4124 3762 3789
+3788 235 3772 3777
+556 1737 645 4120
+3729 3754 2361 2223
+3716 3770 3754 1123
+3769 3752 3753 448
+3772 3041 3705 3773
+3776 2213 3757 3535
+3756 2360 3723 3658
+1988 3854 533 3866
+617 1712 4258 4149
+4161 4015 4112 3291
+3892 3909 3848 3683
+3397 3749 4073 3920
+3764 3748 2338 3001
+3737 3763 2318 2011
+5212 4806 2770 4773
+4278 4332 4267 4079
+4055 3246 3831 4325
+3867 3818 3891 3880
+3000 3806 3770 3754
+3769 3774 3771 3753
+3709 3770 3773 429
+3790 552 3750 3755
+3774 3790 3771 3755
+3775 3773 3770 234
+3808 3792 3774 3748
+3888 42 3788 3756
+3778 3750 42 3705
+3777 3738 235 509
+558 3720 3799 2021
+599 494 610 3863
+3784 3855 2340 3823
+3888 3889 3683 3878
+3832 349 3075 51
+3781 3824 3888 3788
+3890 3075 349 3679
+2252 3914 3876 3686
+3685 3813 3790 407
+552 3784 3750 3776
+3749 3946 3847 3839
+3787 3791 3772 3773
+3790 3813 2337 3792
+3791 3810 412 3775
+3814 3663 3744 2102
+1981 3822 3815 1672
+3815 3821 3828 531
+1687 3246 3840 252
+3708 3802 2336 4119
+3985 3980 449 3635
+3830 3779 202 253
+3980 3945 2090 3981
+249 4164 4258 4224
+3803 152 2047 3797
+3802 3813 1125 2108
+3712 4028 3805 1644
+3804 1990 3807 2285
+3808 3051 3807 3769
+3806 3805 3809 2361
+3809 3810 3806 3775
+3807 328 3808 3165
+3811 3722 3808 3792
+1967 3810 3674 3961
+3320 4099 3292 2259
+3791 3787 3803 4003
+3793 635 3950 283
+3795 3711 3794 2179
+3733 2252 3874 2316
+4111 174 4043 583
+3768 3869 3881 3850
+3857 526 3868 3657
+3863 3904 3881 649
+3822 3829 3795 2306
+3821 3794 487 1672
+230 2027 3781 235
+3075 3784 2340 2048
+3743 4057 555 4048
+3827 267 1646 4010
+2037 3826 2025 1822
+561 3835 3829 3795
+3828 1661 3830 3821
+4001 419 3829 3799
+4009 4030 3767 596
+3040 1988 1972 3783
+1988 2066 1972 3892
+3922 439 595 2040
+4019 3998 3828 2001
+3838 2046 3915 3686
+3852 3978 3895 2316
+487 3836 2316 3686
+3687 98 520 3789
+3796 2254 3966 532
+4005 598 3944 1661
+3845 3863 3707 3869
+488 3908 3872 3887
+4330 4049 3409 2963
+3842 524 122 526
+4136 3986 3918 614
+4040 3919 3789 3718
+3914 3761 3908 3876
+4325 4438 4478 4055
+3818 3853 649 3870
+330 3912 3886 349
+2277 3942 3837 3906
+649 3863 3870 3850
+325 3758 3718 3649
+3892 3781 3683 230
+4430 3928 1677 4268
+3858 526 3897 3819
+3857 3894 562 3678
+533 2277 3895 3927
+4342 4299 4180 4312
+4448 3956 4250 2347
+3868 3867 3865 3887
+3780 3820 3842 3853
+3867 3896 3865 535
+3864 3898 3862 488
+3925 3628 3758 3912
+3862 3768 3864 2252
+3862 3897 3869 3819
+3818 3868 3707 3842
+3853 3905 649 3850
+3923 645 646 3885
+3873 3843 521 3884
+3894 3872 3879 3678
+3906 3670 3880 3816
+3925 523 3886 34
+3877 3887 3848 3786
+3876 3683 3878 3738
+3883 3877 3782 42
+3637 3873 521 3378
+3905 3874 3891 3768
+3820 3901 3707 3818
+521 3883 3889 3509
+3882 3884 3878 3692
+3887 3883 3872 3657
+3871 3899 3900 3924
+3637 3851 3875 528
+3876 3884 3843 3862
+3890 3782 3784 3776
+3890 330 3782 3882
+3785 3889 3888 3659
+3880 3896 3901 3768
+3642 3833 3761 3855
+3654 4135 4120 3959
+3858 3900 3899 3873
+3837 443 3859 3916
+381 3891 3670 3864
+524 3898 3857 3868
+3897 560 3900 3865
+3054 3894 3885 523
+3898 3885 3894 488
+381 3904 3891 3881
+3906 594 3670 2231
+4450 3976 4061 252
+3901 494 3905 3820
+3904 599 3880 3870
+597 3902 3874 3852
+4125 3361 4916 4858
+3909 3910 3848 3843
+3761 3912 3908 330
+3908 3628 3921 488
+4193 4151 3648 4191
+3866 3909 1988 3851
+3921 3916 3914 3733
+3848 3913 3915 3786
+3914 3916 3642 3836
+3895 3915 3913 2316
+4151 4191 3664 528
+3983 2266 3846 539
+3920 3847 3947 3040
+3762 3919 3708 4144
+3913 3910 3927 535
+2092 1967 3834 482
+3924 556 3926 3871
+3925 3923 3628 3885
+3651 3924 3866 3875
+2231 3923 2266 594
+2231 3859 3628 3921
+620 3856 4347 629
+3980 4464 3635 3687
+3931 539 3934 3942
+3970 3370 3958 3930
+4711 4719 4196 246
+3971 4012 2093 2118
+3930 538 485 597
+3735 4103 2073 4097
+4292 511 4467 4492
+3358 4911 4912 5154
+4223 4139 4147 722
+3073 4650 454 1765
+1418 4863 4705 4912
+3945 3988 378 3630
+3983 3984 3852 3930
+4124 3988 3945 4389
+3630 3841 378 3638
+3941 3946 3943 3800
+3789 3945 4040 3980
+3708 3919 2068 534
+3992 4034 3991 2091
+1721 328 583 3165
+4047 4131 3364 3814
+4291 4785 4636 4555
+2068 4040 378 4039
+559 3969 4003 504
+3981 532 2090 4377
+3370 3968 3959 614
+3861 3306 4407 503
+4442 4381 4250 3654
+3370 3959 3931 1737
+3955 4247 3958 3893
+3961 3636 4140 3674
+4138 4137 3960 3811
+4481 3743 4060 492
+172 1742 640 2093
+2038 3979 3971 982
+4498 4472 4574 4456
+4353 3840 3997 4459
+1514 4546 4516 1474
+4382 3970 3635 3955
+3953 577 3722 3051
+449 3968 4443 3931
+3993 3964 3933 1657
+4386 3994 596 600
+3974 4456 4497 4411
+644 4383 3973 3976
+10 4391 4114 4455
+4127 4358 3903 3974
+3306 2317 4355 4141
+4035 3638 3991 3837
+4010 4011 3964 2101
+3946 3800 3798 3929
+432 3954 3800 4441
+2350 4486 4384 4067
+3942 2277 3986 3918
+3942 3985 3638 449
+3986 4037 3984 3798
+3983 325 3985 3846
+2068 378 3990 598
+3943 3989 3941 3997
+3996 3990 3988 3994
+4041 3987 3989 1708
+3948 3978 1661 487
+3998 4036 3948 2001
+3971 2093 1963 774
+4006 3997 3989 3972
+647 4414 4543 4399
+4041 3989 4073 338
+3988 3994 2254 3966
+1661 598 3992 3835
+4005 4006 4009 2254
+554 496 4137 423
+4002 4004 4005 3830
+4001 4007 2096 1353
+3953 3722 2108 3813
+4031 587 419 4001
+4001 3647 3999 3841
+596 3999 3647 3994
+4021 4009 4008 4002
+4007 591 2037 2076
+3246 4007 3831 3999
+3826 3979 2038 1822
+4081 4012 3979 2074
+4317 3933 4011 2116
+1506 4268 4338 4430
+4463 4461 4441 4377
+4270 4373 1701 3760
+4388 605 4249 4506
+4099 367 4100 224
+4543 4414 4431 4626
+2108 4033 561 3835
+2097 2025 4059 2064
+2096 4030 4042 4007
+2268 2901 585 4259
+2268 615 3326 4262
+4026 4356 4171 1703
+4121 580 924 537
+4024 4295 4299 4180
+4232 4299 4352 4333
+1990 565 3343 3804
+4539 4548 4557 4515
+4048 4021 1469 3831
+4033 595 4004 3647
+226 439 577 565
+4019 2092 4031 1708
+4035 4036 2066 3948
+443 4039 4034 3978
+4034 2068 534 3992
+4039 325 4040 3985
+490 555 4045 3743
+4037 3952 4035 3638
+3946 3952 3847 4037
+3996 3708 3990 2336
+2037 2025 4048 4021
+4103 3817 4097 3724
+4783 4791 776 4669
+4038 565 4084 439
+4271 4226 4207 4147
+3950 3294 3646 283
+4054 4042 3825 4030
+3844 4329 4069 4324
+4447 4564 4508 573
+4401 1504 446 4058
+707 652 4393 4474
+4298 4552 4276 1506
+4055 4359 4057 4048
+3849 4254 4054 3767
+4852 4903 4146 2985
+3825 4479 4058 4054
+4057 4477 3291 4051
+3343 565 1645 4020
+496 4484 1473 3962
+3903 4358 4130 4454
+4141 4280 4067 1791
+5119 1103 3410 5029
+1710 3356 4138 2338
+4140 3636 2999 128
+522 3632 4191 4173
+617 4164 3982 4062
+1765 2018 3621 1785
+4332 1732 4339 4049
+4345 4351 4153 220
+4635 1092 4760 4256
+1791 4073 4280 338
+4072 3762 4124 3996
+4078 3735 4077 3386
+4079 3287 4101 2345
+4780 4704 4668 1137
+3342 4074 3745 567
+4074 3342 2102 3019
+4075 3766 2275 536
+5120 953 4672 4791
+585 4317 267 4011
+4112 4113 4089 1140
+4163 1693 4096 189
+584 490 4045 3674
+4087 1140 4086 3248
+4092 4088 4085 1749
+4088 174 4085 1990
+4086 4097 4087 2246
+4082 4111 2991 174
+4102 4108 536 1096
+4111 3741 4131 3663
+1114 2073 3319 4086
+4476 680 4392 4535
+4356 4276 2944 4410
+4419 2268 4408 1647
+4300 4083 4303 4338
+3935 4043 4088 1509
+469 25 2073 3735
+4017 365 3812 2261
+365 4017 3131 1970
+4075 3290 4222 3131
+3342 4090 3744 3336
+2102 3663 3935 4043
+615 591 4254 3246
+4752 4717 4500 4167
+3727 4151 4197 3579
+3092 858 4775 4963
+3745 2345 4090 2577
+4830 4812 4946 1393
+4450 4130 4306 4468
+514 4089 4091 3817
+2991 3760 4082 93
+4270 3741 4082 2075
+4525 4513 3975 4284
+511 4275 797 4492
+4349 4953 1417 5240
+4955 3352 4967 4804
+3410 4531 5029 4711
+2047 4142 4148 3797
+3893 3643 3727 3751
+724 4025 3398 3622
+4707 5024 1418 4801
+724 418 3613 3530
+4220 4073 3749 3943
+4909 3907 4928 4786
+4175 4174 3661 3632
+4554 4249 4279 3976
+4134 4786 4875 4697
+3640 3401 3398 4158
+579 4110 4061 4292
+3950 514 3680 4091
+4205 4139 3653 3408
+1506 640 4418 4276
+4862 3231 4128 4759
+3893 4195 4136 614
+4135 3649 3643 3846
+4000 3961 4148 482
+3961 4064 4148 412
+4169 4168 3938 4132
+3960 4065 1710 1721
+4062 4164 3977 4228
+4143 4172 4144 4119
+4142 103 529 4148
+4173 3397 4142 3920
+1733 35 4221 4354
+244 4812 4609 4056
+4168 4046 3938 4217
+4137 4138 4143 4119
+2999 1463 3759 491
+3341 4898 4908 461
+34 3911 4106 3917
+4494 4363 30 4444
+2018 1765 1743 4070
+5077 5013 5117 5087
+4589 1839 4601 911
+4697 4872 2664 4273
+4366 3680 4282 1783
+4165 4129 1777 3626
+4731 4747 661 4414
+4483 4161 1783 372
+4482 4373 4160 3760
+633 4493 4682 4370
+4083 4300 4393 4184
+301 4067 3801 4141
+4158 4213 4205 2135
+4182 2347 2980 70
+4105 4771 643 4682
+4176 4147 4139 4215
+503 4224 4209 4139
+4788 1033 4811 5133
+4181 4295 4024 4234
+4173 4142 4174 3734
+4172 4066 4144 51
+4187 4126 658 4172
+4126 3401 658 4199
+4224 4258 4168 497
+2999 3084 4210 128
+18 324 4475 4297
+5325 672 5064 5220
+4026 4327 3860 1669
+2944 4537 4171 4235
+3653 503 4202 4166
+529 4206 1463 103
+162 633 643 4163
+1777 3247 4211 41
+3613 4187 669 3679
+4186 4174 4188 3734
+4187 4189 669 2284
+924 4188 4190 2318
+4189 658 3640 3356
+3917 3911 4066 51
+4384 4462 797 301
+3596 4197 520 3911
+3285 4239 4209 4223
+520 3654 3687 4135
+3168 5031 3932 5028
+2347 3654 4193 4106
+4466 4461 4469 4377
+4200 4202 4206 4175
+4205 3653 4199 3401
+4202 4225 4206 3662
+4199 4182 4201 2980
+5001 4990 4996 4986
+5014 5007 5013 761
+4132 4200 4215 4165
+497 4199 4201 4183
+713 4046 2927 4217
+4927 4978 3444 4830
+4194 4287 249 4169
+4212 4177 2927 3293
+4212 4213 84 4185
+4210 4214 4211 310
+4215 4211 4214 4165
+4213 4212 4217 3406
+4213 4168 497 4205
+4391 10 4506 4487
+4207 4147 4214 721
+5293 4825 5303 4721
+28 657 4982 2016
+4389 4449 18 4124
+4145 4281 4273 4766
+1732 4332 4321 4101
+4245 4194 4271 3938
+4225 3801 4169 4176
+4224 503 4228 4201
+4046 4233 1712 4258
+4985 4981 4993 2378
+4141 4225 3306 3662
+4691 737 1037 1786
+4357 1722 1272 4298
+4427 4643 4336 4619
+4027 4276 4356 172
+4271 4281 4226 3285
+627 4171 4235 1406
+4612 4234 4181 1593
+3341 3432 4869 3364
+3238 130 5094 1102
+4512 4404 4239 4455
+4238 4260 4769 4194
+4683 2657 711 2852
+2657 636 4870 3433
+3431 3450 4243 722
+4242 3446 581 4245
+5136 663 4797 4962
+4243 4768 4274 4223
+4763 158 4722 4311
+4443 4382 4442 3959
+324 178 4375 4250
+4016 4127 4526 4505
+3861 4248 4297 3957
+4487 178 324 4412
+4655 4684 4750 4751
+1004 1422 4818 4823
+4359 4301 4104 4055
+1701 2095 4270 2814
+4750 4634 4071 1451
+4653 4760 4671 4540
+4226 3801 3759 4176
+4268 4022 4419 4418
+4741 4445 433 4239
+4910 5124 3411 4977
+4023 4456 629 422
+591 3311 4359 2037
+3340 4729 4966 471
+4929 5313 686 5328
+5065 664 5064 5279
+4324 3363 3766 536
+2901 4259 3856 4013
+4278 4365 4270 3741
+4255 4269 4015 4113
+4046 4274 4233 4223
+5145 5116 892 75
+4156 4221 4274 4759
+4271 2664 4273 4245
+4446 4115 4391 4520
+4232 4053 4094 4133
+4373 4367 189 1693
+4269 4290 4364 3766
+4378 4127 605 4466
+604 4062 4449 4072
+35 4233 4221 433
+3655 1733 81 4157
+4683 4831 2657 2845
+4539 4476 4512 4114
+4367 4307 4354 1733
+4706 4690 4688 1082
+4360 4455 4407 4209
+627 4605 4361 4335
+4480 604 4386 600
+2095 4372 4278 4332
+3951 4760 4765 4653
+4465 4130 3936 4454
+637 4539 667 4394
+4300 4374 4474 4437
+4026 4171 3073 4361
+4458 575 4488 4390
+4250 4178 3645 4381
+4053 4352 4658 4230
+4026 454 4027 3860
+4294 4163 4096 4429
+4254 4379 615 4387
+5294 5239 3443 5288
+4096 575 4458 4401
+3409 1732 28 1784
+4312 4342 1732 28
+4110 579 4502 4495
+4586 4285 4368 2985
+1763 4714 4423 4679
+1227 1656 4335 1444
+631 1450 4362 284
+4761 4246 1092 4395
+4334 3860 4305 1719
+5176 4998 3252 918
+5305 4315 460 4939
+1023 4833 4314 2395
+4850 4710 4942 4896
+4418 640 4081 4012
+4603 1076 1464 4648
+4663 3254 157 1714
+4585 4622 4565 4509
+4334 4222 1771 3290
+4757 3198 5341 3219
+5141 719 916 4881
+287 4267 4049 2963
+1687 3849 4386 3767
+4451 4420 4405 1689
+4341 4180 2274 274
+4936 4798 4920 4689
+4339 4049 4927 4830
+3340 4987 4980 3844
+637 4567 4539 4745
+4069 4290 4222 3766
+4334 1771 4027 172
+4333 4312 4321 2049
+4309 2274 4288 1770
+4537 4231 4641 4618
+3621 4581 4715 4650
+198 4013 4401 4096
+4340 4069 4344 4329
+4346 4372 4339 1393
+4327 3344 4343 157
+4344 3860 4343 4305
+4345 4342 4341 657
+4345 4346 4342 4339
+4070 4344 4343 4844
+1765 454 4344 4340
+653 3928 4437 1718
+4636 4645 4603 4627
+4705 4681 4116 4911
+1656 4590 4663 1803
+1743 3344 4695 4070
+4298 4027 454 4357
+4465 1687 4386 3966
+30 4285 4530 4145
+4360 4407 4412 3977
+4024 4232 4094 1707
+2095 4230 4372 4352
+3976 4505 4061 4518
+1504 4254 4263 4054
+797 4287 4355 301
+4295 4288 4399 2274
+4638 1410 173 4310
+4152 575 1693 4482
+4278 4369 4365 4869
+4269 4364 4366 3680
+4373 4365 4367 4157
+4366 4368 4277 4285
+4369 4370 4367 4307
+4368 4364 4371 4852
+4371 1272 4368 4162
+4370 4369 4372 1393
+4290 4357 4371 4340
+4366 4277 4015 4161
+4294 4458 4473 170
+4496 4248 4378 4469
+4657 171 4427 1641
+4198 4014 4443 3954
+4279 605 4388 4375
+3326 4301 4380 4398
+4379 1504 2901 4401
+4464 4297 3957 3687
+4247 4443 4463 3968
+4574 4522 4460 3974
+4192 4491 4385 3982
+4462 4384 4494 4444
+4289 4353 4325 3972
+4398 4403 4301 4438
+4378 4016 630 10
+4459 4220 432 3943
+4478 4489 4296 4438
+4521 3975 4216 4275
+4512 4093 4662 4532
+643 1445 4052 4163
+4476 4293 680 4533
+4828 4655 4311 4749
+4425 4433 4426 1159
+4737 4774 4772 4741
+4387 4379 170 4458
+3995 3073 4361 1743
+4599 1486 4621 1480
+4051 4338 4380 4303
+422 1640 4421 4498
+4387 4497 4411 4439
+4445 4532 4446 4238
+4408 4471 4326 1476
+1677 4408 4420 4419
+4287 178 4355 3956
+4405 4406 422 4095
+4419 4410 4418 1508
+4094 4409 4413 1633
+615 4403 3973 252
+4355 4251 511 2317
+4420 2944 4410 1689
+3995 4159 4018 4641
+4436 4625 1839 1095
+4417 640 665 1742
+267 4416 446 1646
+4317 4259 4133 4409
+4095 4406 4259 4409
+4326 1641 4406 4413
+1095 4471 4436 4402
+486 573 680 2943
+4308 4724 1517 1100
+4498 4428 4511 4541
+4396 1450 284 1478
+4396 4600 4602 4645
+4376 4651 4231 4587
+4578 4572 4424 4644
+4553 4437 4430 4300
+3856 171 4429 4013
+4432 631 4664 4018
+4431 4434 1790 4626
+1790 4434 4396 1507
+4432 4600 4433 4616
+4687 1716 4670 173
+4550 4415 4588 4421
+4347 4429 4591 4294
+4439 4390 3849 4387
+4453 4438 4440 4403
+4454 4439 1687 252
+4014 4475 4464 3981
+3957 4469 4463 4247
+4247 4377 4382 3970
+4485 4152 4385 35
+4462 542 4404 4260
+4455 797 4275 4404
+4050 4534 1514 4561
+3645 3306 3861 3652
+4220 4467 2317 4280
+4466 3903 4110 532
+4585 4588 4471 4326
+4540 4579 4671 4508
+4519 4490 4454 4439
+4061 4453 4292 4440
+4446 3975 4287 4238
+648 3973 3965 4262
+4639 4666 4545 4523
+4303 4296 4374 4398
+4468 4465 4389 3966
+4554 654 623 4383
+4469 4496 4014 4198
+4445 4192 4385 433
+4464 4442 4014 4382
+4463 4441 4381 3929
+4459 4292 4467 4353
+4450 4502 4279 4198
+4449 4465 3936 604
+4110 4459 432 532
+4442 4375 4461 4198
+642 4497 648 170
+4451 4421 4509 4405
+4511 4563 3965 648
+2943 4474 4529 4374
+4542 4052 4473 4294
+4178 4495 432 4441
+4284 4394 4093 4525
+4482 4479 575 4058
+4479 4480 4390 3849
+4477 4481 4478 4057
+4481 2350 4478 4289
+4480 4479 4484 3962
+4477 4363 4483 4161
+4484 4482 4485 4160
+4483 4486 4481 4060
+4444 4486 4483 1794
+4484 4485 3982 617
+4216 4251 579 511
+4489 4529 4494 4296
+4488 4491 4490 4390
+4492 641 4489 4453
+4492 4489 4384 2350
+4115 4490 4491 3936
+3621 4734 4162 1785
+4385 4488 4503 4152
+4306 324 4496 4475
+4495 4375 4502 4461
+3973 4470 4517 4403
+4424 3965 4578 4402
+4500 4762 4671 652
+4105 4499 4634 643
+4574 4563 4516 4507
+4466 4306 605 4496
+707 542 4529 4494
+4526 623 4513 650
+4358 4249 4506 4524
+579 4505 4016 4216
+486 4533 4501 4522
+4591 4452 4050 4542
+624 4320 4471 1472
+4565 4617 4611 4573
+4472 4424 4564 653
+4284 4392 4680 4238
+630 4504 4515 4114
+4574 4516 4583 4547
+654 4513 4527 4029
+4501 3967 4514 4549
+4519 644 642 4497
+4524 644 4519 4358
+4517 641 4518 4453
+641 4535 4521 4275
+4520 4525 4524 4391
+651 4507 644 4383
+4457 1400 4580 161
+650 4518 4521 4505
+4476 650 4521 4114
+4504 630 4554 4249
+4515 623 654 4557
+4529 4535 2943 641
+4503 4528 4473 4488
+4737 1445 4771 4354
+5316 4920 4118 5032
+4535 542 4392 4404
+667 4507 4394 651
+4540 4629 4447 4562
+4093 4528 4532 4520
+4548 1474 4582 4567
+4652 4657 4336 4181
+4739 680 4558 573
+4029 4293 4331 4284
+4257 1233 4452 4534
+4424 4571 653 1640
+4508 652 573 4474
+3995 4018 4659 4605
+4653 4762 4559 4753
+1404 4699 1716 4457
+3967 4572 4583 4582
+1513 4548 4514 654
+1513 4536 4547 4029
+1474 1513 4516 667
+4436 4587 4571 1640
+4654 1408 1405 779
+4657 4658 171 4053
+162 4640 171 4429
+4460 4526 630 4127
+4743 4556 4568 3951
+4562 4555 4753 4653
+667 4029 1513 4527
+4561 4755 637 4538
+4795 4738 4584 4544
+4567 1474 4561 637
+4447 4562 4560 4558
+4534 4568 4561 4556
+4472 4564 4501 486
+4511 1514 4563 4050
+4510 232 4320 691
+4628 1434 4630 601
+4536 4560 4568 4331
+4627 4567 4562 4555
+4579 1464 4651 4571
+4971 5174 3411 4999
+4569 612 4550 4541
+4546 1514 4428 4631
+4592 4575 4510 691
+3965 4501 4514 4383
+4573 4576 549 1688
+4593 4575 4592 1211
+4593 4599 1665 1528
+4583 4428 4498 601
+4640 4452 4569 4591
+4523 4637 1408 569
+633 162 4337 4658
+4630 4583 4546 4536
+4546 4578 4514 4582
+4756 4559 4717 4762
+232 4613 4320 4451
+4733 4771 4682 4307
+4427 4550 4588 1641
+4436 4613 4587 4451
+4155 1507 1212 4622
+4633 3288 4350 1800
+4508 653 4579 4437
+4576 4573 4595 1493
+4577 4576 4594 1515
+4599 4593 4596 1420
+4596 4592 4597 626
+4598 4594 4595 1482
+4617 4598 4595 1581
+1486 4596 4597 1512
+4594 4400 4577 1500
+1341 4426 4434 4649
+4155 4628 1159 911
+1341 1449 4426 4778
+1233 4781 4318 4348
+1451 162 4634 4640
+4543 4608 1235 4288
+4665 4607 4621 1665
+4611 4606 4608 549
+4605 4614 4607 627
+4681 4146 4955 683
+4778 4761 4635 4730
+4510 4615 4614 4607
+232 4614 4618 4235
+4619 1212 4585 4588
+4611 4626 4612 4608
+4617 1790 4611 4620
+4434 4649 1212 4619
+4623 4615 4510 4597
+4336 4619 4626 4612
+4231 4616 4618 4613
+284 4621 4615 1486
+4638 4606 4620 4400
+4589 4623 4320 624
+4622 1507 4617 1581
+1505 4637 1400 1479
+1510 612 1434 4415
+4618 4432 4018 4614
+4348 4630 4629 4568
+4645 1510 4566 4601
+4631 1233 4627 4534
+4627 4566 4631 4582
+4629 4630 4644 4572
+4916 4858 1001 4694
+4701 5043 4688 4590
+4671 4256 4500 4604
+4781 4610 4071 4692
+3951 4778 4781 4348
+4675 4580 4624 1459
+4666 4665 4362 4621
+4457 4699 4660 959
+4553 4604 4651 4579
+661 4652 4336 4414
+4692 661 1451 4643
+4231 4651 4642 1076
+4631 1434 612 4428
+4426 4648 4348 4628
+4663 4695 1656 3344
+1082 4688 1656 1227
+4649 4318 4645 1510
+4648 4600 1076 4616
+4658 4652 4337 3939
+4427 4640 4643 4569
+4650 4537 4641 3073
+4291 4257 4544 4556
+4698 1404 4703 4551
+716 4252 4395 4746
+1422 4787 4736 4732
+4537 4552 4376 2944
+4581 4552 4650 4298
+1235 1084 1410 4543
+4665 4639 1227 1663
+566 50 5055 4893
+4779 4680 4739 4392
+4350 566 4646 4319
+4431 248 1341 4731
+4660 1235 4638 4606
+4638 173 4457 1400
+4930 4982 4940 657
+4076 744 5026 1792
+5075 5033 4044 149
+4435 4690 4714 4679
+4499 4257 4634 4452
+5074 5113 5115 4080
+1801 1037 1716 1404
+5040 4818 1422 4821
+4678 1408 1801 4637
+4811 5113 5150 5110
+5314 5336 5344 5059
+383 1405 4675 1317
+4670 1084 4308 1410
+467 4745 4662 4512
+4349 244 4609 4845
+4586 4167 4734 4162
+4878 4283 4240 3437
+4752 4918 4734 4252
+1004 5041 4708 4939
+5115 953 5036 4920
+4435 4728 1801 1505
+4633 4286 4699 4647
+4328 659 4712 1013
+1716 1786 4670 4286
+4229 3322 4833 5045
+4730 4642 4635 1076
+1038 4826 5245 5211
+4717 4700 4632 4752
+4893 1101 4646 4351
+4977 981 4924 5124
+4895 4156 1106 4128
+4654 4704 4701 1797
+4688 4545 4701 4639
+1001 4738 4763 4694
+4698 4633 4699 1802
+5069 5160 5147 5039
+3322 4704 4654 727
+4703 5044 4698 4076
+3940 5057 1417 4349
+1786 4286 5046 4754
+4974 4952 4122 5066
+4685 737 4727 3434
+4946 244 5057 4923
+460 3238 4316 4809
+4118 5032 3932 1012
+4719 5032 4689 2846
+4732 4728 1763 1449
+4308 4728 621 4670
+1451 4751 4337 661
+652 4779 4762 4739
+4584 4694 4718 4105
+4756 4717 4859 4744
+3168 3932 4712 4884
+5167 5034 1022 5106
+1004 4218 5063 5333
+4803 4842 696 4246
+1165 683 4831 4889
+4821 5040 4782 4423
+4807 1112 5060 4973
+4740 484 3435 3436
+4708 621 1422 4728
+4727 4714 4713 4687
+4985 4931 4264 1058
+4610 4731 4692 1341
+4748 4159 4730 4664
+4735 4656 4713 4776
+4928 4786 4586 2985
+4682 4684 4923 4493
+1517 4787 4732 4749
+4656 4792 4824 696
+4744 4397 4530 4766
+4700 4764 4765 4559
+4716 4662 4755 4538
+4871 4829 4726 3104
+4769 4397 4766 4260
+3119 5313 5122 5314
+4795 4753 4745 4555
+4771 4718 4737 3231
+4743 4755 4680 4331
+4751 4747 4655 951
+4159 4748 4746 947
+4747 4731 4749 1517
+4395 4748 4761 4735
+4256 1092 4752 4252
+3621 4715 4252 4746
+4750 4694 4105 4684
+4544 4755 4743 4556
+1939 1344 5053 4706
+4745 4753 4739 4558
+4584 4718 4796 4774
+4322 5337 5072 4973
+4878 4873 1005 4901
+4766 4134 4768 4273
+4071 4291 4781 4257
+4776 4311 4610 4749
+4544 4499 4584 4716
+4700 4765 4246 1092
+4785 4738 4843 4795
+4738 4785 4763 4291
+4741 4737 4759 4221
+5292 4900 5066 4820
+4759 4862 4769 4245
+4768 467 4741 4239
+5179 1022 5034 5166
+4167 4744 4530 4586
+4397 4779 707 542
+3765 3284 4931 3350
+4397 4756 4779 467
+1102 5055 5054 4107
+158 4761 4778 4732
+5292 5136 5309 5066
+4776 4610 4636 4602
+4772 4774 4716 4662
+4822 5044 5088 4076
+4635 4760 4636 4603
+4979 4724 4941 1100
+5101 4044 4798 1049
+4950 5069 5145 1018
+158 4765 4764 3951
+3231 4125 4128 4733
+4656 4821 922 4735
+5152 4170 4811 5134
+4848 104 4825 4808
+3405 5302 4794 3452
+4044 5074 4080 5075
+4855 922 4803 4736
+4937 5095 5083 5023
+5294 5271 543 4790
+4764 4559 4796 4743
+4795 4756 4861 467
+4244 4942 5296 4867
+776 4328 4783 659
+5148 5151 5048 1033
+4857 4915 4842 4803
+4122 4856 4817 4820
+4843 4832 4842 696
+4828 4800 4792 4722
+4830 4117 4812 287
+5296 5059 5321 5127
+3411 5265 4910 3765
+4906 4725 5094 5062
+5226 4835 4819 4789
+4710 4891 4853 5041
+663 5066 3239 4952
+4676 4788 4170 4814
+4109 4804 4146 4852
+3410 5060 4849 1023
+458 5107 4811 5110
+5210 265 5258 5287
+3358 4841 4838 4832
+4837 4801 4855 4834
+4253 4674 4900 4820
+4832 4808 4836 4824
+4818 4801 4767 4834
+4856 4674 4724 4787
+5084 4970 4780 69
+4824 4825 4834 4253
+4819 4823 4855 4736
+4847 4789 4218 4823
+5272 5274 5235 4693
+5312 5243 4929 5345
+922 716 4803 4395
+1005 4901 4868 4740
+4804 4109 4208 4329
+4723 4886 4283 1106
+4802 4816 4857 4819
+130 460 4315 4691
+4820 4817 4847 4823
+4808 14 4837 4848
+4837 4857 4819 4855
+4835 3013 4836 4817
+5226 5154 5224 4816
+5168 3351 3305 4925
+4898 4922 4956 4908
+3361 4876 4816 4860
+4802 4800 1001 4722
+4860 4802 1001 4764
+4927 220 4940 4345
+4909 4681 4911 4889
+5255 5238 5215 3355
+4834 4848 5270 4825
+4835 4948 4847 4789
+5305 5322 5306 4813
+5318 5305 5306 4316
+5308 5311 3456 5140
+4869 4056 4812 4369
+5063 4809 4900 1004
+4968 1056 4994 414
+4792 4836 4817 4824
+922 4801 5024 4821
+4832 4913 4800 4836
+4860 3907 4859 4632
+3231 4861 4858 4718
+4861 4841 4858 4843
+4862 4860 4859 4796
+4861 4134 4877 4768
+5057 3940 5025 4917
+5058 4892 3359 3353
+108 2395 3322 727
+4947 3108 5283 5232
+4797 5062 3219 1725
+4829 4879 5278 3104
+4852 3363 4236 4364
+1119 4899 4241 1671
+4740 3435 3442 3485
+4895 81 4156 1733
+1165 265 4758 373
+4875 4876 4889 4909
+1106 4877 4874 4128
+5289 4874 4877 4841
+3446 4876 4875 4862
+4883 1165 4758 4683
+4890 5233 4868 3196
+4881 3426 3455 5222
+4880 5291 1094 4323
+5242 5294 543 5272
+484 5289 4878 3437
+4719 674 2846 3
+4933 621 737 1786
+683 4907 4831 4903
+4899 4908 4902 3074
+1008 4949 4990 4991
+4845 4723 5228 4874
+4947 4879 4897 2799
+3239 4900 4809 4933
+1055 4864 3444 220
+3353 1939 4661 4695
+5064 664 5298 4989
+4697 4903 4872 2985
+5063 3332 4316 5318
+4902 4922 4901 4890
+4840 4967 4969 4150
+2657 4907 4887 4870
+4767 4853 4891 4818
+4897 4758 711 4829
+4887 4897 711 3425
+3432 4886 4056 4895
+5008 5023 3337 837
+5033 5077 5031 5028
+5096 5095 4807 5009
+4899 4886 4908 3432
+4887 4907 4840 4150
+3361 4125 4845 4874
+4261 4806 5279 3331
+4845 4349 3937 5262
+4913 3937 3940 3013
+4915 3358 4912 4857
+5070 5338 4926 1030
+4916 4913 4917 4800
+4918 3907 4915 4632
+4915 4863 4918 716
+4923 4916 4917 4684
+5008 5171 24 1120
+5050 4686 4328 4531
+24 4968 5022 4975
+373 4840 4947 4897
+4709 4928 4918 4734
+4989 830 5058 4696
+4839 5120 5051 1020
+5121 4914 5012 5131
+4208 4844 4987 4329
+244 4125 4923 4733
+686 4827 4265 5315
+3254 1008 4935 4667
+2770 4773 4729 438
+5011 1019 5216 1015
+5040 4885 4891 1344
+5200 137 4999 5187
+50 4930 4945 4940
+4328 101 5101 1006
+5007 5042 5013 4793
+5132 5130 5332 5133
+4314 1010 4685 5317
+4667 4987 4935 4844
+1939 3359 1344 4782
+4316 3238 5062 4797
+5214 5267 5213 5180
+5174 5227 5266 137
+4935 4990 3092 4986
+4109 4709 5056 1785
+3147 4866 4922 4890
+5270 709 5137 4848
+1983 4988 4888 5016
+5153 5162 4784 282
+955 5079 5097 46
+4707 5058 3359 4810
+3352 4955 5280 4116
+3239 3238 663 1102
+4956 4953 4117 4609
+4955 4840 373 683
+5014 5077 5168 5033
+5293 3332 5292 5063
+3340 4986 4987 4976
+5103 5178 5175 5078
+5010 5211 5252 662
+4963 5220 1700 4244
+4962 4107 981 663
+3252 4998 5189 387
+4966 4969 4967 471
+4965 4972 3284 4264
+4965 4898 4117 287
+464 5187 4921 4854
+4965 3147 4898 90
+1040 3288 4822 48
+5220 5126 4570 1700
+3352 3331 4966 4976
+4757 5306 4725 5062
+4707 1418 4989 5298
+4992 5016 4921 1075
+4977 4978 4959 4972
+4696 4976 4986 4261
+830 4208 4976 3352
+5037 5024 3359 4782
+4981 4330 4982 3409
+4227 4980 4983 2803
+4983 4980 4667 4219
+4984 4981 4982 2563
+4991 4983 1008 143
+4227 4996 3340 4729
+4203 4945 4959 4977
+4330 4959 4940 4927
+4990 4949 858 5195
+1417 4924 4974 4894
+4888 4988 4945 4203
+4992 4993 4888 4984
+4994 4991 4975 2553
+4994 4996 4991 4227
+4854 4993 4992 417
+5198 5000 5199 5186
+4203 4993 5188 4985
+5190 957 3261 1167
+5191 4964 4313 925
+4934 4570 5195 5001
+4995 5227 137 1118
+3411 4999 5188 4203
+788 5126 5201 672
+137 5097 5187 955
+1056 5142 2770 82
+3305 3351 5015 5070
+5014 5168 5078 5103
+4204 5061 4937 3337
+4904 5184 5021 4919
+5197 5135 1725 4906
+4961 5231 5267 5215
+5167 5125 5129 4932
+5132 5269 3244 4926
+4204 4937 4154 5086
+4957 5006 4204 544
+5144 5005 1112 5072
+5022 4949 5017 4975
+5018 5016 1983 1145
+5017 5083 5023 632
+916 5020 3235 5198
+3219 5019 5155 1725
+5022 5023 5199 5008
+5016 5021 5200 4921
+4793 5021 5018 4904
+4979 5025 4122 4856
+5037 4863 5024 716
+5027 5089 246 4668
+5087 5026 5028 1177
+4905 5027 4196 1175
+5031 4063 5050 4118
+484 5210 5290 5247
+5029 776 4905 4196
+4712 4711 4531 1010
+4905 4669 4957 185
+904 4770 4720 5165
+5204 5194 930 909
+5330 5133 5068 4686
+1055 5025 4979 951
+5102 925 1019 918
+4702 845 5114 999
+4933 4674 621 4724
+4809 737 4685 460
+5144 1112 4937 5095
+5046 5044 3288 4633
+5043 5045 4780 4704
+5044 5046 130 4691
+5053 5045 5043 4706
+5054 1040 5082 1983
+1002 5116 4799 5067
+5093 5178 5182 2836
+4920 776 953 5029
+4925 5110 904 5165
+5169 5106 5156 5161
+5046 5055 1102 4754
+5096 4775 5047 858
+5053 3242 4775 4661
+1055 3444 5057 4946
+4863 5056 4705 4709
+4952 4924 4864 981
+3332 720 4805 4677
+4725 5117 5090 4813
+5080 5078 5093 5007
+4973 4942 4807 4867
+4896 4853 4958 4721
+4894 4179 4266 5124
+3443 4266 5307 5284
+4810 4777 4767 4707
+574 101 5048 1011
+5107 1030 5036 5118
+5159 4702 4784 1017
+4914 5121 5072 5005
+5250 5230 5252 729
+5070 3198 4757 5015
+5114 1016 574 962
+4672 1016 5114 4791
+845 1020 4791 4669
+3198 91 5208 1094
+1103 4957 4154 4905
+4960 5061 5081 5006
+5207 4951 2833 3262
+5177 5081 5061 5144
+474 5078 5080 3305
+5083 5096 5084 5047
+4793 5082 5085 5018
+5085 5082 5088 4822
+5086 5083 5084 1156
+5085 5087 5013 1157
+5086 5089 4154 5027
+5089 5084 5091 4780
+5090 5087 5088 5026
+5089 5091 5060 1023
+5094 5090 5088 130
+5192 882 77 5181
+5049 5183 5061 3337
+5096 4807 5091 4237
+5042 4906 4793 5197
+4906 5094 5082 5054
+5142 5003 5237 4951
+925 5102 77 3217
+3456 3443 5239 5311
+5247 3454 5245 3436
+4936 1016 4783 1047
+5038 5157 5098 3098
+5169 5104 4960 5006
+3261 2880 5103 639
+5178 2880 5189 2836
+5052 5175 5176 4720
+5133 5131 5068 4814
+5213 5180 5209 5128
+2842 5111 681 5301
+5120 4814 5051 4676
+5109 1083 5225 5319
+3153 2835 935 906
+1033 5149 4676 4672
+5073 5147 5074 5039
+101 4672 1033 4686
+4272 5146 5048 574
+4154 1112 1103 5060
+5119 5068 5120 953
+5118 3351 1030 4063
+4925 5118 5110 4080
+4926 91 5070 3211
+5243 5312 4742 5223
+2842 1481 3315 5128
+5220 4261 5064 4696
+1022 3329 5011 1019
+5174 5002 5155 4971
+5341 5244 4805 3219
+5123 5201 5108 3405
+5011 3449 474 5221
+3244 686 4938 5335
+4926 5107 5132 458
+5332 5012 4938 5131
+5036 4938 5107 4170
+4788 5332 458 5179
+5195 1700 5009 858
+5325 4777 5296 4244
+5324 5261 4948 104
+5334 5314 3119 5303
+5343 5345 5326 3230
+4851 5154 5226 14
+5291 3315 1481 4323
+5097 5238 5004 3347
+892 1002 5153 971
+5015 5042 5080 3321
+4784 5146 5153 4272
+5148 5145 5147 5116
+5149 5146 4702 5114
+5149 5151 5146 4799
+5150 5148 5147 5113
+5164 5152 5149 4676
+5153 5148 5152 4799
+5166 5151 5150 4788
+4950 5145 5151 5143
+5262 4838 5140 3937
+5126 788 916 5020
+5190 5052 5176 5158
+3221 5193 5102 3227
+5156 5159 5163 656
+5158 5160 5162 5069
+5164 5159 5161 4702
+5052 5165 5160 833
+5159 5166 5163 4950
+2895 5158 5162 927
+5165 5166 5160 5150
+5164 5161 5034 5051
+4770 5162 5164 5152
+474 4720 5011 5175
+5006 4957 4839 1020
+5103 5052 3261 833
+5173 5172 906 63
+5173 5184 5172 4919
+5171 5181 5170 849
+929 5171 5170 673
+5264 5126 4944 4570
+5106 4960 5191 5167
+5106 4313 5156 2895
+5080 5185 5221 3321
+5191 4960 5105 5049
+697 4770 901 5134
+5256 5108 4943 5251
+5182 5092 5172 1170
+5181 5183 882 5049
+5185 5182 5184 5093
+5186 5183 5171 5008
+5217 5183 5186 5177
+1118 5185 5184 4995
+4934 5003 1056 4968
+2770 5001 1056 4996
+1032 4964 5105 809
+3253 4997 5156 656
+5178 4998 5175 1015
+935 5092 5193 906
+77 5157 5192 3225
+5206 917 5035 2854
+5200 4999 5135 4988
+5251 5256 719 5204
+5009 5198 5199 5095
+5197 5019 4995 3321
+4995 5200 5197 5021
+4934 5195 5199 5022
+5002 5209 5128 5307
+5223 5261 720 3457
+1118 5205 2835 5218
+5196 5206 5205 5035
+5204 5203 719 5222
+5207 2833 5204 5194
+3236 5079 5206 3186
+5326 5299 5268 5076
+5108 5264 5263 5201
+4815 5030 1005 441
+3274 4693 4961 3451
+5255 5265 5238 3765
+3452 4943 5248 5108
+3274 4943 5235 909
+4846 3273 5010 675
+5217 4932 5219 882
+5221 5216 5218 5185
+5222 5217 5219 5203
+1069 5218 5216 935
+4971 5124 4179 4962
+3426 5129 5217 5177
+5218 930 4880 5205
+5304 5202 5122 5319
+5289 5290 5254 4838
+5111 5241 681 5304
+5297 5140 4838 4808
+4944 916 719 5000
+5289 5254 1165 4889
+5303 720 5261 5293
+5234 5071 5233 723
+5248 5252 5253 5010
+5234 5233 5286 4866
+5278 5232 5230 4879
+5230 5232 5253 3275
+5302 4826 3452 5214
+3230 3245 3315 909
+3236 5238 5266 5097
+5212 5237 4846 5142
+5242 5099 4302 5258
+5280 5260 664 4116
+543 1083 5295 5225
+5239 4882 5297 5290
+5313 4827 5122 5329
+5259 5321 5127 788
+5100 876 4693 479
+5285 5248 5253 5263
+5273 5100 5272 5030
+5246 5276 5231 5213
+5295 5320 3456 5324
+5071 1038 3330 876
+3315 5180 5196 909
+5071 5231 1038 4961
+5246 5231 5234 5255
+5224 5257 5228 5262
+4846 5253 5212 3275
+5266 5180 3236 5196
+5254 5258 265 5260
+5257 5290 4815 5239
+5244 5342 5301 1481
+5311 5257 5262 5240
+5229 5202 3218 5137
+5260 5254 5154 4911
+5209 5265 5246 5284
+5265 5209 5266 5174
+5263 5264 5212 4806
+5237 5264 5256 4944
+3274 5010 4943 3273
+5208 5269 5343 91
+5328 5315 5268 5012
+5293 5292 4948 4847
+5300 1083 4794 3405
+4882 5275 4826 5247
+441 3330 5275 5247
+5276 5275 1038 4826
+5274 5277 5273 5272
+5248 5277 5274 3452
+5288 5275 5276 5294
+3330 441 5233 4868
+5281 4266 5284 4910
+5240 5281 5282 4953
+5279 5283 5280 3331
+265 5280 5283 373
+5286 5282 5281 4866
+5279 5065 5285 5263
+5284 5288 5286 5246
+5283 5285 5287 5232
+5286 5288 4815 441
+4302 5287 5285 5277
+5224 5228 4883 4876
+5030 5258 5224 5242
+5326 3230 5141 4881
+5270 4958 4777 4767
+4958 5270 5229 4218
+4882 4302 4794 5277
+5297 5241 5249 104
+4805 5136 3332 4797
+5295 3456 5242 5226
+5308 5309 4894 4974
+5327 5208 5342 5341
+5271 3443 5320 5307
+5319 5259 5329 5109
+3245 543 4790 5235
+5138 5229 3218 4218
+3218 5223 5312 5225
+5317 4849 4850 4314
+4849 5337 4850 4973
+5065 672 5300 5201
+709 5298 4851 14
+5298 709 5325 4777
+672 5325 5323 5321
+664 5099 4851 5260
+4827 3119 5122 5304
+4742 4265 5243 5327
+4677 4742 5138 720
+5343 5269 4929 5332
+5317 5330 5322 4531
+5316 5305 5333 4939
+5336 5333 4850 4896
+3457 5301 5223 5111
+1083 5300 5249 5323
+4805 3457 5310 5244
+5331 4849 5316 3410
+5320 5310 5324 3457
+5249 5323 709 5137
+4179 5309 5310 5136
+5208 5139 5342 5291
+5328 5299 5313 5344
+5327 4265 5269 3244
+5345 5243 5342 5301
+5316 5335 5331 5036
+5322 5330 5338 1030
+5132 4938 5315 5134
+5334 5317 5318 4721
+5333 5336 5335 5138
+5334 5339 5330 5130
+5340 5334 5318 4677
+5340 5338 4757 5306
+4914 5337 5339 5331
+5338 5340 3244 5335
+5344 5339 5337 5336
+4322 5299 5344 5127
+5329 5299 5326 5259
+5315 5139 5268 697
+5341 5327 5340 4677
+4827 5329 5139 681
 
 
 

From d91d010ee7eeb40a84aa8650ff341413bd48cae8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 18:07:48 +0200
Subject: [PATCH 0440/1398] add missing includes

---
 .../include/CGAL/Arr_point_location_result.h                     | 1 +
 .../internal/tetrahedral_remeshing_helpers.h                     | 1 +
 2 files changed, 2 insertions(+)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
index 4651b64c4dd6..50aa748ba724 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location_result.h
@@ -15,6 +15,7 @@
 #include <CGAL/license/Arrangement_on_surface_2.h>
 
 #include <CGAL/disable_warnings.h>
+#include <CGAL/assertions.h>
 
 #include <optional>
 #include <variant>
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 07848cbe492f..1c4237191d0c 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -24,6 +24,7 @@
 #include <CGAL/Weighted_point_3.h>
 #include <CGAL/Vector_3.h>
 #include <CGAL/utility.h>
+#include <CGAL/SMDS_3/internal/indices_management.h>
 
 #include <CGAL/IO/File_binary_mesh_3.h>
 

From f31d41c1f280aae5030040a0d2c89d02bf4c4ba6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 18:08:31 +0200
Subject: [PATCH 0441/1398] missing include

---
 Envelope_3/include/CGAL/Env_sphere_traits_3.h | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Envelope_3/include/CGAL/Env_sphere_traits_3.h b/Envelope_3/include/CGAL/Env_sphere_traits_3.h
index bec2a5b72a94..2a42d07f0a02 100644
--- a/Envelope_3/include/CGAL/Env_sphere_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_sphere_traits_3.h
@@ -25,6 +25,8 @@
 #include <CGAL/Envelope_3/Envelope_base.h>
 #include <CGAL/int.h>
 
+#include <memory>
+
 namespace CGAL {
 
 template <typename ConicTraits_2>

From 9e22fdfcb8df6333d59df93a80b2114820f87c17 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 18:08:57 +0200
Subject: [PATCH 0442/1398] iformat for optional

---
 Stream_support/include/CGAL/IO/io.h | 13 +++++++++++++
 1 file changed, 13 insertions(+)

diff --git a/Stream_support/include/CGAL/IO/io.h b/Stream_support/include/CGAL/IO/io.h
index 8634c38f88dd..3460398bea9e 100644
--- a/Stream_support/include/CGAL/IO/io.h
+++ b/Stream_support/include/CGAL/IO/io.h
@@ -267,6 +267,19 @@ class Input_rep
   std::istream& operator()( std::istream& is) const { return (is >> t); }
 };
 
+template <class T>
+class Input_rep<std::optional<T>>
+{
+  std::optional<T>& t;
+
+public:
+  //! initialize with a reference to \a t.
+  Input_rep( std::optional<T>& tt) : t(tt) {}
+
+  //! perform the input, calls \c operator\>\> by default.
+  std::istream& operator()( std::istream& is) const { return (is >> t.value()); }
+};
+
 #if CGAL_FORCE_IFORMAT_DOUBLE || \
   ( ( _MSC_VER > 1600 ) && ( _MSC_VER < 1910 ) && (! defined( CGAL_NO_IFORMAT_DOUBLE )) )
 

From a32483d885d1672c3d1e9fa5d68574e0e67acd1b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 18:09:18 +0200
Subject: [PATCH 0443/1398] use iformat

---
 .../include/CGAL/Curved_kernel_via_analysis_2/Point_2.h   | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
index c134c8cc9011..2d194eb5254c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
@@ -736,13 +736,13 @@ class Point_2 :
     swallow(is, '(');
 
     // read values
-    is >> rep._m_xy;
+    is >> iformat(rep._m_xy);
     swallow(is, ',');
-    is >> rep._m_x;
+    is >> iformat(rep._m_x);
     swallow(is, ',');
-    is >> rep._m_curve;
+    is >> iformat(rep._m_curve);
     swallow(is, ',');
-    is >> rep._m_arcno;
+    is >> iformat(rep._m_arcno);
     swallow(is, ',');
     is >> rep._m_location;
 

From 8bc01b14a92734b96c7b52649c7907b1168a445a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 18:28:28 +0200
Subject: [PATCH 0444/1398] add missing include

---
 Random_numbers/include/CGAL/Random_impl.h | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Random_numbers/include/CGAL/Random_impl.h b/Random_numbers/include/CGAL/Random_impl.h
index 675ed05e814e..3c66dc5d31c3 100644
--- a/Random_numbers/include/CGAL/Random_impl.h
+++ b/Random_numbers/include/CGAL/Random_impl.h
@@ -23,6 +23,7 @@
 #include <ctime>
 #include <iostream>
 #include <sstream>
+#include <cstdint>
 
 namespace CGAL {
 

From b1465645adc0ac9b420d7fc5952b3b54b1f4dc08 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 29 Jun 2023 18:48:15 +0200
Subject: [PATCH 0445/1398] fix variant output

---
 Stream_support/include/CGAL/IO/io.h | 14 +++++++++-----
 1 file changed, 9 insertions(+), 5 deletions(-)

diff --git a/Stream_support/include/CGAL/IO/io.h b/Stream_support/include/CGAL/IO/io.h
index 3460398bea9e..6a5fa185e6b0 100644
--- a/Stream_support/include/CGAL/IO/io.h
+++ b/Stream_support/include/CGAL/IO/io.h
@@ -191,13 +191,15 @@ class Output_rep
 template <class T, class F>
 class Output_rep<std::optional<T>, F>
 {
-   const std::optional<T>& t;
+  const std::optional<T>& t;
 
 public:
   Output_rep( const std::optional<T>& tt) : t(tt) {}
-  std::ostream& operator()( std::ostream& os) const {
+  std::ostream& operator()( std::ostream& os) const
+  {
     if (t==std::nullopt) return (os << "--");
-    return (os << t.value()); }
+    return (os << t.value());
+  }
 };
 
 template <class ... T, class F>
@@ -207,8 +209,10 @@ class Output_rep<std::variant<T...>, F>
 
 public:
   Output_rep( const std::variant<T...>& tt) : t(tt) {}
-  std::ostream& operator()( std::ostream& os) const {
-    return (os << "--");
+  std::ostream& operator()( std::ostream& os) const
+  {
+    std::visit([&os](auto&& v) { os << v; }, t);
+    return os;
   }
 };
 

From a6330295a6817038712b4de6fd3da23706a7a16c Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 30 Jun 2023 07:56:10 +0100
Subject: [PATCH 0446/1398] Fix for deprecated warning

---
 .../CGAL/Qt/manipulatedCameraFrame_impl.h     | 24 +++++++++----------
 1 file changed, 12 insertions(+), 12 deletions(-)

diff --git a/GraphicsView/include/CGAL/Qt/manipulatedCameraFrame_impl.h b/GraphicsView/include/CGAL/Qt/manipulatedCameraFrame_impl.h
index 885ce76c7c20..6acb02247465 100644
--- a/GraphicsView/include/CGAL/Qt/manipulatedCameraFrame_impl.h
+++ b/GraphicsView/include/CGAL/Qt/manipulatedCameraFrame_impl.h
@@ -193,7 +193,7 @@ void ManipulatedCameraFrame::mouseMoveEvent(QMouseEvent *const event,
   }
 
   case MOVE_FORWARD: {
-    Quaternion rot = pitchYawQuaternion(event->x(), event->y(), camera);
+    Quaternion rot = pitchYawQuaternion(event->position().x(), event->position().y(), camera);
     rotate(rot);
     //#CONNECTION# wheelEvent MOVE_FORWARD case
     // actual translation is made in flyUpdate().
@@ -202,7 +202,7 @@ void ManipulatedCameraFrame::mouseMoveEvent(QMouseEvent *const event,
   }
 
   case MOVE_BACKWARD: {
-    Quaternion rot = pitchYawQuaternion(event->x(), event->y(), camera);
+    Quaternion rot = pitchYawQuaternion(event->position().x(), event->position().y(), camera);
     rotate(rot);
     // actual translation is made in flyUpdate().
     // translate(inverseTransformOf(Vec(0.0, 0.0, flySpeed())));
@@ -210,10 +210,10 @@ void ManipulatedCameraFrame::mouseMoveEvent(QMouseEvent *const event,
   }
 
   case DRIVE: {
-    Quaternion rot = turnQuaternion(event->x(), camera);
+    Quaternion rot = turnQuaternion(event->position().x(), camera);
     rotate(rot);
     // actual translation is made in flyUpdate().
-    driveSpeed_ = 0.01 * (event->y() - pressPos_.y());
+    driveSpeed_ = 0.01 * (event->position().y() - pressPos_.y());
     break;
   }
 
@@ -223,7 +223,7 @@ void ManipulatedCameraFrame::mouseMoveEvent(QMouseEvent *const event,
   }
 
   case LOOK_AROUND: {
-    Quaternion rot = pitchYawQuaternion(event->x(), event->y(), camera);
+    Quaternion rot = pitchYawQuaternion(event->position().x(), event->position().y(), camera);
     rotate(rot);
     break;
   }
@@ -233,9 +233,9 @@ void ManipulatedCameraFrame::mouseMoveEvent(QMouseEvent *const event,
     if (rotatesAroundUpVector_) {
       // Multiply by 2.0 to get on average about the same speed as with the
       // deformed ball
-      qreal dx = 2.0 * rotationSensitivity() * (prevPos_.x() - event->x()) /
+      qreal dx = 2.0 * rotationSensitivity() * (prevPos_.x() - event->position().x()) /
                  camera->screenWidth();
-      qreal dy = 2.0 * rotationSensitivity() * (prevPos_.y() - event->y()) /
+      qreal dy = 2.0 * rotationSensitivity() * (prevPos_.y() - event->position().y()) /
                  camera->screenHeight();
       if (constrainedRotationIsReversed_)
         dx = -dx;
@@ -243,7 +243,7 @@ void ManipulatedCameraFrame::mouseMoveEvent(QMouseEvent *const event,
       rot = Quaternion(verticalAxis, dx) * Quaternion(Vec(1.0, 0.0, 0.0), dy);
     } else {
       Vec trans = camera->projectedCoordinatesOf(pivotPoint());
-      rot = deformedBallQuaternion(event->x(), event->y(), trans[0], trans[1],
+      rot = deformedBallQuaternion(event->position().x(), event->position().y(), trans[0], trans[1],
                                    camera);
     }
     //#CONNECTION# These two methods should go together (spinning detection and
@@ -257,7 +257,7 @@ void ManipulatedCameraFrame::mouseMoveEvent(QMouseEvent *const event,
   case SCREEN_ROTATE: {
     Vec trans = camera->projectedCoordinatesOf(pivotPoint());
 
-    const qreal angle = atan2(event->y() - trans[1], event->x() - trans[0]) -
+    const qreal angle = atan2(event->position().y() - trans[1], event->position().x() - trans[0]) -
                         atan2(prevPos_.y() - trans[1], prevPos_.x() - trans[0]);
 
     Quaternion rot(Vec(0.0, 0.0, 1.0), angle);
@@ -272,7 +272,7 @@ void ManipulatedCameraFrame::mouseMoveEvent(QMouseEvent *const event,
 
   case ROLL: {
     const qreal angle =
-        CGAL_PI * (event->x() - prevPos_.x()) / camera->screenWidth();
+      CGAL_PI * (event->position().x() - prevPos_.x()) / camera->screenWidth();
     Quaternion rot(Vec(0.0, 0.0, 1.0), angle);
     rotate(rot);
     setSpinningQuaternion(rot);
@@ -284,9 +284,9 @@ void ManipulatedCameraFrame::mouseMoveEvent(QMouseEvent *const event,
     Vec trans;
     int dir = mouseOriginalDirection(event);
     if (dir == 1)
-      trans.setValue(prevPos_.x() - event->x(), 0.0, 0.0);
+      trans.setValue(prevPos_.x() - event->position().x(), 0.0, 0.0);
     else if (dir == -1)
-      trans.setValue(0.0, event->y() - prevPos_.y(), 0.0);
+      trans.setValue(0.0, event->position().y() - prevPos_.y(), 0.0);
 
     switch (camera->type()) {
     case Camera::PERSPECTIVE:

From b5b261cfc27026619d4bca77d62c3149d254e108 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Mon, 3 Jul 2023 18:45:51 +0200
Subject: [PATCH 0447/1398] Add support for REUSE

https://reuse.software/

The directories `.reuse/` and `LICENSES/` are for the Git layout.
The same directories in `Installation/` are for the tarball layout.

I have verified that with this patch `v5.5.2` and its release tarball
are compliant with the REUSE specifications.

The shady part is the file `.reuse/DEP5`, kind of equivalent to that
paragraph in `LICENSE.md`:
> A lot of files in the Git repository are not distributed in the source
> tarballs, for examples all the files in the `doc/` and `test/`
> sub-directories of CGAL packages. For all those files, unless they
> have an explicit license notice, the license is the
> Creative Commons CC0 1.0.

We should review the list of files corresponding to the pattern in that
file `.reuse/DEP5`.
---
 .reuse/dep5                                   |  12 +
 .../AlgebraicCurveParser.cpp                  |   2 +-
 .../AlgebraicCurveParser.h                    |   2 +-
 Installation/.reuse/dep5                      |  12 +
 Installation/LICENSES/BSL-1.0.txt             |  23 +
 Installation/LICENSES/CC0-1.0.txt             | 121 ++++
 Installation/LICENSES/GPL-2.0-or-later.txt    | 340 +++++++++
 Installation/LICENSES/GPL-3.0-only.txt        | 674 ++++++++++++++++++
 Installation/LICENSES/GPL-3.0-or-later.txt    | 674 ++++++++++++++++++
 Installation/LICENSES/LGPL-2.1-only.txt       | 178 +++++
 Installation/LICENSES/LGPL-3.0-only.txt       | 165 +++++
 Installation/LICENSES/LGPL-3.0-or-later.txt   | 165 +++++
 .../LICENSES/LicenseRef-Commercial.txt        |   6 +
 Installation/LICENSES/LicenseRef-RFL.txt      |  19 +
 Installation/LICENSES/MIT.txt                 |  17 +
 LICENSES/BSL-1.0.txt                          |  23 +
 LICENSES/CC0-1.0.txt                          | 121 ++++
 LICENSES/GPL-2.0-only.txt                     | 340 +++++++++
 LICENSES/GPL-2.0-or-later.txt                 | 340 +++++++++
 LICENSES/GPL-3.0-only.txt                     | 674 ++++++++++++++++++
 LICENSES/GPL-3.0-or-later.txt                 | 674 ++++++++++++++++++
 LICENSES/LGPL-2.1-only.txt                    | 178 +++++
 LICENSES/LGPL-3.0-only.txt                    | 165 +++++
 LICENSES/LGPL-3.0-or-later.txt                | 165 +++++
 LICENSES/LicenseRef-Commercial.txt            |   6 +
 LICENSES/LicenseRef-RFL.txt                   |  19 +
 LICENSES/MIT.txt                              |  17 +
 ccpp.yml                                      |  12 -
 28 files changed, 5130 insertions(+), 14 deletions(-)
 create mode 100644 .reuse/dep5
 create mode 100644 Installation/.reuse/dep5
 create mode 100644 Installation/LICENSES/BSL-1.0.txt
 create mode 100644 Installation/LICENSES/CC0-1.0.txt
 create mode 100644 Installation/LICENSES/GPL-2.0-or-later.txt
 create mode 100644 Installation/LICENSES/GPL-3.0-only.txt
 create mode 100644 Installation/LICENSES/GPL-3.0-or-later.txt
 create mode 100644 Installation/LICENSES/LGPL-2.1-only.txt
 create mode 100644 Installation/LICENSES/LGPL-3.0-only.txt
 create mode 100644 Installation/LICENSES/LGPL-3.0-or-later.txt
 create mode 100644 Installation/LICENSES/LicenseRef-Commercial.txt
 create mode 100644 Installation/LICENSES/LicenseRef-RFL.txt
 create mode 100644 Installation/LICENSES/MIT.txt
 create mode 100644 LICENSES/BSL-1.0.txt
 create mode 100644 LICENSES/CC0-1.0.txt
 create mode 100644 LICENSES/GPL-2.0-only.txt
 create mode 100644 LICENSES/GPL-2.0-or-later.txt
 create mode 100644 LICENSES/GPL-3.0-only.txt
 create mode 100644 LICENSES/GPL-3.0-or-later.txt
 create mode 100644 LICENSES/LGPL-2.1-only.txt
 create mode 100644 LICENSES/LGPL-3.0-only.txt
 create mode 100644 LICENSES/LGPL-3.0-or-later.txt
 create mode 100644 LICENSES/LicenseRef-Commercial.txt
 create mode 100644 LICENSES/LicenseRef-RFL.txt
 create mode 100644 LICENSES/MIT.txt
 delete mode 100644 ccpp.yml

diff --git a/.reuse/dep5 b/.reuse/dep5
new file mode 100644
index 000000000000..62552ffe07cc
--- /dev/null
+++ b/.reuse/dep5
@@ -0,0 +1,12 @@
+Format: https://www.debian.org/doc/packaging-manuals/copyright-format/1.0/
+Upstream-Name: CGAL
+Upstream-Contact: CGAL Editorial Board <info@cgal.org>
+Source: https://github.com/CGAL/cgal
+
+Files: .* *.cmake *.md .github/* Maintenance/* */TODO */doc/* */deb/* */applications/* */doc_html/* */scripts/* */developer_scripts/* */demo/* */examples/* */src/* */test/* */benchmarks/* */benchmark/* */package_info/* */data/* */cmake/*
+Copyright: 1995-2023 The CGAL Project
+License: CC0-1.0
+
+Files: CMakeLists.txt GraphicsView/include/CGAL/Qt/resources/ImageInterface.ui GraphicsView/include/CGAL/Qt/resources/qglviewer-icon.xpm Installation/AUTHORS Installation/CMakeLists.txt Installation/README Installation/auxiliary/cgal_create_cmake_script.1 Installation/auxiliary/gmp/README Installation/include/CGAL/license/gpl_package_list.txt MacOSX/auxiliary/cgal_app.icns copyright
+Copyright: 1995-2023 The CGAL Project
+License: CC0-1.0
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.cpp
index 009eede6a798..d54d5242074e 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.cpp
@@ -12,7 +12,7 @@
 // This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 // WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 //
-// SPDX-License-Identifier: GPL-3.0+
+// SPDX-License-Identifier: GPL-3.0-or-later
 //
 // Author(s): Saurabh Singh <ssingh@cs.iitr.ac.in>
 //            Ahmed Essam <theartful.ae@gmail.com>
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.h b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.h
index e838f2e3c0db..5e8ac4b0fd20 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.h
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/AlgebraicCurveParser.h
@@ -12,7 +12,7 @@
 // This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 // WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 //
-// SPDX-License-Identifier: GPL-3.0+
+// SPDX-License-Identifier: GPL-3.0-or-later
 //
 // Author(s): Saurabh Singh <ssingh@cs.iitr.ac.in>
 //            Ahmed Essam <theartful.ae@gmail.com>
diff --git a/Installation/.reuse/dep5 b/Installation/.reuse/dep5
new file mode 100644
index 000000000000..68f659f36af5
--- /dev/null
+++ b/Installation/.reuse/dep5
@@ -0,0 +1,12 @@
+Format: https://www.debian.org/doc/packaging-manuals/copyright-format/1.0/
+Upstream-Name: CGAL
+Upstream-Contact: CGAL Editorial Board <info@cgal.org>
+Source: https://github.com/CGAL/cgal
+
+Files: *.cmake *.md doc/* doc_html/* scripts/* developer_scripts/* package_info/* demo/* examples/* src/* test/* benchmarks/* benchmark/* data/* cmake/*
+Copyright: 1995-2023 The CGAL Project
+License: CC0-1.0
+
+Files: include/CGAL/Qt/resources/ImageInterface.ui include/CGAL/Qt/resources/qglviewer-icon.xpm AUTHORS CMakeLists.txt README auxiliary/cgal_create_cmake_script.1 auxiliary/gmp/README include/CGAL/license/gpl_package_list.txt auxiliary/cgal_app.icns copyright VERSION
+Copyright: 1995-2023 The CGAL Project
+License: CC0-1.0
diff --git a/Installation/LICENSES/BSL-1.0.txt b/Installation/LICENSES/BSL-1.0.txt
new file mode 100644
index 000000000000..36b7cd93cdfb
--- /dev/null
+++ b/Installation/LICENSES/BSL-1.0.txt
@@ -0,0 +1,23 @@
+Boost Software License - Version 1.0 - August 17th, 2003
+
+Permission is hereby granted, free of charge, to any person or organization
+obtaining a copy of the software and accompanying documentation covered by
+this license (the "Software") to use, reproduce, display, distribute,
+execute, and transmit the Software, and to prepare derivative works of the
+Software, and to permit third-parties to whom the Software is furnished to
+do so, all subject to the following:
+
+The copyright notices in the Software and this entire statement, including
+the above license grant, this restriction and the following disclaimer,
+must be included in all copies of the Software, in whole or in part, and
+all derivative works of the Software, unless such copies or derivative
+works are solely in the form of machine-executable object code generated by
+a source language processor.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
diff --git a/Installation/LICENSES/CC0-1.0.txt b/Installation/LICENSES/CC0-1.0.txt
new file mode 100644
index 000000000000..0e259d42c996
--- /dev/null
+++ b/Installation/LICENSES/CC0-1.0.txt
@@ -0,0 +1,121 @@
+Creative Commons Legal Code
+
+CC0 1.0 Universal
+
+    CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
+    LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
+    ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
+    INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
+    REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
+    PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
+    THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
+    HEREUNDER.
+
+Statement of Purpose
+
+The laws of most jurisdictions throughout the world automatically confer
+exclusive Copyright and Related Rights (defined below) upon the creator
+and subsequent owner(s) (each and all, an "owner") of an original work of
+authorship and/or a database (each, a "Work").
+
+Certain owners wish to permanently relinquish those rights to a Work for
+the purpose of contributing to a commons of creative, cultural and
+scientific works ("Commons") that the public can reliably and without fear
+of later claims of infringement build upon, modify, incorporate in other
+works, reuse and redistribute as freely as possible in any form whatsoever
+and for any purposes, including without limitation commercial purposes.
+These owners may contribute to the Commons to promote the ideal of a free
+culture and the further production of creative, cultural and scientific
+works, or to gain reputation or greater distribution for their Work in
+part through the use and efforts of others.
+
+For these and/or other purposes and motivations, and without any
+expectation of additional consideration or compensation, the person
+associating CC0 with a Work (the "Affirmer"), to the extent that he or she
+is an owner of Copyright and Related Rights in the Work, voluntarily
+elects to apply CC0 to the Work and publicly distribute the Work under its
+terms, with knowledge of his or her Copyright and Related Rights in the
+Work and the meaning and intended legal effect of CC0 on those rights.
+
+1. Copyright and Related Rights. A Work made available under CC0 may be
+protected by copyright and related or neighboring rights ("Copyright and
+Related Rights"). Copyright and Related Rights include, but are not
+limited to, the following:
+
+  i. the right to reproduce, adapt, distribute, perform, display,
+     communicate, and translate a Work;
+ ii. moral rights retained by the original author(s) and/or performer(s);
+iii. publicity and privacy rights pertaining to a person's image or
+     likeness depicted in a Work;
+ iv. rights protecting against unfair competition in regards to a Work,
+     subject to the limitations in paragraph 4(a), below;
+  v. rights protecting the extraction, dissemination, use and reuse of data
+     in a Work;
+ vi. database rights (such as those arising under Directive 96/9/EC of the
+     European Parliament and of the Council of 11 March 1996 on the legal
+     protection of databases, and under any national implementation
+     thereof, including any amended or successor version of such
+     directive); and
+vii. other similar, equivalent or corresponding rights throughout the
+     world based on applicable law or treaty, and any national
+     implementations thereof.
+
+2. Waiver. To the greatest extent permitted by, but not in contravention
+of, applicable law, Affirmer hereby overtly, fully, permanently,
+irrevocably and unconditionally waives, abandons, and surrenders all of
+Affirmer's Copyright and Related Rights and associated claims and causes
+of action, whether now known or unknown (including existing as well as
+future claims and causes of action), in the Work (i) in all territories
+worldwide, (ii) for the maximum duration provided by applicable law or
+treaty (including future time extensions), (iii) in any current or future
+medium and for any number of copies, and (iv) for any purpose whatsoever,
+including without limitation commercial, advertising or promotional
+purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
+member of the public at large and to the detriment of Affirmer's heirs and
+successors, fully intending that such Waiver shall not be subject to
+revocation, rescission, cancellation, termination, or any other legal or
+equitable action to disrupt the quiet enjoyment of the Work by the public
+as contemplated by Affirmer's express Statement of Purpose.
+
+3. Public License Fallback. Should any part of the Waiver for any reason
+be judged legally invalid or ineffective under applicable law, then the
+Waiver shall be preserved to the maximum extent permitted taking into
+account Affirmer's express Statement of Purpose. In addition, to the
+extent the Waiver is so judged Affirmer hereby grants to each affected
+person a royalty-free, non transferable, non sublicensable, non exclusive,
+irrevocable and unconditional license to exercise Affirmer's Copyright and
+Related Rights in the Work (i) in all territories worldwide, (ii) for the
+maximum duration provided by applicable law or treaty (including future
+time extensions), (iii) in any current or future medium and for any number
+of copies, and (iv) for any purpose whatsoever, including without
+limitation commercial, advertising or promotional purposes (the
+"License"). The License shall be deemed effective as of the date CC0 was
+applied by Affirmer to the Work. Should any part of the License for any
+reason be judged legally invalid or ineffective under applicable law, such
+partial invalidity or ineffectiveness shall not invalidate the remainder
+of the License, and in such case Affirmer hereby affirms that he or she
+will not (i) exercise any of his or her remaining Copyright and Related
+Rights in the Work or (ii) assert any associated claims and causes of
+action with respect to the Work, in either case contrary to Affirmer's
+express Statement of Purpose.
+
+4. Limitations and Disclaimers.
+
+ a. No trademark or patent rights held by Affirmer are waived, abandoned,
+    surrendered, licensed or otherwise affected by this document.
+ b. Affirmer offers the Work as-is and makes no representations or
+    warranties of any kind concerning the Work, express, implied,
+    statutory or otherwise, including without limitation warranties of
+    title, merchantability, fitness for a particular purpose, non
+    infringement, or the absence of latent or other defects, accuracy, or
+    the present or absence of errors, whether or not discoverable, all to
+    the greatest extent permissible under applicable law.
+ c. Affirmer disclaims responsibility for clearing rights of other persons
+    that may apply to the Work or any use thereof, including without
+    limitation any person's Copyright and Related Rights in the Work.
+    Further, Affirmer disclaims responsibility for obtaining any necessary
+    consents, permissions or other rights required for any use of the
+    Work.
+ d. Affirmer understands and acknowledges that Creative Commons is not a
+    party to this document and has no duty or obligation with respect to
+    this CC0 or use of the Work.
diff --git a/Installation/LICENSES/GPL-2.0-or-later.txt b/Installation/LICENSES/GPL-2.0-or-later.txt
new file mode 100644
index 000000000000..623b6258a134
--- /dev/null
+++ b/Installation/LICENSES/GPL-2.0-or-later.txt
@@ -0,0 +1,340 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+     51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year  name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.
diff --git a/Installation/LICENSES/GPL-3.0-only.txt b/Installation/LICENSES/GPL-3.0-only.txt
new file mode 100644
index 000000000000..94a9ed024d38
--- /dev/null
+++ b/Installation/LICENSES/GPL-3.0-only.txt
@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/Installation/LICENSES/GPL-3.0-or-later.txt b/Installation/LICENSES/GPL-3.0-or-later.txt
new file mode 100644
index 000000000000..94a9ed024d38
--- /dev/null
+++ b/Installation/LICENSES/GPL-3.0-or-later.txt
@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/Installation/LICENSES/LGPL-2.1-only.txt b/Installation/LICENSES/LGPL-2.1-only.txt
new file mode 100644
index 000000000000..b042f57e217b
--- /dev/null
+++ b/Installation/LICENSES/LGPL-2.1-only.txt
@@ -0,0 +1,178 @@
+
+GNU LESSER GENERAL PUBLIC LICENSE
+
+Version 2.1, February 1999
+
+Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+Everyone is permitted to copy and distribute verbatim copies
+of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+Preamble
+
+The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users.
+
+This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below.
+
+When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things.
+
+To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it.
+
+For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights.
+
+We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library.
+
+To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others.
+
+Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license.
+
+Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs.
+
+When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library.
+
+We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances.
+
+For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License.
+
+In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system.
+
+Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library.
+
+The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run.
+TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you".
+
+A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables.
+
+The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".)
+
+"Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library.
+
+Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does.
+
+1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library.
+
+You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee.
+
+2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+    b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change.
+    c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License.
+    d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License.
+
+3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices.
+
+Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy.
+
+This option is useful when you wish to copy part of the code of the Library into a program that is not a library.
+
+4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange.
+
+If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code.
+
+5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License.
+
+However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables.
+
+When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law.
+
+If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.)
+
+Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself.
+
+6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications.
+
+You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things:
+
+    a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.)
+    b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with.
+    c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution.
+    d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place.
+    e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy.
+
+For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable.
+
+It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute.
+
+7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above.
+    b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work.
+
+8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance.
+
+9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it.
+
+10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License.
+
+11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice.
+
+This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License.
+
+12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License.
+
+13. The Free Software Foundation may publish revised and/or new versions of the Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number. If the Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation.
+
+14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally.
+
+NO WARRANTY
+
+15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
+END OF TERMS AND CONDITIONS
+How to Apply These Terms to Your New Libraries
+
+If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License).
+
+To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found.
+
+one line to give the library's name and an idea of what it does.
+Copyright (C) year  name of author
+
+This library is free software; you can redistribute it and/or
+modify it under the terms of the GNU Lesser General Public
+License as published by the Free Software Foundation; either
+version 2.1 of the License, or (at your option) any later version.
+
+This library is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with this library; if not, write to the Free Software
+Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names:
+
+Yoyodyne, Inc., hereby disclaims all copyright interest in
+the library `Frob' (a library for tweaking knobs) written
+by James Random Hacker.
+
+signature of Ty Coon, 1 April 1990
+Ty Coon, President of Vice
+
+That's all there is to it!
diff --git a/Installation/LICENSES/LGPL-3.0-only.txt b/Installation/LICENSES/LGPL-3.0-only.txt
new file mode 100644
index 000000000000..65c5ca88a67c
--- /dev/null
+++ b/Installation/LICENSES/LGPL-3.0-only.txt
@@ -0,0 +1,165 @@
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.
diff --git a/Installation/LICENSES/LGPL-3.0-or-later.txt b/Installation/LICENSES/LGPL-3.0-or-later.txt
new file mode 100644
index 000000000000..65c5ca88a67c
--- /dev/null
+++ b/Installation/LICENSES/LGPL-3.0-or-later.txt
@@ -0,0 +1,165 @@
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.
diff --git a/Installation/LICENSES/LicenseRef-Commercial.txt b/Installation/LICENSES/LicenseRef-Commercial.txt
new file mode 100644
index 000000000000..1c5db3b7d70f
--- /dev/null
+++ b/Installation/LICENSES/LicenseRef-Commercial.txt
@@ -0,0 +1,6 @@
+The CGAL software consists of several components, each of which is licensed under
+an open source license. If the open source license is not suitable to your
+needs, it is possible to obtain commercial licenses
+from GeometryFactory (www.geometryfactory.com) for each component of CGAL.
+
+Get more information at "contact@geometryfactory.com".
diff --git a/Installation/LICENSES/LicenseRef-RFL.txt b/Installation/LICENSES/LicenseRef-RFL.txt
new file mode 100644
index 000000000000..49f77c2445e0
--- /dev/null
+++ b/Installation/LICENSES/LicenseRef-RFL.txt
@@ -0,0 +1,19 @@
+Copyright (c) 2014 Stefan Walk
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is furnished to do
+so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/Installation/LICENSES/MIT.txt b/Installation/LICENSES/MIT.txt
new file mode 100644
index 000000000000..89de354795ec
--- /dev/null
+++ b/Installation/LICENSES/MIT.txt
@@ -0,0 +1,17 @@
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/LICENSES/BSL-1.0.txt b/LICENSES/BSL-1.0.txt
new file mode 100644
index 000000000000..36b7cd93cdfb
--- /dev/null
+++ b/LICENSES/BSL-1.0.txt
@@ -0,0 +1,23 @@
+Boost Software License - Version 1.0 - August 17th, 2003
+
+Permission is hereby granted, free of charge, to any person or organization
+obtaining a copy of the software and accompanying documentation covered by
+this license (the "Software") to use, reproduce, display, distribute,
+execute, and transmit the Software, and to prepare derivative works of the
+Software, and to permit third-parties to whom the Software is furnished to
+do so, all subject to the following:
+
+The copyright notices in the Software and this entire statement, including
+the above license grant, this restriction and the following disclaimer,
+must be included in all copies of the Software, in whole or in part, and
+all derivative works of the Software, unless such copies or derivative
+works are solely in the form of machine-executable object code generated by
+a source language processor.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
diff --git a/LICENSES/CC0-1.0.txt b/LICENSES/CC0-1.0.txt
new file mode 100644
index 000000000000..0e259d42c996
--- /dev/null
+++ b/LICENSES/CC0-1.0.txt
@@ -0,0 +1,121 @@
+Creative Commons Legal Code
+
+CC0 1.0 Universal
+
+    CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
+    LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
+    ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
+    INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
+    REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
+    PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
+    THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
+    HEREUNDER.
+
+Statement of Purpose
+
+The laws of most jurisdictions throughout the world automatically confer
+exclusive Copyright and Related Rights (defined below) upon the creator
+and subsequent owner(s) (each and all, an "owner") of an original work of
+authorship and/or a database (each, a "Work").
+
+Certain owners wish to permanently relinquish those rights to a Work for
+the purpose of contributing to a commons of creative, cultural and
+scientific works ("Commons") that the public can reliably and without fear
+of later claims of infringement build upon, modify, incorporate in other
+works, reuse and redistribute as freely as possible in any form whatsoever
+and for any purposes, including without limitation commercial purposes.
+These owners may contribute to the Commons to promote the ideal of a free
+culture and the further production of creative, cultural and scientific
+works, or to gain reputation or greater distribution for their Work in
+part through the use and efforts of others.
+
+For these and/or other purposes and motivations, and without any
+expectation of additional consideration or compensation, the person
+associating CC0 with a Work (the "Affirmer"), to the extent that he or she
+is an owner of Copyright and Related Rights in the Work, voluntarily
+elects to apply CC0 to the Work and publicly distribute the Work under its
+terms, with knowledge of his or her Copyright and Related Rights in the
+Work and the meaning and intended legal effect of CC0 on those rights.
+
+1. Copyright and Related Rights. A Work made available under CC0 may be
+protected by copyright and related or neighboring rights ("Copyright and
+Related Rights"). Copyright and Related Rights include, but are not
+limited to, the following:
+
+  i. the right to reproduce, adapt, distribute, perform, display,
+     communicate, and translate a Work;
+ ii. moral rights retained by the original author(s) and/or performer(s);
+iii. publicity and privacy rights pertaining to a person's image or
+     likeness depicted in a Work;
+ iv. rights protecting against unfair competition in regards to a Work,
+     subject to the limitations in paragraph 4(a), below;
+  v. rights protecting the extraction, dissemination, use and reuse of data
+     in a Work;
+ vi. database rights (such as those arising under Directive 96/9/EC of the
+     European Parliament and of the Council of 11 March 1996 on the legal
+     protection of databases, and under any national implementation
+     thereof, including any amended or successor version of such
+     directive); and
+vii. other similar, equivalent or corresponding rights throughout the
+     world based on applicable law or treaty, and any national
+     implementations thereof.
+
+2. Waiver. To the greatest extent permitted by, but not in contravention
+of, applicable law, Affirmer hereby overtly, fully, permanently,
+irrevocably and unconditionally waives, abandons, and surrenders all of
+Affirmer's Copyright and Related Rights and associated claims and causes
+of action, whether now known or unknown (including existing as well as
+future claims and causes of action), in the Work (i) in all territories
+worldwide, (ii) for the maximum duration provided by applicable law or
+treaty (including future time extensions), (iii) in any current or future
+medium and for any number of copies, and (iv) for any purpose whatsoever,
+including without limitation commercial, advertising or promotional
+purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
+member of the public at large and to the detriment of Affirmer's heirs and
+successors, fully intending that such Waiver shall not be subject to
+revocation, rescission, cancellation, termination, or any other legal or
+equitable action to disrupt the quiet enjoyment of the Work by the public
+as contemplated by Affirmer's express Statement of Purpose.
+
+3. Public License Fallback. Should any part of the Waiver for any reason
+be judged legally invalid or ineffective under applicable law, then the
+Waiver shall be preserved to the maximum extent permitted taking into
+account Affirmer's express Statement of Purpose. In addition, to the
+extent the Waiver is so judged Affirmer hereby grants to each affected
+person a royalty-free, non transferable, non sublicensable, non exclusive,
+irrevocable and unconditional license to exercise Affirmer's Copyright and
+Related Rights in the Work (i) in all territories worldwide, (ii) for the
+maximum duration provided by applicable law or treaty (including future
+time extensions), (iii) in any current or future medium and for any number
+of copies, and (iv) for any purpose whatsoever, including without
+limitation commercial, advertising or promotional purposes (the
+"License"). The License shall be deemed effective as of the date CC0 was
+applied by Affirmer to the Work. Should any part of the License for any
+reason be judged legally invalid or ineffective under applicable law, such
+partial invalidity or ineffectiveness shall not invalidate the remainder
+of the License, and in such case Affirmer hereby affirms that he or she
+will not (i) exercise any of his or her remaining Copyright and Related
+Rights in the Work or (ii) assert any associated claims and causes of
+action with respect to the Work, in either case contrary to Affirmer's
+express Statement of Purpose.
+
+4. Limitations and Disclaimers.
+
+ a. No trademark or patent rights held by Affirmer are waived, abandoned,
+    surrendered, licensed or otherwise affected by this document.
+ b. Affirmer offers the Work as-is and makes no representations or
+    warranties of any kind concerning the Work, express, implied,
+    statutory or otherwise, including without limitation warranties of
+    title, merchantability, fitness for a particular purpose, non
+    infringement, or the absence of latent or other defects, accuracy, or
+    the present or absence of errors, whether or not discoverable, all to
+    the greatest extent permissible under applicable law.
+ c. Affirmer disclaims responsibility for clearing rights of other persons
+    that may apply to the Work or any use thereof, including without
+    limitation any person's Copyright and Related Rights in the Work.
+    Further, Affirmer disclaims responsibility for obtaining any necessary
+    consents, permissions or other rights required for any use of the
+    Work.
+ d. Affirmer understands and acknowledges that Creative Commons is not a
+    party to this document and has no duty or obligation with respect to
+    this CC0 or use of the Work.
diff --git a/LICENSES/GPL-2.0-only.txt b/LICENSES/GPL-2.0-only.txt
new file mode 100644
index 000000000000..623b6258a134
--- /dev/null
+++ b/LICENSES/GPL-2.0-only.txt
@@ -0,0 +1,340 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+     51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year  name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.
diff --git a/LICENSES/GPL-2.0-or-later.txt b/LICENSES/GPL-2.0-or-later.txt
new file mode 100644
index 000000000000..623b6258a134
--- /dev/null
+++ b/LICENSES/GPL-2.0-or-later.txt
@@ -0,0 +1,340 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+     51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year  name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.
diff --git a/LICENSES/GPL-3.0-only.txt b/LICENSES/GPL-3.0-only.txt
new file mode 100644
index 000000000000..94a9ed024d38
--- /dev/null
+++ b/LICENSES/GPL-3.0-only.txt
@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/LICENSES/GPL-3.0-or-later.txt b/LICENSES/GPL-3.0-or-later.txt
new file mode 100644
index 000000000000..94a9ed024d38
--- /dev/null
+++ b/LICENSES/GPL-3.0-or-later.txt
@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/LICENSES/LGPL-2.1-only.txt b/LICENSES/LGPL-2.1-only.txt
new file mode 100644
index 000000000000..b042f57e217b
--- /dev/null
+++ b/LICENSES/LGPL-2.1-only.txt
@@ -0,0 +1,178 @@
+
+GNU LESSER GENERAL PUBLIC LICENSE
+
+Version 2.1, February 1999
+
+Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+Everyone is permitted to copy and distribute verbatim copies
+of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+Preamble
+
+The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users.
+
+This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below.
+
+When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things.
+
+To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it.
+
+For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights.
+
+We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library.
+
+To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others.
+
+Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license.
+
+Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs.
+
+When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library.
+
+We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances.
+
+For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License.
+
+In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system.
+
+Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library.
+
+The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run.
+TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you".
+
+A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables.
+
+The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".)
+
+"Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library.
+
+Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does.
+
+1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library.
+
+You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee.
+
+2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+    b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change.
+    c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License.
+    d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License.
+
+3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices.
+
+Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy.
+
+This option is useful when you wish to copy part of the code of the Library into a program that is not a library.
+
+4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange.
+
+If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code.
+
+5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License.
+
+However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables.
+
+When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law.
+
+If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.)
+
+Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself.
+
+6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications.
+
+You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things:
+
+    a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.)
+    b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with.
+    c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution.
+    d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place.
+    e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy.
+
+For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable.
+
+It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute.
+
+7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above.
+    b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work.
+
+8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance.
+
+9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it.
+
+10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License.
+
+11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice.
+
+This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License.
+
+12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License.
+
+13. The Free Software Foundation may publish revised and/or new versions of the Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number. If the Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation.
+
+14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally.
+
+NO WARRANTY
+
+15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
+END OF TERMS AND CONDITIONS
+How to Apply These Terms to Your New Libraries
+
+If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License).
+
+To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found.
+
+one line to give the library's name and an idea of what it does.
+Copyright (C) year  name of author
+
+This library is free software; you can redistribute it and/or
+modify it under the terms of the GNU Lesser General Public
+License as published by the Free Software Foundation; either
+version 2.1 of the License, or (at your option) any later version.
+
+This library is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with this library; if not, write to the Free Software
+Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names:
+
+Yoyodyne, Inc., hereby disclaims all copyright interest in
+the library `Frob' (a library for tweaking knobs) written
+by James Random Hacker.
+
+signature of Ty Coon, 1 April 1990
+Ty Coon, President of Vice
+
+That's all there is to it!
diff --git a/LICENSES/LGPL-3.0-only.txt b/LICENSES/LGPL-3.0-only.txt
new file mode 100644
index 000000000000..65c5ca88a67c
--- /dev/null
+++ b/LICENSES/LGPL-3.0-only.txt
@@ -0,0 +1,165 @@
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.
diff --git a/LICENSES/LGPL-3.0-or-later.txt b/LICENSES/LGPL-3.0-or-later.txt
new file mode 100644
index 000000000000..65c5ca88a67c
--- /dev/null
+++ b/LICENSES/LGPL-3.0-or-later.txt
@@ -0,0 +1,165 @@
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.
diff --git a/LICENSES/LicenseRef-Commercial.txt b/LICENSES/LicenseRef-Commercial.txt
new file mode 100644
index 000000000000..1c5db3b7d70f
--- /dev/null
+++ b/LICENSES/LicenseRef-Commercial.txt
@@ -0,0 +1,6 @@
+The CGAL software consists of several components, each of which is licensed under
+an open source license. If the open source license is not suitable to your
+needs, it is possible to obtain commercial licenses
+from GeometryFactory (www.geometryfactory.com) for each component of CGAL.
+
+Get more information at "contact@geometryfactory.com".
diff --git a/LICENSES/LicenseRef-RFL.txt b/LICENSES/LicenseRef-RFL.txt
new file mode 100644
index 000000000000..49f77c2445e0
--- /dev/null
+++ b/LICENSES/LicenseRef-RFL.txt
@@ -0,0 +1,19 @@
+Copyright (c) 2014 Stefan Walk
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is furnished to do
+so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/LICENSES/MIT.txt b/LICENSES/MIT.txt
new file mode 100644
index 000000000000..89de354795ec
--- /dev/null
+++ b/LICENSES/MIT.txt
@@ -0,0 +1,17 @@
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/ccpp.yml b/ccpp.yml
deleted file mode 100644
index 75bbbee49189..000000000000
--- a/ccpp.yml
+++ /dev/null
@@ -1,12 +0,0 @@
-name: C/C++ CI
-
-on: [push]
-
-jobs:
-  build:
-
-    runs-on: ubuntu-latest
-    
-    steps:
-    - name: configure all
-      run: cmake -DWITH_examples=ON -DWITH_tests=ON -DWITH_demos=ON .

From b3af96caa1cad9c3bd4483537bf3dcba48e68c80 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Tue, 4 Jul 2023 16:23:14 +0200
Subject: [PATCH 0448/1398] issue #7454 Consistency of BigO notations

Create `cgalBigO` marco and used it.
(`The macro `cgalBigOLarge` is for special situations where we need bigger round brackets)
---
 AABB_tree/include/CGAL/AABB_tree.h            |  2 +-
 .../doc/Alpha_shapes_2/CGAL/Alpha_shape_2.h   |  2 +-
 .../doc/Alpha_shapes_3/CGAL/Alpha_shape_3.h   |  2 +-
 .../Arrangement_on_surface_2.txt              | 18 ++---
 .../CGAL/Arr_trapezoid_ric_point_location.h   |  4 +-
 .../CGAL/Arr_polycurve_basic_traits_2.h       |  2 +-
 .../Barycentric_coordinates_2.txt             | 22 +++---
 .../CGAL/Approximate_min_ellipsoid_d.h        |  2 +-
 .../CGAL/Min_sphere_of_spheres_d.h            |  2 +-
 .../CGAL/rectangular_p_center_2.h             |  2 +-
 .../Concepts/MinSphereOfSpheresTraits.h       |  2 +-
 .../Box_intersection_d/Box_intersection_d.txt |  8 +-
 .../CGAL/box_intersection_d.h                 | 12 +--
 .../Combinatorial_map/Combinatorial_map.txt   |  2 +-
 .../include/CGAL/Combinatorial_map.h          |  2 +-
 .../doc/Cone_spanners_2/Cone_spanners_2.txt   |  6 +-
 .../Convex_decomposition_3.txt                |  4 +-
 .../PackageDescription.txt                    |  2 +-
 .../include/CGAL/convex_decomposition_3.h     |  4 +-
 .../doc/Convex_hull_2/CGAL/ch_akl_toussaint.h |  2 +-
 .../doc/Convex_hull_2/CGAL/ch_bykat.h         |  2 +-
 .../doc/Convex_hull_2/CGAL/ch_eddy.h          |  2 +-
 .../doc/Convex_hull_2/CGAL/ch_graham_andrew.h |  4 +-
 .../doc/Convex_hull_2/CGAL/ch_jarvis.h        |  4 +-
 .../doc/Convex_hull_2/CGAL/convex_hull_2.h    |  8 +-
 .../Convex_hull_2/CGAL/convexity_check_2.h    |  4 +-
 .../doc/Convex_hull_2/Convex_hull_2.txt       | 12 +--
 .../Convex_hull_3/CGAL/convexity_check_3.h    |  2 +-
 .../doc/Convex_hull_d/CGAL/Convex_hull_d.h    |  2 +-
 .../Developer_manual/Chapter_intro.txt        |  2 +-
 .../Developer_manual/Chapter_kernels.txt      |  2 +-
 .../doc/resources/1.8.13/BaseDoxyfile.in      |  4 +-
 .../doc/resources/1.9.6/BaseDoxyfile.in       |  4 +-
 .../doc/Generalized_map/Generalized_map.txt   |  2 +-
 .../include/CGAL/Generalized_map.h            |  2 +-
 .../CGAL/random_convex_hull_in_disc_2.h       |  4 +-
 .../doc/Generator/CGAL/random_convex_set_2.h  |  4 +-
 .../doc/Generator/CGAL/random_polygon_2.h     |  4 +-
 .../doc/HalfedgeDS/CGAL/HalfedgeDS_default.h  |  2 +-
 .../doc/HalfedgeDS/CGAL/HalfedgeDS_list.h     |  2 +-
 .../doc/Heat_method_3/Heat_method_3.txt       |  4 +-
 .../CGAL/Largest_empty_iso_rectangle_2.h      |  4 +-
 .../Inscribed_areas/CGAL/extremal_polygon_2.h | 12 +--
 .../CGAL/Largest_empty_iso_rectangle_2.h      |  2 +-
 .../CGAL/Interval_skip_list.h                 |  6 +-
 .../CGAL/Kernel_d/Aff_transformation_d.h      |  4 +-
 .../doc/Kernel_d/CGAL/Kernel_d/Direction_d.h  |  4 +-
 .../doc/Kernel_d/CGAL/Kernel_d/Hyperplane_d.h |  4 +-
 Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Line_d.h  |  6 +-
 Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Point_d.h |  4 +-
 Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Ray_d.h   |  4 +-
 .../doc/Kernel_d/CGAL/Kernel_d/Segment_d.h    |  6 +-
 .../doc/Kernel_d/CGAL/Kernel_d/Sphere_d.h     |  8 +-
 .../doc/Kernel_d/CGAL/Kernel_d/Vector_d.h     |  4 +-
 .../Matrix_search/CGAL/sorted_matrix_search.h |  2 +-
 .../CGAL/Polygon_convex_decomposition_2.h     |  8 +-
 .../CGAL/Polygon_vertical_decomposition_2.h   |  4 +-
 ...mall_side_angle_bisector_decomposition_2.h |  2 +-
 .../doc/Minkowski_sum_2/Minkowski_sum_2.txt   | 10 +--
 .../Minkowski_sum_2/AABB_tree_with_join.h     |  2 +-
 .../CGAL/Polygon_convex_decomposition_2.h     |  6 +-
 .../doc/Minkowski_sum_3/Minkowski_sum_3.txt   |  2 +-
 .../include/CGAL/minkowski_sum_3.h            |  2 +-
 Miscellany/doc/Miscellany/CGAL/Union_find.h   |  2 +-
 .../doc/Miscellany/CGAL/Unique_hash_map.h     |  2 +-
 Miscellany/doc/Miscellany/Miscellany.txt      |  4 +-
 Nef_2/doc/Nef_2/CGAL/Nef_polyhedron_2.h       |  6 +-
 Nef_S2/doc/Nef_S2/CGAL/Nef_polyhedron_S2.h    |  2 +-
 Orthtree/doc/Orthtree/Orthtree.txt            |  2 +-
 .../doc/Partition_2/CGAL/is_y_monotone_2.h    |  2 +-
 .../doc/Partition_2/CGAL/partition_2.h        | 10 +--
 .../Partition_2/CGAL/partition_is_valid_2.h   |  6 +-
 .../CGAL/polygon_function_objects.h           |  6 +-
 .../doc/Partition_2/PackageDescription.txt    | 10 +--
 Partition_2/doc/Partition_2/Partition_2.txt   |  8 +-
 .../Periodic_2_Delaunay_triangulation_2.h     | 10 +--
 .../CGAL/Periodic_2_triangulation_2.h         |  2 +-
 Polygon/include/CGAL/Polygon_2_algorithms.h   |  2 +-
 .../Polygon_mesh_processing.txt               |  4 +-
 QP_solver/doc/QP_solver/QP_solver.txt         |  2 +-
 .../STL_Extension/CGAL/Compact_container.h    |  6 +-
 .../CGAL/Concurrent_compact_container.h       |  6 +-
 .../doc/STL_Extension/CGAL/In_place_list.h    |  2 +-
 .../doc/STL_Extension/CGAL/Multiset.h         | 10 +--
 STL_Extension/include/CGAL/Multiset.h         | 74 +++++++++----------
 .../doc/SearchStructures/CGAL/Range_tree_d.h  |  6 +-
 .../SearchStructures/CGAL/Segment_tree_d.h    |  6 +-
 .../doc/SearchStructures/SearchStructures.txt | 14 ++--
 .../Segment_Delaunay_graph_2.txt              |  4 +-
 .../Set_movable_separability_2.txt            |  4 +-
 .../include/CGAL/Eigen_sparse_matrix.h        |  4 +-
 .../internal/K_means_clustering.h             |  4 +-
 .../Surface_mesh_shortest_path.txt            |  4 +-
 .../Surface_mesh_shortest_path.h              |  2 +-
 .../Surface_mesh_topology.txt                 |  4 +-
 .../doc/Surface_sweep_2/Surface_sweep_2.txt   |  6 +-
 .../doc/Triangulation/Triangulation.txt       |  8 +-
 .../CGAL/Delaunay_triangulation_2.h           | 12 +--
 .../Triangulation_2/CGAL/Triangulation_2.h    |  8 +-
 .../doc/Triangulation_2/Triangulation_2.txt   | 22 +++---
 .../CGAL/Delaunay_triangulation_3.h           |  4 +-
 .../doc/Triangulation_3/Triangulation_3.txt   |  2 +-
 .../CGAL/Rotational_sweep_visibility_2.h      |  4 +-
 .../CGAL/Simple_polygon_visibility_2.h        |  4 +-
 .../CGAL/Triangular_expansion_visibility_2.h  |  6 +-
 .../doc/Visibility_2/visibility_2.txt         |  8 +-
 106 files changed, 301 insertions(+), 297 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_tree.h b/AABB_tree/include/CGAL/AABB_tree.h
index 0016d4ecc097..ca68663308b2 100644
--- a/AABB_tree/include/CGAL/AABB_tree.h
+++ b/AABB_tree/include/CGAL/AABB_tree.h
@@ -143,7 +143,7 @@ namespace CGAL {
     /// An explicit call to `build()` must be made to ensure that the next call to
     /// a query function will not trigger the construction of the data structure.
     /// A call to `AABBTraits::set_shared_data(t...)` is made using the internally stored traits.
-    /// This procedure has a complexity of \f$O(n log(n))\f$, where \f$n\f$ is the number of
+    /// This procedure has a complexity of \cgalBigO{n log(n)}, where \f$n\f$ is the number of
     /// primitives of the tree.
     template<typename ... T>
     void build(T&& ...);
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_2.h
index 98dedd0f75b6..832be2b8d29e 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_2.h
@@ -80,7 +80,7 @@ use binary search.
 `Alpha_shape_2::number_of_solid_components()` performs a graph traversal and takes time
 linear in the number of faces of the underlying triangulation.
 `Alpha_shape_2::find_optimal_alpha()` uses binary search and takes time
-\f$ O(n \log n)\f$, where \f$ n\f$ is the number of points.
+\cgalBigO{n \log n}, where \f$ n\f$ is the number of points.
 
 */
 template< typename Dt, typename ExactAlphaComparisonTag >
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_3.h
index 70f1bec2182b..7136eed539b1 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_3.h
@@ -77,7 +77,7 @@ use binary search.
 `Alpha_shape_3::number_of_solid_components()` performs a graph traversal and takes time
 linear in the number of cells of the underlying triangulation.
 `Alpha_shape_3::find_optimal_alpha()` uses binary search and takes time
-\f$ O(n \log n)\f$, where \f$ n\f$ is the number of points.
+\cgalBigO{n \log n}, where \f$ n\f$ is the number of points.
 
 */
 template< typename Dt, typename ExactAlphaComparisonTag >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index 431083db107b..62571bfdee9b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -1223,10 +1223,10 @@ halfedge \f$e_{\mathrm{pred}}\f$ directed toward \f$v\f$, such that
 \f$c\f$ is located between the curves associated with
 \f$e_{\mathrm{pred}}\f$ and the next halfedge in the clockwise order
 in the circular list of halfedges around \f$v\f$; see
-\cgalFigureRef{aos_fig-insert}. This search may take \f$O(d)\f$ time,
+\cgalFigureRef{aos_fig-insert}. This search may take \cgalBigO{d} time,
 where \f$d\f$ is the degree of the vertex \f$v\f$. \cgalFootnote{We
 can store the handles to the halfedges incident to \f$v\f$ in an efficient
-search structure to obtain \f$O(\log d)\f$ access time. However, as
+search structure to obtain \cgalBigO{\log d} access time. However, as
 \f$d\f$ is usually very small, this may lead to a waste of storage
 space without a meaningful improvement in running time in practice.}
 However, if the halfedge \f$e_{\mathrm{pred}}\f$ is known in advance,
@@ -1488,9 +1488,9 @@ keep up-to-date as this arrangement changes.
 As mentioned above, the triangulation strategy is provided only for
 educational purposes, and thus we do not elaborate on this strategy.
 The data structure needed by the landmark and the trapezoidal map RIC
-strategies can be constructed in \f$O(N \log N)\f$ time, where \f$N\f$
+strategies can be constructed in \cgalBigO{N \log N} time, where \f$N\f$
 is the overall number of edges in the arrangement, but the constant
-hidden in the \f$O()\f$ notation for the trapezoidal map RIC strategy
+hidden in the \cgalBigO{&nbsp;} notation for the trapezoidal map RIC strategy
 is much larger. Thus, construction needed by the landmark algorithm is
 in practice significantly faster than the construction needed by the
 trapezoidal map RIC strategy. In addition, although both resulting
@@ -1647,7 +1647,7 @@ Section \ref arr_ssecpl. The output pairs are sorted in increasing
 \f$xy\f$-lexicographical order of the query point.
 
 The batched point-location operation is carried out by sweeping the
-arrangement. Thus, it takes \f$O((m+N)\log{(m+N)})\f$ time, where
+arrangement. Thus, it takes \cgalBigO{(m+N)\log{(m+N)}} time, where
 \f$N\f$ is the number of edges in the arrangement. Issuing separate
 queries exploiting a point-location strategy with logarithmic query
 time per query, such as the trapezoidal map RIC strategy (see Section
@@ -2037,11 +2037,11 @@ so it must be construct from scratch.
 
 In the first case, we sweep over the input curves, compute their
 intersection points, and construct the \dcel that represents their
-arrangement. This process is performed in \f$O\left((n + k)\log
-n\right)\f$ time, where \f$k\f$ is the total number of intersection
+arrangement. This process is performed in \cgalBigO{left((n + k)\log
+n\right} time, where \f$k\f$ is the total number of intersection
 points. The running time is asymptotically better than the time needed
 for incremental insertion if the arrangement is relatively sparse
-(when \f$k\f$ is \f$O(\frac{n^2}{\log n}\f$)), but it is recommended
+(when \f$k\f$ is \cgalBigO{\frac{n^2}{\log n}}), but it is recommended
 that this aggregate construction process be used even for dense
 arrangements, since the plane-sweep algorithm performs fewer geometric
 operations compared to the incremental insertion algorithms, and hence
@@ -4346,7 +4346,7 @@ a point with respect to an \f$x\f$-monotone polyline, we use binary
 search to locate the relevant segment that contains the point in its
 \f$x\f$-range. Then, we compute the position of the point with respect
 to this segment. Thus, operations on \f$x\f$-monotone polylines of
-size \f$m\f$ typically take \f$O(\log m)\f$ time.
+size \f$m\f$ typically take \cgalBigO{\log m} time.
 
 You are free to choose the underlying segment traits class. Your
 decision could be based, for example, on the number of expected
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h
index 0027ec53409c..e662503bee43 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h
@@ -12,9 +12,9 @@ Seidel \cgalCite{s-sfira-91} (see also [\cgalCite{bkos-cgaa-00} Chapter 6).
 It subdivides each arrangement face to pseudo-trapezoidal cells, each
 of constant complexity, and constructs and maintains a linear-size search
 structure on top of these cells, such that each query can be answered
-in \f$ O(\log n)\f$ time, where \f$ n\f$ is the complexity of the arrangement.
+in \cgalBigO{\log n} time, where \f$ n\f$ is the complexity of the arrangement.
 
-Constructing the search structures takes \f$ O(n \log n)\f$ expected time
+Constructing the search structures takes \cgalBigO{n \log n} expected time
 and may require a small number of rebuilds \cgalCite{hkh-iiplgtds-12}. Therefore
 attaching a trapezoidal point-location object to an existing arrangement
 may incur some overhead in running times. In addition, the point-location
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_basic_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_basic_traits_2.h
index 84c9cee01d97..c216a07bc9ca 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_basic_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_basic_traits_2.h
@@ -2419,7 +2419,7 @@ class Arr_polycurve_basic_traits_2 {
   /*! Obtain the index of the subcurve in the polycurve that contains the
    * point q in its x-range. The function performs a binary search, so if the
    * point q is in the x-range of the polycurve with n subcurves, the subcurve
-   * containing it can be located in O(log n) operations.
+   * containing it can be located in \cgalBigO{log n} operations.
    * \param cv The polycurve curve.
    * \param q The point.
    * \return An index i such that q is in the x-range of cv[i].
diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Barycentric_coordinates_2.txt b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Barycentric_coordinates_2.txt
index 72588aec4365..b3f13fcf8191 100644
--- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Barycentric_coordinates_2.txt
+++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Barycentric_coordinates_2.txt
@@ -451,10 +451,10 @@ To fix the problem, we modify the weights \f$w_i\f$ as
 </center>
 
 After the above normalization, this gives us the precise algorithm to compute Wachspress coordinates
-but with \f$O(n^2)\f$ performance only. The max speed \f$O(n)\f$ algorithm uses the standard
+but with \cgalBigO{n^2} performance only. The max speed \cgalBigO{n} algorithm uses the standard
 weights \f$w_i\f$. Note that mathematically this modification does not change the coordinates. One should
 be cautious when using the unnormalized Wachspress weights. In that case, you must choose the
-\f$O(n)\f$ type.
+\cgalBigO{n} type.
 
 It is known that for strictly convex polygons the denominator's zero set of the
 Wachspress coordinates (\f$W^{wp} = 0~\f$) is a curve, which (in many cases) lies quite
@@ -507,10 +507,10 @@ To fix the problem, similarly to the previous subsection, we modify the weights
 </center>
 
 After the above normalization, this yields the precise algorithm to compute discrete harmonic coordinates
-but with \f$O(n^2)\f$ performance only. The max speed \f$O(n)\f$ algorithm uses the standard
+but with \cgalBigO{n^2} performance only. The max speed \cgalBigO{n} algorithm uses the standard
 weights \f$w_i\f$. Again, mathematically this modification does not change the coordinates,
 one should be cautious when using the unnormalized discrete harmonic weights. In that case,
-you must choose the \f$O(n)\f$ type.
+you must choose the \cgalBigO{n} type.
 
 \b Warning: as for Wachspress coordinates, we do not recommend using discrete harmonic coordinates
 for exterior points, because the curve \f$W^{dh} = 0\f$ may have several components,
@@ -563,7 +563,7 @@ After the normalization of these weights as before
 \f$b_i = \frac{w_i}{W^{mv}}\qquad\f$ with \f$\qquad W^{mv} = \sum_{j=1}^n w_j\f$
 </center>
 
-we obtain the max precision \f$O(n^2)\f$ algorithm. The max speed \f$O(n)\f$ algorithm computes the
+we obtain the max precision \cgalBigO{n^2} algorithm. The max speed \cgalBigO{n} algorithm computes the
 weights \f$w_i\f$ using the pseudocode from <a href="https://www.inf.usi.ch/hormann/nsfworkshop/presentations/Hormann.pdf">here</a>.
 These weights
 
@@ -575,7 +575,7 @@ with \f$\qquad t_i = \frac{\text{det}(d_i, d_{i+1})}{r_ir_{i+1} + d_id_{i+1}}\f$
 are also normalized. Note that they are unstable if a query point is closer than \f$\approx 1.0e-10\f$
 to the polygon boundary, similarly to Wachspress and discrete harmonic coordinates and
 one should be cautious when using the unnormalized mean value weights. In that case, you must choose the
-\f$O(n)\f$ type.
+\cgalBigO{n} type.
 
 
 \anchor compute_hm_coord
@@ -654,17 +654,17 @@ The resulting timings for all closed-form coordinates can be found in the figure
 
 \cgalFigureBegin{analytic_timings, analytic_timings.png}
 Time in seconds to compute \f$n\f$ coordinate values for a polygon with \f$n\f$ vertices
-at 1 million query points with the max speed \f$O(n)\f$ algorithms (dashed) and
+at 1 million query points with the max speed \cgalBigO{n} algorithms (dashed) and
 the max precision \f$0(n^2)\f$ algorithms (solid) for Wachspress (blue), discrete
 harmonic (red), and mean value (green) coordinates.
 \cgalFigureEnd
 
-From the figure above we observe that the \f$O(n^2)\f$ algorithm is as fast
-as the \f$O(n)\f$ algorithm if we have a polygon with a small number of vertices.
+From the figure above we observe that the \cgalBigO{n^2} algorithm is as fast
+as the \cgalBigO{n} algorithm if we have a polygon with a small number of vertices.
 But as the number of vertices is increased, the linear algorithm outperforms the squared one,
 as expected. One of the reasons for this behavior is that for a small number of vertices
-the multiplications of \f$n-2\f$ elements inside the \f$O(n^2)\f$ algorithm take almost the
-same time as the corresponding divisions in the \f$O(n)\f$ algorithm. For a polygon with
+the multiplications of \f$n-2\f$ elements inside the \cgalBigO{n^2} algorithm take almost the
+same time as the corresponding divisions in the \cgalBigO{n} algorithm. For a polygon with
 many vertices, these multiplications are substantially slower.
 
 To benchmark harmonic coordinates, we used a MacBook Pro 2018 with 2.2 GHz Intel Core i7 processor (6 cores)
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d.h
index 33d006577bfc..856d1a169296 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d.h
@@ -119,7 +119,7 @@ We implement Khachyian's algorithm for rounding
 polytopes \cgalCite{cgal:k-rprnm-96}. Internally, we use
 `double`-arithmetic and (initially a single)
 Cholesky-decomposition. The algorithm's running time is
-\f$ {\cal O}(nd^2(\epsilon^{-1}+\ln d + \ln\ln(n)))\f$, where \f$ n=|P|\f$ and
+\cgalBigO{nd^2(\epsilon^{-1}+\ln d + \ln\ln(n))}, where \f$ n=|P|\f$ and
 \f$ 1+\epsilon\f$ is the desired approximation ratio.
 
 \cgalHeading{Example}
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h
index 8d360443390e..fbcd5f02e2dc 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h
@@ -76,7 +76,7 @@ We implement two algorithms, the LP-algorithm and a
 heuristic \cgalCite{msw-sblp-92}. As described in the documentation of
 concept `MinSphereOfSpheresTraits`, each has its advantages and
 disadvantages: Our implementation of the LP-algorithm has maximal
-expected running time \f$ O(2^d n)\f$, while the heuristic comes without
+expected running time \cgalBigO{2^d n}, while the heuristic comes without
 any complexity guarantee. In particular, the LP-algorithm runs in
 linear time for fixed dimension \f$ d\f$. (These running times hold for the
 arithmetic model, so they count the number of operations on
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/rectangular_p_center_2.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/rectangular_p_center_2.h
index f3baaa625f13..519b3eeb24fa 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/rectangular_p_center_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/rectangular_p_center_2.h
@@ -245,7 +245,7 @@ must be a model for `RectangularPCenterTraits_2`.
 \cgalHeading{Implementation}
 
 The runtime is linear for \f$ p \in \{2,\,3\}\f$ and
-\f$ \mathcal{O}(n \cdot \log n)\f$ for \f$ p = 4\f$ where \f$ n\f$ is the number of
+\cgalBigO{n \cdot \log n} for \f$ p = 4\f$ where \f$ n\f$ is the number of
 input points. These runtimes are worst case optimal. The \f$ 3\f$-center
 algorithm uses a prune-and-search technique described in
 \cgalCite{cgal:h-slacr-99}. The \f$ 4\f$-center implementation uses sorted matrix
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
index 49b32647f3c2..a1a0126cf9e8 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
@@ -79,7 +79,7 @@ The recommended choice is the first, which is a synonym to the one
 of the other two methods which we consider "the best in practice."
 In case of `CGAL::LP_algorithm`, the minsphere will be computed
 using the LP-algorithm \cgalCite{msw-sblp-92}, which in our
-implementation has maximal expected running time \f$ O(2^d n)\f$ (in the
+implementation has maximal expected running time \cgalBigO{2^d n} (in the
 number of operations on the number type `FT`). In case of
 `CGAL::Farthest_first_heuristic`, a simple heuristic will be
 used instead which seems to work fine in practice, but comes without
diff --git a/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt b/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt
index 64cead025327..2dcd2db8d30e 100644
--- a/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt
+++ b/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt
@@ -350,12 +350,12 @@ parameter the function switches from the streamed segment-tree
 algorithm to the two-way-scan algorithm, see \cgalCite{cgal:ze-fsbi-02}
 for the details.
 
-The streamed segment-tree algorithm needs \f$ O(n \log^d (n) + k)\f$
-worst-case running time and \f$ O(n)\f$ space, where \f$ n\f$ is the number of
+The streamed segment-tree algorithm needs \cgalBigO{n \log^d (n) + k}
+worst-case running time and \cgalBigO{n} space, where \f$ n\f$ is the number of
 boxes in both input sequences, \f$ d\f$ the (constant) dimension of the
 boxes, and \f$ k\f$ the output complexity, i.e., the number of pairwise
-intersections of the boxes. The two-way-scan algorithm needs \f$ O(n \log
-(n) + l)\f$ worst-case running time and \f$ O(n)\f$ space, where \f$ l\f$ is the
+intersections of the boxes. The two-way-scan algorithm needs \cgalBigO{n \log
+(n) + l} worst-case running time and \cgalBigO{n} space, where \f$ l\f$ is the
 number of pairwise overlapping intervals in one dimensions (the
 dimension where the algorithm is used instead of the segment tree).
 Note that \f$ l\f$ is not necessarily related to \f$ k\f$ and using the
diff --git a/Box_intersection_d/doc/Box_intersection_d/CGAL/box_intersection_d.h b/Box_intersection_d/doc/Box_intersection_d/CGAL/box_intersection_d.h
index f9ec7ba1ae13..0f7fd9bccdd1 100644
--- a/Box_intersection_d/doc/Box_intersection_d/CGAL/box_intersection_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/CGAL/box_intersection_d.h
@@ -77,7 +77,7 @@ namespace CGAL {
 \cgalHeading{Implementation}
 
   The algorithm is trivially testing all pairs and runs therefore in time
-  \f$ O(nm)\f$ where \f$ n\f$ is the size of the first sequence and \f$ m\f$ is the
+  \cgalBigO{nm} where \f$ n\f$ is the size of the first sequence and \f$ m\f$ is the
   size of the second sequence.
 */
 
@@ -219,12 +219,12 @@ void box_intersection_all_pairs_d(
   algorithm to the two-way-scan algorithm, see \cgalCite{cgal:ze-fsbi-02}
   for the details.
 
-  The streamed segment-tree algorithm needs \f$ O(n \log^d (n) + k)\f$
-  worst-case running time and \f$ O(n)\f$ space, where \f$ n\f$ is the number of
+  The streamed segment-tree algorithm needs \cgalBigO{n \log^d (n) + k}
+  worst-case running time and \cgalBigO{n} space, where \f$ n\f$ is the number of
   boxes in both input sequences, \f$ d\f$ the (constant) dimension of the
   boxes, and \f$ k\f$ the output complexity, i.e., the number of pairwise
-  intersections of the boxes. The two-way-scan algorithm needs \f$ O(n \log
-  (n) + l)\f$ worst-case running time and \f$ O(n)\f$ space, where \f$ l\f$ is the
+  intersections of the boxes. The two-way-scan algorithm needs \cgalBigO{n \log
+  (n) + l} worst-case running time and \cgalBigO{n} space, where \f$ l\f$ is the
   number of pairwise overlapping intervals in one dimensions (the
   dimension where the algorithm is used instead of the segment tree).
   Note that \f$ l\f$ is not necessarily related to \f$ k\f$ and using the
@@ -397,7 +397,7 @@ namespace CGAL {
 \cgalHeading{Implementation}
 
   The algorithm is trivially testing all pairs and runs therefore in time
-  \f$ O(n^2)\f$ where \f$ n\f$ is the size of the input sequence. This algorithm
+  \cgalBigO{n^2} where \f$ n\f$ is the size of the input sequence. This algorithm
   does not use the id-number of the boxes.
 
 */
diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
index 2e36037ea231..5a17500431d8 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
@@ -297,7 +297,7 @@ Several functions allow to create specific configurations of darts into a combin
 
 \subsection ssecadvmarks Boolean Marks
 
-It is often necessary to mark darts, for example to retrieve in <I>O(1)</I> if a given dart was already processed during a specific algorithm, for example,  iteration over a given range. Users can also mark specific parts of a combinatorial map (for example mark all the darts belonging to objects having specific semantics). To answer these needs, a `GenericMap` has a certain number of Boolean marks (fixed by the constant \link GenericMap::NB_MARKS `NB_MARKS`\endlink). When one wants to use a Boolean mark, the following methods are available (with `cm` an instance of a combinatorial map):
+It is often necessary to mark darts, for example to retrieve in \cgalBigO{1} if a given dart was already processed during a specific algorithm, for example,  iteration over a given range. Users can also mark specific parts of a combinatorial map (for example mark all the darts belonging to objects having specific semantics). To answer these needs, a `GenericMap` has a certain number of Boolean marks (fixed by the constant \link GenericMap::NB_MARKS `NB_MARKS`\endlink). When one wants to use a Boolean mark, the following methods are available (with `cm` an instance of a combinatorial map):
 <ul>
 <li> get a new free mark: `size_type m = cm.`\link GenericMap::get_new_mark `get_new_mark()`\endlink (throws the exception Exception_no_more_available_mark if no mark is available);
 <li> set mark `m` for a given dart `d0`: `cm.`\link GenericMap::mark `mark(d0,m)`\endlink;
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map.h b/Combinatorial_map/include/CGAL/Combinatorial_map.h
index e2145afb1f3c..2141b6e1ab4f 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map.h
@@ -1154,7 +1154,7 @@ namespace CGAL {
     }
 
     /** Unmark all the darts of the map for a given mark.
-     * If all the darts are marked or unmarked, this operation takes O(1)
+     * If all the darts are marked or unmarked, this operation takes \cgalBigO{1}
      * operations, otherwise it traverses all the darts of the map.
      * @param amark the given mark.
      */
diff --git a/Cone_spanners_2/doc/Cone_spanners_2/Cone_spanners_2.txt b/Cone_spanners_2/doc/Cone_spanners_2/Cone_spanners_2.txt
index 8de2f97693de..d21ef3f1aca8 100644
--- a/Cone_spanners_2/doc/Cone_spanners_2/Cone_spanners_2.txt
+++ b/Cone_spanners_2/doc/Cone_spanners_2/Cone_spanners_2.txt
@@ -160,7 +160,7 @@ In constructing Theta graphs, this functor uses the algorithm from
 Chapter 4 of the book by Narasimhan and Smid \cgalCite{cgal:ns-gsn-07}.
 Basically, it is a sweep line algorithm and uses a
 balanced search tree to store the vertices that have already been scanned.
-It has the complexity of \f$O(n \log n)\f$, where \f$n\f$ is the number of vertices in the plane.
+It has the complexity of \cgalBigO{n \log n}, where \f$n\f$ is the number of vertices in the plane.
 This complexity has been proved to be optimal.
 
 For more details on how to use this `Construct_theta_graph_2` functor to write an application to build Theta graphs,
@@ -178,13 +178,13 @@ The functor `Construct_yao_graph_2` has a similar definition as `Construct_theta
 
 The way of using these two template parameters is the same as that of `Construct_theta_graph_2`,
 so please refer to the previous subsection for the details. We note here that construction algorithm for Yao graph
-is a slight adaptation of the algorithm for constructing Theta graph, having a complexity of \f$O(n^2)\f$.
+is a slight adaptation of the algorithm for constructing Theta graph, having a complexity of \cgalBigO{n^2}.
 The increase of complexity in this adaptation is because in constructing Theta graph,
 the searching of the 'closest' node by projection distance can be done by a balanced search tree,
 but in constructing Yao graph, the searching of the 'closest' node by Euclidean distance cannot be
 done by a balanced search tree.
 
-Note that an optimal algorithm for constructing Yao graph with a complexity of \f$O(n \log n)\f$ is
+Note that an optimal algorithm for constructing Yao graph with a complexity of \cgalBigO{n \log n} is
 described in \cgalCite{cgal:cht-oacov-90}. However, this algorithm is much more complex to implement than
 the current algorithm implemented, and it can hardly reuse the codes for constructing Theta graphs,
 so it is not implemented in this package right now.
diff --git a/Convex_decomposition_3/doc/Convex_decomposition_3/Convex_decomposition_3.txt b/Convex_decomposition_3/doc/Convex_decomposition_3/Convex_decomposition_3.txt
index 6720620e075a..98f1e2e2d6a1 100644
--- a/Convex_decomposition_3/doc/Convex_decomposition_3/Convex_decomposition_3.txt
+++ b/Convex_decomposition_3/doc/Convex_decomposition_3/Convex_decomposition_3.txt
@@ -18,11 +18,11 @@ Minkowski sums of the convex pieces, and unite the pair-wise sums.
 
 While it is desirable to have a decomposition into a minimum number of
 pieces, this problem is known to be NP-hard \cgalCite{c-cpplb-84}. Our
-implementation decomposes a Nef polyhedron \f$ N\f$ into \f$ O(r^2)\f$ convex
+implementation decomposes a Nef polyhedron \f$ N\f$ into \cgalBigO{r^2} convex
 pieces, where \f$ r\f$ is the number of edges that have two adjacent
 facets that span an angle of more than 180 degrees with respect to the
 interior of the polyhedron. Those edges are also called reflex edges.
-The bound of \f$ O(r^2)\f$ convex pieces is worst-case
+The bound of \cgalBigO{r^2} convex pieces is worst-case
 optimal \cgalCite{c-cpplb-84}.
 
 \cgalFigureBegin{figverticalDecomposition,two_cubes_all_in_one.png}
diff --git a/Convex_decomposition_3/doc/Convex_decomposition_3/PackageDescription.txt b/Convex_decomposition_3/doc/Convex_decomposition_3/PackageDescription.txt
index 8d49a1ce844a..4d65e689fade 100644
--- a/Convex_decomposition_3/doc/Convex_decomposition_3/PackageDescription.txt
+++ b/Convex_decomposition_3/doc/Convex_decomposition_3/PackageDescription.txt
@@ -6,7 +6,7 @@
 \cgalPkgPicture{Convex_decomposition_3/fig/Convex_decomposition_3-teaser.png}
 \cgalPkgSummaryBegin
 \cgalPkgAuthor{Peter Hachenberger}
-\cgalPkgDesc{This packages provides a function for decomposing a bounded polyhedron into convex sub-polyhedra. The decomposition yields \f$ O(r^2)\f$ convex pieces, where \f$ r\f$ is the number of edges, whose adjacent facets form an angle of more than 180 degrees with respect to the polyhedron's interior. This bound is worst-case optimal. }
+\cgalPkgDesc{This packages provides a function for decomposing a bounded polyhedron into convex sub-polyhedra. The decomposition yields \cgalBigO{r^2} convex pieces, where \f$ r\f$ is the number of edges, whose adjacent facets form an angle of more than 180 degrees with respect to the polyhedron's interior. This bound is worst-case optimal. }
 \cgalPkgManuals{Chapter_Convex_Decomposition_of_Polyhedra,PkgConvexDecomposition3Ref}
 \cgalPkgSummaryEnd
 \cgalPkgShortInfoBegin
diff --git a/Convex_decomposition_3/include/CGAL/convex_decomposition_3.h b/Convex_decomposition_3/include/CGAL/convex_decomposition_3.h
index 7993309d4d09..08d6750b7fb7 100644
--- a/Convex_decomposition_3/include/CGAL/convex_decomposition_3.h
+++ b/Convex_decomposition_3/include/CGAL/convex_decomposition_3.h
@@ -41,12 +41,12 @@ The function `convex_decomposition_3()` inserts additional facets
 into the given `Nef_polyhedron_3` `N`, such that each bounded
 marked volume (the outer volume is unbounded) is subdivided into convex
 pieces. The modified polyhedron represents a decomposition into
-\f$ O(r^2)\f$ convex pieces, where \f$ r\f$ is the number of edges that have two
+\cgalBigO{r^2} convex pieces, where \f$ r\f$ is the number of edges that have two
 adjacent facets that span an angle of more than 180 degrees with
 respect to the interior of the polyhedron.
 
 The worst-case running time of our implementation is
-\f$ O(n^2r^4\sqrt[3]{nr^2}\log{(nr)})\f$, where \f$ n\f$ is the complexity of
+\cgalBigO{n^2r^4\sqrt[3]{nr^2}\log{(nr)}}, where \f$ n\f$ is the complexity of
 the polyhedron (the complexity of a `Nef_polyhedron_3` is the sum
 of its `Vertices`, `Halfedges` and `SHalfedges`) and \f$ r\f$
 is the number of reflex edges.
diff --git a/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_akl_toussaint.h b/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_akl_toussaint.h
index 4df696cd96e2..1b22a5588685 100644
--- a/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_akl_toussaint.h
+++ b/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_akl_toussaint.h
@@ -44,7 +44,7 @@ functions that return instances of these types:
 \cgalHeading{Implementation}
 
 This function uses the algorithm of Akl and
-Toussaint \cgalCite{at-fcha-78} that requires \f$ O(n \log n)\f$ time for \f$ n\f$ input
+Toussaint \cgalCite{at-fcha-78} that requires \cgalBigO{n \log n} time for \f$ n\f$ input
 points.
 
 
diff --git a/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_bykat.h b/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_bykat.h
index 03ca58755185..6bf670ff5aca 100644
--- a/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_bykat.h
+++ b/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_bykat.h
@@ -45,7 +45,7 @@ functions that return instances of these types:
 
 This function implements the non-recursive variation of
 Eddy's algorithm \cgalCite{e-nchap-77} described in \cgalCite{b-chfsp-78}.
-This algorithm requires \f$ O(n h)\f$ time
+This algorithm requires \cgalBigO{n h} time
 in the worst case for \f$ n\f$ input points with \f$ h\f$ extreme points.
 */
 template <class InputIterator, class OutputIterator, class Traits>
diff --git a/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_eddy.h b/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_eddy.h
index 9a023d340702..836366e0b90c 100644
--- a/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_eddy.h
+++ b/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_eddy.h
@@ -47,7 +47,7 @@ This function implements Eddy's algorithm
 \cgalCite{e-nchap-77}, which is the two-dimensional version of the quickhull
 algorithm \cgalCite{bdh-qach-96}.
 
-This algorithm requires \f$ O(n h)\f$ time
+This algorithm requires \cgalBigO{n h} time
 in the worst case for \f$ n\f$ input points with \f$ h\f$ extreme points.
 
 */
diff --git a/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_graham_andrew.h b/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_graham_andrew.h
index 20119b4243b7..f2225a2fd338 100644
--- a/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_graham_andrew.h
+++ b/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_graham_andrew.h
@@ -44,7 +44,7 @@ functions that return instances of these types:
 
 This function implements Andrew's variant of the Graham
 scan algorithm \cgalCite{a-aeach-79} and follows the presentation of Mehlhorn
-\cgalCite{m-mdscg-84}. This algorithm requires \f$ O(n \log n)\f$ time
+\cgalCite{m-mdscg-84}. This algorithm requires \cgalBigO{n \log n} time
 in the worst case for \f$ n\f$ input points.
 
 
@@ -101,7 +101,7 @@ functions that return instances of these types:
 
 \cgalHeading{Implementation}
 
-This algorithm requires \f$ O(n)\f$ time in the worst case for
+This algorithm requires \cgalBigO{n} time in the worst case for
 \f$ n\f$ input points.
 
 \cgalHeading{Example}
diff --git a/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_jarvis.h b/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_jarvis.h
index 41478fb06f93..e3ad2818c2f4 100644
--- a/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_jarvis.h
+++ b/Convex_hull_2/doc/Convex_hull_2/CGAL/ch_jarvis.h
@@ -44,7 +44,7 @@ functions that return instances of these types:
 \cgalHeading{Implementation}
 
 This function uses the Jarvis march (gift-wrapping)
-algorithm \cgalCite{j-ichfs-73}. This algorithm requires \f$ O(n h)\f$ time
+algorithm \cgalCite{j-ichfs-73}. This algorithm requires \cgalBigO{n h} time
 in the worst case for \f$ n\f$ input points with \f$ h\f$ extreme points.
 
 */
@@ -97,7 +97,7 @@ functions that return instances of these types:
 \cgalHeading{Implementation}
 
 The function uses the Jarvis march (gift-wrapping) algorithm \cgalCite{j-ichfs-73}.
-This algorithm requires \f$ O(n h)\f$ time in the worst
+This algorithm requires \cgalBigO{n h} time in the worst
 case for \f$ n\f$ input points with \f$ h\f$ extreme points
 
 \pre `start_p` and `stop_p` are extreme points with respect to
diff --git a/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_2.h b/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_2.h
index 0e54242c874c..20a14e030eb3 100644
--- a/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_2.h
+++ b/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_2.h
@@ -47,9 +47,9 @@ functions that return instances of these types:
 One of two algorithms is used,
 depending on the type of iterator used to specify the input points. For
 input iterators, the algorithm used is that of Bykat \cgalCite{b-chfsp-78}, which
-has a worst-case running time of \f$ O(n h)\f$, where \f$ n\f$ is the number of input
+has a worst-case running time of \cgalBigO{n h}, where \f$ n\f$ is the number of input
 points and \f$ h\f$ is the number of extreme points. For all other types of
-iterators, the \f$ O(n \log n)\f$ algorithm of of Akl and Toussaint
+iterators, the \cgalBigO{n \log n} algorithm of of Akl and Toussaint
 \cgalCite{at-fcha-78} is used.
 
 
@@ -128,7 +128,7 @@ functions that return instances of these types:
 
 This function uses Andrew's variant of Graham's scan algorithm
 \cgalCite{a-aeach-79}, \cgalCite{m-mdscg-84}. The algorithm has worst-case running time
-of \f$ O(n \log n)\f$ for \f$ n\f$ input points.
+of \cgalBigO{n \log n} for \f$ n\f$ input points.
 
 
 */
@@ -192,7 +192,7 @@ functions that return instances of these types:
 
 This function uses Andrew's
 variant of Graham's scan algorithm \cgalCite{a-aeach-79}, \cgalCite{m-mdscg-84}. The algorithm
-has worst-case running time of \f$ O(n \log n)\f$ for \f$ n\f$ input points.
+has worst-case running time of \cgalBigO{n \log n} for \f$ n\f$ input points.
 
 */
 template <class InputIterator, class OutputIterator>
diff --git a/Convex_hull_2/doc/Convex_hull_2/CGAL/convexity_check_2.h b/Convex_hull_2/doc/Convex_hull_2/CGAL/convexity_check_2.h
index ae033c8acea5..002cd7f66dea 100644
--- a/Convex_hull_2/doc/Convex_hull_2/CGAL/convexity_check_2.h
+++ b/Convex_hull_2/doc/Convex_hull_2/CGAL/convexity_check_2.h
@@ -32,7 +32,7 @@ functions that return instances of these types:
 
 \cgalHeading{Implementation}
 
-The algorithm requires \f$ O(n)\f$ time for a set of \f$ n\f$ input points.
+The algorithm requires \cgalBigO{n} time for a set of \f$ n\f$ input points.
 
 
 
@@ -80,7 +80,7 @@ functions that return instances of these types:
 
 \cgalHeading{Implementation}
 
-The algorithm requires \f$ O(n)\f$ time for a set of \f$ n\f$ input points.
+The algorithm requires \cgalBigO{n} time for a set of \f$ n\f$ input points.
 
 
 
diff --git a/Convex_hull_2/doc/Convex_hull_2/Convex_hull_2.txt b/Convex_hull_2/doc/Convex_hull_2/Convex_hull_2.txt
index bca9d0f275f2..c07ebc8a8a4b 100644
--- a/Convex_hull_2/doc/Convex_hull_2/Convex_hull_2.txt
+++ b/Convex_hull_2/doc/Convex_hull_2/Convex_hull_2.txt
@@ -52,17 +52,17 @@ class need not be specified and defaults to types and operations defined
 in the kernel in which the input point type is defined.
 
 Given a sequence of \f$ n\f$ input points with \f$ h\f$ extreme points,
-the function `convex_hull_2()` uses either the output-sensitive \f$ O(n h)\f$ algorithm of Bykat \cgalCite{b-chfsp-78}
-(a non-recursive version of the quickhull \cgalCite{bdh-qach-96} algorithm) or the algorithm of Akl and Toussaint, which requires \f$ O(n \log n)\f$ time
+the function `convex_hull_2()` uses either the output-sensitive \cgalBigO{n h} algorithm of Bykat \cgalCite{b-chfsp-78}
+(a non-recursive version of the quickhull \cgalCite{bdh-qach-96} algorithm) or the algorithm of Akl and Toussaint, which requires \cgalBigO{n \log n} time
 in the worst case. The algorithm chosen depends on the kind of
 iterator used to specify the input points. These two algorithms are
 also available via the functions `ch_bykat()` and `ch_akl_toussaint()`,
 respectively. Also available are
-the \f$ O(n \log n)\f$ Graham-Andrew scan algorithm \cgalCite{a-aeach-79}, \cgalCite{m-mdscg-84}
+the \cgalBigO{n \log n} Graham-Andrew scan algorithm \cgalCite{a-aeach-79}, \cgalCite{m-mdscg-84}
 (`ch_graham_andrew()`),
-the \f$ O(n h)\f$ Jarvis march algorithm \cgalCite{j-ichfs-73}
+the \cgalBigO{n h} Jarvis march algorithm \cgalCite{j-ichfs-73}
 (`ch_jarvis()`),
-and Eddy's \f$ O(n h)\f$ algorithm \cgalCite{e-nchap-77}
+and Eddy's \cgalBigO{n h} algorithm \cgalCite{e-nchap-77}
 (`ch_eddy()`), which corresponds to the
 two-dimensional version of the quickhull algorithm.
 The linear-time algorithm of Melkman for producing the convex hull of
@@ -105,7 +105,7 @@ provide the computation of the counterclockwise
 sequence of extreme points on the lower hull and upper hull,
 respectively. The algorithm used in these functions is
 Andrew's variant of Graham's scan algorithm \cgalCite{a-aeach-79}, \cgalCite{m-mdscg-84},
-which has worst-case running time of \f$ O(n \log n)\f$.
+which has worst-case running time of \cgalBigO{n \log n}.
 
 There are also functions available for computing certain subsequences
 of the sequence of extreme points on the convex hull. The function
diff --git a/Convex_hull_3/doc/Convex_hull_3/CGAL/convexity_check_3.h b/Convex_hull_3/doc/Convex_hull_3/CGAL/convexity_check_3.h
index 7c51293eb3fd..cd5e70c7b459 100644
--- a/Convex_hull_3/doc/Convex_hull_3/CGAL/convexity_check_3.h
+++ b/Convex_hull_3/doc/Convex_hull_3/CGAL/convexity_check_3.h
@@ -16,7 +16,7 @@ vertices of the convex hull).
 \cgalHeading{Implementation}
 
 This function implements the tests described in \cgalCite{mnssssu-cgpvg-96} to
-determine convexity and requires \f$ O(e + f)\f$ time for a polyhedron with
+determine convexity and requires \cgalBigO{e + f} time for a polyhedron with
 \f$ e\f$ edges and \f$ f\f$ faces.
 
 
diff --git a/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d.h b/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d.h
index aef8523a7d74..aa1d645b3457 100644
--- a/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d.h
+++ b/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d.h
@@ -69,7 +69,7 @@ The time and space requirements are input dependent. Let \f$C_1\f$, \f$C_2\f$, \
 let \f$ k_i\f$ be the number of facets of \f$ C_i\f$ that are visible from \f$ x\f$
 and that are not already facets of \f$ C_{i-1}\f$.
 
-Then the time for inserting \f$ x\f$ is \f$ O(dim \sum_i k_i)\f$ and
+Then the time for inserting \f$ x\f$ is \cgalBigO{dim \sum_i k_i} and
 the number of new simplices constructed during the insertion of \f$x\f$
 is the number of facets of the hull which were not already facets
 of the hull before the insertion.
diff --git a/Documentation/doc/Documentation/Developer_manual/Chapter_intro.txt b/Documentation/doc/Documentation/Developer_manual/Chapter_intro.txt
index ef2ae5bd2767..0f7d11e3f818 100644
--- a/Documentation/doc/Documentation/Developer_manual/Chapter_intro.txt
+++ b/Documentation/doc/Documentation/Developer_manual/Chapter_intro.txt
@@ -169,7 +169,7 @@ complexity are known. Also, the theoretic interest in efficiency for
 realistic inputs, as opposed to worst-case situations, is
 growing \cgalCite{v-ffrim-97}.
 For practical purposes, insight into the constant factors hidden in the
-\f$ O\f$-notation is necessary, especially if there are several competing
+\cgalBigO{&nbsp;}-notation is necessary, especially if there are several competing
 algorithms.
 
 Therefore, different implementations should be supplied if there is
diff --git a/Documentation/doc/Documentation/Developer_manual/Chapter_kernels.txt b/Documentation/doc/Documentation/Developer_manual/Chapter_kernels.txt
index 30b566871430..78706045ef77 100644
--- a/Documentation/doc/Documentation/Developer_manual/Chapter_kernels.txt
+++ b/Documentation/doc/Documentation/Developer_manual/Chapter_kernels.txt
@@ -7,7 +7,7 @@
 \authors Stefan Schirra
 
 The layer of geometry kernels provides
-basic geometric entities of constant size\cgalFootnote{In dimension \f$ d\f$, an entity of size \f$ O(d)\f$ is considered to be of constant size.} and
+basic geometric entities of constant size\cgalFootnote{In dimension \f$ d\f$, an entity of size \cgalBigO{d} is considered to be of constant size.} and
 primitive operations on them. Each entity is provided as both a
 stand-alone class, which is parameterized by a kernel class, and as a
 type in the kernel class. Each operation in the kernel is provided via
diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index ae2cc84f6c17..94bf21fa2bd5 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -188,7 +188,9 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalParamNEnd=</ul> \htmlonly[block] </div> \endhtmlonly </td><td></td></tr>" \
                          "cgalParamSectionBegin{1}=\cgalParamNBegin{\1}" \
                          "cgalParamSectionEnd=\cgalParamNEnd" \
-                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>"
+                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>" \
+                         "cgalBigO{1}=\f$O(\1)\f$" \
+                         "cgalBigOLarge{1}=\f$O\left(\1\right)\f$"
 
 # Doxygen selects the parser to use depending on the extension of the files it
 # parses. With this tag you can assign which parser to use for a given
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index 1cfd0a6ffd9f..7cda561372e5 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -197,7 +197,9 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalParamNEnd=</ul> \htmlonly[block] </div> \endhtmlonly </td><td></td></tr>" \
                          "cgalParamSectionBegin{1}=\cgalParamNBegin{\1}" \
                          "cgalParamSectionEnd=\cgalParamNEnd" \
-                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>"
+                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>" \
+                         "cgalBigO{1}=\f$O(\1)\f$" \
+                         "cgalBigOLarge{1}=\f$O\left(\1\right)\f$"
 
 # Doxygen selects the parser to use depending on the extension of the files it
 # parses. With this tag you can assign which parser to use for a given
diff --git a/Generalized_map/doc/Generalized_map/Generalized_map.txt b/Generalized_map/doc/Generalized_map/Generalized_map.txt
index 491a8c9ed3d3..f2c811e33b6f 100644
--- a/Generalized_map/doc/Generalized_map/Generalized_map.txt
+++ b/Generalized_map/doc/Generalized_map/Generalized_map.txt
@@ -296,7 +296,7 @@ Several functions allow to create specific configurations of darts into a genera
 
 \subsection ssecadvmarksgmap Boolean Marks
 
-It is often necessary to mark darts, for example to retrieve in <I>O(1)</I> if a given dart was already processed during a specific algorithm, for example,  iteration over a given range. Users can also mark specific parts of a generalized map (for example mark all the darts belonging to objects having specific semantics). To answer these needs, a `GeneralizedMap` has a certain number of Boolean marks (fixed by the constant \link GenericMap::NB_MARKS `NB_MARKS`\endlink). When one wants to use a Boolean mark, the following methods are available (with `gm` an instance of a generalized map):
+It is often necessary to mark darts, for example to retrieve in \cgalBigO{1} if a given dart was already processed during a specific algorithm, for example,  iteration over a given range. Users can also mark specific parts of a generalized map (for example mark all the darts belonging to objects having specific semantics). To answer these needs, a `GeneralizedMap` has a certain number of Boolean marks (fixed by the constant \link GenericMap::NB_MARKS `NB_MARKS`\endlink). When one wants to use a Boolean mark, the following methods are available (with `gm` an instance of a generalized map):
 <ul>
 <li> get a new free mark: `size_type m = gm.`\link GenericMap::get_new_mark `get_new_mark()`\endlink (throws the exception Exception_no_more_available_mark if no mark is available);
 <li> set mark `m` for a given dart `d0`: `gm.`\link GenericMap::mark `mark(d0,m)`\endlink;
diff --git a/Generalized_map/include/CGAL/Generalized_map.h b/Generalized_map/include/CGAL/Generalized_map.h
index d7f75bd151ac..e6daae4eb733 100644
--- a/Generalized_map/include/CGAL/Generalized_map.h
+++ b/Generalized_map/include/CGAL/Generalized_map.h
@@ -1038,7 +1038,7 @@ namespace CGAL {
     }
 
     /** Unmark all the darts of the map for a given mark.
-     * If all the darts are marked or unmarked, this operation takes O(1)
+     * If all the darts are marked or unmarked, this operation takes \cgalBigO{1}
      * operations, otherwise it traverses all the darts of the map.
      * @param amark the given mark.
      */
diff --git a/Generator/doc/Generator/CGAL/random_convex_hull_in_disc_2.h b/Generator/doc/Generator/CGAL/random_convex_hull_in_disc_2.h
index 6526a99c3778..fb72a01f99a1 100644
--- a/Generator/doc/Generator/CGAL/random_convex_hull_in_disc_2.h
+++ b/Generator/doc/Generator/CGAL/random_convex_hull_in_disc_2.h
@@ -28,8 +28,8 @@ The generated polygon will have an average number of vertices \f$ n^\frac{1}{3}(
 
 The implementation is based on an incremental construction of a convex hull. At each step, we choose a number of points to pick uniformly at random in the disc. Then, a subset of these points, that won't change the convex hull, is evaluated using a Binomial law.
 As these points won't be generated, the time and size complexities are reduced \cgalCite{Devillers2014Generator}.
-A tradeoff between time and memory is provided with the option `fast`, true by default. Using the `fast` option, both time and size expected complexities are \f$O\left(n^\frac{1}{3}\log^\frac{2}{3}n \right)\f$.
- If this option is disabled, the expected size complexity becomes \f$O\left(n^\frac{1}{3}\right)\f$ but the expected time complexity becomes \f$O\left(n^\frac{1}{3}\log^2 n \right)\f$.
+A tradeoff between time and memory is provided with the option `fast`, true by default. Using the `fast` option, both time and size expected complexities are \cgalBigOLarge{n^\frac{1}{3}\log^\frac{2}{3}n}.
+ If this option is disabled, the expected size complexity becomes \cgalBigOLarge{n^\frac{1}{3}} but the expected time complexity becomes \cgalBigOLarge{n^\frac{1}{3}\log^2 n}.
 
 \cgalHeading{Example}
 
diff --git a/Generator/doc/Generator/CGAL/random_convex_set_2.h b/Generator/doc/Generator/CGAL/random_convex_set_2.h
index 41f8613bc65a..7d60fc29664f 100644
--- a/Generator/doc/Generator/CGAL/random_convex_set_2.h
+++ b/Generator/doc/Generator/CGAL/random_convex_set_2.h
@@ -31,8 +31,8 @@ R >` for some representation class `R`,
 \cgalHeading{Implementation}
 
 The implementation uses the centroid method
-described in \cgalCite{cgal:s-zkm-96} and has a worst case running time of \f$ O(r
-\cdot n + n \cdot \log n)\f$, where \f$ r\f$ is the time needed by `pg`
+described in \cgalCite{cgal:s-zkm-96} and has a worst case running time of \cgalBigO{r
+\cdot n + n \cdot \log n}, where \f$ r\f$ is the time needed by `pg`
 to generate a random point.
 
 \cgalHeading{Example}
diff --git a/Generator/doc/Generator/CGAL/random_polygon_2.h b/Generator/doc/Generator/CGAL/random_polygon_2.h
index 6025350bb990..e42970739660 100644
--- a/Generator/doc/Generator/CGAL/random_polygon_2.h
+++ b/Generator/doc/Generator/CGAL/random_polygon_2.h
@@ -37,11 +37,11 @@ The default traits class `Default_traits` is the kernel in which
 The implementation is based on the method of eliminating self-intersections in
 a polygon by using so-called "2-opt" moves. Such a move eliminates an
 intersection between two edges by reversing the order of the vertices between
-the edges. No more than \f$ O(n^3)\f$ such moves are required to simplify a polygon
+the edges. No more than \cgalBigO{n^3} such moves are required to simplify a polygon
 defined on \f$ n\f$ points \cgalCite{ls-utstp-82}.
 Intersecting edges are detected using a simple sweep through the vertices
 and then one intersection is chosen at random to eliminate after each sweep.
-The worse-case running time is therefore \f$ O(n^4 \log n)\f$.
+The worse-case running time is therefore \cgalBigO{n^4 \log n}.
 
 \cgalHeading{Example}
 
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h
index 5d620b9aba36..5f3c33fc739d 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h
@@ -24,7 +24,7 @@ removal.
 \cgalHeading{Implementation}
 
 Currently, `HalfedgeDS_default` is derived from `CGAL::HalfedgeDS_list<Traits>`.
-The copy constructor and the assignment operator need \f$ O(n)\f$ time with
+The copy constructor and the assignment operator need \cgalBigO{n} time with
 \f$ n\f$ the total number of vertices, halfedges, and faces.
 
 */
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h
index 66407bbf6dd3..34dce0c1363b 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h
@@ -20,7 +20,7 @@ iterators that supports removal.
 \cgalHeading{Implementation}
 
 `HalfedgeDS_list` uses internally the `CGAL::In_place_list` container class.
-The copy constructor and the assignment operator need \f$ O(n)\f$ time with
+The copy constructor and the assignment operator need \cgalBigO{n} time with
 \f$ n\f$ the total number of vertices, halfedges, and faces.
 
 `CGAL_ALLOCATOR(int)` is used as default argument for the
diff --git a/Heat_method_3/doc/Heat_method_3/Heat_method_3.txt b/Heat_method_3/doc/Heat_method_3/Heat_method_3.txt
index 7d747c2a328c..82ad37d2d41b 100644
--- a/Heat_method_3/doc/Heat_method_3/Heat_method_3.txt
+++ b/Heat_method_3/doc/Heat_method_3/Heat_method_3.txt
@@ -223,8 +223,8 @@ The algorithm is as follows:
 
 The time complexity of the algorithm is determined primarily by the
 choice of linear solver.  In the current implementation, Cholesky
-prefactorization is roughly \f$ O(N^{1.5})\f$ and computation of distances is
-roughly \f$ O(N)\f$, where \f$ N\f$ is the number of vertices in the triangulation.
+prefactorization is roughly \cgalBigO{N^{1.5}} and computation of distances is
+roughly \cgalBigO{N}, where \f$ N\f$ is the number of vertices in the triangulation.
 The algorithm uses two \f$ N \times N\f$ matrices, both with the same pattern of
 non-zeros (in average 7 non-zeros
 per row/column).  The cost of computation is independent of the size
diff --git a/Inscribed_areas/doc/Inscribed_areas/CGAL/Largest_empty_iso_rectangle_2.h b/Inscribed_areas/doc/Inscribed_areas/CGAL/Largest_empty_iso_rectangle_2.h
index 080fc203bfbe..9e7c501bd2bb 100644
--- a/Inscribed_areas/doc/Inscribed_areas/CGAL/Largest_empty_iso_rectangle_2.h
+++ b/Inscribed_areas/doc/Inscribed_areas/CGAL/Largest_empty_iso_rectangle_2.h
@@ -14,8 +14,8 @@ that do not contain any point of the point set.
 \cgalHeading{Implementation}
 
 The algorithm is an implementation of \cgalCite{o-naler-90}. The runtime of an
-insertion or a removal is \f$ O(\log n)\f$. A query takes \f$ O(n^2)\f$ worst
-case time and \f$ O(n \log n)\f$ expected time. The working storage is \f$
+insertion or a removal is \cgalBigO{\log n}. A query takes \cgalBigO{n^2} worst
+case time and \cgalBigO{n \log n} expected time. The working storage is \f$
 O(n)\f$.
 
 */
diff --git a/Inscribed_areas/doc/Inscribed_areas/CGAL/extremal_polygon_2.h b/Inscribed_areas/doc/Inscribed_areas/CGAL/extremal_polygon_2.h
index a2170b124027..be734082d3be 100644
--- a/Inscribed_areas/doc/Inscribed_areas/CGAL/extremal_polygon_2.h
+++ b/Inscribed_areas/doc/Inscribed_areas/CGAL/extremal_polygon_2.h
@@ -32,8 +32,8 @@ convex polygon (oriented clock- or counterclockwise).
 \cgalHeading{Implementation}
 
 The implementation uses monotone matrix search
-\cgalCite{akmsw-gamsa-87} and has a worst case running time of \f$ O(k
-\cdot n + n \cdot \log n)\f$, where \f$ n\f$ is the number of vertices in
+\cgalCite{akmsw-gamsa-87} and has a worst case running time of \cgalBigO{k
+\cdot n + n \cdot \log n}, where \f$ n\f$ is the number of vertices in
 \f$ P\f$.
 
 */
@@ -89,8 +89,8 @@ where `K` is a model of `Kernel`.
 \cgalHeading{Implementation}
 
 The implementation uses monotone matrix search
-\cgalCite{akmsw-gamsa-87} and has a worst case running time of \f$ O(k
-\cdot n + n \cdot \log n)\f$, where \f$ n\f$ is the number of vertices in
+\cgalCite{akmsw-gamsa-87} and has a worst case running time of \cgalBigO{k
+\cdot n + n \cdot \log n}, where \f$ n\f$ is the number of vertices in
 \f$ P\f$.
 
 \cgalHeading{Example}
@@ -158,8 +158,8 @@ defined that computes the squareroot of a number.
 \cgalHeading{Implementation}
 
 The implementation uses monotone matrix search
-\cgalCite{akmsw-gamsa-87} and has a worst case running time of \f$ O(k
-\cdot n + n \cdot \log n)\f$, where \f$ n\f$ is the number of vertices in
+\cgalCite{akmsw-gamsa-87} and has a worst case running time of \cgalBigO{k
+\cdot n + n \cdot \log n}, where \f$ n\f$ is the number of vertices in
 \f$ P\f$.
 
 \cgalHeading{Example}
diff --git a/Inscribed_areas/include/CGAL/Largest_empty_iso_rectangle_2.h b/Inscribed_areas/include/CGAL/Largest_empty_iso_rectangle_2.h
index 4ef236892ab2..a76cb0785cea 100644
--- a/Inscribed_areas/include/CGAL/Largest_empty_iso_rectangle_2.h
+++ b/Inscribed_areas/include/CGAL/Largest_empty_iso_rectangle_2.h
@@ -46,7 +46,7 @@ namespace CGAL {
 
   The algorithm checks all the empty rectangles that are bounded by either
   points or edges of the bounding box (other empty rectangles can be enlarged
-  and remain empty). There are O(n^2) such rectangles. It is done in three
+  and remain empty). There are \cgalBigO{n^2} such rectangles. It is done in three
   phases. In the first one empty rectangles that are bounded by two opposite
   edges of the bounding box are checked. In the second one, other empty
   rectangles that are bounded by one or two edges of the bounding box are
diff --git a/Interval_skip_list/doc/Interval_skip_list/CGAL/Interval_skip_list.h b/Interval_skip_list/doc/Interval_skip_list/CGAL/Interval_skip_list.h
index a8fbc32ede1f..f3d71baac8b0 100644
--- a/Interval_skip_list/doc/Interval_skip_list/CGAL/Interval_skip_list.h
+++ b/Interval_skip_list/doc/Interval_skip_list/CGAL/Interval_skip_list.h
@@ -9,10 +9,10 @@ allows to find all members of a set of intervals that overlap a point.
 \cgalHeading{Implementation}
 
 The insertion and deletion of a segment in the interval skip list
-takes expected time \f$ O(\log^2 n)\f$, if the segment endpoints are
+takes expected time \cgalBigO{\log^2 n}, if the segment endpoints are
 chosen from a continuous distribution. A stabbing query takes expected
-time \f$ O(\log n)\f$, and finding all intervals that contain a point
-takes expected time \f$ O(\log n + k)\f$, where \f$ k\f$ is the number of
+time \cgalBigO{\log n}, and finding all intervals that contain a point
+takes expected time \cgalBigO{\log n + k}, where \f$ k\f$ is the number of
 intervals.
 
 The implementation is based on the code developed by Eric N. Hansen.
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Aff_transformation_d.h b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Aff_transformation_d.h
index b79f5d360e36..aa572c2df9a5 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Aff_transformation_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Aff_transformation_d.h
@@ -17,10 +17,10 @@ by the constructors below.
 Affine Transformations are implemented by matrices of number type
 `RT` as a handle type. All operations like creation,
 initialization, input and output on a transformation \f$ t\f$ take time
-\f$ O(t.dimension()^2)\f$. `dimension()` takes constant time.
+\cgalBigO{t.dimension()^2}. `dimension()` takes constant time.
 The operations for inversion and composition have the cubic costs of
 the used matrix operations. The space requirement is
-\f$ O(t.dimension()^2)\f$.
+\cgalBigO{t.dimension()^2}.
 
 */
 template< typename Kernel >
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Direction_d.h b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Direction_d.h
index 27d21d101281..d2010da0b6da 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Direction_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Direction_d.h
@@ -22,9 +22,9 @@ We provide the operations of the lower dimensional interface `dx()`,
 
 Directions are implemented by arrays of integers as an item type. All
 operations like creation, initialization, tests, inversion, input and
-output on a direction \f$ d\f$ take time \f$ O(d.\mathit{dimension}())\f$.
+output on a direction \f$ d\f$ take time \cgalBigO{d.\mathit{dimension}()}.
 `dimension()`, coordinate access and conversion take constant
-time. The space requirement is \f$ O(d.\mathit{dimension}())\f$.
+time. The space requirement is \cgalBigO{d.\mathit{dimension}()}.
 
 */
 template< typename Kernel >
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Hyperplane_d.h b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Hyperplane_d.h
index 26db5cca77f4..6323520da58e 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Hyperplane_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Hyperplane_d.h
@@ -27,8 +27,8 @@ other.
 Hyperplanes are implemented by arrays of integers as an item type.
 All operations like creation, initialization, tests, vector
 arithmetic, input and output on a hyperplane \f$ h\f$ take time
-\f$ O(h.dimension())\f$. coordinate access and `dimension()` take
-constant time. The space requirement is \f$ O(h.dimension())\f$.
+\cgalBigO{h.dimension()}. coordinate access and `dimension()` take
+constant time. The space requirement is \cgalBigO{h.dimension()}.
 
 */
 template< typename Kernel >
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Line_d.h b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Line_d.h
index fe21afdf8a5a..512c13d93b47 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Line_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Line_d.h
@@ -11,10 +11,10 @@ An instance of data type `Line_d` is an oriented line in
 Lines are implemented by a pair of points as an item type. All
 operations like creation, initialization, tests, direction
 calculation, input and output on a line \f$ l\f$ take time
-\f$ O(l.dimension())\f$. `dimension()`, coordinate and point
+\cgalBigO{l.dimension()}. `dimension()`, coordinate and point
 access, and identity test take constant time. The operations for
-intersection calculation also take time \f$ O(l.dimension())\f$. The
-space requirement is \f$ O(l.dimension())\f$.
+intersection calculation also take time \cgalBigO{l.dimension()}. The
+space requirement is \cgalBigO{l.dimension()}.
 
 */
 template< typename Kernel >
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Point_d.h b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Point_d.h
index 3446b32e73b1..15b935188096 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Point_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Point_d.h
@@ -24,9 +24,9 @@ dimensional interface `x()`, `y()`, `z()`, `hx()`,
 
 Points are implemented by arrays of `RT` items. All operations
 like creation, initialization, tests, point - vector arithmetic, input
-and output on a point \f$ p\f$ take time \f$ O(p.dimension())\f$.
+and output on a point \f$ p\f$ take time \cgalBigO{p.dimension()}.
 `dimension()`, coordinate access and conversions take constant
-time. The space requirement for points is \f$ O(p.dimension())\f$.
+time. The space requirement for points is \cgalBigO{p.dimension()}.
 
 */
 template< typename Kernel >
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Ray_d.h b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Ray_d.h
index 0f86aaa0d072..658e78f0d6c2 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Ray_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Ray_d.h
@@ -12,9 +12,9 @@ it goes to infinity.
 Rays are implemented by a pair of points as an item type. All
 operations like creation, initialization, tests, direction
 calculation, input and output on a ray \f$ r\f$ take time
-\f$ O(r.dimension())\f$. `dimension()`, coordinate and point
+\cgalBigO{r.dimension()}. `dimension()`, coordinate and point
 access, and identity test take constant time. The space requirement is
-\f$ O(r.dimension())\f$.
+\cgalBigO{r.dimension()}.
 
 */
 template< typename Kernel >
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Segment_d.h b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Segment_d.h
index 1f832f54436e..ca4a082da2e2 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Segment_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Segment_d.h
@@ -14,11 +14,11 @@ called the target point of \f$ s\f$, both points are called endpoints of
 Segments are implemented by a pair of points as an item type. All
 operations like creation, initialization, tests, the calculation of
 the direction and source - target vector, input and output on a
-segment \f$ s\f$ take time \f$ O(s.dimension())\f$. `dimension()`,
+segment \f$ s\f$ take time \cgalBigO{s.dimension()}. `dimension()`,
 coordinate and end point access, and identity test take constant time.
 The operations for intersection calculation also take time
-\f$ O(s.dimension())\f$. The space requirement is
-\f$ O(s.dimension())\f$.
+\cgalBigO{s.dimension()}. The space requirement is
+\cgalBigO{s.dimension()}.
 
 */
 template< typename Kernel >
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Sphere_d.h b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Sphere_d.h
index 96ed16be9b2b..c00376e3aece 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Sphere_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Sphere_d.h
@@ -17,11 +17,11 @@ orientation of the defining points, i.e., `orientation(A)`.
 
 Spheres are implemented by a vector of points as a handle type. All
 operations like creation, initialization, tests, input and output of a
-sphere \f$ s\f$ take time \f$ O(s.dimension()) \f$. `dimension()`,
+sphere \f$ s\f$ take time \cgalBigO{s.dimension()}$. `dimension()`,
 point access take constant time. The `center()`-operation takes
-time \f$ O(d^3)\f$ on its first call and constant time thereafter. The
-sidedness and orientation tests take time \f$ O(d^3)\f$. The space
-requirement for spheres is \f$ O(s.dimension())\f$ neglecting the
+time \cgalBigO{d^3} on its first call and constant time thereafter. The
+sidedness and orientation tests take time \cgalBigO{d^3}. The space
+requirement for spheres is \cgalBigO{s.dimension()} neglecting the
 storage room of the points.
 
 */
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Vector_d.h b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Vector_d.h
index c6b38b3d78d3..db6a139309b0 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Vector_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Kernel_d/Vector_d.h
@@ -26,9 +26,9 @@ lower dimensional interface `x()`, `y()`, `z()`,
 
 Vectors are implemented by arrays of variables of type `RT`. All
 operations like creation, initialization, tests, vector arithmetic,
-input and output on a vector \f$ v\f$ take time \f$ O(v.dimension())\f$.
+input and output on a vector \f$ v\f$ take time \cgalBigO{v.dimension()}.
 coordinate access, `dimension()` and conversions take constant
-time. The space requirement of a vector is \f$ O(v.dimension())\f$.
+time. The space requirement of a vector is \cgalBigO{v.dimension()}.
 
 */
 template< typename Kernel >
diff --git a/Matrix_search/doc/Matrix_search/CGAL/sorted_matrix_search.h b/Matrix_search/doc/Matrix_search/CGAL/sorted_matrix_search.h
index 399740701378..661621e5f437 100644
--- a/Matrix_search/doc/Matrix_search/CGAL/sorted_matrix_search.h
+++ b/Matrix_search/doc/Matrix_search/CGAL/sorted_matrix_search.h
@@ -52,7 +52,7 @@ true.
 
 The implementation uses an algorithm by
 Frederickson and Johnson\cgalCite{fj-fkppc-83}, \cgalCite{fj-gsrsm-84} and runs in
-\f$ \mathcal{O}(n \cdot k + f \cdot \log (n \cdot k))\f$, where \f$ n\f$ is
+\cgalBigO{n \cdot k + f \cdot \log (n \cdot k)}, where \f$ n\f$ is
 the number of input matrices, \f$ k\f$ denotes the maximal dimension of
 any input matrix and \f$ f\f$ the time needed for one feasibility test.
 
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h
index eb8a49f43541..3e5baf331823 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h
@@ -5,8 +5,8 @@ namespace CGAL {
 
 The `Greene_convex_decomposition_2` class implements the approximation algorithm of
 Greene for the decomposition of an input polygon into convex
-sub-polygons \cgalCite{g-dpcp-83}. This algorithm takes \f$ O(n \log n)\f$
-time and \f$ O(n)\f$ space, where \f$ n\f$ is the size of the input polygon,
+sub-polygons \cgalCite{g-dpcp-83}. This algorithm takes \cgalBigO{n \log n}
+time and \cgalBigO{n} space, where \f$ n\f$ is the size of the input polygon,
 and outputs a decomposition whose size is guaranteed to be no more
 than four times the size of the optimal decomposition.
 
@@ -38,7 +38,7 @@ and Mehlhorn for decomposing a polygon into convex
 sub-polygons \cgalCite{hm-ftsp-83}. This algorithm constructs a
 triangulation of the input polygon and proceeds by removing
 unnecessary triangulation edges. Given the triangulation, the
-algorithm requires \f$ O(n)\f$ time and space to construct a convex
+algorithm requires \cgalBigO{n} time and space to construct a convex
 decomposition (where \f$ n\f$ is the size of the input polygon), whose
 size is guaranteed to be no more than four times the size of the
 optimal decomposition.
@@ -69,7 +69,7 @@ namespace CGAL {
 The `Optimal_convex_decomposition_2` class provides an implementation of Greene's
 dynamic programming algorithm for optimal decomposition of a
 polygon into convex sub-polygons \cgalCite{g-dpcp-83}. Note that
-this algorithm requires \f$ O(n^4)\f$ time and \f$ O(n^3)\f$ space in
+this algorithm requires \cgalBigO{n^4} time and \cgalBigO{n^3} space in
 the worst case, where \f$ n\f$ is the size of the input polygon.
 
 
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_vertical_decomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_vertical_decomposition_2.h
index 132f04b2963f..eae2b05c67b5 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_vertical_decomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_vertical_decomposition_2.h
@@ -8,8 +8,8 @@ decomposition of a polygon or a polygon with holes into pseudo trapezoids
 utilizing the CGAL::decompose() free function of the
 \ref chapterArrangement_on_surface_2 "2D Arrangements" package.
 
-The algorithm operates in \f$ O(n \log n)\f$ time and takes
-\f$ O(n)\f$ space at the worst case, where \f$ n\f$ is the
+The algorithm operates in \cgalBigO{n \log n} time and takes
+\cgalBigO{n} space at the worst case, where \f$ n\f$ is the
 size of the input polygon.
 
 \cgalModels `PolygonWithHolesConvexDecomposition_2`
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Small_side_angle_bisector_decomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Small_side_angle_bisector_decomposition_2.h
index 8688bbd2de93..cfbce57f7a38 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Small_side_angle_bisector_decomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Small_side_angle_bisector_decomposition_2.h
@@ -12,7 +12,7 @@ connect two reflex vertices with an edge. When this is not possible any
 more, it eliminates the reflex vertices one by one by connecting them
 to other convex vertices, such that the new edge best approximates
 the angle bisector of the reflex vertex. The algorithm operates in
-\f$ O(n^2)\f$ time and takes \f$ O(n)\f$ space at the worst case, where
+\cgalBigO{n^2} time and takes \cgalBigO{n} space at the worst case, where
 \f$ n\f$ is the size of the input polygon.
 
 \cgalModels `PolygonConvexDecomposition_2`
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt b/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt
index bb0d0c90cb9a..6c6567f67e95 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/Minkowski_sum_2.txt
@@ -53,7 +53,7 @@ they form with the \f$ x\f$-axis; see the figure above.
 The Minkowski sum can therefore be computed using an operation similar to the
 merge step of the merge-sort algorithm\cgalFootnote{See, for example,
 <a href="https://en.wikipedia.org/wiki/Merge_sort">
-https://en.wikipedia.org/wiki/Merge_sort</a>.} in \f$ O(m + n)\f$ time,
+https://en.wikipedia.org/wiki/Merge_sort</a>.} in \cgalBigO{m + n} time,
 starting from the two bottommost vertices in \f$ P\f$ and in \f$ Q\f$ and
 merging the ordered list of edges.
 
@@ -294,7 +294,7 @@ the dynamic-programming algorithm of Greene \cgalCite{g-dpcp-83} for
 computing an optimal decomposition of a polygon into a minimal number
 of convex sub-polygons. While this algorithm results in a small number
 of convex polygons, it consumes rather many resources, as it runs in
-\f$ O(n^4) \f$ time and \f$ O(n^3) \f$ space in the worst case, where
+\cgalBigO{n^4} time and \cgalBigO{n^3} space in the worst case, where
 \f$ n \f$ is the number of vertices in the input polygon.
 
 <LI>The `Hertel_Mehlhorn_convex_decomposition_2<Kernel>` class
@@ -302,7 +302,7 @@ template implements the approximation algorithm suggested by Hertel and
 Mehlhorn \cgalCite{hm-ftsp-83}, which triangulates the input polygon
 and then discards unnecessary triangulation edges. After triangulation
 (carried out by the constrained-triangulation procedure of CGAL) the
-algorithm runs in \f$ O(n) \f$ time and space, and guarantees that the
+algorithm runs in \cgalBigO{n} time and space, and guarantees that the
 number of sub-polygons it generates is not more than four times the
 optimum.
 
@@ -310,7 +310,7 @@ optimum.
 implementation of Greene's approximation algorithm
 \cgalCite{g-dpcp-83}, which computes a convex decomposition of the
 polygon based on its partitioning into \f$ y\f$-monotone polygons.
-This algorithm runs in \f$ O(n \log n)\f$ time and \f$ O(n)\f$ space,
+This algorithm runs in \cgalBigO{n \log n} time and \cgalBigO{n} space,
 and has the same guarantee on the quality of approximation as Hertel
 and Mehlhorn's algorithm.
 
@@ -318,7 +318,7 @@ and Mehlhorn's algorithm.
 template is an implementation of a decomposition algorithm introduced
 in \cgalCite{cgal:afh-pdecm-02}. It is based on the angle-bisector
 decomposition method suggested by Chazelle and Dobkin
-\cgalCite{cd-ocd-85}, which runs in \f$ O(n^2)\f$ time. In addition,
+\cgalCite{cd-ocd-85}, which runs in \cgalBigO{n^2} time. In addition,
 it applies a heuristic by Flato that reduces the number of output
 polygons in many common cases.  The convex decompositions that it
 produces usually yield efficient running times for Minkowski sum
diff --git a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_tree_with_join.h b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_tree_with_join.h
index a528585c5c6a..05d35f8026f3 100644
--- a/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_tree_with_join.h
+++ b/Minkowski_sum_2/include/CGAL/Minkowski_sum_2/AABB_tree_with_join.h
@@ -182,7 +182,7 @@ namespace CGAL {
 
     /// After one or more calls to `AABB_tree_with_join::insert()` the internal data
     /// structure of the tree must be reconstructed. This procedure
-    /// has a complexity of \f$O(n log(n))\f$, where \f$n\f$ is the number of
+    /// has a complexity of \cgalBigO{n log(n)}, where \f$n\f$ is the number of
     /// primitives of the tree.  This procedure is called implicitly
     /// at the first call to a query member function. You can call
     /// AABB_tree_with_join::build() explicitly to ensure that the next call to
diff --git a/Minkowski_sum_2/include/CGAL/Polygon_convex_decomposition_2.h b/Minkowski_sum_2/include/CGAL/Polygon_convex_decomposition_2.h
index bda03b68ff84..60ddd0b6761c 100644
--- a/Minkowski_sum_2/include/CGAL/Polygon_convex_decomposition_2.h
+++ b/Minkowski_sum_2/include/CGAL/Polygon_convex_decomposition_2.h
@@ -22,7 +22,7 @@ namespace CGAL {
 
 /*!
  * \class
- * The O(n^4) optimal strategy for decomposing a polygon into convex
+ * The \cgalBigO{n^4} optimal strategy for decomposing a polygon into convex
  * sub-polygons.
  */
 template <typename Kernel_,
@@ -39,7 +39,7 @@ class Optimal_convex_decomposition_2 :
 
 /*!
  * \class
- * Hertel and Mehlhorn's O(n) approximation strategy for decomposing a
+ * Hertel and Mehlhorn's \cgalBigO{n} approximation strategy for decomposing a
  * polygon into convex sub-polygons.
  */
 template <typename Kernel_,
@@ -56,7 +56,7 @@ class Hertel_Mehlhorn_convex_decomposition_2 :
 
 /*!
  * \class
- * Greene's O(n log(n)) approximation strategy for decomposing a polygon into
+ * Greene's \cgalBigO{n log(n)} approximation strategy for decomposing a polygon into
  * convex sub-polygons.
  */
 template <typename Kernel_,
diff --git a/Minkowski_sum_3/doc/Minkowski_sum_3/Minkowski_sum_3.txt b/Minkowski_sum_3/doc/Minkowski_sum_3/Minkowski_sum_3.txt
index 22aff887d6d7..595435ee99db 100644
--- a/Minkowski_sum_3/doc/Minkowski_sum_3/Minkowski_sum_3.txt
+++ b/Minkowski_sum_3/doc/Minkowski_sum_3/Minkowski_sum_3.txt
@@ -72,7 +72,7 @@ quadratic number of pieces, which is worst-case optimal. Then up to
 \f$ m\f$ are the complexities of the two input polyhedra (the complexity of
 a `Nef_polyhedron_3` is the sum of its `Vertices`,
 `Halfedges` and `SHalfedges`). In total the operation runs in
-\f$ O(n^3m^3)\f$ time.
+\cgalBigO{n^3m^3} time.
 
 Since the computation of the Minkowski sum takes quite some time, we
 give the running times of some Minkowski sum computations. They were
diff --git a/Minkowski_sum_3/include/CGAL/minkowski_sum_3.h b/Minkowski_sum_3/include/CGAL/minkowski_sum_3.h
index 7b7924a67dfd..75a01e4003d5 100644
--- a/Minkowski_sum_3/include/CGAL/minkowski_sum_3.h
+++ b/Minkowski_sum_3/include/CGAL/minkowski_sum_3.h
@@ -28,7 +28,7 @@ namespace CGAL {
 
 The function `minkowski_sum_3()` computes the Minkowski sum of two
 given 3D Nef polyhedra \f$ N0\f$ and \f$ N1\f$. Note that the function runs in
-\f$ O(n^3m^3)\f$ time in the worst case, where \f$ n\f$ and
+\cgalBigO{n^3m^3} time in the worst case, where \f$ n\f$ and
 \f$ m\f$ are the complexities of the two input polyhedra (the complexity of
 a `Nef_polyhedron_3` is the sum of its `Vertices`,
 `Halfedges` and `SHalfedges`).
diff --git a/Miscellany/doc/Miscellany/CGAL/Union_find.h b/Miscellany/doc/Miscellany/CGAL/Union_find.h
index f5d2d71c8e4c..66f242870311 100644
--- a/Miscellany/doc/Miscellany/CGAL/Union_find.h
+++ b/Miscellany/doc/Miscellany/CGAL/Union_find.h
@@ -13,7 +13,7 @@ in the C++ standard. It has a default argument `CGAL_ALLOCATOR(T)`.
 
 `Union_find<T,A>` is implemented with union by rank and path
 compression. The running time for \f$ m\f$ set operations on \f$ n\f$ elements
-is \f$ O(n \alpha(m,n))\f$ where \f$ \alpha(m,n)\f$ is the extremely slow growing
+is \cgalBigO{n \alpha(m,n)} where \f$ \alpha(m,n)\f$ is the extremely slow growing
 inverse of Ackermann's function.
 
 */
diff --git a/Miscellany/doc/Miscellany/CGAL/Unique_hash_map.h b/Miscellany/doc/Miscellany/CGAL/Unique_hash_map.h
index 05debda348d0..38cfa3c17c08 100644
--- a/Miscellany/doc/Miscellany/CGAL/Unique_hash_map.h
+++ b/Miscellany/doc/Miscellany/CGAL/Unique_hash_map.h
@@ -28,7 +28,7 @@ of type `Data` specified in the definition of `map`.
 \cgalHeading{Implementation}
 
 `Unique_hash_map` is implemented via a chained hashing scheme. Access
-operations `map``[i]` take expected time \f$ O(1)\f$. The `table_size`
+operations `map``[i]` take expected time \cgalBigO{1}. The `table_size`
 parameter passed to chained hashing can be used to avoid unnecessary
 rehashing when set to the number of expected elements in the map.
 The design is derived from the \stl `hash_map` and the \leda type
diff --git a/Miscellany/doc/Miscellany/Miscellany.txt b/Miscellany/doc/Miscellany/Miscellany.txt
index 54dbb62d5621..eb8ed642c346 100644
--- a/Miscellany/doc/Miscellany/Miscellany.txt
+++ b/Miscellany/doc/Miscellany/Miscellany.txt
@@ -47,7 +47,7 @@ global macro `CGAL_PROFILE`.
 
 The class `Unique_hash_map` implements an injective mapping between
 a set of unique keys and a set of data values. This is implemented using
-a chained hashing scheme and access operations take \f$ O(1)\f$ expected time.
+a chained hashing scheme and access operations take \cgalBigO{1} expected time.
 Such a mapping is useful, for example, when keys are pointers,
 handles, iterators or circulators that refer to unique memory locations.
 In this case, the default hash function is `Handle_hash_function`.
@@ -57,7 +57,7 @@ In this case, the default hash function is `Handle_hash_function`.
 \cgal also provides a class `Union_find` that implements a partition
 of values into disjoint sets. This is implemented with union by rank and
 path compression. The running time for \f$ m\f$ set operations on \f$ n\f$ elements
-is \f$ O(n\alpha(m,n))\f$ where \f$ \alpha(m,n)\f$ is the extremely slowly growing
+is \cgalBigO{n\alpha(m,n)} where \f$ \alpha(m,n)\f$ is the extremely slowly growing
 inverse of Ackermann's function.
 
 \section MiscellanyProtected Protected Access to Internal Representations
diff --git a/Nef_2/doc/Nef_2/CGAL/Nef_polyhedron_2.h b/Nef_2/doc/Nef_2/CGAL/Nef_polyhedron_2.h
index 361b38fe5618..9d0bbb4126d4 100644
--- a/Nef_2/doc/Nef_2/CGAL/Nef_polyhedron_2.h
+++ b/Nef_2/doc/Nef_2/CGAL/Nef_polyhedron_2.h
@@ -33,14 +33,14 @@ Operations like `empty` take constant time. The operations
 `clear`, `complement`, `interior`, `closure`,
 `boundary`, `regularization`, input and output take linear
 time. All binary set operations and comparison operations take time
-\f$ O(n \log n)\f$ where \f$ n\f$ is the size of the output plus the size of the
+\cgalBigO{n \log n} where \f$ n\f$ is the size of the output plus the size of the
 input.
 
 The point location and ray shooting operations are implemented in two
 flavors. The `NAIVE` operations run in linear query time without
 any preprocessing, the `DEFAULT` operations (equals `LMWT`)
 run in sub-linear query time, but preprocessing is triggered with the
-first operation. Preprocessing takes time \f$ O(N^2)\f$, the sub-linear
+first operation. Preprocessing takes time \cgalBigO{N^2}, the sub-linear
 point location time is either logarithmic when LEDA's persistent
 dictionaries are present or if not then the point location time is
 worst-case linear, but experiments show often sublinear runtimes. Ray
@@ -49,7 +49,7 @@ triangulation overlaid on the plane map representation. The cost of
 the walk is proportional to the number of triangles passed in
 direction `d` until an obstacle is met. In a minimum weight
 triangulation of the obstacles (the plane map representing the
-polyhedron) the theory provides a \f$ O(\sqrt{n})\f$ bound for the number
+polyhedron) the theory provides a \cgalBigO{\sqrt{n}} bound for the number
 of steps. Our locally minimum weight triangulation approximates the
 minimum weight triangulation only heuristically (the calculation of
 the minimum weight triangulation is conjectured to be NP hard). Thus
diff --git a/Nef_S2/doc/Nef_S2/CGAL/Nef_polyhedron_S2.h b/Nef_S2/doc/Nef_S2/CGAL/Nef_polyhedron_S2.h
index 7a297d618380..96dfc3d41f5c 100644
--- a/Nef_S2/doc/Nef_S2/CGAL/Nef_polyhedron_S2.h
+++ b/Nef_S2/doc/Nef_S2/CGAL/Nef_polyhedron_S2.h
@@ -58,7 +58,7 @@ Operations like `empty` take constant time. The operations
 `clear`, `complement`, `interior`, `closure`,
 `boundary`, `regularization`, input and output take linear
 time. All binary set operations and comparison operations take time
-\f$ O(n \log n)\f$ where \f$ n\f$ is the size of the output plus the size of the
+\cgalBigO{n \log n} where \f$ n\f$ is the size of the output plus the size of the
 input.
 
 The point location and ray shooting operations are implemented in the
diff --git a/Orthtree/doc/Orthtree/Orthtree.txt b/Orthtree/doc/Orthtree/Orthtree.txt
index 0a957a6fa512..bfe724038666 100644
--- a/Orthtree/doc/Orthtree/Orthtree.txt
+++ b/Orthtree/doc/Orthtree/Orthtree.txt
@@ -234,7 +234,7 @@ Because of its simplicity, an octree can be constructed faster than a kd-tree.
 
 %Orthtree nodes are uniform, so orthtrees will tend to have deeper hierarchies than equivalent kd-trees.
 As a result, orthtrees will generally perform worse for nearest neighbor searches.
-Both nearest neighbor algorithms have a theoretical complexity of O(log(n)),
+Both nearest neighbor algorithms have a theoretical complexity of \cgalBigO{log(n)},
 but the orthtree can generally be expected to have a higher coefficient.
 
 \cgalFigureBegin{Orthtree_nearest_neighbor_benchmark_fig, nearest_neighbor_benchmark.png}
diff --git a/Partition_2/doc/Partition_2/CGAL/is_y_monotone_2.h b/Partition_2/doc/Partition_2/CGAL/is_y_monotone_2.h
index 2a5768e9613c..ec9e97fc8cfa 100644
--- a/Partition_2/doc/Partition_2/CGAL/is_y_monotone_2.h
+++ b/Partition_2/doc/Partition_2/CGAL/is_y_monotone_2.h
@@ -22,7 +22,7 @@ type `std::iterator_traits<InputIterator>::%value_type` is defined.
 
 \cgalHeading{Implementation}
 
-This function requires \f$ O(n)\f$ time for a polygon with \f$ n\f$ vertices.
+This function requires \cgalBigO{n} time for a polygon with \f$ n\f$ vertices.
 
 \cgalHeading{Example}
 
diff --git a/Partition_2/doc/Partition_2/CGAL/partition_2.h b/Partition_2/doc/Partition_2/CGAL/partition_2.h
index 4387d8981a99..7ec0e01596b0 100644
--- a/Partition_2/doc/Partition_2/CGAL/partition_2.h
+++ b/Partition_2/doc/Partition_2/CGAL/partition_2.h
@@ -46,7 +46,7 @@ with the representation type determined by `std::iterator_traits<InputIterator1>
 This function implements the algorithm of Hertel and Mehlhorn
 \cgalCite{hm-ftsp-83} and is based on the class
 `Constrained_triangulation_2`. Given a triangulation of
-the polygon, the function requires \f$ O(n)\f$ time and
+the polygon, the function requires \cgalBigO{n} time and
 space for a polygon with \f$ n\f$ vertices.
 
 \cgalHeading{Example}
@@ -116,7 +116,7 @@ with the representation type determined by `std::iterator_traits<InputIterator>:
 \cgalHeading{Implementation}
 
 This function implements the approximation algorithm of
-Greene \cgalCite{g-dpcp-83} and requires \f$ O(n \log n)\f$ time and \f$ O(n)\f$ space
+Greene \cgalCite{g-dpcp-83} and requires \cgalBigO{n \log n} time and \cgalBigO{n} space
 to produce a convex partitioning given a \f$ y\f$-monotone partitioning of a
 polygon with \f$ n\f$ vertices. The function `y_monotone_partition_2()`
 is used to produce the monotone partition.
@@ -184,7 +184,7 @@ with the representation type determined by `std::iterator_traits<InputIterator>:
 \cgalHeading{Implementation}
 
 This function implements the dynamic programming algorithm of Greene
-\cgalCite{g-dpcp-83}, which requires \f$ O(n^4)\f$ time and \f$ O(n^3)\f$ space to
+\cgalCite{g-dpcp-83}, which requires \cgalBigO{n^4} time and \cgalBigO{n^3} space to
 produce a partitioning of a polygon with \f$ n\f$ vertices.
 
 \cgalHeading{Example}
@@ -254,8 +254,8 @@ with the representation type determined by `std::iterator_traits<InputIterator>:
 \cgalHeading{Implementation}
 
 This function implements the algorithm presented by de Berg <I>et al.</I>
-\cgalCite{bkos-cgaa-97} which requires \f$ O(n \log n)\f$ time
-and \f$ O(n)\f$ space for a polygon with \f$ n\f$ vertices.
+\cgalCite{bkos-cgaa-97} which requires \cgalBigO{n \log n} time
+and \cgalBigO{n} space for a polygon with \f$ n\f$ vertices.
 
 \cgalHeading{Example}
 
diff --git a/Partition_2/doc/Partition_2/CGAL/partition_is_valid_2.h b/Partition_2/doc/Partition_2/CGAL/partition_is_valid_2.h
index 69ddf012ebf3..20efe4eefc0c 100644
--- a/Partition_2/doc/Partition_2/CGAL/partition_is_valid_2.h
+++ b/Partition_2/doc/Partition_2/CGAL/partition_is_valid_2.h
@@ -41,7 +41,7 @@ with the representation type determined by `std::iterator_traits<InputIterator>:
 
 This function calls `partition_is_valid_2()` using the function object
 `Is_convex_2` to determine the convexity of each partition polygon.
-Thus the time required by this function is \f$ O(n \log n + e \log e)\f$ where
+Thus the time required by this function is \cgalBigO{n \log n + e \log e} where
 \f$ n\f$ is the total number of vertices in the partition polygons and \f$ e\f$ the
 total number of edges.
 
@@ -103,7 +103,7 @@ with the representation type determined by `std::iterator_traits<InputIterator>:
 
 \cgalHeading{Implementation}
 
-This function requires \f$ O(n \log n + e \log e + \Sigma_{i=1}^p m_i)\f$ where \f$ n\f$
+This function requires \cgalBigO{n \log n + e \log e + \Sigma_{i=1}^p m_i} where \f$ n\f$
 is the total number of vertices of the \f$ p\f$ partition polygons, \f$ e\f$ is the
 total number of edges of the partition polygons and \f$ m_i\f$ is the time required
 by `Traits::Is_valid()` to test if partition polygon \f$ p_i\f$ is valid.
@@ -161,7 +161,7 @@ with the representation type determined by `std::iterator_traits<InputIterator>:
 
 This function uses the function `partition_is_valid_2()` together with
 the function object `Is_y_monotone_2` to determine if each polygon
-is \f$ y\f$-monotone or not. Thus the time required is \f$ O(n \log n + e \log e)\f$
+is \f$ y\f$-monotone or not. Thus the time required is \cgalBigO{n \log n + e \log e}
 where \f$ n\f$ is the total number of vertices of the partition polygons and
 \f$ e\f$ is the total number of edges.
 
diff --git a/Partition_2/doc/Partition_2/CGAL/polygon_function_objects.h b/Partition_2/doc/Partition_2/CGAL/polygon_function_objects.h
index 4cd55a933760..d7341e0f5f87 100644
--- a/Partition_2/doc/Partition_2/CGAL/polygon_function_objects.h
+++ b/Partition_2/doc/Partition_2/CGAL/polygon_function_objects.h
@@ -13,7 +13,7 @@ a convex polygon or not.
 
 \cgalHeading{Implementation}
 
-This test requires \f$ O(n)\f$ time for a polygon with \f$ n\f$ vertices.
+This test requires \cgalBigO{n} time for a polygon with \f$ n\f$ vertices.
 
 */
 template< typename Traits >
@@ -62,7 +62,7 @@ Function object class that indicates all sequences of points are valid.
 
 \cgalHeading{Implementation}
 
-This test requires \f$ O(1)\f$ time.
+This test requires \cgalBigO{1} time.
 
 */
 template< typename Traits >
@@ -110,7 +110,7 @@ a \f$ y\f$-monotone polygon or not.
 
 \cgalHeading{Implementation}
 
-This test requires \f$ O(n)\f$ time for a polygon with \f$ n\f$ vertices.
+This test requires \cgalBigO{n} time for a polygon with \f$ n\f$ vertices.
 
 */
 template< typename Traits >
diff --git a/Partition_2/doc/Partition_2/PackageDescription.txt b/Partition_2/doc/Partition_2/PackageDescription.txt
index 4d5b6ba9c918..ec875293336f 100644
--- a/Partition_2/doc/Partition_2/PackageDescription.txt
+++ b/Partition_2/doc/Partition_2/PackageDescription.txt
@@ -31,8 +31,8 @@ Functions are available for partitioning planar polygons into two
 types of subpolygons (`y`-monotone polygons and convex polygons).
 
 The function that produces a `y`-monotone partitioning is based on the
-algorithm presented in \cgalCite{bkos-cgaa-97} which requires \f$ O(n \log n) \f$ time
-and \f$ O(n) \f$ space for a polygon with \f$ n \f$ vertices and guarantees nothing
+algorithm presented in \cgalCite{bkos-cgaa-97} which requires \cgalBigO{n \log n} time
+and \cgalBigO{n} space for a polygon with \f$ n \f$ vertices and guarantees nothing
 about the number of polygons produced with respect to the optimal number
 Three functions are provided for producing
 convex partitions. Two of these functions produce approximately optimal
@@ -41,12 +41,12 @@ defined in terms of the number of partition polygons.   The two functions
 that implement approximation algorithms are guaranteed to produce no more
 than four times the optimal number of convex pieces.  The optimal partitioning
 function provides an implementation of Greene's dynamic programming algorithm
-\cgalCite{g-dpcp-83}, which requires \f$ O(n^4) \f$ time and \f$ O(n^3) \f$ space to produce a
+\cgalCite{g-dpcp-83}, which requires \cgalBigO{n^4} time and \cgalBigO{n^3} space to produce a
 convex partitioning. One of the approximation algorithms is also due to
-Greene \cgalCite{g-dpcp-83} and requires \f$ O(n \log n) \f$ time and \f$ O(n) \f$ space
+Greene \cgalCite{g-dpcp-83} and requires \cgalBigO{n \log n} time and \cgalBigO{n} space
 to produce a convex partitioning given a `y`-monotone partitioning.  The
 other approximation algorithm is a result of Hertel and
-Mehlhorn \cgalCite{hm-ftsp-83}, which requires \f$ O(n) \f$ time and space to produce
+Mehlhorn \cgalCite{hm-ftsp-83}, which requires \cgalBigO{n} time and space to produce
 a convex partitioning from a triangulation of a polygon.
 Each of the partitioning functions uses a traits class to supply the
 primitive types and predicates used by the algorithms.
diff --git a/Partition_2/doc/Partition_2/Partition_2.txt b/Partition_2/doc/Partition_2/Partition_2.txt
index a574547db37b..6402e4fae467 100644
--- a/Partition_2/doc/Partition_2/Partition_2.txt
+++ b/Partition_2/doc/Partition_2/Partition_2.txt
@@ -39,7 +39,7 @@ is a polygon whose vertices \f$ v_1, \ldots, v_n\f$ can be divided into two chai
 intersects either chain at most once. For producing a \f$ y\f$-monotone partition
 of a given polygon, the sweep-line algorithm
 presented in \cgalCite{bkos-cgaa-97} is implemented by the function
-`y_monotone_partition_2()`. This algorithm runs in \f$ O(n \log n)\f$ time and requires \f$ O(n)\f$ space.
+`y_monotone_partition_2()`. This algorithm runs in \cgalBigO{n \log n} time and requires \cgalBigO{n} space.
 This algorithm does not guarantee a bound on the number of polygons
 produced with respect to the optimal number.
 
@@ -72,7 +72,7 @@ An optimal convex partition can be produced using the function `optimal_convex_p
 This function provides an
 implementation of Greene's dynamic programming algorithm for optimal
 partitioning \cgalCite{g-dpcp-83}.
-This algorithm requires \f$ O(n^4)\f$ time and \f$ O(n^3)\f$ space in the worst case.
+This algorithm requires \cgalBigO{n^4} time and \cgalBigO{n^3} space in the worst case.
 
 The function `approx_convex_partition_2()` implements the simple approximation
 algorithm of Hertel and Mehlhorn \cgalCite{hm-ftsp-83} that
@@ -81,12 +81,12 @@ throwing out unnecessary triangulation edges.
 The triangulation used in this function is one produced by the
 2-dimensional constrained triangulation
 package of \cgal. For a given triangulation, this convex partitioning
-algorithm requires \f$ O(n)\f$ time and space to construct a decomposition into
+algorithm requires \cgalBigO{n} time and space to construct a decomposition into
 no more than four times the optimal number of convex pieces.
 
 The sweep-line approximation algorithm of Greene \cgalCite{g-dpcp-83}, which,
 given a monotone partition of a polygon, produces a convex partition in
-\f$ O(n \log n)\f$ time and \f$ O(n)\f$ space, is implemented
+\cgalBigO{n \log n} time and \cgalBigO{n} space, is implemented
 by the function `greene_approx_convex_partition_2()`. The function
 `y_monotone_partition_2()` described in
 Section \ref secpartition_2_monotone is used to produce the monotone
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_2.h
index b95c3c7f6078..bd100faf0157 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_2.h
@@ -28,19 +28,19 @@ CGAL::Triangulation_data_structure_2<
 \cgalHeading{Implementation}
 
 Insertion is implemented by inserting in the triangulation, then
-performing a sequence of Delaunay flips. The number of flips is \f$ O(d)\f$
+performing a sequence of Delaunay flips. The number of flips is \cgalBigO{d}
 if the new vertex is of degree \f$ d\f$ in the new triangulation. For
-points distributed uniformly at random, insertion takes time \f$ O(1)\f$ on
+points distributed uniformly at random, insertion takes time \cgalBigO{1} on
 average.
 
 Removal calls the removal in the triangulation and then
 re-triangulates the hole in such a way that the Delaunay criterion is
-satisfied. Removal of a vertex of degree \f$ d\f$ takes time \f$ O(d^2)\f$. The
-expected degree \f$ d\f$ is \f$ O(1)\f$ for a random vertex in the
+satisfied. Removal of a vertex of degree \f$ d\f$ takes time \cgalBigO{d^2}. The
+expected degree \f$ d\f$ is \cgalBigO{1} for a random vertex in the
 triangulation.
 
 After a point location step, the nearest neighbor is found in time
-\f$ O(n)\f$ in the worst case, but in expected time \f$ O(1)\f$ on average for
+\cgalBigO{n} in the worst case, but in expected time \cgalBigO{1} on average for
 vertices distributed uniformly at random and any query point.
 
 \sa `CGAL::Periodic_2_triangulation_2<Traits,Tds>`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h
index af9757a095f8..1689f5187bc4 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h
@@ -55,7 +55,7 @@ optional parameter is given).
 
 Insertion of a point is done by locating a face that contains the
 point, and then splitting this face. Apart from the location,
-insertion takes a time \f$ O(1)\f$.
+insertion takes a time \cgalBigO{1}.
 
 Removal of a vertex is more difficult than in the Euclidean space,
 since the star of a vertex may not be disjoint from the star of a
diff --git a/Polygon/include/CGAL/Polygon_2_algorithms.h b/Polygon/include/CGAL/Polygon_2_algorithms.h
index 8233269217af..a66bff191bfb 100644
--- a/Polygon/include/CGAL/Polygon_2_algorithms.h
+++ b/Polygon/include/CGAL/Polygon_2_algorithms.h
@@ -231,7 +231,7 @@ bool is_convex_2(ForwardIterator first,
 ///
 /// The simplicity test is implemented by means of a plane sweep algorithm.
 /// The algorithm is quite robust when used with inexact number types.
-/// The running time is `O(n log n)`, where n is the number of vertices of the
+/// The running time is \cgalBigO{n log n}, where n is the number of vertices of the
 /// polygon.
 ///
 /// \sa `PolygonTraits_2`
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 8d541588736c..00ccfd382f66 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -543,8 +543,8 @@ This can allow a user to stop the algorithm if a timeout needs to be implemented
 
 The hole filling algorithm has a complexity which depends on the
 number of vertices.  While \cgalCite{liepa2003filling} has a running
-time of \f$ O(n^3)\f$ , \cgalCite{zou2013algorithm} in most cases has
-running time of \f$ O(n \log n)\f$. We benchmarked the function
+time of \cgalBigO{n^3} , \cgalCite{zou2013algorithm} in most cases has
+running time of \cgalBigO{n \log n}. We benchmarked the function
 `triangulate_refine_and_fair_hole()` for the two meshes below (as well as two
 more meshes with smaller holes). The machine used was a PC running
 Windows 10 with an Intel Core i7 CPU clocked at 2.70 GHz.
diff --git a/QP_solver/doc/QP_solver/QP_solver.txt b/QP_solver/doc/QP_solver/QP_solver.txt
index 56c6a0aa44ec..5328a563deef 100644
--- a/QP_solver/doc/QP_solver/QP_solver.txt
+++ b/QP_solver/doc/QP_solver/QP_solver.txt
@@ -351,7 +351,7 @@ Similarly, if the solver knows that the program is nonnegative, it
 will be more efficient than under the general bounds
 \f$ \qpl\leq \qpx \leq \qpu\f$.
 You can argue that nonnegativity <I>is</I> something that could easily
-be checked in time \f$ O(n)\f$ beforehand, but then again nonnegative
+be checked in time \cgalBigO{n} beforehand, but then again nonnegative
 programs are so frequent that the syntactic sugar aspect becomes
 somewhat important. After all, we can save four iterators in
 specifying a nonnegative linear program in terms of the concept
diff --git a/STL_Extension/doc/STL_Extension/CGAL/Compact_container.h b/STL_Extension/doc/STL_Extension/CGAL/Compact_container.h
index b11ee290e950..9fb98710126d 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/Compact_container.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/Compact_container.h
@@ -82,7 +82,7 @@ container. The iterator does not have constant amortized time complexity for
 the increment and decrement operations in all cases, only when not too many
 elements have not been freed (i.e.\ when the `size()` is close to the
 `capacity()`). Iterating from `begin()` to `end()` takes
-`O(capacity())` time, not `size()`. In the case where the container
+\cgalBigO{capacity()} time, not `size()`. In the case where the container
 has a small `size()` compared to its `capacity()`, we advise to
 "defragment the memory" by copying the container if the iterator performance
 is needed.
@@ -661,7 +661,7 @@ void clear();
 
 /// \name Ownership testing
 /// The following functions are mostly helpful for efficient debugging, since
-/// their complexity is \f$ O(\sqrt{\mathrm{c.capacity()}})\f$.
+/// their complexity is \cgalBigO{\sqrt{\mathrm{c.capacity()}}}.
 /// @{
 
 /*!
@@ -681,7 +681,7 @@ bool owns_dereferenceable(const_iterator pos);
 /// @{
 /*!
 adds the items of `cc2` to the end of `cc` and `cc2` becomes empty.
-The time complexity is O(`cc`.`capacity()`-`cc`.`size()`).
+The time complexity is \cgalBigO{cc.capacity()-cc.size()}.
 \pre `cc2` must not be the same as `cc`, and the allocators of `cc` and `cc2` must be compatible: `cc.get_allocator() == cc2.get_allocator()`.
 */
 void merge(Compact_container<T, Allocator> &cc);
diff --git a/STL_Extension/doc/STL_Extension/CGAL/Concurrent_compact_container.h b/STL_Extension/doc/STL_Extension/CGAL/Concurrent_compact_container.h
index dd7f392daf2f..4ce97a3e7024 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/Concurrent_compact_container.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/Concurrent_compact_container.h
@@ -92,7 +92,7 @@ container. The iterator does not have constant amortized time complexity for
 the increment and decrement operations in all cases, only when not too many
 elements have not been freed (i.e.\ when the `size()` is close to the
 `capacity()`). Iterating from `begin()` to `end()` takes
-`O(capacity())` time, not `size()`. In the case where the container
+\cgalBigO{capacity()} time, not `size()`. In the case where the container
 has a small `size()` compared to its `capacity()`, we advise to
 \"defragment the memory\" by copying the container if the iterator performance
 is needed.
@@ -289,7 +289,7 @@ complexity. No exception is thrown.
 
 /// \name Ownership testing
 /// The following functions are mostly helpful for efficient debugging, since
-/// their complexity is \f$ O(\sqrt{\mathrm{c.capacity()}})\f$.
+/// their complexity is \cgalBigO{\sqrt{\mathrm{c.capacity()}}}.
 /// @{
   /// returns whether `pos` is in the range `[ccc.begin(),  ccc.end()]` (`ccc.end()` included).
   bool owns(const_iterator pos);
@@ -302,7 +302,7 @@ complexity. No exception is thrown.
 /// @{
 /*!
 adds the items of `ccc2` to the end of `ccc` and `ccc2` becomes empty.
-The time complexity is O(`ccc`.`capacity()`-`ccc`.`size()`).
+The time complexity is \cgalBigO{ccc.capacity()-ccc.size()}.
 \pre `ccc2` must not be the same as `ccc`, and the allocators of `ccc` and `ccc2` must be compatible: `ccc.get_allocator() == ccc2.get_allocator()`.
 */
 void merge(Concurrent_compact_container<T, Allocator> &ccc2);
diff --git a/STL_Extension/doc/STL_Extension/CGAL/In_place_list.h b/STL_Extension/doc/STL_Extension/CGAL/In_place_list.h
index d5dc49c9d138..faf647e48040 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/In_place_list.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/In_place_list.h
@@ -749,7 +749,7 @@ void reverse();
 /// @{
 /*!
 sorts the list `ipl` according to the
-`operator<` in time \f$ O(n \log n)\f$ where `n = size()`.
+`operator<` in time \cgalBigO{n \log n} where `n = size()`.
 It is stable.
 \pre a suitable `operator<` for the type `T`.
 */
diff --git a/STL_Extension/doc/STL_Extension/CGAL/Multiset.h b/STL_Extension/doc/STL_Extension/CGAL/Multiset.h
index a81cabb29eaf..f9d8715a1de0 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/Multiset.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/Multiset.h
@@ -73,12 +73,12 @@ less-than operator (`operator<`).
 
 `Multiset` uses a proprietary implementation of a red-black tree
 data-structure. The red-black tree invariants guarantee that the height of a
-tree containing \f$ n\f$ elements is \f$ O(\log{n})\f$ (more precisely, it is bounded by
+tree containing \f$ n\f$ elements is \cgalBigO{\log{n}} (more precisely, it is bounded by
 \f$ 2 \log_{2}{n}\f$). As a consequence, all methods that accept an element and need
 to locate it in the tree (namely `insert(x)`, `erase(x)`,
 `find(x)`, `count(x)`, `lower_bound(x)` , `upper_bound(x)`,
-`find_lower(x)` and `equal_range(x)`) take \f$ O(\log{n})\f$ time and
-perform \f$ O(\log{n})\f$ comparison operations.
+`find_lower(x)` and `equal_range(x)`) take \cgalBigO{\log{n}} time and
+perform \cgalBigO{\log{n}} comparison operations.
 
 On the other hand, the set operations that accept a position iterator (namely
 `insert_before(pos, x)`, `insert_after(pos, x)` and `erase(pos)`)
@@ -87,12 +87,12 @@ cost (see \cgalCite{gs-dfbt-78} and \cgalCite{t-dsna-83} for more details).
 More important, these set operations require <I>no</I> comparison operations.
 Therefore, it is highly recommended to maintain the set via iterators
 to the stored elements, whenever possible. The function `insert(pos, x)`
-is safer to use, but it takes amortized \f$ O(\min\{d,\log{n}\})\f$ time, where \f$ d\f$
+is safer to use, but it takes amortized \cgalBigO{\min\{d,\log{n}\}} time, where \f$ d\f$
 is the distance between the given position and the true position of `x`.
 In addition, it always performs at least two comparison operations.
 
 The `catenate()` and `split()` functions are also very efficient, and
-can be performed in \f$ O(\log{n})\f$ time, where \f$ n\f$ is the total number of
+can be performed in \cgalBigO{\log{n}} time, where \f$ n\f$ is the total number of
 elements in the sets, and without performing any comparison operations
 (see \cgalCite{t-dsna-83} for the details).
 Note however that the size of two sets resulting from a split operation is
diff --git a/STL_Extension/include/CGAL/Multiset.h b/STL_Extension/include/CGAL/Multiset.h
index e0193fb4b9a6..e043627ec150 100644
--- a/STL_Extension/include/CGAL/Multiset.h
+++ b/STL_Extension/include/CGAL/Multiset.h
@@ -544,25 +544,25 @@ class Multiset
   //@{
 
   /*!
-   * Default constructor. [takes O(1) operations]
+   * Default constructor. [takes \cgalBigO{1} operations]
    */
   Multiset ();
 
   /*!
-   * Constructor with a comparison object. [takes O(1) operations]
+   * Constructor with a comparison object. [takes \cgalBigO{1} operations]
    * \param comp A comparison object to be used by the tree.
    */
   Multiset (const Compare& comp);
 
   /*!
-   * Copy constructor. [takes O(n) operations]
+   * Copy constructor. [takes \cgalBigO{n} operations]
    * \param tree The copied tree.
    */
   Multiset (const Self& tree);
 
   /*!
    * Construct a tree that contains all objects in the given range.
-   * [takes O(n log n) operations]
+   * [takes \cgalBigO{n log n} operations]
    * \param first An iterator for the first object in the range.
    * \param last A past-the-end iterator for the range.
    */
@@ -587,18 +587,18 @@ class Multiset
   }
 
   /*!
-   * Destructor. [takes O(n) operations]
+   * Destructor. [takes \cgalBigO{n} operations]
    */
   virtual ~Multiset () noexcept(!CGAL_ASSERTIONS_ENABLED);
 
   /*!
-   * Assignment operator. [takes O(n) operations]
+   * Assignment operator. [takes \cgalBigO{n} operations]
    * \param tree The copied tree.
    */
   Self& operator= (const Self& tree);
 
   /*!
-   * Swap two trees. [takes O(1) operations]
+   * Swap two trees. [takes \cgalBigO{1} operations]
    * \param tree The copied tree.
    */
   void swap (Self& tree);
@@ -608,13 +608,13 @@ class Multiset
   //@{
 
   /*!
-   * Test two trees for equality. [takes O(n) operations]
+   * Test two trees for equality. [takes \cgalBigO{n} operations]
    * \param tree The compared tree.
    */
   bool operator== (const Self& tree) const;
 
   /*!
-   * Check if our tree is lexicographically smaller. [takes O(n) operations]
+   * Check if our tree is lexicographically smaller. [takes \cgalBigO{n} operations]
    * \param tree The compared tree.
    */
   bool operator< (const Self& tree) const;
@@ -707,8 +707,8 @@ class Multiset
   }
 
   /*!
-   * Get the size of the tree. [takes O(1) operations, unless the tree
-   * was involved in a split operation, then it may take O(n) time.]
+   * Get the size of the tree. [takes \cgalBigO{1} operations, unless the tree
+   * was involved in a split operation, then it may take \cgalBigO{n} time.]
    * \return The number of objects stored in the tree.
    */
   size_t size () const;
@@ -725,14 +725,14 @@ class Multiset
   /// \name Insertion functions.
 
   /*!
-   * Insert an object into the tree. [takes O(log n) operations]
+   * Insert an object into the tree. [takes \cgalBigO{log n} operations]
    * \param object The object to be inserted.
    * \return An iterator pointing to the inserted object.
    */
   iterator insert (const Type& object);
 
   /*!
-   * Insert a range of k objects into the tree. [takes O(k log n) operations]
+   * Insert a range of k objects into the tree. [takes \cgalBigO{k log n} operations]
    * \param first An iterator for the first object in the range.
    * \param last A past-the-end iterator for the range.
    */
@@ -751,7 +751,7 @@ class Multiset
 
   /*!
    * Insert an object to the tree, with a given hint to its position.
-   * [takes O(log n) operations at worst-case, but only O(1) amortized]
+   * [takes \cgalBigO{log n} operations at worst-case, but only \cgalBigO{1} amortized]
    * \param position A hint for the position of the object.
    * \param object The object to be inserted.
    * \return An iterator pointing to the inserted object.
@@ -761,7 +761,7 @@ class Multiset
 
   /*!
    * Insert an object to the tree, as the successor the given object.
-   * [takes O(log n) operations at worst-case, but only O(1) amortized]
+   * [takes \cgalBigO{log n} operations at worst-case, but only \cgalBigO{1} amortized]
    * \param position Points to the object after which the new object should
    *                 be inserted (or an invalid iterator to insert the object
    *                 as the tree minimum).
@@ -774,7 +774,7 @@ class Multiset
 
   /*!
    * Insert an object to the tree, as the predecessor the given object.
-   * [takes O(log n) operations at worst-case, but only O(1) amortized]
+   * [takes \cgalBigO{log n} operations at worst-case, but only \cgalBigO{1} amortized]
    * \param position Points to the object before which the new object should
    *                 be inserted (or an invalid iterator to insert the object
    *                 as the tree maximum).
@@ -789,7 +789,7 @@ class Multiset
   //@{
 
   /*!
-   * Erase objects from the tree. [takes O(log n) operations]
+   * Erase objects from the tree. [takes \cgalBigO{log n} operations]
    * \param object The object to be removed.
    * \return The number of objects removed from the tree.
    *          Note that all iterators to the erased objects become invalid.
@@ -798,7 +798,7 @@ class Multiset
 
   /*!
    * Remove the object pointed by the given iterator.
-   * [takes O(log n) operations at worst-case, but only O(1) amortized]
+   * [takes \cgalBigO{log n} operations at worst-case, but only \cgalBigO{1} amortized]
    * \param position An iterator pointing the object to be erased.
    * \pre The iterator must be a valid.
    *      Note that all iterators to the erased object become invalid.
@@ -806,7 +806,7 @@ class Multiset
   void erase (iterator position);
 
   /*!
-   * Clear the contents of the tree. [takes O(n) operations]
+   * Clear the contents of the tree. [takes \cgalBigO{n} operations]
    */
   void clear ();
 
@@ -817,7 +817,7 @@ class Multiset
 
   /*!
    * Search the tree for the given key (non-const version).
-   * [takes O(log n) operations]
+   * [takes \cgalBigO{log n} operations]
    * \param key The query key.
    * \param comp_key A comparison functor for comparing keys and objects.
    * \return A iterator pointing to the first equivalent object in the tree,
@@ -843,7 +843,7 @@ class Multiset
 
   /*!
    * Search the tree for the given key (const version).
-   * [takes O(log n) operations]
+   * [takes \cgalBigO{log n} operations]
    * \param key The query key.
    * \param comp_key A comparison functor for comparing keys and objects.
    * \return A iterator pointing to the first equivalent object in the tree,
@@ -869,7 +869,7 @@ class Multiset
 
   /*!
    * Count the number of object in the tree equivalent to a given key.
-   * [takes O(log n + d) operations]
+   * [takes \cgalBigO{log n + d} operations]
    * \param key The query key.
    * \param comp_key A comparison functor for comparing keys and objects.
    * \return The number of equivalent objects.
@@ -905,7 +905,7 @@ class Multiset
 
   /*!
    * Get the first element whose key is not less than a given key
-   * (non-const version). [takes O(log n) operations]
+   * (non-const version). [takes \cgalBigO{log n} operations]
    * \param key The query key.
    * \param comp_key A comparison functor for comparing keys and objects.
    * \return The lower bound of the key, or end() if the key is not found
@@ -931,7 +931,7 @@ class Multiset
 
   /*!
    * Get the first element whose key is not less than a given key
-   * (non-const version). [takes O(log n) operations]
+   * (non-const version). [takes \cgalBigO{log n} operations]
    * \param key The query key.
    * \param comp_key A comparison functor for comparing keys and objects.
    * \return The lower bound of the key, along with a flag indicating whether
@@ -957,7 +957,7 @@ class Multiset
 
   /*!
    * Get the first element whose key is greater than a given key
-   * (non-const version). [takes O(log n) operations]
+   * (non-const version). [takes \cgalBigO{log n} operations]
    * \param key The query key.
    * \param comp_key A comparison functor for comparing keys and objects.
    * \return The upper bound of the key, or end() if the key is not found
@@ -983,7 +983,7 @@ class Multiset
 
   /*!
    * Get the first element whose key is not less than a given key
-   * (const version). [takes O(log n) operations]
+   * (const version). [takes \cgalBigO{log n} operations]
    * \param key The query key.
    * \param comp_key A comparison functor for comparing keys and objects.
    * \return The lower bound of the key, or end() if the key is not found
@@ -1009,7 +1009,7 @@ class Multiset
 
   /*!
    * Get the first element whose key is not less than a given key
-   * (const version). [takes O(log n) operations]
+   * (const version). [takes \cgalBigO{log n} operations]
    * \param key The query key.
    * \param comp_key A comparison functor for comparing keys and objects.
    * \return The lower bound of the key, along with a flag indicating whether
@@ -1035,7 +1035,7 @@ class Multiset
 
   /*!
    * Get the first element whose key is greater than a given key
-   * (const version). [takes O(log n) operations]
+   * (const version). [takes \cgalBigO{log n} operations]
    * \param object The query object.
    * \return The upper bound of the key, or end() if the key is not found
    *         in the tree.
@@ -1060,7 +1060,7 @@ class Multiset
 
   /*!
    * Get the range of objects in the tree that are equivalent to a given key
-   * (non-const version). [takes O(log n + d) operations]
+   * (non-const version). [takes \cgalBigO{log n + d} operations]
    * \param key The query key.
    * \param comp_key A comparison functor for comparing keys and objects.
    * \return A pair of (lower_bound(key), upper_bound(key)).
@@ -1108,7 +1108,7 @@ class Multiset
 
   /*!
    * Get the range of objects in the tree that are equivalent to a given key
-   * (const version). [takes O(log n + d) operations]
+   * (const version). [takes \cgalBigO{log n + d} operations]
    * \param key The query key.
    * \param comp_key A comparison functor for comparing keys and objects.
    * \return A pair of (lower_bound(key), upper_bound(key)).
@@ -1163,7 +1163,7 @@ class Multiset
 
   /*!
    * Replace the object pointed by a given iterator with another object.
-   * [takes O(1) operations]
+   * [takes \cgalBigO{1} operations]
    * \param position An iterator pointing the object to be replaced.
    * \param object The new object.
    * \pre The given iterator is valid.
@@ -1174,7 +1174,7 @@ class Multiset
 
   /*!
    * Swap the location two objects in the tree, given by their positions.
-   * [takes O(1) operations]
+   * [takes \cgalBigO{1} operations]
    * \param pos1 An iterator pointing to the first object.
    * \param pos1 An iterator pointing to the second object.
    * \pre The two iterators are valid.
@@ -1184,7 +1184,7 @@ class Multiset
 
   /*!
    * Catenate the tree with a given tree, whose minimal object is not less
-   * than the maximal object of this tree. [takes O(log n) operations]
+   * than the maximal object of this tree. [takes \cgalBigO{log n} operations]
    * The function clears the other given tree, but all its iterators remain
    * valid and can be used with the catenated tree.
    * \param tree The tree to catenate to out tree.
@@ -1196,7 +1196,7 @@ class Multiset
   /*!
    * Split the tree such that all remaining objects are less than a given
    * key, and all objects greater than (or equal to) this key form
-   * a new output tree. [takes O(log n) operations]
+   * a new output tree. [takes \cgalBigO{log n} operations]
    * \param key The split key.
    * \param comp_key A comparison functor for comparing keys and objects.
    * \param tree Output: The tree that will eventually contain all objects
@@ -1220,7 +1220,7 @@ class Multiset
   /*!
    * Split the tree at a given position, such that it contains all objects
    * in the range [begin, position) and all objects in the range
-   * [position, end) form a new output tree. [takes O(log n) operations]
+   * [position, end) form a new output tree. [takes \cgalBigO{log n} operations]
    * \param position An iterator pointing at the split position.
    * \param tree Output: The output tree.
    * \pre The output tree is initially empty.
@@ -1240,13 +1240,13 @@ class Multiset
   bool is_valid() const;
 
   /*!
-   * Get the height of the tree. [takes O(n) operations]
+   * Get the height of the tree. [takes \cgalBigO{n} operations]
    * \return The length of the longest path from the root to a leaf node.
    */
   size_t height () const;
 
   /*!
-   * Get the black-height of the tree. [takes O(1) operations]
+   * Get the black-height of the tree. [takes \cgalBigO{1} operations]
    * \return The number of black nodes from the root to each leaf node.
    */
   inline size_t black_height () const
diff --git a/SearchStructures/doc/SearchStructures/CGAL/Range_tree_d.h b/SearchStructures/doc/SearchStructures/CGAL/Range_tree_d.h
index 74f308e00c7a..03b3bbb1c3b6 100644
--- a/SearchStructures/doc/SearchStructures/CGAL/Range_tree_d.h
+++ b/SearchStructures/doc/SearchStructures/CGAL/Range_tree_d.h
@@ -9,11 +9,11 @@ points that lie inside a given \f$ d\f$-dimensional interval.
 
 \cgalHeading{Implementation}
 
-The construction of a \f$ d\f$-dimensional range tree takes \f$ {O}(n\log n^{d-1})\f$
+The construction of a \f$ d\f$-dimensional range tree takes \cgalBigO{n\log n^{d-1}}
 time. The points in
-the query window are reported in time \f$ {O}(k+{\log}^d n )\f$, where \f$ k\f$
+the query window are reported in time \cgalBigO{k+{\log}^d n }, where \f$ k\f$
 is the number of reported points.
-The tree uses \f$ {O}(n\log n^{d-1})\f$ storage.
+The tree uses \cgalBigO{n\log n^{d-1}} storage.
 
 */
 template< typename Data, typename Window, typename Traits >
diff --git a/SearchStructures/doc/SearchStructures/CGAL/Segment_tree_d.h b/SearchStructures/doc/SearchStructures/CGAL/Segment_tree_d.h
index 21986c30679c..f440ab4dc29d 100644
--- a/SearchStructures/doc/SearchStructures/CGAL/Segment_tree_d.h
+++ b/SearchStructures/doc/SearchStructures/CGAL/Segment_tree_d.h
@@ -8,10 +8,10 @@ namespace CGAL {
 
 \cgalHeading{Implementation}
 
-A \f$ d\f$-dimensional segment tree is constructed in \f$ {O}(n\log n^d)\f$ time.
-An inverse range query is performed in time \f$ {O}(k+{\log}^d n )\f$, where \f$ k\f$
+A \f$ d\f$-dimensional segment tree is constructed in \cgalBigO{n\log n^d} time.
+An inverse range query is performed in time \cgalBigO{k+{\log}^d n }, where \f$ k\f$
 is the number of reported intervals.
-The tree uses \f$ {O}(n\log n^d)\f$ storage.
+The tree uses \cgalBigO{n\log n^d} storage.
 
 */
 template< typename Data, typename Window, typename Traits >
diff --git a/SearchStructures/doc/SearchStructures/SearchStructures.txt b/SearchStructures/doc/SearchStructures/SearchStructures.txt
index fd27bfc4fec1..e0eb1a4289b2 100644
--- a/SearchStructures/doc/SearchStructures/SearchStructures.txt
+++ b/SearchStructures/doc/SearchStructures/SearchStructures.txt
@@ -299,9 +299,9 @@ The 2-dimensional tree is a binary search tree on the first dimension. Each subl
 For the d-dimensional range tree, the figure shows one sublayer tree for each
 layer of the tree.
 
-The tree can be built in \f$ O(n\log^{d-1} n)\f$ time and
-needs \f$ O(n\log^{d-1} n)\f$ space. The ` d`-dimensional points that lie in the
-` d`-dimensional query interval can be reported in \f$ O(\log^dn+k)\f$ time,
+The tree can be built in \cgalBigO{n\log^{d-1} n} time and
+needs \cgalBigO{n\log^{d-1} n} space. The ` d`-dimensional points that lie in the
+` d`-dimensional query interval can be reported in \cgalBigO{\log^dn+k} time,
 where ` n` is the total number of points and ` k` is the number of
 reported points.
 
@@ -437,11 +437,11 @@ sublayer tree of a vertex `v` is a segment tree according to
 the second dimension of all data items of `v`.
 
 
-The tree can be built in \f$ O(n\log^{d} n)\f$ time and
-needs \f$ O(n\log^{d} n)\f$ space.
+The tree can be built in \cgalBigO{n\log^{d} n} time and
+needs \cgalBigO{n\log^{d} n} space.
 The processing time for inverse range
-queries in an ` d`-dimensional segment tree is \f$ O(\log^d n
-+k)\f$ time, where ` n` is the total number of intervals and ` k` is
+queries in an ` d`-dimensional segment tree is \cgalBigO{\log^d n
++k} time, where ` n` is the total number of intervals and ` k` is
 the number of reported intervals.
 
 One possible application of a two-dimensional segment tree is the
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2.txt b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2.txt
index 306fa9e2a91c..db694f9de60b 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2.txt
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2.txt
@@ -276,7 +276,7 @@ homogeneous coordinates of bit size at most \f$ 3b+O(1)\f$.
 The supporting lines of the segments (they are needed in some of
 the predicates) have coefficients which are always of bit size
 \f$ 2b+O(1)\f$. As a result, the bit size of the expressions involved in
-our predicates will always be \f$ O(b)\f$, independently of the
+our predicates will always be \cgalBigO{b}, independently of the
 size of the input.
 The `SegmentDelaunayGraphSite_2` concept encapsulates the ideas
 presented above. A site is represented in this concept by up to four
@@ -348,7 +348,7 @@ intersecting sites represented in homogeneous coordinates of bit size
 \f$ b\f$, the maximum bit size of the algebraic expressions involved in the
 predicates is \f$ 40 b+O(1)\f$. Given our site representation given above we
 can guarantee that even in the case of strongly intersecting sites,
-the algebraic degree of the predicates remains \f$ O(b)\f$, independently
+the algebraic degree of the predicates remains \cgalBigO{b}, independently
 of the size of the input. What we want to focus in the remainder of
 this section are the different kinds of filtering techniques that we
 have employed in our implementation.
diff --git a/Set_movable_separability_2/doc/Set_movable_separability_2/Set_movable_separability_2.txt b/Set_movable_separability_2/doc/Set_movable_separability_2/Set_movable_separability_2.txt
index c21ee4bd0f07..1fe21f703456 100644
--- a/Set_movable_separability_2/doc/Set_movable_separability_2/Set_movable_separability_2.txt
+++ b/Set_movable_separability_2/doc/Set_movable_separability_2/Set_movable_separability_2.txt
@@ -82,8 +82,8 @@ ill-condition.
 
 The implementation is based on an algorithm developed by Shamai and
 Halperin; see \cgalCite{cgal:ss-spfis-16} for the generalization of
-the algorithm to 3D. The time and space complexities are in \f$O(n)\f$
-and \f$O(1)\f$, respectively. In order to ensure robustness and
+the algorithm to 3D. The time and space complexities are in \cgalBigO{n}
+and \cgalBigO{1}, respectively. In order to ensure robustness and
 correctness you must use a kernel that guarantees exact
 constructions as well as exact predicates, e,g,.
 `Exact_predicates_exact_constructions_kernel`.
diff --git a/Solver_interface/include/CGAL/Eigen_sparse_matrix.h b/Solver_interface/include/CGAL/Eigen_sparse_matrix.h
index 20e8962bb152..8e123deeb527 100644
--- a/Solver_interface/include/CGAL/Eigen_sparse_matrix.h
+++ b/Solver_interface/include/CGAL/Eigen_sparse_matrix.h
@@ -202,8 +202,8 @@ struct Eigen_sparse_matrix
   /// Read access to a matrix coefficient.
   ///
   /// \warning Complexity:
-  /// - O(log(n)) if the matrix is already built.
-  /// - O(n) if the matrix is not built.
+  /// - \cgalBigO{log(n)} if the matrix is already built.
+  /// - \cgalBigO{n} if the matrix is not built.
   /// `n` being the number of entries in the matrix.
   ///
   /// \pre 0 <= i < row_dimension().
diff --git a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/K_means_clustering.h b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/K_means_clustering.h
index 60892a3a56ad..35ec3e2d3450 100644
--- a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/K_means_clustering.h
+++ b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/K_means_clustering.h
@@ -48,7 +48,7 @@ class Selector
    * T2 should be constructable by T1
    *
    * Implementation note: it is a variant of Floyd generator, and has uniform distribution
-   * where k = number of centers = complexity is O(k log k), and mem overhead is O(k)
+   * where k = number of centers = complexity is \cgalBigO{k log k}, and mem overhead is \cgalBigO{k}
    *
    * I also left previous implementation below, it might be useful where number of centers close to number of points
    */
@@ -78,7 +78,7 @@ class Selector
 
   // To future reference, I also left prev implementation which is a variant of Fisher–Yates shuffle, however to keep `points` intact I use another vector to
   // store and swap indices.
-  // where n = number of points; complexity = O(n), memory overhead = O(n)
+  // where n = number of points; complexity = \cgalBigO{n}, memory overhead = \cgalBigO{n}
   /*
   template<class T1, class T2>
   void forgy_initialization(std::size_t number_of_centers, const std::vector<T1>& points, std::vector<T2>& centers)
diff --git a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Surface_mesh_shortest_path.txt b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Surface_mesh_shortest_path.txt
index cce82b0061fc..9ea81028369f 100644
--- a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Surface_mesh_shortest_path.txt
+++ b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Surface_mesh_shortest_path.txt
@@ -46,7 +46,7 @@ type the property map must provide an index between 0 and the number of simplice
 the class `CGAL::Surface_mesh` as model of `FaceListGraph`.
 If you use the class `CGAL::Polyhedron_3`, you should use it with the item class `CGAL::Polyhedron_items_with_id_3`,
 for which default property maps are provided.
-This item class associates to each simplex an index that provides a \f$O(1)\f$ time access to the indices.
+This item class associates to each simplex an index that provides a \cgalBigO{1} time access to the indices.
 Note that the initialization of the property maps requires a call to `set_halfedgeds_items_id()`.
 
 The access to the embedding of each vertex is done using a point vertex property map associating to each vertex a 3D point.
@@ -111,7 +111,7 @@ the kernel's number type to `double`, using the `std::sqrt`, and converting it b
 with directly supports square roots to get the most precision of the shortest path computations.
 
 Using a kernel such as `CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt` with this package will indeed provide the exact shortest paths,
-but it will be extremely slow. Indeed, in order to compute the distance along the surface, it is necessary to unfold sequences of faces, edge-to-edge, out into a common plane.  The functor `SurfaceMeshShortestPathTraits::Construct_triangle_3_to_triangle_2_projection` provides an initial layout of the first face in a sequence, by rotating a given face into the `xy`-plane.  `SurfaceMeshShortestPathTraits::Construct_triangle_3_along_segment_2_flattening` unfolds a triangle into the plane, using a specified segment as a base.  Since this results in a chain of constructed triangles in the plane, the exact representation types used with this kernel (either `CORE::Expr` or `leda_real`) will process extremely slow, even on very simple inputs.  This is because the exact representations will effectively add an \f$O(n)\f$ factor to every computation.
+but it will be extremely slow. Indeed, in order to compute the distance along the surface, it is necessary to unfold sequences of faces, edge-to-edge, out into a common plane.  The functor `SurfaceMeshShortestPathTraits::Construct_triangle_3_to_triangle_2_projection` provides an initial layout of the first face in a sequence, by rotating a given face into the `xy`-plane.  `SurfaceMeshShortestPathTraits::Construct_triangle_3_along_segment_2_flattening` unfolds a triangle into the plane, using a specified segment as a base.  Since this results in a chain of constructed triangles in the plane, the exact representation types used with this kernel (either `CORE::Expr` or `leda_real`) will process extremely slow, even on very simple inputs.  This is because the exact representations will effectively add an \cgalBigO{n} factor to every computation.
 
 \section Surface_mesh_shortest_pathExamples Examples
 
diff --git a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h
index 0b94bf1d71cd..189bf48e16da 100644
--- a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h
+++ b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path.h
@@ -45,7 +45,7 @@ namespace CGAL {
 
 \brief Computes shortest surface paths from one or more source points on a surface mesh.
 
-\details Uses an optimized variation of Chen and Han's \f$ O(n^2) \f$ algorithm by Xin and Wang.
+\details Uses an optimized variation of Chen and Han's \cgalBigO{n^2} algorithm by Xin and Wang.
 Refer to those respective papers for the details of the implementation.
 
 \tparam Traits a model of `SurfaceMeshShortestPathTraits`.
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt b/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
index c77e981af711..4ce425fb91f2 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
@@ -53,7 +53,7 @@ Given a cycle drawn on a surface one can ask if the cycle can be continuously de
 The algorithm implemented in this package builds a data structure to efficiently answer queries of the following forms:
 - Given a combinatorial surface \f$\cal{M}\f$ and a closed combinatorial curve specified as a sequence of edges of \f$\cal{M}\f$, decide if the curve is homotopic to a simple one on \f$\cal{M}\f$.
 
-The algorithm used is based on a paper by Despré and Lazarus \cgalCite{cgal:dl-cginc-19}, providing a \f$O(n + l\log{l})\f$-time algorithm where \f$n\f$ is the complexity of \f$\cal{M}\f$ and \f$l\f$ is the length of the path.
+The algorithm used is based on a paper by Despré and Lazarus \cgalCite{cgal:dl-cginc-19}, providing a \cgalBigO{n + l\log{l}}-time algorithm where \f$n\f$ is the complexity of \f$\cal{M}\f$ and \f$l\f$ is the length of the path.
 
 \section SMTopology_HowToUse API Description
 
@@ -322,7 +322,7 @@ As the algorithm inductively builds orderings, it has to determine a relative or
  The red edge is being processed and is compared against the pink edge which is the first edge of the path. The blue and green edges are the first diverging pair when tracing backward. The dashed line means that edges have not been processed yet. Since the green edge lies to the right of the blue edge around the vertex, the red edge must be to the right of the pink edge in the ordering.
     \cgalFigureEnd
 
-The transverse orderings are stored in red-black trees, one for each edge of the quadrangulation. So each insertion or search takes \f$O(\log{l})\f$ time, where \f$l\f$ is the length of the closed curve.
+The transverse orderings are stored in red-black trees, one for each edge of the quadrangulation. So each insertion or search takes \cgalBigO{\log{l}} time, where \f$l\f$ is the length of the closed curve.
 
 \subsubsection SMTopology_Simplicity_Test_Verification Verify Ordering
 After computing a tentative ordering within the edges of the path, we have to verify that such an ordering could result in an intersection free arrangement. Since there is no intersection within an edge, we only need to verify this for each vertex in the quadrangulation. Each vertex is naturally associated with a circular ordering of the incident path edges by concatenating clockwise the orderings computed for every incident edge in the quadrangulation. We consider the two consecutive edges composing a turn (one going in the vertex, one going out of the vertex) at the vertex being verified as a <em>pair</em>. The ordering at the vertex is intersection free if and only if there is no two pairs crossing each other according to the clockwise ordering around the vertex. In other words, for any two pairs \f$(a, a')\f$ and \f$(b, b')\f$, none of the subsequences \f$a, b, a', b'\f$ or \f$a, b', a', b\f$ should appear in the clockwise ordering. This is very similar to verifying balanced parentheses in a string. We traverse clockwise at each vertex and use a stack-based algorithm to verify in linear time that the ordering produces a cycle without self-intersection.
diff --git a/Surface_sweep_2/doc/Surface_sweep_2/Surface_sweep_2.txt b/Surface_sweep_2/doc/Surface_sweep_2/Surface_sweep_2.txt
index 05eba3e97570..097490409ba1 100644
--- a/Surface_sweep_2/doc/Surface_sweep_2/Surface_sweep_2.txt
+++ b/Surface_sweep_2/doc/Surface_sweep_2/Surface_sweep_2.txt
@@ -13,7 +13,7 @@ namespace CGAL {
 Let \f$ {\mathcal C} = \{C_1, C_2, \ldots, C_n\}\f$ be a set of
 curves.  We wish to compute all intersection points between two curves
 in the set in an output-sensitive manner, without having to go over
-all \f$ O(n^2)\f$ curve pairs. To this end, we sweep an imaginary line
+all \cgalBigO{n^2} curve pairs. To this end, we sweep an imaginary line
 \f$ l\f$ from \f$ x = -\infty\f$ to \f$ x = \infty\f$ over the
 plane. While sweeping the plane, we keep track of the order of curves
 intersecting it.  This order changes at a finite number of <I>event
@@ -36,8 +36,8 @@ employs certified computations. This traits class must be a model of
 the `ArrangementTraits_2` concept - see the Chapter \ref
 chapterArrangement_on_surface_2 "2D Arrangements" for more details.
 
-The complexity of the surface-sweep algorithm is \f$ O((n +
-k)\log{n})\f$ where \f$ n\f$ is the number of the input curves and \f$
+The complexity of the surface-sweep algorithm is \cgalBigO{(n +
+k)\log{n}} where \f$ n\f$ is the number of the input curves and \f$
 k\f$ is the number of intersection points induced by these curves.
 
 \section Surface_sweep_2Example Example
diff --git a/Triangulation/doc/Triangulation/Triangulation.txt b/Triangulation/doc/Triangulation/Triangulation.txt
index c992f6d7cd31..dbe8b0c68a87 100644
--- a/Triangulation/doc/Triangulation/Triangulation.txt
+++ b/Triangulation/doc/Triangulation/Triangulation.txt
@@ -513,11 +513,11 @@ Then, for each point to insert, it locates it by walking in the triangulation,
 using the previously inserted vertex as a "hint". Finally, the point is
 inserted.
 In the worst case scenario, without spatial sort, the expected complexity is
-\f$ O(n^{\lceil\frac{d}{2}\rceil+1}) \f$.
+\cgalBigO{(n^{\lceil\frac{d}{2}\rceil+1}}$.
 When the algorithm is run on uniformly distributed points, the localization complexity is
-\f$ O(n^{\frac{1}{d}}) \f$ and the size of the triangulation is \f$ O(n) \f$, which gives
-a complexity of \f$ O(n^{1+\frac{1}{d}}) \f$ for the insertion.
-With spatial sort and random points, one can expect a complexity of \f$ O(n\log n) \f$.
+\cgalBigO{(n^{\frac{1}{d}}}$ and the size of the triangulation is \cgalBigO{(n}$, which gives
+a complexity of \cgalBigO{(n^{1+\frac{1}{d}}}$ for the insertion.
+With spatial sort and random points, one can expect a complexity of \cgalBigO{(n\log n}$.
 Please refer to \cgalCite{boissonnat2009Delaunay} for more details.
 
 We provide below (\cgalFigureRef{Triangulationfigbenchmarks100},
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Delaunay_triangulation_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Delaunay_triangulation_2.h
index 45a4fe12c20c..ec43542e73fe 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Delaunay_triangulation_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Delaunay_triangulation_2.h
@@ -54,20 +54,20 @@ All the types defined in `Triangulation_2<Traits,Tds>` are inherited.
 \cgalHeading{Implementation}
 
 Insertion is implemented by inserting in the triangulation, then
-performing a sequence of Delaunay flips. The number of flips is \f$ O(d)\f$
+performing a sequence of Delaunay flips. The number of flips is \cgalBigO{d}
 if the new vertex is of degree \f$ d\f$ in the new triangulation. For
-points distributed uniformly at random, insertion takes time \f$ O(1)\f$ on
+points distributed uniformly at random, insertion takes time \cgalBigO{1} on
 average.
 
 Removal calls the removal in the triangulation and then re-triangulates
 the hole in such a way that the Delaunay criterion is satisfied. Removal of a
-vertex of degree \f$ d\f$ takes time \f$ O(d^2)\f$.
-The degree \f$ d\f$ is \f$ O(1)\f$ for a random
+vertex of degree \f$ d\f$ takes time \cgalBigO{d^2}.
+The degree \f$ d\f$ is \cgalBigO{1} for a random
 vertex in the triangulation.
 
 After a point location step, the nearest neighbor
-is found in time \f$ O(n)\f$ in the
-worst case, but in time \f$ O(1)\f$
+is found in time \cgalBigO{n} in the
+worst case, but in time \cgalBigO{1}
 for vertices distributed uniformly at random and any query point.
 
 \sa `CGAL::Triangulation_2<Traits,Tds>`
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_2.h
index f892df6a10c4..570114a5b999 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_2.h
@@ -137,20 +137,20 @@ for faces of maximal dimension instead of faces.
 Locate is implemented by a line walk from a vertex of the face given
 as optional parameter (or from a finite vertex of
 `infinite_face()` if no optional parameter is given). It takes
-time \f$ O(n)\f$ in the worst case, but only \f$ O(\sqrt{n})\f$
+time \cgalBigO{n} in the worst case, but only \cgalBigO{\sqrt{n}}
 on average if the vertices are distributed uniformly at random.
 
 Insertion of a point is done by locating a face that contains the
 point, and then splitting this face.
 If the point falls outside the convex hull, the triangulation
 is restored by flips. Apart from the location, insertion takes a time
-time \f$ O(1)\f$. This bound is only an amortized bound
+time \cgalBigO{1}. This bound is only an amortized bound
 for points located outside the convex hull.
 
 Removal of a vertex is done by removing all adjacent triangles, and
-re-triangulating the hole. Removal takes time \f$ O(d^2)\f$ in the worst
+re-triangulating the hole. Removal takes time \cgalBigO{d^2} in the worst
 case, if \f$ d\f$ is the degree of the removed vertex,
-which is \f$ O(1)\f$ for a random vertex.
+which is \cgalBigO{1} for a random vertex.
 
 The face, edge, and vertex iterators on finite features
 are derived from their counterparts visiting all (finite and infinite)
diff --git a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
index 1c9dc8781e24..249c5a0117de 100644
--- a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
+++ b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
@@ -412,7 +412,7 @@ The walk begins at a vertex of the face which
 is given
 as an optional argument or at an arbitrary vertex of the triangulation
 if no optional argument is given. It takes
-time \f$ O(n)\f$ in the worst case for Delaunay Triangulations, but only \f$ O(\sqrt{n})\f$
+time \cgalBigO{n} in the worst case for Delaunay Triangulations, but only \cgalBigO{\sqrt{n}}
 on average if the vertices are distributed uniformly at random.
 The class `Triangulation_hierarchy_2<Traits,Tds>`,
 described in section \ref Section_2D_Triangulations_Hierarchy,
@@ -423,14 +423,14 @@ Insertion of a point is done by locating a face that contains the
 point, and splitting this face into three new faces.
 If the point falls outside the convex hull, the triangulation
 is restored by flips. Apart from the location, insertion takes a
-time \f$ O(1)\f$. This bound is only an amortized bound
+time \cgalBigO{1}. This bound is only an amortized bound
 for points located outside the convex hull.
 
 Removal of a vertex is done by removing all adjacent triangles, and
 re-triangulating the hole. Removal takes a time at most proportional to
 \f$ d^2\f$, where
 \f$ d\f$ is the degree of the removed vertex,
-which is \f$ O(1)\f$ for a random vertex.
+which is \cgalBigO{1} for a random vertex.
 
 Displacement of a vertex is done by: first, verifying if the triangulation embedding
 remains planar after the displacement; if yes the vertex is directly placed at the new location; otherwise, a point is inserted at the new location
@@ -592,18 +592,18 @@ The insertion of a new point in the Delaunay triangulation
 is performed using first the insertion member function
 of the basic triangulation and second
 performing a sequence of flips to restore the Delaunay property.
-The number of flips that have to be performed is \f$ O(d)\f$
+The number of flips that have to be performed is \cgalBigO{d}
 if the new vertex has degree \f$ d\f$ in the updated
 Delaunay triangulation. For
 points distributed uniformly at random,
-each insertion takes time \f$ O(1)\f$ on
+each insertion takes time \cgalBigO{1} on
 average, once the point has been located in the triangulation.
 
 Removal calls the removal in the triangulation and then re-triangulates
 the hole created in such a way that the Delaunay criterion is
 satisfied. Removal of a
-vertex of degree \f$ d\f$ takes time \f$ O(d^2)\f$.
-The degree \f$ d\f$ is \f$ O(1)\f$ for a random
+vertex of degree \f$ d\f$ takes time \cgalBigO{d^2}.
+The degree \f$ d\f$ is \cgalBigO{1} for a random
 vertex in the triangulation.
 When the degree of the removed vertex is small (\f$ \leq7\f$) a special
 procedure is used that allows to decrease global removal time by a factor of 2
@@ -611,14 +611,14 @@ for random points \cgalCite{d-vrtdd-09}.
 
 The displacement of a vertex \f$ v\f$ at a point \f$ p\f$ to a new location \f$ p'\f$, first checks whether the triangulation embedding remains
 planar or not after moving \f$ v\f$ to \f$ p'\f$. If yes, it moves \f$ v\f$ to \f$ p'\f$ and simply performs a sequence of flips
-to restore the Delaunay property, which is \f$ O(d)\f$ where \f$ d\f$ is the degree of the vertex after the displacement.
+to restore the Delaunay property, which is \cgalBigO{d} where \f$ d\f$ is the degree of the vertex after the displacement.
 Otherwise, the displacement is done by inserting a vertex at the new location,
 and removing the obsolete vertex.
-The complexity is \f$ O(n)\f$ in the worst case, but only \f$ O(1 + \delta \sqrt{n})\f$ for evenly distributed vertices in the unit square, where \f$ \delta\f$ is the Euclidean distance between the new and old locations.
+The complexity is \cgalBigO{n} in the worst case, but only \cgalBigO{1 + \delta \sqrt{n}} for evenly distributed vertices in the unit square, where \f$ \delta\f$ is the Euclidean distance between the new and old locations.
 
 After having performed a point location, the
-nearest neighbor of a point is found in time \f$ O(n)\f$ in the
-worst case, but in time \f$ O(1)\f$
+nearest neighbor of a point is found in time \cgalBigO{n} in the
+worst case, but in time \cgalBigO{1}
 for vertices distributed uniformly at random and any query point.
 
 \subsection Subsection_2D_Triangulations_Delaunay_Terrain Example: a Delaunay Terrain
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_3.h
index 1b185f5383f3..ba49e83c87ab 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_3.h
@@ -19,14 +19,14 @@ respectively.
 
 \tparam LP is a tag which must be a `Location_policy<Tag>`:
 either `CGAL::Fast_location` or `CGAL::Compact_location`.
-`CGAL::Fast_location` offers faster (\f$ O(\log n)\f$ time) point
+`CGAL::Fast_location` offers faster (\cgalBigO{\log n} time) point
 location, which can be beneficial when performing point locations or random
 point insertions (with no good location hint) in large data sets.
 It is currently implemented using an additional triangulation
 hierarchy data structure \cgalCite{cgal:d-dh-02}.
 The default is `CGAL::Compact_location`, which saves memory (3-5%) by avoiding the need for this
 separate data structure, and point location is then performed roughly in
-\f$ O(n^{1/3})\f$ time.
+\cgalBigO{n^{1/3}} time.
 If the triangulation is parallel (see user manual), the default compact
 location policy must be used.
 Note that this argument can also come in second position, which can be useful when
diff --git a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
index f8ebae52e971..0b1170a552ed 100644
--- a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
+++ b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
@@ -841,7 +841,7 @@ system when clearing or destroying the triangulation. This can be important
 for algorithms like simplifications of data sets which will produce fragmented
 memory usage (doing fresh copies of the data structures are one way out in such
 cases). The asymptotic memory overhead of `Compact_container` for its
-internal bookkeeping is otherwise on the order of \f$ O(\sqrt{n})\f$.
+internal bookkeeping is otherwise on the order of \cgalBigO{\sqrt{n}}.
 
 \cgalFigureRef{Triangulation3figmemory} shows the number of bytes used per
 points, as measured empirically using `Memory_sizer` for large triangulations
diff --git a/Visibility_2/doc/Visibility_2/CGAL/Rotational_sweep_visibility_2.h b/Visibility_2/doc/Visibility_2/CGAL/Rotational_sweep_visibility_2.h
index 3ad8ae611443..fcaf29e1a7cd 100644
--- a/Visibility_2/doc/Visibility_2/CGAL/Rotational_sweep_visibility_2.h
+++ b/Visibility_2/doc/Visibility_2/CGAL/Rotational_sweep_visibility_2.h
@@ -5,7 +5,7 @@ namespace CGAL {
 \brief This class is a model of the concept `Visibility_2` can answer visibility queries within a polygon that may have holes.
 
 
-\details The algorithm does not require preprocessing. It relies on the algorithm of T. Asano \cite ta-aeafvpprh-85 based on angular plane sweep, with a time complexity of \f$O (n \log n)\f$ in the number of vertices.
+\details The algorithm does not require preprocessing. It relies on the algorithm of T. Asano \cite ta-aeafvpprh-85 based on angular plane sweep, with a time complexity of \cgalBigO{n \log n} in the number of vertices.
 
 
 \tparam Arrangement_2_ is the type used to represent the input environment.
@@ -63,7 +63,7 @@ class Rotational_sweep_visibility_2 {
 /*!
 Attaches the given arrangement to the visibility object.
 
-This operation takes \f$O(1)\f$ as the class does no pre-processing.
+This operation takes \cgalBigO{1} as the class does no pre-processing.
 
 In case the object is already attached to another arrangement,
 the visibility object gets detached before being attached to `arr`.
diff --git a/Visibility_2/doc/Visibility_2/CGAL/Simple_polygon_visibility_2.h b/Visibility_2/doc/Visibility_2/CGAL/Simple_polygon_visibility_2.h
index f073ea8cc24b..daa988c11b2d 100644
--- a/Visibility_2/doc/Visibility_2/CGAL/Simple_polygon_visibility_2.h
+++ b/Visibility_2/doc/Visibility_2/CGAL/Simple_polygon_visibility_2.h
@@ -12,7 +12,7 @@ It computes the visibility region from a viewpoint that is in the interior or on
 While scanning the boundary the algorithm uses a stack to manipulate the vertices, and ultimately
 yields the visibility region. For each scanned edge, at most 2 points are pushed onto the stack.
 Overall, at most 2\f$ n \f$ points are pushed or popped. Thus, the time and space complexities of the
-algorithm are \f$ O(n) \f$ even in case of degeneracies such as needles, where \f$ n \f$
+algorithm are \cgalBigO{n}$ even in case of degeneracies such as needles, where \f$ n \f$
 is the number of the vertices of the polygon.
 
 \tparam Arrangement_2_ is the type used to represent the input environment.
@@ -67,7 +67,7 @@ class Simple_polygon_visibility_2 {
 /*!
 Attaches the given arrangement to the visibility object.
 
-This operation takes \f$O(1)\f$ as the class does no pre-processing.
+This operation takes \cgalBigO{1} as the class does no pre-processing.
 
 In case the object is already attached to another arrangement,
 the visibility object gets detached before being attached to `arr`.
diff --git a/Visibility_2/doc/Visibility_2/CGAL/Triangular_expansion_visibility_2.h b/Visibility_2/doc/Visibility_2/CGAL/Triangular_expansion_visibility_2.h
index 178a812957dc..6606de87dfa4 100644
--- a/Visibility_2/doc/Visibility_2/CGAL/Triangular_expansion_visibility_2.h
+++ b/Visibility_2/doc/Visibility_2/CGAL/Triangular_expansion_visibility_2.h
@@ -6,8 +6,8 @@ namespace CGAL {
 
 \details The algorithm obtains a constrained triangulation from the input arrangement, then computes visibility by
 expanding the triangle that contains the query point.
-Preprocessing takes \f$ O(n)\f$ time and \f$ O(n) \f$ space, where \f$ n \f$ is the number of vertices of input polygon.
-The query time is \f$ O(nh)\f$, where \f$ h \f$ is the number of holes+1 of input polygon. Thus, for simple polygons (or a polygon with a constant number of holes) the algorithm complexity is linear, but it is \f$ O(n^2)\f$ in the worst case, as the number of holes can be linear in \f$ n \f$.
+Preprocessing takes \cgalBigO{n} time and \cgalBigO{n}$ space, where \f$ n \f$ is the number of vertices of input polygon.
+The query time is \cgalBigO{nh}, where \f$ h \f$ is the number of holes+1 of input polygon. Thus, for simple polygons (or a polygon with a constant number of holes) the algorithm complexity is linear, but it is \cgalBigO{n^2} in the worst case, as the number of holes can be linear in \f$ n \f$.
 
 
 \tparam Arrangement_2_ is the type used to represent the input environment.
@@ -63,7 +63,7 @@ class Triangular_expansion_visibility_2 {
 
 /*!
 Attaches the given arrangement to the visibility object and computes the restricted triangulation.
-This takes \f$ O(n) \f$ time, where \f$ n \f$ is the number of vertices.
+This takes \cgalBigO{n}$ time, where \f$ n \f$ is the number of vertices.
 
 From this moment on the class observes changes in the arrangement. If the arrangement changes
 a new restricted triangulation is computed. Re-attaching forces re-computation.
diff --git a/Visibility_2/doc/Visibility_2/visibility_2.txt b/Visibility_2/doc/Visibility_2/visibility_2.txt
index 891d813009fd..d0dcdc09c49b 100644
--- a/Visibility_2/doc/Visibility_2/visibility_2.txt
+++ b/Visibility_2/doc/Visibility_2/visibility_2.txt
@@ -74,9 +74,9 @@ The following models of the `Visibility_2` concept are provided:
 <CENTER>
 Class                                 |        Function                                     |  Preprocessing                |  Query                            |Algorithm
 -------------------------------|-----------------------------------------------------|-------------------------------|-----------------------------------|-------------------------------
- `Simple_polygon_visibility_2`       | simple polygons                  |       No        |\f$ O(n) \f$ time and \f$ O(n) \f$ space  | B. Joe and R. B. Simpson \cite bjrb-clvpa-87
- `Rotational_sweep_visibility_2`        |  polygons with holes | No                     | \f$ O(n\log n) \f$ time and \f$ O(n) \f$ space |  T. Asano \cite ta-aeafvpprh-85
-`Triangular_expansion_visibility_2`     |  polygons with  holes |  \f$ O(n) \f$ time and \f$ O(n) \f$ space | \f$ O(nh) \f$ time and \f$ O(n) \f$ space.   | Bungiu et al.  \cite ecvp-bhhhk-14
+ `Simple_polygon_visibility_2`       | simple polygons                  |       No        |\cgalBigO{n}$ time and \cgalBigO{n}$ space  | B. Joe and R. B. Simpson \cite bjrb-clvpa-87
+ `Rotational_sweep_visibility_2`        |  polygons with holes | No                     | \cgalBigO{n\log n}$ time and \cgalBigO{n}$ space |  T. Asano \cite ta-aeafvpprh-85
+`Triangular_expansion_visibility_2`     |  polygons with  holes |  \cgalBigO{n}$ time and \cgalBigO{n}$ space | \cgalBigO{nh}$ time and \cgalBigO{n}$ space.   | Bungiu et al.  \cite ecvp-bhhhk-14
 </CENTER>
 
 Where \f$ n \f$ denotes the number of vertices of \f$ f \f$ and \f$ h \f$ the number of holes+1.
@@ -158,4 +158,4 @@ During Google Summer of Code 2014 Ning Xu fixed a bug in `CGAL::Simple_polygon_v
 
 }
 
-// `Preprocessed_rotational_sweep_visibility_2` | polygons with holes    | \f$ O(n^2) \f$ time and \f$ O(n^2) \f$ space | \f$ O(n) \f$ time and \f$ O(n) \f$ space   | Takao Asano, Tetsuo Asano  etc \cite aaghi-vpsesp-85
+// `Preprocessed_rotational_sweep_visibility_2` | polygons with holes    | \cgalBigO{n^2}$ time and \cgalBigO{n^2}$ space | \cgalBigO{n}$ time and \cgalBigO{n}$ space   | Takao Asano, Tetsuo Asano  etc \cite aaghi-vpsesp-85

From 75a03661609a04949cf81adfbd0f1b30281cfc4e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 5 Jul 2023 08:44:38 +0100
Subject: [PATCH 0449/1398] Surface_mesh_approximation: Deal with boundary
 edges

---
 .../internal/parameters_interface.h           |   1 +
 .../CGAL/Variational_shape_approximation.h    | 119 ++++++++++--------
 2 files changed, 68 insertions(+), 52 deletions(-)

diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index 7792ad5cdb60..d88c06a5f5ea 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -222,6 +222,7 @@ CGAL_add_named_parameter(number_of_relaxations_t, number_of_relaxations, number_
 CGAL_add_named_parameter(use_convex_hull_t, use_convex_hull, use_convex_hull)
 
 // meshing parameters
+CGAL_add_named_parameter(boundary_subdivision_ratio_t, boundary_subdivision_ratio, boundary_subdivision_ratio)
 CGAL_add_named_parameter(subdivision_ratio_t, subdivision_ratio, subdivision_ratio)
 CGAL_add_named_parameter(relative_to_chord_t, relative_to_chord, relative_to_chord)
 CGAL_add_named_parameter(with_dihedral_angle_t, with_dihedral_angle, with_dihedral_angle)
diff --git a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
index 566aec602d73..e7c4a2a8a318 100644
--- a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
+++ b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
@@ -795,6 +795,12 @@ class Variational_shape_approximation {
    *     \cgalParamDefault{`5.0`}
    *   \cgalParamNEnd
    *
+   *   \cgalParamNBegin{boundary_subdivision_ratio}
+   *     \cgalParamDescription{the chord subdivision ratio threshold to the chord length or average edge length for boundary edges}
+   *     \cgalParamType{`geom_traits::FT`}
+   *     \cgalParamDefault{`5.0`}
+   *   \cgalParamNEnd
+   *
    *   \cgalParamNBegin{relative_to_chord}
    *     \cgalParamDescription{If `true`, the `subdivision_ratio` is the ratio of the furthest vertex distance
    *                           to the chord length, otherwise is the average edge length}
@@ -827,6 +833,7 @@ class Variational_shape_approximation {
     using parameters::choose_parameter;
 
     const FT subdivision_ratio = choose_parameter(get_parameter(np, internal_np::subdivision_ratio), FT(5.0));
+    const FT boundary_subdivision_ratio = choose_parameter(get_parameter(np, internal_np::boundary_subdivision_ratio), FT(5.0));
     const bool relative_to_chord = choose_parameter(get_parameter(np, internal_np::relative_to_chord), false);
     const bool with_dihedral_angle = choose_parameter(get_parameter(np, internal_np::with_dihedral_angle), false);
     const bool optimize_anchor_location = choose_parameter(get_parameter(np, internal_np::optimize_anchor_location), true);
@@ -848,7 +855,7 @@ class Variational_shape_approximation {
 
     // generate anchors
     find_anchors();
-    find_edges(subdivision_ratio, relative_to_chord, with_dihedral_angle);
+    find_edges(subdivision_ratio, boundary_subdivision_ratio, relative_to_chord, with_dihedral_angle);
     add_anchors();
 
     // discrete constrained Delaunay triangulation
@@ -1519,6 +1526,7 @@ class Variational_shape_approximation {
    * @param with_dihedral_angle if set to `true`, add dihedral angle weight to the distance.
    */
   void find_edges(const FT subdivision_ratio,
+    const FT boundary_subdivision_ratio,
     const bool relative_to_chord,
     const bool with_dihedral_angle) {
     // collect candidate halfedges in a set
@@ -1550,7 +1558,7 @@ class Variational_shape_approximation {
         Boundary_chord chord;
         walk_to_next_anchor(he_start, chord);
         m_bcycles.back().num_anchors += subdivide_chord(chord.begin(), chord.end(),
-          subdivision_ratio, relative_to_chord, with_dihedral_angle);
+            subdivision_ratio, boundary_subdivision_ratio, relative_to_chord, with_dihedral_angle);
 
 #ifdef CGAL_SURFACE_MESH_APPROXIMATION_DEBUG
         std::cerr << "#chord_anchor " << m_bcycles.back().num_anchors << std::endl;
@@ -1846,6 +1854,7 @@ class Variational_shape_approximation {
     const Boundary_chord_iterator &chord_begin,
     const Boundary_chord_iterator &chord_end,
     const FT subdivision_ratio,
+    const FT boundary_subdivision_ratio,
     const bool relative_to_chord,
     const bool with_dihedral_angle) {
     const std::size_t chord_size = std::distance(chord_begin, chord_end);
@@ -1854,6 +1863,8 @@ class Variational_shape_approximation {
     const std::size_t anchor_first = get(m_vanchor_map, source(he_first, *m_ptm));
     const std::size_t anchor_last = get(m_vanchor_map, target(he_last, *m_ptm));
 
+    bool is_boundary = is_border_edge(he_first, *m_ptm);
+
     // do not subdivide trivial non-circular chord
     if ((anchor_first != anchor_last) && (chord_size < 4))
       return 1;
@@ -1879,67 +1890,71 @@ class Variational_shape_approximation {
       if_subdivide = true;
     }
     else {
-      FT dist_max(0.0);
-      Vector_3 chord_vec = vector_functor(pt_begin, pt_end);
-      const FT chord_len = CGAL::approximate_sqrt(chord_vec.squared_length());
-      bool degenerate_chord = false;
-      if (chord_len > FT(0.0)) {
-        chord_vec = scale_functor(chord_vec, FT(1.0) / chord_len);
-        for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
-          Vector_3 vec = vector_functor(pt_begin, m_vpoint_map[target(*citr, *m_ptm)]);
-          vec = cross_product_functor(chord_vec, vec);
-          const FT dist = CGAL::approximate_sqrt(vec.squared_length());
-          if (dist > dist_max) {
-            chord_max = citr;
-            dist_max = dist;
-          }
+        FT dist_max(0.0);
+        Vector_3 chord_vec = vector_functor(pt_begin, pt_end);
+        const FT chord_len = CGAL::approximate_sqrt(chord_vec.squared_length());
+        bool degenerate_chord = false;
+        if (chord_len > FT(0.0)) {
+            chord_vec = scale_functor(chord_vec, FT(1.0) / chord_len);
+            for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
+                Vector_3 vec = vector_functor(pt_begin, m_vpoint_map[target(*citr, *m_ptm)]);
+                vec = cross_product_functor(chord_vec, vec);
+                const FT dist = CGAL::approximate_sqrt(vec.squared_length());
+                if (dist > dist_max) {
+                    chord_max = citr;
+                    dist_max = dist;
+                }
+            }
         }
-      }
-      else {
-        degenerate_chord = true;
-        for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
-          const FT dist = CGAL::approximate_sqrt(CGAL::squared_distance(
-            pt_begin, m_vpoint_map[target(*citr, *m_ptm)]));
-          if (dist > dist_max) {
-            chord_max = citr;
-            dist_max = dist;
-          }
+        else {
+            degenerate_chord = true;
+            for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
+                const FT dist = CGAL::approximate_sqrt(CGAL::squared_distance(
+                    pt_begin, m_vpoint_map[target(*citr, *m_ptm)]));
+                if (dist > dist_max) {
+                    chord_max = citr;
+                    dist_max = dist;
+                }
+            }
         }
-      }
 
-      FT criterion = dist_max;
-      if (relative_to_chord && !degenerate_chord)
-        criterion /= chord_len;
-      else
-        criterion /= m_average_edge_length;
-
-      if (with_dihedral_angle) {
-        // suppose the proxy normal angle is acute
-        std::size_t px_left = get(m_fproxy_map, face(he_first, *m_ptm));
-        std::size_t px_right = px_left;
-        if (!CGAL::is_border(opposite(he_first, *m_ptm), *m_ptm))
-          px_right = get(m_fproxy_map, face(opposite(he_first, *m_ptm), *m_ptm));
-        FT norm_sin(1.0);
-        if (!CGAL::is_border(opposite(he_first, *m_ptm), *m_ptm)) {
-          Vector_3 vec = cross_product_functor(
-            m_px_planes[px_left].normal, m_px_planes[px_right].normal);
-          norm_sin = CGAL::approximate_sqrt(vec.squared_length());
+        FT criterion = dist_max;
+        if (relative_to_chord && !degenerate_chord)
+            criterion /= chord_len;
+        else
+            criterion /= m_average_edge_length;
+
+        if (with_dihedral_angle) {
+            // suppose the proxy normal angle is acute
+            std::size_t px_left = get(m_fproxy_map, face(he_first, *m_ptm));
+            std::size_t px_right = px_left;
+            if (!CGAL::is_border(opposite(he_first, *m_ptm), *m_ptm))
+                px_right = get(m_fproxy_map, face(opposite(he_first, *m_ptm), *m_ptm));
+            FT norm_sin(1.0);
+            if (!CGAL::is_border(opposite(he_first, *m_ptm), *m_ptm)) {
+                Vector_3 vec = cross_product_functor(
+                    m_px_planes[px_left].normal, m_px_planes[px_right].normal);
+                norm_sin = CGAL::approximate_sqrt(vec.squared_length());
+            }
+            criterion *= norm_sin;
+        }
+        if (is_boundary) {
+            if (criterion > boundary_subdivision_ratio)
+                if_subdivide = true;
+        }
+        else {
+            if (criterion > subdivision_ratio)
+                if_subdivide = true;
         }
-        criterion *= norm_sin;
-      }
-
-      if (criterion > subdivision_ratio)
-        if_subdivide = true;
     }
-
     if (if_subdivide) {
       // subdivide at the most remote vertex
       attach_anchor(*chord_max);
 
       const std::size_t num_left = subdivide_chord(chord_begin, chord_max + 1,
-        subdivision_ratio, relative_to_chord, with_dihedral_angle);
+        subdivision_ratio, boundary_subdivision_ratio, relative_to_chord, with_dihedral_angle);
       const std::size_t num_right = subdivide_chord(chord_max + 1, chord_end,
-        subdivision_ratio, relative_to_chord, with_dihedral_angle);
+        subdivision_ratio, boundary_subdivision_ratio, relative_to_chord, with_dihedral_angle);
 
       return num_left + num_right;
     }

From 72044ffed4ef0ab1f6d3b580b41616258d294b69 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 5 Jul 2023 09:54:22 +0200
Subject: [PATCH 0450/1398] move test to make sure it is not re-added later

---
 .../developer_scripts/run_testsuite_with_ctest | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/Scripts/developer_scripts/run_testsuite_with_ctest b/Scripts/developer_scripts/run_testsuite_with_ctest
index b86a5b9f705e..3e13edc6a7e3 100644
--- a/Scripts/developer_scripts/run_testsuite_with_ctest
+++ b/Scripts/developer_scripts/run_testsuite_with_ctest
@@ -105,13 +105,6 @@ collect_all_current_platforms()
 build_platforms_list()
 {
   for LOCAL_PLATFORM in $1; do
-    # MSVC2015 does not support C++17
-    if [ $2 \> "CGAL-6.0" ]; then
-      if [ "LOCAL_PLATFORM" = "MSVC2015-Release-64bits" ]; then
-        continue
-      fi
-    fi
-
     if [ "${LOCAL_PLATFORM}" = "all" ] ; then
       USE_REFERENCE_PLATFORMS='y'
     else
@@ -177,8 +170,8 @@ setup_dirs()
   # directories existing in the reference release are added to $PLATFORMS
   #
   PLATFORMS=""
-  build_platforms_list "`value_of BUILD_ON_${HOST}`" "${CGAL_RELEASE_ID}"
-  build_platforms_list "`value_of COMPILERS_${HOST}`" "${CGAL_RELEASE_ID}"
+  build_platforms_list "`value_of BUILD_ON_${HOST}`"
+  build_platforms_list "`value_of COMPILERS_${HOST}`"
 
   if [ -n "${USE_REFERENCE_PLATFORMS}" ]; then
     collect_all_reference_platforms
@@ -186,6 +179,13 @@ setup_dirs()
 
   for PLATFORM in ${PLATFORMS}; do
 
+    # MSVC2015 does not support C++17
+    if [ "${CGAL_RELEASE_ID}" \> "CGAL-6.0" ]; then
+      if [ "PLATFORM" = "MSVC2015-Release-64bits" ]; then
+        continue
+      fi
+    fi
+
     CGAL_BINARY_DIR=${CGAL_BINARY_DIR_BASE}/${PLATFORM}
 
     if [ ! -d "${CGAL_BINARY_DIR}" ]; then

From c0db92d0e906cc78495e70c75bfef06c4e063768 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Wed, 5 Jul 2023 12:13:40 +0200
Subject: [PATCH 0451/1398] issue #7395 Improvement of layout of model
 relations

Consistent implementation for the `AABB_tree` in respect to `Has Model` and `Is Model Of`
---
 AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h     |  2 +-
 AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h      | 11 ++++++-----
 .../AABB_tree/Concepts/AABBPrimitiveWithSharedData.h  |  7 ++++---
 .../Concepts/AABBRayIntersectionGeomTraits.h          |  2 +-
 .../AABB_tree/Concepts/AABBRayIntersectionTraits.h    |  3 ++-
 AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h         |  3 ++-
 .../include/CGAL/AABB_face_graph_triangle_primitive.h |  2 +-
 .../CGAL/AABB_halfedge_graph_segment_primitive.h      |  4 ++--
 .../include/CGAL/AABB_polyhedron_segment_primitive.h  |  2 +-
 .../include/CGAL/AABB_polyhedron_triangle_primitive.h |  2 +-
 AABB_tree/include/CGAL/AABB_primitive.h               |  4 ++--
 AABB_tree/include/CGAL/AABB_segment_primitive.h       |  2 +-
 AABB_tree/include/CGAL/AABB_traits.h                  |  5 ++---
 AABB_tree/include/CGAL/AABB_triangle_primitive.h      |  2 +-
 .../CGAL/AABB_triangulation_3_triangle_primitive.h    |  2 +-
 Documentation/doc/resources/1.8.13/BaseDoxyfile.in    | 10 ++++++++++
 Documentation/doc/resources/1.9.6/BaseDoxyfile.in     | 10 ++++++++++
 17 files changed, 48 insertions(+), 25 deletions(-)

diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
index 2f1fdc3e5c6b..75823eb238ae 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
@@ -11,7 +11,7 @@ and the primitives stored in the AABB tree.
 
 \cgalRefines{SearchGeomTraits_3}
 
-\cgalHasModel All models of the concept `Kernel`
+\cgalHasModelsBare{All models of the concept `Kernel`}
 
 \sa `CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>`
 \sa `CGAL::AABB_tree<AABBTraits>`
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h
index 11195b5808ec..4a987a58cbb2 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h
@@ -12,11 +12,12 @@ The concept `AABBPrimitive` describes the requirements for the primitives stored
 
 The `Primitive` type can be, e.g., a wrapper around a `Handle`. Assume for instance that the input objects are the triangle faces of a mesh stored as a `CGAL::Polyhedron_3`. The `Datum` would be a `Triangle_3` and the `Id` would be a polyhedron `Face_handle`. Method `datum()` can return either a `Triangle_3` constructed on the fly from the face handle or a `Triangle_3` stored internally. This provides a way for the user to trade memory for efficiency.
 
-\cgalHasModel `CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_false,CacheDatum>`
-\cgalHasModel `CGAL::AABB_segment_primitive<Iterator,CacheDatum>`
-\cgalHasModel `CGAL::AABB_triangle_primitive<Iterator,CacheDatum>`
-\cgalHasModel `CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_false,CacheDatum>`
-\cgalHasModel `CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_false,CacheDatum>`
+\cgalHasModelsBegin CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_false,CacheDatum>
+\cgalHasModels CGAL::AABB_segment_primitive<Iterator,CacheDatum>
+\cgalHasModels CGAL::AABB_triangle_primitive<Iterator,CacheDatum>
+\cgalHasModels CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_false,CacheDatum>
+\cgalHasModels CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_false,CacheDatum>
+\cgalHasModelsEnd
 */
 
 class AABBPrimitive {
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h
index 3c47d53d5529..8ec9a103acdc 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h
@@ -21,9 +21,10 @@ The `Datum` would be a `Triangle_3` and the `Id` a `std::size_t`. The shared dat
 `std::vector<Triangle_3>`.
 The method `datum(const Shared_data&)` then returns a triangle from the vector.
 
-\cgalHasModel `CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_true,CacheDatum>`
-\cgalHasModel `CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_true,CacheDatum>`
-\cgalHasModel `CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_true,CacheDatum>`
+\cgalHasModelsBegin CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_true,CacheDatum>
+\cgalHasModels CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_true,CacheDatum>
+\cgalHasModels CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_true,CacheDatum>
+\cgalHasModelsEnd
 */
 
 class AABBPrimitiveWithSharedData {
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h
index a90c498a7ec3..f47f1e9464bc 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h
@@ -9,7 +9,7 @@ define the Intersection_distance functor.
 
 \cgalRefines{AABBGeomTraits}
 
-\cgalHasModel All models of the concept `Kernel`
+\cgalHasModelsBare{All models of the concept `Kernel`}
 
 \sa `CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>`
 \sa `CGAL::AABB_tree<AABBTraits>`
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
index 215cbd659249..87d139973b5c 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
@@ -7,7 +7,8 @@ The concept `AABBRayIntersectionTraits` is a refinement of the concept
 `AABBTraits` it also requires function objects to calculate the
 distance of an intersection along a ray.
 
-\cgalHasModel `CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>`
+\cgalHasModelsBegin CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>
+\cgalHasModelsEnd
 
 \sa `CGAL::AABB_tree<AABBTraits>`
 \sa `AABBPrimitive`
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
index c7f0e806faf6..f5e5846322e3 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
@@ -5,7 +5,8 @@
 
 The concept `AABBTraits` provides the geometric primitive types and methods for the class `CGAL::AABB_tree<AABBTraits>`.
 
-\cgalHasModel `CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>`
+\cgalHasModelsBegin CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>
+\cgalHasModelsEnd
 
 \cgalRefines{SearchGeomTraits_3}
 
diff --git a/AABB_tree/include/CGAL/AABB_face_graph_triangle_primitive.h b/AABB_tree/include/CGAL/AABB_face_graph_triangle_primitive.h
index 6d12a85adefa..5422c84b2ae6 100644
--- a/AABB_tree/include/CGAL/AABB_face_graph_triangle_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_face_graph_triangle_primitive.h
@@ -33,7 +33,7 @@ namespace CGAL {
  * while the AABB tree holding the primitive is in use.
  * The triangle type of the primitive (`Datum`) is `CGAL::Kernel_traits< boost::property_traits< VertexPointPMap >::%value_type >::%Kernel::Triangle_3`.
  *
- * \cgalModels `AABBPrimitiveWithSharedData`
+ * \cgalModels{AABBPrimitiveWithSharedData}
  *
  *\tparam FaceGraph is a model of the face graph concept.
  *\tparam VertexPointPMap  is a property map with `boost::graph_traits<FaceGraph>::%vertex_descriptor`
diff --git a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
index fe85c35d3662..0ac0476616eb 100644
--- a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
@@ -41,8 +41,8 @@ namespace CGAL {
  * of `VertexPointPMap` (using the `Kernel_traits` mechanism).
  * The segment type of the primitive (`Datum`) is `CGAL::Kernel_traits< boost::property_traits< VertexPointPMap >::%value_type >::%Kernel::Segment_3`.
  *
- * \cgalModels `AABBPrimitive` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_false`,
- *    and `AABBPrimitiveWithSharedData` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_true`.
+ * \cgalModelsBare{AABBPrimitive if `OneHalfedgeGraphPerTree` is `CGAL::Tag_false`,
+ *                 AABBPrimitiveWithSharedData if `OneHalfedgeGraphPerTree` is `CGAL::Tag_true`}
  *
  * \tparam HalfedgeGraph is a model of the halfedge graph concept.
  *   as key type and a \cgal Kernel `Point_3` as value type.
diff --git a/AABB_tree/include/CGAL/AABB_polyhedron_segment_primitive.h b/AABB_tree/include/CGAL/AABB_polyhedron_segment_primitive.h
index 2ace80acf226..7b8b72697f9a 100644
--- a/AABB_tree/include/CGAL/AABB_polyhedron_segment_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_polyhedron_segment_primitive.h
@@ -42,7 +42,7 @@ namespace CGAL {
     /// AABB tree is built should not be deleted while the AABB tree
     /// is in use.
     ///
-    /// \cgalModels `AABBPrimitive`
+    /// \cgalModels{AABBPrimitive}
     /// \tparam GeomTraits must provide a \c %Point_3
     /// type, used as \c Point, and a \c %Segment_3 type, used as \c
     /// Datum and constructible from two arguments of type \c
diff --git a/AABB_tree/include/CGAL/AABB_polyhedron_triangle_primitive.h b/AABB_tree/include/CGAL/AABB_polyhedron_triangle_primitive.h
index b45ae54039cb..647ae48b4156 100644
--- a/AABB_tree/include/CGAL/AABB_polyhedron_triangle_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_polyhedron_triangle_primitive.h
@@ -35,7 +35,7 @@ namespace CGAL {
     /// the polyhedron from which the AABB tree is built should not be
     /// deleted while the AABB tree is in use.
     ///
-    /// \cgalModels `AABBPrimitive`
+    /// \cgalModels{AABBPrimitive}
     /// \tparam GeomTraits must provides a \c %Point_3
     /// type, used as \c Point, and a \c %Triangle_3 type, used as \c
     /// Datum and constructible from three arguments of type \c
diff --git a/AABB_tree/include/CGAL/AABB_primitive.h b/AABB_tree/include/CGAL/AABB_primitive.h
index b0e9abdaf387..d602a349ee0e 100644
--- a/AABB_tree/include/CGAL/AABB_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_primitive.h
@@ -53,8 +53,8 @@ struct AABB_primitive_base
  * The two property maps which are template parameters of the class enable to get the datum and the reference point of
  * the primitive from the identifier. The last template parameter controls whether the primitive class holds a copy of the datum.
  *
- * \cgalModels `AABBPrimitive` if `ExternalPropertyMaps` is `CGAL::Tag_false`.
- * \cgalModels `AABBPrimitiveWithSharedData` if `ExternalPropertyMaps` is `CGAL::Tag_true`.
+ * \cgalModelsBare{AABBPrimitive if `ExternalPropertyMaps` is `CGAL::Tag_false`,
+ *                 AABBPrimitiveWithSharedData if `ExternalPropertyMaps` is `CGAL::Tag_true`}
  *
  * \tparam ObjectPropertyMap is a model of `ReadablePropertyMap` with `Id` as
  *           `key_type`. It must be a model of `CopyConstructible`, `DefaultConstructible`, and `CopyAssignable`.
diff --git a/AABB_tree/include/CGAL/AABB_segment_primitive.h b/AABB_tree/include/CGAL/AABB_segment_primitive.h
index a4627c8592ea..f13523ba40ca 100644
--- a/AABB_tree/include/CGAL/AABB_segment_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_segment_primitive.h
@@ -54,7 +54,7 @@ namespace internal {
  * The iterator from which the primitive is built should not be invalided
  * while the AABB tree holding the primitive is in use.
  *
- * \cgalModels `AABBPrimitive`
+ * \cgalModels{AABBPrimitive}
  *
  * \tparam GeomTraits is a traits class providing the nested type `Point_3` and `Segment_3`.
  *         It also provides the functor `Construct_source_3` that has an operator taking a `Segment_3`
diff --git a/AABB_tree/include/CGAL/AABB_traits.h b/AABB_tree/include/CGAL/AABB_traits.h
index b2eb87dc8f6a..f44739077303 100644
--- a/AABB_tree/include/CGAL/AABB_traits.h
+++ b/AABB_tree/include/CGAL/AABB_traits.h
@@ -149,9 +149,8 @@ class AABB_tree;
 /// computations, and it handles points as query type for distance
 /// queries.
 ///
-/// \cgalModels AABBTraits
-/// \cgalModels AABBRayIntersectionTraits
-
+/// \cgalModels{AABBTraits,AABBRayIntersectionTraits}
+///
 /// \tparam GeomTraits must  be a model of the concept \ref AABBGeomTraits,
 /// and provide the geometric types as well as the intersection tests and computations.
 /// \tparam Primitive provide the type of primitives stored in the AABB_tree.
diff --git a/AABB_tree/include/CGAL/AABB_triangle_primitive.h b/AABB_tree/include/CGAL/AABB_triangle_primitive.h
index b1b1bd1fe797..1fc1b140c582 100644
--- a/AABB_tree/include/CGAL/AABB_triangle_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_triangle_primitive.h
@@ -55,7 +55,7 @@ namespace internal {
  * The iterator from which the primitive is built should not be invalided
  * while the AABB tree holding the primitive is in use.
  *
- * \cgalModels `AABBPrimitive`
+ * \cgalModels{AABBPrimitive}
  *
  * \tparam GeomTraits is a traits class providing the nested type `Point_3` and `Triangle_3`.
  *         It also provides the functor `Construct_vertex_3` that has an operator taking a `Triangle_3`
diff --git a/AABB_tree/include/CGAL/AABB_triangulation_3_triangle_primitive.h b/AABB_tree/include/CGAL/AABB_triangulation_3_triangle_primitive.h
index e573dc71f49b..f45a005b99e7 100644
--- a/AABB_tree/include/CGAL/AABB_triangulation_3_triangle_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_triangulation_3_triangle_primitive.h
@@ -28,7 +28,7 @@ namespace CGAL {
     // the TriangleMesh from which the AABB tree is built should not be
     // deleted while the AABB tree is in use.
     //
-    // \cgalModels `AABBPrimitive`
+    // \cgalModels{AABBPrimitive}
     // \tparam GeomTraits must provides a \c %Point_3
     // type, used as \c Point, and a \c %Triangle_3 type, used as \c
     // Datum and constructible from three arguments of type \c
diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index ae2cc84f6c17..7486ae587d78 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -136,8 +136,18 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalRefinesBare{1}=<dl><dt>@cgalRefines</dt><dd>\1</dd></dl>" \
                          "cgalRefinesBare{2}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" \
+                         "cgalModelsHeader=Is Model Of" \
+                         "cgalModels{1}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd></dl>" \
+                         "cgalModels{2}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd></dl>" \
+                         "cgalModelsBare{1}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd></dl>" \
+                         "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \
                          "cgalHasModel=\xrefitem hasModels \"Has Models\" \"Has Model Relationships\"" \
+                         "cgalHasModelsHeader=Has Models" \
+                         "cgalHasModelsBegin=<dl><dt>@cgalHasModelsHeader</dt><dd>`" \
+                         "cgalHasModels=`</dd><dt></dt><dd>`" \
+                         "cgalHasModelsEnd=`</dd></dl>" \
+                         "cgalHasModelsBare{1}=<dl><dt>@cgalHasModels</dt><dd>\1</dd></dl>" \
                          "cgalDebugBegin=\htmlonly <div class=\"CGALDebug\"> <div>Debugging Support</div> \endhtmlonly \n" \
                          "cgalDebugEnd=\htmlonly </div> \endhtmlonly" \
                          "cgalDebugFunction=This is a function for debugging purpose." \
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index 1cfd0a6ffd9f..3813f3748daf 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -145,8 +145,18 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalRefinesBare{1}=<dl><dt>@cgalRefines</dt><dd>\1</dd></dl>" \
                          "cgalRefinesBare{2}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" \
+                         "cgalModelsHeader=Is Model Of" \
+                         "cgalModels{1}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd></dl>" \
+                         "cgalModels{2}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd></dl>" \
+                         "cgalModelsBare{1}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd></dl>" \
+                         "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \
                          "cgalHasModel=\xrefitem hasModels \"Has Models\" \"Has Model Relationships\"" \
+                         "cgalHasModelsHeader=Has Models" \
+                         "cgalHasModelsBegin=<dl><dt>@cgalHasModelsHeader</dt><dd>`" \
+                         "cgalHasModels=`</dd><dt></dt><dd>`" \
+                         "cgalHasModelsEnd=`</dd></dl>" \
+                         "cgalHasModelsBare{1}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd></dl>" \
                          "cgalDebugBegin=\htmlonly[block] <div class=\"CGALDebug\"> <div>Debugging Support</div> \endhtmlonly ^^" \
                          "cgalDebugEnd=\htmlonly[block] </div> \endhtmlonly" \
                          "cgalDebugFunction=This is a function for debugging purpose." \

From f14769935ada80f97677d5ec1ea44b94ec1f20bb Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 5 Jul 2023 15:34:41 +0200
Subject: [PATCH 0452/1398] GPLv2: replace TAB by 8 spaces

---
 Installation/LICENSES/GPL-2.0-or-later.txt | 14 +++++++-------
 LICENSES/GPL-2.0-only.txt                  | 14 +++++++-------
 LICENSES/GPL-2.0-or-later.txt              | 14 +++++++-------
 3 files changed, 21 insertions(+), 21 deletions(-)

diff --git a/Installation/LICENSES/GPL-2.0-or-later.txt b/Installation/LICENSES/GPL-2.0-or-later.txt
index 623b6258a134..4a1bd6f39f1d 100644
--- a/Installation/LICENSES/GPL-2.0-or-later.txt
+++ b/Installation/LICENSES/GPL-2.0-or-later.txt
@@ -1,12 +1,12 @@
-		    GNU GENERAL PUBLIC LICENSE
-		       Version 2, June 1991
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
 
  Copyright (C) 1989, 1991 Free Software Foundation, Inc.
      51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  Everyone is permitted to copy and distribute verbatim copies
  of this license document, but changing it is not allowed.
 
-			    Preamble
+                            Preamble
 
   The licenses for most software are designed to take away your
 freedom to share and change it.  By contrast, the GNU General Public
@@ -56,7 +56,7 @@ patent must be licensed for everyone's free use or not licensed at all.
   The precise terms and conditions for copying, distribution and
 modification follow.
 
-		    GNU GENERAL PUBLIC LICENSE
+                    GNU GENERAL PUBLIC LICENSE
    TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
 
   0. This License applies to any program or other work which contains
@@ -255,7 +255,7 @@ make exceptions for this.  Our decision will be guided by the two goals
 of preserving the free status of all derivatives of our free software and
 of promoting the sharing and reuse of software generally.
 
-			    NO WARRANTY
+                            NO WARRANTY
 
   11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
 FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
@@ -277,9 +277,9 @@ YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
 PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
 POSSIBILITY OF SUCH DAMAGES.
 
-		     END OF TERMS AND CONDITIONS
+                     END OF TERMS AND CONDITIONS
 
-	    How to Apply These Terms to Your New Programs
+            How to Apply These Terms to Your New Programs
 
   If you develop a new program, and you want it to be of the greatest
 possible use to the public, the best way to achieve this is to make it
diff --git a/LICENSES/GPL-2.0-only.txt b/LICENSES/GPL-2.0-only.txt
index 623b6258a134..4a1bd6f39f1d 100644
--- a/LICENSES/GPL-2.0-only.txt
+++ b/LICENSES/GPL-2.0-only.txt
@@ -1,12 +1,12 @@
-		    GNU GENERAL PUBLIC LICENSE
-		       Version 2, June 1991
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
 
  Copyright (C) 1989, 1991 Free Software Foundation, Inc.
      51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  Everyone is permitted to copy and distribute verbatim copies
  of this license document, but changing it is not allowed.
 
-			    Preamble
+                            Preamble
 
   The licenses for most software are designed to take away your
 freedom to share and change it.  By contrast, the GNU General Public
@@ -56,7 +56,7 @@ patent must be licensed for everyone's free use or not licensed at all.
   The precise terms and conditions for copying, distribution and
 modification follow.
 
-		    GNU GENERAL PUBLIC LICENSE
+                    GNU GENERAL PUBLIC LICENSE
    TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
 
   0. This License applies to any program or other work which contains
@@ -255,7 +255,7 @@ make exceptions for this.  Our decision will be guided by the two goals
 of preserving the free status of all derivatives of our free software and
 of promoting the sharing and reuse of software generally.
 
-			    NO WARRANTY
+                            NO WARRANTY
 
   11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
 FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
@@ -277,9 +277,9 @@ YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
 PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
 POSSIBILITY OF SUCH DAMAGES.
 
-		     END OF TERMS AND CONDITIONS
+                     END OF TERMS AND CONDITIONS
 
-	    How to Apply These Terms to Your New Programs
+            How to Apply These Terms to Your New Programs
 
   If you develop a new program, and you want it to be of the greatest
 possible use to the public, the best way to achieve this is to make it
diff --git a/LICENSES/GPL-2.0-or-later.txt b/LICENSES/GPL-2.0-or-later.txt
index 623b6258a134..4a1bd6f39f1d 100644
--- a/LICENSES/GPL-2.0-or-later.txt
+++ b/LICENSES/GPL-2.0-or-later.txt
@@ -1,12 +1,12 @@
-		    GNU GENERAL PUBLIC LICENSE
-		       Version 2, June 1991
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
 
  Copyright (C) 1989, 1991 Free Software Foundation, Inc.
      51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  Everyone is permitted to copy and distribute verbatim copies
  of this license document, but changing it is not allowed.
 
-			    Preamble
+                            Preamble
 
   The licenses for most software are designed to take away your
 freedom to share and change it.  By contrast, the GNU General Public
@@ -56,7 +56,7 @@ patent must be licensed for everyone's free use or not licensed at all.
   The precise terms and conditions for copying, distribution and
 modification follow.
 
-		    GNU GENERAL PUBLIC LICENSE
+                    GNU GENERAL PUBLIC LICENSE
    TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
 
   0. This License applies to any program or other work which contains
@@ -255,7 +255,7 @@ make exceptions for this.  Our decision will be guided by the two goals
 of preserving the free status of all derivatives of our free software and
 of promoting the sharing and reuse of software generally.
 
-			    NO WARRANTY
+                            NO WARRANTY
 
   11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
 FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
@@ -277,9 +277,9 @@ YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
 PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
 POSSIBILITY OF SUCH DAMAGES.
 
-		     END OF TERMS AND CONDITIONS
+                     END OF TERMS AND CONDITIONS
 
-	    How to Apply These Terms to Your New Programs
+            How to Apply These Terms to Your New Programs
 
   If you develop a new program, and you want it to be of the greatest
 possible use to the public, the best way to achieve this is to make it

From 7df8d95d1b53312cf84707bf0adc2f866155c68b Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 5 Jul 2023 16:45:12 +0200
Subject: [PATCH 0453/1398] remove 0x0c (Page break)

---
 Installation/LICENSES/GPL-2.0-or-later.txt | 10 +++++-----
 LICENSES/GPL-2.0-only.txt                  | 10 +++++-----
 LICENSES/GPL-2.0-or-later.txt              | 10 +++++-----
 3 files changed, 15 insertions(+), 15 deletions(-)

diff --git a/Installation/LICENSES/GPL-2.0-or-later.txt b/Installation/LICENSES/GPL-2.0-or-later.txt
index 4a1bd6f39f1d..0106771c764d 100644
--- a/Installation/LICENSES/GPL-2.0-or-later.txt
+++ b/Installation/LICENSES/GPL-2.0-or-later.txt
@@ -55,7 +55,7 @@ patent must be licensed for everyone's free use or not licensed at all.
 
   The precise terms and conditions for copying, distribution and
 modification follow.
-
+
                     GNU GENERAL PUBLIC LICENSE
    TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
 
@@ -110,7 +110,7 @@ above, provided that you also meet all of these conditions:
     License.  (Exception: if the Program itself is interactive but
     does not normally print such an announcement, your work based on
     the Program is not required to print an announcement.)
-
+
 These requirements apply to the modified work as a whole.  If
 identifiable sections of that work are not derived from the Program,
 and can be reasonably considered independent and separate works in
@@ -168,7 +168,7 @@ access to copy from a designated place, then offering equivalent
 access to copy the source code from the same place counts as
 distribution of the source code, even though third parties are not
 compelled to copy the source along with the object code.
-
+
   4. You may not copy, modify, sublicense, or distribute the Program
 except as expressly provided under this License.  Any attempt
 otherwise to copy, modify, sublicense or distribute the Program is
@@ -225,7 +225,7 @@ impose that choice.
 
 This section is intended to make thoroughly clear what is believed to
 be a consequence of the rest of this License.
-
+
   8. If the distribution and/or use of the Program is restricted in
 certain countries either by patents or by copyrighted interfaces, the
 original copyright holder who places the Program under this License
@@ -278,7 +278,7 @@ PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
 POSSIBILITY OF SUCH DAMAGES.
 
                      END OF TERMS AND CONDITIONS
-
+
             How to Apply These Terms to Your New Programs
 
   If you develop a new program, and you want it to be of the greatest
diff --git a/LICENSES/GPL-2.0-only.txt b/LICENSES/GPL-2.0-only.txt
index 4a1bd6f39f1d..0106771c764d 100644
--- a/LICENSES/GPL-2.0-only.txt
+++ b/LICENSES/GPL-2.0-only.txt
@@ -55,7 +55,7 @@ patent must be licensed for everyone's free use or not licensed at all.
 
   The precise terms and conditions for copying, distribution and
 modification follow.
-
+
                     GNU GENERAL PUBLIC LICENSE
    TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
 
@@ -110,7 +110,7 @@ above, provided that you also meet all of these conditions:
     License.  (Exception: if the Program itself is interactive but
     does not normally print such an announcement, your work based on
     the Program is not required to print an announcement.)
-
+
 These requirements apply to the modified work as a whole.  If
 identifiable sections of that work are not derived from the Program,
 and can be reasonably considered independent and separate works in
@@ -168,7 +168,7 @@ access to copy from a designated place, then offering equivalent
 access to copy the source code from the same place counts as
 distribution of the source code, even though third parties are not
 compelled to copy the source along with the object code.
-
+
   4. You may not copy, modify, sublicense, or distribute the Program
 except as expressly provided under this License.  Any attempt
 otherwise to copy, modify, sublicense or distribute the Program is
@@ -225,7 +225,7 @@ impose that choice.
 
 This section is intended to make thoroughly clear what is believed to
 be a consequence of the rest of this License.
-
+
   8. If the distribution and/or use of the Program is restricted in
 certain countries either by patents or by copyrighted interfaces, the
 original copyright holder who places the Program under this License
@@ -278,7 +278,7 @@ PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
 POSSIBILITY OF SUCH DAMAGES.
 
                      END OF TERMS AND CONDITIONS
-
+
             How to Apply These Terms to Your New Programs
 
   If you develop a new program, and you want it to be of the greatest
diff --git a/LICENSES/GPL-2.0-or-later.txt b/LICENSES/GPL-2.0-or-later.txt
index 4a1bd6f39f1d..0106771c764d 100644
--- a/LICENSES/GPL-2.0-or-later.txt
+++ b/LICENSES/GPL-2.0-or-later.txt
@@ -55,7 +55,7 @@ patent must be licensed for everyone's free use or not licensed at all.
 
   The precise terms and conditions for copying, distribution and
 modification follow.
-
+
                     GNU GENERAL PUBLIC LICENSE
    TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
 
@@ -110,7 +110,7 @@ above, provided that you also meet all of these conditions:
     License.  (Exception: if the Program itself is interactive but
     does not normally print such an announcement, your work based on
     the Program is not required to print an announcement.)
-
+
 These requirements apply to the modified work as a whole.  If
 identifiable sections of that work are not derived from the Program,
 and can be reasonably considered independent and separate works in
@@ -168,7 +168,7 @@ access to copy from a designated place, then offering equivalent
 access to copy the source code from the same place counts as
 distribution of the source code, even though third parties are not
 compelled to copy the source along with the object code.
-
+
   4. You may not copy, modify, sublicense, or distribute the Program
 except as expressly provided under this License.  Any attempt
 otherwise to copy, modify, sublicense or distribute the Program is
@@ -225,7 +225,7 @@ impose that choice.
 
 This section is intended to make thoroughly clear what is believed to
 be a consequence of the rest of this License.
-
+
   8. If the distribution and/or use of the Program is restricted in
 certain countries either by patents or by copyrighted interfaces, the
 original copyright holder who places the Program under this License
@@ -278,7 +278,7 @@ PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
 POSSIBILITY OF SUCH DAMAGES.
 
                      END OF TERMS AND CONDITIONS
-
+
             How to Apply These Terms to Your New Programs
 
   If you develop a new program, and you want it to be of the greatest

From 6ed2272c1d7d2b2f524659060e62a9c9f5df63dd Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 6 Jul 2023 07:26:54 +0100
Subject: [PATCH 0454/1398] Classification: Workaround or VC std17 boost bug

---
 Classification/include/CGAL/Classification/Image.h | 10 +++++++---
 1 file changed, 7 insertions(+), 3 deletions(-)

diff --git a/Classification/include/CGAL/Classification/Image.h b/Classification/include/CGAL/Classification/Image.h
index 924e39bde240..084e9572764a 100644
--- a/Classification/include/CGAL/Classification/Image.h
+++ b/Classification/include/CGAL/Classification/Image.h
@@ -16,6 +16,7 @@
 
 #include <map>
 #include <memory>
+#include <CGAL/assertions.h>
 
 #define CGAL_CLASSIFICATION_IMAGE_SIZE_LIMIT 100000000
 
@@ -38,13 +39,16 @@ class Image
   std::shared_ptr<Map> m_sparse;
   Type m_default;
 
+
+public:
   // Forbid using copy constructor
-  Image (const Image&)
+  // Make it public for a strange VC++ std17 boost-1_82 error
+  // https://github.com/boostorg/core/issues/148
+  Image(const Image&)
   {
+      CGAL_assertion(false);
   }
 
-public:
-
   Image () : m_width(0), m_height(0), m_depth(0)
   {
   }

From 404bc84696ac744bc16f68ab839808909c1ce43f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 6 Jul 2023 09:37:02 +0200
Subject: [PATCH 0455/1398] missing ${}

---
 Scripts/developer_scripts/run_testsuite_with_ctest | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Scripts/developer_scripts/run_testsuite_with_ctest b/Scripts/developer_scripts/run_testsuite_with_ctest
index 3e13edc6a7e3..723b3938d2ce 100644
--- a/Scripts/developer_scripts/run_testsuite_with_ctest
+++ b/Scripts/developer_scripts/run_testsuite_with_ctest
@@ -181,7 +181,7 @@ setup_dirs()
 
     # MSVC2015 does not support C++17
     if [ "${CGAL_RELEASE_ID}" \> "CGAL-6.0" ]; then
-      if [ "PLATFORM" = "MSVC2015-Release-64bits" ]; then
+      if [ "${PLATFORM}" = "MSVC2015-Release-64bits" ]; then
         continue
       fi
     fi

From 62438e59d318a3165327c64c62deb233d038956c Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 6 Jul 2023 12:36:33 +0200
Subject: [PATCH 0456/1398] deduplicate the LICENSES/ directory

The script `cgal_create_release_with_cmake.cmake` has been modified.
---
 Installation/LICENSES/BSL-1.0.txt             |  23 -
 Installation/LICENSES/CC0-1.0.txt             | 121 ----
 Installation/LICENSES/GPL-2.0-or-later.txt    | 340 ---------
 Installation/LICENSES/GPL-3.0-only.txt        | 674 ------------------
 Installation/LICENSES/GPL-3.0-or-later.txt    | 674 ------------------
 Installation/LICENSES/LGPL-2.1-only.txt       | 178 -----
 Installation/LICENSES/LGPL-3.0-only.txt       | 165 -----
 Installation/LICENSES/LGPL-3.0-or-later.txt   | 165 -----
 .../LICENSES/LicenseRef-Commercial.txt        |   6 -
 Installation/LICENSES/LicenseRef-RFL.txt      |  19 -
 Installation/LICENSES/MIT.txt                 |  17 -
 .../cgal_create_release_with_cmake.cmake      |   3 +
 12 files changed, 3 insertions(+), 2382 deletions(-)
 delete mode 100644 Installation/LICENSES/BSL-1.0.txt
 delete mode 100644 Installation/LICENSES/CC0-1.0.txt
 delete mode 100644 Installation/LICENSES/GPL-2.0-or-later.txt
 delete mode 100644 Installation/LICENSES/GPL-3.0-only.txt
 delete mode 100644 Installation/LICENSES/GPL-3.0-or-later.txt
 delete mode 100644 Installation/LICENSES/LGPL-2.1-only.txt
 delete mode 100644 Installation/LICENSES/LGPL-3.0-only.txt
 delete mode 100644 Installation/LICENSES/LGPL-3.0-or-later.txt
 delete mode 100644 Installation/LICENSES/LicenseRef-Commercial.txt
 delete mode 100644 Installation/LICENSES/LicenseRef-RFL.txt
 delete mode 100644 Installation/LICENSES/MIT.txt

diff --git a/Installation/LICENSES/BSL-1.0.txt b/Installation/LICENSES/BSL-1.0.txt
deleted file mode 100644
index 36b7cd93cdfb..000000000000
--- a/Installation/LICENSES/BSL-1.0.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-Boost Software License - Version 1.0 - August 17th, 2003
-
-Permission is hereby granted, free of charge, to any person or organization
-obtaining a copy of the software and accompanying documentation covered by
-this license (the "Software") to use, reproduce, display, distribute,
-execute, and transmit the Software, and to prepare derivative works of the
-Software, and to permit third-parties to whom the Software is furnished to
-do so, all subject to the following:
-
-The copyright notices in the Software and this entire statement, including
-the above license grant, this restriction and the following disclaimer,
-must be included in all copies of the Software, in whole or in part, and
-all derivative works of the Software, unless such copies or derivative
-works are solely in the form of machine-executable object code generated by
-a source language processor.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
-SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
-FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
-ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-DEALINGS IN THE SOFTWARE.
diff --git a/Installation/LICENSES/CC0-1.0.txt b/Installation/LICENSES/CC0-1.0.txt
deleted file mode 100644
index 0e259d42c996..000000000000
--- a/Installation/LICENSES/CC0-1.0.txt
+++ /dev/null
@@ -1,121 +0,0 @@
-Creative Commons Legal Code
-
-CC0 1.0 Universal
-
-    CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
-    LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
-    ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
-    INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
-    REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
-    PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
-    THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
-    HEREUNDER.
-
-Statement of Purpose
-
-The laws of most jurisdictions throughout the world automatically confer
-exclusive Copyright and Related Rights (defined below) upon the creator
-and subsequent owner(s) (each and all, an "owner") of an original work of
-authorship and/or a database (each, a "Work").
-
-Certain owners wish to permanently relinquish those rights to a Work for
-the purpose of contributing to a commons of creative, cultural and
-scientific works ("Commons") that the public can reliably and without fear
-of later claims of infringement build upon, modify, incorporate in other
-works, reuse and redistribute as freely as possible in any form whatsoever
-and for any purposes, including without limitation commercial purposes.
-These owners may contribute to the Commons to promote the ideal of a free
-culture and the further production of creative, cultural and scientific
-works, or to gain reputation or greater distribution for their Work in
-part through the use and efforts of others.
-
-For these and/or other purposes and motivations, and without any
-expectation of additional consideration or compensation, the person
-associating CC0 with a Work (the "Affirmer"), to the extent that he or she
-is an owner of Copyright and Related Rights in the Work, voluntarily
-elects to apply CC0 to the Work and publicly distribute the Work under its
-terms, with knowledge of his or her Copyright and Related Rights in the
-Work and the meaning and intended legal effect of CC0 on those rights.
-
-1. Copyright and Related Rights. A Work made available under CC0 may be
-protected by copyright and related or neighboring rights ("Copyright and
-Related Rights"). Copyright and Related Rights include, but are not
-limited to, the following:
-
-  i. the right to reproduce, adapt, distribute, perform, display,
-     communicate, and translate a Work;
- ii. moral rights retained by the original author(s) and/or performer(s);
-iii. publicity and privacy rights pertaining to a person's image or
-     likeness depicted in a Work;
- iv. rights protecting against unfair competition in regards to a Work,
-     subject to the limitations in paragraph 4(a), below;
-  v. rights protecting the extraction, dissemination, use and reuse of data
-     in a Work;
- vi. database rights (such as those arising under Directive 96/9/EC of the
-     European Parliament and of the Council of 11 March 1996 on the legal
-     protection of databases, and under any national implementation
-     thereof, including any amended or successor version of such
-     directive); and
-vii. other similar, equivalent or corresponding rights throughout the
-     world based on applicable law or treaty, and any national
-     implementations thereof.
-
-2. Waiver. To the greatest extent permitted by, but not in contravention
-of, applicable law, Affirmer hereby overtly, fully, permanently,
-irrevocably and unconditionally waives, abandons, and surrenders all of
-Affirmer's Copyright and Related Rights and associated claims and causes
-of action, whether now known or unknown (including existing as well as
-future claims and causes of action), in the Work (i) in all territories
-worldwide, (ii) for the maximum duration provided by applicable law or
-treaty (including future time extensions), (iii) in any current or future
-medium and for any number of copies, and (iv) for any purpose whatsoever,
-including without limitation commercial, advertising or promotional
-purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
-member of the public at large and to the detriment of Affirmer's heirs and
-successors, fully intending that such Waiver shall not be subject to
-revocation, rescission, cancellation, termination, or any other legal or
-equitable action to disrupt the quiet enjoyment of the Work by the public
-as contemplated by Affirmer's express Statement of Purpose.
-
-3. Public License Fallback. Should any part of the Waiver for any reason
-be judged legally invalid or ineffective under applicable law, then the
-Waiver shall be preserved to the maximum extent permitted taking into
-account Affirmer's express Statement of Purpose. In addition, to the
-extent the Waiver is so judged Affirmer hereby grants to each affected
-person a royalty-free, non transferable, non sublicensable, non exclusive,
-irrevocable and unconditional license to exercise Affirmer's Copyright and
-Related Rights in the Work (i) in all territories worldwide, (ii) for the
-maximum duration provided by applicable law or treaty (including future
-time extensions), (iii) in any current or future medium and for any number
-of copies, and (iv) for any purpose whatsoever, including without
-limitation commercial, advertising or promotional purposes (the
-"License"). The License shall be deemed effective as of the date CC0 was
-applied by Affirmer to the Work. Should any part of the License for any
-reason be judged legally invalid or ineffective under applicable law, such
-partial invalidity or ineffectiveness shall not invalidate the remainder
-of the License, and in such case Affirmer hereby affirms that he or she
-will not (i) exercise any of his or her remaining Copyright and Related
-Rights in the Work or (ii) assert any associated claims and causes of
-action with respect to the Work, in either case contrary to Affirmer's
-express Statement of Purpose.
-
-4. Limitations and Disclaimers.
-
- a. No trademark or patent rights held by Affirmer are waived, abandoned,
-    surrendered, licensed or otherwise affected by this document.
- b. Affirmer offers the Work as-is and makes no representations or
-    warranties of any kind concerning the Work, express, implied,
-    statutory or otherwise, including without limitation warranties of
-    title, merchantability, fitness for a particular purpose, non
-    infringement, or the absence of latent or other defects, accuracy, or
-    the present or absence of errors, whether or not discoverable, all to
-    the greatest extent permissible under applicable law.
- c. Affirmer disclaims responsibility for clearing rights of other persons
-    that may apply to the Work or any use thereof, including without
-    limitation any person's Copyright and Related Rights in the Work.
-    Further, Affirmer disclaims responsibility for obtaining any necessary
-    consents, permissions or other rights required for any use of the
-    Work.
- d. Affirmer understands and acknowledges that Creative Commons is not a
-    party to this document and has no duty or obligation with respect to
-    this CC0 or use of the Work.
diff --git a/Installation/LICENSES/GPL-2.0-or-later.txt b/Installation/LICENSES/GPL-2.0-or-later.txt
deleted file mode 100644
index 0106771c764d..000000000000
--- a/Installation/LICENSES/GPL-2.0-or-later.txt
+++ /dev/null
@@ -1,340 +0,0 @@
-                    GNU GENERAL PUBLIC LICENSE
-                       Version 2, June 1991
-
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.
-     51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-                            Preamble
-
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users.  This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it.  (Some other Free Software Foundation software is covered by
-the GNU Library General Public License instead.)  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
-
-  To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have.  You must make sure that they, too, receive or can get the
-source code.  And you must show them these terms so they know their
-rights.
-
-  We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
-
-  Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software.  If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
-
-  Finally, any free program is threatened constantly by software
-patents.  We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary.  To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-                    GNU GENERAL PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License.  The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language.  (Hereinafter, translation is included without limitation in
-the term "modification".)  Each licensee is addressed as "you".
-
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
-
-  1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
-
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
-
-  2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
-    a) You must cause the modified files to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    b) You must cause any work that you distribute or publish, that in
-    whole or in part contains or is derived from the Program or any
-    part thereof, to be licensed as a whole at no charge to all third
-    parties under the terms of this License.
-
-    c) If the modified program normally reads commands interactively
-    when run, you must cause it, when started running for such
-    interactive use in the most ordinary way, to print or display an
-    announcement including an appropriate copyright notice and a
-    notice that there is no warranty (or else, saying that you provide
-    a warranty) and that users may redistribute the program under
-    these conditions, and telling the user how to view a copy of this
-    License.  (Exception: if the Program itself is interactive but
-    does not normally print such an announcement, your work based on
-    the Program is not required to print an announcement.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-
-    a) Accompany it with the complete corresponding machine-readable
-    source code, which must be distributed under the terms of Sections
-    1 and 2 above on a medium customarily used for software interchange; or,
-
-    b) Accompany it with a written offer, valid for at least three
-    years, to give any third party, for a charge no more than your
-    cost of physically performing source distribution, a complete
-    machine-readable copy of the corresponding source code, to be
-    distributed under the terms of Sections 1 and 2 above on a medium
-    customarily used for software interchange; or,
-
-    c) Accompany it with the information you received as to the offer
-    to distribute corresponding source code.  (This alternative is
-    allowed only for noncommercial distribution and only if you
-    received the program in object code or executable form with such
-    an offer, in accord with Subsection b above.)
-
-The source code for a work means the preferred form of the work for
-making modifications to it.  For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable.  However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License.  Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-
-  5. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Program or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
-  6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-
-  7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded.  In such case, this License incorporates
-the limitation as if written in the body of this License.
-
-  9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation.  If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-
-  10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission.  For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this.  Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-
-                            NO WARRANTY
-
-  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-
-  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-
-                     END OF TERMS AND CONDITIONS
-
-            How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This program is free software; you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation; either version 2 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License
-    along with this program; if not, write to the Free Software
-    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
-
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-
-    Gnomovision version 69, Copyright (C) year  name of author
-    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-  `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-  <signature of Ty Coon>, 1 April 1989
-  Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Library General
-Public License instead of this License.
diff --git a/Installation/LICENSES/GPL-3.0-only.txt b/Installation/LICENSES/GPL-3.0-only.txt
deleted file mode 100644
index 94a9ed024d38..000000000000
--- a/Installation/LICENSES/GPL-3.0-only.txt
+++ /dev/null
@@ -1,674 +0,0 @@
-                    GNU GENERAL PUBLIC LICENSE
-                       Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-                            Preamble
-
-  The GNU General Public License is a free, copyleft license for
-software and other kinds of works.
-
-  The licenses for most software and other practical works are designed
-to take away your freedom to share and change the works.  By contrast,
-the GNU General Public License is intended to guarantee your freedom to
-share and change all versions of a program--to make sure it remains free
-software for all its users.  We, the Free Software Foundation, use the
-GNU General Public License for most of our software; it applies also to
-any other work released this way by its authors.  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-them if you wish), that you receive source code or can get it if you
-want it, that you can change the software or use pieces of it in new
-free programs, and that you know you can do these things.
-
-  To protect your rights, we need to prevent others from denying you
-these rights or asking you to surrender the rights.  Therefore, you have
-certain responsibilities if you distribute copies of the software, or if
-you modify it: responsibilities to respect the freedom of others.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must pass on to the recipients the same
-freedoms that you received.  You must make sure that they, too, receive
-or can get the source code.  And you must show them these terms so they
-know their rights.
-
-  Developers that use the GNU GPL protect your rights with two steps:
-(1) assert copyright on the software, and (2) offer you this License
-giving you legal permission to copy, distribute and/or modify it.
-
-  For the developers' and authors' protection, the GPL clearly explains
-that there is no warranty for this free software.  For both users' and
-authors' sake, the GPL requires that modified versions be marked as
-changed, so that their problems will not be attributed erroneously to
-authors of previous versions.
-
-  Some devices are designed to deny users access to install or run
-modified versions of the software inside them, although the manufacturer
-can do so.  This is fundamentally incompatible with the aim of
-protecting users' freedom to change the software.  The systematic
-pattern of such abuse occurs in the area of products for individuals to
-use, which is precisely where it is most unacceptable.  Therefore, we
-have designed this version of the GPL to prohibit the practice for those
-products.  If such problems arise substantially in other domains, we
-stand ready to extend this provision to those domains in future versions
-of the GPL, as needed to protect the freedom of users.
-
-  Finally, every program is threatened constantly by software patents.
-States should not allow patents to restrict development and use of
-software on general-purpose computers, but in those that do, we wish to
-avoid the special danger that patents applied to a free program could
-make it effectively proprietary.  To prevent this, the GPL assures that
-patents cannot be used to render the program non-free.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-                       TERMS AND CONDITIONS
-
-  0. Definitions.
-
-  "This License" refers to version 3 of the GNU General Public License.
-
-  "Copyright" also means copyright-like laws that apply to other kinds of
-works, such as semiconductor masks.
-
-  "The Program" refers to any copyrightable work licensed under this
-License.  Each licensee is addressed as "you".  "Licensees" and
-"recipients" may be individuals or organizations.
-
-  To "modify" a work means to copy from or adapt all or part of the work
-in a fashion requiring copyright permission, other than the making of an
-exact copy.  The resulting work is called a "modified version" of the
-earlier work or a work "based on" the earlier work.
-
-  A "covered work" means either the unmodified Program or a work based
-on the Program.
-
-  To "propagate" a work means to do anything with it that, without
-permission, would make you directly or secondarily liable for
-infringement under applicable copyright law, except executing it on a
-computer or modifying a private copy.  Propagation includes copying,
-distribution (with or without modification), making available to the
-public, and in some countries other activities as well.
-
-  To "convey" a work means any kind of propagation that enables other
-parties to make or receive copies.  Mere interaction with a user through
-a computer network, with no transfer of a copy, is not conveying.
-
-  An interactive user interface displays "Appropriate Legal Notices"
-to the extent that it includes a convenient and prominently visible
-feature that (1) displays an appropriate copyright notice, and (2)
-tells the user that there is no warranty for the work (except to the
-extent that warranties are provided), that licensees may convey the
-work under this License, and how to view a copy of this License.  If
-the interface presents a list of user commands or options, such as a
-menu, a prominent item in the list meets this criterion.
-
-  1. Source Code.
-
-  The "source code" for a work means the preferred form of the work
-for making modifications to it.  "Object code" means any non-source
-form of a work.
-
-  A "Standard Interface" means an interface that either is an official
-standard defined by a recognized standards body, or, in the case of
-interfaces specified for a particular programming language, one that
-is widely used among developers working in that language.
-
-  The "System Libraries" of an executable work include anything, other
-than the work as a whole, that (a) is included in the normal form of
-packaging a Major Component, but which is not part of that Major
-Component, and (b) serves only to enable use of the work with that
-Major Component, or to implement a Standard Interface for which an
-implementation is available to the public in source code form.  A
-"Major Component", in this context, means a major essential component
-(kernel, window system, and so on) of the specific operating system
-(if any) on which the executable work runs, or a compiler used to
-produce the work, or an object code interpreter used to run it.
-
-  The "Corresponding Source" for a work in object code form means all
-the source code needed to generate, install, and (for an executable
-work) run the object code and to modify the work, including scripts to
-control those activities.  However, it does not include the work's
-System Libraries, or general-purpose tools or generally available free
-programs which are used unmodified in performing those activities but
-which are not part of the work.  For example, Corresponding Source
-includes interface definition files associated with source files for
-the work, and the source code for shared libraries and dynamically
-linked subprograms that the work is specifically designed to require,
-such as by intimate data communication or control flow between those
-subprograms and other parts of the work.
-
-  The Corresponding Source need not include anything that users
-can regenerate automatically from other parts of the Corresponding
-Source.
-
-  The Corresponding Source for a work in source code form is that
-same work.
-
-  2. Basic Permissions.
-
-  All rights granted under this License are granted for the term of
-copyright on the Program, and are irrevocable provided the stated
-conditions are met.  This License explicitly affirms your unlimited
-permission to run the unmodified Program.  The output from running a
-covered work is covered by this License only if the output, given its
-content, constitutes a covered work.  This License acknowledges your
-rights of fair use or other equivalent, as provided by copyright law.
-
-  You may make, run and propagate covered works that you do not
-convey, without conditions so long as your license otherwise remains
-in force.  You may convey covered works to others for the sole purpose
-of having them make modifications exclusively for you, or provide you
-with facilities for running those works, provided that you comply with
-the terms of this License in conveying all material for which you do
-not control copyright.  Those thus making or running the covered works
-for you must do so exclusively on your behalf, under your direction
-and control, on terms that prohibit them from making any copies of
-your copyrighted material outside their relationship with you.
-
-  Conveying under any other circumstances is permitted solely under
-the conditions stated below.  Sublicensing is not allowed; section 10
-makes it unnecessary.
-
-  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
-
-  No covered work shall be deemed part of an effective technological
-measure under any applicable law fulfilling obligations under article
-11 of the WIPO copyright treaty adopted on 20 December 1996, or
-similar laws prohibiting or restricting circumvention of such
-measures.
-
-  When you convey a covered work, you waive any legal power to forbid
-circumvention of technological measures to the extent such circumvention
-is effected by exercising rights under this License with respect to
-the covered work, and you disclaim any intention to limit operation or
-modification of the work as a means of enforcing, against the work's
-users, your or third parties' legal rights to forbid circumvention of
-technological measures.
-
-  4. Conveying Verbatim Copies.
-
-  You may convey verbatim copies of the Program's source code as you
-receive it, in any medium, provided that you conspicuously and
-appropriately publish on each copy an appropriate copyright notice;
-keep intact all notices stating that this License and any
-non-permissive terms added in accord with section 7 apply to the code;
-keep intact all notices of the absence of any warranty; and give all
-recipients a copy of this License along with the Program.
-
-  You may charge any price or no price for each copy that you convey,
-and you may offer support or warranty protection for a fee.
-
-  5. Conveying Modified Source Versions.
-
-  You may convey a work based on the Program, or the modifications to
-produce it from the Program, in the form of source code under the
-terms of section 4, provided that you also meet all of these conditions:
-
-    a) The work must carry prominent notices stating that you modified
-    it, and giving a relevant date.
-
-    b) The work must carry prominent notices stating that it is
-    released under this License and any conditions added under section
-    7.  This requirement modifies the requirement in section 4 to
-    "keep intact all notices".
-
-    c) You must license the entire work, as a whole, under this
-    License to anyone who comes into possession of a copy.  This
-    License will therefore apply, along with any applicable section 7
-    additional terms, to the whole of the work, and all its parts,
-    regardless of how they are packaged.  This License gives no
-    permission to license the work in any other way, but it does not
-    invalidate such permission if you have separately received it.
-
-    d) If the work has interactive user interfaces, each must display
-    Appropriate Legal Notices; however, if the Program has interactive
-    interfaces that do not display Appropriate Legal Notices, your
-    work need not make them do so.
-
-  A compilation of a covered work with other separate and independent
-works, which are not by their nature extensions of the covered work,
-and which are not combined with it such as to form a larger program,
-in or on a volume of a storage or distribution medium, is called an
-"aggregate" if the compilation and its resulting copyright are not
-used to limit the access or legal rights of the compilation's users
-beyond what the individual works permit.  Inclusion of a covered work
-in an aggregate does not cause this License to apply to the other
-parts of the aggregate.
-
-  6. Conveying Non-Source Forms.
-
-  You may convey a covered work in object code form under the terms
-of sections 4 and 5, provided that you also convey the
-machine-readable Corresponding Source under the terms of this License,
-in one of these ways:
-
-    a) Convey the object code in, or embodied in, a physical product
-    (including a physical distribution medium), accompanied by the
-    Corresponding Source fixed on a durable physical medium
-    customarily used for software interchange.
-
-    b) Convey the object code in, or embodied in, a physical product
-    (including a physical distribution medium), accompanied by a
-    written offer, valid for at least three years and valid for as
-    long as you offer spare parts or customer support for that product
-    model, to give anyone who possesses the object code either (1) a
-    copy of the Corresponding Source for all the software in the
-    product that is covered by this License, on a durable physical
-    medium customarily used for software interchange, for a price no
-    more than your reasonable cost of physically performing this
-    conveying of source, or (2) access to copy the
-    Corresponding Source from a network server at no charge.
-
-    c) Convey individual copies of the object code with a copy of the
-    written offer to provide the Corresponding Source.  This
-    alternative is allowed only occasionally and noncommercially, and
-    only if you received the object code with such an offer, in accord
-    with subsection 6b.
-
-    d) Convey the object code by offering access from a designated
-    place (gratis or for a charge), and offer equivalent access to the
-    Corresponding Source in the same way through the same place at no
-    further charge.  You need not require recipients to copy the
-    Corresponding Source along with the object code.  If the place to
-    copy the object code is a network server, the Corresponding Source
-    may be on a different server (operated by you or a third party)
-    that supports equivalent copying facilities, provided you maintain
-    clear directions next to the object code saying where to find the
-    Corresponding Source.  Regardless of what server hosts the
-    Corresponding Source, you remain obligated to ensure that it is
-    available for as long as needed to satisfy these requirements.
-
-    e) Convey the object code using peer-to-peer transmission, provided
-    you inform other peers where the object code and Corresponding
-    Source of the work are being offered to the general public at no
-    charge under subsection 6d.
-
-  A separable portion of the object code, whose source code is excluded
-from the Corresponding Source as a System Library, need not be
-included in conveying the object code work.
-
-  A "User Product" is either (1) a "consumer product", which means any
-tangible personal property which is normally used for personal, family,
-or household purposes, or (2) anything designed or sold for incorporation
-into a dwelling.  In determining whether a product is a consumer product,
-doubtful cases shall be resolved in favor of coverage.  For a particular
-product received by a particular user, "normally used" refers to a
-typical or common use of that class of product, regardless of the status
-of the particular user or of the way in which the particular user
-actually uses, or expects or is expected to use, the product.  A product
-is a consumer product regardless of whether the product has substantial
-commercial, industrial or non-consumer uses, unless such uses represent
-the only significant mode of use of the product.
-
-  "Installation Information" for a User Product means any methods,
-procedures, authorization keys, or other information required to install
-and execute modified versions of a covered work in that User Product from
-a modified version of its Corresponding Source.  The information must
-suffice to ensure that the continued functioning of the modified object
-code is in no case prevented or interfered with solely because
-modification has been made.
-
-  If you convey an object code work under this section in, or with, or
-specifically for use in, a User Product, and the conveying occurs as
-part of a transaction in which the right of possession and use of the
-User Product is transferred to the recipient in perpetuity or for a
-fixed term (regardless of how the transaction is characterized), the
-Corresponding Source conveyed under this section must be accompanied
-by the Installation Information.  But this requirement does not apply
-if neither you nor any third party retains the ability to install
-modified object code on the User Product (for example, the work has
-been installed in ROM).
-
-  The requirement to provide Installation Information does not include a
-requirement to continue to provide support service, warranty, or updates
-for a work that has been modified or installed by the recipient, or for
-the User Product in which it has been modified or installed.  Access to a
-network may be denied when the modification itself materially and
-adversely affects the operation of the network or violates the rules and
-protocols for communication across the network.
-
-  Corresponding Source conveyed, and Installation Information provided,
-in accord with this section must be in a format that is publicly
-documented (and with an implementation available to the public in
-source code form), and must require no special password or key for
-unpacking, reading or copying.
-
-  7. Additional Terms.
-
-  "Additional permissions" are terms that supplement the terms of this
-License by making exceptions from one or more of its conditions.
-Additional permissions that are applicable to the entire Program shall
-be treated as though they were included in this License, to the extent
-that they are valid under applicable law.  If additional permissions
-apply only to part of the Program, that part may be used separately
-under those permissions, but the entire Program remains governed by
-this License without regard to the additional permissions.
-
-  When you convey a copy of a covered work, you may at your option
-remove any additional permissions from that copy, or from any part of
-it.  (Additional permissions may be written to require their own
-removal in certain cases when you modify the work.)  You may place
-additional permissions on material, added by you to a covered work,
-for which you have or can give appropriate copyright permission.
-
-  Notwithstanding any other provision of this License, for material you
-add to a covered work, you may (if authorized by the copyright holders of
-that material) supplement the terms of this License with terms:
-
-    a) Disclaiming warranty or limiting liability differently from the
-    terms of sections 15 and 16 of this License; or
-
-    b) Requiring preservation of specified reasonable legal notices or
-    author attributions in that material or in the Appropriate Legal
-    Notices displayed by works containing it; or
-
-    c) Prohibiting misrepresentation of the origin of that material, or
-    requiring that modified versions of such material be marked in
-    reasonable ways as different from the original version; or
-
-    d) Limiting the use for publicity purposes of names of licensors or
-    authors of the material; or
-
-    e) Declining to grant rights under trademark law for use of some
-    trade names, trademarks, or service marks; or
-
-    f) Requiring indemnification of licensors and authors of that
-    material by anyone who conveys the material (or modified versions of
-    it) with contractual assumptions of liability to the recipient, for
-    any liability that these contractual assumptions directly impose on
-    those licensors and authors.
-
-  All other non-permissive additional terms are considered "further
-restrictions" within the meaning of section 10.  If the Program as you
-received it, or any part of it, contains a notice stating that it is
-governed by this License along with a term that is a further
-restriction, you may remove that term.  If a license document contains
-a further restriction but permits relicensing or conveying under this
-License, you may add to a covered work material governed by the terms
-of that license document, provided that the further restriction does
-not survive such relicensing or conveying.
-
-  If you add terms to a covered work in accord with this section, you
-must place, in the relevant source files, a statement of the
-additional terms that apply to those files, or a notice indicating
-where to find the applicable terms.
-
-  Additional terms, permissive or non-permissive, may be stated in the
-form of a separately written license, or stated as exceptions;
-the above requirements apply either way.
-
-  8. Termination.
-
-  You may not propagate or modify a covered work except as expressly
-provided under this License.  Any attempt otherwise to propagate or
-modify it is void, and will automatically terminate your rights under
-this License (including any patent licenses granted under the third
-paragraph of section 11).
-
-  However, if you cease all violation of this License, then your
-license from a particular copyright holder is reinstated (a)
-provisionally, unless and until the copyright holder explicitly and
-finally terminates your license, and (b) permanently, if the copyright
-holder fails to notify you of the violation by some reasonable means
-prior to 60 days after the cessation.
-
-  Moreover, your license from a particular copyright holder is
-reinstated permanently if the copyright holder notifies you of the
-violation by some reasonable means, this is the first time you have
-received notice of violation of this License (for any work) from that
-copyright holder, and you cure the violation prior to 30 days after
-your receipt of the notice.
-
-  Termination of your rights under this section does not terminate the
-licenses of parties who have received copies or rights from you under
-this License.  If your rights have been terminated and not permanently
-reinstated, you do not qualify to receive new licenses for the same
-material under section 10.
-
-  9. Acceptance Not Required for Having Copies.
-
-  You are not required to accept this License in order to receive or
-run a copy of the Program.  Ancillary propagation of a covered work
-occurring solely as a consequence of using peer-to-peer transmission
-to receive a copy likewise does not require acceptance.  However,
-nothing other than this License grants you permission to propagate or
-modify any covered work.  These actions infringe copyright if you do
-not accept this License.  Therefore, by modifying or propagating a
-covered work, you indicate your acceptance of this License to do so.
-
-  10. Automatic Licensing of Downstream Recipients.
-
-  Each time you convey a covered work, the recipient automatically
-receives a license from the original licensors, to run, modify and
-propagate that work, subject to this License.  You are not responsible
-for enforcing compliance by third parties with this License.
-
-  An "entity transaction" is a transaction transferring control of an
-organization, or substantially all assets of one, or subdividing an
-organization, or merging organizations.  If propagation of a covered
-work results from an entity transaction, each party to that
-transaction who receives a copy of the work also receives whatever
-licenses to the work the party's predecessor in interest had or could
-give under the previous paragraph, plus a right to possession of the
-Corresponding Source of the work from the predecessor in interest, if
-the predecessor has it or can get it with reasonable efforts.
-
-  You may not impose any further restrictions on the exercise of the
-rights granted or affirmed under this License.  For example, you may
-not impose a license fee, royalty, or other charge for exercise of
-rights granted under this License, and you may not initiate litigation
-(including a cross-claim or counterclaim in a lawsuit) alleging that
-any patent claim is infringed by making, using, selling, offering for
-sale, or importing the Program or any portion of it.
-
-  11. Patents.
-
-  A "contributor" is a copyright holder who authorizes use under this
-License of the Program or a work on which the Program is based.  The
-work thus licensed is called the contributor's "contributor version".
-
-  A contributor's "essential patent claims" are all patent claims
-owned or controlled by the contributor, whether already acquired or
-hereafter acquired, that would be infringed by some manner, permitted
-by this License, of making, using, or selling its contributor version,
-but do not include claims that would be infringed only as a
-consequence of further modification of the contributor version.  For
-purposes of this definition, "control" includes the right to grant
-patent sublicenses in a manner consistent with the requirements of
-this License.
-
-  Each contributor grants you a non-exclusive, worldwide, royalty-free
-patent license under the contributor's essential patent claims, to
-make, use, sell, offer for sale, import and otherwise run, modify and
-propagate the contents of its contributor version.
-
-  In the following three paragraphs, a "patent license" is any express
-agreement or commitment, however denominated, not to enforce a patent
-(such as an express permission to practice a patent or covenant not to
-sue for patent infringement).  To "grant" such a patent license to a
-party means to make such an agreement or commitment not to enforce a
-patent against the party.
-
-  If you convey a covered work, knowingly relying on a patent license,
-and the Corresponding Source of the work is not available for anyone
-to copy, free of charge and under the terms of this License, through a
-publicly available network server or other readily accessible means,
-then you must either (1) cause the Corresponding Source to be so
-available, or (2) arrange to deprive yourself of the benefit of the
-patent license for this particular work, or (3) arrange, in a manner
-consistent with the requirements of this License, to extend the patent
-license to downstream recipients.  "Knowingly relying" means you have
-actual knowledge that, but for the patent license, your conveying the
-covered work in a country, or your recipient's use of the covered work
-in a country, would infringe one or more identifiable patents in that
-country that you have reason to believe are valid.
-
-  If, pursuant to or in connection with a single transaction or
-arrangement, you convey, or propagate by procuring conveyance of, a
-covered work, and grant a patent license to some of the parties
-receiving the covered work authorizing them to use, propagate, modify
-or convey a specific copy of the covered work, then the patent license
-you grant is automatically extended to all recipients of the covered
-work and works based on it.
-
-  A patent license is "discriminatory" if it does not include within
-the scope of its coverage, prohibits the exercise of, or is
-conditioned on the non-exercise of one or more of the rights that are
-specifically granted under this License.  You may not convey a covered
-work if you are a party to an arrangement with a third party that is
-in the business of distributing software, under which you make payment
-to the third party based on the extent of your activity of conveying
-the work, and under which the third party grants, to any of the
-parties who would receive the covered work from you, a discriminatory
-patent license (a) in connection with copies of the covered work
-conveyed by you (or copies made from those copies), or (b) primarily
-for and in connection with specific products or compilations that
-contain the covered work, unless you entered into that arrangement,
-or that patent license was granted, prior to 28 March 2007.
-
-  Nothing in this License shall be construed as excluding or limiting
-any implied license or other defenses to infringement that may
-otherwise be available to you under applicable patent law.
-
-  12. No Surrender of Others' Freedom.
-
-  If conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot convey a
-covered work so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you may
-not convey it at all.  For example, if you agree to terms that obligate you
-to collect a royalty for further conveying from those to whom you convey
-the Program, the only way you could satisfy both those terms and this
-License would be to refrain entirely from conveying the Program.
-
-  13. Use with the GNU Affero General Public License.
-
-  Notwithstanding any other provision of this License, you have
-permission to link or combine any covered work with a work licensed
-under version 3 of the GNU Affero General Public License into a single
-combined work, and to convey the resulting work.  The terms of this
-License will continue to apply to the part which is the covered work,
-but the special requirements of the GNU Affero General Public License,
-section 13, concerning interaction through a network will apply to the
-combination as such.
-
-  14. Revised Versions of this License.
-
-  The Free Software Foundation may publish revised and/or new versions of
-the GNU General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-  Each version is given a distinguishing version number.  If the
-Program specifies that a certain numbered version of the GNU General
-Public License "or any later version" applies to it, you have the
-option of following the terms and conditions either of that numbered
-version or of any later version published by the Free Software
-Foundation.  If the Program does not specify a version number of the
-GNU General Public License, you may choose any version ever published
-by the Free Software Foundation.
-
-  If the Program specifies that a proxy can decide which future
-versions of the GNU General Public License can be used, that proxy's
-public statement of acceptance of a version permanently authorizes you
-to choose that version for the Program.
-
-  Later license versions may give you additional or different
-permissions.  However, no additional obligations are imposed on any
-author or copyright holder as a result of your choosing to follow a
-later version.
-
-  15. Disclaimer of Warranty.
-
-  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
-APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
-HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
-OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
-THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
-IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
-ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
-  16. Limitation of Liability.
-
-  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
-THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
-GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
-USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
-DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
-PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
-EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGES.
-
-  17. Interpretation of Sections 15 and 16.
-
-  If the disclaimer of warranty and limitation of liability provided
-above cannot be given local legal effect according to their terms,
-reviewing courts shall apply local law that most closely approximates
-an absolute waiver of all civil liability in connection with the
-Program, unless a warranty or assumption of liability accompanies a
-copy of the Program in return for a fee.
-
-                     END OF TERMS AND CONDITIONS
-
-            How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-state the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This program is free software: you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation, either version 3 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License
-    along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-Also add information on how to contact you by electronic and paper mail.
-
-  If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
-    <program>  Copyright (C) <year>  <name of author>
-    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
-  You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-<http://www.gnu.org/licenses/>.
-
-  The GNU General Public License does not permit incorporating your program
-into proprietary programs.  If your program is a subroutine library, you
-may consider it more useful to permit linking proprietary applications with
-the library.  If this is what you want to do, use the GNU Lesser General
-Public License instead of this License.  But first, please read
-<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/Installation/LICENSES/GPL-3.0-or-later.txt b/Installation/LICENSES/GPL-3.0-or-later.txt
deleted file mode 100644
index 94a9ed024d38..000000000000
--- a/Installation/LICENSES/GPL-3.0-or-later.txt
+++ /dev/null
@@ -1,674 +0,0 @@
-                    GNU GENERAL PUBLIC LICENSE
-                       Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-                            Preamble
-
-  The GNU General Public License is a free, copyleft license for
-software and other kinds of works.
-
-  The licenses for most software and other practical works are designed
-to take away your freedom to share and change the works.  By contrast,
-the GNU General Public License is intended to guarantee your freedom to
-share and change all versions of a program--to make sure it remains free
-software for all its users.  We, the Free Software Foundation, use the
-GNU General Public License for most of our software; it applies also to
-any other work released this way by its authors.  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-them if you wish), that you receive source code or can get it if you
-want it, that you can change the software or use pieces of it in new
-free programs, and that you know you can do these things.
-
-  To protect your rights, we need to prevent others from denying you
-these rights or asking you to surrender the rights.  Therefore, you have
-certain responsibilities if you distribute copies of the software, or if
-you modify it: responsibilities to respect the freedom of others.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must pass on to the recipients the same
-freedoms that you received.  You must make sure that they, too, receive
-or can get the source code.  And you must show them these terms so they
-know their rights.
-
-  Developers that use the GNU GPL protect your rights with two steps:
-(1) assert copyright on the software, and (2) offer you this License
-giving you legal permission to copy, distribute and/or modify it.
-
-  For the developers' and authors' protection, the GPL clearly explains
-that there is no warranty for this free software.  For both users' and
-authors' sake, the GPL requires that modified versions be marked as
-changed, so that their problems will not be attributed erroneously to
-authors of previous versions.
-
-  Some devices are designed to deny users access to install or run
-modified versions of the software inside them, although the manufacturer
-can do so.  This is fundamentally incompatible with the aim of
-protecting users' freedom to change the software.  The systematic
-pattern of such abuse occurs in the area of products for individuals to
-use, which is precisely where it is most unacceptable.  Therefore, we
-have designed this version of the GPL to prohibit the practice for those
-products.  If such problems arise substantially in other domains, we
-stand ready to extend this provision to those domains in future versions
-of the GPL, as needed to protect the freedom of users.
-
-  Finally, every program is threatened constantly by software patents.
-States should not allow patents to restrict development and use of
-software on general-purpose computers, but in those that do, we wish to
-avoid the special danger that patents applied to a free program could
-make it effectively proprietary.  To prevent this, the GPL assures that
-patents cannot be used to render the program non-free.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-                       TERMS AND CONDITIONS
-
-  0. Definitions.
-
-  "This License" refers to version 3 of the GNU General Public License.
-
-  "Copyright" also means copyright-like laws that apply to other kinds of
-works, such as semiconductor masks.
-
-  "The Program" refers to any copyrightable work licensed under this
-License.  Each licensee is addressed as "you".  "Licensees" and
-"recipients" may be individuals or organizations.
-
-  To "modify" a work means to copy from or adapt all or part of the work
-in a fashion requiring copyright permission, other than the making of an
-exact copy.  The resulting work is called a "modified version" of the
-earlier work or a work "based on" the earlier work.
-
-  A "covered work" means either the unmodified Program or a work based
-on the Program.
-
-  To "propagate" a work means to do anything with it that, without
-permission, would make you directly or secondarily liable for
-infringement under applicable copyright law, except executing it on a
-computer or modifying a private copy.  Propagation includes copying,
-distribution (with or without modification), making available to the
-public, and in some countries other activities as well.
-
-  To "convey" a work means any kind of propagation that enables other
-parties to make or receive copies.  Mere interaction with a user through
-a computer network, with no transfer of a copy, is not conveying.
-
-  An interactive user interface displays "Appropriate Legal Notices"
-to the extent that it includes a convenient and prominently visible
-feature that (1) displays an appropriate copyright notice, and (2)
-tells the user that there is no warranty for the work (except to the
-extent that warranties are provided), that licensees may convey the
-work under this License, and how to view a copy of this License.  If
-the interface presents a list of user commands or options, such as a
-menu, a prominent item in the list meets this criterion.
-
-  1. Source Code.
-
-  The "source code" for a work means the preferred form of the work
-for making modifications to it.  "Object code" means any non-source
-form of a work.
-
-  A "Standard Interface" means an interface that either is an official
-standard defined by a recognized standards body, or, in the case of
-interfaces specified for a particular programming language, one that
-is widely used among developers working in that language.
-
-  The "System Libraries" of an executable work include anything, other
-than the work as a whole, that (a) is included in the normal form of
-packaging a Major Component, but which is not part of that Major
-Component, and (b) serves only to enable use of the work with that
-Major Component, or to implement a Standard Interface for which an
-implementation is available to the public in source code form.  A
-"Major Component", in this context, means a major essential component
-(kernel, window system, and so on) of the specific operating system
-(if any) on which the executable work runs, or a compiler used to
-produce the work, or an object code interpreter used to run it.
-
-  The "Corresponding Source" for a work in object code form means all
-the source code needed to generate, install, and (for an executable
-work) run the object code and to modify the work, including scripts to
-control those activities.  However, it does not include the work's
-System Libraries, or general-purpose tools or generally available free
-programs which are used unmodified in performing those activities but
-which are not part of the work.  For example, Corresponding Source
-includes interface definition files associated with source files for
-the work, and the source code for shared libraries and dynamically
-linked subprograms that the work is specifically designed to require,
-such as by intimate data communication or control flow between those
-subprograms and other parts of the work.
-
-  The Corresponding Source need not include anything that users
-can regenerate automatically from other parts of the Corresponding
-Source.
-
-  The Corresponding Source for a work in source code form is that
-same work.
-
-  2. Basic Permissions.
-
-  All rights granted under this License are granted for the term of
-copyright on the Program, and are irrevocable provided the stated
-conditions are met.  This License explicitly affirms your unlimited
-permission to run the unmodified Program.  The output from running a
-covered work is covered by this License only if the output, given its
-content, constitutes a covered work.  This License acknowledges your
-rights of fair use or other equivalent, as provided by copyright law.
-
-  You may make, run and propagate covered works that you do not
-convey, without conditions so long as your license otherwise remains
-in force.  You may convey covered works to others for the sole purpose
-of having them make modifications exclusively for you, or provide you
-with facilities for running those works, provided that you comply with
-the terms of this License in conveying all material for which you do
-not control copyright.  Those thus making or running the covered works
-for you must do so exclusively on your behalf, under your direction
-and control, on terms that prohibit them from making any copies of
-your copyrighted material outside their relationship with you.
-
-  Conveying under any other circumstances is permitted solely under
-the conditions stated below.  Sublicensing is not allowed; section 10
-makes it unnecessary.
-
-  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
-
-  No covered work shall be deemed part of an effective technological
-measure under any applicable law fulfilling obligations under article
-11 of the WIPO copyright treaty adopted on 20 December 1996, or
-similar laws prohibiting or restricting circumvention of such
-measures.
-
-  When you convey a covered work, you waive any legal power to forbid
-circumvention of technological measures to the extent such circumvention
-is effected by exercising rights under this License with respect to
-the covered work, and you disclaim any intention to limit operation or
-modification of the work as a means of enforcing, against the work's
-users, your or third parties' legal rights to forbid circumvention of
-technological measures.
-
-  4. Conveying Verbatim Copies.
-
-  You may convey verbatim copies of the Program's source code as you
-receive it, in any medium, provided that you conspicuously and
-appropriately publish on each copy an appropriate copyright notice;
-keep intact all notices stating that this License and any
-non-permissive terms added in accord with section 7 apply to the code;
-keep intact all notices of the absence of any warranty; and give all
-recipients a copy of this License along with the Program.
-
-  You may charge any price or no price for each copy that you convey,
-and you may offer support or warranty protection for a fee.
-
-  5. Conveying Modified Source Versions.
-
-  You may convey a work based on the Program, or the modifications to
-produce it from the Program, in the form of source code under the
-terms of section 4, provided that you also meet all of these conditions:
-
-    a) The work must carry prominent notices stating that you modified
-    it, and giving a relevant date.
-
-    b) The work must carry prominent notices stating that it is
-    released under this License and any conditions added under section
-    7.  This requirement modifies the requirement in section 4 to
-    "keep intact all notices".
-
-    c) You must license the entire work, as a whole, under this
-    License to anyone who comes into possession of a copy.  This
-    License will therefore apply, along with any applicable section 7
-    additional terms, to the whole of the work, and all its parts,
-    regardless of how they are packaged.  This License gives no
-    permission to license the work in any other way, but it does not
-    invalidate such permission if you have separately received it.
-
-    d) If the work has interactive user interfaces, each must display
-    Appropriate Legal Notices; however, if the Program has interactive
-    interfaces that do not display Appropriate Legal Notices, your
-    work need not make them do so.
-
-  A compilation of a covered work with other separate and independent
-works, which are not by their nature extensions of the covered work,
-and which are not combined with it such as to form a larger program,
-in or on a volume of a storage or distribution medium, is called an
-"aggregate" if the compilation and its resulting copyright are not
-used to limit the access or legal rights of the compilation's users
-beyond what the individual works permit.  Inclusion of a covered work
-in an aggregate does not cause this License to apply to the other
-parts of the aggregate.
-
-  6. Conveying Non-Source Forms.
-
-  You may convey a covered work in object code form under the terms
-of sections 4 and 5, provided that you also convey the
-machine-readable Corresponding Source under the terms of this License,
-in one of these ways:
-
-    a) Convey the object code in, or embodied in, a physical product
-    (including a physical distribution medium), accompanied by the
-    Corresponding Source fixed on a durable physical medium
-    customarily used for software interchange.
-
-    b) Convey the object code in, or embodied in, a physical product
-    (including a physical distribution medium), accompanied by a
-    written offer, valid for at least three years and valid for as
-    long as you offer spare parts or customer support for that product
-    model, to give anyone who possesses the object code either (1) a
-    copy of the Corresponding Source for all the software in the
-    product that is covered by this License, on a durable physical
-    medium customarily used for software interchange, for a price no
-    more than your reasonable cost of physically performing this
-    conveying of source, or (2) access to copy the
-    Corresponding Source from a network server at no charge.
-
-    c) Convey individual copies of the object code with a copy of the
-    written offer to provide the Corresponding Source.  This
-    alternative is allowed only occasionally and noncommercially, and
-    only if you received the object code with such an offer, in accord
-    with subsection 6b.
-
-    d) Convey the object code by offering access from a designated
-    place (gratis or for a charge), and offer equivalent access to the
-    Corresponding Source in the same way through the same place at no
-    further charge.  You need not require recipients to copy the
-    Corresponding Source along with the object code.  If the place to
-    copy the object code is a network server, the Corresponding Source
-    may be on a different server (operated by you or a third party)
-    that supports equivalent copying facilities, provided you maintain
-    clear directions next to the object code saying where to find the
-    Corresponding Source.  Regardless of what server hosts the
-    Corresponding Source, you remain obligated to ensure that it is
-    available for as long as needed to satisfy these requirements.
-
-    e) Convey the object code using peer-to-peer transmission, provided
-    you inform other peers where the object code and Corresponding
-    Source of the work are being offered to the general public at no
-    charge under subsection 6d.
-
-  A separable portion of the object code, whose source code is excluded
-from the Corresponding Source as a System Library, need not be
-included in conveying the object code work.
-
-  A "User Product" is either (1) a "consumer product", which means any
-tangible personal property which is normally used for personal, family,
-or household purposes, or (2) anything designed or sold for incorporation
-into a dwelling.  In determining whether a product is a consumer product,
-doubtful cases shall be resolved in favor of coverage.  For a particular
-product received by a particular user, "normally used" refers to a
-typical or common use of that class of product, regardless of the status
-of the particular user or of the way in which the particular user
-actually uses, or expects or is expected to use, the product.  A product
-is a consumer product regardless of whether the product has substantial
-commercial, industrial or non-consumer uses, unless such uses represent
-the only significant mode of use of the product.
-
-  "Installation Information" for a User Product means any methods,
-procedures, authorization keys, or other information required to install
-and execute modified versions of a covered work in that User Product from
-a modified version of its Corresponding Source.  The information must
-suffice to ensure that the continued functioning of the modified object
-code is in no case prevented or interfered with solely because
-modification has been made.
-
-  If you convey an object code work under this section in, or with, or
-specifically for use in, a User Product, and the conveying occurs as
-part of a transaction in which the right of possession and use of the
-User Product is transferred to the recipient in perpetuity or for a
-fixed term (regardless of how the transaction is characterized), the
-Corresponding Source conveyed under this section must be accompanied
-by the Installation Information.  But this requirement does not apply
-if neither you nor any third party retains the ability to install
-modified object code on the User Product (for example, the work has
-been installed in ROM).
-
-  The requirement to provide Installation Information does not include a
-requirement to continue to provide support service, warranty, or updates
-for a work that has been modified or installed by the recipient, or for
-the User Product in which it has been modified or installed.  Access to a
-network may be denied when the modification itself materially and
-adversely affects the operation of the network or violates the rules and
-protocols for communication across the network.
-
-  Corresponding Source conveyed, and Installation Information provided,
-in accord with this section must be in a format that is publicly
-documented (and with an implementation available to the public in
-source code form), and must require no special password or key for
-unpacking, reading or copying.
-
-  7. Additional Terms.
-
-  "Additional permissions" are terms that supplement the terms of this
-License by making exceptions from one or more of its conditions.
-Additional permissions that are applicable to the entire Program shall
-be treated as though they were included in this License, to the extent
-that they are valid under applicable law.  If additional permissions
-apply only to part of the Program, that part may be used separately
-under those permissions, but the entire Program remains governed by
-this License without regard to the additional permissions.
-
-  When you convey a copy of a covered work, you may at your option
-remove any additional permissions from that copy, or from any part of
-it.  (Additional permissions may be written to require their own
-removal in certain cases when you modify the work.)  You may place
-additional permissions on material, added by you to a covered work,
-for which you have or can give appropriate copyright permission.
-
-  Notwithstanding any other provision of this License, for material you
-add to a covered work, you may (if authorized by the copyright holders of
-that material) supplement the terms of this License with terms:
-
-    a) Disclaiming warranty or limiting liability differently from the
-    terms of sections 15 and 16 of this License; or
-
-    b) Requiring preservation of specified reasonable legal notices or
-    author attributions in that material or in the Appropriate Legal
-    Notices displayed by works containing it; or
-
-    c) Prohibiting misrepresentation of the origin of that material, or
-    requiring that modified versions of such material be marked in
-    reasonable ways as different from the original version; or
-
-    d) Limiting the use for publicity purposes of names of licensors or
-    authors of the material; or
-
-    e) Declining to grant rights under trademark law for use of some
-    trade names, trademarks, or service marks; or
-
-    f) Requiring indemnification of licensors and authors of that
-    material by anyone who conveys the material (or modified versions of
-    it) with contractual assumptions of liability to the recipient, for
-    any liability that these contractual assumptions directly impose on
-    those licensors and authors.
-
-  All other non-permissive additional terms are considered "further
-restrictions" within the meaning of section 10.  If the Program as you
-received it, or any part of it, contains a notice stating that it is
-governed by this License along with a term that is a further
-restriction, you may remove that term.  If a license document contains
-a further restriction but permits relicensing or conveying under this
-License, you may add to a covered work material governed by the terms
-of that license document, provided that the further restriction does
-not survive such relicensing or conveying.
-
-  If you add terms to a covered work in accord with this section, you
-must place, in the relevant source files, a statement of the
-additional terms that apply to those files, or a notice indicating
-where to find the applicable terms.
-
-  Additional terms, permissive or non-permissive, may be stated in the
-form of a separately written license, or stated as exceptions;
-the above requirements apply either way.
-
-  8. Termination.
-
-  You may not propagate or modify a covered work except as expressly
-provided under this License.  Any attempt otherwise to propagate or
-modify it is void, and will automatically terminate your rights under
-this License (including any patent licenses granted under the third
-paragraph of section 11).
-
-  However, if you cease all violation of this License, then your
-license from a particular copyright holder is reinstated (a)
-provisionally, unless and until the copyright holder explicitly and
-finally terminates your license, and (b) permanently, if the copyright
-holder fails to notify you of the violation by some reasonable means
-prior to 60 days after the cessation.
-
-  Moreover, your license from a particular copyright holder is
-reinstated permanently if the copyright holder notifies you of the
-violation by some reasonable means, this is the first time you have
-received notice of violation of this License (for any work) from that
-copyright holder, and you cure the violation prior to 30 days after
-your receipt of the notice.
-
-  Termination of your rights under this section does not terminate the
-licenses of parties who have received copies or rights from you under
-this License.  If your rights have been terminated and not permanently
-reinstated, you do not qualify to receive new licenses for the same
-material under section 10.
-
-  9. Acceptance Not Required for Having Copies.
-
-  You are not required to accept this License in order to receive or
-run a copy of the Program.  Ancillary propagation of a covered work
-occurring solely as a consequence of using peer-to-peer transmission
-to receive a copy likewise does not require acceptance.  However,
-nothing other than this License grants you permission to propagate or
-modify any covered work.  These actions infringe copyright if you do
-not accept this License.  Therefore, by modifying or propagating a
-covered work, you indicate your acceptance of this License to do so.
-
-  10. Automatic Licensing of Downstream Recipients.
-
-  Each time you convey a covered work, the recipient automatically
-receives a license from the original licensors, to run, modify and
-propagate that work, subject to this License.  You are not responsible
-for enforcing compliance by third parties with this License.
-
-  An "entity transaction" is a transaction transferring control of an
-organization, or substantially all assets of one, or subdividing an
-organization, or merging organizations.  If propagation of a covered
-work results from an entity transaction, each party to that
-transaction who receives a copy of the work also receives whatever
-licenses to the work the party's predecessor in interest had or could
-give under the previous paragraph, plus a right to possession of the
-Corresponding Source of the work from the predecessor in interest, if
-the predecessor has it or can get it with reasonable efforts.
-
-  You may not impose any further restrictions on the exercise of the
-rights granted or affirmed under this License.  For example, you may
-not impose a license fee, royalty, or other charge for exercise of
-rights granted under this License, and you may not initiate litigation
-(including a cross-claim or counterclaim in a lawsuit) alleging that
-any patent claim is infringed by making, using, selling, offering for
-sale, or importing the Program or any portion of it.
-
-  11. Patents.
-
-  A "contributor" is a copyright holder who authorizes use under this
-License of the Program or a work on which the Program is based.  The
-work thus licensed is called the contributor's "contributor version".
-
-  A contributor's "essential patent claims" are all patent claims
-owned or controlled by the contributor, whether already acquired or
-hereafter acquired, that would be infringed by some manner, permitted
-by this License, of making, using, or selling its contributor version,
-but do not include claims that would be infringed only as a
-consequence of further modification of the contributor version.  For
-purposes of this definition, "control" includes the right to grant
-patent sublicenses in a manner consistent with the requirements of
-this License.
-
-  Each contributor grants you a non-exclusive, worldwide, royalty-free
-patent license under the contributor's essential patent claims, to
-make, use, sell, offer for sale, import and otherwise run, modify and
-propagate the contents of its contributor version.
-
-  In the following three paragraphs, a "patent license" is any express
-agreement or commitment, however denominated, not to enforce a patent
-(such as an express permission to practice a patent or covenant not to
-sue for patent infringement).  To "grant" such a patent license to a
-party means to make such an agreement or commitment not to enforce a
-patent against the party.
-
-  If you convey a covered work, knowingly relying on a patent license,
-and the Corresponding Source of the work is not available for anyone
-to copy, free of charge and under the terms of this License, through a
-publicly available network server or other readily accessible means,
-then you must either (1) cause the Corresponding Source to be so
-available, or (2) arrange to deprive yourself of the benefit of the
-patent license for this particular work, or (3) arrange, in a manner
-consistent with the requirements of this License, to extend the patent
-license to downstream recipients.  "Knowingly relying" means you have
-actual knowledge that, but for the patent license, your conveying the
-covered work in a country, or your recipient's use of the covered work
-in a country, would infringe one or more identifiable patents in that
-country that you have reason to believe are valid.
-
-  If, pursuant to or in connection with a single transaction or
-arrangement, you convey, or propagate by procuring conveyance of, a
-covered work, and grant a patent license to some of the parties
-receiving the covered work authorizing them to use, propagate, modify
-or convey a specific copy of the covered work, then the patent license
-you grant is automatically extended to all recipients of the covered
-work and works based on it.
-
-  A patent license is "discriminatory" if it does not include within
-the scope of its coverage, prohibits the exercise of, or is
-conditioned on the non-exercise of one or more of the rights that are
-specifically granted under this License.  You may not convey a covered
-work if you are a party to an arrangement with a third party that is
-in the business of distributing software, under which you make payment
-to the third party based on the extent of your activity of conveying
-the work, and under which the third party grants, to any of the
-parties who would receive the covered work from you, a discriminatory
-patent license (a) in connection with copies of the covered work
-conveyed by you (or copies made from those copies), or (b) primarily
-for and in connection with specific products or compilations that
-contain the covered work, unless you entered into that arrangement,
-or that patent license was granted, prior to 28 March 2007.
-
-  Nothing in this License shall be construed as excluding or limiting
-any implied license or other defenses to infringement that may
-otherwise be available to you under applicable patent law.
-
-  12. No Surrender of Others' Freedom.
-
-  If conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot convey a
-covered work so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you may
-not convey it at all.  For example, if you agree to terms that obligate you
-to collect a royalty for further conveying from those to whom you convey
-the Program, the only way you could satisfy both those terms and this
-License would be to refrain entirely from conveying the Program.
-
-  13. Use with the GNU Affero General Public License.
-
-  Notwithstanding any other provision of this License, you have
-permission to link or combine any covered work with a work licensed
-under version 3 of the GNU Affero General Public License into a single
-combined work, and to convey the resulting work.  The terms of this
-License will continue to apply to the part which is the covered work,
-but the special requirements of the GNU Affero General Public License,
-section 13, concerning interaction through a network will apply to the
-combination as such.
-
-  14. Revised Versions of this License.
-
-  The Free Software Foundation may publish revised and/or new versions of
-the GNU General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-  Each version is given a distinguishing version number.  If the
-Program specifies that a certain numbered version of the GNU General
-Public License "or any later version" applies to it, you have the
-option of following the terms and conditions either of that numbered
-version or of any later version published by the Free Software
-Foundation.  If the Program does not specify a version number of the
-GNU General Public License, you may choose any version ever published
-by the Free Software Foundation.
-
-  If the Program specifies that a proxy can decide which future
-versions of the GNU General Public License can be used, that proxy's
-public statement of acceptance of a version permanently authorizes you
-to choose that version for the Program.
-
-  Later license versions may give you additional or different
-permissions.  However, no additional obligations are imposed on any
-author or copyright holder as a result of your choosing to follow a
-later version.
-
-  15. Disclaimer of Warranty.
-
-  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
-APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
-HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
-OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
-THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
-IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
-ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
-  16. Limitation of Liability.
-
-  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
-THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
-GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
-USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
-DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
-PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
-EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGES.
-
-  17. Interpretation of Sections 15 and 16.
-
-  If the disclaimer of warranty and limitation of liability provided
-above cannot be given local legal effect according to their terms,
-reviewing courts shall apply local law that most closely approximates
-an absolute waiver of all civil liability in connection with the
-Program, unless a warranty or assumption of liability accompanies a
-copy of the Program in return for a fee.
-
-                     END OF TERMS AND CONDITIONS
-
-            How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-state the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This program is free software: you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation, either version 3 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License
-    along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-Also add information on how to contact you by electronic and paper mail.
-
-  If the program does terminal interaction, make it output a short
-notice like this when it starts in an interactive mode:
-
-    <program>  Copyright (C) <year>  <name of author>
-    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, your program's commands
-might be different; for a GUI interface, you would use an "about box".
-
-  You should also get your employer (if you work as a programmer) or school,
-if any, to sign a "copyright disclaimer" for the program, if necessary.
-For more information on this, and how to apply and follow the GNU GPL, see
-<http://www.gnu.org/licenses/>.
-
-  The GNU General Public License does not permit incorporating your program
-into proprietary programs.  If your program is a subroutine library, you
-may consider it more useful to permit linking proprietary applications with
-the library.  If this is what you want to do, use the GNU Lesser General
-Public License instead of this License.  But first, please read
-<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/Installation/LICENSES/LGPL-2.1-only.txt b/Installation/LICENSES/LGPL-2.1-only.txt
deleted file mode 100644
index b042f57e217b..000000000000
--- a/Installation/LICENSES/LGPL-2.1-only.txt
+++ /dev/null
@@ -1,178 +0,0 @@
-
-GNU LESSER GENERAL PUBLIC LICENSE
-
-Version 2.1, February 1999
-
-Copyright (C) 1991, 1999 Free Software Foundation, Inc.
-51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
-Everyone is permitted to copy and distribute verbatim copies
-of this license document, but changing it is not allowed.
-
-[This is the first released version of the Lesser GPL.  It also counts
- as the successor of the GNU Library Public License, version 2, hence
- the version number 2.1.]
-
-Preamble
-
-The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users.
-
-This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below.
-
-When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things.
-
-To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it.
-
-For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights.
-
-We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library.
-
-To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others.
-
-Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license.
-
-Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs.
-
-When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library.
-
-We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances.
-
-For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License.
-
-In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system.
-
-Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library.
-
-The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run.
-TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you".
-
-A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables.
-
-The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".)
-
-"Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library.
-
-Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does.
-
-1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library.
-
-You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee.
-
-2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions:
-
-    a) The modified work must itself be a software library.
-    b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change.
-    c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License.
-    d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful.
-
-    (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.)
-
-These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library.
-
-In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License.
-
-3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices.
-
-Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy.
-
-This option is useful when you wish to copy part of the code of the Library into a program that is not a library.
-
-4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange.
-
-If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code.
-
-5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License.
-
-However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables.
-
-When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law.
-
-If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.)
-
-Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself.
-
-6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications.
-
-You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things:
-
-    a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.)
-    b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with.
-    c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution.
-    d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place.
-    e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy.
-
-For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable.
-
-It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute.
-
-7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things:
-
-    a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above.
-    b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work.
-
-8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance.
-
-9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it.
-
-10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License.
-
-11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library.
-
-If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances.
-
-It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice.
-
-This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License.
-
-12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License.
-
-13. The Free Software Foundation may publish revised and/or new versions of the Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns.
-
-Each version is given a distinguishing version number. If the Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation.
-
-14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally.
-
-NO WARRANTY
-
-15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
-
-16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
-END OF TERMS AND CONDITIONS
-How to Apply These Terms to Your New Libraries
-
-If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License).
-
-To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found.
-
-one line to give the library's name and an idea of what it does.
-Copyright (C) year  name of author
-
-This library is free software; you can redistribute it and/or
-modify it under the terms of the GNU Lesser General Public
-License as published by the Free Software Foundation; either
-version 2.1 of the License, or (at your option) any later version.
-
-This library is distributed in the hope that it will be useful,
-but WITHOUT ANY WARRANTY; without even the implied warranty of
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-Lesser General Public License for more details.
-
-You should have received a copy of the GNU Lesser General Public
-License along with this library; if not, write to the Free Software
-Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
-
-Also add information on how to contact you by electronic and paper mail.
-
-You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names:
-
-Yoyodyne, Inc., hereby disclaims all copyright interest in
-the library `Frob' (a library for tweaking knobs) written
-by James Random Hacker.
-
-signature of Ty Coon, 1 April 1990
-Ty Coon, President of Vice
-
-That's all there is to it!
diff --git a/Installation/LICENSES/LGPL-3.0-only.txt b/Installation/LICENSES/LGPL-3.0-only.txt
deleted file mode 100644
index 65c5ca88a67c..000000000000
--- a/Installation/LICENSES/LGPL-3.0-only.txt
+++ /dev/null
@@ -1,165 +0,0 @@
-                   GNU LESSER GENERAL PUBLIC LICENSE
-                       Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-
-  This version of the GNU Lesser General Public License incorporates
-the terms and conditions of version 3 of the GNU General Public
-License, supplemented by the additional permissions listed below.
-
-  0. Additional Definitions.
-
-  As used herein, "this License" refers to version 3 of the GNU Lesser
-General Public License, and the "GNU GPL" refers to version 3 of the GNU
-General Public License.
-
-  "The Library" refers to a covered work governed by this License,
-other than an Application or a Combined Work as defined below.
-
-  An "Application" is any work that makes use of an interface provided
-by the Library, but which is not otherwise based on the Library.
-Defining a subclass of a class defined by the Library is deemed a mode
-of using an interface provided by the Library.
-
-  A "Combined Work" is a work produced by combining or linking an
-Application with the Library.  The particular version of the Library
-with which the Combined Work was made is also called the "Linked
-Version".
-
-  The "Minimal Corresponding Source" for a Combined Work means the
-Corresponding Source for the Combined Work, excluding any source code
-for portions of the Combined Work that, considered in isolation, are
-based on the Application, and not on the Linked Version.
-
-  The "Corresponding Application Code" for a Combined Work means the
-object code and/or source code for the Application, including any data
-and utility programs needed for reproducing the Combined Work from the
-Application, but excluding the System Libraries of the Combined Work.
-
-  1. Exception to Section 3 of the GNU GPL.
-
-  You may convey a covered work under sections 3 and 4 of this License
-without being bound by section 3 of the GNU GPL.
-
-  2. Conveying Modified Versions.
-
-  If you modify a copy of the Library, and, in your modifications, a
-facility refers to a function or data to be supplied by an Application
-that uses the facility (other than as an argument passed when the
-facility is invoked), then you may convey a copy of the modified
-version:
-
-   a) under this License, provided that you make a good faith effort to
-   ensure that, in the event an Application does not supply the
-   function or data, the facility still operates, and performs
-   whatever part of its purpose remains meaningful, or
-
-   b) under the GNU GPL, with none of the additional permissions of
-   this License applicable to that copy.
-
-  3. Object Code Incorporating Material from Library Header Files.
-
-  The object code form of an Application may incorporate material from
-a header file that is part of the Library.  You may convey such object
-code under terms of your choice, provided that, if the incorporated
-material is not limited to numerical parameters, data structure
-layouts and accessors, or small macros, inline functions and templates
-(ten or fewer lines in length), you do both of the following:
-
-   a) Give prominent notice with each copy of the object code that the
-   Library is used in it and that the Library and its use are
-   covered by this License.
-
-   b) Accompany the object code with a copy of the GNU GPL and this license
-   document.
-
-  4. Combined Works.
-
-  You may convey a Combined Work under terms of your choice that,
-taken together, effectively do not restrict modification of the
-portions of the Library contained in the Combined Work and reverse
-engineering for debugging such modifications, if you also do each of
-the following:
-
-   a) Give prominent notice with each copy of the Combined Work that
-   the Library is used in it and that the Library and its use are
-   covered by this License.
-
-   b) Accompany the Combined Work with a copy of the GNU GPL and this license
-   document.
-
-   c) For a Combined Work that displays copyright notices during
-   execution, include the copyright notice for the Library among
-   these notices, as well as a reference directing the user to the
-   copies of the GNU GPL and this license document.
-
-   d) Do one of the following:
-
-       0) Convey the Minimal Corresponding Source under the terms of this
-       License, and the Corresponding Application Code in a form
-       suitable for, and under terms that permit, the user to
-       recombine or relink the Application with a modified version of
-       the Linked Version to produce a modified Combined Work, in the
-       manner specified by section 6 of the GNU GPL for conveying
-       Corresponding Source.
-
-       1) Use a suitable shared library mechanism for linking with the
-       Library.  A suitable mechanism is one that (a) uses at run time
-       a copy of the Library already present on the user's computer
-       system, and (b) will operate properly with a modified version
-       of the Library that is interface-compatible with the Linked
-       Version.
-
-   e) Provide Installation Information, but only if you would otherwise
-   be required to provide such information under section 6 of the
-   GNU GPL, and only to the extent that such information is
-   necessary to install and execute a modified version of the
-   Combined Work produced by recombining or relinking the
-   Application with a modified version of the Linked Version. (If
-   you use option 4d0, the Installation Information must accompany
-   the Minimal Corresponding Source and Corresponding Application
-   Code. If you use option 4d1, you must provide the Installation
-   Information in the manner specified by section 6 of the GNU GPL
-   for conveying Corresponding Source.)
-
-  5. Combined Libraries.
-
-  You may place library facilities that are a work based on the
-Library side by side in a single library together with other library
-facilities that are not Applications and are not covered by this
-License, and convey such a combined library under terms of your
-choice, if you do both of the following:
-
-   a) Accompany the combined library with a copy of the same work based
-   on the Library, uncombined with any other library facilities,
-   conveyed under the terms of this License.
-
-   b) Give prominent notice with the combined library that part of it
-   is a work based on the Library, and explaining where to find the
-   accompanying uncombined form of the same work.
-
-  6. Revised Versions of the GNU Lesser General Public License.
-
-  The Free Software Foundation may publish revised and/or new versions
-of the GNU Lesser General Public License from time to time. Such new
-versions will be similar in spirit to the present version, but may
-differ in detail to address new problems or concerns.
-
-  Each version is given a distinguishing version number. If the
-Library as you received it specifies that a certain numbered version
-of the GNU Lesser General Public License "or any later version"
-applies to it, you have the option of following the terms and
-conditions either of that published version or of any later version
-published by the Free Software Foundation. If the Library as you
-received it does not specify a version number of the GNU Lesser
-General Public License, you may choose any version of the GNU Lesser
-General Public License ever published by the Free Software Foundation.
-
-  If the Library as you received it specifies that a proxy can decide
-whether future versions of the GNU Lesser General Public License shall
-apply, that proxy's public statement of acceptance of any version is
-permanent authorization for you to choose that version for the
-Library.
diff --git a/Installation/LICENSES/LGPL-3.0-or-later.txt b/Installation/LICENSES/LGPL-3.0-or-later.txt
deleted file mode 100644
index 65c5ca88a67c..000000000000
--- a/Installation/LICENSES/LGPL-3.0-or-later.txt
+++ /dev/null
@@ -1,165 +0,0 @@
-                   GNU LESSER GENERAL PUBLIC LICENSE
-                       Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-
-  This version of the GNU Lesser General Public License incorporates
-the terms and conditions of version 3 of the GNU General Public
-License, supplemented by the additional permissions listed below.
-
-  0. Additional Definitions.
-
-  As used herein, "this License" refers to version 3 of the GNU Lesser
-General Public License, and the "GNU GPL" refers to version 3 of the GNU
-General Public License.
-
-  "The Library" refers to a covered work governed by this License,
-other than an Application or a Combined Work as defined below.
-
-  An "Application" is any work that makes use of an interface provided
-by the Library, but which is not otherwise based on the Library.
-Defining a subclass of a class defined by the Library is deemed a mode
-of using an interface provided by the Library.
-
-  A "Combined Work" is a work produced by combining or linking an
-Application with the Library.  The particular version of the Library
-with which the Combined Work was made is also called the "Linked
-Version".
-
-  The "Minimal Corresponding Source" for a Combined Work means the
-Corresponding Source for the Combined Work, excluding any source code
-for portions of the Combined Work that, considered in isolation, are
-based on the Application, and not on the Linked Version.
-
-  The "Corresponding Application Code" for a Combined Work means the
-object code and/or source code for the Application, including any data
-and utility programs needed for reproducing the Combined Work from the
-Application, but excluding the System Libraries of the Combined Work.
-
-  1. Exception to Section 3 of the GNU GPL.
-
-  You may convey a covered work under sections 3 and 4 of this License
-without being bound by section 3 of the GNU GPL.
-
-  2. Conveying Modified Versions.
-
-  If you modify a copy of the Library, and, in your modifications, a
-facility refers to a function or data to be supplied by an Application
-that uses the facility (other than as an argument passed when the
-facility is invoked), then you may convey a copy of the modified
-version:
-
-   a) under this License, provided that you make a good faith effort to
-   ensure that, in the event an Application does not supply the
-   function or data, the facility still operates, and performs
-   whatever part of its purpose remains meaningful, or
-
-   b) under the GNU GPL, with none of the additional permissions of
-   this License applicable to that copy.
-
-  3. Object Code Incorporating Material from Library Header Files.
-
-  The object code form of an Application may incorporate material from
-a header file that is part of the Library.  You may convey such object
-code under terms of your choice, provided that, if the incorporated
-material is not limited to numerical parameters, data structure
-layouts and accessors, or small macros, inline functions and templates
-(ten or fewer lines in length), you do both of the following:
-
-   a) Give prominent notice with each copy of the object code that the
-   Library is used in it and that the Library and its use are
-   covered by this License.
-
-   b) Accompany the object code with a copy of the GNU GPL and this license
-   document.
-
-  4. Combined Works.
-
-  You may convey a Combined Work under terms of your choice that,
-taken together, effectively do not restrict modification of the
-portions of the Library contained in the Combined Work and reverse
-engineering for debugging such modifications, if you also do each of
-the following:
-
-   a) Give prominent notice with each copy of the Combined Work that
-   the Library is used in it and that the Library and its use are
-   covered by this License.
-
-   b) Accompany the Combined Work with a copy of the GNU GPL and this license
-   document.
-
-   c) For a Combined Work that displays copyright notices during
-   execution, include the copyright notice for the Library among
-   these notices, as well as a reference directing the user to the
-   copies of the GNU GPL and this license document.
-
-   d) Do one of the following:
-
-       0) Convey the Minimal Corresponding Source under the terms of this
-       License, and the Corresponding Application Code in a form
-       suitable for, and under terms that permit, the user to
-       recombine or relink the Application with a modified version of
-       the Linked Version to produce a modified Combined Work, in the
-       manner specified by section 6 of the GNU GPL for conveying
-       Corresponding Source.
-
-       1) Use a suitable shared library mechanism for linking with the
-       Library.  A suitable mechanism is one that (a) uses at run time
-       a copy of the Library already present on the user's computer
-       system, and (b) will operate properly with a modified version
-       of the Library that is interface-compatible with the Linked
-       Version.
-
-   e) Provide Installation Information, but only if you would otherwise
-   be required to provide such information under section 6 of the
-   GNU GPL, and only to the extent that such information is
-   necessary to install and execute a modified version of the
-   Combined Work produced by recombining or relinking the
-   Application with a modified version of the Linked Version. (If
-   you use option 4d0, the Installation Information must accompany
-   the Minimal Corresponding Source and Corresponding Application
-   Code. If you use option 4d1, you must provide the Installation
-   Information in the manner specified by section 6 of the GNU GPL
-   for conveying Corresponding Source.)
-
-  5. Combined Libraries.
-
-  You may place library facilities that are a work based on the
-Library side by side in a single library together with other library
-facilities that are not Applications and are not covered by this
-License, and convey such a combined library under terms of your
-choice, if you do both of the following:
-
-   a) Accompany the combined library with a copy of the same work based
-   on the Library, uncombined with any other library facilities,
-   conveyed under the terms of this License.
-
-   b) Give prominent notice with the combined library that part of it
-   is a work based on the Library, and explaining where to find the
-   accompanying uncombined form of the same work.
-
-  6. Revised Versions of the GNU Lesser General Public License.
-
-  The Free Software Foundation may publish revised and/or new versions
-of the GNU Lesser General Public License from time to time. Such new
-versions will be similar in spirit to the present version, but may
-differ in detail to address new problems or concerns.
-
-  Each version is given a distinguishing version number. If the
-Library as you received it specifies that a certain numbered version
-of the GNU Lesser General Public License "or any later version"
-applies to it, you have the option of following the terms and
-conditions either of that published version or of any later version
-published by the Free Software Foundation. If the Library as you
-received it does not specify a version number of the GNU Lesser
-General Public License, you may choose any version of the GNU Lesser
-General Public License ever published by the Free Software Foundation.
-
-  If the Library as you received it specifies that a proxy can decide
-whether future versions of the GNU Lesser General Public License shall
-apply, that proxy's public statement of acceptance of any version is
-permanent authorization for you to choose that version for the
-Library.
diff --git a/Installation/LICENSES/LicenseRef-Commercial.txt b/Installation/LICENSES/LicenseRef-Commercial.txt
deleted file mode 100644
index 1c5db3b7d70f..000000000000
--- a/Installation/LICENSES/LicenseRef-Commercial.txt
+++ /dev/null
@@ -1,6 +0,0 @@
-The CGAL software consists of several components, each of which is licensed under
-an open source license. If the open source license is not suitable to your
-needs, it is possible to obtain commercial licenses
-from GeometryFactory (www.geometryfactory.com) for each component of CGAL.
-
-Get more information at "contact@geometryfactory.com".
diff --git a/Installation/LICENSES/LicenseRef-RFL.txt b/Installation/LICENSES/LicenseRef-RFL.txt
deleted file mode 100644
index 49f77c2445e0..000000000000
--- a/Installation/LICENSES/LicenseRef-RFL.txt
+++ /dev/null
@@ -1,19 +0,0 @@
-Copyright (c) 2014 Stefan Walk
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of
-this software and associated documentation files (the "Software"), to deal in
-the Software without restriction, including without limitation the rights to
-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
-of the Software, and to permit persons to whom the Software is furnished to do
-so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
diff --git a/Installation/LICENSES/MIT.txt b/Installation/LICENSES/MIT.txt
deleted file mode 100644
index 89de354795ec..000000000000
--- a/Installation/LICENSES/MIT.txt
+++ /dev/null
@@ -1,17 +0,0 @@
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
diff --git a/Scripts/developer_scripts/cgal_create_release_with_cmake.cmake b/Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
index 1906d885e48f..de8dcfa35d41 100644
--- a/Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
+++ b/Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
@@ -164,6 +164,9 @@ file(COPY ${GIT_REPO}/GraphicsView/demo/resources ${GIT_REPO}/GraphicsView/demo/
 #copy data
 file(COPY ${GIT_REPO}/Data/data DESTINATION "${release_dir}/")
 
+#copy LICENSES files
+file(COPY ${GIT_REPO}/LICENSES DESTINATION "${release_dir}/" PATTERN "GPL-2.0-only.txt" EXCLUDE)
+
 #create VERSION
 file(WRITE ${release_dir}/VERSION "${CGAL_VERSION}")
 

From 45fef4f9fdf0758fd50cbf8f0769ef8d9e8e631d Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 6 Jul 2023 13:02:06 +0200
Subject: [PATCH 0457/1398] add the Github Action for REUSE

---
 .github/workflows/reuse.yml | 34 ++++++++++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 .github/workflows/reuse.yml

diff --git a/.github/workflows/reuse.yml b/.github/workflows/reuse.yml
new file mode 100644
index 000000000000..cec8abeb9ae4
--- /dev/null
+++ b/.github/workflows/reuse.yml
@@ -0,0 +1,34 @@
+# SPDX-FileCopyrightText: 2020 Free Software Foundation Europe e.V. <https://fsfe.org>
+#
+# SPDX-License-Identifier: GPL-3.0-or-later
+
+name: REUSE Compliance Check
+
+on: [push, pull_request]
+
+jobs:
+  reuse:
+    runs-on: ubuntu-latest
+    steps:
+    - uses: actions/checkout@v3
+    - name: REUSE version
+      uses: fsfe/reuse-action@v1
+      with:
+        args: --version
+    - name: REUSE lint
+      uses: fsfe/reuse-action@v1
+      with:
+        args: --include-submodules lint
+    - name: REUSE SPDX SBOM
+      uses: fsfe/reuse-action@v1
+      with:
+        args: spdx
+    - name: install dependencies
+      run: sudo apt-get install -y libboost-dev libboost-program-options-dev libmpfr-dev libeigen3-dev
+    - name: Create CGAL internal release
+      run: |
+        cmake -DCGAL_VERSION=9.9 -P ./Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
+    - name: REUSE lint release tarball
+      uses: fsfe/reuse-action@v1
+      with:
+        args: --root /tmp/CGAL-9.9 --include-submodules lint

From 21e5ac013667a77f64d3bfdadc3f48ce65b215f6 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 6 Jul 2023 13:03:53 +0200
Subject: [PATCH 0458/1398] dependency: only cmake

---
 .github/workflows/reuse.yml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/.github/workflows/reuse.yml b/.github/workflows/reuse.yml
index cec8abeb9ae4..1edeee2bd6ad 100644
--- a/.github/workflows/reuse.yml
+++ b/.github/workflows/reuse.yml
@@ -24,7 +24,7 @@ jobs:
       with:
         args: spdx
     - name: install dependencies
-      run: sudo apt-get install -y libboost-dev libboost-program-options-dev libmpfr-dev libeigen3-dev
+      run: sudo apt-get install -y cmake
     - name: Create CGAL internal release
       run: |
         cmake -DCGAL_VERSION=9.9 -P ./Scripts/developer_scripts/cgal_create_release_with_cmake.cmake

From aeb6b72a246de7306aea04fc599a4e26f2200368 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 6 Jul 2023 14:05:01 +0200
Subject: [PATCH 0459/1398] change the destination

---
 .github/workflows/reuse.yml | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/.github/workflows/reuse.yml b/.github/workflows/reuse.yml
index 1edeee2bd6ad..6c8c54b6981c 100644
--- a/.github/workflows/reuse.yml
+++ b/.github/workflows/reuse.yml
@@ -27,8 +27,9 @@ jobs:
       run: sudo apt-get install -y cmake
     - name: Create CGAL internal release
       run: |
-        cmake -DCGAL_VERSION=9.9 -P ./Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
+        mkdir -p $HOME/release
+        cmake -DDESTINATION=$HOME/release -DCGAL_VERSION=9.9 -P ./Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
     - name: REUSE lint release tarball
       uses: fsfe/reuse-action@v1
       with:
-        args: --root /tmp/CGAL-9.9 --include-submodules lint
+        args: --root $HOME/release/CGAL-9.9 --include-submodules lint

From 974df953f9d1be695a4f2d4621ce55963483dd2a Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 6 Jul 2023 14:14:28 +0200
Subject: [PATCH 0460/1398] Use RUNNER_TMP instead of HOME

---
 .github/workflows/reuse.yml | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/.github/workflows/reuse.yml b/.github/workflows/reuse.yml
index 6c8c54b6981c..2a97e90458f6 100644
--- a/.github/workflows/reuse.yml
+++ b/.github/workflows/reuse.yml
@@ -27,9 +27,9 @@ jobs:
       run: sudo apt-get install -y cmake
     - name: Create CGAL internal release
       run: |
-        mkdir -p $HOME/release
-        cmake -DDESTINATION=$HOME/release -DCGAL_VERSION=9.9 -P ./Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
+        mkdir -p $RUNNER_TEMP/release
+        cmake -DDESTINATION=$RUNNER_TEMP/release -DCGAL_VERSION=9.9 -P ./Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
     - name: REUSE lint release tarball
       uses: fsfe/reuse-action@v1
       with:
-        args: --root $HOME/release/CGAL-9.9 --include-submodules lint
+        args: --root $RUNNER_TEMP/release/CGAL-9.9 --include-submodules lint

From 6c6ae1f732833b0b54d5b23c54da855aa538f4df Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 6 Jul 2023 14:18:49 +0200
Subject: [PATCH 0461/1398] RUNNER_TEMP is not passed from step to step

Use ./ instead
---
 .github/workflows/reuse.yml | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/.github/workflows/reuse.yml b/.github/workflows/reuse.yml
index 2a97e90458f6..2113372a8772 100644
--- a/.github/workflows/reuse.yml
+++ b/.github/workflows/reuse.yml
@@ -27,9 +27,9 @@ jobs:
       run: sudo apt-get install -y cmake
     - name: Create CGAL internal release
       run: |
-        mkdir -p $RUNNER_TEMP/release
-        cmake -DDESTINATION=$RUNNER_TEMP/release -DCGAL_VERSION=9.9 -P ./Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
+        mkdir -p ./release
+        cmake -DDESTINATION=./release -DCGAL_VERSION=9.9 -P ./Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
     - name: REUSE lint release tarball
       uses: fsfe/reuse-action@v1
       with:
-        args: --root $RUNNER_TEMP/release/CGAL-9.9 --include-submodules lint
+        args: --root ./release/CGAL-9.9 --include-submodules lint

From a8a3d8ab36cf3ad0880aa21dc49c2d29c96df656 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 6 Jul 2023 15:39:08 +0200
Subject: [PATCH 0462/1398] add functor to compute the intersection of 3
 independant planes

---
 .../include/CGAL/Kernel/function_objects.h    | 36 +++++++++++++++++++
 .../include/CGAL/Kernel/interface_macros.h    |  2 ++
 2 files changed, 38 insertions(+)

diff --git a/Kernel_23/include/CGAL/Kernel/function_objects.h b/Kernel_23/include/CGAL/Kernel/function_objects.h
index e307e28ae1f5..438dc0de14be 100644
--- a/Kernel_23/include/CGAL/Kernel/function_objects.h
+++ b/Kernel_23/include/CGAL/Kernel/function_objects.h
@@ -2192,6 +2192,42 @@ namespace CommonKernelFunctors {
     }
   };
 
+  template <typename K>
+  class Construct_planes_intersection_point_3
+  {
+    typedef typename K::Plane_3 Plane;
+    typedef typename K::Point_3 Point;
+    typename K::Construct_plane_3 construct_plane;
+  public:
+    typedef Point result_type;
+
+    Point
+    operator()(const Point& p1, const Point& q1, const Point& r1,
+               const Point& p2, const Point& q2, const Point& r2,
+               const Point& p3, const Point& q3, const Point& r3) const
+    {
+      Plane plane1 = construct_plane(p1, q1, r1);
+      Plane plane2 = construct_plane(p2, q2, r2);
+      Plane plane3 = construct_plane(p3, q3, r3);
+
+      const auto res = typename K::Intersect_3()(plane1, plane2, plane3);
+      CGAL_assertion(res!=boost::none);
+      const Point* e_pt = boost::get<Point>(&(*res));
+      CGAL_assertion(e_pt!=nullptr);
+      return *e_pt;
+    }
+
+    Point
+    operator()(const Plane& plane1, const Plane& plane2, const Plane& plane3) const
+    {
+      const auto res = typename K::Intersect_3()(plane1, plane2, plane3);
+      CGAL_assertion(res!=boost::none);
+      const Point* e_pt = boost::get<Point>(&(*res));
+      CGAL_assertion(e_pt!=nullptr);
+      return *e_pt;
+    }
+  };
+
   template <typename K>
   class Compute_alpha_for_coplanar_triangle_intersection_3
   {
diff --git a/Kernel_23/include/CGAL/Kernel/interface_macros.h b/Kernel_23/include/CGAL/Kernel/interface_macros.h
index 1360aa1bbcdf..0acc0a4c6909 100644
--- a/Kernel_23/include/CGAL/Kernel/interface_macros.h
+++ b/Kernel_23/include/CGAL/Kernel/interface_macros.h
@@ -398,6 +398,8 @@ CGAL_Kernel_cons(Construct_plane_3,
                  construct_plane_3_object)
 CGAL_Kernel_cons(Construct_plane_line_intersection_point_3,
                  construct_plane_line_intersection_point_3_object)
+CGAL_Kernel_cons(Construct_planes_intersection_point_3,
+                 construct_planes_intersection_point_3_object)
 CGAL_Kernel_cons(Compute_alpha_for_coplanar_triangle_intersection_3,
                  compute_alpha_for_coplanar_triangle_intersection_3_object)
 CGAL_Kernel_cons(Construct_point_on_2,

From a0658b6423c95f108868f6ce5c65ad1b7b1149ed Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 6 Jul 2023 15:51:04 +0200
Subject: [PATCH 0463/1398] track coplanar triangles and use direct point
 construction

---
 .../Polygon_mesh_processing/autorefinement.h  | 43 ++++++++++---------
 1 file changed, 22 insertions(+), 21 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 9bbc67efb487..68241773f374 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -167,9 +167,7 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
     }
   }
 
-
   // supporting_line intersects: points are coplanar
-  // TODO: check if we can write a dedicated predicate taking advantage of p,q being shared
   ::CGAL::Orientation pqr = cpl_orient(p, q, r);
   ::CGAL::Orientation pqs = cpl_orient(p, q, s);
 
@@ -609,7 +607,7 @@ void test_edge(const typename K::Point_3& p, const typename K::Point_3& q,
 }
 
 template <class K>
-void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
+bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
                            const std::array<typename K::Point_3, 3>& t2,
                            std::vector<typename K::Point_3>& inter_pts)
 {
@@ -626,7 +624,7 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
       if (depth(p)>2) throw std::runtime_error("Depth is not 4: "+std::to_string(depth(p)));
 #endif
 
-    return;
+    return true;
   }
 
   for (int i=0; i<3; ++i)
@@ -653,6 +651,8 @@ void collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   for (auto p : inter_pts)
     if (depth(p)>2) throw std::runtime_error("Depth is not 2: "+std::to_string(depth(p)));
 #endif
+
+  return false;
 }
 
 //////////////////////////////////
@@ -672,6 +672,7 @@ void generate_subtriangles(std::size_t ti,
                            std::vector<typename EK::Point_3>& points,
                            const std::vector<std::size_t>& in_triangle_ids,
                            const std::set<std::pair<std::size_t, std::size_t> >& intersecting_triangles,
+                           const std::set<std::pair<std::size_t, std::size_t> >& coplanar_triangles,
                            const std::vector<std::array<typename EK::Point_3,3>>& triangles,
                            PointVector& new_triangles
                            )
@@ -789,11 +790,6 @@ void generate_subtriangles(std::size_t ti,
   {
     std::size_t nbs = segments.size();
 
-    auto supporting_plane = [](const std::array<typename EK::Point_3, 3>& t)
-    {
-      return typename EK::Plane_3(t[0], t[1], t[2]);
-    };
-
     std::vector< std::vector<std::size_t> > points_on_segments(nbs);
 
     COUNTER_INSTRUCTION(counter.timer1.start();)
@@ -868,17 +864,19 @@ void generate_subtriangles(std::size_t ti,
             }
             case POINT_INTERSECTION:
             {
-              // TODO: use version with no variant
-              COUNTER_INSTRUCTION(counter.timer6.start();)
-              auto res = CGAL::intersection(supporting_plane(triangles[in_triangle_ids[i]]),
-                                            supporting_plane(triangles[in_triangle_ids[j]]),
-                                            supporting_plane(triangles[ti]));
-              COUNTER_INSTRUCTION(counter.timer6.stop();)
-
-              if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*res)))
+              if (   coplanar_triangles.count(CGAL::make_sorted_pair(in_triangle_ids[i], in_triangle_ids[j])) == 0
+                  &&  coplanar_triangles.count(CGAL::make_sorted_pair(ti, in_triangle_ids[j])) == 0
+                  &&  coplanar_triangles.count(CGAL::make_sorted_pair(in_triangle_ids[i], ti)) == 0)
               {
+                COUNTER_INSTRUCTION(counter.timer6.start();)
+                typename EK::Point_3 pt = typename EK::Construct_planes_intersection_point_3()(
+                  triangles[in_triangle_ids[i]][0], triangles[in_triangle_ids[i]][1],triangles[in_triangle_ids[i]][2],
+                  triangles[in_triangle_ids[j]][0], triangles[in_triangle_ids[j]][1],triangles[in_triangle_ids[j]][2],
+                  triangles[ti][0], triangles[ti][1],triangles[ti][2]);
+                COUNTER_INSTRUCTION(counter.timer6.stop();)
+
                 COUNTER_INSTRUCTION(++counter.c1;)
-                std::size_t pid = get_point_id(*pt_ptr);
+                std::size_t pid = get_point_id(pt);
                 points_on_segments[i].push_back(pid);
                 points_on_segments[j].push_back(pid);
               }
@@ -1198,7 +1196,8 @@ void autorefine_soup_output(const PointRange& input_points,
   Real_timer t;
   t.start();
 #endif
-  std::set<std::pair<std::size_t, std::size_t> > intersecting_triangles;
+  std::set<std::pair<std::size_t, std::size_t> > intersecting_triangles; // TODO replace with vector<boost::flat_set<>>>
+  std::set<std::pair<std::size_t, std::size_t> > coplanar_triangles; // TODO replace with vector<boost::flat_set<>>>
   //TODO: PARALLEL_FOR #2
   for (const Pair_of_triangle_ids& p : si_pairs)
   {
@@ -1211,7 +1210,7 @@ void autorefine_soup_output(const PointRange& input_points,
     const std::array<typename EK::Point_3, 3>& t2 = triangles[i2];
 
     std::vector<typename EK::Point_3> inter_pts;
-    autorefine_impl::collect_intersections<EK>(t1, t2, inter_pts);
+    bool triangles_are_coplanar = autorefine_impl::collect_intersections<EK>(t1, t2, inter_pts);
 
     CGAL_assertion(
       CGAL::do_intersect(typename EK::Triangle_3(t1[0], t1[1], t1[2]), typename EK::Triangle_3(t2[0], t2[1], t2[2]))
@@ -1242,6 +1241,8 @@ void autorefine_soup_output(const PointRange& input_points,
           }
       }
       intersecting_triangles.insert(CGAL::make_sorted_pair(i1, i2));
+      if (triangles_are_coplanar)
+        coplanar_triangles.insert(CGAL::make_sorted_pair(i1, i2));
     }
   }
 #ifdef USE_DEBUG_PARALLEL_TIMERS
@@ -1369,7 +1370,7 @@ void autorefine_soup_output(const PointRange& input_points,
         autorefine_impl::generate_subtriangles<EK, 2>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
       }
 #else
-      autorefine_impl::generate_subtriangles<EK>(ti, all_segments_ids[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
+      autorefine_impl::generate_subtriangles<EK>(ti, all_segments_ids[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
 #endif
     }
 

From bab2c72674903679a632566debb595c34505efe8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 6 Jul 2023 16:53:51 +0200
Subject: [PATCH 0464/1398] add functor to compute intersection point of
 coplanar segments

---
 .../include/CGAL/Kernel/function_objects.h    | 34 +++++++++++++++++++
 .../include/CGAL/Kernel/interface_macros.h    |  2 ++
 2 files changed, 36 insertions(+)

diff --git a/Kernel_23/include/CGAL/Kernel/function_objects.h b/Kernel_23/include/CGAL/Kernel/function_objects.h
index 438dc0de14be..6917a06edcf3 100644
--- a/Kernel_23/include/CGAL/Kernel/function_objects.h
+++ b/Kernel_23/include/CGAL/Kernel/function_objects.h
@@ -2228,6 +2228,40 @@ namespace CommonKernelFunctors {
     }
   };
 
+  template <typename K>
+  class Construct_coplanar_segments_intersection_point_3
+  {
+    typedef typename K::Segment_3 Segment;
+    typedef typename K::Point_3 Point;
+    typename K::Construct_segment_3 construct_segment;
+  public:
+    typedef Point result_type;
+
+    Point
+    operator()(const Point& p1, const Point& q1,
+               const Point& p2, const Point& q2) const
+    {
+      Segment s1 = construct_segment(p1, q1);
+      Segment s2 = construct_segment(p2, q2);
+
+      const auto res = typename K::Intersect_3()(s1, s2);
+      CGAL_assertion(res!=boost::none);
+      const Point* e_pt = boost::get<Point>(&(*res));
+      CGAL_assertion(e_pt!=nullptr);
+      return *e_pt;
+    }
+
+    Point
+    operator()(const Segment& s1, const Segment& s2) const
+    {
+      const auto res = typename K::Intersect_3()(s1, s2);
+      CGAL_assertion(res!=boost::none);
+      const Point* e_pt = boost::get<Point>(&(*res));
+      CGAL_assertion(e_pt!=nullptr);
+      return *e_pt;
+    }
+  };
+
   template <typename K>
   class Compute_alpha_for_coplanar_triangle_intersection_3
   {
diff --git a/Kernel_23/include/CGAL/Kernel/interface_macros.h b/Kernel_23/include/CGAL/Kernel/interface_macros.h
index 0acc0a4c6909..a2314aef1b79 100644
--- a/Kernel_23/include/CGAL/Kernel/interface_macros.h
+++ b/Kernel_23/include/CGAL/Kernel/interface_macros.h
@@ -400,6 +400,8 @@ CGAL_Kernel_cons(Construct_plane_line_intersection_point_3,
                  construct_plane_line_intersection_point_3_object)
 CGAL_Kernel_cons(Construct_planes_intersection_point_3,
                  construct_planes_intersection_point_3_object)
+CGAL_Kernel_cons(Construct_coplanar_segments_intersection_point_3,
+                 construct_coplanar_segments_intersection_point_3_object)
 CGAL_Kernel_cons(Compute_alpha_for_coplanar_triangle_intersection_3,
                  compute_alpha_for_coplanar_triangle_intersection_3_object)
 CGAL_Kernel_cons(Construct_point_on_2,

From e7490ee31fe90b243c558b3742614bd0785f9796 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 6 Jul 2023 16:54:37 +0200
Subject: [PATCH 0465/1398] use direct construction of coplanar segment
 intersection

---
 .../Polygon_mesh_processing/autorefinement.h  | 21 +++++++------------
 1 file changed, 7 insertions(+), 14 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 68241773f374..693c00676f05 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -884,20 +884,13 @@ void generate_subtriangles(std::size_t ti,
               {
                 COUNTER_INSTRUCTION(++counter.c2;)
                 COUNTER_INSTRUCTION(counter.timer4.start();)
-                //TODO find better!
-                typename EK::Segment_3 s1(points[segments[i].first], points[segments[i].second]);
-                typename EK::Segment_3 s2(points[segments[j].first], points[segments[j].second]);// TODO: avoid this construction
-                auto inter = CGAL::intersection(s1, s2);
-                if (inter == boost::none) throw std::runtime_error("Unexpected case #2");
-                if (const typename EK::Point_3* pt_ptr = boost::get<typename EK::Point_3>(&(*inter)))
-                {
-                  std::size_t pid = get_point_id(*pt_ptr);
-                  points_on_segments[i].push_back(pid);
-                  points_on_segments[j].push_back(pid);
-                  break;
-                }
-                else
-                  throw std::runtime_error("Unexpected case 1");
+                typename EK::Point_3 pt = typename EK::Construct_coplanar_segments_intersection_point_3()(
+                  points[segments[i].first], points[segments[i].second],
+                  points[segments[j].first], points[segments[j].second]);
+
+                std::size_t pid = get_point_id(pt);
+                points_on_segments[i].push_back(pid);
+                points_on_segments[j].push_back(pid);
                 COUNTER_INSTRUCTION(counter.timer4.stop();)
                 //~ std::ofstream debug ("/tmp/triangles.polylines.txt");
                 //~ debug << "4 " << triangles[ti][0] << " " << triangles[ti][1] << " " << triangles[ti][2] << " " << triangles[ti][0] << "\n";

From ee2a55279d072fee46aadbb6c91f52759b1b51a3 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Thu, 6 Jul 2023 17:35:34 +0200
Subject: [PATCH 0466/1398] issue #7395 Improvement of layout of model
 relations

- Completed the cgalHasModel part
- corrected spelling of `Has Model` and `Is Model Of` to `Has model` and `Is model of`
---
 .../AABB_halfedge_graph_segment_primitive.h   |  4 +-
 AABB_tree/include/CGAL/AABB_primitive.h       |  4 +-
 ...ancingFrontSurfaceReconstructionTraits_3.h |  2 +-
 .../Concepts/AlgebraicStructureTraits.h       |  3 +-
 .../Concepts/FieldNumberType.h                | 21 +++---
 .../Concepts/FractionTraits.h                 |  3 +-
 .../Concepts/FromIntConstructible.h           |  7 +-
 .../Concepts/RealEmbeddableTraits.h           |  3 +-
 .../Concepts/RingNumberType.h                 | 26 +++----
 .../Concepts/AlgebraicKernel_d_1.h            |  5 +-
 .../Concepts/AlphaShapeFace_2.h               |  3 +-
 .../Concepts/AlphaShapeTraits_2.h             |  3 +-
 .../Concepts/AlphaShapeVertex_2.h             |  2 +-
 .../Concepts/WeightedAlphaShapeTraits_2.h     |  3 +-
 .../Concepts/AlphaShapeCell_3.h               |  2 +-
 .../Concepts/AlphaShapeTraits_3.h             |  2 +-
 .../Concepts/AlphaShapeVertex_3.h             |  2 +-
 .../Concepts/FixedAlphaShapeCell_3.h          |  2 +-
 .../Concepts/FixedAlphaShapeTraits_3.h        |  2 +-
 .../Concepts/FixedAlphaShapeVertex_3.h        |  2 +-
 .../FixedWeightedAlphaShapeTraits_3.h         |  2 +-
 .../Concepts/WeightedAlphaShapeTraits_3.h     |  2 +-
 .../Alpha_wrap_3/Concepts/AlphaWrapOracle.h   |  9 ++-
 .../Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h |  2 +-
 .../Concepts/ApolloniusGraphDataStructure_2.h |  3 +-
 .../ApolloniusGraphHierarchyVertexBase_2.h    |  3 +-
 .../Concepts/ApolloniusGraphTraits_2.h        |  5 +-
 .../Concepts/ApolloniusGraphVertexBase_2.h    |  3 +-
 .../Concepts/ArrTraits--Approximate_2.h       |  3 +-
 .../Concepts/ArrTraits--AreMergeable_2.h      |  3 +-
 .../ArrTraits--CompareXNearBoundary_2.h       |  3 +-
 ...rrTraits--CompareXOnBoundaryOfCurveEnd_2.h |  7 +-
 .../ArrTraits--CompareXOnBoundary_2.h         |  7 +-
 .../Concepts/ArrTraits--CompareX_2.h          |  3 +-
 .../Concepts/ArrTraits--CompareXy_2.h         |  3 +-
 .../Concepts/ArrTraits--CompareYAtXLeft_2.h   |  3 +-
 .../Concepts/ArrTraits--CompareYAtXRight_2.h  |  3 +-
 .../Concepts/ArrTraits--CompareYAtX_2.h       |  3 +-
 .../ArrTraits--CompareYNearBoundary_2.h       |  3 +-
 .../ArrTraits--CompareYOnBoundary_2.h         |  9 ++-
 .../Concepts/ArrTraits--ConstructCurve_2.h    |  3 +-
 .../ArrTraits--ConstructMaxVertex_2.h         |  3 +-
 .../ArrTraits--ConstructMinVertex_2.h         |  3 +-
 .../ArrTraits--ConstructXMonotoneCurve_2.h    |  3 +-
 .../Concepts/ArrTraits--Curve_2.h             |  3 +-
 .../Concepts/ArrTraits--Equal_2.h             |  3 +-
 .../Concepts/ArrTraits--Intersect_2.h         |  3 +-
 .../ArrTraits--IsOnXIdentification_2.h        |  3 +-
 .../ArrTraits--IsOnYIdentification_2.h        |  3 +-
 .../Concepts/ArrTraits--IsVertical_2.h        |  3 +-
 .../Concepts/ArrTraits--MakeXMonotone_2.h     |  3 +-
 .../Concepts/ArrTraits--Merge_2.h             |  3 +-
 .../Concepts/ArrTraits--ParameterSpaceInX_2.h |  7 +-
 .../Concepts/ArrTraits--ParameterSpaceInY_2.h |  7 +-
 .../Concepts/ArrTraits--Point_2.h             |  3 +-
 .../Concepts/ArrTraits--Split_2.h             |  3 +-
 .../Concepts/ArrTraits--XMonotoneCurve_2.h    |  3 +-
 .../Concepts/ArrangementApproximateTraits_2.h | 17 +++--
 .../Concepts/ArrangementBasicTopologyTraits.h |  3 +-
 .../Concepts/ArrangementBasicTraits_2.h       | 31 ++++----
 .../ArrangementConstructCurveTraits_2.h       | 15 ++--
 ...rangementConstructXMonotoneCurveTraits_2.h | 15 ++--
 .../Concepts/ArrangementDcel.h                |  9 ++-
 .../Concepts/ArrangementDcelWithRebind.h      |  7 +-
 .../ArrangementHorizontalSideTraits_2.h       |  9 ++-
 .../Concepts/ArrangementInputFormatter.h      |  7 +-
 .../Concepts/ArrangementLandmarkTraits_2.h    | 17 +++--
 .../ArrangementOpenBoundaryTraits_2.h         | 11 +--
 .../Concepts/ArrangementOutputFormatter.h     |  7 +-
 .../Concepts/ArrangementPointLocation_2.h     |  9 ++-
 .../ArrangementSphericalBoundaryTraits_2.h    |  3 +-
 .../Concepts/ArrangementTopologyTraits.h      |  7 +-
 .../Concepts/ArrangementTraits_2.h            | 29 +++----
 .../Concepts/ArrangementVerticalRayShoot_2.h  |  9 ++-
 .../ArrangementVerticalSideTraits_2.h         |  9 ++-
 .../ArrangementWithHistoryInputFormatter.h    |  3 +-
 .../ArrangementWithHistoryOutputFormatter.h   |  3 +-
 .../Concepts/ArrangementXMonotoneTraits_2.h   | 29 +++----
 .../Concepts/OverlayTraits.h                  |  5 +-
 BGL/doc/BGL/Concepts/EdgeListGraph.h          |  2 +-
 BGL/doc/BGL/Concepts/FaceGraph.h              |  2 +-
 BGL/doc/BGL/Concepts/FaceListGraph.h          |  2 +-
 BGL/doc/BGL/Concepts/HalfedgeGraph.h          |  2 +-
 BGL/doc/BGL/Concepts/HalfedgeListGraph.h      |  2 +-
 BGL/doc/BGL/Concepts/MutableFaceGraph.h       |  2 +-
 BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h   |  2 +-
 BGL/doc/BGL/Concepts/VertexListGraph.h        |  2 +-
 .../Concepts/BarycentricCoordinates_2.h       |  8 +-
 .../Concepts/BarycentricTraits_2.h            | 11 ++-
 .../Concepts/DiscretizedDomain_2.h            |  3 +-
 .../ArrDirectionalTraits--AreMergeable_2.h    |  3 +-
 ...rDirectionalTraits--CompareEndpointsXy_2.h |  3 +-
 ...rrDirectionalTraits--ConstructOpposite_2.h |  3 +-
 .../ArrDirectionalTraits--Intersect_2.h       |  3 +-
 .../Concepts/ArrDirectionalTraits--Merge_2.h  |  3 +-
 .../Concepts/ArrDirectionalTraits--Split_2.h  |  3 +-
 .../ArrangementDirectionalXMonotoneTraits_2.h | 15 ++--
 .../Concepts/GeneralPolygonSetDcel.h          |  3 +-
 .../Concepts/GeneralPolygonSetDcelFace.h      |  3 +-
 .../Concepts/GeneralPolygonSetDcelHalfedge.h  |  3 +-
 .../Concepts/GeneralPolygonSetTraits_2.h      |  7 +-
 .../Concepts/GeneralPolygon_2.h               |  3 +-
 .../GpsTraitsGeneralPolygonWithHoles_2.h      |  3 +-
 .../Concepts/GpsTraitsGeneralPolygon_2.h      |  5 +-
 .../ApproximateMinEllipsoid_d_Traits_d.h      |  7 +-
 .../Concepts/MinCircle2Traits.h               |  3 +-
 .../Concepts/MinEllipse2Traits.h              |  3 +-
 .../Concepts/MinQuadrilateralTraits_2.h       |  3 +-
 .../Concepts/MinSphereAnnulusDTraits.h        |  7 +-
 .../Concepts/MinSphereOfSpheresTraits.h       | 14 ++--
 .../Concepts/RectangularPCenterTraits_2.h     |  3 +-
 .../Concepts/BoxIntersectionBox_d.h           |  5 +-
 .../Concepts/BoxIntersectionTraits_d.h        |  3 +-
 ...rnelForCircles--PolynomialForCircles_2_2.h |  3 +-
 ...lgebraicKernelForCircles--Polynomial_1_2.h |  3 +-
 ...raicKernelForCircles--RootForCircles_2_2.h |  3 +-
 .../Concepts/AlgebraicKernelForCircles.h      |  3 +-
 .../CircularKernel--CircularArcPoint_2.h      |  3 +-
 .../Concepts/CircularKernel--CircularArc_2.h  |  3 +-
 .../Concepts/CircularKernel--LineArc_2.h      |  3 +-
 .../Concepts/CircularKernel.h                 |  5 +-
 ...rnelForSpheres--PolynomialForSpheres_2_3.h |  3 +-
 ...lgebraicKernelForSpheres--Polynomial_1_3.h |  3 +-
 ...cKernelForSpheres--PolynomialsForLines_3.h |  3 +-
 ...raicKernelForSpheres--RootForSpheres_2_3.h |  3 +-
 .../Concepts/AlgebraicKernelForSpheres.h      |  3 +-
 .../SphericalKernel--CircularArcPoint_3.h     |  3 +-
 .../Concepts/SphericalKernel--CircularArc_3.h |  3 +-
 .../Concepts/SphericalKernel--LineArc_3.h     |  3 +-
 .../Concepts/SphericalKernel.h                |  5 +-
 .../doc/Circulator/Concepts/ConstHandle.h     |  3 +-
 .../doc/Circulator/Concepts/ConstRange.h      |  3 +-
 Circulator/doc/Circulator/Concepts/Handle.h   |  9 ++-
 Circulator/doc/Circulator/Concepts/Range.h    |  2 +-
 .../doc/Classification/Concepts/Classifier.h  |  7 +-
 .../Classification/Concepts/NeighborQuery.h   |  9 ++-
 .../Concepts/CellAttribute.h                  |  2 +-
 .../Concepts/CombinatorialMap.h               |  2 +-
 .../Combinatorial_map/Concepts/GenericMap.h   |  4 +-
 .../Concepts/GenericMapItems.h                |  2 +-
 .../Concepts/ConvexHullTraits_2.h             | 13 ++--
 .../Concepts/ConvexHullTraits_3.h             |  5 +-
 .../Concepts/IsStronglyConvexTraits_3.h       |  4 +-
 .../Concepts/ConvexHullTraits_d.h             |  7 +-
 .../Concepts/DelaunayLiftedTraits_d.h         |  5 +-
 .../Convex_hull_d/Concepts/DelaunayTraits_d.h |  5 +-
 .../doc/resources/1.8.13/BaseDoxyfile.in      | 11 +--
 .../doc/resources/1.9.6/BaseDoxyfile.in       |  9 ++-
 .../Envelope_3/Concepts/EnvelopeTraits_3.h    |  9 ++-
 .../Generalized_map/Concepts/GeneralizedMap.h |  2 +-
 .../Generator/Concepts/CombinationElement.h   |  6 +-
 .../doc/Generator/Concepts/PointGenerator.h   | 29 +++----
 .../Concepts/RandomConvexHullTraits_2.h       |  2 +-
 .../Concepts/RandomConvexSetTraits_2.h        |  3 +-
 .../Concepts/RandomPolygonTraits_2.h          |  2 +-
 .../doc/HalfedgeDS/Concepts/HalfedgeDS.h      |  7 +-
 .../doc/HalfedgeDS/Concepts/HalfedgeDSFace.h  |  5 +-
 .../HalfedgeDS/Concepts/HalfedgeDSHalfedge.h  |  5 +-
 .../doc/HalfedgeDS/Concepts/HalfedgeDSItems.h |  7 +-
 .../HalfedgeDS/Concepts/HalfedgeDSVertex.h    |  5 +-
 .../Concepts/HeatMethodTraits_3.h             |  2 +-
 .../HyperbolicDelaunayTriangulationTraits_2.h |  5 +-
 .../HyperbolicTriangulationFaceBase_2.h       |  3 +-
 .../Concepts/ExtremalPolygonTraits_2.h        |  5 +-
 .../LargestEmptyIsoRectangleTraits_2.h        |  5 +-
 .../Concepts/GradientFittingTraits.h          |  3 +-
 .../Concepts/InterpolationTraits.h            |  5 +-
 .../Interval_skip_list/Concepts/Interval.h    |  5 +-
 .../doc/Jet_fitting_3/Concepts/DataKernel.h   |  5 +-
 .../doc/Jet_fitting_3/Concepts/LocalKernel.h  |  5 +-
 .../doc/Kernel_23/Concepts/GeomObjects.h      | 75 ++++++++++++-------
 Kernel_23/doc/Kernel_23/Concepts/Kernel.h     | 17 +++--
 .../Kernel_d/Concepts/KernelWithLifting_d.h   |  5 +-
 Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h     |  9 ++-
 .../Kernel_d/Concepts/LinearAlgebraTraits_d.h |  5 +-
 .../Concepts/CellAttributeWithPoint.h         |  2 +-
 .../Concepts/LinearCellComplex.h              |  4 +-
 .../Concepts/LinearCellComplexItems.h         |  3 +-
 .../Concepts/LinearCellComplexTraits.h        |  2 +-
 .../doc/Matrix_search/Concepts/BasicMatrix.h  |  3 +-
 .../Concepts/MonotoneMatrixSearchTraits.h     |  3 +-
 .../Concepts/SortedMatrixSearchTraits.h       |  3 +-
 .../ConformingDelaunayTriangulationTraits_2.h |  4 +-
 .../Mesh_2/Concepts/DelaunayMeshFaceBase_2.h  |  3 +-
 .../Mesh_2/Concepts/DelaunayMeshTraits_2.h    |  4 +-
 .../Concepts/DelaunayMeshVertexBase_2.h       |  3 +-
 .../doc/Mesh_2/Concepts/MeshingCriteria_2.h   |  5 +-
 .../Concepts/BisectionGeometricTraits_3.h     |  2 +-
 .../Concepts/IntersectionGeometricTraits_3.h  |  2 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h   |  5 +-
 .../doc/Mesh_3/Concepts/MeshCellCriteria_3.h  |  3 +-
 .../Concepts/MeshCriteriaWithFeatures_3.h     |  3 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h   |  3 +-
 .../doc/Mesh_3/Concepts/MeshDomainField_3.h   |  3 +-
 .../Concepts/MeshDomainWithFeatures_3.h       |  5 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h     |  5 +-
 .../doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h  |  3 +-
 .../doc/Mesh_3/Concepts/MeshFacetCriteria_3.h |  3 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h   |  2 +-
 .../Concepts/MeshTriangulationTraits_3.h      |  2 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h |  3 +-
 .../doc/Mesh_3/Concepts/TriangleAccessor_3.h  |  3 +-
 .../Concepts/PolygonConvexDecomposition_2.h   | 11 +--
 .../PolygonWithHolesConvexDecomposition_2.h   |  5 +-
 .../Miscellany/Concepts/UniqueHashFunction.h  |  3 +-
 .../Concepts/ModularTraits.h                  |  3 +-
 .../Concepts/Modularizable.h                  | 20 ++---
 .../Nef_2/Concepts/ExtendedKernelTraits_2.h   |  7 +-
 .../doc/Number_types/Concepts/RootOf_2.h      |  4 +-
 .../Concepts/OrientedBoundingBoxTraits.h      |  3 +-
 ...imalTransportationReconstructionTraits_2.h |  4 +-
 .../doc/Orthtree/Concepts/OrthtreeTraits.h    |  7 +-
 .../doc/Orthtree/Concepts/OrthtreeTraversal.h |  9 ++-
 .../Concepts/ConvexPartitionIsValidTraits_2.h |  3 +-
 .../Concepts/IsYMonotoneTraits_2.h            |  5 +-
 .../Concepts/OptimalConvexPartitionTraits_2.h |  3 +-
 .../Concepts/PartitionIsValidTraits_2.h       |  3 +-
 .../Partition_2/Concepts/PartitionTraits_2.h  |  3 +-
 .../doc/Partition_2/Concepts/PolygonIsValid.h |  5 +-
 .../YMonotonePartitionIsValidTraits_2.h       |  3 +-
 .../Periodic_2DelaunayTriangulationTraits_2.h |  3 +-
 .../Concepts/Periodic_2Offset_2.h             |  3 +-
 .../Periodic_2TriangulationFaceBase_2.h       |  3 +-
 .../Periodic_2TriangulationTraits_2.h         |  3 +-
 .../Periodic_2TriangulationVertexBase_2.h     |  3 +-
 .../Periodic_3MeshDomainWithFeatures_3.h      |  4 +-
 .../Concepts/Periodic_3MeshDomain_3.h         |  3 +-
 .../Periodic_3DelaunayTriangulationTraits_3.h |  3 +-
 .../Concepts/Periodic_3Offset_3.h             |  3 +-
 ...riodic_3RegularTriangulationDSCellBase_3.h |  7 +-
 ...odic_3RegularTriangulationDSVertexBase_3.h |  4 +-
 .../Periodic_3RegularTriangulationTraits_3.h  |  3 +-
 .../Periodic_3TriangulationDSCellBase_3.h     |  3 +-
 .../Periodic_3TriangulationDSVertexBase_3.h   |  3 +-
 .../Periodic_3TriangulationTraits_3.h         |  3 +-
 ...4HyperbolicDelaunayTriangulationTraits_2.h |  3 +-
 ...iodic_4HyperbolicTriangulationFaceBase_2.h |  3 +-
 ...dic_4HyperbolicTriangulationVertexBase_2.h |  3 +-
 .../Concepts/GeneralPolygonWithHoles_2.h      |  5 +-
 .../doc/Polygon/Concepts/PolygonTraits_2.h    |  8 +-
 .../Concepts/PMPCorefinementVisitor.h         |  3 +-
 .../Concepts/PMPDistanceTraits.h              |  2 +-
 .../Concepts/PMPHolefillingVisitor.h          |  3 +-
 .../PMPPolygonSoupOrientationVisitor.h        |  3 +-
 .../Concepts/PMPTriangulateFaceVisitor.h      |  3 +-
 .../Polyhedron/Concepts/PolyhedronItems_3.h   |  5 +-
 .../Polyhedron/Concepts/PolyhedronTraits_3.h  |  6 +-
 .../PolylineSimplificationCostFunction.h      |  7 +-
 .../PolylineSimplificationStopPredicate.h     |  7 +-
 .../PolylineSimplificationVertexBase_2.h      |  3 +-
 .../Polynomial/Concepts/PolynomialTraits_d.h  |  3 +-
 .../doc/Polynomial/Concepts/Polynomial_d.h    |  3 +-
 .../Concepts/AllFurthestNeighborsTraits_2.h   |  9 ++-
 .../Concepts/PolytopeDistanceDTraits.h        |  7 +-
 .../Concepts/WidthTraits_3.h                  |  3 +-
 .../doc/QP_solver/Concepts/LinearProgram.h    |  7 +-
 .../Concepts/NonnegativeLinearProgram.h       | 14 ++--
 .../Concepts/NonnegativeQuadraticProgram.h    |  7 +-
 .../doc/QP_solver/Concepts/QuadraticProgram.h |  7 +-
 ...shComplexWithFeatures_3InTriangulation_3.h |  3 +-
 .../Concepts/MeshComplex_3InTriangulation_3.h |  3 +-
 .../Concepts/SimplicialMeshCellBase_3.h       |  9 ++-
 .../Concepts/SimplicialMeshVertexBase_3.h     |  7 +-
 .../doc/STL_Extension/Concepts/Descriptor.h   |  5 +-
 .../doc/STL_Extension/Concepts/Hashable.h     |  6 +-
 .../doc/STL_Extension/Concepts/Index.h        |  5 +-
 .../STL_Extension/Concepts/ProjectionObject.h | 27 +++----
 .../Concepts/SurjectiveLockDataStructure.h    |  3 +-
 .../Concepts/ScaleSpaceMesher.h               |  5 +-
 .../Concepts/ScaleSpaceSmoother.h             |  5 +-
 .../Concepts/RangeSegmentTreeTraits_k.h       | 13 ++--
 .../SegmentDelaunayGraphDataStructure_2.h     |  3 +-
 .../Concepts/SegmentDelaunayGraphFaceBase_2.h |  3 +-
 ...egmentDelaunayGraphHierarchyVertexBase_2.h |  3 +-
 .../Concepts/SegmentDelaunayGraphSite_2.h     |  3 +-
 .../SegmentDelaunayGraphStorageSite_2.h       |  3 +-
 .../SegmentDelaunayGraphStorageTraits_2.h     |  3 +-
 .../Concepts/SegmentDelaunayGraphTraits_2.h   |  9 ++-
 .../SegmentDelaunayGraphVertexBase_2.h        |  3 +-
 .../SegmentDelaunayGraphLinfTraits_2.h        |  9 ++-
 .../Concepts/CastingTraits_2.h                |  2 +-
 .../Concepts/EfficientRANSACTraits.h          |  4 +-
 .../Shape_detection/Concepts/NeighborQuery.h  | 10 +--
 .../doc/Shape_detection/Concepts/RegionType.h | 16 ++--
 .../Concepts/ContourDirections.h              |  8 +-
 .../Concepts/NeighborQuery.h                  |  4 +-
 .../Concepts/RegularizationType.h             |  6 +-
 .../Concepts/SkinSurfaceTraits_3.h            |  3 +-
 .../Skin_surface_3/Concepts/SkinSurface_3.h   |  5 +-
 .../Concepts/SnapRoundingTraits_2.h           | 21 +++---
 .../Concepts/DiagonalizeTraits.h              |  3 +-
 .../Concepts/MixedIntegerProgramTraits.h      | 16 ++--
 ...ormalEquationSparseLinearAlgebraTraits_d.h |  3 +-
 .../Concepts/QuadraticProgramTraits.h         |  4 +-
 .../Concepts/SparseLinearAlgebraTraits_d.h    | 11 ++-
 .../SparseLinearAlgebraWithFactorTraits_d.h   |  3 +-
 .../doc/Solver_interface/Concepts/SvdTraits.h |  9 ++-
 .../Concepts/FuzzyQueryItem.h                 |  3 +-
 .../Concepts/GeneralDistance.h                |  5 +-
 .../Concepts/OrthogonalDistance.h             |  5 +-
 .../Concepts/RangeSearchTraits.h              | 13 ++--
 .../Concepts/SearchGeomTraits_2.h             |  2 +-
 .../Concepts/SearchGeomTraits_3.h             |  2 +-
 .../Spatial_searching/Concepts/SearchTraits.h | 17 +++--
 .../Concepts/SpatialSeparator.h               |  3 +-
 .../Spatial_searching/Concepts/SpatialTree.h  |  3 +-
 .../doc/Spatial_searching/Concepts/Splitter.h | 15 ++--
 .../Concepts/SpatialSortingTraits_2.h         |  4 +-
 .../Concepts/SpatialSortingTraits_3.h         |  4 +-
 .../Concepts/SpatialSortingTraits_d.h         |  4 +-
 .../Concepts/PolygonOffsetBuilderTraits_2.h   |  3 +-
 .../StraightSkeletonBuilderTraits_2.h         |  3 +-
 .../StraightSkeletonBuilder_2_Visitor.h       |  3 +-
 .../Concepts/StraightSkeletonFace_2.h         |  3 +-
 .../Concepts/StraightSkeletonHalfedge_2.h     |  3 +-
 .../StraightSkeletonItemsConverter_2.h        |  3 +-
 .../Concepts/StraightSkeletonVertex_2.h       |  3 +-
 .../Concepts/StraightSkeleton_2.h             |  3 +-
 .../Stream_lines_2/Concepts/Integrator_2.h    |  5 +-
 .../Concepts/StreamLinesTraits_2.h            |  2 +-
 .../Stream_lines_2/Concepts/VectorField_2.h   |  5 +-
 .../Subdivision_method_3/Concepts/DQQMask_3.h |  3 +-
 .../Subdivision_method_3/Concepts/PQQMask_3.h |  3 +-
 .../Subdivision_method_3/Concepts/PTQMask_3.h |  3 +-
 .../Concepts/Sqrt3Mask_3.h                    |  3 +-
 .../Concepts/ErrorMetricProxy.h               |  5 +-
 .../DeformationClosestRotationTraits_3.h      |  5 +-
 .../Concepts/Parameterizer_3.h                | 21 +++---
 .../Concepts/SegmentationGeomTraits.h         |  2 +-
 .../Concepts/SurfaceMeshShortestPathTraits.h  |  3 +-
 .../Concepts/GetCost.h                        |  7 +-
 .../Concepts/GetPlacement.h                   | 11 +--
 .../Concepts/PlacementFilter.h                |  5 +-
 .../Concepts/StopPredicate.h                  | 11 +--
 .../MeanCurvatureSkeletonizationTraits.h      |  2 +-
 .../Concepts/PolygonalSchema.h                |  4 +-
 .../Concepts/PolygonalSchemaItems.h           |  2 +-
 .../Concepts/WeightFunctor.h                  |  4 +-
 .../Concepts/ImplicitFunction.h               |  4 +-
 .../Concepts/ImplicitSurfaceTraits_3.h        |  2 +-
 .../Concepts/SurfaceMeshCellBase_3.h          |  5 +-
 .../SurfaceMeshComplex_2InTriangulation_3.h   |  3 +-
 .../Concepts/SurfaceMeshFacetsCriteria_3.h    |  3 +-
 .../Concepts/SurfaceMeshTraits_3.h            |  3 +-
 .../Concepts/SurfaceMeshTriangulation_3.h     |  2 +-
 .../Concepts/SurfaceMeshVertexBase_3.h        |  5 +-
 .../doc/Surface_mesher/Concepts/Surface_3.h   |  3 +-
 .../Concepts/TriangulationDSFaceBase_2.h      |  3 +-
 .../Concepts/TriangulationDSVertexBase_2.h    |  3 +-
 .../Concepts/TriangulationDataStructure_2.h   |  9 ++-
 .../Concepts/TriangulationDSCellBase_3.h      |  3 +-
 .../Concepts/TriangulationDSVertexBase_3.h    |  3 +-
 .../Concepts/TriangulationDataStructure_3.h   |  3 +-
 .../Concepts/RemeshingCellBase_3.h            |  3 +-
 .../Concepts/RemeshingTriangulationTraits_3.h |  2 +-
 .../Concepts/RemeshingVertexBase_3.h          |  3 +-
 .../Concepts/DelaunayTriangulationTraits.h    |  5 +-
 .../Concepts/RegularTriangulationTraits.h     |  5 +-
 .../Concepts/TriangulationDSFace.h            |  3 +-
 .../Concepts/TriangulationDSFullCell.h        |  5 +-
 .../Concepts/TriangulationDSVertex.h          |  5 +-
 .../Concepts/TriangulationDataStructure.h     | 13 ++--
 .../Concepts/TriangulationFullCell.h          |  3 +-
 .../Concepts/TriangulationTraits.h            |  5 +-
 .../Concepts/TriangulationVertex.h            |  3 +-
 ...ConstrainedDelaunayTriangulationTraits_2.h |  8 +-
 .../ConstrainedTriangulationFaceBase_2.h      |  3 +-
 .../ConstrainedTriangulationTraits_2.h        | 10 +--
 .../Concepts/DelaunayTriangulationTraits_2.h  | 12 +--
 .../Concepts/RegularTriangulationFaceBase_2.h |  3 +-
 .../Concepts/RegularTriangulationTraits_2.h   |  2 +-
 .../RegularTriangulationVertexBase_2.h        |  3 +-
 .../Concepts/TriangulationFaceBase_2.h        |  3 +-
 .../TriangulationHierarchyVertexBase_2.h      |  3 +-
 .../Concepts/TriangulationTraits_2.h          | 10 +--
 .../TriangulationVertexBaseWithInfo_2.h       |  3 +-
 .../Concepts/TriangulationVertexBase_2.h      |  3 +-
 .../DelaunayTriangulationCellBase_3.h         |  5 +-
 .../Concepts/DelaunayTriangulationTraits_3.h  | 15 ++--
 ...lationCellBaseWithWeightedCircumcenter_3.h |  3 +-
 .../Concepts/RegularTriangulationCellBase_3.h |  3 +-
 .../Concepts/RegularTriangulationTraits_3.h   |  2 +-
 .../RegularTriangulationVertexBase_3.h        |  3 +-
 .../TriangulationCellBaseWithInfo_3.h         |  3 +-
 .../Concepts/TriangulationCellBase_3.h        |  5 +-
 .../Concepts/TriangulationTraits_3.h          |  2 +-
 .../TriangulationVertexBaseWithInfo_3.h       |  3 +-
 .../Concepts/TriangulationVertexBase_3.h      |  5 +-
 .../DelaunayTriangulationOnSphereTraits_2.h   |  5 +-
 .../TriangulationOnSphereFaceBase_2.h         |  3 +-
 .../Concepts/TriangulationOnSphereTraits_2.h  |  5 +-
 .../TriangulationOnSphereVertexBase_2.h       |  3 +-
 .../doc/Visibility_2/Concepts/Visibility_2.h  |  7 +-
 .../Concepts/AdaptationPolicy_2.h             | 19 ++---
 .../Concepts/AdaptationTraits_2.h             |  9 ++-
 .../Concepts/DelaunayGraph_2.h                | 14 ++--
 .../Weights/Concepts/AnalyticWeightTraits_2.h |  9 +--
 .../Weights/Concepts/AnalyticWeightTraits_3.h |  3 +-
 .../Weights/Concepts/BarycentricWeights_2.h   |  8 +-
 399 files changed, 1252 insertions(+), 916 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
index 0ac0476616eb..7fb8d9cfd960 100644
--- a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
@@ -41,8 +41,8 @@ namespace CGAL {
  * of `VertexPointPMap` (using the `Kernel_traits` mechanism).
  * The segment type of the primitive (`Datum`) is `CGAL::Kernel_traits< boost::property_traits< VertexPointPMap >::%value_type >::%Kernel::Segment_3`.
  *
- * \cgalModelsBare{AABBPrimitive if `OneHalfedgeGraphPerTree` is `CGAL::Tag_false`,
- *                 AABBPrimitiveWithSharedData if `OneHalfedgeGraphPerTree` is `CGAL::Tag_true`}
+ * \cgalModelsBare{`AABBPrimitive` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_false`,
+ *                 `AABBPrimitiveWithSharedData` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_true`}
  *
  * \tparam HalfedgeGraph is a model of the halfedge graph concept.
  *   as key type and a \cgal Kernel `Point_3` as value type.
diff --git a/AABB_tree/include/CGAL/AABB_primitive.h b/AABB_tree/include/CGAL/AABB_primitive.h
index d602a349ee0e..b31cf5a74de0 100644
--- a/AABB_tree/include/CGAL/AABB_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_primitive.h
@@ -53,8 +53,8 @@ struct AABB_primitive_base
  * The two property maps which are template parameters of the class enable to get the datum and the reference point of
  * the primitive from the identifier. The last template parameter controls whether the primitive class holds a copy of the datum.
  *
- * \cgalModelsBare{AABBPrimitive if `ExternalPropertyMaps` is `CGAL::Tag_false`,
- *                 AABBPrimitiveWithSharedData if `ExternalPropertyMaps` is `CGAL::Tag_true`}
+ * \cgalModelsBare{`AABBPrimitive` if `ExternalPropertyMaps` is `CGAL::Tag_false`,
+ *                 `AABBPrimitiveWithSharedData` if `ExternalPropertyMaps` is `CGAL::Tag_true`}
  *
  * \tparam ObjectPropertyMap is a model of `ReadablePropertyMap` with `Id` as
  *           `key_type`. It must be a model of `CopyConstructible`, `DefaultConstructible`, and `CopyAssignable`.
diff --git a/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h b/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h
index c68ff917daa3..a56096bcb197 100644
--- a/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h
+++ b/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h
@@ -11,7 +11,7 @@ together with a few geometric predicates and constructions on these objects.
 
 \cgalRefines{DelaunayTriangulationTraits_3}
 
-\cgalHasModel All models of `Kernel`.
+\cgalHasModelsBare{All models of the concept `Kernel`}
 */
 class AdvancingFrontSurfaceReconstructionTraits_3
 {
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h
index 48c92909b80a..0fbc4ea6f174 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h
@@ -28,7 +28,8 @@ algebraic operations within that structure.
 \sa `CGAL::Field_with_kth_root_tag`
 \sa `CGAL::Field_with_root_of_tag`
 
-\cgalHasModel `CGAL::Algebraic_structure_traits<T>`
+\cgalHasModelsBegin CGAL::Algebraic_structure_traits<T>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
index 8609a9a9cbe7..a53ac500cbf9 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
@@ -9,16 +9,17 @@ for Cartesian kernels.
 
 \cgalRefines{Field,RealEmbeddable}
 
-\cgalHasModel float
-\cgalHasModel double
-\cgalHasModel `CGAL::Gmpq`
-\cgalHasModel `CGAL::Interval_nt`
-\cgalHasModel `CGAL::Interval_nt_advanced`
-\cgalHasModel `CGAL::Lazy_exact_nt<FieldNumberType>`
-\cgalHasModel `CGAL::Quotient<RingNumberType>`
-\cgalHasModel `leda_rational`
-\cgalHasModel `leda_bigfloat`
-\cgalHasModel `leda_real`
+\cgalHasModelsBegin float
+\cgalHasModels double
+\cgalHasModels CGAL::Gmpq
+\cgalHasModels CGAL::Interval_nt
+\cgalHasModels CGAL::Interval_nt_advanced
+\cgalHasModels CGAL::Lazy_exact_nt<FieldNumberType>
+\cgalHasModels CGAL::Quotient<RingNumberType>
+\cgalHasModels leda_rational
+\cgalHasModels leda_bigfloat
+\cgalHasModels leda_real
+\cgalHasModelsEnd
 
 \sa `RingNumberType`
 \sa `Kernel`
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h
index eaa438e6c903..35d4b408a679 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h
@@ -8,7 +8,8 @@ A model of `FractionTraits` is associated with a type `Type`.
 In case the associated type is a `Fraction`, a model of `FractionTraits` provides the relevant functionality for decomposing and re-composing as well
 as the numerator and denominator type.
 
-\cgalHasModel `CGAL::Fraction_traits<T>`
+\cgalHasModelsBegin CGAL::Fraction_traits<T>
+\cgalHasModelsEnd
 
 \sa `FractionTraits_::Decompose`
 \sa `FractionTraits_::Compose`
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
index 58d2190329ad..f8f2f3f8749d 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
@@ -6,9 +6,10 @@
 A model of the concept `FromIntConstructible` is required
 to be constructible from int.
 
-\cgalHasModel int
-\cgalHasModel long
-\cgalHasModel double
+\cgalHasModelsBegin int
+\cgalHasModels long
+\cgalHasModels double
+\cgalHasModelsEnd
 
 */
 
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h
index 379390e11e7b..1cd155d7ccff 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h
@@ -7,7 +7,8 @@ A model of `RealEmbeddableTraits` is associated to a number type
 `Type` and reflects the properties of this type with respect
 to the concept `RealEmbeddable`.
 
-\cgalHasModel `CGAL::Real_embeddable_traits<T>`
+\cgalHasModelsBegin CGAL::Real_embeddable_traits<T>
+\cgalHasModelsEnd
 */
 
 class RealEmbeddableTraits {
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h
index a2b6c5036f02..462030682589 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h
@@ -10,19 +10,19 @@ for Homogeneous kernels.
 
 \cgalRefines{IntegralDomainWithoutDivision,RealEmbeddable}
 
-\cgalHasModel \cpp built-in number types
-\cgalHasModel `CGAL::Gmpq`
-\cgalHasModel `CGAL::Gmpz`
-\cgalHasModel `CGAL::Interval_nt`
-\cgalHasModel `CGAL::Interval_nt_advanced`
-\cgalHasModel `CGAL::Lazy_exact_nt<RingNumberType>`
-\cgalHasModel `CGAL::MP_Float`
-\cgalHasModel `CGAL::Gmpzf`
-\cgalHasModel `CGAL::Quotient<RingNumberType>`
-\cgalHasModel `leda_integer`
-\cgalHasModel `leda_rational`
-\cgalHasModel `leda_bigfloat`
-\cgalHasModel `leda_real`
+\cgalHasModelsBareBegin{\cpp built-in number types} CGAL::Gmpq
+\cgalHasModels CGAL::Gmpz
+\cgalHasModels CGAL::Interval_nt
+\cgalHasModels CGAL::Interval_nt_advanced
+\cgalHasModels CGAL::Lazy_exact_nt<RingNumberType>
+\cgalHasModels CGAL::MP_Float
+\cgalHasModels CGAL::Gmpzf
+\cgalHasModels CGAL::Quotient<RingNumberType>
+\cgalHasModels leda_integer
+\cgalHasModels leda_rational
+\cgalHasModels leda_bigfloat
+\cgalHasModels leda_real
+\cgalHasModelsEnd
 
 \sa `FieldNumberType`
 
diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h
index c9c2f475f8eb..f9b702d436be 100644
--- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h
+++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h
@@ -8,8 +8,9 @@ algebraic functionalities on univariate polynomials of general degree \f$ d\f$.
 
 \cgalRefines{CopyConstructible,Assignable}
 
-\cgalHasModel `CGAL::Algebraic_kernel_rs_gmpz_d_1`
-\cgalHasModel `CGAL::Algebraic_kernel_rs_gmpq_d_1`
+\cgalHasModelsBegin CGAL::Algebraic_kernel_rs_gmpz_d_1
+\cgalHasModels CGAL::Algebraic_kernel_rs_gmpq_d_1
+\cgalHasModelsEnd
 
 \sa `AlgebraicKernel_d_2`
 
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h
index 57b30f90d2f1..562a6aaaa195 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h
@@ -9,7 +9,8 @@ The concept `AlphaShapeFace_2` describes the requirements for the base face of a
   RegularTriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_2TriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
-\cgalHasModel `CGAL::Alpha_shape_face_base_2` (templated with the appropriate triangulation face base class).
+\cgalHasModelsBegin CGAL::Alpha_shape_face_base_2 (templated with the appropriate triangulation face base class)
+\cgalHasModelsEnd
 
 */
 class AlphaShapeFace_2 {
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h
index a6f1c1fca181..28ad270b7441 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h
@@ -9,8 +9,7 @@ class of the underlying Delaunay triangulation of a basic alpha shape.
 \cgalRefines{DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
   Periodic_2DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
 
-\cgalHasModel All models of `Kernel`.
-\cgalHasModel Projection traits such as `CGAL::Projection_traits_xy_3<K>`.
+\cgalHasModelsBare{All models of `Kernel`,Projection traits such as `CGAL::Projection_traits_xy_3<K>`}
 
 \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
 */
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h
index 5015af963f61..5116683d78b3 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h
@@ -9,7 +9,7 @@ The concept `AlphaShapeVertex_2` describes the requirements for the base vertex
   RegularTriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_2TriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
-\cgalHasModel `CGAL::Alpha_shape_vertex_base_2` (templated with the appropriate triangulation vertex base class).
+\cgalHasModelsBare{`CGAL::Alpha_shape_vertex_base_2` (templated with the appropriate triangulation vertex base class)}
 */
 class AlphaShapeVertex_2 {
 public:
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h
index 62d404c3c384..05be16ee5596 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h
@@ -9,8 +9,7 @@ of the underlying regular triangulation of a weighted alpha shape.
 
 \cgalRefines{RegularTriangulationTraits_2 if the underlying triangulation of the alpha shape is a regular triangulation.}
 
-\cgalHasModel All models of `Kernel`.
-\cgalHasModel Projection traits such as `CGAL::Projection_traits_xy_3<K>`.
+\cgalHasModelsBare{All models of `Kernel`,Projection traits such as `CGAL::Projection_traits_xy_3<K>`}
 
 \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
 */
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h
index 570b419998e4..de5c0aacd622 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h
@@ -9,7 +9,7 @@ The concept `AlphaShapeCell_3` describes the requirements for the base cell of a
   RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
-\cgalHasModel `CGAL::Alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class).
+\cgalHasModelsBare{`CGAL::Alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class)}
 
 \sa `CGAL::Alpha_status`
 
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h
index 6d9fbcbe4304..4a5fe7a8bfd0 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h
@@ -10,7 +10,7 @@ of the underlying Delaunay triangulation of a basic alpha shape.
 \cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
   Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
 
-\cgalHasModel All models of `Kernel`.
+\cgalHasModelsBare{All models of `Kernel`}
 
 \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
 */
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h
index 6e23176c2d94..65f490141802 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h
@@ -9,7 +9,7 @@ The concept `AlphaShapeVertex_3` describes the requirements for the base vertex
   RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation.
   Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
-\cgalHasModel `CGAL::Alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class).
+\cgalHasModelsBare{`CGAL::Alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class)}
 
 \sa `CGAL::Alpha_status`
 
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h
index 1fd4060952f9..7707ed14ce16 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h
@@ -9,7 +9,7 @@ The concept `FixedAlphaShapeCell_3` describes the requirements for the base cell
   RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
-\cgalHasModel `CGAL::Fixed_alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class).
+\cgalHasModelsBare{`CGAL::Fixed_alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class)}
 */
 class FixedAlphaShapeCell_3 {
 public:
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h
index d6b3aa7f35f6..4c63e9618fa0 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h
@@ -10,7 +10,7 @@ of the underlying Delaunay triangulation of a basic alpha shape with a fixed val
 \cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
   Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
 
-\cgalHasModel All models of `Kernel`.
+\cgalHasModelsBare{All models of `Kernel`}
 
 \sa CGAL::Exact_predicates_inexact_constructions_kernel (recommended kernel)
 */
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h
index 59d9593e5fcf..7b152f16e2e5 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h
@@ -9,7 +9,7 @@ The concept `FixedAlphaShapeVertex_3` describes the requirements for the base ve
   RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
-\cgalHasModel `CGAL::Fixed_alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class).
+\cgalHasModelsBare{`CGAL::Fixed_alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class)}
 */
 
 class FixedAlphaShapeVertex_3 {
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h
index e84810fdc788..8b7694d5643c 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h
@@ -9,7 +9,7 @@ for the geometric traits class of the underlying regular triangulation of a weig
 \cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation}
 
-\cgalHasModel All models of `Kernel`.
+\cgalHasModelsBare{All models of `Kernel`}
 
 \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
 */
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h
index f0c11a972c7e..10c8009e6c26 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h
@@ -10,7 +10,7 @@ of the underlying regular triangulation of a weighted alpha shape.
 \cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation}
 
-\cgalHasModel All models of `Kernel`.
+\cgalHasModelsBare{All models of `Kernel`}
 
 \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
 */
diff --git a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h
index 85c697f40a8f..145349567d2f 100644
--- a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h
+++ b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h
@@ -9,10 +9,11 @@ The concept `AlphaWrapOracle` defines the requirements for an Alpha Wrap <em>Ora
 that answers a number of queries over the input of the algorithm.
 The oracle is the template parameter of the class `CGAL::Alpha_wraps_3_::Alpha_wrap_3`.
 
-\cgalHasModel `CGAL::Alpha_wraps_3_::Point_set_oracle`
-\cgalHasModel `CGAL::Alpha_wraps_3_::Segment_soup_oracle`
-\cgalHasModel `CGAL::Alpha_wraps_3_::Triangle_mesh_oracle`
-\cgalHasModel `CGAL::Alpha_wraps_3_::Triangle_soup_oracle`
+\cgalHasModelsBegin CGAL::Alpha_wraps_3_::Point_set_oracle
+\cgalHasModels CGAL::Alpha_wraps_3_::Segment_soup_oracle
+\cgalHasModels CGAL::Alpha_wraps_3_::Triangle_mesh_oracle
+\cgalHasModels CGAL::Alpha_wraps_3_::Triangle_soup_oracle
+\cgalHasModelsEnd
 
 */
 template <typename GeomTraits>
diff --git a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h
index 63428d4b8893..916aa5aa3daf 100644
--- a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h
+++ b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h
@@ -11,7 +11,7 @@ you require Kernel. Stitch_borders doesn't even have clear geometric traits requ
 The concept `AlphaWrapTraits_3` defines the requirements for the geometric traits class
 of an alpha wrap oracle.
 
-\cgalHasModel Any 3D %kernel is a model of this traits concept.
+\cgalHasModelsBare{Any 3D %kernel is a model of this traits concept}
 */
 
 class AlphaWrapTraits_3
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h
index cca93a7c829c..e494faa898c8 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h
@@ -27,7 +27,8 @@ We only describe the additional requirements with respect to the
 
 \cgalRefines{TriangulationDataStructure_2}
 
-\cgalHasModel `CGAL::Triangulation_data_structure_2<Vb,Fb>`
+\cgalHasModelsBegin CGAL::Triangulation_data_structure_2<Vb,Fb>
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
 \sa `ApolloniusGraphVertexBase_2`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h
index a2ed0353dddc..4cfc7a99223a 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h
@@ -19,7 +19,8 @@ next and previous level graphs.
 `ApolloniusGraphHierarchyVertexBase_2` does not introduce any
 types in addition to those of `ApolloniusGraphVertexBase_2`.
 
-\cgalHasModel `CGAL::Apollonius_graph_hierarchy_vertex_base_2<CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden> >`
+\cgalHasModelsBegin CGAL::Apollonius_graph_hierarchy_vertex_base_2<CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden> >
+\cgalHasModelsEnd
 
 \sa `ApolloniusGraphDataStructure_2`
 \sa `CGAL::Apollonius_graph_hierarchy_2<Gt,Agds>`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h
index 5fa6db8c6e66..1517dd4fe17f 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h
@@ -12,8 +12,9 @@ it provides a type `Site_2`, which must be a model of the concept
 constructions for sites and several function object
 types for the predicates.
 
-\cgalHasModel `CGAL::Apollonius_graph_traits_2<K,Method_tag>`
-\cgalHasModel `CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>`
+\cgalHasModelsBegin CGAL::Apollonius_graph_traits_2<K,Method_tag>
+\cgalHasModels CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>
+\cgalHasModelsEnd
 
 \sa `CGAL::Apollonius_graph_2<Gt,Agds>`
 \sa `CGAL::Apollonius_graph_traits_2<K,Method_tag>`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h
index 201d7e9e91a3..cac31092bafe 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h
@@ -12,7 +12,8 @@ sites. The container stores the hidden sites related to the vertex.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModel `CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden>`
+\cgalHasModelsBegin CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden>
+\cgalHasModelsEnd
 
 \sa `ApolloniusGraphDataStructure_2`
 \sa `CGAL::Apollonius_graph_2<Gt,Agds>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h
index 956aad8144f9..671d83a69674 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModel ArrangementApproximateTraits_2::Approximate_2
+ * \cgalHasModelsBegin ArrangementApproximateTraits_2::Approximate_2
+ * \cgalHasModelsEnd
  */
 class Approximate_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h
index 66e4e53e8986..56ec39093c7e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModel ArrangementXMonotoneTraits_2::Are_mergeable_2
+ * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Are_mergeable_2
+ * \cgalHasModelsEnd
  */
 class AreMergeable_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h
index 01f854b6426f..9031f72a9bdb 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableTernaryFunction}
  *
- * \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_2
+ * \cgalHasModelsBegin ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_
+ * \cgalHasModelsEnd
  */
 class CompareXNearBoundary_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h
index 3a31719bb756..45fd98fa2d6b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h
@@ -5,9 +5,10 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableFunctor}
  *
- * \cgalHasModel ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2
- * \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_2
- * \cgalHasModel ArrangementSphericalBoundaryTraits_2::Compare_x_on_boundary_2
+ * \cgalHasModelsBegin ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2
+ * \cgalHasModels ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_2
+ * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Compare_x_on_boundary_2
+ * \cgalHasModelsEnd
  */
 class CompareXOnBoundaryOfCurveEnd_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h
index 4339c3f369dd..b02a736b31d3 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h
@@ -5,9 +5,10 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableFunctor}
  *
- * \cgalHasModel ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2
- * \cgalHasModel ArrangementClosedTopTraits_2::Compare_x_on_boundary_2
- * \cgalHasModel ArrangementIdentifiedHorizontalTraits_2::Compare_x_on_boundary_2
+ * \cgalHasModelsBegin ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2
+ * \cgalHasModels ArrangementClosedTopTraits_2::Compare_x_on_boundary_2
+ * \cgalHasModels ArrangementIdentifiedHorizontalTraits_2::Compare_x_on_boundary_2
+ * \cgalHasModelsEnd
  */
 class CompareXOnBoundary_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h
index 413311319d65..fe5d8a4d5059 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h
@@ -4,7 +4,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModel ArrangementBasicTraits_2::Compare_x_2
+ * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_x_2
+ * \cgalHasModelsEnd
  */
 class CompareX_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h
index a485ec1a6238..f571e844bdbd 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModel ArrangementBasicTraits_2::Compare_xy_2
+ * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_xy_2
+ * \cgalHasModelsEnd
  */
 class CompareXy_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h
index 5f50c695ceaa..eeb409061462 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableTernaryFunction}
  *
- * \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_left_2
+ * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_left_2
+ * \cgalHasModelsEnd
  */
 class CompareYAtXLeft_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h
index 670752239a71..1308a75c5bda 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableTernaryFunction}
  *
- * \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_right_2
+ * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_right_2
+ * \cgalHasModelsEnd
  */
 class CompareYAtXRight_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h
index 53bfaa495915..e1e0d6714418 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModel ArrangementBasicTraits_2::Compare_y_at_x_2
+ * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_2
+ * \cgalHasModelsEnd
  */
 class CompareYAtX_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h
index f4bc83bd1a91..df0c66fae012 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableTernaryFunction}
  *
- * \cgalHasModel ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2
+ * \cgalHasModelsBegin ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2
+ * \cgalHasModelsEnd
  */
 class CompareYNearBoundary_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h
index 117023bc8326..8f5c89d89fef 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h
@@ -5,10 +5,11 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModel ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2
- * \cgalHasModel ArrangementClosedRightTraits_2::Compare_y_on_boundary_2
- * \cgalHasModel ArrangementIdentifiedVerticalTraits_2::Compare_y_on_boundary_2
- * \cgalHasModel ArrangementSphericalBoundaryTraits_2::Compare_y_on_boundary_2
+ * \cgalHasModelsBegin ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2
+ * \cgalHasModels ArrangementClosedRightTraits_2::Compare_y_on_boundary_2
+ * \cgalHasModels ArrangementIdentifiedVerticalTraits_2::Compare_y_on_boundary_2
+ * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Compare_y_on_boundary_2
+ * \cgalHasModelsEnd
  */
 class CompareYOnBoundary_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h
index 72620babd22d..d6a0c5b1208a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModel ArrangementConstructCurveTraits_2::Construct_curve_2
+ * \cgalHasModelsBegin ArrangementConstructCurveTraits_2::Construct_curve_2
+ * \cgalHasModelsEnd
  */
 class ConstructCurve_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h
index e5c4146c9fa1..e94c601aa7a6 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableUnaryFunction}
  *
- * \cgalHasModel ArrangementBasicTraits_2::Construct_max_vertex_2
+ * \cgalHasModelsBegin ArrangementBasicTraits_2::Construct_max_vertex_2
+ * \cgalHasModelsEnd
  */
 class ConstructMaxVertex_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h
index 472c793d9f4b..00a000f41ced 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableUnaryFunction}
  *
- * \cgalHasModel ArrangementBasicTraits_2::Construct_min_vertex_2
+ * \cgalHasModelsBegin ArrangementBasicTraits_2::Construct_min_vertex_2
+ * \cgalHasModelsEnd
  */
 class ConstructMinVertex_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h
index 6fc6381803af..d25d94e43713 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModel ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2
+ * \cgalHasModelsBegin ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2
+ * \cgalHasModelsEnd
  */
 class ConstructXMonotoneCurve_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h
index d923f9b27dba..3994e674cfb7 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h
@@ -6,7 +6,8 @@ namespace ArrTraits {
  * represents a general planar curve.
  *
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
- * \cgalHasModel ArrangementTraits_2::Curve_2
+ * \cgalHasModelsBegin ArrangementTraits_2::Curve_2
+ * \cgalHasModelsEnd
  */
 class Curve_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h
index 41cf7e2f6c63..71c6da87afcc 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModel ArrangementBasicTraits_2::Equal_2
+ * \cgalHasModelsBegin ArrangementBasicTraits_2::Equal_2
+ * \cgalHasModelsEnd
  */
 class Equal_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
index 5e11e857548e..7a6d7e307390 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModel ArrangementXMonotoneTraits_2::Intersect_2
+ * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Intersect_2
+ * \cgalHasModelsEnd
  */
 class Intersect_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h
index 47bba6ea7443..f2850203499e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableUnaryFunction}
  *
- * \cgalHasModel ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2
+ * \cgalHasModelsBegin ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2
+ * \cgalHasModelsEnd
  */
 class IsOnXIdentification_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h
index d9a69236ee8f..e07b550923f1 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableUnaryFunction}
  *
- * \cgalHasModel ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2
+ * \cgalHasModelsBegin ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2
+ * \cgalHasModelsEnd
  */
 class IsOnYIdentification_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h
index 1831b790c564..e9bbf29d0c8a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableUnaryFunction}
  *
- * \cgalHasModel ArrangementBasicTraits_2::Is_vertical_2
+ * \cgalHasModelsBegin ArrangementBasicTraits_2::Is_vertical_2
+ * \cgalHasModelsEnd
  */
 class IsVertical_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
index db0df3c8cc80..46d0e1b5baea 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModel ArrangementTraits_2::Make_x_monotone_2
+ * \cgalHasModelsBegin ArrangementTraits_2::Make_x_monotone_2
+ * \cgalHasModelsEnd
  */
 class MakeXMonotone_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h
index 8e61d8c75009..17e8573bea21 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModel ArrangementXMonotoneTraits_2::Merge_2
+ * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Merge_2
+ * \cgalHasModelsEnd
  */
 class Merge_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h
index a37db7c40f65..4e6a66ede1b1 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h
@@ -5,9 +5,10 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModel ArrangementVerticalSideTraits_2::Parameter_space_in_x_2
- * \cgalHasModel ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_2
- * \cgalHasModel ArrangementSphericalBoundaryTraits_2::Parameter_space_in_x_2
+ * \cgalHasModelsBegin ArrangementVerticalSideTraits_2::Parameter_space_in_x_2
+ * \cgalHasModels ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_2
+ * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Parameter_space_in_x_2
+ * \cgalHasModelsEnd
  */
 class ParameterSpaceInX_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h
index 0844ee649a4c..e443f0498da4 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h
@@ -5,9 +5,10 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModel ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2
- * \cgalHasModel ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_2
- * \cgalHasModel ArrangementSphericalBoundaryTraits_2::Parameter_space_in_y_2
+ * \cgalHasModelsBegin ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2
+ * \cgalHasModels ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_2
+ * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Parameter_space_in_y_2
+ * \cgalHasModelsEnd
  */
 class ParameterSpaceInY_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h
index 78273b889476..182f0a059bad 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h
@@ -7,7 +7,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
  *
- * \cgalHasModel ArrangementBasicTraits_2::Point_2
+ * \cgalHasModelsBegin ArrangementBasicTraits_2::Point_2
+ * \cgalHasModelsEnd
  */
 class Point_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h
index 45210b92d0c3..ff6bcb382cbf 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h
@@ -4,7 +4,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModel ArrangementXMonotoneTraits_2::Split_2
+ * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Split_2
+ * \cgalHasModelsEnd
  */
 class Split_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h
index 6b23acac29d8..f74e74bf150d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h
@@ -6,7 +6,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
  *
- * \cgalHasModel ArrangementBasicTraits_2::X_monotone_curve_2
+ * \cgalHasModelsBegin ArrangementBasicTraits_2::X_monotone_curve_2
+ * \cgalHasModelsEnd
  */
 class XMonotoneCurve_2 {
 public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h
index b92f249431b3..b4720036574e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h
@@ -8,14 +8,15 @@ point.
 
 \cgalRefines{ArrangementBasicTraits_2}
 
-\cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
-\cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2`
-\cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_polycurve_traits_2<GeometryTraits_2>`
-\cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits_2>`
-\cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
+\cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
+\cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
+\cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_polycurve_traits_2<GeometryTraits_2>
+\cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
+\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+\cgalHasModelsEnd
 
 \sa `ArrangementConstructXMonotoneCurveTraits_2`,
     `ArrangementXMonotoneTraits_2`, and
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h
index 750182554c39..3e8c60735722 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h
@@ -9,7 +9,8 @@
  * represent the arrangement cells (i.e., vertices, edges, and facets) and the
  * incident relations between them.
  *
- * \cgalHasModel `CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2, Dcel>`
+ * \cgalHasModelsBegin CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2, Dcel>
+ * \cgalHasModelsEnd
  */
 
 class ArrangementBasicTopologyTraits {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h
index 4b8cbbbf7c28..e521ef28b065 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h
@@ -27,21 +27,22 @@
  *
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
  *
- * \cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_non_caching_segment_basic_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits>`
- * \cgalHasModel `CGAL::Arr_circle_segment_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_line_arc_traits_2<CircularKernel>`
- * \cgalHasModel `CGAL::Arr_circular_arc_traits_2<CircularKernel>`
- * \cgalHasModel `CGAL::Arr_circular_line_arc_traits_2<CircularKernel>`
- * \cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
- * \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
- * \cgalHasModel `CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>`
- * \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
- * \cgalHasModel `CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>`
- * \cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>`
+ * \cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_non_caching_segment_basic_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits>
+ * \cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_line_arc_traits_2<CircularKernel>
+ * \cgalHasModels CGAL::Arr_circular_arc_traits_2<CircularKernel>
+ * \cgalHasModels CGAL::Arr_circular_line_arc_traits_2<CircularKernel>
+ * \cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
+ * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+ * \cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
+ * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
+ * \cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
+ * \cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
+ * \cgalHasModelsEnd
  */
 
 class ArrangementBasicTraits_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h
index afc3942cba8d..176810a0793e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h
@@ -7,13 +7,14 @@
  *
  * \cgalRefines{ArrangementTraits_2}
  *
- * \cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
- * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2`
- * \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits_2>`
- * \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
+ * \cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
+ * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
+ * \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
+ * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+ * \cgalHasModelsEnd
  *
  * \sa `ArrangementConstructXMonotoneCurveTraits_2`, and
  *     `ArrangementTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h
index 394f98f5a3be..99ca431cd467 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h
@@ -7,13 +7,14 @@
  *
  * \cgalRefines{ArrangementBasicTraits_2}
  *
- * \cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
- * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2`
- * \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits_2>`
- * \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
+ * \cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
+ * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
+ * \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
+ * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+ * \cgalHasModelsEnd
  *
  * \sa `ArrangementApproximateTraits_2`,
  *     `ArrangementXMonotoneTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h
index f685263e31e4..81984c4699eb 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h
@@ -14,10 +14,11 @@
  * `ArrangementDcelHalfedge`, `ArrangementDcelFace`, `ArrangementDcelOuterCcb`,
  * `ArrangementDcelInnerCcb`, and `ArrangementDcelIsolatedVertex` respectively.)
  *
- * \cgalHasModel `CGAL::Arr_dcel_base<V,H,F>`
- * \cgalHasModel `CGAL::Arr_default_dcel<Traits>`
- * \cgalHasModel `CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>`
- * \cgalHasModel `CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>`
+ * \cgalHasModelsBegin CGAL::Arr_dcel_base<V,H,F>
+ * \cgalHasModels CGAL::Arr_default_dcel<Traits>
+ * \cgalHasModels CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>
+ * \cgalHasModels CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>
+ * \cgalHasModelsEnd
  *
  * \sa `ArrangementDcelVertex`
  * \sa `ArrangementDcelHalfedge`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
index 88e4fff19f09..d4f263cf01f1 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
@@ -10,9 +10,10 @@ Instantiate a dcel class with many different possible types without ad-hoc limit
 
 \cgalRefines{ArrangementDcel}
 
-\cgalHasModel `CGAL::Arr_default_dcel<Traits>`
-\cgalHasModel `CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>`
-\cgalHasModel `CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>`
+\cgalHasModelsBegin CGAL::Arr_default_dcel<Traits>
+\cgalHasModels CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>
+\cgalHasModels CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h
index e659a3be2972..60e28710d01a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h
@@ -11,10 +11,11 @@
  *
  * \cgalRefines{ArrangementBasicTraits_2}
  *
- * \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
- * \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
- * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>`
+ * \cgalHasModelsBegin CGAL::Arr_linear_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+ * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
+ * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>
+ * \cgalHasModelsEnd
  *
  * \sa `ArrangementVerticalSideTraits_2`
  */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h
index 09e87373c1e2..53469ded7bd2 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h
@@ -5,9 +5,10 @@
  * functions that enable reading an arrangement from an input stream using a
  * specific format.
  *
- * \cgalHasModel `CGAL::Arr_text_formatter<Arrangement>`
- * \cgalHasModel `CGAL::Arr_face_extended_text_formatter<Arrangement>`
- * \cgalHasModel `CGAL::Arr_extended_dcel_text_formatter<Arrangement>`
+ * \cgalHasModelsBegin CGAL::Arr_text_formatter<Arrangement>
+ * \cgalHasModels CGAL::Arr_face_extended_text_formatter<Arrangement>
+ * \cgalHasModels CGAL::Arr_extended_dcel_text_formatter<Arrangement>
+ * \cgalHasModelsEnd
  *
  */
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
index cc66b479fbe8..b014807650ae 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
@@ -11,14 +11,15 @@
  *
  * \cgalRefines{ArrangementApproximateTraits_2,ArrangementConstructXMonotoneCurveTraits_2}
  *
- * \cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
- * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2`
- * \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_polycurve_traits_2<GeometryTraits_2>`
- * \cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits_2>`
- * \cgalHasModel `CGAL::Arr_rational_function_traits_2`
+ * \cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
+ * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
+ * \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_polycurve_traits_2<GeometryTraits_2>
+ * \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
+ * \cgalHasModels CGAL::Arr_rational_function_traits_2
+ * \cgalHasModelsEnd
  *
  * \sa `ArrangementXMonotoneTraits_2` and
  * `ArrangementTraits_2<AlgebraicKernel_d_1>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h
index 8190767e71c5..16f3ffa51951 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h
@@ -39,11 +39,12 @@
  *
  * \cgalRefines{ArrangementBasicTraits_2}
  *
- * \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
- * \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
- * \cgalHasModel `CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>`
- * \cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>`
+ * \cgalHasModelsBegin CGAL::Arr_linear_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+ * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
+ * \cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
+ * \cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
+ * \cgalHasModelsEnd
  *
  * \sa `ArrangementBasicTraits_2`
  * \sa `ArrangementXMonotoneTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h
index 0418ee873b5a..bee9cba77204 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h
@@ -6,9 +6,10 @@
 A model for the `ArrangementOutputFormatter` concept supports a set of functions that enable
 writing an arrangement to an output stream using a specific format.
 
-\cgalHasModel `CGAL::Arr_text_formatter<Arrangement>`
-\cgalHasModel `CGAL::Arr_face_extended_text_formatter<Arrangement>`
-\cgalHasModel `CGAL::Arr_extended_dcel_text_formatter<Arrangement>`
+\cgalHasModelsBegin CGAL::Arr_text_formatter<Arrangement>
+\cgalHasModels CGAL::Arr_face_extended_text_formatter<Arrangement>
+\cgalHasModels CGAL::Arr_extended_dcel_text_formatter<Arrangement>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
index c2f6a0437f2c..31e4bf302320 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
@@ -20,10 +20,11 @@ the old style without any overhead, the macro
 `CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any
 \cgal header is included.
 
-\cgalHasModel `CGAL::Arr_naive_point_location<Arrangement>`
-\cgalHasModel `CGAL::Arr_walk_along_line_point_location<Arrangement>`
-\cgalHasModel `CGAL::Arr_trapezoid_ric_point_location<Arrangement>`
-\cgalHasModel `CGAL::Arr_landmarks_point_location<Arrangement,Generator>`
+\cgalHasModelsBegin CGAL::Arr_naive_point_location<Arrangement>
+\cgalHasModels CGAL::Arr_walk_along_line_point_location<Arrangement>
+\cgalHasModels CGAL::Arr_trapezoid_ric_point_location<Arrangement>
+\cgalHasModels CGAL::Arr_landmarks_point_location<Arrangement,Generator>
+\cgalHasModelsEnd
 
 \sa `CGAL::Arr_naive_point_location<Arrangement>`
 \sa `CGAL::Arr_walk_along_line_point_location<Arrangement>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h
index 87ff1eb159c6..fe9137b5696a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h
@@ -11,7 +11,8 @@
  * \cgalRefines{ArrangementBasicTraits_2,ArrangementIdentifiedVerticalTraits_2,
  *   ArrangementContractedBottomTraits_2,ArrangementContractedTopTraits_2}
  *
- * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>`
+ * \cgalHasModelsBegin CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>
+ * \cgalHasModelsEnd
  *
  * \sa `ArrangementOpenBoundaryTraits_2`
  * \sa `ArrangementBasicTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h
index 2ea883dee115..80660fcda14d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h
@@ -20,9 +20,10 @@
  *
  * At this point we do not expose all the requirements of this concept.
  *
- * \cgalHasModel `CGAL::Arr_bounded_planar_topology_traits_2<GeometryTraits_2,Dcel>`
- * \cgalHasModel `CGAL::Arr_unb_planar_topology_traits_2<GeometryTraits_2,Dcel>`
- * \cgalHasModel `CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2,Dcel>`
+ * \cgalHasModelsBegin CGAL::Arr_bounded_planar_topology_traits_2<GeometryTraits_2,Dcel>
+ * \cgalHasModels CGAL::Arr_unb_planar_topology_traits_2<GeometryTraits_2,Dcel>
+ * \cgalHasModels CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2,Dcel>
+ * \cgalHasModelsEnd
  *
  * \sa `Arrangement_on_surface_2<GeometryTraits_2,TopologyTraits>`
  */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h
index 05bac54d5a27..e9bca5d3dc96 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h
@@ -30,20 +30,21 @@ that accept such curves, such as `intsert()`.
 
 \cgalRefines{ArrangementXMonotoneTraits_2}
 
-\cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits>`
-\cgalHasModel `CGAL::Arr_circle_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_line_arc_traits_2<CircularKernel>`
-\cgalHasModel `CGAL::Arr_circular_arc_traits_2<CircularKernel>`
-\cgalHasModel `CGAL::Arr_circular_line_arc_traits_2<CircularKernel>`
-\cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
-\cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
-\cgalHasModel `CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>`
-\cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
-\cgalHasModel `CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>`
-\cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>`
+\cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits>
+\cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_line_arc_traits_2<CircularKernel>
+\cgalHasModels CGAL::Arr_circular_arc_traits_2<CircularKernel>
+\cgalHasModels CGAL::Arr_circular_line_arc_traits_2<CircularKernel>
+\cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
+\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+\cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
+\cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
+\cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
+\cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
+\cgalHasModelsEnd
 
 \sa `ArrangementBasicTraits_2`
 \sa `ArrangementXMonotoneTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
index 4a1febdc2d23..eb1b893f460e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
@@ -28,10 +28,11 @@ is recommended. To enable the old style without any overhead, the macro
 `CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any
 \cgal header is included.
 
-\cgalHasModel `CGAL::Arr_naive_point_location<Arrangement>`
-\cgalHasModel `CGAL::Arr_walk_along_line_point_location<Arrangement>`
-\cgalHasModel `CGAL::Arr_trapezoid_ric_point_location<Arrangement>`
-\cgalHasModel `CGAL::Arr_landmarks_point_location<Arrangement,Generator>`
+\cgalHasModelsBegin CGAL::Arr_naive_point_location<Arrangement>
+\cgalHasModels CGAL::Arr_walk_along_line_point_location<Arrangement>
+\cgalHasModels CGAL::Arr_trapezoid_ric_point_location<Arrangement>
+\cgalHasModels CGAL::Arr_landmarks_point_location<Arrangement,Generator>
+\cgalHasModelsEnd
 
 \sa `CGAL::Arr_naive_point_location<Arrangement>`
 \sa `CGAL::Arr_walk_along_line_point_location<Arrangement>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h
index cc36ec97ea62..e12fda8a889f 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h
@@ -11,10 +11,11 @@
  *
  * \cgalRefines{ArrangementBasicTraits_2}
  *
- * \cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
- * \cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
- * \cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
- * \cgalHasModel `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>`
+ * \cgalHasModelsBegin CGAL::Arr_linear_traits_2<Kernel>
+ * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+ * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
+ * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>
+ * \cgalHasModelsEnd
  *
  * \sa `ArrangementVerticalSideTraits_2`
  */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h
index fd879fad9a03..4b31986adfb5 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h
@@ -9,7 +9,8 @@ specific format.
 
 \cgalRefines{ArrangementInputFormatter}
 
-\cgalHasModel `CGAL::Arr_with_history_text_formatter<ArrFormatter>`
+\cgalHasModelsBegin CGAL::Arr_with_history_text_formatter<ArrFormatter>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h
index e766c2cfc26b..8ff0dc5eda48 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h
@@ -9,7 +9,8 @@ specific format.
 
 \cgalRefines{ArrangementOutputFormatter}
 
-\cgalHasModel `CGAL::Arr_with_history_text_formatter<ArrFormatter>`
+\cgalHasModelsBegin CGAL::Arr_with_history_text_formatter<ArrFormatter>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h
index 5eae4b190c2d..99e34f2ae6d1 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h
@@ -18,20 +18,21 @@ curve splitting.
 
 \cgalRefines{ArrangementBasicTraits_2}
 
-\cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_linear_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_polyline_traits_2<SegmentTraits>`
-\cgalHasModel `CGAL::Arr_circle_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_line_arc_traits_2<CircularKernel>`
-\cgalHasModel `CGAL::Arr_circular_arc_traits_2<CircularKernel>`
-\cgalHasModel `CGAL::Arr_circular_line_arc_traits_2<CircularKernel>`
-\cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
-\cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>`
-\cgalHasModel `CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>`
-\cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
-\cgalHasModel `CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>`
-\cgalHasModel `CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>`
+\cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits>
+\cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_line_arc_traits_2<CircularKernel>
+\cgalHasModels CGAL::Arr_circular_arc_traits_2<CircularKernel>
+\cgalHasModels CGAL::Arr_circular_line_arc_traits_2<CircularKernel>
+\cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
+\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+\cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
+\cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
+\cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
+\cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
+\cgalHasModelsEnd
 
 \sa `ArrangementBasicTraits_2`
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h
index 9221705a709d..2a90dfee44dc 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h
@@ -11,8 +11,9 @@ Models for the concept are used by the global `overlay()` function to
 maintain the auxiliary data stored with the \dcel records of the resulting
 overlaid arrangement, based on the contents of the input records.
 
-\cgalHasModel `CGAL::Arr_default_overlay_traits<Arrangement>`
-\cgalHasModel `CGAL::Arr_face_overlay_traits<Arr1,Arr2,ResArr,OvlFaceData>`
+\cgalHasModelsBegin CGAL::Arr_default_overlay_traits<Arrangement>
+\cgalHasModels CGAL::Arr_face_overlay_traits<Arr1,Arr2,ResArr,OvlFaceData>
+\cgalHasModelsEnd
 
 \sa `overlay`
 
diff --git a/BGL/doc/BGL/Concepts/EdgeListGraph.h b/BGL/doc/BGL/Concepts/EdgeListGraph.h
index 3b614c86c079..93b23b76748a 100644
--- a/BGL/doc/BGL/Concepts/EdgeListGraph.h
+++ b/BGL/doc/BGL/Concepts/EdgeListGraph.h
@@ -11,7 +11,7 @@ and adds the requirement for traversal of all edges in a graph.
 
 \cgalRefines{<a href="https://www.boost.org/libs/graph/doc/Graph.html">Graph</a>}
 
-\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
+\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/FaceGraph.h b/BGL/doc/BGL/Concepts/FaceGraph.h
index b7ea012f4c9b..a8b8bbe18935 100644
--- a/BGL/doc/BGL/Concepts/FaceGraph.h
+++ b/BGL/doc/BGL/Concepts/FaceGraph.h
@@ -20,7 +20,7 @@ A face descriptor must be `DefaultConstructible`, `Assignable`, `EqualityCompara
 
 \cgalRefines{HalfedgeGraph}
 
-\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
+\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/FaceListGraph.h b/BGL/doc/BGL/Concepts/FaceListGraph.h
index 6e7936f5ad9d..046015b67d2f 100644
--- a/BGL/doc/BGL/Concepts/FaceListGraph.h
+++ b/BGL/doc/BGL/Concepts/FaceListGraph.h
@@ -16,7 +16,7 @@ face iterator must be the same as the face descriptor of the graph.
 
 \cgalRefines{FaceGraph}
 
-\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
+\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/HalfedgeGraph.h b/BGL/doc/BGL/Concepts/HalfedgeGraph.h
index 8a31a1a787ac..7be2d2220d71 100644
--- a/BGL/doc/BGL/Concepts/HalfedgeGraph.h
+++ b/BGL/doc/BGL/Concepts/HalfedgeGraph.h
@@ -38,7 +38,7 @@ An edge descriptor must be `DefaultConstructible`, `Assignable`, `EqualityCompar
 
 A model of `HalfedgeGraph` must have the interior property `vertex_point` attached to its vertices.
 
-\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
+\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/HalfedgeListGraph.h b/BGL/doc/BGL/Concepts/HalfedgeListGraph.h
index 1019f3c336bd..c5f8eeff6898 100644
--- a/BGL/doc/BGL/Concepts/HalfedgeListGraph.h
+++ b/BGL/doc/BGL/Concepts/HalfedgeListGraph.h
@@ -16,7 +16,7 @@ halfedge iterator must be the same as the halfedge descriptor of the graph.
 
 \cgalRefines{HalfedgeGraph}
 
-\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
+\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/MutableFaceGraph.h b/BGL/doc/BGL/Concepts/MutableFaceGraph.h
index 2ce0c9815546..1f0f86c6a863 100644
--- a/BGL/doc/BGL/Concepts/MutableFaceGraph.h
+++ b/BGL/doc/BGL/Concepts/MutableFaceGraph.h
@@ -7,7 +7,7 @@ the requirement for operations to add faces and to modify face-halfedge relation
 
 \cgalRefines{FaceGraph,MutableHalfedgeGraph}
 
-\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
+\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h b/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h
index 5ce56824a5ae..86bd650fc867 100644
--- a/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h
+++ b/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h
@@ -8,7 +8,7 @@ update the incidence information between vertices and halfedges.
 
 \cgalRefines{HalfedgeGraph}
 
-\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
+\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/VertexListGraph.h b/BGL/doc/BGL/Concepts/VertexListGraph.h
index aa88a4d1944d..009fe00dac1b 100644
--- a/BGL/doc/BGL/Concepts/VertexListGraph.h
+++ b/BGL/doc/BGL/Concepts/VertexListGraph.h
@@ -11,7 +11,7 @@ and adds the requirement for traversal of all vertices in a graph.
 
 \cgalRefines{<a href="https://www.boost.org/libs/graph/doc/Graph.html">Graph</a>}
 
-\cgalHasModel See \link PkgBGLTraits Boost Graph Traits Specializations \endlink
+\cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
index 7f9ea3dfcbbf..9fd9c19943b5 100644
--- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
+++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
@@ -8,10 +8,10 @@ namespace Barycentric_coordinates {
 A concept that describes the set of methods that should be defined for all coordinate
 models used to parameterize the class `Generalized_barycentric_coordinates_2`.
 
-\cgalHasModel
-- `Wachspress_2`
-- `Mean_value_2`
-- `Discrete_harmonic_2`
+\cgalHasModelsBegin Wachspress_2
+\cgalHasModels Mean_value_2
+\cgalHasModels Discrete_harmonic_2
+\cgalHasModelsEnd
 
 \deprecated This part of the package is deprecated since the version 5.4 of \cgal.
 */
diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h
index 1fe3c8fc2bd5..bf07127b14db 100644
--- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h
+++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h
@@ -9,12 +9,11 @@ A concept that describes the set of requirements of the template parameter
 `GeomTraits` used to parameterize all classes and functions with 2D barycentric
 coordinates from the namespace `CGAL::Barycentric_coordinates`.
 
-\cgalHasModel
-- All models of `Kernel`
-- `CGAL::Projection_traits_3<K>`
-- `CGAL::Projection_traits_xy_3<K>`
-- `CGAL::Projection_traits_yz_3<K>`
-- `CGAL::Projection_traits_xz_3<K>`
+\cgalHasModelsBareBegin{All models of `Kernel`} CGAL::Projection_traits_3<K>
+\cgalHasModels CGAL::Projection_traits_xy_3<K>
+\cgalHasModels CGAL::Projection_traits_yz_3<K>
+\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsEnd
 */
 class BarycentricTraits_2 {
 
diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h
index 9e6e353958c3..9ace050c0d8b 100644
--- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h
+++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h
@@ -13,7 +13,8 @@ elements, which share common edges and vertices. These finite elements are then
 used to approximate certain types of generalized barycentric coordinate functions.
 The domain is bounded by the polygon.
 
-\cgalHasModel `Delaunay_domain_2`
+\cgalHasModelsBegin Delaunay_domain_2
+\cgalHasModelsEnd
 */
 class DiscretizedDomain_2 {
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h
index c1f77e40a827..409316c5a4e6 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h
@@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableBinaryFunction}
 
-\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2`
+\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2
+\cgalHasModelsEnd
 
 */
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h
index 336b992999dd..f4fcfa096e92 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h
@@ -6,7 +6,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableUnaryFunction}
 
-\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2`
+\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2
+\cgalHasModelsEnd
 
 */
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h
index 5e8c9d034a44..719878346a5c 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h
@@ -6,7 +6,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableUnaryFunction}
 
-\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2`
+\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2
+\cgalHasModelsEnd
 
 */
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
index 0d90fbacb2f9..1e98facf71d9 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
@@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableBinaryFunction}
 
-\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Intersect_2`
+\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Intersect_2
+\cgalHasModelsEnd
 
 */
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h
index 673b60c589b4..2064a3ba0797 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h
@@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableBinaryFunction}
 
-\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Merge_2`
+\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Merge_2
+\cgalHasModelsEnd
 
 */
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h
index 108eb017796f..91f8903728c8 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h
@@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableUnaryFunction}
 
-\cgalHasModel `ArrangementDirectionalXMonotoneTraits_2::Split_2`
+\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Split_2
+\cgalHasModelsEnd
 
 */
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h
index 62ce1fb841f8..6b66a66997bb 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h
@@ -16,13 +16,14 @@ as its <I>source</I> and the other as its <I>target</I>.
 
 \cgalRefines{ArrangementXMonotoneTraits_2}
 
-\cgalHasModel `CGAL::Arr_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_non_caching_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_circle_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>`
-\cgalHasModel `CGAL::Arr_rational_function_traits_2<AlgKernel,NtTraits>`
-\cgalHasModel `CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>`
-\cgalHasModel `CGAL::Arr_algebraic_segment_traits_2<Coefficient>`
+\cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
+\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgKernel,NtTraits>
+\cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
+\cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
+\cgalHasModelsEnd
 
 \sa `ArrangementXMonotoneTraits_2`
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h
index ec5f5909ce3e..9264a822bff7 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h
@@ -16,7 +16,8 @@ respectively
 
 \cgalRefines{ArrangementDcel}
 
-\cgalHasModel `CGAL::Gps_default_dcel<Traits>`
+\cgalHasModelsBegin CGAL::Gps_default_dcel<Traits>
+\cgalHasModelsEnd
 
 \sa `GeneralPolygonSetDcelFace`
 \sa `GeneralPolygonSetDcelHalfedge`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h
index e33f52f22197..029f24e7b3f0 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h
@@ -9,7 +9,8 @@ to represent the underlying internal `Arrangement_2` data structure.
 
 \cgalRefines{ArrangementDcelFace}
 
-\cgalHasModel `CGAL::Gps_face_base`
+\cgalHasModelsBegin CGAL::Gps_face_base
+\cgalHasModelsEnd
 
 \sa `ArrangementDcel`
 \sa `ArrangementDcelVertex`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h
index 7334559a7eff..900f52372298 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h
@@ -8,7 +8,8 @@ to represent the underlying internal `Arrangement_2` data structure.
 
 \cgalRefines{ArrangementDcelHalfedge}
 
-\cgalHasModel `CGAL::Gps_face_halfedge`
+\cgalHasModelsBegin CGAL::Gps_face_halfedge
+\cgalHasModelsEnd
 
 \sa `ArrangementDcel`
 \sa `ArrangementDcelVertex`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h
index 99001c39f1c1..5271a7807440 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h
@@ -13,9 +13,10 @@ types.
 
 \cgalRefines{ArrangementDirectionalXMonotoneTraits_2}
 
-\cgalHasModel `CGAL::Gps_segment_traits_2<Kernel,Container,ArrSegmentTraits>`
-\cgalHasModel `CGAL::Gps_circle_segment_traits_2<Kernel>`
-\cgalHasModel `CGAL::Gps_traits_2<ArrTraits,GeneralPolygon>`
+\cgalHasModelsBegin CGAL::Gps_segment_traits_2<Kernel,Container,ArrSegmentTraits>
+\cgalHasModels CGAL::Gps_circle_segment_traits_2<Kernel>
+\cgalHasModels CGAL::Gps_traits_2<ArrTraits,GeneralPolygon>
+\cgalHasModelsEnd
 
 \sa `ArrangementDirectionalXMonotoneTraits_2`
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h
index 2a46c3470bdf..d9103ae6839a 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h
@@ -16,7 +16,8 @@ accordingly. Only counterclockwise oriented polygons are valid operands
 of Boolean set-operations. General polygon that represent holes must be
 clockwise oriented.
 
-\cgalHasModel `CGAL::General_polygon_2<ArrTraits>`
+\cgalHasModelsBegin CGAL::General_polygon_2<ArrTraits>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h
index 842290bb47f4..c9d62f6cef64 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h
@@ -9,7 +9,8 @@ A model of this concept represents a general polygon with holes.
 
 \cgalGeneralizes `GeneralPolygonWithHoles_2`
 
-\cgalHasModel `GeneralPolygonSetTraits_2::Polygon_with_holes2`
+\cgalHasModelsBegin GeneralPolygonSetTraits_2::Polygon_with_holes2
+\cgalHasModelsEnd
 
 \sa `GeneralPolygonWithHoles_2`
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h
index 99324d142277..a9999735b0e7 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h
@@ -9,8 +9,9 @@ A model of this concept represents a simple general polygon.
 
 \cgalGeneralizes `GeneralPolygon_2`
 
-\cgalHasModel `GeneralPolygonSetTraits_2::Polygon_2`
-\cgalHasModel `CGAL::Polygon_2<PolygonTraits_2, Container>`
+\cgalHasModelsBegin GeneralPolygonSetTraits_2::Polygon_2
+\cgalHasModels CGAL::Polygon_2<PolygonTraits_2, Container>
+\cgalHasModelsEnd
 
 \sa `GeneralPolygon_2`
 
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h
index d026e62b5878..05721090917e 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h
@@ -8,9 +8,10 @@ This concept defines the requirements for traits classes of
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Approximate_min_ellipsoid_d_traits_2<K,ET>`
-\cgalHasModel `CGAL::Approximate_min_ellipsoid_d_traits_3<K,ET>`
-\cgalHasModel `CGAL::Approximate_min_ellipsoid_d_traits_d<K,ET>`
+\cgalHasModelsBegin CGAL::Approximate_min_ellipsoid_d_traits_2<K,ET>
+\cgalHasModels CGAL::Approximate_min_ellipsoid_d_traits_3<K,ET>
+\cgalHasModels CGAL::Approximate_min_ellipsoid_d_traits_d<K,ET>
+\cgalHasModelsEnd
 
 \sa `CGAL::Min_ellipse_2<Traits>`
 
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h
index e593f73cb76a..71cb832881ed 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h
@@ -6,7 +6,8 @@
 This concept defines the requirements for traits classes of
 `CGAL::Min_circle_2<Traits>`.
 
-\cgalHasModel `CGAL::Min_circle_2_traits_2<K>`
+\cgalHasModelsBegin CGAL::Min_circle_2_traits_2<K>
+\cgalHasModelsEnd
 
 \sa `CGAL::Min_circle_2<Traits>`
 
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h
index f4d480a00ba1..d6cfac02a1fb 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h
@@ -6,7 +6,8 @@
 This concept defines the requirements for traits classes of
 `CGAL::Min_ellipse_2<Traits>`.
 
-\cgalHasModel `CGAL::Min_ellipse_2_traits_2<K>`
+\cgalHasModelsBegin CGAL::Min_ellipse_2_traits_2<K>
+\cgalHasModelsEnd
 
 \sa `CGAL::Min_ellipse_2<Traits>`
 
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h
index be4ba5f5a2da..17da54b77741 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h
@@ -8,7 +8,8 @@ needed to compute minimum enclosing quadrilaterals of a planar point
 set using the functions `min_rectangle_2()`,
 `min_parallelogram_2()` and `min_strip_2()`.
 
-\cgalHasModel `CGAL::Min_quadrilateral_default_traits_2<K>`
+\cgalHasModelsBegin CGAL::Min_quadrilateral_default_traits_2<K>
+\cgalHasModelsEnd
 
 \sa `CGAL::min_rectangle_2()`
 \sa `CGAL::min_parallelogram_2()`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h
index bbf1b33c2e94..ddd404f13c6b 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h
@@ -6,9 +6,10 @@
 This concept defines the requirements for traits classes of \f$ d\f$-dimensional
 min sphere and min annulus algorithms.
 
-\cgalHasModel `CGAL::Min_sphere_annulus_d_traits_2<K,ET,NT>`
-\cgalHasModel `CGAL::Min_sphere_annulus_d_traits_3<K,ET,NT>`
-\cgalHasModel `CGAL::Min_sphere_annulus_d_traits_d<K,ET,NT>`
+\cgalHasModelsBegin CGAL::Min_sphere_annulus_d_traits_2<K,ET,NT>
+\cgalHasModels CGAL::Min_sphere_annulus_d_traits_3<K,ET,NT>
+\cgalHasModels CGAL::Min_sphere_annulus_d_traits_d<K,ET,NT>
+\cgalHasModelsEnd
 
 \sa `CGAL::Min_sphere_d<Traits>`
 \sa `CGAL::Min_annulus_d<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
index 49b32647f3c2..163cc679065f 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
@@ -6,13 +6,13 @@
 A model of concept `MinSphereOfSpheresTraits` must provide the
 following constants, types, predicates and operations.
 
-\cgalHasModel `CGAL::Min_sphere_of_spheres_d_traits_2<K,FT,UseSqrt,Algorithm>`
-\cgalHasModel `CGAL::Min_sphere_of_spheres_d_traits_3<K,FT,UseSqrt,Algorithm>`
-\cgalHasModel `CGAL::Min_sphere_of_spheres_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>`
-
-\cgalHasModel `CGAL::Min_sphere_of_points_d_traits_2<K,FT,UseSqrt,Algorithm>`
-\cgalHasModel `CGAL::Min_sphere_of_points_d_traits_3<K,FT,UseSqrt,Algorithm>`
-\cgalHasModel `CGAL::Min_sphere_of_points_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>`
+\cgalHasModelsBegin CGAL::Min_sphere_of_spheres_d_traits_2<K,FT,UseSqrt,Algorithm>
+\cgalHasModels CGAL::Min_sphere_of_spheres_d_traits_3<K,FT,UseSqrt,Algorithm>
+\cgalHasModels CGAL::Min_sphere_of_spheres_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>
+\cgalHasModels CGAL::Min_sphere_of_points_d_traits_2<K,FT,UseSqrt,Algorithm>
+\cgalHasModels CGAL::Min_sphere_of_points_d_traits_3<K,FT,UseSqrt,Algorithm>
+\cgalHasModels CGAL::Min_sphere_of_points_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>
+\cgalHasModelsEnd
 */
 
 class MinSphereOfSpheresTraits {
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h
index 9c0727d44bd1..2c9c9ba44d50 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h
@@ -7,7 +7,8 @@ The concept `RectangularPCenterTraits_2` defines types and operations
 needed to compute rectilinear \f$ p\f$-centers of a planar point set
 using the function `CGAL::rectangular_p_center_2()`.
 
-\cgalHasModel `CGAL::Rectangular_p_center_default_traits_2<K>`
+\cgalHasModelsBegin CGAL::Rectangular_p_center_default_traits_2<K>
+\cgalHasModelsEnd
 
 \sa `CGAL::rectangular_p_center_2()`
 
diff --git a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h
index 7d28f370fc8c..594f4c94ebb9 100644
--- a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h
@@ -10,8 +10,9 @@ the dimension, the `id`-number, and the boundaries of the box.
 
 \cgalRefines{Assignable}
 
-\cgalHasModel CGAL::Box_intersection_d::Box_d
-\cgalHasModel CGAL::Box_intersection_d::Box_with_handle_d
+\cgalHasModelsBegin CGAL::Box_intersection_d::Box_d
+\cgalHasModels CGAL::Box_intersection_d::Box_with_handle_d
+\cgalHasModelsEnd
 
 \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
 \sa \link PkgBoxIntersectionD_box_self_intersection_d `CGAL::box_self_intersection_d()` \endlink
diff --git a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h
index 03300e29d644..cf6dfcb546dc 100644
--- a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h
@@ -9,7 +9,8 @@ the boxes manipulated in these algorithms.
 
 \cgalRefines{Assignable,DefaultConstructible}
 
-\cgalHasModel CGAL::Box_intersection_d::Box_traits_d
+\cgalHasModelsBegin CGAL::Box_intersection_d::Box_traits_d
+\cgalHasModelsEnd
 
 \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
 \sa \link PkgBoxIntersectionD_box_self_intersection_d `CGAL::box_self_intersection_d()` \endlink
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h
index 322134ed592a..f5a18c372206 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h
@@ -11,7 +11,8 @@ are of a type that is a model of the concept
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel CGAL::Polynomial_for_circles_2_2
+\cgalHasModelsBegin CGAL::Polynomial_for_circles_2_2
+\cgalHasModelsEnd
 
 \sa `AlgebraicKernelForCircles`
 
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h
index a017fef71637..b01eedc5a49c 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h
@@ -9,7 +9,8 @@ coefficients are of a type that is a model of the concept
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel CGAL::Polynomial_1_2
+\cgalHasModelsBegin CGAL::Polynomial_1_2
+\cgalHasModelsEnd
 
 \sa `AlgebraicKernelForCircles`
 
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h
index 075d69941f9b..d17715759643 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h
@@ -7,7 +7,8 @@ Concept to represent the roots of a system of two equations of degree 2
 in two variables `x` and `y` that are models of concept
 `AlgebraicKernelForCircles::PolynomialForCircles_2_2`
 
-\cgalHasModel CGAL::Root_for_circles_2_2
+\cgalHasModelsBegin CGAL::Root_for_circles_2_2
+\cgalHasModelsEnd
 
 \sa `AlgebraicKernelForCircles`
 
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h
index 79dbf30fe5ad..e0d50ab1b572 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h
@@ -7,7 +7,8 @@ The `AlgebraicKernelForCircles` concept is meant to provide the
 curved kernel with all the algebraic functionalities required for the
 manipulation of circular arcs.
 
-\cgalHasModel `CGAL::Algebraic_kernel_for_circles_2_2`
+\cgalHasModelsBegin CGAL::Algebraic_kernel_for_circles_2_2
+\cgalHasModelsEnd
 
 \sa `CircularKernel`
 \sa `CGAL::Circular_kernel_2<Kernel,AlgebraicKernelForCircles>`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h
index add345ad6ff8..603867502f9f 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h
@@ -7,7 +7,8 @@ Concept for points on circles, circular arcs or line arcs.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Circular_arc_point_2<CircularKernel>`
+\cgalHasModelsBegin CGAL::Circular_arc_point_2<CircularKernel>
+\cgalHasModelsEnd
 */
 class CircularKernel::CircularArcPoint_2 {
 public:
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h
index 34f8cef50e2e..bd5586d0035c 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h
@@ -7,7 +7,8 @@ Concept for arcs of circles.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Circular_arc_2<CircularKernel>`
+\cgalHasModelsBegin CGAL::Circular_arc_2<CircularKernel>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h
index 0400dd4bade1..7f82890c16ae 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h
@@ -9,7 +9,8 @@ Concept for line segments supported by a line that is a model of
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Line_arc_2<CircularKernel>`
+\cgalHasModelsBegin CGAL::Line_arc_2<CircularKernel>
+\cgalHasModelsEnd
 
 */
 class CircularKernel::LineArc_2 {
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h
index 681d46d96790..a151ed891918 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h
@@ -5,8 +5,9 @@
 
 \cgalRefines{Kernel}
 
-\cgalHasModel `CGAL::Circular_kernel_2<Kernel,AlgebraicKernelForCircles>`
-\cgalHasModel `CGAL::Exact_circular_kernel_2`
+\cgalHasModelsBegin CGAL::Circular_kernel_2<Kernel,AlgebraicKernelForCircles>
+\cgalHasModels CGAL::Exact_circular_kernel_2
+\cgalHasModelsEnd
 
 \sa `Kernel`
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h
index 54db59349fc0..0dbd299b9cd7 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h
@@ -11,7 +11,8 @@ are of a type that is a model of the concept
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel CGAL::Polynomial_for_spheres_2_3
+\cgalHasModelsBegin GAL::Polynomial_for_spheres_2_
+\cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h
index 023c13ebc201..8cf947c04bae 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h
@@ -9,7 +9,8 @@ coefficients are of a type that is a model of the concept
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel CGAL::Polynomial_1_3
+\cgalHasModelsBegin CGAL::Polynomial_1_3
+\cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h
index df2b2ee627bd..70866c01e37d 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h
@@ -8,7 +8,8 @@ capable of storing equations of lines.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel CGAL::Polynomials_for_lines_3
+\cgalHasModelsBegin CGAL::Polynomials_for_lines_3
+\cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h
index 61ac0d14a8ba..2754b94e0913 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h
@@ -7,7 +7,8 @@ Concept to represent the roots of a system of three equations of degree 2
 in three variables `x`, `y` and `z` that are models of concept
 `AlgebraicKernelForSpheres::PolynomialForSpheres_2_3`.
 
-\cgalHasModel CGAL::Root_for_spheres_2_3
+\cgalHasModelsBegin CGAL::Root_for_spheres_2_3
+\cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h
index 58ab8c24ff07..e83eca8300dd 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h
@@ -7,7 +7,8 @@ The `AlgebraicKernelForSpheres` concept is meant to provide the
 curved kernel with all the algebraic functionalities required for the
 manipulation of spheres, circles, and circular arcs in 3D.
 
-\cgalHasModel CGAL::Algebraic_kernel_for_spheres_2_3
+\cgalHasModelsBegin CGAL::Algebraic_kernel_for_spheres_2_3
+\cgalHasModelsEnd
 
 \sa `SphericalKernel`
 \sa `CGAL::Spherical_kernel_3<Kernel,AlgebraicKernelForSpheres>`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h
index 4a4494bc216e..81128f2844ee 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h
@@ -7,7 +7,8 @@ Concept for points on spheres, circles, circular arcs or line arcs.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Circular_arc_point_3<SphericalKernel>`
+\cgalHasModelsBegin CGAL::Circular_arc_point_3<SphericalKernel>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h
index ffefeb6aefb9..5a8498f28243 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h
@@ -7,7 +7,8 @@ Concept for arcs of circles.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Circular_arc_3<SphericalKernel>`
+\cgalHasModelsBegin CGAL::Circular_arc_3<SphericalKernel>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h
index 5ea1f9aed8ed..07946ba0f146 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h
@@ -9,7 +9,8 @@ Concept for line segments supported by a line that is a model of
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Line_arc_3<SphericalKernel>`
+\cgalHasModelsBegin CGAL::Line_arc_3<SphericalKernel>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h
index 950115d7c73e..3bafc8659d0b 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h
@@ -5,8 +5,9 @@
 
 \cgalRefines{Kernel}
 
-\cgalHasModel `CGAL::Spherical_kernel_3<Kernel,AlgebraicKernelForSpheres>`
-\cgalHasModel CGAL::Exact_spherical_kernel_3
+\cgalHasModelsBegin CGAL::Spherical_kernel_3<Kernel,AlgebraicKernelForSpheres>
+\cgalHasModels CGAL::Exact_spherical_kernel_3
+\cgalHasModelsEnd
 
 \sa `Kernel`
 
diff --git a/Circulator/doc/Circulator/Concepts/ConstHandle.h b/Circulator/doc/Circulator/Concepts/ConstHandle.h
index 3552dc5cb29d..9ff3bea6b33d 100644
--- a/Circulator/doc/Circulator/Concepts/ConstHandle.h
+++ b/Circulator/doc/Circulator/Concepts/ConstHandle.h
@@ -7,7 +7,8 @@ A constant handle. Refer to the `Handle` concept for more details.
 
 \cgalRefines{Descriptor}
 
-\cgalHasModel const T* (const pointers)
+\cgalHasModelsBegin const T* (const pointers)
+\cgalHasModelsEnd
 
 \sa `Handle`
 
diff --git a/Circulator/doc/Circulator/Concepts/ConstRange.h b/Circulator/doc/Circulator/Concepts/ConstRange.h
index b690c3d97d38..643dc47c83be 100644
--- a/Circulator/doc/Circulator/Concepts/ConstRange.h
+++ b/Circulator/doc/Circulator/Concepts/ConstRange.h
@@ -7,8 +7,7 @@ A constant iterator range. Refer to the `Range` concept for more details.
 
 \cgalRefinesBare{Boost's %Range concept}
 
-\cgalHasModel STL containers
-\cgalHasModel <A HREF="https://www.boost.org/libs/range/doc/html/range/reference/utilities/iterator_range.html">`boost::iterator_range`</A>
+\cgalHasModelsBare{STL containers,<A HREF="https://www.boost.org/libs/range/doc/html/range/reference/utilities/iterator_range.html">`boost::iterator_range`</A>}
 
 \sa `Range`
 
diff --git a/Circulator/doc/Circulator/Concepts/Handle.h b/Circulator/doc/Circulator/Concepts/Handle.h
index 748ab737efb7..a5fade1d46fa 100644
--- a/Circulator/doc/Circulator/Concepts/Handle.h
+++ b/Circulator/doc/Circulator/Concepts/Handle.h
@@ -23,10 +23,11 @@ operator is concerned (this serves the same purpose as NULL for pointers).
 (Note that this is not a generally supported feature of iterators of
 standard containers.)
 
-\cgalHasModel T* (pointer)
-\cgalHasModel const T* (const pointers)
-\cgalHasModel `Iterator`
-\cgalHasModel `Circulator`
+\cgalHasModelsBegin T* (pointer)
+\cgalHasModels const T* (const pointers)
+\cgalHasModels Iterator
+\cgalHasModels Circulator
+\cgalHasModelsEnd
 */
 class Handle {
 public:
diff --git a/Circulator/doc/Circulator/Concepts/Range.h b/Circulator/doc/Circulator/Concepts/Range.h
index 2da31fa59408..ef6cfd56d58b 100644
--- a/Circulator/doc/Circulator/Concepts/Range.h
+++ b/Circulator/doc/Circulator/Concepts/Range.h
@@ -31,7 +31,7 @@ difference with iterators which are typically passed by value.
 
 \cgalRefinesBare{ConstRange,Boost's %Range concept}
 
-\cgalHasModel STL containers
+\cgalHasModelsBare{STL containers}
 
 */
 
diff --git a/Classification/doc/Classification/Concepts/Classifier.h b/Classification/doc/Classification/Concepts/Classifier.h
index ca1f3cefc97d..9a3505997949 100644
--- a/Classification/doc/Classification/Concepts/Classifier.h
+++ b/Classification/doc/Classification/Concepts/Classifier.h
@@ -12,9 +12,10 @@ Concept describing a classifier used by classification functions (see
 `CGAL::Classification::classify()`, `CGAL::Classification::classify_with_local_smoothing()` and
 `CGAL::Classification::classify_with_graphcut()`).
 
-\cgalHasModel `CGAL::Classification::Sum_of_weighted_features_classifier`
-\cgalHasModel `CGAL::Classification::ETHZ::Random_forest_classifier`
-\cgalHasModel `CGAL::Classification::OpenCV::Random_forest_classifier`
+\cgalHasModelsBegin CGAL::Classification::Sum_of_weighted_features_classifier
+\cgalHasModels CGAL::Classification::ETHZ::Random_forest_classifier
+\cgalHasModels CGAL::Classification::OpenCV::Random_forest_classifier
+\cgalHasModelsEnd
 
 */
 class Classifier
diff --git a/Classification/doc/Classification/Concepts/NeighborQuery.h b/Classification/doc/Classification/Concepts/NeighborQuery.h
index eeed7fa074cf..99aeb76cb2f6 100644
--- a/Classification/doc/Classification/Concepts/NeighborQuery.h
+++ b/Classification/doc/Classification/Concepts/NeighborQuery.h
@@ -10,10 +10,11 @@ namespace Classification
 
 Concept describing a neighbor query used for classification.
 
-\cgalHasModel `CGAL::Classification::Point_set_neighborhood::K_neighbor_query`
-\cgalHasModel `CGAL::Classification::Point_set_neighborhood::Sphere_neighbor_query`
-\cgalHasModel `CGAL::Classification::Mesh_neighborhood::One_ring_neighbor_query`
-\cgalHasModel `CGAL::Classification::Mesh_neighborhood::N_ring_neighbor_query`
+\cgalHasModelsBegin CGAL::Classification::Point_set_neighborhood::K_neighbor_query
+\cgalHasModels CGAL::Classification::Point_set_neighborhood::Sphere_neighbor_query
+\cgalHasModels CGAL::Classification::Mesh_neighborhood::One_ring_neighbor_query
+\cgalHasModels CGAL::Classification::Mesh_neighborhood::N_ring_neighbor_query
+\cgalHasModelsEnd
 
 */
 class NeighborQuery
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h
index cce3235390e6..ad331c7bc22b 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h
@@ -5,7 +5,7 @@
 
 The concept `CellAttribute` represents a non void attribute associated with a cell of a generic map. It can keep a descriptor to one dart of its associated cell, and can contain any information.
 
-\cgalHasModel \link CGAL::Cell_attribute `CGAL::Cell_attribute<Map,Info_,Tag,OnMerge,OnSplit>`\endlink
+\cgalHasModelsBare{\link CGAL::Cell_attribute `CGAL::Cell_attribute<Map,Info_,Tag,OnMerge,OnSplit>`\endlink}
 
 \sa `GenericMap`
 \sa `GenericMapItems`
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
index 03f492d1b081..ecf28bda596e 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
@@ -6,7 +6,7 @@ The concept `CombinatorialMap` defines a <I>d</I>-dimensional combinatorial map.
 
 \cgalRefines{GenericMap}
 
-\cgalHasModel \link CGAL::Combinatorial_map `CGAL::Combinatorial_map<d,Items,Alloc>`\endlink
+\cgalHasModelsBare{\link CGAL::Combinatorial_map `CGAL::Combinatorial_map<d,Items,Alloc>`\endlink}
 
 For a combinatorial map, the function \link GenericMap::next `next`\endlink is equal to \f$ \beta_1\f$, \link GenericMap::previous `previous`\endlink is equal to \f$ \beta_0\f$  and the function \link GenericMap::opposite `opposite<i>`\endlink is equal to \f$ \beta_i\f$.
 */
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
index ae828e3cdf0d..87113f9aa211 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
@@ -8,8 +8,8 @@ The concept `GenericMap` defines a <I>d</I>-dimensional generic map. This concep
 
 A generic map has a set of darts <I>D</I>, and functions \f$ f_0\f$,\f$ \ldots\f$,\f$ f_{d}\f$ that link these darts between them.
 
-\cgalHasModel \link CGAL::Combinatorial_map `CGAL::Combinatorial_map<d,Items,Alloc>`\endlink
-\cgalHasModel \link CGAL::Generalized_map `CGAL::Generalized_map<d,Items,Alloc>`\endlink
+\cgalHasModelsBare{\link CGAL::Combinatorial_map `CGAL::Combinatorial_map<d,Items,Alloc>`\endlink\n
+                   \link CGAL::Generalized_map `CGAL::Generalized_map<d,Items,Alloc>`\endlink}
 
 \sa `CombinatorialMap`
 \sa `GeneralizedMap`
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h
index afd744baab42..6fd24033a72b 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h
@@ -4,7 +4,7 @@
 
 The concept `GenericMapItems` allows to customize a <I>d</I>D generic map by choosing the information associated with darts, by enabling and disabling some attributes, and by choosing to use indices or handles. For that, it defines an inner class template named \link GenericMapItems::Dart_wrapper `Dart_wrapper`\endlink, with one template parameter, `Map`, a model of the `GenericMap` concept. This inner class can define the two types `%Dart_info` and `%Attributes`.
 
-\cgalHasModel \link CGAL::Generic_map_min_items `CGAL::Generic_map_min_items`\endlink
+\cgalHasModelsBare{\link CGAL::Generic_map_min_items `CGAL::Generic_map_min_items`\endlink}
 
 \sa `GenericMap`
 
diff --git a/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h b/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h
index 0bff4725d604..251e12f7fb91 100644
--- a/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h
+++ b/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h
@@ -9,12 +9,13 @@ primitives (objects and predicates) that the convex hull algorithms use.
 functions. The specific subset of these primitives required by each function
 is specified with each function.
 
-\cgalHasModel `CGAL::Convex_hull_constructive_traits_2<R>`
-\cgalHasModel `CGAL::Convex_hull_traits_2<R>`
-\cgalHasModel `CGAL::Convex_hull_traits_adapter_2<R>`
-\cgalHasModel `CGAL::Projection_traits_xy_3<K>`
-\cgalHasModel `CGAL::Projection_traits_yz_3<K>`
-\cgalHasModel `CGAL::Projection_traits_xz_3<K>`
+\cgalHasModelsBegin CGAL::Convex_hull_constructive_traits_2<R>
+\cgalHasModels CGAL::Convex_hull_traits_2<R>
+\cgalHasModels CGAL::Convex_hull_traits_adapter_2<R>
+\cgalHasModels CGAL::Projection_traits_xy_3<K>
+\cgalHasModels CGAL::Projection_traits_yz_3<K>
+\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h b/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h
index 7efcfcb9e93a..711efc4d8aa4 100644
--- a/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h
+++ b/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h
@@ -4,8 +4,9 @@
 
 Requirements of the traits class of the function `CGAL::convex_hull_3()`.
 
-\cgalHasModel `CGAL::Convex_hull_traits_3<K>`
-\cgalHasModel `CGAL::Extreme_points_traits_adapter_3<PPM, GT>`
+\cgalHasModelsBegin CGAL::Convex_hull_traits_3<K>
+\cgalHasModels CGAL::Extreme_points_traits_adapter_3<PPM, GT>
+\cgalHasModelsEnd
 
 */
 class ConvexHullTraits_3 {
diff --git a/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h b/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h
index d69567d6102a..6f3bad1286ed 100644
--- a/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h
+++ b/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h
@@ -6,8 +6,8 @@ Requirements of the traits class used by the function
 `CGAL::is_strongly_convex_3()`, which is used for postcondition checking
 by `CGAL::convex_hull_3()`.
 
-\cgalHasModel `CGAL::Convex_hull_traits_3<R>`
-\cgalHasModel All models of `Kernel`
+\cgalHasModelsBareBegin{All models of `Kernel`} CGAL::Convex_hull_traits_3<R>
+\cgalHasModelsEnd
 
 \sa `ConvexHullTraits_3`
 \sa `CGAL::is_strongly_convex_3()`
diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h
index abd9c2928ec7..78e06df722d3 100644
--- a/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h
+++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h
@@ -7,9 +7,10 @@
 Requirements of the traits class to be used with the
 class `CGAL::Convex_hull_d`.
 
-\cgalHasModel `CGAL::Cartesian_d<FT,LA>`
-\cgalHasModel `CGAL::Homogeneous_d<RT,LA>`
-\cgalHasModel `CGAL::Convex_hull_d_traits_3<R>`
+\cgalHasModelsBegin CGAL::Cartesian_d<FT,LA>
+\cgalHasModels CGAL::Homogeneous_d<RT,LA>
+\cgalHasModels CGAL::Convex_hull_d_traits_3<R>
+\cgalHasModelsEnd
 
 */
 class ConvexHullTraits_d {
diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h
index e798f331db49..23352fbe2e6e 100644
--- a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h
+++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h
@@ -7,8 +7,9 @@
 Requirements of the second traits class to be used with the
 class `CGAL::Delaunay_d`.
 
-\cgalHasModel `CGAL::Cartesian_d<FT,LA>`
-\cgalHasModel `CGAL::Homogeneous_d<RT,LA>`
+\cgalHasModelsBegin CGAL::Cartesian_d<FT,LA>
+\cgalHasModels CGAL::Homogeneous_d<RT,LA>
+\cgalHasModelsEnd
 
 */
 class DelaunayLiftedTraits_d {
diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h
index f2465c575fe5..b8e91a96aa9a 100644
--- a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h
+++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h
@@ -7,8 +7,9 @@
 Requirements of the first traits class to be used with the
 class `CGAL::Delaunay_d`.
 
-\cgalHasModel `CGAL::Cartesian_d<FT,LA>`
-\cgalHasModel `CGAL::Homogeneous_d<RT,LA>`
+\cgalHasModelsBegin CGAL::Cartesian_d<FT,LA>
+\cgalHasModels CGAL::Homogeneous_d<RT,LA>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index 7486ae587d78..97f12d55731a 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -136,18 +136,19 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalRefinesBare{1}=<dl><dt>@cgalRefines</dt><dd>\1</dd></dl>" \
                          "cgalRefinesBare{2}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" \
-                         "cgalModelsHeader=Is Model Of" \
+                         "cgalModelsHeader=Is model of" \
                          "cgalModels{1}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd></dl>" \
                          "cgalModels{2}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd></dl>" \
                          "cgalModelsBare{1}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd></dl>" \
-                         "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>\2</dd></dl>" \
+                         "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \
-                         "cgalHasModel=\xrefitem hasModels \"Has Models\" \"Has Model Relationships\"" \
-                         "cgalHasModelsHeader=Has Models" \
+                         "cgalHasModelsHeader=Has models" \
                          "cgalHasModelsBegin=<dl><dt>@cgalHasModelsHeader</dt><dd>`" \
                          "cgalHasModels=`</dd><dt></dt><dd>`" \
                          "cgalHasModelsEnd=`</dd></dl>" \
-                         "cgalHasModelsBare{1}=<dl><dt>@cgalHasModels</dt><dd>\1</dd></dl>" \
+                         "cgalHasModelsBare{1}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd></dl>" \
+                         "cgalHasModelsBare{2}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
+                         "cgalHasModelsBareBegin{1}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd><dt></dt><dd>`" \
                          "cgalDebugBegin=\htmlonly <div class=\"CGALDebug\"> <div>Debugging Support</div> \endhtmlonly \n" \
                          "cgalDebugEnd=\htmlonly </div> \endhtmlonly" \
                          "cgalDebugFunction=This is a function for debugging purpose." \
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index 3813f3748daf..3a25e3c92bef 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -145,18 +145,19 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalRefinesBare{1}=<dl><dt>@cgalRefines</dt><dd>\1</dd></dl>" \
                          "cgalRefinesBare{2}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" \
-                         "cgalModelsHeader=Is Model Of" \
+                         "cgalModelsHeader=Is model of" \
                          "cgalModels{1}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd></dl>" \
                          "cgalModels{2}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd></dl>" \
                          "cgalModelsBare{1}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd></dl>" \
-                         "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>\2</dd></dl>" \
+                         "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \
-                         "cgalHasModel=\xrefitem hasModels \"Has Models\" \"Has Model Relationships\"" \
-                         "cgalHasModelsHeader=Has Models" \
+                         "cgalHasModelsHeader=Has models" \
                          "cgalHasModelsBegin=<dl><dt>@cgalHasModelsHeader</dt><dd>`" \
                          "cgalHasModels=`</dd><dt></dt><dd>`" \
                          "cgalHasModelsEnd=`</dd></dl>" \
                          "cgalHasModelsBare{1}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd></dl>" \
+                         "cgalHasModelsBare{2}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
+                         "cgalHasModelsBareBegin{1}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd><dt></dt><dd>`" \
                          "cgalDebugBegin=\htmlonly[block] <div class=\"CGALDebug\"> <div>Debugging Support</div> \endhtmlonly ^^" \
                          "cgalDebugEnd=\htmlonly[block] </div> \endhtmlonly" \
                          "cgalDebugFunction=This is a function for debugging purpose." \
diff --git a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
index 47b1f7290356..66b3c1f34772 100644
--- a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
+++ b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
@@ -16,10 +16,11 @@ Note however, that these operations usually involve the projection of
 
 \cgalRefines{ArrangementXMonotoneTraits_2}
 
-\cgalHasModel `CGAL::Env_triangle_traits_3<Kernel>`
-\cgalHasModel `CGAL::Env_sphere_traits_3<ConicTraits>`
-\cgalHasModel `CGAL::Env_plane_traits_3<Kernel>`
-\cgalHasModel `CGAL::Env_surface_data_traits_3<Traits,XyData,SData,Cnv>`
+\cgalHasModelsBegin CGAL::Env_triangle_traits_3<Kernel>
+\cgalHasModels CGAL::Env_sphere_traits_3<ConicTraits>
+\cgalHasModels CGAL::Env_plane_traits_3<Kernel>
+\cgalHasModels CGAL::Env_surface_data_traits_3<Traits,XyData,SData,Cnv>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h b/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h
index 91c430a9d914..f43d4b8944dd 100644
--- a/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h
+++ b/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h
@@ -6,7 +6,7 @@ The concept `GeneralizedMap` defines a <I>d</I>-dimensional generalized map.
 
 \cgalRefines{GenericMap}
 
-\cgalHasModel \link CGAL::Generalized_map `CGAL::Generalized_map<d,Items,Alloc>`\endlink
+\cgalHasModelsBare{\link CGAL::Generalized_map `CGAL::Generalized_map<d,Items,Alloc>`\endlink}
 
 For a generalized map, the function \link GenericMap::next `next`\endlink is equal to \f$ \alpha_1\circ\alpha_0\f$, \link GenericMap::previous `previous`\endlink is equal to \f$ \alpha_0\circ\alpha_1\f$  and the function \link GenericMap::opposite `opposite<i>`\endlink is equal to \f$ \alpha_i\circ\alpha_0\f$.
 */
diff --git a/Generator/doc/Generator/Concepts/CombinationElement.h b/Generator/doc/Generator/Concepts/CombinationElement.h
index fc9712bb25c2..8e4747e08392 100644
--- a/Generator/doc/Generator/Concepts/CombinationElement.h
+++ b/Generator/doc/Generator/Concepts/CombinationElement.h
@@ -4,9 +4,9 @@
 A CombinationElement can be used as template parameter for the class
 `Combination_enumerator<CombinationElement>`.
 
-\cgalHasModel Any integer type (`char`, `short`, `int`, `long`, etc.)
-\cgalHasModel Pointers
-\cgalHasModel Random access iterators
+\cgalHasModelsBare{Any integer type (`char`, `short`, `int`, `long`, etc.)\n
+              Pointers\n
+              Random access iterators}
 
 \sa `CGAL::Combination_enumerator<CombinationElement>`
 
diff --git a/Generator/doc/Generator/Concepts/PointGenerator.h b/Generator/doc/Generator/Concepts/PointGenerator.h
index a17946b0cd6e..2f96e53167d9 100644
--- a/Generator/doc/Generator/Concepts/PointGenerator.h
+++ b/Generator/doc/Generator/Concepts/PointGenerator.h
@@ -5,20 +5,21 @@
 The concept `PointGenerator` defines the requirements for a point generator,
 which can be used in places where input iterators are called for.
 
-\cgalHasModel `CGAL::Random_points_in_ball_d<Point_d,>`
-\cgalHasModel `CGAL::Random_points_in_disc_2<Point_2, Creator>`
-\cgalHasModel `CGAL::Random_points_in_square_2<Point_2, Creator>`
-\cgalHasModel `CGAL::Random_points_in_triangle_2<Point_2, Creator>`
-\cgalHasModel `CGAL::Random_points_on_circle_2<Point_2, Creator>`
-\cgalHasModel `CGAL::Random_points_on_segment_2<Point_2, Creator>`
-\cgalHasModel `CGAL::Random_points_on_square_2<Point_2, Creator>`
-\cgalHasModel `CGAL::Random_points_in_cube_3<Point_3, Creator>`
-\cgalHasModel `CGAL::Random_points_in_cube_d<Point_d>`
-\cgalHasModel `CGAL::Random_points_in_sphere_3<Point_3, Creator>`
-\cgalHasModel `CGAL::Random_points_in_triangle_3<Point_3, Creator>`
-\cgalHasModel `CGAL::Random_points_in_tetrahedron_3<Point_3, Creator>`
-\cgalHasModel `CGAL::Random_points_on_sphere_3<Point_3, Creator>`
-\cgalHasModel `CGAL::Random_points_on_sphere_d<Point_d>`
+\cgalHasModelsBegin CGAL::Random_points_in_ball_d<Point_d,>
+\cgalHasModels CGAL::Random_points_in_disc_2<Point_2, Creator>
+\cgalHasModels CGAL::Random_points_in_square_2<Point_2, Creator>
+\cgalHasModels CGAL::Random_points_in_triangle_2<Point_2, Creator>
+\cgalHasModels CGAL::Random_points_on_circle_2<Point_2, Creator>
+\cgalHasModels CGAL::Random_points_on_segment_2<Point_2, Creator>
+\cgalHasModels CGAL::Random_points_on_square_2<Point_2, Creator>
+\cgalHasModels CGAL::Random_points_in_cube_3<Point_3, Creator>
+\cgalHasModels CGAL::Random_points_in_cube_d<Point_d>
+\cgalHasModels CGAL::Random_points_in_sphere_3<Point_3, Creator>
+\cgalHasModels CGAL::Random_points_in_triangle_3<Point_3, Creator>
+\cgalHasModels CGAL::Random_points_in_tetrahedron_3<Point_3, Creator>
+\cgalHasModels CGAL::Random_points_on_sphere_3<Point_3, Creator>
+\cgalHasModels CGAL::Random_points_on_sphere_d<Point_d>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h b/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h
index 3dbf4632cb9e..424119d49b9b 100644
--- a/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h
+++ b/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h
@@ -5,7 +5,7 @@
 The concept `RandomConvexHullTraits_2` describes the requirements for the traits
 class used by the function `random_convex_hull_in_disc_2()`.
 
-\cgalHasModel \cgal kernels.
+\cgalHasModelsBare{All models of the concept `Kernel`}
 
 \cgalHeading{Operations}
 
diff --git a/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h b/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h
index f796452dbeb8..630b93345d17 100644
--- a/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h
+++ b/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h
@@ -5,7 +5,8 @@
 The concept `RandomConvexSetTraits_2` describes the requirements of the traits
 class for the function `random_convex_set_2()`.
 
-\cgalHasModel `CGAL::Random_convex_set_traits_2<Kernel>`
+\cgalHasModelsBegin CGAL::Random_convex_set_traits_2<Kernel>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h b/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h
index c0c512b6296b..be8badeb6410 100644
--- a/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h
+++ b/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h
@@ -5,7 +5,7 @@
 The concept `RandomPolygonTraits_2` describes the requirements for the traits
 class used by the function `random_polygon_2()`.
 
-\cgalHasModel \cgal kernels.
+\cgalHasModelsBare{All models of the concept `Kernel`}
 
 \cgalHeading{Operations}
 
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
index 8fcb7edd26e9..227ae11cc406 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
@@ -67,9 +67,10 @@ allocators internally. A default argument is mandatory for
 from the `<CGAL/memory.h>` header file can be used as default
 allocator.
 
-\cgalHasModel CGAL::HalfedgeDS_default
-\cgalHasModel CGAL::HalfedgeDS_list
-\cgalHasModel CGAL::HalfedgeDS_vector
+\cgalHasModelsBegin CGAL::HalfedgeDS_default
+\cgalHasModels CGAL::HalfedgeDS_list
+\cgalHasModels CGAL::HalfedgeDS_vector
+\cgalHasModelsEnd
 
 \sa `HalfedgeDSItems`
 \sa `CGAL::Polyhedron_3<Traits>`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h
index 5a405bb77708..cacaac7459aa 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h
@@ -23,8 +23,9 @@ can be bypassed by the user, but not by accident.)
 
 \cgalRefines{CopyConstructible,DefaultConstructible}
 
-\cgalHasModel `CGAL::HalfedgeDS_face_base<Refs>`
-\cgalHasModel `CGAL::HalfedgeDS_face_min_base<Refs>`
+\cgalHasModelsBegin CGAL::HalfedgeDS_face_base<Refs>
+\cgalHasModels CGAL::HalfedgeDS_face_min_base<Refs>
+\cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h
index f4d3652e4e24..5dae57935e8d 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h
@@ -33,8 +33,9 @@ more protection is provided for the `set_opposite()` member
 function. The base class `Base_base` provides access to it. (The
 protection could be bypassed also by an user, but not by accident.)
 
-\cgalHasModel ::CGAL::HalfedgeDS_halfedge_base
-\cgalHasModel ::CGAL::HalfedgeDS_halfedge_min_base
+\cgalHasModelsBegin ::CGAL::HalfedgeDS_halfedge_base
+\cgalHasModels ::CGAL::HalfedgeDS_halfedge_min_base
+\cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h
index 16d45020f90e..51a99908bc04 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h
@@ -16,9 +16,10 @@ and `Face` respectively. The requirements on these
 types are described on the manual pages of the concepts `HalfedgeDSVertex`,
 `HalfedgeDSHalfedge`, and `HalfedgeDSFace` respectively.
 
-\cgalHasModel CGAL::HalfedgeDS_min_items
-\cgalHasModel CGAL::HalfedgeDS_items_2
-\cgalHasModel CGAL::Polyhedron_items_3
+\cgalHasModelsBegin CGAL::HalfedgeDS_min_items
+\cgalHasModels CGAL::HalfedgeDS_items_2
+\cgalHasModels CGAL::Polyhedron_items_3
+\cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSVertex`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h
index 172b6b933f1e..38f5afab43c4 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h
@@ -23,8 +23,9 @@ could be bypassed by an user, but not by accident.)
 
 \cgalRefines{CopyConstructible,DefaultConstructible}
 
-\cgalHasModel `CGAL::HalfedgeDS_vertex_base<Refs>`
-\cgalHasModel `CGAL::HalfedgeDS_vertex_min_base<Refs>`
+\cgalHasModelsBegin CGAL::HalfedgeDS_vertex_base<Refs>
+\cgalHasModels CGAL::HalfedgeDS_vertex_min_base<Refs>
+\cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h b/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h
index c7f879712253..cf4b6f8d9d70 100644
--- a/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h
+++ b/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h
@@ -7,7 +7,7 @@ The concept `HeatMethodTraits_3` describes the types,
 predicates, and constructions required by the traits class parameter of
 `CGAL::Heat_method_3::Surface_mesh_geodesic_distances_3`.
 
-\cgalHasModel All the \cgal kernels
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 
 
 */
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
index 5d2d5a39e3e7..3299b6f89e3b 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
@@ -16,8 +16,9 @@ constructions on these objects.
 This concept refines `DelaunayTriangulationTraits_2` because the class `CGAL::Hyperbolic_Delaunay_triangulation_2`
 internally relies on the class `CGAL::Delaunay_triangulation_2`.
 
-\cgalHasModel `CGAL::Hyperbolic_Delaunay_triangulation_traits_2`
-\cgalHasModel `CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2`
+\cgalHasModelsBegin CGAL::Hyperbolic_Delaunay_triangulation_traits_2
+\cgalHasModels CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2
+\cgalHasModelsEnd
 */
 
 
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h
index 368630cc55be..9f57d33da117 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h
@@ -41,7 +41,8 @@ This concept provides an interface for the functionality needed in faces to comp
 Delaunay triangulations in the hyperbolic plane. The function `tds_data()` is used
 internally by the triangulation class during the insertion of points in the triangulation.
 
-\cgalHasModel `CGAL::Hyperbolic_triangulation_face_base_2`
+\cgalHasModelsBegin CGAL::Hyperbolic_triangulation_face_base_2
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
 \sa `HyperbolicFaceData`
diff --git a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h
index baa5e8e86b7b..f6de632e04c0 100644
--- a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h
+++ b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h
@@ -15,8 +15,9 @@ inscribed into a given convex polygon.
 precondition checking only. Therefore, they need not to be
 specified, in case that precondition checking is disabled.
 
-\cgalHasModel `CGAL::Extremal_polygon_area_traits_2<K>`
-\cgalHasModel `CGAL::Extremal_polygon_perimeter_traits_2<K>`
+\cgalHasModelsBegin CGAL::Extremal_polygon_area_traits_2<K>
+\cgalHasModels CGAL::Extremal_polygon_perimeter_traits_2<K>
+\cgalHasModelsEnd
 
 \sa `CGAL::maximum_area_inscribed_k_gon_2()`
 \sa `CGAL::maximum_perimeter_inscribed_k_gon_2()`
diff --git a/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h b/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h
index 2875e0a1abaa..d3e1374d7715 100644
--- a/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h
+++ b/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h
@@ -10,8 +10,9 @@ This concept provides the types of the geometric primitives used in
 this class and some function object types for the required
 predicates on those primitives.
 
-\cgalHasModel `CGAL::Cartesian`
-\cgalHasModel `CGAL::Homogeneous`
+\cgalHasModelsBegin CGAL::Cartesian
+\cgalHasModels CGAL::Homogeneous
+\cgalHasModelsEnd
 
 \sa `CGAL::Largest_empty_iso_rectangle_2<Traits>`
 
diff --git a/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h b/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h
index 8ce13fd4e1db..4cb824c031b1 100644
--- a/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h
+++ b/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h
@@ -7,7 +7,8 @@
 traits class that defines the primitives used by the algorithm. The
 concept `GradientFittingTraits` defines this common set of requirements.
 
-\cgalHasModel `CGAL::Interpolation_gradient_fitting_traits_2<K>`
+\cgalHasModelsBegin CGAL::Interpolation_gradient_fitting_traits_2<K>
+\cgalHasModelsEnd
 
 \sa `InterpolationTraits`
 \sa `CGAL::Interpolation_traits_2<K>`
diff --git a/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h b/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h
index 03be7b11a8dc..a07eb526d3c7 100644
--- a/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h
+++ b/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h
@@ -7,8 +7,9 @@ Most interpolation functions are parameterized by a traits class that
 defines the primitives used in the interpolation algorithms. The concept
 `InterpolationTraits` defines this common set of requirements.
 
-\cgalHasModel `CGAL::Interpolation_traits_2<K>`
-\cgalHasModel `CGAL::Interpolation_gradient_fitting_traits_2<K>`
+\cgalHasModelsBegin CGAL::Interpolation_traits_2<K>
+\cgalHasModels CGAL::Interpolation_gradient_fitting_traits_2<K>
+\cgalHasModelsEnd
 
 \sa `GradientFittingTraits`
 \sa `CGAL::sibson_c1_interpolation()`
diff --git a/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h b/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h
index 254de6b64cd7..1bc267a684eb 100644
--- a/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h
+++ b/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h
@@ -9,8 +9,9 @@ The concept does not specify, whether the interval is open or
 closed. It is up to the implementer of a model for this concept
 to define that.
 
-\cgalHasModel `CGAL::Interval_skip_list_interval<Value>`
-\cgalHasModel `CGAL::Level_interval`
+\cgalHasModelsBegin CGAL::Interval_skip_list_interval<Value>
+\cgalHasModels CGAL::Level_interval
+\cgalHasModelsEnd
 
 \sa `Interval_skip_list`
 
diff --git a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h
index 041a8eb9feb7..9276d91c6b32 100644
--- a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h
+++ b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h
@@ -13,8 +13,9 @@ the class
 Only constructors (from 3 scalars and copy constructors) and access
 methods to coordinates `x()`, `y()`, `z()` are needed.
 
-\cgalHasModel `CGAL::Cartesian<FieldNumberType>`
-\cgalHasModel `CGAL::Simple_cartesian<FieldNumberType>`
+\cgalHasModelsBegin CGAL::Cartesian<FieldNumberType>
+\cgalHasModels CGAL::Simple_cartesian<FieldNumberType>
+\cgalHasModelsEnd
 
 \sa `LocalKernel`
 
diff --git a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h
index ba13fc2daadf..75629fb37f15 100644
--- a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h
+++ b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h
@@ -29,8 +29,9 @@ Only constructors (from 3 scalars and copy constructors) and access
 methods to coordinates `x()`, `y()`, `z()` are needed for the point and
 vector types.
 
-\cgalHasModel `CGAL::Cartesian<FieldNumberType>`
-\cgalHasModel `CGAL::Simple_cartesian<FieldNumberType>`
+\cgalHasModelsBegin CGAL::Cartesian<FieldNumberType>
+\cgalHasModels CGAL::Simple_cartesian<FieldNumberType>
+\cgalHasModelsEnd
 
 \sa `DataKernel`
 \sa `SvdTraits`
diff --git a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h
index d7fa271e5600..a732c7891a3c 100644
--- a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h
+++ b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h
@@ -8,7 +8,8 @@ namespace Kernel {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Circle_2<Kernel>`
+  \cgalHasModelsBegin CGAL::Circle_2<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_2`
   \sa `Kernel::ComputeSquaredRadius_2`
@@ -38,7 +39,8 @@ class Circle_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Circle_3<Kernel>`
+  \cgalHasModelsBegin CGAL::Circle_3<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::ComputeApproximateArea_3`
   \sa `Kernel::ComputeApproximateSquaredLength_3`
@@ -67,7 +69,8 @@ class Circle_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Direction_2<Kernel>`
+  \cgalHasModels CGAL::Direction_2<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::CompareAngleWithXAxis_2`
   \sa `Kernel::ComputeDx_2`
@@ -91,7 +94,8 @@ class Direction_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Direction_3<Kernel>`
+  \cgalHasModels CGAL::Direction_3<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::ConstructDirection_3`
   \sa `Kernel::ConstructOppositeDirection_3`
@@ -111,7 +115,8 @@ A type representing isocuboids in three dimensions.
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Iso_cuboid_3<Kernel>`
+\cgalHasModelsBegin CGAL::Iso_cuboid_3<Kernel>
+\cgalHasModelsEnd
 
 \sa `Kernel::BoundedSide_3`
 \sa `Kernel::ComputeVolume_3`
@@ -136,7 +141,8 @@ class IsoCuboid_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Iso_rectangle_2<Kernel>`
+  \cgalHasModels CGAL::Iso_rectangle_2<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::ConstructIsoRectangle_2`
   \sa `Kernel::ComputeXmin_2`
@@ -168,7 +174,8 @@ class IsoRectangle_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Line_2<Kernel>`
+  \cgalHasModels CGAL::Line_2<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::CompareXAtY_2`
   \sa `Kernel::ComputeSquaredDistance_2`
@@ -204,7 +211,8 @@ class Line_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Line_3<Kernel>`
+  \cgalHasModels CGAL::Line_3<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
   \sa `Kernel::ConstructDirection_3`
@@ -235,7 +243,8 @@ class Line_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Object`
+  \cgalHasModels CGAL::Object
+  \cgalHasModelsEnd
 
   \sa `Kernel::Assign_2`
   \sa `Kernel::ConstructObject_2`
@@ -256,7 +265,8 @@ class Object_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Object`
+  \cgalHasModels CGAL::Object
+  \cgalHasModelsEnd
 
   \sa `Kernel::Assign_3`
   \sa `Kernel::ConstructObject_3`
@@ -275,7 +285,8 @@ class Object_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Plane_3<Kernel>`
+  \cgalHasModels CGAL::Plane_3<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
   \sa `Kernel::ConstructBaseVector_3`
@@ -312,7 +323,8 @@ class Plane_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Point_2<Kernel>`
+  \cgalHasModels CGAL::Point_2<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::Angle_2`
   \sa `Kernel::AreOrderedAlongLine_2`
@@ -371,7 +383,8 @@ class Point_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Point_3<Kernel>`
+  \cgalHasModels CGAL::Point_3<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::Angle_3`
   \sa `Kernel::AreOrderedAlongLine_3`
@@ -432,7 +445,8 @@ A type representing rays in two dimensions.
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Ray_2<Kernel>`
+\cgalHasModelsBegin CGAL::Ray_2<Kernel>
+\cgalHasModelsEnd
 
 \sa `Kernel::CollinearHasOn_2`
 \sa `Kernel::ComputeSquaredDistance_2`
@@ -464,7 +478,8 @@ class Ray_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Ray_3<Kernel>`
+  \cgalHasModelsBegin CGAL::Ray_3<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
   \sa `Kernel::ConstructDirection_3`
@@ -492,7 +507,8 @@ class Ray_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Segment_2<Kernel>`
+  \cgalHasModelsBegin CGAL::Segment_2<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::CollinearHasOn_2`
   \sa `Kernel::ComputeSquaredDistance_2`
@@ -526,7 +542,8 @@ class Segment_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Segment_3<Kernel>`
+  \cgalHasModelsBegin CGAL::Segment_3<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
   \sa `Kernel::ComputeSquaredLength_3`
@@ -556,7 +573,8 @@ class Segment_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Sphere_3<Kernel>`
+  \cgalHasModelsBegin CGAL::Sphere_3<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_3`
   \sa `Kernel::ComputeSquaredRadius_3`
@@ -586,7 +604,8 @@ class Sphere_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Tetrahedron_3<Kernel>`
+  \cgalHasModelsBegin CGAL::Tetrahedron_3<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_3`
   \sa `Kernel::ComputeVolume_3`
@@ -617,7 +636,8 @@ class Tetrahedron_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Triangle_2<Kernel>`
+  \cgalHasModelsBegin CGAL::Triangle_2<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_2`
   \sa `Kernel::ComputeArea_2`
@@ -650,7 +670,8 @@ class Triangle_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Triangle_3<Kernel>`
+  \cgalHasModelsBegin CGAL::Triangle_3<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredArea_3`
   \sa `Kernel::ConstructCentroid_3`
@@ -675,7 +696,8 @@ class Triangle_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModel `CGAL::Vector_2<Kernel>`
+  \cgalHasModelsBegin CGAL::Vector_2<Kernel>
+  \cgalHasModelsEnd
 
   \sa `Kernel::ComputeDeterminant_2`
   \sa `Kernel::ComputeScalarProduct_2`
@@ -708,7 +730,8 @@ A type representing vectors in three dimensions.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Vector_3<Kernel>`
+\cgalHasModelsBegin CGAL::Vector_3<Kernel>
+\cgalHasModelsEnd
 
 \sa `Kernel::CompareDihedralAngle_3`
 \sa `Kernel::ComputeDeterminant_3`
@@ -744,7 +767,8 @@ A type representing weighted points in two dimensions.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Weighted_point_2<Kernel>`
+\cgalHasModelsBegin CGAL::Weighted_point_2<Kernel>
+\cgalHasModelsEnd
 
 \sa `Kernel::ConstructWeightedPoint_2`
 \sa `Kernel::ComputeWeight_2`
@@ -771,7 +795,8 @@ A type representing weighted points in three dimensions.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Weighted_point_3<Kernel>`
+\cgalHasModelsBegin CGAL::Weighted_point_3<Kernel>
+\cgalHasModelsEnd
 
 \sa `Kernel::ConstructWeightedPoint_3`
 \sa `Kernel::ComputeWeight_3`
diff --git a/Kernel_23/doc/Kernel_23/Concepts/Kernel.h b/Kernel_23/doc/Kernel_23/Concepts/Kernel.h
index 3ff7dcfc1336..ad4a0782765f 100644
--- a/Kernel_23/doc/Kernel_23/Concepts/Kernel.h
+++ b/Kernel_23/doc/Kernel_23/Concepts/Kernel.h
@@ -20,14 +20,15 @@
   `Construct_`. If the result type is a number type, the name is prefixed by `Compute_`.
   When the result type is not determined, no prefix is used.
 
-  \cgalHasModel `CGAL::Cartesian<FieldNumberType>`
-  \cgalHasModel `CGAL::Homogeneous<RingNumberType>`
-  \cgalHasModel `CGAL::Simple_cartesian<FieldNumberType>`
-  \cgalHasModel `CGAL::Simple_homogeneous<RingNumberType>`
-  \cgalHasModel `CGAL::Filtered_kernel<CK>`
-  \cgalHasModel `CGAL::Exact_predicates_exact_constructions_kernel`
-  \cgalHasModel `CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt`
-  \cgalHasModel `CGAL::Exact_predicates_inexact_constructions_kernel`
+  \cgalHasModelsBegin galHasModel `CGAL::Cartesian<FieldNumberType>
+  \cgalHasModels CGAL::Homogeneous<RingNumberType>
+  \cgalHasModels CGAL::Simple_cartesian<FieldNumberType>
+  \cgalHasModels CGAL::Simple_homogeneous<RingNumberType>
+  \cgalHasModels CGAL::Filtered_kernel<CK>
+  \cgalHasModels CGAL::Exact_predicates_exact_constructions_kernel
+  \cgalHasModels CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt
+  \cgalHasModels CGAL::Exact_predicates_inexact_constructions_kernel
+  \cgalHasModelsEnd
 
   \sa `Kernel_d`
   \sa `CGAL::Ambient_dimension`
diff --git a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h
index 57cfbc7d0584..63e05367bafc 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h
@@ -8,8 +8,9 @@ general kernel concept. It adds 2 functors, the meaning of which would be
 unclear in kernels of fixed dimension.
 
 \cgalRefines{Kernel_d}
-\cgalHasModel `CGAL::Cartesian_d<FieldNumberType>`
-\cgalHasModel `CGAL::Homogeneous_d<RingNumberType>`
+\cgalHasModelsBegin CGAL::Cartesian_d<FieldNumberType>
+\cgalHasModels CGAL::Homogeneous_d<RingNumberType>
+\cgalHasModelsEnd
 */
 class KernelWithLifting_d {
 public:
diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h
index 6b1378e66ae9..a56284feab8a 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h
@@ -18,10 +18,11 @@ predicates. The former replace constructors of the kernel classes and
 constructive procedures in the kernel. There are also function objects
 replacing operators, especially for equality testing.
 
-\cgalHasModel `CGAL::Cartesian_d<FieldNumberType>`
-\cgalHasModel `CGAL::Homogeneous_d<RingNumberType>`
-\cgalHasModel `CGAL::Epick_d<DimensionTag>`
-\cgalHasModel `CGAL::Epeck_d<DimensionTag>`
+\cgalHasModelsBegin CGAL::Cartesian_d<FieldNumberType>
+\cgalHasModels CGAL::Homogeneous_d<RingNumberType>
+\cgalHasModels CGAL::Epick_d<DimensionTag>
+\cgalHasModels CGAL::Epeck_d<DimensionTag>
+\cgalHasModelsEnd
 */
 class Kernel_d {
 public:
diff --git a/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h b/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h
index 932880c6f89c..f8a25811d421 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h
@@ -13,8 +13,9 @@ correct. For example, if the linear system solver declares a linear
 system \f$ A x = b\f$ unsolvable it also returns a vector \f$ c\f$ such that
 \f$ c^T A = 0\f$ and \f$ c^T b \neq 0\f$.
 
-\cgalHasModel `CGAL::Linear_algebraHd<RT>`
-\cgalHasModel `CGAL::Linear_algebraCd<FT>`
+\cgalHasModelsBegin CGAL::Linear_algebraHd<RT>
+\cgalHasModels CGAL::Linear_algebraCd<FT>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h
index 4e7e19343b9e..6f97471a99c4 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h
@@ -7,7 +7,7 @@ The concept `CellAttributeWithPoint` is a refinement of the `CellAttribute` conc
 
 \cgalRefines{CellAttribute}
 
-\cgalHasModel \link CGAL::Cell_attribute_with_point `CGAL::Cell_attribute_with_point<LCC,Info_,Tag,OnMerge,OnSplit>`\endlink
+\cgalHasModelsBare{\link CGAL::Cell_attribute_with_point `CGAL::Cell_attribute_with_point<LCC,Info_,Tag,OnMerge,OnSplit>`\endlink}
 
 \sa `LinearCellComplexItems`
 
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h
index c64aa00f4ff9..740405fc5b3c 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h
@@ -7,8 +7,8 @@ The concept `LinearCellComplex` represents a linear cell complex in dimension `d
 
 \cgalRefines{GenericMap}
 
-\cgalHasModel \link CGAL::Linear_cell_complex_for_combinatorial_map `CGAL::Linear_cell_complex_for_combinatorial_map<d,d2,LCCTraits,Items,Alloc>`\endlink
-\cgalHasModel \link CGAL::Linear_cell_complex_for_generalized_map `CGAL::Linear_cell_complex_for_generalized_map<d,d2,LCCTraits,Items,Alloc>`\endlink
+\cgalHasModelsBare{\link CGAL::Linear_cell_complex_for_combinatorial_map `CGAL::Linear_cell_complex_for_combinatorial_map<d,d2,LCCTraits,Items,Alloc>`\endlink\n
+                   \link CGAL::Linear_cell_complex_for_generalized_map `CGAL::Linear_cell_complex_for_generalized_map<d,d2,LCCTraits,Items,Alloc>`\endlink}
 
 \sa `LinearCellComplexItems`
 \sa `LinearCellComplexTraits`
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h
index caf8d2608952..25df3bed1833 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h
@@ -9,7 +9,8 @@ The concept `LinearCellComplexItems` refines the concept of `GenericMapItems` by
 
 The first type in `Attributes` tuple must be a model of the `CellAttributeWithPoint` concept.
 
-\cgalHasModel `CGAL::Linear_cell_complex_min_items`
+\cgalHasModelsBegin CGAL::Linear_cell_complex_min_items
+\cgalHasModelsEnd
 
 \sa `LinearCellComplex`
 \sa `CellAttributeWithPoint`
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h
index ef4c0f72cf0a..cb7de2d83823 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h
@@ -5,7 +5,7 @@
 
 Required types and functors for the `LinearCellComplexTraits` concept. This geometric traits concept is used in the \link CGAL::Linear_cell_complex_for_combinatorial_map `Linear_cell_complex_for_combinatorial_map`\endlink and \link CGAL::Linear_cell_complex_for_generalized_map `Linear_cell_complex_for_generalized_map`\endlink classes.
 
-\cgalHasModel \link CGAL::Linear_cell_complex_traits `CGAL::Linear_cell_complex_traits<d,K>`\endlink
+\cgalHasModelsBare{\link CGAL::Linear_cell_complex_traits `CGAL::Linear_cell_complex_traits<d\,K>`\endlink}
 
 \sa `CGAL::Linear_cell_complex_for_combinatorial_map<d,d2,LCCTraits,Items,Alloc>`
 \sa `CGAL::Linear_cell_complex_for_generalized_map<d,d2,LCCTraits,Items,Alloc>`
diff --git a/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h b/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h
index 287afa307588..37512a501ece 100644
--- a/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h
+++ b/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h
@@ -8,7 +8,8 @@ A class `BasicMatrix` has to provide the following
 types and operations in order to be a model for
 `BasicMatrix`.
 
-\cgalHasModel `CGAL::Dynamic_matrix<M>`
+\cgalHasModelsBegin CGAL::Dynamic_matrix<M>
+\cgalHasModelsEnd
 
 \sa `MonotoneMatrixSearchTraits`
 \sa `SortedMatrixSearchTraits`
diff --git a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h
index 483a45b68a01..3f44b807ffd0 100644
--- a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h
+++ b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h
@@ -21,7 +21,8 @@ add most of the functionality described above to arbitrary
 matrix classes.
 </UL>
 
-\cgalHasModel `CGAL::Dynamic_matrix<M>`
+\cgalHasModelsBegin CGAL::Dynamic_matrix<M>
+\cgalHasModelsEnd
 
 \sa `CGAL::monotone_matrix_search()`
 
diff --git a/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h b/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h
index ad49f24d3496..e96a49bfdbeb 100644
--- a/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h
+++ b/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h
@@ -8,7 +8,8 @@ needed to compute the smallest entry in a set of sorted matrices
 that fulfills a certain feasibility criterion using the function
 `CGAL::sorted_matrix_search`.
 
-\cgalHasModel `CGAL::Sorted_matrix_search_traits_adaptor<F,M>`
+\cgalHasModelsBegin CGAL::Sorted_matrix_search_traits_adaptor<F,M>
+\cgalHasModelsEnd
 
 \sa `CGAL::sorted_matrix_search()`
 \sa `BasicMatrix`
diff --git a/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h b/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h
index 04cebff70d04..745c85b0d9f6 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h
@@ -17,8 +17,8 @@ points on constrained edges.
 
 \cgalRefines{DelaunayTriangulationTraits_2}
 
-\cgalHasModel Any model of `Kernel` concept. In particular, all \cgal kernels
-\cgalHasModel `Projection_traits_xy_3<K>`
+\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_xy_3<K>
+\cgalHasModelsEnd
 
 
 */
diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h
index 4c9bd5eec8b9..abe11ca79a86 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h
@@ -13,7 +13,8 @@ meshing domain or not.
 
 \cgalRefines{ConstrainedTriangulationFaceBase_2}
 
-\cgalHasModel `CGAL::Delaunay_mesh_face_base_2<Traits, Fb>`
+\cgalHasModelsBegin CGAL::Delaunay_mesh_face_base_2<Traits, Fb>
+\cgalHasModelsEnd
 
 
 */
diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h
index 042980a96840..25d8388d962a 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h
@@ -12,8 +12,8 @@ object `Construct_circumcenter_2`.
 
 \cgalRefines{ConformingDelaunayTriangulationTraits_2}
 
-\cgalHasModel Any model of the `Kernel` concept. In particular, all \cgal kernels
-\cgalHasModel `CGAL::Projection_traits_xy_3<K>`
+\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_xy_3<K>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h
index 9385dae29ae3..341888021197 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h
@@ -13,7 +13,8 @@ the mesh density everywhere while modifying the mesh.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModel `CGAL::Delaunay_mesh_vertex_base_2<Traits, Vb>`
+\cgalHasModelsBegin CGAL::Delaunay_mesh_vertex_base_2<Traits, Vb>
+\cgalHasModelsEnd
 
 
 */
diff --git a/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h b/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h
index c7ff08ec1005..929119fb29af 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h
@@ -37,8 +37,9 @@ comparable</I> as the meshing algorithm will order bad triangles by quality,
 to split those with smallest quality first. The predicate `Is_bad`
 computes the quality of the triangle as a by-product.
 
-\cgalHasModel `CGAL::Delaunay_mesh_criteria_2<CDT>`
-\cgalHasModel `CGAL::Delaunay_mesh_size_criteria_2<CDT>`
+\cgalHasModelsBegin CGAL::Delaunay_mesh_criteria_2<CDT>
+\cgalHasModels CGAL::Delaunay_mesh_size_criteria_2<CDT>
+\cgalHasModelsEnd
 
 
 */
diff --git a/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h
index 8d6b076a3efa..0ca302d56fb5 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h
@@ -16,7 +16,7 @@ function from \f$ \mathbb{R}^3\f$ to \f$ \mathbb{R}\f$), the do-intersect predic
 is computed by evaluations of the function values at both end points
 of the segment.
 
-\cgalHasModel Any \cgal Kernel.
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 
 \sa `ImplicitSurfaceTraits_3`
 \sa `IntersectionGeometricTraits_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
index a1b35060f858..d5637c9b8e15 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
@@ -9,7 +9,7 @@ forming its boundary.
 The concept `IntersectionGeometricTraits_3` mainly provides the detection
 and construction of intersections between segments and triangles.
 
-\cgalHasModel All models of the `Kernel` concept.
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 
 \sa `BisectionGeometricTraits_3`
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
index 028d9e70d9fe..7ad4c56ad1cd 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
@@ -43,8 +43,9 @@ each cell (see below).
 
 \cgalRefines{SimplicialMeshCellBase_3,RegularTriangulationCellBaseWithWeightedCircumcenter_3,CopyConstructible}
 
-\cgalHasModel `CGAL::Compact_mesh_cell_base_3<Gt,MD,Tds>`
-\cgalHasModel `CGAL::Mesh_cell_base_3<Gt,MD,Cb>`
+\cgalHasModelsBegin CGAL::Compact_mesh_cell_base_3<Gt,MD,Tds>
+\cgalHasModels CGAL::Mesh_cell_base_3<Gt,MD,Cb>
+\cgalHasModelsEnd
 
 \sa `CGAL::make_mesh_3()`
 \sa `MeshDomain_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
index d3b0b83f0a64..4691571e9f1b 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
@@ -9,7 +9,8 @@ that concern either mesh tetrahedra or surface facets.
 The concept `MeshCellCriteria_3` describes the types that
 handle the refinement criteria for mesh tetrahedra.
 
-\cgalHasModel `CGAL::Mesh_cell_criteria_3<Tr>`
+\cgalHasModelsBegin CGAL::Mesh_cell_criteria_3<Tr>
+\cgalHasModelsEnd
 
 \sa `MeshEdgeCriteria_3`
 \sa `MeshFacetCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h
index c53644cb36fc..e1570416dd7f 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h
@@ -14,7 +14,8 @@ that describes the requirements, in terms of sizing, for the discretization of t
 
 \cgalRefines{MeshCriteria_3}
 
-\cgalHasModel `CGAL::Mesh_criteria_3<Tr>`
+\cgalHasModelsBegin CGAL::Mesh_criteria_3<Tr>
+\cgalHasModelsEnd
 
 \sa `MeshEdgeCriteria_3`
 \sa `MeshFacetCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
index ea4a1f33ea38..189afcbffcb9 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
@@ -12,7 +12,8 @@ while the refinement criteria for surface facets
 are described by the concept `MeshFacetCriteria_3`.
 The concept `MeshCriteria_3` encapsulates these concepts.
 
-\cgalHasModel `CGAL::Mesh_criteria_3<Tr>`
+\cgalHasModelsBegin CGAL::Mesh_criteria_3<Tr>
+\cgalHasModelsEnd
 
 \sa `MeshFacetCriteria_3`
 \sa `MeshCellCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
index 644a3a46046b..fbb2f2cc8eed 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
@@ -5,7 +5,8 @@
 The concept `MeshDomainField_3` describes a scalar field which could be queried
 at any point of the space.
 
-\cgalHasModel `CGAL::Mesh_constant_domain_field_3<Gt,%Index>`
+\cgalHasModelsBegin CGAL::Mesh_constant_domain_field_3<Gt,%Index>
+\cgalHasModelsEnd
 
 \sa `MeshDomain_3`
 \sa `MeshDomainWithFeatures_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
index 18e97b9a2753..80df66b599ad 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
@@ -17,8 +17,9 @@ between two ordered points on the same curve.
 
 \cgalRefines{MeshDomain_3}
 
-\cgalHasModel `CGAL::Mesh_domain_with_polyline_features_3<MeshDomain_3>`
-\cgalHasModel `CGAL::Polyhedral_mesh_domain_with_features_3<IGT>`
+\cgalHasModelsBegin CGAL::Mesh_domain_with_polyline_features_3<MeshDomain_3>
+\cgalHasModels CGAL::Polyhedral_mesh_domain_with_features_3<IGT>
+\cgalHasModelsEnd
 
 \sa `MeshDomain_3`
 
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
index 240f9b0f1fbf..56c6ed59ad1c 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
@@ -29,8 +29,9 @@ A segment, ray or line is said to intersect properly the domain boundary
 if it includes points which are strictly inside
 and strictly outside the domain (resp. the subdomain).
 
-\cgalHasModel `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
-\cgalHasModel `CGAL::Labeled_mesh_domain_3<BGT>`
+\cgalHasModelsBegin CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>
+\cgalHasModels CGAL::Labeled_mesh_domain_3<BGT>
+\cgalHasModelsEnd
 
 \sa `MeshVertexBase_3`
 \sa `MeshCellBase_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
index 4c044751069f..41b3bab44515 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
@@ -7,7 +7,8 @@ the 1-dimensional features of the domain.
 It provides an upper bound for the distance between two protecting ball centers
 that are consecutive on a 1-feature.
 
-\cgalHasModel `CGAL::Mesh_edge_criteria_3<Tr>`
+\cgalHasModelsBegin CGAL::Mesh_edge_criteria_3<Tr>
+\cgalHasModelsEnd
 
 \sa `MeshCellCriteria_3`
 \sa `MeshFacetCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
index 325dedeff053..f8bad1f29ccf 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
@@ -9,7 +9,8 @@ that concern either mesh tetrahedra or surface facets.
 The concept `MeshFacetCriteria_3` describes the types that
 handle the refinement criteria for surface facets.
 
-\cgalHasModel `CGAL::Mesh_facet_criteria_3<Tr>`
+\cgalHasModelsBegin CGAL::Mesh_facet_criteria_3<Tr>
+\cgalHasModelsEnd
 
 \sa `MeshCellCriteria_3`
 \sa `MeshEdgeCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h
index bfe6e4b8d982..ce8469eb8aa8 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h
@@ -6,7 +6,7 @@ The concept `MeshPolyline_3` implements a container of points designed to repres
 Types and functions provided in this concept are such as standard template library containers
 are natural models of this concept.
 
-\cgalHasModel `std::vector<Kernel::Point_3>` for any Kernel of \cgal is a natural model of this concept.
+\cgalHasModelsBare{`std::vector<Kernel::Point_3>` for any Kernel of \cgal is a natural model of this concept.}
 
 \sa `CGAL::Mesh_domain_with_polyline_features_3<MD>`
 
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
index 99b7a9d82707..3e1a8cf734d0 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
@@ -9,7 +9,7 @@ a mesh generation process.
 
 \cgalRefines{RegularTriangulationTraits_3}
 
-\cgalHasModel All models of `Kernel`.
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 
 In addition to the requirements described for the traits class
 RegularTriangulationTraits_3, the geometric traits class of a
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
index 4739741b01c7..f4f2ff9d9b84 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
@@ -22,7 +22,8 @@ each cell (see below).
 
 \cgalRefines{SimplicialMeshVertexBase_3,RegularTriangulationVertexBase_3,SurfaceMeshVertexBase_3}
 
-\cgalHasModel `CGAL::Mesh_vertex_base_3<Gt,MD,Vb>`
+\cgalHasModelsBegin CGAL::Mesh_vertex_base_3<Gt,MD,Vb>
+\cgalHasModelsEnd
 
 \sa `CGAL::make_mesh_3()`
 \sa `CGAL::refine_mesh_3()`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
index 03f9ff4880ad..1d3a376d3de1 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
@@ -5,7 +5,8 @@
 The concept `TriangleAccessor_3` represents an accessor to a triangulated polyhedral
 surface, intersection free and without boundaries.
 
-\cgalHasModel `CGAL::Triangle_accessor_3<Polyhedron_3<K>,K>`
+\cgalHasModelsBegin CGAL::Triangle_accessor_3<Polyhedron_3<K>,K>
+\cgalHasModelsEnd
 
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
 \sa `CGAL::make_mesh_3()`
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h
index 20b4cf23fb72..0f81aaa6a90e 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h
@@ -6,11 +6,12 @@ A model of the `PolygonConvexDecomposition_2` concept is capable of
 decomposing an input polygon \f$ P\f$ into a set of convex sub-polygons
 \f$ P_1, \ldots, P_k\f$, such that \f$ \cup_{i=1}^{k}{P_k} = P\f$.
 
-\cgalHasModel `CGAL::Small_side_angle_bisector_decomposition_2<Kernel,Container>`
-\cgalHasModel `CGAL::Optimal_convex_decomposition_2<Kernel,Container>`
-\cgalHasModel `CGAL::Hertel_Mehlhorn_convex_decomposition_2<Kernel,Container>`
-\cgalHasModel `CGAL::Greene_convex_decomposition_2<Kernel,Container>`
-\cgalHasModel `CGAL::Polygon_nop_decomposition_2<Kernel,Container>`
+\cgalHasModelsBegin CGAL::Small_side_angle_bisector_decomposition_2<Kernel,Container>
+\cgalHasModels CGAL::Optimal_convex_decomposition_2<Kernel,Container>
+\cgalHasModels CGAL::Hertel_Mehlhorn_convex_decomposition_2<Kernel,Container>
+\cgalHasModels CGAL::Greene_convex_decomposition_2<Kernel,Container>
+\cgalHasModels CGAL::Polygon_nop_decomposition_2<Kernel,Container>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h
index 7c27e91a6c80..64b8d0995076 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h
@@ -9,8 +9,9 @@ convex sub-polygons \f$ P_1, \ldots, P_k\f$, such that
 
 \cgalRefines{PolygonConvexDecomposition_2}
 
-\cgalHasModel `CGAL::Polygon_vertical_decomposition_2<Kernel,Container>`
-\cgalHasModel `CGAL::Polygon_triangulation_decomposition_2<Kernel,Container>`
+\cgalHasModelsBegin CGAL::Polygon_vertical_decomposition_2<Kernel,Container>
+\cgalHasModels CGAL::Polygon_triangulation_decomposition_2<Kernel,Container>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h b/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h
index c315deb05fd8..1bf64f2a9c94 100644
--- a/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h
+++ b/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h
@@ -9,7 +9,8 @@ function object. It maps objects of its domain type `Key` to
 the integral image type `std::size_t`. The image values have to
 be unique for all keys in the domain type `Key`.
 
-\cgalHasModel `CGAL::Handle_hash_function`
+\cgalHasModelsBegin CGAL::Handle_hash_function
+\cgalHasModelsEnd
 
 \sa `CGAL::Unique_hash_map<Key,Data,UniqueHashFunction>`
 
diff --git a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h
index 022ed5c526bd..0e0467a9f390 100644
--- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h
+++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h
@@ -8,7 +8,8 @@ In case this associated type is a model of `Modularizable`, this is indicated by
 Boolean tag `ModularTraits::Is_modularizable`. The mapping into the `Residue_type` is
 provided by the functor `ModularTraits::Modular_image`.
 
-\cgalHasModel CGAL::Modular_traits<T>
+\cgalHasModelsBegin CGAL::Modular_traits<T>
+\cgalHasModelsEnd
 
 \sa `CGAL::Residue`
 \sa `Modularizable`
diff --git a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h
index 0001b5b400b2..8db45a2f4287 100644
--- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h
+++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h
@@ -18,18 +18,20 @@ of denominator, are not `Modularizable`.
 This is due to the fact that the denominator may be zero modulo the prime,
 which can not be represented.
 
-\cgalHasModel `int`
-\cgalHasModel `long`
-\cgalHasModel `CORE::BigInt`
-\cgalHasModel `CGAL::Gmpz`
-\cgalHasModel `leda_integer`
-\cgalHasModel `mpz_class`
+\cgalHasModelsBegin int
+\cgalHasModels long
+\cgalHasModels CORE::BigInt
+\cgalHasModels CGAL::Gmpz
+\cgalHasModels leda_integer
+\cgalHasModels mpz_class
+\cgalHasModelsEnd
 
 The following types are `Modularizable` iff their template arguments are.
 
-\cgalHasModel `CGAL::Lazy_exact_nt<NT>`
-\cgalHasModel `CGAL::Sqrt_extension<NT,ROOT>`
-\cgalHasModel `CGAL::Polynomial<Coeff>`
+\cgalHasModelsBegin CGAL::Lazy_exact_nt<NT>
+\cgalHasModels CGAL::Sqrt_extension<NT,ROOT>
+\cgalHasModels CGAL::Polynomial<Coeff>
+\cgalHasModelsEnd
 
 \sa `CGAL::Residue`
 \sa `CGAL::Modular_traits<T>`
diff --git a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
index 8d5e82f7fed8..7161d6725e76 100644
--- a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
+++ b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
@@ -38,9 +38,10 @@ functionality for changing between standard affine and extended
 geometry. At the same time it provides extensible geometric primitives
 on the extended geometric objects.
 
-\cgalHasModel `CGAL::Extended_cartesian<FT>`
-\cgalHasModel `CGAL::Extended_homogeneous<RT>`
-\cgalHasModel `CGAL::Filtered_extended_homogeneous<RT>`
+\cgalHasModelsBegin CGAL::Extended_cartesian<FT>
+\cgalHasModels CGAL::Extended_homogeneous<RT>
+\cgalHasModels CGAL::Filtered_extended_homogeneous<RT>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Number_types/doc/Number_types/Concepts/RootOf_2.h b/Number_types/doc/Number_types/Concepts/RootOf_2.h
index a772693794da..c29f30b3ab2b 100644
--- a/Number_types/doc/Number_types/Concepts/RootOf_2.h
+++ b/Number_types/doc/Number_types/Concepts/RootOf_2.h
@@ -30,8 +30,8 @@ special construction for extensions of degree 2:
 \cgalRefines{DefaultConstructible,CopyConstructible,FromIntConstructible,
   ImplicitInteroperable with `RT`,ImplicitInteroperable with `FT`}
 
-\cgalHasModel `double` (not exact)
-\cgalHasModel `CGAL::Sqrt_extension`
+\cgalHasModelsBareBegin{`double` (not exact)} CGAL::Sqrt_extension
+\cgalHasModelsEnd
 
 \sa `CGAL::make_root_of_2<RT>`
 \sa `CGAL::make_sqrt<RT>`
diff --git a/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h b/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h
index dceb2345f0cd..fad3d71782a0 100644
--- a/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h
+++ b/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h
@@ -8,7 +8,8 @@ a 3x3 matrix type.
 
 \cgalRefines{Kernel}
 
-\cgalHasModel `CGAL::Oriented_bounding_box_traits_3`
+\cgalHasModelsBegin CGAL::Oriented_bounding_box_traits_3
+\cgalHasModelsEnd
 
 */
 class OrientedBoundingBoxTraits_3
diff --git a/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h b/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h
index fe99dd293c4c..39b2c65b4e15 100644
--- a/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h
+++ b/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h
@@ -8,8 +8,8 @@ for the traits class of `CGAL::Optimal_transportation_reconstruction_2`.
 
 \cgalRefines{DelaunayTriangulationTraits_2}
 
-\cgalHasModel Any model of the `Kernel` concept
-\cgalHasModel `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended)
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`,
+                   `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended)}
 
 \sa `CGAL::Optimal_transportation_reconstruction_2`
 
diff --git a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h
index eac6e2e914de..8b6e0e06631e 100644
--- a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h
+++ b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h
@@ -5,9 +5,10 @@
   The concept `OrthtreeTraits` defines the requirements for the
   template parameter of the `CGAL::Orthtree` class.
 
-  \cgalHasModel `CGAL::Orthtree_traits_2<GeomTraits>`
-  \cgalHasModel `CGAL::Orthtree_traits_3<GeomTraits>`
-  \cgalHasModel `CGAL::Orthtree_traits_d<GeomTraits,Dimension>`
+  \cgalHasModelsBegin galHasModel `CGAL::Orthtree_traits_2<GeomTraits>
+  \cgalHasModels CGAL::Orthtree_traits_3<GeomTraits>
+  \cgalHasModels CGAL::Orthtree_traits_d<GeomTraits,Dimension>
+  \cgalHasModelsEnd
 */
 class OrthtreeTraits
 {
diff --git a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
index d763be714e54..c03e9deb2070 100644
--- a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
+++ b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
@@ -9,10 +9,11 @@
   A traversal is used to iterate on a tree with a user-selected order
   (e.g. preorder, postorder).
 
-  \cgalHasModel `CGAL::Orthtrees::Preorder_traversal`
-  \cgalHasModel `CGAL::Orthtrees::Postorder_traversal`
-  \cgalHasModel `CGAL::Orthtrees::Leaves_traversal`
-  \cgalHasModel `CGAL::Orthtrees::Level_traversal`
+  \cgalHasModelsBegin galHasModel `CGAL::Orthtrees::Preorder_traversal
+  \cgalHasModels CGAL::Orthtrees::Postorder_traversal
+  \cgalHasModels CGAL::Orthtrees::Leaves_traversal
+  \cgalHasModels CGAL::Orthtrees::Level_traversal
+  \cgalHasModelsEnd
  */
 class OrthtreeTraversal {
 
diff --git a/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h
index c1919ce24449..ff7c9417c08b 100644
--- a/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h
@@ -6,7 +6,8 @@ Requirements of a traits class used
 by `convex_partition_is_valid_2` for testing the validity of a
 convex partition of a polygon.
 
-\cgalHasModel `CGAL::Partition_traits_2<R>`
+\cgalHasModelsBegin CGAL::Partition_traits_2<R>
+\cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
 \sa `CGAL::greene_approx_convex_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h b/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h
index d677751f991f..0c0d7e3fc974 100644
--- a/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h
@@ -6,8 +6,9 @@ Requirements of a traits class to be
 used with the function `is_y_monotone_2()` that tests whether a sequence of
 2D points defines a \f$ y\f$-monotone polygon or not.
 
-\cgalHasModel `CGAL::Partition_traits_2<R>`
-\cgalHasModel `CGAL::Kernel_traits_2`
+\cgalHasModelsBegin CGAL::Partition_traits_2<R>
+\cgalHasModels CGAL::Kernel_traits_2
+\cgalHasModelsEnd
 
 \sa `CGAL::Is_y_monotone_2<Traits>`
 \sa `CGAL::y_monotone_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h
index 3f1e4722dc2b..85676075bb4e 100644
--- a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h
@@ -8,7 +8,8 @@ an optimal convex partition of a polygon.
 
 \cgalRefines{PartitionTraits_2}
 
-\cgalHasModel `CGAL::Partition_traits_2<R>`
+\cgalHasModelsBegin CGAL::Partition_traits_2<R>
+\cgalHasModelsEnd
 
 \sa `CGAL::convex_partition_is_valid_2()`
 \sa `CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>`
diff --git a/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h
index 31f7e3c0136f..b91ad8109352 100644
--- a/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h
@@ -14,7 +14,8 @@ function `CGAL::is_convex_2()`
 and the concept `YMonotonePartitionTraits_2` for the additional requirements
 for testing for convexity and \f$ y\f$-monotonicity, respectively.
 
-\cgalHasModel `CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>`
+\cgalHasModelsBegin CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>
+\cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
 \sa `CGAL::greene_approx_convex_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h b/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h
index c4c3827f6642..2ad93228b1bf 100644
--- a/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h
@@ -8,7 +8,8 @@ common
 to all traits classes. The concept `PartitionTraits_2` defines this common set of
 requirements.
 
-\cgalHasModel `CGAL::Partition_traits_2<R>`
+\cgalHasModelsBegin CGAL::Partition_traits_2<R>
+\cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
 \sa `CGAL::greene_approx_convex_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h b/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h
index b0e5ff298d14..ab72c01a9f09 100644
--- a/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h
+++ b/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h
@@ -6,8 +6,9 @@ Function object that determines if a sequence of points represents a
 valid partition polygon or not, where "valid" can assume any of several
 meanings (e.g., convex or \f$ y\f$-monotone).
 
-\cgalHasModel `CGAL::Is_convex_2<Traits>`
-\cgalHasModel `CGAL::Is_y_monotone_2<Traits>`
+\cgalHasModelsBegin CGAL::Is_convex_2<Traits>
+\cgalHasModels CGAL::Is_y_monotone_2<Traits>
+\cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
 \sa `CGAL::convex_partition_is_valid_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h
index a7500c62d6bf..6212b11620a4 100644
--- a/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h
@@ -6,7 +6,8 @@ Requirements of a traits class that is used
 by `y_monotone_partition_is_valid_2` for testing the validity of a
 \f$ y\f$-monotone partition of a polygon.
 
-\cgalHasModel `CGAL::Partition_traits_2<R>`
+\cgalHasModelsBegin CGAL::Partition_traits_2<R>
+\cgalHasModelsEnd
 
 \sa `CGAL::partition_is_valid_2()`
 \sa `CGAL::y_monotone_partition_2()`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h
index 402a3eca8062..bda0b95ab293 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h
@@ -27,7 +27,8 @@ dual functions are called. The additional predicate type
 `::Periodic_2DelaunayTriangulationTraits_2::Compare_distance_2` is required if calls to
 `nearest_vertex(..)` are issued.
 
-\cgalHasModel `CGAL::Periodic_2_Delaunay_triangulation_traits_2<Traits, Offset>`
+\cgalHasModelsBegin CGAL::Periodic_2_Delaunay_triangulation_traits_2<Traits, Offset>
+\cgalHasModelsEnd
 
 \sa `DelaunayTriangulationTraits_2`
 */
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h
index c3d9e3b3c7b9..56d28d5a2171 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h
@@ -7,7 +7,8 @@
 
 The concept `Periodic_2Offset_2` describes a two-/dimensional integer vector with some specialized access functions and operations.
 
-\cgalHasModel `CGAL::Periodic_2_offset_2`
+\cgalHasModelsBegin CGAL::Periodic_2_offset_2
+\cgalHasModelsEnd
 
 \sa `Periodic_2TriangulationTraits_2`
 \sa `Periodic_2DelaunayTriangulationTraits_2`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h
index 7d7771d981ee..96769827f334 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h
@@ -13,7 +13,8 @@ vertex \f$ i\f$.
 
 \cgalRefines{TriangulationFaceBase_2}
 
-\cgalHasModel `CGAL::Periodic_2_triangulation_face_base_2`
+\cgalHasModelsBegin CGAL::Periodic_2_triangulation_face_base_2
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
 \sa `TriangulationFaceBase_2`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h
index 71bfd55b2688..58dad3ed62d0 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h
@@ -24,7 +24,8 @@ In addition to the requirements described for the traits class
 Periodic triangulation must fulfill the following
 requirements:
 
-\cgalHasModel `CGAL::Periodic_2_triangulation_traits_2`
+\cgalHasModelsBegin CGAL::Periodic_2_triangulation_traits_2
+\cgalHasModelsEnd
 
 \sa `TriangulationTraits_2`
 \sa `CGAL::Periodic_2_triangulation_2<Traits,Tds>`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h
index 26c88f7b1579..33d799fec248 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h
@@ -16,7 +16,8 @@ The storage of the offset is only needed when a triangulation is copied.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModel` CGAL::Periodic_2_triangulation_vertex_base_2`
+\cgalHasModelsBegin CGAL::Periodic_2_triangulation_vertex_base_2
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
 \sa `TriangulationVertexBase_2`
diff --git a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h
index 51a0f2dff739..2794a7f365ae 100644
--- a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h
+++ b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h
@@ -22,8 +22,8 @@ Wrapping any model of `Periodic_3MeshDomain_3` with the class
 `CGAL::Mesh_domain_with_polyline_features_3` gives a model
 of `Periodic_3MeshDomainWithFeatures_3`.
 
-\cgalHasModel `CGAL::Mesh_domain_with_polyline_features_3<
-                 CGAL::Labeled_mesh_domain_3<BGT> >`
+\cgalHasModelsBegin CGAL::Mesh_domain_with_polyline_features_3<CGAL::Labeled_mesh_domain_3<BGT> >
+\cgalHasModelsEnd
 
 \sa `CGAL::Periodic_3_function_wrapper<Function,BGT>`
 
diff --git a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h
index d646476f1398..63170e01edb0 100644
--- a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h
+++ b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h
@@ -20,7 +20,8 @@ The class `CGAL::Labeled_mesh_domain_3<BGT>` paired with a periodic labeling fun
 is a model of this concept. It is possible to create artificially periodic functions
 through the class `CGAL::Periodic_3_function_wrapper<Function,BGT>`.
 
-\cgalHasModel `CGAL::Labeled_mesh_domain_3<BGT>`
+\cgalHasModelsBegin CGAL::Labeled_mesh_domain_3<BGT>
+\cgalHasModelsEnd
 
 \sa `CGAL::Labeled_mesh_domain_3<BG>`
 
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h
index 9ca96674cc79..1d72f2281804 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h
@@ -15,7 +15,8 @@ functor the version without offsets.
 
 \cgalRefines{Periodic_3TriangulationTraits_3,DelaunayTriangulationTraits_3}
 
-\cgalHasModel `CGAL::Periodic_3_Delaunay_triangulation_traits_3`
+\cgalHasModelsBegin CGAL::Periodic_3_Delaunay_triangulation_traits_3
+\cgalHasModelsEnd
 
 In addition to the requirements described by the concepts
 `Periodic_3TriangulationTraits_3` and `DelaunayTriangulationTraits_3`,
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h
index 1896b2291dc8..b5a467b4cd82 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h
@@ -6,7 +6,8 @@
 The concept `Periodic_3Offset_3` describes a three-dimensional integer vector
 with some specialized access functions and operations.
 
-\cgalHasModel `CGAL::Periodic_3_offset_3`
+\cgalHasModelsBegin CGAL::Periodic_3_offset_3
+\cgalHasModelsEnd
 
 \sa `Periodic_3TriangulationTraits_3`
 \sa `Periodic_3DelaunayTriangulationTraits_3`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h
index 803505e302eb..29c9fae1dc68 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h
@@ -5,10 +5,9 @@
 
 \cgalRefines{RegularTriangulationCellBase_3,Periodic_3TriangulationDSCellBase_3}
 
-\cgalHasModel `CGAL::Regular_triangulation_cell_base_3<Periodic_3RegularTriangulationTraits_3,
-                                                       Periodic_3_triangulation_ds_cell_base_3< > >`
-\cgalHasModel `CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3<Periodic_3RegularTriangulationTraits_3,
-                                                                                  Periodic_3_triangulation_ds_cell_base_3< > >`
+\cgalHasModelsBegin CGAL::Regular_triangulation_cell_base_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_cell_base_3< > >
+\cgalHasModels CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_cell_base_3< > >
+\cgalHasModelsEnd
 
 The template parameter `Periodic_3RegularTriangulationTraits_3` is expected to be the same as the
 traits class used in `CGAL::Periodic_3_regular_triangulation_3`.
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h
index 762aceede946..8f5ce76dab56 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h
@@ -5,8 +5,8 @@
 
 \cgalRefines{RegularTriangulationVertexBase_3,Periodic_3TriangulationDSVertexBase_3}
 
-\cgalHasModel `CGAL::Regular_triangulation_vertex_base_3<Periodic_3RegularTriangulationTraits_3,
-                                                         Periodic_3_triangulation_ds_vertex_base_3< > >`
+\cgalHasModelsBegin CGAL::Regular_triangulation_vertex_base_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_vertex_base_3< > >
+\cgalHasModelsEnd
 
 The template parameter `Periodic_3RegularTriangulationTraits_3` is expected to be the same as the
 traits class used in `CGAL::Periodic_3_regular_triangulation_3`.
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h
index c84d4e8885c1..c128b08f82e9 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h
@@ -15,7 +15,8 @@ functor the version without offsets.
 
 \cgalRefines{Periodic_3TriangulationTraits_3,RegularTriangulationTraits_3}
 
-\cgalHasModel `CGAL::Periodic_3_regular_triangulation_traits_3`
+\cgalHasModelsBegin CGAL::Periodic_3_regular_triangulation_traits_3
+\cgalHasModelsEnd
 
 In addition to the requirements described for the traits class
 RegularTriangulationTraits_3, the geometric traits class of a
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h
index 048264c8c7b1..9f575b848695 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h
@@ -18,7 +18,8 @@ does not contain any information.
 
 \cgalRefines{TriangulationDSCellBase_3}
 
-\cgalHasModel `CGAL::Periodic_3_triangulation_ds_cell_base_3`
+\cgalHasModelsBegin CGAL::Periodic_3_triangulation_ds_cell_base_3
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_3`
 \sa `TriangulationDSCellBase_3`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h
index cc3de413a708..14b032fc1bc0 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h
@@ -12,7 +12,8 @@ a vertex provides access to one of its incident cells through a handle.
 
 \cgalRefines{TriangulationDSVertexBase_3}
 
-\cgalHasModel `CGAL::Periodic_3_triangulation_ds_vertex_base_3`
+\cgalHasModelsBegin CGAL::Periodic_3_triangulation_ds_vertex_base_3
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_3`
 \sa `TriangulationDSVertexBase_3`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h
index f786b27ea94f..ace2ebb8199b 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h
@@ -14,7 +14,8 @@ functor the version without offsets.
 
 \cgalRefines{TriangulationTraits_3}
 
-\cgalHasModel `CGAL::Periodic_3_triangulation_traits_3`
+\cgalHasModelsBegin CGAL::Periodic_3_triangulation_traits_3
+\cgalHasModelsEnd
 
 \sa `Periodic_3DelaunayTriangulationTraits_3`
 \sa `Periodic_3RegularTriangulationTraits_3`
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h
index 6628fffd89f5..7532e1b0797d 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h
@@ -12,7 +12,8 @@ to `Periodic_4HyperbolicTriangulationTraits_2` that needs to be fulfilled
 by any class used to instantiate the first template parameter of the class
 `CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_2`.
 
-\cgalHasModel `CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_traits_2`
+\cgalHasModelsBegin CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_traits_2
+\cgalHasModelsEnd
 */
 
 
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h
index 959e3c3a25e9..9766710af1ed 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h
@@ -20,7 +20,8 @@ corresponding vertex produces the canonical representative of the face in the hy
 Hyperbolic translations are represented by a nested type which is provided by the concept
 `Periodic_4HyperbolicDelaunayTriangulationTraits_2`.
 
-\cgalHasModel `CGAL::Periodic_4_hyperbolic_triangulation_face_base_2`
+\cgalHasModelsBegin CGAL::Periodic_4_hyperbolic_triangulation_face_base_2
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
 \sa `Periodic_4HyperbolicTriangulationVertexBase_2`
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h
index 3221dc57a11e..eb8bfe0b89dd 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h
@@ -14,7 +14,8 @@ translation during the insertion process.
 A boolean flag indicates whether the face stores a translation or not. The value of the flag is automatically
 set when storing or removing a translation.
 
-\cgalHasModel `CGAL::Periodic_4_hyperbolic_triangulation_vertex_base_2`
+\cgalHasModelsBegin CGAL::Periodic_4_hyperbolic_triangulation_vertex_base_2
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
 \sa `Periodic_4HyperbolicTriangulationFaceBase_2`
diff --git a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h
index 97517ca4a3d1..f17b26f951ae 100644
--- a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h
+++ b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h
@@ -8,8 +8,9 @@
  * represents the outer boundary and the general polygons that represent
  * the holes.
  *
- * \cgalHasModel `CGAL::General_polygon_with_holes_2<Polygon>`
- * \cgalHasModel `CGAL::Polygon_with_holes_2<Kernel,Container>`
+ * \cgalHasModelsBegin CGAL::General_polygon_with_holes_2<Polygon>
+ * \cgalHasModels CGAL::Polygon_with_holes_2<Kernel,Container>
+ * \cgalHasModelsEnd
  */
 
 class GeneralPolygonWithHoles_2 {
diff --git a/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h b/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h
index 674a57e4374b..068194985bce 100644
--- a/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h
+++ b/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h
@@ -14,10 +14,10 @@ and refer to the description of the kernel concept for details.
 
 \cgalRefines{DefaultConstructible,CopyConstructable}
 
-\cgalHasModel The kernels supplied by \cgal are models of `PolygonTraits_2`.
-\cgalHasModel `CGAL::Projection_traits_xy_3<K>`
-\cgalHasModel `CGAL::Projection_traits_yz_3<K>`
-\cgalHasModel `CGAL::Projection_traits_xz_3<K>`
+\cgalHasModelsBareBegin{The kernels supplied by \cgal are models of `PolygonTraits_2`} CGAL::Projection_traits_xy_3<K>
+\cgalHasModels CGAL::Projection_traits_yz_3<K>
+\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsEnd
 
 \sa `CGAL::Polygon_2<PolygonTraits_2, Container>`
 
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
index a46ff1fe7a24..facce5d714b0 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
@@ -6,7 +6,8 @@
 /// the creation of new faces and new edges.
 ///
 /// \cgalRefines{CopyConstructible}
-/// \cgalHasModel `CGAL::Polygon_mesh_processing::Corefinement::Default_visitor`.
+/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Corefinement::Default_visitor
+/// \cgalHasModelsEnd
 
 class PMPCorefinementVisitor{
 public:
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h
index 61575e3ff892..ec9839512208 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h
@@ -7,7 +7,7 @@
 /// `sample_triangle_mesh()`, `approximate_Hausdorff_distance()` and `max_distance_to_triangle_mesh()`
 ///
 /// \cgalRefines{AABBGeomTraits,SpatialSortingTraits_3}
-/// \cgalHasModel Any 3D Kernel is a model of this concept.
+/// \cgalHasModelsBare{Any 3D Kernel is a model of this concept}
 
 class PMPDistanceTraits{
 public:
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h
index 9ef06093cb22..11af2abad0fd 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h
@@ -9,7 +9,8 @@
 /// If that fails, it uses an algorithm with cubic running time (*cubic phase*).
 ///
 /// \cgalRefines{CopyConstructible}
-/// \cgalHasModel `CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor`.
+/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor
+/// \cgalHasModelsEnd
 
 class PMPHolefillingVisitor{
 public:
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h
index a4efc83d7039..d0597a5c90e5 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h
@@ -7,7 +7,8 @@
 /// during the orientation process.
 ///
 /// \cgalRefines{CopyConstructible}
-/// \cgalHasModel `CGAL::Polygon_mesh_processing::Default_orientation_visitor`.
+/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Default_orientation_visitor
+/// \cgalHasModelsEnd
 
 class PMPPolygonSoupOrientationVisitor{
 public:
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h
index f3fdef28beba..a8c885e7b13d 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h
@@ -6,7 +6,8 @@
 /// the creation of new faces.
 ///
 /// \cgalRefines{CopyConstructible}
-/// \cgalHasModel `CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor`.
+/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor
+/// \cgalHasModelsEnd
 
 
 class PMPTriangulateFaceVisitor {
diff --git a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h
index 62c23598c49f..c4b306a73a23 100644
--- a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h
+++ b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h
@@ -13,8 +13,9 @@ polyhedral surface renames faces to facets.
 
 \cgalRefines{HalfedgeDSItems}
 
-\cgalHasModel `CGAL::Polyhedron_items_3`
-\cgalHasModel `CGAL::Polyhedron_min_items_3`
+\cgalHasModelsBegin CGAL::Polyhedron_items_3
+\cgalHasModels CGAL::Polyhedron_min_items_3
+\cgalHasModelsEnd
 
 \sa `CGAL::Polyhedron_3<Traits>`
 \sa `HalfedgeDSItems`
diff --git a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h
index 6849eb7f1750..5dc824c7d553 100644
--- a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h
+++ b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h
@@ -10,9 +10,9 @@ and can be used directly as template argument.
 
 \cgalRefines{CopyConstructible,Assignable}
 
-\cgalHasModel `CGAL::Polyhedron_traits_3<Kernel>`
-\cgalHasModel `CGAL::Polyhedron_traits_with_normals_3<Kernel>`
-\cgalHasModel All models of the `Kernel` concept, e.g., `CGAL::Simple_cartesian<FieldNumberType>`
+\cgalHasModelsBareBegin{All models of the `Kernel` concept, e.g. `CGAL::Simple_cartesian<FieldNumberType>`} CGAL::Polyhedron_traits_3<Kernel>
+\cgalHasModels CGAL::Polyhedron_traits_with_normals_3<Kernel>
+\cgalHasModelsEnd
 
 \sa `CGAL::Polyhedron_3<Traits>`
 
diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
index 4722bcaa72c8..525753e4c75a 100644
--- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
+++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
@@ -12,9 +12,10 @@ preserve the overall polyline set shape as much as possible
 
 \cgalRefines{CopyConstructible,Assignable}
 
-\cgalHasModel `CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost`
-\cgalHasModel `CGAL::Polyline_simplification_2::Scaled_squared_distance_cost`
-\cgalHasModel `CGAL::Polyline_simplification_2::Squared_distance_cost`
+\cgalHasModelsBegin CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost
+\cgalHasModels CGAL::Polyline_simplification_2::Scaled_squared_distance_cost
+\cgalHasModels CGAL::Polyline_simplification_2::Squared_distance_cost
+\cgalHasModelsEnd
 
 */
 
diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h
index 62e84c66f489..bb5b1d98948d 100644
--- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h
+++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h
@@ -5,9 +5,10 @@
 Models of this concept are passed to the polyline simplification algorithm to indicate
 when to stop the process.
 
-\cgalHasModel `CGAL::Polyline_simplification_2::Stop_below_count_ratio_threshold`
-\cgalHasModel `CGAL::Polyline_simplification_2::Stop_below_count_threshold`
-\cgalHasModel `CGAL::Polyline_simplification_2::Stop_above_cost_threshold`
+\cgalHasModelsBegin CGAL::Polyline_simplification_2::Stop_below_count_ratio_threshold
+\cgalHasModels CGAL::Polyline_simplification_2::Stop_below_count_threshold
+\cgalHasModels CGAL::Polyline_simplification_2::Stop_above_cost_threshold
+\cgalHasModelsEnd
 */
 
 class PolylineSimplificationStopPredicate
diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h
index c51684ad8d63..20aff75a93bd 100644
--- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h
+++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h
@@ -8,7 +8,8 @@ whether a vertex can be removed, and the cost of the removal.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModel `CGAL::Polyline_simplification_2::Vertex_base_2<Vb>`
+\cgalHasModelsBegin CGAL::Polyline_simplification_2::Vertex_base_2<Vb>
+\cgalHasModelsEnd
 
 \sa `TriangulationFaceBase_2`
 \sa `CGAL::Constrained_triangulation_plus_2<Tr>`
diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h
index d5552d6b328e..7ce0406f0644 100644
--- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h
+++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h
@@ -31,7 +31,8 @@ is possible to select a certain variable.
 
 \sa `Polynomial_d`
 
-\cgalHasModel `CGAL::Polynomial_traits_d<Polynomial_d>`
+\cgalHasModelsBegin CGAL::Polynomial_traits_d<Polynomial_d>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
index ed86c99c6838..6a5a0c84a05f 100644
--- a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
+++ b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
@@ -32,7 +32,8 @@ coefficient is a `Field` the polynomial is model of `EuclideanRing`.
 \sa `AlgebraicStructureTraits`
 \sa `PolynomialTraits_d`
 
-\cgalHasModel `CGAL::Polynomial<Coeff>`
+\cgalHasModelsBegin CGAL::Polynomial<Coeff>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h
index a792e16ee381..64c1383c051f 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h
@@ -7,10 +7,11 @@ The concept `AllFurthestNeighborsTraits_2` defines types and operations
 needed to compute all furthest neighbors for the vertices of a
 convex polygon using the function `all_furthest_neighbors_2()`.
 
-\cgalHasModel `CGAL::Cartesian<FieldNumberType>`
-\cgalHasModel `CGAL::Homogeneous<RingNumberType>`
-\cgalHasModel `CGAL::Simple_cartesian<FieldNumberType>`
-\cgalHasModel `CGAL::Simple_homogeneous<RingNumberType>`
+\cgalHasModelsBegin CGAL::Cartesian<FieldNumberType>
+\cgalHasModels CGAL::Homogeneous<RingNumberType>
+\cgalHasModels CGAL::Simple_cartesian<FieldNumberType>
+\cgalHasModels CGAL::Simple_homogeneous<RingNumberType>
+\cgalHasModelsEnd
 
 \sa `CGAL::all_furthest_neighbors_2()`
 
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h
index cfece60d3a40..34286f63b4bc 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h
@@ -6,9 +6,10 @@
 This concept defines the requirements for traits classes of \f$ d\f$-dimensional
 optimisation algorithms.
 
-\cgalHasModel `CGAL::Polytope_distance_d_traits_2<K,ET,NT>`
-\cgalHasModel `CGAL::Polytope_distance_d_traits_3<K,ET,NT>`
-\cgalHasModel `CGAL::Polytope_distance_d_traits_d<K,ET,NT>`
+\cgalHasModelsBegin CGAL::Polytope_distance_d_traits_2<K,ET,NT>
+\cgalHasModels CGAL::Polytope_distance_d_traits_3<K,ET,NT>
+\cgalHasModels CGAL::Polytope_distance_d_traits_d<K,ET,NT>
+\cgalHasModelsEnd
 
 \sa `CGAL::Polytope_distance_d<Traits>`
 
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h
index 6f882dd12808..5794f4716580 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h
@@ -12,7 +12,8 @@ Whatever the coordinates of the points are, it is required for the
 width-algorithm to have access to the homogeneous representation of
 points.
 
-\cgalHasModel CGAL::Width_default_traits_3
+\cgalHasModelsBegin CGAL::Width_default_traits_3
+\cgalHasModelsEnd
 
 \sa `CGAL::Width_3<Traits>`
 
diff --git a/QP_solver/doc/QP_solver/Concepts/LinearProgram.h b/QP_solver/doc/QP_solver/Concepts/LinearProgram.h
index 6cc3639cff50..1882b05c73ee 100644
--- a/QP_solver/doc/QP_solver/Concepts/LinearProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/LinearProgram.h
@@ -35,9 +35,10 @@ The description is given by appropriate <I>random-access</I>
 iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
-\cgalHasModel `CGAL::Quadratic_program<NT>`
-\cgalHasModel `CGAL::Quadratic_program_from_mps<NT>`
-\cgalHasModel `CGAL::Linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>`
+\cgalHasModelsBegin CGAL::Quadratic_program<NT>
+\cgalHasModels CGAL::Quadratic_program_from_mps<NT>
+\cgalHasModels CGAL::Linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>
+\cgalHasModelsEnd
 
 
 and the other concepts
diff --git a/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h b/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h
index e3a75a9aaf7c..0e4c2928cec3 100644
--- a/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h
@@ -29,17 +29,19 @@ The description is given by appropriate <I>random-access</I>
 iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
-\cgalHasModel `CGAL::Quadratic_program<NT>`
-\cgalHasModel `CGAL::Quadratic_program_from_mps<NT>`
-\cgalHasModel `CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>`
+\cgalHasModelsBegin CGAL::Quadratic_program<NT>
+\cgalHasModels CGAL::Quadratic_program_from_mps<NT>
+\cgalHasModels CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>
+\cgalHasModelsEnd
 
 The value types of all iterator types (nested iterator
 types, respectively, for `A_iterator`) must be convertible to some
 common `IntegralDomain` `ET`.
 
-\cgalHasModel `CGAL::Quadratic_program<NT>`
-\cgalHasModel `CGAL::Quadratic_program_from_mps<NT>`
-\cgalHasModel `CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, C_it>`
+\cgalHasModelsBegin CGAL::Quadratic_program<NT>
+\cgalHasModels CGAL::Quadratic_program_from_mps<NT>
+\cgalHasModels CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, C_it>
+\cgalHasModelsEnd
 
 \sa `QuadraticProgram`
 \sa `LinearProgram`
diff --git a/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h b/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h
index 585eb911b0a9..f531f27550c4 100644
--- a/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h
@@ -33,9 +33,10 @@ The description is given by appropriate <I>random-access</I>
 iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
-\cgalHasModel `CGAL::Quadratic_program<NT>`
-\cgalHasModel `CGAL::Quadratic_program_from_mps<NT>`
-\cgalHasModel `CGAL::Nonnegative_quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>`
+\cgalHasModelsBegin CGAL::Quadratic_program<NT>
+\cgalHasModels CGAL::Quadratic_program_from_mps<NT>
+\cgalHasModels CGAL::Nonnegative_quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>
+\cgalHasModelsEnd
 
 The value types of all iterator types (nested iterator
 types, respectively, for `A_iterator` and `D_iterator`) must be
diff --git a/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h b/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h
index 6070e27ceb91..e25310153888 100644
--- a/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h
@@ -34,9 +34,10 @@ The description is given by appropriate <I>random-access</I>
 iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
-\cgalHasModel `CGAL::Quadratic_program<NT>`
-\cgalHasModel `CGAL::Quadratic_program_from_mps<NT>`
-\cgalHasModel `CGAL::Quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>`
+\cgalHasModelsBegin CGAL::Quadratic_program<NT>
+\cgalHasModels CGAL::Quadratic_program_from_mps<NT>
+\cgalHasModels CGAL::Quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>
+\cgalHasModelsEnd
 
 The value types of all iterator types (nested iterator
 types, respectively, for `A_iterator` and `D_iterator`) must be
diff --git a/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h b/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h
index d76e8032e54c..1359f35074e4 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h
@@ -48,7 +48,8 @@ of the input complex.
 
 \cgalRefines{MeshComplex_3InTriangulation_3}
 
-\cgalHasModel `CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
+\cgalHasModelsBegin CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>
+\cgalHasModelsEnd
 
 \sa `MeshComplex_3InTriangulation_3`
 \sa `MeshDomainWithFeatures_3`
diff --git a/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h b/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h
index c3b1696a58da..fa640570e27e 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h
@@ -42,7 +42,8 @@ the current approximation of each subdomain
 and each boundary surface patch.
 The data structure encodes the final mesh at the end of the meshing process.
 
-\cgalHasModel `CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
+\cgalHasModelsBegin CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>
+\cgalHasModelsEnd
 
 \sa `MeshDomain_3`
 \sa `MeshComplexWithFeatures_3InTriangulation_3`
diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
index ff424c1281da..50ac974f9797 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
@@ -18,10 +18,11 @@ of the triangulation that are surface facets.
 
 \cgalRefines{TriangulationCellBase_3,CopyConstructible}
 
-\cgalHasModel `CGAL::Compact_mesh_cell_base_3`
-\cgalHasModel `CGAL::Mesh_cell_base_3`
-\cgalHasModel `CGAL::Simplicial_mesh_cell_base_3`
-\cgalHasModel `CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3`
+\cgalHasModelsBegin CGAL::Compact_mesh_cell_base_3
+\cgalHasModels CGAL::Mesh_cell_base_3
+\cgalHasModels CGAL::Simplicial_mesh_cell_base_3
+\cgalHasModels CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3
+\cgalHasModelsEnd
 
 */
 
diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
index ad034bbb9823..938ce50e7e27 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
@@ -16,9 +16,10 @@ and to an index characteristic of this face.
 
 \cgalRefines{TriangulationVertexBase_3}
 
-\cgalHasModel `CGAL::Mesh_vertex_base_3`
-\cgalHasModel `CGAL::Simplicial_mesh_vertex_base_3`
-\cgalHasModel `CGAL::Tetrahedral_remeshing::Remeshing_vertex_base_3`
+\cgalHasModelsBegin CGAL::Mesh_vertex_base_3
+\cgalHasModels CGAL::Simplicial_mesh_vertex_base_3
+\cgalHasModels CGAL::Tetrahedral_remeshing::Remeshing_vertex_base_3
+\cgalHasModelsEnd
 
 */
 
diff --git a/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h b/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h
index 8235e55f4f01..4c700b18520a 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h
@@ -6,8 +6,9 @@ The concept `Descriptor` allows to describe a unique object in an abstract model
 
 \cgalRefines{DefaultConstructible,CopyConstructible,Assignable,EqualityComparable}
 
-\cgalHasModel `Index`
-\cgalHasModel `Handle`
+\cgalHasModelsBegin Index
+\cgalHasModels Handle
+\cgalHasModelsEnd
 */
 
 class Descriptor {};
diff --git a/STL_Extension/doc/STL_Extension/Concepts/Hashable.h b/STL_Extension/doc/STL_Extension/Concepts/Hashable.h
index 3c7f0b5cf712..ab5c0429a90e 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/Hashable.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/Hashable.h
@@ -6,10 +6,8 @@
 A type `Key` is a model of the concept `Hashable` if the
 specializations `boost::hash<Key>` and `std::hash<Key>` exist.
 
-\cgalHasModel All handles and indices of \cgal data structures.
-\cgalHasModel All handles of OpenMesh, by including the specializations
-of the `graph_traits` header files provided by \cgal.
-They can be disables by defining the macro `CGAL_DISABLE_HASH_OPENMESH`.
+\cgalHasModelsBare{All handles and indices of \cgal data structures,
+    All handles of OpenMesh\, by including the specializations of the `graph_traits` header files provided by \cgal. They can be disables by defining the macro `CGAL_DISABLE_HASH_OPENMESH`.}
 
 \sa `CGAL::Unique_hash_map<Key,Mapped,Hash>`
 \sa <A HREF="https://en.cppreference.com/w/cpp/container/unordered_set">`std::unordered_set`</a>
diff --git a/STL_Extension/doc/STL_Extension/Concepts/Index.h b/STL_Extension/doc/STL_Extension/Concepts/Index.h
index 544e714fa8a8..c94791cd287b 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/Index.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/Index.h
@@ -6,8 +6,9 @@ The concept `Index` is a refinement of `Descriptor` which must be convertible fr
 
 \cgalRefines{Descriptor}
 
-\cgalHasModel int
-\cgalHasModel size_t
+\cgalHasModelsBegin int
+\cgalHasModels size_t
+\cgalHasModelsEnd
 
 \cgalHeading{Notation}
 
diff --git a/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h b/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h
index 3a2856032712..00f421a6c679 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h
@@ -12,19 +12,20 @@ The concept `ProjectionObject` is modeled after the STL
 concept `UnaryFunction`, but takes also care of (const)
 references.
 
-\cgalHasModel CGAL::Identity
-\cgalHasModel CGAL::Dereference
-\cgalHasModel CGAL::Get_address
-\cgalHasModel CGAL::Cast_function_object
-\cgalHasModel CGAL::Project_vertex
-\cgalHasModel CGAL::Project_facet
-\cgalHasModel CGAL::Project_point
-\cgalHasModel CGAL::Project_normal
-\cgalHasModel CGAL::Project_plane
-\cgalHasModel CGAL::Project_next
-\cgalHasModel CGAL::Project_prev
-\cgalHasModel CGAL::Project_next_opposite
-\cgalHasModel CGAL::Project_opposite_prev
+\cgalHasModelsBegin CGAL::Identity
+\cgalHasModels CGAL::Dereference
+\cgalHasModels CGAL::Get_address
+\cgalHasModels CGAL::Cast_function_object
+\cgalHasModels CGAL::Project_vertex
+\cgalHasModels CGAL::Project_facet
+\cgalHasModels CGAL::Project_point
+\cgalHasModels CGAL::Project_normal
+\cgalHasModels CGAL::Project_plane
+\cgalHasModels CGAL::Project_next
+\cgalHasModels CGAL::Project_prev
+\cgalHasModels CGAL::Project_next_opposite
+\cgalHasModels CGAL::Project_opposite_prev
+\cgalHasModelsEnd
 
 
 */
diff --git a/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h b/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h
index e11d85a35a13..02e8a3211506 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h
@@ -21,7 +21,8 @@ We call `S` the surjective function such that `S(object)`
 is the \"thing\" that is locked when one tries to lock `object`.
 In the previous example, `S(point)` is the voxel containing `point`.
 
-\cgalHasModel `CGAL::Spatial_lock_grid_3`
+\cgalHasModelsBegin CGAL::Spatial_lock_grid_3
+\cgalHasModelsEnd
 
 */
 class SurjectiveLockDataStructure {
diff --git a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h
index e083e399ac7c..35367ad681fd 100644
--- a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h
+++ b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h
@@ -11,8 +11,9 @@ namespace Scale_space_reconstruction_3 {
  * A mesher is a functor that can be applied to a range of
  * points and that returns a set of facets.
  *
- * \cgalHasModel CGAL::Scale_space_reconstruction_3::Alpha_shape_mesher
- * \cgalHasModel CGAL::Scale_space_reconstruction_3::Advancing_front_mesher
+ * \cgalHasModelsBegin CGAL::Scale_space_reconstruction_3::Alpha_shape_mesher
+ * \cgalHasModels CGAL::Scale_space_reconstruction_3::Advancing_front_mesher
+ * \cgalHasModelsEnd
  *
  */
 class Mesher
diff --git a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h
index 0cfdd7b5499f..326cc4ff2df8 100644
--- a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h
+++ b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h
@@ -15,8 +15,9 @@ namespace Scale_space_reconstruction_3 {
  * \note the functor can be applied several times by the scale space
  * reconstruction algorithm.
  *
- * \cgalHasModel CGAL::Scale_space_reconstruction_3::Weighted_PCA_smoother
- * \cgalHasModel CGAL::Scale_space_reconstruction_3::Jet_smoother
+ * \cgalHasModelsBegin CGAL::Scale_space_reconstruction_3::Weighted_PCA_smoother
+ * \cgalHasModels CGAL::Scale_space_reconstruction_3::Jet_smoother
+ * \cgalHasModelsEnd
  */
 class Smoother
 {
diff --git a/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h b/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h
index 71373681e989..f61385ec5896 100644
--- a/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h
+++ b/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h
@@ -9,12 +9,13 @@ the keys and intervals, and provide comparison functions that
 are needed for window queries.
 
 
-\cgalHasModel `CGAL::Range_segment_tree_set_traits_2`
-\cgalHasModel `CGAL::Range_segment_tree_set_traits_3`
-\cgalHasModel `CGAL::Range_tree_map_traits_2`
-\cgalHasModel `CGAL::Range_tree_map_traits_3`
-\cgalHasModel `CGAL::Segment_tree_map_traits_2`
-\cgalHasModel `CGAL::Segment_tree_map_traits_3`
+\cgalHasModelsBegin CGAL::Range_segment_tree_set_traits_2
+\cgalHasModels CGAL::Range_segment_tree_set_traits_3
+\cgalHasModels CGAL::Range_tree_map_traits_2
+\cgalHasModels CGAL::Range_tree_map_traits_3
+\cgalHasModels CGAL::Segment_tree_map_traits_2
+\cgalHasModels CGAL::Segment_tree_map_traits_3
+\cgalHasModelsEnd
 
 \cgalHeading{Example}
 
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
index 566beb42485e..f5be21ae15ea 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
@@ -33,7 +33,8 @@ We only describe the additional requirements with respect to the
 
 \cgalRefines{ApolloniusGraphDataStructure_2}
 
-\cgalHasModel `CGAL::Triangulation_data_structure_2<Vb,Fb>`
+\cgalHasModelsBegin CGAL::Triangulation_data_structure_2<Vb,Fb>
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
 \sa `ApolloniusGraphDataStructure_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h
index 4b96dab0907b..ee8181103a40 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h
@@ -9,7 +9,8 @@ requirements for the face base class of the
 
 \cgalRefines{TriangulationFaceBase_2}
 
-\cgalHasModel `CGAL::Segment_Delaunay_graph_face_base_2<Gt>`
+\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_face_base_2<Gt>
+\cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphDataStructure_2`
 \sa `SegmentDelaunayGraphTraits_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h
index 7ab5a65a26b7..d53cbd55ccf5 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h
@@ -26,7 +26,8 @@ The `SegmentDelaunayGraphHierarchyVertexBase_2` concept does not
 introduce any constructors in addition to those of the
 `SegmentDelaunayGraphVertexBase_2` concept.
 
-\cgalHasModel CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2<CGAL::Segment_Delaunay_graph_vertex_base_2<St> >
+\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2<CGAL::Segment_Delaunay_graph_vertex_base_2<St> >
+\cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphDataStructure_2`
 \sa `SegmentDelaunayGraphVertexBase_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h
index 5370b1b30262..99d6bf2ca9ee 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h
@@ -8,7 +8,8 @@ requirements for the sites of a segment Delaunay graph.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Segment_Delaunay_graph_site_2<K>`
+\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_site_2<K>
+\cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
 \sa `CGAL::Segment_Delaunay_graph_site_2<K>`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h
index 3f391babafa1..d79098a554c1 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h
@@ -11,7 +11,8 @@ by storing handles to points instead of points.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Segment_Delaunay_graph_storage_site_2<Gt>`
+\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_storage_site_2<Gt>
+\cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
 \sa `CGAL::Segment_Delaunay_graph_site_2<K>`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h
index 78e8bda7d6e7..e4866423c159 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h
@@ -15,7 +15,8 @@ See section \ref Segment_Delaunay_graph_2StronglyIntersecting for more informati
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Segment_Delaunay_graph_storage_traits_2<K>`
+\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_storage_traits_2<K>
+\cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
 */
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h
index e68b4212b191..78e56ed2f6cf 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h
@@ -14,10 +14,11 @@ the concept `SegmentDelaunayGraphSite_2`. It also provides
 constructions for sites and several function object
 types for the predicates.
 
-\cgalHasModel `CGAL::Segment_Delaunay_graph_traits_2<K,MTag>`
-\cgalHasModel `CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>`
-\cgalHasModel `CGAL::Segment_Delaunay_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>`
-\cgalHasModel `CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>`
+\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_traits_2<K,MTag>
+\cgalHasModels CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>
+\cgalHasModels CGAL::Segment_Delaunay_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>
+\cgalHasModels CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>
+\cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphSite_2`
 \sa `CGAL::Segment_Delaunay_graph_2<Gt,St,DS>`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h
index 778a709b5a68..48097737f247 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h
@@ -11,7 +11,8 @@ requirements for the vertex base class of the
 site of the segment Delaunay graph and provides access to one of its
 incident faces through a `Face_handle`.
 
-\cgalHasModel `CGAL::Segment_Delaunay_graph_vertex_base_2<St>`
+\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_vertex_base_2<St>
+\cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
 \sa `SegmentDelaunayGraphSite_2`
diff --git a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h
index 4a4a626b8eba..4a8ec7f78fc8 100644
--- a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h
+++ b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h
@@ -36,10 +36,11 @@ with respect to the
 
 \cgalRefines{SegmentDelaunayGraphTraits_2}
 
-\cgalHasModel `CGAL::Segment_Delaunay_graph_Linf_traits_2<K,MTag>`
-\cgalHasModel `CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2<K,MTag>`
-\cgalHasModel `CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2<CK,CM,EK,EM,FK,FM>`
-\cgalHasModel `CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>`
+\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_Linf_traits_2<K,MTag>
+\cgalHasModels CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2<K,MTag>
+\cgalHasModels CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2<CK,CM,EK,EM,FK,FM>
+\cgalHasModels CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>
+\cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphSite_2`
 \sa `CGAL::Segment_Delaunay_graph_Linf_2<Gt,DS>`
diff --git a/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h b/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h
index 4f0424d96645..cb1e7eed119a 100644
--- a/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h
+++ b/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h
@@ -7,7 +7,7 @@
 
   \cgalRefines{DefaultConstructible,PolygonTraits_2}
 
-  \cgalHasModel Any CGAL kernel, e.g., CGAL::Exact_predicates_exact_constructions_kernel.
+  \cgalHasModelsBare{Any CGAL kernel, e.g., CGAL::Exact_predicates_exact_constructions_kernel.}
 
 */
 
diff --git a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
index 5441f324e943..e581f066cb63 100644
--- a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
+++ b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
@@ -12,8 +12,8 @@ input data has to be provided in form of a random access iterator.
 Point and normal property maps have to be provided to extract the points
 and the normals from the input.
 
-\cgalHasModel
-- `CGAL::Shape_detection::Efficient_RANSAC_traits`
+\cgalHasModelsBegin CGAL::Shape_detection::Efficient_RANSAC_traits
+\cgalHasModelsEnd
 */
 class EfficientRANSACTraits{
 
diff --git a/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h b/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h
index 5495e5d0c9a9..88df769ec099 100644
--- a/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h
+++ b/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h
@@ -5,11 +5,11 @@
 A concept that describes the set of methods used by the `CGAL::Shape_detection::Region_growing`
 to access neighbors of an item.
 
-\cgalHasModel
-- `CGAL::Shape_detection::Point_set::K_neighbor_query`
-- `CGAL::Shape_detection::Point_set::Sphere_neighbor_query`
-- `CGAL::Shape_detection::Polygon_mesh::Polyline_graph`
-- `CGAL::Shape_detection::Polygon_mesh::One_ring_neighbor_query`
+\cgalHasModelsBegin CGAL::Shape_detection::Point_set::K_neighbor_query
+\cgalHasModels CGAL::Shape_detection::Point_set::Sphere_neighbor_query
+\cgalHasModels CGAL::Shape_detection::Polygon_mesh::Polyline_graph
+\cgalHasModels CGAL::Shape_detection::Polygon_mesh::One_ring_neighbor_query
+\cgalHasModelsEnd
 */
 class NeighborQuery {
 
diff --git a/Shape_detection/doc/Shape_detection/Concepts/RegionType.h b/Shape_detection/doc/Shape_detection/Concepts/RegionType.h
index f1366dc8aba6..af3212c67593 100644
--- a/Shape_detection/doc/Shape_detection/Concepts/RegionType.h
+++ b/Shape_detection/doc/Shape_detection/Concepts/RegionType.h
@@ -7,14 +7,14 @@ to maintain a region.
 
 A region is represented by a set items, which are included in this region.
 
-\cgalHasModel
-- `CGAL::Shape_detection::Point_set::Least_squares_line_fit_region`
-- `CGAL::Shape_detection::Point_set::Least_squares_circle_fit_region`
-- `CGAL::Shape_detection::Point_set::Least_squares_plane_fit_region`
-- `CGAL::Shape_detection::Point_set::Least_squares_sphere_fit_region`
-- `CGAL::Shape_detection::Point_set::Least_squares_cylinder_fit_region`
-- `CGAL::Shape_detection::Segment_set::Least_squares_line_fit_region`
-- `CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region`
+\cgalHasModelsBegin CGAL::Shape_detection::Point_set::Least_squares_line_fit_region
+\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_circle_fit_region
+\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_plane_fit_region
+\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_sphere_fit_region
+\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_cylinder_fit_region
+\cgalHasModels CGAL::Shape_detection::Segment_set::Least_squares_line_fit_region
+\cgalHasModels CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region
+\cgalHasModelsEnd
 */
 class RegionType {
 
diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h b/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h
index f0e4a54c1a10..9ed67563fdcc 100644
--- a/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h
+++ b/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h
@@ -10,10 +10,10 @@ a model of this concept, the user sets such directions and provides a way to ori
 contour edges towards these directions. All contour regularization functions
 in this package are parameterized by this concept.
 
-\cgalHasModel
-- `Contours::Longest_direction_2`
-- `Contours::Multiple_directions_2`
-- `Contours::User_defined_directions_2`
+\cgalHasModelsBegin Contours::Longest_direction_2
+\cgalHasModels Contours::Multiple_directions_2
+\cgalHasModels Contours::User_defined_directions_2
+\cgalHasModelsEnd
 */
 class ContourDirections {
 
diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h b/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h
index 4d8074eee9dd..20dbf1801e12 100644
--- a/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h
+++ b/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h
@@ -9,8 +9,8 @@ A concept that describes the set of methods used by the class
 `QP_regularization` to access neighbors of
 a geometric object being regularized.
 
-\cgalHasModel
-- `Segments::Delaunay_neighbor_query_2`
+\cgalHasModelsBegin Segments::Delaunay_neighbor_query_2
+\cgalHasModelsEnd
 */
 class NeighborQuery {
 
diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h b/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h
index eb3a764af8e4..ab3bbb08b7b6 100644
--- a/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h
+++ b/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h
@@ -9,9 +9,9 @@ A concept that describes the set of methods used by the class
 `QP_regularization` to access various data
 required for setting up the the global regularization problem.
 
-\cgalHasModel
-- `Segments::Angle_regularization_2`
-- `Segments::Offset_regularization_2`
+\cgalHasModelsBegin Segments::Angle_regularization_2
+\cgalHasModels Segments::Offset_regularization_2
+\cgalHasModelsEnd
 */
 class RegularizationType {
 
diff --git a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h
index 6551020f4f05..180cbeeb64d2 100644
--- a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h
+++ b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h
@@ -10,7 +10,8 @@ polyhedral mesh approximating a skin surface
 
 \cgalRefines{RegularTriangulationTraits_3}
 
-\cgalHasModel `CGAL::Skin_surface_traits_3<K>`
+\cgalHasModelsBegin CGAL::Skin_surface_traits_3<K>
+\cgalHasModelsEnd
 
 \sa `CGAL::Skin_surface_3<SkinSurfaceTraits_3>`
 \sa `CGAL::Skin_surface_traits_3<K>`
diff --git a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h
index a4dad53d72e8..237a5d3049d6 100644
--- a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h
+++ b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h
@@ -9,8 +9,9 @@ The concept requires a constructor from an iterator range of
 weighted points and a shrink factor. By default the input balls are
 grown in such that the skin surface wraps around the input balls.
 
-\cgalHasModel `CGAL::Skin_surface_3<SkinSurfaceTraits_3>`
-\cgalHasModel `CGAL::Union_of_balls_3<SkinSurfaceTraits_3>`
+\cgalHasModelsBegin CGAL::Skin_surface_3<SkinSurfaceTraits_3>
+\cgalHasModels CGAL::Union_of_balls_3<SkinSurfaceTraits_3>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h b/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h
index 0138ce98d6bd..163d17faa16a 100644
--- a/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h
+++ b/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h
@@ -11,7 +11,8 @@ some function object types for the required predicates on those primitives.
 
 \cgalRefines{ArrangementTraits_2}
 
-\cgalHasModel `CGAL::Snap_rounding_traits_2<Kernel>`
+\cgalHasModelsBegin CGAL::Snap_rounding_traits_2<Kernel>
+\cgalHasModelsEnd
 */
 
 class SnapRoundingTraits_2 {
@@ -171,7 +172,7 @@ namespace SRTraits_2{
   \cgalConcept
   Represents an iso rectangle
   \cgalRefines{DefaultConstructible,CopyConstructible,Assignable}
-  \cgalHasModel \link SnapRoundingTraits_2::Iso_rectangle_2 `Snap_rounding_traits_2::Iso_rectangle_2` \endlink
+  \cgalHasModelsBare{\link SnapRoundingTraits_2::Iso_rectangle_2 `Snap_rounding_traits_2::Iso_rectangle_2` \endlink}
 */
 class IsoRectangle_2
 {};
@@ -180,7 +181,7 @@ class IsoRectangle_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableBinaryFunction}
-  \cgalHasModel \link SnapRoundingTraits_2::Construct_vertex_2 `Snap_rounding_traits_2::Construct_vertex_2` \endlink
+  \cgalHasModelsBare{\link SnapRoundingTraits_2::Construct_vertex_2 `Snap_rounding_traits_2::Construct_vertex_2` \endlink}
 */
 class ConstructVertex_2
 {
@@ -197,7 +198,7 @@ class ConstructVertex_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableBinaryFunction}
-  \cgalHasModel \link SnapRoundingTraits_2::Construct_segment_2 `Snap_rounding_traits_2::Construct_segment_2`  \endlink
+  \cgalHasModelsBare{\link SnapRoundingTraits_2::Construct_segment_2 `Snap_rounding_traits_2::Construct_segment_2`  \endlink}
 */
 class ConstructSegment_2
 {
@@ -214,7 +215,7 @@ class ConstructSegment_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableQuaternaryFunction}
-  \cgalHasModel \link SnapRoundingTraits_2::Construct_iso_rectangle_2 `Snap_rounding_traits_2::Construct_iso_rectangle_2` \endlink
+  \cgalHasModelsBare{\link SnapRoundingTraits_2::Construct_iso_rectangle_2 `Snap_rounding_traits_2::Construct_iso_rectangle_2` \endlink}
 */
 class ConstructIsoRectangle_2
 {
@@ -235,7 +236,7 @@ class ConstructIsoRectangle_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableBinaryFunction}
-  \cgalHasModel \link SnapRoundingTraits_2::Compare_x_2 `Snap_rounding_traits_2::Compare_x_2` \endlink
+  \cgalHasModelsBare{\link SnapRoundingTraits_2::Compare_x_2 `Snap_rounding_traits_2::Compare_x_2` \endlink}
 */
 class CompareX_2
 {
@@ -251,7 +252,7 @@ class CompareX_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableBinaryFunction}
-  \cgalHasModel \link SnapRoundingTraits_2::Compare_y_2 `Snap_rounding_traits_2::Compare_y_2` \endlink
+  \cgalHasModelsBare{\link SnapRoundingTraits_2::Compare_y_2 `Snap_rounding_traits_2::Compare_y_2` \endlink}
 */
 class CompareY_2
 {
@@ -268,7 +269,7 @@ class CompareY_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableQuaternaryFunction}
-  \cgalHasModel \link SnapRoundingTraits_2::Snap_2 `Snap_rounding_traits_2::Snap_2` \endlink
+  \cgalHasModelsBare{\link SnapRoundingTraits_2::Snap_2 `Snap_rounding_traits_2::Snap_2` \endlink}
 */
 class Snap_2
 {
@@ -287,7 +288,7 @@ class Snap_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableBinaryFunction}
-  \cgalHasModel \link SnapRoundingTraits_2::Integer_grid_point_2 `Snap_rounding_traits_2::Integer_grid_point_2` \endlink
+  \cgalHasModelsBare{\link SnapRoundingTraits_2::Integer_grid_point_2 `Snap_rounding_traits_2::Integer_grid_point_2` \endlink}
 
 */
 class IntegerGridPoint_2
@@ -308,7 +309,7 @@ class IntegerGridPoint_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableTernaryFunction}
-  \cgalHasModel \link SnapRoundingTraits_2::Minkowski_sum_with_pixel_2 `Snap_rounding_traits_2::Minkowski_sum_with_pixel_2` \endlink
+  \cgalHasModelsBare{\link SnapRoundingTraits_2::Minkowski_sum_with_pixel_2 `Snap_rounding_traits_2::Minkowski_sum_with_pixel_2` \endlink}
 */
 class MinkowskiSumWithPixel_2
 {
diff --git a/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h b/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h
index 7b00e83e1195..41594f6cbfeb 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h
@@ -19,7 +19,8 @@ For example, a matrix of dimension 3 is defined as
 \tparam FT Number type
 \tparam dim Dimension of the matrices and vectors
 
-\cgalHasModel `CGAL::Eigen_diagonalize_traits`
+\cgalHasModelsBegin CGAL::Eigen_diagonalize_traits
+\cgalHasModelsEnd
 */
 template <typename FT, unsigned int dim = 3>
 class DiagonalizeTraits
diff --git a/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h b/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h
index 8504337f1fce..015153dd3240 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h
@@ -7,7 +7,8 @@ class MixedIntegerProgramTraits
 `MixedIntegerProgramVariable` is a concept of a variable in
 a Mixed Integer Programming (MIP) problem.
 
-\cgalHasModel `CGAL::Variable<FT>`
+\cgalHasModelsBegin CGAL::Variable<FT>
+\cgalHasModelsEnd
 */
 template <typename FT>
 class MixedIntegerProgramVariable
@@ -112,7 +113,8 @@ class MixedIntegerProgramVariable
 `MixedIntegerProgramLinearConstraint` is a concept of a linear
 constraint in a Mixed Integer Programming (MIP) problem.
 
-\cgalHasModel `CGAL::Linear_constraint<FT>`
+\cgalHasModelsBegin CGAL::Linear_constraint<FT>
+\cgalHasModelsEnd
 */
 template <typename FT>
 class MixedIntegerProgramLinearConstraint
@@ -209,7 +211,8 @@ class MixedIntegerProgramLinearConstraint
 `MixedIntegerProgramLinearObjective` is a concept of the linear
 objective function in a Mixed Integer Programming (MIP) problem.
 
-\cgalHasModel `CGAL::Linear_objective<FT>`
+\cgalHasModelsBegin CGAL::Linear_objective<FT>
+\cgalHasModelsEnd
 */
 template <typename FT>
 class MixedIntegerProgramLinearObjective
@@ -277,9 +280,10 @@ Mixed Integer Programming (MIP) problems. A model of this concept stores the int
 variables, linear objective, and linear constraints (if any) and provides a method
 to solve the problem.
 
-\cgalHasModel `CGAL::Mixed_integer_program_traits<T>`
-\cgalHasModel `CGAL::GLPK_mixed_integer_program_traits<T>`
-\cgalHasModel `CGAL::SCIP_mixed_integer_program_traits<T>`
+\cgalHasModelsBegin CGAL::Mixed_integer_program_traits<T>
+\cgalHasModels CGAL::GLPK_mixed_integer_program_traits<T>
+\cgalHasModels CGAL::SCIP_mixed_integer_program_traits<T>
+\cgalHasModelsEnd
 */
 template <typename FT>
 class MixedIntegerProgramTraits
diff --git a/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h
index 36c16f629ea4..07781ed7265a 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h
@@ -7,7 +7,8 @@ Concept describing the set of requirements for solving the normal equation \f$ A
 
 \sa `SparseLinearAlgebraTraits_d`
 
-\cgalHasModel `CGAL::Eigen_solver_traits<T>`
+\cgalHasModelsBegin CGAL::Eigen_solver_traits<T>
+\cgalHasModelsEnd
 */
 class NormalEquationSparseLinearAlgebraTraits_d
 {
diff --git a/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h b/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h
index 189f0da26b72..f929f231c7b5 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h
@@ -24,8 +24,8 @@ where \f$ l_i \in \mathbb{R} \cup \{-\infty\} \f$ for all \f$ i \f$,
 where \f$ u_i \in \mathbb{R} \cup \{+\infty\} \f$ for all \f$ i \f$.
 </UL>
 
-\cgalHasModel
-`CGAL::OSQP_quadratic_program_traits<T>`
+\cgalHasModelsBegin CGAL::OSQP_quadratic_program_traits<T>
+\cgalHasModelsEnd
 */
 class QuadraticProgramTraits {
 
diff --git a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h
index e05554478123..7c04f914bd48 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h
@@ -4,7 +4,8 @@
 
 The concept `SparseLinearAlgebraTraits_d` is used to solve sparse linear systems <I>A\f$ \times \f$ X = B</I>.
 
-\cgalHasModel `CGAL::Eigen_solver_traits<T>`
+\cgalHasModelsBegin CGAL::Eigen_solver_traits<T>
+\cgalHasModelsEnd
 */
 class SparseLinearAlgebraTraits_d
 {
@@ -62,7 +63,8 @@ by a sparse matrix.
 
 \cgalRefines{DefaultConstructible}
 
-\cgalHasModel `CGAL::Eigen_vector<T>`
+\cgalHasModelsBegin CGAL::Eigen_vector<T>
+\cgalHasModelsEnd
 
 \sa `SparseLinearAlgebraTraits_d`
 \sa `SparseLinearAlgebraTraits_d::Matrix`
@@ -129,8 +131,9 @@ NT& operator[](Index row);
 
 \cgalRefines{Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Eigen_sparse_matrix<T>`
-\cgalHasModel `CGAL::Eigen_sparse_symmetric_matrix<T>`
+\cgalHasModelsBegin CGAL::Eigen_sparse_matrix<T>
+\cgalHasModels CGAL::Eigen_sparse_symmetric_matrix<T>
+\cgalHasModelsEnd
 
 \sa `SparseLinearAlgebraTraits_d`
 \sa `SparseLinearAlgebraTraits_d::Vector`
diff --git a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h
index 0313402d3560..34df486f1e63 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h
@@ -8,7 +8,8 @@ method to solve the system for different right-hand vectors.
 
 \cgalRefines{SparseLinearAlgebraTraits_d}
 
-\cgalHasModel `CGAL::Eigen_solver_traits<T>`
+\cgalHasModelsBegin CGAL::Eigen_solver_traits<T>
+\cgalHasModelsEnd
 */
 class SparseLinearAlgebraWithFactorTraits_d {
 public:
diff --git a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
index 939b29a4959c..2c843090296b 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
@@ -5,7 +5,8 @@
   The concept `SvdTraits` describes the linear algebra types and algorithms needed
   to solve in the least square sense a linear system with a singular value decomposition
 
-  \cgalHasModel `CGAL::Eigen_svd`
+\cgalHasModelsBegin galHasModel `CGAL::Eigen_svd
+\cgalHasModelsEnd
 */
 class SvdTraits
 {
@@ -51,7 +52,8 @@ class SvdTraits
 \cgalConcept
 Concept of vector type used by the concept `SvdTraits`.
 
-\cgalHasModel `CGAL::Eigen_vector<T>`
+\cgalHasModelsBegin CGAL::Eigen_vector<T>
+\cgalHasModelsEnd
 */
 class SvdTraits::Vector
 {
@@ -88,7 +90,8 @@ Concept of matrix type used by the concept `SvdTraits`.
 
 \cgalRefines{DefaultConstructible,Assignable}
 
-\cgalHasModel `CGAL::Eigen_matrix<T>`
+\cgalHasModelsBegin CGAL::Eigen_matrix<T>
+\cgalHasModelsEnd
 */
 class SvdTraits::Matrix
 {
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h b/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h
index a8aa2640a2c3..4e0837b36be0 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h
@@ -4,8 +4,9 @@
 
 The concept `FuzzyQueryItem` describes the requirements for fuzzy `d`-dimensional spatial objects.
 
-\cgalHasModel `CGAL::Fuzzy_sphere<Traits>`
+\cgalHasModelsBegin CGAL::Fuzzy_sphere<Traits>
 \cgalHasModel `CGAL::Fuzzy_iso_box<Traits>`
+\cgalHasModelsEnd
 
 */
 
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
index fd72ee75e07a..7a8506131f61 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
@@ -8,8 +8,9 @@ To optimize distance computations transformed distances are used,
 e.g., for a Euclidean distance the transformed distance is the squared
 Euclidean distance.
 
-\cgalHasModel `CGAL::Manhattan_distance_iso_box_point<Traits>`
-\cgalHasModel `CGAL::Euclidean_distance_sphere_point<Traits>`
+\cgalHasModelsBegin CGAL::Manhattan_distance_iso_box_point<Traits>
+\cgalHasModels CGAL::Euclidean_distance_sphere_point<Traits>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
index d2a398589d80..b2f826e4074a 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
@@ -8,8 +8,9 @@ E.g., for an Euclidean distance the transformed distance is the squared Euclidea
 
 \cgalRefines{GeneralDistance}
 
-\cgalHasModel `CGAL::Euclidean_distance<Traits>`
-\cgalHasModel `CGAL::Weighted_Minkowski_distance<Traits>`
+\cgalHasModelsBegin CGAL::Euclidean_distance<Traits>
+\cgalHasModels CGAL::Weighted_Minkowski_distance<Traits>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h b/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h
index 5e7e310f0a59..feb9af6f79ed 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h
@@ -8,12 +8,13 @@ range search queries in a model of `SpatialTree`.
 
 \cgalRefines{SearchTraits}
 
-\cgalHasModel `CGAL::Cartesian_d<FT>`
-\cgalHasModel `CGAL::Homogeneous_d<RT>`
-\cgalHasModel `CGAL::Epick_d<DimensionTag>`
-\cgalHasModel `CGAL::Epeck_d<DimensionTag>`
-\cgalHasModel `CGAL::Search_traits_2<Kernel>`
-\cgalHasModel `CGAL::Search_traits_3<Kernel>`
+\cgalHasModelsBegin CGAL::Cartesian_d<FT>
+\cgalHasModels CGAL::Homogeneous_d<RT>
+\cgalHasModels CGAL::Epick_d<DimensionTag>
+\cgalHasModels CGAL::Epeck_d<DimensionTag>
+\cgalHasModels CGAL::Search_traits_2<Kernel>
+\cgalHasModels CGAL::Search_traits_3<Kernel>
+\cgalHasModelsEnd
 
 \sa `SearchTraits`
 \sa `CGAL::Search_traits_adapter<Key,PointPropertyMap,BaseTraits>`
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h
index df585ebf4fc0..96857238a64a 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h
@@ -5,7 +5,7 @@
 The concept `SearchGeomTraits_2` defines the requirements for the template
 parameter of the search traits classes.
 
-\cgalHasModel Any \cgal Kernel
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 */
 
 class SearchGeomTraits_2 {
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h
index 243277705d87..85191a1b0962 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h
@@ -5,7 +5,7 @@
 The concept `SearchGeomTraits_3` defines the requirements for the template
 parameter of the search traits classes.
 
-\cgalHasModel All models of the concept `Kernel`
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 
 */
 
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h b/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h
index 65240b519ce7..6bfe70109e01 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h
@@ -5,14 +5,15 @@
 The concept `SearchTraits` defines the requirements for the template
 parameter of the search classes.
 
-\cgalHasModel `CGAL::Cartesian_d<FT>`
-\cgalHasModel `CGAL::Homogeneous_d<RT>`
-\cgalHasModel `CGAL::Epick_d<DimensionTag>`
-\cgalHasModel `CGAL::Epeck_d<DimensionTag>`
-\cgalHasModel `CGAL::Search_traits_2<Kernel>`
-\cgalHasModel `CGAL::Search_traits_3<Kernel>`
-\cgalHasModel `CGAL::Search_traits_d<Kernel,Dim>`
-\cgalHasModel `CGAL::Search_traits<NT,Point,CartesianCoordinateIterator,ConstructCartesianCoordinateIterator,ConstructMinVertex,ConstructMaxVertex>`
+\cgalHasModelsBegin CGAL::Cartesian_d<FT>
+\cgalHasModels CGAL::Homogeneous_d<RT>
+\cgalHasModels CGAL::Epick_d<DimensionTag>
+\cgalHasModels CGAL::Epeck_d<DimensionTag>
+\cgalHasModels CGAL::Search_traits_2<Kernel>
+\cgalHasModels CGAL::Search_traits_3<Kernel>
+\cgalHasModels CGAL::Search_traits_d<Kernel,Dim>
+\cgalHasModels CGAL::Search_traits<NT,Point,CartesianCoordinateIterator,ConstructCartesianCoordinateIterator,ConstructMinVertex,ConstructMaxVertex>
+\cgalHasModelsEnd
 
 \sa `RangeSearchTraits`
 \sa `CGAL::Search_traits_adapter<Key,PointPropertyMap,BaseTraits>`
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h
index 271d102b0673..ecdc521ce9fe 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h
@@ -11,7 +11,8 @@ space is said to be on the negative side of the separator and the
 other part of space is said to be on the positive side of the
 separator.
 
-\cgalHasModel `CGAL::Plane_separator<FT>`
+\cgalHasModelsBegin CGAL::Plane_separator<FT>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h
index 6ff8b6d31b0d..58d396cec22c 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h
@@ -5,7 +5,8 @@
 The concept `SpatialTree` defines the requirements for a tree supporting
 both neighbor searching and approximate range searching.
 
-\cgalHasModel `CGAL::Kd_tree<Traits,Splitter,UseExtendedNode>`
+\cgalHasModelsBegin CGAL::Kd_tree<Traits,Splitter,UseExtendedNode>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h b/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h
index ee5534298371..88a18887640d 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h
@@ -7,13 +7,14 @@
 The concept `Splitter` defines the requirements for a function object class implementing a splitting rule.
 \cgalAdvancedEnd
 
-\cgalHasModel `CGAL::Fair<Traits, SpatialSeparator>`
-\cgalHasModel `CGAL::Median_of_rectangle<Traits, SpatialSeparator>`
-\cgalHasModel `CGAL::Median_of_max_spread<Traits, SpatialSeparator>`
-\cgalHasModel `CGAL::Midpoint_of_rectangle<Traits, SpatialSeparator>`
-\cgalHasModel `CGAL::Midpoint_of_max_spread<Traits, SpatialSeparator>`
-\cgalHasModel `CGAL::Sliding_fair<Traits, SpatialSeparator>`
-\cgalHasModel `CGAL::Sliding_midpoint<Traits, SpatialSeparator>`
+\cgalHasModelsBegin CGAL::Fair<Traits, SpatialSeparator>
+\cgalHasModels CGAL::Median_of_rectangle<Traits, SpatialSeparator>
+\cgalHasModels CGAL::Median_of_max_spread<Traits, SpatialSeparator>
+\cgalHasModels CGAL::Midpoint_of_rectangle<Traits, SpatialSeparator>
+\cgalHasModels CGAL::Midpoint_of_max_spread<Traits, SpatialSeparator>
+\cgalHasModels CGAL::Sliding_fair<Traits, SpatialSeparator>
+\cgalHasModels CGAL::Sliding_midpoint<Traits, SpatialSeparator>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h
index e2bb9ee88819..8a48e705bd00 100644
--- a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h
+++ b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h
@@ -9,8 +9,8 @@ primitives (objects and predicates) that the sorting algorithms use.
 `SpatialSortingTraits_2` defines the complete set of primitives required in these
 functions and functors.
 
-\cgalHasModel Any \cgal kernel.
-\cgalHasModel `CGAL::Spatial_sort_traits_adapter_2<Base_traits,PointPropertyMap>`
+\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Spatial_sort_traits_adapter_2<Base_traits,PointPropertyMap>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h
index 7fad8da4666d..2cef4c17269a 100644
--- a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h
+++ b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h
@@ -9,8 +9,8 @@ primitives (objects and predicates) that the sorting algorithms use.
 `SpatialSortingTraits_3` defines the complete set of primitives required in these
 functions and functors.
 
-\cgalHasModel Any \cgal kernel.
-\cgalHasModel `CGAL::Spatial_sort_traits_adapter_3<Base_traits,PointPropertyMap>`
+\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Spatial_sort_traits_adapter_3<Base_traits,PointPropertyMap>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h
index c91e76a99cd8..a0c4dfd031d4 100644
--- a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h
+++ b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h
@@ -9,8 +9,8 @@ primitives (objects and predicates) that the sorting algorithms use.
 `SpatialSortingTraits_d` defines the complete set of primitives required in these
 functions and functors.
 
-\cgalHasModel Any \cgal `d`-dimensional kernel.
-\cgalHasModel `CGAL::Spatial_sort_traits_adapter_d<Base_traits,PointPropertyMap>`
+\cgalHasModelsBareBegin{Any \cgal `d`-dimensional kernel.} CGAL::Spatial_sort_traits_adapter_d<Base_traits,PointPropertyMap>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
index d0c364262cbb..15aa1efc7dab 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
@@ -7,7 +7,8 @@
 The concept `PolygonOffsetBuilderTraits_2` describes the requirements for the geometric traits class
 required by the algorithm class `CGAL::Polygon_offset_builder_2`.
 
-\cgalHasModel `CGAL::Polygon_offset_builder_traits_2`
+\cgalHasModelsBegin CGAL::Polygon_offset_builder_traits_2
+\cgalHasModelsEnd
 
 \sa `CGAL::Polygon_offset_builder_2<Ss,Traits,Container>`
 */
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
index f971c1c880c2..a19486171c43 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
@@ -7,7 +7,8 @@
 The concept `StraightSkeletonBuilderTraits_2` describes the requirements
 for the geometric traits class required by the algorithm class `CGAL::Straight_skeleton_builder_2`.
 
-\cgalHasModel `CGAL::Straight_skeleton_builder_traits_2<K>`
+\cgalHasModelsBegin CGAL::Straight_skeleton_builder_traits_2<K>
+\cgalHasModelsEnd
 */
 class StraightSkeletonBuilderTraits_2 {
 public:
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h
index 4860b9ab6b83..316fbc4b0e04 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h
@@ -5,7 +5,8 @@
 The concept `StraightSkeletonBuilder_2_Visitor` describes the requirements of the visitor class
 required by the algorithm class `CGAL::Straight_skeleton_builder_2` in its third template parameter.
 
-\cgalHasModel `CGAL::Dummy_straight_skeleton_builder_2_visitor`
+\cgalHasModelsBegin CGAL::Dummy_straight_skeleton_builder_2_visitor
+\cgalHasModelsEnd
 
 \sa `CGAL::Straight_skeleton_builder_2`
 */
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h
index 311987667fb9..16bf5a396b50 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h
@@ -8,7 +8,8 @@ The concept `StraightSkeletonFace_2` describes the requirements for the face typ
 `StraightSkeleton_2` concept. It is a refinement of the `HalfedgeDSFace` concept
 with support for storage of the incident halfedge.
 
-\cgalHasModel `CGAL::Straight_skeleton_face_base_2`
+\cgalHasModelsBegin CGAL::Straight_skeleton_face_base_2
+\cgalHasModelsEnd
 
 \sa `StraightSkeletonVertex_2`
 \sa `StraightSkeletonHalfedge_2`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h
index 6225e4f613f8..22caa9419c04 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h
@@ -12,7 +12,8 @@ The only geometric embedding used by the Straight Skeleton Data Structure are th
 in the contour and skeleton vertices. However, for any halfedge, there is a 2D segment implicitly
 given by its `source` and `target` vertices.
 
-\cgalHasModel `CGAL::Straight_skeleton_halfedge_base_2`
+\cgalHasModelsBegin CGAL::Straight_skeleton_halfedge_base_2
+\cgalHasModelsEnd
 
 \sa `StraightSkeleton_2`
 \sa `StraightSkeletonHalfedge_2`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h
index 55f5c799095f..a95688dc6e78 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h
@@ -6,7 +6,8 @@ The concept `StraightSkeletonItemsConverter_2` describes the requirements for it
 as the third template argument to the class `Straight_skeleton_converter_2<SrcSs,TgtSs,ItemsConverter>`.
 It converts the `HDS` items from one type of straight skeleton to another.
 
-\cgalHasModel `CGAL::Straight_skeleton_items_converter_2`
+\cgalHasModelsBegin CGAL::Straight_skeleton_items_converter_2
+\cgalHasModelsEnd
 
 \sa `CGAL::Straight_skeleton_converter_2<SrcSs,TgtSs,ItemsCvt>`
 */
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
index 7a26285dccfc..a53a002940ef 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
@@ -9,7 +9,8 @@ The concept `StraightSkeletonVertex_2` describes the requirements for the vertex
 with support for storage of the incident halfedge. The `StraightSkeletonVertex_2` concept
 requires the geometric embedding to be a 2D point.
 
-\cgalHasModel `CGAL::Straight_skeleton_vertex_base_2`
+\cgalHasModelsBegin CGAL::Straight_skeleton_vertex_base_2
+\cgalHasModelsEnd
 
 \sa `StraightSkeletonHalfedge_2`
 \sa `StraightSkeletonFace_2`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h
index 18a85973c5ba..52dcfe61484e 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h
@@ -9,7 +9,8 @@ used to represent a straight skeleton. It refines the concept
 `HalfedgeDS` and adds additional requirements on the nested types
 `Vertex`, `Halfedge`, and `Face` of the halfedge data structure.
 
-\cgalHasModel `CGAL::Straight_skeleton_2`
+\cgalHasModelsBegin CGAL::Straight_skeleton_2
+\cgalHasModelsEnd
 
 \attention This concept explicitly protects all the modifying
 operations of the base `HalfedgeDS` concept. Only the algorithm
diff --git a/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h b/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h
index ec96722d9262..6f001fda04ee 100644
--- a/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h
@@ -9,8 +9,9 @@ the second template parameter of the class
 provides the operation that integrates a new point from a given point
 with a predefined step, and according to a specified vector.
 
-\cgalHasModel `CGAL::Euler_integrator_2<VectorField_2>`
-\cgalHasModel `CGAL::Runge_kutta_integrator_2<VectorField_2>`
+\cgalHasModelsBegin CGAL::Euler_integrator_2<VectorField_2>
+\cgalHasModels CGAL::Runge_kutta_integrator_2<VectorField_2>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h b/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h
index a55c74b6ac2c..e1394b709454 100644
--- a/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h
@@ -9,7 +9,7 @@ the template parameter of the class
 This concept provides the types handled by the
 `CGAL::Stream_lines_2<VectorField_2, Integrator_2>` class.
 
-\cgalHasModel The kernels of \cgal are models for this traits class.
+\cgalHasModelsBare{The kernels of \cgal are models for this traits class.}
 
 */
 class StreamLinesTraits_2 {
diff --git a/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h b/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h
index 9b44da48a2f7..b42a88dba950 100644
--- a/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h
@@ -9,8 +9,9 @@ the first template parameter of the class
 provides the types of the geometric primitives used in the placement
 of streamlines and some functions for answering different queries.
 
-\cgalHasModel `CGAL::Regular_grid_2<StreamLinesTraits_2>`
-\cgalHasModel `CGAL::Triangular_field_2<StreamLinesTraits_2>`
+\cgalHasModelsBegin CGAL::Regular_grid_2<StreamLinesTraits_2>
+\cgalHasModels CGAL::Triangular_field_2<StreamLinesTraits_2>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h
index c5a06d956182..2a0e662a0e82 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h
@@ -11,7 +11,8 @@ policy concept of geometric computations is used in
 
 \cgalRefines{SubdivisionMask_3}
 
-\cgalHasModel `CGAL::DooSabin_mask_3<PolygonMesh, VertexPointMap>`
+\cgalHasModelsBegin CGAL::DooSabin_mask_3<PolygonMesh, VertexPointMap>
+\cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
 
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h
index bb28f171b025..22c59d45ad22 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h
@@ -11,7 +11,8 @@ policy concept of geometric computations is used in
 
 \cgalRefines{SubdivisionMask_3}
 
-\cgalHasModel `CGAL::CatmullClark_mask_3<PolygonMesh, VertexPointMap>`
+\cgalHasModelsBegin CGAL::CatmullClark_mask_3<PolygonMesh, VertexPointMap>
+\cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
 
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h
index 6050b444ad3e..2faff045bd6d 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h
@@ -10,7 +10,8 @@ policy concept of geometric computations is used in
 
 \cgalRefines{SubdivisionMask_3}
 
-\cgalHasModel `CGAL::Loop_mask_3<PolygonMesh, VertexPointMap>`
+\cgalHasModelsBegin CGAL::Loop_mask_3<PolygonMesh, VertexPointMap>
+\cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
 */
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h
index ee5fc38d9079..ed311db671a3 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h
@@ -9,7 +9,8 @@ policy concept of geometric computations is used in
 
 \cgalRefines{SubdivisionMask_3}
 
-\cgalHasModel `CGAL::Sqrt3_mask_3<PolygonMesh, VertexPointMap>`
+\cgalHasModelsBegin CGAL::Sqrt3_mask_3<PolygonMesh, VertexPointMap>
+\cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
 
diff --git a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h
index f84b271c2899..68364e07863a 100644
--- a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h
+++ b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h
@@ -6,8 +6,9 @@ The concept `ErrorMetricProxy` defines the notion of proxy,
 computes the fitting error from a face to a proxy,
 and fits a proxy from a range of faces.
 
-\cgalHasModel `CGAL::Surface_mesh_approximation::L21_metric_plane_proxy`
-\cgalHasModel `CGAL::Surface_mesh_approximation::L2_metric_plane_proxy`
+\cgalHasModelsBegin CGAL::Surface_mesh_approximation::L21_metric_plane_proxy
+\cgalHasModels CGAL::Surface_mesh_approximation::L2_metric_plane_proxy
+\cgalHasModelsEnd
 */
 
 class ErrorMetricProxy {
diff --git a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
index a8dbb00b46b7..65137707986d 100644
--- a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
+++ b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
@@ -9,8 +9,9 @@ to implement models of this concept.
 
 \cgalRefines{DefaultConstructible}
 
-\cgalHasModel `CGAL::Deformation_Eigen_closest_rotation_traits_3`
-\cgalHasModel `CGAL::Deformation_Eigen_polar_closest_rotation_traits_3`
+\cgalHasModelsBegin CGAL::Deformation_Eigen_closest_rotation_traits_3
+\cgalHasModels CGAL::Deformation_Eigen_polar_closest_rotation_traits_3
+\cgalHasModelsEnd
 
 */
 class DeformationClosestRotationTraits_3{
diff --git a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h
index 32a71b17f71d..67002d031aec 100644
--- a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h
+++ b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h
@@ -12,16 +12,17 @@ the border of a given mesh.
 
 Construction and destruction are undefined.
 
-\cgalHasModel `CGAL::Surface_mesh_parameterization::Fixed_border_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>`
-\cgalHasModel `CGAL::Surface_mesh_parameterization::ARAP_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>`
-\cgalHasModel `CGAL::Surface_mesh_parameterization::Barycentric_mapping_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>`
-\cgalHasModel `CGAL::Surface_mesh_parameterization::Discrete_authalic_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>`
-\cgalHasModel `CGAL::Surface_mesh_parameterization::Discrete_conformal_map_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>`
-\cgalHasModel `CGAL::Surface_mesh_parameterization::LSCM_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>`
-\cgalHasModel `CGAL::Surface_mesh_parameterization::Mean_value_coordinates_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>`
-\cgalHasModel `CGAL::Surface_mesh_parameterization::Circular_border_parameterizer_3<TriangleMesh>`
-\cgalHasModel `CGAL::Surface_mesh_parameterization::Square_border_parameterizer_3<TriangleMesh>`
-\cgalHasModel `CGAL::Surface_mesh_parameterization::Two_vertices_parameterizer_3<TriangleMesh>`
+\cgalHasModelsBegin CGAL::Surface_mesh_parameterization::Fixed_border_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
+\cgalHasModels CGAL::Surface_mesh_parameterization::ARAP_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
+\cgalHasModels CGAL::Surface_mesh_parameterization::Barycentric_mapping_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
+\cgalHasModels CGAL::Surface_mesh_parameterization::Discrete_authalic_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
+\cgalHasModels CGAL::Surface_mesh_parameterization::Discrete_conformal_map_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
+\cgalHasModels CGAL::Surface_mesh_parameterization::LSCM_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
+\cgalHasModels CGAL::Surface_mesh_parameterization::Mean_value_coordinates_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
+\cgalHasModels CGAL::Surface_mesh_parameterization::Circular_border_parameterizer_3<TriangleMesh>
+\cgalHasModels CGAL::Surface_mesh_parameterization::Square_border_parameterizer_3<TriangleMesh>
+\cgalHasModels CGAL::Surface_mesh_parameterization::Two_vertices_parameterizer_3<TriangleMesh>
+\cgalHasModelsEnd
 
 \sa `CGAL::Surface_mesh_parameterization::Orbifold_Tutte_parameterizer_3<SeamMesh, SolverTraits>`
 */
diff --git a/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h b/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h
index 93450589cfcf..2e0a58fa0a28 100644
--- a/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h
+++ b/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h
@@ -5,7 +5,7 @@
 The concept `SegmentationGeomTraits` describes the set of requirements
 of the geometric traits needed by the segmentation functions.
 
-\cgalHasModel All the \cgal Kernels
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 
 \cgalRefines{AABBGeomTraits}
 
diff --git a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
index 652c3457496d..51d4ae712eb6 100644
--- a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
+++ b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
@@ -8,7 +8,8 @@ predicates, and constructions required by the traits class parameter of
 `CGAL::Surface_mesh_shortest_path`.
 
 \cgalRefines{CopyConstructible,Assignable}
-\cgalHasModel `CGAL::Surface_mesh_shortest_path_traits<K,P>`
+\cgalHasModelsBegin CGAL::Surface_mesh_shortest_path_traits<K,P>
+\cgalHasModelsEnd
 
 */
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
index 24a05f636c29..f31143efcc62 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
@@ -12,9 +12,10 @@ or can be intentionally returned to prevent the edge from being collapsed.
 
 \cgalRefines{DefaultConstructible,CopyConstructible}
 
-\cgalHasModel `CGAL::Surface_mesh_simplification::Edge_length_cost<TriangleMesh>`
-\cgalHasModel `CGAL::Surface_mesh_simplification::LindstromTurk_cost<TriangleMesh>`
-\cgalHasModel `CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>`
+\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Edge_length_cost<TriangleMesh>
+\cgalHasModels CGAL::Surface_mesh_simplification::LindstromTurk_cost<TriangleMesh>
+\cgalHasModels CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>
+\cgalHasModelsEnd
 
 */
 class GetCost
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
index e576472cb34e..bb66ff08d050 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
@@ -14,11 +14,12 @@ or can be intentionally returned to prevent the edge from being collapsed.
 
 \cgalRefines{DefaultConstructible,CopyConstructible}
 
-\cgalHasModel `CGAL::Surface_mesh_simplification::Midpoint_placement<TriangleMesh>`
-\cgalHasModel `CGAL::Surface_mesh_simplification::LindstromTurk_placement<TriangleMesh>`
-\cgalHasModel `CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>`
-\cgalHasModel `CGAL::Surface_mesh_simplification::Bounded_normal_change_placement<Placement>`
-\cgalHasModel `CGAL::Surface_mesh_simplification::Constrained_placement<Placement>`
+\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Midpoint_placement<TriangleMesh>
+\cgalHasModels CGAL::Surface_mesh_simplification::LindstromTurk_placement<TriangleMesh>
+\cgalHasModels CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>
+\cgalHasModels CGAL::Surface_mesh_simplification::Bounded_normal_change_placement<Placement>
+\cgalHasModels CGAL::Surface_mesh_simplification::Constrained_placement<Placement>
+\cgalHasModelsEnd
 */
 
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
index 324c87f45ee7..b66544074009 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
@@ -14,8 +14,9 @@ be absent). The value `boost::none` indicates that the edge should not be collap
 
 \cgalRefines{DefaultConstructible,CopyConstructible}
 
-\cgalHasModel `CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<BasePlacementFilter>`
-\cgalHasModel `CGAL::Surface_mesh_simplification::Polyhedral_envelope_filter<GeomTraits, BasePlacementFilter>`
+\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<BasePlacementFilter>
+\cgalHasModels CGAL::Surface_mesh_simplification::Polyhedral_envelope_filter<GeomTraits, BasePlacementFilter>
+\cgalHasModelsEnd
 */
 
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h
index ad5f22d4ccb3..df8fc845f5b4 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h
@@ -4,11 +4,12 @@
 
 The concept `StopPredicate` describes the requirements for the predicate which indicates if the simplification process must finish.
 
-\cgalHasModel `CGAL::Surface_mesh_simplification::Edge_count_stop_predicate<TriangleMesh>`
-\cgalHasModel `CGAL::Surface_mesh_simplification::Face_count_stop_predicate<TriangleMesh>`
-\cgalHasModel `CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<TriangleMesh>`
-\cgalHasModel `CGAL::Surface_mesh_simplification::Face_count_ratio_stop_predicate<TriangleMesh>`
-\cgalHasModel `CGAL::Surface_mesh_simplification::Edge_length_stop_predicate<FT>`
+\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Edge_count_stop_predicate<TriangleMesh>
+\cgalHasModels CGAL::Surface_mesh_simplification::Face_count_stop_predicate<TriangleMesh>
+\cgalHasModels CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<TriangleMesh>
+\cgalHasModels CGAL::Surface_mesh_simplification::Face_count_ratio_stop_predicate<TriangleMesh>
+\cgalHasModels CGAL::Surface_mesh_simplification::Edge_length_stop_predicate<FT>
+\cgalHasModelsEnd
 
 */
 class StopPredicate {
diff --git a/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h b/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h
index 824b21454e51..b7466a2ecd45 100644
--- a/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h
+++ b/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h
@@ -5,7 +5,7 @@
  *
  * Traits class concept defining the requirements of the class `CGAL::Mean_curvature_flow_skeletonization`.
  *
- * \cgalHasModel Any \cgal `Kernel` with `double` as `%Kernel::%FT`
+ * \cgalHasModelsBare{Any \cgal `Kernel` with `double` as `%Kernel::%FT`}
  *
  *
  */
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h
index 01c344d316cb..6f6355c93901 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h
@@ -9,8 +9,8 @@
 
   \cgalRefines{GenericMap}
 
-  \cgalHasModel \link CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map<Items,Alloc>`\endlink
-  \cgalHasModel \link CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map<Items,Alloc>`\endlink
+  \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map<Items,Alloc>`\endlink\n
+                \link CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map<Items,Alloc>`\endlink}
   */
 
 class PolygonalSchema
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h
index 8ee52354e37e..0bf077baf427 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h
@@ -6,7 +6,7 @@
 
   \cgalRefines{GenericMapItems}
 
-  \cgalHasModel \link CGAL::Surface_mesh_topology::Polygonal_schema_min_items `CGAL::Surface_mesh_topology::Polygonal_schema_min_items`\endlink
+  \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Polygonal_schema_min_items `CGAL::Surface_mesh_topology::Polygonal_schema_min_items`\endlink}
   */
 
 class PolygonalSchemaItems
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h
index 0062dd18e484..4650a313f02a 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h
@@ -5,8 +5,8 @@
 The concept `WeightFunctor` defines a functor to calculate the weight of an edge.
 
 
-  \cgalHasModel \link CGAL::Surface_mesh_topology::Unit_weight_functor `CGAL::Surface_mesh_topology::Unit_weight_functor`\endlink
-  \cgalHasModel \link CGAL::Surface_mesh_topology::Euclidean_length_weight_functor `CGAL::Surface_mesh_topology::Euclidean_length_weight_functor<Mesh>`\endlink
+  \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Unit_weight_functor `CGAL::Surface_mesh_topology::Unit_weight_functor`\endlink,
+               \link CGAL::Surface_mesh_topology::Euclidean_length_weight_functor `CGAL::Surface_mesh_topology::Euclidean_length_weight_functor<Mesh>`\endlink}
 */
 class WeightFunctor {
 public:
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h
index a713151a311d..319bf352f0c6 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h
@@ -7,8 +7,8 @@ The concept `ImplicitFunction` describes a function object
 whose `operator()` computes the values of a function
 \f$ f : \mathbb{R}^3 \longrightarrow \mathbb{R}\f$.
 
-\cgalHasModel CGAL::Gray_level_image_3
-\cgalHasModel any pointer to a function of type `FT (*)(Point)`
+\cgalHasModelsBareBegin{any pointer to a function of type `FT (*)(Point)`} CGAL::Gray_level_image_3
+\cgalHasModelsEnd
 
 \sa `CGAL::Implicit_surface_3<Traits, Function>`
 \sa `CGAL::make_surface_mesh()`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h
index fed39a225af3..28814f2648ea 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h
@@ -15,7 +15,7 @@ the concept `ImplicitSurfaceTraits_3` provides the types, predicates and constru
 that are passed
 to the generated model of `SurfaceMeshTraits_3`.
 
-\cgalHasModel Any \cgal Kernel.
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 
 \sa `CGAL::Implicit_surface_3<Traits, Function>`
 \sa `CGAL::make_surface_mesh()`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h
index f418f71e47b7..1b16bc506f14 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h
@@ -37,8 +37,9 @@ of the restriction to the surface of a three dimensional
 triangulation.  In the following we call surface center of a facet,
 the center of its biggest Delaunay surface ball.
 
-\cgalHasModel `CGAL::Surface_mesh_cell_base_3<Gt,Vb>`
-\cgalHasModel `CGAL::Surface_mesh_default_triangulation_3::Cell`
+\cgalHasModelsBegin CGAL::Surface_mesh_cell_base_3<Gt,Vb>
+\cgalHasModels CGAL::Surface_mesh_default_triangulation_3::Cell
+\cgalHasModelsEnd
 
 \sa `SurfaceMeshTriangulation_3`
 \sa `SurfaceMeshComplex_2InTriangulation_3`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h
index 1f8cb4f169f1..ec9eba193720 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h
@@ -30,7 +30,8 @@ A model of this concept is a type to be plugged as first template
 parameter in the
 function template `CGAL::make_surface_mesh()`.
 
-\cgalHasModel `CGAL::Surface_mesh_complex_2_in_triangulation_3<Tr>`
+\cgalHasModelsBegin CGAL::Surface_mesh_complex_2_in_triangulation_3<Tr>
+\cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
 
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h
index 28b866387ea1..7380607aca07 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h
@@ -33,7 +33,8 @@ is just a lexicographical comparison. The meshing algorithm handles facets
 with lowest quality first. The qualities are computed by a function
 `is_bad(const Facet& f, const Quality& q)`.
 
-\cgalHasModel `CGAL::Surface_mesh_default_criteria_3<Tr>`
+\cgalHasModelsBegin CGAL::Surface_mesh_default_criteria_3<Tr>
+\cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
 
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h
index 15d0256b2bc7..dd728781a7f7 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h
@@ -11,7 +11,8 @@ and to compute some intersection
 points if any exists. The concept `SurfaceMeshTraits_3` also includes a funcctor able to provide
 a small set of initial points on the surface.
 
-\cgalHasModel `CGAL::Surface_mesh_traits_generator_3::type`
+\cgalHasModelsBegin CGAL::Surface_mesh_traits_generator_3::type
+\cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
 
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h
index 7d502a9bf413..7af1aba64cae 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h
@@ -17,7 +17,7 @@ the requirements for the triangulation type
 plugged in the class
 `CGAL::Surface_mesh_complex_2_in_triangulation_3<Tr>`.
 
-\cgalHasModel Any 3D Delaunay triangulation class of \cgal
+\cgalHasModelsBare{Any 3D Delaunay triangulation class of \cgal}
 
 \sa `CGAL::Triangulation_3<TriangulationTraits_3,TriangulationDataStructure_3>`
 \sa `CGAL::Delaunay_triangulation_3<DelaunayTriangulationTraits_3,TriangulationDataStructure_3>`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h
index 5e1f3b3098dc..086b7759ac90 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h
@@ -31,8 +31,9 @@ integers, which, when they are valid, store respectively the number of
 complex facets incident to the vertex and the number of connected
 components of the adjacency graph of those facets.
 
-\cgalHasModel `CGAL::Surface_mesh_vertex_base_3<Gt,Vb>`
-\cgalHasModel `CGAL::Surface_mesh_default_triangulation_3::Vertex`
+\cgalHasModelsBegin CGAL::Surface_mesh_vertex_base_3<Gt,Vb>
+\cgalHasModels CGAL::Surface_mesh_default_triangulation_3::Vertex
+\cgalHasModelsEnd
 
 \sa `SurfaceMeshComplex_2InTriangulation_3`
 \sa `CGAL::Surface_mesh_complex_2_in_triangulation_3<Tr>`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h
index 6e0694fda562..0e5cca74dfef 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h
@@ -8,7 +8,8 @@ The surface types
 are required to be copy constructible
 and assignable.
 
-\cgalHasModel `CGAL::Implicit_surface_3<Traits, Function>`
+\cgalHasModelsBegin CGAL::Implicit_surface_3<Traits, Function>
+\cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
 \sa `SurfaceMeshTraits_3`
diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h
index d3bc61921c50..e10d068c1b1a 100644
--- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h
+++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h
@@ -48,7 +48,8 @@ that the `CGAL::Triangulation_data_structure_2`
 actually uses as a base class for the class
 `CGAL::Triangulation_data_structure_2::Face`.
 
-\cgalHasModel `CGAL::Triangulation_ds_face_base_2<TDS>`
+\cgalHasModelsBegin CGAL::Triangulation_ds_face_base_2<TDS>
+\cgalHasModelsEnd
 
 \sa `TriangulationDSVertexBase_2`
 \sa `CGAL::Triangulation_data_structure_2<Vb,Fb>`
diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h
index 8402f4f4442c..e47b7cfbf3f8 100644
--- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h
+++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h
@@ -44,7 +44,8 @@ that the `CGAL::Triangulation_data_structure_2`
 actually uses as a base class for the class
 of `CGAL::Triangulation_data_structure_2::Vertex`.
 
-\cgalHasModel `CGAL::Triangulation_ds_vertex_base_2<Tds>`
+\cgalHasModelsBegin CGAL::Triangulation_ds_vertex_base_2<Tds>
+\cgalHasModelsEnd
 
 \sa `TriangulationDSFaceBase_2`
 \sa `CGAL::Triangulation_data_structure_2<Vb,Fb>`
diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
index b2c1b5a0886c..a5daedcbc28e 100644
--- a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
+++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
@@ -64,7 +64,8 @@ the rank of this item in the output order.
 When dimension \f$ <\f$ 2, the same information is output
 for faces of maximal dimension instead of faces.
 
-\cgalHasModel `CGAL::Triangulation_data_structure_2<Vb,Fb>`
+\cgalHasModelsBegin CGAL::Triangulation_data_structure_2<Vb,Fb>
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2::Face`
 \sa `TriangulationDataStructure_2::Vertex`
@@ -726,7 +727,8 @@ In order to obtain new vertices or destruct unused vertices, the user must
 call the `create_vertex()` and `delete_vertex()` methods of the
 triangulation data structure.
 
-\cgalHasModel `CGAL::Triangulation_ds_vertex_base_2<Tds>`
+\cgalHasModelsBegin CGAL::Triangulation_ds_vertex_base_2<Tds>
+\cgalHasModelsEnd
 
 \sa `TriangulationDSVertexBase_2`
 \sa `TriangulationDataStructure_2::Face`
@@ -847,7 +849,8 @@ The methods `create_face()` and
 have to be used to
 define new faces and to delete no longer used faces.
 
-\cgalHasModel `CGAL::Triangulation_ds_face_base_2<Tds>`
+\cgalHasModelsBegin CGAL::Triangulation_ds_face_base_2<Tds>
+\cgalHasModelsEnd
 
 \sa `TriangulationDSFaceBase_2`
 \sa `TriangulationDataStructure_2`
diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h
index 4ce03689c740..59f5b45bbe2a 100644
--- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h
+++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h
@@ -33,7 +33,8 @@ cell classes. The <I>rebound</I> base classes so obtained are the classes
 which are used as base classes for the final vertex and cell classes.
 More information can be found in Section \ref TDS3secdesign.
 
-\cgalHasModel `CGAL::Triangulation_ds_cell_base_3<TDS>`
+\cgalHasModelsBegin CGAL::Triangulation_ds_cell_base_3<TDS>
+\cgalHasModelsEnd
 
 \sa `TriangulationDSVertexBase_3`
 \sa `CGAL::Triangulation_data_structure_3<Vb,Cb>`
diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h
index eef2cf0d3d4f..9ef2cd34bbc6 100644
--- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h
+++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h
@@ -28,7 +28,8 @@ cell classes. The <I>rebound</I> base classes so obtained are the classes which
 are used as base classes for the final vertex and cell classes.
 More information can be found in Section \ref TDS3secdesign.
 
-\cgalHasModel `CGAL::Triangulation_ds_vertex_base_3<TDS>`
+\cgalHasModelsBegin CGAL::Triangulation_ds_vertex_base_3<TDS>
+\cgalHasModelsEnd
 
 \sa `TriangulationDSCellBase_3`
 \sa `CGAL::Triangulation_data_structure_3<Vb,Cb>`
diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
index 081f9f985138..a2c6d41e9334 100644
--- a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
+++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
@@ -65,7 +65,8 @@ neighbors of each cell, where the index corresponds to the preceding
 list of cells. When dimension < 3, the same information is stored
 for faces of maximal dimension instead of cells.
 
-\cgalHasModel `CGAL::Triangulation_data_structure_3<Vb, Cb>`
+\cgalHasModelsBegin CGAL::Triangulation_data_structure_3<Vb, Cb>
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_3::Vertex`
 \sa `TriangulationDataStructure_3::Cell`
diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h
index 01d05c5c873d..aa3f4d68dc1c 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h
@@ -6,7 +6,8 @@
 
 Cell base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`.
 
-\cgalHasModel `CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3`
+\cgalHasModelsBegin CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3
+\cgalHasModelsEnd
 
 */
 class RemeshingCellBase_3
diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h
index d275fbc03a71..ad71f044d997 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h
@@ -10,7 +10,7 @@ of the class `Remeshing_triangulation_3`. It defines the geometric objects
 (points, segments, triangles, and tetrahedra) forming the triangulation together with a few
 geometric predicates and constructions on these objects.
 
-\cgalHasModel All models of `Kernel`.
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 
 \sa `CGAL::Triangulation_3`
 */
diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h
index 0e9b0e86003e..2b1b5bc8fc3f 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h
@@ -6,7 +6,8 @@
 
 Vertex base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`.
 
-\cgalHasModel `Tetrahedral_remeshing::Remeshing_vertex_base_3`
+\cgalHasModelsBegin Tetrahedral_remeshing::Remeshing_vertex_base_3
+\cgalHasModelsEnd
 
 */
 class RemeshingVertexBase_3
diff --git a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h
index 670217bb50db..14395b71b936 100644
--- a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h
+++ b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h
@@ -9,8 +9,9 @@ a Delaunay triangulation. It corresponds to the first template parameter of the
 
 \cgalRefines{TriangulationTraits}
 
-\cgalHasModel `CGAL::Epick_d<Dim>`
-\cgalHasModel `CGAL::Epeck_d<Dim>`
+\cgalHasModelsBegin CGAL::Epick_d<Dim>
+\cgalHasModels CGAL::Epeck_d<Dim>
+\cgalHasModelsEnd
 
 \sa `TriangulationTraits`
 */
diff --git a/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h
index 00ec18a9e8cd..35b31839b7ab 100644
--- a/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h
+++ b/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h
@@ -9,8 +9,9 @@ a regular triangulation. It corresponds to the first template parameter of the c
 
 \cgalRefines{TriangulationTraits}
 
-\cgalHasModel `CGAL::Epick_d<Dim>`
-\cgalHasModel `CGAL::Epeck_d<Dim>`
+\cgalHasModelsBegin CGAL::Epick_d<Dim>
+\cgalHasModels CGAL::Epeck_d<Dim>
+\cgalHasModelsEnd
 
 \sa `TriangulationTraits`
 */
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h
index 24188ada1035..d92afbd427e6 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h
@@ -15,7 +15,8 @@ The dimension of a face is implicitly set when
 `TriangulationDSFace::set_index` is called two times to set the
 first two vertices (`i = 0` and `i = 1`), then the dimension is 1.
 
-\cgalHasModel `CGAL::Triangulation_face<TriangulationDataStructure_>`
+\cgalHasModelsBegin CGAL::Triangulation_face<TriangulationDataStructure_>
+\cgalHasModelsEnd
 
 \sa `TriangulationDSFullCell`
 \sa `TriangulationDSVertex`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h
index a29eef833969..3e32c2423a22 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h
@@ -36,8 +36,9 @@ of `CGAL::Triangulation_data_structure::Vertex`.
 
 \cgalRefines{TriangulationDataStructure::FullCell}
 
-\cgalHasModel `CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>`
-\cgalHasModel `CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>`
+\cgalHasModelsBegin CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>
+\cgalHasModels CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>
+\cgalHasModelsEnd
 
 \sa `TriangulationDSVertex`
 \sa `TriangulationDSFace`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h
index 30b22c4994b0..c23aaabe1ea7 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h
@@ -36,8 +36,9 @@ of `CGAL::Triangulation_data_structure::Vertex`.
 
 \cgalRefines{TriangulationDataStructure::Vertex}
 
-\cgalHasModel `CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>`
-\cgalHasModel `CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>`
+\cgalHasModelsBegin CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>
+\cgalHasModels CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>
+\cgalHasModelsEnd
 
 \sa `TriangulationDSFullCell`
 \sa `TriangulationDSFace`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
index 3e3228db4c99..c17ded6feb1e 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
@@ -69,7 +69,8 @@ The classes `Vertex` and
 `Full_cell` have to provide the relevant I/O operators
 (possibly empty).
 
-\cgalHasModel `CGAL::Triangulation_data_structure<Dimensionality, TriangulationDSVertex_, TriangulationDSFullCell_>`
+\cgalHasModelsBegin CGAL::Triangulation_data_structure<Dimensionality, TriangulationDSVertex_, TriangulationDSFullCell_>
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure::Vertex`
 \sa `TriangulationDataStructure::FullCell`
@@ -660,8 +661,9 @@ It sets requirements of combinatorial nature
 only, as geometry is not concerned here. In particular, we only require that
 the vertex holds a handle to a full cell incident to it in the triangulation.
 
-\cgalHasModel `CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>`
-\cgalHasModel `CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>`
+\cgalHasModelsBegin CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>
+\cgalHasModels CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure::FullCell`
 \sa `TriangulationDataStructure::Face`
@@ -767,8 +769,9 @@ full cell as well as handles to the adjacent full cells. Two full cells
 are said to be adjacent when they share a facet. Adjacent full cells are
 called hereafter neighbors.
 
-\cgalHasModel `CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>`
-\cgalHasModel `CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>`
+\cgalHasModelsBegin CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>
+\cgalHasModels CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure::FullCell`
 \sa `TriangulationDataStructure::Face`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h
index 74750c4117a2..eba0214810a1 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h
@@ -10,7 +10,8 @@ represent a full cell.
 \cgalRefines{TriangulationDSFullCell We only list below the
 additional specific requirements of `TriangulationFullCell`}
 
-\cgalHasModel `CGAL::Triangulation_full_cell<TriangulationTraits_, TriangulationDSFullCell_>`
+\cgalHasModelsBegin CGAL::Triangulation_full_cell<TriangulationTraits_, TriangulationDSFullCell_>
+\cgalHasModelsEnd
 
 \sa `CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>`
 \sa `TriangulationVertex`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h
index 87018c11c3ce..3d004b52c286 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h
@@ -14,8 +14,9 @@ traits must refine `SpatialSortingTraits_d`. The insertion is
 then optimized using spatial sorting.
 This is not required if the points are inserted one by one.
 
-\cgalHasModel `CGAL::Epick_d<Dim>`
-\cgalHasModel `CGAL::Epeck_d<Dim>`
+\cgalHasModelsBegin CGAL::Epick_d<Dim>
+\cgalHasModels CGAL::Epeck_d<Dim>
+\cgalHasModelsEnd
 
 \sa `DelaunayTriangulationTraits`
 */
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h b/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h
index 0ea829717934..956acd269f14 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h
@@ -12,7 +12,8 @@ We only list below the additional specific requirements of ::TriangulationVertex
 Compared to ::TriangulationDSVertex, the main difference is the addition of
 an association of the vertex with a geometric point.
 
-\cgalHasModel `CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>`
+\cgalHasModelsBegin CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>
+\cgalHasModelsEnd
 
 \cgalHeading{Input/Output}
 
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h
index f0483d539cc8..bf4b52d43c46 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h
@@ -17,10 +17,10 @@ The concept `ConstrainedDelaunayTriangulationTraits_2` refines both the concept
 
 \cgalRefines{DelaunayTriangulationTraits_2,ConstrainedTriangulationTraits_2}
 
-\cgalHasModel All \cgal Kernels
-\cgalHasModel `CGAL::Projection_traits_xy_3<K>`
-\cgalHasModel `CGAL::Projection_traits_yz_3<K>`
-\cgalHasModel `CGAL::Projection_traits_xz_3<K>`
+\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_xy_3<K>
+\cgalHasModels CGAL::Projection_traits_yz_3<K>
+\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsEnd
 
 
 \sa `TriangulationTraits_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h
index 1d49d678c471..a5a98882faa6 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h
@@ -19,7 +19,8 @@ constraints.
 
 Defines the same types as the `TriangulationFaceBase_2` concept
 
-\cgalHasModel `CGAL::Constrained_triangulation_face_base_2<Traits>`
+\cgalHasModelsBegin CGAL::Constrained_triangulation_face_base_2<Traits>
+\cgalHasModelsEnd
 
 \sa `TriangulationFaceBase_2`
 \sa `CGAL::Constrained_triangulation_2<Traits,Tds>`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
index 6f7a9e5ea858..0af956128561 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
@@ -19,11 +19,11 @@ to compute the squared distance between a point and a line
 
 \cgalRefines{TriangulationTraits_2}
 
-\cgalHasModel All \cgal Kernels
-\cgalHasModel `CGAL::Projection_traits_3<K>`
-\cgalHasModel `CGAL::Projection_traits_xy_3<K>`
-\cgalHasModel `CGAL::Projection_traits_yz_3<K>`
-\cgalHasModel `CGAL::Projection_traits_xz_3<K>`
+\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_3<K>
+\cgalHasModels CGAL::Projection_traits_xy_3<K>
+\cgalHasModels CGAL::Projection_traits_yz_3<K>
+\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsEnd
 
 \sa `TriangulationTraits_2`
 \sa `ConstrainedDelaunayTriangulationTraits_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h
index 32b251a50604..d223c281d3c0 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h
@@ -22,12 +22,12 @@ required if the  method `nearest_vertex()` is used.
 \cgalRefines{TriangulationTraits_2}
 
 
-\cgalHasModel \cgal kernels
-\cgalHasModel `CGAL::Projection_traits_3<K>` (not for dual Voronoi functions)
-\cgalHasModel `CGAL::Projection_traits_xy_3<K>` (not for dual Voronoi functions)
-\cgalHasModel `CGAL::Projection_traits_xy_3<K>` (not for dual Voronoi functions)
-\cgalHasModel `CGAL::Projection_traits_yz_3<K>` (not for dual Voronoi functions)
-\cgalHasModel `CGAL::Projection_traits_xz_3<K>` (not for dual Voronoi functions)
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`\n
+              `CGAL::Projection_traits_3<K>` (not for dual Voronoi functions)\n
+              `CGAL::Projection_traits_xy_3<K>` (not for dual Voronoi functions)\n
+              `CGAL::Projection_traits_xy_3<K>` (not for dual Voronoi functions)\n
+              `CGAL::Projection_traits_yz_3<K>` (not for dual Voronoi functions)\n
+              `CGAL::Projection_traits_xz_3<K>` (not for dual Voronoi functions)}
 
 \sa `TriangulationTraits_2`
 */
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h
index 6d69fe98604e..26c24a4e86ba 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h
@@ -34,7 +34,8 @@ in the face a list to store hidden vertices.
 
 \cgalRefines{TriangulationFaceBase_2}
 
-\cgalHasModel `CGAL::Regular_triangulation_face_base_2`
+\cgalHasModelsBegin CGAL::Regular_triangulation_face_base_2
+\cgalHasModelsEnd
 
 \sa `TriangulationFaceBase_2`
 \sa `RegularTriangulationVertexBase_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h
index 89ae384c8bfa..e935587ab864 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h
@@ -18,7 +18,7 @@ of Delaunay triangulations.
 
 \cgalRefines{TriangulationTraits_2}
 
-\cgalHasModel All models of `Kernel`.
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 
 \sa `CGAL::Regular_triangulation_2`
 
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h
index 62230e270a73..af73baa96815 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h
@@ -35,7 +35,8 @@ vertex of the triangulation or a hidden vertex.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModel `CGAL::Regular_triangulation_vertex_base_2`
+\cgalHasModelsBegin CGAL::Regular_triangulation_vertex_base_2
+\cgalHasModelsEnd
 
 \sa `TriangulationVertexBase_2`
 \sa `CGAL::Regular_triangulation_vertex_base_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h
index 353f56310609..17ee831ec0be 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h
@@ -16,7 +16,8 @@ and only provided for symmetry with the vertex case.
 
 \cgalRefines{TriangulationDSFaceBase_2}
 
-\cgalHasModel `CGAL::Triangulation_face_base_2<Traits>`
+\cgalHasModelsBegin CGAL::Triangulation_face_base_2<Traits>
+\cgalHasModelsEnd
 
 \sa `TriangulationVertexBase_2`
 \sa `CGAL::Triangulation_face_base_2<Traits>`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h
index 5d473eabfb6d..497c1fadde72 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h
@@ -14,7 +14,8 @@ next and previous level triangulations.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModel `CGAL::Triangulation_hierarchy_vertex_base_2<Vb>`
+\cgalHasModelsBegin CGAL::Triangulation_hierarchy_vertex_base_2<Vb>
+\cgalHasModelsEnd
 
 \sa `CGAL::Triangulation_hierarchy_2<Tr>`
 
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h
index eeee95725166..f158bbeea8d6 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h
@@ -12,11 +12,11 @@ provides the types of the geometric primitives used in the
 triangulation and some function object types for the required
 predicates on those primitives.
 
-\cgalHasModel All models of `Kernel`.
-\cgalHasModel `CGAL::Projection_traits_3<K>`
-\cgalHasModel `CGAL::Projection_traits_xy_3<K>`
-\cgalHasModel `CGAL::Projection_traits_yz_3<K>`
-\cgalHasModel `CGAL::Projection_traits_xz_3<K>`
+\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_3<K>
+\cgalHasModels CGAL::Projection_traits_xy_3<K>
+\cgalHasModels CGAL::Projection_traits_yz_3<K>
+\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsEnd
 
 \sa `CGAL::Triangulation_2`
 
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h
index 0ce1e0012c96..c5e59974834d 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h
@@ -8,7 +8,8 @@ and provides an additional information storage.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModel `CGAL::Triangulation_vertex_base_with_info_2`
+\cgalHasModelsBegin CGAL::Triangulation_vertex_base_with_info_2
+\cgalHasModelsEnd
 
 */
 
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h
index bec156dc516f..816e93b382ac 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h
@@ -15,7 +15,8 @@ the vertex base of a triangulation stores a point.
 
 \cgalRefines{TriangulationDSVertexBase_2}
 
-\cgalHasModel `CGAL::Triangulation_vertex_base_2<Traits,Vb>`
+\cgalHasModelsBegin CGAL::Triangulation_vertex_base_2<Traits,Vb>
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
 \sa `TriangulationDataStructure_2::Vertex`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h
index b6e1a9b25158..4df0ce0f7527 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h
@@ -11,8 +11,9 @@ in the cell an operator that computes its circumcenter.
 
 \cgalRefines{TriangulationCellBase_3}
 
-\cgalHasModel `CGAL::Delaunay_triangulation_cell_base_3`
-\cgalHasModel `CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3`
+\cgalHasModelsBegin CGAL::Delaunay_triangulation_cell_base_3
+\cgalHasModels CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3
+\cgalHasModelsEnd
 
 \sa `DelaunayTriangulationTraits_3`
 
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h
index c1f46f3fb4ff..b727b6013c9d 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h
@@ -10,13 +10,14 @@ predicates and constructions on these objects.
 
 \cgalRefines{TriangulationTraits_3}
 
-\cgalHasModel `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended)
-\cgalHasModel `CGAL::Exact_predicates_exact_constructions_kernel` (recommended for Voronoi)
-\cgalHasModel `CGAL::Filtered_kernel`
-\cgalHasModel `CGAL::Cartesian`
-\cgalHasModel `CGAL::Simple_cartesian`
-\cgalHasModel `CGAL::Homogeneous`
-\cgalHasModel `CGAL::Simple_homogeneous`
+\cgalHasModelsBegin CGAL::Exact_predicates_inexact_constructions_kernel (recommended)
+\cgalHasModels CGAL::Exact_predicates_exact_constructions_kernel (recommended for Voronoi)
+\cgalHasModels CGAL::Filtered_kernel
+\cgalHasModels CGAL::Cartesian
+\cgalHasModels CGAL::Simple_cartesian
+\cgalHasModels CGAL::Homogeneous
+\cgalHasModels CGAL::Simple_homogeneous
+\cgalHasModelsEnd
 
 In addition to the requirements described for the traits class of
 `CGAL::Triangulation_3`, the geometric traits class of a
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h
index 4f83db499d7f..9c7764481069 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h
@@ -19,7 +19,8 @@ circumcenter by calling `invalidate_weighted_circumcenter_cache()`.
 
 \cgalRefines{RegularTriangulationCellBase_3}
 
-\cgalHasModel `CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3`
+\cgalHasModelsBegin CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3
+\cgalHasModelsEnd
 
 \sa `RegularTriangulationTraits_3`
 
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h
index 7a00e04f1d8b..b7362aca63ff 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h
@@ -35,7 +35,8 @@ and an operator to compute its weighted circumcenter.
 
 \cgalRefines{TriangulationCellBase_3}
 
-\cgalHasModel `CGAL::Regular_triangulation_cell_base_3`
+\cgalHasModelsBegin CGAL::Regular_triangulation_cell_base_3
+\cgalHasModelsEnd
 
 \sa `RegularTriangulationTraits_3`
 
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h
index 91057fe887f9..41cd3c59fbc1 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h
@@ -15,7 +15,7 @@ or the weighted point \f$ {p}^{(w)}=(p,w_p)\f$.
 
 \cgalRefines{TriangulationTraits_3}
 
-\cgalHasModel All models of `Kernel`.
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 
 \sa `CGAL::Regular_triangulation_3`
 
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h
index 3881593c2d3f..aa5da85428da 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h
@@ -9,7 +9,8 @@ by adding a geometric point member.
 
 \cgalRefines{TriangulationDSVertexBase_3}
 
-\cgalHasModel `CGAL::Regular_triangulation_vertex_base_3`
+\cgalHasModelsBegin CGAL::Regular_triangulation_vertex_base_3
+\cgalHasModelsEnd
 
 \sa `RegularTriangulationCellBase_3`
 
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h
index 5064256e4454..4efba49955ac 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h
@@ -8,7 +8,8 @@ and provides an additional information storage.
 
 \cgalRefines{TriangulationCellBase_3}
 
-\cgalHasModel `CGAL::Triangulation_cell_base_with_info_3`
+\cgalHasModelsBegin CGAL::Triangulation_cell_base_with_info_3
+\cgalHasModelsEnd
 
 */
 
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h
index 69ae982347cb..419ba6c4417a 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h
@@ -10,8 +10,9 @@ structure apply.
 
 \cgalRefines{TriangulationDSCellBase_3}
 
-\cgalHasModel `CGAL::Triangulation_cell_base_3`
-\cgalHasModel `CGAL::Triangulation_cell_base_with_info_3`
+\cgalHasModelsBegin CGAL::Triangulation_cell_base_3
+\cgalHasModels CGAL::Triangulation_cell_base_with_info_3
+\cgalHasModelsEnd
 
 \sa `TriangulationVertexBase_3`
 
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h
index d7c62d3e4c62..96a428da0503 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h
@@ -11,7 +11,7 @@ triangles and tetrahedra) forming the triangulation together with a few
 geometric predicates and constructions on these objects: lexicographical
 comparison, orientation in case of coplanar points and orientation in space.
 
-\cgalHasModel All models of `Kernel`.
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 
 \sa `CGAL::Triangulation_3`
 */
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h
index c9cf46d00629..2801c4580136 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h
@@ -8,7 +8,8 @@ and provides an additional information storage.
 
 \cgalRefines{TriangulationVertexBase_3}
 
-\cgalHasModel `CGAL::Triangulation_vertex_base_with_info_3`
+\cgalHasModelsBegin CGAL::Triangulation_vertex_base_with_info_3
+\cgalHasModelsEnd
 
 */
 
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h
index cd91c12e9a86..75d23eb5581a 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h
@@ -9,8 +9,9 @@ for the triangulation data structure.
 
 \cgalRefines{TriangulationDSVertexBase_3}
 
-\cgalHasModel `CGAL::Triangulation_vertex_base_3`
-\cgalHasModel `CGAL::Triangulation_vertex_base_with_info_3`
+\cgalHasModelsBegin CGAL::Triangulation_vertex_base_3
+\cgalHasModels CGAL::Triangulation_vertex_base_with_info_3
+\cgalHasModelsEnd
 
 \sa `TriangulationCellBase_3`
 
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h
index 397c3a7e7992..d73727aaabc0 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h
@@ -11,8 +11,9 @@ parameter of the class `CGAL::Delaunay_triangulation_on_sphere_2<Traits, Tds>`.
 To the requirements listed within the concept `TriangulationOnSphereTraits_2`,
 this concept adds types and functors requirements related to build the dual on the sphere.
 
-\cgalHasModel `CGAL::Delaunay_triangulation_on_sphere_traits_2`
-\cgalHasModel `CGAL::Projection_on_sphere_traits_3`
+\cgalHasModelsBegin CGAL::Delaunay_triangulation_on_sphere_traits_2
+\cgalHasModels CGAL::Projection_on_sphere_traits_3
+\cgalHasModelsEnd
 */
 class DelaunayTriangulationOnSphereTraits_2
 {
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h
index fbb6ac030edc..0d1fe175810c 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h
@@ -19,7 +19,8 @@ then the triangulation is not an orientable triangulated surface without boundar
 In this case, fictitious faces are added to the triangulation, called <i>ghost faces</i>,
 such that the triangulation is a topological sphere.
 
-\cgalHasModel `CGAL::Triangulation_on_sphere_face_base_2<Traits, Fb>`
+\cgalHasModelsBegin CGAL::Triangulation_on_sphere_face_base_2<Traits, Fb>
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
 \sa `TriangulationOnSphereVertexBase_2`
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h
index 0dad5563ff72..4ccf99b9a261 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h
@@ -13,8 +13,9 @@ triangulation and the function object types for the required predicates on those
 In particular, the traits class is expected to contain information about the sphere (center and radius)
 on which the points of the triangulation lie, as well as to provide means to change this information.
 
-\cgalHasModel `CGAL::Delaunay_triangulation_on_sphere_traits_2`
-\cgalHasModel `CGAL::Projection_on_sphere_traits_3`
+\cgalHasModelsBegin CGAL::Delaunay_triangulation_on_sphere_traits_2
+\cgalHasModels CGAL::Projection_on_sphere_traits_3
+\cgalHasModelsEnd
 
 \sa `DelaunayTriangulationOnSphereTraits_2`
 */
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h
index 23b6971fd895..7701fde798b9 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h
@@ -9,7 +9,8 @@ of a triangulation data structure to be plugged in a triangulation on the sphere
 It refines the concept `TriangulationDSVertexBase_2`, adding geometric information:
 the vertex base of a triangulation stores a point.
 
-\cgalHasModel `CGAL::Triangulation_on_sphere_vertex_base_2<Traits,Vb>`
+\cgalHasModelsBegin CGAL::Triangulation_on_sphere_vertex_base_2<Traits,Vb>
+\cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
 \sa `TriangulationOnSphereFaceBase_2`
diff --git a/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h b/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h
index 46213272fa93..3d656b13a16f 100644
--- a/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h
+++ b/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h
@@ -6,9 +6,10 @@
 A model of the `Visibility_2` concept can be attached to an `Arrangement_2` instance to
 answer visibility queries within the faces of this arrangement.
 
-\cgalHasModel `CGAL::Simple_polygon_visibility_2`
-\cgalHasModel `CGAL::Rotational_sweep_visibility_2`
-\cgalHasModel `CGAL::Triangular_expansion_visibility_2`
+\cgalHasModelsBegin CGAL::Simple_polygon_visibility_2
+\cgalHasModels CGAL::Rotational_sweep_visibility_2
+\cgalHasModels CGAL::Triangular_expansion_visibility_2
+\cgalHasModelsEnd
 
 */
 class Visibility_2 {
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h
index 218a51a9d103..916a678290fa 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h
@@ -13,15 +13,16 @@ graph they take as an argument, the last ones does.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Identity_policy_2<DG,AT>`
-\cgalHasModel `CGAL::Apollonius_graph_degeneracy_removal_policy_2<AG2>`
-\cgalHasModel `CGAL::Apollonius_graph_caching_degeneracy_removal_policy_2<AG2>`
-\cgalHasModel `CGAL::Delaunay_triangulation_degeneracy_removal_policy_2<DT2>`
-\cgalHasModel `CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2<DT2>`
-\cgalHasModel `CGAL::Regular_triangulation_degeneracy_removal_policy_2<RT2>`
-\cgalHasModel `CGAL::Regular_triangulation_caching_degeneracy_removal_policy_2<RT2>`
-\cgalHasModel `CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2<SDG2>`
-\cgalHasModel `CGAL::Segment_Delaunay_graph_caching_degeneracy_removal_policy_2<SDG2>`
+\cgalHasModelsBegin CGAL::Identity_policy_2<DG,AT>
+\cgalHasModels CGAL::Apollonius_graph_degeneracy_removal_policy_2<AG2>
+\cgalHasModels CGAL::Apollonius_graph_caching_degeneracy_removal_policy_2<AG2>
+\cgalHasModels CGAL::Delaunay_triangulation_degeneracy_removal_policy_2<DT2>
+\cgalHasModels CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2<DT2>
+\cgalHasModels CGAL::Regular_triangulation_degeneracy_removal_policy_2<RT2>
+\cgalHasModels CGAL::Regular_triangulation_caching_degeneracy_removal_policy_2<RT2>
+\cgalHasModels CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2<SDG2>
+\cgalHasModels CGAL::Segment_Delaunay_graph_caching_degeneracy_removal_policy_2<SDG2>
+\cgalHasModelsEnd
 
 \sa `DelaunayGraph_2`
 \sa `AdaptationTraits_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
index bdd875609361..941a0b9dfbe9 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
@@ -11,10 +11,11 @@ tag is provided for determining whether this functor is defined or not.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModel `CGAL::Apollonius_graph_adaptation_traits_2<AG2>`
-\cgalHasModel `CGAL::Delaunay_triangulation_adaptation_traits_2<DT2>`
-\cgalHasModel `CGAL::Regular_triangulation_adaptation_traits_2<RT2>`
-\cgalHasModel `CGAL::Segment_Delaunay_graph_adaptation_traits_2<SDG2>`
+\cgalHasModelsBegin CGAL::Apollonius_graph_adaptation_traits_2<AG2>
+\cgalHasModels CGAL::Delaunay_triangulation_adaptation_traits_2<DT2>
+\cgalHasModels CGAL::Regular_triangulation_adaptation_traits_2<RT2>
+\cgalHasModels CGAL::Segment_Delaunay_graph_adaptation_traits_2<SDG2>
+\cgalHasModelsEnd
 
 \sa `DelaunayGraph_2`
 \sa `CGAL::Voronoi_diagram_2<DG,AT,AP>`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h
index 3459c48dc9f4..01749c2be48b 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h
@@ -18,13 +18,13 @@ iterators and circulators that allow to traverse it (completely or
 partially). All iterators and circulators must be convertible to the
 corresponding handles.
 
-\cgalHasModel `CGAL::Delaunay_triangulation_2<Traits,Tds>`
-\cgalHasModel `CGAL::Regular_triangulation_2<Traits,Tds>`
-\cgalHasModel `CGAL::Triangulation_hierarchy_2<Tr>` provided that `Tr` is a model of `DelaunayGraph_2`
-\cgalHasModel `CGAL::Segment_Delaunay_graph_2<Gt,DS>`
-\cgalHasModel `CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,STag,DS>`
-\cgalHasModel `CGAL::Apollonius_graph_2<Gt,Agds>`
-\cgalHasModel `CGAL::Apollonius_graph_hierarchy_2<Gt,Agds>`
+\cgalHasModelsBareBegin{ `CGAL::Triangulation_hierarchy_2<Tr>` provided that `Tr` is a model of `DelaunayGraph_2`} CGAL::Delaunay_triangulation_2<Traits,Tds>
+\cgalHasModels CGAL::Regular_triangulation_2<Traits,Tds>
+\cgalHasModels CGAL::Segment_Delaunay_graph_2<Gt,DS>
+\cgalHasModels CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,STag,DS>
+\cgalHasModels CGAL::Apollonius_graph_2<Gt,Agds>
+\cgalHasModels CGAL::Apollonius_graph_hierarchy_2<Gt,Agds>
+\cgalHasModelsEnd
 
 \sa `AdaptationTraits_2`
 \sa `AdaptationPolicy_2`
diff --git a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h
index 4b882bd82d51..a6f6793d19c3 100644
--- a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h
+++ b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h
@@ -5,11 +5,10 @@
 A concept that describes the set of requirements of classes used in the computation
 of analytic weights in 2D.
 
-\cgalHasModel
-- All models of `Kernel`
-- `CGAL::Projection_traits_xy_3<K>`
-- `CGAL::Projection_traits_yz_3<K>`
-- `CGAL::Projection_traits_xz_3<K>`
+\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} sCGAL:Projection_traits_xy_3<K>
+\cgalHasModels CGAL::Projection_traits_yz_3<K>
+\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsEnd
 */
 class AnalyticWeightTraits_2 {
 
diff --git a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h
index 3560a85f4789..5aab656b6128 100644
--- a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h
+++ b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h
@@ -5,8 +5,7 @@
 A concept that describes the set of requirements of classes used in the computation
 of analytic weights in 3D.
 
-\cgalHasModel
-- All models of `Kernel`
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
 */
 class AnalyticWeightTraits_3 {
 
diff --git a/Weights/doc/Weights/Concepts/BarycentricWeights_2.h b/Weights/doc/Weights/Concepts/BarycentricWeights_2.h
index 89638d209f6d..95d700e8e512 100644
--- a/Weights/doc/Weights/Concepts/BarycentricWeights_2.h
+++ b/Weights/doc/Weights/Concepts/BarycentricWeights_2.h
@@ -5,10 +5,10 @@
 A concept that describes the set of methods required in all classes used in
 the computation of 2D generalized barycentric weights.
 
-\cgalHasModel
-- `CGAL::Weights::Wachspress_weights_2`
-- `CGAL::Weights::Mean_value_weights_2`
-- `CGAL::Weights::Discrete_harmonic_weights_2`
+\cgalHasModelsBegin CGAL::Weights::Wachspress_weights_2
+\cgalHasModels CGAL::Weights::Mean_value_weights_2
+\cgalHasModels CGAL::Weights::Discrete_harmonic_weights_2
+\cgalHasModelsEnd
 */
 class BarycentricWeights_2 {
 

From 806ffa9385e985216b34f870ad21b32982c2272e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 6 Jul 2023 17:40:28 +0200
Subject: [PATCH 0467/1398] remove TODO

I don't think a predicate sorting planes along a ray would be
faster than directly using intersection coordinates
---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h        | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 693c00676f05..122c595b13e8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -959,7 +959,6 @@ void generate_subtriangles(std::size_t ti,
     {
       if(!points_on_segments[i].empty())
       {
-        // TODO: predicate on input triangles
         int coord = 0;
         std::size_t src_id = segments[i].first, tgt_id = segments[i].second;
         typename EK::Point_3 src = points[src_id], tgt=points[tgt_id];

From d55638cfd18dbee452a710e0a852909dafd9c5aa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 6 Jul 2023 17:49:14 +0200
Subject: [PATCH 0468/1398] remove unused variable

---
 STL_Extension/test/STL_Extension/test_skiplist.cpp | 1 -
 1 file changed, 1 deletion(-)

diff --git a/STL_Extension/test/STL_Extension/test_skiplist.cpp b/STL_Extension/test/STL_Extension/test_skiplist.cpp
index f0f61b5f803f..52d21b0ce25a 100644
--- a/STL_Extension/test/STL_Extension/test_skiplist.cpp
+++ b/STL_Extension/test/STL_Extension/test_skiplist.cpp
@@ -60,7 +60,6 @@ BOOST_FIXTURE_TEST_CASE( test_insert, Fixture )
                                 skips.begin(), skips.end());
 
   // the same goes for inserting at an arbitrary position
-  skip::all_iterator pos = boost::next(l.all_begin(), 3);
   l.insert(boost::next(l.all_begin(), 3)
            , 20);
   all.insert(boost::next(all.begin(), 3)

From 01ecc02e71bb86203c2c86e8b2e3728e19659fd2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 6 Jul 2023 17:51:07 +0200
Subject: [PATCH 0469/1398] fix conversion warnings

---
 STL_Extension/test/STL_Extension/test_skiplist.cpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/STL_Extension/test/STL_Extension/test_skiplist.cpp b/STL_Extension/test/STL_Extension/test_skiplist.cpp
index 52d21b0ce25a..54ee29a352b0 100644
--- a/STL_Extension/test/STL_Extension/test_skiplist.cpp
+++ b/STL_Extension/test/STL_Extension/test_skiplist.cpp
@@ -50,8 +50,8 @@ BOOST_FIXTURE_TEST_CASE( test_insert, Fixture )
 
   // clear and try again
   l.clear();
-  BOOST_CHECK_EQUAL(l.all_size(), 0);
-  BOOST_CHECK_EQUAL(l.skip_size(), 0);
+  BOOST_CHECK_EQUAL(l.all_size(), std::size_t(0));
+  BOOST_CHECK_EQUAL(l.skip_size(), std::size_t(0));
   l.insert(l.all_begin(), all.begin(), all.end());
   skips += 8, 9;
   BOOST_CHECK_EQUAL_COLLECTIONS(l.all_begin(), l.all_end(),
@@ -123,7 +123,7 @@ BOOST_FIXTURE_TEST_CASE( skip_all_case, Fixture )
   l.skip(l.all_begin(), l.all_end());
   skips.clear();
   BOOST_CHECK_EQUAL(l.all_size(), all.size());
-  BOOST_CHECK_EQUAL(l.skip_size(), 0);
+  BOOST_CHECK_EQUAL(l.skip_size(), std::size_t(0));
   BOOST_CHECK_EQUAL_COLLECTIONS(l.skip_begin(), l.skip_end(),
                                 skips.begin(), skips.end());
 }

From 5673ccfc7185e2e66e9d2d034caa029605e5ea3c Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Thu, 6 Jul 2023 18:04:38 +0200
Subject: [PATCH 0470/1398] Spelling corrections

Spelling correction `a edge` to `an edge`
---
 AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h  | 2 +-
 BGL/include/CGAL/boost/graph/Face_filtered_graph.h              | 2 +-
 .../benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h | 2 +-
 Nef_2/include/CGAL/Nef_2/PM_point_locator.h                     | 2 +-
 Nef_3/include/CGAL/Nef_3/SNC_simplify.h                         | 2 +-
 Nef_S2/include/CGAL/Nef_S2/SM_point_locator.h                   | 2 +-
 .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt     | 2 +-
 .../CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h | 2 +-
 .../CGAL/Surface_mesh_simplification/internal/Edge_collapse.h   | 2 +-
 9 files changed, 9 insertions(+), 9 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
index fe85c35d3662..62484d59653b 100644
--- a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
@@ -33,7 +33,7 @@ namespace CGAL {
 
 /*!
  * \ingroup PkgAABBTreeRef
- * Primitive type for a edge of a polyhedral surface.
+ * Primitive type for an edge of a polyhedral surface.
  * It wraps an `edge_descriptor` into a 3D segment.
  * The class model of `HalfedgeGraph` from which the primitive is built should not be deleted
  * while the AABB tree holding the primitive is in use.
diff --git a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
index e6f4136481d9..3a0a851b6826 100644
--- a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
+++ b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
@@ -42,7 +42,7 @@ namespace CGAL {
    * <a href="https://www.boost.org/doc/libs/release/libs/graph/doc/filtered_graph.html"><code>boost::filtered_graph</code></a>,
    * this class only requires a way to access the selected faces and will automatically select the
    * edges/halfedges and vertices present in the adapted graph. A vertex is selected if it is incident to at least one
-   * selected face. A edge is selected if it is incident to at least a selected face. A halfedge is selected if its edge
+   * selected face. An edge is selected if it is incident to at least a selected face. A halfedge is selected if its edge
    * is selected.
    *
    * Since this class is a model of the `FaceGraph` concept, there is a restriction on the set of selected faces:
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h
index f092321e4a9e..295b1c8ba2b2 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_2/surface_mesh/Surface_mesh.h
@@ -1103,7 +1103,7 @@ class Surface_mesh
     {
         return Halfedge_property<T>(hprops_.add<T>(name, t));
     }
-    /** add a edge property of type \c T with name \c name and default value \c t.
+    /** add an edge property of type \c T with name \c name and default value \c t.
      fails if a property named \c name exists already, since the name has to be unique.
      in this case it returns an invalid property */
     template <class T> Edge_property<T> add_edge_property(const std::string& name, const T t=T())
diff --git a/Nef_2/include/CGAL/Nef_2/PM_point_locator.h b/Nef_2/include/CGAL/Nef_2/PM_point_locator.h
index ede8d2b033a9..c03e60e3fcfc 100644
--- a/Nef_2/include/CGAL/Nef_2/PM_point_locator.h
+++ b/Nef_2/include/CGAL/Nef_2/PM_point_locator.h
@@ -159,7 +159,7 @@ class PM_naive_point_locator : public PM_decorator_ {
     const Direction& d, bool& collinear) const
   /*{\Xop returns a halfedge |e| bounding a wedge in between two
   neighbored edges in the adjacency list of |v| which contains |d|.
-  If |d| extends along a edge then |e| is this edge. If |d| extends
+  If |d| extends along an edge then |e| is this edge. If |d| extends
   into the interior of such a wedge then |e| is the first edge hit
   when |d| is rotated clockwise. \precond |v| is not isolated.}*/
   { CGAL_NEF_TRACEN("out_wedge "<<PV(v));
diff --git a/Nef_3/include/CGAL/Nef_3/SNC_simplify.h b/Nef_3/include/CGAL/Nef_3/SNC_simplify.h
index 573b58fb1722..7948da55da55 100644
--- a/Nef_3/include/CGAL/Nef_3/SNC_simplify.h
+++ b/Nef_3/include/CGAL/Nef_3/SNC_simplify.h
@@ -169,7 +169,7 @@ class SNC_simplify_base : public SNC_decorator<SNC_structure> {
   }
 
   bool is_part_of_edge(Vertex_handle v) {
-    /* determines if a vertex v is part of a edge, checking at its local
+    /* determines if a vertex v is part of an edge, checking at its local
        graph for exactly two antipodal vertices  */
 
     SM_decorator SD(&*v);
diff --git a/Nef_S2/include/CGAL/Nef_S2/SM_point_locator.h b/Nef_S2/include/CGAL/Nef_S2/SM_point_locator.h
index 8dbce0ced5ed..563c5471b455 100644
--- a/Nef_S2/include/CGAL/Nef_S2/SM_point_locator.h
+++ b/Nef_S2/include/CGAL/Nef_S2/SM_point_locator.h
@@ -119,7 +119,7 @@ class SM_point_locator : public SM_decorator {
                              bool& collinear) const
   /*{\Xop returns a halfedge |e| bounding a wedge in between two
   neighbored edges in the adjacency list of |v| which contains |d|.
-  If |d| extends along a edge then |e| is this edge. If |d| extends
+  If |d| extends along an edge then |e| is this edge. If |d| extends
   into the interior of such a wedge then |e| is the first edge hit
   when |d| is rotated clockwise. \precond |v| is not isolated.}*/
   { CGAL_NEF_TRACEN("out_wedge "<<PH(v));
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 8d541588736c..13027e51161c 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -21,7 +21,7 @@ given in Botsch et al.'s book on polygon mesh processing \cgalCite{botsch2010PMP
 A \a polygon \a mesh is a consistent and orientable surface mesh, that can have
 one or more boundaries.
 The \a faces are simple polygons.
-The \a edges are segments. Each edge connects two \a vertices,
+The \an edges are segments. Each edge connects two \a vertices,
 and is shared by two faces (including the \a null \a face for boundary edges).
 A polygon mesh can have any number of connected components, and also some self-intersections.
 In this package, a polygon mesh is considered to have the topology of a 2-manifold.
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h
index f9fc7ca78c41..4ff69066a3a5 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_builder_2_impl.h
@@ -344,7 +344,7 @@ void Straight_skeleton_builder_2<Gt,Ss,V>::CollectNewEvents( Vertex_handle aNode
   // or vertex events (or edge events of course).
   //
   // Each vertex wavefront (reflex or not) results in one and only one event from a set of possible events.
-  // It can result in a edge event against the vertex wavefronts emerging from the adjacent vertices (in the current polygon, not
+  // It can result in an edge event against the vertex wavefronts emerging from the adjacent vertices (in the current polygon, not
   // in the input polygon); or it can result in a split event (or vertex event) against any other wavefront in the rest of
   // current polygon.
 
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h
index a662b4c24c0b..612b9182046c 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Edge_collapse.h
@@ -697,7 +697,7 @@ is_constrained(const vertex_descriptor v) const
 }
 
 // Some edges are NOT collapsible: doing so would break the topological consistency of the mesh.
-// This function returns true if a edge 'p->q' can be collapsed.
+// This function returns true if an edge 'p->q' can be collapsed.
 //
 // An edge p->q can be collapsed iff it satisfies the "link condition"
 // (as described in the "Mesh Optimization" article of Hoppe et al (1993))

From 86ae851ee2d1487425082a0d3b5b7b9600af8a04 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 6 Jul 2023 18:20:35 +0200
Subject: [PATCH 0471/1398] renaming requires to update the doc too...

---
 Triangulation/doc/Triangulation/Triangulation.txt | 4 ++--
 Triangulation/doc/Triangulation/examples.txt      | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/Triangulation/doc/Triangulation/Triangulation.txt b/Triangulation/doc/Triangulation/Triangulation.txt
index c992f6d7cd31..b64ad247c361 100644
--- a/Triangulation/doc/Triangulation/Triangulation.txt
+++ b/Triangulation/doc/Triangulation/Triangulation.txt
@@ -347,8 +347,8 @@ ask the triangulation to construct the set of edges
 (\f$ 1\f$ dimensional faces) incident to the vertex at infinity. It is easy to see that
 these edges are in bijection with the vertices on the convex hull of the
 points. This gives us a handy way to count the convex hull vertices
-(include files <tt>triangulation1.cpp</tt> and
-<tt>triangulation2.cpp</tt> are given and commented below).
+(include files <tt>triangulation1.h</tt> and
+<tt>triangulation2.h</tt> are given and commented below).
 
 \cgalExample{triangulation.cpp}
 
diff --git a/Triangulation/doc/Triangulation/examples.txt b/Triangulation/doc/Triangulation/examples.txt
index 36db1597b8f4..5ced981de5e9 100644
--- a/Triangulation/doc/Triangulation/examples.txt
+++ b/Triangulation/doc/Triangulation/examples.txt
@@ -3,8 +3,8 @@
 \example delaunay_triangulation.cpp
 \example regular_triangulation.cpp
 \example triangulation.cpp
-\example triangulation1.cpp
-\example triangulation2.cpp
+\example triangulation1.h
+\example triangulation2.h
 \example triangulation_data_structure_dynamic.cpp
 \example triangulation_data_structure_static.cpp
 */

From 5759ce49ae1ff163cda54d07062e8488c1326cd4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 7 Jul 2023 02:04:01 +0200
Subject: [PATCH 0472/1398] Add unique simplex iterators

---
 .../include/CGAL/Periodic_2_triangulation_2.h | 151 ++++++-
 .../Periodic_2_triangulation_iterators_2.h    | 325 ++++++++------
 .../include/interface_test.h                  |  26 +-
 .../include/CGAL/Periodic_3_triangulation_3.h | 413 ++++++++++++------
 .../Periodic_3_triangulation_iterators_3.h    | 327 ++++++--------
 .../CGAL/_test_cls_periodic_3_iterator.h      | 160 ++++++-
 .../_test_cls_periodic_3_triangulation_3.h    |   8 +-
 7 files changed, 905 insertions(+), 505 deletions(-)

diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h
index a4ca4e36a30c..2ce4755742a8 100644
--- a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h
+++ b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h
@@ -119,6 +119,14 @@ class Periodic_2_triangulation_2
   /// Unique_vertex_iterator iterates over exactly one representative.
   typedef Periodic_2_triangulation_unique_vertex_iterator_2<Self>
   Unique_vertex_iterator;
+  /// Iterator over the canonical edges, i.e. for each set of periodic copies the
+  /// Unique_edge_iterator iterates over exactly one representative.
+  typedef Periodic_2_triangulation_unique_edge_iterator_2<Self>
+  Unique_edge_iterator;
+  /// Iterator over the canonical faces, i.e. for each set of periodic copies the
+  /// Unique_face_iterator iterates over exactly one representative.
+  typedef Periodic_2_triangulation_unique_face_iterator_2<Self>
+  Unique_face_iterator;
 
   /// \name For compatibility with the Triangulation_2 class
   // \{
@@ -676,6 +684,32 @@ class Periodic_2_triangulation_2
                                  Periodic_2_triangulation_2_internal::Domain_tester<Self>(this));
   }
 
+  Unique_edge_iterator unique_edges_begin() const
+  {
+    return CGAL::filter_iterator(edges_end(),
+                                 Periodic_2_triangulation_2_internal::Domain_tester<Self>(this),
+                                 edges_begin());
+  }
+  /// past-the-end iterator over the canonical edges
+  Unique_edge_iterator unique_edges_end() const
+  {
+    return CGAL::filter_iterator(edges_end(),
+                                 Periodic_2_triangulation_2_internal::Domain_tester<Self>(this));
+  }
+
+  Unique_face_iterator unique_faces_begin() const
+  {
+    return CGAL::filter_iterator(faces_end(),
+                                 Periodic_2_triangulation_2_internal::Domain_tester<Self>(this),
+                                 faces_begin());
+  }
+  /// past-the-end iterator over the non-virtual vertices
+  Unique_face_iterator unique_faces_end() const
+  {
+    return CGAL::filter_iterator(faces_end(),
+                                 Periodic_2_triangulation_2_internal::Domain_tester<Self>(this));
+  }
+
   // \}
   /// \name Geometric iterators
   //\{
@@ -972,6 +1006,32 @@ class Periodic_2_triangulation_2
       return Offset();
   }
 
+  // Gets the canonicalized offsets of a face.
+  void get_offsets(Face_handle fh,
+                   Offset& off0, Offset& off1, Offset& off2) const
+  {
+    Offset face_off0 = int_to_off(fh->offset(0));
+    Offset face_off1 = int_to_off(fh->offset(1));
+    Offset face_off2 = int_to_off(fh->offset(2));
+    Offset diff_off((face_off0.x() == 1 && face_off1.x() == 1 && face_off2.x() == 1) ? -1 : 0,
+                    (face_off0.y() == 1 && face_off1.y() == 1 && face_off2.y() == 1) ? -1 : 0);
+    off0 = combine_offsets(get_offset(fh, 0), diff_off);
+    off1 = combine_offsets(get_offset(fh, 1), diff_off);
+    off2 = combine_offsets(get_offset(fh, 2), diff_off);
+  }
+
+  // Gets the canonicalized offsets of an edge.
+  void get_offsets(const Edge& e,
+                   Offset& off0, Offset& off1) const
+  {
+    Offset edge_off0 = int_to_off(e.first->offset(cw(e.second)));
+    Offset edge_off1 = int_to_off(e.first->offset(ccw(e.second)));
+    Offset diff_off((edge_off0.x() == 1 && edge_off1.x() == 1) ? -1 : 0,
+                    (edge_off0.y() == 1 && edge_off1.y() == 1) ? -1 : 0);
+    off0 = combine_offsets(get_offset(e.first, cw(e.second)), diff_off);
+    off1 = combine_offsets(get_offset(e.first, ccw(e.second)), diff_off);
+  }
+
   /// Converts an offset to a bit pattern where bit1==offx and bit0==offy.
   int off_to_int(const Offset & off) const
   {
@@ -986,13 +1046,12 @@ class Periodic_2_triangulation_2
     return Offset((i >> 1) & 1, i & 1);
   }
 
-  // \}
-  // Protected functions of Periodic_2_triangulation_2
-  /// Const accessor to the virtual vertices reverse map,
-  /// used to optimize point location for periodic copies.
-  const Virtual_vertex_reverse_map &virtual_vertices_reverse() const
+  /// Tests whether a vertex is a periodic copy of a vertex in the 3-cover.
+    bool is_virtual(Vertex_handle v) const
   {
-    return _virtual_vertices_reverse;
+    if (is_1_cover())
+      return false;
+    return (_virtual_vertices.find(v) != _virtual_vertices.end());
   }
 
   /// [Undoc] Returns the non-virtual copy of the vertex.
@@ -1007,15 +1066,6 @@ class Periodic_2_triangulation_2
       return vh;
   }
 
-
-  /// Tests whether a vertex is a periodic copy of a vertex in the 3-cover.
-  bool is_virtual(Vertex_handle v)
-  {
-    if (is_1_cover())
-      return false;
-    return (_virtual_vertices.find(v) != _virtual_vertices.end());
-  }
-
   const std::vector<Vertex_handle>& periodic_copies(const Vertex_handle v) const
   {
     CGAL_precondition(number_of_sheets() != make_array(1, 1) );
@@ -1024,6 +1074,77 @@ class Periodic_2_triangulation_2
     return _virtual_vertices_reverse.find(v)->second;
   }
 
+  // Protected functions of Periodic_2_triangulation_2
+  /// Const accessor to the virtual vertices reverse map,
+  /// used to optimize point location for periodic copies.
+  const Virtual_vertex_reverse_map& virtual_vertices_reverse() const
+  {
+    return _virtual_vertices_reverse;
+  }
+
+  // check whether pos points onto a unique edge or not.
+  // If we are computing in 1-sheeted covering this should
+  // always be true.
+  bool is_canonical(Face_handle fh) const
+  {
+    if(is_1_cover())
+      return true;
+
+    Offset off0, off1, off2;
+    get_offsets(fh, off0, off1, off2);
+
+    // If there is one offset with entries larger than 1 then we are
+    // talking about a vertex that is too far away from the original
+    // domain to belong to a canonical triangle.
+    if (off0.x() > 1) return false;
+    if (off0.y() > 1) return false;
+    if (off1.x() > 1) return false;
+    if (off1.y() > 1) return false;
+    if (off2.x() > 1) return false;
+    if (off2.y() > 1) return false;
+
+    // If there is one direction of space for which all offsets are
+    // non-zero then the edge is not canonical because we can
+    // take the copy closer towards the origin in that direction.
+    int offx = off0.x() & off1.x() & off2.x();
+    int offy = off0.y() & off1.y() & off2.y();
+
+    return (offx == 0 && offy == 0);
+  }
+
+  bool is_canonical(const Edge& e) const
+  {
+    if(is_1_cover())
+      return true;
+
+    // fetch all offsets
+    Offset off0, off1;
+    get_offsets(e, off0, off1);
+
+    // If there is one offset with entries larger than 1 then we are
+    // talking about a vertex that is too far away from the original
+    // domain to belong to a canonical edge.
+    if (off0.x() > 1) return false;
+    if (off0.y() > 1) return false;
+    if (off1.x() > 1) return false;
+    if (off1.y() > 1) return false;
+
+    // If there is one direction of space for which all offsets are
+    // non-zero then the edge is not canonical because we can
+    // take the copy closer towards the origin in that direction.
+    int offx = off0.x() & off1.x();
+    int offy = off0.y() & off1.y();
+
+    return (offx == 0 && offy == 0);
+  }
+
+  // checks whether pos points onto a vertex inside the original domain
+  bool is_canonical(Vertex_handle vh) const
+  {
+    return !is_virtual(vh);
+  }
+
+public:
   template<class Stream>
   Stream& draw_triangulation(Stream& os) const
   {
diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_iterators_2.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_iterators_2.h
index afa1a55fce52..9b2afd4ba649 100644
--- a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_iterators_2.h
+++ b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_iterators_2.h
@@ -66,7 +66,7 @@ class Periodic_2_triangulation_triangle_iterator_2
   {
     if (_it == T::UNIQUE || _it == T::UNIQUE_COVER_DOMAIN)
       {
-        while (pos != _t->faces_end() && !is_canonical() )
+        while (pos != _t->faces_end() && !_t->is_canonical(pos) )
           ++pos;
       }
   }
@@ -88,7 +88,7 @@ class Periodic_2_triangulation_triangle_iterator_2
           {
             ++pos;
           }
-        while (pos != _t->faces_end() && !is_canonical());
+        while (pos != _t->faces_end() && !_t->is_canonical(pos));
         break;
       case T::STORED_COVER_DOMAIN:
       case T::UNIQUE_COVER_DOMAIN:
@@ -112,7 +112,7 @@ class Periodic_2_triangulation_triangle_iterator_2
           {
             --pos;
           }
-        while (pos != _t->faces_begin() && !is_canonical());
+        while (pos != _t->faces_begin() && !_t->is_canonical(pos));
         break;
       case T::STORED_COVER_DOMAIN:
       case T::UNIQUE_COVER_DOMAIN:
@@ -172,37 +172,6 @@ class Periodic_2_triangulation_triangle_iterator_2
   mutable Periodic_triangle periodic_triangle; // current triangle.
 
 private:
-  // check whether pos points onto a unique edge or not.
-  // If we are computing in 1-sheeted covering this should
-  // always be true.
-  bool is_canonical()
-  {
-    // fetch all offsets
-    Offset off0, off1, off2;
-    get_edge_offsets(off0, off1, off2);
-
-    if (_t->number_of_sheets() != make_array(1, 1))
-      {
-        // If there is one offset with entries larger than 1 then we are
-        // talking about a vertex that is too far away from the original
-        // domain to belong to a canonical triangle.
-        if (off0.x() > 1) return false;
-        if (off0.y() > 1) return false;
-        if (off1.x() > 1) return false;
-        if (off1.y() > 1) return false;
-        if (off2.x() > 1) return false;
-        if (off2.y() > 1) return false;
-      }
-
-    // If there is one direction of space for which all offsets are
-    // non-zero then the edge is not canonical because we can
-    // take the copy closer towards the origin in that direction.
-    int offx = off0.x() & off1.x() & off2.x();
-    int offy = off0.y() & off1.y() & off2.y();
-
-    return (offx == 0 && offy == 0);
-  }
-
   // Artificial incrementation function that takes periodic
   // copies into account.
   void increment_domain()
@@ -217,7 +186,7 @@ class Periodic_2_triangulation_triangle_iterator_2
             ++pos;
           }
         while (_it == T::UNIQUE_COVER_DOMAIN
-               && pos != _t->faces_end() && !is_canonical());
+               && pos != _t->faces_end() && !_t->is_canonical(pos));
       }
     else
       {
@@ -241,7 +210,7 @@ class Periodic_2_triangulation_triangle_iterator_2
           {
             --pos;
           }
-        while (_it == T::UNIQUE_COVER_DOMAIN && !is_canonical());
+        while (_it == T::UNIQUE_COVER_DOMAIN && !_t->is_canonical(pos));
         _off = get_drawing_offsets();
       }
     else
@@ -256,25 +225,6 @@ class Periodic_2_triangulation_triangle_iterator_2
       }
   }
 
-  // Get the canonicalized offsets of an edge.
-  // This works in any cover that is encoded in _t->combine_offsets
-  void get_edge_offsets(Offset &off0, Offset &off1,
-                        Offset &off2) const
-  {
-    Offset face_off0 = _t->int_to_off(pos->offset(0));
-    Offset face_off1 = _t->int_to_off(pos->offset(1));
-    Offset face_off2 = _t->int_to_off(pos->offset(2));
-    Offset diff_off((face_off0.x() == 1
-                     && face_off1.x() == 1
-                     && face_off2.x() == 1) ? -1 : 0,
-                    (face_off0.y() == 1
-                     && face_off1.y() == 1
-                     && face_off2.y() == 1) ? -1 : 0);
-    off0 = _t->combine_offsets(_t->get_offset(pos, 0), diff_off);
-    off1 = _t->combine_offsets(_t->get_offset(pos, 1), diff_off);
-    off2 = _t->combine_offsets(_t->get_offset(pos, 2), diff_off);
-  }
-
   // return an integer that encodes the translations which have to be
   // applied to the edge *pos
   int get_drawing_offsets()
@@ -287,7 +237,7 @@ class Periodic_2_triangulation_triangle_iterator_2
     // internally stored inside the cell telling us that this cell
     // wraps around the domain.
     if (_it == T::UNIQUE_COVER_DOMAIN)
-      get_edge_offsets(off0, off1, off2);
+      _t->get_offsets(pos, off0, off1, off2);
     else
       {
         CGAL_assertion(_it == T::STORED_COVER_DOMAIN);
@@ -319,7 +269,7 @@ class Periodic_2_triangulation_triangle_iterator_2
   {
     CGAL_assertion(pos != typename T::Face_handle());
     Offset off0, off1, off2;
-    get_edge_offsets(off0, off1, off2);
+    _t->get_offsets(pos, off0, off1, off2);
     Offset transl_off = Offset((((_off >> 1) & 1) == 1 ? -1 : 0),
                                (((_off   ) & 1) == 1 ? -1 : 0));
     if (_it == T::STORED_COVER_DOMAIN)
@@ -385,7 +335,7 @@ class Periodic_2_triangulation_segment_iterator_2
   {
     if (_it == T::UNIQUE || _it == T::UNIQUE_COVER_DOMAIN)
       {
-        while (pos != _t->edges_end() && !is_canonical() )
+        while (pos != _t->edges_end() && !_t->is_canonical(*pos) )
           ++pos;
       }
   }
@@ -407,7 +357,7 @@ class Periodic_2_triangulation_segment_iterator_2
           {
             ++pos;
           }
-        while (pos != _t->edges_end() && !is_canonical());
+        while (pos != _t->edges_end() && !_t->is_canonical(*pos));
         break;
       case T::STORED_COVER_DOMAIN:
       case T::UNIQUE_COVER_DOMAIN:
@@ -431,7 +381,7 @@ class Periodic_2_triangulation_segment_iterator_2
           {
             --pos;
           }
-        while (pos != _t->edges_begin() && !is_canonical());
+        while (pos != _t->edges_begin() && !_t->is_canonical(*pos));
         break;
       case T::STORED_COVER_DOMAIN:
       case T::UNIQUE_COVER_DOMAIN:
@@ -490,35 +440,6 @@ class Periodic_2_triangulation_segment_iterator_2
   mutable Periodic_segment periodic_segment; // current segment.
 
 private:
-  // check whether pos points onto a unique edge or not.
-  // If we are computing in 1-sheeted covering this should
-  // always be true.
-  bool is_canonical()
-  {
-    // fetch all offsets
-    Offset off0, off1;
-    get_edge_offsets(off0, off1);
-
-    if (_t->number_of_sheets() != make_array(1, 1))
-      {
-        // If there is one offset with entries larger than 1 then we are
-        // talking about a vertex that is too far away from the original
-        // domain to belong to a canonical triangle.
-        if (off0.x() > 1) return false;
-        if (off0.y() > 1) return false;
-        if (off1.x() > 1) return false;
-        if (off1.y() > 1) return false;
-      }
-
-    // If there is one direction of space for which all offsets are
-    // non-zero then the edge is not canonical because we can
-    // take the copy closer towards the origin in that direction.
-    int offx = off0.x() & off1.x();
-    int offy = off0.y() & off1.y();
-
-    return (offx == 0 && offy == 0);
-  }
-
   // Artificial incrementation function that takes periodic
   // copies into account.
   void increment_domain()
@@ -533,7 +454,7 @@ class Periodic_2_triangulation_segment_iterator_2
             ++pos;
           }
         while (_it == T::UNIQUE_COVER_DOMAIN
-               && pos != _t->edges_end() && !is_canonical());
+               && pos != _t->edges_end() && !_t->is_canonical(*pos));
       }
     else
       {
@@ -557,7 +478,7 @@ class Periodic_2_triangulation_segment_iterator_2
           {
             --pos;
           }
-        while (_it == T::UNIQUE_COVER_DOMAIN && !is_canonical());
+        while (_it == T::UNIQUE_COVER_DOMAIN && !_t->is_canonical(*pos));
         _off = get_drawing_offsets();
       }
     else
@@ -572,20 +493,6 @@ class Periodic_2_triangulation_segment_iterator_2
       }
   }
 
-  // Get the canonicalized offsets of an edge.
-  // This works in any cover that is encoded in _t->combine_offsets
-  void get_edge_offsets(Offset &off0, Offset &off1) const
-  {
-    Offset cell_off0 = _t->int_to_off(pos->first->offset(_t->cw(pos->second)));
-    Offset cell_off1 = _t->int_to_off(pos->first->offset(_t->ccw(pos->second)));
-    Offset diff_off((cell_off0.x() == 1 && cell_off1.x() == 1) ? -1 : 0,
-                    (cell_off0.y() == 1 && cell_off1.y() == 1) ? -1 : 0);
-    off0 = _t->combine_offsets(_t->get_offset(pos->first, _t->cw(pos->second)),
-                               diff_off);
-    off1 = _t->combine_offsets(_t->get_offset(pos->first, _t->ccw(pos->second)),
-                               diff_off);
-  }
-
   // return an integer that encodes the translations which have to be
   // applied to the edge *pos
   int get_drawing_offsets()
@@ -598,7 +505,7 @@ class Periodic_2_triangulation_segment_iterator_2
     // internally stored inside the cell telling us that this cell
     // wraps around the domain.
     if (_it == T::UNIQUE_COVER_DOMAIN)
-      get_edge_offsets(off0, off1);
+      _t->get_offsets(*pos, off0, off1);
     else
       {
         CGAL_assertion(_it == T::STORED_COVER_DOMAIN);
@@ -618,7 +525,7 @@ class Periodic_2_triangulation_segment_iterator_2
   {
     CGAL_assertion(pos->first != typename T::Face_handle());
     Offset off0, off1;
-    get_edge_offsets(off0, off1);
+    _t->get_offsets(*pos, off0, off1);
     Offset transl_off = Offset((((_off >> 1) & 1) == 1 ? -1 : 0),
                                (( _off    & 1) == 1 ? -1 : 0));
     if (_it == T::STORED_COVER_DOMAIN)
@@ -681,7 +588,7 @@ class Periodic_2_triangulation_point_iterator_2
   {
     if (_it == T::UNIQUE || _it == T::UNIQUE_COVER_DOMAIN)
       {
-        while (pos != _t->vertices_end() && !is_canonical() )
+        while (pos != _t->vertices_end() && !_t->is_canonical(pos) )
           ++pos;
       }
   }
@@ -705,7 +612,7 @@ class Periodic_2_triangulation_point_iterator_2
           {
             ++pos;
           }
-        while (pos != _t->vertices_end() && !is_canonical());
+        while (pos != _t->vertices_end() && !_t->is_canonical(pos));
         break;
       default:
         CGAL_assertion(false);
@@ -727,7 +634,7 @@ class Periodic_2_triangulation_point_iterator_2
           {
             --pos;
           }
-        while (pos != _t->vertices_begin() && !is_canonical());
+        while (pos != _t->vertices_begin() && !_t->is_canonical(pos));
         break;
       default:
         CGAL_assertion(false);
@@ -785,14 +692,6 @@ class Periodic_2_triangulation_point_iterator_2
   mutable Periodic_point periodic_point; // current point.
 
 private:
-  // check whether pos points onto a vertex inside the original
-  // domain. If we are computing in 1-sheeted covering this should
-  // always be true.
-  bool is_canonical()
-  {
-    return (_t->get_offset(pos).is_null());
-  }
-
   Periodic_point construct_periodic_point() const
   {
     CGAL_assertion(pos != typename T::Vertex_handle());
@@ -801,23 +700,91 @@ class Periodic_2_triangulation_point_iterator_2
   }
 };
 
-namespace Periodic_2_triangulation_2_internal
-{
+namespace Periodic_2_triangulation_2_internal {
+
+// returns `true` if the simplex is not canonical, and has to be filtered out
 template <class T>
 class Domain_tester
 {
-    const T *t;
+  typedef typename T::Offset                              Offset;
+
+  const T *t;
+
+public:
+  Domain_tester() {}
+  Domain_tester(const T *tr) : t(tr) {}
+
+  bool operator()(const typename T::Vertex_iterator v) const
+  {
+    return !(t->get_offset(v).is_null());
+  }
+
+  bool operator()(const typename T::Edge_iterator e) const
+  {
+    Offset eo_0 = t->int_to_off(e->first->offset(t->cw(e->second)));
+    Offset eo_1 = t->int_to_off(e->first->offset(t->ccw(e->second)));
+
+    Offset diff_off((eo_0.x() == 1 && eo_1.x() == 1) ? -1 : 0,
+                    (eo_0.y() == 1 && eo_1.y() == 1) ? -1 : 0);
+    Offset off0 = t->combine_offsets(t->get_offset(e->first, t->cw(e->second)), diff_off);
+    Offset off1 = t->combine_offsets(t->get_offset(e->first, t->ccw(e->second)), diff_off);
+
+    if (t->number_of_sheets() != make_array(1, 1))
+    {
+      // If there is one offset with entries larger than 1 then we are
+      // talking about a vertex that is too far away from the original
+      // domain to belong to a canonical edge.
+      if (off0.x() > 1) return true;
+      if (off0.y() > 1) return true;
+      if (off1.x() > 1) return true;
+      if (off1.y() > 1) return true;
+    }
+
+    // If there is one direction of space for which all offsets are
+    // non-zero then the edge is not canonical because we can
+    // take the copy closer towards the origin in that direction.
+    int offx = off0.x() & off1.x();
+    int offy = off0.y() & off1.y();
+
+    return (offx != 0 || offy != 0);
+  }
+
+  bool operator()(const typename T::Face_iterator f) const
+  {
+    Offset fo_0 = t->int_to_off(f->offset(0));
+    Offset fo_1 = t->int_to_off(f->offset(1));
+    Offset fo_2 = t->int_to_off(f->offset(2));
 
-  public:
-    Domain_tester() {}
-    Domain_tester(const T *tr) : t(tr) {}
+    Offset diff_off((fo_0.x() == 1 && fo_1.x() == 1 && fo_2.x() == 1) ? -1 : 0,
+                    (fo_0.y() == 1 && fo_1.y() == 1 && fo_2.y() == 1) ? -1 : 0);
+    Offset off0 = t->combine_offsets(t->get_offset(f, 0), diff_off);
+    Offset off1 = t->combine_offsets(t->get_offset(f, 1), diff_off);
+    Offset off2 = t->combine_offsets(t->get_offset(f, 2), diff_off);
 
-    bool operator()(const typename T::Vertex_iterator & v) const
+    if (t->number_of_sheets() != make_array(1, 1))
     {
-        return (t->get_offset(v) != typename T::Offset(0, 0));
+      // If there is one offset with entries larger than 1 then we are
+      // talking about a vertex that is too far away from the original
+      // domain to belong to a canonical triangle.
+      if (off0.x() > 1) return true;
+      if (off0.y() > 1) return true;
+      if (off1.x() > 1) return true;
+      if (off1.y() > 1) return true;
+      if (off2.x() > 1) return true;
+      if (off2.y() > 1) return true;
     }
+
+    // If there is one direction of space for which all offsets are
+    // non-zero then the edge is not canonical because we can
+    // take the copy closer towards the origin in that direction.
+    int offx = off0.x() & off1.x() & off2.x();
+    int offy = off0.y() & off1.y() & off2.y();
+
+    return (offx != 0 || offy != 0);
+  }
 };
-}
+
+} // Periodic_2_triangulation_2_internal
 
 // Iterates over the vertices in a periodic triangulation that are
 // located inside the original cube.
@@ -872,6 +839,108 @@ class Periodic_2_triangulation_unique_vertex_iterator_2
   }
 };
 
-} //namespace CGAL
+// Iterates over the canonical edges in a periodic triangulation.
+// Derives from Filter_iterator in order to add a conversion to handle
+//
+// Comments:
+// When computing in 1-sheeted covering, there will be no difference
+// between a normal Edge_iterator and this iterator
+template <class T>
+class Periodic_2_triangulation_unique_edge_iterator_2
+        : public Filter_iterator<typename T::Edge_iterator, Periodic_2_triangulation_2_internal::Domain_tester<T> >
+{
+  typedef typename T::Edge Edge;
+  typedef typename T::Edge_iterator Edge_iterator;
+
+  typedef typename Periodic_2_triangulation_2_internal::Domain_tester<T> Tester;
+
+  typedef Filter_iterator<Edge_iterator, Tester > Base;
+  typedef Periodic_2_triangulation_unique_edge_iterator_2 Self;
+
+public:
+  Periodic_2_triangulation_unique_edge_iterator_2() : Base() {}
+  Periodic_2_triangulation_unique_edge_iterator_2(const Base &b) : Base(b) {}
+
+  Self & operator++()
+  {
+    Base::operator++();
+    return *this;
+  }
+  Self & operator--()
+  {
+    Base::operator--();
+    return *this;
+  }
+  Self operator++(int)
+  {
+    Self tmp(*this);
+    ++(*this);
+    return tmp;
+  }
+  Self operator--(int)
+  {
+    Self tmp(*this);
+    --(*this);
+    return tmp;
+  }
+
+  operator Edge() const
+  {
+    return Base::base();
+  }
+};
+
+// Iterates over the canonical faces in a periodic triangulation.
+// Derives from Filter_iterator in order to add a conversion to handle
+//
+// Comments:
+// When computing in 1-sheeted covering, there will be no difference
+// between a normal Face_iterator and this iterator
+template <class T>
+class Periodic_2_triangulation_unique_face_iterator_2
+        : public Filter_iterator<typename T::Face_iterator, Periodic_2_triangulation_2_internal::Domain_tester<T> >
+{
+  typedef typename T::Face_handle Face_handle;
+  typedef typename T::Face_iterator Face_iterator;
+
+  typedef typename Periodic_2_triangulation_2_internal::Domain_tester<T> Tester;
+
+  typedef Filter_iterator<Face_iterator, Tester > Base;
+  typedef Periodic_2_triangulation_unique_face_iterator_2 Self;
+
+public:
+  Periodic_2_triangulation_unique_face_iterator_2() : Base() {}
+  Periodic_2_triangulation_unique_face_iterator_2(const Base &b) : Base(b) {}
+
+  Self & operator++()
+  {
+    Base::operator++();
+    return *this;
+  }
+  Self & operator--()
+  {
+    Base::operator--();
+    return *this;
+  }
+  Self operator++(int)
+  {
+    Self tmp(*this);
+    ++(*this);
+    return tmp;
+  }
+  Self operator--(int)
+  {
+    Self tmp(*this);
+    --(*this);
+    return tmp;
+  }
+
+  operator Face_handle() const
+  {
+    return Base::base();
+  }
+};
+
+} // namespace CGAL
 
 #endif // CGAL_PERIODIC_2_TRIANGULATION_ITERATORS_2_H
diff --git a/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/include/interface_test.h b/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/include/interface_test.h
index efbd3cf0be47..7c50e0a4252d 100644
--- a/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/include/interface_test.h
+++ b/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/include/interface_test.h
@@ -217,19 +217,19 @@ void test_iterators()
     }
   assert(size == t_const.number_of_stored_vertices());
   size = 0;
-  for (typename T::Unique_vertex_iterator uvit = t_const.unique_vertices_begin();
-       uvit != t_const.unique_vertices_end(); ++uvit)
+  for (typename T::Vertex_iterator vit = t_const.all_vertices_begin();
+       vit != t_const.all_vertices_end(); ++vit)
     {
       ++size;
     }
-  assert(size == t_const.number_of_vertices());
+  assert(size == t_const.number_of_stored_vertices());
   size = 0;
-  for (typename T::Vertex_iterator vit = t_const.all_vertices_begin();
-       vit != t_const.all_vertices_end(); ++vit)
+  for (typename T::Unique_vertex_iterator uvit = t_const.unique_vertices_begin();
+       uvit != t_const.unique_vertices_end(); ++uvit)
     {
       ++size;
     }
-  assert(size == t_const.number_of_stored_vertices());
+  assert(size == t_const.number_of_vertices());
 
   // edges
   size = 0;
@@ -246,6 +246,13 @@ void test_iterators()
       ++size;
     }
   assert(size == t_const.number_of_stored_edges());
+  size = 0;
+  for (typename T::Unique_edge_iterator uvit = t_const.unique_edges_begin();
+       uvit != t_const.unique_edges_end(); ++uvit)
+    {
+      ++size;
+    }
+  assert(size == t_const.number_of_edges());
 
   // faces
   size = 0;
@@ -262,6 +269,13 @@ void test_iterators()
       ++size;
     }
   assert(size == t_const.number_of_stored_faces());
+  size = 0;
+  for (typename T::Unique_face_iterator uvit = t_const.unique_faces_begin();
+       uvit != t_const.unique_faces_end(); ++uvit)
+    {
+      ++size;
+    }
+  assert(size == t_const.number_of_faces());
 
   /// Geometric iterators
   for (typename T::Periodic_point_iterator ppit = t_const.periodic_points_begin();
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h
index c6399eeaa0fc..19c56b919509 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h
@@ -169,6 +169,13 @@ class Periodic_3_triangulation_3
   typedef Facet_iterator                       All_facets_iterator;
   typedef Edge_iterator                        All_edges_iterator;
   typedef Vertex_iterator                      All_vertices_iterator;
+
+  typedef Periodic_3_triangulation_unique_cell_iterator_3<Self>
+                                               Unique_cell_iterator;
+  typedef Periodic_3_triangulation_unique_facet_iterator_3<Self>
+                                               Unique_facet_iterator;
+  typedef Periodic_3_triangulation_unique_edge_iterator_3<Self>
+                                               Unique_edge_iterator;
   typedef Periodic_3_triangulation_unique_vertex_iterator_3<Self>
                                                Unique_vertex_iterator;
 
@@ -397,26 +404,14 @@ class Periodic_3_triangulation_3
   }
 
   const Covering_sheets& number_of_sheets() const { return _cover; }
-  const std::pair<Vertex_handle, Offset> original_vertex(const Vertex_handle v) const
-  {
-    return (virtual_vertices.find(v) == virtual_vertices.end()) ?
-      std::make_pair(v,Offset()) : virtual_vertices.find(v)->second;
-  }
-  const std::vector<Vertex_handle>& periodic_copies(const Vertex_handle v) const
-  {
-    CGAL_precondition(number_of_sheets() != CGAL::make_array(1,1,1));
-    CGAL_precondition(virtual_vertices.find(v) == virtual_vertices.end());
-    CGAL_assertion(
-        virtual_vertices_reverse.find(v) != virtual_vertices_reverse.end());
-    return virtual_vertices_reverse.find(v)->second;
-  }
 
   bool is_triangulation_in_1_sheet() const;
-
   void convert_to_1_sheeted_covering();
+
   virtual void update_cover_data_after_converting_to_27_sheeted_covering() { }
   void convert_to_27_sheeted_covering();
 
+public:
   size_type number_of_cells() const {
     if(is_1_cover()) return _tds.number_of_cells();
     else return _tds.number_of_cells()/27;
@@ -460,14 +455,6 @@ class Periodic_3_triangulation_3
     _cover = cover;
   }
 
-public:
-  bool is_virtual(Vertex_handle v)
-  {
-    if(is_1_cover())
-      return false;
-    return (virtual_vertices.find(v) != virtual_vertices.end());
-  }
-
 public:
   // Offset converters
   int off_to_int(const Offset& off) const
@@ -549,6 +536,232 @@ class Periodic_3_triangulation_3
     c->set_offsets(o0i,o1i,o2i,o3i);
   }
 
+public:
+  // undocumented access functions
+  Offset get_offset(Cell_handle ch, int i) const
+  {
+    if(is_1_cover())
+      return int_to_off(ch->offset(i));
+
+    Virtual_vertex_map_it it = virtual_vertices.find(ch->vertex(i));
+    if(it != virtual_vertices.end())
+      return combine_offsets(it->second.second, int_to_off(ch->offset(i)));
+    else
+      return combine_offsets(Offset(), int_to_off(ch->offset(i)));
+  }
+
+  Offset get_offset(Vertex_handle vh) const
+  {
+    if(is_1_cover())
+      return Offset();
+
+    Virtual_vertex_map_it it = virtual_vertices.find(vh);
+    if(it != virtual_vertices.end())
+      return it->second.second;
+    else
+      return Offset();
+  }
+
+    // Get the canonicalized offsets of a cell.
+  void get_offsets(Cell_handle ch,
+                   Offset& off0, Offset& off1, Offset& off2, Offset& off3) const
+  {
+    Offset cell_off0 = int_to_off(ch->offset(0));
+    Offset cell_off1 = int_to_off(ch->offset(1));
+    Offset cell_off2 = int_to_off(ch->offset(2));
+    Offset cell_off3 = int_to_off(ch->offset(3));
+    Offset diff_off((cell_off0.x() == 1 && cell_off1.x() == 1 &&
+                     cell_off2.x() == 1 && cell_off3.x() == 1) ? -1 : 0,
+                    (cell_off0.y() == 1 && cell_off1.y() == 1 &&
+                     cell_off2.y() == 1 && cell_off3.y() == 1) ? -1 : 0,
+                    (cell_off0.z() == 1 && cell_off1.z() == 1 &&
+                     cell_off2.z() == 1 && cell_off3.z() == 1) ? -1 : 0);
+    off0 = combine_offsets(get_offset(ch,0), diff_off);
+    off1 = combine_offsets(get_offset(ch,1), diff_off);
+    off2 = combine_offsets(get_offset(ch,2), diff_off);
+    off3 = combine_offsets(get_offset(ch,3), diff_off);
+  }
+
+  // Gets the canonicalized offsets of a face.
+  void get_offsets(const Facet& f,
+                   Offset& off0, Offset& off1, Offset& off2) const
+  {
+    Offset cell_off0 = int_to_off(f.first->offset((f.second+1)&3));
+    Offset cell_off1 = int_to_off(f.first->offset((f.second+2)&3));
+    Offset cell_off2 = int_to_off(f.first->offset((f.second+3)&3));
+    Offset diff_off((cell_off0.x() == 1 && cell_off1.x() == 1 && cell_off2.x() == 1) ? -1 : 0,
+                    (cell_off0.y() == 1 && cell_off1.y() == 1 && cell_off2.y() == 1) ? -1 : 0,
+                    (cell_off0.z() == 1 && cell_off1.z() == 1 && cell_off2.z() == 1) ? -1 : 0);
+    off0 = combine_offsets(get_offset(f.first, (f.second+1)&3), diff_off);
+    off1 = combine_offsets(get_offset(f.first, (f.second+2)&3), diff_off);
+    off2 = combine_offsets(get_offset(f.first, (f.second+3)&3), diff_off);
+  }
+
+  // Gets the canonicalized offsets of an edge.
+  void get_offsets(const Edge& e,
+                   Offset& off0, Offset& off1) const
+  {
+    Offset cell_off0 = int_to_off(e.first->offset(e.second));
+    Offset cell_off1 = int_to_off(e.first->offset(e.third));
+    Offset diff_off((cell_off0.x()==1 && cell_off1.x()==1) ? -1 : 0,
+                    (cell_off0.y()==1 && cell_off1.y()==1) ? -1 : 0,
+                    (cell_off0.z()==1 && cell_off1.z()==1) ? -1 : 0);
+    off0 = combine_offsets(get_offset(e.first, e.second), diff_off);
+    off1 = combine_offsets(get_offset(e.first, e.third), diff_off);
+  }
+
+public:
+  Offset combine_offsets(const Offset& o_c, const Offset& o_t) const
+  {
+    Offset o_ct(_cover[0]*o_t.x(), _cover[1]*o_t.y(), _cover[2]*o_t.z());
+    return o_c + o_ct;
+  }
+
+public:
+  Offset neighbor_offset(Cell_handle ch, int i, Cell_handle nb) const;
+
+  Offset neighbor_offset(Cell_handle ch, int i) const
+  {
+    return neighbor_offset(ch, i, ch->neighbor(i));
+  }
+
+public:
+  /// Tests whether a vertex is a periodic copy of a vertex in the 3-cover.
+  bool is_virtual(Vertex_handle vh) const
+  {
+    if(is_1_cover())
+      return false;
+    return (virtual_vertices.find(vh) != virtual_vertices.end());
+  }
+
+  /// Returns the non-virtual (i.e. canonical) copy of the vertex.
+  Vertex_handle get_original_vertex(Vertex_handle vh) const
+  {
+    if(is_1_cover())
+      return vh;
+
+    Virtual_vertex_map_it it = virtual_vertices.find(vh);
+    if(it != virtual_vertices.end())
+      return it->second.first;
+    else
+      return vh;
+  }
+
+  const std::pair<Vertex_handle, Offset> original_vertex(const Vertex_handle v) const
+  {
+    return (virtual_vertices.find(v) == virtual_vertices.end()) ?
+      std::make_pair(v,Offset()) : virtual_vertices.find(v)->second;
+  }
+
+  const std::vector<Vertex_handle>& periodic_copies(const Vertex_handle v) const
+  {
+    CGAL_precondition(number_of_sheets() != CGAL::make_array(1,1,1));
+    CGAL_precondition(virtual_vertices.find(v) == virtual_vertices.end());
+    CGAL_assertion(
+        virtual_vertices_reverse.find(v) != virtual_vertices_reverse.end());
+    return virtual_vertices_reverse.find(v)->second;
+  }
+
+public:
+  bool is_canonical(Cell_handle ch) const
+  {
+    if(is_1_cover())
+      return true;
+
+    Offset off0, off1, off2, off3;
+    get_offsets(ch, off0, off1, off2, off3);
+
+    // If there is one offset with entries larger than 1 then we are
+    // talking about a vertex that is too far away from the original
+    // domain to belong to a canonical triangle.
+    if (off0.x() > 1) return false;
+    if (off0.y() > 1) return false;
+    if (off0.z() > 1) return false;
+    if (off1.x() > 1) return false;
+    if (off1.y() > 1) return false;
+    if (off1.z() > 1) return false;
+    if (off2.x() > 1) return false;
+    if (off2.y() > 1) return false;
+    if (off2.z() > 1) return false;
+    if (off3.x() > 1) return false;
+    if (off3.y() > 1) return false;
+    if (off3.z() > 1) return false;
+
+    // If there is one direction of space for which all offsets are
+    // non-zero then the edge is not canonical because we can
+    // take the copy closer towards the origin in that direction.
+    int offx = off0.x() & off1.x() & off2.x() & off3.x();
+    int offy = off0.y() & off1.y() & off2.y() & off3.y();
+    int offz = off0.z() & off1.z() & off2.z() & off3.z();
+
+    return (offx == 0 && offy == 0 && offz == 0);
+  }
+
+  bool is_canonical(const Edge& e) const
+  {
+    if(is_1_cover())
+      return true;
+
+    Offset off0, off1;
+    get_offsets(e, off0, off1);
+
+    // If there is one offset with entries larger than 1 then we are
+    // talking about a vertex that is too far away from the original
+    // domain to belong to a canonical edge.
+    if (off0.x() > 1) return false;
+    if (off0.y() > 1) return false;
+    if (off0.z() > 1) return false;
+    if (off1.x() > 1) return false;
+    if (off1.y() > 1) return false;
+    if (off1.z() > 1) return false;
+
+    // If there is one direction of space for which all offsets are
+    // non-zero then the edge is not canonical because we can
+    // take the copy closer towards the origin in that direction.
+    int offx = off0.x() & off1.x();
+    int offy = off0.y() & off1.y();
+    int offz = off0.z() & off1.z();
+
+    return (offx == 0 && offy == 0 && offz == 0);
+  }
+
+  bool is_canonical(const Facet& f) const
+  {
+    if(is_1_cover())
+      return true;
+
+    Offset off0, off1, off2;
+    get_offsets(f, off0, off1, off2);
+
+    // If there is one offset with entries larger than 1 then we are
+    // talking about a vertex that is too far away from the original
+    // domain to belong to a canonical triangle.
+    if(off0.x() > 1) return false;
+    if(off0.y() > 1) return false;
+    if(off0.z() > 1) return false;
+    if(off1.x() > 1) return false;
+    if(off1.y() > 1) return false;
+    if(off1.z() > 1) return false;
+    if(off2.x() > 1) return false;
+    if(off2.y() > 1) return false;
+    if(off2.z() > 1) return false;
+
+    // If there is one direction of space for which all offsets are
+    // non-zero then the facet is not canonical because we can
+    // take the copy closer towards the origin in that direction.
+    int offx = off0.x() & off1.x() & off2.x();
+    int offy = off0.y() & off1.y() & off2.y();
+    int offz = off0.z() & off1.z() & off2.z();
+
+    return (offx == 0 && offy == 0 && offz == 0);
+  }
+
+  /// Tests whether a vertex belongs to the original (canonical) domain.
+  bool is_canonical(Vertex_handle vh) const
+  {
+    return !is_virtual(vh);
+  }
+
 public:
   /** @name Wrapping the traits */
   // Note that calling functors with "construct_point(p), offset" and not
@@ -988,6 +1201,14 @@ class Periodic_3_triangulation_3
   // end of geometric functions
 
 public:
+  // These functions give the pair (vertex, offset) that corresponds to the
+  // i-th vertex of cell ch or vertex vh, respectively.
+  void get_vertex(Cell_handle ch, int i, Vertex_handle& vh, Offset& off) const;
+  void get_vertex(Vertex_handle vh_i, Vertex_handle& vh, Offset& off) const;
+
+  // Auxiliary functions
+  Cell_handle get_cell(const Vertex_handle* vh) const;
+
   /** @name Queries */
   bool is_vertex(const Point& p, Vertex_handle& v) const;
 
@@ -1305,6 +1526,14 @@ class Periodic_3_triangulation_3
   std::vector<Vertex_handle> insert_generic_dummy_points();
 
 protected:
+  template<class Conflict_tester>
+  Offset get_location_offset(const Conflict_tester& tester,
+                             Cell_handle c) const;
+
+  template<class Conflict_tester>
+  Offset get_location_offset(const Conflict_tester& tester,
+                             Cell_handle c, bool& found) const;
+
   // this is needed for compatibility reasons
   template <class Conflict_test, class OutputIteratorBoundaryFacets,
             class OutputIteratorCells, class OutputIteratorInternalFacets>
@@ -1530,6 +1759,16 @@ class Periodic_3_triangulation_3
     return _tds.facets_end();
   }
 
+  // Unique iterators
+
+  Unique_cell_iterator unique_cells_begin() const {
+    return CGAL::filter_iterator(cells_end(), Domain_tester<Self>(this),
+                                 cells_begin());
+  }
+  Unique_cell_iterator unique_cells_end() const {
+    return CGAL::filter_iterator(cells_end(), Domain_tester<Self>(this));
+  }
+
   Unique_vertex_iterator unique_vertices_begin() const {
     return CGAL::filter_iterator(vertices_end(), Domain_tester<Self>(this),
                                  vertices_begin());
@@ -1538,6 +1777,22 @@ class Periodic_3_triangulation_3
     return CGAL::filter_iterator(vertices_end(), Domain_tester<Self>(this));
   }
 
+  Unique_edge_iterator unique_edges_begin() const {
+    return CGAL::filter_iterator(edges_end(), Domain_tester<Self>(this),
+                                 edges_begin());
+  }
+  Unique_edge_iterator unique_edges_end() const {
+    return CGAL::filter_iterator(edges_end(), Domain_tester<Self>(this));
+  }
+
+  Unique_facet_iterator unique_facets_begin() const {
+    return CGAL::filter_iterator(facets_end(), Domain_tester<Self>(this),
+                                 facets_begin());
+  }
+  Unique_facet_iterator unique_facets_end() const {
+    return CGAL::filter_iterator(facets_end(), Domain_tester<Self>(this));
+  }
+
   // Geometric iterators
   Periodic_tetrahedron_iterator periodic_tetrahedra_begin(
       Iterator_type it = STORED) const {
@@ -1695,75 +1950,6 @@ class Periodic_3_triangulation_3
     }
   };
 
-public:
-  // undocumented access functions
-  Offset get_offset(Cell_handle ch, int i) const
-  {
-    if(is_1_cover())
-      return int_to_off(ch->offset(i));
-
-    Virtual_vertex_map_it it = virtual_vertices.find(ch->vertex(i));
-    if(it != virtual_vertices.end())
-      return combine_offsets(it->second.second, int_to_off(ch->offset(i)));
-    else
-      return combine_offsets(Offset(), int_to_off(ch->offset(i)));
-  }
-
-  Offset get_offset(Vertex_handle vh) const
-  {
-    if(is_1_cover())
-      return Offset();
-
-    Virtual_vertex_map_it it = virtual_vertices.find(vh);
-    if(it != virtual_vertices.end())
-      return it->second.second;
-    else
-      return Offset();
-  }
-
-  Vertex_handle get_original_vertex(Vertex_handle vh) const
-  {
-    if(is_1_cover())
-      return vh;
-
-    Virtual_vertex_map_it it = virtual_vertices.find(vh);
-    if(it != virtual_vertices.end())
-      return it->second.first;
-    else
-      return vh;
-  }
-
-  Offset combine_offsets(const Offset& o_c, const Offset& o_t) const
-  {
-    Offset o_ct(_cover[0]*o_t.x(), _cover[1]*o_t.y(), _cover[2]*o_t.z());
-    return o_c + o_ct;
-  }
-
-  // These functions give the pair (vertex, offset) that corresponds to the
-  // i-th vertex of cell ch or vertex vh, respectively.
-  void get_vertex(Cell_handle ch, int i, Vertex_handle& vh, Offset& off) const;
-  void get_vertex(Vertex_handle vh_i, Vertex_handle& vh, Offset& off) const;
-
-protected:
-  // Auxiliary functions
-  Cell_handle get_cell(const Vertex_handle* vh) const;
-
-  template<class Conflict_tester>
-  Offset get_location_offset(const Conflict_tester& tester,
-                             Cell_handle c) const;
-
-  template<class Conflict_tester>
-  Offset get_location_offset(const Conflict_tester& tester,
-                             Cell_handle c, bool& found) const;
-
-  Offset neighbor_offset(Cell_handle ch, int i, Cell_handle nb) const;
-
-public:
-  Offset neighbor_offset(Cell_handle ch, int i) const
-  {
-    return neighbor_offset(ch, i, ch->neighbor(i));
-  }
-
 protected:
   /** @name Friends */
   friend std::istream& operator>> <>
@@ -1788,51 +1974,6 @@ class Periodic_3_triangulation_3
     return construct_periodic_point(p);
   }
 
-public:
-  bool is_canonical(const Facet& f) const
-  {
-    if(number_of_sheets() == CGAL::make_array(1,1,1))
-      return true;
-
-    Offset cell_off0 = int_to_off(f.first->offset((f.second+1)&3));
-    Offset cell_off1 = int_to_off(f.first->offset((f.second+2)&3));
-    Offset cell_off2 = int_to_off(f.first->offset((f.second+3)&3));
-    Offset diff_off((cell_off0.x() == 1
-                     && cell_off1.x() == 1
-                     && cell_off2.x() == 1) ? -1 : 0,
-                    (cell_off0.y() == 1
-                     && cell_off1.y() == 1
-                     && cell_off2.y() == 1) ? -1 : 0,
-                    (cell_off0.z() == 1
-                     && cell_off1.z() == 1
-                     && cell_off2.z() == 1) ? -1 : 0);
-    Offset off0 = combine_offsets(get_offset(f.first, (f.second+1)&3), diff_off);
-    Offset off1 = combine_offsets(get_offset(f.first, (f.second+2)&3), diff_off);
-    Offset off2 = combine_offsets(get_offset(f.first, (f.second+3)&3), diff_off);
-
-    // If there is one offset with entries larger than 1 then we are
-    // talking about a vertex that is too far away from the original
-    // domain to belong to a canonical triangle.
-    if(off0.x() > 1) return false;
-    if(off0.y() > 1) return false;
-    if(off0.z() > 1) return false;
-    if(off1.x() > 1) return false;
-    if(off1.y() > 1) return false;
-    if(off1.z() > 1) return false;
-    if(off2.x() > 1) return false;
-    if(off2.y() > 1) return false;
-    if(off2.z() > 1) return false;
-
-    // If there is one direction of space for which all offsets are
-    // non-zero then the edge is not canonical because we can
-    // take the copy closer towards the origin in that direction.
-    int offx = off0.x() & off1.x() & off2.x();
-    int offy = off0.y() & off1.y() & off2.y();
-    int offz = off0.z() & off1.z() & off2.z();
-
-    return (offx == 0 && offy == 0 && offz == 0);
-  }
-
 protected:
   template <class ConstructCircumcenter>
   bool canonical_dual_segment(Cell_handle c, int i, Periodic_segment_3& ps,
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_iterators_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_iterators_3.h
index 947b8b553e52..719060bed29d 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_iterators_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_iterators_3.h
@@ -63,7 +63,7 @@ class Periodic_3_triangulation_tetrahedron_iterator_3 {
                                                   Iterator_type it = T::STORED)
     : _t(t), pos(_t->cells_begin()), _it(it), _off(0) {
     if (_it == T::UNIQUE || _it == T::UNIQUE_COVER_DOMAIN) {
-      while (pos != _t->cells_end() && !is_canonical() )
+      while (pos != _t->cells_end() && !_t->is_canonical(pos) )
         ++pos;
     }
   }
@@ -79,7 +79,7 @@ class Periodic_3_triangulation_tetrahedron_iterator_3 {
       ++pos;
       break;
     case T::UNIQUE:
-      do { ++pos; } while (pos != _t->cells_end() && !is_canonical());
+      do { ++pos; } while (pos != _t->cells_end() && !_t->is_canonical(pos));
       break;
     case T::STORED_COVER_DOMAIN:
     case T::UNIQUE_COVER_DOMAIN:
@@ -97,7 +97,7 @@ class Periodic_3_triangulation_tetrahedron_iterator_3 {
       --pos;
       break;
     case T::UNIQUE:
-      do { --pos; } while (pos != _t->cells_begin() && !is_canonical());
+      do { --pos; } while (pos != _t->cells_begin() && !_t->is_canonical(pos));
       break;
     case T::STORED_COVER_DOMAIN:
     case T::UNIQUE_COVER_DOMAIN:
@@ -156,42 +156,6 @@ class Periodic_3_triangulation_tetrahedron_iterator_3 {
   mutable Periodic_tetrahedron periodic_tetrahedron; // current tetrahedron.
 
 private:
-  // check whether pos points onto a unique edge or not.
-  // If we are computing in 1-sheeted covering this should
-  // always be true.
-  bool is_canonical() {
-    // fetch all offsets
-    Offset off0, off1, off2, off3;
-    get_edge_offsets(off0, off1, off2, off3);
-
-    if (_t->number_of_sheets() != make_array(1,1,1)) {
-      // If there is one offset with entries larger than 1 then we are
-      // talking about a vertex that is too far away from the original
-      // domain to belong to a canonical triangle.
-      if (off0.x() > 1) return false;
-      if (off0.y() > 1) return false;
-      if (off0.z() > 1) return false;
-      if (off1.x() > 1) return false;
-      if (off1.y() > 1) return false;
-      if (off1.z() > 1) return false;
-      if (off2.x() > 1) return false;
-      if (off2.y() > 1) return false;
-      if (off2.z() > 1) return false;
-      if (off3.x() > 1) return false;
-      if (off3.y() > 1) return false;
-      if (off3.z() > 1) return false;
-    }
-
-    // If there is one direction of space for which all offsets are
-    // non-zero then the edge is not canonical because we can
-    // take the copy closer towards the origin in that direction.
-    int offx = off0.x() & off1.x() & off2.x() & off3.x();
-    int offy = off0.y() & off1.y() & off2.y() & off3.y();
-    int offz = off0.z() & off1.z() & off2.z() & off3.z();
-
-    return (offx == 0 && offy == 0 && offz == 0);
-  }
-
   // Artificial incrementation function that takes periodic
   // copies into account.
   void increment_domain() {
@@ -200,7 +164,7 @@ class Periodic_3_triangulation_tetrahedron_iterator_3 {
     if (_off == off) {
       _off = 0;
       do { ++pos; } while (_it == T::UNIQUE_COVER_DOMAIN
-                           && pos != _t->cells_end() && !is_canonical());
+                           && pos != _t->cells_end() && !_t->is_canonical(pos));
     } else {
       do {
         ++_off;
@@ -214,7 +178,7 @@ class Periodic_3_triangulation_tetrahedron_iterator_3 {
   void decrement_domain() {
     if (_off == 0) {
       if (pos == _t->cells_begin()) return;
-      do { --pos; } while (_it == T::UNIQUE_COVER_DOMAIN && !is_canonical());
+      do { --pos; } while (_it == T::UNIQUE_COVER_DOMAIN && !_t->is_canonical(pos));
       _off = get_drawing_offsets();
     } else {
       int off = get_drawing_offsets();
@@ -225,32 +189,6 @@ class Periodic_3_triangulation_tetrahedron_iterator_3 {
     }
   }
 
-  // Get the canonicalized offsets of an edge.
-  // This works in any cover that is encoded in _t->combine_offsets
-  void get_edge_offsets(Offset &off0, Offset &off1,
-                        Offset &off2, Offset &off3) const {
-    Offset cell_off0 = _t->int_to_off(pos->offset(0));
-    Offset cell_off1 = _t->int_to_off(pos->offset(1));
-    Offset cell_off2 = _t->int_to_off(pos->offset(2));
-    Offset cell_off3 = _t->int_to_off(pos->offset(3));
-    Offset diff_off((cell_off0.x() == 1
-                     && cell_off1.x() == 1
-                     && cell_off2.x() == 1
-                     && cell_off3.x() == 1)?-1:0,
-                    (cell_off0.y() == 1
-                     && cell_off1.y() == 1
-                     && cell_off2.y() == 1
-                     && cell_off3.y() == 1)?-1:0,
-                    (cell_off0.z() == 1
-                     && cell_off1.z() == 1
-                     && cell_off2.z() == 1
-                     && cell_off3.z() == 1)?-1:0);
-    off0 = _t->combine_offsets(_t->get_offset(pos,0), diff_off);
-    off1 = _t->combine_offsets(_t->get_offset(pos,1), diff_off);
-    off2 = _t->combine_offsets(_t->get_offset(pos,2), diff_off);
-    off3 = _t->combine_offsets(_t->get_offset(pos,3), diff_off);
-  }
-
   // return an integer that encodes the translations which have to be
   // applied to the edge *pos
   int get_drawing_offsets() {
@@ -262,7 +200,7 @@ class Periodic_3_triangulation_tetrahedron_iterator_3 {
     // internally stored inside the cell telling us that this cell
     // wraps around the domain.
     if (_it == T::UNIQUE_COVER_DOMAIN)
-      get_edge_offsets(off0,off1,off2,off3);
+      _t->get_offsets(pos, off0, off1, off2, off3);
     else {
       CGAL_assertion(_it == T::STORED_COVER_DOMAIN);
       off0 = _t->int_to_off(pos->offset(0));
@@ -303,7 +241,7 @@ class Periodic_3_triangulation_tetrahedron_iterator_3 {
   Periodic_tetrahedron construct_periodic_tetrahedron() const {
     CGAL_assertion(pos != typename T::Cell_handle());
     Offset off0, off1, off2, off3;
-    get_edge_offsets(off0, off1, off2, off3);
+    _t->get_offsets(pos, off0, off1, off2, off3);
     Offset transl_off = Offset((((_off>>2)&1)==1 ? -1:0),
                                (((_off>>1)&1)==1 ? -1:0),
                                (( _off    &1)==1 ? -1:0));
@@ -369,7 +307,7 @@ class Periodic_3_triangulation_triangle_iterator_3 {
                                                Iterator_type it = T::STORED)
     : _t(t), pos(_t->facets_begin()), _it(it), _off(0) {
     if (_it == T::UNIQUE || _it == T::UNIQUE_COVER_DOMAIN) {
-      while (pos != _t->facets_end() && !is_canonical() )
+      while (pos != _t->facets_end() && !_t->is_canonical(*pos) )
         ++pos;
     }
   }
@@ -385,7 +323,7 @@ class Periodic_3_triangulation_triangle_iterator_3 {
       ++pos;
       break;
     case T::UNIQUE:
-      do { ++pos; } while (pos != _t->facets_end() && !is_canonical());
+      do { ++pos; } while (pos != _t->facets_end() && !_t->is_canonical(*pos));
       break;
     case T::STORED_COVER_DOMAIN:
     case T::UNIQUE_COVER_DOMAIN:
@@ -403,7 +341,7 @@ class Periodic_3_triangulation_triangle_iterator_3 {
       --pos;
       break;
     case T::UNIQUE:
-      do { --pos; } while (pos != _t->facets_begin() && !is_canonical());
+      do { --pos; } while (pos != _t->facets_begin() && !_t->is_canonical(*pos));
       break;
     case T::STORED_COVER_DOMAIN:
     case T::UNIQUE_COVER_DOMAIN:
@@ -462,39 +400,6 @@ class Periodic_3_triangulation_triangle_iterator_3 {
   mutable Periodic_triangle periodic_triangle; // current segment.
 
 private:
-  // check whether pos points onto a unique edge or not.
-  // If we are computing in 1-sheeted covering this should
-  // always be true.
-  bool is_canonical() {
-    // fetch all offsets
-    Offset off0, off1, off2;
-    get_edge_offsets(off0, off1, off2);
-
-    if (_t->number_of_sheets() != make_array(1,1,1)) {
-      // If there is one offset with entries larger than 1 then we are
-      // talking about a vertex that is too far away from the original
-      // domain to belong to a canonical triangle.
-      if (off0.x() > 1) return false;
-      if (off0.y() > 1) return false;
-      if (off0.z() > 1) return false;
-      if (off1.x() > 1) return false;
-      if (off1.y() > 1) return false;
-      if (off1.z() > 1) return false;
-      if (off2.x() > 1) return false;
-      if (off2.y() > 1) return false;
-      if (off2.z() > 1) return false;
-    }
-
-    // If there is one direction of space for which all offsets are
-    // non-zero then the edge is not canonical because we can
-    // take the copy closer towards the origin in that direction.
-    int offx = off0.x() & off1.x() & off2.x();
-    int offy = off0.y() & off1.y() & off2.y();
-    int offz = off0.z() & off1.z() & off2.z();
-
-    return (offx == 0 && offy == 0 && offz == 0);
-  }
-
   // Artificial incrementation function that takes periodic
   // copies into account.
   void increment_domain() {
@@ -503,7 +408,7 @@ class Periodic_3_triangulation_triangle_iterator_3 {
     if (_off == off) {
       _off = 0;
       do { ++pos; } while (_it == T::UNIQUE_COVER_DOMAIN
-                           && pos != _t->facets_end() && !is_canonical());
+                           && pos != _t->facets_end() && !_t->is_canonical(*pos));
     } else {
       do {
         ++_off;
@@ -517,7 +422,7 @@ class Periodic_3_triangulation_triangle_iterator_3 {
   void decrement_domain() {
     if (_off == 0) {
       if (pos == _t->facets_begin()) return;
-      do { --pos; } while (_it == T::UNIQUE_COVER_DOMAIN && !is_canonical());
+      do { --pos; } while (_it == T::UNIQUE_COVER_DOMAIN && !_t->is_canonical(*pos));
       _off = get_drawing_offsets();
     } else {
       int off = get_drawing_offsets();
@@ -528,32 +433,6 @@ class Periodic_3_triangulation_triangle_iterator_3 {
     }
   }
 
-  // Get the canonicalized offsets of an edge.
-  // This works in any cover that is encoded in _t->combine_offsets
-  void get_edge_offsets(Offset &off0, Offset &off1, Offset &off2) const {
-    Offset cell_off0 = _t->int_to_off(pos->first->offset((pos->second+1)&3));
-    Offset cell_off1 = _t->int_to_off(pos->first->offset((pos->second+2)&3));
-    Offset cell_off2 = _t->int_to_off(pos->first->offset((pos->second+3)&3));
-    Offset diff_off((cell_off0.x() == 1
-                     && cell_off1.x() == 1
-                     && cell_off2.x() == 1)?-1:0,
-                    (cell_off0.y() == 1
-                     && cell_off1.y() == 1
-                     && cell_off2.y() == 1)?-1:0,
-                    (cell_off0.z() == 1
-                     && cell_off1.z() == 1
-                     && cell_off2.z() == 1)?-1:0);
-    off0 = _t->combine_offsets(_t->get_offset(pos->first,
-                                              (pos->second+1)&3),
-                               diff_off);
-    off1 = _t->combine_offsets(_t->get_offset(pos->first,
-                                              (pos->second+2)&3),
-                               diff_off);
-    off2 = _t->combine_offsets(_t->get_offset(pos->first,
-                                              (pos->second+3)&3),
-                               diff_off);
-  }
-
   // return an integer that encodes the translations which have to be
   // applied to the edge *pos
   int get_drawing_offsets() {
@@ -565,7 +444,7 @@ class Periodic_3_triangulation_triangle_iterator_3 {
     // internally stored inside the cell telling us that this cell
     // wraps around the domain.
     if (_it == T::UNIQUE_COVER_DOMAIN)
-      get_edge_offsets(off0,off1,off2);
+      _t->get_offsets(*pos, off0, off1, off2);
     else {
       CGAL_assertion(_it == T::STORED_COVER_DOMAIN);
       off0 = _t->int_to_off(pos->first->offset((pos->second+1)&3));
@@ -596,7 +475,7 @@ class Periodic_3_triangulation_triangle_iterator_3 {
   Periodic_triangle construct_periodic_triangle() const {
     CGAL_assertion(pos->first != typename T::Cell_handle());
     Offset off0, off1, off2;
-    get_edge_offsets(off0, off1, off2);
+    _t->get_offsets(*pos, off0, off1, off2);
     Offset transl_off = Offset((((_off>>2)&1)==1 ? -1:0),
                                (((_off>>1)&1)==1 ? -1:0),
                                (( _off    &1)==1 ? -1:0));
@@ -659,7 +538,7 @@ class Periodic_3_triangulation_segment_iterator_3 {
                                               Iterator_type it = T::STORED)
     : _t(t), pos(_t->edges_begin()), _it(it), _off(0) {
     if (_it == T::UNIQUE || _it == T::UNIQUE_COVER_DOMAIN) {
-      while (pos != _t->edges_end() && !is_canonical() )
+      while (pos != _t->edges_end() && !_t->is_canonical(*pos) )
         ++pos;
     }
   }
@@ -675,7 +554,7 @@ class Periodic_3_triangulation_segment_iterator_3 {
       ++pos;
       break;
     case T::UNIQUE:
-      do { ++pos; } while (pos != _t->edges_end() && !is_canonical());
+      do { ++pos; } while (pos != _t->edges_end() && !_t->is_canonical(*pos));
       break;
     case T::STORED_COVER_DOMAIN:
     case T::UNIQUE_COVER_DOMAIN:
@@ -693,7 +572,7 @@ class Periodic_3_triangulation_segment_iterator_3 {
       --pos;
       break;
     case T::UNIQUE:
-      do { --pos; } while (pos != _t->edges_begin() && !is_canonical());
+      do { --pos; } while (pos != _t->edges_begin() && !_t->is_canonical(*pos));
       break;
     case T::STORED_COVER_DOMAIN:
     case T::UNIQUE_COVER_DOMAIN:
@@ -751,36 +630,6 @@ class Periodic_3_triangulation_segment_iterator_3 {
   mutable Periodic_segment periodic_segment; // current segment.
 
 private:
-  // check whether pos points onto a unique edge or not.
-  // If we are computing in 1-sheeted covering this should
-  // always be true.
-  bool is_canonical() {
-    // fetch all offsets
-    Offset off0, off1;
-    get_edge_offsets(off0, off1);
-
-    if (_t->number_of_sheets() != make_array(1,1,1)) {
-      // If there is one offset with entries larger than 1 then we are
-      // talking about a vertex that is too far away from the original
-      // domain to belong to a canonical triangle.
-      if (off0.x() > 1) return false;
-      if (off0.y() > 1) return false;
-      if (off0.z() > 1) return false;
-      if (off1.x() > 1) return false;
-      if (off1.y() > 1) return false;
-      if (off1.z() > 1) return false;
-    }
-
-    // If there is one direction of space for which all offsets are
-    // non-zero then the edge is not canonical because we can
-    // take the copy closer towards the origin in that direction.
-    int offx = off0.x() & off1.x();
-    int offy = off0.y() & off1.y();
-    int offz = off0.z() & off1.z();
-
-    return (offx == 0 && offy == 0 && offz == 0);
-  }
-
   // Artificial incrementation function that takes periodic
   // copies into account.
   void increment_domain() {
@@ -789,7 +638,7 @@ class Periodic_3_triangulation_segment_iterator_3 {
     if (_off == off) {
       _off = 0;
       do { ++pos; } while (_it == T::UNIQUE_COVER_DOMAIN
-                           && pos != _t->edges_end() && !is_canonical());
+                           && pos != _t->edges_end() && !_t->is_canonical(*pos));
     } else {
       do {
         ++_off;
@@ -803,7 +652,7 @@ class Periodic_3_triangulation_segment_iterator_3 {
   void decrement_domain() {
     if (_off == 0) {
       if (pos == _t->edges_begin()) return;
-      do { --pos; } while (_it == T::UNIQUE_COVER_DOMAIN && !is_canonical());
+      do { --pos; } while (_it == T::UNIQUE_COVER_DOMAIN && !_t->is_canonical(*pos));
       _off = get_drawing_offsets();
     } else {
       int off = get_drawing_offsets();
@@ -814,20 +663,6 @@ class Periodic_3_triangulation_segment_iterator_3 {
     }
   }
 
-  // Get the canonicalized offsets of an edge.
-  // This works in any cover that is encoded in _t->combine_offsets
-  void get_edge_offsets(Offset &off0, Offset &off1) const {
-    Offset cell_off0 = _t->int_to_off(pos->first->offset(pos->second));
-    Offset cell_off1 = _t->int_to_off(pos->first->offset(pos->third));
-    Offset diff_off((cell_off0.x()==1 && cell_off1.x()==1)?-1:0,
-                    (cell_off0.y()==1 && cell_off1.y()==1)?-1:0,
-                    (cell_off0.z()==1 && cell_off1.z()==1)?-1:0);
-    off0 = _t->combine_offsets(_t->get_offset(pos->first,pos->second),
-                               diff_off);
-    off1 = _t->combine_offsets(_t->get_offset(pos->first,pos->third),
-                               diff_off);
-  }
-
   // return an integer that encodes the translations which have to be
   // applied to the edge *pos
   int get_drawing_offsets() {
@@ -839,7 +674,7 @@ class Periodic_3_triangulation_segment_iterator_3 {
     // internally stored inside the cell telling us that this cell
     // wraps around the domain.
     if (_it == T::UNIQUE_COVER_DOMAIN)
-      get_edge_offsets(off0,off1);
+      _t->get_offsets(*pos, off0, off1);
     else {
       CGAL_assertion(_it == T::STORED_COVER_DOMAIN);
       off0 = _t->int_to_off(pos->first->offset(pos->second));
@@ -859,7 +694,7 @@ class Periodic_3_triangulation_segment_iterator_3 {
   Periodic_segment construct_periodic_segment() const {
     CGAL_assertion(pos->first != typename T::Cell_handle());
     Offset off0, off1;
-    get_edge_offsets(off0, off1);
+    _t->get_offsets(*pos, off0, off1);
     Offset transl_off = Offset((((_off>>2)&1)==1 ? -1:0),
                                (((_off>>1)&1)==1 ? -1:0),
                                (( _off    &1)==1 ? -1:0));
@@ -918,7 +753,7 @@ class Periodic_3_triangulation_point_iterator_3 {
                                             Iterator_type it = T::STORED)
     : _t(t), pos(_t->vertices_begin()), _it(it) {
     if (_it == T::UNIQUE || _it == T::UNIQUE_COVER_DOMAIN) {
-      while (pos != _t->vertices_end() && !is_canonical() )
+      while (pos != _t->vertices_end() && !_t->is_canonical(pos) )
         ++pos;
     }
   }
@@ -936,7 +771,7 @@ class Periodic_3_triangulation_point_iterator_3 {
       break;
     case T::UNIQUE:
     case T::UNIQUE_COVER_DOMAIN:
-      do { ++pos; } while (pos != _t->vertices_end() && !is_canonical());
+      do { ++pos; } while (pos != _t->vertices_end() && !_t->is_canonical(pos));
       break;
     default:
       CGAL_assertion(false);
@@ -952,7 +787,7 @@ class Periodic_3_triangulation_point_iterator_3 {
       break;
     case T::UNIQUE:
     case T::UNIQUE_COVER_DOMAIN:
-      do { --pos; } while (pos != _t->vertices_begin() && !is_canonical());
+      do { --pos; } while (pos != _t->vertices_begin() && !_t->is_canonical(pos));
       break;
     default:
       CGAL_assertion(false);
@@ -1009,13 +844,6 @@ class Periodic_3_triangulation_point_iterator_3 {
   mutable Periodic_point periodic_point; // current point.
 
 private:
-  // check whether pos points onto a vertex inside the original
-  // domain. If we are computing in 1-sheeted covering this should
-  // always be true.
-  bool is_canonical() {
-    return (_t->get_offset(pos) == Offset(0,0,0));
-  }
-
   Periodic_point construct_periodic_point() const {
     CGAL_assertion(pos != typename T::Vertex_handle());
     Offset off = _t->get_offset(pos);
@@ -1031,9 +859,54 @@ class Domain_tester {
   Domain_tester() {}
   Domain_tester(const T *tr) : t(tr) {}
 
-  bool operator()(const typename T::Vertex_iterator & v) const {
-    return (t->get_offset(v) != typename T::Offset(0,0,0));
+  bool operator()(const typename T::Cell_iterator c) const
+  {
+    return !t->is_canonical(c);
   }
+
+  bool operator()(const typename T::Facet_iterator f) const
+  {
+    return !t->is_canonical(*f);
+  }
+
+  bool operator()(const typename T::Edge_iterator e) const
+  {
+    return !t->is_canonical(*e);
+  }
+
+  bool operator()(const typename T::Vertex_iterator v) const
+  {
+    return !t->is_canonical(v);
+  }
+
+};
+
+// Iterates over the canonical cells in a periodic triangulation.
+// Derives from Filter_iterator in order to add a conversion to handle
+//
+// Comments:
+// When computing in 1-sheeted covering, there will be no difference
+// between a normal Cell_iterator and this iterator
+template <class T>
+class Periodic_3_triangulation_unique_cell_iterator_3
+  : public Filter_iterator<typename T::Cell_iterator, Domain_tester<T> >
+{
+  typedef typename T::Cell_handle Cell_handle;
+  typedef typename T::Cell_iterator Cell_iterator;
+
+  typedef Filter_iterator<Cell_iterator, Domain_tester<T> > Base;
+  typedef Periodic_3_triangulation_unique_cell_iterator_3 Self;
+
+public:
+  Periodic_3_triangulation_unique_cell_iterator_3() : Base() {}
+  Periodic_3_triangulation_unique_cell_iterator_3(const Base &b) : Base(b) {}
+
+  Self & operator++() { Base::operator++(); return *this; }
+  Self & operator--() { Base::operator--(); return *this; }
+  Self operator++(int) { Self tmp(*this); ++(*this); return tmp; }
+  Self operator--(int) { Self tmp(*this); --(*this); return tmp; }
+
+  operator Cell_handle() const { return Base::base(); }
 };
 
 // Iterates over the vertices in a periodic triangulation that are
@@ -1065,6 +938,62 @@ class Periodic_3_triangulation_unique_vertex_iterator_3
   operator Vertex_handle() const { return Base::base(); }
 };
 
-} //namespace CGAL
+// Iterates over the canonical edges in a periodic triangulation.
+// Derives from Filter_iterator in order to add a conversion to handle
+//
+// Comments:
+// When computing in 1-sheeted covering, there will be no difference
+// between a normal Edge_iterator and this iterator
+template <class T>
+class Periodic_3_triangulation_unique_edge_iterator_3
+  : public Filter_iterator<typename T::Edge_iterator, Domain_tester<T> >
+{
+  typedef typename T::Edge Edge;
+  typedef typename T::Edge_iterator Edge_iterator;
+
+  typedef Filter_iterator<Edge_iterator, Domain_tester<T> > Base;
+  typedef Periodic_3_triangulation_unique_edge_iterator_3 Self;
+
+public:
+  Periodic_3_triangulation_unique_edge_iterator_3() : Base() {}
+  Periodic_3_triangulation_unique_edge_iterator_3(const Base &b) : Base(b) {}
+
+  Self & operator++() { Base::operator++(); return *this; }
+  Self & operator--() { Base::operator--(); return *this; }
+  Self operator++(int) { Self tmp(*this); ++(*this); return tmp; }
+  Self operator--(int) { Self tmp(*this); --(*this); return tmp; }
+
+  operator Edge() const { return Base::base(); }
+};
+
+// Iterates over the canonical facets in a periodic triangulation.
+// Derives from Filter_iterator in order to add a conversion to handle
+//
+// Comments:
+// When computing in 1-sheeted covering, there will be no difference
+// between a normal Facet_iterator and this iterator
+template <class T>
+class Periodic_3_triangulation_unique_facet_iterator_3
+  : public Filter_iterator<typename T::Facet_iterator, Domain_tester<T> >
+{
+  typedef typename T::Facet Facet;
+  typedef typename T::Facet_iterator Facet_iterator;
+
+  typedef Filter_iterator<Facet_iterator, Domain_tester<T> > Base;
+  typedef Periodic_3_triangulation_unique_facet_iterator_3 Self;
+public:
+
+  Periodic_3_triangulation_unique_facet_iterator_3() : Base() {}
+  Periodic_3_triangulation_unique_facet_iterator_3(const Base &b) : Base(b) {}
+
+  Self & operator++() { Base::operator++(); return *this; }
+  Self & operator--() { Base::operator--(); return *this; }
+  Self operator++(int) { Self tmp(*this); ++(*this); return tmp; }
+  Self operator--(int) { Self tmp(*this); --(*this); return tmp; }
+
+  operator Facet() const { return Base::base(); }
+};
+
+} // namespace CGAL
 
 #endif // CGAL_PERIODIC_3_TRIANGULATION_ITERATORS_3_H
diff --git a/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_iterator.h b/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_iterator.h
index a77afb5fbc07..49bdfff51cd5 100644
--- a/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_iterator.h
+++ b/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_iterator.h
@@ -86,32 +86,158 @@ _test_unique_vertex_iterator( const Triangulation &T )
     size_type n = 0;
 
     for (Unique_vertex_iterator ovit = T.unique_vertices_begin();
-         ovit != T.unique_vertices_end(); ++ovit)
-        {
-          Vertex_handle vh = ovit; // Test the conversion.
-          n++;
-          const Vertex & v = *ovit; // Test operator*;
-          Cell_handle c = ovit->cell(); // Test operator->;
-          (void) vh;
-          (void) v;
-          (void) c;
-        }
+                                ovit != T.unique_vertices_end(); ++ovit)
+    {
+      Vertex_handle vh = ovit; // Test the conversion.
+      ++n;
+      const Vertex & v = *ovit; // Test operator*;
+      Cell_handle c = ovit->cell(); // Test operator->;
+      (void) vh;
+      (void) v;
+      (void) c;
+    }
     assert( n == T.number_of_vertices() );
 
     // Test Backward-ness of the iterators.
-    n=0;
+    n = 0;
     for (Unique_vertex_iterator ovit = T.unique_vertices_end();
-         ovit != T.unique_vertices_begin(); --ovit)
-        {
-          Vertex_handle vh = ovit; // Test the conversion.
-          (void) vh;
-          n++;
-        }
+                                ovit != T.unique_vertices_begin(); --ovit)
+    {
+      Vertex_handle vh = ovit; // Test the conversion.
+      (void) vh;
+      ++n;
+    }
     assert( n == T.number_of_vertices() );
 
     return n;
 }
 
+
+template < class Triangulation >
+typename Triangulation::size_type
+_test_unique_edge_iterator( const Triangulation &T )
+{
+  typedef typename Triangulation::size_type       size_type;
+  typedef typename Triangulation::Edge            Edge;
+  typedef typename Triangulation::Cell_handle     Cell_handle;
+  typedef typename Triangulation::Unique_edge_iterator
+                                                  Unique_edge_iterator;
+
+  size_type n = 0;
+
+  for (Unique_edge_iterator oeit = T.unique_edges_begin();
+                            oeit != T.unique_edges_end(); ++oeit)
+  {
+    ++n;
+    const Edge& e = *oeit; // Test operator*;
+    Cell_handle c = oeit->first; // Test operator->;
+    assert(c != Cell_handle());
+    (void) e;
+    (void) c;
+  }
+  assert( n == T.number_of_edges() );
+
+  // Test Backward-ness of the iterators.
+  n = 0;
+  for (Unique_edge_iterator oeit = T.unique_edges_end();
+                            oeit != T.unique_edges_begin(); --oeit)
+  {
+    ++n;
+  }
+  assert( n == T.number_of_edges() );
+
+  return n;
+}
+
+template < class Triangulation >
+typename Triangulation::size_type
+_test_unique_facet_iterator( const Triangulation &T )
+{
+  typedef typename Triangulation::size_type       size_type;
+  typedef typename Triangulation::Facet           Facet;
+  typedef typename Triangulation::Cell_handle     Cell_handle;
+  typedef typename Triangulation::Unique_facet_iterator
+                                                  Unique_facet_iterator;
+
+  size_type n = 0;
+
+  for (Unique_facet_iterator ofit = T.unique_facets_begin();
+                             ofit != T.unique_facets_end(); ++ofit)
+  {
+    ++n;
+    const Facet& f = *ofit; // Test operator*;
+    Cell_handle c = ofit->first; // Test operator->;
+    assert(c != Cell_handle());
+    (void) f;
+    (void) c;
+  }
+  assert( n == T.number_of_facets() );
+
+  // Test Backward-ness of the iterators.
+  n = 0;
+  for (Unique_facet_iterator ofit = T.unique_facets_end();
+                             ofit != T.unique_facets_begin(); --ofit)
+  {
+    ++n;
+  }
+  assert( n == T.number_of_facets() );
+
+  return n;
+}
+
+template < class Triangulation >
+typename Triangulation::size_type
+_test_unique_cell_iterator( const Triangulation &T )
+{
+    typedef typename Triangulation::size_type       size_type;
+    typedef typename Triangulation::Cell            Cell;
+    typedef typename Triangulation::Vertex_handle   Vertex_handle;
+    typedef typename Triangulation::Cell_handle     Cell_handle;
+    typedef typename Triangulation::Unique_cell_iterator
+                                                    Unique_cell_iterator;
+
+    size_type n = 0;
+
+    for (Unique_cell_iterator ocit = T.unique_cells_begin();
+                              ocit != T.unique_cells_end(); ++ocit)
+    {
+      Cell_handle ch = ocit; // Test the conversion.
+      n++;
+      const Cell& c = *ocit; // Test operator*;
+      Vertex_handle vh = ocit->vertex(0); // Test operator->;
+      (void) ch;
+      (void) c;
+      (void) vh;
+    }
+    assert( n == T.number_of_cells() );
+
+    // Test Backward-ness of the iterators.
+    n=0;
+    for (Unique_cell_iterator ocit = T.unique_cells_end();
+                              ocit != T.unique_cells_begin(); --ocit)
+    {
+      Cell_handle ch = ocit; // Test the conversion.
+      (void) ch;
+      ++n;
+    }
+    assert( n == T.number_of_cells() );
+
+    return n;
+}
+
+template < class Triangulation >
+typename Triangulation::size_type
+_test_triangulation_unique_iterator( const Triangulation &T )
+{
+  typedef typename Triangulation::size_type size_type;
+  const size_type nc = _test_unique_cell_iterator(T);
+  const size_type nf = _test_unique_facet_iterator(T);
+  const size_type ne = _test_unique_edge_iterator(T);
+  const size_type nv = _test_unique_vertex_iterator(T);
+  assert((nv-ne+nf-nc) == 0);
+  return nv-ne+nf-nc;
+}
+
 template < class Triangulation >
 typename Triangulation::size_type
 _test_triangulation_iterator( const Triangulation &T )
diff --git a/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_triangulation_3.h b/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_triangulation_3.h
index 0cb56c38824f..b5d08b90ec6a 100644
--- a/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_triangulation_3.h
+++ b/Periodic_3_triangulation_3/test/Periodic_3_triangulation_3/include/CGAL/_test_cls_periodic_3_triangulation_3.h
@@ -479,10 +479,10 @@ _test_cls_periodic_3_triangulation_3(const PeriodicTriangulation &,
   _test_vertex_iterator(PT3_deg);
   _test_vertex_iterator(PT1_deg);
 
-  _test_unique_vertex_iterator(PT3);
-  _test_unique_vertex_iterator(PT1);
-  _test_unique_vertex_iterator(PT3_deg);
-  _test_unique_vertex_iterator(PT1_deg);
+  _test_triangulation_unique_iterator(PT3);
+  _test_triangulation_unique_iterator(PT1);
+  _test_triangulation_unique_iterator(PT3_deg);
+  _test_triangulation_unique_iterator(PT1_deg);
 
   _test_triangulation_iterator(PT3);
   _test_triangulation_iterator(PT1);

From f41e69a5fe2fe6e093dbc4779bc6c1db56c8a006 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 7 Jul 2023 02:09:35 +0200
Subject: [PATCH 0473/1398] Misc fixes

---
 .../Periodic_2_Delaunay_triangulation_2.h     |  8 ++---
 .../PackageDescription.txt                    |  4 +--
 .../Periodic_2_triangulation_2.txt            |  6 ++--
 .../p2t2_find_conflicts.cpp                   | 33 +++++++++----------
 .../include/CGAL/Periodic_2_triangulation_2.h |  6 ++--
 .../Periodic_2_triangulation_iterators_2.h    | 11 +++----
 .../include/interface_test.h                  |  2 ++
 .../include/CGAL/Periodic_3_triangulation_3.h |  9 +++--
 .../Periodic_3_triangulation_iterators_3.h    |  6 ++--
 9 files changed, 44 insertions(+), 41 deletions(-)

diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_2.h
index b95c3c7f6078..9abd4e93570c 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_2.h
@@ -198,7 +198,7 @@ class Periodic_2_Delaunay_triangulation_2 : public Periodic_2_triangulation_2<Tr
 
 /// \name
 /// A point-offset pair (`p`,`off`) is said to be in conflict with a
-/// cell `c` iff `dt`.`side_of_circle(c, p, off)` returns
+/// face `f` iff `dt`.`side_of_circle(f, p, off)` returns
 /// `ON_BOUNDED_SIDE`. The set of faces that are in conflict with
 /// (`p`,`off`) is star-shaped.
 /// @{
@@ -309,7 +309,7 @@ class Periodic_2_Delaunay_triangulation_2 : public Periodic_2_triangulation_2<Tr
   Checks the combinatorial validity of the triangulation and the
   validity of its geometric embedding (see
   Section \ref P2Triangulation2secintro). Also checks that all the
-  circumscribing circles of cells are empty.
+  circumscribing circles of faces are empty.
 
   When `verbose` is set to true, messages describing the first
   invalidity encountered are printed.
@@ -321,9 +321,9 @@ class Periodic_2_Delaunay_triangulation_2 : public Periodic_2_triangulation_2<Tr
   /*!
   \cgalAdvancedFunction
   \cgalAdvancedBegin
-  Checks the combinatorial and geometric validity of the cell (see
+  Checks the combinatorial and geometric validity of the face (see
   Section \ref P2Triangulation2secintro). Also checks that the
-  circumscribing circle of cells is empty.
+  circumscribing circle of faces is empty.
 
   When `verbose` is set to true, messages are printed to give
   a precise indication of the kind of invalidity encountered.
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt
index 57f1542511d7..dcffaea8da8e 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt
@@ -65,10 +65,10 @@ concepts `Periodic_2TriangulationFaceBase_2` and
 A triangulation is stored as a collection of vertices and faces that
 are linked together through incidence and adjacency relations. Each
 face gives access to its three incident vertices and to its three
-adjacent cells. Each vertex gives access to one of its incident
+adjacent faces. Each vertex gives access to one of its incident
 faces.
 
-The three vertices of a cell are indexed with 0, 1, and 2 in positive
+The three vertices of a face are indexed with 0, 1, and 2 in positive
 orientation, the positive orientation being defined by the orientation
 of the underlying space \f$ \mathbb T_c^3\f$. The neighbors of a face are
 also indexed with 0, 1, 2 in such a way that the neighbor indexed
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Periodic_2_triangulation_2.txt b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Periodic_2_triangulation_2.txt
index 9ccf261174ab..4186679f40ee 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Periodic_2_triangulation_2.txt
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Periodic_2_triangulation_2.txt
@@ -134,7 +134,7 @@ A periodic triangulation is said to be `locally valid` iff
 data structure, is `locally valid`
 (see Chapter \ref Chapter_2D_Triangulation_Data_Structure)
 
-<B>(c)</B> Any cell has its vertices ordered according to positive
+<B>(c)</B> Any face has its vertices ordered according to positive
 orientation. See \cgalFigureRef{P2Triangulation2figorient}.
 
 \section P2T2_Delaunay Delaunay Triangulation
@@ -264,7 +264,7 @@ to support periodicity: the vertex and face must be models of
 `Periodic_2TriangulationVertexBase_2` and `Periodic_2TriangulationFaceBase_2`.
 A model of such concept is `CGAL::Triangulation_data_structure_2`. It is
 parameterized by a vertex base class and a face base class, which gives the
-possibility to customize the vertices and cells used by the triangulation data
+possibility to customize the vertices and faces used by the triangulation data
 structure, and hence by the geometric triangulation using it.
 Basic models of the vertex and face concepts are provided: `CGAL::Periodic_2_triangulation_vertex_base_2`
 and `CGAL::Periodic_2_triangulation_face_base_2`.
@@ -272,7 +272,7 @@ and `CGAL::Periodic_2_triangulation_face_base_2`.
 A default value for the triangulation data structure parameter is provided in
 all the triangulation classes, so it does not need to be specified by
 the user unless he wants to use a different triangulation data
-structure or a different vertex or cell base class.
+structure or a different vertex or face base class.
 
 \subsection P2T2FlexDesign Flexibility of the Design
 
diff --git a/Periodic_2_triangulation_2/examples/Periodic_2_triangulation_2/p2t2_find_conflicts.cpp b/Periodic_2_triangulation_2/examples/Periodic_2_triangulation_2/p2t2_find_conflicts.cpp
index 0491e319a8c8..b3bc862f3088 100644
--- a/Periodic_2_triangulation_2/examples/Periodic_2_triangulation_2/p2t2_find_conflicts.cpp
+++ b/Periodic_2_triangulation_2/examples/Periodic_2_triangulation_2/p2t2_find_conflicts.cpp
@@ -27,24 +27,21 @@ int main()
   // Gets the conflict region of 100 random points
   // in the Delaunay tetrahedralization
   for (int i = 0; i != 100; ++i)
-    {
-      Point p = (*rnd++);
-
-      // Locate the point
-      Delaunay::Locate_type lt;
-      int li;
-      Face_handle f = T.locate(p, lt, li);
-      if (lt == Delaunay::VERTEX)
-        continue; // Point already exists
-
-      // Get the cells that conflict with p in a vector V,
-      // and a facet on the boundary of this hole in f.
-      std::vector<Face_handle> V;
-
-      T.get_conflicts(p,
-                      std::back_inserter(V), // Conflict cells in V
-                      f);
-    }
+  {
+    Point p = (*rnd++);
+
+    // Locate the point
+    Delaunay::Locate_type lt;
+    int li;
+    Face_handle f = T.locate(p, lt, li);
+    if (lt == Delaunay::VERTEX)
+      continue; // Point already exists
+
+    // Get the faces that conflict with p in a vector V.
+    std::vector<Face_handle> V;
+
+    T.get_conflicts(p, std::back_inserter(V), f);
+  }
 
   std::cout << "Final triangulation has " << T.number_of_vertices()
             << " vertices." << std::endl;
diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h
index 2ce4755742a8..2d2e3878f82a 100644
--- a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h
+++ b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_2.h
@@ -133,6 +133,7 @@ class Periodic_2_triangulation_2
   typedef Face_iterator Finite_faces_iterator;
   typedef Edge_iterator Finite_edges_iterator;
   typedef Vertex_iterator Finite_vertices_iterator;
+  typedef Vertex_iterator All_vertices_iterator;
   typedef Face_iterator All_faces_iterator;
   // \}
 
@@ -389,10 +390,11 @@ class Periodic_2_triangulation_2
   /// Checks whether the triangulation is a valid simplicial complex in the one cover.
   bool is_triangulation_in_1_sheet() const;
 
-  /// Convert a 9 sheeted cover (used for sparse triangulations) to a single sheeted cover.
+  /// Converts a 9 sheeted cover (used for sparse triangulations) to a single sheeted cover.
   /// \pre !is_1_cover();
   void convert_to_1_sheeted_covering();
-  /// Convert a single sheeted cover (used for dense triangulations) to a 9 sheeted cover.
+
+  /// Converts a single sheeted cover (used for dense triangulations) to a 9 sheeted cover.
   /// \pre is_1_cover();
   void convert_to_9_sheeted_covering();
   // \}
diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_iterators_2.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_iterators_2.h
index 9b2afd4ba649..c3e7fb1164a4 100644
--- a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_iterators_2.h
+++ b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_iterators_2.h
@@ -14,13 +14,11 @@
 
 #include <CGAL/license/Periodic_2_triangulation_2.h>
 
-
 #include <CGAL/assertions.h>
 #include <CGAL/iterator.h>
 #include <CGAL/array.h>
 
-namespace CGAL
-{
+namespace CGAL {
 
 template < class T >
 class Periodic_2_triangulation_triangle_iterator_2
@@ -234,7 +232,7 @@ class Periodic_2_triangulation_triangle_iterator_2
     // intersect the boundary of the periodic domain. In UNIQUE mode
     // this means that the offset with respect to drawing should
     // differ in some entries. Otherwise we consider the offsets
-    // internally stored inside the cell telling us that this cell
+    // internally stored inside the face telling us that this face
     // wraps around the domain.
     if (_it == T::UNIQUE_COVER_DOMAIN)
       _t->get_offsets(pos, off0, off1, off2);
@@ -502,7 +500,7 @@ class Periodic_2_triangulation_segment_iterator_2
     // intersect the boundary of the periodic domain. In UNIQUE mode
     // this means that the offset with respect to drawing should
     // differ in some entries. Otherwise we consider the offsets
-    // internally stored inside the cell telling us that this cell
+    // internally stored inside the face telling us that this face
     // wraps around the domain.
     if (_it == T::UNIQUE_COVER_DOMAIN)
       _t->get_offsets(*pos, off0, off1);
@@ -797,7 +795,6 @@ template <class T>
 class Periodic_2_triangulation_unique_vertex_iterator_2
         : public Filter_iterator<typename T::Vertex_iterator, Periodic_2_triangulation_2_internal::Domain_tester<T> >
 {
-
   typedef typename T::Vertex_handle Vertex_handle;
   typedef typename T::Vertex_iterator Vertex_iterator;
 
@@ -805,8 +802,8 @@ class Periodic_2_triangulation_unique_vertex_iterator_2
 
   typedef Filter_iterator<Vertex_iterator, Tester > Base;
   typedef Periodic_2_triangulation_unique_vertex_iterator_2 Self;
-public:
 
+public:
   Periodic_2_triangulation_unique_vertex_iterator_2() : Base() {}
   Periodic_2_triangulation_unique_vertex_iterator_2(const Base &b) : Base(b) {}
 
diff --git a/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/include/interface_test.h b/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/include/interface_test.h
index 7c50e0a4252d..c69f2858ef99 100644
--- a/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/include/interface_test.h
+++ b/Periodic_2_triangulation_2/test/Periodic_2_triangulation_2/include/interface_test.h
@@ -208,6 +208,8 @@ void test_iterators()
   Vertex_handle vh2 = t.insert(Point(0.7, 0.7));
   CGAL_USE(vh2);
 
+  std::cout << "Cover = " << t.number_of_sheets()[0] << " " << t.number_of_sheets()[1] << std::endl;
+
   // vertices
   size_t size = 0;
   for (typename T::Vertex_iterator vit = t_const.vertices_begin();
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h
index 19c56b919509..c1001de10c5c 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3.h
@@ -1703,6 +1703,8 @@ class Periodic_3_triangulation_3
     return _tds.facets_end();
   }
 
+  // Finite iterators (= all iterators, for periodic triangulations)
+
   Cell_iterator finite_cells_begin() const {
     return _tds.cells_begin();
   }
@@ -1731,6 +1733,8 @@ class Periodic_3_triangulation_3
     return _tds.facets_end();
   }
 
+  // All iterators (= finite, for periodic triangulations)
+
   All_cells_iterator all_cells_begin() const {
     return _tds.cells_begin();
   }
@@ -1831,6 +1835,7 @@ class Periodic_3_triangulation_3
   }
 
   // Circulators
+
   Cell_circulator incident_cells(const Edge& e) const {
     return _tds.incident_cells(e);
   }
@@ -3451,7 +3456,7 @@ periodic_remove(Vertex_handle v,
     nr_vec.push_back(boost::make_tuple(o_ch,o_i,new_ch));
     nr_vec.push_back(boost::make_tuple(new_ch,i_i,o_ch));
 
-    // for the other faces check, if they can also be glued
+    // for the other facets check, if they can also be glued
     for(unsigned int i = 0; i < 4; i++) {
       if(i != i_i) {
         Facet f = std::pair<Cell_handle,int>(new_ch,i);
@@ -3463,7 +3468,7 @@ periodic_remove(Vertex_handle v,
           std::swap(vt.second,vt.third);
           outer_map[vt]= f;
         } else {
-        // glue the faces
+        // glue the facets
           typename Vertex_triple_Facet_map::value_type o_vt_f_pair2 = *oit2;
           Cell_handle o_ch2 = o_vt_f_pair2.second.first;
           int o_i2 = o_vt_f_pair2.second.second;
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_iterators_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_iterators_3.h
index 719060bed29d..67cacfe10841 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_iterators_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_iterators_3.h
@@ -918,15 +918,15 @@ class Periodic_3_triangulation_unique_cell_iterator_3
 // between a normal Vertex_iterator and this iterator
 template <class T>
 class Periodic_3_triangulation_unique_vertex_iterator_3
-  : public Filter_iterator<typename T::Vertex_iterator, Domain_tester<T> > {
-
+  : public Filter_iterator<typename T::Vertex_iterator, Domain_tester<T> >
+{
   typedef typename T::Vertex_handle Vertex_handle;
   typedef typename T::Vertex_iterator Vertex_iterator;
 
   typedef Filter_iterator<Vertex_iterator, Domain_tester<T> > Base;
   typedef Periodic_3_triangulation_unique_vertex_iterator_3 Self;
-public:
 
+public:
   Periodic_3_triangulation_unique_vertex_iterator_3() : Base() {}
   Periodic_3_triangulation_unique_vertex_iterator_3(const Base &b) : Base(b) {}
 

From 54c318b79481ed166ebfb385f6102ac14e0976cf Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Fri, 7 Jul 2023 13:14:30 +0200
Subject: [PATCH 0474/1398] Spelling corrections

Overnight test build gave a small error.
---
 .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 13027e51161c..8d541588736c 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -21,7 +21,7 @@ given in Botsch et al.'s book on polygon mesh processing \cgalCite{botsch2010PMP
 A \a polygon \a mesh is a consistent and orientable surface mesh, that can have
 one or more boundaries.
 The \a faces are simple polygons.
-The \an edges are segments. Each edge connects two \a vertices,
+The \a edges are segments. Each edge connects two \a vertices,
 and is shared by two faces (including the \a null \a face for boundary edges).
 A polygon mesh can have any number of connected components, and also some self-intersections.
 In this package, a polygon mesh is considered to have the topology of a 2-manifold.

From 549e3a1710e70c189430c78bce90cc10bf4e92a6 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Fri, 7 Jul 2023 14:29:42 +0200
Subject: [PATCH 0475/1398] Possibility to disable special CGAL documentation
 setting

In the past it was possible by means of the option `-DCGAL_EXTRACT_ALL_NO_DETAILED_IF_EMPTY=OFF` with CMake to disable the specific CGAL setting though currently with the 1.8.13 version this didn't work (anymore).
Also the setting has been renamed for the 1.9.6 version (and newer) to `NO_ADDITIONAL_DETAILS` this has now been made more flexible as well.
---
 Documentation/doc/CMakeLists.txt                   | 12 ++++++++++++
 Documentation/doc/resources/1.8.13/BaseDoxyfile.in |  2 +-
 Documentation/doc/resources/1.9.6/BaseDoxyfile.in  |  2 +-
 3 files changed, 14 insertions(+), 2 deletions(-)

diff --git a/Documentation/doc/CMakeLists.txt b/Documentation/doc/CMakeLists.txt
index fdb659ea2b5d..415fb56131ef 100644
--- a/Documentation/doc/CMakeLists.txt
+++ b/Documentation/doc/CMakeLists.txt
@@ -241,6 +241,18 @@ else()
       "#EXTRACT_ALL_NO_DETAILED_IF_EMPTY = NO")
 endif()
 
+option(CGAL_NO_ADDITIONAL_DETAILS
+       "Use CGAL special doxygen setting NO_ADDITIONAL_DETAILS." ON)
+if(CGAL_NO_ADDITIONAL_DETAILS)
+  set(CGAL_OPT_NO_ADDITIONAL_DETAILS
+      "NO_ADDITIONAL_DETAILS = YES")
+else()
+  # The default is NO, so we could leave it out, but it is better to have a commented out placeholder
+  # this will work for versions with and without the setting.
+  set(CGAL_OPT_NO_ADDITIONAL_DETAILS
+      "#NO_ADDITIONAL_DETAILS = NO")
+endif()
+
 #we use two directories for the generation/reading of tag files to prevent issues
 #if the targets are built in parallel
 set(CGAL_DOC_TAG_GEN_DIR "${CMAKE_BINARY_DIR}/doc_gen_tags")
diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index ae2cc84f6c17..b575adcb7826 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -262,7 +262,7 @@ EXTRACT_ALL            = YES
 # the EXTRACT_ALL tag is set to NO.
 # The default value is: NO.
 
-EXTRACT_ALL_NO_DETAILED_IF_EMPTY                                        = YES
+${CGAL_OPT_EXTRACT_ALL_NO_DETAILED_IF_EMPTY}
 
 # If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
 # included in the documentation.
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index 1cfd0a6ffd9f..0e32893b2c6c 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -791,5 +791,5 @@ GENERATE_LEGEND        = NO
 # NO_ADDITIONAL_DETAILS tag is set to YES. This tag has no effect if
 # the EXTRACT_ALL tag is set to NO.
 # The default value is: NO.
-NO_ADDITIONAL_DETAILS = YES
+${CGAL_OPT_NO_ADDITIONAL_DETAILS}
 

From 301728a8a9d4701aee5f9160fb319b59a4499cb2 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Sun, 9 Jul 2023 12:43:36 +0200
Subject: [PATCH 0476/1398] issue #7395 Improvement of layout of model
 relations

- Completed the cgalModels part
---
 .../CGAL/Algebraic_structure_traits.h         | 18 +++++------
 .../CGAL/Fraction_traits.h                    |  2 +-
 .../CGAL/Real_embeddable_traits.h             |  2 +-
 .../CGAL/Algebraic_kernel_d_1.h               |  2 +-
 .../CGAL/Algebraic_kernel_d_2.h               |  2 +-
 .../CGAL/Algebraic_kernel_rs_gmpq_d_1.h       |  2 +-
 .../CGAL/Algebraic_kernel_rs_gmpz_d_1.h       |  2 +-
 .../CGAL/Alpha_shape_face_base_2.h            |  2 +-
 .../CGAL/Alpha_shape_vertex_base_2.h          |  2 +-
 .../CGAL/Alpha_shape_cell_base_3.h            |  2 +-
 .../CGAL/Alpha_shape_vertex_base_3.h          |  2 +-
 .../CGAL/Fixed_alpha_shape_cell_base_3.h      |  2 +-
 .../CGAL/Fixed_alpha_shape_vertex_base_3.h    |  2 +-
 .../CGAL/Apollonius_graph_2.h                 |  2 +-
 .../CGAL/Apollonius_graph_filtered_traits_2.h |  2 +-
 ...Apollonius_graph_hierarchy_vertex_base_2.h |  2 +-
 .../CGAL/Apollonius_graph_traits_2.h          |  2 +-
 .../CGAL/Apollonius_graph_vertex_base_2.h     |  2 +-
 .../CGAL/Apollonius_site_2.h                  |  2 +-
 .../CGAL/Arr_Bezier_curve_traits_2.h          |  3 +-
 .../CGAL/Arr_algebraic_segment_traits_2.h     |  2 +-
 .../Arr_bounded_planar_topology_traits_2.h    |  2 +-
 .../CGAL/Arr_circle_segment_traits_2.h        |  3 +-
 .../CGAL/Arr_circular_arc_traits_2.h          |  2 +-
 .../CGAL/Arr_circular_line_arc_traits_2.h     |  2 +-
 .../CGAL/Arr_conic_traits_2.h                 |  4 +--
 .../Arr_consolidated_curve_data_traits_2.h    |  2 +-
 .../CGAL/Arr_curve_data_traits_2.h            |  2 +-
 .../CGAL/Arr_dcel_base.h                      |  8 ++---
 .../CGAL/Arr_default_dcel.h                   |  2 +-
 .../CGAL/Arr_default_overlay_traits.h         |  4 +--
 .../CGAL/Arr_extended_dcel.h                  | 10 +++----
 .../CGAL/Arr_face_index_map.h                 |  5 +---
 .../Arr_geodesic_arc_on_sphere_traits_2.h     | 29 ++++--------------
 .../CGAL/Arr_landmarks_point_location.h       |  3 +-
 .../CGAL/Arr_line_arc_traits_2.h              |  2 +-
 .../CGAL/Arr_linear_traits_2.h                |  4 +--
 .../CGAL/Arr_naive_point_location.h           |  3 +-
 .../Arr_non_caching_segment_basic_traits_2.h  |  2 +-
 .../CGAL/Arr_non_caching_segment_traits_2.h   |  4 +--
 .../CGAL/Arr_polycurve_traits_2.h             |  7 ++---
 .../CGAL/Arr_polyline_traits_2.h              |  9 ++----
 .../CGAL/Arr_rational_function_traits_2.h     | 20 ++++---------
 .../CGAL/Arr_segment_traits_2.h               |  4 +--
 .../CGAL/Arr_spherical_topology_traits_2.h    |  2 +-
 .../CGAL/Arr_trapezoid_ric_point_location.h   |  3 +-
 .../CGAL/Arr_triangulation_point_location.h   |  3 +-
 .../CGAL/Arr_unb_planar_topology_traits_2.h   |  2 +-
 .../CGAL/Arr_vertex_index_map.h               |  5 +---
 .../CGAL/Arr_walk_along_line_point_location.h |  3 +-
 .../CGAL/IO/Arr_text_formatter.h              |  9 ++----
 .../CGAL/IO/Arr_with_history_text_formatter.h |  3 +-
 .../CGAL/HalfedgeDS_face_max_base_with_id.h   |  2 +-
 .../HalfedgeDS_halfedge_max_base_with_id.h    |  2 +-
 .../CGAL/HalfedgeDS_vertex_max_base_with_id.h |  2 +-
 .../CGAL/Linear_cell_complex_bgl_min_items.h  |  2 +-
 BGL/doc/BGL/CGAL/Polyhedron_items_with_id_3.h |  2 +-
 .../CGAL/Triangulation_face_base_with_id_2.h  |  2 +-
 .../Triangulation_vertex_base_with_id_2.h     |  2 +-
 BGL/doc/BGL/CGAL/boost/graph/properties.h     | 10 +++----
 BGL/include/CGAL/boost/graph/Dual.h           |  2 +-
 .../CGAL/boost/graph/Face_filtered_graph.h    |  4 +--
 .../graph/Graph_with_descriptor_with_graph.h  |  6 ++--
 BGL/include/CGAL/boost/graph/Seam_mesh.h      | 15 ++++------
 BGL/include/CGAL/boost/graph/iterator.h       | 28 ++++++++---------
 .../Delaunay_domain_2.h                       |  2 +-
 .../Discrete_harmonic_2.h                     |  2 +-
 .../Barycentric_coordinates_2/Mean_value_2.h  |  2 +-
 .../Barycentric_coordinates_2/Wachspress_2.h  |  2 +-
 .../Gps_default_dcel.h                        |  6 ++--
 .../CGAL/General_polygon_2.h                  |  2 +-
 .../CGAL/Gps_circle_segment_traits_2.h        |  2 +-
 .../CGAL/Gps_segment_traits_2.h               |  2 +-
 .../CGAL/Gps_traits_2.h                       |  2 +-
 .../Approximate_min_ellipsoid_d_traits_2.h    |  2 +-
 .../Approximate_min_ellipsoid_d_traits_3.h    |  2 +-
 .../Approximate_min_ellipsoid_d_traits_d.h    |  2 +-
 .../CGAL/Min_circle_2_traits_2.h              |  2 +-
 .../CGAL/Min_ellipse_2_traits_2.h             |  2 +-
 .../CGAL/Min_quadrilateral_traits_2.h         |  2 +-
 .../CGAL/Min_sphere_annulus_d_traits_2.h      |  2 +-
 .../CGAL/Min_sphere_annulus_d_traits_3.h      |  2 +-
 .../CGAL/Min_sphere_annulus_d_traits_d.h      |  2 +-
 .../CGAL/Min_sphere_of_points_d_traits_2.h    |  2 +-
 .../CGAL/Min_sphere_of_points_d_traits_3.h    |  2 +-
 .../CGAL/Min_sphere_of_points_d_traits_d.h    |  2 +-
 .../CGAL/Min_sphere_of_spheres_d_traits_2.h   |  2 +-
 .../CGAL/Min_sphere_of_spheres_d_traits_3.h   |  2 +-
 .../CGAL/Min_sphere_of_spheres_d_traits_d.h   |  2 +-
 .../CGAL/rectangular_p_center_2.h             |  2 +-
 .../CGAL/Box_intersection_d/Box_d.h           |  2 +-
 .../CGAL/Box_intersection_d/Box_traits_d.h    |  2 +-
 .../Box_intersection_d/Box_with_handle_d.h    |  2 +-
 .../CGAL/Algebraic_kernel_for_circles_2_2.h   |  2 +-
 .../Circular_kernel_2/CGAL/Circular_arc_2.h   |  2 +-
 .../CGAL/Circular_arc_point_2.h               |  2 +-
 .../CGAL/Circular_kernel_2.h                  |  2 +-
 .../CGAL/Exact_circular_kernel_2.h            |  2 +-
 .../doc/Circular_kernel_2/CGAL/Line_arc_2.h   |  2 +-
 .../Circular_kernel_2/CGAL/Polynomials_1_2.h  |  2 +-
 .../Circular_kernel_2/CGAL/Polynomials_2_2.h  |  2 +-
 .../CGAL/Root_for_circles_2_2.h               |  2 +-
 .../CGAL/Algebraic_kernel_for_spheres_2_3.h   |  2 +-
 .../Circular_kernel_3/CGAL/Circular_arc_3.h   |  2 +-
 .../CGAL/Circular_arc_point_3.h               |  2 +-
 .../CGAL/Exact_spherical_kernel_3.h           |  2 +-
 .../doc/Circular_kernel_3/CGAL/Line_arc_3.h   |  2 +-
 .../Circular_kernel_3/CGAL/Polynomials_1_3.h  |  2 +-
 .../Circular_kernel_3/CGAL/Polynomials_2_3.h  |  2 +-
 .../CGAL/Polynomials_for_line_3.h             |  2 +-
 .../CGAL/Root_for_spheres_2_3.h               |  2 +-
 .../CGAL/Spherical_kernel_3.h                 |  2 +-
 .../ETHZ/Random_forest_classifier.h           |  2 +-
 .../CGAL/Classification/Feature_base.h        |  2 +-
 .../include/CGAL/Classification/Label.h       |  2 +-
 .../CGAL/Classification/Mesh_neighborhood.h   |  4 +--
 .../OpenCV/Random_forest_classifier.h         |  2 +-
 .../Classification/Point_set_neighborhood.h   |  4 +--
 .../Sum_of_weighted_features_classifier.h     |  2 +-
 .../CGAL/Classification/property_maps.h       |  4 +--
 .../Combinatorial_map/CGAL/Cell_attribute.h   |  2 +-
 .../CGAL/Cell_attribute_with_id.h             |  2 +-
 .../CGAL/Combinatorial_map.h                  |  2 +-
 .../CGAL/Generic_map_min_items.h              |  2 +-
 .../CGAL/Convex_hull_traits_adapter_2.h       |  2 +-
 .../CGAL/convex_hull_constructive_traits_2.h  |  2 +-
 .../Convex_hull_2/CGAL/convex_hull_traits_2.h |  2 +-
 .../Convex_hull_3/CGAL/Convex_hull_traits_3.h |  3 +-
 .../CGAL/Extreme_points_traits_adapter_3.h    |  3 +-
 .../CGAL/Convex_hull_d_traits_3.h             |  2 +-
 .../doc/resources/1.8.13/BaseDoxyfile.in      |  5 +++-
 .../doc/resources/1.9.6/BaseDoxyfile.in       |  5 +++-
 .../doc/Envelope_2/CGAL/Envelope_diagram_1.h  |  2 +-
 .../doc/Envelope_3/CGAL/Env_plane_traits_3.h  |  2 +-
 .../doc/Envelope_3/CGAL/Env_sphere_traits_3.h |  2 +-
 .../CGAL/Env_surface_data_traits_3.h          |  2 +-
 .../Envelope_3/CGAL/Env_triangle_traits_3.h   |  2 +-
 .../Generalized_map/CGAL/Generalized_map.h    |  2 +-
 .../CGAL/Random_convex_set_traits_2.h         |  2 +-
 .../doc/Generator/CGAL/point_generators_2.h   | 28 +++++++----------
 .../doc/Generator/CGAL/point_generators_3.h   | 30 +++++++------------
 .../doc/Generator/CGAL/point_generators_d.h   |  9 ++----
 .../doc/HalfedgeDS/CGAL/HalfedgeDS_default.h  |  2 +-
 .../HalfedgeDS/CGAL/HalfedgeDS_face_base.h    |  2 +-
 .../CGAL/HalfedgeDS_face_min_base.h           |  2 +-
 .../CGAL/HalfedgeDS_halfedge_base.h           |  2 +-
 .../CGAL/HalfedgeDS_halfedge_min_base.h       |  2 +-
 .../doc/HalfedgeDS/CGAL/HalfedgeDS_items_2.h  |  2 +-
 .../doc/HalfedgeDS/CGAL/HalfedgeDS_list.h     |  2 +-
 .../HalfedgeDS/CGAL/HalfedgeDS_min_items.h    |  2 +-
 .../doc/HalfedgeDS/CGAL/HalfedgeDS_vector.h   |  2 +-
 .../HalfedgeDS/CGAL/HalfedgeDS_vertex_base.h  |  2 +-
 .../CGAL/HalfedgeDS_vertex_min_base.h         |  2 +-
 .../Intrinsic_Delaunay_triangulation_3.h      |  2 +-
 ...bolic_Delaunay_triangulation_CK_traits_2.h |  2 +-
 ...perbolic_Delaunay_triangulation_traits_2.h |  2 +-
 .../Hyperbolic_triangulation_face_base_2.h    |  2 +-
 .../CGAL/Extremal_polygon_traits_2.h          |  4 +--
 .../Interpolation_gradient_fitting_traits_2.h |  3 +-
 .../CGAL/Interpolation_traits_2.h             |  2 +-
 .../CGAL/Voronoi_intersection_2_traits_3.h    |  2 +-
 .../CGAL/Interval_skip_list_interval.h        |  2 +-
 .../Interval_skip_list/CGAL/Level_interval.h  |  2 +-
 .../doc/Kernel_23/CGAL/Aff_transformation_2.h |  2 +-
 .../doc/Kernel_23/CGAL/Aff_transformation_3.h |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Bbox_2.h         |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Bbox_3.h         |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Cartesian.h      |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Circle_2.h       |  3 +-
 Kernel_23/doc/Kernel_23/CGAL/Circle_3.h       |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Direction_2.h    |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Direction_3.h    |  2 +-
 ...ct_predicates_exact_constructions_kernel.h |  2 +-
 ...exact_constructions_kernel_with_kth_root.h |  2 +-
 ..._exact_constructions_kernel_with_root_of.h |  2 +-
 ...tes_exact_constructions_kernel_with_sqrt.h |  2 +-
 ..._predicates_inexact_constructions_kernel.h |  2 +-
 .../doc/Kernel_23/CGAL/Filtered_kernel.h      |  4 +--
 Kernel_23/doc/Kernel_23/CGAL/Homogeneous.h    |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h   |  3 +-
 .../doc/Kernel_23/CGAL/Iso_rectangle_2.h      |  3 +-
 Kernel_23/doc/Kernel_23/CGAL/Line_2.h         |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Line_3.h         |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Plane_3.h        |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Point_2.h        |  3 +-
 Kernel_23/doc/Kernel_23/CGAL/Point_3.h        |  3 +-
 .../doc/Kernel_23/CGAL/Projection_traits_3.h  |  7 +----
 .../Kernel_23/CGAL/Projection_traits_xy_3.h   | 16 ++++------
 Kernel_23/doc/Kernel_23/CGAL/Ray_2.h          |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Ray_3.h          |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Segment_2.h      |  3 +-
 Kernel_23/doc/Kernel_23/CGAL/Segment_3.h      |  3 +-
 .../doc/Kernel_23/CGAL/Simple_cartesian.h     |  2 +-
 .../doc/Kernel_23/CGAL/Simple_homogeneous.h   |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Sphere_3.h       |  3 +-
 Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h  |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h     |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h     |  2 +-
 Kernel_23/doc/Kernel_23/CGAL/Vector_2.h       |  3 +-
 Kernel_23/doc/Kernel_23/CGAL/Vector_3.h       |  3 +-
 .../doc/Kernel_23/CGAL/Weighted_point_2.h     |  3 +-
 .../doc/Kernel_23/CGAL/Weighted_point_3.h     |  3 +-
 Kernel_d/doc/Kernel_d/CGAL/Cartesian_d.h      |  2 +-
 Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h          | 16 ++++------
 Kernel_d/doc/Kernel_d/CGAL/Epick_d.h          | 16 ++++------
 Kernel_d/doc/Kernel_d/CGAL/Homogeneous_d.h    |  2 +-
 Kernel_d/doc/Kernel_d/CGAL/Linear_algebraCd.h |  2 +-
 Kernel_d/doc/Kernel_d/CGAL/Linear_algebraHd.h |  2 +-
 .../Kernel--CartesianConstIterator_d.h        |  2 +-
 .../CGAL/Cell_attribute_with_point.h          |  2 +-
 .../CGAL/Cell_attribute_with_point_and_id.h   |  2 +-
 ...inear_cell_complex_for_combinatorial_map.h |  3 +-
 .../Linear_cell_complex_for_generalized_map.h |  3 +-
 .../CGAL/Linear_cell_complex_min_items.h      |  2 +-
 .../CGAL/Linear_cell_complex_traits.h         |  2 +-
 .../doc/Matrix_search/CGAL/Dynamic_matrix.h   |  3 +-
 .../Sorted_matrix_search_traits_adaptor.h     |  2 +-
 .../Mesh_2/CGAL/Delaunay_mesh_criteria_2.h    |  2 +-
 .../Mesh_2/CGAL/Delaunay_mesh_face_base_2.h   |  2 +-
 .../CGAL/Delaunay_mesh_size_criteria_2.h      |  2 +-
 .../Mesh_2/CGAL/Delaunay_mesh_vertex_base_2.h |  2 +-
 .../Mesh_3/CGAL/Gray_image_mesh_domain_3.h    |  2 +-
 .../doc/Mesh_3/CGAL/Implicit_mesh_domain_3.h  |  2 +-
 .../Mesh_3/CGAL/Labeled_image_mesh_domain_3.h |  2 +-
 Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h |  2 +-
 .../doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h   |  2 +-
 .../Mesh_3/CGAL/Polyhedral_mesh_domain_3.h    |  2 +-
 .../Polyhedral_mesh_domain_with_features_3.h  |  2 +-
 Mesh_3/doc/Mesh_3/CGAL/Triangle_accessor_3.h  |  2 +-
 .../include/CGAL/Compact_mesh_cell_base_3.h   |  2 +-
 Mesh_3/include/CGAL/Labeled_mesh_domain_3.h   |  2 +-
 Mesh_3/include/CGAL/Mesh_cell_base_3.h        |  2 +-
 .../CGAL/Mesh_constant_domain_field_3.h       |  2 +-
 Mesh_3/include/CGAL/Mesh_criteria_3.h         |  2 +-
 .../Mesh_domain_with_polyline_features_3.h    |  2 +-
 Mesh_3/include/CGAL/Mesh_edge_criteria_3.h    |  2 +-
 Mesh_3/include/CGAL/Mesh_vertex_base_3.h      |  2 +-
 .../CGAL/Polyhedral_complex_mesh_domain_3.h   |  2 +-
 .../CGAL/Sizing_field_with_aabb_tree.h        |  2 +-
 .../CGAL/Polygon_convex_decomposition_2.h     |  6 ++--
 .../CGAL/Polygon_nop_decomposition_2.h        |  2 +-
 .../Polygon_triangulation_decomposition_2.h   |  2 +-
 .../CGAL/Polygon_vertical_decomposition_2.h   |  2 +-
 ...mall_side_angle_bisector_decomposition_2.h |  2 +-
 .../Miscellany/CGAL/Handle_hash_function.h    |  2 +-
 .../Modular_arithmetic/CGAL/Modular_traits.h  |  2 +-
 .../doc/Modular_arithmetic/CGAL/Residue.h     |  2 +-
 Nef_2/doc/Nef_2/CGAL/Extended_cartesian.h     |  2 +-
 Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h   |  2 +-
 .../CGAL/Filtered_extended_homogeneous.h      |  2 +-
 .../doc/Number_types/CGAL/CORE_BigFloat.h     |  4 +--
 .../doc/Number_types/CGAL/CORE_BigInt.h       |  3 +-
 .../doc/Number_types/CGAL/CORE_BigRat.h       |  5 +---
 .../doc/Number_types/CGAL/CORE_Expr.h         |  4 +--
 Number_types/doc/Number_types/CGAL/Gmpfi.h    |  3 +-
 Number_types/doc/Number_types/CGAL/Gmpfr.h    |  3 +-
 Number_types/doc/Number_types/CGAL/Gmpq.h     |  4 +--
 Number_types/doc/Number_types/CGAL/Gmpz.h     |  3 +-
 Number_types/doc/Number_types/CGAL/Gmpzf.h    |  3 +-
 .../doc/Number_types/CGAL/Interval_nt.h       |  3 +-
 .../doc/Number_types/CGAL/Lazy_exact_nt.h     |  5 ++--
 Number_types/doc/Number_types/CGAL/MP_Float.h |  3 +-
 Number_types/doc/Number_types/CGAL/Mpzf.h     |  3 +-
 .../doc/Number_types/CGAL/NT_converter.h      |  2 +-
 .../Number_types/CGAL/Number_type_checker.h   |  3 +-
 Number_types/doc/Number_types/CGAL/Quotient.h |  4 +--
 .../doc/Number_types/CGAL/Sqrt_extension.h    | 16 +++++-----
 Number_types/doc/Number_types/CGAL/double.h   |  3 +-
 Number_types/doc/Number_types/CGAL/float.h    |  3 +-
 Number_types/doc/Number_types/CGAL/gmpxx.h    |  7 ++---
 .../doc/Number_types/CGAL/leda_bigfloat.h     |  4 +--
 .../doc/Number_types/CGAL/leda_integer.h      |  3 +-
 .../doc/Number_types/CGAL/leda_rational.h     |  5 +---
 .../doc/Number_types/CGAL/leda_real.h         |  4 +--
 .../doc/Number_types/CGAL/long_long.h         |  3 +-
 .../doc/Number_types/CGAL/utils_classes.h     |  6 ++--
 Number_types/include/CGAL/Exact_algebraic.h   |  5 +---
 Number_types/include/CGAL/Exact_integer.h     |  3 +-
 Number_types/include/CGAL/Exact_rational.h    |  5 +---
 .../Oriented_bounding_box_traits_3.h          |  2 +-
 Orthtree/include/CGAL/Orthtree/Node.h         |  2 +-
 Orthtree/include/CGAL/Orthtree/Traversals.h   |  8 ++---
 Orthtree/include/CGAL/Orthtree_traits_2.h     |  2 +-
 Orthtree/include/CGAL/Orthtree_traits_3.h     |  2 +-
 Orthtree/include/CGAL/Orthtree_traits_d.h     |  2 +-
 .../CGAL/Partition_is_valid_traits_2.h        |  2 +-
 .../doc/Partition_2/CGAL/Partition_traits_2.h |  6 +---
 .../CGAL/polygon_function_objects.h           |  6 ++--
 ...riodic_2_Delaunay_triangulation_traits_2.h |  2 +-
 .../CGAL/Periodic_2_triangulation_2.h         |  2 +-
 .../Periodic_2_triangulation_face_base_2.h    |  2 +-
 .../CGAL/Periodic_2_triangulation_traits_2.h  |  2 +-
 .../Periodic_2_triangulation_vertex_base_2.h  |  2 +-
 ...riodic_3_Delaunay_triangulation_traits_3.h |  2 +-
 .../CGAL/Periodic_3_offset_3.h                |  2 +-
 ...eriodic_3_regular_triangulation_traits_3.h |  2 +-
 .../Periodic_3_triangulation_ds_cell_base_3.h |  2 +-
 ...eriodic_3_triangulation_ds_vertex_base_3.h |  2 +-
 .../CGAL/Periodic_3_triangulation_traits_3.h  |  2 +-
 ...perbolic_Delaunay_triangulation_traits_2.h |  2 +-
 ...c_4_hyperbolic_triangulation_face_base_2.h |  2 +-
 ...4_hyperbolic_triangulation_vertex_base_2.h |  2 +-
 Point_set_3/include/CGAL/Point_set_3.h        | 10 +++----
 .../include/CGAL/Point_with_normal_3.h        |  2 +-
 .../include/CGAL/Lightweight_vector_3.h       |  2 +-
 .../CGAL/Poisson_reconstruction_function.h    |  2 +-
 .../CGAL/General_polygon_with_holes_2.h       |  2 +-
 Polygon/include/CGAL/Polygon_with_holes_2.h   |  2 +-
 .../doc/Polyhedron/CGAL/Polyhedron_items_3.h  |  2 +-
 .../Polyhedron/CGAL/Polyhedron_min_items_3.h  |  2 +-
 .../doc/Polyhedron/CGAL/Polyhedron_traits_3.h |  2 +-
 .../CGAL/Polyhedron_traits_with_normals_3.h   |  2 +-
 .../Hybrid_squared_distance_cost.h            |  2 +-
 .../Scaled_squared_distance_cost.h            |  2 +-
 .../Squared_distance_cost.h                   |  2 +-
 .../Stop_above_cost_threshold.h               |  2 +-
 .../Stop_below_count_ratio_threshold.h        |  2 +-
 .../Stop_below_count_threshold.h              |  2 +-
 .../Polyline_simplification_2/Vertex_base_2.h |  2 +-
 .../doc/Polynomial/CGAL/Exponent_vector.h     |  7 +----
 Polynomial/doc/Polynomial/CGAL/Polynomial.h   | 20 ++++++-------
 .../doc/Polynomial/CGAL/Polynomial_traits_d.h |  2 +-
 .../CGAL/Polytope_distance_d_traits_2.h       |  2 +-
 .../CGAL/Polytope_distance_d_traits_3.h       |  2 +-
 .../CGAL/Polytope_distance_d_traits_d.h       |  2 +-
 .../CGAL/Width_default_traits_3.h             |  2 +-
 Property_map/include/CGAL/property_map.h      | 20 ++++++-------
 QP_solver/doc/QP_solver/CGAL/QP_models.h      | 23 ++++----------
 .../CGAL/Mesh_complex_3_in_triangulation_3.h  |  2 +-
 .../CGAL/Simplicial_mesh_cell_base_3.h        |  2 +-
 .../CGAL/Simplicial_mesh_vertex_base_3.h      |  4 +--
 .../doc/STL_Extension/CGAL/Complexity_tags.h  |  6 ++--
 .../doc/STL_Extension/CGAL/Default.h          |  3 +-
 .../doc/STL_Extension/CGAL/Location_policy.h  |  3 +-
 .../STL_Extension/CGAL/Spatial_lock_grid_3.h  |  2 +-
 .../doc/STL_Extension/CGAL/function_objects.h | 26 ++++++++--------
 .../doc/STL_Extension/CGAL/iterator.h         | 20 ++++++-------
 STL_Extension/doc/STL_Extension/CGAL/tags.h   |  4 +--
 .../Advancing_front_mesher.h                  |  2 +-
 .../Alpha_shape_mesher.h                      |  2 +-
 .../Jet_smoother.h                            |  2 +-
 .../Weighted_PCA_smoother.h                   |  2 +-
 .../CGAL/Range_segment_tree_traits.h          | 12 ++++----
 .../CGAL/Segment_Delaunay_graph_2.h           |  2 +-
 .../CGAL/Segment_Delaunay_graph_face_base_2.h |  2 +-
 ...Segment_Delaunay_graph_filtered_traits_2.h | 10 ++-----
 .../CGAL/Segment_Delaunay_graph_hierarchy_2.h |  4 +--
 ...t_Delaunay_graph_hierarchy_vertex_base_2.h |  2 +-
 .../CGAL/Segment_Delaunay_graph_site_2.h      |  2 +-
 .../Segment_Delaunay_graph_storage_site_2.h   |  2 +-
 ..._Delaunay_graph_storage_site_with_info_2.h |  2 +-
 .../Segment_Delaunay_graph_storage_traits_2.h |  2 +-
 ...elaunay_graph_storage_traits_with_info_2.h |  2 +-
 .../CGAL/Segment_Delaunay_graph_traits_2.h    |  4 +--
 .../Segment_Delaunay_graph_vertex_base_2.h    |  2 +-
 .../CGAL/Segment_Delaunay_graph_Linf_2.h      |  2 +-
 ...nt_Delaunay_graph_Linf_filtered_traits_2.h |  4 +--
 .../Segment_Delaunay_graph_Linf_traits_2.h    |  4 +--
 .../Efficient_RANSAC_traits.h                 |  2 +-
 .../Point_set/K_neighbor_query.h              |  2 +-
 .../Least_squares_circle_fit_region.h         |  2 +-
 .../Least_squares_cylinder_fit_region.h       |  2 +-
 .../Point_set/Least_squares_line_fit_region.h |  2 +-
 .../Least_squares_plane_fit_region.h          |  2 +-
 .../Least_squares_sphere_fit_region.h         |  2 +-
 .../Point_set/Sphere_neighbor_query.h         |  2 +-
 .../Least_squares_plane_fit_region.h          |  2 +-
 .../Polygon_mesh/One_ring_neighbor_query.h    |  2 +-
 .../Polygon_mesh/Polyline_graph.h             |  2 +-
 .../Least_squares_line_fit_region.h           |  2 +-
 .../Contours/Longest_direction_2.h            |  2 +-
 .../Contours/Multiple_directions_2.h          |  2 +-
 .../Contours/User_defined_directions_2.h      |  2 +-
 .../Segments/Angle_regularization_2.h         |  2 +-
 .../Segments/Delaunay_neighbor_query_2.h      |  2 +-
 .../Segments/Offset_regularization_2.h        |  2 +-
 .../doc/Skin_surface_3/CGAL/Skin_surface_3.h  |  2 +-
 .../CGAL/Skin_surface_traits_3.h              |  2 +-
 .../Skin_surface_3/CGAL/Union_of_balls_3.h    |  2 +-
 .../CGAL/Snap_rounding_traits_2.h             |  2 +-
 .../include/CGAL/Default_diagonalize_traits.h |  2 +-
 .../include/CGAL/Diagonalize_traits.h         |  2 +-
 .../include/CGAL/Eigen_diagonalize_traits.h   |  2 +-
 Solver_interface/include/CGAL/Eigen_matrix.h  |  2 +-
 .../include/CGAL/Eigen_solver_traits.h        |  2 +-
 .../include/CGAL/Eigen_sparse_matrix.h        |  4 +--
 Solver_interface/include/CGAL/Eigen_svd.h     |  2 +-
 Solver_interface/include/CGAL/Eigen_vector.h  |  3 +-
 .../CGAL/GLPK_mixed_integer_program_traits.h  |  2 +-
 .../CGAL/Mixed_integer_program_traits.h       |  8 ++---
 .../CGAL/OSQP_quadratic_program_traits.h      |  2 +-
 .../CGAL/SCIP_mixed_integer_program_traits.h  |  2 +-
 .../CGAL/Euclidean_distance.h                 |  2 +-
 .../CGAL/Euclidean_distance_sphere_point.h    |  2 +-
 .../Spatial_searching/CGAL/Fuzzy_iso_box.h    |  2 +-
 .../doc/Spatial_searching/CGAL/Fuzzy_sphere.h |  2 +-
 .../CGAL/Manhattan_distance_iso_box_point.h   |  2 +-
 .../Spatial_searching/CGAL/Plane_separator.h  |  2 +-
 .../Spatial_searching/CGAL/Search_traits.h    |  2 +-
 .../Spatial_searching/CGAL/Search_traits_2.h  |  3 +-
 .../Spatial_searching/CGAL/Search_traits_3.h  |  3 +-
 .../CGAL/Search_traits_adapter.h              |  8 ++---
 .../Spatial_searching/CGAL/Search_traits_d.h  |  3 +-
 .../doc/Spatial_searching/CGAL/Splitters.h    | 14 ++++-----
 .../CGAL/Weighted_Minkowski_distance.h        |  2 +-
 .../CGAL/Hilbert_policy_tags.h                |  9 ++----
 .../CGAL/Spatial_sort_traits_adapter_2.h      |  2 +-
 .../CGAL/Spatial_sort_traits_adapter_3.h      |  2 +-
 .../CGAL/Spatial_sort_traits_adapter_d.h      |  2 +-
 .../CGAL/Polygon_offset_builder_traits_2.h    |  2 +-
 .../CGAL/Straight_skeleton_2.h                |  2 +-
 .../CGAL/Straight_skeleton_builder_2.h        |  2 +-
 .../CGAL/Straight_skeleton_builder_traits_2.h |  2 +-
 .../CGAL/Straight_skeleton_converter_2.h      |  2 +-
 .../CGAL/Straight_skeleton_face_base_2.h      |  2 +-
 .../CGAL/Straight_skeleton_halfedge_base_2.h  |  2 +-
 .../CGAL/Straight_skeleton_vertex_base_2.h    |  2 +-
 .../Stream_lines_2/CGAL/Euler_integrator_2.h  |  2 +-
 .../doc/Stream_lines_2/CGAL/Regular_grid_2.h  |  2 +-
 .../CGAL/Runge_kutta_integrator_2.h           |  2 +-
 .../Stream_lines_2/CGAL/Triangular_field_2.h  |  2 +-
 .../include/CGAL/IO/Istream_iterator.h        |  2 +-
 .../include/CGAL/IO/Ostream_iterator.h        |  2 +-
 .../subdivision_masks_3.h                     |  8 ++---
 .../include/CGAL/Surface_mesh/Properties.h    |  2 +-
 .../include/CGAL/Surface_mesh/Surface_mesh.h  | 18 ++++-------
 .../L21_metric_plane_proxy.h                  |  2 +-
 .../L2_metric_plane_proxy.h                   |  2 +-
 ...ormation_Eigen_closest_rotation_traits_3.h |  2 +-
 ...on_Eigen_polar_closest_rotation_traits_3.h |  2 +-
 .../ARAP_parameterizer_3.h                    |  2 +-
 .../Barycentric_mapping_parameterizer_3.h     |  2 +-
 .../Circular_border_parameterizer_3.h         |  6 ++--
 .../Discrete_authalic_parameterizer_3.h       |  2 +-
 .../Discrete_conformal_map_parameterizer_3.h  |  2 +-
 .../Fixed_border_parameterizer_3.h            |  2 +-
 .../LSCM_parameterizer_3.h                    |  2 +-
 .../MVC_post_processor_3.h                    |  2 +-
 .../Mean_value_coordinates_parameterizer_3.h  |  2 +-
 .../Square_border_parameterizer_3.h           |  6 ++--
 .../Two_vertices_parameterizer_3.h            |  2 +-
 .../Surface_mesh_shortest_path_traits.h       |  4 +--
 .../Edge_collapse_visitor_base.h              |  2 +-
 .../Bounded_distance_placement.h              |  2 +-
 .../Bounded_normal_change_filter.h            |  2 +-
 .../Bounded_normal_change_placement.h         |  2 +-
 .../Edge_collapse/Constrained_placement.h     |  2 +-
 .../Count_ratio_stop_predicate.h              |  2 +-
 .../Edge_collapse/Count_stop_predicate.h      |  2 +-
 .../Edge_count_ratio_stop_predicate.h         |  2 +-
 .../Edge_collapse/Edge_count_stop_predicate.h |  2 +-
 .../Policies/Edge_collapse/Edge_length_cost.h |  2 +-
 .../Edge_length_stop_predicate.h              |  2 +-
 .../Face_count_ratio_stop_predicate.h         |  2 +-
 .../Edge_collapse/Face_count_stop_predicate.h |  2 +-
 .../Edge_collapse/LindstromTurk_cost.h        |  2 +-
 .../Edge_collapse/LindstromTurk_placement.h   |  2 +-
 .../Edge_collapse/Midpoint_placement.h        |  2 +-
 .../Polyhedral_envelope_filter.h              |  2 +-
 .../CGAL/Polygonal_schema_min_items.h         |  2 +-
 .../Surface_mesher/CGAL/Gray_level_image_3.h  |  2 +-
 .../Surface_mesher/CGAL/Implicit_surface_3.h  |  2 +-
 .../CGAL/Surface_mesh_cell_base_3.h           |  2 +-
 ...urface_mesh_complex_2_in_triangulation_3.h |  2 +-
 .../CGAL/Surface_mesh_default_criteria_3.h    |  2 +-
 .../Surface_mesh_default_triangulation_3.h    |  2 +-
 .../CGAL/Surface_mesh_vertex_base_3.h         |  2 +-
 .../CGAL/Triangulation_data_structure_2.h     |  2 +-
 .../TDS_2/CGAL/Triangulation_ds_face_base_2.h |  2 +-
 .../CGAL/Triangulation_ds_vertex_base_2.h     |  2 +-
 .../Concepts/TriangulationDataStructure_2.h   |  4 +--
 .../CGAL/Triangulation_data_structure_3.h     |  2 +-
 .../TDS_3/CGAL/Triangulation_ds_cell_base_3.h |  2 +-
 .../CGAL/Triangulation_ds_vertex_base_3.h     |  2 +-
 .../Remeshing_cell_base_3.h                   |  3 +-
 .../Remeshing_vertex_base_3.h                 |  3 +-
 .../CGAL/Triangulation_data_structure.h       |  4 +--
 .../CGAL/Triangulation_ds_full_cell.h         |  2 +-
 .../CGAL/Triangulation_ds_vertex.h            |  2 +-
 .../Triangulation/CGAL/Triangulation_face.h   |  2 +-
 .../CGAL/Triangulation_full_cell.h            |  4 +--
 .../Triangulation/CGAL/Triangulation_vertex.h |  4 +--
 .../Constrained_triangulation_face_base_2.h   |  2 +-
 .../CGAL/Regular_triangulation_face_base_2.h  |  2 +-
 .../Regular_triangulation_vertex_base_2.h     |  2 +-
 .../CGAL/Triangulation_face_base_2.h          |  2 +-
 .../Triangulation_face_base_with_info_2.h     |  6 ++--
 .../CGAL/Triangulation_hierarchy_2.h          |  2 +-
 .../CGAL/Triangulation_vertex_base_2.h        |  2 +-
 .../Triangulation_vertex_base_with_info_2.h   |  6 ++--
 .../CGAL/Delaunay_triangulation_cell_base_3.h |  2 +-
 ...angulation_cell_base_with_circumcenter_3.h |  2 +-
 .../CGAL/Regular_triangulation_cell_base_3.h  |  2 +-
 ...n_cell_base_with_weighted_circumcenter_3.h |  2 +-
 ...Regular_triangulation_euclidean_traits_3.h |  2 +-
 .../Regular_triangulation_vertex_base_3.h     |  2 +-
 .../CGAL/Triangulation_cell_base_3.h          |  2 +-
 .../Triangulation_cell_base_with_info_3.h     |  3 +-
 .../CGAL/Triangulation_vertex_base_3.h        |  2 +-
 .../Triangulation_vertex_base_with_info_3.h   |  3 +-
 .../CGAL/Triangulation_segment_traverser_3.h  |  2 +-
 ...elaunay_triangulation_on_sphere_traits_2.h |  2 +-
 .../CGAL/Projection_on_sphere_traits_3.h      |  2 +-
 .../Triangulation_on_sphere_face_base_2.h     |  2 +-
 .../Triangulation_on_sphere_vertex_base_2.h   |  2 +-
 .../CGAL/Rotational_sweep_visibility_2.h      |  2 +-
 .../CGAL/Simple_polygon_visibility_2.h        |  2 +-
 .../CGAL/Triangular_expansion_visibility_2.h  |  2 +-
 .../Apollonius_graph_adaptation_policies_2.h  |  4 +--
 .../Apollonius_graph_adaptation_traits_2.h    |  2 +-
 ...unay_triangulation_adaptation_policies_2.h |  4 +--
 ...launay_triangulation_adaptation_traits_2.h |  2 +-
 .../CGAL/Identity_policy_2.h                  |  2 +-
 ...ular_triangulation_adaptation_policies_2.h |  4 +--
 ...egular_triangulation_adaptation_traits_2.h |  2 +-
 ...ent_Delaunay_graph_adaptation_policies_2.h |  4 +--
 ...gment_Delaunay_graph_adaptation_traits_2.h |  2 +-
 .../CGAL/Voronoi_diagram_2.h                  | 18 ++---------
 .../CGAL/Weights/discrete_harmonic_weights.h  |  2 +-
 .../include/CGAL/Weights/mean_value_weights.h |  2 +-
 .../include/CGAL/Weights/wachspress_weights.h |  2 +-
 521 files changed, 738 insertions(+), 964 deletions(-)

diff --git a/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Algebraic_structure_traits.h b/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Algebraic_structure_traits.h
index ebc961629571..4b83632b1a45 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Algebraic_structure_traits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Algebraic_structure_traits.h
@@ -5,7 +5,7 @@ namespace CGAL {
 
 An instance of `Algebraic_structure_traits` is a model of `AlgebraicStructureTraits`, where <span class="textsc">T</span> is the associated type.
 
-\cgalModels `AlgebraicStructureTraits`
+\cgalModels{AlgebraicStructureTraits}
 
 */
 template< typename T >
@@ -22,7 +22,7 @@ namespace CGAL {
 Tag indicating that a type is a model of the
 `EuclideanRing` concept.
 
-\cgalModels `DefaultConstructible`
+\cgalModels{DefaultConstructible}
 
 \sa `EuclideanRing`
 \sa `AlgebraicStructureTraits`
@@ -38,7 +38,7 @@ struct Euclidean_ring_tag : public Unique_factorization_domain_tag {
 
 Tag indicating that a type is a model of the `Field` concept.
 
-\cgalModels `DefaultConstructible`
+\cgalModels{DefaultConstructible}
 
 \sa `Field`
 \sa `AlgebraicStructureTraits`
@@ -54,7 +54,7 @@ struct Field_tag : public Integral_domain_tag {
 
 Tag indicating that a type is a model of the `FieldWithKthRoot` concept.
 
-\cgalModels `DefaultConstructible`
+\cgalModels{DefaultConstructible}
 
 \sa `FieldWithKthRoot`
 \sa `AlgebraicStructureTraits`
@@ -70,7 +70,7 @@ struct Field_with_kth_root_tag : public Field_with_sqrt_tag {
 
 Tag indicating that a type is a model of the `FieldWithRootOf` concept.
 
-\cgalModels `DefaultConstructible`
+\cgalModels{DefaultConstructible}
 
 \sa `FieldWithRootOf`
 \sa `AlgebraicStructureTraits`
@@ -86,7 +86,7 @@ struct Field_with_root_of_tag : public Field_with_kth_root_tag {
 
 Tag indicating that a type is a model of the `FieldWithSqrt` concept.
 
-\cgalModels `DefaultConstructible`
+\cgalModels{DefaultConstructible}
 
 \sa `FieldWithSqrt`
 \sa `AlgebraicStructureTraits`
@@ -102,7 +102,7 @@ struct Field_with_sqrt_tag : public Field_tag {
 
 Tag indicating that a type is a model of the `IntegralDomain` concept.
 
-\cgalModels `DefaultConstructible`
+\cgalModels{DefaultConstructible}
 
 \sa `IntegralDomain`
 \sa `AlgebraicStructureTraits`
@@ -118,7 +118,7 @@ struct Integral_domain_tag : public Integral_domain_without_division_tag {
 
 Tag indicating that a type is a model of the `IntegralDomainWithoutDivision` concept.
 
-\cgalModels `DefaultConstructible`
+\cgalModels{DefaultConstructible}
 
 \sa `IntegralDomainWithoutDivision`
 
@@ -133,7 +133,7 @@ struct Integral_domain_without_division_tag {
 
 Tag indicating that a type is a model of the `UniqueFactorizationDomain` concept.
 
-\cgalModels `DefaultConstructible`
+\cgalModels{DefaultConstructible}
 
 \sa `UniqueFactorizationDomain`
 \sa `AlgebraicStructureTraits`
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Fraction_traits.h b/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Fraction_traits.h
index d54d382dfd9f..025487d32486 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Fraction_traits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Fraction_traits.h
@@ -6,7 +6,7 @@ namespace CGAL {
 An instance of `Fraction_traits` is a model of `FractionTraits`,
 where `T` is the associated type.
 
-\cgalModels `FractionTraits`
+\cgalModels{FractionTraits}
 
 */
 template< typename T >
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Real_embeddable_traits.h b/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Real_embeddable_traits.h
index 90953f33c910..5c4966645e7c 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Real_embeddable_traits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/CGAL/Real_embeddable_traits.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 An instance of `Real_embeddable_traits` is a model of `RealEmbeddableTraits`, where <span class="textsc">T</span> is the associated type.
 
-\cgalModels `RealEmbeddableTraits`
+\cgalModels{RealEmbeddableTraits}
 
 */
 template< typename T >
diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_d_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_d_1.h
index a3e31bea51db..05b59d29f72a 100644
--- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_d_1.h
+++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_d_1.h
@@ -27,7 +27,7 @@ approximation of an algebraic real root is a slightly modified
 (filtered) version of the one presented in \cgalCite{abbott-qir-06}. The
 method has quadratic convergence.
 
-\cgalModels `AlgebraicKernel_d_1`
+\cgalModels{AlgebraicKernel_d_1}
 
 \sa `AlgebraicKernel_d_1`
 \sa `Polynomial_d`
diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_d_2.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_d_2.h
index c4b643bfab93..35472409ffbf 100644
--- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_d_2.h
+++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_d_2.h
@@ -47,7 +47,7 @@ above. `ROOT` should be one of the integer types.  See also the
 documentation of `Sqrt_extension<NT,ROOT>`.
 \cgalAdvancedEnd
 
-\cgalModels `AlgebraicKernel_d_2`
+\cgalModels{AlgebraicKernel_d_2}
 
 \sa `AlgebraicKernel_d_1`
 \sa `AlgebraicKernel_d_2`
diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_rs_gmpq_d_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_rs_gmpq_d_1.h
index 204f5b233fc7..dc0f525aeeb3 100644
--- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_rs_gmpq_d_1.h
+++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_rs_gmpq_d_1.h
@@ -12,7 +12,7 @@ rational univariate polynomial root isolation. It is a model of the
 isolate integer polynomials, the operations of this kernel have the
 overhead of converting the polynomials to integer.
 
-\cgalModels `AlgebraicKernel_d_1`
+\cgalModels{AlgebraicKernel_d_1}
 
 \sa `Algebraic_kernel_rs_gmpz_d_1`
 
diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_rs_gmpz_d_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_rs_gmpz_d_1.h
index 029066a0119c..7f4e7eb0966f 100644
--- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_rs_gmpz_d_1.h
+++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/CGAL/Algebraic_kernel_rs_gmpz_d_1.h
@@ -10,7 +10,7 @@ This univariate algebraic kernel uses the Rs library to perform
 integer univariate polynomial root isolation. It is a model of the
 `AlgebraicKernel_d_1` concept.
 
-\cgalModels `AlgebraicKernel_d_1`
+\cgalModels{AlgebraicKernel_d_1}
 
 \sa `Algebraic_kernel_rs_gmpz_d_1`
 
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_face_base_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_face_base_2.h
index fe8988c8f712..6e2c29329cc3 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_face_base_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_face_base_2.h
@@ -16,7 +16,7 @@ if `Alpha_shape_face_base_2` is intended to be used with an alpha-shape class ba
 \link Tag_true `Tag_true`\endlink, triggers exact comparisons between alpha values. See the description
 provided in the documentation of `Alpha_shape_2` for more details. The default value is \link Tag_false `Tag_false`\endlink.
 
-\cgalModels `AlphaShapeFace_2`
+\cgalModels{AlphaShapeFace_2}
 
 \sa `Triangulation_face_base_2`
 \sa `Regular_triangulation_face_base_2`
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_vertex_base_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_vertex_base_2.h
index 2c0602ce5126..f440c0b2d4de 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_vertex_base_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/CGAL/Alpha_shape_vertex_base_2.h
@@ -17,7 +17,7 @@ if `Alpha_shape_vertex_base_2` is intended to be used with an alpha-shape class
 \link Tag_true `Tag_true`\endlink, triggers exact comparisons between alpha values. See the description
 provided in the documentation of `Alpha_shape_2` for more details. The default value is \link Tag_false `Tag_false`\endlink.
 
-\cgalModels `AlphaShapeVertex_2`
+\cgalModels{AlphaShapeVertex_2}
 
 \sa `Triangulation_vertex_base_2`
 \sa `Regular_triangulation_vertex_base_2`
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_cell_base_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_cell_base_3.h
index 5a92d16b0dc2..a64151eb7649 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_cell_base_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_cell_base_3.h
@@ -19,7 +19,7 @@ provided in the documentation of `Alpha_shape_3` for more details. The default v
 must be \link Tag_true `Tag_true`\endlink if the underlying triangulation of the alpha shape to be used is a regular triangulation
 and \link Tag_false `Tag_false`\endlink otherwise. The default is \link Tag_false `Tag_false`\endlink.
 
-\cgalModels `AlphaShapeCell_3`
+\cgalModels{AlphaShapeCell_3}
 
 \sa `Delaunay_triangulation_cell_base_3`
 \sa `Regular_triangulation_cell_base_3`
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_vertex_base_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_vertex_base_3.h
index 0ba47d5cb6fe..ad88466cd48b 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_vertex_base_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Alpha_shape_vertex_base_3.h
@@ -19,7 +19,7 @@ provided in the documentation of `Alpha_shape_3` for more details. The default v
 must be \link Tag_true `Tag_true`\endlink if the underlying triangulation of the alpha shape to be used is a regular triangulation
 and \link Tag_false `Tag_false`\endlink otherwise. The default is \link Tag_false `Tag_false`\endlink.
 
-\cgalModels `AlphaShapeVertex_3`
+\cgalModels{AlphaShapeVertex_3}
 
 \sa `Triangulation_vertex_base_3`
 \sa `Regular_triangulation_vertex_base_3`
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Fixed_alpha_shape_cell_base_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Fixed_alpha_shape_cell_base_3.h
index fc558a82d759..b7fcb067dee7 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Fixed_alpha_shape_cell_base_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Fixed_alpha_shape_cell_base_3.h
@@ -13,7 +13,7 @@ to the `Alpha_shape_3` class.
         By default, it is instantiated with `Delaunay_triangulation_cell_base_3<Traits>`,
         which is appropriate for basic alpha shapes.
 
-\cgalModels `FixedAlphaShapeCell_3`
+\cgalModels{FixedAlphaShapeCell_3}
 
 \sa `Alpha_shape_cell_base_3`
 \sa `Delaunay_triangulation_cell_base_3`
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Fixed_alpha_shape_vertex_base_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Fixed_alpha_shape_vertex_base_3.h
index 4b237a562f2b..0d4e36a13c40 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Fixed_alpha_shape_vertex_base_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/CGAL/Fixed_alpha_shape_vertex_base_3.h
@@ -13,7 +13,7 @@ to the `Alpha_shape_3` class.
         By default, it is instantiated with `Triangulation_vertex_base_3<Traits>`,
         which is appropriate for basic alpha shapes.
 
-\cgalModels `FixedAlphaShapeVertex_3`
+\cgalModels{FixedAlphaShapeVertex_3}
 
 \sa `Alpha_shape_vertex_base_3`
 \sa `Triangulation_vertex_base_3`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_2.h
index bf41824e4a44..92cd1c06b4d7 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_2.h
@@ -46,7 +46,7 @@ ag.incident_edges(ag.infinite_vertex());
 ag.incident_edges(ag.infinite_vertex(), f);
 \endcode
 
-\cgalModels `DelaunayGraph_2`
+\cgalModels{DelaunayGraph_2}
 
 \sa `CGAL::Apollonius_graph_traits_2<K,Method_tag>`
 \sa `CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_filtered_traits_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_filtered_traits_2.h
index 155a7b240cb3..a8c3dfc63f0a 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_filtered_traits_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_filtered_traits_2.h
@@ -37,7 +37,7 @@ The default values for the template parameters are as follows:
 `FK = CGAL::Simple_cartesian<CGAL::Interval_nt<false> >`,
 `FM = CM`.
 
-\cgalModels `ApolloniusGraphTraits_2`
+\cgalModels{ApolloniusGraphTraits_2}
 
 \sa `Kernel`
 \sa `ApolloniusGraphTraits_2`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_hierarchy_vertex_base_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_hierarchy_vertex_base_2.h
index c09d6255ab53..7e05e28f2a31 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_hierarchy_vertex_base_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_hierarchy_vertex_base_2.h
@@ -11,7 +11,7 @@ vertex base required by the
 `Apollonius_graph_hierarchy_vertex_base_2` is templated by a class `Agvb` which must be a model
 of the `ApolloniusGraphVertexBase_2` concept.
 
-\cgalModels `ApolloniusGraphHierarchyVertexBase_2`
+\cgalModels{ApolloniusGraphHierarchyVertexBase_2}
 
 \sa `CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden>`
 \sa `CGAL::Triangulation_data_structure_2<Vb,Fb>`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_traits_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_traits_2.h
index 3fe29ef740bc..dd8543868818 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_traits_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_traits_2.h
@@ -20,7 +20,7 @@ default value for `Method_tag` is `CGAL::Integral_domain_without_division_tag`.
 The way the predicates are evaluated is discussed in
 \cgalCite{cgal:ke-ppawv-02}, \cgalCite{cgal:ke-rctac-03}.
 
-\cgalModels `ApolloniusGraphTraits_2`
+\cgalModels{ApolloniusGraphTraits_2}
 
 \sa `CGAL::Apollonius_graph_2<Gt,Agds>`
 \sa `CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_vertex_base_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_vertex_base_2.h
index ae9eca3dc6ec..042408867403 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_vertex_base_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_graph_vertex_base_2.h
@@ -17,7 +17,7 @@ site can become visible. If `StoreHidden` is set to
 `true`, hidden sites are stored, otherwise they are
 discarded. By default `StoreHidden` is set to `true`.
 
-\cgalModels `ApolloniusGraphVertexBase_2`
+\cgalModels{ApolloniusGraphVertexBase_2}
 
 \sa `CGAL::Triangulation_data_structure_2<Vb,Fb>`
 \sa `CGAL::Apollonius_graph_hierarchy_vertex_base_2<Gt>`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_site_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_site_2.h
index 162a6e462597..8d55878c7e8d 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_site_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/CGAL/Apollonius_site_2.h
@@ -8,7 +8,7 @@ The class `Apollonius_site_2` is a model for the concept
 `ApolloniusSite_2`. It is parametrized by a template parameter
 `K` which must be a model of the `Kernel` concept.
 
-\cgalModels `ApolloniusSite_2`
+\cgalModels{ApolloniusSite_2}
 
 \cgalHeading{Types}
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_Bezier_curve_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_Bezier_curve_traits_2.h
index b013c2be1ad4..7976f939c74c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_Bezier_curve_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_Bezier_curve_traits_2.h
@@ -52,8 +52,7 @@ the `Are_mergeable_2` operation does not enforce the input curves
 to have the same direction as a precondition. Moreover, `Arr_Bezier_curve_traits_2`
 supports the merging of curves of opposite directions.
 
-\cgalModels `ArrangementTraits_2`
-\cgalModels `ArrangementDirectionalXMonotoneTraits_2`
+\cgalModels{ArrangementTraits_2,ArrangementDirectionalXMonotoneTraits_2}
 
 
 */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_algebraic_segment_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_algebraic_segment_traits_2.h
index 165e9cbd5872..069d91859ee7 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_algebraic_segment_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_algebraic_segment_traits_2.h
@@ -22,7 +22,7 @@ the types `leda::integer` and `CORE::BigInt` are supported as well
 as any instance of `CGAL::Sqrt_extension` that is instantiated with
 one of the integral types above.
 
-\cgalModels `ArrangementTraits_2`
+\cgalModels{ArrangementTraits_2}
 
 
 */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h
index 06cafbd5e13c..f839b4967ef8 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h
@@ -21,7 +21,7 @@ namespace CGAL {
  * `Arr_default_dcel<Traits>`.
  * </UL>
  *
- * \cgalModels `ArrangementBasicTopologyTraits`
+ * \cgalModels{ArrangementBasicTopologyTraits}
  *
  * \sa `Arr_default_dcel<Traits>`
  * \sa `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel,x,y>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circle_segment_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circle_segment_traits_2.h
index 43b7d56bcf8c..4a82982e7519 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circle_segment_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circle_segment_traits_2.h
@@ -32,8 +32,7 @@ namespace CGAL {
  * same direction as a precondition. Moreover, `Arr_circle_segment_traits_2`
  * supports the merging of curves of opposite directions.
  *
- * \cgalModels `ArrangementTraits_2`
- * \cgalModels `ArrangementDirectionalXMonotoneTraits_2`
+ * \cgalModels{ArrangementTraits_2,ArrangementDirectionalXMonotoneTraits_2}
  *
  */
 template< typename Kernel >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_arc_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_arc_traits_2.h
index f8307dbca1b0..014e1f5ec21e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_arc_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_arc_traits_2.h
@@ -8,7 +8,7 @@ This class is a traits class for \cgal arrangements, built on top of a model of
 concept `CircularKernel`.
 It provides curves of type `CGAL::Circular_arc_2<CircularKernel>`.
 
-\cgalModels `ArrangementTraits_2`
+\cgalModels{ArrangementTraits_2}
 
 */
 template< typename CircularKernel >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h
index b12a51541cf4..9bd3569f1145 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circular_line_arc_traits_2.h
@@ -12,7 +12,7 @@ of both types
 
 It uses the <A HREF="https://www.boost.org/doc/html/variant.html">boost::variant</A>.
 
-\cgalModels `ArrangementTraits_2`
+\cgalModels{ArrangementTraits_2}
 
 */
 template< typename CircularKernel >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
index fe6e70de9c59..fe052cd26e5b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
@@ -80,9 +80,7 @@ namespace CGAL {
  * to have the same direction as a precondition. Moreover, `Arr_conic_traits_2`
  * supports the merging of curves of opposite directions.
  *
- * \cgalModels `ArrangementTraits_2`
- * \cgalModels `ArrangementLandmarkTraits_2`
- * \cgalModels `ArrangementDirectionalXMonotoneTraits_2`
+ * \cgalModels{ArrangementTraits_2,ArrangementLandmarkTraits_2,ArrangementDirectionalXMonotoneTraits_2}
  *
  * \cgalHeading{Types}
  */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_consolidated_curve_data_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_consolidated_curve_data_traits_2.h
index bbf6205037d8..2ed18e6be6bc 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_consolidated_curve_data_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_consolidated_curve_data_traits_2.h
@@ -21,7 +21,7 @@ both resulting subcurves. In case two (or more) \f$ x\f$-monotone curves
 overlap, their data sets are consolidated, and are inserted into the set
 of the \f$ x\f$-monotone curve that represents the overlap.
 
-\cgalModels `ArrangementTraits_2`
+\cgalModels{ArrangementTraits_2}
 
 */
 template< typename Traits, typename Data >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_curve_data_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_curve_data_traits_2.h
index a0d7d72ce422..e75623e8cd72 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_curve_data_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_curve_data_traits_2.h
@@ -49,7 +49,7 @@ namespace CGAL {
  * `d1` and `d2`. The \f$ x\f$-monotone curve that represents the overlap is
  * associated with the output of this functor.
  *
- * \cgalModels `ArrangementTraits_2`
+ * \cgalModels{ArrangementTraits_2}
  */
 template <typename Tr, typename XData, typename Mrg, typename CData, typename Cnv>
 class Arr_curve_data_traits_2 : public Tr {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_dcel_base.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_dcel_base.h
index 8f9202a3a137..9fa8f5f4d96e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_dcel_base.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_dcel_base.h
@@ -16,7 +16,7 @@ must be instantiated with models of the concepts
 `ArrangementDcelVertex`, `ArrangementDcelHalfedge`,
 and `ArrangementDcelFace` respectively.
 
-\cgalModels `ArrangementDcel`
+\cgalModels{ArrangementDcel}
 
 */
 template< typename V, typename H, typename F >
@@ -29,7 +29,7 @@ class Arr_dcel_base {
 The basic \dcel face type. Serves as a basis class for an extended
 face record with auxiliary data fields.
 
-\cgalModels `ArrangementDcelFace`
+\cgalModels{ArrangementDcelFace}
 
 */
 class Arr_face_base {
@@ -43,7 +43,7 @@ The basic \dcel halfedge type. Serves as a basis class for an
 extended halfedge record with auxiliary data fields. The `Curve`
 parameter is the type of \f$ x\f$-monotone curves associated with the vertices.
 
-\cgalModels `ArrangementDcelHalfedge`
+\cgalModels{ArrangementDcelHalfedge}
 
 */
 template< typename Curve >
@@ -58,7 +58,7 @@ The basic \dcel vertex type. Serves as a basis class for an extended
 vertex record with auxiliary data fields. The `Point` parameter is
 the type of points associated with the vertices.
 
-\cgalModels `ArrangementDcelVertex`
+\cgalModels{ArrangementDcelVertex}
 
 */
 template< typename Point >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_dcel.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_dcel.h
index 8da592fa207f..453a7f050925 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_dcel.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_dcel.h
@@ -12,7 +12,7 @@ the base vertex and halfedge types, respectively. Thus, the default
 \dcel records store no other information, except for the topological
 incidence relations and the geometric data attached to vertices and edges.
 
-\cgalModels `ArrangementDcelWithRebind`
+\cgalModels{ArrangementDcelWithRebind}
 
 \sa `Arr_dcel_base<V,H,F>`
 */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_overlay_traits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_overlay_traits.h
index 6419b1af7ae3..5b5677b74588 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_overlay_traits.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_overlay_traits.h
@@ -10,7 +10,7 @@ of type `Arrangement` that store no auxiliary data with their \dcel records, whe
 \dcel data as well. This class simply gives empty implementation for all
 traits-class functions.
 
-\cgalModels `OverlayTraits`
+\cgalModels{OverlayTraits}
 
 \sa `overlay`
 
@@ -43,7 +43,7 @@ it uses the functor `OvlFaceData`, which accepts a `FaceData_A` object
 and a `FaceData_B` object and computes a corresponding `FaceData_R`
 object, in order to set the auxiliary data of the overlay face.
 
-\cgalModels `OverlayTraits`
+\cgalModels{OverlayTraits}
 
 \sa `overlay`
 \sa `CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_extended_dcel.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_extended_dcel.h
index b06910d1e140..b36aa2a7eb7c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_extended_dcel.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_extended_dcel.h
@@ -33,7 +33,7 @@ The default values follow:
 
 </TABLE>
 
-\cgalModels `ArrangementDcelWithRebind`
+\cgalModels{ArrangementDcelWithRebind}
 
 \sa `Arr_dcel_base<V,H,F>`
 
@@ -57,7 +57,7 @@ The `Arr_extended_face` class-template extends the face topological-features of
 \dcel. It is parameterized by a face base-type `FaceBase` and a data type
 `FData` used to extend the face base-type.
 
-\cgalModels `ArrangementDcelFace`
+\cgalModels{ArrangementDcelFace}
 
 \sa `Arr_dcel_base<V,H,F>`
 
@@ -109,7 +109,7 @@ The `Arr_extended_halfedge` class-template extends the halfedge topological-feat
 the \dcel. It is parameterized by a halfedge base-type `HalfedgeBase`
 and a data type `HData` used to extend the halfedge base-type.
 
-\cgalModels `ArrangementDcelHalfedge`
+\cgalModels{ArrangementDcelHalfedge}
 
 \sa `Arr_dcel_base<V,H,F>`
 
@@ -162,7 +162,7 @@ topological-features of the \dcel. It is parameterized by a
 vertex base-type `VertexBase` and a data type `VData` used to extend
 the vertex base-type.
 
-\cgalModels `ArrangementDcelVertex`
+\cgalModels{ArrangementDcelVertex}
 
 \sa `Arr_dcel_base<V,H,F>`
 
@@ -235,7 +235,7 @@ as follows:
 
 </TABLE>
 
-\cgalModels `ArrangementDcelWithRebind`
+\cgalModels{ArrangementDcelWithRebind}
 
 \sa `Arr_dcel_base<V,H,F>`
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h
index ae70704f3b56..bcb0d5c378f2 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h
@@ -19,10 +19,7 @@ existing faces might be removed, the notification mechanism is used
 to dynamically maintain the mapping of face handles to indices.
 
 
-\cgalModels DefaultConstructible
-\cgalModels CopyConstructible
-\cgalModels Assignable
-\cgalModels `ReadablePropertyMap`
+\cgalModels{DefaultConstructible,CopyConstructible,Assignable,ReadablePropertyMap}
 
 \sa `Arr_observer<Arrangement>`
 \sa `Arr_vertex_index_map<Arrangement>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
index c6c4c608690b..d34b40072a93 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
@@ -39,9 +39,7 @@ namespace CGAL {
    * normalized vector \f$(x,y)\f$ in the \f$xy\f$-plane that bisects the
    * identification curve.
 
-   * \cgalModels `ArrangementTraits_2`
-   * \cgalModels `ArrangementLandmarkTraits_2`
-   * \cgalModels `ArrangementSphericalBoundaryTraits_2`
+   * \cgalModels{ArrangementTraits_2,ArrangementLandmarkTraits_2,ArrangementSphericalBoundaryTraits_2}
    */
 
   template <typename Kernel, typename X, typename Y>
@@ -52,9 +50,7 @@ namespace CGAL {
      * not-necessarily normalized 3D direction extended with information that
      * specifies the location of the point pre-image in the parameter space.
      *
-     * \cgalModels `Assignable`
-     * \cgalModels `DefaultConstructible`
-     * \cgalModels `CopyConstructible`
+     * \cgalModels{Assignable,DefaultConstructible,CopyConstructible}
      */
     class Point_2 {
     public:
@@ -118,9 +114,7 @@ namespace CGAL {
      * intersect the identified left and right sides of the boundary of the
      * parameter space.
      *
-     * \cgalModels `Assignable`
-     * \cgalModels `DefaultConstructible`
-     * \cgalModels `CopyConstructible`
+     * \cgalModels{Assignable,DefaultConstructible,CopyConstructible}
      */
     class X_monotone_curve_2 {
     public:
@@ -287,10 +281,7 @@ namespace CGAL {
 
     /*! Construction functor of a point.
      *
-     * \cgalModels `Assignable`
-     * \cgalModels `CopyConstructible`
-     * \cgalModels `AdaptableUnaryFunction`
-     * \cgalModels `AdaptableTernaryFunction`
+     * \cgalModels{Assignable,CopyConstructible,AdaptableUnaryFunction,AdaptableTernaryFunction}
      */
     /*!
      */
@@ -325,11 +316,7 @@ namespace CGAL {
 
     /*! Construction functor of \f$x\f$-monotone geodesic arcs.
      *
-     * \cgalModels `Assignable`
-     * \cgalModels `CopyConstructible`
-     * \cgalModels `AdaptableUnaryFunction`
-     * \cgalModels `AdaptableBinaryFunction`
-     * \cgalModels `AdaptableTernaryFunction`
+     * \cgalModels{Assignable,CopyConstructible,AdaptableUnaryFunction,AdaptableBinaryFunction,AdaptableTernaryFunction}
      */
     class Construct_x_monotone_curve_2 {
     public:
@@ -393,11 +380,7 @@ namespace CGAL {
 
     /*! Construction functor of geodesic arcs.
      *
-     * \cgalModels `Assignable`
-     * \cgalModels `CopyConstructible`
-     * \cgalModels `AdaptableUnaryFunction`
-     * \cgalModels `AdaptableBinaryFunction`
-     * \cgalModels `AdaptableTernaryFunction`
+     * \cgalModels{Assignable,CopyConstructible,AdaptableUnaryFunction,AdaptableBinaryFunction,AdaptableTernaryFunction}
      */
     class Construct_curve_2 {
     public:
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_landmarks_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_landmarks_point_location.h
index 92490f47f2a1..761f83a10448 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_landmarks_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_landmarks_point_location.h
@@ -47,8 +47,7 @@ when the application frequently issues point-location queries on a
 rather static arrangement that the changes applied to it are mainly
 insertions of curves and not deletions of them.
 
-\cgalModels `ArrangementPointLocation_2`
-\cgalModels `ArrangementVerticalRayShoot_2`
+\cgalModels{ArrangementPointLocation_2,ArrangementVerticalRayShoot_2}
 
 \sa `ArrangementPointLocation_2`
 \sa `ArrangementVerticalRayShoot_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_line_arc_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_line_arc_traits_2.h
index b1b230c0393b..909792816a7b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_line_arc_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_line_arc_traits_2.h
@@ -8,7 +8,7 @@ This class is a traits class for \cgal arrangements, built on top of a
 model of concept `CircularKernel`. It provides curves of type
 `CGAL::Line_arc_2<CircularKernel>`.
 
-\cgalModels `ArrangementTraits_2`
+\cgalModels{ArrangementTraits_2}
 
 */
 template< typename CircularKernel >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_linear_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_linear_traits_2.h
index c46342987f83..7f1d5825c01b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_linear_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_linear_traits_2.h
@@ -21,9 +21,7 @@ namespace CGAL {
  * we can find out its actual type and convert it to the respective kernel
  * object (say, to a `Kernel::Ray_2`).
  *
- * \cgalModels `ArrangementTraits_2`
- * \cgalModels `ArrangementLandmarkTraits_2`
- * \cgalModels `ArrangementOpenBoundaryTraits_2`
+ * \cgalModels{ArrangementTraits_2,ArrangementLandmarkTraits_2,ArrangementOpenBoundaryTraits_2}
  */
 template< typename Kernel >
 class Arr_linear_traits_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_naive_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_naive_point_location.h
index 1ef49902c8cf..d354aba10568 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_naive_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_naive_point_location.h
@@ -13,8 +13,7 @@ The query time is therefore linear in the complexity of the arrangement.
 Naturally, this point-location strategy could turn into a heavy
 time-consuming process when applied to dense arrangements.
 
-\cgalModels `ArrangementPointLocation_2`
-\cgalModels `ArrangementVerticalRayShoot_2`
+\cgalModels{ArrangementPointLocation_2,ArrangementVerticalRayShoot_2}
 
 \sa `ArrangementPointLocation_2`
 \sa `ArrangementVerticalRayShoot_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_basic_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_basic_traits_2.h
index 2a97525dc225..e85664bdb761 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_basic_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_basic_traits_2.h
@@ -21,7 +21,7 @@ instantiations for the kernel. Using other (inexact) number types
 `Simple_cartesian<double>`) is also possible, at the user's own
 risk.
 
-\cgalModels `ArrangementLandmarkTraits_2`
+\cgalModels{ArrangementLandmarkTraits_2}
 
 */
 template< typename Kernel >
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_traits_2.h
index c5b1ad7bf9b0..32a67f5162df 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_traits_2.h
@@ -32,9 +32,7 @@ the `Are_mergeable_2` operation does not enforce the input curves
 to have the same direction as a precondition. Moreover, `Arr_non_caching_segment_traits_2`
 supports the merging of curves of opposite directions.
 
-\cgalModels `ArrangementTraits_2`
-\cgalModels `ArrangementLandmarkTraits_2`
-\cgalModels `ArrangementDirectionalXMonotoneTraits_2`
+\cgalModels{ArrangementTraits_2,ArrangementLandmarkTraits_2,ArrangementDirectionalXMonotoneTraits_2}
 
 \sa `Arr_segment_traits_2<Kernel>`
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polycurve_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polycurve_traits_2.h
index 787873149135..a1bb1b331d12 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polycurve_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polycurve_traits_2.h
@@ -72,10 +72,9 @@ namespace CGAL {
    * set the macro `CGAL_ALWAYS_LEFT_TO_RIGHT` to 1 before any \cgal header is
    * included.
    *
-   * \cgalModels `ArrangementTraits_2`
-   * \cgalModels `ArrangementDirectionalXMonotoneTraits_2`
-   * \cgalModels `ArrangementApproximateTraits_2` (if the type that substitutes
-   *   the template parameter `SubcurveTraits_2` models the concept as well)
+   * \cgalModels{ArrangementTraits_2,ArrangementDirectionalXMonotoneTraits_2,
+   *             ArrangementApproximateTraits_2 (if the type that substitutes
+   *   the template parameter `SubcurveTraits_2` models the concept as well)}
    *
    * \sa `Arr_algebraic_segment_traits_2<Coefficient>`
    * \sa `Arr_Bezier_curve_traits_2<RatKernel, AlgKernel, NtTraits>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polyline_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polyline_traits_2.h
index 9c86561f925c..8f63945a3afa 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polyline_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polyline_traits_2.h
@@ -77,12 +77,9 @@ namespace CGAL {
  * the macro `CGAL_ALWAYS_LEFT_TO_RIGHT` to 1 before any \cgal header is
  * included.
  *
- * \cgalModels `ArrangementTraits_2`
- * \cgalModels `ArrangementDirectionalXMonotoneTraits_2`
- * \cgalModels `ArrangementConstructXMonotoneCurveTraits_2`
- * \cgalModels `ArrangementConstructCurveTraits_2`
- * \cgalModels `ArrangementApproximateTraits_2` (if the type that substitutes
- *   the template parameter `SegmentTraits_2` models the concept as well)
+ * \cgalModels{ArrangementTraits_2,ArrangementDirectionalXMonotoneTraits_2,`ArrangementConstructXMonotoneCurveTraits_2`
+ *             ArrangementConstructCurveTraits_2,ArrangementApproximateTraits_2 (if the type that substitutes
+ *   the template parameter `SegmentTraits_2` models the concept as well)}
  *
  * \sa `Arr_polycurve_traits_2<SubcurveTraits_2>`
  * \sa `Arr_Bezier_curve_traits_2<RatKernel, AlgKernel, NtTraits>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_rational_function_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_rational_function_traits_2.h
index b773cddf170b..7c121ebf8976 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_rational_function_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_rational_function_traits_2.h
@@ -52,9 +52,7 @@ namespace CGAL {
   to have the same direction as a precondition. Moreover, `Arr_rational_function_traits_2`
   supports the merging of curves of opposite directions.
 
-  \cgalModels `ArrangementTraits_2`
-  \cgalModels `ArrangementDirectionalXMonotoneTraits_2`
-  \cgalModels `ArrangementOpenBoundaryTraits_2`
+  \cgalModels{ArrangementTraits_2,ArrangementDirectionalXMonotoneTraits_2,ArrangementOpenBoundaryTraits_2}
 */
 template< typename AlgebraicKernel_d_1 >
 class Arr_rational_function_traits_2 {
@@ -134,10 +132,7 @@ Functor to construct a `Curve_2`. To enable caching the class is not
 default constructible and must be obtained via the function
 `construct_curve_2_object()`, which is a member of the traits.
 
-\cgalModels `Assignable`
-\cgalModels `CopyConstructible`
-\cgalModels `AdaptableBinaryFunction`
-\cgalModels `AdaptableUnaryFunction`
+\cgalModels{Assignable,CopyConstructible,AdaptableBinaryFunction,AdaptableUnaryFunction}
 
 */
 class Construct_curve_2 {
@@ -289,10 +284,7 @@ Functor to construct a `X_monotone_curve_2`. To enable caching the class
 is not default constructible and must be obtained via the function
 `construct_x_monotone_curve_2_object()`, which is a member of the traits.
 
-\cgalModels `Assignable`
-\cgalModels `CopyConstructible`
-\cgalModels `AdaptableBinaryFunction`
-\cgalModels `AdaptableUnaryFunction`
+\cgalModels{Assignable,CopyConstructible,AdaptableBinaryFunction,AdaptableUnaryFunction}
 
 */
 class Construct_x_monotone_curve_2 {
@@ -460,7 +452,7 @@ const Algebraic_real_1& lower, const Algebraic_real_1& upper); const
 The `Curve_2` class nested within the traits is used
 to represent rational functions which may be restricted to a certain x-range.
 
-\cgalModels `ArrTraits::Curve_2`
+\cgalModels{ArrTraits::Curve_2}
 
 */
 class Curve_2 {
@@ -531,7 +523,7 @@ Algebraic_real_1 right_x() const;
 /*!
 
 
-\cgalModels `ArrTraits::Point_2`
+\cgalModels{ArrTraits::Point_2}
 
 */
 class Point_2 {
@@ -633,7 +625,7 @@ The `X_monotone_curve_2` class nested within the traits is used
 to represent \f$ x\f$-monotone parts of rational functions. In particular, such an \f$ x\f$-monotone curve
 may not contain a vertical asymptote in its interior \f$ x\f$-range.
 
-\cgalModels `ArrTraits::XMonotoneCurve_2`
+\cgalModels{ArrTraits::XMonotoneCurve_2}
 
 */
 class X_monotone_curve_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_segment_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_segment_traits_2.h
index 3d7d3ab58267..9036308edaa9 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_segment_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_segment_traits_2.h
@@ -52,9 +52,7 @@ namespace CGAL {
  * same direction as a precondition. Moreover, `Arr_segment_traits_2` supports
  * the merging of curves of opposite directions.
  *
- * \cgalModels `ArrangementTraits_2`
- * \cgalModels `ArrangementLandmarkTraits_2`
- * \cgalModels `ArrangementDirectionalXMonotoneTraits_2`
+ * \cgalModels{ArrangementTraits_2,ArrangementLandmarkTraits_2,ArrangementDirectionalXMonotoneTraits_2}
  */
 template <typename Kernel>
 class Arr_segment_traits_2 : public Kernel {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h
index 3969c0a92cc7..5c1775e331f3 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h
@@ -21,7 +21,7 @@ namespace CGAL {
  * `Arr_default_dcel<Traits>`.
  * </UL>
  *
- * \cgalModels `ArrangementBasicTopologyTraits`
+ * \cgalModels{ArrangementBasicTopologyTraits}
  *
  * \sa `Arr_default_dcel<Traits>`
  * \sa `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel,x,y>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h
index 0027ec53409c..75994a31f173 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_trapezoid_ric_point_location.h
@@ -26,8 +26,7 @@ is relatively large.
 
 This strategy supports arbitrary subdivisions, including unbounded ones.
 
-\cgalModels `ArrangementPointLocation_2`
-\cgalModels `ArrangementVerticalRayShoot_2`
+\cgalModels{ArrangementPointLocation_2,ArrangementVerticalRayShoot_2}
 
 \sa `ArrangementPointLocation_2`
 \sa `ArrangementVerticalRayShoot_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
index ed9c1e12e3d1..5e1f74d0326e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
@@ -15,8 +15,7 @@ namespace CGAL {
  * (especially when the number of modifications applied to the arrangement is
  * high) and provided only for educational purposes.
  *
- * \cgalModels `ArrangementPointLocation_2`
- * \cgalModels `ArrangementVerticalRayShoot_2`
+ * \cgalModels{ArrangementPointLocation_2,ArrangementVerticalRayShoot_2}
  *
  * \sa `ArrangementPointLocation_2`
  * \sa `ArrangementVerticalRayShoot_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h
index 4c7c69fa5aed..06efe81c731a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h
@@ -21,7 +21,7 @@ namespace CGAL {
  * `Arr_default_dcel<Traits>`.
  * </UL>
  *
- * \cgalModels `ArrangementBasicTopologyTraits`
+ * \cgalModels{ArrangementBasicTopologyTraits}
  *
  * \sa `Arr_default_dcel<Traits>`
  * \sa `CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel,x,y>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h
index 992a9862b9bb..1c915a6b23cf 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h
@@ -19,10 +19,7 @@ existing vertices might be removed, the notification mechanism is used
 to dynamically maintain the mapping of vertex handles to indices.
 
 
-\cgalModels DefaultConstructible
-\cgalModels CopyConstructible
-\cgalModels Assignable
-\cgalModels `ReadablePropertyMap`
+\cgalModels{DefaultConstructible,CopyConstructible,Assignable,ReadablePropertyMap}
 
 \sa `Arr_observer<Arrangement>`
 \sa `Arr_face_index_map<Arrangement>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_walk_along_line_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_walk_along_line_point_location.h
index ed5df33be960..508d85801ba3 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_walk_along_line_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_walk_along_line_point_location.h
@@ -23,8 +23,7 @@ It is therefore recommended to use the "walk" point-location strategy
 for arrangements that are constantly changing, especially if the number
 of issued queries is not large.
 
-\cgalModels `ArrangementPointLocation_2`
-\cgalModels `ArrangementVerticalRayShoot_2`
+\cgalModels{ArrangementPointLocation_2,ArrangementVerticalRayShoot_2}
 
 \sa `ArrangementPointLocation_2`
 \sa `ArrangementVerticalRayShoot_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/IO/Arr_text_formatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/IO/Arr_text_formatter.h
index fa5d3ff96987..4695aa5cfb58 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/IO/Arr_text_formatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/IO/Arr_text_formatter.h
@@ -18,8 +18,7 @@ defined by the `Arrangement` template-parameter, as well as the `VertexData`,
 `HalfedgeData` and `FaceData` types, can all be written to an input stream using
 the `<<` operator and read from an input stream using the `>>` operator.
 
-\cgalModels `ArrangementInputFormatter`
-\cgalModels `ArrangementOutputFormatter`
+\cgalModels{ArrangementInputFormatter,ArrangementOutputFormatter}
 
 \sa `PkgArrangementOnSurface2Read`
 \sa `PkgArrangementOnSurface2Write`
@@ -50,8 +49,7 @@ The `Arr_face_extended_text_formatter` class assumes that the nested `Point_2` a
 defined by the `Arrangement` template-parameter and that the `FaceData` type
 can all be written to an input stream using the `<<` operator and read from an input stream using the `>>` operator.
 
-\cgalModels `ArrangementInputFormatter`
-\cgalModels `ArrangementOutputFormatter`
+\cgalModels{ArrangementInputFormatter,ArrangementOutputFormatter}
 
 \sa `PkgArrangementOnSurface2Read`
 \sa `PkgArrangementOnSurface2Write`
@@ -81,8 +79,7 @@ defined by the `Arrangement` template-parameter can both be written to an input
 stream using the `<<` operator and read from an input stream using the `>>`
 operator.
 
-\cgalModels `ArrangementInputFormatter`
-\cgalModels `ArrangementOutputFormatter`
+\cgalModels{ArrangementInputFormatter,ArrangementOutputFormatter}
 
 \sa `PkgArrangementOnSurface2Read`
 \sa `PkgArrangementOnSurface2Write`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/IO/Arr_with_history_text_formatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/IO/Arr_with_history_text_formatter.h
index 9c02ec33400c..564b6534b349 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/IO/Arr_with_history_text_formatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/IO/Arr_with_history_text_formatter.h
@@ -15,8 +15,7 @@ the base arrangement, while the derived class is responsible for reading and
 writing the set of curves inducing the arrangement and maintaining the
 relations between these curves and the edges they induce.
 
-\cgalModels `ArrangementWithHistoryInputFormatter`
-\cgalModels `ArrangementWithHistoryOutputFormatter`
+\cgalModels{ArrangementWithHistoryInputFormatter,ArrangementWithHistoryOutputFormatter}
 
 \sa `PkgArrangementOnSurface2Read`
 \sa `PkgArrangementOnSurface2Write`
diff --git a/BGL/doc/BGL/CGAL/HalfedgeDS_face_max_base_with_id.h b/BGL/doc/BGL/CGAL/HalfedgeDS_face_max_base_with_id.h
index 5518ffb5c0c2..37c3f74bbd4b 100644
--- a/BGL/doc/BGL/CGAL/HalfedgeDS_face_max_base_with_id.h
+++ b/BGL/doc/BGL/CGAL/HalfedgeDS_face_max_base_with_id.h
@@ -19,7 +19,7 @@ running a graph algorithm.
 
 \tparam Refs must be an instantiation of a `HalfedgeDS`.
 
-\cgalModels `HalfedgeDSFace`
+\cgalModels{HalfedgeDSFace}
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/BGL/doc/BGL/CGAL/HalfedgeDS_halfedge_max_base_with_id.h b/BGL/doc/BGL/CGAL/HalfedgeDS_halfedge_max_base_with_id.h
index f57951dc82ec..e94aebb22e32 100644
--- a/BGL/doc/BGL/CGAL/HalfedgeDS_halfedge_max_base_with_id.h
+++ b/BGL/doc/BGL/CGAL/HalfedgeDS_halfedge_max_base_with_id.h
@@ -17,7 +17,7 @@ running a graph algorithm.
 
 \tparam Refs must be an instantiation of a `HalfedgeDS`.
 
-\cgalModels `HalfedgeDSHalfedge`
+\cgalModels{HalfedgeDSHalfedge}
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/BGL/doc/BGL/CGAL/HalfedgeDS_vertex_max_base_with_id.h b/BGL/doc/BGL/CGAL/HalfedgeDS_vertex_max_base_with_id.h
index 15fad92af976..ccc9f962a238 100644
--- a/BGL/doc/BGL/CGAL/HalfedgeDS_vertex_max_base_with_id.h
+++ b/BGL/doc/BGL/CGAL/HalfedgeDS_vertex_max_base_with_id.h
@@ -17,7 +17,7 @@ running a graph algorithm.
 
 \tparam Refs must be an instantiation of a `HalfedgeDS`.
 
-\cgalModels `HalfedgeDSVertex`
+\cgalModels{HalfedgeDSVertex}
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/BGL/doc/BGL/CGAL/Linear_cell_complex_bgl_min_items.h b/BGL/doc/BGL/CGAL/Linear_cell_complex_bgl_min_items.h
index 611ff3cd88b5..72ef25afe5e9 100644
--- a/BGL/doc/BGL/CGAL/Linear_cell_complex_bgl_min_items.h
+++ b/BGL/doc/BGL/CGAL/Linear_cell_complex_bgl_min_items.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 The class `Linear_cell_complex_bgl_min_items` defines `void` as the information associated with darts, darts have ids and 0- and 2-attributes are enabled and have ids.
 
-\cgalModels `LinearCellComplexItems`
+\cgalModels{LinearCellComplexItems}
 
 \cgalHeading{Example}
 
diff --git a/BGL/doc/BGL/CGAL/Polyhedron_items_with_id_3.h b/BGL/doc/BGL/CGAL/Polyhedron_items_with_id_3.h
index 7db19153e876..7c4f69185dd6 100644
--- a/BGL/doc/BGL/CGAL/Polyhedron_items_with_id_3.h
+++ b/BGL/doc/BGL/CGAL/Polyhedron_items_with_id_3.h
@@ -13,7 +13,7 @@ the point and the plane equation.
 Vertices and facets both contain a halfedge handle to an incident
 halfedge.
 
-\cgalModels `PolyhedronItems_3`
+\cgalModels{PolyhedronItems_3}
 
 \cgalHeading{Operations}
 
diff --git a/BGL/doc/BGL/CGAL/Triangulation_face_base_with_id_2.h b/BGL/doc/BGL/CGAL/Triangulation_face_base_with_id_2.h
index e6bdbbc65773..3ebf243d5f13 100644
--- a/BGL/doc/BGL/CGAL/Triangulation_face_base_with_id_2.h
+++ b/BGL/doc/BGL/CGAL/Triangulation_face_base_with_id_2.h
@@ -19,7 +19,7 @@ and must be a model of `TriangulationTraits_2`.
 `Triangulation_face_base_with_id_2` derives. It has the default
 value `Triangulation_face_base_2<TriangulationTraits_2>`.
 
-\cgalModels `TriangulationFaceBase_2`
+\cgalModels{TriangulationFaceBase_2}
 
 \sa `CGAL::Triangulation_face_base_2`
 */
diff --git a/BGL/doc/BGL/CGAL/Triangulation_vertex_base_with_id_2.h b/BGL/doc/BGL/CGAL/Triangulation_vertex_base_with_id_2.h
index d9a587610623..1f267eb5b213 100644
--- a/BGL/doc/BGL/CGAL/Triangulation_vertex_base_with_id_2.h
+++ b/BGL/doc/BGL/CGAL/Triangulation_vertex_base_with_id_2.h
@@ -19,7 +19,7 @@ and must be a model of `TriangulationTraits_2`.
 `Triangulation_vertex_base_with_id_2` derives. It has the default
 value `Triangulation_vertex_base_2<TriangulationTraits_2>`.
 
-\cgalModels `TriangulationVertexBase_2`
+\cgalModels{TriangulationVertexBase_2}
 
 \sa `CGAL::Triangulation_vertex_base_2`
 */
diff --git a/BGL/doc/BGL/CGAL/boost/graph/properties.h b/BGL/doc/BGL/CGAL/boost/graph/properties.h
index 01f6df7b62f9..57b9f10c1cbe 100644
--- a/BGL/doc/BGL/CGAL/boost/graph/properties.h
+++ b/BGL/doc/BGL/CGAL/boost/graph/properties.h
@@ -6,31 +6,31 @@ namespace CGAL {
 
 /// The constant `vertex_index` is a property tag which identifies the <i>index</i> property of a vertex of a \bgl
 /// <a href="https://www.boost.org/libs/graph/doc/Graph.html"><code>Graph</code></a>.
-/// \cgalModels <a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>
+/// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
 enum vertex_index_t { vertex_index };
 
 /// The constant `halfedge_index` is a property tag which identifies the <i>index</i> property of a halfedge of a `HalfedgeGraph`.
 ///
 /// This is a property tag introduced by \cgal.
-/// \cgalModels <a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>
+/// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
 enum halfedge_index_t { halfedge_index };
 
 /// The constant `edge_index` is a property tag which identifies the <i>index</i> property of an edge of a \bgl
 /// <a href="https://www.boost.org/libs/graph/doc/Graph.html"><code>Graph</code></a>.
-/// \cgalModels <a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>
+/// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
 enum edge_index_t { edge_index };
 
 /// The constant `face_index` is a property tag which identifies the <i>index</i> property of a face of a `FaceGraph`.
 ///
 /// This is a property tag introduced by \cgal.
-/// \cgalModels <a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>
+/// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
 enum face_index_t { face_index };
 
 /// The constant `vertex_point` is a property tag which refers to the  geometric embedding property of
 /// a vertex of a `HalfedgeGraph`.
 ///
 /// This is a property tag introduced by \cgal.
-/// \cgalModels <a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>
+/// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
 enum vertex_point_t { vertex_point };
 
 /// @}
diff --git a/BGL/include/CGAL/boost/graph/Dual.h b/BGL/include/CGAL/boost/graph/Dual.h
index 7d7481b1625d..4ca45b9bcec7 100644
--- a/BGL/include/CGAL/boost/graph/Dual.h
+++ b/BGL/include/CGAL/boost/graph/Dual.h
@@ -44,7 +44,7 @@ error.
 
 \tparam Primal_ must be a model of `FaceGraph`
 
-\cgalModels `FaceGraph`
+\cgalModels{FaceGraph}
 
 */
 template <typename Primal_>
diff --git a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
index e6f4136481d9..326a839cee61 100644
--- a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
+++ b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
@@ -66,9 +66,7 @@ namespace CGAL {
    * \tparam VIMap a model of `ReadablePropertyMap` with `graph_traits<Graph>::%vertex_descriptor` as key and `graph_traits<Graph>::%vertices_size_type` as value
    * \tparam HIMap a model of `ReadablePropertyMap` with `graph_traits<Graph>::%halfedge_descriptor` as key and `graph_traits<Graph>::%halfedges_size_type` as value
    *
-   * \cgalModels `FaceListGraph`
-   * \cgalModels `HalfedgeListGraph`
-   * \cgalModels \bgllink{VertexListGraph}
+   * \cgalModels{FaceListGraph,HalfedgeListGraph,\bgllink{VertexListGraph}}
    */
 template<typename Graph,
          typename FIMap = Default,
diff --git a/BGL/include/CGAL/boost/graph/Graph_with_descriptor_with_graph.h b/BGL/include/CGAL/boost/graph/Graph_with_descriptor_with_graph.h
index 3ab9f38e2ef5..b5d16f74d3b9 100644
--- a/BGL/include/CGAL/boost/graph/Graph_with_descriptor_with_graph.h
+++ b/BGL/include/CGAL/boost/graph/Graph_with_descriptor_with_graph.h
@@ -115,9 +115,7 @@ All internal properties of the underlying graph are forwarded.
 Property maps can be wrapped with `Graph_with_descriptor_with_graph_property_map`.
 \tparam Graph must be a model of a `FaceListGraph` and `HalfedgeListGraph`.
 
-\cgalModels `FaceListGraph`
-\cgalModels `HalfedgeListGraph`
-\cgalModels `MutableFaceGraph` if `Graph` is a model of `MutableFaceGraph`
+\cgalModels{FaceListGraph,HalfedgeListGraph,MutableFaceGraph if `Graph` is a model of `MutableFaceGraph`}
 */
 
 template<typename Graph_>
@@ -689,7 +687,7 @@ is_valid(const Graph_with_descriptor_with_graph<Graph> & w, bool verbose = false
   \ingroup PkgBGLAdaptors
     `Graph_with_descriptor_with_graph_property_map` enables to forward properties from a
      `Graph` to a `Graph_with_descriptor_with_graph`.
-    \cgalModels `Graph_with_descriptor_with_graph_property_map` the same property map concept as `PM`
+    \cgalModels{Graph_with_descriptor_with_graph_property_map the same property map concept as `PM`}
     @tparam Graph a model of the `FaceListGraph` and `HalfedgeListGraph` concepts.
     @tparam PM a property_map of a `Graph`.
 
diff --git a/BGL/include/CGAL/boost/graph/Seam_mesh.h b/BGL/include/CGAL/boost/graph/Seam_mesh.h
index 34c6e61e0a6f..2db6b170e5bd 100644
--- a/BGL/include/CGAL/boost/graph/Seam_mesh.h
+++ b/BGL/include/CGAL/boost/graph/Seam_mesh.h
@@ -185,7 +185,7 @@ class Seam_mesh_edge_descriptor
 /// a border edge (that is, such that either halfedge or the edge have null_face()
 /// as incident face). Marking a border edge as seam will not do anything.
 ///
-/// \cgalModels `FaceGraph` or `FaceListGraph`, depending on the underlying mesh `TM`.
+/// \cgalModels{FaceGraph or `FaceListGraph` depending on the underlying mesh `TM`.}
 ///
 /// \tparam TM a model of `FaceGraph` or `FaceListGraph`
 /// \tparam SEM a model of `ReadablePropertyMap` with `boost::graph_traits<TM>::%edge_descriptor` as key type and `bool` as value type.
@@ -271,9 +271,7 @@ class Seam_mesh
   /// Implementation note: a halfedge of the seam mesh is represented as a halfedge
   /// of the mesh and a boolean to indicate whether the halfedge is on a seam or not.
   ///
-  /// \cgalModels `Descriptor`
-  /// \cgalModels `LessThanComparable`
-  /// \cgalModels `Hashable`
+  /// \cgalModels{Descriptor,LessThanComparable,Hashable}
   ///
   class halfedge_descriptor
   {
@@ -356,9 +354,7 @@ class Seam_mesh
   /// Implementation note: to properly duplicate vertices that are on seams,
   /// a vertex_descriptor is in fact represented as a halfedge of the seam mesh.
   ///
-  /// \cgalModels `Descriptor`
-  /// \cgalModels `LessThanComparable`
-  /// \cgalModels `Hashable`
+  /// \cgalModels{Descriptor,LessThanComparable,Hashable}
   ///
   class vertex_descriptor
   {
@@ -461,8 +457,7 @@ class Seam_mesh
 #ifdef DOXYGEN_RUNNING
   /// This class represents an edge of the seam mesh.
   ///
-  /// \cgalModels `Descriptor`
-  /// \cgalModels `Hashable`
+  /// \cgalModels{Descriptor,Hashable}
   ///
   class edge_descriptor
   {
@@ -562,7 +557,7 @@ class Seam_mesh
 
   /// This class represents a face of the seam mesh.
   ///
-  /// \cgalModels `Descriptor`
+  /// \cgalModels{Descriptor}
   ///
   typedef typename boost::graph_traits<TM>::face_descriptor     face_descriptor;
 
diff --git a/BGL/include/CGAL/boost/graph/iterator.h b/BGL/include/CGAL/boost/graph/iterator.h
index 87ff3383f21b..54b54c08ecbc 100644
--- a/BGL/include/CGAL/boost/graph/iterator.h
+++ b/BGL/include/CGAL/boost/graph/iterator.h
@@ -182,7 +182,7 @@ struct Opposite_face {
  * Let `h` be a halfedge of graph `g`. For a `Halfedge_around_source_iterator` `havi` with `h = *havi;`
  * the following holds: Either `++havi` is the past the end iterator, or `next(opposite(h,g),g) == *++havi`.
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalIterator`
+ * \cgalModels{BidirectionalIterator}
  */
 template <typename Graph>
 class Halfedge_around_source_iterator {
@@ -274,7 +274,7 @@ class Halfedge_around_source_iterator {
  * Let `h` be a halfedge of graph `g`. For a `Halfedge_around_target_iterator` `havi` with `h = *havi;`
  * the following holds: Either `++havi` is the past the end iterator, or `opposite(next(h,g),g) == *++havi`.
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalIterator`
+ * \cgalModels{BidirectionalIterator}
  */
 
 template <typename Graph>
@@ -369,7 +369,7 @@ class Halfedge_around_target_iterator {
  * Let `h` be a halfedge of graph `g`. For a `Halfedge_around_face_iterator` `hafi` with  `h = *hafi`
  * the following holds: Either `++hafi` is the past the end iterator, or `next(h,g) == *++hafi`.
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalIterator`
+ * \cgalModels{BidirectionalIterator}
  */
 
 template <typename Graph>
@@ -465,7 +465,7 @@ class Halfedge_around_target_circulator;
  * Let `h` be a halfedge of graph `g`. For a `Halfedge_around_source_circulator` `havc` with `h = *havc;`
  * the following holds: `next(opposite(h,g),g) == *++havc`.
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalCirculator`
+ * \cgalModels{BidirectionalCirculator}
  */
 template <typename Graph>
 class Halfedge_around_source_circulator
@@ -531,7 +531,7 @@ class Halfedge_around_source_circulator
  * It circulates over the same halfedges as the `Halfedge_around_target_circulator`.
  *
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalCirculator`
+ * \cgalModels{BidirectionalCirculator}
  */
 
 template <typename Graph>
@@ -590,7 +590,7 @@ class Face_around_target_circulator
  * Let `h` be a halfedge of graph `g`. For a `Halfedge_around_target_circulator` `havc` with `h = *havc;`
  * the following holds: `opposite(next(h,g),g) == *++havc`.
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalCirculator`
+ * \cgalModels{BidirectionalCirculator}
  */
 
 
@@ -692,7 +692,7 @@ class Halfedge_around_target_circulator {
  * Let `h` be a halfedge of graph `g`. For a `Halfedge_around_face_circulator` `hafc` with  `h = *hafc`
  * the following holds:  `next(h,g) == *++hafc`.
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalCirculator`
+ * \cgalModels{BidirectionalCirculator}
  */
 
 template <typename Graph>
@@ -844,7 +844,7 @@ halfedges_around_face(typename boost::graph_traits<Graph>::halfedge_descriptor h
  * may be the null face, and it may be several times the same face descriptor.
  *
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalCirculator`
+ * \cgalModels{BidirectionalCirculator}
  */
 template <typename Graph>
 class Face_around_face_iterator
@@ -882,7 +882,7 @@ class Face_around_face_iterator
  * may be the null face, and it may be several times the same face descriptor.
  *
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalCirculator`
+ * \cgalModels{BidirectionalCirculator}
  */
 template <typename Graph>
 class Face_around_face_circulator
@@ -896,7 +896,7 @@ class Face_around_face_circulator
  * may be the null face, and it may be several times the same face descriptor.
  *
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalIterator`
+ * \cgalModels{BidirectionalIterator}
  */
 template <typename Graph>
 class Face_around_target_iterator
@@ -956,7 +956,7 @@ faces_around_face(typename boost::graph_traits<Graph>::halfedge_descriptor h, co
  * \ingroup PkgBGLIterators
  * A bidirectional circulator with value type `boost::graph_traits<Graph>::%vertex_descriptor` over all vertices incident to the same face or border.
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalIterator`
+ * \cgalModels{BidirectionalIterator}
  */
 template <typename Graph>
 class Vertex_around_face_circulator
@@ -1013,7 +1013,7 @@ class Vertex_around_face_circulator
  * A bidirectional iterator  with value type `boost::graph_traits<Graph>::%vertex_descriptor`
  *  over all vertices incident to the same face or border.
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalIterator`
+ * \cgalModels{BidirectionalIterator}
  */
 template <typename Graph>
 class Vertex_around_face_iterator
@@ -1135,7 +1135,7 @@ edges_around_face(typename boost::graph_traits<Graph>::halfedge_descriptor h, co
  * It circulates over the same halfedges as the `Halfedge_around_target_circulator`.
  *
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalCirculator`
+ * \cgalModels{BidirectionalCirculator}
  */
 template <typename Graph>
 class Vertex_around_target_circulator
@@ -1194,7 +1194,7 @@ class Vertex_around_target_circulator
  * It iterates over the same halfedges as the `Halfedge_around_target_iterator`.
  *
  * \tparam Graph must be a model of the concept `HalfedgeGraph`
- * \cgalModels `BidirectionalIterator`
+ * \cgalModels{BidirectionalIterator}
  */
 template <typename Graph>
 class Vertex_around_target_iterator
diff --git a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Delaunay_domain_2.h b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Delaunay_domain_2.h
index bb66bd3d577c..fe24383aa534 100644
--- a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Delaunay_domain_2.h
+++ b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Delaunay_domain_2.h
@@ -51,7 +51,7 @@ namespace Barycentric_coordinates {
     a model of `ReadablePropertyMap` whose key type is `VertexRange::value_type` and
     value type is `Point_2`. The default is `CGAL::Identity_property_map`.
 
-    \cgalModels `DiscretizedDomain_2`
+    \cgalModels{DiscretizedDomain_2}
   */
   template<
   typename VertexRange,
diff --git a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Discrete_harmonic_2.h b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Discrete_harmonic_2.h
index 91d96c2f1c40..392a7d38b909 100644
--- a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Discrete_harmonic_2.h
+++ b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Discrete_harmonic_2.h
@@ -48,7 +48,7 @@ namespace Barycentric_coordinates {
 
 \tparam Traits must be a model of the concepts `BarycentricTraits_2` and `PolygonTraits_2`.
 
-\cgalModels `BarycentricCoordinates_2`
+\cgalModels{BarycentricCoordinates_2}
 
 \pre The provided polygon is strictly convex.
 
diff --git a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Mean_value_2.h b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Mean_value_2.h
index ef895698b0ae..f61c6be8bdd9 100644
--- a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Mean_value_2.h
+++ b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Mean_value_2.h
@@ -100,7 +100,7 @@ template<class Traits>
 
 \tparam Traits must be a model of the concept `BarycentricTraits_2`.
 
-\cgalModels `BarycentricCoordinates_2`
+\cgalModels{BarycentricCoordinates_2}
 
 */
 template<class Traits>
diff --git a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Wachspress_2.h b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Wachspress_2.h
index 469b84a09a30..221ed7ad21be 100644
--- a/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Wachspress_2.h
+++ b/Barycentric_coordinates_2/include/CGAL/Barycentric_coordinates_2/Wachspress_2.h
@@ -48,7 +48,7 @@ namespace Barycentric_coordinates {
 
 \tparam Traits must be a model of the concepts `BarycentricTraits_2` and `PolygonTraits_2`.
 
-\cgalModels `BarycentricCoordinates_2`
+\cgalModels{BarycentricCoordinates_2}
 
 \pre The provided polygon is strictly convex.
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Boolean_set_operations_2/Gps_default_dcel.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Boolean_set_operations_2/Gps_default_dcel.h
index 64158347a425..9aed558f9247 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Boolean_set_operations_2/Gps_default_dcel.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Boolean_set_operations_2/Gps_default_dcel.h
@@ -15,7 +15,7 @@ You need to extend this template with auxiliary data only if you intend to
 obtain the underlying arrangement of the general polygon set and process it
 further.
 
-\cgalModels `GeneralPolygonSetDcelFace`
+\cgalModels{GeneralPolygonSetDcelFace}
 
 \sa `Arr_face_base`
 */
@@ -35,7 +35,7 @@ You need to extend this template with auxiliary data only if you intend to
 obtain the underlying arrangement of the general polygon set and process it
 further.
 
-\cgalModels `GeneralPolygonSetDcelHalfedge`
+\cgalModels{GeneralPolygonSetDcelHalfedge}
 
 \sa `Arr_halfedge_base<X_monotone_curve_2>`
 */
@@ -62,7 +62,7 @@ You need to override this default and use a different
 \dcel only if you intend to obtain the underlying
 arrangement of the general polygon set and process it further.
 
-\cgalModels `GeneralPolygonSetDcel`
+\cgalModels{GeneralPolygonSetDcel}
 
 \sa `Arr_dcel_base<V,H,F>`
 \sa `Gps_halfedge_base<X_monotone_curve_2>`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/General_polygon_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/General_polygon_2.h
index 636853b0ed91..c5c628cc757b 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/General_polygon_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/General_polygon_2.h
@@ -20,7 +20,7 @@ support the following functions:
 This class supports a few convenient operations in addition to the
 requirements that the concept `GeneralPolygon_2` lists.
 
-\cgalModels `GeneralPolygon_2`
+\cgalModels{GeneralPolygon_2}
 
 */
 template< typename ArrTraits >
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_circle_segment_traits_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_circle_segment_traits_2.h
index c93ff9e02752..c2b0b4b0e6d8 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_circle_segment_traits_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_circle_segment_traits_2.h
@@ -9,7 +9,7 @@ concept. It enables Boolean set-operations on general polygons bounded by
 linear segments or circular arcs.
 It should be parameterized with a kernel.
 
-\cgalModels `GeneralPolygonSetTraits_2`
+\cgalModels{GeneralPolygonSetTraits_2}
 
 \sa `CGAL::Arr_circle_segment_traits_2<Kernel>`
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_segment_traits_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_segment_traits_2.h
index dbe5f325b011..7dd12f6f1075 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_segment_traits_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_segment_traits_2.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgBooleanSetOperations2Ref
 
-\cgalModels `GeneralPolygonSetTraits_2`
+\cgalModels{GeneralPolygonSetTraits_2}
 
 \sa `CGAL::Arr_segment_traits_2<Kernel>`
 
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_traits_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_traits_2.h
index 050bada2dece..6d65a9e5e430 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_traits_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/Gps_traits_2.h
@@ -13,7 +13,7 @@ the concept `ArrangementXMonotoneTraits_2`). The template parameter
 of `GpsTraitsGeneralPolygon_2`. By default, the latter is instantiated by
 `CGAL::General_polygon_2<ArrTraits>`.
 
-\cgalModels `GeneralPolygonSetTraits_2`
+\cgalModels{GeneralPolygonSetTraits_2}
 
 */
 template< typename ArrTraits, typename GeneralPolygon_t >
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_2.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_2.h
index a83c5184807b..afecb15c8dc9 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_2.h
@@ -18,7 +18,7 @@ exact computations.
 `CGAL::Tag_true`. (Examples of such a
 number-type are `MP_Float`, `CORE::Expr`, and `Gmpq`.)
 
-\cgalModels `ApproximateMinEllipsoid_d_Traits_d`
+\cgalModels{ApproximateMinEllipsoid_d_Traits_d}
 
 \sa `CGAL::Approximate_min_ellipsoid_d_traits_3<K,ET>`
 \sa `CGAL::Approximate_min_ellipsoid_d_traits_d<K,ET>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_3.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_3.h
index ce851ee9f458..b980e60bf1e9 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_3.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_3.h
@@ -19,7 +19,7 @@ exact computations.
 `Tag_true`  (Examples of such a
 number-type are `MP_Float`, `CORE::Expr`, and `Gmpq`.)
 
-\cgalModels `ApproximateMinEllipsoid_d_Traits_d`
+\cgalModels{ApproximateMinEllipsoid_d_Traits_d}
 
 \sa `CGAL::Approximate_min_ellipsoid_d_traits_2<K,ET>`
 \sa `CGAL::Approximate_min_ellipsoid_d_traits_d<K,ET>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_d.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_d.h
index 44caa851a38d..1c655e7f242f 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d_traits_d.h
@@ -18,7 +18,7 @@ exact computations.
 `CGAL::Tag_true` (Examples of such a
 number-type are `MP_Float`, `CORE::Expr`, and `Gmpq`.)
 
-\cgalModels `ApproximateMinEllipsoid_d_Traits_d`
+\cgalModels{ApproximateMinEllipsoid_d_Traits_d}
 
 \sa `CGAL::Approximate_min_ellipsoid_d_traits_2<K,ET>`
 \sa `CGAL::Approximate_min_ellipsoid_d_traits_3<K,ET>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_circle_2_traits_2.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_circle_2_traits_2.h
index 466674a71de2..66560c136546 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_circle_2_traits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_circle_2_traits_2.h
@@ -9,7 +9,7 @@ using the two-dimensional \cgal kernel.
 
 \tparam K must be a model for `Kernel`.
 
-\cgalModels `MinCircle2Traits`
+\cgalModels{MinCircle2Traits}
 
 \sa `CGAL::Min_circle_2<Traits>`
 \sa `MinCircle2Traits`
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_ellipse_2_traits_2.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_ellipse_2_traits_2.h
index 25b54759c1a2..ab207e354fb9 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_ellipse_2_traits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_ellipse_2_traits_2.h
@@ -9,7 +9,7 @@ using the two-dimensional \cgal kernel.
 
 The template parameter `K` must be a model for `Kernel`.
 
-\cgalModels `MinEllipse2Traits`
+\cgalModels{MinEllipse2Traits}
 
 \sa `CGAL::Min_ellipse_2<Traits>`
 \sa `MinEllipse2Traits`
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_quadrilateral_traits_2.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_quadrilateral_traits_2.h
index f44fcbe475ed..7357ae30f294 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_quadrilateral_traits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_quadrilateral_traits_2.h
@@ -10,7 +10,7 @@ functions `min_rectangle_2()`, `min_parallelogram_2()` and
 
 \tparam K must be a model for `Kernel`.
 
-\cgalModels `MinQuadrilateralTraits_2`
+\cgalModels{MinQuadrilateralTraits_2}
 
 \sa `CGAL::min_rectangle_2()`
 \sa `CGAL::min_parallelogram_2()`
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_2.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_2.h
index 3273105434a2..d3c56d3b0956 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_2.h
@@ -10,7 +10,7 @@ optimisation algorithms using the two-dimensional \cgal kernel.
 \tparam K  must bea model for `Kernel`.
 \tparam ET NT are models for `RingNumberType`. Their default type is `K::RT`.
 
-\cgalModels `MinSphereAnnulusDTraits`
+\cgalModels{MinSphereAnnulusDTraits}
 
 \sa `CGAL::Min_sphere_d<Traits>`
 \sa `CGAL::Min_annulus_d<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_3.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_3.h
index 32f770b0703b..84284beefc55 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_3.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_3.h
@@ -10,7 +10,7 @@ optimisation algorithms using the three-dimensional \cgal kernel.
 \tparam K must be a model for `Kernel`.
 \tparam ET NT are models for `RingNumberType`. Their default type is `K::RT`.
 
-\cgalModels `MinSphereAnnulusDTraits`
+\cgalModels{MinSphereAnnulusDTraits}
 
 \sa `CGAL::Min_sphere_d<Traits>`
 \sa `CGAL::Min_annulus_d<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_d.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_d.h
index 198967340a53..f2bc035794b9 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_annulus_d_traits_d.h
@@ -10,7 +10,7 @@ optimisation algorithms using the \f$ d\f$-dimensional \cgal kernel.
 \tparam K must be a model for `Kernel`.
 \tparam ET NT are models for `RingNumberType`. Their default type is `K::RT`.
 
-\cgalModels `MinSphereAnnulusDTraits`
+\cgalModels{MinSphereAnnulusDTraits}
 
 \sa `CGAL::Min_sphere_d<Traits>`
 \sa `CGAL::Min_annulus_d<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_2.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_2.h
index 58a514025cfd..c50875cb3c10 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_2.h
@@ -8,7 +8,7 @@ The class
 model for concept `MinSphereOfSpheresTraits`. It uses the \cgal
 type `Point_2` to represent circles.
 
-\cgalModels `MinSphereOfSpheresTraits`
+\cgalModels{MinSphereOfSpheresTraits}
 
 
 
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_3.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_3.h
index f54cfe542045..d6fc8ff305d3 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_3.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_3.h
@@ -8,7 +8,7 @@ The class
 model for concept `MinSphereOfSpheresTraits`. It uses the \cgal
 type `Point_3` to represent spheres.
 
-\cgalModels `MinSphereOfSpheresTraits`
+\cgalModels{MinSphereOfSpheresTraits}
 
 
 
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_d.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_d.h
index 1e0838c0e6a7..a4843602cbb2 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_points_d_traits_d.h
@@ -8,7 +8,7 @@ The class
 a model for concept `MinSphereOfSpheresTraits`. It uses the
 \cgal type `Point_d` to represent circles.
 
-\cgalModels `MinSphereOfSpheresTraits`
+\cgalModels{MinSphereOfSpheresTraits}
 
 
 \tparam K is a model for `Kernel`.
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_2.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_2.h
index 36f9721ad0d2..fa1761c75313 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_2.h
@@ -8,7 +8,7 @@ The class
 model for concept `MinSphereOfSpheresTraits`. It uses a pair of \cgal
 `Point_2` and `FT` to represent circles.
 
-\cgalModels `MinSphereOfSpheresTraits`
+\cgalModels{MinSphereOfSpheresTraits}
 
 
 The last two template parameters, `UseSqrt` and `Algorithm`, have
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_3.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_3.h
index 71786791402e..cf98855e846d 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_3.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_3.h
@@ -8,7 +8,7 @@ The class
 model for concept `MinSphereOfSpheresTraits`. It uses a pair of \cgal
 `Point_3` and `FT` to represent spheres.
 
-\cgalModels `MinSphereOfSpheresTraits`
+\cgalModels{MinSphereOfSpheresTraits}
 
 
 \tparam K must be a model for `Kernel`.
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_d.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_d.h
index 96e0b6f7ecb6..ad8fdf4f1fbf 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d_traits_d.h
@@ -8,7 +8,7 @@ The class
 a model for concept `MinSphereOfSpheresTraits`. It uses the
 \cgal type `Point_d` to represent circles.
 
-\cgalModels `MinSphereOfSpheresTraits`
+\cgalModels{MinSphereOfSpheresTraits}
 
 
 \tparam K is a model for `Kernel`.
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/rectangular_p_center_2.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/rectangular_p_center_2.h
index f3baaa625f13..1f6b388ee710 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/rectangular_p_center_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/rectangular_p_center_2.h
@@ -10,7 +10,7 @@ using the function `rectangular_p_center_2()`.
 
 \tparam K must be a model for `Kernel`.
 
-\cgalModels `RectangularPCenterTraits_2`
+\cgalModels{RectangularPCenterTraits_2}
 
 \sa `CGAL::rectangular_p_center_2()`
 
diff --git a/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_d.h b/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_d.h
index 6c4b4dd6819c..ea73e62242e0 100644
--- a/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_d.h
@@ -40,7 +40,7 @@ creates copies of the boxes that would not have identical
 `id`-numbers.
 </UL>
 
-\cgalModels `BoxIntersectionBox_d`
+\cgalModels{BoxIntersectionBox_d}
 
 \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
 \sa \link PkgBoxIntersectionD_box_self_intersection_d `CGAL::box_self_intersection_d()` \endlink
diff --git a/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_traits_d.h b/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_traits_d.h
index 49823cfe609d..a3731b377d46 100644
--- a/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_traits_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_traits_d.h
@@ -20,7 +20,7 @@ cases it just uses the pointer type.
                   const-pointer `const B*`, where `B` is a model of the
                   `BoxIntersectionBox_d` concept.
 
-\cgalModels `BoxIntersectionTraits_d`
+\cgalModels{BoxIntersectionTraits_d}
 
 \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
 \sa \link PkgBoxIntersectionD_box_self_intersection_d `CGAL::box_self_intersection_d()` \endlink
diff --git a/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_with_handle_d.h b/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_with_handle_d.h
index 32f04c82c383..7ceb1b14348e 100644
--- a/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_with_handle_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_with_handle_d.h
@@ -52,7 +52,7 @@ the safe default implementation.
     available for the `CGAL::Box_intersection_d::Box_d` type
     that does not store a handle.
 
-\cgalModels `BoxIntersectionBox_d`
+\cgalModels{BoxIntersectionBox_d}
 
 \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
 \sa \link PkgBoxIntersectionD_box_self_intersection_d `CGAL::box_self_intersection_d()` \endlink
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Algebraic_kernel_for_circles_2_2.h b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Algebraic_kernel_for_circles_2_2.h
index 86598adf69d9..d9e36e19f518 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Algebraic_kernel_for_circles_2_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Algebraic_kernel_for_circles_2_2.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel2AlgebraicClasses
 
-\cgalModels `AlgebraicKernelForCircles`
+\cgalModels{AlgebraicKernelForCircles}
 
 */
 template< typename RT >
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_arc_2.h b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_arc_2.h
index 546ac0080557..684ac669ce5e 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_arc_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_arc_2.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel2GeometricClasses
 
-\cgalModels `CircularKernel::CircularArc_2`
+\cgalModels{CircularKernel::CircularArc_2}
 
 \sa `CGAL::Circular_arc_point_2<CircularKernel>`
 \sa `CGAL::Line_arc_2<CircularKernel>`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_arc_point_2.h b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_arc_point_2.h
index cb8325f4e928..052216f2a8c9 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_arc_point_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_arc_point_2.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel2GeometricClasses
 
-\cgalModels `CircularKernel::CircularArcPoint_2`
+\cgalModels{CircularKernel::CircularArcPoint_2}
 
 \sa `CGAL::Circular_arc_2<CircularKernel>`
 \sa `CGAL::Line_arc_2<CircularKernel>`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_kernel_2.h b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_kernel_2.h
index 65401ed2778a..b0ddfe1ca784 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_kernel_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Circular_kernel_2.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel2GeometricClasses
 
-\cgalModels `CircularKernel`
+\cgalModels{CircularKernel}
 
 \cgalHeading{Parameters}
 
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Exact_circular_kernel_2.h b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Exact_circular_kernel_2.h
index 46ff1b15b481..6347918a36d0 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Exact_circular_kernel_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Exact_circular_kernel_2.h
@@ -8,7 +8,7 @@ A typedef to a circular kernel that provides both exact geometric
 predicates and exact geometric constructions. This kernel uses some
 geometric filtering (based on bounding boxes) to gain efficiency.
 
-\cgalModels `CircularKernel`
+\cgalModels{CircularKernel}
 
 \sa `CGAL::Circular_kernel_2<Kernel,AlgebraicKernelForCircles>`
 
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Line_arc_2.h b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Line_arc_2.h
index c8e2fca1e771..53b3a7b34e5a 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Line_arc_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Line_arc_2.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel2GeometricClasses
 
-\cgalModels `CircularKernel::LineArc_2`
+\cgalModels{CircularKernel::LineArc_2}
 
 \cgalHeading{I/O}
 
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Polynomials_1_2.h b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Polynomials_1_2.h
index c7a3fb71072d..3c0865a74289 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Polynomials_1_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Polynomials_1_2.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel2AlgebraicClasses
 
-\cgalModels `AlgebraicKernelForCircles::Polynomial_1_2`
+\cgalModels{AlgebraicKernelForCircles::Polynomial_1_2}
 
 */
 template< typename RT >
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Polynomials_2_2.h b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Polynomials_2_2.h
index 80ff654207e8..c287ffd4ed30 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Polynomials_2_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Polynomials_2_2.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel2AlgebraicClasses
 
-\cgalModels `AlgebraicKernelForCircles::PolynomialForCircles_2_2`
+\cgalModels{AlgebraicKernelForCircles::PolynomialForCircles_2_2}
 
 \sa `CGAL::Sqrt_extension<NT,ROOT>`
 \sa `AlgebraicKernelForCircles`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Root_for_circles_2_2.h b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Root_for_circles_2_2.h
index db7c4ed3a6ad..f0a49daf7771 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Root_for_circles_2_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/CGAL/Root_for_circles_2_2.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel2AlgebraicClasses
 
-\cgalModels `AlgebraicKernelForCircles::RootForCircles_2_2`
+\cgalModels{AlgebraicKernelForCircles::RootForCircles_2_2}
 
 */
 template< typename FT >
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Algebraic_kernel_for_spheres_2_3.h b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Algebraic_kernel_for_spheres_2_3.h
index db2aec890a4b..b54b34522ea5 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Algebraic_kernel_for_spheres_2_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Algebraic_kernel_for_spheres_2_3.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel3AlgebraicClasses
 
-\cgalModels `AlgebraicKernelForSpheres`
+\cgalModels{AlgebraicKernelForSpheres}
 
 */
 template< typename RT >
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Circular_arc_3.h b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Circular_arc_3.h
index 6accd5fdda72..018a713b6c4e 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Circular_arc_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Circular_arc_3.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel3GeometricClasses
 
-\cgalModels `SphericalKernel::CircularArc_3`
+\cgalModels{SphericalKernel::CircularArc_3}
 
 \cgalHeading{I/O}
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Circular_arc_point_3.h b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Circular_arc_point_3.h
index 637452fe2017..bfc56e02fe71 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Circular_arc_point_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Circular_arc_point_3.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel3GeometricClasses
 
-\cgalModels `SphericalKernel::CircularArcPoint_3`
+\cgalModels{SphericalKernel::CircularArcPoint_3}
 
 \sa `CGAL::Circular_arc_3<SphericalKernel>`
 \sa `CGAL::Line_arc_3<SphericalKernel>`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Exact_spherical_kernel_3.h b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Exact_spherical_kernel_3.h
index c92182af28b1..a33f4c72cfc5 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Exact_spherical_kernel_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Exact_spherical_kernel_3.h
@@ -9,7 +9,7 @@ both exact geometric predicates and exact geometric constructions.
 
 It defines the same types as `CGAL::Spherical_kernel_3`.
 
-\cgalModels `SphericalKernel`
+\cgalModels{SphericalKernel}
 
 */
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Line_arc_3.h b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Line_arc_3.h
index 7cc639959de9..744b2e5a0247 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Line_arc_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Line_arc_3.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel3GeometricClasses
 
-\cgalModels `SphericalKernel::LineArc_3`
+\cgalModels{SphericalKernel::LineArc_3}
 
 \sa `CGAL::Circular_arc_point_3<SphericalKernel>`
 \sa `CGAL::Circular_arc_3<SphericalKernel>`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_1_3.h b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_1_3.h
index df3532cedfc5..715108154ad1 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_1_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_1_3.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel3AlgebraicClasses
 
-\cgalModels `AlgebraicKernelForSpheres::Polynomial_1_3`
+\cgalModels{AlgebraicKernelForSpheres::Polynomial_1_3}
 
 */
 template< typename RT >
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_2_3.h b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_2_3.h
index 6084f63779df..ee510c4d1ebb 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_2_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_2_3.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel3AlgebraicClasses
 
-\cgalModels `AlgebraicKernelForSpheres::PolynomialForSpheres_2_3`
+\cgalModels{AlgebraicKernelForSpheres::PolynomialForSpheres_2_3}
 
 \sa `AlgebraicKernelForSpheres`
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_for_line_3.h b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_for_line_3.h
index 9c51a9e834a9..2081dee35d2d 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_for_line_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Polynomials_for_line_3.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel3AlgebraicClasses
 
-\cgalModels `AlgebraicKernelForSpheres::PolynomialsForLines_3`
+\cgalModels{AlgebraicKernelForSpheres::PolynomialsForLines_3}
 
 \sa `AlgebraicKernelForSpheres`
 
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Root_for_spheres_2_3.h b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Root_for_spheres_2_3.h
index 0590e3e0c3dc..0c46aab5c9a8 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Root_for_spheres_2_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Root_for_spheres_2_3.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel3AlgebraicClasses
 
-\cgalModels `AlgebraicKernelForSpheres::RootForSpheres_2_3`
+\cgalModels{AlgebraicKernelForSpheres::RootForSpheres_2_3}
 
 */
 template< typename RT >
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Spherical_kernel_3.h b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Spherical_kernel_3.h
index 5c4212c32d5a..cf225ac32606 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Spherical_kernel_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/CGAL/Spherical_kernel_3.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgCircularKernel3GeometricClasses
 
-\cgalModels `SphericalKernel`
+\cgalModels{SphericalKernel}
 
 \cgalHeading{Parameters}
 
diff --git a/Classification/include/CGAL/Classification/ETHZ/Random_forest_classifier.h b/Classification/include/CGAL/Classification/ETHZ/Random_forest_classifier.h
index fbf3b43a4bcf..29c46fef711d 100644
--- a/Classification/include/CGAL/Classification/ETHZ/Random_forest_classifier.h
+++ b/Classification/include/CGAL/Classification/ETHZ/Random_forest_classifier.h
@@ -63,7 +63,7 @@ namespace ETHZ {
 
   \note This classifier is distributed under the MIT license.
 
-  \cgalModels `CGAL::Classification::Classifier`
+  \cgalModels{CGAL::Classification::Classifier}
 */
 class Random_forest_classifier
 {
diff --git a/Classification/include/CGAL/Classification/Feature_base.h b/Classification/include/CGAL/Classification/Feature_base.h
index 89ba6e603841..b73dd7154f72 100644
--- a/Classification/include/CGAL/Classification/Feature_base.h
+++ b/Classification/include/CGAL/Classification/Feature_base.h
@@ -68,7 +68,7 @@ class Feature_base
 
   \brief %Handle to a `Feature_base`.
 
-  \cgalModels Handle
+  \cgalModels{Handle}
 */
 class Feature_handle { };
 #else
diff --git a/Classification/include/CGAL/Classification/Label.h b/Classification/include/CGAL/Classification/Label.h
index 7801942afcb3..ba0b4c38f632 100644
--- a/Classification/include/CGAL/Classification/Label.h
+++ b/Classification/include/CGAL/Classification/Label.h
@@ -105,7 +105,7 @@ class Label
 
   \brief %Handle to a classification `Label`.
 
-  \cgalModels Handle
+  \cgalModels{Handle}
 */
 class Label_handle { };
 #else
diff --git a/Classification/include/CGAL/Classification/Mesh_neighborhood.h b/Classification/include/CGAL/Classification/Mesh_neighborhood.h
index 6a00a4138207..bad561d6c0fd 100644
--- a/Classification/include/CGAL/Classification/Mesh_neighborhood.h
+++ b/Classification/include/CGAL/Classification/Mesh_neighborhood.h
@@ -77,7 +77,7 @@ class Mesh_neighborhood
   /*!
     Functor that computes the 1-ring neighborhood of the face of an input mesh.
 
-    \cgalModels CGAL::Classification::NeighborQuery
+    \cgalModels{CGAL::Classification::NeighborQuery}
 
     \sa Mesh_neighborhood
   */
@@ -110,7 +110,7 @@ class Mesh_neighborhood
   /*!
     Functor that computes the N-ring neighborhood of the face of an input mesh.
 
-    \cgalModels CGAL::Classification::NeighborQuery
+    \cgalModels{CGAL::Classification::NeighborQuery}
 
     \sa Mesh_neighborhood
   */
diff --git a/Classification/include/CGAL/Classification/OpenCV/Random_forest_classifier.h b/Classification/include/CGAL/Classification/OpenCV/Random_forest_classifier.h
index 6e7d5e1f1d0f..b7105279a921 100644
--- a/Classification/include/CGAL/Classification/OpenCV/Random_forest_classifier.h
+++ b/Classification/include/CGAL/Classification/OpenCV/Random_forest_classifier.h
@@ -47,7 +47,7 @@ namespace OpenCV {
 
   \note This class requires the \ref thirdpartyOpenCV library.
 
-  \cgalModels `CGAL::Classification::Classifier`
+  \cgalModels{CGAL::Classification::Classifier}
 */
 class Random_forest_classifier
 {
diff --git a/Classification/include/CGAL/Classification/Point_set_neighborhood.h b/Classification/include/CGAL/Classification/Point_set_neighborhood.h
index 156bd68d1cbb..c27c874f0c23 100644
--- a/Classification/include/CGAL/Classification/Point_set_neighborhood.h
+++ b/Classification/include/CGAL/Classification/Point_set_neighborhood.h
@@ -96,7 +96,7 @@ class Point_set_neighborhood
     Functor that computes the neighborhood of an input point with a
     fixed number of neighbors.
 
-    \cgalModels CGAL::Classification::NeighborQuery
+    \cgalModels{CGAL::Classification::NeighborQuery}
 
     \sa Point_set_neighborhood
   */
@@ -131,7 +131,7 @@ class Point_set_neighborhood
     as the points lying in a sphere of fixed radius centered at the
     input point.
 
-    \cgalModels CGAL::Classification::NeighborQuery
+    \cgalModels{CGAL::Classification::NeighborQuery}
 
     \sa Point_set_neighborhood
   */
diff --git a/Classification/include/CGAL/Classification/Sum_of_weighted_features_classifier.h b/Classification/include/CGAL/Classification/Sum_of_weighted_features_classifier.h
index 7f16459723ad..fac51686e142 100644
--- a/Classification/include/CGAL/Classification/Sum_of_weighted_features_classifier.h
+++ b/Classification/include/CGAL/Classification/Sum_of_weighted_features_classifier.h
@@ -48,7 +48,7 @@ namespace Classification {
   \brief %Classifier based on the sum of weighted features with
   user-defined effects on labels.
 
-  \cgalModels `CGAL::Classification::Classifier`
+  \cgalModels{CGAL::Classification::Classifier}
 */
 class Sum_of_weighted_features_classifier
 {
diff --git a/Classification/include/CGAL/Classification/property_maps.h b/Classification/include/CGAL/Classification/property_maps.h
index 44a0a75f0c01..f03e837d8067 100644
--- a/Classification/include/CGAL/Classification/property_maps.h
+++ b/Classification/include/CGAL/Classification/property_maps.h
@@ -32,7 +32,7 @@ namespace Classification
   \brief Property map that constructs the center of mass of the face
   of a mesh on-the-fly.
 
-  \cgalModels `ReadablePropertyMap`
+  \cgalModels{ReadablePropertyMap}
 
   \tparam FaceGraph model of `FaceGraph`.
 
@@ -85,7 +85,7 @@ class Face_descriptor_to_center_of_mass_map
   \brief Property map that constructs a face descriptor with a
   `bbox()` method from a face descriptor.
 
-  \cgalModels `ReadablePropertyMap`
+  \cgalModels{ReadablePropertyMap}
 
   \tparam FaceGraph model of `FaceGraph`.
 
diff --git a/Combinatorial_map/doc/Combinatorial_map/CGAL/Cell_attribute.h b/Combinatorial_map/doc/Combinatorial_map/CGAL/Cell_attribute.h
index 3256326a53c2..60846dd21975 100644
--- a/Combinatorial_map/doc/Combinatorial_map/CGAL/Cell_attribute.h
+++ b/Combinatorial_map/doc/Combinatorial_map/CGAL/Cell_attribute.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 The class `Cell_attribute` represents an attribute containing (or not) an information.
 
-\cgalModels `CellAttribute`
+\cgalModels{CellAttribute}
 
 \tparam Map a model of the `GenericMap` concept.
 
diff --git a/Combinatorial_map/doc/Combinatorial_map/CGAL/Cell_attribute_with_id.h b/Combinatorial_map/doc/Combinatorial_map/CGAL/Cell_attribute_with_id.h
index a99045fbeedf..3733c29241c0 100644
--- a/Combinatorial_map/doc/Combinatorial_map/CGAL/Cell_attribute_with_id.h
+++ b/Combinatorial_map/doc/Combinatorial_map/CGAL/Cell_attribute_with_id.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 The class `Cell_attribute_with_id` represents an attribute containing (or not) an information, and having an id.
 
-\cgalModels `CellAttribute`
+\cgalModels{CellAttribute}
 
 \tparam Map a model of the `GenericMap` concept.
 
diff --git a/Combinatorial_map/doc/Combinatorial_map/CGAL/Combinatorial_map.h b/Combinatorial_map/doc/Combinatorial_map/CGAL/Combinatorial_map.h
index 9dba99d6718a..0038999e7e2a 100644
--- a/Combinatorial_map/doc/Combinatorial_map/CGAL/Combinatorial_map.h
+++ b/Combinatorial_map/doc/Combinatorial_map/CGAL/Combinatorial_map.h
@@ -8,7 +8,7 @@ The class `Combinatorial_map` represents a <I>d</I>D combinatorial map.
 
 Two versions exist: one where Darts and non void attributes are stored in memory using `Compact_container`, using `Alloc` as allocator, and use handles as descriptors; a second one where Darts and non void attributes are stored in an internal std::vector like data-structure, and use indices as descriptors. The choice between the two versions is done through the item class.
 
-\cgalModels `CombinatorialMap`
+\cgalModels{CombinatorialMap}
 
 \tparam d the dimension of the map.
 
diff --git a/Combinatorial_map/doc/Combinatorial_map/CGAL/Generic_map_min_items.h b/Combinatorial_map/doc/Combinatorial_map/CGAL/Generic_map_min_items.h
index 8cbfbf1be14b..434193a8e3cc 100644
--- a/Combinatorial_map/doc/Combinatorial_map/CGAL/Generic_map_min_items.h
+++ b/Combinatorial_map/doc/Combinatorial_map/CGAL/Generic_map_min_items.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 The class `Generic_map_min_items` defines `void` as the information associated with darts, and no attribute is enabled.
 
-\cgalModels `GenericMapItems`
+\cgalModels{GenericMapItems}
 
 \cgalHeading{Example}
 
diff --git a/Convex_hull_2/doc/Convex_hull_2/CGAL/Convex_hull_traits_adapter_2.h b/Convex_hull_2/doc/Convex_hull_2/CGAL/Convex_hull_traits_adapter_2.h
index 051d148e06cd..97bac6496bae 100644
--- a/Convex_hull_2/doc/Convex_hull_2/CGAL/Convex_hull_traits_adapter_2.h
+++ b/Convex_hull_2/doc/Convex_hull_2/CGAL/Convex_hull_traits_adapter_2.h
@@ -10,7 +10,7 @@ Given a property map associating a key to a point, the class `Convex_hull_traits
 to compute the sequence of keys for which the associated points form a convex hull,
 performing the predicates of the base traits class on the points associated to the keys.
 
-\cgalModels `ConvexHullTraits_2`
+\cgalModels{ConvexHullTraits_2}
 
 \sa `CGAL::Convex_hull_constructive_traits_2<R>`
 \sa `CGAL::Projection_traits_xy_3<K>`
diff --git a/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_constructive_traits_2.h b/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_constructive_traits_2.h
index 74534126ab7e..6090cd6785c1 100644
--- a/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_constructive_traits_2.h
+++ b/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_constructive_traits_2.h
@@ -11,7 +11,7 @@ in the sidedness tests, lines (of type `R::Line_2`) are constructed,
 which is equivalent to the precomputation of subdeterminants of
 the orientation-determinant for three points.
 
-\cgalModels `ConvexHullTraits_2`
+\cgalModels{ConvexHullTraits_2}
 
 \sa `CGAL::Projection_traits_xy_3<K>`
 \sa `CGAL::Projection_traits_yz_3<K>`
diff --git a/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_traits_2.h b/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_traits_2.h
index 5d3fb688ae01..431f04e1b46d 100644
--- a/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_traits_2.h
+++ b/Convex_hull_2/doc/Convex_hull_2/CGAL/convex_hull_traits_2.h
@@ -7,7 +7,7 @@ The class `Convex_hull_traits_2` serves as a traits class for all the two-dimens
 convex hull and extreme point calculation function. This class corresponds
 to the default traits class for these functions.
 
-\cgalModels `ConvexHullTraits_2`
+\cgalModels{ConvexHullTraits_2}
 
 \sa `CGAL::Convex_hull_constructive_traits_2<R>`
 \sa `CGAL::Convex_hull_traits_adapter_2<R,P>`
diff --git a/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_traits_3.h b/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_traits_3.h
index b02b0542e186..0258193c16f2 100644
--- a/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_traits_3.h
+++ b/Convex_hull_3/doc/Convex_hull_3/CGAL/Convex_hull_traits_3.h
@@ -9,8 +9,7 @@ function when `R` is a kernel with exact predicates but inexact constructions
 (note that the type `Plane_3` is a triple of `Point_3` and not `R::Plane_3`).
 
 \tparam PolygonMesh must be a model of  the concept `MutableFaceGraph`.
-\cgalModels `ConvexHullTraits_3`
-\cgalModels `IsStronglyConvexTraits_3`
+\cgalModels{ConvexHullTraits_3,IsStronglyConvexTraits_3}
 
 \attention The user must include the header file of the polygon mesh type, even for the default type.
 
diff --git a/Convex_hull_3/doc/Convex_hull_3/CGAL/Extreme_points_traits_adapter_3.h b/Convex_hull_3/doc/Convex_hull_3/CGAL/Extreme_points_traits_adapter_3.h
index 5154ffa29686..9f63632758c2 100644
--- a/Convex_hull_3/doc/Convex_hull_3/CGAL/Extreme_points_traits_adapter_3.h
+++ b/Convex_hull_3/doc/Convex_hull_3/CGAL/Extreme_points_traits_adapter_3.h
@@ -15,8 +15,7 @@ namespace CGAL {
  * (in practice we check `R::Has_filtered_predicates_tag` is `Tag_true` and `R::FT` is a floating point type),
  * then the default traits class used is `Convex_hull_traits_3<R>`, and `R` otherwise.
  *
- * \cgalModels `ConvexHullTraits_3`
- * \cgalModels `IsStronglyConvexTraits_3`
+ * \cgalModels{ConvexHullTraits_3,IsStronglyConvexTraits_3}
  */
 template<class PointPropertyMap, class Base_traits=Default>
 class Extreme_points_traits_adapter_3
diff --git a/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d_traits_3.h b/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d_traits_3.h
index 190d83f58fa8..dbba9f5c475f 100644
--- a/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d_traits_3.h
+++ b/Convex_hull_d/doc/Convex_hull_d/CGAL/Convex_hull_d_traits_3.h
@@ -13,7 +13,7 @@ low-dimensional standard kernel model, e.g. `Homogeneous<RT>` or
 `Cartesian<FT>` for the fixed 3-dimensional usage of
 `Convex_hull_d`.
 
-\cgalModels `ConvexHullTraits_d`
+\cgalModels{ConvexHullTraits_d}
 
 */
 template< typename R >
diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index 97f12d55731a..dd815e357593 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -135,10 +135,13 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalRefines{5}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd></dl>" \
                          "cgalRefinesBare{1}=<dl><dt>@cgalRefines</dt><dd>\1</dd></dl>" \
                          "cgalRefinesBare{2}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>\2</dd></dl>" \
-                         "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" \
                          "cgalModelsHeader=Is model of" \
                          "cgalModels{1}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd></dl>" \
                          "cgalModels{2}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd></dl>" \
+                         "cgalModels{3}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd></dl>" \
+                         "cgalModels{4}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd></dl>" \
+                         "cgalModels{5}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd></dl>" \
+                         "cgalModels{6}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd><dt></dt><dd>@c \6</dd></dl>" \
                          "cgalModelsBare{1}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd></dl>" \
                          "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index 3a25e3c92bef..9e73ce583ee0 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -144,10 +144,13 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalRefines{5}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd></dl>" \
                          "cgalRefinesBare{1}=<dl><dt>@cgalRefines</dt><dd>\1</dd></dl>" \
                          "cgalRefinesBare{2}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>\2</dd></dl>" \
-                         "cgalModels=\xrefitem models \"Is Model Of\" \"Is Model Relationships\"" \
                          "cgalModelsHeader=Is model of" \
                          "cgalModels{1}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd></dl>" \
                          "cgalModels{2}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd></dl>" \
+                         "cgalModels{3}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd></dl>" \
+                         "cgalModels{4}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd></dl>" \
+                         "cgalModels{5}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd></dl>" \
+                         "cgalModels{6}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd><dt></dt><dd>@c \6</dd></dl>" \
                          "cgalModelsBare{1}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd></dl>" \
                          "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \
diff --git a/Envelope_2/doc/Envelope_2/CGAL/Envelope_diagram_1.h b/Envelope_2/doc/Envelope_2/CGAL/Envelope_diagram_1.h
index 1e91a176b619..abb127ae839f 100644
--- a/Envelope_2/doc/Envelope_2/CGAL/Envelope_diagram_1.h
+++ b/Envelope_2/doc/Envelope_2/CGAL/Envelope_diagram_1.h
@@ -15,7 +15,7 @@ model of the `ArrangementXMonotoneTraits_2` concept, in case we handle
 only envelopes of \f$ x\f$-monotone curves, or of the refined
 `ArrangementTraits_2` concept in case we handle arbitrary planar curves.
 
-\cgalModels `EnvelopeDiagram_1`
+\cgalModels{EnvelopeDiagram_1}
 
 */
 template< typename Traits >
diff --git a/Envelope_3/doc/Envelope_3/CGAL/Env_plane_traits_3.h b/Envelope_3/doc/Envelope_3/CGAL/Env_plane_traits_3.h
index 0164f27e26af..81d5861e3c8b 100644
--- a/Envelope_3/doc/Envelope_3/CGAL/Env_plane_traits_3.h
+++ b/Envelope_3/doc/Envelope_3/CGAL/Env_plane_traits_3.h
@@ -28,7 +28,7 @@ in case of an entire plane, or from `Kernel::Plane_3` and
 `Kernel::Line_2` in case of a half-plane. The line orientation
 determines which half is considered.
 
-\cgalModels `EnvelopeTraits_3`
+\cgalModels{EnvelopeTraits_3}
 
 */
 template< typename Kernel >
diff --git a/Envelope_3/doc/Envelope_3/CGAL/Env_sphere_traits_3.h b/Envelope_3/doc/Envelope_3/CGAL/Env_sphere_traits_3.h
index 6f81385717ea..12e170ce5f99 100644
--- a/Envelope_3/doc/Envelope_3/CGAL/Env_sphere_traits_3.h
+++ b/Envelope_3/doc/Envelope_3/CGAL/Env_sphere_traits_3.h
@@ -25,7 +25,7 @@ The `Xy_monotone_surface_3` type is the same as the nested
 hemisphere when it computes lower envelopes, and ignores the lower
 hemisphere when it computes upper envelopes.
 
-\cgalModels `EnvelopeTraits_3`
+\cgalModels{EnvelopeTraits_3}
 
 */
 template< typename ConicTraits >
diff --git a/Envelope_3/doc/Envelope_3/CGAL/Env_surface_data_traits_3.h b/Envelope_3/doc/Envelope_3/CGAL/Env_surface_data_traits_3.h
index 193f8d891481..bcd4f97ab418 100644
--- a/Envelope_3/doc/Envelope_3/CGAL/Env_surface_data_traits_3.h
+++ b/Envelope_3/doc/Envelope_3/CGAL/Env_surface_data_traits_3.h
@@ -39,7 +39,7 @@ is trivial and just copies the data object:
 </TD></TR>
 </TABLE>
 
-\cgalModels `EnvelopeTraits_3`
+\cgalModels{EnvelopeTraits_3}
 
 */
 template< typename Traits, typename XyData, typename SData, typename Cnv >
diff --git a/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h b/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h
index 759a006de54e..746463520525 100644
--- a/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h
+++ b/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h
@@ -31,7 +31,7 @@ instance and are also convertible to a `Kernel::Triangle_3` object.
 Both types, `Xy_monotone_surface_3` and `Surface_3`, refer to the
 same class, as <I>every</I> triangle is (weakly) \f$ xy\f$-monotone).
 
-\cgalModels `EnvelopeTraits_3`
+\cgalModels{EnvelopeTraits_3}
 
 */
 template< typename Kernel >
diff --git a/Generalized_map/doc/Generalized_map/CGAL/Generalized_map.h b/Generalized_map/doc/Generalized_map/CGAL/Generalized_map.h
index 519e80ce4adf..8d030fa2fec4 100644
--- a/Generalized_map/doc/Generalized_map/CGAL/Generalized_map.h
+++ b/Generalized_map/doc/Generalized_map/CGAL/Generalized_map.h
@@ -8,7 +8,7 @@ The class `Generalized_map` represents a <I>d</I>D generalized map.
 
 Two versions exist: one where darts and non void attributes are stored in memory using `Compact_container`, using `Alloc` as allocator, and use handles as descriptors; a second one where darts and non void attributes are stored in an internal `std::vector` like data-structure, and use indices as descriptors. The choice between the two versions is done through the item class.
 
-\cgalModels `GeneralizedMap`
+\cgalModels{GeneralizedMap}}
 
 \tparam d the dimension of the map.
 
diff --git a/Generator/doc/Generator/CGAL/Random_convex_set_traits_2.h b/Generator/doc/Generator/CGAL/Random_convex_set_traits_2.h
index b478186e0343..e3f6a2a15ed8 100644
--- a/Generator/doc/Generator/CGAL/Random_convex_set_traits_2.h
+++ b/Generator/doc/Generator/CGAL/Random_convex_set_traits_2.h
@@ -5,7 +5,7 @@ namespace CGAL {
 The class `Random_convex_set_traits_2` serves as a traits class
 for the function `random_convex_set_2()`.
 
-\cgalModels `RandomConvexSetTraits_2`
+\cgalModels{RandomConvexSetTraits_2}
 
 */
 template< typename Kernel >
diff --git a/Generator/doc/Generator/CGAL/point_generators_2.h b/Generator/doc/Generator/CGAL/point_generators_2.h
index 459e856ac8dd..aec175967500 100644
--- a/Generator/doc/Generator/CGAL/point_generators_2.h
+++ b/Generator/doc/Generator/CGAL/point_generators_2.h
@@ -143,8 +143,7 @@ The class `Random_points_in_disc_2` is an input iterator creating points uniform
 distributed in an open disc. The default `Creator` is
 `Creator_uniform_2<Kernel_traits<Point_2>::Kernel::RT,Point_2>`.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Points_on_segment_2<Point_2>`
 \sa `CGAL::Random_points_in_square_2<Point_2, Creator>`
@@ -207,8 +206,7 @@ The class `Random_points_in_square_2` is an input iterator creating points unifo
 distributed in a half-open square. The default `Creator` is
 `Creator_uniform_2<Kernel_traits<Point_2>::Kernel::RT,Point_2>`.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Points_on_segment_2<Point_2>`
 \sa `CGAL::Random_points_in_triangle_2<Point_2, Creator>`
@@ -272,8 +270,7 @@ The class `Random_points_in_triangle_2` is an input iterator creating points uni
 distributed inside a triangle. The default `Creator` is
 `Creator_uniform_2<Kernel_traits<Point_2>::Kernel::RT,Point_2>`.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Points_on_segment_2<Point_2>`
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
@@ -345,8 +342,7 @@ typedef const Point_2& reference;
  The triangulation must be valid and unchanged while the iterator is used.
 
 
- \cgalModels `InputIterator`
- \cgalModels `PointGenerator`
+ \cgalModels{InputIterator,PointGenerator}
 
  \sa `CGAL::Points_on_segment_2<Point_2>`
  \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
@@ -413,8 +409,7 @@ get_default_random() );
  The triangle range must be valid and unchanged while the iterator is used.
 
 
- \cgalModels `InputIterator`
- \cgalModels `PointGenerator`
+ \cgalModels{InputIterator,PointGenerator}
 
  \sa `CGAL::Points_on_segment_2<Point_2>`
  \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
@@ -483,8 +478,7 @@ The generated points are computed using floating point arithmetic,
 whatever the Kernel is, thus they are on the circle/sphere only up to
 rounding errors.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Points_on_segment_2<Point_2>`
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
@@ -550,8 +544,7 @@ The class `Random_points_on_segment_2` is an input iterator creating points unif
 distributed on a segment. The default `Creator` is
 `Creator_uniform_2<Kernel_traits<Point_2>::Kernel::RT,Point_2>`.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Points_on_segment_2<Point_2>`
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
@@ -616,8 +609,7 @@ The class `Random_points_on_square_2` is an input iterator creating points unifo
 distributed on the boundary of a square. The default `Creator` is
 `Creator_uniform_2<Kernel_traits<Point_2>::Kernel::RT,Point_2>`.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Points_on_segment_2<Point_2>`
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
@@ -683,9 +675,9 @@ namespace CGAL {
 The class `Points_on_segment_2` is a generator for points on a segment whose
 endpoints are specified upon construction. The points are equally spaced.
 
-\cgalModels `PointGenerator`
+\cgalModels{PointGenerator}
 
-\sa `CGAL::points_on_segment_2<Point_2>`
+\sa `CGAL::points_on_segment_2<Point_2>
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_square_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_triangle_2<Point_2, Creator>`
diff --git a/Generator/doc/Generator/CGAL/point_generators_3.h b/Generator/doc/Generator/CGAL/point_generators_3.h
index 6c7fd5985152..1e2853fa5cfa 100644
--- a/Generator/doc/Generator/CGAL/point_generators_3.h
+++ b/Generator/doc/Generator/CGAL/point_generators_3.h
@@ -41,8 +41,7 @@ The class `Random_points_in_cube_3` is an input iterator creating points uniform
 distributed in a half-open cube. The default `Creator` is
 `Creator_uniform_3<Kernel_traits<Point_3>::Kernel::RT,Point_3>`.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_in_square_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_sphere_3<Point_3, Creator>`
@@ -106,8 +105,7 @@ The class `Random_points_in_sphere_3` is an input iterator creating points unifo
 distributed strictly inside a sphere. The default `Creator` is
 `Creator_uniform_3<Kernel_traits<Point_3>::Kernel::RT,Point_3>`.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_cube_3<Point_3, Creator>`
@@ -171,8 +169,7 @@ The class `Random_points_in_triangle_3` is an input iterator creating points uni
 distributed inside a 3D triangle. The default `Creator` is
 `Creator_uniform_3<Kernel_traits<Point_3>::Kernel::RT,Point_3>`.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_cube_3<Point_3, Creator>`
@@ -245,8 +242,7 @@ The class `Random_points_on_segment_3` is an input iterator creating points unif
 distributed on a segment. The default `Creator` is
 `Creator_uniform_3<Kernel_traits<Point_3>::Kernel::RT,Point_3>`.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_in_cube_3<Point_3, Creator>`
 \sa `CGAL::Random_points_in_triangle_3<Point_3, Creator>`
@@ -311,8 +307,7 @@ The class `Random_points_in_tetrahedron_3` is an input iterator creating points
 distributed inside a tetrahedron. The default `Creator` is
 `Creator_uniform_3<Kernel_traits<Point_3>::Kernel::RT,Point_3>`.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_on_segment_3<Point_3, Creator>`
 \sa `CGAL::Random_points_in_cube_3<Point_3, Creator>`
@@ -387,8 +382,7 @@ The class `Random_points_in_triangles_3` is an input iterator creating points un
 The triangle range must be valid and unchanged while the iterator is used.
 
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_in_cube_3<Point_3, Creator>`
 \sa `CGAL::Random_points_in_triangle_3<Point_3, Creator>`
@@ -454,8 +448,7 @@ The class `Random_points_in_triangle_mesh_3` is an input iterator creating point
 distributed inside the faces of a triangle mesh model of `FaceListGraph`.
 The triangle mesh must be valid and unchanged while the iterator is used.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_cube_3<Point_3, Creator>`
@@ -534,8 +527,7 @@ The tetrahedral mesh must be valid and unchanged while the iterator is used.
 
 \tparam C3T3 must be a model of `Mesh_complex_3_in_triangulation_3`
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_cube_3<Point_3, Creator>`
@@ -608,8 +600,7 @@ The tetrahedral mesh must be valid and unchanged while the iterator is used.
 
 \tparam C3T3 must be a model of `Mesh_complex_3_in_triangulation_3`
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_cube_3<Point_3, Creator>`
@@ -682,8 +673,7 @@ The generated points are computed using floating point arithmetic,
 whatever the Kernel is, thus they are on the circle/sphere only up to
 rounding errors.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_on_circle_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_cube_3<Point_3, Creator>`
diff --git a/Generator/doc/Generator/CGAL/point_generators_d.h b/Generator/doc/Generator/CGAL/point_generators_d.h
index a06065a8ac12..7f22705dee71 100644
--- a/Generator/doc/Generator/CGAL/point_generators_d.h
+++ b/Generator/doc/Generator/CGAL/point_generators_d.h
@@ -40,8 +40,7 @@ Creator creator);
 The class `Random_points_in_ball_d` is an input iterator creating points uniformly
 distributed in an open ball in any dimension.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_sphere_3<Point_3, Creator>`
@@ -106,8 +105,7 @@ namespace CGAL {
 The class `Random_points_in_cube_d` is an input iterator creating points uniformly
 distributed in an half-open cube.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_in_square_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_cube_3<Point_3, Creator>`
@@ -178,8 +176,7 @@ The generated points are computed using floating point arithmetic,
 whatever the Kernel is, thus they are on the sphere only up to
 rounding errors.
 
-\cgalModels `InputIterator`
-\cgalModels `PointGenerator`
+\cgalModels{InputIterator,PointGenerator}
 
 \sa `CGAL::Random_points_on_circle_2<Point_2, Creator>`
 \sa `CGAL::Random_points_on_sphere_3<Point_3, Creator>`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h
index 5d620b9aba36..c30b0c5f3885 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h
@@ -10,7 +10,7 @@ uses the \cgal default allocator as default setting. `HalfedgeDS_default` is a
 list-based representation with bidirectional iterators that supports
 removal.
 
-\cgalModels `HalfedgeDS<Traits,Items,Alloc>`
+\cgalModelsBare{`HalfedgeDS<Traits,Items,Alloc>`}
 
 \sa `CGAL::HalfedgeDS_list`
 \sa `CGAL::HalfedgeDS_vector`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_face_base.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_face_base.h
index b7e0923adefc..64569d0b25c9 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_face_base.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_face_base.h
@@ -35,7 +35,7 @@ without a reference to an incident halfedge and it stores a plane
 equation of type `Plane`. It can be used as a face for a
 model of the `PolyhedronItems_3` concept.
 
-\cgalModels `HalfedgeDSFace`
+\cgalModels{HalfedgeDSFace}
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_face_min_base.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_face_min_base.h
index c9ee44f575df..204225bbef27 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_face_min_base.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_face_min_base.h
@@ -9,7 +9,7 @@ equivalent to `CGAL::HalfedgeDS_face_base< Refs, CGAL::Tag_false>`.
 It is empty besides the required type definitions. It can be used for
 deriving own faces.
 
-\cgalModels `HalfedgeDSFace`
+\cgalModels{HalfedgeDSFace}
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_halfedge_base.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_halfedge_base.h
index 0fb795756029..57a386b3b42e 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_halfedge_base.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_halfedge_base.h
@@ -57,7 +57,7 @@ supported.
 In all cases, a reference to the next halfedge and to the opposite
 halfedge is supported.
 
-\cgalModels `HalfedgeDSHalfedge`
+\cgalModels{HalfedgeDSHalfedge}
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_halfedge_min_base.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_halfedge_min_base.h
index 7358f0858d02..2be20cb48f35 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_halfedge_min_base.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_halfedge_min_base.h
@@ -10,7 +10,7 @@ CGAL::Tag_false, CGAL::Tag_false, CGAL::Tag_false>`.
 The class contains support for the next and the opposite pointer and
 the required type definitions. It can be used for deriving own halfedges.
 
-\cgalModels `HalfedgeDSHalfedge`
+\cgalModels{HalfedgeDSHalfedge}
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_items_2.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_items_2.h
index 39b806a24122..3e050fb78087 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_items_2.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_items_2.h
@@ -9,7 +9,7 @@ declare all incidences supported by a `HalfedgeDS`. The vertex
 also contains a point of type `Traits::Point_2`, where `Traits`
 is the template argument of the corresponding `HalfedgeDS`.
 
-\cgalModels `HalfedgeDSItems`
+\cgalModels{HalfedgeDSItems}
 
 \sa `CGAL::HalfedgeDS_min_items`
 \sa `CGAL::Polyhedron_items_3`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h
index 66407bbf6dd3..cee3b3d30288 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h
@@ -7,7 +7,7 @@ The class `HalfedgeDS_list` is a model for the `HalfedgeDS` concept.
 `HalfedgeDS_list` is a list-based representation with bidirectional
 iterators that supports removal.
 
-\cgalModels `HalfedgeDS<Traits,Items,Alloc>`
+\cgalModelsBare{`HalfedgeDS<Traits,Items,Alloc>`}
 
 \sa `CGAL::HalfedgeDS_default`
 \sa `CGAL::HalfedgeDS_vector`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_min_items.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_min_items.h
index 55504012cce3..8439f152f2a0 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_min_items.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_min_items.h
@@ -9,7 +9,7 @@ declare the minimal required incidences for a `HalfedgeDS`, which
 are the `next()` and the `opposite()` member function for
 halfedges.
 
-\cgalModels `HalfedgeDSItems`
+\cgalModels{HalfedgeDSItems}
 
 \sa `CGAL::HalfedgeDS_items_2`
 \sa `CGAL::Polyhedron_items_3`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vector.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vector.h
index 51942b6adf52..d2f29447128f 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vector.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vector.h
@@ -7,7 +7,7 @@ The class `HalfedgeDS_vector` is a model for the `HalfedgeDS` concept.
 `HalfedgeDS_vector` is a vector-based representation with random
 access iterators that does not support removal.
 
-\cgalModels `HalfedgeDS<Traits,Items,Alloc>`
+\cgalModelsBare{`HalfedgeDS<Traits,Items,Alloc>`}
 
 \sa `CGAL::HalfedgeDS_default`
 \sa `CGAL::HalfedgeDS_list`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vertex_base.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vertex_base.h
index b4ac2235f636..e1b294bdc000 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vertex_base.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vertex_base.h
@@ -33,7 +33,7 @@ Let us look at some instantiations
   type `Point`. It can be used as a vertex for a model of the
   `PolyhedronItems_3` concept.
 
-\cgalModels `HalfedgeDSVertex`
+\cgalModels{HalfedgeDSVertex}
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vertex_min_base.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vertex_min_base.h
index 52232dff3ee2..aa9813027374 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vertex_min_base.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vertex_min_base.h
@@ -9,7 +9,7 @@ equivalent to `HalfedgeDS_vertex_base< Refs, CGAL::Tag_false>`.
 It is empty besides the required type definitions. It can be used for deriving
 own vertices.
 
-\cgalModels `HalfedgeDSVertex`
+\cgalModels{HalfedgeDSVertex}
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
 \sa `HalfedgeDSItems`
diff --git a/Heat_method_3/include/CGAL/Heat_method_3/internal/Intrinsic_Delaunay_triangulation_3.h b/Heat_method_3/include/CGAL/Heat_method_3/internal/Intrinsic_Delaunay_triangulation_3.h
index cff7968bd7e8..65d78512514d 100644
--- a/Heat_method_3/include/CGAL/Heat_method_3/internal/Intrinsic_Delaunay_triangulation_3.h
+++ b/Heat_method_3/include/CGAL/Heat_method_3/internal/Intrinsic_Delaunay_triangulation_3.h
@@ -146,7 +146,7 @@ struct Intrinsic_Delaunay_triangulation_3_vertex_iterator_functor
  * \tparam TriangleMesh a triangulated surface mesh, model of `FaceListGraph` and `HalfedgeListGraph`
  * \tparam Traits a model of `HeatMethodTraits_3`
  *
- * \cgalModels `FaceListGraph`
+ * \cgalModels{FaceListGraph}
  */
 
 template <typename TriangleMesh,
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h
index 8913899a2710..0c1cf6e74cca 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_CK_traits_2.h
@@ -19,7 +19,7 @@ triangulations and dual objects when the input points have rational coordinates.
 
 \sa `Hyperbolic_Delaunay_triangulation_traits_2`
 
-\cgalModels `HyperbolicDelaunayTriangulationTraits_2`
+\cgalModels{HyperbolicDelaunayTriangulationTraits_2}
 */
 
 template < class K >
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
index 8eab67ea0836..199f295efc24 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
@@ -20,7 +20,7 @@ algebraic coordinates.
 
 \sa `Hyperbolic_Delaunay_triangulation_CK_traits_2`
 
-\cgalModels `HyperbolicDelaunayTriangulationTraits_2`
+\cgalModels{HyperbolicDelaunayTriangulationTraits_2}
 */
 
 template< class K >
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_triangulation_face_base_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_triangulation_face_base_2.h
index c5dabf727b93..d7c85fc23725 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_triangulation_face_base_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_triangulation_face_base_2.h
@@ -14,7 +14,7 @@ offered by \cgal.
 \tparam Fb must be a model of `TriangulationFaceBase_2`. %Defaults to `Triangulation_face_base_2<Gt>`.
 
 
-\cgalModels `HyperbolicTriangulationFaceBase_2`
+\cgalModels{HyperbolicTriangulationFaceBase_2}
 */
 
 
diff --git a/Inscribed_areas/doc/Inscribed_areas/CGAL/Extremal_polygon_traits_2.h b/Inscribed_areas/doc/Inscribed_areas/CGAL/Extremal_polygon_traits_2.h
index 14fbc1a339a8..c30c1d54a325 100644
--- a/Inscribed_areas/doc/Inscribed_areas/CGAL/Extremal_polygon_traits_2.h
+++ b/Inscribed_areas/doc/Inscribed_areas/CGAL/Extremal_polygon_traits_2.h
@@ -13,7 +13,7 @@ be inscribed into a given convex polygon \f$ P\f$ using the function
 
 \tparam K must be a model of `Kernel`.
 
-\cgalModels `ExtremalPolygonTraits_2`
+\cgalModels{ExtremalPolygonTraits_2}
 
 \sa `CGAL::maximum_area_inscribed_k_gon_2()`
 \sa `CGAL::maximum_perimeter_inscribed_k_gon_2()`
@@ -117,7 +117,7 @@ k\f$-gon \f$ P_k\f$ that can be inscribed into a given convex polygon
 
 \tparam K must be a model of `Kernel`.
 
-\cgalModels `ExtremalPolygonTraits_2`
+\cgalModels{ExtremalPolygonTraits_2}
 
 \sa `CGAL::maximum_area_inscribed_k_gon_2()`
 \sa `CGAL::maximum_perimeter_inscribed_k_gon_2()`
diff --git a/Interpolation/doc/Interpolation/CGAL/Interpolation_gradient_fitting_traits_2.h b/Interpolation/doc/Interpolation/CGAL/Interpolation_gradient_fitting_traits_2.h
index 73b2ca492690..fe4dd468cb76 100644
--- a/Interpolation/doc/Interpolation/CGAL/Interpolation_gradient_fitting_traits_2.h
+++ b/Interpolation/doc/Interpolation/CGAL/Interpolation_gradient_fitting_traits_2.h
@@ -11,8 +11,7 @@ functions and of Sibson's gradient fitting function when applied on
 a function defined over a two-dimensional domain. The traits class
 is templated by a kernel class `K`.
 
-\cgalModels `GradientFittingTraits`
-\cgalModels `InterpolationTraits`
+\cgalModels{GradientFittingTraits,InterpolationTraits}
 
 \sa `InterpolationTraits`
 \sa `GradientFittingTraits`
diff --git a/Interpolation/doc/Interpolation/CGAL/Interpolation_traits_2.h b/Interpolation/doc/Interpolation/CGAL/Interpolation_traits_2.h
index 4dfb092457de..79fb75c24afd 100644
--- a/Interpolation/doc/Interpolation/CGAL/Interpolation_traits_2.h
+++ b/Interpolation/doc/Interpolation/CGAL/Interpolation_traits_2.h
@@ -10,7 +10,7 @@ geometric traits class of interpolation methods applied on a
 bivariate function over a two-dimensional domain. The traits class
 is templated by a kernel class `K`.
 
-\cgalModels `InterpolationTraits`
+\cgalModels{InterpolationTraits}
 
 \sa `InterpolationTraits`
 \sa `GradientFittingTraits`
diff --git a/Interpolation/doc/Interpolation/CGAL/Voronoi_intersection_2_traits_3.h b/Interpolation/doc/Interpolation/CGAL/Voronoi_intersection_2_traits_3.h
index 2f3475cff060..68b432af00e0 100644
--- a/Interpolation/doc/Interpolation/CGAL/Voronoi_intersection_2_traits_3.h
+++ b/Interpolation/doc/Interpolation/CGAL/Voronoi_intersection_2_traits_3.h
@@ -20,7 +20,7 @@ points without explicitly constructing the projected points and the
 weights. This reduces the arithmetic demands. The traits class is
 templated by a kernel class `K` and inherits from it.
 
-\cgalModels `RegularTriangulationTraits_2`
+\cgalModels{RegularTriangulationTraits_2}
 
 \sa `CGAL::Regular_triangulation_2<Gt, Tds>`
 \sa `PkgInterpolationRegularNeighborCoordinates2`
diff --git a/Interval_skip_list/doc/Interval_skip_list/CGAL/Interval_skip_list_interval.h b/Interval_skip_list/doc/Interval_skip_list/CGAL/Interval_skip_list_interval.h
index 0507c73d6788..b6d2bc94a8ad 100644
--- a/Interval_skip_list/doc/Interval_skip_list/CGAL/Interval_skip_list_interval.h
+++ b/Interval_skip_list/doc/Interval_skip_list/CGAL/Interval_skip_list_interval.h
@@ -11,7 +11,7 @@ can be open or closed at each endpoint.
 
 The output operator is defined for `std::ostream`.
 
-\cgalModels `Interval`
+\cgalModels{Interval}
 
 */
 template< typename Value >
diff --git a/Interval_skip_list/doc/Interval_skip_list/CGAL/Level_interval.h b/Interval_skip_list/doc/Interval_skip_list/CGAL/Level_interval.h
index 8ee910ca5dc9..4e80b70e6194 100644
--- a/Interval_skip_list/doc/Interval_skip_list/CGAL/Level_interval.h
+++ b/Interval_skip_list/doc/Interval_skip_list/CGAL/Level_interval.h
@@ -13,7 +13,7 @@ whose `Kernel_traits<Point>::Kernel` must have a nested type `FT`.
 These requirements are fulfilled, if one uses a \cgal triangulation
 and a \cgal `Kernel`.
 
-\cgalModels `Interval`
+\cgalModels{Interval}
 
 */
 template< typename FaceHandle >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_2.h b/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_2.h
index 4bd99fa3771b..1c0cb7a99315 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_2.h
@@ -34,7 +34,7 @@ translation vector \f$ (v_0,\,v_1,\,1)\f$ appears in the last column of the
 matrix. The entries \f$ m_{20}\f$ and \f$ m_{21}\f$ are always zero and
 therefore do not appear in the constructors.
 
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 \sa `Identity_transformation`
 \sa `Rotation`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_3.h b/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_3.h
index cfb2c924cb8a..1312f02689f1 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_3.h
@@ -29,7 +29,7 @@ In three-dimensional space we have a \f$ 4\times 4\f$ matrix
 \f$ m_{32}\f$ are always zero and therefore do not appear in the
 constructors.
 
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 \sa `CGAL::Aff_transformation_2<Kernel>`
 \sa `CGAL::Identity_transformation`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Bbox_2.h b/Kernel_23/doc/Kernel_23/CGAL/Bbox_2.h
index ec861b9cb72b..1905d3367034 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Bbox_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Bbox_2.h
@@ -7,7 +7,7 @@ namespace CGAL {
 An object `b` of the class `Bbox_2` is a bounding
 box in the two-dimensional Euclidean plane \f$ \E^2\f$. This class is not templated.
 
-\cgalModels `Hashable`
+\cgalModels{Hashable}
 
 \sa `CGAL::Bbox_3`
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Bbox_3.h b/Kernel_23/doc/Kernel_23/CGAL/Bbox_3.h
index a61d5e339af9..f44a44e48129 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Bbox_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Bbox_3.h
@@ -7,7 +7,7 @@ namespace CGAL {
 An object `b` of the class `Bbox_3` is a bounding
 box in the three-dimensional Euclidean space \f$ \E^3\f$.
 
-\cgalModels `Hashable`
+\cgalModels{Hashable}
 
 \sa `CGAL::Bbox_2`
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Cartesian.h b/Kernel_23/doc/Kernel_23/CGAL/Cartesian.h
index 453a15d867d2..46920d12e07c 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Cartesian.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Cartesian.h
@@ -14,7 +14,7 @@ type provided as a model for `FieldNumberType` is only an approximation of a
 field (such as the built-in type `double`), then the geometry provided by
 the kernel is only an approximation of Euclidean geometry.
 
-\cgalModels `Kernel`
+\cgalModels{Kernel}
 
 \cgalHeading{Implementation}
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Circle_2.h b/Kernel_23/doc/Kernel_23/CGAL/Circle_2.h
index 1e9eacdeb0e4..0903e5152555 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Circle_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Circle_2.h
@@ -11,8 +11,7 @@ positive side is to the left of the boundary. The boundary also
 splits \f$ \E^2\f$ into a bounded and an unbounded side. Note that the
 circle can be degenerated, i.e.\ the squared radius may be zero.
 
-\cgalModels `Kernel::Circle_2`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::Circle_2,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Circle_3.h b/Kernel_23/doc/Kernel_23/CGAL/Circle_3.h
index 1fcdcab6e68f..4624be59f351 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Circle_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Circle_3.h
@@ -7,7 +7,7 @@ An object `c` of type `Circle_3` is a circle in the
 three-dimensional Euclidean space \f$ \E^3\f$. Note that the
 circle can be degenerate, i.e.\ the squared radius may be zero.
 
-\cgalModels `Kernel::Circle_3`
+\cgalModels{Kernel::Circle_3}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Direction_2.h b/Kernel_23/doc/Kernel_23/CGAL/Direction_2.h
index 00a2e8d74a57..241f39e64094 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Direction_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Direction_2.h
@@ -14,7 +14,7 @@ orthogonal to an oriented plane, or the direction of an oriented line.
 Further, they can be used to indicate angles. The slope of a direction
 is `dy()`/`dx()`.
 
-\cgalModels `Kernel::Direction_2`
+\cgalModels{Kernel::Direction_2}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Direction_3.h b/Kernel_23/doc/Kernel_23/CGAL/Direction_3.h
index 81b096ac359a..34c8c55766d0 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Direction_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Direction_3.h
@@ -13,7 +13,7 @@ or the direction normal to parallel planes that have the same orientation.
 For example, you can ask for the direction
 orthogonal to an oriented plane, or the direction of an oriented line.
 
-\cgalModels `Kernel::Direction_3`
+\cgalModels{Kernel::Direction_3}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel.h b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel.h
index a29334c9fc08..5a6bae83b3ea 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel.h
@@ -14,7 +14,7 @@ coordinates.
 constructions.
 </UL>
 
-\cgalModels `Kernel`
+\cgalModels{Kernel}
 
 \sa `CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt`
 \sa `CGAL::Exact_predicates_exact_constructions_kernel_with_kth_root`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_kth_root.h b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_kth_root.h
index 275fd9ae602c..3b889df0f040 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_kth_root.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_kth_root.h
@@ -17,7 +17,7 @@ constructions.
 
 Note that it requires CORE or LEDA installed.
 
-\cgalModels `Kernel`
+\cgalModels{Kernel}
 
 \sa `CGAL::Exact_predicates_exact_constructions_kernel`
 \sa `CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_root_of.h b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_root_of.h
index 512a90c0de66..9e9f5fafcdc3 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_root_of.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_root_of.h
@@ -17,7 +17,7 @@ constructions.
 
 Note that it requires CORE or LEDA installed.
 
-\cgalModels `Kernel`
+\cgalModels{Kernel}
 
 \sa `CGAL::Exact_predicates_exact_constructions_kernel`
 \sa `CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h
index 329cf7b73af8..7827a88903b9 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h
@@ -17,7 +17,7 @@ constructions.
 
 Note that it requires CORE or LEDA installed.
 
-\cgalModels `Kernel`
+\cgalModels{Kernel}
 
 \sa `CGAL::Exact_predicates_exact_constructions_kernel`
 \sa `CGAL::Exact_predicates_exact_constructions_kernel_with_kth_root`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
index 1063561e3d65..d53f16093f08 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Exact_predicates_inexact_constructions_kernel.h
@@ -14,7 +14,7 @@ coordinates.
 constructions.
 </UL>
 
-\cgalModels `Kernel`
+\cgalModels{Kernel}
 
 \sa `CGAL::Exact_predicates_exact_constructions_kernel`
 \sa `CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Filtered_kernel.h b/Kernel_23/doc/Kernel_23/CGAL/Filtered_kernel.h
index d2842b55a2ec..5935300f991e 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Filtered_kernel.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Filtered_kernel.h
@@ -14,7 +14,7 @@ More details about the filtering technique can be found in  \cgalCite{cgal:bbp-i
 In contrast to `Filtered_kernel`,
 the global functions are those of `CK`.
 
-\cgalModels `Kernel`
+\cgalModels{Kernel}
 
 \cgalHeading{Example}
 
@@ -71,7 +71,7 @@ activates or not an additional layer of semi-static filters. It defaults to
 defined. This option is mostly for debugging and testing, there should be no
 production use for deactivating static filters.
 
-\cgalModels `Kernel`
+\cgalModels{Kernel}
 
 \cgalHeading{Example}
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Homogeneous.h b/Kernel_23/doc/Kernel_23/CGAL/Homogeneous.h
index 64f071e40a02..b46345798dfb 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Homogeneous.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Homogeneous.h
@@ -14,7 +14,7 @@ type provided as a model for `RingNumberType` is only an approximation of a
 ring (such as the built-in type `double`), then the geometry provided by
 the kernel is only an approximation of Euclidean geometry.
 
-\cgalModels `Kernel`
+\cgalModels{Kernel}
 
 \cgalHeading{Implementation}
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h b/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h
index a32da1d2490d..c98675c6ecf8 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Iso_cuboid_3.h
@@ -16,8 +16,7 @@ difference however is that bounding boxes have always double coordinates,
 whereas the coordinate type of an iso-oriented cuboid is chosen by
 the user.
 
-\cgalModels `Kernel::IsoCuboid_3`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::IsoCuboid_3,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h b/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h
index d7228803e0e2..106c019b0e2c 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Iso_rectangle_2.h
@@ -17,8 +17,7 @@ difference however is that bounding boxes have always double coordinates,
 whereas the coordinate type of an iso-oriented rectangle is chosen by
 the user.
 
-\cgalModels `Kernel::IsoRectangle_2`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::IsoRectangle_2,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Line_2.h b/Kernel_23/doc/Kernel_23/CGAL/Line_2.h
index 079c65a6eb6c..6d10a6efc622 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Line_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Line_2.h
@@ -34,7 +34,7 @@ To define a line `l` we write:
 Line_2< Cartesian<double> > l(p,q);
 \endcode
 
-\cgalModels `Kernel::Line_2`
+\cgalModels{Kernel::Line_2}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Line_3.h b/Kernel_23/doc/Kernel_23/CGAL/Line_3.h
index e7b19f591073..1760d5f6c2a2 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Line_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Line_3.h
@@ -6,7 +6,7 @@ namespace CGAL {
 An object `l` of the data type `Line_3` is a directed
 straight line in the three-dimensional Euclidean space \f$ \E^3\f$.
 
-\cgalModels `Kernel::Line_3`
+\cgalModels{Kernel::Line_3}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Plane_3.h b/Kernel_23/doc/Kernel_23/CGAL/Plane_3.h
index 9ef778c7c174..4496ea077dd8 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Plane_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Plane_3.h
@@ -14,7 +14,7 @@ A point `p` with %Cartesian coordinates \f$ (px, py, pz)\f$ is on the
 positive side of `h`, iff \f$ a\, px +b\, py +c\, pz + d > 0\f$.
 It is on the negative side, iff \f$ a\, px +b\, py\, +c\, pz + d < 0\f$.
 
-\cgalModels `Kernel::Plane_3`
+\cgalModels{Kernel::Plane_3}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Point_2.h b/Kernel_23/doc/Kernel_23/CGAL/Point_2.h
index 00ea07ef2fbc..7548bef24722 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Point_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Point_2.h
@@ -30,8 +30,7 @@ p = q;
 std::cout << p.x() << " " << p.y() << std::endl;
 \endcode
 
-\cgalModels `Kernel::Point_2`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::Point_2,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Point_3.h b/Kernel_23/doc/Kernel_23/CGAL/Point_3.h
index 0babd70a4c84..7bd6d26fddc7 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Point_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Point_3.h
@@ -16,8 +16,7 @@ to `NT`, and `Kernel::FT` is equal to `Quotient<NT>`.
 
 The following operations can be applied on points:
 
-\cgalModels `Kernel::Point_3`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::Point_3,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_3.h b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_3.h
index 9c468b37b225..8642cd194d1f 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_3.h
@@ -15,12 +15,7 @@ constructions or if `K` is a `CGAL::Filtered_kernel` (such as for
 `CGAL::Exact_predicates_inexact_constructions_kernel`), this class automatically
 provides exact predicates.
 
-\cgalModels `TriangulationTraits_2`
-\cgalModels `DelaunayTriangulationTraits_2`
-\cgalModels `ConstrainedTriangulationTraits_2`
-\cgalModels `PolygonTraits_2`
-\cgalModels `ConformingDelaunayTriangulationTraits_2`
-\cgalModels `Barycentric_coordinates::BarycentricTraits_2`
+\cgalModels{TriangulationTraits_2,DelaunayTriangulationTraits_2,ConstrainedTriangulationTraits_2,PolygonTraits_2,ConformingDelaunayTriangulationTraits_2,Barycentric_coordinates::BarycentricTraits_2}
 
 \sa `CGAL::Projection_traits_xy_3`
 \sa `CGAL::Projection_traits_xz_3`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
index ab57d5cfb67a..d9911834c80c 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
@@ -21,18 +21,12 @@ constructions or if `K` is a `CGAL::Filtered_kernel` (such as for
 `CGAL::Exact_predicates_inexact_constructions_kernel`), this class automatically
 provides exact predicates.
 
-\cgalModels The class is a model of several 2D triangulation traits class concepts,
+\cgalModelsBare{The class is a model of several 2D triangulation traits class concepts\,
   except that it does not provide the type and constructors
-  required to build the dual Voronoi diagram.
-\cgalModels `PolygonTraits_2`
-\cgalModels `ConvexHullTraits_2`
-\cgalModels `TriangulationTraits_2`
-\cgalModels `DelaunayTriangulationTraits_2`
-\cgalModels `ConstrainedTriangulationTraits_2`
-\cgalModels `ConvexHullTraits_2`
-\cgalModels `DelaunayMeshTraits_2`
-\cgalModels `AnalyticWeightTraits_2`
-\cgalModels `Barycentric_coordinates::BarycentricTraits_2`
+  required to build the dual Voronoi diagram.\n
+            `PolygonTraits_2`\n`ConvexHullTraits_2`\n`TriangulationTraits_2`\n`DelaunayTriangulationTraits_2`\n
+            `ConstrainedTriangulationTraits_2`\n`ConvexHullTraits_2`\n`DelaunayMeshTraits_2`\n`AnalyticWeightTraits_2`\n
+            `Barycentric_coordinates::BarycentricTraits_2`}
 
 \sa `CGAL::Projection_traits_3`
 */
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Ray_2.h b/Kernel_23/doc/Kernel_23/CGAL/Ray_2.h
index c153b0f9ee38..0e81f49852c0 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Ray_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Ray_2.h
@@ -7,7 +7,7 @@ An object `r` of the data type `Ray_2` is a directed
 straight ray in the two-dimensional Euclidean plane \f$ \E^2\f$. It starts
 in a point called the <I>source</I> of `r` and goes to infinity.
 
-\cgalModels `Kernel::Ray_2`
+\cgalModels{Kernel::Ray_2}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Ray_3.h b/Kernel_23/doc/Kernel_23/CGAL/Ray_3.h
index 86e6efce248a..49f66ae47cc7 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Ray_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Ray_3.h
@@ -7,7 +7,7 @@ An object `r` of the data type `Ray_3` is a directed
 straight ray in the three-dimensional Euclidean space \f$ \E^3\f$. It starts
 in a point called the <I>source</I> of `r` and it goes to infinity.
 
-\cgalModels `Kernel::Ray_3`
+\cgalModels{Kernel::Ray_3}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Segment_2.h b/Kernel_23/doc/Kernel_23/CGAL/Segment_2.h
index 71ae42573350..0e7bc381ab15 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Segment_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Segment_2.h
@@ -14,8 +14,7 @@ to compute the square of the length, because otherwise we had to
 perform a square root operation which is not defined for all
 number types, which is expensive, and may not be exact.
 
-\cgalModels `Kernel::Segment_2`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::Segment_2,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Segment_3.h b/Kernel_23/doc/Kernel_23/CGAL/Segment_3.h
index 36dcda524944..ffa862e7361f 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Segment_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Segment_3.h
@@ -14,8 +14,7 @@ to compute the square of the length, because otherwise we had to
 perform a square root operation which is not defined for all
 number types, which is expensive, and may not be exact.
 
-\cgalModels `Kernel::Segment_3`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::Segment_3,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Simple_cartesian.h b/Kernel_23/doc/Kernel_23/CGAL/Simple_cartesian.h
index b84880de9919..11ee6050d50b 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Simple_cartesian.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Simple_cartesian.h
@@ -14,7 +14,7 @@ type provided as a model for `FieldNumberType` is only an approximation of a
 field (such as the built-in type `double`), then the geometry provided by
 the kernel is only an approximation of Euclidean geometry.
 
-\cgalModels `Kernel`
+\cgalModels{Kernel}
 
 \cgalHeading{Implementation}
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Simple_homogeneous.h b/Kernel_23/doc/Kernel_23/CGAL/Simple_homogeneous.h
index 302e7c91b5c8..1dc5fa6395e1 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Simple_homogeneous.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Simple_homogeneous.h
@@ -14,7 +14,7 @@ type provided as a model for `RingNumberType` is only an approximation of a
 ring (such as the built-in type `double`), then the geometry provided by
 the kernel is only an approximation of Euclidean geometry.
 
-\cgalModels `Kernel`
+\cgalModels{Kernel}
 
 \cgalHeading{Implementation}
 
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Sphere_3.h b/Kernel_23/doc/Kernel_23/CGAL/Sphere_3.h
index f8541de6dd30..2436276513e1 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Sphere_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Sphere_3.h
@@ -11,8 +11,7 @@ positive side is to the left of the boundary. The boundary also
 splits \f$ \E^3\f$ into a bounded and an unbounded side. Note that the
 sphere can be degenerated, i.e.\ the squared radius may be zero.
 
-\cgalModels `Kernel::Sphere_3`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::Sphere_3,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h b/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h
index 649a874e2423..37af105fefe9 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Tetrahedron_3.h
@@ -17,7 +17,7 @@ a <I>negative</I> side.
 The boundary of a tetrahedron splits the space in two open regions, a
 bounded one and an unbounded one.
 
-\cgalModels `Kernel::Tetrahedron_3`
+\cgalModels{Kernel::Tetrahedron_3}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h b/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h
index e19f43bc5226..9004381fb117 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Triangle_2.h
@@ -13,7 +13,7 @@ boundary the negative side.
 The boundary of a triangle splits the plane in
 two open regions, a bounded one and an unbounded one.
 
-\cgalModels `Kernel::Triangle_2`
+\cgalModels{Kernel::Triangle_2}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h b/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h
index d0dadad48b80..cc53d8ad29a4 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Triangle_3.h
@@ -8,7 +8,7 @@ the three-dimensional Euclidean space \f$ \E^3\f$. As the triangle is not
 a full-dimensional object there is only a test whether a point lies on
 the triangle or not.
 
-\cgalModels `Kernel::Triangle_3`
+\cgalModels{Kernel::Triangle_3}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h b/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
index eaeab03a882a..e17775ba6f18 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
@@ -12,8 +12,7 @@ from \f$ p_1\f$ to \f$ p_2\f$.
 will explicitly state where you can pass this constant as an argument
 instead of a vector initialized with zeros.
 
-\cgalModels `Kernel::Vector_2`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::Vector_2,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h b/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h
index d126bd977403..1e114bd44e3d 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Vector_3.h
@@ -12,8 +12,7 @@ from \f$ p_1\f$ to \f$ p_2\f$.
 will explicitly state where you can pass this constant as an argument
 instead of a vector initialized with zeros.
 
-\cgalModels `Kernel::Vector_3`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::Vector_3,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 \sa `cross_product_grp`
 \sa `determinant_grp`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
index 01a147e6d645..fa67214d5a86 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_2.h
@@ -13,8 +13,7 @@ to `NT`, and `Kernel::FT` is equal to `Quotient<NT>`.
 
 \sa `Point_2<Kernel>`
 
-\cgalModels `Kernel::WeightedPoint_2`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::WeightedPoint_2,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 */
 template< typename Kernel >
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h
index 3dcb39e1786b..7765f44daa96 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Weighted_point_3.h
@@ -13,8 +13,7 @@ to `NT`, and `Kernel::FT` is equal to `Quotient<NT>`.
 
 \sa `Point_3<Kernel>`
 
-\cgalModels `Kernel::WeightedPoint_3`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels{Kernel::WeightedPoint_3,Hashable if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`}
 
 */
 template< typename Kernel >
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Cartesian_d.h b/Kernel_d/doc/Kernel_d/CGAL/Cartesian_d.h
index c79c47380c4b..68b1d084db69 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Cartesian_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Cartesian_d.h
@@ -14,7 +14,7 @@ type provided as a model for `FieldNumberType` is only an approximation of a
 field (such as the built-in type `double`), then the geometry provided by
 the kernel is only an approximation of Euclidean geometry.
 
-\cgalModels `KernelWithLifting_d`
+\cgalModels{KernelWithLifting_d}
 
 \sa `CGAL::Homogeneous_d<RingNumberType>`
 
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h b/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h
index 4fcacb5b5841..8d8d24a048d1 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h
@@ -43,11 +43,7 @@ concepts for the rest.
 
 
 
-\cgalModels `Kernel_d`
-\cgalModels `DelaunayTriangulationTraits`
-\cgalModels `RegularTriangulationTraits`
-\cgalModels `SearchTraits`
-\cgalModels `RangeSearchTraits`
+\cgalModels{Kernel_d,DelaunayTriangulationTraits,RegularTriangulationTraits,SearchTraits,RangeSearchTraits}
 
 \sa `CGAL::Cartesian_d<FieldNumberType>`
 \sa `CGAL::Homogeneous_d<RingNumberType>`
@@ -58,8 +54,7 @@ template< typename DimensionTag >
 struct Epeck_d {
 /*!
 represents a point in the Euclidean space
-\cgalModels `DefaultConstructible`
-\cgalModels `Assignable`
+\cgalModels{DefaultConstructible,Assignable}
 */
 class Point_d {
 public:
@@ -87,8 +82,7 @@ Cartesian_const_iterator_d cartesian_end()const;
 
 /*!
 represents a weighted point in the Euclidean space
-\cgalModels `DefaultConstructible`
-\cgalModels `Assignable`
+\cgalModels{DefaultConstructible,Assignable}
 */
 class Weighted_point_d {
 public:
@@ -100,7 +94,7 @@ Point_d point() const;
 double weight() const;
 };
 
-/*! \cgalModels `Kernel_d::Center_of_sphere_d`
+/*! \cgalModels{Kernel_d::Center_of_sphere_d}
  */
 class Construct_circumcenter_d {
 public:
@@ -129,7 +123,7 @@ class Compute_squared_radius_smallest_orthogonal_sphere_d {
 template<class ForwardIterator>
 FT operator()(ForwardIterator first, ForwardIterator last);
 };
-/*! \cgalModels `Kernel_d::Side_of_bounded_sphere_d`
+/*! \cgalModels{Kernel_d::Side_of_bounded_sphere_d}
  */
 class Side_of_bounded_sphere_d {
 public:
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Epick_d.h b/Kernel_d/doc/Kernel_d/CGAL/Epick_d.h
index 4d682670ebfb..b5e67064e9bc 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Epick_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Epick_d.h
@@ -32,11 +32,7 @@ concepts for the rest.
 
 
 
-\cgalModels `Kernel_d`
-\cgalModels `DelaunayTriangulationTraits`
-\cgalModels `RegularTriangulationTraits`
-\cgalModels `SearchTraits`
-\cgalModels `RangeSearchTraits`
+\cgalModels{Kernel_d,DelaunayTriangulationTraits,RegularTriangulationTraits,SearchTraits,RangeSearchTraits}
 
 \sa `CGAL::Cartesian_d<FieldNumberType>`
 \sa `CGAL::Homogeneous_d<RingNumberType>`
@@ -47,8 +43,7 @@ template< typename DimensionTag >
 struct Epick_d {
 /*!
 represents a point in the Euclidean space
-\cgalModels `DefaultConstructible`
-\cgalModels `Assignable`
+\cgalModels{DefaultConstructible,Assignable}
 */
 class Point_d {
 public:
@@ -76,8 +71,7 @@ Cartesian_const_iterator_d cartesian_end()const;
 
 /*!
 represents a weighted point in the Euclidean space
-\cgalModels `DefaultConstructible`
-\cgalModels `Assignable`
+\cgalModels{DefaultConstructible,Assignable}
 */
 class Weighted_point_d {
 public:
@@ -89,7 +83,7 @@ Point_d point() const;
 double weight() const;
 };
 
-/*! \cgalModels `Kernel_d::Center_of_sphere_d`
+/*! \cgalModels{Kernel_d::Center_of_sphere_d}
  */
 class Construct_circumcenter_d {
 public:
@@ -118,7 +112,7 @@ class Compute_squared_radius_smallest_orthogonal_sphere_d {
 template<class ForwardIterator>
 FT operator()(ForwardIterator first, ForwardIterator last);
 };
-/*! \cgalModels `Kernel_d::Side_of_bounded_sphere_d`
+/*! \cgalModels{Kernel_d::Side_of_bounded_sphere_d}
  */
 class Side_of_bounded_sphere_d {
 public:
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Homogeneous_d.h b/Kernel_d/doc/Kernel_d/CGAL/Homogeneous_d.h
index 423caffdf002..0b693eb1b028 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Homogeneous_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Homogeneous_d.h
@@ -14,7 +14,7 @@ type provided as a model for `RingNumberType` is only an approximation of a
 ring (such as the built-in type `double`), then the geometry provided by
 the kernel is only an approximation of Euclidean geometry.
 
-\cgalModels `KernelWithLifting_d`
+\cgalModels{KernelWithLifting_d}
 
 \sa `CGAL::Cartesian_d<FieldNumberType>`
 
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Linear_algebraCd.h b/Kernel_d/doc/Kernel_d/CGAL/Linear_algebraCd.h
index 876daf9cc6c2..41bcb4863e2a 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Linear_algebraCd.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Linear_algebraCd.h
@@ -8,7 +8,7 @@ The class `Linear_algebraCd` serves as the default traits class for the LA
 parameter of `CGAL::Cartesian_d<FT,LA>`. It implements linear
 algebra for field number types `FT`.
 
-\cgalModels `LinearAlgebraTraits_d`
+\cgalModels{LinearAlgebraTraits_d}
 
 \tparam FT must be a field number type.
 
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Linear_algebraHd.h b/Kernel_d/doc/Kernel_d/CGAL/Linear_algebraHd.h
index 37f58d46070f..d170a0bf8ff8 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Linear_algebraHd.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Linear_algebraHd.h
@@ -8,7 +8,7 @@ The class `Linear_algebraHd` serves as the default traits class for the LA
 parameter of `CGAL::Homogeneous_d<RT,LA>`. It implements linear
 algebra for Euclidean ring number types `RT`.
 
-\cgalModels `LinearAlgebraTraits_d`
+\cgalModels{LinearAlgebraTraits_d}
 
 To make a ring number type `RT` work with this class it has to
 provide a division `operator/` with remainder.
diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h
index c951a0735efc..21b8551152d6 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h
@@ -8,7 +8,7 @@ in `d` dimensions.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalModels `BidirectionalIterator`
+\cgalModels{BidirectionalIterator}
 
 \sa `Kernel_d::ConstructCartesianConstIterator_d`
 
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Cell_attribute_with_point.h b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Cell_attribute_with_point.h
index e16404861ca2..f653077d6b84 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Cell_attribute_with_point.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Cell_attribute_with_point.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 The class `Cell_attribute_with_point` represents an attribute containing a point and containing an information when `Info_` is different from `void`. This class can typically be used to associate a point to each 0-cell of a combinatorial or a generalized map.
 
-\cgalModels `CellAttributeWithPoint`
+\cgalModels{CellAttributeWithPoint}
 
 \tparam LCC a model of the `LinearCellComplex` concept.
 \tparam Info_ the type of the information contained in the attribute, `void` for no information. Equal to `void` by default.
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Cell_attribute_with_point_and_id.h b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Cell_attribute_with_point_and_id.h
index 62dbacdd9821..bc8d24854c8e 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Cell_attribute_with_point_and_id.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Cell_attribute_with_point_and_id.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 The class `Cell_attribute_with_point_and_id` represents an attribute containing a point, containing an information when `Info_` is different from `void`, and having an id. This class can typically be used to associate a point with id to each 0-cell of a combinatorial or a generalized map.
 
-\cgalModels `CellAttributeWithPoint`
+\cgalModels{CellAttributeWithPoint}
 
 \tparam LCC a model of the `LinearCellComplex` concept.
 \tparam Info_ the type of the information contained in the attribute, `void` for no information. Equal to `void` by default.
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_for_combinatorial_map.h b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_for_combinatorial_map.h
index e274cdc570b1..0c0e05764637 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_for_combinatorial_map.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_for_combinatorial_map.h
@@ -7,8 +7,7 @@ namespace CGAL {
 The class `Linear_cell_complex_for_combinatorial_map` represents a linear cell complex in dimension `d`, in an ambient space of dimension `d2`, using a combinatorial map as underlying combinatorial data-structure.
 Like for `Combinatorial_map`, two versions exist: one where Darts and non void attributes are stored in memory using `Compact_container`, using `Alloc` as allocator, and use handles as descriptors; a second one where Darts and non void attributes are stored in an internal std::vector like data-structure, and use indices as descriptors. The choice between the two versions is done through the item class.
 
-\cgalModels `LinearCellComplex`
-\cgalModels `CombinatorialMap`
+\cgalModels{LinearCellComplex,CombinatorialMap}
 
 \tparam d the dimension of the combinatorial map.
 \tparam d2 the dimension of the ambient space. Equal to `d` by default.
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_for_generalized_map.h b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_for_generalized_map.h
index 2dd97d9298a2..bf105c68f2e9 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_for_generalized_map.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_for_generalized_map.h
@@ -7,8 +7,7 @@ namespace CGAL {
 The class `Linear_cell_complex_for_generalized_map` represents a linear cell complex in dimension `d`, in an ambient space of dimension `d2`, using a generalized map as underlying combinatorial data-structure.
 Like for `GeneralizedMap`, two versions exist: one where Darts and non void attributes are stored in memory using `Compact_container`, using `Alloc` as allocator, and use handles as descriptors; a second one where Darts and non void attributes are stored in an internal std::vector like data-structure, and use indices as descriptors. The choice between the two versions is done through the item class.
 
-\cgalModels `LinearCellComplex`
-\cgalModels `GeneralizedMap`
+\cgalModels{LinearCellComplex,GeneralizedMap}
 
 \tparam d the dimension of the generalized map.
 \tparam d2 the dimension of the ambient space. Equal to  `d` by default.
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_min_items.h b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_min_items.h
index a9b3bc0ade47..1e489d463ecc 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_min_items.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_min_items.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 The class `Linear_cell_complex_min_items` defines `void` as the information associated with darts, and the attributes used. In this class, 0-attributes are enabled and associated with `Cell_attribute_with_point`.
 
-\cgalModels `LinearCellComplexItems`
+\cgalModels{LinearCellComplexItems}
 
 \cgalHeading{Example}
 
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_traits.h b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_traits.h
index e79db672469c..a1d413849814 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_traits.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/Linear_cell_complex_traits.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 This geometric traits concept is used in the `Linear_cell_complex_for_combinatorial_map` and `Linear_cell_complex_for_generalized_map` classes. It can take as parameter any model of the concept `Kernel` (for example any \cgal kernel), and defines inner types and functors corresponding to the given dimension.
 
-\cgalModels `LinearCellComplexTraits`
+\cgalModels{LinearCellComplexTraits}
 
 \tparam d the dimension of the kernel,
 \tparam K a model of the concept `Kernel` if `d==2` or `d==3`; a model of the concept `Kernel_d` otherwise. Equal by default to `CGAL::Exact_predicates_inexact_constructions_kernel` if `d` is 2 or 3, and is `CGAL::Cartesian_d<double>` otherwise.
diff --git a/Matrix_search/doc/Matrix_search/CGAL/Dynamic_matrix.h b/Matrix_search/doc/Matrix_search/CGAL/Dynamic_matrix.h
index 341f51327f9e..d1c9609cd29a 100644
--- a/Matrix_search/doc/Matrix_search/CGAL/Dynamic_matrix.h
+++ b/Matrix_search/doc/Matrix_search/CGAL/Dynamic_matrix.h
@@ -10,8 +10,7 @@ matrix search.
 
 \tparam M is a model of `BasicMatrix`.
 
-\cgalModels `MonotoneMatrixSearchTraits`
-\cgalModels `BasicMatrix`
+\cgalModels{MonotoneMatrixSearchTraits,BasicMatrix}
 
 \sa `CGAL::monotone_matrix_search()`
 \sa `MonotoneMatrixSearchTraits`
diff --git a/Matrix_search/doc/Matrix_search/CGAL/Sorted_matrix_search_traits_adaptor.h b/Matrix_search/doc/Matrix_search/CGAL/Sorted_matrix_search_traits_adaptor.h
index 0a29ba6117cb..baaacc6af3b8 100644
--- a/Matrix_search/doc/Matrix_search/CGAL/Sorted_matrix_search_traits_adaptor.h
+++ b/Matrix_search/doc/Matrix_search/CGAL/Sorted_matrix_search_traits_adaptor.h
@@ -8,7 +8,7 @@ The class `Sorted_matrix_search_traits_adaptor` can be used
 as an adaptor to create sorted matrix search traits classes for
 arbitrary feasibility test and matrix classes `F` resp.\ `M`.
 
-\cgalModels `SortedMatrixSearchTraits`
+\cgalModels{SortedMatrixSearchTraits}
 
 \tparam M must be a model for `BasicMatrix`
 \tparam F must define a copy constructor and a monotone `bool operator()( const Value&)`.
diff --git a/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_criteria_2.h b/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_criteria_2.h
index 4d465b053f61..fb81215708f2 100644
--- a/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_criteria_2.h
+++ b/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_criteria_2.h
@@ -20,7 +20,7 @@ so \f$ B=\sqrt{2}\f$ corresponds to \f$ \alpha_{min} \ge 20.7\f$ degrees.
 
 \tparam CDT must be a 2D constrained Delaunay triangulation.
 
-\cgalModels `MeshingCriteria_2`
+\cgalModels{MeshingCriteria_2}
 
 
 */
diff --git a/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_face_base_2.h b/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_face_base_2.h
index ac28360e1882..efebf4bef555 100644
--- a/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_face_base_2.h
+++ b/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_face_base_2.h
@@ -22,7 +22,7 @@ be the same as the one used for the Delaunay mesh.
 derives. It must be a model of the `ConstrainedTriangulationFaceBase_2` concept.
 
 
-\cgalModels `DelaunayMeshFaceBase_2`
+\cgalModels{DelaunayMeshFaceBase_2}
 
 */
 template< typename Traits, typename Fb >
diff --git a/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_size_criteria_2.h b/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_size_criteria_2.h
index 6303b537ef8a..17be1408a9cd 100644
--- a/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_size_criteria_2.h
+++ b/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_size_criteria_2.h
@@ -23,7 +23,7 @@ triangles must be shorter than a bound \f$ S\f$.
 
 \tparam CDT must be a 2D constrained Delaunay triangulation.
 
-\cgalModels `MeshingCriteria_2`
+\cgalModels{MeshingCriteria_2}
 
 
 */
diff --git a/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_vertex_base_2.h b/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_vertex_base_2.h
index bbaf9ea44181..be7a7e293942 100644
--- a/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_vertex_base_2.h
+++ b/Mesh_2/doc/Mesh_2/CGAL/Delaunay_mesh_vertex_base_2.h
@@ -17,7 +17,7 @@ be the same as the one used for the Delaunay mesh.
 \tparam Vb is the base class from which `Delaunay_mesh_vertex_base_2`
 derives. It must be a model of the `TriangulationVertexBase_2` concept.
 
-\cgalModels `DelaunayMeshVertexBase_2`
+\cgalModels{DelaunayMeshVertexBase_2}
 
 */
 template< typename Traits, typename Vb >
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Gray_image_mesh_domain_3.h b/Mesh_3/doc/Mesh_3/CGAL/Gray_image_mesh_domain_3.h
index 02428df510e9..eec0beb5a549 100644
--- a/Mesh_3/doc/Mesh_3/CGAL/Gray_image_mesh_domain_3.h
+++ b/Mesh_3/doc/Mesh_3/CGAL/Gray_image_mesh_domain_3.h
@@ -41,7 +41,7 @@ with a model of the concept `BisectionGeometricTraits_3`.
 input file
 
 
-\cgalModels `MeshDomain_3`
+\cgalModels{MeshDomain_3}
 
 \sa `BisectionGeometricTraits_3`
 \sa `CGAL::make_mesh_3()`.
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Implicit_mesh_domain_3.h b/Mesh_3/doc/Mesh_3/CGAL/Implicit_mesh_domain_3.h
index e2595b9d6fb9..853e8cbec4cd 100644
--- a/Mesh_3/doc/Mesh_3/CGAL/Implicit_mesh_domain_3.h
+++ b/Mesh_3/doc/Mesh_3/CGAL/Implicit_mesh_domain_3.h
@@ -41,7 +41,7 @@ when the query segment is smaller than the error bound.
 The `error_bound` passed as argument to the domain constructor
 is a relative error bound expressed as a ratio to the bounding sphere radius.
 
-\cgalModels `MeshDomain_3`
+\cgalModels{MeshDomain_3}
 
 \sa `BisectionGeometricTraits_3`
 \sa `CGAL::make_mesh_3()`.
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Labeled_image_mesh_domain_3.h b/Mesh_3/doc/Mesh_3/CGAL/Labeled_image_mesh_domain_3.h
index 9109b74f1824..eba04731f1a4 100644
--- a/Mesh_3/doc/Mesh_3/CGAL/Labeled_image_mesh_domain_3.h
+++ b/Mesh_3/doc/Mesh_3/CGAL/Labeled_image_mesh_domain_3.h
@@ -34,7 +34,7 @@ intersection tests and intersection computations
 through a bisection method. This parameter must be instantiated
 with a model of the concept `BisectionGeometricTraits_3`.
 
-\cgalModels `MeshDomain_3`
+\cgalModels{MeshDomain_3}
 
 An executable that uses `Labeled_image_mesh_domain_3` must be linked with
 the <I>CGAL_ImageIO</I> library.
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h
index bdba19131c8f..3819c65502b5 100644
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h
+++ b/Mesh_3/doc/Mesh_3/CGAL/Mesh_cell_criteria_3.h
@@ -12,7 +12,7 @@ and a sizing field which may be a uniform or variable field.
 `Triangulation` of the instance used as model of
 `MeshComplex_3InTriangulation_3`.
 
-\cgalModels `MeshCellCriteria_3`
+\cgalModels{MeshCellCriteria_3}
 
 \sa `MeshCriteria_3`
 \sa `CGAL::Mesh_criteria_3<Tr>`
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h
index bfbd79dfe399..9e3720629dce 100644
--- a/Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h
+++ b/Mesh_3/doc/Mesh_3/CGAL/Mesh_facet_criteria_3.h
@@ -14,7 +14,7 @@ for the approximation error criterion.
 `Triangulation` of the instance used as model of
 `MeshComplex_3InTriangulation_3`.
 
-\cgalModels `MeshFacetCriteria_3`
+\cgalModels{MeshFacetCriteria_3}
 
 \sa `CGAL::Mesh_facet_topology`
 \sa `MeshCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h
index a084e25bfcf8..de4489b7cd78 100644
--- a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h
@@ -24,7 +24,7 @@ the intersection tests and intersection computations
 for polyhedral boundary surfaces. This parameter has to be instantiated
 with a model of the concept `IntersectionGeometricTraits_3`.
 
-\cgalModels `MeshDomain_3`
+\cgalModels{MeshDomain_3}
 
 \sa `IntersectionGeometricTraits_3`
 \sa `CGAL::make_mesh_3()`.
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h
index 8ee1140044cd..8951889d690c 100644
--- a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -20,7 +20,7 @@ and functors required to implement the intersection tests and intersection compu
 for polyhedral boundary surfaces. This parameter has to be
 instantiated with a model of the concept `IntersectionGeometricTraits_3`.
 
-\cgalModels `MeshDomainWithFeatures_3`
+\cgalModels{MeshDomainWithFeatures_3}
 
 \sa `CGAL::Mesh_domain_with_polyline_features_3<MD>`
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Triangle_accessor_3.h b/Mesh_3/doc/Mesh_3/CGAL/Triangle_accessor_3.h
index e72ee14e2865..dcdc0175f1d5 100644
--- a/Mesh_3/doc/Mesh_3/CGAL/Triangle_accessor_3.h
+++ b/Mesh_3/doc/Mesh_3/CGAL/Triangle_accessor_3.h
@@ -14,7 +14,7 @@ specialization of this class to handle one's own polyhedron data structure.
 
 \tparam K is the geometric traits class.
 
-\cgalModels `TriangleAccessor_3`
+\cgalModels{TriangleAccessor_3}
 
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
 
diff --git a/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h b/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
index d30acbcb141c..5dad6a137daf 100644
--- a/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
+++ b/Mesh_3/include/CGAL/Compact_mesh_cell_base_3.h
@@ -724,7 +724,7 @@ belong. That parameter is only used by the rebind mechanism (see
 `::TriangulationDSCellBase_3::Rebind_TDS`). Users should always use the
 default parameter value `void`.
 
-\cgalModels `MeshCellBase_3`
+\cgalModels{MeshCellBase_3}
 
 \sa `CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
 \sa `CGAL::Mesh_cell_base_3<GT, MD, Cb>`
diff --git a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
index 50d211ccc1dc..bde7c96a2c38 100644
--- a/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Labeled_mesh_domain_3.h
@@ -338,7 +338,7 @@ if there are several components to mesh.
 
 The function type can be any model of the concept `Callable` compatible with the signature `Subdomain_index(const Point_3&)`: it can be a function, a function object, a lambda expression... that takes a `%Point_3` as argument, and returns a type convertible to `Subdomain_index`.
 
-\cgalModels `MeshDomain_3`
+\cgalModels{MeshDomain_3}
 
 \sa `Implicit_multi_domain_to_labeling_function_wrapper`
 \sa `CGAL::make_mesh_3()`.
diff --git a/Mesh_3/include/CGAL/Mesh_cell_base_3.h b/Mesh_3/include/CGAL/Mesh_cell_base_3.h
index b52243fbbc2d..947c9a5d4f52 100644
--- a/Mesh_3/include/CGAL/Mesh_cell_base_3.h
+++ b/Mesh_3/include/CGAL/Mesh_cell_base_3.h
@@ -117,7 +117,7 @@ of the concept `MeshDomain_3`.
 of the concept `RegularTriangulationCellBaseWithWeightedCircumcenter_3` and defaults to
 `Regular_triangulation_cell_base_with_weighted_circumcenter_3<GT>`.
 
-\cgalModels `MeshCellBase_3`
+\cgalModels{MeshCellBase_3}
 
 \sa `CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
 \sa `CGAL::Compact_mesh_cell_base_3<GT, MD, Tds>`
diff --git a/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h b/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
index 68cb73899a8c..da317cfc29b5 100644
--- a/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
+++ b/Mesh_3/include/CGAL/Mesh_constant_domain_field_3.h
@@ -44,7 +44,7 @@ namespace CGAL {
 * @tparam Index_ is the type of index of the vertices of the triangulation.
 * It must match the type `%Index` of the model of `MeshDomain_3` used in the meshing process.
 *
-* @cgalModels `MeshDomainField_3`
+* @cgalModels{MeshDomainField_3}
 */
 template <typename Gt, typename Index_>
 class Mesh_constant_domain_field_3
diff --git a/Mesh_3/include/CGAL/Mesh_criteria_3.h b/Mesh_3/include/CGAL/Mesh_criteria_3.h
index a6220203a643..96511da5520c 100644
--- a/Mesh_3/include/CGAL/Mesh_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_criteria_3.h
@@ -146,7 +146,7 @@ where `C3T3` is the model of `MeshComplex_3InTriangulation_3`
 used in the mesh generation process,
 and `C3T3::Triangulation` its nested triangulation type.
 
-\cgalModels `MeshCriteria_3` and `MeshCriteriaWithFeatures_3`
+\cgalModels{MeshCriteria_3,MeshCriteriaWithFeatures_3}
 
 \cgalHeading{Example}
 
diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 00aa58d54cdd..4e7ebb4e515d 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -526,7 +526,7 @@ whose endpoints are the added corners.
 of the domain which should be extended.
 It has to be a model of the `MeshDomain_3` concept.
 
-\cgalModels `MeshDomainWithFeatures_3`
+\cgalModels{MeshDomainWithFeatures_3}
 
 \sa `MeshDomain_3`
 \sa `MeshPolyline_3`
diff --git a/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h b/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
index 8846555dc6b7..f85f3a82ec87 100644
--- a/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_edge_criteria_3.h
@@ -91,7 +91,7 @@ namespace internal {
 The function object class `Mesh_edge_criteria_3` is a model of `MeshEdgeCriteria_3`. It
 provides a bound for the size criterion.
 
-\cgalModels `MeshEdgeCriteria_3`
+\cgalModels{MeshEdgeCriteria_3}
 
 \sa `MeshCriteria_3`
 \sa `CGAL::Mesh_criteria_3<Tr>`
diff --git a/Mesh_3/include/CGAL/Mesh_vertex_base_3.h b/Mesh_3/include/CGAL/Mesh_vertex_base_3.h
index 1dbfac05a505..2cf97e4bdc1e 100644
--- a/Mesh_3/include/CGAL/Mesh_vertex_base_3.h
+++ b/Mesh_3/include/CGAL/Mesh_vertex_base_3.h
@@ -309,7 +309,7 @@ of the concept `MeshDomain_3`.
 of the concept `RegularTriangulationVertexBase_3` and defaults to
 `Regular_triangulation_vertex_base_3<GT>`.
 
-\cgalModels `MeshVertexBase_3`
+\cgalModels{MeshVertexBase_3}
 
 \sa `CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
 */
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index ce6de8775be8..e56b1cac8fb4 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -91,7 +91,7 @@ the intersection tests and intersection computations
 for polyhedral boundary surfaces. This parameter has to be instantiated
 with a model of the concept `IntersectionGeometricTraits_3`.
 
-\cgalModels `MeshDomainWithFeatures_3`
+\cgalModels{MeshDomainWithFeatures_3}
 
 \sa `IntersectionGeometricTraits_3`
 \sa `CGAL::make_mesh_3()`.
diff --git a/Mesh_3/include/CGAL/Sizing_field_with_aabb_tree.h b/Mesh_3/include/CGAL/Sizing_field_with_aabb_tree.h
index b3a0379c989e..98876732ded8 100644
--- a/Mesh_3/include/CGAL/Sizing_field_with_aabb_tree.h
+++ b/Mesh_3/include/CGAL/Sizing_field_with_aabb_tree.h
@@ -59,7 +59,7 @@ namespace CGAL {
 * and derive from `CGAL::Polyhedral_mesh_domain_with_features_3`
 
 
-* @cgalModels `MeshDomainField_3`
+* @cgalModels{MeshDomainField_3}
 */
 template <typename GeomTraits,
           typename MeshDomain
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h
index eb8a49f43541..c07b7173a90d 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h
@@ -14,7 +14,7 @@ than four times the size of the optimal decomposition.
 \tparam Container must be a container that can be used for the polygon.
 It is by default `std::vector<typename Kernel::Point_2>`.
 
-\cgalModels `PolygonConvexDecomposition_2`
+\cgalModels{PolygonConvexDecomposition_2}
 
 \sa `CGAL::greene_approx_convex_partition_2()`
 
@@ -47,7 +47,7 @@ optimal decomposition.
 \tparam Container must be a container that can be used for the polygon.
 It is by default `std::vector<typename Kernel::Point_2>`.
 
-\cgalModels `PolygonConvexDecomposition_2`
+\cgalModels{PolygonConvexDecomposition_2}
 
 \sa `CGAL::approx_convex_partition_2()`
 
@@ -77,7 +77,7 @@ the worst case, where \f$ n\f$ is the size of the input polygon.
 \tparam Container must be a container that can be used for the polygon.
 It is by default `std::vector<typename Kernel::Point_2>`.
 
-\cgalModels `PolygonConvexDecomposition_2`
+\cgalModels{PolygonConvexDecomposition_2}
 
 \sa `CGAL::optimal_convex_partition_2()`
 
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_nop_decomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_nop_decomposition_2.h
index b2843d722dcd..7bace4bd09da 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_nop_decomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_nop_decomposition_2.h
@@ -8,7 +8,7 @@ decomposition of a polygon, which merely passes the input polygon to
 the list of output convex polygons. It should be used when it is known
 that the input polygon is convex to start with.
 
-\cgalModels `PolygonConvexDecomposition_2`
+\cgalModels{PolygonConvexDecomposition_2}
 
 */
 template <typename Kernel, typename Container>
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_triangulation_decomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_triangulation_decomposition_2.h
index 4dd0cf19ca07..a49e176adcf9 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_triangulation_decomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_triangulation_decomposition_2.h
@@ -8,7 +8,7 @@ decomposition of a polygon or a polygon with holes into triangles using
 the Delaunay constrained triangulation functionality of the
 \ref Chapter_2D_Triangulations "2D Triangulation" package.
 
-\cgalModels `PolygonWithHolesConvexDecomposition_2`
+\cgalModels{PolygonWithHolesConvexDecomposition_2}
 
 */
 template <typename Kernel, typename Container>
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_vertical_decomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_vertical_decomposition_2.h
index 132f04b2963f..a04aada17493 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_vertical_decomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_vertical_decomposition_2.h
@@ -12,7 +12,7 @@ The algorithm operates in \f$ O(n \log n)\f$ time and takes
 \f$ O(n)\f$ space at the worst case, where \f$ n\f$ is the
 size of the input polygon.
 
-\cgalModels `PolygonWithHolesConvexDecomposition_2`
+\cgalModels{PolygonWithHolesConvexDecomposition_2}
 
 */
 template <typename Kernel, typename Container>
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Small_side_angle_bisector_decomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Small_side_angle_bisector_decomposition_2.h
index 8688bbd2de93..09cc436f10c8 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Small_side_angle_bisector_decomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Small_side_angle_bisector_decomposition_2.h
@@ -15,7 +15,7 @@ the angle bisector of the reflex vertex. The algorithm operates in
 \f$ O(n^2)\f$ time and takes \f$ O(n)\f$ space at the worst case, where
 \f$ n\f$ is the size of the input polygon.
 
-\cgalModels `PolygonConvexDecomposition_2`
+\cgalModels{PolygonConvexDecomposition_2}
 
 */
 template <typename Kernel, typename Container>
diff --git a/Miscellany/doc/Miscellany/CGAL/Handle_hash_function.h b/Miscellany/doc/Miscellany/CGAL/Handle_hash_function.h
index 89f0849e8005..a02143d52318 100644
--- a/Miscellany/doc/Miscellany/CGAL/Handle_hash_function.h
+++ b/Miscellany/doc/Miscellany/CGAL/Handle_hash_function.h
@@ -10,7 +10,7 @@ functionality, such as handles, iterators, and circulators.
 Specifically, for a `key` value the expression `&*key` must
 return a unique address.
 
-\cgalModels `UniqueHashFunction`
+\cgalModels{UniqueHashFunction}
 
 \sa `CGAL::Unique_hash_map<Key,Data,UniqueHashFunction>`
 
diff --git a/Modular_arithmetic/doc/Modular_arithmetic/CGAL/Modular_traits.h b/Modular_arithmetic/doc/Modular_arithmetic/CGAL/Modular_traits.h
index afc8672cc4b0..5814ee5e9676 100644
--- a/Modular_arithmetic/doc/Modular_arithmetic/CGAL/Modular_traits.h
+++ b/Modular_arithmetic/doc/Modular_arithmetic/CGAL/Modular_traits.h
@@ -7,7 +7,7 @@ namespace CGAL {
 An instance of `Modular_traits` is a model of `ModularTraits`,
 where <span class="textsc">T</span> is the associated type.
 
-\cgalModels `ModularTraits`
+\cgalModels{ModularTraits}
 
 */
 template< typename T >
diff --git a/Modular_arithmetic/doc/Modular_arithmetic/CGAL/Residue.h b/Modular_arithmetic/doc/Modular_arithmetic/CGAL/Residue.h
index 706830fcc4fa..02011c98a2c5 100644
--- a/Modular_arithmetic/doc/Modular_arithmetic/CGAL/Residue.h
+++ b/Modular_arithmetic/doc/Modular_arithmetic/CGAL/Residue.h
@@ -43,7 +43,7 @@ penalty. Hence, it may be advisable to configure \cgal with
 `CGAL_HAS_NO_THREADS`.   See Section  \ref Preliminaries_thread_safety "Thread Safety"
 in the preliminaries.
 
-\cgalModels `Field`
+\cgalModels{Field}
 
 */
 
diff --git a/Nef_2/doc/Nef_2/CGAL/Extended_cartesian.h b/Nef_2/doc/Nef_2/CGAL/Extended_cartesian.h
index 4bb5cb0eaca5..4632460207d0 100644
--- a/Nef_2/doc/Nef_2/CGAL/Extended_cartesian.h
+++ b/Nef_2/doc/Nef_2/CGAL/Extended_cartesian.h
@@ -8,7 +8,7 @@ The class `Extended_cartesian` serves as a traits class for the class
 `Nef_polyhedron_2<T>`. It uses a polynomial component
 representation based on a field number type `FT`.
 
-\cgalModels `ExtendedKernelTraits_2`
+\cgalModels{ExtendedKernelTraits_2}
 
 \tparam FT  must be a model of `FieldNumberType`.
 
diff --git a/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h b/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h
index ae3aec7f350b..bd26fea58ace 100644
--- a/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h
+++ b/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h
@@ -8,7 +8,7 @@ The class `Extended_homogeneous` serves as a traits class for the class
 `Nef_polyhedron_2<T>`. It uses a polynomial component
 representation based on a Euclidean ring number type `RT`.
 
-\cgalModels `ExtendedKernelTraits_2`
+\cgalModels{ExtendedKernelTraits_2}
 
 
 \tparam RT  must be a model of `RingNumberType`.
diff --git a/Nef_2/doc/Nef_2/CGAL/Filtered_extended_homogeneous.h b/Nef_2/doc/Nef_2/CGAL/Filtered_extended_homogeneous.h
index 63e3cda8e225..064f786c8b43 100644
--- a/Nef_2/doc/Nef_2/CGAL/Filtered_extended_homogeneous.h
+++ b/Nef_2/doc/Nef_2/CGAL/Filtered_extended_homogeneous.h
@@ -8,7 +8,7 @@ The class `Filtered_extended_homogeneous` serves as a traits class for the class
 `Nef_polyhedron_2<T>`. It uses a polynomial component
 representation based on a ring number type `RT`.
 
-\cgalModels `ExtendedKernelTraits_2`
+\cgalModels{ExtendedKernelTraits_2}
 
 \tparam RT  must be a model of `RingNumberType`.
 
diff --git a/Number_types/doc/Number_types/CGAL/CORE_BigFloat.h b/Number_types/doc/Number_types/CGAL/CORE_BigFloat.h
index 754985917d94..f6a7d5f1576f 100644
--- a/Number_types/doc/Number_types/CGAL/CORE_BigFloat.h
+++ b/Number_types/doc/Number_types/CGAL/CORE_BigFloat.h
@@ -14,9 +14,7 @@ This number type is provided by the \core library \cgalCite{klpy-clp-99}.
 \cgal defines the necessary functions so that this class complies to the
 requirements on number types.
 
-\cgalModels `FieldWithKthRoot`
-\cgalModels `RealEmbeddable`
-\cgalModels `FromDoubleConstructible`
+\cgalModels{FieldWithKthRoot,RealEmbeddable,FromDoubleConstructible}
 
 */
 
diff --git a/Number_types/doc/Number_types/CGAL/CORE_BigInt.h b/Number_types/doc/Number_types/CGAL/CORE_BigInt.h
index 6e3f81effc15..2fcd05b6b7f3 100644
--- a/Number_types/doc/Number_types/CGAL/CORE_BigInt.h
+++ b/Number_types/doc/Number_types/CGAL/CORE_BigInt.h
@@ -12,8 +12,7 @@ This number type is provided by the \core library \cgalCite{klpy-clp-99}.
 \cgal defines the necessary functions so that this class complies to the
 requirements on number types.
 
-\cgalModels `EuclideanRing`
-\cgalModels `RealEmbeddable`
+\cgalModels{EuclideanRing,RealEmbeddable}
 
 */
 
diff --git a/Number_types/doc/Number_types/CGAL/CORE_BigRat.h b/Number_types/doc/Number_types/CGAL/CORE_BigRat.h
index 672adee91df9..12c57a6c30e5 100644
--- a/Number_types/doc/Number_types/CGAL/CORE_BigRat.h
+++ b/Number_types/doc/Number_types/CGAL/CORE_BigRat.h
@@ -10,10 +10,7 @@ This number type is provided by the \core library \cgalCite{klpy-clp-99}.
 \cgal defines the necessary functions so that this class complies to the
 requirements on number types.
 
-\cgalModels `Field`
-\cgalModels `RealEmbeddable`
-\cgalModels `Fraction`
-\cgalModels `FromDoubleConstructible`
+\cgalModels{Field,RealEmbeddable,Fraction,FromDoubleConstructible}
 
 */
 
diff --git a/Number_types/doc/Number_types/CGAL/CORE_Expr.h b/Number_types/doc/Number_types/CGAL/CORE_Expr.h
index ac6805b89148..bbe851d5fc3a 100644
--- a/Number_types/doc/Number_types/CGAL/CORE_Expr.h
+++ b/Number_types/doc/Number_types/CGAL/CORE_Expr.h
@@ -13,9 +13,7 @@ This number type is provided by the
 \cgal defines the necessary functions so that this class complies to the
 requirements on number types.
 
-\cgalModels `FieldWithRootOf`
-\cgalModels `RealEmbeddable`
-\cgalModels `FromDoubleConstructible`
+\cgalModels{FieldWithRootOf,RealEmbeddable,FromDoubleConstructible}
 
 */
 class Expr {
diff --git a/Number_types/doc/Number_types/CGAL/Gmpfi.h b/Number_types/doc/Number_types/CGAL/Gmpfi.h
index 3b54efc175fd..b48623b22129 100644
--- a/Number_types/doc/Number_types/CGAL/Gmpfi.h
+++ b/Number_types/doc/Number_types/CGAL/Gmpfi.h
@@ -18,8 +18,7 @@ This type is `ImplicitInteroperable` with `Gmpfr`, `Gmpz`,
 `Gmpq`, <TT>long</TT>, <TT>unsigned long</TT>, <TT>int</TT>, <TT>double</TT>
 and <TT>long double</TT>.
 
-\cgalModels `FieldWithKthRoot`
-\cgalModels `RealEmbeddable`
+\cgalModels{FieldWithKthRoot,RealEmbeddable}
 
 \cgalHeading{Implementation}
 
diff --git a/Number_types/doc/Number_types/CGAL/Gmpfr.h b/Number_types/doc/Number_types/CGAL/Gmpfr.h
index c664a209f0f1..78ee816943f2 100644
--- a/Number_types/doc/Number_types/CGAL/Gmpfr.h
+++ b/Number_types/doc/Number_types/CGAL/Gmpfr.h
@@ -23,8 +23,7 @@ used is `std::float_round_style`.
 This type is `ImplicitInteroperable` with `Gmpz`, <TT>long</TT>,
 <TT>unsigned long</TT>, <TT>int</TT>, <TT>double</TT> and <TT>long double</TT>.
 
-\cgalModels `FieldWithKthRoot`
-\cgalModels `RealEmbeddable`
+\cgalModels{FieldWithKthRoot,RealEmbeddable}
 
 \cgalHeading{Comparisons}
 
diff --git a/Number_types/doc/Number_types/CGAL/Gmpq.h b/Number_types/doc/Number_types/CGAL/Gmpq.h
index c399e69e83d4..f885758460f7 100644
--- a/Number_types/doc/Number_types/CGAL/Gmpq.h
+++ b/Number_types/doc/Number_types/CGAL/Gmpq.h
@@ -7,9 +7,7 @@ namespace CGAL {
 An object of the class `Gmpq` is an arbitrary precision rational
 number based on the \gmp library.
 
-\cgalModels `Field`
-\cgalModels `RealEmbeddable`
-\cgalModels `Fraction`
+\cgalModels{Field,RealEmbeddable,Fraction}
 
 \cgalHeading{Implementation}
 
diff --git a/Number_types/doc/Number_types/CGAL/Gmpz.h b/Number_types/doc/Number_types/CGAL/Gmpz.h
index 2eb6873a8373..b110329d7d3b 100644
--- a/Number_types/doc/Number_types/CGAL/Gmpz.h
+++ b/Number_types/doc/Number_types/CGAL/Gmpz.h
@@ -7,8 +7,7 @@ namespace CGAL {
 An object of the class `Gmpz` is an arbitrary precision integer
 based on the \gmp Library.
 
-\cgalModels `EuclideanRing`
-\cgalModels `RealEmbeddable`
+\cgalModels{EuclideanRing,RealEmbeddable}
 
 \cgalHeading{Implementation}
 
diff --git a/Number_types/doc/Number_types/CGAL/Gmpzf.h b/Number_types/doc/Number_types/CGAL/Gmpzf.h
index fd0e02c87100..876bd37069fd 100644
--- a/Number_types/doc/Number_types/CGAL/Gmpzf.h
+++ b/Number_types/doc/Number_types/CGAL/Gmpzf.h
@@ -11,8 +11,7 @@ is of type `long`. This type can be considered exact, even if the
 exponent is not a multiple-precision number. This number type offers
 functionality very similar to `MP_Float` but is generally faster.
 
-\cgalModels `EuclideanRing`
-\cgalModels `RealEmbeddable`
+\cgalModels{EuclideanRing,RealEmbeddable}
 
 \cgalHeading{Implementation}
 
diff --git a/Number_types/doc/Number_types/CGAL/Interval_nt.h b/Number_types/doc/Number_types/CGAL/Interval_nt.h
index 97c5dd7a45c0..89dad6cced35 100644
--- a/Number_types/doc/Number_types/CGAL/Interval_nt.h
+++ b/Number_types/doc/Number_types/CGAL/Interval_nt.h
@@ -46,8 +46,7 @@ take care about setting the rounding mode towards plus infinity before
 doing any computations with the interval class. He can do so using the
 `Protect_FPU_rounding` class for example.
 
-\cgalModels `FieldWithSqrt`
-\cgalModels `RealEmbeddable`
+\cgalModels{FieldWithSqrt,RealEmbeddable}
 
 \cgalHeading{Example}
 
diff --git a/Number_types/doc/Number_types/CGAL/Lazy_exact_nt.h b/Number_types/doc/Number_types/CGAL/Lazy_exact_nt.h
index 03b0097a9035..8d225da3b088 100644
--- a/Number_types/doc/Number_types/CGAL/Lazy_exact_nt.h
+++ b/Number_types/doc/Number_types/CGAL/Lazy_exact_nt.h
@@ -26,9 +26,8 @@ least model of concept `IntegralDomainWithoutDivision`.
 Note that some filtering mechanism is available at the predicate level
 using `Filtered_predicate` and `Filtered_kernel`.
 
-\cgalModels `IntegralDomainWithoutDivision` same as `NT`
-\cgalModels `RealEmbeddable`
-\cgalModels `Fraction`, if `NT` is a `Fraction`
+\cgalModels{IntegralDomainWithoutDivision same as `NT`,RealEmbeddable,
+             Fraction, if `NT` is a `Fraction`}
 
 \cgalHeading{Example}
 
diff --git a/Number_types/doc/Number_types/CGAL/MP_Float.h b/Number_types/doc/Number_types/CGAL/MP_Float.h
index c5fd2d199398..6f3b097d71b6 100644
--- a/Number_types/doc/Number_types/CGAL/MP_Float.h
+++ b/Number_types/doc/Number_types/CGAL/MP_Float.h
@@ -18,8 +18,7 @@ limited by the available memory, the exponent is currently represented by a
 (integral valued) `double`, which can overflow in some circumstances. We
 plan to also have a multiprecision exponent to fix this issue.
 
-\cgalModels `EuclideanRing`
-\cgalModels `RealEmbeddable`
+\cgalModels{EuclideanRing,RealEmbeddable}
 
 \cgalHeading{Implementation}
 
diff --git a/Number_types/doc/Number_types/CGAL/Mpzf.h b/Number_types/doc/Number_types/CGAL/Mpzf.h
index 6844b33bdac5..0de6ce167cd4 100644
--- a/Number_types/doc/Number_types/CGAL/Mpzf.h
+++ b/Number_types/doc/Number_types/CGAL/Mpzf.h
@@ -14,8 +14,7 @@ normalized finite floating point number represents exactly that number.
 This number type offers functionality very
 similar to `MP_Float` and `Gmpzf` but is faster.
 
-\cgalModels `IntegralDomainWithoutDivision`
-\cgalModels `RealEmbeddable`
+\cgalModels{IntegralDomainWithoutDivision,RealEmbeddable}
 
 \cgalHeading{Implementation}
 
diff --git a/Number_types/doc/Number_types/CGAL/NT_converter.h b/Number_types/doc/Number_types/CGAL/NT_converter.h
index 874d6b7f78ff..d0d649f6df33 100644
--- a/Number_types/doc/Number_types/CGAL/NT_converter.h
+++ b/Number_types/doc/Number_types/CGAL/NT_converter.h
@@ -5,7 +5,7 @@ namespace CGAL {
 
 A number type converter usable as default, for `Cartesian_converter` and `Homogeneous_converter`.
 
-\cgalModels `AdaptableFunctor`
+\cgalModels{AdaptableFunctor}
 
 */
 template < class NT1, class NT2 >
diff --git a/Number_types/doc/Number_types/CGAL/Number_type_checker.h b/Number_types/doc/Number_types/CGAL/Number_type_checker.h
index 06002e878de8..b28eb4db2922 100644
--- a/Number_types/doc/Number_types/CGAL/Number_type_checker.h
+++ b/Number_types/doc/Number_types/CGAL/Number_type_checker.h
@@ -19,8 +19,7 @@ as first argument, and `NT2` as second. The `Comparator` parameter
 has a default value which is a functor calling `operator==` between
 the two arguments.
 
-\cgalModels `IntegralDomainWithoutDivision` (same as `NT1`)
-\cgalModels `RealEmbeddable`
+\cgalModels{IntegralDomainWithoutDivision (same as `NT1`),RealEmbeddable}
 
 \cgalHeading{Operations}
 
diff --git a/Number_types/doc/Number_types/CGAL/Quotient.h b/Number_types/doc/Number_types/CGAL/Quotient.h
index f24d5b3b7d59..f32d724806f9 100644
--- a/Number_types/doc/Number_types/CGAL/Quotient.h
+++ b/Number_types/doc/Number_types/CGAL/Quotient.h
@@ -15,9 +15,7 @@ A `Quotient<NT>` `q` is represented as a pair of
 \tparam NT must be at least model of concept `IntegralDomainWithoutDivision`
 and a model of concept `RealEmbeddable`.
 
-\cgalModels `Field`
-\cgalModels `RealEmbeddable`
-\cgalModels `Fraction`
+\cgalModels{Field,RealEmbeddable,Fraction}
 
 \cgalHeading{Operations}
 
diff --git a/Number_types/doc/Number_types/CGAL/Sqrt_extension.h b/Number_types/doc/Number_types/CGAL/Sqrt_extension.h
index a52f55780dc3..494da54aa4b9 100644
--- a/Number_types/doc/Number_types/CGAL/Sqrt_extension.h
+++ b/Number_types/doc/Number_types/CGAL/Sqrt_extension.h
@@ -87,14 +87,14 @@ The fourth template argument, `FilterPredicates`, triggers an internal filter th
 
 In case `NT` is not `RealEmbeddable`, `DifferentExtensionComparable` as well as `FilterPredicates` have no effect.
 
-\cgalModels `Assignable`
-\cgalModels `CopyConstructible`
-\cgalModels `DefaultConstructible`
-\cgalModels `EqualityComparable`
-\cgalModels `ImplicitInteroperable` with `int`
-\cgalModels `ImplicitInteroperable` with `NT`
-\cgalModels `Fraction` if NT is a `Fraction`
-\cgalModels `RootOf_2`
+\cgalModelsBare{`Assignable`\n
+            `CopyConstructible`\n
+            `DefaultConstructible`\n
+            `EqualityComparable`\n
+            `ImplicitInteroperable` with `int`\n
+            `ImplicitInteroperable` with `NT`\n
+            `Fraction` if NT is a `Fraction`\n
+            `RootOf_2`}
 
 \sa `IntegralDomainWithoutDivision`
 \sa `IntegralDomain`
diff --git a/Number_types/doc/Number_types/CGAL/double.h b/Number_types/doc/Number_types/CGAL/double.h
index c38a596c0ccd..5c48d4332c84 100644
--- a/Number_types/doc/Number_types/CGAL/double.h
+++ b/Number_types/doc/Number_types/CGAL/double.h
@@ -7,8 +7,7 @@ type `double` is a model of the concepts `RealEmbeddable` and
 `Field`. Due to rounding errors and overflow `double` is considered as
 not exact.
 
-\cgalModels `FieldWithSqrt`
-\cgalModels `RealEmbeddable`
+\cgalModels{FieldWithSqrt,RealEmbeddable}
 */
 
 
diff --git a/Number_types/doc/Number_types/CGAL/float.h b/Number_types/doc/Number_types/CGAL/float.h
index 26028a3a46e4..84f782c4d82c 100644
--- a/Number_types/doc/Number_types/CGAL/float.h
+++ b/Number_types/doc/Number_types/CGAL/float.h
@@ -9,8 +9,7 @@ This header provides all necessary functions so the fundamental type
 `FieldWithSqrt`. Due to rounding errors and overflow `float` is
 considered as not exact.
 
-\cgalModels `FieldWithSqrt`
-\cgalModels `RealEmbeddable`
+\cgalModels{FieldWithSqrt,RealEmbeddable}
 
 */
 
diff --git a/Number_types/doc/Number_types/CGAL/gmpxx.h b/Number_types/doc/Number_types/CGAL/gmpxx.h
index 4d93317f45dd..b6c19f423289 100644
--- a/Number_types/doc/Number_types/CGAL/gmpxx.h
+++ b/Number_types/doc/Number_types/CGAL/gmpxx.h
@@ -9,9 +9,7 @@ provided by \gmp.
 CGAL provides the necessary functions to make it compliant to the number type
 concept.
 
-\cgalModels `Field`
-\cgalModels `RealEmbeddable`
-\cgalModels `Fraction`
+\cgalModels{Field,RealEmbeddable,Fraction}
 
 See the \gmp documentation for additional details.
 
@@ -31,8 +29,7 @@ provided by \gmp.
 CGAL provides the necessary functions to make it compliant to the number type
 concept.
 
-\cgalModels `EuclideanRing`
-\cgalModels `RealEmbeddable`
+\cgalModels{EuclideanRing,RealEmbeddable}
 
 See the \gmp documentation for additional details.
 
diff --git a/Number_types/doc/Number_types/CGAL/leda_bigfloat.h b/Number_types/doc/Number_types/CGAL/leda_bigfloat.h
index 41c8e6b54252..8fbca4b8517b 100644
--- a/Number_types/doc/Number_types/CGAL/leda_bigfloat.h
+++ b/Number_types/doc/Number_types/CGAL/leda_bigfloat.h
@@ -12,9 +12,7 @@ Rounding mode and precision (i.e.\ mantissa length) of
 
 For more details on the number types of \leda we refer to the \leda manual \cgalCite{cgal:as-lum}.
 
-\cgalModels `FieldWithKthRoot`
-\cgalModels `RealEmbeddable`
-\cgalModels `FromDoubleConstructible`
+\cgalModels{FieldWithKthRoot,RealEmbeddable,FromDoubleConstructible}
 
 */
 
diff --git a/Number_types/doc/Number_types/CGAL/leda_integer.h b/Number_types/doc/Number_types/CGAL/leda_integer.h
index f0f5de4602c6..ad7009c6fd23 100644
--- a/Number_types/doc/Number_types/CGAL/leda_integer.h
+++ b/Number_types/doc/Number_types/CGAL/leda_integer.h
@@ -8,8 +8,7 @@ The class `leda_integer` is a wrapper class that provides the functions
 needed to use the number type `leda::integer`, representing exact
 multiprecision integers provided by \leda.
 
-\cgalModels `EuclideanRing`
-\cgalModels `RealEmbeddable`
+\cgalModels{EuclideanRing,RealEmbeddable}
 
 For more details on the number types of \leda we refer to the \leda manual \cgalCite{cgal:as-lum}.
 
diff --git a/Number_types/doc/Number_types/CGAL/leda_rational.h b/Number_types/doc/Number_types/CGAL/leda_rational.h
index 7c2add08b97d..8cfc60ea942b 100644
--- a/Number_types/doc/Number_types/CGAL/leda_rational.h
+++ b/Number_types/doc/Number_types/CGAL/leda_rational.h
@@ -7,10 +7,7 @@ The class `leda_rational` is a wrapper class that provides the functions
 needed to use the number type `rational`, representing exact
 multiprecision rational numbers provided by \leda.
 
-\cgalModels `Field`
-\cgalModels `RealEmbeddable`
-\cgalModels `Fraction`
-\cgalModels `FromDoubleConstructible`
+\cgalModels{Field,RealEmbeddable,Fraction,FromDoubleConstructible}
 
 For more details on the number types of \leda we refer to the \leda manual \cgalCite{cgal:as-lum}.
 */
diff --git a/Number_types/doc/Number_types/CGAL/leda_real.h b/Number_types/doc/Number_types/CGAL/leda_real.h
index f13dfa7aa724..131ba0839e68 100644
--- a/Number_types/doc/Number_types/CGAL/leda_real.h
+++ b/Number_types/doc/Number_types/CGAL/leda_real.h
@@ -12,9 +12,7 @@ numbers that contains integers, and which is closed by the operations
 Operations and comparisons between objects of this type are guaranteed
 to be exact.
 
-\cgalModels `FieldWithRootOf`
-\cgalModels `RealEmbeddable`
-\cgalModels `FromDoubleConstructible`
+\cgalModels{FieldWithRootOf,RealEmbeddable,FromDoubleConstructible}
 
 For more details on the number types of \leda we refer to the \leda manual \cgalCite{cgal:as-lum}.
 
diff --git a/Number_types/doc/Number_types/CGAL/long_long.h b/Number_types/doc/Number_types/CGAL/long_long.h
index 750c18fdfa9d..be91260dc599 100644
--- a/Number_types/doc/Number_types/CGAL/long_long.h
+++ b/Number_types/doc/Number_types/CGAL/long_long.h
@@ -5,5 +5,4 @@
 /// type `long long int` is an `RealEmbeddable` `EuclideanRing`. Due
 /// to overflow `long long int` is considered as not exact.
 ///
-/// \cgalModels `EuclideanRing`
-/// \cgalModels `RealEmbeddable`
+/// \cgalModels{EuclideanRing,cgalModels RealEmbeddable}
diff --git a/Number_types/doc/Number_types/CGAL/utils_classes.h b/Number_types/doc/Number_types/CGAL/utils_classes.h
index 0e6ef4fc72c6..ac0a83c61914 100644
--- a/Number_types/doc/Number_types/CGAL/utils_classes.h
+++ b/Number_types/doc/Number_types/CGAL/utils_classes.h
@@ -11,7 +11,7 @@ For example, an expression like
 `NT(0)/NT(0)` can result in an invalid number.
 Routines may have as a precondition that all values are valid.
 
-\cgalModels `AdaptableFunctor`
+\cgalModels{AdaptableFunctor}
 
 */
 template< typename T >
@@ -43,7 +43,7 @@ The default value for `Less` is `std::less`.
 Note that `T` must be a model of `LessThanComparable`
 in case `std::less` is used.
 
-\cgalModels `AdaptableFunctor`
+\cgalModels{AdaptableFunctor}
 
 */
 template< typename T, typename Less >
@@ -90,7 +90,7 @@ The default value for `Less` is `std::less`.
 Note that `T` must be a model of `LessThanComparable`
 in case `std::less` is used.
 
-\cgalModels `AdaptableFunctor`
+\cgalModels{AdaptableFunctor}
 
 */
 template< typename T, typename Less >
diff --git a/Number_types/include/CGAL/Exact_algebraic.h b/Number_types/include/CGAL/Exact_algebraic.h
index 4abdf5967846..8a911b0b102a 100644
--- a/Number_types/include/CGAL/Exact_algebraic.h
+++ b/Number_types/include/CGAL/Exact_algebraic.h
@@ -37,10 +37,7 @@ It is a typedef of another number type. Its exact definition depends on
 the availability the third-party libraries \core, and \leda. \cgal must
 be configured with at least one of those libraries.
 
-\cgalModels `FieldWithSqrt`
-\cgalModels `RealEmbeddable`
-\cgalModels `Fraction`
-\cgalModels `FromDoubleConstructible`
+\cgalModels{FieldWithSqrt,RealEmbeddable,Fraction,FromDoubleConstructible}
 
 */
 #if DOXYGEN_RUNNING
diff --git a/Number_types/include/CGAL/Exact_integer.h b/Number_types/include/CGAL/Exact_integer.h
index 3ba3fb9816a6..614045bbbae5 100644
--- a/Number_types/include/CGAL/Exact_integer.h
+++ b/Number_types/include/CGAL/Exact_integer.h
@@ -30,8 +30,7 @@ It is a typedef of another number type. Its exact definition depends on
 the availability the third-party libraries \gmp, \core, and \leda. \cgal must
 be configured with at least one of those libraries.
 
-\cgalModels `EuclideanRing`
-\cgalModels `RealEmbeddable`
+\cgalModels{EuclideanRing,RealEmbeddable}
 
 */
 #if DOXYGEN_RUNNING
diff --git a/Number_types/include/CGAL/Exact_rational.h b/Number_types/include/CGAL/Exact_rational.h
index f07c61d42a95..903b64b6518f 100644
--- a/Number_types/include/CGAL/Exact_rational.h
+++ b/Number_types/include/CGAL/Exact_rational.h
@@ -30,10 +30,7 @@ It is a typedef of another number type. Its exact definition depends on
 the availability the third-party libraries \gmp, \core, and \leda. \cgal must
 be configured with at least one of those libraries.
 
-\cgalModels `Field`
-\cgalModels `RealEmbeddable`
-\cgalModels `Fraction`
-\cgalModels `FromDoubleConstructible`
+\cgalModels{Field,RealEmbeddable,Fraction,FromDoubleConstructible}
 
 */
 #if DOXYGEN_RUNNING
diff --git a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/Oriented_bounding_box_traits_3.h b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/Oriented_bounding_box_traits_3.h
index 01cd1df588cc..4ce23d3d00e5 100644
--- a/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/Oriented_bounding_box_traits_3.h
+++ b/Optimal_bounding_box/include/CGAL/Optimal_bounding_box/Oriented_bounding_box_traits_3.h
@@ -36,7 +36,7 @@ namespace CGAL {
 ///
 /// \tparam K must be a model of `Kernel`
 ///
-/// \cgalModels `OrientedBoundingBoxTraits_3`
+/// \cgalModels{OrientedBoundingBoxTraits_3}
 ///
 template <typename K>
 class Oriented_bounding_box_traits_3
diff --git a/Orthtree/include/CGAL/Orthtree/Node.h b/Orthtree/include/CGAL/Orthtree/Node.h
index a16d2fff1928..777066a295d8 100644
--- a/Orthtree/include/CGAL/Orthtree/Node.h
+++ b/Orthtree/include/CGAL/Orthtree/Node.h
@@ -77,7 +77,7 @@ struct Node_access
   A `Node` is a lightweight object and thus generally passed by
   copy. It is also a model of `ConstRange` with value type `Traits::Point_d`.
 
-  \cgalModels `ConstRange`
+  \cgalModels{ConstRange}
  */
 template<typename Traits, typename PointRange, typename PointMap>
 class Orthtree<Traits, PointRange, PointMap>::Node
diff --git a/Orthtree/include/CGAL/Orthtree/Traversals.h b/Orthtree/include/CGAL/Orthtree/Traversals.h
index 885af4f9b4d9..1ab9b77cceae 100644
--- a/Orthtree/include/CGAL/Orthtree/Traversals.h
+++ b/Orthtree/include/CGAL/Orthtree/Traversals.h
@@ -123,7 +123,7 @@ Node first_child_at_depth(Node n, std::size_t depth) {
 
   A preorder traversal starts from the root towards the leaves.
 
-  \cgalModels `OrthtreeTraversal`
+  \cgalModels{OrthtreeTraversal}
  */
 struct Preorder_traversal {
 
@@ -156,7 +156,7 @@ struct Preorder_traversal {
 
   A postorder traversal starts from the leaves towards the root.
 
-  \cgalModels `OrthtreeTraversal`
+  \cgalModels{OrthtreeTraversal}
  */
 struct Postorder_traversal {
 
@@ -184,7 +184,7 @@ struct Postorder_traversal {
 
   All non-leave nodes are ignored.
 
-  \cgalModels `OrthtreeTraversal`
+  \cgalModels{OrthtreeTraversal}
  */
 struct Leaves_traversal {
 
@@ -213,7 +213,7 @@ struct Leaves_traversal {
   All trees at another depth are ignored. If the selected depth is
   higher than the maximum depth of the orthtree, no node will be traversed.
 
-  \cgalModels `OrthtreeTraversal`
+  \cgalModels{OrthtreeTraversal}
  */
 struct Level_traversal {
 
diff --git a/Orthtree/include/CGAL/Orthtree_traits_2.h b/Orthtree/include/CGAL/Orthtree_traits_2.h
index 0ef87d2ce6e7..b849ae450f5f 100644
--- a/Orthtree/include/CGAL/Orthtree_traits_2.h
+++ b/Orthtree/include/CGAL/Orthtree_traits_2.h
@@ -28,7 +28,7 @@ namespace CGAL
 
   \tparam GeomTraits model of `Kernel`.
 
-  \cgalModels `OrthtreeTraits`
+  \cgalModels{OrthtreeTraits}
   \sa `CGAL::Quadtree`
   \sa `CGAL::Orthtree_traits_3`
   \sa `CGAL::Orthtree_traits_d`
diff --git a/Orthtree/include/CGAL/Orthtree_traits_3.h b/Orthtree/include/CGAL/Orthtree_traits_3.h
index 7cfb0723b27b..c50028fb8f27 100644
--- a/Orthtree/include/CGAL/Orthtree_traits_3.h
+++ b/Orthtree/include/CGAL/Orthtree_traits_3.h
@@ -28,7 +28,7 @@ namespace CGAL
 
   \tparam GeomTraits model of `Kernel`.
 
-  \cgalModels `OrthtreeTraits`
+  \cgalModels{OrthtreeTraits}
   \sa `CGAL::Octree`
   \sa `CGAL::Orthtree_traits_2`
   \sa `CGAL::Orthtree_traits_d`
diff --git a/Orthtree/include/CGAL/Orthtree_traits_d.h b/Orthtree/include/CGAL/Orthtree_traits_d.h
index 5415487afeda..4f48caba07ff 100644
--- a/Orthtree/include/CGAL/Orthtree_traits_d.h
+++ b/Orthtree/include/CGAL/Orthtree_traits_d.h
@@ -28,7 +28,7 @@ namespace CGAL
   \tparam GeomTraits model of `Kernel`.
   \tparam DimensionTag specialization of `CGAL::Dimension_tag`.
 
-  \cgalModels `OrthtreeTraits`
+  \cgalModels{OrthtreeTraits}
   \sa `CGAL::Orthtree`
   \sa `CGAL::Orthtree_traits_2`
   \sa `CGAL::Orthtree_traits_3`
diff --git a/Partition_2/doc/Partition_2/CGAL/Partition_is_valid_traits_2.h b/Partition_2/doc/Partition_2/CGAL/Partition_is_valid_traits_2.h
index 9bf0e53abf01..d08e20e0a0a3 100644
--- a/Partition_2/doc/Partition_2/CGAL/Partition_is_valid_traits_2.h
+++ b/Partition_2/doc/Partition_2/CGAL/Partition_is_valid_traits_2.h
@@ -7,7 +7,7 @@ Class that derives a traits class for `partition_is_valid_2()` from
 a given traits class by defining the validity testing function object
 in terms of a supplied template parameter.
 
-\cgalModels `PartitionIsValidTraits_2`
+\cgalModels{PartitionIsValidTraits_2}
 
 \sa `CGAL::Is_convex_2<Traits>`
 \sa `CGAL::Is_vacuously_valid<Traits>`
diff --git a/Partition_2/doc/Partition_2/CGAL/Partition_traits_2.h b/Partition_2/doc/Partition_2/CGAL/Partition_traits_2.h
index 5fe96c198738..577eccd5d4f2 100644
--- a/Partition_2/doc/Partition_2/CGAL/Partition_traits_2.h
+++ b/Partition_2/doc/Partition_2/CGAL/Partition_traits_2.h
@@ -10,11 +10,7 @@ Traits class that can be used with all the
 \tparam R  a representation class
 \tparam PointPropertyMap a property map that maps to points of type `R::Point_2`
 
-\cgalModels `ConvexPartitionIsValidTraits_2`
-\cgalModels `IsYMonotoneTraits_2`
-\cgalModels `OptimalConvexPartitionTraits_2`
-\cgalModels `PartitionTraits_2`
-\cgalModels `YMonotonePartitionIsValidTraits_2`
+\cgalModels{ConvexPartitionIsValidTraits_2,IsYMonotoneTraits_2,OptimalConvexPartitionTraits_2,PartitionTraits_2,YMonotonePartitionIsValidTraits_2}
 
 \sa `CGAL::approx_convex_partition_2()`
 \sa `CGAL::convex_partition_is_valid_2()`
diff --git a/Partition_2/doc/Partition_2/CGAL/polygon_function_objects.h b/Partition_2/doc/Partition_2/CGAL/polygon_function_objects.h
index 4cd55a933760..7ac8543cb2ee 100644
--- a/Partition_2/doc/Partition_2/CGAL/polygon_function_objects.h
+++ b/Partition_2/doc/Partition_2/CGAL/polygon_function_objects.h
@@ -6,7 +6,7 @@ namespace CGAL {
 Function object class for testing if a sequence of points represents
 a convex polygon or not.
 
-\cgalModels `PolygonIsValid`
+\cgalModels{PolygonIsValid}
 
 \sa `CGAL::convex_partition_is_valid_2()`
 \sa `CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>`
@@ -55,7 +55,7 @@ namespace CGAL {
 
 Function object class that indicates all sequences of points are valid.
 
-\cgalModels `PolygonIsValid`
+\cgalModels{PolygonIsValid}
 
 \sa `CGAL::partition_is_valid_2()`
 \sa `CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>`
@@ -103,7 +103,7 @@ namespace CGAL {
 Function object class that tests whether a sequence of points represents
 a \f$ y\f$-monotone polygon or not.
 
-\cgalModels `PolygonIsValid`
+\cgalModels{PolygonIsValid}
 
 \sa `CGAL::convex_partition_is_valid_2()`
 \sa `CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_traits_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_traits_2.h
index 0f72f4c2b15f..30a16b19ab8a 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_traits_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_Delaunay_triangulation_traits_2.h
@@ -21,7 +21,7 @@ predicates. This holds implicitly for
 `CGAL::Exact_predicates_inexact_constructions_kernel`, as it is an
 instantiation of `CGAL::Filtered_kernel`.
 
-\cgalModels `::Periodic_2DelaunayTriangulationTraits_2`
+\cgalModels{::Periodic_2DelaunayTriangulationTraits_2}
 */
 template< typename Traits, typename Periodic_2Offset_2 >
 class Periodic_2_Delaunay_triangulation_traits_2
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h
index af9757a095f8..2b5c9f6c097a 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h
@@ -210,7 +210,7 @@ class Periodic_2_triangulation_2 : public Triangulation_cw_ccw_2
 
   The vertices and faces of the triangulations are accessed through
   `handles`, `iterators` and `circulators`. The handles are %CGAL
-  \ref models "models" of
+  models of
   the concept `Handle` which basically offers the two dereference
   operators and `->`. The iterators and circulators are all
   bidirectional and non-mutable. The circulators and iterators are
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_face_base_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_face_base_2.h
index 2f2cc601cf16..5674d7086f5d 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_face_base_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_face_base_2.h
@@ -29,7 +29,7 @@ the offset corresponding to vertex \f$ i\f$.
 The implementation of `has_zero_offsets()` results in checking
 whether all offsets are zero.
 
-\cgalModels `::Periodic_2TriangulationFaceBase_2`
+\cgalModels{::Periodic_2TriangulationFaceBase_2}
 
 \sa `CGAL::Triangulation_face_base_2`
 \sa `CGAL::Triangulation_face_base_with_info_2`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_traits_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_traits_2.h
index e14eab6d490a..b0bbb524f123 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_traits_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_traits_2.h
@@ -20,7 +20,7 @@ will be used if the flag `Traits::Has_static_filters` exists and is `true`.
 By default, this holds for `CGAL::Exact_predicates_inexact_constructions_kernel` and
 `CGAL::Exact_predicates_exact_constructions_kernel`.
 
-\cgalModels `Periodic_2TriangulationTraits_2`
+\cgalModels{Periodic_2TriangulationTraits_2}
 
 */
 template< typename Traits, typename Periodic_2Offset_2 >
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_vertex_base_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_vertex_base_2.h
index 6ead6620b64c..961222f05611 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_vertex_base_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_vertex_base_2.h
@@ -19,7 +19,7 @@ class to which the additional information for the periodic vertex is
 added and should be a model of `TriangulationDSVertexBase_2`
 
 
-\cgalModels `Periodic_2TriangulationVertexBase_2`
+\cgalModels{Periodic_2TriangulationVertexBase_2}
 
 \sa `CGAL::Periodic_2_triangulation_face_base_2`
 \sa `CGAL::Triangulation_vertex_base_2`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_Delaunay_triangulation_traits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_Delaunay_triangulation_traits_3.h
index d5c6de09876c..c13dbfc5ee9c 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_Delaunay_triangulation_traits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_Delaunay_triangulation_traits_3.h
@@ -16,7 +16,7 @@ will be used if the flag `Traits::Has_static_filters` exists and is `true`.
 By default, this holds for `CGAL::Exact_predicates_inexact_constructions_kernel` and
 `CGAL::Exact_predicates_exact_constructions_kernel`.
 
-\cgalModels `Periodic_3DelaunayTriangulationTraits_3`
+\cgalModels{Periodic_3DelaunayTriangulationTraits_3}
 */
 template< typename Traits, typename Offset >
 class Periodic_3_Delaunay_triangulation_traits_3
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_offset_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_offset_3.h
index 87f1a0c55529..da581a53cefa 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_offset_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_offset_3.h
@@ -7,7 +7,7 @@ namespace CGAL {
 The class `Periodic_3_offset_3` is a model of the concept
 `Periodic_3Offset_3`.
 
-\cgalModels `Periodic_3Offset_3`
+\cgalModels{Periodic_3Offset_3}
 
 */
 
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_regular_triangulation_traits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_regular_triangulation_traits_3.h
index acfe43f7c325..0802beeee19f 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_regular_triangulation_traits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_regular_triangulation_traits_3.h
@@ -15,7 +15,7 @@ and is `true`), this class automatically provides filtered predicates.
 By default, this holds for `CGAL::Exact_predicates_inexact_constructions_kernel` and
 `CGAL::Exact_predicates_exact_constructions_kernel`.
 
-\cgalModels `Periodic_3RegularTriangulationTraits_3`
+\cgalModels{Periodic_3RegularTriangulationTraits_3}
 */
 template< typename Traits, typename Offset >
 class Periodic_3_regular_triangulation_traits_3 :
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_ds_cell_base_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_ds_cell_base_3.h
index efb25f6c201a..58e3e90e2e3f 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_ds_cell_base_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_ds_cell_base_3.h
@@ -9,7 +9,7 @@ the concept `Periodic_3TriangulationDSCellBase_3` to be used by
 `Triangulation_data_structure_3` to represent cells of a periodic
 triangulation.
 
-\cgalModels `Periodic_3TriangulationDSCellBase_3`
+\cgalModels{Periodic_3TriangulationDSCellBase_3}
 
 \sa `CGAL::Periodic_3_triangulation_ds_vertex_base_3`
 \sa `CGAL::Triangulation_cell_base_3`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_ds_vertex_base_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_ds_vertex_base_3.h
index a712381ffdaa..92c3fc05704e 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_ds_vertex_base_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_ds_vertex_base_3.h
@@ -9,7 +9,7 @@ of the concept `Periodic_3TriangulationDSVertexBase_3` to be used by
 `Triangulation_data_structure_3` to represent vertices of a
 periodic triangulation.
 
-\cgalModels `Periodic_3TriangulationDSVertexBase_3`
+\cgalModels{Periodic_3TriangulationDSVertexBase_3}
 
 \sa `CGAL::Periodic_3_triangulation_ds_cell_base_3`
 \sa `CGAL::Triangulation_vertex_base_3`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_traits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_traits_3.h
index 815940b59114..5c62f8198577 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_traits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/CGAL/Periodic_3_triangulation_traits_3.h
@@ -16,7 +16,7 @@ will be used if the flag `Traits::Has_static_filters` exists and is `true`.
 By default, this holds for `CGAL::Exact_predicates_inexact_constructions_kernel` and
 `CGAL::Exact_predicates_exact_constructions_kernel`.
 
-\cgalModels `Periodic_3TriangulationTraits_3`
+\cgalModels{Periodic_3TriangulationTraits_3}
 */
 template< typename Traits, typename Offset >
 class Periodic_3_triangulation_traits_3 : public Traits {
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h
index 4f15616d8fe0..489d75ef26f5 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_traits_2.h
@@ -10,7 +10,7 @@ namespace CGAL
 The class `Periodic_4_hyperbolic_Delaunay_triangulation_traits_2` is
 the default traits class for the class `Periodic_4_hyperbolic_Delaunay_triangulation_2`.
 
-\cgalModels `Periodic_4HyperbolicDelaunayTriangulationTraits_2`
+\cgalModels{Periodic_4HyperbolicDelaunayTriangulationTraits_2}
 
 \sa `Periodic_4_hyperbolic_Delaunay_triangulation_2`
 */
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_triangulation_face_base_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_triangulation_face_base_2.h
index c21e673c91c4..3ddf15a4a75c 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_triangulation_face_base_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_triangulation_face_base_2.h
@@ -21,7 +21,7 @@ concept `Periodic_4HyperbolicTriangulationFaceBase_2`. It accepts two template p
 data structure of a periodic hyperbolic triangulation, or used as a base class to derive other
 base vertex classes tuned for specific applications.
 
-\cgalModels `Periodic_4HyperbolicTriangulationFaceBase_2`
+\cgalModels{Periodic_4HyperbolicTriangulationFaceBase_2}
 
 \sa `Periodic_4_hyperbolic_triangulation_vertex_base_2`
 */
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_triangulation_vertex_base_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_triangulation_vertex_base_2.h
index 9d2804d744fe..44ddebfe5751 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_triangulation_vertex_base_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_triangulation_vertex_base_2.h
@@ -21,7 +21,7 @@ concept `Periodic_4HyperbolicTriangulationVertexBase_2`. It accepts two template
 data structure of a periodic hyperbolic triangulation, or used as a base class to derive other
 base vertex classes tuned for specific applications.
 
-\cgalModels `Periodic_4HyperbolicTriangulationVertexBase_2`
+\cgalModels{Periodic_4HyperbolicTriangulationVertexBase_2}
 
 \sa `Periodic_4_hyperbolic_triangulation_face_base_2`
 */
diff --git a/Point_set_3/include/CGAL/Point_set_3.h b/Point_set_3/include/CGAL/Point_set_3.h
index 70cd87aee043..62ef14a946fb 100644
--- a/Point_set_3/include/CGAL/Point_set_3.h
+++ b/Point_set_3/include/CGAL/Point_set_3.h
@@ -114,7 +114,7 @@ namespace internal {
   \tparam Point Point type
   \tparam Vector Normal vector type
 
-  \cgalModels `Range`
+  \cgalModels{Range}
  */
 
 template <typename Point,
@@ -151,9 +151,7 @@ class Point_set_3
 #ifdef DOXYGEN_RUNNING
    /*!
   \brief This represents a point with associated properties.
-  \cgalModels `::Index`
-  \cgalModels `LessThanComparable`
-  \cgalModels `Hashable`
+  \cgalModels{::Index,LessThanComparable,Hashable}
   */
   class Index;
 #endif
@@ -162,8 +160,8 @@ class Point_set_3
   typedef Vector Vector_3; ///< The vector type
 
 #ifdef DOXYGEN_RUNNING
-  typedef unspecified_type iterator; ///< Iterator type of the point set with value type `Index` \cgalModels RandomAccessIterator
-  typedef unspecified_type const_iterator; ///< Constant iterator type of the point set with value type `Index` \cgalModels RandomAccessIterator
+  typedef unspecified_type iterator; ///< Iterator type of the point set with value type `Index` is model of `RandomAccessIterator`
+  typedef unspecified_type const_iterator; ///< Constant iterator type of the point set with value type `Index` is model of `RandomA.ccessIterator
 #else
   typedef typename Index_map::iterator iterator; ///< Iterator type of the point set
   typedef typename Index_map::const_iterator const_iterator; ///< Constant iterator type of the point set
diff --git a/Point_set_processing_3/include/CGAL/Point_with_normal_3.h b/Point_set_processing_3/include/CGAL/Point_with_normal_3.h
index 8ce1e86dbeb9..eb639c40ca28 100644
--- a/Point_set_processing_3/include/CGAL/Point_with_normal_3.h
+++ b/Point_set_processing_3/include/CGAL/Point_with_normal_3.h
@@ -120,7 +120,7 @@ class Point_with_normal_3 : public Gt::Point_3
 /// Property map that accesses the normal vector from a Point_with_normal_3 object
 ///
 /// @heading Is Model for the Concepts:
-/// \cgalModels `LvaluePropertyMap`
+/// \cgalModels{LvaluePropertyMap}
 ///
 /// @heading Parameters:
 /// @param Gt Geometric traits class.
diff --git a/Poisson_surface_reconstruction_3/include/CGAL/Lightweight_vector_3.h b/Poisson_surface_reconstruction_3/include/CGAL/Lightweight_vector_3.h
index bcbd4c68a737..d86607fa8d67 100644
--- a/Poisson_surface_reconstruction_3/include/CGAL/Lightweight_vector_3.h
+++ b/Poisson_surface_reconstruction_3/include/CGAL/Lightweight_vector_3.h
@@ -27,7 +27,7 @@ namespace CGAL {
 /// The purpose of this class is to save memory as the actual vector
 /// is allocated only when needed.
 ///
-/// \cgalModels `Kernel::Vector_3`
+/// \cgalModels{Kernel::Vector_3}
 ///
 /// @tparam Gt   Geometric traits class.
 template<class Gt>
diff --git a/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h b/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h
index 9c2c5885fece..68c71a271519 100644
--- a/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h
+++ b/Poisson_surface_reconstruction_3/include/CGAL/Poisson_reconstruction_function.h
@@ -145,7 +145,7 @@ Delaunay triangulation instead of an adaptive octree.
 
 \tparam Gt Geometric traits class.
 
-\cgalModels `ImplicitFunction`
+\cgalModels{ImplicitFunction}
 
 */
 template <class Gt>
diff --git a/Polygon/include/CGAL/General_polygon_with_holes_2.h b/Polygon/include/CGAL/General_polygon_with_holes_2.h
index ae37e05eba9b..42173fc2ad6f 100644
--- a/Polygon/include/CGAL/General_polygon_with_holes_2.h
+++ b/Polygon/include/CGAL/General_polygon_with_holes_2.h
@@ -34,7 +34,7 @@ namespace CGAL {
  *
  * \tparam Polygon_ must have input and output operators.
  *
- * \cgalModels `GeneralPolygonWithHoles_2`
+ * \cgalModels{GeneralPolygonWithHoles_2}
  */
 template <typename Polygon_>
 class General_polygon_with_holes_2 {
diff --git a/Polygon/include/CGAL/Polygon_with_holes_2.h b/Polygon/include/CGAL/Polygon_with_holes_2.h
index 3e4eb83c0a91..e41104c943a9 100644
--- a/Polygon/include/CGAL/Polygon_with_holes_2.h
+++ b/Polygon/include/CGAL/Polygon_with_holes_2.h
@@ -33,7 +33,7 @@ types (`Kernel` and `Container`) that are used to instantiate
 the type `Polygon_2<Kernel,Container>`. The latter is used to
 represents the outer boundary and the boundary of the holes (if any exist).
 
-\cgalModels `GeneralPolygonWithHoles_2`
+\cgalModels{GeneralPolygonWithHoles_2}
 
 */
 template <class Kernel,
diff --git a/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_items_3.h b/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_items_3.h
index 6b8bc334c909..975cf3271c60 100644
--- a/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_items_3.h
+++ b/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_items_3.h
@@ -11,7 +11,7 @@ provide the respective types for the point and the plane equation.
 Vertices and facets both contain a halfedge handle to an incident
 halfedge.
 
-\cgalModels `PolyhedronItems_3`
+\cgalModels{PolyhedronItems_3}
 
 \sa `CGAL::Polyhedron_3<Traits>`
 \sa `CGAL::Polyhedron_min_items_3`
diff --git a/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_min_items_3.h b/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_min_items_3.h
index d568e954d92b..37febfd3ac06 100644
--- a/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_min_items_3.h
+++ b/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_min_items_3.h
@@ -11,7 +11,7 @@ must provide the respective type for the point. Vertices and facets
 both do <I>not</I> contain a halfedge handle to an incident
 halfedge.
 
-\cgalModels `PolyhedronItems_3`
+\cgalModels{PolyhedronItems_3}
 
 \sa `CGAL::Polyhedron_3<Traits>`
 \sa `CGAL::Polyhedron_items_3`
diff --git a/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_traits_3.h b/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_traits_3.h
index e1d675697689..f7e7442bdd53 100644
--- a/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_traits_3.h
+++ b/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_traits_3.h
@@ -10,7 +10,7 @@ in the polyhedral surface data structure
 `Polyhedron_3<PolyhedronTraits_3>` in terms of the \cgal `Kernel`. It keeps a local copy of the kernel which makes
 it suitable for kernels with local state.
 
-\cgalModels `PolyhedronTraits_3`
+\cgalModels{PolyhedronTraits_3}
 
 \sa `CGAL::Polyhedron_traits_with_normals_3<Kernel>`
 
diff --git a/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_traits_with_normals_3.h b/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_traits_with_normals_3.h
index a049527067f9..98954d5ca2df 100644
--- a/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_traits_with_normals_3.h
+++ b/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_traits_with_normals_3.h
@@ -12,7 +12,7 @@ normal vector from `Kernel` for the plane equation in facets. It
 keeps a local copy of the kernel which makes it suitable for kernels
 with local state.
 
-\cgalModels `PolyhedronTraits_3`
+\cgalModels{PolyhedronTraits_3}
 
 \sa `CGAL::Polyhedron_traits_3<Kernel>`
 
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
index fd1e9ccc0de8..8cfe6fa2a55c 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
@@ -27,7 +27,7 @@ namespace Polyline_simplification_2
 /// This class is a cost function which calculates the cost as the square of the distance between the original and simplified polylines,
 /// possibly scaled based on a factor.
 ///
-/// \cgalModels `PolylineSimplificationCostFunction`.
+/// \cgalModels{PolylineSimplificationCostFunction.}
 template<class FT>
 class Hybrid_squared_distance_cost
 {
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
index 8a6977364610..d2b04efbcbea 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Scaled_squared_distance_cost.h
@@ -27,7 +27,7 @@ namespace Polyline_simplification_2
 
 /// This class is a cost function which calculates the cost as a scaled variant of the square of the distance between the original and simplified polylines.
 ///
-/// \cgalModels  `PolylineSimplificationCostFunction`
+/// \cgalModels{ PolylineSimplificationCostFunction}
 class Scaled_squared_distance_cost
 {
 
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
index 4110a7718213..128327f64c7b 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
@@ -34,7 +34,7 @@ namespace Polyline_simplification_2
 
 /// This class is a cost function which calculates the cost as the square of the distance between the original and simplified polylines.
 ///
-/// \cgalModels `PolylineSimplificationCostFunction`.
+/// \cgalModels{PolylineSimplificationCostFunction.}
 class Squared_distance_cost
 {
 
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_above_cost_threshold.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_above_cost_threshold.h
index e1ab3d7fc012..ed886701afdb 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_above_cost_threshold.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_above_cost_threshold.h
@@ -28,7 +28,7 @@ namespace Polyline_simplification_2
 /// This class is a stop predicate returning `true` when the cost for
 /// simplifying a vertex is greater than a certain threshold.
 ///
-/// \cgalModels `PolylineSimplificationStopPredicate`.
+/// \cgalModels{PolylineSimplificationStopPredicate.}
 class Stop_above_cost_threshold
 {
 public :
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_ratio_threshold.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_ratio_threshold.h
index 2c98b695a209..9de0bb1888db 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_ratio_threshold.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_ratio_threshold.h
@@ -27,7 +27,7 @@ namespace Polyline_simplification_2
 /// This class is a stop predicate returning `true` when the percentage
 /// of remaining vertices is smaller than a certain threshold.
 ///
-/// \cgalModels `PolylineSimplificationStopPredicate`.
+/// \cgalModels{PolylineSimplificationStopPredicate.}
 class Stop_below_count_ratio_threshold
 {
 public :
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_threshold.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_threshold.h
index 63e9ce6cc031..072b68166ae3 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_threshold.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_threshold.h
@@ -27,7 +27,7 @@ namespace Polyline_simplification_2
 /// This class is a stop predicate returning `true` when the number of
 /// vertices is smaller than a certain threshold.
 ///
-/// \cgalModels `PolylineSimplificationStopPredicate`.
+/// \cgalModels{PolylineSimplificationStopPredicate.}
 class Stop_below_count_threshold
 {
 public :
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Vertex_base_2.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Vertex_base_2.h
index d5f2856e239d..5b1d5c254630 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Vertex_base_2.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Vertex_base_2.h
@@ -25,7 +25,7 @@ namespace Polyline_simplification_2 {
 
 /// A vertex base class with data members needed by the simplification algorithm.
 /// \tparam Vb must be a model of the concept `TriangulationVertexBase_2`
-/// \cgalModels `PolylineSimplificationVertexBase_2`.
+/// \cgalModels{PolylineSimplificationVertexBase_2}
   template<class K, class Vb = CGAL::Triangulation_vertex_base_2<K> >
 class Vertex_base_2
   : public Vb
diff --git a/Polynomial/doc/Polynomial/CGAL/Exponent_vector.h b/Polynomial/doc/Polynomial/CGAL/Exponent_vector.h
index 77868373ab90..ff9105c68fbb 100644
--- a/Polynomial/doc/Polynomial/CGAL/Exponent_vector.h
+++ b/Polynomial/doc/Polynomial/CGAL/Exponent_vector.h
@@ -21,12 +21,7 @@ the lexicographic order starts the comparison at the last entry.
 This reflects the fact that the last entry corresponds to the
 outermost variable of a multivariate polynomial.
 
-\cgalModels `RandomAccessContainer`
-\cgalModels `DefaultConstructible`
-\cgalModels `Assignable`
-\cgalModels `CopyConstructible`
-\cgalModels `EqualityComparable`
-\cgalModels `LessThanComparable`
+\cgalModels{RandomAccessContainer,DefaultConstructible,Assignable,CopyConstructible,EqualityComparable,LessThanComparable}
 
 \sa `Polynomial_d`
 \sa `PolynomialTraits_d`
diff --git a/Polynomial/doc/Polynomial/CGAL/Polynomial.h b/Polynomial/doc/Polynomial/CGAL/Polynomial.h
index 15c657b628de..77d9235aa0e1 100644
--- a/Polynomial/doc/Polynomial/CGAL/Polynomial.h
+++ b/Polynomial/doc/Polynomial/CGAL/Polynomial.h
@@ -53,16 +53,16 @@ the coefficient sequence does not contain leading zero coefficients
 (where leading means at the high-degree end), with the exception that
 the zero polynomial is represented by a single zero coefficient.
 
-\cgalModels `Polynomial_d`
-\cgalModels `Assignable`
-\cgalModels `CopyConstructible`
-\cgalModels `DefaultConstructible`
-\cgalModels `EqualityComparable`
-\cgalModels `ImplicitInteroperable` with int
-\cgalModels `ImplicitInteroperable` with Coeff
-\cgalModels `Fraction` if Coeff is model of `Fraction`
-\cgalModels `LessThanComparable` if Coeff is model of `LessThanComparable`
-\cgalModels `Modularizable` if `Coeff` is model of `Modularizable`
+\cgalModelsBare{`Polynomial_d`\n
+            `Assignable`\n
+            `CopyConstructible`\n
+            `DefaultConstructible`\n
+            `EqualityComparable`\n
+            `ImplicitInteroperable` with int\n
+            `ImplicitInteroperable` with Coeff\n
+            `Fraction` if Coeff is model of `Fraction`\n
+            `LessThanComparable` if Coeff is model of `LessThanComparable`\n
+            `Modularizable` if `Coeff` is model of `Modularizable`}
 */
 template< typename Coeff >
 class Polynomial {
diff --git a/Polynomial/doc/Polynomial/CGAL/Polynomial_traits_d.h b/Polynomial/doc/Polynomial/CGAL/Polynomial_traits_d.h
index 08bd67675a09..1ca6805a8163 100644
--- a/Polynomial/doc/Polynomial/CGAL/Polynomial_traits_d.h
+++ b/Polynomial/doc/Polynomial/CGAL/Polynomial_traits_d.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 A model of concept `PolynomialTraits_d`
 
-\cgalModels `PolynomialTraits_d`
+\cgalModels{PolynomialTraits_d}
 
 */
 template< typename Polynomial_d >
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_2.h b/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_2.h
index cd0d661178b7..b5e189e51ce1 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_2.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_2.h
@@ -12,7 +12,7 @@ optimisation algorithms using the two-dimensional \cgal kernel.
 
 \tparam ET NT must be models for `RingNumberType`. Their default is  `K::RT`.
 
-\cgalModels `PolytopeDistanceDTraits`
+\cgalModels{PolytopeDistanceDTraits}
 
 \sa `CGAL::Polytope_distance_d<Traits>`
 \sa `CGAL::Polytope_distance_d_traits_3<K,ET,NT>`
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_3.h b/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_3.h
index ab873c594a57..207b4a8bd7ba 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_3.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_3.h
@@ -13,7 +13,7 @@ optimisation algorithms using the three-dimensional \cgal kernel.
 \tparam ET NT must be models for `RingNumberType`. Their default is  `K::RT`.
 
 
-\cgalModels `PolytopeDistanceDTraits`
+\cgalModels{PolytopeDistanceDTraits}
 
 \sa `CGAL::Polytope_distance_d<Traits>`
 \sa `CGAL::Polytope_distance_d_traits_2<K,ET,NT>`
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_d.h b/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_d.h
index 536d2e43b33c..37ad80ae56b1 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_d.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Polytope_distance_d_traits_d.h
@@ -13,7 +13,7 @@ optimisation algorithms using the \f$ d\f$-dimensional \cgal kernel.
 \tparam ET NT must be models for `RingNumberType`. Their default is  `K::RT`.
 
 
-\cgalModels `PolytopeDistanceDTraits`
+\cgalModels{PolytopeDistanceDTraits}
 
 \sa `CGAL::Polytope_distance_d<Traits>`
 \sa `CGAL::Polytope_distance_d_traits_2<K,ET,NT>`
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Width_default_traits_3.h b/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Width_default_traits_3.h
index 508bad703bb5..7fa7e77385c6 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Width_default_traits_3.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/CGAL/Width_default_traits_3.h
@@ -9,7 +9,7 @@ using the three-dimensional \cgal kernel.
 
 \tparam K must be a model for `Kernel`.
 
-\cgalModels `WidthTraits_3`
+\cgalModels{WidthTraits_3}
 
 \sa `CGAL::Width_3<Traits>`
 \sa `WidthTraits_3`
diff --git a/Property_map/include/CGAL/property_map.h b/Property_map/include/CGAL/property_map.h
index 12fd06503fee..735c1f5da494 100644
--- a/Property_map/include/CGAL/property_map.h
+++ b/Property_map/include/CGAL/property_map.h
@@ -102,7 +102,7 @@ make_OR_property_map(const PM1& pm1, const PM2& pm2)
 
 /// Property map that accesses a value from an iterator
 ///
-/// \cgalModels `ReadablePropertyMap`
+/// \cgalModels{ReadablePropertyMap}
 ///
 /// \tparam InputIterator an input iterator
 /// \endcond
@@ -287,7 +287,7 @@ make_compose_property_map(const KeyMap& km, const ValueMap& vm)
 /// Property map that converts a `T*` pointer (or in general an iterator
 /// over `T` elements) to the `T` object.
 ///
-/// \cgalModels `LvaluePropertyMap`
+/// \cgalModels{LvaluePropertyMap}
 template <typename T, typename Iter = T*>
 struct Dereference_property_map
   : public boost::put_get_helper<typename std::iterator_traits<Iter>::reference, Dereference_property_map<T, Iter> >
@@ -319,7 +319,7 @@ make_dereference_property_map(Iter)
 /// A `LvaluePropertyMap` property map mapping a key to itself (by reference).
 /// It is mutable if `T` is not `const` and non-mutable otherwise.
 ///
-/// \cgalModels `LvaluePropertyMap`
+/// \cgalModels{LvaluePropertyMap}
 template <typename T>
 struct Identity_property_map
 {
@@ -385,7 +385,7 @@ Identity_property_map<T>
 /// \ingroup PkgPropertyMapRef
 /// Property map that accesses the first item of a `std::pair`.
 /// \tparam Pair Instance of `std::pair`.
-/// \cgalModels `LvaluePropertyMap`
+/// \cgalModels{LvaluePropertyMap}
 ///
 /// \sa `CGAL::Second_of_pair_property_map<Pair>`
 template <typename Pair>
@@ -425,7 +425,7 @@ First_of_pair_property_map<Pair>
 ///
 /// \tparam Pair Instance of `std::pair`.
 ///
-/// \cgalModels `LvaluePropertyMap`
+/// \cgalModels{LvaluePropertyMap}
 ///
 /// \sa `CGAL::First_of_pair_property_map<Pair>`
 template <typename Pair>
@@ -466,7 +466,7 @@ Second_of_pair_property_map<Pair>
 /// \tparam N %Index of the item to access.
 /// \tparam Tuple Instance of `boost::tuple` or `std::tuple`.
 ///
-/// \cgalModels `LvaluePropertyMap`
+/// \cgalModels{LvaluePropertyMap}
 template <int N, typename Tuple>
 struct Nth_of_tuple_property_map
 {
@@ -611,7 +611,7 @@ make_property_map(const std::vector<T>& v)
 /// Note that this value is chosen when the map is constructed and cannot
 /// be changed afterwards. Specifically, the free function `put()` does nothing.
 ///
-/// \cgalModels `ReadWritePropertyMap`
+/// \cgalModels{ReadWritePropertyMap}
 template<class KeyType, class ValueType>
 struct Constant_property_map
 {
@@ -640,7 +640,7 @@ struct Constant_property_map
 /// return `true` if the key is inside the set and `false` otherwise. The `put`
 /// function will insert an element in the set if `true` is passed and erase it
 /// otherwise.
-/// \cgalModels `ReadWritePropertyMap`
+/// \cgalModels{ReadWritePropertyMap}
 template<class Set>
 struct Boolean_property_map
 {
@@ -688,7 +688,7 @@ make_boolean_property_map(Set& set_)
 /// a geometric object of the same type as `GeomObject` but possibly from
 /// another kernel.
 /// Conversions between the two geometric objects are done using `Cartesian_converter`.
-/// \cgalModels `ReadWritePropertyMap`
+/// \cgalModels{ReadWritePropertyMap}
 template<class GeomObject, class Vpm>
 struct Cartesian_converter_property_map
 {
@@ -726,7 +726,7 @@ make_cartesian_converter_property_map(Vpm vpm)
 /// \ingroup PkgPropertyMapRef
 /// A property map with `std::size_t` as key-type that can be used
 /// to access the i'th element in a container with random access.
-/// \cgalModels `LvaluePropertyMap`, constness being than of `Container`.
+/// \cgalModels{LvaluePropertyMap constness being than of `Container`.}
 template<typename Container>
 class Random_access_property_map
 {
diff --git a/QP_solver/doc/QP_solver/CGAL/QP_models.h b/QP_solver/doc/QP_solver/CGAL/QP_models.h
index 892d00279476..bfb7416a6025 100644
--- a/QP_solver/doc/QP_solver/CGAL/QP_models.h
+++ b/QP_solver/doc/QP_solver/CGAL/QP_models.h
@@ -42,8 +42,7 @@ namespace CGAL {
   some container; an instance of the class `Const_oneset_iterator<T>`,
   constructed from the value in question, does the job more efficiently.
 
-  \cgalModels `QuadraticProgram`
-  \cgalModels `LinearProgram`
+  \cgalModels{QuadraticProgram,LinearProgram}
 
   \cgalHeading{Example}
 
@@ -296,10 +295,7 @@ make_quadratic_program_from_iterators (
   some container; an instance of the class `Const_oneset_iterator<T>`,
   constructed from the value in question, does the job more efficiently.
 
-  \cgalModels `QuadraticProgram`
-  \cgalModels `LinearProgram`
-  \cgalModels `NonnegativeQuadraticProgram`
-  \cgalModels `NonnegativeLinearProgram`
+  \cgalModels{QuadraticProgram,LinearProgram,NonnegativeQuadraticProgram,NonnegativeLinearProgram}
 
   \cgalHeading{Example}
 
@@ -378,8 +374,7 @@ class Nonnegative_linear_program_from_iterators {
   some container; an instance of the class `Const_oneset_iterator<T>`,
   constructed from the value in question, does the job more efficiently.
 
-  \cgalModels `QuadraticProgram`
-  \cgalModels `NonnegativeQuadraticProgram`
+  \cgalModels{QuadraticProgram,NonnegativeQuadraticProgram}
 
   \cgalHeading{Example}
 
@@ -467,7 +462,7 @@ class Nonnegative_quadratic_program_from_iterators {
   some container; an instance of the class `Const_oneset_iterator<T>`,
   constructed from the value in question, does the job more efficiently.
 
-  \cgalModels `QuadraticProgram`
+  \cgalModels{QuadraticProgram}
 
   \cgalHeading{Example}
 
@@ -560,10 +555,7 @@ class Quadratic_program_from_iterators {
   into type `NT`. The constructed program can be further manipulated
   by using the set-methods below.
 
-  \cgalModels `QuadraticProgram`
-  \cgalModels `LinearProgram`
-  \cgalModels `NonnegativeQuadraticProgram`
-  \cgalModels `NonnegativeLinearProgram`
+  \cgalModels{QuadraticProgram,LinearProgram,NonnegativeQuadraticProgram,NonnegativeLinearProgram}
 
   \cgalHeading{Example}
 
@@ -771,10 +763,7 @@ namespace CGAL {
   If you want to read a quadratic program in `MPSFormat` from a stream,
   please use the model `Quadratic_program_from_mps<NT>`.
 
-  \cgalModels `QuadraticProgram`
-  \cgalModels `LinearProgram`
-  \cgalModels `NonnegativeQuadraticProgram`
-  \cgalModels `NonnegativeLinearProgram`
+  \cgalModels{QuadraticProgram,LinearProgram,NonnegativeQuadraticProgram,NonnegativeLinearProgram}
 
   \cgalHeading{Example}
 
diff --git a/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h b/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h
index 643de3ff7da8..0a5c70bfa601 100644
--- a/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h
+++ b/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h
@@ -170,7 +170,7 @@ namespace CGAL {
   if the domain used for mesh generation does not include 0 and 1-dimensionnal features (i.e
   is only a model of the concept `MeshDomain_3`).
 
-  \cgalModels `MeshComplexWithFeatures_3InTriangulation_3`
+  \cgalModels{MeshComplexWithFeatures_3InTriangulation_3}
 
   \sa \link make_mesh_3() `CGAL::make_mesh_3()`\endlink
   \sa \link refine_mesh_3() `CGAL::refine_mesh_3()`\endlink
diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
index ee49f5722364..0001e33ed678 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
@@ -363,7 +363,7 @@ assigned to a non surface facet.
  It must match the `Surface_patch_index` of the model
   of the `MeshDomain_3` concept when used for mesh generation.
 
-\cgalModels `SimplicialMeshCellBase_3`
+\cgalModels{SimplicialMeshCellBase_3}
 
 \sa `CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
 \sa \link Mesh_cell_base_3 `CGAL::Mesh_cell_base_3`\endlink
diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
index 3f1a9c92d428..35127d01405d 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
@@ -36,7 +36,7 @@ namespace CGAL {
 //Class Simplicial_mesh_vertex_3
 //Adds information to Vb about the localization of the vertex in regards
 //to the 3D input complex.
-//\cgalModels `SimplicialMeshVertexBase_3`
+//\cgalModels{SimplicialMeshVertexBase_3}
 template<class GT,
          typename Subdomain_index,
          typename Surface_patch_index,
@@ -249,7 +249,7 @@ It must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
 of the concept `TriangulationVertexBase_3` and defaults to
 `Triangulation_vertex_base_3<Gt>`.
 
-\cgalModels `SimplicialMeshVertexBase_3`
+\cgalModels{SimplicialMeshVertexBase_3}
 
 \sa `CGAL::Mesh_complex_3_in_triangulation_3`
 \sa \link Mesh_vertex_base_3 `CGAL::Mesh_vertex_base_3`\endlink
diff --git a/STL_Extension/doc/STL_Extension/CGAL/Complexity_tags.h b/STL_Extension/doc/STL_Extension/CGAL/Complexity_tags.h
index 2c54537b8a4f..3f39efc663bd 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/Complexity_tags.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/Complexity_tags.h
@@ -13,8 +13,7 @@ For example, passing `Location_policy<Compact>` as parameter to
 
 
 
-\cgalModels `DefaultConstructible`
-\cgalModels `CopyConstructible`
+\cgalModels{DefaultConstructible,CopyConstructible}
 
 \sa `Location_policy`
 \sa `Fast`
@@ -45,8 +44,7 @@ more memory usage.
 
 
 
-\cgalModels `DefaultConstructible`
-\cgalModels `CopyConstructible`
+\cgalModels{DefaultConstructible,CopyConstructible}
 
 \sa `Location_policy`
 \sa `Compact`
diff --git a/STL_Extension/doc/STL_Extension/CGAL/Default.h b/STL_Extension/doc/STL_Extension/CGAL/Default.h
index 4f58c260c365..4fcb285014e0 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/Default.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/Default.h
@@ -26,8 +26,7 @@ same when instantiating it using `Default` instead of the type of the default
 argument, even though their interfaces will otherwise be the same. This may
 have consequences in some cases.
 
-\cgalModels `DefaultConstructible`
-\cgalModels `CopyConstructible`
+\cgalModels{DefaultConstructible,CopyConstructible}
 
 In order to help the template class writer, `Default` provides a convenient
 way to extract the desired type for a template parameter which may be defaulted
diff --git a/STL_Extension/doc/STL_Extension/CGAL/Location_policy.h b/STL_Extension/doc/STL_Extension/CGAL/Location_policy.h
index 799cb42dc3b6..ae8e77ff775b 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/Location_policy.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/Location_policy.h
@@ -51,8 +51,7 @@ For example, passing `Location_policy<Compact>` as parameter to
 
 `Tag` can only be either `Fast` or `Compact` currently.
 
-\cgalModels `DefaultConstructible`
-\cgalModels `CopyConstructible`
+\cgalModels{DefaultConstructible,CopyConstructible}
 
 \sa `Compact`
 \sa `Fast`
diff --git a/STL_Extension/doc/STL_Extension/CGAL/Spatial_lock_grid_3.h b/STL_Extension/doc/STL_Extension/CGAL/Spatial_lock_grid_3.h
index 2d9b53b10483..02e5305d4e64 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/Spatial_lock_grid_3.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/Spatial_lock_grid_3.h
@@ -26,7 +26,7 @@ block (spin) if the thread owning the lock has a lower \"ID\" (each thread is
 given an arbitrary ID) or return immediately otherwise. It uses atomics to
 perform lock operations.
 
-\cgalModels `SurjectiveLockDataStructure`
+\cgalModels{SurjectiveLockDataStructure}
 */
 
 template <typename Grid_lock_tag>
diff --git a/STL_Extension/doc/STL_Extension/CGAL/function_objects.h b/STL_Extension/doc/STL_Extension/CGAL/function_objects.h
index 36f7ba21155d..29749667ac93 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/function_objects.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/function_objects.h
@@ -13,7 +13,7 @@ its argument.
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 
 */
@@ -1021,7 +1021,7 @@ The class `Dereference` dereferences a pointer
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 */
 template< typename Value >
@@ -1091,7 +1091,7 @@ The class `Get_address` gets the address of an lvalue
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 
 */
@@ -1161,7 +1161,7 @@ on `Value`.
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 */
 template< typename Value >
@@ -1230,7 +1230,7 @@ The class `Project_facet` calls the member function
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 */
 template< typename Node >
@@ -1299,7 +1299,7 @@ The class `Project_next` calls the member function
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 
 */
@@ -1368,7 +1368,7 @@ The class `Project_next_opposite` calls the member functions
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 */
 template< typename Node >
@@ -1438,7 +1438,7 @@ The class `Project_normal` calls the member function
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 
 */
@@ -1509,7 +1509,7 @@ The class `Project_opposite_prev` calls the member functions
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 
 */
@@ -1580,7 +1580,7 @@ The class `Project_plane` calls the member function
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 
 */
@@ -1651,7 +1651,7 @@ The class `Project_point` calls the member function
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 */
 template< typename Node >
@@ -1721,7 +1721,7 @@ The class `Project_prev` calls the member function
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 */
 template< typename Node >
@@ -1791,7 +1791,7 @@ The class `Project_vertex` calls the member function
 
 
 
-\cgalModels `ProjectionObject`
+\cgalModels{ProjectionObject}
 
 */
 template< typename Node >
diff --git a/STL_Extension/doc/STL_Extension/CGAL/iterator.h b/STL_Extension/doc/STL_Extension/CGAL/iterator.h
index fdc82bb1ffda..2de6a6031cc5 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/iterator.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/iterator.h
@@ -12,7 +12,7 @@ specific object of type `T`.
 
 
 
-\cgalModels `RandomAccessIterator`
+\cgalModels{RandomAccessIterator}
 
 \sa `CGAL::Emptyset_iterator`
 \sa `CGAL::Oneset_iterator`
@@ -54,7 +54,7 @@ from input iterators.
 
 
 
-\cgalModels `InputIterator`
+\cgalModels{InputIterator}
 
 \cgalHeading{Requirements}
 
@@ -116,7 +116,7 @@ must be a subset of the parameters of `V`. Should the
 \tparam V must be a `std::tuple<...>` of the types of values to be accepted and dispatched.
 \tparam O must be a `std::tuple<...>` of the types of corresponding output iterators.
 
-\cgalModels `OutputIterator`
+\cgalModels{OutputIterator}
 
 \cgalExample{STL_Extension/Dispatch_output_iterator.cpp}
 
@@ -206,7 +206,7 @@ can be a list of arbitrary types.
 \tparam V must be a `std::tuple<...>` of the types of values to be accepted and dispatched.
 \tparam O must be a `std::tuple<...>` of the types of corresponding output iterators.
 
-\cgalModels `OutputIterator`
+\cgalModels{OutputIterator}
 
 \sa `CGAL::Dispatch_or_drop_output_iterator<V,O>`
 */
@@ -285,7 +285,7 @@ think of it as being connected to <TT>/dev/null</TT>.
 
 
 
-\cgalModels `OutputIterator`
+\cgalModels{OutputIterator}
 
 \sa `CGAL::Oneset_iterator`
 \sa `CGAL::Const_oneset_iterator`
@@ -395,7 +395,7 @@ to `std::insert_iterator`, but differs in that it calls the
 `insert()` function of the container without the iterator
 additional argument.
 
-\cgalModels `OutputIterator`
+\cgalModels{OutputIterator}
 
 \tparam Container provides a member function `insert(const Container::const_reference&)`.
 
@@ -536,7 +536,7 @@ object.
 
 
 
-\cgalModels `InputIterator`
+\cgalModels{InputIterator}
 
 \sa `CGAL::Creator_1<Arg, Result>`
 
@@ -595,7 +595,7 @@ The class `Join_input_iterator_2` joins two iterators. The result is again an it
 iterator category type as the original iterator) that reads an object
 from the stream and applies a function object to that object.
 
-\cgalModels `InputIterator`
+\cgalModels{InputIterator}
 
 
 */
@@ -646,7 +646,7 @@ The class `Join_input_iterator_3` joins three iterators. The result is again an
 iterator category type as the original iterator) that reads an object
 from the stream and applies a function object to that object.
 
-\cgalModels `InputIterator`
+\cgalModels{InputIterator}
 
 
 */
@@ -740,7 +740,7 @@ pointer to the referred object.
 
 
 
-\cgalModels `BidirectionalIterator`
+\cgalModels{BidirectionalIterator}
 
 \sa `CGAL::Emptyset_iterator`
 \sa `CGAL::Const_oneset_iterator`
diff --git a/STL_Extension/doc/STL_Extension/CGAL/tags.h b/STL_Extension/doc/STL_Extension/CGAL/tags.h
index 7a085e194be7..91b0ca5532d7 100644
--- a/STL_Extension/doc/STL_Extension/CGAL/tags.h
+++ b/STL_Extension/doc/STL_Extension/CGAL/tags.h
@@ -58,7 +58,7 @@ typedef CGAL::Boolean_tag<true> Tag_true;
 \ingroup PkgSTLExtensionUtilities
 
 Class indicating the absence of a functor.
-\cgalModels `DefaultConstructible`
+\cgalModels{DefaultConstructible}
 
 \sa `AlgebraicStructureTraits`
 \sa `RealEmbeddableTraits`
@@ -93,7 +93,7 @@ struct Parallel_if_available_tag {};
 
 General tag indicating that non of any other possible tags is valid.
 
-\cgalModels `DefaultConstructible`
+\cgalModels{DefaultConstructible}
 
 \sa `AlgebraicStructureTraits`
 
diff --git a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Advancing_front_mesher.h b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Advancing_front_mesher.h
index 35e133c39012..37e4644e5296 100644
--- a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Advancing_front_mesher.h
+++ b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Advancing_front_mesher.h
@@ -33,7 +33,7 @@ namespace Scale_space_reconstruction_3
  *  with the possibility of using an upper bound on the length of the
  *  produced facets.
  *
- *  \cgalModels CGAL::Scale_space_reconstruction_3::Mesher
+ *  \cgalModels{CGAL::Scale_space_reconstruction_3::Mesher}
  *
  *  \tparam Geom_traits geometric traits class. It must be a
  *  model of `DelaunayTriangulationTraits_3`. It must have a
diff --git a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Alpha_shape_mesher.h b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Alpha_shape_mesher.h
index 2a55578de06d..d0f393c08217 100644
--- a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Alpha_shape_mesher.h
+++ b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Alpha_shape_mesher.h
@@ -47,7 +47,7 @@ namespace Scale_space_reconstruction_3
  *  component of the surface where connected facets are locally oriented
  *  towards the same side of the surface.
  *
- *  \cgalModels CGAL::Scale_space_reconstruction_3::Mesher
+ *  \cgalModels{CGAL::Scale_space_reconstruction_3::Mesher}
  *
  *  \tparam Geom_traits is the geometric traits class. It must be a
  *  model of `DelaunayTriangulationTraits_3`. It must have a
diff --git a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Jet_smoother.h b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Jet_smoother.h
index cf34380ca1b9..40c28918831d 100644
--- a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Jet_smoother.h
+++ b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Jet_smoother.h
@@ -32,7 +32,7 @@ namespace Scale_space_reconstruction_3
  *  %Smoother for scale space reconstruction based on
  *  `CGAL::jet_smooth_point_set()`.
  *
- *  \cgalModels CGAL::Scale_space_reconstruction_3::Smoother
+ *  \cgalModels{CGAL::Scale_space_reconstruction_3::Smoother}
  *
  *  \tparam Geom_traits geometric traits class. It must be a
  *  model of `DelaunayTriangulationTraits_3`. It must have a
diff --git a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
index af9cda15c2d2..648b8480886c 100644
--- a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
+++ b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
@@ -41,7 +41,7 @@ namespace Scale_space_reconstruction_3
  *  %Smoother for scale space reconstruction based on a principal
  *  component analysis weighted by the local density of points.
  *
- *  \cgalModels CGAL::Scale_space_reconstruction_3::Smoother
+ *  \cgalModels{CGAL::Scale_space_reconstruction_3::Smoother}
  *
  *  \tparam Geom_traits geometric traits class. It must be a
  *  model of `DelaunayTriangulationTraits_3`. It must have a
diff --git a/SearchStructures/doc/SearchStructures/CGAL/Range_segment_tree_traits.h b/SearchStructures/doc/SearchStructures/CGAL/Range_segment_tree_traits.h
index 81615c89fcdf..bee9d44eb495 100644
--- a/SearchStructures/doc/SearchStructures/CGAL/Range_segment_tree_traits.h
+++ b/SearchStructures/doc/SearchStructures/CGAL/Range_segment_tree_traits.h
@@ -8,7 +8,7 @@ The class `Range_segment_tree_set_traits_2` is a range and segment tree traits c
 2-dimensional point class from the \cgal kernel. The class is
 parameterized with a representation class `R`.
 
-\cgalModels `RangeSegmentTreeTraits_k`
+\cgalModels{RangeSegmentTreeTraits_k}
 
 */
 template< typename R >
@@ -42,7 +42,7 @@ The class `Range_segment_tree_set_traits_3` is a range and segment tree traits c
 point class from the \cgal kernel.
 The class is parameterized with a representation class `R`.
 
-\cgalModels `RangeSegmentTreeTraits_k`
+\cgalModels{RangeSegmentTreeTraits_k}
 
 */
 template< typename R >
@@ -78,7 +78,7 @@ type `T` is associated to each key. The class is
 parameterized with a representation class `R` and the type of
 the associated data `T`.
 
-\cgalModels `RangeSegmentTreeTraits_k`
+\cgalModels{RangeSegmentTreeTraits_k}
 
 */
 template< typename R, typename T >
@@ -114,7 +114,7 @@ type `T` is associated to each key.
 The class is parameterized with a representation class `R` and the type of
 the associated data `T`.
 
-\cgalModels `RangeSegmentTreeTraits_k`
+\cgalModels{RangeSegmentTreeTraits_k}
 
 */
 template< typename R, typename T >
@@ -150,7 +150,7 @@ type `T` is associated to each interval. The class is
 parameterized with a representation class `R` and the type of
 the associated data `T`.
 
-\cgalModels `RangeSegmentTreeTraits_k`
+\cgalModels{RangeSegmentTreeTraits_k}
 
 */
 template< typename R, typename T >
@@ -186,7 +186,7 @@ type `T` is associated to each interval.
 The class is parameterized with a representation class `R` and the type of
 the associated data `T`.
 
-\cgalModels `RangeSegmentTreeTraits_k`
+\cgalModels{RangeSegmentTreeTraits_k}
 
 */
 template< typename R, typename T >
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_2.h
index 6fb02a67ddfc..49440d6654b3 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_2.h
@@ -35,7 +35,7 @@ A segment Delaunay graph can be seen as a container of faces and
 vertices. Therefore the `Segment_Delaunay_graph_2` class provides several iterators
 and circulators that allow to traverse it (completely or partially).
 
-\cgalModels `DelaunayGraph_2`
+\cgalModels{DelaunayGraph_2}
 
 \sa `CGAL::Segment_Delaunay_graph_traits_2<K,MTag>`
 \sa `CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_face_base_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_face_base_2.h
index 69fc93cf421a..9b60ce9d21dd 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_face_base_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_face_base_2.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgSegmentDelaunayGraph2Ref
 
-\cgalModels `SegmentDelaunayGraphFaceBase_2`
+\cgalModels{SegmentDelaunayGraphFaceBase_2}
 
 The class `Segment_Delaunay_graph_face_base_2` provides a model for the
 `SegmentDelaunayGraphFaceBase_2` concept which is the face
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_filtered_traits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_filtered_traits_2.h
index 00be59b9a757..58690b0e0254 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_filtered_traits_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_filtered_traits_2.h
@@ -53,10 +53,7 @@ The default values for the template parameters are as follows:
  <li> If the \gmp package is  installed with \cgal, the template parameter `EK` has the default   value: `EK = Simple_cartesian<Gmpq>`, otherwise its   default value is   `EK = Simple_cartesian<Quotient<MP_Float> >`.
 </ul>
 
-\cgalModels `SegmentDelaunayGraphTraits_2`
-\cgalModels `DefaultConstructible`
-\cgalModels `CopyConstructible`
-\cgalModels `Assignable`
+\cgalModels{SegmentDelaunayGraphTraits_2,DefaultConstructible,CopyConstructible,Assignable}
 
 \sa `SegmentDelaunayGraphTraits_2`
 \sa `CGAL::Field_tag`
@@ -211,10 +208,7 @@ default value is
 `EK = CGAL::Simple_cartesian<CGAL::MP_Float>`.
 </ul>
 
-\cgalModels `SegmentDelaunayGraphTraits_2`
-\cgalModels `DefaultConstructible`
-\cgalModels `CopyConstructible`
-\cgalModels `Assignable`
+\cgalModels{SegmentDelaunayGraphTraits_2,DefaultConstructible,CopyConstructible,Assignable}
 
 \sa `Kernel`
 \sa `SegmentDelaunayGraphTraits_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_hierarchy_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_hierarchy_2.h
index c1ef0bcc9fcb..a933bb886e56 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_hierarchy_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_hierarchy_2.h
@@ -68,9 +68,7 @@ The `Segment_Delaunay_graph_hierarchy_2` class derives publicly from the
 the same with its base class. In the sequel only additional types
 and methods defined are documented.
 
-\cgalModels `DefaultConstructible`
-\cgalModels `CopyConstructible`
-\cgalModels `Assignable`
+\cgalModels{DefaultConstructible,CopyConstructible,Assignable}
 
 \sa `CGAL::Segment_Delaunay_graph_2<Gt,St,DS>`
 \sa `CGAL::Triangulation_data_structure_2<Vb,Fb>`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_hierarchy_vertex_base_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_hierarchy_vertex_base_2.h
index 5ac99ae6de25..ed0cdbecfdff 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_hierarchy_vertex_base_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_hierarchy_vertex_base_2.h
@@ -11,7 +11,7 @@ vertex base required by the
 
 \tparam Vbb must be a model of the `SegmentDelaunayGraphVertexBase_2` concept.
 
-\cgalModels `SegmentDelaunayGraphHierarchyVertexBase_2`
+\cgalModels{SegmentDelaunayGraphHierarchyVertexBase_2}
 
 \sa `SegmentDelaunayGraphVertexBase_2`
 \sa `SegmentDelaunayGraphHierarchyVertexBase_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_site_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_site_2.h
index f55c92b636fb..e088f5126137 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_site_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_site_2.h
@@ -8,7 +8,7 @@ The class `Segment_Delaunay_graph_site_2` is a model for the concept
 `SegmentDelaunayGraphSite_2`.
 \tparam K must be a model of the `Kernel` concept.
 
-\cgalModels `SegmentDelaunayGraphSite_2`
+\cgalModels{SegmentDelaunayGraphSite_2}
 
 \sa `Kernel`
 \sa `SegmentDelaunayGraphSite_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_site_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_site_2.h
index 596717be5cc0..89417cb3cccf 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_site_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_site_2.h
@@ -9,7 +9,7 @@ The class `Segment_Delaunay_graph_storage_site_2` is a model for the concept
 
 \tparam Gt must be a model of the `SegmentDelaunayGraphStorageTraits_2` concept.
 
-\cgalModels `SegmentDelaunayGraphStorageSite_2`
+\cgalModels{SegmentDelaunayGraphStorageSite_2}
 
 \sa `CGAL::Segment_Delaunay_graph_site_2<K>`
 */
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_site_with_info_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_site_with_info_2.h
index fc8180ff3d80..695207b9e0d6 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_site_with_info_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_site_with_info_2.h
@@ -10,7 +10,7 @@ The class `Segment_Delaunay_graph_storage_site_with_info_2` is a model for the c
 \tparam STraits must be a model of the `SegmentDelaunayGraphStorageTraits_2` concept.
 \tparam Base must be a model of `SegmentDelaunayGraphStorageSite_2`
 
-\cgalModels `SegmentDelaunayGraphStorageSite_2`
+\cgalModels{SegmentDelaunayGraphStorageSite_2}
 
 \sa `CGAL::Segment_Delaunay_graph_site_2<K>`
 */
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_traits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_traits_2.h
index 8fb333abcc0f..7666eaa9584a 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_traits_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_traits_2.h
@@ -15,7 +15,7 @@ See section \ref Segment_Delaunay_graph_2StronglyIntersecting for more informati
 
 \tparam Gt must be a model of the concept `SegmentDelaunayGraphTraits_2`.
 
-\cgalModels `SegmentDelaunayGraphStorageTraits_2`
+\cgalModels{SegmentDelaunayGraphStorageTraits_2}
 
 \sa `CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,St,STag,DS>`
 \sa `CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_traits_with_info_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_traits_with_info_2.h
index 49dd92c5160e..854464d684ef 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_traits_with_info_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_storage_traits_with_info_2.h
@@ -9,7 +9,7 @@ The class `Segment_Delaunay_graph_storage_traits_with_info_2` provides a model f
 
 \tparam Gt must be a model of the concept `SegmentDelaunayGraphTraits_2`.
 
-\cgalModels `SegmentDelaunayGraphStorageTraits_2`
+\cgalModels{SegmentDelaunayGraphStorageTraits_2}
 
 \sa `CGAL::Segment_Delaunay_graph_storage_site_with_info_2`
 */
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_traits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_traits_2.h
index 1dead711c355..a8daa3fd2603 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_traits_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_traits_2.h
@@ -22,7 +22,7 @@ The way the predicates are evaluated is discussed in
 \cgalCite{b-ecvdl-96} and \cgalCite{cgal:k-reisv-04} (the geometric filtering
 part).
 
-\cgalModels `SegmentDelaunayGraphTraits_2`
+\cgalModels{SegmentDelaunayGraphTraits_2}
 
 \sa `Kernel`
 \sa `SegmentDelaunayGraphTraits_2`
@@ -95,7 +95,7 @@ The way the predicates are evaluated is discussed in
 \cgalCite{b-ecvdl-96} and \cgalCite{cgal:k-reisv-04} (the geometric filtering
 part).
 
-\cgalModels `SegmentDelaunayGraphTraits_2`
+\cgalModels{SegmentDelaunayGraphTraits_2}
 
 \sa `Kernel`
 \sa `SegmentDelaunayGraphTraits_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_vertex_base_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_vertex_base_2.h
index b925fa57dd9b..9881285b4136 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_vertex_base_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/CGAL/Segment_Delaunay_graph_vertex_base_2.h
@@ -4,7 +4,7 @@ namespace CGAL {
 /*!
 \ingroup PkgSegmentDelaunayGraph2Ref
 
-\cgalModels `SegmentDelaunayGraphVertexBase_2`
+\cgalModels{SegmentDelaunayGraphVertexBase_2}
 
 The class `Segment_Delaunay_graph_vertex_base_2` provides a model for the
 `SegmentDelaunayGraphVertexBase_2` concept which is the vertex
diff --git a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_2.h b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_2.h
index 39ff240f8ace..10e32d641890 100644
--- a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_2.h
+++ b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_2.h
@@ -19,7 +19,7 @@ which must be a model of `SegmentDelaunayGraphDataStructure_2`.
 `DS` defaults to
 `CGAL::Triangulation_data_structure_2< CGAL::Segment_Delaunay_graph_vertex_base_2<Gt>, CGAL::Triangulation_face_base_2<Gt> >`.
 
-\cgalModels `DelaunayGraph_2`
+\cgalModels{DelaunayGraph_2}
 
 \sa `SegmentDelaunayGraphLinfTraits_2`
 \sa `SegmentDelaunayGraphDataStructure_2`
diff --git a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_filtered_traits_2.h b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_filtered_traits_2.h
index a72aa365f48e..7ebee962afee 100644
--- a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_filtered_traits_2.h
+++ b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_filtered_traits_2.h
@@ -16,7 +16,7 @@ value for CK is CGAL::Simple_cartesian<double> (see also the examples
 in the user manual).
 
 
-\cgalModels `SegmentDelaunayGraphLinfTraits_2`
+\cgalModels{SegmentDelaunayGraphLinfTraits_2}
 
 \sa `CGAL::Segment_Delaunay_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>`
 \sa `CGAL::Segment_Delaunay_graph_Linf_2<Gt,STag,DS>`
@@ -49,7 +49,7 @@ value for CK is CGAL::Simple_cartesian<double> (see also the examples
 in the user manual).
 
 
-\cgalModels `SegmentDelaunayGraphLinfTraits_2`
+\cgalModels{SegmentDelaunayGraphLinfTraits_2}
 
 \sa `CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>`
 \sa `CGAL::Segment_Delaunay_graph_2<Gt,DS>`
diff --git a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_traits_2.h b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_traits_2.h
index e5c0d0c526a9..e459b1f3be7f 100644
--- a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_traits_2.h
+++ b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/CGAL/Segment_Delaunay_graph_Linf_traits_2.h
@@ -18,7 +18,7 @@ reasonable and valid values of the template parameters
 and should be preferred over
 `Segment_Delaunay_graph_Linf_traits_2`.
 
-\cgalModels `SegmentDelaunayGraphLinfTraits_2`
+\cgalModels{SegmentDelaunayGraphLinfTraits_2}
 
 \sa `CGAL::Segment_Delaunay_graph_traits_2<K,MTag>`
 \sa `CGAL::Segment_Delaunay_graph_Linf_2<Gt,DS>`
@@ -53,7 +53,7 @@ reasonable and valid values of the template parameters
 and should be preferred over
 `Segment_Delaunay_graph_Linf_traits_without_intersections_2`.
 
-\cgalModels `SegmentDelaunayGraphLinfTraits_2`
+\cgalModels{SegmentDelaunayGraphLinfTraits_2}
 
 \sa `CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>`
 \sa `CGAL::Segment_Delaunay_graph_2<Gt,DS>`
diff --git a/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC_traits.h b/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC_traits.h
index da8c37139901..37df7a5bcc04 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC_traits.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Efficient_RANSAC/Efficient_RANSAC_traits.h
@@ -23,7 +23,7 @@ namespace CGAL {
     \ingroup PkgShapeDetectionRANSAC
     \brief %Default traits class for the `CGAL::Shape_detection::Efficient_RANSAC`.
 
-    \cgalModels `EfficientRANSACTraits`
+    \cgalModels{EfficientRANSACTraits}
 
     \tparam Gt must be a model of the concept `Kernel` with `Gt::FT` being `float` or `double`.
 
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/K_neighbor_query.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/K_neighbor_query.h
index 87feb7a2bd73..9366ebaa6a60 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/K_neighbor_query.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/K_neighbor_query.h
@@ -49,7 +49,7 @@ namespace Point_set {
     a model of `ReadablePropertyMap` whose key type is the value type of the input
     range and value type is `Kernel::Point_2` or `Kernel::Point_3`
 
-    \cgalModels `NeighborQuery`
+    \cgalModels{NeighborQuery}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_circle_fit_region.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_circle_fit_region.h
index f3199cdcb7e6..15c5d39e13c7 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_circle_fit_region.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_circle_fit_region.h
@@ -48,7 +48,7 @@ namespace Point_set {
     \tparam NormalMap
     a model of `ReadablePropertyMap` whose key type is `Item` and value type is `Kernel::Vector_2`
 
-    \cgalModels `RegionType`
+    \cgalModels{RegionType}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_cylinder_fit_region.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_cylinder_fit_region.h
index 110cf55972dd..12543ef500f8 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_cylinder_fit_region.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_cylinder_fit_region.h
@@ -48,7 +48,7 @@ namespace Point_set {
     \tparam NormalMap
     a model of `ReadablePropertyMap` whose key type is `Item` and value type is `Kernel::Vector_3`
 
-    \cgalModels `RegionType`
+    \cgalModels{RegionType}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_line_fit_region.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_line_fit_region.h
index 8111ac2f599c..d61ecad6b1d6 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_line_fit_region.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_line_fit_region.h
@@ -50,7 +50,7 @@ namespace Point_set {
     a model of `ReadablePropertyMap` whose key type is the value type of the input
     range and value type is `Kernel::Vector_2`
 
-    \cgalModels `RegionType`
+    \cgalModels{RegionType}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_plane_fit_region.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_plane_fit_region.h
index 601f5f5748d5..912114e693ae 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_plane_fit_region.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_plane_fit_region.h
@@ -51,7 +51,7 @@ namespace Point_set {
     range and value type is `Kernel::Vector_3`
 
 
-    \cgalModels `RegionType`
+    \cgalModels{RegionType}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_sphere_fit_region.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_sphere_fit_region.h
index 4661f2ea132a..55b935c357ed 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_sphere_fit_region.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Least_squares_sphere_fit_region.h
@@ -50,7 +50,7 @@ namespace Point_set {
     a model of `ReadablePropertyMap` whose key type is the value type of the input
     range and value type is `Kernel::Vector_3`
 
-    \cgalModels `RegionType`
+    \cgalModels{RegionType}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Sphere_neighbor_query.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Sphere_neighbor_query.h
index e36658c45b55..3230b3b097a0 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Sphere_neighbor_query.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Point_set/Sphere_neighbor_query.h
@@ -48,7 +48,7 @@ namespace Point_set {
   \tparam PointMap
   a model of `ReadablePropertyMap` whose key type is `Item_` and value type is `GeomTraits::Point_2` or `GeomTraits::Point_3`
 
-  \cgalModels `NeighborQuery`
+  \cgalModels{NeighborQuery}
 */
 template<
 typename GeomTraits,
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h
index 74fa797fee41..61e157c8745a 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Least_squares_plane_fit_region.h
@@ -45,7 +45,7 @@ namespace Polygon_mesh {
     a model of `ReadablePropertyMap` whose key type is the vertex type of a polygon mesh and
     value type is `Kernel::Point_3`
 
-    \cgalModels `RegionType`
+    \cgalModels{RegionType}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/One_ring_neighbor_query.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/One_ring_neighbor_query.h
index 635d23d5fecd..71df088e9a07 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/One_ring_neighbor_query.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/One_ring_neighbor_query.h
@@ -38,7 +38,7 @@ namespace Polygon_mesh {
     a model of `ConstRange` whose iterator type is `RandomAccessIterator` and
     value type is the face type of a polygon mesh
 
-    \cgalModels `NeighborQuery`
+    \cgalModels{NeighborQuery}
   */
   template<typename PolygonMesh>
   class One_ring_neighbor_query
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Polyline_graph.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Polyline_graph.h
index 3c4fb0e823c7..6354362e7737 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Polyline_graph.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Polygon_mesh/Polyline_graph.h
@@ -38,7 +38,7 @@ namespace Polygon_mesh {
     a model of `ReadablePropertyMap` whose key type is the vertex type of a polygon mesh and
     value type is `Point_3` from a \cgal %Kernel
 
-    \cgalModels `NeighborQuery`
+    \cgalModels{NeighborQuery}
   */
   template<
     typename PolygonMesh,
diff --git a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Segment_set/Least_squares_line_fit_region.h b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Segment_set/Least_squares_line_fit_region.h
index 1ba03dfcb59e..702cbaa0fb95 100644
--- a/Shape_detection/include/CGAL/Shape_detection/Region_growing/Segment_set/Least_squares_line_fit_region.h
+++ b/Shape_detection/include/CGAL/Shape_detection/Region_growing/Segment_set/Least_squares_line_fit_region.h
@@ -47,7 +47,7 @@ namespace Segment_set {
     a model of `ReadablePropertyMap` whose key type is `Item`
     and value type is `Kernel::Segment_2` or `Kernel::Segment_3`
 
-    \cgalModels `RegionType`
+    \cgalModels{RegionType}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_regularization/include/CGAL/Shape_regularization/Contours/Longest_direction_2.h b/Shape_regularization/include/CGAL/Shape_regularization/Contours/Longest_direction_2.h
index 199417f31b18..55a6d51ac50d 100644
--- a/Shape_regularization/include/CGAL/Shape_regularization/Contours/Longest_direction_2.h
+++ b/Shape_regularization/include/CGAL/Shape_regularization/Contours/Longest_direction_2.h
@@ -42,7 +42,7 @@ namespace Contours {
     range and value type is `GeomTraits::Point_2`. The default is
     `CGAL::Identity_property_map<typename GeomTraits::Point_2>`.
 
-    \cgalModels `ContourDirections`
+    \cgalModels{ContourDirections}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_regularization/include/CGAL/Shape_regularization/Contours/Multiple_directions_2.h b/Shape_regularization/include/CGAL/Shape_regularization/Contours/Multiple_directions_2.h
index 6d0ac4dca6f2..0a5dda273406 100644
--- a/Shape_regularization/include/CGAL/Shape_regularization/Contours/Multiple_directions_2.h
+++ b/Shape_regularization/include/CGAL/Shape_regularization/Contours/Multiple_directions_2.h
@@ -48,7 +48,7 @@ namespace Contours {
     range and value type is `GeomTraits::Point_2`. The default is
     `CGAL::Identity_property_map<typename GeomTraits::Point_2>`.
 
-    \cgalModels `ContourDirections`
+    \cgalModels{ContourDirections}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_regularization/include/CGAL/Shape_regularization/Contours/User_defined_directions_2.h b/Shape_regularization/include/CGAL/Shape_regularization/Contours/User_defined_directions_2.h
index 442efbe56a7f..c1fe8a8d90a3 100644
--- a/Shape_regularization/include/CGAL/Shape_regularization/Contours/User_defined_directions_2.h
+++ b/Shape_regularization/include/CGAL/Shape_regularization/Contours/User_defined_directions_2.h
@@ -42,7 +42,7 @@ namespace Contours {
     range and value type is `GeomTraits::Point_2`. The default is
     `CGAL::Identity_property_map<typename GeomTraits::Point_2>`.
 
-    \cgalModels `ContourDirections`
+    \cgalModels{ContourDirections}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_regularization/include/CGAL/Shape_regularization/Segments/Angle_regularization_2.h b/Shape_regularization/include/CGAL/Shape_regularization/Segments/Angle_regularization_2.h
index 4413dd3c1333..f45f4a24f1c6 100644
--- a/Shape_regularization/include/CGAL/Shape_regularization/Segments/Angle_regularization_2.h
+++ b/Shape_regularization/include/CGAL/Shape_regularization/Segments/Angle_regularization_2.h
@@ -46,7 +46,7 @@ namespace Segments {
     range and value type is `GeomTraits::Segment_2`. The default is
     `CGAL::Identity_property_map<typename GeomTraits::Segment_2>`.
 
-    \cgalModels `RegularizationType`
+    \cgalModels{RegularizationType}
   */
   template<
   typename GeomTraits,
diff --git a/Shape_regularization/include/CGAL/Shape_regularization/Segments/Delaunay_neighbor_query_2.h b/Shape_regularization/include/CGAL/Shape_regularization/Segments/Delaunay_neighbor_query_2.h
index ef31b4089656..501997d16f17 100644
--- a/Shape_regularization/include/CGAL/Shape_regularization/Segments/Delaunay_neighbor_query_2.h
+++ b/Shape_regularization/include/CGAL/Shape_regularization/Segments/Delaunay_neighbor_query_2.h
@@ -52,7 +52,7 @@ namespace Segments {
     and value type is `GeomTraits::Segment_2`. The default is
     `CGAL::Identity_property_map<typename GeomTraits::Segment_2>`.
 
-    \cgalModels `NeighborQuery`
+    \cgalModels{NeighborQuery}
   */
   template<
     typename GeomTraits,
diff --git a/Shape_regularization/include/CGAL/Shape_regularization/Segments/Offset_regularization_2.h b/Shape_regularization/include/CGAL/Shape_regularization/Segments/Offset_regularization_2.h
index 0ea5e7e15234..597a101bcbe8 100644
--- a/Shape_regularization/include/CGAL/Shape_regularization/Segments/Offset_regularization_2.h
+++ b/Shape_regularization/include/CGAL/Shape_regularization/Segments/Offset_regularization_2.h
@@ -51,7 +51,7 @@ namespace Segments {
     and value type is `GeomTraits::Segment_2`. The default is
     `CGAL::Identity_property_map<typename GeomTraits::Segment_2>`.
 
-    \cgalModels `RegularizationType`
+    \cgalModels{RegularizationType}
   */
   template<
   typename GeomTraits,
diff --git a/Skin_surface_3/doc/Skin_surface_3/CGAL/Skin_surface_3.h b/Skin_surface_3/doc/Skin_surface_3/CGAL/Skin_surface_3.h
index 6268dc5925b6..cb1fe0066a11 100644
--- a/Skin_surface_3/doc/Skin_surface_3/CGAL/Skin_surface_3.h
+++ b/Skin_surface_3/doc/Skin_surface_3/CGAL/Skin_surface_3.h
@@ -12,7 +12,7 @@ The template argument must be a model of the concept
 to construct a regular triangulation of the weighted points and for
 point location in the mixed complex.
 
-\cgalModels `SkinSurface_3`
+\cgalModels{SkinSurface_3}
 
 */
 template< typename SkinSurfaceTraits_3 >
diff --git a/Skin_surface_3/doc/Skin_surface_3/CGAL/Skin_surface_traits_3.h b/Skin_surface_3/doc/Skin_surface_3/CGAL/Skin_surface_traits_3.h
index 9ce736e258ec..ca183bc617f6 100644
--- a/Skin_surface_3/doc/Skin_surface_3/CGAL/Skin_surface_traits_3.h
+++ b/Skin_surface_3/doc/Skin_surface_3/CGAL/Skin_surface_traits_3.h
@@ -10,7 +10,7 @@ the `SkinSurfaceTraits_3`.
 
 \tparam K must be a model of the `Kernel` concept.
 
-\cgalModels `SkinSurfaceTraits_3`
+\cgalModels{SkinSurfaceTraits_3}
 
 */
 template< typename K >
diff --git a/Skin_surface_3/doc/Skin_surface_3/CGAL/Union_of_balls_3.h b/Skin_surface_3/doc/Skin_surface_3/CGAL/Union_of_balls_3.h
index 697490f6a9dc..6c6ec8239c70 100644
--- a/Skin_surface_3/doc/Skin_surface_3/CGAL/Union_of_balls_3.h
+++ b/Skin_surface_3/doc/Skin_surface_3/CGAL/Union_of_balls_3.h
@@ -14,7 +14,7 @@ The template argument must be a model of the concept
 predicates to construct a regular triangulation of the weighted
 points.
 
-\cgalModels `SkinSurface_3`
+\cgalModels{SkinSurface_3}
 
 */
 template< typename SkinSurfaceTraits_3 >
diff --git a/Snap_rounding_2/doc/Snap_rounding_2/CGAL/Snap_rounding_traits_2.h b/Snap_rounding_2/doc/Snap_rounding_2/CGAL/Snap_rounding_traits_2.h
index 584dbdea0582..2a54841c21a8 100644
--- a/Snap_rounding_2/doc/Snap_rounding_2/CGAL/Snap_rounding_traits_2.h
+++ b/Snap_rounding_2/doc/Snap_rounding_2/CGAL/Snap_rounding_traits_2.h
@@ -27,7 +27,7 @@ coordinate, the resulting ISR, may be imprecise, and the distance between some
 vertex and a non-incident edge can be slightly less than the guaranteed
 half-the width-of-a-pixel.
 
-\cgalModels `SnapRoundingTraits_2`
+\cgalModels{SnapRoundingTraits_2}
 
 */
 template< typename Kernel >
diff --git a/Solver_interface/include/CGAL/Default_diagonalize_traits.h b/Solver_interface/include/CGAL/Default_diagonalize_traits.h
index 930dd681ce28..fcf8fd941c86 100644
--- a/Solver_interface/include/CGAL/Default_diagonalize_traits.h
+++ b/Solver_interface/include/CGAL/Default_diagonalize_traits.h
@@ -30,7 +30,7 @@ namespace CGAL {
 /// \tparam FT Number type
 /// \tparam dim Dimension of the matrices and vectors
 ///
-/// \cgalModels `DiagonalizeTraits`
+/// \cgalModels{DiagonalizeTraits}
 template <typename FT, unsigned int dim = 3>
 class Default_diagonalize_traits
 {
diff --git a/Solver_interface/include/CGAL/Diagonalize_traits.h b/Solver_interface/include/CGAL/Diagonalize_traits.h
index c4754bed5e9e..ee8e25b949b4 100644
--- a/Solver_interface/include/CGAL/Diagonalize_traits.h
+++ b/Solver_interface/include/CGAL/Diagonalize_traits.h
@@ -42,7 +42,7 @@ namespace CGAL {
 /// \tparam FT Number type
 /// \tparam dim Dimension of the matrices and vectors
 ///
-/// \cgalModels `DiagonalizeTraits`
+/// \cgalModels{DiagonalizeTraits}
 template <typename FT, unsigned int dim = 3>
 class Diagonalize_traits
 {
diff --git a/Solver_interface/include/CGAL/Eigen_diagonalize_traits.h b/Solver_interface/include/CGAL/Eigen_diagonalize_traits.h
index 2138c377e426..7572299b6222 100644
--- a/Solver_interface/include/CGAL/Eigen_diagonalize_traits.h
+++ b/Solver_interface/include/CGAL/Eigen_diagonalize_traits.h
@@ -51,7 +51,7 @@ struct Restricted_FT<float> { typedef float type; };
 /// \tparam FT Number type
 /// \tparam dim Dimension of the matrices and vectors
 ///
-/// \cgalModels `DiagonalizeTraits`
+/// \cgalModels{DiagonalizeTraits}
 ///
 /// \sa https://eigen.tuxfamily.org/index.php?title=Main_Page
 template <typename FT, unsigned int dim = 3>
diff --git a/Solver_interface/include/CGAL/Eigen_matrix.h b/Solver_interface/include/CGAL/Eigen_matrix.h
index 4f28c3f7c6fe..5fbbac62b7df 100644
--- a/Solver_interface/include/CGAL/Eigen_matrix.h
+++ b/Solver_interface/include/CGAL/Eigen_matrix.h
@@ -25,7 +25,7 @@ namespace CGAL {
 The class `Eigen_matrix` is a wrapper around `Eigen` matrix type
 <a href="https://eigen.tuxfamily.org/dox/classEigen_1_1Matrix.html">`Eigen::Matrix`</a>.
 
-\cgalModels `SvdTraits::Matrix`
+\cgalModels{SvdTraits::Matrix}
 
 \tparam T Number type.
 \tparam D1 Number of rows, or Dynamic
diff --git a/Solver_interface/include/CGAL/Eigen_solver_traits.h b/Solver_interface/include/CGAL/Eigen_solver_traits.h
index 428c33bad734..87e20f3eeb11 100644
--- a/Solver_interface/include/CGAL/Eigen_solver_traits.h
+++ b/Solver_interface/include/CGAL/Eigen_solver_traits.h
@@ -68,7 +68,7 @@ struct Get_eigen_matrix< ::Eigen::SparseLU<EigenMatrix, EigenOrdering >, FT>
 The class `Eigen_solver_traits` provides an interface to the sparse solvers of \ref thirdpartyEigen "Eigen".
 \ref thirdpartyEigen "Eigen" version 3.1 (or later) must be available on the system.
 
-\cgalModels `SparseLinearAlgebraWithFactorTraits_d` and `NormalEquationSparseLinearAlgebraTraits_d`
+\cgalModels{SparseLinearAlgebraWithFactorTraits_d,NormalEquationSparseLinearAlgebraTraits_d}
 
 \tparam EigenSolverT A sparse solver of \ref thirdpartyEigen "Eigen". The default solver is the iterative bi-conjugate gradient stabilized solver  `Eigen::BiCGSTAB` for `double`.
 
diff --git a/Solver_interface/include/CGAL/Eigen_sparse_matrix.h b/Solver_interface/include/CGAL/Eigen_sparse_matrix.h
index 20e8962bb152..c0f9d40bfa09 100644
--- a/Solver_interface/include/CGAL/Eigen_sparse_matrix.h
+++ b/Solver_interface/include/CGAL/Eigen_sparse_matrix.h
@@ -24,7 +24,7 @@ The class `Eigen_sparse_matrix` is a wrapper around `Eigen` matrix type
 <a href="https://eigen.tuxfamily.org/dox/classEigen_1_1SparseMatrix.html">`Eigen::SparseMatrix`</a>
 that represents general matrices, be they symmetric or not.
 
-\cgalModels `SparseLinearAlgebraTraits_d::Matrix`
+\cgalModels{SparseLinearAlgebraTraits_d::Matrix}
 
 \tparam T Number type.
 
@@ -305,7 +305,7 @@ The class `Eigen_sparse_symmetric_matrix` is a wrapper around `Eigen` matrix typ
 
 Since the matrix is symmetric, only the lower triangle part is stored.
 
-\cgalModels `SparseLinearAlgebraTraits_d::Matrix`
+\cgalModels{SparseLinearAlgebraTraits_d::Matrix}
 
 \tparam T Number type.
 
diff --git a/Solver_interface/include/CGAL/Eigen_svd.h b/Solver_interface/include/CGAL/Eigen_svd.h
index 276812001b81..252382860bfb 100644
--- a/Solver_interface/include/CGAL/Eigen_svd.h
+++ b/Solver_interface/include/CGAL/Eigen_svd.h
@@ -31,7 +31,7 @@ The class `Eigen_svd` provides an algorithm to solve in the least
 square sense a linear system with a singular value decomposition using
 \ref thirdpartyEigen.
 
-\cgalModels `SvdTraits`
+\cgalModels{SvdTraits}
 
 */
 class Eigen_svd
diff --git a/Solver_interface/include/CGAL/Eigen_vector.h b/Solver_interface/include/CGAL/Eigen_vector.h
index b50ac037eff4..313046c6010b 100644
--- a/Solver_interface/include/CGAL/Eigen_vector.h
+++ b/Solver_interface/include/CGAL/Eigen_vector.h
@@ -23,8 +23,7 @@ The class `Eigen_vector` is a wrapper around `Eigen`
 <a href="https://eigen.tuxfamily.org/dox/classEigen_1_1Matrix.html">vector type</a>,
 which is a simple array of numbers.
 
-\cgalModels `SvdTraits::Vector`
-\cgalModels `SparseLinearAlgebraTraits_d::Vector`.
+\cgalModels{SvdTraits::Vector,SparseLinearAlgebraTraits_d::Vector}
 
 \tparam T Number type.
 
diff --git a/Solver_interface/include/CGAL/GLPK_mixed_integer_program_traits.h b/Solver_interface/include/CGAL/GLPK_mixed_integer_program_traits.h
index 1218679b04ac..05f46dc378f0 100644
--- a/Solver_interface/include/CGAL/GLPK_mixed_integer_program_traits.h
+++ b/Solver_interface/include/CGAL/GLPK_mixed_integer_program_traits.h
@@ -56,7 +56,7 @@ int bound_type(FT lb, FT ub)
 ///      `CGAL::SCIP_mixed_integer_program_traits`, or derive a new
 ///      model from `CGAL::Mixed_integer_program_traits`.
 ///
-/// \cgalModels `MixedIntegerProgramTraits`
+/// \cgalModels{MixedIntegerProgramTraits}
 ///
 /// \sa `SCIP_mixed_integer_program_traits`
 template <typename FT>
diff --git a/Solver_interface/include/CGAL/Mixed_integer_program_traits.h b/Solver_interface/include/CGAL/Mixed_integer_program_traits.h
index 472e6dbc6094..4748f3150a19 100644
--- a/Solver_interface/include/CGAL/Mixed_integer_program_traits.h
+++ b/Solver_interface/include/CGAL/Mixed_integer_program_traits.h
@@ -100,7 +100,7 @@ namespace CGAL {
         ///
         /// The variable of a mixed integer program.
         ///
-        /// \cgalModels `MixedIntegerProgramVariable`
+        /// \cgalModels{MixedIntegerProgramVariable}
         template <typename FT>
         class Variable : public Solver_entry<FT>, public Bound<FT>
         {
@@ -199,7 +199,7 @@ namespace CGAL {
         ///
         /// The linear constraint of a mixed integer program.
         ///
-        /// \cgalModels `MixedIntegerProgramLinearConstraint`
+        /// \cgalModels{MixedIntegerProgramLinearConstraint}
         template <typename FT>
         class Linear_constraint : public Linear_expression<FT>, public Bound<FT>
         {
@@ -231,7 +231,7 @@ namespace CGAL {
         ///
         /// The linear objective of a mixed integer program.
         ///
-        /// \cgalModels `MixedIntegerProgramLinearObjective`
+        /// \cgalModels{MixedIntegerProgramLinearObjective}
         ///
         template <typename FT>
         class Linear_objective : public Linear_expression<FT>
@@ -281,7 +281,7 @@ namespace CGAL {
         /// \tparam FT Number type
         /// \endcond
         ///
-        /// \cgalModels `MixedIntegerProgramTraits`
+        /// \cgalModels{MixedIntegerProgramTraits}
         template <typename FT>
         class Mixed_integer_program_traits
         {
diff --git a/Solver_interface/include/CGAL/OSQP_quadratic_program_traits.h b/Solver_interface/include/CGAL/OSQP_quadratic_program_traits.h
index 261c4c514b03..46308431ea79 100644
--- a/Solver_interface/include/CGAL/OSQP_quadratic_program_traits.h
+++ b/Solver_interface/include/CGAL/OSQP_quadratic_program_traits.h
@@ -48,7 +48,7 @@ namespace CGAL {
   type is used. After the optimization is complete, the `OSQPFloat` type is converted back to `FT`.
   See more about `OSQPFloat` <a href="https://osqp.org/docs/interfaces/C.html#data-types">here</a>.
 
-  \cgalModels `QuadraticProgramTraits`
+  \cgalModels{QuadraticProgramTraits}
 */
 template<typename FT>
 class OSQP_quadratic_program_traits
diff --git a/Solver_interface/include/CGAL/SCIP_mixed_integer_program_traits.h b/Solver_interface/include/CGAL/SCIP_mixed_integer_program_traits.h
index 734a32b192ec..588da9bb9fb6 100644
--- a/Solver_interface/include/CGAL/SCIP_mixed_integer_program_traits.h
+++ b/Solver_interface/include/CGAL/SCIP_mixed_integer_program_traits.h
@@ -36,7 +36,7 @@ namespace CGAL {
 /// constrained or unconstrained mixed integer programs using
 /// \ref thirdpartySCIP (which must be available on the system).
 ///
-/// \cgalModels `MixedIntegerProgramTraits`
+/// \cgalModels{MixedIntegerProgramTraits}
 ///
 /// \sa `GLPK_mixed_integer_program_traits`
 template <typename FT>
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Euclidean_distance.h b/Spatial_searching/doc/Spatial_searching/CGAL/Euclidean_distance.h
index 720ddf074102..31544634d5cb 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Euclidean_distance.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Euclidean_distance.h
@@ -10,7 +10,7 @@ To optimize distance computations squared distances are used.
 \tparam Traits must be a model of the concept
 `SearchTraits`, for example `Search_traits_2<Simple_cartesian<double> >`.
 
-\cgalModels `OrthogonalDistance`
+\cgalModels{OrthogonalDistance}
 
 \sa `OrthogonalDistance`
 \sa `CGAL::Weighted_Minkowski_distance<Traits>`
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Euclidean_distance_sphere_point.h b/Spatial_searching/doc/Spatial_searching/CGAL/Euclidean_distance_sphere_point.h
index 80ff3473229f..d0eb8daacf4d 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Euclidean_distance_sphere_point.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Euclidean_distance_sphere_point.h
@@ -13,7 +13,7 @@ Euclidean distance between a \f$ d\f$-dimensional sphere and a
 \tparam Traits must be a model of the concept `SearchTraits`,
 for example `Simple_cartesian_d<double>`.
 
-\cgalModels `GeneralDistance`
+\cgalModels{GeneralDistance}
 
 \sa `GeneralDistance`
 
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_iso_box.h b/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_iso_box.h
index 298c72cf6679..9ddb9d11ca35 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_iso_box.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_iso_box.h
@@ -16,7 +16,7 @@ as follows:
 \tparam Traits must be a model of the concept
 `SearchTraits`, for example `CGAL::Search_traits_2<CGAL::Simple_cartesian<double> >`.
 
-\cgalModels `FuzzyQueryItem`
+\cgalModels{FuzzyQueryItem}
 */
 template< typename Traits >
 class Fuzzy_iso_box {
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_sphere.h b/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_sphere.h
index dac7c110cb01..2b1c73688268 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_sphere.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_sphere.h
@@ -20,7 +20,7 @@ inner approximation.
 \tparam Traits must be a model of the concept
 `SearchTraits`, for example `CGAL::Cartesian_d<double>`.
 
-\cgalModels `FuzzyQueryItem`
+\cgalModels{FuzzyQueryItem}
 */
 template< typename Traits >
 class Fuzzy_sphere {
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Manhattan_distance_iso_box_point.h b/Spatial_searching/doc/Spatial_searching/CGAL/Manhattan_distance_iso_box_point.h
index 3f97520fd01d..dd346747b6b1 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Manhattan_distance_iso_box_point.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Manhattan_distance_iso_box_point.h
@@ -13,7 +13,7 @@ and a `d`-dimensional iso-box defined as a `k-d` tree rectangle.
 \tparam Traits must be a model for the concept
 `SearchTraits`, for example `Search_traits_3<Simple_cartesian<double> >`.
 
-\cgalModels `GeneralDistance`
+\cgalModels{GeneralDistance}
 
 \sa `GeneralDistance`
 
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Plane_separator.h b/Spatial_searching/doc/Spatial_searching/CGAL/Plane_separator.h
index a2b010c77a1a..e206f669fc0a 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Plane_separator.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Plane_separator.h
@@ -9,7 +9,7 @@ hyperplane that is used to separate two half spaces.
 This hyperplane is defined by a cutting dimension `d` and a cutting
 value `v` as `xd=v`, where `v` denotes the `d`th coordinate value.
 
-\cgalModels `SpatialSeparator`
+\cgalModels{SpatialSeparator}
 
 */
 template< typename FT >
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits.h b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits.h
index 3493d48d4de9..c6039d687165 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits.h
@@ -6,7 +6,7 @@ namespace CGAL {
 The class `Search_traits` can be used as a template parameter of the kd tree
 and the search classes. It is a mere wrapper for the geometric types needed
 by these classes.
-\cgalModels `SearchTraits`
+\cgalModels{SearchTraits}
 
 \sa `Search_traits_2<Kernel>`
 \sa `Search_traits_3<Kernel>`
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_2.h b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_2.h
index 9e63afc17a3c..7efffca47bfb 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_2.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_2.h
@@ -9,8 +9,7 @@ and the search classes.
 \tparam SearchGeomTraits must be a model of the concept `SearchGeomTraits_2`,
 for example `Simple_cartesian<double>` or `Simple_cartesian<Gmpq>`.
 
-\cgalModels `SearchTraits`
-\cgalModels `RangeSearchTraits`
+\cgalModels{SearchTraits,RangeSearchTraits}
 
 \sa `Search_traits_3<SearchGeomTraits_2>`
 \sa `Search_traits<NT,Point,CartesianConstIterator,ConstructCartesianConstIterator,Dim>`
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_3.h b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_3.h
index 75dcda8229e9..5862d6fe6d4a 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_3.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_3.h
@@ -9,8 +9,7 @@ and the search classes.
 \tparam GeomTraits must be a model of the concept `SearchGeomTraits_3`,
 for example `Simple_cartesian<double>` or `Simple_cartesian<Gmpq>`.
 
-\cgalModels `SearchTraits`
-\cgalModels `RangeSearchTraits`
+\cgalModels{SearchTraits,RangeSearchTraits}
 
 \sa `Search_traits_2<Kernel>`
 \sa `Search_traits<NT,Point,CartesianConstIterator,ConstructCartesianConstIterator,Dim>`
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_adapter.h b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_adapter.h
index 78ed637466b5..646ecf4b4a84 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_adapter.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_adapter.h
@@ -16,8 +16,8 @@ with `Key` as  key type  and `Base_distance::Point_d` as  value type.
 
 \tparam Base_distance is a model of either `GeneralDistance` or `OrthogonalDistance`.
 
-\cgalModels `GeneralDistance` if Base_distance is a model of `GeneralDistance`
-\cgalModels `OrthogonalDistance` if Base_distance is a model of `OrthogonalDistance`
+\cgalModels{GeneralDistance if Base_distance is a model of `GeneralDistance`,
+            OrthogonalDistance if Base_distance is a model of `OrthogonalDistance`}
 
 \sa `Search_traits_adapter<Key,PointPropertyMap,BaseTraits>`
 
@@ -87,8 +87,8 @@ with `Key` as `key_type` and `Base_distance::Point_d` as `value_type`.
 
 \tparam BaseTraits is a model of either `SearchTraits` or `RangeSearchTraits`.
 
-\cgalModels `SearchTraits` if `BaseTraits` is a model of `SearchTraits`.
-\cgalModels `RangeSearchTraits` if `BaseTraits` is a model of `RangeSearchTraits`.
+\cgalModels{SearchTraits if `BaseTraits` is a model of `SearchTraits`.,
+            RangeSearchTraits if `BaseTraits` is a model of `RangeSearchTraits`.}
 
 \sa `Distance_adapter<Key,PointPropertyMap,Base_distance>`
 \sa `Search_traits_2<Kernel>`
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_d.h b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_d.h
index a25f1e967960..0dba1c583ee4 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_d.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_d.h
@@ -11,8 +11,7 @@ and the search classes.
 \tparam Dim must be a `Dimension_tag`
 (default value is `Dynamic_dimension_tag`).
 
-\cgalModels `SearchTraits`
-\cgalModels `RangeSearchTraits`
+\cgalModels{SearchTraits,RangeSearchTraits}
 
 \sa `Search_traits_2<Kernel>`
 \sa `Search_traits_3<Kernel>`
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Splitters.h b/Spatial_searching/doc/Spatial_searching/CGAL/Splitters.h
index dc0a8248824d..11f6ffda3226 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Splitters.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Splitters.h
@@ -20,7 +20,7 @@ the concept `SearchTraits`, for example `CGAL::Search_traits_2`.
 \tparam SpatialSeparator must be a model of the concept `SpatialSeparator`.
 It has as default value the type `Plane_separator<Traits::FT>`.
 
-\cgalModels `Splitter`
+\cgalModels{Splitter}
 
 \sa `Splitter`
 \sa `SpatialSeparator`
@@ -78,7 +78,7 @@ the type `CGAL::Search_traits_3< Cartesian<double> >`.
 Expects for the second template argument a model of the concept `SpatialSeparator`. It has as default value
 the type, `CGAL::Plane_separator<Traits::FT>`.
 
-\cgalModels `Splitter`
+\cgalModels{Splitter}
 
 \sa `Splitter`
 \sa `SpatialSeparator`
@@ -125,7 +125,7 @@ the type `CGAL::Search_traits_3< Cartesian<double> >`.
 Expects for the second template argument a model of the concept `SpatialSeparator`. It has as default value
 the type, `CGAL::Plane_separator<Traits::FT>`.
 
-\cgalModels `Splitter`
+\cgalModels{Splitter}
 
 \sa `Splitter`
 \sa `SpatialSeparator`
@@ -171,7 +171,7 @@ the type `CGAL::Search_traits_3< Cartesian<double> >`.
 Expects for the second template argument a model of the concept `SpatialSeparator`. It has as default value
 the type, `CGAL::Plane_separator<Traits::FT>`
 
-\cgalModels `Splitter`
+\cgalModels{Splitter}
 
 \sa `Splitter`
 \sa `SpatialSeparator`
@@ -216,7 +216,7 @@ the type `CGAL::Search_traits_3< Cartesian<double> >`.
 Expects for the second template argument a model of the concept `SpatialSeparator`. It has as default value
 the type, `CGAL::Plane_separator<Traits::FT>`
 
-\cgalModels `Splitter`
+\cgalModels{Splitter}
 
 \sa `Splitter`
 \sa `SpatialSeparator`
@@ -279,7 +279,7 @@ for example `CGAL::Cartesian_d<double>`.
 Expects for the second template argument a model of the concept `SpatialSeparator`. It has as default value
 the type, `CGAL::Plane_separator<Traits::FT>`
 
-\cgalModels `Splitter`
+\cgalModels{Splitter}
 
 \sa `Splitter`
 \sa `SpatialSeparator`
@@ -351,7 +351,7 @@ Expects for the first template argument a model of the concept
 Expects for the second template argument a model of the concept `SpatialSeparator`. It has as default value
 the type, `CGAL::Plane_separator<Traits::FT>`.
 
-\cgalModels `Splitter`
+\cgalModels{Splitter}
 
 \sa `Splitter`
 \sa `SpatialSeparator`
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Weighted_Minkowski_distance.h b/Spatial_searching/doc/Spatial_searching/CGAL/Weighted_Minkowski_distance.h
index 80dd86776993..01041c944014 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Weighted_Minkowski_distance.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Weighted_Minkowski_distance.h
@@ -16,7 +16,7 @@ done exact but with floating point arithmetic.
 \tparam Traits must be a model of the concept
 `SearchTraits`, for example `Search_traits_2`.
 
-\cgalModels `OrthogonalDistance`
+\cgalModels{OrthogonalDistance}
 
 \sa `OrthogonalDistance`
 \sa `CGAL::Euclidean_distance<Traits>`
diff --git a/Spatial_sorting/doc/Spatial_sorting/CGAL/Hilbert_policy_tags.h b/Spatial_sorting/doc/Spatial_sorting/CGAL/Hilbert_policy_tags.h
index fcad7194a58e..e6d34441b739 100644
--- a/Spatial_sorting/doc/Spatial_sorting/CGAL/Hilbert_policy_tags.h
+++ b/Spatial_sorting/doc/Spatial_sorting/CGAL/Hilbert_policy_tags.h
@@ -9,8 +9,7 @@ in order to specify the strategy for spatial sorting.
 `Hilbert_policy<Median>` can be passed to
 as parameter to `hilbert_sort()` to choose the sorting policy.
 
-\cgalModels `DefaultConstructible`
-\cgalModels `CopyConstructible`
+\cgalModels{DefaultConstructible,CopyConstructible}
 
 \sa `Middle`
 \sa `Hilbert_policy`
@@ -27,8 +26,7 @@ in order to specify the strategy for spatial sorting.
 `Hilbert_policy<Middle>` can be passed to
 as parameter to `hilbert_sort()` to choose the sorting policy.
 
-\cgalModels `DefaultConstructible`
-\cgalModels `CopyConstructible`
+\cgalModels{DefaultConstructible,CopyConstructible}
 
 \sa `Median`
 \sa `Hilbert_policy`
@@ -47,8 +45,7 @@ can be passed  as parameter to `hilbert_sort()` to choose the sorting policy.
 
 \tparam Tag must be either `Median` or `Middle`.
 
-\cgalModels `DefaultConstructible`
-\cgalModels `CopyConstructible`
+\cgalModels{DefaultConstructible,CopyConstructible}
 
 \sa `Median`
 \sa `Middle`
diff --git a/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_2.h b/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_2.h
index 92b8a1ff2c73..eb67bdc3b80e 100644
--- a/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_2.h
+++ b/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_2.h
@@ -13,7 +13,7 @@ while the actual point type is `Base_traits::Point_2`.
 \tparam PointPropertyMap must be a model of `ReadablePropertyMap`
 with value type `Base_traits::Point_2`.
 
-\cgalModels `SpatialSortingTraits_2`
+\cgalModels{SpatialSortingTraits_2}
 */
 template< typename Base_traits, typename PointPropertyMap >
 class Spatial_sort_traits_adapter_2 : public Base_traits {
diff --git a/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_3.h b/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_3.h
index 242620de70d8..f10db637accc 100644
--- a/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_3.h
+++ b/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_3.h
@@ -13,7 +13,7 @@ while the actual point type is `Base_traits::Point_3`.
 \tparam PointPropertyMap must be a model of `ReadablePropertyMap`
 with value type `Base_traits::Point_3`.
 
-\cgalModels `SpatialSortingTraits_3`
+\cgalModels{SpatialSortingTraits_3}
 
 */
 template< typename Base_traits, typename PointPropertyMap >
diff --git a/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_d.h b/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_d.h
index ca5479c2c388..6dde64ad80b1 100644
--- a/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_d.h
+++ b/Spatial_sorting/doc/Spatial_sorting/CGAL/Spatial_sort_traits_adapter_d.h
@@ -13,7 +13,7 @@ while the actual point type is `Base_traits::Point_d`.
 \tparam PointPropertyMap must be a model of `ReadablePropertyMap`
 with value type `Base_traits::Point_d`.
 
-\cgalModels `SpatialSortingTraits_d`
+\cgalModels{SpatialSortingTraits_d}
 
 */
 template< typename Base_traits, typename PointPropertyMap >
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Polygon_offset_builder_traits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Polygon_offset_builder_traits_2.h
index 148efbf52f59..09a9caddeb13 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Polygon_offset_builder_traits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Polygon_offset_builder_traits_2.h
@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgStraightSkeleton2Classes
 
-\cgalModels `PolygonOffsetBuilderTraits_2`
+\cgalModels{PolygonOffsetBuilderTraits_2}
 
 The class `Polygon_offset_builder_traits_2` provides a model for the
 concept `PolygonOffsetBuilderTraits_2`, which is the traits class
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_2.h
index 2c386eae9369..727da054561f 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_2.h
@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgStraightSkeleton2Classes
 
-\cgalModels `StraightSkeleton_2`
+\cgalModels{StraightSkeleton_2}
 
 \brief The class `Straight_skeleton_2` provides a model for the `StraightSkeleton_2` concept
 which is the class type used to represent a straight skeleton.
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h
index 9b69d3cc9f7b..65eab3b3333a 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_2.h
@@ -12,7 +12,7 @@ type required by the `Straight_skeleton_builder_2` algorithm class.
 This class is the default visitor parameter of the straight skeleton builder.
 All its methods are empty.
 
-\cgalModels `StraightSkeletonBuilder_2_Visitor`
+\cgalModels{StraightSkeletonBuilder_2_Visitor}
 
 \sa `Straight_skeleton_builder_2`
 */
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_traits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_traits_2.h
index 0b79000692e7..656ecf75b306 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_traits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_builder_traits_2.h
@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgStraightSkeleton2Classes
 
-\cgalModels `StraightSkeletonBuilderTraits_2`
+\cgalModels{StraightSkeletonBuilderTraits_2}
 
 The class `Straight_skeleton_builder_traits_2` provides a model for the
 concept `StraightSkeletonBuilderTraits_2`, which is the traits class
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_converter_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_converter_2.h
index d3ff08ad9f40..4a5cdfc9a235 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_converter_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_converter_2.h
@@ -87,7 +87,7 @@ boost::shared_ptr<Target_skeleton> operator()( const Source_skeleton& s) const;
 /*!
 \ingroup PkgStraightSkeleton2Auxiliary
 
-\cgalModels `StraightSkeletonItemsConverter_2`
+\cgalModels{StraightSkeletonItemsConverter_2}
 
 `Straight_skeleton_items_converter_2` is a model of the `StraightSkeletonItemsConverter_2` concept
 
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_face_base_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_face_base_2.h
index 51e8e003fbb6..bc13c7b0fa71 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_face_base_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_face_base_2.h
@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgStraightSkeleton2Auxiliary
 
-\cgalModels `StraightSkeletonFace_2`
+\cgalModels{StraightSkeletonFace_2}
 
 The class `Straight_skeleton_face_base_2` provides a model for the
 concept `StraightSkeletonFace_2`, which is the face type required by the `StraightSkeleton_2` concept.
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_halfedge_base_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_halfedge_base_2.h
index ee4f67fe6480..ce86de1a3ab9 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_halfedge_base_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_halfedge_base_2.h
@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgStraightSkeleton2Auxiliary
 
-\cgalModels `StraightSkeletonHalfedge_2`
+\cgalModels{StraightSkeletonHalfedge_2}
 
 The class `Straight_skeleton_halfedge_base_2` provides a model for the concept `StraightSkeletonHalfedge_2`,
 which is the halfedge type required by the `StraightSkeleton_2` concept.
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h
index fb30f495c46c..5f104bf83780 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h
@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgStraightSkeleton2Auxiliary
 
-\cgalModels `StraightSkeletonVertex_2`
+\cgalModels{StraightSkeletonVertex_2}
 
 The class `Straight_skeleton_vertex_base_2` provides a model for the `StraightSkeletonVertex_2` concept
 which is the vertex type required by the `StraightSkeleton_2` concept.
diff --git a/Stream_lines_2/doc/Stream_lines_2/CGAL/Euler_integrator_2.h b/Stream_lines_2/doc/Stream_lines_2/CGAL/Euler_integrator_2.h
index 8562be8184e4..2769141eb0bb 100644
--- a/Stream_lines_2/doc/Stream_lines_2/CGAL/Euler_integrator_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/CGAL/Euler_integrator_2.h
@@ -7,7 +7,7 @@ This class implements the first order Euler integrator.
 
 \tparam VectorField_2 has to be instantiated by a model of the concept `VectorField_2`.
 
-\cgalModels `Integrator_2`
+\cgalModels{Integrator_2}
 
 \sa `Runge_kutta_integrator_2<VectorField_2>`
 
diff --git a/Stream_lines_2/doc/Stream_lines_2/CGAL/Regular_grid_2.h b/Stream_lines_2/doc/Stream_lines_2/CGAL/Regular_grid_2.h
index b690baa7951e..398f6d620687 100644
--- a/Stream_lines_2/doc/Stream_lines_2/CGAL/Regular_grid_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/CGAL/Regular_grid_2.h
@@ -11,7 +11,7 @@ vector value is interpolated from the vertices of `c`).
 
 \tparam StreamLinesTraits_2 has to instantiated by a model of the concept `StreamLinesTraits_2`.
 
-\cgalModels `VectorField_2`
+\cgalModels{VectorField_2}
 
 \sa `Triangular_field_2<StreamLinesTraits_2>`
 
diff --git a/Stream_lines_2/doc/Stream_lines_2/CGAL/Runge_kutta_integrator_2.h b/Stream_lines_2/doc/Stream_lines_2/CGAL/Runge_kutta_integrator_2.h
index f0624e01384a..4ea9c7fc4f7c 100644
--- a/Stream_lines_2/doc/Stream_lines_2/CGAL/Runge_kutta_integrator_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/CGAL/Runge_kutta_integrator_2.h
@@ -7,7 +7,7 @@ This class implements the second order Runge-Kutta integrator.
 
 \tparam VectorField_2 has to be instantiated by a model of the concept `VectorField_2`.
 
-\cgalModels `Integrator_2`
+\cgalModels{Integrator_2}
 
 \sa `Euler_integrator_2<VectorField_2>`
 
diff --git a/Stream_lines_2/doc/Stream_lines_2/CGAL/Triangular_field_2.h b/Stream_lines_2/doc/Stream_lines_2/CGAL/Triangular_field_2.h
index fda0a8cc7e97..1758f1c6ef61 100644
--- a/Stream_lines_2/doc/Stream_lines_2/CGAL/Triangular_field_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/CGAL/Triangular_field_2.h
@@ -12,7 +12,7 @@ vertices of the face `f`.
 
 \tparam StreamLinesTraits_2 has to be instantiated by a model of the concept `StreamLinesTraits_2`.
 
-\cgalModels `VectorField_2`
+\cgalModels{VectorField_2}
 
 \sa `Regular_grid_2<StreamLinesTraits_2>`
 
diff --git a/Stream_support/include/CGAL/IO/Istream_iterator.h b/Stream_support/include/CGAL/IO/Istream_iterator.h
index 04a2d93cad91..1ae51232129c 100644
--- a/Stream_support/include/CGAL/IO/Istream_iterator.h
+++ b/Stream_support/include/CGAL/IO/Istream_iterator.h
@@ -28,7 +28,7 @@ The class `Istream_iterator` is an input iterator adaptor for the
 input stream class `Stream` and value type `T`. It is particularly
 useful for classes that are similar but not compatible to `std::istream`.
 
-\cgalModels `InputIterator`
+\cgalModels{InputIterator}
 */
 template <class T, class Stream>
 class Istream_iterator
diff --git a/Stream_support/include/CGAL/IO/Ostream_iterator.h b/Stream_support/include/CGAL/IO/Ostream_iterator.h
index 8d3911471cf9..4bdeaa6689bc 100644
--- a/Stream_support/include/CGAL/IO/Ostream_iterator.h
+++ b/Stream_support/include/CGAL/IO/Ostream_iterator.h
@@ -46,7 +46,7 @@ class Ostream_proxy
 The class `Ostream_iterator` is an output iterator adaptor for the
 output stream class `Stream` and value type `T`.
 
-\cgalModels `OutputIterator`
+\cgalModels{OutputIterator}
 
 \cgalHeading{Implementation}
 
diff --git a/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_masks_3.h b/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_masks_3.h
index af0d0d3e22a8..af9edb119681 100644
--- a/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_masks_3.h
+++ b/Subdivision_method_3/include/CGAL/Subdivision_method_3/subdivision_masks_3.h
@@ -142,7 +142,7 @@ such as `Polyhedron_3` and `Surface_mesh`.
 \image html CCBorderMask.svg
 
 
-\cgalModels `PQQMask_3`
+\cgalModels{PQQMask_3}
 
 \sa `CGAL::Subdivision_method_3`
 */
@@ -266,7 +266,7 @@ such as `Polyhedron_3` and `Surface_mesh`.
 \image html LoopBorderMask.png
 \image latex LoopBorderMask.png
 
-\cgalModels `PTQMask_3`
+\cgalModels{PTQMask_3}
 
 \sa `CGAL::Subdivision_method_3`
 
@@ -429,7 +429,7 @@ such as `Polyhedron_3` and `Surface_mesh`.
 \image html DSCornerMask.png
 \image latex DSCornerMask.png
 
-\cgalModels `DQQMask_3`
+\cgalModels{DQQMask_3}
 
 \sa `CGAL::Subdivision_method_3`
 
@@ -523,7 +523,7 @@ such as `Polyhedron_3` and `Surface_mesh`.
 \tparam PolygonMesh must be a model of the concept `MutableFaceGraph`. Additionally all faces must be triangles.
 \tparam VertexPointMap must be a model of `WritablePropertyMap` with value type `Point_3`
 
-\cgalModels `Sqrt3Mask_3`
+\cgalModels{Sqrt3Mask_3}
 
 \sa `CGAL::Subdivision_method_3`
 
diff --git a/Surface_mesh/include/CGAL/Surface_mesh/Properties.h b/Surface_mesh/include/CGAL/Surface_mesh/Properties.h
index 31eea166ee58..1e5c73c84c3e 100644
--- a/Surface_mesh/include/CGAL/Surface_mesh/Properties.h
+++ b/Surface_mesh/include/CGAL/Surface_mesh/Properties.h
@@ -528,7 +528,7 @@ class Property_container
 /// @tparam Key The key type of the property map. It must be a model of `Index`.
 /// @tparam Value The value type of the property.
 ///
-/// \cgalModels `LvaluePropertyMap`
+/// \cgalModels{LvaluePropertyMap}
 ///
 template <class I, class T, class CRTP_derived_class>
 class Property_map_base
diff --git a/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h b/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
index c109f002a3a6..559aec265f09 100644
--- a/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
+++ b/Surface_mesh/include/CGAL/Surface_mesh/Surface_mesh.h
@@ -325,7 +325,7 @@ namespace CGAL {
   /// @tparam P The type of the \em point property of a vertex. There is no requirement on `P`,
   ///         besides being default constructible and assignable.
   ///         In typical use cases it will be a 2D or 3D point type.
-  /// \cgalModels `MutableFaceGraph` and `FaceListGraph`
+  /// \cgalModels{MutableFaceGraph,FaceListGraph}
   ///
   /// \sa \ref PkgBGLConcepts "Graph Concepts"
 
@@ -375,9 +375,7 @@ class Surface_mesh
 #ifdef DOXYGEN_RUNNING
 
     /// This class represents a vertex.
-    /// \cgalModels `Index`
-    /// \cgalModels `LessThanComparable`
-    /// \cgalModels `Hashable`
+    /// \cgalModels{Index,LessThanComparable,Hashable}
     /// \sa `Halfedge_index`, `Edge_index`, `Face_index`
     class Vertex_index
     {
@@ -398,9 +396,7 @@ class Surface_mesh
 #ifdef DOXYGEN_RUNNING
 
     /// This class represents a halfedge.
-    /// \cgalModels `Index`
-    /// \cgalModels `LessThanComparable`
-    /// \cgalModels `Hashable`
+    /// \cgalModels{Index,LessThanComparable,Hashable}
     /// \sa `Vertex_index`, `Edge_index`, `Face_index`
     class Halfedge_index
     {
@@ -422,9 +418,7 @@ class Surface_mesh
 
 #ifdef DOXYGEN_RUNNING
     /// This class represents a face
-    /// \cgalModels `Index`
-    /// \cgalModels `LessThanComparable`
-    /// \cgalModels `Hashable`
+    /// \cgalModels{Index,LessThanComparable,Hashable}
     /// \sa `Vertex_index`, `Halfedge_index`, `Edge_index`
     class Face_index
     {
@@ -444,9 +438,7 @@ class Surface_mesh
 
 #ifdef DOXYGEN_RUNNING
     /// This class represents an edge.
-    /// \cgalModels `Index`
-    /// \cgalModels `LessThanComparable`
-    /// \cgalModels `Hashable`
+    /// \cgalModels{Index,LessThanComparable,Hashable}
     /// \sa `Vertex_index`, `Halfedge_index`, `Face_index`
     class Edge_index
     {
diff --git a/Surface_mesh_approximation/include/CGAL/Surface_mesh_approximation/L21_metric_plane_proxy.h b/Surface_mesh_approximation/include/CGAL/Surface_mesh_approximation/L21_metric_plane_proxy.h
index 7178bc68f33a..e7ea59e67b25 100644
--- a/Surface_mesh_approximation/include/CGAL/Surface_mesh_approximation/L21_metric_plane_proxy.h
+++ b/Surface_mesh_approximation/include/CGAL/Surface_mesh_approximation/L21_metric_plane_proxy.h
@@ -31,7 +31,7 @@ namespace Surface_mesh_approximation {
 /// \ingroup PkgTSMARef
 /// @brief Approximation L21 metric of vector proxy.
 ///
-/// \cgalModels `ErrorMetricProxy`
+/// \cgalModels{ErrorMetricProxy}
 ///
 /// @tparam TriangleMesh a triangle `FaceGraph`
 /// @tparam VertexPointMap a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%vertex_descriptor`
diff --git a/Surface_mesh_approximation/include/CGAL/Surface_mesh_approximation/L2_metric_plane_proxy.h b/Surface_mesh_approximation/include/CGAL/Surface_mesh_approximation/L2_metric_plane_proxy.h
index 1f3e012ce860..67121dcdcdfc 100644
--- a/Surface_mesh_approximation/include/CGAL/Surface_mesh_approximation/L2_metric_plane_proxy.h
+++ b/Surface_mesh_approximation/include/CGAL/Surface_mesh_approximation/L2_metric_plane_proxy.h
@@ -32,7 +32,7 @@ namespace Surface_mesh_approximation {
 /// \ingroup PkgTSMARef
 /// @brief Approximation L2 metric of plane proxy.
 ///
-/// \cgalModels `ErrorMetricProxy`
+/// \cgalModels{ErrorMetricProxy}
 ///
 /// @tparam TriangleMesh a triangle `FaceGraph`
 /// @tparam VertexPointMap a class model of `ReadablePropertyMap` with `boost::graph_traits<TriangleMesh>::%vertex_descriptor`
diff --git a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
index 98c938b5fbcd..60c52e52e7f9 100644
--- a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
+++ b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
@@ -21,7 +21,7 @@ namespace CGAL {
 /// A class to compute the closest rotation in Frobenius norm to a 3x3 Matrix using the \link thirdpartyEigen `Eigen` library \endlink.
 /// The internal computation relies on `Eigen::JacobiSVD<>` solver.
 ///
-/// \cgalModels `DeformationClosestRotationTraits_3`
+/// \cgalModels{DeformationClosestRotationTraits_3}
 class Deformation_Eigen_closest_rotation_traits_3{
 public:
 
diff --git a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
index 7ffc0cc17d01..a73d8225bdb9 100644
--- a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
+++ b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
@@ -23,7 +23,7 @@ namespace CGAL {
   /// The internal computation relies on a hybrid system using the solvers `Eigen::SelfAdjointEigenSolver<>`
   /// and `Eigen::JacobiSVD<>` (polar decomposition).
   ///
-  /// \cgalModels `DeformationClosestRotationTraits_3`
+  /// \cgalModels{DeformationClosestRotationTraits_3}
   class Deformation_Eigen_polar_closest_rotation_traits_3 :
     public Deformation_Eigen_closest_rotation_traits_3{
   public:
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h
index 485da4c6975c..7ff51e70ce0a 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h
@@ -134,7 +134,7 @@ namespace Surface_mesh_parameterization {
 ///
 /// A one-to-one mapping is *not* guaranteed.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Barycentric_mapping_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Barycentric_mapping_parameterizer_3.h
index 15ac8ec8aef9..12e4e63feb48 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Barycentric_mapping_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Barycentric_mapping_parameterizer_3.h
@@ -49,7 +49,7 @@ namespace Surface_mesh_parameterization {
 ///   the matrix `A` for `j` neighbor vertex of `i`, based on Tutte Barycentric
 ///   Mapping method.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Circular_border_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Circular_border_parameterizer_3.h
index 321f32b99d53..b2b05c4de7be 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Circular_border_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Circular_border_parameterizer_3.h
@@ -50,7 +50,7 @@ namespace Surface_mesh_parameterization {
 /// `TriangleMesh` class and does not know the parameterization algorithm
 /// requirements or the kind of sparse linear system used.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
@@ -182,7 +182,7 @@ class Circular_border_parameterizer_3
 /// algorithm. This class implements only `compute_edge_length()` to compute a
 /// segment's length.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \sa `CGAL::Surface_mesh_parameterization::Circular_border_parameterizer_3<TriangleMesh>`
 /// \sa `CGAL::Surface_mesh_parameterization::Circular_border_arc_length_parameterizer_3<TriangleMesh>`
@@ -231,7 +231,7 @@ class Circular_border_uniform_parameterizer_3
 /// The class `Circular_border_parameterizer_3` implements most of the border
 /// parameterization algorithm.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Discrete_authalic_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Discrete_authalic_parameterizer_3.h
index a6c7b410a571..52047459ffa7 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Discrete_authalic_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Discrete_authalic_parameterizer_3.h
@@ -50,7 +50,7 @@ namespace Surface_mesh_parameterization {
 /// - implements `compute_w_ij()` to compute `w_ij`, the `(i,j)`-coefficient of the matrix `A`
 ///   for `j` neighbor vertex of `i`, based on Discrete Authalic Parameterization algorithm.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Discrete_conformal_map_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Discrete_conformal_map_parameterizer_3.h
index 7787476e654f..7bb751740326 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Discrete_conformal_map_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Discrete_conformal_map_parameterizer_3.h
@@ -50,7 +50,7 @@ namespace Surface_mesh_parameterization {
 /// - implements `compute_w_ij()` to compute `w_ij`, the `(i,j)`-coefficient of matrix `A`,
 ///   for `j` neighbor vertex of `i`, based on Discrete Conformal Map method.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`
 ///
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Fixed_border_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Fixed_border_parameterizer_3.h
index d32929793c35..cf938045da49 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Fixed_border_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Fixed_border_parameterizer_3.h
@@ -64,7 +64,7 @@ namespace Surface_mesh_parameterization {
 // from the linear systems in order to have a symmetric positive definite
 // matrix for Tutte Barycentric Mapping and Discrete Conformal Map algorithms.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
index 08b74876715f..33252883f1d5 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
@@ -57,7 +57,7 @@ namespace Surface_mesh_parameterization {
 /// of the surface onto a convex polygon (only two pinned vertices are needed
 /// to ensure a unique solution), but a one-to-one mapping is *not* guaranteed.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/MVC_post_processor_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/MVC_post_processor_3.h
index f54e0b4f0eee..d4efce8934d3 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/MVC_post_processor_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/MVC_post_processor_3.h
@@ -61,7 +61,7 @@ namespace Surface_mesh_parameterization {
 /// the convexification of the initial (2D) parameterization and the resolution
 /// of a linear system with coefficients based on Mean Value Coordinates.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Mean_value_coordinates_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Mean_value_coordinates_parameterizer_3.h
index bacdd2ea12cf..ce0be73bd3e5 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Mean_value_coordinates_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Mean_value_coordinates_parameterizer_3.h
@@ -49,7 +49,7 @@ namespace Surface_mesh_parameterization {
 ///   for `j` neighbor vertex of `i` based on Floater Mean Value Coordinates parameterization.
 /// - It implements an optimized version of `is_one_to_one_mapping()`.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Square_border_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Square_border_parameterizer_3.h
index b806eb1ead69..cb97d65430ab 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Square_border_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Square_border_parameterizer_3.h
@@ -61,7 +61,7 @@ namespace Surface_mesh_parameterization {
 /// `TriangleMesh` class and does not know the parameterization algorithm
 /// requirements or the kind of sparse linear system used.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
@@ -398,7 +398,7 @@ class Square_border_parameterizer_3
 ///            if an input border vertex has valence `1` and if it is mapped to the same edge of the square
 ///            as its two adjacent (border) vertices, for example.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \sa `CGAL::Surface_mesh_parameterization::Square_border_parameterizer_3<TriangleMesh>`
 /// \sa `CGAL::Surface_mesh_parameterization::Square_border_arc_length_parameterizer_3<TriangleMesh>`
@@ -470,7 +470,7 @@ class Square_border_uniform_parameterizer_3
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \sa `CGAL::Surface_mesh_parameterization::Square_border_parameterizer_3<TriangleMesh>`
 /// \sa `CGAL::Surface_mesh_parameterization::Square_border_uniform_parameterizer_3<TriangleMesh>`
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Two_vertices_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Two_vertices_parameterizer_3.h
index 88ecb8dc706b..17cfb22d3a78 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Two_vertices_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/Two_vertices_parameterizer_3.h
@@ -47,7 +47,7 @@ namespace Surface_mesh_parameterization {
 /// `TriangleMesh` class and does not know the parameterization algorithm
 /// requirements or the kind of sparse linear system used.
 ///
-/// \cgalModels `Parameterizer_3`
+/// \cgalModels{Parameterizer_3}
 ///
 /// \tparam TriangleMesh_ must be a model of `FaceGraph`.
 ///
diff --git a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path_traits.h b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path_traits.h
index 5e2955124f59..1ade946fdc87 100644
--- a/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path_traits.h
+++ b/Surface_mesh_shortest_path/include/CGAL/Surface_mesh_shortest_path/Surface_mesh_shortest_path_traits.h
@@ -34,7 +34,7 @@ as required by the `Surface_mesh_shortest_path` class.
 
 \tparam TriangleMesh A model of `FaceListGraph`
 
-\cgalModels `SurfaceMeshShortestPathTraits`
+\cgalModels{SurfaceMeshShortestPathTraits}
 */
 template <
   class K,
@@ -176,7 +176,7 @@ model which uses an exact Kernel during the unfolding operations to achieve bett
 
 \tparam TriangleMesh triangle mesh type
 
-\cgalModels `SurfaceMeshShortestPathTraits`
+\cgalModels{SurfaceMeshShortestPathTraits}
 */
 template <
   class K,
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Edge_collapse_visitor_base.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Edge_collapse_visitor_base.h
index b55bfcadf783..47e7d08ff16d 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Edge_collapse_visitor_base.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Edge_collapse_visitor_base.h
@@ -16,7 +16,7 @@ and hide a non-virtual method in the context of the static polymorphism used in
 \tparam TriangleMesh is the type of surface mesh being simplified, and must be a model
 of the `MutableFaceGraph` and `HalfedgeListGraph` concepts.
 
-\cgalModels `EdgeCollapseSimplificationVisitor`
+\cgalModels{EdgeCollapseSimplificationVisitor}
 
 */
 template <typename TriangleMesh>
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
index 5fa7e3c33959..4ecf7aa830da 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_distance_placement.h
@@ -20,7 +20,7 @@ the position is returned.
 
 The distance check is performed using an AABB tree and this class thus depends on the package \ref PkgAABBTree.
 
-\cgalModels `GetPlacement`
+\cgalModels{GetPlacement}
 
 */
 template<class BasePlacement, class GeomTraits>
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h
index 53cfb706bd68..80569183912d 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_filter.h
@@ -13,7 +13,7 @@ if any triangle in the profile changes the normal by more than 90 degree, in thi
 \tparam Filter must be a model of the concept `PlacementFilter`. It defaults to a class that does
 not filter any placement.
 
-\cgalModels `PlacementFilter`
+\cgalModels{PlacementFilter}
 
 */
 template <typename Filter>
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h
index 8f08e9a071c5..d4ed0a6bc5a2 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Bounded_normal_change_placement.h
@@ -15,7 +15,7 @@ triangle in the profile changes the normal by more than 90 degree.
 
 \tparam Get_placement_ must be a model of the concept `GetPlacement`.
 
-\cgalModels `GetPlacement`
+\cgalModels{GetPlacement}
 
 */
 template <typename Get_placement_>
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h
index f9b904bfb3f2..0927a25ee68e 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Constrained_placement.h
@@ -13,7 +13,7 @@ is the point of the common vertex. Otherwise the placement is the one computed b
 \tparam Edge_is_constrained_map_ must be a model of `ReadablePropertyMap` with `Edge_profile::edge_descriptor`
                                  as key type and `bool` as value type indicating if an edge is constrained.
 
-\cgalModels `GetPlacement`
+\cgalModels{GetPlacement}
 
 */
 template<class Get_placement_, class Edge_is_constrained_map_>
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_ratio_stop_predicate.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_ratio_stop_predicate.h
index f4a5378489b6..74f19bfb77c9 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_ratio_stop_predicate.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_ratio_stop_predicate.h
@@ -12,7 +12,7 @@ which returns `true` when the relation between the initial and current number of
 
 \tparam TriangleMesh is the type of surface mesh being simplified, and must be a model of the `MutableFaceGraph` and `HalfedgeListGraph` concepts.
 
-\cgalModels `StopPredicate`
+\cgalModels{StopPredicate}
 
 \sa `CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<TriangleMesh>`
 \sa `CGAL::Surface_mesh_simplification::Face_count_ratio_stop_predicate<TriangleMesh>`
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_stop_predicate.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_stop_predicate.h
index bef9e2fdba90..b9715e4d5f3e 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_stop_predicate.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_stop_predicate.h
@@ -11,7 +11,7 @@ which returns `true` when the number of current edges drops below a certain thre
 
 \tparam TriangleMesh is the type of surface mesh being simplified, and must be a model of the `MutableFaceGraph` and `HalfedgeListGraph` concepts.
 
-\cgalModels `StopPredicate`
+\cgalModels{StopPredicate}
 
 \sa `CGAL::Surface_mesh_simplification::Edge_count_stop_predicate<TriangleMesh>`
 \sa `CGAL::Surface_mesh_simplification::Face_count_stop_predicate<TriangleMesh>`
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_count_ratio_stop_predicate.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_count_ratio_stop_predicate.h
index fed8537304f6..366808732b46 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_count_ratio_stop_predicate.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_count_ratio_stop_predicate.h
@@ -5,7 +5,7 @@ namespace Surface_mesh_simplification {
 /*!
 \ingroup PkgSurfaceMeshSimplificationRef
 
-\cgalModels `StopPredicate`
+\cgalModels{StopPredicate}
 
 The class `Edge_count_ratio_stop_predicate` is a model for the `StopPredicate` concept
 which returns `true` when the relation between the initial and current number of edges drops below a certain ratio.
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_count_stop_predicate.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_count_stop_predicate.h
index 6e3920dd4215..88bb38167320 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_count_stop_predicate.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_count_stop_predicate.h
@@ -4,7 +4,7 @@ namespace Surface_mesh_simplification {
 /*!
 \ingroup PkgSurfaceMeshSimplificationRef
 
-\cgalModels `StopPredicate`
+\cgalModels{StopPredicate}
 
 The class `Edge_count_stop_predicate` is a model for the `StopPredicate` concept,
 which returns `true` when the number of current edges drops below a certain threshold.
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h
index 52c7c54dee8f..5b12c537c3b8 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h
@@ -9,7 +9,7 @@ which computes the collapse cost as the squared length of the edge.
 
 \tparam TriangleMesh is the type of surface mesh being simplified, and must be a model of the `MutableFaceGraph` and `HalfedgeListGraph` concepts.
 
-\cgalModels `GetCost`
+\cgalModels{GetCost}
 
 */
 template <typename TriangleMesh>
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_stop_predicate.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_stop_predicate.h
index fbbdffe9064b..fa85ec3a9e69 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_stop_predicate.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_stop_predicate.h
@@ -11,7 +11,7 @@ This predicate is meant to be used with `Edge_length_cost`.
 
 \tparam FT is the number type of the point coordinates, and must be equal to `Edge_profile::FT`.
 
-\cgalModels `StopPredicate`
+\cgalModels{StopPredicate}
 
 */
 template <typename FT>
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Face_count_ratio_stop_predicate.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Face_count_ratio_stop_predicate.h
index f5154aeb0d83..bfea79b87dae 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Face_count_ratio_stop_predicate.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Face_count_ratio_stop_predicate.h
@@ -5,7 +5,7 @@ namespace Surface_mesh_simplification {
 /*!
 \ingroup PkgSurfaceMeshSimplificationRef
 
-\cgalModels `StopPredicate`
+\cgalModels{StopPredicate}
 
 The class `Face_count_ratio_stop_predicate` is a model for the `StopPredicate` concept
 which returns `true` when the relation between the initial and current number of faces drops below a certain ratio.
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Face_count_stop_predicate.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Face_count_stop_predicate.h
index 8c35a5c35e7a..3431bb016ac0 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Face_count_stop_predicate.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Face_count_stop_predicate.h
@@ -4,7 +4,7 @@ namespace Surface_mesh_simplification {
 /*!
 \ingroup PkgSurfaceMeshSimplificationRef
 
-\cgalModels `StopPredicate`
+\cgalModels{StopPredicate}
 
 The class `Face_count_stop_predicate` is a model for the `StopPredicate` concept,
 which returns `true` when the number of current faces drops below a certain threshold.
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h
index 36e68f95263b..8d19df2efb3f 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h
@@ -9,7 +9,7 @@ It computes the collapse cost following the Lindstrom-Turk strategy
 
 \tparam TriangleMesh is the type of surface mesh being simplified, and must be a model of the `MutableFaceGraph` and `HalfedgeListGraph` concepts.
 
-\cgalModels `GetCost`
+\cgalModels{GetCost}
 
 \sa `CGAL::Surface_mesh_simplification::LindstromTurk_placement<TriangleMesh>`
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h
index 20ae3890439a..dc606160221c 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h
@@ -11,7 +11,7 @@ a halfedge collapse, following the Lindstrom-Turk strategy
 
 \tparam TriangleMesh is the type of surface mesh being simplified, and must be a model of the `MutableFaceGraph` and `HalfedgeListGraph` concepts.
 
-\cgalModels `GetPlacement`
+\cgalModels{GetPlacement}
 
 \sa `CGAL::Surface_mesh_simplification::LindstromTurk_cost<TriangleMesh>`
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h
index 2cd81de679e6..f1bb4339cfb5 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h
@@ -10,7 +10,7 @@ which  computes the placement as the midpoint position along the edge.
 
 \tparam TriangleMesh is the type of surface mesh being simplified, and must be a model of the `MutableFaceGraph` and `HalfedgeListGraph` concepts.
 
-\cgalModels `GetPlacement`
+\cgalModels{GetPlacement}
 
 */
 template <typename TriangleMesh>
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
index dadccaa8e4d8..b972c0aed3e4 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Polyhedral_envelope_filter.h
@@ -13,7 +13,7 @@ if any triangle in the profile is not inside the polyhedral envelope, in this or
 \tparam Filter must be a model of the concept `PlacementFilter`.  It defaults to a class that does
 not filter any placement.
 
-\cgalModels `PlacementFilter`
+\cgalModels{PlacementFilter}
 
 \sa `Polyhedral_envelope`
 
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/Polygonal_schema_min_items.h b/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/Polygonal_schema_min_items.h
index 06fe49ab9634..9e98bf7ad8ed 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/Polygonal_schema_min_items.h
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/Polygonal_schema_min_items.h
@@ -6,7 +6,7 @@ namespace Surface_mesh_topology {
 
 The class `Polygonal_schema_min_items` defines a struct with a `std::string` as the information associated with darts, and no attribute is enabled.
 
-\cgalModels `PolygonalSchemaItems`
+\cgalModels{PolygonalSchemaItems}
 
 \cgalHeading{Example}
 
diff --git a/Surface_mesher/doc/Surface_mesher/CGAL/Gray_level_image_3.h b/Surface_mesher/doc/Surface_mesher/CGAL/Gray_level_image_3.h
index c581de850103..e54821318995 100644
--- a/Surface_mesher/doc/Surface_mesher/CGAL/Gray_level_image_3.h
+++ b/Surface_mesher/doc/Surface_mesher/CGAL/Gray_level_image_3.h
@@ -27,7 +27,7 @@ The library <I>CGAL_ImageIO</I> and therefore `Gray_level_image_3` support
 several types of 3D images: INRIMAGE (extension .inr[.gz]), GIS (extension
 .dim, of .ima[.gz]), and ANALYZE (extension .hdr, or .img[.gz]).
 
-\cgalModels `ImplicitFunction`
+\cgalModels{ImplicitFunction}
 
 \sa `ImplicitFunction`
 \sa `Implicit_surface_3<Traits, Function>`
diff --git a/Surface_mesher/doc/Surface_mesher/CGAL/Implicit_surface_3.h b/Surface_mesher/doc/Surface_mesher/CGAL/Implicit_surface_3.h
index 9755576db70a..58bdcf1b2241 100644
--- a/Surface_mesher/doc/Surface_mesher/CGAL/Implicit_surface_3.h
+++ b/Surface_mesher/doc/Surface_mesher/CGAL/Implicit_surface_3.h
@@ -27,7 +27,7 @@ mesh traits
 The number type `Function::FT` has to match
 the type `Traits::FT`.
 
-\cgalModels `Surface_3`
+\cgalModels{Surface_3}
 
 \sa `make_surface_mesh`
 \sa `Surface_mesh_traits_generator_3<Surface>`
diff --git a/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_cell_base_3.h b/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_cell_base_3.h
index 92b02d9034a6..2dea730abfe8 100644
--- a/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_cell_base_3.h
+++ b/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_cell_base_3.h
@@ -16,7 +16,7 @@ class.
 \tparam Cb must be a model of the concept `DelaunayTriangulationCellBase_3`
 and defaults to `Delaunay_triangulation_cell_base_3<GT>`.
 
-\cgalModels `SurfaceMeshCellBase_3`
+\cgalModels{SurfaceMeshCellBase_3}
 
 \sa `SurfaceMeshComplex_2InTriangulation_3`
 \sa `Surface_mesh_complex_2_in_triangulation_3<Tr>`
diff --git a/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_complex_2_in_triangulation_3.h b/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_complex_2_in_triangulation_3.h
index 77146cc110d3..4067968a486c 100644
--- a/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_complex_2_in_triangulation_3.h
+++ b/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_complex_2_in_triangulation_3.h
@@ -22,7 +22,7 @@ of the concept `SurfaceMeshVertexBase_3` and
 `SurfaceMeshCellBase_3`
 respectively.)
 
-\cgalModels `SurfaceMeshComplex_2InTriangulation_3`
+\cgalModels{SurfaceMeshComplex_2InTriangulation_3}
 
 \sa `make_surface_mesh`
 \sa `SurfaceMeshTriangulation_3`
diff --git a/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_default_criteria_3.h b/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_default_criteria_3.h
index 693a1fa8dee0..debdac03ce02 100644
--- a/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_default_criteria_3.h
+++ b/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_default_criteria_3.h
@@ -27,7 +27,7 @@ is the distance between the facet circumcenter and the
 center of its surface Delaunay ball.
 </UL>
 
-\cgalModels `SurfaceMeshFacetsCriteria_3`
+\cgalModels{SurfaceMeshFacetsCriteria_3}
 
 \sa `make_surface_mesh`
 
diff --git a/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_default_triangulation_3.h b/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_default_triangulation_3.h
index b248d1aa8651..655dae38d038 100644
--- a/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_default_triangulation_3.h
+++ b/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_default_triangulation_3.h
@@ -10,7 +10,7 @@ are models of the concepts
 `SurfaceMeshVertexBase_3` and
 `SurfaceMeshCellBase_3` respectively.
 
-\cgalModels `SurfaceMeshTriangulation_3`
+\cgalModels{SurfaceMeshTriangulation_3}
 
 \sa `Surface_mesh_complex_2_in_triangulation_3<Tr>`
 \sa `make_surface_mesh`
diff --git a/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_vertex_base_3.h b/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_vertex_base_3.h
index 3a4f9172cc61..f06dc5f2ca1d 100644
--- a/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_vertex_base_3.h
+++ b/Surface_mesher/doc/Surface_mesher/CGAL/Surface_mesh_vertex_base_3.h
@@ -17,7 +17,7 @@ class.
 and
 defaults to `Triangulation_vertex_base_3 <Gt>`.
 
-\cgalModels `SurfaceMeshVertexBase_3`
+\cgalModels{SurfaceMeshVertexBase_3}
 
 \sa `SurfaceMeshComplex_2InTriangulation_3`
 \sa `Surface_mesh_complex_2_in_triangulation_3<Tr>`
diff --git a/TDS_2/doc/TDS_2/CGAL/Triangulation_data_structure_2.h b/TDS_2/doc/TDS_2/CGAL/Triangulation_data_structure_2.h
index 4b2569c16070..5c076eed68f5 100644
--- a/TDS_2/doc/TDS_2/CGAL/Triangulation_data_structure_2.h
+++ b/TDS_2/doc/TDS_2/CGAL/Triangulation_data_structure_2.h
@@ -18,7 +18,7 @@ additional template parameters.
 
 \tparam FaceBase  must be a model of `TriangulationDSFaceBase_2`. The default is `Triangulation_ds_face_base_2<TDS>`.
 
-\cgalModels `TriangulationDataStructure_2`
+\cgalModels{TriangulationDataStructure_2}
 
 \cgalHeading{Modifiers}
 
diff --git a/TDS_2/doc/TDS_2/CGAL/Triangulation_ds_face_base_2.h b/TDS_2/doc/TDS_2/CGAL/Triangulation_ds_face_base_2.h
index 85fbc81a1857..1380f3fefef9 100644
--- a/TDS_2/doc/TDS_2/CGAL/Triangulation_ds_face_base_2.h
+++ b/TDS_2/doc/TDS_2/CGAL/Triangulation_ds_face_base_2.h
@@ -8,7 +8,7 @@ The class `Triangulation_ds_face_base_2` is a model for the concept
 `TriangulationDSFaceBase_2` to be used by
 `Triangulation_data_structure_2`.
 
-\cgalModels `TriangulationDSFaceBase_2`
+\cgalModels{TriangulationDSFaceBase_2}
 
 \tparam TDS should not be specified (see Section \ref TDS_2TheRebindMechanism and examples)
 
diff --git a/TDS_2/doc/TDS_2/CGAL/Triangulation_ds_vertex_base_2.h b/TDS_2/doc/TDS_2/CGAL/Triangulation_ds_vertex_base_2.h
index 96ce87d5e3be..573f1f95180f 100644
--- a/TDS_2/doc/TDS_2/CGAL/Triangulation_ds_vertex_base_2.h
+++ b/TDS_2/doc/TDS_2/CGAL/Triangulation_ds_vertex_base_2.h
@@ -20,7 +20,7 @@ and `Triangulation_ds_vertex_base_2` cannot be plugged in.
 
 \tparam TDS should not be specified (see Section \ref TDS_2TheRebindMechanism and examples)
 
-\cgalModels `TriangulationDSVertexBase_2`
+\cgalModels{TriangulationDSVertexBase_2}
 
 \sa `CGAL::Triangulation_vertex_base_2<Traits,Vb>`
 \sa `CGAL::Triangulation_ds_face_base_2<TDS>`
diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
index a5daedcbc28e..051a1359d2e8 100644
--- a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
+++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
@@ -106,13 +106,13 @@ typedef unspecified_type Face_data;
 
 /*!
 Handle to a vertex.
-\cgalModels `Handle`
+\cgalModels{Handle}
 */
 typedef unspecified_type Vertex_handle;
 
 /*!
 Handle to a face.
-\cgalModels `Handle`
+\cgalModels{Handle}
 */
 typedef unspecified_type Face_handle;
 
diff --git a/TDS_3/doc/TDS_3/CGAL/Triangulation_data_structure_3.h b/TDS_3/doc/TDS_3/CGAL/Triangulation_data_structure_3.h
index b3c8ab7da78d..ad6b244555a2 100644
--- a/TDS_3/doc/TDS_3/CGAL/Triangulation_data_structure_3.h
+++ b/TDS_3/doc/TDS_3/CGAL/Triangulation_data_structure_3.h
@@ -27,7 +27,7 @@ container to store vertices and cells. It can be `Sequential_tag` (use of a
 `create_vertex()`, `create_cell()`, `delete_vertex()`, and `delete_cell()`.
 `Sequential_tag` is the default value.
 
-\cgalModels `TriangulationDataStructure_3`
+\cgalModels{TriangulationDataStructure_3}
 
 The base class `Triangulation_utils_3` defines basic computations on
 indices of vertices and neighbors of cells.
diff --git a/TDS_3/doc/TDS_3/CGAL/Triangulation_ds_cell_base_3.h b/TDS_3/doc/TDS_3/CGAL/Triangulation_ds_cell_base_3.h
index c03c936a2cfc..763beb19f13c 100644
--- a/TDS_3/doc/TDS_3/CGAL/Triangulation_ds_cell_base_3.h
+++ b/TDS_3/doc/TDS_3/CGAL/Triangulation_ds_cell_base_3.h
@@ -8,7 +8,7 @@ The class `Triangulation_ds_cell_base_3<>` is a model for the concept
 `TriangulationDSCellBase_3` to be used by
 `Triangulation_data_structure_3`.
 
-\cgalModels `TriangulationDSCellBase_3`
+\cgalModels{TriangulationDSCellBase_3}
 
 \tparam TDS should not be specified (see Section \ref tds3cyclic and examples)
 
diff --git a/TDS_3/doc/TDS_3/CGAL/Triangulation_ds_vertex_base_3.h b/TDS_3/doc/TDS_3/CGAL/Triangulation_ds_vertex_base_3.h
index 26ad462db9d6..0c324aae7a2a 100644
--- a/TDS_3/doc/TDS_3/CGAL/Triangulation_ds_vertex_base_3.h
+++ b/TDS_3/doc/TDS_3/CGAL/Triangulation_ds_vertex_base_3.h
@@ -18,7 +18,7 @@ This base class can be used directly or can serve as a base to derive
 other base classes with some additional attributes (a color for
 example) tuned for a specific application.
 
-\cgalModels `TriangulationDSVertexBase_3`
+\cgalModels{TriangulationDSVertexBase_3}
 
 \tparam TDS should not be specified (see Section \ref tds3cyclic and examples)
 
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
index d82378827267..15f6751141d2 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
@@ -80,8 +80,7 @@ assigned to a non surface facet.
  It must match the `Surface_patch_index` of the model
   of the `MeshDomain_3` concept when used for mesh generation.
 
-\cgalModels `RemeshingCellBase_3`
-\cgalModels `SimplicialMeshCellBase_3`
+\cgalModels{RemeshingCellBase_3,SimplicialMeshCellBase_3}
 
 */
 template<typename Subdomain_index = int,
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
index b828ffb08d1d..ca2697a81907 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
@@ -36,8 +36,7 @@ It has to be a model of the concept `RemeshingTriangulationTraits_3`.
 It must be a model of the `TriangulationVertexBase_3` concept.
 It has the default value `Triangulation_vertex_base_3<Gt>`.
 
-\cgalModels `RemeshingVertexBase_3`
-\cgalModels `SimplicialMeshVertexBase_3`
+\cgalModels{RemeshingVertexBase_3,SimplicialMeshVertexBase_3}
 */
 template<typename GT,
   typename Subdomain_index = int,
diff --git a/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h b/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h
index d6167b9185a4..666f6ece70cb 100644
--- a/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h
+++ b/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h
@@ -34,9 +34,9 @@ third parameter be specified. It also accepts the tag `CGAL::Default` as
 third parameter. In both cases, `TriangulationDSFullCell_` defaults to
 `CGAL::Triangulation_ds_full_cell<>`.
 
-\cgalModels `TriangulationDataStructure`. In addition, the class
+\cgalModels{TriangulationDataStructure. In addition, the class
 `Triangulation_data_structure` provides the following types and
-methods.
+methods.}
 
 \sa `Triangulation_ds_vertex`
 \sa `Triangulation_ds_full_cell`
diff --git a/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_full_cell.h b/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_full_cell.h
index 66c902d0d2db..148985c11b77 100644
--- a/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_full_cell.h
+++ b/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_full_cell.h
@@ -41,7 +41,7 @@ indices are stored.
 </UL>
 See the user manual for how to choose the second option.
 
-\cgalModels `TriangulationDSFullCell`
+\cgalModels{TriangulationDSFullCell}
 
 \cgalHeading{Rebind mechanism}
 
diff --git a/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_vertex.h b/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_vertex.h
index 9b77ad04b5d1..34cddeb330fc 100644
--- a/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_vertex.h
+++ b/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_vertex.h
@@ -21,7 +21,7 @@ example).
 \tparam TriangulationDataStructure_ must be a model of the
 `TriangulationDataStructure` concept.
 
-\cgalModels `TriangulationDSVertex`
+\cgalModels{TriangulationDSVertex}
 
 \cgalHeading{Rebind mechanism}
 
diff --git a/Triangulation/doc/Triangulation/CGAL/Triangulation_face.h b/Triangulation/doc/Triangulation/CGAL/Triangulation_face.h
index bee7d71ed538..9b4d35b4ce0f 100644
--- a/Triangulation/doc/Triangulation/CGAL/Triangulation_face.h
+++ b/Triangulation/doc/Triangulation/CGAL/Triangulation_face.h
@@ -12,7 +12,7 @@ Actually, `Triangulation_face` needs only that this concept defines the types
 `Vertex_handle`, and
 `Maximal_dimension`.
 
-\cgalModels `TriangulationDSFace`
+\cgalModels{TriangulationDSFace}
 
 \sa `TriangulationDSFace`
 \sa `TriangulationDataStructure`
diff --git a/Triangulation/doc/Triangulation/CGAL/Triangulation_full_cell.h b/Triangulation/doc/Triangulation/CGAL/Triangulation_full_cell.h
index ba9f68848b1d..89e21f5663af 100644
--- a/Triangulation/doc/Triangulation/CGAL/Triangulation_full_cell.h
+++ b/Triangulation/doc/Triangulation/CGAL/Triangulation_full_cell.h
@@ -27,9 +27,9 @@ The class template `Triangulation_full_cell` accepts that no third parameter be
 It also accepts the tag `CGAL::Default` as third parameter. In both
 cases, `TriangulationDSFullCell_` defaults to `CGAL::Triangulation_ds_full_cell<>`.
 
-\cgalModels `TriangulationFullCell` Additionally, the class
+\cgalModels{TriangulationFullCell Additionally, the class
 `Triangulation_full_cell` provides the following types,
-constructors and methods:
+constructors and methods:}
 
 \sa `Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>`
 \sa `Triangulation_data_structure<Dimensionality, TriangulationDSVertex_, TriangulationDSFullCell_>`
diff --git a/Triangulation/doc/Triangulation/CGAL/Triangulation_vertex.h b/Triangulation/doc/Triangulation/CGAL/Triangulation_vertex.h
index f3169d6a6d47..631496fa4941 100644
--- a/Triangulation/doc/Triangulation/CGAL/Triangulation_vertex.h
+++ b/Triangulation/doc/Triangulation/CGAL/Triangulation_vertex.h
@@ -27,9 +27,9 @@ class template `Triangulation_vertex` accepts that no third parameter be specifi
 also accepts the tag `CGAL::Default` as third parameter. In both cases,
 `TriangulationDSVertex_` defaults to `CGAL::Triangulation_ds_vertex<>`.
 
-\cgalModels `TriangulationVertex` Additionally, the class
+\cgalModels{TriangulationVertex Additionally, the class
 `Triangulation_vertex` provides the following types, constructors
-and methods:
+and methods:}
 
 \sa `Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>`
 \sa `Triangulation_data_structure<Dimensionality, TriangulationDSVertex_, TriangulationDSFullCell_>`
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_face_base_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_face_base_2.h
index f83a733c6f8c..e9bf99dc1d4c 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_face_base_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_face_base_2.h
@@ -8,7 +8,7 @@ The class `Constrained_triangulation_face_base_2` is the default model for the c
 `ConstrainedTriangulationFaceBase_2` to be used as base face class
 of constrained triangulations.
 
-\cgalModels `ConstrainedTriangulationFaceBase_2`
+\cgalModels{ConstrainedTriangulationFaceBase_2}
 
 
 \tparam Traits must be a geometric traits.
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Regular_triangulation_face_base_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Regular_triangulation_face_base_2.h
index 0bc93fda7b0e..64ef2eda1c75 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Regular_triangulation_face_base_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Regular_triangulation_face_base_2.h
@@ -16,7 +16,7 @@ of `TriangulationFaceBase_2`. By default, this parameter is
 instantiated by
 `Triangulation_face_base_2<Traits>`.
 
-\cgalModels `RegularTriangulationFaceBase_2`
+\cgalModels{RegularTriangulationFaceBase_2}
 
 \sa `RegularTriangulationFaceBase_2`
 \sa `RegularTriangulationTraits_2`
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Regular_triangulation_vertex_base_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Regular_triangulation_vertex_base_2.h
index 01c0e9522a2c..e9e12d70ecdd 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Regular_triangulation_vertex_base_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Regular_triangulation_vertex_base_2.h
@@ -15,7 +15,7 @@ of `RegularTriangulationTraits_2`.
 of the concept `TriangulationVertexBase_2` and is by default
 instantiated by `Triangulation_vertex_base_2<Traits>`.
 
-\cgalModels `RegularTriangulationVertexBase_2`
+\cgalModels{RegularTriangulationVertexBase_2}
 
 \sa `CGAL::Triangulation_vertex_base_2<Traits,Vb>`
 \sa `CGAL::Regular_triangulation_2<Traits,Tds>`
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_2.h
index 8f1646c781c8..3a943d3aea36 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_2.h
@@ -20,7 +20,7 @@ and will serve as a base class for `Triangulation_face_base_2` .
 \cgal provides a default instantiation for this parameter which is
 `Triangulation_ds_face_base_2<>`.
 
-\cgalModels `TriangulationFaceBase_2`
+\cgalModels{TriangulationFaceBase_2}
 
 \sa `CGAL::Triangulation_ds_face_base_2<Tds>`
 \sa `CGAL::Triangulation_vertex_base_2<Traits,Vb>`
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_with_info_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_with_info_2.h
index b90233f288e8..bd0990942287 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_with_info_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_with_info_2.h
@@ -19,9 +19,9 @@ and is actually not used in `Triangulation_face_base_with_info_2` .
 \tparam Fb  is a face base class from which
 `Triangulation_face_base_with_info_2` derives.
 
-\cgalModels Because `Triangulation_face_base_with_info_2` derives from the class instantiating its third
-parameter, it will be a model of the same face base concept as its parameter:
-`TriangulationFaceBase_2`,  `ConstrainedTriangulationFaceBase_2`, or `RegularTriangulationFaceBase_2`
+\cgalModelsBare{Because `Triangulation_face_base_with_info_2` derives from the class instantiating its third
+parameter\, it will be a model of the same face base concept as its parameter:
+`TriangulationFaceBase_2`\,  `ConstrainedTriangulationFaceBase_2`\, or `RegularTriangulationFaceBase_2`}
 
 \sa `CGAL::Triangulation_face_base_2<Traits,Fb>`
 \sa `CGAL::Constrained_triangulation_face_base_2<Traits,Fb>`
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_hierarchy_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_hierarchy_2.h
index 0d875329b445..4ce0d77cf0eb 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_hierarchy_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_hierarchy_2.h
@@ -89,7 +89,7 @@ This design allows to use either the default
 vertex base class or a user customized
 vertex base with additional functionalities.
 
-\cgalModels `TriangulationHierarchyVertexBase_2`
+\cgalModels{TriangulationHierarchyVertexBase_2}
 
 \sa `TriangulationVertexBase_2`
 \sa `TriangulationHierarchyVertexBase_2`
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_2.h
index fb5d21bd9641..97b1cbf3386e 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_2.h
@@ -22,7 +22,7 @@ the triangulation.
 By default this parameter is
 instantiated by `Triangulation_ds_vertex_base_2<>`.
 
-\cgalModels `TriangulationVertexBase_2`
+\cgalModels{TriangulationVertexBase_2}
 
 \sa `CGAL::Triangulation_ds_vertex_base_2<Tds>`
 \sa `CGAL::Triangulation_face_base_2<Traits,Fb>`
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_with_info_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_with_info_2.h
index 9d67764d749f..6be4bf7ee8e9 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_with_info_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_with_info_2.h
@@ -22,10 +22,10 @@ the triangulation.
 this parameter is instantiated by
 `Triangulation_vertex_base_2<Traits>`.
 
-\cgalModels `TriangulationVertexBaseWithInfo_2`
-\cgalModels The parameter `Vb` is a model of some vertex base concept.
+\cgalModelsBare{`TriangulationVertexBaseWithInfo_2`,
+            The parameter `Vb` is a model of some vertex base concept.
 `Triangulation_vertex_base_with_info_2` derives from `Vb` and will be a model of the
-same vertex base concept: `TriangulationVertexBase_2`, or `RegularTriangulationVertexBase_2`.
+same vertex base concept: `TriangulationVertexBase_2`\, or `RegularTriangulationVertexBase_2`.}
 
 \sa `CGAL::Triangulation_face_base_with_info_2<Info,Traits,Fb>`
 \sa `CGAL::Triangulation_vertex_base_2<Traits,Vb>`
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_cell_base_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_cell_base_3.h
index dbfb816794c5..1536b61dea4e 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_cell_base_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_cell_base_3.h
@@ -14,7 +14,7 @@ of Delaunay triangulations.
 By default, this parameter is instantiated by
 `Triangulation_cell_base_3<Traits>`.
 
-\cgalModels `DelaunayTriangulationCellBase_3`
+\cgalModels{DelaunayTriangulationCellBase_3}
 
 \sa `DelaunayTriangulationCellBase_3`
 \sa `CGAL::Delaunay_triangulation_3`
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_cell_base_with_circumcenter_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_cell_base_with_circumcenter_3.h
index 171084a21703..6eba490b6314 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_cell_base_with_circumcenter_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Delaunay_triangulation_cell_base_with_circumcenter_3.h
@@ -20,7 +20,7 @@ circumcenter.
 be a model of `DelaunayTriangulationCellBase_3`.
 It has the default value `Delaunay_triangulation_cell_base_3<Traits>`.
 
-\cgalModels `DelaunayTriangulationCellBase_3`
+\cgalModels{DelaunayTriangulationCellBase_3}
 
 \sa `CGAL::Delaunay_triangulation_cell_base_3`
 
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_cell_base_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_cell_base_3.h
index 3d110a67cb2a..637595f1e253 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_cell_base_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_cell_base_3.h
@@ -15,7 +15,7 @@ derives. It must be a model of `TriangulationCellBase_3`.
 By default, this parameter is instantiated by
 `Triangulation_cell_base_3<Traits>`.
 
-\cgalModels `RegularTriangulationCellBase_3`
+\cgalModels{RegularTriangulationCellBase_3}
 
 \sa `RegularTriangulationCellBase_3`
 \sa `CGAL::Regular_triangulation_3`
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_cell_base_with_weighted_circumcenter_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_cell_base_with_weighted_circumcenter_3.h
index 39d05eb11c69..cbf43c1610cc 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_cell_base_with_weighted_circumcenter_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_cell_base_with_weighted_circumcenter_3.h
@@ -20,7 +20,7 @@ circumcenter.
 be a model of `RegularTriangulationCellBase_3`.
 It has the default value `Regular_triangulation_cell_base_3<RT>`.
 
-\cgalModels `RegularTriangulationCellBaseWithWeightedCircumcenter_3`
+\cgalModels{RegularTriangulationCellBaseWithWeightedCircumcenter_3}
 
 \sa `CGAL::Triangulation_cell_base_3`
 \sa `CGAL::Triangulation_cell_base_with_info_3`
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_euclidean_traits_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_euclidean_traits_3.h
index 284b2f417a1b..725116fb1367 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_euclidean_traits_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_euclidean_traits_3.h
@@ -13,7 +13,7 @@ compatibility, but ignores the template parameter `Weight`.
 \tparam Weight This template parameter is ignored, as `Kernel::Weighted_point_3`
                uses the type `Kernel::FT`.
 
-\cgalModels `RegularTriangulationTraits_3`
+\cgalModels{RegularTriangulationTraits_3}
 
 */
 template< typename K, typename Weight >
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_vertex_base_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_vertex_base_3.h
index a8bf33513169..fd4f6b601526 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_vertex_base_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Regular_triangulation_vertex_base_3.h
@@ -24,7 +24,7 @@ the same as the point type defined by the geometric traits class.
 It must be a model of the `TriangulationDSVertexBase_3` concept.
 It has the default value `Triangulation_ds_vertex_base_3<TDS>`.
 
-\cgalModels `RegularTriangulationVertexBase_3`
+\cgalModels{RegularTriangulationVertexBase_3}
 
 \sa `CGAL::Triangulation_cell_base_3`
 \sa `CGAL::Triangulation_ds_vertex_base_3`
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_cell_base_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_cell_base_3.h
index 555a1d62f845..8ce8ea1ca5d3 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_cell_base_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_cell_base_3.h
@@ -20,7 +20,7 @@ It is actually not used by this class.
 It must be a model of the `TriangulationDSCellBase_3` concept.
 It has the default value `Triangulation_ds_cell_base_3`.
 
-\cgalModels `TriangulationCellBase_3`
+\cgalModels{TriangulationCellBase_3}
 
 \sa `CGAL::Triangulation_ds_cell_base_3`
 \sa `CGAL::Triangulation_cell_base_with_info_3`
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_cell_base_with_info_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_cell_base_with_info_3.h
index fd1d585cf8d1..533e1e4326f4 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_cell_base_with_info_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_cell_base_with_info_3.h
@@ -22,8 +22,7 @@ It must be a model of the `TriangulationCellBase_3` concept.
 It has the default value
 `Triangulation_cell_base_3<TriangulationTraits_3>`.
 
-\cgalModels `TriangulationCellBase_3`
-\cgalModels `TriangulationCellBaseWithInfo_3`
+\cgalModels{TriangulationCellBase_3,TriangulationCellBaseWithInfo_3}
 
 \sa `CGAL::Triangulation_cell_base_3`
 \sa `CGAL::Triangulation_vertex_base_with_info_3`
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_vertex_base_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_vertex_base_3.h
index df4aa7dff5d9..457783e526e9 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_vertex_base_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_vertex_base_3.h
@@ -24,7 +24,7 @@ the same as the point type defined by the geometric traits class.
 It must be a model of the `TriangulationDSVertexBase_3` concept.
 It has the default value `Triangulation_ds_vertex_base_3<TDS>`.
 
-\cgalModels `TriangulationVertexBase_3`
+\cgalModels{TriangulationVertexBase_3}
 
 \sa `CGAL::Triangulation_cell_base_3`
 \sa `CGAL::Triangulation_ds_vertex_base_3`
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_vertex_base_with_info_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_vertex_base_with_info_3.h
index f7fe50c0a851..f552bc5b12a8 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_vertex_base_with_info_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_vertex_base_with_info_3.h
@@ -19,8 +19,7 @@ to a vertex. It has to be `DefaultConstructible` and `Assignable`.
 It must be a model of the `TriangulationVertexBase_3` concept.
 It has the default value `Triangulation_vertex_base_3<Traits>`.
 
-\cgalModels `TriangulationVertexBase_3`
-\cgalModels `TriangulationVertexBaseWithInfo_3`
+\cgalModels{TriangulationVertexBase_3,TriangulationVertexBaseWithInfo_3}
 
 \sa `CGAL::Triangulation_cell_base_with_info_3`
 \sa `CGAL::Triangulation_vertex_base_3`
diff --git a/Triangulation_3/include/CGAL/Triangulation_segment_traverser_3.h b/Triangulation_3/include/CGAL/Triangulation_segment_traverser_3.h
index 904421786ba2..13179bf214a5 100644
--- a/Triangulation_3/include/CGAL/Triangulation_segment_traverser_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_segment_traverser_3.h
@@ -81,7 +81,7 @@ struct Incrementer {
  *
  *        \tparam Tr_ is the triangulation type to traverse.
  *
- *  \cgalModels{ForwardIterator}
+ *        \cgalModels{ForwardIterator}
  *
  *        \sa `Triangulation_3`
  *        \sa `Forward_circulator_base`
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Delaunay_triangulation_on_sphere_traits_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Delaunay_triangulation_on_sphere_traits_2.h
index 2cbc69936b0a..5446ff6b33c2 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Delaunay_triangulation_on_sphere_traits_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Delaunay_triangulation_on_sphere_traits_2.h
@@ -27,7 +27,7 @@ and thus not inserted, or guaranteed to not be hidden upon insertion.
 \tparam LK a linear kernel type; it must be a model of `Kernel`.
 \tparam SK a spherical kernel type; it must be a model of `SphericalKernel` refining `LK`.
 
-\cgalModels `DelaunayTriangulationOnSphereTraits_2`
+\cgalModels{DelaunayTriangulationOnSphereTraits_2}
 
 \sa `CGAL::Projection_on_sphere_traits_3`
 */
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Projection_on_sphere_traits_3.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Projection_on_sphere_traits_3.h
index 5ae00ff27d46..411e06076165 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Projection_on_sphere_traits_3.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Projection_on_sphere_traits_3.h
@@ -12,7 +12,7 @@ and the center of the sphere.
 \tparam LK a linear kernel type; must be a model of `Kernel`.
 \tparam SK a spherical kernel type; must be a model of `SphericalKernel`.
 
-\cgalModels `DelaunayTriangulationOnSphereTraits_2`
+\cgalModels{DelaunayTriangulationOnSphereTraits_2}
 
 \sa `CGAL::Delaunay_triangulation_on_sphere_traits_2`
 */
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Triangulation_on_sphere_face_base_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Triangulation_on_sphere_face_base_2.h
index f81b29f230eb..c48abfe09765 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Triangulation_on_sphere_face_base_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Triangulation_on_sphere_face_base_2.h
@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgTriangulationOnSphere2VertexFaceClasses
 
-\cgalModels `TriangulationOnSphereFaceBase_2`
+\cgalModels{TriangulationOnSphereFaceBase_2}
 
 The class `Triangulation_on_sphere_face_base_2` is a model for the concept
 `TriangulationOnSphereFaceBase_2`. It is the default face base class
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Triangulation_on_sphere_vertex_base_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Triangulation_on_sphere_vertex_base_2.h
index 17937c6dd228..1a41322ecc2b 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Triangulation_on_sphere_vertex_base_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/CGAL/Triangulation_on_sphere_vertex_base_2.h
@@ -3,7 +3,7 @@ namespace CGAL {
 /*!
 \ingroup PkgTriangulationOnSphere2VertexFaceClasses
 
-\cgalModels `TriangulationOnSphereVertexBase_2`
+\cgalModels{TriangulationOnSphereVertexBase_2}
 
 The class `Triangulation_on_sphere_vertex_base_2` is the default model
 for the concept `TriangulationOnSphereVertexBase_2` and
diff --git a/Visibility_2/doc/Visibility_2/CGAL/Rotational_sweep_visibility_2.h b/Visibility_2/doc/Visibility_2/CGAL/Rotational_sweep_visibility_2.h
index 3ad8ae611443..359d9109b6ea 100644
--- a/Visibility_2/doc/Visibility_2/CGAL/Rotational_sweep_visibility_2.h
+++ b/Visibility_2/doc/Visibility_2/CGAL/Rotational_sweep_visibility_2.h
@@ -17,7 +17,7 @@ specified by one of the following: `#Tag_true` or `#Tag_false`, where `#Tag_fals
 
 
 
-\cgalModels `Visibility_2`
+\cgalModels{Visibility_2}
 
 \sa `CGAL::Simple_polygon_visibility_2`
 \sa `CGAL::Triangular_expansion_visibility_2`
diff --git a/Visibility_2/doc/Visibility_2/CGAL/Simple_polygon_visibility_2.h b/Visibility_2/doc/Visibility_2/CGAL/Simple_polygon_visibility_2.h
index f073ea8cc24b..37fd6c0e0a65 100644
--- a/Visibility_2/doc/Visibility_2/CGAL/Simple_polygon_visibility_2.h
+++ b/Visibility_2/doc/Visibility_2/CGAL/Simple_polygon_visibility_2.h
@@ -23,7 +23,7 @@ It must be an instance of `CGAL::Arrangement_2`, where its `CGAL::Arrangement_2:
 specified by one of the following: `#Tag_true` or `#Tag_false`, where `#Tag_false` is the default value.
 
 
-\cgalModels `Visibility_2`
+\cgalModels{Visibility_2}
 
 \sa `CGAL::Rotational_sweep_visibility_2`
 \sa `CGAL::Triangular_expansion_visibility_2`
diff --git a/Visibility_2/doc/Visibility_2/CGAL/Triangular_expansion_visibility_2.h b/Visibility_2/doc/Visibility_2/CGAL/Triangular_expansion_visibility_2.h
index 178a812957dc..0b1d37bbb683 100644
--- a/Visibility_2/doc/Visibility_2/CGAL/Triangular_expansion_visibility_2.h
+++ b/Visibility_2/doc/Visibility_2/CGAL/Triangular_expansion_visibility_2.h
@@ -17,7 +17,7 @@ It must be an instance of `CGAL::Arrangement_2`, where its `CGAL::Arrangement_2:
 \tparam RegularizationCategory indicates whether the output should be regularized. It can be
 specified by one of the following: `#Tag_true` or `#Tag_false`, where `#Tag_false` is the default value.
 
-\cgalModels `Visibility_2`
+\cgalModels{Visibility_2}
 
 \sa `CGAL::Simple_polygon_visibility_2`
 \sa `CGAL::Rotational_sweep_visibility_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Apollonius_graph_adaptation_policies_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Apollonius_graph_adaptation_policies_2.h
index 8a1415c98130..187b7975472d 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Apollonius_graph_adaptation_policies_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Apollonius_graph_adaptation_policies_2.h
@@ -12,7 +12,7 @@ caches the results of the edge and face rejectors and results in a
 Voronoi diagram that has no degenerate features, i.e., no Voronoi
 edges of zero length and no Voronoi faces of zero area.
 
-\cgalModels `AdaptationPolicy_2`
+\cgalModels{AdaptationPolicy_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
@@ -51,7 +51,7 @@ results in a Voronoi diagram that has no degenerate features,
 i.e., it has no Voronoi edges of zero length and no Voronoi faces of
 zero area.
 
-\cgalModels `AdaptationPolicy_2`
+\cgalModels{AdaptationPolicy_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Apollonius_graph_adaptation_traits_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Apollonius_graph_adaptation_traits_2.h
index 1775a2f3d5a1..2305ef96b453 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Apollonius_graph_adaptation_traits_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Apollonius_graph_adaptation_traits_2.h
@@ -9,7 +9,7 @@ concept. The template parameter of the `Apollonius_graph_adaptation_traits_2` cl
 model of the `DelaunayGraph_2` concept, and in particular it has
 the semantics of a (triangulated) 2D Apollonius graph.
 
-\cgalModels `AdaptationTraits_2`
+\cgalModels{AdaptationTraits_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Delaunay_triangulation_adaptation_policies_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Delaunay_triangulation_adaptation_policies_2.h
index 15be0f7a0cd8..ede61736fb03 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Delaunay_triangulation_adaptation_policies_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Delaunay_triangulation_adaptation_policies_2.h
@@ -12,7 +12,7 @@ caches the results of the edge and face rejectors and results in a
 Voronoi diagram that has no degenerate features, i.e., no Voronoi
 edges of zero length.
 
-\cgalModels `AdaptationPolicy_2`
+\cgalModels{AdaptationPolicy_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
@@ -49,7 +49,7 @@ the semantics of a (triangulated) 2D Delaunay triangulation. This policy
 results in a Voronoi diagram that has no degenerate features,
 i.e., it has no Voronoi edges of zero length.
 
-\cgalModels `AdaptationPolicy_2`
+\cgalModels{AdaptationPolicy_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Delaunay_triangulation_adaptation_traits_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Delaunay_triangulation_adaptation_traits_2.h
index b5f085f1614e..2473f8e8f52f 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Delaunay_triangulation_adaptation_traits_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Delaunay_triangulation_adaptation_traits_2.h
@@ -9,7 +9,7 @@ concept. The template parameter of the `Delaunay_triangulation_adaptation_traits
 model of the `DelaunayGraph_2` concept, and in particular it has
 the semantics of a 2D Delaunay triangulation.
 
-\cgalModels `AdaptationTraits_2`
+\cgalModels{AdaptationTraits_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Identity_policy_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Identity_policy_2.h
index d373e060c742..ee166aad8c5f 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Identity_policy_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Identity_policy_2.h
@@ -18,7 +18,7 @@ Delaunay graph, that is adapted, allows for site insertions through an
 `AT::Site_2`. The site inserter functor provided by this policy
 uses the aforementioned `insert` method.
 
-\cgalModels `AdaptationPolicy_2`
+\cgalModels{AdaptationPolicy_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Regular_triangulation_adaptation_policies_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Regular_triangulation_adaptation_policies_2.h
index 768fee14c62b..d4398de71f78 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Regular_triangulation_adaptation_policies_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Regular_triangulation_adaptation_policies_2.h
@@ -12,7 +12,7 @@ caches the results of the edge and face rejectors and results in a
 Voronoi diagram that has no degenerate features, i.e., no Voronoi
 edges of zero length.
 
-\cgalModels `AdaptationPolicy_2`
+\cgalModels{AdaptationPolicy_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
@@ -49,7 +49,7 @@ the semantics of a (triangulated) 2D regular triangulation. This policy
 results in a power diagram that has no degenerate features,
 i.e., it has no Voronoi edges of zero length.
 
-\cgalModels `AdaptationPolicy_2`
+\cgalModels{AdaptationPolicy_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Regular_triangulation_adaptation_traits_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Regular_triangulation_adaptation_traits_2.h
index 0eb0e4ed6e77..345e8e710d01 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Regular_triangulation_adaptation_traits_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Regular_triangulation_adaptation_traits_2.h
@@ -9,7 +9,7 @@ concept. The template parameter of the `Regular_triangulation_adaptation_traits_
 model of the `DelaunayGraph_2` concept, and in particular it has
 the semantics of a 2D regular triangulation.
 
-\cgalModels `AdaptationTraits_2`
+\cgalModels{AdaptationTraits_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Segment_Delaunay_graph_adaptation_policies_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Segment_Delaunay_graph_adaptation_policies_2.h
index 4c88ca2862da..0baa77ee873e 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Segment_Delaunay_graph_adaptation_policies_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Segment_Delaunay_graph_adaptation_policies_2.h
@@ -12,7 +12,7 @@ caches the results of the edge and face rejectors and results in a
 Voronoi diagram that has no degenerate features, i.e., no Voronoi
 edges of zero length and no Voronoi faces of zero area.
 
-\cgalModels `AdaptationPolicy_2`
+\cgalModels{AdaptationPolicy_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
@@ -51,7 +51,7 @@ results in a Voronoi diagram that has no degenerate features,
 i.e., it has no Voronoi edges of zero length and no Voronoi faces of
 zero area.
 
-\cgalModels `AdaptationPolicy_2`
+\cgalModels{AdaptationPolicy_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Segment_Delaunay_graph_adaptation_traits_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Segment_Delaunay_graph_adaptation_traits_2.h
index e665e0210fd5..680dd8b1ea00 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Segment_Delaunay_graph_adaptation_traits_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Segment_Delaunay_graph_adaptation_traits_2.h
@@ -9,7 +9,7 @@ concept. The template parameter of the `Segment_Delaunay_graph_adaptation_traits
 model of the `DelaunayGraph_2` concept, and in particular it has
 the semantics of the 2D (triangulated) segment Delaunay graph.
 
-\cgalModels `AdaptationTraits_2`
+\cgalModels{AdaptationTraits_2}
 
 \sa `AdaptationTraits_2`
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h
index e0dd1cdc4616..98b44b7a2289 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/Voronoi_diagram_2.h
@@ -39,11 +39,7 @@ class Voronoi_diagram_2 {
     `Voronoi_diagram_2<DG,AT,AP>` class for Voronoi faces. Below we
     present its interface.
 
-    \cgalModels `DefaultConstructible`
-    \cgalModels `CopyConstructible`
-    \cgalModels `Assignable`
-    \cgalModels `EqualityComparable`
-    \cgalModels `LessThanComparable`
+    \cgalModels{DefaultConstructible,CopyConstructible,Assignable,EqualityComparable,LessThanComparable}
 
     \sa `CGAL::Voronoi_diagram_2<DG,AT,AP>`
     \sa \link CGAL::Voronoi_diagram_2::Vertex `CGAL::Voronoi_diagram_2<DG,AT,AP>::Vertex` \endlink
@@ -167,11 +163,7 @@ class Voronoi_diagram_2 {
     `Voronoi_diagram_2<DG,AT,AP>` class for Voronoi halfedges.
     Below we present its interface.
 
-    \cgalModels `DefaultConstructible`
-    \cgalModels `CopyConstructible`
-    \cgalModels `Assignable`
-    \cgalModels `EqualityComparable`
-    \cgalModels `LessThanComparable`
+    \cgalModels{DefaultConstructible,CopyConstructible,Assignable,EqualityComparable,LessThanComparable}
 
     \sa `CGAL::Voronoi_diagram_2<DG,AT,AP>`
     \sa \link CGAL::Voronoi_diagram_2::Vertex `CGAL::Voronoi_diagram_2<DG,AT,AP>::Vertex` \endlink
@@ -407,11 +399,7 @@ class Voronoi_diagram_2 {
     The class `Vertex` is the Voronoi vertex class provided by the class
     `Voronoi_diagram_2<DG,AT,AP>` class. Below we present its interface.
 
-    \cgalModels `DefaultConstructible`
-    \cgalModels `CopyConstructible`
-    \cgalModels `Assignable`,
-    \cgalModels `EqualityComparable`
-    \cgalModels `LessThanComparable`
+    \cgalModels{DefaultConstructible,CopyConstructible,Assignable,,EqualityComparable,LessThanComparable}
 
     \sa `CGAL::Voronoi_diagram_2<DG,AT,AP>`
     \sa \link CGAL::Voronoi_diagram_2::Halfedge `CGAL::Voronoi_diagram_2<DG,AT,AP>::Halfedge` \endlink
diff --git a/Weights/include/CGAL/Weights/discrete_harmonic_weights.h b/Weights/include/CGAL/Weights/discrete_harmonic_weights.h
index 6faa6f189c41..9a4243fdd5d1 100644
--- a/Weights/include/CGAL/Weights/discrete_harmonic_weights.h
+++ b/Weights/include/CGAL/Weights/discrete_harmonic_weights.h
@@ -142,7 +142,7 @@ typename Kernel::FT discrete_harmonic_weight(const CGAL::Point_3<Kernel>& p0,
   \tparam PointMap a model of `ReadablePropertyMap` whose key type is `VertexRange::value_type` and
                    value type is `Point_2`. The default is `CGAL::Identity_property_map`.
 
-  \cgalModels `BarycentricWeights_2`
+  \cgalModels{BarycentricWeights_2}
 */
 template<typename VertexRange,
          typename GeomTraits,
diff --git a/Weights/include/CGAL/Weights/mean_value_weights.h b/Weights/include/CGAL/Weights/mean_value_weights.h
index a7bd53e9d6c8..b1cfeaaeffa0 100644
--- a/Weights/include/CGAL/Weights/mean_value_weights.h
+++ b/Weights/include/CGAL/Weights/mean_value_weights.h
@@ -190,7 +190,7 @@ typename Kernel::FT mean_value_weight(const CGAL::Point_3<Kernel>& p0,
   \tparam PointMap a model of `ReadablePropertyMap` whose key type is `VertexRange::value_type` and
                    value type is `Point_2`. The default is `CGAL::Identity_property_map`.
 
-  \cgalModels `BarycentricWeights_2`
+  \cgalModels{BarycentricWeights_2}
 */
 template<typename VertexRange,
          typename GeomTraits,
diff --git a/Weights/include/CGAL/Weights/wachspress_weights.h b/Weights/include/CGAL/Weights/wachspress_weights.h
index 9a1c9e7bd1b0..4e046d7e37cf 100644
--- a/Weights/include/CGAL/Weights/wachspress_weights.h
+++ b/Weights/include/CGAL/Weights/wachspress_weights.h
@@ -136,7 +136,7 @@ typename Kernel::FT wachspress_weight(const CGAL::Point_3<Kernel>& p0,
   \tparam PointMap a model of `ReadablePropertyMap` whose key type is `VertexRange::value_type` and
                    value type is `Point_2`. The default is `CGAL::Identity_property_map`.
 
-  \cgalModels `BarycentricWeights_2`
+  \cgalModels{BarycentricWeights_2}
 */
 template<typename VertexRange,
          typename GeomTraits,

From 77020e946b4a84ee01ea688cc21e7978d41b7cdd Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Sun, 9 Jul 2023 13:04:05 +0200
Subject: [PATCH 0477/1398] Consistency of terms

Based on a remark in https://github.com/CGAL/cgal/pull/7576#issuecomment-1621587888 aslo changed here some names for consistency
---
 Documentation/doc/resources/1.8.13/BaseDoxyfile.in | 6 +++---
 Documentation/doc/resources/1.9.6/BaseDoxyfile.in  | 6 +++---
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index ae2cc84f6c17..6cb51b732278 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -159,9 +159,9 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalPkgSince{1}=<B>Introduced in:</B> \cgal \1<BR>" \
                          "cgalPkgDependsOn{1}=<B>Depends on:</B> \1 <BR>" \
                          "cgalPkgLicense{1}=<B>License:</B> \1 <BR>" \
-                         "cgalPkgDemo{2}=<B>Windows Demo:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a><BR><B>Common Demo Dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
-                         "cgalPkgDemo{4}=<B>Windows Demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a><BR><B>Common Demo Dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
-                         "cgalPkgDemo{6}=<B>Windows Demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\6\">\5</a><BR><B>Common Demo Dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
+                         "cgalPkgDemo{2}=<B>Windows demo:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
+                         "cgalPkgDemo{4}=<B>Windows demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
+                         "cgalPkgDemo{6}=<B>Windows demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\6\">\5</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
                          "cgalPkgDescriptionEnd=" \
                          "cgalModifBegin=\htmlonly <div class=\"CGALModification\"> \endhtmlonly \xrefitem Modification \"Modifications\" \"MODIFICATIONS\" " \
                          "cgalModifEnd=\htmlonly </div> \endhtmlonly \latexonly END MODIFICATIONS \endlatexonly" \
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index 1cfd0a6ffd9f..1ea10418fe11 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -168,9 +168,9 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalPkgSince{1}=<B>Introduced in:</B> \cgal \1<BR>" \
                          "cgalPkgDependsOn{1}=<B>Depends on:</B> \1 <BR>" \
                          "cgalPkgLicense{1}=<B>License:</B> \1 <BR>" \
-                         "cgalPkgDemo{2}=<B>Windows Demo:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a><BR><B>Common Demo Dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
-                         "cgalPkgDemo{4}=<B>Windows Demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a><BR><B>Common Demo Dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
-                         "cgalPkgDemo{6}=<B>Windows Demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\6\">\5</a><BR><B>Common Demo Dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
+                         "cgalPkgDemo{2}=<B>Windows demo:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
+                         "cgalPkgDemo{4}=<B>Windows demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
+                         "cgalPkgDemo{6}=<B>Windows demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\6\">\5</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
                          "cgalPkgDescriptionEnd=" \
                          "cgalModifBegin=\htmlonly <div class=\"CGALModification\"> \endhtmlonly \xrefitem Modification \"Modifications\" \"MODIFICATIONS\"" \
                          "cgalModifEnd=\htmlonly </div> \endhtmlonly \latexonly END MODIFICATIONS \endlatexonly" \

From faafc6453f7a1773b9fb94563a2ae86d94fd311a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 11 Jul 2023 18:15:34 +0200
Subject: [PATCH 0478/1398] add a missing check

---
 Scripts/developer_scripts/run_testsuite_with_ctest | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/Scripts/developer_scripts/run_testsuite_with_ctest b/Scripts/developer_scripts/run_testsuite_with_ctest
index 723b3938d2ce..43674242e987 100644
--- a/Scripts/developer_scripts/run_testsuite_with_ctest
+++ b/Scripts/developer_scripts/run_testsuite_with_ctest
@@ -414,6 +414,13 @@ run_test_on_host()
   fi
 
   for PLATFORM in ${PLATFORMS}; do
+
+    if [ "${CGAL_RELEASE_ID}" \> "CGAL-6.0" ]; then
+      if [ "${PLATFORM}" = "MSVC2015-Release-64bits" ]; then
+        continue
+      fi
+    fi
+
     run_test_on_platform "${PLATFORM}"
     collect_demos_binaries "${PLATFORM}"
     publish_results "${PLATFORM}"

From ff2f100d2380fa9ddfb5b32cbaabaa6de10a1451 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 12 Jul 2023 10:37:14 +0200
Subject: [PATCH 0479/1398] ImageInterface.ui moved by PR #7313

---
 .reuse/dep5              | 2 +-
 Installation/.reuse/dep5 | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/.reuse/dep5 b/.reuse/dep5
index 62552ffe07cc..06784d71d6b2 100644
--- a/.reuse/dep5
+++ b/.reuse/dep5
@@ -7,6 +7,6 @@ Files: .* *.cmake *.md .github/* Maintenance/* */TODO */doc/* */deb/* */applicat
 Copyright: 1995-2023 The CGAL Project
 License: CC0-1.0
 
-Files: CMakeLists.txt GraphicsView/include/CGAL/Qt/resources/ImageInterface.ui GraphicsView/include/CGAL/Qt/resources/qglviewer-icon.xpm Installation/AUTHORS Installation/CMakeLists.txt Installation/README Installation/auxiliary/cgal_create_cmake_script.1 Installation/auxiliary/gmp/README Installation/include/CGAL/license/gpl_package_list.txt MacOSX/auxiliary/cgal_app.icns copyright
+Files: CMakeLists.txt GraphicsView/include/CGAL/Qt/ImageInterface.ui GraphicsView/include/CGAL/Qt/resources/qglviewer-icon.xpm Installation/AUTHORS Installation/CMakeLists.txt Installation/README Installation/auxiliary/cgal_create_cmake_script.1 Installation/auxiliary/gmp/README Installation/include/CGAL/license/gpl_package_list.txt MacOSX/auxiliary/cgal_app.icns copyright
 Copyright: 1995-2023 The CGAL Project
 License: CC0-1.0
diff --git a/Installation/.reuse/dep5 b/Installation/.reuse/dep5
index 68f659f36af5..ef2e017a3975 100644
--- a/Installation/.reuse/dep5
+++ b/Installation/.reuse/dep5
@@ -7,6 +7,6 @@ Files: *.cmake *.md doc/* doc_html/* scripts/* developer_scripts/* package_info/
 Copyright: 1995-2023 The CGAL Project
 License: CC0-1.0
 
-Files: include/CGAL/Qt/resources/ImageInterface.ui include/CGAL/Qt/resources/qglviewer-icon.xpm AUTHORS CMakeLists.txt README auxiliary/cgal_create_cmake_script.1 auxiliary/gmp/README include/CGAL/license/gpl_package_list.txt auxiliary/cgal_app.icns copyright VERSION
+Files: include/CGAL/Qt/ImageInterface.ui include/CGAL/Qt/resources/qglviewer-icon.xpm AUTHORS CMakeLists.txt README auxiliary/cgal_create_cmake_script.1 auxiliary/gmp/README include/CGAL/license/gpl_package_list.txt auxiliary/cgal_app.icns copyright VERSION
 Copyright: 1995-2023 The CGAL Project
 License: CC0-1.0

From b9d098c7a9db68e783f898adbfd6a83e19227ad1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 12 Jul 2023 11:02:03 +0200
Subject: [PATCH 0480/1398] add extra missing  renaming

---
 Triangulation/doc/Triangulation/Triangulation.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Triangulation/doc/Triangulation/Triangulation.txt b/Triangulation/doc/Triangulation/Triangulation.txt
index b64ad247c361..ef305af708ae 100644
--- a/Triangulation/doc/Triangulation/Triangulation.txt
+++ b/Triangulation/doc/Triangulation/Triangulation.txt
@@ -368,14 +368,14 @@ there are (at least) two possibilities:
 The first is to iterate over the full cells of the triangulation and check if they
 are infinite or not:
 
-\cgalExample{triangulation1.cpp}
+\cgalExample{triangulation1.h}
 
 A second possibility is to ask the triangulation to gather all the full cells
 incident to the infinite vertex: they form precisely the set of infinite
 full cells:
 
 
-\cgalExample{triangulation2.cpp}
+\cgalExample{triangulation2.h}
 
 One important difference between the two examples above is that the first uses
 <I>little</I> memory but traverses <I>all</I> the full cells, while the second

From cc41b541160e3cc1e40da4f397e19caf1b1c3fa5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 12 Jul 2023 13:31:13 +0200
Subject: [PATCH 0481/1398] remove extra comment begin

---
 .../Arrangement_on_surface_2/CGAL/Arr_point_location_result.h   | 2 --
 1 file changed, 2 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
index ed8cc09f5d06..2a48e35b399b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
@@ -1,5 +1,3 @@
-/*!
-
 namespace CGAL {
 
 /*!

From 6fbbb70b20906cfc7d7e6f0ec5a2272d92071cb2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 12 Jul 2023 14:39:03 +0200
Subject: [PATCH 0482/1398] Generalize FFG doc: the selection's value_type
 needs not be faces_size_type

---
 .../CGAL/boost/graph/Face_filtered_graph.h    | 82 +++++++++----------
 BGL/test/BGL/test_Face_filtered_graph.cpp     |  2 +-
 2 files changed, 41 insertions(+), 43 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
index e6f4136481d9..a412755576e9 100644
--- a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
+++ b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
@@ -162,15 +162,14 @@ struct Face_filtered_graph
   /*!
    * \brief Constructor where the set of selected faces is specified as a range of patch ids.
    *
-   * \tparam FacePatchIndexMap a model of `ReadablePropertyMap` with
-      `face_descriptor` as key type and
-      `graph_traits<Graph>::%faces_size_type` as value type.
-   * \tparam FacePatchIndexRange a model of `ConstRange` with `boost::property_traits<FacePatchIndexMap>::%value_type` as value type.
+   * \tparam FacePatchIDMap a model of `ReadablePropertyMap` with `face_descriptor` as key type
+   *                        and whose value type is a model of `Hashable`.
+   * \tparam FacePatchIDRange a model of `ConstRange` with `boost::property_traits<FacePatchIDMap>::%value_type` as value type.
    * \tparam NamedParameters a sequence of named parameters
    *
    * \param graph the underlying graph
-   * \param face_patch_index_map the property map that assigns a patch index to each face
-   * \param selected_face_patch_indices a range of the face patch indices to select
+   * \param face_patch_id_map the property map that assigns a patch index to each face
+   * \param selected_face_patch_ids a range of the face patch indices to select
    * \param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
    *
    * \cgalNamedParamsBegin
@@ -208,14 +207,14 @@ struct Face_filtered_graph
    *   \cgalParamNEnd
    * \cgalNamedParamsEnd
    */
-  template <typename FacePatchIndexMap, class FacePatchIndexRange, class CGAL_NP_TEMPLATE_PARAMETERS>
+  template <typename FacePatchIDMap, class FacePatchIDRange, class CGAL_NP_TEMPLATE_PARAMETERS>
   Face_filtered_graph(const Graph& graph,
-                      const FacePatchIndexRange& selected_face_patch_indices,
-                      FacePatchIndexMap face_patch_index_map,
+                      const FacePatchIDRange& selected_face_patch_ids,
+                      FacePatchIDMap face_patch_id_map,
                       const CGAL_NP_CLASS& np
 #ifndef DOXYGEN_RUNNING
                     , std::enable_if_t<
-                        boost::has_range_const_iterator<FacePatchIndexRange>::value
+                        boost::has_range_const_iterator<FacePatchIDRange>::value
                       >* = 0
 #endif
                       )
@@ -224,15 +223,15 @@ struct Face_filtered_graph
       vimap(CGAL::get_initialized_vertex_index_map(graph, np)),
       himap(CGAL::get_initialized_halfedge_index_map(graph, np))
   {
-    set_selected_faces(selected_face_patch_indices, face_patch_index_map);
+    set_selected_faces(selected_face_patch_ids, face_patch_id_map);
   }
 
-  template <typename FacePatchIndexMap, class FacePatchIndexRange>
+  template <typename FacePatchIDMap, class FacePatchIDRange>
   Face_filtered_graph(const Graph& graph,
-                      const FacePatchIndexRange& selected_face_patch_indices,
-                      FacePatchIndexMap face_patch_index_map
+                      const FacePatchIDRange& selected_face_patch_ids,
+                      FacePatchIDMap face_patch_id_map
                       , std::enable_if_t<
-                          boost::has_range_const_iterator<FacePatchIndexRange>::value
+                          boost::has_range_const_iterator<FacePatchIDRange>::value
                       >* = 0
                       )
     : _graph(const_cast<Graph&>(graph)),
@@ -240,19 +239,18 @@ struct Face_filtered_graph
       vimap(CGAL::get_initialized_vertex_index_map(graph)),
       himap(CGAL::get_initialized_halfedge_index_map(graph))
   {
-    set_selected_faces(selected_face_patch_indices, face_patch_index_map);
+    set_selected_faces(selected_face_patch_ids, face_patch_id_map);
   }
   /*!
    * \brief Constructor where the set of selected faces is specified as a patch id.
    *
-   * \tparam FacePatchIndexMap a model of `ReadablePropertyMap` with
-      `face_descriptor` as key type and
-      `graph_traits<Graph>::%faces_size_type` as value type.
+   * \tparam FacePatchIDMap a model of `ReadablePropertyMap` with `face_descriptor` as key type
+   *                        and whose value type is a model of `Hashable`.
    * \tparam NamedParameters a sequence of named parameters
    *
    * \param graph the underlying graph.
-   * \param face_patch_index_map the property map that assigns a patch index to each face
-   * \param selected_face_patch_index the index of the face patch selected
+   * \param face_patch_id_map the property map that assigns a patch index to each face
+   * \param selected_face_patch_id the index of the face patch selected
    * \param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
    *
    * \cgalNamedParamsBegin
@@ -290,29 +288,29 @@ struct Face_filtered_graph
    *   \cgalParamNEnd
    * \cgalNamedParamsEnd
    */
-  template <typename FacePatchIndexMap, class CGAL_NP_TEMPLATE_PARAMETERS>
+  template <typename FacePatchIDMap, class CGAL_NP_TEMPLATE_PARAMETERS>
   Face_filtered_graph(const Graph& graph,
-                      typename boost::property_traits<FacePatchIndexMap>::value_type selected_face_patch_index,
-                      FacePatchIndexMap face_patch_index_map,
+                      typename boost::property_traits<FacePatchIDMap>::value_type selected_face_patch_id,
+                      FacePatchIDMap face_patch_id_map,
                       const CGAL_NP_CLASS& np)
     : _graph(const_cast<Graph&>(graph)),
       fimap(CGAL::get_initialized_face_index_map(graph, np)),
       vimap(CGAL::get_initialized_vertex_index_map(graph, np)),
       himap(CGAL::get_initialized_halfedge_index_map(graph, np))
   {
-    set_selected_faces(selected_face_patch_index, face_patch_index_map);
+    set_selected_faces(selected_face_patch_id, face_patch_id_map);
   }
 
-  template <typename FacePatchIndexMap>
+  template <typename FacePatchIDMap>
   Face_filtered_graph(const Graph& graph,
-                      typename boost::property_traits<FacePatchIndexMap>::value_type pid,
-                      FacePatchIndexMap face_patch_index_map)
+                      typename boost::property_traits<FacePatchIDMap>::value_type pid,
+                      FacePatchIDMap face_patch_id_map)
     : _graph(const_cast<Graph&>(graph)),
       fimap(CGAL::get_initialized_face_index_map(graph)),
       vimap(CGAL::get_initialized_vertex_index_map(graph)),
       himap(CGAL::get_initialized_halfedge_index_map(graph))
   {
-    set_selected_faces(pid, face_patch_index_map);
+    set_selected_faces(pid, face_patch_id_map);
   }
 
   /*!
@@ -438,9 +436,9 @@ struct Face_filtered_graph
   }
 
   /// changes the set of selected faces using a patch id.
-  template<class FacePatchIndexMap>
-  void set_selected_faces(typename boost::property_traits<FacePatchIndexMap>::value_type face_patch_id,
-                          FacePatchIndexMap face_patch_index_map)
+  template<class FacePatchIDMap>
+  void set_selected_faces(typename boost::property_traits<FacePatchIDMap>::value_type face_patch_id,
+                          FacePatchIDMap face_patch_id_map)
   {
     selected_faces.resize(num_faces(_graph));
     selected_vertices.resize(num_vertices(_graph));
@@ -452,7 +450,7 @@ struct Face_filtered_graph
 
     for(face_descriptor fd : faces(_graph) )
     {
-      if(get(face_patch_index_map, fd) == face_patch_id)
+      if(get(face_patch_id_map, fd) == face_patch_id)
       {
         selected_faces.set(get(fimap, fd));
         for(halfedge_descriptor hd : halfedges_around_face(halfedge(fd, _graph), _graph))
@@ -467,12 +465,12 @@ struct Face_filtered_graph
     reset_indices();
   }
   /// changes the set of selected faces using a range of patch ids
-  template<class FacePatchIndexRange, class FacePatchIndexMap>
-  void set_selected_faces(const FacePatchIndexRange& selected_face_patch_indices,
-                          FacePatchIndexMap face_patch_index_map
+  template<class FacePatchIDRange, class FacePatchIDMap>
+  void set_selected_faces(const FacePatchIDRange& selected_face_patch_ids,
+                          FacePatchIDMap face_patch_id_map
 #ifndef DOXYGEN_RUNNING
                           , std::enable_if_t<
-                              boost::has_range_const_iterator<FacePatchIndexRange>::value
+                              boost::has_range_const_iterator<FacePatchIDRange>::value
                             >* = 0
 #endif
                           )
@@ -485,13 +483,13 @@ struct Face_filtered_graph
     selected_vertices.reset();
     selected_halfedges.reset();
 
-    typedef typename boost::property_traits<FacePatchIndexMap>::value_type Patch_index;
-    std::unordered_set<Patch_index> pids(std::begin(selected_face_patch_indices),
-                                         std::end(selected_face_patch_indices));
+    typedef typename boost::property_traits<FacePatchIDMap>::value_type Patch_ID;
+    std::unordered_set<Patch_ID> pids(std::begin(selected_face_patch_ids),
+                                      std::end(selected_face_patch_ids));
 
-    for(face_descriptor fd : faces(_graph) )
+    for(face_descriptor fd : faces(_graph))
     {
-      if(pids.count(get(face_patch_index_map, fd)) != 0)
+      if(pids.count(get(face_patch_id_map, fd)) != 0)
       {
         selected_faces.set(get(fimap, fd));
         for(halfedge_descriptor hd : halfedges_around_face(halfedge(fd, _graph), _graph))
diff --git a/BGL/test/BGL/test_Face_filtered_graph.cpp b/BGL/test/BGL/test_Face_filtered_graph.cpp
index 5dd6521bb02f..3cd95dc56684 100644
--- a/BGL/test/BGL/test_Face_filtered_graph.cpp
+++ b/BGL/test/BGL/test_Face_filtered_graph.cpp
@@ -20,7 +20,7 @@ typedef std::unordered_set<std::size_t> id_map;
 namespace PMP = CGAL::Polygon_mesh_processing;
 
 template <typename Graph>
-void test_halfedge_around_vertex_iterator(const  Graph& g)
+void test_halfedge_around_vertex_iterator(const Graph& g)
 {
   typedef typename boost::graph_traits<Graph>::face_descriptor g_face_descriptor;
   typedef CGAL::Face_filtered_graph<Graph> Adapter;

From 7d86ca5b95d1f96900ea7642062da92acfcb9dd2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 12 Jul 2023 14:40:31 +0200
Subject: [PATCH 0483/1398] Test FFG constructors more thoroughly

---
 BGL/test/BGL/test_Face_filtered_graph.cpp | 68 ++++++++++++++++++-----
 1 file changed, 53 insertions(+), 15 deletions(-)

diff --git a/BGL/test/BGL/test_Face_filtered_graph.cpp b/BGL/test/BGL/test_Face_filtered_graph.cpp
index 3cd95dc56684..551685e89b8a 100644
--- a/BGL/test/BGL/test_Face_filtered_graph.cpp
+++ b/BGL/test/BGL/test_Face_filtered_graph.cpp
@@ -319,17 +319,42 @@ void test_index_property_maps(const Graph& g)
 }
 
 template<typename Graph>
-void test_read(const Graph& g)
+void test_constructors(const Graph& g)
 {
   typedef typename boost::graph_traits<Graph>::face_descriptor g_face_descriptor;
   typedef CGAL::Face_filtered_graph<Graph> Adapter;
   CGAL_GRAPH_TRAITS_MEMBERS(Adapter);
 
+  Adapter fg0(g);
+  Adapter fg1(g, CGAL::parameters::all_default());
+
   std::map<g_face_descriptor, std::size_t> map;
   PMP::connected_components(g, boost::make_assoc_property_map(map));
   Adapter fg(g, 0, boost::make_assoc_property_map(map));
   assert(fg.is_selection_valid());
   assert(CGAL::is_valid_polygon_mesh(fg));
+
+  // patch ID type that is not a fundamental type
+  std::map<g_face_descriptor, CGAL::IO::Color> colors;
+  for(auto f : faces(fg))
+    colors[f] = CGAL::IO::blue();
+  auto color_map = boost::make_assoc_property_map(colors);
+  Adapter color_fg(g, CGAL::IO::blue(), color_map);
+  assert(color_fg.is_selection_valid());
+  assert(CGAL::is_valid_polygon_mesh(color_fg));
+  assert(num_faces(g) == num_faces(color_fg));
+
+  Adapter color_fg2(g, CGAL::IO::red(), color_map, CGAL::parameters::all_default());
+  assert(color_fg2.is_selection_valid());
+  assert(CGAL::is_valid_polygon_mesh(color_fg2));
+  assert(num_faces(color_fg2) == 0);
+
+  // range of non-fundamental ID types
+  std::vector<CGAL::IO::Color> selected_colors { CGAL::IO::blue(), CGAL::IO::red() };
+  Adapter color_fg3(g, selected_colors, color_map);
+  assert(color_fg3.is_selection_valid());
+  assert(CGAL::is_valid_polygon_mesh(color_fg3));
+  assert(num_faces(g) == num_faces(color_fg3));
 }
 
 template <typename Graph>
@@ -338,7 +363,7 @@ test_graph_range(const std::vector<Graph>& graphs)
 {
   for(Graph p : graphs)
   {
-    test_read(p);
+    test_constructors(p);
     test_vertex_iterators(p);
     test_out_edges(p);
     test_in_edges(p);
@@ -500,20 +525,8 @@ void test_invalid_selections()
   assert(!many_umbrellas_fg.is_selection_valid());
 }
 
-int main()
+void test_SM_tetrahedron()
 {
-  test_graph_range(poly_data());
-
-#ifdef CGAL_USE_SURFACE_MESH
-  test_graph_range(sm_data());
-#endif
-
-#ifdef CGAL_USE_OPENMESH
-  test_graph_range(omesh_data());
-#endif
-
-  test_invalid_selections();
-
   // Make a tetrahedron and test the adapter for a patch that only contains 2 faces
   typedef CGAL::Face_filtered_graph<SM> SM_Adapter;
   typedef SM::Property_map<boost::graph_traits<SM>::face_descriptor , std::size_t> SM_FCCMap;
@@ -531,7 +544,10 @@ int main()
   pids.insert(2);
   SM_Adapter sm_adapter(*sm, pids, fccmap);
   test_mesh<SM,SM_FCCMap, SM_Adapter>(sm_adapter);
+}
 
+void test_Polyhedron_tetrahedron()
+{
   typedef boost::graph_traits<Polyhedron> PolyTraits;
   typedef boost::property_map<Polyhedron, boost::vertex_point_t>::const_type VPMap;
   typedef PolyTraits::face_descriptor poly_face_descriptor;
@@ -550,6 +566,9 @@ int main()
   std::map<poly_face_descriptor, PolyTraits::faces_size_type> fc_map;
   FCMap poly_fccmap(fc_map);
 
+  std::unordered_set<long unsigned int> pids;
+  pids.insert(0);
+  pids.insert(2);
   VPMap vpmap = get(boost::vertex_point, *poly);
   PMP::connected_components(*poly, poly_fccmap,
                             CGAL::parameters::edge_is_constrained_map(Constraint<Polyhedron, VPMap >(*poly, vpmap))
@@ -560,3 +579,22 @@ int main()
                                              .halfedge_index_map(poly_himap));
   test_mesh<Polyhedron, FCMap, Poly_Adapter>(poly_adapter);
 }
+
+int main(int, char**)
+{
+  test_graph_range(poly_data());
+#ifdef CGAL_USE_SURFACE_MESH
+  test_graph_range(sm_data());
+#endif
+#ifdef CGAL_USE_OPENMESH
+  test_graph_range(omesh_data());
+#endif
+
+  test_invalid_selections();
+
+  test_SM_tetrahedron();
+  test_Polyhedron_tetrahedron();
+
+  std::cout << "Done" << std::endl;
+  return EXIT_SUCCESS;
+}

From 09a6a3e1c7a816959b58bd6980195f7378406c39 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 12 Jul 2023 14:40:47 +0200
Subject: [PATCH 0484/1398] Add a hash for CGAL::IO::Color

---
 Stream_support/include/CGAL/IO/Color.h | 24 ++++++++++++++++++++----
 1 file changed, 20 insertions(+), 4 deletions(-)

diff --git a/Stream_support/include/CGAL/IO/Color.h b/Stream_support/include/CGAL/IO/Color.h
index 6cb2939fe493..daee2d37b403 100644
--- a/Stream_support/include/CGAL/IO/Color.h
+++ b/Stream_support/include/CGAL/IO/Color.h
@@ -19,12 +19,13 @@
 
 #include <CGAL/config.h>
 #include <CGAL/array.h>
+
+#include <boost/functional/hash.hpp>
+
 #include <algorithm>
 #include <cstdlib>
 #include <cmath>
 
-
-
 namespace CGAL {
 
 namespace IO {
@@ -287,7 +288,6 @@ class Color
   }
 
   /// @}
-
 };
 
 
@@ -375,6 +375,22 @@ using IO::white;
 using IO::yellow;
 #endif
 
-} //namespace CGAL
+} // namespace CGAL
+
+namespace std {
+
+template <>
+struct hash<CGAL::IO::Color>
+{
+  std::size_t operator()(const CGAL::IO::Color& c) const
+  {
+    std::size_t result = boost::hash_value(c[0]);
+    for(std::size_t i=1; i<4; ++i)
+      boost::hash_combine(result, c[i]);
+    return result;
+  }
+};
+
+} // namespace std
 
 #endif  // CGAL_COLOR_H

From 5cc57d4c5885748de0dfbc8c054aaceaa54c6c2e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 12 Jul 2023 14:45:29 +0200
Subject: [PATCH 0485/1398] Minor doc fix

---
 BGL/include/CGAL/boost/graph/Face_filtered_graph.h | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
index a412755576e9..28afe86c27a6 100644
--- a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
+++ b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
@@ -168,8 +168,8 @@ struct Face_filtered_graph
    * \tparam NamedParameters a sequence of named parameters
    *
    * \param graph the underlying graph
-   * \param face_patch_id_map the property map that assigns a patch index to each face
-   * \param selected_face_patch_ids a range of the face patch indices to select
+   * \param face_patch_id_map the property map that assigns a patch ID to each face
+   * \param selected_face_patch_ids a range of the face patch identifiers to select
    * \param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
    *
    * \cgalNamedParamsBegin
@@ -249,8 +249,8 @@ struct Face_filtered_graph
    * \tparam NamedParameters a sequence of named parameters
    *
    * \param graph the underlying graph.
-   * \param face_patch_id_map the property map that assigns a patch index to each face
-   * \param selected_face_patch_id the index of the face patch selected
+   * \param face_patch_id_map the property map that assigns a patch ID to each face
+   * \param selected_face_patch_id the identifier of the face patch selected
    * \param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
    *
    * \cgalNamedParamsBegin

From 39983615cd2e977b1faea7f1ea9a25ae2300eae1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 12 Jul 2023 15:57:35 +0200
Subject: [PATCH 0486/1398] Remove unused variable

---
 .../demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp       | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp
index 4de8e8fe41f4..7ba691b6cf14 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp
@@ -137,7 +137,6 @@ class Scene_heat_item
 
     auto vpm = CGAL::get(CGAL::vertex_point, *sm);
     auto vnormals = sm->property_map<vertex_descriptor, EPICK::Vector_3>("v:normal").first;
-    auto fnormals = sm->property_map<face_descriptor, EPICK::Vector_3>("f:normal").first;
 
     auto [vcolors, vcolors_found] = sm->property_map<vertex_descriptor, CGAL::IO::Color>("v:color");
     CGAL_assertion(vcolors_found);

From 852056a8acf440887b4621a0fe868ef04f0222a6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 12 Jul 2023 16:16:42 +0200
Subject: [PATCH 0487/1398] Rephrase documentation of one-sided Haussdorff
 distance function

---
 .../include/CGAL/Polygon_mesh_processing/distance.h          | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
index 85c78461d73d..f109adcfa0c8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
@@ -2455,9 +2455,8 @@ bounded_error_squared_Hausdorff_distance_naive_impl(const TriangleMesh1& tm1,
 /**
  * \ingroup PMP_distance_grp
  *
- * returns an estimate on the Hausdorff distance between `tm1` and `tm2` that
- * is at most `error_bound` away from the actual Hausdorff distance between
- * the two given meshes.
+ * returns an estimate on the Hausdorff distance from `tm1` to `tm2` that
+ * is at most `error_bound` away from the actual Hausdorff distance from `tm1` to `tm2`.
  *
  * @tparam Concurrency_tag enables sequential versus parallel algorithm.
  *                         Possible values are `Sequential_tag` and `Parallel_tag`.

From 58ef28b8e1a78e2aee3fc988830e36978315baf1 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <Laurent.Rineau@cgal.org>
Date: Thu, 13 Jul 2023 11:48:37 +0200
Subject: [PATCH 0488/1398] Update after #7441

Since PR https://github.com/CGAL/cgal/pull/7441 the tested versions of
Doxygen are changed from:

  - 1.8.4,
  - 1.8.13,
  - master,

to:

  - 1.8.13,
  - 1.9.6
  - master

See https://github.com/CGAL/cgal/pull/7441/files#diff-20378a17af64de2d537c278603e389b4c15fe31670621544caa850fa233ea1deR83-R84

This commit preserve the choice of Doxygen 1.8.13 as the default one for
published versions of the CGAL documentation.
---
 Maintenance/public_release/scripts/prepare_release | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Maintenance/public_release/scripts/prepare_release b/Maintenance/public_release/scripts/prepare_release
index 889c7e99da3e..69c14d861339 100755
--- a/Maintenance/public_release/scripts/prepare_release
+++ b/Maintenance/public_release/scripts/prepare_release
@@ -42,12 +42,12 @@ printf "Copy documentation to doc_html/ and doc_html_online/...\n"
 [ -d "/srv/CGAL/www/${PUBLIC_RELEASE_NAME#CGAL-}/Manual" ] || mkdir -p "/srv/CGAL/www/${PUBLIC_RELEASE_NAME#CGAL-}/Manual"
 
 cp "$PUBLIC_RELEASE_DIR"/*(.) "${RELEASE_CANDIDATES_DIR}/$PUBLIC_RELEASE_NAME"
-files=("$MANUAL_TESTS_DIR/$INTERNAL_RELEASE"/output2/*)
+files=("$MANUAL_TESTS_DIR/$INTERNAL_RELEASE"/output1/*)
 if ((${#files[@]} == 0)); then
     printf "ERROR: documentation files are missing\n"
     error_code=1
 else
-    rsync -a --exclude xml "$MANUAL_TESTS_DIR/$INTERNAL_RELEASE"/output2/* "$DEST_DIR/doc_html/"
+    rsync -a --exclude xml "$MANUAL_TESTS_DIR/$INTERNAL_RELEASE"/output1/* "$DEST_DIR/doc_html/"
     pushd "$DEST_DIR/doc_html/Manual/search"
     for i in g n c s i; do sed -i "s/..\/BGL$i/..\/BGL\/$i/g" *; done
     popd

From b9819d55fcf998d4bbcb2643c64b49becd409914 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 13 Jul 2023 17:49:34 +0200
Subject: [PATCH 0489/1398] Keep up with the ever-changing moods of the Named
 Parameters committee

:>
---
 BGL/test/BGL/test_Face_filtered_graph.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/BGL/test/BGL/test_Face_filtered_graph.cpp b/BGL/test/BGL/test_Face_filtered_graph.cpp
index 551685e89b8a..ee4f2166439b 100644
--- a/BGL/test/BGL/test_Face_filtered_graph.cpp
+++ b/BGL/test/BGL/test_Face_filtered_graph.cpp
@@ -326,7 +326,7 @@ void test_constructors(const Graph& g)
   CGAL_GRAPH_TRAITS_MEMBERS(Adapter);
 
   Adapter fg0(g);
-  Adapter fg1(g, CGAL::parameters::all_default());
+  Adapter fg1(g, CGAL::parameters::default_values());
 
   std::map<g_face_descriptor, std::size_t> map;
   PMP::connected_components(g, boost::make_assoc_property_map(map));
@@ -344,7 +344,7 @@ void test_constructors(const Graph& g)
   assert(CGAL::is_valid_polygon_mesh(color_fg));
   assert(num_faces(g) == num_faces(color_fg));
 
-  Adapter color_fg2(g, CGAL::IO::red(), color_map, CGAL::parameters::all_default());
+  Adapter color_fg2(g, CGAL::IO::red(), color_map, CGAL::parameters::default_values());
   assert(color_fg2.is_selection_valid());
   assert(CGAL::is_valid_polygon_mesh(color_fg2));
   assert(num_faces(color_fg2) == 0);

From 4e5578d46900fa4dacab38298c640b58c47cfbfc Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Sat, 15 Jul 2023 13:12:15 +0200
Subject: [PATCH 0490/1398] issue #7395 Improvement of layout of model
 relations

- based on review
---
 .../doc/AABB_tree/Concepts/AABBGeomTraits.h   |  2 +
 .../doc/AABB_tree/Concepts/AABBPrimitive.h    | 11 ++--
 .../Concepts/AABBPrimitiveWithSharedData.h    |  7 +-
 .../Concepts/AABBRayIntersectionGeomTraits.h  |  2 +
 .../Concepts/AABBRayIntersectionTraits.h      |  3 +-
 AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h |  3 +-
 ...ancingFrontSurfaceReconstructionTraits_3.h |  2 +
 .../Concepts/AlgebraicStructureTraits.h       |  3 +-
 .../Concepts/FieldNumberType.h                | 21 +++---
 .../Concepts/FractionTraits.h                 |  3 +-
 .../Concepts/FromIntConstructible.h           |  7 +-
 .../Concepts/RealEmbeddableTraits.h           |  3 +-
 .../Concepts/RingNumberType.h                 | 26 ++++----
 .../Concepts/AlgebraicKernel_d_1.h            |  5 +-
 .../Concepts/AlphaShapeFace_2.h               |  3 +-
 .../Concepts/AlphaShapeTraits_2.h             |  5 +-
 .../Concepts/AlphaShapeVertex_2.h             |  2 +
 .../Concepts/WeightedAlphaShapeTraits_2.h     |  5 +-
 .../Concepts/AlphaShapeCell_3.h               |  2 +
 .../Concepts/AlphaShapeTraits_3.h             |  2 +
 .../Concepts/AlphaShapeVertex_3.h             |  2 +
 .../Concepts/FixedAlphaShapeCell_3.h          |  2 +
 .../Concepts/FixedAlphaShapeTraits_3.h        |  2 +
 .../Concepts/FixedAlphaShapeVertex_3.h        |  2 +
 .../FixedWeightedAlphaShapeTraits_3.h         |  2 +
 .../Concepts/WeightedAlphaShapeTraits_3.h     |  2 +
 .../Alpha_wrap_3/Concepts/AlphaWrapOracle.h   |  9 +--
 .../Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h |  2 +
 .../Concepts/ApolloniusGraphDataStructure_2.h |  3 +-
 .../ApolloniusGraphHierarchyVertexBase_2.h    |  3 +-
 .../Concepts/ApolloniusGraphTraits_2.h        |  5 +-
 .../Concepts/ApolloniusGraphVertexBase_2.h    |  3 +-
 .../Concepts/ArrTraits--Approximate_2.h       |  3 +-
 .../Concepts/ArrTraits--AreMergeable_2.h      |  3 +-
 .../ArrTraits--CompareXNearBoundary_2.h       |  3 +-
 ...rrTraits--CompareXOnBoundaryOfCurveEnd_2.h |  7 +-
 .../ArrTraits--CompareXOnBoundary_2.h         |  7 +-
 .../Concepts/ArrTraits--CompareX_2.h          |  3 +-
 .../Concepts/ArrTraits--CompareXy_2.h         |  3 +-
 .../Concepts/ArrTraits--CompareYAtXLeft_2.h   |  3 +-
 .../Concepts/ArrTraits--CompareYAtXRight_2.h  |  3 +-
 .../Concepts/ArrTraits--CompareYAtX_2.h       |  3 +-
 .../ArrTraits--CompareYNearBoundary_2.h       |  3 +-
 .../ArrTraits--CompareYOnBoundary_2.h         |  9 +--
 .../Concepts/ArrTraits--ConstructCurve_2.h    |  3 +-
 .../ArrTraits--ConstructMaxVertex_2.h         |  3 +-
 .../ArrTraits--ConstructMinVertex_2.h         |  3 +-
 .../ArrTraits--ConstructXMonotoneCurve_2.h    |  3 +-
 .../Concepts/ArrTraits--Curve_2.h             |  3 +-
 .../Concepts/ArrTraits--Equal_2.h             |  3 +-
 .../Concepts/ArrTraits--Intersect_2.h         |  3 +-
 .../ArrTraits--IsOnXIdentification_2.h        |  3 +-
 .../ArrTraits--IsOnYIdentification_2.h        |  3 +-
 .../Concepts/ArrTraits--IsVertical_2.h        |  3 +-
 .../Concepts/ArrTraits--MakeXMonotone_2.h     |  3 +-
 .../Concepts/ArrTraits--Merge_2.h             |  3 +-
 .../Concepts/ArrTraits--ParameterSpaceInX_2.h |  7 +-
 .../Concepts/ArrTraits--ParameterSpaceInY_2.h |  7 +-
 .../Concepts/ArrTraits--Point_2.h             |  3 +-
 .../Concepts/ArrTraits--Split_2.h             |  3 +-
 .../Concepts/ArrTraits--XMonotoneCurve_2.h    |  3 +-
 .../Concepts/ArrangementApproximateTraits_2.h | 17 ++---
 .../Concepts/ArrangementBasicTopologyTraits.h |  3 +-
 .../Concepts/ArrangementBasicTraits_2.h       | 31 ++++-----
 .../ArrangementConstructCurveTraits_2.h       | 15 +++--
 ...rangementConstructXMonotoneCurveTraits_2.h | 15 +++--
 .../Concepts/ArrangementDcel.h                |  9 +--
 .../Concepts/ArrangementDcelWithRebind.h      |  7 +-
 .../ArrangementHorizontalSideTraits_2.h       |  9 +--
 .../Concepts/ArrangementInputFormatter.h      |  7 +-
 .../Concepts/ArrangementLandmarkTraits_2.h    | 17 ++---
 .../ArrangementOpenBoundaryTraits_2.h         | 11 ++--
 .../Concepts/ArrangementOutputFormatter.h     |  7 +-
 .../Concepts/ArrangementPointLocation_2.h     |  9 +--
 .../ArrangementSphericalBoundaryTraits_2.h    |  3 +-
 .../Concepts/ArrangementTopologyTraits.h      |  7 +-
 .../Concepts/ArrangementTraits_2.h            | 29 +++++----
 .../Concepts/ArrangementVerticalRayShoot_2.h  |  9 +--
 .../ArrangementVerticalSideTraits_2.h         |  9 +--
 .../ArrangementWithHistoryInputFormatter.h    |  3 +-
 .../ArrangementWithHistoryOutputFormatter.h   |  3 +-
 .../Concepts/ArrangementXMonotoneTraits_2.h   | 29 +++++----
 .../Concepts/OverlayTraits.h                  |  5 +-
 BGL/doc/BGL/Concepts/EdgeListGraph.h          |  2 +
 BGL/doc/BGL/Concepts/FaceGraph.h              |  2 +
 BGL/doc/BGL/Concepts/FaceListGraph.h          |  2 +
 BGL/doc/BGL/Concepts/HalfedgeGraph.h          |  2 +
 BGL/doc/BGL/Concepts/HalfedgeListGraph.h      |  2 +
 BGL/doc/BGL/Concepts/MutableFaceGraph.h       |  2 +
 BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h   |  2 +
 BGL/doc/BGL/Concepts/VertexListGraph.h        |  2 +
 .../Concepts/BarycentricCoordinates_2.h       |  7 +-
 .../Concepts/BarycentricTraits_2.h            | 10 +--
 .../Concepts/DiscretizedDomain_2.h            |  3 +-
 .../ArrDirectionalTraits--AreMergeable_2.h    |  3 +-
 ...rDirectionalTraits--CompareEndpointsXy_2.h |  3 +-
 ...rrDirectionalTraits--ConstructOpposite_2.h |  3 +-
 .../ArrDirectionalTraits--Intersect_2.h       |  3 +-
 .../Concepts/ArrDirectionalTraits--Merge_2.h  |  3 +-
 .../Concepts/ArrDirectionalTraits--Split_2.h  |  3 +-
 .../ArrangementDirectionalXMonotoneTraits_2.h | 15 +++--
 .../Concepts/GeneralPolygonSetDcel.h          |  3 +-
 .../Concepts/GeneralPolygonSetDcelFace.h      |  3 +-
 .../Concepts/GeneralPolygonSetDcelHalfedge.h  |  3 +-
 .../Concepts/GeneralPolygonSetTraits_2.h      |  7 +-
 .../Concepts/GeneralPolygon_2.h               |  3 +-
 .../GpsTraitsGeneralPolygonWithHoles_2.h      |  3 +-
 .../Concepts/GpsTraitsGeneralPolygon_2.h      |  5 +-
 .../ApproximateMinEllipsoid_d_Traits_d.h      |  7 +-
 .../Concepts/MinCircle2Traits.h               |  3 +-
 .../Concepts/MinEllipse2Traits.h              |  3 +-
 .../Concepts/MinQuadrilateralTraits_2.h       |  3 +-
 .../Concepts/MinSphereAnnulusDTraits.h        |  7 +-
 .../Concepts/MinSphereOfSpheresTraits.h       | 13 ++--
 .../Concepts/RectangularPCenterTraits_2.h     |  3 +-
 .../Concepts/BoxIntersectionBox_d.h           |  5 +-
 .../Concepts/BoxIntersectionTraits_d.h        |  3 +-
 ...rnelForCircles--PolynomialForCircles_2_2.h |  3 +-
 ...lgebraicKernelForCircles--Polynomial_1_2.h |  3 +-
 ...raicKernelForCircles--RootForCircles_2_2.h |  3 +-
 .../Concepts/AlgebraicKernelForCircles.h      |  3 +-
 .../CircularKernel--CircularArcPoint_2.h      |  3 +-
 .../Concepts/CircularKernel--CircularArc_2.h  |  3 +-
 .../Concepts/CircularKernel--LineArc_2.h      |  3 +-
 .../Concepts/CircularKernel.h                 |  5 +-
 ...rnelForSpheres--PolynomialForSpheres_2_3.h |  3 +-
 ...lgebraicKernelForSpheres--Polynomial_1_3.h |  3 +-
 ...cKernelForSpheres--PolynomialsForLines_3.h |  3 +-
 ...raicKernelForSpheres--RootForSpheres_2_3.h |  3 +-
 .../Concepts/AlgebraicKernelForSpheres.h      |  3 +-
 .../SphericalKernel--CircularArcPoint_3.h     |  3 +-
 .../Concepts/SphericalKernel--CircularArc_3.h |  3 +-
 .../Concepts/SphericalKernel--LineArc_3.h     |  3 +-
 .../Concepts/SphericalKernel.h                |  5 +-
 .../doc/Circulator/Concepts/ConstHandle.h     |  3 +-
 .../doc/Circulator/Concepts/ConstRange.h      |  5 +-
 Circulator/doc/Circulator/Concepts/Handle.h   |  9 +--
 Circulator/doc/Circulator/Concepts/Range.h    |  2 +
 .../doc/Classification/Concepts/Classifier.h  |  7 +-
 .../Classification/Concepts/NeighborQuery.h   |  9 +--
 .../Concepts/CellAttribute.h                  |  2 +
 .../Concepts/CombinatorialMap.h               |  2 +
 .../Combinatorial_map/Concepts/GenericMap.h   |  6 +-
 .../Concepts/GenericMapItems.h                |  2 +
 .../Concepts/ConvexHullTraits_2.h             | 13 ++--
 .../Concepts/ConvexHullTraits_3.h             |  5 +-
 .../Concepts/IsStronglyConvexTraits_3.h       |  4 +-
 .../Concepts/ConvexHullTraits_d.h             |  7 +-
 .../Concepts/DelaunayLiftedTraits_d.h         |  5 +-
 .../Convex_hull_d/Concepts/DelaunayTraits_d.h |  5 +-
 .../doc/resources/1.8.13/BaseDoxyfile.in      | 10 ++-
 .../doc/resources/1.9.6/BaseDoxyfile.in       | 10 ++-
 .../Envelope_3/Concepts/EnvelopeTraits_3.h    |  9 +--
 .../Generalized_map/Concepts/GeneralizedMap.h |  2 +
 .../Generator/Concepts/CombinationElement.h   |  8 ++-
 .../doc/Generator/Concepts/PointGenerator.h   | 29 +++++----
 .../Concepts/RandomConvexHullTraits_2.h       |  2 +
 .../Concepts/RandomConvexSetTraits_2.h        |  3 +-
 .../Concepts/RandomPolygonTraits_2.h          |  2 +
 .../doc/HalfedgeDS/Concepts/HalfedgeDS.h      |  7 +-
 .../doc/HalfedgeDS/Concepts/HalfedgeDSFace.h  |  5 +-
 .../HalfedgeDS/Concepts/HalfedgeDSHalfedge.h  |  5 +-
 .../doc/HalfedgeDS/Concepts/HalfedgeDSItems.h |  7 +-
 .../HalfedgeDS/Concepts/HalfedgeDSVertex.h    |  5 +-
 .../Concepts/HeatMethodTraits_3.h             |  2 +
 .../HyperbolicDelaunayTriangulationTraits_2.h |  5 +-
 .../HyperbolicTriangulationFaceBase_2.h       |  3 +-
 .../Concepts/ExtremalPolygonTraits_2.h        |  5 +-
 .../LargestEmptyIsoRectangleTraits_2.h        |  5 +-
 .../Concepts/GradientFittingTraits.h          |  3 +-
 .../Concepts/InterpolationTraits.h            |  5 +-
 .../Interval_skip_list/Concepts/Interval.h    |  5 +-
 .../doc/Jet_fitting_3/Concepts/DataKernel.h   |  5 +-
 .../doc/Jet_fitting_3/Concepts/LocalKernel.h  |  5 +-
 .../doc/Kernel_23/Concepts/GeomObjects.h      | 65 ++++++++++++-------
 Kernel_23/doc/Kernel_23/Concepts/Kernel.h     | 17 ++---
 .../Kernel_d/Concepts/KernelWithLifting_d.h   |  5 +-
 Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h     |  9 +--
 .../Kernel_d/Concepts/LinearAlgebraTraits_d.h |  5 +-
 .../Concepts/CellAttributeWithPoint.h         |  2 +
 .../Concepts/LinearCellComplex.h              |  6 +-
 .../Concepts/LinearCellComplexItems.h         |  3 +-
 .../Concepts/LinearCellComplexTraits.h        |  2 +
 .../doc/Matrix_search/Concepts/BasicMatrix.h  |  3 +-
 .../Concepts/MonotoneMatrixSearchTraits.h     |  3 +-
 .../Concepts/SortedMatrixSearchTraits.h       |  3 +-
 .../ConformingDelaunayTriangulationTraits_2.h |  4 +-
 .../Mesh_2/Concepts/DelaunayMeshFaceBase_2.h  |  3 +-
 .../Mesh_2/Concepts/DelaunayMeshTraits_2.h    |  4 +-
 .../Concepts/DelaunayMeshVertexBase_2.h       |  3 +-
 .../doc/Mesh_2/Concepts/MeshingCriteria_2.h   |  5 +-
 .../Concepts/BisectionGeometricTraits_3.h     |  2 +
 .../Concepts/IntersectionGeometricTraits_3.h  |  2 +
 Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h   |  5 +-
 .../doc/Mesh_3/Concepts/MeshCellCriteria_3.h  |  3 +-
 .../Concepts/MeshCriteriaWithFeatures_3.h     |  3 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h   |  3 +-
 .../doc/Mesh_3/Concepts/MeshDomainField_3.h   |  3 +-
 .../Concepts/MeshDomainWithFeatures_3.h       |  5 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h     |  5 +-
 .../doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h  |  3 +-
 .../doc/Mesh_3/Concepts/MeshFacetCriteria_3.h |  3 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h   |  2 +
 .../Concepts/MeshTriangulationTraits_3.h      |  2 +
 Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h |  3 +-
 .../doc/Mesh_3/Concepts/TriangleAccessor_3.h  |  3 +-
 .../Concepts/PolygonConvexDecomposition_2.h   | 11 ++--
 .../PolygonWithHolesConvexDecomposition_2.h   |  5 +-
 .../Miscellany/Concepts/UniqueHashFunction.h  |  3 +-
 .../Concepts/ModularTraits.h                  |  3 +-
 .../Concepts/Modularizable.h                  | 20 +++---
 .../Nef_2/Concepts/ExtendedKernelTraits_2.h   |  7 +-
 .../doc/Number_types/Concepts/RootOf_2.h      |  4 +-
 .../Concepts/OrientedBoundingBoxTraits.h      |  3 +-
 ...imalTransportationReconstructionTraits_2.h |  6 +-
 .../doc/Orthtree/Concepts/OrthtreeTraits.h    |  7 +-
 .../doc/Orthtree/Concepts/OrthtreeTraversal.h |  9 +--
 .../Concepts/ConvexPartitionIsValidTraits_2.h |  3 +-
 .../Concepts/IsYMonotoneTraits_2.h            |  5 +-
 .../Concepts/OptimalConvexPartitionTraits_2.h |  3 +-
 .../Concepts/PartitionIsValidTraits_2.h       |  3 +-
 .../Partition_2/Concepts/PartitionTraits_2.h  |  3 +-
 .../doc/Partition_2/Concepts/PolygonIsValid.h |  5 +-
 .../YMonotonePartitionIsValidTraits_2.h       |  3 +-
 .../Periodic_2DelaunayTriangulationTraits_2.h |  3 +-
 .../Concepts/Periodic_2Offset_2.h             |  3 +-
 .../Periodic_2TriangulationFaceBase_2.h       |  3 +-
 .../Periodic_2TriangulationTraits_2.h         |  3 +-
 .../Periodic_2TriangulationVertexBase_2.h     |  3 +-
 .../Periodic_3MeshDomainWithFeatures_3.h      |  3 +-
 .../Concepts/Periodic_3MeshDomain_3.h         |  3 +-
 .../Periodic_3DelaunayTriangulationTraits_3.h |  3 +-
 .../Concepts/Periodic_3Offset_3.h             |  3 +-
 ...riodic_3RegularTriangulationDSCellBase_3.h |  5 +-
 ...odic_3RegularTriangulationDSVertexBase_3.h |  3 +-
 .../Periodic_3RegularTriangulationTraits_3.h  |  3 +-
 .../Periodic_3TriangulationDSCellBase_3.h     |  3 +-
 .../Periodic_3TriangulationDSVertexBase_3.h   |  3 +-
 .../Periodic_3TriangulationTraits_3.h         |  3 +-
 ...4HyperbolicDelaunayTriangulationTraits_2.h |  3 +-
 ...iodic_4HyperbolicTriangulationFaceBase_2.h |  3 +-
 ...dic_4HyperbolicTriangulationVertexBase_2.h |  3 +-
 .../Concepts/GeneralPolygonWithHoles_2.h      |  5 +-
 .../doc/Polygon/Concepts/PolygonTraits_2.h    |  8 ++-
 .../Concepts/PMPCorefinementVisitor.h         |  3 +-
 .../Concepts/PMPDistanceTraits.h              |  2 +
 .../Concepts/PMPHolefillingVisitor.h          |  3 +-
 .../PMPPolygonSoupOrientationVisitor.h        |  3 +-
 .../Concepts/PMPTriangulateFaceVisitor.h      |  3 +-
 .../Polyhedron/Concepts/PolyhedronItems_3.h   |  7 +-
 .../Polyhedron/Concepts/PolyhedronTraits_3.h  |  6 +-
 .../PolylineSimplificationCostFunction.h      |  7 +-
 .../PolylineSimplificationStopPredicate.h     |  7 +-
 .../PolylineSimplificationVertexBase_2.h      |  3 +-
 .../Polynomial/Concepts/PolynomialTraits_d.h  |  3 +-
 .../doc/Polynomial/Concepts/Polynomial_d.h    |  3 +-
 .../Concepts/AllFurthestNeighborsTraits_2.h   |  9 +--
 .../Concepts/PolytopeDistanceDTraits.h        |  7 +-
 .../Concepts/WidthTraits_3.h                  |  3 +-
 .../doc/QP_solver/Concepts/LinearProgram.h    |  7 +-
 .../Concepts/NonnegativeLinearProgram.h       | 14 ++--
 .../Concepts/NonnegativeQuadraticProgram.h    |  7 +-
 .../doc/QP_solver/Concepts/QuadraticProgram.h |  7 +-
 ...shComplexWithFeatures_3InTriangulation_3.h |  3 +-
 .../Concepts/MeshComplex_3InTriangulation_3.h |  3 +-
 .../Concepts/SimplicialMeshCellBase_3.h       |  9 +--
 .../Concepts/SimplicialMeshVertexBase_3.h     |  7 +-
 .../doc/STL_Extension/Concepts/Descriptor.h   |  5 +-
 .../doc/STL_Extension/Concepts/Hashable.h     |  6 +-
 .../doc/STL_Extension/Concepts/Index.h        |  5 +-
 .../STL_Extension/Concepts/ProjectionObject.h | 27 ++++----
 .../Concepts/SurjectiveLockDataStructure.h    |  3 +-
 .../Concepts/ScaleSpaceMesher.h               |  5 +-
 .../Concepts/ScaleSpaceSmoother.h             |  5 +-
 .../Concepts/RangeSegmentTreeTraits_k.h       | 13 ++--
 .../SegmentDelaunayGraphDataStructure_2.h     |  3 +-
 .../Concepts/SegmentDelaunayGraphFaceBase_2.h |  3 +-
 ...egmentDelaunayGraphHierarchyVertexBase_2.h |  3 +-
 .../Concepts/SegmentDelaunayGraphSite_2.h     |  3 +-
 .../SegmentDelaunayGraphStorageSite_2.h       |  3 +-
 .../SegmentDelaunayGraphStorageTraits_2.h     |  3 +-
 .../Concepts/SegmentDelaunayGraphTraits_2.h   |  9 +--
 .../SegmentDelaunayGraphVertexBase_2.h        |  3 +-
 .../SegmentDelaunayGraphLinfTraits_2.h        |  9 +--
 .../Concepts/CastingTraits_2.h                |  2 +
 .../Concepts/EfficientRANSACTraits.h          |  3 +-
 .../Shape_detection/Concepts/NeighborQuery.h  |  9 +--
 .../doc/Shape_detection/Concepts/RegionType.h | 15 +++--
 .../Concepts/ContourDirections.h              |  7 +-
 .../Concepts/NeighborQuery.h                  |  3 +-
 .../Concepts/RegularizationType.h             |  5 +-
 .../Concepts/SkinSurfaceTraits_3.h            |  3 +-
 .../Skin_surface_3/Concepts/SkinSurface_3.h   |  5 +-
 .../Concepts/SnapRoundingTraits_2.h           | 21 +++++-
 .../Concepts/DiagonalizeTraits.h              |  3 +-
 .../Concepts/MixedIntegerProgramTraits.h      | 16 +++--
 ...ormalEquationSparseLinearAlgebraTraits_d.h |  3 +-
 .../Concepts/QuadraticProgramTraits.h         |  3 +-
 .../Concepts/SparseLinearAlgebraTraits_d.h    | 11 ++--
 .../SparseLinearAlgebraWithFactorTraits_d.h   |  3 +-
 .../doc/Solver_interface/Concepts/SvdTraits.h |  9 ++-
 .../Concepts/FuzzyQueryItem.h                 |  5 +-
 .../Concepts/GeneralDistance.h                |  5 +-
 .../Concepts/OrthogonalDistance.h             |  5 +-
 .../Concepts/RangeSearchTraits.h              | 13 ++--
 .../Concepts/SearchGeomTraits_2.h             |  2 +
 .../Concepts/SearchGeomTraits_3.h             |  2 +
 .../Spatial_searching/Concepts/SearchTraits.h | 17 ++---
 .../Concepts/SpatialSeparator.h               |  3 +-
 .../Spatial_searching/Concepts/SpatialTree.h  |  3 +-
 .../doc/Spatial_searching/Concepts/Splitter.h | 15 +++--
 .../Concepts/SpatialSortingTraits_2.h         |  4 +-
 .../Concepts/SpatialSortingTraits_3.h         |  4 +-
 .../Concepts/SpatialSortingTraits_d.h         |  4 +-
 .../Concepts/PolygonOffsetBuilderTraits_2.h   |  3 +-
 .../StraightSkeletonBuilderTraits_2.h         |  3 +-
 .../StraightSkeletonBuilder_2_Visitor.h       |  3 +-
 .../Concepts/StraightSkeletonFace_2.h         |  3 +-
 .../Concepts/StraightSkeletonHalfedge_2.h     |  3 +-
 .../StraightSkeletonItemsConverter_2.h        |  3 +-
 .../Concepts/StraightSkeletonVertex_2.h       |  3 +-
 .../Concepts/StraightSkeleton_2.h             |  3 +-
 .../Stream_lines_2/Concepts/Integrator_2.h    |  5 +-
 .../Concepts/StreamLinesTraits_2.h            |  2 +
 .../Stream_lines_2/Concepts/VectorField_2.h   |  5 +-
 .../Subdivision_method_3/Concepts/DQQMask_3.h |  3 +-
 .../Subdivision_method_3/Concepts/PQQMask_3.h |  3 +-
 .../Subdivision_method_3/Concepts/PTQMask_3.h |  3 +-
 .../Concepts/Sqrt3Mask_3.h                    |  3 +-
 .../Concepts/ErrorMetricProxy.h               |  5 +-
 .../DeformationClosestRotationTraits_3.h      |  5 +-
 .../Concepts/Parameterizer_3.h                | 21 +++---
 .../Concepts/SegmentationGeomTraits.h         |  2 +
 .../Concepts/SurfaceMeshShortestPathTraits.h  |  3 +-
 .../Concepts/GetCost.h                        |  7 +-
 .../Concepts/GetPlacement.h                   | 11 ++--
 .../Concepts/PlacementFilter.h                |  5 +-
 .../Concepts/StopPredicate.h                  | 11 ++--
 .../MeanCurvatureSkeletonizationTraits.h      |  2 +
 .../Concepts/PolygonalSchema.h                |  6 +-
 .../Concepts/PolygonalSchemaItems.h           |  2 +
 .../Concepts/WeightFunctor.h                  |  6 +-
 .../Concepts/ImplicitFunction.h               |  4 +-
 .../Concepts/ImplicitSurfaceTraits_3.h        |  2 +
 .../Concepts/SurfaceMeshCellBase_3.h          |  5 +-
 .../SurfaceMeshComplex_2InTriangulation_3.h   |  3 +-
 .../Concepts/SurfaceMeshFacetsCriteria_3.h    |  3 +-
 .../Concepts/SurfaceMeshTraits_3.h            |  3 +-
 .../Concepts/SurfaceMeshTriangulation_3.h     |  2 +
 .../Concepts/SurfaceMeshVertexBase_3.h        |  5 +-
 .../doc/Surface_mesher/Concepts/Surface_3.h   |  3 +-
 .../Concepts/TriangulationDSFaceBase_2.h      |  3 +-
 .../Concepts/TriangulationDSVertexBase_2.h    |  3 +-
 .../Concepts/TriangulationDataStructure_2.h   |  9 ++-
 .../Concepts/TriangulationDSCellBase_3.h      |  3 +-
 .../Concepts/TriangulationDSVertexBase_3.h    |  3 +-
 .../Concepts/TriangulationDataStructure_3.h   |  3 +-
 .../Concepts/RemeshingCellBase_3.h            |  3 +-
 .../Concepts/RemeshingTriangulationTraits_3.h |  2 +
 .../Concepts/RemeshingVertexBase_3.h          |  3 +-
 .../Concepts/DelaunayTriangulationTraits.h    |  5 +-
 .../Concepts/RegularTriangulationTraits.h     |  5 +-
 .../Concepts/TriangulationDSFace.h            |  3 +-
 .../Concepts/TriangulationDSFullCell.h        |  5 +-
 .../Concepts/TriangulationDSVertex.h          |  5 +-
 .../Concepts/TriangulationDataStructure.h     | 13 ++--
 .../Concepts/TriangulationFullCell.h          |  3 +-
 .../Concepts/TriangulationTraits.h            |  5 +-
 .../Concepts/TriangulationVertex.h            |  3 +-
 ...ConstrainedDelaunayTriangulationTraits_2.h |  8 ++-
 .../ConstrainedTriangulationFaceBase_2.h      |  3 +-
 .../ConstrainedTriangulationTraits_2.h        | 10 +--
 .../Concepts/DelaunayTriangulationTraits_2.h  | 14 ++--
 .../Concepts/RegularTriangulationFaceBase_2.h |  3 +-
 .../Concepts/RegularTriangulationTraits_2.h   |  2 +
 .../RegularTriangulationVertexBase_2.h        |  3 +-
 .../Concepts/TriangulationFaceBase_2.h        |  3 +-
 .../TriangulationHierarchyVertexBase_2.h      |  3 +-
 .../Concepts/TriangulationTraits_2.h          | 10 +--
 .../TriangulationVertexBaseWithInfo_2.h       |  3 +-
 .../Concepts/TriangulationVertexBase_2.h      |  3 +-
 .../DelaunayTriangulationCellBase_3.h         |  5 +-
 .../Concepts/DelaunayTriangulationTraits_3.h  | 15 +++--
 ...lationCellBaseWithWeightedCircumcenter_3.h |  3 +-
 .../Concepts/RegularTriangulationCellBase_3.h |  3 +-
 .../Concepts/RegularTriangulationTraits_3.h   |  2 +
 .../RegularTriangulationVertexBase_3.h        |  3 +-
 .../TriangulationCellBaseWithInfo_3.h         |  3 +-
 .../Concepts/TriangulationCellBase_3.h        |  5 +-
 .../Concepts/TriangulationTraits_3.h          |  2 +
 .../TriangulationVertexBaseWithInfo_3.h       |  3 +-
 .../Concepts/TriangulationVertexBase_3.h      |  5 +-
 .../DelaunayTriangulationOnSphereTraits_2.h   |  5 +-
 .../TriangulationOnSphereFaceBase_2.h         |  3 +-
 .../Concepts/TriangulationOnSphereTraits_2.h  |  5 +-
 .../TriangulationOnSphereVertexBase_2.h       |  3 +-
 .../doc/Visibility_2/Concepts/Visibility_2.h  |  7 +-
 .../Concepts/AdaptationPolicy_2.h             | 19 +++---
 .../Concepts/AdaptationTraits_2.h             |  9 +--
 .../Concepts/DelaunayGraph_2.h                | 14 ++--
 .../Weights/Concepts/AnalyticWeightTraits_2.h |  8 ++-
 .../Weights/Concepts/AnalyticWeightTraits_3.h |  2 +
 .../Weights/Concepts/BarycentricWeights_2.h   |  7 +-
 403 files changed, 1354 insertions(+), 831 deletions(-)
 mode change 100644 => 100755 Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
 mode change 100644 => 100755 Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h

diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
index 75823eb238ae..c01a0008bee3 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBGeomTraits.h
@@ -11,7 +11,9 @@ and the primitives stored in the AABB tree.
 
 \cgalRefines{SearchGeomTraits_3}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the concept `Kernel`}
+\cgalHasModelsEnd
 
 \sa `CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>`
 \sa `CGAL::AABB_tree<AABBTraits>`
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h
index 4a987a58cbb2..cee0dc902966 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h
@@ -12,11 +12,12 @@ The concept `AABBPrimitive` describes the requirements for the primitives stored
 
 The `Primitive` type can be, e.g., a wrapper around a `Handle`. Assume for instance that the input objects are the triangle faces of a mesh stored as a `CGAL::Polyhedron_3`. The `Datum` would be a `Triangle_3` and the `Id` would be a polyhedron `Face_handle`. Method `datum()` can return either a `Triangle_3` constructed on the fly from the face handle or a `Triangle_3` stored internally. This provides a way for the user to trade memory for efficiency.
 
-\cgalHasModelsBegin CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_false,CacheDatum>
-\cgalHasModels CGAL::AABB_segment_primitive<Iterator,CacheDatum>
-\cgalHasModels CGAL::AABB_triangle_primitive<Iterator,CacheDatum>
-\cgalHasModels CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_false,CacheDatum>
-\cgalHasModels CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_false,CacheDatum>
+\cgalHasModelsBegin
+\cgalModels{CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_false,CacheDatum>}
+\cgalModels{CGAL::AABB_segment_primitive<Iterator,CacheDatum>}
+\cgalModels{CGAL::AABB_triangle_primitive<Iterator,CacheDatum>}
+\cgalModels{CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_false,CacheDatum>}
+\cgalModels{CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_false,CacheDatum>}
 \cgalHasModelsEnd
 */
 
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h
index 8ec9a103acdc..27f6805cbca1 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h
@@ -21,9 +21,10 @@ The `Datum` would be a `Triangle_3` and the `Id` a `std::size_t`. The shared dat
 `std::vector<Triangle_3>`.
 The method `datum(const Shared_data&)` then returns a triangle from the vector.
 
-\cgalHasModelsBegin CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_true,CacheDatum>
-\cgalHasModels CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_true,CacheDatum>
-\cgalHasModels CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_true,CacheDatum>
+\cgalHasModelsBegin
+\cgalModels{CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_true,CacheDatum>}
+\cgalModels{CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_true,CacheDatum>}
+\cgalModels{CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_true,CacheDatum>}
 \cgalHasModelsEnd
 */
 
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h
index f47f1e9464bc..c34d88be491e 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionGeomTraits.h
@@ -9,7 +9,9 @@ define the Intersection_distance functor.
 
 \cgalRefines{AABBGeomTraits}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the concept `Kernel`}
+\cgalHasModelsEnd
 
 \sa `CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>`
 \sa `CGAL::AABB_tree<AABBTraits>`
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
index 87d139973b5c..1df2c9802b25 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
@@ -7,7 +7,8 @@ The concept `AABBRayIntersectionTraits` is a refinement of the concept
 `AABBTraits` it also requires function objects to calculate the
 distance of an intersection along a ray.
 
-\cgalHasModelsBegin CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>
+\cgalHasModelsBegin
+\cgalModels{CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>}
 \cgalHasModelsEnd
 
 \sa `CGAL::AABB_tree<AABBTraits>`
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
index f5e5846322e3..5dfba2998c86 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
@@ -5,7 +5,8 @@
 
 The concept `AABBTraits` provides the geometric primitive types and methods for the class `CGAL::AABB_tree<AABBTraits>`.
 
-\cgalHasModelsBegin CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>
+\cgalHasModelsBegin
+\cgalModels{CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>}
 \cgalHasModelsEnd
 
 \cgalRefines{SearchGeomTraits_3}
diff --git a/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h b/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h
index a56096bcb197..e31759b1f3de 100644
--- a/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h
+++ b/Advancing_front_surface_reconstruction/doc/Advancing_front_surface_reconstruction/Concepts/AdvancingFrontSurfaceReconstructionTraits_3.h
@@ -11,7 +11,9 @@ together with a few geometric predicates and constructions on these objects.
 
 \cgalRefines{DelaunayTriangulationTraits_3}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the concept `Kernel`}
+\cgalHasModelsEnd
 */
 class AdvancingFrontSurfaceReconstructionTraits_3
 {
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h
index 0fbc4ea6f174..d21861c1c288 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h
@@ -28,7 +28,8 @@ algebraic operations within that structure.
 \sa `CGAL::Field_with_kth_root_tag`
 \sa `CGAL::Field_with_root_of_tag`
 
-\cgalHasModelsBegin CGAL::Algebraic_structure_traits<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Algebraic_structure_traits<T>}
 \cgalHasModelsEnd
 
 */
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
index a53ac500cbf9..5cd89e524e60 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
@@ -9,16 +9,17 @@ for Cartesian kernels.
 
 \cgalRefines{Field,RealEmbeddable}
 
-\cgalHasModelsBegin float
-\cgalHasModels double
-\cgalHasModels CGAL::Gmpq
-\cgalHasModels CGAL::Interval_nt
-\cgalHasModels CGAL::Interval_nt_advanced
-\cgalHasModels CGAL::Lazy_exact_nt<FieldNumberType>
-\cgalHasModels CGAL::Quotient<RingNumberType>
-\cgalHasModels leda_rational
-\cgalHasModels leda_bigfloat
-\cgalHasModels leda_real
+\cgalHasModelsBegin
+\cgalModels{float}
+\cgalModels{double}
+\cgalModels{CGAL::Gmpq}
+\cgalModels{CGAL::Interval_nt}
+\cgalModels{CGAL::Interval_nt_advanced}
+\cgalModels{CGAL::Lazy_exact_nt<FieldNumberType>}
+\cgalModels{CGAL::Quotient<RingNumberType>}
+\cgalModels{leda_rational}
+\cgalModels{leda_bigfloat}
+\cgalModels{leda_real}
 \cgalHasModelsEnd
 
 \sa `RingNumberType`
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h
index 35d4b408a679..f1248606d90c 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h
@@ -8,7 +8,8 @@ A model of `FractionTraits` is associated with a type `Type`.
 In case the associated type is a `Fraction`, a model of `FractionTraits` provides the relevant functionality for decomposing and re-composing as well
 as the numerator and denominator type.
 
-\cgalHasModelsBegin CGAL::Fraction_traits<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Fraction_traits<T>}
 \cgalHasModelsEnd
 
 \sa `FractionTraits_::Decompose`
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
index f8f2f3f8749d..f31912ba5d85 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
@@ -6,9 +6,10 @@
 A model of the concept `FromIntConstructible` is required
 to be constructible from int.
 
-\cgalHasModelsBegin int
-\cgalHasModels long
-\cgalHasModels double
+\cgalHasModelsBegin
+\cgalModels{int}
+\cgalModels{long}
+\cgalModels{double}
 \cgalHasModelsEnd
 
 */
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h
index 1cd155d7ccff..312eff6326f8 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h
@@ -7,7 +7,8 @@ A model of `RealEmbeddableTraits` is associated to a number type
 `Type` and reflects the properties of this type with respect
 to the concept `RealEmbeddable`.
 
-\cgalHasModelsBegin CGAL::Real_embeddable_traits<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Real_embeddable_traits<T>}
 \cgalHasModelsEnd
 */
 
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h
index 462030682589..f3ee8c4ba58d 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h
@@ -10,18 +10,20 @@ for Homogeneous kernels.
 
 \cgalRefines{IntegralDomainWithoutDivision,RealEmbeddable}
 
-\cgalHasModelsBareBegin{\cpp built-in number types} CGAL::Gmpq
-\cgalHasModels CGAL::Gmpz
-\cgalHasModels CGAL::Interval_nt
-\cgalHasModels CGAL::Interval_nt_advanced
-\cgalHasModels CGAL::Lazy_exact_nt<RingNumberType>
-\cgalHasModels CGAL::MP_Float
-\cgalHasModels CGAL::Gmpzf
-\cgalHasModels CGAL::Quotient<RingNumberType>
-\cgalHasModels leda_integer
-\cgalHasModels leda_rational
-\cgalHasModels leda_bigfloat
-\cgalHasModels leda_real
+\cgalHasModelsBegin
+\cgalHasModelsBare{\cpp built-in number types}
+\cgalHasModels{CGAL::Gmpq}
+\cgalHasModels{CGAL::Gmpz}
+\cgalHasModels{CGAL::Interval_nt}
+\cgalHasModels{CGAL::Interval_nt_advanced}
+\cgalHasModels{CGAL::Lazy_exact_nt<RingNumberType>}
+\cgalHasModels{CGAL::MP_Float}
+\cgalHasModels{CGAL::Gmpzf}
+\cgalHasModels{CGAL::Quotient<RingNumberType>}
+\cgalHasModels{leda_integer}
+\cgalHasModels{leda_rational}
+\cgalHasModels{leda_bigfloat}
+\cgalHasModels{leda_real}
 \cgalHasModelsEnd
 
 \sa `FieldNumberType`
diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h
index f9b702d436be..4bc59c9e3886 100644
--- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h
+++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h
@@ -8,8 +8,9 @@ algebraic functionalities on univariate polynomials of general degree \f$ d\f$.
 
 \cgalRefines{CopyConstructible,Assignable}
 
-\cgalHasModelsBegin CGAL::Algebraic_kernel_rs_gmpz_d_1
-\cgalHasModels CGAL::Algebraic_kernel_rs_gmpq_d_1
+\cgalHasModelsBegin
+\cgalModels{CGAL::Algebraic_kernel_rs_gmpz_d_1}
+\cgalModels{CGAL::Algebraic_kernel_rs_gmpq_d_1}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernel_d_2`
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h
index 562a6aaaa195..498eaed26d73 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h
@@ -9,7 +9,8 @@ The concept `AlphaShapeFace_2` describes the requirements for the base face of a
   RegularTriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_2TriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
-\cgalHasModelsBegin CGAL::Alpha_shape_face_base_2 (templated with the appropriate triangulation face base class)
+\cgalHasModelsBegin
+\cgalModels{CGAL::Alpha_shape_face_base_2 (templated with the appropriate triangulation face base class)}
 \cgalHasModelsEnd
 
 */
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h
index 28ad270b7441..669fdf61f195 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeTraits_2.h
@@ -9,7 +9,10 @@ class of the underlying Delaunay triangulation of a basic alpha shape.
 \cgalRefines{DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
   Periodic_2DelaunayTriangulationTraits_2 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
 
-\cgalHasModelsBare{All models of `Kernel`,Projection traits such as `CGAL::Projection_traits_xy_3<K>`}
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of `Kernel`}
+\cgalHasModelsBare{Projection traits such as `CGAL::Projection_traits_xy_3<K>`}
+\cgalHasModelsEnd
 
 \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
 */
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h
index 5116683d78b3..649ed3970d0e 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeVertex_2.h
@@ -9,7 +9,9 @@ The concept `AlphaShapeVertex_2` describes the requirements for the base vertex
   RegularTriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_2TriangulationVertexBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{`CGAL::Alpha_shape_vertex_base_2` (templated with the appropriate triangulation vertex base class)}
+\cgalHasModelsEnd
 */
 class AlphaShapeVertex_2 {
 public:
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h
index 05be16ee5596..b88db2cd67be 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/WeightedAlphaShapeTraits_2.h
@@ -9,7 +9,10 @@ of the underlying regular triangulation of a weighted alpha shape.
 
 \cgalRefines{RegularTriangulationTraits_2 if the underlying triangulation of the alpha shape is a regular triangulation.}
 
-\cgalHasModelsBare{All models of `Kernel`,Projection traits such as `CGAL::Projection_traits_xy_3<K>`}
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of `Kernel`,}
+\cgalHasModelsBare{Projection traits such as `CGAL::Projection_traits_xy_3<K>`}
+\cgalHasModelsEnd
 
 \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
 */
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h
index de5c0aacd622..fa4ba33da2d8 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeCell_3.h
@@ -9,7 +9,9 @@ The concept `AlphaShapeCell_3` describes the requirements for the base cell of a
   RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{`CGAL::Alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class)}
+\cgalHasModelsEnd
 
 \sa `CGAL::Alpha_status`
 
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h
index 4a5fe7a8bfd0..cff0a2f3c522 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeTraits_3.h
@@ -10,7 +10,9 @@ of the underlying Delaunay triangulation of a basic alpha shape.
 \cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
   Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of `Kernel`}
+\cgalHasModelsEnd
 
 \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
 */
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h
index 65f490141802..3c81217e2ab8 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/AlphaShapeVertex_3.h
@@ -9,7 +9,9 @@ The concept `AlphaShapeVertex_3` describes the requirements for the base vertex
   RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation.
   Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{`CGAL::Alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class)}
+\cgalHasModelsEnd
 
 \sa `CGAL::Alpha_status`
 
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h
index 7707ed14ce16..8d4a59f29ee1 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeCell_3.h
@@ -9,7 +9,9 @@ The concept `FixedAlphaShapeCell_3` describes the requirements for the base cell
   RegularTriangulationCellBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_3TriangulationDSCellBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{`CGAL::Fixed_alpha_shape_cell_base_3` (templated with the appropriate triangulation cell base class)}
+\cgalHasModelsEnd
 */
 class FixedAlphaShapeCell_3 {
 public:
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h
index 4c63e9618fa0..4c0d409f5245 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeTraits_3.h
@@ -10,7 +10,9 @@ of the underlying Delaunay triangulation of a basic alpha shape with a fixed val
 \cgalRefines{DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a Delaunay triangulation,
   Periodic_3DelaunayTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic Delaunay triangulation}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of `Kernel`}
+\cgalHasModelsEnd
 
 \sa CGAL::Exact_predicates_inexact_constructions_kernel (recommended kernel)
 */
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h
index 7b152f16e2e5..dd4db3fecea7 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedAlphaShapeVertex_3.h
@@ -9,7 +9,9 @@ The concept `FixedAlphaShapeVertex_3` describes the requirements for the base ve
   RegularTriangulationVertexBase_3 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_3TriangulationDSVertexBase_3 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{`CGAL::Fixed_alpha_shape_vertex_base_3` (templated with the appropriate triangulation vertex base class)}
+\cgalHasModelsEnd
 */
 
 class FixedAlphaShapeVertex_3 {
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h
index 8b7694d5643c..73d46de6261a 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/FixedWeightedAlphaShapeTraits_3.h
@@ -9,7 +9,9 @@ for the geometric traits class of the underlying regular triangulation of a weig
 \cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of `Kernel`}
+\cgalHasModelsEnd
 
 \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
 */
diff --git a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h
index 10c8009e6c26..f91afc7cdb2c 100644
--- a/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h
+++ b/Alpha_shapes_3/doc/Alpha_shapes_3/Concepts/WeightedAlphaShapeTraits_3.h
@@ -10,7 +10,9 @@ of the underlying regular triangulation of a weighted alpha shape.
 \cgalRefines{RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a regular triangulation,
   Periodic_3RegularTriangulationTraits_3 if the underlying triangulation of the alpha shape is a periodic regular triangulation}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of `Kernel`}
+\cgalHasModelsEnd
 
 \sa `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended kernel)
 */
diff --git a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h
index 145349567d2f..bf8076c97946 100644
--- a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h
+++ b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h
@@ -9,10 +9,11 @@ The concept `AlphaWrapOracle` defines the requirements for an Alpha Wrap <em>Ora
 that answers a number of queries over the input of the algorithm.
 The oracle is the template parameter of the class `CGAL::Alpha_wraps_3_::Alpha_wrap_3`.
 
-\cgalHasModelsBegin CGAL::Alpha_wraps_3_::Point_set_oracle
-\cgalHasModels CGAL::Alpha_wraps_3_::Segment_soup_oracle
-\cgalHasModels CGAL::Alpha_wraps_3_::Triangle_mesh_oracle
-\cgalHasModels CGAL::Alpha_wraps_3_::Triangle_soup_oracle
+\cgalHasModelsBegin
+\cgalModels{CGAL::Alpha_wraps_3_::Point_set_oracle}
+\cgalModels{CGAL::Alpha_wraps_3_::Segment_soup_oracle}
+\cgalModels{CGAL::Alpha_wraps_3_::Triangle_mesh_oracle}
+\cgalModels{CGAL::Alpha_wraps_3_::Triangle_soup_oracle}
 \cgalHasModelsEnd
 
 */
diff --git a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h
index 916aa5aa3daf..c4d7308d5117 100644
--- a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h
+++ b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapTraits_3.h
@@ -11,7 +11,9 @@ you require Kernel. Stitch_borders doesn't even have clear geometric traits requ
 The concept `AlphaWrapTraits_3` defines the requirements for the geometric traits class
 of an alpha wrap oracle.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{Any 3D %kernel is a model of this traits concept}
+\cgalHasModelsEnd
 */
 
 class AlphaWrapTraits_3
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h
index e494faa898c8..78e8ce69c6ad 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h
@@ -27,7 +27,8 @@ We only describe the additional requirements with respect to the
 
 \cgalRefines{TriangulationDataStructure_2}
 
-\cgalHasModelsBegin CGAL::Triangulation_data_structure_2<Vb,Fb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_data_structure_2<Vb,Fb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h
index 4cfc7a99223a..354d27f68bfe 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h
@@ -19,7 +19,8 @@ next and previous level graphs.
 `ApolloniusGraphHierarchyVertexBase_2` does not introduce any
 types in addition to those of `ApolloniusGraphVertexBase_2`.
 
-\cgalHasModelsBegin CGAL::Apollonius_graph_hierarchy_vertex_base_2<CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden> >
+\cgalHasModelsBegin
+\cgalModels{CGAL::Apollonius_graph_hierarchy_vertex_base_2<CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden> >}
 \cgalHasModelsEnd
 
 \sa `ApolloniusGraphDataStructure_2`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h
index 1517dd4fe17f..d62bc56484e5 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h
@@ -12,8 +12,9 @@ it provides a type `Site_2`, which must be a model of the concept
 constructions for sites and several function object
 types for the predicates.
 
-\cgalHasModelsBegin CGAL::Apollonius_graph_traits_2<K,Method_tag>
-\cgalHasModels CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Apollonius_graph_traits_2<K,Method_tag>}
+\cgalModels{CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Apollonius_graph_2<Gt,Agds>`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h
index cac31092bafe..45e4bd357458 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h
@@ -12,7 +12,8 @@ sites. The container stores the hidden sites related to the vertex.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModelsBegin CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden>}
 \cgalHasModelsEnd
 
 \sa `ApolloniusGraphDataStructure_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h
index 671d83a69674..8b105f4dab97 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModelsBegin ArrangementApproximateTraits_2::Approximate_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementApproximateTraits_2::Approximate_2}
  * \cgalHasModelsEnd
  */
 class Approximate_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h
index 56ec39093c7e..a5c401dc85fe 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Are_mergeable_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementXMonotoneTraits_2::Are_mergeable_2}
  * \cgalHasModelsEnd
  */
 class AreMergeable_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h
index 9031f72a9bdb..0d85b1f0ae7d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableTernaryFunction}
  *
- * \cgalHasModelsBegin ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_}
  * \cgalHasModelsEnd
  */
 class CompareXNearBoundary_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h
index 45fd98fa2d6b..8fccd1309061 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h
@@ -5,9 +5,10 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableFunctor}
  *
- * \cgalHasModelsBegin ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2
- * \cgalHasModels ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_2
- * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Compare_x_on_boundary_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2}
+ * \cgalModels{ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_2}
+ * \cgalModels{ArrangementSphericalBoundaryTraits_2::Compare_x_on_boundary_2}
  * \cgalHasModelsEnd
  */
 class CompareXOnBoundaryOfCurveEnd_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h
index b02a736b31d3..77eea00561d8 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h
@@ -5,9 +5,10 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableFunctor}
  *
- * \cgalHasModelsBegin ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2
- * \cgalHasModels ArrangementClosedTopTraits_2::Compare_x_on_boundary_2
- * \cgalHasModels ArrangementIdentifiedHorizontalTraits_2::Compare_x_on_boundary_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2}
+ * \cgalModels{ArrangementClosedTopTraits_2::Compare_x_on_boundary_2}
+ * \cgalModels{ArrangementIdentifiedHorizontalTraits_2::Compare_x_on_boundary_2}
  * \cgalHasModelsEnd
  */
 class CompareXOnBoundary_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h
index fe5d8a4d5059..9e9e4fe45cde 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h
@@ -4,7 +4,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_x_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementBasicTraits_2::Compare_x_2}
  * \cgalHasModelsEnd
  */
 class CompareX_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h
index f571e844bdbd..7e423c1d5cdc 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_xy_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementBasicTraits_2::Compare_xy_2}
  * \cgalHasModelsEnd
  */
 class CompareXy_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h
index eeb409061462..871add8868c7 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableTernaryFunction}
  *
- * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_left_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementBasicTraits_2::Compare_y_at_x_left_2}
  * \cgalHasModelsEnd
  */
 class CompareYAtXLeft_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h
index 1308a75c5bda..4959f78d530f 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableTernaryFunction}
  *
- * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_right_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementBasicTraits_2::Compare_y_at_x_right_2}
  * \cgalHasModelsEnd
  */
 class CompareYAtXRight_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h
index e1e0d6714418..55ae2fc00faf 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModelsBegin ArrangementBasicTraits_2::Compare_y_at_x_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementBasicTraits_2::Compare_y_at_x_2}
  * \cgalHasModelsEnd
  */
 class CompareYAtX_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h
index df0c66fae012..e2ab7e9cae92 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableTernaryFunction}
  *
- * \cgalHasModelsBegin ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2}
  * \cgalHasModelsEnd
  */
 class CompareYNearBoundary_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h
index 8f5c89d89fef..38a9090fd535 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h
@@ -5,10 +5,11 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModelsBegin ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2
- * \cgalHasModels ArrangementClosedRightTraits_2::Compare_y_on_boundary_2
- * \cgalHasModels ArrangementIdentifiedVerticalTraits_2::Compare_y_on_boundary_2
- * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Compare_y_on_boundary_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2}
+ * \cgalModels{ArrangementClosedRightTraits_2::Compare_y_on_boundary_2}
+ * \cgalModels{ArrangementIdentifiedVerticalTraits_2::Compare_y_on_boundary_2}
+ * \cgalModels{ArrangementSphericalBoundaryTraits_2::Compare_y_on_boundary_2}
  * \cgalHasModelsEnd
  */
 class CompareYOnBoundary_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h
index d6a0c5b1208a..75306891423f 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModelsBegin ArrangementConstructCurveTraits_2::Construct_curve_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementConstructCurveTraits_2::Construct_curve_2}
  * \cgalHasModelsEnd
  */
 class ConstructCurve_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h
index e94c601aa7a6..85b5f9a7fe29 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableUnaryFunction}
  *
- * \cgalHasModelsBegin ArrangementBasicTraits_2::Construct_max_vertex_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementBasicTraits_2::Construct_max_vertex_2}
  * \cgalHasModelsEnd
  */
 class ConstructMaxVertex_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h
index 00a000f41ced..a434876ac15f 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableUnaryFunction}
  *
- * \cgalHasModelsBegin ArrangementBasicTraits_2::Construct_min_vertex_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementBasicTraits_2::Construct_min_vertex_2}
  * \cgalHasModelsEnd
  */
 class ConstructMinVertex_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h
index d25d94e43713..73a5a007b91a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModelsBegin ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2}
  * \cgalHasModelsEnd
  */
 class ConstructXMonotoneCurve_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h
index 3994e674cfb7..6ecf52458326 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h
@@ -6,7 +6,8 @@ namespace ArrTraits {
  * represents a general planar curve.
  *
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
- * \cgalHasModelsBegin ArrangementTraits_2::Curve_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementTraits_2::Curve_2}
  * \cgalHasModelsEnd
  */
 class Curve_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h
index 71c6da87afcc..ca9e3d1a098a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModelsBegin ArrangementBasicTraits_2::Equal_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementBasicTraits_2::Equal_2}
  * \cgalHasModelsEnd
  */
 class Equal_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
index 7a6d7e307390..df17bc89d084 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Intersect_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementXMonotoneTraits_2::Intersect_2}
  * \cgalHasModelsEnd
  */
 class Intersect_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h
index f2850203499e..6ead4d30e3fb 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableUnaryFunction}
  *
- * \cgalHasModelsBegin ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2}
  * \cgalHasModelsEnd
  */
 class IsOnXIdentification_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h
index e07b550923f1..9da39191b062 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableUnaryFunction}
  *
- * \cgalHasModelsBegin ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2}
  * \cgalHasModelsEnd
  */
 class IsOnYIdentification_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h
index e9bbf29d0c8a..1df66d52a0b3 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableUnaryFunction}
  *
- * \cgalHasModelsBegin ArrangementBasicTraits_2::Is_vertical_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementBasicTraits_2::Is_vertical_2}
  * \cgalHasModelsEnd
  */
 class IsVertical_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
index 46d0e1b5baea..2731e990a2fa 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModelsBegin ArrangementTraits_2::Make_x_monotone_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementTraits_2::Make_x_monotone_2}
  * \cgalHasModelsEnd
  */
 class MakeXMonotone_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h
index 17e8573bea21..b2ec195a1484 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h
@@ -5,7 +5,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Merge_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementXMonotoneTraits_2::Merge_2}
  * \cgalHasModelsEnd
  */
 class Merge_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h
index 4e6a66ede1b1..1973f4a5371f 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h
@@ -5,9 +5,10 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModelsBegin ArrangementVerticalSideTraits_2::Parameter_space_in_x_2
- * \cgalHasModels ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_2
- * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Parameter_space_in_x_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementVerticalSideTraits_2::Parameter_space_in_x_2}
+ * \cgalModels{ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_2}
+ * \cgalModels{ArrangementSphericalBoundaryTraits_2::Parameter_space_in_x_2}
  * \cgalHasModelsEnd
  */
 class ParameterSpaceInX_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h
index e443f0498da4..19dae4f4cde1 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h
@@ -5,9 +5,10 @@ namespace ArrTraits {
  *
  * \cgalRefines{AdaptableBinaryFunction}
  *
- * \cgalHasModelsBegin ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2
- * \cgalHasModels ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_2
- * \cgalHasModels ArrangementSphericalBoundaryTraits_2::Parameter_space_in_y_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2}
+ * \cgalModels{ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_2}
+ * \cgalModels{ArrangementSphericalBoundaryTraits_2::Parameter_space_in_y_2}
  * \cgalHasModelsEnd
  */
 class ParameterSpaceInY_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h
index 182f0a059bad..cc53c3b9467d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h
@@ -7,7 +7,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
  *
- * \cgalHasModelsBegin ArrangementBasicTraits_2::Point_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementBasicTraits_2::Point_2}
  * \cgalHasModelsEnd
  */
 class Point_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h
index ff6bcb382cbf..71519a41aea9 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h
@@ -4,7 +4,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{Functor}
  *
- * \cgalHasModelsBegin ArrangementXMonotoneTraits_2::Split_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementXMonotoneTraits_2::Split_2}
  * \cgalHasModelsEnd
  */
 class Split_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h
index f74e74bf150d..cf004f92dd04 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h
@@ -6,7 +6,8 @@ namespace ArrTraits {
  *
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
  *
- * \cgalHasModelsBegin ArrangementBasicTraits_2::X_monotone_curve_2
+ * \cgalHasModelsBegin
+ * \cgalModels{ArrangementBasicTraits_2::X_monotone_curve_2}
  * \cgalHasModelsEnd
  */
 class XMonotoneCurve_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h
index b4720036574e..a6940b050c1a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h
@@ -8,14 +8,15 @@ point.
 
 \cgalRefines{ArrangementBasicTraits_2}
 
-\cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
-\cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
-\cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_polycurve_traits_2<GeometryTraits_2>
-\cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
-\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
+\cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_polycurve_traits_2<GeometryTraits_2>}
+\cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
+\cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
 \cgalHasModelsEnd
 
 \sa `ArrangementConstructXMonotoneCurveTraits_2`,
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h
index 3e8c60735722..6edbb7820d6d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h
@@ -9,7 +9,8 @@
  * represent the arrangement cells (i.e., vertices, edges, and facets) and the
  * incident relations between them.
  *
- * \cgalHasModelsBegin CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2, Dcel>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2, Dcel>}
  * \cgalHasModelsEnd
  */
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h
index e521ef28b065..530aac71c9c5 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h
@@ -27,21 +27,22 @@
  *
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
  *
- * \cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_non_caching_segment_basic_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits>
- * \cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_line_arc_traits_2<CircularKernel>
- * \cgalHasModels CGAL::Arr_circular_arc_traits_2<CircularKernel>
- * \cgalHasModels CGAL::Arr_circular_line_arc_traits_2<CircularKernel>
- * \cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
- * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
- * \cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
- * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
- * \cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
- * \cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_non_caching_segment_basic_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits>}
+ * \cgalModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_line_arc_traits_2<CircularKernel>}
+ * \cgalModels{CGAL::Arr_circular_arc_traits_2<CircularKernel>}
+ * \cgalModels{CGAL::Arr_circular_line_arc_traits_2<CircularKernel>}
+ * \cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+ * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+ * \cgalModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
+ * \cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+ * \cgalModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
+ * \cgalModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
  * \cgalHasModelsEnd
  */
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h
index 176810a0793e..c0f8193d057a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h
@@ -7,13 +7,14 @@
  *
  * \cgalRefines{ArrangementTraits_2}
  *
- * \cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
- * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
- * \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
- * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+ * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
+ * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
+ * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementConstructXMonotoneCurveTraits_2`, and
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h
index 99ca431cd467..7bfebe4906f7 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h
@@ -7,13 +7,14 @@
  *
  * \cgalRefines{ArrangementBasicTraits_2}
  *
- * \cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
- * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
- * \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
- * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+ * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
+ * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
+ * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementApproximateTraits_2`,
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h
index 81984c4699eb..b750989c9ffe 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h
@@ -14,10 +14,11 @@
  * `ArrangementDcelHalfedge`, `ArrangementDcelFace`, `ArrangementDcelOuterCcb`,
  * `ArrangementDcelInnerCcb`, and `ArrangementDcelIsolatedVertex` respectively.)
  *
- * \cgalHasModelsBegin CGAL::Arr_dcel_base<V,H,F>
- * \cgalHasModels CGAL::Arr_default_dcel<Traits>
- * \cgalHasModels CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>
- * \cgalHasModels CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_dcel_base<V,H,F>}
+ * \cgalModels{CGAL::Arr_default_dcel<Traits>}
+ * \cgalModels{CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>}
+ * \cgalModels{CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementDcelVertex`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
index d4f263cf01f1..c3d607c6e98e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
@@ -10,9 +10,10 @@ Instantiate a dcel class with many different possible types without ad-hoc limit
 
 \cgalRefines{ArrangementDcel}
 
-\cgalHasModelsBegin CGAL::Arr_default_dcel<Traits>
-\cgalHasModels CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>
-\cgalHasModels CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Arr_default_dcel<Traits>}
+\cgalModels{CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>}
+\cgalModels{CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>}
 \cgalHasModelsEnd
 
 */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h
index 60e28710d01a..8dfbfb227075 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h
@@ -11,10 +11,11 @@
  *
  * \cgalRefines{ArrangementBasicTraits_2}
  *
- * \cgalHasModelsBegin CGAL::Arr_linear_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
- * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
- * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+ * \cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+ * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementVerticalSideTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h
index 53469ded7bd2..07c14685f6e9 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h
@@ -5,9 +5,10 @@
  * functions that enable reading an arrangement from an input stream using a
  * specific format.
  *
- * \cgalHasModelsBegin CGAL::Arr_text_formatter<Arrangement>
- * \cgalHasModels CGAL::Arr_face_extended_text_formatter<Arrangement>
- * \cgalHasModels CGAL::Arr_extended_dcel_text_formatter<Arrangement>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_text_formatter<Arrangement>}
+ * \cgalModels{CGAL::Arr_face_extended_text_formatter<Arrangement>}
+ * \cgalModels{CGAL::Arr_extended_dcel_text_formatter<Arrangement>}
  * \cgalHasModelsEnd
  *
  */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
index b014807650ae..79624fa82380 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
@@ -11,14 +11,15 @@
  *
  * \cgalRefines{ArrangementApproximateTraits_2,ArrangementConstructXMonotoneCurveTraits_2}
  *
- * \cgalHasModelsBegin CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
- * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2
- * \cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_segment_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_polycurve_traits_2<GeometryTraits_2>
- * \cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits_2>
- * \cgalHasModels CGAL::Arr_rational_function_traits_2
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+ * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
+ * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_polycurve_traits_2<GeometryTraits_2>}
+ * \cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
+ * \cgalModels{CGAL::Arr_rational_function_traits_2}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementXMonotoneTraits_2` and
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h
index 16f3ffa51951..3bf6b089be6f 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h
@@ -39,11 +39,12 @@
  *
  * \cgalRefines{ArrangementBasicTraits_2}
  *
- * \cgalHasModelsBegin CGAL::Arr_linear_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
- * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
- * \cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
- * \cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+ * \cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+ * \cgalModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
+ * \cgalModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementBasicTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h
index bee9cba77204..eb6c67a142b5 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h
@@ -6,9 +6,10 @@
 A model for the `ArrangementOutputFormatter` concept supports a set of functions that enable
 writing an arrangement to an output stream using a specific format.
 
-\cgalHasModelsBegin CGAL::Arr_text_formatter<Arrangement>
-\cgalHasModels CGAL::Arr_face_extended_text_formatter<Arrangement>
-\cgalHasModels CGAL::Arr_extended_dcel_text_formatter<Arrangement>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Arr_text_formatter<Arrangement>}
+\cgalModels{CGAL::Arr_face_extended_text_formatter<Arrangement>}
+\cgalModels{CGAL::Arr_extended_dcel_text_formatter<Arrangement>}
 \cgalHasModelsEnd
 
 */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
index 31e4bf302320..782af5d25cd5 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
@@ -20,10 +20,11 @@ the old style without any overhead, the macro
 `CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any
 \cgal header is included.
 
-\cgalHasModelsBegin CGAL::Arr_naive_point_location<Arrangement>
-\cgalHasModels CGAL::Arr_walk_along_line_point_location<Arrangement>
-\cgalHasModels CGAL::Arr_trapezoid_ric_point_location<Arrangement>
-\cgalHasModels CGAL::Arr_landmarks_point_location<Arrangement,Generator>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Arr_naive_point_location<Arrangement>}
+\cgalModels{CGAL::Arr_walk_along_line_point_location<Arrangement>}
+\cgalModels{CGAL::Arr_trapezoid_ric_point_location<Arrangement>}
+\cgalModels{CGAL::Arr_landmarks_point_location<Arrangement,Generator>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Arr_naive_point_location<Arrangement>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h
index fe9137b5696a..2c2d0ad0208d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h
@@ -11,7 +11,8 @@
  * \cgalRefines{ArrangementBasicTraits_2,ArrangementIdentifiedVerticalTraits_2,
  *   ArrangementContractedBottomTraits_2,ArrangementContractedTopTraits_2}
  *
- * \cgalHasModelsBegin CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementOpenBoundaryTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h
index 80660fcda14d..defff744a976 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h
@@ -20,9 +20,10 @@
  *
  * At this point we do not expose all the requirements of this concept.
  *
- * \cgalHasModelsBegin CGAL::Arr_bounded_planar_topology_traits_2<GeometryTraits_2,Dcel>
- * \cgalHasModels CGAL::Arr_unb_planar_topology_traits_2<GeometryTraits_2,Dcel>
- * \cgalHasModels CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2,Dcel>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_bounded_planar_topology_traits_2<GeometryTraits_2,Dcel>}
+ * \cgalModels{CGAL::Arr_unb_planar_topology_traits_2<GeometryTraits_2,Dcel>}
+ * \cgalModels{CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2,Dcel>}
  * \cgalHasModelsEnd
  *
  * \sa `Arrangement_on_surface_2<GeometryTraits_2,TopologyTraits>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h
index e9bca5d3dc96..897ede7f25a3 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h
@@ -30,20 +30,21 @@ that accept such curves, such as `intsert()`.
 
 \cgalRefines{ArrangementXMonotoneTraits_2}
 
-\cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits>
-\cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_line_arc_traits_2<CircularKernel>
-\cgalHasModels CGAL::Arr_circular_arc_traits_2<CircularKernel>
-\cgalHasModels CGAL::Arr_circular_line_arc_traits_2<CircularKernel>
-\cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
-\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
-\cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
-\cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
-\cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
-\cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits>}
+\cgalModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_line_arc_traits_2<CircularKernel>}
+\cgalModels{CGAL::Arr_circular_arc_traits_2<CircularKernel>}
+\cgalModels{CGAL::Arr_circular_line_arc_traits_2<CircularKernel>}
+\cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+\cgalModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+\cgalModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
+\cgalModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
 \cgalHasModelsEnd
 
 \sa `ArrangementBasicTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
index eb1b893f460e..0b7c89be1586 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
@@ -28,10 +28,11 @@ is recommended. To enable the old style without any overhead, the macro
 `CGAL_ARR_POINT_LOCATION_VERSION` can be defined to 1 before any
 \cgal header is included.
 
-\cgalHasModelsBegin CGAL::Arr_naive_point_location<Arrangement>
-\cgalHasModels CGAL::Arr_walk_along_line_point_location<Arrangement>
-\cgalHasModels CGAL::Arr_trapezoid_ric_point_location<Arrangement>
-\cgalHasModels CGAL::Arr_landmarks_point_location<Arrangement,Generator>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Arr_naive_point_location<Arrangement>}
+\cgalModels{CGAL::Arr_walk_along_line_point_location<Arrangement>}
+\cgalModels{CGAL::Arr_trapezoid_ric_point_location<Arrangement>}
+\cgalModels{CGAL::Arr_landmarks_point_location<Arrangement,Generator>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Arr_naive_point_location<Arrangement>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h
index e12fda8a889f..2b9d1c9f6c16 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h
@@ -11,10 +11,11 @@
  *
  * \cgalRefines{ArrangementBasicTraits_2}
  *
- * \cgalHasModelsBegin CGAL::Arr_linear_traits_2<Kernel>
- * \cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
- * \cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
- * \cgalHasModels CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+ * \cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+ * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementVerticalSideTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h
index 4b31986adfb5..601725e3c065 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h
@@ -9,7 +9,8 @@ specific format.
 
 \cgalRefines{ArrangementInputFormatter}
 
-\cgalHasModelsBegin CGAL::Arr_with_history_text_formatter<ArrFormatter>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Arr_with_history_text_formatter<ArrFormatter>}
 \cgalHasModelsEnd
 
 */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h
index 8ff0dc5eda48..287a3a9f7ebd 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h
@@ -9,7 +9,8 @@ specific format.
 
 \cgalRefines{ArrangementOutputFormatter}
 
-\cgalHasModelsBegin CGAL::Arr_with_history_text_formatter<ArrFormatter>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Arr_with_history_text_formatter<ArrFormatter>}
 \cgalHasModelsEnd
 
 */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h
index 99e34f2ae6d1..32e49f947dcd 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h
@@ -18,20 +18,21 @@ curve splitting.
 
 \cgalRefines{ArrangementBasicTraits_2}
 
-\cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_linear_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_polyline_traits_2<SegmentTraits>
-\cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_line_arc_traits_2<CircularKernel>
-\cgalHasModels CGAL::Arr_circular_arc_traits_2<CircularKernel>
-\cgalHasModels CGAL::Arr_circular_line_arc_traits_2<CircularKernel>
-\cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
-\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>
-\cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
-\cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
-\cgalHasModels CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>
-\cgalHasModels CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits>}
+\cgalModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_line_arc_traits_2<CircularKernel>}
+\cgalModels{CGAL::Arr_circular_arc_traits_2<CircularKernel>}
+\cgalModels{CGAL::Arr_circular_line_arc_traits_2<CircularKernel>}
+\cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+\cgalModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+\cgalModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
+\cgalModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
 \cgalHasModelsEnd
 
 \sa `ArrangementBasicTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h
index 2a90dfee44dc..678d26425c4d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h
@@ -11,8 +11,9 @@ Models for the concept are used by the global `overlay()` function to
 maintain the auxiliary data stored with the \dcel records of the resulting
 overlaid arrangement, based on the contents of the input records.
 
-\cgalHasModelsBegin CGAL::Arr_default_overlay_traits<Arrangement>
-\cgalHasModels CGAL::Arr_face_overlay_traits<Arr1,Arr2,ResArr,OvlFaceData>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Arr_default_overlay_traits<Arrangement>}
+\cgalModels{CGAL::Arr_face_overlay_traits<Arr1,Arr2,ResArr,OvlFaceData>}
 \cgalHasModelsEnd
 
 \sa `overlay`
diff --git a/BGL/doc/BGL/Concepts/EdgeListGraph.h b/BGL/doc/BGL/Concepts/EdgeListGraph.h
index 93b23b76748a..f1a0412db76c 100644
--- a/BGL/doc/BGL/Concepts/EdgeListGraph.h
+++ b/BGL/doc/BGL/Concepts/EdgeListGraph.h
@@ -11,7 +11,9 @@ and adds the requirement for traversal of all edges in a graph.
 
 \cgalRefines{<a href="https://www.boost.org/libs/graph/doc/Graph.html">Graph</a>}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
+\cgalHasModelsEnd
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/FaceGraph.h b/BGL/doc/BGL/Concepts/FaceGraph.h
index a8b8bbe18935..0320f5b7b76f 100644
--- a/BGL/doc/BGL/Concepts/FaceGraph.h
+++ b/BGL/doc/BGL/Concepts/FaceGraph.h
@@ -20,7 +20,9 @@ A face descriptor must be `DefaultConstructible`, `Assignable`, `EqualityCompara
 
 \cgalRefines{HalfedgeGraph}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
+\cgalHasModelsEnd
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/FaceListGraph.h b/BGL/doc/BGL/Concepts/FaceListGraph.h
index 046015b67d2f..40339f34e8f4 100644
--- a/BGL/doc/BGL/Concepts/FaceListGraph.h
+++ b/BGL/doc/BGL/Concepts/FaceListGraph.h
@@ -16,7 +16,9 @@ face iterator must be the same as the face descriptor of the graph.
 
 \cgalRefines{FaceGraph}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
+\cgalHasModelsEnd
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/HalfedgeGraph.h b/BGL/doc/BGL/Concepts/HalfedgeGraph.h
index 7be2d2220d71..15600e021759 100644
--- a/BGL/doc/BGL/Concepts/HalfedgeGraph.h
+++ b/BGL/doc/BGL/Concepts/HalfedgeGraph.h
@@ -38,7 +38,9 @@ An edge descriptor must be `DefaultConstructible`, `Assignable`, `EqualityCompar
 
 A model of `HalfedgeGraph` must have the interior property `vertex_point` attached to its vertices.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
+\cgalHasModelsEnd
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/HalfedgeListGraph.h b/BGL/doc/BGL/Concepts/HalfedgeListGraph.h
index c5f8eeff6898..a709aadaa8be 100644
--- a/BGL/doc/BGL/Concepts/HalfedgeListGraph.h
+++ b/BGL/doc/BGL/Concepts/HalfedgeListGraph.h
@@ -16,7 +16,9 @@ halfedge iterator must be the same as the halfedge descriptor of the graph.
 
 \cgalRefines{HalfedgeGraph}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
+\cgalHasModelsEnd
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/MutableFaceGraph.h b/BGL/doc/BGL/Concepts/MutableFaceGraph.h
index 1f0f86c6a863..f47bf7de8163 100644
--- a/BGL/doc/BGL/Concepts/MutableFaceGraph.h
+++ b/BGL/doc/BGL/Concepts/MutableFaceGraph.h
@@ -7,7 +7,9 @@ the requirement for operations to add faces and to modify face-halfedge relation
 
 \cgalRefines{FaceGraph,MutableHalfedgeGraph}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
+\cgalHasModelsEnd
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h b/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h
index 86bd650fc867..c5d8c66ec568 100644
--- a/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h
+++ b/BGL/doc/BGL/Concepts/MutableHalfedgeGraph.h
@@ -8,7 +8,9 @@ update the incidence information between vertices and halfedges.
 
 \cgalRefines{HalfedgeGraph}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
+\cgalHasModelsEnd
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/BGL/doc/BGL/Concepts/VertexListGraph.h b/BGL/doc/BGL/Concepts/VertexListGraph.h
index 009fe00dac1b..f6e65cf72000 100644
--- a/BGL/doc/BGL/Concepts/VertexListGraph.h
+++ b/BGL/doc/BGL/Concepts/VertexListGraph.h
@@ -11,7 +11,9 @@ and adds the requirement for traversal of all vertices in a graph.
 
 \cgalRefines{<a href="https://www.boost.org/libs/graph/doc/Graph.html">Graph</a>}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{See \link PkgBGLTraits Boost Graph Traits Specializations \endlink}
+\cgalHasModelsEnd
 
 \sa \link PkgBGLConcepts Graph Concepts \endlink
 */
diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
index 9fd9c19943b5..35818aa505d6 100644
--- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
+++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
@@ -8,9 +8,10 @@ namespace Barycentric_coordinates {
 A concept that describes the set of methods that should be defined for all coordinate
 models used to parameterize the class `Generalized_barycentric_coordinates_2`.
 
-\cgalHasModelsBegin Wachspress_2
-\cgalHasModels Mean_value_2
-\cgalHasModels Discrete_harmonic_2
+\cgalHasModelsBegin
+\cgalModels{Wachspress_2}
+\cgalModels{Mean_value_2}
+\cgalModels{Discrete_harmonic_2}
 \cgalHasModelsEnd
 
 \deprecated This part of the package is deprecated since the version 5.4 of \cgal.
diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h
index bf07127b14db..6fb0823a7446 100644
--- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h
+++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h
@@ -9,10 +9,12 @@ A concept that describes the set of requirements of the template parameter
 `GeomTraits` used to parameterize all classes and functions with 2D barycentric
 coordinates from the namespace `CGAL::Barycentric_coordinates`.
 
-\cgalHasModelsBareBegin{All models of `Kernel`} CGAL::Projection_traits_3<K>
-\cgalHasModels CGAL::Projection_traits_xy_3<K>
-\cgalHasModels CGAL::Projection_traits_yz_3<K>
-\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of `Kernel`}
+\cgalHasModels{CGAL::Projection_traits_3<K>}
+\cgalHasModels{CGAL::Projection_traits_xy_3<K>}
+\cgalHasModels{CGAL::Projection_traits_yz_3<K>}
+\cgalHasModels{CGAL::Projection_traits_xz_3<K>}
 \cgalHasModelsEnd
 */
 class BarycentricTraits_2 {
diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h
index 9ace050c0d8b..b1613da6b02c 100644
--- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h
+++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h
@@ -13,7 +13,8 @@ elements, which share common edges and vertices. These finite elements are then
 used to approximate certain types of generalized barycentric coordinate functions.
 The domain is bounded by the polygon.
 
-\cgalHasModelsBegin Delaunay_domain_2
+\cgalHasModelsBegin
+\cgalModels{Delaunay_domain_2}
 \cgalHasModelsEnd
 */
 class DiscretizedDomain_2 {
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h
index 409316c5a4e6..bc3fa2117d32 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h
@@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableBinaryFunction}
 
-\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2
+\cgalHasModelsBegin
+\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h
index f4fcfa096e92..a2e684be6263 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h
@@ -6,7 +6,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableUnaryFunction}
 
-\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2
+\cgalHasModelsBegin
+\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h
index 719878346a5c..bac19b870721 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h
@@ -6,7 +6,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableUnaryFunction}
 
-\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2
+\cgalHasModelsBegin
+\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
index 1e98facf71d9..f82f215155a4 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
@@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableBinaryFunction}
 
-\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Intersect_2
+\cgalHasModelsBegin
+\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Intersect_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h
index 2064a3ba0797..a2b89befdec1 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h
@@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableBinaryFunction}
 
-\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Merge_2
+\cgalHasModelsBegin
+\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Merge_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h
index 91f8903728c8..7bca25154fd4 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h
@@ -5,7 +5,8 @@ namespace ArrDirectionalTraits {
 
 \cgalRefines{AdaptableUnaryFunction}
 
-\cgalHasModelsBegin ArrangementDirectionalXMonotoneTraits_2::Split_2
+\cgalHasModelsBegin
+\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Split_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h
index 6b66a66997bb..15aaffd07888 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h
@@ -16,13 +16,14 @@ as its <I>source</I> and the other as its <I>target</I>.
 
 \cgalRefines{ArrangementXMonotoneTraits_2}
 
-\cgalHasModelsBegin CGAL::Arr_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_non_caching_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_circle_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>
-\cgalHasModels CGAL::Arr_rational_function_traits_2<AlgKernel,NtTraits>
-\cgalHasModels CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>
-\cgalHasModels CGAL::Arr_algebraic_segment_traits_2<Coefficient>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalModels{CGAL::Arr_rational_function_traits_2<AlgKernel,NtTraits>}
+\cgalModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
 \cgalHasModelsEnd
 
 \sa `ArrangementXMonotoneTraits_2`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h
index 9264a822bff7..3151c6eb0746 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h
@@ -16,7 +16,8 @@ respectively
 
 \cgalRefines{ArrangementDcel}
 
-\cgalHasModelsBegin CGAL::Gps_default_dcel<Traits>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Gps_default_dcel<Traits>}
 \cgalHasModelsEnd
 
 \sa `GeneralPolygonSetDcelFace`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h
index 029f24e7b3f0..123f3b883cfb 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h
@@ -9,7 +9,8 @@ to represent the underlying internal `Arrangement_2` data structure.
 
 \cgalRefines{ArrangementDcelFace}
 
-\cgalHasModelsBegin CGAL::Gps_face_base
+\cgalHasModelsBegin
+\cgalModels{CGAL::Gps_face_base}
 \cgalHasModelsEnd
 
 \sa `ArrangementDcel`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h
index 900f52372298..3f254f685a28 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h
@@ -8,7 +8,8 @@ to represent the underlying internal `Arrangement_2` data structure.
 
 \cgalRefines{ArrangementDcelHalfedge}
 
-\cgalHasModelsBegin CGAL::Gps_face_halfedge
+\cgalHasModelsBegin
+\cgalModels{CGAL::Gps_face_halfedge}
 \cgalHasModelsEnd
 
 \sa `ArrangementDcel`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h
index 5271a7807440..bd1afb8ed78e 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h
@@ -13,9 +13,10 @@ types.
 
 \cgalRefines{ArrangementDirectionalXMonotoneTraits_2}
 
-\cgalHasModelsBegin CGAL::Gps_segment_traits_2<Kernel,Container,ArrSegmentTraits>
-\cgalHasModels CGAL::Gps_circle_segment_traits_2<Kernel>
-\cgalHasModels CGAL::Gps_traits_2<ArrTraits,GeneralPolygon>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Gps_segment_traits_2<Kernel,Container,ArrSegmentTraits>}
+\cgalModels{CGAL::Gps_circle_segment_traits_2<Kernel>}
+\cgalModels{CGAL::Gps_traits_2<ArrTraits,GeneralPolygon>}
 \cgalHasModelsEnd
 
 \sa `ArrangementDirectionalXMonotoneTraits_2`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h
index d9103ae6839a..b9e255935261 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h
@@ -16,7 +16,8 @@ accordingly. Only counterclockwise oriented polygons are valid operands
 of Boolean set-operations. General polygon that represent holes must be
 clockwise oriented.
 
-\cgalHasModelsBegin CGAL::General_polygon_2<ArrTraits>
+\cgalHasModelsBegin
+\cgalModels{CGAL::General_polygon_2<ArrTraits>}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h
index c9d62f6cef64..2515be1d0e7f 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h
@@ -9,7 +9,8 @@ A model of this concept represents a general polygon with holes.
 
 \cgalGeneralizes `GeneralPolygonWithHoles_2`
 
-\cgalHasModelsBegin GeneralPolygonSetTraits_2::Polygon_with_holes2
+\cgalHasModelsBegin
+\cgalModels{GeneralPolygonSetTraits_2::Polygon_with_holes2}
 \cgalHasModelsEnd
 
 \sa `GeneralPolygonWithHoles_2`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h
index a9999735b0e7..dc6486a1a31c 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h
@@ -9,8 +9,9 @@ A model of this concept represents a simple general polygon.
 
 \cgalGeneralizes `GeneralPolygon_2`
 
-\cgalHasModelsBegin GeneralPolygonSetTraits_2::Polygon_2
-\cgalHasModels CGAL::Polygon_2<PolygonTraits_2, Container>
+\cgalHasModelsBegin
+\cgalModels{GeneralPolygonSetTraits_2::Polygon_2}
+\cgalModels{CGAL::Polygon_2<PolygonTraits_2, Container>}
 \cgalHasModelsEnd
 
 \sa `GeneralPolygon_2`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h
index 05721090917e..0ce3d2249b9f 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h
@@ -8,9 +8,10 @@ This concept defines the requirements for traits classes of
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Approximate_min_ellipsoid_d_traits_2<K,ET>
-\cgalHasModels CGAL::Approximate_min_ellipsoid_d_traits_3<K,ET>
-\cgalHasModels CGAL::Approximate_min_ellipsoid_d_traits_d<K,ET>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Approximate_min_ellipsoid_d_traits_2<K,ET>}
+\cgalModels{CGAL::Approximate_min_ellipsoid_d_traits_3<K,ET>}
+\cgalModels{CGAL::Approximate_min_ellipsoid_d_traits_d<K,ET>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Min_ellipse_2<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h
index 71cb832881ed..3e25f230aebf 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h
@@ -6,7 +6,8 @@
 This concept defines the requirements for traits classes of
 `CGAL::Min_circle_2<Traits>`.
 
-\cgalHasModelsBegin CGAL::Min_circle_2_traits_2<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Min_circle_2_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Min_circle_2<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h
index d6cfac02a1fb..853c32438132 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h
@@ -6,7 +6,8 @@
 This concept defines the requirements for traits classes of
 `CGAL::Min_ellipse_2<Traits>`.
 
-\cgalHasModelsBegin CGAL::Min_ellipse_2_traits_2<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Min_ellipse_2_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Min_ellipse_2<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h
index 17da54b77741..592d52d69d9c 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h
@@ -8,7 +8,8 @@ needed to compute minimum enclosing quadrilaterals of a planar point
 set using the functions `min_rectangle_2()`,
 `min_parallelogram_2()` and `min_strip_2()`.
 
-\cgalHasModelsBegin CGAL::Min_quadrilateral_default_traits_2<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Min_quadrilateral_default_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::min_rectangle_2()`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h
index ddd404f13c6b..0d812dd559b0 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h
@@ -6,9 +6,10 @@
 This concept defines the requirements for traits classes of \f$ d\f$-dimensional
 min sphere and min annulus algorithms.
 
-\cgalHasModelsBegin CGAL::Min_sphere_annulus_d_traits_2<K,ET,NT>
-\cgalHasModels CGAL::Min_sphere_annulus_d_traits_3<K,ET,NT>
-\cgalHasModels CGAL::Min_sphere_annulus_d_traits_d<K,ET,NT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Min_sphere_annulus_d_traits_2<K,ET,NT>}
+\cgalModels{CGAL::Min_sphere_annulus_d_traits_3<K,ET,NT>}
+\cgalModels{CGAL::Min_sphere_annulus_d_traits_d<K,ET,NT>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Min_sphere_d<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
index 345beddeb9cf..2e19511b8103 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
@@ -6,12 +6,13 @@
 A model of concept `MinSphereOfSpheresTraits` must provide the
 following constants, types, predicates and operations.
 
-\cgalHasModelsBegin CGAL::Min_sphere_of_spheres_d_traits_2<K,FT,UseSqrt,Algorithm>
-\cgalHasModels CGAL::Min_sphere_of_spheres_d_traits_3<K,FT,UseSqrt,Algorithm>
-\cgalHasModels CGAL::Min_sphere_of_spheres_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>
-\cgalHasModels CGAL::Min_sphere_of_points_d_traits_2<K,FT,UseSqrt,Algorithm>
-\cgalHasModels CGAL::Min_sphere_of_points_d_traits_3<K,FT,UseSqrt,Algorithm>
-\cgalHasModels CGAL::Min_sphere_of_points_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Min_sphere_of_spheres_d_traits_2<K,FT,UseSqrt,Algorithm>}
+\cgalModels{CGAL::Min_sphere_of_spheres_d_traits_3<K,FT,UseSqrt,Algorithm>}
+\cgalModels{CGAL::Min_sphere_of_spheres_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>}
+\cgalModels{CGAL::Min_sphere_of_points_d_traits_2<K,FT,UseSqrt,Algorithm>}
+\cgalModels{CGAL::Min_sphere_of_points_d_traits_3<K,FT,UseSqrt,Algorithm>}
+\cgalModels{CGAL::Min_sphere_of_points_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>}
 \cgalHasModelsEnd
 */
 
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h
index 2c9c9ba44d50..b72e77f91d34 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h
@@ -7,7 +7,8 @@ The concept `RectangularPCenterTraits_2` defines types and operations
 needed to compute rectilinear \f$ p\f$-centers of a planar point set
 using the function `CGAL::rectangular_p_center_2()`.
 
-\cgalHasModelsBegin CGAL::Rectangular_p_center_default_traits_2<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Rectangular_p_center_default_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::rectangular_p_center_2()`
diff --git a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h
index 594f4c94ebb9..d41ffd3d8425 100644
--- a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h
@@ -10,8 +10,9 @@ the dimension, the `id`-number, and the boundaries of the box.
 
 \cgalRefines{Assignable}
 
-\cgalHasModelsBegin CGAL::Box_intersection_d::Box_d
-\cgalHasModels CGAL::Box_intersection_d::Box_with_handle_d
+\cgalHasModelsBegin
+\cgalModels{CGAL::Box_intersection_d::Box_d}
+\cgalModels{CGAL::Box_intersection_d::Box_with_handle_d}
 \cgalHasModelsEnd
 
 \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
diff --git a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h
index cf6dfcb546dc..98cb8e4a34f9 100644
--- a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h
@@ -9,7 +9,8 @@ the boxes manipulated in these algorithms.
 
 \cgalRefines{Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Box_intersection_d::Box_traits_d
+\cgalHasModelsBegin
+\cgalModels{CGAL::Box_intersection_d::Box_traits_d}
 \cgalHasModelsEnd
 
 \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h
index f5a18c372206..05175484ac24 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h
@@ -11,7 +11,8 @@ are of a type that is a model of the concept
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Polynomial_for_circles_2_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polynomial_for_circles_2_2}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForCircles`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h
index b01eedc5a49c..ee376204999c 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h
@@ -9,7 +9,8 @@ coefficients are of a type that is a model of the concept
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Polynomial_1_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polynomial_1_2}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForCircles`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h
index d17715759643..13cdb5119351 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h
@@ -7,7 +7,8 @@ Concept to represent the roots of a system of two equations of degree 2
 in two variables `x` and `y` that are models of concept
 `AlgebraicKernelForCircles::PolynomialForCircles_2_2`
 
-\cgalHasModelsBegin CGAL::Root_for_circles_2_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Root_for_circles_2_2}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForCircles`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h
index e0d50ab1b572..9b259e047c3c 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h
@@ -7,7 +7,8 @@ The `AlgebraicKernelForCircles` concept is meant to provide the
 curved kernel with all the algebraic functionalities required for the
 manipulation of circular arcs.
 
-\cgalHasModelsBegin CGAL::Algebraic_kernel_for_circles_2_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Algebraic_kernel_for_circles_2_2}
 \cgalHasModelsEnd
 
 \sa `CircularKernel`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h
index 603867502f9f..82cf9487e871 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h
@@ -7,7 +7,8 @@ Concept for points on circles, circular arcs or line arcs.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Circular_arc_point_2<CircularKernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Circular_arc_point_2<CircularKernel>}
 \cgalHasModelsEnd
 */
 class CircularKernel::CircularArcPoint_2 {
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h
index bd5586d0035c..d5833dfa55d1 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h
@@ -7,7 +7,8 @@ Concept for arcs of circles.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Circular_arc_2<CircularKernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Circular_arc_2<CircularKernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h
index 7f82890c16ae..e92230b10a02 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h
@@ -9,7 +9,8 @@ Concept for line segments supported by a line that is a model of
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Line_arc_2<CircularKernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Line_arc_2<CircularKernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h
index a151ed891918..d5c912468c6f 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h
@@ -5,8 +5,9 @@
 
 \cgalRefines{Kernel}
 
-\cgalHasModelsBegin CGAL::Circular_kernel_2<Kernel,AlgebraicKernelForCircles>
-\cgalHasModels CGAL::Exact_circular_kernel_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Circular_kernel_2<Kernel,AlgebraicKernelForCircles>}
+\cgalModels{CGAL::Exact_circular_kernel_2}
 \cgalHasModelsEnd
 
 \sa `Kernel`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h
index 0dbd299b9cd7..70aa9278d6b7 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h
@@ -11,7 +11,8 @@ are of a type that is a model of the concept
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin GAL::Polynomial_for_spheres_2_
+\cgalHasModelsBegin
+\cgalModels{GAL::Polynomial_for_spheres_2_}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h
index 8cf947c04bae..6423e3805a0b 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h
@@ -9,7 +9,8 @@ coefficients are of a type that is a model of the concept
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Polynomial_1_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polynomial_1_3}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h
index 70866c01e37d..99d40b5860a0 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h
@@ -8,7 +8,8 @@ capable of storing equations of lines.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Polynomials_for_lines_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polynomials_for_lines_3}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h
index 2754b94e0913..cb25b3d6244f 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h
@@ -7,7 +7,8 @@ Concept to represent the roots of a system of three equations of degree 2
 in three variables `x`, `y` and `z` that are models of concept
 `AlgebraicKernelForSpheres::PolynomialForSpheres_2_3`.
 
-\cgalHasModelsBegin CGAL::Root_for_spheres_2_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Root_for_spheres_2_3}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h
index e83eca8300dd..585101b73df1 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h
@@ -7,7 +7,8 @@ The `AlgebraicKernelForSpheres` concept is meant to provide the
 curved kernel with all the algebraic functionalities required for the
 manipulation of spheres, circles, and circular arcs in 3D.
 
-\cgalHasModelsBegin CGAL::Algebraic_kernel_for_spheres_2_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Algebraic_kernel_for_spheres_2_3}
 \cgalHasModelsEnd
 
 \sa `SphericalKernel`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h
index 81128f2844ee..8c932d227124 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h
@@ -7,7 +7,8 @@ Concept for points on spheres, circles, circular arcs or line arcs.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Circular_arc_point_3<SphericalKernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Circular_arc_point_3<SphericalKernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h
index 5a8498f28243..644a50773840 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h
@@ -7,7 +7,8 @@ Concept for arcs of circles.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Circular_arc_3<SphericalKernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Circular_arc_3<SphericalKernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h
index 07946ba0f146..ca26700179f0 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h
@@ -9,7 +9,8 @@ Concept for line segments supported by a line that is a model of
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Line_arc_3<SphericalKernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Line_arc_3<SphericalKernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h
index 3bafc8659d0b..22b389149611 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h
@@ -5,8 +5,9 @@
 
 \cgalRefines{Kernel}
 
-\cgalHasModelsBegin CGAL::Spherical_kernel_3<Kernel,AlgebraicKernelForSpheres>
-\cgalHasModels CGAL::Exact_spherical_kernel_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Spherical_kernel_3<Kernel,AlgebraicKernelForSpheres>}
+\cgalModels{CGAL::Exact_spherical_kernel_3}
 \cgalHasModelsEnd
 
 \sa `Kernel`
diff --git a/Circulator/doc/Circulator/Concepts/ConstHandle.h b/Circulator/doc/Circulator/Concepts/ConstHandle.h
index 9ff3bea6b33d..b15f9c6fd0c0 100644
--- a/Circulator/doc/Circulator/Concepts/ConstHandle.h
+++ b/Circulator/doc/Circulator/Concepts/ConstHandle.h
@@ -7,7 +7,8 @@ A constant handle. Refer to the `Handle` concept for more details.
 
 \cgalRefines{Descriptor}
 
-\cgalHasModelsBegin const T* (const pointers)
+\cgalHasModelsBegin
+\cgalModels{const T* (const pointers)}
 \cgalHasModelsEnd
 
 \sa `Handle`
diff --git a/Circulator/doc/Circulator/Concepts/ConstRange.h b/Circulator/doc/Circulator/Concepts/ConstRange.h
index 643dc47c83be..a0a6751737c2 100644
--- a/Circulator/doc/Circulator/Concepts/ConstRange.h
+++ b/Circulator/doc/Circulator/Concepts/ConstRange.h
@@ -7,7 +7,10 @@ A constant iterator range. Refer to the `Range` concept for more details.
 
 \cgalRefinesBare{Boost's %Range concept}
 
-\cgalHasModelsBare{STL containers,<A HREF="https://www.boost.org/libs/range/doc/html/range/reference/utilities/iterator_range.html">`boost::iterator_range`</A>}
+\cgalHasModelsBegin
+\cgalHasModelsBare{STL containers}
+\cgalHasModelsBare{<A HREF="https://www.boost.org/libs/range/doc/html/range/reference/utilities/iterator_range.html">`boost::iterator_range`</A>}
+\cgalHasModelsEnd
 
 \sa `Range`
 
diff --git a/Circulator/doc/Circulator/Concepts/Handle.h b/Circulator/doc/Circulator/Concepts/Handle.h
index a5fade1d46fa..0e531736bcf0 100644
--- a/Circulator/doc/Circulator/Concepts/Handle.h
+++ b/Circulator/doc/Circulator/Concepts/Handle.h
@@ -23,10 +23,11 @@ operator is concerned (this serves the same purpose as NULL for pointers).
 (Note that this is not a generally supported feature of iterators of
 standard containers.)
 
-\cgalHasModelsBegin T* (pointer)
-\cgalHasModels const T* (const pointers)
-\cgalHasModels Iterator
-\cgalHasModels Circulator
+\cgalHasModelsBegin
+\cgalModels{T* (pointer)}
+\cgalModels{const T* (const pointers)}
+\cgalModels{Iterator}
+\cgalModels{Circulator}
 \cgalHasModelsEnd
 */
 class Handle {
diff --git a/Circulator/doc/Circulator/Concepts/Range.h b/Circulator/doc/Circulator/Concepts/Range.h
index ef6cfd56d58b..afd4b4271825 100644
--- a/Circulator/doc/Circulator/Concepts/Range.h
+++ b/Circulator/doc/Circulator/Concepts/Range.h
@@ -31,7 +31,9 @@ difference with iterators which are typically passed by value.
 
 \cgalRefinesBare{ConstRange,Boost's %Range concept}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{STL containers}
+\cgalHasModelsEnd
 
 */
 
diff --git a/Classification/doc/Classification/Concepts/Classifier.h b/Classification/doc/Classification/Concepts/Classifier.h
index 9a3505997949..fefec08fcebe 100644
--- a/Classification/doc/Classification/Concepts/Classifier.h
+++ b/Classification/doc/Classification/Concepts/Classifier.h
@@ -12,9 +12,10 @@ Concept describing a classifier used by classification functions (see
 `CGAL::Classification::classify()`, `CGAL::Classification::classify_with_local_smoothing()` and
 `CGAL::Classification::classify_with_graphcut()`).
 
-\cgalHasModelsBegin CGAL::Classification::Sum_of_weighted_features_classifier
-\cgalHasModels CGAL::Classification::ETHZ::Random_forest_classifier
-\cgalHasModels CGAL::Classification::OpenCV::Random_forest_classifier
+\cgalHasModelsBegin
+\cgalModels{CGAL::Classification::Sum_of_weighted_features_classifier}
+\cgalModels{CGAL::Classification::ETHZ::Random_forest_classifier}
+\cgalModels{CGAL::Classification::OpenCV::Random_forest_classifier}
 \cgalHasModelsEnd
 
 */
diff --git a/Classification/doc/Classification/Concepts/NeighborQuery.h b/Classification/doc/Classification/Concepts/NeighborQuery.h
index 99aeb76cb2f6..4db42f7b4b8a 100644
--- a/Classification/doc/Classification/Concepts/NeighborQuery.h
+++ b/Classification/doc/Classification/Concepts/NeighborQuery.h
@@ -10,10 +10,11 @@ namespace Classification
 
 Concept describing a neighbor query used for classification.
 
-\cgalHasModelsBegin CGAL::Classification::Point_set_neighborhood::K_neighbor_query
-\cgalHasModels CGAL::Classification::Point_set_neighborhood::Sphere_neighbor_query
-\cgalHasModels CGAL::Classification::Mesh_neighborhood::One_ring_neighbor_query
-\cgalHasModels CGAL::Classification::Mesh_neighborhood::N_ring_neighbor_query
+\cgalHasModelsBegin
+\cgalModels{CGAL::Classification::Point_set_neighborhood::K_neighbor_query}
+\cgalModels{CGAL::Classification::Point_set_neighborhood::Sphere_neighbor_query}
+\cgalModels{CGAL::Classification::Mesh_neighborhood::One_ring_neighbor_query}
+\cgalModels{CGAL::Classification::Mesh_neighborhood::N_ring_neighbor_query}
 \cgalHasModelsEnd
 
 */
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h
index ad331c7bc22b..ec2f990abf1b 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/CellAttribute.h
@@ -5,7 +5,9 @@
 
 The concept `CellAttribute` represents a non void attribute associated with a cell of a generic map. It can keep a descriptor to one dart of its associated cell, and can contain any information.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{\link CGAL::Cell_attribute `CGAL::Cell_attribute<Map,Info_,Tag,OnMerge,OnSplit>`\endlink}
+\cgalHasModelsEnd
 
 \sa `GenericMap`
 \sa `GenericMapItems`
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
index ecf28bda596e..251d424bc029 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
@@ -6,7 +6,9 @@ The concept `CombinatorialMap` defines a <I>d</I>-dimensional combinatorial map.
 
 \cgalRefines{GenericMap}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{\link CGAL::Combinatorial_map `CGAL::Combinatorial_map<d,Items,Alloc>`\endlink}
+\cgalHasModelsEnd
 
 For a combinatorial map, the function \link GenericMap::next `next`\endlink is equal to \f$ \beta_1\f$, \link GenericMap::previous `previous`\endlink is equal to \f$ \beta_0\f$  and the function \link GenericMap::opposite `opposite<i>`\endlink is equal to \f$ \beta_i\f$.
 */
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
index 87113f9aa211..9e09eb5dea8d 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMap.h
@@ -8,8 +8,10 @@ The concept `GenericMap` defines a <I>d</I>-dimensional generic map. This concep
 
 A generic map has a set of darts <I>D</I>, and functions \f$ f_0\f$,\f$ \ldots\f$,\f$ f_{d}\f$ that link these darts between them.
 
-\cgalHasModelsBare{\link CGAL::Combinatorial_map `CGAL::Combinatorial_map<d,Items,Alloc>`\endlink\n
-                   \link CGAL::Generalized_map `CGAL::Generalized_map<d,Items,Alloc>`\endlink}
+\cgalHasModelsBegin
+\cgalHasModelsBare{\link CGAL::Combinatorial_map `CGAL::Combinatorial_map<d,Items,Alloc>`\endlink}
+\cgalHasModelsBare{\link CGAL::Generalized_map `CGAL::Generalized_map<d,Items,Alloc>`\endlink}
+\cgalHasModelsEnd
 
 \sa `CombinatorialMap`
 \sa `GeneralizedMap`
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h
index 6fd24033a72b..4117f134ecc6 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/GenericMapItems.h
@@ -4,7 +4,9 @@
 
 The concept `GenericMapItems` allows to customize a <I>d</I>D generic map by choosing the information associated with darts, by enabling and disabling some attributes, and by choosing to use indices or handles. For that, it defines an inner class template named \link GenericMapItems::Dart_wrapper `Dart_wrapper`\endlink, with one template parameter, `Map`, a model of the `GenericMap` concept. This inner class can define the two types `%Dart_info` and `%Attributes`.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{\link CGAL::Generic_map_min_items `CGAL::Generic_map_min_items`\endlink}
+\cgalHasModelsEnd
 
 \sa `GenericMap`
 
diff --git a/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h b/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h
index 251e12f7fb91..f5e1d3a6f365 100644
--- a/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h
+++ b/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h
@@ -9,12 +9,13 @@ primitives (objects and predicates) that the convex hull algorithms use.
 functions. The specific subset of these primitives required by each function
 is specified with each function.
 
-\cgalHasModelsBegin CGAL::Convex_hull_constructive_traits_2<R>
-\cgalHasModels CGAL::Convex_hull_traits_2<R>
-\cgalHasModels CGAL::Convex_hull_traits_adapter_2<R>
-\cgalHasModels CGAL::Projection_traits_xy_3<K>
-\cgalHasModels CGAL::Projection_traits_yz_3<K>
-\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Convex_hull_constructive_traits_2<R>}
+\cgalModels{CGAL::Convex_hull_traits_2<R>}
+\cgalModels{CGAL::Convex_hull_traits_adapter_2<R>}
+\cgalModels{CGAL::Projection_traits_xy_3<K>}
+\cgalModels{CGAL::Projection_traits_yz_3<K>}
+\cgalModels{CGAL::Projection_traits_xz_3<K>}
 \cgalHasModelsEnd
 
 */
diff --git a/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h b/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h
index 711efc4d8aa4..b9fd8dac2302 100644
--- a/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h
+++ b/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h
@@ -4,8 +4,9 @@
 
 Requirements of the traits class of the function `CGAL::convex_hull_3()`.
 
-\cgalHasModelsBegin CGAL::Convex_hull_traits_3<K>
-\cgalHasModels CGAL::Extreme_points_traits_adapter_3<PPM, GT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Convex_hull_traits_3<K>}
+\cgalModels{CGAL::Extreme_points_traits_adapter_3<PPM, GT>}
 \cgalHasModelsEnd
 
 */
diff --git a/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h b/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h
index 6f3bad1286ed..5b03c77793f4 100644
--- a/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h
+++ b/Convex_hull_3/doc/Convex_hull_3/Concepts/IsStronglyConvexTraits_3.h
@@ -6,7 +6,9 @@ Requirements of the traits class used by the function
 `CGAL::is_strongly_convex_3()`, which is used for postcondition checking
 by `CGAL::convex_hull_3()`.
 
-\cgalHasModelsBareBegin{All models of `Kernel`} CGAL::Convex_hull_traits_3<R>
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of `Kernel`}
+\cgalHasModels{CGAL::Convex_hull_traits_3<R>}
 \cgalHasModelsEnd
 
 \sa `ConvexHullTraits_3`
diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h
index 78e06df722d3..fce2c1aa3200 100644
--- a/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h
+++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h
@@ -7,9 +7,10 @@
 Requirements of the traits class to be used with the
 class `CGAL::Convex_hull_d`.
 
-\cgalHasModelsBegin CGAL::Cartesian_d<FT,LA>
-\cgalHasModels CGAL::Homogeneous_d<RT,LA>
-\cgalHasModels CGAL::Convex_hull_d_traits_3<R>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Cartesian_d<FT,LA>}
+\cgalModels{CGAL::Homogeneous_d<RT,LA>}
+\cgalModels{CGAL::Convex_hull_d_traits_3<R>}
 \cgalHasModelsEnd
 
 */
diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h
index 23352fbe2e6e..0937e25239c1 100644
--- a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h
+++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h
@@ -7,8 +7,9 @@
 Requirements of the second traits class to be used with the
 class `CGAL::Delaunay_d`.
 
-\cgalHasModelsBegin CGAL::Cartesian_d<FT,LA>
-\cgalHasModels CGAL::Homogeneous_d<RT,LA>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Cartesian_d<FT,LA>}
+\cgalModels{CGAL::Homogeneous_d<RT,LA>}
 \cgalHasModelsEnd
 
 */
diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h
index b8e91a96aa9a..2f91bbf7d823 100644
--- a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h
+++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h
@@ -7,8 +7,9 @@
 Requirements of the first traits class to be used with the
 class `CGAL::Delaunay_d`.
 
-\cgalHasModelsBegin CGAL::Cartesian_d<FT,LA>
-\cgalHasModels CGAL::Homogeneous_d<RT,LA>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Cartesian_d<FT,LA>}
+\cgalModels{CGAL::Homogeneous_d<RT,LA>}
 \cgalHasModelsEnd
 
 */
diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index 0521a19e26d5..d25c24605aec 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -146,12 +146,10 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \
                          "cgalHasModelsHeader=Has models" \
-                         "cgalHasModelsBegin=<dl><dt>@cgalHasModelsHeader</dt><dd>`" \
-                         "cgalHasModels=`</dd><dt></dt><dd>`" \
-                         "cgalHasModelsEnd=`</dd></dl>" \
-                         "cgalHasModelsBare{1}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd></dl>" \
-                         "cgalHasModelsBare{2}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
-                         "cgalHasModelsBareBegin{1}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd><dt></dt><dd>`" \
+                         "cgalHasModelsBegin=<dl><dt>@cgalHasModelsHeader</dt><dd></dd>" \
+                         "cgalHasModels{1}=<dt></dt><dd>`\1`</dd>" \
+                         "cgalHasModelsBare{1}=<dt></dt><dd>\1</dd>" \
+                         "cgalHasModelsEnd=</dl>" \
                          "cgalDebugBegin=\htmlonly <div class=\"CGALDebug\"> <div>Debugging Support</div> \endhtmlonly \n" \
                          "cgalDebugEnd=\htmlonly </div> \endhtmlonly" \
                          "cgalDebugFunction=This is a function for debugging purpose." \
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index 11e0fa1ae9a6..6b2dbc6ae722 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -155,12 +155,10 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
                          "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \
                          "cgalHasModelsHeader=Has models" \
-                         "cgalHasModelsBegin=<dl><dt>@cgalHasModelsHeader</dt><dd>`" \
-                         "cgalHasModels=`</dd><dt></dt><dd>`" \
-                         "cgalHasModelsEnd=`</dd></dl>" \
-                         "cgalHasModelsBare{1}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd></dl>" \
-                         "cgalHasModelsBare{2}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
-                         "cgalHasModelsBareBegin{1}=<dl><dt>@cgalHasModelsHeader</dt><dd>\1</dd><dt></dt><dd>`" \
+                         "cgalHasModelsBegin=<dl><dt>@cgalHasModelsHeader</dt><dd></dd>" \
+                         "cgalHasModels{1}=<dt></dt><dd>`\1`</dd>" \
+                         "cgalHasModelsBare{1}=<dt></dt><dd>\1</dd>" \
+                         "cgalHasModelsEnd=</dl>" \
                          "cgalDebugBegin=\htmlonly[block] <div class=\"CGALDebug\"> <div>Debugging Support</div> \endhtmlonly ^^" \
                          "cgalDebugEnd=\htmlonly[block] </div> \endhtmlonly" \
                          "cgalDebugFunction=This is a function for debugging purpose." \
diff --git a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
index 66b3c1f34772..02ae3ebf7cf3 100644
--- a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
+++ b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
@@ -16,10 +16,11 @@ Note however, that these operations usually involve the projection of
 
 \cgalRefines{ArrangementXMonotoneTraits_2}
 
-\cgalHasModelsBegin CGAL::Env_triangle_traits_3<Kernel>
-\cgalHasModels CGAL::Env_sphere_traits_3<ConicTraits>
-\cgalHasModels CGAL::Env_plane_traits_3<Kernel>
-\cgalHasModels CGAL::Env_surface_data_traits_3<Traits,XyData,SData,Cnv>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Env_triangle_traits_3<Kernel>}
+\cgalModels{CGAL::Env_sphere_traits_3<ConicTraits>}
+\cgalModels{CGAL::Env_plane_traits_3<Kernel>}
+\cgalModels{CGAL::Env_surface_data_traits_3<Traits,XyData,SData,Cnv>}
 \cgalHasModelsEnd
 
 */
diff --git a/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h b/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h
index f43d4b8944dd..16fa1e40eabd 100644
--- a/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h
+++ b/Generalized_map/doc/Generalized_map/Concepts/GeneralizedMap.h
@@ -6,7 +6,9 @@ The concept `GeneralizedMap` defines a <I>d</I>-dimensional generalized map.
 
 \cgalRefines{GenericMap}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{\link CGAL::Generalized_map `CGAL::Generalized_map<d,Items,Alloc>`\endlink}
+\cgalHasModelsEnd
 
 For a generalized map, the function \link GenericMap::next `next`\endlink is equal to \f$ \alpha_1\circ\alpha_0\f$, \link GenericMap::previous `previous`\endlink is equal to \f$ \alpha_0\circ\alpha_1\f$  and the function \link GenericMap::opposite `opposite<i>`\endlink is equal to \f$ \alpha_i\circ\alpha_0\f$.
 */
diff --git a/Generator/doc/Generator/Concepts/CombinationElement.h b/Generator/doc/Generator/Concepts/CombinationElement.h
index 8e4747e08392..53872f44809d 100644
--- a/Generator/doc/Generator/Concepts/CombinationElement.h
+++ b/Generator/doc/Generator/Concepts/CombinationElement.h
@@ -4,9 +4,11 @@
 A CombinationElement can be used as template parameter for the class
 `Combination_enumerator<CombinationElement>`.
 
-\cgalHasModelsBare{Any integer type (`char`, `short`, `int`, `long`, etc.)\n
-              Pointers\n
-              Random access iterators}
+\cgalHasModelsBegin
+\cgalHasModelsBare{Any integer type (`char`, `short`, `int`, `long`, etc.)}
+\cgalHasModelsBare{Pointers}
+\cgalHasModelsBare{Random access iterators}
+\cgalHasModelsEnd
 
 \sa `CGAL::Combination_enumerator<CombinationElement>`
 
diff --git a/Generator/doc/Generator/Concepts/PointGenerator.h b/Generator/doc/Generator/Concepts/PointGenerator.h
index 2f96e53167d9..5a70e5f0ebdc 100644
--- a/Generator/doc/Generator/Concepts/PointGenerator.h
+++ b/Generator/doc/Generator/Concepts/PointGenerator.h
@@ -5,20 +5,21 @@
 The concept `PointGenerator` defines the requirements for a point generator,
 which can be used in places where input iterators are called for.
 
-\cgalHasModelsBegin CGAL::Random_points_in_ball_d<Point_d,>
-\cgalHasModels CGAL::Random_points_in_disc_2<Point_2, Creator>
-\cgalHasModels CGAL::Random_points_in_square_2<Point_2, Creator>
-\cgalHasModels CGAL::Random_points_in_triangle_2<Point_2, Creator>
-\cgalHasModels CGAL::Random_points_on_circle_2<Point_2, Creator>
-\cgalHasModels CGAL::Random_points_on_segment_2<Point_2, Creator>
-\cgalHasModels CGAL::Random_points_on_square_2<Point_2, Creator>
-\cgalHasModels CGAL::Random_points_in_cube_3<Point_3, Creator>
-\cgalHasModels CGAL::Random_points_in_cube_d<Point_d>
-\cgalHasModels CGAL::Random_points_in_sphere_3<Point_3, Creator>
-\cgalHasModels CGAL::Random_points_in_triangle_3<Point_3, Creator>
-\cgalHasModels CGAL::Random_points_in_tetrahedron_3<Point_3, Creator>
-\cgalHasModels CGAL::Random_points_on_sphere_3<Point_3, Creator>
-\cgalHasModels CGAL::Random_points_on_sphere_d<Point_d>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Random_points_in_ball_d<Point_d,>}
+\cgalModels{CGAL::Random_points_in_disc_2<Point_2, Creator>}
+\cgalModels{CGAL::Random_points_in_square_2<Point_2, Creator>}
+\cgalModels{CGAL::Random_points_in_triangle_2<Point_2, Creator>}
+\cgalModels{CGAL::Random_points_on_circle_2<Point_2, Creator>}
+\cgalModels{CGAL::Random_points_on_segment_2<Point_2, Creator>}
+\cgalModels{CGAL::Random_points_on_square_2<Point_2, Creator>}
+\cgalModels{CGAL::Random_points_in_cube_3<Point_3, Creator>}
+\cgalModels{CGAL::Random_points_in_cube_d<Point_d>}
+\cgalModels{CGAL::Random_points_in_sphere_3<Point_3, Creator>}
+\cgalModels{CGAL::Random_points_in_triangle_3<Point_3, Creator>}
+\cgalModels{CGAL::Random_points_in_tetrahedron_3<Point_3, Creator>}
+\cgalModels{CGAL::Random_points_on_sphere_3<Point_3, Creator>}
+\cgalModels{CGAL::Random_points_on_sphere_d<Point_d>}
 \cgalHasModelsEnd
 
 */
diff --git a/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h b/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h
index 424119d49b9b..61949762078f 100644
--- a/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h
+++ b/Generator/doc/Generator/Concepts/RandomConvexHullTraits_2.h
@@ -5,7 +5,9 @@
 The concept `RandomConvexHullTraits_2` describes the requirements for the traits
 class used by the function `random_convex_hull_in_disc_2()`.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the concept `Kernel`}
+\cgalHasModelsEnd
 
 \cgalHeading{Operations}
 
diff --git a/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h b/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h
index 630b93345d17..669f54809b32 100644
--- a/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h
+++ b/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h
@@ -5,7 +5,8 @@
 The concept `RandomConvexSetTraits_2` describes the requirements of the traits
 class for the function `random_convex_set_2()`.
 
-\cgalHasModelsBegin CGAL::Random_convex_set_traits_2<Kernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Random_convex_set_traits_2<Kernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h b/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h
index be8badeb6410..c996e2053609 100644
--- a/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h
+++ b/Generator/doc/Generator/Concepts/RandomPolygonTraits_2.h
@@ -5,7 +5,9 @@
 The concept `RandomPolygonTraits_2` describes the requirements for the traits
 class used by the function `random_polygon_2()`.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the concept `Kernel`}
+\cgalHasModelsEnd
 
 \cgalHeading{Operations}
 
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
index 227ae11cc406..6b99d22b415c 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
@@ -67,9 +67,10 @@ allocators internally. A default argument is mandatory for
 from the `<CGAL/memory.h>` header file can be used as default
 allocator.
 
-\cgalHasModelsBegin CGAL::HalfedgeDS_default
-\cgalHasModels CGAL::HalfedgeDS_list
-\cgalHasModels CGAL::HalfedgeDS_vector
+\cgalHasModelsBegin
+\cgalModels{CGAL::HalfedgeDS_default}
+\cgalModels{CGAL::HalfedgeDS_list}
+\cgalModels{CGAL::HalfedgeDS_vector}
 \cgalHasModelsEnd
 
 \sa `HalfedgeDSItems`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h
index cacaac7459aa..fb3c3e05d2ac 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h
@@ -23,8 +23,9 @@ can be bypassed by the user, but not by accident.)
 
 \cgalRefines{CopyConstructible,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::HalfedgeDS_face_base<Refs>
-\cgalHasModels CGAL::HalfedgeDS_face_min_base<Refs>
+\cgalHasModelsBegin
+\cgalModels{CGAL::HalfedgeDS_face_base<Refs>}
+\cgalModels{CGAL::HalfedgeDS_face_min_base<Refs>}
 \cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h
index 5dae57935e8d..f726b2c43833 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h
@@ -33,8 +33,9 @@ more protection is provided for the `set_opposite()` member
 function. The base class `Base_base` provides access to it. (The
 protection could be bypassed also by an user, but not by accident.)
 
-\cgalHasModelsBegin ::CGAL::HalfedgeDS_halfedge_base
-\cgalHasModels ::CGAL::HalfedgeDS_halfedge_min_base
+\cgalHasModelsBegin
+\cgalModels{::CGAL::HalfedgeDS_halfedge_base}
+\cgalModels{::CGAL::HalfedgeDS_halfedge_min_base}
 \cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h
index 51a99908bc04..3b52eeb48a51 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h
@@ -16,9 +16,10 @@ and `Face` respectively. The requirements on these
 types are described on the manual pages of the concepts `HalfedgeDSVertex`,
 `HalfedgeDSHalfedge`, and `HalfedgeDSFace` respectively.
 
-\cgalHasModelsBegin CGAL::HalfedgeDS_min_items
-\cgalHasModels CGAL::HalfedgeDS_items_2
-\cgalHasModels CGAL::Polyhedron_items_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::HalfedgeDS_min_items}
+\cgalModels{CGAL::HalfedgeDS_items_2}
+\cgalModels{CGAL::Polyhedron_items_3}
 \cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h
index 38f5afab43c4..ce5766136308 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h
@@ -23,8 +23,9 @@ could be bypassed by an user, but not by accident.)
 
 \cgalRefines{CopyConstructible,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::HalfedgeDS_vertex_base<Refs>
-\cgalHasModels CGAL::HalfedgeDS_vertex_min_base<Refs>
+\cgalHasModelsBegin
+\cgalModels{CGAL::HalfedgeDS_vertex_base<Refs>}
+\cgalModels{CGAL::HalfedgeDS_vertex_min_base<Refs>}
 \cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
diff --git a/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h b/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h
index cf4b6f8d9d70..9670eee46e68 100644
--- a/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h
+++ b/Heat_method_3/doc/Heat_method_3/Concepts/HeatMethodTraits_3.h
@@ -7,7 +7,9 @@ The concept `HeatMethodTraits_3` describes the types,
 predicates, and constructions required by the traits class parameter of
 `CGAL::Heat_method_3::Surface_mesh_geodesic_distances_3`.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 
 
 */
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
index 3299b6f89e3b..39a254eec7e1 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
@@ -16,8 +16,9 @@ constructions on these objects.
 This concept refines `DelaunayTriangulationTraits_2` because the class `CGAL::Hyperbolic_Delaunay_triangulation_2`
 internally relies on the class `CGAL::Delaunay_triangulation_2`.
 
-\cgalHasModelsBegin CGAL::Hyperbolic_Delaunay_triangulation_traits_2
-\cgalHasModels CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Hyperbolic_Delaunay_triangulation_traits_2}
+\cgalModels{CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2}
 \cgalHasModelsEnd
 */
 
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h
index 9f57d33da117..51a984a3c985 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h
@@ -41,7 +41,8 @@ This concept provides an interface for the functionality needed in faces to comp
 Delaunay triangulations in the hyperbolic plane. The function `tds_data()` is used
 internally by the triangulation class during the insertion of points in the triangulation.
 
-\cgalHasModelsBegin CGAL::Hyperbolic_triangulation_face_base_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Hyperbolic_triangulation_face_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h
index f6de632e04c0..407337905ef1 100644
--- a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h
+++ b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h
@@ -15,8 +15,9 @@ inscribed into a given convex polygon.
 precondition checking only. Therefore, they need not to be
 specified, in case that precondition checking is disabled.
 
-\cgalHasModelsBegin CGAL::Extremal_polygon_area_traits_2<K>
-\cgalHasModels CGAL::Extremal_polygon_perimeter_traits_2<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Extremal_polygon_area_traits_2<K>}
+\cgalModels{CGAL::Extremal_polygon_perimeter_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::maximum_area_inscribed_k_gon_2()`
diff --git a/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h b/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h
index d3e1374d7715..796290481046 100644
--- a/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h
+++ b/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h
@@ -10,8 +10,9 @@ This concept provides the types of the geometric primitives used in
 this class and some function object types for the required
 predicates on those primitives.
 
-\cgalHasModelsBegin CGAL::Cartesian
-\cgalHasModels CGAL::Homogeneous
+\cgalHasModelsBegin
+\cgalModels{CGAL::Cartesian}
+\cgalModels{CGAL::Homogeneous}
 \cgalHasModelsEnd
 
 \sa `CGAL::Largest_empty_iso_rectangle_2<Traits>`
diff --git a/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h b/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h
index 4cb824c031b1..0cdbc888f217 100644
--- a/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h
+++ b/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h
@@ -7,7 +7,8 @@
 traits class that defines the primitives used by the algorithm. The
 concept `GradientFittingTraits` defines this common set of requirements.
 
-\cgalHasModelsBegin CGAL::Interpolation_gradient_fitting_traits_2<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Interpolation_gradient_fitting_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `InterpolationTraits`
diff --git a/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h b/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h
index a07eb526d3c7..18b806952cb5 100644
--- a/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h
+++ b/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h
@@ -7,8 +7,9 @@ Most interpolation functions are parameterized by a traits class that
 defines the primitives used in the interpolation algorithms. The concept
 `InterpolationTraits` defines this common set of requirements.
 
-\cgalHasModelsBegin CGAL::Interpolation_traits_2<K>
-\cgalHasModels CGAL::Interpolation_gradient_fitting_traits_2<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Interpolation_traits_2<K>}
+\cgalModels{CGAL::Interpolation_gradient_fitting_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `GradientFittingTraits`
diff --git a/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h b/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h
index 1bc267a684eb..fe7cbbd266ed 100644
--- a/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h
+++ b/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h
@@ -9,8 +9,9 @@ The concept does not specify, whether the interval is open or
 closed. It is up to the implementer of a model for this concept
 to define that.
 
-\cgalHasModelsBegin CGAL::Interval_skip_list_interval<Value>
-\cgalHasModels CGAL::Level_interval
+\cgalHasModelsBegin
+\cgalModels{CGAL::Interval_skip_list_interval<Value>}
+\cgalModels{CGAL::Level_interval}
 \cgalHasModelsEnd
 
 \sa `Interval_skip_list`
diff --git a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h
index 9276d91c6b32..93d2ee819e5a 100644
--- a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h
+++ b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h
@@ -13,8 +13,9 @@ the class
 Only constructors (from 3 scalars and copy constructors) and access
 methods to coordinates `x()`, `y()`, `z()` are needed.
 
-\cgalHasModelsBegin CGAL::Cartesian<FieldNumberType>
-\cgalHasModels CGAL::Simple_cartesian<FieldNumberType>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Cartesian<FieldNumberType>}
+\cgalModels{CGAL::Simple_cartesian<FieldNumberType>}
 \cgalHasModelsEnd
 
 \sa `LocalKernel`
diff --git a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h
index 75629fb37f15..d4981cf4f846 100644
--- a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h
+++ b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h
@@ -29,8 +29,9 @@ Only constructors (from 3 scalars and copy constructors) and access
 methods to coordinates `x()`, `y()`, `z()` are needed for the point and
 vector types.
 
-\cgalHasModelsBegin CGAL::Cartesian<FieldNumberType>
-\cgalHasModels CGAL::Simple_cartesian<FieldNumberType>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Cartesian<FieldNumberType>}
+\cgalModels{CGAL::Simple_cartesian<FieldNumberType>}
 \cgalHasModelsEnd
 
 \sa `DataKernel`
diff --git a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h
index a732c7891a3c..9433ac9dd058 100644
--- a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h
+++ b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h
@@ -8,7 +8,8 @@ namespace Kernel {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModelsBegin CGAL::Circle_2<Kernel>
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Circle_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_2`
@@ -39,7 +40,8 @@ class Circle_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModelsBegin CGAL::Circle_3<Kernel>
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Circle_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeApproximateArea_3`
@@ -69,7 +71,7 @@ class Circle_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModels CGAL::Direction_2<Kernel>
+  \cgalModels{CGAL::Direction_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::CompareAngleWithXAxis_2`
@@ -94,7 +96,7 @@ class Direction_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModels CGAL::Direction_3<Kernel>
+  \cgalModels{CGAL::Direction_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ConstructDirection_3`
@@ -115,7 +117,8 @@ A type representing isocuboids in three dimensions.
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Iso_cuboid_3<Kernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Iso_cuboid_3<Kernel>}
 \cgalHasModelsEnd
 
 \sa `Kernel::BoundedSide_3`
@@ -141,7 +144,7 @@ class IsoCuboid_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModels CGAL::Iso_rectangle_2<Kernel>
+  \cgalModels{CGAL::Iso_rectangle_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ConstructIsoRectangle_2`
@@ -174,7 +177,7 @@ class IsoRectangle_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModels CGAL::Line_2<Kernel>
+  \cgalModels{CGAL::Line_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::CompareXAtY_2`
@@ -211,7 +214,7 @@ class Line_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModels CGAL::Line_3<Kernel>
+  \cgalModels{CGAL::Line_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
@@ -243,7 +246,7 @@ class Line_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModels CGAL::Object
+  \cgalModels{CGAL::Object}
   \cgalHasModelsEnd
 
   \sa `Kernel::Assign_2`
@@ -265,7 +268,7 @@ class Object_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModels CGAL::Object
+  \cgalModels{CGAL::Object}
   \cgalHasModelsEnd
 
   \sa `Kernel::Assign_3`
@@ -285,7 +288,7 @@ class Object_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModels CGAL::Plane_3<Kernel>
+  \cgalModels{CGAL::Plane_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
@@ -323,7 +326,7 @@ class Plane_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModels CGAL::Point_2<Kernel>
+  \cgalModels{CGAL::Point_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::Angle_2`
@@ -383,7 +386,7 @@ class Point_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModels CGAL::Point_3<Kernel>
+  \cgalModels{CGAL::Point_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::Angle_3`
@@ -445,7 +448,8 @@ A type representing rays in two dimensions.
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Ray_2<Kernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Ray_2<Kernel>}
 \cgalHasModelsEnd
 
 \sa `Kernel::CollinearHasOn_2`
@@ -478,7 +482,8 @@ class Ray_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModelsBegin CGAL::Ray_3<Kernel>
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Ray_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
@@ -507,7 +512,8 @@ class Ray_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModelsBegin CGAL::Segment_2<Kernel>
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Segment_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::CollinearHasOn_2`
@@ -542,7 +548,8 @@ class Segment_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModelsBegin CGAL::Segment_3<Kernel>
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Segment_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
@@ -573,7 +580,8 @@ class Segment_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModelsBegin CGAL::Sphere_3<Kernel>
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Sphere_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_3`
@@ -604,7 +612,8 @@ class Sphere_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModelsBegin CGAL::Tetrahedron_3<Kernel>
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Tetrahedron_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_3`
@@ -636,7 +645,8 @@ class Tetrahedron_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModelsBegin CGAL::Triangle_2<Kernel>
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Triangle_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_2`
@@ -670,7 +680,8 @@ class Triangle_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModelsBegin CGAL::Triangle_3<Kernel>
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Triangle_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredArea_3`
@@ -696,7 +707,8 @@ class Triangle_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalHasModelsBegin CGAL::Vector_2<Kernel>
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Vector_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeDeterminant_2`
@@ -730,7 +742,8 @@ A type representing vectors in three dimensions.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Vector_3<Kernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Vector_3<Kernel>}
 \cgalHasModelsEnd
 
 \sa `Kernel::CompareDihedralAngle_3`
@@ -767,7 +780,8 @@ A type representing weighted points in two dimensions.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Weighted_point_2<Kernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Weighted_point_2<Kernel>}
 \cgalHasModelsEnd
 
 \sa `Kernel::ConstructWeightedPoint_2`
@@ -795,7 +809,8 @@ A type representing weighted points in three dimensions.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Weighted_point_3<Kernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Weighted_point_3<Kernel>}
 \cgalHasModelsEnd
 
 \sa `Kernel::ConstructWeightedPoint_3`
diff --git a/Kernel_23/doc/Kernel_23/Concepts/Kernel.h b/Kernel_23/doc/Kernel_23/Concepts/Kernel.h
index ad4a0782765f..2da2b9d8fb9f 100644
--- a/Kernel_23/doc/Kernel_23/Concepts/Kernel.h
+++ b/Kernel_23/doc/Kernel_23/Concepts/Kernel.h
@@ -20,14 +20,15 @@
   `Construct_`. If the result type is a number type, the name is prefixed by `Compute_`.
   When the result type is not determined, no prefix is used.
 
-  \cgalHasModelsBegin galHasModel `CGAL::Cartesian<FieldNumberType>
-  \cgalHasModels CGAL::Homogeneous<RingNumberType>
-  \cgalHasModels CGAL::Simple_cartesian<FieldNumberType>
-  \cgalHasModels CGAL::Simple_homogeneous<RingNumberType>
-  \cgalHasModels CGAL::Filtered_kernel<CK>
-  \cgalHasModels CGAL::Exact_predicates_exact_constructions_kernel
-  \cgalHasModels CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt
-  \cgalHasModels CGAL::Exact_predicates_inexact_constructions_kernel
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Cartesian<FieldNumberType>}
+  \cgalModels{CGAL::Homogeneous<RingNumberType>}
+  \cgalModels{CGAL::Simple_cartesian<FieldNumberType>}
+  \cgalModels{CGAL::Simple_homogeneous<RingNumberType>}
+  \cgalModels{CGAL::Filtered_kernel<CK>}
+  \cgalModels{CGAL::Exact_predicates_exact_constructions_kernel}
+  \cgalModels{CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt}
+  \cgalModels{CGAL::Exact_predicates_inexact_constructions_kernel}
   \cgalHasModelsEnd
 
   \sa `Kernel_d`
diff --git a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h
index 63e05367bafc..4a8e19db8cd4 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h
@@ -8,8 +8,9 @@ general kernel concept. It adds 2 functors, the meaning of which would be
 unclear in kernels of fixed dimension.
 
 \cgalRefines{Kernel_d}
-\cgalHasModelsBegin CGAL::Cartesian_d<FieldNumberType>
-\cgalHasModels CGAL::Homogeneous_d<RingNumberType>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Cartesian_d<FieldNumberType>}
+\cgalModels{CGAL::Homogeneous_d<RingNumberType>}
 \cgalHasModelsEnd
 */
 class KernelWithLifting_d {
diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h
index a56284feab8a..c4ac4f607c80 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h
@@ -18,10 +18,11 @@ predicates. The former replace constructors of the kernel classes and
 constructive procedures in the kernel. There are also function objects
 replacing operators, especially for equality testing.
 
-\cgalHasModelsBegin CGAL::Cartesian_d<FieldNumberType>
-\cgalHasModels CGAL::Homogeneous_d<RingNumberType>
-\cgalHasModels CGAL::Epick_d<DimensionTag>
-\cgalHasModels CGAL::Epeck_d<DimensionTag>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Cartesian_d<FieldNumberType>}
+\cgalModels{CGAL::Homogeneous_d<RingNumberType>}
+\cgalModels{CGAL::Epick_d<DimensionTag>}
+\cgalModels{CGAL::Epeck_d<DimensionTag>}
 \cgalHasModelsEnd
 */
 class Kernel_d {
diff --git a/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h b/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h
index f8a25811d421..8dff375eaea0 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h
@@ -13,8 +13,9 @@ correct. For example, if the linear system solver declares a linear
 system \f$ A x = b\f$ unsolvable it also returns a vector \f$ c\f$ such that
 \f$ c^T A = 0\f$ and \f$ c^T b \neq 0\f$.
 
-\cgalHasModelsBegin CGAL::Linear_algebraHd<RT>
-\cgalHasModels CGAL::Linear_algebraCd<FT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Linear_algebraHd<RT>}
+\cgalModels{CGAL::Linear_algebraCd<FT>}
 \cgalHasModelsEnd
 
 */
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h
index 6f97471a99c4..08820e4d061b 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/CellAttributeWithPoint.h
@@ -7,7 +7,9 @@ The concept `CellAttributeWithPoint` is a refinement of the `CellAttribute` conc
 
 \cgalRefines{CellAttribute}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{\link CGAL::Cell_attribute_with_point `CGAL::Cell_attribute_with_point<LCC,Info_,Tag,OnMerge,OnSplit>`\endlink}
+\cgalHasModelsEnd
 
 \sa `LinearCellComplexItems`
 
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h
index 740405fc5b3c..c7652262cf88 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplex.h
@@ -7,8 +7,10 @@ The concept `LinearCellComplex` represents a linear cell complex in dimension `d
 
 \cgalRefines{GenericMap}
 
-\cgalHasModelsBare{\link CGAL::Linear_cell_complex_for_combinatorial_map `CGAL::Linear_cell_complex_for_combinatorial_map<d,d2,LCCTraits,Items,Alloc>`\endlink\n
-                   \link CGAL::Linear_cell_complex_for_generalized_map `CGAL::Linear_cell_complex_for_generalized_map<d,d2,LCCTraits,Items,Alloc>`\endlink}
+\cgalHasModelsBegin
+\cgalHasModelsBare{\link CGAL::Linear_cell_complex_for_combinatorial_map `CGAL::Linear_cell_complex_for_combinatorial_map<d,d2,LCCTraits,Items,Alloc>`\endlink}
+\cgalHasModelsBare{\link CGAL::Linear_cell_complex_for_generalized_map `CGAL::Linear_cell_complex_for_generalized_map<d,d2,LCCTraits,Items,Alloc>`\endlink}
+\cgalHasModelsEnd
 
 \sa `LinearCellComplexItems`
 \sa `LinearCellComplexTraits`
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h
index 25df3bed1833..abc3d27eaf24 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h
@@ -9,7 +9,8 @@ The concept `LinearCellComplexItems` refines the concept of `GenericMapItems` by
 
 The first type in `Attributes` tuple must be a model of the `CellAttributeWithPoint` concept.
 
-\cgalHasModelsBegin CGAL::Linear_cell_complex_min_items
+\cgalHasModelsBegin
+\cgalModels{CGAL::Linear_cell_complex_min_items}
 \cgalHasModelsEnd
 
 \sa `LinearCellComplex`
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h
index cb7de2d83823..e701f011493f 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexTraits.h
@@ -5,7 +5,9 @@
 
 Required types and functors for the `LinearCellComplexTraits` concept. This geometric traits concept is used in the \link CGAL::Linear_cell_complex_for_combinatorial_map `Linear_cell_complex_for_combinatorial_map`\endlink and \link CGAL::Linear_cell_complex_for_generalized_map `Linear_cell_complex_for_generalized_map`\endlink classes.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{\link CGAL::Linear_cell_complex_traits `CGAL::Linear_cell_complex_traits<d\,K>`\endlink}
+\cgalHasModelsEnd
 
 \sa `CGAL::Linear_cell_complex_for_combinatorial_map<d,d2,LCCTraits,Items,Alloc>`
 \sa `CGAL::Linear_cell_complex_for_generalized_map<d,d2,LCCTraits,Items,Alloc>`
diff --git a/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h b/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h
index 37512a501ece..9a7b265540b9 100644
--- a/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h
+++ b/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h
@@ -8,7 +8,8 @@ A class `BasicMatrix` has to provide the following
 types and operations in order to be a model for
 `BasicMatrix`.
 
-\cgalHasModelsBegin CGAL::Dynamic_matrix<M>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Dynamic_matrix<M>}
 \cgalHasModelsEnd
 
 \sa `MonotoneMatrixSearchTraits`
diff --git a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h
index 3f44b807ffd0..b20b74de1d09 100644
--- a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h
+++ b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h
@@ -21,7 +21,8 @@ add most of the functionality described above to arbitrary
 matrix classes.
 </UL>
 
-\cgalHasModelsBegin CGAL::Dynamic_matrix<M>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Dynamic_matrix<M>}
 \cgalHasModelsEnd
 
 \sa `CGAL::monotone_matrix_search()`
diff --git a/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h b/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h
index e96a49bfdbeb..99c3cfcba772 100644
--- a/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h
+++ b/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h
@@ -8,7 +8,8 @@ needed to compute the smallest entry in a set of sorted matrices
 that fulfills a certain feasibility criterion using the function
 `CGAL::sorted_matrix_search`.
 
-\cgalHasModelsBegin CGAL::Sorted_matrix_search_traits_adaptor<F,M>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Sorted_matrix_search_traits_adaptor<F,M>}
 \cgalHasModelsEnd
 
 \sa `CGAL::sorted_matrix_search()`
diff --git a/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h b/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h
index 745c85b0d9f6..0980ae1d1512 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/ConformingDelaunayTriangulationTraits_2.h
@@ -17,7 +17,9 @@ points on constrained edges.
 
 \cgalRefines{DelaunayTriangulationTraits_2}
 
-\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_xy_3<K>
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModels{CGAL::Projection_traits_xy_3<K>}
 \cgalHasModelsEnd
 
 
diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h
index abe11ca79a86..7bc632d6fa8e 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h
@@ -13,7 +13,8 @@ meshing domain or not.
 
 \cgalRefines{ConstrainedTriangulationFaceBase_2}
 
-\cgalHasModelsBegin CGAL::Delaunay_mesh_face_base_2<Traits, Fb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Delaunay_mesh_face_base_2<Traits, Fb>}
 \cgalHasModelsEnd
 
 
diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h
index 25d8388d962a..e5e793bafffb 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshTraits_2.h
@@ -12,7 +12,9 @@ object `Construct_circumcenter_2`.
 
 \cgalRefines{ConformingDelaunayTriangulationTraits_2}
 
-\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_xy_3<K>
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModels{CGAL::Projection_traits_xy_3<K>}
 \cgalHasModelsEnd
 
 */
diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h
index 341888021197..ac7a4a691612 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h
@@ -13,7 +13,8 @@ the mesh density everywhere while modifying the mesh.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModelsBegin CGAL::Delaunay_mesh_vertex_base_2<Traits, Vb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Delaunay_mesh_vertex_base_2<Traits, Vb>}
 \cgalHasModelsEnd
 
 
diff --git a/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h b/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h
index 929119fb29af..06f5f865e331 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h
@@ -37,8 +37,9 @@ comparable</I> as the meshing algorithm will order bad triangles by quality,
 to split those with smallest quality first. The predicate `Is_bad`
 computes the quality of the triangle as a by-product.
 
-\cgalHasModelsBegin CGAL::Delaunay_mesh_criteria_2<CDT>
-\cgalHasModels CGAL::Delaunay_mesh_size_criteria_2<CDT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Delaunay_mesh_criteria_2<CDT>}
+\cgalModels{CGAL::Delaunay_mesh_size_criteria_2<CDT>}
 \cgalHasModelsEnd
 
 
diff --git a/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h
index 0ca302d56fb5..bab4df1ba944 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/BisectionGeometricTraits_3.h
@@ -16,7 +16,9 @@ function from \f$ \mathbb{R}^3\f$ to \f$ \mathbb{R}\f$), the do-intersect predic
 is computed by evaluations of the function values at both end points
 of the segment.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 
 \sa `ImplicitSurfaceTraits_3`
 \sa `IntersectionGeometricTraits_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
index d5637c9b8e15..8773bf905f8c 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/IntersectionGeometricTraits_3.h
@@ -9,7 +9,9 @@ forming its boundary.
 The concept `IntersectionGeometricTraits_3` mainly provides the detection
 and construction of intersections between segments and triangles.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 
 \sa `BisectionGeometricTraits_3`
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
index 7ad4c56ad1cd..44f0e8181230 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
@@ -43,8 +43,9 @@ each cell (see below).
 
 \cgalRefines{SimplicialMeshCellBase_3,RegularTriangulationCellBaseWithWeightedCircumcenter_3,CopyConstructible}
 
-\cgalHasModelsBegin CGAL::Compact_mesh_cell_base_3<Gt,MD,Tds>
-\cgalHasModels CGAL::Mesh_cell_base_3<Gt,MD,Cb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Compact_mesh_cell_base_3<Gt,MD,Tds>}
+\cgalModels{CGAL::Mesh_cell_base_3<Gt,MD,Cb>}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_mesh_3()`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
index 4691571e9f1b..bc8a60b51d32 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
@@ -9,7 +9,8 @@ that concern either mesh tetrahedra or surface facets.
 The concept `MeshCellCriteria_3` describes the types that
 handle the refinement criteria for mesh tetrahedra.
 
-\cgalHasModelsBegin CGAL::Mesh_cell_criteria_3<Tr>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_cell_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `MeshEdgeCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h
index e1570416dd7f..dcb2123ec62d 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h
@@ -14,7 +14,8 @@ that describes the requirements, in terms of sizing, for the discretization of t
 
 \cgalRefines{MeshCriteria_3}
 
-\cgalHasModelsBegin CGAL::Mesh_criteria_3<Tr>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `MeshEdgeCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
index 189afcbffcb9..83fad908d256 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
@@ -12,7 +12,8 @@ while the refinement criteria for surface facets
 are described by the concept `MeshFacetCriteria_3`.
 The concept `MeshCriteria_3` encapsulates these concepts.
 
-\cgalHasModelsBegin CGAL::Mesh_criteria_3<Tr>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `MeshFacetCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
index fbb2f2cc8eed..d3f7d1e61ea2 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
@@ -5,7 +5,8 @@
 The concept `MeshDomainField_3` describes a scalar field which could be queried
 at any point of the space.
 
-\cgalHasModelsBegin CGAL::Mesh_constant_domain_field_3<Gt,%Index>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_constant_domain_field_3<Gt,%Index>}
 \cgalHasModelsEnd
 
 \sa `MeshDomain_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
index 80df66b599ad..3a3a79f11053 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
@@ -17,8 +17,9 @@ between two ordered points on the same curve.
 
 \cgalRefines{MeshDomain_3}
 
-\cgalHasModelsBegin CGAL::Mesh_domain_with_polyline_features_3<MeshDomain_3>
-\cgalHasModels CGAL::Polyhedral_mesh_domain_with_features_3<IGT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_domain_with_polyline_features_3<MeshDomain_3>}
+\cgalModels{CGAL::Polyhedral_mesh_domain_with_features_3<IGT>}
 \cgalHasModelsEnd
 
 \sa `MeshDomain_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
index 56c6ed59ad1c..03ca9f2fef7e 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
@@ -29,8 +29,9 @@ A segment, ray or line is said to intersect properly the domain boundary
 if it includes points which are strictly inside
 and strictly outside the domain (resp. the subdomain).
 
-\cgalHasModelsBegin CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>
-\cgalHasModels CGAL::Labeled_mesh_domain_3<BGT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>}
+\cgalModels{CGAL::Labeled_mesh_domain_3<BGT>}
 \cgalHasModelsEnd
 
 \sa `MeshVertexBase_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
index 41b3bab44515..930a627cc761 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
@@ -7,7 +7,8 @@ the 1-dimensional features of the domain.
 It provides an upper bound for the distance between two protecting ball centers
 that are consecutive on a 1-feature.
 
-\cgalHasModelsBegin CGAL::Mesh_edge_criteria_3<Tr>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_edge_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `MeshCellCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
index f8bad1f29ccf..a0c32629c5ad 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
@@ -9,7 +9,8 @@ that concern either mesh tetrahedra or surface facets.
 The concept `MeshFacetCriteria_3` describes the types that
 handle the refinement criteria for surface facets.
 
-\cgalHasModelsBegin CGAL::Mesh_facet_criteria_3<Tr>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_facet_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `MeshCellCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h
index ce8469eb8aa8..043960c0e91e 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshPolyline_3.h
@@ -6,7 +6,9 @@ The concept `MeshPolyline_3` implements a container of points designed to repres
 Types and functions provided in this concept are such as standard template library containers
 are natural models of this concept.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{`std::vector<Kernel::Point_3>` for any Kernel of \cgal is a natural model of this concept.}
+\cgalHasModelsEnd
 
 \sa `CGAL::Mesh_domain_with_polyline_features_3<MD>`
 
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
index 3e1a8cf734d0..be84906d8f30 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshTriangulationTraits_3.h
@@ -9,7 +9,9 @@ a mesh generation process.
 
 \cgalRefines{RegularTriangulationTraits_3}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 
 In addition to the requirements described for the traits class
 RegularTriangulationTraits_3, the geometric traits class of a
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
index f4f2ff9d9b84..20a62546c2ce 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
@@ -22,7 +22,8 @@ each cell (see below).
 
 \cgalRefines{SimplicialMeshVertexBase_3,RegularTriangulationVertexBase_3,SurfaceMeshVertexBase_3}
 
-\cgalHasModelsBegin CGAL::Mesh_vertex_base_3<Gt,MD,Vb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_vertex_base_3<Gt,MD,Vb>}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_mesh_3()`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
index 1d3a376d3de1..7be6df1aece7 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
@@ -5,7 +5,8 @@
 The concept `TriangleAccessor_3` represents an accessor to a triangulated polyhedral
 surface, intersection free and without boundaries.
 
-\cgalHasModelsBegin CGAL::Triangle_accessor_3<Polyhedron_3<K>,K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangle_accessor_3<Polyhedron_3<K>,K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h
index 0f81aaa6a90e..848c46adfda9 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h
@@ -6,11 +6,12 @@ A model of the `PolygonConvexDecomposition_2` concept is capable of
 decomposing an input polygon \f$ P\f$ into a set of convex sub-polygons
 \f$ P_1, \ldots, P_k\f$, such that \f$ \cup_{i=1}^{k}{P_k} = P\f$.
 
-\cgalHasModelsBegin CGAL::Small_side_angle_bisector_decomposition_2<Kernel,Container>
-\cgalHasModels CGAL::Optimal_convex_decomposition_2<Kernel,Container>
-\cgalHasModels CGAL::Hertel_Mehlhorn_convex_decomposition_2<Kernel,Container>
-\cgalHasModels CGAL::Greene_convex_decomposition_2<Kernel,Container>
-\cgalHasModels CGAL::Polygon_nop_decomposition_2<Kernel,Container>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Small_side_angle_bisector_decomposition_2<Kernel,Container>}
+\cgalModels{CGAL::Optimal_convex_decomposition_2<Kernel,Container>}
+\cgalModels{CGAL::Hertel_Mehlhorn_convex_decomposition_2<Kernel,Container>}
+\cgalModels{CGAL::Greene_convex_decomposition_2<Kernel,Container>}
+\cgalModels{CGAL::Polygon_nop_decomposition_2<Kernel,Container>}
 \cgalHasModelsEnd
 
 */
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h
index 64b8d0995076..6cf7eb45c35e 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h
@@ -9,8 +9,9 @@ convex sub-polygons \f$ P_1, \ldots, P_k\f$, such that
 
 \cgalRefines{PolygonConvexDecomposition_2}
 
-\cgalHasModelsBegin CGAL::Polygon_vertical_decomposition_2<Kernel,Container>
-\cgalHasModels CGAL::Polygon_triangulation_decomposition_2<Kernel,Container>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polygon_vertical_decomposition_2<Kernel,Container>}
+\cgalModels{CGAL::Polygon_triangulation_decomposition_2<Kernel,Container>}
 \cgalHasModelsEnd
 
 */
diff --git a/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h b/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h
index 1bf64f2a9c94..b3f2543843ff 100644
--- a/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h
+++ b/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h
@@ -9,7 +9,8 @@ function object. It maps objects of its domain type `Key` to
 the integral image type `std::size_t`. The image values have to
 be unique for all keys in the domain type `Key`.
 
-\cgalHasModelsBegin CGAL::Handle_hash_function
+\cgalHasModelsBegin
+\cgalModels{CGAL::Handle_hash_function}
 \cgalHasModelsEnd
 
 \sa `CGAL::Unique_hash_map<Key,Data,UniqueHashFunction>`
diff --git a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h
index 0e0467a9f390..a78fde1730a1 100644
--- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h
+++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h
@@ -8,7 +8,8 @@ In case this associated type is a model of `Modularizable`, this is indicated by
 Boolean tag `ModularTraits::Is_modularizable`. The mapping into the `Residue_type` is
 provided by the functor `ModularTraits::Modular_image`.
 
-\cgalHasModelsBegin CGAL::Modular_traits<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Modular_traits<T>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Residue`
diff --git a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h
index 8db45a2f4287..1d7f832f5d88 100644
--- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h
+++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h
@@ -18,19 +18,21 @@ of denominator, are not `Modularizable`.
 This is due to the fact that the denominator may be zero modulo the prime,
 which can not be represented.
 
-\cgalHasModelsBegin int
-\cgalHasModels long
-\cgalHasModels CORE::BigInt
-\cgalHasModels CGAL::Gmpz
-\cgalHasModels leda_integer
-\cgalHasModels mpz_class
+\cgalHasModelsBegin
+\cgalModels{int}
+\cgalModels{long}
+\cgalModels{CORE::BigInt}
+\cgalModels{CGAL::Gmpz}
+\cgalModels{leda_integer}
+\cgalModels{mpz_class}
 \cgalHasModelsEnd
 
 The following types are `Modularizable` iff their template arguments are.
 
-\cgalHasModelsBegin CGAL::Lazy_exact_nt<NT>
-\cgalHasModels CGAL::Sqrt_extension<NT,ROOT>
-\cgalHasModels CGAL::Polynomial<Coeff>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Lazy_exact_nt<NT>}
+\cgalModels{CGAL::Sqrt_extension<NT,ROOT>}
+\cgalModels{CGAL::Polynomial<Coeff>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Residue`
diff --git a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
index 7161d6725e76..c46d39daa542 100644
--- a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
+++ b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
@@ -38,9 +38,10 @@ functionality for changing between standard affine and extended
 geometry. At the same time it provides extensible geometric primitives
 on the extended geometric objects.
 
-\cgalHasModelsBegin CGAL::Extended_cartesian<FT>
-\cgalHasModels CGAL::Extended_homogeneous<RT>
-\cgalHasModels CGAL::Filtered_extended_homogeneous<RT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Extended_cartesian<FT>}
+\cgalModels{CGAL::Extended_homogeneous<RT>}
+\cgalModels{CGAL::Filtered_extended_homogeneous<RT>}
 \cgalHasModelsEnd
 
 */
diff --git a/Number_types/doc/Number_types/Concepts/RootOf_2.h b/Number_types/doc/Number_types/Concepts/RootOf_2.h
index c29f30b3ab2b..9ae9883f80fe 100644
--- a/Number_types/doc/Number_types/Concepts/RootOf_2.h
+++ b/Number_types/doc/Number_types/Concepts/RootOf_2.h
@@ -30,7 +30,9 @@ special construction for extensions of degree 2:
 \cgalRefines{DefaultConstructible,CopyConstructible,FromIntConstructible,
   ImplicitInteroperable with `RT`,ImplicitInteroperable with `FT`}
 
-\cgalHasModelsBareBegin{`double` (not exact)} CGAL::Sqrt_extension
+\cgalHasModelsBegin
+\cgalHasModelsBare{`double` (not exact)}
+\cgalHasModels{CGAL::Sqrt_extension}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_root_of_2<RT>`
diff --git a/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h b/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h
index fad3d71782a0..40fdf24e2d8f 100644
--- a/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h
+++ b/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h
@@ -8,7 +8,8 @@ a 3x3 matrix type.
 
 \cgalRefines{Kernel}
 
-\cgalHasModelsBegin CGAL::Oriented_bounding_box_traits_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Oriented_bounding_box_traits_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h b/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h
index 39b2c65b4e15..69f33226b2c4 100644
--- a/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h
+++ b/Optimal_transportation_reconstruction_2/doc/Optimal_transportation_reconstruction_2/Concepts/OptimalTransportationReconstructionTraits_2.h
@@ -8,8 +8,10 @@ for the traits class of `CGAL::Optimal_transportation_reconstruction_2`.
 
 \cgalRefines{DelaunayTriangulationTraits_2}
 
-\cgalHasModelsBare{All models of the \cgal concept `Kernel`,
-                   `CGAL::Exact_predicates_inexact_constructions_kernel` (recommended)}
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsBare{`CGAL::Exact_predicates_inexact_constructions_kernel` (recommended)}
+\cgalHasModelsEnd
 
 \sa `CGAL::Optimal_transportation_reconstruction_2`
 
diff --git a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h
index 8b6e0e06631e..83408944f2b5 100644
--- a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h
+++ b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h
@@ -5,9 +5,10 @@
   The concept `OrthtreeTraits` defines the requirements for the
   template parameter of the `CGAL::Orthtree` class.
 
-  \cgalHasModelsBegin galHasModel `CGAL::Orthtree_traits_2<GeomTraits>
-  \cgalHasModels CGAL::Orthtree_traits_3<GeomTraits>
-  \cgalHasModels CGAL::Orthtree_traits_d<GeomTraits,Dimension>
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Orthtree_traits_2<GeomTraits>}
+  \cgalModels{CGAL::Orthtree_traits_3<GeomTraits>}
+  \cgalModels{CGAL::Orthtree_traits_d<GeomTraits,Dimension>}
   \cgalHasModelsEnd
 */
 class OrthtreeTraits
diff --git a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
index c03e9deb2070..851482d8751a 100644
--- a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
+++ b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
@@ -9,10 +9,11 @@
   A traversal is used to iterate on a tree with a user-selected order
   (e.g. preorder, postorder).
 
-  \cgalHasModelsBegin galHasModel `CGAL::Orthtrees::Preorder_traversal
-  \cgalHasModels CGAL::Orthtrees::Postorder_traversal
-  \cgalHasModels CGAL::Orthtrees::Leaves_traversal
-  \cgalHasModels CGAL::Orthtrees::Level_traversal
+  \cgalHasModelsBegin
+  \cgalModels{CGAL::Orthtrees::Preorder_traversal}
+  \cgalModels{CGAL::Orthtrees::Postorder_traversal}
+  \cgalModels{CGAL::Orthtrees::Leaves_traversal}
+  \cgalModels{CGAL::Orthtrees::Level_traversal}
   \cgalHasModelsEnd
  */
 class OrthtreeTraversal {
diff --git a/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h
index ff7c9417c08b..6b9be975123b 100644
--- a/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h
@@ -6,7 +6,8 @@ Requirements of a traits class used
 by `convex_partition_is_valid_2` for testing the validity of a
 convex partition of a polygon.
 
-\cgalHasModelsBegin CGAL::Partition_traits_2<R>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Partition_traits_2<R>}
 \cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h b/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h
index 0c0d7e3fc974..112995c86f11 100644
--- a/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h
@@ -6,8 +6,9 @@ Requirements of a traits class to be
 used with the function `is_y_monotone_2()` that tests whether a sequence of
 2D points defines a \f$ y\f$-monotone polygon or not.
 
-\cgalHasModelsBegin CGAL::Partition_traits_2<R>
-\cgalHasModels CGAL::Kernel_traits_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Partition_traits_2<R>}
+\cgalModels{CGAL::Kernel_traits_2}
 \cgalHasModelsEnd
 
 \sa `CGAL::Is_y_monotone_2<Traits>`
diff --git a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h
index 85676075bb4e..1ef70344a2d6 100644
--- a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h
@@ -8,7 +8,8 @@ an optimal convex partition of a polygon.
 
 \cgalRefines{PartitionTraits_2}
 
-\cgalHasModelsBegin CGAL::Partition_traits_2<R>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Partition_traits_2<R>}
 \cgalHasModelsEnd
 
 \sa `CGAL::convex_partition_is_valid_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h
index b91ad8109352..7edbe6dcde6d 100644
--- a/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h
@@ -14,7 +14,8 @@ function `CGAL::is_convex_2()`
 and the concept `YMonotonePartitionTraits_2` for the additional requirements
 for testing for convexity and \f$ y\f$-monotonicity, respectively.
 
-\cgalHasModelsBegin CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>}
 \cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h b/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h
index 2ad93228b1bf..910d565cf10a 100644
--- a/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h
@@ -8,7 +8,8 @@ common
 to all traits classes. The concept `PartitionTraits_2` defines this common set of
 requirements.
 
-\cgalHasModelsBegin CGAL::Partition_traits_2<R>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Partition_traits_2<R>}
 \cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h b/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h
index ab72c01a9f09..662bdb369a91 100644
--- a/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h
+++ b/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h
@@ -6,8 +6,9 @@ Function object that determines if a sequence of points represents a
 valid partition polygon or not, where "valid" can assume any of several
 meanings (e.g., convex or \f$ y\f$-monotone).
 
-\cgalHasModelsBegin CGAL::Is_convex_2<Traits>
-\cgalHasModels CGAL::Is_y_monotone_2<Traits>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Is_convex_2<Traits>}
+\cgalModels{CGAL::Is_y_monotone_2<Traits>}
 \cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h
index 6212b11620a4..7869a2122e90 100644
--- a/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h
@@ -6,7 +6,8 @@ Requirements of a traits class that is used
 by `y_monotone_partition_is_valid_2` for testing the validity of a
 \f$ y\f$-monotone partition of a polygon.
 
-\cgalHasModelsBegin CGAL::Partition_traits_2<R>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Partition_traits_2<R>}
 \cgalHasModelsEnd
 
 \sa `CGAL::partition_is_valid_2()`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h
index bda0b95ab293..0ae4f0fedcf7 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h
@@ -27,7 +27,8 @@ dual functions are called. The additional predicate type
 `::Periodic_2DelaunayTriangulationTraits_2::Compare_distance_2` is required if calls to
 `nearest_vertex(..)` are issued.
 
-\cgalHasModelsBegin CGAL::Periodic_2_Delaunay_triangulation_traits_2<Traits, Offset>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_2_Delaunay_triangulation_traits_2<Traits, Offset>}
 \cgalHasModelsEnd
 
 \sa `DelaunayTriangulationTraits_2`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h
index 56d28d5a2171..172f176c7cfc 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h
@@ -7,7 +7,8 @@
 
 The concept `Periodic_2Offset_2` describes a two-/dimensional integer vector with some specialized access functions and operations.
 
-\cgalHasModelsBegin CGAL::Periodic_2_offset_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_2_offset_2}
 \cgalHasModelsEnd
 
 \sa `Periodic_2TriangulationTraits_2`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h
index 96769827f334..da6b89b93a27 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h
@@ -13,7 +13,8 @@ vertex \f$ i\f$.
 
 \cgalRefines{TriangulationFaceBase_2}
 
-\cgalHasModelsBegin CGAL::Periodic_2_triangulation_face_base_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_2_triangulation_face_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h
index 58dad3ed62d0..1d93a35edbef 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h
@@ -24,7 +24,8 @@ In addition to the requirements described for the traits class
 Periodic triangulation must fulfill the following
 requirements:
 
-\cgalHasModelsBegin CGAL::Periodic_2_triangulation_traits_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_2_triangulation_traits_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationTraits_2`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h
index 33d799fec248..eeae18dcd70e 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h
@@ -16,7 +16,8 @@ The storage of the offset is only needed when a triangulation is copied.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModelsBegin CGAL::Periodic_2_triangulation_vertex_base_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_2_triangulation_vertex_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h
index 2794a7f365ae..73f7d1339a52 100644
--- a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h
+++ b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h
@@ -22,7 +22,8 @@ Wrapping any model of `Periodic_3MeshDomain_3` with the class
 `CGAL::Mesh_domain_with_polyline_features_3` gives a model
 of `Periodic_3MeshDomainWithFeatures_3`.
 
-\cgalHasModelsBegin CGAL::Mesh_domain_with_polyline_features_3<CGAL::Labeled_mesh_domain_3<BGT> >
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_domain_with_polyline_features_3<CGAL::Labeled_mesh_domain_3<BGT> >}
 \cgalHasModelsEnd
 
 \sa `CGAL::Periodic_3_function_wrapper<Function,BGT>`
diff --git a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h
index 63170e01edb0..b92341527b91 100644
--- a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h
+++ b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h
@@ -20,7 +20,8 @@ The class `CGAL::Labeled_mesh_domain_3<BGT>` paired with a periodic labeling fun
 is a model of this concept. It is possible to create artificially periodic functions
 through the class `CGAL::Periodic_3_function_wrapper<Function,BGT>`.
 
-\cgalHasModelsBegin CGAL::Labeled_mesh_domain_3<BGT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Labeled_mesh_domain_3<BGT>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Labeled_mesh_domain_3<BG>`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h
index 1d72f2281804..571b9a0fa981 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h
@@ -15,7 +15,8 @@ functor the version without offsets.
 
 \cgalRefines{Periodic_3TriangulationTraits_3,DelaunayTriangulationTraits_3}
 
-\cgalHasModelsBegin CGAL::Periodic_3_Delaunay_triangulation_traits_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_3_Delaunay_triangulation_traits_3}
 \cgalHasModelsEnd
 
 In addition to the requirements described by the concepts
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h
index b5a467b4cd82..2cb71cf9bcc4 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h
@@ -6,7 +6,8 @@
 The concept `Periodic_3Offset_3` describes a three-dimensional integer vector
 with some specialized access functions and operations.
 
-\cgalHasModelsBegin CGAL::Periodic_3_offset_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_3_offset_3}
 \cgalHasModelsEnd
 
 \sa `Periodic_3TriangulationTraits_3`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h
index 29c9fae1dc68..05b10c71e021 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h
@@ -5,8 +5,9 @@
 
 \cgalRefines{RegularTriangulationCellBase_3,Periodic_3TriangulationDSCellBase_3}
 
-\cgalHasModelsBegin CGAL::Regular_triangulation_cell_base_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_cell_base_3< > >
-\cgalHasModels CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_cell_base_3< > >
+\cgalHasModelsBegin
+\cgalModels{CGAL::Regular_triangulation_cell_base_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_cell_base_3< > >}
+\cgalModels{CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_cell_base_3< > >}
 \cgalHasModelsEnd
 
 The template parameter `Periodic_3RegularTriangulationTraits_3` is expected to be the same as the
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h
index 8f5ce76dab56..be6214920cb8 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h
@@ -5,7 +5,8 @@
 
 \cgalRefines{RegularTriangulationVertexBase_3,Periodic_3TriangulationDSVertexBase_3}
 
-\cgalHasModelsBegin CGAL::Regular_triangulation_vertex_base_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_vertex_base_3< > >
+\cgalHasModelsBegin
+\cgalModels{CGAL::Regular_triangulation_vertex_base_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_vertex_base_3< > >}
 \cgalHasModelsEnd
 
 The template parameter `Periodic_3RegularTriangulationTraits_3` is expected to be the same as the
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h
index c128b08f82e9..cdc5a72ead57 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h
@@ -15,7 +15,8 @@ functor the version without offsets.
 
 \cgalRefines{Periodic_3TriangulationTraits_3,RegularTriangulationTraits_3}
 
-\cgalHasModelsBegin CGAL::Periodic_3_regular_triangulation_traits_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_3_regular_triangulation_traits_3}
 \cgalHasModelsEnd
 
 In addition to the requirements described for the traits class
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h
index 9f575b848695..d6e735e497fd 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h
@@ -18,7 +18,8 @@ does not contain any information.
 
 \cgalRefines{TriangulationDSCellBase_3}
 
-\cgalHasModelsBegin CGAL::Periodic_3_triangulation_ds_cell_base_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_3_triangulation_ds_cell_base_3}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_3`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h
index 14b032fc1bc0..2665d89bdefa 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h
@@ -12,7 +12,8 @@ a vertex provides access to one of its incident cells through a handle.
 
 \cgalRefines{TriangulationDSVertexBase_3}
 
-\cgalHasModelsBegin CGAL::Periodic_3_triangulation_ds_vertex_base_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_3_triangulation_ds_vertex_base_3}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_3`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h
index ace2ebb8199b..67b8f33a78a5 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h
@@ -14,7 +14,8 @@ functor the version without offsets.
 
 \cgalRefines{TriangulationTraits_3}
 
-\cgalHasModelsBegin CGAL::Periodic_3_triangulation_traits_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_3_triangulation_traits_3}
 \cgalHasModelsEnd
 
 \sa `Periodic_3DelaunayTriangulationTraits_3`
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h
index 7532e1b0797d..77501fa9399d 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h
@@ -12,7 +12,8 @@ to `Periodic_4HyperbolicTriangulationTraits_2` that needs to be fulfilled
 by any class used to instantiate the first template parameter of the class
 `CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_2`.
 
-\cgalHasModelsBegin CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_traits_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_traits_2}
 \cgalHasModelsEnd
 */
 
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h
index 9766710af1ed..92d62dfeeb2e 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h
@@ -20,7 +20,8 @@ corresponding vertex produces the canonical representative of the face in the hy
 Hyperbolic translations are represented by a nested type which is provided by the concept
 `Periodic_4HyperbolicDelaunayTriangulationTraits_2`.
 
-\cgalHasModelsBegin CGAL::Periodic_4_hyperbolic_triangulation_face_base_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_4_hyperbolic_triangulation_face_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h
index eb8bfe0b89dd..40b3cb0d34bc 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h
@@ -14,7 +14,8 @@ translation during the insertion process.
 A boolean flag indicates whether the face stores a translation or not. The value of the flag is automatically
 set when storing or removing a translation.
 
-\cgalHasModelsBegin CGAL::Periodic_4_hyperbolic_triangulation_vertex_base_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Periodic_4_hyperbolic_triangulation_vertex_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h
index f17b26f951ae..6f58a4de0e89 100644
--- a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h
+++ b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h
@@ -8,8 +8,9 @@
  * represents the outer boundary and the general polygons that represent
  * the holes.
  *
- * \cgalHasModelsBegin CGAL::General_polygon_with_holes_2<Polygon>
- * \cgalHasModels CGAL::Polygon_with_holes_2<Kernel,Container>
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::General_polygon_with_holes_2<Polygon>}
+ * \cgalModels{CGAL::Polygon_with_holes_2<Kernel,Container>}
  * \cgalHasModelsEnd
  */
 
diff --git a/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h b/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h
index 068194985bce..639ed921bb7a 100644
--- a/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h
+++ b/Polygon/doc/Polygon/Concepts/PolygonTraits_2.h
@@ -14,9 +14,11 @@ and refer to the description of the kernel concept for details.
 
 \cgalRefines{DefaultConstructible,CopyConstructable}
 
-\cgalHasModelsBareBegin{The kernels supplied by \cgal are models of `PolygonTraits_2`} CGAL::Projection_traits_xy_3<K>
-\cgalHasModels CGAL::Projection_traits_yz_3<K>
-\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsBegin
+\cgalHasModelsBare{The kernels supplied by \cgal are models of `PolygonTraits_2`}
+\cgalHasModels{CGAL::Projection_traits_xy_3<K>}
+\cgalHasModels{CGAL::Projection_traits_yz_3<K>}
+\cgalHasModels{CGAL::Projection_traits_xz_3<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Polygon_2<PolygonTraits_2, Container>`
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
index facce5d714b0..683f7f581368 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
@@ -6,7 +6,8 @@
 /// the creation of new faces and new edges.
 ///
 /// \cgalRefines{CopyConstructible}
-/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Corefinement::Default_visitor
+/// \cgalHasModelsBegin
+/// \cgalModels{CGAL::Polygon_mesh_processing::Corefinement::Default_visitor}
 /// \cgalHasModelsEnd
 
 class PMPCorefinementVisitor{
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h
index ec9839512208..c0b9c41ebe77 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h
@@ -7,7 +7,9 @@
 /// `sample_triangle_mesh()`, `approximate_Hausdorff_distance()` and `max_distance_to_triangle_mesh()`
 ///
 /// \cgalRefines{AABBGeomTraits,SpatialSortingTraits_3}
+/// \cgalHasModelsBegin
 /// \cgalHasModelsBare{Any 3D Kernel is a model of this concept}
+/// \cgalHasModelsEnd
 
 class PMPDistanceTraits{
 public:
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h
index 11af2abad0fd..e524ca75ffe9 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h
@@ -9,7 +9,8 @@
 /// If that fails, it uses an algorithm with cubic running time (*cubic phase*).
 ///
 /// \cgalRefines{CopyConstructible}
-/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor
+/// \cgalHasModelsBegin
+/// \cgalModels{CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor}
 /// \cgalHasModelsEnd
 
 class PMPHolefillingVisitor{
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h
index d0597a5c90e5..0016e1cb8655 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h
@@ -7,7 +7,8 @@
 /// during the orientation process.
 ///
 /// \cgalRefines{CopyConstructible}
-/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Default_orientation_visitor
+/// \cgalHasModelsBegin
+/// \cgalModels{CGAL::Polygon_mesh_processing::Default_orientation_visitor}
 /// \cgalHasModelsEnd
 
 class PMPPolygonSoupOrientationVisitor{
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h
index a8c885e7b13d..3bc52ba8786e 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h
@@ -6,7 +6,8 @@
 /// the creation of new faces.
 ///
 /// \cgalRefines{CopyConstructible}
-/// \cgalHasModelsBegin CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor
+/// \cgalHasModelsBegin
+/// \cgalModels{CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor}
 /// \cgalHasModelsEnd
 
 
diff --git a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h
index 31e6b981de25..d75b5d0b491e 100644
--- a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h
+++ b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h
@@ -13,9 +13,10 @@ polyhedral surface renames faces to facets.
 
 \cgalRefines{HalfedgeDSItems}
 
-\cgalHasModelsBegin CGAL::Polyhedron_items_3
-\cgalHasModels CGAL::Polyhedron_min_items_3
-\cgalHasModels CGAL::Polyhedron_items_with_id_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polyhedron_items_3}
+\cgalModels{CGAL::Polyhedron_min_items_3}
+\cgalModels{CGAL::Polyhedron_items_with_id_3}
 \cgalHasModelsEnd
 
 \sa `CGAL::Polyhedron_3<Traits>`
diff --git a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h
index 5dc824c7d553..39c4476cf7b4 100644
--- a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h
+++ b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronTraits_3.h
@@ -10,8 +10,10 @@ and can be used directly as template argument.
 
 \cgalRefines{CopyConstructible,Assignable}
 
-\cgalHasModelsBareBegin{All models of the `Kernel` concept, e.g. `CGAL::Simple_cartesian<FieldNumberType>`} CGAL::Polyhedron_traits_3<Kernel>
-\cgalHasModels CGAL::Polyhedron_traits_with_normals_3<Kernel>
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the `Kernel` concept, e.g. `CGAL::Simple_cartesian<FieldNumberType>`}
+\cgalHasModels{CGAL::Polyhedron_traits_3<Kernel>}
+\cgalHasModels{CGAL::Polyhedron_traits_with_normals_3<Kernel>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Polyhedron_3<Traits>`
diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
index 525753e4c75a..bf8fb4b60ab6 100644
--- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
+++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
@@ -12,9 +12,10 @@ preserve the overall polyline set shape as much as possible
 
 \cgalRefines{CopyConstructible,Assignable}
 
-\cgalHasModelsBegin CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost
-\cgalHasModels CGAL::Polyline_simplification_2::Scaled_squared_distance_cost
-\cgalHasModels CGAL::Polyline_simplification_2::Squared_distance_cost
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost}
+\cgalModels{CGAL::Polyline_simplification_2::Scaled_squared_distance_cost}
+\cgalModels{CGAL::Polyline_simplification_2::Squared_distance_cost}
 \cgalHasModelsEnd
 
 */
diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h
index bb5b1d98948d..5d95499fd69c 100644
--- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h
+++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h
@@ -5,9 +5,10 @@
 Models of this concept are passed to the polyline simplification algorithm to indicate
 when to stop the process.
 
-\cgalHasModelsBegin CGAL::Polyline_simplification_2::Stop_below_count_ratio_threshold
-\cgalHasModels CGAL::Polyline_simplification_2::Stop_below_count_threshold
-\cgalHasModels CGAL::Polyline_simplification_2::Stop_above_cost_threshold
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polyline_simplification_2::Stop_below_count_ratio_threshold}
+\cgalModels{CGAL::Polyline_simplification_2::Stop_below_count_threshold}
+\cgalModels{CGAL::Polyline_simplification_2::Stop_above_cost_threshold}
 \cgalHasModelsEnd
 */
 
diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h
index 20aff75a93bd..e4d8d079a59d 100644
--- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h
+++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h
@@ -8,7 +8,8 @@ whether a vertex can be removed, and the cost of the removal.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModelsBegin CGAL::Polyline_simplification_2::Vertex_base_2<Vb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polyline_simplification_2::Vertex_base_2<Vb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationFaceBase_2`
diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h
index 7ce0406f0644..c1c13ad96405 100644
--- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h
+++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h
@@ -31,7 +31,8 @@ is possible to select a certain variable.
 
 \sa `Polynomial_d`
 
-\cgalHasModelsBegin CGAL::Polynomial_traits_d<Polynomial_d>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polynomial_traits_d<Polynomial_d>}
 \cgalHasModelsEnd
 
 */
diff --git a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
index 6a5a0c84a05f..2b41053230e8 100644
--- a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
+++ b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
@@ -32,7 +32,8 @@ coefficient is a `Field` the polynomial is model of `EuclideanRing`.
 \sa `AlgebraicStructureTraits`
 \sa `PolynomialTraits_d`
 
-\cgalHasModelsBegin CGAL::Polynomial<Coeff>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polynomial<Coeff>}
 \cgalHasModelsEnd
 
 */
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h
index 64c1383c051f..a0b89952bc07 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h
@@ -7,10 +7,11 @@ The concept `AllFurthestNeighborsTraits_2` defines types and operations
 needed to compute all furthest neighbors for the vertices of a
 convex polygon using the function `all_furthest_neighbors_2()`.
 
-\cgalHasModelsBegin CGAL::Cartesian<FieldNumberType>
-\cgalHasModels CGAL::Homogeneous<RingNumberType>
-\cgalHasModels CGAL::Simple_cartesian<FieldNumberType>
-\cgalHasModels CGAL::Simple_homogeneous<RingNumberType>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Cartesian<FieldNumberType>}
+\cgalModels{CGAL::Homogeneous<RingNumberType>}
+\cgalModels{CGAL::Simple_cartesian<FieldNumberType>}
+\cgalModels{CGAL::Simple_homogeneous<RingNumberType>}
 \cgalHasModelsEnd
 
 \sa `CGAL::all_furthest_neighbors_2()`
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h
index 34286f63b4bc..1198e0d98698 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h
@@ -6,9 +6,10 @@
 This concept defines the requirements for traits classes of \f$ d\f$-dimensional
 optimisation algorithms.
 
-\cgalHasModelsBegin CGAL::Polytope_distance_d_traits_2<K,ET,NT>
-\cgalHasModels CGAL::Polytope_distance_d_traits_3<K,ET,NT>
-\cgalHasModels CGAL::Polytope_distance_d_traits_d<K,ET,NT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polytope_distance_d_traits_2<K,ET,NT>}
+\cgalModels{CGAL::Polytope_distance_d_traits_3<K,ET,NT>}
+\cgalModels{CGAL::Polytope_distance_d_traits_d<K,ET,NT>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Polytope_distance_d<Traits>`
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h
index 5794f4716580..7295ea2e2969 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h
@@ -12,7 +12,8 @@ Whatever the coordinates of the points are, it is required for the
 width-algorithm to have access to the homogeneous representation of
 points.
 
-\cgalHasModelsBegin CGAL::Width_default_traits_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Width_default_traits_3}
 \cgalHasModelsEnd
 
 \sa `CGAL::Width_3<Traits>`
diff --git a/QP_solver/doc/QP_solver/Concepts/LinearProgram.h b/QP_solver/doc/QP_solver/Concepts/LinearProgram.h
index 1882b05c73ee..206dbdb1a578 100644
--- a/QP_solver/doc/QP_solver/Concepts/LinearProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/LinearProgram.h
@@ -35,9 +35,10 @@ The description is given by appropriate <I>random-access</I>
 iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
-\cgalHasModelsBegin CGAL::Quadratic_program<NT>
-\cgalHasModels CGAL::Quadratic_program_from_mps<NT>
-\cgalHasModels CGAL::Linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Quadratic_program<NT>}
+\cgalModels{CGAL::Quadratic_program_from_mps<NT>}
+\cgalModels{CGAL::Linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
 \cgalHasModelsEnd
 
 
diff --git a/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h b/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h
index 0e4c2928cec3..e9bbee8dadde 100644
--- a/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h
@@ -29,18 +29,20 @@ The description is given by appropriate <I>random-access</I>
 iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
-\cgalHasModelsBegin CGAL::Quadratic_program<NT>
-\cgalHasModels CGAL::Quadratic_program_from_mps<NT>
-\cgalHasModels CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Quadratic_program<NT>}
+\cgalModels{CGAL::Quadratic_program_from_mps<NT>}
+\cgalModels{CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
 \cgalHasModelsEnd
 
 The value types of all iterator types (nested iterator
 types, respectively, for `A_iterator`) must be convertible to some
 common `IntegralDomain` `ET`.
 
-\cgalHasModelsBegin CGAL::Quadratic_program<NT>
-\cgalHasModels CGAL::Quadratic_program_from_mps<NT>
-\cgalHasModels CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, C_it>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Quadratic_program<NT>}
+\cgalModels{CGAL::Quadratic_program_from_mps<NT>}
+\cgalModels{CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, C_it>}
 \cgalHasModelsEnd
 
 \sa `QuadraticProgram`
diff --git a/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h b/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h
index f531f27550c4..508ac094f4ab 100644
--- a/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h
@@ -33,9 +33,10 @@ The description is given by appropriate <I>random-access</I>
 iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
-\cgalHasModelsBegin CGAL::Quadratic_program<NT>
-\cgalHasModels CGAL::Quadratic_program_from_mps<NT>
-\cgalHasModels CGAL::Nonnegative_quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Quadratic_program<NT>}
+\cgalModels{CGAL::Quadratic_program_from_mps<NT>}
+\cgalModels{CGAL::Nonnegative_quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
 \cgalHasModelsEnd
 
 The value types of all iterator types (nested iterator
diff --git a/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h b/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h
index e25310153888..3b3ebe86f274 100644
--- a/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h
@@ -34,9 +34,10 @@ The description is given by appropriate <I>random-access</I>
 iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
-\cgalHasModelsBegin CGAL::Quadratic_program<NT>
-\cgalHasModels CGAL::Quadratic_program_from_mps<NT>
-\cgalHasModels CGAL::Quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Quadratic_program<NT>}
+\cgalModels{CGAL::Quadratic_program_from_mps<NT>}
+\cgalModels{CGAL::Quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
 \cgalHasModelsEnd
 
 The value types of all iterator types (nested iterator
diff --git a/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h b/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h
index 1359f35074e4..e29abc65d3b3 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h
@@ -48,7 +48,8 @@ of the input complex.
 
 \cgalRefines{MeshComplex_3InTriangulation_3}
 
-\cgalHasModelsBegin CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>}
 \cgalHasModelsEnd
 
 \sa `MeshComplex_3InTriangulation_3`
diff --git a/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h b/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h
index fa640570e27e..2bd6bf5d8e85 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h
@@ -42,7 +42,8 @@ the current approximation of each subdomain
 and each boundary surface patch.
 The data structure encodes the final mesh at the end of the meshing process.
 
-\cgalHasModelsBegin CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>}
 \cgalHasModelsEnd
 
 \sa `MeshDomain_3`
diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
index 50ac974f9797..37c1aa8a1dfa 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
@@ -18,10 +18,11 @@ of the triangulation that are surface facets.
 
 \cgalRefines{TriangulationCellBase_3,CopyConstructible}
 
-\cgalHasModelsBegin CGAL::Compact_mesh_cell_base_3
-\cgalHasModels CGAL::Mesh_cell_base_3
-\cgalHasModels CGAL::Simplicial_mesh_cell_base_3
-\cgalHasModels CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Compact_mesh_cell_base_3}
+\cgalModels{CGAL::Mesh_cell_base_3}
+\cgalModels{CGAL::Simplicial_mesh_cell_base_3}
+\cgalModels{CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3}
 \cgalHasModelsEnd
 
 */
diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
index 938ce50e7e27..accc2c9b77a8 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
@@ -16,9 +16,10 @@ and to an index characteristic of this face.
 
 \cgalRefines{TriangulationVertexBase_3}
 
-\cgalHasModelsBegin CGAL::Mesh_vertex_base_3
-\cgalHasModels CGAL::Simplicial_mesh_vertex_base_3
-\cgalHasModels CGAL::Tetrahedral_remeshing::Remeshing_vertex_base_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mesh_vertex_base_3}
+\cgalModels{CGAL::Simplicial_mesh_vertex_base_3}
+\cgalModels{CGAL::Tetrahedral_remeshing::Remeshing_vertex_base_3}
 \cgalHasModelsEnd
 
 */
diff --git a/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h b/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h
index 4c700b18520a..900c6874eb39 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h
@@ -6,8 +6,9 @@ The concept `Descriptor` allows to describe a unique object in an abstract model
 
 \cgalRefines{DefaultConstructible,CopyConstructible,Assignable,EqualityComparable}
 
-\cgalHasModelsBegin Index
-\cgalHasModels Handle
+\cgalHasModelsBegin
+\cgalModels{Index}
+\cgalModels{Handle}
 \cgalHasModelsEnd
 */
 
diff --git a/STL_Extension/doc/STL_Extension/Concepts/Hashable.h b/STL_Extension/doc/STL_Extension/Concepts/Hashable.h
index ab5c0429a90e..7dffe7cd9176 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/Hashable.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/Hashable.h
@@ -6,8 +6,10 @@
 A type `Key` is a model of the concept `Hashable` if the
 specializations `boost::hash<Key>` and `std::hash<Key>` exist.
 
-\cgalHasModelsBare{All handles and indices of \cgal data structures,
-    All handles of OpenMesh\, by including the specializations of the `graph_traits` header files provided by \cgal. They can be disables by defining the macro `CGAL_DISABLE_HASH_OPENMESH`.}
+\cgalHasModelsBegin
+\cgalHasModelsBare{All handles and indices of \cgal data structures}
+\cgalHasModelsBare{All handles of OpenMesh\, by including the specializations of the `graph_traits` header files provided by \cgal. They can be disables by defining the macro `CGAL_DISABLE_HASH_OPENMESH`.}
+\cgalHasModelsEnd
 
 \sa `CGAL::Unique_hash_map<Key,Mapped,Hash>`
 \sa <A HREF="https://en.cppreference.com/w/cpp/container/unordered_set">`std::unordered_set`</a>
diff --git a/STL_Extension/doc/STL_Extension/Concepts/Index.h b/STL_Extension/doc/STL_Extension/Concepts/Index.h
index c94791cd287b..4a3c749305d4 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/Index.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/Index.h
@@ -6,8 +6,9 @@ The concept `Index` is a refinement of `Descriptor` which must be convertible fr
 
 \cgalRefines{Descriptor}
 
-\cgalHasModelsBegin int
-\cgalHasModels size_t
+\cgalHasModelsBegin
+\cgalModels{int}
+\cgalModels{size_t}
 \cgalHasModelsEnd
 
 \cgalHeading{Notation}
diff --git a/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h b/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h
index 00f421a6c679..55cd05e95da2 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h
@@ -12,19 +12,20 @@ The concept `ProjectionObject` is modeled after the STL
 concept `UnaryFunction`, but takes also care of (const)
 references.
 
-\cgalHasModelsBegin CGAL::Identity
-\cgalHasModels CGAL::Dereference
-\cgalHasModels CGAL::Get_address
-\cgalHasModels CGAL::Cast_function_object
-\cgalHasModels CGAL::Project_vertex
-\cgalHasModels CGAL::Project_facet
-\cgalHasModels CGAL::Project_point
-\cgalHasModels CGAL::Project_normal
-\cgalHasModels CGAL::Project_plane
-\cgalHasModels CGAL::Project_next
-\cgalHasModels CGAL::Project_prev
-\cgalHasModels CGAL::Project_next_opposite
-\cgalHasModels CGAL::Project_opposite_prev
+\cgalHasModelsBegin
+\cgalModels{CGAL::Identity}
+\cgalModels{CGAL::Dereference}
+\cgalModels{CGAL::Get_address}
+\cgalModels{CGAL::Cast_function_object}
+\cgalModels{CGAL::Project_vertex}
+\cgalModels{CGAL::Project_facet}
+\cgalModels{CGAL::Project_point}
+\cgalModels{CGAL::Project_normal}
+\cgalModels{CGAL::Project_plane}
+\cgalModels{CGAL::Project_next}
+\cgalModels{CGAL::Project_prev}
+\cgalModels{CGAL::Project_next_opposite}
+\cgalModels{CGAL::Project_opposite_prev}
 \cgalHasModelsEnd
 
 
diff --git a/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h b/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h
index 02e8a3211506..89f447da3b52 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h
@@ -21,7 +21,8 @@ We call `S` the surjective function such that `S(object)`
 is the \"thing\" that is locked when one tries to lock `object`.
 In the previous example, `S(point)` is the voxel containing `point`.
 
-\cgalHasModelsBegin CGAL::Spatial_lock_grid_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Spatial_lock_grid_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h
index 35367ad681fd..64979029e178 100644
--- a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h
+++ b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h
@@ -11,8 +11,9 @@ namespace Scale_space_reconstruction_3 {
  * A mesher is a functor that can be applied to a range of
  * points and that returns a set of facets.
  *
- * \cgalHasModelsBegin CGAL::Scale_space_reconstruction_3::Alpha_shape_mesher
- * \cgalHasModels CGAL::Scale_space_reconstruction_3::Advancing_front_mesher
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Scale_space_reconstruction_3::Alpha_shape_mesher}
+ * \cgalModels{CGAL::Scale_space_reconstruction_3::Advancing_front_mesher}
  * \cgalHasModelsEnd
  *
  */
diff --git a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h
index 326cc4ff2df8..8eaa935ce3c9 100644
--- a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h
+++ b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h
@@ -15,8 +15,9 @@ namespace Scale_space_reconstruction_3 {
  * \note the functor can be applied several times by the scale space
  * reconstruction algorithm.
  *
- * \cgalHasModelsBegin CGAL::Scale_space_reconstruction_3::Weighted_PCA_smoother
- * \cgalHasModels CGAL::Scale_space_reconstruction_3::Jet_smoother
+ * \cgalHasModelsBegin
+ * \cgalModels{CGAL::Scale_space_reconstruction_3::Weighted_PCA_smoother}
+ * \cgalModels{CGAL::Scale_space_reconstruction_3::Jet_smoother}
  * \cgalHasModelsEnd
  */
 class Smoother
diff --git a/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h b/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h
index f61385ec5896..75e97ae287bf 100644
--- a/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h
+++ b/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h
@@ -9,12 +9,13 @@ the keys and intervals, and provide comparison functions that
 are needed for window queries.
 
 
-\cgalHasModelsBegin CGAL::Range_segment_tree_set_traits_2
-\cgalHasModels CGAL::Range_segment_tree_set_traits_3
-\cgalHasModels CGAL::Range_tree_map_traits_2
-\cgalHasModels CGAL::Range_tree_map_traits_3
-\cgalHasModels CGAL::Segment_tree_map_traits_2
-\cgalHasModels CGAL::Segment_tree_map_traits_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Range_segment_tree_set_traits_2}
+\cgalModels{CGAL::Range_segment_tree_set_traits_3}
+\cgalModels{CGAL::Range_tree_map_traits_2}
+\cgalModels{CGAL::Range_tree_map_traits_3}
+\cgalModels{CGAL::Segment_tree_map_traits_2}
+\cgalModels{CGAL::Segment_tree_map_traits_3}
 \cgalHasModelsEnd
 
 \cgalHeading{Example}
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
index f5be21ae15ea..15c80be49e4b 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
@@ -33,7 +33,8 @@ We only describe the additional requirements with respect to the
 
 \cgalRefines{ApolloniusGraphDataStructure_2}
 
-\cgalHasModelsBegin CGAL::Triangulation_data_structure_2<Vb,Fb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_data_structure_2<Vb,Fb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h
index ee8181103a40..4ae9eec2503c 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h
@@ -9,7 +9,8 @@ requirements for the face base class of the
 
 \cgalRefines{TriangulationFaceBase_2}
 
-\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_face_base_2<Gt>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Segment_Delaunay_graph_face_base_2<Gt>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphDataStructure_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h
index d53cbd55ccf5..d7a281a8d811 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h
@@ -26,7 +26,8 @@ The `SegmentDelaunayGraphHierarchyVertexBase_2` concept does not
 introduce any constructors in addition to those of the
 `SegmentDelaunayGraphVertexBase_2` concept.
 
-\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2<CGAL::Segment_Delaunay_graph_vertex_base_2<St> >
+\cgalHasModelsBegin
+\cgalModels{CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2<CGAL::Segment_Delaunay_graph_vertex_base_2<St> >}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphDataStructure_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h
index 99d6bf2ca9ee..65002722e6d7 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h
@@ -8,7 +8,8 @@ requirements for the sites of a segment Delaunay graph.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_site_2<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Segment_Delaunay_graph_site_2<K>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h
index d79098a554c1..fbe6887f2eb0 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h
@@ -11,7 +11,8 @@ by storing handles to points instead of points.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_storage_site_2<Gt>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Segment_Delaunay_graph_storage_site_2<Gt>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h
index e4866423c159..e733426405d3 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h
@@ -15,7 +15,8 @@ See section \ref Segment_Delaunay_graph_2StronglyIntersecting for more informati
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_storage_traits_2<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Segment_Delaunay_graph_storage_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h
index 78e56ed2f6cf..7297c1db8316 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h
@@ -14,10 +14,11 @@ the concept `SegmentDelaunayGraphSite_2`. It also provides
 constructions for sites and several function object
 types for the predicates.
 
-\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_traits_2<K,MTag>
-\cgalHasModels CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>
-\cgalHasModels CGAL::Segment_Delaunay_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>
-\cgalHasModels CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Segment_Delaunay_graph_traits_2<K,MTag>}
+\cgalModels{CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>}
+\cgalModels{CGAL::Segment_Delaunay_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>}
+\cgalModels{CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphSite_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h
index 48097737f247..32b0b36ab17d 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h
@@ -11,7 +11,8 @@ requirements for the vertex base class of the
 site of the segment Delaunay graph and provides access to one of its
 incident faces through a `Face_handle`.
 
-\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_vertex_base_2<St>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Segment_Delaunay_graph_vertex_base_2<St>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
diff --git a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h
index 4a8ec7f78fc8..a384691661af 100644
--- a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h
+++ b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h
@@ -36,10 +36,11 @@ with respect to the
 
 \cgalRefines{SegmentDelaunayGraphTraits_2}
 
-\cgalHasModelsBegin CGAL::Segment_Delaunay_graph_Linf_traits_2<K,MTag>
-\cgalHasModels CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2<K,MTag>
-\cgalHasModels CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2<CK,CM,EK,EM,FK,FM>
-\cgalHasModels CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Segment_Delaunay_graph_Linf_traits_2<K,MTag>}
+\cgalModels{CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2<K,MTag>}
+\cgalModels{CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2<CK,CM,EK,EM,FK,FM>}
+\cgalModels{CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphSite_2`
diff --git a/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h b/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h
index cb1e7eed119a..1322002cd6d3 100644
--- a/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h
+++ b/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h
@@ -7,7 +7,9 @@
 
   \cgalRefines{DefaultConstructible,PolygonTraits_2}
 
+  \cgalHasModelsBegin
   \cgalHasModelsBare{Any CGAL kernel, e.g., CGAL::Exact_predicates_exact_constructions_kernel.}
+  \cgalHasModelsEnd
 
 */
 
diff --git a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
index e581f066cb63..9005865d80e9 100644
--- a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
+++ b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
@@ -12,7 +12,8 @@ input data has to be provided in form of a random access iterator.
 Point and normal property maps have to be provided to extract the points
 and the normals from the input.
 
-\cgalHasModelsBegin CGAL::Shape_detection::Efficient_RANSAC_traits
+\cgalHasModelsBegin
+\cgalModels{CGAL::Shape_detection::Efficient_RANSAC_traits}
 \cgalHasModelsEnd
 */
 class EfficientRANSACTraits{
diff --git a/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h b/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h
index 88df769ec099..76926590b35f 100644
--- a/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h
+++ b/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h
@@ -5,10 +5,11 @@
 A concept that describes the set of methods used by the `CGAL::Shape_detection::Region_growing`
 to access neighbors of an item.
 
-\cgalHasModelsBegin CGAL::Shape_detection::Point_set::K_neighbor_query
-\cgalHasModels CGAL::Shape_detection::Point_set::Sphere_neighbor_query
-\cgalHasModels CGAL::Shape_detection::Polygon_mesh::Polyline_graph
-\cgalHasModels CGAL::Shape_detection::Polygon_mesh::One_ring_neighbor_query
+\cgalHasModelsBegin
+\cgalModels{CGAL::Shape_detection::Point_set::K_neighbor_query}
+\cgalModels{CGAL::Shape_detection::Point_set::Sphere_neighbor_query}
+\cgalModels{CGAL::Shape_detection::Polygon_mesh::Polyline_graph}
+\cgalModels{CGAL::Shape_detection::Polygon_mesh::One_ring_neighbor_query}
 \cgalHasModelsEnd
 */
 class NeighborQuery {
diff --git a/Shape_detection/doc/Shape_detection/Concepts/RegionType.h b/Shape_detection/doc/Shape_detection/Concepts/RegionType.h
index af3212c67593..09b97911b5db 100644
--- a/Shape_detection/doc/Shape_detection/Concepts/RegionType.h
+++ b/Shape_detection/doc/Shape_detection/Concepts/RegionType.h
@@ -7,13 +7,14 @@ to maintain a region.
 
 A region is represented by a set items, which are included in this region.
 
-\cgalHasModelsBegin CGAL::Shape_detection::Point_set::Least_squares_line_fit_region
-\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_circle_fit_region
-\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_plane_fit_region
-\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_sphere_fit_region
-\cgalHasModels CGAL::Shape_detection::Point_set::Least_squares_cylinder_fit_region
-\cgalHasModels CGAL::Shape_detection::Segment_set::Least_squares_line_fit_region
-\cgalHasModels CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region
+\cgalHasModelsBegin
+\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_line_fit_region}
+\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_circle_fit_region}
+\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_plane_fit_region}
+\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_sphere_fit_region}
+\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_cylinder_fit_region}
+\cgalModels{CGAL::Shape_detection::Segment_set::Least_squares_line_fit_region}
+\cgalModels{CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region}
 \cgalHasModelsEnd
 */
 class RegionType {
diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h b/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h
index 9ed67563fdcc..cf96c3abe8e1 100644
--- a/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h
+++ b/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h
@@ -10,9 +10,10 @@ a model of this concept, the user sets such directions and provides a way to ori
 contour edges towards these directions. All contour regularization functions
 in this package are parameterized by this concept.
 
-\cgalHasModelsBegin Contours::Longest_direction_2
-\cgalHasModels Contours::Multiple_directions_2
-\cgalHasModels Contours::User_defined_directions_2
+\cgalHasModelsBegin
+\cgalModels{Contours::Longest_direction_2}
+\cgalModels{Contours::Multiple_directions_2}
+\cgalModels{Contours::User_defined_directions_2}
 \cgalHasModelsEnd
 */
 class ContourDirections {
diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h b/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h
index 20dbf1801e12..f2cd1486593c 100644
--- a/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h
+++ b/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h
@@ -9,7 +9,8 @@ A concept that describes the set of methods used by the class
 `QP_regularization` to access neighbors of
 a geometric object being regularized.
 
-\cgalHasModelsBegin Segments::Delaunay_neighbor_query_2
+\cgalHasModelsBegin
+\cgalModels{Segments::Delaunay_neighbor_query_2}
 \cgalHasModelsEnd
 */
 class NeighborQuery {
diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h b/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h
index ab3bbb08b7b6..ed3a10b5e285 100644
--- a/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h
+++ b/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h
@@ -9,8 +9,9 @@ A concept that describes the set of methods used by the class
 `QP_regularization` to access various data
 required for setting up the the global regularization problem.
 
-\cgalHasModelsBegin Segments::Angle_regularization_2
-\cgalHasModels Segments::Offset_regularization_2
+\cgalHasModelsBegin
+\cgalModels{Segments::Angle_regularization_2}
+\cgalModels{Segments::Offset_regularization_2}
 \cgalHasModelsEnd
 */
 class RegularizationType {
diff --git a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h
index 180cbeeb64d2..363d63a67750 100644
--- a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h
+++ b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h
@@ -10,7 +10,8 @@ polyhedral mesh approximating a skin surface
 
 \cgalRefines{RegularTriangulationTraits_3}
 
-\cgalHasModelsBegin CGAL::Skin_surface_traits_3<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Skin_surface_traits_3<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Skin_surface_3<SkinSurfaceTraits_3>`
diff --git a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h
index 237a5d3049d6..22146acf83a4 100644
--- a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h
+++ b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h
@@ -9,8 +9,9 @@ The concept requires a constructor from an iterator range of
 weighted points and a shrink factor. By default the input balls are
 grown in such that the skin surface wraps around the input balls.
 
-\cgalHasModelsBegin CGAL::Skin_surface_3<SkinSurfaceTraits_3>
-\cgalHasModels CGAL::Union_of_balls_3<SkinSurfaceTraits_3>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Skin_surface_3<SkinSurfaceTraits_3>}
+\cgalModels{CGAL::Union_of_balls_3<SkinSurfaceTraits_3>}
 \cgalHasModelsEnd
 
 */
diff --git a/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h b/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h
index 163d17faa16a..49dd95d05338 100644
--- a/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h
+++ b/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h
@@ -11,7 +11,8 @@ some function object types for the required predicates on those primitives.
 
 \cgalRefines{ArrangementTraits_2}
 
-\cgalHasModelsBegin CGAL::Snap_rounding_traits_2<Kernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Snap_rounding_traits_2<Kernel>}
 \cgalHasModelsEnd
 */
 
@@ -172,7 +173,9 @@ namespace SRTraits_2{
   \cgalConcept
   Represents an iso rectangle
   \cgalRefines{DefaultConstructible,CopyConstructible,Assignable}
+  \cgalHasModelsBegin
   \cgalHasModelsBare{\link SnapRoundingTraits_2::Iso_rectangle_2 `Snap_rounding_traits_2::Iso_rectangle_2` \endlink}
+  \cgalHasModelsEnd
 */
 class IsoRectangle_2
 {};
@@ -181,7 +184,9 @@ class IsoRectangle_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableBinaryFunction}
+  \cgalHasModelsBegin
   \cgalHasModelsBare{\link SnapRoundingTraits_2::Construct_vertex_2 `Snap_rounding_traits_2::Construct_vertex_2` \endlink}
+  \cgalHasModelsEnd
 */
 class ConstructVertex_2
 {
@@ -198,7 +203,9 @@ class ConstructVertex_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableBinaryFunction}
+  \cgalHasModelsBegin
   \cgalHasModelsBare{\link SnapRoundingTraits_2::Construct_segment_2 `Snap_rounding_traits_2::Construct_segment_2`  \endlink}
+  \cgalHasModelsEnd
 */
 class ConstructSegment_2
 {
@@ -215,7 +222,9 @@ class ConstructSegment_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableQuaternaryFunction}
+  \cgalHasModelsBegin
   \cgalHasModelsBare{\link SnapRoundingTraits_2::Construct_iso_rectangle_2 `Snap_rounding_traits_2::Construct_iso_rectangle_2` \endlink}
+  \cgalHasModelsEnd
 */
 class ConstructIsoRectangle_2
 {
@@ -236,7 +245,9 @@ class ConstructIsoRectangle_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableBinaryFunction}
+  \cgalHasModelsBegin
   \cgalHasModelsBare{\link SnapRoundingTraits_2::Compare_x_2 `Snap_rounding_traits_2::Compare_x_2` \endlink}
+  \cgalHasModelsEnd
 */
 class CompareX_2
 {
@@ -252,7 +263,9 @@ class CompareX_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableBinaryFunction}
+  \cgalHasModelsBegin
   \cgalHasModelsBare{\link SnapRoundingTraits_2::Compare_y_2 `Snap_rounding_traits_2::Compare_y_2` \endlink}
+  \cgalHasModelsEnd
 */
 class CompareY_2
 {
@@ -269,7 +282,9 @@ class CompareY_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableQuaternaryFunction}
+  \cgalHasModelsBegin
   \cgalHasModelsBare{\link SnapRoundingTraits_2::Snap_2 `Snap_rounding_traits_2::Snap_2` \endlink}
+  \cgalHasModelsEnd
 */
 class Snap_2
 {
@@ -288,7 +303,9 @@ class Snap_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableBinaryFunction}
+  \cgalHasModelsBegin
   \cgalHasModelsBare{\link SnapRoundingTraits_2::Integer_grid_point_2 `Snap_rounding_traits_2::Integer_grid_point_2` \endlink}
+  \cgalHasModelsEnd
 
 */
 class IntegerGridPoint_2
@@ -309,7 +326,9 @@ class IntegerGridPoint_2
   \ingroup PkgSnapRounding2Concepts
   \cgalConcept
   \cgalRefines{AdaptableTernaryFunction}
+  \cgalHasModelsBegin
   \cgalHasModelsBare{\link SnapRoundingTraits_2::Minkowski_sum_with_pixel_2 `Snap_rounding_traits_2::Minkowski_sum_with_pixel_2` \endlink}
+  \cgalHasModelsEnd
 */
 class MinkowskiSumWithPixel_2
 {
diff --git a/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h b/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h
index 41594f6cbfeb..7791fbf59a9a 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h
@@ -19,7 +19,8 @@ For example, a matrix of dimension 3 is defined as
 \tparam FT Number type
 \tparam dim Dimension of the matrices and vectors
 
-\cgalHasModelsBegin CGAL::Eigen_diagonalize_traits
+\cgalHasModelsBegin
+\cgalModels{CGAL::Eigen_diagonalize_traits}
 \cgalHasModelsEnd
 */
 template <typename FT, unsigned int dim = 3>
diff --git a/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h b/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h
index 015153dd3240..f73b3d143963 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h
@@ -7,7 +7,8 @@ class MixedIntegerProgramTraits
 `MixedIntegerProgramVariable` is a concept of a variable in
 a Mixed Integer Programming (MIP) problem.
 
-\cgalHasModelsBegin CGAL::Variable<FT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Variable<FT>}
 \cgalHasModelsEnd
 */
 template <typename FT>
@@ -113,7 +114,8 @@ class MixedIntegerProgramVariable
 `MixedIntegerProgramLinearConstraint` is a concept of a linear
 constraint in a Mixed Integer Programming (MIP) problem.
 
-\cgalHasModelsBegin CGAL::Linear_constraint<FT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Linear_constraint<FT>}
 \cgalHasModelsEnd
 */
 template <typename FT>
@@ -211,7 +213,8 @@ class MixedIntegerProgramLinearConstraint
 `MixedIntegerProgramLinearObjective` is a concept of the linear
 objective function in a Mixed Integer Programming (MIP) problem.
 
-\cgalHasModelsBegin CGAL::Linear_objective<FT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Linear_objective<FT>}
 \cgalHasModelsEnd
 */
 template <typename FT>
@@ -280,9 +283,10 @@ Mixed Integer Programming (MIP) problems. A model of this concept stores the int
 variables, linear objective, and linear constraints (if any) and provides a method
 to solve the problem.
 
-\cgalHasModelsBegin CGAL::Mixed_integer_program_traits<T>
-\cgalHasModels CGAL::GLPK_mixed_integer_program_traits<T>
-\cgalHasModels CGAL::SCIP_mixed_integer_program_traits<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Mixed_integer_program_traits<T>}
+\cgalModels{CGAL::GLPK_mixed_integer_program_traits<T>}
+\cgalModels{CGAL::SCIP_mixed_integer_program_traits<T>}
 \cgalHasModelsEnd
 */
 template <typename FT>
diff --git a/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h
index 07781ed7265a..49fb8ee1937e 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h
@@ -7,7 +7,8 @@ Concept describing the set of requirements for solving the normal equation \f$ A
 
 \sa `SparseLinearAlgebraTraits_d`
 
-\cgalHasModelsBegin CGAL::Eigen_solver_traits<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Eigen_solver_traits<T>}
 \cgalHasModelsEnd
 */
 class NormalEquationSparseLinearAlgebraTraits_d
diff --git a/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h b/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h
index f929f231c7b5..7ed6bf55f2b3 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h
@@ -24,7 +24,8 @@ where \f$ l_i \in \mathbb{R} \cup \{-\infty\} \f$ for all \f$ i \f$,
 where \f$ u_i \in \mathbb{R} \cup \{+\infty\} \f$ for all \f$ i \f$.
 </UL>
 
-\cgalHasModelsBegin CGAL::OSQP_quadratic_program_traits<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::OSQP_quadratic_program_traits<T>}
 \cgalHasModelsEnd
 */
 class QuadraticProgramTraits {
diff --git a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h
index 7c04f914bd48..9d236d47d3df 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h
@@ -4,7 +4,8 @@
 
 The concept `SparseLinearAlgebraTraits_d` is used to solve sparse linear systems <I>A\f$ \times \f$ X = B</I>.
 
-\cgalHasModelsBegin CGAL::Eigen_solver_traits<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Eigen_solver_traits<T>}
 \cgalHasModelsEnd
 */
 class SparseLinearAlgebraTraits_d
@@ -63,7 +64,8 @@ by a sparse matrix.
 
 \cgalRefines{DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Eigen_vector<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Eigen_vector<T>}
 \cgalHasModelsEnd
 
 \sa `SparseLinearAlgebraTraits_d`
@@ -131,8 +133,9 @@ NT& operator[](Index row);
 
 \cgalRefines{Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Eigen_sparse_matrix<T>
-\cgalHasModels CGAL::Eigen_sparse_symmetric_matrix<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Eigen_sparse_matrix<T>}
+\cgalModels{CGAL::Eigen_sparse_symmetric_matrix<T>}
 \cgalHasModelsEnd
 
 \sa `SparseLinearAlgebraTraits_d`
diff --git a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h
index 34df486f1e63..c8792ccab3a6 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h
@@ -8,7 +8,8 @@ method to solve the system for different right-hand vectors.
 
 \cgalRefines{SparseLinearAlgebraTraits_d}
 
-\cgalHasModelsBegin CGAL::Eigen_solver_traits<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Eigen_solver_traits<T>}
 \cgalHasModelsEnd
 */
 class SparseLinearAlgebraWithFactorTraits_d {
diff --git a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
old mode 100644
new mode 100755
index 2c843090296b..cd0ec9832ee6
--- a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
@@ -5,7 +5,8 @@
   The concept `SvdTraits` describes the linear algebra types and algorithms needed
   to solve in the least square sense a linear system with a singular value decomposition
 
-\cgalHasModelsBegin galHasModel `CGAL::Eigen_svd
+\cgalHasModelsBegin
+\cgalModels{CGAL::Eigen_svd}
 \cgalHasModelsEnd
 */
 class SvdTraits
@@ -52,7 +53,8 @@ class SvdTraits
 \cgalConcept
 Concept of vector type used by the concept `SvdTraits`.
 
-\cgalHasModelsBegin CGAL::Eigen_vector<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Eigen_vector<T>}
 \cgalHasModelsEnd
 */
 class SvdTraits::Vector
@@ -90,7 +92,8 @@ Concept of matrix type used by the concept `SvdTraits`.
 
 \cgalRefines{DefaultConstructible,Assignable}
 
-\cgalHasModelsBegin CGAL::Eigen_matrix<T>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Eigen_matrix<T>}
 \cgalHasModelsEnd
 */
 class SvdTraits::Matrix
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h b/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h
old mode 100644
new mode 100755
index 4e0837b36be0..7289e042338b
--- a/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h
@@ -4,8 +4,9 @@
 
 The concept `FuzzyQueryItem` describes the requirements for fuzzy `d`-dimensional spatial objects.
 
-\cgalHasModelsBegin CGAL::Fuzzy_sphere<Traits>
-\cgalHasModel `CGAL::Fuzzy_iso_box<Traits>`
+\cgalHasModelsBegin
+\cgalHasModels{CGAL::Fuzzy_sphere<Traits>}
+\cgalHasModels{CGAL::Fuzzy_iso_box<Traits>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
index 7a8506131f61..6bf09d1211ae 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
@@ -8,8 +8,9 @@ To optimize distance computations transformed distances are used,
 e.g., for a Euclidean distance the transformed distance is the squared
 Euclidean distance.
 
-\cgalHasModelsBegin CGAL::Manhattan_distance_iso_box_point<Traits>
-\cgalHasModels CGAL::Euclidean_distance_sphere_point<Traits>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Manhattan_distance_iso_box_point<Traits>}
+\cgalModels{CGAL::Euclidean_distance_sphere_point<Traits>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
index b2f826e4074a..a12b6e2a2447 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
@@ -8,8 +8,9 @@ E.g., for an Euclidean distance the transformed distance is the squared Euclidea
 
 \cgalRefines{GeneralDistance}
 
-\cgalHasModelsBegin CGAL::Euclidean_distance<Traits>
-\cgalHasModels CGAL::Weighted_Minkowski_distance<Traits>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Euclidean_distance<Traits>}
+\cgalModels{CGAL::Weighted_Minkowski_distance<Traits>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h b/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h
index feb9af6f79ed..22a34f8c6de4 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h
@@ -8,12 +8,13 @@ range search queries in a model of `SpatialTree`.
 
 \cgalRefines{SearchTraits}
 
-\cgalHasModelsBegin CGAL::Cartesian_d<FT>
-\cgalHasModels CGAL::Homogeneous_d<RT>
-\cgalHasModels CGAL::Epick_d<DimensionTag>
-\cgalHasModels CGAL::Epeck_d<DimensionTag>
-\cgalHasModels CGAL::Search_traits_2<Kernel>
-\cgalHasModels CGAL::Search_traits_3<Kernel>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Cartesian_d<FT>}
+\cgalModels{CGAL::Homogeneous_d<RT>}
+\cgalModels{CGAL::Epick_d<DimensionTag>}
+\cgalModels{CGAL::Epeck_d<DimensionTag>}
+\cgalModels{CGAL::Search_traits_2<Kernel>}
+\cgalModels{CGAL::Search_traits_3<Kernel>}
 \cgalHasModelsEnd
 
 \sa `SearchTraits`
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h
index 96857238a64a..f55a7971ea50 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_2.h
@@ -5,7 +5,9 @@
 The concept `SearchGeomTraits_2` defines the requirements for the template
 parameter of the search traits classes.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 */
 
 class SearchGeomTraits_2 {
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h
index 85191a1b0962..5b5e5916dc92 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SearchGeomTraits_3.h
@@ -5,7 +5,9 @@
 The concept `SearchGeomTraits_3` defines the requirements for the template
 parameter of the search traits classes.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 
 */
 
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h b/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h
index 6bfe70109e01..358c828ff6f8 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h
@@ -5,14 +5,15 @@
 The concept `SearchTraits` defines the requirements for the template
 parameter of the search classes.
 
-\cgalHasModelsBegin CGAL::Cartesian_d<FT>
-\cgalHasModels CGAL::Homogeneous_d<RT>
-\cgalHasModels CGAL::Epick_d<DimensionTag>
-\cgalHasModels CGAL::Epeck_d<DimensionTag>
-\cgalHasModels CGAL::Search_traits_2<Kernel>
-\cgalHasModels CGAL::Search_traits_3<Kernel>
-\cgalHasModels CGAL::Search_traits_d<Kernel,Dim>
-\cgalHasModels CGAL::Search_traits<NT,Point,CartesianCoordinateIterator,ConstructCartesianCoordinateIterator,ConstructMinVertex,ConstructMaxVertex>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Cartesian_d<FT>}
+\cgalModels{CGAL::Homogeneous_d<RT>}
+\cgalModels{CGAL::Epick_d<DimensionTag>}
+\cgalModels{CGAL::Epeck_d<DimensionTag>}
+\cgalModels{CGAL::Search_traits_2<Kernel>}
+\cgalModels{CGAL::Search_traits_3<Kernel>}
+\cgalModels{CGAL::Search_traits_d<Kernel,Dim>}
+\cgalModels{CGAL::Search_traits<NT,Point,CartesianCoordinateIterator,ConstructCartesianCoordinateIterator,ConstructMinVertex,ConstructMaxVertex>}
 \cgalHasModelsEnd
 
 \sa `RangeSearchTraits`
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h
index ecdc521ce9fe..357dbbfff468 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h
@@ -11,7 +11,8 @@ space is said to be on the negative side of the separator and the
 other part of space is said to be on the positive side of the
 separator.
 
-\cgalHasModelsBegin CGAL::Plane_separator<FT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Plane_separator<FT>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h
index 58d396cec22c..aa483a297805 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h
@@ -5,7 +5,8 @@
 The concept `SpatialTree` defines the requirements for a tree supporting
 both neighbor searching and approximate range searching.
 
-\cgalHasModelsBegin CGAL::Kd_tree<Traits,Splitter,UseExtendedNode>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Kd_tree<Traits,Splitter,UseExtendedNode>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h b/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h
index 88a18887640d..6621186a2f7e 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h
@@ -7,13 +7,14 @@
 The concept `Splitter` defines the requirements for a function object class implementing a splitting rule.
 \cgalAdvancedEnd
 
-\cgalHasModelsBegin CGAL::Fair<Traits, SpatialSeparator>
-\cgalHasModels CGAL::Median_of_rectangle<Traits, SpatialSeparator>
-\cgalHasModels CGAL::Median_of_max_spread<Traits, SpatialSeparator>
-\cgalHasModels CGAL::Midpoint_of_rectangle<Traits, SpatialSeparator>
-\cgalHasModels CGAL::Midpoint_of_max_spread<Traits, SpatialSeparator>
-\cgalHasModels CGAL::Sliding_fair<Traits, SpatialSeparator>
-\cgalHasModels CGAL::Sliding_midpoint<Traits, SpatialSeparator>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Fair<Traits, SpatialSeparator>}
+\cgalModels{CGAL::Median_of_rectangle<Traits, SpatialSeparator>}
+\cgalModels{CGAL::Median_of_max_spread<Traits, SpatialSeparator>}
+\cgalModels{CGAL::Midpoint_of_rectangle<Traits, SpatialSeparator>}
+\cgalModels{CGAL::Midpoint_of_max_spread<Traits, SpatialSeparator>}
+\cgalModels{CGAL::Sliding_fair<Traits, SpatialSeparator>}
+\cgalModels{CGAL::Sliding_midpoint<Traits, SpatialSeparator>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h
index 8a48e705bd00..f577778a10d4 100644
--- a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h
+++ b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_2.h
@@ -9,7 +9,9 @@ primitives (objects and predicates) that the sorting algorithms use.
 `SpatialSortingTraits_2` defines the complete set of primitives required in these
 functions and functors.
 
-\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Spatial_sort_traits_adapter_2<Base_traits,PointPropertyMap>
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModels{CGAL::Spatial_sort_traits_adapter_2<Base_traits,PointPropertyMap>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h
index 2cef4c17269a..f0274680a2dd 100644
--- a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h
+++ b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_3.h
@@ -9,7 +9,9 @@ primitives (objects and predicates) that the sorting algorithms use.
 `SpatialSortingTraits_3` defines the complete set of primitives required in these
 functions and functors.
 
-\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Spatial_sort_traits_adapter_3<Base_traits,PointPropertyMap>
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModels{CGAL::Spatial_sort_traits_adapter_3<Base_traits,PointPropertyMap>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h
index a0c4dfd031d4..8e4ca68c7990 100644
--- a/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h
+++ b/Spatial_sorting/doc/Spatial_sorting/Concepts/SpatialSortingTraits_d.h
@@ -9,7 +9,9 @@ primitives (objects and predicates) that the sorting algorithms use.
 `SpatialSortingTraits_d` defines the complete set of primitives required in these
 functions and functors.
 
-\cgalHasModelsBareBegin{Any \cgal `d`-dimensional kernel.} CGAL::Spatial_sort_traits_adapter_d<Base_traits,PointPropertyMap>
+\cgalHasModelsBegin
+\cgalHasModelsBare{Any \cgal `d`-dimensional kernel.}
+\cgalHasModels{CGAL::Spatial_sort_traits_adapter_d<Base_traits,PointPropertyMap>}
 \cgalHasModelsEnd
 
 */
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
index 15aa1efc7dab..f5f7270e043a 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
@@ -7,7 +7,8 @@
 The concept `PolygonOffsetBuilderTraits_2` describes the requirements for the geometric traits class
 required by the algorithm class `CGAL::Polygon_offset_builder_2`.
 
-\cgalHasModelsBegin CGAL::Polygon_offset_builder_traits_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Polygon_offset_builder_traits_2}
 \cgalHasModelsEnd
 
 \sa `CGAL::Polygon_offset_builder_2<Ss,Traits,Container>`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
index a19486171c43..5df86d3e2a6b 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
@@ -7,7 +7,8 @@
 The concept `StraightSkeletonBuilderTraits_2` describes the requirements
 for the geometric traits class required by the algorithm class `CGAL::Straight_skeleton_builder_2`.
 
-\cgalHasModelsBegin CGAL::Straight_skeleton_builder_traits_2<K>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Straight_skeleton_builder_traits_2<K>}
 \cgalHasModelsEnd
 */
 class StraightSkeletonBuilderTraits_2 {
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h
index 316fbc4b0e04..7937ab435359 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h
@@ -5,7 +5,8 @@
 The concept `StraightSkeletonBuilder_2_Visitor` describes the requirements of the visitor class
 required by the algorithm class `CGAL::Straight_skeleton_builder_2` in its third template parameter.
 
-\cgalHasModelsBegin CGAL::Dummy_straight_skeleton_builder_2_visitor
+\cgalHasModelsBegin
+\cgalModels{CGAL::Dummy_straight_skeleton_builder_2_visitor}
 \cgalHasModelsEnd
 
 \sa `CGAL::Straight_skeleton_builder_2`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h
index 16bf5a396b50..af125ad42f5e 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h
@@ -8,7 +8,8 @@ The concept `StraightSkeletonFace_2` describes the requirements for the face typ
 `StraightSkeleton_2` concept. It is a refinement of the `HalfedgeDSFace` concept
 with support for storage of the incident halfedge.
 
-\cgalHasModelsBegin CGAL::Straight_skeleton_face_base_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Straight_skeleton_face_base_2}
 \cgalHasModelsEnd
 
 \sa `StraightSkeletonVertex_2`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h
index 22caa9419c04..67f6dafc5c44 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h
@@ -12,7 +12,8 @@ The only geometric embedding used by the Straight Skeleton Data Structure are th
 in the contour and skeleton vertices. However, for any halfedge, there is a 2D segment implicitly
 given by its `source` and `target` vertices.
 
-\cgalHasModelsBegin CGAL::Straight_skeleton_halfedge_base_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Straight_skeleton_halfedge_base_2}
 \cgalHasModelsEnd
 
 \sa `StraightSkeleton_2`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h
index a95688dc6e78..0bf7cab0c87f 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h
@@ -6,7 +6,8 @@ The concept `StraightSkeletonItemsConverter_2` describes the requirements for it
 as the third template argument to the class `Straight_skeleton_converter_2<SrcSs,TgtSs,ItemsConverter>`.
 It converts the `HDS` items from one type of straight skeleton to another.
 
-\cgalHasModelsBegin CGAL::Straight_skeleton_items_converter_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Straight_skeleton_items_converter_2}
 \cgalHasModelsEnd
 
 \sa `CGAL::Straight_skeleton_converter_2<SrcSs,TgtSs,ItemsCvt>`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
index a53a002940ef..29f50118cb4c 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
@@ -9,7 +9,8 @@ The concept `StraightSkeletonVertex_2` describes the requirements for the vertex
 with support for storage of the incident halfedge. The `StraightSkeletonVertex_2` concept
 requires the geometric embedding to be a 2D point.
 
-\cgalHasModelsBegin CGAL::Straight_skeleton_vertex_base_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Straight_skeleton_vertex_base_2}
 \cgalHasModelsEnd
 
 \sa `StraightSkeletonHalfedge_2`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h
index 52dcfe61484e..9df0937e9ff4 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h
@@ -9,7 +9,8 @@ used to represent a straight skeleton. It refines the concept
 `HalfedgeDS` and adds additional requirements on the nested types
 `Vertex`, `Halfedge`, and `Face` of the halfedge data structure.
 
-\cgalHasModelsBegin CGAL::Straight_skeleton_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Straight_skeleton_2}
 \cgalHasModelsEnd
 
 \attention This concept explicitly protects all the modifying
diff --git a/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h b/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h
index 6f001fda04ee..9e23002f51d9 100644
--- a/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h
@@ -9,8 +9,9 @@ the second template parameter of the class
 provides the operation that integrates a new point from a given point
 with a predefined step, and according to a specified vector.
 
-\cgalHasModelsBegin CGAL::Euler_integrator_2<VectorField_2>
-\cgalHasModels CGAL::Runge_kutta_integrator_2<VectorField_2>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Euler_integrator_2<VectorField_2>}
+\cgalModels{CGAL::Runge_kutta_integrator_2<VectorField_2>}
 \cgalHasModelsEnd
 
 */
diff --git a/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h b/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h
index e1394b709454..a2e24fd2fbad 100644
--- a/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/Concepts/StreamLinesTraits_2.h
@@ -9,7 +9,9 @@ the template parameter of the class
 This concept provides the types handled by the
 `CGAL::Stream_lines_2<VectorField_2, Integrator_2>` class.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{The kernels of \cgal are models for this traits class.}
+\cgalHasModelsEnd
 
 */
 class StreamLinesTraits_2 {
diff --git a/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h b/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h
index b42a88dba950..b79ed1e740fa 100644
--- a/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h
@@ -9,8 +9,9 @@ the first template parameter of the class
 provides the types of the geometric primitives used in the placement
 of streamlines and some functions for answering different queries.
 
-\cgalHasModelsBegin CGAL::Regular_grid_2<StreamLinesTraits_2>
-\cgalHasModels CGAL::Triangular_field_2<StreamLinesTraits_2>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Regular_grid_2<StreamLinesTraits_2>}
+\cgalModels{CGAL::Triangular_field_2<StreamLinesTraits_2>}
 \cgalHasModelsEnd
 
 */
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h
index 2a0e662a0e82..ea351a5d2ba1 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h
@@ -11,7 +11,8 @@ policy concept of geometric computations is used in
 
 \cgalRefines{SubdivisionMask_3}
 
-\cgalHasModelsBegin CGAL::DooSabin_mask_3<PolygonMesh, VertexPointMap>
+\cgalHasModelsBegin
+\cgalModels{CGAL::DooSabin_mask_3<PolygonMesh, VertexPointMap>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h
index 22c59d45ad22..15a337e68c97 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h
@@ -11,7 +11,8 @@ policy concept of geometric computations is used in
 
 \cgalRefines{SubdivisionMask_3}
 
-\cgalHasModelsBegin CGAL::CatmullClark_mask_3<PolygonMesh, VertexPointMap>
+\cgalHasModelsBegin
+\cgalModels{CGAL::CatmullClark_mask_3<PolygonMesh, VertexPointMap>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h
index 2faff045bd6d..190f970bd007 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h
@@ -10,7 +10,8 @@ policy concept of geometric computations is used in
 
 \cgalRefines{SubdivisionMask_3}
 
-\cgalHasModelsBegin CGAL::Loop_mask_3<PolygonMesh, VertexPointMap>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Loop_mask_3<PolygonMesh, VertexPointMap>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h
index ed311db671a3..72823a073e1b 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h
@@ -9,7 +9,8 @@ policy concept of geometric computations is used in
 
 \cgalRefines{SubdivisionMask_3}
 
-\cgalHasModelsBegin CGAL::Sqrt3_mask_3<PolygonMesh, VertexPointMap>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Sqrt3_mask_3<PolygonMesh, VertexPointMap>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
diff --git a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h
index 68364e07863a..f6e59cdaf67f 100644
--- a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h
+++ b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h
@@ -6,8 +6,9 @@ The concept `ErrorMetricProxy` defines the notion of proxy,
 computes the fitting error from a face to a proxy,
 and fits a proxy from a range of faces.
 
-\cgalHasModelsBegin CGAL::Surface_mesh_approximation::L21_metric_plane_proxy
-\cgalHasModels CGAL::Surface_mesh_approximation::L2_metric_plane_proxy
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_approximation::L21_metric_plane_proxy}
+\cgalModels{CGAL::Surface_mesh_approximation::L2_metric_plane_proxy}
 \cgalHasModelsEnd
 */
 
diff --git a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
index 65137707986d..4332ebda74b1 100644
--- a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
+++ b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
@@ -9,8 +9,9 @@ to implement models of this concept.
 
 \cgalRefines{DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Deformation_Eigen_closest_rotation_traits_3
-\cgalHasModels CGAL::Deformation_Eigen_polar_closest_rotation_traits_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Deformation_Eigen_closest_rotation_traits_3}
+\cgalModels{CGAL::Deformation_Eigen_polar_closest_rotation_traits_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h
index 67002d031aec..35a8d8a2e1a4 100644
--- a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h
+++ b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h
@@ -12,16 +12,17 @@ the border of a given mesh.
 
 Construction and destruction are undefined.
 
-\cgalHasModelsBegin CGAL::Surface_mesh_parameterization::Fixed_border_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
-\cgalHasModels CGAL::Surface_mesh_parameterization::ARAP_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
-\cgalHasModels CGAL::Surface_mesh_parameterization::Barycentric_mapping_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
-\cgalHasModels CGAL::Surface_mesh_parameterization::Discrete_authalic_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
-\cgalHasModels CGAL::Surface_mesh_parameterization::Discrete_conformal_map_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
-\cgalHasModels CGAL::Surface_mesh_parameterization::LSCM_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
-\cgalHasModels CGAL::Surface_mesh_parameterization::Mean_value_coordinates_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>
-\cgalHasModels CGAL::Surface_mesh_parameterization::Circular_border_parameterizer_3<TriangleMesh>
-\cgalHasModels CGAL::Surface_mesh_parameterization::Square_border_parameterizer_3<TriangleMesh>
-\cgalHasModels CGAL::Surface_mesh_parameterization::Two_vertices_parameterizer_3<TriangleMesh>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_parameterization::Fixed_border_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalModels{CGAL::Surface_mesh_parameterization::ARAP_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalModels{CGAL::Surface_mesh_parameterization::Barycentric_mapping_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalModels{CGAL::Surface_mesh_parameterization::Discrete_authalic_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalModels{CGAL::Surface_mesh_parameterization::Discrete_conformal_map_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalModels{CGAL::Surface_mesh_parameterization::LSCM_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalModels{CGAL::Surface_mesh_parameterization::Mean_value_coordinates_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalModels{CGAL::Surface_mesh_parameterization::Circular_border_parameterizer_3<TriangleMesh>}
+\cgalModels{CGAL::Surface_mesh_parameterization::Square_border_parameterizer_3<TriangleMesh>}
+\cgalModels{CGAL::Surface_mesh_parameterization::Two_vertices_parameterizer_3<TriangleMesh>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Surface_mesh_parameterization::Orbifold_Tutte_parameterizer_3<SeamMesh, SolverTraits>`
diff --git a/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h b/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h
index 2e0a58fa0a28..81e7848328b1 100644
--- a/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h
+++ b/Surface_mesh_segmentation/doc/Surface_mesh_segmentation/Concepts/SegmentationGeomTraits.h
@@ -5,7 +5,9 @@
 The concept `SegmentationGeomTraits` describes the set of requirements
 of the geometric traits needed by the segmentation functions.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 
 \cgalRefines{AABBGeomTraits}
 
diff --git a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
index 51d4ae712eb6..9724634b10ff 100644
--- a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
+++ b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
@@ -8,7 +8,8 @@ predicates, and constructions required by the traits class parameter of
 `CGAL::Surface_mesh_shortest_path`.
 
 \cgalRefines{CopyConstructible,Assignable}
-\cgalHasModelsBegin CGAL::Surface_mesh_shortest_path_traits<K,P>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_shortest_path_traits<K,P>}
 \cgalHasModelsEnd
 
 */
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
index f31143efcc62..2bd7a6bd2017 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
@@ -12,9 +12,10 @@ or can be intentionally returned to prevent the edge from being collapsed.
 
 \cgalRefines{DefaultConstructible,CopyConstructible}
 
-\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Edge_length_cost<TriangleMesh>
-\cgalHasModels CGAL::Surface_mesh_simplification::LindstromTurk_cost<TriangleMesh>
-\cgalHasModels CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_simplification::Edge_length_cost<TriangleMesh>}
+\cgalModels{CGAL::Surface_mesh_simplification::LindstromTurk_cost<TriangleMesh>}
+\cgalModels{CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>}
 \cgalHasModelsEnd
 
 */
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
index bb66ff08d050..cf87c5e2400d 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
@@ -14,11 +14,12 @@ or can be intentionally returned to prevent the edge from being collapsed.
 
 \cgalRefines{DefaultConstructible,CopyConstructible}
 
-\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Midpoint_placement<TriangleMesh>
-\cgalHasModels CGAL::Surface_mesh_simplification::LindstromTurk_placement<TriangleMesh>
-\cgalHasModels CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>
-\cgalHasModels CGAL::Surface_mesh_simplification::Bounded_normal_change_placement<Placement>
-\cgalHasModels CGAL::Surface_mesh_simplification::Constrained_placement<Placement>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_simplification::Midpoint_placement<TriangleMesh>}
+\cgalModels{CGAL::Surface_mesh_simplification::LindstromTurk_placement<TriangleMesh>}
+\cgalModels{CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>}
+\cgalModels{CGAL::Surface_mesh_simplification::Bounded_normal_change_placement<Placement>}
+\cgalModels{CGAL::Surface_mesh_simplification::Constrained_placement<Placement>}
 \cgalHasModelsEnd
 */
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
index b66544074009..6f53b84171e8 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
@@ -14,8 +14,9 @@ be absent). The value `boost::none` indicates that the edge should not be collap
 
 \cgalRefines{DefaultConstructible,CopyConstructible}
 
-\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<BasePlacementFilter>
-\cgalHasModels CGAL::Surface_mesh_simplification::Polyhedral_envelope_filter<GeomTraits, BasePlacementFilter>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<BasePlacementFilter>}
+\cgalModels{CGAL::Surface_mesh_simplification::Polyhedral_envelope_filter<GeomTraits, BasePlacementFilter>}
 \cgalHasModelsEnd
 */
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h
index df8fc845f5b4..9a51402119c5 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h
@@ -4,11 +4,12 @@
 
 The concept `StopPredicate` describes the requirements for the predicate which indicates if the simplification process must finish.
 
-\cgalHasModelsBegin CGAL::Surface_mesh_simplification::Edge_count_stop_predicate<TriangleMesh>
-\cgalHasModels CGAL::Surface_mesh_simplification::Face_count_stop_predicate<TriangleMesh>
-\cgalHasModels CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<TriangleMesh>
-\cgalHasModels CGAL::Surface_mesh_simplification::Face_count_ratio_stop_predicate<TriangleMesh>
-\cgalHasModels CGAL::Surface_mesh_simplification::Edge_length_stop_predicate<FT>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_simplification::Edge_count_stop_predicate<TriangleMesh>}
+\cgalModels{CGAL::Surface_mesh_simplification::Face_count_stop_predicate<TriangleMesh>}
+\cgalModels{CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<TriangleMesh>}
+\cgalModels{CGAL::Surface_mesh_simplification::Face_count_ratio_stop_predicate<TriangleMesh>}
+\cgalModels{CGAL::Surface_mesh_simplification::Edge_length_stop_predicate<FT>}
 \cgalHasModelsEnd
 
 */
diff --git a/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h b/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h
index b7466a2ecd45..8e929d561dd5 100644
--- a/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h
+++ b/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h
@@ -5,7 +5,9 @@
  *
  * Traits class concept defining the requirements of the class `CGAL::Mean_curvature_flow_skeletonization`.
  *
+ * \cgalHasModelsBegin
  * \cgalHasModelsBare{Any \cgal `Kernel` with `double` as `%Kernel::%FT`}
+ * \cgalHasModelsEnd
  *
  *
  */
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h
index 6f6355c93901..ea183d1c13f1 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchema.h
@@ -9,8 +9,10 @@
 
   \cgalRefines{GenericMap}
 
-  \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map<Items,Alloc>`\endlink\n
-                \link CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map<Items,Alloc>`\endlink}
+  \cgalHasModelsBegin
+  \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_combinatorial_map<Items,Alloc>`\endlink}
+  \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map `CGAL::Surface_mesh_topology::Polygonal_schema_with_generalized_map<Items,Alloc>`\endlink}
+  \cgalHasModelsEnd
   */
 
 class PolygonalSchema
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h
index 0bf077baf427..ee039139ce10 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/PolygonalSchemaItems.h
@@ -6,7 +6,9 @@
 
   \cgalRefines{GenericMapItems}
 
+  \cgalHasModelsBegin
   \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Polygonal_schema_min_items `CGAL::Surface_mesh_topology::Polygonal_schema_min_items`\endlink}
+  \cgalHasModelsEnd
   */
 
 class PolygonalSchemaItems
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h
index 4650a313f02a..6f9cbefceb67 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Concepts/WeightFunctor.h
@@ -5,8 +5,10 @@
 The concept `WeightFunctor` defines a functor to calculate the weight of an edge.
 
 
-  \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Unit_weight_functor `CGAL::Surface_mesh_topology::Unit_weight_functor`\endlink,
-               \link CGAL::Surface_mesh_topology::Euclidean_length_weight_functor `CGAL::Surface_mesh_topology::Euclidean_length_weight_functor<Mesh>`\endlink}
+  \cgalHasModelsBegin
+  \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Unit_weight_functor `CGAL::Surface_mesh_topology::Unit_weight_functor`\endlink}
+  \cgalHasModelsBare{\link CGAL::Surface_mesh_topology::Euclidean_length_weight_functor `CGAL::Surface_mesh_topology::Euclidean_length_weight_functor<Mesh>`\endlink}
+  \cgalHasModelsEnd
 */
 class WeightFunctor {
 public:
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h
index 319bf352f0c6..299065f4890c 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitFunction.h
@@ -7,7 +7,9 @@ The concept `ImplicitFunction` describes a function object
 whose `operator()` computes the values of a function
 \f$ f : \mathbb{R}^3 \longrightarrow \mathbb{R}\f$.
 
-\cgalHasModelsBareBegin{any pointer to a function of type `FT (*)(Point)`} CGAL::Gray_level_image_3
+\cgalHasModelsBegin
+\cgalHasModelsBare{any pointer to a function of type `FT (*)(Point)`}
+\cgalHasModels{CGAL::Gray_level_image_3}
 \cgalHasModelsEnd
 
 \sa `CGAL::Implicit_surface_3<Traits, Function>`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h
index 28814f2648ea..d06d695c40e6 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/ImplicitSurfaceTraits_3.h
@@ -15,7 +15,9 @@ the concept `ImplicitSurfaceTraits_3` provides the types, predicates and constru
 that are passed
 to the generated model of `SurfaceMeshTraits_3`.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 
 \sa `CGAL::Implicit_surface_3<Traits, Function>`
 \sa `CGAL::make_surface_mesh()`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h
index 1b16bc506f14..3dcc8a0dedf5 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h
@@ -37,8 +37,9 @@ of the restriction to the surface of a three dimensional
 triangulation.  In the following we call surface center of a facet,
 the center of its biggest Delaunay surface ball.
 
-\cgalHasModelsBegin CGAL::Surface_mesh_cell_base_3<Gt,Vb>
-\cgalHasModels CGAL::Surface_mesh_default_triangulation_3::Cell
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_cell_base_3<Gt,Vb>}
+\cgalModels{CGAL::Surface_mesh_default_triangulation_3::Cell}
 \cgalHasModelsEnd
 
 \sa `SurfaceMeshTriangulation_3`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h
index ec9eba193720..35b923bbb8b5 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h
@@ -30,7 +30,8 @@ A model of this concept is a type to be plugged as first template
 parameter in the
 function template `CGAL::make_surface_mesh()`.
 
-\cgalHasModelsBegin CGAL::Surface_mesh_complex_2_in_triangulation_3<Tr>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_complex_2_in_triangulation_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h
index 7380607aca07..0f3431af56cb 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h
@@ -33,7 +33,8 @@ is just a lexicographical comparison. The meshing algorithm handles facets
 with lowest quality first. The qualities are computed by a function
 `is_bad(const Facet& f, const Quality& q)`.
 
-\cgalHasModelsBegin CGAL::Surface_mesh_default_criteria_3<Tr>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_default_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h
index dd728781a7f7..672f74669488 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h
@@ -11,7 +11,8 @@ and to compute some intersection
 points if any exists. The concept `SurfaceMeshTraits_3` also includes a funcctor able to provide
 a small set of initial points on the surface.
 
-\cgalHasModelsBegin CGAL::Surface_mesh_traits_generator_3::type
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_traits_generator_3::type}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h
index 7af1aba64cae..a8411edcbbd5 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTriangulation_3.h
@@ -17,7 +17,9 @@ the requirements for the triangulation type
 plugged in the class
 `CGAL::Surface_mesh_complex_2_in_triangulation_3<Tr>`.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{Any 3D Delaunay triangulation class of \cgal}
+\cgalHasModelsEnd
 
 \sa `CGAL::Triangulation_3<TriangulationTraits_3,TriangulationDataStructure_3>`
 \sa `CGAL::Delaunay_triangulation_3<DelaunayTriangulationTraits_3,TriangulationDataStructure_3>`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h
index 086b7759ac90..32663ac10ddf 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h
@@ -31,8 +31,9 @@ integers, which, when they are valid, store respectively the number of
 complex facets incident to the vertex and the number of connected
 components of the adjacency graph of those facets.
 
-\cgalHasModelsBegin CGAL::Surface_mesh_vertex_base_3<Gt,Vb>
-\cgalHasModels CGAL::Surface_mesh_default_triangulation_3::Vertex
+\cgalHasModelsBegin
+\cgalModels{CGAL::Surface_mesh_vertex_base_3<Gt,Vb>}
+\cgalModels{CGAL::Surface_mesh_default_triangulation_3::Vertex}
 \cgalHasModelsEnd
 
 \sa `SurfaceMeshComplex_2InTriangulation_3`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h
index 0e5cca74dfef..4b4d11da894f 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h
@@ -8,7 +8,8 @@ The surface types
 are required to be copy constructible
 and assignable.
 
-\cgalHasModelsBegin CGAL::Implicit_surface_3<Traits, Function>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Implicit_surface_3<Traits, Function>}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h
index e10d068c1b1a..e1dc359a13f0 100644
--- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h
+++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h
@@ -48,7 +48,8 @@ that the `CGAL::Triangulation_data_structure_2`
 actually uses as a base class for the class
 `CGAL::Triangulation_data_structure_2::Face`.
 
-\cgalHasModelsBegin CGAL::Triangulation_ds_face_base_2<TDS>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_ds_face_base_2<TDS>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSVertexBase_2`
diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h
index e47b7cfbf3f8..994a0f82b9b0 100644
--- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h
+++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h
@@ -44,7 +44,8 @@ that the `CGAL::Triangulation_data_structure_2`
 actually uses as a base class for the class
 of `CGAL::Triangulation_data_structure_2::Vertex`.
 
-\cgalHasModelsBegin CGAL::Triangulation_ds_vertex_base_2<Tds>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_ds_vertex_base_2<Tds>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSFaceBase_2`
diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
index 051a1359d2e8..a07310740957 100644
--- a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
+++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
@@ -64,7 +64,8 @@ the rank of this item in the output order.
 When dimension \f$ <\f$ 2, the same information is output
 for faces of maximal dimension instead of faces.
 
-\cgalHasModelsBegin CGAL::Triangulation_data_structure_2<Vb,Fb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_data_structure_2<Vb,Fb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2::Face`
@@ -727,7 +728,8 @@ In order to obtain new vertices or destruct unused vertices, the user must
 call the `create_vertex()` and `delete_vertex()` methods of the
 triangulation data structure.
 
-\cgalHasModelsBegin CGAL::Triangulation_ds_vertex_base_2<Tds>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_ds_vertex_base_2<Tds>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSVertexBase_2`
@@ -849,7 +851,8 @@ The methods `create_face()` and
 have to be used to
 define new faces and to delete no longer used faces.
 
-\cgalHasModelsBegin CGAL::Triangulation_ds_face_base_2<Tds>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_ds_face_base_2<Tds>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSFaceBase_2`
diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h
index 59f5b45bbe2a..8f8ec146dbf9 100644
--- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h
+++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h
@@ -33,7 +33,8 @@ cell classes. The <I>rebound</I> base classes so obtained are the classes
 which are used as base classes for the final vertex and cell classes.
 More information can be found in Section \ref TDS3secdesign.
 
-\cgalHasModelsBegin CGAL::Triangulation_ds_cell_base_3<TDS>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_ds_cell_base_3<TDS>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSVertexBase_3`
diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h
index 9ef2cd34bbc6..0a9d10b04bff 100644
--- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h
+++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h
@@ -28,7 +28,8 @@ cell classes. The <I>rebound</I> base classes so obtained are the classes which
 are used as base classes for the final vertex and cell classes.
 More information can be found in Section \ref TDS3secdesign.
 
-\cgalHasModelsBegin CGAL::Triangulation_ds_vertex_base_3<TDS>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_ds_vertex_base_3<TDS>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSCellBase_3`
diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
index a2c6d41e9334..c3a7ba38023d 100644
--- a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
+++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
@@ -65,7 +65,8 @@ neighbors of each cell, where the index corresponds to the preceding
 list of cells. When dimension < 3, the same information is stored
 for faces of maximal dimension instead of cells.
 
-\cgalHasModelsBegin CGAL::Triangulation_data_structure_3<Vb, Cb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_data_structure_3<Vb, Cb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_3::Vertex`
diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h
index aa3f4d68dc1c..342e203e2598 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h
@@ -6,7 +6,8 @@
 
 Cell base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`.
 
-\cgalHasModelsBegin CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h
index ad71f044d997..85e92da96c32 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingTriangulationTraits_3.h
@@ -10,7 +10,9 @@ of the class `Remeshing_triangulation_3`. It defines the geometric objects
 (points, segments, triangles, and tetrahedra) forming the triangulation together with a few
 geometric predicates and constructions on these objects.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 
 \sa `CGAL::Triangulation_3`
 */
diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h
index 2b1b5bc8fc3f..2ce117b8ff32 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h
@@ -6,7 +6,8 @@
 
 Vertex base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`.
 
-\cgalHasModelsBegin Tetrahedral_remeshing::Remeshing_vertex_base_3
+\cgalHasModelsBegin
+\cgalModels{Tetrahedral_remeshing::Remeshing_vertex_base_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h
index 14395b71b936..1dd4fa17d49f 100644
--- a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h
+++ b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h
@@ -9,8 +9,9 @@ a Delaunay triangulation. It corresponds to the first template parameter of the
 
 \cgalRefines{TriangulationTraits}
 
-\cgalHasModelsBegin CGAL::Epick_d<Dim>
-\cgalHasModels CGAL::Epeck_d<Dim>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Epick_d<Dim>}
+\cgalModels{CGAL::Epeck_d<Dim>}
 \cgalHasModelsEnd
 
 \sa `TriangulationTraits`
diff --git a/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h
index 35b31839b7ab..1afb3084639a 100644
--- a/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h
+++ b/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h
@@ -9,8 +9,9 @@ a regular triangulation. It corresponds to the first template parameter of the c
 
 \cgalRefines{TriangulationTraits}
 
-\cgalHasModelsBegin CGAL::Epick_d<Dim>
-\cgalHasModels CGAL::Epeck_d<Dim>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Epick_d<Dim>}
+\cgalModels{CGAL::Epeck_d<Dim>}
 \cgalHasModelsEnd
 
 \sa `TriangulationTraits`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h
index d92afbd427e6..b72f4ee1fd0a 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h
@@ -15,7 +15,8 @@ The dimension of a face is implicitly set when
 `TriangulationDSFace::set_index` is called two times to set the
 first two vertices (`i = 0` and `i = 1`), then the dimension is 1.
 
-\cgalHasModelsBegin CGAL::Triangulation_face<TriangulationDataStructure_>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_face<TriangulationDataStructure_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSFullCell`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h
index 3e32c2423a22..231e29f5a08f 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h
@@ -36,8 +36,9 @@ of `CGAL::Triangulation_data_structure::Vertex`.
 
 \cgalRefines{TriangulationDataStructure::FullCell}
 
-\cgalHasModelsBegin CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>
-\cgalHasModels CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>}
+\cgalModels{CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSVertex`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h
index c23aaabe1ea7..51fb7cad627c 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h
@@ -36,8 +36,9 @@ of `CGAL::Triangulation_data_structure::Vertex`.
 
 \cgalRefines{TriangulationDataStructure::Vertex}
 
-\cgalHasModelsBegin CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>
-\cgalHasModels CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>}
+\cgalModels{CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSFullCell`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
index c17ded6feb1e..a8da6d398490 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
@@ -69,7 +69,8 @@ The classes `Vertex` and
 `Full_cell` have to provide the relevant I/O operators
 (possibly empty).
 
-\cgalHasModelsBegin CGAL::Triangulation_data_structure<Dimensionality, TriangulationDSVertex_, TriangulationDSFullCell_>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_data_structure<Dimensionality, TriangulationDSVertex_, TriangulationDSFullCell_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure::Vertex`
@@ -661,8 +662,9 @@ It sets requirements of combinatorial nature
 only, as geometry is not concerned here. In particular, we only require that
 the vertex holds a handle to a full cell incident to it in the triangulation.
 
-\cgalHasModelsBegin CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>
-\cgalHasModels CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>}
+\cgalModels{CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure::FullCell`
@@ -769,8 +771,9 @@ full cell as well as handles to the adjacent full cells. Two full cells
 are said to be adjacent when they share a facet. Adjacent full cells are
 called hereafter neighbors.
 
-\cgalHasModelsBegin CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>
-\cgalHasModels CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>}
+\cgalModels{CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure::FullCell`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h
index eba0214810a1..95cac2eab13c 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h
@@ -10,7 +10,8 @@ represent a full cell.
 \cgalRefines{TriangulationDSFullCell We only list below the
 additional specific requirements of `TriangulationFullCell`}
 
-\cgalHasModelsBegin CGAL::Triangulation_full_cell<TriangulationTraits_, TriangulationDSFullCell_>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_full_cell<TriangulationTraits_, TriangulationDSFullCell_>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h
index 3d004b52c286..198e3a736502 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h
@@ -14,8 +14,9 @@ traits must refine `SpatialSortingTraits_d`. The insertion is
 then optimized using spatial sorting.
 This is not required if the points are inserted one by one.
 
-\cgalHasModelsBegin CGAL::Epick_d<Dim>
-\cgalHasModels CGAL::Epeck_d<Dim>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Epick_d<Dim>}
+\cgalModels{CGAL::Epeck_d<Dim>}
 \cgalHasModelsEnd
 
 \sa `DelaunayTriangulationTraits`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h b/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h
index 956acd269f14..457339f28b0e 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h
@@ -12,7 +12,8 @@ We only list below the additional specific requirements of ::TriangulationVertex
 Compared to ::TriangulationDSVertex, the main difference is the addition of
 an association of the vertex with a geometric point.
 
-\cgalHasModelsBegin CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>}
 \cgalHasModelsEnd
 
 \cgalHeading{Input/Output}
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h
index bf4b52d43c46..cf9b15d466ef 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedDelaunayTriangulationTraits_2.h
@@ -17,9 +17,11 @@ The concept `ConstrainedDelaunayTriangulationTraits_2` refines both the concept
 
 \cgalRefines{DelaunayTriangulationTraits_2,ConstrainedTriangulationTraits_2}
 
-\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_xy_3<K>
-\cgalHasModels CGAL::Projection_traits_yz_3<K>
-\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModels{CGAL::Projection_traits_xy_3<K>}
+\cgalHasModels{CGAL::Projection_traits_yz_3<K>}
+\cgalHasModels{CGAL::Projection_traits_xz_3<K>}
 \cgalHasModelsEnd
 
 
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h
index a5a98882faa6..73951fc22c16 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h
@@ -19,7 +19,8 @@ constraints.
 
 Defines the same types as the `TriangulationFaceBase_2` concept
 
-\cgalHasModelsBegin CGAL::Constrained_triangulation_face_base_2<Traits>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Constrained_triangulation_face_base_2<Traits>}
 \cgalHasModelsEnd
 
 \sa `TriangulationFaceBase_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
index 0af956128561..892053e3bac0 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationTraits_2.h
@@ -19,10 +19,12 @@ to compute the squared distance between a point and a line
 
 \cgalRefines{TriangulationTraits_2}
 
-\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_3<K>
-\cgalHasModels CGAL::Projection_traits_xy_3<K>
-\cgalHasModels CGAL::Projection_traits_yz_3<K>
-\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModels{CGAL::Projection_traits_3<K>}
+\cgalHasModels{CGAL::Projection_traits_xy_3<K>}
+\cgalHasModels{CGAL::Projection_traits_yz_3<K>}
+\cgalHasModels{CGAL::Projection_traits_xz_3<K>}
 \cgalHasModelsEnd
 
 \sa `TriangulationTraits_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h
index d223c281d3c0..f76e24c327a2 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/DelaunayTriangulationTraits_2.h
@@ -22,12 +22,14 @@ required if the  method `nearest_vertex()` is used.
 \cgalRefines{TriangulationTraits_2}
 
 
-\cgalHasModelsBare{All models of the \cgal concept `Kernel`\n
-              `CGAL::Projection_traits_3<K>` (not for dual Voronoi functions)\n
-              `CGAL::Projection_traits_xy_3<K>` (not for dual Voronoi functions)\n
-              `CGAL::Projection_traits_xy_3<K>` (not for dual Voronoi functions)\n
-              `CGAL::Projection_traits_yz_3<K>` (not for dual Voronoi functions)\n
-              `CGAL::Projection_traits_xz_3<K>` (not for dual Voronoi functions)}
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsBare{`CGAL::Projection_traits_3<K>` (not for dual Voronoi functions)}
+\cgalHasModelsBare{`CGAL::Projection_traits_xy_3<K>` (not for dual Voronoi functions)}
+\cgalHasModelsBare{`CGAL::Projection_traits_xy_3<K>` (not for dual Voronoi functions)}
+\cgalHasModelsBare{`CGAL::Projection_traits_yz_3<K>` (not for dual Voronoi functions)}
+\cgalHasModelsBare{`CGAL::Projection_traits_xz_3<K>` (not for dual Voronoi functions)}
+\cgalHasModelsEnd
 
 \sa `TriangulationTraits_2`
 */
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h
index 26c24a4e86ba..4ec205577472 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h
@@ -34,7 +34,8 @@ in the face a list to store hidden vertices.
 
 \cgalRefines{TriangulationFaceBase_2}
 
-\cgalHasModelsBegin CGAL::Regular_triangulation_face_base_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Regular_triangulation_face_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationFaceBase_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h
index e935587ab864..71dc4f724682 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationTraits_2.h
@@ -18,7 +18,9 @@ of Delaunay triangulations.
 
 \cgalRefines{TriangulationTraits_2}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 
 \sa `CGAL::Regular_triangulation_2`
 
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h
index af73baa96815..feee66c0b110 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h
@@ -35,7 +35,8 @@ vertex of the triangulation or a hidden vertex.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModelsBegin CGAL::Regular_triangulation_vertex_base_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Regular_triangulation_vertex_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationVertexBase_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h
index 17ee831ec0be..9a364975955b 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h
@@ -16,7 +16,8 @@ and only provided for symmetry with the vertex case.
 
 \cgalRefines{TriangulationDSFaceBase_2}
 
-\cgalHasModelsBegin CGAL::Triangulation_face_base_2<Traits>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_face_base_2<Traits>}
 \cgalHasModelsEnd
 
 \sa `TriangulationVertexBase_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h
index 497c1fadde72..83e3992d81ce 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h
@@ -14,7 +14,8 @@ next and previous level triangulations.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModelsBegin CGAL::Triangulation_hierarchy_vertex_base_2<Vb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_hierarchy_vertex_base_2<Vb>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Triangulation_hierarchy_2<Tr>`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h
index f158bbeea8d6..0d810e92288c 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationTraits_2.h
@@ -12,10 +12,12 @@ provides the types of the geometric primitives used in the
 triangulation and some function object types for the required
 predicates on those primitives.
 
-\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} CGAL::Projection_traits_3<K>
-\cgalHasModels CGAL::Projection_traits_xy_3<K>
-\cgalHasModels CGAL::Projection_traits_yz_3<K>
-\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModels{CGAL::Projection_traits_3<K>}
+\cgalHasModels{CGAL::Projection_traits_xy_3<K>}
+\cgalHasModels{CGAL::Projection_traits_yz_3<K>}
+\cgalHasModels{CGAL::Projection_traits_xz_3<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Triangulation_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h
index c5e59974834d..8cca35af421a 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h
@@ -8,7 +8,8 @@ and provides an additional information storage.
 
 \cgalRefines{TriangulationVertexBase_2}
 
-\cgalHasModelsBegin CGAL::Triangulation_vertex_base_with_info_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_vertex_base_with_info_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h
index 816e93b382ac..9790b02cecc3 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h
@@ -15,7 +15,8 @@ the vertex base of a triangulation stores a point.
 
 \cgalRefines{TriangulationDSVertexBase_2}
 
-\cgalHasModelsBegin CGAL::Triangulation_vertex_base_2<Traits,Vb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_vertex_base_2<Traits,Vb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h
index 4df0ce0f7527..b71b96cc4392 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h
@@ -11,8 +11,9 @@ in the cell an operator that computes its circumcenter.
 
 \cgalRefines{TriangulationCellBase_3}
 
-\cgalHasModelsBegin CGAL::Delaunay_triangulation_cell_base_3
-\cgalHasModels CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Delaunay_triangulation_cell_base_3}
+\cgalModels{CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3}
 \cgalHasModelsEnd
 
 \sa `DelaunayTriangulationTraits_3`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h
index b727b6013c9d..3493e4ef1faf 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h
@@ -10,13 +10,14 @@ predicates and constructions on these objects.
 
 \cgalRefines{TriangulationTraits_3}
 
-\cgalHasModelsBegin CGAL::Exact_predicates_inexact_constructions_kernel (recommended)
-\cgalHasModels CGAL::Exact_predicates_exact_constructions_kernel (recommended for Voronoi)
-\cgalHasModels CGAL::Filtered_kernel
-\cgalHasModels CGAL::Cartesian
-\cgalHasModels CGAL::Simple_cartesian
-\cgalHasModels CGAL::Homogeneous
-\cgalHasModels CGAL::Simple_homogeneous
+\cgalHasModelsBegin
+\cgalModels{CGAL::Exact_predicates_inexact_constructions_kernel (recommended)}
+\cgalModels{CGAL::Exact_predicates_exact_constructions_kernel (recommended for Voronoi)}
+\cgalModels{CGAL::Filtered_kernel}
+\cgalModels{CGAL::Cartesian}
+\cgalModels{CGAL::Simple_cartesian}
+\cgalModels{CGAL::Homogeneous}
+\cgalModels{CGAL::Simple_homogeneous}
 \cgalHasModelsEnd
 
 In addition to the requirements described for the traits class of
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h
index 9c7764481069..cd00268b2b91 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h
@@ -19,7 +19,8 @@ circumcenter by calling `invalidate_weighted_circumcenter_cache()`.
 
 \cgalRefines{RegularTriangulationCellBase_3}
 
-\cgalHasModelsBegin CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3}
 \cgalHasModelsEnd
 
 \sa `RegularTriangulationTraits_3`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h
index b7362aca63ff..b95816da2963 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h
@@ -35,7 +35,8 @@ and an operator to compute its weighted circumcenter.
 
 \cgalRefines{TriangulationCellBase_3}
 
-\cgalHasModelsBegin CGAL::Regular_triangulation_cell_base_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Regular_triangulation_cell_base_3}
 \cgalHasModelsEnd
 
 \sa `RegularTriangulationTraits_3`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h
index 41cd3c59fbc1..cea91c4d670d 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationTraits_3.h
@@ -15,7 +15,9 @@ or the weighted point \f$ {p}^{(w)}=(p,w_p)\f$.
 
 \cgalRefines{TriangulationTraits_3}
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 
 \sa `CGAL::Regular_triangulation_3`
 
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h
index aa5da85428da..09d9ce0a0fc0 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h
@@ -9,7 +9,8 @@ by adding a geometric point member.
 
 \cgalRefines{TriangulationDSVertexBase_3}
 
-\cgalHasModelsBegin CGAL::Regular_triangulation_vertex_base_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Regular_triangulation_vertex_base_3}
 \cgalHasModelsEnd
 
 \sa `RegularTriangulationCellBase_3`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h
index 4efba49955ac..84add9f98c93 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h
@@ -8,7 +8,8 @@ and provides an additional information storage.
 
 \cgalRefines{TriangulationCellBase_3}
 
-\cgalHasModelsBegin CGAL::Triangulation_cell_base_with_info_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_cell_base_with_info_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h
index 419ba6c4417a..8b26efc32c47 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h
@@ -10,8 +10,9 @@ structure apply.
 
 \cgalRefines{TriangulationDSCellBase_3}
 
-\cgalHasModelsBegin CGAL::Triangulation_cell_base_3
-\cgalHasModels CGAL::Triangulation_cell_base_with_info_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_cell_base_3}
+\cgalModels{CGAL::Triangulation_cell_base_with_info_3}
 \cgalHasModelsEnd
 
 \sa `TriangulationVertexBase_3`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h
index 96a428da0503..99f5fda17531 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationTraits_3.h
@@ -11,7 +11,9 @@ triangles and tetrahedra) forming the triangulation together with a few
 geometric predicates and constructions on these objects: lexicographical
 comparison, orientation in case of coplanar points and orientation in space.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 
 \sa `CGAL::Triangulation_3`
 */
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h
index 2801c4580136..37e2fd97140c 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h
@@ -8,7 +8,8 @@ and provides an additional information storage.
 
 \cgalRefines{TriangulationVertexBase_3}
 
-\cgalHasModelsBegin CGAL::Triangulation_vertex_base_with_info_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_vertex_base_with_info_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h
index 75d23eb5581a..5110b87d71f1 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h
@@ -9,8 +9,9 @@ for the triangulation data structure.
 
 \cgalRefines{TriangulationDSVertexBase_3}
 
-\cgalHasModelsBegin CGAL::Triangulation_vertex_base_3
-\cgalHasModels CGAL::Triangulation_vertex_base_with_info_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_vertex_base_3}
+\cgalModels{CGAL::Triangulation_vertex_base_with_info_3}
 \cgalHasModelsEnd
 
 \sa `TriangulationCellBase_3`
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h
index d73727aaabc0..df1da8edad50 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h
@@ -11,8 +11,9 @@ parameter of the class `CGAL::Delaunay_triangulation_on_sphere_2<Traits, Tds>`.
 To the requirements listed within the concept `TriangulationOnSphereTraits_2`,
 this concept adds types and functors requirements related to build the dual on the sphere.
 
-\cgalHasModelsBegin CGAL::Delaunay_triangulation_on_sphere_traits_2
-\cgalHasModels CGAL::Projection_on_sphere_traits_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Delaunay_triangulation_on_sphere_traits_2}
+\cgalModels{CGAL::Projection_on_sphere_traits_3}
 \cgalHasModelsEnd
 */
 class DelaunayTriangulationOnSphereTraits_2
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h
index 0d1fe175810c..5e49109a4da4 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h
@@ -19,7 +19,8 @@ then the triangulation is not an orientable triangulated surface without boundar
 In this case, fictitious faces are added to the triangulation, called <i>ghost faces</i>,
 such that the triangulation is a topological sphere.
 
-\cgalHasModelsBegin CGAL::Triangulation_on_sphere_face_base_2<Traits, Fb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_on_sphere_face_base_2<Traits, Fb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h
index 4ccf99b9a261..ea94dfc395c4 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h
@@ -13,8 +13,9 @@ triangulation and the function object types for the required predicates on those
 In particular, the traits class is expected to contain information about the sphere (center and radius)
 on which the points of the triangulation lie, as well as to provide means to change this information.
 
-\cgalHasModelsBegin CGAL::Delaunay_triangulation_on_sphere_traits_2
-\cgalHasModels CGAL::Projection_on_sphere_traits_3
+\cgalHasModelsBegin
+\cgalModels{CGAL::Delaunay_triangulation_on_sphere_traits_2}
+\cgalModels{CGAL::Projection_on_sphere_traits_3}
 \cgalHasModelsEnd
 
 \sa `DelaunayTriangulationOnSphereTraits_2`
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h
index 7701fde798b9..23f0fbce9e0c 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h
@@ -9,7 +9,8 @@ of a triangulation data structure to be plugged in a triangulation on the sphere
 It refines the concept `TriangulationDSVertexBase_2`, adding geometric information:
 the vertex base of a triangulation stores a point.
 
-\cgalHasModelsBegin CGAL::Triangulation_on_sphere_vertex_base_2<Traits,Vb>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Triangulation_on_sphere_vertex_base_2<Traits,Vb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h b/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h
index 3d656b13a16f..a39c04b2179b 100644
--- a/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h
+++ b/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h
@@ -6,9 +6,10 @@
 A model of the `Visibility_2` concept can be attached to an `Arrangement_2` instance to
 answer visibility queries within the faces of this arrangement.
 
-\cgalHasModelsBegin CGAL::Simple_polygon_visibility_2
-\cgalHasModels CGAL::Rotational_sweep_visibility_2
-\cgalHasModels CGAL::Triangular_expansion_visibility_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Simple_polygon_visibility_2}
+\cgalModels{CGAL::Rotational_sweep_visibility_2}
+\cgalModels{CGAL::Triangular_expansion_visibility_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h
index 916a678290fa..bec40a64a9f5 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h
@@ -13,15 +13,16 @@ graph they take as an argument, the last ones does.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Identity_policy_2<DG,AT>
-\cgalHasModels CGAL::Apollonius_graph_degeneracy_removal_policy_2<AG2>
-\cgalHasModels CGAL::Apollonius_graph_caching_degeneracy_removal_policy_2<AG2>
-\cgalHasModels CGAL::Delaunay_triangulation_degeneracy_removal_policy_2<DT2>
-\cgalHasModels CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2<DT2>
-\cgalHasModels CGAL::Regular_triangulation_degeneracy_removal_policy_2<RT2>
-\cgalHasModels CGAL::Regular_triangulation_caching_degeneracy_removal_policy_2<RT2>
-\cgalHasModels CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2<SDG2>
-\cgalHasModels CGAL::Segment_Delaunay_graph_caching_degeneracy_removal_policy_2<SDG2>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Identity_policy_2<DG,AT>}
+\cgalModels{CGAL::Apollonius_graph_degeneracy_removal_policy_2<AG2>}
+\cgalModels{CGAL::Apollonius_graph_caching_degeneracy_removal_policy_2<AG2>}
+\cgalModels{CGAL::Delaunay_triangulation_degeneracy_removal_policy_2<DT2>}
+\cgalModels{CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2<DT2>}
+\cgalModels{CGAL::Regular_triangulation_degeneracy_removal_policy_2<RT2>}
+\cgalModels{CGAL::Regular_triangulation_caching_degeneracy_removal_policy_2<RT2>}
+\cgalModels{CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2<SDG2>}
+\cgalModels{CGAL::Segment_Delaunay_graph_caching_degeneracy_removal_policy_2<SDG2>}
 \cgalHasModelsEnd
 
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
index 941a0b9dfbe9..452c25d3e022 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
@@ -11,10 +11,11 @@ tag is provided for determining whether this functor is defined or not.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-\cgalHasModelsBegin CGAL::Apollonius_graph_adaptation_traits_2<AG2>
-\cgalHasModels CGAL::Delaunay_triangulation_adaptation_traits_2<DT2>
-\cgalHasModels CGAL::Regular_triangulation_adaptation_traits_2<RT2>
-\cgalHasModels CGAL::Segment_Delaunay_graph_adaptation_traits_2<SDG2>
+\cgalHasModelsBegin
+\cgalModels{CGAL::Apollonius_graph_adaptation_traits_2<AG2>}
+\cgalModels{CGAL::Delaunay_triangulation_adaptation_traits_2<DT2>}
+\cgalModels{CGAL::Regular_triangulation_adaptation_traits_2<RT2>}
+\cgalModels{CGAL::Segment_Delaunay_graph_adaptation_traits_2<SDG2>}
 \cgalHasModelsEnd
 
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h
index 01749c2be48b..2c302fd96a9a 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/DelaunayGraph_2.h
@@ -18,12 +18,14 @@ iterators and circulators that allow to traverse it (completely or
 partially). All iterators and circulators must be convertible to the
 corresponding handles.
 
-\cgalHasModelsBareBegin{ `CGAL::Triangulation_hierarchy_2<Tr>` provided that `Tr` is a model of `DelaunayGraph_2`} CGAL::Delaunay_triangulation_2<Traits,Tds>
-\cgalHasModels CGAL::Regular_triangulation_2<Traits,Tds>
-\cgalHasModels CGAL::Segment_Delaunay_graph_2<Gt,DS>
-\cgalHasModels CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,STag,DS>
-\cgalHasModels CGAL::Apollonius_graph_2<Gt,Agds>
-\cgalHasModels CGAL::Apollonius_graph_hierarchy_2<Gt,Agds>
+\cgalHasModelsBegin
+\cgalHasModelsBare{ `CGAL::Triangulation_hierarchy_2<Tr>` provided that `Tr` is a model of `DelaunayGraph_2`}
+\cgalHasModels{CGAL::Delaunay_triangulation_2<Traits,Tds>}
+\cgalHasModels{CGAL::Regular_triangulation_2<Traits,Tds>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_2<Gt,DS>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_hierarchy_2<Gt,STag,DS>}
+\cgalHasModels{CGAL::Apollonius_graph_2<Gt,Agds>}
+\cgalHasModels{CGAL::Apollonius_graph_hierarchy_2<Gt,Agds>}
 \cgalHasModelsEnd
 
 \sa `AdaptationTraits_2`
diff --git a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h
index a6f6793d19c3..1bbfda65f44e 100644
--- a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h
+++ b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_2.h
@@ -5,9 +5,11 @@
 A concept that describes the set of requirements of classes used in the computation
 of analytic weights in 2D.
 
-\cgalHasModelsBareBegin{All models of the \cgal concept `Kernel`} sCGAL:Projection_traits_xy_3<K>
-\cgalHasModels CGAL::Projection_traits_yz_3<K>
-\cgalHasModels CGAL::Projection_traits_xz_3<K>
+\cgalHasModelsBegin
+\cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModels{sCGAL:Projection_traits_xy_3<K>}
+\cgalHasModels{CGAL::Projection_traits_yz_3<K>}
+\cgalHasModels{CGAL::Projection_traits_xz_3<K>}
 \cgalHasModelsEnd
 */
 class AnalyticWeightTraits_2 {
diff --git a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h
index 5aab656b6128..488c87558c0e 100644
--- a/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h
+++ b/Weights/doc/Weights/Concepts/AnalyticWeightTraits_3.h
@@ -5,7 +5,9 @@
 A concept that describes the set of requirements of classes used in the computation
 of analytic weights in 3D.
 
+\cgalHasModelsBegin
 \cgalHasModelsBare{All models of the \cgal concept `Kernel`}
+\cgalHasModelsEnd
 */
 class AnalyticWeightTraits_3 {
 
diff --git a/Weights/doc/Weights/Concepts/BarycentricWeights_2.h b/Weights/doc/Weights/Concepts/BarycentricWeights_2.h
index 95d700e8e512..76104f359294 100644
--- a/Weights/doc/Weights/Concepts/BarycentricWeights_2.h
+++ b/Weights/doc/Weights/Concepts/BarycentricWeights_2.h
@@ -5,9 +5,10 @@
 A concept that describes the set of methods required in all classes used in
 the computation of 2D generalized barycentric weights.
 
-\cgalHasModelsBegin CGAL::Weights::Wachspress_weights_2
-\cgalHasModels CGAL::Weights::Mean_value_weights_2
-\cgalHasModels CGAL::Weights::Discrete_harmonic_weights_2
+\cgalHasModelsBegin
+\cgalModels{CGAL::Weights::Wachspress_weights_2}
+\cgalModels{CGAL::Weights::Mean_value_weights_2}
+\cgalModels{CGAL::Weights::Discrete_harmonic_weights_2}
 \cgalHasModelsEnd
 */
 class BarycentricWeights_2 {

From 894b2e2f9286e4cd04be41db40aeb9007c427eb2 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Sat, 15 Jul 2023 13:20:03 +0200
Subject: [PATCH 0491/1398] issue #7395 Improvement of layout of model
 relations

Correcting permissions
---
 Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h        | 0
 Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h | 0
 2 files changed, 0 insertions(+), 0 deletions(-)
 mode change 100755 => 100644 Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
 mode change 100755 => 100644 Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h

diff --git a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
old mode 100755
new mode 100644
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h b/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h
old mode 100755
new mode 100644

From e5ec58b9207368f5b29e1f7c7e75736b48331f2e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 17 Jul 2023 16:43:12 +0100
Subject: [PATCH 0492/1398] Enable to fix the coordinates of boundary vertices

---
 .../internal/parameters_interface.h           |    1 +
 .../CGAL/Variational_shape_approximation.h    |   43 +-
 .../Surface_mesh_approximation/CMakeLists.txt |    3 +
 .../Surface_mesh_approximation/data/patch.ply | 7242 +++++++++++++++++
 .../vsa_border_test.cpp                       |  131 +
 5 files changed, 7410 insertions(+), 10 deletions(-)
 create mode 100644 Surface_mesh_approximation/test/Surface_mesh_approximation/data/patch.ply
 create mode 100644 Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_border_test.cpp

diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index d88c06a5f5ea..7a4a174f19ab 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -227,6 +227,7 @@ CGAL_add_named_parameter(subdivision_ratio_t, subdivision_ratio, subdivision_rat
 CGAL_add_named_parameter(relative_to_chord_t, relative_to_chord, relative_to_chord)
 CGAL_add_named_parameter(with_dihedral_angle_t, with_dihedral_angle, with_dihedral_angle)
 CGAL_add_named_parameter(optimize_anchor_location_t, optimize_anchor_location, optimize_anchor_location)
+CGAL_add_named_parameter(optimize_boundary_anchor_location_t, optimize_boundary_anchor_location, optimize_boundary_anchor_location)
 CGAL_add_named_parameter(pca_plane_t, pca_plane, pca_plane)
 
 // tetrahedral remeshing parameters
diff --git a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
index e7c4a2a8a318..d24ecb93ffa5 100644
--- a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
+++ b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
@@ -123,6 +123,7 @@ class Variational_shape_approximation {
   typedef typename Geom_traits::FT FT;
   typedef typename Geom_traits::Point_3 Point_3;
   typedef typename Geom_traits::Vector_3 Vector_3;
+  typedef typename Geom_traits::Segment_3 Segment_3;
   typedef typename Geom_traits::Plane_3 Plane_3;
   typedef typename Geom_traits::Construct_vector_3 Construct_vector_3;
   typedef typename Geom_traits::Construct_point_3 Construct_point_3;
@@ -820,6 +821,12 @@ class Variational_shape_approximation {
    *     \cgalParamDefault{`true`}
    *   \cgalParamNEnd
    *
+   *   \cgalParamNBegin{optimize_boundary_anchor_location}
+   *     \cgalParamDescription{If `true`, optimize the anchor locations of boundary vertices}
+   *     \cgalParamType{`Boolean`}
+   *     \cgalParamDefault{`true`}
+   *   \cgalParamNEnd
+   *
    *   \cgalParamNBegin{pca_plane}
    *     \cgalParamDescription{If `true`, use PCA plane fitting, otherwise use the default area averaged plane parameters}
    *     \cgalParamType{`Boolean`}
@@ -837,6 +844,7 @@ class Variational_shape_approximation {
     const bool relative_to_chord = choose_parameter(get_parameter(np, internal_np::relative_to_chord), false);
     const bool with_dihedral_angle = choose_parameter(get_parameter(np, internal_np::with_dihedral_angle), false);
     const bool optimize_anchor_location = choose_parameter(get_parameter(np, internal_np::optimize_anchor_location), true);
+    const bool optimize_boundary_anchor_location = choose_parameter(get_parameter(np, internal_np::optimize_boundary_anchor_location), true);
     const bool pca_plane = choose_parameter(get_parameter(np, internal_np::pca_plane), false);
 
     // compute averaged edge length, used in chord subdivision
@@ -862,7 +870,7 @@ class Variational_shape_approximation {
     pseudo_cdt();
 
     if (optimize_anchor_location)
-      this->optimize_anchor_location();
+      this->optimize_anchor_location(optimize_boundary_anchor_location);
 
     // check manifold-oriented
     return Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(m_tris);
@@ -1353,7 +1361,7 @@ class Variational_shape_approximation {
     const Proxy px = m_metric->fit_proxy(fvec, *m_ptm);
     const FT err = m_metric->compute_error(f, *m_ptm, px);
 
-    // original proxy map should always be falid
+    // original proxy map should always be valid
     const std::size_t prev_px_idx = get(m_fproxy_map, f);
     CGAL_assertion(prev_px_idx != CGAL_VSA_INVALID_TAG);
     // update the proxy error and proxy map
@@ -1520,7 +1528,7 @@ class Variational_shape_approximation {
 
   /*!
    * @brief finds and approximates the chord connecting the anchors.
-   * @param subdivision_ratio boundary chord approximation recursive split creterion
+   * @param subdivision_ratio boundary chord approximation recursive split criterion
    * @param relative_to_chord set `true` if the subdivision_ratio is relative to the chord length (relative sense),
    * otherwise it's relative to the average edge length (absolute sense).
    * @param with_dihedral_angle if set to `true`, add dihedral angle weight to the distance.
@@ -1845,8 +1853,8 @@ class Variational_shape_approximation {
    * @param chord_begin begin iterator of the chord
    * @param chord_end end iterator of the chord
    * @param subdivision_ratio the chord recursive split error threshold
-   * @param relative_to_chord set `true` if the subdivision_ratio is relative to the chord length (relative sense),
-   * otherwise it's relative to the average edge length (absolute sense).
+   * @param relative_to_chord set `true` if the `subdivision_ratio` is relative to the chord length (relative sense),
+   * otherwise it is relative to the average edge length (absolute sense).
    * @param with_dihedral_angle if set to `true` add dihedral angle weight to the distance.
    * @return the number of anchors of the chord apart from the first one
    */
@@ -1865,8 +1873,14 @@ class Variational_shape_approximation {
 
     bool is_boundary = is_border_edge(he_first, *m_ptm);
 
+    if(is_boundary && boundary_subdivision_ratio == 0){
+      for (Boundary_chord_iterator citr = chord_begin; *citr != he_last; ++citr) {
+        attach_anchor(*citr);
+      }
+    }
+
     // do not subdivide trivial non-circular chord
-    if ((anchor_first != anchor_last) && (chord_size < 4))
+    if ((anchor_first != anchor_last) && (chord_size < 2))
       return 1;
 
     bool if_subdivide = false;
@@ -1895,11 +1909,13 @@ class Variational_shape_approximation {
         const FT chord_len = CGAL::approximate_sqrt(chord_vec.squared_length());
         bool degenerate_chord = false;
         if (chord_len > FT(0.0)) {
+          Segment_3 seg(pt_begin, pt_end);
             chord_vec = scale_functor(chord_vec, FT(1.0) / chord_len);
             for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
-                Vector_3 vec = vector_functor(pt_begin, m_vpoint_map[target(*citr, *m_ptm)]);
-                vec = cross_product_functor(chord_vec, vec);
-                const FT dist = CGAL::approximate_sqrt(vec.squared_length());
+              //Vector_3 vec = vector_functor(pt_begin, m_vpoint_map[target(*citr, *m_ptm)]);
+              //vec = cross_product_functor(chord_vec, vec);
+              //const FT dist = CGAL::approximate_sqrt(vec.squared_length());
+              const FT dist = CGAL::approximate_sqrt(CGAL::squared_distance(m_vpoint_map[target(*citr, *m_ptm)], seg));
                 if (dist > dist_max) {
                     chord_max = citr;
                     dist_max = dist;
@@ -2007,9 +2023,15 @@ class Variational_shape_approximation {
    * @brief optimizes the anchor location by averaging the projection points of
    * the anchor vertex to the incident proxy plane.
    */
-  void optimize_anchor_location() {
+  void optimize_anchor_location(bool optimize_boundary_anchor_location) {
     for(Anchor& a : m_anchors) {
       const vertex_descriptor v = a.vtx;
+
+      if(! optimize_boundary_anchor_location && is_border(v,*m_ptm)){
+        a.pos  = m_vpoint_map[v];
+        continue;
+      }
+
       // incident proxy set
       std::set<std::size_t> px_set;
       for(halfedge_descriptor h : halfedges_around_target(v, *m_ptm)) {
@@ -2018,6 +2040,7 @@ class Variational_shape_approximation {
       }
 
       // projection
+      // todo: replace averaging by qem/svd ?  Mael?
       FT sum_area(0.0);
       Vector_3 vec = CGAL::NULL_VECTOR;
       const Point_3 vtx_pt = m_vpoint_map[v];
diff --git a/Surface_mesh_approximation/test/Surface_mesh_approximation/CMakeLists.txt b/Surface_mesh_approximation/test/Surface_mesh_approximation/CMakeLists.txt
index 0c2696006689..565c4480010a 100644
--- a/Surface_mesh_approximation/test/Surface_mesh_approximation/CMakeLists.txt
+++ b/Surface_mesh_approximation/test/Surface_mesh_approximation/CMakeLists.txt
@@ -15,6 +15,9 @@ if(NOT TARGET CGAL::Eigen3_support)
   return()
 endif()
 
+create_single_source_cgal_program("vsa_border_test.cpp")
+target_link_libraries(vsa_border_test PUBLIC CGAL::Eigen3_support)
+
 create_single_source_cgal_program("vsa_class_interface_test.cpp")
 target_link_libraries(vsa_class_interface_test PUBLIC CGAL::Eigen3_support)
 
diff --git a/Surface_mesh_approximation/test/Surface_mesh_approximation/data/patch.ply b/Surface_mesh_approximation/test/Surface_mesh_approximation/data/patch.ply
new file mode 100644
index 000000000000..364b5f9aabbb
--- /dev/null
+++ b/Surface_mesh_approximation/test/Surface_mesh_approximation/data/patch.ply
@@ -0,0 +1,7242 @@
+ply
+format ascii 1.0
+comment Generated by the CGAL library
+element vertex 2447
+property double x
+property double y
+property double z
+property double nx
+property double ny
+property double nz
+element face 4782
+property list uchar int vertex_indices
+end_header
+-0.75826000000000005 0.54113988888888898 0.36264583333333333 -0.75622976135463471 0.54684065776048973 0.35927961681897197
+-0.78766433333333341 0.51201688888888897 0.34165722222222228 -0.79001324215789526 0.50665328567126411 0.34522677377874855
+-0.77195166666666681 0.50529522222222223 0.38479933333333333 -0.77420418144639147 0.49978933334325654 0.38835358593326552
+-0.99941161111111121 3.4232277777777774e-20 0.021995049999999999 -0.99958446617462626 -2.0523682663206295e-15 0.028825249042943129
+-0.99882022222222233 0.040796122222222224 4.3368086899420177e-19 -0.99914193989515954 0.040847444046735917 0.0068461856084904736
+-0.99941161111111121 -3.4232277777777774e-20 -0.021995049999999999 -0.99958446617462626 2.0523682663206295e-15 -0.028825249042943129
+-0.80174361111111114 0.51750016666666665 0.29783744444444449 -0.79978164904250193 0.5231015439045873 0.29447256004506339
+-0.7732636111111113 0.54721044444444444 0.31926572222222216 -0.77115959471535744 0.55276167927063702 0.31585978757725908
+-0.81533755555555576 0.4819113888888889 0.3198327777777778 -0.81758917689195121 0.47647000112002424 0.32330214329915274
+-0.82846038888888895 0.48680316666666668 0.27564744444444444 -0.83086036960663368 0.48141377280591013 0.27912689868571872
+-0.81533755555555576 0.4819113888888889 -0.31983277777777774 -0.81758917689195076 0.47647000112002419 -0.3233021432991538
+-0.82846038888888895 0.48680316666666668 -0.27564744444444444 -0.8308603696066339 0.4814137728059108 -0.27912689868571705
+-0.80174361111111114 0.51750016666666665 -0.29783744444444449 -0.79978164904250193 0.52310154390458719 -0.29447256004506345
+-0.78766433333333341 0.51201688888888897 -0.34165722222222222 -0.7900132421578957 0.50665328567126289 -0.34522677377874939
+-0.99916700000000003 -0.040814099999999999 -6.1618700000000003e-19 -0.99916825377459861 -0.040777452703906501 1.2600130267877126e-15
+-0.93117244444444447 0.19398261111111118 -0.3076140555555556 -0.92938877700071298 0.19325624268883035 -0.3144654604991064
+-0.93226716666666665 0.15455455555555558 -0.32609811111111114 -0.93246959373151495 0.14840348705326067 -0.32935825752000836
+-0.94538383333333342 0.15677755555555556 -0.2846197777777778 -0.94569372795329421 0.15056734547377298 -0.28808479200884973
+-0.5612852777777777 0.77439555555555573 0.29087622222222226 -0.55808340102141651 0.77882581579776655 0.28630973813566335
+-0.57617288888888907 0.77771266666666694 0.25007472222222227 -0.57289159414568047 0.78195748497442719 0.24563736085882676
+-0.59849038888888884 0.75140127777777788 0.27666483333333336 -0.60078098363085097 0.7524378919901541 0.26999894148859221
+-0.75526788888888907 0.65450761111111122 -0.022994172222222223 -0.75133876107007358 0.65938852075399312 -0.026397818310375531
+-0.7795405555555559 0.62581566666666677 4.7704895589362195e-18 -0.7759503976758112 0.63078461022977483 0.003428679632378061
+-0.75526788888888907 0.65450761111111122 0.022994172222222223 -0.75133876107007358 0.65938852075399301 0.026397818310375489
+-0.74804966666666672 0.65319355555555558 0.1144236777777778 -0.7435687042883129 0.65820381141759288 0.11778507816507716
+-0.76921911111111108 0.62333266666666676 0.1381342888888889 -0.76481502020556891 0.62851062850378847 0.14153577189434507
+-0.74111677777777796 0.65159588888888886 0.15967583333333338 -0.7463954459564115 0.64681512694105325 0.15660150004313131
+-0.284632 0.945716 0.156864 -0.30545461554927217 0.93936774136294965 0.15583877670951099
+-0.32609811111111114 0.93226716666666665 0.15455455555555558 -0.32935825752000947 0.93246959373151428 0.14840348705326251
+-0.30765300000000001 0.93148799999999998 0.19411200000000001 -0.32162863465033936 0.92711583618108895 0.19238307533460075
+-0.71130488888888888 0.6788725000000001 0.18030416666666668 -0.70824252605277271 0.68351288304227864 0.1766427553159764
+-0.67984705555555558 0.70512544444444458 0.19986166666666666 -0.68162419148185194 0.70592110047367851 0.19251976909590959
+-0.68933433333333338 0.70698838888888893 0.15598661111111109 -0.69503727204225418 0.70247712477229041 0.15313092321186222
+-0.58315799999999995 0.74718649999999998 0.31775344444444448 -0.58012540746335661 0.751811250547471 0.31342360339598258
+-0.61224105555555552 0.75451727777777799 0.23497366666666666 -0.61433218032304737 0.75533943219617827 0.228162911949085
+-0.58949688888888896 0.77990294444444463 0.20883044444444449 -0.591506012150673 0.78052499673159581 0.20224086398834004
+-0.94538383333333342 0.15677755555555556 0.2846197777777778 -0.94569372795329287 0.15056734547377257 0.28808479200885445
+-0.93226716666666665 0.15455455555555558 0.32609811111111114 -0.93246959373151428 0.14840348705326251 0.32935825752000947
+-0.93117244444444447 0.19398261111111118 0.30761405555555554 -0.92938877700071298 0.19325624268883038 0.31446546049910601
+-0.60117361111111123 0.78098961111111131 0.16742283333333338 -0.59535801362678342 0.78518859080253556 0.17037521088438706
+-0.61107305555555569 0.78110516666666663 0.12596880555555556 -0.60556810884364143 0.78527442750862131 0.12896254903088239
+-0.63459266666666669 0.75765061111111098 0.15045633333333333 -0.62911940905975205 0.76199464803136552 0.15353476972941263
+-0.75140127777777788 0.27666483333333336 0.59849038888888884 -0.7524378919901541 0.26999894148859221 0.60078098363085097
+-0.74718649999999998 0.31775344444444448 0.58315799999999995 -0.751811250547471 0.31342360339598258 0.58012540746335661
+-0.77439555555555573 0.29087622222222226 0.5612852777777777 -0.77882581579776655 0.28630973813566341 0.55808340102141663
+-0.92968266666666677 0.35567749999999998 -0.092067066666666683 -0.93196779945019714 0.34965588491567462 -0.095795526679452389
+-0.94505249999999996 0.31850488888888884 -0.068722372222222231 -0.94487952639231221 0.31840610421006571 -0.07629045422861673
+-0.93279822222222231 0.3564471111111111 -0.046091599999999996 -0.9352783456551762 0.35038106966600985 -0.049875065596141063
+-0.77771266666666694 0.25007472222222227 0.57617288888888885 -0.78195748497442552 0.24563736085882876 0.5728915941456818
+-0.73072755555555569 0.68219300000000016 5.6378512969246231e-18 -0.72681013668366656 0.6868299749905763 -0.0034074430757136684
+-0.5612852777777777 0.7743955555555555 -0.29087622222222226 -0.55808340102141885 0.77882581579776478 -0.28630973813566368
+-0.58315800000000007 0.74718650000000009 -0.31775344444444453 -0.58012540746335517 0.75181125054747355 -0.31342360339597947
+-0.59849038888888895 0.75140127777777788 -0.27666483333333336 -0.60078098363085142 0.75243789199015432 -0.26999894148859066
+-0.57617288888888896 0.77771266666666694 -0.25007472222222227 -0.57289159414568036 0.78195748497442719 -0.24563736085882737
+-0.94356911111111119 0.19638261111111116 -0.26540377777777785 -0.94420750341940884 0.19027795367498715 -0.26882427500459549
+-0.94356911111111119 0.19638261111111113 0.26540377777777779 -0.94420750341940818 0.19027795367498926 0.2688242750045966
+-0.50936000000000003 0.71579222222222227 0.47696161111111113 -0.51277920220439133 0.71781220424093606 0.47095979576753355
+-0.46877138888888903 0.73594822222222223 0.48778372222222227 -0.47224458307062456 0.73804828671333833 0.48194375215366986
+-0.48942533333333338 0.74676500000000012 0.44956438888888894 -0.49266984128746649 0.74863058746933697 0.44365377378209919
+-0.37778600000000001 0.67791999999999997 0.63063599999999997 -0.40136180945431438 0.66376634383374467 0.63112830605602033
+-0.40173900000000001 0.69467100000000004 0.59668900000000002 -0.40171258809428867 0.69470270790359101 0.59667004633885057
+-0.41935794444444441 0.66016838888888907 0.62258750000000007 -0.4155867519106578 0.65774418987695715 0.62821989169354919
+-0.97496966666666673 0.2015737777777778 0.09000205 -0.97466028087315248 0.20147411345876459 0.097188057364433172
+-0.98414455555555547 0.16200311111111113 0.067180683333333324 -0.98399619015928708 0.16196416334314798 0.074290696218046348
+-0.98016833333333342 0.16149394444444445 0.11177085555555555 -0.97972447345757396 0.16136488341997382 0.11874902318393063
+-0.98016833333333331 0.16149394444444445 -0.11177085555555555 -0.97972447345757363 0.16136488341997368 -0.11874902318393306
+-0.98414455555555558 0.16200311111111113 -0.067180683333333338 -0.98399619015928652 0.16196416334315189 -0.074290696218046404
+-0.97496966666666673 0.2015737777777778 -0.09000205 -0.97466028087315248 0.20147411345876462 -0.097188057364433103
+-0.71579222222222227 0.47696161111111113 0.50936000000000003 -0.71781220424093606 0.47095979576753355 0.51277920220439133
+-0.73594822222222223 0.48778372222222227 0.46877138888888903 -0.73804828671333833 0.48194375215366986 0.47224458307062456
+-0.74676500000000012 0.44956438888888894 0.48942533333333338 -0.74863058746933697 0.44365377378209908 0.49266984128746644
+-0.67768672222222215 0.63041288888888891 0.37765505555555556 -0.67523547363985215 0.63580255343595515 0.37391465360785747
+-0.69442822222222234 0.59648461111111117 0.40159044444444447 -0.69213285028072336 0.60215091308302471 0.39795275528077639
+-0.66016838888888907 0.62258750000000007 0.41935794444444441 -0.65774418987695715 0.62821989169354919 0.4155867519106578
+-0.54506144444444449 0.76974894444444453 0.33124288888888898 -0.54190948364204006 0.77435972940169828 0.32665137535260158
+-0.56648211111111113 0.74160044444444451 0.35839366666666667 -0.56349687759284506 0.74644575354313181 0.35396328335088706
+-0.86174150000000005 0.49800805555555555 0.093204683333333357 -0.85921887787391815 0.50370123562967883 0.089599024158859564
+-0.85643122222222223 0.49636094444444451 0.13946366111111111 -0.85409111315639963 0.50205646360201817 0.13589583430958266
+-0.83918061111111109 0.53060388888888887 0.11635206111111114 -0.83660195728872988 0.5360652123901426 0.11283285481533098
+-0.54858188888888881 0.73454266666666679 0.39851677777777783 -0.54563674223181935 0.73959227525466842 0.3940606703418521
+-0.52952149999999998 0.72595138888888888 0.43806994444444453 -0.52661743606786326 0.73121205036954717 0.43359314273137761
+-0.50905750000000005 0.75598850000000006 0.41067372222222226 -0.5059964478844069 0.76101382125491979 0.4059871409137828
+-0.90825894444444466 0.34975538888888891 0.22812300000000002 -0.90998987808509801 0.34392612395842415 0.23158852096251026
+-0.89795138888888903 0.38766055555555556 0.20664461111111113 -0.90000506801376501 0.38184952843487757 0.21019470779160887
+-0.91736605555555562 0.35238222222222232 0.18320683333333337 -0.91928685361828566 0.34644372502988785 0.1867844376601222
+-0.47696161111111113 0.50936000000000003 0.71579222222222227 -0.4709597957675335 0.51277920220439122 0.71781220424093595
+-0.48796200000000001 0.46893600000000002 0.73620099999999999 -0.48795816122222951 0.46889694247011066 0.73622855842381074
+-0.44971800000000001 0.48959900000000001 0.74702500000000005 -0.46156499534407014 0.50616100802206843 0.72853194098207674
+-0.86615722222222247 0 0.49935283333333336 -0.86528710791410368 0.0058161984086357926 0.50124284804246111
+-0.87306355555555581 0.033121194444444439 0.485991888888889 -0.87575003239765592 0.028044417257714328 0.48194957352007262
+-0.88327516666666672 6.8184444444444446e-20 0.46833050000000009 -0.88229182417334762 -0.0059344385625642428 0.4706654007209512
+-0.63041288888888891 0.37765505555555556 0.67768672222222215 -0.63580255343595515 0.37391465360785747 0.67523547363985215
+-0.59648461111111117 0.40159044444444447 0.69442822222222234 -0.60215091308302471 0.39795275528077645 0.69213285028072336
+-0.62258750000000007 0.41935794444444441 0.66016838888888907 -0.62821989169354919 0.4155867519106578 0.65774418987695715
+-0.76974894444444453 0.33124288888888898 0.54506144444444449 -0.77435972940169828 0.32665137535260158 0.54190948364204006
+-0.74160044444444451 0.35839366666666667 0.56648211111111113 -0.74644575354313181 0.35396328335088706 0.56349687759284506
+-0.91736605555555562 0.35238222222222232 -0.18320683333333337 -0.91928685361828599 0.34644372502988552 -0.1867844376601244
+-0.89795138888888903 0.38766055555555556 -0.20664461111111113 -0.90000506801376357 0.3818495284348809 -0.21019470779160895
+-0.90825894444444466 0.34975538888888896 -0.22812300000000002 -0.90998987808509779 0.34392612395842459 -0.2315885209625107
+-0.73454266666666679 0.39851677777777783 0.54858188888888881 -0.73959227525466853 0.3940606703418521 0.54563674223181946
+-0.72595138888888888 0.43806994444444453 0.52952149999999998 -0.73121205036954706 0.43359314273137756 0.52661743606786326
+-0.75598850000000006 0.41067372222222226 0.50905750000000005 -0.76101382125491979 0.40598714091378285 0.5059964478844069
+-0.83918061111111109 0.53060388888888899 -0.11635206111111113 -0.83660195728873032 0.53606521239014215 -0.11283285481532941
+-0.85643122222222223 0.49636094444444451 -0.13946366111111108 -0.85409111315639796 0.5020564636020215 -0.13589583430958052
+-0.86174150000000005 0.49800805555555561 -0.093204683333333344 -0.85921887787391704 0.50370123562968006 -0.089599024158862728
+-0.66016838888888896 0.62258750000000007 -0.41935794444444441 -0.65774418987695826 0.6282198916935483 -0.41558675191065736
+-0.69442822222222234 0.59648461111111117 -0.40159044444444447 -0.69213285028072413 0.60215091308302537 -0.39795275528077395
+-0.67768672222222215 0.6304128888888888 -0.37765505555555556 -0.6752354736398527 0.6358025534359546 -0.37391465360785703
+-0.39497500000000002 0.64293699999999998 0.65622199999999997 -0.40546874587029513 0.64313488021939214 0.64959419791709827
+-0.438226 0.52970399999999995 0.72620399999999996 -0.44885899031823706 0.52953232505707337 0.71980630973209914
+-0.68793472222222229 0.36971155555555557 0.62399500000000008 -0.68945393975167257 0.36307230281365693 0.62676292798033717
+-0.71182900000000005 0.38485688888888897 0.58693700000000004 -0.71337613272082079 0.37843274998841775 0.58981619764168025
+-0.71834377777777791 0.34402016666666668 0.6041117222222222 -0.71971741204167938 0.33745518253232804 0.60673787304411819
+-0.78059327777777765 0.084315716666666679 0.61885927777777783 -0.78075466757073098 0.077163358696741069 0.620054808175177
+-0.75790999999999997 0.064948400000000003 0.64911799999999997 -0.773267268887874 0.070998529113733264 0.63009280247466304
+-0.758131 0.107887 0.64311600000000002 -0.76613576512856874 0.11369176635172877 0.63254262437774611
+-0.76982988888888892 0.58579227777777787 -0.25202805555555563 -0.76737501432410749 0.59109138934630023 -0.24848854466903775
+-0.78042783333333343 0.5893477222222222 -0.20715500000000001 -0.7778237708586162 0.59457880230514903 -0.20363258417222282
+-0.75165261111111115 0.61818911111111108 -0.22841961111111114 -0.74897430910137763 0.62329215032836771 -0.22482077227238875
+-0.48243316666666669 0.86490927777777793 0.13642550000000001 -0.48886245747926188 0.86183697576672835 0.1350945034729267
+-0.50608016666666666 0.84599500000000005 0.16607305555555557 -0.51265896621158669 0.84269657284665989 0.16444838240421003
+-0.46843350000000006 0.8657556666666667 0.17444783333333336 -0.46461967977246371 0.8692030998374678 0.16915828209422798
+-0.72114805555555561 0.64606572222222236 -0.24872233333333338 -0.71841774753894727 0.65102987947107616 -0.24502252153004503
+-0.68898294444444441 0.67292155555555566 -0.26795866666666662 -0.69113884282724725 0.6740463509068223 -0.26074626893708508
+-0.70832122222222216 0.64198 -0.29233105555555561 -0.70571237059887948 0.64705626737509536 -0.28859701459703097
+-0.64288133333333342 0.75794099999999998 0.10781466666666668 -0.64419850158019154 0.75821722222775967 0.10057303057508137
+-0.61885927777777783 0.78059327777777765 0.084315716666666679 -0.620054808175177 0.78075466757073086 0.077163358696741069
+-0.61992855555555559 0.72347883333333352 -0.30264644444444444 -0.62233405661673513 0.72465725446077855 -0.29592597981982743
+-0.60411172222222231 0.71834377777777791 -0.34402016666666668 -0.60673787304411997 0.71971741204167827 -0.33745518253232731
+-0.84349833333333335 0.53190250000000006 -0.0699548888888889 -0.84005222422363224 0.53749486054694662 -0.073563139292357874
+-0.62399500000000008 0.68793472222222229 -0.36971155555555552 -0.62676292798033872 0.68945393975167202 -0.36307230281365543
+-0.64271094444444454 0.65599627777777791 -0.3948356111111111 -0.6456309694623823 0.65766065101669202 -0.38812771013593611
+-0.65963700000000003 0.6629248333333333 -0.35315727777777778 -0.66230302078762193 0.66440626695153993 -0.3462932588011351
+-0.84349833333333335 0.53190250000000006 0.0699548888888889 -0.84005222422363046 0.53749486054694962 0.073563139292355778
+-0.48243316666666669 0.86490927777777793 -0.13642550000000001 -0.48886245747925988 0.86183697576672935 -0.13509450347292715
+-0.44500061111111117 0.88374388888888911 -0.1427423888888889 -0.44112116187999789 0.88691040801339915 -0.13712056264159139
+-0.46843350000000006 0.86575566666666681 -0.17444783333333336 -0.46461967977246255 0.86920309983746857 -0.16915828209422626
+-0.36061883333333339 0.93238900000000013 4.6784453566086847e-19 -0.36405373418237241 0.93135569614837044 -0.0064378474550659346
+-0.3801107777777778 0.92384822222222251 -0.037749188888888889 -0.38369927692104505 0.92239862108724591 -0.044222717087653116
+-0.39811761111111116 0.9170195000000001 6.8184444444444446e-20 -0.40146208978194359 0.91585374040706513 -0.0063337706228314035
+-0.38011077777777785 0.92384822222222251 0.037749188888888889 -0.3836992769210455 0.92239862108724568 0.044222717087653053
+-0.44500061111111117 0.88374388888888911 0.1427423888888889 -0.44112116187999745 0.88691040801339915 0.13712056264159253
+-0.64271094444444454 0.6559962777777778 0.3948356111111111 -0.64563096946238119 0.65766065101669124 0.38812771013593905
+-0.9170195000000001 6.8184444444444446e-20 0.39811761111111116 -0.91585374040706513 -0.0063337706228314035 0.40146208978194359
+-0.92384822222222251 0.037749188888888889 0.3801107777777778 -0.9223986210872458 0.044222717087652651 0.38369927692104522
+-0.93238900000000013 4.6784453566086847e-19 0.36061883333333339 -0.93135569614837044 -0.0064378474550659346 0.36405373418237241
+-0.8657556666666667 0.17444783333333336 0.46843350000000006 -0.8692030998374678 0.16915828209422798 0.46461967977246371
+-0.88374388888888911 0.1427423888888889 0.44500061111111117 -0.88691040801339915 0.13712056264159253 0.44112116187999745
+-0.86490927777777793 0.13642550000000001 0.48243316666666669 -0.86183697576672835 0.1350945034729267 0.48886245747926188
+-0.6559962777777778 0.3948356111111111 0.64271094444444454 -0.65766065101669136 0.38812771013593905 0.64563096946238119
+-0.84599500000000005 0.16607305555555557 0.50608016666666666 -0.84269657284665989 0.16444838240421003 0.51265896621158669
+-0.78110516666666663 0.12596880555555556 0.61107305555555569 -0.78527442750862131 0.12896254903088239 0.60556810884364143
+-0.4064782222222223 0.90131850000000013 -0.1476015 -0.40247103169275317 0.90439818266630434 -0.14170743042641382
+-0.38394200000000006 0.91612616666666669 -0.11263961111111111 -0.37990979769417682 0.91886656680883383 -0.10654941584502785
+-0.3668042222222222 0.91753444444444443 -0.15149372222222224 -0.37332295099127566 0.91536790224266062 -0.15076994994705148
+-0.64882261111111128 0.75777511111111118 0.064889444444444444 -0.64977268161939916 0.75795713656690133 0.057414644024313226
+-0.34437449999999997 0.93139666666666665 -0.11520171666666668 -0.34755386944931183 0.93129562037784253 -0.10906317112508719
+-0.326102 0.93259400000000003 -0.15467700000000001 -0.33904627376153867 0.93013909011883433 -0.14102800176320596
+-0.64288133333333342 0.75794099999999998 -0.10781466666666668 -0.64419850158019087 0.75821722222775967 -0.10057303057508492
+-0.64882261111111128 0.75777511111111118 -0.064889444444444444 -0.64977268161940149 0.75795713656689923 -0.057414644024313087
+-0.61885927777777783 0.78059327777777765 -0.084315716666666679 -0.62005480817517589 0.78075466757073186 -0.077163358696740084
+-0.61107305555555558 0.78110516666666663 -0.12596880555555559 -0.60556810884364132 0.78527442750862131 -0.12896254903088247
+-0.50608016666666666 0.84599500000000016 -0.16607305555555554 -0.51265896621159002 0.84269657284665833 -0.16444838240420778
+-0.96997316666666666 0.20078738888888892 -0.13468594444444443 -0.97109442398983969 0.19442173929857137 -0.1384767380608021
+-0.92673877777777802 0.31397677777777783 -0.20464033333333337 -0.92563509877677597 0.31343256958455351 -0.21203699732860798
+-0.92417300000000002 -0.037807500000000001 0.38009900000000002 -0.92435072542991981 -0.037682359749136002 0.3796785168546119
+-0.92673877777777802 0.31397677777777777 0.20464033333333337 -0.92563509877677597 0.3134325695845534 0.21203699732860795
+-0.96997316666666678 0.20078738888888892 0.13468594444444443 -0.97109442398983981 0.19442173929856951 0.13847673806080318
+-0.38442366666666661 0.81182961111111129 0.43869994444444455 -0.38774561949271991 0.81374584068554534 0.43297926201052844
+-0.40474005555555553 0.82153555555555569 0.40071994444444453 -0.40790672687203389 0.82320169950934685 0.39490639915993631
+-0.42688794444444444 0.79472077777777772 0.43068905555555559 -0.4301031812234084 0.79652791157639247 0.4249170973039974
+-0.99527699999999997 -0.040669700000000003 0.088143899999999997 -0.99528282312395366 -0.040659635914069105 0.088084595712009217
+-0.99446699999999999 -0.0813691 0.066442200000000007 -0.9962881829039385 -0.055094892576294616 0.066139318245466691
+-0.99054699999999996 -0.0811172 0.11062 -0.99240482996690904 -0.05487374096346978 0.11009780202631003
+-0.99492755555555568 0.04065623888888889 0.088165211111111114 -0.99464326804763692 0.040620881509268507 0.095051108951587859
+-0.99006766666666679 0.040503216666666675 0.13204949444444447 -0.98948701311988685 0.040438854590617142 0.13885297946563416
+-0.99020283333333337 0.081089350000000004 0.11059171666666666 -0.98977266867453773 0.080998057719492325 0.11742818652501494
+-0.85248605555555579 0.41357311111111106 0.31864050000000005 -0.85436606501290713 0.40787184350474653 0.32202358023970945
+-0.86546133333333342 0.41817277777777767 0.27461266666666667 -0.86749023845332152 0.41249033814465857 0.27805108725826738
+-0.87581005555555569 0.38057250000000004 0.29568288888888894 -0.87753026609894647 0.37486538870813074 0.29902603971730363
+-0.81182961111111129 0.43869994444444449 0.38442366666666661 -0.81374584068554534 0.43297926201052894 0.38774561949271963
+-0.82153555555555569 0.40071994444444453 0.40474005555555553 -0.82320169950934685 0.39490639915993631 0.40790672687203389
+-0.79472077777777772 0.43068905555555559 0.42688794444444444 -0.79652791157639247 0.4249170973039974 0.43010318122340846
+-0.75734050000000008 0.58135438888888902 0.29625844444444449 -0.75499804760571387 0.5867730154058064 0.29270356421324539
+-0.74305750000000004 0.57594661111111112 0.33978666666666668 -0.74080593120528204 0.58149597524355834 0.33625734648720751
+-0.72637127777777788 0.60962966666666674 0.3162962222222222 -0.7239594587653938 0.61490789988900629 0.3126835088683283
+-0.79799688888888887 0.55622755555555559 0.23047522222222222 -0.79562365876447649 0.56166610731031885 0.22696734900223225
+-0.78042783333333343 0.5893477222222222 0.20715500000000001 -0.77782377085861565 0.59457880230515014 0.20363258417222183
+-0.80746050000000003 0.55951377777777778 0.18509111111111115 -0.80496185827090283 0.564848097364122 0.18161231685429893
+-0.81182961111111129 0.43869994444444449 -0.38442366666666661 -0.81374584068554534 0.43297926201052889 -0.38774561949271963
+-0.78411972222222215 0.46844483333333348 -0.40622622222222227 -0.78616289348646995 0.46275805394282821 -0.40963750855607428
+-0.79472077777777772 0.43068905555555559 -0.42688794444444444 -0.79652791157639247 0.42491709730399746 -0.43010318122340835
+-0.85248605555555579 0.41357311111111106 -0.31864050000000005 -0.85436606501290757 0.40787184350474476 -0.32202358023971051
+-0.86203900000000011 0.37568711111111114 -0.33920450000000008 -0.86363598405927289 0.36991552503825786 -0.34248414762385898
+-0.87581005555555569 0.38057250000000004 -0.29568288888888894 -0.87753026609894536 0.37486538870813008 -0.29902603971730735
+-0.79799688888888887 0.55622755555555559 -0.23047522222222222 -0.79562365876447716 0.56166610731031941 -0.22696734900222931
+-0.82439899999999999 0.52567461111111113 -0.20817311111111111 -0.82213680993551586 0.53122525675781385 -0.20467240246708424
+-0.80746050000000014 0.55951377777777789 -0.18509111111111115 -0.80496185827090005 0.56484809736412722 -0.18161231685429535
+-0.75734050000000008 0.58135438888888902 -0.29625844444444444 -0.75499804760571654 0.58677301540580296 -0.29270356421324539
+-0.73992438888888878 0.61438050000000011 -0.27269055555555555 -0.7373851635856109 0.61957725465031477 -0.26904859420521215
+-0.72637127777777788 0.60962966666666674 -0.31629622222222226 -0.72395945876539358 0.61490789988900663 -0.31268350886832808
+-0.99492755555555568 0.04065623888888889 -0.088165211111111114 -0.99464326804763692 0.040620881509270568 -0.095051108951586624
+-0.99411955555555553 0.081341644444444444 -0.066439672222222232 -0.9939826873272527 0.081323487946983117 -0.073381929668208432
+-0.99020283333333337 0.081089350000000004 -0.11059171666666667 -0.98977266867453773 0.080998057719492339 -0.11742818652501491
+-0.91074705555555568 0.26913238888888896 -0.31214399999999998 -0.90890151067891412 0.26821257009591476 -0.3193118556022182
+-0.92338244444444451 0.27248327777777775 -0.26913955555555558 -0.92184936072310708 0.27174562074120029 -0.27631155195246321
+-0.904893611111111 0.30796461111111118 -0.29264711111111108 -0.9031732541248243 0.30710578259799209 -0.29994017958328018
+-0.89979483333333332 0.22554461111111115 -0.37261611111111104 -0.89751437565627668 0.22449112923450024 -0.37956775203557902
+-0.880473888888889 0.25920594444444445 -0.39612783333333335 -0.87799809680948748 0.25797190334318099 -0.40319950283254852
+-0.88349500000000003 0.22000400000000001 -0.41356399999999999 -0.88533382153477225 0.23437433605922856 -0.4015628158127092
+-0.89642250000000001 0.26474783333333335 -0.35449605555555552 -0.89426493531171236 0.26368231627218103 -0.36161009603891953
+-0.89129144444444464 0.30374238888888888 -0.33565233333333344 -0.8892663730069581 0.30269216918684994 -0.34290343910787618
+-0.87603155555555556 0.29838466666666674 -0.37797294444444451 -0.87886765169052439 0.3000127490976619 -0.37092317424346305
+-0.5057854444444444 0.79106966666666656 0.34309711111111119 -0.50254310485627729 0.79565803923597878 0.33819921992897944
+-0.52762177777777775 0.76363150000000002 0.37121527777777791 -0.52452973876924802 0.76844646073764278 0.36654957390025034
+-0.48765905555555555 0.78436955555555554 0.38245261111111117 -0.48444028196230066 0.78914488875012312 0.3775817233021781
+-0.50003249999999999 0.82104761111111113 0.27421316666666667 -0.49656662413084585 0.82520664647669439 0.26917573889558338
+-0.46030505555555562 0.84081005555555555 0.28371927777777783 -0.45672953304210201 0.84491246075498017 0.27842605357277111
+-0.47681055555555563 0.84404622222222236 0.2441187222222222 -0.47005080436070795 0.8475535991229256 0.24638412678909866
+-0.72557644444444458 0.68165338888888904 -0.090725516666666672 -0.72105509486109332 0.6864659302599132 -0.094042951714903678
+-0.70192883333333345 0.70862072222222239 -0.067195216666666668 -0.69751095274066943 0.71309750342112921 -0.070501215743817208
+-0.69672588888888898 0.70813105555555556 -0.11171258333333335 -0.69195648437214297 0.71271269042737062 -0.11505148690531221
+-0.77491783333333331 0.62473655555555563 -0.092368477777777791 -0.77075970402626304 0.62988728399471605 -0.095767886637991601
+-0.76921911111111108 0.62333266666666665 -0.1381342888888889 -0.76481502020556702 0.62851062850379158 -0.14153577189434138
+-0.79562366666666662 0.59403655555555568 -0.11584435555555558 -0.79155085388212953 0.59934077256701879 -0.11932260497173411
+-0.98331377777777784 0.040291861111111112 0.17546994444444444 -0.98244224734962893 0.040209691007927671 0.18218235746541839
+-0.97666327777777773 0.080235722222222222 0.19751805555555557 -0.97674161450646324 0.073679922287240324 0.20136307393127884
+-0.98436877777777798 0.080723238888888896 0.1543238333333333 -0.983642780484002 0.080574270691352937 0.16110452291682575
+-0.37261611111111104 0.89979483333333332 -0.22554461111111115 -0.37956775203557896 0.89751437565627668 -0.22449112923450021
+-0.39622099999999999 0.88076600000000005 -0.25934699999999999 -0.40223368750987282 0.88179261970450562 -0.24627187510325857
+-0.41344566666666671 0.8832078333333333 -0.21991544444444447 -0.41723471972029164 0.88019420978770013 -0.22621525526837433
+-0.95679477777777788 0.15844944444444448 0.24241494444444445 -0.957253922897494 0.15217835599473808 0.24598104614806704
+-0.95421688888888889 0.19824288888888891 0.22246183333333336 -0.95499795117042818 0.19203700464703574 0.22605464407191181
+-0.37261611111111104 0.89979483333333343 0.22554461111111115 -0.37956775203558119 0.8975143756562759 0.22449112923449988
+-0.38997550000000003 0.9014186666666667 0.18635077777777784 -0.39662205137890139 0.89905867934786887 0.18543041673160823
+-0.41344566666666666 0.8832078333333333 0.21991544444444447 -0.41723471972029319 0.88019420978770058 0.22621525526836977
+-0.96303733333333352 0.19968938888888893 0.17887027777777781 -0.96398392948964662 0.19340360573393062 0.18256513625228218
+-0.97425194444444441 0.16074688888888888 0.15589966666666666 -0.97502829927251367 0.15431448972348011 0.15970865311288363
+-0.31221199999999999 0.91105000000000003 0.26928099999999999 -0.32644642938062607 0.90667395833593711 0.26716111622031236
+-0.33565233333333339 0.89129144444444464 0.30374238888888888 -0.34290343910787563 0.88926637300695821 0.30269216918685032
+-0.29273399999999999 0.90520199999999995 0.30808400000000002 -0.31787609208756495 0.89960107400996148 0.29945399933756389
+-0.95535638888888885 0.27982527777777777 0.091030027777777786 -0.95716518902486225 0.27355642833602034 0.094877191331949579
+-0.96771327777777782 0.24127177777777781 0.067924161111111117 -0.96755210126393731 0.24120310120227606 0.075259519731021504
+-0.96367061111111119 0.24053788888888891 0.11303783333333334 -0.96513735744308149 0.23420596052008855 0.11686509027356488
+-0.64682927777777766 0.73032194444444454 0.21814144444444444 -0.64874952367319583 0.73115312556584411 0.2110430347324887
+-0.624302388888889 0.7565968333333335 0.19279794444444445 -0.62615345904453856 0.75720239315206705 0.18594725470235343
+-0.65756433333333342 0.73233366666666677 0.17507683333333332 -0.66362446493949456 0.72791769497020165 0.17244824986945503
+-0.65524111111111105 0.698701388888889 0.28600988888888895 -0.65750678879361879 0.6998853090603091 0.27900784371027831
+-0.68898294444444441 0.67292155555555566 0.26795866666666662 -0.69113884282724714 0.6740463509068223 0.2607462689370853
+-0.67509966666666676 0.66852522222222233 0.31085699999999999 -0.67752075050682159 0.6698155557091281 0.30383013998407898
+-0.94321855555555578 0.27717322222222224 -0.18115188888888892 -0.94228341902634183 0.27673948951092475 -0.188460110297273
+-0.9496837222222223 0.23785461111111114 -0.20207944444444448 -0.9486123289692856 0.23743102670925037 -0.20919167498554797
+-0.95764555555555553 0.23940283333333337 -0.15780855555555556 -0.95893043882721785 0.23316254644213033 -0.16151668776711828
+-0.96783372222222241 0.11967674444444446 0.21977572222222225 -0.96809524945160674 0.11324714670983058 0.2235322610973938
+-0.96644272222222227 0.15975088888888891 0.19946677777777783 -0.96704939341641916 0.15340151281042119 0.20318328317164736
+-0.97648983333333361 0.12052398888888888 0.17680266666666669 -0.97692227895306438 0.11401913169306778 0.18061699392114211
+-0.96303733333333341 0.19968938888888893 -0.17887027777777781 -0.96398392948964651 0.19340360573393262 -0.18256513625228082
+-0.95586661111111115 0.07874741111111111 0.28189122222222224 -0.95564244532252396 0.072305702707574748 0.28551602766561218
+-0.96433138888888892 0.039663483333333339 0.2604433333333333 -0.96389875161482486 0.033073058984768144 0.26420705782543358
+-0.95224977777777786 0.039161361111111119 0.30173377777777782 -0.95413490889433772 0.032630324035701881 0.29759340984389904
+-0.9764898333333335 0.12052398888888889 -0.17680266666666669 -0.97692227895306427 0.1140191316930719 -0.1806169939211397
+-0.98330661111111117 0.12116736666666666 -0.13317721111111111 -0.98272289727136297 0.12101573129925847 -0.14003892300601276
+-0.97425194444444441 0.16074688888888891 -0.15589966666666666 -0.97502829927251478 0.15431448972347411 -0.15970865311288251
+-0.73032194444444454 0.21814144444444444 0.64682927777777766 -0.73115312556584411 0.21104303473248867 0.64874952367319594
+-0.7565968333333335 0.19279794444444445 0.624302388888889 -0.75720239315206705 0.18594725470235343 0.62615345904453856
+-0.73233366666666688 0.17507683333333332 0.65756433333333342 -0.72791769497020065 0.17244824986945431 0.66362446493949578
+-0.698701388888889 0.28600988888888895 0.65524111111111105 -0.6998853090603091 0.27900784371027831 0.65750678879361879
+-0.67292155555555566 0.26795866666666662 0.68898294444444441 -0.6740463509068223 0.2607462689370853 0.69113884282724714
+-0.66852522222222233 0.31085699999999999 0.67509966666666676 -0.6698155557091281 0.30383013998407898 0.67752075050682159
+-0.79106966666666656 0.34309711111111119 0.5057854444444444 -0.79565803923597878 0.33819921992897944 0.50254310485627729
+-0.76363150000000002 0.37121527777777791 0.52762177777777775 -0.76844646073764267 0.36654957390025034 0.52452973876924791
+-0.78436955555555554 0.38245261111111117 0.48765905555555555 -0.78914488875012312 0.37758172330217804 0.4844402819623006
+-0.82104761111111113 0.27421316666666667 0.50003249999999999 -0.82520664647669439 0.26917573889558338 0.49656662413084585
+-0.84081005555555555 0.28371927777777783 0.46030505555555562 -0.84491246075498005 0.27842605357277106 0.45672953304210206
+-0.84404622222222236 0.2441187222222222 0.47681055555555563 -0.8475535991229256 0.2463841267890986 0.4700508043607079
+-0.77491783333333342 0.62473655555555563 0.092368477777777805 -0.77075970402626226 0.62988728399471738 0.095767886637989297
+-0.80010511111111116 0.59522733333333333 0.069672705555555561 -0.79627330233989702 0.60049897379372186 0.073142398466292349
+-0.79562366666666673 0.59403655555555568 0.11584435555555558 -0.79155085388212976 0.59934077256701879 0.11932260497173314
+-0.72557644444444447 0.68165338888888904 0.090725516666666672 -0.72105509486109276 0.68646593025991431 0.094042951714899278
+-0.71951088888888892 0.6806121666666668 0.1356845388888889 -0.71470545688293907 0.68547533361676682 0.13899524058301874
+-0.69672588888888898 0.70813105555555556 0.11171258333333335 -0.69195648437214397 0.71271269042736951 0.11505148690531325
+-0.78656727777777768 0.55215255555555565 0.2752216111111111 -0.78432765572944318 0.55767059215724202 0.27172346071133968
+-0.50003249999999999 0.82104761111111102 -0.27421316666666667 -0.49656662413084851 0.82520664647669129 -0.26917573889558782
+-0.51557805555555547 0.82379161111111121 -0.23432688888888892 -0.51207498812294594 0.82770762440957035 -0.22951970510862521
+-0.47681055555555563 0.84404622222222236 -0.2441187222222222 -0.47005080436070662 0.84755359912292727 -0.24638412678909538
+-0.65524111111111105 0.69870138888888889 -0.28600988888888895 -0.65750678879361957 0.69988530906030799 -0.27900784371027976
+-0.64035427777777787 0.69395927777777788 -0.32815500000000003 -0.64287001300191338 0.69530483951625921 -0.32135545199698878
+-0.67509966666666676 0.66852522222222233 -0.31085699999999999 -0.67752075050682214 0.66981555570912832 -0.30383013998407749
+-0.64682927777777777 0.73032194444444454 -0.21814144444444444 -0.64874952367319727 0.73115312556584311 -0.21104303473248823
+-0.67984705555555558 0.70512544444444458 -0.19986166666666666 -0.68162419148185194 0.70592110047367851 -0.19251976909590984
+-0.65756433333333331 0.73233366666666677 -0.17507683333333332 -0.66362446493949456 0.72791769497020165 -0.17244824986945492
+-0.99819400000000003 -0.0407719 0.044118600000000001 -0.99819601042639627 -0.040749912700656421 0.044092736178590025
+-0.99747061111111113 4.3368086899420177e-19 0.066027105555555562 -0.99733709501384338 0 0.072929547573996431
+-0.95620099999999997 -0.078785400000000005 0.28190999999999999 -0.95817725084869765 -0.053265830875932035 0.28117451381149139
+-0.94326100000000002 -0.077663399999999994 0.32284400000000002 -0.94534774934638066 -0.052625365478896312 0.32178906711376221
+-0.95256300000000005 -0.0391817 0.30181000000000002 -0.95266087931704746 -0.039145135259636005 0.30150440694022168
+-0.96783372222222241 0.11967674444444446 -0.21977572222222225 -0.9680952494516063 0.11324714670983051 -0.22353226109739607
+-0.97666327777777784 0.080235722222222236 -0.19751805555555557 -0.97674161450646313 0.073679922287236382 -0.20136307393128111
+-0.89979483333333343 0.22554461111111115 0.37261611111111104 -0.8975143756562759 0.22449112923449988 0.37956775203558119
+-0.9014186666666667 0.18635077777777784 0.38997550000000003 -0.89905867934786887 0.18543041673160823 0.39662205137890139
+-0.8832078333333333 0.21991544444444447 0.41344566666666666 -0.88019420978770058 0.2262152552683698 0.41723471972029325
+-0.91074705555555568 0.26913238888888891 0.31214400000000003 -0.90890151067891423 0.26821257009591437 0.31931185560221842
+-0.89129144444444464 0.30374238888888888 0.33565233333333339 -0.88926637300695821 0.30269216918685032 0.34290343910787563
+-0.90489361111111111 0.30796461111111118 0.29264711111111108 -0.90317325412482385 0.30710578259799148 0.29994017958328173
+-0.93984338888888896 0.23587238888888892 -0.2457178888888889 -0.93848222466552245 0.23528226001218033 -0.2527713830923361
+-0.93423205555555544 0.27510183333333332 -0.22547750000000003 -0.93299691132387008 0.27452654359661416 -0.23270569464672533
+-0.56711966666666669 0.66111644444444462 0.49050405555555554 -0.56452772540213347 0.6668985735573979 0.48636893387571661
+-0.58730288888888893 0.67152450000000008 0.45102994444444444 -0.59056908713658951 0.67344595022976195 0.44463322574655667
+-0.60485722222222216 0.63779350000000001 0.4760900555555555 -0.60826718780552425 0.6398682649724019 0.46965905902086796
+-0.50647611111111113 0.67072122222222219 0.54121055555555564 -0.51023515849226175 0.67307634610093736 0.53537679755270284
+-0.52353366666666667 0.6358801111111112 0.56644616666666658 -0.52745385244712384 0.63835601474096837 0.56061932894140942
+-0.4838222777777777 0.65672061111111113 0.57786500000000007 -0.48025504911159195 0.65454711840138768 0.58388625398724892
+-0.95027572222222223 0.27875183333333337 0.13627303888888889 -0.95190385015274304 0.2725334103925558 0.1400164286224547
+-0.94094172222222217 0.31756222222222219 0.11435316111111113 -0.94045905207604241 0.31729857015080781 0.12189499066198242
+-0.96973972222222227 0.24163083333333338 0.022653605555555557 -0.96989002921873224 0.24169057243838762 0.029983302294629699
+-0.95944188888888882 0.28064922222222222 -8.6736173798840355e-19 -0.95974596445858973 0.28077100056951243 0.0074383428696254261
+-0.96973972222222227 0.24163083333333335 -0.022653605555555557 -0.96989002921873124 0.24169057243839118 -0.029983302294631926
+-0.96644272222222238 0.15975088888888891 -0.19946677777777783 -0.96704939341641927 0.15340151281041914 -0.2031832831716486
+-0.99006766666666668 0.040503216666666675 -0.13204949444444447 -0.98948701311988696 0.04043885459061921 -0.1388529794656328
+-0.66111644444444462 0.49050405555555554 0.56711966666666669 -0.6668985735573979 0.48636893387571667 0.56452772540213347
+-0.67152450000000008 0.45102994444444444 0.58730288888888893 -0.67344595022976195 0.44463322574655667 0.59056908713658951
+-0.63779350000000001 0.4760900555555555 0.60485722222222216 -0.6398682649724019 0.46965905902086791 0.60826718780552425
+-0.67072122222222219 0.54121055555555564 0.50647611111111113 -0.67307634610093725 0.53537679755270273 0.51023515849226175
+-0.6358801111111112 0.56644616666666658 0.52353366666666667 -0.63835601474096826 0.56061932894140942 0.52745385244712384
+-0.65672061111111113 0.57786500000000007 0.4838222777777777 -0.65454711840138768 0.58388625398724892 0.48025504911159195
+-0.64035427777777787 0.69395927777777788 0.32815499999999997 -0.64287001300191315 0.6953048395162591 0.32135545199698912
+-0.73992438888888878 0.61438050000000011 0.27269055555555555 -0.7373851635856099 0.6195772546503151 0.26904859420521371
+-0.80235455555555568 0.59582316666666668 -0.023256572222222223 -0.79877755276154783 0.60103244931884436 -0.026728562813277134
+-0.8247917777777779 0.56482677777777779 3.4694469519536142e-18 -0.82151047318435655 0.57018244527269668 -0.0035385804022389994
+-0.80235455555555568 0.59582316666666668 0.023256572222222223 -0.79877755276154783 0.60103244931884436 0.026728562813277141
+-0.88468250000000004 0.46485238888888897 0.023322827777777777 -0.88182388447972637 0.47080328419964923 0.027035242701159701
+-0.86605422222222228 0.49924655555555564 0 -0.86311060816384377 0.50500169952881668 0.0036553451337094441
+-0.88468250000000004 0.46485238888888897 -0.023322827777777777 -0.88182388447972548 0.47080328419965073 -0.027035242701160731
+-0.82368444444444444 0.56451983333333344 0.046607672222222223 -0.82016277944795324 0.56992861274242324 0.050143709333325626
+-0.89835083333333332 0.42852916666666674 0.092856011111111122 -0.89623954506098191 0.4345120044881825 0.089185177157113285
+-0.91652922222222222 0.3929955 0.069433894444444436 -0.91913774448605823 0.38708765318025906 0.073136553217121647
+-0.91235211111111114 0.39187466666666665 0.11550940000000001 -0.91477173011535795 0.38599423501553781 0.11916850387801492
+-0.81494088888888883 0.56195327777777782 0.13924307777777778 -0.81227206434124521 0.56726128730849124 0.13575244164259204
+-0.82038388888888891 0.56357805555555562 0.093063277777777786 -0.81661364964159788 0.56904227675642394 0.096607631597587007
+-0.92338244444444451 0.27248327777777781 0.26913955555555563 -0.92184936072310664 0.27174562074120051 0.27631155195246443
+-0.86203900000000011 0.37568711111111114 0.33920450000000002 -0.86363598405927311 0.36991552503825798 0.34248414762385859
+-0.49050405555555554 0.56711966666666669 0.66111644444444451 -0.48636893387571756 0.56452772540213403 0.66689857355739679
+-0.45102994444444444 0.58730288888888893 0.67152450000000008 -0.44463322574655667 0.59056908713658951 0.67344595022976195
+-0.4760900555555555 0.60485722222222216 0.63779350000000001 -0.46965905902086791 0.60826718780552425 0.6398682649724019
+-0.54121055555555564 0.50647611111111113 0.67072122222222219 -0.53537679755270284 0.51023515849226175 0.67307634610093725
+-0.56644616666666658 0.52353366666666667 0.6358801111111112 -0.56061932894140942 0.52745385244712384 0.63835601474096826
+-0.57786500000000007 0.4838222777777777 0.65672061111111113 -0.58388625398724892 0.48025504911159195 0.65454711840138768
+-0.69395927777777788 0.32815499999999997 0.64035427777777787 -0.6953048395162591 0.32135545199698912 0.64287001300191315
+-0.94094172222222217 0.31756222222222225 -0.11435316111111113 -0.94045905207604263 0.31729857015080559 -0.12189499066198595
+-0.95027572222222234 0.27875183333333331 -0.13627303888888889 -0.95190385015274481 0.27253341039255036 -0.14001642862245339
+-0.95535638888888885 0.27982527777777777 -0.091030027777777786 -0.95716518902486247 0.27355642833602062 -0.0948771913319474
+-0.91235211111111125 0.39187466666666665 -0.11550940000000001 -0.91477173011535851 0.38599423501553598 -0.1191685038780165
+-0.91652922222222233 0.3929955 -0.069433894444444436 -0.91913774448605945 0.38708765318025523 -0.073136553217128294
+-0.89835083333333332 0.42852916666666674 -0.092856011111111122 -0.89623954506098191 0.43451200448818261 -0.089185177157113285
+-0.80010511111111116 0.59522733333333344 -0.069672705555555561 -0.79627330233989702 0.60049897379372186 -0.073142398466292322
+-0.4358711111111111 0.62442638888888902 0.64761527777777772 -0.42928358067523403 0.62760205669194258 0.64948538536189837
+-0.82153555555555557 0.40071994444444453 -0.40474005555555553 -0.82320169950934585 0.39490639915993836 -0.40790672687203405
+-0.99041400000000002 -0.040517699999999997 0.132054 -0.99042909148993497 -0.04051431091004682 0.13194243192357052
+-0.56133844444444447 0.42479211111111115 0.70975300000000008 -0.56719427102722186 0.42132562890847369 0.70765484053935324
+-0.53398199999999996 0.40546199999999999 0.74193200000000004 -0.53397837221050581 0.40543538767229781 0.74194962391959751
+-0.52507777777777787 0.44720294444444453 0.72360344444444447 -0.51941111443434562 0.45085647129555212 0.72590669957852993
+-0.46609872222222221 0.69092183333333346 0.5519736111111111 -0.46989818633218622 0.69334219789485718 0.54632617647340553
+-0.49740499999999999 0.42735899999999999 0.75495199999999996 -0.51763609454963999 0.43389420237286375 0.73742029722988534
+-0.5153523333333333 0.58407477777777783 0.62654744444444443 -0.50911507635325803 0.58771939724963429 0.62879865547434399
+-0.82239377777777778 0.077432127777777776 0.56315938888888883 -0.82613650039064546 0.080398337452212434 0.55770475168965261
+-0.82425750000000009 0.11595597777777779 0.55371011111111113 -0.82053882523414667 0.11428260274874391 0.56004957190621907
+-0.84287483333333346 0.090090038888888904 0.5300206111111111 -0.83941259596801754 0.088609226336890029 0.53622280699184321
+-0.47306938888888894 0.87807233333333345 0.068336577777777782 -0.46908926454127209 0.88090318231058062 0.062967017455332425
+-0.43775477777777783 0.89592177777777793 0.071664577777777794 -0.43362364391765301 0.8986751481339238 0.065981160660045099
+-0.45258822222222228 0.89073005555555573 0.035197772222222222 -0.45581496567353391 0.88910748916776128 0.041479992452199257
+-0.53002061111111121 0.84287483333333346 0.09009003888888889 -0.53622280699184433 0.83941259596801687 0.088609226336889613
+-0.53958305555555564 0.83994238888888895 0.053591199999999999 -0.53429480758391557 0.84339957803099685 0.056623408286707637
+-0.56315938888888883 0.82239377777777778 0.077432127777777776 -0.55770475168965272 0.82613650039064557 0.080398337452212448
+-0.70192883333333345 0.70862072222222239 0.067195216666666668 -0.69751095274066921 0.7130975034211291 0.070501215743818985
+-0.8931122777777778 0.42701350000000005 -0.13894826111111114 -0.89564957242998078 0.42129340791696046 -0.14256124245988541
+-0.90257966666666678 0.42970011111111112 8.6736173798840355e-19 -0.90005851818586091 0.43575291050450649 0.0037503103770103233
+-0.82439899999999999 0.52567461111111113 0.20817311111111114 -0.82213680993551475 0.53122525675781596 0.20467240246708407
+-0.5300206111111111 0.84287483333333346 -0.09009003888888889 -0.53622280699184521 0.8394125959680161 -0.088609226336890765
+-0.55371011111111124 0.82425750000000009 -0.11595597777777779 -0.56004957190622195 0.82053882523414523 -0.11428260274874001
+-0.56315938888888895 0.82239377777777778 -0.077432127777777776 -0.55770475168965028 0.82613650039064712 -0.080398337452213448
+-0.47306938888888894 0.87807233333333345 -0.068336577777777782 -0.46908926454127453 0.88090318231057907 -0.062967017455336172
+-0.48599188888888895 0.87306355555555581 -0.033121194444444439 -0.48194957352007178 0.87575003239765647 -0.028044417257712936
+-0.45258822222222228 0.89073005555555573 -0.035197772222222215 -0.45581496567353269 0.88910748916776217 -0.041479992452193047
+-0.43775477777777777 0.89592177777777793 -0.071664577777777794 -0.43362364391764874 0.89867514813392568 -0.06598116066004614
+-0.485991888888889 0.87306355555555581 0.033121194444444439 -0.48194957352007262 0.87575003239765581 0.028044417257714328
+-0.51557805555555547 0.82379161111111132 0.23432688888888892 -0.51207498812294627 0.82770762440957002 0.2295197051086256
+-0.39612783333333335 0.880473888888889 0.25920594444444445 -0.40319950283254841 0.87799809680948804 0.25797190334317915
+-0.69092183333333346 0.5519736111111111 0.46609872222222221 -0.69334219789485718 0.54632617647340553 0.46989818633218622
+-0.58407477777777783 0.62654744444444443 0.5153523333333333 -0.5877193972496344 0.62879865547434399 0.50911507635325792
+-0.40622622222222227 0.78411972222222215 0.46844483333333348 -0.40963750855607428 0.78616289348646995 0.46275805394282826
+-0.46547666666666665 0.81105588888888891 0.35333055555555559 -0.46212227964670521 0.81558482025617562 0.34823038296770442
+-0.711168388888889 0.60370305555555559 -0.35928411111111108 -0.70881159047278552 0.60918489551154165 -0.35564011625804004
+-0.69377355555555564 0.63683855555555546 -0.33529638888888891 -0.6912585790657676 0.64204640936345925 -0.33156897486264497
+-0.89073005555555573 -0.035197772222222215 0.45258822222222228 -0.88910748916776217 -0.041479992452193047 0.45581496567353269
+-0.89619499999999996 -0.071726300000000007 0.43782399999999999 -0.89067417773946056 -0.052628282973310257 0.45158584227078807
+-0.87835700000000005 -0.0685534 0.47306399999999998 -0.88774953587747929 -0.053226208668133886 0.45723925056816422
+-0.89073005555555573 0.035197772222222222 0.45258822222222228 -0.88910748916776128 0.041479992452199257 0.45581496567353391
+-0.87807233333333345 0.068336577777777782 0.47306938888888894 -0.88090318231058062 0.062967017455332425 0.46908926454127209
+-0.82379161111111132 0.23432688888888892 0.51557805555555547 -0.82770762440957002 0.2295197051086256 0.51207498812294627
+-0.880473888888889 0.25920594444444445 0.39612783333333335 -0.87799809680948804 0.25797190334317915 0.40319950283254841
+-0.5519736111111111 0.46609872222222221 0.69092183333333346 -0.54632617647340553 0.46989818633218622 0.69334219789485718
+-0.62654744444444443 0.5153523333333333 0.58407477777777783 -0.62879865547434399 0.50911507635325803 0.58771939724963429
+-0.78411972222222215 0.46844483333333348 0.40622622222222227 -0.78616289348646995 0.46275805394282826 0.40963750855607428
+-0.81105588888888891 0.35333055555555559 0.46547666666666665 -0.81558482025617562 0.34823038296770442 0.46212227964670521
+-0.89592177777777793 0.071664577777777794 0.43775477777777783 -0.8986751481339238 0.065981160660045099 0.43362364391765301
+-0.83994238888888895 0.053591199999999999 0.53958305555555564 -0.84339957803099685 0.056623408286707637 0.53429480758391557
+-0.70512544444444458 0.19986166666666666 0.67984705555555558 -0.70592110047367851 0.19251976909590959 0.68162419148185194
+-0.83973833333333325 0.49078361111111107 -0.23081177777777778 -0.83775605369134032 0.49646004234455926 -0.22735923306246128
+-0.86369744444444452 0.45838005555555555 -0.20788044444444445 -0.86616824898877942 0.45283443719162664 -0.21140845994674545
+-0.84908077777777791 0.49396133333333336 -0.1853765 -0.84692766994819901 0.49963695682834108 -0.18186927516056414
+-0.55371011111111113 0.82425750000000009 0.11595597777777779 -0.56004957190621907 0.82053882523414667 0.11428260274874391
+-0.87200361111111102 0.46106205555555557 -0.16226505555555554 -0.86995444403255973 0.46689328756781862 -0.15871333696987769
+-0.59835688888888905 0.80064005555555551 0.020480877777777781 -0.5991896414003286 0.80049706100696916 0.013275125526715529
+-0.57270422222222228 0.81947233333333336 -8.6736173798840355e-19 -0.5735872855835541 0.81911495734337958 -0.0069507174625364045
+-0.59835688888888883 0.80064005555555551 -0.020480877777777781 -0.59918964140033348 0.80049706100696572 -0.013275125526717843
+-0.8825426666666667 0.46425161111111113 -0.069884822222222226 -0.88011186107951001 0.47012486878554144 -0.066224766791123171
+-0.87829933333333354 0.46300900000000006 -0.11622905 -0.87607134551440624 0.46884628063085088 -0.1126151086985905
+-0.624302388888889 0.7565968333333335 -0.19279794444444445 -0.62615345904453978 0.75720239315206739 -0.1859472547023478
+-0.71951088888888892 0.68061216666666668 -0.1356845388888889 -0.7147054568829414 0.68547533361676471 -0.13899524058301724
+-0.83280549999999987 0.52852688888888888 0.16247072222222222 -0.83037664881265683 0.53405020478723775 0.15894967717290617
+-0.74305750000000004 0.57594661111111112 -0.33978666666666668 -0.74080593120528382 0.58149597524355545 -0.33625734648720862
+-0.62537444444444457 0.77996644444444463 0 -0.62603508949674114 0.7797587322640509 -0.0075090729632497711
+-0.53958305555555564 0.83994238888888895 -0.053591199999999992 -0.53429480758391767 0.8433995780309953 -0.056623408286708275
+-0.38997550000000003 0.9014186666666667 -0.18635077777777784 -0.39662205137890161 0.89905867934786865 -0.18543041673160862
+-0.46030505555555556 0.84081005555555555 -0.28371927777777778 -0.45672953304209885 0.84491246075498116 -0.27842605357277289
+-0.90171000000000001 0.186445 -0.39007399999999998 -0.9038809409702484 0.20048051156713187 -0.37789788175182909
+-0.97898699999999994 0.20218977777777783 -4.3368086899420177e-19 -0.97929648237017142 0.20230232976455795 0.0072226718906903053
+-0.86546133333333342 0.41817277777777773 -0.27461266666666667 -0.86749023845332174 0.41249033814465791 -0.27805108725826749
+-0.87339500000000003 -0.033321999999999997 0.48587200000000003 -0.87367088892648037 -0.033743519155176947 0.48534580739657968
+-0.94294766666666674 0.077626622222222233 0.32278083333333335 -0.94262834940122764 0.07135509696899317 0.32612918459049767
+-0.96466700000000005 -0.039690499999999997 0.26046599999999998 -0.96472569046805723 -0.039644748009948889 0.26025494444132652
+-0.89311227777777791 0.42701350000000005 0.13894826111111114 -0.89564957242998122 0.42129340791695913 0.14256124245988619
+-0.94505249999999996 0.31850488888888884 0.068722372222222217 -0.9448795263923121 0.31840610421006571 0.076290454228617133
+-0.99411955555555553 0.081341644444444444 0.066439672222222232 -0.99398268732725292 0.081323487946983145 0.073381929668205947
+-0.45955061111111112 0.8816102222222223 -0.10493664999999999 -0.45553358346714973 0.88463172112154209 -0.099578473171240856
+-0.99642699999999995 -0.0815086 0.022148600000000001 -0.9982313602512044 -0.055201045773037569 0.022067984878397
+-0.81401994444444459 0.52202088888888898 0.2533192222222222 -0.81193152544177405 0.52755677138547286 0.24990208274268105
+-0.83973833333333325 0.49078361111111107 0.23081177777777778 -0.83775605369134021 0.49646004234455948 0.22735923306246097
+-0.85343011111111111 0.45493894444444438 0.25296472222222222 -0.85573175535963186 0.44940153143522182 0.25643990799561706
+-0.84128666666666674 0.45063644444444445 0.29743761111111111 -0.84342171315466552 0.44511058846660512 0.30085939874659323
+-0.54250855555555544 0.82523066666666689 -0.15520044444444447 -0.5490152625132082 0.82162400177332173 -0.1533500610940399
+-0.56619688888888908 0.8034865555555557 -0.18225488888888894 -0.56010282149941726 0.80750215514867851 -0.18500026696908106
+-0.57758122222222219 0.80355477777777773 -0.14180361111111112 -0.57172393337095639 0.80758849978511515 -0.14468088687062031
+-0.36350300000000002 0.80080300000000004 0.47600300000000001 -0.37709824426838934 0.80251597899346994 0.46234729114579093
+-0.38492900000000002 0.77221600000000001 0.50548199999999999 -0.39921854218209168 0.76702783163088317 0.50228762784049441
+-0.66640616666666674 0.73343161111111121 -0.13171617222222221 -0.6678451032873397 0.73382922312113597 -0.12440895992070952
+-0.63459266666666669 0.75765061111111109 -0.15045633333333333 -0.62911940905974673 0.76199464803136974 -0.15353476972941341
+-0.80052966666666681 0.47582533333333332 0.36338350000000003 -0.80265774097767739 0.47030346706533316 0.36681766548918965
+-0.45328572222222224 0.86514772222222236 -0.21312050000000002 -0.46005659684907169 0.86225232066584634 -0.21182271644470294
+-0.42970200000000003 0.88428033333333345 -0.18106466666666671 -0.42581966140360406 0.88764058984003402 -0.17541892494983652
+-0.7732636111111113 0.54721044444444444 -0.31926572222222227 -0.77115959471535711 0.55276167927063913 -0.31585978757725619
+-0.75826000000000005 0.54113988888888886 -0.36264583333333333 -0.75622976135463549 0.54684065776048796 -0.35927961681897308
+-0.77195166666666681 0.50529522222222234 -0.38479933333333333 -0.77420418144639258 0.49978933334325532 -0.38835358593326469
+-0.80052966666666681 0.47582533333333338 -0.36338349999999997 -0.8026577409776775 0.4703034670653331 -0.36681766548918937
+-0.84128666666666674 0.45063644444444445 -0.29743761111111111 -0.84342171315466585 0.44511058846660456 -0.30085939874659323
+-0.85343011111111111 0.45493894444444438 -0.25296472222222222 -0.85573175535963197 0.44940153143522266 -0.25643990799561533
+-0.81401994444444459 0.52202088888888898 -0.2533192222222222 -0.81193152544177405 0.52755677138547252 -0.24990208274268152
+-0.99784694444444455 0.040756905555555556 0.044118144444444451 -0.99786818088871454 0.040763292286846671 0.050965160372401994
+-0.9960796666666667 0.081478161111111114 0.022153288888888897 -0.99624697878379498 0.081522902500506297 0.029085625866631565
+-0.99607966666666681 0.081478161111111114 -0.022153288888888893 -0.99624697878379476 0.081522902500508282 -0.029085625866632773
+-0.99784694444444455 0.040756905555555563 -0.044118144444444445 -0.99786818088871432 0.040763292286850716 -0.050965160372404512
+-0.95679477777777766 0.15844944444444448 -0.24241494444444445 -0.957253922897494 0.15217835599473786 -0.24598104614806679
+-0.954216888888889 0.19824288888888889 -0.22246183333333336 -0.95499795117042829 0.19203700464703405 -0.22605464407191309
+-0.92819838888888895 0.23331588888888891 -0.28868505555555557 -0.92653611314773354 0.23259507848721434 -0.29568625347928651
+-0.6199285555555557 0.7234788333333334 0.30264644444444444 -0.62233405661673558 0.72465725446077867 0.29592597981982599
+-0.6041117222222222 0.71834377777777791 0.34402016666666668 -0.60673787304411819 0.71971741204167938 0.33745518253232804
+-0.72937694444444445 0.68212288888888883 0.045444011111111113 -0.7251653919144494 0.68684049960043503 0.048839353785526264
+-0.70469933333333346 0.70870400000000022 0.022429688888888889 -0.70056916549628245 0.71311852774715345 0.02578390466113795
+-0.70469933333333346 0.70870400000000011 -0.022429688888888886 -0.70056916549628256 0.71311852774715345 -0.025783904661137932
+-0.72937694444444456 0.68212288888888895 -0.045444011111111113 -0.72516539191444929 0.68684049960043514 -0.048839353785527999
+-0.30377100000000001 0.94550800000000002 0.117211 -0.32105083824403247 0.93915655663412101 0.12211192158812767
+-0.32284400000000002 0.94326100000000002 0.077663399999999994 -0.33612594684296987 0.93866728579618708 0.076961512686122849
+-0.34437450000000003 0.93139666666666665 0.11520171666666668 -0.34755386944931477 0.93129562037784208 0.1090631711250817
+-0.97798022222222236 0.20204100000000003 0.045058005555555565 -0.97798063649741107 0.2020444956319952 0.052267546536367566
+-0.3668042222222222 0.91753444444444443 0.15149372222222224 -0.37332295099127616 0.91536790224266051 0.15076994994705142
+-0.34918150000000003 0.91709716666666674 0.19066583333333337 -0.35599575378580972 0.91500169554972122 0.18983919623620527
+-0.53871111111111103 0.79996133333333364 0.26305961111111109 -0.53532151268631545 0.80417342765022815 0.25833307244044129
+-0.55320488888888897 0.8023326666666668 0.22269266666666671 -0.54979059721433254 0.80630565401481535 0.2181776604477379
+-0.92819838888888895 0.23331588888888891 0.28868505555555551 -0.92653611314773454 0.23259507848721248 0.29568625347928484
+-0.93984338888888908 0.23587238888888895 0.2457178888888889 -0.93848222466552222 0.23528226001218258 0.25277138309233488
+-0.79996133333333364 0.26305961111111109 0.53871111111111103 -0.80417342765022815 0.25833307244044129 0.53532151268631545
+-0.8023326666666668 0.22269266666666671 0.55320488888888897 -0.80630565401481535 0.2181776604477379 0.54979059721433254
+-0.77990294444444475 0.20883044444444446 0.58949688888888896 -0.78052499673159592 0.20224086398833821 0.59150601215067355
+-0.75451727777777788 0.23497366666666666 0.61224105555555552 -0.75533943219617805 0.22816291194908692 0.61433218032304682
+-0.7234788333333334 0.30264644444444444 0.6199285555555557 -0.72465725446077867 0.29592597981982599 0.62233405661673558
+-0.77837733333333348 0.62555188888888902 -0.046270227777777784 -0.77450865557375925 0.63060662611129537 -0.049715445747341026
+-0.77837733333333337 0.62555188888888902 0.046270227777777784 -0.77450865557375959 0.63060662611129514 0.049715445747339361
+-0.61224105555555552 0.75451727777777788 -0.23497366666666666 -0.61433218032304682 0.75533943219617805 -0.22816291194908686
+-0.58949688888888896 0.77990294444444463 -0.20883044444444446 -0.59150601215067311 0.7805249967315957 -0.20224086398834018
+-0.55320488888888897 0.8023326666666668 -0.22269266666666671 -0.54979059721433254 0.80630565401481535 -0.2181776604477379
+-0.53871111111111114 0.79996133333333352 -0.26305961111111109 -0.53532151268631711 0.80417342765022692 -0.25833307244044157
+-0.54506144444444438 0.76974894444444464 -0.33124288888888892 -0.54190948364203873 0.77435972940169739 -0.3266513753526053
+-0.52779399999999999 0.76387899999999997 -0.37137900000000001 -0.5396206568579901 0.76298284461056509 -0.35590269108581013
+-0.56648211111111113 0.74160044444444451 -0.35839366666666667 -0.56349687759284484 0.7464457535431317 -0.35396328335088789
+-0.34923799999999999 0.917408 -0.190778 -0.36295919339829508 0.9124818649282449 -0.18877889210590018
+-0.32284400000000002 0.94326100000000002 -0.077663399999999994 -0.33612594684296643 0.93866728579618819 -0.076961512686125153
+-0.30377100000000001 0.94550800000000002 -0.117211 -0.32417934117557873 0.93881742394656642 -0.11631680553256618
+-0.91709716666666674 0.19066583333333337 -0.34918149999999998 -0.91500169554972055 0.18983919623620713 -0.35599575378581039
+-0.91784500000000002 0.15160399999999999 -0.36684600000000001 -0.92290412972690916 0.15945187513042228 -0.35046122018050518
+-0.94518311111111109 0.11713587777777779 0.30373750000000005 -0.94517851330077696 0.11083824185051343 0.30716845889189226
+-0.93139666666666665 0.11520171666666668 0.34437450000000003 -0.93129562037784208 0.1090631711250817 0.34755386944931477
+-0.91753444444444443 0.15149372222222224 0.3668042222222222 -0.91536790224266051 0.15076994994705142 0.37332295099127616
+-0.91709716666666674 0.19066583333333337 0.34918150000000003 -0.91500169554972122 0.18983919623620527 0.35599575378580972
+-0.56851399999999996 0.70381577777777782 0.42513244444444448 -0.56570987441492659 0.70912983566843601 0.42084107945197674
+-0.54890888888888878 0.69428805555555562 0.46471572222222218 -0.54614778938415753 0.69982807056515794 0.46039468263637262
+-0.410862 0.60649699999999995 0.680701 -0.42136567169173189 0.60657147442589543 0.67418248058857977
+-0.88585416666666672 0.4248007222222222 -0.18467527777777779 -0.88820631455867338 0.41910872685926326 -0.18824828777045036
+-0.87661705555555558 0.42187050000000004 -0.22993105555555557 -0.87879755235776458 0.41620240027572308 -0.23343184010483425
+-0.95764555555555553 0.23940283333333337 0.15780855555555556 -0.95893043882721862 0.2331625464421283 0.16151668776711708
+-0.89724905555555567 0.3464673333333334 -0.27242100000000002 -0.89882246463749604 0.34067182429932968 -0.27579137983545454
+-0.88781094444444453 0.38452083333333342 -0.25147144444444447 -0.88969484040035252 0.37874946869363357 -0.25493515043885479
+-0.96367061111111119 0.24053788888888891 -0.11303783333333334 -0.96513735744308149 0.23420596052008852 -0.11686509027356483
+-0.89947383333333342 0.10931593333333332 0.42238088888888892 -0.90236353428698479 0.10344279183327305 0.41837739041066713
+-0.91612616666666669 0.11263961111111111 0.38394200000000006 -0.91886656680883305 0.10654941584502681 0.37990979769417871
+-0.91287011111111127 0.074242938888888887 0.40070494444444449 -0.91103886545158841 0.080736581472007338 0.40433870708713571
+-0.92859111111111126 0.076199844444444456 0.36234955555555559 -0.92689685591902893 0.082802957133127394 0.36606814772310975
+-0.70381577777777782 0.42513244444444448 0.56851399999999996 -0.70912983566843601 0.42084107945197674 0.56570987441492659
+-0.69428805555555562 0.46471572222222218 0.54890888888888878 -0.69982807056515794 0.46039468263637262 0.54614778938415753
+-0.94655277777777791 8.6736173798840355e-19 0.3215696111111111 -0.9456570726767769 -0.0065172944522050528 0.32510033185066461
+-0.93871544444444444 0.03855203888888889 0.3416245555555556 -0.93740915282173265 0.045125010304282447 0.34529380772188761
+-0.62442638888888902 0.64761527777777772 0.4358711111111111 -0.62760205669194258 0.64948538536189837 0.42928358067523403
+-0.60628444444444429 0.68047233333333346 0.4107060555555555 -0.60930378779273198 0.68218770964937192 0.40418909310466744
+-0.62399500000000008 0.68793472222222229 0.36971155555555557 -0.62676292798033717 0.68945393975167257 0.36307230281365693
+-0.65963700000000003 0.66292483333333341 0.35315727777777778 -0.66230302078762238 0.66440626695154015 0.34629325880113365
+-0.44720294444444453 0.72360344444444447 0.52507777777777787 -0.45085647129555212 0.72590669957852993 0.51941111443434562
+-0.40531733333333336 0.74167483333333351 0.53379438888888886 -0.4019788435156959 0.73972208925562644 0.53965196194684129
+-0.42721033333333341 0.75469172222222214 0.49722505555555557 -0.43072346248779858 0.75686579003687127 0.49156024527455899
+-0.84568794444444451 0.5325131111111111 0.023343438888888894 -0.84245686591734525 0.53808947533701124 0.026947088901479895
+-0.86496422222222225 0.49895488888888889 0.046672377777777788 -0.86180051139229774 0.5047430257743023 0.050342392634600892
+-0.93482588888888907 0.31605533333333335 0.15971061111111112 -0.9340282709467429 0.3156486955681746 0.16720373817097367
+-0.94321855555555567 0.27717322222222224 0.18115188888888892 -0.9422834190263415 0.27673948951092692 0.18846011029727186
+-0.93423205555555544 0.27510183333333332 0.22547750000000003 -0.93299691132386953 0.27452654359661405 0.23270569464672752
+-0.91673538888888906 0.31132633333333337 0.24896333333333337 -0.91532388527674813 0.31061812165517827 0.25631731806744401
+-0.42529400000000001 0.56871099999999997 0.70405399999999996 -0.43584136078128521 0.56866322048988804 0.69761339572458492
+-0.46471572222222218 0.54890888888888878 0.69428805555555562 -0.46039468263637262 0.54614778938415753 0.69982807056515794
+-0.64761527777777772 0.4358711111111111 0.62442638888888902 -0.64948538536189837 0.42928358067523403 0.62760205669194258
+-0.68047233333333346 0.4107060555555555 0.60628444444444429 -0.68218770964937192 0.40418909310466744 0.60930378779273198
+-0.66292483333333341 0.35315727777777778 0.65963700000000003 -0.66440626695154015 0.34629325880113365 0.66230302078762238
+-0.91673538888888906 0.31132633333333343 -0.24896333333333337 -0.91532388527674802 0.31061812165517827 -0.25631731806744434
+-0.93482588888888907 0.31605533333333341 -0.15971061111111112 -0.93402827094674179 0.31564869556817543 -0.16720373817097822
+-0.86496422222222225 0.49895488888888889 -0.046672377777777781 -0.86180051139229819 0.50474302577430152 -0.050342392634600462
+-0.84568794444444451 0.5325131111111111 -0.023343438888888891 -0.84245686591734625 0.53808947533700968 -0.026947088901478889
+-0.82368444444444444 0.56451983333333344 -0.046607672222222229 -0.82016277944795324 0.56992861274242324 -0.050143709333323697
+-0.82038388888888891 0.56357805555555562 -0.093063277777777773 -0.81661364964159877 0.56904227675642238 -0.096607631597588006
+-0.60628444444444451 0.68047233333333335 -0.4107060555555555 -0.60930378779273187 0.68218770964937325 -0.40418909310466544
+-0.58750899999999995 0.67174800000000001 -0.451208 -0.59712328610831344 0.67644013040989115 -0.43112936707937061
+-0.62464600000000003 0.64783599999999997 -0.43603399999999998 -0.63056376625946575 0.65114486100355962 -0.42237389439847339
+-0.42479211111111115 0.70975300000000008 0.56133844444444447 -0.42132562890847369 0.70765484053935324 0.56719427102722186
+-0.44313827777777781 0.67625838888888889 0.58787722222222216 -0.43953860770040559 0.67402691765197176 0.59371165275861892
+-0.96771327777777782 0.24127177777777781 -0.067924161111111117 -0.96755210126393754 0.24120310120227617 -0.075259519731019187
+-0.5149719444444445 0.488196388888889 0.70410561111111114 -0.50913871292513224 0.49181063499169769 0.70632858522786901
+-0.75765061111111109 0.15045633333333333 0.63459266666666669 -0.76199464803136652 0.1535347697294133 0.62911940905975061
+-0.78098961111111131 0.16742283333333338 0.60117361111111101 -0.785188590802534 0.17037521088438604 0.59535801362678575
+-0.78904427777777775 0.59209005555555561 0.16171811111111109 -0.78629297372174234 0.59725247015776106 0.15821771824379238
+-0.80355477777777784 0.14180361111111112 0.57758122222222219 -0.80758849978511771 0.14468088687062342 0.57172393337095218
+-0.80277855555555566 0.10144869444444445 0.5871036111111112 -0.80666135127872451 0.10456041474826064 0.58169114143233591
+-0.42970200000000003 0.88428033333333345 0.18106466666666671 -0.4258196614036035 0.88764058984003447 0.17541892494983571
+-0.40647822222222235 0.90131850000000013 0.14760150000000002 -0.40247103169275233 0.90439818266630467 0.14170743042641337
+-0.42238088888888892 0.89947383333333342 0.10931593333333332 -0.41837739041066713 0.90236353428698479 0.10344279183327305
+-0.45955061111111112 0.8816102222222223 0.10493664999999999 -0.45553358346714756 0.88463172112154309 0.09957847317124123
+-0.68933433333333349 0.70698838888888893 -0.15598661111111112 -0.69503727204225441 0.70247712477229041 -0.15313092321186206
+-0.62369722222222224 0.78016216666666671 0.042238155555555559 -0.62470401263738684 0.78007890288869608 0.034954282466044873
+-0.65182450000000014 0.75766966666666669 0.021676222222222225 -0.65246590588010478 0.75768815115089549 0.014032365074783662
+-0.67737388888888894 0.73389566666666672 0.044128638888888891 -0.67815638521793087 0.73401541893978217 0.036404422077621408
+-0.67314488888888901 0.73382466666666668 0.088077566666666662 -0.67424393756459622 0.73410544350889673 0.08052521634863645
+-0.34162455555555554 0.93871544444444444 -0.038552038888888897 -0.34529380772188994 0.93740915282173187 -0.045125010304281565
+-0.32164100000000001 0.94686199999999998 6.1494599999999998e-19 -0.33473155310488784 0.94231352922262013 3.6267044291985801e-16
+-0.30181000000000002 0.95256300000000005 -0.0391817 -0.3218068857110214 0.94600646206740269 -0.038885756205703864
+-0.83280549999999987 0.52852688888888899 -0.1624707222222222 -0.83037664881265649 0.53405020478723886 -0.15894967717290423
+-0.87829933333333354 0.46300900000000006 0.11622905000000001 -0.87607134551440624 0.46884628063085082 0.11261510869859052
+-0.87200361111111102 0.46106205555555557 0.16226505555555554 -0.86995444403255928 0.46689328756782017 0.15871333696987613
+-0.84908077777777791 0.49396133333333336 0.1853765 -0.84692766994820057 0.49963695682833859 0.18186927516056392
+-0.4920802222222222 0.84572811111111124 -0.20489072222222227 -0.49882332570160443 0.84252034648128082 -0.20330950666669181
+-0.52977233333333329 0.82511827777777791 -0.19469544444444445 -0.53644658705687587 0.82159577007534734 -0.19288714272684607
+-0.51876055555555556 0.84501666666666675 -0.12755305555555557 -0.52512962998216928 0.84161907351186538 -0.12615944996637979
+-0.41731183333333338 0.90771522222222234 0.036593988888888894 -0.42057737025126773 0.90623645146983989 0.04301359854604659
+-0.40070494444444449 0.91287011111111127 0.074242938888888887 -0.40433870708713571 0.91103886545158841 0.080736581472007338
+-0.36234955555555559 0.92859111111111126 0.076199844444444456 -0.36606814772310975 0.92689685591902893 0.082802957133127394
+-0.34162455555555554 0.93871544444444444 0.038552038888888897 -0.34529380772188739 0.93740915282173276 0.045125010304282079
+-0.36234955555555565 0.92859111111111126 -0.076199844444444428 -0.36606814772311413 0.92689685591902726 -0.082802957133126492
+-0.40070494444444454 0.91287011111111127 -0.074242938888888901 -0.40433870708713487 0.91103886545158896 -0.080736581472005825
+-0.41731183333333344 0.90771522222222234 -0.036593988888888894 -0.42057737025126812 0.90623645146983978 -0.043013598546047055
+-0.51876055555555556 0.84501666666666675 0.12755305555555557 -0.52512962998216917 0.84161907351186538 0.12615944996637982
+-0.54250855555555555 0.82523066666666689 0.15520044444444447 -0.54901526251321164 0.82162400177331962 0.15335006109403856
+-0.5297723333333334 0.8251182777777778 0.19469544444444445 -0.53644658705687598 0.82159577007534701 0.19288714272684732
+-0.4920802222222222 0.84572811111111124 0.20489072222222227 -0.49882332570160387 0.84252034648128127 0.2033095066666914
+-0.71116838888888889 0.60370305555555559 0.35928411111111114 -0.70881159047278919 0.60918489551153832 0.35564011625803871
+-0.72715611111111123 0.56931522222222219 0.38265566666666667 -0.72499878648104932 0.57499148324182692 0.3791590085971448
+-0.70975300000000008 0.56133844444444447 0.42479211111111115 -0.70765484053935324 0.56719427102722186 0.42132562890847369
+-0.67625838888888889 0.58787722222222216 0.44313827777777781 -0.67402691765197176 0.59371165275861892 0.43953860770040559
+-0.488196388888889 0.70410561111111114 0.5149719444444445 -0.49181063499169769 0.70632858522786901 0.50913871292513224
+-0.44828472222222226 0.76617377777777773 0.45969711111111117 -0.45162717142033804 0.76813183917485439 0.45387925231356441
+-0.93903499999999995 -0.038584800000000002 0.34165000000000001 -0.93916432755198997 -0.038521172133807798 0.34130116488411827
+-0.92890300000000003 -0.076266500000000001 0.36238399999999998 -0.93114137455847357 -0.051749775504558296 0.36096772891850654
+-0.91318200000000005 -0.074313500000000005 0.40071899999999999 -0.91559703367523992 -0.050328370179532594 0.39893499104512464
+-0.90800400000000003 -0.036630599999999999 0.41735699999999998 -0.90827198726026925 -0.036570306899743228 0.41677885000505965
+-0.84501666666666675 0.12755305555555557 0.51876055555555545 -0.84161907351186604 0.12615944996638023 0.52512962998216806
+-0.82523066666666689 0.15520044444444447 0.54250855555555555 -0.82162400177331962 0.15335006109403856 0.54901526251321164
+-0.82511827777777791 0.19469544444444442 0.52977233333333329 -0.82159577007534679 0.19288714272684712 0.53644658705687642
+-0.84572811111111124 0.20489072222222227 0.4920802222222222 -0.84252034648128127 0.2033095066666914 0.49882332570160387
+-0.60370305555555559 0.35928411111111114 0.71116838888888889 -0.6091848955115382 0.35564011625803865 0.70881159047278919
+-0.57613099999999995 0.33991500000000002 0.74332399999999998 -0.58437886466715772 0.3538406033072346 0.73027266824214099
+-0.56931522222222219 0.38265566666666667 0.72715611111111123 -0.57499148324182692 0.37915900859714474 0.72499878648104932
+-0.58787722222222216 0.44313827777777781 0.67625838888888889 -0.59371165275861892 0.43953860770040559 0.67402691765197176
+-0.70410561111111114 0.5149719444444445 0.488196388888889 -0.7063285852278689 0.50913871292513235 0.49181063499169764
+-0.72360344444444447 0.52507777777777787 0.44720294444444453 -0.72590669957852993 0.51941111443434562 0.45085647129555212
+-0.75469172222222214 0.49722505555555557 0.42721033333333341 -0.75686579003687127 0.49156024527455899 0.43072346248779858
+-0.76617377777777773 0.45969711111111117 0.44828472222222226 -0.76813183917485439 0.45387925231356441 0.45162717142033804
+-0.88428033333333345 0.18106466666666671 0.42970200000000003 -0.88764058984003447 0.17541892494983571 0.4258196614036035
+-0.90131850000000013 0.14760150000000002 0.40647822222222235 -0.90439818266630467 0.14170743042641337 0.40247103169275233
+-0.8816102222222223 0.10493664999999999 0.45955061111111112 -0.8846317211215432 0.099578473171241258 0.45553358346714756
+-0.76617377777777773 0.45969711111111117 -0.44828472222222226 -0.76813183917485228 0.45387925231356635 -0.45162717142033981
+-0.75469172222222214 0.49722505555555557 -0.42721033333333341 -0.75686579003687093 0.49156024527456066 -0.43072346248779714
+-0.72360344444444447 0.52507777777777775 -0.44720294444444453 -0.72590669957852894 0.51941111443434651 -0.45085647129555251
+-0.69116500000000003 0.55216799999999999 -0.46626299999999998 -0.70308750497874417 0.55099997577739757 -0.44951861700720658
+-0.70435000000000003 0.515158 -0.48836800000000002 -0.7120720291689725 0.52656277906578286 -0.46441906181562093
+-0.57758122222222219 0.80355477777777784 0.14180361111111112 -0.57172393337095206 0.80758849978511771 0.14468088687062342
+-0.5871036111111112 0.80277855555555566 0.10144869444444445 -0.58169114143233602 0.80666135127872463 0.10456041474826065
+-0.58710361111111109 0.80277855555555566 -0.10144869444444445 -0.58169114143233625 0.80666135127872363 -0.104560414748266
+-0.60117361111111123 0.78098961111111131 -0.16742283333333338 -0.59535801362678342 0.78518859080253534 -0.17037521088438701
+-0.67649599999999999 0.58808099999999996 -0.443299 -0.68237595213215929 0.59152889609279979 -0.42948413828564469
+-0.70975300000000008 0.56133844444444447 -0.42479211111111115 -0.70765484053935468 0.56719427102721987 -0.42132562890847386
+-0.72715611111111123 0.56931522222222231 -0.38265566666666667 -0.72499878648104976 0.57499148324182858 -0.37915900859714147
+-0.6731448888888889 0.73382466666666668 -0.088077566666666676 -0.67424393756459777 0.73410544350889573 -0.080525216348634021
+-0.67737388888888894 0.73389566666666672 -0.044128638888888891 -0.67815638521793198 0.73401541893978095 -0.036404422077624073
+-0.65182450000000014 0.7576696666666668 -0.021676222222222225 -0.65246590588010245 0.75768815115089749 -0.014032365074781672
+-0.62369722222222235 0.78016216666666671 -0.042238155555555559 -0.6247040126373884 0.78007890288869486 -0.034954282466040557
+-0.42238088888888892 0.89947383333333342 -0.10931593333333332 -0.4183773904106684 0.90236353428698401 -0.10344279183327446
+-0.98822399999999999 0.12163718333333334 -0.089000511111111125 -0.98793174163105957 0.12156932709869499 -0.095977979696344612
+-0.99118644444444448 0.12192531666666667 -0.04455446111111111 -0.99119702566678813 0.12194147397569161 -0.051562905600327391
+-0.98613916666666668 0.16225061111111114 -0.022410494444444446 -0.9862979151151543 0.16230832589795582 -0.029536925765944418
+-0.97798022222222225 0.20204100000000003 -0.045058005555555565 -0.97798063649741085 0.20204449563199528 -0.052267546536372299
+-0.90614733333333342 0.39010305555555563 -0.16128705555555556 -0.90837866366013453 0.38426438939936985 -0.16489112300714548
+-0.90771522222222234 0.036593988888888894 0.41731183333333338 -0.90623645146983989 0.04301359854604659 0.42057737025126773
+-0.88781094444444464 0.38452083333333342 0.25147144444444441 -0.88969484040035385 0.37874946869362897 0.25493515043885739
+-0.87661705555555558 0.42187049999999998 0.2299310555555556 -0.87879755235776325 0.41620240027572614 0.23343184010483348
+-0.88585416666666672 0.4248007222222222 0.18467527777777779 -0.8882063145586736 0.41910872685926281 0.18824828777045061
+-0.90614733333333342 0.39010305555555563 0.16128705555555559 -0.90837866366013442 0.38426438939936991 0.16489112300714623
+-0.98613916666666668 0.16225061111111114 0.022410494444444446 -0.98629791511515463 0.16230832589795385 0.02953692576594321
+-0.99118644444444448 0.12192531666666667 0.044554461111111124 -0.99119702566678813 0.12194147397569156 0.051562905600327384
+-0.98822399999999999 0.12163718333333334 0.089000511111111125 -0.98793174163105957 0.12156932709869497 0.095977979696344612
+-0.31613200000000002 0.88471900000000003 0.34254000000000001 -0.3294211315812311 0.88512215672951233 0.32869512581454269
+-0.35899861111111109 0.86988683333333339 0.33724750000000009 -0.36215323660106347 0.87121174907206966 0.33141382212901033
+-0.38206200000000001 0.84660888888888897 0.36959116666666669 -0.3852110923041957 0.84810814993773809 0.36376500707873988
+-0.36214800000000003 0.83810200000000001 0.40796199999999999 -0.37649389839740721 0.83315715797455803 0.40509442675168977
+-0.64198000000000011 0.29233105555555561 0.70832122222222216 -0.64705626737509614 0.28859701459703146 0.70571237059887859
+-0.64625299999999997 0.248833 0.721414 -0.65455064680951669 0.26288318719723591 0.70884122386488391
+-0.98471200000000003 -0.080752400000000002 0.154339 -0.98659498098831921 -0.054652534041547601 0.15376424815767611
+-0.97700299999999995 -0.080266400000000002 0.19753899999999999 -0.97891707379046766 -0.054331382555824669 0.19689962801153485
+-0.983657 -0.0403062 0.175484 -0.9836808891515797 -0.040307589169763014 0.17534881400590965
+-0.98778033333333348 3.4218388888888886e-20 0.1536423888888889 -0.98705222481230426 8.1539385375779995e-17 0.16039920664729113
+-0.99358272222222233 0 0.11001133333333335 -0.99315324794551874 -9.5418526886554624e-18 0.11681877458382654
+-0.28874899999999998 0.92851300000000003 0.23342599999999999 -0.31360689215868431 0.91930464452193628 0.23775972693239647
+-0.33097694444444448 0.91482127777777766 0.22998205555555556 -0.3379838335060848 0.91284890386869511 0.22907161979226712
+-0.88442177777777797 0.34238933333333338 0.31604200000000005 -0.88585844674484926 0.33657981943799542 0.3193255979057889
+-0.86988683333333339 0.33724750000000009 0.35899861111111109 -0.87121174907206966 0.33141382212901033 0.36215323660106347
+-0.35449605555555552 0.89642250000000001 0.26474783333333329 -0.36161009603891914 0.89426493531171247 0.26368231627218108
+-0.84660888888888897 0.36959116666666669 0.38206200000000001 -0.84810814993773809 0.36376500707873988 0.3852110923041957
+-0.83782038888888899 0.40779044444444446 0.36203938888888892 -0.83957573606046731 0.40206922864807892 0.36531208410462301
+-0.70832122222222216 0.64198000000000011 0.29233105555555561 -0.70571237059887848 0.64705626737509603 0.28859701459703141
+-0.72114805555555561 0.64606572222222214 0.24872233333333338 -0.71841774753895082 0.65102987947107138 0.24502252153004747
+-0.75165261111111104 0.61818911111111119 0.22841961111111117 -0.74897430910137541 0.6232921503283716 0.22482077227238603
+-0.76982988888888892 0.58579227777777787 0.25202805555555563 -0.7673750143241086 0.59109138934629735 0.24848854466904122
+-0.80396599999999996 0.39244699999999999 -0.44679200000000002 -0.80393341593672984 0.39250190306445421 -0.44680344541093547
+-0.81132199999999999 0.353493 -0.465617 -0.81955619222806575 0.36445707030167734 -0.44215233990984587
+-0.82959505555555568 0.36214950000000001 -0.42419233333333339 -0.83100516247629708 0.35626101820597383 -0.42721014365834731
+-0.84660888888888908 0.36959116666666669 -0.38206200000000001 -0.84810814993773953 0.36376500707873649 -0.3852110923041957
+-0.83782038888888899 0.40779044444444446 -0.36203938888888892 -0.83957573606046787 0.40206922864807976 -0.3653120841046209
+-0.78904427777777775 0.59209005555555561 -0.16171811111111112 -0.78629297372174378 0.59725247015775862 -0.15821771824379466
+-0.76144050000000019 0.62116427777777772 -0.18352861111111116 -0.75861571935303307 0.62618704465993646 -0.17997770820447423
+-0.98436877777777787 0.08072323888888891 -0.15432383333333335 -0.98364278048400244 0.080574270691353006 -0.16110452291682351
+-0.98331377777777784 0.040291861111111112 -0.17546994444444447 -0.98244224734962848 0.040209691007927609 -0.18218235746542072
+-0.98778033333333348 0 -0.15364238888888887 -0.98705222481230426 -8.0671945105824872e-17 -0.16039920664729104
+-0.99041400000000002 -0.040517699999999997 -0.132054 -0.99152557490792936 -0.020252671590080776 -0.12832327768945359
+-0.99358272222222233 0 -0.11001133333333335 -0.99315324794551874 9.5418526886554624e-18 -0.11681877458382654
+-0.99642699999999995 -0.0815086 -0.022148600000000001 -0.9982313602512044 -0.055201045773037596 -0.022067984878397
+-0.99819400000000003 -0.0407719 -0.044118600000000001 -0.99819300715063164 -0.040789101676862317 -0.044124479146768286
+-0.88442177777777786 0.34238933333333343 -0.31604200000000005 -0.88585844674484893 0.33657981943799731 -0.31932559790578779
+-0.86988683333333339 0.33724750000000003 -0.35899861111111109 -0.87121174907206944 0.3314138221290106 -0.36215323660106363
+-0.44665483333333333 0.80369816666666671 0.39227866666666672 -0.44970367922441068 0.80527512270279777 0.38639174117470765
+-0.42419233333333334 0.82959505555555557 0.36214950000000001 -0.42721014365834631 0.83100516247629663 0.35626101820597622
+-0.44273205555555556 0.83600788888888899 0.32312066666666667 -0.44638955238374878 0.83223041013000265 0.32882960933815558
+-0.48330188888888903 0.81681627777777799 0.3139468333333334 -0.47988631979275509 0.82116637706339168 0.30886065022328313
+-0.71130488888888888 0.6788725000000001 -0.18030416666666671 -0.70824252605277271 0.68351288304227853 -0.17664275531597648
+-0.74111677777777785 0.65159588888888897 -0.15967583333333338 -0.74639544595641349 0.64681512694105092 -0.15660150004313161
+-0.74804966666666672 0.65319355555555558 -0.1144236777777778 -0.74356870428831068 0.6582038114175951 -0.11778507816507858
+-0.43694288888888888 0.86297505555555565 0.25239211111111109 -0.44071750665220449 0.85965498700960707 0.25838224133979565
+-0.41956622222222228 0.85917744444444455 0.29173877777777779 -0.42243889058002065 0.86015098722300531 0.28580703788537215
+-0.37797294444444451 0.87603155555555556 0.29838466666666669 -0.37092317424346333 0.87886765169052439 0.30001274909766174
+-0.70109299999999997 0.67633188888888884 0.22443494444444448 -0.69976957442665277 0.67563076924838528 0.23204656074067639
+-0.66844344444444448 0.70239261111111118 0.24322949999999999 -0.6704755154537877 0.70337765391720541 0.23605605085848952
+-0.9747165555555557 0.040023405555555551 0.21829649999999998 -0.97564673422962944 0.046633488357808936 0.21433330994187721
+-0.96714038888888898 0.079606161111111115 0.24007305555555558 -0.96706196112010012 0.073091910347299713 0.24382111474671009
+-0.67651799999999995 0.22455 0.70135599999999998 -0.68558156780852908 0.23046660937039454 0.69055271764472348
+-0.70239261111111118 0.24322949999999999 0.66844344444444448 -0.70337765391720541 0.23605605085848952 0.6704755154537877
+-0.80369816666666671 0.39227866666666672 0.44665483333333333 -0.80527512270279777 0.38639174117470765 0.44970367922441068
+-0.82959505555555557 0.36214950000000001 0.42419233333333334 -0.83100516247629663 0.35626101820597622 0.42721014365834631
+-0.83600788888888899 0.32312066666666667 0.44273205555555556 -0.83223041013000265 0.32882960933815564 0.44638955238374883
+-0.81681627777777799 0.3139468333333334 0.48330188888888903 -0.82116637706339168 0.30886065022328313 0.47988631979275509
+-0.86325200000000002 0.25254199999999999 -0.43705699999999997 -0.87163704405386422 0.26276284123388716 -0.41376871885116795
+-0.85945800000000006 0.29188900000000001 -0.419682 -0.85941443531440198 0.29199352621521846 -0.41969823566656811
+-0.76144050000000019 0.62116427777777772 0.18352861111111116 -0.75861571935303673 0.62618704465993091 0.17997770820447828
+-0.43694288888888888 0.86297505555555565 -0.25239211111111109 -0.44071750665220349 0.85965498700960763 -0.25838224133979565
+-0.419682 0.85945800000000006 -0.29188900000000001 -0.43177312969396969 0.85828531658181317 -0.27734144986700265
+-0.442859 0.83627799999999997 -0.32328800000000002 -0.45494640996596902 0.83536956825498132 -0.30851490805561188
+-0.465617 0.81132199999999999 -0.353493 -0.47464490896675166 0.81439497295494379 -0.33387578291583303
+-0.48330188888888898 0.81681627777777777 -0.31394683333333334 -0.47988631979275559 0.82116637706338969 -0.30886065022328768
+-0.70109299999999997 0.67633188888888895 -0.22443494444444448 -0.69976957442665344 0.67563076924838428 -0.23204656074067737
+-0.66844344444444448 0.70239261111111118 -0.24322949999999999 -0.67047551545378914 0.70337765391720486 -0.23605605085848697
+-0.95937994444444441 0 0.28095566666666666 -0.96085676206659554 0.0065582045306799433 0.27696799949494438
+-0.97061122222222218 0 0.23926188888888891 -0.96932056651415255 0 0.24579999864255986
+-0.97505799999999998 -0.040042599999999998 0.218308 -0.97509522330038212 -0.040025946394139041 0.21814497269483782
+-0.967476 -0.079646999999999996 0.24009800000000001 -0.96942691840980122 -0.053878969775750629 0.23939195157394144
+-0.9747165555555557 0.040023405555555558 -0.2182965 -0.97564673422962911 0.04663348835781083 -0.21433330994187852
+-0.96714038888888898 0.079606161111111115 -0.24007305555555558 -0.9670619611200999 0.073091910347297881 -0.24382111474671148
+-0.86297505555555565 0.25239211111111109 0.43694288888888888 -0.85965498700960719 0.25838224133979559 0.44071750665220455
+-0.85917744444444455 0.29173877777777779 0.41956622222222228 -0.86015098722300531 0.28580703788537215 0.42243889058002065
+-0.87603155555555556 0.29838466666666669 0.37797294444444451 -0.87886765169052439 0.30001274909766174 0.37092317424346333
+-0.89642250000000001 0.26474783333333329 0.35449605555555552 -0.89426493531171247 0.26368231627218108 0.36161009603891914
+-0.98010588888888872 4.3368086899420177e-19 0.1967632777777778 -0.97908421922976396 0 0.20345538001056468
+-0.62107088888888895 0.60274027777777772 0.50026811111111114 -0.61877736315263288 0.60874303996824886 0.49653447628547387
+-0.59966827777777776 0.59066877777777782 0.53925861111111106 -0.59741459813788345 0.59687346323979396 0.53557246644304424
+-0.5621827777777777 0.61383599999999994 0.55357633333333334 -0.56605121403024439 0.61625528820697695 0.54755405473051
+-0.54583999999999988 0.64923588888888883 0.52900327777777778 -0.54954262438316082 0.65153458369801109 0.52297761924534369
+-0.92968266666666677 0.35567750000000004 0.092067066666666683 -0.93196779945019781 0.3496558849156724 0.095795526679453735
+-0.93279822222222231 0.35644711111111105 0.046091599999999996 -0.9352783456551782 0.35038106966600463 0.049875065596139731
+-0.94711666666666661 0.3189622222222222 0.022924433333333334 -0.94725645751782217 0.31902218302947039 0.030496728117906807
+-0.95841855555555544 0.28044677777777777 0.045571827777777782 -0.95841050964196206 0.28042718858919063 0.053008366394346244
+-0.96466700000000005 0.039690499999999997 -0.26046599999999998 -0.96892922577271623 0.045846580963139705 -0.2430519418920056
+-0.60274027777777772 0.50026811111111114 0.62107088888888895 -0.60874303996824886 0.49653447628547387 0.61877736315263288
+-0.59066877777777782 0.53925861111111106 0.59966827777777776 -0.59687346323979396 0.53557246644304424 0.59741459813788333
+-0.61383599999999994 0.55357633333333334 0.5621827777777777 -0.61625528820697695 0.54755405473051 0.56605121403024439
+-0.64923588888888883 0.52900327777777778 0.54583999999999988 -0.65153458369801109 0.52297761924534369 0.54954262438316082
+-0.33930199999999999 0.86232799999999998 0.37585200000000002 -0.35256896037494789 0.86296550392388838 0.36191942089022794
+-0.90151755555555568 0.42941455555555563 -0.046495144444444449 -0.89920982393635296 0.43542010849590124 -0.042790438812549764
+-0.91862983333333359 0.39353955555555559 -0.023167105555555557 -0.91643561588954847 0.39971262560386789 -0.019379857120373559
+-0.91862983333333359 0.39353955555555559 0.02316710555555556 -0.91643561588954847 0.39971262560386783 0.019379857120373566
+-0.90151755555555568 0.42941455555555563 0.046495144444444449 -0.89920982393635229 0.43542010849590285 0.042790438812548647
+-0.50026811111111114 0.62107088888888895 0.60274027777777772 -0.49653447628547387 0.61877736315263288 0.60874303996824886
+-0.53925861111111106 0.59966827777777776 0.59066877777777782 -0.53557246644304413 0.59741459813788333 0.59687346323979396
+-0.55357633333333334 0.5621827777777777 0.61383599999999994 -0.54755405473051 0.56605121403024439 0.61625528820697695
+-0.52900327777777778 0.54583999999999999 0.64923588888888895 -0.52297761924534136 0.54954262438316215 0.65153458369801176
+-0.61456200000000005 0.27280700000000002 0.74019599999999997 -0.63363861960554047 0.2788075266793878 0.72164289147147254
+-0.95841855555555544 0.28044677777777777 -0.045571827777777775 -0.95841050964196184 0.28042718858919063 -0.053008366394348617
+-0.94711666666666661 0.31896222222222215 -0.022924433333333334 -0.94725645751782228 0.31902218302947044 -0.030496728117904132
+-0.73620099999999999 0.48796200000000001 -0.46893600000000002 -0.74232876685044913 0.49170561551355418 -0.45516325596287777
+-0.577145388888889 0.57714538888888889 0.577145388888889 -0.57734500093273466 0.57731947200996159 0.5773863326544193
+-0.5034616666666667 0.52819516666666666 0.68325033333333329 -0.49742892855923659 0.53176094050308254 0.68541575936630394
+-0.94550800000000002 0.117211 -0.30377100000000001 -0.94554466769646617 0.11706332799948686 -0.30371278970182325
+-0.93171599999999999 0.115289 -0.34440199999999999 -0.93014279430922731 0.14108392131289296 -0.33901284539320919
+-0.85930705555555564 0.062750183333333334 0.50711255555555568 -0.85626429280438865 0.062198335626752338 0.51277951198684013
+-0.85504466666666668 0.029093672222222228 0.5173335 -0.85201161052788332 0.028918895615988958 0.52272355313495678
+-0.83706338888888898 0.017980883333333333 0.54642727777777778 -0.83636135974086612 0.012055903437396466 0.54804592063504842
+-0.81947899999999996 -1.22661e-18 0.57311000000000001 -0.8253666319708961 0.018516726600117047 0.56429341097077834
+-0.82052500000000006 0.038781744444444446 0.56986272222222223 -0.82376026015320847 0.042106213689287089 0.56537253254917719
+-0.46833050000000004 0.88327516666666683 0 -0.47066540072095209 0.88229182417334717 -0.0059344385625658648
+-0.49935283333333336 0.86615722222222247 1.4870710116376754e-19 -0.501242848042461 0.86528710791410357 -0.0058161984086358212
+-0.51733350000000011 0.85504466666666679 0.029093672222222228 -0.52272355313496044 0.8520116105278811 0.028918895615987737
+-0.50711255555555568 0.85930705555555564 0.062750183333333334 -0.51277951198684013 0.85626429280438865 0.062198335626752338
+-0.56986272222222223 0.82052500000000006 -0.038781744444444446 -0.56537253254917963 0.82376026015320714 -0.042106213689281344
+-0.54642727777777778 0.83706338888888898 -0.017980883333333336 -0.54804592063505209 0.83636135974086356 -0.012055903437399117
+-0.5173335 0.85504466666666668 -0.029093672222222228 -0.52272355313495689 0.85201161052788332 -0.028918895615988951
+-0.50711255555555557 0.85930705555555564 -0.062750183333333334 -0.51277951198683769 0.85626429280439009 -0.062198335626753108
+-0.67906 0.180397 0.71157099999999995 -0.69693841025922532 0.18631004100784529 0.69250662157484011
+-0.70717300000000005 0.156079 0.68959800000000004 -0.71537942770753027 0.17007047089356156 0.67772288536162684
+-0.9496837222222223 0.23785461111111114 0.20207944444444448 -0.94861232896928716 0.23743102670924657 0.20919167498554567
+-0.54642727777777778 0.83706338888888898 0.017980883333333333 -0.54804592063504842 0.83636135974086612 0.012055903437396466
+-0.56986272222222223 0.82052500000000006 0.038781744444444446 -0.56537253254917719 0.82376026015320847 0.042106213689287089
+-0.95737461111111111 0.11857641111111111 0.26212472222222222 -0.95748924261049206 0.112208717044104 0.26575092493630686
+-0.8034865555555557 0.18225488888888891 0.56619688888888897 -0.80750215514867785 0.18500026696908062 0.56010282149941859
+-0.72739255555555571 0.26071327777777775 0.63424300000000011 -0.72841863240722293 0.25377752315238072 0.63639866805692946
+-0.796244888888889 0.30326661111111114 0.52283733333333338 -0.80064340072457874 0.29842502974182072 0.51953117952609418
+-0.99747061111111113 -4.3368086899420177e-19 -0.066027105555555562 -0.99733709501384338 0 -0.072929547573996431
+-0.82737416666666685 0.44531800000000005 0.3412486111111111 -0.82939663789348583 0.43966966189157797 0.34466187120586389
+-0.78656727777777768 0.55215255555555565 -0.27522161111111115 -0.78432765572944274 0.55767059215724279 -0.2717234607113394
+-0.82737416666666685 0.44531800000000005 -0.3412486111111111 -0.82939663789348594 0.43966966189157802 -0.3446618712058635
+-0.95737461111111111 0.11857641111111111 -0.26212472222222222 -0.95748924261049195 0.11220871704410373 -0.26575092493630714
+-0.63424300000000011 0.72739255555555571 0.26071327777777775 -0.63639866805692946 0.72841863240722293 0.25377752315238078
+-0.7528193333333334 0.65410794444444442 0.068852516666666669 -0.74860458609881297 0.65907084566498109 0.072227377539764298
+-0.73211922222222225 0.64923744444444442 0.20448750000000002 -0.72922160028600269 0.65414251623789987 0.20083183544017655
+-0.66640616666666663 0.7334316111111111 0.13171617222222221 -0.66784510328733937 0.73382922312113563 0.12440895992071306
+-0.52283733333333338 0.796244888888889 0.30326661111111114 -0.51953117952609429 0.80064340072457885 0.29842502974182078
+-0.56619688888888886 0.80348655555555559 0.18225488888888888 -0.56010282149942148 0.80750215514867607 0.18500026696907951
+-0.91482127777777766 0.22998205555555556 0.33097694444444448 -0.91284890386869511 0.22907161979226712 0.3379838335060848
+-0.93384100000000014 0.35669555555555549 2.1684043449710089e-19 -0.93415927591642067 0.35685633736846878 4.122220386358486e-05
+-0.7528193333333334 0.65410794444444453 -0.068852516666666669 -0.74860458609881209 0.65907084566498175 -0.072227377539766546
+-0.63424300000000011 0.72739255555555571 -0.26071327777777775 -0.63639866805692902 0.72841863240722293 -0.25377752315238217
+-0.52283733333333349 0.796244888888889 -0.3032666111111112 -0.51953117952609296 0.80064340072457829 -0.29842502974182439
+-0.91482127777777777 0.22998205555555556 -0.33097694444444448 -0.91284890386869444 0.22907161979226678 -0.33798383350608691
+-0.46847355555555559 0.77608166666666667 0.42135327777777787 -0.47160061355993166 0.77780808754094399 0.41546051586859017
+-0.46027055555555552 0.64127100000000004 0.6133656666666667 -0.45650201705245275 0.63890559189202323 0.61919750732391166
+-0.98330661111111117 0.12116736666666666 0.13317721111111114 -0.9827228972713633 0.12101573129925849 0.14003892300601037
+-0.77608166666666667 0.42135327777777787 0.46847355555555559 -0.77780808754094399 0.41546051586859017 0.47160061355993166
+-0.64127100000000004 0.6133656666666667 0.46027055555555552 -0.63890559189202323 0.61919750732391166 0.45650201705245275
+-0.58693700000000004 0.71182900000000005 0.38485688888888897 -0.58981619764168025 0.71337613272082079 0.37843274998841775
+-0.92452216666666687 0.35434750000000009 0.13780929444444445 -0.92662540228961998 0.34835515406796136 0.14147102341429091
+-0.90050594444444454 4.3368086899420177e-19 0.43422022222222229 -0.89935744418860264 0.00608774762538173 0.43717173617629285
+-0.6133656666666667 0.46027055555555552 0.64127100000000004 -0.61919750732391166 0.45650201705245269 0.63890559189202312
+-0.73211922222222225 0.64923744444444453 -0.20448749999999999 -0.72922160028600247 0.65414251623789943 -0.20083183544017855
+-0.45328572222222219 0.86514772222222236 0.21312049999999999 -0.46005659684907113 0.86225232066584678 0.21182271644470307
+-0.59434344444444454 0.80154466666666668 0.061161461111111114 -0.59555205960658975 0.80147246699299546 0.054402471915442736
+-0.58693699999999993 0.71182900000000005 -0.38485688888888897 -0.58981619764167759 0.71337613272082068 -0.37843274998842213
+-0.81494088888888883 0.5619532777777777 -0.13924307777777778 -0.81227206434124688 0.56726128730848824 -0.13575244164259401
+-0.8825426666666667 0.46425161111111113 0.069884822222222226 -0.88011186107951078 0.47012486878553988 0.066224766791124254
+-0.43422022222222229 0.90050594444444454 4.3368086899420177e-19 -0.43717173617629279 0.89935744418860253 0.0060877476253817292
+-0.49538216666666668 0.86270588888888911 0.098961244444444443 -0.49157165050389362 0.86573472660895023 0.094131267728656903
+-0.69377355555555564 0.63683855555555557 0.33529638888888891 -0.69125857906576693 0.64204640936346036 0.33156897486264408
+-0.52819516666666666 0.68325033333333329 0.5034616666666667 -0.53176094050308254 0.68541575936630394 0.49742892855923659
+-0.86270588888888911 0.098961244444444443 0.49538216666666668 -0.86573472660895023 0.094131267728656903 0.49157165050389362
+-0.63683855555555557 0.33529638888888891 0.69377355555555564 -0.64204640936346036 0.33156897486264408 0.69125857906576693
+-0.68325033333333329 0.5034616666666667 0.52819516666666666 -0.68541575936630394 0.49742892855923659 0.53176094050308254
+-0.86514772222222236 0.21312049999999999 0.45328572222222219 -0.86225232066584678 0.21182271644470307 0.46005659684907113
+-0.80154466666666668 0.061161461111111114 0.59434344444444454 -0.80147246699299546 0.054402471915442736 0.59555205960658975
+-0.78033200000000003 0.042275100000000003 0.62393500000000002 -0.78407127489047468 0.059746338909362595 0.61778848393163921
+-0.74702500000000005 0.44971800000000001 -0.48959900000000001 -0.75508871558387747 0.46124764935000617 -0.46593093647769734
+-0.59434344444444454 0.80154466666666668 -0.061161461111111121 -0.59555205960658975 0.80147246699299557 -0.054402471915442729
+-0.64150099999999999 0.61357099999999998 -0.46044200000000002 -0.65673447269235907 0.61424222388299454 -0.43750008317343481
+-0.49538216666666668 0.86270588888888911 -0.098961244444444443 -0.49157165050389273 0.8657347266089509 -0.09413126772865571
+-0.92452216666666687 0.35434750000000004 -0.13780929444444445 -0.92662540228961932 0.34835515406796236 -0.14147102341429241
+-0.89724905555555579 0.34646733333333335 0.27242099999999997 -0.89882246463749638 0.34067182429932835 0.27579137983545515
+-0.60983299999999996 0.316411 0.72662700000000002 -0.61932455774524731 0.32238657214267979 0.71589384008786283
+-0.77634800000000004 0.42150300000000002 -0.46863500000000002 -0.77588152683094125 0.43625185329312871 -0.45573257160400304
+-0.85372577777777792 0.33086838888888892 0.40125088888888893 -0.85496615637444284 0.32494888289771667 0.40427848688476831
+-0.85372577777777781 0.33086838888888898 -0.40125088888888893 -0.85496615637444262 0.32494888289771789 -0.40427848688476786
+-0.86369744444444452 0.4583800555555555 0.20788044444444445 -0.86616824898877876 0.45283443719162808 0.2114084599467447
+-0.30181000000000002 0.95256300000000005 0.0391817 -0.32180688571102561 0.94600646206740135 0.038885756205701984
+-0.73364399999999996 0.131776 0.66663399999999995 -0.74151199518419464 0.14566234621322263 0.65493697551261676
+-0.50593500000000002 0.79132199999999997 -0.343277 -0.51143821345764495 0.79346878547286259 -0.32990641141916699
+-0.95620099999999997 0.078785400000000005 -0.28190999999999999 -0.96053907952743656 0.085293134523931863 -0.26474470325894617
+-0.99527699999999997 -0.040669700000000003 -0.088143899999999997 -0.99621899529180924 -0.02031637445214958 -0.084468682651608992
+-0.34134199999999998 0.82764800000000005 0.44551600000000002 -0.36647338809820029 0.82188399531177481 0.43612378296325494
+-0.97094899999999995 0 -0.239285 -0.97492814521969429 0.020036039453891236 -0.22161603908898064
+-0.331038 0.915126 -0.230126 -0.35532110021242136 0.90819294791581795 -0.22120688302991567
+-0.35457899999999998 0.89672200000000002 -0.26488299999999998 -0.36371084954020677 0.89862402582053635 -0.2453350324450892
+-0.80071099999999995 0.020565699999999999 0.59869700000000003 -0.80746719704491621 0.039892119918317308 0.58856209907268831
+-0.74167483333333351 0.53379438888888886 0.40531733333333336 -0.73972208925562632 0.53965196194684129 0.40197884351569579
+-0.74167483333333351 0.53379438888888897 -0.40531733333333336 -0.7397220892556251 0.53965196194684439 -0.40197884351569385
+-0.99217522222222232 0.12202262222222222 -1.3010426069826053e-18 -0.99248982549914533 0.12212601651507285 0.0070130143901431068
+-0.67883666666666675 0.73387122222222234 1.951563910473908e-18 -0.67924929250052091 0.73386636530991478 0.0077818059829597485
+-0.38394200000000006 0.91612616666666669 0.11263961111111111 -0.37990979769417871 0.91886656680883305 0.10654941584502681
+-0.54876899999999995 0.73479000000000005 -0.39866800000000002 -0.56076995279975261 0.73401997436425093 -0.38308189368758688
+-0.56871099999999997 0.70405399999999996 -0.42529400000000001 -0.58091329232488209 0.70342033053508191 -0.4095602341416732
+-0.36277999999999999 0.75852699999999995 0.54131899999999999 -0.38795830027020761 0.75270719006440567 0.53190247534374024
+-0.382795 0.72741100000000003 0.56950999999999996 -0.39701899662445073 0.7299388794828412 0.55638579110060737
+-0.52563517762968126 0.85049595564708425 -8.6736173798840355e-19 -0.53286827537195869 0.84619820438365057 6.5053341907911413e-18
+-0.54131899999999999 0.36277999999999999 0.75852699999999995 -0.56127687658847891 0.3691653923107075 0.74073286745436295
+-0.40125088888888893 0.85372577777777792 0.33086838888888892 -0.40427848688476836 0.85496615637444284 0.32494888289771673
+-0.83627799999999997 0.32328800000000002 -0.442859 -0.83690830869121813 0.33795646325074835 -0.43054606233323084
+-0.98045000000000004 -6.1593100000000002e-19 -0.196769 -0.98045994040191098 -5.4896080364669229e-05 -0.19671884061650372
+-0.983657 -0.0403062 -0.175484 -0.98733141454440743 -0.020272978151031067 -0.15737116702441764
+-0.85049595564708425 -2.1684043449710089e-19 0.52563517762968126 -0.84619820438365057 6.5053341907911413e-18 0.53286827537195869
+-0.83699800000000002 -0.018297399999999998 0.54689900000000002 -0.84109901036312684 -0.0006223010203983729 0.54088082560542738
+-0.85529599999999995 -0.029605800000000002 0.517293 -0.85793680498015401 -0.011019552948905177 0.5136370392731151
+-0.77289299999999994 0.51966566666666669 0.36316266666666669 -0.77525724683632291 0.5142765787888488 0.36673669265155534
+-0.99956166666666668 0.013604699999999999 0 -0.99988372058015584 0.013629673108110113 -0.0068393954229029521
+-0.78783499999999995 0.52574633333333332 0.31970700000000002 -0.78586803119594739 0.53135648596864626 0.31634114870382823
+-0.80185966666666664 0.50398500000000002 0.31988800000000001 -0.80422451138794693 0.49861910324694281 0.32342220882313033
+-0.81546433333333335 0.49557666666666661 0.297875 -0.81785066340747914 0.49020047591881771 0.30136984881190576
+-0.81546433333333335 0.49557666666666672 -0.297875 -0.81785066340747914 0.4902004759188176 -0.30136984881190587
+-0.80185966666666664 0.50398500000000002 -0.31988800000000001 -0.80422451138794648 0.49861910324694259 -0.32342220882313183
+-0.99956166666666668 -0.013604699999999999 0 -0.99996783263413735 -0.0068216811251523412 -0.0042188106869880991
+-0.93659933333333323 0.16855100000000001 -0.30612900000000004 -0.93692474218610955 0.16240931835947478 -0.30950806255977042
+-0.57885033333333336 0.7680486666666666 0.27272099999999999 -0.57567345520774471 0.77242629943301855 0.26824929620297133
+-0.76366033333333327 0.64510233333333333 2.3129646346357427e-18 -0.75994660362472921 0.64997687859126629 0.0033491694482402413
+-0.75307866666666667 0.64288299999999998 0.13748199999999999 -0.74853514111358355 0.64796557746314509 0.14083945803971382
+-0.30612900000000004 0.93659933333333323 0.16855100000000001 -0.32042629145449342 0.93229701962588485 0.16777740891256079
+-0.69375566666666666 0.69718433333333341 0.1788173333333333 -0.69272430128514717 0.69666909427137036 0.18650795022227099
+-0.5811776666666667 0.7578826666666667 0.29526266666666667 -0.58354064449288279 0.75900226565195095 0.28878344301575909
+-0.59284466666666669 0.77091966666666656 0.231459 -0.59490829083334629 0.77172429004474563 0.224779326568704
+-0.93659933333333323 0.16855100000000001 0.30612900000000004 -0.93692474218610955 0.16240931835947478 0.30950806255977042
+-0.61583966666666667 0.77343700000000004 0.14808233333333334 -0.61020748195835961 0.77769021399991445 0.15114483124078501
+-0.7578826666666667 0.29526266666666667 0.5811776666666667 -0.75900226565195095 0.28878344301575909 0.58354064449288279
+-0.93617499999999998 0.34366800000000003 -0.068979233333333334 -0.93602631680507398 0.34349602657608669 -0.076584684988368859
+-0.7680486666666666 0.27272099999999999 0.57885033333333336 -0.77242629943302044 0.26824929620296939 0.57567345520774327
+-0.74740133333333336 0.66387866666666662 2.3129646346357427e-18 -0.74354807872366546 0.66867393047994539 0.0033807281533855069
+-0.58117766666666659 0.7578826666666667 -0.29526266666666667 -0.5835406444928789 0.7590022656519525 -0.28878344301576314
+-0.57885033333333336 0.7680486666666666 -0.27272099999999999 -0.5756734552077426 0.77242629943301921 -0.26824929620297372
+-0.94036500000000001 0.18248266666666665 -0.28591433333333333 -0.93876161227415711 0.18183151327891484 -0.29268402091526075
+-0.94036500000000001 0.18248266666666668 0.28591433333333333 -0.938761612274157 0.181831513278917 0.29268402091526002
+-0.48935600000000007 0.73308833333333334 0.47160733333333332 -0.4927127487950147 0.73512444694758228 0.4656459971640175
+-0.39967966666666666 0.67766533333333323 0.61670666666666663 -0.4057082751091835 0.66658297433696267 0.62535424667305106
+-0.9801036666666666 0.17508766666666667 0.089676533333333322 -0.97980797925647178 0.17494393426128732 0.096803634490300355
+-0.9801036666666666 0.17508766666666667 -0.089676533333333322 -0.97980797925647156 0.17494393426128724 -0.096803634490302715
+-0.73308833333333334 0.47160733333333332 0.48935600000000007 -0.73512444694758217 0.46564599716401744 0.49271274879501464
+-0.67766533333333323 0.61670666666666663 0.39967966666666666 -0.67529430507839372 0.62228451488397507 0.39590350347566416
+-0.56508966666666671 0.75308399999999998 0.33594766666666659 -0.5620912979229169 0.75773911645994707 0.33148876932081661
+-0.85275266666666683 0.50849633333333333 0.11638163333333335 -0.85023870611270813 0.51416078857641512 0.11283982505421924
+-0.52923299999999995 0.73907899999999993 0.41591 -0.52632608030381212 0.74415674792463482 0.41135336598872835
+-0.90817599999999998 0.36339733333333335 0.20605833333333332 -0.91006734464879224 0.35752579751229385 0.2096490694400874
+-0.47160733333333332 0.48935600000000007 0.73308833333333334 -0.4682734800155286 0.50279225411793382 0.72658096390777638
+-0.87451599999999996 0.011107333333333332 0.484402 -0.87327349468882909 0.017454459367511759 0.48691759602847318
+-0.61670666666666663 0.39967966666666666 0.67766533333333323 -0.62228451488397507 0.39590350347566416 0.67529430507839372
+-0.75308399999999998 0.33594766666666659 0.56508966666666671 -0.75773911645994707 0.33148876932081667 0.5620912979229169
+-0.90817600000000009 0.36339733333333335 -0.20605833333333332 -0.91006734464879269 0.35752579751229241 -0.20964906944008832
+-0.73907899999999993 0.41591 0.52923299999999995 -0.74415674792463482 0.41135336598872835 0.52632608030381212
+-0.8527526666666666 0.50849633333333333 -0.11638163333333333 -0.85023870611270924 0.5141607885764129 -0.11283982505422124
+-0.67766533333333323 0.61670666666666663 -0.39967966666666666 -0.67529430507839383 0.62228451488397507 -0.39590350347566428
+-0.39742499999999997 0.66042066666666666 0.63655099999999998 -0.4057082751091835 0.66658297433696267 0.62535424667305106
+-0.45502866666666669 0.50961199999999995 0.72975599999999996 -0.4682734800155286 0.50279225411793382 0.72658096390777638
+-0.70626633333333333 0.36633966666666667 0.60522599999999993 -0.70779537966296246 0.35975178512851885 0.60795094672564387
+-0.76558033333333331 0.085767633333333329 0.63713500000000001 -0.77323281423122159 0.077653387717214403 0.62934963761974561
+-0.76758566666666661 0.59794999999999998 -0.22930300000000001 -0.76500174879047678 0.60316909560327436 -0.2257418137090256
+-0.48575733333333332 0.85913700000000004 0.15916633333333333 -0.49236164203072019 0.85597689550574485 0.15774526242382089
+-0.70640999999999998 0.65384799999999998 -0.26978799999999997 -0.70479467267294238 0.65296399002289907 -0.27731299483654781
+-0.62453233333333336 0.77336900000000008 0.10615883333333336 -0.61921792024752453 0.77757536492117973 0.10929647346563649
+-0.60260966666666671 0.72989533333333334 -0.32161633333333334 -0.60506997784073069 0.73117473379442233 -0.31507749931798262
+-0.84843866666666656 0.52034900000000006 -0.093204899999999993 -0.84495153855592087 0.52601430444535291 -0.096777316613210582
+-0.64234066666666667 0.66917433333333332 -0.37270666666666669 -0.64507244158114818 0.67076762158679837 -0.36599500398683832
+-0.84843866666666667 0.52034900000000006 0.093204899999999993 -0.84495153855591643 0.52601430444536001 0.096777316613210984
+-0.465366 0.87173933333333331 -0.15137733333333334 -0.46147336445081139 0.87506756832444721 -0.14594205963048348
+-0.37959833333333332 0.92474699999999999 -0.012602500000000001 -0.38307647295871616 0.9235192143889186 -0.019096505439074183
+-0.37959833333333332 0.92474699999999999 0.012602500000000001 -0.38307647295871666 0.92351921438891849 0.019096505439074183
+-0.465366 0.87173933333333331 0.15137733333333334 -0.46147336445081139 0.87506756832444721 0.14594205963048348
+-0.66042066666666666 0.63655099999999998 0.39742499999999997 -0.66331585323080933 0.63827653991955358 0.39065987436772392
+-0.50961199999999995 0.72975599999999996 0.45502866666666669 -0.50673295418397113 0.73504735835047963 0.45047429907372849
+-0.92474699999999999 0.012602500000000001 0.37959833333333332 -0.92351921438891826 0.019096505439074589 0.38307647295871694
+-0.87173933333333331 0.15137733333333334 0.465366 -0.87506756832444721 0.14594205963048346 0.46147336445081144
+-0.63655099999999998 0.39742499999999997 0.66042066666666666 -0.63827653991955358 0.39065987436772392 0.66331585323080933
+-0.72975599999999996 0.45502866666666669 0.50961199999999995 -0.73504735835047952 0.45047429907372849 0.50673295418397124
+-0.85913700000000004 0.15916633333333333 0.48575733333333332 -0.85597689550574485 0.15774526242382092 0.49236164203072025
+-0.77336900000000008 0.10615883333333336 0.62453233333333336 -0.78103480899705635 0.10543516307432657 0.61552258571267882
+-0.38578466666666666 0.91196566666666667 -0.13735133333333335 -0.38170698678408682 0.91489615052823081 -0.1313956239333629
+-0.63713500000000001 0.76558033333333331 0.085767633333333329 -0.63830921052516987 0.76577763557673062 0.078396202773134777
+-0.34578333333333333 0.92738500000000013 -0.14052333333333333 -0.35526703821093636 0.92513910167343838 -0.13380199593314146
+-0.63713500000000012 0.76558033333333331 -0.085767633333333329 -0.63830921052516876 0.76577763557673173 -0.078396202773132015
+-0.66042066666666666 0.63655099999999998 -0.39742499999999997 -0.66331585323081155 0.63827653991955335 -0.39065987436772048
+-0.62453233333333336 0.77336900000000008 -0.10615883333333333 -0.61921792024752453 0.7775753649211794 -0.10929647346563828
+-0.48575733333333332 0.85913700000000004 -0.15916633333333333 -0.49236164203071847 0.85597689550574585 -0.15774526242382142
+-0.97537799999999997 0.18801833333333332 -0.11218733333333335 -0.9764931715377293 0.18163303536640046 -0.11606259691982868
+-0.91777433333333336 0.33882699999999999 -0.20539200000000002 -0.91668255996789427 0.33821761363490599 -0.2128425006379534
+-0.92474699999999999 -0.012602500000000001 0.37959833333333332 -0.92527214855994633 0 0.37930390335357811
+-0.91777433333333336 0.33882699999999999 0.20539200000000002 -0.91668255996789394 0.33821761363490749 0.21284250063795271
+-0.97537799999999997 0.18801833333333332 0.11218733333333332 -0.97649317153772908 0.18163303536640471 0.11606259691982385
+-0.40547466666666665 0.80963433333333334 0.42354566666666665 -0.408691595668839 0.81144548502237668 0.41776477169150822
+-0.94234466666666672 0.30424066666666666 0.13681299999999999 -0.94173031487740799 0.30386966027528961 0.14424716151480435
+-0.99207933333333331 0.054101533333333333 0.11027263333333333 -0.99164764746382228 0.054013020860459802 0.11712188888928619
+-0.86487900000000006 0.40426999999999996 0.29640233333333338 -0.86674451897969007 0.3985820613477869 0.29981040540717491
+-0.80963433333333334 0.42354566666666665 0.40547466666666665 -0.81144548502237668 0.41776477169150827 0.408691595668839
+-0.74252466666666672 0.58916000000000002 0.31757133333333337 -0.74020590226045235 0.59456587600237154 0.31398509734113539
+-0.7955836666666668 0.56853366666666671 0.20766399999999999 -0.79307922087067428 0.5738800737666252 0.20417397081111258
+-0.79716033333333325 0.44612266666666667 -0.4059733333333333 -0.79909671055864817 0.44039401856273125 -0.40926465225880038
+-0.86373599999999995 0.39010866666666666 -0.3179366666666667 -0.86545918830920177 0.38438648650835755 -0.32129024628976516
+-0.81024333333333332 0.54730766666666664 -0.20800033333333334 -0.80785581446410626 0.55275547300632644 -0.20452474201936535
+-0.74148199999999997 0.60197033333333339 -0.29520200000000002 -0.73906234222990586 0.60726071395459069 -0.29158408664569857
+-0.9934303333333333 0.067718666666666663 -0.088402033333333338 -0.99314918002006447 0.067643366773000799 -0.095284212528030668
+-0.91331600000000002 0.2833236666666667 -0.29138366666666671 -0.91162683613135609 0.28243667588778676 -0.29860682470196653
+-0.88811699999999993 0.235012 -0.39416099999999998 -0.890681142321188 0.24272715970079453 -0.38440945443239094
+-0.88821033333333332 0.289103 -0.35613033333333338 -0.88604481153509118 0.28797485361117353 -0.36331126550021547
+-0.5071836666666667 0.77994399999999997 0.36575233333333329 -0.50403015322344324 0.78467004695978271 0.36089683019622731
+-0.47919333333333336 0.83556433333333324 0.26749133333333336 -0.47564586046431578 0.83961015499386216 0.26232766353235332
+-0.7083356666666667 0.69966133333333325 -0.089924799999999985 -0.7038151510559455 0.70424258900951187 -0.09320197942788723
+-0.78020833333333339 0.6142103333333333 -0.1155074 -0.77599904496904304 0.61942346543754434 -0.11891195344655786
+-0.98179066666666659 0.067108333333333339 0.17578733333333332 -0.98236697934278294 0.073740260498035559 0.17180655365444594
+-0.39416099999999998 0.88811699999999993 -0.235012 -0.39029244070833502 0.89169613543267312 -0.22923745937426254
+-0.95185399999999998 0.18443866666666667 0.24347300000000002 -0.95246277304167826 0.17830859445972633 0.24702370556599079
+-0.39211200000000002 0.89509833333333333 0.21071133333333333 -0.39886049622107295 0.89271516295955666 0.20969011034469823
+-0.96942466666666649 0.18714233333333333 0.156526 -0.97035780623413448 0.18083800786474119 0.16032262096157779
+-0.31356300000000004 0.90261333333333338 0.29375033333333334 -0.32141623142252845 0.89646988933045202 0.30501367789328204
+-0.96258599999999994 0.25397200000000003 0.09068166666666666 -0.96227939571058341 0.25377396032399235 0.098067026325627263
+-0.64312566666666671 0.73996333333333342 0.195437 -0.64494437574753827 0.74062748064621042 0.18846136766792621
+-0.96987800000000002 0.21437700000000001 0.112605 -0.96942041966637416 0.214167697613143 0.11981755811631437
+-0.67335333333333336 0.68025100000000005 0.28840266666666664 -0.67561848758426213 0.68146714538505249 0.28132221560890297
+-0.95051299999999994 0.25157233333333334 -0.1803963333333333 -0.9495936030701162 0.25112435222994195 -0.18763941143961896
+-0.97059266666666666 0.13337166666666667 0.19870833333333335 -0.97101274551131977 0.12695397055556645 0.20252638695919456
+-0.96388766666666659 0.21337133333333336 -0.15716566666666668 -0.96498961593619315 0.20708100103663879 -0.16097360077038111
+-0.95781033333333332 0.052552533333333339 0.28139533333333333 -0.95740639511441361 0.046056106024188338 0.28504706574864452
+-0.97835466666666659 0.13419600000000001 -0.15533166666666667 -0.97838757513424479 0.14084256474460208 -0.15139724164955903
+-0.73996333333333342 0.195437 0.64312566666666671 -0.74062748064621031 0.18846136766792798 0.64494437574753793
+-0.97513733333333319 0.174405 -0.134158 -0.97481076842484271 0.18106185771060812 -0.13023275104731188
+-0.68025100000000005 0.28840266666666664 0.67335333333333336 -0.68146714538505249 0.28132221560890297 0.67561848758426213
+-0.77994399999999997 0.36575233333333329 0.5071836666666667 -0.78467004695978271 0.36089683019622731 0.50403015322344324
+-0.83556433333333324 0.26749133333333336 0.47919333333333336 -0.83961015499386216 0.26232766353235332 0.47564586046431578
+-0.79050733333333334 0.60483999999999993 0.092675333333333332 -0.78646561875409737 0.61011351204287267 0.096090233324964344
+-0.71420500000000009 0.69031900000000002 0.11276623333333331 -0.70950505689328325 0.69507800521822616 0.11605662800852996
+-0.78747599999999995 0.53911566666666666 0.29756199999999999 -0.78538004564948849 0.54467029029810388 0.29413000316558424
+-0.49762466666666666 0.82988799999999996 -0.25101366666666663 -0.49412565227007843 0.83384124532456627 -0.2460662865250868
+-0.65713566666666667 0.68726900000000002 -0.30847566666666665 -0.65950617715867399 0.68858179013179976 -0.30150741382002177
+-0.6616523333333334 0.72279800000000005 -0.197798 -0.66344152060850281 0.72354710316866455 -0.19059102347411691
+-0.99859100000000012 -0.013590633333333333 0.044029100000000009 -0.9988128753081037 -0.0068038108128106942 0.048234306019492121
+-0.92589466666666664 0.3410583333333333 0.16028966666666666 -0.92729951609022887 0.34172478535605449 0.15277361857397345
+-0.97400100000000001 0.10685479999999999 -0.19805566666666666 -0.97425477158224116 0.10036775147702315 -0.20187608702538642
+-0.89509833333333333 0.21071133333333333 0.39211200000000002 -0.89271516295955666 0.20969011034469823 0.39886049622107295
+-0.90261333333333338 0.29375033333333334 0.31356300000000004 -0.90075490292340932 0.29279158384639536 0.32080164165440095
+-0.94157666666666662 0.24970966666666664 -0.22448566666666667 -0.94036205292087072 0.24911249832849999 -0.23165097151313302
+-0.58663266666666669 0.65703199999999995 0.47272399999999998 -0.58998962692897738 0.65911767202191729 0.46634336549865762
+-0.93505400000000005 0.28885866666666665 -0.203819 -0.93397663141277909 0.28826917001433544 -0.2111599810430089
+-0.50478966666666658 0.65467133333333327 0.56203933333333334 -0.50864425512068367 0.65717775549865221 0.55623593861820786
+-0.94919133333333328 0.29215933333333338 0.11390889999999999 -0.95098005149307741 0.28595536523492054 0.11775597970203884
+-0.96664833333333344 0.25472800000000001 0 -0.9669663063002002 0.25479681426981771 -0.0073990484590429539
+-0.97059266666666666 0.13337166666666667 -0.19870833333333335 -0.97101274551132022 0.12695397055556867 -0.20252638695919101
+-0.99207933333333331 0.054101533333333333 -0.11027263333333333 -0.99164764746382206 0.054013020860459747 -0.11712188888928872
+-0.65703199999999995 0.47272399999999998 0.58663266666666669 -0.65911767202191718 0.46634336549865757 0.58998962692897738
+-0.65467133333333327 0.56203933333333334 0.50478966666666658 -0.65717775549865221 0.55623593861820786 0.50864425512068367
+-0.65713566666666667 0.68726900000000002 0.30847566666666665 -0.65950617715867343 0.68858179013179954 0.30150741382002344
+-0.74148199999999997 0.60197033333333339 0.29520200000000002 -0.73906234222990685 0.60726071395458969 0.2915840866456984
+-0.81012700000000004 0.58566899999999988 1.1564823173178713e-18 -0.80672946273972779 0.59091102649086835 -0.0034253057058179774
+-0.87879200000000013 0.47646799999999995 0 -0.87594527869572436 0.48239666909390189 0.0036499832572823737
+-0.80900833333333333 0.5853666666666667 0.046535400000000005 -0.80536664437786765 0.59066725196862824 0.049967645285347626
+-0.90939900000000007 0.404609 0.092631633333333338 -0.90740336917538711 0.41073675447775659 0.088963161647027986
+-0.825125 0.55223 0.11626180000000001 -0.82132486405654326 0.55774163148492695 0.11979040108052387
+-0.91331600000000002 0.2833236666666667 0.29138366666666665 -0.91162683613135653 0.28243667588778471 0.29860682470196687
+-0.80566133333333345 0.58445933333333333 0.092900399999999994 -0.80177649552426944 0.58980757151104324 0.09634043706080414
+-0.86373599999999995 0.39010866666666666 0.3179366666666667 -0.86545918830920299 0.38438648650835555 0.32129024628976438
+-0.47272399999999998 0.58663266666666669 0.65703199999999995 -0.46634336549865762 0.58998962692897738 0.65911767202191718
+-0.56203933333333334 0.50478966666666658 0.65467133333333327 -0.55623593861820786 0.50864425512068367 0.65717775549865221
+-0.68726900000000002 0.30847566666666665 0.65713566666666667 -0.68858179013179954 0.30150741382002344 0.65950617715867343
+-0.94919133333333328 0.29215933333333333 -0.11390890000000002 -0.95098005149307707 0.28595536523492232 -0.11775597970203766
+-0.90939899999999996 0.404609 -0.092631633333333338 -0.907403369175387 0.41073675447775648 -0.088963161647030178
+-0.79050733333333334 0.60484000000000004 -0.092675333333333332 -0.78646561875409549 0.61011351204287456 -0.096090233324967592
+-0.7955836666666668 0.56853366666666671 -0.20766399999999999 -0.79307922087067173 0.57388007376662842 -0.20417397081111341
+-0.41684100000000002 0.64266266666666672 0.64228433333333335 -0.42399511837129866 0.63996385947581835 0.64083882385676638
+-0.80963433333333334 0.42354566666666665 -0.40547466666666665 -0.81144548502237734 0.41776477169150611 -0.40869159566884011
+-0.99207933333333331 -0.054101533333333333 0.11027263333333333 -0.99240482996690904 -0.05487374096346978 0.11009780202631003
+-0.54026033333333323 0.42592233333333329 0.72526299999999999 -0.5452962766935473 0.42914770675804437 0.72005848124195149
+-0.48563733333333331 0.67302499999999998 0.55721300000000007 -0.48216266629032711 0.67100777744573958 0.56326523578428966
+-0.50354433333333326 0.44788500000000003 0.73833599999999999 -0.51615957150728675 0.44054448209603864 0.73450653913777197
+-0.49416866666666664 0.58555666666666661 0.64203733333333324 -0.49014431522370427 0.58311474774123595 0.64787015768636913
+-0.83002100000000001 0.094685866666666674 0.5491476666666667 -0.82633832091363435 0.093151227236951961 0.55541680587994924
+-0.45446199999999998 0.88853966666666662 0.058519000000000009 -0.45770120718577129 0.88673026138413047 0.064954202991948873
+-0.54445066666666675 0.83522233333333329 0.07397256666666667 -0.55071371438576 0.83154149343230865 0.072478614003066502
+-0.7083356666666667 0.69966133333333325 0.089924799999999985 -0.70381515105594539 0.70424258900951187 0.093201979427887216
+-0.6616523333333334 0.72279800000000005 0.197798 -0.66344152060850248 0.72354710316866433 0.19059102347411849
+-0.90159 0.41595233333333331 -0.11581156666666666 -0.9041258793861191 0.41022123517546549 -0.11947774870406765
+-0.89096966666666655 0.45328200000000002 0 -0.88829956329805226 0.45925001961072781 0.0036476474659192515
+-0.81024333333333332 0.54730766666666664 0.20800033333333334 -0.80785581446410548 0.55275547300632821 0.20452474201936305
+-0.78020833333333339 0.61421033333333341 0.1155074 -0.77599904496904393 0.61942346543754312 0.11891195344655889
+-0.5491476666666667 0.83002100000000001 -0.094685866666666674 -0.55541680587994735 0.8263383209136359 -0.093151227236949824
+-0.47047800000000001 0.88093966666666679 -0.045717566666666674 -0.47367208159418261 0.87915537869836757 -0.052159172002283656
+-0.45446199999999998 0.88853966666666684 -0.058519000000000009 -0.45770120718577312 0.88673026138412925 -0.064954202991952745
+-0.47047800000000001 0.88093966666666679 0.045717566666666674 -0.47367208159417801 0.87915537869837013 0.05215917200228512
+-0.49762466666666666 0.82988799999999996 0.25101366666666663 -0.49412565227007543 0.83384124532456649 0.24606628652509174
+-0.39416099999999998 0.88811699999999993 0.235012 -0.40111014452966087 0.88567646916365717 0.2338543220152067
+-0.67302499999999998 0.55721300000000007 0.48563733333333331 -0.67100777744573958 0.56326523578428966 0.48216266629032711
+-0.58555666666666661 0.64203733333333324 0.49416866666666664 -0.58311474774123651 0.64787015768636802 0.49014431522370522
+-0.4059733333333333 0.79716033333333325 0.44612266666666667 -0.40926465225880088 0.79909671055864806 0.44039401856273114
+-0.486458 0.79575833333333323 0.35979033333333338 -0.48320205370506963 0.80038418386237031 0.35482521544863521
+-0.69445199999999996 0.62386399999999997 -0.35754099999999994 -0.69203077337497509 0.62922690351361499 -0.35378936190437066
+-0.88853966666666684 -0.058519000000000009 0.45446199999999998 -0.89280395272116786 -0.047483374616635085 0.44793574443269779
+-0.66024299999999991 0.64999866666666672 -0.37535166666666669 -0.65786067131660375 0.64872408443505769 -0.38259168758451034
+-0.88093966666666679 0.045717566666666674 0.47047800000000001 -0.87915537869837013 0.05215917200228512 0.47367208159417801
+-0.82988799999999996 0.25101366666666663 0.49762466666666666 -0.83384124532456649 0.24606628652509174 0.49412565227007543
+-0.88811699999999993 0.235012 0.39416099999999998 -0.88567646916365717 0.2338543220152067 0.40111014452966087
+-0.55721300000000007 0.48563733333333331 0.67302499999999998 -0.56326523578428966 0.48216266629032711 0.67100777744573958
+-0.64203733333333324 0.49416866666666664 0.58555666666666661 -0.64787015768636802 0.49014431522370522 0.58311474774123639
+-0.79716033333333325 0.44612266666666667 0.4059733333333333 -0.79909671055864828 0.44039401856273125 0.40926465225880038
+-0.79575833333333323 0.35979033333333338 0.486458 -0.80038418386237031 0.35482521544863521 0.48320205370506963
+-0.88853966666666662 0.058519000000000009 0.45446199999999998 -0.88673026138413047 0.064954202991948873 0.45770120718577129
+-0.83522233333333329 0.07397256666666667 0.54445066666666675 -0.83154149343230854 0.072478614003066488 0.55071371438576
+-0.72279800000000005 0.197798 0.6616523333333334 -0.72354710316866433 0.19059102347412032 0.66344152060850214
+-0.85113933333333336 0.48120366666666664 -0.20809633333333333 -0.84913149454651216 0.48691927864691631 -0.20465903608483363
+-0.5491476666666667 0.83002100000000001 0.094685866666666674 -0.55541680587994913 0.82633832091363435 0.093151227236951961
+-0.8594763333333334 0.48395833333333332 -0.16242533333333334 -0.85729015236698847 0.4896869529383035 -0.1589348381462842
+-0.59016800000000003 0.80696699999999988 0 -0.5909612291105667 0.80666632059680043 -0.007367014520702893
+-0.886714 0.45208100000000001 -0.093025999999999998 -0.88445594026952357 0.45797227380334932 -0.089437610373616749
+-0.64312566666666671 0.73996333333333342 -0.195437 -0.6449443757475386 0.74062748064621053 -0.1884613676679246
+-0.86579899999999999 0.48595499999999997 -0.11634196666666667 -0.86342620828191075 0.49170321319073101 -0.11279686604614993
+-0.71420500000000009 0.69031900000000002 -0.11276623333333331 -0.70950505689328547 0.69507800521822405 -0.11605662800853019
+-0.81869099999999995 0.55018 0.16232933333333333 -0.81615883216746976 0.5555569967244075 0.15887474332186538
+-0.74252466666666672 0.58916000000000002 -0.31757133333333332 -0.7402059022604538 0.59456587600237121 -0.31398509734113256
+-0.84310399999999996 0.51867133333333337 0.13947866666666667 -0.84064736639470805 0.52423280975073394 0.13598517034769717
+-0.67335333333333336 0.68025100000000005 -0.28840266666666664 -0.67561848758426168 0.68146714538505226 -0.28132221560890458
+-0.60766633333333331 0.79385399999999995 0 -0.60841673740322078 0.79358332414804944 -0.0073879145739746722
+-0.54445066666666664 0.83522233333333329 -0.07397256666666667 -0.55071371438575767 0.8315414934323101 -0.072478614003067404
+-0.39211200000000002 0.89509833333333333 -0.21071133333333333 -0.3988604962210725 0.89271516295955677 -0.20969011034469831
+-0.47919333333333336 0.83556433333333346 -0.26749133333333336 -0.47564586046431373 0.83961015499386371 -0.26232766353235182
+-0.89509833333333333 0.21071133333333333 -0.39211200000000002 -0.8945836430607591 0.22441838558653693 -0.38646667874329416
+-0.97316533333333333 0.22856499999999999 0 -0.97348482854419649 0.2286362961356681 0.0072617273178821875
+-0.94745033333333328 0.30541266666666672 -0.091388200000000017 -0.94714630499905217 0.30518549098693637 -0.098872104345486891
+-0.86487900000000006 0.40426999999999996 -0.29640233333333338 -0.86674451897969018 0.39858206134778706 -0.29981040540717457
+-0.90261333333333338 0.29375033333333334 -0.31356299999999998 -0.90075490292340965 0.29279158384639542 -0.32080164165440017
+-0.88093966666666679 -0.045717566666666674 0.47047800000000001 -0.88556582162034936 -0.035138373824508899 0.46318297708664202
+-0.95067500000000005 0.065210166666666666 0.30218800000000001 -0.95032134560726178 0.058869783707050996 0.30565288915612826
+-0.95781033333333332 -0.052552533333333339 0.28139533333333333 -0.95817725084869765 -0.053265830875932035 0.28117451381149139
+-0.90159 0.41595233333333331 0.11581156666666666 -0.90412587938612021 0.41022123517546238 0.11947774870406962
+-0.94745033333333328 0.30541266666666667 0.091388199999999989 -0.94714630499905228 0.30518549098693631 0.098872104345486558
+-0.99343033333333342 0.067718666666666663 0.088402033333333338 -0.99314918002006425 0.067643366773000743 0.095284212528033194
+-0.97400099999999989 0.10685479999999999 0.19805566666666666 -0.97425477158224116 0.10036775147702312 0.20187608702538648
+-0.46239333333333338 0.87702533333333343 -0.12820000000000001 -0.4584930575925823 0.88016659891075499 -0.12284491972108266
+-0.95071200000000011 0.2652113333333333 0.15845133333333333 -0.94995293871590381 0.26481784541564923 0.16571337596715502
+-0.82634566666666665 0.512992 0.23085599999999998 -0.82422732983832869 0.51857550385034679 0.22743956461868695
+-0.85368566666666668 0.44141599999999998 0.27509233333333333 -0.85582148664388757 0.43586295898178562 0.2785553158464012
+-0.56228400000000001 0.81096399999999991 -0.15991200000000003 -0.55631566138132926 0.81488320691282745 -0.1627213691969196
+-0.38492966666666667 0.78580233333333338 0.48337000000000002 -0.39192762437768786 0.7902768238673411 0.47101515783232467
+-0.65308166666666667 0.74134766666666663 -0.152499 -0.64779101941242789 0.74574375744789889 -0.15566966112925465
+-0.78580233333333338 0.48337000000000002 0.38492966666666667 -0.78795806538569857 0.47780772978512109 0.38835790265065528
+-0.62975100000000006 0.76574933333333328 -0.12819266666666668 -0.62439601093608088 0.76998727876036943 -0.13133625574954749
+-0.75846266666666662 0.55494633333333321 0.34069333333333335 -0.75635608685024946 0.56052363866255128 0.33725171665251996
+-0.43225599999999997 0.87782600000000011 -0.20480499999999999 -0.42840399148712766 0.88133427653309726 -0.19929855264346252
+-0.75846266666666662 0.55494633333333343 -0.34069333333333329 -0.75635608685024736 0.56052363866255428 -0.3372517166525198
+-0.44779533333333332 0.87820433333333325 -0.16621833333333333 -0.44389085236663067 0.88154577838886183 -0.16074187939053641
+-0.78580233333333338 0.48337000000000002 -0.38492966666666667 -0.78795806538569824 0.47780772978512143 -0.38835790265065567
+-0.85368566666666668 0.44141599999999998 -0.27509233333333333 -0.85582148664388724 0.4358629589817859 -0.27855531584640186
+-0.82634566666666665 0.512992 -0.23085599999999998 -0.82422732983832858 0.51857550385034701 -0.22743956461868695
+-0.99636266666666662 0.067883199999999991 0.044236466666666668 -0.9963838699098394 0.067863492853656962 0.051124652773333792
+-0.99636266666666662 0.067883200000000005 -0.044236466666666668 -0.9963838699098394 0.067863492853656962 -0.05112465277333382
+-0.95948299999999997 0.17222033333333334 -0.22148599999999999 -0.96008295290377954 0.16594163099917869 -0.22517570616052571
+-0.93079100000000004 0.24733633333333335 -0.26791033333333331 -0.92927996516300548 0.24659535849110642 -0.27500813718376799
+-0.62168500000000004 0.71214633333333344 0.32508266666666669 -0.62416619523254113 0.71348946815858938 0.31835411031696542
+-0.54656866666666659 0.75857066666666662 0.35377466666666663 -0.54351793677866556 0.76333618881165943 0.34915056243740034
+-0.71228033333333329 0.69998833333333332 0.045047166666666666 -0.70806005434928998 0.70449501035845985 0.048350179057723187
+-0.71228033333333329 0.69998833333333332 -0.045047166666666666 -0.70806005434928787 0.70449501035846218 -0.048350179057721307
+-0.96912566666666666 0.22787766666666665 0.090339766666666668 -0.96827388382743496 0.23444795137290469 0.086486091337179799
+-0.32367233333333334 0.94016166666666656 0.10338779999999999 -0.3311736036703527 0.93644996227835042 0.11569577512108319
+-0.97937533333333338 0.18860866666666665 0.067428199999999994 -0.97923504472179479 0.18851326331064888 0.074575309216083394
+-0.36871933333333334 0.91232100000000005 0.17627566666666664 -0.37532063667939408 0.91014157955069441 0.1754329639934904
+-0.5360043333333333 0.80893300000000001 0.240173 -0.53261569555775756 0.81292932223895054 0.23551313740351429
+-0.60889233333333337 0.76388599999999995 0.21233233333333335 -0.6108394290685476 0.76458305805533811 0.205640315186391
+-0.93079100000000004 0.24733633333333335 0.26791033333333336 -0.92927996516300448 0.24659535849110747 0.27500813718377004
+-0.95948299999999997 0.17222033333333334 0.22148599999999999 -0.96008295290377987 0.16594163099918297 0.22517570616052096
+-0.80893300000000001 0.240173 0.5360043333333333 -0.81292932223895054 0.23551313740351432 0.53261569555775756
+-0.76388599999999995 0.21233233333333335 0.60889233333333337 -0.76458305805533711 0.20564031518639039 0.61083942906854904
+-0.71214633333333344 0.32508266666666669 0.62168500000000004 -0.71348946815858938 0.31835411031696542 0.62416619523254113
+-0.75857066666666662 0.35377466666666663 0.54656866666666659 -0.76333618881165943 0.34915056243740034 0.54351793677866567
+-0.79390499999999997 0.60570833333333329 -0.046424566666666667 -0.79011515187319126 0.61092791490957399 -0.049851073856478557
+-0.79390499999999997 0.60570833333333329 0.046424566666666667 -0.79011515187319092 0.61092791490957432 0.04985107385648023
+-0.60889233333333337 0.76388599999999995 -0.21233233333333335 -0.6108394290685476 0.76458305805533811 -0.205640315186391
+-0.5360043333333333 0.80893300000000001 -0.240173 -0.53261569555775667 0.81292932223895165 -0.2355131374035126
+-0.54656866666666659 0.75857066666666662 -0.35377466666666663 -0.55359415410163071 0.75489485576016901 -0.35166357401831322
+-0.62168500000000004 0.71214633333333344 -0.32508266666666669 -0.62416619523254091 0.7134894681585896 -0.31835411031696542
+-0.36871933333333334 0.91232100000000005 -0.17627566666666664 -0.37816637595496666 0.9101077339310748 -0.16939334324562666
+-0.32367233333333334 0.94016166666666656 -0.10338779999999999 -0.33117360367035303 0.9364499622783502 -0.11569577512108313
+-0.91232100000000005 0.17627566666666664 -0.36871933333333334 -0.91226504142130083 0.18997715828638431 -0.36287900673643603
+-0.94016166666666656 0.10338779999999999 0.32367233333333334 -0.94001455110956655 0.097221136438832331 0.32698729995493991
+-0.91232100000000005 0.17627566666666664 0.36871933333333334 -0.91014157955069441 0.1754329639934904 0.37532063667939408
+-0.52859633333333333 0.75163733333333338 0.39362766666666671 -0.52558986975230082 0.75661146373700161 0.38896578481340915
+-0.56844033333333321 0.69010933333333335 0.44713033333333335 -0.56573110516150704 0.69560424707062685 0.44281265576996143
+-0.43270133333333333 0.60621733333333339 0.66676166666666659 -0.43959342241024213 0.60343563223279073 0.66529922645788675
+-0.8741593333333334 0.448237 -0.18500266666666665 -0.87226383732852786 0.4540904957276336 -0.18154233605069528
+-0.96824666666666659 0.1734623333333333 0.17811533333333332 -0.96901160014443299 0.16710050047550851 0.18191740303324516
+-0.88711800000000007 0.41159166666666663 -0.20715033333333333 -0.8892894466046567 0.40591117468182031 -0.21071402047801255
+-0.9575326666666667 0.25299433333333332 0.13573933333333332 -0.95898012037253266 0.24673191513420487 0.13957252876010487
+-0.88726233333333349 0.37065766666666672 -0.27328033333333329 -0.88896961193760038 0.36493619269398281 -0.2766850272666237
+-0.9575326666666667 0.25299433333333332 -0.13573933333333332 -0.95898012037253266 0.24673191513420484 -0.13957252876010484
+-0.89832000000000001 0.37411466666666665 -0.22882 -0.90018936382514625 0.36834417313747281 -0.23233957771277344
+-0.96824666666666681 0.1734623333333333 -0.17811533333333332 -0.96901160014443299 0.16710050047550642 -0.18191740303324644
+-0.90979499999999991 0.098831166666666651 0.40237200000000001 -0.90779782046843382 0.10529195624222863 0.40597625682229971
+-0.75163733333333338 0.39362766666666671 0.52859633333333333 -0.75661146373700161 0.38896578481340915 0.52558986975230071
+-0.92208600000000007 0.062795833333333342 0.38106733333333337 -0.92045209254229532 0.069331913553990904 0.3846570304796883
+-0.69010933333333335 0.44713033333333335 0.56844033333333321 -0.69560424707062685 0.44281265576996143 0.56573110516150704
+-0.94615333333333329 0.025922166666666666 0.32170033333333331 -0.94504816080489829 0.032492402180593086 0.32531249216686087
+-0.60621733333333339 0.66676166666666659 0.43270133333333333 -0.60933963695998472 0.66864974072821837 0.42616045224018656
+-0.93196800000000002 0.0254641 0.36080433333333334 -0.93072619151734903 0.031991211980968173 0.36431486214482056
+-0.64155600000000002 0.68182433333333325 0.35048066666666666 -0.64417761721265054 0.68331502799398403 0.34367974918492489
+-0.42672700000000002 0.74024633333333334 0.51888433333333328 -0.43031481624311191 0.74257141516746727 0.51324151458922507
+-0.81501833333333329 0.57461866666666672 0.069812933333333341 -0.81127669562692939 0.58004985260737885 0.073295918186543962
+-0.40621499999999999 0.77051866666666669 0.49050400000000005 -0.41370749673404611 0.76793922060792985 0.4889943359571095
+-0.8592116666666666 0.51040266666666667 0.023347500000000004 -0.85606910857888263 0.51615839539286479 0.026947953585021549
+-0.94310333333333329 0.29077133333333333 0.15908700000000001 -0.94232903316217553 0.29032128949182034 0.16652189684076446
+-0.38479733333333338 0.79909666666666668 0.46117466666666668 -0.39236710167654804 0.79667676969368395 0.45973272904197526
+-0.92509966666666665 0.28642166666666663 0.24792833333333333 -0.92371401298963163 0.28569149297949875 0.25521127139242045
+-0.44713033333333335 0.56844033333333321 0.69010933333333335 -0.4517678401305939 0.57156411753670577 0.68499655339879262
+-0.66676166666666659 0.43270133333333333 0.60621733333333339 -0.66864974072821837 0.42616045224018656 0.60933963695998472
+-0.68182433333333325 0.35048066666666666 0.64155600000000002 -0.68331502799398403 0.34367974918492483 0.64417761721265043
+-0.92509966666666665 0.28642166666666663 -0.24792833333333333 -0.92371401298963063 0.28569149297950008 -0.25521127139242233
+-0.94310333333333352 0.29077133333333333 -0.15908700000000001 -0.9423290331621752 0.29032128949181979 -0.1665218968407669
+-0.8592116666666666 0.51040266666666667 -0.023347500000000004 -0.85606910857888263 0.51615839539286479 -0.026947953585021542
+-0.81501833333333329 0.57461866666666672 -0.069812933333333341 -0.81127669562693017 0.58004985260737785 -0.073295918186543282
+-0.64155600000000002 0.68182433333333325 -0.35048066666666666 -0.64417761721264988 0.68331502799398358 -0.34367974918492672
+-0.60621733333333327 0.66676166666666659 -0.43270133333333333 -0.60010626624401753 0.67813792847666066 -0.42426574122364386
+-0.95071200000000011 0.2652113333333333 -0.15845133333333333 -0.94995293871590447 0.26481784541564529 -0.16571337596715754
+-0.44483566666666663 0.69255433333333338 0.56726066666666652 -0.44132178373940228 0.69047027427160068 0.57313688028635257
+-0.96912566666666666 0.22787766666666665 -0.090339766666666654 -0.96827388382743562 0.23444795137290286 -0.086486091337178675
+-0.530864 0.46733033333333335 0.70645666666666662 -0.52516150273427764 0.47097737860154382 0.70879172179949557
+-0.81060299999999996 0.57337433333333332 0.11609513333333334 -0.81516384919802187 0.56816097492600415 0.11269873793347107
+-0.76528366666666681 0.17033933333333337 0.62024233333333345 -0.76955908667167139 0.17342408363417988 0.61457538132983147
+-0.78491366666666673 0.60333300000000001 0.13862866666666665 -0.78977294646896079 0.5982768684989791 0.13536425541771033
+-0.81039466666666671 0.11985033333333334 0.57299266666666671 -0.81426104685283174 0.12297498202123427 0.56732363019268606
+-0.67640700000000009 0.6563119999999999 -0.33322933333333332 -0.67432926819011041 0.65519559013053941 -0.34058593149994354
+-0.40879966666666667 0.89596266666666668 0.17178266666666667 -0.4047855585152268 0.89921363051880443 0.16602258372494677
+-0.69105033333333343 0.66134433333333331 -0.29050300000000001 -0.68928038046168461 0.66038496798852575 -0.29796686252902188
+-0.43996133333333337 0.89261233333333323 0.095399433333333339 -0.43580085237525801 0.89554756027352977 0.089845335756103872
+-0.67133866666666664 0.72445833333333332 -0.15433566666666665 -0.66617006348422581 0.728967499909568 -0.15755580152129087
+-0.63388266666666671 0.77276233333333322 0.0213279 -0.63476764166231714 0.7725789567217396 0.013849069615263583
+-0.63904300000000003 0.74907166666666669 -0.17287133333333335 -0.64073927206007164 0.7496386400507864 -0.16581644846859134
+-0.68441399999999997 0.72562366666666678 0.066507233333333332 -0.68541061871691356 0.72577596020978963 0.058834847936028105
+-0.32170033333333337 0.94615333333333329 -0.025922166666666666 -0.3348955198491228 0.94191163998673666 -0.025445102524491871
+-0.83572600000000008 0.51622199999999996 -0.18541133333333334 -0.83343328548439544 0.52181054957140371 -0.18194149884695324
+-0.88145000000000007 0.45051700000000006 -0.13919633333333334 -0.87937670074054175 0.45639309314145032 -0.13565383417898386
+-0.88145000000000007 0.450517 0.13919633333333334 -0.87937670074054197 0.45639309314144993 0.13565383417898408
+-0.83572600000000008 0.51622200000000007 0.18541133333333334 -0.83343328548439399 0.52181054957140682 0.18194149884695118
+-0.51263133333333333 0.83179066666666657 -0.21144266666666667 -0.51937906437705672 0.82838944494361133 -0.20980065536796771
+-0.53848333333333331 0.83172233333333334 -0.13303166666666669 -0.54492004699198227 0.82810678224403889 -0.13153440457796517
+-0.41863333333333336 0.90579366666666672 0.060890133333333339 -0.42194873846513697 0.90410814445318599 0.067436824073323215
+-0.34229266666666663 0.93706633333333345 0.064171566666666666 -0.35165294100359623 0.93435161769751562 0.057682437444657918
+-0.34229266666666663 0.93706633333333345 -0.064171566666666666 -0.35165294100359606 0.93435161769751574 -0.057682437444657626
+-0.41863333333333336 0.90579366666666672 -0.060890133333333339 -0.42194873846513786 0.90410814445318555 -0.06743682407332359
+-0.53848333333333331 0.83172233333333334 0.13303166666666666 -0.54492004699198604 0.82810678224403678 0.13153440457796253
+-0.51263133333333333 0.83179066666666668 0.21144266666666667 -0.51937906437705927 0.82838944494361066 0.20980065536796388
+-0.72738566666666671 0.5831803333333333 0.3607103333333333 -0.72515901134339633 0.58873065737464669 0.35712829814323638
+-0.69255433333333338 0.56726066666666652 0.44483566666666663 -0.69047027427160068 0.57313688028635257 0.44132178373940228
+-0.46733033333333335 0.70645666666666662 0.530864 -0.47097737860154382 0.70879172179949557 0.52516150273427764
+-0.42738333333333339 0.76859166666666656 0.47530133333333335 -0.43077019257902827 0.77066937243953504 0.4695804079910918
+-0.957121 0.22573400000000002 0.17963466666666669 -0.95821518598554145 0.21958206357096252 0.18332314285057411
+-0.91984566666666667 0.38031999999999999 0.092365500000000003 -0.92226052033247408 0.37443368855343678 0.096098623883706893
+-0.83172233333333334 0.13303166666666666 0.53848333333333331 -0.82810678224403689 0.13153440457796253 0.54492004699198604
+-0.83179066666666668 0.21144266666666667 0.51263133333333333 -0.828389444943611 0.20980065536796402 0.51937906437705861
+-0.5831803333333333 0.3607103333333333 0.72738566666666671 -0.58830324750178309 0.36394911437863414 0.72210825443410054
+-0.56726066666666652 0.44483566666666663 0.69255433333333338 -0.57313688028635257 0.44132178373940228 0.69047027427160068
+-0.70645666666666662 0.530864 0.46733033333333335 -0.70879172179949557 0.52516150273427764 0.47097737860154382
+-0.76859166666666656 0.47530133333333335 0.42738333333333339 -0.77066937243953504 0.4695804079910918 0.43077019257902827
+-0.89596266666666668 0.17178266666666667 0.40879966666666667 -0.89921363051880443 0.16602258372494677 0.4047855585152268
+-0.89261233333333323 0.095399433333333339 0.43996133333333337 -0.89554756027352977 0.089845335756103872 0.43580085237525801
+-0.76859166666666656 0.47530133333333335 -0.42738333333333339 -0.77066937243953615 0.46958040799109052 -0.43077019257902743
+-0.70645666666666662 0.530864 -0.46733033333333335 -0.71299010291467446 0.53421515880298542 -0.45415776691676535
+-0.62024233333333345 0.76528366666666681 0.17033933333333337 -0.61457538132983391 0.76955908667166983 0.1734240836341788
+-0.57299266666666671 0.81039466666666671 0.11985033333333334 -0.56732363019268606 0.81426104685283163 0.12297498202123427
+-0.57299266666666659 0.81039466666666671 -0.11985033333333332 -0.56732363019269194 0.81426104685282774 -0.12297498202123396
+-0.62024233333333334 0.76528366666666658 -0.17033933333333331 -0.61457538132983835 0.76955908667166673 -0.17342408363417691
+-0.69255433333333338 0.56726066666666652 -0.44483566666666663 -0.70358514576365794 0.55884114687399777 -0.4389356618244718
+-0.72738566666666671 0.5831803333333333 -0.3607103333333333 -0.72515901134339766 0.58873065737464292 -0.35712829814324015
+-0.68441399999999997 0.72562366666666678 -0.066507233333333332 -0.68541061871691122 0.72577596020979185 -0.05883484793602782
+-0.63388266666666659 0.77276233333333322 -0.0213279 -0.63476764166231425 0.77257895672174193 -0.013849069615265221
+-0.43996133333333337 0.89261233333333323 -0.095399433333333339 -0.43580085237525779 0.89554756027353 -0.089845335756103428
+-0.40879966666666667 0.89596266666666668 -0.17178266666666667 -0.40478555851522569 0.89921363051880498 -0.16602258372494683
+-0.99152333333333331 0.1083407 -0.066672933333333337 -0.99138998769079067 0.10827560874102048 -0.073636165423080657
+-0.98138033333333341 0.18889533333333333 -0.022494500000000001 -0.98154734302435331 0.18890534802977815 -0.02965776268670366
+-0.89535266666666669 0.41411966666666666 -0.16169066666666668 -0.89770291975186667 0.4084110330386006 -0.16531756095864961
+-0.87693233333333342 0.40834266666666669 -0.2520843333333333 -0.87894504702395804 0.40265962781541953 -0.25557939752570047
+-0.90579366666666672 0.060890133333333339 0.41863333333333336 -0.90410814445318599 0.067436824073323215 0.42194873846513697
+-0.93706633333333345 0.064171566666666666 0.34229266666666663 -0.93557127087762915 0.070833179066782742 0.34596106406893684
+-0.87693233333333342 0.40834266666666669 0.25208433333333335 -0.87894504702395693 0.40265962781542119 0.25557939752570163
+-0.89535266666666669 0.41411966666666666 0.16169066666666668 -0.89770291975186667 0.40841103303860016 0.16531756095865036
+-0.98138033333333341 0.18889533333333333 0.022494500000000001 -0.98154734302435265 0.18890534802978196 0.029657762686698959
+-0.99152333333333331 0.1083407 0.066672933333333337 -0.99138998769079067 0.10827560874102046 0.073636165423080657
+-0.33699166666666663 0.88216099999999997 0.32794299999999998 -0.34739504234236873 0.88112360434592474 0.32083933427868566
+-0.38305933333333336 0.83560033333333339 0.39287366666666662 -0.39050299487623924 0.83320247888691223 0.39151122610902539
+-0.448243 0.75252933333333327 0.48174699999999998 -0.45166981585712235 0.75464015189833467 0.47593341822827639
+-0.65384799999999998 0.26978799999999997 0.70640999999999998 -0.65882563641033198 0.27298298335787707 0.70102002225724913
+-0.93204233333333331 0.34265900000000005 0.11477476666666668 -0.93314089294629388 0.34314701905525424 0.1072296471358853
+-0.99082366666666655 0.0135059 0.13190333333333334 -0.99024265399362199 0.013486538246426618 0.13869967374797831
+-0.98819733333333326 0.13523933333333332 0.066924399999999995 -0.98805584750948217 0.13516985978345639 0.073991561738076916
+-0.99792933333333345 0.054364866666666671 0.022089066666666667 -0.99809991255386388 0.054369697504552846 0.028991387569981084
+-0.31066633333333332 0.91822966666666661 0.24427766666666664 -0.31708091584157094 0.91986749040706861 0.23087549220580375
+-0.88216099999999997 0.32794299999999998 0.33699166666666663 -0.88471295825504714 0.32939739480348468 0.32981864379122122
+-0.33417800000000003 0.89978666666666662 0.27934999999999999 -0.33808910550904386 0.89668911896521064 0.28573480828469072
+-0.83560033333333339 0.39287366666666662 0.38305933333333336 -0.83724221359370155 0.38707866519608619 0.38625844033073886
+-0.75252933333333327 0.48174699999999998 0.448243 -0.75464015189833467 0.47593341822827639 0.45166981585712235
+-0.78698500000000005 0.49789366666666668 0.36340366666666668 -0.78925240999627411 0.49239401663173693 0.36691792774452714
+-0.70640999999999998 0.65384799999999998 0.26978799999999997 -0.70479467267294227 0.65296399002290029 0.27731299483654515
+-0.76758566666666661 0.59795000000000009 0.22930300000000003 -0.76500174879047633 0.60316909560327592 0.22574181370902247
+-0.84640700000000002 0.50645033333333334 0.16249633333333333 -0.84406979811615768 0.5121238262359693 0.15898227105428958
+-0.82769799999999993 0.50003500000000001 0.25335033333333334 -0.82570502810573576 0.50570450234366338 0.24994832039894552
+-0.81505266666666676 0.36941800000000002 -0.44557533333333338 -0.82130042010977755 0.37231878741567836 -0.43225494845614176
+-0.8491063333333333 0.3845263333333333 -0.36120633333333335 -0.85072491442126907 0.37874348378578099 -0.36444546021693586
+-0.88776866666666665 0.39816433333333334 -0.22942100000000001 -0.88979840505496688 0.39240147024361355 -0.23298043804639001
+-0.84134999999999993 0.46429433333333331 -0.27543933333333337 -0.84362348998201264 0.45879542369625348 -0.27893756711125228
+-0.7735186666666668 0.61237266666666668 -0.16120433333333331 -0.77853690347198579 0.60738391140291692 -0.15800339901769681
+-0.75407966666666659 0.60629733333333335 -0.25115599999999999 -0.75151765294156647 0.61150609282538182 -0.2475510366664517
+-0.71116800000000013 0.59003299999999992 -0.38131833333333337 -0.70890793280855779 0.59565965362480766 -0.37767594554680267
+-0.77333333333333332 0.53363466666666659 -0.34131466666666666 -0.77133226789601028 0.53930071204673635 -0.33793679066991283
+-0.98179066666666659 0.067108333333333339 -0.17578733333333332 -0.98236697934278339 0.073740260498037474 -0.17180655365444233
+-0.99082366666666655 -0.0135059 -0.13190333333333334 -0.99178517435877034 -0.0067661867722486049 -0.12773561225714034
+-0.99792933333333345 -0.054364866666666671 -0.022089066666666667 -0.9982313602512044 -0.055201045773037596 -0.022067984878397
+-0.87240766666666669 0.3519316666666667 -0.33817800000000003 -0.87385423840641729 0.34611912009617785 -0.34143861047483776
+-0.88460299999999992 0.27425666666666665 -0.37628966666666663 -0.88227808718678835 0.27306946667847437 -0.38342984135035107
+-0.92261566666666672 0.16568633333333335 -0.34739533333333333 -0.92529999561685483 0.17297997398064335 -0.33748755045646417
+-0.42532333333333333 0.8185486666666667 0.38521833333333327 -0.42839710847502843 0.82010513309657784 0.37934613233678682
+-0.46225066666666664 0.83147599999999999 0.30709066666666668 -0.4587511241532331 0.83572586903813284 0.30184379720080817
+-0.50945999999999991 0.83918366666666666 0.18871566666666664 -0.51617476502425097 0.83580172950210074 0.18708041296046063
+-0.55621733333333334 0.7935566666666668 0.24544933333333332 -0.55288852066134253 0.79769549250502214 0.24082397089592744
+-0.69375566666666666 0.69718433333333341 -0.17881733333333336 -0.69272430128514695 0.69666909427137036 -0.18650795022227129
+-0.75307866666666679 0.64288299999999998 -0.13748199999999999 -0.74853514111358521 0.64796557746314287 -0.14083945803971601
+-0.82948300000000008 0.55351399999999995 -0.069904266666666673 -0.82591243697637506 0.55900058124443752 -0.073396162134857681
+-0.78704799999999997 0.61590633333333333 -0.02318863333333333 -0.78338299412773948 0.62097108768282216 -0.026570524523818553
+-0.42712433333333338 0.89007000000000003 -0.15726633333333331 -0.42314614003084272 0.89330010217195965 -0.15153307109857209
+-0.34739533333333333 0.92261566666666672 -0.16568633333333335 -0.3534082431497419 0.92298813249420142 -0.15230075820126199
+-0.43906033333333339 0.8545950000000001 0.27610266666666666 -0.4428134935284937 0.85112219891836305 0.28197023328263054
+-0.35613033333333338 0.88821033333333332 0.289103 -0.36331126550021559 0.88604481153509118 0.28797485361117314
+-0.36137766666666665 0.93070366666666671 0.050886266666666659 -0.36502863962319798 0.92921846382396145 0.057507727684847861
+-0.32475833333333332 0.93660599999999994 0.12905900000000001 -0.32867094192977053 0.93463255466382789 0.13578438678126564
+-0.706986 0.68900766666666657 0.15741033333333332 -0.71253214023460698 0.6844258919168752 0.15446406574501442
+-0.68642633333333336 0.68407633333333318 0.24532733333333331 -0.68844469340977232 0.68510252344690936 0.23807233455948076
+-0.64234066666666667 0.66917433333333332 0.37270666666666669 -0.64507244158114729 0.67076762158679903 0.36599500398683876
+-0.60260966666666671 0.72989533333333334 0.32161633333333334 -0.60506997784072791 0.73117473379442421 0.31507749931798351
+-0.98626099999999994 0.053858766666666669 0.15395899999999998 -0.98553329470949724 0.053751240861339394 0.16073247688289261
+-0.96906700000000001 0.053126699999999999 0.23962399999999998 -0.96880100156939641 0.046540654298456517 0.24343086668622338
+-0.93070366666666671 0.050886266666666659 0.36137766666666665 -0.92921846382396134 0.057507727684847416 0.3650286396231982
+-0.93660599999999994 0.12905900000000001 0.32475833333333332 -0.93661097008373928 0.1228748323020797 0.32811837239863972
+-0.68407633333333318 0.24532733333333331 0.68642633333333336 -0.68890344475793097 0.24846438758447367 0.6809386843930435
+-0.66917433333333332 0.37270666666666669 0.64234066666666667 -0.67076762158679903 0.36599500398683876 0.64507244158114729
+-0.72989533333333334 0.32161633333333334 0.60260966666666671 -0.73117473379442421 0.31507749931798351 0.60506997784072791
+-0.8185486666666667 0.38521833333333327 0.42532333333333333 -0.82010513309657784 0.37934613233678677 0.42839710847502843
+-0.83147599999999999 0.30709066666666668 0.46225066666666664 -0.83572586903813284 0.30184379720080817 0.4587511241532331
+-0.83918366666666666 0.18871566666666664 0.50945999999999991 -0.83580172950210108 0.1870804129604608 0.51617476502425041
+-0.7935566666666668 0.24544933333333332 0.55621733333333334 -0.79769549250502214 0.24082397089592744 0.55288852066134253
+-0.86782533333333334 0.26792600000000005 -0.41765333333333327 -0.87489911065577086 0.25764841568228636 -0.41008394271191495
+-0.77725566666666668 0.60104266666666673 0.18421899999999999 -0.77452027865281281 0.6061889964652234 0.18070207115596243
+-0.73650733333333329 0.66197633333333339 0.13666566666666666 -0.73182174996875138 0.66695967107811682 0.14000615496486118
+-0.66672633333333342 0.74198800000000009 0.065746466666666656 -0.66770622348079367 0.74215319872214924 0.058112208282758662
+-0.72190399999999999 0.69115666666666664 0.022636933333333335 -0.71778099415599816 0.69578410488358966 0.025979295982935562
+-0.41765333333333327 0.86782533333333334 -0.26792600000000005 -0.42334462759604402 0.86943171170077949 -0.25469162721734612
+-0.46397566666666673 0.82155833333333328 -0.33029600000000003 -0.46971916764604105 0.82386469499442905 -0.31719216239946213
+-0.56508966666666671 0.75308399999999998 -0.3359476666666667 -0.56209129792291423 0.75773911645994829 -0.33148876932081817
+-0.72339666666666658 0.6343293333333333 -0.27136433333333337 -0.72077251091362049 0.63941435217610454 -0.26764953529286678
+-0.68338033333333337 0.69481033333333331 -0.22262666666666664 -0.68528096861268695 0.69572320105804475 -0.21531191691777071
+-0.61583966666666667 0.77343700000000004 -0.14808233333333334 -0.61020748195836316 0.77769021399991123 -0.15114483124078729
+-0.59284466666666669 0.77091966666666656 -0.231459 -0.59490829083334729 0.77172429004474452 -0.22477932656870506
+-0.96511000000000002 0.013230166666666666 0.26024266666666662 -0.96639424395002105 0.019804902525625792 0.25630047033943903
+-0.92297966666666653 0.38112833333333329 0.046245866666666663 -0.92558692684680421 0.37521515029816055 0.050024312459218692
+-0.97317900000000002 0.066652000000000003 -0.21864833333333333 -0.97308297863106963 0.060095725620956525 -0.22248150588436777
+-0.96942466666666671 0.18714233333333333 -0.15652599999999997 -0.97035780623413459 0.18083800786474347 -0.1603226209615741
+-0.95185399999999998 0.18443866666666667 -0.24347300000000002 -0.95246277304167848 0.17830859445972211 -0.24702370556599276
+-0.8545950000000001 0.27610266666666666 0.43906033333333339 -0.85112219891836305 0.28197023328263054 0.4428134935284937
+-0.88821033333333332 0.289103 0.35613033333333338 -0.88604481153509118 0.28797485361117314 0.36331126550021559
+-0.92622133333333334 0.30024966666666669 0.22642999999999999 -0.92499859936706652 0.29958638636084534 0.23372117635382444
+-0.93752266666666673 0.22195833333333334 0.26666133333333336 -0.93604786651851102 0.22128896037937598 0.27357921631651538
+-0.9754856666666667 0.013347533333333333 0.21812066666666666 -0.97432715951755866 0.013302101343303454 0.2247434989633699
+-0.61909166666666671 0.58682400000000001 0.52120766666666662 -0.61690317697310926 0.59298236445217278 0.51749626635290347
+-0.97022466666666674 -0.026577699999999999 0.23935300000000001 -0.9686335278347431 -0.026915953275993328 0.2470316178420576
+-0.54404466666666662 0.63320566666666667 0.54987266666666679 -0.5478502093490385 0.63565620846605242 0.54387621087410787
+-0.4233276666666666 0.69372299999999998 0.58210099999999987 -0.43057847532739385 0.69102569647357381 0.58059078824758248
+-0.92402866666666661 0.38139066666666666 0 -0.92180623590250022 0.38763288722182038 -0.003742752374870731
+-0.46822133333333332 0.72146866666666665 0.50946199999999997 -0.47178022136037795 0.72371471387138386 0.50364713407227257
+-0.92666433333333342 0.3685053333333333 0.069218666666666664 -0.92911799838312503 0.36249943800450635 0.073033571232359887
+-0.95533000000000001 0.2934586666666667 0.022837133333333332 -0.95549324395593516 0.29344660324575023 0.030360365579072277
+-0.98309933333333321 0.17549666666666663 -0.044893366666666663 -0.98310986548934121 0.17545399672639003 -0.05206618298152426
+-0.98309933333333321 0.17549666666666663 0.044893366666666663 -0.98310986548934154 0.17545399672638801 0.052066182981523088
+-0.9690669999999999 0.053126699999999992 -0.23962399999999998 -0.97155742118613653 0.059919872423214671 -0.22909776565241713
+-0.98626099999999994 0.053858766666666669 -0.15395899999999998 -0.98553329470949724 0.053751240861341337 -0.16073247688289144
+-0.99792933333333345 0.054364866666666657 -0.022089066666666667 -0.9980999125538641 0.054369697504548758 -0.028991387569981035
+-0.98819733333333326 0.13523933333333332 -0.066924399999999995 -0.98805584750948228 0.13516985978345439 -0.073991561738078152
+-0.58682400000000001 0.52120766666666662 0.61909166666666671 -0.59298236445217278 0.51749626635290347 0.61690317697310926
+-0.63320566666666667 0.54987266666666679 0.54404466666666662 -0.63565620846605242 0.54387621087410787 0.5478502093490385
+-0.69372299999999998 0.58210099999999987 0.4233276666666666 -0.69153626177537608 0.58789561778403399 0.41970982981110611
+-0.72146866666666665 0.50946199999999997 0.46822133333333332 -0.72371471387138386 0.50364713407227257 0.47178022136037795
+-0.68338033333333337 0.69481033333333331 0.22262666666666667 -0.68528096861268906 0.69572320105804253 0.21531191691777093
+-0.72339666666666658 0.63432933333333341 0.27136433333333332 -0.72077251091361894 0.63941435217610787 0.26764953529286273
+-0.77333333333333332 0.53363466666666659 0.34131466666666666 -0.77133226789600973 0.53930071204673902 0.33793679066991
+-0.71116800000000013 0.59003300000000003 0.38131833333333337 -0.70890793280855735 0.59565965362480866 0.37767594554680212
+-0.37628966666666663 0.88460299999999992 0.27425666666666665 -0.38342984135034897 0.88227808718678913 0.27306946667847509
+-0.33817800000000003 0.87240766666666669 0.3519316666666667 -0.34473359131040449 0.87539952177230762 0.33887228907517075
+-0.91254999999999997 0.40545666666666663 -0.046381466666666669 -0.91035533692556203 0.41162135449004122 -0.042673423332679219
+-0.91254999999999997 0.40545666666666663 0.046381466666666669 -0.91035533692556214 0.41162135449004122 0.042673423332679233
+-0.89696566666666666 0.40099866666666667 0.18426133333333336 -0.89916619954909283 0.39521794737259502 0.18789071201907198
+-0.86921966666666661 0.473638 0.13936799999999999 -0.8669867281394934 0.47946617526273372 0.13581678839120653
+-0.88460299999999992 0.27425666666666665 0.37628966666666663 -0.88227808718678913 0.27306946667847509 0.38342984135034897
+-0.87240766666666669 0.3519316666666667 0.33817800000000003 -0.87385423840641674 0.34611912009617762 0.34143861047483937
+-0.84134999999999993 0.46429433333333331 0.27543933333333331 -0.84362348998201164 0.45879542369625476 0.27893756711125273
+-0.88776866666666676 0.39816433333333334 0.22942099999999999 -0.88979840505496699 0.39240147024361327 0.23298043804638979
+-0.52120766666666662 0.61909166666666671 0.58682400000000001 -0.51749626635290347 0.61690317697310926 0.59298236445217278
+-0.54987266666666679 0.54404466666666662 0.63320566666666667 -0.54387621087411042 0.54785020934903716 0.63565620846605164
+-0.58210099999999987 0.4233276666666666 0.69372299999999998 -0.58789561778403399 0.41970982981110611 0.69153626177537608
+-0.50946199999999997 0.46822133333333332 0.72146866666666665 -0.51444356399800606 0.47146469876576047 0.71628825013310127
+-0.69481033333333331 0.22262666666666667 0.68338033333333337 -0.69958676724384505 0.22576650097074502 0.67794383405761049
+-0.63432933333333341 0.27136433333333332 0.72339666666666658 -0.64329553737755441 0.27792264981404191 0.71339319614814445
+-0.59003300000000003 0.38131833333333337 0.71116800000000013 -0.59565965362480855 0.37767594554680212 0.70890793280855735
+-0.95533000000000001 0.2934586666666667 -0.022837133333333332 -0.95549324395593505 0.29344660324575045 -0.030360365579072079
+-0.9266643333333332 0.3685053333333333 -0.069218666666666664 -0.92911799838312392 0.36249943800450973 -0.073033571232358319
+-0.86921966666666661 0.473638 -0.13936800000000002 -0.86698672813949351 0.479466175262734 -0.13581678839120431
+-0.89696566666666666 0.40099866666666673 -0.18426133333333336 -0.89916619954909283 0.39521794737259475 -0.18789071201907209
+-0.7365073333333334 0.66197633333333339 -0.13666566666666666 -0.7318217499687496 0.66695967107811915 -0.14000615496485952
+-0.77725566666666668 0.60104266666666673 -0.18421899999999999 -0.77452027865281448 0.60618899646522062 -0.18070207115596457
+-0.82769799999999993 0.50003500000000001 -0.25335033333333329 -0.82570502810573598 0.50570450234366304 -0.24994832039894563
+-0.84640700000000002 0.50645033333333334 -0.16249633333333333 -0.84406979811615801 0.51212382623596819 -0.15898227105429136
+-0.46225066666666664 0.83147599999999999 -0.30709066666666668 -0.46936902125113544 0.82849236639082535 -0.30543922590571398
+-0.72146866666666665 0.50946199999999997 -0.46822133333333332 -0.71722232079543291 0.52228627623649215 -0.4613124626625989
+-0.69372299999999998 0.58210099999999987 -0.4233276666666666 -0.69968377873390342 0.57754182821501188 -0.4205806063511579
+-0.81854866666666659 0.38521833333333327 -0.42532333333333333 -0.82170604611030551 0.38720105801141941 -0.41818000246377873
+-0.78698499999999993 0.49789366666666668 -0.36340366666666668 -0.78925240999627422 0.49239401663173787 -0.36691792774452564
+-0.75252933333333338 0.48174699999999998 -0.448243 -0.75580479793942767 0.48384356982241633 -0.44119667649840871
+-0.9690669999999999 -0.053126699999999992 0.23962399999999998 -0.96942691840980122 -0.053878969775750629 0.23939195157394144
+-0.98626099999999994 -0.053858766666666669 0.15395899999999998 -0.98659498098831921 -0.054652534041547601 0.15376424815767611
+-0.99792933333333345 -0.054364866666666657 0.022089066666666667 -0.9982313602512044 -0.055201045773037569 0.022067984878397
+-0.559728 0.5970939999999999 0.57400033333333333 -0.55994620037192888 0.59735900477779025 0.57412757476011167
+-0.56423166666666669 0.63009233333333325 0.53283766666666665 -0.56704658136215702 0.62444740471079663 0.53714394096502771
+-0.53625699999999998 0.58218099999999995 0.61056333333333335 -0.5365278179115468 0.58231563453184998 0.61077524703187092
+-0.51848166666666662 0.60181733333333343 0.60686300000000004 -0.52511565719112763 0.59853198481846182 0.6049900905981872
+-0.524752 0.52701999999999993 0.66796766666666674 -0.51874676577863232 0.53067049118758136 0.67029144614633118
+-0.442803 0.54917199999999999 0.7082613333333333 -0.45630557666652244 0.54261329906249511 0.70523473282556615
+-0.51180999999999999 0.56587633333333331 0.64585599999999999 -0.50559691531690243 0.56946362135064565 0.64813805873458907
+-0.41395699999999996 0.62469333333333332 0.66158633333333328 -0.42253729274034357 0.63102572869157736 0.65059108968147195
+-0.93660599999999994 0.12905900000000001 -0.32475833333333332 -0.93265246963949344 0.14159484160179467 -0.33182867824694795
+-0.99082366666666666 0.0135059 -0.13190333333333334 -0.99024265399362199 0.01348653824642662 -0.13869967374797831
+-0.86274066666666671 0.041936266666666666 0.50345533333333337 -0.86568807684060856 0.037305954185398463 0.49919176615637961
+-0.82571500000000009 0.019053333333333332 0.56336366666666671 -0.82872041913392602 0.028888500372300327 0.55891673928835739
+-0.484402 0.87451599999999996 -0.011107333333333332 -0.48691759602847123 0.8732734946888302 -0.017454459367512616
+-0.52142733333333335 0.85163333333333335 0.048800966666666667 -0.52744699324391919 0.84822554935274741 0.048094560432330069
+-0.59213633333333338 0.79599699999999995 0.12320566666666666 -0.58650905296908507 0.80003949953512854 0.12626927563302187
+-0.52259766666666663 0.83897433333333327 0.14976733333333334 -0.52914679883788596 0.83549373783461456 0.14816841538857795
+-0.90789966666666666 0.41769333333333331 -0.023229066666666669 -0.9053476049192074 0.42381623217034836 -0.026935397082356281
+-0.85168633333333332 0.52129700000000001 0.046674766666666666 -0.84841767537666091 0.52693800205961572 0.05023733764724303
+-0.85168633333333332 0.52129700000000001 -0.046674766666666666 -0.84841767537666168 0.52693800205961483 -0.050237337647241621
+-0.7540796666666667 0.60629733333333335 0.25115600000000005 -0.75151765294156436 0.61150609282538471 0.24755103666645098
+-0.77351866666666658 0.61237266666666668 0.16120433333333331 -0.77853690347198412 0.60738391140291847 0.15800339901769919
+-0.78704799999999997 0.61590633333333333 0.023188633333333333 -0.78338299412773749 0.62097108768282461 0.026570524523820194
+-0.82948300000000008 0.55351399999999995 0.069904266666666673 -0.82591243697637595 0.55900058124443597 0.073396162134858695
+-0.56336366666666671 0.82571499999999987 -0.019053333333333332 -0.56474952199137984 0.82517112931182202 -0.012271298250802436
+-0.50345533333333337 0.86274066666666671 -0.041936266666666666 -0.49919176615637934 0.86568807684060878 -0.037305954185397922
+-0.39939166666666664 0.91511966666666666 -0.049583866666666671 -0.40288215829790114 0.91352935046269079 -0.056125683679036524
+-0.44236933333333334 0.88855800000000007 -0.11912266666666665 -0.43833872652535383 0.89161673536432962 -0.11348461590183041
+-0.32475833333333332 0.93660599999999994 -0.12905900000000001 -0.33870737283028768 0.93207372228690832 -0.12851416969592108
+-0.36137766666666665 0.93070366666666671 -0.050886266666666673 -0.36502863962319804 0.92921846382396145 -0.057507727684847132
+-0.52142733333333335 0.85163333333333335 -0.048800966666666667 -0.52744699324391708 0.84822554935274896 -0.048094560432325448
+-0.484402 0.87451599999999996 0.011107333333333332 -0.48691759602847329 0.8732734946888292 0.017454459367511763
+-0.44236933333333334 0.88855800000000007 0.11912266666666667 -0.43833872652535377 0.89161673536432973 0.11348461590183041
+-0.39939166666666664 0.91511966666666666 0.049583866666666664 -0.40288215829790164 0.91352935046269046 0.056125683679036448
+-0.46397566666666662 0.82155833333333339 0.33029599999999998 -0.4605655564218808 0.82594164087883659 0.32511501672512499
+-0.41765333333333338 0.86782533333333334 0.26792600000000005 -0.41075562274117583 0.8709359943737891 0.26972265772576098
+-0.34739533333333333 0.92261566666666661 0.16568633333333335 -0.35408080159719629 0.92056554615304842 0.16488135484713429
+-0.42712433333333327 0.89007000000000003 0.15726633333333331 -0.42314614003084344 0.8933001021719591 0.15153307109857345
+-0.63009233333333325 0.53283766666666665 0.56423166666666669 -0.62444740471079663 0.53714394096502771 0.56704658136215702
+-0.60181733333333343 0.60686300000000004 0.51848166666666662 -0.59853198481846182 0.6049900905981872 0.52511565719112763
+-0.54917199999999999 0.7082613333333333 0.442803 -0.54640906653262145 0.71359351338641641 0.43843064407472682
+-0.62469333333333332 0.66158633333333328 0.41395699999999996 -0.62767902678650844 0.66336490189426844 0.40738930553850972
+-0.36120633333333335 0.8491063333333333 0.38452633333333336 -0.36777664094370871 0.85243758053438257 0.37160531975316291
+-0.44557533333333338 0.81505266666666676 0.36941800000000002 -0.44913041287985422 0.81096811994909945 0.3749834405045035
+-0.88855800000000007 0.11912266666666667 0.44236933333333334 -0.89161673536432962 0.11348461590183043 0.43833872652535383
+-0.91511966666666666 0.049583866666666664 0.39939166666666664 -0.91352935046269046 0.056125683679036448 0.40288215829790164
+-0.82155833333333339 0.33029599999999998 0.46397566666666662 -0.82594164087883648 0.32511501672512494 0.46056555642188074
+-0.86782533333333334 0.26792600000000005 0.41765333333333338 -0.8709359943737891 0.26972265772576098 0.41075562274117583
+-0.92261566666666661 0.16568633333333335 0.34739533333333333 -0.92056554615304842 0.16488135484713429 0.35408080159719629
+-0.89007000000000003 0.15726633333333331 0.42712433333333327 -0.8933001021719591 0.15153307109857345 0.42314614003084344
+-0.53283766666666665 0.56423166666666669 0.63009233333333325 -0.53714394096502771 0.56704658136215702 0.62444740471079663
+-0.60686300000000004 0.51848166666666662 0.60181733333333343 -0.6049900905981872 0.52511565719112763 0.59853198481846182
+-0.7082613333333333 0.442803 0.54917199999999999 -0.71359351338641641 0.43843064407472682 0.54640906653262145
+-0.66158633333333328 0.41395699999999996 0.62469333333333332 -0.66336490189426844 0.40738930553850972 0.62767902678650844
+-0.8491063333333333 0.38452633333333336 0.36120633333333335 -0.8507249144212693 0.37874348378577949 0.36444546021693713
+-0.81505266666666676 0.36941800000000002 0.44557533333333338 -0.81096811994909945 0.37498344050450355 0.44913041287985428
+-0.87451599999999996 -0.011107333333333332 0.484402 -0.87546534326900227 0 0.48328090458333656
+-0.85163333333333335 0.048800966666666667 0.52142733333333335 -0.84822554935274896 0.048094560432326988 0.52744699324391675
+-0.79599699999999995 0.12320566666666666 0.59213633333333338 -0.80003949953512854 0.12626927563302187 0.58650905296908507
+-0.83897433333333327 0.14976733333333334 0.52259766666666663 -0.83549373783461522 0.14816841538857692 0.52914679883788518
+-0.69718433333333341 0.1788173333333333 0.69375566666666666 -0.70570543814547382 0.18530327643778483 0.68384393710358127
+-0.77091966666666656 0.231459 0.59284466666666669 -0.7717242900447443 0.22477932656870703 0.59490829083334673
+-0.77343700000000004 0.14808233333333334 0.61583966666666667 -0.77769021399991622 0.15114483124078609 0.61020748195835717
+-0.9754856666666667 -0.013347533333333333 0.21812066666666666 -0.97679511352946191 -0.0066794954721203581 0.21407169482489635
+-0.94157666666666662 0.24970966666666664 0.22448566666666667 -0.94036205292087083 0.24911249832849996 0.23165097151313285
+-0.50345533333333337 0.86274066666666671 0.041936266666666666 -0.499191766156376 0.86568807684061067 0.037305954185399184
+-0.97857266666666654 -0.053538400000000007 0.19711033333333336 -0.97891707379046766 -0.054331382555824669 0.19689962801153485
+-0.94620066666666658 0.21025733333333332 0.24458033333333337 -0.94697438464037487 0.20412201729289686 0.2481405184391732
+-0.56336366666666671 0.82571500000000009 0.019053333333333332 -0.56474952199138351 0.82517112931181968 0.012271298250800073
+-0.96100333333333332 0.13229433333333332 0.241457 -0.96127411794910778 0.12594081216775527 0.24513462014103787
+-0.64172033333333334 0.7653523333333333 -0.042977366666666662 -0.6426250462957882 0.7653603228425917 -0.035448922291373072
+-0.94891033333333341 0.17061899999999999 0.26418166666666665 -0.94936299928170276 0.16442848172763883 0.26771845284102713
+-0.64172033333333334 0.76535233333333341 0.042977366666666676 -0.64262504629578698 0.76536032284259281 0.03544892229137158
+-0.81053333333333333 0.20004 0.54990566666666663 -0.80686525433351086 0.19816170544713413 0.55650732236296963
+-0.68642633333333336 0.68407633333333318 -0.24532733333333334 -0.68844469340977232 0.68510252344690903 -0.23807233455948226
+-0.78686166666666668 0.22737200000000002 0.57315533333333335 -0.79088056821078456 0.22302929594463317 0.5698823211655436
+-0.706986 0.68900766666666657 -0.15741033333333332 -0.7125321402346092 0.68442589191687297 -0.15446406574501459
+-0.73761066666666675 0.23808166666666666 0.63133833333333333 -0.73851835051376802 0.23115459264988453 0.63337050787930538
+-0.72190399999999999 0.69115666666666664 -0.022636933333333331 -0.71778099415599472 0.69578410488359299 -0.025979295982934563
+-0.7614169999999999 0.25407399999999997 0.59584766666666666 -0.76233057365141144 0.24744053744883177 0.59801778978835018
+-0.6667263333333332 0.74198800000000009 -0.06574646666666667 -0.66770622348079334 0.74215319872214913 -0.058112208282762021
+-0.78593499999999994 0.32604033333333332 0.52472299999999994 -0.79047081147777842 0.32123464889336234 0.52150186629773509
+-0.62469333333333343 0.66158633333333328 -0.41395699999999996 -0.62488537760230467 0.6685102547388766 -0.40325215953270166
+-0.55225633333333335 0.83257966666666661 0.037025366666666663 -0.54729575317202273 0.83595829826741441 0.040510271755655997
+-0.55225633333333335 0.83257966666666672 -0.037025366666666663 -0.54729575317202073 0.83595829826741552 -0.040510271755656801
+-0.52259766666666663 0.83897433333333327 -0.14976733333333334 -0.52914679883788662 0.835493737834614 -0.14816841538857897
+-0.59213633333333326 0.79599699999999995 -0.12320566666666666 -0.58650905296908373 0.80003949953512954 -0.12626927563302098
+-0.43906033333333333 0.8545950000000001 -0.27610266666666666 -0.44613821149444965 0.8517840206616758 -0.27463553737628993
+-0.55621733333333323 0.7935566666666668 -0.24544933333333332 -0.55288852066134297 0.79769549250502136 -0.24082397089592902
+-0.50946000000000002 0.83918366666666666 -0.18871566666666664 -0.51617476502425286 0.83580172950209886 -0.18708041296046374
+-0.83257966666666661 0.037025366666666663 0.55225633333333335 -0.8359582982674143 0.04051027175565599 0.54729575317202273
+-0.95053166666666655 0.30608266666666667 0.045750099999999995 -0.95267325633349931 0.2999141427284871 0.049650515187289822
+-0.95053166666666655 0.30608266666666667 -0.045750100000000009 -0.95267325633349931 0.29991414272848715 -0.049650515187289843
+-0.93525400000000003 0.30251400000000001 -0.18189 -0.93433465145714811 0.30200242947475098 -0.18924400037464209
+-0.96410033333333323 0.2269926666666667 -0.13521533333333333 -0.96537328610346762 0.22074824340540278 -0.13901306237624433
+-0.83560033333333339 0.39287366666666673 -0.38305933333333336 -0.83724221359369977 0.38707866519609063 -0.38625844033073792
+-0.88216099999999997 0.32794300000000004 -0.33699166666666663 -0.8847129582550477 0.32939739480348551 -0.32981864379121911
+-0.93752266666666662 0.22195833333333334 -0.26666133333333336 -0.93604786651851213 0.22128896037937723 -0.27357921631651044
+-0.92622133333333334 0.30024966666666669 -0.22643000000000002 -0.92499859936706652 0.29958638636084506 -0.23372117635382425
+-0.91511966666666666 -0.049583866666666671 0.39939166666666664 -0.91559703367523992 -0.050328370179532594 0.39893499104512464
+-0.97317900000000002 0.066651999999999989 0.21864833333333333 -0.9730829786310693 0.060095725620958447 0.22248150588436871
+-0.96511000000000002 -0.013230166666666666 0.26024266666666662 -0.9665950348576382 -0.0066277061296098868 0.25622277826145901
+-0.93070366666666671 -0.050886266666666673 0.36137766666666665 -0.93114137455847357 -0.051749775504558296 0.36096772891850654
+-0.90789966666666666 0.41769333333333331 0.023229066666666669 -0.90534760491920652 0.42381623217035008 0.026935397082357385
+-0.93617499999999998 0.34366800000000003 0.068979233333333334 -0.9360263168050752 0.34349602657608297 0.076584684988370705
+-0.96410033333333323 0.2269926666666667 0.13521533333333333 -0.96537328610346729 0.2207482434054048 0.1390130623762432
+-0.93525400000000003 0.30251400000000001 0.18189 -0.93433465145714889 0.30200242947474887 0.18924400037464159
+-0.99082366666666666 -0.0135059 0.13190333333333334 -0.99178517435877078 -0.0067661867722445448 0.12773561225713778
+-0.99859100000000012 0.013590633333333333 -0.044029100000000009 -0.99861153173989281 0.013589455871418216 -0.050895337362313081
+-0.99904000000000004 -0.027195333333333332 -0.022029699999999999 -0.9991629923347658 -0.027631906953648543 -0.030162766231593224
+-0.81503000000000003 0.50893833333333338 0.27570366666666662 -0.81305737281356072 0.51455838411771748 0.27233688301013181
+-0.82827800000000007 0.4594753333333334 0.31960099999999997 -0.8304139645378581 0.45393507348914425 0.32304116851714432
+-0.80145 0.49010133333333333 0.34173666666666663 -0.8037056196105522 0.48464651299618527 0.34521737274803649
+-0.80106633333333332 0.53071599999999997 -0.27557166666666666 -0.79897191617966434 0.53626565764556022 -0.27214522150162823
+-0.78783499999999995 0.52574633333333332 -0.31970700000000002 -0.78586803119594784 0.53135648596864515 -0.31634114870382884
+-0.81468733333333343 0.46787466666666666 -0.34159099999999998 -0.81682318175526458 0.46233366051553559 -0.34503257252252501
+-0.82864533333333334 0.47329366666666667 -0.29773366666666662 -0.83090030398783732 0.4678449865199103 -0.30120716030848999
+-0.99904000000000004 0.027195333333333332 0.022029699999999999 -0.99921308916777873 0.02719535532663734 0.0288723931194266
+-0.94964533333333334 0.13090333333333334 -0.28351199999999999 -0.95200289488640144 0.13790605895656843 -0.27326252401487244
+-0.94891033333333341 0.17061899999999999 -0.2641816666666667 -0.94936299928170409 0.16442848172763477 -0.26771845284102513
+-0.61521733333333328 0.74463999999999997 0.25760333333333335 -0.61737720596625711 0.74562370031847525 0.2507801488887873
+-0.60073866666666664 0.74090699999999998 0.29917166666666667 -0.60310957117011399 0.74208291099934232 0.29252657719554881
+-0.76245399999999997 0.64488299999999998 0.046073400000000007 -0.75844767523465428 0.64985474643003283 0.049456369392688278
+-0.73876500000000001 0.67308933333333343 0.022829233333333337 -0.73476307479340197 0.67781810829049682 0.026188470624263417
+-0.53430833333333327 0.83759833333333333 0.11136133333333335 -0.54073640577352522 0.83398268268268572 0.1098955160892395
+-0.30483500000000002 0.94127266666666676 0.14291733333333334 -0.3125814579923708 0.93714717110982948 0.1550742138468155
+-0.74517200000000006 0.6408423333333334 0.18265566666666666 -0.74224043434855891 0.64576760458469762 0.17906238713645095
+-0.32930966666666667 0.92134066666666659 0.20500533333333334 -0.33328886111515593 0.91877258032363729 0.21160217556066777
+-0.67133866666666675 0.72445833333333332 0.15433566666666665 -0.66617006348422658 0.72896749990956811 0.15755580152128734
+-0.54323266666666659 0.78036933333333325 0.30863433333333329 -0.54003468947667688 0.78483938517234197 0.3039566969884519
+-0.70211766666666664 0.6987686666666667 0.13452966666666666 -0.70143880438084616 0.69836613739573827 0.14236692680438723
+-0.55890933333333326 0.78424633333333338 0.26818333333333338 -0.55566098937893771 0.78851015439986138 0.2636144937038305
+-0.5698266666666667 0.79545466666666664 0.20475399999999999 -0.5718381831134367 0.79603524377618096 0.19831536249045315
+-0.92134066666666659 0.20500533333333334 0.32930966666666667 -0.91939394482786763 0.20415305190362681 0.33620872328404433
+-0.60520099999999999 0.77270733333333341 0.18981166666666668 -0.60701838370830541 0.77331676655313386 0.18305698677723931
+-0.93463066666666661 0.20800333333333332 0.28728666666666669 -0.93299278306842348 0.20727921075590988 0.29421046128689032
+-0.64819233333333337 0.74987199999999998 0.13007733333333335 -0.64294891754529637 0.75422846516416497 0.13325206101010117
+-0.78036933333333325 0.30863433333333329 0.54323266666666659 -0.78483938517234197 0.3039566969884519 0.54003468947667677
+-0.63904300000000003 0.74907166666666669 0.17287133333333335 -0.6407392720600753 0.74963864005078429 0.16581644846858651
+-0.78424633333333338 0.26818333333333338 0.55890933333333326 -0.78851015439986005 0.26361449370382972 0.55566098937893993
+-0.93825066666666668 0.34415833333333334 -0.023011 -0.9407270663819467 0.33809798042240319 -0.0268764248126237
+-0.74463999999999997 0.25760333333333335 0.61521733333333328 -0.74562370031847547 0.25078014888878547 0.61737720596625767
+-0.92297966666666664 0.38112833333333329 -0.046245866666666663 -0.92558692684680688 0.37521515029815367 -0.050024312459220746
+-0.74090699999999998 0.29917166666666667 0.60073866666666664 -0.74208291099934232 0.29252657719554881 0.60310957117011399
+-0.74612066666666665 0.66373700000000002 -0.045797666666666674 -0.74198240659208958 0.66861355370751485 -0.049173408529602648
+-0.77135733333333334 0.63545900000000011 -0.02310496666666666 -0.76753243870691357 0.64046221897630851 -0.026497199787162678
+-0.61778100000000002 0.73429599999999995 -0.28015933333333337 -0.62004007182029175 0.73539666254061686 -0.27338993774681891
+-0.59584766666666666 0.7614169999999999 -0.25407399999999997 -0.59801778978835129 0.76233057365141077 -0.24744053744883129
+-0.54111533333333328 0.79043766666666659 -0.285908 -0.53782883589854569 0.79478643964980389 -0.28116660296842483
+-0.56335400000000002 0.76401200000000002 -0.3134513333333333 -0.56025037874058548 0.76856706053370527 -0.3089080552261631
+-0.9250423333333333 0.21922133333333335 -0.30914666666666668 -0.92324824765135227 0.21840485990216033 -0.31608857995793671
+-0.92716333333333323 0.17985566666666666 -0.32766433333333334 -0.92525904843422724 0.17910077093038035 -0.33439289337952693
+-0.95351733333333344 0.14467333333333335 0.26307333333333333 -0.95380451865368532 0.13841331687968292 0.26664338339095522
+-0.94127266666666676 0.14291733333333334 0.30483500000000002 -0.94143256773237549 0.13675142777156432 0.30822681164244103
+-0.46888933333333332 0.76326933333333324 0.44369833333333336 -0.47210024090889563 0.76515024679936405 0.43779728454689493
+-0.50950966666666664 0.74315733333333345 0.43292666666666668 -0.51283621984455163 0.73835079283231242 0.43799214415266191
+-0.441085 0.65946733333333329 0.60814899999999994 -0.43731684113983749 0.65714368989187133 0.61393497317775447
+-0.98424200000000006 0.13481499999999999 0.11134860000000001 -0.98380455546183188 0.13465699226458813 0.1183050763357274
+-0.97513733333333341 0.174405 0.134158 -0.97481076842484138 0.1810618577106119 0.13023275104731649
+-0.97389733333333328 0.21503999999999998 -0.067673766666666677 -0.97374709075627186 0.2149376029675775 -0.074956187698206111
+-0.96987800000000002 0.21437700000000001 -0.112605 -0.96942041966637382 0.21416769761314297 -0.11981755811631678
+-0.76326933333333324 0.44369833333333336 0.46888933333333332 -0.76515024679936416 0.43779728454689493 0.47210024090889557
+-0.74315733333333345 0.43292666666666668 0.50950966666666664 -0.73835079283231253 0.43799214415266186 0.51283621984455152
+-0.65946733333333329 0.60814899999999994 0.441085 -0.65714368989187133 0.61393497317775447 0.43731684113983749
+-0.64266266666666672 0.64228433333333335 0.41684100000000002 -0.64016870646839363 0.64782790771205845 0.41292012453742261
+-0.58604533333333331 0.72415899999999989 0.36257199999999995 -0.58874408788405008 0.7256335018984903 0.35614101126395381
+-0.82926700000000009 0.54054366666666664 0.13940533333333335 -0.82668447040560356 0.54600115691594608 0.13592469619850284
+-0.54774466666666666 0.7468366666666667 0.37619833333333336 -0.54478613472164339 0.75171303266381928 0.37166595746505388
+-0.83464799999999995 0.54221033333333335 0.093158400000000016 -0.83892675353125234 0.53681230026146576 0.0896351298180975
+-0.48915333333333333 0.75987199999999999 0.42735233333333333 -0.48610025123081052 0.76492383199278635 0.42260865703723388
+-0.91633200000000004 0.36574833333333334 0.16081700000000002 -0.91841129259366272 0.359810916179994 0.16448952013472135
+-0.50828066666666671 0.76825099999999991 0.38827200000000001 -0.50520740867948521 0.77309568655942207 0.38352122971039732
+-0.92663333333333331 0.32759366666666667 0.18257666666666669 -0.92838638141934415 0.32159180386994679 0.18621879195926977
+-0.89181766666666673 0.0117591 0.45166433333333328 -0.89054752003018423 0.01789422989084084 0.45453812942887695
+-0.60814899999999994 0.441085 0.65946733333333329 -0.61393497317775447 0.43731684113983749 0.65714368989187133
+-0.88267033333333333 -0.022866433333333335 0.46890266666666669 -0.88784400135689723 -0.017561216450396246 0.45980934411053048
+-0.64228433333333335 0.41684100000000002 0.64266266666666672 -0.64782790771205845 0.41292012453742261 0.64016870646839352
+-0.72415899999999989 0.36257199999999995 0.58604533333333331 -0.7256335018984903 0.35614101126395381 0.58874408788405008
+-0.89808433333333326 0.36037766666666665 -0.2507543333333333 -0.89979701339302987 0.35458216684466864 -0.25423772663537425
+-0.7468366666666667 0.37619833333333336 0.54774466666666666 -0.75171303266381928 0.37166595746505388 0.54478613472164339
+-0.91756233333333326 0.32513833333333336 -0.22731633333333331 -0.91941515130072438 0.32608678172641165 -0.21987084923194705
+-0.75987199999999999 0.42735233333333333 0.48915333333333333 -0.76492383199278646 0.42260865703723388 0.48610025123081058
+-0.87450700000000003 0.47524699999999998 -0.093143066666666663 -0.87208010639908595 0.48110197469553623 -0.089538695361360499
+-0.76825099999999991 0.38827200000000001 0.50828066666666671 -0.77309568655942207 0.38352122971039737 0.50520740867948533
+-0.85703933333333338 0.50979199999999991 -0.069971700000000012 -0.85433531332205415 0.51546247378909904 -0.066404898359457662
+-0.48189433333333337 0.52900333333333338 0.698017 -0.48662321822659543 0.53213040109363308 0.69284563916843744
+-0.49342066666666667 0.48894566666666667 0.7188633333333333 -0.49159291960562052 0.49606095366247921 0.71572336251172752
+-0.52627699999999988 0.83234166666666665 -0.17215800000000001 -0.53285688470931336 0.82885946709064051 -0.17045681045973168
+-0.76574933333333339 0.12819266666666668 0.62975100000000006 -0.76965126444640275 0.13845016904563748 0.62327239777427013
+-0.74868333333333348 0.62970633333333337 -0.20557800000000001 -0.74587853360328304 0.63471859439677691 -0.20198395737482688
+-0.47139533333333333 0.85913866666666661 0.19760733333333333 -0.47812770940072241 0.85609518430535281 0.19620124595017835
+-0.73784766666666657 0.62639233333333333 -0.25005566666666668 -0.7352000916415915 0.63148093086238055 -0.24639938962460284
+-0.44779533333333332 0.87820433333333325 0.16621833333333333 -0.44389085236663006 0.88154577838886228 0.16074187939053561
+-0.69264300000000001 0.64932366666666663 -0.31294899999999998 -0.69072853248152899 0.64827777600392777 -0.3203592039497456
+-0.60036900000000004 0.79510999999999987 0.082435966666666666 -0.59527376626746664 0.79895366475196572 0.085569765531694444
+-0.72513433333333344 0.62218933333333337 -0.29389033333333336 -0.72262666059799807 0.62736747502042201 -0.29020813337927986
+-0.63074133333333338 0.77298066666666665 0.063896999999999995 -0.63181107752023669 0.77305026458344028 0.056639657045134385
+-0.58604533333333342 0.72415899999999989 -0.36257199999999995 -0.58874408788404908 0.72563350189849096 -0.35614101126395376
+-0.82512499999999989 0.55223 -0.11626180000000001 -0.82132486405654359 0.55774163148492639 -0.11979040108052352
+-0.62304033333333331 0.70030133333333333 -0.3474376666666667 -0.62562797974048445 0.70174682321566095 -0.34079469930233341
+-0.84310399999999996 0.51867133333333337 -0.13947866666666667 -0.84064736639471094 0.52423280975072994 -0.13598517034769472
+-0.67726866666666663 0.6436099999999999 -0.35549866666666663 -0.67992113861011727 0.64513514255461479 -0.34857982315699021
+-0.87006133333333324 0.48723133333333335 0.069949533333333327 -0.87384599637596228 0.4816605514985991 0.066304507748473213
+-0.65859666666666661 0.67535066666666665 -0.33085633333333336 -0.66108855667488864 0.67675086734308265 -0.32399102423353954
+-0.86579899999999999 0.48595499999999997 0.11634196666666667 -0.86342620828191208 0.49170321319072813 0.11279686604615173
+-0.45058500000000001 0.87200033333333327 -0.18965866666666664 -0.44674844745016046 0.87548910974200123 -0.18421358099778984
+-0.48899699999999996 0.85274033333333332 -0.18195600000000001 -0.49563977507792206 0.84956016905265141 -0.18052349575591853
+-0.41651533333333335 0.90873766666666667 -0.012210199999999999 -0.41964790472394231 0.90749867578179033 -0.018487550273144752
+-0.39849599999999996 0.91651633333333338 0.024812700000000004 -0.40185500805245689 0.91517158930468778 0.031201196013799441
+-0.34131833333333333 0.93953100000000001 0.012861600000000001 -0.35091742712315827 0.93620857053337636 0.019247644040630722
+-0.36080433333333328 0.93196800000000002 -0.0254641 -0.36431486214481984 0.93072619151734937 -0.031991211980967806
+-0.47919499999999998 0.86999933333333335 0.11362733333333334 -0.4752986044653133 0.8731031569668547 0.10854544618655242
+-0.50254100000000002 0.852213 0.14353533333333332 -0.50896696988675261 0.84897311065938175 0.14211713809963503
+-0.67726866666666663 0.6436099999999999 0.35549866666666663 -0.67992113861011749 0.64513514255461435 0.3485798231569906
+-0.69467100000000004 0.61040833333333333 0.37964866666666669 -0.69233584091762568 0.61589682358755138 0.37595503198607233
+-0.52900333333333338 0.698017 0.48189433333333337 -0.53213040109363308 0.69284563916843744 0.48662321822659543
+-0.48894566666666667 0.7188633333333333 0.49342066666666667 -0.49240149666548411 0.72100417654973248 0.48753845333412765
+-0.93953100000000001 0.012861600000000001 0.34131833333333333 -0.93844557099972203 0.019390301721954061 0.344882482115484
+-0.93196800000000002 -0.0254641 0.36080433333333328 -0.92954913454932664 -0.02588889188244841 0.36778821587388683
+-0.86999933333333335 0.11362733333333334 0.47919499999999998 -0.87310315696685459 0.10854544618655243 0.4752986044653133
+-0.852213 0.14353533333333332 0.50254100000000002 -0.84897311065938108 0.14211713809963467 0.50896696988675361
+-0.6436099999999999 0.35549866666666663 0.67726866666666663 -0.64513514255461435 0.3485798231569906 0.67992113861011749
+-0.61040833333333333 0.37964866666666669 0.69467100000000004 -0.61589682358755138 0.37595503198607233 0.69233584091762568
+-0.698017 0.48189433333333337 0.52900333333333338 -0.69284563916843733 0.48662321822659543 0.53213040109363308
+-0.7188633333333333 0.49342066666666667 0.48894566666666667 -0.72100417654973248 0.48753845333412765 0.49240149666548411
+-0.85913866666666661 0.19760733333333333 0.47139533333333333 -0.85609518430535281 0.19620124595017835 0.47812770940072241
+-0.87820433333333325 0.16621833333333333 0.44779533333333332 -0.88154577838886228 0.16074187939053561 0.44389085236663017
+-0.79510999999999987 0.082435966666666666 0.60036900000000004 -0.79895366475196572 0.085569765531694458 0.59527376626746664
+-0.77298066666666665 0.063896999999999995 0.63074133333333338 -0.77323281423122159 0.077653387717214403 0.62934963761974561
+-0.74988699999999986 0.46585133333333334 -0.46898966666666669 -0.75642902312566274 0.46912920648369566 -0.45577727082110359
+-0.66105400000000003 0.74192333333333327 0.10926669999999999 -0.66233944891874696 0.74224522874824861 0.10187479966346263
+-0.62975100000000006 0.76574933333333339 0.12819266666666668 -0.62439601093608177 0.76998727876036854 0.13133625574954899
+-0.6125790000000001 0.78756366666666666 -0.062679333333333337 -0.6137547143550246 0.78753263737851731 -0.055655149542688249
+-0.60592866666666667 0.78831566666666664 -0.10404483333333332 -0.60062596472725593 0.79232113178228503 -0.107124575269599
+-0.64218399999999998 0.62806733333333331 -0.43866333333333335 -0.65399110933731253 0.62014958554441335 -0.43325526016061694
+-0.67719066666666672 0.60252166666666662 -0.4215173333333333 -0.68023889131423854 0.60441069962000604 -0.4146839241258703
+-0.64819233333333337 0.74987199999999998 -0.13007733333333335 -0.64294891754529637 0.75422846516416486 -0.13325206101010131
+-0.65521533333333337 0.75001200000000001 -0.086990833333333337 -0.65638577782881635 0.75021718069676468 -0.079573189275395501
+-0.4989513333333333 0.8577893333333334 -0.12117366666666667 -0.5052029824723937 0.85462177736693645 -0.11996484548056813
+-0.97958233333333344 0.14785633333333334 -0.13365466666666667 -0.98035278201893195 0.14140532735560526 -0.13752438395860767
+-0.98452266666666655 0.14843300000000001 -0.089341133333333336 -0.98423575270793717 0.14831702844712863 -0.096343355578130993
+-0.92589466666666675 0.34105833333333341 -0.16028966666666669 -0.92729951609022954 0.34172478535605538 -0.15277361857396751
+-0.90747233333333333 0.37685399999999997 -0.18377033333333337 -0.90952132795887308 0.3710265809997233 -0.18737724029236821
+-0.90873766666666667 -0.012210199999999999 0.41651533333333335 -0.90934223419047444 0 0.4160489167363331
+-0.91651633333333338 0.024812700000000004 0.39849599999999996 -0.915171589304688 0.031201196013799483 0.40185500805245644
+-0.90772833333333336 0.33597166666666672 0.24991700000000003 -0.90631973075464956 0.33521978385738732 0.25731739574973539
+-0.89832000000000001 0.37411466666666665 0.22882000000000002 -0.90018936382514747 0.36834417313747186 0.23233957771277039
+-0.44748599999999999 0.79176933333333332 0.41493233333333329 -0.45061332446283259 0.79349252796515179 0.40904430063261704
+-0.42727399999999999 0.78193899999999994 0.45311533333333331 -0.430581048544244 0.78390150597746155 0.44732358484748719
+-0.6169296666666666 0.33708266666666664 0.71068766666666672 -0.62192838064627531 0.34030277240478712 0.70526527806231698
+-0.62218933333333337 0.29389033333333336 0.72513433333333344 -0.63303145558615448 0.28565938067324992 0.71949280362756229
+-0.9863019999999999 0.094360200000000005 0.13272599999999998 -0.98571899316339417 0.094201848958944151 0.13958537949821576
+-0.99119466666666656 0.094722766666666666 0.088691666666666669 -0.99090868604521254 0.094624458621767243 0.095635703326153149
+-0.88726233333333326 0.37065766666666672 0.27328033333333335 -0.88896961193759916 0.36493619269398758 0.27668502726662181
+-0.874386 0.36636833333333335 0.3170716666666667 -0.87595825287420626 0.36061491813226637 0.3203966604726507
+-0.79176933333333332 0.41493233333333329 0.44748599999999999 -0.79349252796515179 0.40904430063261704 0.45061332446283259
+-0.78193899999999994 0.45311533333333331 0.42727399999999999 -0.78390150597746155 0.44732358484748719 0.430581048544244
+-0.71068766666666672 0.6169296666666666 0.33708266666666664 -0.70828943337678341 0.62222522892875454 0.33340942255934247
+-0.72513433333333344 0.62218933333333337 0.29389033333333336 -0.72262666059799929 0.6273674750204199 0.29020813337928147
+-0.80410033333333342 0.57136966666666666 0.16208199999999998 -0.80143539604984149 0.57666967522085277 0.15859820818379325
+-0.82184699999999999 0.53807933333333324 0.18531766666666669 -0.81942233900340899 0.54358437755329736 0.1818324911069982
+-0.77925900000000003 0.43740800000000002 -0.44803333333333334 -0.78253142168665979 0.43953278842596183 -0.44097108972307208
+-0.80692333333333333 0.40806266666666663 -0.426228 -0.8100798920731852 0.41006499600079527 -0.41906713962510156
+-0.8861296666666667 0.35661433333333337 -0.29480833333333334 -0.88770117086706313 0.35082964097389813 -0.2981697406769685
+-0.87666166666666667 0.39457300000000001 -0.27400933333333333 -0.87853054159162047 0.3888378086398766 -0.27746936058396188
+-0.81869099999999995 0.55018 -0.16232933333333333 -0.81615883216746876 0.55555699672441039 -0.15887474332186036
+-0.79259666666666673 0.58049499999999998 -0.18473399999999998 -0.78996515049353166 0.58574870889565644 -0.18125537518320203
+-0.70974033333333342 0.62968733333333338 -0.31475999999999998 -0.70722940200759754 0.63488697783600945 -0.31103874085109451
+-0.72712433333333337 0.59662133333333334 -0.33858233333333332 -0.72479541496417166 0.60206985994653273 -0.33493803933097333
+-0.98758800000000002 0.10800340000000001 -0.11095060000000001 -0.98715914492012036 0.10787007612224336 -0.11781710095719652
+-0.98855766666666656 0.067462433333333335 -0.13233766666666666 -0.98797921534951982 0.067333270144889143 -0.13915207784629885
+-0.86683433333333326 0.32232633333333333 0.37950966666666663 -0.86803909017894487 0.31643882890730773 0.38258934313579762
+-0.90660333333333332 0.32204199999999999 -0.2714273333333333 -0.90873512286034941 0.323188913161296 -0.26410112246941708
+-0.85979766666666668 0.36100666666666664 0.36019033333333333 -0.86126810731236048 0.35519573860579451 0.3633912968177257
+-0.89383633333333334 0.31817000000000001 -0.31486966666666666 -0.89624801139507837 0.31951953619145407 -0.30764714863356918
+-0.86683433333333326 0.32232633333333333 -0.37950966666666663 -0.86803909017894409 0.3164388289073089 -0.38258934313579851
+-0.48856099999999997 0.77240733333333333 0.40497999999999995 -0.49197364065418669 0.76790205989716254 0.41022964703585213
+-0.87218166666666663 0.28325866666666671 -0.39799066666666666 -0.87607180848325805 0.2775774859553693 -0.39427011764977882
+-0.46674366666666667 0.79997300000000005 0.37618033333333334 -0.47024319525858183 0.79575607140413507 0.38163282371470164
+-0.45581200000000005 0.85766166666666666 0.23665966666666663 -0.46266802420794434 0.85473908320643366 0.23528578158261582
+-0.87583766666666663 0.24396433333333331 -0.41561399999999998 -0.87489911065577086 0.25764841568228636 -0.41008394271191495
+-0.49497200000000002 0.83811233333333324 0.22790133333333332 -0.49139120814526044 0.84194317261708751 0.22285954016154341
+-0.67900399999999994 0.72532733333333332 -0.11055603333333335 -0.68027853678687678 0.72566683621403716 -0.10309585445698435
+-0.70211766666666675 0.6987686666666667 -0.13452966666666666 -0.70143880438084738 0.69836613739573716 -0.14236692680438653
+-0.80015433333333341 0.58287766666666663 -0.13899133333333333 -0.79603261649985269 0.58825410186115246 -0.14244011061469714
+-0.80566133333333345 0.58445933333333333 -0.092900400000000008 -0.801776495524269 0.58980757151104346 -0.096340437060805764
+-0.98172833333333331 0.10751146666666667 0.15480099999999999 -0.98194615561011633 0.11412882569379844 0.15085210846477298
+-0.78508733333333325 0.56488433333333332 0.25268700000000005 -0.78272032264096847 0.57031709890135784 0.24917323938488453
+-0.43467933333333336 0.87072233333333326 -0.22858766666666666 -0.43088521647762923 0.8743817691807968 -0.22314670498415706
+-0.98855766666666656 0.067462433333333335 0.13233766666666666 -0.98797921534951993 0.06733327014489128 0.13915207784629779
+-0.75597633333333336 0.59401533333333334 0.27377633333333334 -0.7535386475279815 0.59930919532716653 0.27019991687268247
+-0.41114166666666668 0.88992266666666664 -0.195881 -0.41786869262231569 0.88738043930629418 -0.19478632308939195
+-0.948241 0.22408166666666665 0.223473 -0.94705214190253939 0.22354254211107116 0.23047987414161
+-0.86189800000000005 0.47129566666666661 0.18523800000000001 -0.85984579511114412 0.47710763815943419 0.18175123174166055
+-0.43225599999999997 0.87782599999999988 0.20480499999999999 -0.42840399148712965 0.88133427653309548 0.19929855264346644
+-0.96156533333333327 0.18596799999999999 0.20030700000000001 -0.96232941502860847 0.17973451672552807 0.20400392267830808
+-0.83803666666666665 0.50363800000000003 0.20819866666666664 -0.83588006029070838 0.50930193747238395 0.20473412342664751
+-0.41561399999999998 0.87583766666666663 0.24396433333333334 -0.41941007178318773 0.87267008058923645 0.25008423007298353
+-0.32210133333333335 0.94495299999999993 0.051809966666666672 -0.33563562018755949 0.94056367924667894 0.051852634872905853
+-0.51888433333333328 0.42672700000000002 0.74024633333333334 -0.51615957150728675 0.44054448209603864 0.73450653913777197
+-0.65308166666666667 0.74134766666666663 0.15249900000000002 -0.64779101941242556 0.74574375744790089 0.15566966112925437
+-0.67582666666666669 0.71501700000000001 0.177069 -0.68169635280687602 0.71056893393307707 0.17430396638921783
+-0.69264300000000001 0.64932366666666663 0.31294899999999998 -0.69072853248152954 0.64827777600392789 0.32035920394974421
+-0.65859666666666661 0.67535066666666665 0.33085633333333336 -0.66108855667488819 0.67675086734308298 0.32399102423353965
+-0.97835466666666671 0.13419600000000001 0.15533166666666667 -0.97838757513424468 0.1408425647446043 0.15139724164955778
+-0.97951366666666662 0.093863266666666667 0.17624100000000001 -0.97990967194526468 0.10047745418984398 0.17228266316623886
+-0.95304633333333333 0.013060566666666667 0.30147600000000002 -0.95211762277351153 0.019636084690587727 0.30510073186103814
+-0.94495299999999993 0.051809966666666672 0.32210133333333335 -0.94442659522160821 0.045436616153804496 0.32556707473362934
+-0.74134766666666663 0.15249900000000002 0.65308166666666667 -0.745743757447901 0.15566966112925251 0.64779101941242589
+-0.71501700000000001 0.177069 0.67582666666666669 -0.71963846434385925 0.18023885039700835 0.67054786364910368
+-0.64932366666666663 0.31294899999999998 0.69264300000000001 -0.64827777600392789 0.32035920394974421 0.69072853248152943
+-0.67535066666666665 0.33085633333333336 0.65859666666666661 -0.67675086734308298 0.32399102423353965 0.66108855667488819
+-0.77240733333333333 0.40497999999999995 0.48856099999999997 -0.76790205989716254 0.41022964703585213 0.49197364065418669
+-0.79997300000000005 0.37618033333333334 0.46674366666666667 -0.79575607140413507 0.38163282371470164 0.47024319525858183
+-0.85766166666666666 0.23665966666666663 0.45581200000000005 -0.85473908320643366 0.23528578158261582 0.46266802420794434
+-0.83811233333333324 0.22790133333333332 0.49497200000000002 -0.84194317261708751 0.22285954016154338 0.49139120814526044
+-0.68439933333333336 0.71638666666666673 0.13320333333333331 -0.68580719655212852 0.71683146040090073 0.12578213918049705
+-0.69085300000000005 0.71705166666666675 0.089040933333333336 -0.68617271066798247 0.72155909310713462 0.092301063314365661
+-0.47419900000000004 0.85190366666666673 -0.22082566666666667 -0.48098951346609453 0.84883685748693116 -0.21937428588456115
+-0.45815366666666674 0.84954666666666678 -0.26021299999999997 -0.45135840117965048 0.85292378671556901 -0.26229107445607874
+-0.94615333333333329 -0.025922166666666666 0.32170033333333337 -0.94397703845306957 -0.026307601627811733 0.32896088060735168
+-0.95898133333333335 -0.026290733333333333 0.28108433333333332 -0.95709449513028511 -0.026632624785899603 0.28854952900380587
+-0.98172833333333331 0.10751146666666667 -0.15480099999999999 -0.981946155610116 0.11412882569380053 -0.15085210846477418
+-0.97273166666666666 0.14706466666666665 -0.17742433333333332 -0.97332507116728262 0.14069236473595439 -0.18122903835260357
+-0.87782599999999988 0.20480499999999999 0.43225599999999997 -0.88133427653309548 0.19929855264346644 0.42840399148712965
+-0.87583766666666663 0.24396433333333334 0.41561399999999998 -0.87267008058923645 0.25008423007298353 0.41941007178318773
+-0.89582666666666666 0.33240466666666668 0.29379266666666665 -0.89809633511602072 0.33366106968666331 0.28651921999531493
+-0.91531566666666675 0.29738066666666668 0.27032499999999998 -0.91378580324676062 0.29657279985040441 0.2775609485744791
+-0.62374033333333345 0.63313766666666671 0.45758233333333331 -0.62130991858177487 0.63889319899966468 0.45364023779189083
+-0.60354833333333335 0.62257333333333331 0.49742099999999995 -0.60117770770604406 0.62853566622266566 0.49348584583890137
+-0.48163 0.63991533333333328 0.59819433333333327 -0.47788134256101816 0.6376657568736942 0.60416206844089237
+-0.46451999999999999 0.67487200000000003 0.57277033333333327 -0.46093836374565439 0.67274682997459456 0.57874651410320621
+-0.93375666666666668 0.32944800000000002 0.13732900000000001 -0.93569239277978311 0.32338590283165725 0.14107198142720662
+-0.93888933333333335 0.33070500000000003 0.091738066666666673 -0.94101246637268166 0.32459334718907901 0.095575609293337277
+-0.9656313333333334 0.25454166666666667 -0.045389633333333339 -0.96563827865214946 0.25447243147524917 -0.052787275178668158
+-0.97591266666666676 0.2153643333333333 -0.022573899999999997 -0.97607441993813893 0.21537615737539612 -0.029863649754073556
+-0.96100333333333332 0.13229433333333332 -0.24145700000000003 -0.96127411794910678 0.12594081216775918 -0.24513462014104029
+-0.97088433333333324 0.093213466666666675 -0.21914 -0.97096749167518448 0.08671304054432924 -0.222941648665201
+-0.99567566666666674 0.013556566666666667 -0.088052033333333335 -0.99539188988286775 0.013538437507782957 -0.094929954520481544
+-0.99597933333333322 0.054270233333333334 -0.066234899999999999 -0.99584388442193805 0.054237984373482914 -0.073165558226036542
+-0.63313766666666671 0.45758233333333331 0.62374033333333345 -0.63889319899966468 0.45364023779189083 0.62130991858177487
+-0.62257333333333331 0.49742099999999995 0.60354833333333335 -0.62853566622266566 0.49348584583890132 0.60117770770604417
+-0.63991533333333328 0.59819433333333327 0.48163 -0.6376657568736942 0.60416206844089237 0.47788134256101816
+-0.67487200000000003 0.57277033333333327 0.46451999999999999 -0.67274682997459456 0.57874651410320621 0.46093836374565439
+-0.63670666666666664 0.71672566666666659 0.28326633333333334 -0.63896671989407416 0.71787542780718239 0.27636280686529158
+-0.67113733333333325 0.69153466666666663 0.26586133333333334 -0.6732775017358622 0.69264770558930877 0.25872101112623663
+-0.7715306666666667 0.57326266666666681 0.27462199999999998 -0.76918116629283839 0.57868388027417383 0.27108172223743615
+-0.75816133333333335 0.56834533333333337 0.31856266666666666 -0.7559183990567766 0.57388445654331877 0.31503016443734316
+-0.87771233333333321 0.47617466666666663 -0.046646866666666668 -0.87508176244014069 0.48205910673977859 -0.043022397119455921
+-0.89658166666666672 0.44146866666666668 -0.023282399999999998 -0.89406335609088294 0.44751152718113657 -0.019599702434321454
+-0.92250933333333329 0.36743666666666669 0.11516276666666668 -0.92477192156992416 0.36146431664713069 0.11891358571119123
+-0.90418833333333337 0.40314233333333332 0.13862700000000003 -0.9065768482451545 0.39732242461037337 0.14231412132187085
+-0.91822966666666661 0.24427766666666664 0.31066633333333332 -0.91640693651043736 0.24339426256520144 0.3177381935900957
+-0.89978666666666662 0.27934999999999999 0.33417800000000003 -0.89777797192039677 0.27832123447044738 0.34136784203750858
+-0.83950633333333335 0.42241299999999998 0.34073899999999996 -0.84139072144433436 0.41671320306238946 0.34411009903934264
+-0.85336699999999999 0.42763400000000001 0.29698633333333335 -0.85538338322748853 0.42197135721665069 0.30043209114046554
+-0.45758233333333331 0.62374033333333345 0.63313766666666671 -0.45364023779189083 0.62130991858177487 0.63889319899966468
+-0.49742099999999995 0.60354833333333335 0.62257333333333331 -0.49348584583890132 0.60117770770604417 0.62853566622266566
+-0.59819433333333327 0.48163 0.63991533333333328 -0.60416206844089237 0.47788134256101816 0.6376657568736942
+-0.57277033333333327 0.46451999999999999 0.67487200000000003 -0.57874651410320621 0.46093836374565439 0.67274682997459456
+-0.71672566666666659 0.28326633333333334 0.63670666666666664 -0.71787542780718239 0.27636280686529158 0.63896671989407416
+-0.69153466666666663 0.26586133333333334 0.67113733333333325 -0.69264770558930877 0.25872101112623663 0.6732775017358622
+-0.96258599999999994 0.25397200000000003 -0.09068166666666666 -0.96227939571058341 0.25377396032399235 -0.098067026325627235
+-0.95327899999999988 0.29303333333333331 -0.068455500000000002 -0.95312415703736431 0.29288506573994283 -0.075978151716945649
+-0.89445666666666668 0.44087900000000002 -0.069773099999999991 -0.89214714856246369 0.44687846223520744 -0.066129458656195669
+-0.8902363333333333 0.439668 -0.11605323333333334 -0.88812183032546255 0.44564102421677082 -0.11244417296764594
+-0.76900066666666655 0.63496300000000006 -0.069209533333333337 -0.76490472969328582 0.64003908894182793 -0.072599718452320161
+-0.764351 0.63392533333333334 -0.11503839999999999 -0.75999418759787019 0.63905202783527082 -0.11841174155075003
+-0.78508733333333336 0.56488433333333343 -0.25268699999999999 -0.78272032264096647 0.57031709890135995 -0.24917323938488595
+-0.81243133333333339 0.53480433333333333 -0.23075133333333331 -0.81017001123674981 0.54034534738107565 -0.22726957221825625
+-0.54633266666666669 0.8181653333333333 0.17754333333333336 -0.55294580946744776 0.81448691874194057 0.17567581219578418
+-0.52472299999999994 0.78593499999999994 -0.32604033333333332 -0.53177567977925 0.7824376384018038 -0.32404624424227568
+-0.53302133333333324 0.81731666666666669 0.21738166666666667 -0.52957076434678341 0.82117934975840678 0.21264825670464324
+-0.48500100000000002 0.8065730000000001 -0.33695900000000001 -0.49134209471296303 0.80858606522459509 -0.3236842923091644
+-0.82594966666666669 0.4307913333333333 -0.362674 -0.82785431066039616 0.42508009428749394 -0.36601113884899122
+-0.79909666666666668 0.46117466666666668 -0.38479733333333338 -0.8011452716929367 0.45549482658489687 -0.38818902173869535
+-0.99567566666666674 -0.013556566666666667 0.088052033333333335 -0.99645037790286128 -0.0067825110210987917 0.083908533067223873
+-0.99597933333333322 -0.054270233333333334 0.066234899999999999 -0.9962881829039385 -0.055094892576294616 0.066139318245466691
+-0.8632616666666667 0.30715500000000001 -0.39970366666666662 -0.86624744389763897 0.30889953120125169 -0.39267855246302108
+-0.50779833333333335 0.68626366666666672 0.52007300000000001 -0.51139416315246811 0.68853826500749427 0.51418971937802915
+-0.52546799999999994 0.65217366666666665 0.54575033333333334 -0.52920366945247455 0.65458239889410585 0.53987531828754109
+-0.50784666666666667 0.54724133333333336 0.66476333333333326 -0.51235096103056466 0.55021305309491264 0.65936491333330116
+-0.46893000000000001 0.56797500000000001 0.67587200000000003 -0.46472565032621649 0.56535557010136861 0.68147131215057888
+-0.96046299999999996 0.092355800000000002 -0.26138033333333333 -0.96288732747543226 0.099270327172423373 -0.2509848535874219
+-0.99709700000000012 -0.0271472 -0.066086900000000004 -0.99815958682132622 -0.013995937504594413 -0.059004686000748076
+-0.99320699999999995 -0.027062466666666663 -0.11007063333333333 -0.99458728947142871 -0.013929184287532797 -0.1029665064327249
+-0.85042666666666678 0.10573533333333333 0.51483299999999999 -0.84714907157637986 0.10444750790748693 0.52098864538413248
+-0.84756133333333328 0.069051033333333345 0.52571099999999993 -0.84415555467171699 0.068173181494397148 0.53174600782875447
+-0.43467066666666665 0.8999693333333334 0.023969299999999999 -0.43778575898804434 0.89857223759622595 0.030192102420558857
+-0.46890266666666669 0.88267033333333345 0.022866433333333335 -0.47156638030224995 0.88134786990201952 0.029173295799524861
+-0.57604433333333327 0.81494699999999998 0.059267866666666669 -0.57105803285634871 0.81853487189697505 0.062397007931789775
+-0.56820133333333334 0.81665133333333328 0.098415533333333319 -0.56255375688704268 0.8204999119066646 0.10155375509270882
+-0.73621533333333333 0.67279266666666671 0.068386966666666674 -0.7319069708828525 0.67762015021244859 0.071715535270580819
+-0.73132766666666671 0.67199433333333347 0.11367523333333333 -0.72672368166859569 0.6768932282846396 0.11699678629962637
+-0.65008199999999994 0.72023166666666671 0.24082699999999999 -0.6520932499745713 0.72120350456889648 0.23375178787582127
+-0.6280163333333334 0.74735400000000007 0.21542566666666665 -0.62994672096641147 0.74812731929989174 0.2085009421101596
+-0.91466100000000006 0.37891566666666665 -0.13824433333333333 -0.91689163039086197 0.37305445430029122 -0.14191586326376221
+-0.91984566666666667 0.38031999999999999 -0.092365500000000003 -0.92226052033247541 0.3744336885534349 -0.096098623883701606
+-0.88990066666666667 0.45298833333333333 0.046587499999999997 -0.89337034382634739 0.44727048685379228 0.042878203800596357
+-0.87221566666666661 0.48784099999999997 0.023341766666666666 -0.86923108705951135 0.49367090573163469 0.026950957746388671
+-0.79981999999999998 0.54362500000000002 0.25311366666666663 -0.79757193557747619 0.54914166848935986 0.24964461842371102
+-0.78303900000000004 0.5772896666666667 0.22998833333333335 -0.78055969213023035 0.58261180697286685 0.22647306550089111
+-0.75888966666666668 0.644177 0.091938833333333345 -0.7546117333897282 0.64921606847318503 0.095287083420421345
+-0.78476100000000004 0.61534100000000003 0.069477033333333327 -0.78081027126240721 0.62050512688950044 0.072860879729598649
+-0.58178533333333327 0.8090480000000001 -0.080161999999999997 -0.57657935871746036 0.81279318645478205 -0.083207446503567165
+-0.55776333333333328 0.82775166666666655 -0.056808099999999993 -0.55271151938785956 0.83119822272984056 -0.060162204636450917
+-0.45166433333333339 0.89181766666666673 -0.0117591 -0.45453812942887795 0.89054752003018356 -0.0178942298908456
+-0.43589300000000003 0.89842200000000005 -0.047878066666666663 -0.43918072250599538 0.89674879877906211 -0.054423201554310061
+-0.47605000000000003 0.87439566666666657 -0.090921466666666673 -0.4721374721391981 0.87734060758261045 -0.085788493917213979
+-0.48871233333333336 0.87042766666666671 -0.054918800000000011 -0.48452607356091065 0.87333859322127783 -0.050141655636071245
+-0.49190599999999995 0.8669473333333334 0.076870800000000003 -0.48798175061253013 0.86987752165419474 0.072020194319970227
+-0.45684033333333329 0.88547600000000004 0.081770899999999994 -0.45266532689738559 0.88841440347642964 0.076249259147239679
+-0.52068599999999998 0.80599766666666672 0.28034733333333334 -0.51732881626734262 0.81023565728700075 0.27547971889075962
+-0.48135633333333333 0.82648499999999991 0.29078700000000002 -0.47787127089349962 0.83068865576298123 0.28564909529232324
+-0.35277166666666665 0.90397933333333336 0.24023133333333332 -0.35979822748454249 0.90184935426715085 0.23919234458256466
+-0.37067 0.90640266666666669 0.20096933333333333 -0.37747602561803351 0.90416256080953616 0.20000478422766657
+-0.68626366666666672 0.52007300000000001 0.50779833333333335 -0.68853826500749427 0.51418971937802904 0.51139416315246822
+-0.65217366666666665 0.54575033333333334 0.52546799999999994 -0.65458239889410585 0.53987531828754109 0.52920366945247455
+-0.54724133333333336 0.66476333333333326 0.50784666666666667 -0.55021305309491297 0.6593649133332985 0.51235096103056765
+-0.56797500000000001 0.67587200000000003 0.46893000000000001 -0.56535557010136861 0.68147131215057888 0.46472565032621654
+-0.36312566666666662 0.81351666666666667 0.45347166666666666 -0.37000798690410153 0.81773970594077883 0.44090346217178061
+-0.38384699999999999 0.82400366666666669 0.41591733333333331 -0.39132827451862362 0.82160558708182385 0.41451953010468423
+-0.50412633333333334 0.80162933333333342 0.32027699999999998 -0.50082642609276529 0.80606359017420337 0.31533217330716817
+-0.52632333333333337 0.77506433333333336 0.34868433333333337 -0.5232122967623275 0.77971086918769328 0.34394745672451499
+-0.8669473333333334 0.076870800000000003 0.49190599999999995 -0.86987752165419474 0.072020194319970227 0.48798175061253013
+-0.88547600000000004 0.081770899999999994 0.45684033333333329 -0.88841440347642964 0.076249259147239679 0.45266532689738559
+-0.80599766666666672 0.28034733333333334 0.52068599999999998 -0.81023565728700075 0.27547971889075962 0.51732881626734262
+-0.82648499999999991 0.29078700000000002 0.48135633333333333 -0.83068865576298123 0.28564909529232324 0.47787127089349962
+-0.90397933333333336 0.24023133333333332 0.35277166666666665 -0.90184935426715085 0.23919234458256466 0.35979822748454249
+-0.90640266666666669 0.20096933333333333 0.37067 -0.90416256080953616 0.20000478422766657 0.37747602561803351
+-0.52007300000000001 0.50779833333333335 0.68626366666666672 -0.51418971937802904 0.51139416315246822 0.68853826500749427
+-0.97022466666666674 0.026577699999999999 -0.23935300000000001 -0.97401232856293862 0.026285001833126275 -0.22496462496587019
+-0.54575033333333334 0.52546799999999994 0.65217366666666665 -0.53987531828754354 0.52920366945247321 0.65458239889410497
+-0.96445399999999992 0.106003 -0.24067133333333335 -0.96454988640168204 0.099589396198537586 -0.24438794734461219
+-0.66476333333333326 0.50784666666666667 0.54724133333333336 -0.6593649133332985 0.51235096103056776 0.55021305309491297
+-0.96278133333333338 0.066040966666666659 -0.26082466666666665 -0.96690146277194322 0.066004433072404931 -0.246464959181355
+-0.67587200000000003 0.46893000000000001 0.56797500000000001 -0.68147131215057877 0.46472565032621649 0.56535557010136861
+-0.957121 0.22573400000000002 -0.17963466666666669 -0.95821518598554112 0.21958206357096466 -0.18332314285057291
+-0.81351666666666667 0.45347166666666666 0.36312566666666662 -0.81555497642591224 0.44781837438072558 0.36650891393516466
+-0.96156533333333327 0.18596799999999999 -0.20030700000000001 -0.96232941502860792 0.17973451672552798 -0.2040039226783105
+-0.82400366666666669 0.41591733333333331 0.38384699999999999 -0.82578576083367272 0.4101701368210342 0.38708957111315512
+-0.95351733333333322 0.14467333333333332 -0.26307333333333333 -0.95380451865368532 0.13841331687968719 -0.26664338339095306
+-0.80162933333333342 0.32027699999999998 0.50412633333333334 -0.80606359017420326 0.31533217330716812 0.50082642609276529
+-0.96402533333333329 0.14602166666666669 -0.22057833333333332 -0.96445393035568028 0.13971873759203532 -0.22429286789188932
+-0.77506433333333336 0.34868433333333337 0.52632333333333337 -0.77971086918769328 0.34394745672451499 0.5232122967623275
+-0.8999693333333334 0.023969299999999999 0.43467066666666665 -0.89857223759622595 0.030192102420558857 0.43778575898804434
+-0.88267033333333345 0.022866433333333335 0.46890266666666669 -0.88134786990201952 0.029173295799524861 0.47156638030224995
+-0.81494699999999998 0.059267866666666669 0.57604433333333327 -0.81853487189697505 0.062397007931789775 0.57105803285634871
+-0.81665133333333328 0.098415533333333319 0.56820133333333334 -0.8204999119066646 0.10155375509270882 0.56255375688704268
+-0.72023166666666671 0.24082699999999999 0.65008199999999994 -0.72120350456889648 0.23375178787582127 0.6520932499745713
+-0.74735400000000007 0.21542566666666665 0.6280163333333334 -0.74812731929989174 0.2085009421101596 0.62994672096641147
+-0.51483299999999999 0.85042666666666678 0.10573533333333333 -0.5209886453841317 0.84714907157638042 0.10444750790748585
+-0.52571099999999993 0.84756133333333328 0.069051033333333345 -0.53174600782875492 0.84415555467171688 0.068173181494395704
+-0.58780333333333334 0.8076793333333333 -0.040241233333333327 -0.58895650236746122 0.80747253922186379 -0.033441541855636171
+-0.61607900000000004 0.7870609999999999 -0.020946933333333334 -0.61698063728776309 0.78686277614210864 -0.013485723336907495
+-0.63133833333333333 0.73761066666666675 -0.23808166666666666 -0.63337050787930427 0.73851835051376891 -0.23115459264988511
+-0.66528666666666669 0.71280966666666667 -0.22053199999999998 -0.66719302095845834 0.71368475232804796 -0.21332497996901115
+-0.74243766666666666 0.66315266666666661 -0.091391999999999987 -0.7380201623109951 0.66809911774214903 -0.094709075038321697
+-0.71923599999999999 0.69097666666666679 -0.067828766666666665 -0.71484071533694593 0.69565931898028532 -0.07113974706483786
+-0.77267300000000005 0.56040299999999998 -0.297039 -0.7704440950769551 0.56591681206609912 -0.29352011546399231
+-0.75597633333333336 0.59401533333333345 -0.27377633333333334 -0.75353864752797994 0.59930919532716931 -0.27019991687268052
+-0.65288666666666673 0.70969066666666658 -0.2634556666666667 -0.65501968417060397 0.71076863277450397 -0.25643159714221031
+-0.63873966666666671 0.70558766666666661 -0.30574499999999999 -0.64109301993334888 0.70685708038104433 -0.29891940001934414
+-0.60575433333333339 0.794234 0.041378733333333334 -0.60677526245756896 0.79413092226005166 0.034349078298377002
+-0.58062966666666671 0.81361933333333314 0.019809433333333331 -0.58189096904843229 0.81316353437949684 0.012960188861322341
+-0.51093266666666659 0.85518833333333344 -0.084138333333333329 -0.51693773592267367 0.85198203848343912 -0.083078175718678079
+-0.53430833333333327 0.83759833333333333 -0.11136133333333333 -0.54073640577352322 0.83398268268268716 -0.10989551608923878
+-0.35099133333333327 0.91087466666666661 -0.21552966666666665 -0.35884953293333854 0.90540314548384249 -0.22687476030067502
+-0.3744993333333333 0.89252600000000004 -0.24997166666666668 -0.38084706248225925 0.893707995900477 -0.23715297396867541
+-0.50220666666666669 0.81162366666666674 -0.29731033333333334 -0.49883260789314426 0.81591989161692013 -0.29230251412938263
+-0.51826699999999992 0.8151826666666665 -0.25734633333333334 -0.51483738173931926 0.81927210874247725 -0.25245926839879929
+-0.794234 0.041378733333333334 0.60575433333333339 -0.79454065758969872 0.055064809309266098 0.60470902937914139
+-0.81361933333333314 0.019809433333333331 0.58062966666666671 -0.81388635643554741 0.032944592837174359 0.5800893488169403
+-0.91087466666666661 0.21552966666666665 -0.35099133333333327 -0.90877103811651916 0.21458513885150093 -0.3578944236289609
+-0.89252600000000004 0.24997166666666668 -0.3744993333333333 -0.89022513035931738 0.24884721390097977 -0.3815419785691429
+-0.97215366666666669 0.22839699999999999 0.045218333333333333 -0.9721645112054107 0.22834695483901848 0.052476960358735447
+-0.96287333333333336 0.26767199999999997 0.022745200000000004 -0.9630414023662548 0.26766477827048935 0.030113515268850533
+-0.93204233333333342 0.34265900000000005 -0.11477476666666668 -0.93314089294629399 0.34314701905525469 -0.10722964713588243
+-0.94234466666666672 0.30424066666666666 -0.13681300000000002 -0.94173031487740755 0.30386966027529327 -0.14424716151479927
+-0.84066399999999997 0.43669399999999997 -0.31920066666666663 -0.84267139385309486 0.43105936514427184 -0.32263407399575722
+-0.85106633333333326 0.39919166666666667 -0.34005899999999994 -0.8528049708060641 0.39346996082837327 -0.34337307945467493
+-0.90763266666666664 0.25476333333333329 -0.33260966666666664 -0.9056496374377796 0.25378156646779038 -0.339696409651284
+-0.92108633333333334 0.25843766666666668 -0.29005533333333333 -0.91942952058264082 0.25759897198975035 -0.29713991033013243
+-0.89181766666666673 -0.0117591 0.45166433333333339 -0.89054752003018323 -0.01789422989084398 0.45453812942887872
+-0.89842200000000005 -0.047878066666666663 0.43589300000000003 -0.89280395272116786 -0.047483374616635085 0.44793574443269779
+-0.95314033333333337 0.10487713333333333 0.28260466666666667 -0.95309693783712679 0.098541461164222813 0.28617443547094124
+-0.96278133333333338 0.066040966666666659 0.26082466666666665 -0.96253563407545095 0.059527485851090023 0.26454041574628634
+-0.886714 0.45208100000000001 0.093025999999999998 -0.88445594026952357 0.45797227380334937 0.089437610373616722
+-0.90578799999999993 0.4171226666666667 0.069620399999999999 -0.90364636568419621 0.42316551543616399 0.065986304119790631
+-0.96083533333333337 0.26727899999999999 0.068186966666666668 -0.95963829897183539 0.27377530970840092 0.064353826152851415
+-0.95677066666666677 0.26647300000000002 0.1134709 -0.95838768851164724 0.26025483249547893 0.11730498997081132
+-0.99709700000000012 0.0271472 0.066086900000000004 -0.99696424547661711 0.027116700704621275 0.072986147892153908
+-0.99320699999999995 0.027062466666666663 0.11007063333333333 -0.99277645957187444 0.027023373377348354 0.11689584514106012
+-0.96445399999999992 0.106003 0.24067133333333332 -0.96454988640168204 0.099589396198537947 0.24438794734461197
+-0.96402533333333329 0.14602166666666669 0.22057833333333332 -0.96445393035568139 0.13971873759203135 0.22429286789188704
+-0.88396799999999998 0.4377786666666667 -0.16201833333333335 -0.88647153569422021 0.43211376507175508 -0.16566807308423348
+-0.94495300000000004 -0.051809966666666672 0.32210133333333335 -0.94534774934638066 -0.052625365478896312 0.32178906711376221
+-0.91633200000000004 0.36574833333333334 -0.16081700000000002 -0.91841129259366205 0.35981091617999666 -0.16448952013471924
+-0.99709700000000012 -0.0271472 0.066086900000000004 -0.99686240587570329 -0.027533312668726877 0.074210918638638296
+-0.90418833333333337 0.40314233333333327 -0.138627 -0.90657684824515439 0.39732242461037326 -0.14231412132187304
+-0.99903999999999993 -0.027195333333333332 0.022029699999999999 -0.9991629923347658 -0.027631906953650604 0.030162766231589453
+-0.85258733333333325 0.46819666666666665 -0.23063066666666668 -0.8507180361980079 0.47398585102273699 -0.22719206834230982
+-0.85113933333333336 0.48120366666666664 0.20809633333333333 -0.84913149454651216 0.48691927864691648 0.20465903608483363
+-0.83803666666666665 0.50363800000000003 -0.20819866666666667 -0.83588006029070772 0.50930193747238528 -0.20473412342664679
+-0.84083699999999995 0.47767399999999999 0.25322733333333336 -0.83898811193120493 0.48339456538053766 0.2498572436385891
+-0.82926700000000009 0.54054366666666664 -0.13940533333333335 -0.82668447040560145 0.54600115691594953 -0.13592469619850162
+-0.84066399999999997 0.43669399999999997 0.31920066666666669 -0.84267139385309497 0.43105936514427146 0.32263407399575739
+-0.82184699999999999 0.53807933333333335 -0.18531766666666669 -0.81942233900340922 0.54358437755329658 -0.18183249110699973
+-0.82864533333333323 0.47329366666666672 0.29773366666666662 -0.83090030398783732 0.46784498651991108 0.30120716030848904
+-0.4059166666666667 0.75636666666666663 0.51228966666666664 -0.41333439577222858 0.75381219132502608 0.51080510714103955
+-0.75636666666666663 0.51228966666666664 0.4059166666666667 -0.75865329835647777 0.50674725822349365 0.4094537692778133
+-0.77267300000000005 0.56040299999999998 0.297039 -0.77044409507695688 0.56591681206609601 0.2935201154639932
+-0.74262333333333341 0.5482703333333333 -0.38367900000000005 -0.74061277632469213 0.55398308333902235 -0.38025709581652961
+-0.77289299999999994 0.51966566666666669 -0.36316266666666669 -0.77525724683632413 0.51427657878884769 -0.3667366926515549
+-0.81351666666666667 0.45347166666666666 -0.36312566666666662 -0.81555497642591224 0.44781837438072558 -0.36650891393516466
+-0.80145 0.49010133333333333 -0.34173666666666663 -0.80370561961055131 0.48464651299618633 -0.34521737274803704
+-0.86488299999999996 0.4452226666666666 -0.23033366666666666 -0.86718072358672149 0.43967029351048392 -0.23385385531142125
+-0.84083699999999995 0.47767399999999999 -0.2532273333333333 -0.83898811193120471 0.48339456538053771 -0.24985724363858919
+-0.79981999999999998 0.54362500000000002 -0.25311366666666668 -0.79757193557747719 0.54914166848935786 -0.24964461842371205
+-0.81503000000000003 0.50893833333333338 -0.27570366666666662 -0.81305737281356072 0.51455838411771748 -0.27233688301013143
+-0.9934940000000001 0.10851619999999999 0.022237466666666667 -0.99366413966331857 0.10853012501892693 0.029202559999646965
+-0.99734033333333338 0.067943766666666669 0 -0.99766335663096273 0.067974332085518785 0.0068787363205835943
+-0.99709700000000012 0.0271472 -0.066086900000000004 -0.99696424547661722 0.027116700704621279 -0.072986147892153894
+-0.99903999999999993 0.027195333333333332 -0.022029699999999999 -0.99921308916777885 0.027195355326637367 -0.028872393119419037
+-0.95597666666666681 0.21201066666666668 -0.20118666666666665 -0.95690704317590225 0.20579936405970423 -0.20487931196920114
+-0.94620066666666658 0.21025733333333332 -0.24458033333333332 -0.94697438464037365 0.20412201729289914 -0.24814051843917612
+-0.91822966666666661 0.24427766666666664 -0.31066633333333332 -0.91640693651043803 0.24339426256520186 -0.31773819359009342
+-0.93463066666666672 0.20800333333333335 -0.28728666666666669 -0.93299278306842304 0.20727921075590922 -0.29421046128689254
+-0.60522599999999993 0.70626633333333333 0.36633966666666667 -0.60795094672564387 0.70779537966296246 0.35975178512851885
+-0.58478433333333335 0.7359429999999999 0.34020366666666663 -0.58183870110532376 0.74073627898260386 0.33581764530035613
+-0.52472299999999994 0.78593499999999994 0.32604033333333332 -0.52150186629773509 0.79047081147777842 0.32123464889336234
+-0.56335399999999991 0.76401200000000002 0.3134513333333333 -0.56025037874058581 0.76856706053370394 0.30890805522616588
+-0.68725733333333328 0.72564533333333336 0.022199266666666665 -0.68790368117368894 0.72565832946336029 0.014440024519819183
+-0.71367933333333333 0.70001333333333327 2.3129646346357427e-18 -0.70976920859764492 0.70442647167853822 0.003319115122790968
+-0.73621533333333333 0.67279266666666659 -0.068386966666666674 -0.7319069708828545 0.67762015021244637 -0.07171553527058093
+-0.73876500000000001 0.67308933333333332 -0.022829233333333327 -0.73476307479340419 0.6778181082904946 -0.026188470624260104
+-0.75755833333333333 0.52692766666666668 -0.38439033333333333 -0.75563435731375361 0.53275084065322775 -0.38104233338345717
+-0.36358533333333326 0.92568533333333336 0.10143216666666666 -0.36726950130505531 0.923820067450836 0.1080259060886271
+-0.77051866666666669 0.490504 -0.40621499999999999 -0.77270320478273291 0.48485766119619861 -0.40968622834780039
+-0.34578333333333333 0.92738500000000013 0.14052333333333333 -0.34890169435207236 0.92745409669571854 0.13452325524080155
+-0.76326933333333324 0.44369833333333331 -0.46888933333333332 -0.759812345142579 0.45689772793499878 -0.46252531430914168
+-0.35099133333333327 0.91087466666666661 0.21552966666666665 -0.35789442362895907 0.90877103811651971 0.21458513885150166
+-0.78193899999999994 0.45311533333333331 -0.42727399999999999 -0.78390150597746155 0.44732358484748719 -0.430581048544244
+-0.32766433333333334 0.92716333333333323 0.17985566666666666 -0.33748755045646722 0.92529999561685417 0.17297997398064061
+-0.54990566666666663 0.81053333333333333 0.20004 -0.55650732236297251 0.80686525433350909 0.19816170544713305
+-0.57315533333333335 0.78686166666666668 0.22737200000000002 -0.56988232116554505 0.79088056821078367 0.22302929594463261
+-0.63133833333333333 0.73761066666666675 0.23808166666666666 -0.63337050787930682 0.73851835051376702 0.23115459264988383
+-0.59584766666666666 0.7614169999999999 0.25407399999999997 -0.59801778978835185 0.76233057365140977 0.24744053744883268
+-0.7359429999999999 0.34020366666666663 0.58478433333333335 -0.74073627898260386 0.33581764530035613 0.58183870110532376
+-0.76401200000000002 0.3134513333333333 0.56335399999999991 -0.76856706053370394 0.30890805522616588 0.56025037874058581
+-0.81723666666666661 0.57523666666666662 -0.023299466666666661 -0.81373864287838304 0.58061392593956729 -0.026774803295075186
+-0.79504166666666665 0.60599700000000001 2.3129646346357427e-18 -0.79150624842317008 0.61115147527147917 -0.0034253438620977824
+-0.76900066666666655 0.63496299999999994 0.069209533333333337 -0.76490472969328482 0.64003908894182915 0.072599718452319176
+-0.77135733333333334 0.635459 0.023104966666666671 -0.76753243870691568 0.64046221897630617 0.026497199787162903
+-0.58582466666666677 0.78833399999999998 -0.18632033333333334 -0.57988023189536386 0.79241984688079392 -0.18923451832685864
+-0.57315533333333335 0.78686166666666668 -0.22737200000000002 -0.56988232116554483 0.79088056821078345 -0.22302929594463394
+-0.52068599999999998 0.80599766666666672 -0.28034733333333334 -0.51732881626734317 0.81023565728700142 -0.27547971889075634
+-0.55890933333333337 0.78424633333333327 -0.26818333333333338 -0.55566098937893804 0.78851015439986161 -0.26361449370382906
+-0.56752666666666662 0.72956600000000005 -0.38073966666666664 -0.57445758132119618 0.7257323266893434 -0.37856449550991078
+-0.58478433333333335 0.7359429999999999 -0.34020366666666674 -0.58183870110532543 0.74073627898260141 -0.33581764530035857
+-0.63670666666666664 0.71672566666666671 -0.28326633333333334 -0.63896671989407539 0.71787542780718161 -0.2763628068652913
+-0.60073866666666664 0.74090699999999998 -0.29917166666666667 -0.60310957117011221 0.74208291099934309 -0.29252657719555042
+-0.92738500000000013 0.14052333333333333 -0.34578333333333333 -0.93265246963949344 0.14159484160179467 -0.33182867824694795
+-0.95314033333333337 0.10487713333333333 -0.28260466666666667 -0.9575696903435692 0.10517623583484231 -0.26832489178407298
+-0.94127266666666676 0.14291733333333334 -0.30483500000000002 -0.93928466319806303 0.14964084471225736 -0.30879109293291357
+-0.92568533333333336 0.10143216666666666 0.36358533333333326 -0.923820067450836 0.1080259060886271 0.36726950130505531
+-0.92738500000000013 0.14052333333333333 0.34578333333333333 -0.92745409669571854 0.13452325524080155 0.34890169435207236
+-0.91087466666666661 0.21552966666666665 0.35099133333333327 -0.90877103811651971 0.21458513885150166 0.35789442362895907
+-0.92716333333333323 0.17985566666666666 0.32766433333333334 -0.92525904843422668 0.17910077093038013 0.33439289337952871
+-0.56752666666666673 0.72956600000000005 0.38073966666666664 -0.56463019666820546 0.7345672394300764 0.37630268636630887
+-0.54906133333333329 0.72168266666666658 0.42072933333333334 -0.54621533469650274 0.72689965048017446 0.4162519744988456
+-0.54826399999999997 0.67978466666666681 0.48641133333333331 -0.55170269878735689 0.68190885068557827 0.48023374673946079
+-0.52944599999999997 0.71225633333333338 0.46008566666666662 -0.53274155487270891 0.71422300523490279 0.45395146712510209
+-0.95597666666666659 0.21201066666666665 0.20118666666666665 -0.95690704317590158 0.20579936405970636 0.20487931196920214
+-0.96388766666666659 0.21337133333333336 0.15716566666666665 -0.96498961593619303 0.20708100103663682 0.16097360077038458
+-0.72956600000000005 0.38073966666666664 0.56752666666666673 -0.7345672394300764 0.37630268636630887 0.56463019666820546
+-0.72168266666666658 0.42072933333333334 0.54906133333333329 -0.72689965048017446 0.41625197449884566 0.54621533469650274
+-0.67978466666666681 0.48641133333333331 0.54826399999999997 -0.68190885068557827 0.48023374673946079 0.55170269878735689
+-0.71225633333333338 0.46008566666666662 0.52944599999999997 -0.71422300523490267 0.45395146712510204 0.5327415548727088
+-0.58744933333333327 0.69894066666666665 0.40705300000000005 -0.59041897341165617 0.70066437394497161 0.40059314886780978
+-0.62454900000000002 0.67502866666666661 0.39189600000000002 -0.6274157295105669 0.67671755114831234 0.38523091559550915
+-0.67640700000000009 0.6563119999999999 0.33322933333333332 -0.67432926819010985 0.65519559013054052 0.3405859314999426
+-0.66024300000000002 0.64999866666666672 0.37535166666666669 -0.65786067131660153 0.64872408443505791 0.3825916875845139
+-0.81723666666666672 0.57523666666666662 0.023299466666666668 -0.81373864287838205 0.58061392593956873 0.026774803295076158
+-0.83792066666666665 0.54315766666666665 0.046653833333333332 -0.83448744125968655 0.5487362569508325 0.05019193847074753
+-0.87771233333333332 0.47617466666666663 0.046646866666666668 -0.87508176244013969 0.48205910673978014 0.043022397119454811
+-0.85703933333333326 0.50979200000000002 0.069971699999999998 -0.85433531332205448 0.5154624737890986 0.066404898359456094
+-0.95051300000000005 0.25157233333333334 0.18039633333333335 -0.94959360307011542 0.25112435222994373 0.18763941143962024
+-0.93505400000000005 0.28885866666666665 0.203819 -0.93397663141277909 0.28826917001433577 0.21115998104300893
+-0.90660333333333332 0.32204199999999999 0.2714273333333333 -0.90873512286035008 0.32318891316129489 0.26410112246941597
+-0.91756233333333326 0.32513833333333331 0.22731633333333334 -0.91941515130072438 0.32608678172641187 0.21987084923194722
+-0.48641133333333331 0.54826399999999997 0.67978466666666681 -0.48023374673946173 0.55170269878735756 0.68190885068557705
+-0.46008566666666662 0.52944599999999997 0.71225633333333338 -0.46497084928401095 0.53268824672673931 0.70713884146983341
+-0.69894066666666665 0.40705300000000005 0.58744933333333327 -0.70066437394497161 0.40059314886780972 0.59041897341165606
+-0.67502866666666661 0.39189600000000002 0.62454900000000002 -0.67671755114831245 0.3852309155955092 0.6274157295105669
+-0.6563119999999999 0.33322933333333332 0.67640700000000009 -0.65519559013054052 0.3405859314999426 0.67432926819010985
+-0.64999866666666672 0.37535166666666669 0.66024300000000002 -0.64872408443505791 0.3825916875845139 0.65786067131660153
+-0.93375666666666657 0.32944800000000002 -0.13732900000000001 -0.93569239277978344 0.32338590283165708 -0.1410719814272042
+-0.92663333333333331 0.32759366666666662 -0.18257666666666669 -0.92838638141934404 0.3215918038699474 -0.18621879195926974
+-0.83902233333333331 0.54346033333333332 1.1564823173178713e-18 -0.83581239393805806 0.54900373123283785 0.0035419248939295113
+-0.83792066666666676 0.54315766666666665 -0.046653833333333339 -0.83448744125968544 0.54873625695083406 -0.050191938470748536
+-0.81060299999999996 0.57337433333333332 -0.11609513333333332 -0.81516384919802287 0.56816097492600259 -0.11269873793347154
+-0.83464800000000006 0.54221033333333335 -0.093158400000000016 -0.83892675353125457 0.53681230026146276 -0.089635129818094392
+-0.58744933333333327 0.69894066666666665 -0.40705300000000005 -0.59423116751119709 0.69500052876707574 -0.4048006726424313
+-0.60522600000000004 0.70626633333333333 -0.36633966666666667 -0.60795094672564576 0.70779537966296169 -0.35975178512851724
+-0.62454900000000002 0.67502866666666661 -0.39189600000000002 -0.62741572951056634 0.67671755114831378 -0.38523091559550776
+-0.64266266666666672 0.64228433333333335 -0.41684100000000002 -0.64904701109747098 0.63801410392828295 -0.41433800281174993
+-0.38367900000000005 0.74262333333333341 0.5482703333333333 -0.39116371642590253 0.74786225232639714 0.5363702065711371
+-0.40315966666666664 0.71069466666666659 0.57591066666666657 -0.4108886401027837 0.71616865610076674 0.56415687663389058
+-0.46257966666666661 0.65831733333333331 0.59323799999999993 -0.4589162595376976 0.6561049344014962 0.59910114487116173
+-0.42151733333333335 0.67719066666666661 0.60252166666666662 -0.42456563876750142 0.67153860466225002 0.60727252599324932
+-0.78833399999999998 0.18632033333333334 0.58582466666666677 -0.79241984688079592 0.18923451832685775 0.57988023189536142
+-0.78873800000000005 0.14520933333333333 0.59682866666666667 -0.79283859219124986 0.14819581080877822 0.59113870486623177
+-0.80904799999999988 0.080161999999999997 0.58178533333333327 -0.81279318645478138 0.083207446503565236 0.57657935871746147
+-0.78831566666666664 0.10404483333333332 0.60592866666666667 -0.79232113178228425 0.10712457526959689 0.60062596472725738
+-0.38578466666666666 0.91196566666666667 0.13735133333333335 -0.38170698678408727 0.91489615052823059 0.13139562393336282
+-0.42467100000000002 0.89513766666666672 0.13334799999999999 -0.42068224010972921 0.8981888517078197 0.12760579737632846
+-0.47605000000000003 0.87439566666666668 0.090921466666666673 -0.47213747213919743 0.87734060758261101 0.085788493917212008
+-0.46239333333333338 0.87702533333333343 0.12820000000000001 -0.45849305759258224 0.88016659891075488 0.12284491972108272
+-0.66111533333333339 0.7498826666666667 1.1564823173178713e-18 -0.66161565731528682 0.74980409650499436 -0.0076510691795381152
+-0.65962500000000002 0.74992800000000004 0.043603633333333336 -0.66045762513433848 0.74999913909909399 0.036014118794267365
+-0.67900399999999994 0.72532733333333332 0.11055603333333335 -0.68027853678687666 0.72566683621403705 0.10309585445698602
+-0.65521533333333337 0.7500119999999999 0.086990833333333337 -0.65638577782881369 0.75021718069676646 0.079573189275400455
+-0.8741593333333334 0.448237 0.18500266666666665 -0.87226383732852775 0.45409049572763344 0.18154233605069586
+-0.85947633333333329 0.48395833333333332 0.16242533333333331 -0.85729015236698924 0.48968695293830161 0.15893483814628531
+-0.54990566666666663 0.81053333333333333 -0.20004 -0.55650732236296829 0.80686525433351164 -0.19816170544713457
+-0.51483299999999999 0.85042666666666678 -0.10573533333333333 -0.52098864538413292 0.84714907157637964 -0.10444750790748547
+-0.50254100000000002 0.852213 -0.14353533333333332 -0.50896696988675449 0.84897311065938064 -0.14211713809963461
+-0.60594999999999999 0.69364366666666666 -0.38857199999999997 -0.60878046227242755 0.69527367312307187 -0.38207442758881577
+-0.40237200000000001 0.90979499999999991 0.098831166666666651 -0.40597625682229971 0.90779782046843382 0.10529195624222863
+-0.58757233333333325 0.68550100000000003 -0.4291213333333333 -0.60010626624401753 0.67813792847666066 -0.42426574122364386
+-0.38106733333333337 0.92208600000000007 0.062795833333333342 -0.3846570304796883 0.92045209254229532 0.069331913553990904
+-0.32170033333333331 0.94615333333333329 0.025922166666666666 -0.33489551984912225 0.94191163998673699 0.025445102524492232
+-0.36080433333333334 0.93196800000000002 0.0254641 -0.36431486214481984 0.93072619151734937 0.031991211980967785
+-0.52997433333333333 0.84764833333333334 0.015967733333333334 -0.53582528751528857 0.84418786852804661 0.015430615322529994
+-0.36358533333333337 0.92568533333333336 -0.10143216666666667 -0.36726950130505548 0.92382006745083589 -0.10802590608862792
+-0.55563600000000002 0.83115833333333333 0 -0.56493884084547652 0.82513278089297204 -4.8139625934572138e-15
+-0.38106733333333337 0.92208600000000007 -0.062795833333333329 -0.38465703047968858 0.92045209254229521 -0.069331913553990418
+-0.57604433333333327 0.81494699999999998 -0.059267866666666662 -0.57105803285634704 0.81853487189697649 -0.062397007931786277
+-0.43467066666666665 0.8999693333333334 -0.023969299999999999 -0.43778575898804439 0.89857223759622595 -0.030192102420559901
+-0.58062966666666671 0.81361933333333336 -0.019809433333333331 -0.58189096904843107 0.81316353437949784 -0.012960188861321678
+-0.39849600000000002 0.91651633333333338 -0.024812700000000004 -0.40185500805245644 0.915171589304688 -0.031201196013799438
+-0.54633266666666669 0.8181653333333333 -0.17754333333333336 -0.55294580946744287 0.81448691874194379 -0.17567581219578471
+-0.56228400000000001 0.81096399999999991 0.15991200000000003 -0.55631566138133393 0.81488320691282423 0.1627213691969199
+-0.55811400000000011 0.81788833333333333 -0.137791 -0.55215961732090557 0.82177650837133309 -0.14072358469372334
+-0.52627699999999999 0.83234166666666665 0.17215800000000001 -0.53285688470931325 0.82885946709064051 0.17045681045973243
+-0.60036900000000004 0.79510999999999987 -0.082435966666666666 -0.59527376626746875 0.79895366475196428 -0.085569765531693417
+-0.47419900000000004 0.85190366666666673 0.22082566666666667 -0.48098951346609398 0.84883685748693138 0.21937428588456132
+-0.56820133333333334 0.81665133333333328 -0.098415533333333347 -0.56255375688704445 0.82049991190666305 -0.10155375509271103
+-0.48899699999999996 0.85274033333333332 0.18195600000000001 -0.49563977507792489 0.84956016905264986 0.18052349575591767
+-0.74262333333333341 0.5482703333333333 0.38367900000000005 -0.74061277632469169 0.55398308333902357 0.38025709581652889
+-0.71069466666666659 0.57591066666666657 0.40315966666666664 -0.708546009052897 0.58161318657068906 0.39961062831498956
+-0.45581200000000005 0.85766166666666666 -0.23665966666666663 -0.46266802420794495 0.85473908320643333 -0.23528578158261554
+-0.65831733333333331 0.59323799999999993 0.46257966666666661 -0.6561049344014962 0.59910114487116173 0.4589162595376976
+-0.41561399999999998 0.87583766666666663 -0.24396433333333331 -0.42522044230301215 0.87361769644806653 -0.23660028719425635
+-0.67719066666666661 0.60252166666666662 0.42151733333333335 -0.67491424805509503 0.60820598850026464 0.41782320821687419
+-0.5698266666666667 0.79545466666666664 -0.20475399999999999 -0.57183818311343537 0.79603524377618062 -0.19831536249045836
+-0.42592233333333329 0.72526299999999999 0.54026033333333323 -0.42958194071176437 0.72767861204289574 0.53473656485192689
+-0.53302133333333324 0.81731666666666669 -0.21738166666666667 -0.52957076434678196 0.82117934975840745 -0.21264825670464432
+-0.44788500000000003 0.73833599999999999 0.50354433333333326 -0.45138676422756718 0.74054950290021937 0.49783172140232762
+-0.47139533333333333 0.85913866666666661 -0.19760733333333333 -0.47812770940072347 0.85609518430535181 -0.19620124595017999
+-0.44803333333333334 0.77925900000000003 0.43740800000000002 -0.45122962594317989 0.78110031861947005 0.43159485275399229
+-0.49497199999999997 0.83811233333333324 -0.22790133333333332 -0.49139120814526255 0.84194317261708629 -0.22285954016154333
+-0.46898966666666669 0.74988700000000008 0.46585133333333334 -0.47230309114310021 0.75188318294279199 0.46000159706732352
+-0.93953100000000001 -0.012861600000000001 0.34131833333333333 -0.94005100311840917 0 0.34103388619911745
+-0.8999693333333334 -0.023969299999999999 0.43467066666666665 -0.89641650563157604 -0.017885401699656269 0.4428516239524436
+-0.91651633333333338 -0.024812700000000004 0.39849600000000002 -0.91389284750939048 -0.025174534648851492 0.40517416758277142
+-0.81096399999999991 0.15991200000000003 0.56228400000000001 -0.81488320691282601 0.16272136919691735 0.55631566138133204
+-0.83234166666666665 0.17215800000000001 0.52627699999999999 -0.82885946709064051 0.17045681045973182 0.53285688470931347
+-0.85190366666666673 0.22082566666666667 0.47419900000000004 -0.84883685748693138 0.21937428588456132 0.48098951346609398
+-0.85274033333333332 0.18195600000000001 0.48899699999999996 -0.84956016905264986 0.18052349575591767 0.49563977507792489
+-0.5482703333333333 0.38367900000000005 0.74262333333333341 -0.56022334572548227 0.37591850110522268 0.7381294489660668
+-0.57591066666666657 0.40315966666666664 0.71069466666666659 -0.58161318657068917 0.39961062831498956 0.708546009052897
+-0.59323799999999993 0.46257966666666661 0.65831733333333331 -0.59910114487116184 0.45891625953769766 0.65610493440149631
+-0.60252166666666662 0.42151733333333335 0.67719066666666661 -0.60820598850026475 0.41782320821687419 0.67491424805509515
+-0.72526299999999999 0.54026033333333323 0.42592233333333329 -0.72767861204289574 0.53473656485192689 0.42958194071176437
+-0.73833599999999999 0.50354433333333326 0.44788500000000003 -0.74054950290021926 0.49783172140232762 0.45138676422756718
+-0.77925900000000003 0.43740800000000002 0.44803333333333334 -0.78110031861947005 0.43159485275399234 0.45122962594317989
+-0.74988700000000008 0.46585133333333334 0.46898966666666669 -0.75188318294279199 0.46000159706732352 0.47230309114310021
+-0.91196566666666667 0.13735133333333335 0.38578466666666666 -0.91489615052823059 0.13139562393336282 0.38170698678408727
+-0.89513766666666672 0.13334799999999999 0.42467100000000002 -0.8981888517078197 0.12760579737632846 0.42068224010972921
+-0.87439566666666668 0.090921466666666673 0.47605000000000003 -0.87734060758261101 0.085788493917212008 0.47213747213919743
+-0.87702533333333343 0.12820000000000001 0.46239333333333338 -0.88016659891075488 0.12284491972108273 0.4584930575925823
+-0.75636666666666663 0.51228966666666664 -0.4059166666666667 -0.75865329835647843 0.5067472582234922 -0.40945376927781429
+-0.73833599999999999 0.50354433333333326 -0.44788500000000003 -0.74158633826808484 0.50561065077724099 -0.4409167412502597
+-0.58582466666666677 0.78833399999999998 0.18632033333333334 -0.57988023189535964 0.7924198468807967 0.18923451832686014
+-0.59682866666666667 0.78873800000000005 0.14520933333333333 -0.5911387048662301 0.79283859219125141 0.14819581080877617
+-0.58178533333333327 0.80904799999999988 0.080161999999999997 -0.57657935871746147 0.81279318645478138 0.083207446503565236
+-0.60592866666666667 0.78831566666666664 0.10404483333333332 -0.60062596472725738 0.79232113178228425 0.1071245752695969
+-0.59682866666666667 0.78873800000000005 -0.14520933333333333 -0.59113870486622888 0.79283859219125252 -0.14819581080877534
+-0.72526299999999999 0.54026033333333334 -0.42592233333333329 -0.72767861204289241 0.53473656485192844 -0.42958194071176797
+-0.71069466666666659 0.57591066666666668 -0.40315966666666664 -0.70854600905289511 0.58161318657069216 -0.39961062831498856
+-0.71068766666666672 0.6169296666666666 -0.33708266666666664 -0.70828943337678218 0.62222522892875576 -0.33340942255934275
+-0.69467099999999993 0.61040833333333333 -0.37964866666666669 -0.69233584091762446 0.61589682358755293 -0.37595503198607222
+-0.68725733333333328 0.72564533333333336 -0.022199266666666665 -0.68790368117369138 0.72565832946335795 -0.0144400245198193
+-0.65962500000000002 0.74992800000000004 -0.043603633333333336 -0.66045762513433692 0.7499991390990951 -0.036014118794271847
+-0.60575433333333339 0.794234 -0.041378733333333334 -0.60677526245756808 0.79413092226005266 -0.03434907829837075
+-0.63074133333333338 0.77298066666666665 -0.063896999999999995 -0.6318110775202368 0.77305026458344039 -0.056639657045134018
+-0.40237200000000001 0.90979500000000002 -0.098831166666666678 -0.4059762568223006 0.90779782046843327 -0.10529195624223014
+-0.42467100000000002 0.89513766666666672 -0.13334799999999999 -0.42068224010972916 0.89818885170781948 -0.12760579737632941
+-0.99349399999999999 0.10851619999999999 -0.022237466666666667 -0.99366413966331857 0.10853012501892692 -0.029202559999646969
+-0.98750233333333337 0.148782 -0.044724966666666664 -0.98751754500301114 0.14875603742522206 -0.051775859633345515
+-0.97215366666666669 0.22839699999999996 -0.045218333333333333 -0.97216451120541103 0.22834695483901651 -0.052476960358736502
+-0.97937533333333315 0.18860866666666665 -0.067428200000000008 -0.97923504472179446 0.18851326331065299 -0.074575309216078592
+-0.86488299999999996 0.44522266666666671 0.23033366666666666 -0.86718072358672216 0.43967029351048176 0.23385385531142255
+-0.88711800000000007 0.41159166666666663 0.20715033333333333 -0.88928944660465614 0.4059111746818222 0.21071402047801124
+-0.91466100000000006 0.37891566666666671 0.13824433333333333 -0.91689163039086208 0.37305445430029116 0.14191586326376218
+-0.90747233333333333 0.37685399999999997 0.18377033333333334 -0.90952132795887353 0.37102658099972141 0.18737724029236921
+-0.98849733333333323 0.14889633333333332 -1.1564823173178713e-18 -0.98881853925647345 0.14895675499016464 -0.0070556052535643982
+-0.98750233333333337 0.148782 0.044724966666666664 -0.98751754500301092 0.14875603742522195 0.051775859633347958
+-0.98758800000000002 0.10800340000000001 0.11095060000000001 -0.98715914492012036 0.10787007612224334 0.1178171009571965
+-0.98452266666666655 0.14843300000000001 0.089341133333333336 -0.98423575270793739 0.14831702844712868 0.096343355578128551
+-0.37950966666666663 0.86683433333333326 0.32232633333333333 -0.38258934313579762 0.86803909017894487 0.31643882890730773
+-0.36019033333333333 0.85979766666666668 0.36100666666666664 -0.3675745341215505 0.85758746356507642 0.35976756969096546
+-0.362674 0.82594966666666669 0.4307913333333333 -0.37670864323402198 0.82110212139525307 0.42881453374739692
+-0.97972166666666671 -0.026782933333333332 0.19685366666666668 -0.97844680898053793 -0.027139122204929943 0.20470786511941458
+-0.9873993333333333 -0.026941300000000001 0.15372666666666668 -0.98646689731815052 -0.027323269255811418 0.16166786771859171
+-0.99567566666666674 0.013556566666666667 0.088052033333333335 -0.99539188988286775 0.013538437507782957 0.094929954520481544
+-0.99320699999999995 -0.027062466666666663 0.11007063333333333 -0.99262536964779458 -0.027448998744322078 0.11807382436219034
+-0.99017999999999995 0.13544999999999999 0.022326099999999998 -0.99034549974472819 0.13546610395069736 0.029406220698746464
+-0.99414233333333335 0.094949566666666665 0.044384866666666668 -0.99415826351618952 0.09492444190745418 0.051368252949006939
+-0.9985909999999999 0.013590633333333333 0.044029100000000009 -0.99861153173989292 0.01358945587142231 0.050895337362310569
+-0.99597933333333322 0.054270233333333334 0.066234899999999999 -0.99584388442193827 0.054237984373482949 0.073165558226034058
+-0.82594966666666669 0.4307913333333333 0.362674 -0.82785431066039616 0.42508009428749394 0.36601113884899122
+-0.85106633333333337 0.39919166666666667 0.34005899999999994 -0.85280497080606454 0.39346996082837155 0.34337307945467582
+-0.74024633333333334 0.51888433333333328 0.42672700000000002 -0.74257141516746727 0.51324151458922507 0.43031481624311191
+-0.77051866666666669 0.49050400000000005 0.40621499999999999 -0.77270320478273313 0.48485766119619816 0.40968622834780072
+-0.81468733333333343 0.46787466666666666 0.34159100000000003 -0.8168231817552648 0.46233366051553543 0.34503257252252489
+-0.79909666666666668 0.46117466666666668 0.38479733333333338 -0.80114527169293681 0.45549482658489687 0.38818902173869541
+-0.9840779999999999 -0.0134354 0.17529833333333333 -0.98521551962444398 -0.0067284410507964494 0.17118734758200649
+-0.71838866666666679 0.65739499999999995 0.22599133333333332 -0.71553780893610663 0.66226771662737915 0.22227711419773558
+-0.9873993333333333 0.026941300000000001 0.15372666666666665 -0.98667240814492363 0.026890596352768442 0.16048194550568526
+-0.73784766666666657 0.62639233333333333 0.25005566666666668 -0.73520009164158984 0.63148093086238388 0.24639938962459892
+-0.97958233333333344 0.14785633333333334 0.13365466666666667 -0.98035278201893183 0.14140532735560749 0.13752438395860647
+-0.80106633333333332 0.53071599999999997 0.27557166666666671 -0.7989719161796639 0.536265657645561 0.27214522150162812
+-0.97273166666666666 0.14706466666666665 0.17742433333333332 -0.97332507116728162 0.14069236473595817 0.18122903835260593
+-0.81243133333333339 0.53480433333333333 0.23075133333333331 -0.8101700112367497 0.54034534738107576 0.22726957221825661
+-0.84005133333333337 0.33887933333333331 -0.42284533333333335 -0.84320163302342188 0.34078478283065056 -0.4157844848689054
+-0.83285633333333342 0.37765766666666667 -0.4037823333333333 -0.8343824500435969 0.37181688618420933 -0.40688835103443721
+-0.83950633333333335 0.42241299999999998 -0.34073899999999996 -0.84139072144433491 0.41671320306238774 -0.3441100990393437
+-0.82400366666666669 0.41591733333333331 -0.38384699999999999 -0.82578576083367294 0.41017013682103337 -0.38708957111315551
+-0.87569633333333341 0.43517099999999997 -0.207564 -0.87802007925767067 0.42952993482460028 -0.21115107271792039
+-0.86546833333333328 0.43182166666666671 -0.25258333333333333 -0.86762894089824827 0.42618611131614031 -0.25609650414835899
+-0.82827800000000007 0.4594753333333334 -0.31960100000000002 -0.8304139645378581 0.45393507348914391 -0.32304116851714487
+-0.85336699999999999 0.42763400000000001 -0.29698633333333335 -0.8553833832274883 0.42197135721665091 -0.30043209114046621
+-0.74517200000000006 0.6408423333333334 -0.18265566666666666 -0.74224043434856068 0.64576760458469673 -0.17906238713644693
+-0.76478933333333332 0.60974166666666674 -0.20646366666666668 -0.76208480428307168 0.61485905697699661 -0.20291646343801342
+-0.77153066666666659 0.5732626666666667 -0.27462199999999998 -0.7691811662928385 0.57868388027417195 -0.27108172223744026
+-0.78303900000000004 0.5772896666666667 -0.22998833333333332 -0.7805596921302298 0.58261180697286785 -0.22647306550089036
+-0.72644833333333336 0.55500833333333321 -0.40440066666666663 -0.72439943030853671 0.56081299478492408 -0.40091676224502282
+-0.74308733333333332 0.56231999999999993 -0.36183000000000004 -0.74095857789011721 0.56796520450867349 -0.35832375349462364
+-0.78747599999999995 0.53911566666666666 -0.29756200000000005 -0.78538004564948882 0.54467029029810377 -0.29413000316558346
+-0.75816133333333335 0.56834533333333326 -0.31856266666666672 -0.75591839905677671 0.57388445654331854 -0.31503016443734327
+-0.97972166666666671 0.026782933333333332 -0.19685366666666668 -0.97903891595984682 0.033539917629471783 -0.2008926951423978
+-0.9873993333333333 0.026941300000000001 -0.15372666666666668 -0.98667240814492363 0.026890596352768366 -0.1604819455056852
+-0.99567566666666674 -0.013556566666666667 -0.088052033333333335 -0.99645037790286128 -0.0067825110210987917 -0.083908533067223873
+-0.99320699999999995 0.027062466666666663 -0.11007063333333333 -0.99277645957187444 0.027023373377348336 -0.11689584514106015
+-0.9985909999999999 -0.013590633333333333 -0.044029100000000009 -0.99881287530810392 -0.0068038108128188786 -0.048234306019487111
+-0.85702366666666663 0.34606799999999999 -0.38087633333333332 -0.85837763506900822 0.3402100303585775 -0.38398563886785186
+-0.8793616666666666 0.31327633333333332 -0.35763733333333336 -0.88205972540034017 0.31481725442731096 -0.35051495993969534
+-0.90397933333333336 0.24023133333333332 -0.35277166666666665 -0.90184935426715007 0.23919234458256397 -0.35979822748454465
+-0.89978666666666662 0.27934999999999999 -0.33417800000000003 -0.89777797192039699 0.2783212344704471 -0.34136784203750853
+-0.92134066666666659 0.20500533333333334 -0.32930966666666667 -0.91939394482786752 0.20415305190362462 -0.33620872328404577
+-0.90640266666666669 0.20096933333333333 -0.37067 -0.9090221925572588 0.20849605940253854 -0.36084352100599926
+-0.40261533333333333 0.84358833333333338 0.3543716666666667 -0.40567559458008401 0.84497406496934002 0.34849123588877379
+-0.44426433333333337 0.82582333333333324 0.34636500000000003 -0.44788120365419287 0.82188455470053834 0.35200597460550193
+-0.50220666666666669 0.81162366666666663 0.29731033333333334 -0.49883260789314809 0.81591989161691847 0.29230251412938058
+-0.48500100000000002 0.80657299999999987 0.33695900000000001 -0.48167303761240987 0.81106618862543955 0.33190770178746504
+-0.54111533333333328 0.79043766666666659 0.285908 -0.53782883589854502 0.79478643964980356 0.28116660296842705
+-0.51826699999999992 0.8151826666666665 0.25734633333333329 -0.51483738173932114 0.81927210874247614 0.25245926839879901
+-0.71510766666666681 0.66833066666666652 -0.20317933333333335 -0.71214652401015688 0.67309545366944323 -0.19947390453334365
+-0.72425300000000004 0.67053999999999991 -0.15863733333333332 -0.7296647789377706 0.66585752370229223 -0.15563761918876087
+-0.75888966666666668 0.644177 -0.091938833333333345 -0.75461173338973031 0.64921606847318236 -0.095287083420423052
+-0.73132766666666671 0.67199433333333325 -0.11367523333333333 -0.72672368166859569 0.67689322828463949 -0.11699678629962644
+-0.83168433333333336 0.55413233333333334 -0.023326566666666663 -0.82834740396313333 0.55957288650226811 -0.026809756415478874
+-0.80900833333333333 0.5853666666666667 -0.046535399999999998 -0.80536664437786842 0.59066725196862724 -0.049967645285346952
+-0.76245399999999997 0.64488299999999998 -0.046073400000000007 -0.75844767523465539 0.64985474643003172 -0.049456369392685988
+-0.78476100000000004 0.61534100000000003 -0.069477033333333341 -0.78081027126240599 0.62050512688950177 -0.072860879729599884
+-0.35277166666666665 0.90397933333333336 -0.24023133333333332 -0.35884953293333854 0.90540314548384249 -0.22687476030067502
+-0.40431166666666668 0.90593933333333332 -0.12329633333333334 -0.40021859160024631 0.90887682535716718 -0.11733710097915648
+-0.38781933333333335 0.90705666666666662 -0.16191933333333333 -0.39436940024219586 0.90473780623552025 -0.1610039692701673
+-0.37067 0.90640266666666669 -0.20096933333333333 -0.37452548842842248 0.90371268663343907 -0.20744647149378848
+-0.42130033333333339 0.84991400000000006 0.31540433333333334 -0.42422166270159223 0.85104278700009928 0.3094546099023251
+-0.39799066666666666 0.87218166666666674 0.28325866666666671 -0.39102043340789627 0.87515194316742995 0.28497736230755671
+-0.33260966666666664 0.90763266666666664 0.25476333333333329 -0.34273989784634673 0.90618364900595938 0.24771063097598361
+-0.3744993333333333 0.89252600000000004 0.24997166666666668 -0.38154197856914401 0.8902251303593165 0.2488472139009815
+-0.30914666666666668 0.9250423333333333 0.21922133333333335 -0.31708091584157094 0.91986749040706861 0.23087549220580375
+-0.38235766666666665 0.91950733333333334 0.08777366666666668 -0.38603366980132137 0.91764343429393269 0.094385026762517532
+-0.34321000000000002 0.93462666666666661 0.089739633333333332 -0.34697098790484687 0.9329023422143834 0.096459076520834311
+-0.72845533333333334 0.66008133333333341 0.18158266666666667 -0.72544745530847643 0.66487474133902336 0.17795383647402202
+-0.69767499999999993 0.68696599999999997 0.20164099999999999 -0.69650390892021663 0.68635276333029871 0.20928972532764595
+-0.65288666666666673 0.70969066666666658 0.26345566666666664 -0.65501968417060419 0.71076863277450397 0.25643159714220903
+-0.66528666666666669 0.71280966666666679 0.22053199999999998 -0.66719302095845745 0.71368475232804907 0.21332497996900987
+-0.60594999999999999 0.69364366666666666 0.38857199999999997 -0.60878046227242899 0.69527367312307142 0.38207442758881438
+-0.62304033333333342 0.70030133333333333 0.3474376666666667 -0.62562797974048401 0.70174682321566206 0.34079469930233214
+-0.61778100000000002 0.73429599999999995 0.28015933333333337 -0.62004007182029142 0.73539666254061653 0.27338993774682063
+-0.63873966666666671 0.70558766666666661 0.30574499999999999 -0.64109301993334877 0.70685708038104444 0.29891940001934414
+-0.9840779999999999 0.0134354 0.17529833333333333 -0.98320307150509523 0.013404506121270485 0.1820220849199112
+-0.97857266666666665 0.053538400000000007 0.1971103333333333 -0.979324934656573 0.060177193173974249 0.19313564606669897
+-0.96046299999999996 0.092355799999999988 0.26138033333333338 -0.9603910423236186 0.08592826281060327 0.26507617673964096
+-0.97088433333333324 0.093213466666666675 0.21914 -0.97096749167518503 0.086713040544329462 0.22294164866519872
+-0.91950733333333334 0.08777366666666668 0.38235766666666665 -0.91764343429393269 0.094385026762517532 0.38603366980132137
+-0.93462666666666661 0.089739633333333332 0.34321000000000002 -0.93431304332940213 0.083562648426005665 0.34652044795737857
+-0.94964533333333334 0.13090333333333334 0.28351199999999999 -0.94977514119533712 0.12461157419779904 0.28705249823564311
+-0.9483233333333333 0.091219933333333336 0.30284166666666668 -0.94812943316726528 0.084897429891930984 0.30633805568303907
+-0.68696599999999997 0.20164099999999999 0.69767499999999993 -0.69662025032073494 0.19323465497063358 0.69092734419869128
+-0.70969066666666658 0.26345566666666664 0.65288666666666673 -0.71076863277450408 0.25643159714220909 0.6550196841706043
+-0.71280966666666679 0.22053199999999998 0.66528666666666669 -0.71368475232804918 0.21332497996900987 0.66719302095845745
+-0.69364366666666666 0.38857199999999997 0.60594999999999999 -0.69527367312307142 0.38207442758881438 0.60878046227242899
+-0.70030133333333333 0.3474376666666667 0.62304033333333342 -0.70174682321566206 0.34079469930233214 0.62562797974048401
+-0.73429599999999995 0.28015933333333337 0.61778100000000002 -0.73539666254061653 0.27338993774682063 0.62004007182029142
+-0.70558766666666661 0.30574499999999999 0.63873966666666671 -0.70685708038104444 0.29891940001934414 0.64109301993334866
+-0.84358833333333338 0.3543716666666667 0.40261533333333333 -0.84497406496934002 0.34849123588877379 0.40567559458008401
+-0.82582333333333324 0.34636500000000003 0.44426433333333337 -0.82188455470053834 0.35200597460550193 0.44788120365419287
+-0.81162366666666663 0.29731033333333334 0.50220666666666669 -0.81591989161691847 0.29230251412938058 0.49883260789314809
+-0.80657299999999987 0.33695900000000001 0.48500100000000002 -0.81106618862543955 0.33190770178746498 0.48167303761240993
+-0.8181653333333333 0.17754333333333336 0.54633266666666669 -0.81448691874194223 0.17567581219578526 0.55294580946744487
+-0.81731666666666669 0.21738166666666667 0.53302133333333324 -0.82117934975840645 0.21264825670464366 0.52957076434678363
+-0.79043766666666659 0.285908 0.54111533333333328 -0.79478643964980356 0.2811666029684271 0.53782883589854502
+-0.8151826666666665 0.25734633333333329 0.51826699999999992 -0.81927210874247614 0.25245926839879901 0.51483738173932114
+-0.74868333333333326 0.62970633333333337 0.20557800000000001 -0.74587853360328382 0.63471859439677514 0.20198395737482966
+-0.75754100000000013 0.63220766666666661 0.16052666666666668 -0.76269529192907415 0.62731830658435561 0.15737736143855202
+-0.74243766666666655 0.66315266666666661 0.091391999999999987 -0.7380201623109971 0.66809911774214681 0.094709075038321919
+-0.76435100000000011 0.63392533333333334 0.11503839999999999 -0.75999418759786697 0.63905202783527448 0.11841174155075082
+-0.66962899999999992 0.74196399999999996 0.021954166666666667 -0.67028755876104185 0.74196595278651578 0.014181448295595584
+-0.69494100000000003 0.71724500000000013 0.044609500000000003 -0.69058513447234893 0.72166551516255684 0.047864979588098266
+-0.74612066666666665 0.66373699999999991 0.045797666666666674 -0.74198240659209025 0.66861355370751385 0.049173408529605271
+-0.71923599999999999 0.69097666666666668 0.067828766666666665 -0.71484071533694804 0.69565931898028299 0.071139747064838055
+-0.44099433333333332 0.84560366666666675 -0.29968466666666665 -0.44669675023868344 0.847564540632879 -0.28652462858884598
+-0.50412633333333334 0.80162933333333319 -0.32027700000000003 -0.50335093264587394 0.8069158784614664 -0.30907054808132195
+-0.48135633333333333 0.82648499999999991 -0.29078700000000002 -0.47787127089350295 0.83068865576297879 -0.28564909529232502
+-0.56820666666666664 0.71697033333333327 -0.40298833333333334 -0.58093846961652296 0.70982246495114332 -0.39832469515496399
+-0.54774466666666666 0.7468366666666667 -0.37619833333333336 -0.56066025968805722 0.73992724229620144 -0.37170922683524893
+-0.54323266666666659 0.78036933333333336 -0.30863433333333329 -0.54003468947667976 0.78483938517234042 -0.30395669698845057
+-0.52632333333333337 0.77506433333333324 -0.34868433333333332 -0.53939307913484291 0.76838593694752411 -0.34443890326545362
+-0.73524766666666663 0.6380096666666667 -0.22731699999999999 -0.73247878998148919 0.64299905357400278 -0.22366725135832943
+-0.70400200000000002 0.66529633333333327 -0.24715366666666663 -0.70252952126911361 0.66450329097410654 -0.25473054004177048
+-0.65008200000000005 0.72023166666666671 -0.24082699999999999 -0.65209324997457174 0.72120350456889659 -0.23375178787581957
+-0.67113733333333325 0.69153466666666663 -0.26586133333333334 -0.67327750173586243 0.69264770558930855 -0.25872101112623663
+-0.58185500000000001 0.79621133333333338 -0.16397500000000001 -0.5759024890943909 0.80029787243831818 -0.16691206794473051
+-0.60520099999999999 0.77270733333333341 -0.18981166666666668 -0.60701838370830674 0.7733167665531343 -0.18305698677723373
+-0.61521733333333328 0.74463999999999997 -0.25760333333333335 -0.61737720596625756 0.74562370031847547 -0.25078014888878547
+-0.6280163333333334 0.74735400000000007 -0.21542566666666665 -0.62994672096641058 0.74812731929989273 -0.20850094211015854
+-0.9840779999999999 -0.0134354 -0.17529833333333333 -0.98691241345678504 -0.013902770097773812 -0.16065678058679073
+-0.84991400000000006 0.31540433333333334 0.42130033333333339 -0.85104278700009928 0.3094546099023251 0.42422166270159223
+-0.87218166666666674 0.28325866666666671 0.39799066666666666 -0.87515194316742995 0.28497736230755671 0.39102043340789627
+-0.90763266666666664 0.25476333333333329 0.33260966666666664 -0.90564963743778037 0.2537815664677886 0.33969640965128323
+-0.89252600000000004 0.24997166666666668 0.3744993333333333 -0.8902251303593165 0.2488472139009815 0.38154197856914401
+-0.94270433333333337 0.26347700000000002 0.20296099999999997 -0.94165092030341868 0.26294319089648543 0.21012953779252261
+-0.93280466666666662 0.26126333333333335 0.24684200000000001 -0.93145059669590613 0.26058069002973927 0.25396356017835581
+-0.9250423333333333 0.21922133333333335 0.30914666666666668 -0.92324824765135183 0.21840485990215974 0.31608857995793876
+-0.92108633333333334 0.25843766666666668 0.29005533333333333 -0.91942952058264094 0.25759897198975035 0.2971399103301321
+-0.5970939999999999 0.57400033333333333 0.559728 -0.59735900477779025 0.57412757476011167 0.55994620037192899
+-0.58218099999999995 0.61056333333333335 0.53625699999999998 -0.58231563453184998 0.61077524703187103 0.5365278179115468
+-0.52701999999999993 0.66796766666666674 0.524752 -0.53067049118758236 0.67029144614632918 0.51874676577863399
+-0.56587633333333331 0.64585599999999999 0.51180999999999999 -0.56946362135064477 0.64813805873458874 0.50559691531690387
+-0.40440066666666663 0.72644833333333336 0.55500833333333333 -0.41178317764580941 0.72388693021211736 0.55355426732705892
+-0.44618933333333333 0.70834066666666684 0.54632233333333335 -0.44274739014690234 0.70634826733897726 0.55231048672402683
+-0.50875899999999996 0.70129166666666676 0.49865066666666663 -0.51227314734642249 0.70346879484043656 0.49265391218738364
+-0.48709399999999997 0.68882333333333323 0.53624499999999997 -0.49079818955949378 0.69119748274502613 0.53043677942999268
+-0.38439033333333333 0.75755833333333333 0.52692766666666657 -0.3984138134810481 0.7523341244104359 0.52465207373560541
+-0.92875233333333329 0.36902433333333334 0.023093466666666663 -0.92909577934043552 0.36911258269415131 0.023171838697909626
+-0.94198866666666659 0.33142500000000003 0.04592396666666667 -0.94233057969160439 0.33150388176605172 0.046024503822688481
+-0.9656313333333334 0.25454166666666667 0.045389633333333339 -0.96563827865214957 0.25447243147524934 0.052787275178665882
+-0.95327899999999988 0.29303333333333331 0.068455500000000016 -0.95312415703736364 0.29288506573994472 0.075978151716947218
+-0.99018000000000006 0.13544999999999999 -0.022326100000000001 -0.99034549974472841 0.13546610395069533 -0.029406220698747692
+-0.98410066666666662 0.17562699999999998 0 -0.98442075068827462 0.17568207852183432 -0.0071828198210750361
+-0.97389733333333339 0.21503999999999998 0.067673766666666663 -0.97374709075627075 0.21493760296758127 0.07495618769821083
+-0.97591266666666654 0.21536433333333335 0.022573899999999997 -0.97607441993813926 0.21537615737539617 0.029863649754066537
+-0.9754856666666667 0.013347533333333333 -0.21812066666666666 -0.97401232856293862 0.026285001833126275 -0.22496462496587019
+-0.97857266666666654 0.053538400000000007 -0.19711033333333336 -0.97932493465657278 0.060177193173970425 -0.19313564606670133
+-0.9863019999999999 0.094360200000000005 -0.13272600000000001 -0.98571899316339384 0.094201848958944151 -0.13958537949821809
+-0.97951366666666662 0.093863266666666667 -0.17624100000000001 -0.97990967194526546 0.10047745418984431 -0.17228266316623408
+-0.9951253333333332 0.095028733333333337 -1.1564823173178713e-18 -0.9954450963919369 0.095080919327119623 -0.0069770229437209307
+-0.99414233333333335 0.094949566666666665 -0.044384866666666668 -0.99415826351618952 0.094924441907454235 -0.051368252949006959
+-0.98424200000000006 0.13481499999999999 -0.11134860000000001 -0.98380455546183165 0.13465699226459019 -0.11830507633572626
+-0.99119466666666656 0.094722766666666666 -0.088691666666666669 -0.99090868604521276 0.094624458621765259 -0.095635703326151886
+-0.57400033333333333 0.559728 0.5970939999999999 -0.57412757476011167 0.55994620037192899 0.59735900477779025
+-0.61056333333333335 0.53625699999999998 0.58218099999999995 -0.61077524703187092 0.53652781791154669 0.58231563453184998
+-0.66796766666666674 0.524752 0.52701999999999993 -0.67029144614632918 0.51874676577863399 0.53067049118758236
+-0.64585599999999999 0.51180999999999999 0.56587633333333331 -0.64813805873458874 0.50559691531690387 0.56946362135064477
+-0.72644833333333336 0.55500833333333333 0.40440066666666663 -0.72439943030853515 0.56081299478492752 0.40091676224502076
+-0.70834066666666684 0.54632233333333335 0.44618933333333333 -0.70634826733897726 0.55231048672402683 0.44274739014690234
+-0.70129166666666676 0.49865066666666663 0.50875899999999996 -0.70346879484043656 0.49265391218738364 0.51227314734642249
+-0.68882333333333323 0.53624499999999997 0.48709399999999997 -0.69119748274502602 0.53043677942999257 0.49079818955949372
+-0.71510766666666659 0.66833066666666652 0.20317933333333335 -0.7121465240101571 0.67309545366944168 0.19947390453334798
+-0.70400200000000002 0.66529633333333327 0.24715366666666669 -0.70252952126911561 0.66450329097410477 0.25473054004176948
+-0.70974033333333342 0.62968733333333338 0.31475999999999998 -0.70722940200759854 0.63488697783600867 0.31103874085109395
+-0.69105033333333343 0.66134433333333342 0.29050300000000001 -0.68928038046168305 0.66038496798852653 0.29796686252902399
+-0.75755833333333333 0.52692766666666657 0.38439033333333333 -0.75563435731375406 0.5327508406532252 0.38104233338345961
+-0.74308733333333332 0.56232000000000004 0.36183000000000004 -0.74095857789011776 0.56796520450867294 0.35832375349462325
+-0.69445200000000007 0.62386399999999986 0.35754100000000005 -0.69203077337497576 0.62922690351361477 0.35378936190436955
+-0.72712433333333326 0.59662133333333323 0.33858233333333332 -0.72479541496417221 0.60206985994653062 0.33493803933097638
+-0.39970366666666668 0.8632616666666667 0.30715500000000001 -0.40269359976225672 0.86434752812370608 0.3012328257958527
+-0.35763733333333336 0.8793616666666666 0.31327633333333332 -0.35051495993969434 0.88205972540034061 0.31481725442731084
+-0.31486966666666666 0.89383633333333334 0.31817000000000001 -0.32141623142252845 0.89646988933045202 0.30501367789328204
+-0.92875233333333329 0.36902433333333334 -0.023093466666666663 -0.92909577934043563 0.36911258269415131 -0.023171838697907406
+-0.91360566666666665 0.40573133333333339 0 -0.91395529702109868 0.40581487056505949 -7.6650762202989397e-05
+-0.89445666666666668 0.44087900000000002 0.069773100000000005 -0.8921471485624638 0.44687846223520744 0.066129458656195655
+-0.89658166666666661 0.44146866666666668 0.023282399999999998 -0.89406335609088383 0.44751152718113485 0.019599702434322533
+-0.87569633333333341 0.43517099999999997 0.207564 -0.87802007925767123 0.42952993482459917 0.21115107271792008
+-0.88396799999999998 0.4377786666666667 0.16201833333333335 -0.88647153569421999 0.43211376507175492 0.16566807308423559
+-0.87450700000000003 0.47524699999999998 0.093143066666666663 -0.87208010639908573 0.48110197469553667 0.089538695361360249
+-0.8902363333333333 0.439668 0.11605323333333334 -0.88812183032546255 0.44564102421677071 0.11244417296764649
+-0.8632616666666667 0.30715500000000001 0.39970366666666668 -0.86434752812370608 0.3012328257958527 0.40269359976225672
+-0.8793616666666666 0.31327633333333332 0.35763733333333336 -0.88205972540034072 0.3148172544273109 0.35051495993969439
+-0.8861296666666667 0.35661433333333337 0.29480833333333334 -0.88770117086706257 0.35082964097389946 0.298169740676969
+-0.89383633333333334 0.31817000000000001 0.31486966666666666 -0.89624801139507848 0.31951953619145285 0.30764714863357029
+-0.85258733333333325 0.46819666666666665 0.23063066666666665 -0.85071803619800823 0.47398585102273655 0.22719206834230932
+-0.86546833333333328 0.4318216666666666 0.25258333333333333 -0.86762894089824816 0.42618611131614109 0.25609650414835827
+-0.89808433333333326 0.36037766666666671 0.25075433333333336 -0.89979701339302798 0.35458216684467231 0.25423772663537536
+-0.87666166666666667 0.39457300000000001 0.27400933333333338 -0.87853054159162092 0.38883780863987261 0.27746936058396582
+-0.55500833333333333 0.40440066666666663 0.72644833333333336 -0.560105432184139 0.40765908089184932 0.72117680121051542
+-0.54632233333333335 0.44618933333333333 0.70834066666666684 -0.55231048672402683 0.44274739014690234 0.70634826733897726
+-0.49865066666666663 0.50875899999999996 0.70129166666666676 -0.49265391218738364 0.51227314734642249 0.70346879484043656
+-0.53624499999999997 0.48709399999999997 0.68882333333333323 -0.53043677942999268 0.49079818955949367 0.69119748274502613
+-0.66529633333333327 0.24715366666666669 0.70400200000000002 -0.67400167013189838 0.2536091376418031 0.69383294384454874
+-0.62968733333333338 0.31475999999999998 0.70974033333333342 -0.63469905587766706 0.31800651135779723 0.70429323949761236
+-0.66134433333333342 0.29050300000000001 0.69105033333333343 -0.66038496798852653 0.29796686252902399 0.68928038046168305
+-0.56232000000000004 0.36183000000000004 0.74308733333333332 -0.57161008136831104 0.36848181702340249 0.7331323655392965
+-0.62386399999999986 0.35754100000000005 0.69445200000000007 -0.62922690351361477 0.35378936190436955 0.69203077337497576
+-0.59662133333333323 0.33858233333333332 0.72712433333333326 -0.60573461278917862 0.3451074417932965 0.71692847097045209
+-0.94302533333333327 0.33165866666666671 0 -0.94332079023156645 0.33188233866370914 -2.0645674448368696e-16
+-0.9419886666666667 0.33142500000000003 -0.04592396666666667 -0.9423305796916045 0.33150388176605133 -0.046024503822688273
+-0.92250933333333329 0.36743666666666669 -0.11516276666666668 -0.92477192156992361 0.36146431664713258 -0.11891358571119012
+-0.93888933333333335 0.33070500000000003 -0.091738066666666673 -0.94101246637268221 0.32459334718907801 -0.095575609293335778
+-0.86189800000000005 0.47129566666666661 -0.18523799999999999 -0.85984579511114489 0.4771076381594323 -0.18175123174166177
+-0.72845533333333334 0.6600813333333333 -0.18158266666666667 -0.7254474553084781 0.66487474133902225 -0.17795383647401947
+-0.75754099999999991 0.63220766666666661 -0.16052666666666668 -0.76269529192907126 0.62731830658435828 -0.15737736143855552
+-0.80410033333333331 0.57136966666666666 -0.16208199999999998 -0.80143539604984326 0.57666967522084989 -0.15859820818379541
+-0.78491366666666673 0.60333300000000001 -0.13862866666666665 -0.7897729464689609 0.59827686849897932 -0.1353642554177088
+-0.74024633333333334 0.51888433333333339 -0.42672700000000002 -0.74257141516746672 0.51324151458922485 -0.43031481624311307
+-0.70834066666666662 0.54632233333333324 -0.44618933333333333 -0.71156848987857446 0.5483828868857894 -0.43925675132288244
+-0.65946733333333329 0.60814899999999994 -0.441085 -0.65399110933731253 0.62014958554441335 -0.43325526016061694
+-0.84991400000000006 0.31540433333333334 -0.42130033333333339 -0.84801861201595774 0.3289341025018061 -0.41553193606010613
+-0.82582333333333324 0.34636500000000003 -0.44426433333333337 -0.82355866817668288 0.35984158015639028 -0.43848050955726697
+-0.79176933333333332 0.41493233333333329 -0.44748600000000005 -0.78860909795809553 0.42820671089368856 -0.44128755178831852
+-0.57987066666666665 0.59409199999999995 0.55685966666666664 -0.57765607108327444 0.60032566082443639 0.55310267084542164
+-0.54185133333333335 0.6166786666666666 0.5704326666666667 -0.53827283249171476 0.61459058224575014 0.57666348420562952
+-0.4790543333333333 0.62262166666666674 0.61817566666666668 -0.48585593822267048 0.61959051746381588 0.61648325035047735
+-0.50272266666666665 0.6381163333333334 0.58255299999999999 -0.49909043067144071 0.6359748331968218 0.58859557724508138
+-0.4291213333333333 0.58757233333333325 0.68550100000000003 -0.44287025493391391 0.58129621282282395 0.68261310436631106
+-0.43866333333333335 0.64218399999999998 0.6280673333333332 -0.44564628559022512 0.63939888485503282 0.62655283431309761
+-0.45450433333333334 0.60574300000000003 0.65252999999999994 -0.44805947938148183 0.60897952160709901 0.65451252486074274
+-0.9840779999999999 0.0134354 -0.17529833333333333 -0.98502511365736167 0.020132858611957922 -0.17123140327758998
+-0.9873993333333333 -0.026941300000000001 -0.15372666666666665 -0.98908856318175531 -0.013855941447276254 -0.14666910741413983
+-0.85751700000000008 0.0098685999999999999 0.51400666666666661 -0.85625815419931606 0.016157371151246901 0.51629537352629973
+-0.84412233333333331 0.033939766666666669 0.53466000000000002 -0.84211831054466535 0.044479445379375336 0.53745542139245528
+-0.8076793333333333 0.040241233333333327 0.58780333333333334 -0.81112166378311712 0.05030456718831848 0.58271013125026749
+-0.82775166666666655 0.0568081 0.55776333333333328 -0.8311982227298389 0.060162204636448988 0.55271151938786212
+-0.78756366666666666 0.062679333333333337 0.6125790000000001 -0.79125242395262319 0.07298140215876496 0.60711886523813341
+-0.51400666666666661 0.85751700000000008 -0.0098685999999999999 -0.51629537352629973 0.85625815419931606 -0.016157371151246894
+-0.50072033333333332 0.86509833333333341 0.020975933333333335 -0.49296150071514128 0.86961675129264893 0.027489355829028849
+-0.51093266666666659 0.85518833333333344 0.084138333333333329 -0.51693773592267456 0.85198203848343856 0.083078175718679162
+-0.48871233333333336 0.87042766666666671 0.054918800000000011 -0.48452607356091093 0.8733385932212776 0.050141655636071814
+-0.58185500000000001 0.79621133333333338 0.16397500000000001 -0.57590248909438635 0.80029787243832073 0.16691206794473423
+-0.55811399999999989 0.81788833333333333 0.137791 -0.55215961732090924 0.82177650837133109 0.14072358469372062
+-0.4989513333333333 0.85778933333333329 0.12117366666666667 -0.5052029824723917 0.85462177736693767 0.11996484548056872
+-0.72425300000000004 0.67053999999999991 0.15863733333333332 -0.72966477893777271 0.66585752370229023 0.15563761918875957
+-0.88990066666666667 0.45298833333333333 -0.046587500000000004 -0.89337034382634639 0.447270486853794 -0.042878203800597439
+-0.90578799999999993 0.4171226666666667 -0.069620399999999999 -0.90364636568419621 0.42316551543616404 -0.065986304119790604
+-0.83168433333333336 0.55413233333333334 0.02332656666666667 -0.82834740396313544 0.55957288650226511 0.026809756415478912
+-0.8527840000000001 0.5215913333333333 0 -0.84973445502635048 0.52719896939347977 -0.0035500157075229735
+-0.87006133333333324 0.48723133333333335 -0.069949533333333327 -0.87384599637596316 0.48166055149859732 -0.066304507748472158
+-0.87221566666666661 0.48784099999999997 -0.023341766666666666 -0.86923108705951235 0.49367090573163303 -0.026950957746389739
+-0.73524766666666663 0.63800966666666659 0.22731699999999999 -0.73247878998149196 0.64299905357399878 0.22366725135833215
+-0.76478933333333332 0.60974166666666674 0.20646366666666668 -0.76208480428306991 0.6148590569769995 0.20291646343801162
+-0.8001543333333333 0.58287766666666674 0.13899133333333333 -0.7960326164998518 0.58825410186115357 0.1424401106146978
+-0.79259666666666673 0.58049500000000009 0.18473399999999998 -0.78996515049352989 0.58574870889565889 0.18125537518320203
+-0.53984299999999996 0.84154899999999999 0 -0.54126728154096593 0.8408245345172658 0.00662058056941108
+-0.53466000000000002 0.84412233333333331 -0.033939766666666669 -0.5374554213924535 0.84211831054466646 -0.044479445379376113
+-0.49190600000000001 0.8669473333333334 -0.076870800000000003 -0.48798175061253019 0.86987752165419463 -0.072020194319971698
+-0.52571100000000004 0.84756133333333328 -0.069051033333333345 -0.53174600782875692 0.84415555467171544 -0.068173181494396301
+-0.38235766666666665 0.91950733333333334 -0.08777366666666668 -0.38603366980132092 0.91764343429393302 -0.094385026762516006
+-0.42032333333333333 0.90304766666666669 -0.085159600000000002 -0.41617644228351275 0.90581916016022268 -0.079302067910407864
+-0.47919499999999998 0.86999933333333335 -0.11362733333333332 -0.47529860446531208 0.87310315696685536 -0.10854544618655068
+-0.45684033333333329 0.88547600000000004 -0.081770899999999994 -0.45266532689738775 0.88841440347642819 -0.076249259147242968
+-0.36507266666666666 0.92199933333333328 -0.12654466666666667 -0.36813562611791661 0.92192917094125182 -0.12051043336718012
+-0.34321000000000002 0.93462666666666683 -0.089739633333333346 -0.3469709879048487 0.93290234221438229 -0.096459076520838058
+-0.34131833333333333 0.93953100000000001 -0.012861600000000001 -0.35091742712315899 0.93620857053337614 -0.019247644040631104
+-0.32210133333333335 0.94495300000000004 -0.051809966666666672 -0.33563562018756299 0.9405636792466775 -0.051852634872907685
+-0.52997433333333333 0.84764833333333334 -0.015967733333333334 -0.53582528751528857 0.84418786852804661 -0.015430615322529999
+-0.50072033333333332 0.86509833333333341 -0.020975933333333335 -0.49296150071514033 0.86961675129264948 -0.027489355829029644
+-0.45166433333333328 0.89181766666666673 0.0117591 -0.45453812942887611 0.89054752003018456 0.017894229890842432
+-0.46890266666666669 0.88267033333333333 -0.022866433333333335 -0.47156638030224901 0.88134786990202008 -0.029173295799523435
+-0.40431166666666662 0.90593933333333332 0.12329633333333334 -0.40021859160024531 0.90887682535716774 0.11733710097915501
+-0.42032333333333333 0.90304766666666669 0.085159600000000002 -0.41617644228351086 0.90581916016022335 0.079302067910409682
+-0.41651533333333335 0.90873766666666667 0.012210199999999999 -0.41964790472394209 0.90749867578179044 0.018487550273145244
+-0.43589300000000003 0.89842200000000005 0.047878066666666663 -0.43918072250599738 0.89674879877906088 0.054423201554313565
+-0.42284533333333335 0.84005133333333337 0.33887933333333331 -0.42581416515119525 0.84132826838267238 0.3329399969616218
+-0.44099433333333332 0.84560366666666675 0.29968466666666665 -0.44469314238938989 0.84198036091321582 0.30547844596354201
+-0.43467933333333336 0.87072233333333326 0.22858766666666663 -0.43088521647762756 0.87438176918079857 0.22314670498415323
+-0.45815366666666663 0.84954666666666678 0.26021300000000003 -0.4513584011796512 0.8529237867155689 0.26229107445607774
+-0.36507266666666666 0.92199933333333328 0.12654466666666667 -0.3681356261179175 0.9219291709412516 0.12051043336717922
+-0.38781933333333329 0.90705666666666662 0.16191933333333333 -0.39436940024219491 0.90473780623552069 0.1610039692701675
+-0.45058500000000001 0.87200033333333327 0.18965866666666664 -0.44674844745016062 0.87548910974200045 0.18421358099779367
+-0.41114166666666668 0.88992266666666664 0.195881 -0.41786869262231946 0.88738043930629251 0.19478632308939156
+-0.59409199999999995 0.55685966666666664 0.57987066666666665 -0.60032566082443639 0.55310267084542153 0.57765607108327455
+-0.6166786666666666 0.5704326666666667 0.54185133333333335 -0.61459058224575014 0.57666348420562952 0.53827283249171476
+-0.62262166666666674 0.61817566666666668 0.4790543333333333 -0.61959051746381599 0.61648325035047724 0.48585593822267054
+-0.6381163333333334 0.58255299999999999 0.50272266666666665 -0.6359748331968218 0.58859557724508138 0.49909043067144071
+-0.56820666666666664 0.71697033333333327 0.40298833333333334 -0.56540437180381287 0.72207728506901026 0.39865058727224167
+-0.58757233333333325 0.68550100000000003 0.4291213333333333 -0.58490583753810721 0.69088009372313097 0.42493512129613731
+-0.64218399999999998 0.6280673333333332 0.43866333333333335 -0.63939888485503282 0.62655283431309761 0.44564628559022512
+-0.60574300000000003 0.65252999999999994 0.45450433333333334 -0.60897952160709889 0.65451252486074285 0.44805947938148183
+-0.38087633333333332 0.85702366666666663 0.34606799999999999 -0.38398563886785148 0.85837763506900788 0.340210030358579
+-0.4037823333333333 0.83285633333333331 0.37765766666666667 -0.40688835103443466 0.83438245004359879 0.37181688618420783
+-0.46774966666666667 0.78831499999999999 0.39885033333333331 -0.46455272967201505 0.79312039629702813 0.39389186121564468
+-0.42622800000000005 0.80692333333333333 0.40806266666666663 -0.42935517525091482 0.8086226951209774 0.40222315997533387
+-0.84764833333333334 -0.015967733333333334 0.52997433333333333 -0.8464364298536603 -0.0057590455486603749 0.53245864028200174
+-0.86509833333333341 -0.020975933333333335 0.50072033333333332 -0.86901663114224359 -0.01137033516809954 0.49465221143380211
+-0.90593933333333332 0.12329633333333334 0.40431166666666662 -0.90887682535716774 0.11733710097915501 0.40021859160024531
+-0.90304766666666669 0.085159600000000002 0.42032333333333333 -0.90581916016022335 0.079302067910409682 0.41617644228351086
+-0.90873766666666667 0.012210199999999999 0.41651533333333335 -0.90749867578179044 0.018487550273145244 0.41964790472394209
+-0.89842200000000005 0.047878066666666663 0.43589300000000003 -0.89674879877906088 0.054423201554313565 0.43918072250599738
+-0.84005133333333337 0.33887933333333331 0.42284533333333335 -0.84132826838267238 0.33293999696162185 0.4258141651511953
+-0.84560366666666675 0.29968466666666665 0.44099433333333332 -0.84198036091321582 0.30547844596354201 0.44469314238938989
+-0.87072233333333326 0.22858766666666663 0.43467933333333336 -0.87438176918079857 0.22314670498415323 0.43088521647762756
+-0.84954666666666678 0.26021300000000003 0.45815366666666663 -0.8529237867155689 0.2622910744560778 0.45135840117965115
+-0.92199933333333328 0.12654466666666667 0.36507266666666666 -0.9219291709412516 0.12051043336717922 0.3681356261179175
+-0.90705666666666662 0.16191933333333333 0.38781933333333329 -0.90473780623552069 0.1610039692701675 0.39436940024219491
+-0.87200033333333327 0.18965866666666664 0.45058500000000001 -0.87548910974200045 0.18421358099779367 0.44674844745016062
+-0.88992266666666664 0.195881 0.41114166666666668 -0.88738043930629251 0.19478632308939156 0.41786869262231946
+-0.55685966666666664 0.57987066666666665 0.59409199999999995 -0.55310267084542153 0.57765607108327455 0.60032566082443639
+-0.5704326666666667 0.54185133333333335 0.6166786666666666 -0.57666348420562941 0.53827283249171476 0.61459058224575003
+-0.61817566666666668 0.4790543333333333 0.62262166666666674 -0.61648325035047735 0.48585593822267048 0.61959051746381588
+-0.58255299999999999 0.50272266666666665 0.6381163333333334 -0.58859557724508138 0.49909043067144071 0.6359748331968218
+-0.71697033333333327 0.40298833333333334 0.56820666666666664 -0.72207728506901026 0.39865058727224173 0.56540437180381276
+-0.68550100000000003 0.4291213333333333 0.58757233333333325 -0.69088009372313097 0.42493512129613731 0.58490583753810721
+-0.6280673333333332 0.43866333333333335 0.64218399999999998 -0.62655283431309761 0.44564628559022518 0.63939888485503282
+-0.65252999999999994 0.45450433333333334 0.60574300000000003 -0.65451252486074285 0.44805947938148183 0.60897952160709889
+-0.85702366666666663 0.34606799999999999 0.38087633333333332 -0.85837763506900788 0.340210030358579 0.38398563886785148
+-0.83285633333333331 0.37765766666666667 0.4037823333333333 -0.83438245004359879 0.37181688618420783 0.40688835103443466
+-0.78831499999999999 0.39885033333333331 0.46774966666666667 -0.79312039629702813 0.39389186121564468 0.46455272967201505
+-0.80692333333333333 0.40806266666666663 0.42622800000000005 -0.8086226951209774 0.40222315997533387 0.42935517525091482
+-0.85751700000000008 -0.0098685999999999999 0.51400666666666661 -0.85874886791504967 0 0.51239670359460787
+-0.86509833333333341 0.020975933333333335 0.50072033333333332 -0.86961675129264893 0.027489355829028846 0.49296150071514122
+-0.85518833333333344 0.084138333333333329 0.51093266666666659 -0.8519820384834379 0.083078175718678801 0.51693773592267567
+-0.87042766666666671 0.054918800000000011 0.48871233333333336 -0.8733385932212776 0.050141655636071814 0.48452607356091093
+-0.79621133333333338 0.16397500000000001 0.58185500000000001 -0.80029787243831885 0.16691206794473312 0.57590248909438913
+-0.81788833333333333 0.137791 0.55811399999999989 -0.82177650837133098 0.14072358469372062 0.55215961732090935
+-0.85778933333333329 0.12117366666666667 0.4989513333333333 -0.85462177736693701 0.11996484548056841 0.50520298247239281
+-0.83759833333333333 0.11136133333333335 0.53430833333333327 -0.83398268268268638 0.10989551608923845 0.54073640577352444
+-0.72445833333333332 0.15433566666666665 0.67133866666666675 -0.73253178521168572 0.16072018555629511 0.66148787260941588
+-0.79545466666666664 0.20475399999999999 0.5698266666666667 -0.79603524377618162 0.19831536249045545 0.57183818311343493
+-0.77270733333333341 0.18981166666666668 0.60520099999999999 -0.77331676655313408 0.18305698677723631 0.60701838370830619
+-0.74987199999999998 0.13007733333333335 0.64819233333333337 -0.75759326223656376 0.13635543653030713 0.63832565665371033
+-0.74907166666666669 0.17287133333333335 0.63904300000000003 -0.7496386400507854 0.16581644846858723 0.64073927206007386
+-0.51400666666666661 0.85751700000000008 0.0098685999999999999 -0.51629537352629751 0.85625815419931739 0.01615737115124348
+-0.53466000000000002 0.84412233333333331 0.033939766666666669 -0.53745542139245528 0.84211831054466535 0.044479445379375329
+-0.58780333333333334 0.8076793333333333 0.040241233333333327 -0.58895650236746133 0.80747253922186379 0.033441541855634895
+-0.55776333333333328 0.82775166666666655 0.0568081 -0.55271151938786212 0.83119822272983901 0.060162204636448981
+-0.66962900000000003 0.74196399999999996 -0.021954166666666667 -0.67028755876104318 0.74196595278651467 -0.014181448295592964
+-0.64327366666666663 0.7652566666666667 0 -0.64387049393386275 0.76509611382071685 -0.0076631362900813427
+-0.6125790000000001 0.78756366666666666 0.062679333333333337 -0.61375471435502471 0.7875326373785172 0.055655149542686619
+-0.61607900000000004 0.78706100000000001 0.020946933333333334 -0.6169806372877642 0.78686277614210776 0.013485723336902991
+-0.71838866666666668 0.65739499999999995 -0.22599133333333332 -0.71553780893610874 0.66226771662737516 -0.22227711419774049
+-0.69767499999999993 0.68696599999999997 -0.20164099999999999 -0.69650390892021441 0.68635276333030104 -0.20928972532764573
+-0.68439933333333336 0.71638666666666673 -0.13320333333333334 -0.68580719655213007 0.71683146040089973 -0.12578213918049458
+-0.67582666666666669 0.71501700000000001 -0.177069 -0.68169635280687368 0.71056893393307941 -0.17430396638921761
+-0.69637199999999988 0.7172453333333334 1.1564823173178713e-18 -0.69234621949170561 0.72155779384027363 -0.0033260342602416627
+-0.69494100000000003 0.71724500000000002 -0.044609499999999996 -0.69058513447235004 0.72166551516255584 -0.047864979588097448
+-0.66105400000000003 0.74192333333333327 -0.10926670000000001 -0.66233944891874685 0.74224522874824861 -0.10187479966346287
+-0.69085300000000005 0.71705166666666675 -0.089040933333333336 -0.68617271066798124 0.72155909310713584 -0.092301063314366424
+-0.84764833333333334 0.015967733333333334 0.52997433333333333 -0.84418786852804661 0.015430615322529994 0.53582528751528857
+-0.83115833333333333 0 0.55563600000000002 -0.83118293250477737 0.012010130877733973 0.55586930970243209
+-0.93825066666666668 0.34415833333333334 0.023011 -0.94072706638194714 0.33809798042240197 0.026876424812624835
+-0.95156166666666664 0.30630133333333331 0 -0.95188345307616529 0.30636892878051097 0.0074813927632506189
+-0.96083533333333326 0.26727899999999999 -0.068186966666666668 -0.95963829897183583 0.27377530970839897 -0.064353826152852608
+-0.96287333333333336 0.26767199999999997 -0.022745200000000004 -0.9630414023662548 0.26766477827048918 -0.030113515268850449
+-0.94270433333333337 0.26347699999999996 -0.20296100000000003 -0.94165092030341868 0.26294319089648543 -0.21012953779252252
+-0.95677066666666677 0.26647300000000002 -0.1134709 -0.95838768851164768 0.26025483249547726 -0.11730498997081033
+-0.84358833333333338 0.3543716666666667 -0.40261533333333333 -0.84497406496934158 0.34849123588877046 -0.40567559458008356
+-0.85979766666666668 0.36100666666666664 -0.36019033333333333 -0.86126810731236148 0.35519573860579262 -0.36339129681772486
+-0.89582666666666666 0.33240466666666668 -0.29379266666666665 -0.89809633511602149 0.33366106968666159 -0.28651921999531477
+-0.874386 0.36636833333333335 -0.3170716666666667 -0.8759582528742067 0.36061491813226465 -0.32039666047265142
+-0.948241 0.22408166666666665 -0.223473 -0.94705214190253806 0.22354254211107258 -0.23047987414161372
+-0.93280466666666673 0.26126333333333335 -0.24684200000000001 -0.93145059669590613 0.26058069002973705 -0.25396356017835792
+-0.90772833333333336 0.33597166666666672 -0.24991700000000003 -0.906319730754649 0.33521978385738815 -0.25731739574973655
+-0.91531566666666675 0.29738066666666668 -0.27032499999999998 -0.9137858032467604 0.29657279985040358 -0.27756094857448055
+-0.84154899999999999 0 0.53984299999999996 -0.84390703655177146 0.0091679865187050871 0.53641109392107089
+-0.97972166666666671 0.026782933333333332 0.19685366666666668 -0.978702710039696 0.026709634801937603 0.20353771338428125
+-0.97022466666666674 0.026577699999999999 0.23935300000000001 -0.97133408884613925 0.033163093219784313 0.23539391898164305
+-0.95304633333333333 -0.013060566666666667 0.30147600000000002 -0.95472755866232628 -0.0065581929231745221 0.29740927832913455
+-0.95898133333333335 0.026290733333333333 0.28108433333333332 -0.96065419082266401 0.019735355545147864 0.277045197389089
+3 2251 0 853
+3 860 3 854
+3 974 6 855
+3 857 8 856
+3 856 6 857
+3 859 10 858
+3 858 12 859
+3 854 5 860
+3 877 15 861
+3 867 18 862
+3 874 21 863
+3 1287 24 864
+3 27 865 29
+3 1270 30 866
+3 862 20 867
+3 1106 34 868
+3 878 36 869
+3 1204 39 870
+3 873 42 871
+3 1347 45 872
+3 871 44 873
+3 863 23 874
+3 876 50 875
+3 875 52 876
+3 861 17 877
+3 869 38 878
+3 914 56 879
+3 897 59 880
+3 932 62 881
+3 928 65 882
+3 918 68 883
+3 913 71 884
+3 1098 74 885
+3 908 76 886
+3 1124 79 887
+3 931 82 888
+3 898 85 889
+3 1418 88 890
+3 917 91 891
+3 1112 94 892
+3 929 96 893
+3 1136 99 894
+3 906 102 895
+3 925 105 896
+3 880 61 897
+3 889 87 898
+3 2171 110 899
+3 920 113 900
+3 1247 116 901
+3 912 119 902
+3 1293 122 903
+3 922 125 904
+3 1118 127 905
+3 895 104 906
+3 1157 130 907
+3 886 78 908
+3 927 134 909
+3 911 137 910
+3 910 139 911
+3 902 121 912
+3 884 73 913
+3 879 58 914
+3 930 143 915
+3 919 146 916
+3 891 93 917
+3 883 70 918
+3 916 148 919
+3 900 115 920
+3 2142 152 921
+3 904 126 922
+3 2339 156 923
+3 926 158 924
+3 896 107 925
+3 924 160 926
+3 909 136 927
+3 882 67 928
+3 893 98 929
+3 915 145 930
+3 888 84 931
+3 881 64 932
+3 1034 168 933
+3 1694 313 934
+3 1075 174 935
+3 1002 177 936
+3 1044 180 937
+3 994 183 938
+3 1024 186 939
+3 1011 189 940
+3 1068 192 941
+3 1009 195 942
+3 1058 198 943
+3 990 201 944
+3 1069 204 945
+3 1065 207 946
+3 1254 210 947
+3 1035 213 948
+3 1030 216 949
+3 1056 219 950
+3 1008 222 951
+3 1274 225 952
+3 1063 228 953
+3 1108 231 954
+3 1031 233 955
+3 1128 236 956
+3 238 957 240
+3 1852 241 958
+3 1021 244 959
+3 1101 62 960
+3 993 247 961
+3 1159 250 962
+3 1076 253 963
+3 1799 256 964
+3 1071 257 965
+3 1685 260 966
+3 1048 263 967
+3 1601 65 968
+3 1005 266 969
+3 1045 269 970
+3 1040 272 971
+3 1025 275 972
+3 1020 278 973
+3 855 7 974
+3 1064 282 975
+3 1060 285 976
+3 1054 288 977
+3 1862 291 978
+3 1534 84 979
+3 989 296 980
+3 1041 298 981
+3 1000 301 982
+3 2439 304 983
+3 1033 306 984
+3 2432 250 985
+3 1014 309 986
+3 1074 241 987
+3 1066 314 988
+3 980 260 989
+3 944 203 990
+3 1043 319 991
+3 1032 322 992
+3 961 249 993
+3 938 185 994
+3 1913 327 995
+3 1023 330 996
+3 1945 333 997
+3 1073 334 998
+3 1530 78 999
+3 982 303 1000
+3 1163 277 1001
+3 936 179 1002
+3 1016 341 1003
+3 1042 344 1004
+3 969 268 1005
+3 1067 348 1006
+3 1022 351 1007
+3 951 224 1008
+3 942 197 1009
+3 2304 355 1010
+3 940 191 1011
+3 173 1012 171
+3 2275 358 1013
+3 986 311 1014
+3 1661 362 1015
+3 1003 343 1016
+3 1047 364 1017
+3 1029 367 1018
+3 1050 370 1019
+3 973 280 1020
+3 959 246 1021
+3 1007 353 1022
+3 996 332 1023
+3 939 188 1024
+3 972 277 1025
+3 1062 377 1026
+3 1028 380 1027
+3 1027 382 1028
+3 1018 369 1029
+3 949 218 1030
+3 955 235 1031
+3 992 324 1032
+3 984 308 1033
+3 933 170 1034
+3 948 215 1035
+3 2055 391 1036
+3 1070 393 1037
+3 1563 132 1038
+3 1046 396 1039
+3 971 274 1040
+3 981 300 1041
+3 1004 346 1042
+3 991 321 1043
+3 937 182 1044
+3 970 271 1045
+3 1039 397 1046
+3 1017 366 1047
+3 967 265 1048
+3 1865 407 1049
+3 1019 372 1050
+3 2288 411 1051
+3 1061 412 1052
+3 1727 353 1053
+3 977 290 1054
+3 1544 104 1055
+3 950 221 1056
+3 1622 188 1057
+3 943 200 1058
+3 1528 78 1059
+3 976 287 1060
+3 1052 414 1061
+3 1026 379 1062
+3 953 230 1063
+3 975 284 1064
+3 946 209 1065
+3 988 316 1066
+3 1006 350 1067
+3 941 194 1068
+3 945 206 1069
+3 1037 395 1070
+3 965 259 1071
+3 295 1072 293
+3 998 336 1073
+3 987 313 1074
+3 935 176 1075
+3 963 255 1076
+3 2337 434 1077
+3 1949 530 1078
+3 1241 436 1079
+3 1337 438 1080
+3 2006 440 1081
+3 443 1082 444
+3 1173 290 1083
+3 1237 447 1084
+3 1598 158 1085
+3 1327 0 1086
+3 1653 230 1087
+3 1249 450 1088
+3 1567 136 1089
+3 1358 452 1090
+3 1245 454 1091
+3 1352 407 1092
+3 1231 457 1093
+3 1319 459 1094
+3 1301 461 1095
+3 1459 304 1096
+3 1273 464 1097
+3 885 75 1098
+3 1289 466 1099
+3 1440 468 1100
+3 960 243 1101
+3 1269 470 1102
+3 2229 473 1103
+3 1398 474 1104
+3 1259 476 1105
+3 868 35 1106
+3 1305 478 1107
+3 954 232 1108
+3 1284 480 1109
+3 1423 482 1110
+3 1280 484 1111
+3 892 95 1112
+3 1263 485 1113
+3 1384 329 1114
+3 1296 487 1115
+3 1450 489 1116
+3 1292 491 1117
+3 905 128 1118
+3 1265 494 1119
+3 1390 156 1120
+3 1255 497 1121
+3 1277 499 1122
+3 1410 501 1123
+3 887 81 1124
+3 1402 503 1125
+3 1370 355 1126
+3 1857 411 1127
+3 956 237 1128
+3 2103 507 1129
+3 1467 508 1130
+3 1626 194 1131
+3 1456 511 1132
+3 1540 98 1133
+3 1300 256 1134
+3 2374 512 1135
+3 894 101 1136
+3 2163 515 1137
+3 1414 516 1138
+3 1669 259 1139
+3 1403 520 1140
+3 1579 145 1141
+3 1272 522 1142
+3 2021 524 1143
+3 1385 338 1144
+3 1871 444 1145
+3 1380 527 1146
+3 1468 529 1147
+3 1782 168 1148
+3 1304 531 1149
+3 1368 533 1150
+3 1415 535 1151
+3 1279 110 1152
+3 1460 538 1153
+3 1455 250 1154
+3 1381 540 1155
+3 1262 542 1156
+3 907 132 1157
+3 1444 544 1158
+3 962 252 1159
+3 1310 547 1160
+3 1522 67 1161
+3 1342 550 1162
+3 1001 338 1163
+3 1424 551 1164
+3 2329 553 1165
+3 1420 554 1166
+3 1565 132 1167
+3 1399 556 1168
+3 1555 124 1169
+3 1394 558 1170
+3 2421 560 1171
+3 1434 561 1172
+3 1083 446 1173
+3 1288 563 1174
+3 2342 565 1175
+3 1353 568 1176
+3 1348 411 1177
+3 1334 569 1178
+3 1240 571 1179
+3 1451 572 1180
+3 1447 440 1181
+3 1395 575 1182
+3 1268 577 1183
+3 1391 565 1184
+3 1388 580 1185
+3 1378 582 1186
+3 1258 584 1187
+3 1328 586 1188
+3 1323 588 1189
+3 1312 590 1190
+3 1226 526 1191
+3 1936 236 1192
+3 1712 336 1193
+3 1421 596 1194
+3 1283 598 1195
+3 1345 600 1196
+3 1341 358 1197
+3 1324 604 1198
+3 1236 606 1199
+3 1411 608 1200
+3 1406 512 1201
+3 1359 611 1202
+3 1355 613 1203
+3 870 41 1204
+3 1377 616 1205
+3 1448 618 1206
+3 1295 619 1207
+3 1356 620 1208
+3 1248 622 1209
+3 1442 623 1210
+3 1432 625 1211
+3 1389 434 1212
+3 1264 152 1213
+3 1320 628 1214
+3 1315 630 1215
+3 1349 632 1216
+3 1244 507 1217
+3 1407 633 1218
+3 1276 515 1219
+3 1338 634 1220
+3 1333 636 1221
+3 1316 473 1222
+3 1230 639 1223
+3 1330 641 1224
+3 1404 643 1225
+3 1191 591 1226
+3 1344 645 1227
+3 1695 313 1228
+3 1469 650 1229
+3 1223 640 1230
+3 1093 458 1231
+3 652 1232 238
+3 1336 654 1233
+3 2146 656 1234
+3 1416 657 1235
+3 1199 607 1236
+3 1084 2 1237
+3 1326 659 1238
+3 1382 661 1239
+3 1179 419 1240
+3 1079 437 1241
+3 1357 663 1242
+3 1457 666 1243
+3 1217 510 1244
+3 1091 455 1245
+3 1351 668 1246
+3 901 118 1247
+3 1209 391 1248
+3 1088 451 1249
+3 1318 670 1250
+3 1372 672 1251
+3 675 1252 676
+3 1458 677 1253
+3 947 212 1254
+3 1121 498 1255
+3 1405 679 1256
+3 1396 681 1257
+3 1187 585 1258
+3 1105 477 1259
+3 1438 560 1260
+3 1350 684 1261
+3 1156 543 1262
+3 1113 327 1263
+3 1213 449 1264
+3 1119 154 1265
+3 1397 686 1266
+3 1329 688 1267
+3 1183 578 1268
+3 1102 472 1269
+3 866 32 1270
+3 1325 689 1271
+3 1142 523 1272
+3 1097 465 1273
+3 952 227 1274
+3 1462 691 1275
+3 1219 519 1276
+3 1122 500 1277
+3 1343 693 1278
+3 1152 537 1279
+3 1111 112 1280
+3 1417 695 1281
+3 1408 697 1282
+3 1195 599 1283
+3 1109 481 1284
+3 699 1285 700
+3 1383 553 1286
+3 864 26 1287
+3 1174 564 1288
+3 1099 467 1289
+3 1449 702 1290
+3 1354 704 1291
+3 1117 493 1292
+3 903 124 1293
+3 1436 707 1294
+3 1207 446 1295
+3 1115 488 1296
+3 1463 709 1297
+3 2223 725 1298
+3 1317 713 1299
+3 1134 262 1300
+3 1095 462 1301
+3 1409 715 1302
+3 1335 717 1303
+3 1149 532 1304
+3 1107 479 1305
+3 2444 691 1306
+3 1401 720 1307
+3 1425 711 1308
+3 1364 722 1309
+3 1160 548 1310
+3 2259 735 1311
+3 1190 524 1312
+3 1466 724 1313
+3 1453 726 1314
+3 1215 631 1315
+3 1222 638 1316
+3 1299 714 1317
+3 1250 671 1318
+3 1094 460 1319
+3 1214 629 1320
+3 1413 729 1321
+3 1400 731 1322
+3 1189 589 1323
+3 1198 605 1324
+3 1271 690 1325
+3 1238 660 1326
+3 1086 7 1327
+3 1188 587 1328
+3 1267 656 1329
+3 1224 642 1330
+3 1379 734 1331
+3 1465 736 1332
+3 1221 637 1333
+3 1178 570 1334
+3 1303 718 1335
+3 1233 655 1336
+3 1080 439 1337
+3 1220 635 1338
+3 1366 738 1339
+3 1412 740 1340
+3 1197 603 1341
+3 1162 360 1342
+3 1278 694 1343
+3 1227 646 1344
+3 1196 602 1345
+3 1454 743 1346
+3 872 47 1347
+3 1177 416 1348
+3 1216 506 1349
+3 1261 685 1350
+3 1246 669 1351
+3 1092 456 1352
+3 1176 409 1353
+3 1291 706 1354
+3 1203 615 1355
+3 1208 621 1356
+3 1242 665 1357
+3 1090 453 1358
+3 1202 612 1359
+3 712 1360 711
+3 649 1361 647
+3 291 1362 435
+3 2300 722 1363
+3 1309 723 1364
+3 2385 740 1365
+3 1339 739 1366
+3 1794 344 1367
+3 1150 534 1368
+3 1743 341 1369
+3 1126 505 1370
+3 748 1371 749
+3 1251 674 1372
+3 1419 750 1373
+3 1452 752 1374
+3 1393 755 1375
+3 1427 757 1376
+3 1205 617 1377
+3 1186 583 1378
+3 1331 735 1379
+3 1146 528 1380
+3 1155 541 1381
+3 1239 662 1382
+3 1286 701 1383
+3 1114 486 1384
+3 1144 333 1385
+3 1446 759 1386
+3 1392 761 1387
+3 1185 581 1388
+3 1212 627 1389
+3 1120 496 1390
+3 1184 579 1391
+3 1387 762 1392
+3 1375 756 1393
+3 1170 559 1394
+3 1182 576 1395
+3 1257 682 1396
+3 1266 687 1397
+3 1104 475 1398
+3 1168 557 1399
+3 1322 732 1400
+3 1307 721 1401
+3 1125 504 1402
+3 1140 521 1403
+3 1225 644 1404
+3 1256 680 1405
+3 1201 610 1406
+3 1218 514 1407
+3 1282 698 1408
+3 1302 716 1409
+3 1123 502 1410
+3 1200 609 1411
+3 1340 741 1412
+3 1321 730 1413
+3 1138 517 1414
+3 1151 536 1415
+3 1235 658 1416
+3 1281 696 1417
+3 890 90 1418
+3 1373 751 1419
+3 1166 555 1420
+3 1194 597 1421
+3 763 1422 764
+3 1110 483 1423
+3 1164 552 1424
+3 1308 710 1425
+3 2211 531 1426
+3 1376 758 1427
+3 2077 649 1428
+3 1654 232 1429
+3 1445 766 1430
+3 1856 253 1431
+3 1211 626 1432
+3 1514 36 1433
+3 1172 562 1434
+3 2179 598 1435
+3 1294 708 1436
+3 2406 482 1437
+3 1260 683 1438
+3 1812 263 1439
+3 1100 469 1440
+3 1503 42 1441
+3 1210 624 1442
+3 1806 269 1443
+3 1158 546 1444
+3 1430 767 1445
+3 1386 760 1446
+3 1181 574 1447
+3 1206 442 1448
+3 1290 703 1449
+3 1116 490 1450
+3 1180 573 1451
+3 1374 754 1452
+3 1314 727 1453
+3 1346 744 1454
+3 1154 539 1455
+3 1132 252 1456
+3 1243 667 1457
+3 1253 678 1458
+3 1096 463 1459
+3 1153 305 1460
+3 595 1461 594
+3 1275 692 1462
+3 1297 710 1463
+3 593 1464 592
+3 1332 737 1465
+3 1313 725 1466
+3 1130 243 1467
+3 1147 530 1468
+3 1229 651 1469
+3 1885 460 1470
+3 2119 676 1471
+3 2096 436 1472
+3 1870 439 1473
+3 2089 447 1474
+3 1881 456 1475
+3 2113 450 1476
+3 1877 453 1477
+3 2105 454 1478
+3 2083 457 1479
+3 1926 748 1480
+3 1803 461 1481
+3 1909 34 1482
+3 2157 464 1483
+3 1915 486 1484
+3 2188 466 1485
+3 1813 370 1486
+3 470 1487 27
+3 2183 701 1488
+3 1905 475 1489
+3 1663 246 1490
+3 1893 74 1491
+3 1678 280 1492
+3 2130 476 1493
+3 1907 477 1494
+3 1930 502 1495
+3 2047 39 1496
+3 2212 478 1497
+3 1593 125 1498
+3 1911 94 1499
+3 1662 246 1500
+3 2180 480 1501
+3 2285 744 1502
+3 1441 483 1503
+3 2258 735 1504
+3 2172 484 1505
+3 1897 469 1506
+3 2138 485 1507
+3 1923 127 1508
+3 2203 487 1509
+3 1919 490 1510
+3 2195 491 1511
+3 1889 463 1512
+3 2124 497 1513
+3 1433 231 1514
+3 2165 499 1515
+3 2025 591 1516
+3 1531 81 1517
+3 1972 548 1518
+3 2073 640 1519
+3 2095 237 1520
+3 2065 631 1521
+3 1161 511 1522
+3 2040 607 1523
+3 1543 101 1524
+3 2017 589 1525
+3 2365 520 1526
+3 1891 465 1527
+3 1059 419 1528
+3 1931 79 1529
+3 999 338 1530
+3 1517 58 1531
+3 2069 637 1532
+3 1638 215 1533
+3 979 529 1534
+3 1808 396 1535
+3 2036 603 1536
+3 1845 393 1537
+3 2391 535 1538
+3 1910 112 1539
+3 1133 510 1540
+3 1937 99 1541
+3 2440 538 1542
+3 1524 70 1543
+3 1055 416 1544
+3 1674 271 1545
+3 2325 540 1546
+3 1954 534 1547
+3 2276 550 1548
+3 2004 440 1549
+3 2408 551 1550
+3 2108 669 1551
+3 2011 585 1552
+3 2197 122 1553
+3 2357 556 1554
+3 1169 287 1555
+3 2050 617 1556
+3 1629 200 1557
+3 2416 561 1558
+3 1921 493 1559
+3 1964 543 1560
+3 1966 130 1561
+3 1867 568 1562
+3 1038 107 1563
+3 1948 528 1564
+3 1167 287 1565
+3 2264 569 1566
+3 1089 449 1567
+3 2022 572 1568
+3 2003 581 1569
+3 2349 575 1570
+3 1995 578 1571
+3 2341 565 1572
+3 1980 559 1573
+3 2319 582 1574
+3 1944 523 1575
+3 2253 586 1576
+3 1934 504 1577
+3 2220 590 1578
+3 1141 519 1579
+3 2026 592 1580
+3 2044 610 1581
+3 2403 596 1582
+3 1958 537 1583
+3 2282 600 1584
+3 1940 517 1585
+3 2245 604 1586
+3 2032 599 1587
+3 2383 608 1588
+3 1976 555 1589
+3 2312 813 1590
+3 1902 611 1591
+3 1984 564 1592
+3 1498 41 1593
+3 2059 626 1594
+3 2008 618 1595
+3 1968 546 1596
+3 2295 620 1597
+3 1085 446 1598
+3 2424 623 1599
+3 1989 574 1600
+3 968 262 1601
+3 2237 628 1602
+3 1960 539 1603
+3 1859 632 1604
+3 2028 595 1605
+3 2375 633 1606
+3 1952 532 1607
+3 2272 634 1608
+3 2370 679 1609
+3 2023 591 1610
+3 2283 600 1611
+3 2279 645 1612
+3 1651 227 1613
+3 2072 640 1614
+3 2273 634 1615
+3 2268 654 1616
+3 2396 695 1617
+3 2039 607 1618
+3 2254 586 1619
+3 2249 659 1620
+3 2330 553 1621
+3 1057 419 1622
+3 1904 611 1623
+3 2298 663 1624
+3 2437 677 1625
+3 1131 510 1626
+3 1869 568 1627
+3 2291 668 1628
+3 1557 124 1629
+3 2054 391 1630
+3 2238 628 1631
+3 2233 670 1632
+3 2267 717 1633
+3 2441 538 1634
+3 2393 657 1635
+3 2436 677 1636
+3 2121 678 1637
+3 1533 81 1638
+3 1740 700 1639
+3 2369 679 1640
+3 2354 686 1641
+3 209 1642 699
+3 2009 585 1643
+3 2425 623 1644
+3 2420 560 1645
+3 2292 668 1646
+3 1963 543 1647
+3 1667 255 1648
+3 1763 186 1649
+3 2016 702 1650
+3 1613 176 1651
+3 1708 183 1652
+3 1087 449 1653
+3 1429 479 1654
+3 1986 570 1655
+3 2358 556 1656
+3 1935 236 1657
+3 1864 437 1658
+3 2353 686 1659
+3 1994 578 1660
+3 1015 360 1661
+3 1500 41 1662
+3 1490 32 1663
+3 2250 659 1664
+3 1943 523 1665
+3 2097 237 1666
+3 1648 227 1667
+3 2446 709 1668
+3 1139 519 1669
+3 2409 551 1670
+3 2405 764 1671
+3 2280 645 1672
+3 1957 537 1673
+3 1545 101 1674
+3 2395 695 1675
+3 2380 715 1676
+3 2031 599 1677
+3 1492 32 1678
+3 1983 564 1679
+3 2024 572 1680
+3 2014 702 1681
+3 1858 592 1682
+3 2445 709 1683
+3 2234 670 1684
+3 966 262 1685
+3 2384 608 1686
+3 2379 715 1687
+3 2269 654 1688
+3 1951 532 1689
+3 2366 520 1690
+3 2361 720 1691
+3 2302 738 1692
+3 1971 548 1693
+3 934 529 1694
+3 1228 724 1695
+3 2431 743 1696
+3 2064 631 1697
+3 1805 461 1698
+3 1795 714 1699
+3 2118 674 1700
+3 1884 460 1701
+3 2392 535 1702
+3 2387 729 1703
+3 2362 720 1704
+3 2015 589 1705
+3 2158 464 1706
+3 2153 690 1707
+3 1652 662 1708
+3 1873 7 1709
+3 2326 540 1710
+3 2321 734 1711
+3 1193 724 1712
+3 2068 637 1713
+3 2213 478 1714
+3 2208 718 1715
+3 2086 658 1716
+3 1868 439 1717
+3 2305 355 1718
+3 2301 738 1719
+3 2388 729 1720
+3 2035 603 1721
+3 2173 484 1722
+3 2168 694 1723
+3 2433 511 1724
+3 2430 743 1725
+3 2322 734 1726
+3 1053 416 1727
+3 2139 485 1728
+3 2134 685 1729
+3 2110 116 1730
+3 1880 456 1731
+3 2007 583 1732
+3 2196 491 1733
+3 1906 477 1734
+3 2191 706 1735
+3 2102 667 1736
+3 1876 453 1737
+3 2080 651 1738
+3 1860 291 1739
+3 1639 212 1740
+3 2221 590 1741
+3 2216 723 1742
+3 1369 741 1743
+3 1953 534 1744
+3 1797 714 1745
+3 676 1746 829
+3 2117 674 1747
+3 2404 596 1748
+3 2399 750 1749
+3 2350 575 1750
+3 2345 755 1751
+3 2413 767 1752
+3 2049 617 1753
+3 2189 466 1754
+3 2184 24 1755
+3 2154 690 1756
+3 1908 34 1757
+3 1861 632 1758
+3 2286 45 1759
+3 2261 737 1760
+3 1947 528 1761
+3 2098 436 1762
+3 1649 662 1763
+3 2185 24 1764
+3 1914 486 1765
+3 2010 618 1766
+3 2000 759 1767
+3 2346 755 1768
+3 2001 581 1769
+3 2338 434 1770
+3 2333 762 1771
+3 2316 758 1772
+3 1979 559 1773
+3 2131 476 1774
+3 2128 682 1775
+3 2147 656 1776
+3 1903 475 1777
+3 2246 604 1778
+3 2241 732 1779
+3 2217 723 1780
+3 1933 504 1781
+3 1148 443 1782
+3 2076 644 1783
+3 2129 682 1784
+3 1892 74 1785
+3 2400 750 1786
+3 2043 610 1787
+3 2181 480 1788
+3 2176 698 1789
+3 2209 718 1790
+3 1929 502 1791
+3 2277 550 1792
+3 2231 713 1793
+3 1367 741 1794
+3 1699 296 1795
+3 2242 732 1796
+3 1745 828 1797
+3 1939 517 1798
+3 964 252 1799
+3 2090 447 1800
+3 1886 462 1801
+3 2085 658 1802
+3 1481 17 1803
+3 2177 698 1804
+3 1698 296 1805
+3 1443 94 1806
+3 2376 633 1807
+3 1535 90 1808
+3 2311 754 1809
+3 1975 555 1810
+3 2169 694 1811
+3 1439 483 1812
+3 1486 582 1813
+3 2315 758 1814
+3 2002 759 1815
+3 2058 626 1816
+3 2204 487 1817
+3 2199 708 1818
+3 2135 685 1819
+3 1896 469 1820
+3 2114 450 1821
+3 2109 116 1822
+3 2200 708 1823
+3 1922 127 1824
+3 2417 561 1825
+3 2412 767 1826
+3 2334 762 1827
+3 1988 574 1828
+3 2143 494 1829
+3 2140 833 1830
+3 2192 706 1831
+3 1918 490 1832
+3 813 1833 834
+3 2310 754 1834
+3 2125 497 1835
+3 2122 210 1836
+3 2230 473 1837
+3 2225 727 1838
+3 2287 45 1839
+3 1959 539 1840
+3 2106 454 1841
+3 2101 667 1842
+3 2123 210 1843
+3 1888 463 1844
+3 1537 90 1845
+3 2027 595 1846
+3 2166 499 1847
+3 2161 692 1848
+3 2265 569 1849
+3 2260 737 1850
+3 2226 727 1851
+3 958 243 1852
+3 2084 457 1853
+3 2079 651 1854
+3 2162 692 1855
+3 1431 231 1856
+3 1127 506 1857
+3 1682 295 1858
+3 1604 96 1859
+3 1739 171 1860
+3 1758 351 1861
+3 978 3 1862
+3 1879 455 1863
+3 1658 571 1864
+3 1049 409 1865
+3 2270 438 1866
+3 1562 102 1867
+3 1717 177 1868
+3 1627 197 1869
+3 1473 8 1870
+3 1145 526 1871
+3 2088 606 1872
+3 1709 183 1873
+3 2112 622 1874
+3 1898 452 1875
+3 1737 189 1876
+3 1477 10 1877
+3 2104 507 1878
+3 1863 407 1879
+3 1731 195 1880
+3 1475 12 1881
+3 2082 639 1882
+3 2235 459 1883
+3 1701 201 1884
+3 1470 5 1885
+3 1801 256 1886
+3 2438 304 1887
+3 1844 204 1888
+3 1512 15 1889
+3 2156 522 1890
+3 1527 75 1891
+3 1785 213 1892
+3 1491 18 1893
+3 2187 563 1894
+3 2422 468 1895
+3 1820 219 1896
+3 1506 21 1897
+3 1875 451 1898
+3 2150 577 1899
+3 2045 612 1900
+3 2355 474 1901
+3 1591 814 1902
+3 1777 233 1903
+3 1623 191 1904
+3 1489 29 1905
+3 1734 584 1906
+3 1494 35 1907
+3 1757 244 1908
+3 1482 20 1909
+3 1539 95 1910
+3 1499 44 1911
+3 2137 542 1912
+3 995 329 1913
+3 1765 275 1914
+3 1484 23 1915
+3 2202 619 1916
+3 2018 489 1917
+3 1832 282 1918
+3 1510 50 1919
+3 2194 840 1920
+3 1559 128 1921
+3 1824 285 1922
+3 1508 52 1923
+3 749 1924 498
+3 828 1925 748
+3 1480 17 1926
+3 2164 515 1927
+3 2381 501 1928
+3 1791 298 1929
+3 1495 38 1930
+3 1529 75 1931
+3 2363 503 1932
+3 1781 306 1933
+3 1577 56 1934
+3 1657 232 1935
+3 1192 508 1936
+3 1541 95 1937
+3 2389 516 1938
+3 1798 319 1939
+3 1585 68 1940
+3 2364 503 1941
+3 2155 522 1942
+3 1665 249 1943
+3 1575 71 1944
+3 997 329 1945
+3 2323 527 1946
+3 1761 330 1947
+3 1564 76 1948
+3 1078 508 1949
+3 2210 531 1950
+3 1689 303 1951
+3 1607 82 1952
+3 1744 341 1953
+3 1547 85 1954
+3 2390 516 1955
+3 2170 110 1956
+3 1673 268 1957
+3 1583 91 1958
+3 1840 348 1959
+3 1603 96 1960
+3 2324 527 1961
+3 2136 542 1962
+3 1647 224 1963
+3 1560 102 1964
+3 1992 544 1965
+3 1561 128 1966
+3 1990 544 1967
+3 1596 105 1968
+3 842 1969 843
+3 2218 547 1970
+3 1693 311 1971
+3 1518 61 1972
+3 2407 482 1973
+3 2401 554 1974
+3 1810 364 1975
+3 1589 113 1976
+3 2356 474 1977
+3 2347 558 1978
+3 1773 367 1979
+3 1573 119 1980
+3 2415 625 1981
+3 2186 563 1982
+3 1679 280 1983
+3 1592 125 1984
+3 2263 636 1985
+3 1655 571 1986
+3 2020 489 1987
+3 1828 377 1988
+3 1600 134 1989
+3 1967 130 1990
+3 2348 558 1991
+3 1965 841 1992
+3 2149 577 1993
+3 1660 825 1994
+3 1571 137 1995
+3 2411 757 1996
+3 2340 156 1997
+3 2331 760 1998
+3 2335 580 1999
+3 1767 379 2000
+3 1769 382 2001
+3 1815 414 2002
+3 1569 139 2003
+3 1549 573 2004
+3 2318 616 2005
+3 1081 442 2006
+3 1732 584 2007
+3 1595 160 2008
+3 1643 218 2009
+3 1766 379 2010
+3 1552 121 2011
+3 2252 0 2012
+3 2243 588 2013
+3 1681 284 2014
+3 1705 324 2015
+3 1650 230 2016
+3 1525 73 2017
+3 1917 488 2018
+3 2219 547 2019
+3 1987 573 2020
+3 1143 526 2021
+3 1568 136 2022
+3 1610 170 2023
+3 1680 284 2024
+3 1516 58 2025
+3 1580 145 2026
+3 1846 393 2027
+3 1605 143 2028
+3 2402 554 2029
+3 2178 598 2030
+3 1677 274 2031
+3 1587 146 2032
+3 2281 845 2033
+3 2274 358 2034
+3 1721 346 2035
+3 1536 93 2036
+3 2244 588 2037
+3 2087 606 2038
+3 1618 182 2039
+3 1523 70 2040
+3 2382 501 2041
+3 2373 512 2042
+3 1787 397 2043
+3 1581 148 2044
+3 1900 452 2045
+3 2293 613 2046
+3 1496 35 2047
+3 2317 616 2048
+3 1753 372 2049
+3 1556 126 2050
+3 2201 619 2051
+3 2294 613 2052
+3 2111 622 2053
+3 1630 200 2054
+3 1036 107 2055
+3 2423 468 2056
+3 2414 625 2057
+3 1816 414 2058
+3 1594 160 2059
+3 2336 580 2060
+3 2141 152 2061
+3 2236 459 2062
+3 2227 630 2063
+3 1697 316 2064
+3 1521 67 2065
+3 2271 438 2066
+3 2262 636 2067
+3 1713 336 2068
+3 1532 84 2069
+3 2228 630 2070
+3 2081 639 2071
+3 1614 176 2072
+3 1519 64 2073
+3 2256 688 2074
+3 2367 643 2075
+3 1783 168 2076
+3 1428 711 2077
+3 2091 650 2078
+3 1854 174 2079
+3 1738 171 2080
+3 2071 638 2081
+3 1882 458 2082
+3 1479 3 2083
+3 1853 174 2084
+3 1802 180 2085
+3 1716 177 2086
+3 2038 605 2087
+3 1872 2 2088
+3 1474 8 2089
+3 1800 180 2090
+3 2078 649 2091
+3 2248 689 2092
+3 2159 225 2093
+3 2327 661 2094
+3 1520 64 2095
+3 1472 6 2096
+3 1666 255 2097
+3 1762 186 2098
+3 2297 847 2099
+3 2434 666 2100
+3 1842 192 2101
+3 1736 189 2102
+3 1129 506 2103
+3 1878 455 2104
+3 1478 10 2105
+3 1841 192 2106
+3 2290 684 2107
+3 1551 118 2108
+3 1822 198 2109
+3 1730 195 2110
+3 2053 621 2111
+3 1874 451 2112
+3 1476 12 2113
+3 1821 198 2114
+3 2232 713 2115
+3 2306 672 2116
+3 1747 829 2117
+3 1700 201 2118
+3 1471 5 2119
+3 2435 666 2120
+3 1637 212 2121
+3 1836 207 2122
+3 1843 204 2123
+3 1513 15 2124
+3 1835 207 2125
+3 2368 643 2126
+3 2351 681 2127
+3 1775 216 2128
+3 1784 213 2129
+3 1493 18 2130
+3 1774 216 2131
+3 2419 707 2132
+3 2289 684 2133
+3 1729 222 2134
+3 1819 219 2135
+3 1962 541 2136
+3 1912 327 2137
+3 1507 21 2138
+3 1728 222 2139
+3 1830 228 2140
+3 2061 627 2141
+3 921 154 2142
+3 1829 228 2143
+3 2352 681 2144
+3 2255 688 2145
+3 1234 238 2146
+3 1776 233 2147
+3 29 2148 652
+3 1993 576 2149
+3 1899 472 2150
+3 2320 26 2151
+3 2247 689 2152
+3 1707 247 2153
+3 1756 244 2154
+3 1942 521 2155
+3 1890 465 2156
+3 1483 20 2157
+3 1706 247 2158
+3 2093 650 2159
+3 2443 691 2160
+3 1848 257 2161
+3 1855 253 2162
+3 1137 514 2163
+3 1927 500 2164
+3 1515 36 2165
+3 1847 257 2166
+3 693 2167 763
+3 1723 266 2168
+3 1811 263 2169
+3 1956 536 2170
+3 899 112 2171
+3 1505 42 2172
+3 1722 266 2173
+3 2394 657 2174
+3 2377 697 2175
+3 1789 272 2176
+3 1804 269 2177
+3 2030 597 2178
+3 1435 481 2179
+3 1501 44 2180
+3 1788 272 2181
+3 2328 661 2182
+3 1488 26 2183
+3 1755 278 2184
+3 1764 275 2185
+3 1982 562 2186
+3 1894 467 2187
+3 1485 23 2188
+3 1754 278 2189
+3 704 2190 703
+3 1735 827 2191
+3 1831 282 2192
+3 841 2193 840
+3 1920 493 2194
+3 1511 50 2195
+3 1733 827 2196
+3 1553 118 2197
+3 2418 707 2198
+3 1818 288 2199
+3 1823 285 2200
+3 2051 442 2201
+3 1916 488 2202
+3 1509 52 2203
+3 1817 288 2204
+3 2307 672 2205
+3 2378 697 2206
+3 2266 717 2207
+3 1715 301 2208
+3 1790 298 2209
+3 1950 530 2210
+3 1426 479 2211
+3 1497 38 2212
+3 1714 301 2213
+3 2360 731 2214
+3 2299 722 2215
+3 1742 309 2216
+3 1780 306 2217
+3 1970 843 2218
+3 2019 524 2219
+3 1578 56 2220
+3 1741 309 2221
+3 444 2222 842
+3 1298 736 2223
+3 2428 726 2224
+3 1838 314 2225
+3 1851 241 2226
+3 2063 629 2227
+3 2070 638 2228
+3 1103 62 2229
+3 1837 314 2230
+3 1793 831 2231
+3 2115 671 2232
+3 1632 203 2233
+3 1684 260 2234
+3 1883 458 2235
+3 2062 629 2236
+3 1602 65 2237
+3 1631 203 2238
+3 2386 740 2239
+3 2359 731 2240
+3 1779 322 2241
+3 1796 319 2242
+3 2013 587 2243
+3 2037 605 2244
+3 1586 68 2245
+3 1778 322 2246
+3 2152 30 2247
+3 2092 660 2248
+3 1620 185 2249
+3 1664 249 2250
+3 853 2 2251
+3 2012 587 2252
+3 1576 71 2253
+3 1619 185 2254
+3 2145 687 2255
+3 2074 642 2256
+3 240 2257 641
+3 1504 47 2258
+3 1311 736 2259
+3 1850 334 2260
+3 1760 330 2261
+3 2067 635 2262
+3 1985 570 2263
+3 1566 76 2264
+3 1849 334 2265
+3 2207 716 2266
+3 1633 655 2267
+3 1616 179 2268
+3 1688 303 2269
+3 1866 437 2270
+3 2066 635 2271
+3 1608 82 2272
+3 1615 179 2273
+3 2034 602 2274
+3 1013 360 2275
+3 1548 85 2276
+3 1792 344 2277
+3 646 2278 693
+3 1612 820 2279
+3 1672 268 2280
+3 2033 602 2281
+3 1584 91 2282
+3 1611 820 2283
+3 2429 726 2284
+3 1502 47 2285
+3 1759 351 2286
+3 1839 348 2287
+3 1051 409 2288
+3 2133 683 2289
+3 2107 669 2290
+3 1628 197 2291
+3 1646 224 2292
+3 2046 612 2293
+3 2052 621 2294
+3 1597 105 2295
+3 700 2296 847
+3 2099 665 2297
+3 1624 191 2298
+3 2215 721 2299
+3 1363 739 2300
+3 1719 343 2301
+3 1692 311 2302
+3 505 2303 533
+3 1010 61 2304
+3 1718 343 2305
+3 2116 671 2306
+3 2205 849 2307
+3 2398 88 2308
+3 2426 752 2309
+3 1834 834 2310
+3 1809 364 2311
+3 1590 113 2312
+3 2344 761 2313
+3 2410 757 2314
+3 1814 370 2315
+3 1772 367 2316
+3 2048 39 2317
+3 2005 583 2318
+3 1574 119 2319
+3 2151 30 2320
+3 1711 332 2321
+3 1726 353 2322
+3 1946 333 2323
+3 1961 541 2324
+3 1546 104 2325
+3 1710 332 2326
+3 2094 660 2327
+3 2182 701 2328
+3 1165 277 2329
+3 1621 188 2330
+3 1998 766 2331
+3 2343 761 2332
+3 1771 380 2333
+3 1827 377 2334
+3 1999 579 2335
+3 2060 627 2336
+3 1077 134 2337
+3 1770 380 2338
+3 923 154 2339
+3 1997 579 2340
+3 1572 137 2341
+3 1175 567 2342
+3 2332 760 2343
+3 2313 756 2344
+3 1751 369 2345
+3 1768 382 2346
+3 1978 557 2347
+3 1991 576 2348
+3 1570 139 2349
+3 1750 369 2350
+3 2127 680 2351
+3 2144 687 2352
+3 1659 235 2353
+3 1641 218 2354
+3 1901 472 2355
+3 1977 557 2356
+3 1554 121 2357
+3 1656 235 2358
+3 2240 730 2359
+3 2214 721 2360
+3 1691 308 2361
+3 1704 324 2362
+3 1932 79 2363
+3 1941 521 2364
+3 1526 73 2365
+3 1690 308 2366
+3 2075 642 2367
+3 2126 680 2368
+3 1640 215 2369
+3 1609 170 2370
+3 851 2371 852
+3 2397 88 2372
+3 2042 609 2373
+3 1135 514 2374
+3 1606 143 2375
+3 1807 396 2376
+3 2175 696 2377
+3 2206 716 2378
+3 1687 300 2379
+3 1676 274 2380
+3 1928 500 2381
+3 2041 609 2382
+3 1588 146 2383
+3 1686 300 2384
+3 1365 739 2385
+3 2239 730 2386
+3 1703 321 2387
+3 1720 346 2388
+3 1938 99 2389
+3 1955 536 2390
+3 1538 93 2391
+3 1702 321 2392
+3 1635 655 2393
+3 2174 696 2394
+3 1675 271 2395
+3 1617 182 2396
+3 2372 852 2397
+3 2308 751 2398
+3 1749 366 2399
+3 1786 397 2400
+3 1974 552 2401
+3 2029 597 2402
+3 1582 148 2403
+3 1748 366 2404
+3 1671 265 2405
+3 1437 481 2406
+3 1973 552 2407
+3 1550 115 2408
+3 1670 265 2409
+3 2314 756 2410
+3 1996 766 2411
+3 1826 412 2412
+3 1752 372 2413
+3 2057 624 2414
+3 1981 562 2415
+3 1558 126 2416
+3 1825 412 2417
+3 2198 122 2418
+3 2132 683 2419
+3 1645 221 2420
+3 1171 290 2421
+3 1895 467 2422
+3 2056 624 2423
+3 1599 158 2424
+3 1644 221 2425
+3 2309 751 2426
+3 2442 851 2427
+3 2224 725 2428
+3 2284 744 2429
+3 1725 350 2430
+3 1696 316 2431
+3 985 305 2432
+3 1724 350 2433
+3 2100 665 2434
+3 2120 678 2435
+3 1636 206 2436
+3 1625 194 2437
+3 1887 462 2438
+3 983 305 2439
+3 1542 98 2440
+3 1634 206 2441
+3 2427 752 2442
+3 2160 225 2443
+3 1306 710 2444
+3 1683 295 2445
+3 1668 259 2446
+3 1327 1 853
+3 1237 2 853
+3 1479 4 854
+3 1885 5 854
+3 856 1 855
+3 1327 7 855
+3 1474 1 856
+3 855 6 856
+3 1472 9 857
+3 1870 8 857
+3 1478 11 858
+3 1881 12 858
+3 1476 13 859
+3 1877 10 859
+3 1471 14 860
+3 1862 3 860
+3 1513 16 861
+3 1926 17 861
+3 1493 19 862
+3 1909 20 862
+3 1507 22 863
+3 1915 23 863
+3 2185 25 864
+3 2183 26 864
+3 1487 28 865
+3 1905 29 865
+3 2152 31 866
+3 1663 32 866
+3 1483 33 867
+3 1893 18 867
+3 1909 19 868
+3 1907 35 868
+3 1515 37 869
+3 1930 38 869
+3 2048 40 870
+3 1593 41 870
+3 1505 43 871
+3 1911 44 871
+3 2287 46 872
+3 2285 47 872
+3 1501 48 873
+3 1441 42 873
+3 1485 49 874
+3 1897 21 874
+3 1511 51 875
+3 1923 52 875
+3 1509 53 876
+3 1919 50 876
+3 1481 54 877
+3 1889 15 877
+3 1497 55 878
+3 1433 36 878
+3 1578 57 879
+3 2025 58 879
+3 60 880 59
+3 1972 61 880
+3 1103 63 881
+3 2073 64 881
+3 1602 66 882
+3 2065 67 882
+3 1586 69 883
+3 2040 70 883
+3 1576 72 884
+3 2017 73 884
+3 1893 33 885
+3 1891 75 885
+3 1566 77 886
+3 1059 78 886
+3 1932 80 887
+3 1517 81 887
+3 1608 83 888
+3 2069 84 888
+3 1548 86 889
+3 87 889 86
+3 2398 89 890
+3 1808 90 890
+3 1584 92 891
+3 2036 93 891
+3 1911 43 892
+3 1910 95 892
+3 1604 97 893
+3 1133 98 893
+3 1938 100 894
+3 1524 101 894
+3 1562 103 895
+3 1055 104 895
+3 1597 106 896
+3 2055 107 896
+3 1010 108 897
+3 59 897 108
+3 109 898 87
+3 1954 85 898
+3 2170 111 899
+3 1539 112 899
+3 1590 114 900
+3 115 900 114
+3 2110 117 901
+3 2108 118 901
+3 1574 120 902
+3 2011 121 902
+3 2198 123 903
+3 1169 124 903
+3 1593 40 904
+3 2050 126 904
+3 1923 51 905
+3 1921 128 905
+3 1546 129 906
+3 1964 102 906
+3 1967 131 907
+3 1038 132 907
+3 1530 133 908
+3 1948 76 908
+3 1077 135 909
+3 1089 136 909
+3 1572 138 910
+3 2003 139 910
+3 1570 140 911
+3 1995 137 911
+3 1554 141 912
+3 1980 119 912
+3 1526 142 913
+3 1944 71 913
+3 1517 80 914
+3 1934 56 914
+3 1606 144 915
+3 1141 145 915
+3 1588 147 916
+3 2044 148 916
+3 1538 149 917
+3 1958 91 917
+3 1524 100 918
+3 1940 68 918
+3 1582 150 919
+3 2032 146 919
+3 1550 151 920
+3 1976 113 920
+3 2141 153 921
+3 2339 154 921
+3 1558 155 922
+3 1984 125 922
+3 1390 157 923
+3 1265 154 923
+3 1599 159 924
+3 2059 160 924
+3 1038 131 925
+3 1968 105 925
+3 1595 161 926
+3 1085 158 926
+3 1568 162 927
+3 1989 134 927
+3 1522 163 928
+3 968 65 928
+3 1542 164 929
+3 1960 96 929
+3 1580 165 930
+3 2028 143 930
+3 1534 166 931
+3 1952 82 931
+3 1520 167 932
+3 960 62 932
+3 1783 169 933
+3 2370 170 933
+3 987 312 934
+3 1147 529 934
+3 1854 175 935
+3 1651 176 935
+3 1717 178 936
+3 2273 179 936
+3 1802 181 937
+3 2396 182 937
+3 1709 184 938
+3 2254 185 938
+3 1763 187 939
+3 2330 188 939
+3 1737 190 940
+3 1904 191 940
+3 1842 193 941
+3 2437 194 941
+3 1731 196 942
+3 1869 197 942
+3 1822 199 943
+3 1557 200 943
+3 1701 202 944
+3 2238 203 944
+3 1844 205 945
+3 2441 206 945
+3 1836 208 946
+3 1642 209 946
+3 2123 211 947
+3 2121 212 947
+3 1785 214 948
+3 1533 215 948
+3 1775 217 949
+3 2354 218 949
+3 1820 220 950
+3 2425 221 950
+3 1729 223 951
+3 2292 224 951
+3 2160 226 952
+3 1667 227 952
+3 1830 229 953
+3 2016 230 953
+3 1433 55 954
+3 1429 232 954
+3 1777 234 955
+3 2358 235 955
+3 1936 167 956
+3 1520 237 956
+3 1234 239 957
+3 2257 240 957
+3 1851 242 958
+3 1101 243 958
+3 1757 245 959
+3 1500 246 959
+3 932 167 960
+3 1467 243 960
+3 1707 248 961
+3 2250 249 961
+3 2432 251 962
+3 1799 252 962
+3 1856 254 963
+3 2097 255 963
+3 1300 163 964
+3 1456 252 964
+3 1848 258 965
+3 2446 259 965
+3 1684 261 966
+3 1601 262 966
+3 1812 264 967
+3 2409 265 967
+3 928 163 968
+3 1300 262 968
+3 1723 267 969
+3 2280 268 969
+3 1806 270 970
+3 1545 271 970
+3 1789 273 971
+3 2380 274 971
+3 1765 276 972
+3 1001 277 972
+3 1755 279 973
+3 1492 280 973
+3 1873 281 974
+3 2096 6 974
+3 1832 283 975
+3 2024 284 975
+3 1824 286 976
+3 1565 287 976
+3 1818 289 977
+3 2421 290 977
+3 1860 292 978
+3 2083 3 978
+3 1532 795 979
+3 1694 529 979
+3 1699 297 980
+3 2234 260 980
+3 1791 299 981
+3 2384 300 981
+3 1715 302 982
+3 2269 303 982
+3 2438 251 983
+3 2432 305 983
+3 1781 307 984
+3 2366 308 984
+3 1455 164 985
+3 1460 305 985
+3 1742 310 986
+3 2302 311 986
+3 1852 312 987
+3 934 313 987
+3 1838 315 988
+3 2431 316 988
+3 1685 317 989
+3 1805 296 989
+3 1632 318 990
+3 2118 201 990
+3 1798 320 991
+3 2392 321 991
+3 1779 323 992
+3 2362 324 992
+3 1665 325 993
+3 2158 247 993
+3 1620 326 994
+3 1652 183 994
+3 1912 328 995
+3 1945 329 995
+3 1761 331 996
+3 2326 332 996
+3 1144 276 997
+3 1114 329 997
+3 1850 335 998
+3 1193 336 998
+3 1528 337 999
+3 1163 338 999
+3 1689 339 1000
+3 2213 301 1000
+3 972 276 1001
+3 1144 338 1001
+3 1616 340 1002
+3 2086 177 1002
+3 1744 342 1003
+3 2305 343 1003
+3 1794 345 1004
+3 2388 346 1004
+3 1673 347 1005
+3 2173 266 1005
+3 1840 349 1006
+3 2433 350 1006
+3 1759 352 1007
+3 2322 353 1007
+3 1647 354 1008
+3 2139 222 1008
+3 1628 117 1009
+3 2110 195 1009
+3 1370 108 1010
+3 897 61 1010
+3 1624 356 1011
+3 2102 189 1011
+3 357 1012 173
+3 2080 171 1012
+3 2274 359 1013
+3 1661 360 1013
+3 1693 361 1014
+3 2221 309 1014
+3 86 1015 362
+3 1342 360 1015
+3 1719 363 1016
+3 1369 341 1016
+3 1810 365 1017
+3 2404 366 1017
+3 1773 368 1018
+3 2350 369 1018
+3 1814 371 1019
+3 2413 372 1019
+3 1679 373 1020
+3 2189 278 1020
+3 1663 31 1021
+3 2154 244 1021
+3 1727 374 1022
+3 1861 351 1022
+3 1711 375 1023
+3 2261 330 1023
+3 1622 376 1024
+3 2098 186 1024
+3 1165 25 1025
+3 2185 275 1025
+3 1828 378 1026
+3 2010 379 1026
+3 1771 381 1027
+3 2346 382 1027
+3 1769 383 1028
+3 2338 380 1028
+3 1751 384 1029
+3 2316 367 1029
+3 1643 385 1030
+3 2131 216 1030
+3 1659 386 1031
+3 2147 233 1031
+3 1705 387 1032
+3 2246 322 1032
+3 1691 388 1033
+3 2217 306 1033
+3 1610 389 1034
+3 1148 168 1034
+3 1640 390 1035
+3 2129 213 1035
+3 2054 392 1036
+3 1563 107 1036
+3 1846 394 1037
+3 395 1037 394
+3 907 131 1038
+3 925 107 1038
+3 1808 89 1039
+3 2400 397 1039
+3 1677 398 1040
+3 2181 272 1040
+3 1687 399 1041
+3 2209 298 1041
+3 1721 400 1042
+3 2277 344 1042
+3 1703 401 1043
+3 2242 319 1043
+3 1618 402 1044
+3 2090 180 1044
+3 1675 403 1045
+3 2177 269 1045
+3 1787 404 1046
+3 2376 396 1046
+3 1749 405 1047
+3 2311 364 1047
+3 1671 406 1048
+3 2169 263 1048
+3 1863 408 1049
+3 2288 409 1049
+3 1753 410 1050
+3 1486 370 1050
+3 1348 103 1051
+3 1353 409 1051
+3 1826 413 1052
+3 2002 414 1052
+3 1726 415 1053
+3 1544 416 1053
+3 1173 417 1054
+3 2204 288 1054
+3 895 103 1055
+3 1348 416 1055
+3 1645 418 1056
+3 2135 219 1056
+3 1621 337 1057
+3 1528 419 1057
+3 1630 420 1058
+3 2114 198 1058
+3 886 77 1059
+3 1240 419 1059
+3 1169 123 1060
+3 2200 285 1060
+3 1816 421 1061
+3 2417 412 1061
+3 1767 422 1062
+3 2334 377 1062
+3 1653 423 1063
+3 2143 228 1063
+3 1681 424 1064
+3 2192 282 1064
+3 425 1065 209
+3 2125 207 1065
+3 1697 426 1066
+3 2230 314 1066
+3 1725 46 1067
+3 2287 348 1067
+3 1626 427 1068
+3 2106 192 1068
+3 1636 211 1069
+3 2123 204 1069
+3 428 1070 395
+3 1537 393 1070
+3 1669 429 1071
+3 2166 257 1071
+3 1683 430 1072
+3 293 1072 430
+3 1713 431 1073
+3 2265 334 1073
+3 1695 432 1074
+3 2226 241 1074
+3 1614 433 1075
+3 2084 174 1075
+3 1667 226 1076
+3 2162 253 1076
+3 1389 135 1077
+3 909 134 1077
+3 1147 312 1078
+3 1130 508 1078
+3 2098 376 1079
+3 1658 437 1079
+3 2271 178 1080
+3 1717 439 1080
+3 2004 441 1081
+3 2201 442 1081
+3 1148 389 1082
+3 1145 444 1082
+3 1171 445 1083
+3 1598 446 1083
+3 2090 402 1084
+3 2088 2 1084
+3 926 161 1085
+3 1295 446 1085
+3 2252 184 1086
+3 1709 7 1086
+3 1650 448 1087
+3 1567 449 1087
+3 2114 420 1088
+3 2112 451 1088
+3 909 135 1089
+3 1264 449 1089
+3 1900 190 1090
+3 1737 453 1090
+3 2106 427 1091
+3 2104 455 1091
+3 1865 196 1092
+3 1731 456 1092
+3 2084 433 1093
+3 2082 458 1093
+3 2236 202 1094
+3 1701 460 1094
+3 1805 317 1095
+3 1801 462 1095
+3 2439 205 1096
+3 1844 463 1096
+3 2158 325 1097
+3 2156 465 1097
+3 1529 214 1098
+3 1785 74 1098
+3 2189 373 1099
+3 2187 467 1099
+3 2423 220 1100
+3 1820 469 1100
+3 958 242 1101
+3 2229 62 1101
+3 471 1102 470
+3 2150 472 1102
+3 1316 63 1103
+3 881 62 1103
+3 2356 234 1104
+3 1777 475 1104
+3 2131 385 1105
+3 1734 477 1105
+3 1496 245 1106
+3 1757 34 1106
+3 2213 339 1107
+3 2211 479 1107
+3 1657 254 1108
+3 1856 231 1108
+3 2181 398 1109
+3 2179 481 1109
+3 2407 264 1110
+3 1812 483 1110
+3 2173 347 1111
+3 2171 112 1111
+3 1541 270 1112
+3 1806 94 1112
+3 2139 354 1113
+3 2137 327 1113
+3 997 276 1114
+3 1765 486 1114
+3 2204 417 1115
+3 2202 488 1115
+3 2020 283 1116
+3 1832 490 1116
+3 2196 492 1117
+3 2194 493 1117
+3 1561 286 1118
+3 1824 127 1118
+3 2143 423 1119
+3 2142 154 1119
+3 2340 495 1120
+3 496 1120 495
+3 2125 425 1121
+3 498 1121 425
+3 2166 429 1122
+3 2164 500 1122
+3 2382 299 1123
+3 1791 502 1123
+3 1533 214 1124
+3 1529 79 1124
+3 2364 307 1125
+3 1781 504 1125
+3 2305 342 1126
+3 2303 505 1126
+3 2288 408 1127
+3 2103 506 1127
+3 2097 254 1128
+3 1657 236 1128
+3 1244 97 1129
+3 1349 506 1129
+3 1078 312 1130
+3 1852 243 1130
+3 1625 509 1131
+3 1540 510 1131
+3 2433 349 1132
+3 1159 252 1132
+3 893 97 1133
+3 1244 510 1133
+3 1801 317 1134
+3 1685 262 1134
+3 2373 513 1135
+3 2163 514 1135
+3 1545 270 1136
+3 1541 99 1136
+3 1276 144 1137
+3 1407 514 1137
+3 2390 320 1138
+3 1798 517 1138
+3 1668 518 1139
+3 1579 519 1139
+3 2366 307 1140
+3 2364 521 1140
+3 915 144 1141
+3 1276 519 1141
+3 2156 325 1142
+3 1665 523 1142
+3 2019 525 1143
+3 1871 526 1143
+3 1001 276 1144
+3 997 333 1144
+3 1082 389 1145
+3 1191 526 1145
+3 2324 331 1146
+3 1761 528 1146
+3 934 312 1147
+3 1078 530 1147
+3 1034 389 1148
+3 1082 443 1148
+3 2211 339 1149
+3 1689 532 1149
+3 2303 342 1150
+3 1744 534 1150
+3 2392 320 1151
+3 2390 536 1151
+3 2171 347 1152
+3 1673 537 1152
+3 2441 205 1153
+3 2439 305 1153
+3 1159 349 1154
+3 1840 539 1154
+3 2326 331 1155
+3 2324 541 1155
+3 2137 354 1156
+3 1647 543 1156
+3 1565 286 1157
+3 1561 130 1157
+3 1992 545 1158
+3 546 1158 545
+3 1132 349 1159
+3 1154 250 1159
+3 2219 361 1160
+3 1693 548 1160
+3 1521 549 1161
+3 1724 511 1161
+3 2277 400 1162
+3 2275 360 1162
+3 999 337 1163
+3 2329 277 1163
+3 2409 264 1164
+3 2407 552 1164
+3 1383 25 1165
+3 1025 277 1165
+3 2402 365 1166
+3 1810 555 1166
+3 1563 392 1167
+3 1555 287 1167
+3 2358 234 1168
+3 2356 557 1168
+3 903 123 1169
+3 1060 287 1169
+3 2348 368 1170
+3 1773 559 1170
+3 2420 445 1171
+3 1083 290 1171
+3 2417 421 1172
+3 2415 562 1172
+3 1207 417 1173
+3 1054 290 1173
+3 2187 373 1174
+3 1679 564 1174
+3 2341 566 1175
+3 567 1175 566
+3 1869 196 1176
+3 1865 409 1176
+3 1857 374 1177
+3 1727 416 1177
+3 2265 431 1178
+3 2263 570 1178
+3 1658 376 1179
+3 1622 419 1179
+3 2024 283 1180
+3 2020 573 1180
+3 2006 378 1181
+3 1828 574 1181
+3 2350 368 1182
+3 2348 576 1182
+3 2150 471 1183
+3 1660 578 1183
+3 2342 495 1184
+3 2340 579 1184
+3 2336 383 1185
+3 1769 581 1185
+3 1486 410 1186
+3 2318 583 1186
+3 1734 385 1187
+3 1643 585 1187
+3 2254 184 1188
+3 2252 587 1188
+3 2244 387 1189
+3 1705 589 1189
+3 2221 361 1190
+3 2219 524 1190
+3 1145 389 1191
+3 1610 591 1191
+3 1935 765 1192
+3 1949 508 1192
+3 998 335 1193
+3 1313 724 1193
+3 2404 365 1194
+3 2402 597 1194
+3 2179 398 1195
+3 1677 599 1195
+3 2283 601 1196
+3 2281 602 1196
+3 2275 400 1197
+3 1721 603 1197
+3 2246 387 1198
+3 2244 605 1198
+3 2088 402 1199
+3 1618 607 1199
+3 2384 299 1200
+3 2382 609 1200
+3 2374 404 1201
+3 1787 610 1201
+3 1904 190 1202
+3 1900 612 1202
+3 2294 614 1203
+3 615 1203 614
+3 1500 245 1204
+3 1496 39 1204
+3 2318 410 1205
+3 1753 617 1205
+3 2010 378 1206
+3 2006 442 1206
+3 2202 417 1207
+3 1173 446 1207
+3 614 1208 620
+3 2294 621 1208
+3 2112 420 1209
+3 1630 391 1209
+3 2425 220 1210
+3 2423 624 1210
+3 2415 421 1211
+3 1816 626 1211
+3 2338 383 1212
+3 2336 627 1212
+3 2142 423 1213
+3 1653 449 1213
+3 2238 202 1214
+3 2236 629 1214
+3 2228 426 1215
+3 1697 631 1215
+3 1861 374 1216
+3 1857 506 1216
+3 2104 427 1217
+3 1626 510 1217
+3 2376 404 1218
+3 2374 514 1218
+3 2164 429 1219
+3 1669 519 1219
+3 2273 178 1220
+3 2271 635 1220
+3 2263 431 1221
+3 1713 637 1221
+3 2230 426 1222
+3 2228 638 1222
+3 2082 433 1223
+3 1614 640 1223
+3 2257 239 1224
+3 2256 642 1224
+3 2368 169 1225
+3 1783 644 1225
+3 2025 57 1226
+3 2021 526 1226
+3 2280 267 1227
+3 2278 646 1227
+3 1694 795 1228
+3 1712 724 1228
+3 2093 175 1229
+3 1854 651 1229
+3 2073 63 1230
+3 2071 639 1230
+3 1883 4 1231
+3 1479 457 1231
+3 2148 653 1232
+3 2146 238 1232
+3 2269 302 1233
+3 2267 655 1233
+3 1267 239 1234
+3 957 238 1234
+3 2394 181 1235
+3 1802 658 1235
+3 2040 69 1236
+3 2038 606 1236
+3 853 1 1237
+3 1474 447 1237
+3 2250 248 1238
+3 2248 660 1238
+3 2328 187 1239
+3 1763 662 1239
+3 1059 77 1240
+3 1986 571 1240
+3 1866 9 1241
+3 1472 436 1241
+3 664 1242 663
+3 2297 665 1242
+3 2435 193 1243
+3 1842 667 1243
+3 1133 97 1244
+3 1129 507 1244
+3 1879 11 1245
+3 1478 454 1245
+3 2292 223 1246
+3 2290 669 1246
+3 1553 199 1247
+3 1822 116 1247
+3 2055 106 1248
+3 2053 622 1248
+3 1875 13 1249
+3 1476 450 1249
+3 2234 297 1250
+3 2232 671 1250
+3 2307 673 1251
+3 1747 674 1251
+3 14 1252 675
+3 1471 676 1252
+3 2437 193 1253
+3 2435 678 1253
+3 1639 208 1254
+3 1836 210 1254
+3 1924 16 1255
+3 1513 497 1255
+3 2370 169 1256
+3 2368 680 1256
+3 2352 217 1257
+3 1775 682 1257
+3 2011 120 1258
+3 2007 584 1258
+3 1907 19 1259
+3 1493 476 1259
+3 2421 289 1260
+3 2419 683 1260
+3 2290 223 1261
+3 1729 685 1261
+3 1964 129 1262
+3 1962 542 1262
+3 1913 22 1263
+3 1507 485 1263
+3 1089 135 1264
+3 2061 152 1264
+3 923 157 1265
+3 494 1265 157
+3 2354 217 1266
+3 2352 687 1266
+3 2256 239 1267
+3 1234 656 1267
+3 1995 140 1268
+3 1993 577 1268
+3 1901 28 1269
+3 1487 470 1269
+3 1492 279 1270
+3 2320 30 1270
+3 2248 248 1271
+3 1707 690 1271
+3 1944 142 1272
+3 1942 522 1272
+3 1891 33 1273
+3 1483 464 1273
+3 1651 175 1274
+3 2093 225 1274
+3 2444 258 1275
+3 1848 692 1275
+3 1141 144 1276
+3 1137 515 1276
+3 1928 37 1277
+3 1515 499 1277
+3 2278 267 1278
+3 1723 694 1278
+3 1958 149 1279
+3 1956 110 1279
+3 1910 43 1280
+3 1505 484 1280
+3 2396 181 1281
+3 2394 696 1281
+3 2378 273 1282
+3 1789 698 1282
+3 2032 150 1283
+3 2030 598 1283
+3 1437 48 1284
+3 1501 480 1284
+3 1642 208 1285
+3 1639 700 1285
+3 2330 187 1286
+3 2328 701 1286
+3 2320 279 1287
+3 1755 24 1287
+3 1984 155 1288
+3 1982 563 1288
+3 1895 49 1289
+3 1485 466 1289
+3 2016 229 1290
+3 703 1290 229
+3 705 1291 704
+3 1735 706 1291
+3 1921 51 1292
+3 1511 491 1292
+3 1557 199 1293
+3 1553 122 1293
+3 2419 289 1294
+3 1818 708 1294
+3 1085 161 1295
+3 2051 619 1295
+3 1917 53 1296
+3 1509 487 1296
+3 2446 258 1297
+3 2444 710 1297
+3 1313 335 1298
+3 1332 736 1298
+3 2232 297 1299
+3 1699 714 1299
+3 968 163 1300
+3 964 256 1300
+3 1887 54 1301
+3 1481 461 1301
+3 2380 273 1302
+3 2378 716 1302
+3 2267 302 1303
+3 1715 718 1303
+3 1952 166 1304
+3 1950 531 1304
+3 1429 55 1305
+3 1497 478 1305
+3 2443 719 1306
+3 1425 710 1306
+3 2362 323 1307
+3 2360 721 1307
+3 1360 430 1308
+3 1463 710 1308
+3 2300 310 1309
+3 1742 723 1309
+3 1972 60 1310
+3 1970 547 1310
+3 2258 784 1311
+3 2223 736 1311
+3 2021 57 1312
+3 1578 590 1312
+3 1193 335 1313
+3 1298 725 1313
+3 2429 315 1314
+3 1838 727 1314
+3 2065 66 1315
+3 2063 630 1315
+3 2071 63 1316
+3 1103 473 1316
+3 1797 728 1317
+3 1793 713 1317
+3 2116 318 1318
+3 1632 670 1318
+3 1885 4 1319
+3 1883 459 1319
+3 2063 66 1320
+3 1602 628 1320
+3 2388 345 1321
+3 2386 730 1321
+3 2360 323 1322
+3 1779 732 1322
+3 2017 72 1323
+3 2013 588 1323
+3 2038 69 1324
+3 1586 604 1324
+3 2154 31 1325
+3 2152 689 1325
+3 2094 326 1326
+3 1620 659 1326
+3 855 1 1327
+3 853 0 1327
+3 2013 72 1328
+3 1576 586 1328
+3 2147 386 1329
+3 2145 688 1329
+3 2075 733 1330
+3 641 1330 733
+3 2322 352 1331
+3 1504 735 1331
+3 1298 335 1332
+3 1850 737 1332
+3 2069 83 1333
+3 2067 636 1333
+3 1986 77 1334
+3 1566 569 1334
+3 2209 399 1335
+3 2207 717 1335
+3 1635 340 1336
+3 1616 654 1336
+3 1870 9 1337
+3 1866 438 1337
+3 2067 83 1338
+3 1608 634 1338
+3 2302 310 1339
+3 2300 739 1339
+3 2386 345 1340
+3 1794 741 1340
+3 2036 92 1341
+3 2034 358 1341
+3 1015 86 1342
+3 1548 550 1342
+3 2169 406 1343
+3 2167 693 1343
+3 742 1344 646
+3 1612 645 1344
+3 2034 92 1345
+3 1584 600 1345
+3 2431 315 1346
+3 2429 744 1346
+3 1504 352 1347
+3 1759 45 1347
+3 1055 103 1348
+3 1051 411 1348
+3 1129 97 1349
+3 1604 632 1349
+3 2135 418 1350
+3 2133 684 1350
+3 2108 117 1351
+3 1628 668 1351
+3 1881 11 1352
+3 1879 407 1352
+3 1051 103 1353
+3 1562 568 1353
+3 2192 424 1354
+3 2190 704 1354
+3 745 1355 615
+3 2046 613 1355
+3 2053 106 1356
+3 1597 620 1356
+3 2100 356 1357
+3 1624 663 1357
+3 1877 13 1358
+3 1875 452 1358
+3 2046 745 1359
+3 1591 611 1359
+3 430 1360 712
+3 1308 711 1360
+3 2078 357 1361
+3 647 1361 357
+3 1862 14 1362
+3 435 1362 14
+3 2299 746 1363
+3 2385 739 1363
+3 2217 388 1364
+3 2215 722 1364
+3 1412 363 1365
+3 1366 739 1365
+3 1365 363 1366
+3 1719 738 1366
+3 1792 747 1367
+3 1743 741 1367
+3 1954 109 1368
+3 533 1368 109
+3 1016 363 1369
+3 1412 741 1369
+3 108 1370 505
+3 1010 355 1370
+3 1926 16 1371
+3 1924 749 1371
+3 2118 318 1372
+3 2116 672 1372
+3 2400 89 1373
+3 2398 751 1373
+3 2427 753 1374
+3 1834 754 1374
+3 2346 381 1375
+3 2344 756 1375
+3 2411 371 1376
+3 1814 758 1376
+3 2050 40 1377
+3 2048 616 1377
+3 2007 120 1378
+3 1574 582 1378
+3 2259 375 1379
+3 1711 734 1379
+3 1948 133 1380
+3 1946 527 1380
+3 1962 129 1381
+3 1546 540 1381
+3 1652 326 1382
+3 2094 661 1382
+3 2183 25 1383
+3 1165 553 1383
+3 1915 22 1384
+3 1913 329 1384
+3 1946 133 1385
+3 1530 338 1385
+3 2002 413 1386
+3 1998 760 1386
+3 2344 381 1387
+3 1771 762 1387
+3 2003 138 1388
+3 1999 580 1388
+3 2061 135 1389
+3 1077 434 1389
+3 157 1390 496
+3 923 156 1390
+3 1999 138 1391
+3 1572 565 1391
+3 2334 422 1392
+3 2332 761 1392
+3 2314 384 1393
+3 1751 755 1393
+3 1980 141 1394
+3 1978 558 1394
+3 1993 140 1395
+3 1570 575 1395
+3 2129 390 1396
+3 2127 681 1396
+3 2145 386 1397
+3 1659 686 1397
+3 1905 28 1398
+3 1901 474 1398
+3 1978 141 1399
+3 1554 556 1399
+3 2242 401 1400
+3 2240 731 1400
+3 2215 388 1401
+3 1691 720 1401
+3 1934 80 1402
+3 1932 503 1402
+3 1942 142 1403
+3 1526 520 1403
+3 733 1404 644
+3 2075 643 1404
+3 2127 390 1405
+3 1640 679 1405
+3 2044 147 1406
+3 2042 512 1406
+3 1137 144 1407
+3 1606 633 1407
+3 2177 403 1408
+3 2175 697 1408
+3 2207 399 1409
+3 1687 715 1409
+3 1930 37 1410
+3 1928 501 1410
+3 2042 147 1411
+3 1588 608 1411
+3 1369 363 1412
+3 1365 740 1412
+3 2240 401 1413
+3 1703 729 1413
+3 1940 100 1414
+3 1938 516 1414
+3 1956 149 1415
+3 1538 535 1415
+3 2086 340 1416
+3 1635 657 1416
+3 2175 403 1417
+3 1675 695 1417
+3 1537 428 1418
+3 2372 88 1418
+3 2309 405 1419
+3 1749 750 1419
+3 1976 151 1420
+3 1974 554 1420
+3 2030 150 1421
+3 1582 596 1421
+3 2167 406 1422
+3 1671 764 1422
+3 1441 48 1423
+3 1437 482 1423
+3 1974 151 1424
+3 1550 551 1424
+3 1306 719 1425
+3 2077 711 1425
+3 2210 765 1426
+3 1654 479 1426
+3 2316 384 1427
+3 2314 757 1427
+3 648 1428 649
+3 711 1428 648
+3 954 55 1429
+3 1305 479 1429
+3 1998 413 1430
+3 1826 767 1430
+3 1855 768 1431
+3 1514 231 1431
+3 2059 159 1432
+3 2057 625 1432
+3 878 55 1433
+3 954 231 1433
+3 1982 155 1434
+3 1558 561 1434
+3 2178 769 1435
+3 2406 481 1435
+3 2200 123 1436
+3 2198 707 1436
+3 1423 48 1437
+3 1284 481 1437
+3 2133 418 1438
+3 1645 560 1438
+3 1811 770 1439
+3 1503 483 1439
+3 1897 49 1440
+3 1895 468 1440
+3 873 48 1441
+3 1423 483 1441
+3 2057 159 1442
+3 1599 623 1442
+3 1804 771 1443
+3 1499 94 1443
+3 1968 131 1444
+3 1967 544 1444
+3 2413 371 1445
+3 2411 766 1445
+3 2332 422 1446
+3 1767 759 1446
+3 1989 162 1447
+3 1549 440 1447
+3 2051 161 1448
+3 1595 618 1448
+3 2190 424 1449
+3 1681 702 1449
+3 1919 53 1450
+3 1917 489 1450
+3 1549 162 1451
+3 1568 572 1451
+3 2311 405 1452
+3 2309 752 1452
+3 2226 432 1453
+3 2224 726 1453
+3 2285 46 1454
+3 1725 743 1454
+3 1960 164 1455
+3 985 250 1455
+3 964 163 1456
+3 1522 511 1456
+3 2102 356 1457
+3 2100 666 1457
+3 2121 211 1458
+3 1636 677 1458
+3 1889 54 1459
+3 1887 304 1459
+3 985 164 1460
+3 1542 538 1460
+3 2028 165 1461
+3 594 1461 165
+3 2162 226 1462
+3 2160 691 1462
+3 1308 430 1463
+3 1683 709 1463
+3 165 1464 593
+3 1580 592 1464
+3 2261 375 1465
+3 2259 736 1465
+3 2224 432 1466
+3 1695 724 1466
+3 960 167 1467
+3 1936 508 1467
+3 1950 166 1468
+3 1534 529 1468
+3 2080 357 1469
+3 2078 650 1469
+3 1884 772 1470
+3 2119 5 1470
+3 1252 14 1471
+3 860 5 1471
+3 1241 9 1472
+3 857 6 1472
+3 1868 773 1473
+3 2089 8 1473
+3 1237 1 1474
+3 856 8 1474
+3 1880 774 1475
+3 2113 12 1475
+3 1249 13 1476
+3 859 12 1476
+3 1876 775 1477
+3 2105 10 1477
+3 1245 11 1478
+3 858 10 1478
+3 1231 4 1479
+3 854 3 1479
+3 1925 776 1480
+3 1803 17 1480
+3 1301 54 1481
+3 877 17 1481
+3 1908 777 1482
+3 2157 20 1482
+3 1273 33 1483
+3 867 20 1483
+3 1914 778 1484
+3 2188 23 1484
+3 1289 49 1485
+3 874 23 1485
+3 1050 410 1486
+3 1186 582 1486
+3 1269 28 1487
+3 865 27 1487
+3 2182 779 1488
+3 2151 26 1488
+3 1903 653 1489
+3 2148 29 1489
+3 1662 780 1490
+3 1678 32 1490
+3 1892 781 1491
+3 2130 18 1491
+3 973 279 1492
+3 1270 32 1492
+3 1259 19 1493
+3 862 18 1493
+3 1906 782 1494
+3 2047 35 1494
+3 1929 783 1495
+3 2212 38 1495
+3 1204 245 1496
+3 1106 35 1496
+3 1305 55 1497
+3 878 38 1497
+3 1592 780 1498
+3 1662 41 1498
+3 1443 771 1499
+3 2180 44 1499
+3 959 245 1500
+3 1204 41 1500
+3 1284 48 1501
+3 873 44 1501
+3 2284 784 1502
+3 2258 47 1502
+3 1439 770 1503
+3 2172 42 1503
+3 1331 352 1504
+3 1347 47 1504
+3 1280 43 1505
+3 871 42 1505
+3 1896 785 1506
+3 2138 21 1506
+3 1263 22 1507
+3 863 21 1507
+3 1922 786 1508
+3 2203 52 1508
+3 1296 53 1509
+3 876 52 1509
+3 1918 787 1510
+3 2195 50 1510
+3 1292 51 1511
+3 875 50 1511
+3 1888 788 1512
+3 2124 15 1512
+3 1255 16 1513
+3 861 15 1513
+3 1431 768 1514
+3 2165 36 1514
+3 1277 37 1515
+3 869 36 1515
+3 2023 789 1516
+3 1531 58 1516
+3 887 80 1517
+3 914 58 1517
+3 1971 790 1518
+3 2304 61 1518
+3 2072 791 1519
+3 2095 64 1519
+3 956 167 1520
+3 932 64 1520
+3 2064 549 1521
+3 1161 67 1521
+3 1456 163 1522
+3 928 67 1522
+3 2039 792 1523
+3 1543 70 1523
+3 894 100 1524
+3 918 70 1524
+3 2015 793 1525
+3 2365 73 1525
+3 1403 142 1526
+3 913 73 1526
+3 1890 794 1527
+3 1931 75 1527
+3 1057 337 1528
+3 999 78 1528
+3 1124 214 1529
+3 1098 75 1529
+3 1385 133 1530
+3 908 78 1530
+3 1516 789 1531
+3 1638 81 1531
+3 2068 795 1532
+3 979 84 1532
+3 948 214 1533
+3 1124 81 1533
+3 1468 166 1534
+3 931 84 1534
+3 1807 796 1535
+3 1845 90 1535
+3 2035 797 1536
+3 2391 93 1536
+3 1070 428 1537
+3 1418 90 1537
+3 1415 149 1538
+3 917 93 1538
+3 899 111 1539
+3 1937 95 1539
+3 1131 509 1540
+3 2440 98 1540
+3 1136 270 1541
+3 1112 95 1541
+3 1460 164 1542
+3 929 98 1542
+3 1523 792 1543
+3 1674 101 1543
+3 1053 415 1544
+3 2325 104 1544
+3 970 270 1545
+3 1136 101 1545
+3 1381 129 1546
+3 906 104 1546
+3 1953 747 1547
+3 2276 85 1547
+3 1342 86 1548
+3 889 85 1548
+3 1447 162 1549
+3 1451 573 1549
+3 1424 151 1550
+3 920 115 1550
+3 2107 798 1551
+3 2197 118 1551
+3 2009 799 1552
+3 2357 121 1552
+3 1293 199 1553
+3 1247 118 1553
+3 1399 141 1554
+3 912 121 1554
+3 1167 392 1555
+3 1629 124 1555
+3 2049 800 1556
+3 2416 126 1556
+3 943 199 1557
+3 1293 124 1557
+3 1434 155 1558
+3 922 126 1558
+3 1920 801 1559
+3 1966 128 1559
+3 1963 802 1560
+3 1867 102 1560
+3 1157 286 1561
+3 1118 128 1561
+3 1353 103 1562
+3 895 102 1562
+3 1036 392 1563
+3 1167 132 1563
+3 1947 803 1564
+3 2264 76 1564
+3 976 286 1565
+3 1157 132 1565
+3 1334 77 1566
+3 886 76 1566
+3 1087 448 1567
+3 2022 136 1567
+3 1451 162 1568
+3 927 136 1568
+3 2001 804 1569
+3 2349 139 1569
+3 1395 140 1570
+3 911 139 1570
+3 1994 566 1571
+3 2341 137 1571
+3 1391 138 1572
+3 910 137 1572
+3 1979 805 1573
+3 2319 119 1573
+3 1378 120 1574
+3 902 119 1574
+3 1943 806 1575
+3 2253 71 1575
+3 1328 72 1576
+3 884 71 1576
+3 1933 807 1577
+3 2220 56 1577
+3 1312 57 1578
+3 879 56 1578
+3 1139 518 1579
+3 2026 145 1579
+3 1464 165 1580
+3 930 145 1580
+3 2043 808 1581
+3 2403 148 1581
+3 1421 150 1582
+3 919 148 1582
+3 1957 809 1583
+3 2282 91 1583
+3 1345 92 1584
+3 891 91 1584
+3 1939 810 1585
+3 2245 68 1585
+3 1324 69 1586
+3 883 68 1586
+3 2031 811 1587
+3 2383 146 1587
+3 1411 147 1588
+3 916 146 1588
+3 1975 812 1589
+3 2312 113 1589
+3 114 1590 813
+3 900 113 1590
+3 1359 745 1591
+3 814 1591 745
+3 1983 780 1592
+3 1498 125 1592
+3 870 40 1593
+3 904 125 1593
+3 2058 815 1594
+3 2008 160 1594
+3 1448 161 1595
+3 926 160 1595
+3 816 1596 546
+3 2295 105 1596
+3 1356 106 1597
+3 896 105 1597
+3 1083 445 1598
+3 2424 158 1598
+3 1442 159 1599
+3 924 158 1599
+3 1988 817 1600
+3 2337 134 1600
+3 966 261 1601
+3 2237 65 1601
+3 1320 66 1602
+3 882 65 1602
+3 1959 818 1603
+3 1859 96 1603
+3 1349 97 1604
+3 893 96 1604
+3 2027 796 1605
+3 2375 143 1605
+3 1407 144 1606
+3 915 143 1606
+3 1951 819 1607
+3 2272 82 1607
+3 1338 83 1608
+3 888 82 1608
+3 2369 789 1609
+3 2023 170 1609
+3 1191 389 1610
+3 1034 170 1610
+3 2282 809 1611
+3 2279 820 1611
+3 1344 742 1612
+3 820 1612 742
+3 1648 791 1613
+3 2072 176 1613
+3 1223 433 1614
+3 1075 176 1614
+3 2272 819 1615
+3 2268 179 1615
+3 1336 340 1616
+3 1002 179 1616
+3 2395 792 1617
+3 2039 182 1617
+3 1199 402 1618
+3 1044 182 1618
+3 2253 806 1619
+3 2249 185 1619
+3 1326 326 1620
+3 994 185 1620
+3 2329 337 1621
+3 1057 188 1621
+3 1179 376 1622
+3 1024 188 1622
+3 1902 821 1623
+3 2298 191 1623
+3 1357 356 1624
+3 1011 191 1624
+3 2436 509 1625
+3 1131 194 1625
+3 1217 427 1626
+3 1068 194 1626
+3 1867 802 1627
+3 2291 197 1627
+3 1351 117 1628
+3 1009 197 1628
+3 1555 392 1629
+3 2054 200 1629
+3 1209 420 1630
+3 1058 200 1630
+3 2237 261 1631
+3 2233 203 1631
+3 1318 318 1632
+3 990 203 1632
+3 2266 822 1633
+3 2393 655 1633
+3 2440 509 1634
+3 2436 206 1634
+3 1416 340 1635
+3 1336 655 1635
+3 1458 211 1636
+3 1069 206 1636
+3 2120 823 1637
+3 1740 212 1637
+3 1531 789 1638
+3 2369 215 1638
+3 1285 208 1639
+3 1254 212 1639
+3 1405 390 1640
+3 1035 215 1640
+3 2353 799 1641
+3 2009 218 1641
+3 946 208 1642
+3 1285 699 1642
+3 1187 385 1643
+3 1030 218 1643
+3 2424 445 1644
+3 2420 221 1644
+3 1438 418 1645
+3 1056 221 1645
+3 2291 802 1646
+3 1963 224 1646
+3 1156 354 1647
+3 1008 224 1647
+3 1666 791 1648
+3 1613 227 1648
+3 1762 281 1649
+3 1708 662 1649
+3 2014 448 1650
+3 1087 230 1650
+3 935 175 1651
+3 1274 227 1651
+3 994 326 1652
+3 1382 662 1652
+3 1213 423 1653
+3 1063 230 1653
+3 1426 765 1654
+3 1935 232 1654
+3 1985 824 1655
+3 1864 571 1655
+3 2357 799 1656
+3 2353 235 1656
+3 1128 254 1657
+3 1108 232 1657
+3 1079 376 1658
+3 1179 571 1658
+3 1397 386 1659
+3 1031 235 1659
+3 1183 471 1660
+3 825 1660 471
+3 1013 359 1661
+3 362 1661 359
+3 1498 780 1662
+3 1490 246 1662
+3 866 31 1663
+3 1021 246 1663
+3 2249 806 1664
+3 1943 249 1664
+3 1142 325 1665
+3 993 249 1665
+3 2095 791 1666
+3 1648 255 1666
+3 952 226 1667
+3 1076 255 1667
+3 2445 518 1668
+3 1139 259 1668
+3 1219 429 1669
+3 1071 259 1669
+3 2408 826 1670
+3 2405 265 1670
+3 1422 406 1671
+3 1048 265 1671
+3 2279 809 1672
+3 1957 268 1672
+3 1152 347 1673
+3 1005 268 1673
+3 1543 792 1674
+3 2395 271 1674
+3 1417 403 1675
+3 1045 271 1675
+3 2379 811 1676
+3 2031 274 1676
+3 1195 398 1677
+3 1040 274 1677
+3 1490 780 1678
+3 1983 280 1678
+3 1174 373 1679
+3 1020 280 1679
+3 2022 448 1680
+3 2014 284 1680
+3 1449 424 1681
+3 1064 284 1681
+3 2026 518 1682
+3 2445 295 1682
+3 1463 430 1683
+3 1072 295 1683
+3 2233 261 1684
+3 966 260 1684
+3 1134 317 1685
+3 989 260 1685
+3 2383 811 1686
+3 2379 300 1686
+3 1409 399 1687
+3 1041 300 1687
+3 2268 819 1688
+3 1951 303 1688
+3 1149 339 1689
+3 1000 303 1689
+3 2365 793 1690
+3 2361 308 1690
+3 1401 388 1691
+3 1033 308 1691
+3 2301 790 1692
+3 1971 311 1692
+3 1160 361 1693
+3 1014 311 1693
+3 979 795 1694
+3 1228 313 1694
+3 1466 432 1695
+3 1074 313 1695
+3 2430 549 1696
+3 2064 316 1696
+3 1215 426 1697
+3 1066 316 1697
+3 1803 776 1698
+3 1795 296 1698
+3 1299 297 1699
+3 980 296 1699
+3 2117 772 1700
+3 1884 201 1700
+3 1094 202 1701
+3 944 201 1701
+3 2391 797 1702
+3 2387 321 1702
+3 1413 401 1703
+3 1043 321 1703
+3 2361 793 1704
+3 2015 324 1704
+3 1189 387 1705
+3 1032 324 1705
+3 2157 777 1706
+3 2153 247 1706
+3 1271 248 1707
+3 961 247 1707
+3 1649 281 1708
+3 1873 183 1708
+3 1086 184 1709
+3 938 183 1709
+3 2325 415 1710
+3 2321 332 1710
+3 1379 375 1711
+3 1023 332 1711
+3 1228 795 1712
+3 2068 336 1712
+3 1221 431 1713
+3 1073 336 1713
+3 2212 783 1714
+3 2208 301 1714
+3 1303 302 1715
+3 982 301 1715
+3 2085 773 1716
+3 1868 177 1716
+3 1080 178 1717
+3 936 177 1717
+3 2304 790 1718
+3 2301 343 1718
+3 1366 363 1719
+3 1016 343 1719
+3 2387 797 1720
+3 2035 346 1720
+3 1197 400 1721
+3 1042 346 1721
+3 2172 770 1722
+3 2168 266 1722
+3 1278 267 1723
+3 969 266 1723
+3 1161 549 1724
+3 2430 350 1724
+3 1454 46 1725
+3 1067 350 1725
+3 2321 415 1726
+3 1053 353 1726
+3 1177 374 1727
+3 1022 353 1727
+3 2138 785 1728
+3 2134 222 1728
+3 1261 223 1729
+3 951 222 1729
+3 2109 774 1730
+3 1880 195 1730
+3 1092 196 1731
+3 942 195 1731
+3 2005 782 1732
+3 1906 584 1732
+3 2195 787 1733
+3 2191 827 1733
+3 1105 385 1734
+3 1187 584 1734
+3 1291 705 1735
+3 827 1735 705
+3 2101 775 1736
+3 1876 189 1736
+3 1090 190 1737
+3 940 189 1737
+3 2079 292 1738
+3 1860 171 1738
+3 172 1739 291
+3 171 1739 172
+3 1637 823 1740
+3 2296 700 1740
+3 2220 807 1741
+3 2216 309 1741
+3 1309 310 1742
+3 986 309 1742
+3 1367 747 1743
+3 1953 341 1743
+3 1150 342 1744
+3 1003 341 1744
+3 1795 776 1745
+3 1925 828 1745
+3 2119 772 1746
+3 2117 829 1746
+3 1251 673 1747
+3 829 1747 673
+3 2403 808 1748
+3 2399 366 1748
+3 1419 405 1749
+3 1047 366 1749
+3 2349 804 1750
+3 2345 369 1750
+3 1393 384 1751
+3 1029 369 1751
+3 2412 800 1752
+3 2049 372 1752
+3 1205 410 1753
+3 1050 372 1753
+3 2188 778 1754
+3 2184 278 1754
+3 1287 279 1755
+3 973 278 1755
+3 2153 777 1756
+3 1908 244 1756
+3 1106 245 1757
+3 959 244 1757
+3 1859 818 1758
+3 2286 351 1758
+3 1347 352 1759
+3 1007 351 1759
+3 2260 803 1760
+3 1947 330 1760
+3 1146 331 1761
+3 996 330 1761
+3 2096 281 1762
+3 1649 186 1762
+3 1239 187 1763
+3 939 186 1763
+3 2184 778 1764
+3 1914 275 1764
+3 1114 276 1765
+3 972 275 1765
+3 2008 815 1766
+3 2000 379 1766
+3 1446 422 1767
+3 1062 379 1767
+3 2345 804 1768
+3 2001 382 1768
+3 1185 383 1769
+3 1028 382 1769
+3 2337 817 1770
+3 2333 380 1770
+3 1387 381 1771
+3 1027 380 1771
+3 2315 805 1772
+3 1979 367 1772
+3 1170 368 1773
+3 1018 367 1773
+3 2130 781 1774
+3 2128 216 1774
+3 1257 217 1775
+3 949 216 1775
+3 2146 653 1776
+3 1903 233 1776
+3 1104 234 1777
+3 955 233 1777
+3 2245 810 1778
+3 2241 322 1778
+3 1322 323 1779
+3 992 322 1779
+3 2216 807 1780
+3 1933 306 1780
+3 1125 307 1781
+3 984 306 1781
+3 830 1782 443
+3 2076 168 1782
+3 1225 169 1783
+3 933 168 1783
+3 2128 781 1784
+3 1892 213 1784
+3 1098 214 1785
+3 948 213 1785
+3 2399 808 1786
+3 2043 397 1786
+3 1201 404 1787
+3 1046 397 1787
+3 2180 771 1788
+3 2176 272 1788
+3 1282 273 1789
+3 971 272 1789
+3 2208 783 1790
+3 1929 298 1790
+3 1123 299 1791
+3 981 298 1791
+3 2276 747 1792
+3 1367 344 1792
+3 1317 728 1793
+3 831 1793 728
+3 1340 345 1794
+3 1004 344 1794
+3 1698 776 1795
+3 1745 714 1795
+3 2241 810 1796
+3 1939 319 1796
+3 728 1797 828
+3 1317 714 1797
+3 1138 320 1798
+3 991 319 1798
+3 962 251 1799
+3 1886 256 1799
+3 2089 773 1800
+3 2085 180 1800
+3 1095 317 1801
+3 1134 256 1801
+3 1235 181 1802
+3 937 180 1802
+3 1480 776 1803
+3 1698 461 1803
+3 2176 771 1804
+3 1443 269 1804
+3 989 317 1805
+3 1095 461 1805
+3 1112 270 1806
+3 970 269 1806
+3 2375 796 1807
+3 1535 396 1807
+3 890 89 1808
+3 1039 396 1808
+3 2310 812 1809
+3 1975 364 1809
+3 1166 365 1810
+3 1017 364 1810
+3 2168 770 1811
+3 1439 263 1811
+3 1110 264 1812
+3 967 263 1812
+3 2319 805 1813
+3 2315 370 1813
+3 1376 371 1814
+3 1019 370 1814
+3 2000 815 1815
+3 2058 414 1815
+3 1211 421 1816
+3 1061 414 1816
+3 2203 786 1817
+3 2199 288 1817
+3 1294 289 1818
+3 977 288 1818
+3 2134 785 1819
+3 1896 219 1819
+3 1100 220 1820
+3 950 219 1820
+3 2113 774 1821
+3 2109 198 1821
+3 1247 199 1822
+3 943 198 1822
+3 2199 786 1823
+3 1922 285 1823
+3 1118 286 1824
+3 976 285 1824
+3 2416 800 1825
+3 2412 412 1825
+3 1430 413 1826
+3 1052 412 1826
+3 2333 817 1827
+3 1988 377 1827
+3 1181 378 1828
+3 1026 377 1828
+3 832 1829 494
+3 2140 228 1829
+3 229 1830 833
+3 953 228 1830
+3 2191 787 1831
+3 1918 282 1831
+3 1116 283 1832
+3 975 282 1832
+3 2312 812 1833
+3 2310 834 1833
+3 1374 753 1834
+3 834 1834 753
+3 2124 788 1835
+3 2122 207 1835
+3 1254 208 1836
+3 946 207 1836
+3 2229 242 1837
+3 2225 314 1837
+3 1314 315 1838
+3 988 314 1838
+3 2286 818 1839
+3 1959 348 1839
+3 1154 349 1840
+3 1006 348 1840
+3 2105 775 1841
+3 2101 192 1841
+3 1243 193 1842
+3 941 192 1842
+3 2122 788 1843
+3 1888 204 1843
+3 1096 205 1844
+3 945 204 1844
+3 1535 796 1845
+3 2027 393 1845
+3 394 1846 595
+3 1037 393 1846
+3 2165 768 1847
+3 2161 257 1847
+3 1275 258 1848
+3 965 257 1848
+3 2264 803 1849
+3 2260 334 1849
+3 1332 335 1850
+3 998 334 1850
+3 2225 242 1851
+3 958 241 1851
+3 1130 312 1852
+3 987 241 1852
+3 2083 292 1853
+3 2079 174 1853
+3 1229 175 1854
+3 935 174 1854
+3 2161 768 1855
+3 1431 253 1855
+3 1108 254 1856
+3 963 253 1856
+3 1216 374 1857
+3 1177 411 1857
+3 294 1858 295
+3 592 1858 294
+3 1603 818 1859
+3 1758 632 1859
+3 1738 292 1860
+3 978 291 1860
+3 1022 374 1861
+3 1216 632 1861
+3 860 14 1862
+3 1362 291 1862
+3 1878 408 1863
+3 1049 407 1863
+3 1655 824 1864
+3 2270 437 1864
+3 1176 196 1865
+3 1092 407 1865
+3 1337 9 1866
+3 1241 437 1866
+3 1560 802 1867
+3 1627 568 1867
+3 1716 773 1868
+3 1473 439 1868
+3 942 196 1869
+3 1176 568 1869
+3 857 9 1870
+3 1337 439 1870
+3 1143 525 1871
+3 2222 444 1871
+3 2087 835 1872
+3 2251 2 1872
+3 1708 281 1873
+3 974 7 1873
+3 2111 836 1874
+3 1898 451 1874
+3 1358 13 1875
+3 1249 451 1875
+3 1736 775 1876
+3 1477 453 1876
+3 859 13 1877
+3 1358 453 1877
+3 2103 408 1878
+3 1863 455 1878
+3 1352 11 1879
+3 1245 455 1879
+3 1730 774 1880
+3 1475 456 1880
+3 858 11 1881
+3 1352 456 1881
+3 2081 837 1882
+3 2235 458 1882
+3 1319 4 1883
+3 1231 458 1883
+3 1700 772 1884
+3 1470 460 1884
+3 854 4 1885
+3 1319 460 1885
+3 1799 251 1886
+3 2438 462 1886
+3 1459 54 1887
+3 1301 462 1887
+3 1843 788 1888
+3 1512 463 1888
+3 877 54 1889
+3 1459 463 1889
+3 2155 794 1890
+3 1527 465 1890
+3 885 33 1891
+3 1273 465 1891
+3 1784 781 1892
+3 1491 74 1892
+3 867 33 1893
+3 885 74 1893
+3 2186 838 1894
+3 2422 467 1894
+3 1440 49 1895
+3 1289 467 1895
+3 1819 785 1896
+3 1506 469 1896
+3 874 49 1897
+3 1440 469 1897
+3 1874 836 1898
+3 2045 452 1898
+3 2149 839 1899
+3 2355 472 1899
+3 1202 190 1900
+3 1090 452 1900
+3 1398 28 1901
+3 1269 472 1901
+3 821 1902 814
+3 1623 611 1902
+3 1776 653 1903
+3 1489 475 1903
+3 940 190 1904
+3 1202 611 1904
+3 865 28 1905
+3 1398 475 1905
+3 1732 782 1906
+3 1494 477 1906
+3 868 19 1907
+3 1259 477 1907
+3 1756 777 1908
+3 1482 34 1908
+3 862 19 1909
+3 868 34 1909
+3 892 43 1910
+3 1280 112 1910
+3 871 43 1911
+3 892 94 1911
+3 2136 328 1912
+3 995 327 1912
+3 1384 22 1913
+3 1263 327 1913
+3 1764 778 1914
+3 1484 486 1914
+3 863 22 1915
+3 1384 486 1915
+3 2201 441 1916
+3 2018 488 1916
+3 1450 53 1917
+3 1296 488 1917
+3 1831 787 1918
+3 1510 490 1918
+3 876 53 1919
+3 1450 490 1919
+3 2193 801 1920
+3 1559 493 1920
+3 905 51 1921
+3 1292 493 1921
+3 1823 786 1922
+3 1508 127 1922
+3 875 51 1923
+3 905 127 1923
+3 1371 16 1924
+3 1255 498 1924
+3 1745 776 1925
+3 1480 748 1925
+3 861 16 1926
+3 1371 748 1926
+3 2163 513 1927
+3 2381 500 1927
+3 1410 37 1928
+3 1277 500 1928
+3 1790 783 1929
+3 1495 502 1929
+3 869 37 1930
+3 1410 502 1930
+3 1527 794 1931
+3 2363 79 1931
+3 1402 80 1932
+3 887 79 1932
+3 1780 807 1933
+3 1577 504 1933
+3 914 80 1934
+3 1402 504 1934
+3 1654 765 1935
+3 1192 236 1935
+3 1467 167 1936
+3 956 236 1936
+3 1539 111 1937
+3 2389 99 1937
+3 1414 100 1938
+3 894 99 1938
+3 1796 810 1939
+3 1585 517 1939
+3 918 100 1940
+3 1414 517 1940
+3 2363 794 1941
+3 2155 521 1941
+3 1272 142 1942
+3 1403 521 1942
+3 1664 806 1943
+3 1575 523 1943
+3 913 142 1944
+3 1272 523 1944
+3 995 328 1945
+3 2323 333 1945
+3 1380 133 1946
+3 1385 333 1946
+3 1760 803 1947
+3 1564 528 1947
+3 908 133 1948
+3 1380 528 1948
+3 1192 765 1949
+3 2210 530 1949
+3 1304 166 1950
+3 1468 530 1950
+3 1688 819 1951
+3 1607 532 1951
+3 931 166 1952
+3 1304 532 1952
+3 1743 747 1953
+3 1547 534 1953
+3 898 109 1954
+3 1368 534 1954
+3 2389 111 1955
+3 2170 536 1955
+3 1279 149 1956
+3 1415 536 1956
+3 1672 809 1957
+3 1583 537 1957
+3 917 149 1958
+3 1279 537 1958
+3 1839 818 1959
+3 1603 539 1959
+3 929 164 1960
+3 1455 539 1960
+3 2323 328 1961
+3 2136 541 1961
+3 1262 129 1962
+3 1381 541 1962
+3 1646 802 1963
+3 1560 543 1963
+3 906 129 1964
+3 1262 543 1964
+3 1990 801 1965
+3 2193 841 1965
+3 1559 801 1966
+3 1990 130 1966
+3 1444 131 1967
+3 907 130 1967
+3 925 131 1968
+3 1444 546 1968
+3 2222 525 1969
+3 2218 843 1969
+3 1310 60 1970
+3 843 1970 60
+3 1692 790 1971
+3 1518 548 1971
+3 880 60 1972
+3 1310 548 1972
+3 2406 769 1973
+3 2401 552 1973
+3 1420 151 1974
+3 1424 552 1974
+3 1809 812 1975
+3 1589 555 1975
+3 920 151 1976
+3 1420 555 1976
+3 2355 839 1977
+3 2347 557 1977
+3 1394 141 1978
+3 1399 557 1978
+3 1772 805 1979
+3 1573 559 1979
+3 912 141 1980
+3 1394 559 1980
+3 2414 838 1981
+3 2186 562 1981
+3 1288 155 1982
+3 1434 562 1982
+3 1678 780 1983
+3 1592 564 1983
+3 922 155 1984
+3 1288 564 1984
+3 2262 824 1985
+3 1655 570 1985
+3 1240 77 1986
+3 1334 570 1986
+3 2018 441 1987
+3 2004 573 1987
+3 1827 817 1988
+3 1600 574 1988
+3 927 162 1989
+3 1447 574 1989
+3 1966 801 1990
+3 1965 544 1990
+3 2347 839 1991
+3 2149 576 1991
+3 545 1992 841
+3 1158 544 1992
+3 1268 140 1993
+3 1395 576 1993
+3 566 1994 825
+3 1571 578 1994
+3 911 140 1995
+3 1268 578 1995
+3 2410 844 1996
+3 2331 766 1996
+3 2339 153 1997
+3 2335 579 1997
+3 1386 413 1998
+3 1430 766 1998
+3 1388 138 1999
+3 1391 579 1999
+3 1766 815 2000
+3 1815 759 2000
+3 1768 804 2001
+3 1569 581 2001
+3 1052 413 2002
+3 1386 759 2002
+3 910 138 2003
+3 1388 581 2003
+3 1987 441 2004
+3 1081 440 2004
+3 2317 782 2005
+3 1732 583 2005
+3 1206 378 2006
+3 1181 440 2006
+3 1258 120 2007
+3 1378 583 2007
+3 1594 815 2008
+3 1766 618 2008
+3 1641 799 2009
+3 1552 585 2009
+3 1026 378 2010
+3 1206 618 2010
+3 902 120 2011
+3 1258 585 2011
+3 2251 835 2012
+3 2243 587 2012
+3 1323 72 2013
+3 1328 587 2013
+3 1680 448 2014
+3 1650 702 2014
+3 1704 793 2015
+3 1525 589 2015
+3 953 229 2016
+3 1290 702 2016
+3 884 72 2017
+3 1323 589 2017
+3 1916 441 2018
+3 1987 489 2018
+3 2218 525 2019
+3 1143 524 2019
+3 1180 283 2020
+3 1116 489 2020
+3 1226 57 2021
+3 1312 524 2021
+3 1567 448 2022
+3 1680 572 2022
+3 1609 789 2023
+3 1516 591 2023
+3 975 283 2024
+3 1180 572 2024
+3 879 57 2025
+3 1226 591 2025
+3 1579 518 2026
+3 1682 592 2026
+3 1845 796 2027
+3 1605 595 2027
+3 930 165 2028
+3 1461 595 2028
+3 2401 769 2029
+3 2178 597 2029
+3 1283 150 2030
+3 1421 597 2030
+3 1676 811 2031
+3 1587 599 2031
+3 919 150 2032
+3 1283 599 2032
+3 359 2033 845
+3 2274 602 2033
+3 1341 92 2034
+3 1345 602 2034
+3 1720 797 2035
+3 1536 603 2035
+3 891 92 2036
+3 1341 603 2036
+3 2243 835 2037
+3 2087 605 2037
+3 1236 69 2038
+3 1324 605 2038
+3 1617 792 2039
+3 1523 607 2039
+3 883 69 2040
+3 1236 607 2040
+3 2381 513 2041
+3 2373 609 2041
+3 1406 147 2042
+3 1411 609 2042
+3 1786 808 2043
+3 1581 610 2043
+3 916 147 2044
+3 1406 610 2044
+3 1898 836 2045
+3 2293 612 2045
+3 1355 745 2046
+3 1359 612 2046
+3 1494 782 2047
+3 2317 39 2047
+3 1377 40 2048
+3 870 39 2048
+3 1752 800 2049
+3 1556 617 2049
+3 904 40 2050
+3 1377 617 2050
+3 1295 161 2051
+3 1448 442 2051
+3 2293 836 2052
+3 2111 621 2052
+3 1248 106 2053
+3 1356 621 2053
+3 1629 392 2054
+3 1036 391 2054
+3 896 106 2055
+3 1248 391 2055
+3 2422 838 2056
+3 2414 624 2056
+3 1432 159 2057
+3 1442 624 2057
+3 1815 815 2058
+3 1594 626 2058
+3 924 159 2059
+3 1432 626 2059
+3 2335 153 2060
+3 2141 627 2060
+3 1264 135 2061
+3 1389 627 2061
+3 2235 837 2062
+3 2227 629 2062
+3 1315 66 2063
+3 1320 629 2063
+3 1696 549 2064
+3 1521 631 2064
+3 882 66 2065
+3 1315 631 2065
+3 2270 824 2066
+3 2262 635 2066
+3 1333 83 2067
+3 1338 635 2067
+3 1712 795 2068
+3 1532 637 2068
+3 888 83 2069
+3 1333 637 2069
+3 2227 837 2070
+3 2081 638 2070
+3 1230 63 2071
+3 1316 638 2071
+3 1613 791 2072
+3 1519 640 2072
+3 881 63 2073
+3 1230 640 2073
+3 2255 846 2074
+3 2367 642 2074
+3 1404 733 2075
+3 1330 642 2075
+3 1782 830 2076
+3 644 2076 830
+3 1425 719 2077
+3 2091 649 2077
+3 1469 357 2078
+3 1361 649 2078
+3 1853 292 2079
+3 1738 651 2079
+3 1012 357 2080
+3 1469 651 2080
+3 2070 837 2081
+3 1882 639 2081
+3 1093 433 2082
+3 1223 639 2082
+3 978 292 2083
+3 1853 457 2083
+3 1075 433 2084
+3 1093 457 2084
+3 1800 773 2085
+3 1716 658 2085
+3 1002 340 2086
+3 1416 658 2086
+3 2037 835 2087
+3 1872 606 2087
+3 1084 402 2088
+3 1199 606 2088
+3 1473 773 2089
+3 1800 447 2089
+3 1044 402 2090
+3 1084 447 2090
+3 2077 719 2091
+3 2159 650 2091
+3 2247 779 2092
+3 2327 660 2092
+3 1274 175 2093
+3 1229 650 2093
+3 1382 326 2094
+3 1326 660 2094
+3 1519 791 2095
+3 1666 237 2095
+3 974 281 2096
+3 1762 436 2096
+3 963 254 2097
+3 1128 237 2097
+3 1024 376 2098
+3 1079 436 2098
+3 2296 823 2099
+3 2434 665 2099
+3 1457 356 2100
+3 1357 665 2100
+3 1841 775 2101
+3 1736 667 2101
+3 1011 356 2102
+3 1457 667 2102
+3 1127 408 2103
+3 1878 507 2103
+3 1091 427 2104
+3 1217 507 2104
+3 1477 775 2105
+3 1841 454 2105
+3 1068 427 2106
+3 1091 454 2106
+3 2289 798 2107
+3 1551 669 2107
+3 901 117 2108
+3 1351 669 2108
+3 1821 774 2109
+3 1730 116 2109
+3 1009 117 2110
+3 901 116 2110
+3 2052 836 2111
+3 1874 622 2111
+3 1088 420 2112
+3 1209 622 2112
+3 1475 774 2113
+3 1821 450 2113
+3 1058 420 2114
+3 1088 450 2114
+3 2231 848 2115
+3 2306 671 2115
+3 1372 318 2116
+3 1318 671 2116
+3 1746 772 2117
+3 1700 674 2117
+3 990 318 2118
+3 1372 674 2118
+3 1470 772 2119
+3 1746 676 2119
+3 2434 823 2120
+3 1637 678 2120
+3 947 211 2121
+3 1458 678 2121
+3 1835 788 2122
+3 1843 210 2122
+3 1069 211 2123
+3 947 210 2123
+3 1512 788 2124
+3 1835 497 2124
+3 1065 425 2125
+3 1121 497 2125
+3 2367 846 2126
+3 2351 680 2126
+3 1396 390 2127
+3 1405 680 2127
+3 1774 781 2128
+3 1784 682 2128
+3 1035 390 2129
+3 1396 682 2129
+3 1491 781 2130
+3 1774 476 2130
+3 1030 385 2131
+3 1105 476 2131
+3 2418 798 2132
+3 2289 683 2132
+3 1350 418 2133
+3 1438 683 2133
+3 1728 785 2134
+3 1819 685 2134
+3 1056 418 2135
+3 1350 685 2135
+3 1961 328 2136
+3 1912 542 2136
+3 1113 354 2137
+3 1156 542 2137
+3 1506 785 2138
+3 1728 485 2138
+3 1008 354 2139
+3 1113 485 2139
+3 1829 832 2140
+3 833 2140 832
+3 2060 153 2141
+3 921 152 2141
+3 1119 423 2142
+3 1213 152 2142
+3 1063 423 2143
+3 1119 494 2143
+3 2351 846 2144
+3 2255 687 2144
+3 1329 386 2145
+3 1397 687 2145
+3 1232 653 2146
+3 1776 656 2146
+3 1031 386 2147
+3 1329 656 2147
+3 1489 653 2148
+3 1232 652 2148
+3 1991 839 2149
+3 1899 577 2149
+3 1102 471 2150
+3 1183 577 2150
+3 1488 779 2151
+3 2247 30 2151
+3 1325 31 2152
+3 866 30 2152
+3 1706 777 2153
+3 1756 690 2153
+3 1021 31 2154
+3 1325 690 2154
+3 1941 794 2155
+3 1890 522 2155
+3 1097 325 2156
+3 1142 522 2156
+3 1482 777 2157
+3 1706 464 2157
+3 993 325 2158
+3 1097 464 2158
+3 2091 719 2159
+3 2443 225 2159
+3 1462 226 2160
+3 952 225 2160
+3 1847 768 2161
+3 1855 692 2161
+3 1076 226 2162
+3 1462 692 2162
+3 1135 513 2163
+3 1927 515 2163
+3 1122 429 2164
+3 1219 515 2164
+3 1514 768 2165
+3 1847 499 2165
+3 1071 429 2166
+3 1122 499 2166
+3 1343 406 2167
+3 1422 763 2167
+3 1722 770 2168
+3 1811 694 2168
+3 1048 406 2169
+3 1343 694 2169
+3 1955 111 2170
+3 899 110 2170
+3 1111 347 2171
+3 1152 110 2171
+3 1503 770 2172
+3 1722 484 2172
+3 1005 347 2173
+3 1111 484 2173
+3 2393 822 2174
+3 2377 696 2174
+3 1408 403 2175
+3 1417 696 2175
+3 1788 771 2176
+3 1804 698 2176
+3 1045 403 2177
+3 1408 698 2177
+3 2029 769 2178
+3 1435 598 2178
+3 1109 398 2179
+3 1195 598 2179
+3 1499 771 2180
+3 1788 480 2180
+3 1040 398 2181
+3 1109 480 2181
+3 2327 779 2182
+3 1488 701 2182
+3 864 25 2183
+3 1383 701 2183
+3 1754 778 2184
+3 1764 24 2184
+3 1025 25 2185
+3 864 24 2185
+3 1981 838 2186
+3 1894 563 2186
+3 1099 373 2187
+3 1174 563 2187
+3 1484 778 2188
+3 1754 466 2188
+3 1020 373 2189
+3 1099 466 2189
+3 1354 424 2190
+3 1449 703 2190
+3 1733 787 2191
+3 1831 706 2191
+3 1064 424 2192
+3 1354 706 2192
+3 1965 801 2193
+3 1920 840 2193
+3 1117 492 2194
+3 840 2194 492
+3 1510 787 2195
+3 1733 491 2195
+3 492 2196 827
+3 1117 491 2196
+3 1551 798 2197
+3 2418 122 2197
+3 1436 123 2198
+3 903 122 2198
+3 1817 786 2199
+3 1823 708 2199
+3 1060 123 2200
+3 1436 708 2200
+3 1081 441 2201
+3 1916 619 2201
+3 1115 417 2202
+3 1207 619 2202
+3 1508 786 2203
+3 1817 487 2203
+3 1054 417 2204
+3 1115 487 2204
+3 2306 848 2205
+3 849 2205 848
+3 2377 822 2206
+3 2266 716 2206
+3 1335 399 2207
+3 1409 716 2207
+3 1714 783 2208
+3 1790 718 2208
+3 1041 399 2209
+3 1335 718 2209
+3 1949 765 2210
+3 1426 531 2210
+3 1107 339 2211
+3 1149 531 2211
+3 1495 783 2212
+3 1714 478 2212
+3 1000 339 2213
+3 1107 478 2213
+3 2359 746 2214
+3 2299 721 2214
+3 1364 388 2215
+3 1401 721 2215
+3 1741 807 2216
+3 1780 723 2216
+3 1033 388 2217
+3 1364 723 2217
+3 1969 525 2218
+3 2019 547 2218
+3 1190 361 2219
+3 1160 547 2219
+3 1577 807 2220
+3 1741 590 2220
+3 1014 361 2221
+3 1190 590 2221
+3 1871 525 2222
+3 1969 842 2222
+3 1311 784 2223
+3 2428 725 2223
+3 1453 432 2224
+3 1466 725 2224
+3 1837 242 2225
+3 1851 727 2225
+3 1074 432 2226
+3 1453 727 2226
+3 2062 837 2227
+3 2070 630 2227
+3 1222 426 2228
+3 1215 630 2228
+3 1101 242 2229
+3 1837 473 2229
+3 1066 426 2230
+3 1222 473 2230
+3 848 2231 831
+3 2115 713 2231
+3 1250 297 2232
+3 1299 713 2232
+3 1631 261 2233
+3 1684 670 2233
+3 980 297 2234
+3 1250 670 2234
+3 1882 837 2235
+3 2062 459 2235
+3 1214 202 2236
+3 1094 459 2236
+3 1601 261 2237
+3 1631 628 2237
+3 944 202 2238
+3 1214 628 2238
+3 2385 746 2239
+3 2359 730 2239
+3 1400 401 2240
+3 1413 730 2240
+3 1778 810 2241
+3 1796 732 2241
+3 1043 401 2242
+3 1400 732 2242
+3 2012 835 2243
+3 2037 588 2243
+3 1198 387 2244
+3 1189 588 2244
+3 1585 810 2245
+3 1778 604 2245
+3 1032 387 2246
+3 1198 604 2246
+3 2151 779 2247
+3 2092 689 2247
+3 1238 248 2248
+3 1271 689 2248
+3 1619 806 2249
+3 1664 659 2249
+3 961 248 2250
+3 1238 659 2250
+3 1872 835 2251
+3 2012 0 2251
+3 1188 184 2252
+3 1086 0 2252
+3 1575 806 2253
+3 1619 586 2253
+3 938 184 2254
+3 1188 586 2254
+3 2144 846 2255
+3 2074 688 2255
+3 1224 239 2256
+3 1267 688 2256
+3 957 239 2257
+3 1224 641 2257
+3 1502 784 2258
+3 1311 735 2258
+3 1465 375 2259
+3 1379 735 2259
+3 1849 803 2260
+3 1760 737 2260
+3 1023 375 2261
+3 1465 737 2261
+3 2066 824 2262
+3 1985 636 2262
+3 1178 431 2263
+3 1221 636 2263
+3 1564 803 2264
+3 1849 569 2264
+3 1073 431 2265
+3 1178 569 2265
+3 2206 822 2266
+3 1633 717 2266
+3 1233 302 2267
+3 1303 717 2267
+3 1615 819 2268
+3 1688 654 2268
+3 982 302 2269
+3 1233 654 2269
+3 1864 824 2270
+3 2066 438 2270
+3 1220 178 2271
+3 1080 438 2271
+3 1607 819 2272
+3 1615 634 2272
+3 936 178 2273
+3 1220 634 2273
+3 2033 359 2274
+3 1013 358 2274
+3 1162 400 2275
+3 1197 358 2275
+3 1547 747 2276
+3 1792 550 2276
+3 1042 400 2277
+3 1162 550 2277
+3 1227 267 2278
+3 1278 693 2278
+3 1611 809 2279
+3 1672 645 2279
+3 969 267 2280
+3 1227 645 2280
+3 1196 601 2281
+3 845 2281 601
+3 1583 809 2282
+3 1611 600 2282
+3 601 2283 820
+3 1196 600 2283
+3 2428 784 2284
+3 1502 744 2284
+3 872 46 2285
+3 1454 744 2285
+3 1758 818 2286
+3 1839 45 2286
+3 1067 46 2287
+3 872 45 2287
+3 1049 408 2288
+3 1127 411 2288
+3 2132 798 2289
+3 2107 684 2289
+3 1246 223 2290
+3 1261 684 2290
+3 1627 802 2291
+3 1646 668 2291
+3 951 223 2292
+3 1246 668 2292
+3 2045 836 2293
+3 2052 613 2293
+3 1208 614 2294
+3 1203 613 2294
+3 1596 816 2295
+3 620 2295 816
+3 1740 823 2296
+3 2099 847 2296
+3 1242 664 2297
+3 847 2297 664
+3 1623 821 2298
+3 663 2298 821
+3 2214 746 2299
+3 1363 722 2299
+3 1339 310 2300
+3 1309 722 2300
+3 1718 790 2301
+3 1692 738 2301
+3 986 310 2302
+3 1339 738 2302
+3 1126 342 2303
+3 1150 533 2303
+3 1518 790 2304
+3 1718 355 2304
+3 1003 342 2305
+3 1126 355 2305
+3 2115 848 2306
+3 2205 672 2306
+3 673 2307 849
+3 1251 672 2307
+3 2397 850 2308
+3 2426 751 2308
+3 1452 405 2309
+3 1419 751 2309
+3 1833 812 2310
+3 1809 754 2310
+3 1047 405 2311
+3 1452 754 2311
+3 1589 812 2312
+3 1833 813 2312
+3 2343 844 2313
+3 2410 756 2313
+3 1427 384 2314
+3 1393 756 2314
+3 1813 805 2315
+3 1772 758 2315
+3 1029 384 2316
+3 1427 758 2316
+3 2047 782 2317
+3 2005 616 2317
+3 1186 410 2318
+3 1205 616 2318
+3 1573 805 2319
+3 1813 582 2319
+3 1270 279 2320
+3 1287 26 2320
+3 1710 415 2321
+3 1726 734 2321
+3 1007 352 2322
+3 1331 734 2322
+3 1945 328 2323
+3 1961 527 2323
+3 1155 331 2324
+3 1146 527 2324
+3 1544 415 2325
+3 1710 540 2325
+3 996 331 2326
+3 1155 540 2326
+3 2092 779 2327
+3 2182 661 2327
+3 1286 187 2328
+3 1239 661 2328
+3 1163 337 2329
+3 1621 553 2329
+3 939 187 2330
+3 1286 553 2330
+3 1996 844 2331
+3 2343 760 2331
+3 1392 422 2332
+3 1446 760 2332
+3 1770 817 2333
+3 1827 762 2333
+3 1062 422 2334
+3 1392 762 2334
+3 1997 153 2335
+3 2060 580 2335
+3 1212 383 2336
+3 1185 580 2336
+3 1600 817 2337
+3 1770 434 2337
+3 1028 383 2338
+3 1212 434 2338
+3 921 153 2339
+3 1997 156 2339
+3 1184 495 2340
+3 1120 156 2340
+3 1571 566 2341
+3 1175 565 2341
+3 495 2342 567
+3 1184 565 2342
+3 2331 844 2343
+3 2313 761 2343
+3 1375 381 2344
+3 1387 761 2344
+3 1750 804 2345
+3 1768 755 2345
+3 1027 381 2346
+3 1375 755 2346
+3 1977 839 2347
+3 1991 558 2347
+3 1182 368 2348
+3 1170 558 2348
+3 1569 804 2349
+3 1750 575 2349
+3 1018 368 2350
+3 1182 575 2350
+3 2126 846 2351
+3 2144 681 2351
+3 1266 217 2352
+3 1257 681 2352
+3 1656 799 2353
+3 1641 686 2353
+3 949 217 2354
+3 1266 686 2354
+3 1899 839 2355
+3 1977 474 2355
+3 1168 234 2356
+3 1104 474 2356
+3 1552 799 2357
+3 1656 556 2357
+3 955 234 2358
+3 1168 556 2358
+3 2239 746 2359
+3 2214 731 2359
+3 1307 323 2360
+3 1322 731 2360
+3 1690 793 2361
+3 1704 720 2361
+3 992 323 2362
+3 1307 720 2362
+3 1931 794 2363
+3 1941 503 2363
+3 1140 307 2364
+3 1125 503 2364
+3 1525 793 2365
+3 1690 520 2365
+3 984 307 2366
+3 1140 520 2366
+3 2074 846 2367
+3 2126 643 2367
+3 1256 169 2368
+3 1225 643 2368
+3 1638 789 2369
+3 1609 679 2369
+3 933 169 2370
+3 1256 679 2370
+3 2442 850 2371
+3 2397 852 2371
+3 1418 428 2372
+3 852 2372 428
+3 2041 513 2373
+3 1135 512 2373
+3 1218 404 2374
+3 1201 512 2374
+3 1605 796 2375
+3 1807 633 2375
+3 1046 404 2376
+3 1218 633 2376
+3 2174 822 2377
+3 2206 697 2377
+3 1302 273 2378
+3 1282 697 2378
+3 1686 811 2379
+3 1676 715 2379
+3 971 273 2380
+3 1302 715 2380
+3 1927 513 2381
+3 2041 501 2381
+3 1200 299 2382
+3 1123 501 2382
+3 1587 811 2383
+3 1686 608 2383
+3 981 299 2384
+3 1200 608 2384
+3 1363 746 2385
+3 2239 740 2385
+3 1321 345 2386
+3 1340 740 2386
+3 1702 797 2387
+3 1720 729 2387
+3 1004 345 2388
+3 1321 729 2388
+3 1937 111 2389
+3 1955 516 2389
+3 1151 320 2390
+3 1138 516 2390
+3 1536 797 2391
+3 1702 535 2391
+3 991 320 2392
+3 1151 535 2392
+3 1633 822 2393
+3 2174 657 2393
+3 1281 181 2394
+3 1235 657 2394
+3 1674 792 2395
+3 1617 695 2395
+3 937 181 2396
+3 1281 695 2396
+3 2371 850 2397
+3 2308 88 2397
+3 1373 89 2398
+3 890 88 2398
+3 1748 808 2399
+3 1786 750 2399
+3 1039 89 2400
+3 1373 750 2400
+3 1973 769 2401
+3 2029 554 2401
+3 1194 365 2402
+3 1166 554 2402
+3 1581 808 2403
+3 1748 596 2403
+3 1017 365 2404
+3 1194 596 2404
+3 1670 826 2405
+3 764 2405 826
+3 1435 769 2406
+3 1973 482 2406
+3 1164 264 2407
+3 1110 482 2407
+3 826 2408 115
+3 1670 551 2408
+3 967 264 2409
+3 1164 551 2409
+3 2313 844 2410
+3 1996 757 2410
+3 1445 371 2411
+3 1376 757 2411
+3 1825 800 2412
+3 1752 767 2412
+3 1019 371 2413
+3 1445 767 2413
+3 2056 838 2414
+3 1981 625 2414
+3 1172 421 2415
+3 1211 625 2415
+3 1556 800 2416
+3 1825 561 2416
+3 1061 421 2417
+3 1172 561 2417
+3 2197 798 2418
+3 2132 707 2418
+3 1260 289 2419
+3 1294 707 2419
+3 1644 445 2420
+3 1171 560 2420
+3 977 289 2421
+3 1260 560 2421
+3 1894 838 2422
+3 2056 468 2422
+3 1210 220 2423
+3 1100 468 2423
+3 1598 445 2424
+3 1644 623 2424
+3 950 220 2425
+3 1210 623 2425
+3 2308 850 2426
+3 2442 752 2426
+3 753 2427 851
+3 1374 752 2427
+3 2223 784 2428
+3 2284 726 2428
+3 1346 315 2429
+3 1314 726 2429
+3 1724 549 2430
+3 1696 743 2430
+3 988 315 2431
+3 1346 743 2431
+3 983 251 2432
+3 962 250 2432
+3 1006 349 2433
+3 1132 511 2433
+3 2099 823 2434
+3 2120 666 2434
+3 1253 193 2435
+3 1243 666 2435
+3 1634 509 2436
+3 1625 677 2436
+3 941 193 2437
+3 1253 677 2437
+3 1886 251 2438
+3 983 304 2438
+3 1153 205 2439
+3 1096 304 2439
+3 1540 509 2440
+3 1634 538 2440
+3 945 205 2441
+3 1153 538 2441
+3 2426 850 2442
+3 2371 851 2442
+3 2159 719 2443
+3 1306 691 2443
+3 1297 258 2444
+3 1275 691 2444
+3 1682 518 2445
+3 1668 709 2445
+3 965 258 2446
+3 1297 709 2446
diff --git a/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_border_test.cpp b/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_border_test.cpp
new file mode 100644
index 000000000000..554c50d2af65
--- /dev/null
+++ b/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_border_test.cpp
@@ -0,0 +1,131 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Variational_shape_approximation.h>
+#include <boost/functional/hash_fwd.hpp>
+#include <boost/property_map/vector_property_map.hpp>
+
+#include <CGAL/Surface_mesh_approximation/L21_metric_plane_proxy.h>
+#include <CGAL/Variational_shape_approximation.h>
+
+#include <limits>
+
+#include <CGAL/Surface_mesh.h>
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
+using SurfaceMesh = CGAL::Surface_mesh<K::Point_3>;
+
+
+typedef boost::property_map<SurfaceMesh, boost::vertex_point_t>::type VertexPointMap;
+typedef typename CGAL::Kernel_traits<
+    typename boost::property_traits<VertexPointMap>::value_type>::Kernel GeomTraits;
+typedef CGAL::Surface_mesh_approximation::
+    L21_metric_plane_proxy<SurfaceMesh, VertexPointMap, GeomTraits>
+        L21_Metric;
+typedef CGAL::Variational_shape_approximation<SurfaceMesh, VertexPointMap, L21_Metric>
+    L21_MeshApproximation;
+
+struct PolygonSoup
+{
+    using PointType = K::Point_3;
+    std::vector<PointType> points;
+    std::vector<std::array<std::size_t, 3>> faces;
+};
+
+auto meshArea = [](const SurfaceMesh& mesh) {
+    double area = 0;
+    for (const auto& f : mesh.faces())
+    {
+        std::vector<K::Point_3> pts;
+        for (const auto& v : mesh.vertices_around_face(mesh.halfedge(f)))
+        {
+            pts.push_back(mesh.point(v));
+        }
+        K::Triangle_3 tri(pts[0], pts[1], pts[2]);
+        area += std::sqrt(tri.squared_area());
+    }
+    return area;
+};
+
+auto soupArea = [](const PolygonSoup& soup) {
+    double area = 0;
+    for (const auto& f : soup.faces)
+    {
+        std::vector<K::Point_3> pts = {soup.points[f[0]], soup.points[f[1]], soup.points[f[2]]};
+        K::Triangle_3 tri(pts[0], pts[1], pts[2]);
+        area += std::sqrt(tri.squared_area());
+    }
+    return area;
+};
+auto soupToMesh = [](const PolygonSoup& soup) {
+    SurfaceMesh mesh;
+    std::vector<SurfaceMesh::Vertex_index> vertices;
+    for (const auto& p : soup.points)
+    {
+        vertices.push_back(mesh.add_vertex(p));
+    }
+    for (const auto& f : soup.faces)
+    {
+        mesh.add_face(vertices[f[0]], vertices[f[1]], vertices[f[2]]);
+    }
+    return mesh;
+};
+
+int main(int, char*[])
+{
+    std::array<double,6> subdivisionRatios          = { 0.10 , 2.0 , 2.0 , 10.0 , 10.0 , 10.00 };
+    std::array<double, 6> boundarySubdivisionRatios = { 0.01 , 2.0 , 0.1 , 10.0 ,  1.0 ,  0.01 };
+
+    for (int i = 0; i < subdivisionRatios.size(); ++i)
+    {
+        const auto subdivisionRatio = subdivisionRatios[i];
+        const auto boundarySubdivisionRatio = boundarySubdivisionRatios[i];
+        std::string filename = "./VSA-" + std::to_string(subdivisionRatio) + "-" + std::to_string(boundarySubdivisionRatio);
+        SurfaceMesh mesh;
+
+        std::ifstream in("data/patch.ply");
+        CGAL::IO::read_PLY(in, mesh);
+        std::cout << vertices(mesh).size() << std::endl;
+        const int maxProxies = 10;
+        const int defaultIterations = 20;
+
+        VertexPointMap vpmap = get(boost::vertex_point, mesh);
+        L21_Metric metric(mesh, vpmap);
+        L21_MeshApproximation approx(mesh, vpmap, metric);
+
+        const auto seedingParams = //
+            CGAL::parameters::seeding_method(
+                CGAL::Surface_mesh_approximation::Seeding_method::INCREMENTAL)
+                .max_number_of_proxies(maxProxies)
+                .min_error_drop(0.001)
+                .number_of_relaxations(5);
+        approx.initialize_seeds(seedingParams);
+
+        approx.run(defaultIterations);
+
+        const auto meshParams = CGAL::parameters::subdivision_ratio(subdivisionRatio)
+                                    .boundary_subdivision_ratio(boundarySubdivisionRatio)
+                                    .with_dihedral_angle(false)
+                                    .optimize_boundary_anchor_location(false)
+                                    .optimize_anchor_location(true)
+                                    .pca_plane(false);
+        const bool isOutputManifold = approx.extract_mesh(meshParams);
+        if (!isOutputManifold)
+        {
+            throw std::runtime_error("not manifold");
+        }
+
+        PolygonSoup soup;
+        const auto outputParams = CGAL::parameters::anchors(std::back_inserter(soup.points))
+                                      .triangles(std::back_inserter(soup.faces));
+        approx.output(outputParams);
+
+        std::cerr << " Mesh area = " << meshArea(mesh) << " Soup area = " << soupArea(soup)
+                  << std::endl;
+        {
+            std::ofstream f(filename + "soup.ply");
+            CGAL::IO::write_PLY(f, soupToMesh(soup));
+        }
+    }
+
+    return 0;
+}

From 98fa0c089fd6f2e09622845fb7cea0ca8daa8593 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 18 Jul 2023 09:36:05 +0100
Subject: [PATCH 0493/1398] Fix for crash on Quit

---
 GraphicsView/include/CGAL/Qt/qglviewer_impl.h | 1 +
 1 file changed, 1 insertion(+)

diff --git a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
index e1ead77a2276..e89577b1d1ae 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
@@ -186,6 +186,7 @@ CGAL::QGLViewer::~QGLViewer() {
     helpWidget()->close();
     delete helpWidget_;
   }
+  disconnect(context(), &QOpenGLContext::aboutToBeDestroyed, this, &CGAL::QGLViewer::contextIsDestroyed);
 }
 
 

From 178d063536b0128e09d593ae3c4b0f6c581de642 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 18 Jul 2023 11:46:42 +0200
Subject: [PATCH 0494/1398] Improve the doc of Face_filtered_graph: patch IDs
 can be more than size_t

---
 BGL/include/CGAL/boost/graph/Face_filtered_graph.h | 8 +++++---
 1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
index 28afe86c27a6..ffb41b041dd8 100644
--- a/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
+++ b/BGL/include/CGAL/boost/graph/Face_filtered_graph.h
@@ -49,9 +49,11 @@ namespace CGAL {
    * the adapted graph must define a manifold mesh. In order to check that this condition is verified, you can
    * use the function `is_selection_valid()`.
    *
-   * There are two different ways to initialize this class. You can directly provide the set of faces selected, or
-   * if you have a face patch map, select the patches of faces. The latter option is convenient if you want to access
-   * some connected components of a graph after having called `CGAL::Polygon_mesh_processing::connected_components()`.
+   * There are two different ways to initialize this class: you can directly provide a set of selected faces,
+   * or provide a set of patch identifiers as well as a map between faces and patch identifiers.
+   * The latter option is convenient if you want to access some connected components of a graph
+   * after having called `CGAL::Polygon_mesh_processing::connected_components()`, or if you want
+   * to select only faces of a given color, for example.
    *
    * The documented interface of this class is limited on purpose and free functions of the concept
    * this class is a model of must be used to manipulate it.

From ad41766454cf5c72ea9e3cbfb9063b4d4384b827 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Tue, 18 Jul 2023 13:23:37 +0200
Subject: [PATCH 0495/1398] issue #7395 Improvement of layout of model
 relations

Corrected `cgalModels` to `cgalHasModes` inside `cgalHasNodelsBegin` / `cgalHasModelsEnd`
---
 .../doc/AABB_tree/Concepts/AABBPrimitive.h    | 10 ++--
 .../Concepts/AABBPrimitiveWithSharedData.h    |  6 +-
 .../Concepts/AABBRayIntersectionTraits.h      |  2 +-
 AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h |  2 +-
 .../Concepts/AlgebraicStructureTraits.h       |  2 +-
 .../Concepts/FieldNumberType.h                | 20 +++----
 .../Concepts/FractionTraits.h                 |  2 +-
 .../Concepts/FromIntConstructible.h           |  6 +-
 .../Concepts/RealEmbeddableTraits.h           |  2 +-
 .../Concepts/AlgebraicKernel_d_1.h            |  4 +-
 .../Concepts/AlphaShapeFace_2.h               |  2 +-
 .../Alpha_wrap_3/Concepts/AlphaWrapOracle.h   |  8 +--
 .../Concepts/ApolloniusGraphDataStructure_2.h |  2 +-
 .../ApolloniusGraphHierarchyVertexBase_2.h    |  2 +-
 .../Concepts/ApolloniusGraphTraits_2.h        |  4 +-
 .../Concepts/ApolloniusGraphVertexBase_2.h    |  2 +-
 .../Concepts/ArrTraits--Approximate_2.h       |  2 +-
 .../Concepts/ArrTraits--AreMergeable_2.h      |  2 +-
 .../ArrTraits--CompareXNearBoundary_2.h       |  2 +-
 ...rrTraits--CompareXOnBoundaryOfCurveEnd_2.h |  6 +-
 .../ArrTraits--CompareXOnBoundary_2.h         |  6 +-
 .../Concepts/ArrTraits--CompareX_2.h          |  2 +-
 .../Concepts/ArrTraits--CompareXy_2.h         |  2 +-
 .../Concepts/ArrTraits--CompareYAtXLeft_2.h   |  2 +-
 .../Concepts/ArrTraits--CompareYAtXRight_2.h  |  2 +-
 .../Concepts/ArrTraits--CompareYAtX_2.h       |  2 +-
 .../ArrTraits--CompareYNearBoundary_2.h       |  2 +-
 .../ArrTraits--CompareYOnBoundary_2.h         |  8 +--
 .../Concepts/ArrTraits--ConstructCurve_2.h    |  2 +-
 .../ArrTraits--ConstructMaxVertex_2.h         |  2 +-
 .../ArrTraits--ConstructMinVertex_2.h         |  2 +-
 .../ArrTraits--ConstructXMonotoneCurve_2.h    |  2 +-
 .../Concepts/ArrTraits--Curve_2.h             |  2 +-
 .../Concepts/ArrTraits--Equal_2.h             |  2 +-
 .../Concepts/ArrTraits--Intersect_2.h         |  2 +-
 .../ArrTraits--IsOnXIdentification_2.h        |  2 +-
 .../ArrTraits--IsOnYIdentification_2.h        |  2 +-
 .../Concepts/ArrTraits--IsVertical_2.h        |  2 +-
 .../Concepts/ArrTraits--MakeXMonotone_2.h     |  2 +-
 .../Concepts/ArrTraits--Merge_2.h             |  2 +-
 .../Concepts/ArrTraits--ParameterSpaceInX_2.h |  6 +-
 .../Concepts/ArrTraits--ParameterSpaceInY_2.h |  6 +-
 .../Concepts/ArrTraits--Point_2.h             |  2 +-
 .../Concepts/ArrTraits--Split_2.h             |  2 +-
 .../Concepts/ArrTraits--XMonotoneCurve_2.h    |  2 +-
 .../Concepts/ArrangementApproximateTraits_2.h | 16 ++---
 .../Concepts/ArrangementBasicTopologyTraits.h |  2 +-
 .../Concepts/ArrangementBasicTraits_2.h       | 30 +++++-----
 .../ArrangementConstructCurveTraits_2.h       | 14 ++---
 ...rangementConstructXMonotoneCurveTraits_2.h | 14 ++---
 .../Concepts/ArrangementDcel.h                |  8 +--
 .../Concepts/ArrangementDcelWithRebind.h      |  6 +-
 .../ArrangementHorizontalSideTraits_2.h       |  8 +--
 .../Concepts/ArrangementInputFormatter.h      |  6 +-
 .../Concepts/ArrangementLandmarkTraits_2.h    | 16 ++---
 .../ArrangementOpenBoundaryTraits_2.h         | 10 ++--
 .../Concepts/ArrangementOutputFormatter.h     |  6 +-
 .../Concepts/ArrangementPointLocation_2.h     |  8 +--
 .../ArrangementSphericalBoundaryTraits_2.h    |  2 +-
 .../Concepts/ArrangementTopologyTraits.h      |  6 +-
 .../Concepts/ArrangementTraits_2.h            | 28 ++++-----
 .../Concepts/ArrangementVerticalRayShoot_2.h  |  8 +--
 .../ArrangementVerticalSideTraits_2.h         |  8 +--
 .../ArrangementWithHistoryInputFormatter.h    |  2 +-
 .../ArrangementWithHistoryOutputFormatter.h   |  2 +-
 .../Concepts/ArrangementXMonotoneTraits_2.h   | 28 ++++-----
 .../Concepts/OverlayTraits.h                  |  4 +-
 .../Concepts/BarycentricCoordinates_2.h       |  6 +-
 .../Concepts/DiscretizedDomain_2.h            |  2 +-
 .../ArrDirectionalTraits--AreMergeable_2.h    |  2 +-
 ...rDirectionalTraits--CompareEndpointsXy_2.h |  2 +-
 ...rrDirectionalTraits--ConstructOpposite_2.h |  2 +-
 .../ArrDirectionalTraits--Intersect_2.h       |  2 +-
 .../Concepts/ArrDirectionalTraits--Merge_2.h  |  2 +-
 .../Concepts/ArrDirectionalTraits--Split_2.h  |  2 +-
 .../ArrangementDirectionalXMonotoneTraits_2.h | 14 ++---
 .../Concepts/GeneralPolygonSetDcel.h          |  2 +-
 .../Concepts/GeneralPolygonSetDcelFace.h      |  2 +-
 .../Concepts/GeneralPolygonSetDcelHalfedge.h  |  2 +-
 .../Concepts/GeneralPolygonSetTraits_2.h      |  6 +-
 .../Concepts/GeneralPolygon_2.h               |  2 +-
 .../GpsTraitsGeneralPolygonWithHoles_2.h      |  2 +-
 .../Concepts/GpsTraitsGeneralPolygon_2.h      |  4 +-
 .../ApproximateMinEllipsoid_d_Traits_d.h      |  6 +-
 .../Concepts/MinCircle2Traits.h               |  2 +-
 .../Concepts/MinEllipse2Traits.h              |  2 +-
 .../Concepts/MinQuadrilateralTraits_2.h       |  2 +-
 .../Concepts/MinSphereAnnulusDTraits.h        |  6 +-
 .../Concepts/MinSphereOfSpheresTraits.h       | 12 ++--
 .../Concepts/RectangularPCenterTraits_2.h     |  2 +-
 .../Concepts/BoxIntersectionBox_d.h           |  4 +-
 .../Concepts/BoxIntersectionTraits_d.h        |  2 +-
 ...rnelForCircles--PolynomialForCircles_2_2.h |  2 +-
 ...lgebraicKernelForCircles--Polynomial_1_2.h |  2 +-
 ...raicKernelForCircles--RootForCircles_2_2.h |  2 +-
 .../Concepts/AlgebraicKernelForCircles.h      |  2 +-
 .../CircularKernel--CircularArcPoint_2.h      |  2 +-
 .../Concepts/CircularKernel--CircularArc_2.h  |  2 +-
 .../Concepts/CircularKernel--LineArc_2.h      |  2 +-
 .../Concepts/CircularKernel.h                 |  4 +-
 ...rnelForSpheres--PolynomialForSpheres_2_3.h |  2 +-
 ...lgebraicKernelForSpheres--Polynomial_1_3.h |  2 +-
 ...cKernelForSpheres--PolynomialsForLines_3.h |  2 +-
 ...raicKernelForSpheres--RootForSpheres_2_3.h |  2 +-
 .../Concepts/AlgebraicKernelForSpheres.h      |  2 +-
 .../SphericalKernel--CircularArcPoint_3.h     |  2 +-
 .../Concepts/SphericalKernel--CircularArc_3.h |  2 +-
 .../Concepts/SphericalKernel--LineArc_3.h     |  2 +-
 .../Concepts/SphericalKernel.h                |  4 +-
 .../doc/Circulator/Concepts/ConstHandle.h     |  2 +-
 Circulator/doc/Circulator/Concepts/Handle.h   |  8 +--
 .../doc/Classification/Concepts/Classifier.h  |  6 +-
 .../Classification/Concepts/NeighborQuery.h   |  8 +--
 .../Concepts/ConvexHullTraits_2.h             | 12 ++--
 .../Concepts/ConvexHullTraits_3.h             |  4 +-
 .../Concepts/ConvexHullTraits_d.h             |  6 +-
 .../Concepts/DelaunayLiftedTraits_d.h         |  4 +-
 .../Convex_hull_d/Concepts/DelaunayTraits_d.h |  4 +-
 .../Envelope_3/Concepts/EnvelopeTraits_3.h    |  8 +--
 .../doc/Generator/Concepts/PointGenerator.h   | 28 ++++-----
 .../Concepts/RandomConvexSetTraits_2.h        |  2 +-
 .../doc/HalfedgeDS/Concepts/HalfedgeDS.h      |  6 +-
 .../doc/HalfedgeDS/Concepts/HalfedgeDSFace.h  |  4 +-
 .../HalfedgeDS/Concepts/HalfedgeDSHalfedge.h  |  4 +-
 .../doc/HalfedgeDS/Concepts/HalfedgeDSItems.h |  6 +-
 .../HalfedgeDS/Concepts/HalfedgeDSVertex.h    |  4 +-
 .../HyperbolicDelaunayTriangulationTraits_2.h |  4 +-
 .../HyperbolicTriangulationFaceBase_2.h       |  2 +-
 .../Concepts/ExtremalPolygonTraits_2.h        |  4 +-
 .../LargestEmptyIsoRectangleTraits_2.h        |  4 +-
 .../Concepts/GradientFittingTraits.h          |  2 +-
 .../Concepts/InterpolationTraits.h            |  4 +-
 .../Interval_skip_list/Concepts/Interval.h    |  4 +-
 .../doc/Jet_fitting_3/Concepts/DataKernel.h   |  4 +-
 .../doc/Jet_fitting_3/Concepts/LocalKernel.h  |  4 +-
 .../doc/Kernel_23/Concepts/GeomObjects.h      | 60 +++++++++++--------
 Kernel_23/doc/Kernel_23/Concepts/Kernel.h     | 16 ++---
 .../Kernel_d/Concepts/KernelWithLifting_d.h   |  4 +-
 Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h     |  8 +--
 .../Kernel_d/Concepts/LinearAlgebraTraits_d.h |  4 +-
 .../Concepts/LinearCellComplexItems.h         |  2 +-
 .../doc/Matrix_search/Concepts/BasicMatrix.h  |  2 +-
 .../Concepts/MonotoneMatrixSearchTraits.h     |  2 +-
 .../Concepts/SortedMatrixSearchTraits.h       |  2 +-
 .../Mesh_2/Concepts/DelaunayMeshFaceBase_2.h  |  2 +-
 .../Concepts/DelaunayMeshVertexBase_2.h       |  2 +-
 .../doc/Mesh_2/Concepts/MeshingCriteria_2.h   |  4 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h   |  4 +-
 .../doc/Mesh_3/Concepts/MeshCellCriteria_3.h  |  2 +-
 .../Concepts/MeshCriteriaWithFeatures_3.h     |  2 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h   |  2 +-
 .../doc/Mesh_3/Concepts/MeshDomainField_3.h   |  2 +-
 .../Concepts/MeshDomainWithFeatures_3.h       |  4 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h     |  4 +-
 .../doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h  |  2 +-
 .../doc/Mesh_3/Concepts/MeshFacetCriteria_3.h |  2 +-
 Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h |  2 +-
 .../doc/Mesh_3/Concepts/TriangleAccessor_3.h  |  2 +-
 .../Concepts/PolygonConvexDecomposition_2.h   | 10 ++--
 .../PolygonWithHolesConvexDecomposition_2.h   |  4 +-
 .../Miscellany/Concepts/UniqueHashFunction.h  |  2 +-
 .../Concepts/ModularTraits.h                  |  2 +-
 .../Concepts/Modularizable.h                  | 18 +++---
 .../Nef_2/Concepts/ExtendedKernelTraits_2.h   |  6 +-
 .../Concepts/OrientedBoundingBoxTraits.h      |  2 +-
 .../doc/Orthtree/Concepts/OrthtreeTraits.h    |  6 +-
 .../doc/Orthtree/Concepts/OrthtreeTraversal.h |  8 +--
 .../Concepts/ConvexPartitionIsValidTraits_2.h |  2 +-
 .../Concepts/IsYMonotoneTraits_2.h            |  4 +-
 .../Concepts/OptimalConvexPartitionTraits_2.h |  2 +-
 .../Concepts/PartitionIsValidTraits_2.h       |  2 +-
 .../Partition_2/Concepts/PartitionTraits_2.h  |  2 +-
 .../doc/Partition_2/Concepts/PolygonIsValid.h |  4 +-
 .../YMonotonePartitionIsValidTraits_2.h       |  2 +-
 .../Periodic_2DelaunayTriangulationTraits_2.h |  2 +-
 .../Concepts/Periodic_2Offset_2.h             |  2 +-
 .../Periodic_2TriangulationFaceBase_2.h       |  2 +-
 .../Periodic_2TriangulationTraits_2.h         |  2 +-
 .../Periodic_2TriangulationVertexBase_2.h     |  2 +-
 .../Periodic_3MeshDomainWithFeatures_3.h      |  2 +-
 .../Concepts/Periodic_3MeshDomain_3.h         |  2 +-
 .../Periodic_3DelaunayTriangulationTraits_3.h |  2 +-
 .../Concepts/Periodic_3Offset_3.h             |  2 +-
 ...riodic_3RegularTriangulationDSCellBase_3.h |  4 +-
 ...odic_3RegularTriangulationDSVertexBase_3.h |  2 +-
 .../Periodic_3RegularTriangulationTraits_3.h  |  2 +-
 .../Periodic_3TriangulationDSCellBase_3.h     |  2 +-
 .../Periodic_3TriangulationDSVertexBase_3.h   |  2 +-
 .../Periodic_3TriangulationTraits_3.h         |  2 +-
 ...4HyperbolicDelaunayTriangulationTraits_2.h |  2 +-
 ...iodic_4HyperbolicTriangulationFaceBase_2.h |  2 +-
 ...dic_4HyperbolicTriangulationVertexBase_2.h |  2 +-
 .../Concepts/GeneralPolygonWithHoles_2.h      |  4 +-
 .../Concepts/PMPCorefinementVisitor.h         |  2 +-
 .../Concepts/PMPHolefillingVisitor.h          |  2 +-
 .../PMPPolygonSoupOrientationVisitor.h        |  2 +-
 .../Concepts/PMPTriangulateFaceVisitor.h      |  2 +-
 .../Polyhedron/Concepts/PolyhedronItems_3.h   |  6 +-
 .../PolylineSimplificationCostFunction.h      |  6 +-
 .../PolylineSimplificationStopPredicate.h     |  6 +-
 .../PolylineSimplificationVertexBase_2.h      |  2 +-
 .../Polynomial/Concepts/PolynomialTraits_d.h  |  2 +-
 .../doc/Polynomial/Concepts/Polynomial_d.h    |  2 +-
 .../Concepts/AllFurthestNeighborsTraits_2.h   |  8 +--
 .../Concepts/PolytopeDistanceDTraits.h        |  6 +-
 .../Concepts/WidthTraits_3.h                  |  2 +-
 .../doc/QP_solver/Concepts/LinearProgram.h    |  6 +-
 .../Concepts/NonnegativeLinearProgram.h       | 12 ++--
 .../Concepts/NonnegativeQuadraticProgram.h    |  6 +-
 .../doc/QP_solver/Concepts/QuadraticProgram.h |  6 +-
 ...shComplexWithFeatures_3InTriangulation_3.h |  2 +-
 .../Concepts/MeshComplex_3InTriangulation_3.h |  2 +-
 .../Concepts/SimplicialMeshCellBase_3.h       |  8 +--
 .../Concepts/SimplicialMeshVertexBase_3.h     |  6 +-
 .../doc/STL_Extension/Concepts/Descriptor.h   |  4 +-
 .../doc/STL_Extension/Concepts/Index.h        |  4 +-
 .../STL_Extension/Concepts/ProjectionObject.h | 26 ++++----
 .../Concepts/SurjectiveLockDataStructure.h    |  2 +-
 .../Concepts/ScaleSpaceMesher.h               |  4 +-
 .../Concepts/ScaleSpaceSmoother.h             |  4 +-
 .../Concepts/RangeSegmentTreeTraits_k.h       | 12 ++--
 .../SegmentDelaunayGraphDataStructure_2.h     |  2 +-
 .../Concepts/SegmentDelaunayGraphFaceBase_2.h |  2 +-
 ...egmentDelaunayGraphHierarchyVertexBase_2.h |  2 +-
 .../Concepts/SegmentDelaunayGraphSite_2.h     |  2 +-
 .../SegmentDelaunayGraphStorageSite_2.h       |  2 +-
 .../SegmentDelaunayGraphStorageTraits_2.h     |  2 +-
 .../Concepts/SegmentDelaunayGraphTraits_2.h   |  8 +--
 .../SegmentDelaunayGraphVertexBase_2.h        |  2 +-
 .../SegmentDelaunayGraphLinfTraits_2.h        |  8 +--
 .../Concepts/EfficientRANSACTraits.h          |  2 +-
 .../Shape_detection/Concepts/NeighborQuery.h  |  8 +--
 .../doc/Shape_detection/Concepts/RegionType.h | 14 ++---
 .../Concepts/ContourDirections.h              |  6 +-
 .../Concepts/NeighborQuery.h                  |  2 +-
 .../Concepts/RegularizationType.h             |  4 +-
 .../Concepts/SkinSurfaceTraits_3.h            |  2 +-
 .../Skin_surface_3/Concepts/SkinSurface_3.h   |  4 +-
 .../Concepts/SnapRoundingTraits_2.h           |  2 +-
 .../Concepts/DiagonalizeTraits.h              |  2 +-
 .../Concepts/MixedIntegerProgramTraits.h      | 12 ++--
 ...ormalEquationSparseLinearAlgebraTraits_d.h |  2 +-
 .../Concepts/QuadraticProgramTraits.h         |  2 +-
 .../Concepts/SparseLinearAlgebraTraits_d.h    |  8 +--
 .../SparseLinearAlgebraWithFactorTraits_d.h   |  2 +-
 .../doc/Solver_interface/Concepts/SvdTraits.h |  6 +-
 .../Concepts/GeneralDistance.h                |  4 +-
 .../Concepts/OrthogonalDistance.h             |  4 +-
 .../Concepts/RangeSearchTraits.h              | 12 ++--
 .../Spatial_searching/Concepts/SearchTraits.h | 16 ++---
 .../Concepts/SpatialSeparator.h               |  2 +-
 .../Spatial_searching/Concepts/SpatialTree.h  |  2 +-
 .../doc/Spatial_searching/Concepts/Splitter.h | 14 ++---
 .../Concepts/PolygonOffsetBuilderTraits_2.h   |  2 +-
 .../StraightSkeletonBuilderTraits_2.h         |  2 +-
 .../StraightSkeletonBuilder_2_Visitor.h       |  2 +-
 .../Concepts/StraightSkeletonFace_2.h         |  2 +-
 .../Concepts/StraightSkeletonHalfedge_2.h     |  2 +-
 .../StraightSkeletonItemsConverter_2.h        |  2 +-
 .../Concepts/StraightSkeletonVertex_2.h       |  2 +-
 .../Concepts/StraightSkeleton_2.h             |  2 +-
 .../Stream_lines_2/Concepts/Integrator_2.h    |  4 +-
 .../Stream_lines_2/Concepts/VectorField_2.h   |  4 +-
 .../Subdivision_method_3/Concepts/DQQMask_3.h |  2 +-
 .../Subdivision_method_3/Concepts/PQQMask_3.h |  2 +-
 .../Subdivision_method_3/Concepts/PTQMask_3.h |  2 +-
 .../Concepts/Sqrt3Mask_3.h                    |  2 +-
 .../Concepts/ErrorMetricProxy.h               |  4 +-
 .../DeformationClosestRotationTraits_3.h      |  4 +-
 .../Concepts/Parameterizer_3.h                | 20 +++----
 .../Concepts/SurfaceMeshShortestPathTraits.h  |  2 +-
 .../Concepts/GetCost.h                        |  6 +-
 .../Concepts/GetPlacement.h                   | 10 ++--
 .../Concepts/PlacementFilter.h                |  4 +-
 .../Concepts/StopPredicate.h                  | 10 ++--
 .../Concepts/SurfaceMeshCellBase_3.h          |  4 +-
 .../SurfaceMeshComplex_2InTriangulation_3.h   |  2 +-
 .../Concepts/SurfaceMeshFacetsCriteria_3.h    |  2 +-
 .../Concepts/SurfaceMeshTraits_3.h            |  2 +-
 .../Concepts/SurfaceMeshVertexBase_3.h        |  4 +-
 .../doc/Surface_mesher/Concepts/Surface_3.h   |  2 +-
 .../Concepts/TriangulationDSFaceBase_2.h      |  2 +-
 .../Concepts/TriangulationDSVertexBase_2.h    |  2 +-
 .../Concepts/TriangulationDataStructure_2.h   |  6 +-
 .../Concepts/TriangulationDSCellBase_3.h      |  2 +-
 .../Concepts/TriangulationDSVertexBase_3.h    |  2 +-
 .../Concepts/TriangulationDataStructure_3.h   |  2 +-
 .../Concepts/RemeshingCellBase_3.h            |  2 +-
 .../Concepts/RemeshingVertexBase_3.h          |  2 +-
 .../Concepts/DelaunayTriangulationTraits.h    |  4 +-
 .../Concepts/RegularTriangulationTraits.h     |  4 +-
 .../Concepts/TriangulationDSFace.h            |  2 +-
 .../Concepts/TriangulationDSFullCell.h        |  4 +-
 .../Concepts/TriangulationDSVertex.h          |  4 +-
 .../Concepts/TriangulationDataStructure.h     | 10 ++--
 .../Concepts/TriangulationFullCell.h          |  2 +-
 .../Concepts/TriangulationTraits.h            |  4 +-
 .../Concepts/TriangulationVertex.h            |  2 +-
 .../ConstrainedTriangulationFaceBase_2.h      |  2 +-
 .../Concepts/RegularTriangulationFaceBase_2.h |  2 +-
 .../RegularTriangulationVertexBase_2.h        |  2 +-
 .../Concepts/TriangulationFaceBase_2.h        |  2 +-
 .../TriangulationHierarchyVertexBase_2.h      |  2 +-
 .../TriangulationVertexBaseWithInfo_2.h       |  2 +-
 .../Concepts/TriangulationVertexBase_2.h      |  2 +-
 .../DelaunayTriangulationCellBase_3.h         |  4 +-
 .../Concepts/DelaunayTriangulationTraits_3.h  | 14 ++---
 ...lationCellBaseWithWeightedCircumcenter_3.h |  2 +-
 .../Concepts/RegularTriangulationCellBase_3.h |  2 +-
 .../RegularTriangulationVertexBase_3.h        |  2 +-
 .../TriangulationCellBaseWithInfo_3.h         |  2 +-
 .../Concepts/TriangulationCellBase_3.h        |  4 +-
 .../TriangulationVertexBaseWithInfo_3.h       |  2 +-
 .../Concepts/TriangulationVertexBase_3.h      |  4 +-
 .../DelaunayTriangulationOnSphereTraits_2.h   |  4 +-
 .../TriangulationOnSphereFaceBase_2.h         |  2 +-
 .../Concepts/TriangulationOnSphereTraits_2.h  |  4 +-
 .../TriangulationOnSphereVertexBase_2.h       |  2 +-
 .../doc/Visibility_2/Concepts/Visibility_2.h  |  6 +-
 .../Concepts/AdaptationPolicy_2.h             | 18 +++---
 .../Concepts/AdaptationTraits_2.h             |  8 +--
 .../Weights/Concepts/BarycentricWeights_2.h   |  6 +-
 322 files changed, 754 insertions(+), 744 deletions(-)

diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h
index cee0dc902966..3abb0cf153bd 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitive.h
@@ -13,11 +13,11 @@ The concept `AABBPrimitive` describes the requirements for the primitives stored
 The `Primitive` type can be, e.g., a wrapper around a `Handle`. Assume for instance that the input objects are the triangle faces of a mesh stored as a `CGAL::Polyhedron_3`. The `Datum` would be a `Triangle_3` and the `Id` would be a polyhedron `Face_handle`. Method `datum()` can return either a `Triangle_3` constructed on the fly from the face handle or a `Triangle_3` stored internally. This provides a way for the user to trade memory for efficiency.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_false,CacheDatum>}
-\cgalModels{CGAL::AABB_segment_primitive<Iterator,CacheDatum>}
-\cgalModels{CGAL::AABB_triangle_primitive<Iterator,CacheDatum>}
-\cgalModels{CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_false,CacheDatum>}
-\cgalModels{CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_false,CacheDatum>}
+\cgalHasModels{CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_false,CacheDatum>}
+\cgalHasModels{CGAL::AABB_segment_primitive<Iterator,CacheDatum>}
+\cgalHasModels{CGAL::AABB_triangle_primitive<Iterator,CacheDatum>}
+\cgalHasModels{CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_false,CacheDatum>}
+\cgalHasModels{CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_false,CacheDatum>}
 \cgalHasModelsEnd
 */
 
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h
index 27f6805cbca1..416cc785468d 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBPrimitiveWithSharedData.h
@@ -22,9 +22,9 @@ The `Datum` would be a `Triangle_3` and the `Id` a `std::size_t`. The shared dat
 The method `datum(const Shared_data&)` then returns a triangle from the vector.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_true,CacheDatum>}
-\cgalModels{CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_true,CacheDatum>}
-\cgalModels{CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_true,CacheDatum>}
+\cgalHasModels{CGAL::AABB_primitive<Id,ObjectPropertyMap,PointPropertyMap,Tag_true,CacheDatum>}
+\cgalHasModels{CGAL::AABB_halfedge_graph_segment_primitive<HalfedgeGraph,VertexPointPMap,Tag_true,CacheDatum>}
+\cgalHasModels{CGAL::AABB_face_graph_triangle_primitive<FaceGraph,VertexPointPMap,Tag_true,CacheDatum>}
 \cgalHasModelsEnd
 */
 
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
index 1df2c9802b25..a372fc665242 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBRayIntersectionTraits.h
@@ -8,7 +8,7 @@ The concept `AABBRayIntersectionTraits` is a refinement of the concept
 distance of an intersection along a ray.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>}
+\cgalHasModels{CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>}
 \cgalHasModelsEnd
 
 \sa `CGAL::AABB_tree<AABBTraits>`
diff --git a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
index 5dfba2998c86..3b02a0044399 100644
--- a/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
+++ b/AABB_tree/doc/AABB_tree/Concepts/AABBTraits.h
@@ -6,7 +6,7 @@
 The concept `AABBTraits` provides the geometric primitive types and methods for the class `CGAL::AABB_tree<AABBTraits>`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>}
+\cgalHasModels{CGAL::AABB_traits<AABBGeomTraits,AABBPrimitive>}
 \cgalHasModelsEnd
 
 \cgalRefines{SearchGeomTraits_3}
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h
index d21861c1c288..13c87daede54 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/AlgebraicStructureTraits.h
@@ -29,7 +29,7 @@ algebraic operations within that structure.
 \sa `CGAL::Field_with_root_of_tag`
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Algebraic_structure_traits<T>}
+\cgalHasModels{CGAL::Algebraic_structure_traits<T>}
 \cgalHasModelsEnd
 
 */
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
index 5cd89e524e60..eeb128e81b6f 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
@@ -10,16 +10,16 @@ for Cartesian kernels.
 \cgalRefines{Field,RealEmbeddable}
 
 \cgalHasModelsBegin
-\cgalModels{float}
-\cgalModels{double}
-\cgalModels{CGAL::Gmpq}
-\cgalModels{CGAL::Interval_nt}
-\cgalModels{CGAL::Interval_nt_advanced}
-\cgalModels{CGAL::Lazy_exact_nt<FieldNumberType>}
-\cgalModels{CGAL::Quotient<RingNumberType>}
-\cgalModels{leda_rational}
-\cgalModels{leda_bigfloat}
-\cgalModels{leda_real}
+\cgalHasModels{float}
+\cgalHasModels{double}
+\cgalHasModels{CGAL::Gmpq}
+\cgalHasModels{CGAL::Interval_nt}
+\cgalHasModels{CGAL::Interval_nt_advanced}
+\cgalHasModels{CGAL::Lazy_exact_nt<FieldNumberType>}
+\cgalHasModels{CGAL::Quotient<RingNumberType>}
+\cgalHasModels{leda_rational}
+\cgalHasModels{leda_bigfloat}
+\cgalHasModels{leda_real}
 \cgalHasModelsEnd
 
 \sa `RingNumberType`
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h
index f1248606d90c..d4f0b88f9164 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FractionTraits.h
@@ -9,7 +9,7 @@ In case the associated type is a `Fraction`, a model of `FractionTraits` provide
 as the numerator and denominator type.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Fraction_traits<T>}
+\cgalHasModels{CGAL::Fraction_traits<T>}
 \cgalHasModelsEnd
 
 \sa `FractionTraits_::Decompose`
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
index f31912ba5d85..779b96188a71 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
@@ -7,9 +7,9 @@ A model of the concept `FromIntConstructible` is required
 to be constructible from int.
 
 \cgalHasModelsBegin
-\cgalModels{int}
-\cgalModels{long}
-\cgalModels{double}
+\cgalHasModels{int}
+\cgalHasModels{long}
+\cgalHasModels{double}
 \cgalHasModelsEnd
 
 */
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h
index 312eff6326f8..4a40e131286e 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RealEmbeddableTraits.h
@@ -8,7 +8,7 @@ A model of `RealEmbeddableTraits` is associated to a number type
 to the concept `RealEmbeddable`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Real_embeddable_traits<T>}
+\cgalHasModels{CGAL::Real_embeddable_traits<T>}
 \cgalHasModelsEnd
 */
 
diff --git a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h
index 4bc59c9e3886..b895e7665b9f 100644
--- a/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h
+++ b/Algebraic_kernel_d/doc/Algebraic_kernel_d/Concepts/AlgebraicKernel_d_1.h
@@ -9,8 +9,8 @@ algebraic functionalities on univariate polynomials of general degree \f$ d\f$.
 \cgalRefines{CopyConstructible,Assignable}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Algebraic_kernel_rs_gmpz_d_1}
-\cgalModels{CGAL::Algebraic_kernel_rs_gmpq_d_1}
+\cgalHasModels{CGAL::Algebraic_kernel_rs_gmpz_d_1}
+\cgalHasModels{CGAL::Algebraic_kernel_rs_gmpq_d_1}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernel_d_2`
diff --git a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h
index 498eaed26d73..a3bcacd1fc23 100644
--- a/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h
+++ b/Alpha_shapes_2/doc/Alpha_shapes_2/Concepts/AlphaShapeFace_2.h
@@ -10,7 +10,7 @@ The concept `AlphaShapeFace_2` describes the requirements for the base face of a
   Periodic_2TriangulationFaceBase_2 if the underlying triangulation of the alpha shape is a periodic triangulation}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Alpha_shape_face_base_2 (templated with the appropriate triangulation face base class)}
+\cgalHasModels{CGAL::Alpha_shape_face_base_2 (templated with the appropriate triangulation face base class)}
 \cgalHasModelsEnd
 
 */
diff --git a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h
index bf8076c97946..49244706c9b1 100644
--- a/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h
+++ b/Alpha_wrap_3/doc/Alpha_wrap_3/Concepts/AlphaWrapOracle.h
@@ -10,10 +10,10 @@ that answers a number of queries over the input of the algorithm.
 The oracle is the template parameter of the class `CGAL::Alpha_wraps_3_::Alpha_wrap_3`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Alpha_wraps_3_::Point_set_oracle}
-\cgalModels{CGAL::Alpha_wraps_3_::Segment_soup_oracle}
-\cgalModels{CGAL::Alpha_wraps_3_::Triangle_mesh_oracle}
-\cgalModels{CGAL::Alpha_wraps_3_::Triangle_soup_oracle}
+\cgalHasModels{CGAL::Alpha_wraps_3_::Point_set_oracle}
+\cgalHasModels{CGAL::Alpha_wraps_3_::Segment_soup_oracle}
+\cgalHasModels{CGAL::Alpha_wraps_3_::Triangle_mesh_oracle}
+\cgalHasModels{CGAL::Alpha_wraps_3_::Triangle_soup_oracle}
 \cgalHasModelsEnd
 
 */
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h
index 78e8ce69c6ad..914bf0feedf1 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphDataStructure_2.h
@@ -28,7 +28,7 @@ We only describe the additional requirements with respect to the
 \cgalRefines{TriangulationDataStructure_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_data_structure_2<Vb,Fb>}
+\cgalHasModels{CGAL::Triangulation_data_structure_2<Vb,Fb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h
index 354d27f68bfe..76d3320b2ddf 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphHierarchyVertexBase_2.h
@@ -20,7 +20,7 @@ next and previous level graphs.
 types in addition to those of `ApolloniusGraphVertexBase_2`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Apollonius_graph_hierarchy_vertex_base_2<CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden> >}
+\cgalHasModels{CGAL::Apollonius_graph_hierarchy_vertex_base_2<CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden> >}
 \cgalHasModelsEnd
 
 \sa `ApolloniusGraphDataStructure_2`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h
index d62bc56484e5..f14497d3ec6a 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphTraits_2.h
@@ -13,8 +13,8 @@ constructions for sites and several function object
 types for the predicates.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Apollonius_graph_traits_2<K,Method_tag>}
-\cgalModels{CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>}
+\cgalHasModels{CGAL::Apollonius_graph_traits_2<K,Method_tag>}
+\cgalHasModels{CGAL::Apollonius_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Apollonius_graph_2<Gt,Agds>`
diff --git a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h
index 45e4bd357458..f6246b211121 100644
--- a/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h
+++ b/Apollonius_graph_2/doc/Apollonius_graph_2/Concepts/ApolloniusGraphVertexBase_2.h
@@ -13,7 +13,7 @@ sites. The container stores the hidden sites related to the vertex.
 \cgalRefines{TriangulationVertexBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden>}
+\cgalHasModels{CGAL::Apollonius_graph_vertex_base_2<Gt,StoreHidden>}
 \cgalHasModelsEnd
 
 \sa `ApolloniusGraphDataStructure_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h
index 8b105f4dab97..3a43a08c1a2a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Approximate_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{Functor}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementApproximateTraits_2::Approximate_2}
+ * \cgalHasModels{ArrangementApproximateTraits_2::Approximate_2}
  * \cgalHasModelsEnd
  */
 class Approximate_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h
index a5c401dc85fe..8c9f51309ab7 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--AreMergeable_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{Functor}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementXMonotoneTraits_2::Are_mergeable_2}
+ * \cgalHasModels{ArrangementXMonotoneTraits_2::Are_mergeable_2}
  * \cgalHasModelsEnd
  */
 class AreMergeable_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h
index 0d85b1f0ae7d..ad6f44f179a1 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXNearBoundary_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableTernaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_}
+ * \cgalHasModels{ArrangementOpenBoundaryTraits_2::Compare_x_near_boundary_}
  * \cgalHasModelsEnd
  */
 class CompareXNearBoundary_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h
index 8fccd1309061..28208660fece 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundaryOfCurveEnd_2.h
@@ -6,9 +6,9 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableFunctor}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2}
- * \cgalModels{ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_2}
- * \cgalModels{ArrangementSphericalBoundaryTraits_2::Compare_x_on_boundary_2}
+ * \cgalHasModels{ArrangementHorizontalSideTraits_2::Compare_x_on_boundary_2}
+ * \cgalHasModels{ArrangementOpenBoundaryTraits_2::Compare_x_on_boundary_2}
+ * \cgalHasModels{ArrangementSphericalBoundaryTraits_2::Compare_x_on_boundary_2}
  * \cgalHasModelsEnd
  */
 class CompareXOnBoundaryOfCurveEnd_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h
index 77eea00561d8..af30ebbfb93e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXOnBoundary_2.h
@@ -6,9 +6,9 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableFunctor}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2}
- * \cgalModels{ArrangementClosedTopTraits_2::Compare_x_on_boundary_2}
- * \cgalModels{ArrangementIdentifiedHorizontalTraits_2::Compare_x_on_boundary_2}
+ * \cgalHasModels{ArrangementClosedBottomTraits_2::Compare_x_on_boundary_2}
+ * \cgalHasModels{ArrangementClosedTopTraits_2::Compare_x_on_boundary_2}
+ * \cgalHasModels{ArrangementIdentifiedHorizontalTraits_2::Compare_x_on_boundary_2}
  * \cgalHasModelsEnd
  */
 class CompareXOnBoundary_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h
index 9e9e4fe45cde..466869d5a015 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareX_2.h
@@ -5,7 +5,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableBinaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementBasicTraits_2::Compare_x_2}
+ * \cgalHasModels{ArrangementBasicTraits_2::Compare_x_2}
  * \cgalHasModelsEnd
  */
 class CompareX_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h
index 7e423c1d5cdc..db282c6d238d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareXy_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableBinaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementBasicTraits_2::Compare_xy_2}
+ * \cgalHasModels{ArrangementBasicTraits_2::Compare_xy_2}
  * \cgalHasModelsEnd
  */
 class CompareXy_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h
index 871add8868c7..f49c04d0ec1c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXLeft_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableTernaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementBasicTraits_2::Compare_y_at_x_left_2}
+ * \cgalHasModels{ArrangementBasicTraits_2::Compare_y_at_x_left_2}
  * \cgalHasModelsEnd
  */
 class CompareYAtXLeft_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h
index 4959f78d530f..62fe93cdc3a8 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtXRight_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableTernaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementBasicTraits_2::Compare_y_at_x_right_2}
+ * \cgalHasModels{ArrangementBasicTraits_2::Compare_y_at_x_right_2}
  * \cgalHasModelsEnd
  */
 class CompareYAtXRight_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h
index 55ae2fc00faf..bc8d1d815730 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYAtX_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableBinaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementBasicTraits_2::Compare_y_at_x_2}
+ * \cgalHasModels{ArrangementBasicTraits_2::Compare_y_at_x_2}
  * \cgalHasModelsEnd
  */
 class CompareYAtX_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h
index e2ab7e9cae92..cb11491e3164 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYNearBoundary_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableTernaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2}
+ * \cgalHasModels{ArrangementOpenBoundaryTraits_2::Compare_y_near_boundary_2}
  * \cgalHasModelsEnd
  */
 class CompareYNearBoundary_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h
index 38a9090fd535..206458c178b8 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--CompareYOnBoundary_2.h
@@ -6,10 +6,10 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableBinaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2}
- * \cgalModels{ArrangementClosedRightTraits_2::Compare_y_on_boundary_2}
- * \cgalModels{ArrangementIdentifiedVerticalTraits_2::Compare_y_on_boundary_2}
- * \cgalModels{ArrangementSphericalBoundaryTraits_2::Compare_y_on_boundary_2}
+ * \cgalHasModels{ArrangementClosedLeftTraits_2::Compare_y_on_boundary_2}
+ * \cgalHasModels{ArrangementClosedRightTraits_2::Compare_y_on_boundary_2}
+ * \cgalHasModels{ArrangementIdentifiedVerticalTraits_2::Compare_y_on_boundary_2}
+ * \cgalHasModels{ArrangementSphericalBoundaryTraits_2::Compare_y_on_boundary_2}
  * \cgalHasModelsEnd
  */
 class CompareYOnBoundary_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h
index 75306891423f..12a1109a33b3 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructCurve_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{Functor}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementConstructCurveTraits_2::Construct_curve_2}
+ * \cgalHasModels{ArrangementConstructCurveTraits_2::Construct_curve_2}
  * \cgalHasModelsEnd
  */
 class ConstructCurve_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h
index 85b5f9a7fe29..85d379693bfd 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMaxVertex_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableUnaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementBasicTraits_2::Construct_max_vertex_2}
+ * \cgalHasModels{ArrangementBasicTraits_2::Construct_max_vertex_2}
  * \cgalHasModelsEnd
  */
 class ConstructMaxVertex_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h
index a434876ac15f..f9f8f3b99acf 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructMinVertex_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableUnaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementBasicTraits_2::Construct_min_vertex_2}
+ * \cgalHasModels{ArrangementBasicTraits_2::Construct_min_vertex_2}
  * \cgalHasModelsEnd
  */
 class ConstructMinVertex_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h
index 73a5a007b91a..39c1e7b42e59 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ConstructXMonotoneCurve_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{Functor}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2}
+ * \cgalHasModels{ArrangementConstructXMonotoneCurveTraits_2::Construct_x_monotone_curve_2}
  * \cgalHasModelsEnd
  */
 class ConstructXMonotoneCurve_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h
index 6ecf52458326..5268f4895192 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Curve_2.h
@@ -7,7 +7,7 @@ namespace ArrTraits {
  *
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementTraits_2::Curve_2}
+ * \cgalHasModels{ArrangementTraits_2::Curve_2}
  * \cgalHasModelsEnd
  */
 class Curve_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h
index ca9e3d1a098a..ed6d47ed5928 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Equal_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableBinaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementBasicTraits_2::Equal_2}
+ * \cgalHasModels{ArrangementBasicTraits_2::Equal_2}
  * \cgalHasModelsEnd
  */
 class Equal_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
index df17bc89d084..feda290b2eb7 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{Functor}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementXMonotoneTraits_2::Intersect_2}
+ * \cgalHasModels{ArrangementXMonotoneTraits_2::Intersect_2}
  * \cgalHasModelsEnd
  */
 class Intersect_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h
index 6ead4d30e3fb..351ae4153523 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnXIdentification_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableUnaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2}
+ * \cgalHasModels{ArrangementIdentifiedHorizontalTraits_2::Is_on_x_identification_2}
  * \cgalHasModelsEnd
  */
 class IsOnXIdentification_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h
index 9da39191b062..5ca8c772233b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsOnYIdentification_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableUnaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2}
+ * \cgalHasModels{ArrangementIdentifiedVerticalTraits_2::Is_on_y_identification_2}
  * \cgalHasModelsEnd
  */
 class IsOnYIdentification_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h
index 1df66d52a0b3..e6894c911cf9 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--IsVertical_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableUnaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementBasicTraits_2::Is_vertical_2}
+ * \cgalHasModels{ArrangementBasicTraits_2::Is_vertical_2}
  * \cgalHasModelsEnd
  */
 class IsVertical_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
index 2731e990a2fa..f88d42001407 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{Functor}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementTraits_2::Make_x_monotone_2}
+ * \cgalHasModels{ArrangementTraits_2::Make_x_monotone_2}
  * \cgalHasModelsEnd
  */
 class MakeXMonotone_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h
index b2ec195a1484..0ff9c3ff3924 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Merge_2.h
@@ -6,7 +6,7 @@ namespace ArrTraits {
  * \cgalRefines{Functor}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementXMonotoneTraits_2::Merge_2}
+ * \cgalHasModels{ArrangementXMonotoneTraits_2::Merge_2}
  * \cgalHasModelsEnd
  */
 class Merge_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h
index 1973f4a5371f..3f0c55da1951 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInX_2.h
@@ -6,9 +6,9 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableBinaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementVerticalSideTraits_2::Parameter_space_in_x_2}
- * \cgalModels{ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_2}
- * \cgalModels{ArrangementSphericalBoundaryTraits_2::Parameter_space_in_x_2}
+ * \cgalHasModels{ArrangementVerticalSideTraits_2::Parameter_space_in_x_2}
+ * \cgalHasModels{ArrangementOpenBoundaryTraits_2::Parameter_space_in_x_2}
+ * \cgalHasModels{ArrangementSphericalBoundaryTraits_2::Parameter_space_in_x_2}
  * \cgalHasModelsEnd
  */
 class ParameterSpaceInX_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h
index 19dae4f4cde1..c598003b214c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--ParameterSpaceInY_2.h
@@ -6,9 +6,9 @@ namespace ArrTraits {
  * \cgalRefines{AdaptableBinaryFunction}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2}
- * \cgalModels{ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_2}
- * \cgalModels{ArrangementSphericalBoundaryTraits_2::Parameter_space_in_y_2}
+ * \cgalHasModels{ArrangementHorizontalSideTraits_2::Parameter_space_in_y_2}
+ * \cgalHasModels{ArrangementOpenBoundaryTraits_2::Parameter_space_in_y_2}
+ * \cgalHasModels{ArrangementSphericalBoundaryTraits_2::Parameter_space_in_y_2}
  * \cgalHasModelsEnd
  */
 class ParameterSpaceInY_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h
index cc53c3b9467d..337ccf35ae5c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Point_2.h
@@ -8,7 +8,7 @@ namespace ArrTraits {
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementBasicTraits_2::Point_2}
+ * \cgalHasModels{ArrangementBasicTraits_2::Point_2}
  * \cgalHasModelsEnd
  */
 class Point_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h
index 71519a41aea9..68a833aa5496 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Split_2.h
@@ -5,7 +5,7 @@ namespace ArrTraits {
  * \cgalRefines{Functor}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementXMonotoneTraits_2::Split_2}
+ * \cgalHasModels{ArrangementXMonotoneTraits_2::Split_2}
  * \cgalHasModelsEnd
  */
 class Split_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h
index cf004f92dd04..3b61bb2dca42 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--XMonotoneCurve_2.h
@@ -7,7 +7,7 @@ namespace ArrTraits {
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
  *
  * \cgalHasModelsBegin
- * \cgalModels{ArrangementBasicTraits_2::X_monotone_curve_2}
+ * \cgalHasModels{ArrangementBasicTraits_2::X_monotone_curve_2}
  * \cgalHasModelsEnd
  */
 class XMonotoneCurve_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h
index a6940b050c1a..7dfd9a01f6b1 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementApproximateTraits_2.h
@@ -9,14 +9,14 @@ point.
 \cgalRefines{ArrangementBasicTraits_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
-\cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
-\cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_polycurve_traits_2<GeometryTraits_2>}
-\cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
-\cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+\cgalHasModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalHasModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
+\cgalHasModels{CGAL::Arr_linear_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_polycurve_traits_2<GeometryTraits_2>}
+\cgalHasModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
+\cgalHasModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
 \cgalHasModelsEnd
 
 \sa `ArrangementConstructXMonotoneCurveTraits_2`,
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h
index 6edbb7820d6d..e30fada356a9 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTopologyTraits.h
@@ -10,7 +10,7 @@
  * incident relations between them.
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2, Dcel>}
+ * \cgalHasModels{CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2, Dcel>}
  * \cgalHasModelsEnd
  */
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h
index 530aac71c9c5..3771c0af1e06 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementBasicTraits_2.h
@@ -28,21 +28,21 @@
  * \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_non_caching_segment_basic_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits>}
- * \cgalModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_line_arc_traits_2<CircularKernel>}
- * \cgalModels{CGAL::Arr_circular_arc_traits_2<CircularKernel>}
- * \cgalModels{CGAL::Arr_circular_line_arc_traits_2<CircularKernel>}
- * \cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
- * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
- * \cgalModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
- * \cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
- * \cgalModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
- * \cgalModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
+ * \cgalHasModels{CGAL::Arr_segment_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_non_caching_segment_basic_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_polyline_traits_2<SegmentTraits>}
+ * \cgalHasModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_line_arc_traits_2<CircularKernel>}
+ * \cgalHasModels{CGAL::Arr_circular_arc_traits_2<CircularKernel>}
+ * \cgalHasModels{CGAL::Arr_circular_line_arc_traits_2<CircularKernel>}
+ * \cgalHasModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+ * \cgalHasModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+ * \cgalHasModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
+ * \cgalHasModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+ * \cgalHasModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
+ * \cgalHasModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
  * \cgalHasModelsEnd
  */
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h
index c0f8193d057a..570967c29328 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructCurveTraits_2.h
@@ -8,13 +8,13 @@
  * \cgalRefines{ArrangementTraits_2}
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
- * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
- * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
- * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+ * \cgalHasModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+ * \cgalHasModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
+ * \cgalHasModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_segment_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
+ * \cgalHasModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementConstructXMonotoneCurveTraits_2`, and
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h
index 7bfebe4906f7..6d0a822280e6 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementConstructXMonotoneCurveTraits_2.h
@@ -8,13 +8,13 @@
  * \cgalRefines{ArrangementBasicTraits_2}
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
- * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
- * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
- * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+ * \cgalHasModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+ * \cgalHasModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
+ * \cgalHasModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_segment_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
+ * \cgalHasModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementApproximateTraits_2`,
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h
index b750989c9ffe..b0cb67e12e9d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcel.h
@@ -15,10 +15,10 @@
  * `ArrangementDcelInnerCcb`, and `ArrangementDcelIsolatedVertex` respectively.)
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_dcel_base<V,H,F>}
- * \cgalModels{CGAL::Arr_default_dcel<Traits>}
- * \cgalModels{CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>}
- * \cgalModels{CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>}
+ * \cgalHasModels{CGAL::Arr_dcel_base<V,H,F>}
+ * \cgalHasModels{CGAL::Arr_default_dcel<Traits>}
+ * \cgalHasModels{CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>}
+ * \cgalHasModels{CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementDcelVertex`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
index c3d607c6e98e..f263a1aae0d6 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
@@ -11,9 +11,9 @@ Instantiate a dcel class with many different possible types without ad-hoc limit
 \cgalRefines{ArrangementDcel}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Arr_default_dcel<Traits>}
-\cgalModels{CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>}
-\cgalModels{CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>}
+\cgalHasModels{CGAL::Arr_default_dcel<Traits>}
+\cgalHasModels{CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>}
+\cgalHasModels{CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>}
 \cgalHasModelsEnd
 
 */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h
index 8dfbfb227075..e28c300acea1 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementHorizontalSideTraits_2.h
@@ -12,10 +12,10 @@
  * \cgalRefines{ArrangementBasicTraits_2}
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
- * \cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
- * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>}
+ * \cgalHasModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+ * \cgalHasModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+ * \cgalHasModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementVerticalSideTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h
index 07c14685f6e9..286b02727add 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementInputFormatter.h
@@ -6,9 +6,9 @@
  * specific format.
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_text_formatter<Arrangement>}
- * \cgalModels{CGAL::Arr_face_extended_text_formatter<Arrangement>}
- * \cgalModels{CGAL::Arr_extended_dcel_text_formatter<Arrangement>}
+ * \cgalHasModels{CGAL::Arr_text_formatter<Arrangement>}
+ * \cgalHasModels{CGAL::Arr_face_extended_text_formatter<Arrangement>}
+ * \cgalHasModels{CGAL::Arr_extended_dcel_text_formatter<Arrangement>}
  * \cgalHasModelsEnd
  *
  */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
index 79624fa82380..75c1a6bd2410 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
@@ -12,14 +12,14 @@
  * \cgalRefines{ArrangementApproximateTraits_2,ArrangementConstructXMonotoneCurveTraits_2}
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
- * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
- * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_polycurve_traits_2<GeometryTraits_2>}
- * \cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
- * \cgalModels{CGAL::Arr_rational_function_traits_2}
+ * \cgalHasModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+ * \cgalHasModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2}
+ * \cgalHasModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_segment_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_polycurve_traits_2<GeometryTraits_2>}
+ * \cgalHasModels{CGAL::Arr_polyline_traits_2<SegmentTraits_2>}
+ * \cgalHasModels{CGAL::Arr_rational_function_traits_2}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementXMonotoneTraits_2` and
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h
index 3bf6b089be6f..7cce69c075dd 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOpenBoundaryTraits_2.h
@@ -40,11 +40,11 @@
  * \cgalRefines{ArrangementBasicTraits_2}
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
- * \cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
- * \cgalModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
- * \cgalModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
+ * \cgalHasModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+ * \cgalHasModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+ * \cgalHasModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
+ * \cgalHasModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementBasicTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h
index eb6c67a142b5..bb1846ad8f58 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementOutputFormatter.h
@@ -7,9 +7,9 @@ A model for the `ArrangementOutputFormatter` concept supports a set of functions
 writing an arrangement to an output stream using a specific format.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Arr_text_formatter<Arrangement>}
-\cgalModels{CGAL::Arr_face_extended_text_formatter<Arrangement>}
-\cgalModels{CGAL::Arr_extended_dcel_text_formatter<Arrangement>}
+\cgalHasModels{CGAL::Arr_text_formatter<Arrangement>}
+\cgalHasModels{CGAL::Arr_face_extended_text_formatter<Arrangement>}
+\cgalHasModels{CGAL::Arr_extended_dcel_text_formatter<Arrangement>}
 \cgalHasModelsEnd
 
 */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
index 782af5d25cd5..4217e268e82c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementPointLocation_2.h
@@ -21,10 +21,10 @@ the old style without any overhead, the macro
 \cgal header is included.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Arr_naive_point_location<Arrangement>}
-\cgalModels{CGAL::Arr_walk_along_line_point_location<Arrangement>}
-\cgalModels{CGAL::Arr_trapezoid_ric_point_location<Arrangement>}
-\cgalModels{CGAL::Arr_landmarks_point_location<Arrangement,Generator>}
+\cgalHasModels{CGAL::Arr_naive_point_location<Arrangement>}
+\cgalHasModels{CGAL::Arr_walk_along_line_point_location<Arrangement>}
+\cgalHasModels{CGAL::Arr_trapezoid_ric_point_location<Arrangement>}
+\cgalHasModels{CGAL::Arr_landmarks_point_location<Arrangement,Generator>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Arr_naive_point_location<Arrangement>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h
index 2c2d0ad0208d..25fde7ef42db 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementSphericalBoundaryTraits_2.h
@@ -12,7 +12,7 @@
  *   ArrangementContractedBottomTraits_2,ArrangementContractedTopTraits_2}
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>}
+ * \cgalHasModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementOpenBoundaryTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h
index defff744a976..bf0c5121709c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTopologyTraits.h
@@ -21,9 +21,9 @@
  * At this point we do not expose all the requirements of this concept.
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_bounded_planar_topology_traits_2<GeometryTraits_2,Dcel>}
- * \cgalModels{CGAL::Arr_unb_planar_topology_traits_2<GeometryTraits_2,Dcel>}
- * \cgalModels{CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2,Dcel>}
+ * \cgalHasModels{CGAL::Arr_bounded_planar_topology_traits_2<GeometryTraits_2,Dcel>}
+ * \cgalHasModels{CGAL::Arr_unb_planar_topology_traits_2<GeometryTraits_2,Dcel>}
+ * \cgalHasModels{CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2,Dcel>}
  * \cgalHasModelsEnd
  *
  * \sa `Arrangement_on_surface_2<GeometryTraits_2,TopologyTraits>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h
index 897ede7f25a3..e7f2288b560a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementTraits_2.h
@@ -31,20 +31,20 @@ that accept such curves, such as `intsert()`.
 \cgalRefines{ArrangementXMonotoneTraits_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits>}
-\cgalModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_line_arc_traits_2<CircularKernel>}
-\cgalModels{CGAL::Arr_circular_arc_traits_2<CircularKernel>}
-\cgalModels{CGAL::Arr_circular_line_arc_traits_2<CircularKernel>}
-\cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
-\cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
-\cgalModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
-\cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
-\cgalModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
-\cgalModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
+\cgalHasModels{CGAL::Arr_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_linear_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_polyline_traits_2<SegmentTraits>}
+\cgalHasModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_line_arc_traits_2<CircularKernel>}
+\cgalHasModels{CGAL::Arr_circular_arc_traits_2<CircularKernel>}
+\cgalHasModels{CGAL::Arr_circular_line_arc_traits_2<CircularKernel>}
+\cgalHasModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalHasModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+\cgalHasModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalHasModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+\cgalHasModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
+\cgalHasModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
 \cgalHasModelsEnd
 
 \sa `ArrangementBasicTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
index 0b7c89be1586..f82ff1097375 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalRayShoot_2.h
@@ -29,10 +29,10 @@ is recommended. To enable the old style without any overhead, the macro
 \cgal header is included.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Arr_naive_point_location<Arrangement>}
-\cgalModels{CGAL::Arr_walk_along_line_point_location<Arrangement>}
-\cgalModels{CGAL::Arr_trapezoid_ric_point_location<Arrangement>}
-\cgalModels{CGAL::Arr_landmarks_point_location<Arrangement,Generator>}
+\cgalHasModels{CGAL::Arr_naive_point_location<Arrangement>}
+\cgalHasModels{CGAL::Arr_walk_along_line_point_location<Arrangement>}
+\cgalHasModels{CGAL::Arr_trapezoid_ric_point_location<Arrangement>}
+\cgalHasModels{CGAL::Arr_landmarks_point_location<Arrangement,Generator>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Arr_naive_point_location<Arrangement>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h
index 2b9d1c9f6c16..88802d7ad610 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementVerticalSideTraits_2.h
@@ -12,10 +12,10 @@
  * \cgalRefines{ArrangementBasicTraits_2}
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
- * \cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
- * \cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
- * \cgalModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>}
+ * \cgalHasModels{CGAL::Arr_linear_traits_2<Kernel>}
+ * \cgalHasModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+ * \cgalHasModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+ * \cgalHasModels{CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, X, Y>}
  * \cgalHasModelsEnd
  *
  * \sa `ArrangementVerticalSideTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h
index 601725e3c065..0e6ec4d3af8e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryInputFormatter.h
@@ -10,7 +10,7 @@ specific format.
 \cgalRefines{ArrangementInputFormatter}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Arr_with_history_text_formatter<ArrFormatter>}
+\cgalHasModels{CGAL::Arr_with_history_text_formatter<ArrFormatter>}
 \cgalHasModelsEnd
 
 */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h
index 287a3a9f7ebd..2aa87cc1d95d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementWithHistoryOutputFormatter.h
@@ -10,7 +10,7 @@ specific format.
 \cgalRefines{ArrangementOutputFormatter}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Arr_with_history_text_formatter<ArrFormatter>}
+\cgalHasModels{CGAL::Arr_with_history_text_formatter<ArrFormatter>}
 \cgalHasModelsEnd
 
 */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h
index 32e49f947dcd..88cc075b5b13 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementXMonotoneTraits_2.h
@@ -19,20 +19,20 @@ curve splitting.
 \cgalRefines{ArrangementBasicTraits_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_linear_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_polyline_traits_2<SegmentTraits>}
-\cgalModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_line_arc_traits_2<CircularKernel>}
-\cgalModels{CGAL::Arr_circular_arc_traits_2<CircularKernel>}
-\cgalModels{CGAL::Arr_circular_line_arc_traits_2<CircularKernel>}
-\cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
-\cgalModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
-\cgalModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
-\cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
-\cgalModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
-\cgalModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
+\cgalHasModels{CGAL::Arr_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_linear_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_polyline_traits_2<SegmentTraits>}
+\cgalHasModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_line_arc_traits_2<CircularKernel>}
+\cgalHasModels{CGAL::Arr_circular_arc_traits_2<CircularKernel>}
+\cgalHasModels{CGAL::Arr_circular_line_arc_traits_2<CircularKernel>}
+\cgalHasModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalHasModels{CGAL::Arr_rational_function_traits_2<AlgebraicKernel_d_1>}
+\cgalHasModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalHasModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+\cgalHasModels{CGAL::Arr_curve_data_traits_2<Tr,XData,Mrg,CData,Cnv>}
+\cgalHasModels{CGAL::Arr_consolidated_curve_data_traits_2<Traits,Data>}
 \cgalHasModelsEnd
 
 \sa `ArrangementBasicTraits_2`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h
index 678d26425c4d..137ccd40de45 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/OverlayTraits.h
@@ -12,8 +12,8 @@ maintain the auxiliary data stored with the \dcel records of the resulting
 overlaid arrangement, based on the contents of the input records.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Arr_default_overlay_traits<Arrangement>}
-\cgalModels{CGAL::Arr_face_overlay_traits<Arr1,Arr2,ResArr,OvlFaceData>}
+\cgalHasModels{CGAL::Arr_default_overlay_traits<Arrangement>}
+\cgalHasModels{CGAL::Arr_face_overlay_traits<Arr1,Arr2,ResArr,OvlFaceData>}
 \cgalHasModelsEnd
 
 \sa `overlay`
diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
index 35818aa505d6..933edcacacb5 100644
--- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
+++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricCoordinates_2.h
@@ -9,9 +9,9 @@ A concept that describes the set of methods that should be defined for all coord
 models used to parameterize the class `Generalized_barycentric_coordinates_2`.
 
 \cgalHasModelsBegin
-\cgalModels{Wachspress_2}
-\cgalModels{Mean_value_2}
-\cgalModels{Discrete_harmonic_2}
+\cgalHasModels{Wachspress_2}
+\cgalHasModels{Mean_value_2}
+\cgalHasModels{Discrete_harmonic_2}
 \cgalHasModelsEnd
 
 \deprecated This part of the package is deprecated since the version 5.4 of \cgal.
diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h
index b1613da6b02c..394a074d2707 100644
--- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h
+++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/DiscretizedDomain_2.h
@@ -14,7 +14,7 @@ used to approximate certain types of generalized barycentric coordinate function
 The domain is bounded by the polygon.
 
 \cgalHasModelsBegin
-\cgalModels{Delaunay_domain_2}
+\cgalHasModels{Delaunay_domain_2}
 \cgalHasModelsEnd
 */
 class DiscretizedDomain_2 {
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h
index bc3fa2117d32..65fd4f347a8c 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--AreMergeable_2.h
@@ -6,7 +6,7 @@ namespace ArrDirectionalTraits {
 \cgalRefines{AdaptableBinaryFunction}
 
 \cgalHasModelsBegin
-\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2}
+\cgalHasModels{ArrangementDirectionalXMonotoneTraits_2::Are_mergeable_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h
index a2e684be6263..e7714c045614 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--CompareEndpointsXy_2.h
@@ -7,7 +7,7 @@ namespace ArrDirectionalTraits {
 \cgalRefines{AdaptableUnaryFunction}
 
 \cgalHasModelsBegin
-\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2}
+\cgalHasModels{ArrangementDirectionalXMonotoneTraits_2::Compare_endpoints_xy_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h
index bac19b870721..92ee2585b2db 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--ConstructOpposite_2.h
@@ -7,7 +7,7 @@ namespace ArrDirectionalTraits {
 \cgalRefines{AdaptableUnaryFunction}
 
 \cgalHasModelsBegin
-\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2}
+\cgalHasModels{ArrangementDirectionalXMonotoneTraits_2::Construct_opposite_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
index f82f215155a4..0a62ec61aad5 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Intersect_2.h
@@ -6,7 +6,7 @@ namespace ArrDirectionalTraits {
 \cgalRefines{AdaptableBinaryFunction}
 
 \cgalHasModelsBegin
-\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Intersect_2}
+\cgalHasModels{ArrangementDirectionalXMonotoneTraits_2::Intersect_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h
index a2b89befdec1..18f8f26e936f 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Merge_2.h
@@ -6,7 +6,7 @@ namespace ArrDirectionalTraits {
 \cgalRefines{AdaptableBinaryFunction}
 
 \cgalHasModelsBegin
-\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Merge_2}
+\cgalHasModels{ArrangementDirectionalXMonotoneTraits_2::Merge_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h
index 7bca25154fd4..5d6529d48620 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrDirectionalTraits--Split_2.h
@@ -6,7 +6,7 @@ namespace ArrDirectionalTraits {
 \cgalRefines{AdaptableUnaryFunction}
 
 \cgalHasModelsBegin
-\cgalModels{ArrangementDirectionalXMonotoneTraits_2::Split_2}
+\cgalHasModels{ArrangementDirectionalXMonotoneTraits_2::Split_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h
index 15aaffd07888..3278e4820008 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/ArrangementDirectionalXMonotoneTraits_2.h
@@ -17,13 +17,13 @@ as its <I>source</I> and the other as its <I>target</I>.
 \cgalRefines{ArrangementXMonotoneTraits_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Arr_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
-\cgalModels{CGAL::Arr_rational_function_traits_2<AlgKernel,NtTraits>}
-\cgalModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
-\cgalModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
+\cgalHasModels{CGAL::Arr_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_non_caching_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_circle_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Arr_conic_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalHasModels{CGAL::Arr_rational_function_traits_2<AlgKernel,NtTraits>}
+\cgalHasModels{CGAL::Arr_Bezier_curve_traits_2<RatKernel,AlgKernel,NtTraits>}
+\cgalHasModels{CGAL::Arr_algebraic_segment_traits_2<Coefficient>}
 \cgalHasModelsEnd
 
 \sa `ArrangementXMonotoneTraits_2`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h
index 3151c6eb0746..6d28d6afbf4c 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcel.h
@@ -17,7 +17,7 @@ respectively
 \cgalRefines{ArrangementDcel}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Gps_default_dcel<Traits>}
+\cgalHasModels{CGAL::Gps_default_dcel<Traits>}
 \cgalHasModelsEnd
 
 \sa `GeneralPolygonSetDcelFace`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h
index 123f3b883cfb..01a99bce20e4 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelFace.h
@@ -10,7 +10,7 @@ to represent the underlying internal `Arrangement_2` data structure.
 \cgalRefines{ArrangementDcelFace}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Gps_face_base}
+\cgalHasModels{CGAL::Gps_face_base}
 \cgalHasModelsEnd
 
 \sa `ArrangementDcel`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h
index 3f254f685a28..a21a5fd8b7f1 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetDcelHalfedge.h
@@ -9,7 +9,7 @@ to represent the underlying internal `Arrangement_2` data structure.
 \cgalRefines{ArrangementDcelHalfedge}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Gps_face_halfedge}
+\cgalHasModels{CGAL::Gps_face_halfedge}
 \cgalHasModelsEnd
 
 \sa `ArrangementDcel`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h
index bd1afb8ed78e..2c8966d82394 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygonSetTraits_2.h
@@ -14,9 +14,9 @@ types.
 \cgalRefines{ArrangementDirectionalXMonotoneTraits_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Gps_segment_traits_2<Kernel,Container,ArrSegmentTraits>}
-\cgalModels{CGAL::Gps_circle_segment_traits_2<Kernel>}
-\cgalModels{CGAL::Gps_traits_2<ArrTraits,GeneralPolygon>}
+\cgalHasModels{CGAL::Gps_segment_traits_2<Kernel,Container,ArrSegmentTraits>}
+\cgalHasModels{CGAL::Gps_circle_segment_traits_2<Kernel>}
+\cgalHasModels{CGAL::Gps_traits_2<ArrTraits,GeneralPolygon>}
 \cgalHasModelsEnd
 
 \sa `ArrangementDirectionalXMonotoneTraits_2`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h
index b9e255935261..e8a9a5b76e50 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GeneralPolygon_2.h
@@ -17,7 +17,7 @@ of Boolean set-operations. General polygon that represent holes must be
 clockwise oriented.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::General_polygon_2<ArrTraits>}
+\cgalHasModels{CGAL::General_polygon_2<ArrTraits>}
 \cgalHasModelsEnd
 
 */
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h
index 2515be1d0e7f..ae3edc165891 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygonWithHoles_2.h
@@ -10,7 +10,7 @@ A model of this concept represents a general polygon with holes.
 \cgalGeneralizes `GeneralPolygonWithHoles_2`
 
 \cgalHasModelsBegin
-\cgalModels{GeneralPolygonSetTraits_2::Polygon_with_holes2}
+\cgalHasModels{GeneralPolygonSetTraits_2::Polygon_with_holes2}
 \cgalHasModelsEnd
 
 \sa `GeneralPolygonWithHoles_2`
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h
index dc6486a1a31c..18872ffd1a08 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/Concepts/GpsTraitsGeneralPolygon_2.h
@@ -10,8 +10,8 @@ A model of this concept represents a simple general polygon.
 \cgalGeneralizes `GeneralPolygon_2`
 
 \cgalHasModelsBegin
-\cgalModels{GeneralPolygonSetTraits_2::Polygon_2}
-\cgalModels{CGAL::Polygon_2<PolygonTraits_2, Container>}
+\cgalHasModels{GeneralPolygonSetTraits_2::Polygon_2}
+\cgalHasModels{CGAL::Polygon_2<PolygonTraits_2, Container>}
 \cgalHasModelsEnd
 
 \sa `GeneralPolygon_2`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h
index 0ce3d2249b9f..62853106bae1 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/ApproximateMinEllipsoid_d_Traits_d.h
@@ -9,9 +9,9 @@ This concept defines the requirements for traits classes of
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Approximate_min_ellipsoid_d_traits_2<K,ET>}
-\cgalModels{CGAL::Approximate_min_ellipsoid_d_traits_3<K,ET>}
-\cgalModels{CGAL::Approximate_min_ellipsoid_d_traits_d<K,ET>}
+\cgalHasModels{CGAL::Approximate_min_ellipsoid_d_traits_2<K,ET>}
+\cgalHasModels{CGAL::Approximate_min_ellipsoid_d_traits_3<K,ET>}
+\cgalHasModels{CGAL::Approximate_min_ellipsoid_d_traits_d<K,ET>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Min_ellipse_2<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h
index 3e25f230aebf..0e78063f3e09 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinCircle2Traits.h
@@ -7,7 +7,7 @@ This concept defines the requirements for traits classes of
 `CGAL::Min_circle_2<Traits>`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Min_circle_2_traits_2<K>}
+\cgalHasModels{CGAL::Min_circle_2_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Min_circle_2<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h
index 853c32438132..d498ece7baf8 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinEllipse2Traits.h
@@ -7,7 +7,7 @@ This concept defines the requirements for traits classes of
 `CGAL::Min_ellipse_2<Traits>`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Min_ellipse_2_traits_2<K>}
+\cgalHasModels{CGAL::Min_ellipse_2_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Min_ellipse_2<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h
index 592d52d69d9c..65ffccff5294 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinQuadrilateralTraits_2.h
@@ -9,7 +9,7 @@ set using the functions `min_rectangle_2()`,
 `min_parallelogram_2()` and `min_strip_2()`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Min_quadrilateral_default_traits_2<K>}
+\cgalHasModels{CGAL::Min_quadrilateral_default_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::min_rectangle_2()`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h
index 0d812dd559b0..6815393e7bdb 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereAnnulusDTraits.h
@@ -7,9 +7,9 @@ This concept defines the requirements for traits classes of \f$ d\f$-dimensional
 min sphere and min annulus algorithms.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Min_sphere_annulus_d_traits_2<K,ET,NT>}
-\cgalModels{CGAL::Min_sphere_annulus_d_traits_3<K,ET,NT>}
-\cgalModels{CGAL::Min_sphere_annulus_d_traits_d<K,ET,NT>}
+\cgalHasModels{CGAL::Min_sphere_annulus_d_traits_2<K,ET,NT>}
+\cgalHasModels{CGAL::Min_sphere_annulus_d_traits_3<K,ET,NT>}
+\cgalHasModels{CGAL::Min_sphere_annulus_d_traits_d<K,ET,NT>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Min_sphere_d<Traits>`
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
index 2e19511b8103..9e08fa9312a3 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/MinSphereOfSpheresTraits.h
@@ -7,12 +7,12 @@ A model of concept `MinSphereOfSpheresTraits` must provide the
 following constants, types, predicates and operations.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Min_sphere_of_spheres_d_traits_2<K,FT,UseSqrt,Algorithm>}
-\cgalModels{CGAL::Min_sphere_of_spheres_d_traits_3<K,FT,UseSqrt,Algorithm>}
-\cgalModels{CGAL::Min_sphere_of_spheres_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>}
-\cgalModels{CGAL::Min_sphere_of_points_d_traits_2<K,FT,UseSqrt,Algorithm>}
-\cgalModels{CGAL::Min_sphere_of_points_d_traits_3<K,FT,UseSqrt,Algorithm>}
-\cgalModels{CGAL::Min_sphere_of_points_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>}
+\cgalHasModels{CGAL::Min_sphere_of_spheres_d_traits_2<K,FT,UseSqrt,Algorithm>}
+\cgalHasModels{CGAL::Min_sphere_of_spheres_d_traits_3<K,FT,UseSqrt,Algorithm>}
+\cgalHasModels{CGAL::Min_sphere_of_spheres_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>}
+\cgalHasModels{CGAL::Min_sphere_of_points_d_traits_2<K,FT,UseSqrt,Algorithm>}
+\cgalHasModels{CGAL::Min_sphere_of_points_d_traits_3<K,FT,UseSqrt,Algorithm>}
+\cgalHasModels{CGAL::Min_sphere_of_points_d_traits_d<K,FT,Dim,UseSqrt,Algorithm>}
 \cgalHasModelsEnd
 */
 
diff --git a/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h b/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h
index b72e77f91d34..4b18a7a762a2 100644
--- a/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/Concepts/RectangularPCenterTraits_2.h
@@ -8,7 +8,7 @@ needed to compute rectilinear \f$ p\f$-centers of a planar point set
 using the function `CGAL::rectangular_p_center_2()`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Rectangular_p_center_default_traits_2<K>}
+\cgalHasModels{CGAL::Rectangular_p_center_default_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::rectangular_p_center_2()`
diff --git a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h
index d41ffd3d8425..edd402137ed6 100644
--- a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionBox_d.h
@@ -11,8 +11,8 @@ the dimension, the `id`-number, and the boundaries of the box.
 \cgalRefines{Assignable}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Box_intersection_d::Box_d}
-\cgalModels{CGAL::Box_intersection_d::Box_with_handle_d}
+\cgalHasModels{CGAL::Box_intersection_d::Box_d}
+\cgalHasModels{CGAL::Box_intersection_d::Box_with_handle_d}
 \cgalHasModelsEnd
 
 \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
diff --git a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h
index 98cb8e4a34f9..c3541e6cfd23 100644
--- a/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/Concepts/BoxIntersectionTraits_d.h
@@ -10,7 +10,7 @@ the boxes manipulated in these algorithms.
 \cgalRefines{Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Box_intersection_d::Box_traits_d}
+\cgalHasModels{CGAL::Box_intersection_d::Box_traits_d}
 \cgalHasModelsEnd
 
 \sa \link PkgBoxIntersectionD_box_intersection_d `CGAL::box_intersection_d()` \endlink
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h
index 05175484ac24..6018fabb347e 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--PolynomialForCircles_2_2.h
@@ -12,7 +12,7 @@ are of a type that is a model of the concept
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polynomial_for_circles_2_2}
+\cgalHasModels{CGAL::Polynomial_for_circles_2_2}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForCircles`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h
index ee376204999c..d045a84662e8 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--Polynomial_1_2.h
@@ -10,7 +10,7 @@ coefficients are of a type that is a model of the concept
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polynomial_1_2}
+\cgalHasModels{CGAL::Polynomial_1_2}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForCircles`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h
index 13cdb5119351..b11014950b43 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles--RootForCircles_2_2.h
@@ -8,7 +8,7 @@ in two variables `x` and `y` that are models of concept
 `AlgebraicKernelForCircles::PolynomialForCircles_2_2`
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Root_for_circles_2_2}
+\cgalHasModels{CGAL::Root_for_circles_2_2}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForCircles`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h
index 9b259e047c3c..6241ca39f35e 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/AlgebraicKernelForCircles.h
@@ -8,7 +8,7 @@ curved kernel with all the algebraic functionalities required for the
 manipulation of circular arcs.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Algebraic_kernel_for_circles_2_2}
+\cgalHasModels{CGAL::Algebraic_kernel_for_circles_2_2}
 \cgalHasModelsEnd
 
 \sa `CircularKernel`
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h
index 82cf9487e871..d9019e31e3ac 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArcPoint_2.h
@@ -8,7 +8,7 @@ Concept for points on circles, circular arcs or line arcs.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Circular_arc_point_2<CircularKernel>}
+\cgalHasModels{CGAL::Circular_arc_point_2<CircularKernel>}
 \cgalHasModelsEnd
 */
 class CircularKernel::CircularArcPoint_2 {
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h
index d5833dfa55d1..dff040e6a328 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--CircularArc_2.h
@@ -8,7 +8,7 @@ Concept for arcs of circles.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Circular_arc_2<CircularKernel>}
+\cgalHasModels{CGAL::Circular_arc_2<CircularKernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h
index e92230b10a02..ca08be2ae848 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel--LineArc_2.h
@@ -10,7 +10,7 @@ Concept for line segments supported by a line that is a model of
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Line_arc_2<CircularKernel>}
+\cgalHasModels{CGAL::Line_arc_2<CircularKernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h
index d5c912468c6f..1c78b2d50ea7 100644
--- a/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h
+++ b/Circular_kernel_2/doc/Circular_kernel_2/Concepts/CircularKernel.h
@@ -6,8 +6,8 @@
 \cgalRefines{Kernel}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Circular_kernel_2<Kernel,AlgebraicKernelForCircles>}
-\cgalModels{CGAL::Exact_circular_kernel_2}
+\cgalHasModels{CGAL::Circular_kernel_2<Kernel,AlgebraicKernelForCircles>}
+\cgalHasModels{CGAL::Exact_circular_kernel_2}
 \cgalHasModelsEnd
 
 \sa `Kernel`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h
index 70aa9278d6b7..99b16c59c630 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialForSpheres_2_3.h
@@ -12,7 +12,7 @@ are of a type that is a model of the concept
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{GAL::Polynomial_for_spheres_2_}
+\cgalHasModels{GAL::Polynomial_for_spheres_2_}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h
index 6423e3805a0b..0df9eeb89b10 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--Polynomial_1_3.h
@@ -10,7 +10,7 @@ coefficients are of a type that is a model of the concept
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polynomial_1_3}
+\cgalHasModels{CGAL::Polynomial_1_3}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h
index 99d40b5860a0..6dd59fc1a88f 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--PolynomialsForLines_3.h
@@ -9,7 +9,7 @@ capable of storing equations of lines.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polynomials_for_lines_3}
+\cgalHasModels{CGAL::Polynomials_for_lines_3}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h
index cb25b3d6244f..5da83e31c6f4 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres--RootForSpheres_2_3.h
@@ -8,7 +8,7 @@ in three variables `x`, `y` and `z` that are models of concept
 `AlgebraicKernelForSpheres::PolynomialForSpheres_2_3`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Root_for_spheres_2_3}
+\cgalHasModels{CGAL::Root_for_spheres_2_3}
 \cgalHasModelsEnd
 
 \sa `AlgebraicKernelForSpheres`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h
index 585101b73df1..c258b5020a9d 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/AlgebraicKernelForSpheres.h
@@ -8,7 +8,7 @@ curved kernel with all the algebraic functionalities required for the
 manipulation of spheres, circles, and circular arcs in 3D.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Algebraic_kernel_for_spheres_2_3}
+\cgalHasModels{CGAL::Algebraic_kernel_for_spheres_2_3}
 \cgalHasModelsEnd
 
 \sa `SphericalKernel`
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h
index 8c932d227124..60f3f613b6d3 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArcPoint_3.h
@@ -8,7 +8,7 @@ Concept for points on spheres, circles, circular arcs or line arcs.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Circular_arc_point_3<SphericalKernel>}
+\cgalHasModels{CGAL::Circular_arc_point_3<SphericalKernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h
index 644a50773840..ad062120fdc0 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--CircularArc_3.h
@@ -8,7 +8,7 @@ Concept for arcs of circles.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Circular_arc_3<SphericalKernel>}
+\cgalHasModels{CGAL::Circular_arc_3<SphericalKernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h
index ca26700179f0..0c750dff3ac9 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel--LineArc_3.h
@@ -10,7 +10,7 @@ Concept for line segments supported by a line that is a model of
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Line_arc_3<SphericalKernel>}
+\cgalHasModels{CGAL::Line_arc_3<SphericalKernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h
index 22b389149611..23be29fe5b64 100644
--- a/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h
+++ b/Circular_kernel_3/doc/Circular_kernel_3/Concepts/SphericalKernel.h
@@ -6,8 +6,8 @@
 \cgalRefines{Kernel}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Spherical_kernel_3<Kernel,AlgebraicKernelForSpheres>}
-\cgalModels{CGAL::Exact_spherical_kernel_3}
+\cgalHasModels{CGAL::Spherical_kernel_3<Kernel,AlgebraicKernelForSpheres>}
+\cgalHasModels{CGAL::Exact_spherical_kernel_3}
 \cgalHasModelsEnd
 
 \sa `Kernel`
diff --git a/Circulator/doc/Circulator/Concepts/ConstHandle.h b/Circulator/doc/Circulator/Concepts/ConstHandle.h
index b15f9c6fd0c0..281902ecce4a 100644
--- a/Circulator/doc/Circulator/Concepts/ConstHandle.h
+++ b/Circulator/doc/Circulator/Concepts/ConstHandle.h
@@ -8,7 +8,7 @@ A constant handle. Refer to the `Handle` concept for more details.
 \cgalRefines{Descriptor}
 
 \cgalHasModelsBegin
-\cgalModels{const T* (const pointers)}
+\cgalHasModels{const T* (const pointers)}
 \cgalHasModelsEnd
 
 \sa `Handle`
diff --git a/Circulator/doc/Circulator/Concepts/Handle.h b/Circulator/doc/Circulator/Concepts/Handle.h
index 0e531736bcf0..fd08f96c22b6 100644
--- a/Circulator/doc/Circulator/Concepts/Handle.h
+++ b/Circulator/doc/Circulator/Concepts/Handle.h
@@ -24,10 +24,10 @@ operator is concerned (this serves the same purpose as NULL for pointers).
 standard containers.)
 
 \cgalHasModelsBegin
-\cgalModels{T* (pointer)}
-\cgalModels{const T* (const pointers)}
-\cgalModels{Iterator}
-\cgalModels{Circulator}
+\cgalHasModels{T* (pointer)}
+\cgalHasModels{const T* (const pointers)}
+\cgalHasModels{Iterator}
+\cgalHasModels{Circulator}
 \cgalHasModelsEnd
 */
 class Handle {
diff --git a/Classification/doc/Classification/Concepts/Classifier.h b/Classification/doc/Classification/Concepts/Classifier.h
index fefec08fcebe..03ba639d2566 100644
--- a/Classification/doc/Classification/Concepts/Classifier.h
+++ b/Classification/doc/Classification/Concepts/Classifier.h
@@ -13,9 +13,9 @@ Concept describing a classifier used by classification functions (see
 `CGAL::Classification::classify_with_graphcut()`).
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Classification::Sum_of_weighted_features_classifier}
-\cgalModels{CGAL::Classification::ETHZ::Random_forest_classifier}
-\cgalModels{CGAL::Classification::OpenCV::Random_forest_classifier}
+\cgalHasModels{CGAL::Classification::Sum_of_weighted_features_classifier}
+\cgalHasModels{CGAL::Classification::ETHZ::Random_forest_classifier}
+\cgalHasModels{CGAL::Classification::OpenCV::Random_forest_classifier}
 \cgalHasModelsEnd
 
 */
diff --git a/Classification/doc/Classification/Concepts/NeighborQuery.h b/Classification/doc/Classification/Concepts/NeighborQuery.h
index 4db42f7b4b8a..8de58a6c5236 100644
--- a/Classification/doc/Classification/Concepts/NeighborQuery.h
+++ b/Classification/doc/Classification/Concepts/NeighborQuery.h
@@ -11,10 +11,10 @@ namespace Classification
 Concept describing a neighbor query used for classification.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Classification::Point_set_neighborhood::K_neighbor_query}
-\cgalModels{CGAL::Classification::Point_set_neighborhood::Sphere_neighbor_query}
-\cgalModels{CGAL::Classification::Mesh_neighborhood::One_ring_neighbor_query}
-\cgalModels{CGAL::Classification::Mesh_neighborhood::N_ring_neighbor_query}
+\cgalHasModels{CGAL::Classification::Point_set_neighborhood::K_neighbor_query}
+\cgalHasModels{CGAL::Classification::Point_set_neighborhood::Sphere_neighbor_query}
+\cgalHasModels{CGAL::Classification::Mesh_neighborhood::One_ring_neighbor_query}
+\cgalHasModels{CGAL::Classification::Mesh_neighborhood::N_ring_neighbor_query}
 \cgalHasModelsEnd
 
 */
diff --git a/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h b/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h
index f5e1d3a6f365..639a45e5f4c4 100644
--- a/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h
+++ b/Convex_hull_2/doc/Convex_hull_2/Concepts/ConvexHullTraits_2.h
@@ -10,12 +10,12 @@ functions. The specific subset of these primitives required by each function
 is specified with each function.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Convex_hull_constructive_traits_2<R>}
-\cgalModels{CGAL::Convex_hull_traits_2<R>}
-\cgalModels{CGAL::Convex_hull_traits_adapter_2<R>}
-\cgalModels{CGAL::Projection_traits_xy_3<K>}
-\cgalModels{CGAL::Projection_traits_yz_3<K>}
-\cgalModels{CGAL::Projection_traits_xz_3<K>}
+\cgalHasModels{CGAL::Convex_hull_constructive_traits_2<R>}
+\cgalHasModels{CGAL::Convex_hull_traits_2<R>}
+\cgalHasModels{CGAL::Convex_hull_traits_adapter_2<R>}
+\cgalHasModels{CGAL::Projection_traits_xy_3<K>}
+\cgalHasModels{CGAL::Projection_traits_yz_3<K>}
+\cgalHasModels{CGAL::Projection_traits_xz_3<K>}
 \cgalHasModelsEnd
 
 */
diff --git a/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h b/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h
index b9fd8dac2302..ba20411843b0 100644
--- a/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h
+++ b/Convex_hull_3/doc/Convex_hull_3/Concepts/ConvexHullTraits_3.h
@@ -5,8 +5,8 @@
 Requirements of the traits class of the function `CGAL::convex_hull_3()`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Convex_hull_traits_3<K>}
-\cgalModels{CGAL::Extreme_points_traits_adapter_3<PPM, GT>}
+\cgalHasModels{CGAL::Convex_hull_traits_3<K>}
+\cgalHasModels{CGAL::Extreme_points_traits_adapter_3<PPM, GT>}
 \cgalHasModelsEnd
 
 */
diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h
index fce2c1aa3200..19c5793f9c0f 100644
--- a/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h
+++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/ConvexHullTraits_d.h
@@ -8,9 +8,9 @@ Requirements of the traits class to be used with the
 class `CGAL::Convex_hull_d`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Cartesian_d<FT,LA>}
-\cgalModels{CGAL::Homogeneous_d<RT,LA>}
-\cgalModels{CGAL::Convex_hull_d_traits_3<R>}
+\cgalHasModels{CGAL::Cartesian_d<FT,LA>}
+\cgalHasModels{CGAL::Homogeneous_d<RT,LA>}
+\cgalHasModels{CGAL::Convex_hull_d_traits_3<R>}
 \cgalHasModelsEnd
 
 */
diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h
index 0937e25239c1..a584e7433ed5 100644
--- a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h
+++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayLiftedTraits_d.h
@@ -8,8 +8,8 @@ Requirements of the second traits class to be used with the
 class `CGAL::Delaunay_d`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Cartesian_d<FT,LA>}
-\cgalModels{CGAL::Homogeneous_d<RT,LA>}
+\cgalHasModels{CGAL::Cartesian_d<FT,LA>}
+\cgalHasModels{CGAL::Homogeneous_d<RT,LA>}
 \cgalHasModelsEnd
 
 */
diff --git a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h
index 2f91bbf7d823..c04db63b19c8 100644
--- a/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h
+++ b/Convex_hull_d/doc/Convex_hull_d/Concepts/DelaunayTraits_d.h
@@ -8,8 +8,8 @@ Requirements of the first traits class to be used with the
 class `CGAL::Delaunay_d`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Cartesian_d<FT,LA>}
-\cgalModels{CGAL::Homogeneous_d<RT,LA>}
+\cgalHasModels{CGAL::Cartesian_d<FT,LA>}
+\cgalHasModels{CGAL::Homogeneous_d<RT,LA>}
 \cgalHasModelsEnd
 
 */
diff --git a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
index 02ae3ebf7cf3..3665e2ae25a0 100644
--- a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
+++ b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
@@ -17,10 +17,10 @@ Note however, that these operations usually involve the projection of
 \cgalRefines{ArrangementXMonotoneTraits_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Env_triangle_traits_3<Kernel>}
-\cgalModels{CGAL::Env_sphere_traits_3<ConicTraits>}
-\cgalModels{CGAL::Env_plane_traits_3<Kernel>}
-\cgalModels{CGAL::Env_surface_data_traits_3<Traits,XyData,SData,Cnv>}
+\cgalHasModels{CGAL::Env_triangle_traits_3<Kernel>}
+\cgalHasModels{CGAL::Env_sphere_traits_3<ConicTraits>}
+\cgalHasModels{CGAL::Env_plane_traits_3<Kernel>}
+\cgalHasModels{CGAL::Env_surface_data_traits_3<Traits,XyData,SData,Cnv>}
 \cgalHasModelsEnd
 
 */
diff --git a/Generator/doc/Generator/Concepts/PointGenerator.h b/Generator/doc/Generator/Concepts/PointGenerator.h
index 5a70e5f0ebdc..39019e4b99a7 100644
--- a/Generator/doc/Generator/Concepts/PointGenerator.h
+++ b/Generator/doc/Generator/Concepts/PointGenerator.h
@@ -6,20 +6,20 @@ The concept `PointGenerator` defines the requirements for a point generator,
 which can be used in places where input iterators are called for.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Random_points_in_ball_d<Point_d,>}
-\cgalModels{CGAL::Random_points_in_disc_2<Point_2, Creator>}
-\cgalModels{CGAL::Random_points_in_square_2<Point_2, Creator>}
-\cgalModels{CGAL::Random_points_in_triangle_2<Point_2, Creator>}
-\cgalModels{CGAL::Random_points_on_circle_2<Point_2, Creator>}
-\cgalModels{CGAL::Random_points_on_segment_2<Point_2, Creator>}
-\cgalModels{CGAL::Random_points_on_square_2<Point_2, Creator>}
-\cgalModels{CGAL::Random_points_in_cube_3<Point_3, Creator>}
-\cgalModels{CGAL::Random_points_in_cube_d<Point_d>}
-\cgalModels{CGAL::Random_points_in_sphere_3<Point_3, Creator>}
-\cgalModels{CGAL::Random_points_in_triangle_3<Point_3, Creator>}
-\cgalModels{CGAL::Random_points_in_tetrahedron_3<Point_3, Creator>}
-\cgalModels{CGAL::Random_points_on_sphere_3<Point_3, Creator>}
-\cgalModels{CGAL::Random_points_on_sphere_d<Point_d>}
+\cgalHasModels{CGAL::Random_points_in_ball_d<Point_d,>}
+\cgalHasModels{CGAL::Random_points_in_disc_2<Point_2, Creator>}
+\cgalHasModels{CGAL::Random_points_in_square_2<Point_2, Creator>}
+\cgalHasModels{CGAL::Random_points_in_triangle_2<Point_2, Creator>}
+\cgalHasModels{CGAL::Random_points_on_circle_2<Point_2, Creator>}
+\cgalHasModels{CGAL::Random_points_on_segment_2<Point_2, Creator>}
+\cgalHasModels{CGAL::Random_points_on_square_2<Point_2, Creator>}
+\cgalHasModels{CGAL::Random_points_in_cube_3<Point_3, Creator>}
+\cgalHasModels{CGAL::Random_points_in_cube_d<Point_d>}
+\cgalHasModels{CGAL::Random_points_in_sphere_3<Point_3, Creator>}
+\cgalHasModels{CGAL::Random_points_in_triangle_3<Point_3, Creator>}
+\cgalHasModels{CGAL::Random_points_in_tetrahedron_3<Point_3, Creator>}
+\cgalHasModels{CGAL::Random_points_on_sphere_3<Point_3, Creator>}
+\cgalHasModels{CGAL::Random_points_on_sphere_d<Point_d>}
 \cgalHasModelsEnd
 
 */
diff --git a/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h b/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h
index 669f54809b32..05cb1eda3a82 100644
--- a/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h
+++ b/Generator/doc/Generator/Concepts/RandomConvexSetTraits_2.h
@@ -6,7 +6,7 @@ The concept `RandomConvexSetTraits_2` describes the requirements of the traits
 class for the function `random_convex_set_2()`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Random_convex_set_traits_2<Kernel>}
+\cgalHasModels{CGAL::Random_convex_set_traits_2<Kernel>}
 \cgalHasModelsEnd
 
 */
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
index 6b99d22b415c..ed5f246b5f04 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
@@ -68,9 +68,9 @@ from the `<CGAL/memory.h>` header file can be used as default
 allocator.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::HalfedgeDS_default}
-\cgalModels{CGAL::HalfedgeDS_list}
-\cgalModels{CGAL::HalfedgeDS_vector}
+\cgalHasModels{CGAL::HalfedgeDS_default}
+\cgalHasModels{CGAL::HalfedgeDS_list}
+\cgalHasModels{CGAL::HalfedgeDS_vector}
 \cgalHasModelsEnd
 
 \sa `HalfedgeDSItems`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h
index fb3c3e05d2ac..e8ef9f27a86a 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSFace.h
@@ -24,8 +24,8 @@ can be bypassed by the user, but not by accident.)
 \cgalRefines{CopyConstructible,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::HalfedgeDS_face_base<Refs>}
-\cgalModels{CGAL::HalfedgeDS_face_min_base<Refs>}
+\cgalHasModels{CGAL::HalfedgeDS_face_base<Refs>}
+\cgalHasModels{CGAL::HalfedgeDS_face_min_base<Refs>}
 \cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h
index f726b2c43833..d464d21ca1c4 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSHalfedge.h
@@ -34,8 +34,8 @@ function. The base class `Base_base` provides access to it. (The
 protection could be bypassed also by an user, but not by accident.)
 
 \cgalHasModelsBegin
-\cgalModels{::CGAL::HalfedgeDS_halfedge_base}
-\cgalModels{::CGAL::HalfedgeDS_halfedge_min_base}
+\cgalHasModels{::CGAL::HalfedgeDS_halfedge_base}
+\cgalHasModels{::CGAL::HalfedgeDS_halfedge_min_base}
 \cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h
index 3b52eeb48a51..b4399e4121cd 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSItems.h
@@ -17,9 +17,9 @@ types are described on the manual pages of the concepts `HalfedgeDSVertex`,
 `HalfedgeDSHalfedge`, and `HalfedgeDSFace` respectively.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::HalfedgeDS_min_items}
-\cgalModels{CGAL::HalfedgeDS_items_2}
-\cgalModels{CGAL::Polyhedron_items_3}
+\cgalHasModels{CGAL::HalfedgeDS_min_items}
+\cgalHasModels{CGAL::HalfedgeDS_items_2}
+\cgalHasModels{CGAL::Polyhedron_items_3}
 \cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h
index ce5766136308..19efa29448b2 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDSVertex.h
@@ -24,8 +24,8 @@ could be bypassed by an user, but not by accident.)
 \cgalRefines{CopyConstructible,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::HalfedgeDS_vertex_base<Refs>}
-\cgalModels{CGAL::HalfedgeDS_vertex_min_base<Refs>}
+\cgalHasModels{CGAL::HalfedgeDS_vertex_base<Refs>}
+\cgalHasModels{CGAL::HalfedgeDS_vertex_min_base<Refs>}
 \cgalHasModelsEnd
 
 \sa `HalfedgeDS<Traits,Items,Alloc>`
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
index 39a254eec7e1..1aaec1a1a002 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicDelaunayTriangulationTraits_2.h
@@ -17,8 +17,8 @@ This concept refines `DelaunayTriangulationTraits_2` because the class `CGAL::Hy
 internally relies on the class `CGAL::Delaunay_triangulation_2`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Hyperbolic_Delaunay_triangulation_traits_2}
-\cgalModels{CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2}
+\cgalHasModels{CGAL::Hyperbolic_Delaunay_triangulation_traits_2}
+\cgalHasModels{CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2}
 \cgalHasModelsEnd
 */
 
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h
index 51a984a3c985..f4f5ab1c62e2 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Concepts/HyperbolicTriangulationFaceBase_2.h
@@ -42,7 +42,7 @@ Delaunay triangulations in the hyperbolic plane. The function `tds_data()` is us
 internally by the triangulation class during the insertion of points in the triangulation.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Hyperbolic_triangulation_face_base_2}
+\cgalHasModels{CGAL::Hyperbolic_triangulation_face_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h
index 407337905ef1..d31bfb5c8619 100644
--- a/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h
+++ b/Inscribed_areas/doc/Inscribed_areas/Concepts/ExtremalPolygonTraits_2.h
@@ -16,8 +16,8 @@ precondition checking only. Therefore, they need not to be
 specified, in case that precondition checking is disabled.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Extremal_polygon_area_traits_2<K>}
-\cgalModels{CGAL::Extremal_polygon_perimeter_traits_2<K>}
+\cgalHasModels{CGAL::Extremal_polygon_area_traits_2<K>}
+\cgalHasModels{CGAL::Extremal_polygon_perimeter_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::maximum_area_inscribed_k_gon_2()`
diff --git a/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h b/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h
index 796290481046..5a269cc649f9 100644
--- a/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h
+++ b/Inscribed_areas/doc/Inscribed_areas/Concepts/LargestEmptyIsoRectangleTraits_2.h
@@ -11,8 +11,8 @@ this class and some function object types for the required
 predicates on those primitives.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Cartesian}
-\cgalModels{CGAL::Homogeneous}
+\cgalHasModels{CGAL::Cartesian}
+\cgalHasModels{CGAL::Homogeneous}
 \cgalHasModelsEnd
 
 \sa `CGAL::Largest_empty_iso_rectangle_2<Traits>`
diff --git a/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h b/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h
index 0cdbc888f217..222fc82d203f 100644
--- a/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h
+++ b/Interpolation/doc/Interpolation/Concepts/GradientFittingTraits.h
@@ -8,7 +8,7 @@ traits class that defines the primitives used by the algorithm. The
 concept `GradientFittingTraits` defines this common set of requirements.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Interpolation_gradient_fitting_traits_2<K>}
+\cgalHasModels{CGAL::Interpolation_gradient_fitting_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `InterpolationTraits`
diff --git a/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h b/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h
index 18b806952cb5..d3b8bd79beca 100644
--- a/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h
+++ b/Interpolation/doc/Interpolation/Concepts/InterpolationTraits.h
@@ -8,8 +8,8 @@ defines the primitives used in the interpolation algorithms. The concept
 `InterpolationTraits` defines this common set of requirements.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Interpolation_traits_2<K>}
-\cgalModels{CGAL::Interpolation_gradient_fitting_traits_2<K>}
+\cgalHasModels{CGAL::Interpolation_traits_2<K>}
+\cgalHasModels{CGAL::Interpolation_gradient_fitting_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `GradientFittingTraits`
diff --git a/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h b/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h
index fe7cbbd266ed..7ca67466f3c9 100644
--- a/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h
+++ b/Interval_skip_list/doc/Interval_skip_list/Concepts/Interval.h
@@ -10,8 +10,8 @@ closed. It is up to the implementer of a model for this concept
 to define that.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Interval_skip_list_interval<Value>}
-\cgalModels{CGAL::Level_interval}
+\cgalHasModels{CGAL::Interval_skip_list_interval<Value>}
+\cgalHasModels{CGAL::Level_interval}
 \cgalHasModelsEnd
 
 \sa `Interval_skip_list`
diff --git a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h
index 93d2ee819e5a..bea789a167bc 100644
--- a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h
+++ b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/DataKernel.h
@@ -14,8 +14,8 @@ Only constructors (from 3 scalars and copy constructors) and access
 methods to coordinates `x()`, `y()`, `z()` are needed.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Cartesian<FieldNumberType>}
-\cgalModels{CGAL::Simple_cartesian<FieldNumberType>}
+\cgalHasModels{CGAL::Cartesian<FieldNumberType>}
+\cgalHasModels{CGAL::Simple_cartesian<FieldNumberType>}
 \cgalHasModelsEnd
 
 \sa `LocalKernel`
diff --git a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h
index d4981cf4f846..17dbcfae03f8 100644
--- a/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h
+++ b/Jet_fitting_3/doc/Jet_fitting_3/Concepts/LocalKernel.h
@@ -30,8 +30,8 @@ methods to coordinates `x()`, `y()`, `z()` are needed for the point and
 vector types.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Cartesian<FieldNumberType>}
-\cgalModels{CGAL::Simple_cartesian<FieldNumberType>}
+\cgalHasModels{CGAL::Cartesian<FieldNumberType>}
+\cgalHasModels{CGAL::Simple_cartesian<FieldNumberType>}
 \cgalHasModelsEnd
 
 \sa `DataKernel`
diff --git a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h
index 9433ac9dd058..57ad06016b8e 100644
--- a/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h
+++ b/Kernel_23/doc/Kernel_23/Concepts/GeomObjects.h
@@ -9,7 +9,7 @@ namespace Kernel {
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Circle_2<Kernel>}
+  \cgalHasModels{CGAL::Circle_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_2`
@@ -41,7 +41,7 @@ class Circle_2 {
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Circle_3<Kernel>}
+  \cgalHasModels{CGAL::Circle_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeApproximateArea_3`
@@ -71,7 +71,8 @@ class Circle_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalModels{CGAL::Direction_2<Kernel>}
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Direction_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::CompareAngleWithXAxis_2`
@@ -96,7 +97,8 @@ class Direction_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalModels{CGAL::Direction_3<Kernel>}
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Direction_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ConstructDirection_3`
@@ -118,7 +120,7 @@ A type representing isocuboids in three dimensions.
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Iso_cuboid_3<Kernel>}
+\cgalHasModels{CGAL::Iso_cuboid_3<Kernel>}
 \cgalHasModelsEnd
 
 \sa `Kernel::BoundedSide_3`
@@ -144,7 +146,8 @@ class IsoCuboid_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalModels{CGAL::Iso_rectangle_2<Kernel>}
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Iso_rectangle_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ConstructIsoRectangle_2`
@@ -177,7 +180,8 @@ class IsoRectangle_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalModels{CGAL::Line_2<Kernel>}
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Line_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::CompareXAtY_2`
@@ -214,7 +218,8 @@ class Line_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalModels{CGAL::Line_3<Kernel>}
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Line_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
@@ -246,7 +251,8 @@ class Line_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalModels{CGAL::Object}
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Object}
   \cgalHasModelsEnd
 
   \sa `Kernel::Assign_2`
@@ -268,7 +274,8 @@ class Object_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalModels{CGAL::Object}
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Object}
   \cgalHasModelsEnd
 
   \sa `Kernel::Assign_3`
@@ -288,7 +295,8 @@ class Object_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalModels{CGAL::Plane_3<Kernel>}
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Plane_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
@@ -326,7 +334,8 @@ class Plane_3 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalModels{CGAL::Point_2<Kernel>}
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Point_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::Angle_2`
@@ -386,7 +395,8 @@ class Point_2 {
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
-  \cgalModels{CGAL::Point_3<Kernel>}
+  \cgalHasModelsBegin
+  \cgalHasModels{CGAL::Point_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::Angle_3`
@@ -449,7 +459,7 @@ A type representing rays in two dimensions.
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Ray_2<Kernel>}
+\cgalHasModels{CGAL::Ray_2<Kernel>}
 \cgalHasModelsEnd
 
 \sa `Kernel::CollinearHasOn_2`
@@ -483,7 +493,7 @@ class Ray_2 {
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Ray_3<Kernel>}
+  \cgalHasModels{CGAL::Ray_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
@@ -513,7 +523,7 @@ class Ray_3 {
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Segment_2<Kernel>}
+  \cgalHasModels{CGAL::Segment_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::CollinearHasOn_2`
@@ -549,7 +559,7 @@ class Segment_2 {
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Segment_3<Kernel>}
+  \cgalHasModels{CGAL::Segment_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredDistance_3`
@@ -581,7 +591,7 @@ class Segment_3 {
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Sphere_3<Kernel>}
+  \cgalHasModels{CGAL::Sphere_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_3`
@@ -613,7 +623,7 @@ class Sphere_3 {
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Tetrahedron_3<Kernel>}
+  \cgalHasModels{CGAL::Tetrahedron_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_3`
@@ -646,7 +656,7 @@ class Tetrahedron_3 {
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Triangle_2<Kernel>}
+  \cgalHasModels{CGAL::Triangle_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::BoundedSide_2`
@@ -681,7 +691,7 @@ class Triangle_2 {
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Triangle_3<Kernel>}
+  \cgalHasModels{CGAL::Triangle_3<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeSquaredArea_3`
@@ -708,7 +718,7 @@ class Triangle_3 {
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Vector_2<Kernel>}
+  \cgalHasModels{CGAL::Vector_2<Kernel>}
   \cgalHasModelsEnd
 
   \sa `Kernel::ComputeDeterminant_2`
@@ -743,7 +753,7 @@ A type representing vectors in three dimensions.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Vector_3<Kernel>}
+\cgalHasModels{CGAL::Vector_3<Kernel>}
 \cgalHasModelsEnd
 
 \sa `Kernel::CompareDihedralAngle_3`
@@ -781,7 +791,7 @@ A type representing weighted points in two dimensions.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Weighted_point_2<Kernel>}
+\cgalHasModels{CGAL::Weighted_point_2<Kernel>}
 \cgalHasModelsEnd
 
 \sa `Kernel::ConstructWeightedPoint_2`
@@ -810,7 +820,7 @@ A type representing weighted points in three dimensions.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Weighted_point_3<Kernel>}
+\cgalHasModels{CGAL::Weighted_point_3<Kernel>}
 \cgalHasModelsEnd
 
 \sa `Kernel::ConstructWeightedPoint_3`
diff --git a/Kernel_23/doc/Kernel_23/Concepts/Kernel.h b/Kernel_23/doc/Kernel_23/Concepts/Kernel.h
index 2da2b9d8fb9f..e312763fd33f 100644
--- a/Kernel_23/doc/Kernel_23/Concepts/Kernel.h
+++ b/Kernel_23/doc/Kernel_23/Concepts/Kernel.h
@@ -21,14 +21,14 @@
   When the result type is not determined, no prefix is used.
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Cartesian<FieldNumberType>}
-  \cgalModels{CGAL::Homogeneous<RingNumberType>}
-  \cgalModels{CGAL::Simple_cartesian<FieldNumberType>}
-  \cgalModels{CGAL::Simple_homogeneous<RingNumberType>}
-  \cgalModels{CGAL::Filtered_kernel<CK>}
-  \cgalModels{CGAL::Exact_predicates_exact_constructions_kernel}
-  \cgalModels{CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt}
-  \cgalModels{CGAL::Exact_predicates_inexact_constructions_kernel}
+  \cgalHasModels{CGAL::Cartesian<FieldNumberType>}
+  \cgalHasModels{CGAL::Homogeneous<RingNumberType>}
+  \cgalHasModels{CGAL::Simple_cartesian<FieldNumberType>}
+  \cgalHasModels{CGAL::Simple_homogeneous<RingNumberType>}
+  \cgalHasModels{CGAL::Filtered_kernel<CK>}
+  \cgalHasModels{CGAL::Exact_predicates_exact_constructions_kernel}
+  \cgalHasModels{CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt}
+  \cgalHasModels{CGAL::Exact_predicates_inexact_constructions_kernel}
   \cgalHasModelsEnd
 
   \sa `Kernel_d`
diff --git a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h
index 4a8e19db8cd4..fd43b0acbcae 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/KernelWithLifting_d.h
@@ -9,8 +9,8 @@ unclear in kernels of fixed dimension.
 
 \cgalRefines{Kernel_d}
 \cgalHasModelsBegin
-\cgalModels{CGAL::Cartesian_d<FieldNumberType>}
-\cgalModels{CGAL::Homogeneous_d<RingNumberType>}
+\cgalHasModels{CGAL::Cartesian_d<FieldNumberType>}
+\cgalHasModels{CGAL::Homogeneous_d<RingNumberType>}
 \cgalHasModelsEnd
 */
 class KernelWithLifting_d {
diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h
index c4ac4f607c80..6b484f16e141 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel_d.h
@@ -19,10 +19,10 @@ constructive procedures in the kernel. There are also function objects
 replacing operators, especially for equality testing.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Cartesian_d<FieldNumberType>}
-\cgalModels{CGAL::Homogeneous_d<RingNumberType>}
-\cgalModels{CGAL::Epick_d<DimensionTag>}
-\cgalModels{CGAL::Epeck_d<DimensionTag>}
+\cgalHasModels{CGAL::Cartesian_d<FieldNumberType>}
+\cgalHasModels{CGAL::Homogeneous_d<RingNumberType>}
+\cgalHasModels{CGAL::Epick_d<DimensionTag>}
+\cgalHasModels{CGAL::Epeck_d<DimensionTag>}
 \cgalHasModelsEnd
 */
 class Kernel_d {
diff --git a/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h b/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h
index 8dff375eaea0..e0e523e5363e 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/LinearAlgebraTraits_d.h
@@ -14,8 +14,8 @@ system \f$ A x = b\f$ unsolvable it also returns a vector \f$ c\f$ such that
 \f$ c^T A = 0\f$ and \f$ c^T b \neq 0\f$.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Linear_algebraHd<RT>}
-\cgalModels{CGAL::Linear_algebraCd<FT>}
+\cgalHasModels{CGAL::Linear_algebraHd<RT>}
+\cgalHasModels{CGAL::Linear_algebraCd<FT>}
 \cgalHasModelsEnd
 
 */
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h
index abc3d27eaf24..4f40ff9f074c 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/Concepts/LinearCellComplexItems.h
@@ -10,7 +10,7 @@ The concept `LinearCellComplexItems` refines the concept of `GenericMapItems` by
 The first type in `Attributes` tuple must be a model of the `CellAttributeWithPoint` concept.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Linear_cell_complex_min_items}
+\cgalHasModels{CGAL::Linear_cell_complex_min_items}
 \cgalHasModelsEnd
 
 \sa `LinearCellComplex`
diff --git a/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h b/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h
index 9a7b265540b9..db4833f4218d 100644
--- a/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h
+++ b/Matrix_search/doc/Matrix_search/Concepts/BasicMatrix.h
@@ -9,7 +9,7 @@ types and operations in order to be a model for
 `BasicMatrix`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Dynamic_matrix<M>}
+\cgalHasModels{CGAL::Dynamic_matrix<M>}
 \cgalHasModelsEnd
 
 \sa `MonotoneMatrixSearchTraits`
diff --git a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h
index b20b74de1d09..4c40f6e51387 100644
--- a/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h
+++ b/Matrix_search/doc/Matrix_search/Concepts/MonotoneMatrixSearchTraits.h
@@ -22,7 +22,7 @@ matrix classes.
 </UL>
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Dynamic_matrix<M>}
+\cgalHasModels{CGAL::Dynamic_matrix<M>}
 \cgalHasModelsEnd
 
 \sa `CGAL::monotone_matrix_search()`
diff --git a/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h b/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h
index 99c3cfcba772..94bea1beccaf 100644
--- a/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h
+++ b/Matrix_search/doc/Matrix_search/Concepts/SortedMatrixSearchTraits.h
@@ -9,7 +9,7 @@ that fulfills a certain feasibility criterion using the function
 `CGAL::sorted_matrix_search`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Sorted_matrix_search_traits_adaptor<F,M>}
+\cgalHasModels{CGAL::Sorted_matrix_search_traits_adaptor<F,M>}
 \cgalHasModelsEnd
 
 \sa `CGAL::sorted_matrix_search()`
diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h
index 7bc632d6fa8e..e4289950e0c1 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshFaceBase_2.h
@@ -14,7 +14,7 @@ meshing domain or not.
 \cgalRefines{ConstrainedTriangulationFaceBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Delaunay_mesh_face_base_2<Traits, Fb>}
+\cgalHasModels{CGAL::Delaunay_mesh_face_base_2<Traits, Fb>}
 \cgalHasModelsEnd
 
 
diff --git a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h
index ac7a4a691612..26f52e7993c9 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/DelaunayMeshVertexBase_2.h
@@ -14,7 +14,7 @@ the mesh density everywhere while modifying the mesh.
 \cgalRefines{TriangulationVertexBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Delaunay_mesh_vertex_base_2<Traits, Vb>}
+\cgalHasModels{CGAL::Delaunay_mesh_vertex_base_2<Traits, Vb>}
 \cgalHasModelsEnd
 
 
diff --git a/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h b/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h
index 06f5f865e331..c4dc873cc514 100644
--- a/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h
+++ b/Mesh_2/doc/Mesh_2/Concepts/MeshingCriteria_2.h
@@ -38,8 +38,8 @@ to split those with smallest quality first. The predicate `Is_bad`
 computes the quality of the triangle as a by-product.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Delaunay_mesh_criteria_2<CDT>}
-\cgalModels{CGAL::Delaunay_mesh_size_criteria_2<CDT>}
+\cgalHasModels{CGAL::Delaunay_mesh_criteria_2<CDT>}
+\cgalHasModels{CGAL::Delaunay_mesh_size_criteria_2<CDT>}
 \cgalHasModelsEnd
 
 
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
index 44f0e8181230..fe6dee8ad14c 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellBase_3.h
@@ -44,8 +44,8 @@ each cell (see below).
 \cgalRefines{SimplicialMeshCellBase_3,RegularTriangulationCellBaseWithWeightedCircumcenter_3,CopyConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Compact_mesh_cell_base_3<Gt,MD,Tds>}
-\cgalModels{CGAL::Mesh_cell_base_3<Gt,MD,Cb>}
+\cgalHasModels{CGAL::Compact_mesh_cell_base_3<Gt,MD,Tds>}
+\cgalHasModels{CGAL::Mesh_cell_base_3<Gt,MD,Cb>}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_mesh_3()`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
index bc8a60b51d32..b278477fb78d 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCellCriteria_3.h
@@ -10,7 +10,7 @@ The concept `MeshCellCriteria_3` describes the types that
 handle the refinement criteria for mesh tetrahedra.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_cell_criteria_3<Tr>}
+\cgalHasModels{CGAL::Mesh_cell_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `MeshEdgeCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h
index dcb2123ec62d..895fa9e8c0f1 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteriaWithFeatures_3.h
@@ -15,7 +15,7 @@ that describes the requirements, in terms of sizing, for the discretization of t
 \cgalRefines{MeshCriteria_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_criteria_3<Tr>}
+\cgalHasModels{CGAL::Mesh_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `MeshEdgeCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
index 83fad908d256..43587310ddd9 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshCriteria_3.h
@@ -13,7 +13,7 @@ are described by the concept `MeshFacetCriteria_3`.
 The concept `MeshCriteria_3` encapsulates these concepts.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_criteria_3<Tr>}
+\cgalHasModels{CGAL::Mesh_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `MeshFacetCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
index d3f7d1e61ea2..c264f53332c9 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainField_3.h
@@ -6,7 +6,7 @@ The concept `MeshDomainField_3` describes a scalar field which could be queried
 at any point of the space.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_constant_domain_field_3<Gt,%Index>}
+\cgalHasModels{CGAL::Mesh_constant_domain_field_3<Gt,%Index>}
 \cgalHasModelsEnd
 
 \sa `MeshDomain_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
index 3a3a79f11053..2dc7f6acd987 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomainWithFeatures_3.h
@@ -18,8 +18,8 @@ between two ordered points on the same curve.
 \cgalRefines{MeshDomain_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_domain_with_polyline_features_3<MeshDomain_3>}
-\cgalModels{CGAL::Polyhedral_mesh_domain_with_features_3<IGT>}
+\cgalHasModels{CGAL::Mesh_domain_with_polyline_features_3<MeshDomain_3>}
+\cgalHasModels{CGAL::Polyhedral_mesh_domain_with_features_3<IGT>}
 \cgalHasModelsEnd
 
 \sa `MeshDomain_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
index 03ca9f2fef7e..401e5f8efc18 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshDomain_3.h
@@ -30,8 +30,8 @@ if it includes points which are strictly inside
 and strictly outside the domain (resp. the subdomain).
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>}
-\cgalModels{CGAL::Labeled_mesh_domain_3<BGT>}
+\cgalHasModels{CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>}
+\cgalHasModels{CGAL::Labeled_mesh_domain_3<BGT>}
 \cgalHasModelsEnd
 
 \sa `MeshVertexBase_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
index 930a627cc761..367fda230081 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshEdgeCriteria_3.h
@@ -8,7 +8,7 @@ It provides an upper bound for the distance between two protecting ball centers
 that are consecutive on a 1-feature.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_edge_criteria_3<Tr>}
+\cgalHasModels{CGAL::Mesh_edge_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `MeshCellCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
index a0c32629c5ad..e85904562764 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshFacetCriteria_3.h
@@ -10,7 +10,7 @@ The concept `MeshFacetCriteria_3` describes the types that
 handle the refinement criteria for surface facets.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_facet_criteria_3<Tr>}
+\cgalHasModels{CGAL::Mesh_facet_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `MeshCellCriteria_3`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
index 20a62546c2ce..be66168fa4ce 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/MeshVertexBase_3.h
@@ -23,7 +23,7 @@ each cell (see below).
 \cgalRefines{SimplicialMeshVertexBase_3,RegularTriangulationVertexBase_3,SurfaceMeshVertexBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_vertex_base_3<Gt,MD,Vb>}
+\cgalHasModels{CGAL::Mesh_vertex_base_3<Gt,MD,Vb>}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_mesh_3()`
diff --git a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
index 7be6df1aece7..b009b35f6d4b 100644
--- a/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
+++ b/Mesh_3/doc/Mesh_3/Concepts/TriangleAccessor_3.h
@@ -6,7 +6,7 @@ The concept `TriangleAccessor_3` represents an accessor to a triangulated polyhe
 surface, intersection free and without boundaries.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangle_accessor_3<Polyhedron_3<K>,K>}
+\cgalHasModels{CGAL::Triangle_accessor_3<Polyhedron_3<K>,K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h
index 848c46adfda9..547dde07838e 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonConvexDecomposition_2.h
@@ -7,11 +7,11 @@ decomposing an input polygon \f$ P\f$ into a set of convex sub-polygons
 \f$ P_1, \ldots, P_k\f$, such that \f$ \cup_{i=1}^{k}{P_k} = P\f$.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Small_side_angle_bisector_decomposition_2<Kernel,Container>}
-\cgalModels{CGAL::Optimal_convex_decomposition_2<Kernel,Container>}
-\cgalModels{CGAL::Hertel_Mehlhorn_convex_decomposition_2<Kernel,Container>}
-\cgalModels{CGAL::Greene_convex_decomposition_2<Kernel,Container>}
-\cgalModels{CGAL::Polygon_nop_decomposition_2<Kernel,Container>}
+\cgalHasModels{CGAL::Small_side_angle_bisector_decomposition_2<Kernel,Container>}
+\cgalHasModels{CGAL::Optimal_convex_decomposition_2<Kernel,Container>}
+\cgalHasModels{CGAL::Hertel_Mehlhorn_convex_decomposition_2<Kernel,Container>}
+\cgalHasModels{CGAL::Greene_convex_decomposition_2<Kernel,Container>}
+\cgalHasModels{CGAL::Polygon_nop_decomposition_2<Kernel,Container>}
 \cgalHasModelsEnd
 
 */
diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h
index 6cf7eb45c35e..5a1fac77173a 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/Concepts/PolygonWithHolesConvexDecomposition_2.h
@@ -10,8 +10,8 @@ convex sub-polygons \f$ P_1, \ldots, P_k\f$, such that
 \cgalRefines{PolygonConvexDecomposition_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polygon_vertical_decomposition_2<Kernel,Container>}
-\cgalModels{CGAL::Polygon_triangulation_decomposition_2<Kernel,Container>}
+\cgalHasModels{CGAL::Polygon_vertical_decomposition_2<Kernel,Container>}
+\cgalHasModels{CGAL::Polygon_triangulation_decomposition_2<Kernel,Container>}
 \cgalHasModelsEnd
 
 */
diff --git a/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h b/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h
index b3f2543843ff..8509b42a07f8 100644
--- a/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h
+++ b/Miscellany/doc/Miscellany/Concepts/UniqueHashFunction.h
@@ -10,7 +10,7 @@ the integral image type `std::size_t`. The image values have to
 be unique for all keys in the domain type `Key`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Handle_hash_function}
+\cgalHasModels{CGAL::Handle_hash_function}
 \cgalHasModelsEnd
 
 \sa `CGAL::Unique_hash_map<Key,Data,UniqueHashFunction>`
diff --git a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h
index a78fde1730a1..53e9c0badd0e 100644
--- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h
+++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/ModularTraits.h
@@ -9,7 +9,7 @@ Boolean tag `ModularTraits::Is_modularizable`. The mapping into the `Residue_typ
 provided by the functor `ModularTraits::Modular_image`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Modular_traits<T>}
+\cgalHasModels{CGAL::Modular_traits<T>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Residue`
diff --git a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h
index 1d7f832f5d88..6bc74bc00848 100644
--- a/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h
+++ b/Modular_arithmetic/doc/Modular_arithmetic/Concepts/Modularizable.h
@@ -19,20 +19,20 @@ This is due to the fact that the denominator may be zero modulo the prime,
 which can not be represented.
 
 \cgalHasModelsBegin
-\cgalModels{int}
-\cgalModels{long}
-\cgalModels{CORE::BigInt}
-\cgalModels{CGAL::Gmpz}
-\cgalModels{leda_integer}
-\cgalModels{mpz_class}
+\cgalHasModels{int}
+\cgalHasModels{long}
+\cgalHasModels{CORE::BigInt}
+\cgalHasModels{CGAL::Gmpz}
+\cgalHasModels{leda_integer}
+\cgalHasModels{mpz_class}
 \cgalHasModelsEnd
 
 The following types are `Modularizable` iff their template arguments are.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Lazy_exact_nt<NT>}
-\cgalModels{CGAL::Sqrt_extension<NT,ROOT>}
-\cgalModels{CGAL::Polynomial<Coeff>}
+\cgalHasModels{CGAL::Lazy_exact_nt<NT>}
+\cgalHasModels{CGAL::Sqrt_extension<NT,ROOT>}
+\cgalHasModels{CGAL::Polynomial<Coeff>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Residue`
diff --git a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
index c46d39daa542..b6e6da248206 100644
--- a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
+++ b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
@@ -39,9 +39,9 @@ geometry. At the same time it provides extensible geometric primitives
 on the extended geometric objects.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Extended_cartesian<FT>}
-\cgalModels{CGAL::Extended_homogeneous<RT>}
-\cgalModels{CGAL::Filtered_extended_homogeneous<RT>}
+\cgalHasModels{CGAL::Extended_cartesian<FT>}
+\cgalHasModels{CGAL::Extended_homogeneous<RT>}
+\cgalHasModels{CGAL::Filtered_extended_homogeneous<RT>}
 \cgalHasModelsEnd
 
 */
diff --git a/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h b/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h
index 40fdf24e2d8f..80f3c1e28dc4 100644
--- a/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h
+++ b/Optimal_bounding_box/doc/Optimal_bounding_box/Concepts/OrientedBoundingBoxTraits.h
@@ -9,7 +9,7 @@ a 3x3 matrix type.
 \cgalRefines{Kernel}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Oriented_bounding_box_traits_3}
+\cgalHasModels{CGAL::Oriented_bounding_box_traits_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h
index 83408944f2b5..fdb0781ba260 100644
--- a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h
+++ b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraits.h
@@ -6,9 +6,9 @@
   template parameter of the `CGAL::Orthtree` class.
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Orthtree_traits_2<GeomTraits>}
-  \cgalModels{CGAL::Orthtree_traits_3<GeomTraits>}
-  \cgalModels{CGAL::Orthtree_traits_d<GeomTraits,Dimension>}
+  \cgalHasModels{CGAL::Orthtree_traits_2<GeomTraits>}
+  \cgalHasModels{CGAL::Orthtree_traits_3<GeomTraits>}
+  \cgalHasModels{CGAL::Orthtree_traits_d<GeomTraits,Dimension>}
   \cgalHasModelsEnd
 */
 class OrthtreeTraits
diff --git a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
index 851482d8751a..5aeda690079e 100644
--- a/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
+++ b/Orthtree/doc/Orthtree/Concepts/OrthtreeTraversal.h
@@ -10,10 +10,10 @@
   (e.g. preorder, postorder).
 
   \cgalHasModelsBegin
-  \cgalModels{CGAL::Orthtrees::Preorder_traversal}
-  \cgalModels{CGAL::Orthtrees::Postorder_traversal}
-  \cgalModels{CGAL::Orthtrees::Leaves_traversal}
-  \cgalModels{CGAL::Orthtrees::Level_traversal}
+  \cgalHasModels{CGAL::Orthtrees::Preorder_traversal}
+  \cgalHasModels{CGAL::Orthtrees::Postorder_traversal}
+  \cgalHasModels{CGAL::Orthtrees::Leaves_traversal}
+  \cgalHasModels{CGAL::Orthtrees::Level_traversal}
   \cgalHasModelsEnd
  */
 class OrthtreeTraversal {
diff --git a/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h
index 6b9be975123b..ad0d171d07ac 100644
--- a/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/ConvexPartitionIsValidTraits_2.h
@@ -7,7 +7,7 @@ by `convex_partition_is_valid_2` for testing the validity of a
 convex partition of a polygon.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Partition_traits_2<R>}
+\cgalHasModels{CGAL::Partition_traits_2<R>}
 \cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h b/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h
index 112995c86f11..12b863da2ad7 100644
--- a/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/IsYMonotoneTraits_2.h
@@ -7,8 +7,8 @@ used with the function `is_y_monotone_2()` that tests whether a sequence of
 2D points defines a \f$ y\f$-monotone polygon or not.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Partition_traits_2<R>}
-\cgalModels{CGAL::Kernel_traits_2}
+\cgalHasModels{CGAL::Partition_traits_2<R>}
+\cgalHasModels{CGAL::Kernel_traits_2}
 \cgalHasModelsEnd
 
 \sa `CGAL::Is_y_monotone_2<Traits>`
diff --git a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h
index 1ef70344a2d6..c1f7de776c60 100644
--- a/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/OptimalConvexPartitionTraits_2.h
@@ -9,7 +9,7 @@ an optimal convex partition of a polygon.
 \cgalRefines{PartitionTraits_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Partition_traits_2<R>}
+\cgalHasModels{CGAL::Partition_traits_2<R>}
 \cgalHasModelsEnd
 
 \sa `CGAL::convex_partition_is_valid_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h
index 7edbe6dcde6d..537588e4ecf8 100644
--- a/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/PartitionIsValidTraits_2.h
@@ -15,7 +15,7 @@ and the concept `YMonotonePartitionTraits_2` for the additional requirements
 for testing for convexity and \f$ y\f$-monotonicity, respectively.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>}
+\cgalHasModels{CGAL::Partition_is_valid_traits_2<Traits, PolygonIsValid>}
 \cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h b/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h
index 910d565cf10a..955d8da45471 100644
--- a/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/PartitionTraits_2.h
@@ -9,7 +9,7 @@ to all traits classes. The concept `PartitionTraits_2` defines this common set o
 requirements.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Partition_traits_2<R>}
+\cgalHasModels{CGAL::Partition_traits_2<R>}
 \cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h b/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h
index 662bdb369a91..be190734ab0c 100644
--- a/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h
+++ b/Partition_2/doc/Partition_2/Concepts/PolygonIsValid.h
@@ -7,8 +7,8 @@ valid partition polygon or not, where "valid" can assume any of several
 meanings (e.g., convex or \f$ y\f$-monotone).
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Is_convex_2<Traits>}
-\cgalModels{CGAL::Is_y_monotone_2<Traits>}
+\cgalHasModels{CGAL::Is_convex_2<Traits>}
+\cgalHasModels{CGAL::Is_y_monotone_2<Traits>}
 \cgalHasModelsEnd
 
 \sa `CGAL::approx_convex_partition_2()`
diff --git a/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h b/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h
index 7869a2122e90..aaf6d9eea5a2 100644
--- a/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h
+++ b/Partition_2/doc/Partition_2/Concepts/YMonotonePartitionIsValidTraits_2.h
@@ -7,7 +7,7 @@ by `y_monotone_partition_is_valid_2` for testing the validity of a
 \f$ y\f$-monotone partition of a polygon.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Partition_traits_2<R>}
+\cgalHasModels{CGAL::Partition_traits_2<R>}
 \cgalHasModelsEnd
 
 \sa `CGAL::partition_is_valid_2()`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h
index 0ae4f0fedcf7..f9a8d6be4d92 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2DelaunayTriangulationTraits_2.h
@@ -28,7 +28,7 @@ dual functions are called. The additional predicate type
 `nearest_vertex(..)` are issued.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_2_Delaunay_triangulation_traits_2<Traits, Offset>}
+\cgalHasModels{CGAL::Periodic_2_Delaunay_triangulation_traits_2<Traits, Offset>}
 \cgalHasModelsEnd
 
 \sa `DelaunayTriangulationTraits_2`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h
index 172f176c7cfc..3ff8cfc2b53a 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2Offset_2.h
@@ -8,7 +8,7 @@
 The concept `Periodic_2Offset_2` describes a two-/dimensional integer vector with some specialized access functions and operations.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_2_offset_2}
+\cgalHasModels{CGAL::Periodic_2_offset_2}
 \cgalHasModelsEnd
 
 \sa `Periodic_2TriangulationTraits_2`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h
index da6b89b93a27..41eb5dded8e6 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationFaceBase_2.h
@@ -14,7 +14,7 @@ vertex \f$ i\f$.
 \cgalRefines{TriangulationFaceBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_2_triangulation_face_base_2}
+\cgalHasModels{CGAL::Periodic_2_triangulation_face_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h
index 1d93a35edbef..658d1a104da1 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationTraits_2.h
@@ -25,7 +25,7 @@ Periodic triangulation must fulfill the following
 requirements:
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_2_triangulation_traits_2}
+\cgalHasModels{CGAL::Periodic_2_triangulation_traits_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationTraits_2`
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h
index eeae18dcd70e..f9d6f4cc5a62 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/Concepts/Periodic_2TriangulationVertexBase_2.h
@@ -17,7 +17,7 @@ The storage of the offset is only needed when a triangulation is copied.
 \cgalRefines{TriangulationVertexBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_2_triangulation_vertex_base_2}
+\cgalHasModels{CGAL::Periodic_2_triangulation_vertex_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h
index 73f7d1339a52..27c90fd712bc 100644
--- a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h
+++ b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomainWithFeatures_3.h
@@ -23,7 +23,7 @@ Wrapping any model of `Periodic_3MeshDomain_3` with the class
 of `Periodic_3MeshDomainWithFeatures_3`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_domain_with_polyline_features_3<CGAL::Labeled_mesh_domain_3<BGT> >}
+\cgalHasModels{CGAL::Mesh_domain_with_polyline_features_3<CGAL::Labeled_mesh_domain_3<BGT> >}
 \cgalHasModelsEnd
 
 \sa `CGAL::Periodic_3_function_wrapper<Function,BGT>`
diff --git a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h
index b92341527b91..2d4ef680a92f 100644
--- a/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h
+++ b/Periodic_3_mesh_3/doc/Periodic_3_mesh_3/Concepts/Periodic_3MeshDomain_3.h
@@ -21,7 +21,7 @@ is a model of this concept. It is possible to create artificially periodic funct
 through the class `CGAL::Periodic_3_function_wrapper<Function,BGT>`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Labeled_mesh_domain_3<BGT>}
+\cgalHasModels{CGAL::Labeled_mesh_domain_3<BGT>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Labeled_mesh_domain_3<BG>`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h
index 571b9a0fa981..10eab7ef1c8c 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3DelaunayTriangulationTraits_3.h
@@ -16,7 +16,7 @@ functor the version without offsets.
 \cgalRefines{Periodic_3TriangulationTraits_3,DelaunayTriangulationTraits_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_3_Delaunay_triangulation_traits_3}
+\cgalHasModels{CGAL::Periodic_3_Delaunay_triangulation_traits_3}
 \cgalHasModelsEnd
 
 In addition to the requirements described by the concepts
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h
index 2cb71cf9bcc4..6de19e6a0d23 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3Offset_3.h
@@ -7,7 +7,7 @@ The concept `Periodic_3Offset_3` describes a three-dimensional integer vector
 with some specialized access functions and operations.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_3_offset_3}
+\cgalHasModels{CGAL::Periodic_3_offset_3}
 \cgalHasModelsEnd
 
 \sa `Periodic_3TriangulationTraits_3`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h
index 05b10c71e021..1f2c12dbba3d 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSCellBase_3.h
@@ -6,8 +6,8 @@
 \cgalRefines{RegularTriangulationCellBase_3,Periodic_3TriangulationDSCellBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Regular_triangulation_cell_base_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_cell_base_3< > >}
-\cgalModels{CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_cell_base_3< > >}
+\cgalHasModels{CGAL::Regular_triangulation_cell_base_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_cell_base_3< > >}
+\cgalHasModels{CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_cell_base_3< > >}
 \cgalHasModelsEnd
 
 The template parameter `Periodic_3RegularTriangulationTraits_3` is expected to be the same as the
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h
index be6214920cb8..a0ecbaa24e4f 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationDSVertexBase_3.h
@@ -6,7 +6,7 @@
 \cgalRefines{RegularTriangulationVertexBase_3,Periodic_3TriangulationDSVertexBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Regular_triangulation_vertex_base_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_vertex_base_3< > >}
+\cgalHasModels{CGAL::Regular_triangulation_vertex_base_3<Periodic_3RegularTriangulationTraits_3, Periodic_3_triangulation_ds_vertex_base_3< > >}
 \cgalHasModelsEnd
 
 The template parameter `Periodic_3RegularTriangulationTraits_3` is expected to be the same as the
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h
index cdc5a72ead57..b190e091be4a 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3RegularTriangulationTraits_3.h
@@ -16,7 +16,7 @@ functor the version without offsets.
 \cgalRefines{Periodic_3TriangulationTraits_3,RegularTriangulationTraits_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_3_regular_triangulation_traits_3}
+\cgalHasModels{CGAL::Periodic_3_regular_triangulation_traits_3}
 \cgalHasModelsEnd
 
 In addition to the requirements described for the traits class
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h
index d6e735e497fd..5ce61b440a8a 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSCellBase_3.h
@@ -19,7 +19,7 @@ does not contain any information.
 \cgalRefines{TriangulationDSCellBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_3_triangulation_ds_cell_base_3}
+\cgalHasModels{CGAL::Periodic_3_triangulation_ds_cell_base_3}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_3`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h
index 2665d89bdefa..fe9e98720263 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationDSVertexBase_3.h
@@ -13,7 +13,7 @@ a vertex provides access to one of its incident cells through a handle.
 \cgalRefines{TriangulationDSVertexBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_3_triangulation_ds_vertex_base_3}
+\cgalHasModels{CGAL::Periodic_3_triangulation_ds_vertex_base_3}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_3`
diff --git a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h
index 67b8f33a78a5..b25e098a01c0 100644
--- a/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h
+++ b/Periodic_3_triangulation_3/doc/Periodic_3_triangulation_3/Concepts/Periodic_3TriangulationTraits_3.h
@@ -15,7 +15,7 @@ functor the version without offsets.
 \cgalRefines{TriangulationTraits_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_3_triangulation_traits_3}
+\cgalHasModels{CGAL::Periodic_3_triangulation_traits_3}
 \cgalHasModelsEnd
 
 \sa `Periodic_3DelaunayTriangulationTraits_3`
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h
index 77501fa9399d..17efb2f35057 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicDelaunayTriangulationTraits_2.h
@@ -13,7 +13,7 @@ by any class used to instantiate the first template parameter of the class
 `CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_2`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_traits_2}
+\cgalHasModels{CGAL::Periodic_4_hyperbolic_Delaunay_triangulation_traits_2}
 \cgalHasModelsEnd
 */
 
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h
index 92d62dfeeb2e..2ebf4a74bbd4 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationFaceBase_2.h
@@ -21,7 +21,7 @@ Hyperbolic translations are represented by a nested type which is provided by th
 `Periodic_4HyperbolicDelaunayTriangulationTraits_2`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_4_hyperbolic_triangulation_face_base_2}
+\cgalHasModels{CGAL::Periodic_4_hyperbolic_triangulation_face_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h
index 40b3cb0d34bc..5b3c5f915eb5 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/Concepts/Periodic_4HyperbolicTriangulationVertexBase_2.h
@@ -15,7 +15,7 @@ A boolean flag indicates whether the face stores a translation or not. The value
 set when storing or removing a translation.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Periodic_4_hyperbolic_triangulation_vertex_base_2}
+\cgalHasModels{CGAL::Periodic_4_hyperbolic_triangulation_vertex_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h
index 6f58a4de0e89..c27e8b4a7067 100644
--- a/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h
+++ b/Polygon/doc/Polygon/Concepts/GeneralPolygonWithHoles_2.h
@@ -9,8 +9,8 @@
  * the holes.
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::General_polygon_with_holes_2<Polygon>}
- * \cgalModels{CGAL::Polygon_with_holes_2<Kernel,Container>}
+ * \cgalHasModels{CGAL::General_polygon_with_holes_2<Polygon>}
+ * \cgalHasModels{CGAL::Polygon_with_holes_2<Kernel,Container>}
  * \cgalHasModelsEnd
  */
 
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
index 683f7f581368..03d52b5a8814 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPCorefinementVisitor.h
@@ -7,7 +7,7 @@
 ///
 /// \cgalRefines{CopyConstructible}
 /// \cgalHasModelsBegin
-/// \cgalModels{CGAL::Polygon_mesh_processing::Corefinement::Default_visitor}
+/// \cgalHasModels{CGAL::Polygon_mesh_processing::Corefinement::Default_visitor}
 /// \cgalHasModelsEnd
 
 class PMPCorefinementVisitor{
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h
index e524ca75ffe9..67b8b0294037 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPHolefillingVisitor.h
@@ -10,7 +10,7 @@
 ///
 /// \cgalRefines{CopyConstructible}
 /// \cgalHasModelsBegin
-/// \cgalModels{CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor}
+/// \cgalHasModels{CGAL::Polygon_mesh_processing::Hole_filling::Default_visitor}
 /// \cgalHasModelsEnd
 
 class PMPHolefillingVisitor{
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h
index 0016e1cb8655..0308f62f5166 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPPolygonSoupOrientationVisitor.h
@@ -8,7 +8,7 @@
 ///
 /// \cgalRefines{CopyConstructible}
 /// \cgalHasModelsBegin
-/// \cgalModels{CGAL::Polygon_mesh_processing::Default_orientation_visitor}
+/// \cgalHasModels{CGAL::Polygon_mesh_processing::Default_orientation_visitor}
 /// \cgalHasModelsEnd
 
 class PMPPolygonSoupOrientationVisitor{
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h
index 3bc52ba8786e..d091f15fa64b 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPTriangulateFaceVisitor.h
@@ -7,7 +7,7 @@
 ///
 /// \cgalRefines{CopyConstructible}
 /// \cgalHasModelsBegin
-/// \cgalModels{CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor}
+/// \cgalHasModels{CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor}
 /// \cgalHasModelsEnd
 
 
diff --git a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h
index d75b5d0b491e..f6b86ba2c1c4 100644
--- a/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h
+++ b/Polyhedron/doc/Polyhedron/Concepts/PolyhedronItems_3.h
@@ -14,9 +14,9 @@ polyhedral surface renames faces to facets.
 \cgalRefines{HalfedgeDSItems}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polyhedron_items_3}
-\cgalModels{CGAL::Polyhedron_min_items_3}
-\cgalModels{CGAL::Polyhedron_items_with_id_3}
+\cgalHasModels{CGAL::Polyhedron_items_3}
+\cgalHasModels{CGAL::Polyhedron_min_items_3}
+\cgalHasModels{CGAL::Polyhedron_items_with_id_3}
 \cgalHasModelsEnd
 
 \sa `CGAL::Polyhedron_3<Traits>`
diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
index bf8fb4b60ab6..94f5ed07797a 100644
--- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
+++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
@@ -13,9 +13,9 @@ preserve the overall polyline set shape as much as possible
 \cgalRefines{CopyConstructible,Assignable}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost}
-\cgalModels{CGAL::Polyline_simplification_2::Scaled_squared_distance_cost}
-\cgalModels{CGAL::Polyline_simplification_2::Squared_distance_cost}
+\cgalHasModels{CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost}
+\cgalHasModels{CGAL::Polyline_simplification_2::Scaled_squared_distance_cost}
+\cgalHasModels{CGAL::Polyline_simplification_2::Squared_distance_cost}
 \cgalHasModelsEnd
 
 */
diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h
index 5d95499fd69c..0c2ae58a59f5 100644
--- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h
+++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationStopPredicate.h
@@ -6,9 +6,9 @@ Models of this concept are passed to the polyline simplification algorithm to in
 when to stop the process.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polyline_simplification_2::Stop_below_count_ratio_threshold}
-\cgalModels{CGAL::Polyline_simplification_2::Stop_below_count_threshold}
-\cgalModels{CGAL::Polyline_simplification_2::Stop_above_cost_threshold}
+\cgalHasModels{CGAL::Polyline_simplification_2::Stop_below_count_ratio_threshold}
+\cgalHasModels{CGAL::Polyline_simplification_2::Stop_below_count_threshold}
+\cgalHasModels{CGAL::Polyline_simplification_2::Stop_above_cost_threshold}
 \cgalHasModelsEnd
 */
 
diff --git a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h
index e4d8d079a59d..19838b07ac72 100644
--- a/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h
+++ b/Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationVertexBase_2.h
@@ -9,7 +9,7 @@ whether a vertex can be removed, and the cost of the removal.
 \cgalRefines{TriangulationVertexBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polyline_simplification_2::Vertex_base_2<Vb>}
+\cgalHasModels{CGAL::Polyline_simplification_2::Vertex_base_2<Vb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationFaceBase_2`
diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h
index c1c13ad96405..d7d961ac56d9 100644
--- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h
+++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d.h
@@ -32,7 +32,7 @@ is possible to select a certain variable.
 \sa `Polynomial_d`
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polynomial_traits_d<Polynomial_d>}
+\cgalHasModels{CGAL::Polynomial_traits_d<Polynomial_d>}
 \cgalHasModelsEnd
 
 */
diff --git a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
index 2b41053230e8..e58552f582f2 100644
--- a/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
+++ b/Polynomial/doc/Polynomial/Concepts/Polynomial_d.h
@@ -33,7 +33,7 @@ coefficient is a `Field` the polynomial is model of `EuclideanRing`.
 \sa `PolynomialTraits_d`
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polynomial<Coeff>}
+\cgalHasModels{CGAL::Polynomial<Coeff>}
 \cgalHasModelsEnd
 
 */
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h
index a0b89952bc07..874782161e7a 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/AllFurthestNeighborsTraits_2.h
@@ -8,10 +8,10 @@ needed to compute all furthest neighbors for the vertices of a
 convex polygon using the function `all_furthest_neighbors_2()`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Cartesian<FieldNumberType>}
-\cgalModels{CGAL::Homogeneous<RingNumberType>}
-\cgalModels{CGAL::Simple_cartesian<FieldNumberType>}
-\cgalModels{CGAL::Simple_homogeneous<RingNumberType>}
+\cgalHasModels{CGAL::Cartesian<FieldNumberType>}
+\cgalHasModels{CGAL::Homogeneous<RingNumberType>}
+\cgalHasModels{CGAL::Simple_cartesian<FieldNumberType>}
+\cgalHasModels{CGAL::Simple_homogeneous<RingNumberType>}
 \cgalHasModelsEnd
 
 \sa `CGAL::all_furthest_neighbors_2()`
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h
index 1198e0d98698..32004e174ba1 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/PolytopeDistanceDTraits.h
@@ -7,9 +7,9 @@ This concept defines the requirements for traits classes of \f$ d\f$-dimensional
 optimisation algorithms.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polytope_distance_d_traits_2<K,ET,NT>}
-\cgalModels{CGAL::Polytope_distance_d_traits_3<K,ET,NT>}
-\cgalModels{CGAL::Polytope_distance_d_traits_d<K,ET,NT>}
+\cgalHasModels{CGAL::Polytope_distance_d_traits_2<K,ET,NT>}
+\cgalHasModels{CGAL::Polytope_distance_d_traits_3<K,ET,NT>}
+\cgalHasModels{CGAL::Polytope_distance_d_traits_d<K,ET,NT>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Polytope_distance_d<Traits>`
diff --git a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h
index 7295ea2e2969..5686aec87e15 100644
--- a/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h
+++ b/Polytope_distance_d/doc/Polytope_distance_d/Concepts/WidthTraits_3.h
@@ -13,7 +13,7 @@ width-algorithm to have access to the homogeneous representation of
 points.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Width_default_traits_3}
+\cgalHasModels{CGAL::Width_default_traits_3}
 \cgalHasModelsEnd
 
 \sa `CGAL::Width_3<Traits>`
diff --git a/QP_solver/doc/QP_solver/Concepts/LinearProgram.h b/QP_solver/doc/QP_solver/Concepts/LinearProgram.h
index 206dbdb1a578..ce598886ee90 100644
--- a/QP_solver/doc/QP_solver/Concepts/LinearProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/LinearProgram.h
@@ -36,9 +36,9 @@ iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Quadratic_program<NT>}
-\cgalModels{CGAL::Quadratic_program_from_mps<NT>}
-\cgalModels{CGAL::Linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
+\cgalHasModels{CGAL::Quadratic_program<NT>}
+\cgalHasModels{CGAL::Quadratic_program_from_mps<NT>}
+\cgalHasModels{CGAL::Linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
 \cgalHasModelsEnd
 
 
diff --git a/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h b/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h
index e9bbee8dadde..b9304ca07371 100644
--- a/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/NonnegativeLinearProgram.h
@@ -30,9 +30,9 @@ iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Quadratic_program<NT>}
-\cgalModels{CGAL::Quadratic_program_from_mps<NT>}
-\cgalModels{CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
+\cgalHasModels{CGAL::Quadratic_program<NT>}
+\cgalHasModels{CGAL::Quadratic_program_from_mps<NT>}
+\cgalHasModels{CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
 \cgalHasModelsEnd
 
 The value types of all iterator types (nested iterator
@@ -40,9 +40,9 @@ types, respectively, for `A_iterator`) must be convertible to some
 common `IntegralDomain` `ET`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Quadratic_program<NT>}
-\cgalModels{CGAL::Quadratic_program_from_mps<NT>}
-\cgalModels{CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, C_it>}
+\cgalHasModels{CGAL::Quadratic_program<NT>}
+\cgalHasModels{CGAL::Quadratic_program_from_mps<NT>}
+\cgalHasModels{CGAL::Nonnegative_linear_program_from_iterators<A_it, B_it, R_it, C_it>}
 \cgalHasModelsEnd
 
 \sa `QuadraticProgram`
diff --git a/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h b/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h
index 508ac094f4ab..07709e9da11f 100644
--- a/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/NonnegativeQuadraticProgram.h
@@ -34,9 +34,9 @@ iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Quadratic_program<NT>}
-\cgalModels{CGAL::Quadratic_program_from_mps<NT>}
-\cgalModels{CGAL::Nonnegative_quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
+\cgalHasModels{CGAL::Quadratic_program<NT>}
+\cgalHasModels{CGAL::Quadratic_program_from_mps<NT>}
+\cgalHasModels{CGAL::Nonnegative_quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
 \cgalHasModelsEnd
 
 The value types of all iterator types (nested iterator
diff --git a/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h b/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h
index 3b3ebe86f274..f5948e20519d 100644
--- a/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h
+++ b/QP_solver/doc/QP_solver/Concepts/QuadraticProgram.h
@@ -35,9 +35,9 @@ iterators over the program data, see below. The program therefore
 comes in <I>dense</I> representation which includes zero entries.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Quadratic_program<NT>}
-\cgalModels{CGAL::Quadratic_program_from_mps<NT>}
-\cgalModels{CGAL::Quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
+\cgalHasModels{CGAL::Quadratic_program<NT>}
+\cgalHasModels{CGAL::Quadratic_program_from_mps<NT>}
+\cgalHasModels{CGAL::Quadratic_program_from_iterators<A_it, B_it, R_it, FL_it, L_it, FU_it, U_it, D_it, C_it>}
 \cgalHasModelsEnd
 
 The value types of all iterator types (nested iterator
diff --git a/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h b/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h
index e29abc65d3b3..f436119cf12c 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/MeshComplexWithFeatures_3InTriangulation_3.h
@@ -49,7 +49,7 @@ of the input complex.
 \cgalRefines{MeshComplex_3InTriangulation_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>}
+\cgalHasModels{CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>}
 \cgalHasModelsEnd
 
 \sa `MeshComplex_3InTriangulation_3`
diff --git a/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h b/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h
index 2bd6bf5d8e85..35a40e898e3d 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/MeshComplex_3InTriangulation_3.h
@@ -43,7 +43,7 @@ and each boundary surface patch.
 The data structure encodes the final mesh at the end of the meshing process.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>}
+\cgalHasModels{CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>}
 \cgalHasModelsEnd
 
 \sa `MeshDomain_3`
diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
index 37c1aa8a1dfa..12332226a754 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
@@ -19,10 +19,10 @@ of the triangulation that are surface facets.
 \cgalRefines{TriangulationCellBase_3,CopyConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Compact_mesh_cell_base_3}
-\cgalModels{CGAL::Mesh_cell_base_3}
-\cgalModels{CGAL::Simplicial_mesh_cell_base_3}
-\cgalModels{CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3}
+\cgalHasModels{CGAL::Compact_mesh_cell_base_3}
+\cgalHasModels{CGAL::Mesh_cell_base_3}
+\cgalHasModels{CGAL::Simplicial_mesh_cell_base_3}
+\cgalHasModels{CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3}
 \cgalHasModelsEnd
 
 */
diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
index accc2c9b77a8..24878f48bd4a 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
@@ -17,9 +17,9 @@ and to an index characteristic of this face.
 \cgalRefines{TriangulationVertexBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mesh_vertex_base_3}
-\cgalModels{CGAL::Simplicial_mesh_vertex_base_3}
-\cgalModels{CGAL::Tetrahedral_remeshing::Remeshing_vertex_base_3}
+\cgalHasModels{CGAL::Mesh_vertex_base_3}
+\cgalHasModels{CGAL::Simplicial_mesh_vertex_base_3}
+\cgalHasModels{CGAL::Tetrahedral_remeshing::Remeshing_vertex_base_3}
 \cgalHasModelsEnd
 
 */
diff --git a/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h b/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h
index 900c6874eb39..7b6306927089 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/Descriptor.h
@@ -7,8 +7,8 @@ The concept `Descriptor` allows to describe a unique object in an abstract model
 \cgalRefines{DefaultConstructible,CopyConstructible,Assignable,EqualityComparable}
 
 \cgalHasModelsBegin
-\cgalModels{Index}
-\cgalModels{Handle}
+\cgalHasModels{Index}
+\cgalHasModels{Handle}
 \cgalHasModelsEnd
 */
 
diff --git a/STL_Extension/doc/STL_Extension/Concepts/Index.h b/STL_Extension/doc/STL_Extension/Concepts/Index.h
index 4a3c749305d4..7b89ed870e37 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/Index.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/Index.h
@@ -7,8 +7,8 @@ The concept `Index` is a refinement of `Descriptor` which must be convertible fr
 \cgalRefines{Descriptor}
 
 \cgalHasModelsBegin
-\cgalModels{int}
-\cgalModels{size_t}
+\cgalHasModels{int}
+\cgalHasModels{size_t}
 \cgalHasModelsEnd
 
 \cgalHeading{Notation}
diff --git a/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h b/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h
index 55cd05e95da2..871f9dc3b1b8 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/ProjectionObject.h
@@ -13,19 +13,19 @@ concept `UnaryFunction`, but takes also care of (const)
 references.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Identity}
-\cgalModels{CGAL::Dereference}
-\cgalModels{CGAL::Get_address}
-\cgalModels{CGAL::Cast_function_object}
-\cgalModels{CGAL::Project_vertex}
-\cgalModels{CGAL::Project_facet}
-\cgalModels{CGAL::Project_point}
-\cgalModels{CGAL::Project_normal}
-\cgalModels{CGAL::Project_plane}
-\cgalModels{CGAL::Project_next}
-\cgalModels{CGAL::Project_prev}
-\cgalModels{CGAL::Project_next_opposite}
-\cgalModels{CGAL::Project_opposite_prev}
+\cgalHasModels{CGAL::Identity}
+\cgalHasModels{CGAL::Dereference}
+\cgalHasModels{CGAL::Get_address}
+\cgalHasModels{CGAL::Cast_function_object}
+\cgalHasModels{CGAL::Project_vertex}
+\cgalHasModels{CGAL::Project_facet}
+\cgalHasModels{CGAL::Project_point}
+\cgalHasModels{CGAL::Project_normal}
+\cgalHasModels{CGAL::Project_plane}
+\cgalHasModels{CGAL::Project_next}
+\cgalHasModels{CGAL::Project_prev}
+\cgalHasModels{CGAL::Project_next_opposite}
+\cgalHasModels{CGAL::Project_opposite_prev}
 \cgalHasModelsEnd
 
 
diff --git a/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h b/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h
index 89f447da3b52..c9780c602266 100644
--- a/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h
+++ b/STL_Extension/doc/STL_Extension/Concepts/SurjectiveLockDataStructure.h
@@ -22,7 +22,7 @@ is the \"thing\" that is locked when one tries to lock `object`.
 In the previous example, `S(point)` is the voxel containing `point`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Spatial_lock_grid_3}
+\cgalHasModels{CGAL::Spatial_lock_grid_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h
index 64979029e178..0f3004320b7b 100644
--- a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h
+++ b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceMesher.h
@@ -12,8 +12,8 @@ namespace Scale_space_reconstruction_3 {
  * points and that returns a set of facets.
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Scale_space_reconstruction_3::Alpha_shape_mesher}
- * \cgalModels{CGAL::Scale_space_reconstruction_3::Advancing_front_mesher}
+ * \cgalHasModels{CGAL::Scale_space_reconstruction_3::Alpha_shape_mesher}
+ * \cgalHasModels{CGAL::Scale_space_reconstruction_3::Advancing_front_mesher}
  * \cgalHasModelsEnd
  *
  */
diff --git a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h
index 8eaa935ce3c9..20cac9eabdfc 100644
--- a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h
+++ b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/Concepts/ScaleSpaceSmoother.h
@@ -16,8 +16,8 @@ namespace Scale_space_reconstruction_3 {
  * reconstruction algorithm.
  *
  * \cgalHasModelsBegin
- * \cgalModels{CGAL::Scale_space_reconstruction_3::Weighted_PCA_smoother}
- * \cgalModels{CGAL::Scale_space_reconstruction_3::Jet_smoother}
+ * \cgalHasModels{CGAL::Scale_space_reconstruction_3::Weighted_PCA_smoother}
+ * \cgalHasModels{CGAL::Scale_space_reconstruction_3::Jet_smoother}
  * \cgalHasModelsEnd
  */
 class Smoother
diff --git a/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h b/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h
index 75e97ae287bf..ede7918eb835 100644
--- a/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h
+++ b/SearchStructures/doc/SearchStructures/Concepts/RangeSegmentTreeTraits_k.h
@@ -10,12 +10,12 @@ are needed for window queries.
 
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Range_segment_tree_set_traits_2}
-\cgalModels{CGAL::Range_segment_tree_set_traits_3}
-\cgalModels{CGAL::Range_tree_map_traits_2}
-\cgalModels{CGAL::Range_tree_map_traits_3}
-\cgalModels{CGAL::Segment_tree_map_traits_2}
-\cgalModels{CGAL::Segment_tree_map_traits_3}
+\cgalHasModels{CGAL::Range_segment_tree_set_traits_2}
+\cgalHasModels{CGAL::Range_segment_tree_set_traits_3}
+\cgalHasModels{CGAL::Range_tree_map_traits_2}
+\cgalHasModels{CGAL::Range_tree_map_traits_3}
+\cgalHasModels{CGAL::Segment_tree_map_traits_2}
+\cgalHasModels{CGAL::Segment_tree_map_traits_3}
 \cgalHasModelsEnd
 
 \cgalHeading{Example}
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
index 15c80be49e4b..88e901da2041 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphDataStructure_2.h
@@ -34,7 +34,7 @@ We only describe the additional requirements with respect to the
 \cgalRefines{ApolloniusGraphDataStructure_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_data_structure_2<Vb,Fb>}
+\cgalHasModels{CGAL::Triangulation_data_structure_2<Vb,Fb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h
index 4ae9eec2503c..98c4ddcd1bef 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphFaceBase_2.h
@@ -10,7 +10,7 @@ requirements for the face base class of the
 \cgalRefines{TriangulationFaceBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Segment_Delaunay_graph_face_base_2<Gt>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_face_base_2<Gt>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphDataStructure_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h
index d7a281a8d811..b33a87abea86 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphHierarchyVertexBase_2.h
@@ -27,7 +27,7 @@ introduce any constructors in addition to those of the
 `SegmentDelaunayGraphVertexBase_2` concept.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2<CGAL::Segment_Delaunay_graph_vertex_base_2<St> >}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_hierarchy_vertex_base_2<CGAL::Segment_Delaunay_graph_vertex_base_2<St> >}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphDataStructure_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h
index 65002722e6d7..879c81bdcc0b 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphSite_2.h
@@ -9,7 +9,7 @@ requirements for the sites of a segment Delaunay graph.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Segment_Delaunay_graph_site_2<K>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_site_2<K>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h
index fbe6887f2eb0..e6605fbcdacf 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageSite_2.h
@@ -12,7 +12,7 @@ by storing handles to points instead of points.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Segment_Delaunay_graph_storage_site_2<Gt>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_storage_site_2<Gt>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h
index e733426405d3..27ed7f806d6e 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphStorageTraits_2.h
@@ -16,7 +16,7 @@ See section \ref Segment_Delaunay_graph_2StronglyIntersecting for more informati
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Segment_Delaunay_graph_storage_traits_2<K>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_storage_traits_2<K>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h
index 7297c1db8316..933124e25d19 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphTraits_2.h
@@ -15,10 +15,10 @@ constructions for sites and several function object
 types for the predicates.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Segment_Delaunay_graph_traits_2<K,MTag>}
-\cgalModels{CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>}
-\cgalModels{CGAL::Segment_Delaunay_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>}
-\cgalModels{CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_traits_2<K,MTag>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_traits_without_intersections_2<K,MTag>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_filtered_traits_2<CK,CM,EK,EM,FK,FM>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphSite_2`
diff --git a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h
index 32b0b36ab17d..2651f8171fff 100644
--- a/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h
+++ b/Segment_Delaunay_graph_2/doc/Segment_Delaunay_graph_2/Concepts/SegmentDelaunayGraphVertexBase_2.h
@@ -12,7 +12,7 @@ site of the segment Delaunay graph and provides access to one of its
 incident faces through a `Face_handle`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Segment_Delaunay_graph_vertex_base_2<St>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_vertex_base_2<St>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphTraits_2`
diff --git a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h
index a384691661af..62c9a4f8f5b4 100644
--- a/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h
+++ b/Segment_Delaunay_graph_Linf_2/doc/Segment_Delaunay_graph_Linf_2/Concepts/SegmentDelaunayGraphLinfTraits_2.h
@@ -37,10 +37,10 @@ with respect to the
 \cgalRefines{SegmentDelaunayGraphTraits_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Segment_Delaunay_graph_Linf_traits_2<K,MTag>}
-\cgalModels{CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2<K,MTag>}
-\cgalModels{CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2<CK,CM,EK,EM,FK,FM>}
-\cgalModels{CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_Linf_traits_2<K,MTag>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_Linf_traits_without_intersections_2<K,MTag>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_Linf_filtered_traits_2<CK,CM,EK,EM,FK,FM>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_Linf_filtered_traits_without_intersections_2<CK,CM,EK,EM,FK,FM>}
 \cgalHasModelsEnd
 
 \sa `SegmentDelaunayGraphSite_2`
diff --git a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
index 9005865d80e9..a8d30d3a47f4 100644
--- a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
+++ b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
@@ -13,7 +13,7 @@ Point and normal property maps have to be provided to extract the points
 and the normals from the input.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Shape_detection::Efficient_RANSAC_traits}
+\cgalHasModels{CGAL::Shape_detection::Efficient_RANSAC_traits}
 \cgalHasModelsEnd
 */
 class EfficientRANSACTraits{
diff --git a/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h b/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h
index 76926590b35f..f0522b061ef7 100644
--- a/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h
+++ b/Shape_detection/doc/Shape_detection/Concepts/NeighborQuery.h
@@ -6,10 +6,10 @@ A concept that describes the set of methods used by the `CGAL::Shape_detection::
 to access neighbors of an item.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Shape_detection::Point_set::K_neighbor_query}
-\cgalModels{CGAL::Shape_detection::Point_set::Sphere_neighbor_query}
-\cgalModels{CGAL::Shape_detection::Polygon_mesh::Polyline_graph}
-\cgalModels{CGAL::Shape_detection::Polygon_mesh::One_ring_neighbor_query}
+\cgalHasModels{CGAL::Shape_detection::Point_set::K_neighbor_query}
+\cgalHasModels{CGAL::Shape_detection::Point_set::Sphere_neighbor_query}
+\cgalHasModels{CGAL::Shape_detection::Polygon_mesh::Polyline_graph}
+\cgalHasModels{CGAL::Shape_detection::Polygon_mesh::One_ring_neighbor_query}
 \cgalHasModelsEnd
 */
 class NeighborQuery {
diff --git a/Shape_detection/doc/Shape_detection/Concepts/RegionType.h b/Shape_detection/doc/Shape_detection/Concepts/RegionType.h
index 09b97911b5db..e1f2551fa5b8 100644
--- a/Shape_detection/doc/Shape_detection/Concepts/RegionType.h
+++ b/Shape_detection/doc/Shape_detection/Concepts/RegionType.h
@@ -8,13 +8,13 @@ to maintain a region.
 A region is represented by a set items, which are included in this region.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_line_fit_region}
-\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_circle_fit_region}
-\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_plane_fit_region}
-\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_sphere_fit_region}
-\cgalModels{CGAL::Shape_detection::Point_set::Least_squares_cylinder_fit_region}
-\cgalModels{CGAL::Shape_detection::Segment_set::Least_squares_line_fit_region}
-\cgalModels{CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region}
+\cgalHasModels{CGAL::Shape_detection::Point_set::Least_squares_line_fit_region}
+\cgalHasModels{CGAL::Shape_detection::Point_set::Least_squares_circle_fit_region}
+\cgalHasModels{CGAL::Shape_detection::Point_set::Least_squares_plane_fit_region}
+\cgalHasModels{CGAL::Shape_detection::Point_set::Least_squares_sphere_fit_region}
+\cgalHasModels{CGAL::Shape_detection::Point_set::Least_squares_cylinder_fit_region}
+\cgalHasModels{CGAL::Shape_detection::Segment_set::Least_squares_line_fit_region}
+\cgalHasModels{CGAL::Shape_detection::Polygon_mesh::Least_squares_plane_fit_region}
 \cgalHasModelsEnd
 */
 class RegionType {
diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h b/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h
index cf96c3abe8e1..9803efdf5c20 100644
--- a/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h
+++ b/Shape_regularization/doc/Shape_regularization/Concepts/ContourDirections.h
@@ -11,9 +11,9 @@ contour edges towards these directions. All contour regularization functions
 in this package are parameterized by this concept.
 
 \cgalHasModelsBegin
-\cgalModels{Contours::Longest_direction_2}
-\cgalModels{Contours::Multiple_directions_2}
-\cgalModels{Contours::User_defined_directions_2}
+\cgalHasModels{Contours::Longest_direction_2}
+\cgalHasModels{Contours::Multiple_directions_2}
+\cgalHasModels{Contours::User_defined_directions_2}
 \cgalHasModelsEnd
 */
 class ContourDirections {
diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h b/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h
index f2cd1486593c..ebfa48ea7551 100644
--- a/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h
+++ b/Shape_regularization/doc/Shape_regularization/Concepts/NeighborQuery.h
@@ -10,7 +10,7 @@ A concept that describes the set of methods used by the class
 a geometric object being regularized.
 
 \cgalHasModelsBegin
-\cgalModels{Segments::Delaunay_neighbor_query_2}
+\cgalHasModels{Segments::Delaunay_neighbor_query_2}
 \cgalHasModelsEnd
 */
 class NeighborQuery {
diff --git a/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h b/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h
index ed3a10b5e285..bb3956c75a32 100644
--- a/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h
+++ b/Shape_regularization/doc/Shape_regularization/Concepts/RegularizationType.h
@@ -10,8 +10,8 @@ A concept that describes the set of methods used by the class
 required for setting up the the global regularization problem.
 
 \cgalHasModelsBegin
-\cgalModels{Segments::Angle_regularization_2}
-\cgalModels{Segments::Offset_regularization_2}
+\cgalHasModels{Segments::Angle_regularization_2}
+\cgalHasModels{Segments::Offset_regularization_2}
 \cgalHasModelsEnd
 */
 class RegularizationType {
diff --git a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h
index 363d63a67750..e0d7e4196bb6 100644
--- a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h
+++ b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurfaceTraits_3.h
@@ -11,7 +11,7 @@ polyhedral mesh approximating a skin surface
 \cgalRefines{RegularTriangulationTraits_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Skin_surface_traits_3<K>}
+\cgalHasModels{CGAL::Skin_surface_traits_3<K>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Skin_surface_3<SkinSurfaceTraits_3>`
diff --git a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h
index 22146acf83a4..58fef5d3800a 100644
--- a/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h
+++ b/Skin_surface_3/doc/Skin_surface_3/Concepts/SkinSurface_3.h
@@ -10,8 +10,8 @@ weighted points and a shrink factor. By default the input balls are
 grown in such that the skin surface wraps around the input balls.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Skin_surface_3<SkinSurfaceTraits_3>}
-\cgalModels{CGAL::Union_of_balls_3<SkinSurfaceTraits_3>}
+\cgalHasModels{CGAL::Skin_surface_3<SkinSurfaceTraits_3>}
+\cgalHasModels{CGAL::Union_of_balls_3<SkinSurfaceTraits_3>}
 \cgalHasModelsEnd
 
 */
diff --git a/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h b/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h
index 49dd95d05338..5cc0f58e5969 100644
--- a/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h
+++ b/Snap_rounding_2/doc/Snap_rounding_2/Concepts/SnapRoundingTraits_2.h
@@ -12,7 +12,7 @@ some function object types for the required predicates on those primitives.
 \cgalRefines{ArrangementTraits_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Snap_rounding_traits_2<Kernel>}
+\cgalHasModels{CGAL::Snap_rounding_traits_2<Kernel>}
 \cgalHasModelsEnd
 */
 
diff --git a/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h b/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h
index 7791fbf59a9a..8c22838c7ccc 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/DiagonalizeTraits.h
@@ -20,7 +20,7 @@ For example, a matrix of dimension 3 is defined as
 \tparam dim Dimension of the matrices and vectors
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Eigen_diagonalize_traits}
+\cgalHasModels{CGAL::Eigen_diagonalize_traits}
 \cgalHasModelsEnd
 */
 template <typename FT, unsigned int dim = 3>
diff --git a/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h b/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h
index f73b3d143963..b20bbdcb36f9 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/MixedIntegerProgramTraits.h
@@ -8,7 +8,7 @@ class MixedIntegerProgramTraits
 a Mixed Integer Programming (MIP) problem.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Variable<FT>}
+\cgalHasModels{CGAL::Variable<FT>}
 \cgalHasModelsEnd
 */
 template <typename FT>
@@ -115,7 +115,7 @@ class MixedIntegerProgramVariable
 constraint in a Mixed Integer Programming (MIP) problem.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Linear_constraint<FT>}
+\cgalHasModels{CGAL::Linear_constraint<FT>}
 \cgalHasModelsEnd
 */
 template <typename FT>
@@ -214,7 +214,7 @@ class MixedIntegerProgramLinearConstraint
 objective function in a Mixed Integer Programming (MIP) problem.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Linear_objective<FT>}
+\cgalHasModels{CGAL::Linear_objective<FT>}
 \cgalHasModelsEnd
 */
 template <typename FT>
@@ -284,9 +284,9 @@ variables, linear objective, and linear constraints (if any) and provides a meth
 to solve the problem.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Mixed_integer_program_traits<T>}
-\cgalModels{CGAL::GLPK_mixed_integer_program_traits<T>}
-\cgalModels{CGAL::SCIP_mixed_integer_program_traits<T>}
+\cgalHasModels{CGAL::Mixed_integer_program_traits<T>}
+\cgalHasModels{CGAL::GLPK_mixed_integer_program_traits<T>}
+\cgalHasModels{CGAL::SCIP_mixed_integer_program_traits<T>}
 \cgalHasModelsEnd
 */
 template <typename FT>
diff --git a/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h
index 49fb8ee1937e..11e2d309d261 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/NormalEquationSparseLinearAlgebraTraits_d.h
@@ -8,7 +8,7 @@ Concept describing the set of requirements for solving the normal equation \f$ A
 \sa `SparseLinearAlgebraTraits_d`
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Eigen_solver_traits<T>}
+\cgalHasModels{CGAL::Eigen_solver_traits<T>}
 \cgalHasModelsEnd
 */
 class NormalEquationSparseLinearAlgebraTraits_d
diff --git a/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h b/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h
index 7ed6bf55f2b3..f03f5ed21cec 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/QuadraticProgramTraits.h
@@ -25,7 +25,7 @@ where \f$ u_i \in \mathbb{R} \cup \{+\infty\} \f$ for all \f$ i \f$.
 </UL>
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::OSQP_quadratic_program_traits<T>}
+\cgalHasModels{CGAL::OSQP_quadratic_program_traits<T>}
 \cgalHasModelsEnd
 */
 class QuadraticProgramTraits {
diff --git a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h
index 9d236d47d3df..b44b686dbb88 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraTraits_d.h
@@ -5,7 +5,7 @@
 The concept `SparseLinearAlgebraTraits_d` is used to solve sparse linear systems <I>A\f$ \times \f$ X = B</I>.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Eigen_solver_traits<T>}
+\cgalHasModels{CGAL::Eigen_solver_traits<T>}
 \cgalHasModelsEnd
 */
 class SparseLinearAlgebraTraits_d
@@ -65,7 +65,7 @@ by a sparse matrix.
 \cgalRefines{DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Eigen_vector<T>}
+\cgalHasModels{CGAL::Eigen_vector<T>}
 \cgalHasModelsEnd
 
 \sa `SparseLinearAlgebraTraits_d`
@@ -134,8 +134,8 @@ NT& operator[](Index row);
 \cgalRefines{Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Eigen_sparse_matrix<T>}
-\cgalModels{CGAL::Eigen_sparse_symmetric_matrix<T>}
+\cgalHasModels{CGAL::Eigen_sparse_matrix<T>}
+\cgalHasModels{CGAL::Eigen_sparse_symmetric_matrix<T>}
 \cgalHasModelsEnd
 
 \sa `SparseLinearAlgebraTraits_d`
diff --git a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h
index c8792ccab3a6..7c5f65cc824b 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/SparseLinearAlgebraWithFactorTraits_d.h
@@ -9,7 +9,7 @@ method to solve the system for different right-hand vectors.
 \cgalRefines{SparseLinearAlgebraTraits_d}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Eigen_solver_traits<T>}
+\cgalHasModels{CGAL::Eigen_solver_traits<T>}
 \cgalHasModelsEnd
 */
 class SparseLinearAlgebraWithFactorTraits_d {
diff --git a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
index cd0ec9832ee6..dfad56236b81 100644
--- a/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
+++ b/Solver_interface/doc/Solver_interface/Concepts/SvdTraits.h
@@ -6,7 +6,7 @@
   to solve in the least square sense a linear system with a singular value decomposition
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Eigen_svd}
+\cgalHasModels{CGAL::Eigen_svd}
 \cgalHasModelsEnd
 */
 class SvdTraits
@@ -54,7 +54,7 @@ class SvdTraits
 Concept of vector type used by the concept `SvdTraits`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Eigen_vector<T>}
+\cgalHasModels{CGAL::Eigen_vector<T>}
 \cgalHasModelsEnd
 */
 class SvdTraits::Vector
@@ -93,7 +93,7 @@ Concept of matrix type used by the concept `SvdTraits`.
 \cgalRefines{DefaultConstructible,Assignable}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Eigen_matrix<T>}
+\cgalHasModels{CGAL::Eigen_matrix<T>}
 \cgalHasModelsEnd
 */
 class SvdTraits::Matrix
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
index 6bf09d1211ae..99569575b999 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
@@ -9,8 +9,8 @@ e.g., for a Euclidean distance the transformed distance is the squared
 Euclidean distance.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Manhattan_distance_iso_box_point<Traits>}
-\cgalModels{CGAL::Euclidean_distance_sphere_point<Traits>}
+\cgalHasModels{CGAL::Manhattan_distance_iso_box_point<Traits>}
+\cgalHasModels{CGAL::Euclidean_distance_sphere_point<Traits>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
index a12b6e2a2447..658d58f77d29 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
@@ -9,8 +9,8 @@ E.g., for an Euclidean distance the transformed distance is the squared Euclidea
 \cgalRefines{GeneralDistance}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Euclidean_distance<Traits>}
-\cgalModels{CGAL::Weighted_Minkowski_distance<Traits>}
+\cgalHasModels{CGAL::Euclidean_distance<Traits>}
+\cgalHasModels{CGAL::Weighted_Minkowski_distance<Traits>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h b/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h
index 22a34f8c6de4..d78a094006ea 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/RangeSearchTraits.h
@@ -9,12 +9,12 @@ range search queries in a model of `SpatialTree`.
 \cgalRefines{SearchTraits}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Cartesian_d<FT>}
-\cgalModels{CGAL::Homogeneous_d<RT>}
-\cgalModels{CGAL::Epick_d<DimensionTag>}
-\cgalModels{CGAL::Epeck_d<DimensionTag>}
-\cgalModels{CGAL::Search_traits_2<Kernel>}
-\cgalModels{CGAL::Search_traits_3<Kernel>}
+\cgalHasModels{CGAL::Cartesian_d<FT>}
+\cgalHasModels{CGAL::Homogeneous_d<RT>}
+\cgalHasModels{CGAL::Epick_d<DimensionTag>}
+\cgalHasModels{CGAL::Epeck_d<DimensionTag>}
+\cgalHasModels{CGAL::Search_traits_2<Kernel>}
+\cgalHasModels{CGAL::Search_traits_3<Kernel>}
 \cgalHasModelsEnd
 
 \sa `SearchTraits`
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h b/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h
index 358c828ff6f8..ec5dcdae42dc 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SearchTraits.h
@@ -6,14 +6,14 @@ The concept `SearchTraits` defines the requirements for the template
 parameter of the search classes.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Cartesian_d<FT>}
-\cgalModels{CGAL::Homogeneous_d<RT>}
-\cgalModels{CGAL::Epick_d<DimensionTag>}
-\cgalModels{CGAL::Epeck_d<DimensionTag>}
-\cgalModels{CGAL::Search_traits_2<Kernel>}
-\cgalModels{CGAL::Search_traits_3<Kernel>}
-\cgalModels{CGAL::Search_traits_d<Kernel,Dim>}
-\cgalModels{CGAL::Search_traits<NT,Point,CartesianCoordinateIterator,ConstructCartesianCoordinateIterator,ConstructMinVertex,ConstructMaxVertex>}
+\cgalHasModels{CGAL::Cartesian_d<FT>}
+\cgalHasModels{CGAL::Homogeneous_d<RT>}
+\cgalHasModels{CGAL::Epick_d<DimensionTag>}
+\cgalHasModels{CGAL::Epeck_d<DimensionTag>}
+\cgalHasModels{CGAL::Search_traits_2<Kernel>}
+\cgalHasModels{CGAL::Search_traits_3<Kernel>}
+\cgalHasModels{CGAL::Search_traits_d<Kernel,Dim>}
+\cgalHasModels{CGAL::Search_traits<NT,Point,CartesianCoordinateIterator,ConstructCartesianCoordinateIterator,ConstructMinVertex,ConstructMaxVertex>}
 \cgalHasModelsEnd
 
 \sa `RangeSearchTraits`
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h
index 357dbbfff468..32855bdf0449 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialSeparator.h
@@ -12,7 +12,7 @@ other part of space is said to be on the positive side of the
 separator.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Plane_separator<FT>}
+\cgalHasModels{CGAL::Plane_separator<FT>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h
index aa483a297805..0f505a4864a7 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/SpatialTree.h
@@ -6,7 +6,7 @@ The concept `SpatialTree` defines the requirements for a tree supporting
 both neighbor searching and approximate range searching.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Kd_tree<Traits,Splitter,UseExtendedNode>}
+\cgalHasModels{CGAL::Kd_tree<Traits,Splitter,UseExtendedNode>}
 \cgalHasModelsEnd
 
 */
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h b/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h
index 6621186a2f7e..d4fc0cf64d62 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/Splitter.h
@@ -8,13 +8,13 @@ The concept `Splitter` defines the requirements for a function object class impl
 \cgalAdvancedEnd
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Fair<Traits, SpatialSeparator>}
-\cgalModels{CGAL::Median_of_rectangle<Traits, SpatialSeparator>}
-\cgalModels{CGAL::Median_of_max_spread<Traits, SpatialSeparator>}
-\cgalModels{CGAL::Midpoint_of_rectangle<Traits, SpatialSeparator>}
-\cgalModels{CGAL::Midpoint_of_max_spread<Traits, SpatialSeparator>}
-\cgalModels{CGAL::Sliding_fair<Traits, SpatialSeparator>}
-\cgalModels{CGAL::Sliding_midpoint<Traits, SpatialSeparator>}
+\cgalHasModels{CGAL::Fair<Traits, SpatialSeparator>}
+\cgalHasModels{CGAL::Median_of_rectangle<Traits, SpatialSeparator>}
+\cgalHasModels{CGAL::Median_of_max_spread<Traits, SpatialSeparator>}
+\cgalHasModels{CGAL::Midpoint_of_rectangle<Traits, SpatialSeparator>}
+\cgalHasModels{CGAL::Midpoint_of_max_spread<Traits, SpatialSeparator>}
+\cgalHasModels{CGAL::Sliding_fair<Traits, SpatialSeparator>}
+\cgalHasModels{CGAL::Sliding_midpoint<Traits, SpatialSeparator>}
 \cgalHasModelsEnd
 
 */
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
index f5f7270e043a..9d48912fb45d 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
@@ -8,7 +8,7 @@ The concept `PolygonOffsetBuilderTraits_2` describes the requirements for the ge
 required by the algorithm class `CGAL::Polygon_offset_builder_2`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Polygon_offset_builder_traits_2}
+\cgalHasModels{CGAL::Polygon_offset_builder_traits_2}
 \cgalHasModelsEnd
 
 \sa `CGAL::Polygon_offset_builder_2<Ss,Traits,Container>`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
index 5df86d3e2a6b..0be531bf0bf0 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
@@ -8,7 +8,7 @@ The concept `StraightSkeletonBuilderTraits_2` describes the requirements
 for the geometric traits class required by the algorithm class `CGAL::Straight_skeleton_builder_2`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Straight_skeleton_builder_traits_2<K>}
+\cgalHasModels{CGAL::Straight_skeleton_builder_traits_2<K>}
 \cgalHasModelsEnd
 */
 class StraightSkeletonBuilderTraits_2 {
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h
index 7937ab435359..f18d851ce8b2 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilder_2_Visitor.h
@@ -6,7 +6,7 @@ The concept `StraightSkeletonBuilder_2_Visitor` describes the requirements of th
 required by the algorithm class `CGAL::Straight_skeleton_builder_2` in its third template parameter.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Dummy_straight_skeleton_builder_2_visitor}
+\cgalHasModels{CGAL::Dummy_straight_skeleton_builder_2_visitor}
 \cgalHasModelsEnd
 
 \sa `CGAL::Straight_skeleton_builder_2`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h
index af125ad42f5e..2c476b2e20c5 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonFace_2.h
@@ -9,7 +9,7 @@ The concept `StraightSkeletonFace_2` describes the requirements for the face typ
 with support for storage of the incident halfedge.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Straight_skeleton_face_base_2}
+\cgalHasModels{CGAL::Straight_skeleton_face_base_2}
 \cgalHasModelsEnd
 
 \sa `StraightSkeletonVertex_2`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h
index 67f6dafc5c44..d047dc14b53d 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonHalfedge_2.h
@@ -13,7 +13,7 @@ in the contour and skeleton vertices. However, for any halfedge, there is a 2D s
 given by its `source` and `target` vertices.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Straight_skeleton_halfedge_base_2}
+\cgalHasModels{CGAL::Straight_skeleton_halfedge_base_2}
 \cgalHasModelsEnd
 
 \sa `StraightSkeleton_2`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h
index 0bf7cab0c87f..beb00c9b5201 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonItemsConverter_2.h
@@ -7,7 +7,7 @@ as the third template argument to the class `Straight_skeleton_converter_2<SrcSs
 It converts the `HDS` items from one type of straight skeleton to another.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Straight_skeleton_items_converter_2}
+\cgalHasModels{CGAL::Straight_skeleton_items_converter_2}
 \cgalHasModelsEnd
 
 \sa `CGAL::Straight_skeleton_converter_2<SrcSs,TgtSs,ItemsCvt>`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
index 29f50118cb4c..fac06961dec7 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
@@ -10,7 +10,7 @@ with support for storage of the incident halfedge. The `StraightSkeletonVertex_2
 requires the geometric embedding to be a 2D point.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Straight_skeleton_vertex_base_2}
+\cgalHasModels{CGAL::Straight_skeleton_vertex_base_2}
 \cgalHasModelsEnd
 
 \sa `StraightSkeletonHalfedge_2`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h
index 9df0937e9ff4..3bcdaa2597df 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeleton_2.h
@@ -10,7 +10,7 @@ used to represent a straight skeleton. It refines the concept
 `Vertex`, `Halfedge`, and `Face` of the halfedge data structure.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Straight_skeleton_2}
+\cgalHasModels{CGAL::Straight_skeleton_2}
 \cgalHasModelsEnd
 
 \attention This concept explicitly protects all the modifying
diff --git a/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h b/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h
index 9e23002f51d9..a04c6c6e5235 100644
--- a/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/Concepts/Integrator_2.h
@@ -10,8 +10,8 @@ provides the operation that integrates a new point from a given point
 with a predefined step, and according to a specified vector.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Euler_integrator_2<VectorField_2>}
-\cgalModels{CGAL::Runge_kutta_integrator_2<VectorField_2>}
+\cgalHasModels{CGAL::Euler_integrator_2<VectorField_2>}
+\cgalHasModels{CGAL::Runge_kutta_integrator_2<VectorField_2>}
 \cgalHasModelsEnd
 
 */
diff --git a/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h b/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h
index b79ed1e740fa..0cdfedfcb1c7 100644
--- a/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h
+++ b/Stream_lines_2/doc/Stream_lines_2/Concepts/VectorField_2.h
@@ -10,8 +10,8 @@ provides the types of the geometric primitives used in the placement
 of streamlines and some functions for answering different queries.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Regular_grid_2<StreamLinesTraits_2>}
-\cgalModels{CGAL::Triangular_field_2<StreamLinesTraits_2>}
+\cgalHasModels{CGAL::Regular_grid_2<StreamLinesTraits_2>}
+\cgalHasModels{CGAL::Triangular_field_2<StreamLinesTraits_2>}
 \cgalHasModelsEnd
 
 */
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h
index ea351a5d2ba1..21326e8a37cc 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/DQQMask_3.h
@@ -12,7 +12,7 @@ policy concept of geometric computations is used in
 \cgalRefines{SubdivisionMask_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::DooSabin_mask_3<PolygonMesh, VertexPointMap>}
+\cgalHasModels{CGAL::DooSabin_mask_3<PolygonMesh, VertexPointMap>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h
index 15a337e68c97..3397ef818feb 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PQQMask_3.h
@@ -12,7 +12,7 @@ policy concept of geometric computations is used in
 \cgalRefines{SubdivisionMask_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::CatmullClark_mask_3<PolygonMesh, VertexPointMap>}
+\cgalHasModels{CGAL::CatmullClark_mask_3<PolygonMesh, VertexPointMap>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h
index 190f970bd007..2e799fb59520 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/PTQMask_3.h
@@ -11,7 +11,7 @@ policy concept of geometric computations is used in
 \cgalRefines{SubdivisionMask_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Loop_mask_3<PolygonMesh, VertexPointMap>}
+\cgalHasModels{CGAL::Loop_mask_3<PolygonMesh, VertexPointMap>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
diff --git a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h
index 72823a073e1b..2cd7648f6373 100644
--- a/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h
+++ b/Subdivision_method_3/doc/Subdivision_method_3/Concepts/Sqrt3Mask_3.h
@@ -10,7 +10,7 @@ policy concept of geometric computations is used in
 \cgalRefines{SubdivisionMask_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Sqrt3_mask_3<PolygonMesh, VertexPointMap>}
+\cgalHasModels{CGAL::Sqrt3_mask_3<PolygonMesh, VertexPointMap>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Subdivision_method_3`
diff --git a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h
index f6e59cdaf67f..11f66968daec 100644
--- a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h
+++ b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Concepts/ErrorMetricProxy.h
@@ -7,8 +7,8 @@ computes the fitting error from a face to a proxy,
 and fits a proxy from a range of faces.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_approximation::L21_metric_plane_proxy}
-\cgalModels{CGAL::Surface_mesh_approximation::L2_metric_plane_proxy}
+\cgalHasModels{CGAL::Surface_mesh_approximation::L21_metric_plane_proxy}
+\cgalHasModels{CGAL::Surface_mesh_approximation::L2_metric_plane_proxy}
 \cgalHasModelsEnd
 */
 
diff --git a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
index 4332ebda74b1..5a8a704883d4 100644
--- a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
+++ b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/DeformationClosestRotationTraits_3.h
@@ -10,8 +10,8 @@ to implement models of this concept.
 \cgalRefines{DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Deformation_Eigen_closest_rotation_traits_3}
-\cgalModels{CGAL::Deformation_Eigen_polar_closest_rotation_traits_3}
+\cgalHasModels{CGAL::Deformation_Eigen_closest_rotation_traits_3}
+\cgalHasModels{CGAL::Deformation_Eigen_polar_closest_rotation_traits_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h
index 35a8d8a2e1a4..cf9b2957984b 100644
--- a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h
+++ b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Concepts/Parameterizer_3.h
@@ -13,16 +13,16 @@ the border of a given mesh.
 Construction and destruction are undefined.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_parameterization::Fixed_border_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
-\cgalModels{CGAL::Surface_mesh_parameterization::ARAP_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
-\cgalModels{CGAL::Surface_mesh_parameterization::Barycentric_mapping_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
-\cgalModels{CGAL::Surface_mesh_parameterization::Discrete_authalic_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
-\cgalModels{CGAL::Surface_mesh_parameterization::Discrete_conformal_map_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
-\cgalModels{CGAL::Surface_mesh_parameterization::LSCM_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
-\cgalModels{CGAL::Surface_mesh_parameterization::Mean_value_coordinates_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
-\cgalModels{CGAL::Surface_mesh_parameterization::Circular_border_parameterizer_3<TriangleMesh>}
-\cgalModels{CGAL::Surface_mesh_parameterization::Square_border_parameterizer_3<TriangleMesh>}
-\cgalModels{CGAL::Surface_mesh_parameterization::Two_vertices_parameterizer_3<TriangleMesh>}
+\cgalHasModels{CGAL::Surface_mesh_parameterization::Fixed_border_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalHasModels{CGAL::Surface_mesh_parameterization::ARAP_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalHasModels{CGAL::Surface_mesh_parameterization::Barycentric_mapping_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalHasModels{CGAL::Surface_mesh_parameterization::Discrete_authalic_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalHasModels{CGAL::Surface_mesh_parameterization::Discrete_conformal_map_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalHasModels{CGAL::Surface_mesh_parameterization::LSCM_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalHasModels{CGAL::Surface_mesh_parameterization::Mean_value_coordinates_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>}
+\cgalHasModels{CGAL::Surface_mesh_parameterization::Circular_border_parameterizer_3<TriangleMesh>}
+\cgalHasModels{CGAL::Surface_mesh_parameterization::Square_border_parameterizer_3<TriangleMesh>}
+\cgalHasModels{CGAL::Surface_mesh_parameterization::Two_vertices_parameterizer_3<TriangleMesh>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Surface_mesh_parameterization::Orbifold_Tutte_parameterizer_3<SeamMesh, SolverTraits>`
diff --git a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
index 9724634b10ff..dd08086b4a5f 100644
--- a/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
+++ b/Surface_mesh_shortest_path/doc/Surface_mesh_shortest_path/Concepts/SurfaceMeshShortestPathTraits.h
@@ -9,7 +9,7 @@ predicates, and constructions required by the traits class parameter of
 
 \cgalRefines{CopyConstructible,Assignable}
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_shortest_path_traits<K,P>}
+\cgalHasModels{CGAL::Surface_mesh_shortest_path_traits<K,P>}
 \cgalHasModelsEnd
 
 */
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
index 2bd7a6bd2017..907b5db3dd05 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetCost.h
@@ -13,9 +13,9 @@ or can be intentionally returned to prevent the edge from being collapsed.
 \cgalRefines{DefaultConstructible,CopyConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_simplification::Edge_length_cost<TriangleMesh>}
-\cgalModels{CGAL::Surface_mesh_simplification::LindstromTurk_cost<TriangleMesh>}
-\cgalModels{CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::Edge_length_cost<TriangleMesh>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::LindstromTurk_cost<TriangleMesh>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>}
 \cgalHasModelsEnd
 
 */
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
index cf87c5e2400d..5fdf445d9bef 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/GetPlacement.h
@@ -15,11 +15,11 @@ or can be intentionally returned to prevent the edge from being collapsed.
 \cgalRefines{DefaultConstructible,CopyConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_simplification::Midpoint_placement<TriangleMesh>}
-\cgalModels{CGAL::Surface_mesh_simplification::LindstromTurk_placement<TriangleMesh>}
-\cgalModels{CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>}
-\cgalModels{CGAL::Surface_mesh_simplification::Bounded_normal_change_placement<Placement>}
-\cgalModels{CGAL::Surface_mesh_simplification::Constrained_placement<Placement>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::Midpoint_placement<TriangleMesh>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::LindstromTurk_placement<TriangleMesh>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::GarlandHeckbert_policies<TriangleMesh, GeomTraits>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::Bounded_normal_change_placement<Placement>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::Constrained_placement<Placement>}
 \cgalHasModelsEnd
 */
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
index 6f53b84171e8..193320241021 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/PlacementFilter.h
@@ -15,8 +15,8 @@ be absent). The value `boost::none` indicates that the edge should not be collap
 \cgalRefines{DefaultConstructible,CopyConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<BasePlacementFilter>}
-\cgalModels{CGAL::Surface_mesh_simplification::Polyhedral_envelope_filter<GeomTraits, BasePlacementFilter>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::Bounded_normal_change_filter<BasePlacementFilter>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::Polyhedral_envelope_filter<GeomTraits, BasePlacementFilter>}
 \cgalHasModelsEnd
 */
 
diff --git a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h
index 9a51402119c5..e09a0c1f03bb 100644
--- a/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h
+++ b/Surface_mesh_simplification/doc/Surface_mesh_simplification/Concepts/StopPredicate.h
@@ -5,11 +5,11 @@
 The concept `StopPredicate` describes the requirements for the predicate which indicates if the simplification process must finish.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_simplification::Edge_count_stop_predicate<TriangleMesh>}
-\cgalModels{CGAL::Surface_mesh_simplification::Face_count_stop_predicate<TriangleMesh>}
-\cgalModels{CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<TriangleMesh>}
-\cgalModels{CGAL::Surface_mesh_simplification::Face_count_ratio_stop_predicate<TriangleMesh>}
-\cgalModels{CGAL::Surface_mesh_simplification::Edge_length_stop_predicate<FT>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::Edge_count_stop_predicate<TriangleMesh>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::Face_count_stop_predicate<TriangleMesh>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::Edge_count_ratio_stop_predicate<TriangleMesh>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::Face_count_ratio_stop_predicate<TriangleMesh>}
+\cgalHasModels{CGAL::Surface_mesh_simplification::Edge_length_stop_predicate<FT>}
 \cgalHasModelsEnd
 
 */
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h
index 3dcc8a0dedf5..fbf8c2662c75 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshCellBase_3.h
@@ -38,8 +38,8 @@ triangulation.  In the following we call surface center of a facet,
 the center of its biggest Delaunay surface ball.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_cell_base_3<Gt,Vb>}
-\cgalModels{CGAL::Surface_mesh_default_triangulation_3::Cell}
+\cgalHasModels{CGAL::Surface_mesh_cell_base_3<Gt,Vb>}
+\cgalHasModels{CGAL::Surface_mesh_default_triangulation_3::Cell}
 \cgalHasModelsEnd
 
 \sa `SurfaceMeshTriangulation_3`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h
index 35b923bbb8b5..185c14e9e9d8 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshComplex_2InTriangulation_3.h
@@ -31,7 +31,7 @@ parameter in the
 function template `CGAL::make_surface_mesh()`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_complex_2_in_triangulation_3<Tr>}
+\cgalHasModels{CGAL::Surface_mesh_complex_2_in_triangulation_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h
index 0f3431af56cb..ecc980a35cf2 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshFacetsCriteria_3.h
@@ -34,7 +34,7 @@ with lowest quality first. The qualities are computed by a function
 `is_bad(const Facet& f, const Quality& q)`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_default_criteria_3<Tr>}
+\cgalHasModels{CGAL::Surface_mesh_default_criteria_3<Tr>}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h
index 672f74669488..412f6503b704 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshTraits_3.h
@@ -12,7 +12,7 @@ points if any exists. The concept `SurfaceMeshTraits_3` also includes a funcctor
 a small set of initial points on the surface.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_traits_generator_3::type}
+\cgalHasModels{CGAL::Surface_mesh_traits_generator_3::type}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h
index 32663ac10ddf..1889afd3c84c 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/SurfaceMeshVertexBase_3.h
@@ -32,8 +32,8 @@ complex facets incident to the vertex and the number of connected
 components of the adjacency graph of those facets.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Surface_mesh_vertex_base_3<Gt,Vb>}
-\cgalModels{CGAL::Surface_mesh_default_triangulation_3::Vertex}
+\cgalHasModels{CGAL::Surface_mesh_vertex_base_3<Gt,Vb>}
+\cgalHasModels{CGAL::Surface_mesh_default_triangulation_3::Vertex}
 \cgalHasModelsEnd
 
 \sa `SurfaceMeshComplex_2InTriangulation_3`
diff --git a/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h b/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h
index 4b4d11da894f..04f2064c682a 100644
--- a/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h
+++ b/Surface_mesher/doc/Surface_mesher/Concepts/Surface_3.h
@@ -9,7 +9,7 @@ are required to be copy constructible
 and assignable.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Implicit_surface_3<Traits, Function>}
+\cgalHasModels{CGAL::Implicit_surface_3<Traits, Function>}
 \cgalHasModelsEnd
 
 \sa `CGAL::make_surface_mesh()`
diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h
index e1dc359a13f0..be2cbf0b6cea 100644
--- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h
+++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSFaceBase_2.h
@@ -49,7 +49,7 @@ actually uses as a base class for the class
 `CGAL::Triangulation_data_structure_2::Face`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_ds_face_base_2<TDS>}
+\cgalHasModels{CGAL::Triangulation_ds_face_base_2<TDS>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSVertexBase_2`
diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h
index 994a0f82b9b0..6c5cbe4c7e62 100644
--- a/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h
+++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDSVertexBase_2.h
@@ -45,7 +45,7 @@ actually uses as a base class for the class
 of `CGAL::Triangulation_data_structure_2::Vertex`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_ds_vertex_base_2<Tds>}
+\cgalHasModels{CGAL::Triangulation_ds_vertex_base_2<Tds>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSFaceBase_2`
diff --git a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
index a07310740957..5b458bc32504 100644
--- a/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
+++ b/TDS_2/doc/TDS_2/Concepts/TriangulationDataStructure_2.h
@@ -65,7 +65,7 @@ When dimension \f$ <\f$ 2, the same information is output
 for faces of maximal dimension instead of faces.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_data_structure_2<Vb,Fb>}
+\cgalHasModels{CGAL::Triangulation_data_structure_2<Vb,Fb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2::Face`
@@ -729,7 +729,7 @@ call the `create_vertex()` and `delete_vertex()` methods of the
 triangulation data structure.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_ds_vertex_base_2<Tds>}
+\cgalHasModels{CGAL::Triangulation_ds_vertex_base_2<Tds>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSVertexBase_2`
@@ -852,7 +852,7 @@ have to be used to
 define new faces and to delete no longer used faces.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_ds_face_base_2<Tds>}
+\cgalHasModels{CGAL::Triangulation_ds_face_base_2<Tds>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSFaceBase_2`
diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h
index 8f8ec146dbf9..4b5865363813 100644
--- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h
+++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSCellBase_3.h
@@ -34,7 +34,7 @@ which are used as base classes for the final vertex and cell classes.
 More information can be found in Section \ref TDS3secdesign.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_ds_cell_base_3<TDS>}
+\cgalHasModels{CGAL::Triangulation_ds_cell_base_3<TDS>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSVertexBase_3`
diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h
index 0a9d10b04bff..3e3e58e37ea0 100644
--- a/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h
+++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDSVertexBase_3.h
@@ -29,7 +29,7 @@ are used as base classes for the final vertex and cell classes.
 More information can be found in Section \ref TDS3secdesign.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_ds_vertex_base_3<TDS>}
+\cgalHasModels{CGAL::Triangulation_ds_vertex_base_3<TDS>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSCellBase_3`
diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
index c3a7ba38023d..bdd21ca6d4ba 100644
--- a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
+++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
@@ -66,7 +66,7 @@ list of cells. When dimension < 3, the same information is stored
 for faces of maximal dimension instead of cells.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_data_structure_3<Vb, Cb>}
+\cgalHasModels{CGAL::Triangulation_data_structure_3<Vb, Cb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_3::Vertex`
diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h
index 342e203e2598..ca104a809883 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingCellBase_3.h
@@ -7,7 +7,7 @@
 Cell base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3}
+\cgalHasModels{CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h
index 2ce117b8ff32..484782a65470 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Concepts/RemeshingVertexBase_3.h
@@ -7,7 +7,7 @@
 Vertex base concept to be used in the triangulation type given to the function `CGAL::tetrahedral_isotropic_remeshing()`.
 
 \cgalHasModelsBegin
-\cgalModels{Tetrahedral_remeshing::Remeshing_vertex_base_3}
+\cgalHasModels{Tetrahedral_remeshing::Remeshing_vertex_base_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h
index 1dd4fa17d49f..5432de4a1f2c 100644
--- a/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h
+++ b/Triangulation/doc/Triangulation/Concepts/DelaunayTriangulationTraits.h
@@ -10,8 +10,8 @@ a Delaunay triangulation. It corresponds to the first template parameter of the
 \cgalRefines{TriangulationTraits}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Epick_d<Dim>}
-\cgalModels{CGAL::Epeck_d<Dim>}
+\cgalHasModels{CGAL::Epick_d<Dim>}
+\cgalHasModels{CGAL::Epeck_d<Dim>}
 \cgalHasModelsEnd
 
 \sa `TriangulationTraits`
diff --git a/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h
index 1afb3084639a..8180b4f3007a 100644
--- a/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h
+++ b/Triangulation/doc/Triangulation/Concepts/RegularTriangulationTraits.h
@@ -10,8 +10,8 @@ a regular triangulation. It corresponds to the first template parameter of the c
 \cgalRefines{TriangulationTraits}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Epick_d<Dim>}
-\cgalModels{CGAL::Epeck_d<Dim>}
+\cgalHasModels{CGAL::Epick_d<Dim>}
+\cgalHasModels{CGAL::Epeck_d<Dim>}
 \cgalHasModelsEnd
 
 \sa `TriangulationTraits`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h
index b72f4ee1fd0a..3a582c7ba0fa 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFace.h
@@ -16,7 +16,7 @@ The dimension of a face is implicitly set when
 first two vertices (`i = 0` and `i = 1`), then the dimension is 1.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_face<TriangulationDataStructure_>}
+\cgalHasModels{CGAL::Triangulation_face<TriangulationDataStructure_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSFullCell`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h
index 231e29f5a08f..df9d474ea4b5 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSFullCell.h
@@ -37,8 +37,8 @@ of `CGAL::Triangulation_data_structure::Vertex`.
 \cgalRefines{TriangulationDataStructure::FullCell}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>}
-\cgalModels{CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>}
+\cgalHasModels{CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>}
+\cgalHasModels{CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSVertex`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h
index 51fb7cad627c..f9be6db63661 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDSVertex.h
@@ -37,8 +37,8 @@ of `CGAL::Triangulation_data_structure::Vertex`.
 \cgalRefines{TriangulationDataStructure::Vertex}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>}
-\cgalModels{CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>}
+\cgalHasModels{CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>}
+\cgalHasModels{CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDSFullCell`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
index a8da6d398490..6ab5522df502 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationDataStructure.h
@@ -70,7 +70,7 @@ The classes `Vertex` and
 (possibly empty).
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_data_structure<Dimensionality, TriangulationDSVertex_, TriangulationDSFullCell_>}
+\cgalHasModels{CGAL::Triangulation_data_structure<Dimensionality, TriangulationDSVertex_, TriangulationDSFullCell_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure::Vertex`
@@ -663,8 +663,8 @@ only, as geometry is not concerned here. In particular, we only require that
 the vertex holds a handle to a full cell incident to it in the triangulation.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>}
-\cgalModels{CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>}
+\cgalHasModels{CGAL::Triangulation_ds_vertex<TriangulationDataStructure_>}
+\cgalHasModels{CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure::FullCell`
@@ -772,8 +772,8 @@ are said to be adjacent when they share a facet. Adjacent full cells are
 called hereafter neighbors.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>}
-\cgalModels{CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>}
+\cgalHasModels{CGAL::Triangulation_ds_full_cell<TriangulationDataStructure_, DSFullCellStoragePolicy>}
+\cgalHasModels{CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure::FullCell`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h
index 95cac2eab13c..ff141326debb 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationFullCell.h
@@ -11,7 +11,7 @@ represent a full cell.
 additional specific requirements of `TriangulationFullCell`}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_full_cell<TriangulationTraits_, TriangulationDSFullCell_>}
+\cgalHasModels{CGAL::Triangulation_full_cell<TriangulationTraits_, TriangulationDSFullCell_>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Triangulation_full_cell<TriangulationTraits_, Data, TriangulationDSFullCell_>`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h
index 198e3a736502..660b270a1013 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationTraits.h
@@ -15,8 +15,8 @@ then optimized using spatial sorting.
 This is not required if the points are inserted one by one.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Epick_d<Dim>}
-\cgalModels{CGAL::Epeck_d<Dim>}
+\cgalHasModels{CGAL::Epick_d<Dim>}
+\cgalHasModels{CGAL::Epeck_d<Dim>}
 \cgalHasModelsEnd
 
 \sa `DelaunayTriangulationTraits`
diff --git a/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h b/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h
index 457339f28b0e..9648500277a1 100644
--- a/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h
+++ b/Triangulation/doc/Triangulation/Concepts/TriangulationVertex.h
@@ -13,7 +13,7 @@ Compared to ::TriangulationDSVertex, the main difference is the addition of
 an association of the vertex with a geometric point.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>}
+\cgalHasModels{CGAL::Triangulation_vertex<TriangulationTraits_, Data, TriangulationDSVertex_>}
 \cgalHasModelsEnd
 
 \cgalHeading{Input/Output}
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h
index 73951fc22c16..50e30987b42e 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/ConstrainedTriangulationFaceBase_2.h
@@ -20,7 +20,7 @@ constraints.
 Defines the same types as the `TriangulationFaceBase_2` concept
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Constrained_triangulation_face_base_2<Traits>}
+\cgalHasModels{CGAL::Constrained_triangulation_face_base_2<Traits>}
 \cgalHasModelsEnd
 
 \sa `TriangulationFaceBase_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h
index 4ec205577472..7602ca70584e 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationFaceBase_2.h
@@ -35,7 +35,7 @@ in the face a list to store hidden vertices.
 \cgalRefines{TriangulationFaceBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Regular_triangulation_face_base_2}
+\cgalHasModels{CGAL::Regular_triangulation_face_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationFaceBase_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h
index feee66c0b110..5cbfa1b9442e 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/RegularTriangulationVertexBase_2.h
@@ -36,7 +36,7 @@ vertex of the triangulation or a hidden vertex.
 \cgalRefines{TriangulationVertexBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Regular_triangulation_vertex_base_2}
+\cgalHasModels{CGAL::Regular_triangulation_vertex_base_2}
 \cgalHasModelsEnd
 
 \sa `TriangulationVertexBase_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h
index 9a364975955b..e83d910e4a41 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationFaceBase_2.h
@@ -17,7 +17,7 @@ and only provided for symmetry with the vertex case.
 \cgalRefines{TriangulationDSFaceBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_face_base_2<Traits>}
+\cgalHasModels{CGAL::Triangulation_face_base_2<Traits>}
 \cgalHasModelsEnd
 
 \sa `TriangulationVertexBase_2`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h
index 83e3992d81ce..416da371080e 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationHierarchyVertexBase_2.h
@@ -15,7 +15,7 @@ next and previous level triangulations.
 \cgalRefines{TriangulationVertexBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_hierarchy_vertex_base_2<Vb>}
+\cgalHasModels{CGAL::Triangulation_hierarchy_vertex_base_2<Vb>}
 \cgalHasModelsEnd
 
 \sa `CGAL::Triangulation_hierarchy_2<Tr>`
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h
index 8cca35af421a..63ffeab1a29a 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBaseWithInfo_2.h
@@ -9,7 +9,7 @@ and provides an additional information storage.
 \cgalRefines{TriangulationVertexBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_vertex_base_with_info_2}
+\cgalHasModels{CGAL::Triangulation_vertex_base_with_info_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h
index 9790b02cecc3..94e5c7da0a0c 100644
--- a/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h
+++ b/Triangulation_2/doc/Triangulation_2/Concepts/TriangulationVertexBase_2.h
@@ -16,7 +16,7 @@ the vertex base of a triangulation stores a point.
 \cgalRefines{TriangulationDSVertexBase_2}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_vertex_base_2<Traits,Vb>}
+\cgalHasModels{CGAL::Triangulation_vertex_base_2<Traits,Vb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h
index b71b96cc4392..fdb8b9ee8703 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationCellBase_3.h
@@ -12,8 +12,8 @@ in the cell an operator that computes its circumcenter.
 \cgalRefines{TriangulationCellBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Delaunay_triangulation_cell_base_3}
-\cgalModels{CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3}
+\cgalHasModels{CGAL::Delaunay_triangulation_cell_base_3}
+\cgalHasModels{CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3}
 \cgalHasModelsEnd
 
 \sa `DelaunayTriangulationTraits_3`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h
index 3493e4ef1faf..3a7514fab6ae 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/DelaunayTriangulationTraits_3.h
@@ -11,13 +11,13 @@ predicates and constructions on these objects.
 \cgalRefines{TriangulationTraits_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Exact_predicates_inexact_constructions_kernel (recommended)}
-\cgalModels{CGAL::Exact_predicates_exact_constructions_kernel (recommended for Voronoi)}
-\cgalModels{CGAL::Filtered_kernel}
-\cgalModels{CGAL::Cartesian}
-\cgalModels{CGAL::Simple_cartesian}
-\cgalModels{CGAL::Homogeneous}
-\cgalModels{CGAL::Simple_homogeneous}
+\cgalHasModels{CGAL::Exact_predicates_inexact_constructions_kernel (recommended)}
+\cgalHasModels{CGAL::Exact_predicates_exact_constructions_kernel (recommended for Voronoi)}
+\cgalHasModels{CGAL::Filtered_kernel}
+\cgalHasModels{CGAL::Cartesian}
+\cgalHasModels{CGAL::Simple_cartesian}
+\cgalHasModels{CGAL::Homogeneous}
+\cgalHasModels{CGAL::Simple_homogeneous}
 \cgalHasModelsEnd
 
 In addition to the requirements described for the traits class of
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h
index cd00268b2b91..6851d616de3e 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBaseWithWeightedCircumcenter_3.h
@@ -20,7 +20,7 @@ circumcenter by calling `invalidate_weighted_circumcenter_cache()`.
 \cgalRefines{RegularTriangulationCellBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3}
+\cgalHasModels{CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3}
 \cgalHasModelsEnd
 
 \sa `RegularTriangulationTraits_3`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h
index b95816da2963..ffafd4be04ee 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationCellBase_3.h
@@ -36,7 +36,7 @@ and an operator to compute its weighted circumcenter.
 \cgalRefines{TriangulationCellBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Regular_triangulation_cell_base_3}
+\cgalHasModels{CGAL::Regular_triangulation_cell_base_3}
 \cgalHasModelsEnd
 
 \sa `RegularTriangulationTraits_3`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h
index 09d9ce0a0fc0..3e5f0e3ba47b 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/RegularTriangulationVertexBase_3.h
@@ -10,7 +10,7 @@ by adding a geometric point member.
 \cgalRefines{TriangulationDSVertexBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Regular_triangulation_vertex_base_3}
+\cgalHasModels{CGAL::Regular_triangulation_vertex_base_3}
 \cgalHasModelsEnd
 
 \sa `RegularTriangulationCellBase_3`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h
index 84add9f98c93..e7d5d046a083 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBaseWithInfo_3.h
@@ -9,7 +9,7 @@ and provides an additional information storage.
 \cgalRefines{TriangulationCellBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_cell_base_with_info_3}
+\cgalHasModels{CGAL::Triangulation_cell_base_with_info_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h
index 8b26efc32c47..f405c54afbaa 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationCellBase_3.h
@@ -11,8 +11,8 @@ structure apply.
 \cgalRefines{TriangulationDSCellBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_cell_base_3}
-\cgalModels{CGAL::Triangulation_cell_base_with_info_3}
+\cgalHasModels{CGAL::Triangulation_cell_base_3}
+\cgalHasModels{CGAL::Triangulation_cell_base_with_info_3}
 \cgalHasModelsEnd
 
 \sa `TriangulationVertexBase_3`
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h
index 37e2fd97140c..06b02f5c227d 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBaseWithInfo_3.h
@@ -9,7 +9,7 @@ and provides an additional information storage.
 \cgalRefines{TriangulationVertexBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_vertex_base_with_info_3}
+\cgalHasModels{CGAL::Triangulation_vertex_base_with_info_3}
 \cgalHasModelsEnd
 
 */
diff --git a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h
index 5110b87d71f1..45955a3a8f0e 100644
--- a/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h
+++ b/Triangulation_3/doc/Triangulation_3/Concepts/TriangulationVertexBase_3.h
@@ -10,8 +10,8 @@ for the triangulation data structure.
 \cgalRefines{TriangulationDSVertexBase_3}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_vertex_base_3}
-\cgalModels{CGAL::Triangulation_vertex_base_with_info_3}
+\cgalHasModels{CGAL::Triangulation_vertex_base_3}
+\cgalHasModels{CGAL::Triangulation_vertex_base_with_info_3}
 \cgalHasModelsEnd
 
 \sa `TriangulationCellBase_3`
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h
index df1da8edad50..6c4dcec4016a 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/DelaunayTriangulationOnSphereTraits_2.h
@@ -12,8 +12,8 @@ To the requirements listed within the concept `TriangulationOnSphereTraits_2`,
 this concept adds types and functors requirements related to build the dual on the sphere.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Delaunay_triangulation_on_sphere_traits_2}
-\cgalModels{CGAL::Projection_on_sphere_traits_3}
+\cgalHasModels{CGAL::Delaunay_triangulation_on_sphere_traits_2}
+\cgalHasModels{CGAL::Projection_on_sphere_traits_3}
 \cgalHasModelsEnd
 */
 class DelaunayTriangulationOnSphereTraits_2
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h
index 5e49109a4da4..b87fe2a5deb4 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereFaceBase_2.h
@@ -20,7 +20,7 @@ In this case, fictitious faces are added to the triangulation, called <i>ghost f
 such that the triangulation is a topological sphere.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_on_sphere_face_base_2<Traits, Fb>}
+\cgalHasModels{CGAL::Triangulation_on_sphere_face_base_2<Traits, Fb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h
index ea94dfc395c4..4ccc0171175d 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereTraits_2.h
@@ -14,8 +14,8 @@ In particular, the traits class is expected to contain information about the sph
 on which the points of the triangulation lie, as well as to provide means to change this information.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Delaunay_triangulation_on_sphere_traits_2}
-\cgalModels{CGAL::Projection_on_sphere_traits_3}
+\cgalHasModels{CGAL::Delaunay_triangulation_on_sphere_traits_2}
+\cgalHasModels{CGAL::Projection_on_sphere_traits_3}
 \cgalHasModelsEnd
 
 \sa `DelaunayTriangulationOnSphereTraits_2`
diff --git a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h
index 23f0fbce9e0c..721c593a9402 100644
--- a/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h
+++ b/Triangulation_on_sphere_2/doc/Triangulation_on_sphere_2/Concepts/TriangulationOnSphereVertexBase_2.h
@@ -10,7 +10,7 @@ It refines the concept `TriangulationDSVertexBase_2`, adding geometric informati
 the vertex base of a triangulation stores a point.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Triangulation_on_sphere_vertex_base_2<Traits,Vb>}
+\cgalHasModels{CGAL::Triangulation_on_sphere_vertex_base_2<Traits,Vb>}
 \cgalHasModelsEnd
 
 \sa `TriangulationDataStructure_2`
diff --git a/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h b/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h
index a39c04b2179b..0ec12be02973 100644
--- a/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h
+++ b/Visibility_2/doc/Visibility_2/Concepts/Visibility_2.h
@@ -7,9 +7,9 @@ A model of the `Visibility_2` concept can be attached to an `Arrangement_2` inst
 answer visibility queries within the faces of this arrangement.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Simple_polygon_visibility_2}
-\cgalModels{CGAL::Rotational_sweep_visibility_2}
-\cgalModels{CGAL::Triangular_expansion_visibility_2}
+\cgalHasModels{CGAL::Simple_polygon_visibility_2}
+\cgalHasModels{CGAL::Rotational_sweep_visibility_2}
+\cgalHasModels{CGAL::Triangular_expansion_visibility_2}
 \cgalHasModelsEnd
 
 */
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h
index bec40a64a9f5..22bf669821e0 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationPolicy_2.h
@@ -14,15 +14,15 @@ graph they take as an argument, the last ones does.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Identity_policy_2<DG,AT>}
-\cgalModels{CGAL::Apollonius_graph_degeneracy_removal_policy_2<AG2>}
-\cgalModels{CGAL::Apollonius_graph_caching_degeneracy_removal_policy_2<AG2>}
-\cgalModels{CGAL::Delaunay_triangulation_degeneracy_removal_policy_2<DT2>}
-\cgalModels{CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2<DT2>}
-\cgalModels{CGAL::Regular_triangulation_degeneracy_removal_policy_2<RT2>}
-\cgalModels{CGAL::Regular_triangulation_caching_degeneracy_removal_policy_2<RT2>}
-\cgalModels{CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2<SDG2>}
-\cgalModels{CGAL::Segment_Delaunay_graph_caching_degeneracy_removal_policy_2<SDG2>}
+\cgalHasModels{CGAL::Identity_policy_2<DG,AT>}
+\cgalHasModels{CGAL::Apollonius_graph_degeneracy_removal_policy_2<AG2>}
+\cgalHasModels{CGAL::Apollonius_graph_caching_degeneracy_removal_policy_2<AG2>}
+\cgalHasModels{CGAL::Delaunay_triangulation_degeneracy_removal_policy_2<DT2>}
+\cgalHasModels{CGAL::Delaunay_triangulation_caching_degeneracy_removal_policy_2<DT2>}
+\cgalHasModels{CGAL::Regular_triangulation_degeneracy_removal_policy_2<RT2>}
+\cgalHasModels{CGAL::Regular_triangulation_caching_degeneracy_removal_policy_2<RT2>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_degeneracy_removal_policy_2<SDG2>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_caching_degeneracy_removal_policy_2<SDG2>}
 \cgalHasModelsEnd
 
 \sa `DelaunayGraph_2`
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
index 452c25d3e022..56bc3b66ed64 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Concepts/AdaptationTraits_2.h
@@ -12,10 +12,10 @@ tag is provided for determining whether this functor is defined or not.
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Apollonius_graph_adaptation_traits_2<AG2>}
-\cgalModels{CGAL::Delaunay_triangulation_adaptation_traits_2<DT2>}
-\cgalModels{CGAL::Regular_triangulation_adaptation_traits_2<RT2>}
-\cgalModels{CGAL::Segment_Delaunay_graph_adaptation_traits_2<SDG2>}
+\cgalHasModels{CGAL::Apollonius_graph_adaptation_traits_2<AG2>}
+\cgalHasModels{CGAL::Delaunay_triangulation_adaptation_traits_2<DT2>}
+\cgalHasModels{CGAL::Regular_triangulation_adaptation_traits_2<RT2>}
+\cgalHasModels{CGAL::Segment_Delaunay_graph_adaptation_traits_2<SDG2>}
 \cgalHasModelsEnd
 
 \sa `DelaunayGraph_2`
diff --git a/Weights/doc/Weights/Concepts/BarycentricWeights_2.h b/Weights/doc/Weights/Concepts/BarycentricWeights_2.h
index 76104f359294..0a59f4ae4e16 100644
--- a/Weights/doc/Weights/Concepts/BarycentricWeights_2.h
+++ b/Weights/doc/Weights/Concepts/BarycentricWeights_2.h
@@ -6,9 +6,9 @@ A concept that describes the set of methods required in all classes used in
 the computation of 2D generalized barycentric weights.
 
 \cgalHasModelsBegin
-\cgalModels{CGAL::Weights::Wachspress_weights_2}
-\cgalModels{CGAL::Weights::Mean_value_weights_2}
-\cgalModels{CGAL::Weights::Discrete_harmonic_weights_2}
+\cgalHasModels{CGAL::Weights::Wachspress_weights_2}
+\cgalHasModels{CGAL::Weights::Mean_value_weights_2}
+\cgalHasModels{CGAL::Weights::Discrete_harmonic_weights_2}
 \cgalHasModelsEnd
 */
 class BarycentricWeights_2 {

From 7ec586ca736d070fb904252a043b4b85bc761cc2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 19 Jul 2023 10:47:17 +0200
Subject: [PATCH 0496/1398] Temporary workaround the selection item emitting
 way too many signals

---
 .../Plugins/Display/Heat_method_plugin.cpp    | 30 ++++++++++++-------
 1 file changed, 19 insertions(+), 11 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp
index 7ba691b6cf14..fc6d564379b2 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp
@@ -605,18 +605,25 @@ private Q_SLOTS:
     sm_item->setRenderingMode(GouraudPlusEdges);
     sm_item->redraw();
 
-    scene->addItem(heat_item);
-    scene->setSelectedItem(scene->item_id(sm_item));
+    auto heat_item_id = scene->addItem(heat_item);
+    scene->setSelectedItem(heat_item_id);
 
     // any change of sm_item destroys everything
-    connect(sm_item, &Scene_surface_mesh_item::itemChanged,
-            this, [this, sm_item, heat_item]()
-                  {
-                    sm_item->resetColors();
-                    removePluginProperties(sm_item);
-                    scene->erase(scene->item_id(heat_item));
-                    onItemIndicesSelected(scene->selectionIndices());
-                  });
+
+    // @todo do not emit itemChanged when the colors are reset
+    // @todo with qt6, single connection can be performed with `static_cast<Qt::ConnectionType>(Qt::SingleShotConnection)`
+    // see https://www.kdab.com/single-shot-connections/
+    auto connection = std::make_shared<QMetaObject::Connection>();
+    *connection = connect(sm_item, &Scene_surface_mesh_item::itemChanged,
+                          this, [this, sm_item, heat_item, connection]()
+                                {
+                                  QObject::disconnect(*connection);
+
+                                  sm_item->resetColors();
+                                  removePluginProperties(sm_item);
+                                  scene->erase(scene->item_id(heat_item));
+                                  onItemIndicesSelected(scene->selectionIndices());
+                                });
 
     connect(sm_item, &Scene_surface_mesh_item::aboutToBeDestroyed,
             this, [this, heat_item]()
@@ -765,7 +772,8 @@ private Q_SLOTS:
 
     Scene_polyhedron_selection_item* source_vertices = new Scene_polyhedron_selection_item(sm_item, mw);
     source_vertices->setName(tr("%1 (source vertices)").arg(sm_item->name()));
-    scene->addItem(source_vertices);
+    auto source_vertices_id = scene->addItem(source_vertices);
+    scene->setSelectedItem(source_vertices_id);
 
     link_mesh_and_selection(sm_item, source_vertices);
 

From e11bbab4f64f5601d94e3f18bffa9dd9fbc9b291 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 19 Jul 2023 22:32:52 +0200
Subject: [PATCH 0497/1398] De-compactify Simplicial_mesh_cell_base_3

Give it a cell base instead of re-implementing everything.
---
 SMDS_3/examples/SMDS_3/c3t3_example.cpp       |   2 +-
 .../CGAL/Simplicial_mesh_cell_base_3.h        | 234 ++++--------------
 SMDS_3/test/SMDS_3/test_simplicial_cb_vb.cpp  |   2 +-
 3 files changed, 52 insertions(+), 186 deletions(-)

diff --git a/SMDS_3/examples/SMDS_3/c3t3_example.cpp b/SMDS_3/examples/SMDS_3/c3t3_example.cpp
index 14501c395c1b..5ebb5cc3e358 100644
--- a/SMDS_3/examples/SMDS_3/c3t3_example.cpp
+++ b/SMDS_3/examples/SMDS_3/c3t3_example.cpp
@@ -21,7 +21,7 @@ using Surface_patch_index = unsigned char;
 using Curve_index = char;
 using Corner_index = short;
 
-using Cb = CGAL::Simplicial_mesh_cell_base_3<Subdomain_index, Surface_patch_index>;
+using Cb = CGAL::Simplicial_mesh_cell_base_3<K, Subdomain_index, Surface_patch_index>;
 using Vb = CGAL::Simplicial_mesh_vertex_base_3<K, Subdomain_index, Surface_patch_index,
                                                   Curve_index, Corner_index>;
 
diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
index ee49f5722364..b1a16d1b8f09 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
@@ -32,187 +32,48 @@
 
 namespace CGAL {
 
-// Class Simplicial_mesh_cell_3
-// Cell base class used for tetrahedral remeshing
-// Adds information to Cb about the cell of the input complex containing it
-template< class Subdomain_index_,
-          class Surface_patch_index_,
-          class TDS>
+template <typename Gt,
+          typename SubdomainIndex,
+          typename SurfacePatchIndex,
+          typename Cb>
 class Simplicial_mesh_cell_3
+  : public Cb
 {
 public:
-  using Triangulation_data_structure = TDS;
-  using Vertex_handle = typename TDS::Vertex_handle;
-  using Cell_handle = typename TDS::Cell_handle;
-  using Vertex = typename TDS::Vertex;
-  using Cell = typename TDS::Cell;
-  using TDS_data = typename TDS::Cell_data;
+  using Vertex_handle = typename Cb::Vertex_handle;
+  using Cell_handle = typename Cb::Cell_handle;
+
+  using Geom_traits = Gt;
 
   // Index Type
-  using Subdomain_index = Subdomain_index_;
-  using Surface_patch_index = Surface_patch_index_;
+  using Subdomain_index = SubdomainIndex;
+  using Surface_patch_index = SurfacePatchIndex;
 
 public:
-  // Constructors
   Simplicial_mesh_cell_3()
     : time_stamp_(std::size_t(-1))
   {}
 
   Simplicial_mesh_cell_3(const Simplicial_mesh_cell_3& rhs)
-    : N(rhs.N)
-    , V(rhs.V)
-    , time_stamp_(rhs.time_stamp_)
-    , subdomain_index_(rhs.subdomain_index_)
+    : Cb(static_cast<const Cb&>(rhs)),
+      time_stamp_(rhs.time_stamp_),
+      subdomain_index_(rhs.subdomain_index_)
   {
-    for(int i=0; i <4; i++){
+    for(int i=0; i <4; ++i)
       surface_index_table_[i] = rhs.surface_index_table_[i];
-    }
-  }
-
-  Simplicial_mesh_cell_3(Vertex_handle v0,
-                         Vertex_handle v1,
-                         Vertex_handle v2,
-                         Vertex_handle v3)
-    : V(CGAL::make_array(v0, v1, v2, v3))
-  {
-  }
-
-  Simplicial_mesh_cell_3(Vertex_handle v0,
-                         Vertex_handle v1,
-                         Vertex_handle v2,
-                         Vertex_handle v3,
-                         Cell_handle n0,
-                         Cell_handle n1,
-                         Cell_handle n2,
-                         Cell_handle n3)
-    : N(CGAL::make_array(n0, n1, n2, n3))
-    , V(CGAL::make_array(v0, v1, v2, v3))
-  {
-  }
-
-  // ACCESS FUNCTIONS
-  Vertex_handle vertex(int i) const
-  {
-    CGAL_precondition( i >= 0 && i <= 3 );
-    return V[i];
-  }
-
-  bool has_vertex(Vertex_handle v) const
-  {
-    return (V[0] == v) || (V[1] == v) || (V[2]== v) || (V[3]== v);
-  }
-
-  bool has_vertex(Vertex_handle v, int & i) const
-  {
-    if (v == V[0]) { i = 0; return true; }
-    if (v == V[1]) { i = 1; return true; }
-    if (v == V[2]) { i = 2; return true; }
-    if (v == V[3]) { i = 3; return true; }
-    return false;
-  }
-
-  int index(Vertex_handle v) const
-  {
-    if (v == V[0]) { return 0; }
-    if (v == V[1]) { return 1; }
-    if (v == V[2]) { return 2; }
-    CGAL_assertion( v == V[3] );
-    return 3;
-  }
-
-  Cell_handle neighbor(int i) const
-  {
-    CGAL_precondition( i >= 0 && i <= 3);
-    return N[i];
-  }
-
-  bool has_neighbor(Cell_handle n) const
-  {
-    return (N[0] == n) || (N[1] == n) || (N[2] == n) || (N[3] == n);
-  }
-
-  bool has_neighbor(Cell_handle n, int & i) const
-  {
-    if(n == N[0]){ i = 0; return true; }
-    if(n == N[1]){ i = 1; return true; }
-    if(n == N[2]){ i = 2; return true; }
-    if(n == N[3]){ i = 3; return true; }
-    return false;
   }
 
-  int index(Cell_handle n) const
-  {
-    if (n == N[0]) return 0;
-    if (n == N[1]) return 1;
-    if (n == N[2]) return 2;
-    CGAL_assertion( n == N[3] );
-    return 3;
-  }
-
-  // SETTING
-  void set_neighbor(int i, Cell_handle n)
-  {
-    CGAL_precondition( i >= 0 && i <= 3);
-    CGAL_precondition( this != n.operator->() );
-    N[i] = n;
-  }
+  Simplicial_mesh_cell_3(Vertex_handle v0, Vertex_handle v1,
+                         Vertex_handle v2, Vertex_handle v3)
+    : Cb(v0, v1, v2, v3)
+  { }
 
-  void set_neighbors()
-  {
-    N[0] = N[1] = N[2] = N[3] = Cell_handle();
-  }
-
-  void set_neighbors(Cell_handle n0, Cell_handle n1,
-                     Cell_handle n2, Cell_handle n3)
-  {
-    CGAL_precondition( this != n0.operator->() );
-    CGAL_precondition( this != n1.operator->() );
-    CGAL_precondition( this != n2.operator->() );
-    CGAL_precondition( this != n3.operator->() );
-    N[0] = n0;
-    N[1] = n1;
-    N[2] = n2;
-    N[3] = n3;
-  }
-
-  // CHECKING
-
-  // the following trivial is_valid allows
-  // the user of derived cell base classes
-  // to add their own purpose checking
-  bool is_valid(bool = false, int = 0) const
-  { return true; }
-
-  // For use by Compact_container.
-  void * for_compact_container() const { return N[0].for_compact_container(); }
-  void for_compact_container(void *p) { N[0].for_compact_container(p); }
-
-  // TDS internal data access functions.
-        TDS_data& tds_data()       { return _tds_data; }
-  const TDS_data& tds_data() const { return _tds_data; }
-
-  // We must override the functions that modify the vertices.
-  // And if the point inside a vertex is modified, we fail,
-  // but there's not much we can do for this now.
-  void set_vertex(int i, Vertex_handle v)
-  {
-    CGAL_precondition( i >= 0 && i <= 3);
-    V[i] = v;
-  }
-
-  void set_vertices()
-  {
-    V[0] = V[1] = V[2] = V[3] = Vertex_handle();
-  }
-
-  void set_vertices(Vertex_handle v0, Vertex_handle v1,
-                    Vertex_handle v2, Vertex_handle v3)
-  {
-    V[0] = v0;
-    V[1] = v1;
-    V[2] = v2;
-    V[3] = v3;
-  }
+  Simplicial_mesh_cell_3(Vertex_handle v0, Vertex_handle v1,
+                         Vertex_handle v2, Vertex_handle v3,
+                         Cell_handle n0, Cell_handle n1,
+                         Cell_handle n2, Cell_handle n3)
+    : Cb(v0, v1, v2, v3, n0, n1, n2, n3)
+  { }
 
   // Returns the index of the cell of the input complex that contains the cell
   Subdomain_index subdomain_index() const { return subdomain_index_; }
@@ -284,25 +145,22 @@ class Simplicial_mesh_cell_3
   /// Stores surface_index for each facet of the cell
   std::array<Surface_patch_index, 4> surface_index_table_ = {};
 
-  std::array<Cell_handle, 4> N;
-  std::array<Vertex_handle, 4> V;
-
   std::size_t time_stamp_;
 
   // The index of the cell of the input complex that contains me
   Subdomain_index subdomain_index_ = {};
 
-  TDS_data      _tds_data;
-
 public:
 
-  friend std::istream& operator>>(std::istream &is, Simplicial_mesh_cell_3 &c)
+  friend std::istream& operator>>(std::istream& is,
+                                  Simplicial_mesh_cell_3& c)
   {
     Subdomain_index index;
     if(IO::is_ascii(is))
       is >> index;
     else
       read(is, index);
+
     if(is) {
       c.set_subdomain_index(index);
       for(int i = 0; i < 4; ++i)
@@ -321,7 +179,8 @@ class Simplicial_mesh_cell_3
   }
 
   friend
-  std::ostream& operator<<(std::ostream &os, const Simplicial_mesh_cell_3&c)
+  std::ostream& operator<<(std::ostream& os,
+                           const Simplicial_mesh_cell_3& c)
   {
     if(IO::is_ascii(os))
       os << c.subdomain_index();
@@ -348,20 +207,24 @@ It is designed to serve as cell base class for.3D simplicial mesh data structure
 It stores and gives access to data about the complex the cell belongs to, such as the
 subdomain it belongs to or surface it takes part to.
 
-\tparam Subdomain_index Type of indices for subdomains of the discretized geometric domain.
+\tparam Gt is the geometric traits class.
+It must be a model of the concept `TriangulationTraits_3`
+
+\tparam SubdomainIndex Type of indices for subdomains of the discretized geometric domain.
 Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
 and `EqualityComparable`. The default constructed value must match the label
 of the exterior of the domain (which contains at least the unbounded component).
- It must match the `Subdomain_index` of the model
-  of the `MeshDomain_3` concept when used for mesh generation.
+It must match `MeshDomain_3::Subdomain_index` when used for mesh generation.
 
-\tparam Surface_patch_index Type of indices for surface patches (boundaries and interfaces)
+\tparam SurfacePatchIndex Type of indices for surface patches (boundaries and interfaces)
 of the discretized geometric domain.
 Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
 and `EqualityComparable`. The default constructed value must be the index value
 assigned to a non surface facet.
- It must match the `Surface_patch_index` of the model
-  of the `MeshDomain_3` concept when used for mesh generation.
+It must match `MeshDomain_3::Surface_patch_index` when used for mesh generation.
+
+\tparam Cb is the cell base class from which `Simplicial_mesh_cell_base_3` derives.
+It must be a model of the concept `TriangulationCellBase_3`.
 
 \cgalModels `SimplicialMeshCellBase_3`
 
@@ -370,21 +233,24 @@ assigned to a non surface facet.
 \sa `MeshDomain_3`
 \sa `MeshDomainWithFeatures_3`
 */
-template <typename Subdomain_index,
-          typename Surface_patch_index>
+template <typename Gt,
+          typename SubdomainIndex,
+          typename SurfacePatchIndex,
+          typename Cb = Triangulation_cell_base_3<Gt> >
 class Simplicial_mesh_cell_base_3
 {
 public:
   template <typename TDS2>
   struct Rebind_TDS
   {
-    typedef Simplicial_mesh_cell_3<Subdomain_index,
-                                   Surface_patch_index,
-                                   TDS2> Other;
+    using Cb2 = typename Cb::template Rebind_TDS<TDS2>::Other;
+    using Other = Simplicial_mesh_cell_3<Gt,
+                                         SubdomainIndex,
+                                         SurfacePatchIndex,
+                                         Cb2>;
   };
 };
 
-}  // end namespace CGAL
-
+} // namespace CGAL
 
 #endif // CGAL_SIMPLICIAL_MESH_CELL_BASE_3_H
diff --git a/SMDS_3/test/SMDS_3/test_simplicial_cb_vb.cpp b/SMDS_3/test/SMDS_3/test_simplicial_cb_vb.cpp
index 4f3531c5fcb4..e438200b9aaf 100644
--- a/SMDS_3/test/SMDS_3/test_simplicial_cb_vb.cpp
+++ b/SMDS_3/test/SMDS_3/test_simplicial_cb_vb.cpp
@@ -19,7 +19,7 @@ using Surface_patch_index = std::pair<int, int>;
 using Curve_index = char;
 using Corner_index = short;
 
-using Cb = CGAL::Simplicial_mesh_cell_base_3<Subdomain_index, Surface_patch_index>;
+using Cb = CGAL::Simplicial_mesh_cell_base_3<K, Subdomain_index, Surface_patch_index>;
 using Vb = CGAL::Simplicial_mesh_vertex_base_3<K, Subdomain_index, Surface_patch_index,
                                                   Curve_index, Corner_index>;
 

From 4e824edf32556207c27fbb6f67f7ce11c3d64ad0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 19 Jul 2023 22:35:56 +0200
Subject: [PATCH 0498/1398] Improve doc of Simplicial_vertex_base_3

---
 .../CGAL/Simplicial_mesh_vertex_base_3.h      | 98 +++++++++----------
 1 file changed, 46 insertions(+), 52 deletions(-)

diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
index 3f1a9c92d428..3fbea1748537 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
@@ -29,22 +29,20 @@
 #include <CGAL/Has_timestamp.h>
 
 #include <boost/variant.hpp>
+
 #include <tuple>
 
 namespace CGAL {
 
-//Class Simplicial_mesh_vertex_3
-//Adds information to Vb about the localization of the vertex in regards
-//to the 3D input complex.
-//\cgalModels `SimplicialMeshVertexBase_3`
-template<class GT,
-         typename Subdomain_index,
-         typename Surface_patch_index,
-         typename Curve_index,
-         typename Corner_index,
-         class Vb>
+// Adds information to Vb about the localization of the vertex in regards to the 3D input complex.
+template<typename Gt,
+         typename SubdomainIndex,
+         typename SurfacePatchIndex,
+         typename CurveIndex,
+         typename CornerIndex,
+         typename Vb>
 class Simplicial_mesh_vertex_3
-: public Vb
+  : public Vb
 {
 private :
   using Cmvb3_base = Vb;
@@ -53,10 +51,16 @@ private :
   using Vertex_handle = typename Vb::Vertex_handle;
 
   // Types
+  using Subdomain_index = SubdomainIndex;
+  using Surface_patch_index = SurfacePatchIndex;
+  using Curve_index = CurveIndex;
+  using Corner_index = CornerIndex;
+
   using Index = boost::variant<Subdomain_index, Surface_patch_index, Curve_index, Corner_index>;
-  using FT = typename GT::FT;
 
-  // Constructor
+  using FT = typename Gt::FT;
+
+public:
   Simplicial_mesh_vertex_3()
     : Vb()
     , number_of_incident_facets_(0)
@@ -215,39 +219,34 @@ index of the subcomplex it belongs to.
 \tparam Gt is the geometric traits class.
 It must be a model of the concept `TriangulationTraits_3`
 
-\tparam Subdomain_index Type of indices for subdomains of the discretized geometric domain.
+\tparam SubdomainIndex Type of indices for subdomains of the discretized geometric domain.
 Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
 and `EqualityComparable`. The default constructed value must match the label
 of the exterior of the domain (which contains at least the unbounded component).
- It must match the `Subdomain_index` of the model
-  of the `MeshDomain_3` concept when used for mesh generation.
+It must match `MeshDomain_3::Subdomain_index` when used for mesh generation.
 
-\tparam Surface_patch_index Type of indices for surface patches (boundaries and interfaces)
+\tparam SurfacePatchIndex Type of indices for surface patches (boundaries and interfaces)
 of the discretized geometric domain.
 Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
 and `EqualityComparable`. The default constructed value must be the index value
 assigned to a non surface facet.
- It must match the `Surface_patch_index` of the model
-  of the `MeshDomain_3` concept when used for mesh generation.
+It must match `MeshDomain_3::Surface_patch_index` when used for mesh generation.
 
-\tparam Curve_index Type of indices for curves (i.e. \f$ 1\f$-dimensional features)
+\tparam CurveIndex Type of indices for curves (i.e. \f$ 1\f$-dimensional features)
 of the discretized geometric domain.
 Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible` and
 `LessThanComparable`. The default constructed value must be the value for an edge which
 does not approximate a 1-dimensional feature of the geometric domain.
- It must match the `Curve_index` types of the model
-  of the `MeshDomainWithFeatures_3` concept when used for mesh generation.
+It must match `MeshDomainWithFeatures_3::Curve_index` when used for mesh generation.
 
-\tparam  Corner_index Type of indices for corners (i.e.\f$ 0\f$--dimensional features)
+\tparam CornerIndex Type of indices for corners (i.e.\f$ 0\f$--dimensional features)
 of the discretized geometric domain.
 It must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible` and
 `LessThanComparable`.
- It must match the `Corner_index` of the model
-  of the `MeshDomainWithFeatures_3` concept when used for mesh generation.
+It must match `MeshDomainWithFeatures_3::Corner_index` when used for mesh generation.
 
-\tparam Vb is the vertex base class. It has to be a model
-of the concept `TriangulationVertexBase_3` and defaults to
-`Triangulation_vertex_base_3<Gt>`.
+\tparam Vb is the vertex base class from which `Simplicial_mesh_vertex_base_3` derives.
+It must be a model of the concept `TriangulationVertexBase_3`.
 
 \cgalModels `SimplicialMeshVertexBase_3`
 
@@ -256,33 +255,28 @@ of the concept `TriangulationVertexBase_3` and defaults to
 \sa `MeshDomain_3`
 \sa `MeshDomainWithFeatures_3`
 */
-template<class Gt,
-         typename Subdomain_index,
-         typename Surface_patch_index,
-         typename Curve_index,
-         typename Corner_index,
-         class Vb = Triangulation_vertex_base_3<Gt> >
-struct Simplicial_mesh_vertex_base_3
+template<typename Gt,
+         typename SubdomainIndex,
+         typename SurfacePatchIndex,
+         typename CurveIndex,
+         typename CornerIndex,
+         typename Vb = CGAL::Triangulation_vertex_base_3<Gt> >
+class Simplicial_mesh_vertex_base_3
 {
-  using Triangulation_data_structure = internal::Dummy_tds_3;
-  using Vertex_handle = typename Triangulation_data_structure::Vertex_handle;
-  using Cell_handle = typename Triangulation_data_structure::Cell_handle;
-
-  template < class TDS3 >
-  struct Rebind_TDS {
-    using Vb3 = typename Vb::template Rebind_TDS<TDS3>::Other;
-    using Other = Simplicial_mesh_vertex_3 <Gt,
-      Subdomain_index,
-      Surface_patch_index,
-      Curve_index,
-      Corner_index,
-      Vb3>;
+public:
+  template <typename TDS2>
+  struct Rebind_TDS
+  {
+    using Vb2 = typename Vb::template Rebind_TDS<TDS2>::Other;
+    using Other = Simplicial_mesh_vertex_3<Gt,
+                                           SubdomainIndex,
+                                           SurfacePatchIndex,
+                                           CurveIndex,
+                                           CornerIndex,
+                                           Vb2>;
   };
 };
 
-
-}  // end namespace CGAL
-
-
+} // namespace CGAL
 
 #endif // CGAL_SIMPLICIAL_MESH_VERTEX_BASE_3_H

From 50fa1ee4def7a418f578c041095f9446aa2bbe2c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 19 Jul 2023 22:36:39 +0200
Subject: [PATCH 0499/1398] Various fixes for Remeshing_cell_base_3:

- Restore its correct API (as in CGAL 5.5): two templates, a traits,
and a cell base.
- It is not a model of SimplicialMeshCellBase_3, but of RemeshingCellBase_3
- It should not hardcode an inheritance to Simplicial_cell_base_3,
but take it as a template paramter's default value.
- Use FT instead of hardcoding 'double'
---
 .../Remeshing_cell_base_3.h                   | 74 +++++++++----------
 1 file changed, 33 insertions(+), 41 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
index d82378827267..30de338cdf7b 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
@@ -17,34 +17,35 @@
 
 #include <CGAL/Simplicial_mesh_cell_base_3.h>
 
-namespace CGAL
-{
-namespace Tetrahedral_remeshing
-{
+#include <CGAL/assertions.h>
+
+namespace CGAL {
+namespace Tetrahedral_remeshing {
 
-template<typename Subdomain_index,
-         typename Surface_patch_index,
-         typename TDS>
+template<typename Gt,
+         typename Cb>
 class Remeshing_cell_3
-  : public CGAL::Simplicial_mesh_cell_3<Subdomain_index,
-                                        Surface_patch_index,
-                                        TDS>
+  : public Cb
 {
-private:
-  using Base = CGAL::Simplicial_mesh_cell_3<Subdomain_index,
-                                            Surface_patch_index,
-                                            TDS>;
+public:
+  using FT = typename Gt::FT;
+
+  using Vertex_handle = typename Cb::Vertex_handle;
+  using Cell_handle = typename Cb::Cell_handle;
+
+  using Geom_traits = Gt;
 
 public:
-  using Base::Base;
+  using Cb::Cb; // constructors
 
-  void set_sliver_value(double value)
+public:
+  void set_sliver_value(const FT value)
   {
     sliver_cache_validity_ = true;
     sliver_value_ = value;
   }
 
-  double sliver_value() const
+  FT sliver_value() const
   {
     CGAL_assertion(is_cache_valid());
     return sliver_value_;
@@ -54,51 +55,42 @@ class Remeshing_cell_3
   void reset_cache_validity() const { sliver_cache_validity_ = false; }
 
 private:
-  double sliver_value_ = 0.;
+  FT sliver_value_ = 0.;
   mutable bool sliver_cache_validity_ = false;
 };
 
 /*!
 \ingroup PkgTetrahedralRemeshingClasses
 
-The class `Remeshing_cell_base_3` is a model of the concept `SimplicialMeshCellBase_3`.
+The class `Remeshing_cell_base_3` is a model of the concept `RemeshingCellBase_3`.
 It is designed to serve as cell base class for the 3D triangulation
 used in the tetrahedral remeshing process.
 
-\tparam Subdomain_index Type of indices for subdomains of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
-and `EqualityComparable`. The default constructed value must match the label
-of the exterior of the domain (which contains at least the unbounded component).
- It must match the `Subdomain_index` of the model
-  of the `MeshDomain_3` concept when used for mesh generation.
-
-\tparam Surface_patch_index Type of indices for surface patches (boundaries and interfaces)
-of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
-and `EqualityComparable`. The default constructed value must be the index value
-assigned to a non surface facet.
- It must match the `Surface_patch_index` of the model
-  of the `MeshDomain_3` concept when used for mesh generation.
+\tparam Gt is the geometric traits class.
+It has to be a model of the concept `RemeshingTriangulationTraits_3`.
+
+\tparam Cb is a cell base class from which `Remeshing_cell_base_3` derives.
+It must be a model of the `SimplicialMeshCellBase_3` concept.
 
 \cgalModels `RemeshingCellBase_3`
-\cgalModels `SimplicialMeshCellBase_3`
 
 */
-template<typename Subdomain_index = int,
-         typename Surface_patch_index = int>
+template<typename Gt,
+         typename Cb = CGAL::Simplicial_mesh_cell_base_3<Gt,
+                         int /*Subdomain_index*/,
+                         int /*Surface_patch_index*/> >
 class Remeshing_cell_base_3
 {
 public:
   template <typename TDS2>
   struct Rebind_TDS
   {
-    typedef Remeshing_cell_3<Subdomain_index,
-                             Surface_patch_index,
-                             TDS2> Other;
+    using Cb2 = typename Cb::template Rebind_TDS<TDS2>::Other;
+    using Other = Remeshing_cell_3<Gt, Cb2>;
   };
 };
 
-}//end namespace Tetrahedral_remeshing
-}//end namespace CGAL
+} // namespace Tetrahedral_remeshing
+} // namespace CGAL
 
 #endif //CGAL_TET_ADAPTIVE_REMESHING_CELL_BASE_3_H

From c0d0c0d01f691b9e77ba22a1b08b89e6cddcbd6d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 19 Jul 2023 22:39:17 +0200
Subject: [PATCH 0500/1398] Fix API of Remeshing_vertex_base_3:

It needs only to document a traits and a vertex base, not expose
index types as these are relevant to the Simplicial_vertex_base_3
class, which is not the systematic base.

It is a model of RemeshingVertexBase_3, not MeshVertexBase_3

The base needs to be a model of SimplicialVertexBase_3, not
TriangulationCellBase_3

Use the proper Rebind mechanism like the other vertex/cell classes
---
 .../Remeshing_triangulation_3.h               |  2 +-
 .../Remeshing_vertex_base_3.h                 | 57 +++++++++++--------
 2 files changed, 33 insertions(+), 26 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_triangulation_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_triangulation_3.h
index 7b2bb34f9cf3..3abdc9f034d6 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_triangulation_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_triangulation_3.h
@@ -52,7 +52,7 @@ and `Parallel_if_available_tag`.
 template<typename Gt,
          typename Concurrency_tag = CGAL::Sequential_tag,
          typename Vb = Remeshing_vertex_base_3<Gt>,
-         typename Cb = Remeshing_cell_base_3<>
+         typename Cb = Remeshing_cell_base_3<Gt>
 >
 class Remeshing_triangulation_3
   : public CGAL::Triangulation_3<Gt, CGAL::Triangulation_data_structure_3<Vb,Cb> >
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
index b828ffb08d1d..faab3950f9a0 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
@@ -17,44 +17,51 @@
 
 #include <CGAL/Simplicial_mesh_vertex_base_3.h>
 
-namespace CGAL
-{
-namespace Tetrahedral_remeshing
+namespace CGAL {
+namespace Tetrahedral_remeshing {
+
+template<typename Gt,
+         typename Vb>
+class Remeshing_vertex_3
+  : public Vb
 {
+public:
+  using Vb::Vb; // constructors
+};
 
 /*!
 \ingroup PkgTetrahedralRemeshingClasses
 
-The class `Remeshing_vertex_base_3` is a model of the concept `MeshVertexBase_3`.
+The class `Remeshing_vertex_base_3` is a model of the concept `RemeshingVertexBase_3`.
 It is designed to serve as vertex base class for the 3D triangulation
 used in the tetrahedral remeshing process.
 
 \tparam Gt is the geometric traits class.
-It has to be a model of the concept `RemeshingTriangulationTraits_3`.
+It must be a model of the concept `RemeshingTriangulationTraits_3`.
 
 \tparam Vb is a vertex base class from which `Remeshing_vertex_base_3` derives.
-It must be a model of the `TriangulationVertexBase_3` concept.
-It has the default value `Triangulation_vertex_base_3<Gt>`.
+It must be a model of the concept `SimplicialMeshVertexBase_3`.
 
 \cgalModels `RemeshingVertexBase_3`
-\cgalModels `SimplicialMeshVertexBase_3`
 */
-template<typename GT,
-  typename Subdomain_index = int,
-  typename Surface_patch_index = int,
-  typename Curve_index = int,
-  typename Corner_index = int,
-  typename Vb = CGAL::Triangulation_vertex_base_3<GT> >
-using Remeshing_vertex_base_3
-  = CGAL::Simplicial_mesh_vertex_base_3<GT,
-                                        Subdomain_index,
-                                        Surface_patch_index,
-                                        Curve_index,
-                                        Corner_index,
-                                        Vb>;
-
-}//end namespace Tetrahedral_remeshing
-
-}//end namespace CGAL
+template<typename Gt,
+         typename Vb = CGAL::Simplicial_mesh_vertex_base_3<Gt,
+                         int /*Subdomain_index*/,
+                         int /*Surface_patch_index*/,
+                         int /*Curve_index*/,
+                         int /*Corner_index*/> >
+class Remeshing_vertex_base_3
+{
+public:
+  template <typename TDS2>
+  struct Rebind_TDS
+  {
+    using Vb2 = typename Vb::template Rebind_TDS<TDS2>::Other;
+    using Other = Remeshing_vertex_3<Gt, Vb2>;
+  };
+};
+
+} // namespace Tetrahedral_remeshing
+} // namespace CGAL
 
 #endif //CGAL_TET_ADAPTIVE_REMESHING_VERTEX_BASE_3_H

From ce9fa95e2b60349875704976aad5456646d633d1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 19 Jul 2023 22:42:45 +0200
Subject: [PATCH 0501/1398] Fixes for the doc of tetrahedral remeshing

---
 .../include/CGAL/tetrahedral_remeshing.h               | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
index edd23bc2967b..f1be0dcf844a 100644
--- a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
+++ b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
@@ -61,7 +61,7 @@ namespace CGAL
 * subdomains throughout the remeshing process.
 *
 * Subdomains are defined by indices that
-* are stored in the cells of the input triangulation, following the `MeshCellBase_3`
+* are stored in the cells of the input triangulation, following the `SimplicialMeshCellBase_3`
 * concept (refined by `RemeshingCellBase_3`).
 * The surfacic interfaces between subdomains are formed by facets whose two incident cells
 * have different subdomain indices.
@@ -302,14 +302,14 @@ void tetrahedral_isotropic_remeshing(
 * @tparam Tr is the underlying triangulation for `Mesh_complex_3_in_triangulation_3`.
 *            It can be instantiated with any 3D regular triangulation of CGAL provided
 *            that its vertex and cell base classes are models of the concepts
-*            `MeshVertexBase_3` (refined by `RemeshingCellBase_3`)
-*            and `MeshCellBase_3` (refined by `RemeshingVertexBase_3`), respectively.
+*            `SimplicialMeshCellBase_3` (refined by `RemeshingCellBase_3`)
+*            and `SimplicialMeshVertexBase_3` (refined by `RemeshingVertexBase_3`), respectively.
 * @tparam CornerIndex is the type of the indices for feature corners.
 *            If `c3t3` has been generated using `CGAL::make_mesh_3()`, it must match
-*            the `Corner_index` type of the model of the `MeshDomainWithFeatures_3` concept used for mesh generation.
+*            `MeshDomainWithFeatures_3::Corner_index`.
 * @tparam CurveIndex is the type of the indices for feature curves.
 *            If `c3t3` has been generated using `CGAL::make_mesh_3()`, it must match
-*            the `Curve_index` type of the model of the `MeshDomainWithFeatures_3` concept used for mesh generation.
+*            `MeshDomainWithFeatures_3::Curve_index`.
 *
 * @param c3t3 the complex containing the triangulation to be remeshed.
 */

From 796baca1c59a5d87b413855aec9d30c9214c23e4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 19 Jul 2023 22:43:14 +0200
Subject: [PATCH 0502/1398] Misc minor cleaning

---
 .../Concepts/SimplicialMeshCellBase_3.h       | 14 +++----
 .../Concepts/SimplicialMeshVertexBase_3.h     |  2 +-
 .../CGAL/Mesh_complex_3_in_triangulation_3.h  |  2 +-
 .../CGAL/Simplicial_mesh_cell_base_3.h        | 39 ++++++++++---------
 .../CGAL/Simplicial_mesh_vertex_base_3.h      | 10 ++---
 .../Remeshing_triangulation_3.h               |  4 +-
 6 files changed, 35 insertions(+), 36 deletions(-)

diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
index ff424c1281da..6748b8d4ebc6 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshCellBase_3.h
@@ -4,14 +4,12 @@
 
 The concept `SimplicialMeshCellBase_3` describes the requirements
 for the `TriangulationDataStructure_3::Cell` type of the triangulation
-used in the 3D simplicial mesh data structure. The type `SimplicialMeshCellBase_3`
-refines the concept `TriangulationCellBase_3`
-and must be copy constructible.
-The concept `SimplicialMeshCellBase_3`
-includes a way to store and retrieve
-if a given cell of the triangulation is inside a subdomain or not,
-and which subdomain it belongs to
-in case of a multi-domain.
+used in a 3D simplicial mesh data structure.
+
+The type `SimplicialMeshCellBase_3` refines the concept `TriangulationCellBase_3`
+and must be copy constructible. The concept `SimplicialMeshCellBase_3` includes a way to store and
+retrieve if a given cell of the triangulation is inside a subdomain or not, and which subdomain it
+belongs to in case of a multi-domain.
 
 Moreover, this concept adds four markers per cell to mark the facets
 of the triangulation that are surface facets.
diff --git a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
index ad034bbb9823..aaba99a51605 100644
--- a/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
+++ b/SMDS_3/doc/SMDS_3/Concepts/SimplicialMeshVertexBase_3.h
@@ -4,7 +4,7 @@
 
 The concept `SimplicialMeshVertexBase_3` describes the requirements
 for the `Vertex` type of the triangulation
-used in the 3D simplicial mesh data structure. The type `SimplicialMeshVertexBase_3`
+used in a 3D simplicial mesh data structure. The type `SimplicialMeshVertexBase_3`
 refines the concept `TriangulationVertexBase_3`.
 It provides additional members to store and retrieve
 information about the location of the vertex with respect
diff --git a/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h b/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h
index 643de3ff7da8..3ce0ab4e55fd 100644
--- a/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h
+++ b/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h
@@ -151,7 +151,7 @@ namespace CGAL {
   vertex and cell base class are models of the concepts
   `SimplicialMeshVertexBase_3` and `SimplicialMeshCellBase_3`, respectively.
 
-  \tparam  CornerIndex Type of indices for corners (i.e.\f$ 0\f$--dimensional features)
+  \tparam CornerIndex Type of indices for corners (i.e.\f$ 0\f$--dimensional features)
   of the discretized geometric domain.
   It must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible` and
   `LessThanComparable`.
diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
index b1a16d1b8f09..ad535d2e402a 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
@@ -164,16 +164,16 @@ class Simplicial_mesh_cell_3
     if(is) {
       c.set_subdomain_index(index);
       for(int i = 0; i < 4; ++i)
-        {
-          Surface_patch_index i2;
-          if(IO::is_ascii(is))
-            is >> IO::iformat(i2);
-          else
-            {
-              read(is, i2);
-            }
-          c.set_surface_patch_index(i, i2);
-        }
+      {
+        Surface_patch_index i2;
+        if(IO::is_ascii(is))
+          is >> IO::iformat(i2);
+        else
+          {
+            read(is, i2);
+          }
+        c.set_surface_patch_index(i, i2);
+      }
     }
     return is;
   }
@@ -186,24 +186,25 @@ class Simplicial_mesh_cell_3
       os << c.subdomain_index();
     else
       write(os, c.subdomain_index());
+
     for(int i = 0; i < 4; ++i)
-      {
-        if(IO::is_ascii(os))
-          os << ' ' << IO::oformat(c.surface_patch_index(i));
-        else
-          write(os, c.surface_patch_index(i));
-      }
+    {
+      if(IO::is_ascii(os))
+        os << ' ' << IO::oformat(c.surface_patch_index(i));
+      else
+        write(os, c.surface_patch_index(i));
+    }
+
     return os;
   }
-
-};  // end class Simplicial_mesh_cell_3
+};
 
 /*!
 \ingroup PkgSMDS3Classes
 
 The class `Simplicial_mesh_cell_base_3`
 is a model of the concept `SimplicialMeshCellBase_3`.
-It is designed to serve as cell base class for.3D simplicial mesh data structures.
+It is designed to serve as cell base class for 3D simplicial mesh data structures.
 It stores and gives access to data about the complex the cell belongs to, such as the
 subdomain it belongs to or surface it takes part to.
 
diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
index 3fbea1748537..a25cf6f43295 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
@@ -159,8 +159,8 @@ private :
   std::size_t time_stamp_;
 
 public:
-
-  friend std::istream& operator>>(std::istream &is, Simplicial_mesh_vertex_3& v)
+  friend std::istream& operator>>(std::istream& is,
+                                  Simplicial_mesh_vertex_3& v)
   {
     is >> static_cast<Cmvb3_base&>(v);
     int dimension;
@@ -185,7 +185,8 @@ private :
     return is;
   }
 
-  friend std::ostream& operator<<(std::ostream &os, const Simplicial_mesh_vertex_3& v)
+  friend std::ostream& operator<<(std::ostream& os,
+                                  const Simplicial_mesh_vertex_3& v)
   {
     os << static_cast<const Cmvb3_base&>(v);
     if(IO::is_ascii(os)) {
@@ -204,8 +205,7 @@ private :
                                                 v.index());
     return os;
   }
-};  // end class Simplicial_mesh_vertex_3
-
+};
 
 /*!
 \ingroup PkgSMDS3Classes
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_triangulation_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_triangulation_3.h
index 3abdc9f034d6..f009ad0471cd 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_triangulation_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_triangulation_3.h
@@ -45,9 +45,9 @@ triangulation data structure.
 Possible values are `Sequential_tag` (the default), `Parallel_tag`,
 and `Parallel_if_available_tag`.
 
-\tparam Vb is a model of `RemeshingVertexBase_3`. It has the default value ` Remeshing_vertex_base_3<Gt>`.
-\tparam Cb is a model of `RemeshingCellBase_3`. It has the default value ` Remeshing_cell_base_3<Gt>`.
+\tparam Vb must be a model of `RemeshingVertexBase_3`.
 
+\tparam Cb must be model of `RemeshingCellBase_3`.
 */
 template<typename Gt,
          typename Concurrency_tag = CGAL::Sequential_tag,

From 3ad1825359c91c26b4ba0d3966fb467ab09efe97 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 21 Jul 2023 09:55:01 +0200
Subject: [PATCH 0503/1398] Fix not being able to Rebind multiple time SMDS_3 /
 Tet Remesh Vb/Cb

If you have the following construct:

  class V : public Vb;

  class V_base
  {
    struct Rebind --> V;
  }

then you cannot rebind twice. More vicious, if Vb
can rebind twice multiple times (e.g. it's a T3 Vb),
then it'll silently drop V in the stack, and rebind
only up to the rebound Vb!

Rebinding multiple times happens for example in
Triangulation_hierarchy_3 (Delaunay_triangulation_3
with Fast_locate).
---
 .../CGAL/Simplicial_mesh_cell_base_3.h        | 123 +++++++--------
 .../CGAL/Simplicial_mesh_vertex_base_3.h      | 142 +++++++++---------
 .../Remeshing_cell_base_3.h                   |  61 ++++----
 .../Remeshing_vertex_base_3.h                 |  15 +-
 4 files changed, 158 insertions(+), 183 deletions(-)

diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
index ad535d2e402a..3c882ad9b522 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
@@ -32,11 +32,46 @@
 
 namespace CGAL {
 
+/*!
+\ingroup PkgSMDS3Classes
+
+The class `Simplicial_mesh_cell_base_3`
+is a model of the concept `SimplicialMeshCellBase_3`.
+It is designed to serve as cell base class for 3D simplicial mesh data structures.
+It stores and gives access to data about the complex the cell belongs to, such as the
+subdomain it belongs to or surface it takes part to.
+
+\tparam Gt is the geometric traits class.
+It must be a model of the concept `TriangulationTraits_3`
+
+\tparam SubdomainIndex Type of indices for subdomains of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
+and `EqualityComparable`. The default constructed value must match the label
+of the exterior of the domain (which contains at least the unbounded component).
+It must match `MeshDomain_3::Subdomain_index` when used for mesh generation.
+
+\tparam SurfacePatchIndex Type of indices for surface patches (boundaries and interfaces)
+of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
+and `EqualityComparable`. The default constructed value must be the index value
+assigned to a non surface facet.
+It must match `MeshDomain_3::Surface_patch_index` when used for mesh generation.
+
+\tparam Cb is the cell base class from which `Simplicial_mesh_cell_base_3` derives.
+It must be a model of the concept `TriangulationCellBase_3`.
+
+\cgalModels `SimplicialMeshCellBase_3`
+
+\sa `CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
+\sa \link Mesh_cell_base_3 `CGAL::Mesh_cell_base_3`\endlink
+\sa `MeshDomain_3`
+\sa `MeshDomainWithFeatures_3`
+*/
 template <typename Gt,
           typename SubdomainIndex,
           typename SurfacePatchIndex,
-          typename Cb>
-class Simplicial_mesh_cell_3
+          typename Cb = Triangulation_cell_base_3<Gt> >
+class Simplicial_mesh_cell_base_3
   : public Cb
 {
 public:
@@ -50,11 +85,22 @@ class Simplicial_mesh_cell_3
   using Surface_patch_index = SurfacePatchIndex;
 
 public:
-  Simplicial_mesh_cell_3()
+  template <typename TDS2>
+  struct Rebind_TDS
+  {
+    using Cb2 = typename Cb::template Rebind_TDS<TDS2>::Other;
+    using Other = Simplicial_mesh_cell_base_3<Gt,
+                                              SubdomainIndex,
+                                              SurfacePatchIndex,
+                                              Cb2>;
+  };
+
+public:
+  Simplicial_mesh_cell_base_3()
     : time_stamp_(std::size_t(-1))
   {}
 
-  Simplicial_mesh_cell_3(const Simplicial_mesh_cell_3& rhs)
+  Simplicial_mesh_cell_base_3(const Simplicial_mesh_cell_base_3& rhs)
     : Cb(static_cast<const Cb&>(rhs)),
       time_stamp_(rhs.time_stamp_),
       subdomain_index_(rhs.subdomain_index_)
@@ -63,15 +109,15 @@ class Simplicial_mesh_cell_3
       surface_index_table_[i] = rhs.surface_index_table_[i];
   }
 
-  Simplicial_mesh_cell_3(Vertex_handle v0, Vertex_handle v1,
-                         Vertex_handle v2, Vertex_handle v3)
+  Simplicial_mesh_cell_base_3(Vertex_handle v0, Vertex_handle v1,
+                              Vertex_handle v2, Vertex_handle v3)
     : Cb(v0, v1, v2, v3)
   { }
 
-  Simplicial_mesh_cell_3(Vertex_handle v0, Vertex_handle v1,
-                         Vertex_handle v2, Vertex_handle v3,
-                         Cell_handle n0, Cell_handle n1,
-                         Cell_handle n2, Cell_handle n3)
+  Simplicial_mesh_cell_base_3(Vertex_handle v0, Vertex_handle v1,
+                              Vertex_handle v2, Vertex_handle v3,
+                              Cell_handle n0, Cell_handle n1,
+                              Cell_handle n2, Cell_handle n3)
     : Cb(v0, v1, v2, v3, n0, n1, n2, n3)
   { }
 
@@ -153,7 +199,7 @@ class Simplicial_mesh_cell_3
 public:
 
   friend std::istream& operator>>(std::istream& is,
-                                  Simplicial_mesh_cell_3& c)
+                                  Simplicial_mesh_cell_base_3& c)
   {
     Subdomain_index index;
     if(IO::is_ascii(is))
@@ -180,7 +226,7 @@ class Simplicial_mesh_cell_3
 
   friend
   std::ostream& operator<<(std::ostream& os,
-                           const Simplicial_mesh_cell_3& c)
+                           const Simplicial_mesh_cell_base_3& c)
   {
     if(IO::is_ascii(os))
       os << c.subdomain_index();
@@ -199,59 +245,6 @@ class Simplicial_mesh_cell_3
   }
 };
 
-/*!
-\ingroup PkgSMDS3Classes
-
-The class `Simplicial_mesh_cell_base_3`
-is a model of the concept `SimplicialMeshCellBase_3`.
-It is designed to serve as cell base class for 3D simplicial mesh data structures.
-It stores and gives access to data about the complex the cell belongs to, such as the
-subdomain it belongs to or surface it takes part to.
-
-\tparam Gt is the geometric traits class.
-It must be a model of the concept `TriangulationTraits_3`
-
-\tparam SubdomainIndex Type of indices for subdomains of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
-and `EqualityComparable`. The default constructed value must match the label
-of the exterior of the domain (which contains at least the unbounded component).
-It must match `MeshDomain_3::Subdomain_index` when used for mesh generation.
-
-\tparam SurfacePatchIndex Type of indices for surface patches (boundaries and interfaces)
-of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
-and `EqualityComparable`. The default constructed value must be the index value
-assigned to a non surface facet.
-It must match `MeshDomain_3::Surface_patch_index` when used for mesh generation.
-
-\tparam Cb is the cell base class from which `Simplicial_mesh_cell_base_3` derives.
-It must be a model of the concept `TriangulationCellBase_3`.
-
-\cgalModels `SimplicialMeshCellBase_3`
-
-\sa `CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
-\sa \link Mesh_cell_base_3 `CGAL::Mesh_cell_base_3`\endlink
-\sa `MeshDomain_3`
-\sa `MeshDomainWithFeatures_3`
-*/
-template <typename Gt,
-          typename SubdomainIndex,
-          typename SurfacePatchIndex,
-          typename Cb = Triangulation_cell_base_3<Gt> >
-class Simplicial_mesh_cell_base_3
-{
-public:
-  template <typename TDS2>
-  struct Rebind_TDS
-  {
-    using Cb2 = typename Cb::template Rebind_TDS<TDS2>::Other;
-    using Other = Simplicial_mesh_cell_3<Gt,
-                                         SubdomainIndex,
-                                         SurfacePatchIndex,
-                                         Cb2>;
-  };
-};
-
 } // namespace CGAL
 
 #endif // CGAL_SIMPLICIAL_MESH_CELL_BASE_3_H
diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
index a25cf6f43295..1b47ea8de4f4 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
@@ -35,13 +35,62 @@
 namespace CGAL {
 
 // Adds information to Vb about the localization of the vertex in regards to the 3D input complex.
+
+/*!
+\ingroup PkgSMDS3Classes
+
+The class `Simplicial_mesh_vertex_base_3` is a model of the concept
+`SimplicialMeshVertexBase_3`.
+It is designed to serve as vertex base class for 3D simplicial mesh data structures.
+It stores and gives access to data about the complex the vertex belongs to, such as the
+index of the subcomplex it belongs to.
+
+\tparam Gt is the geometric traits class.
+It must be a model of the concept `TriangulationTraits_3`
+
+\tparam SubdomainIndex Type of indices for subdomains of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
+and `EqualityComparable`. The default constructed value must match the label
+of the exterior of the domain (which contains at least the unbounded component).
+It must match `MeshDomain_3::Subdomain_index` when used for mesh generation.
+
+\tparam SurfacePatchIndex Type of indices for surface patches (boundaries and interfaces)
+of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
+and `EqualityComparable`. The default constructed value must be the index value
+assigned to a non surface facet.
+It must match `MeshDomain_3::Surface_patch_index` when used for mesh generation.
+
+\tparam CurveIndex Type of indices for curves (i.e. \f$ 1\f$-dimensional features)
+of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible` and
+`LessThanComparable`. The default constructed value must be the value for an edge which
+does not approximate a 1-dimensional feature of the geometric domain.
+It must match `MeshDomainWithFeatures_3::Curve_index` when used for mesh generation.
+
+\tparam CornerIndex Type of indices for corners (i.e.\f$ 0\f$--dimensional features)
+of the discretized geometric domain.
+It must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible` and
+`LessThanComparable`.
+It must match `MeshDomainWithFeatures_3::Corner_index` when used for mesh generation.
+
+\tparam Vb is the vertex base class from which `Simplicial_mesh_vertex_base_3` derives.
+It must be a model of the concept `TriangulationVertexBase_3`.
+
+\cgalModels `SimplicialMeshVertexBase_3`
+
+\sa `CGAL::Mesh_complex_3_in_triangulation_3`
+\sa \link Mesh_vertex_base_3 `CGAL::Mesh_vertex_base_3`\endlink
+\sa `MeshDomain_3`
+\sa `MeshDomainWithFeatures_3`
+*/
 template<typename Gt,
          typename SubdomainIndex,
          typename SurfacePatchIndex,
          typename CurveIndex,
          typename CornerIndex,
-         typename Vb>
-class Simplicial_mesh_vertex_3
+         typename Vb = CGAL::Triangulation_vertex_base_3<Gt> >
+class Simplicial_mesh_vertex_base_3
   : public Vb
 {
 private :
@@ -61,7 +110,20 @@ private :
   using FT = typename Gt::FT;
 
 public:
-  Simplicial_mesh_vertex_3()
+  template <typename TDS2>
+  struct Rebind_TDS
+  {
+    using Vb2 = typename Vb::template Rebind_TDS<TDS2>::Other;
+    using Other = Simplicial_mesh_vertex_base_3<Gt,
+                                                SubdomainIndex,
+                                                SurfacePatchIndex,
+                                                CurveIndex,
+                                                CornerIndex,
+                                                Vb2>;
+  };
+
+public:
+  Simplicial_mesh_vertex_base_3()
     : Vb()
     , number_of_incident_facets_(0)
     , number_of_components_(0)
@@ -160,7 +222,7 @@ private :
 
 public:
   friend std::istream& operator>>(std::istream& is,
-                                  Simplicial_mesh_vertex_3& v)
+                                  Simplicial_mesh_vertex_base_3& v)
   {
     is >> static_cast<Cmvb3_base&>(v);
     int dimension;
@@ -186,7 +248,7 @@ private :
   }
 
   friend std::ostream& operator<<(std::ostream& os,
-                                  const Simplicial_mesh_vertex_3& v)
+                                  const Simplicial_mesh_vertex_base_3& v)
   {
     os << static_cast<const Cmvb3_base&>(v);
     if(IO::is_ascii(os)) {
@@ -207,76 +269,6 @@ private :
   }
 };
 
-/*!
-\ingroup PkgSMDS3Classes
-
-The class `Simplicial_mesh_vertex_base_3` is a model of the concept
-`SimplicialMeshVertexBase_3`.
-It is designed to serve as vertex base class for 3D simplicial mesh data structures.
-It stores and gives access to data about the complex the vertex belongs to, such as the
-index of the subcomplex it belongs to.
-
-\tparam Gt is the geometric traits class.
-It must be a model of the concept `TriangulationTraits_3`
-
-\tparam SubdomainIndex Type of indices for subdomains of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
-and `EqualityComparable`. The default constructed value must match the label
-of the exterior of the domain (which contains at least the unbounded component).
-It must match `MeshDomain_3::Subdomain_index` when used for mesh generation.
-
-\tparam SurfacePatchIndex Type of indices for surface patches (boundaries and interfaces)
-of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
-and `EqualityComparable`. The default constructed value must be the index value
-assigned to a non surface facet.
-It must match `MeshDomain_3::Surface_patch_index` when used for mesh generation.
-
-\tparam CurveIndex Type of indices for curves (i.e. \f$ 1\f$-dimensional features)
-of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible` and
-`LessThanComparable`. The default constructed value must be the value for an edge which
-does not approximate a 1-dimensional feature of the geometric domain.
-It must match `MeshDomainWithFeatures_3::Curve_index` when used for mesh generation.
-
-\tparam CornerIndex Type of indices for corners (i.e.\f$ 0\f$--dimensional features)
-of the discretized geometric domain.
-It must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible` and
-`LessThanComparable`.
-It must match `MeshDomainWithFeatures_3::Corner_index` when used for mesh generation.
-
-\tparam Vb is the vertex base class from which `Simplicial_mesh_vertex_base_3` derives.
-It must be a model of the concept `TriangulationVertexBase_3`.
-
-\cgalModels `SimplicialMeshVertexBase_3`
-
-\sa `CGAL::Mesh_complex_3_in_triangulation_3`
-\sa \link Mesh_vertex_base_3 `CGAL::Mesh_vertex_base_3`\endlink
-\sa `MeshDomain_3`
-\sa `MeshDomainWithFeatures_3`
-*/
-template<typename Gt,
-         typename SubdomainIndex,
-         typename SurfacePatchIndex,
-         typename CurveIndex,
-         typename CornerIndex,
-         typename Vb = CGAL::Triangulation_vertex_base_3<Gt> >
-class Simplicial_mesh_vertex_base_3
-{
-public:
-  template <typename TDS2>
-  struct Rebind_TDS
-  {
-    using Vb2 = typename Vb::template Rebind_TDS<TDS2>::Other;
-    using Other = Simplicial_mesh_vertex_3<Gt,
-                                           SubdomainIndex,
-                                           SurfacePatchIndex,
-                                           CurveIndex,
-                                           CornerIndex,
-                                           Vb2>;
-  };
-};
-
 } // namespace CGAL
 
 #endif // CGAL_SIMPLICIAL_MESH_VERTEX_BASE_3_H
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
index 30de338cdf7b..162cfa27f211 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
@@ -22,9 +22,27 @@
 namespace CGAL {
 namespace Tetrahedral_remeshing {
 
+/*!
+\ingroup PkgTetrahedralRemeshingClasses
+
+The class `Remeshing_cell_base_3` is a model of the concept `RemeshingCellBase_3`.
+It is designed to serve as cell base class for the 3D triangulation
+used in the tetrahedral remeshing process.
+
+\tparam Gt is the geometric traits class.
+It has to be a model of the concept `RemeshingTriangulationTraits_3`.
+
+\tparam Cb is a cell base class from which `Remeshing_cell_base_3` derives.
+It must be a model of the `SimplicialMeshCellBase_3` concept.
+
+\cgalModels `RemeshingCellBase_3`
+
+*/
 template<typename Gt,
-         typename Cb>
-class Remeshing_cell_3
+         typename Cb = CGAL::Simplicial_mesh_cell_base_3<Gt,
+                         int /*Subdomain_index*/,
+                         int /*Surface_patch_index*/> >
+class Remeshing_cell_base_3
   : public Cb
 {
 public:
@@ -35,6 +53,14 @@ class Remeshing_cell_3
 
   using Geom_traits = Gt;
 
+public:
+  template <typename TDS2>
+  struct Rebind_TDS
+  {
+    using Cb2 = typename Cb::template Rebind_TDS<TDS2>::Other;
+    using Other = Remeshing_cell_base_3<Gt, Cb2>;
+  };
+
 public:
   using Cb::Cb; // constructors
 
@@ -59,37 +85,6 @@ class Remeshing_cell_3
   mutable bool sliver_cache_validity_ = false;
 };
 
-/*!
-\ingroup PkgTetrahedralRemeshingClasses
-
-The class `Remeshing_cell_base_3` is a model of the concept `RemeshingCellBase_3`.
-It is designed to serve as cell base class for the 3D triangulation
-used in the tetrahedral remeshing process.
-
-\tparam Gt is the geometric traits class.
-It has to be a model of the concept `RemeshingTriangulationTraits_3`.
-
-\tparam Cb is a cell base class from which `Remeshing_cell_base_3` derives.
-It must be a model of the `SimplicialMeshCellBase_3` concept.
-
-\cgalModels `RemeshingCellBase_3`
-
-*/
-template<typename Gt,
-         typename Cb = CGAL::Simplicial_mesh_cell_base_3<Gt,
-                         int /*Subdomain_index*/,
-                         int /*Surface_patch_index*/> >
-class Remeshing_cell_base_3
-{
-public:
-  template <typename TDS2>
-  struct Rebind_TDS
-  {
-    using Cb2 = typename Cb::template Rebind_TDS<TDS2>::Other;
-    using Other = Remeshing_cell_3<Gt, Cb2>;
-  };
-};
-
 } // namespace Tetrahedral_remeshing
 } // namespace CGAL
 
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
index faab3950f9a0..34e5fb0855c0 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
@@ -20,15 +20,6 @@
 namespace CGAL {
 namespace Tetrahedral_remeshing {
 
-template<typename Gt,
-         typename Vb>
-class Remeshing_vertex_3
-  : public Vb
-{
-public:
-  using Vb::Vb; // constructors
-};
-
 /*!
 \ingroup PkgTetrahedralRemeshingClasses
 
@@ -51,14 +42,18 @@ template<typename Gt,
                          int /*Curve_index*/,
                          int /*Corner_index*/> >
 class Remeshing_vertex_base_3
+  : public Vb
 {
 public:
   template <typename TDS2>
   struct Rebind_TDS
   {
     using Vb2 = typename Vb::template Rebind_TDS<TDS2>::Other;
-    using Other = Remeshing_vertex_3<Gt, Vb2>;
+    using Other = Remeshing_vertex_base_3<Gt, Vb2>;
   };
+
+public:
+  using Vb::Vb; // constructors
 };
 
 } // namespace Tetrahedral_remeshing

From 069756ba3c350880c8d8e10bb57952999c528c26 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 21 Jul 2023 09:55:01 +0200
Subject: [PATCH 0504/1398] Fix not being able to Rebind multiple time SMDS_3 /
 Tet Remesh Vb/Cb

If you have the following construct:

  class V : public Vb;

  class V_base
  {
    struct Rebind --> V;
  }

then you cannot rebind twice. More vicious, if Vb
can rebind twice multiple times (e.g. it's a T3 Vb),
then it'll silently drop V in the stack, and rebind
only up to the rebound Vb!

Rebinding multiple times happens for example in
Triangulation_hierarchy_3 (Delaunay_triangulation_3
with Fast_locate).
---
 .../CGAL/Simplicial_mesh_cell_base_3.h        | 123 +++++++--------
 .../CGAL/Simplicial_mesh_vertex_base_3.h      | 142 +++++++++---------
 .../Remeshing_cell_base_3.h                   |  61 ++++----
 .../Remeshing_vertex_base_3.h                 |  15 +-
 4 files changed, 158 insertions(+), 183 deletions(-)

diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
index ad535d2e402a..3c882ad9b522 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_cell_base_3.h
@@ -32,11 +32,46 @@
 
 namespace CGAL {
 
+/*!
+\ingroup PkgSMDS3Classes
+
+The class `Simplicial_mesh_cell_base_3`
+is a model of the concept `SimplicialMeshCellBase_3`.
+It is designed to serve as cell base class for 3D simplicial mesh data structures.
+It stores and gives access to data about the complex the cell belongs to, such as the
+subdomain it belongs to or surface it takes part to.
+
+\tparam Gt is the geometric traits class.
+It must be a model of the concept `TriangulationTraits_3`
+
+\tparam SubdomainIndex Type of indices for subdomains of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
+and `EqualityComparable`. The default constructed value must match the label
+of the exterior of the domain (which contains at least the unbounded component).
+It must match `MeshDomain_3::Subdomain_index` when used for mesh generation.
+
+\tparam SurfacePatchIndex Type of indices for surface patches (boundaries and interfaces)
+of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
+and `EqualityComparable`. The default constructed value must be the index value
+assigned to a non surface facet.
+It must match `MeshDomain_3::Surface_patch_index` when used for mesh generation.
+
+\tparam Cb is the cell base class from which `Simplicial_mesh_cell_base_3` derives.
+It must be a model of the concept `TriangulationCellBase_3`.
+
+\cgalModels `SimplicialMeshCellBase_3`
+
+\sa `CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
+\sa \link Mesh_cell_base_3 `CGAL::Mesh_cell_base_3`\endlink
+\sa `MeshDomain_3`
+\sa `MeshDomainWithFeatures_3`
+*/
 template <typename Gt,
           typename SubdomainIndex,
           typename SurfacePatchIndex,
-          typename Cb>
-class Simplicial_mesh_cell_3
+          typename Cb = Triangulation_cell_base_3<Gt> >
+class Simplicial_mesh_cell_base_3
   : public Cb
 {
 public:
@@ -50,11 +85,22 @@ class Simplicial_mesh_cell_3
   using Surface_patch_index = SurfacePatchIndex;
 
 public:
-  Simplicial_mesh_cell_3()
+  template <typename TDS2>
+  struct Rebind_TDS
+  {
+    using Cb2 = typename Cb::template Rebind_TDS<TDS2>::Other;
+    using Other = Simplicial_mesh_cell_base_3<Gt,
+                                              SubdomainIndex,
+                                              SurfacePatchIndex,
+                                              Cb2>;
+  };
+
+public:
+  Simplicial_mesh_cell_base_3()
     : time_stamp_(std::size_t(-1))
   {}
 
-  Simplicial_mesh_cell_3(const Simplicial_mesh_cell_3& rhs)
+  Simplicial_mesh_cell_base_3(const Simplicial_mesh_cell_base_3& rhs)
     : Cb(static_cast<const Cb&>(rhs)),
       time_stamp_(rhs.time_stamp_),
       subdomain_index_(rhs.subdomain_index_)
@@ -63,15 +109,15 @@ class Simplicial_mesh_cell_3
       surface_index_table_[i] = rhs.surface_index_table_[i];
   }
 
-  Simplicial_mesh_cell_3(Vertex_handle v0, Vertex_handle v1,
-                         Vertex_handle v2, Vertex_handle v3)
+  Simplicial_mesh_cell_base_3(Vertex_handle v0, Vertex_handle v1,
+                              Vertex_handle v2, Vertex_handle v3)
     : Cb(v0, v1, v2, v3)
   { }
 
-  Simplicial_mesh_cell_3(Vertex_handle v0, Vertex_handle v1,
-                         Vertex_handle v2, Vertex_handle v3,
-                         Cell_handle n0, Cell_handle n1,
-                         Cell_handle n2, Cell_handle n3)
+  Simplicial_mesh_cell_base_3(Vertex_handle v0, Vertex_handle v1,
+                              Vertex_handle v2, Vertex_handle v3,
+                              Cell_handle n0, Cell_handle n1,
+                              Cell_handle n2, Cell_handle n3)
     : Cb(v0, v1, v2, v3, n0, n1, n2, n3)
   { }
 
@@ -153,7 +199,7 @@ class Simplicial_mesh_cell_3
 public:
 
   friend std::istream& operator>>(std::istream& is,
-                                  Simplicial_mesh_cell_3& c)
+                                  Simplicial_mesh_cell_base_3& c)
   {
     Subdomain_index index;
     if(IO::is_ascii(is))
@@ -180,7 +226,7 @@ class Simplicial_mesh_cell_3
 
   friend
   std::ostream& operator<<(std::ostream& os,
-                           const Simplicial_mesh_cell_3& c)
+                           const Simplicial_mesh_cell_base_3& c)
   {
     if(IO::is_ascii(os))
       os << c.subdomain_index();
@@ -199,59 +245,6 @@ class Simplicial_mesh_cell_3
   }
 };
 
-/*!
-\ingroup PkgSMDS3Classes
-
-The class `Simplicial_mesh_cell_base_3`
-is a model of the concept `SimplicialMeshCellBase_3`.
-It is designed to serve as cell base class for 3D simplicial mesh data structures.
-It stores and gives access to data about the complex the cell belongs to, such as the
-subdomain it belongs to or surface it takes part to.
-
-\tparam Gt is the geometric traits class.
-It must be a model of the concept `TriangulationTraits_3`
-
-\tparam SubdomainIndex Type of indices for subdomains of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
-and `EqualityComparable`. The default constructed value must match the label
-of the exterior of the domain (which contains at least the unbounded component).
-It must match `MeshDomain_3::Subdomain_index` when used for mesh generation.
-
-\tparam SurfacePatchIndex Type of indices for surface patches (boundaries and interfaces)
-of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
-and `EqualityComparable`. The default constructed value must be the index value
-assigned to a non surface facet.
-It must match `MeshDomain_3::Surface_patch_index` when used for mesh generation.
-
-\tparam Cb is the cell base class from which `Simplicial_mesh_cell_base_3` derives.
-It must be a model of the concept `TriangulationCellBase_3`.
-
-\cgalModels `SimplicialMeshCellBase_3`
-
-\sa `CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
-\sa \link Mesh_cell_base_3 `CGAL::Mesh_cell_base_3`\endlink
-\sa `MeshDomain_3`
-\sa `MeshDomainWithFeatures_3`
-*/
-template <typename Gt,
-          typename SubdomainIndex,
-          typename SurfacePatchIndex,
-          typename Cb = Triangulation_cell_base_3<Gt> >
-class Simplicial_mesh_cell_base_3
-{
-public:
-  template <typename TDS2>
-  struct Rebind_TDS
-  {
-    using Cb2 = typename Cb::template Rebind_TDS<TDS2>::Other;
-    using Other = Simplicial_mesh_cell_3<Gt,
-                                         SubdomainIndex,
-                                         SurfacePatchIndex,
-                                         Cb2>;
-  };
-};
-
 } // namespace CGAL
 
 #endif // CGAL_SIMPLICIAL_MESH_CELL_BASE_3_H
diff --git a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
index a25cf6f43295..1b47ea8de4f4 100644
--- a/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
+++ b/SMDS_3/include/CGAL/Simplicial_mesh_vertex_base_3.h
@@ -35,13 +35,62 @@
 namespace CGAL {
 
 // Adds information to Vb about the localization of the vertex in regards to the 3D input complex.
+
+/*!
+\ingroup PkgSMDS3Classes
+
+The class `Simplicial_mesh_vertex_base_3` is a model of the concept
+`SimplicialMeshVertexBase_3`.
+It is designed to serve as vertex base class for 3D simplicial mesh data structures.
+It stores and gives access to data about the complex the vertex belongs to, such as the
+index of the subcomplex it belongs to.
+
+\tparam Gt is the geometric traits class.
+It must be a model of the concept `TriangulationTraits_3`
+
+\tparam SubdomainIndex Type of indices for subdomains of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
+and `EqualityComparable`. The default constructed value must match the label
+of the exterior of the domain (which contains at least the unbounded component).
+It must match `MeshDomain_3::Subdomain_index` when used for mesh generation.
+
+\tparam SurfacePatchIndex Type of indices for surface patches (boundaries and interfaces)
+of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
+and `EqualityComparable`. The default constructed value must be the index value
+assigned to a non surface facet.
+It must match `MeshDomain_3::Surface_patch_index` when used for mesh generation.
+
+\tparam CurveIndex Type of indices for curves (i.e. \f$ 1\f$-dimensional features)
+of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible` and
+`LessThanComparable`. The default constructed value must be the value for an edge which
+does not approximate a 1-dimensional feature of the geometric domain.
+It must match `MeshDomainWithFeatures_3::Curve_index` when used for mesh generation.
+
+\tparam CornerIndex Type of indices for corners (i.e.\f$ 0\f$--dimensional features)
+of the discretized geometric domain.
+It must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible` and
+`LessThanComparable`.
+It must match `MeshDomainWithFeatures_3::Corner_index` when used for mesh generation.
+
+\tparam Vb is the vertex base class from which `Simplicial_mesh_vertex_base_3` derives.
+It must be a model of the concept `TriangulationVertexBase_3`.
+
+\cgalModels `SimplicialMeshVertexBase_3`
+
+\sa `CGAL::Mesh_complex_3_in_triangulation_3`
+\sa \link Mesh_vertex_base_3 `CGAL::Mesh_vertex_base_3`\endlink
+\sa `MeshDomain_3`
+\sa `MeshDomainWithFeatures_3`
+*/
 template<typename Gt,
          typename SubdomainIndex,
          typename SurfacePatchIndex,
          typename CurveIndex,
          typename CornerIndex,
-         typename Vb>
-class Simplicial_mesh_vertex_3
+         typename Vb = CGAL::Triangulation_vertex_base_3<Gt> >
+class Simplicial_mesh_vertex_base_3
   : public Vb
 {
 private :
@@ -61,7 +110,20 @@ private :
   using FT = typename Gt::FT;
 
 public:
-  Simplicial_mesh_vertex_3()
+  template <typename TDS2>
+  struct Rebind_TDS
+  {
+    using Vb2 = typename Vb::template Rebind_TDS<TDS2>::Other;
+    using Other = Simplicial_mesh_vertex_base_3<Gt,
+                                                SubdomainIndex,
+                                                SurfacePatchIndex,
+                                                CurveIndex,
+                                                CornerIndex,
+                                                Vb2>;
+  };
+
+public:
+  Simplicial_mesh_vertex_base_3()
     : Vb()
     , number_of_incident_facets_(0)
     , number_of_components_(0)
@@ -160,7 +222,7 @@ private :
 
 public:
   friend std::istream& operator>>(std::istream& is,
-                                  Simplicial_mesh_vertex_3& v)
+                                  Simplicial_mesh_vertex_base_3& v)
   {
     is >> static_cast<Cmvb3_base&>(v);
     int dimension;
@@ -186,7 +248,7 @@ private :
   }
 
   friend std::ostream& operator<<(std::ostream& os,
-                                  const Simplicial_mesh_vertex_3& v)
+                                  const Simplicial_mesh_vertex_base_3& v)
   {
     os << static_cast<const Cmvb3_base&>(v);
     if(IO::is_ascii(os)) {
@@ -207,76 +269,6 @@ private :
   }
 };
 
-/*!
-\ingroup PkgSMDS3Classes
-
-The class `Simplicial_mesh_vertex_base_3` is a model of the concept
-`SimplicialMeshVertexBase_3`.
-It is designed to serve as vertex base class for 3D simplicial mesh data structures.
-It stores and gives access to data about the complex the vertex belongs to, such as the
-index of the subcomplex it belongs to.
-
-\tparam Gt is the geometric traits class.
-It must be a model of the concept `TriangulationTraits_3`
-
-\tparam SubdomainIndex Type of indices for subdomains of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
-and `EqualityComparable`. The default constructed value must match the label
-of the exterior of the domain (which contains at least the unbounded component).
-It must match `MeshDomain_3::Subdomain_index` when used for mesh generation.
-
-\tparam SurfacePatchIndex Type of indices for surface patches (boundaries and interfaces)
-of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
-and `EqualityComparable`. The default constructed value must be the index value
-assigned to a non surface facet.
-It must match `MeshDomain_3::Surface_patch_index` when used for mesh generation.
-
-\tparam CurveIndex Type of indices for curves (i.e. \f$ 1\f$-dimensional features)
-of the discretized geometric domain.
-Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible` and
-`LessThanComparable`. The default constructed value must be the value for an edge which
-does not approximate a 1-dimensional feature of the geometric domain.
-It must match `MeshDomainWithFeatures_3::Curve_index` when used for mesh generation.
-
-\tparam CornerIndex Type of indices for corners (i.e.\f$ 0\f$--dimensional features)
-of the discretized geometric domain.
-It must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible` and
-`LessThanComparable`.
-It must match `MeshDomainWithFeatures_3::Corner_index` when used for mesh generation.
-
-\tparam Vb is the vertex base class from which `Simplicial_mesh_vertex_base_3` derives.
-It must be a model of the concept `TriangulationVertexBase_3`.
-
-\cgalModels `SimplicialMeshVertexBase_3`
-
-\sa `CGAL::Mesh_complex_3_in_triangulation_3`
-\sa \link Mesh_vertex_base_3 `CGAL::Mesh_vertex_base_3`\endlink
-\sa `MeshDomain_3`
-\sa `MeshDomainWithFeatures_3`
-*/
-template<typename Gt,
-         typename SubdomainIndex,
-         typename SurfacePatchIndex,
-         typename CurveIndex,
-         typename CornerIndex,
-         typename Vb = CGAL::Triangulation_vertex_base_3<Gt> >
-class Simplicial_mesh_vertex_base_3
-{
-public:
-  template <typename TDS2>
-  struct Rebind_TDS
-  {
-    using Vb2 = typename Vb::template Rebind_TDS<TDS2>::Other;
-    using Other = Simplicial_mesh_vertex_3<Gt,
-                                           SubdomainIndex,
-                                           SurfacePatchIndex,
-                                           CurveIndex,
-                                           CornerIndex,
-                                           Vb2>;
-  };
-};
-
 } // namespace CGAL
 
 #endif // CGAL_SIMPLICIAL_MESH_VERTEX_BASE_3_H
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
index 30de338cdf7b..162cfa27f211 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
@@ -22,9 +22,27 @@
 namespace CGAL {
 namespace Tetrahedral_remeshing {
 
+/*!
+\ingroup PkgTetrahedralRemeshingClasses
+
+The class `Remeshing_cell_base_3` is a model of the concept `RemeshingCellBase_3`.
+It is designed to serve as cell base class for the 3D triangulation
+used in the tetrahedral remeshing process.
+
+\tparam Gt is the geometric traits class.
+It has to be a model of the concept `RemeshingTriangulationTraits_3`.
+
+\tparam Cb is a cell base class from which `Remeshing_cell_base_3` derives.
+It must be a model of the `SimplicialMeshCellBase_3` concept.
+
+\cgalModels `RemeshingCellBase_3`
+
+*/
 template<typename Gt,
-         typename Cb>
-class Remeshing_cell_3
+         typename Cb = CGAL::Simplicial_mesh_cell_base_3<Gt,
+                         int /*Subdomain_index*/,
+                         int /*Surface_patch_index*/> >
+class Remeshing_cell_base_3
   : public Cb
 {
 public:
@@ -35,6 +53,14 @@ class Remeshing_cell_3
 
   using Geom_traits = Gt;
 
+public:
+  template <typename TDS2>
+  struct Rebind_TDS
+  {
+    using Cb2 = typename Cb::template Rebind_TDS<TDS2>::Other;
+    using Other = Remeshing_cell_base_3<Gt, Cb2>;
+  };
+
 public:
   using Cb::Cb; // constructors
 
@@ -59,37 +85,6 @@ class Remeshing_cell_3
   mutable bool sliver_cache_validity_ = false;
 };
 
-/*!
-\ingroup PkgTetrahedralRemeshingClasses
-
-The class `Remeshing_cell_base_3` is a model of the concept `RemeshingCellBase_3`.
-It is designed to serve as cell base class for the 3D triangulation
-used in the tetrahedral remeshing process.
-
-\tparam Gt is the geometric traits class.
-It has to be a model of the concept `RemeshingTriangulationTraits_3`.
-
-\tparam Cb is a cell base class from which `Remeshing_cell_base_3` derives.
-It must be a model of the `SimplicialMeshCellBase_3` concept.
-
-\cgalModels `RemeshingCellBase_3`
-
-*/
-template<typename Gt,
-         typename Cb = CGAL::Simplicial_mesh_cell_base_3<Gt,
-                         int /*Subdomain_index*/,
-                         int /*Surface_patch_index*/> >
-class Remeshing_cell_base_3
-{
-public:
-  template <typename TDS2>
-  struct Rebind_TDS
-  {
-    using Cb2 = typename Cb::template Rebind_TDS<TDS2>::Other;
-    using Other = Remeshing_cell_3<Gt, Cb2>;
-  };
-};
-
 } // namespace Tetrahedral_remeshing
 } // namespace CGAL
 
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
index faab3950f9a0..34e5fb0855c0 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h
@@ -20,15 +20,6 @@
 namespace CGAL {
 namespace Tetrahedral_remeshing {
 
-template<typename Gt,
-         typename Vb>
-class Remeshing_vertex_3
-  : public Vb
-{
-public:
-  using Vb::Vb; // constructors
-};
-
 /*!
 \ingroup PkgTetrahedralRemeshingClasses
 
@@ -51,14 +42,18 @@ template<typename Gt,
                          int /*Curve_index*/,
                          int /*Corner_index*/> >
 class Remeshing_vertex_base_3
+  : public Vb
 {
 public:
   template <typename TDS2>
   struct Rebind_TDS
   {
     using Vb2 = typename Vb::template Rebind_TDS<TDS2>::Other;
-    using Other = Remeshing_vertex_3<Gt, Vb2>;
+    using Other = Remeshing_vertex_base_3<Gt, Vb2>;
   };
+
+public:
+  using Vb::Vb; // constructors
 };
 
 } // namespace Tetrahedral_remeshing

From e4dff1ffaf6a481b687239b28648c5fc672008d9 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Fri, 21 Jul 2023 11:41:27 +0200
Subject: [PATCH 0505/1398] issue #7395 Improvement of layout of model
 relations

Corrections after review.
---
 Generalized_map/doc/Generalized_map/CGAL/Generalized_map.h    | 2 +-
 Generator/doc/Generator/CGAL/point_generators_2.h             | 2 +-
 Number_types/doc/Number_types/CGAL/long_long.h                | 2 +-
 Point_set_3/include/CGAL/Point_set_3.h                        | 2 +-
 .../Polyline_simplification_2/Hybrid_squared_distance_cost.h  | 2 +-
 .../CGAL/Polyline_simplification_2/Squared_distance_cost.h    | 2 +-
 .../Polyline_simplification_2/Stop_above_cost_threshold.h     | 2 +-
 .../Stop_below_count_ratio_threshold.h                        | 2 +-
 .../Polyline_simplification_2/Stop_below_count_threshold.h    | 2 +-
 .../doc/Set_movable_separability_2/Concepts/CastingTraits_2.h | 2 +-
 .../doc/Spatial_searching/CGAL/Search_traits_adapter.h        | 4 ++--
 11 files changed, 12 insertions(+), 12 deletions(-)

diff --git a/Generalized_map/doc/Generalized_map/CGAL/Generalized_map.h b/Generalized_map/doc/Generalized_map/CGAL/Generalized_map.h
index 8d030fa2fec4..0afba5bd71c2 100644
--- a/Generalized_map/doc/Generalized_map/CGAL/Generalized_map.h
+++ b/Generalized_map/doc/Generalized_map/CGAL/Generalized_map.h
@@ -8,7 +8,7 @@ The class `Generalized_map` represents a <I>d</I>D generalized map.
 
 Two versions exist: one where darts and non void attributes are stored in memory using `Compact_container`, using `Alloc` as allocator, and use handles as descriptors; a second one where darts and non void attributes are stored in an internal `std::vector` like data-structure, and use indices as descriptors. The choice between the two versions is done through the item class.
 
-\cgalModels{GeneralizedMap}}
+\cgalModels{GeneralizedMap}
 
 \tparam d the dimension of the map.
 
diff --git a/Generator/doc/Generator/CGAL/point_generators_2.h b/Generator/doc/Generator/CGAL/point_generators_2.h
index aec175967500..10319fca7379 100644
--- a/Generator/doc/Generator/CGAL/point_generators_2.h
+++ b/Generator/doc/Generator/CGAL/point_generators_2.h
@@ -677,7 +677,7 @@ endpoints are specified upon construction. The points are equally spaced.
 
 \cgalModels{PointGenerator}
 
-\sa `CGAL::points_on_segment_2<Point_2>
+\sa `CGAL::points_on_segment_2<Point_2>`
 \sa `CGAL::Random_points_in_disc_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_square_2<Point_2, Creator>`
 \sa `CGAL::Random_points_in_triangle_2<Point_2, Creator>`
diff --git a/Number_types/doc/Number_types/CGAL/long_long.h b/Number_types/doc/Number_types/CGAL/long_long.h
index be91260dc599..83e6e23a058a 100644
--- a/Number_types/doc/Number_types/CGAL/long_long.h
+++ b/Number_types/doc/Number_types/CGAL/long_long.h
@@ -5,4 +5,4 @@
 /// type `long long int` is an `RealEmbeddable` `EuclideanRing`. Due
 /// to overflow `long long int` is considered as not exact.
 ///
-/// \cgalModels{EuclideanRing,cgalModels RealEmbeddable}
+/// \cgalModels{EuclideanRing,RealEmbeddable}
diff --git a/Point_set_3/include/CGAL/Point_set_3.h b/Point_set_3/include/CGAL/Point_set_3.h
index 62ef14a946fb..35a7afcad807 100644
--- a/Point_set_3/include/CGAL/Point_set_3.h
+++ b/Point_set_3/include/CGAL/Point_set_3.h
@@ -161,7 +161,7 @@ class Point_set_3
 
 #ifdef DOXYGEN_RUNNING
   typedef unspecified_type iterator; ///< Iterator type of the point set with value type `Index` is model of `RandomAccessIterator`
-  typedef unspecified_type const_iterator; ///< Constant iterator type of the point set with value type `Index` is model of `RandomA.ccessIterator
+  typedef unspecified_type const_iterator; ///< Constant iterator type of the point set with value type `Index` is model of `RandomA.ccessIterator`
 #else
   typedef typename Index_map::iterator iterator; ///< Iterator type of the point set
   typedef typename Index_map::const_iterator const_iterator; ///< Constant iterator type of the point set
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
index 8cfe6fa2a55c..f10167c95703 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h
@@ -27,7 +27,7 @@ namespace Polyline_simplification_2
 /// This class is a cost function which calculates the cost as the square of the distance between the original and simplified polylines,
 /// possibly scaled based on a factor.
 ///
-/// \cgalModels{PolylineSimplificationCostFunction.}
+/// \cgalModels{PolylineSimplificationCostFunction}
 template<class FT>
 class Hybrid_squared_distance_cost
 {
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
index 128327f64c7b..ceeca67d79d9 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Squared_distance_cost.h
@@ -34,7 +34,7 @@ namespace Polyline_simplification_2
 
 /// This class is a cost function which calculates the cost as the square of the distance between the original and simplified polylines.
 ///
-/// \cgalModels{PolylineSimplificationCostFunction.}
+/// \cgalModels{PolylineSimplificationCostFunction}
 class Squared_distance_cost
 {
 
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_above_cost_threshold.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_above_cost_threshold.h
index ed886701afdb..fd4648fa01d3 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_above_cost_threshold.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_above_cost_threshold.h
@@ -28,7 +28,7 @@ namespace Polyline_simplification_2
 /// This class is a stop predicate returning `true` when the cost for
 /// simplifying a vertex is greater than a certain threshold.
 ///
-/// \cgalModels{PolylineSimplificationStopPredicate.}
+/// \cgalModels{PolylineSimplificationStopPredicate}
 class Stop_above_cost_threshold
 {
 public :
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_ratio_threshold.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_ratio_threshold.h
index 9de0bb1888db..1a18d7ceddd5 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_ratio_threshold.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_ratio_threshold.h
@@ -27,7 +27,7 @@ namespace Polyline_simplification_2
 /// This class is a stop predicate returning `true` when the percentage
 /// of remaining vertices is smaller than a certain threshold.
 ///
-/// \cgalModels{PolylineSimplificationStopPredicate.}
+/// \cgalModels{PolylineSimplificationStopPredicate}
 class Stop_below_count_ratio_threshold
 {
 public :
diff --git a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_threshold.h b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_threshold.h
index 072b68166ae3..d8987f323e36 100644
--- a/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_threshold.h
+++ b/Polyline_simplification_2/include/CGAL/Polyline_simplification_2/Stop_below_count_threshold.h
@@ -27,7 +27,7 @@ namespace Polyline_simplification_2
 /// This class is a stop predicate returning `true` when the number of
 /// vertices is smaller than a certain threshold.
 ///
-/// \cgalModels{PolylineSimplificationStopPredicate.}
+/// \cgalModels{PolylineSimplificationStopPredicate}
 class Stop_below_count_threshold
 {
 public :
diff --git a/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h b/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h
index 1322002cd6d3..6e3b2e1325b5 100644
--- a/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h
+++ b/Set_movable_separability_2/doc/Set_movable_separability_2/Concepts/CastingTraits_2.h
@@ -8,7 +8,7 @@
   \cgalRefines{DefaultConstructible,PolygonTraits_2}
 
   \cgalHasModelsBegin
-  \cgalHasModelsBare{Any CGAL kernel, e.g., CGAL::Exact_predicates_exact_constructions_kernel.}
+  \cgalHasModelsBare{Any \cgal kernel, e.g., CGAL::Exact_predicates_exact_constructions_kernel.}
   \cgalHasModelsEnd
 
 */
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_adapter.h b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_adapter.h
index 646ecf4b4a84..267933d15fcb 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_adapter.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Search_traits_adapter.h
@@ -16,8 +16,8 @@ with `Key` as  key type  and `Base_distance::Point_d` as  value type.
 
 \tparam Base_distance is a model of either `GeneralDistance` or `OrthogonalDistance`.
 
-\cgalModels{GeneralDistance if Base_distance is a model of `GeneralDistance`,
-            OrthogonalDistance if Base_distance is a model of `OrthogonalDistance`}
+\cgalModels{GeneralDistance if `Base_distance` is a model of `GeneralDistance`,
+            OrthogonalDistance if `Base_distance` is a model of `OrthogonalDistance`}
 
 \sa `Search_traits_adapter<Key,PointPropertyMap,BaseTraits>`
 

From fdb6b799a9f41d5cfea056801196504351b4da5e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 21 Jul 2023 13:32:25 +0200
Subject: [PATCH 0506/1398] add doc + do the autorefine inplace for the soup

---
 .../PackageDescription.txt                    |   2 +
 .../soup_autorefinement.cpp                   |  11 +-
 .../Polygon_mesh_processing/autorefinement.h  | 168 ++++++++++++------
 3 files changed, 116 insertions(+), 65 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index b17c41399d0b..95d8794cca1e 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -109,6 +109,8 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - `CGAL::Polygon_mesh_processing::surface_intersection()`
 - `CGAL::Polygon_mesh_processing::clip()`
 - `CGAL::Polygon_mesh_processing::split()`
+- `CGAL::Polygon_mesh_processing::autorefine_triangle_soup()`
+- `CGAL::Polygon_mesh_processing::autorefine()`
 
 \cgalCRPSection{Meshing Functions}
 - \link PMP_meshing_grp `CGAL::Polygon_mesh_processing::isotropic_remeshing()` \endlink
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index 9e4999287f7b..a44d47c8b6d1 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -32,14 +32,11 @@ int main(int argc, char** argv)
 
   CGAL::Real_timer t;
   t.start();
-  std::vector<Point> output_points;
-  std::vector<std::array<std::size_t, 3>> output_triangles;
-  PMP::autorefine_soup_output(input_points, input_triangles,
-                              output_points, output_triangles,
-                              CGAL::parameters::concurrency_tag(CGAL::Parallel_if_available_tag()));
+  PMP::autorefine_triangle_soup(input_points, input_triangles,
+                                CGAL::parameters::concurrency_tag(CGAL::Parallel_if_available_tag()));
   t.stop();
-  std::cout << "#points = " << output_points.size() << " and #triangles = " << output_triangles.size() << " in " << t.time() << " sec." << std::endl;
-  CGAL::IO::write_polygon_soup("autorefined.off", output_points, output_triangles, CGAL::parameters::stream_precision(17));
+  std::cout << "#points = " << input_points.size() << " and #triangles = " << input_triangles.size() << " in " << t.time() << " sec." << std::endl;
+  CGAL::IO::write_polygon_soup("autorefined.off", input_points, input_triangles, CGAL::parameters::stream_precision(17));
 
   return 0;
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 122c595b13e8..bfa65df1c73e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -31,10 +31,15 @@
 #endif
 
 // output
-#include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
+#include <CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
 #include <CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h>
 
+
+#ifdef CGAL_PMP_AUTOREFINE_USE_DEFAULT_VERBOSE
+#define CGAL_PMP_AUTOREFINE_VERBOSE(X) std::cout << X << "\n";
+#endif
+
 #ifndef CGAL_PMP_AUTOREFINE_VERBOSE
 #define CGAL_PMP_AUTOREFINE_VERBOSE(MSG)
 #endif
@@ -1100,13 +1105,54 @@ void generate_subtriangles(std::size_t ti,
 }
 
 } // end of autorefine_impl
+#endif
 
-template <class PointRange, class TriIdsRange, class Point_3, class NamedParameters = parameters::Default_named_parameters>
-void autorefine_soup_output(const PointRange& input_points,
-                            const TriIdsRange& id_triples,
-                            std::vector<Point_3>& soup_points,
-                            std::vector<std::array<std::size_t, 3> >& soup_triangles,
-                            const NamedParameters& np = parameters::default_values())
+/**
+* \ingroup PMP_corefinement_grp
+*
+* refines a soup of triangles so that no pair of triangles intersects in their interior.
+* Note that points in `input_points` can only be added (intersection points) a the end of the container, with the initial order preserved.
+* Note that if `input_points` contains two or more identical points and only the first copy (following the order in the `input_points`)
+* will be used in `id_triples`.
+* `id_triples` will be updated to contain both the input triangles and the new subdivides triangles. Degenerate triangles will be removed.
+* Also triangles in `id_triples` will be triangles without intersection first, followed by triangles coming from a subdivision induced
+* by an intersection. The named parameter `visitor()` can be used to track
+*
+* @tparam PointRange a model of the concept `RandomAccessContainer`
+* whose value type is the point type
+* @tparam TriIdsRange a model of the concepts `RandomAccessContainer`, `BackInsertionSequence` and `Swappable`, whose
+* value type is a model of the concept `RandomAccessContainer` whose value type is convertible to `std::size_t` and that
+* is constructible from an `std::initializer_list<std::size_t>` of size 3.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+*
+* @param input_points points of the soup of polygons
+* @param id_triples each element in the range describes a triangle using the indexed position of the points in `input_points`
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*
+* \cgalNamedParamsBegin
+*   \cgalParamNBegin{point_map}
+*     \cgalParamDescription{a property map associating points to the elements of the range `input_points`}
+*     \cgalParamType{a model of `ReadWritePropertyMap` whose value type is a point type}
+*     \cgalParamDefault{`CGAL::Identity_property_map`}
+*   \cgalParamNEnd
+*   \cgalParamNBegin{geom_traits}
+*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamType{a class model of `Kernel`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`}
+*     \cgalParamExtra{The geometric traits class must be compatible with the point type.}
+*   \cgalParamNEnd
+*   \cgalParamNBegin{visitor}
+*     \cgalParamDescription{a visitor used to track the creation of new faces}
+*     \cgalParamType{a class model of `PMPFooBar`}
+*     \cgalParamDefault{`Autorefinement::Default_visitor<Bar, Foo>`}
+*   \cgalParamNEnd
+* \cgalNamedParamsEnd
+*
+*/
+template <class PointRange, class TriIdsRange, class NamedParameters = parameters::Default_named_parameters>
+void autorefine_triangle_soup(PointRange& input_points,
+                              TriIdsRange& id_triples,
+                              const NamedParameters& np = parameters::default_values())
 {
   using parameters::choose_parameter;
   using parameters::get_parameter;
@@ -1121,14 +1167,13 @@ void autorefine_soup_output(const PointRange& input_points,
     Sequential_tag
   > ::type Concurrency_tag;
 
-  constexpr bool parallel_execution = std::is_same<Parallel_tag, Concurrency_tag>::value;
+  constexpr bool parallel_execution = std::is_same_v<Parallel_tag, Concurrency_tag>;
 
 #ifndef CGAL_LINKED_WITH_TBB
-  CGAL_static_assertion_msg (parallel_execution,
-                             "Parallel_tag is enabled but TBB is unavailable.");
+  static_assert (!parallel_execution,
+                 "Parallel_tag is enabled but TBB is unavailable.");
 #endif
 
-
   typedef std::size_t Input_TID;
   typedef std::pair<Input_TID, Input_TID> Pair_of_triangle_ids;
 
@@ -1334,7 +1379,6 @@ void autorefine_soup_output(const PointRange& input_points,
   boost::timer::progress_display pd(triangles.size());
 #endif
 
-
   auto refine_triangles = [&](std::size_t ti)
   {
     if (all_segments[ti].empty() && all_points[ti].empty())
@@ -1371,7 +1415,6 @@ void autorefine_soup_output(const PointRange& input_points,
 #endif
   };
 
-
 #ifdef USE_DEBUG_PARALLEL_TIMERS
   t.start();
 #endif
@@ -1415,25 +1458,22 @@ void autorefine_soup_output(const PointRange& input_points,
   std::vector<EK::Point_3> exact_soup_points;
 #endif
 
-  /// Lambda get_point_id()
-  auto get_point_id = [&](const typename EK::Point_3& pt)
+  // TODO: parallel_for?
+  // for input points, we on purpose keep duplicated points and isolated points
+  for (std::size_t pid = 0; pid<input_points.size(); ++pid)
   {
-    auto insert_res = point_id_map.insert(std::make_pair(pt, soup_points.size()));
-    if (insert_res.second)
-    {
-      soup_points.push_back(to_input(pt));
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
-      exact_soup_points.push_back(pt);
+    auto insert_res =
 #endif
-    }
-    return insert_res.first->second;
-  };
+    point_id_map.insert(
+      std::make_pair(to_exact(get(pm,input_points[pid])), pid));
+#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
+      exact_soup_points.push_back(insert_res.first->first);
+#endif
+  }
 
-  // TODO: parallel_for?
-  std::vector <std::size_t> input_point_ids;
-  input_point_ids.reserve(input_points.size());
-  for (const auto& p : input_points)
-    input_point_ids.push_back(get_point_id(to_exact(get(pm,p))));
+  TriIdsRange soup_triangles;
+  soup_triangles.reserve(id_triples.size()); // TODO: remove #deg tri?
 
   // raw copy of input triangles with no intersection
   for (Input_TID f=0; f<id_triples.size(); ++f)
@@ -1443,15 +1483,28 @@ void autorefine_soup_output(const PointRange& input_points,
     int tiid = tri_inter_ids[f];
     if (tiid == -1)
     {
-      soup_triangles.emplace_back(
-        CGAL::make_array(input_point_ids[id_triples[f][0]],
-                         input_point_ids[id_triples[f][1]],
-                         input_point_ids[id_triples[f][2]])
+      soup_triangles.push_back(
+        {id_triples[f][0], id_triples[f][1], id_triples[f][2]}
       );
     }
   }
 
   // import refined triangles
+
+  // Lambda to retrieve the id of intersection points
+  auto get_point_id = [&](const typename EK::Point_3& pt)
+  {
+    auto insert_res = point_id_map.insert(std::make_pair(pt, input_points.size()));
+    if (insert_res.second)
+    {
+      input_points.push_back(to_input(pt));
+#if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
+      exact_soup_points.push_back(pt);
+#endif
+    }
+    return insert_res.first->second;
+  };
+
 #ifdef USE_DEBUG_PARALLEL_TIMERS
   t.start();
 #endif
@@ -1465,7 +1518,6 @@ void autorefine_soup_output(const PointRange& input_points,
 #ifdef CGAL_LINKED_WITH_TBB
   if(parallel_execution && new_triangles.size() > 100)
   {
-
 #ifdef SET_POINT_IDS_USING_MUTEX
     //option 1 (using a mutex)
     CGAL_MUTEX point_container_mutex;
@@ -1477,8 +1529,8 @@ void autorefine_soup_output(const PointRange& input_points,
       if (insert_res.second)
       {
         CGAL_SCOPED_LOCK(point_container_mutex);
-        insert_res.first->second=soup_points.size();
-        soup_points.push_back(to_input(pt));
+        insert_res.first->second=input_points.size();
+        input_points.push_back(to_input(pt));
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
         exact_soup_points.push_back(pt);
 #endif
@@ -1502,9 +1554,9 @@ void autorefine_soup_output(const PointRange& input_points,
           for (size_t ti = r.begin(); ti != r.end(); ++ti)
           {
             soup_triangles[offset + ti] =
-              CGAL::make_array(triangle_buffer[ti][0]->second,
-                               triangle_buffer[ti][1]->second,
-                               triangle_buffer[ti][2]->second);
+              { triangle_buffer[ti][0]->second,
+                triangle_buffer[ti][1]->second,
+                triangle_buffer[ti][2]->second };
           }
         }
     );
@@ -1536,17 +1588,17 @@ void autorefine_soup_output(const PointRange& input_points,
     );
 
     // the map is now filled we can safely set the point ids
-    std::size_t pid_offset=soup_points.size();
-    soup_points.resize(pid_offset+iterators.size());
+    std::size_t pid_offset=input_points.size();
+    input_points.resize(pid_offset+iterators.size());
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
-    exact_soup_points.resize(soup_points.size());
+    exact_soup_points.resize(input_points.size());
 #endif
 
     tbb::parallel_for(tbb::blocked_range<size_t>(0, iterators.size()),
       [&](const tbb::blocked_range<size_t>& r) {
         for (size_t ti = r.begin(); ti != r.end(); ++ti)
         {
-          soup_points[pid_offset+ti] = to_input(iterators[ti]->first);
+          input_points[pid_offset+ti] = to_input(iterators[ti]->first);
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
           exact_soup_points[pid_offset+ti] = iterators[ti]->first;
 #endif
@@ -1560,9 +1612,9 @@ void autorefine_soup_output(const PointRange& input_points,
           for (size_t ti = r.begin(); ti != r.end(); ++ti)
           {
             soup_triangles[offset + ti] =
-              CGAL::make_array(triangle_buffer[ti][0]->second,
-                               triangle_buffer[ti][1]->second,
-                               triangle_buffer[ti][2]->second);
+              { triangle_buffer[ti][0]->second,
+                triangle_buffer[ti][1]->second,
+                triangle_buffer[ti][2]->second };
           }
         }
     );
@@ -1576,7 +1628,7 @@ void autorefine_soup_output(const PointRange& input_points,
 #endif
     soup_triangles.reserve(offset + new_triangles.size());
     for (const std::array<EK::Point_3,3>& t : new_triangles)
-      soup_triangles.emplace_back(CGAL::make_array(get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])));
+      soup_triangles.push_back({ get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])});
   }
 
 
@@ -1597,9 +1649,11 @@ void autorefine_soup_output(const PointRange& input_points,
     throw std::runtime_error("ERROR: invalid output, there is most probably a bug");
 #endif
 #endif
+  using std::swap;
+  swap(id_triples, soup_triangles);
+
   CGAL_PMP_AUTOREFINE_VERBOSE("done");
 }
-#endif
 
 /**
  * \ingroup PMP_corefinement_grp
@@ -1639,22 +1693,20 @@ autorefine(      TriangleMesh& tm,
   using parameters::get_parameter;
 
   typedef typename GetGeomTraits<TriangleMesh, NamedParameters>::type GT;
-  GT traits = choose_parameter<GT>(get_parameter(np, internal_np::geom_traits));
+  // GT traits = choose_parameter<GT>(get_parameter(np, internal_np::geom_traits));
 
-  std::vector<typename GT::Point_3> in_soup_points;
-  std::vector<std::array<std::size_t, 3> > in_soup_triangles;
-  std::vector<typename GT::Point_3> out_soup_points;
-  std::vector<std::array<std::size_t, 3> > out_soup_triangles;
+  std::vector<typename GT::Point_3> soup_points;
+  std::vector<std::array<std::size_t, 3> > soup_triangles;
 
-  polygon_mesh_to_polygon_soup(tm, in_soup_points, in_soup_triangles);
+  polygon_mesh_to_polygon_soup(tm, soup_points, soup_triangles, np);
 
-  autorefine_soup_output(in_soup_points, in_soup_triangles,
-                         out_soup_points, out_soup_triangles);
+  autorefine_triangle_soup(soup_points, soup_triangles);
 
   clear(tm);
-  repair_polygon_soup(out_soup_points, out_soup_triangles);
-  orient_polygon_soup(out_soup_points, out_soup_triangles);
-  polygon_soup_to_polygon_mesh(out_soup_points, out_soup_triangles, tm);
+  repair_polygon_soup(soup_points, soup_triangles);
+
+  duplicate_non_manifold_edges_in_polygon_soup(soup_points, soup_triangles);
+  polygon_soup_to_polygon_mesh(soup_points, soup_triangles, tm);
 }
 
 

From d6fdc85be9bb5c95b4fdf59379a67033a98b2d36 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 21 Jul 2023 13:38:10 +0200
Subject: [PATCH 0507/1398] rename variables

---
 .../Polygon_mesh_processing/autorefinement.h  | 84 +++++++++----------
 1 file changed, 42 insertions(+), 42 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index bfa65df1c73e..0054a9dcdb2d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1111,11 +1111,11 @@ void generate_subtriangles(std::size_t ti,
 * \ingroup PMP_corefinement_grp
 *
 * refines a soup of triangles so that no pair of triangles intersects in their interior.
-* Note that points in `input_points` can only be added (intersection points) a the end of the container, with the initial order preserved.
-* Note that if `input_points` contains two or more identical points and only the first copy (following the order in the `input_points`)
-* will be used in `id_triples`.
-* `id_triples` will be updated to contain both the input triangles and the new subdivides triangles. Degenerate triangles will be removed.
-* Also triangles in `id_triples` will be triangles without intersection first, followed by triangles coming from a subdivision induced
+* Note that points in `soup_points` can only be added (intersection points) a the end of the container, with the initial order preserved.
+* Note that if `soup_points` contains two or more identical points and only the first copy (following the order in the `soup_points`)
+* will be used in `soup_triangles`.
+* `soup_triangles` will be updated to contain both the input triangles and the new subdivides triangles. Degenerate triangles will be removed.
+* Also triangles in `soup_triangles` will be triangles without intersection first, followed by triangles coming from a subdivision induced
 * by an intersection. The named parameter `visitor()` can be used to track
 *
 * @tparam PointRange a model of the concept `RandomAccessContainer`
@@ -1125,13 +1125,13 @@ void generate_subtriangles(std::size_t ti,
 * is constructible from an `std::initializer_list<std::size_t>` of size 3.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
-* @param input_points points of the soup of polygons
-* @param id_triples each element in the range describes a triangle using the indexed position of the points in `input_points`
+* @param soup_points points of the soup of polygons
+* @param soup_triangles each element in the range describes a triangle using the indexed position of the points in `soup_points`
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
 * \cgalNamedParamsBegin
 *   \cgalParamNBegin{point_map}
-*     \cgalParamDescription{a property map associating points to the elements of the range `input_points`}
+*     \cgalParamDescription{a property map associating points to the elements of the range `soup_points`}
 *     \cgalParamType{a model of `ReadWritePropertyMap` whose value type is a point type}
 *     \cgalParamDefault{`CGAL::Identity_property_map`}
 *   \cgalParamNEnd
@@ -1150,8 +1150,8 @@ void generate_subtriangles(std::size_t ti,
 *
 */
 template <class PointRange, class TriIdsRange, class NamedParameters = parameters::Default_named_parameters>
-void autorefine_triangle_soup(PointRange& input_points,
-                              TriIdsRange& id_triples,
+void autorefine_triangle_soup(PointRange& soup_points,
+                              TriIdsRange& soup_triangles,
                               const NamedParameters& np = parameters::default_values())
 {
   using parameters::choose_parameter;
@@ -1181,12 +1181,12 @@ void autorefine_triangle_soup(PointRange& input_points,
 
   // collect intersecting pairs of triangles
   CGAL_PMP_AUTOREFINE_VERBOSE("collect intersecting pairs");
-  triangle_soup_self_intersections<Concurrency_tag>(input_points, id_triples, std::back_inserter(si_pairs), np);
+  triangle_soup_self_intersections<Concurrency_tag>(soup_points, soup_triangles, std::back_inserter(si_pairs), np);
 
   if (si_pairs.empty()) return;
 
   // mark degenerate faces so that we can ignore them
-  std::vector<bool> is_degen(id_triples.size(), false);
+  std::vector<bool> is_degen(soup_triangles.size(), false);
 
   for (const Pair_of_triangle_ids& p : si_pairs)
     if (p.first==p.second) // bbox inter reports (f,f) for degenerate faces
@@ -1194,7 +1194,7 @@ void autorefine_triangle_soup(PointRange& input_points,
 
   // assign an id per triangle involved in an intersection
   // + the faces involved in the intersection
-  std::vector<int> tri_inter_ids(id_triples.size(), -1);
+  std::vector<int> tri_inter_ids(soup_triangles.size(), -1);
   std::vector<Input_TID> intersected_faces;
   int tiid=-1;
   for (const Pair_of_triangle_ids& p : si_pairs)
@@ -1219,9 +1219,9 @@ void autorefine_triangle_soup(PointRange& input_points,
   for(Input_TID f : intersected_faces)
   {
     triangles[tri_inter_ids[f]]= CGAL::make_array(
-      to_exact( get(pm, input_points[id_triples[f][0]]) ),
-      to_exact( get(pm, input_points[id_triples[f][1]]) ),
-      to_exact( get(pm, input_points[id_triples[f][2]]) ) );
+      to_exact( get(pm, soup_points[soup_triangles[f][0]]) ),
+      to_exact( get(pm, soup_points[soup_triangles[f][1]]) ),
+      to_exact( get(pm, soup_points[soup_triangles[f][2]]) ) );
   }
 
   std::vector< std::vector<std::array<EK::Point_3,2> > > all_segments(triangles.size());
@@ -1460,31 +1460,31 @@ void autorefine_triangle_soup(PointRange& input_points,
 
   // TODO: parallel_for?
   // for input points, we on purpose keep duplicated points and isolated points
-  for (std::size_t pid = 0; pid<input_points.size(); ++pid)
+  for (std::size_t pid = 0; pid<soup_points.size(); ++pid)
   {
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
     auto insert_res =
 #endif
     point_id_map.insert(
-      std::make_pair(to_exact(get(pm,input_points[pid])), pid));
+      std::make_pair(to_exact(get(pm,soup_points[pid])), pid));
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
       exact_soup_points.push_back(insert_res.first->first);
 #endif
   }
 
-  TriIdsRange soup_triangles;
-  soup_triangles.reserve(id_triples.size()); // TODO: remove #deg tri?
+  TriIdsRange soup_triangles_out;
+  soup_triangles_out.reserve(soup_triangles.size()); // TODO: remove #deg tri?
 
   // raw copy of input triangles with no intersection
-  for (Input_TID f=0; f<id_triples.size(); ++f)
+  for (Input_TID f=0; f<soup_triangles.size(); ++f)
   {
     if (is_degen[f]) continue; //skip degenerate faces
 
     int tiid = tri_inter_ids[f];
     if (tiid == -1)
     {
-      soup_triangles.push_back(
-        {id_triples[f][0], id_triples[f][1], id_triples[f][2]}
+      soup_triangles_out.push_back(
+        {soup_triangles[f][0], soup_triangles[f][1], soup_triangles[f][2]}
       );
     }
   }
@@ -1494,10 +1494,10 @@ void autorefine_triangle_soup(PointRange& input_points,
   // Lambda to retrieve the id of intersection points
   auto get_point_id = [&](const typename EK::Point_3& pt)
   {
-    auto insert_res = point_id_map.insert(std::make_pair(pt, input_points.size()));
+    auto insert_res = point_id_map.insert(std::make_pair(pt, soup_points.size()));
     if (insert_res.second)
     {
-      input_points.push_back(to_input(pt));
+      soup_points.push_back(to_input(pt));
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
       exact_soup_points.push_back(pt);
 #endif
@@ -1509,7 +1509,7 @@ void autorefine_triangle_soup(PointRange& input_points,
   t.start();
 #endif
 
-  std::size_t offset = soup_triangles.size();
+  std::size_t offset = soup_triangles_out.size();
 #ifdef USE_DEBUG_PARALLEL_TIMERS
   std::string mode = "parallel";
 #endif
@@ -1529,8 +1529,8 @@ void autorefine_triangle_soup(PointRange& input_points,
       if (insert_res.second)
       {
         CGAL_SCOPED_LOCK(point_container_mutex);
-        insert_res.first->second=input_points.size();
-        input_points.push_back(to_input(pt));
+        insert_res.first->second=soup_points.size();
+        soup_points.push_back(to_input(pt));
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
         exact_soup_points.push_back(pt);
 #endif
@@ -1538,7 +1538,7 @@ void autorefine_triangle_soup(PointRange& input_points,
       return insert_res.first;
     };
 
-    soup_triangles.resize(offset + new_triangles.size());
+    soup_triangles_out.resize(offset + new_triangles.size());
     //use map iterator triple for triangles to create them concurrently and safely
     std::vector<std::array<tbb::concurrent_map<EK::Point_3, std::size_t>::iterator, 3>> triangle_buffer(new_triangles.size());
     tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
@@ -1553,7 +1553,7 @@ void autorefine_triangle_soup(PointRange& input_points,
       [&](const tbb::blocked_range<size_t>& r) {
           for (size_t ti = r.begin(); ti != r.end(); ++ti)
           {
-            soup_triangles[offset + ti] =
+            soup_triangles_out[offset + ti] =
               { triangle_buffer[ti][0]->second,
                 triangle_buffer[ti][1]->second,
                 triangle_buffer[ti][2]->second };
@@ -1573,12 +1573,12 @@ void autorefine_triangle_soup(PointRange& input_points,
     };
 
     //use map iterator triple for triangles to create them concurrently and safely
-    soup_triangles.resize(offset + new_triangles.size());
+    soup_triangles_out.resize(offset + new_triangles.size());
     std::vector<std::array<tbb::concurrent_map<EK::Point_3, std::size_t>::iterator, 3>> triangle_buffer(new_triangles.size());
     tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
       [&](const tbb::blocked_range<size_t>& r) {
         for (size_t ti = r.begin(); ti != r.end(); ++ti) {
-          if (offset + ti > soup_triangles.size()) {
+          if (offset + ti > soup_triangles_out.size()) {
               std::cout << "ti = " << ti << std::endl;
           }
           const std::array<EK::Point_3, 3>& t = new_triangles[ti];
@@ -1588,17 +1588,17 @@ void autorefine_triangle_soup(PointRange& input_points,
     );
 
     // the map is now filled we can safely set the point ids
-    std::size_t pid_offset=input_points.size();
-    input_points.resize(pid_offset+iterators.size());
+    std::size_t pid_offset=soup_points.size();
+    soup_points.resize(pid_offset+iterators.size());
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
-    exact_soup_points.resize(input_points.size());
+    exact_soup_points.resize(soup_points.size());
 #endif
 
     tbb::parallel_for(tbb::blocked_range<size_t>(0, iterators.size()),
       [&](const tbb::blocked_range<size_t>& r) {
         for (size_t ti = r.begin(); ti != r.end(); ++ti)
         {
-          input_points[pid_offset+ti] = to_input(iterators[ti]->first);
+          soup_points[pid_offset+ti] = to_input(iterators[ti]->first);
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
           exact_soup_points[pid_offset+ti] = iterators[ti]->first;
 #endif
@@ -1611,7 +1611,7 @@ void autorefine_triangle_soup(PointRange& input_points,
       [&](const tbb::blocked_range<size_t>& r) {
           for (size_t ti = r.begin(); ti != r.end(); ++ti)
           {
-            soup_triangles[offset + ti] =
+            soup_triangles_out[offset + ti] =
               { triangle_buffer[ti][0]->second,
                 triangle_buffer[ti][1]->second,
                 triangle_buffer[ti][2]->second };
@@ -1626,9 +1626,9 @@ void autorefine_triangle_soup(PointRange& input_points,
 #ifdef USE_DEBUG_PARALLEL_TIMERS
     mode = "sequential";
 #endif
-    soup_triangles.reserve(offset + new_triangles.size());
+    soup_triangles_out.reserve(offset + new_triangles.size());
     for (const std::array<EK::Point_3,3>& t : new_triangles)
-      soup_triangles.push_back({ get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])});
+      soup_triangles_out.push_back({ get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])});
   }
 
 
@@ -1641,16 +1641,16 @@ void autorefine_triangle_soup(PointRange& input_points,
 
 #ifndef CGAL_NDEBUG
   CGAL_PMP_AUTOREFINE_VERBOSE("check soup");
-  CGAL_assertion( !does_triangle_soup_self_intersect<Concurrency_tag>(exact_soup_points, soup_triangles) );
+  CGAL_assertion( !does_triangle_soup_self_intersect<Concurrency_tag>(exact_soup_points, soup_triangles_out) );
 #else
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE
   CGAL_PMP_AUTOREFINE_VERBOSE("check soup");
-  if (does_triangle_soup_self_intersect<Concurrency_tag>(exact_soup_points, soup_triangles))
+  if (does_triangle_soup_self_intersect<Concurrency_tag>(exact_soup_points, soup_triangles_out))
     throw std::runtime_error("ERROR: invalid output, there is most probably a bug");
 #endif
 #endif
   using std::swap;
-  swap(id_triples, soup_triangles);
+  swap(soup_triangles, soup_triangles_out);
 
   CGAL_PMP_AUTOREFINE_VERBOSE("done");
 }

From 5e8d59c4dd9deb5f1c35f0675e96c4bf91578bd9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 21 Jul 2023 16:22:41 +0200
Subject: [PATCH 0508/1398] Make the triangulation a template parameter of the
 Alpha Wrap builder

Advanced users only for now: you need to know what you're doing
as the geom traits need to define the Ball_3 (usually that means
wrapping your Gt with AABB_AW_geom_traits) and you need to have
Vb/Cb contain the AW Vb/Cb in the stack.
---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 271 ++++++++++--------
 1 file changed, 148 insertions(+), 123 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index f12ad06804b1..677242e9da19 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -34,11 +34,20 @@
 #include <CGAL/Alpha_wrap_3/internal/geometry_utils.h>
 #include <CGAL/Alpha_wrap_3/internal/oracles.h>
 
+#include <CGAL/Delaunay_triangulation_3.h>
+#include <CGAL/Triangulation_data_structure_3.h>
+#include <CGAL/Delaunay_triangulation_cell_base_3.h>
+#include <CGAL/Triangulation_cell_base_with_info_3.h>
+#include <CGAL/Delaunay_triangulation_cell_base_with_circumcenter_3.h>
+#include <CGAL/Triangulation_vertex_base_with_info_3.h>
+#include <CGAL/Robust_weighted_circumcenter_filtered_traits_3.h>
+
 #include <CGAL/Cartesian_converter.h>
 #include <CGAL/Simple_cartesian.h>
 
 #include <CGAL/boost/graph/Euler_operations.h>
 #include <CGAL/boost/graph/named_params_helper.h>
+#include <CGAL/Default.h>
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/Modifiable_priority_queue.h>
 #include <CGAL/Polygon_mesh_processing/bbox.h>
@@ -50,16 +59,9 @@
 #include <CGAL/Polygon_mesh_processing/stitch_borders.h> // only if non-manifoldness is not treated
 #include <CGAL/property_map.h>
 #include <CGAL/Real_timer.h>
-#include <CGAL/Delaunay_triangulation_3.h>
-#include <CGAL/Triangulation_data_structure_3.h>
-#include <CGAL/Delaunay_triangulation_cell_base_3.h>
-#include <CGAL/Triangulation_cell_base_with_info_3.h>
-#include <CGAL/Delaunay_triangulation_cell_base_with_circumcenter_3.h>
-#include <CGAL/Triangulation_vertex_base_with_info_3.h>
-#include <CGAL/Robust_weighted_circumcenter_filtered_traits_3.h>
 
-#include <array>
 #include <algorithm>
+#include <array>
 #include <fstream>
 #include <functional>
 #include <iostream>
@@ -74,6 +76,34 @@ namespace CGAL {
 namespace Alpha_wraps_3 {
 namespace internal {
 
+struct Cell_info
+{
+  bool is_outside = false;
+};
+
+enum Vertex_info
+{
+  DEFAULT = 0,
+  BBOX_VERTEX,
+  SEED_VERTEX
+};
+
+template <typename GeomTraits>
+using Alpha_wrap_triangulation_vertex_base_3 =
+  CGAL::Triangulation_vertex_base_with_info_3<
+    Vertex_info,
+    GeomTraits,
+    CGAL::Triangulation_vertex_base_3<GeomTraits> >;
+
+template <typename GeomTraits>
+using Alpha_wrap_triangulation_cell_base_3 =
+  CGAL::Triangulation_cell_base_with_info_3<
+    Cell_info,
+    GeomTraits,
+    CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3<
+      GeomTraits,
+      CGAL::Delaunay_triangulation_cell_base_3<GeomTraits> > >;
+
 template <typename Cb>
 class Cell_base_with_timestamp
   : public Cb
@@ -125,11 +155,34 @@ struct Wrapping_default_visitor
   void on_alpha_wrapping_end(const AlphaWrapper&) { };
 };
 
-template <typename Oracle>
+template <typename Oracle_,
+          typename Triangulation_ = CGAL::Default>
 class Alpha_wrap_3
 {
+  using Oracle = Oracle_;
+
+  // Triangulation
   using Base_GT = typename Oracle::Geom_traits;
-  using Geom_traits = Robust_circumcenter_filtered_traits_3<Base_GT>;
+  using Default_Gt = Robust_circumcenter_filtered_traits_3<Base_GT>;
+
+  using Default_Vb = Alpha_wrap_triangulation_vertex_base_3<Default_Gt>;
+  using Default_Cb = Alpha_wrap_triangulation_cell_base_3<Default_Gt>;
+  using Default_Cbt = Cell_base_with_timestamp<Default_Cb>; // determinism
+  using Default_Tds = CGAL::Triangulation_data_structure_3<Default_Vb, Default_Cbt>;
+  using Default_Triangulation = CGAL::Delaunay_triangulation_3<Default_Gt, Default_Tds, Fast_location>;
+
+  using Triangulation = typename Default::Get<Triangulation_, Default_Triangulation>::type;
+
+  using Cell_handle = typename Triangulation::Cell_handle;
+  using Facet = typename Triangulation::Facet;
+  using Vertex_handle = typename Triangulation::Vertex_handle;
+  using Locate_type = typename Triangulation::Locate_type;
+
+  using Gate = internal::Gate<Triangulation>;
+  using Alpha_PQ = Modifiable_priority_queue<Gate, Less_gate, Gate_ID_PM<Triangulation>, CGAL_BOOST_PAIRING_HEAP>;
+
+  // Use the geom traits from the triangulation, and trust the (advanced) user that provided it
+  using Geom_traits = typename Triangulation::Geom_traits;
 
   using FT = typename Geom_traits::FT;
   using Point_3 = typename Geom_traits::Point_3;
@@ -143,34 +196,6 @@ class Alpha_wrap_3
   using SC_Iso_cuboid_3 = SC::Iso_cuboid_3;
   using SC2GT = Cartesian_converter<SC, Geom_traits>;
 
-  struct Cell_info
-  {
-    bool is_outside = false;
-  };
-
-  enum Vertex_info
-  {
-    DEFAULT = 0,
-    BBOX_VERTEX,
-    SEED_VERTEX
-  };
-
-  using Vb = Triangulation_vertex_base_3<Geom_traits>;
-  using Vbi = Triangulation_vertex_base_with_info_3<Vertex_info, Geom_traits, Vb>;
-  using Cbb = Delaunay_triangulation_cell_base_3<Geom_traits>;
-  using Cb = Delaunay_triangulation_cell_base_with_circumcenter_3<Geom_traits, Cbb>;
-  using Cbi = Triangulation_cell_base_with_info_3<Cell_info, Geom_traits, Cb>;
-  using Cbt = Cell_base_with_timestamp<Cbi>;
-  using Tds = Triangulation_data_structure_3<Vbi, Cbt>;
-  using Dt = Delaunay_triangulation_3<Geom_traits, Tds, Fast_location>;
-
-  using Cell_handle = typename Dt::Cell_handle;
-  using Facet = typename Dt::Facet;
-  using Vertex_handle = typename Dt::Vertex_handle;
-  using Locate_type = typename Dt::Locate_type;
-
-  using Gate = internal::Gate<Dt>;
-  using Alpha_PQ = Modifiable_priority_queue<Gate, Less_gate, Gate_ID_PM<Dt>, CGAL_BOOST_PAIRING_HEAP>;
 
 protected:
   const Oracle m_oracle;
@@ -179,7 +204,7 @@ class Alpha_wrap_3
   FT m_alpha, m_sq_alpha;
   FT m_offset, m_sq_offset;
 
-  Dt m_dt;
+  Triangulation m_tr;
   Alpha_PQ m_queue;
 
 public:
@@ -187,7 +212,7 @@ class Alpha_wrap_3
   Alpha_wrap_3(const Oracle& oracle)
     :
       m_oracle(oracle),
-      m_dt(Geom_traits(oracle.geom_traits())),
+      m_tr(Geom_traits(oracle.geom_traits())),
       // used to set up the initial MPQ, use some arbitrary not-too-small value
       m_queue(4096)
   {
@@ -197,9 +222,9 @@ class Alpha_wrap_3
   }
 
 public:
-  const Geom_traits& geom_traits() const { return m_dt.geom_traits(); }
-  Dt& triangulation() { return m_dt; }
-  const Dt& triangulation() const { return m_dt; }
+  const Geom_traits& geom_traits() const { return m_tr.geom_traits(); }
+  Triangulation& triangulation() { return m_tr; }
+  const Triangulation& triangulation() const { return m_tr; }
   const Alpha_PQ& queue() const { return m_queue; }
 
   double default_alpha() const
@@ -216,13 +241,13 @@ class Alpha_wrap_3
   const Point_3& circumcenter(const Cell_handle c) const
   {
     // We only cross an infinite facet once, so this isn't going to be recomputed many times
-    if(m_dt.is_infinite(c))
+    if(m_tr.is_infinite(c))
     {
-      const int inf_index = c->index(m_dt.infinite_vertex());
+      const int inf_index = c->index(m_tr.infinite_vertex());
       c->set_circumcenter(
-            geom_traits().construct_circumcenter_3_object()(m_dt.point(c, (inf_index+1)&3),
-                                                            m_dt.point(c, (inf_index+2)&3),
-                                                            m_dt.point(c, (inf_index+3)&3)));
+            geom_traits().construct_circumcenter_3_object()(m_tr.point(c, (inf_index+1)&3),
+                                                            m_tr.point(c, (inf_index+2)&3),
+                                                            m_tr.point(c, (inf_index+3)&3)));
     }
 
     return c->circumcenter(geom_traits());
@@ -418,7 +443,7 @@ class Alpha_wrap_3
     for(int i=0; i<8; ++i)
     {
       const Point_3 bp = SC2GT()(m_bbox.vertex(i));
-      Vertex_handle bv = m_dt.insert(bp);
+      Vertex_handle bv = m_tr.insert(bp);
 #ifdef CGAL_AW3_DEBUG_INITIALIZATION
       std::cout << "\t" << bp << std::endl;
 #endif
@@ -433,7 +458,7 @@ class Alpha_wrap_3
   // that the refinement point is separated from the existing point set.
   bool cavity_cell_outside_tag(const Cell_handle ch)
   {
-    CGAL_precondition(!m_dt.is_infinite(ch));
+    CGAL_precondition(!m_tr.is_infinite(ch));
 
     const Tetrahedron_with_outside_info<Geom_traits> tet(ch, geom_traits());
     if(m_oracle.do_intersect(tet))
@@ -536,7 +561,7 @@ class Alpha_wrap_3
       // This problem only appears when the seed and icosahedron vertices are close to the offset surface,
       // which usually happens for large alpha values.
 
-      Vertex_handle seed_v = m_dt.insert(seed_p);
+      Vertex_handle seed_v = m_tr.insert(seed_p);
       seed_v->info() = SEED_VERTEX;
       seed_vs.push_back(seed_v);
 
@@ -573,7 +598,7 @@ class Alpha_wrap_3
         if(bbox.has_on_unbounded_side(seed_neighbor_p))
           continue;
 
-        Vertex_handle ico_v = m_dt.insert(seed_neighbor_p, seed_v /*hint*/);
+        Vertex_handle ico_v = m_tr.insert(seed_neighbor_p, seed_v /*hint*/);
         ico_v->info() = SEED_VERTEX;
       }
     }
@@ -587,26 +612,26 @@ class Alpha_wrap_3
     }
 
 #ifdef CGAL_AW3_DEBUG_INITIALIZATION
-    std::cout << m_dt.number_of_vertices() - 8 /*bbox*/ << " vertice(s) due to seeds" << std::endl;
+    std::cout << m_tr.number_of_vertices() - 8 /*bbox*/ << " vertice(s) due to seeds" << std::endl;
 #endif
 
     for(Vertex_handle seed_v : seed_vs)
     {
       std::vector<Cell_handle> inc_cells;
       inc_cells.reserve(64);
-      m_dt.incident_cells(seed_v, std::back_inserter(inc_cells));
+      m_tr.incident_cells(seed_v, std::back_inserter(inc_cells));
       for(Cell_handle ch : inc_cells)
         ch->info().is_outside = cavity_cell_outside_tag(ch);
     }
 
     // Might as well go through the full triangulation since only seeds should have been inserted
-    for(Cell_handle ch : m_dt.all_cell_handles())
+    for(Cell_handle ch : m_tr.all_cell_handles())
     {
       if(!ch->info().is_outside)
         continue;
 
       // When the algorithm starts from a manually dug hole, infinite cells are tagged "inside"
-      CGAL_assertion(!m_dt.is_infinite(ch));
+      CGAL_assertion(!m_tr.is_infinite(ch));
 
       for(int i=0; i<4; ++i)
         push_facet(std::make_pair(ch, i));
@@ -627,12 +652,12 @@ class Alpha_wrap_3
   // init queue with all convex hull facets
   bool initialize_from_infinity()
   {
-    for(Cell_handle ch : m_dt.all_cell_handles())
+    for(Cell_handle ch : m_tr.all_cell_handles())
     {
-      if(m_dt.is_infinite(ch))
+      if(m_tr.is_infinite(ch))
       {
         ch->info().is_outside = true;
-        const int inf_index = ch->index(m_dt.infinite_vertex());
+        const int inf_index = ch->index(m_tr.infinite_vertex());
         push_facet(std::make_pair(ch, inf_index));
       }
       else
@@ -659,10 +684,10 @@ class Alpha_wrap_3
 
     clear(output_mesh);
 
-    CGAL_assertion_code(for(auto cit=m_dt.finite_cells_begin(), cend=m_dt.finite_cells_end(); cit!=cend; ++cit))
+    CGAL_assertion_code(for(auto cit=m_tr.finite_cells_begin(), cend=m_tr.finite_cells_end(); cit!=cend; ++cit))
     CGAL_assertion(cit->tds_data().is_clear());
 
-    for(auto cit=m_dt.finite_cells_begin(), cend=m_dt.finite_cells_end(); cit!=cend; ++cit)
+    for(auto cit=m_tr.finite_cells_begin(), cend=m_tr.finite_cells_end(); cit!=cend; ++cit)
     {
       Cell_handle seed = cit;
       if(seed->info().is_outside || seed->tds_data().processed())
@@ -678,7 +703,7 @@ class Alpha_wrap_3
       while(!to_visit.empty())
       {
         const Cell_handle cell = to_visit.front();
-        CGAL_assertion(!cell->info().is_outside && !m_dt.is_infinite(cell));
+        CGAL_assertion(!cell->info().is_outside && !m_tr.is_infinite(cell));
 
         to_visit.pop();
 
@@ -698,9 +723,9 @@ class Alpha_wrap_3
 //            CGAL_assertion(cell->vertex((fid + 2)&3)->info() == DEFAULT);
 //            CGAL_assertion(cell->vertex((fid + 3)&3)->info() == DEFAULT);
 
-            points.push_back(m_dt.point(cell, Dt::vertex_triple_index(fid, 0)));
-            points.push_back(m_dt.point(cell, Dt::vertex_triple_index(fid, 1)));
-            points.push_back(m_dt.point(cell, Dt::vertex_triple_index(fid, 2)));
+            points.push_back(m_tr.point(cell, Triangulation::vertex_triple_index(fid, 0)));
+            points.push_back(m_tr.point(cell, Triangulation::vertex_triple_index(fid, 1)));
+            points.push_back(m_tr.point(cell, Triangulation::vertex_triple_index(fid, 2)));
             faces.push_back({idx, idx + 1, idx + 2});
             idx += 3;
           }
@@ -722,7 +747,7 @@ class Alpha_wrap_3
       CGAL_assertion(is_closed(output_mesh));
     }
 
-    for(auto cit=m_dt.finite_cells_begin(), cend=m_dt.finite_cells_end(); cit!=cend; ++cit)
+    for(auto cit=m_tr.finite_cells_begin(), cend=m_tr.finite_cells_end(); cit!=cend; ++cit)
       cit->tds_data().clear();
 
     CGAL_postcondition(!is_empty(output_mesh));
@@ -742,7 +767,7 @@ class Alpha_wrap_3
     std::cout << "> Extract wrap... ()" << std::endl;
 #endif
 
-    CGAL_assertion_code(for(Vertex_handle v : m_dt.finite_vertex_handles()))
+    CGAL_assertion_code(for(Vertex_handle v : m_tr.finite_vertex_handles()))
     CGAL_assertion(!is_non_manifold(v));
 
     clear(output_mesh);
@@ -754,11 +779,11 @@ class Alpha_wrap_3
     std::unordered_map<Vertex_handle, std::size_t> vertex_to_id;
     std::size_t nv = 0;
 
-    for(auto fit=m_dt.finite_facets_begin(), fend=m_dt.finite_facets_end(); fit!=fend; ++fit)
+    for(auto fit=m_tr.finite_facets_begin(), fend=m_tr.finite_facets_end(); fit!=fend; ++fit)
     {
       Facet f = *fit;
       if(!f.first->info().is_outside)
-        f = m_dt.mirror_facet(f);
+        f = m_tr.mirror_facet(f);
 
       const Cell_handle c = f.first;
       const int s = f.second;
@@ -769,11 +794,11 @@ class Alpha_wrap_3
       std::array<std::size_t, 3> ids;
       for(int pos=0; pos<3; ++pos)
       {
-        Vertex_handle vh = c->vertex(Dt::vertex_triple_index(s, pos));
+        Vertex_handle vh = c->vertex(Triangulation::vertex_triple_index(s, pos));
         auto insertion_res = vertex_to_id.emplace(vh, nv);
         if(insertion_res.second) // successful insertion, never-seen-before vertex
         {
-          points.push_back(m_dt.point(vh));
+          points.push_back(m_tr.point(vh));
           ++nv;
         }
 
@@ -817,14 +842,14 @@ class Alpha_wrap_3
 private:
   bool is_traversable(const Facet& f) const
   {
-    return less_squared_radius_of_min_empty_sphere(m_sq_alpha, f, m_dt);
+    return less_squared_radius_of_min_empty_sphere(m_sq_alpha, f, m_tr);
   }
 
   bool compute_steiner_point(const Cell_handle ch,
                              const Cell_handle neighbor,
                              Point_3& steiner_point) const
   {
-    CGAL_precondition(!m_dt.is_infinite(neighbor));
+    CGAL_precondition(!m_tr.is_infinite(neighbor));
 
     typename Geom_traits::Construct_ball_3 ball = geom_traits().construct_ball_3_object();
     typename Geom_traits::Construct_vector_3 vector = geom_traits().construct_vector_3_object();
@@ -920,7 +945,7 @@ class Alpha_wrap_3
   // e.g. from DT3
   Facet_queue_status facet_status(const Facet& f) const
   {
-    CGAL_precondition(!m_dt.is_infinite(f));
+    CGAL_precondition(!m_tr.is_infinite(f));
 
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
     std::cout << "facet status: "
@@ -933,7 +958,7 @@ class Alpha_wrap_3
     const Cell_handle ch = f.first;
     const int id = f.second;
     const Cell_handle nh = ch->neighbor(id);
-    if(m_dt.is_infinite(nh))
+    if(m_tr.is_infinite(nh))
       return TRAVERSABLE;
 
     if(nh->info().is_outside)
@@ -947,7 +972,7 @@ class Alpha_wrap_3
     // push if facet is connected to artificial vertices
     for(int i=0; i<3; ++i)
     {
-      const Vertex_handle vh = ch->vertex(Dt::vertex_triple_index(id, i));
+      const Vertex_handle vh = ch->vertex(Triangulation::vertex_triple_index(id, i));
       if(vh->info() == BBOX_VERTEX || vh->info() == SEED_VERTEX)
       {
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
@@ -986,9 +1011,9 @@ class Alpha_wrap_3
 
     const Cell_handle ch = f.first;
     const int id = f.second;
-    const Point_3& p0 = m_dt.point(ch, (id+1)&3);
-    const Point_3& p1 = m_dt.point(ch, (id+2)&3);
-    const Point_3& p2 = m_dt.point(ch, (id+3)&3);
+    const Point_3& p0 = m_tr.point(ch, (id+1)&3);
+    const Point_3& p1 = m_tr.point(ch, (id+2)&3);
+    const Point_3& p2 = m_tr.point(ch, (id+3)&3);
 
     // @todo should prob be the real value we compare to alpha instead of squared_radius
     const FT sqr = geom_traits().compute_squared_radius_3_object()(p0, p1, p2);
@@ -1022,7 +1047,7 @@ class Alpha_wrap_3
     m_offset = FT(offset);
     m_sq_offset = square(m_offset);
 
-    m_dt.clear();
+    m_tr.clear();
     m_queue.clear();
 
     insert_bbox_corners();
@@ -1052,7 +1077,7 @@ class Alpha_wrap_3
       // const& to something that will be popped, but safe as `ch` && `id` are extracted before the pop
       const Gate& gate = m_queue.top();
       const Facet& f = gate.facet();
-      CGAL_precondition(!m_dt.is_infinite(f));
+      CGAL_precondition(!m_tr.is_infinite(f));
 
       const Cell_handle ch = f.first;
       const int id = f.second;
@@ -1060,11 +1085,11 @@ class Alpha_wrap_3
 
 #ifdef CGAL_AW3_DEBUG_QUEUE
       static int fid = 0;
-      std::cout << m_dt.number_of_vertices() << " DT vertices" << std::endl;
+      std::cout << m_tr.number_of_vertices() << " DT vertices" << std::endl;
       std::cout << m_queue.size() << " facets in the queue" << std::endl;
       std::cout << "Face " << fid++ << "\n"
-                << "c = " << &*ch << " (" << m_dt.is_infinite(ch) << "), n = " << &*neighbor << " (" << m_dt.is_infinite(neighbor) << ")" << "\n"
-                << m_dt.point(ch, (id+1)&3) << "\n" << m_dt.point(ch, (id+2)&3) << "\n" << m_dt.point(ch, (id+3)&3) << std::endl;
+                << "c = " << &*ch << " (" << m_tr.is_infinite(ch) << "), n = " << &*neighbor << " (" << m_tr.is_infinite(neighbor) << ")" << "\n"
+                << m_tr.point(ch, (id+1)&3) << "\n" << m_tr.point(ch, (id+2)&3) << "\n" << m_tr.point(ch, (id+3)&3) << std::endl;
       std::cout << "Priority: " << gate.priority() << std::endl;
 #endif
 
@@ -1080,11 +1105,11 @@ class Alpha_wrap_3
       std::string face_name = "results/steps/face_" + std::to_string(static_cast<int>(i++)) + ".xyz";
       std::ofstream face_out(face_name);
       face_out.precision(17);
-      face_out << "3\n" << m_dt.point(ch, (id+1)&3) << "\n" << m_dt.point(ch, (id+2)&3) << "\n" << m_dt.point(ch, (id+3)&3) << std::endl;
+      face_out << "3\n" << m_tr.point(ch, (id+1)&3) << "\n" << m_tr.point(ch, (id+2)&3) << "\n" << m_tr.point(ch, (id+3)&3) << std::endl;
       face_out.close();
 #endif
 
-      if(m_dt.is_infinite(neighbor))
+      if(m_tr.is_infinite(neighbor))
       {
         neighbor->info().is_outside = true;
         continue;
@@ -1100,14 +1125,14 @@ class Alpha_wrap_3
         // locate cells that are going to be destroyed and remove their facet from the queue
         int li, lj = 0;
         Locate_type lt;
-        const Cell_handle conflict_cell = m_dt.locate(steiner_point, lt, li, lj, neighbor);
-        CGAL_assertion(lt != Dt::VERTEX);
+        const Cell_handle conflict_cell = m_tr.locate(steiner_point, lt, li, lj, neighbor);
+        CGAL_assertion(lt != Triangulation::VERTEX);
 
         std::vector<Facet> boundary_facets;
         std::vector<Cell_handle> conflict_zone;
         boundary_facets.reserve(32);
         conflict_zone.reserve(32);
-        m_dt.find_conflicts(steiner_point, conflict_cell,
+        m_tr.find_conflicts(steiner_point, conflict_cell,
                             std::back_inserter(boundary_facets),
                             std::back_inserter(conflict_zone));
 
@@ -1125,7 +1150,7 @@ class Alpha_wrap_3
 
         for(const Facet& f : boundary_facets)
         {
-          const Facet mf = m_dt.mirror_facet(f); // boundary facets have incident cells in the CZ
+          const Facet mf = m_tr.mirror_facet(f); // boundary facets have incident cells in the CZ
           if(m_queue.contains_with_bounds_check(Gate(mf)))
             m_queue.erase(Gate(mf));
         }
@@ -1133,18 +1158,18 @@ class Alpha_wrap_3
         visitor.before_Steiner_point_insertion(*this, steiner_point);
 
         // Actual insertion of the Steiner point
-        Vertex_handle vh = m_dt.insert(steiner_point, lt, conflict_cell, li, lj);
+        Vertex_handle vh = m_tr.insert(steiner_point, lt, conflict_cell, li, lj);
         vh->info() = DEFAULT;
 
         visitor.after_Steiner_point_insertion(*this, vh);
 
         std::vector<Cell_handle> new_cells;
         new_cells.reserve(32);
-        m_dt.incident_cells(vh, std::back_inserter(new_cells));
+        m_tr.incident_cells(vh, std::back_inserter(new_cells));
         for(const Cell_handle& ch : new_cells)
         {
           // std::cout << "new cell has time stamp " << ch->time_stamp() << std::endl;
-          ch->info().is_outside = m_dt.is_infinite(ch);
+          ch->info().is_outside = m_tr.is_infinite(ch);
         }
 
         // Push all new boundary facets to the queue.
@@ -1156,7 +1181,7 @@ class Alpha_wrap_3
         {
           for(int i=0; i<4; ++i)
           {
-            if(m_dt.is_infinite(ch, i))
+            if(m_tr.is_infinite(ch, i))
               continue;
 
             const Cell_handle nh = ch->neighbor(i);
@@ -1167,7 +1192,7 @@ class Alpha_wrap_3
             if(ch->info().is_outside)
               push_facet(boundary_f);
             else
-              push_facet(m_dt.mirror_facet(boundary_f));
+              push_facet(m_tr.mirror_facet(boundary_f));
           }
         }
       }
@@ -1188,10 +1213,10 @@ class Alpha_wrap_3
     visitor.on_flood_fill_end(*this);
 
     // Check that no useful facet has been ignored
-    CGAL_postcondition_code(for(auto fit=m_dt.finite_facets_begin(), fend=m_dt.finite_facets_end(); fit!=fend; ++fit) {)
+    CGAL_postcondition_code(for(auto fit=m_tr.finite_facets_begin(), fend=m_tr.finite_facets_end(); fit!=fend; ++fit) {)
     CGAL_postcondition_code(  if(fit->first->info().is_outside == fit->first->neighbor(fit->second)->info().is_outside) continue;)
     CGAL_postcondition_code(  Facet f = *fit;)
-    CGAL_postcondition_code(  if(!fit->first->info().is_outside) f = m_dt.mirror_facet(f);)
+    CGAL_postcondition_code(  if(!fit->first->info().is_outside) f = m_tr.mirror_facet(f);)
     CGAL_postcondition(       facet_status(f) == IRRELEVANT);
     CGAL_postcondition_code(})
   }
@@ -1199,13 +1224,13 @@ class Alpha_wrap_3
 private:
   bool is_non_manifold(Vertex_handle v) const
   {
-    CGAL_precondition(!m_dt.is_infinite(v));
+    CGAL_precondition(!m_tr.is_infinite(v));
 
     bool is_non_manifold = false;
 
     std::vector<Cell_handle> inc_cells;
     inc_cells.reserve(64);
-    m_dt.incident_cells(v, std::back_inserter(inc_cells));
+    m_tr.incident_cells(v, std::back_inserter(inc_cells));
 
     // Flood one inside and outside CC.
     // Process both an inside and an outside CC to also detect edge pinching.
@@ -1278,7 +1303,7 @@ class Alpha_wrap_3
 
   bool is_non_manifold(Cell_handle c) const
   {
-    CGAL_precondition(!m_dt.is_infinite(c));
+    CGAL_precondition(!m_tr.is_infinite(c));
 
     for(int i=0; i<4; ++i)
     {
@@ -1294,7 +1319,7 @@ class Alpha_wrap_3
   {
     // Not the best complexity, but it's not important: this function is purely for information
     // Better complexity --> see PMP::non_manifold_vertices + throw
-    for(const Vertex_handle v : m_dt.finite_vertex_handles())
+    for(const Vertex_handle v : m_tr.finite_vertex_handles())
       if(is_non_manifold(v))
         return true;
 
@@ -1307,14 +1332,14 @@ class Alpha_wrap_3
   bool remove_bbox_vertices()
   {
     bool do_remove = true;
-    auto vit = m_dt.finite_vertices_begin();
+    auto vit = m_tr.finite_vertices_begin();
     for(std::size_t i=0; i<8; ++i)
     {
       Vertex_handle v = vit++;
 
       std::vector<Cell_handle> inc_cells;
       inc_cells.reserve(64);
-      m_dt.finite_incident_cells(v, std::back_inserter(inc_cells));
+      m_tr.finite_incident_cells(v, std::back_inserter(inc_cells));
 
       for(Cell_handle c : inc_cells)
       {
@@ -1333,11 +1358,11 @@ class Alpha_wrap_3
     if(!do_remove)
       return false;
 
-    vit = m_dt.finite_vertices_begin();
+    vit = m_tr.finite_vertices_begin();
     for(std::size_t i=0; i<8; ++i)
     {
       Vertex_handle v = vit++;
-      m_dt.remove(v);
+      m_tr.remove(v);
     }
 
     return true;
@@ -1355,7 +1380,7 @@ class Alpha_wrap_3
 //    remove_bbox_vertices();
 
     std::stack<Vertex_handle> non_manifold_vertices; // @todo sort somehow?
-    for(Vertex_handle v : m_dt.finite_vertex_handles())
+    for(Vertex_handle v : m_tr.finite_vertex_handles())
     {
       if(is_non_manifold(v))
         non_manifold_vertices.push(v);
@@ -1395,17 +1420,17 @@ class Alpha_wrap_3
 //    auto sq_circumradius = [&](Cell_handle c) -> FT
 //    {
 //      const Point_3& cc = circumcenter(c);
-//      return geom_traits().compute_squared_distance_3_object()(m_dt.point(c, 0), cc);
+//      return geom_traits().compute_squared_distance_3_object()(m_tr.point(c, 0), cc);
 //    };
 
     auto sq_longest_edge = [&](Cell_handle c) -> FT
     {
-      return (std::max)({ squared_distance(m_dt.point(c, 0), m_dt.point(c, 1)),
-                          squared_distance(m_dt.point(c, 0), m_dt.point(c, 2)),
-                          squared_distance(m_dt.point(c, 0), m_dt.point(c, 3)),
-                          squared_distance(m_dt.point(c, 1), m_dt.point(c, 2)),
-                          squared_distance(m_dt.point(c, 3), m_dt.point(c, 3)),
-                          squared_distance(m_dt.point(c, 2), m_dt.point(c, 3)) });
+      return (std::max)({ squared_distance(m_tr.point(c, 0), m_tr.point(c, 1)),
+                          squared_distance(m_tr.point(c, 0), m_tr.point(c, 2)),
+                          squared_distance(m_tr.point(c, 0), m_tr.point(c, 3)),
+                          squared_distance(m_tr.point(c, 1), m_tr.point(c, 2)),
+                          squared_distance(m_tr.point(c, 3), m_tr.point(c, 3)),
+                          squared_distance(m_tr.point(c, 2), m_tr.point(c, 3)) });
     };
 
 #ifdef CGAL_AW3_DEBUG_MANIFOLDNESS
@@ -1450,7 +1475,7 @@ class Alpha_wrap_3
 
       std::vector<Cell_handle> inc_cells;
       inc_cells.reserve(64);
-      m_dt.finite_incident_cells(v, std::back_inserter(inc_cells));
+      m_tr.finite_incident_cells(v, std::back_inserter(inc_cells));
 
 #define CGAL_AW3_USE_BRUTE_FORCE_MUTABLE_PRIORITY_QUEUE
 #ifndef CGAL_AW3_USE_BRUTE_FORCE_MUTABLE_PRIORITY_QUEUE
@@ -1464,7 +1489,7 @@ class Alpha_wrap_3
         std::sort(cit, cend, comparer);
 #endif
         Cell_handle ic = *cit;
-        CGAL_assertion(!m_dt.is_infinite(ic));
+        CGAL_assertion(!m_tr.is_infinite(ic));
 
         // This is where new material is added
         ic->info().is_outside = false;
@@ -1484,14 +1509,14 @@ class Alpha_wrap_3
 
       std::vector<Vertex_handle> adj_vertices;
       adj_vertices.reserve(64);
-      m_dt.finite_adjacent_vertices(v, std::back_inserter(adj_vertices));
+      m_tr.finite_adjacent_vertices(v, std::back_inserter(adj_vertices));
 
       for(Vertex_handle nv : adj_vertices)
         if(is_non_manifold(nv))
           non_manifold_vertices.push(nv);
     }
 
-    CGAL_assertion_code(for(Vertex_handle v : m_dt.finite_vertex_handles()))
+    CGAL_assertion_code(for(Vertex_handle v : m_tr.finite_vertex_handles()))
     CGAL_assertion(!is_non_manifold(v));
   }
 
@@ -1508,12 +1533,12 @@ class Alpha_wrap_3
       const Facet& current_f = current_gate.facet();
       const Cell_handle ch = current_f.first;
       const int id = current_f.second;
-      const Point_3& p0 = m_dt.point(ch, (id+1)&3);
-      const Point_3& p1 = m_dt.point(ch, (id+2)&3);
-      const Point_3& p2 = m_dt.point(ch, (id+3)&3);
+      const Point_3& p0 = m_tr.point(ch, (id+1)&3);
+      const Point_3& p1 = m_tr.point(ch, (id+2)&3);
+      const Point_3& p2 = m_tr.point(ch, (id+3)&3);
       const FT sqr = geom_traits().compute_squared_radius_3_object()(p0, p1, p2);
 
-      std::cout << "At Facet with VID " << get(Gate_ID_PM<Dt>(), current_gate)  << std::endl;
+      std::cout << "At Facet with VID " << get(Gate_ID_PM<Triangulation>(), current_gate)  << std::endl;
 
       if(current_gate.priority() != sqr)
         std::cerr << "Error: facet in queue has wrong priority" << std::endl;
@@ -1546,7 +1571,7 @@ class Alpha_wrap_3
     std::size_t nv = 0;
     std::size_t nf = 0;
 
-    for(auto fit=m_dt.finite_facets_begin(), fend=m_dt.finite_facets_end(); fit!=fend; ++fit)
+    for(auto fit=m_tr.finite_facets_begin(), fend=m_tr.finite_facets_end(); fit!=fend; ++fit)
     {
       Cell_handle c = fit->first;
       int s = fit->second;
@@ -1562,7 +1587,7 @@ class Alpha_wrap_3
         auto insertion_res = vertex_to_id.emplace(v, nv);
         if(insertion_res.second)
         {
-          vertices_ss << m_dt.point(v) << "\n";
+          vertices_ss << m_tr.point(v) << "\n";
           ++nv;
         }
 

From 924f2df4925ac6f1da1f523654a50ac79a86b9d7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 21 Jul 2023 16:24:45 +0200
Subject: [PATCH 0509/1398] Add an example: remeshing the (internal) 3D
 triangulation of an alpha wrap

---
 .../examples/Alpha_wrap_3/CMakeLists.txt      |   1 +
 .../examples/Alpha_wrap_3/volumetric_wrap.cpp | 174 ++++++++++++++++++
 2 files changed, 175 insertions(+)
 create mode 100644 Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt b/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt
index 2014b9baa7ca..0be54f87eed0 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt
@@ -12,3 +12,4 @@ create_single_source_cgal_program("triangle_soup_wrap.cpp")
 create_single_source_cgal_program("point_set_wrap.cpp")
 create_single_source_cgal_program("wrap_from_cavity.cpp")
 create_single_source_cgal_program("mixed_inputs_wrap.cpp")
+create_single_source_cgal_program("volumetric_wrap.cpp")
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
new file mode 100644
index 000000000000..7fb4d4704207
--- /dev/null
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
@@ -0,0 +1,174 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/alpha_wrap_3.h>
+
+#include <CGAL/tetrahedral_remeshing.h>
+#include <CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h>
+#include <CGAL/Tetrahedral_remeshing/Remeshing_vertex_base_3.h>
+#include <CGAL/Simplicial_mesh_cell_base_3.h>
+#include <CGAL/Simplicial_mesh_vertex_base_3.h>
+
+#include <CGAL/Polygon_mesh_processing/bbox.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/property_map.h>
+#include <CGAL/Real_timer.h>
+
+#include <CGAL/Delaunay_triangulation_3.h>
+#include <CGAL/draw_triangulation_3.h>
+
+#include <CGAL/IO/Triangulation_off_ostream_3.h>
+#include <CGAL/IO/File_medit.h>
+
+#include <iostream>
+#include <string>
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+namespace AW3i = CGAL::Alpha_wraps_3::internal;
+
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Point_3 = K::Point_3;
+
+using Points = std::vector<Point_3>;
+using Face = std::array<std::size_t, 3>;
+using Faces = std::vector<Face>;
+
+using Mesh = CGAL::Surface_mesh<Point_3>;
+
+// If we provide a triangulation, AW3 uses its Gt, so we have to make the Gt stack explicit
+using Gtb = AW3i::Alpha_wrap_AABB_geom_traits<K>; // provides Ball_3
+using Gt = CGAL::Robust_circumcenter_filtered_traits_3<Gtb>; // better inexact constructions (not mandatory)
+
+// Since we are going to use tetrahedral remeshing on the underlying triangulation,
+// we need special vertex and cell base types that meets the requirements of the
+// tetrahedral remeshing concepts
+using Vbbb = AW3i::Alpha_wrap_triangulation_vertex_base_3<K>;
+using Vbb = CGAL::Simplicial_mesh_vertex_base_3<K, int, int, int, int, Vbbb>;
+using Vb = CGAL::Tetrahedral_remeshing::Remeshing_vertex_base_3<K, Vbb>;
+
+using Cbbb = AW3i::Alpha_wrap_triangulation_cell_base_3<K>;
+using Cbb = CGAL::Simplicial_mesh_cell_base_3<K, int, int, Cbbb>;
+using Cb = CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3<K, Cbb>;
+
+using Tds = CGAL::Triangulation_data_structure_3<Vb, Cb>;
+
+using Delaunay_triangulation = CGAL::Delaunay_triangulation_3<Gt, Tds, CGAL::Fast_location>;
+
+// because the Fast_location does all kinds of rebinding shenanigans + T3_hierarchy is in the stack...
+using Triangulation = CGAL::Triangulation_3<typename Delaunay_triangulation::Geom_traits,
+                                            typename Delaunay_triangulation::Triangulation_data_structure>;
+
+using Facet = Triangulation::Facet;
+
+int main(int argc, char** argv)
+{
+  // Read the input
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/armadillo.off");
+  std::cout << "Reading " << filename << "..." << std::endl;
+
+  Points points;
+  Faces faces;
+  if(!CGAL::IO::read_polygon_soup(filename, points, faces) || faces.empty())
+  {
+    std::cerr << "Invalid input." << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::cout << "Input: " << points.size() << " vertices, " << faces.size() << " faces" << std::endl;
+
+  // Compute the alpha and offset values
+  const double relative_alpha = (argc > 2) ? std::stod(argv[2]) : 20.;
+  const double relative_offset = (argc > 3) ? std::stod(argv[3]) : 600.;
+
+  CGAL::Bbox_3 bbox;
+  for(const Point_3& p : points)
+    bbox += p.bbox();
+
+  const double diag_length = std::sqrt(CGAL::square(bbox.xmax() - bbox.xmin()) +
+                                       CGAL::square(bbox.ymax() - bbox.ymin()) +
+                                       CGAL::square(bbox.zmax() - bbox.zmin()));
+
+  const double alpha = diag_length / relative_alpha;
+  const double offset = diag_length / relative_offset;
+  std::cout << "alpha: " << alpha << ", offset: " << offset << std::endl;
+
+  // Construct the wrap
+  CGAL::Real_timer t;
+  t.start();
+
+  using Oracle = CGAL::Alpha_wraps_3::internal::Triangle_soup_oracle<K>;
+
+  Oracle oracle(K{});
+  oracle.add_triangle_soup(points, faces, CGAL::parameters::default_values());
+
+  CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle, Delaunay_triangulation> aw3(oracle);
+  Mesh wrap;
+  aw3(alpha, offset, wrap);
+
+  t.stop();
+  std::cout << "Result: " << num_vertices(wrap) << " vertices, " << num_faces(wrap) << " faces" << std::endl;
+  std::cout << "Took " << t.time() << " s." << std::endl;
+
+  // Get the interior tetrahedrization
+  auto dt = aw3.triangulation();
+
+  // Save the result
+  std::string input_name = std::string(filename);
+  input_name = input_name.substr(input_name.find_last_of("/") + 1, input_name.length() - 1);
+  input_name = input_name.substr(0, input_name.find_last_of("."));
+  std::string output_name = input_name
+                            + "_" + std::to_string(static_cast<int>(relative_alpha))
+                            + "_" + std::to_string(static_cast<int>(relative_offset)) + ".off";
+  std::cout << "Writing to " << output_name << std::endl;
+  CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
+
+  // Remesh the interior of the wrap
+  const Delaunay_triangulation& aw3_dt = aw3.triangulation();
+  const Triangulation& aw3_tr = static_cast<const Triangulation&>(aw3_dt);
+  Triangulation tr = aw3_tr; // intentional copy
+
+  std::cout << "BEFORE: " << tr.number_of_vertices() << " vertices, " << tr.number_of_cells() << " cells" << std::endl;
+
+  // Set up the domain information and grab the boundary faces
+  std::set<Facet> boundary_facets;
+
+  for(auto v : tr.finite_vertex_handles())
+    v->set_dimension(3);
+
+  for(auto c : tr.finite_cell_handles())
+  {
+    if(c->info().is_outside)
+      c->set_subdomain_index(0);
+    else
+      c->set_subdomain_index(1);
+
+    // if the neighboring cell has a different outside info, put the vertices
+    // of the common face on the surface boundary
+    for(int i=0; i<4; ++i)
+    {
+      if(c->neighbor(i)->info().is_outside != c->info().is_outside)
+      {
+        c->set_surface_patch_index(i, 1);
+        boundary_facets.emplace(c, i);
+        for(int j=1; j<4; ++j)
+          c->vertex((i+j)%4)->set_dimension(2);
+      }
+    }
+  }
+
+  // CGAL::draw(tr);
+  std::ofstream out_before("before_remeshing.mesh");
+  CGAL::IO::write_MEDIT(out_before, tr);
+
+  auto fcm = CGAL::make_boolean_property_map(boundary_facets);
+  CGAL::tetrahedral_isotropic_remeshing(tr, alpha,
+                                        CGAL::parameters::facet_is_constrained_map(fcm));
+
+  std::cout << "AFTER: " << tr.number_of_vertices() << " vertices, " << tr.number_of_cells() << " cells" << std::endl;
+
+  // CGAL::draw(tr);
+  std::ofstream out_after("after_remeshing.mesh");
+  CGAL::IO::write_MEDIT(out_after, tr);
+
+  return EXIT_SUCCESS;
+}

From e0bb872d8a8160bf962236a1528ae288b39d6085 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 21 Jul 2023 16:26:12 +0200
Subject: [PATCH 0510/1398] Minor doc typo

---
 .../doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt         | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
index 6336998d527c..5ae7a8273737 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
@@ -15,7 +15,7 @@ namespace CGAL {
 \section secTetRemeshing Multi-Material Isotropic Tetrahedral Remeshing
 
 This package implements an algorithm for quality tetrahedral remeshing,
-introduced by N.Faraj et al in \cgalCite{faraj2016mvr}.
+introduced by Faraj et al in \cgalCite{faraj2016mvr}.
 This practical iterative remeshing algorithm is designed to remesh
 multi-material tetrahedral meshes, by iteratively performing a sequence of
 elementary operations such as edge splits, edge collapses, edge flips,

From e1d7105c1cf58cabbd38d71cc3a5be8aa871ddf9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 21 Jul 2023 16:47:03 +0200
Subject: [PATCH 0511/1398] add visitor + add calls to the visitor

---
 .../Concepts/PMPAutorefinementVisitor.h       | 25 +++++++
 .../Polygon_mesh_processing/autorefinement.h  | 75 +++++++++++++++----
 2 files changed, 84 insertions(+), 16 deletions(-)
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPAutorefinementVisitor.h

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPAutorefinementVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPAutorefinementVisitor.h
new file mode 100644
index 000000000000..e3ef90e9be03
--- /dev/null
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPAutorefinementVisitor.h
@@ -0,0 +1,25 @@
+/// \ingroup PkgPolygonMeshProcessingConcepts
+/// \cgalConcept
+///
+/// The concept `PMPAutorefinementVisitor` defines the requirements for the visitor
+/// used in `CGAL::Polygon_mesh_processing::autorefine_triangle_soup()` to track
+/// the creation of new triangles.
+///
+/// \cgalRefines{CopyConstructible}
+/// \cgalHasModel `CGAL::Polygon_mesh_processing::Autorefinement::Default_visitor`.
+
+class PMPAutorefinementVisitor{
+public:
+
+/// @name Functions called only if at least one intersection has been found
+/// @{
+  /// called when the final number of output triangles is known, `nbt` being the total number of triangles in the output.
+  void number_of_output_triangles(std::size_t nbt);
+  /// called for triangle with no intersection, `tgt_id` is the position in the triangle container after calling
+  /// `autorefine_triangle_soup()`, while `src_id` was its position before calling the function.
+  void verbatim_triangle_copy(std::size_t tgt_id, std::size_t src_id);
+  /// called for each subtriangle created from a triangle with intersection, `tgt_id` is the position in the triangle container after calling
+  /// `autorefine_triangle_soup()` of the subtriangle, while `src_id` was the position of the original support triangle before calling the function.
+  void new_subtriangle(std::size_t tgt_id, std::size_t src_id);
+/// @}
+};
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 0054a9dcdb2d..166c950a9830 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -77,6 +77,24 @@
 namespace CGAL {
 namespace Polygon_mesh_processing {
 
+namespace Autorefinement {
+
+/** \ingroup PMP_corefinement_grp
+ *  %Default visitor model of `PMPAutorefinementVisitor`.
+ *  All of its functions have an empty body. This class can be used as a
+ *  base class if only some of the functions of the concept require to be
+ *  overridden.
+ */
+struct Default_visitor
+{
+  inline void number_of_output_triangles(std::size_t /*nbt*/) {}
+  inline void verbatim_triangle_copy(std::size_t /*tgt_id*/, std::size_t /*src_id*/) {}
+  inline void new_subtriangle(std::size_t /*tgt_id*/, std::size_t /*src_id*/) {}
+};
+
+} // end of Autorefinement visitor
+
+
 #ifndef DOXYGEN_RUNNING
 namespace autorefine_impl {
 
@@ -1079,13 +1097,13 @@ void generate_subtriangles(std::size_t ti,
     for (typename CDT::Face_handle fh : cdt.finite_face_handles())
     {
       if (orientation_flipped)
-        new_triangles.push_back( CGAL::make_array(fh->vertex(0)->point(),
-                                                  fh->vertex(cdt.cw(0))->point(),
-                                                  fh->vertex(cdt.ccw(0))->point()) );
+        new_triangles.push_back( { CGAL::make_array(fh->vertex(0)->point(),
+                                                    fh->vertex(cdt.cw(0))->point(),
+                                                    fh->vertex(cdt.ccw(0))->point()), ti } );
       else
-        new_triangles.push_back( CGAL::make_array(fh->vertex(0)->point(),
-                                                  fh->vertex(cdt.ccw(0))->point(),
-                                                  fh->vertex(cdt.cw(0))->point()) );
+        new_triangles.push_back( { CGAL::make_array(fh->vertex(0)->point(),
+                                                    fh->vertex(cdt.ccw(0))->point(),
+                                                    fh->vertex(cdt.cw(0))->point()), ti } );
 #ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS
       ++nbt;
       buffer << fh->vertex(0)->point() << "\n";
@@ -1143,8 +1161,9 @@ void generate_subtriangles(std::size_t ti,
 *   \cgalParamNEnd
 *   \cgalParamNBegin{visitor}
 *     \cgalParamDescription{a visitor used to track the creation of new faces}
-*     \cgalParamType{a class model of `PMPFooBar`}
-*     \cgalParamDefault{`Autorefinement::Default_visitor<Bar, Foo>`}
+*     \cgalParamType{a class model of `PMPAutorefinementVisitor`}
+*     \cgalParamDefault{`Autorefinement::Default_visitor`}
+*     \cgalParamExtra{The visitor will be copied.}
 *   \cgalParamNEnd
 * \cgalNamedParamsEnd
 *
@@ -1167,6 +1186,15 @@ void autorefine_triangle_soup(PointRange& soup_points,
     Sequential_tag
   > ::type Concurrency_tag;
 
+  // visitor
+  typedef typename internal_np::Lookup_named_param_def <
+    internal_np::visitor_t,
+    NamedParameters,
+    Autorefinement::Default_visitor//default
+  > ::type Visitor;
+  Visitor visitor(choose_parameter<Visitor>(get_parameter(np, internal_np::visitor)));
+
+
   constexpr bool parallel_execution = std::is_same_v<Parallel_tag, Concurrency_tag>;
 
 #ifndef CGAL_LINKED_WITH_TBB
@@ -1369,10 +1397,10 @@ void autorefine_triangle_soup(PointRange& soup_points,
   // now refine triangles
 #ifdef CGAL_LINKED_WITH_TBB
   std::conditional_t<parallel_execution,
-                     tbb::concurrent_vector<std::array<EK::Point_3, 3>>,
-                     std::vector<std::array<EK::Point_3,3>>> new_triangles;
+                     tbb::concurrent_vector<std::pair<std::array<EK::Point_3,3>, std::size_t>>,
+                     std::vector<std::pair<std::array<EK::Point_3,3>, std::size_t>>> new_triangles;
 #else
-  std::vector<std::array<EK::Point_3,3>> new_triangles;
+  std::vector<std::pair<std::array<EK::Point_3,3>, std::size_t>> new_triangles;
 #endif
 
 #ifdef USE_PROGRESS_DISPLAY
@@ -1382,7 +1410,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   auto refine_triangles = [&](std::size_t ti)
   {
     if (all_segments[ti].empty() && all_points[ti].empty())
-      new_triangles.push_back(triangles[ti]);
+      new_triangles.push_back({triangles[ti], ti});
     else
     {
 #ifdef USE_FIXED_PROJECTION_TRAITS
@@ -1475,7 +1503,10 @@ void autorefine_triangle_soup(PointRange& soup_points,
   TriIdsRange soup_triangles_out;
   soup_triangles_out.reserve(soup_triangles.size()); // TODO: remove #deg tri?
 
+  visitor.number_of_output_triangles(soup_triangles.size()+new_triangles.size());
+
   // raw copy of input triangles with no intersection
+  std::vector<std::size_t> tri_inter_ids_inverse(triangles.size());
   for (Input_TID f=0; f<soup_triangles.size(); ++f)
   {
     if (is_degen[f]) continue; //skip degenerate faces
@@ -1483,10 +1514,15 @@ void autorefine_triangle_soup(PointRange& soup_points,
     int tiid = tri_inter_ids[f];
     if (tiid == -1)
     {
+      visitor.verbatim_triangle_copy(soup_triangles.size(), f);
       soup_triangles_out.push_back(
         {soup_triangles[f][0], soup_triangles[f][1], soup_triangles[f][2]}
       );
     }
+    else
+    {
+      tri_inter_ids_inverse[tiid]=f;
+    }
   }
 
   // import refined triangles
@@ -1544,7 +1580,8 @@ void autorefine_triangle_soup(PointRange& soup_points,
     tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
       [&](const tbb::blocked_range<size_t>& r) {
         for (size_t ti = r.begin(); ti != r.end(); ++ti) {
-          const std::array<EK::Point_3, 3>& t = new_triangles[ti];
+          const std::array<EK::Point_3, 3>& t = new_triangles[ti].first;
+          visitor.new_subtriangle(offset+ti, tri_inter_ids_inverse[new_triangles[ti].second]);
           triangle_buffer[ti] = CGAL::make_array(concurrent_get_point_id(t[0]), concurrent_get_point_id(t[1]), concurrent_get_point_id(t[2]));
         }
       }
@@ -1581,7 +1618,8 @@ void autorefine_triangle_soup(PointRange& soup_points,
           if (offset + ti > soup_triangles_out.size()) {
               std::cout << "ti = " << ti << std::endl;
           }
-          const std::array<EK::Point_3, 3>& t = new_triangles[ti];
+          const std::array<EK::Point_3, 3>& t = new_triangles[ti].first;
+          visitor.new_subtriangle(offset+ti, tri_inter_ids_inverse[new_triangles[ti].second]);
           triangle_buffer[ti] = CGAL::make_array(concurrent_get_point_id(t[0]), concurrent_get_point_id(t[1]), concurrent_get_point_id(t[2]));
         }
       }
@@ -1627,8 +1665,13 @@ void autorefine_triangle_soup(PointRange& soup_points,
     mode = "sequential";
 #endif
     soup_triangles_out.reserve(offset + new_triangles.size());
-    for (const std::array<EK::Point_3,3>& t : new_triangles)
-      soup_triangles_out.push_back({ get_point_id(t[0]), get_point_id(t[1]), get_point_id(t[2])});
+    for (const std::pair<std::array<EK::Point_3,3>, std::size_t>& t_and_id : new_triangles)
+    {
+      visitor.new_subtriangle(soup_triangles_out.size(), tri_inter_ids_inverse[t_and_id.second]);
+      soup_triangles_out.push_back({ get_point_id(t_and_id.first[0]),
+                                     get_point_id(t_and_id.first[1]),
+                                     get_point_id(t_and_id.first[2]) });
+    }
   }
 
 

From 9822f371dded06a2538281c5f97b0d343a5c0939 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 21 Jul 2023 16:54:21 +0200
Subject: [PATCH 0512/1398] doc precision

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h    | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 166c950a9830..6bbb5571e7a1 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1702,6 +1702,9 @@ void autorefine_triangle_soup(PointRange& soup_points,
  * \ingroup PMP_corefinement_grp
  * refines a triangle mesh so that no triangles intersects in their interior.
  *
+ * Note that this function is only provided as a shortcut for calling `autorefine_triangle_soup()`
+ * with a mesh. For any advance usage the aforementioned function should be called directly.
+ *
  * @tparam TriangleMesh a model of `HalfedgeListGraph`, `FaceListGraph`, and `MutableFaceGraph`
  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
  *
@@ -1745,7 +1748,7 @@ autorefine(      TriangleMesh& tm,
 
   autorefine_triangle_soup(soup_points, soup_triangles);
 
-  clear(tm);
+  clear(tm); //TODO: keep properties
   repair_polygon_soup(soup_points, soup_triangles);
 
   duplicate_non_manifold_edges_in_polygon_soup(soup_points, soup_triangles);

From d1779ca36d18ecc1be5d1fb50e9f66a66d47ea61 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 21 Jul 2023 17:03:34 +0200
Subject: [PATCH 0513/1398] doc concurrency_tag

---
 .../CGAL/Polygon_mesh_processing/autorefinement.h    | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 6bbb5571e7a1..0fb843c31c00 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1148,6 +1148,11 @@ void generate_subtriangles(std::size_t ti,
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
 * \cgalNamedParamsBegin
+*   \cgalParamNBegin{concurrency_tag}
+*     \cgalParamDescription{a tag indicating if the task should be done using one or several threads.}
+*     \cgalParamType{Either `CGAL::Sequential_tag`, or `CGAL::Parallel_tag`, or `CGAL::Parallel_if_available_tag`}
+*     \cgalParamDefault{`CGAL::Sequential_tag`}
+*   \cgalParamNEnd
 *   \cgalParamNBegin{point_map}
 *     \cgalParamDescription{a property map associating points to the elements of the range `soup_points`}
 *     \cgalParamType{a model of `ReadWritePropertyMap` whose value type is a point type}
@@ -1712,6 +1717,11 @@ void autorefine_triangle_soup(PointRange& soup_points,
  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
  *
  * \cgalNamedParamsBegin
+ *   \cgalParamNBegin{concurrency_tag}
+ *     \cgalParamDescription{a tag indicating if the task should be done using one or several threads.}
+ *     \cgalParamType{Either `CGAL::Sequential_tag`, or `CGAL::Parallel_tag`, or `CGAL::Parallel_if_available_tag`}
+ *     \cgalParamDefault{`CGAL::Sequential_tag`}
+ *   \cgalParamNEnd
  *   \cgalParamNBegin{geom_traits}
  *     \cgalParamDescription{an instance of a geometric traits class}
  *     \cgalParamType{a class model of `PMPSelfIntersectionTraits`}
@@ -1746,7 +1756,7 @@ autorefine(      TriangleMesh& tm,
 
   polygon_mesh_to_polygon_soup(tm, soup_points, soup_triangles, np);
 
-  autorefine_triangle_soup(soup_points, soup_triangles);
+  autorefine_triangle_soup(soup_points, soup_triangles, np);
 
   clear(tm); //TODO: keep properties
   repair_polygon_soup(soup_points, soup_triangles);

From 32054661c7242b63592fe32abad3a806b3c690e2 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Fri, 21 Jul 2023 19:21:09 +0200
Subject: [PATCH 0514/1398] issue #7395 Improvement of layout of model
 relations

Replacing the `cgalModelsBare` construct with a `begin` / `end` construct so no less understandable constructs with `\,` and `\n` are necessary.
---
 .../AABB_halfedge_graph_segment_primitive.h   |  6 +++--
 AABB_tree/include/CGAL/AABB_primitive.h       |  6 +++--
 BGL/doc/BGL/CGAL/boost/graph/properties.h     | 10 +++++++++
 .../doc/resources/1.8.13/BaseDoxyfile.in      |  5 +++--
 .../doc/resources/1.9.6/BaseDoxyfile.in       |  5 +++--
 .../doc/HalfedgeDS/CGAL/HalfedgeDS_default.h  |  2 ++
 .../doc/HalfedgeDS/CGAL/HalfedgeDS_list.h     |  2 ++
 .../doc/HalfedgeDS/CGAL/HalfedgeDS_vector.h   |  2 ++
 .../Kernel_23/CGAL/Projection_traits_xy_3.h   | 19 +++++++++++-----
 .../doc/Number_types/CGAL/Sqrt_extension.h    | 18 ++++++++-------
 Polynomial/doc/Polynomial/CGAL/Polynomial.h   | 22 ++++++++++---------
 .../Triangulation_face_base_with_info_2.h     |  6 +++--
 .../Triangulation_vertex_base_with_info_2.h   |  8 ++++---
 13 files changed, 74 insertions(+), 37 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
index e7010f4ce530..135682273199 100644
--- a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
@@ -41,8 +41,10 @@ namespace CGAL {
  * of `VertexPointPMap` (using the `Kernel_traits` mechanism).
  * The segment type of the primitive (`Datum`) is `CGAL::Kernel_traits< boost::property_traits< VertexPointPMap >::%value_type >::%Kernel::Segment_3`.
  *
- * \cgalModelsBare{`AABBPrimitive` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_false`,
- *                 `AABBPrimitiveWithSharedData` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_true`}
+ * \cgalModelsBareBegin
+ * \cgalModelsBare{`AABBPrimitive` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_false`}
+ * \cgalModelsBare{`AABBPrimitiveWithSharedData` if `OneHalfedgeGraphPerTree` is `CGAL::Tag_true`}
+ * \cgalModelsBareEnd
  *
  * \tparam HalfedgeGraph is a model of the halfedge graph concept.
  *   as key type and a \cgal Kernel `Point_3` as value type.
diff --git a/AABB_tree/include/CGAL/AABB_primitive.h b/AABB_tree/include/CGAL/AABB_primitive.h
index b31cf5a74de0..4c58b83f4dba 100644
--- a/AABB_tree/include/CGAL/AABB_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_primitive.h
@@ -53,8 +53,10 @@ struct AABB_primitive_base
  * The two property maps which are template parameters of the class enable to get the datum and the reference point of
  * the primitive from the identifier. The last template parameter controls whether the primitive class holds a copy of the datum.
  *
- * \cgalModelsBare{`AABBPrimitive` if `ExternalPropertyMaps` is `CGAL::Tag_false`,
- *                 `AABBPrimitiveWithSharedData` if `ExternalPropertyMaps` is `CGAL::Tag_true`}
+ * \cgalModelsBareBegin
+ * \cgalModelsBare{`AABBPrimitive` if `ExternalPropertyMaps` is `CGAL::Tag_false`}
+ * \cgalModelsBare{`AABBPrimitiveWithSharedData` if `ExternalPropertyMaps` is `CGAL::Tag_true`}
+ * \cgalModelsBareEnd
  *
  * \tparam ObjectPropertyMap is a model of `ReadablePropertyMap` with `Id` as
  *           `key_type`. It must be a model of `CopyConstructible`, `DefaultConstructible`, and `CopyAssignable`.
diff --git a/BGL/doc/BGL/CGAL/boost/graph/properties.h b/BGL/doc/BGL/CGAL/boost/graph/properties.h
index 57b9f10c1cbe..b8b2ab38e21c 100644
--- a/BGL/doc/BGL/CGAL/boost/graph/properties.h
+++ b/BGL/doc/BGL/CGAL/boost/graph/properties.h
@@ -6,31 +6,41 @@ namespace CGAL {
 
 /// The constant `vertex_index` is a property tag which identifies the <i>index</i> property of a vertex of a \bgl
 /// <a href="https://www.boost.org/libs/graph/doc/Graph.html"><code>Graph</code></a>.
+/// \cgalModelsBareBegin
 /// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
+/// \cgalModelsBareEnd
 enum vertex_index_t { vertex_index };
 
 /// The constant `halfedge_index` is a property tag which identifies the <i>index</i> property of a halfedge of a `HalfedgeGraph`.
 ///
 /// This is a property tag introduced by \cgal.
+/// \cgalModelsBareBegin
 /// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
+/// \cgalModelsBareEnd
 enum halfedge_index_t { halfedge_index };
 
 /// The constant `edge_index` is a property tag which identifies the <i>index</i> property of an edge of a \bgl
 /// <a href="https://www.boost.org/libs/graph/doc/Graph.html"><code>Graph</code></a>.
+/// \cgalModelsBareBegin
 /// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
+/// \cgalModelsBareEnd
 enum edge_index_t { edge_index };
 
 /// The constant `face_index` is a property tag which identifies the <i>index</i> property of a face of a `FaceGraph`.
 ///
 /// This is a property tag introduced by \cgal.
+/// \cgalModelsBareBegin
 /// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
+/// \cgalModelsBareEnd
 enum face_index_t { face_index };
 
 /// The constant `vertex_point` is a property tag which refers to the  geometric embedding property of
 /// a vertex of a `HalfedgeGraph`.
 ///
 /// This is a property tag introduced by \cgal.
+/// \cgalModelsBareBegin
 /// \cgalModelsBare{<a href="https://www.boost.org/libs/graph/doc/PropertyTag.html"><code>PropertyTag</code></a>}
+/// \cgalModelsBareEnd
 enum vertex_point_t { vertex_point };
 
 /// @}
diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index deddf49dfa24..59b274cc823d 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -142,8 +142,9 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalModels{4}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd></dl>" \
                          "cgalModels{5}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd></dl>" \
                          "cgalModels{6}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd><dt></dt><dd>@c \6</dd></dl>" \
-                         "cgalModelsBare{1}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd></dl>" \
-                         "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
+                         "cgalModelsBareBegin=<dl><dt>@cgalModelsHeader</dt><dd></dd>" \
+                         "cgalModelsBareEnd=</dl>" \
+                         "cgalModelsBare{1}=<dt></dt><dd>\1</dd>" \
                          "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \
                          "cgalHasModelsHeader=Has models" \
                          "cgalHasModelsBegin=<dl><dt>@cgalHasModelsHeader</dt><dd></dd>" \
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index b75f7ef3d328..15a620ba6736 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -151,8 +151,9 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalModels{4}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd></dl>" \
                          "cgalModels{5}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd></dl>" \
                          "cgalModels{6}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd><dt></dt><dd>@c \6</dd></dl>" \
-                         "cgalModelsBare{1}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd></dl>" \
-                         "cgalModelsBare{2}=<dl><dt>@cgalModelsHeader</dt><dd>\1</dd><dt></dt><dd>\2</dd></dl>" \
+                         "cgalModelsBareBegin=<dl><dt>@cgalModelsHeader</dt><dd></dd>" \
+                         "cgalModelsBareEnd=</dl>" \
+                         "cgalModelsBare{1}=<dt></dt><dd>\1</dd>" \
                          "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \
                          "cgalHasModelsHeader=Has models" \
                          "cgalHasModelsBegin=<dl><dt>@cgalHasModelsHeader</dt><dd></dd>" \
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h
index ca8f1e6eee66..154d01373aa7 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_default.h
@@ -10,7 +10,9 @@ uses the \cgal default allocator as default setting. `HalfedgeDS_default` is a
 list-based representation with bidirectional iterators that supports
 removal.
 
+\cgalModelsBareBegin
 \cgalModelsBare{`HalfedgeDS<Traits,Items,Alloc>`}
+\cgalModelsBareEnd
 
 \sa `CGAL::HalfedgeDS_list`
 \sa `CGAL::HalfedgeDS_vector`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h
index 0df742df464f..e30952e1e1b4 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_list.h
@@ -7,7 +7,9 @@ The class `HalfedgeDS_list` is a model for the `HalfedgeDS` concept.
 `HalfedgeDS_list` is a list-based representation with bidirectional
 iterators that supports removal.
 
+\cgalModelsBareBegin
 \cgalModelsBare{`HalfedgeDS<Traits,Items,Alloc>`}
+\cgalModelsBareEnd
 
 \sa `CGAL::HalfedgeDS_default`
 \sa `CGAL::HalfedgeDS_vector`
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vector.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vector.h
index d2f29447128f..33fa7dc5237b 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vector.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_vector.h
@@ -7,7 +7,9 @@ The class `HalfedgeDS_vector` is a model for the `HalfedgeDS` concept.
 `HalfedgeDS_vector` is a vector-based representation with random
 access iterators that does not support removal.
 
+\cgalModelsBareBegin
 \cgalModelsBare{`HalfedgeDS<Traits,Items,Alloc>`}
+\cgalModelsBareEnd
 
 \sa `CGAL::HalfedgeDS_default`
 \sa `CGAL::HalfedgeDS_list`
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
index d9911834c80c..f5fc8910f1e0 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Projection_traits_xy_3.h
@@ -21,12 +21,19 @@ constructions or if `K` is a `CGAL::Filtered_kernel` (such as for
 `CGAL::Exact_predicates_inexact_constructions_kernel`), this class automatically
 provides exact predicates.
 
-\cgalModelsBare{The class is a model of several 2D triangulation traits class concepts\,
-  except that it does not provide the type and constructors
-  required to build the dual Voronoi diagram.\n
-            `PolygonTraits_2`\n`ConvexHullTraits_2`\n`TriangulationTraits_2`\n`DelaunayTriangulationTraits_2`\n
-            `ConstrainedTriangulationTraits_2`\n`ConvexHullTraits_2`\n`DelaunayMeshTraits_2`\n`AnalyticWeightTraits_2`\n
-            `Barycentric_coordinates::BarycentricTraits_2`}
+\cgalModelsBareBegin
+\cgalModelsBare{The class is a model of several 2D triangulation traits class concepts,
+  except that it does not provide the type and constructors required to build the dual Voronoi diagram.}
+\cgalModelsBare{`PolygonTraits_2`}
+\cgalModelsBare{`ConvexHullTraits_2`}
+\cgalModelsBare{`TriangulationTraits_2`}
+\cgalModelsBare{`DelaunayTriangulationTraits_2`}
+\cgalModelsBare{`ConstrainedTriangulationTraits_2`}
+\cgalModelsBare{`ConvexHullTraits_2`}
+\cgalModelsBare{`DelaunayMeshTraits_2`}
+\cgalModelsBare{`AnalyticWeightTraits_2`}
+\cgalModelsBare{`Barycentric_coordinates::BarycentricTraits_2`}
+\cgalModelsBareEnd
 
 \sa `CGAL::Projection_traits_3`
 */
diff --git a/Number_types/doc/Number_types/CGAL/Sqrt_extension.h b/Number_types/doc/Number_types/CGAL/Sqrt_extension.h
index 494da54aa4b9..8281df433394 100644
--- a/Number_types/doc/Number_types/CGAL/Sqrt_extension.h
+++ b/Number_types/doc/Number_types/CGAL/Sqrt_extension.h
@@ -87,14 +87,16 @@ The fourth template argument, `FilterPredicates`, triggers an internal filter th
 
 In case `NT` is not `RealEmbeddable`, `DifferentExtensionComparable` as well as `FilterPredicates` have no effect.
 
-\cgalModelsBare{`Assignable`\n
-            `CopyConstructible`\n
-            `DefaultConstructible`\n
-            `EqualityComparable`\n
-            `ImplicitInteroperable` with `int`\n
-            `ImplicitInteroperable` with `NT`\n
-            `Fraction` if NT is a `Fraction`\n
-            `RootOf_2`}
+\cgalModelsBareBegin
+\cgalModelsBare{`Assignable`}
+\cgalModelsBare{`CopyConstructible`}
+\cgalModelsBare{`DefaultConstructible`}
+\cgalModelsBare{`EqualityComparable`}
+\cgalModelsBare{`ImplicitInteroperable` with `int`}
+\cgalModelsBare{`ImplicitInteroperable` with `NT`}
+\cgalModelsBare{`Fraction` if NT is a `Fraction`}
+\cgalModelsBare{`RootOf_2`}
+\cgalModelsBareEnd
 
 \sa `IntegralDomainWithoutDivision`
 \sa `IntegralDomain`
diff --git a/Polynomial/doc/Polynomial/CGAL/Polynomial.h b/Polynomial/doc/Polynomial/CGAL/Polynomial.h
index 77d9235aa0e1..6e8be4268621 100644
--- a/Polynomial/doc/Polynomial/CGAL/Polynomial.h
+++ b/Polynomial/doc/Polynomial/CGAL/Polynomial.h
@@ -53,16 +53,18 @@ the coefficient sequence does not contain leading zero coefficients
 (where leading means at the high-degree end), with the exception that
 the zero polynomial is represented by a single zero coefficient.
 
-\cgalModelsBare{`Polynomial_d`\n
-            `Assignable`\n
-            `CopyConstructible`\n
-            `DefaultConstructible`\n
-            `EqualityComparable`\n
-            `ImplicitInteroperable` with int\n
-            `ImplicitInteroperable` with Coeff\n
-            `Fraction` if Coeff is model of `Fraction`\n
-            `LessThanComparable` if Coeff is model of `LessThanComparable`\n
-            `Modularizable` if `Coeff` is model of `Modularizable`}
+\cgalModelsBareBegin
+\cgalModelsBare{`Polynomial_d`}
+\cgalModelsBare{`Assignable`}
+\cgalModelsBare{`CopyConstructible`}
+\cgalModelsBare{`DefaultConstructible`}
+\cgalModelsBare{`EqualityComparable`}
+\cgalModelsBare{`ImplicitInteroperable` with `int`}
+\cgalModelsBare{`ImplicitInteroperable` with `Coeff`}
+\cgalModelsBare{`Fraction` if `Coeff` is model of `Fraction`}
+\cgalModelsBare{`LessThanComparable` if `Coeff` is model of `LessThanComparable`}
+\cgalModelsBare{`Modularizable` if `Coeff` is model of `Modularizable`}
+\cgalModelsBareEnd
 */
 template< typename Coeff >
 class Polynomial {
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_with_info_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_with_info_2.h
index bd0990942287..225ac8f3abfe 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_with_info_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_face_base_with_info_2.h
@@ -19,9 +19,11 @@ and is actually not used in `Triangulation_face_base_with_info_2` .
 \tparam Fb  is a face base class from which
 `Triangulation_face_base_with_info_2` derives.
 
+\cgalModelsBareBegin
 \cgalModelsBare{Because `Triangulation_face_base_with_info_2` derives from the class instantiating its third
-parameter\, it will be a model of the same face base concept as its parameter:
-`TriangulationFaceBase_2`\,  `ConstrainedTriangulationFaceBase_2`\, or `RegularTriangulationFaceBase_2`}
+parameter, it will be a model of the same face base concept as its parameter:
+`TriangulationFaceBase_2`,  `ConstrainedTriangulationFaceBase_2`, or `RegularTriangulationFaceBase_2`}
+\cgalModelsBareEnd
 
 \sa `CGAL::Triangulation_face_base_2<Traits,Fb>`
 \sa `CGAL::Constrained_triangulation_face_base_2<Traits,Fb>`
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_with_info_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_with_info_2.h
index 6be4bf7ee8e9..ad6b6ea3a815 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_with_info_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Triangulation_vertex_base_with_info_2.h
@@ -22,10 +22,12 @@ the triangulation.
 this parameter is instantiated by
 `Triangulation_vertex_base_2<Traits>`.
 
-\cgalModelsBare{`TriangulationVertexBaseWithInfo_2`,
-            The parameter `Vb` is a model of some vertex base concept.
+\cgalModelsBareBegin
+\cgalModelsBare{`TriangulationVertexBaseWithInfo_2`}
+\cgalModelsBare{The parameter `Vb` is a model of some vertex base concept.
 `Triangulation_vertex_base_with_info_2` derives from `Vb` and will be a model of the
-same vertex base concept: `TriangulationVertexBase_2`\, or `RegularTriangulationVertexBase_2`.}
+same vertex base concept: `TriangulationVertexBase_2`, or `RegularTriangulationVertexBase_2`.}
+\cgalModelsBareEnd
 
 \sa `CGAL::Triangulation_face_base_with_info_2<Info,Traits,Fb>`
 \sa `CGAL::Triangulation_vertex_base_2<Traits,Vb>`

From a89b115b31d9ddb66d14df8e9bdde03d5854188a Mon Sep 17 00:00:00 2001
From: "dependabot[bot]" <49699333+dependabot[bot]@users.noreply.github.com>
Date: Mon, 24 Jul 2023 05:57:03 +0000
Subject: [PATCH 0515/1398] Bump fsfe/reuse-action from 1 to 2

Bumps [fsfe/reuse-action](https://github.com/fsfe/reuse-action) from 1 to 2.
- [Release notes](https://github.com/fsfe/reuse-action/releases)
- [Commits](https://github.com/fsfe/reuse-action/compare/v1...v2)

---
updated-dependencies:
- dependency-name: fsfe/reuse-action
  dependency-type: direct:production
  update-type: version-update:semver-major
...

Signed-off-by: dependabot[bot] <support@github.com>
---
 .github/workflows/reuse.yml | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/.github/workflows/reuse.yml b/.github/workflows/reuse.yml
index 2113372a8772..8b0bba4260ee 100644
--- a/.github/workflows/reuse.yml
+++ b/.github/workflows/reuse.yml
@@ -12,15 +12,15 @@ jobs:
     steps:
     - uses: actions/checkout@v3
     - name: REUSE version
-      uses: fsfe/reuse-action@v1
+      uses: fsfe/reuse-action@v2
       with:
         args: --version
     - name: REUSE lint
-      uses: fsfe/reuse-action@v1
+      uses: fsfe/reuse-action@v2
       with:
         args: --include-submodules lint
     - name: REUSE SPDX SBOM
-      uses: fsfe/reuse-action@v1
+      uses: fsfe/reuse-action@v2
       with:
         args: spdx
     - name: install dependencies
@@ -30,6 +30,6 @@ jobs:
         mkdir -p ./release
         cmake -DDESTINATION=./release -DCGAL_VERSION=9.9 -P ./Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
     - name: REUSE lint release tarball
-      uses: fsfe/reuse-action@v1
+      uses: fsfe/reuse-action@v2
       with:
         args: --root ./release/CGAL-9.9 --include-submodules lint

From a935682a8219925122e4ca3a32be7704ea40dcc3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 24 Jul 2023 10:53:27 +0200
Subject: [PATCH 0516/1398] (Re-)introduce Compact_simplicial_mesh_cell_base_3

Formerly known as Simplicial_mesh_cell_base_3, this cell base
is more efficient in memory, but cannot inherit a base.
---
 .../Compact_simplicial_mesh_cell_base_3.h     | 391 ++++++++++++++++++
 .../Remeshing_cell_base_3.h                   |   4 +-
 2 files changed, 393 insertions(+), 2 deletions(-)
 create mode 100644 SMDS_3/include/CGAL/Compact_simplicial_mesh_cell_base_3.h

diff --git a/SMDS_3/include/CGAL/Compact_simplicial_mesh_cell_base_3.h b/SMDS_3/include/CGAL/Compact_simplicial_mesh_cell_base_3.h
new file mode 100644
index 000000000000..d9c31c72597e
--- /dev/null
+++ b/SMDS_3/include/CGAL/Compact_simplicial_mesh_cell_base_3.h
@@ -0,0 +1,391 @@
+// Copyright (c) 2006-2007  INRIA Sophia-Antipolis (France).
+// Copyright (c) 2008,2011 GeometryFactory Sarl (France)
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Laurent Rineau, Stephane Tayeb, Andreas Fabri, Jane Tournois
+
+#ifndef CGAL_COMPACT_SIMPLICIAL_MESH_CELL_BASE_3_H
+#define CGAL_COMPACT_SIMPLICIAL_MESH_CELL_BASE_3_H
+
+#include <CGAL/license/SMDS_3.h>
+
+#include <CGAL/array.h>
+#include <CGAL/assertions.h>
+#include <CGAL/basic.h>
+#include <CGAL/Has_timestamp.h>
+#include <CGAL/tags.h>
+#include <CGAL/TDS_3/internal/Dummy_tds_3.h>
+
+#include <CGAL/SMDS_3/io_signature.h>
+
+namespace CGAL {
+
+// Adds information to Cb about the cell of the input complex containing it
+template <typename Subdomain_index_,
+          typename Surface_patch_index_,
+          typename TDS>
+class Compact_simplicial_mesh_cell_3
+{
+public:
+  using Triangulation_data_structure = TDS;
+
+  using Vertex_handle = typename TDS::Vertex_handle;
+  using Cell_handle = typename TDS::Cell_handle;
+  using Vertex = typename TDS::Vertex;
+  using Cell = typename TDS::Cell;
+  using TDS_data = typename TDS::Cell_data;
+
+  // Index Type
+  using Subdomain_index = Subdomain_index_;
+  using Surface_patch_index = Surface_patch_index_;
+
+public:
+  // Constructors
+  Compact_simplicial_mesh_cell_3()
+    : time_stamp_(std::size_t(-1))
+  {}
+
+  Compact_simplicial_mesh_cell_3(const Compact_simplicial_mesh_cell_3& rhs)
+    : N(rhs.N)
+    , V(rhs.V)
+    , time_stamp_(rhs.time_stamp_)
+    , subdomain_index_(rhs.subdomain_index_)
+  {
+    for(int i=0; i <4; i++){
+      surface_index_table_[i] = rhs.surface_index_table_[i];
+    }
+  }
+
+  Compact_simplicial_mesh_cell_3(Vertex_handle v0,
+                                 Vertex_handle v1,
+                                 Vertex_handle v2,
+                                 Vertex_handle v3)
+    : V(CGAL::make_array(v0, v1, v2, v3))
+  {
+  }
+
+  Compact_simplicial_mesh_cell_3(Vertex_handle v0,
+                                 Vertex_handle v1,
+                                 Vertex_handle v2,
+                                 Vertex_handle v3,
+                                 Cell_handle n0,
+                                 Cell_handle n1,
+                                 Cell_handle n2,
+                                 Cell_handle n3)
+    : N(CGAL::make_array(n0, n1, n2, n3))
+    , V(CGAL::make_array(v0, v1, v2, v3))
+  {
+  }
+
+  // ACCESS FUNCTIONS
+  Vertex_handle vertex(int i) const
+  {
+    CGAL_precondition( i >= 0 && i <= 3 );
+    return V[i];
+  }
+
+  bool has_vertex(Vertex_handle v) const
+  {
+    return (V[0] == v) || (V[1] == v) || (V[2]== v) || (V[3]== v);
+  }
+
+  bool has_vertex(Vertex_handle v, int & i) const
+  {
+    if (v == V[0]) { i = 0; return true; }
+    if (v == V[1]) { i = 1; return true; }
+    if (v == V[2]) { i = 2; return true; }
+    if (v == V[3]) { i = 3; return true; }
+    return false;
+  }
+
+  int index(Vertex_handle v) const
+  {
+    if (v == V[0]) { return 0; }
+    if (v == V[1]) { return 1; }
+    if (v == V[2]) { return 2; }
+    CGAL_assertion( v == V[3] );
+    return 3;
+  }
+
+  Cell_handle neighbor(int i) const
+  {
+    CGAL_precondition( i >= 0 && i <= 3);
+    return N[i];
+  }
+
+  bool has_neighbor(Cell_handle n) const
+  {
+    return (N[0] == n) || (N[1] == n) || (N[2] == n) || (N[3] == n);
+  }
+
+  bool has_neighbor(Cell_handle n, int & i) const
+  {
+    if(n == N[0]){ i = 0; return true; }
+    if(n == N[1]){ i = 1; return true; }
+    if(n == N[2]){ i = 2; return true; }
+    if(n == N[3]){ i = 3; return true; }
+    return false;
+  }
+
+  int index(Cell_handle n) const
+  {
+    if (n == N[0]) return 0;
+    if (n == N[1]) return 1;
+    if (n == N[2]) return 2;
+    CGAL_assertion( n == N[3] );
+    return 3;
+  }
+
+  // SETTING
+  void set_neighbor(int i, Cell_handle n)
+  {
+    CGAL_precondition( i >= 0 && i <= 3);
+    CGAL_precondition( this != n.operator->() );
+    N[i] = n;
+  }
+
+  void set_neighbors()
+  {
+    N[0] = N[1] = N[2] = N[3] = Cell_handle();
+  }
+
+  void set_neighbors(Cell_handle n0, Cell_handle n1,
+                     Cell_handle n2, Cell_handle n3)
+  {
+    CGAL_precondition( this != n0.operator->() );
+    CGAL_precondition( this != n1.operator->() );
+    CGAL_precondition( this != n2.operator->() );
+    CGAL_precondition( this != n3.operator->() );
+    N[0] = n0;
+    N[1] = n1;
+    N[2] = n2;
+    N[3] = n3;
+  }
+
+  // CHECKING
+
+  // the following trivial is_valid allows
+  // the user of derived cell base classes
+  // to add their own purpose checking
+  bool is_valid(bool = false, int = 0) const
+  { return true; }
+
+  // For use by Compact_container.
+  void * for_compact_container() const { return N[0].for_compact_container(); }
+  void for_compact_container(void *p) { N[0].for_compact_container(p); }
+
+  // TDS internal data access functions.
+        TDS_data& tds_data()       { return _tds_data; }
+  const TDS_data& tds_data() const { return _tds_data; }
+
+  // We must override the functions that modify the vertices.
+  // And if the point inside a vertex is modified, we fail,
+  // but there's not much we can do for this now.
+  void set_vertex(int i, Vertex_handle v)
+  {
+    CGAL_precondition( i >= 0 && i <= 3);
+    V[i] = v;
+  }
+
+  void set_vertices()
+  {
+    V[0] = V[1] = V[2] = V[3] = Vertex_handle();
+  }
+
+  void set_vertices(Vertex_handle v0, Vertex_handle v1,
+                    Vertex_handle v2, Vertex_handle v3)
+  {
+    V[0] = v0;
+    V[1] = v1;
+    V[2] = v2;
+    V[3] = v3;
+  }
+
+  // Returns the index of the cell of the input complex that contains the cell
+  Subdomain_index subdomain_index() const { return subdomain_index_; }
+
+  // Sets the index of the cell of the input complex that contains the cell
+  void set_subdomain_index(const Subdomain_index& index)
+  { subdomain_index_ = index; }
+
+  /// Set surface index of \c facet to \c index
+  void set_surface_patch_index(const int facet, const Surface_patch_index& index)
+  {
+    CGAL_precondition(facet>=0 && facet<4);
+    surface_index_table_[facet] = index;
+  }
+
+  /// Returns surface index of facet \c facet
+  Surface_patch_index surface_patch_index(const int facet) const
+  {
+    CGAL_precondition(facet>=0 && facet<4);
+    return surface_index_table_[facet];
+  }
+
+  /// Returns true if facet lies on a surface patch
+  bool is_facet_on_surface(const int facet) const
+  {
+    CGAL_precondition(facet>=0 && facet<4);
+    return ( !( Surface_patch_index() == surface_index_table_[facet] ));
+  }
+
+  // -----------------------------------
+  // Backward Compatibility
+  // -----------------------------------
+#ifndef CGAL_MESH_3_NO_DEPRECATED_SURFACE_INDEX
+  typedef Surface_patch_index   Surface_index;
+
+  void set_surface_index(const int facet, const Surface_index& index)
+  { set_surface_patch_index(facet,index); }
+
+  /// Returns surface index of facet \c facet
+  Surface_index surface_index(const int facet) const
+  { return surface_patch_index(facet); }
+#endif // CGAL_MESH_3_NO_DEPRECATED_SURFACE_INDEX
+  // -----------------------------------
+  // End backward Compatibility
+  // -----------------------------------
+
+  static
+  std::string io_signature()
+  {
+    return
+      Get_io_signature<Subdomain_index>()()
+      + "+(" + Get_io_signature<Surface_patch_index>()() + ")[4]";
+  }
+
+  /// For the determinism of Compact_container iterators
+  ///@{
+  typedef Tag_true Has_timestamp;
+
+  std::size_t time_stamp() const {
+    return time_stamp_;
+  }
+  void set_time_stamp(const std::size_t& ts) {
+    time_stamp_ = ts;
+  }
+  ///@}
+
+private:
+  /// Stores surface_index for each facet of the cell
+  std::array<Surface_patch_index, 4> surface_index_table_ = {};
+
+  std::array<Cell_handle, 4> N;
+  std::array<Vertex_handle, 4> V;
+
+  std::size_t time_stamp_;
+
+  // The index of the cell of the input complex that contains me
+  Subdomain_index subdomain_index_ = {};
+
+  TDS_data _tds_data;
+
+public:
+  friend std::istream& operator>>(std::istream &is, Compact_simplicial_mesh_cell_3 &c)
+  {
+    Subdomain_index index;
+    if(IO::is_ascii(is))
+      is >> index;
+    else
+      read(is, index);
+
+    if(is)
+    {
+      c.set_subdomain_index(index);
+      for(int i = 0; i < 4; ++i)
+      {
+        Surface_patch_index i2;
+        if(IO::is_ascii(is))
+          is >> IO::iformat(i2);
+        else
+          read(is, i2);
+
+        c.set_surface_patch_index(i, i2);
+      }
+    }
+
+    return is;
+  }
+
+  friend
+  std::ostream& operator<<(std::ostream &os, const Compact_simplicial_mesh_cell_3&c)
+  {
+    if(IO::is_ascii(os))
+      os << c.subdomain_index();
+    else
+      write(os, c.subdomain_index());
+
+    for(int i = 0; i < 4; ++i)
+    {
+      if(IO::is_ascii(os))
+        os << ' ' << IO::oformat(c.surface_patch_index(i));
+      else
+        write(os, c.surface_patch_index(i));
+    }
+
+    return os;
+  }
+};
+
+/*!
+\ingroup PkgSMDS3Classes
+
+The class `Compact_simplicial_mesh_cell_base_3`
+is a model of the concept `SimplicialMeshCellBase_3`.
+It is designed to serve as cell base class for.3D simplicial mesh data structures.
+It stores and gives access to data about the complex the cell belongs to, such as the
+subdomain it belongs to or surface it takes part to.
+It is more compact in memory than `CGAL::Simplicial_mesh_cell_base_3`.
+
+\tparam SubdomainIndex Type of indices for subdomains of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
+and `EqualityComparable`. The default constructed value must match the label
+of the exterior of the domain (which contains at least the unbounded component).
+It must match `MeshDomain_3::Subdomain_index` when used for mesh generation.
+
+\tparam SurfacePatchIndex Type of indices for surface patches (boundaries and interfaces)
+of the discretized geometric domain.
+Must be a model of `CopyConstructible`, `Assignable`, `DefaultConstructible`
+and `EqualityComparable`. The default constructed value must be the index value
+assigned to a non surface facet.
+It must match `MeshDomain_3::Surface_patch_index` when used for mesh generation.
+
+\cgalModels `SimplicialMeshCellBase_3`
+
+\sa `CGAL::Mesh_complex_3_in_triangulation_3<Tr,CornerIndex,CurveIndex>`
+\sa \link Mesh_cell_base_3 `CGAL::Mesh_cell_base_3`\endlink
+\sa `MeshDomain_3`
+\sa `MeshDomainWithFeatures_3`
+*/
+template <typename SubdomainIndex,
+          typename SurfacePatchIndex>
+class Compact_simplicial_mesh_cell_base_3
+{
+public:
+#ifdef DOXYGEN_RUNNING
+  typedef unspecified_type                              Triangulation_data_structure;
+#else
+  typedef internal::Dummy_tds_3                         Triangulation_data_structure;
+#endif
+  typedef Triangulation_data_structure::Vertex_handle   Vertex_handle;
+  typedef Triangulation_data_structure::Cell_handle     Cell_handle;
+
+public:
+  template <typename TDS2>
+  struct Rebind_TDS
+  {
+    typedef Compact_simplicial_mesh_cell_3<SubdomainIndex,
+                                           SurfacePatchIndex,
+                                           TDS2> Other;
+  };
+};
+
+} // namespace CGAL
+
+#endif // CGAL_COMPACT_SIMPLICIAL_MESH_CELL_BASE_3_H
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
index 162cfa27f211..94bcd7ab5f12 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/license/Tetrahedral_remeshing.h>
 
-#include <CGAL/Simplicial_mesh_cell_base_3.h>
+#include <CGAL/Compact_simplicial_mesh_cell_base_3.h>
 
 #include <CGAL/assertions.h>
 
@@ -39,7 +39,7 @@ It must be a model of the `SimplicialMeshCellBase_3` concept.
 
 */
 template<typename Gt,
-         typename Cb = CGAL::Simplicial_mesh_cell_base_3<Gt,
+         typename Cb = CGAL::Compact_simplicial_mesh_cell_base_3<
                          int /*Subdomain_index*/,
                          int /*Surface_patch_index*/> >
 class Remeshing_cell_base_3

From a76926c8f69c541e65f401d11a72cffaaedd3933 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 24 Jul 2023 16:36:35 +0200
Subject: [PATCH 0517/1398] replace "bad" / "wrong" / "authorized" to
 "compatible" / "incompatible" version

after review
---
 Installation/include/CGAL/version_checker.h | 24 ++++++++++-----------
 1 file changed, 12 insertions(+), 12 deletions(-)

diff --git a/Installation/include/CGAL/version_checker.h b/Installation/include/CGAL/version_checker.h
index 9061ee89c54d..785f8be17125 100644
--- a/Installation/include/CGAL/version_checker.h
+++ b/Installation/include/CGAL/version_checker.h
@@ -19,31 +19,31 @@
 // you want to use.
 
 //// Set the 3 following macros to the version of CGAL you want to use
-//#define CGAL_AUTHORIZED_VERSION_MAJOR 6
-//#define CGAL_AUTHORIZED_VERSION_MINOR 0
-//#define CGAL_AUTHORIZED_VERSION_PATCH 0
+//#define CGAL_COMPATIBLE_VERSION_MAJOR 6
+//#define CGAL_COMPATIBLE_VERSION_MINOR 0
+//#define CGAL_COMPATIBLE_VERSION_PATCH 0
 
 // Set the following macros to 1 to get a warning/an error
-// when using a bad version of CGAL
+// when using a possibly incompatible version of CGAL
 #define CGAL_VERSION_CHECKER_ERROR 0
 #define CGAL_VERSION_CHECKER_WARNING 0
 
-#define CGAL_AUTHORIZED_VERSION_STR CGAL_STR(CGAL_AUTHORIZED_VERSION_MAJOR) "." \
-                                    CGAL_STR(CGAL_AUTHORIZED_VERSION_MINOR) "." \
-                                    CGAL_STR(CGAL_AUTHORIZED_VERSION_PATCH)
+#define CGAL_COMPATIBLE_VERSION_STR CGAL_STR(CGAL_COMPATIBLE_VERSION_MAJOR) "." \
+                                    CGAL_STR(CGAL_COMPATIBLE_VERSION_MINOR) "." \
+                                    CGAL_STR(CGAL_COMPATIBLE_VERSION_PATCH)
 
 
 // Check that the version of CGAL used is the one expected
-#if  CGAL_AUTHORIZED_VERSION_MAJOR != CGAL_VERSION_MAJOR \
-  || CGAL_AUTHORIZED_VERSION_MINOR != CGAL_VERSION_MINOR \
-  || CGAL_AUTHORIZED_VERSION_PATCH != CGAL_VERSION_PATCH
+#if  CGAL_COMPATIBLE_VERSION_MAJOR != CGAL_VERSION_MAJOR \
+  || CGAL_COMPATIBLE_VERSION_MINOR != CGAL_VERSION_MINOR \
+  || CGAL_COMPATIBLE_VERSION_PATCH != CGAL_VERSION_PATCH
 
     #if CGAL_VERSION_CHECKER_WARNING || CGAL_VERSION_CHECKER_ERROR
-      #pragma message("These headers are meant to be used with CGAL " CGAL_AUTHORIZED_VERSION_STR " only."\
+      #pragma message("These headers are meant to be used with CGAL " CGAL_COMPATIBLE_VERSION_STR " only."\
                        " You are using CGAL version: " CGAL_STR(CGAL_VERSION) ".")
 
       #ifdef CGAL_VERSION_CHECKER_ERROR
-        #error "Wrong version of CGAL"
+        #error "Incompatible version of CGAL"
       #endif
 
     #endif

From 45a72e8dd22b1971b12d41e178bcff062dca679b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 26 Jul 2023 16:42:07 +0200
Subject: [PATCH 0518/1398] Use FT weights from the start

---
 .../Straight_skeleton_2/include/CGAL/input_helpers.h        | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/include/CGAL/input_helpers.h b/Straight_skeleton_2/examples/Straight_skeleton_2/include/CGAL/input_helpers.h
index 35077e38c2e3..ad41ff7a91f7 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/include/CGAL/input_helpers.h
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/include/CGAL/input_helpers.h
@@ -204,7 +204,7 @@ void generate_random_weights(const PolygonWithHoles& p,
     using Container = typename std::remove_reference<decltype(c)>::type;
     using Iterator = typename Container::const_iterator;
 
-    std::map<Iterator, std::size_t /*rnd weight*/> weight;
+    std::map<Iterator, FT> weight;
 
     // start somewhere not collinear
     Iterator start_it;
@@ -238,7 +238,7 @@ void generate_random_weights(const PolygonWithHoles& p,
       else
       {
         CGAL_assertion(weight.count(it) == 0);
-        weight[it] = rnd.get_double(min_weight, max_weight);
+        weight[it] = FT(rnd.get_double(min_weight, max_weight));
       }
 
       it = next(it, c);
@@ -247,7 +247,7 @@ void generate_random_weights(const PolygonWithHoles& p,
 
     std::vector<FT> weights;
     for(auto it=c.begin(); it<c.end(); ++it)
-      weights.push_back(FT(weight[it]));
+      weights.push_back(weight[it]);
 
     return weights;
   };

From c3b7214a1927966ee6cbe3faca72f0487fa11c22 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 26 Jul 2023 15:44:33 +0100
Subject: [PATCH 0519/1398] Fix the fix.  The floats were already in the range
 [0,256]

---
 .../examples/Arrangement_on_surface_2/draw_arr.cpp       | 9 ++++++---
 1 file changed, 6 insertions(+), 3 deletions(-)

diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
index b62ba6aadc17..8c3c9b4daf85 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
@@ -18,7 +18,7 @@ using Arrangement_2 = CGAL::Arrangement_2<Traits>;
  * \param value Value component range: [0, 1]
  * \return tuple<red, green, blue>, where each component is in the range [0, 255]
 */
-std::tuple<float, float, float>
+std::tuple<unsigned char, unsigned char, unsigned char>
 hsv_to_rgb(float hue, float sat, float value) {
   float red, green, blue;
   float fc = value * sat; // Chroma
@@ -69,7 +69,10 @@ hsv_to_rgb(float hue, float sat, float value) {
   red *= 255;
   green *= 255;
   blue *= 255;
-  return std::make_tuple(red, green, blue);
+  unsigned char redc = (unsigned char)red;
+  unsigned char greenc = (unsigned char)green;
+  unsigned char bluec = (unsigned char)blue;
+  return std::make_tuple(redc, greenc, bluec);
 }
 
 int main() {
@@ -104,7 +107,7 @@ int main() {
                     float r, g, b;
                     typedef unsigned char uchar;
                     std::tie(r, g, b) = hsv_to_rgb(h, s, v);
-                    return CGAL::IO::Color(uchar(r*255), uchar(g*255), uchar(b*255));
+                    return CGAL::IO::Color(r,g,b);
                   }, "hsv colors", true);
 
   return EXIT_SUCCESS;

From 08e3a4f8d268bba8db8ef6cc110659a77bbf2337 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <Laurent.Rineau@cgal.org>
Date: Wed, 26 Jul 2023 17:49:43 +0200
Subject: [PATCH 0520/1398] improve the testsuites comparison page

- now the URL can carry parameters (base/new releases to compare)
- the testsuite results have a link to the comparison page
---
 .../test_handling/create_testresult_page      |  3 +-
 Maintenance/test_handling/testresult.css      |  6 +-
 .../testsuite_comparison/diff_testsuites.html | 86 ++++++++++++++-----
 .../testsuite_comparison/diff_testsuites.js   |  2 +-
 .../testsuite_comparison/print_diff.js        |  5 ++
 .../testsuite_comparison/testresult.css       | 67 +++++++++++++++
 .../testsuite_comparison/worker.js            |  5 +-
 7 files changed, 145 insertions(+), 29 deletions(-)
 create mode 100644 Maintenance/test_handling/testsuite_comparison/testresult.css

diff --git a/Maintenance/test_handling/create_testresult_page b/Maintenance/test_handling/create_testresult_page
index 1744b4e575d5..3747a4a83133 100755
--- a/Maintenance/test_handling/create_testresult_page
+++ b/Maintenance/test_handling/create_testresult_page
@@ -617,7 +617,8 @@ sub print_little_header(){
 <body>
 <h1>Test Results of ${release_name}
 <a id="permalink" href="results-${release_version}.shtml">permalink</a>
-<a id="jump_to_results" href="#testresults">jump to results</a></h1>
+<a id="jump_to_results" href="#testresults">jump to results</a>
+<a id="compare" href="comparison/diff_testsuites.html?newTest=${release_name}">compare results...</a></h1>
 <!--#include virtual="versions.inc"-->
 <p>The results of the tests are presented in a table
 ('y' = success, 'w' = warning, 't' = third party warning, 'o' = timeout, 'n' = failure, 'r' = a requirement is not found),
diff --git a/Maintenance/test_handling/testresult.css b/Maintenance/test_handling/testresult.css
index b48d35ee1710..02e8ad65d0fb 100644
--- a/Maintenance/test_handling/testresult.css
+++ b/Maintenance/test_handling/testresult.css
@@ -66,14 +66,14 @@ TD.requirements A:visited {color: rgb(100%,100%,65%)}
 
 SELECT { font-family: monospace; }
 
-#permalink,#jump_to_results {
+#permalink,#jump_to_results,#compare {
     font-size: 0.5em;
     font-weight: normal;
 }
-#permalink::before,#jump_to_results::before{
+#permalink::before,#jump_to_results::before,#compare::before{
     content: "("
 }
-#permalink::after,#jump_to_results::after{
+#permalink::after,#jump_to_results::after,#compare::after{
     content: ")"
 }
 
diff --git a/Maintenance/test_handling/testsuite_comparison/diff_testsuites.html b/Maintenance/test_handling/testsuite_comparison/diff_testsuites.html
index 4ec2720540f1..ab4842098e03 100644
--- a/Maintenance/test_handling/testsuite_comparison/diff_testsuites.html
+++ b/Maintenance/test_handling/testsuite_comparison/diff_testsuites.html
@@ -1,6 +1,9 @@
 <!doctype html>
 <html style='height: 100%'>
 <head>
+	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
+	<link rel="shortcut icon" href="cgal.ico">
+	<link rel="stylesheet" type="text/css" href="testresult.css">
 	<meta charset="utf-8">
 	<title>Diff of Testsuites</title>
 	<script type="text/javascript" src="difflib.js"></script>
@@ -11,30 +14,30 @@
 </head>
 <body style='background-color: #C0C0D0; min-height: 100%;'>
 
-<p><input type='text' id='baseInput'/>
+<div><input type='text' id='baseInput'/>
 <select id='baselist'></select>
 
 <input type='text' id='newInput'/>
 <select id='newlist'></select>
 
-<button type="button" id='button'>Compare</button><br>
+<button type="button" id='button'>Compare</button></div>
 <p>
 Note that the diff should be done from left to right, as red or yellow squares in the left testsuite that become green in the right testsuite will be ignored.
 </p>
  I = Master<br>
  Ic = integration
 </p>
-<p>
-<table id=namesTable border="1" cellspacing="2" cellpadding="5"></table>
-<table id=diffPlatforms border="1" cellspacing="2" cellpadding="5"></table>
-<table id=testTable border="1" cellspacing="2" cellpadding="5"></table>
+<div>
+<table class="summary" id=namesTable border="1" cellspacing="2" cellpadding="5"></table>
+<table class="summary" id=diffPlatforms border="1" cellspacing="2" cellpadding="5"></table>
+<table class="result" id=testTable border="1" cellspacing="2" cellpadding="5"></table>
 <table id=namesTableBis border="1" cellspacing="2" cellpadding="5"></table>
-</p>
+</div>
 
 <script type="text/javascript">
   //get list of existing testsuites
   var xhr = new XMLHttpRequest();
-  xhr.open('GET', 'https://cgal.geometryfactory.com/~mgimeno/testsuite_comparison/list_of_testsuites.txt', false);
+  xhr.open('GET', 'https://cgal.geometryfactory.com/~cgaltest/testsuite_comparison/list_of_testsuites.txt', false);
   xhr.send(null);
   if (xhr.status !== 200) {
     alert("Couldn't find the list of testsuites.");
@@ -42,8 +45,22 @@
   }
   var tmp=xhr.responseText;
   var testsuites=tmp.split("\n");
-  testsuites.sort();
-  testsuites.reverse();
+
+  sf=function(a, b){
+    var aa=a.split("-");
+    var ab=b.split("-");
+    // compare release number first (decreasing)
+    if (aa[1]<ab[1]) return 1
+    if (aa[1]>ab[1]) return -1
+    // compare internal version then (decreasing)
+    if (parseInt(aa[3])<parseInt(ab[3])) return 1
+    if (parseInt(aa[3])>parseInt(ab[3])) return -1
+    return -1;
+  };
+  testsuites.sort(sf);
+
+//  testsuites.sort();
+//  testsuites.reverse();
   var sorted_testsuites = testsuites;
   var base = document.getElementById('baselist');
   var newlist = document.getElementById('newlist');
@@ -88,18 +105,8 @@
       base.appendChild(opt1);
       newlist.appendChild(opt2);
   }
-  var button = document.getElementById('button');
-  button.onclick=function(){
-    var baselist = document.getElementById("baselist");
-    var newlist = document.getElementById("newlist")
-    if(baselist.length==0 || newlist.length==0){
-    alert("You need two valid testsuites to diff.");
-      throw new Error("You need two valid testsuites to diff.");
-    }
-    var baseId = baselist.selectedIndex;
-    var newId = newlist.selectedIndex;
-    var baseTest = base.options[base.selectedIndex].value;
-    var newTest = newlist.options[newlist.selectedIndex].value;
+
+  go = function(baseTest, newTest) {
     document.body.style.cursor = 'wait';
     if(baseTest === newTest){
       alert("You chose the same testsuite twice, so no diff is expected !");
@@ -134,6 +141,41 @@
     }, false);
     w.postMessage(message);
   };
+  var button = document.getElementById('button');
+  button.onclick=function(){
+    var baselist = document.getElementById("baselist");
+    var newlist = document.getElementById("newlist")
+    if(baselist.length==0 || newlist.length==0){
+    alert("You need two valid testsuites to diff.");
+      throw new Error("You need two valid testsuites to diff.");
+    }
+    var baseId = baselist.selectedIndex;
+    var newId = newlist.selectedIndex;
+    var baseTest = base.options[base.selectedIndex].value;
+    var newTest = newlist.options[newlist.selectedIndex].value;
+    const url = new URL(window.location);
+    url.searchParams.set("baseTest", baseTest);
+    url.searchParams.set("newTest", newTest);
+    history.pushState({}, "", url);
+
+    go(baseTest, newTest);
+  };
+
+  const urlParams = new URLSearchParams(window.location.search);
+  const baseTest= urlParams.get('baseTest');
+  const newTest = urlParams.get('newTest');
+  if(baseTest) {
+    baseinput.value = baseTest;
+    baseinput.oninput();
+  }
+  if(newTest) {
+    newinput.value = newTest;
+    newinput.oninput();
+  }
+  if(baseTest && newTest) {
+    go(baseTest, newTest);
+  }
+
 </script>
 </body>
 </html>
diff --git a/Maintenance/test_handling/testsuite_comparison/diff_testsuites.js b/Maintenance/test_handling/testsuite_comparison/diff_testsuites.js
index 567dad053515..07427241f39c 100644
--- a/Maintenance/test_handling/testsuite_comparison/diff_testsuites.js
+++ b/Maintenance/test_handling/testsuite_comparison/diff_testsuites.js
@@ -11,7 +11,7 @@
 
 //v1.7
 function diff_testsuites(baseTest, newTest){
-  var URL_suff='https://cgal.geometryfactory.com/~mgimeno/testsuite_comparison/list_of_suffixes.txt';
+  var URL_suff='https://cgal.geometryfactory.com/~cgaltest/testsuite_comparison/list_of_suffixes.txt';
   var URL_testsuite='https://cgal.geometryfactory.com/CGAL/Members/testsuite/';
   //get the list of suffixes
   var xhr = new XMLHttpRequest();
diff --git a/Maintenance/test_handling/testsuite_comparison/print_diff.js b/Maintenance/test_handling/testsuite_comparison/print_diff.js
index 9340d2c10139..d7da1086b8f7 100644
--- a/Maintenance/test_handling/testsuite_comparison/print_diff.js
+++ b/Maintenance/test_handling/testsuite_comparison/print_diff.js
@@ -31,6 +31,11 @@ function print_diff(base, newtext){
        && change != "equal"){
         res[0]=base.charAt(base.length-1);
         res[1]=newtext.charAt(newtext.length-1);
+        if (res[0]=="w" && res[1]=="t")
+        {
+          res[0]="";
+          res[1]="";
+        }
       }
       //else if(change == "insert") {
       //  res=newtext.charAt(newtext.length-1);
diff --git a/Maintenance/test_handling/testsuite_comparison/testresult.css b/Maintenance/test_handling/testsuite_comparison/testresult.css
new file mode 100644
index 000000000000..b7800bf1d59e
--- /dev/null
+++ b/Maintenance/test_handling/testsuite_comparison/testresult.css
@@ -0,0 +1,67 @@
+body  {color: black; background-color: #C0C0D0; font-family: sans-serif;}
+
+P {
+width: 80ex
+}
+
+A {
+    text-decoration: none;
+}
+
+TABLE.result { font-weight: bold; background-color: white; padding: 1em; table-layout: fixed;}
+
+TABLE.summary TD { white-space: nowrap }
+TABLE.result,TABLE.summary { border-collapse: collapse; }
+TABLE.result TD,TABLE.summary TD { border-width: 1px; border-style: solid; }
+TABLE.result TD { padding: 0;}
+TABLE.result TD > a { font-weight: normal; font-family: monospace; display: block; padding: 0.2ex 0.5ex 0.2ex 0.5ex;}
+
+TD.highlight {background-color: rgb(80%,80%,80%)}
+TD.os64bits {font-style:italic}
+.cmaketag {font-weight: bold; color: rgb(100%,20%,20%);}
+
+
+TD.ok {background-color: rgb(50%,100%,50%)}
+TD.warning {background-color: rgb(100%,100%,50%)}
+TD.error {background-color: rgb(100%,50%,50%)}
+TD.na {background-color: white;}
+TD.requirements { background-color: rgb(65%,65%,100%) }
+
+TH.ok {background-color: rgb(50%,100%,50%)}
+TH.warning {background-color: rgb(100%,100%,50%)}
+TH.error {background-color: rgb(100%,50%,50%)}
+TH.requirements { background-color: rgb(65%,65%,100%) }
+
+TD.ok A {font-size:large; text-decoration: none}
+TD.ok A:link {color: rgb(0%,0%,100%)}
+TD.ok A:visited {color: rgb(0%,80%,100%)}
+
+TD.warning A {font-size:large; text-decoration: none}
+TD.warning A:link {color: rgb(0%,0%,100%)}
+TD.warning A:visited {color: rgb(80%,80%,100%)}
+
+TD.error A {font-size: large; text-decoration: none}
+TD.error A:link {color: rgb(0%,0%,100%)}
+TD.error A:visited {color: rgb(80%,0%,100%)}
+
+TD.requirements A {font-size: large; text-decoration: none}
+TD.requirements A:link {color: rgb(0%,0%,100%)}
+TD.requirements A:visited {color: rgb(100%,100%,65%)}
+
+SELECT { font-family: monospace; }
+
+#permalink,#jump_to_results {
+    font-size: 0.5em;
+    font-weight: normal;
+}
+#permalink::before,#jump_to_results::before{
+    content: "("
+}
+#permalink::after,#jump_to_results::after{
+    content: ")"
+}
+
+TABLE.result TD > a.package_name {
+    color: black;
+    font-weight: bold;
+}
diff --git a/Maintenance/test_handling/testsuite_comparison/worker.js b/Maintenance/test_handling/testsuite_comparison/worker.js
index 8938ea93c382..28930fb20f08 100644
--- a/Maintenance/test_handling/testsuite_comparison/worker.js
+++ b/Maintenance/test_handling/testsuite_comparison/worker.js
@@ -34,7 +34,7 @@ onmessage=function(e){
   }
 
   for(i=1; i<myArray.length; i++){
-    postMessage(["namesTable","<tr><td>"+i+": </td><td>"+ myArray[i][0]+"</td></tr>"]);
+    postMessage(["namesTable","<tr><td>"+i+"</td><td>"+ myArray[i][0]+"</td></tr>"]);
   }
   postMessage(["namesTable", "</table>"]);
 
@@ -45,7 +45,8 @@ onmessage=function(e){
   }
   postMessage(["testTable", "</tr>"]);
   for (var j=2; j<myArray[0].length; j++) {
-    postMessage(["testTable", "<tr><td style='width: 25px;'>"+ myArray[0][j]+":  </td>"]);
+    var p =  myArray[0][j];
+    postMessage(["testTable", "<tr><td style='width: 25px;'><a class=\"package_name\" href=\"#"+p+"\" name=\"" + p + "\">" + p + "</a></td>"]);
     for(i=1; i<myArray.length; i++)
     {
       var sp = myArray[i][j].split("||");

From d13338a8b05f07fa9e03d7aa225853a3a15dbf0f Mon Sep 17 00:00:00 2001
From: Laurent Rineau <Laurent.Rineau@cgal.org>
Date: Thu, 27 Jul 2023 09:38:24 +0200
Subject: [PATCH 0521/1398] back to normal tests schedule

---
 .../bin/create_internal_release_of_the_day.py                 | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/bin/create_internal_release_of_the_day.py b/Maintenance/infrastructure/cgal.geometryfactory.com/bin/create_internal_release_of_the_day.py
index cd976dd2d01e..282ae35aaa0d 100644
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/bin/create_internal_release_of_the_day.py
+++ b/Maintenance/infrastructure/cgal.geometryfactory.com/bin/create_internal_release_of_the_day.py
@@ -16,8 +16,8 @@
     "Tuesday": integration,
     "Wednesday": integration,
     "Thursday": integration,
-    "Friday": beta_release("5.6", 2),
-    "Saturday": release("5.5"),
+    "Friday": release("5.5"),
+    "Saturday": release("5.6"),
     "Sunday": master,
 }
 

From fb3680f8f5ad6542c102525b8318a73f6b815e26 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 27 Jul 2023 11:48:55 +0200
Subject: [PATCH 0522/1398] Update Mesh_3/doc/Mesh_3/Mesh_3.txt

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/doc/Mesh_3/Mesh_3.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/doc/Mesh_3/Mesh_3.txt b/Mesh_3/doc/Mesh_3/Mesh_3.txt
index 43660034018c..fd1fe191063b 100644
--- a/Mesh_3/doc/Mesh_3/Mesh_3.txt
+++ b/Mesh_3/doc/Mesh_3/Mesh_3.txt
@@ -296,7 +296,7 @@ also inserts a small set of auxiliary vertices that belong to the triangulation
 but are isolated from the complex at the end of the meshing process.
 
 These so-called \em isolated vertices belong to the triangulation but not to any cell
-of the `C3T3`. They can be removed using the function `CGAL::Polygon_mesh_processing::remove_isolated_vertices()`.
+of the `C3T3`. They can be removed using the function `remove_isolated_vertices()` of `CGAL::Mesh_complex_3_in_triangulation_3`.
 
 
 \section Mesh_3_section_interface Interface

From 81bbc3e0db20285013ce5ed7b28c76e48c653f4f Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 27 Jul 2023 11:50:23 +0200
Subject: [PATCH 0523/1398] Update Mesh_3/doc/Mesh_3/Mesh_3.txt

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/doc/Mesh_3/Mesh_3.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/doc/Mesh_3/Mesh_3.txt b/Mesh_3/doc/Mesh_3/Mesh_3.txt
index fd1fe191063b..abe639826562 100644
--- a/Mesh_3/doc/Mesh_3/Mesh_3.txt
+++ b/Mesh_3/doc/Mesh_3/Mesh_3.txt
@@ -494,7 +494,7 @@ protecting ball centers that are consecutive on a 1-feature. This parameter has
 
 The four additional parameters are optimization parameters.
 They control which optimization processes are performed
-and enables the user to tune the parameters of the activated optimization processes.
+and enable the user to tune the parameters of the activated optimization processes.
 These parameters have internal types which are not described
 but the library provides global functions to generate
 appropriate values of these types:

From 7f20c6b773cd6dff5d660dfdacf6082937f4dd74 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 27 Jul 2023 11:51:13 +0200
Subject: [PATCH 0524/1398] Update
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index 38c2b9570f19..a1a757ee5606 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -164,7 +164,7 @@ class Polyhedral_mesh_domain_with_features_3
     Constructor from a polyhedral surface.
     No feature detection is done at this level. Note that a copy of `bounding_polyhedron` will be done.
     The polyhedron `bounding_polyhedron` has to be closed and free of intersections.
-    Its interior of `bounding_polyhedron` will be meshed.
+    The interior of `bounding_polyhedron` will be meshed.
   */
   Polyhedral_mesh_domain_with_features_3(const Polyhedron& bounding_polyhedron
 #ifndef DOXYGEN_RUNNING

From 54fbebf2b69c4bc16230ad1201628a36f2e744fa Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 27 Jul 2023 11:51:38 +0200
Subject: [PATCH 0525/1398] Update
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index a1a757ee5606..fdc5fd0a1582 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -245,7 +245,7 @@ class Polyhedral_mesh_domain_with_features_3
    * queries.
    *
    * @tparam InputPolyhedraPtrIterator must be a model of
-   * `ForwardIterator` and value type `Polyhedron*`
+   * `ForwardIterator` with value type `Polyhedron*`
    *
    * @param begin iterator for a sequence of pointers to polyhedra
    * @param end iterator for a sequence of pointers to polyhedra

From 7bc4b30501ebae90dc50491e3e73961165b564cf Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 27 Jul 2023 11:52:13 +0200
Subject: [PATCH 0526/1398] Update
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index fdc5fd0a1582..33145d18b2e3 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -274,7 +274,7 @@ class Polyhedral_mesh_domain_with_features_3
    * polyhedral surface.
    *
    * @tparam InputPolyhedraPtrIterator must be a model of
-   * `ForwardIterator` and value type `Polyhedron*`
+   * `ForwardIterator` with value type `Polyhedron*`
    *
    * @param begin iterator for a sequence of pointers to polyhedra
    * @param end iterator for a sequence of pointers to polyhedra

From 1963697d8473227b70a6bc6c8e51313458fb9621 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 27 Jul 2023 11:56:32 +0200
Subject: [PATCH 0527/1398] Update Mesh_3/include/CGAL/Mesh_cell_criteria_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Mesh_cell_criteria_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
index b13a99555211..f493eddf6186 100644
--- a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
@@ -93,7 +93,7 @@ class Mesh_cell_criteria_3
    *     bound will be refined.
    *
    * See Section \ref introsecparam for further details.
-   * Note that if one parameter is set to 0, then its corresponding criteria is ignored.
+   * Note that if one parameter is set to 0, then its corresponding criterion is ignored.
    */
   Mesh_cell_criteria_3(const FT& radius_edge_bound,
                        const FT& radius_bound,

From 21b9f6dfb5b1e87ad9a728156f034e0105a63913 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 27 Jul 2023 11:57:09 +0200
Subject: [PATCH 0528/1398] Update Mesh_3/include/CGAL/Mesh_cell_criteria_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Mesh_cell_criteria_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
index f493eddf6186..b8bfd6cfdcf2 100644
--- a/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_cell_criteria_3.h
@@ -32,7 +32,7 @@ namespace CGAL {
 
 The class `Mesh_cell_criteria_3` is a model of `MeshCellCriteria_3`. It provides,
 for the mesh tetrahedra,
-a uniform shape criteria
+a uniform shape criterion
 and a sizing field which may be a uniform or variable field.
 
 \tparam Tr must be identical to the nested type

From 5b0857034536b8d1d5358c5cf6c580b22c0d665d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 27 Jul 2023 11:57:41 +0200
Subject: [PATCH 0529/1398] Update
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
index 8ffc5d6f93a7..8407722a0f5a 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_3.h
@@ -111,7 +111,7 @@ struct IGT_generator<GT,CGAL::Tag_false>
 The class `Polyhedral_mesh_domain_3` implements
 a domain defined by a simplicial polyhedral surface.
 
-The input polyhedral surface must be free of intersection.
+The input polyhedral surface must be free of intersections.
 It must include (at least) one closed connected component
 that defines the boundary of the domain to be meshed.
 Inside this bounding component,

From acdb2d40c5ba1f3f15cc5553ee40d001dbc43878 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 27 Jul 2023 11:58:24 +0200
Subject: [PATCH 0530/1398] Update Mesh_3/include/CGAL/Mesh_facet_criteria_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Mesh_facet_criteria_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
index 30adfbd26f40..50c36e047c49 100644
--- a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
@@ -93,7 +93,7 @@ class Mesh_facet_criteria_3
  /*!
     returns an object to serve as criteria for facets.
 
-    \param angle_bound is the lower bound for the angle in degrees of the
+    \param angle_bound is the lower bound for the angles in degrees of the
     surface mesh facets.
     \param radius_bound is a uniform upper bound
     for the radius of the surface Delaunay balls.

From ba0172a544f578bdc92f62a6cda180d3157731a7 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 27 Jul 2023 11:59:30 +0200
Subject: [PATCH 0531/1398] Update Mesh_3/doc/Mesh_3/PackageDescription.txt

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/doc/Mesh_3/PackageDescription.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/doc/Mesh_3/PackageDescription.txt b/Mesh_3/doc/Mesh_3/PackageDescription.txt
index c4221f3cfbf2..e063c6eeee70 100644
--- a/Mesh_3/doc/Mesh_3/PackageDescription.txt
+++ b/Mesh_3/doc/Mesh_3/PackageDescription.txt
@@ -84,7 +84,7 @@ related to the template parameters of some models of the main concepts:
 
 \cgalCRPSection{Classes}
 
-- `CGAL::Mesh_triangulation_3<MD,GT,ConcurrencyTag,VertexBase,CellBase>`
+- `CGAL::Mesh_triangulation_3<MD,GT,ConcurrencyTag,Vb,Cb>`
 - `CGAL::Mesh_vertex_base_3<GT,MD,Vb>`
 - `CGAL::Compact_mesh_cell_base_3<GT,MD,Tds>`
 - `CGAL::Mesh_cell_base_3<GT,MD,Cb>`

From 41ae66aedfd52d8c377c1bc62158fa08618a400a Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 28 Jul 2023 11:42:59 +0200
Subject: [PATCH 0532/1398] Update
 Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
index c57f4e4d3b38..3bb106e12426 100644
--- a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
+++ b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
@@ -147,7 +147,7 @@ class Implicit_vector_to_labeling_function_wrapper
 \ingroup PkgMesh3Domains
 
 The class `Implicit_multi_domain_to_labeling_function_wrapper` is a helping class to get a function with integer values
-labeling the components of a multi-domain. The multidomain is described through a set of functions {fi(p), i=1, ...n}.
+labeling the components of a multidomain. The multidomain is described through a set of functions {fi(p), i=1, ...n}.
 Each component corresponds to a sign vector [s1, s2, ..., sn] where si is the sign of the function fi(p) at a point p of the component.
 This wrapper class can be passed to `Labeled_mesh_domain_3` as first template parameter.
 

From da5b2ae86286e8e03ccfdebe625229a333637515 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 28 Jul 2023 11:46:33 +0200
Subject: [PATCH 0533/1398] Update
 Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 7e5a82c03bf1..7ef8b49f578e 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -84,7 +84,7 @@ class Polyline
     return points_.back();
   }
 
-  /// returns `true` if the polyline is not degenerated
+  /// returns `true` if the polyline is not degenerate
   bool is_valid() const
   {
     return points_.size() > 1;

From c42aa489498ec6402f8f96d8ad7257c7c9f86cc3 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 28 Jul 2023 11:47:16 +0200
Subject: [PATCH 0534/1398] Update
 Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 7ef8b49f578e..7bc7df1a5734 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -227,7 +227,7 @@ class Polyline
     return result;
   }
 
-  /// returns signed geodesic distance between `p` and `q`.
+  /// returns the signed geodesic distance between `p` and `q`.
   FT signed_geodesic_distance(const Point_3& p, const Point_3& q) const
   {
     // Locate p & q on polyline

From c70d8670b3f5553ae831bab9a4048ae46800c82f Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 28 Jul 2023 11:47:50 +0200
Subject: [PATCH 0535/1398] Update
 Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 7bc7df1a5734..17a44a65d98d 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -694,7 +694,7 @@ class Mesh_domain_with_polyline_features_3
   /// @}
 
   /// \name Implementation of the concept MeshDomainWithFeatures_3
-  /// The following methods implement the requirement of the concept
+  /// The following methods implement the requirements of the concept
   /// `MeshDomainWithFeatures_3`.
   /// @{
 

From 626f0578f74df810a8a5cdd97fce5ef2cb58550a Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 28 Jul 2023 11:48:33 +0200
Subject: [PATCH 0536/1398] Update
 Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
index 17a44a65d98d..5e7945f11511 100644
--- a/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
+++ b/Mesh_3/include/CGAL/Mesh_domain_with_polyline_features_3.h
@@ -699,7 +699,7 @@ class Mesh_domain_with_polyline_features_3
   /// @{
 
   /// implements `MeshDomainWithFeatures_3::get_corners()`.
-  /// OutputIterator is std::pair<Corner_index, Point_3>
+  /// OutputIterator is `std::pair<Corner_index, Point_3>`
   template <typename OutputIterator>
   OutputIterator get_corners(OutputIterator out) const;
 

From 913e8848c6250a6bbbb6cde8e0f3a333c7770e38 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 28 Jul 2023 11:50:18 +0200
Subject: [PATCH 0537/1398] Update
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index 33145d18b2e3..824d7ed1a229 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -63,7 +63,7 @@ namespace CGAL {
 The class `Polyhedral_mesh_domain_with_features_3` implements a domain whose
 boundary is a simplicial polyhedral surface.
 
-This surface must be free of intersection. It can either be closed,
+This surface must be free of intersections. It can either be closed,
 included inside another polyhedral surface which is closed and free of intersection,
 or open. In the latter case, the meshing process will only take care of the quality
 of the 1D (features and boundaries) and 2D (surfaces) components of the mesh.

From 2ef1bb4e48ad992b685b278350f7d06b93e9fd3d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 28 Jul 2023 11:50:57 +0200
Subject: [PATCH 0538/1398] Update Mesh_3/include/CGAL/Mesh_polyhedron_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Mesh_polyhedron_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Mesh_polyhedron_3.h b/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
index 8e053945d604..6ae077e5bf8f 100644
--- a/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
+++ b/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
@@ -213,7 +213,7 @@ class Mesh_polyhedron_items : public CGAL::Polyhedron_items_3 {
 \ingroup PkgMesh3Domains
 
 The class `Mesh_polyhedron_3` provides a customized `Polyhedron_3` type. This type uses
-as `PolyhedronItems_3` a customized type which adds data to the Vertex, Face and
+as `PolyhedronItems_3` a customized type which adds data to the `Vertex`, `Face` and
 Halfedge classes. Those data are required to use the detection of sharp features.
 
 \tparam IGT stands for the geometric traits associated

From 50f47a3f572b71c63d3d4183dfb9f0dfba19f946 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 28 Jul 2023 11:51:23 +0200
Subject: [PATCH 0539/1398] Update
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
index 824d7ed1a229..593c06242588 100644
--- a/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_mesh_domain_with_features_3.h
@@ -64,7 +64,7 @@ The class `Polyhedral_mesh_domain_with_features_3` implements a domain whose
 boundary is a simplicial polyhedral surface.
 
 This surface must be free of intersections. It can either be closed,
-included inside another polyhedral surface which is closed and free of intersection,
+included inside another polyhedral surface which is closed and free of intersections,
 or open. In the latter case, the meshing process will only take care of the quality
 of the 1D (features and boundaries) and 2D (surfaces) components of the mesh.
 

From de85effe56542df09887972e0532ebc1dc731e4b Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 28 Jul 2023 11:54:26 +0200
Subject: [PATCH 0540/1398] Update Mesh_3/include/CGAL/Mesh_polyhedron_3.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 Mesh_3/include/CGAL/Mesh_polyhedron_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Mesh_polyhedron_3.h b/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
index 6ae077e5bf8f..454c0c94aff5 100644
--- a/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
+++ b/Mesh_3/include/CGAL/Mesh_polyhedron_3.h
@@ -214,7 +214,7 @@ class Mesh_polyhedron_items : public CGAL::Polyhedron_items_3 {
 
 The class `Mesh_polyhedron_3` provides a customized `Polyhedron_3` type. This type uses
 as `PolyhedronItems_3` a customized type which adds data to the `Vertex`, `Face` and
-Halfedge classes. Those data are required to use the detection of sharp features.
+`Halfedge` classes. Those data are required to use the detection of sharp features.
 
 \tparam IGT stands for the geometric traits associated
 to the meshing process. It must be a model of the two concepts

From b843f0b2a82e6ae646910bf154e1c26506381947 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 28 Jul 2023 11:35:42 +0100
Subject: [PATCH 0541/1398] CamelCase

---
 Mesh_3/include/CGAL/Mesh_facet_criteria_3.h | 6 +++---
 Mesh_3/include/CGAL/refine_mesh_3.h         | 2 +-
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
index 50c36e047c49..916e1073ac88 100644
--- a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
@@ -125,9 +125,9 @@ class Mesh_facet_criteria_3
     as above, except that the radius and distance bound parameters are
     functionals instead of constants.
   */
-  template < typename Sizing_field, typename DistanceField >
+  template < typename SizingField, typename DistanceField >
   Mesh_facet_criteria_3(const FT& angle_bound,
-                        const Sizing_field & radius_bound,
+                        const SizingField & radius_bound,
                         const DistanceField& distance_bound,
                         const Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE,
                         const FT& min_radius_bound = 0.)
@@ -139,7 +139,7 @@ class Mesh_facet_criteria_3
       init_aspect(angle_bound);
 
     init_radius(radius_bound,
-                Mesh_3::Is_mesh_domain_field_3<Tr, Sizing_field>());
+                Mesh_3::Is_mesh_domain_field_3<Tr, SizingField>());
 
     init_distance(distance_bound,
                   Mesh_3::Is_mesh_domain_field_3<Tr, DistanceField>());
diff --git a/Mesh_3/include/CGAL/refine_mesh_3.h b/Mesh_3/include/CGAL/refine_mesh_3.h
index 78778059d351..284d54791f51 100644
--- a/Mesh_3/include/CGAL/refine_mesh_3.h
+++ b/Mesh_3/include/CGAL/refine_mesh_3.h
@@ -174,7 +174,7 @@ class Insert_vertex_in_c3t3
  *           Individual optimization parameters are not described here as they are
  *           internal types (see instead the documentation page of each optimizer).
  *           For each optimization algorithm, there exist two global functions
- *           that enable to enable or disable the optimizer.
+ *           that enable/disable the optimizer.
  *
  * \cgalNamedParamsBegin
  *   \cgalParamSectionBegin{Topological options (manifoldness)}

From 1cce66c3434d07f1ddfa320d46fe1b724b1fa1a0 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Sun, 30 Jul 2023 12:59:17 +0200
Subject: [PATCH 0542/1398] Spelling corrections

Spelling corrections `a e...` -> `an e...`
---
 .../doc/Algebraic_foundations/Concepts/EuclideanRing.h |  2 +-
 .../CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h    |  2 +-
 .../include/CGAL/Algebraic_kernel_d/Xy_coordinate_2.h  |  2 +-
 .../include/CGAL/Arr_batched_point_location.h          |  2 +-
 .../include/CGAL/Arr_circular_line_arc_traits_2.h      |  2 +-
 Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h  |  2 +-
 .../Arr_batched_point_location_traits_2.h              |  2 +-
 .../include/CGAL/Arr_vertical_decomposition_2.h        |  2 +-
 .../Arrangement_2/Arrangement_on_surface_2_global.h    |  2 +-
 .../include/CGAL/IO/Arr_text_formatter.h               |  2 +-
 .../Surface_sweep_2/Arr_basic_insertion_traits_2.h     |  2 +-
 .../Arr_no_intersection_insertion_ss_visitor.h         |  2 +-
 .../CGAL/Surface_sweep_2/Arr_overlay_traits_2.h        |  2 +-
 BGL/test/BGL/test_Gwdwg.cpp                            |  2 +-
 .../Boolean_set_operations_2/Gps_traits_decorator.h    |  2 +-
 Circulator/doc/Circulator/CGAL/circulator.h            |  4 ++--
 .../doc/Cone_spanners_2/Cone_spanners_2.txt            |  2 +-
 Documentation/doc/biblio/geom.bib                      |  4 ++--
 GraphicsView/include/CGAL/Qt/qglviewer_impl.h          |  2 +-
 .../CGAL/Hyperbolic_Delaunay_triangulation_2.h         |  2 +-
 .../Hyperbolic_triangulation_2.txt                     | 10 +++++-----
 .../cmake/modules/CGAL_SetupCGALDependencies.cmake     |  2 +-
 Installation/cmake/modules/FindTBB.cmake               |  2 +-
 Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h            |  2 +-
 Nef_S2/include/CGAL/Nef_S2/SM_io_parser.h              |  2 +-
 .../include/CGAL/Sqrt_extension/Fraction_traits.h      |  2 +-
 .../test_p4ht2_locate.cpp                              |  2 +-
 .../CGAL/Polynomial/Algebraic_structure_traits.h       |  2 +-
 Polynomial/include/CGAL/Polynomial/prs_resultant.h     |  2 +-
 Polynomial/include/CGAL/Polynomial_traits_d.h          |  2 +-
 .../doc/Spatial_searching/Concepts/GeneralDistance.h   |  2 +-
 .../CGAL/Straight_skeleton_vertex_base_2.h             |  2 +-
 .../CGAL/constructions/Straight_skeleton_cons_ftC2.h   |  4 ++--
 Surface_mesh/include/CGAL/Surface_mesh/Properties.h    |  2 +-
 .../internal/auxiliary/graph.h                         |  2 +-
 .../Surface_mesh_topology/Surface_mesh_topology.txt    |  2 +-
 36 files changed, 43 insertions(+), 43 deletions(-)

diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h
index 694218851983..7ae8d52ecc59 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h
@@ -21,7 +21,7 @@ Moreover, `CGAL::Algebraic_structure_traits< EuclideanRing >` is a model of
 
 \cgalHeading{Remarks}
 
-The most prominent example of a Euclidean ring are the integers.
+The most prominent example of an Euclidean ring are the integers.
 Whenever both \f$ x\f$ and \f$ y\f$ are positive, then it is conventional to choose
 the smallest positive remainder \f$ r\f$.
 
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
index 05b97af9bcd1..dad6b92fb904 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
@@ -613,7 +613,7 @@ class Curve_pair_analysis_2 :
     /*
      * \brief returns the indices of the <tt>i</tt>th event value
      *
-     * Returns a Event_indices <tt>(fg,ffy,ggy)</tt> such that
+     * Returns an Event_indices <tt>(fg,ffy,ggy)</tt> such that
      * the <tt>i</tt>th event root is the <tt>fg</tt>th root of the
      * resultant of \c f and \c g, the <tt>ffy</tt>th root of the
      * discriminant of \c f, and  the <tt>ggy</tt>th root of the
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Xy_coordinate_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Xy_coordinate_2.h
index 81a74c56c38c..9d262c4d1722 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Xy_coordinate_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Xy_coordinate_2.h
@@ -254,7 +254,7 @@ class Xy_coordinate_2 :
     /*!
      * \brief y-coordinate of this point
      *
-     * Note: In general, this method results in a extremely large polynomial
+     * Note: In general, this method results in an extremely large polynomial
      * for the y-coordinate. It is recommended to use it carefully,
      * and using get_approximation_y() instead whenever approximations suffice.
      */
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
index af58c2612406..fc7b94459141 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
@@ -105,7 +105,7 @@ locate(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
     }
   }
 
-  // Obtain a extended traits-class object.
+  // Obtain an extended traits-class object.
   const Gt2* geom_traits = arr.geometry_traits();
 
   /* We would like to avoid copy construction of the geometry traits class.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
index 4d5c07d46eac..79c50ad680fa 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_circular_line_arc_traits_2.h
@@ -459,7 +459,7 @@ namespace CGAL {
   }
 
 
-  // a empty class used to have different types between Curve_2 and X_monotone_curve_2
+  // an empty class used to have different types between Curve_2 and X_monotone_curve_2
   // in Arr_circular_line_arc_traits_2.
   namespace internal_Argt_traits{
     struct Not_X_Monotone{};
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
index 19a95a662f66..e318449631f4 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
@@ -231,7 +231,7 @@ overlay(const Arrangement_on_surface_2<GeometryTraitsA_2, TopologyTraitsA>& arr1
     xcvs_vec[i] = Ovl_x_monotone_curve_2(eit2->curve(), invalid_he1, he2);
   }
 
-  // Obtain a extended traits-class object and define the sweep-line visitor.
+  // Obtain an extended traits-class object and define the sweep-line visitor.
   const typename Arr_res::Traits_adaptor_2* traits_adaptor =
     arr.traits_adaptor();
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_batched_point_location_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_batched_point_location_traits_2.h
index ce95e1da07a6..4b80bb84dd5e 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_batched_point_location_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_batched_point_location_traits_2.h
@@ -411,7 +411,7 @@ class Arr_batched_point_location_traits_2 {
     }
   };
 
-  /*! Obtain a Equal_2 function object. */
+  /*! Obtain an Equal_2 function object. */
   Equal_2 equal_2_object() const
   { return (Equal_2(m_base_traits->equal_2_object())); }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h
index 3739d35a83af..75c8f25e0c96 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h
@@ -109,7 +109,7 @@ decompose(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
     }
   }
 
-  // Obtain a extended traits-class object.
+  // Obtain an extended traits-class object.
   const Gt2* geom_traits = arr.geometry_traits();
 
   /* We would like to avoid copy construction of the geometry traits class.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
index d54f4c2cb0e1..35498a4dbfdc 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
@@ -737,7 +737,7 @@ insert_non_intersecting_curve
 
   if (vh1 != nullptr) {
     if (vh2 != nullptr) {
-      // Both endpoints are associated with a existing vertices.
+      // Both endpoints are associated with an existing vertices.
       // In this case insert_at_vertices() already returns a halfedge
       // directed from left to right.
       new_he = arr.insert_at_vertices(c,
diff --git a/Arrangement_on_surface_2/include/CGAL/IO/Arr_text_formatter.h b/Arrangement_on_surface_2/include/CGAL/IO/Arr_text_formatter.h
index 34cb310fd072..332f1518179f 100644
--- a/Arrangement_on_surface_2/include/CGAL/IO/Arr_text_formatter.h
+++ b/Arrangement_on_surface_2/include/CGAL/IO/Arr_text_formatter.h
@@ -524,7 +524,7 @@ class Arr_face_extended_text_formatter :
 /*! \class
  * A class defining a textual (\ascii) input/output format for arrangements
  * that store auxiliary dat with all their DCEL records, as they are templated
- * by a extended DCEL class.
+ * by an extended DCEL class.
  */
 template <class Arrangement_>
 class Arr_extended_dcel_text_formatter :
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_basic_insertion_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_basic_insertion_traits_2.h
index 953652180e5e..1b6ee63cd922 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_basic_insertion_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_basic_insertion_traits_2.h
@@ -440,7 +440,7 @@ class Arr_basic_insertion_traits_2 {
     { return (m_base_eq(p1.base(), p2.base())); }
   };
 
-  /*! Obtain a Equal_2 function object */
+  /*! Obtain an Equal_2 function object */
   Equal_2 equal_2_object() const
   { return (Equal_2(m_base_traits->equal_2_object())); }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_no_intersection_insertion_ss_visitor.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_no_intersection_insertion_ss_visitor.h
index e6d4d543144e..e82e28b3164f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_no_intersection_insertion_ss_visitor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_no_intersection_insertion_ss_visitor.h
@@ -23,7 +23,7 @@
  * This class can be further split into two, where one derives from the other,
  * such that the derived class handles the case of inserting non-intersecting
  * curves into a non-empty arrangement, and the base class handles the case of
- * inserting non-intersecting curves into a empty arrangement.
+ * inserting non-intersecting curves into an empty arrangement.
  */
 
 #include <CGAL/Surface_sweep_2/Arr_construction_ss_visitor.h>
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
index b38fc25d3444..17231f6eb5ce 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
@@ -705,7 +705,7 @@ class Arr_overlay_traits_2 {
     { return m_base_equal(xcv1.base(), xcv2.base()); }
   };
 
-  /*! Obtain a Equal_2 functor object. */
+  /*! Obtain an Equal_2 functor object. */
   Equal_2 equal_2_object() const
   { return Equal_2(m_base_traits->equal_2_object()); }
 
diff --git a/BGL/test/BGL/test_Gwdwg.cpp b/BGL/test/BGL/test_Gwdwg.cpp
index e250c5a63a2c..08a742f0be12 100644
--- a/BGL/test/BGL/test_Gwdwg.cpp
+++ b/BGL/test/BGL/test_Gwdwg.cpp
@@ -22,7 +22,7 @@ int main()
   Mesh mesh2(sm2);
   try {
     if( target( *(halfedges(mesh).first), mesh2) == *(vertices(mesh).first)){
-      CGAL_error_msg("The previous lie should have throw a exception");
+      CGAL_error_msg("The previous line should have throw an exception");
     }
   } catch(...){
     std::cerr << "we caught it" << std::endl;
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
index d9d6f19c1c90..41d7508d12ec 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
@@ -387,7 +387,7 @@ class Gps_traits_decorator
     }
   };
 
-  /*! Get a Equal_2 functor object. */
+  /*! Get an Equal_2 functor object. */
   Equal_2 equal_2_object() const
   {
     return Equal_2(m_base_traits->equal_2_object());
diff --git a/Circulator/doc/Circulator/CGAL/circulator.h b/Circulator/doc/Circulator/CGAL/circulator.h
index 7bfeae568050..2973413afd06 100644
--- a/Circulator/doc/Circulator/CGAL/circulator.h
+++ b/Circulator/doc/Circulator/CGAL/circulator.h
@@ -246,7 +246,7 @@ Circulator_from_iterator();
 /*!
 a circulator `c` initialized to refer to the element
 `*cur` in a range `[begin, end)`.
-The circulator `c` refers to a empty sequence
+The circulator `c` refers to an empty sequence
 if `begin==end`.
 
 */
@@ -255,7 +255,7 @@ const I& end, const I& cur = begin);
 
 /*!
 a copy of circulator `d` referring to the element `*cur`.
-The circulator `c` refers to a empty sequence
+The circulator `c` refers to an empty sequence
 if `d` does so.
 
 */
diff --git a/Cone_spanners_2/doc/Cone_spanners_2/Cone_spanners_2.txt b/Cone_spanners_2/doc/Cone_spanners_2/Cone_spanners_2.txt
index d21ef3f1aca8..088fd1c5168d 100644
--- a/Cone_spanners_2/doc/Cone_spanners_2/Cone_spanners_2.txt
+++ b/Cone_spanners_2/doc/Cone_spanners_2/Cone_spanners_2.txt
@@ -304,7 +304,7 @@ and `Construct_yao_graph_2` construct full Theta and Yao graphs. They also provi
 to compute Half Theta and Yao graphs. As mentioned in Section \ref sec_CBS_mydefinitions,
 only the edges for the odd or even cones are added to the graph in an Half Theta and Yao
 graph. To do so, the constructor of the functors provides a parameter of type
-`Cones_selected` which is a enumeration that contains the following possible values:
+`Cones_selected` which is an enumeration that contains the following possible values:
 `ALL_CONES`, `EVEN_CONES` and `ODD_CONES`. Users should include the
 `CGAL/Cone_spanners_enum_2.h` header file to use these enum values. The following are the
 examples on the functor constructions for Half Theta and Yao Graphs.
diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib
index 969a1a79b5ba..6b7c6366af7c 100644
--- a/Documentation/doc/biblio/geom.bib
+++ b/Documentation/doc/biblio/geom.bib
@@ -33579,7 +33579,7 @@ @inproceedings{c-apesp-95
 queries is that of reporting an obstacle-avoiding path $P$ (or
 its length) between two arbitrary query points $p$ and $q$ in the
 plane, such that the length of $P$ is within a small factor of the
-length of a Euclidean {\em shortest} obstacle-avoiding path between
+length of an Euclidean {\em shortest} obstacle-avoiding path between
 $p$ and $q$.  The goal is to answer each short path query quickly
 by constructing data structures that capture path information in
 the obstacle-scattered plane.  For the related all-pairs Euclidean
@@ -120365,7 +120365,7 @@ @inproceedings{rs-aggsb-98
 , keywords =	"Polynomial time approximation schemes, optimal algorithms, derandomization, Traveling salesman tour, Steiner minimum tree, Minimum spanning tree, Minimum matchings, 2-matchings, Edge cover, Rectilinear Steiner minimum tree, quadtrees, spanners, banyans."
 , update =	"00.11 smid, 00.07 smid, 98.03 mitchell"
 , abstract =	"
-We give deterministic and randomized algorithms to find a Euclidean
+We give deterministic and randomized algorithms to find an Euclidean
 traveling salesman tour (TST) of length within $(1+1/s)$ times
 optimal. They run in $O(N \log N)$ time and $O(N)$ space for constant
 dimension and $s$.  These time and space bounds are optimal in an
diff --git a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
index 0950301c127e..cd505d535409 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
@@ -194,7 +194,7 @@ This method is automatically called once, before the first call to paintGL().
 
 Overload init() instead of this method to modify viewer specific OpenGL state.
 
-If a 4.3 context could not be set, a ES 2.0 context will be used instead.
+If a 4.3 context could not be set, an ES 2.0 context will be used instead.
  \see `isOpenGL_4_3()`
 */
 CGAL_INLINE_FUNCTION
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_2.h
index 19e4c6683510..4d2b45ca3439 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_2.h
@@ -208,7 +208,7 @@ class Hyperbolic_Delaunay_triangulation_2: private Delaunay_triangulation_2<Gt,T
   /// @{
     /*!
       Inserts the point `p` in the triangulation.
-      If the point `p` coincides with a existing vertex, then the vertex is returned
+      If the point `p` coincides with an existing vertex, then the vertex is returned
       and the triangulation is not modified. The optional parameter `start` is used
       to initialize the location of `p`.
     */
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt
index d5b32a209795..ed546716b1fc 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt
@@ -27,7 +27,7 @@ H_\infty\f$ of points at infinity.
 
 In this model, a hyperbolic line is either an arc of circle
 perpendicular to the unit circle or, if it passes through the origin,
-a diameter of the unit disk. A hyperbolic circle is a Euclidean
+a diameter of the unit disk. A hyperbolic circle is an Euclidean
 circle contained in the unit disk; however, its hyperbolic center and radius
 are not the same as its Euclidean center and radius.
 
@@ -53,9 +53,9 @@ precisely, the hyperbolic Delaunay triangulation of \f$\mathcal P\f$ only
 contains the simplices of the Euclidean Delaunay triangulation that
 are <i>hyperbolic</i>:
 <ul>
-        <li> A Euclidean Delaunay face is hyperbolic if its
+        <li> An Euclidean Delaunay face is hyperbolic if its
         circumscribing circle is contained in \f$\mathbb H^2\f$.
-        <li> A Euclidean Delaunay edge is hyperbolic if one of the
+        <li> An Euclidean Delaunay edge is hyperbolic if one of the
         empty disks (i.e., not containing any point of \f$\mathcal
         P\f$) passing through its endpoints is contained in \f$\mathbb
         H^2\f$.
@@ -138,13 +138,13 @@ The example below shows how user-defined info can be added to the hyperbolic fac
 We have measured the insertion execution time of our implementation
 with both traits classes `CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2`
 and `CGAL::Hyperbolic_Delaunay_triangulation_traits_2` with their default template
-parameters against the insertion time in a Euclidean \cgal triangulation.
+parameters against the insertion time in an Euclidean \cgal triangulation.
 We generate 1 million random points, uniformly distributed in the unit disk with respect
 to the Euclidean metric. We insert the same set of points in three triangulations:
 <ul>
   <li> a hyperbolic Delaunay triangulation with `CGAL::Hyperbolic_Delaunay_triangulation_traits_2`    (%CORE traits) as traits class;
   <li> a hyperbolic Delaunay triangulation with `CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2` (CK traits)          as traits class;
-  <li> a Euclidean  Delaunay triangulation with `CGAL::Exact_predicates_inexact_constructions_kernel` (EPICK)              as traits class.
+  <li> an Euclidean  Delaunay triangulation with `CGAL::Exact_predicates_inexact_constructions_kernel` (EPICK)              as traits class.
 </ul>
 We create two instances of each type of triangulation. In one instance we insert the points one by one, which causes
 non-hyperbolic faces to be filtered out at each insertion. In the other instance we insert the points via iterator
diff --git a/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake b/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
index 355bde0dd6dd..1d51bbbdac5f 100644
--- a/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
+++ b/Installation/cmake/modules/CGAL_SetupCGALDependencies.cmake
@@ -15,7 +15,7 @@
 # .. variable:: CGAL_DISABLE_GMP
 #
 #    If set, the `GMP` library will not be used. If
-#    :variable:`WITH_LEDA` is not used either, a efficient exact
+#    :variable:`WITH_LEDA` is not used either, an efficient exact
 #    number types are used by CGAL kernels for exact computation.
 #
 # .. variable:: WITH_LEDA
diff --git a/Installation/cmake/modules/FindTBB.cmake b/Installation/cmake/modules/FindTBB.cmake
index 4e808b39eeed..23ec7180e34a 100644
--- a/Installation/cmake/modules/FindTBB.cmake
+++ b/Installation/cmake/modules/FindTBB.cmake
@@ -84,7 +84,7 @@ function(tbb_extract_real_library library real_library)
   set(_elf_magic "7f454c46")
   file(READ ${library} _hex_data OFFSET 0 LIMIT 4 HEX)
   if(_hex_data STREQUAL _elf_magic)
-    #we have opened a elf binary so this is what
+    #we have opened an elf binary so this is what
     #we should link to
     set(${real_library} "${library}" PARENT_SCOPE)
     return()
diff --git a/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h b/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h
index ae3aec7f350b..d18631c63cf3 100644
--- a/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h
+++ b/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 The class `Extended_homogeneous` serves as a traits class for the class
 `Nef_polyhedron_2<T>`. It uses a polynomial component
-representation based on a Euclidean ring number type `RT`.
+representation based on an Euclidean ring number type `RT`.
 
 \cgalModels `ExtendedKernelTraits_2`
 
diff --git a/Nef_S2/include/CGAL/Nef_S2/SM_io_parser.h b/Nef_S2/include/CGAL/Nef_S2/SM_io_parser.h
index 7c09b4eaf0cd..994c6a41b806 100644
--- a/Nef_S2/include/CGAL/Nef_S2/SM_io_parser.h
+++ b/Nef_S2/include/CGAL/Nef_S2/SM_io_parser.h
@@ -34,7 +34,7 @@ namespace CGAL {
 /*{\Manpage {SM_io_parser}{Decorator_}{IO of embedded maps}{IO}}*/
 
 /*{\Mdefinition An instance |\Mvar| of the data type |\Mname| is a
-decorator to provide input and output of a embedded map.  |\Mtype| is
+decorator to provide input and output of an embedded map.  |\Mtype| is
 generic with respect to the |Decorator_| parameter.  |Decorator_| has
 to be a decorator model of our |SM_decorator| concept.}*/
 
diff --git a/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h b/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h
index 80e67f1ea86b..ceb0515c0d1e 100644
--- a/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h
+++ b/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h
@@ -41,7 +41,7 @@ namespace Intern{
  *
  *  Extensions provide suitable specializations of \c CGAL::Fraction_traits.
  *  They are decomposable iff their coefficient type is.
- *  The denominator \e d of a Extension \e ext is a low common multiple
+ *  The denominator \e d of an Extension \e ext is a low common multiple
  *  (see \c CGAL::Fraction_traits::Common_factor for details) of the
  *  denominators of its coefficients.  The numerator is the Extenion
  *  \e d*ext with a fraction-free coefficient type.
diff --git a/Periodic_4_hyperbolic_triangulation_2/test/Periodic_4_hyperbolic_triangulation_2/test_p4ht2_locate.cpp b/Periodic_4_hyperbolic_triangulation_2/test/Periodic_4_hyperbolic_triangulation_2/test_p4ht2_locate.cpp
index 87c787ddb2b5..62cfc0c35808 100644
--- a/Periodic_4_hyperbolic_triangulation_2/test/Periodic_4_hyperbolic_triangulation_2/test_p4ht2_locate.cpp
+++ b/Periodic_4_hyperbolic_triangulation_2/test/Periodic_4_hyperbolic_triangulation_2/test_p4ht2_locate.cpp
@@ -57,7 +57,7 @@ int main(int, char**)
     std::cout << "   dummy point " << j << ": OK " << std::endl;
   }
 
-  std::cout << "---- locating the midpoint of a Euclidean segment ----" << std::endl;
+  std::cout << "---- locating the midpoint of an Euclidean segment ----" << std::endl;
   Point p1 = tr.get_dummy_point(0), p2 = tr.get_dummy_point(1);
   Point query = midpoint(p1, p2);
   fh = tr.hyperbolic_locate(query, lt, li);
diff --git a/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h b/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
index f989b8ff2019..0ebb99ce5ddc 100644
--- a/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
+++ b/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
@@ -241,7 +241,7 @@ class Polynomial_algebraic_structure_traits_base< POLY, Unique_factorization_dom
   };
 };
 
-// Clone this for a EuclideanRing
+// Clone this for an EuclideanRing
 template< class POLY >
 class Polynomial_algebraic_structure_traits_base< POLY, Euclidean_ring_tag >
   : public Polynomial_algebraic_structure_traits_base< POLY,
diff --git a/Polynomial/include/CGAL/Polynomial/prs_resultant.h b/Polynomial/include/CGAL/Polynomial/prs_resultant.h
index 87a150b14990..f4de96b3ec36 100644
--- a/Polynomial/include/CGAL/Polynomial/prs_resultant.h
+++ b/Polynomial/include/CGAL/Polynomial/prs_resultant.h
@@ -225,7 +225,7 @@ NT prs_resultant_decompose(Polynomial<NT> A, Polynomial<NT> B){
  *  subresultant version. This depends on the coefficient type:
  *  If \c NT is a \c UFDomain , the subresultant PRS is formed.
  *  If \c NT is a \c Field that is not decomposable (see
- *  \c CGAL::Fraction_traits ), then a Euclidean PRS is formed.
+ *  \c CGAL::Fraction_traits ), then an Euclidean PRS is formed.
  *  If \c NT is a \c Field that is decomposable, then the
  *  \c Numerator must be a \c UFDomain, and the subresultant
  *  PRS is formed for the decomposed polynomials.
diff --git a/Polynomial/include/CGAL/Polynomial_traits_d.h b/Polynomial/include/CGAL/Polynomial_traits_d.h
index f7a4d3993e32..366da066d2fb 100644
--- a/Polynomial/include/CGAL/Polynomial_traits_d.h
+++ b/Polynomial/include/CGAL/Polynomial_traits_d.h
@@ -462,7 +462,7 @@ class Polynomial_traits_d_base< Polynomial< Coefficient_type_ >,
 
 
   // We use our own Strict Weak Ordering predicate in order to avoid
-  // problems when calling sort for a Exponents_coeff_pair where the
+  // problems when calling sort for an Exponents_coeff_pair where the
   // coeff type has no comparison operators available.
 private:
   struct Compare_exponents_coeff_pair
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
index fd72ee75e07a..1b19d9598ca8 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
@@ -5,7 +5,7 @@
 Requirements of a distance class defining a distance between a query item
 denoting a spatial object and a point.
 To optimize distance computations transformed distances are used,
-e.g., for a Euclidean distance the transformed distance is the squared
+e.g., for an Euclidean distance the transformed distance is the squared
 Euclidean distance.
 
 \cgalHasModel `CGAL::Manhattan_distance_iso_box_point<Traits>`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h
index fb30f495c46c..389c4cb90534 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h
@@ -11,7 +11,7 @@ which is the vertex type required by the `StraightSkeleton_2` concept.
 \tparam Refs must be a model of `StraightSkeleton_2`
 \tparam Point a Point type
 \tparam FT must be a model of the `FieldWithSqrt`, which is the numeric type used to represent
-           the time of a vertex (a Euclidean distance).
+           the time of a vertex (an Euclidean distance).
 
 This class can be used as a base class allowing users of the straight skeleton data structure to decorate
 a vertex with additional data. The concrete vertex class must be given in the `HalfedgeDSItems`
diff --git a/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h b/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h
index b968c287195f..ab4492aea32e 100644
--- a/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h
+++ b/Straight_skeleton_2/include/CGAL/constructions/Straight_skeleton_cons_ftC2.h
@@ -328,7 +328,7 @@ construct_trisegment ( Segment_2_with_ID<K> const& e0,
 // If the lines do not intersect, for example, for collinear edges, or parallel edges but with the same orientation,
 // returns 0 (the actual distance is undefined in this case, but 0 is a useful return)
 //
-// NOTE: The result is a explicit rational number returned as a tuple (num,den); the caller must check that den!=0 manually
+// NOTE: The result is an explicit rational number returned as a tuple (num,den); the caller must check that den!=0 manually
 // (a predicate for instance should return indeterminate in this case)
 //
 // PRECONDITION: None of e0, e1 and e2 are collinear (but two of them can be parallel)
@@ -596,7 +596,7 @@ compute_artifical_isec_timeC2 ( Trisegment_2_ptr< Trisegment_2<K, Segment_2_with
 // returns the OFFSET DISTANCE (n/d) at which a line perpendicular to the collinear edge passing through
 // the degenerate seed point intersects the offset line of the non collinear edge
 //
-// NOTE: The result is a explicit rational number returned as a tuple (num,den); the caller must check that den!=0 manually
+// NOTE: The result is an explicit rational number returned as a tuple (num,den); the caller must check that den!=0 manually
 // (a predicate for instance should return indeterminate in this case)
 //
 // POSTCONDITION: In case of overflow an empty optional is returned.
diff --git a/Surface_mesh/include/CGAL/Surface_mesh/Properties.h b/Surface_mesh/include/CGAL/Surface_mesh/Properties.h
index 31eea166ee58..5e8733a87f8a 100644
--- a/Surface_mesh/include/CGAL/Surface_mesh/Properties.h
+++ b/Surface_mesh/include/CGAL/Surface_mesh/Properties.h
@@ -67,7 +67,7 @@ class Base_property_array
     /// Return a deep copy of self.
     virtual Base_property_array* clone () const = 0;
 
-    /// Return a empty copy of self.
+    /// Return an empty copy of self.
     virtual Base_property_array* empty_clone () const = 0;
 
     /// Return the type_info of the property
diff --git a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/auxiliary/graph.h b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/auxiliary/graph.h
index eaad25fb19e2..e80cd6f6b289 100644
--- a/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/auxiliary/graph.h
+++ b/Surface_mesh_segmentation/include/CGAL/Surface_mesh_segmentation/internal/auxiliary/graph.h
@@ -661,7 +661,7 @@ class Graph
   DBlock<nodeptr>                *nodeptr_block;
 
   void        (*error_function)(const char
-                          *);        /* this function is called if a error occurs,
+                          *);        /* this function is called if an error occurs,
                                                                                    with a corresponding error message
                                                                                    (or exit(1) is called if it's nullptr) */
 
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt b/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
index 4ce425fb91f2..d11557c2f2c3 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
@@ -31,7 +31,7 @@ The algorithm to find a shortest non-contractible curve through a specified vert
 
 \subsection SMTopology_homotopy Homotopy Test
 
-Given a curve drawn on a surface one can ask if the curve can be continuously deformed to a point (i.e. a zero length curve). In other words, does there exist a continuous sequence of curves on the surface that starts with the input curve and ends to a point? Curves that deform to a point are said <em>contractible</em>. Any curve on a sphere is contractible but this is not true for all curves on a torus or on a surface with more complicated topology. The algorithms in this section are purely topological and do not assume any geometry on the input surface. In particular, the surface is not necessarily embedded in a Euclidean space.
+Given a curve drawn on a surface one can ask if the curve can be continuously deformed to a point (i.e. a zero length curve). In other words, does there exist a continuous sequence of curves on the surface that starts with the input curve and ends to a point? Curves that deform to a point are said <em>contractible</em>. Any curve on a sphere is contractible but this is not true for all curves on a torus or on a surface with more complicated topology. The algorithms in this section are purely topological and do not assume any geometry on the input surface. In particular, the surface is not necessarily embedded in an Euclidean space.
 
 The algorithm implemented in this package builds a data structure to efficiently answer queries of the following forms:
 - Given a combinatorial surface \f$\cal{M}\f$ and a closed combinatorial curve specified as a sequence of edges of \f$\cal{M}\f$, decide if the curve is contractible on \f$\cal{M}\f$,

From 40c7765ffb232ee6b421317401c1b2d226fc5bc9 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Sun, 30 Jul 2023 17:54:10 +0200
Subject: [PATCH 0543/1398] Spelling corrections

Corrections based on review
---
 .../doc/Algebraic_foundations/Concepts/EuclideanRing.h |  4 ++--
 .../CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h    |  2 +-
 .../Arr_batched_point_location_traits_2.h              |  2 +-
 .../Arrangement_2/Arrangement_on_surface_2_global.h    |  2 +-
 .../Surface_sweep_2/Arr_basic_insertion_traits_2.h     |  2 +-
 .../CGAL/Surface_sweep_2/Arr_overlay_traits_2.h        |  2 +-
 .../Boolean_set_operations_2/Gps_traits_decorator.h    |  2 +-
 Documentation/doc/biblio/geom.bib                      |  4 ++--
 .../Hyperbolic_triangulation_2.txt                     | 10 +++++-----
 .../include/CGAL/Hyperbolic_Delaunay_triangulation_2.h |  4 ++--
 Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h            |  2 +-
 .../include/CGAL/Sqrt_extension/Fraction_traits.h      |  4 ++--
 .../test_p4ht2_locate.cpp                              |  2 +-
 .../CGAL/Polynomial/Algebraic_structure_traits.h       |  2 +-
 Polynomial/include/CGAL/Polynomial/prs_resultant.h     |  2 +-
 Polynomial/include/CGAL/Polynomial_traits_d.h          |  2 +-
 .../doc/Spatial_searching/Concepts/GeneralDistance.h   |  2 +-
 .../Spatial_searching/Concepts/OrthogonalDistance.h    |  2 +-
 .../doc/Spatial_searching/Spatial_searching.txt        |  2 +-
 .../CGAL/Straight_skeleton_vertex_base_2.h             |  2 +-
 .../Concepts/PolygonOffsetBuilderTraits_2.h            |  2 +-
 .../Concepts/StraightSkeletonBuilderTraits_2.h         |  4 ++--
 .../Concepts/StraightSkeletonVertex_2.h                |  2 +-
 .../Surface_mesh_parameterization.txt                  |  2 +-
 .../CGAL/Curves_on_surface_topology.h                  |  2 +-
 .../Surface_mesh_topology/Surface_mesh_topology.txt    |  2 +-
 26 files changed, 35 insertions(+), 35 deletions(-)

diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h
index 7ae8d52ecc59..a1ea3df6e968 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/EuclideanRing.h
@@ -3,7 +3,7 @@
 \ingroup PkgAlgebraicFoundationsAlgebraicStructuresConcepts
 \cgalConcept
 
-A model of `EuclideanRing` represents an euclidean ring (or Euclidean domain).
+A model of `EuclideanRing` represents a Euclidean ring (or Euclidean domain).
 It is an `UniqueFactorizationDomain` that affords a suitable notion of minimality of remainders
 such that given \f$ x\f$ and \f$ y \neq 0\f$ we obtain an (almost) unique solution to
 \f$ x = qy + r \f$ by demanding that a solution \f$ (q,r)\f$ is chosen to minimize \f$ r\f$.
@@ -21,7 +21,7 @@ Moreover, `CGAL::Algebraic_structure_traits< EuclideanRing >` is a model of
 
 \cgalHeading{Remarks}
 
-The most prominent example of an Euclidean ring are the integers.
+The most prominent example of a Euclidean ring are the integers.
 Whenever both \f$ x\f$ and \f$ y\f$ are positive, then it is conventional to choose
 the smallest positive remainder \f$ r\f$.
 
diff --git a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
index dad6b92fb904..1f289de4787f 100644
--- a/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
+++ b/Algebraic_kernel_d/include/CGAL/Algebraic_kernel_d/Curve_pair_analysis_2.h
@@ -613,7 +613,7 @@ class Curve_pair_analysis_2 :
     /*
      * \brief returns the indices of the <tt>i</tt>th event value
      *
-     * Returns an Event_indices <tt>(fg,ffy,ggy)</tt> such that
+     * Returns an `Event_indices` <tt>(fg,ffy,ggy)</tt> such that
      * the <tt>i</tt>th event root is the <tt>fg</tt>th root of the
      * resultant of \c f and \c g, the <tt>ffy</tt>th root of the
      * discriminant of \c f, and  the <tt>ggy</tt>th root of the
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_batched_point_location_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_batched_point_location_traits_2.h
index 4b80bb84dd5e..b83ca0189e23 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_batched_point_location_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_batched_point_location_traits_2.h
@@ -411,7 +411,7 @@ class Arr_batched_point_location_traits_2 {
     }
   };
 
-  /*! Obtain an Equal_2 function object. */
+  /*! Obtain an `Equal_2` function object. */
   Equal_2 equal_2_object() const
   { return (Equal_2(m_base_traits->equal_2_object())); }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
index 35498a4dbfdc..80a291231687 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
@@ -737,7 +737,7 @@ insert_non_intersecting_curve
 
   if (vh1 != nullptr) {
     if (vh2 != nullptr) {
-      // Both endpoints are associated with an existing vertices.
+      // Both endpoints are associated with existing vertices.
       // In this case insert_at_vertices() already returns a halfedge
       // directed from left to right.
       new_he = arr.insert_at_vertices(c,
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_basic_insertion_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_basic_insertion_traits_2.h
index 1b6ee63cd922..1418044d5f40 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_basic_insertion_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_basic_insertion_traits_2.h
@@ -440,7 +440,7 @@ class Arr_basic_insertion_traits_2 {
     { return (m_base_eq(p1.base(), p2.base())); }
   };
 
-  /*! Obtain an Equal_2 function object */
+  /*! Obtain an `Equal_2` function object */
   Equal_2 equal_2_object() const
   { return (Equal_2(m_base_traits->equal_2_object())); }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
index 17231f6eb5ce..bde6981c768d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_traits_2.h
@@ -705,7 +705,7 @@ class Arr_overlay_traits_2 {
     { return m_base_equal(xcv1.base(), xcv2.base()); }
   };
 
-  /*! Obtain an Equal_2 functor object. */
+  /*! Obtain an `Equal_2` functor object. */
   Equal_2 equal_2_object() const
   { return Equal_2(m_base_traits->equal_2_object()); }
 
diff --git a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
index 41d7508d12ec..cf1574c6aced 100644
--- a/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
+++ b/Boolean_set_operations_2/include/CGAL/Boolean_set_operations_2/Gps_traits_decorator.h
@@ -387,7 +387,7 @@ class Gps_traits_decorator
     }
   };
 
-  /*! Get an Equal_2 functor object. */
+  /*! Get an `Equal_2` functor object. */
   Equal_2 equal_2_object() const
   {
     return Equal_2(m_base_traits->equal_2_object());
diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib
index 6b7c6366af7c..969a1a79b5ba 100644
--- a/Documentation/doc/biblio/geom.bib
+++ b/Documentation/doc/biblio/geom.bib
@@ -33579,7 +33579,7 @@ @inproceedings{c-apesp-95
 queries is that of reporting an obstacle-avoiding path $P$ (or
 its length) between two arbitrary query points $p$ and $q$ in the
 plane, such that the length of $P$ is within a small factor of the
-length of an Euclidean {\em shortest} obstacle-avoiding path between
+length of a Euclidean {\em shortest} obstacle-avoiding path between
 $p$ and $q$.  The goal is to answer each short path query quickly
 by constructing data structures that capture path information in
 the obstacle-scattered plane.  For the related all-pairs Euclidean
@@ -120365,7 +120365,7 @@ @inproceedings{rs-aggsb-98
 , keywords =	"Polynomial time approximation schemes, optimal algorithms, derandomization, Traveling salesman tour, Steiner minimum tree, Minimum spanning tree, Minimum matchings, 2-matchings, Edge cover, Rectilinear Steiner minimum tree, quadtrees, spanners, banyans."
 , update =	"00.11 smid, 00.07 smid, 98.03 mitchell"
 , abstract =	"
-We give deterministic and randomized algorithms to find an Euclidean
+We give deterministic and randomized algorithms to find a Euclidean
 traveling salesman tour (TST) of length within $(1+1/s)$ times
 optimal. They run in $O(N \log N)$ time and $O(N)$ space for constant
 dimension and $s$.  These time and space bounds are optimal in an
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt
index ed546716b1fc..d5b32a209795 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/Hyperbolic_triangulation_2.txt
@@ -27,7 +27,7 @@ H_\infty\f$ of points at infinity.
 
 In this model, a hyperbolic line is either an arc of circle
 perpendicular to the unit circle or, if it passes through the origin,
-a diameter of the unit disk. A hyperbolic circle is an Euclidean
+a diameter of the unit disk. A hyperbolic circle is a Euclidean
 circle contained in the unit disk; however, its hyperbolic center and radius
 are not the same as its Euclidean center and radius.
 
@@ -53,9 +53,9 @@ precisely, the hyperbolic Delaunay triangulation of \f$\mathcal P\f$ only
 contains the simplices of the Euclidean Delaunay triangulation that
 are <i>hyperbolic</i>:
 <ul>
-        <li> An Euclidean Delaunay face is hyperbolic if its
+        <li> A Euclidean Delaunay face is hyperbolic if its
         circumscribing circle is contained in \f$\mathbb H^2\f$.
-        <li> An Euclidean Delaunay edge is hyperbolic if one of the
+        <li> A Euclidean Delaunay edge is hyperbolic if one of the
         empty disks (i.e., not containing any point of \f$\mathcal
         P\f$) passing through its endpoints is contained in \f$\mathbb
         H^2\f$.
@@ -138,13 +138,13 @@ The example below shows how user-defined info can be added to the hyperbolic fac
 We have measured the insertion execution time of our implementation
 with both traits classes `CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2`
 and `CGAL::Hyperbolic_Delaunay_triangulation_traits_2` with their default template
-parameters against the insertion time in an Euclidean \cgal triangulation.
+parameters against the insertion time in a Euclidean \cgal triangulation.
 We generate 1 million random points, uniformly distributed in the unit disk with respect
 to the Euclidean metric. We insert the same set of points in three triangulations:
 <ul>
   <li> a hyperbolic Delaunay triangulation with `CGAL::Hyperbolic_Delaunay_triangulation_traits_2`    (%CORE traits) as traits class;
   <li> a hyperbolic Delaunay triangulation with `CGAL::Hyperbolic_Delaunay_triangulation_CK_traits_2` (CK traits)          as traits class;
-  <li> an Euclidean  Delaunay triangulation with `CGAL::Exact_predicates_inexact_constructions_kernel` (EPICK)              as traits class.
+  <li> a Euclidean  Delaunay triangulation with `CGAL::Exact_predicates_inexact_constructions_kernel` (EPICK)              as traits class.
 </ul>
 We create two instances of each type of triangulation. In one instance we insert the points one by one, which causes
 non-hyperbolic faces to be filtered out at each insertion. In the other instance we insert the points via iterator
diff --git a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_2.h b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_2.h
index 538991692ba3..d95bfe27fba8 100644
--- a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_2.h
+++ b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_2.h
@@ -880,7 +880,7 @@ class Hyperbolic_Delaunay_triangulation_2
 
   Face_handle locate(const Point& query, Locate_type& lt, int &li, Face_handle hint = Face_handle()) const
   {
-    // Perform an Euclidean location first and get close to the hyperbolic face containing the query point
+    // Perform a Euclidean location first and get close to the hyperbolic face containing the query point
     typename Base::Locate_type blt;
     Face_handle fh = Base::locate(query, blt, li, hint);
 
@@ -901,7 +901,7 @@ class Hyperbolic_Delaunay_triangulation_2
 
     CGAL_assertion(!is_infinite(fh));
 
-    // This case corresponds to when the point is located on an Euclidean edge.
+    // This case corresponds to when the point is located on a Euclidean edge.
     if(lt == EDGE)
     {
       // Here because the call to `side_of_hyperbolic_triangle` might change `li`
diff --git a/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h b/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h
index d18631c63cf3..ae3aec7f350b 100644
--- a/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h
+++ b/Nef_2/doc/Nef_2/CGAL/Extended_homogeneous.h
@@ -6,7 +6,7 @@ namespace CGAL {
 
 The class `Extended_homogeneous` serves as a traits class for the class
 `Nef_polyhedron_2<T>`. It uses a polynomial component
-representation based on an Euclidean ring number type `RT`.
+representation based on a Euclidean ring number type `RT`.
 
 \cgalModels `ExtendedKernelTraits_2`
 
diff --git a/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h b/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h
index ceb0515c0d1e..a4daeef3828f 100644
--- a/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h
+++ b/Number_types/include/CGAL/Sqrt_extension/Fraction_traits.h
@@ -41,9 +41,9 @@ namespace Intern{
  *
  *  Extensions provide suitable specializations of \c CGAL::Fraction_traits.
  *  They are decomposable iff their coefficient type is.
- *  The denominator \e d of an Extension \e ext is a low common multiple
+ *  The denominator \e d of an extension \e ext is a low common multiple
  *  (see \c CGAL::Fraction_traits::Common_factor for details) of the
- *  denominators of its coefficients.  The numerator is the Extenion
+ *  denominators of its coefficients.  The numerator is the extenion
  *  \e d*ext with a fraction-free coefficient type.
  *
  *  This works for nested Sqrt_extensions, too.
diff --git a/Periodic_4_hyperbolic_triangulation_2/test/Periodic_4_hyperbolic_triangulation_2/test_p4ht2_locate.cpp b/Periodic_4_hyperbolic_triangulation_2/test/Periodic_4_hyperbolic_triangulation_2/test_p4ht2_locate.cpp
index 62cfc0c35808..87c787ddb2b5 100644
--- a/Periodic_4_hyperbolic_triangulation_2/test/Periodic_4_hyperbolic_triangulation_2/test_p4ht2_locate.cpp
+++ b/Periodic_4_hyperbolic_triangulation_2/test/Periodic_4_hyperbolic_triangulation_2/test_p4ht2_locate.cpp
@@ -57,7 +57,7 @@ int main(int, char**)
     std::cout << "   dummy point " << j << ": OK " << std::endl;
   }
 
-  std::cout << "---- locating the midpoint of an Euclidean segment ----" << std::endl;
+  std::cout << "---- locating the midpoint of a Euclidean segment ----" << std::endl;
   Point p1 = tr.get_dummy_point(0), p2 = tr.get_dummy_point(1);
   Point query = midpoint(p1, p2);
   fh = tr.hyperbolic_locate(query, lt, li);
diff --git a/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h b/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
index 0ebb99ce5ddc..f989b8ff2019 100644
--- a/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
+++ b/Polynomial/include/CGAL/Polynomial/Algebraic_structure_traits.h
@@ -241,7 +241,7 @@ class Polynomial_algebraic_structure_traits_base< POLY, Unique_factorization_dom
   };
 };
 
-// Clone this for an EuclideanRing
+// Clone this for a EuclideanRing
 template< class POLY >
 class Polynomial_algebraic_structure_traits_base< POLY, Euclidean_ring_tag >
   : public Polynomial_algebraic_structure_traits_base< POLY,
diff --git a/Polynomial/include/CGAL/Polynomial/prs_resultant.h b/Polynomial/include/CGAL/Polynomial/prs_resultant.h
index f4de96b3ec36..87a150b14990 100644
--- a/Polynomial/include/CGAL/Polynomial/prs_resultant.h
+++ b/Polynomial/include/CGAL/Polynomial/prs_resultant.h
@@ -225,7 +225,7 @@ NT prs_resultant_decompose(Polynomial<NT> A, Polynomial<NT> B){
  *  subresultant version. This depends on the coefficient type:
  *  If \c NT is a \c UFDomain , the subresultant PRS is formed.
  *  If \c NT is a \c Field that is not decomposable (see
- *  \c CGAL::Fraction_traits ), then an Euclidean PRS is formed.
+ *  \c CGAL::Fraction_traits ), then a Euclidean PRS is formed.
  *  If \c NT is a \c Field that is decomposable, then the
  *  \c Numerator must be a \c UFDomain, and the subresultant
  *  PRS is formed for the decomposed polynomials.
diff --git a/Polynomial/include/CGAL/Polynomial_traits_d.h b/Polynomial/include/CGAL/Polynomial_traits_d.h
index 366da066d2fb..6eb4f0d6e3f2 100644
--- a/Polynomial/include/CGAL/Polynomial_traits_d.h
+++ b/Polynomial/include/CGAL/Polynomial_traits_d.h
@@ -462,7 +462,7 @@ class Polynomial_traits_d_base< Polynomial< Coefficient_type_ >,
 
 
   // We use our own Strict Weak Ordering predicate in order to avoid
-  // problems when calling sort for an Exponents_coeff_pair where the
+  // problems when calling sort for an `Exponents_coeff_pair` where the
   // coeff type has no comparison operators available.
 private:
   struct Compare_exponents_coeff_pair
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
index 1b19d9598ca8..fd72ee75e07a 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/GeneralDistance.h
@@ -5,7 +5,7 @@
 Requirements of a distance class defining a distance between a query item
 denoting a spatial object and a point.
 To optimize distance computations transformed distances are used,
-e.g., for an Euclidean distance the transformed distance is the squared
+e.g., for a Euclidean distance the transformed distance is the squared
 Euclidean distance.
 
 \cgalHasModel `CGAL::Manhattan_distance_iso_box_point<Traits>`
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
index d2a398589d80..d5b2af664e8c 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/OrthogonalDistance.h
@@ -4,7 +4,7 @@
 
 Requirements of an orthogonal distance class supporting incremental distance updates.
 To optimize distance computations transformed distances are used.
-E.g., for an Euclidean distance the transformed distance is the squared Euclidean distance.
+E.g., for a Euclidean distance the transformed distance is the squared Euclidean distance.
 
 \cgalRefines{GeneralDistance}
 
diff --git a/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt b/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt
index afa3a3eb0ca8..b6f061060699 100644
--- a/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt
+++ b/Spatial_searching/doc/Spatial_searching/Spatial_searching.txt
@@ -282,7 +282,7 @@ scenarios for different splitter types.
 
 \subsection Spatial_searchingExampleforKNeighborSearching Example for K Neighbor Searching
 
-The first example illustrates k neighbor searching with an Euclidean
+The first example illustrates k neighbor searching with a Euclidean
 distance and 2-dimensional points. The generated random
 data points are inserted in a search tree. We then initialize
 the k neighbor search object with the origin as query. Finally, we
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h
index 389c4cb90534..fb30f495c46c 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/CGAL/Straight_skeleton_vertex_base_2.h
@@ -11,7 +11,7 @@ which is the vertex type required by the `StraightSkeleton_2` concept.
 \tparam Refs must be a model of `StraightSkeleton_2`
 \tparam Point a Point type
 \tparam FT must be a model of the `FieldWithSqrt`, which is the numeric type used to represent
-           the time of a vertex (an Euclidean distance).
+           the time of a vertex (a Euclidean distance).
 
 This class can be used as a base class allowing users of the straight skeleton data structure to decorate
 a vertex with additional data. The concrete vertex class must be given in the `HalfedgeDSItems`
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
index d0c364262cbb..0c9bd5a352eb 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/PolygonOffsetBuilderTraits_2.h
@@ -41,7 +41,7 @@ Must provide
 `boost::optional<Point_2> operator()(const FT& t, const Segment_2& e0, const Segment_2& e1, const Trisegment_2_ptr& et) const`,
 
 which constructs the point of intersection of the lines obtained by offsetting
-the oriented lines given by `e0` and `e0` an Euclidean distance `t`.
+the oriented lines given by `e0` and `e0` a Euclidean distance `t`.
 
 If `e0` and `e1` are collinear, if `et` is not specified (`nullptr`), then the midpoint should be returned,
 otherwise, the event point of `et` should be returned.
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
index f971c1c880c2..2b27a072c431 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonBuilderTraits_2.h
@@ -67,8 +67,8 @@ Must provide
 `bool operator()( const Trisegment_2_ptr& tri_segment, boost::optional<FT> max_time ) const`,
 
 which determines if, given the three <I>oriented</I> lines defined by the three input edges,
-there exists an Euclidean distance `t >= 0` and `t <= max_time` for which the corresponding three
-<I>offset lines at `t`</I> (parallel lines at an Euclidean distance of `t`) intersect in a single point.
+there exists a Euclidean distance `t >= 0` and `t <= max_time` for which the corresponding three
+<I>offset lines at `t`</I> (parallel lines at a Euclidean distance of `t`) intersect in a single point.
 
 \pre Each edge in the triple must properly define an oriented line, that is, its points cannot be coincident.
 */
diff --git a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
index 7a26285dccfc..1b66e17ee694 100644
--- a/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
+++ b/Straight_skeleton_2/doc/Straight_skeleton_2/Concepts/StraightSkeletonVertex_2.h
@@ -26,7 +26,7 @@ The type of the 2D point being the geometric embedding of the vertex
 typedef unspecified_type Point_2;
 
 /*!
-A model of the `FieldWithSqrt` concept representing the time of a vertex (an Euclidean distance)
+A model of the `FieldWithSqrt` concept representing the time of a vertex (a Euclidean distance)
 */
 typedef unspecified_type FT;
 
diff --git a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
index 3a876b5977a8..c4be5d3c0fb1 100644
--- a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
+++ b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
@@ -441,7 +441,7 @@ Orbifold-Tutte Planar Embedding was introduced by Aigerman and Lipman \cgalCite{
 and is a generalization of Tutte’s embedding to other topologies, and in particular
 spheres, which we consider here. The orbifold-Tutte embedding bijectively maps
 the original surface, that is required to be a topological ball, to a canonical,
-topologically equivalent, two-dimensional flat surface called an Euclidean orbifold.
+topologically equivalent, two-dimensional flat surface called a Euclidean orbifold.
 There are 17 Euclidean orbifolds, of which only the 4 sphere orbifolds are currently implemented
 in CGAL.
 
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/Curves_on_surface_topology.h b/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/Curves_on_surface_topology.h
index d8fafdc03048..21a7c20ee0e6 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/Curves_on_surface_topology.h
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/Curves_on_surface_topology.h
@@ -91,7 +91,7 @@ namespace Surface_mesh_topology {
     /// Number type of the weights.
     using Weight_t=double;
 
-    /// creates an Euclidean_length_weight_functor given a mesh.
+    /// creates a Euclidean_length_weight_functor given a mesh.
     Euclidean_length_weight_functor(const Mesh& m);
   };
 
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt b/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
index d11557c2f2c3..4ce425fb91f2 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
@@ -31,7 +31,7 @@ The algorithm to find a shortest non-contractible curve through a specified vert
 
 \subsection SMTopology_homotopy Homotopy Test
 
-Given a curve drawn on a surface one can ask if the curve can be continuously deformed to a point (i.e. a zero length curve). In other words, does there exist a continuous sequence of curves on the surface that starts with the input curve and ends to a point? Curves that deform to a point are said <em>contractible</em>. Any curve on a sphere is contractible but this is not true for all curves on a torus or on a surface with more complicated topology. The algorithms in this section are purely topological and do not assume any geometry on the input surface. In particular, the surface is not necessarily embedded in an Euclidean space.
+Given a curve drawn on a surface one can ask if the curve can be continuously deformed to a point (i.e. a zero length curve). In other words, does there exist a continuous sequence of curves on the surface that starts with the input curve and ends to a point? Curves that deform to a point are said <em>contractible</em>. Any curve on a sphere is contractible but this is not true for all curves on a torus or on a surface with more complicated topology. The algorithms in this section are purely topological and do not assume any geometry on the input surface. In particular, the surface is not necessarily embedded in a Euclidean space.
 
 The algorithm implemented in this package builds a data structure to efficiently answer queries of the following forms:
 - Given a combinatorial surface \f$\cal{M}\f$ and a closed combinatorial curve specified as a sequence of edges of \f$\cal{M}\f$, decide if the curve is contractible on \f$\cal{M}\f$,

From 7487010c0998739b3e5210b601f11d397aeb615a Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 1 Aug 2023 09:43:59 +0100
Subject: [PATCH 0544/1398] Remove blabla as the emums are documented in
 Mesh_2/doc

---
 Mesher_level/include/CGAL/Mesh_optimization_return_code.h | 5 +----
 1 file changed, 1 insertion(+), 4 deletions(-)

diff --git a/Mesher_level/include/CGAL/Mesh_optimization_return_code.h b/Mesher_level/include/CGAL/Mesh_optimization_return_code.h
index 3643395667c2..4717055c5303 100644
--- a/Mesher_level/include/CGAL/Mesh_optimization_return_code.h
+++ b/Mesher_level/include/CGAL/Mesh_optimization_return_code.h
@@ -18,10 +18,7 @@
 #define CGAL_MESH_OPTIMIZATION_RETURN_CODE_H
 
 namespace CGAL {
-  /*!
-   * \brief bla bla
-   @todo  document correctly
-   */
+
 enum Mesh_optimization_return_code
 {
   MESH_OPTIMIZATION_UNKNOWN_ERROR=-1,

From 92a434018ac1087aab8c02c1835a2a87a68e29e2 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 23 May 2023 00:09:18 +0200
Subject: [PATCH 0545/1398] Add sizing field calculation from curvature

WIP: isotropic remeshing default overload is now broken
---
 .../Polygon_mesh_processing/CMakeLists.txt    |  11 +-
 ...sotropic_remeshing_with_sizing_example.cpp |  15 +-
 .../Adaptive_sizing_field.h                   | 141 +++++++++++++-----
 .../Isotropic_remeshing/Sizing_field.h        |   2 +-
 .../Uniform_sizing_field.h                    |   5 +-
 .../Isotropic_remeshing/remesh_impl.h         |   9 +-
 .../CGAL/Polygon_mesh_processing/remesh.h     |  10 +-
 7 files changed, 140 insertions(+), 53 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index 28d0550a31c4..3644cc490978 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -25,9 +25,8 @@ create_single_source_cgal_program("orient_polygon_soup_example.cpp")
 create_single_source_cgal_program("triangulate_polyline_example.cpp")
 create_single_source_cgal_program("mesh_slicer_example.cpp")
 #create_single_source_cgal_program( "remove_degeneracies_example.cpp")
-create_single_source_cgal_program("isotropic_remeshing_example.cpp")
-create_single_source_cgal_program("isotropic_remeshing_of_patch_example.cpp")
-create_single_source_cgal_program("isotropic_remeshing_with_sizing_example.cpp")
+#create_single_source_cgal_program("isotropic_remeshing_example.cpp")
+#create_single_source_cgal_program("isotropic_remeshing_of_patch_example.cpp")
 create_single_source_cgal_program("tangential_relaxation_example.cpp")
 create_single_source_cgal_program("surface_mesh_intersection.cpp")
 create_single_source_cgal_program("corefinement_SM.cpp")
@@ -70,6 +69,12 @@ if(TARGET CGAL::Eigen3_support)
   target_link_libraries(hole_filling_example_LCC PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("mesh_smoothing_example.cpp")
   target_link_libraries(mesh_smoothing_example PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("isotropic_remeshing_example.cpp")
+  target_link_libraries(isotropic_remeshing_example PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("isotropic_remeshing_of_patch_example.cpp")
+  target_link_libraries(isotropic_remeshing_of_patch_example PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("isotropic_remeshing_with_sizing_example.cpp")
+  target_link_libraries(isotropic_remeshing_with_sizing_example PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("delaunay_remeshing_example.cpp")
   target_link_libraries(delaunay_remeshing_example PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("remesh_almost_planar_patches.cpp")
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index 1e1335ccfa6d..fd27430e056d 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -11,7 +11,9 @@ namespace PMP = CGAL::Polygon_mesh_processing;
 
 int main(int argc, char* argv[])
 {
-  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/pig.off");
+//  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/pig.off");
+//  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/hand.off");
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/nefertiti.off");
   std::ifstream input(filename);
 
   Mesh mesh;
@@ -20,16 +22,17 @@ int main(int argc, char* argv[])
     return 1;
   }
 
-  //todo ip - update
-  const std::pair<double, double> edge_min_max{0.1, 0.12};
-  unsigned int nb_iter = 3;
-
   std::cout << "Start remeshing of " << filename
     << " (" << num_faces(mesh) << " faces)..." << std::endl;
 
+  const double tol = 0.002;
+  const std::pair<double, double> edge_min_max{0.001, 0.5};
+  PMP::Adaptive_sizing_field<Mesh> sizing_field(tol, edge_min_max, mesh);
+  unsigned int nb_iter = 3;
+
   PMP::isotropic_remeshing(
       faces(mesh),
-      edge_min_max,
+      sizing_field,
       mesh,
       PMP::parameters::number_of_iterations(nb_iter)
       );
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 1293577ad4f8..5724d26ba0df 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -17,6 +17,8 @@
 
 #include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h>
 
+#include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
+
 #include <CGAL/number_utils.h>
 
 namespace CGAL
@@ -30,26 +32,37 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   typedef CGAL::Sizing_field<PolygonMesh> Base;
 
 public:
+  typedef typename Base::K          K;
   typedef typename Base::FT         FT;
   typedef typename Base::Point_3    Point_3;
   typedef typename Base::halfedge_descriptor halfedge_descriptor;
   typedef typename Base::vertex_descriptor   vertex_descriptor;
-  typedef typename CGAL::dynamic_vertex_property_t<FT>            Vertex_property_tag;
+
+  typedef typename CGAL::dynamic_vertex_property_t<FT> Vertex_property_tag;
   typedef typename boost::property_map<PolygonMesh,
                                        Vertex_property_tag>::type VertexSizingMap;
 
-    Adaptive_sizing_field(const std::pair<FT, FT>& edge_len_min_max
+  //todo ip: set a property map that can calculate curvature in one go. I think I'm generating constant maps (without put)
+  // try 1
+  typedef Principal_curvatures_and_directions<K> Principal_curvatures;
+//  typedef Constant_property_map<vertex_descriptor, Principal_curvatures> Vertex_curvature_map;
+
+  // try 2
+  typedef Constant_property_map<vertex_descriptor, Principal_curvatures_and_directions<K>> Default_principal_map;
+  typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvatures_and_directions_map_t,
+                                                       parameters::Default_named_parameters,
+                                                       Default_principal_map>::type
+                                                         Vertex_curvature_map;
+
+    Adaptive_sizing_field(const double tol
+                        , const std::pair<FT, FT>& edge_len_min_max
                         , PolygonMesh& pmesh)
-    : m_sq_short( CGAL::square(edge_len_min_max.first))
-    , m_sq_long(  CGAL::square(edge_len_min_max.second))
+    : tol(tol)
+    , m_sq_short(CGAL::square(edge_len_min_max.first))
+    , m_sq_long( CGAL::square(edge_len_min_max.second))
     , m_pmesh(pmesh)
   {
-      //todo ip: initialize sizing map with default values
-      //todo ip: might end up using directly the property map of the curvature calculation (if mutable)?
-      vertex_sizing_map_ = get(Vertex_property_tag(), m_pmesh);
-      for(vertex_descriptor v : vertices(m_pmesh)){
-          put(vertex_sizing_map_, v, m_sq_long);
-      }
+    m_vertex_sizing_map = get(Vertex_property_tag(), m_pmesh);
   }
 
 private:
@@ -69,21 +82,62 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
 public:
   void calc_sizing_map()
   {
-      //todo ip
-      // calculate curvature
-
-      // loop over curvature property field and calculate the target mesh size for a vertex
-      // don't forget to store squared length
-
+#ifdef CGAL_PMP_REMESHING_VERBOSE
+    int oversize  = 0;
+    int undersize = 0;
+    int insize    = 0;
+    std::cout << "Calculating sizing field..." << std::endl;
+#endif
+
+    //todo ip: how to make this work?
+//    Vertex_curvature_map vertex_curvature_map;
+//    interpolated_corrected_principal_curvatures_and_directions(m_pmesh
+//                                                               , vertex_curvature_map);
+
+    // calculate square vertex sizing field (L(x_i))^2 from curvature field
+    for(vertex_descriptor v : vertices(m_pmesh))
+    {
+//      auto vertex_curv = get(vertex_curvature_map, v); //todo ip: how to make this work?
+      //todo ip: temp solution
+      const Principal_curvatures vertex_curv = interpolated_corrected_principal_curvatures_and_directions_one_vertex(m_pmesh, v);
+      const FT max_absolute_curv = std::max(std::abs(vertex_curv.max_curvature), std::abs(vertex_curv.min_curvature));
+      const FT vertex_size_sq = 6 * tol / max_absolute_curv - 3 * CGAL::square(tol);
+      if (vertex_size_sq > m_sq_long)
+      {
+        put(m_vertex_sizing_map, v, m_sq_long);
+#ifdef CGAL_PMP_REMESHING_VERBOSE
+        ++oversize;
+#endif
+      }
+      else if (vertex_size_sq < m_sq_short)
+      {
+        put(m_vertex_sizing_map, v, m_sq_short);
+#ifdef CGAL_PMP_REMESHING_VERBOSE
+        ++undersize;
+#endif
+      }
+      else
+      {
+        put(m_vertex_sizing_map, v, vertex_size_sq);
+#ifdef CGAL_PMP_REMESHING_VERBOSE
+        ++insize;
+#endif
+      }
+    }
+#ifdef CGAL_PMP_REMESHING_VERBOSE
+    std::cout << " done (" << insize    << " from curvature, "
+                          << oversize  << " set to max, "
+                          << undersize << " set to min)" << std::endl;
+#endif
   }
 
   boost::optional<FT> is_too_long(const halfedge_descriptor& h) const
   {
     const FT sqlen = sqlength(h);
-    FT sqtarg_len = std::min(get(vertex_sizing_map_, source(h, m_pmesh)),
-                             get(vertex_sizing_map_, target(h, m_pmesh)));
-    CGAL_assertion(get(vertex_sizing_map_, source(h, m_pmesh)));
-    CGAL_assertion(get(vertex_sizing_map_, target(h, m_pmesh)));
+    FT sqtarg_len = std::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
+                             get(m_vertex_sizing_map, target(h, m_pmesh)));
+    CGAL_assertion(get(m_vertex_sizing_map, source(h, m_pmesh)));
+    CGAL_assertion(get(m_vertex_sizing_map, target(h, m_pmesh)));
     if(sqlen > sqtarg_len)
       return sqlen;
     else
@@ -94,11 +148,11 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                                   const vertex_descriptor& vb) const
   {
     const FT sqlen = sqlength(va, vb);
-    FT sqtarg_len = std::min(get(vertex_sizing_map_, va),
-                             get(vertex_sizing_map_, vb));
-    CGAL_assertion(get(vertex_sizing_map_, va));
-    CGAL_assertion(get(vertex_sizing_map_, vb));
-    if (sqlen > sqtarg_len)
+    FT sqtarg_len = std::min(get(m_vertex_sizing_map, va),
+                             get(m_vertex_sizing_map, vb));
+    CGAL_assertion(get(m_vertex_sizing_map, va));
+    CGAL_assertion(get(m_vertex_sizing_map, vb));
+    if (sqlen > 16./9. * sqtarg_len)
       return sqlen;
     else
       return boost::none;
@@ -107,11 +161,11 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   boost::optional<FT> is_too_short(const halfedge_descriptor& h) const
   {
     const FT sqlen = sqlength(h);
-    FT sqtarg_len = std::min(get(vertex_sizing_map_, source(h, m_pmesh)),
-                             get(vertex_sizing_map_, target(h, m_pmesh)));
-    CGAL_assertion(get(vertex_sizing_map_, source(h, m_pmesh)));
-    CGAL_assertion(get(vertex_sizing_map_, target(h, m_pmesh)));
-    if (sqlen < sqtarg_len)
+    FT sqtarg_len = std::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
+                             get(m_vertex_sizing_map, target(h, m_pmesh)));
+    CGAL_assertion(get(m_vertex_sizing_map, source(h, m_pmesh)));
+    CGAL_assertion(get(m_vertex_sizing_map, target(h, m_pmesh)));
+    if (sqlen < 16./25. * sqtarg_len)
       return sqlen;
     else
       return boost::none;
@@ -125,18 +179,31 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                           get(vpmap, source(h, m_pmesh)));
   }
 
-  void update_sizing_map(const vertex_descriptor& vnew)
+  void update_sizing_map(const vertex_descriptor& v)
   {
-    //todo ip: calculate curvature for the vertex
-    //dummy
-    put(vertex_sizing_map_, vnew, m_sq_short);
+    // calculating it as the average of two vertices on other ends
+    // of halfedges as updating is done during an edge split
+    int i = 0;
+    FT vertex_size_sq = 0;
+    CGAL_assertion(CGAL::halfedges_around_target(v, m_pmesh) == 2);
+    for (halfedge_descriptor ha: CGAL::halfedges_around_target(v, m_pmesh))
+    {
+      vertex_size_sq += get(m_vertex_sizing_map, source(ha, m_pmesh));
+      ++i;
+    }
+    vertex_size_sq /= i;
+
+    put(m_vertex_sizing_map, v, vertex_size_sq);
   }
 
+  //todo ip: is_protected_constraint_too_long() from PR
+
 private:
-  FT m_sq_short;
-  FT m_sq_long;
+  const FT tol;
+  const FT m_sq_short;
+  const FT m_sq_long;
   PolygonMesh& m_pmesh;
-  VertexSizingMap vertex_sizing_map_;
+  VertexSizingMap m_vertex_sizing_map;
 };
 
 }//end namespace Polygon_mesh_processing
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
index fc6b14a984f5..7f1a8a2abbea 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
@@ -30,9 +30,9 @@ class Sizing_field
   typedef PolygonMesh                     PM;
   typedef typename boost::property_map<PM, boost::vertex_point_t>::const_type VPMap;
   typedef typename boost::property_traits<VPMap>::value_type Point;
-  typedef typename CGAL::Kernel_traits<Point>::Kernel K;
 
 public:
+  typedef typename CGAL::Kernel_traits<Point>::Kernel K;
   typedef typename boost::graph_traits<PM>::halfedge_descriptor halfedge_descriptor;
   typedef typename boost::graph_traits<PM>::vertex_descriptor   vertex_descriptor;
   typedef Point                                                 Point_3;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
index fbb522b7c787..ce523b30a8a9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
@@ -56,6 +56,10 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   }
 
 public:
+  //todo ip: rewrite to remove this?
+  void calc_sizing_map() const {}
+  void update_sizing_map(const vertex_descriptor& vnew) const {}
+
   boost::optional<FT> is_too_long(const halfedge_descriptor& h) const
   {
     const FT sqlen = sqlength(h);
@@ -92,7 +96,6 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                           get(vpmap, source(h, m_pmesh)));
   }
 
-  void update_sizing_map(const vertex_descriptor& vnew) const {} //todo ip- rewrite to remove this?
 
 private:
   FT m_sq_short;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 19651ded9ae5..20647a91cb77 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -55,6 +55,9 @@
 #include <unordered_map>
 #include <unordered_set>
 
+//todo ip: temp
+#define CGAL_PMP_REMESHING_VERBOSE
+
 #ifdef CGAL_PMP_REMESHING_DEBUG
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
 #define CGAL_DUMP_REMESHING_STEPS
@@ -536,8 +539,6 @@ namespace internal {
         //move refinement point
         vertex_descriptor vnew = target(hnew, mesh_);
         put(vpmap_, vnew, refinement_point);
-        //todo ip-add
-        sizing.update_sizing_map(vnew);
 #ifdef CGAL_PMP_REMESHING_VERY_VERBOSE
         std::cout << "   Refinement point : " << refinement_point << std::endl;
 #endif
@@ -547,6 +548,9 @@ namespace internal {
         halfedge_added(hnew, status(he));
         halfedge_added(hnew_opp, status(opposite(he, mesh_)));
 
+        //todo ip-add: already updating sizing here because of is_too_long checks below
+        sizing.update_sizing_map(vnew);
+
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
         boost::optional<double> sqlen_new = sizing.is_too_long(hnew);
@@ -2014,7 +2018,6 @@ namespace internal {
     VertexIsConstrainedMap vcmap_;
     FaceIndexMap fimap_;
     CGAL_assertion_code(bool input_mesh_is_valid_;)
-    //todo ip: maybe make sizing field member (reference) here? easier to handle updates
 
   };//end class Incremental_remesher
 }//end namespace internal
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 858f34958109..33f382ac4639 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -212,18 +212,22 @@ void isotropic_remeshing(const FaceRange& faces
                        , const NamedParameters& np = parameters::default_values())
 {
   typedef Uniform_sizing_field<PolygonMesh> Default_sizing;
+  Default_sizing sizing(target_edge_length, pmesh);
   isotropic_remeshing<PolygonMesh, FaceRange, Default_sizing, NamedParameters>(
     faces,
-    Default_sizing(target_edge_length, pmesh),
+    sizing,
     pmesh,
     np);
 }
 
+//todo ip: should I have the overload here?
+/*
 template<typename PolygonMesh
         , typename FaceRange
         , typename NamedParameters = parameters::Default_named_parameters>
 void isotropic_remeshing(const FaceRange& faces
-                       , const std::pair<double, double>& edge_len_min_max //todo add defaults?
+                       , const double& tol
+                       , const std::pair<double, double>& edge_len_min_max
                        , PolygonMesh& pmesh
                        , const NamedParameters& np = parameters::default_values())
 {
@@ -235,6 +239,7 @@ void isotropic_remeshing(const FaceRange& faces
           pmesh,
           np);
 }
+ */
 
 template<typename PolygonMesh
        , typename FaceRange
@@ -356,6 +361,7 @@ void isotropic_remeshing(const FaceRange& faces
     std::cout << " * Iteration " << (i + 1) << " *" << std::endl;
 #endif
 
+    sizing.calc_sizing_map();
     if(do_split)
      remesher.split_long_edges(sizing);
     if(do_collapse)

From fd787c4530d6f114f7a30a1a8021a4334e373c73 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Wed, 24 May 2023 20:10:00 +0200
Subject: [PATCH 0546/1398] Refactor sizing map update

---
 .../internal/Isotropic_remeshing/Adaptive_sizing_field.h      | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 5724d26ba0df..64ac1ddf5613 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -183,15 +183,13 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   {
     // calculating it as the average of two vertices on other ends
     // of halfedges as updating is done during an edge split
-    int i = 0;
     FT vertex_size_sq = 0;
     CGAL_assertion(CGAL::halfedges_around_target(v, m_pmesh) == 2);
     for (halfedge_descriptor ha: CGAL::halfedges_around_target(v, m_pmesh))
     {
       vertex_size_sq += get(m_vertex_sizing_map, source(ha, m_pmesh));
-      ++i;
     }
-    vertex_size_sq /= i;
+    vertex_size_sq /= CGAL::halfedges_around_target(v, m_pmesh).size();
 
     put(m_vertex_sizing_map, v, vertex_size_sq);
   }

From 52df5ae86eeddea3ae0a08fa79bce3afb668c64c Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 26 May 2023 11:03:27 +0200
Subject: [PATCH 0547/1398] Fix default remeshing overload

---
 .../include/CGAL/Polygon_mesh_processing/remesh.h           | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 33f382ac4639..2c31cf4c65f6 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -207,7 +207,7 @@ template<typename PolygonMesh
        , typename FaceRange
        , typename NamedParameters = parameters::Default_named_parameters>
 void isotropic_remeshing(const FaceRange& faces
-                       , const double& target_edge_length
+                       , const double target_edge_length
                        , PolygonMesh& pmesh
                        , const NamedParameters& np = parameters::default_values())
 {
@@ -355,13 +355,15 @@ void isotropic_remeshing(const FaceRange& faces
   t.reset(); t.start();
 #endif
 
+//      sizing.calc_sizing_map();
   for (unsigned int i = 0; i < nb_iterations; ++i)
   {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
     std::cout << " * Iteration " << (i + 1) << " *" << std::endl;
 #endif
 
-    sizing.calc_sizing_map();
+    if (i < 2)
+      sizing.calc_sizing_map();
     if(do_split)
      remesher.split_long_edges(sizing);
     if(do_collapse)

From 947ab8f1255d7bedea2adb6be919f23f95f3fd7b Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 26 May 2023 18:20:11 +0200
Subject: [PATCH 0548/1398] Make a (temp) property map for curvature
 calculation

---
 .../isotropic_remeshing_with_sizing_example.cpp    |  7 ++++---
 .../Isotropic_remeshing/Adaptive_sizing_field.h    | 14 +++++++++-----
 2 files changed, 13 insertions(+), 8 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index fd27430e056d..cfbf7bfd9c77 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -11,9 +11,10 @@ namespace PMP = CGAL::Polygon_mesh_processing;
 
 int main(int argc, char* argv[])
 {
-//  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/pig.off");
+//  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/lion-head.off");
 //  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/hand.off");
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/nefertiti.off");
+//  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/cube.off");
   std::ifstream input(filename);
 
   Mesh mesh;
@@ -25,10 +26,10 @@ int main(int argc, char* argv[])
   std::cout << "Start remeshing of " << filename
     << " (" << num_faces(mesh) << " faces)..." << std::endl;
 
-  const double tol = 0.002;
+  const double tol = 0.001;
   const std::pair<double, double> edge_min_max{0.001, 0.5};
   PMP::Adaptive_sizing_field<Mesh> sizing_field(tol, edge_min_max, mesh);
-  unsigned int nb_iter = 3;
+  unsigned int nb_iter = 5;
 
   PMP::isotropic_remeshing(
       faces(mesh),
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 64ac1ddf5613..1cbaf0bce8df 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -91,15 +91,19 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
 
     //todo ip: how to make this work?
 //    Vertex_curvature_map vertex_curvature_map;
-//    interpolated_corrected_principal_curvatures_and_directions(m_pmesh
-//                                                               , vertex_curvature_map);
+
+    //todo ip: temp workaround
+    auto vertex_curvature_map =
+      m_pmesh.template add_property_map<vertex_descriptor,Principal_curvatures_and_directions<K>>("v:curvature_map").first;
+    interpolated_corrected_principal_curvatures_and_directions(m_pmesh
+                                                               , vertex_curvature_map);
 
     // calculate square vertex sizing field (L(x_i))^2 from curvature field
     for(vertex_descriptor v : vertices(m_pmesh))
     {
-//      auto vertex_curv = get(vertex_curvature_map, v); //todo ip: how to make this work?
-      //todo ip: temp solution
-      const Principal_curvatures vertex_curv = interpolated_corrected_principal_curvatures_and_directions_one_vertex(m_pmesh, v);
+      auto vertex_curv = get(vertex_curvature_map, v); //todo ip: how to make this work?
+      //todo ip: alt solution - calculate curvature per vertex
+//      const Principal_curvatures vertex_curv = interpolated_corrected_principal_curvatures_and_directions_one_vertex(m_pmesh, v);
       const FT max_absolute_curv = std::max(std::abs(vertex_curv.max_curvature), std::abs(vertex_curv.min_curvature));
       const FT vertex_size_sq = 6 * tol / max_absolute_curv - 3 * CGAL::square(tol);
       if (vertex_size_sq > m_sq_long)

From c89bedb97faac6a194086ced0d3cdb063403b913 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Wed, 31 May 2023 22:26:23 +0200
Subject: [PATCH 0549/1398] Replace std with cgal where applicable, fix
 assertion

---
 .../Adaptive_sizing_field.h                    | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 1cbaf0bce8df..9027fa0e40f3 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -101,10 +101,10 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     // calculate square vertex sizing field (L(x_i))^2 from curvature field
     for(vertex_descriptor v : vertices(m_pmesh))
     {
-      auto vertex_curv = get(vertex_curvature_map, v); //todo ip: how to make this work?
+      auto vertex_curv = get(vertex_curvature_map, v);
       //todo ip: alt solution - calculate curvature per vertex
 //      const Principal_curvatures vertex_curv = interpolated_corrected_principal_curvatures_and_directions_one_vertex(m_pmesh, v);
-      const FT max_absolute_curv = std::max(std::abs(vertex_curv.max_curvature), std::abs(vertex_curv.min_curvature));
+      const FT max_absolute_curv = CGAL::max(CGAL::abs(vertex_curv.max_curvature), CGAL::abs(vertex_curv.min_curvature));
       const FT vertex_size_sq = 6 * tol / max_absolute_curv - 3 * CGAL::square(tol);
       if (vertex_size_sq > m_sq_long)
       {
@@ -138,8 +138,8 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   boost::optional<FT> is_too_long(const halfedge_descriptor& h) const
   {
     const FT sqlen = sqlength(h);
-    FT sqtarg_len = std::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
-                             get(m_vertex_sizing_map, target(h, m_pmesh)));
+    FT sqtarg_len = CGAL::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
+                              get(m_vertex_sizing_map, target(h, m_pmesh)));
     CGAL_assertion(get(m_vertex_sizing_map, source(h, m_pmesh)));
     CGAL_assertion(get(m_vertex_sizing_map, target(h, m_pmesh)));
     if(sqlen > sqtarg_len)
@@ -152,8 +152,8 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                                   const vertex_descriptor& vb) const
   {
     const FT sqlen = sqlength(va, vb);
-    FT sqtarg_len = std::min(get(m_vertex_sizing_map, va),
-                             get(m_vertex_sizing_map, vb));
+    FT sqtarg_len = CGAL::min(get(m_vertex_sizing_map, va),
+                              get(m_vertex_sizing_map, vb));
     CGAL_assertion(get(m_vertex_sizing_map, va));
     CGAL_assertion(get(m_vertex_sizing_map, vb));
     if (sqlen > 16./9. * sqtarg_len)
@@ -165,8 +165,8 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   boost::optional<FT> is_too_short(const halfedge_descriptor& h) const
   {
     const FT sqlen = sqlength(h);
-    FT sqtarg_len = std::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
-                             get(m_vertex_sizing_map, target(h, m_pmesh)));
+    FT sqtarg_len = CGAL::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
+                              get(m_vertex_sizing_map, target(h, m_pmesh)));
     CGAL_assertion(get(m_vertex_sizing_map, source(h, m_pmesh)));
     CGAL_assertion(get(m_vertex_sizing_map, target(h, m_pmesh)));
     if (sqlen < 16./25. * sqtarg_len)
@@ -188,7 +188,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     // calculating it as the average of two vertices on other ends
     // of halfedges as updating is done during an edge split
     FT vertex_size_sq = 0;
-    CGAL_assertion(CGAL::halfedges_around_target(v, m_pmesh) == 2);
+    CGAL_assertion(CGAL::halfedges_around_target(v, m_pmesh).size() == 2);
     for (halfedge_descriptor ha: CGAL::halfedges_around_target(v, m_pmesh))
     {
       vertex_size_sq += get(m_vertex_sizing_map, source(ha, m_pmesh));

From fa9769b908026cd63c4801ba34fb73b8d2f055c7 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Thu, 8 Jun 2023 23:08:40 +0200
Subject: [PATCH 0550/1398] Prep sizing for tangential relaxation (WIP)

---
 .../Isotropic_remeshing/remesh_impl.h         |  18 +-
 .../CGAL/Polygon_mesh_processing/remesh.h     |   8 +-
 .../tangential_relaxation.h                   | 210 ++++++++++++++++++
 3 files changed, 231 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 20647a91cb77..6b2fa17bb0b9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -1012,8 +1012,10 @@ namespace internal {
     // "applies an iterative smoothing filter to the mesh.
     // The vertex movement has to be constrained to the vertex tangent plane [...]
     // smoothing algorithm with uniform Laplacian weights"
+    template <typename SizingFunction>
     void tangential_relaxation_impl(const bool relax_constraints/*1d smoothing*/
-                                   , const unsigned int nb_iterations)
+                                  , const unsigned int nb_iterations
+                                  , const SizingFunction& sizing)
     {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
       std::cout << "Tangential relaxation (" << nb_iterations << " iter.)...";
@@ -1044,6 +1046,8 @@ namespace internal {
       auto constrained_vertices_pmap
         = boost::make_function_property_map<vertex_descriptor>(vertex_constraint);
 
+      //todo IP temp: I have to rewrite to include original implementation
+      /*
       tangential_relaxation(
         vertices(mesh_),
         mesh_,
@@ -1054,6 +1058,18 @@ namespace internal {
                          .vertex_is_constrained_map(constrained_vertices_pmap)
                          .relax_constraints(relax_constraints)
       );
+       */
+      tangential_relaxation(
+        vertices(mesh_),
+        mesh_,
+        sizing,
+        CGAL::parameters::number_of_iterations(nb_iterations)
+          .vertex_point_map(vpmap_)
+          .geom_traits(gt_)
+          .edge_is_constrained_map(constrained_edges_pmap)
+          .vertex_is_constrained_map(constrained_vertices_pmap)
+          .relax_constraints(relax_constraints)
+      );
 
       CGAL_assertion(!input_mesh_is_valid_ || is_valid_polygon_mesh(mesh_));
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 2c31cf4c65f6..4f5162482c29 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -355,22 +355,22 @@ void isotropic_remeshing(const FaceRange& faces
   t.reset(); t.start();
 #endif
 
-//      sizing.calc_sizing_map();
+      sizing.calc_sizing_map();
   for (unsigned int i = 0; i < nb_iterations; ++i)
   {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
     std::cout << " * Iteration " << (i + 1) << " *" << std::endl;
 #endif
 
-    if (i < 2)
-      sizing.calc_sizing_map();
+//    if (i < 2)
+//      sizing.calc_sizing_map();
     if(do_split)
      remesher.split_long_edges(sizing);
     if(do_collapse)
      remesher.collapse_short_edges(sizing, collapse_constraints);
     if(do_flip)
       remesher.flip_edges_for_valence_and_shape();
-    remesher.tangential_relaxation_impl(smoothing_1d, nb_laplacian);
+    remesher.tangential_relaxation_impl(smoothing_1d, nb_laplacian, sizing);
     if ( choose_parameter(get_parameter(np, internal_np::do_project), true) )
       remesher.project_to_surface(get_parameter(np, internal_np::projection_functor));
 #ifdef CGAL_PMP_REMESHING_VERBOSE
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index d14e513d347a..19ebdda8650e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -317,6 +317,208 @@ void tangential_relaxation(const VertexRange& vertices,
 #endif
 }
 
+template <typename VertexRange
+        , class TriangleMesh
+        , typename SizingFunction
+        , class NamedParameters = parameters::Default_named_parameters>
+void tangential_relaxation(const VertexRange& vertices,
+  TriangleMesh& tm,
+  const SizingFunction& sizing,
+  const NamedParameters& np = parameters::default_values())
+{
+  typedef typename boost::graph_traits<TriangleMesh>::vertex_descriptor vertex_descriptor;
+  typedef typename boost::graph_traits<TriangleMesh>::halfedge_descriptor halfedge_descriptor;
+  typedef typename boost::graph_traits<TriangleMesh>::edge_descriptor edge_descriptor;
+
+  using parameters::get_parameter;
+  using parameters::choose_parameter;
+
+  typedef typename GetGeomTraits<TriangleMesh, NamedParameters>::type GT;
+  GT gt = choose_parameter(get_parameter(np, internal_np::geom_traits), GT());
+
+  typedef typename GetVertexPointMap<TriangleMesh, NamedParameters>::type VPMap;
+  VPMap vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
+    get_property_map(vertex_point, tm));
+
+  typedef Static_boolean_property_map<edge_descriptor, false> Default_ECM;
+  typedef typename internal_np::Lookup_named_param_def <
+    internal_np::edge_is_constrained_t,
+    NamedParameters,
+    Static_boolean_property_map<edge_descriptor, false> // default (no constraint)
+  > ::type ECM;
+  ECM ecm = choose_parameter(get_parameter(np, internal_np::edge_is_constrained),
+    Default_ECM());
+
+  typedef typename internal_np::Lookup_named_param_def <
+    internal_np::vertex_is_constrained_t,
+    NamedParameters,
+    Static_boolean_property_map<vertex_descriptor, false> // default (no constraint)
+  > ::type VCM;
+  VCM vcm = choose_parameter(get_parameter(np, internal_np::vertex_is_constrained),
+    Static_boolean_property_map<vertex_descriptor, false>());
+
+  const bool relax_constraints = choose_parameter(get_parameter(np, internal_np::relax_constraints), false);
+  const unsigned int nb_iterations = choose_parameter(get_parameter(np, internal_np::number_of_iterations), 1);
+
+  typedef typename GT::Vector_3 Vector_3;
+  typedef typename GT::Point_3 Point_3;
+
+  auto check_normals = [&](vertex_descriptor v)
+  {
+    bool first_run = true;
+    Vector_3 prev = NULL_VECTOR, first = NULL_VECTOR;
+    halfedge_descriptor first_h = boost::graph_traits<TriangleMesh>::null_halfedge();
+    for (halfedge_descriptor hd : CGAL::halfedges_around_target(v, tm))
+    {
+      if (is_border(hd, tm)) continue;
+
+      Vector_3 n = compute_face_normal(face(hd, tm), tm, np);
+      if (n == CGAL::NULL_VECTOR) //for degenerate faces
+        continue;
+
+      if (first_run)
+      {
+        first_run = false;
+        first = n;
+        first_h = hd;
+      }
+      else
+      {
+        if (!get(ecm, edge(hd, tm)))
+          if (to_double(n * prev) <= 0)
+            return false;
+      }
+      prev = n;
+    }
+
+    if (first_run)
+      return true; //vertex incident only to degenerate faces
+
+    if (!get(ecm, edge(first_h, tm)))
+      if (to_double(first * prev) <= 0)
+        return false;
+
+    return true;
+  };
+
+  typedef typename internal_np::Lookup_named_param_def <
+    internal_np::allow_move_functor_t,
+    NamedParameters,
+    internal::Allow_all_moves// default
+  > ::type Shall_move;
+  Shall_move shall_move = choose_parameter(get_parameter(np, internal_np::allow_move_functor),
+    internal::Allow_all_moves());
+
+  for (unsigned int nit = 0; nit < nb_iterations; ++nit)
+  {
+#ifdef CGAL_PMP_TANGENTIAL_RELAXATION_VERBOSE
+    std::cout << "\r\t(Tangential relaxation iteration " << (nit + 1) << " / ";
+    std::cout << nb_iterations << ") ";
+    std::cout.flush();
+#endif
+
+    typedef std::tuple<vertex_descriptor, Vector_3, Point_3> VNP;
+    std::vector< VNP > barycenters;
+    auto gt_barycenter = gt.construct_barycenter_3_object();
+
+    // at each vertex, compute vertex normal
+    std::unordered_map<vertex_descriptor, Vector_3> vnormals;
+    compute_vertex_normals(tm, boost::make_assoc_property_map(vnormals), np);
+
+    // at each vertex, compute barycenter of neighbors
+    for(vertex_descriptor v : vertices)
+    {
+      if (get(vcm, v) || CGAL::internal::is_isolated(v, tm))
+        continue;
+
+      // collect hedges to detect if we have to handle boundary cases
+      std::vector<halfedge_descriptor> interior_hedges, border_halfedges;
+      for(halfedge_descriptor h : halfedges_around_target(v, tm))
+      {
+        if (is_border_edge(h, tm) || get(ecm, edge(h, tm)))
+          border_halfedges.push_back(h);
+        else
+          interior_hedges.push_back(h);
+      }
+
+      if (border_halfedges.empty())
+      {
+        const Vector_3& vn = vnormals.at(v);
+        Vector_3 move = CGAL::NULL_VECTOR;
+        unsigned int star_size = 0;
+        for(halfedge_descriptor h :interior_hedges)
+        {
+          move = move + Vector_3(get(vpm, v), get(vpm, source(h, tm)));
+          ++star_size;
+        }
+        CGAL_assertion(star_size > 0); //isolated vertices have already been discarded
+        move = (1. / static_cast<double>(star_size)) * move;
+
+        barycenters.emplace_back(v, vn, get(vpm, v) + move);
+      }
+      else
+      {
+        if (!relax_constraints) continue;
+        Vector_3 vn(NULL_VECTOR);
+
+        if (border_halfedges.size() == 2)// corners are constrained
+        {
+          vertex_descriptor ph0 = source(border_halfedges[0], tm);
+          vertex_descriptor ph1 = source(border_halfedges[1], tm);
+          double dot = to_double(Vector_3(get(vpm, v), get(vpm, ph0))
+                                 * Vector_3(get(vpm, v), get(vpm, ph1)));
+          // \todo shouldn't it be an input parameter?
+          //check squared cosine is < 0.25 (~120 degrees)
+          if (0.25 < dot*dot / ( squared_distance(get(vpm,ph0), get(vpm, v)) *
+                                 squared_distance(get(vpm,ph1), get(vpm, v))) )
+            barycenters.emplace_back(v, vn,
+              gt_barycenter(get(vpm, ph0), 0.25, get(vpm, ph1), 0.25, get(vpm, v), 0.5));
+        }
+      }
+    }
+
+    // compute moves
+    typedef std::pair<vertex_descriptor, Point_3> VP_pair;
+    std::vector< std::pair<vertex_descriptor, Point_3> > new_locations;
+    new_locations.reserve(barycenters.size());
+    for(const VNP& vnp : barycenters)
+    {
+      vertex_descriptor v = std::get<0>(vnp);
+      const Point_3& pv = get(vpm, v);
+      const Vector_3& nv = std::get<1>(vnp);
+      const Point_3& qv = std::get<2>(vnp); //barycenter at v
+
+      new_locations.emplace_back(v, qv + (nv * Vector_3(qv, pv)) * nv);
+    }
+
+    // perform moves
+    for(const VP_pair& vp : new_locations)
+    {
+      const Point_3 initial_pos = get(vpm, vp.first); // make a copy on purpose
+      const Vector_3 move(initial_pos, vp.second);
+
+      put(vpm, vp.first, vp.second);
+
+      //check that no inversion happened
+      double frac = 1.;
+      while (frac > 0.03 //5 attempts maximum
+             && (   !check_normals(vp.first)
+                    || !shall_move(vp.first, initial_pos, get(vpm, vp.first)))) //if a face has been inverted
+      {
+        frac = 0.5 * frac;
+        put(vpm, vp.first, initial_pos + frac * move);//shorten the move by 2
+      }
+      if (frac <= 0.02)
+        put(vpm, vp.first, initial_pos);//cancel move
+    }
+  }//end for loop (nit == nb_iterations)
+
+#ifdef CGAL_PMP_TANGENTIAL_RELAXATION_VERBOSE
+  std::cout << "\rTangential relaxation : "
+    << nb_iterations << " iterations done." << std::endl;
+#endif
+}
+
 /*!
 * \ingroup PMP_meshing_grp
 * applies `tangential_relaxation()` to all the vertices of `tm`.
@@ -328,6 +530,14 @@ void tangential_relaxation(TriangleMesh& tm, const CGAL_NP_CLASS& np = parameter
   tangential_relaxation(vertices(tm), tm, np);
 }
 
+template <class TriangleMesh
+        , typename SizingFunction
+        , typename CGAL_NP_TEMPLATE_PARAMETERS>
+void tangential_relaxation(TriangleMesh& tm, const SizingFunction& sizing, const CGAL_NP_CLASS& np = parameters::default_values())
+{
+  tangential_relaxation(vertices(tm), tm, sizing, np);
+}
+
 } } // CGAL::Polygon_mesh_processing
 
 #endif //CGAL_POLYGON_MESH_PROCESSING_TANGENTIAL_RELAXATION_H

From 5629f7a04b642c2ca2ddfcc80aa1540088ab5232 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 13 Jun 2023 00:14:23 +0200
Subject: [PATCH 0551/1398] Add first code for tangential relaxation with
 sizing (WIP)

---
 .../Adaptive_sizing_field.h                   |  5 ++
 .../Isotropic_remeshing/remesh_impl.h         | 10 ++--
 .../CGAL/Polygon_mesh_processing/remesh.h     |  1 +
 .../tangential_relaxation.h                   | 46 +++++++++++++++----
 4 files changed, 49 insertions(+), 13 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 9027fa0e40f3..d49ca57c8dce 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -80,6 +80,11 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   }
 
 public:
+  FT get_sizing(const vertex_descriptor& v) const {
+      CGAL_assertion(get(m_vertex_sizing_map, v));
+      return get(m_vertex_sizing_map, v);
+    }
+
   void calc_sizing_map()
   {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 6b2fa17bb0b9..581b9870778c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -1046,8 +1046,9 @@ namespace internal {
       auto constrained_vertices_pmap
         = boost::make_function_property_map<vertex_descriptor>(vertex_constraint);
 
-      //todo IP temp: I have to rewrite to include original implementation
-      /*
+      //todo IP temp: I have to rewrite to include original implementation, hardcoded for now
+      const bool use_sizing = true;
+      if (!use_sizing)
       tangential_relaxation(
         vertices(mesh_),
         mesh_,
@@ -1058,8 +1059,9 @@ namespace internal {
                          .vertex_is_constrained_map(constrained_vertices_pmap)
                          .relax_constraints(relax_constraints)
       );
-       */
-      tangential_relaxation(
+
+      else
+      tangential_relaxation_with_sizing(
         vertices(mesh_),
         mesh_,
         sizing,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 4f5162482c29..975ff7bbf9b0 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -371,6 +371,7 @@ void isotropic_remeshing(const FaceRange& faces
     if(do_flip)
       remesher.flip_edges_for_valence_and_shape();
     remesher.tangential_relaxation_impl(smoothing_1d, nb_laplacian, sizing);
+//    remesher.tangential_relaxation_impl(smoothing_1d, nb_laplacian);
     if ( choose_parameter(get_parameter(np, internal_np::do_project), true) )
       remesher.project_to_surface(get_parameter(np, internal_np::projection_functor));
 #ifdef CGAL_PMP_REMESHING_VERBOSE
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index 19ebdda8650e..d4f5dd8157a5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -321,7 +321,7 @@ template <typename VertexRange
         , class TriangleMesh
         , typename SizingFunction
         , class NamedParameters = parameters::Default_named_parameters>
-void tangential_relaxation(const VertexRange& vertices,
+void tangential_relaxation_with_sizing(const VertexRange& vertices,
   TriangleMesh& tm,
   const SizingFunction& sizing,
   const NamedParameters& np = parameters::default_values())
@@ -363,6 +363,12 @@ void tangential_relaxation(const VertexRange& vertices,
   typedef typename GT::Vector_3 Vector_3;
   typedef typename GT::Point_3 Point_3;
 
+  //todo ip: alt calc
+  typename GT::Construct_vector_3 vector = gt.construct_vector_3_object();
+  typename GT::Compute_scalar_product_3 scalar_product = gt.compute_scalar_product_3_object();
+  typename GT::Compute_squared_length_3 squared_length = gt.compute_squared_length_3_object();
+  typename GT::Construct_cross_product_vector_3 cross_product = gt.construct_cross_product_vector_3_object();
+
   auto check_normals = [&](vertex_descriptor v)
   {
     bool first_run = true;
@@ -420,12 +426,15 @@ void tangential_relaxation(const VertexRange& vertices,
     typedef std::tuple<vertex_descriptor, Vector_3, Point_3> VNP;
     std::vector< VNP > barycenters;
     auto gt_barycenter = gt.construct_barycenter_3_object();
+    auto gt_centroid = gt.construct_centroid_3_object();
+    auto gt_area = gt.compute_area_3_object();
 
     // at each vertex, compute vertex normal
     std::unordered_map<vertex_descriptor, Vector_3> vnormals;
     compute_vertex_normals(tm, boost::make_assoc_property_map(vnormals), np);
 
-    // at each vertex, compute barycenter of neighbors
+    // at each vertex, compute centroids of neighbouring faces weighted by
+    // area and sizing field
     for(vertex_descriptor v : vertices)
     {
       if (get(vcm, v) || CGAL::internal::is_isolated(v, tm))
@@ -441,18 +450,37 @@ void tangential_relaxation(const VertexRange& vertices,
           interior_hedges.push_back(h);
       }
 
+      //todo ip: handle border edges with sizing field
       if (border_halfedges.empty())
       {
         const Vector_3& vn = vnormals.at(v);
         Vector_3 move = CGAL::NULL_VECTOR;
-        unsigned int star_size = 0;
+        double weight = 0;
+//        unsigned int star_size = 0;
         for(halfedge_descriptor h :interior_hedges)
         {
-          move = move + Vector_3(get(vpm, v), get(vpm, source(h, tm)));
-          ++star_size;
+          // calculate weight
+          // need v0, v1 and v2
+          const vertex_descriptor v1 = target(next(h, tm), tm);
+          const vertex_descriptor v2 = source(h, tm);
+
+          //todo ip- alt calc
+          const Vector_3 vec0 = vector(get(vpm, v), get(vpm, v1));
+          const Vector_3 vec1 = vector(get(vpm, v), get(vpm, v2));
+          const double sqarea = squared_length(cross_product(vec0, vec1));
+          const double face_weight = CGAL::approximate_sqrt(sqarea)
+                                     / pow(1. / 3. * (sizing.get_sizing(v) + sizing.get_sizing(v1) + sizing.get_sizing(v2)), 2);
+
+          //todo ip- paper implementation
+         // const double tri_area = gt_area(get(vpm, v), get(vpm, v1), get(vpm, v2));
+         // const double face_weight = tri_area
+         //                          / (1. / 3. * (sizing.get_sizing(v) + sizing.get_sizing(v1) + sizing.get_sizing(v2)));
+          weight += face_weight;
+
+          const Point_3 centroid = gt_centroid(get(vpm, v), get(vpm, v1), get(vpm, v2));
+          move = move + Vector_3(get(vpm, v), centroid) * face_weight;
         }
-        CGAL_assertion(star_size > 0); //isolated vertices have already been discarded
-        move = (1. / static_cast<double>(star_size)) * move;
+        move = move / weight; //todo ip: what if weight ends up being close to 0?
 
         barycenters.emplace_back(v, vn, get(vpm, v) + move);
       }
@@ -533,9 +561,9 @@ void tangential_relaxation(TriangleMesh& tm, const CGAL_NP_CLASS& np = parameter
 template <class TriangleMesh
         , typename SizingFunction
         , typename CGAL_NP_TEMPLATE_PARAMETERS>
-void tangential_relaxation(TriangleMesh& tm, const SizingFunction& sizing, const CGAL_NP_CLASS& np = parameters::default_values())
+void tangential_relaxation_with_sizing(TriangleMesh& tm, const SizingFunction& sizing, const CGAL_NP_CLASS& np = parameters::default_values())
 {
-  tangential_relaxation(vertices(tm), tm, sizing, np);
+  tangential_relaxation_with_sizing(vertices(tm), tm, sizing, np);
 }
 
 } } // CGAL::Polygon_mesh_processing

From cb779038f68d5622e564d8ba6dad5bb4a71e1b1d Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 13 Jun 2023 10:40:33 +0200
Subject: [PATCH 0552/1398] refs are not needed here

Co-authored-by: Sebastien Loriot <sloriot.ml@gmail.com>
---
 .../Adaptive_sizing_field.h                    | 18 +++++++++---------
 .../Isotropic_remeshing/Sizing_field.h         | 10 +++++-----
 .../Isotropic_remeshing/Uniform_sizing_field.h | 14 +++++++-------
 3 files changed, 21 insertions(+), 21 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index d49ca57c8dce..7c86e1420499 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -66,8 +66,8 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   }
 
 private:
-  FT sqlength(const vertex_descriptor& va,
-              const vertex_descriptor& vb) const
+  FT sqlength(const vertex_descriptor va,
+              const vertex_descriptor vb) const
   {
     typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
       vpmap = get(CGAL::vertex_point, m_pmesh);
@@ -80,7 +80,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   }
 
 public:
-  FT get_sizing(const vertex_descriptor& v) const {
+  FT get_sizing(const vertex_descriptor v) const {
       CGAL_assertion(get(m_vertex_sizing_map, v));
       return get(m_vertex_sizing_map, v);
     }
@@ -140,7 +140,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
 #endif
   }
 
-  boost::optional<FT> is_too_long(const halfedge_descriptor& h) const
+  boost::optional<FT> is_too_long(const halfedge_descriptor h) const
   {
     const FT sqlen = sqlength(h);
     FT sqtarg_len = CGAL::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
@@ -153,8 +153,8 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       return boost::none;
   }
 
-  boost::optional<FT> is_too_long(const vertex_descriptor& va,
-                                  const vertex_descriptor& vb) const
+  boost::optional<FT> is_too_long(const vertex_descriptor va,
+                                  const vertex_descriptor vb) const
   {
     const FT sqlen = sqlength(va, vb);
     FT sqtarg_len = CGAL::min(get(m_vertex_sizing_map, va),
@@ -167,7 +167,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       return boost::none;
   }
 
-  boost::optional<FT> is_too_short(const halfedge_descriptor& h) const
+  boost::optional<FT> is_too_short(const halfedge_descriptor h) const
   {
     const FT sqlen = sqlength(h);
     FT sqtarg_len = CGAL::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
@@ -180,7 +180,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       return boost::none;
   }
 
-  virtual Point_3 split_placement(const halfedge_descriptor& h) const
+  virtual Point_3 split_placement(const halfedge_descriptor h) const
   {
     typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
       vpmap = get(CGAL::vertex_point, m_pmesh);
@@ -188,7 +188,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                           get(vpmap, source(h, m_pmesh)));
   }
 
-  void update_sizing_map(const vertex_descriptor& v)
+  void update_sizing_map(const vertex_descriptor v)
   {
     // calculating it as the average of two vertices on other ends
     // of halfedges as updating is done during an edge split
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
index 7f1a8a2abbea..359a9fc6b562 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
@@ -39,11 +39,11 @@ class Sizing_field
   typedef typename K::FT                                        FT;
 
 public:
-  virtual boost::optional<FT> is_too_long(const halfedge_descriptor& h) const = 0;
-  virtual boost::optional<FT> is_too_long(const vertex_descriptor& va,
-                                          const vertex_descriptor& vb) const = 0;
-  virtual boost::optional<FT> is_too_short(const halfedge_descriptor& h) const = 0;
-  virtual Point_3 split_placement(const halfedge_descriptor& h) const = 0;
+  virtual boost::optional<FT> is_too_long(const halfedge_descriptor h) const = 0;
+  virtual boost::optional<FT> is_too_long(const vertex_descriptor va,
+                                          const vertex_descriptor vb) const = 0;
+  virtual boost::optional<FT> is_too_short(const halfedge_descriptor h) const = 0;
+  virtual Point_3 split_placement(const halfedge_descriptor h) const = 0;
 
 };
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
index ce523b30a8a9..cc229583b384 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
@@ -42,8 +42,8 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   {}
 
 private:
-  FT sqlength(const vertex_descriptor& va,
-              const vertex_descriptor& vb) const
+  FT sqlength(const vertex_descriptor va,
+              const vertex_descriptor vb) const
   {
     typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
       vpmap = get(CGAL::vertex_point, m_pmesh);
@@ -60,7 +60,7 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   void calc_sizing_map() const {}
   void update_sizing_map(const vertex_descriptor& vnew) const {}
 
-  boost::optional<FT> is_too_long(const halfedge_descriptor& h) const
+  boost::optional<FT> is_too_long(const halfedge_descriptor h) const
   {
     const FT sqlen = sqlength(h);
     if(sqlen > m_sq_long)
@@ -69,8 +69,8 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       return boost::none;
   }
 
-  boost::optional<FT> is_too_long(const vertex_descriptor& va,
-                                  const vertex_descriptor& vb) const
+  boost::optional<FT> is_too_long(const vertex_descriptor va,
+                                  const vertex_descriptor vb) const
   {
     const FT sqlen = sqlength(va, vb);
     if (sqlen > m_sq_long)
@@ -79,7 +79,7 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       return boost::none;
   }
 
-  boost::optional<FT> is_too_short(const halfedge_descriptor& h) const
+  boost::optional<FT> is_too_short(const halfedge_descriptor h) const
   {
     const FT sqlen = sqlength(h);
     if (sqlen < m_sq_long)
@@ -88,7 +88,7 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       return boost::none;
   }
 
-  virtual Point_3 split_placement(const halfedge_descriptor& h) const
+  virtual Point_3 split_placement(const halfedge_descriptor h) const
   {
     typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
       vpmap = get(CGAL::vertex_point, m_pmesh);

From ace36a2bb69388bfcab202e08dd0bd99f79aac8d Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 20 Jun 2023 18:08:20 +0200
Subject: [PATCH 0553/1398] Make tangential relaxation work with both uniform
 and adaptive sizing field

---
 .../Uniform_sizing_field.h                    |  1 +
 .../Isotropic_remeshing/remesh_impl.h         | 53 ++++++++++---------
 .../CGAL/Polygon_mesh_processing/remesh.h     | 25 +--------
 .../tangential_relaxation.h                   | 24 +++++----
 4 files changed, 43 insertions(+), 60 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
index cc229583b384..8fd4bf2334c1 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
@@ -59,6 +59,7 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   //todo ip: rewrite to remove this?
   void calc_sizing_map() const {}
   void update_sizing_map(const vertex_descriptor& vnew) const {}
+  double get_sizing(vertex_descriptor v) const {return 1.;}
 
   boost::optional<FT> is_too_long(const halfedge_descriptor h) const
   {
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 581b9870778c..76e285176346 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -75,7 +75,11 @@
 #endif
 
 namespace CGAL {
+
 namespace Polygon_mesh_processing {
+
+template <typename PM> class Uniform_sizing_field;
+
 namespace internal {
 
   enum Halfedge_status {
@@ -1012,7 +1016,7 @@ namespace internal {
     // "applies an iterative smoothing filter to the mesh.
     // The vertex movement has to be constrained to the vertex tangent plane [...]
     // smoothing algorithm with uniform Laplacian weights"
-    template <typename SizingFunction>
+    template <class SizingFunction>
     void tangential_relaxation_impl(const bool relax_constraints/*1d smoothing*/
                                   , const unsigned int nb_iterations
                                   , const SizingFunction& sizing)
@@ -1046,32 +1050,29 @@ namespace internal {
       auto constrained_vertices_pmap
         = boost::make_function_property_map<vertex_descriptor>(vertex_constraint);
 
-      //todo IP temp: I have to rewrite to include original implementation, hardcoded for now
-      const bool use_sizing = true;
-      if (!use_sizing)
-      tangential_relaxation(
-        vertices(mesh_),
-        mesh_,
-        CGAL::parameters::number_of_iterations(nb_iterations)
-                         .vertex_point_map(vpmap_)
-                         .geom_traits(gt_)
-                         .edge_is_constrained_map(constrained_edges_pmap)
-                         .vertex_is_constrained_map(constrained_vertices_pmap)
-                         .relax_constraints(relax_constraints)
-      );
-
+      if (std::is_same<SizingFunction, Uniform_sizing_field<PM>>::value)
+        tangential_relaxation(
+                vertices(mesh_),
+                mesh_,
+                CGAL::parameters::number_of_iterations(nb_iterations)
+                        .vertex_point_map(vpmap_)
+                        .geom_traits(gt_)
+                        .edge_is_constrained_map(constrained_edges_pmap)
+                        .vertex_is_constrained_map(constrained_vertices_pmap)
+                        .relax_constraints(relax_constraints)
+        );
       else
-      tangential_relaxation_with_sizing(
-        vertices(mesh_),
-        mesh_,
-        sizing,
-        CGAL::parameters::number_of_iterations(nb_iterations)
-          .vertex_point_map(vpmap_)
-          .geom_traits(gt_)
-          .edge_is_constrained_map(constrained_edges_pmap)
-          .vertex_is_constrained_map(constrained_vertices_pmap)
-          .relax_constraints(relax_constraints)
-      );
+        tangential_relaxation_with_sizing(
+          vertices(mesh_),
+          mesh_,
+          sizing,
+          CGAL::parameters::number_of_iterations(nb_iterations)
+            .vertex_point_map(vpmap_)
+            .geom_traits(gt_)
+            .edge_is_constrained_map(constrained_edges_pmap)
+            .vertex_is_constrained_map(constrained_vertices_pmap)
+            .relax_constraints(relax_constraints)
+        );
 
       CGAL_assertion(!input_mesh_is_valid_ || is_valid_polygon_mesh(mesh_));
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 975ff7bbf9b0..787fe54b9930 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -220,27 +220,6 @@ void isotropic_remeshing(const FaceRange& faces
     np);
 }
 
-//todo ip: should I have the overload here?
-/*
-template<typename PolygonMesh
-        , typename FaceRange
-        , typename NamedParameters = parameters::Default_named_parameters>
-void isotropic_remeshing(const FaceRange& faces
-                       , const double& tol
-                       , const std::pair<double, double>& edge_len_min_max
-                       , PolygonMesh& pmesh
-                       , const NamedParameters& np = parameters::default_values())
-{
-  typedef Adaptive_sizing_field<PolygonMesh> Adaptive_sizing;
-  Adaptive_sizing sizing(edge_len_min_max, pmesh);
-  isotropic_remeshing<PolygonMesh, FaceRange, Adaptive_sizing, NamedParameters>(
-          faces,
-          sizing,
-          pmesh,
-          np);
-}
- */
-
 template<typename PolygonMesh
        , typename FaceRange
        , typename SizingFunction
@@ -355,7 +334,8 @@ void isotropic_remeshing(const FaceRange& faces
   t.reset(); t.start();
 #endif
 
-      sizing.calc_sizing_map();
+    sizing.calc_sizing_map();
+
   for (unsigned int i = 0; i < nb_iterations; ++i)
   {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
@@ -371,7 +351,6 @@ void isotropic_remeshing(const FaceRange& faces
     if(do_flip)
       remesher.flip_edges_for_valence_and_shape();
     remesher.tangential_relaxation_impl(smoothing_1d, nb_laplacian, sizing);
-//    remesher.tangential_relaxation_impl(smoothing_1d, nb_laplacian);
     if ( choose_parameter(get_parameter(np, internal_np::do_project), true) )
       remesher.project_to_surface(get_parameter(np, internal_np::projection_functor));
 #ifdef CGAL_PMP_REMESHING_VERBOSE
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index d4f5dd8157a5..deb21383c714 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -317,14 +317,14 @@ void tangential_relaxation(const VertexRange& vertices,
 #endif
 }
 
-template <typename VertexRange
-        , class TriangleMesh
-        , typename SizingFunction
-        , class NamedParameters = parameters::Default_named_parameters>
+template <typename VertexRange,
+          class TriangleMesh,
+          class SizingFunction,
+          class NamedParameters = parameters::Default_named_parameters>
 void tangential_relaxation_with_sizing(const VertexRange& vertices,
-  TriangleMesh& tm,
-  const SizingFunction& sizing,
-  const NamedParameters& np = parameters::default_values())
+                                       TriangleMesh& tm,
+                                       const SizingFunction& sizing,
+                                       const NamedParameters& np = parameters::default_values())
 {
   typedef typename boost::graph_traits<TriangleMesh>::vertex_descriptor vertex_descriptor;
   typedef typename boost::graph_traits<TriangleMesh>::halfedge_descriptor halfedge_descriptor;
@@ -558,10 +558,12 @@ void tangential_relaxation(TriangleMesh& tm, const CGAL_NP_CLASS& np = parameter
   tangential_relaxation(vertices(tm), tm, np);
 }
 
-template <class TriangleMesh
-        , typename SizingFunction
-        , typename CGAL_NP_TEMPLATE_PARAMETERS>
-void tangential_relaxation_with_sizing(TriangleMesh& tm, const SizingFunction& sizing, const CGAL_NP_CLASS& np = parameters::default_values())
+template <class TriangleMesh,
+          typename SizingFunction,
+          typename CGAL_NP_TEMPLATE_PARAMETERS>
+void tangential_relaxation_with_sizing(TriangleMesh& tm,
+                                       const SizingFunction& sizing,
+                                       const CGAL_NP_CLASS& np = parameters::default_values())
 {
   tangential_relaxation_with_sizing(vertices(tm), tm, sizing, np);
 }

From 73fd72feb9933c6c556b691e747eb32918096df0 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Wed, 21 Jun 2023 16:45:42 +0200
Subject: [PATCH 0554/1398] Add constexpr to differentiate uniform and adaptive
 fields

---
 .../Adaptive_sizing_field.h                   |  2 +-
 .../Uniform_sizing_field.h                    |  5 ---
 .../Isotropic_remeshing/remesh_impl.h         | 33 +++++++++++++------
 .../CGAL/Polygon_mesh_processing/remesh.h     |  1 +
 4 files changed, 25 insertions(+), 16 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 7c86e1420499..bbc33ee21630 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -147,7 +147,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                               get(m_vertex_sizing_map, target(h, m_pmesh)));
     CGAL_assertion(get(m_vertex_sizing_map, source(h, m_pmesh)));
     CGAL_assertion(get(m_vertex_sizing_map, target(h, m_pmesh)));
-    if(sqlen > sqtarg_len)
+    if(sqlen > 16./9. * sqtarg_len)
       return sqlen;
     else
       return boost::none;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
index 8fd4bf2334c1..a36c30aa712c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
@@ -56,11 +56,6 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   }
 
 public:
-  //todo ip: rewrite to remove this?
-  void calc_sizing_map() const {}
-  void update_sizing_map(const vertex_descriptor& vnew) const {}
-  double get_sizing(vertex_descriptor v) const {return 1.;}
-
   boost::optional<FT> is_too_long(const halfedge_descriptor h) const
   {
     const FT sqlen = sqlength(h);
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 76e285176346..aec9ca3b5d93 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -553,7 +553,8 @@ namespace internal {
         halfedge_added(hnew_opp, status(opposite(he, mesh_)));
 
         //todo ip-add: already updating sizing here because of is_too_long checks below
-        sizing.update_sizing_map(vnew);
+        if constexpr (!std::is_same<SizingFunction, Uniform_sizing_field<PM>>::value)
+          sizing.update_sizing_map(vnew);
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
@@ -1050,18 +1051,29 @@ namespace internal {
       auto constrained_vertices_pmap
         = boost::make_function_property_map<vertex_descriptor>(vertex_constraint);
 
-      if (std::is_same<SizingFunction, Uniform_sizing_field<PM>>::value)
+      if constexpr (std::is_same<SizingFunction, Uniform_sizing_field<PM>>::value)
+      {
+#ifdef CGAL_PMP_REMESHING_VERBOSE
+        std::cout << " using tangential relaxation with weights equal to 1";
+        std::cout << std::endl;
+#endif
         tangential_relaxation(
-                vertices(mesh_),
-                mesh_,
-                CGAL::parameters::number_of_iterations(nb_iterations)
-                        .vertex_point_map(vpmap_)
-                        .geom_traits(gt_)
-                        .edge_is_constrained_map(constrained_edges_pmap)
-                        .vertex_is_constrained_map(constrained_vertices_pmap)
-                        .relax_constraints(relax_constraints)
+          vertices(mesh_),
+          mesh_,
+          CGAL::parameters::number_of_iterations(nb_iterations)
+            .vertex_point_map(vpmap_)
+            .geom_traits(gt_)
+            .edge_is_constrained_map(constrained_edges_pmap)
+            .vertex_is_constrained_map(constrained_vertices_pmap)
+            .relax_constraints(relax_constraints)
         );
+      }
       else
+      {
+#ifdef CGAL_PMP_REMESHING_VERBOSE
+        std::cout << " using tangential relaxation weighted with the sizing field";
+        std::cout << std::endl;
+#endif
         tangential_relaxation_with_sizing(
           vertices(mesh_),
           mesh_,
@@ -1073,6 +1085,7 @@ namespace internal {
             .vertex_is_constrained_map(constrained_vertices_pmap)
             .relax_constraints(relax_constraints)
         );
+      }
 
       CGAL_assertion(!input_mesh_is_valid_ || is_valid_polygon_mesh(mesh_));
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 787fe54b9930..e751a294445c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -334,6 +334,7 @@ void isotropic_remeshing(const FaceRange& faces
   t.reset(); t.start();
 #endif
 
+  if constexpr (!std::is_same<SizingFunction, Uniform_sizing_field<PM>>::value)
     sizing.calc_sizing_map();
 
   for (unsigned int i = 0; i < nb_iterations; ++i)

From 0fbcb4175c40bf6561df5213e08753464daf732a Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Thu, 29 Jun 2023 19:52:25 +0200
Subject: [PATCH 0555/1398] Add UI support for adaptive remeshing in Polyhedron
 demo (WIP)

---
 .../Polyhedron/Plugins/PMP/CMakeLists.txt     |  19 +-
 .../Plugins/PMP/Isotropic_remeshing_dialog.ui | 225 +++++++++++++-----
 .../PMP/Isotropic_remeshing_plugin.cpp        |  56 ++++-
 3 files changed, 227 insertions(+), 73 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
index 6d5b6cf16d47..354e6641bd62 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
@@ -135,14 +135,19 @@ qt5_wrap_ui( repairUI_FILES RemoveNeedlesDialog.ui SelfSnapDialog.ui)
 polyhedron_demo_plugin(repair_polyhedron_plugin Repair_polyhedron_plugin  ${repairUI_FILES} KEYWORDS PMP)
 target_link_libraries(repair_polyhedron_plugin PUBLIC scene_points_with_normal_item scene_surface_mesh_item)
 
-qt5_wrap_ui(isotropicRemeshingUI_FILES Isotropic_remeshing_dialog.ui)
-polyhedron_demo_plugin(isotropic_remeshing_plugin Isotropic_remeshing_plugin
-                       ${isotropicRemeshingUI_FILES} KEYWORDS PMP)
-target_link_libraries(isotropic_remeshing_plugin PUBLIC scene_surface_mesh_item
-                                                        scene_selection_item)
+if(TARGET CGAL::Eigen3_support)
+  qt5_wrap_ui(isotropicRemeshingUI_FILES Isotropic_remeshing_dialog.ui)
+  polyhedron_demo_plugin(isotropic_remeshing_plugin Isotropic_remeshing_plugin
+          ${isotropicRemeshingUI_FILES} KEYWORDS PMP)
+  target_link_libraries(isotropic_remeshing_plugin PUBLIC scene_surface_mesh_item
+          scene_selection_item CGAL::Eigen3_support)
+
+  if(TARGET CGAL::TBB_support)
+    target_link_libraries(isotropic_remeshing_plugin PUBLIC CGAL::TBB_support)
+  endif()
 
-if(TARGET CGAL::TBB_support)
-  target_link_libraries(isotropic_remeshing_plugin PUBLIC CGAL::TBB_support)
+else()
+  message(STATUS "NOTICE: Eigen 3.1 (or greater) was not found. Isotropic remeshing plugin will not be available.")
 endif()
 
 polyhedron_demo_plugin(distance_plugin Distance_plugin KEYWORDS PMP)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_dialog.ui b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_dialog.ui
index a35ec28d9669..540a52c1bff9 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_dialog.ui
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_dialog.ui
@@ -9,8 +9,8 @@
    <rect>
     <x>0</x>
     <y>0</y>
-    <width>376</width>
-    <height>369</height>
+    <width>381</width>
+    <height>545</height>
    </rect>
   </property>
   <property name="windowTitle">
@@ -59,18 +59,117 @@
      <property name="title">
       <string>Isotropic remeshing</string>
      </property>
-     <layout class="QGridLayout" name="gridLayout_2" rowstretch="0,0,0,0,0,0,0" columnstretch="0,1">
-      <item row="6" column="0">
-       <widget class="QLabel" name="preserveDuplicates_label">
+     <layout class="QGridLayout" name="gridLayout_2" rowstretch="0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0" columnstretch="0,0">
+      <item row="3" column="0">
+       <layout class="QHBoxLayout" name="horizontalLayout_2">
+        <property name="spacing">
+         <number>-1</number>
+        </property>
+        <property name="sizeConstraint">
+         <enum>QLayout::SetDefaultConstraint</enum>
+        </property>
+        <property name="leftMargin">
+         <number>11</number>
+        </property>
+        <property name="rightMargin">
+         <number>14</number>
+        </property>
+        <item alignment="Qt::AlignLeft">
+         <widget class="QLabel" name="edgeSizing_type_label">
+          <property name="text">
+           <string>Edge sizing</string>
+          </property>
+         </widget>
+        </item>
+        <item alignment="Qt::AlignLeft">
+         <widget class="QComboBox" name="edgeSizing_type_combo_box">
+          <property name="sizePolicy">
+           <sizepolicy hsizetype="Preferred" vsizetype="Fixed">
+            <horstretch>0</horstretch>
+            <verstretch>0</verstretch>
+           </sizepolicy>
+          </property>
+          <property name="maximumSize">
+           <size>
+            <width>168</width>
+            <height>16777215</height>
+           </size>
+          </property>
+          <item>
+           <property name="text">
+            <string>Uniform</string>
+           </property>
+          </item>
+          <item>
+           <property name="text">
+            <string>Adaptive</string>
+           </property>
+          </item>
+         </widget>
+        </item>
+       </layout>
+      </item>
+      <item row="15" column="0">
+       <spacer name="verticalSpacer">
+        <property name="orientation">
+         <enum>Qt::Vertical</enum>
+        </property>
+        <property name="sizeHint" stdset="0">
+         <size>
+          <width>20</width>
+          <height>20</height>
+         </size>
+        </property>
+       </spacer>
+      </item>
+      <item row="18" column="0" colspan="2">
+       <spacer name="verticalSpacer_3">
+        <property name="orientation">
+         <enum>Qt::Vertical</enum>
+        </property>
+        <property name="sizeType">
+         <enum>QSizePolicy::Maximum</enum>
+        </property>
+        <property name="sizeHint" stdset="0">
+         <size>
+          <width>20</width>
+          <height>24</height>
+         </size>
+        </property>
+       </spacer>
+      </item>
+      <item row="12" column="0" alignment="Qt::AlignRight">
+       <widget class="QLabel" name="errorTol_label">
         <property name="text">
-         <string>Preserve duplicated edges</string>
+         <string>Error tolerance</string>
         </property>
-        <property name="alignment">
-         <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
+       </widget>
+      </item>
+      <item row="12" column="1">
+       <widget class="DoubleEdit" name="errorTol_edit">
+        <property name="text">
+         <string/>
+        </property>
+        <property name="placeholderText">
+         <string>0.00</string>
         </property>
        </widget>
       </item>
-      <item row="2" column="1">
+      <item row="13" column="0" alignment="Qt::AlignRight">
+       <widget class="QLabel" name="minEdgeLength_label">
+        <property name="text">
+         <string>Minimum edge length</string>
+        </property>
+       </widget>
+      </item>
+      <item row="20" column="1">
+       <widget class="QCheckBox" name="smooth1D_checkbox">
+        <property name="text">
+         <string/>
+        </property>
+       </widget>
+      </item>
+      <item row="17" column="1">
        <widget class="QSpinBox" name="nbSmoothing_spinbox">
         <property name="minimum">
          <number>0</number>
@@ -83,24 +182,27 @@
         </property>
        </widget>
       </item>
-      <item row="6" column="1">
-       <widget class="QCheckBox" name="preserveDuplicates_checkbox">
+      <item row="19" column="1">
+       <widget class="QCheckBox" name="protect_checkbox">
         <property name="text">
          <string/>
         </property>
+        <property name="checked">
+         <bool>true</bool>
+        </property>
        </widget>
       </item>
-      <item row="0" column="0">
-       <widget class="QLabel" name="edgeLength_label">
+      <item row="17" column="0">
+       <widget class="QLabel" name="nbSmoothing_label">
         <property name="text">
-         <string>Target edge length</string>
+         <string>Number of Smoothing iterations</string>
         </property>
         <property name="alignment">
          <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
         </property>
        </widget>
       </item>
-      <item row="4" column="0">
+      <item row="19" column="0">
        <widget class="QLabel" name="protect_label">
         <property name="text">
          <string>Protect borders/selected edges</string>
@@ -110,17 +212,34 @@
         </property>
        </widget>
       </item>
-      <item row="2" column="0">
-       <widget class="QLabel" name="nbSmoothing_label">
+      <item row="21" column="1">
+       <widget class="QCheckBox" name="preserveDuplicates_checkbox">
         <property name="text">
-         <string>Number of Smoothing iterations</string>
+         <string/>
+        </property>
+       </widget>
+      </item>
+      <item row="20" column="0">
+       <widget class="QLabel" name="smooth1D_label">
+        <property name="text">
+         <string>Allow 1D smoothing along borders</string>
         </property>
         <property name="alignment">
          <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
         </property>
        </widget>
       </item>
-      <item row="1" column="1">
+      <item row="21" column="0">
+       <widget class="QLabel" name="preserveDuplicates_label">
+        <property name="text">
+         <string>Preserve duplicated edges</string>
+        </property>
+        <property name="alignment">
+         <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
+        </property>
+       </widget>
+      </item>
+      <item row="16" column="1">
        <widget class="QSpinBox" name="nbIterations_spinbox">
         <property name="minimumSize">
          <size>
@@ -133,17 +252,7 @@
         </property>
        </widget>
       </item>
-      <item row="5" column="0">
-       <widget class="QLabel" name="smooth1D_label">
-        <property name="text">
-         <string>Allow 1D smoothing along borders</string>
-        </property>
-        <property name="alignment">
-         <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
-        </property>
-       </widget>
-      </item>
-      <item row="1" column="0">
+      <item row="16" column="0">
        <widget class="QLabel" name="nbIterations_label">
         <property name="text">
          <string>Number of Main iterations</string>
@@ -156,40 +265,17 @@
         </property>
        </widget>
       </item>
-      <item row="5" column="1">
-       <widget class="QCheckBox" name="smooth1D_checkbox">
-        <property name="text">
-         <string/>
-        </property>
-       </widget>
-      </item>
-      <item row="4" column="1">
-       <widget class="QCheckBox" name="protect_checkbox">
+      <item row="11" column="0">
+       <widget class="QLabel" name="edgeLength_label">
         <property name="text">
-         <string/>
+         <string>Target edge length</string>
         </property>
-        <property name="checked">
-         <bool>true</bool>
+        <property name="alignment">
+         <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
         </property>
        </widget>
       </item>
-      <item row="3" column="0">
-       <spacer name="verticalSpacer_3">
-        <property name="orientation">
-         <enum>Qt::Vertical</enum>
-        </property>
-        <property name="sizeType">
-         <enum>QSizePolicy::Maximum</enum>
-        </property>
-        <property name="sizeHint" stdset="0">
-         <size>
-          <width>20</width>
-          <height>40</height>
-         </size>
-        </property>
-       </spacer>
-      </item>
-      <item row="0" column="1">
+      <item row="11" column="1">
        <widget class="DoubleEdit" name="edgeLength_dspinbox">
         <property name="inputMethodHints">
          <set>Qt::ImhNone</set>
@@ -205,6 +291,27 @@
         </property>
        </widget>
       </item>
+      <item row="14" column="0" alignment="Qt::AlignRight">
+       <widget class="QLabel" name="maxEdgeLength_label">
+        <property name="text">
+         <string>Maximum edge length</string>
+        </property>
+       </widget>
+      </item>
+      <item row="13" column="1">
+       <widget class="DoubleEdit" name="minEdgeLength_edit">
+        <property name="placeholderText">
+         <string>0.00</string>
+        </property>
+       </widget>
+      </item>
+      <item row="14" column="1">
+       <widget class="DoubleEdit" name="maxEdgeLength_edit">
+        <property name="placeholderText">
+         <string>0.00</string>
+        </property>
+       </widget>
+      </item>
      </layout>
     </widget>
    </item>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index f1b138c16728..2022de8f9b81 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -825,6 +825,9 @@ public Q_SLOTS:
 
     bool edges_only_;
     double target_length_;
+    double error_tol_;
+    double min_length_;
+    double max_length_;
     unsigned int nb_iter_;
     bool protect_;
     bool smooth_features_;
@@ -986,6 +989,32 @@ public Q_SLOTS:
     }
   }
 
+  void on_edgeSizing_type_combo_box_changed(int index)
+  {
+    if (index == 0)
+    {
+      ui.edgeLength_label->show();
+      ui.edgeLength_dspinbox->show();
+      ui.errorTol_label->hide();
+      ui.errorTol_edit->hide();
+      ui.minEdgeLength_label->hide();
+      ui.minEdgeLength_edit->hide();
+      ui.maxEdgeLength_label->hide();
+      ui.maxEdgeLength_edit->hide();
+    }
+    else if (index == 1)
+    {
+      ui.edgeLength_label->hide();
+      ui.edgeLength_dspinbox->hide();
+      ui.errorTol_label->show();
+      ui.errorTol_edit->show();
+      ui.minEdgeLength_label->show();
+      ui.minEdgeLength_edit->show();
+      ui.maxEdgeLength_label->show();
+      ui.maxEdgeLength_edit->show();
+    }
+  }
+
 public:
   void
   initialize_remeshing_dialog(QDialog* dialog,
@@ -1004,6 +1033,8 @@ public Q_SLOTS:
 
     connect(ui.protect_checkbox, SIGNAL(clicked(bool)), this, SLOT(update_after_protect_checkbox_click()));
     connect(ui.splitEdgesOnly_checkbox, SIGNAL(clicked(bool)), this, SLOT(update_after_splitEdgesOnly_click()));
+    connect(ui.edgeSizing_type_combo_box, SIGNAL(currentIndexChanged(int)),
+      this, SLOT(on_edgeSizing_type_combo_box_changed(int)));
 
     //Set default parameters
     Scene_interface::Bbox bbox = poly_item != nullptr ? poly_item->bbox()
@@ -1025,17 +1056,29 @@ public Q_SLOTS:
 
 
     ui.edgeLength_dspinbox->setValue(0.05 * diago_length);
-
-    std::ostringstream oss;
-    oss << "Diagonal length of the Bbox of the selection to remesh is ";
-    oss << diago_length << "." << std::endl;
-    oss << "Default is 5% of it" << std::endl;
-    ui.edgeLength_dspinbox->setToolTip(QString::fromStdString(oss.str()));
+    //todo ip - check and adjust these
+    ui.errorTol_edit->setValue(0.001 * diago_length);
+    ui.minEdgeLength_edit->setValue(0.001 * diago_length);
+    ui.maxEdgeLength_edit->setValue(0.5 * diago_length);
+
+    std::string diag_general_info = "Diagonal length of the Bbox of the selection to remesh is "
+                                    + std::to_string(diago_length) + ".\n";
+    std::string specific_info;
+    specific_info = "Default is 5% of it\n";
+    ui.edgeLength_dspinbox->setToolTip(QString::fromStdString(diag_general_info + specific_info));
+    specific_info = "Default is 0.1% of it\n";
+    ui.errorTol_edit->setToolTip(QString::fromStdString(diag_general_info + specific_info));
+    specific_info = "Default is 0.1% of it\n";
+    ui.minEdgeLength_edit->setToolTip(QString::fromStdString(diag_general_info + specific_info));
+    specific_info = "Default is 50% of it\n";
+    ui.maxEdgeLength_edit->setToolTip(QString::fromStdString(diag_general_info + specific_info));
 
     ui.nbIterations_spinbox->setSingleStep(1);
     ui.nbIterations_spinbox->setRange(1/*min*/, 1000/*max*/);
     ui.nbIterations_spinbox->setValue(1);
 
+    ui.edgeSizing_type_combo_box->setCurrentIndex(0);
+    on_edgeSizing_type_combo_box_changed(0); //todo ip otherwise it shows all remeshing variables
     ui.protect_checkbox->setChecked(false);
     ui.smooth1D_checkbox->setChecked(true);
 
@@ -1047,7 +1090,6 @@ public Q_SLOTS:
     }
   }
 
-
 private:
   QAction* actionIsotropicRemeshing_;
   Ui::Isotropic_remeshing_dialog ui;

From 91216f7875062236e473e8154e7a0924bf88b86f Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 30 Jun 2023 21:15:37 +0200
Subject: [PATCH 0556/1398] Add adaptive remeshing to Polyhedorn demo, PMP
 plugin

---
 .../tangential_relaxation.h                   |  16 +-
 .../PMP/Isotropic_remeshing_plugin.cpp        | 285 ++++++++++++++----
 2 files changed, 226 insertions(+), 75 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index deb21383c714..d2e955841f11 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -465,16 +465,16 @@ void tangential_relaxation_with_sizing(const VertexRange& vertices,
           const vertex_descriptor v2 = source(h, tm);
 
           //todo ip- alt calc
-          const Vector_3 vec0 = vector(get(vpm, v), get(vpm, v1));
-          const Vector_3 vec1 = vector(get(vpm, v), get(vpm, v2));
-          const double sqarea = squared_length(cross_product(vec0, vec1));
-          const double face_weight = CGAL::approximate_sqrt(sqarea)
-                                     / pow(1. / 3. * (sizing.get_sizing(v) + sizing.get_sizing(v1) + sizing.get_sizing(v2)), 2);
+//          const Vector_3 vec0 = vector(get(vpm, v), get(vpm, v1));
+//          const Vector_3 vec1 = vector(get(vpm, v), get(vpm, v2));
+//          const double sqarea = squared_length(cross_product(vec0, vec1));
+//          const double face_weight = CGAL::approximate_sqrt(sqarea)
+//                                     / pow(1. / 3. * (sizing.get_sizing(v) + sizing.get_sizing(v1) + sizing.get_sizing(v2)), 2);
 
           //todo ip- paper implementation
-         // const double tri_area = gt_area(get(vpm, v), get(vpm, v1), get(vpm, v2));
-         // const double face_weight = tri_area
-         //                          / (1. / 3. * (sizing.get_sizing(v) + sizing.get_sizing(v1) + sizing.get_sizing(v2)));
+          const double tri_area = gt_area(get(vpm, v), get(vpm, v1), get(vpm, v2));
+          const double face_weight = tri_area
+                                   / (1. / 3. * (sizing.get_sizing(v) + sizing.get_sizing(v1) + sizing.get_sizing(v2)));
           weight += face_weight;
 
           const Point_3 centroid = gt_centroid(get(vpm, v), get(vpm, v1), get(vpm, v2));
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 2022de8f9b81..813434a4c6ca 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -358,9 +358,13 @@ public Q_SLOTS:
         return;
       }
 
+      int edge_sizing_type = ui.edgeSizing_type_combo_box->currentIndex();
       bool edges_only = ui.splitEdgesOnly_checkbox->isChecked();
       bool preserve_duplicates = ui.preserveDuplicates_checkbox->isChecked();
       double target_length = ui.edgeLength_dspinbox->value();
+      double error_tol = ui.errorTol_edit->value();
+      double min_length = ui.minEdgeLength_edit->value();
+      double max_length = ui.maxEdgeLength_edit->value();
       unsigned int nb_iter = ui.nbIterations_spinbox->value();
       unsigned int nb_smooth = ui.nbSmoothing_spinbox->value();
       bool protect = ui.protect_checkbox->isChecked();
@@ -457,28 +461,60 @@ public Q_SLOTS:
                 }
               }
 
-              if (fpmap_valid)
-                CGAL::Polygon_mesh_processing::isotropic_remeshing(faces(*selection_item->polyhedron())
-                   , target_length
-                   , *selection_item->polyhedron()
-                   , CGAL::parameters::number_of_iterations(nb_iter)
-                   .protect_constraints(protect)
-                   .edge_is_constrained_map(selection_item->constrained_edges_pmap())
-                   .relax_constraints(smooth_features)
-                   .number_of_relaxation_steps(nb_smooth)
-                   .vertex_is_constrained_map(selection_item->constrained_vertices_pmap())
-                   .face_patch_map(fpmap));
-              else
-                CGAL::Polygon_mesh_processing::isotropic_remeshing(faces(*selection_item->polyhedron())
-                   , target_length
-                   , *selection_item->polyhedron()
-                   , CGAL::parameters::number_of_iterations(nb_iter)
-                   .protect_constraints(protect)
-                   .edge_is_constrained_map(selection_item->constrained_edges_pmap())
-                   .relax_constraints(smooth_features)
-                   .number_of_relaxation_steps(nb_smooth)
-                   .vertex_is_constrained_map(selection_item->constrained_vertices_pmap())
-                                                                   );
+              if (edge_sizing_type == 0)
+              {
+                if (fpmap_valid)
+                  CGAL::Polygon_mesh_processing::isotropic_remeshing(faces(*selection_item->polyhedron())
+                     , target_length
+                     , *selection_item->polyhedron()
+                     , CGAL::parameters::number_of_iterations(nb_iter)
+                     .protect_constraints(protect)
+                     .edge_is_constrained_map(selection_item->constrained_edges_pmap())
+                     .relax_constraints(smooth_features)
+                     .number_of_relaxation_steps(nb_smooth)
+                     .vertex_is_constrained_map(selection_item->constrained_vertices_pmap())
+                     .face_patch_map(fpmap));
+                else
+                  CGAL::Polygon_mesh_processing::isotropic_remeshing(faces(*selection_item->polyhedron())
+                     , target_length
+                     , *selection_item->polyhedron()
+                     , CGAL::parameters::number_of_iterations(nb_iter)
+                     .protect_constraints(protect)
+                     .edge_is_constrained_map(selection_item->constrained_edges_pmap())
+                     .relax_constraints(smooth_features)
+                     .number_of_relaxation_steps(nb_smooth)
+                     .vertex_is_constrained_map(selection_item->constrained_vertices_pmap())
+                                                                     );
+              }
+              else if (edge_sizing_type == 1)
+              {
+                std::pair<double, double> edge_min_max{min_length, max_length};
+                PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol
+                                                               , edge_min_max
+                                                               , *selection_item->polyhedron());
+                if (fpmap_valid)
+                  CGAL::Polygon_mesh_processing::isotropic_remeshing(faces(*selection_item->polyhedron())
+                     , adaptive_sizing_field
+                     , *selection_item->polyhedron()
+                     , CGAL::parameters::number_of_iterations(nb_iter)
+                     .protect_constraints(protect)
+                     .edge_is_constrained_map(selection_item->constrained_edges_pmap())
+                     .relax_constraints(smooth_features)
+                     .number_of_relaxation_steps(nb_smooth)
+                     .vertex_is_constrained_map(selection_item->constrained_vertices_pmap())
+                     .face_patch_map(fpmap));
+                else
+                  CGAL::Polygon_mesh_processing::isotropic_remeshing(faces(*selection_item->polyhedron())
+                     , adaptive_sizing_field
+                     , *selection_item->polyhedron()
+                     , CGAL::parameters::number_of_iterations(nb_iter)
+                     .protect_constraints(protect)
+                     .edge_is_constrained_map(selection_item->constrained_edges_pmap())
+                     .relax_constraints(smooth_features)
+                     .number_of_relaxation_steps(nb_smooth)
+                     .vertex_is_constrained_map(selection_item->constrained_vertices_pmap())
+                                                                     );
+              }
             }
             else //selected_facets not empty
             {
@@ -507,27 +543,60 @@ public Q_SLOTS:
                 }
               }
 
-              if (fpmap_valid)
-                CGAL::Polygon_mesh_processing::isotropic_remeshing(selection_item->selected_facets
-                  , target_length
-                  , *selection_item->polyhedron()
-                  , CGAL::parameters::number_of_iterations(nb_iter)
-                  .protect_constraints(protect)
-                  .edge_is_constrained_map(selection_item->constrained_edges_pmap())
-                  .relax_constraints(smooth_features)
-                  .number_of_relaxation_steps(nb_smooth)
-                  .vertex_is_constrained_map(selection_item->constrained_vertices_pmap())
-                  .face_patch_map(fpmap));
-              else
-                CGAL::Polygon_mesh_processing::isotropic_remeshing(selection_item->selected_facets
-                  , target_length
-                  , *selection_item->polyhedron()
-                  , CGAL::parameters::number_of_iterations(nb_iter)
-                  .protect_constraints(protect)
-                  .edge_is_constrained_map(selection_item->constrained_edges_pmap())
-                  .relax_constraints(smooth_features)
-                  .number_of_relaxation_steps(nb_smooth)
-                  .vertex_is_constrained_map(selection_item->constrained_vertices_pmap()));
+              if (edge_sizing_type == 0)
+              {
+                if (fpmap_valid)
+                  CGAL::Polygon_mesh_processing::isotropic_remeshing(selection_item->selected_facets
+                     , target_length
+                     , *selection_item->polyhedron()
+                     , CGAL::parameters::number_of_iterations(nb_iter)
+                     .protect_constraints(protect)
+                     .edge_is_constrained_map(selection_item->constrained_edges_pmap())
+                     .relax_constraints(smooth_features)
+                     .number_of_relaxation_steps(nb_smooth)
+                     .vertex_is_constrained_map(selection_item->constrained_vertices_pmap())
+                     .face_patch_map(fpmap));
+                else
+                  CGAL::Polygon_mesh_processing::isotropic_remeshing(selection_item->selected_facets
+                     , target_length
+                     , *selection_item->polyhedron()
+                     , CGAL::parameters::number_of_iterations(nb_iter)
+                     .protect_constraints(protect)
+                     .edge_is_constrained_map(selection_item->constrained_edges_pmap())
+                     .relax_constraints(smooth_features)
+                     .number_of_relaxation_steps(nb_smooth)
+                     .vertex_is_constrained_map(selection_item->constrained_vertices_pmap())
+                                                                     );
+              }
+              else if (edge_sizing_type == 1)
+              {
+                std::pair<double, double> edge_min_max{min_length, max_length};
+                PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol
+                                                               , edge_min_max
+                                                               , *selection_item->polyhedron());
+                if (fpmap_valid)
+                  CGAL::Polygon_mesh_processing::isotropic_remeshing(selection_item->selected_facets
+                     , adaptive_sizing_field
+                     , *selection_item->polyhedron()
+                     , CGAL::parameters::number_of_iterations(nb_iter)
+                     .protect_constraints(protect)
+                     .edge_is_constrained_map(selection_item->constrained_edges_pmap())
+                     .relax_constraints(smooth_features)
+                     .number_of_relaxation_steps(nb_smooth)
+                     .vertex_is_constrained_map(selection_item->constrained_vertices_pmap())
+                     .face_patch_map(fpmap));
+                else
+                  CGAL::Polygon_mesh_processing::isotropic_remeshing(selection_item->selected_facets
+                     , adaptive_sizing_field
+                     , *selection_item->polyhedron()
+                     , CGAL::parameters::number_of_iterations(nb_iter)
+                     .protect_constraints(protect)
+                     .edge_is_constrained_map(selection_item->constrained_edges_pmap())
+                     .relax_constraints(smooth_features)
+                     .number_of_relaxation_steps(nb_smooth)
+                     .vertex_is_constrained_map(selection_item->constrained_vertices_pmap())
+                                                                     );
+              }
             }
         }
 
@@ -634,10 +703,40 @@ public Q_SLOTS:
             }
           }
 
-          if (fpmap_valid)
+          if (edge_sizing_type == 0)
+          {
+            if (fpmap_valid)
+              CGAL::Polygon_mesh_processing::isotropic_remeshing(
+                   faces(*poly_item->polyhedron())
+                 , target_length
+                 , *poly_item->polyhedron()
+                 , CGAL::parameters::number_of_iterations(nb_iter)
+                 .protect_constraints(protect)
+                 .number_of_relaxation_steps(nb_smooth)
+                 .edge_is_constrained_map(ecm)
+                 .relax_constraints(smooth_features)
+                 .face_patch_map(fpmap));
+            else
+              CGAL::Polygon_mesh_processing::isotropic_remeshing(
+                   faces(*poly_item->polyhedron())
+                 , target_length
+                 , *poly_item->polyhedron()
+                 , CGAL::parameters::number_of_iterations(nb_iter)
+                 .protect_constraints(protect)
+                 .number_of_relaxation_steps(nb_smooth)
+                 .edge_is_constrained_map(ecm)
+                 .relax_constraints(smooth_features));
+          }
+          else if (edge_sizing_type == 1)
+          {
+            std::pair<double, double> edge_min_max{min_length, max_length};
+            PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol
+                    , edge_min_max
+                    , *poly_item->polyhedron());
+            if (fpmap_valid)
             CGAL::Polygon_mesh_processing::isotropic_remeshing(
                  faces(*poly_item->polyhedron())
-               , target_length
+               , adaptive_sizing_field
                , *poly_item->polyhedron()
                , CGAL::parameters::number_of_iterations(nb_iter)
                .protect_constraints(protect)
@@ -645,16 +744,17 @@ public Q_SLOTS:
                .edge_is_constrained_map(ecm)
                .relax_constraints(smooth_features)
                .face_patch_map(fpmap));
-          else
-            CGAL::Polygon_mesh_processing::isotropic_remeshing(
-                 faces(*poly_item->polyhedron())
-               , target_length
-               , *poly_item->polyhedron()
-               , CGAL::parameters::number_of_iterations(nb_iter)
-               .protect_constraints(protect)
-               .number_of_relaxation_steps(nb_smooth)
-               .edge_is_constrained_map(ecm)
-               .relax_constraints(smooth_features));
+            else
+              CGAL::Polygon_mesh_processing::isotropic_remeshing(
+                   faces(*poly_item->polyhedron())
+                 , adaptive_sizing_field
+                 , *poly_item->polyhedron()
+                 , CGAL::parameters::number_of_iterations(nb_iter)
+                 .protect_constraints(protect)
+                 .number_of_relaxation_steps(nb_smooth)
+                 .edge_is_constrained_map(ecm)
+                 .relax_constraints(smooth_features));
+          }
 
           //recollect sharp edges
           for(edge_descriptor e : edges(pmesh))
@@ -687,7 +787,11 @@ public Q_SLOTS:
   {
     // Remeshing parameters
     bool edges_only = false, preserve_duplicates = false;
+    int edge_sizing_type = 0;
     double target_length = 0.;
+    double error_tol = 0.;
+    double min_length = 0.;
+    double max_length = 0.;
     unsigned int nb_iter = 1;
     bool protect = false;
     bool smooth_features = true;
@@ -723,7 +827,11 @@ public Q_SLOTS:
 
         edges_only = ui.splitEdgesOnly_checkbox->isChecked();
         preserve_duplicates = ui.preserveDuplicates_checkbox->isChecked();
+        edge_sizing_type = ui.edgeSizing_type_combo_box->currentIndex();
         target_length = ui.edgeLength_dspinbox->value();
+        error_tol = ui.errorTol_edit->value();
+        min_length = ui.minEdgeLength_edit->value();
+        max_length = ui.maxEdgeLength_edit->value();
         nb_iter = ui.nbIterations_spinbox->value();
         protect = ui.protect_checkbox->isChecked();
         smooth_features = ui.smooth1D_checkbox->isChecked();
@@ -785,8 +893,8 @@ public Q_SLOTS:
 
 #else
 
-    Remesh_polyhedron_item remesher(edges_only,
-      target_length, nb_iter, protect, smooth_features);
+    Remesh_polyhedron_item remesher(edges_only, edge_sizing_type,
+      target_length, error_tol, min_length, max_length, nb_iter, protect, smooth_features);
     for(Scene_facegraph_item* poly_item : selection)
     {
       QElapsedTimer time;
@@ -823,6 +931,7 @@ public Q_SLOTS:
     typedef boost::graph_traits<FaceGraph>::halfedge_descriptor halfedge_descriptor;
     typedef boost::graph_traits<FaceGraph>::face_descriptor     face_descriptor;
 
+    int edge_sizing_type_;
     bool edges_only_;
     double target_length_;
     double error_tol_;
@@ -859,15 +968,34 @@ public Q_SLOTS:
         std::cout << "Isotropic remeshing of "
           << poly_item->name().toStdString() << " started..." << std::endl;
         Scene_polyhedron_selection_item::Is_constrained_map<Edge_set> ecm(&edges_to_protect);
-        CGAL::Polygon_mesh_processing::isotropic_remeshing(
-            faces(*poly_item->polyhedron())
-          , target_length_
-          , *poly_item->polyhedron()
-          , CGAL::parameters::number_of_iterations(nb_iter_)
-          .protect_constraints(protect_)
-          .edge_is_constrained_map(ecm)
-          .face_patch_map(get(CGAL::face_patch_id_t<int>(), *poly_item->polyhedron()))
-          .relax_constraints(smooth_features_));
+        if (edge_sizing_type_ == 0)
+        {
+          CGAL::Polygon_mesh_processing::isotropic_remeshing(
+              faces(*poly_item->polyhedron())
+            , target_length_
+            , *poly_item->polyhedron()
+            , CGAL::parameters::number_of_iterations(nb_iter_)
+            .protect_constraints(protect_)
+            .edge_is_constrained_map(ecm)
+            .face_patch_map(get(CGAL::face_patch_id_t<int>(), *poly_item->polyhedron()))
+            .relax_constraints(smooth_features_));
+        }
+        else
+        {
+          std::pair<double, double> edge_min_max{min_length_, max_length_};
+          PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol_
+                                                         , edge_min_max
+                                                         , *poly_item->polyhedron());
+          CGAL::Polygon_mesh_processing::isotropic_remeshing(
+              faces(*poly_item->polyhedron())
+            , target_length_
+            , *poly_item->polyhedron()
+            , CGAL::parameters::number_of_iterations(nb_iter_)
+            .protect_constraints(protect_)
+            .edge_is_constrained_map(ecm)
+            .face_patch_map(get(CGAL::face_patch_id_t<int>(), *poly_item->polyhedron()))
+            .relax_constraints(smooth_features_));
+        }
         std::cout << "Isotropic remeshing of "
           << poly_item->name().toStdString() << " done." << std::endl;
       }
@@ -876,12 +1004,20 @@ public Q_SLOTS:
   public:
     Remesh_polyhedron_item(
       const bool edges_only,
+      const int edge_sizing_type,
       const double target_length,
+      const double error_tol,
+      const double min_length,
+      const double max_length,
       const unsigned int nb_iter,
       const bool protect,
       const bool smooth_features)
       : edges_only_(edges_only)
+      , edge_sizing_type_(edge_sizing_type)
       , target_length_(target_length)
+      , error_tol_(error_tol)
+      , min_length_(min_length)
+      , max_length_(max_length)
       , nb_iter_(nb_iter)
       , protect_(protect)
       , smooth_features_(smooth_features)
@@ -889,7 +1025,11 @@ public Q_SLOTS:
 
     Remesh_polyhedron_item(const Remesh_polyhedron_item& remesh)
       : edges_only_(remesh.edges_only_)
+      , edge_sizing_type_(remesh.edge_sizing_type_)
       , target_length_(remesh.target_length_)
+      , error_tol_(remesh.error_tol_)
+      , min_length_(remesh.min_length_)
+      , max_length_(remesh.max_length_)
       , nb_iter_(remesh.nb_iter_)
       , protect_(remesh.protect_)
       , smooth_features_(remesh.smooth_features_)
@@ -916,11 +1056,17 @@ public Q_SLOTS:
       const std::vector<Scene_facegraph_item*>& selection,
       std::map<FaceGraph*,Edge_set >& edges_to_protect,
       const bool edges_only,
+      const int edge_sizing_type,
       const double target_length,
+      const double error_tol,
+      const double min_length,
+      const double max_length,
       const unsigned int nb_iter,
       const bool protect,
       const bool smooth_features)
-      : RemeshFunctor(edges_only, target_length, nb_iter, protect, smooth_features)
+      : RemeshFunctor(edges_only, edge_sizing_type, target_length
+                    , error_tol, min_length, max_length
+                    , nb_iter, protect, smooth_features)
       , selection_(selection), edges_to_protect_(edges_to_protect)
     {}
 
@@ -973,6 +1119,9 @@ public Q_SLOTS:
       ui.smooth1D_label->setEnabled(false);
       ui.smooth1D_checkbox->setEnabled(false);
       ui.smooth1D_checkbox->setChecked(false);
+
+      ui.edgeSizing_type_combo_box->setCurrentIndex(0);
+      ui.edgeSizing_type_combo_box->setEnabled(false);
     }
     else
     {
@@ -986,6 +1135,8 @@ public Q_SLOTS:
 
       ui.smooth1D_label->setEnabled(true);
       ui.smooth1D_checkbox->setEnabled(true);
+
+      ui.edgeSizing_type_combo_box->setEnabled(true);
     }
   }
 

From c8a96328bd48746247b5c48911e1c5090dd60b0f Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 30 Jun 2023 21:26:10 +0200
Subject: [PATCH 0557/1398] Use C++17 CTAD in example

---
 .../isotropic_remeshing_with_sizing_example.cpp               | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index cfbf7bfd9c77..bbb86c89692c 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -27,8 +27,8 @@ int main(int argc, char* argv[])
     << " (" << num_faces(mesh) << " faces)..." << std::endl;
 
   const double tol = 0.001;
-  const std::pair<double, double> edge_min_max{0.001, 0.5};
-  PMP::Adaptive_sizing_field<Mesh> sizing_field(tol, edge_min_max, mesh);
+  const std::pair edge_min_max{0.001, 0.5};
+  PMP::Adaptive_sizing_field sizing_field(tol, edge_min_max, mesh);
   unsigned int nb_iter = 5;
 
   PMP::isotropic_remeshing(

From 06db84f717720aafffdadea1c4e5286ebfe15505 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Mon, 3 Jul 2023 17:35:02 +0200
Subject: [PATCH 0558/1398] Fix sizing field calculation

---
 .../Adaptive_sizing_field.h                   | 44 +++++++++----------
 1 file changed, 22 insertions(+), 22 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index bbc33ee21630..4a343d5a22ff 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -58,8 +58,8 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                         , const std::pair<FT, FT>& edge_len_min_max
                         , PolygonMesh& pmesh)
     : tol(tol)
-    , m_sq_short(CGAL::square(edge_len_min_max.first))
-    , m_sq_long( CGAL::square(edge_len_min_max.second))
+    , m_short(edge_len_min_max.first)
+    , m_long(edge_len_min_max.second)
     , m_pmesh(pmesh)
   {
     m_vertex_sizing_map = get(Vertex_property_tag(), m_pmesh);
@@ -111,23 +111,23 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
 //      const Principal_curvatures vertex_curv = interpolated_corrected_principal_curvatures_and_directions_one_vertex(m_pmesh, v);
       const FT max_absolute_curv = CGAL::max(CGAL::abs(vertex_curv.max_curvature), CGAL::abs(vertex_curv.min_curvature));
       const FT vertex_size_sq = 6 * tol / max_absolute_curv - 3 * CGAL::square(tol);
-      if (vertex_size_sq > m_sq_long)
+      if (vertex_size_sq > CGAL::square(m_long))
       {
-        put(m_vertex_sizing_map, v, m_sq_long);
+        put(m_vertex_sizing_map, v, m_long);
 #ifdef CGAL_PMP_REMESHING_VERBOSE
         ++oversize;
 #endif
       }
-      else if (vertex_size_sq < m_sq_short)
+      else if (vertex_size_sq < CGAL::square(m_short))
       {
-        put(m_vertex_sizing_map, v, m_sq_short);
+        put(m_vertex_sizing_map, v, m_short);
 #ifdef CGAL_PMP_REMESHING_VERBOSE
         ++undersize;
 #endif
       }
       else
       {
-        put(m_vertex_sizing_map, v, vertex_size_sq);
+        put(m_vertex_sizing_map, v, CGAL::approximate_sqrt(vertex_size_sq));
 #ifdef CGAL_PMP_REMESHING_VERBOSE
         ++insize;
 #endif
@@ -143,11 +143,11 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   boost::optional<FT> is_too_long(const halfedge_descriptor h) const
   {
     const FT sqlen = sqlength(h);
-    FT sqtarg_len = CGAL::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
-                              get(m_vertex_sizing_map, target(h, m_pmesh)));
+    FT sqtarg_len = CGAL::square(4./3. * CGAL::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
+                                                   get(m_vertex_sizing_map, target(h, m_pmesh))));
     CGAL_assertion(get(m_vertex_sizing_map, source(h, m_pmesh)));
     CGAL_assertion(get(m_vertex_sizing_map, target(h, m_pmesh)));
-    if(sqlen > 16./9. * sqtarg_len)
+    if(sqlen > sqtarg_len)
       return sqlen;
     else
       return boost::none;
@@ -157,11 +157,11 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                                   const vertex_descriptor vb) const
   {
     const FT sqlen = sqlength(va, vb);
-    FT sqtarg_len = CGAL::min(get(m_vertex_sizing_map, va),
-                              get(m_vertex_sizing_map, vb));
+    FT sqtarg_len = CGAL::square(4./3. * CGAL::min(get(m_vertex_sizing_map, va),
+                                                   get(m_vertex_sizing_map, vb)));
     CGAL_assertion(get(m_vertex_sizing_map, va));
     CGAL_assertion(get(m_vertex_sizing_map, vb));
-    if (sqlen > 16./9. * sqtarg_len)
+    if (sqlen > sqtarg_len)
       return sqlen;
     else
       return boost::none;
@@ -170,11 +170,11 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   boost::optional<FT> is_too_short(const halfedge_descriptor h) const
   {
     const FT sqlen = sqlength(h);
-    FT sqtarg_len = CGAL::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
-                              get(m_vertex_sizing_map, target(h, m_pmesh)));
+    FT sqtarg_len = CGAL::square(4./5. * CGAL::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
+                                                   get(m_vertex_sizing_map, target(h, m_pmesh))));
     CGAL_assertion(get(m_vertex_sizing_map, source(h, m_pmesh)));
     CGAL_assertion(get(m_vertex_sizing_map, target(h, m_pmesh)));
-    if (sqlen < 16./25. * sqtarg_len)
+    if (sqlen < sqtarg_len)
       return sqlen;
     else
       return boost::none;
@@ -192,23 +192,23 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   {
     // calculating it as the average of two vertices on other ends
     // of halfedges as updating is done during an edge split
-    FT vertex_size_sq = 0;
+    FT vertex_size = 0;
     CGAL_assertion(CGAL::halfedges_around_target(v, m_pmesh).size() == 2);
     for (halfedge_descriptor ha: CGAL::halfedges_around_target(v, m_pmesh))
     {
-      vertex_size_sq += get(m_vertex_sizing_map, source(ha, m_pmesh));
+      vertex_size += get(m_vertex_sizing_map, source(ha, m_pmesh));
     }
-    vertex_size_sq /= CGAL::halfedges_around_target(v, m_pmesh).size();
+    vertex_size /= CGAL::halfedges_around_target(v, m_pmesh).size();
 
-    put(m_vertex_sizing_map, v, vertex_size_sq);
+    put(m_vertex_sizing_map, v, vertex_size);
   }
 
   //todo ip: is_protected_constraint_too_long() from PR
 
 private:
   const FT tol;
-  const FT m_sq_short;
-  const FT m_sq_long;
+  const FT m_short;
+  const FT m_long;
   PolygonMesh& m_pmesh;
   VertexSizingMap m_vertex_sizing_map;
 };

From 677bb04ee8c99035f4bc2f6dc40db9182fdd8e1a Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Wed, 5 Jul 2023 11:34:14 +0200
Subject: [PATCH 0559/1398] (WIP) figuring out FaceRange curvature calculation

---
 .../Adaptive_sizing_field.h                   | 70 ++++++++++---------
 .../CGAL/Polygon_mesh_processing/remesh.h     |  3 +-
 2 files changed, 40 insertions(+), 33 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 4a343d5a22ff..3cec50bdd17a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -37,33 +37,28 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   typedef typename Base::Point_3    Point_3;
   typedef typename Base::halfedge_descriptor halfedge_descriptor;
   typedef typename Base::vertex_descriptor   vertex_descriptor;
+  //todo ip: send this over to Sizing_field to be consistent
+  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
 
   typedef typename CGAL::dynamic_vertex_property_t<FT> Vertex_property_tag;
   typedef typename boost::property_map<PolygonMesh,
-                                       Vertex_property_tag>::type VertexSizingMap;
+                                       Vertex_property_tag>::type Vertex_sizing_map;
 
-  //todo ip: set a property map that can calculate curvature in one go. I think I'm generating constant maps (without put)
-  // try 1
   typedef Principal_curvatures_and_directions<K> Principal_curvatures;
-//  typedef Constant_property_map<vertex_descriptor, Principal_curvatures> Vertex_curvature_map;
-
-  // try 2
-  typedef Constant_property_map<vertex_descriptor, Principal_curvatures_and_directions<K>> Default_principal_map;
-  typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvatures_and_directions_map_t,
-                                                       parameters::Default_named_parameters,
-                                                       Default_principal_map>::type
-                                                         Vertex_curvature_map;
+  typedef typename CGAL::dynamic_vertex_property_t<Principal_curvatures> Vertex_curvature_tag;
+  typedef typename boost::property_map<CGAL::Face_filtered_graph<PolygonMesh>,
+                                       Vertex_curvature_tag>::type Vertex_curvature_map;
 
     Adaptive_sizing_field(const double tol
                         , const std::pair<FT, FT>& edge_len_min_max
                         , PolygonMesh& pmesh)
-    : tol(tol)
-    , m_short(edge_len_min_max.first)
-    , m_long(edge_len_min_max.second)
-    , m_pmesh(pmesh)
-  {
-    m_vertex_sizing_map = get(Vertex_property_tag(), m_pmesh);
-  }
+      : tol(tol)
+      , m_short(edge_len_min_max.first)
+      , m_long(edge_len_min_max.second)
+      , m_pmesh(pmesh)
+    {
+      m_vertex_sizing_map = get(Vertex_property_tag(), m_pmesh);
+    }
 
 private:
   FT sqlength(const vertex_descriptor va,
@@ -85,7 +80,8 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       return get(m_vertex_sizing_map, v);
     }
 
-  void calc_sizing_map()
+  template <typename FaceRange>
+  void calc_sizing_map(const FaceRange& faces)
   {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
     int oversize  = 0;
@@ -94,22 +90,32 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     std::cout << "Calculating sizing field..." << std::endl;
 #endif
 
-    //todo ip: how to make this work?
-//    Vertex_curvature_map vertex_curvature_map;
+    ////// IP: How to sort this out?
+    ///// FaceRange->expand->Face_filtered_graph->use ffg onwards
+//    CGAL::make_boolean_property_map(faces); // IP: this does not compile
+    std::vector<face_descriptor> selection;
+    auto is_selected = get(CGAL::dynamic_face_property_t<bool>(), m_pmesh);
+    for (face_descriptor f : faces)
+      put(is_selected, f, false);
+
+    CGAL::expand_face_selection(selection, m_pmesh, 1, is_selected, std::back_inserter(selection));
+    // IP: expand_face_selection is not happy with ffg either
+
+    CGAL::Face_filtered_graph<PolygonMesh> ffg(m_pmesh, selection);
+    ///////
+
+    Vertex_curvature_map vertex_curvature_map;
+    vertex_curvature_map = get(Vertex_curvature_tag(), ffg);
 
-    //todo ip: temp workaround
-    auto vertex_curvature_map =
-      m_pmesh.template add_property_map<vertex_descriptor,Principal_curvatures_and_directions<K>>("v:curvature_map").first;
-    interpolated_corrected_principal_curvatures_and_directions(m_pmesh
-                                                               , vertex_curvature_map);
+    interpolated_corrected_principal_curvatures_and_directions(ffg
+                                                             , vertex_curvature_map);
 
-    // calculate square vertex sizing field (L(x_i))^2 from curvature field
-    for(vertex_descriptor v : vertices(m_pmesh))
+    // calculate vertex sizing field L(x_i) from curvature field
+    for(vertex_descriptor v : vertices(ffg))
     {
       auto vertex_curv = get(vertex_curvature_map, v);
-      //todo ip: alt solution - calculate curvature per vertex
-//      const Principal_curvatures vertex_curv = interpolated_corrected_principal_curvatures_and_directions_one_vertex(m_pmesh, v);
-      const FT max_absolute_curv = CGAL::max(CGAL::abs(vertex_curv.max_curvature), CGAL::abs(vertex_curv.min_curvature));
+      const FT max_absolute_curv = CGAL::max(CGAL::abs(vertex_curv.max_curvature)
+                                           , CGAL::abs(vertex_curv.min_curvature));
       const FT vertex_size_sq = 6 * tol / max_absolute_curv - 3 * CGAL::square(tol);
       if (vertex_size_sq > CGAL::square(m_long))
       {
@@ -210,7 +216,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   const FT m_short;
   const FT m_long;
   PolygonMesh& m_pmesh;
-  VertexSizingMap m_vertex_sizing_map;
+  Vertex_sizing_map m_vertex_sizing_map;
 };
 
 }//end namespace Polygon_mesh_processing
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index e751a294445c..0ea55b8bb59b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -334,8 +334,9 @@ void isotropic_remeshing(const FaceRange& faces
   t.reset(); t.start();
 #endif
 
+  //todo ip: move calc_sizing_map to the sizing function constructor
   if constexpr (!std::is_same<SizingFunction, Uniform_sizing_field<PM>>::value)
-    sizing.calc_sizing_map();
+    sizing.calc_sizing_map(faces);
 
   for (unsigned int i = 0; i < nb_iterations; ++i)
   {

From 63e31805175af4407b7776ed0dcfcbfa66b7b484 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 5 Jul 2023 13:10:28 +0200
Subject: [PATCH 0560/1398] use vector option for selection

---
 .../Isotropic_remeshing/Adaptive_sizing_field.h        | 10 +++-------
 1 file changed, 3 insertions(+), 7 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 3cec50bdd17a..91524857764d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -81,7 +81,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     }
 
   template <typename FaceRange>
-  void calc_sizing_map(const FaceRange& faces)
+  void calc_sizing_map(const FaceRange& faces_)
   {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
     int oversize  = 0;
@@ -90,16 +90,12 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     std::cout << "Calculating sizing field..." << std::endl;
 #endif
 
-    ////// IP: How to sort this out?
     ///// FaceRange->expand->Face_filtered_graph->use ffg onwards
-//    CGAL::make_boolean_property_map(faces); // IP: this does not compile
-    std::vector<face_descriptor> selection;
+    std::vector<face_descriptor> selection(faces_.begin(), faces_.end());
     auto is_selected = get(CGAL::dynamic_face_property_t<bool>(), m_pmesh);
-    for (face_descriptor f : faces)
+    for (face_descriptor f : faces(m_pmesh))
       put(is_selected, f, false);
-
     CGAL::expand_face_selection(selection, m_pmesh, 1, is_selected, std::back_inserter(selection));
-    // IP: expand_face_selection is not happy with ffg either
 
     CGAL::Face_filtered_graph<PolygonMesh> ffg(m_pmesh, selection);
     ///////

From 4a5283b22e5ec0b0dcfd4f085d1087ee104cd527 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Wed, 5 Jul 2023 20:29:59 +0200
Subject: [PATCH 0561/1398] Change selection option to set

---
 .../Adaptive_sizing_field.h                   | 23 +++++++------------
 .../Isotropic_remeshing/Sizing_field.h        |  1 +
 2 files changed, 9 insertions(+), 15 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 91524857764d..450bb4c1ea4d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -35,10 +35,9 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   typedef typename Base::K          K;
   typedef typename Base::FT         FT;
   typedef typename Base::Point_3    Point_3;
+  typedef typename Base::face_descriptor     face_descriptor;
   typedef typename Base::halfedge_descriptor halfedge_descriptor;
   typedef typename Base::vertex_descriptor   vertex_descriptor;
-  //todo ip: send this over to Sizing_field to be consistent
-  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
 
   typedef typename CGAL::dynamic_vertex_property_t<FT> Vertex_property_tag;
   typedef typename boost::property_map<PolygonMesh,
@@ -81,7 +80,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     }
 
   template <typename FaceRange>
-  void calc_sizing_map(const FaceRange& faces_)
+  void calc_sizing_map(const FaceRange& face_range)
   {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
     int oversize  = 0;
@@ -90,22 +89,16 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     std::cout << "Calculating sizing field..." << std::endl;
 #endif
 
-    ///// FaceRange->expand->Face_filtered_graph->use ffg onwards
-    std::vector<face_descriptor> selection(faces_.begin(), faces_.end());
-    auto is_selected = get(CGAL::dynamic_face_property_t<bool>(), m_pmesh);
-    for (face_descriptor f : faces(m_pmesh))
-      put(is_selected, f, false);
-    CGAL::expand_face_selection(selection, m_pmesh, 1, is_selected, std::back_inserter(selection));
-
+    // expand face selection for curvature calculation
+    std::set<face_descriptor> selection(face_range.begin(), face_range.end());
+    CGAL::expand_face_selection(selection, m_pmesh, 1
+                              , make_boolean_property_map(selection), Emptyset_iterator());
     CGAL::Face_filtered_graph<PolygonMesh> ffg(m_pmesh, selection);
-    ///////
-
-    Vertex_curvature_map vertex_curvature_map;
-    vertex_curvature_map = get(Vertex_curvature_tag(), ffg);
 
+    // calculate curvature
+    Vertex_curvature_map vertex_curvature_map = get(Vertex_curvature_tag(), ffg);
     interpolated_corrected_principal_curvatures_and_directions(ffg
                                                              , vertex_curvature_map);
-
     // calculate vertex sizing field L(x_i) from curvature field
     for(vertex_descriptor v : vertices(ffg))
     {
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
index 359a9fc6b562..3640e14c092d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
@@ -33,6 +33,7 @@ class Sizing_field
 
 public:
   typedef typename CGAL::Kernel_traits<Point>::Kernel K;
+  typedef typename boost::graph_traits<PM>::face_descriptor     face_descriptor;
   typedef typename boost::graph_traits<PM>::halfedge_descriptor halfedge_descriptor;
   typedef typename boost::graph_traits<PM>::vertex_descriptor   vertex_descriptor;
   typedef Point                                                 Point_3;

From a61ebb545e5076d0b291ebc9d5f6a50d64bf0516 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Thu, 6 Jul 2023 22:35:33 +0200
Subject: [PATCH 0562/1398] Change face subset back to working example with
 vector

---
 .../internal/Isotropic_remeshing/Adaptive_sizing_field.h | 9 ++++++---
 1 file changed, 6 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 450bb4c1ea4d..0471f4fd3c0b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -90,16 +90,19 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
 #endif
 
     // expand face selection for curvature calculation
-    std::set<face_descriptor> selection(face_range.begin(), face_range.end());
+    std::vector<face_descriptor> selection(face_range.begin(), face_range.end());
+    auto is_selected = get(CGAL::dynamic_face_property_t<bool>(), m_pmesh);
+    for (face_descriptor f : faces(m_pmesh)) put(is_selected, f, false);
+    for (face_descriptor f : face_range)  put(is_selected, f, true);
     CGAL::expand_face_selection(selection, m_pmesh, 1
-                              , make_boolean_property_map(selection), Emptyset_iterator());
+                              , is_selected, std::back_inserter(selection));
     CGAL::Face_filtered_graph<PolygonMesh> ffg(m_pmesh, selection);
 
     // calculate curvature
     Vertex_curvature_map vertex_curvature_map = get(Vertex_curvature_tag(), ffg);
     interpolated_corrected_principal_curvatures_and_directions(ffg
                                                              , vertex_curvature_map);
-    // calculate vertex sizing field L(x_i) from curvature field
+    // calculate vertex sizing field L(x_i) from the curvature field
     for(vertex_descriptor v : vertices(ffg))
     {
       auto vertex_curv = get(vertex_curvature_map, v);

From 99661dfd73bd7c25d1f21cef339532830c1e8cd0 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 7 Jul 2023 18:33:03 +0200
Subject: [PATCH 0563/1398] Choose betwen curvature calc for selection and
 whole mesh

---
 .../Adaptive_sizing_field.h                   | 43 ++++++++++++-------
 1 file changed, 28 insertions(+), 15 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 0471f4fd3c0b..0e34893d7ef4 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -81,6 +81,29 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
 
   template <typename FaceRange>
   void calc_sizing_map(const FaceRange& face_range)
+  {
+    if (face_range.size() == faces(m_pmesh).size())
+    {
+      // calculate curvature from the whole mesh
+      calc_sizing_map(m_pmesh);
+    }
+    else
+    {
+      // expand face selection and calculate curvature from it
+      std::vector<face_descriptor> selection(face_range.begin(), face_range.end());
+      auto is_selected = get(CGAL::dynamic_face_property_t<bool>(), m_pmesh);
+      for (face_descriptor f : faces(m_pmesh)) put(is_selected, f, false);
+      for (face_descriptor f : face_range)  put(is_selected, f, true);
+      CGAL::expand_face_selection(selection, m_pmesh, 1
+                                , is_selected, std::back_inserter(selection));
+      CGAL::Face_filtered_graph<PolygonMesh> ffg(m_pmesh, selection);
+
+      calc_sizing_map(ffg);
+    }
+  }
+
+  template <typename FaceGraph>
+  void calc_sizing_map(FaceGraph& face_graph)
   {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
     int oversize  = 0;
@@ -89,21 +112,11 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     std::cout << "Calculating sizing field..." << std::endl;
 #endif
 
-    // expand face selection for curvature calculation
-    std::vector<face_descriptor> selection(face_range.begin(), face_range.end());
-    auto is_selected = get(CGAL::dynamic_face_property_t<bool>(), m_pmesh);
-    for (face_descriptor f : faces(m_pmesh)) put(is_selected, f, false);
-    for (face_descriptor f : face_range)  put(is_selected, f, true);
-    CGAL::expand_face_selection(selection, m_pmesh, 1
-                              , is_selected, std::back_inserter(selection));
-    CGAL::Face_filtered_graph<PolygonMesh> ffg(m_pmesh, selection);
-
-    // calculate curvature
-    Vertex_curvature_map vertex_curvature_map = get(Vertex_curvature_tag(), ffg);
-    interpolated_corrected_principal_curvatures_and_directions(ffg
+    Vertex_curvature_map vertex_curvature_map = get(Vertex_curvature_tag(), face_graph);
+    interpolated_corrected_principal_curvatures_and_directions(face_graph
                                                              , vertex_curvature_map);
     // calculate vertex sizing field L(x_i) from the curvature field
-    for(vertex_descriptor v : vertices(ffg))
+    for(vertex_descriptor v : vertices(face_graph))
     {
       auto vertex_curv = get(vertex_curvature_map, v);
       const FT max_absolute_curv = CGAL::max(CGAL::abs(vertex_curv.max_curvature)
@@ -133,8 +146,8 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     }
 #ifdef CGAL_PMP_REMESHING_VERBOSE
     std::cout << " done (" << insize    << " from curvature, "
-                          << oversize  << " set to max, "
-                          << undersize << " set to min)" << std::endl;
+              << oversize  << " set to max, "
+              << undersize << " set to min)" << std::endl;
 #endif
   }
 

From 573cc53e0a32147dbdd48486b9c4c9b53f6934df Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Mon, 10 Jul 2023 21:28:06 +0200
Subject: [PATCH 0564/1398] Move curvature map typedef to function

---
 .../Adaptive_sizing_field.h                   | 32 +++++++++----------
 1 file changed, 16 insertions(+), 16 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 0e34893d7ef4..071bc761414a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -43,21 +43,16 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   typedef typename boost::property_map<PolygonMesh,
                                        Vertex_property_tag>::type Vertex_sizing_map;
 
-  typedef Principal_curvatures_and_directions<K> Principal_curvatures;
-  typedef typename CGAL::dynamic_vertex_property_t<Principal_curvatures> Vertex_curvature_tag;
-  typedef typename boost::property_map<CGAL::Face_filtered_graph<PolygonMesh>,
-                                       Vertex_curvature_tag>::type Vertex_curvature_map;
-
-    Adaptive_sizing_field(const double tol
-                        , const std::pair<FT, FT>& edge_len_min_max
-                        , PolygonMesh& pmesh)
-      : tol(tol)
-      , m_short(edge_len_min_max.first)
-      , m_long(edge_len_min_max.second)
-      , m_pmesh(pmesh)
-    {
-      m_vertex_sizing_map = get(Vertex_property_tag(), m_pmesh);
-    }
+  Adaptive_sizing_field(const double tol
+                      , const std::pair<FT, FT>& edge_len_min_max
+                      , PolygonMesh& pmesh)
+    : tol(tol)
+    , m_short(edge_len_min_max.first)
+    , m_long(edge_len_min_max.second)
+    , m_pmesh(pmesh)
+  {
+    m_vertex_sizing_map = get(Vertex_property_tag(), m_pmesh);
+  }
 
 private:
   FT sqlength(const vertex_descriptor va,
@@ -105,6 +100,11 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   template <typename FaceGraph>
   void calc_sizing_map(FaceGraph& face_graph)
   {
+    typedef Principal_curvatures_and_directions<K> Principal_curvatures;
+    typedef typename CGAL::dynamic_vertex_property_t<Principal_curvatures> Vertex_curvature_tag;
+    typedef typename boost::property_map<FaceGraph,
+      Vertex_curvature_tag>::type Vertex_curvature_map;
+
 #ifdef CGAL_PMP_REMESHING_VERBOSE
     int oversize  = 0;
     int undersize = 0;
@@ -145,7 +145,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       }
     }
 #ifdef CGAL_PMP_REMESHING_VERBOSE
-    std::cout << " done (" << insize    << " from curvature, "
+    std::cout << " done (" << insize << " from curvature, "
               << oversize  << " set to max, "
               << undersize << " set to min)" << std::endl;
 #endif

From 1c597a07cf5ad07742f1246f4a20bb05e5a8199b Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 11 Jul 2023 09:33:37 +0200
Subject: [PATCH 0565/1398] Move sizing map calculation to constructor

---
 ...sotropic_remeshing_with_sizing_example.cpp |  2 +-
 .../Adaptive_sizing_field.h                   | 69 ++++++++++++-------
 .../Isotropic_remeshing/remesh_impl.h         |  2 +-
 .../CGAL/Polygon_mesh_processing/remesh.h     |  6 --
 .../PMP/Isotropic_remeshing_plugin.cpp        |  4 ++
 5 files changed, 51 insertions(+), 32 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index bbb86c89692c..e0564d27178d 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -28,7 +28,7 @@ int main(int argc, char* argv[])
 
   const double tol = 0.001;
   const std::pair edge_min_max{0.001, 0.5};
-  PMP::Adaptive_sizing_field sizing_field(tol, edge_min_max, mesh);
+  PMP::Adaptive_sizing_field sizing_field(tol, edge_min_max, faces(mesh), mesh);
   unsigned int nb_iter = 5;
 
   PMP::isotropic_remeshing(
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index 071bc761414a..dc14ae91d119 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -43,8 +43,10 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   typedef typename boost::property_map<PolygonMesh,
                                        Vertex_property_tag>::type Vertex_sizing_map;
 
+  template <typename FaceRange>
   Adaptive_sizing_field(const double tol
                       , const std::pair<FT, FT>& edge_len_min_max
+                      , const FaceRange& face_range
                       , PolygonMesh& pmesh)
     : tol(tol)
     , m_short(edge_len_min_max.first)
@@ -52,31 +54,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     , m_pmesh(pmesh)
   {
     m_vertex_sizing_map = get(Vertex_property_tag(), m_pmesh);
-  }
-
-private:
-  FT sqlength(const vertex_descriptor va,
-              const vertex_descriptor vb) const
-  {
-    typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
-      vpmap = get(CGAL::vertex_point, m_pmesh);
-    return FT(CGAL::squared_distance(get(vpmap, va), get(vpmap, vb)));
-  }
-
-  FT sqlength(const halfedge_descriptor& h) const
-  {
-    return sqlength(target(h, m_pmesh), source(h, m_pmesh));
-  }
-
-public:
-  FT get_sizing(const vertex_descriptor v) const {
-      CGAL_assertion(get(m_vertex_sizing_map, v));
-      return get(m_vertex_sizing_map, v);
-    }
 
-  template <typename FaceRange>
-  void calc_sizing_map(const FaceRange& face_range)
-  {
     if (face_range.size() == faces(m_pmesh).size())
     {
       // calculate curvature from the whole mesh
@@ -97,6 +75,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     }
   }
 
+private:
   template <typename FaceGraph>
   void calc_sizing_map(FaceGraph& face_graph)
   {
@@ -151,6 +130,48 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
 #endif
   }
 
+  FT sqlength(const vertex_descriptor va,
+              const vertex_descriptor vb) const
+  {
+    typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
+      vpmap = get(CGAL::vertex_point, m_pmesh);
+    return FT(CGAL::squared_distance(get(vpmap, va), get(vpmap, vb)));
+  }
+
+  FT sqlength(const halfedge_descriptor& h) const
+  {
+    return sqlength(target(h, m_pmesh), source(h, m_pmesh));
+  }
+
+public:
+  FT get_sizing(const vertex_descriptor v) const {
+      CGAL_assertion(get(m_vertex_sizing_map, v));
+      return get(m_vertex_sizing_map, v);
+    }
+
+  template <typename FaceRange>
+  void calc_sizing_map(const FaceRange& face_range)
+  {
+    if (face_range.size() == faces(m_pmesh).size())
+    {
+      // calculate curvature from the whole mesh
+      calc_sizing_map(m_pmesh);
+    }
+    else
+    {
+      // expand face selection and calculate curvature from it
+      std::vector<face_descriptor> selection(face_range.begin(), face_range.end());
+      auto is_selected = get(CGAL::dynamic_face_property_t<bool>(), m_pmesh);
+      for (face_descriptor f : faces(m_pmesh)) put(is_selected, f, false);
+      for (face_descriptor f : face_range)  put(is_selected, f, true);
+      CGAL::expand_face_selection(selection, m_pmesh, 1
+                                , is_selected, std::back_inserter(selection));
+      CGAL::Face_filtered_graph<PolygonMesh> ffg(m_pmesh, selection);
+
+      calc_sizing_map(ffg);
+    }
+  }
+
   boost::optional<FT> is_too_long(const halfedge_descriptor h) const
   {
     const FT sqlen = sqlength(h);
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index aec9ca3b5d93..0e772b47cb58 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -553,7 +553,7 @@ namespace internal {
         halfedge_added(hnew_opp, status(opposite(he, mesh_)));
 
         //todo ip-add: already updating sizing here because of is_too_long checks below
-        if constexpr (!std::is_same<SizingFunction, Uniform_sizing_field<PM>>::value)
+        if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM>>)
           sizing.update_sizing_map(vnew);
 
         //check sub-edges
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 0ea55b8bb59b..ec443f179e58 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -334,18 +334,12 @@ void isotropic_remeshing(const FaceRange& faces
   t.reset(); t.start();
 #endif
 
-  //todo ip: move calc_sizing_map to the sizing function constructor
-  if constexpr (!std::is_same<SizingFunction, Uniform_sizing_field<PM>>::value)
-    sizing.calc_sizing_map(faces);
-
   for (unsigned int i = 0; i < nb_iterations; ++i)
   {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
     std::cout << " * Iteration " << (i + 1) << " *" << std::endl;
 #endif
 
-//    if (i < 2)
-//      sizing.calc_sizing_map();
     if(do_split)
      remesher.split_long_edges(sizing);
     if(do_collapse)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 813434a4c6ca..679d2518666d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -491,6 +491,7 @@ public Q_SLOTS:
                 std::pair<double, double> edge_min_max{min_length, max_length};
                 PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol
                                                                , edge_min_max
+                                                               , faces(*selection_item->polyhedron())
                                                                , *selection_item->polyhedron());
                 if (fpmap_valid)
                   CGAL::Polygon_mesh_processing::isotropic_remeshing(faces(*selection_item->polyhedron())
@@ -573,6 +574,7 @@ public Q_SLOTS:
                 std::pair<double, double> edge_min_max{min_length, max_length};
                 PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol
                                                                , edge_min_max
+                                                               , faces(*selection_item->polyhedron())
                                                                , *selection_item->polyhedron());
                 if (fpmap_valid)
                   CGAL::Polygon_mesh_processing::isotropic_remeshing(selection_item->selected_facets
@@ -732,6 +734,7 @@ public Q_SLOTS:
             std::pair<double, double> edge_min_max{min_length, max_length};
             PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol
                     , edge_min_max
+                    , faces(*poly_item->polyhedron())
                     , *poly_item->polyhedron());
             if (fpmap_valid)
             CGAL::Polygon_mesh_processing::isotropic_remeshing(
@@ -985,6 +988,7 @@ public Q_SLOTS:
           std::pair<double, double> edge_min_max{min_length_, max_length_};
           PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol_
                                                          , edge_min_max
+                                                         , faces(*poly_item->polyhedron())
                                                          , *poly_item->polyhedron());
           CGAL::Polygon_mesh_processing::isotropic_remeshing(
               faces(*poly_item->polyhedron())

From cc0c46c7ef331af28422e37de79785473ceb8052 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 11 Jul 2023 10:08:21 +0200
Subject: [PATCH 0566/1398] Fix polyhedron demo with TBB

---
 .../Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp   | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 679d2518666d..86d7844949a3 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -890,7 +890,11 @@ public Q_SLOTS:
       tbb::parallel_for(
         tbb::blocked_range<std::size_t>(0, selection.size()),
         Remesh_polyhedron_item_for_parallel_for<Remesh_polyhedron_item>(
-                                                                        selection, edges_to_protect, edges_only, target_length, nb_iter, protect, smooth_features));
+                                                                        selection, edges_to_protect, edges_only
+                                                                      , edge_sizing_type, target_length, error_tol
+                                                                      , min_length , max_length, nb_iter
+                                                                      , protect, smooth_features)
+                                                                        );
 
     total_time = time.elapsed();
 

From 4b1b04eb8d3542b3846e6d0bf091b34e3fff6173 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 1 Aug 2023 11:09:28 +0200
Subject: [PATCH 0567/1398] fix compilation

---
 .../Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 86d7844949a3..406c032f6feb 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -489,7 +489,7 @@ public Q_SLOTS:
               else if (edge_sizing_type == 1)
               {
                 std::pair<double, double> edge_min_max{min_length, max_length};
-                PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol
+                PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol
                                                                , edge_min_max
                                                                , faces(*selection_item->polyhedron())
                                                                , *selection_item->polyhedron());
@@ -572,7 +572,7 @@ public Q_SLOTS:
               else if (edge_sizing_type == 1)
               {
                 std::pair<double, double> edge_min_max{min_length, max_length};
-                PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol
+                PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol
                                                                , edge_min_max
                                                                , faces(*selection_item->polyhedron())
                                                                , *selection_item->polyhedron());
@@ -732,7 +732,7 @@ public Q_SLOTS:
           else if (edge_sizing_type == 1)
           {
             std::pair<double, double> edge_min_max{min_length, max_length};
-            PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol
+            PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol
                     , edge_min_max
                     , faces(*poly_item->polyhedron())
                     , *poly_item->polyhedron());
@@ -990,7 +990,7 @@ public Q_SLOTS:
         else
         {
           std::pair<double, double> edge_min_max{min_length_, max_length_};
-          PMP::Adaptive_sizing_field adaptive_sizing_field(error_tol_
+          PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol_
                                                          , edge_min_max
                                                          , faces(*poly_item->polyhedron())
                                                          , *poly_item->polyhedron());

From 2e04088d1f2ddbd26a9d5189a1c187259242ccbb Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Tue, 1 Aug 2023 18:22:12 +0200
Subject: [PATCH 0568/1398] cgal_create_release_with_cmake.cmake: only call Git
 one

---
 .../cgal_create_release_with_cmake.cmake       | 18 +++++++++++-------
 1 file changed, 11 insertions(+), 7 deletions(-)

diff --git a/Scripts/developer_scripts/cgal_create_release_with_cmake.cmake b/Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
index de8dcfa35d41..2443c61aad54 100644
--- a/Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
+++ b/Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
@@ -41,13 +41,8 @@ function(process_package pkg)
       if ("${fext}" STREQUAL ".h" OR "${fext}" STREQUAL ".hpp")
         file(READ "${pkg_dir}/${f}" file_content)
         string(REPLACE "$URL$" "$URL: ${GITHUB_PREFIX}/${pkg}/${f} $" file_content "${file_content}")
-        if(EXISTS ${GIT_REPO}/.git)
-          execute_process(
-            COMMAND git --git-dir=${GIT_REPO}/.git --work-tree=${GIT_REPO} log -n1 "--format=format:%h %aI %an" -- "${pkg}/${f}"
-            RESULT_VARIABLE RESULT_VAR
-            OUTPUT_VARIABLE OUT_VAR
-            )
-          string(REPLACE "$Id$" "$Id: ${fname} ${OUT_VAR}" file_content "${file_content}")
+        if(GIT_HASH)
+          string(REPLACE "$Id$" "$Id: ${f} ${GIT_HASH} $" file_content "${file_content}")
         else()
           string(REPLACE "$Id$" "This file is from the release ${CGAL_VERSION} of CGAL" file_content "${file_content}")
         endif()
@@ -74,6 +69,15 @@ if (NOT GIT_REPO)
   set(GIT_REPO ${CMAKE_BINARY_DIR})
 endif()
 
+if(EXISTS ${GIT_REPO}/.git)
+  execute_process(
+    COMMAND git --git-dir=${GIT_REPO}/.git --work-tree=${GIT_REPO} log -n1 "--format=format:%h"
+    RESULT_VARIABLE RESULT_VAR
+    OUTPUT_VARIABLE GIT_HASH
+    )
+  string(REPLACE "$Id$" "$Id: ${fname} ${OUT_VAR}$" file_content "${file_content}")
+endif()
+
 if (NOT EXISTS ${GIT_REPO}/Installation/include/CGAL/version.h)
   message(FATAL_ERROR "Cannot find Installation/include/CGAL/version.h. Make sure you are at the root of a CGAL branch")
 endif()

From 1f61a84e495f62b71570ad5962411adf4680eb54 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 2 Aug 2023 10:30:05 +0200
Subject: [PATCH 0569/1398] add demo plugin that support refinement of one or
 several items (soup or mesh)

---
 .../Polyhedron/Plugins/PMP/CMakeLists.txt     |   6 +-
 .../Plugins/PMP/Repair_polyhedron_plugin.cpp  | 105 +++++++++++++++++-
 2 files changed, 105 insertions(+), 6 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
index 152d84952ae7..658458acaadf 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
@@ -119,7 +119,11 @@ target_link_libraries(
 
 qt5_wrap_ui( repairUI_FILES RemoveNeedlesDialog.ui SelfSnapDialog.ui)
 polyhedron_demo_plugin(repair_polyhedron_plugin Repair_polyhedron_plugin  ${repairUI_FILES} KEYWORDS PMP)
-target_link_libraries(repair_polyhedron_plugin PUBLIC scene_points_with_normal_item scene_surface_mesh_item)
+target_link_libraries(repair_polyhedron_plugin PUBLIC scene_points_with_normal_item scene_surface_mesh_item scene_polygon_soup_item)
+if(TARGET CGAL::TBB_support)
+  target_link_libraries(repair_polyhedron_plugin PUBLIC CGAL::TBB_support)
+endif()
+
 
 qt5_wrap_ui(isotropicRemeshingUI_FILES Isotropic_remeshing_dialog.ui)
 polyhedron_demo_plugin(isotropic_remeshing_plugin Isotropic_remeshing_plugin
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
index 5ecc8921433e..dd4acb434272 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
@@ -1,6 +1,7 @@
 #include <QtCore/qglobal.h>
 
 #include "Scene_surface_mesh_item.h"
+#include "Scene_polygon_soup_item.h"
 #include "Scene_points_with_normal_item.h"
 #include <CGAL/Three/Scene_interface.h>
 #include <CGAL/Three/Polyhedron_demo_plugin_interface.h>
@@ -19,6 +20,8 @@
 #include <CGAL/Polygon_mesh_processing/repair_degeneracies.h>
 #include <CGAL/Polygon_mesh_processing/merge_border_vertices.h>
 #include <CGAL/Polygon_mesh_processing/internal/Snapping/snap.h>
+#include <CGAL/Polygon_mesh_processing/autorefinement.h>
+#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
 
 #include "ui_RemoveNeedlesDialog.h"
 #include "ui_SelfSnapDialog.h"
@@ -52,8 +55,9 @@ class Polyhedron_demo_repair_polyhedron_plugin :
     actionDuplicateNMVertices = new QAction(tr("Duplicate Non-Manifold Vertices"), mw);
     actionExtractNMVertices = new QAction(tr("Extract Non-Manifold Vertices"), mw);
     actionMergeDuplicatedVerticesOnBoundaryCycles = new QAction(tr("Merge Duplicated Vertices on Boundary Cycles"), mw);
-    actionAutorefine = new QAction(tr("Autorefine Mesh"), mw);
-    actionAutorefineAndRMSelfIntersections = new QAction(tr("Autorefine and Remove Self-Intersections"), mw);
+    actionAutorefine = new QAction(tr("Autorefine Mesh (Deprecated)"), mw);
+    actionNewAutorefine = new QAction(tr("Autorefine"), mw);
+    actionAutorefineAndRMSelfIntersections = new QAction(tr("Autorefine and Remove Self-Intersections (Deprecated)"), mw);
     actionRemoveNeedlesAndCaps = new QAction(tr("Remove Needles And Caps"));
     actionSnapBorders = new QAction(tr("Snap Boundaries"));
 
@@ -65,6 +69,7 @@ class Polyhedron_demo_repair_polyhedron_plugin :
     actionExtractNMVertices->setObjectName("actionExtractNMVertices");
     actionMergeDuplicatedVerticesOnBoundaryCycles->setObjectName("actionMergeDuplicatedVerticesOnBoundaryCycles");
     actionAutorefine->setObjectName("actionAutorefine");
+    actionNewAutorefine->setObjectName("actionNewAutorefine");
     actionAutorefineAndRMSelfIntersections->setObjectName("actionAutorefineAndRMSelfIntersections");
     actionRemoveNeedlesAndCaps->setObjectName("actionRemoveNeedlesAndCaps");
     actionSnapBorders->setObjectName("actionSnapBorders");
@@ -77,6 +82,7 @@ class Polyhedron_demo_repair_polyhedron_plugin :
     actionExtractNMVertices->setProperty("subMenuName", "Polygon Mesh Processing/Repair");
     actionMergeDuplicatedVerticesOnBoundaryCycles->setProperty("subMenuName", "Polygon Mesh Processing/Repair");
     actionAutorefine->setProperty("subMenuName", "Polygon Mesh Processing/Repair/Experimental");
+    actionNewAutorefine->setProperty("subMenuName", "Polygon Mesh Processing/Repair");
     actionAutorefineAndRMSelfIntersections->setProperty("subMenuName", "Polygon Mesh Processing/Repair/Experimental");
     actionSnapBorders->setProperty("subMenuName", "Polygon Mesh Processing/Repair/Experimental");
 
@@ -93,16 +99,29 @@ class Polyhedron_demo_repair_polyhedron_plugin :
                              << actionExtractNMVertices
                              << actionMergeDuplicatedVerticesOnBoundaryCycles
                              << actionAutorefine
+                             << actionNewAutorefine
                              << actionAutorefineAndRMSelfIntersections
                              << actionRemoveNeedlesAndCaps
                              << actionSnapBorders;
   }
 
-  bool applicable(QAction*) const
+  bool applicable(QAction* action) const
   {
-    int item_id = scene->mainSelectionIndex();
-    return qobject_cast<Scene_surface_mesh_item*>(scene->item(item_id));
+    if (action!=actionNewAutorefine)
+    {
+      int item_id = scene->mainSelectionIndex();
+      return qobject_cast<Scene_surface_mesh_item*>(scene->item(item_id));
+    }
+    for (Scene_interface::Item_id index : scene->selectionIndices())
+    {
+      if (qobject_cast<Scene_surface_mesh_item*>(scene->item(index)))
+        return true;
+      if (qobject_cast<Scene_polygon_soup_item*>(scene->item(index)))
+        return true;
+    }
+    return false;
   }
+
   template <typename Item>
   void on_actionRemoveIsolatedVertices_triggered(Scene_interface::Item_id index);
   template <typename Item>
@@ -120,6 +139,8 @@ class Polyhedron_demo_repair_polyhedron_plugin :
   template <typename Item>
   void on_actionAutorefine_triggered(Scene_interface::Item_id index);
   template <typename Item>
+  void on_actionNewAutorefine_triggered(const std::vector<Scene_interface::Item_id>& indices);
+  template <typename Item>
   void on_actionAutorefineAndRMSelfIntersections_triggered(Scene_interface::Item_id index);
 
 public Q_SLOTS:
@@ -131,6 +152,7 @@ public Q_SLOTS:
   void on_actionExtractNMVertices_triggered();
   void on_actionMergeDuplicatedVerticesOnBoundaryCycles_triggered();
   void on_actionAutorefine_triggered();
+  void on_actionNewAutorefine_triggered();
   void on_actionAutorefineAndRMSelfIntersections_triggered();
   void on_actionRemoveNeedlesAndCaps_triggered();
   void on_actionSnapBorders_triggered();
@@ -144,6 +166,7 @@ public Q_SLOTS:
   QAction* actionExtractNMVertices;
   QAction* actionMergeDuplicatedVerticesOnBoundaryCycles;
   QAction* actionAutorefine;
+  QAction* actionNewAutorefine;
   QAction* actionAutorefineAndRMSelfIntersections;
   QAction* actionRemoveNeedlesAndCaps;
   QAction* actionSnapBorders;
@@ -421,6 +444,78 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionAutorefine_triggered()
   QApplication::restoreOverrideCursor();
 }
 
+template <typename Item>
+void Polyhedron_demo_repair_polyhedron_plugin::on_actionNewAutorefine_triggered(const std::vector<Scene_interface::Item_id>& indices)
+{
+  namespace PMP = CGAL::Polygon_mesh_processing;
+  Polygon_soup::Points points;
+  Polygon_soup::Polygons polygons;
+
+  if (indices.size()==1)
+  {
+    if (Scene_surface_mesh_item* smi_ptr = qobject_cast<Scene_surface_mesh_item*>(scene->item(indices[0])))
+      PMP::polygon_mesh_to_polygon_soup(*smi_ptr->polyhedron(), points, polygons);
+    else if (Scene_polygon_soup_item* spi_ptr = qobject_cast<Scene_polygon_soup_item*>(scene->item(indices[0])))
+    {
+      points = spi_ptr->points();
+      polygons = spi_ptr->polygons();
+    }
+  }
+  else
+  {
+    for (Scene_interface::Item_id id : indices)
+    {
+      Polygon_soup::Points l_points;
+      Polygon_soup::Polygons l_polygons;
+
+      if (Scene_surface_mesh_item* smi_ptr = qobject_cast<Scene_surface_mesh_item*>(scene->item(id)))
+        PMP::polygon_mesh_to_polygon_soup(*smi_ptr->polyhedron(), l_points, l_polygons);
+      else if (Scene_polygon_soup_item* spi_ptr = qobject_cast<Scene_polygon_soup_item*>(scene->item(id)))
+      {
+        l_points = spi_ptr->points();
+        l_polygons = spi_ptr->polygons();
+      }
+      std::size_t offset=points.size();
+      points.insert(points.end(), l_points.begin(), l_points.end());
+      std::size_t psize=polygons.size();
+      polygons.insert(polygons.end(), l_polygons.begin(), l_polygons.end());
+      for (std::size_t i=psize; i<polygons.size(); ++i)
+        for(std::size_t& id : polygons[i])
+          id+=offset;
+    }
+  }
+
+  PMP::triangulate_polygons(points, polygons);
+  PMP::autorefine_triangle_soup(points, polygons,
+                                CGAL::parameters::concurrency_tag(CGAL::Parallel_if_available_tag()));
+
+  Scene_polygon_soup_item* new_item = new Scene_polygon_soup_item();
+  new_item->load(points, polygons);
+  QString name = scene->item(indices[0])->name();
+  for (std::size_t k=1; k<indices.size(); ++k)
+    name += " + " + scene->item(indices[k])->name();
+  new_item->setName(name+" autorefined");
+
+  scene->addItem(new_item);
+  new_item->invalidateOpenGLBuffers();
+  Q_EMIT new_item->itemChanged();
+}
+
+void Polyhedron_demo_repair_polyhedron_plugin::on_actionNewAutorefine_triggered()
+{
+  std::vector<Scene_interface::Item_id> indices;
+  for (Scene_interface::Item_id index : scene->selectionIndices())
+  {
+    if (qobject_cast<Scene_surface_mesh_item*>(scene->item(index)))
+      indices.push_back(index);
+    else if (qobject_cast<Scene_polygon_soup_item*>(scene->item(index)))
+      indices.push_back(index);
+  }
+  QApplication::setOverrideCursor(Qt::WaitCursor);
+  on_actionNewAutorefine_triggered<Scene_surface_mesh_item>(indices);
+  QApplication::restoreOverrideCursor();
+}
+
 template <typename Item>
 void Polyhedron_demo_repair_polyhedron_plugin::on_actionAutorefineAndRMSelfIntersections_triggered(Scene_interface::Item_id index)
 {

From 9c63d3e57bbad4b1d0261892a826d6f92f97462e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 2 Aug 2023 17:31:13 +0200
Subject: [PATCH 0570/1398] fix warning

---
 .../test/Surface_mesh_approximation/vsa_border_test.cpp         | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_border_test.cpp b/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_border_test.cpp
index 554c50d2af65..6bafd27359f4 100644
--- a/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_border_test.cpp
+++ b/Surface_mesh_approximation/test/Surface_mesh_approximation/vsa_border_test.cpp
@@ -75,7 +75,7 @@ int main(int, char*[])
     std::array<double,6> subdivisionRatios          = { 0.10 , 2.0 , 2.0 , 10.0 , 10.0 , 10.00 };
     std::array<double, 6> boundarySubdivisionRatios = { 0.01 , 2.0 , 0.1 , 10.0 ,  1.0 ,  0.01 };
 
-    for (int i = 0; i < subdivisionRatios.size(); ++i)
+    for (std::size_t i = 0; i < subdivisionRatios.size(); ++i)
     {
         const auto subdivisionRatio = subdivisionRatios[i];
         const auto boundarySubdivisionRatio = boundarySubdivisionRatios[i];

From 9696eca78a1c443664760d52cd94a086a7bf24f4 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 2 Aug 2023 17:52:31 +0200
Subject: [PATCH 0571/1398] Update Installation/CHANGES.md

Co-authored-by: Mael <mael.rouxel.labbe@geometryfactory.com>
---
 Installation/CHANGES.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 0d0bc97777eb..b812b99fe815 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -17,7 +17,7 @@ Release date: October 2023
 -   **Breaking change**: Removed the concept `TriangleAccessor`, the template parameter `TriangleAccessor`, as well
     as the class `Triangle_accessor`. They were no longer used for several releases.
 
--   Removed the class templates `Gray_image_mesh_domain_3` and `Labeled_image_mesh_domain_3`
+-   Removed the class templates `Gray_image_mesh_domain_3`, `Implicit_mesh_domain_3`, and `Labeled_image_mesh_domain_3`
     which are deprecated since CGAL-4.13.
 
 

From dab63942159c96692e7b83459e4e53ba59b17592 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 3 Aug 2023 12:05:40 +0200
Subject: [PATCH 0572/1398] Introduce AW3 Vb/Cb to avoid using
 T3_Vb/Cb_with_info_3

---
 .../examples/Alpha_wrap_3/volumetric_wrap.cpp |   4 +-
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 133 ++++++------------
 .../internal/Alpha_wrap_AABB_geom_traits.h    |  14 +-
 .../Alpha_wrap_triangulation_cell_base_3.h    |  97 +++++++++++++
 .../Alpha_wrap_triangulation_vertex_base_3.h  |  71 ++++++++++
 .../Alpha_wrap_3/Alpha_wrap_3_plugin.cpp      |   4 +-
 6 files changed, 225 insertions(+), 98 deletions(-)
 create mode 100644 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
 create mode 100644 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_vertex_base_3.h

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
index 7fb4d4704207..dd63ad66711f 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
@@ -137,7 +137,7 @@ int main(int argc, char** argv)
 
   for(auto c : tr.finite_cell_handles())
   {
-    if(c->info().is_outside)
+    if(c->is_outside())
       c->set_subdomain_index(0);
     else
       c->set_subdomain_index(1);
@@ -146,7 +146,7 @@ int main(int argc, char** argv)
     // of the common face on the surface boundary
     for(int i=0; i<4; ++i)
     {
-      if(c->neighbor(i)->info().is_outside != c->info().is_outside)
+      if(c->neighbor(i)->is_outside() != c->is_outside())
       {
         c->set_surface_patch_index(i, 1);
         boundary_facets.emplace(c, i);
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 677242e9da19..ba752a77590b 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1,4 +1,4 @@
-// Copyright (c) 2019-2022 Google LLC (USA).
+// Copyright (c) 2019-2023 Google LLC (USA).
 // All rights reserved.
 //
 // This file is part of CGAL (www.cgal.org).
@@ -29,6 +29,8 @@
 
 #include <CGAL/license/Alpha_wrap_3.h>
 
+#include <CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h>
+#include <CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_vertex_base_3.h>
 #include <CGAL/Alpha_wrap_3/internal/Alpha_wrap_AABB_geom_traits.h>
 #include <CGAL/Alpha_wrap_3/internal/gate_priority_queue.h>
 #include <CGAL/Alpha_wrap_3/internal/geometry_utils.h>
@@ -37,9 +39,7 @@
 #include <CGAL/Delaunay_triangulation_3.h>
 #include <CGAL/Triangulation_data_structure_3.h>
 #include <CGAL/Delaunay_triangulation_cell_base_3.h>
-#include <CGAL/Triangulation_cell_base_with_info_3.h>
 #include <CGAL/Delaunay_triangulation_cell_base_with_circumcenter_3.h>
-#include <CGAL/Triangulation_vertex_base_with_info_3.h>
 #include <CGAL/Robust_weighted_circumcenter_filtered_traits_3.h>
 
 #include <CGAL/Cartesian_converter.h>
@@ -76,58 +76,11 @@ namespace CGAL {
 namespace Alpha_wraps_3 {
 namespace internal {
 
-struct Cell_info
-{
-  bool is_outside = false;
-};
-
-enum Vertex_info
-{
-  DEFAULT = 0,
-  BBOX_VERTEX,
-  SEED_VERTEX
-};
-
-template <typename GeomTraits>
-using Alpha_wrap_triangulation_vertex_base_3 =
-  CGAL::Triangulation_vertex_base_with_info_3<
-    Vertex_info,
-    GeomTraits,
-    CGAL::Triangulation_vertex_base_3<GeomTraits> >;
-
-template <typename GeomTraits>
-using Alpha_wrap_triangulation_cell_base_3 =
-  CGAL::Triangulation_cell_base_with_info_3<
-    Cell_info,
-    GeomTraits,
-    CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3<
-      GeomTraits,
-      CGAL::Delaunay_triangulation_cell_base_3<GeomTraits> > >;
-
-template <typename Cb>
-class Cell_base_with_timestamp
-  : public Cb
-{
-  std::size_t time_stamp_;
-
-public:
-  template <typename... Args>
-  Cell_base_with_timestamp(const Args&... args) : Cb(args...), time_stamp_(-1) { }
+namespace {
 
-  Cell_base_with_timestamp(const Cell_base_with_timestamp& other) : Cb(other), time_stamp_(other.time_stamp_) { }
+namespace AW3i = ::CGAL::Alpha_wraps_3::internal;
 
-  typedef CGAL::Tag_true Has_timestamp;
-
-  std::size_t time_stamp() const { return time_stamp_; }
-  void set_time_stamp(const std::size_t& ts) { time_stamp_ = ts; }
-
-  template <class TDS>
-  struct Rebind_TDS
-  {
-    typedef typename Cb::template Rebind_TDS<TDS>::Other Cb2;
-    typedef Cell_base_with_timestamp<Cb2> Other;
-  };
-};
+} // unnamed namespace
 
 struct Wrapping_default_visitor
 {
@@ -163,7 +116,7 @@ class Alpha_wrap_3
 
   // Triangulation
   using Base_GT = typename Oracle::Geom_traits;
-  using Default_Gt = Robust_circumcenter_filtered_traits_3<Base_GT>;
+  using Default_Gt = CGAL::Robust_circumcenter_filtered_traits_3<Base_GT>;
 
   using Default_Vb = Alpha_wrap_triangulation_vertex_base_3<Default_Gt>;
   using Default_Cb = Alpha_wrap_triangulation_cell_base_3<Default_Gt>;
@@ -447,7 +400,7 @@ class Alpha_wrap_3
 #ifdef CGAL_AW3_DEBUG_INITIALIZATION
       std::cout << "\t" << bp << std::endl;
 #endif
-      bv->info() = BBOX_VERTEX;
+      bv->type() = AW3i::Vertex_type:: BBOX_VERTEX;
     }
   }
 
@@ -562,7 +515,7 @@ class Alpha_wrap_3
       // which usually happens for large alpha values.
 
       Vertex_handle seed_v = m_tr.insert(seed_p);
-      seed_v->info() = SEED_VERTEX;
+      seed_v->type() = AW3i::Vertex_type:: SEED_VERTEX;
       seed_vs.push_back(seed_v);
 
       // Icosahedron vertices (see also BGL::make_icosahedron())
@@ -599,7 +552,7 @@ class Alpha_wrap_3
           continue;
 
         Vertex_handle ico_v = m_tr.insert(seed_neighbor_p, seed_v /*hint*/);
-        ico_v->info() = SEED_VERTEX;
+        ico_v->type() = AW3i::Vertex_type:: SEED_VERTEX;
       }
     }
 
@@ -621,13 +574,13 @@ class Alpha_wrap_3
       inc_cells.reserve(64);
       m_tr.incident_cells(seed_v, std::back_inserter(inc_cells));
       for(Cell_handle ch : inc_cells)
-        ch->info().is_outside = cavity_cell_outside_tag(ch);
+        ch->is_outside() = cavity_cell_outside_tag(ch);
     }
 
     // Might as well go through the full triangulation since only seeds should have been inserted
     for(Cell_handle ch : m_tr.all_cell_handles())
     {
-      if(!ch->info().is_outside)
+      if(!ch->is_outside())
         continue;
 
       // When the algorithm starts from a manually dug hole, infinite cells are tagged "inside"
@@ -656,13 +609,13 @@ class Alpha_wrap_3
     {
       if(m_tr.is_infinite(ch))
       {
-        ch->info().is_outside = true;
+        ch->is_outside() = true;
         const int inf_index = ch->index(m_tr.infinite_vertex());
         push_facet(std::make_pair(ch, inf_index));
       }
       else
       {
-        ch->info().is_outside = false;
+        ch->is_outside() = false;
       }
     }
 
@@ -690,7 +643,7 @@ class Alpha_wrap_3
     for(auto cit=m_tr.finite_cells_begin(), cend=m_tr.finite_cells_end(); cit!=cend; ++cit)
     {
       Cell_handle seed = cit;
-      if(seed->info().is_outside || seed->tds_data().processed())
+      if(seed->is_outside() || seed->tds_data().processed())
         continue;
 
       std::queue<Cell_handle> to_visit;
@@ -703,7 +656,7 @@ class Alpha_wrap_3
       while(!to_visit.empty())
       {
         const Cell_handle cell = to_visit.front();
-        CGAL_assertion(!cell->info().is_outside && !m_tr.is_infinite(cell));
+        CGAL_assertion(!cell->is_outside() && !m_tr.is_infinite(cell));
 
         to_visit.pop();
 
@@ -715,13 +668,13 @@ class Alpha_wrap_3
         for(int fid=0; fid<4; ++fid)
         {
           const Cell_handle neighbor = cell->neighbor(fid);
-          if(neighbor->info().is_outside)
+          if(neighbor->is_outside())
           {
             // There shouldn't be any artificial vertex on the inside/outside boundary
             // (past initialization)
-//            CGAL_assertion(cell->vertex((fid + 1)&3)->info() == DEFAULT);
-//            CGAL_assertion(cell->vertex((fid + 2)&3)->info() == DEFAULT);
-//            CGAL_assertion(cell->vertex((fid + 3)&3)->info() == DEFAULT);
+//            CGAL_assertion(cell->vertex((fid + 1)&3)->type() == AW3i::Vertex_type:: DEFAULT);
+//            CGAL_assertion(cell->vertex((fid + 2)&3)->type() == AW3i::Vertex_type:: DEFAULT);
+//            CGAL_assertion(cell->vertex((fid + 3)&3)->type() == AW3i::Vertex_type:: DEFAULT);
 
             points.push_back(m_tr.point(cell, Triangulation::vertex_triple_index(fid, 0)));
             points.push_back(m_tr.point(cell, Triangulation::vertex_triple_index(fid, 1)));
@@ -782,13 +735,13 @@ class Alpha_wrap_3
     for(auto fit=m_tr.finite_facets_begin(), fend=m_tr.finite_facets_end(); fit!=fend; ++fit)
     {
       Facet f = *fit;
-      if(!f.first->info().is_outside)
+      if(!f.first->is_outside())
         f = m_tr.mirror_facet(f);
 
       const Cell_handle c = f.first;
       const int s = f.second;
       const Cell_handle nh = c->neighbor(s);
-      if(c->info().is_outside == nh->info().is_outside)
+      if(c->is_outside() == nh->is_outside())
         continue;
 
       std::array<std::size_t, 3> ids;
@@ -961,7 +914,7 @@ class Alpha_wrap_3
     if(m_tr.is_infinite(nh))
       return TRAVERSABLE;
 
-    if(nh->info().is_outside)
+    if(nh->is_outside())
     {
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
       std::cout << "Neighbor already outside" << std::endl;
@@ -973,7 +926,8 @@ class Alpha_wrap_3
     for(int i=0; i<3; ++i)
     {
       const Vertex_handle vh = ch->vertex(Triangulation::vertex_triple_index(id, i));
-      if(vh->info() == BBOX_VERTEX || vh->info() == SEED_VERTEX)
+      if(vh->type() == AW3i::Vertex_type:: BBOX_VERTEX ||
+         vh->type() == AW3i::Vertex_type:: SEED_VERTEX)
       {
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
         std::cout << "artificial facet due to artificial vertex #" << i << std::endl;
@@ -999,7 +953,7 @@ class Alpha_wrap_3
 
   bool push_facet(const Facet& f)
   {
-    CGAL_precondition(f.first->info().is_outside);
+    CGAL_precondition(f.first->is_outside());
 
     // skip if f is already in queue
     if(m_queue.contains_with_bounds_check(Gate(f)))
@@ -1111,7 +1065,7 @@ class Alpha_wrap_3
 
       if(m_tr.is_infinite(neighbor))
       {
-        neighbor->info().is_outside = true;
+        neighbor->is_outside() = true;
         continue;
       }
 
@@ -1159,7 +1113,7 @@ class Alpha_wrap_3
 
         // Actual insertion of the Steiner point
         Vertex_handle vh = m_tr.insert(steiner_point, lt, conflict_cell, li, lj);
-        vh->info() = DEFAULT;
+        vh->type() = AW3i::Vertex_type:: DEFAULT;
 
         visitor.after_Steiner_point_insertion(*this, vh);
 
@@ -1169,7 +1123,7 @@ class Alpha_wrap_3
         for(const Cell_handle& ch : new_cells)
         {
           // std::cout << "new cell has time stamp " << ch->time_stamp() << std::endl;
-          ch->info().is_outside = m_tr.is_infinite(ch);
+          ch->is_outside() = m_tr.is_infinite(ch);
         }
 
         // Push all new boundary facets to the queue.
@@ -1185,11 +1139,11 @@ class Alpha_wrap_3
               continue;
 
             const Cell_handle nh = ch->neighbor(i);
-            if(nh->info().is_outside == ch->info().is_outside) // not on the boundary
+            if(nh->is_outside() == ch->is_outside()) // not on the boundary
               continue;
 
             const Facet boundary_f = std::make_pair(ch, i);
-            if(ch->info().is_outside)
+            if(ch->is_outside())
               push_facet(boundary_f);
             else
               push_facet(m_tr.mirror_facet(boundary_f));
@@ -1199,7 +1153,7 @@ class Alpha_wrap_3
       else
       {
         // tag neighbor as OUTSIDE
-        neighbor->info().is_outside = true;
+        neighbor->is_outside() = true;
 
         // for each finite facet of neighbor, push it to the queue
         for(int i=0; i<4; ++i)
@@ -1214,9 +1168,9 @@ class Alpha_wrap_3
 
     // Check that no useful facet has been ignored
     CGAL_postcondition_code(for(auto fit=m_tr.finite_facets_begin(), fend=m_tr.finite_facets_end(); fit!=fend; ++fit) {)
-    CGAL_postcondition_code(  if(fit->first->info().is_outside == fit->first->neighbor(fit->second)->info().is_outside) continue;)
+    CGAL_postcondition_code(  if(fit->first->is_outside() == fit->first->neighbor(fit->second)->is_outside()) continue;)
     CGAL_postcondition_code(  Facet f = *fit;)
-    CGAL_postcondition_code(  if(!fit->first->info().is_outside) f = m_tr.mirror_facet(f);)
+    CGAL_postcondition_code(  if(!fit->first->is_outside()) f = m_tr.mirror_facet(f);)
     CGAL_postcondition(       facet_status(f) == IRRELEVANT);
     CGAL_postcondition_code(})
   }
@@ -1243,7 +1197,7 @@ class Alpha_wrap_3
     for(Cell_handle ic : inc_cells)
     {
       ic->tds_data().clear();
-      if(ic->info().is_outside)
+      if(ic->is_outside())
         outside_start = ic;
       else if(inside_start == Cell_handle())
         inside_start = ic;
@@ -1278,7 +1232,7 @@ class Alpha_wrap_3
         CGAL_assertion(neigh_c->has_vertex(v));
 
         if(neigh_c->tds_data().processed() ||
-           neigh_c->info().is_outside != curr_c->info().is_outside) // do not cross the boundary
+           neigh_c->is_outside() != curr_c->is_outside()) // do not cross the boundary
           continue;
 
         cells_to_visit.push(neigh_c);
@@ -1343,7 +1297,7 @@ class Alpha_wrap_3
 
       for(Cell_handle c : inc_cells)
       {
-        if(!c->info().is_outside)
+        if(!c->is_outside())
         {
           do_remove = false;
           break;
@@ -1390,15 +1344,20 @@ class Alpha_wrap_3
     auto has_artificial_vertex = [](Cell_handle c) -> bool
     {
       for(int i=0; i<4; ++i)
-        if(c->vertex(i)->info() == BBOX_VERTEX || c->vertex(i)->info() == SEED_VERTEX)
+      {
+        if(c->vertex(i)->type() == AW3i::Vertex_type:: BBOX_VERTEX ||
+           c->vertex(i)->type() == AW3i::Vertex_type:: SEED_VERTEX)
+        {
           return true;
+        }
+      }
 
       return false;
     };
 
     auto is_on_boundary = [](Cell_handle c, int i) -> bool
     {
-      return (c->info().is_outside != c->neighbor(i)->info().is_outside);
+      return (c->is_outside() != c->neighbor(i)->is_outside());
     };
 
     auto count_boundary_facets = [&](Cell_handle c, Vertex_handle v) -> int
@@ -1492,7 +1451,7 @@ class Alpha_wrap_3
         CGAL_assertion(!m_tr.is_infinite(ic));
 
         // This is where new material is added
-        ic->info().is_outside = false;
+        ic->is_outside() = false;
 
 #ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
         static int i = 0;
@@ -1577,7 +1536,7 @@ class Alpha_wrap_3
       int s = fit->second;
 
       Cell_handle nc = c->neighbor(s);
-      if(only_boundary_faces && (c->info().is_outside == nc->info().is_outside))
+      if(only_boundary_faces && (c->is_outside() == nc->is_outside()))
         continue;
 
       std::array<std::size_t, 3> ids;
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_AABB_geom_traits.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_AABB_geom_traits.h
index 22c64e9b5e26..80a403c258e4 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_AABB_geom_traits.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_AABB_geom_traits.h
@@ -36,24 +36,24 @@ struct Tetrahedron_with_outside_info
   using Triangle_3 = typename Kernel::Triangle_3;
 
   template <typename CellHandle>
-  Tetrahedron_with_outside_info(const CellHandle ch, const K& k)
+  Tetrahedron_with_outside_info(const CellHandle c, const K& k)
   {
     typename K::Construct_bbox_3 bbox = k.construct_bbox_3_object();
     typename K::Construct_tetrahedron_3 tetrahedron = k.construct_tetrahedron_3_object();
     typename K::Construct_triangle_3 triangle = k.construct_triangle_3_object();
 
-    m_tet = tetrahedron(ch->vertex(0)->point(), ch->vertex(1)->point(),
-                        ch->vertex(2)->point(), ch->vertex(3)->point());
+    m_tet = tetrahedron(c->vertex(0)->point(), c->vertex(1)->point(),
+                        c->vertex(2)->point(), c->vertex(3)->point());
     m_bbox = bbox(m_tet);
 
     for(int i=0; i<4; ++i)
     {
-      if(ch->neighbor(i)->info().is_outside)
+      if(c->neighbor(i)->is_outside())
         m_b.set(i, true);
 
-      m_triangles[i] = triangle(ch->vertex((i+1)& 3)->point(),
-                                ch->vertex((i+2)& 3)->point(),
-                                ch->vertex((i+3)& 3)->point());
+      m_triangles[i] = triangle(c->vertex((i+1)& 3)->point(),
+                                c->vertex((i+2)& 3)->point(),
+                                c->vertex((i+3)& 3)->point());
       m_tbox[i] = bbox(m_triangles[i]);
     }
   }
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
new file mode 100644
index 000000000000..ebe337b614c4
--- /dev/null
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
@@ -0,0 +1,97 @@
+// Copyright (c) 2019-2023 Google LLC (USA).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Mael Rouxel-Labbé
+
+#ifndef CGAL_ALPHA_WRAP_TRIANGULATION_CELL_BASE_3_H
+#define CGAL_ALPHA_WRAP_TRIANGULATION_CELL_BASE_3_H
+
+#include <CGAL/license/Alpha_wrap_3.h>
+
+#include <CGAL/Delaunay_triangulation_cell_base_with_circumcenter_3.h>
+
+namespace CGAL {
+namespace Alpha_wraps_3 {
+namespace internal {
+
+template < typename GT,
+           typename Cb = CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3<GT> >
+class Alpha_wrap_triangulation_cell_base_3
+  : public Cb
+{
+private:
+  bool outside;
+
+public:
+  typedef typename Cb::Vertex_handle                   Vertex_handle;
+  typedef typename Cb::Cell_handle                     Cell_handle;
+
+  template < typename TDS2 >
+  struct Rebind_TDS
+  {
+    using Cb2 = typename Cb::template Rebind_TDS<TDS2>::Other;
+    using Other = Alpha_wrap_triangulation_cell_base_3<GT, Cb2>;
+  };
+
+  Alpha_wrap_triangulation_cell_base_3()
+    : Cb()
+  {}
+
+  Alpha_wrap_triangulation_cell_base_3(Vertex_handle v0, Vertex_handle v1,
+                                       Vertex_handle v2, Vertex_handle v3)
+    : Cb(v0, v1, v2, v3)
+  {}
+
+  Alpha_wrap_triangulation_cell_base_3(Vertex_handle v0, Vertex_handle v1,
+                                       Vertex_handle v2, Vertex_handle v3,
+                                       Cell_handle   n0, Cell_handle   n1,
+                                       Cell_handle   n2, Cell_handle   n3)
+    : Cb(v0, v1, v2, v3, n0, n1, n2, n3)
+  {}
+
+  bool is_outside() const { return outside; }
+  bool& is_outside() { return outside; }
+};
+
+template <typename Cb>
+class Cell_base_with_timestamp
+  : public Cb
+{
+  std::size_t time_stamp_;
+
+public:
+  using Has_timestamp = CGAL::Tag_true;
+
+  template <class TDS>
+  struct Rebind_TDS
+  {
+    using Cb2 = typename Cb::template Rebind_TDS<TDS>::Other;
+    using Other = Cell_base_with_timestamp<Cb2>;
+  };
+
+public:
+  template <typename... Args>
+  Cell_base_with_timestamp(const Args&... args)
+    : Cb(args...), time_stamp_(-1)
+  { }
+
+  Cell_base_with_timestamp(const Cell_base_with_timestamp& other)
+    : Cb(other), time_stamp_(other.time_stamp_)
+  { }
+
+public:
+  std::size_t time_stamp() const { return time_stamp_; }
+  void set_time_stamp(const std::size_t& ts) { time_stamp_ = ts; }
+};
+
+} // namespace internal
+} // namespace Alpha_wraps_3
+} // namespace CGAL
+
+#endif // CGAL_ALPHA_WRAP_TRIANGULATION_CELL_BASE_3_H
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_vertex_base_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_vertex_base_3.h
new file mode 100644
index 000000000000..75f26741755c
--- /dev/null
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_vertex_base_3.h
@@ -0,0 +1,71 @@
+// Copyright (c) 2019-2023 Google LLC (USA).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Mael Rouxel-Labbé
+
+#ifndef CGAL_ALPHA_WRAP_TRIANGULATION_VERTEX_BASE_3_H
+#define CGAL_ALPHA_WRAP_TRIANGULATION_VERTEX_BASE_3_H
+
+#include <CGAL/license/Alpha_wrap_3.h>
+
+#include <CGAL/Triangulation_vertex_base_3.h>
+
+namespace CGAL {
+namespace Alpha_wraps_3 {
+namespace internal {
+
+enum class Vertex_type
+{
+  DEFAULT = 0,
+  BBOX_VERTEX,
+  SEED_VERTEX
+};
+
+template <typename GT,
+          typename Vb = Triangulation_vertex_base_3<GT> >
+class Alpha_wrap_triangulation_vertex_base_3
+  : public Vb
+{
+private:
+  Vertex_type vertex_type;
+
+public:
+  using Cell_handle = typename Vb::Cell_handle;
+  using Point = typename Vb::Point;
+
+  template <typename TDS2>
+  struct Rebind_TDS
+  {
+    using Vb2 = typename Vb::template Rebind_TDS<TDS2>::Other;
+    using Other = Alpha_wrap_triangulation_vertex_base_3<GT, Vb2>;
+  };
+
+public:
+  Alpha_wrap_triangulation_vertex_base_3()
+    : Vb() {}
+
+  Alpha_wrap_triangulation_vertex_base_3(const Point& p)
+    : Vb(p) {}
+
+  Alpha_wrap_triangulation_vertex_base_3(const Point& p, Cell_handle c)
+    : Vb(p, c) {}
+
+  Alpha_wrap_triangulation_vertex_base_3(Cell_handle c)
+    : Vb(c) {}
+
+public:
+  const Vertex_type& type() const { return vertex_type; }
+  Vertex_type& type() { return vertex_type; }
+};
+
+} // namespace internal
+} // namespace Alpha_wraps_3
+} // namespace CGAL
+
+#endif // CGAL_ALPHA_WRAP_TRIANGULATION_VERTEX_BASE_3_H
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index a105d1ba12e4..a1b29fd5689d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -153,13 +153,13 @@ struct Iterative_AW3_visualization_visitor
     for(auto fit=wrapper.triangulation().finite_facets_begin(), fend=wrapper.triangulation().finite_facets_end(); fit!=fend; ++fit)
     {
       Facet f = *fit;
-      if(!f.first->info().is_outside)
+      if(!f.first->is_outside())
         f = wrapper.triangulation().mirror_facet(f);
 
       const Cell_handle c = f.first;
       const int s = f.second;
       const Cell_handle nh = c->neighbor(s);
-      if(c->info().is_outside == nh->info().is_outside)
+      if(c->is_outside() == nh->is_outside())
         continue;
 
       std::array<std::size_t, 3> ids;

From 5179c4acb12724fa452591946300fd1b8d25bc28 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 3 Aug 2023 12:06:23 +0200
Subject: [PATCH 0573/1398] Clean examples

---
 .../examples/Alpha_wrap_3/mixed_inputs_wrap.cpp |  2 +-
 .../examples/Alpha_wrap_3/volumetric_wrap.cpp   | 17 ++++++++---------
 2 files changed, 9 insertions(+), 10 deletions(-)

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
index be64a8febbde..ffcedc7f1cbb 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
@@ -16,9 +16,9 @@ using K = CGAL::Exact_predicates_inexact_constructions_kernel;
 using Point_3 = K::Point_3;
 using Segment_3 = K::Segment_3;
 
-using Face = std::array<std::size_t, 3>;
 using Segments = std::vector<Segment_3>;
 using Points = std::vector<Point_3>;
+using Face = std::array<std::size_t, 3>;
 using Faces = std::vector<Face>;
 
 using Mesh = CGAL::Surface_mesh<Point_3>;
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
index dd63ad66711f..66e9653f1b41 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
@@ -129,9 +129,7 @@ int main(int argc, char** argv)
 
   std::cout << "BEFORE: " << tr.number_of_vertices() << " vertices, " << tr.number_of_cells() << " cells" << std::endl;
 
-  // Set up the domain information and grab the boundary faces
-  std::set<Facet> boundary_facets;
-
+  // Set up the c3t3 information
   for(auto v : tr.finite_vertex_handles())
     v->set_dimension(3);
 
@@ -149,24 +147,25 @@ int main(int argc, char** argv)
       if(c->neighbor(i)->is_outside() != c->is_outside())
       {
         c->set_surface_patch_index(i, 1);
-        boundary_facets.emplace(c, i);
         for(int j=1; j<4; ++j)
           c->vertex((i+j)%4)->set_dimension(2);
       }
     }
   }
 
-  // CGAL::draw(tr);
   std::ofstream out_before("before_remeshing.mesh");
   CGAL::IO::write_MEDIT(out_before, tr);
 
-  auto fcm = CGAL::make_boolean_property_map(boundary_facets);
-  CGAL::tetrahedral_isotropic_remeshing(tr, alpha,
-                                        CGAL::parameters::facet_is_constrained_map(fcm));
+  // edge length of equilateral triangle with circumradius alpha
+  // const double l = 2 * alpha * 0.8660254037844386; // sqrt(3)/2
+
+  // edge length of regular tetrahedron with circumradius alpha
+  const double l = 1.6329931618554521 * alpha; // sqrt(8/3)
+
+  CGAL::tetrahedral_isotropic_remeshing(tr, l, CGAL::parameters::remesh_boundaries(false));
 
   std::cout << "AFTER: " << tr.number_of_vertices() << " vertices, " << tr.number_of_cells() << " cells" << std::endl;
 
-  // CGAL::draw(tr);
   std::ofstream out_after("after_remeshing.mesh");
   CGAL::IO::write_MEDIT(out_after, tr);
 

From 6949cdb40aca7874b2f16fed0256802a58f83891 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 3 Aug 2023 12:15:36 +0200
Subject: [PATCH 0574/1398] Fix missing default initialization of the AW3
 markers in the new Vb/Cb

---
 .../internal/Alpha_wrap_triangulation_cell_base_3.h             | 2 +-
 .../internal/Alpha_wrap_triangulation_vertex_base_3.h           | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
index ebe337b614c4..db1df61c8f65 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
@@ -26,7 +26,7 @@ class Alpha_wrap_triangulation_cell_base_3
   : public Cb
 {
 private:
-  bool outside;
+  bool outside = false;
 
 public:
   typedef typename Cb::Vertex_handle                   Vertex_handle;
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_vertex_base_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_vertex_base_3.h
index 75f26741755c..3743edffbc7f 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_vertex_base_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_vertex_base_3.h
@@ -33,7 +33,7 @@ class Alpha_wrap_triangulation_vertex_base_3
   : public Vb
 {
 private:
-  Vertex_type vertex_type;
+  Vertex_type vertex_type = Vertex_type::DEFAULT;
 
 public:
   using Cell_handle = typename Vb::Cell_handle;

From 8076e20b71bc83407ec94d6e399d6e41f163c8de Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 1 Aug 2023 13:07:55 +0200
Subject: [PATCH 0575/1398] Add debug code

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h      | 14 ++++++++------
 .../test_AW3_cavity_initializations.cpp            |  1 +
 .../test/Alpha_wrap_3/test_AW3_manifoldness.cpp    |  1 +
 .../test/Alpha_wrap_3/test_AW3_multiple_calls.cpp  |  1 +
 .../test/Alpha_wrap_3/test_alpha_wrap_3_mesh.cpp   |  2 +-
 5 files changed, 12 insertions(+), 7 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index e88e00fafe0c..1e9674276fa8 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1362,7 +1362,12 @@ class Alpha_wrap_3
     for(Vertex_handle v : m_dt.finite_vertex_handles())
     {
       if(is_non_manifold(v))
+      {
+#ifdef CGAL_AW3_DEBUG_MANIFOLDNESS_PP
+        std::cout << v->point() << " is non-manifold" << std::endl;
+#endif
         non_manifold_vertices.push(v);
+      }
     }
 
     // Some lambdas for the comparer
@@ -1412,23 +1417,19 @@ class Alpha_wrap_3
                           squared_distance(m_dt.point(c, 2), m_dt.point(c, 3)) });
     };
 
-#ifdef CGAL_AW3_DEBUG_MANIFOLDNESS
+#ifdef CGAL_AW3_DEBUG_MANIFOLDNESS_PP
     std::cout << non_manifold_vertices.size() << " initial NMV" << std::endl;
 #endif
 
     while(!non_manifold_vertices.empty())
     {
-#ifdef CGAL_AW3_DEBUG_MANIFOLDNESS
+#ifdef CGAL_AW3_DEBUG_MANIFOLDNESS_PP
       std::cout << non_manifold_vertices.size() << " NMV in queue" << std::endl;
 #endif
 
       Vertex_handle v = non_manifold_vertices.top();
       non_manifold_vertices.pop();
 
-#ifdef CGAL_AW3_DEBUG_MANIFOLDNESS
-      std::cout << "·";
-#endif
-
       if(!is_non_manifold(v))
         continue;
 
@@ -1503,6 +1504,7 @@ class Alpha_wrap_3
   void check_queue_sanity()
   {
     std::cout << "Check queue sanity..." << std::endl;
+
     std::vector<Gate> queue_gates;
     Gate previous_top_gate = m_queue.top();
     while(!m_queue.empty())
diff --git a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp
index d7567bab205b..c6591e000df1 100644
--- a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp
+++ b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp
@@ -1,5 +1,6 @@
 #define CGAL_AW3_TIMER
 #define CGAL_AW3_DEBUG
+#define CGAL_AW3_DEBUG_MANIFOLDNESS
 // #define CGAL_AW3_DEBUG_INITIALIZATION
 
 #include <CGAL/Surface_mesh.h>
diff --git a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_manifoldness.cpp b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_manifoldness.cpp
index 928cade64959..8ac2e422d878 100644
--- a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_manifoldness.cpp
+++ b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_manifoldness.cpp
@@ -1,5 +1,6 @@
 #define CGAL_AW3_TIMER
 #define CGAL_AW3_DEBUG
+#define CGAL_AW3_DEBUG_MANIFOLDNESS
 //#define CGAL_AW3_DEBUG_STEINER_COMPUTATION
 //#define CGAL_AW3_DEBUG_INITIALIZATION
 //#define CGAL_AW3_DEBUG_QUEUE
diff --git a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp
index e2abc6f1f12f..eda64a8376a4 100644
--- a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp
+++ b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp
@@ -1,5 +1,6 @@
 #define CGAL_AW3_TIMER
 #define CGAL_AW3_DEBUG
+#define CGAL_AW3_DEBUG_MANIFOLDNESS
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
diff --git a/Alpha_wrap_3/test/Alpha_wrap_3/test_alpha_wrap_3_mesh.cpp b/Alpha_wrap_3/test/Alpha_wrap_3/test_alpha_wrap_3_mesh.cpp
index 5091934b62f0..302494d8c304 100644
--- a/Alpha_wrap_3/test/Alpha_wrap_3/test_alpha_wrap_3_mesh.cpp
+++ b/Alpha_wrap_3/test/Alpha_wrap_3/test_alpha_wrap_3_mesh.cpp
@@ -1,6 +1,6 @@
 #define CGAL_AW3_TIMER
 //#define CGAL_AW3_DEBUG
-//#define CGAL_AW3_DEBUG_MANIFOLDNESS
+#define CGAL_AW3_DEBUG_MANIFOLDNESS
 //#define CGAL_AW3_DEBUG_STEINER_COMPUTATION
 //#define CGAL_AW3_DEBUG_INITIALIZATION
 //#define CGAL_AW3_DEBUG_QUEUE

From c7b9317a96117f874aa88b6ca9cd6b376f4d10cc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 1 Aug 2023 13:16:18 +0200
Subject: [PATCH 0576/1398] Simplify choice of cells to un-carve while
 enforcing manifoldness

This combinatorial choice seemed like a good idea, but it can have
nasty cascading effects, adding very large tetrahedra. See this
issue: https://github.com/CGAL/cgal/issues/7625

In the end, the only thing we care about is small volumes being added.

I keep the artificial vertex for now, but I am not fully convinced
these should be actually kept too.
---
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h        | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 1e9674276fa8..1b0a6968c092 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1445,11 +1445,6 @@ class Alpha_wrap_3
         if(has_artificial_vertex(r))
           return true;
 
-        const int l_bf_count = count_boundary_facets(l, v);
-        const int r_bf_count = count_boundary_facets(r, v);
-        if(l_bf_count != r_bf_count)
-          return l_bf_count > r_bf_count;
-
         return sq_longest_edge(l) < sq_longest_edge(r);
       };
 

From b4e207ab00237bffbd221bc7f4bd4b0bb2e69c47 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 2 Aug 2023 10:00:34 +0200
Subject: [PATCH 0577/1398] Add some comments on AW3 manifoldness heuristics
 criteria

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 43 +++++++++++--------
 1 file changed, 24 insertions(+), 19 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 1b0a6968c092..a21925cdc6d8 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1380,25 +1380,27 @@ class Alpha_wrap_3
       return false;
     };
 
-    auto is_on_boundary = [](Cell_handle c, int i) -> bool
-    {
-      return (c->info().is_outside != c->neighbor(i)->info().is_outside);
-    };
-
-    auto count_boundary_facets = [&](Cell_handle c, Vertex_handle v) -> int
-    {
-      const int v_index_in_c = c->index(v);
-      int boundary_facets = 0;
-      for(int i=0; i<3; ++i) // also take into account the opposite facet?
-      {
-        if(i == v_index_in_c)
-          continue;
-
-        boundary_facets += is_on_boundary(c, i);
-      }
-
-      return boundary_facets;
-    };
+    // This seemed like a good idea, but in the end it can have strong cascading issues,
+    // whereas some cells with much lower volume would have solved the non-manifoldness.
+//    auto is_on_boundary = [](Cell_handle c, int i) -> bool
+//    {
+//      return (c->info().is_outside != c->neighbor(i)->info().is_outside);
+//    };
+//
+//    auto count_boundary_facets = [&](Cell_handle c, Vertex_handle v) -> int
+//    {
+//      const int v_index_in_c = c->index(v);
+//      int boundary_facets = 0;
+//      for(int i=0; i<3; ++i) // also take into account the opposite facet?
+//      {
+//        if(i == v_index_in_c)
+//          continue;
+//
+//        boundary_facets += is_on_boundary(c, i);
+//      }
+//
+//      return boundary_facets;
+//    };
 
     // longest edge works better
 //    auto sq_circumradius = [&](Cell_handle c) -> FT
@@ -1407,6 +1409,9 @@ class Alpha_wrap_3
 //      return geom_traits().compute_squared_distance_3_object()(m_dt.point(c, 0), cc);
 //    };
 
+    // the reasonning behind using longest edge rather than volume is that we want to avoid
+    // spikes (which would have a small volume), and can often happen since we do not spend
+    // any care on the quality of tetrahedra.
     auto sq_longest_edge = [&](Cell_handle c) -> FT
     {
       return (std::max)({ squared_distance(m_dt.point(c, 0), m_dt.point(c, 1)),

From 330ff2e65776a9be1f7ca757a813e5055e0a1994 Mon Sep 17 00:00:00 2001
From: Mael <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 2 Aug 2023 10:23:12 +0200
Subject: [PATCH 0578/1398] Fix spelling

Thanks @albert-github!
---
 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index a21925cdc6d8..6d544be058d6 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1409,7 +1409,7 @@ class Alpha_wrap_3
 //      return geom_traits().compute_squared_distance_3_object()(m_dt.point(c, 0), cc);
 //    };
 
-    // the reasonning behind using longest edge rather than volume is that we want to avoid
+    // the reasoning behind using longest edge rather than volume is that we want to avoid
     // spikes (which would have a small volume), and can often happen since we do not spend
     // any care on the quality of tetrahedra.
     auto sq_longest_edge = [&](Cell_handle c) -> FT

From 5db2fd0195051aa2190eac6a5d1fff9780d5d4a1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 4 Aug 2023 10:39:37 +0200
Subject: [PATCH 0579/1398] fix CK3 demo

---
 .../demo/Circular_kernel_3/Viewer.cpp         | 19 +++++++++----------
 1 file changed, 9 insertions(+), 10 deletions(-)

diff --git a/Circular_kernel_3/demo/Circular_kernel_3/Viewer.cpp b/Circular_kernel_3/demo/Circular_kernel_3/Viewer.cpp
index 1502fb44db22..b71924811383 100644
--- a/Circular_kernel_3/demo/Circular_kernel_3/Viewer.cpp
+++ b/Circular_kernel_3/demo/Circular_kernel_3/Viewer.cpp
@@ -893,20 +893,19 @@ void Viewer::naive_compute_intersection_points(const std::vector<EPIC::Point_3>&
     for (std::vector<SK::Circle_3>::const_iterator it_f=circles.begin();it_f!=--circles.end();++it_f){
         std::vector<SK::Circle_3>::const_iterator it_s=it_f;
         ++it_s;
+        typedef std::pair<SK::Circular_arc_point_3,unsigned> Point_and_multiplicity;
         for (;it_s!=circles.end();++it_s){
-            std::vector <CGAL::Object> intersections;
+            std::vector<Point_and_multiplicity> intersections;
             //ensure_circles are different
             CGAL_precondition(*it_s!=*it_f);
-            CGAL::intersection(*it_f,*it_s,std::back_inserter(intersections));
+            CGAL::intersection(*it_f,*it_s,CGAL::dispatch_or_drop_output<Point_and_multiplicity>(std::back_inserter(intersections)));
             if (!intersections.empty()){
-                for (std::vector <CGAL::Object>::const_iterator it_pt=intersections.begin();it_pt!=intersections.end();++it_pt){
-                    const std::pair<SK::Circular_arc_point_3,unsigned>* pt=
-                            CGAL::object_cast< std::pair<SK::Circular_arc_point_3,unsigned> > (&(*it_pt));
-                    assert(pt!=nullptr);
-                    *out++=EPIC::Point_3( CGAL::to_double(pt->first.x()),
-                                          CGAL::to_double(pt->first.y()),
-                                          CGAL::to_double(pt->first.z())
-                                          );
+                for (const Point_and_multiplicity& pt : intersections)
+                {
+                  *out++=EPIC::Point_3( CGAL::to_double(pt.first.x()),
+                                        CGAL::to_double(pt.first.y()),
+                                        CGAL::to_double(pt.first.z())
+                                        );
                 }
             }
         }

From 7f639164c170370b7e5810422458a7f0f9e6765e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 4 Aug 2023 11:22:05 +0200
Subject: [PATCH 0580/1398] update CK2 demo

---
 .../demo/Circular_kernel_2/ArcsGraphicsItem.h | 52 +++++------
 .../Circular_kernel_2/Circular_kernel_2.cpp   | 92 +++++++++----------
 2 files changed, 71 insertions(+), 73 deletions(-)

diff --git a/GraphicsView/demo/Circular_kernel_2/ArcsGraphicsItem.h b/GraphicsView/demo/Circular_kernel_2/ArcsGraphicsItem.h
index b4de860626c0..148293b705c0 100644
--- a/GraphicsView/demo/Circular_kernel_2/ArcsGraphicsItem.h
+++ b/GraphicsView/demo/Circular_kernel_2/ArcsGraphicsItem.h
@@ -16,14 +16,18 @@ namespace Qt {
 template <typename CK>
 class ArcsGraphicsItem : public GraphicsItem
 {
-  std::vector<CGAL::Object>& arcs, &intersections;
   typedef typename CK::Circle_2 Circle_2;
   typedef typename CK::Circular_arc_2 Circular_arc_2;
   typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
   typedef typename CK::Line_arc_2 Line_arc_2;
+  typedef std::variant<std::pair<Circular_arc_point_2,unsigned>, Circular_arc_2, Line_arc_2 > Inter_variant;
+  typedef std::variant<Circular_arc_2, Line_arc_2 > Arc_variant;
+
+  std::vector<Arc_variant>& arcs;
+  std::vector<Inter_variant>& intersections;
 
 public:
-  ArcsGraphicsItem(std::vector<CGAL::Object>& arcs_, std::vector<CGAL::Object>& intersections_);
+  ArcsGraphicsItem(std::vector<Arc_variant>& arcs_, std::vector<Inter_variant>& intersections_);
 
   void modelChanged();
 
@@ -68,7 +72,7 @@ class ArcsGraphicsItem : public GraphicsItem
 
 
 template <typename CK>
-ArcsGraphicsItem<CK>::ArcsGraphicsItem(std::vector<CGAL::Object>& arcs_, std::vector<CGAL::Object>& intersections_)
+ArcsGraphicsItem<CK>::ArcsGraphicsItem(std::vector<Arc_variant>& arcs_, std::vector<Inter_variant>& intersections_)
   :  arcs(arcs_), intersections(intersections_), painterostream(nullptr)
 {
   setIntersectionsPen(QPen(::Qt::red, 3.));
@@ -97,33 +101,29 @@ ArcsGraphicsItem<CK>::paint(QPainter *painter,
   painter->setPen(this->inputPen());
   painterostream = PainterOstream<CK>(painter);
 
-  for(std::vector<CGAL::Object>::iterator it = arcs.begin(); it != arcs.end(); ++it){
+  for(typename std::vector<Arc_variant>::iterator it = arcs.begin(); it != arcs.end(); ++it){
     Circular_arc_2 ca;
     Line_arc_2 la;
-    if(assign(ca, *it)){
-      painterostream << ca;
-    } else if(assign(la, *it)){
-      painterostream << la;
+    if(auto ca = std::get_if<Circular_arc_2>(&(*it))){
+      painterostream << *ca;
+    } else if(auto la = std::get_if<Line_arc_2>(&(*it))){
+      painterostream << *la;
     }
   }
 
 
   painter->setPen(this->intersectionsPen());
   painterostream = PainterOstream<CK>(painter);
-  for(std::vector<CGAL::Object>::iterator it = intersections.begin(); it != intersections.end(); ++it){
-    std::pair<Circular_arc_point_2,unsigned> cap_ui;
-    Circular_arc_2 ca;
-    Line_arc_2 la;
-
-    if(assign(cap_ui, *it)){
+  for(typename std::vector<Inter_variant>::iterator it = intersections.begin(); it != intersections.end(); ++it){
+    if(auto cap_ui = std::get_if<std::pair<Circular_arc_point_2,unsigned>>(&*it)){
       QTransform matrix = painter->worldTransform();
       painter->resetTransform();
-      painter->drawPoint(matrix.map(convert(cap_ui.first)));
+      painter->drawPoint(matrix.map(convert(cap_ui->first)));
       painter->setWorldTransform(matrix);
-    }if(assign(ca, *it)){
-      painterostream << ca;
-    } else if(assign(la, *it)){
-      painterostream << la;
+    }if(auto ca = std::get_if<Circular_arc_2>(&(*it))){
+      painterostream << *ca;
+    } else if(auto la = std::get_if<Line_arc_2>(&(*it))){
+      painterostream << *la;
     }
   }
 }
@@ -135,22 +135,22 @@ ArcsGraphicsItem<CK>::updateBoundingBox()
   bounding_rect = QRectF(0,0,100, 100);
   Bbox_2 bb;
   bool initialized = false;
-  for(std::vector<CGAL::Object>::iterator it = arcs.begin(); it != arcs.end(); ++it){
+  for(typename std::vector<Arc_variant>::iterator it = arcs.begin(); it != arcs.end(); ++it){
     Circular_arc_2 ca;
     Line_arc_2 la;
-    if(assign(ca, *it)){
+    if(auto ca = std::get_if<Circular_arc_2>(&(*it))){
       if(initialized){
-        bb = bb + ca.supporting_circle().bbox();
+        bb = bb + ca->supporting_circle().bbox();
       } else {
         initialized = true;
-        bb = ca.supporting_circle().bbox();
+        bb = ca->supporting_circle().bbox();
       }
-    } else if(assign(la, *it)){
+    } else if(auto la = std::get_if<Line_arc_2>(&(*it))){
       if(initialized){
-        bb = bb + la.bbox();
+        bb = bb + la->bbox();
       } else {
         initialized = true;
-        bb = la.bbox();
+        bb = la->bbox();
       }
     }
   }
diff --git a/GraphicsView/demo/Circular_kernel_2/Circular_kernel_2.cpp b/GraphicsView/demo/Circular_kernel_2/Circular_kernel_2.cpp
index 4fa766fb87c9..e593af52c147 100644
--- a/GraphicsView/demo/Circular_kernel_2/Circular_kernel_2.cpp
+++ b/GraphicsView/demo/Circular_kernel_2/Circular_kernel_2.cpp
@@ -9,7 +9,6 @@
 #include <CGAL/Circular_kernel_2.h>
 #include <CGAL/intersections.h>
 #include <CGAL/Circular_kernel_2.h>
-#include <CGAL/Object.h>
 #include <CGAL/IO/WKT.h>
 
 // Qt headers
@@ -38,12 +37,15 @@ typedef CircularKernel::Segment_2                               Segment_2;
 typedef CircularKernel::Line_arc_2                              Line_arc_2;
 typedef CircularKernel::Circular_arc_2                          Circular_arc_2;
 typedef CircularKernel::Circular_arc_point_2                    Circular_arc_point_2;
-
+typedef std::variant<Circular_arc_2, Line_arc_2 >               Arc_variant;
+typedef std::variant<std::pair<Circular_arc_point_2, unsigned>,
+                     Circular_arc_2, Line_arc_2 >               Inter_variant;
 
 typedef CGAL::Qt::ArcsGraphicsItem<CircularKernel>                 ArcsGraphicsItem;
 
 
-typedef std::vector<CGAL::Object>                           ArcContainer;
+typedef std::vector<Arc_variant>                                ArcContainer;
+typedef std::vector<Inter_variant>                              ArcIntersection;
 
 class MainWindow :
   public CGAL::Qt::DemosMainWindow,
@@ -53,7 +55,7 @@ class MainWindow :
 
 private:
   ArcContainer arcs;
-  ArcContainer intersections;
+  ArcIntersection intersections;
   QGraphicsScene scene;
 
   ArcsGraphicsItem * agi;
@@ -68,7 +70,7 @@ public Q_SLOTS:
 
   virtual void open(QString);
 
-  void processInput(CGAL::Object o);
+  void processInput(Arc_variant o);
 
 
   void on_actionInsertCircularArc_toggled(bool checked);
@@ -107,8 +109,8 @@ MainWindow::MainWindow()
   // the signal/slot mechanism
   cai = new CGAL::Qt::GraphicsViewCircularArcInput<CircularKernel>(this, &scene);
 
-  QObject::connect(cai, SIGNAL(generate(CGAL::Object)),
-                   this, SLOT(processInput(CGAL::Object)));
+  QObject::connect(cai, SIGNAL(generate(Arc_variant)),
+                   this, SLOT(processInput(Arc_variant)));
 
   // Manual handling of actions
   //
@@ -146,33 +148,33 @@ MainWindow::MainWindow()
 
 
 void
-MainWindow::processInput(CGAL::Object o)
+MainWindow::processInput(Arc_variant o)
 {
-  Circular_arc_2 ca;
-  Line_arc_2 la;
+  const Circular_arc_2* ca = nullptr;
+  const Line_arc_2* la = nullptr;
   bool is_circular = false;
 
-  if(assign(ca, o)){
+  if( (ca = std::get_if<Circular_arc_2>(&o)) ){
     is_circular = true;
-  } else if(! assign(la, o)){
+  } else if(! (la = std::get_if<Line_arc_2>(&o))){
     std::cerr << "unknown object" << std::endl;
     return;
   }
 
-  for(std::vector<CGAL::Object>::iterator it = arcs.begin(); it != arcs.end(); ++it){
+  for(std::vector<Arc_variant>::iterator it = arcs.begin(); it != arcs.end(); ++it){
     Circular_arc_2 vca;
     Line_arc_2 vla;
-    if(assign(vca, *it)){
+    if(auto vca = std::get_if<Circular_arc_2>(&(*it))){
       if(is_circular){
-        CGAL::intersection(ca, vca, std::back_inserter(intersections));
+        CGAL::intersection(*ca, *vca, std::back_inserter(intersections));
       } else {
-        CGAL::intersection(la, vca, std::back_inserter(intersections));
+        CGAL::intersection(*la, *vca, std::back_inserter(intersections));
       }
-    } else if(assign(vla, *it)){
+    } else if(auto vla = std::get_if<Line_arc_2>(&(*it))){
       if(is_circular){
-        CGAL::intersection(ca, vla, std::back_inserter(intersections));
+        CGAL::intersection(*ca, *vla, std::back_inserter(intersections));
       } else {
-        CGAL::intersection(la, vla, std::back_inserter(intersections));
+        CGAL::intersection(*la, *vla, std::back_inserter(intersections));
       }
     }
   }
@@ -241,32 +243,30 @@ MainWindow::open(QString fileName)
         {
           Line_arc_2 la(Segment_2(multi_points[0],
                         multi_points[1]));
-          for(std::vector<CGAL::Object>::iterator it = arcs.begin(); it != arcs.end(); ++it){
-            Circular_arc_2 vca;
-            Line_arc_2 vla;
-            if(assign(vca, *it)){
-              CGAL::intersection(la, vca, std::back_inserter(intersections));
-            } else if(assign(vla, *it)){
-              CGAL::intersection(la, vla, std::back_inserter(intersections));
+          for(std::vector<Arc_variant>::iterator it = arcs.begin(); it != arcs.end(); ++it){
+            if(auto vca = std::get_if<Circular_arc_2>(&(*it))){
+              CGAL::intersection(la, *vca, std::back_inserter(intersections));
+            } else if(auto vla = std::get_if<Line_arc_2>(&(*it))){
+              CGAL::intersection(la, *vla, std::back_inserter(intersections));
             }
           }
-          arcs.push_back(make_object(la));
+          arcs.push_back(la);
         }
         else if(multi_points.size() == 3)
         {
           Circular_arc_2 ca(multi_points[0],
                             multi_points[1],
                             multi_points[2]);
-          for(std::vector<CGAL::Object>::iterator it = arcs.begin(); it != arcs.end(); ++it){
+          for(std::vector<Arc_variant>::iterator it = arcs.begin(); it != arcs.end(); ++it){
             Circular_arc_2 vca;
             Line_arc_2 vla;
-            if(assign(vca, *it)){
-              CGAL::intersection(ca, vca, std::back_inserter(intersections));
-            } else if(assign(vla, *it)){
-              CGAL::intersection(ca, vla, std::back_inserter(intersections));
+            if(auto vca = std::get_if<Circular_arc_2>(&(*it))){
+              CGAL::intersection(ca, *vca, std::back_inserter(intersections));
+            } else if(auto vla = std::get_if<Line_arc_2>(&(*it))){
+              CGAL::intersection(ca, *vla, std::back_inserter(intersections));
             }
           }
-          arcs.push_back(make_object(ca));
+          arcs.push_back(ca);
         }
         else if(multi_points.size()>0)
         {
@@ -285,16 +285,14 @@ MainWindow::open(QString fileName)
           Point_2 q(x,y);
 
           Line_arc_2 la(Segment_2(p,q));
-          for(std::vector<CGAL::Object>::iterator it = arcs.begin(); it != arcs.end(); ++it){
-            Circular_arc_2 vca;
-            Line_arc_2 vla;
-            if(assign(vca, *it)){
-              CGAL::intersection(la, vca, std::back_inserter(intersections));
-            } else if(assign(vla, *it)){
-              CGAL::intersection(la, vla, std::back_inserter(intersections));
+          for(std::vector<Arc_variant>::iterator it = arcs.begin(); it != arcs.end(); ++it){
+            if(auto vca = std::get_if<Circular_arc_2>(&(*it))){
+              CGAL::intersection(la, *vca, std::back_inserter(intersections));
+            } else if(auto vla = std::get_if<Line_arc_2>(&(*it))){
+              CGAL::intersection(la, *vla, std::back_inserter(intersections));
             }
           }
-          arcs.push_back(make_object(la));
+          arcs.push_back(la);
         } else if(c == 'c'){
           ifs >> x >> y;
           Point_2 p(x,y);
@@ -303,16 +301,16 @@ MainWindow::open(QString fileName)
           ifs >> x >> y;
           Point_2 r(x,y);
           Circular_arc_2 ca(p,q,r);
-          for(std::vector<CGAL::Object>::iterator it = arcs.begin(); it != arcs.end(); ++it){
+          for(std::vector<Arc_variant>::iterator it = arcs.begin(); it != arcs.end(); ++it){
             Circular_arc_2 vca;
             Line_arc_2 vla;
-            if(assign(vca, *it)){
-              CGAL::intersection(ca, vca, std::back_inserter(intersections));
-            } else if(assign(vla, *it)){
-              CGAL::intersection(ca, vla, std::back_inserter(intersections));
+            if(auto vca = std::get_if<Circular_arc_2>(&(*it))){
+              CGAL::intersection(ca, *vca, std::back_inserter(intersections));
+            } else if(auto vla = std::get_if<Line_arc_2>(&(*it))){
+              CGAL::intersection(ca, *vla, std::back_inserter(intersections));
             }
           }
-          arcs.push_back(make_object(ca));
+          arcs.push_back(ca);
         }
       }
     }

From 57fe29fe4f3308f9b2fcbfdfb303481581de4705 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 4 Aug 2023 11:26:46 +0200
Subject: [PATCH 0581/1398] Add some comments about failed speedup experiments

---
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h         | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index ba752a77590b..04b30cf76783 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1082,10 +1082,12 @@ class Alpha_wrap_3
         const Cell_handle conflict_cell = m_tr.locate(steiner_point, lt, li, lj, neighbor);
         CGAL_assertion(lt != Triangulation::VERTEX);
 
+        // Using small vectors like in Triangulation_3 does not bring any runtime improvement
         std::vector<Facet> boundary_facets;
         std::vector<Cell_handle> conflict_zone;
         boundary_facets.reserve(32);
         conflict_zone.reserve(32);
+
         m_tr.find_conflicts(steiner_point, conflict_cell,
                             std::back_inserter(boundary_facets),
                             std::back_inserter(conflict_zone));
@@ -1112,6 +1114,8 @@ class Alpha_wrap_3
         visitor.before_Steiner_point_insertion(*this, steiner_point);
 
         // Actual insertion of the Steiner point
+        // We could use TDS functions to avoid recomputing the conflict zone, but in practice
+        // it does not bring any runtime improvements
         Vertex_handle vh = m_tr.insert(steiner_point, lt, conflict_cell, li, lj);
         vh->type() = AW3i::Vertex_type:: DEFAULT;
 

From 361f6e2f63c57410fcabbcb05f8bf3baddbd66d3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 4 Aug 2023 13:30:26 +0200
Subject: [PATCH 0582/1398] Clean code to use Face_location /
 Barycentric_coordinates everywhere

---
 .../CGAL/Polygon_mesh_processing/locate.h     | 144 ++++++------------
 1 file changed, 50 insertions(+), 94 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
index 26d0266e03ad..a8359779125b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
@@ -52,6 +52,36 @@
 
 namespace CGAL {
 namespace Polygon_mesh_processing {
+
+/// \ingroup PMP_locate_grp
+///
+/// A variant used in the function `get_descriptor_from_location()`.
+template <typename TriangleMesh>
+using descriptor_variant = boost::variant<typename boost::graph_traits<TriangleMesh>::vertex_descriptor,
+                                          typename boost::graph_traits<TriangleMesh>::halfedge_descriptor,
+                                          typename boost::graph_traits<TriangleMesh>::face_descriptor>;
+
+/// \ingroup PMP_locate_grp
+///
+/// A triplet of coordinates describing the barycentric coordinates of a point
+/// with respect to the vertices of a triangular face.
+///
+/// \sa `Face_location`
+template <typename FT>
+using Barycentric_coordinates = std::array<FT, 3>;
+
+/// \ingroup PMP_locate_grp
+///
+/// If `tm` is the input triangulated surface mesh and given the pair (`f`, `bc`)
+/// such that `bc` is the triplet of barycentric coordinates `(w0, w1, w2)`, the correspondence
+/// between the coordinates in `bc` and the vertices of the face `f` is the following:
+///   - `w0` corresponds to `source(halfedge(f, tm), tm)`
+///   - `w1` corresponds to `target(halfedge(f, tm), tm)`
+///   - `w2` corresponds to `target(next(halfedge(f, tm), tm), tm)`
+template <typename TriangleMesh, typename FT>
+using Face_location = std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
+                                Barycentric_coordinates<FT> >;
+
 namespace internal {
 
 // The Ray must have the same ambient dimension as the property map's value type (aka, the point type)
@@ -85,51 +115,20 @@ struct Location_traits
 
   typedef typename boost::graph_traits<TriangleMesh>::face_descriptor            face_descriptor;
 
-  typedef std::array<FT, 3>                                                      Barycentric_coordinates;
-  typedef std::pair<face_descriptor, Barycentric_coordinates>                    Face_location;
+  typedef CGAL::Polygon_mesh_processing::Barycentric_coordinates<FT>             Barycentric_coordinates;
+  typedef CGAL::Polygon_mesh_processing::Face_location<TriangleMesh, FT>         Face_location;
 };
 
 } // end namespace internal
 
-/// \ingroup PMP_locate_grp
-///
-/// A variant used in the function `get_descriptor_from_location()`.
-template <typename TriangleMesh>
-using descriptor_variant = boost::variant<typename boost::graph_traits<TriangleMesh>::vertex_descriptor,
-                                          typename boost::graph_traits<TriangleMesh>::halfedge_descriptor,
-                                          typename boost::graph_traits<TriangleMesh>::face_descriptor>;
-
-/// \ingroup PMP_locate_grp
-///
-/// A triplet of coordinates describing the barycentric coordinates of a point
-/// with respect to the vertices of a triangular face.
-///
-/// \sa `Face_location`
-template <typename FT>
-using Barycentric_coordinates = std::array<FT, 3>;
-
-/// \ingroup PMP_locate_grp
-///
-/// If `tm` is the input triangulated surface mesh and given the pair (`f`, `bc`)
-/// such that `bc` is the triplet of barycentric coordinates `(w0, w1, w2)`, the correspondence
-/// between the coordinates in `bc` and the vertices of the face `f` is the following:
-///   - `w0` corresponds to `source(halfedge(f, tm), tm)`
-///   - `w1` corresponds to `target(halfedge(f, tm), tm)`
-///   - `w2` corresponds to `target(next(halfedge(f, tm), tm), tm)`
-template <typename TriangleMesh, typename FT>
-using Face_location = std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                Barycentric_coordinates<FT> >;
-
 // forward declarations
 template <typename FT, typename TriangleMesh>
-bool is_in_face(const std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                std::array<FT, 3> >& loc,
+bool is_in_face(const Face_location<TriangleMesh, FT>& loc,
                 const TriangleMesh& tm);
 
 template <typename FT, typename TriangleMesh>
 descriptor_variant<TriangleMesh>
-get_descriptor_from_location(const std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                             std::array<FT, 3> >& loc,
+get_descriptor_from_location(const Face_location<TriangleMesh, FT>& loc,
                              const TriangleMesh& tm);
 
 // end of forward declarations
@@ -138,8 +137,7 @@ namespace internal {
 
 template <typename FT, typename TriangleMesh, typename OutputIterator>
 OutputIterator
-incident_faces(const std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                               std::array<FT, 3> >& location,
+incident_faces(const Face_location<TriangleMesh, FT>& loc,
                const TriangleMesh& tm,
                OutputIterator out)
 {
@@ -147,7 +145,7 @@ incident_faces(const std::pair<typename boost::graph_traits<TriangleMesh>::face_
   typedef typename boost::graph_traits<TriangleMesh>::halfedge_descriptor  halfedge_descriptor;
   typedef typename boost::graph_traits<TriangleMesh>::face_descriptor      face_descriptor;
 
-  const descriptor_variant<TriangleMesh> dv = get_descriptor_from_location(location, tm);
+  const descriptor_variant<TriangleMesh> dv = get_descriptor_from_location(loc, tm);
 
   if(const vertex_descriptor* vd_ptr = boost::get<vertex_descriptor>(&dv))
   {
@@ -173,7 +171,7 @@ incident_faces(const std::pair<typename boost::graph_traits<TriangleMesh>::face_
 // Snapping coordinates for robustness
 template <typename FT>
 bool
-snap_coordinates_to_border(std::array<FT, 3>& coords,
+snap_coordinates_to_border(Barycentric_coordinates<FT>& coords,
                            const FT tolerance = std::numeric_limits<FT>::epsilon())
 {
 #ifdef CGAL_PMP_LOCATE_DEBUG
@@ -224,8 +222,7 @@ snap_coordinates_to_border(std::array<FT, 3>& coords,
 
 template <typename FT, typename TriangleMesh>
 bool
-snap_location_to_border(std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                  std::array<FT, 3> >& loc,
+snap_location_to_border(Face_location<TriangleMesh, FT>& loc,
                         const TriangleMesh /*tm*/,
                         const FT tolerance = std::numeric_limits<FT>::epsilon())
 {
@@ -235,7 +232,7 @@ snap_location_to_border(std::pair<typename boost::graph_traits<TriangleMesh>::fa
 template <typename K, typename P, int = P::Ambient_dimension::value>
 struct Barycentric_coordinate_calculator // 2D version
 {
-  std::array<typename K::FT, 3>
+  Barycentric_coordinates<typename K::FT>
   operator()(const P& ip, const P& iq, const P& ir, const P& iquery, const K& k) const
   {
     typedef typename K::FT                        FT;
@@ -273,7 +270,7 @@ struct Barycentric_coordinate_calculator // 2D version
 template <typename K, typename P>
 struct Barycentric_coordinate_calculator<K, P, 3 /*3D specialization*/>
 {
-  std::array<typename K::FT, 3>
+  Barycentric_coordinates<typename K::FT>
   operator()(const P& ip, const P& iq, const P& ir, const P& iquery, const K& k) const
   {
     typedef typename K::FT                        FT;
@@ -364,7 +361,7 @@ struct Barycentric_point_constructor<K, P, 3> // 3D version
 /// \pre `query` lies on the plane defined by `p`, `q`, and `r`.
 ///
 template <typename GeomTraits, typename Point>
-std::array<typename GeomTraits::FT, 3>
+Barycentric_coordinates<typename GeomTraits::FT>
 barycentric_coordinates(const Point& p, const Point& q, const Point& r, const Point& query,
                         const GeomTraits& gt)
 {
@@ -373,7 +370,7 @@ barycentric_coordinates(const Point& p, const Point& q, const Point& r, const Po
 }
 
 template <typename Point>
-std::array<typename CGAL::Kernel_traits<Point>::type::FT, 3>
+Barycentric_coordinates<typename CGAL::Kernel_traits<Point>::type::FT>
 barycentric_coordinates(const Point& p, const Point& q, const Point& r, const Point& query)
 {
   typedef typename CGAL::Kernel_traits<Point>::type                     Kernel;
@@ -411,7 +408,7 @@ random_location_on_halfedge(typename boost::graph_traits<TriangleMesh>::halfedge
   const int h_id = halfedge_index_in_face(hd, tm);
   const FT t(rnd.uniform_real(0., 1.));
 
-  std::array<FT, 3> coordinates;
+  Barycentric_coordinates<FT> coordinates;
   coordinates[h_id] = t;
   coordinates[(h_id+1)%3] = FT(1)-t;
   coordinates[(h_id+2)%3] = FT(0);
@@ -510,8 +507,7 @@ descriptor_variant<TriangleMesh>
 #ifdef DOXYGEN_RUNNING // just for convenience because template alias do not allow template deduction
 get_descriptor_from_location(const Face_location<TriangleMesh, FT>& loc,
 #else
-get_descriptor_from_location(const std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                             std::array<FT, 3> >& loc,
+get_descriptor_from_location(const Face_location<TriangleMesh, FT>& loc,
 #endif
                              const TriangleMesh& tm)
 {
@@ -589,12 +585,10 @@ get_descriptor_from_location(const std::pair<typename boost::graph_traits<Triang
 template <typename FT, typename TriangleMesh, typename NamedParameters = parameters::Default_named_parameters>
 #ifdef DOXYGEN_RUNNING
 Point
-construct_point(const Face_location<TriangleMesh, FT>& loc,
 #else
 typename internal::Location_traits<TriangleMesh, NamedParameters>::Point
-construct_point(const std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                std::array<FT, 3> >& loc,
 #endif
+construct_point(const Face_location<TriangleMesh, FT>& loc,
                 const TriangleMesh& tm,
                 const NamedParameters& np = parameters::default_values())
 {
@@ -648,12 +642,7 @@ construct_point(const std::pair<typename boost::graph_traits<TriangleMesh>::face
 ///
 template <typename FT, typename TriangleMesh>
 bool
-#ifdef DOXYGEN_RUNNING
 is_on_vertex(const Face_location<TriangleMesh, FT>& loc,
-#else
-is_on_vertex(const std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                             std::array<FT, 3> >& loc,
-#endif
              const typename boost::graph_traits<TriangleMesh>::vertex_descriptor vd,
              const TriangleMesh& tm)
 {
@@ -692,12 +681,7 @@ is_on_vertex(const std::pair<typename boost::graph_traits<TriangleMesh>::face_de
 ///
 template <typename FT, typename TriangleMesh>
 bool
-#ifdef DOXYGEN_RUNNING
 is_on_halfedge(const Face_location<TriangleMesh, FT>& loc,
-#else
-is_on_halfedge(const std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                               std::array<FT, 3> >& loc,
-#endif
                const typename boost::graph_traits<TriangleMesh>::halfedge_descriptor hd,
                const TriangleMesh& tm)
 {
@@ -738,11 +722,7 @@ is_on_halfedge(const std::pair<typename boost::graph_traits<TriangleMesh>::face_
 ///
 template <typename FT, typename TriangleMesh>
 bool
-#ifdef DOXYGEN_RUNNING
 is_in_face(const Barycentric_coordinates<FT>& bar,
-#else
-is_in_face(const std::array<FT, 3>& bar,
-#endif
            const TriangleMesh& tm)
 {
   CGAL_USE(tm);
@@ -780,12 +760,7 @@ is_in_face(const std::array<FT, 3>& bar,
 ///
 template <typename FT, typename TriangleMesh>
 bool
-#ifdef DOXYGEN_RUNNING
 is_in_face(const Face_location<TriangleMesh, FT>& loc,
-#else
-is_in_face(const std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                           std::array<FT, 3> >& loc,
-#endif
            const TriangleMesh& tm)
 {
   return is_in_face(loc.second, tm);
@@ -812,12 +787,7 @@ is_in_face(const std::pair<typename boost::graph_traits<TriangleMesh>::face_desc
 ///
 template <typename FT, typename TriangleMesh>
 bool
-#ifdef DOXYGEN_RUNNING
 is_on_face_border(const Face_location<TriangleMesh, FT>& loc,
-#else
-is_on_face_border(const std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                  std::array<FT, 3> >& loc,
-#endif
                   const TriangleMesh& tm)
 {
   if(!is_in_face(loc, tm))
@@ -853,12 +823,7 @@ is_on_face_border(const std::pair<typename boost::graph_traits<TriangleMesh>::fa
 ///
 template <typename FT, typename TriangleMesh>
 bool
-#ifdef DOXYGEN_RUNNING
 is_on_mesh_border(const Face_location<TriangleMesh, FT>& loc,
-#else
-is_on_mesh_border(const std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                  std::array<FT, 3> >& loc,
-#endif
                   const TriangleMesh& tm)
 {
   typedef typename boost::graph_traits<TriangleMesh>::halfedge_descriptor halfedge_descriptor;
@@ -1136,7 +1101,7 @@ locate_in_face(const typename internal::Location_traits<TriangleMesh, NamedParam
   const Point_reference p1 = get(vpm, vd1);
   const Point_reference p2 = get(vpm, vd2);
 
-  std::array<FT, 3> coords = barycentric_coordinates<Geom_traits, Point>(p0, p1, p2, query, gt);
+  Barycentric_coordinates<FT> coords = barycentric_coordinates<Geom_traits, Point>(p0, p1, p2, query, gt);
 
   if(snap_tolerance != FT(0) && !is_in_face(coords, tm))
   {
@@ -1174,12 +1139,7 @@ locate_in_face(const typename internal::Location_traits<TriangleMesh, NamedParam
 ///
 template <typename FT, typename TriangleMesh>
 Face_location<TriangleMesh, FT>
-#ifdef DOXYGEN_RUNNING
 locate_in_adjacent_face(const Face_location<TriangleMesh, FT>& loc,
-#else
-locate_in_adjacent_face(const std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                        std::array<FT, 3> >& loc,
-#endif
                         const typename boost::graph_traits<TriangleMesh>::face_descriptor fd,
                         const TriangleMesh& tm)
 {
@@ -1247,11 +1207,9 @@ locate_in_adjacent_face(const std::pair<typename boost::graph_traits<TriangleMes
 // note: not returning the query location to emphasis that the known location can change too.
 template <typename FT, typename TriangleMesh, typename NamedParameters>
 bool
-locate_in_common_face(std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                std::array<FT, 3> >& known_location,
+locate_in_common_face(Face_location<TriangleMesh, FT>& known_location,
                       const typename internal::Location_traits<TriangleMesh, NamedParameters>::Point& query,
-                      std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                std::array<FT, 3> >& query_location,
+                      Face_location<TriangleMesh, FT>& query_location,
                       const TriangleMesh& tm,
                       const NamedParameters& np,
                       const FT tolerance = std::numeric_limits<FT>::epsilon())
@@ -1323,10 +1281,8 @@ locate_in_common_face(std::pair<typename boost::graph_traits<TriangleMesh>::face
 // - both locations must be known but can change
 template <typename FT, typename TriangleMesh>
 bool
-locate_in_common_face(std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                               std::array<FT, 3> >& first_location,
-                      std::pair<typename boost::graph_traits<TriangleMesh>::face_descriptor,
-                                std::array<FT, 3> >& second_location,
+locate_in_common_face(Face_location<TriangleMesh, FT>& first_location,
+                      Face_location<TriangleMesh, FT>& second_location,
                       const TriangleMesh& tm)
 {
   typedef typename boost::graph_traits<TriangleMesh>::face_descriptor      face_descriptor;

From 0ecba6b9b9c32735dcf98cf0981efd17b30de89e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 4 Aug 2023 14:24:58 +0200
Subject: [PATCH 0583/1398] const& should not be in the get

---
 .../include/internal/Qt/HyperbolicPainterOstream.h              | 2 +-
 .../include/internal/Qt/HyperbolicPainterOstreamCK.h            | 2 +-
 .../include/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h   | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h
index 81522776a5b3..e561bd30b692 100644
--- a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h
+++ b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstream.h
@@ -85,7 +85,7 @@ class PainterOstream< Hyperbolic_Delaunay_triangulation_traits_2<K> >
       return *this;
     }
 
-    const Circular_arc_2& arc = std::get<const Circular_arc_2&>(s);
+    const Circular_arc_2& arc = std::get<Circular_arc_2>(s);
 
     if(arc.squared_radius() > 100) {
       Euclidean_segment_2 seg(arc.source(), arc.target());
diff --git a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstreamCK.h b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstreamCK.h
index 61d6630eeb3a..f634789193cc 100644
--- a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstreamCK.h
+++ b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/include/internal/Qt/HyperbolicPainterOstreamCK.h
@@ -49,7 +49,7 @@ namespace Qt {
           return *this;
         }
 
-        const Circular_arc& arc = std::get<const Circular_arc&>(s);
+        const Circular_arc& arc = std::get<Circular_arc>(s);
 
         if(arc.squared_radius() > 10)
         {
diff --git a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
index e54c4cb75a8d..0c0829309b72 100644
--- a/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
+++ b/Hyperbolic_triangulation_2/include/CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h
@@ -468,7 +468,7 @@ class Hyperbolic_Delaunay_triangulation_traits_2
   typedef Hyperbolic_point_2                                    Hyperbolic_Voronoi_point_2;
   typedef typename Kernel::Circle_2                             Circle_2;
   typedef typename Kernel::Line_2                               Euclidean_line_2;
-  typedef std::variant<Circle_2,Euclidean_line_2>             Euclidean_circle_or_line_2;
+  typedef std::variant<Circle_2,Euclidean_line_2>               Euclidean_circle_or_line_2;
   typedef internal::HDT_2_Circular_arc_2<Self>                  Circular_arc_2;
   typedef typename Kernel::Segment_2                            Euclidean_segment_2; // only used internally here
   typedef std::variant<Circular_arc_2, Euclidean_segment_2>   Hyperbolic_segment_2;

From 33d70dd95fe700d87d13b24085c9f179e26df355 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 4 Aug 2023 14:32:48 +0200
Subject: [PATCH 0584/1398] Minor improvements to orient_PS's doc

---
 .../orient_polygon_soup.h                     | 20 ++++++++++++++-----
 1 file changed, 15 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup.h
index 2ffc899b5490..de2bcab9c1c9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/orient_polygon_soup.h
@@ -39,10 +39,10 @@ namespace CGAL {
 namespace Polygon_mesh_processing {
 
 /** \ingroup PMP_orientation_grp
+ *
  *  Default visitor model of `PMPPolygonSoupOrientationVisitor`.
  *  All of its functions have an empty body. This class can be used as a
- *  base class if only some of the functions of the concept require to be
- *  overridden.
+ *  base class if only some of the functions of the concept will be overridden.
  */
 struct Default_orientation_visitor{
   void non_manifold_edge(std::size_t, std::size_t, std::size_t){}
@@ -483,12 +483,22 @@ struct Polygon_soup_orienter
  *
  * \brief tries to consistently orient a soup of polygons in 3D space.
  *
- * When it is not possible to produce a combinatorial manifold surface,
+ * The algorithm re-orients polygons such that the orientation
+ * of adjacent polygons is consistent. Note that the adjacency is
+ * defined in a combinatorial sense, i.e. two polygons are sharing
+ * an edge if and only if the endpoints of this edge are represented
+ * by the same point indices in both faces (possibly in a different order);
+ * it is not sufficient for the points to be geometrically identical.
+ * One may use `CGAL::Polygon_mesh_processing::merge_duplicate_points_in_polygon_soup()`
+ * to convert geometrical point equality into combinatorial point equality.
+ *
+ * When it is not possible to produce a combinatorial manifold surface
+ * (for example, if the polygon soup makes up a Möbius strip),
  * some points are duplicated.
  * Because a polygon soup does not have any connectivity (each point
  * has as many occurrences as the number of polygons it belongs to),
  * duplicating one point (or a pair of points)
- * amounts to duplicate the polygon to which it belongs.
+ * amounts to duplicating the polygon to which it belongs.
  *
  * These points are either an endpoint of an edge incident to more
  * than two polygons, an endpoint of an edge between
@@ -521,7 +531,7 @@ struct Polygon_soup_orienter
  * \cgalNamedParamsEnd
  *
  * @return `true`  if the orientation operation succeeded.
- * @return `false` if some points were duplicated, thus producing a self-intersecting polyhedron.
+ * @return `false` if some points were duplicated, thus producing a combinatorially manifold but self-intersecting polyhedron.
  *
  * @sa `orient_triangle_soup_with_reference_triangle_mesh()`
  */

From 69202afc5452e95aed811e31e63fc95c6d2c0966 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 4 Aug 2023 14:40:13 +0200
Subject: [PATCH 0585/1398] fix L1_VD demo

---
 .../include/CGAL/L1_voronoi_traits_2.h               | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/GraphicsView/demo/L1_Voronoi_diagram_2/include/CGAL/L1_voronoi_traits_2.h b/GraphicsView/demo/L1_Voronoi_diagram_2/include/CGAL/L1_voronoi_traits_2.h
index 49be2350b4d8..e7d9b163a4c7 100644
--- a/GraphicsView/demo/L1_Voronoi_diagram_2/include/CGAL/L1_voronoi_traits_2.h
+++ b/GraphicsView/demo/L1_Voronoi_diagram_2/include/CGAL/L1_voronoi_traits_2.h
@@ -270,7 +270,7 @@ class L1_voronoi_traits_2 : public Arr_linear_traits_2<Kernel_>
 
       // The sites have the same x/y coordinate.
       if (s_x == CGAL::ZERO || s_y == CGAL::ZERO) {
-        *o++ = CGAL::make_object(Intersection_curve(CGAL::bisector(s1, s2), 1));
+        *o++ = Intersection_curve(CGAL::bisector(s1, s2), 1);
         return o;
       }
 
@@ -300,7 +300,7 @@ class L1_voronoi_traits_2 : public Arr_linear_traits_2<Kernel_>
       }
 
       // We construct the diagonal line either way.
-      *o++ = CGAL::make_object(Intersection_curve(Segment_2(p1, p2), 1));
+      *o++ = Intersection_curve(Segment_2(p1, p2), 1);
 
       // Now construct vertical rays. Two or four rays. If it is only two rays,
       // then the multiplicity of all the curves is 1.
@@ -309,14 +309,14 @@ class L1_voronoi_traits_2 : public Arr_linear_traits_2<Kernel_>
 
       if (s_d != CGAL::POSITIVE) {
         // horizontal rectangle or square = vertical rays.
-        *o++ = CGAL::make_object(Intersection_curve(Ray_2(*top, Direction_2(0, 1)), mult));
-        *o++ = CGAL::make_object(Intersection_curve(Ray_2(*bottom, Direction_2(0, -1)), mult));
+        *o++ = Intersection_curve(Ray_2(*top, Direction_2(0, 1)), mult);
+        *o++ = Intersection_curve(Ray_2(*bottom, Direction_2(0, -1)), mult);
       }
 
       if (s_d != CGAL::NEGATIVE) {
         // vertical rectangle or square = horizontal rays.
-        *o++ = CGAL::make_object(Intersection_curve(Ray_2(*right, Direction_2(1, 0)), mult));
-        *o++ = CGAL::make_object(Intersection_curve(Ray_2(*left, Direction_2(-1, 0)), mult));
+        *o++ = Intersection_curve(Ray_2(*right, Direction_2(1, 0)), mult);
+        *o++ = Intersection_curve(Ray_2(*left, Direction_2(-1, 0)), mult);
       }
 
       return o;

From 5d87958a7c7f0950c5728d498c42110c66039784 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 4 Aug 2023 14:40:24 +0200
Subject: [PATCH 0586/1398] fix format

only changing the top string, not the data
---
 .../SMDS_3/data/c3t3_io-hetero.binary.cgal    | Bin 1618 -> 1616 bytes
 1 file changed, 0 insertions(+), 0 deletions(-)

diff --git a/SMDS_3/test/SMDS_3/data/c3t3_io-hetero.binary.cgal b/SMDS_3/test/SMDS_3/data/c3t3_io-hetero.binary.cgal
index f4c958d923934984575fbf1a79ec79e6f498f161..ab735a65e00a81188a79d3f901e4c5c6b7a2f5a2 100644
GIT binary patch
delta 14
Vcmcb_bAe}q3v+Qv%0^F4HUKIP1m*w$

delta 16
Xcmcb>bBSky3u{t-esRf0cTP3{HdF<|


From f06d9fb606de8688ba2eff4721358b614b277f32 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 4 Aug 2023 15:04:26 +0200
Subject: [PATCH 0587/1398] fix shortcut mistake

---
 Triangulation/include/CGAL/Triangulation.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Triangulation/include/CGAL/Triangulation.h b/Triangulation/include/CGAL/Triangulation.h
index 9a3e4aecb47b..1c1bff783702 100644
--- a/Triangulation/include/CGAL/Triangulation.h
+++ b/Triangulation/include/CGAL/Triangulation.h
@@ -101,8 +101,8 @@ class Triangulation
       template<class Iter>
       CGAL::Orientation operator()(Iter a, Iter b) const
       {
-          return ifo(fop->value(),a,b);
         if (*fop)
+          return ifo(fop->value(),a,b);
         *fop = cfo(a,b);
         CGAL_assertion(ifo(fop->value(),a,b) == CGAL::POSITIVE);
         return CGAL::POSITIVE;

From 89fd91e35440048343c4df33c2e283ecb2f6e50a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 4 Aug 2023 16:56:55 +0200
Subject: [PATCH 0588/1398] fix argt demo

changes in Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
should be undo
---
 .../ArrangementGraphicsItem.cpp               | 11 ++---
 .../Utils/IntersectCurves.cpp                 | 18 +++++++-
 .../Arrangement_on_surface_2/Utils/Utils.cpp  | 45 +++++++++----------
 .../include/CGAL/Arr_polycurve_traits_2.h     |  6 +--
 4 files changed, 48 insertions(+), 32 deletions(-)

diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementGraphicsItem.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementGraphicsItem.cpp
index 86ad76fe086e..d8573dfa0cb6 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementGraphicsItem.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementGraphicsItem.cpp
@@ -961,15 +961,16 @@ findOtherInterestingPoints<demo_types::DemoTypes::Alg_seg_arr>
  const CGAL::Bbox_2& allowable_range) {
   using Traits = demo_types::DemoTypes::Alg_seg_traits;
   CGAL::Bbox_2 bb = {};
-  std::vector<CGAL::Object> intersections;
+  typedef std::pair<typename Traits::Point_2, unsigned int> Pt_m;
+  std::vector<Pt_m> intersections;
   for (auto it = arr->edges_begin(); it != arr->edges_end(); ++it) {
     for (auto& arc : getXyCurves(arr->traits()))
+    {
       if (arc.is_vertical() != it->curve().is_vertical())
-        it->curve().intersections(arc, std::back_inserter(intersections));
+        it->curve().intersections(arc, CGAL::dispatch_or_drop_output<Pt_m>(std::back_inserter(intersections)));
+      }
   }
-  for (auto it = intersections.begin(); it != intersections.end(); it++) {
-    std::pair<typename Traits::Point_2, unsigned int> point_multiplicity;
-    CGAL::assign(point_multiplicity, *it);
+  for (auto point_multiplicity :intersections) {
     auto& point = point_multiplicity.first;
     if (point.location() == CGAL::ARR_INTERIOR) {
       auto xy = point.to_double();
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp
index f2d154c4eacb..ef0d027ab853 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp
@@ -11,6 +11,8 @@
 
 #include "IntersectCurves.h"
 #include "ArrangementTypes.h"
+#include <boost/function_output_iterator.hpp>
+
 
 template <typename Traits_>
 Intersect_curves<Traits_>::Intersect_curves(const Traits* traits) :
@@ -18,12 +20,26 @@ Intersect_curves<Traits_>::Intersect_curves(const Traits* traits) :
 {
 }
 
+struct Object_putter
+{
+  std::vector<CGAL::Object>& v;
+  Object_putter(std::vector<CGAL::Object>& v)
+    : v(v)
+  {}
+
+  template <class T>
+  void operator()(const T& t)
+  {
+    v.push_back(make_object(t));
+  }
+};
+
 template <typename Traits_>
 void Intersect_curves<Traits_>::operator()(
   const X_monotone_curve_2& cv1, const X_monotone_curve_2& cv2,
   std::vector<CGAL::Object>& output)
 {
-  this->intersect(cv1, cv2, std::back_inserter(output));
+  this->intersect(cv1, cv2, boost::make_function_output_iterator(Object_putter(output)));
 }
 
 ARRANGEMENT_DEMO_SPECIALIZE_TRAITS(Intersect_curves)
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.cpp
index 438b8214908e..df21f6699ab9 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/Utils.cpp
@@ -625,14 +625,14 @@ operator()(const X_monotone_curve_2& curve, const CoordinateType& x,
   Point_2 p2c1(x, CoordinateType(clipRect.ymax() + 1));
 
   const X_monotone_curve_2 verticalLine = ctr_xcv(p1c1, p2c1);
-  CGAL::Object o;
-  CGAL::Oneset_iterator<CGAL::Object> oi(o);
+  std::vector<IntersectionResult> pairs;
 
-  this->intersectCurves(curve, verticalLine, oi);
+  this->intersectCurves(curve, verticalLine,
+    CGAL::dispatch_or_drop_output<IntersectionResult>(std::back_inserter(pairs)));
 
   IntersectionResult pair;
-  if (CGAL::assign(pair, o)) {
-    Point_2 pt = pair.first;
+  if (!pairs.empty()) {
+    Point_2 pt = pairs[0].first;
     res = pt.y();
   }
   return res;
@@ -654,14 +654,13 @@ operator()(const X_monotone_curve_2& curve, const CoordinateType& x,
   Point_2 p2c1(x, CoordinateType(10000000));  // upper bounding box
 
   const X_monotone_curve_2 verticalLine = ctr_xcv(p1c1, p2c1);
-  CGAL::Object o;
-  CGAL::Oneset_iterator<CGAL::Object> oi(o);
+  std::vector<IntersectionResult> pairs;
 
-  this->intersectCurves(curve, verticalLine, oi);
+  this->intersectCurves(curve, verticalLine,
+    CGAL::dispatch_or_drop_output<IntersectionResult>(std::back_inserter(pairs)));
 
-  IntersectionResult pair;
-  if (CGAL::assign(pair, o)) {
-    Point_2 pt = pair.first;
+  if (!pairs.empty()) {
+    Point_2 pt = pairs[0].first;
     res = pt.y();
   }
   return res;
@@ -681,15 +680,15 @@ operator()(const X_monotone_curve_2& curve, const Coordinate_type& x)
   Point_2 p2c1(x, Coordinate_type(clip_rect.ymax() + 1));
 
   const X_monotone_curve_2 vertical_line = ctr_xcv(p1c1, p2c1);
-  CGAL::Object o;
-  CGAL::Oneset_iterator<CGAL::Object> oi(o);
 
-  this->intersect_curves(curve, vertical_line, oi);
+  std::vector<IntersectionResult> pairs;
+
+  this->intersect_curves(curve, vertical_line,
+    CGAL::dispatch_or_drop_output<IntersectionResult>(std::back_inserter(pairs)));
 
   Coordinate_type res(0);
-  IntersectionResult pair;
-  if (CGAL::assign(pair, o)) {
-    Point_2 pt = pair.first;
+  if (!pairs.empty()) {
+    Point_2 pt = pairs[0].first;
     res = pt.y();
   }
   return res;
@@ -708,15 +707,15 @@ auto Arr_compute_y_at_x_2<CGAL::Arr_algebraic_segment_traits_2<Coefficient_>>::
 operator()(const X_monotone_curve_2& curve, const CoordinateType& x)
   -> CoordinateType
 {
-  CGAL::Object o;
-  CGAL::Oneset_iterator<CGAL::Object> oi(o);
   Intersect_2 intersect = traits->intersect_2_object();
   X_monotone_curve_2 c2 = this->makeVerticalLine(x);
-  intersect(curve, c2, oi);
-  std::pair<Point_2, Multiplicity> res;
-  if (CGAL::assign(res, o)) {
+  typedef std::pair<Point_2, Multiplicity> PtM;
+
+  std::vector<PtM> res;
+  intersect(curve, c2, CGAL::dispatch_or_drop_output<PtM>(std::back_inserter(res)));
+  if (!res.empty()) {
     // TODO: handle failure case
-    const Point_2& p = res.first;
+    const Point_2& p = res[0].first;
     CoordinateType coord = p.y();
     return coord;
   }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
index 488ed21dea79..50433fe8724e 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
@@ -826,7 +826,7 @@ class Arr_polycurve_traits_2 :
               std::get_if<X_monotone_subcurve_2>(&xection);
             if (subcv_p != nullptr) {
               ocv.push_back(*subcv_p);
-              oi = output_ocv (ocv, invert_ocv, oi);
+              output_ocv (ocv, invert_ocv, oi);
               continue;
             }
 
@@ -883,7 +883,7 @@ class Arr_polycurve_traits_2 :
             // An overlap occurred at the previous iteration:
             // Output the overlapping polycurve.
             CGAL_assertion(ocv.size() > 0);
-            oi = output_ocv (ocv, invert_ocv, oi);
+            output_ocv (ocv, invert_ocv, oi);
           }
           else {
             // The left point of the current subcurve of one
@@ -929,7 +929,7 @@ class Arr_polycurve_traits_2 :
 
         // Output the remaining overlapping polycurve, if necessary.
       if (ocv.size() > 0) {
-        oi = output_ocv (ocv, invert_ocv, oi);
+        output_ocv (ocv, invert_ocv, oi);
       }
       else if (right_coincides) {
         typedef std::pair<Point_2,Multiplicity> return_point;

From 3cef94d401ffe247010bf1a814cacacb1ab80186 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 4 Aug 2023 22:12:58 +0200
Subject: [PATCH 0589/1398] make the output iterator movable

restore changes in Arr_polycurve_traits_2
---
 .../Arrangement_on_surface_2/Utils/IntersectCurves.cpp    | 8 ++++----
 .../include/CGAL/Arr_polycurve_traits_2.h                 | 6 +++---
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp
index ef0d027ab853..5e98113dabc5 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp
@@ -22,15 +22,15 @@ Intersect_curves<Traits_>::Intersect_curves(const Traits* traits) :
 
 struct Object_putter
 {
-  std::vector<CGAL::Object>& v;
-  Object_putter(std::vector<CGAL::Object>& v)
-    : v(v)
+  std::reference_wrapper<std::vector<CGAL::Object>> v;
+  Object_putter(std::vector<CGAL::Object>& v_)
+    : v(std::ref(v_))
   {}
 
   template <class T>
   void operator()(const T& t)
   {
-    v.push_back(make_object(t));
+    v.get().push_back(make_object(t));
   }
 };
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
index 50433fe8724e..488ed21dea79 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_polycurve_traits_2.h
@@ -826,7 +826,7 @@ class Arr_polycurve_traits_2 :
               std::get_if<X_monotone_subcurve_2>(&xection);
             if (subcv_p != nullptr) {
               ocv.push_back(*subcv_p);
-              output_ocv (ocv, invert_ocv, oi);
+              oi = output_ocv (ocv, invert_ocv, oi);
               continue;
             }
 
@@ -883,7 +883,7 @@ class Arr_polycurve_traits_2 :
             // An overlap occurred at the previous iteration:
             // Output the overlapping polycurve.
             CGAL_assertion(ocv.size() > 0);
-            output_ocv (ocv, invert_ocv, oi);
+            oi = output_ocv (ocv, invert_ocv, oi);
           }
           else {
             // The left point of the current subcurve of one
@@ -929,7 +929,7 @@ class Arr_polycurve_traits_2 :
 
         // Output the remaining overlapping polycurve, if necessary.
       if (ocv.size() > 0) {
-        output_ocv (ocv, invert_ocv, oi);
+        oi = output_ocv (ocv, invert_ocv, oi);
       }
       else if (right_coincides) {
         typedef std::pair<Point_2,Multiplicity> return_point;

From 61874d15e1ce69dbae099ff584c8639a35a0c18a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 9 Aug 2023 08:36:44 +0200
Subject: [PATCH 0590/1398] do not use deprecated code

---
 .../Arrangement_on_surface_2/Traits_test.h    | 44 +++++++++----------
 Mesh_3/test/Mesh_3/test_meshing_utilities.h   |  4 +-
 2 files changed, 24 insertions(+), 24 deletions(-)

diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h
index fe340b4a88cd..3331200a6076 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_test.h
@@ -733,7 +733,7 @@ min_vertex_wrapper(std::istringstream& str_stream)
   unsigned int id1, id2;
   str_stream >> id1 >> id2;
   Point_2& exp_answer = this->m_points[id2];
-  std::cout << "Test: min_vertex( " << CGAL::oformat(this->m_xcurves[id1]) << " ) ? "
+  std::cout << "Test: min_vertex( " << CGAL::IO::oformat(this->m_xcurves[id1]) << " ) ? "
             << exp_answer << " ";
 
   Point_2 real_answer =
@@ -751,7 +751,7 @@ max_vertex_wrapper(std::istringstream& str_stream)
   unsigned int id1, id2;
   str_stream >> id1 >> id2;
   Point_2& exp_answer = this->m_points[id2];
-  std::cout << "Test: max_vertex( " << CGAL::oformat(this->m_xcurves[id1]) << " ) ? "
+  std::cout << "Test: max_vertex( " << CGAL::IO::oformat(this->m_xcurves[id1]) << " ) ? "
             << exp_answer << " ";
 
   Point_2 real_answer =
@@ -767,7 +767,7 @@ is_vertical_wrapper(std::istringstream& str_stream)
   unsigned int id;
   str_stream >> id;
   bool exp_answer = this->get_expected_boolean(str_stream);
-  std::cout << "Test: is_vertical( " << CGAL::oformat(this->m_xcurves[id]) << " ) ? "
+  std::cout << "Test: is_vertical( " << CGAL::IO::oformat(this->m_xcurves[id]) << " ) ? "
             << exp_answer << " ";
 
   bool real_answer =
@@ -789,7 +789,7 @@ compare_y_at_x_wrapper(std::istringstream& str_stream)
   str_stream >> id1 >> id2;
   unsigned int exp_answer = this->get_expected_enum(str_stream);
   std::cout << "Test: compare_y_at_x( " << this->m_points[id1] << ","
-           << CGAL::oformat(this->m_xcurves[id2]) << " ) ? " << exp_answer << " ";
+           << CGAL::IO::oformat(this->m_xcurves[id2]) << " ) ? " << exp_answer << " ";
 
   unsigned int real_answer =
     this->m_geom_traits.compare_y_at_x_2_object()(this->m_points[id1],
@@ -853,8 +853,8 @@ compare_y_at_x_right_wrapper(std::istringstream& str_stream)
   unsigned int id1, id2, id3;
   str_stream >> id1 >> id2 >> id3;
   unsigned int exp_answer = this->get_expected_enum(str_stream);
-  std::cout << "Test: compare_y_at_x_right( " << CGAL::oformat(this->m_xcurves[id1]) << ","
-            << CGAL::oformat(this->m_xcurves[id2]) << ", " << this->m_points[id3] << " ) ? "
+  std::cout << "Test: compare_y_at_x_right( " << CGAL::IO::oformat(this->m_xcurves[id1]) << ","
+            << CGAL::IO::oformat(this->m_xcurves[id2]) << ", " << this->m_points[id3] << " ) ? "
             << exp_answer << " ";
 
   unsigned int real_answer =
@@ -891,8 +891,8 @@ equal_curves_wrapper(std::istringstream& str_stream)
   unsigned int id1, id2;
   str_stream >> id1 >> id2;
   bool exp_answer = this->get_expected_boolean(str_stream);
-  std::cout << "Test: equal( " << CGAL::oformat(this->m_xcurves[id1]) << ", "
-            << CGAL::oformat(this->m_xcurves[id2]) << " ) ? " << exp_answer << " ";
+  std::cout << "Test: equal( " << CGAL::IO::oformat(this->m_xcurves[id1]) << ", "
+            << CGAL::IO::oformat(this->m_xcurves[id2]) << " ) ? " << exp_answer << " ";
 
   bool real_answer = this->m_geom_traits.equal_2_object()(this->m_xcurves[id1],
                                                           this->m_xcurves[id2]);
@@ -918,7 +918,7 @@ make_x_monotone_wrapper(std::istringstream& str_stream)
 
   unsigned int id;
   str_stream >> id;
-  std::cout << "Test: make_x_monotone( " << CGAL::oformat(this->m_curves[id]) << " ) ? ";
+  std::cout << "Test: make_x_monotone( " << CGAL::IO::oformat(this->m_curves[id]) << " ) ? ";
   std::vector<Make_x_monotone_result> objs;
   this->m_geom_traits.make_x_monotone_2_object()(this->m_curves[id],
                                                  std::back_inserter(objs));
@@ -979,8 +979,8 @@ intersect_wrapper(std::istringstream& str_stream)
                                            this->m_xcurves[id2],
                                            std::back_inserter(xections));
 
-  std::cout << "Test: intersect( " << CGAL::oformat(this->m_xcurves[id1]) << ","
-            << CGAL::oformat(this->m_xcurves[id2]) << " ) ? ";
+  std::cout << "Test: intersect( " << CGAL::IO::oformat(this->m_xcurves[id1]) << ","
+            << CGAL::IO::oformat(this->m_xcurves[id2]) << " ) ? ";
   size_t num;
   str_stream >> num;
   if (! this->compare(num, xections.size(), "size")) return false;
@@ -1031,7 +1031,7 @@ bool Traits_test<Geom_traits_T>::split_wrapper(std::istringstream& str_stream)
   unsigned int id1, id2, id3, id4;
   str_stream >> id1 >> id2 >> id3 >> id4;
   X_monotone_curve_2 cv1, cv2;
-  std::cout << "Test: split( " << CGAL::oformat(this->m_xcurves[id1]) << ","
+  std::cout << "Test: split( " << CGAL::IO::oformat(this->m_xcurves[id1]) << ","
             << this->m_points[id2] << " ) ? ";
 
   this->m_geom_traits.split_2_object()(this->m_xcurves[id1],
@@ -1069,8 +1069,8 @@ are_mergeable_wrapper_imp(std::istringstream& str_stream, CGAL::Tag_true)
   unsigned int id1, id2;
   str_stream >> id1 >> id2;
   bool exp_answer = this->get_expected_boolean(str_stream);
-  std::cout << "Test: are_mergeable( " << CGAL::oformat(this->m_xcurves[id1]) << ", "
-            << CGAL::oformat(this->m_xcurves[id2]) << " ) ? " << exp_answer << " ";
+  std::cout << "Test: are_mergeable( " << CGAL::IO::oformat(this->m_xcurves[id1]) << ", "
+            << CGAL::IO::oformat(this->m_xcurves[id2]) << " ) ? " << exp_answer << " ";
 
   bool real_answer =
     this->m_geom_traits.are_mergeable_2_object()(this->m_xcurves[id1],
@@ -1107,8 +1107,8 @@ Traits_test<Geom_traits_T>::merge_wrapper_imp(std::istringstream& str_stream,
   unsigned int id1, id2, id;
   str_stream >> id1 >> id2 >> id;
   X_monotone_curve_2 cv;
-  std::cout << "Test: merge( " << CGAL::oformat(this->m_xcurves[id1]) << ", "
-            << CGAL::oformat(this->m_xcurves[id2]) << " ) ? " << CGAL::oformat(this->m_xcurves[id]) << " ";
+  std::cout << "Test: merge( " << CGAL::IO::oformat(this->m_xcurves[id1]) << ", "
+            << CGAL::IO::oformat(this->m_xcurves[id2]) << " ) ? " << CGAL::IO::oformat(this->m_xcurves[id]) << " ";
 
   this->m_geom_traits.merge_2_object()(this->m_xcurves[id1],
                                        this->m_xcurves[id2], cv);
@@ -1181,7 +1181,7 @@ parameter_space_in_x_wrapper_imp(std::istringstream& str_stream,
   CGAL::Arr_curve_end cv_end = CGAL::ARR_MIN_END;
   if (curves_op) {
     cv_end = static_cast<CGAL::Arr_curve_end>(next_input.second);
-    std::cout << "Test: parameter_space_x( " << CGAL::oformat(this->m_xcurves[id]) << " , "
+    std::cout << "Test: parameter_space_x( " << CGAL::IO::oformat(this->m_xcurves[id]) << " , "
               << (cv_end == CGAL::ARR_MIN_END ? "MIN_END" : "MAX_END")
               << " ) ? ";
     next_input = this->get_next_input(str_stream);
@@ -1248,8 +1248,8 @@ compare_y_near_boundary_wrapper_imp(std::istringstream& str_stream,
   assert(next_input.first == Base::CURVE_END);
   CGAL::Arr_curve_end cv_end =
     static_cast<CGAL::Arr_curve_end>(next_input.second);
-  std::cout << "Test: compare_y_near_boundary( " << CGAL::oformat(this->m_xcurves[id1])
-            << " , " << CGAL::oformat(this->m_xcurves[id2]) << " , "
+  std::cout << "Test: compare_y_near_boundary( " << CGAL::IO::oformat(this->m_xcurves[id1])
+            << " , " << CGAL::IO::oformat(this->m_xcurves[id2]) << " , "
             << (cv_end == CGAL::ARR_MIN_END ? "MIN_END" : "MAX_END")
             << " ) ? ";
   next_input = this->get_next_input(str_stream);
@@ -1309,7 +1309,7 @@ parameter_space_in_y_wrapper_imp(std::istringstream& str_stream,
   CGAL::Arr_curve_end cv_end = CGAL::ARR_MIN_END;
   if (curves_op) {
     cv_end = static_cast<CGAL::Arr_curve_end>(next_input.second);
-    std::cout << "Test: parameter_space_y( " << CGAL::oformat(this->m_xcurves[id]) << " , "
+    std::cout << "Test: parameter_space_y( " << CGAL::IO::oformat(this->m_xcurves[id]) << " , "
               << (cv_end == CGAL::ARR_MIN_END ? "MIN_END" : "MAX_END")
               << " ) ? ";
     next_input = this->get_next_input(str_stream);
@@ -1381,8 +1381,8 @@ compare_x_near_boundary_wrapper_imp(std::istringstream& str_stream,
   CGAL::Arr_curve_end cv_end =
     static_cast<CGAL::Arr_curve_end>(next_input.second);
 
-  std::cout << CGAL::oformat(this->m_xcurves[id1]) << ", "
-            << CGAL::oformat(this->m_xcurves[id2]) << " , "
+  std::cout << CGAL::IO::oformat(this->m_xcurves[id1]) << ", "
+            << CGAL::IO::oformat(this->m_xcurves[id2]) << " , "
             << this->curve_end_str(cv_end) << " ) ? ";
 
   next_input = this->get_next_input(str_stream);
diff --git a/Mesh_3/test/Mesh_3/test_meshing_utilities.h b/Mesh_3/test/Mesh_3/test_meshing_utilities.h
index a0ceda5d3b9b..2e7571eb41d3 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_utilities.h
+++ b/Mesh_3/test/Mesh_3/test_meshing_utilities.h
@@ -333,13 +333,13 @@ struct Tester
           else {
             std::cerr << "\nc1 circumcenter: " << tr.dual(c1);
             std::cerr << "\nc1 is in domain: "
-                      << CGAL::oformat(domain.is_in_domain_object()(tr.dual(c1)));
+                      << CGAL::IO::oformat(domain.is_in_domain_object()(tr.dual(c1)));
           }
           if(tr.is_infinite(c2)) std::cerr << "\nc2 is infinite";
           else {
             std::cerr << "\nc2 circumcenter: "<< tr.dual(c2);
             std::cerr << "\nc2 is in domain: "
-                      <<  CGAL::oformat(domain.is_in_domain_object()(tr.dual(c2)));
+                      <<  CGAL::IO::oformat(domain.is_in_domain_object()(tr.dual(c2)));
           }
           std::cerr << std::endl;
           assert(false);

From 6b24eed462b9632496d3889f2aa38460f6d72b38 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 9 Aug 2023 08:46:34 +0200
Subject: [PATCH 0591/1398] try resolving ambiguity

---
 .../include/CGAL/Arr_point_location/Td_active_edge.h |  4 ++--
 .../CGAL/Arr_point_location/Td_active_trapezoid.h    | 12 ++++++------
 2 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
index c1a177e5ab62..f08890e46239 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_edge.h
@@ -147,7 +147,7 @@ class Td_active_edge : public Handle
   /*! Initialize the trapezoid's neighbors. */
   inline void init_neighbors(std::optional<std::reference_wrapper<Td_map_item>> next)
   {
-    set_next((next) ? *next : Td_map_item(0));
+    set_next((next) ? next->get() : Td_map_item(0));
   }
   /*! \copydoc init_neighbors
    *  \deprecated please use #init_neighbors */
@@ -202,7 +202,7 @@ class Td_active_edge : public Handle
                   std::optional<std::reference_wrapper<Td_map_item>> next = std::nullopt)
   {
 
-    PTR = new Data(he, (next) ? *next : Td_map_item(0), node);
+    PTR = new Data(he, (next) ? next->get() : Td_map_item(0), node);
     //m_dag_node = node;
   }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
index f226db992d9c..6b9486e4e605 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Td_active_trapezoid.h
@@ -166,10 +166,10 @@ class Td_active_trapezoid : public Handle
    inline void init_neighbors(std::optional<std::reference_wrapper<Td_map_item>> lb, std::optional<std::reference_wrapper<Td_map_item>> lt,
                               std::optional<std::reference_wrapper<Td_map_item>> rb, std::optional<std::reference_wrapper<Td_map_item>> rt)
   {
-    set_lb((lb) ? *lb : Td_map_item(0));
-    set_lt((lt) ? *lt : Td_map_item(0));
-    set_rb((rb) ? *rb : Td_map_item(0));
-    set_rt((rt) ? *rt : Td_map_item(0));
+    set_lb((lb) ? lb->get() : Td_map_item(0));
+    set_lt((lt) ? lt->get() : Td_map_item(0));
+    set_rb((rb) ? rb->get() : Td_map_item(0));
+    set_rt((rt) ? rt->get() : Td_map_item(0));
   }
   /*! \copydoc init_neighbors
    *  \deprecated please use #init_neighbors */
@@ -273,8 +273,8 @@ class Td_active_trapezoid : public Handle
                   std::optional<std::reference_wrapper<Td_map_item>> rt = std::nullopt,
                   Dag_node* node = 0)
   {
-    PTR = new Data (l, r, b, t, (lb) ? *lb : Td_map_item(0), (lt) ? *lt : Td_map_item(0),
-                   (rb) ? *rb : Td_map_item(0), (rt) ? *rt : Td_map_item(0), node);
+    PTR = new Data (l, r, b, t, (lb) ? lb->get() : Td_map_item(0), (lt) ? lt->get() : Td_map_item(0),
+                   (rb) ? rb->get() : Td_map_item(0), (rt) ? rt->get() : Td_map_item(0), node);
     //m_dag_node = node;
   }
 

From 10c1796c2a0c88ca400fa596dc9254e3e8a9f42b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 9 Aug 2023 08:49:42 +0200
Subject: [PATCH 0592/1398] fix unused variable warnings

---
 .../test/Barycentric_coordinates_2/test_dh_deprecated_api.cpp | 4 ++--
 .../test/Barycentric_coordinates_2/test_mv_deprecated_api.cpp | 4 ++--
 .../test/Barycentric_coordinates_2/test_wp_deprecated_api.cpp | 4 ++--
 3 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_dh_deprecated_api.cpp b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_dh_deprecated_api.cpp
index b34ca8c29098..5a0da9d01650 100644
--- a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_dh_deprecated_api.cpp
+++ b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_dh_deprecated_api.cpp
@@ -50,8 +50,8 @@ int main()
     for (Scalar y = step; y < limit; y += step) {
       const Point point(x, y);
 
-      const Output_type tri_result = triangle_coordinates(point, tri_coordinates);
-      const Output_type  dh_result = discrete_harmonic_coordinates(point, old_coordinates);
+      /* const Output_type tri_result =  */triangle_coordinates(point, tri_coordinates);
+      /* const Output_type  dh_result =  */discrete_harmonic_coordinates(point, old_coordinates);
       CGAL::Barycentric_coordinates::discrete_harmonic_coordinates_2(
         vertices, point, std::back_inserter(new_coordinates));
 
diff --git a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_mv_deprecated_api.cpp b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_mv_deprecated_api.cpp
index c4bac5497a4e..50cbb51b97bb 100644
--- a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_mv_deprecated_api.cpp
+++ b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_mv_deprecated_api.cpp
@@ -53,8 +53,8 @@ int main()
     for (Scalar y = step; y < limit; y += step) {
       const Point point(x, y);
 
-      const Output_type tri_result = triangle_coordinates(point, tri_coordinates);
-      const Output_type  mv_result = mean_value_coordinates(point, old_coordinates);
+      /* const Output_type tri_result =  */triangle_coordinates(point, tri_coordinates);
+      /* const Output_type  mv_result =  */mean_value_coordinates(point, old_coordinates);
       CGAL::Barycentric_coordinates::mean_value_coordinates_2(
         vertices, point, std::back_inserter(new_coordinates));
 
diff --git a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_wp_deprecated_api.cpp b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_wp_deprecated_api.cpp
index ae349dffb76c..eb4c47ec2b57 100644
--- a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_wp_deprecated_api.cpp
+++ b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_wp_deprecated_api.cpp
@@ -51,8 +51,8 @@ int main()
     for (Scalar y = step; y < limit; y += step) {
       const Point point(x, y);
 
-      const Output_type tri_result = triangle_coordinates(point, tri_coordinates);
-      const Output_type  wp_result = wachspress_coordinates(point, old_coordinates);
+      /* const Output_type tri_result =  */triangle_coordinates(point, tri_coordinates);
+      /* const Output_type  wp_result =  */wachspress_coordinates(point, old_coordinates);
       CGAL::Barycentric_coordinates::wachspress_coordinates_2(
         vertices, point, std::back_inserter(new_coordinates));
 

From b7cebad9d31c94c7a9e58c2fdc5f0a402724f8c3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 9 Aug 2023 08:56:50 +0200
Subject: [PATCH 0593/1398] do not use deprecated API

---
 CGAL_ipelets/demo/CGAL_ipelets/hyperbolic.cpp | 12 +++++-------
 1 file changed, 5 insertions(+), 7 deletions(-)

diff --git a/CGAL_ipelets/demo/CGAL_ipelets/hyperbolic.cpp b/CGAL_ipelets/demo/CGAL_ipelets/hyperbolic.cpp
index e0725a743e9f..795375437fac 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/hyperbolic.cpp
+++ b/CGAL_ipelets/demo/CGAL_ipelets/hyperbolic.cpp
@@ -209,16 +209,14 @@ void hyperbolicIpelet::protected_run(int fn)
     }
 
   // clip circ by poincare
-  std::vector< CGAL::Object > result;
   Kernel::Circular_arc_point_2 L,R;
-  std::pair<Kernel::Circular_arc_point_2, unsigned > the_pair;
+  typedef std::pair<Kernel::Circular_arc_point_2, unsigned > The_pair;
+  std::vector<The_pair> result;
 
-  CGAL::intersection(circ, poincare, std::back_inserter(result));
+  CGAL::intersection(circ, poincare, CGAL::dispatch_or_drop_output<The_pair>(std::back_inserter(result)));
   assert (result.size()==2);
-  assign(the_pair, result[0]);
-  L = the_pair.first;
-  assign(the_pair, result[1]);
-  R = the_pair.first;
+  L = result[0].first;
+  R = result[1].first;
   Point_2 LL(CGAL::to_double(L.x()),CGAL::to_double(L.y()));
   Point_2 RR(CGAL::to_double(R.x()),CGAL::to_double(R.y()));
   assert( LL.x() <= RR.x());

From 99066b43638c1b92cd13d56149878abfa7f65cc7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 9 Aug 2023 08:59:26 +0200
Subject: [PATCH 0594/1398] hide unused type

---
 Kernel_23/examples/Kernel_23/MyKernel.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Kernel_23/examples/Kernel_23/MyKernel.cpp b/Kernel_23/examples/Kernel_23/MyKernel.cpp
index 13eec454b3dc..834a22629b87 100644
--- a/Kernel_23/examples/Kernel_23/MyKernel.cpp
+++ b/Kernel_23/examples/Kernel_23/MyKernel.cpp
@@ -56,7 +56,7 @@ int main()
 
   K::Intersect_2 intersection;
 
-  const auto intersect = intersection(s1, s2);
+  /* const auto intersect =  */intersection(s1, s2);
 
   K::Construct_cartesian_const_iterator_2 construct_it;
   K::Cartesian_const_iterator_2  cit = construct_it(a);

From 71347f28a8bba6002dfb02c7b063f1a90df372b9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 9 Aug 2023 09:00:38 +0200
Subject: [PATCH 0595/1398] remove unused variable

---
 .../test_corefinement_and_constraints.cpp                        | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
index 7642f81f4939..6508c4533375 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
@@ -165,7 +165,6 @@ void test_bool_op_no_copy(
   assert( count_constrained_edges(tm2, ecm2)==307 );
 
   typedef std::optional<Triangle_mesh*> OTM;
-  Triangle_mesh *ptr = nullptr;
   const std::array<OTM,4> output =
     reverse ? CGAL::make_array(OTM(&tm2), OTM(&tm1), std::optional<Triangle_mesh*>(), std::optional<Triangle_mesh*>())
             : CGAL::make_array(OTM(&tm1), OTM(&tm2), std::optional<Triangle_mesh*>(), std::optional<Triangle_mesh*>());

From 6b62d1d9b40d765462fa79bbee6baee04b243f00 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 9 Aug 2023 10:48:54 +0300
Subject: [PATCH 0596/1398] Introduced is_intersection_valid() to check the
 validity of a new intersection point. Perhaps, a similar fix is required for
 validity of overlapping intersections

---
 .../Arrangement_2/Arrangement_zone_2_impl.h   | 106 +++++++++---------
 .../include/CGAL/Arrangement_zone_2.h         |  21 +++-
 2 files changed, 72 insertions(+), 55 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
index feb429273eec..dfb8851479fd 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
@@ -137,7 +137,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
       if (m_found_overlap) {
         // In this case m_cv overlaps the curve associated with m_intersect_he.
         // Compute the overlapping subcurve.
-        bool dummy;
+        Arr_parameter_space dummy;
         auto obj = _compute_next_intersection(m_intersect_he, false, dummy);
         m_overlap_cv = boost::get<X_monotone_curve_2>(*obj);
 
@@ -153,7 +153,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
       // overlaps the curve associated with this edge.
       m_intersect_he = m_arr.non_const_handle(*hh);
 
-      bool dummy;
+      Arr_parameter_space dummy;
       auto obj = _compute_next_intersection(m_intersect_he, false, dummy);
       m_overlap_cv = boost::get<X_monotone_curve_2>(*obj);
 
@@ -211,7 +211,7 @@ void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
       if (m_found_overlap) {
         // In this case m_cv overlaps the curve associated with m_intersect_he.
         // Compute the overlapping subcurve to the right of curr_v.
-        bool dummy;
+        Arr_parameter_space dummy;
         auto obj = _compute_next_intersection(m_intersect_he, false, dummy);
         m_overlap_cv = boost::get<X_monotone_curve_2>(*obj);
 
@@ -505,6 +505,37 @@ _direct_intersecting_edge_to_left(const X_monotone_curve_2& cv_ins,
   }
 }
 
+//-----------------------------------------------------------------------------
+template <typename Arrangement, typename ZoneVisitor>
+bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
+is_intersection_valid_impl(const Point_2& ip,
+                           Arr_parameter_space& /* intersection_location */,
+                           Arr_all_sides_oblivious_tag) const
+{ return (m_geom_traits->compare_xy_2_object()(ip, m_left_pt) == LARGER); }
+
+template <typename Arrangement, typename ZoneVisitor>
+bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
+is_intersection_valid_impl(const Point_2& ip,
+                           Arr_parameter_space& intersection_location,
+                           Arr_not_all_sides_oblivious_tag) const {
+  auto equal = m_geom_traits->equal_2_object();
+  if (m_left_on_boundary) {
+    // The left-end lies on the left boundary. If the intersection point is not
+    // equal to the left-end, the intersection is valid, because it must lie to
+    // its right.
+    if (m_has_left_pt) return ! equal(ip, m_left_pt);
+    else return true;
+  }
+  if (m_has_right_pt && m_right_on_boundary && equal(ip, m_right_pt)) {
+    intersection_location = ARR_RIGHT_BOUNDARY;
+    return true;
+  }
+
+  // We have a simple intersection point;
+  // make sure it lies to the right of m_left_pt.
+  return (m_geom_traits->compare_xy_2_object()(ip, m_left_pt) == LARGER);
+}
+
 //-----------------------------------------------------------------------------
 // Get the next intersection of cv with the given halfedge.
 //
@@ -513,7 +544,7 @@ typename Arrangement_zone_2<Arrangement, ZoneVisitor>::Optional_intersection
 Arrangement_zone_2<Arrangement, ZoneVisitor>::
 _compute_next_intersection(Halfedge_handle he,
                            bool skip_first_point,
-                           bool& intersection_on_right_boundary)
+                           Arr_parameter_space& intersection_location)
 {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_compute_next_intersection(" << he->curve() << ", "
@@ -534,7 +565,7 @@ _compute_next_intersection(Halfedge_handle he,
   const X_monotone_curve_2* icv;
   bool valid_intersection;
 
-  intersection_on_right_boundary = false;
+  intersection_location = ARR_INTERIOR;
   if (iter != m_inter_map.end()) {
     // The intersections with the curve have already been computed.
     // Retrieve the intersections list from the map.
@@ -548,25 +579,9 @@ _compute_next_intersection(Halfedge_handle he,
       // Compare that current object with m_left_pt (if exists).
       ip = boost::get<Intersection_point>(&(inter_list.front()));
       if (ip != nullptr) {
-        // We have an intersection point
-        if (m_left_on_boundary) {
-          // The left-end lies on the left boundary. If the intersection point
-          // is not equal to the left-end, the intersection is valid, because
-          // it must lie to its right.
-          if (m_has_left_pt) valid_intersection = ! equal(ip->first, m_left_pt);
-          else valid_intersection = true;
-        }
-        else if (m_has_right_pt && m_right_on_boundary &&
-                 equal(ip->first, m_right_pt))
-        {
-          valid_intersection = true;
-          intersection_on_right_boundary = true;
-        }
-        else {
-          // We have a simple intersection point - make sure it lies to the
-          // right of m_left_pt.
-          valid_intersection = (compare_xy(ip->first, m_left_pt) == LARGER);
-        }
+        // We have an intersection point -
+        valid_intersection =
+          is_intersection_valid(ip->first, intersection_location);
       }
       else {
         // We have an overlapping subcurve.
@@ -609,27 +624,11 @@ _compute_next_intersection(Halfedge_handle he,
   while (! inter_list.empty()) {
     // Compare that current object with m_left_pt (if exists).
     ip = boost::get<Intersection_point>(&(inter_list.front()));
-
     if (ip != nullptr) {
       // We have an intersection point -
       // Check whether we need to skip the first intersection
-      if (is_first && skip_first_point) valid_intersection = false;
-      else if (m_left_on_boundary) {
-        // The left-end lies on the left boundary. If the intersection point
-        // is not equal to the left-end, the intersection is valid, because
-        // it must lie to its right.
-        if (m_has_left_pt) valid_intersection = ! equal(ip->first, m_left_pt);
-        else valid_intersection = true;
-      }
-      else if (m_right_on_boundary && m_has_right_pt &&
-               equal(ip->first, m_right_pt))
-      {
-        valid_intersection = true;
-        intersection_on_right_boundary = true;
-      }
-      else {
-        valid_intersection = (compare_xy(ip->first, m_left_pt) == LARGER);
-      }
+      valid_intersection = (is_first && skip_first_point) ? false :
+        is_intersection_valid(ip->first, intersection_location);
     }
     else if (m_left_on_boundary) {
       // The left end is on the boundary, so all overlapping curves are valid,
@@ -768,7 +767,7 @@ _is_to_right_impl(const Point_2& p, Halfedge_handle he,
 template <typename Arrangement, typename ZoneVisitor>
 void Arrangement_zone_2<Arrangement, ZoneVisitor>::
 _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
-                       bool& leftmost_on_right_boundary)
+                       Arr_parameter_space& leftmost_location)
 {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_leftmost_intersection(" << he_curr->curve() << ", "
@@ -793,7 +792,7 @@ _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
   // entirely to the right of m_intersect_p, its intersection with m_cv (if any)
   // cannot lie to the left of this point. We therefore do not need to compute
   // this intersection.
-  if (m_found_intersect && ! leftmost_on_right_boundary &&
+  if (m_found_intersect && (leftmost_location != ARR_RIGHT_BOUNDARY) &&
       _is_to_left(m_intersect_p, he_curr))
     return;
 
@@ -821,13 +820,14 @@ _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
   // do not intersect.
   if (! left_equals_curr_endpoint &&
       ((! m_left_on_boundary && _is_to_right(m_left_pt, he_curr)) ||
-       ! is_in_x_range(m_cv, he_curr->curve())))
+       ! is_in_x_range(m_cv, he_curr->curve()))) {
     return;
+  }
 
   // Compute the next intersection of m_cv and the current halfedge.
-  bool intersection_on_right_boundary;
+  Arr_parameter_space intersection_location;
   auto iobj = _compute_next_intersection(he_curr, left_equals_curr_endpoint,
-                                         intersection_on_right_boundary);
+                                         intersection_location);
 
   if (iobj) {
     // We have found an intersection (either a simple point or an
@@ -839,8 +839,8 @@ _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
       // Found a simple intersection point. Check if it is the leftmost
       // intersection point so far.
       if (! m_found_intersect ||
-          (! intersection_on_right_boundary &&
-           (leftmost_on_right_boundary ||
+          ((intersection_location != ARR_RIGHT_BOUNDARY) &&
+           ((leftmost_location == ARR_RIGHT_BOUNDARY) ||
             compare_xy(ip, m_intersect_p) == SMALLER)))
       {
         // Store the leftmost intersection point and the halfedge handle.
@@ -848,7 +848,7 @@ _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
         m_ip_multiplicity = int_p->second;
         m_intersect_he = he_curr;
         m_found_overlap = false;
-        leftmost_on_right_boundary = intersection_on_right_boundary;
+        leftmost_location = intersection_location;
       }
     }
     else {
@@ -895,7 +895,7 @@ _leftmost_intersection_with_face_boundary(Face_handle face, bool on_boundary)
   auto compare_xy = m_geom_traits->compare_xy_2_object();
   auto is_in_x_range = m_geom_traits->is_in_x_range_2_object();
 
-  bool leftmost_on_right_boundary = false;
+  Arr_parameter_space leftmost_location = ARR_INTERIOR;
 
   // Traverse the face outer-boundaries; iterate through all outer CCBs.
   for (auto occb_it = face->outer_ccbs_begin();
@@ -903,7 +903,7 @@ _leftmost_intersection_with_face_boundary(Face_handle face, bool on_boundary)
   {
     Ccb_halfedge_circulator he_first = *occb_it;
     Ccb_halfedge_circulator he_curr = he_first;
-    do _leftmost_intersection(he_curr, on_boundary, leftmost_on_right_boundary);
+    do _leftmost_intersection(he_curr, on_boundary, leftmost_location);
     while (++he_curr != he_first);
   }
 
@@ -913,7 +913,7 @@ _leftmost_intersection_with_face_boundary(Face_handle face, bool on_boundary)
   {
     Ccb_halfedge_circulator he_first = *iccb_it;
     Ccb_halfedge_circulator he_curr = he_first;
-    do _leftmost_intersection(he_curr, on_boundary, leftmost_on_right_boundary);
+    do _leftmost_intersection(he_curr, on_boundary, leftmost_location);
     while (++he_curr != he_first);
   }
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
index 81f1c8bad04f..71b5e4a74092 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
@@ -336,7 +336,7 @@ class Arrangement_zone_2 {
   Optional_intersection
   _compute_next_intersection(Halfedge_handle he,
                              bool skip_first_point,
-                             bool& intersect_on_right_boundary);
+                             Arr_parameter_space& intersection_location);
 
   /*! Remove the next intersection of m_cv with the given halfedge from the map.
    * \param he A handle to the halfedge.
@@ -394,12 +394,29 @@ class Arrangement_zone_2 {
   bool _is_to_right_impl(const Point_2& p, Halfedge_handle he,
                          Arr_not_all_sides_oblivious_tag) const;
 
+  /*! Check whether an intersection point is valid. A valid intersection point
+   * must be to the left of the left end of the curve involved.
+   */
+  bool is_intersection_valid(const Point_2& ip,
+                             Arr_parameter_space& intersection_location) const {
+    return is_intersection_valid_impl(ip, intersection_location,
+                                      Are_all_sides_oblivious_category());
+  }
+
+  bool is_intersection_valid_impl(const Point_2& ip,
+                                  Arr_parameter_space& intersection_location,
+                                  Arr_all_sides_oblivious_tag) const;
+
+  bool is_intersection_valid_impl(const Point_2& ip,
+                                  Arr_parameter_space& intersection_location,
+                                  Arr_not_all_sides_oblivious_tag) const;
+
   /*! Compute the (lexicographically) leftmost intersection of the query
    * curve with a given halfedge on the boundary of a face in the arrangement.
    */
   void
   _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
-                         bool& leftmost_on_right_boundary);
+                         Arr_parameter_space& leftmost_location);
 
   /*! Compute the (lexicographically) leftmost intersection of the query
    * curve with the boundary of a given face in the arrangement.

From a9625eb17cfd5da8f96686ac6cb122645f4caa0f Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 9 Aug 2023 14:03:14 +0300
Subject: [PATCH 0597/1398] Enhanced drawing---added support for arrangement on
 spheres indiced by geodesic arcs

---
 .../include/CGAL/draw_arrangement_2.h         | 240 ++++++++++++++----
 1 file changed, 193 insertions(+), 47 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h b/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h
index c7637f04b919..76e2eaf32832 100644
--- a/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h
@@ -29,7 +29,9 @@
 
 #include <type_traits>
 #include <CGAL/Qt/init_ogl_context.h>
+#include <CGAL/Arrangement_on_surface_2.h>
 #include <CGAL/Arrangement_2.h>
+#include <CGAL/Arr_geodesic_arc_on_sphere_traits_2.h>
 
 namespace CGAL {
 
@@ -46,32 +48,32 @@ struct Default_color_generator {
 };
 
 // Viewer class for`< Polygon_2
-template <typename Arrangement_2_,
+template <typename ArrangementOnSurface_2,
           typename ColorGenerator = Default_color_generator>
-class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
-  using Arr = Arrangement_2_;
+class Aos_2_basic_viewer_qt : public Basic_viewer_qt {
+  using Aos = ArrangementOnSurface_2;
   using Color_generator = ColorGenerator;
   using Base = Basic_viewer_qt;
-  using Gt = typename Arr::Geometry_traits_2;
-  using Point = typename Arr::Point_2;
-  using X_monotone_curve = typename Arr::X_monotone_curve_2;
-  using Vertex_const_handle = typename Arr::Vertex_const_handle;
-  using Halfedge_const_handle = typename Arr::Halfedge_const_handle;
-  using Face_const_handle = typename Arr::Face_const_handle;
+  using Gt = typename Aos::Geometry_traits_2;
+  using Point = typename Aos::Point_2;
+  using X_monotone_curve = typename Aos::X_monotone_curve_2;
+  using Vertex_const_handle = typename Aos::Vertex_const_handle;
+  using Halfedge_const_handle = typename Aos::Halfedge_const_handle;
+  using Face_const_handle = typename Aos::Face_const_handle;
   using Ccb_halfedge_const_circulator =
-    typename Arr::Ccb_halfedge_const_circulator;
+    typename Aos::Ccb_halfedge_const_circulator;
 
 public:
   /// Construct the viewer.
   /// @param arr the arrangement to view
   /// @param title the title of the window
-  Arr_2_basic_viewer_qt(QWidget* parent, const Arr& arr,
+  Aos_2_basic_viewer_qt(QWidget* parent, const Aos& aos,
                         Color_generator color_generator,
                         const char* title = "2D Arrangement Basic Viewer",
                         bool draw_vertices = false) :
     // First draw: vertices; edges, faces; multi-color; no inverse normal
     Base(parent, title, draw_vertices, true, true, false, false),
-    m_arr(arr),
+    m_aos(aos),
     m_color_generator(color_generator)
   {
     // mimic the computation of Camera::pixelGLRatio()
@@ -154,32 +156,47 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
    */
   CGAL::Bbox_2 bounding_box() {
     CGAL::Bbox_2 bbox;
-    const auto* traits = this->m_arr.geometry_traits();
+    const auto* traits = this->m_aos.geometry_traits();
     // At this point we assume that the arrangement is not open, and thus the
     // bounding box is defined by the vertices.
-    for (auto it = m_arr.vertices_begin(); it != m_arr.vertices_end(); ++it)
+    for (auto it = m_aos.vertices_begin(); it != m_aos.vertices_end(); ++it)
       bounding_box_impl1(bbox, it->point(), *traits, 0);
     return bbox;
   }
 
+  /*! Add all faces.
+   */
+  template <typename Traits>
+  void add_faces(const Traits&) {
+    for (auto it = m_aos.unbounded_faces_begin();
+         it != m_aos.unbounded_faces_end(); ++it)
+      add_face(it);
+  }
+
+  /*! Add all faces.
+   */
+  template <typename Kernel_, int AtanX, int AtanY>
+  void
+  add_faces(Arr_geodesic_arc_on_sphere_traits_2<Kernel_, AtanX, AtanY> const&)
+  { add_face(m_aos.faces_begin()); }
+
   /*! Add all elements to be drawn.
    */
   void add_elements() {
+    // std::cout << "add_elements()\n";
     // std::cout << "ratio: " << this->pixel_ratio() << std::endl;
     clear();
     m_visited.clear();
 
-    if (m_arr.is_empty()) return;
-    for (auto it = m_arr.unbounded_faces_begin();
-         it != m_arr.unbounded_faces_end(); ++it)
-      add_face(it);
+    if (m_aos.is_empty()) return;
+    add_faces(*(this->m_aos.geometry_traits()));
 
-    // Add edges that do not separe faces.
-    for (auto it = m_arr.edges_begin(); it != m_arr.edges_end(); ++it)
+    // Add edges that do not separate faces.
+    for (auto it = m_aos.edges_begin(); it != m_aos.edges_end(); ++it)
       if (it->face() == it->twin()->face()) draw_curve(it->curve());
 
     // Add all points
-    for (auto it = m_arr.vertices_begin(); it != m_arr.vertices_end(); ++it)
+    for (auto it = m_aos.vertices_begin(); it != m_aos.vertices_end(); ++it)
       draw_point(it->point());
 
     m_visited.clear();
@@ -190,11 +207,20 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
   double pixel_ratio() const { return m_pixel_ratio; }
 
 protected:
+  template <typename Kernel, int AtanX, int AtanY>
+  Halfedge_const_handle
+  find_smallest(Ccb_halfedge_const_circulator circ,
+                Arr_geodesic_arc_on_sphere_traits_2<Kernel, AtanX, AtanY> const&)
+  { return circ; }
+
   /*! Find the halfedge incident to the lexicographically smallest vertex
    * along the CCB, such that there is no other halfedge underneath.
    */
-  Halfedge_const_handle find_smallest(Ccb_halfedge_const_circulator circ) {
-    const auto* traits = this->m_arr.geometry_traits();
+  template <typename Traits>
+  Halfedge_const_handle find_smallest(Ccb_halfedge_const_circulator circ,
+                                      const Traits&) {
+    // std::cout << "find_smallest()\n";
+    const auto* traits = this->m_aos.geometry_traits();
     auto cmp_xy = traits->compare_xy_2_object();
     auto cmp_y = traits->compare_y_at_x_right_2_object();
 
@@ -241,6 +267,7 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
   template <typename Approximate>
   void draw_approximate_region(Halfedge_const_handle curr,
                                const Approximate& approx) {
+    // std::cout << "draw_approximate_region()\n";
     std::vector<typename Gt::Approximate_point_2> polyline;
     double error(this->pixel_ratio());
     bool l2r = curr->direction() == ARR_LEFT_TO_RIGHT;
@@ -258,7 +285,7 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
    */
   template <typename XMonotoneCurve>
   void draw_exact_curve(const XMonotoneCurve& curve) {
-    const auto* traits = this->m_arr.geometry_traits();
+    const auto* traits = this->m_aos.geometry_traits();
     auto ctr_min = traits->construct_min_vertex_2_object();
     auto ctr_max = traits->construct_max_vertex_2_object();
     this->add_segment(ctr_min(curve), ctr_max(curve));
@@ -267,7 +294,7 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
   /*! Draw an exact region.
    */
   void draw_exact_region(Halfedge_const_handle curr) {
-    this->add_point_in_face(curr->source()->point());
+    // this->add_point_in_face(curr->source()->point());
     draw_exact_curve(curr->curve());
   }
 
@@ -300,9 +327,46 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
   { draw_approximate_region(curr, traits.approximate_2_object()); }
 #endif
 
+  template <typename Kernel_, int AtanX, int AtanY>
+  void draw_region_impl1
+  (Halfedge_const_handle curr,
+   Arr_geodesic_arc_on_sphere_traits_2<Kernel_, AtanX, AtanY> const& traits,
+   int) {
+    // std::cout << "draw_region_impl1()\n";
+    auto approx = traits.approximate_2_object();
+    using Kernel = Kernel_;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, AtanX, AtanY>;
+    using Ak = typename Traits::Approximate_kernel;
+    using Ap = typename Traits::Approximate_point_2;
+    using Approx_point_3 = typename Ak::Point_3;
+
+    std::vector<Ap> polyline;
+    double error(0.01);
+    bool l2r = curr->direction() == ARR_LEFT_TO_RIGHT;
+    approx(curr->curve(), error, std::back_inserter(polyline), l2r);
+    if (polyline.empty()) return;
+    auto it = polyline.begin();
+    auto x = it->dx();
+    auto y = it->dy();
+    auto z = it->dz();
+    auto l = std::sqrt(x*x + y*y + z*z);
+    Approx_point_3 prev(x/l, y/l, z/l);
+    for (++it; it != polyline.end(); ++it) {
+      auto x = it->dx();
+      auto y = it->dy();
+      auto z = it->dz();
+      auto l = std::sqrt(x*x + y*y + z*z);
+      Approx_point_3 next(x/l, y/l, z/l);
+      this->add_segment(prev, next);
+      prev = next;
+      // this->add_point_in_face(*prev);
+    }
+  }
+
   /*! Draw a region.
    */
   void draw_region(Ccb_halfedge_const_circulator circ) {
+    // std::cout << "draw_region()\n";
     /* Check whether the traits has a member function called
      * approximate_2_object() and if so check whether the return type, namely
      * `Approximate_2` has an appropriate operator.
@@ -321,8 +385,8 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
     auto color = m_color_generator(circ->face());
     this->face_begin(color);
 
-    const auto* traits = this->m_arr.geometry_traits();
-    auto ext = find_smallest(circ);
+    const auto* traits = this->m_aos.geometry_traits();
+    auto ext = find_smallest(circ, *traits);
     auto curr = ext;
 
     do {
@@ -382,6 +446,37 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
   { draw_approximate_curve(xcv, traits.approximate_2_object()); }
 #endif
 
+  template <typename Kernel_, int AtanX, int AtanY>
+  void draw_curve_impl1
+  (const X_monotone_curve& xcv,
+   Arr_geodesic_arc_on_sphere_traits_2<Kernel_, AtanX, AtanY> const& traits,
+   int) {
+    auto approx = traits.approximate_2_object();
+    using Kernel = Kernel_;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, AtanX, AtanY>;
+    using Ak = typename Traits::Approximate_kernel;
+    using Ap = typename Traits::Approximate_point_2;
+    using Approx_point_3 = typename Ak::Point_3;
+    std::vector<Ap> apoints;
+    double error(0.01);
+    approx(xcv, error, std::back_inserter(apoints));
+    auto it = apoints.begin();
+    auto x = it->dx();
+    auto y = it->dy();
+    auto z = it->dz();
+    auto l = std::sqrt(x*x + y*y + z*z);
+    Approx_point_3 prev(x/l, y/l, z/l);
+    for (++it; it != apoints.end(); ++it) {
+      auto x = it->dx();
+      auto y = it->dy();
+      auto z = it->dz();
+      auto l = std::sqrt(x*x + y*y + z*z);
+      Approx_point_3 next(x/l, y/l, z/l);
+      this->add_segment(prev, next);
+      prev = next;
+    }
+  }
+
   /*! Draw a curve.
    */
   template <typename XMonotoneCurve>
@@ -404,14 +499,14 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
 #if 0
     if constexpr (std::experimental::is_detected_v<approximate_2_object_t, Gt>)
     {
-      const auto* traits = this->m_arr.geometry_traits();
+      const auto* traits = this->m_aos.geometry_traits();
       auto approx = traits->approximate_2_object();
       draw_approximate_curve(curve, approx);
       return;
     }
     draw_exact_curve(curve);
 #else
-    const auto* traits = this->m_arr.geometry_traits();
+    const auto* traits = this->m_aos.geometry_traits();
     draw_curve_impl1(curve, *traits, 0);
 #endif
   }
@@ -442,16 +537,35 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
   { add_point(traits.approximate_2_object()(p)); }
 #endif
 
+  template <typename Kernel_, int AtanX, int AtanY>
+  void draw_point_impl1
+  (const Point& p,
+   Arr_geodesic_arc_on_sphere_traits_2<Kernel_, AtanX, AtanY> const& traits,
+   int) {
+    auto approx = traits.approximate_2_object();
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel_, AtanX, AtanY>;
+    using Ak = typename Traits::Approximate_kernel;
+    using Approx_point_3 = typename Ak::Point_3;
+    auto ap = approx(p);
+    auto x = ap.dx();
+    auto y = ap.dy();
+    auto z = ap.dz();
+    auto l = std::sqrt(x*x + y*y + z*z);
+    Approx_point_3 p3(x/l, y/l, z/l);
+    add_point(p3);
+  }
+
   /*! Draw a point.
    */
   void draw_point(const Point& p) {
-    const auto* traits = m_arr.geometry_traits();
+    const auto* traits = m_aos.geometry_traits();
     draw_point_impl1(p, *traits, 0);
   }
 
   /*! Add a Connected Component of the Boundary.
    */
   void add_ccb(Ccb_halfedge_const_circulator circ) {
+    // std::cout << "add_ccb()\n";
     auto curr = circ;
     do {
       auto new_face = curr->twin()->face();
@@ -464,8 +578,9 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
   /*! Add a face.
    */
   void add_face(Face_const_handle face) {
-    using Inner_ccb_const_iterator = typename Arr::Inner_ccb_const_iterator;
-    using Outer_ccb_const_iterator = typename Arr::Outer_ccb_const_iterator;
+    // std::cout << "add_face()\n";
+    using Inner_ccb_const_iterator = typename Aos::Inner_ccb_const_iterator;
+    using Outer_ccb_const_iterator = typename Aos::Outer_ccb_const_iterator;
 
     for (Inner_ccb_const_iterator it = face->inner_ccbs_begin();
          it != face->inner_ccbs_end(); ++it)
@@ -505,7 +620,7 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
   double m_pixel_ratio = 1;
 
   //! The arrangement to draw.
-  const Arr& m_arr;
+  const Aos& m_aos;
 
   //! The color generator.
   Color_generator m_color_generator;
@@ -514,32 +629,63 @@ class Arr_2_basic_viewer_qt : public Basic_viewer_qt {
 };
 
 //! Basic viewer of a 2D arrangement.
-template <typename Arrangement_2_,
+template <typename ArrangementOnSurface_2,
           typename ColorGenerator = Default_color_generator>
-class Arr_2_viewer_qt : public Arr_2_basic_viewer_qt<Arrangement_2_,
+class Aos_2_viewer_qt : public Aos_2_basic_viewer_qt<ArrangementOnSurface_2,
                                                      ColorGenerator> {
 public:
-  using Arr = Arrangement_2_;
+  using Aos = ArrangementOnSurface_2;
   using Color_generator = ColorGenerator;
-  using Base = Arr_2_basic_viewer_qt<Arr, Color_generator>;
-  using Point = typename Arr::Point_2;
-  using X_monotone_curve = typename Arr::X_monotone_curve_2;
-  using Halfedge_const_handle = typename Arr::Halfedge_const_handle;
-  using Face_const_handle = typename Arr::Face_const_handle;
+  using Base = Aos_2_basic_viewer_qt<Aos, Color_generator>;
+  using Point = typename Aos::Point_2;
+  using X_monotone_curve = typename Aos::X_monotone_curve_2;
+  using Halfedge_const_handle = typename Aos::Halfedge_const_handle;
+  using Face_const_handle = typename Aos::Face_const_handle;
   using Ccb_halfedge_const_circulator =
-    typename Arr::Ccb_halfedge_const_circulator;
+    typename Aos::Ccb_halfedge_const_circulator;
 
   /// Construct the viewer.
   /// @param arr the arrangement to view
   /// @param title the title of the window
-  Arr_2_viewer_qt(QWidget* parent, const Arr& arr,
+  Aos_2_viewer_qt(QWidget* parent, const Aos& aos,
                   Color_generator color_generator,
-                  const char* title = "2D Arrangement Basic Viewer",
+                  const char* title = "2D Arrangement on Surface Basic Viewer",
                   bool draw_vertices = false) :
-    Base(parent, arr, color_generator, title, draw_vertices)
+    Base(parent, aos, color_generator, title, draw_vertices)
   {}
 };
 
+/*! Draw an arrangement on surface.
+ */
+template <typename GeometryTraits_2, typename TopologyTraits>
+void draw(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& aos,
+          const char* title = "2D Arrangement on Surface Basic Viewer",
+          bool draw_vertices = false) {
+#if defined(CGAL_TEST_SUITE)
+  bool cgal_test_suite=true;
+#else
+  bool cgal_test_suite = qEnvironmentVariableIsSet("CGAL_TEST_SUITE");
+#endif
+
+  if (cgal_test_suite) return;
+  using Gt = GeometryTraits_2;
+  using Tt = TopologyTraits;
+  using Aos = CGAL::Arrangement_on_surface_2<Gt, Tt>;
+  using Viewer = Aos_2_viewer_qt<Aos, Default_color_generator>;
+
+  CGAL::Qt::init_ogl_context(4,3);
+
+  int argc = 1;
+  const char* argv[2] = {"t2_viewer", nullptr};
+  QApplication app(argc, const_cast<char**>(argv));
+  Default_color_generator color_generator;
+  Viewer mainwindow(app.activeWindow(), aos, color_generator, title,
+                    draw_vertices);
+  mainwindow.add_elements();
+  mainwindow.show();
+  app.exec();
+}
+
 /*! Draw an arrangement.
  */
 template <typename GeometryTraits_2, typename Dcel>
@@ -555,7 +701,7 @@ void draw(const Arrangement_2<GeometryTraits_2, Dcel>& arr,
   if (cgal_test_suite) return;
   using Gt = GeometryTraits_2;
   using Arr = CGAL::Arrangement_2<Gt, Dcel>;
-  using Viewer = Arr_2_viewer_qt<Arr, Default_color_generator>;
+  using Viewer = Aos_2_viewer_qt<Arr, Default_color_generator>;
 
   CGAL::Qt::init_ogl_context(4,3);
 
@@ -589,7 +735,7 @@ void draw(const Arrangement_2<GeometryTraits_2, Dcel>& arr,
   using Color_generator = ColorGenerator;
   using Gt = GeometryTraits_2;
   using Arr = CGAL::Arrangement_2<Gt, Dcel>;
-  using Viewer = Arr_2_viewer_qt<Arr, Color_generator>;
+  using Viewer = Aos_2_viewer_qt<Arr, Color_generator>;
 
   CGAL::Qt::init_ogl_context(4,3);
 

From 46c42465706e397c031b5e15d1d70584afc6a913 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 9 Aug 2023 17:37:01 +0300
Subject: [PATCH 0598/1398] Cleaned up

---
 .../Arr_geodesic_arc_on_sphere_traits_2.h     | 719 +++++++++---------
 1 file changed, 360 insertions(+), 359 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
index 7a0a2eaa3af9..e3a934889bce 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
@@ -39,9 +39,86 @@
 
 namespace CGAL {
 
+/*! Represent an extended 3D direction that is used in turn to represent a
+ * spherical-arc endpoint. The extended data consists of two flags that
+ * indicate whether the point is on the x and on a y boundaries,
+ * respectively.
+ */
+template <typename Kernel>
+class Arr_extended_direction_3 : public Kernel::Direction_3 {
+public:
+  using FT = typename Kernel::FT;
+  using Direction_3 = typename Kernel::Direction_3;
+
+  /*! Enumeration of discontinuity type */
+  enum Location_type {
+    NO_BOUNDARY_LOC = 0,
+    MIN_BOUNDARY_LOC,
+    MID_BOUNDARY_LOC,
+    MAX_BOUNDARY_LOC
+  };
+
+private:
+  using Direction_2 = typename Kernel::Direction_2;
+
+  //! The point discontinuity type
+  Location_type m_location;
+
+  inline Sign x_sign(Direction_3 d) const { return CGAL::sign(d.dx()); }
+
+  inline Sign y_sign(Direction_3 d) const { return CGAL::sign(d.dy()); }
+
+  inline Sign z_sign(Direction_3 d) const { return CGAL::sign(d.dz()); }
+
+public:
+  /*! Default constructor */
+  Arr_extended_direction_3() :
+    Direction_3(0, 0, 1),
+    m_location(MAX_BOUNDARY_LOC)
+  {}
+
+  /*! Constructor */
+  Arr_extended_direction_3(const Direction_3& dir, Location_type location) :
+    Direction_3(dir),
+    m_location(location)
+  {}
+
+  /*! Copy constructor */
+  Arr_extended_direction_3(const Arr_extended_direction_3& other) :
+    Direction_3(static_cast<const Direction_3&>(other))
+  { m_location = other.discontinuity_type(); }
+
+  /*! Assignment operator */
+  Arr_extended_direction_3& operator=(const Arr_extended_direction_3& other) {
+    *(static_cast<Direction_3*>(this)) = static_cast<const Direction_3&>(other);
+    m_location = other.discontinuity_type();
+    return (*this);
+  }
+
+  /*! Set the location of the point.
+   */
+  void set_location(Location_type location) { m_location = location; }
+
+  /*! Obtain the location of the point.
+   */
+  Location_type location() const { return m_location; }
+
+  /*! Obtain the discontinuity type of the point.
+   * \todo deprecate this one; use the above instead.
+   */
+  Location_type discontinuity_type() const { return m_location; }
+
+  bool is_no_boundary() const { return (m_location == NO_BOUNDARY_LOC); }
+
+  bool is_min_boundary() const { return (m_location == MIN_BOUNDARY_LOC); }
+
+  bool is_mid_boundary() const { return (m_location == MID_BOUNDARY_LOC); }
+
+  bool is_max_boundary() const { return (m_location == MAX_BOUNDARY_LOC); }
+};
+
 template <typename Kernel> class Arr_x_monotone_geodesic_arc_on_sphere_3;
 template <typename Kernel> class Arr_geodesic_arc_on_sphere_3;
-template <typename Kernel> class Arr_extended_direction_3;
 
 /*! A traits class-template for constructing and maintaining arcs of great
  * circles embedded on spheres. It is parameterized from a (linear) geometry
@@ -54,44 +131,43 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   friend class Arr_extended_direction_3<Kernel_>;
 
 public:
-  typedef Kernel_                               Kernel;
+  using Kernel = Kernel_;
 
   // Category tags:
-  typedef Tag_true                              Has_left_category;
-  typedef Tag_true                              Has_merge_category;
-  typedef Tag_false                             Has_do_intersect_category;
+  using Has_left_category = Tag_true;
+  using Has_merge_category = Tag_true;
+  using Has_do_intersect_category = Tag_false;
 
-  typedef Arr_identified_side_tag               Left_side_category;
-  typedef Arr_contracted_side_tag               Bottom_side_category;
-  typedef Arr_contracted_side_tag               Top_side_category;
-  typedef Arr_identified_side_tag               Right_side_category;
+  using Left_side_category = Arr_identified_side_tag;
+  using Bottom_side_category = Arr_contracted_side_tag;
+  using Top_side_category = Arr_contracted_side_tag;
+  using Right_side_category = Arr_identified_side_tag;
 
-  typedef std::integral_constant<bool, atan_y==0>       Zero_atan_y;
+  using Zero_atan_y = std::integral_constant<bool, atan_y==0>;
 
   // Traits objects
-  typedef Arr_extended_direction_3<Kernel>                Point_2;
-  typedef Arr_x_monotone_geodesic_arc_on_sphere_3<Kernel> X_monotone_curve_2;
-  typedef Arr_geodesic_arc_on_sphere_3<Kernel>            Curve_2;
-  typedef unsigned int                                    Multiplicity;
+  using Point_2 = Arr_extended_direction_3<Kernel>;
+  using X_monotone_curve_2 = Arr_x_monotone_geodesic_arc_on_sphere_3<Kernel>;
+  using Curve_2 = Arr_geodesic_arc_on_sphere_3<Kernel>;
+  using Multiplicity = std::size_t;
 
   /*! Default constructor */
   Arr_geodesic_arc_on_sphere_traits_2() {}
 
 protected:
-  typedef typename Kernel::FT                   FT;
+  using FT = typename Kernel::FT;
 
-  typedef typename Kernel::Direction_3          Direction_3;
-  typedef typename Kernel::Vector_3             Vector_3;
-  typedef typename Kernel::Direction_2          Direction_2;
-  typedef typename Kernel::Vector_2             Vector_2;
+  using Direction_3 = typename Kernel::Direction_3;
+  using Vector_3 = typename Kernel::Vector_3;
+  using Direction_2 = typename Kernel::Direction_2;
+  using Vector_2 = typename Kernel::Vector_2;
 
   /*! Obtain the intersection of the identification arc and the xy plane.
    * By default, it is the vector directed along the negative x axis
    * (x = -infinity).
    * \return the intersection of the identification arc and the xy plane.
    */
-  inline static const Direction_2& identification_xy()
-  {
+  inline static const Direction_2& identification_xy() {
     static const Direction_2 d(atan_x, atan_y);
     return d;
   }
@@ -101,8 +177,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * (y = infinity).
    * \return the normal of the plane that contains the identification arc.
    */
-  inline static const Direction_3& identification_normal()
-  {
+  inline static const Direction_3& identification_normal() {
     static const Direction_3 d(atan_y, -atan_x, 0);
     return d;
   }
@@ -110,8 +185,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! Obtain the 2D direction directed along the negative x axis
    * \return the direction directed at x = -infinity
    */
-  inline static const Direction_2& neg_x_2()
-  {
+  inline static const Direction_2& neg_x_2() {
     CGAL_STATIC_THREAD_LOCAL_VARIABLE_2(Direction_2, d, -1, 0);
     return d;
   }
@@ -119,8 +193,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! Obtain the 2D direction directed along the negative y axis
    * \return the direction directed at y = -infinity
    */
-  inline static const Direction_2& neg_y_2()
-  {
+  inline static const Direction_2& neg_y_2() {
     CGAL_STATIC_THREAD_LOCAL_VARIABLE_2(Direction_2, d, 0, -1);
     return d;
   }
@@ -186,8 +259,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * \param dir the direction.
    */
   inline Oriented_side oriented_side(const Direction_3& normal,
-                                     const Direction_3 dir) const
-  {
+                                     const Direction_3 dir) const {
     FT dot = normal.vector() * dir.vector();
     return CGAL::sign(dot);
   }
@@ -197,9 +269,8 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * \param d2 the second direction.
    * \return the relative orientation of d1 and d2.
    */
-  inline Orientation orientation(const Direction_2& d1, const Direction_2& d2)
-    const
-  {
+  inline Orientation orientation(const Direction_2& d1,
+                                 const Direction_2& d2) const {
     const Kernel& kernel(*this);
     return kernel.orientation_2_object()(d1.vector(), d2.vector());
   }
@@ -209,8 +280,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * \param d2 the second direction.
    */
   inline Direction_3 construct_normal_3(const Direction_3& d1,
-                                        const Direction_3& d2) const
-  {
+                                        const Direction_3& d2) const {
     const Kernel& kernel(*this);
     Vector_3 v = kernel.construct_cross_product_vector_3_object()(d1.vector(),
                                                                   d2.vector());
@@ -224,8 +294,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * \return true if dir is contained in plane; false otherwise.
    * \pre the plane contains the origin.
    */
-  inline bool has_on(const Direction_3& normal, const Direction_3& dir) const
-  {
+  inline bool has_on(const Direction_3& normal, const Direction_3& dir) const {
     FT dot = normal.vector() * dir.vector();
     return CGAL::sign(dot) == ZERO;
   }
@@ -239,8 +308,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    *         LARGER  - v(d1) > v(d2).
    */
   inline Comparison_result compare_y(const Direction_3& d1,
-                                     const Direction_3& d2) const
-  {
+                                     const Direction_3& d2) const {
     Vector_3 v1 = d1.vector();
     Vector_3 v2 = d2.vector();
 
@@ -274,8 +342,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    *         LARGER  - u(d1) > u(d2).
    */
   inline Comparison_result compare_x(const Direction_2& d1,
-                                     const Direction_2& d2) const
-  {
+                                     const Direction_2& d2) const {
     const Kernel& kernel = *this;
     if (kernel.equal_2_object()(d1, d2)) return EQUAL;
     const Direction_2& d = identification_xy();
@@ -293,8 +360,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * \pre d2 does not coincide with any pole.
    */
   inline Comparison_result compare_x(const Direction_3& d1,
-                                     const Direction_3& d2) const
-  {
+                                     const Direction_3& d2) const {
     // Compare the projections onto the xy plane:
     Direction_2 d1_2 = project_xy(d1);
     Direction_2 d2_2 = project_xy(d2);
@@ -313,8 +379,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * \pre d2 does not lie on the discontinuity arc.
    */
   inline Comparison_result compare_xy(const Direction_3& d1,
-                                      const Direction_3& d2) const
-  {
+                                      const Direction_3& d2) const {
     Comparison_result res = compare_x(d1, d2);
     if (res == EQUAL) return compare_y(d1, d2);
     return res;
@@ -327,9 +392,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * false otherwise.
    * \pre point does not coincide with one of the poles
    */
-  bool is_in_x_range(const X_monotone_curve_2& xcv, const Point_2& point) const
-  {
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+  bool is_in_x_range(const X_monotone_curve_2& xcv,
+                     const Point_2& point) const {
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
     CGAL_precondition(!point.is_min_boundary());
     CGAL_precondition(!point.is_max_boundary());
@@ -358,8 +423,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   void intersection_with_identification(const X_monotone_curve_2& xcv,
                                         Direction_3& dp,
-                                        std::true_type) const
-  {
+                                        std::true_type) const {
     const Direction_3& normal = xcv.normal();
     dp = (CGAL::sign(normal.dz()) == POSITIVE) ?
       Direction_3(-(normal.dz()), 0, normal.dx()) :
@@ -371,8 +435,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   void intersection_with_identification(const X_monotone_curve_2& xcv,
                                         Direction_3& dp,
-                                        std::false_type) const
-  {
+                                        std::false_type) const {
     const Direction_3& normal = xcv.normal();
     FT z((atan_x * normal.dx() + atan_y * normal.dy()) /
          -(normal.dz()));
@@ -383,8 +446,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * \param[in] cv the curve
    */
   bool overlap_with_identification(const X_monotone_curve_2& xcv,
-                                   std::true_type) const
-  {
+                                   std::true_type) const {
     const Direction_3& normal = xcv.normal();
     return ((x_sign(normal) == ZERO) &&
             (((y_sign(normal) == NEGATIVE) && !xcv.is_directed_right()) ||
@@ -395,8 +457,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    * \param[in] cv the curve
    */
   bool overlap_with_identification(const X_monotone_curve_2& xcv,
-                                   std::false_type) const
-  {
+                                   std::false_type) const {
     const Direction_3& normal = xcv.normal();
     const Direction_3& iden_normal = identification_normal();
     const Direction_2 iden_normal_xy = project_xy(iden_normal);
@@ -417,9 +478,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! A functor that constructs a point on the sphere. */
   class Construct_point_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -436,8 +497,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \param[in] y the y coordinate
      * \param[in] z the z coordinate
      */
-    Point_2 operator()(const FT& x, const FT& y, const FT& z)
-    {
+    Point_2 operator()(const FT& x, const FT& y, const FT& z) {
       Point_2 p;
       Direction_3& d(p);
       d = Direction_3(x, y, z);
@@ -449,8 +509,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * direction.
      * \param other the other direction
      */
-    Point_2 operator()(const Direction_3& other)
-    {
+    Point_2 operator()(const Direction_3& other) {
       Point_2 p;
       Direction_3& d(p);
       d = Direction_3(other);
@@ -461,8 +520,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
     /*! Initialize a point on the sphere,
      * \param[in] p the point to initialize.
      */
-    void init(Point_2& p, std::true_type) const
-    {
+    void init(Point_2& p, std::true_type) const {
       const Direction_3& dir = p;
       if (y_sign(dir) != ZERO) {
         p.set_location(Point_2::NO_BOUNDARY_LOC);
@@ -480,8 +538,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
     /*! Initialize a point on the sphere,
      * \param[in] p the point to initialize.
      */
-    void init(Point_2& p, std::false_type) const
-    {
+    void init(Point_2& p, std::false_type) const {
       const Direction_3& dir = p;
       if ((x_sign(dir) == ZERO) && (y_sign(dir) == ZERO)) {
         typename Point_2::Location_type location = (z_sign(dir) == NEGATIVE) ?
@@ -508,9 +565,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! A functor that constructs an x-monotone geodesic arc on the sphere. */
   class Construct_x_monotone_curve_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -536,9 +593,8 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \pre the source and target must not coincide.
      * \pre the source and target cannot be antipodal.
      */
-    X_monotone_curve_2 operator()(const Point_2& source, const Point_2& target)
-      const
-    {
+    X_monotone_curve_2 operator()(const Point_2& source,
+                                  const Point_2& target) const {
       X_monotone_curve_2 xcv;
 
       xcv.set_source(source);
@@ -561,8 +617,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \param plane the containing plane.
      * \pre the plane is not vertical
      */
-    X_monotone_curve_2 operator()(const Direction_3& normal) const
-    {
+    X_monotone_curve_2 operator()(const Direction_3& normal) const {
       X_monotone_curve_2 xcv;
 
       xcv.set_normal(normal);
@@ -608,12 +663,11 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \param target the target point.
      * \pre the source and target cannot be equal.
      */
-    void init(X_monotone_curve_2& xcv) const
-    {
+    void init(X_monotone_curve_2& xcv) const {
       const Point_2& source = xcv.source();
       const Point_2& target = xcv.target();
 
-      typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+      using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
       const Kernel& kernel(m_traits);
       CGAL_precondition(!kernel.equal_3_object()(Direction_3(source),
@@ -701,9 +755,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! A functor that constructs a geodesic arc on the sphere. */
   class Construct_curve_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -728,8 +782,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \pre the source and target cannot be equal.
      * \pre the source and target cannot be the opoosite of each other.
      */
-    Curve_2 operator()(const Point_2& source, const Point_2& target)
-    {
+    Curve_2 operator()(const Point_2& source, const Point_2& target) {
       Curve_2 cv;
       cv.set_source(source);
       cv.set_target(target);
@@ -794,8 +847,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       Orientation orient = m_traits.orientation(s, t);
 
       const Kernel& kernel = m_traits;
-      typename Kernel::Counterclockwise_in_between_2 cc_in_between =
-        kernel.counterclockwise_in_between_2_object();
+      auto cc_in_between = kernel.counterclockwise_in_between_2_object();
 
       const Direction_2& d = Traits::identification_xy();
       if (orient == LEFT_TURN) {
@@ -819,8 +871,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \pre Both endpoints lie on the given plane.
      */
     Curve_2 operator()(const Point_2& source, const Point_2& target,
-                       const Direction_3& normal)
-    {
+                       const Direction_3& normal) {
       Curve_2 cv;
 
       cv.set_source(source);
@@ -829,7 +880,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       cv.set_is_degenerate(false);
       cv.set_is_empty(false);
 
-      typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+      using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
       CGAL_precondition(m_traits.has_on(normal, source));
       CGAL_precondition(m_traits.has_on(normal, target));
@@ -912,8 +963,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
         Direction_2 s = project(source);
         Direction_2 t = project(target);
         const Direction_2& ny = Traits::neg_y_2();
-        typename Kernel::Counterclockwise_in_between_2 ccib =
-          kernel.counterclockwise_in_between_2_object();
+        auto ccib = kernel.counterclockwise_in_between_2_object();
         cv.set_is_x_monotone((plane_is_positive && !ccib(ny, s, t)) ||
                              (!plane_is_positive && !ccib(ny, t, s)));
 
@@ -929,8 +979,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       const Direction_2& d = Traits::identification_xy();
       Direction_2 s = Traits::project_xy(source);
       Direction_2 t = Traits::project_xy(target);
-      typename Kernel::Counterclockwise_in_between_2 ccib =
-        kernel.counterclockwise_in_between_2_object();
+      auto ccib = kernel.counterclockwise_in_between_2_object();
       bool plane_is_positive = (z_sign(normal) == POSITIVE);
       cv.set_is_x_monotone((plane_is_positive && !ccib(d, s, t)) ||
                            (!plane_is_positive && !ccib(d, t, s)));
@@ -961,9 +1010,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! A functor that compares the x-coordinates of two directional points */
   class Compare_x_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -983,8 +1032,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \pre p1 does not lie on the boundary.
      * \pre p2 does not lie on the boundary.
      */
-    Comparison_result operator()(const Point_2& p1, const Point_2& p2) const
-    {
+    Comparison_result operator()(const Point_2& p1, const Point_2& p2) const {
       CGAL_precondition(p1.is_no_boundary());
       CGAL_precondition(p2.is_no_boundary());
 
@@ -996,8 +1044,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! Obtain the positive (north) pole
    * \return the positive (north) pole
    */
-  inline static const Point_2& pos_pole()
-  {
+  inline static const Point_2& pos_pole() {
     static const Point_2 p(Direction_3(0, 0, 1), Point_2::MAX_BOUNDARY_LOC);
     return p;
   }
@@ -1005,8 +1052,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! Obtain the negative (south) pole
    * \return the negative (south) pole
    */
-  inline static const Point_2& neg_pole()
-  {
+  inline static const Point_2& neg_pole() {
     static const Point_2 p(Direction_3(0, 0, -1), Point_2::MIN_BOUNDARY_LOC);
     return p;
   }
@@ -1020,9 +1066,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Compare_xy_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -1044,8 +1090,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \pre p1 does not lie on the boundary.
      * \pre p2 does not lie on the boundary.
      */
-    Comparison_result operator()(const Point_2& p1, const Point_2& p2) const
-    {
+    Comparison_result operator()(const Point_2& p1, const Point_2& p2) const {
       CGAL_precondition(p1.is_no_boundary());
       CGAL_precondition(p2.is_no_boundary());
 
@@ -1094,8 +1139,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \return true if the curve is a vertical spherical_arc; false otherwise.
      * \pre the arc is not degenerate (consists of a single point)
      */
-    bool operator()(const X_monotone_curve_2& xc) const
-    {
+    bool operator()(const X_monotone_curve_2& xc) const {
       CGAL_precondition(!xc.is_degenerate());
       return xc.is_vertical();
     }
@@ -1109,9 +1153,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Compare_y_at_x_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -1132,8 +1176,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \pre p is in the x-range of xc.
      */
     Comparison_result operator()(const Point_2& p,
-                                 const X_monotone_curve_2& xc) const
-    {
+                                 const X_monotone_curve_2& xc) const {
       CGAL_precondition(!p.is_min_boundary() && !p.is_max_boundary());
       CGAL_precondition(m_traits.is_in_x_range(xc, p));
 
@@ -1169,9 +1212,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Compare_y_at_x_left_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -1195,8 +1238,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      */
     Comparison_result operator()(const X_monotone_curve_2& xc1,
                                  const X_monotone_curve_2& xc2,
-                                 const Point_2& p) const
-    {
+                                 const Point_2& p) const {
       CGAL_precondition(! xc1.is_degenerate());
       CGAL_precondition(! xc2.is_degenerate());
       CGAL_precondition(p == xc1.right());
@@ -1227,8 +1269,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       auto opposite_3 = kernel.construct_opposite_direction_3_object();
       Direction_3 opposite_p = opposite_3(p);
       if (kernel.equal_3_object()(opposite_p, Direction_3(l1)) ||
-          kernel.equal_3_object()(opposite_p, Direction_3(l2)))
-      {
+          kernel.equal_3_object()(opposite_p, Direction_3(l2))) {
         Sign xsign = Traits::x_sign(p);
         Sign ysign = Traits::y_sign(p);
         Project project = (xsign == ZERO) ?
@@ -1286,9 +1327,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Compare_y_at_x_right_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -1312,8 +1353,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      */
     Comparison_result operator()(const X_monotone_curve_2& xc1,
                                  const X_monotone_curve_2& xc2,
-                                 const Point_2& p) const
-    {
+                                 const Point_2& p) const {
       CGAL_precondition(! xc1.is_degenerate());
       CGAL_precondition(! xc2.is_degenerate());
 
@@ -1335,8 +1375,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
       auto opposite_3 = kernel.construct_opposite_direction_3_object();
       Direction_3 opposite_p = opposite_3(p);
       if (kernel.equal_3_object()(opposite_p, Direction_3(r1)) ||
-          kernel.equal_3_object()(opposite_p, Direction_3(r2)))
-      {
+          kernel.equal_3_object()(opposite_p, Direction_3(r2))) {
         Sign xsign = Traits::x_sign(p);
         Sign ysign = Traits::y_sign(p);
         Project project = (xsign == ZERO) ?
@@ -1402,9 +1441,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Equal_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -1422,8 +1461,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \return true if the two curves are the same; false otherwise.
      */
     bool operator()(const X_monotone_curve_2& xc1,
-                    const X_monotone_curve_2& xc2) const
-    {
+                    const X_monotone_curve_2& xc2) const {
       const Kernel& kernel = m_traits;
       typename Kernel::Equal_3 equal_3 = kernel.equal_3_object();
       if (xc1.is_full() || xc2.is_full()) {
@@ -1447,8 +1485,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \param p2 the second point.
      * \return true if the two point are the same; false otherwise.
      */
-    bool operator()(const Point_2& p1, const Point_2& p2) const
-    {
+    bool operator()(const Point_2& p1, const Point_2& p2) const {
       const Kernel& kernel = m_traits;
       return kernel.equal_3_object()(Direction_3(p1), Direction_3(p2));
     }
@@ -1466,9 +1503,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Parameter_space_in_x_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -1498,8 +1535,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \pre xcv does not coincide with the identification
      */
     Arr_parameter_space operator()(const X_monotone_curve_2& xcv,
-                                   Arr_curve_end ce) const
-    {
+                                   Arr_curve_end ce) const {
       CGAL_precondition(!m_traits.is_on_y_identification_2_object()(xcv));
       // vertical, but not on identification!
       if (xcv.is_vertical()) return ARR_INTERIOR;
@@ -1516,8 +1552,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \param p the point.
      * \return the parameter space at p.
      */
-    Arr_parameter_space operator()(const Point_2& p) const
-    {
+    Arr_parameter_space operator()(const Point_2& p) const {
       CGAL_precondition(p.is_no_boundary());
       CGAL_USE(p);
       return ARR_INTERIOR;
@@ -1551,8 +1586,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      *                          maximal end.
      */
     Arr_parameter_space operator()(const X_monotone_curve_2& xcv,
-                                   Arr_curve_end ce) const
-    {
+                                   Arr_curve_end ce) const {
       return (ce == ARR_MIN_END) ?
         ((xcv.left().is_min_boundary()) ?  ARR_BOTTOM_BOUNDARY: ARR_INTERIOR) :
         ((xcv.right().is_max_boundary()) ? ARR_TOP_BOUNDARY : ARR_INTERIOR);
@@ -1565,8 +1599,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \param p the point.
      * \return the parameter space at p.
      */
-    Arr_parameter_space operator()(const Point_2& p) const
-    {
+    Arr_parameter_space operator()(const Point_2& p) const {
       return
         (p.is_min_boundary()) ? ARR_BOTTOM_BOUNDARY :
         (p.is_max_boundary()) ? ARR_TOP_BOUNDARY : ARR_INTERIOR;
@@ -1583,9 +1616,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Compare_x_on_boundary_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -1613,8 +1646,8 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      */
     Comparison_result operator()(const Point_2& point,
                                  const X_monotone_curve_2& xcv,
-                                 Arr_curve_end CGAL_precondition_code(ce)) const
-    {
+                                 Arr_curve_end CGAL_precondition_code(ce))
+      const {
       CGAL_precondition(point.is_no_boundary());
       CGAL_precondition_code
         (const Point_2& p2 = (ce == ARR_MIN_END) ? xcv.left() : xcv.right(););
@@ -1659,8 +1692,8 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
     Comparison_result operator()(const X_monotone_curve_2& xcv1,
                                  Arr_curve_end CGAL_precondition_code(ce1),
                                  const X_monotone_curve_2& xcv2,
-                                 Arr_curve_end CGAL_precondition_code(ce2)) const
-    {
+                                 Arr_curve_end CGAL_precondition_code(ce2))
+      const {
       CGAL_precondition_code
         (const Point_2& p1 = (ce1 == ARR_MIN_END) ? xcv1.left() : xcv1.right(););
       CGAL_precondition(!p1.is_no_boundary());
@@ -1695,9 +1728,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      */
     Comparison_result operator()(const Point_2& /* p1 */,
                                  const Point_2& /* p2 */) const
-    {
-      CGAL_error(); return EQUAL;
-    }
+    { CGAL_error(); return EQUAL; }
   };
 
   /*! Obtain a Compare_x_on_boundary_2 function object.
@@ -1710,9 +1741,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Compare_x_near_boundary_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -1746,8 +1777,8 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
                                  CGAL_precondition_code(xcv1),
                                  const X_monotone_curve_2&
                                  CGAL_precondition_code(xcv2),
-                                 Arr_curve_end CGAL_precondition_code(ce)) const
-    {
+                                 Arr_curve_end CGAL_precondition_code(ce))
+      const {
       CGAL_precondition_code
         (const Point_2& p1 = (ce == ARR_MIN_END) ? xcv1.left() : xcv1.right(););
       CGAL_precondition(!p1.is_no_boundary());
@@ -1774,9 +1805,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Compare_y_near_boundary_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -1800,8 +1831,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      */
     Comparison_result operator()(const X_monotone_curve_2& xcv1,
                                  const X_monotone_curve_2& xcv2,
-                                 Arr_curve_end ce) const
-    {
+                                 Arr_curve_end ce) const {
       CGAL_precondition(! xcv1.is_degenerate());
       CGAL_precondition(! xcv2.is_degenerate());
 
@@ -1918,9 +1948,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Is_on_y_identification_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -1944,8 +1974,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \return a Boolean indicating whether xcv coincides with the vertical
      * identification arc.
      */
-    bool operator()(const X_monotone_curve_2& xcv) const
-    {
+    bool operator()(const X_monotone_curve_2& xcv) const {
       /* If the curve is not vertical and non of its endpoints lie on the
        * boundary, the arc itself cannot lie on the identification arc.
        */
@@ -1977,9 +2006,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Compare_y_on_boundary_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -2000,8 +2029,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \pre p1 lies on the vertical identification arc including the poles!
      * \pre p2 lies on the vertical identification arc including the poles!
      */
-    Comparison_result operator()(const Point_2& p1, const Point_2& p2) const
-    {
+    Comparison_result operator()(const Point_2& p1, const Point_2& p2) const {
       // first deal with the 'degenerate' case of poles!
       if (p1.is_min_boundary()) {
         if (p2.is_min_boundary()) return EQUAL;
@@ -2039,9 +2067,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
    */
   class Make_x_monotone_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -2063,8 +2091,8 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      */
     template <typename OutputIterator>
     OutputIterator operator()(const Curve_2& c, OutputIterator oi) const {
-      typedef boost::variant<Point_2, X_monotone_curve_2>
-        Make_x_monotone_result;
+      using Make_x_monotone_result =
+        boost::variant<Point_2, X_monotone_curve_2>;
       // std::cout << "full: " << c.is_full() << std::endl;
       // std::cout << "vert: " << c.is_vertical() << std::endl;
       // std::cout << "xmon: " << c.is_x_monotone() << std::endl;
@@ -2199,9 +2227,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! A functor that splits an x-monotone arc at a directional point. */
   class Split_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -2223,8 +2251,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \pre xc is not degenerate
      */
     void operator()(const X_monotone_curve_2& xc, const Point_2& p,
-                    X_monotone_curve_2& xc1, X_monotone_curve_2& xc2) const
-    {
+                    X_monotone_curve_2& xc1, X_monotone_curve_2& xc2) const {
       CGAL_precondition(!xc.is_degenerate());
       const Point_2& source = xc.source();
       const Point_2& target = xc.target();
@@ -2268,9 +2295,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! The clockwise-in-between function object */
   class Clockwise_in_between_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -2282,8 +2309,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
 
   public:
     bool operator()(const Direction_2& d,
-                    const Direction_2& d1, const Direction_2& d2) const
-    {
+                    const Direction_2& d1, const Direction_2& d2) const {
       const Kernel& kernel = m_traits;
       return kernel.counterclockwise_in_between_2_object()(d, d2, d1);
     }
@@ -2318,11 +2344,10 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
                                         bool vertical,
                                         const In_between& in_between,
                                         Project project,
-                                        OutputIterator oi) const
-    {
-      typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
+                                        OutputIterator oi) const {
+      using Intersection_point = std::pair<Point_2, Multiplicity>;
+      using Intersection_result =
+        boost::variant<Intersection_point, X_monotone_curve_2>;
       const Kernel& kernel = m_traits;
       typename Kernel::Equal_2 equal = kernel.equal_2_object();
 
@@ -2473,8 +2498,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * \pre point lies in the underlying plane of xc.
      */
     bool is_in_between(const Point_2& point,
-                       const X_monotone_curve_2& xc) const
-    {
+                       const X_monotone_curve_2& xc) const {
       const Kernel& kernel = m_traits;
       CGAL_precondition(m_traits.has_on(xc.normal(), point));
 
@@ -2523,9 +2547,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
     }
 
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -2548,20 +2572,16 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
     template<typename OutputIterator>
     OutputIterator operator()(const X_monotone_curve_2& xc1,
                               const X_monotone_curve_2& xc2,
-                              OutputIterator oi) const
-    {
+                              OutputIterator oi) const {
       // std::cout << "xc1: " << xc1 << std::endl
       //           << "xc2: " << xc2 << std::endl;
       CGAL_precondition(!xc1.is_degenerate());
       CGAL_precondition(!xc2.is_degenerate());
 
-      typedef typename Kernel::Counterclockwise_in_between_2
-        Counterclockwise_in_between_2;
-      typedef typename Kernel::Equal_3                  Equal_3;
-
-      typedef std::pair<Point_2, Multiplicity>          Intersection_point;
-      typedef boost::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
+      using Equal_3 = typename Kernel::Equal_3;
+      using Intersection_point = std::pair<Point_2, Multiplicity>;
+      using Intersection_result =
+        boost::variant<Intersection_point, X_monotone_curve_2>;
 
       const Kernel& kernel = m_traits;
 
@@ -2574,7 +2594,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
 
       if (equal_3(normal1, normal2) || equal_3(opposite_normal1, normal2)) {
         // The underlying planes are the same
-        Counterclockwise_in_between_2 ccib = kernel.counterclockwise_in_between_2_object();
+        auto ccib = kernel.counterclockwise_in_between_2_object();
         auto cib = m_traits.clockwise_in_between_2_object();
 
         if (xc1.is_vertical()) {
@@ -2662,9 +2682,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
 
   /*! A functor that tests whether two x-monotone arcs can be merged. */
   class Are_mergeable_2 {
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -2684,8 +2704,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      * 2. share a common endpoint that is not on the identification arc
      */
     bool operator()(const X_monotone_curve_2& xc1,
-                    const X_monotone_curve_2& xc2) const
-    {
+                    const X_monotone_curve_2& xc2) const {
       if (xc1.is_empty() || xc2.is_empty()) return true;
       if ((xc1.is_full() || xc1.is_meridian()) &&
           (xc2.is_full() || xc2.is_meridian())) return false;
@@ -2734,9 +2753,9 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! A functor that merges two x-monotone arcs into one */
   class Merge_2 {
   protected:
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel, atan_x, atan_y>;
 
-    /*! The traits (in case it has state) */
+    //! The traits (in case it has state)
     const Traits& m_traits;
 
     /*! Constructor
@@ -2755,8 +2774,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      */
     void operator()(const X_monotone_curve_2& xc1,
                     const X_monotone_curve_2& xc2,
-                    X_monotone_curve_2& xc) const
-    {
+                    X_monotone_curve_2& xc) const {
       CGAL_precondition (m_traits.are_mergeable_2_object()(xc1, xc2) == true);
 
       if (xc1.is_degenerate() || xc1.is_empty()) {
@@ -2835,9 +2853,11 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
 
   /// \name Functor definitions for the landmarks point-location strategy.
   //@{
-  typedef double                                        Approximate_number_type;
-  typedef CGAL::Cartesian<Approximate_number_type>      Approximate_kernel;
-  typedef Approximate_kernel::Point_2                   Approximate_point_2;
+  using Approximate_number_type = double;
+  using Approximate_kernel = CGAL::Cartesian<Approximate_number_type>;
+  using Approximate_point_2 = Arr_extended_direction_3<Approximate_kernel>;
+  using Approximate_kernel_vector_3 = Approximate_kernel::Vector_3;
+  using Approximate_kernel_direction_3 = Approximate_kernel::Direction_3;
 
   class Approximate_2 {
   public:
@@ -2849,21 +2869,103 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
      *         approximation of p's y-coordinate (if i == 1).
      */
     Approximate_number_type operator()(const Point_2& p, int i) const {
-      CGAL_precondition((i == 0) || (i == 1));
-      return (i == 0) ? CGAL::to_double(p.x()) : CGAL::to_double(p.y());
+      CGAL_precondition((i == 0) || (i == 1) || (i == 2));
+      return (i == 0) ? CGAL::to_double(p.dx()) :
+        ((i == 1) ? CGAL::to_double(p.dy()) : CGAL::to_double(p.dz()));
     }
 
     /*! Obtain an approximation of a point.
      */
-    Approximate_point_2 operator()(const Point_2& p) const
-    { return Approximate_point_2(operator()(p, 0), operator()(p, 1)); }
+    Approximate_point_2 operator()(const Point_2& p) const {
+      Approximate_kernel::Direction_3 dir(operator()(p, 0), operator()(p, 1),
+                                          operator()(p, 2));
+      auto loc = static_cast<Approximate_point_2::Location_type>(p.location());
+      return Approximate_point_2(dir, loc);
+    }
 
     /*! Obtain an approximation of an \f$x\f$-monotone curve.
      */
     template <typename OutputIterator>
-    OutputIterator operator()(const X_monotone_curve_2& /* xcv */, double /* error */,
-                              OutputIterator /* oi */, bool /* l2r */ = true) const {
-      CGAL_error_msg("Not implemented yet!");
+    OutputIterator operator()(const X_monotone_curve_2& xcv,
+                              Approximate_number_type error,
+                              OutputIterator oi, bool l2r = true) const {
+      auto s = xcv.source();
+      auto t = xcv.target();
+      auto n = xcv.normal();
+
+      // get the approximate points;
+      auto as = (*this)(s);
+      auto at = (*this)(t);
+
+      // convert the approximate points to vectors with approximate-kernel
+      auto vs = approximate_vector_3(as);
+      auto vt = approximate_vector_3(at);
+      auto vn = approximate_vector_3(n);
+
+      // normalize the vectors
+      auto normalize = [](auto& x) { x /= std::sqrt(x.squared_length()); };
+      normalize(vs);
+      normalize(vt);
+      normalize(vn);
+
+      // Define the spanning vectors of the coordinate system where we are
+      //   going to make the approximation:
+      auto axis_x = vs; // x-axis will coincide with the vector from the
+                        //   origin to the normalized SOURCE-vector
+      auto axis_z = vn; // this will make sure that the orientation of the
+                        //   approximated curve is consistent with the curve
+      auto axis_y = CGAL::cross_product(axis_z, axis_x);
+      normalize(axis_y);
+
+      // In this coordinate system the source has local coords (0,0), hence its
+      //   initial angle with the X-axis is 0 degrees (radians)
+      // Compute the local coordinates and the angle it makes with the X-axis
+      Approximate_number_type  theta;
+      if (xcv.is_full()) theta = 2.0 * CGAL_PI;
+      else {
+        auto ltx = CGAL::scalar_product(axis_x, vt);
+        auto lty = CGAL::scalar_product(axis_y, vt);
+        theta = std::atan2(lty, ltx);
+        if (theta < 0)
+          theta += 2.0 * CGAL_PI;
+      }
+
+      // compute the number of divisions given the requested error
+      const Approximate_number_type  R = 1.0; // radius is always 1
+      Approximate_number_type dtheta = 2.0 * std::acos(1 - error / R);
+      int num_segs = std::ceil(theta / dtheta);
+      dtheta = theta / num_segs;
+
+      // generate the points approximating the curve
+      const auto loc = Approximate_point_2::NO_BOUNDARY_LOC;
+      *oi++ = approximate_point_2(vs, loc); // source vector
+      for (int i = 1; i < num_segs; ++i) {
+        const Approximate_number_type angle = i * dtheta;
+        auto p = std::cos(angle) * axis_x + std::sin(angle) * axis_y;
+        *oi++ = approximate_point_2(p, loc);
+      }
+      *oi++ = approximate_point_2(vt, loc); // target vector
+
+      return oi;
+    }
+
+  private:
+    Approximate_kernel_vector_3
+    approximate_vector_3(const Approximate_point_2& p) const
+    { return Approximate_kernel_vector_3(p.dx(), p.dy(), p.dz()); };
+
+    Approximate_kernel_vector_3
+    approximate_vector_3(const Direction_3& d) const {
+      return Approximate_kernel_vector_3(CGAL::to_double(d.dx()),
+                                         CGAL::to_double(d.dy()),
+                                         CGAL::to_double(d.dz()));
+    };
+
+    Approximate_point_2
+    approximate_point_2(const Approximate_kernel_vector_3& v,
+                        const Approximate_point_2::Location_type loc) const {
+      Approximate_kernel_direction_3  d(v.x(), v.y(), v.z());
+      return Approximate_point_2(d, loc);
     }
   };
 
@@ -2877,9 +2979,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
 
   class Compare_endpoints_xy_2 {
   public:
-
-    /*!
-     * Compare the endpoints of an $x$-monotone curve lexicographically.
+    /*! Compare the endpoints of an $x$-monotone curve lexicographically.
      * (assuming the curve has a designated source and target points).
      * \param xc the curve.
      * \return SMALLER if the curve is directed right;
@@ -2911,8 +3011,7 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
 #if 0
   /*! Inserter for the spherical_arc class used by the traits-class */
   template <typename OutputStream>
-  friend OutputStream& operator<<(OutputStream& os, const Point_2& p)
-  {
+  friend OutputStream& operator<<(OutputStream& os, const Point_2& p) {
     CGAL::To_double<typename Kernel::FT> todouble;
     os << static_cast<float>(todouble(p.dx())) << ", "
        << static_cast<float>(todouble(p.dy())) << ", "
@@ -2923,101 +3022,20 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
   /*! Inserter for the spherical_arc class used by the traits-class */
   template <typename OutputStream>
   friend OutputStream& operator<<(OutputStream& os,
-                                  const X_monotone_curve_2& xc)
-  {
+                                  const X_monotone_curve_2& xc) {
     os << "(" << xc.left() << "), (" << xc.right() << ")";
     return os;
   }
 
   /*! Extractor for the spherical_arc class used by the traits-class */
   template <typename InputStream>
-  friend InputStream& operator>>(InputStream& is, X_monotone_curve_2& arc)
-  {
+  friend InputStream& operator>>(InputStream& is, X_monotone_curve_2& arc) {
     CGAL_error_msg("Not implemented yet!");
     return is;
   }
 #endif
 };
 
-/*! Represent an extended 3D direction that is used in turn to represent a
- * spherical-arc endpoint. The extended data consists of two flags that
- * indicate whether the point is on the x and on a y boundaries,
- * respectively.
- */
-template <typename Kernel>
-class Arr_extended_direction_3 : public Kernel::Direction_3 {
-public:
-  typedef typename Kernel::FT                           FT;
-  typedef typename Kernel::Direction_3                  Direction_3;
-
-  /*! Enumeration of discontinuity type */
-  enum Location_type {
-    NO_BOUNDARY_LOC = 0,
-    MIN_BOUNDARY_LOC,
-    MID_BOUNDARY_LOC,
-    MAX_BOUNDARY_LOC
-  };
-
-private:
-  typedef typename Kernel::Direction_2                  Direction_2;
-
-  /*! The point discontinuity type */
-  Location_type m_location;
-
-  inline Sign x_sign(Direction_3 d) const { return CGAL::sign(d.dx()); }
-
-  inline Sign y_sign(Direction_3 d) const { return CGAL::sign(d.dy()); }
-
-  inline Sign z_sign(Direction_3 d) const { return CGAL::sign(d.dz()); }
-
-public:
-  /*! Default constructor */
-  Arr_extended_direction_3() :
-    Direction_3(0, 0, 1),
-    m_location(MAX_BOUNDARY_LOC)
-  {}
-
-  /*! Constructor */
-  Arr_extended_direction_3(const Direction_3& dir, Location_type location) :
-    Direction_3(dir),
-    m_location(location)
-  {}
-
-  /*! Copy constructor */
-  Arr_extended_direction_3(const Arr_extended_direction_3& other) :
-    Direction_3(static_cast<const Direction_3&>(other))
-  { m_location = other.discontinuity_type(); }
-
-  /*! Assignment operator */
-  Arr_extended_direction_3& operator=(const Arr_extended_direction_3& other)
-  {
-    *(static_cast<Direction_3*>(this)) = static_cast<const Direction_3&>(other);
-    m_location = other.discontinuity_type();
-    return (*this);
-  }
-
-  /*! Set the location of the point.
-   */
-  void set_location(Location_type location) { m_location = location; }
-
-  /*! Obtain the location of the point.
-   */
-  Location_type location() const { return m_location; }
-
-  /*! Obtain the discontinuity type of the point.
-   * \todo deprecate this one; use the above instead.
-   */
-  Location_type discontinuity_type() const { return m_location; }
-
-  bool is_no_boundary() const { return (m_location == NO_BOUNDARY_LOC); }
-
-  bool is_min_boundary() const { return (m_location == MIN_BOUNDARY_LOC); }
-
-  bool is_mid_boundary() const { return (m_location == MID_BOUNDARY_LOC); }
-
-  bool is_max_boundary() const { return (m_location == MAX_BOUNDARY_LOC); }
-};
-
 /*! A Representation of an x-monotone great circular arc embedded on a sphere,
  * as used by the Arr_geodesic_arc_on_sphere_traits_2 traits-class
  * An x-monotone great circular arc cannot cross the closed hemi-circle arc of
@@ -3029,38 +3047,38 @@ class Arr_extended_direction_3 : public Kernel::Direction_3 {
 template <typename Kernel_>
 class Arr_x_monotone_geodesic_arc_on_sphere_3 {
 public:
-  typedef Kernel_                                    Kernel;
-  typedef typename Kernel::Direction_3                Direction_3;
-  typedef typename Kernel::Plane_3                    Plane_3;
-  typedef typename Kernel::Vector_3                   Vector_3;
-  typedef typename Kernel::Direction_2                Direction_2;
+  using Kernel = Kernel_;
+  using Direction_3 = typename Kernel::Direction_3;
+  using Plane_3 = typename Kernel::Plane_3;
+  using Vector_3 = typename Kernel::Vector_3;
+  using Direction_2 = typename Kernel::Direction_2;
 
 protected:
   // For some reason compilation under Windows fails without the qualifier
-  typedef CGAL::Arr_extended_direction_3<Kernel>      Arr_extended_direction_3;
+  using Arr_extended_direction_3 = CGAL::Arr_extended_direction_3<Kernel>;
 
-  /*! The source point of the arc. */
+  //! The source point of the arc.
   Arr_extended_direction_3 m_source;
 
-  /*! The target point of the arc. */
+  //! The target point of the arc.
   Arr_extended_direction_3 m_target;
 
-  /*! The direction of the plane that contains the arc. */
+  //! The direction of the plane that contains the arc.
   Direction_3 m_normal;
 
-  /*! The arc is vertical. */
+  //! The arc is vertical.
   bool m_is_vertical;
 
-  /*! Target (lexicographically) larger than source. */
+  //! Target (lexicographically) larger than source.
   bool m_is_directed_right;
 
-  /*! The arc is a full circle. */
+  //! The arc is a full circle.
   bool m_is_full;
 
-  /* The arc is degenerate - it consists of a single point. */
+  //! The arc is degenerate - it consists of a single point.
   bool m_is_degenerate;
 
-  /*! The arc is empty. */
+  //! The arc is empty.
   bool m_is_empty;
 
   inline Sign x_sign(Direction_3 d) const { return CGAL::sign(d.dx()); }
@@ -3109,8 +3127,7 @@ class Arr_x_monotone_geodesic_arc_on_sphere_3 {
    * \param other the other arc
    */
   Arr_x_monotone_geodesic_arc_on_sphere_3
-  (const Arr_x_monotone_geodesic_arc_on_sphere_3& other)
-  {
+  (const Arr_x_monotone_geodesic_arc_on_sphere_3& other) {
     m_source = other.m_source;
     m_target = other.m_target;
     m_normal = other.m_normal;
@@ -3123,8 +3140,7 @@ class Arr_x_monotone_geodesic_arc_on_sphere_3 {
 
   /*! Assignment operator */
   Arr_x_monotone_geodesic_arc_on_sphere_3& operator=
-  (const Arr_x_monotone_geodesic_arc_on_sphere_3& other)
-  {
+  (const Arr_x_monotone_geodesic_arc_on_sphere_3& other) {
     m_source = other.m_source;
     m_target = other.m_target;
     m_normal = other.m_normal;
@@ -3150,9 +3166,8 @@ class Arr_x_monotone_geodesic_arc_on_sphere_3 {
    * \param target the target point.
    * \pre the source and target cannot be equal.
    */
-  void init()
-  {
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel> Traits;
+  void init() {
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel>;
 
     Kernel kernel;
     CGAL_precondition(!kernel.equal_3_object()(Direction_3(m_source),
@@ -3241,8 +3256,7 @@ class Arr_x_monotone_geodesic_arc_on_sphere_3 {
     m_is_directed_right(z_sign(normal) == POSITIVE),
     m_is_full(true),
     m_is_degenerate(false),
-    m_is_empty(false)
-  {
+    m_is_empty(false) {
     CGAL_precondition(z_sign(normal) != ZERO);
 
 #if (CGAL_IDENTIFICATION_XY == CGAL_X_MINUS_1_Y_0)
@@ -3250,8 +3264,8 @@ class Arr_x_monotone_geodesic_arc_on_sphere_3 {
       Direction_3(-(normal.dz()), 0, normal.dx()) :
       Direction_3(normal.dz(), 0, -(normal.dx()));
 #else
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel> Traits;
-    typedef typename Kernel::FT                         FT;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel>;
+    using FT = typename Kernel::FT;
 
     const Direction_2& xy = Traits::identification_xy();
     FT x = xy.dx();
@@ -3277,8 +3291,7 @@ class Arr_x_monotone_geodesic_arc_on_sphere_3 {
     m_is_directed_right(z_sign(normal) == POSITIVE),
     m_is_full(true),
     m_is_degenerate(false),
-    m_is_empty(false)
-  {
+    m_is_empty(false) {
     CGAL_precondition(has_on(point));
     CGAL_precondition(z_sign(normal) != ZERO);
 #if !defined(CGAL_FULL_X_MONOTONE_GEODESIC_ARC_ON_SPHERE_IS_SUPPORTED)
@@ -3303,8 +3316,7 @@ class Arr_x_monotone_geodesic_arc_on_sphere_3 {
     m_normal(normal),
     m_is_full(false),
     m_is_degenerate(false),
-    m_is_empty(false)
-  {
+    m_is_empty(false) {
     CGAL_precondition(has_on(source));
     CGAL_precondition(has_on(target));
 
@@ -3414,8 +3426,7 @@ class Arr_x_monotone_geodesic_arc_on_sphere_3 {
 
 #if 0
   /*! Create a bounding box for the spherical_arc */
-  Bbox_2 bbox() const
-  {
+  Bbox_2 bbox() const {
     Kernel kernel;
     Segment_2 seg = kernel.construct_spherical_arc_2_object()(this->m_source,
                                                               this->m_target);
@@ -3424,8 +3435,7 @@ class Arr_x_monotone_geodesic_arc_on_sphere_3 {
 #endif
 
   /*! Flip the spherical_arc (swap it source and target) */
-  Arr_x_monotone_geodesic_arc_on_sphere_3 opposite() const
-  {
+  Arr_x_monotone_geodesic_arc_on_sphere_3 opposite() const {
     Arr_x_monotone_geodesic_arc_on_sphere_3 opp;
     opp.m_source = this->m_target;
     opp.m_target = this->m_source;
@@ -3444,8 +3454,7 @@ class Arr_x_monotone_geodesic_arc_on_sphere_3 {
    * \return true if dir is contained in plane; false otherwise.
    * \pre the plane contains the origin.
    */
-  inline bool has_on(const Direction_3& dir) const
-  {
+  inline bool has_on(const Direction_3& dir) const {
     typename Kernel::FT dot = normal().vector() * dir.vector();
     return CGAL::sign(dot) == ZERO;
   }
@@ -3463,25 +3472,25 @@ template <typename Kernel_>
 class Arr_geodesic_arc_on_sphere_3 :
   public Arr_x_monotone_geodesic_arc_on_sphere_3<Kernel_> {
 public:
-  typedef Kernel_                                               Kernel;
+  using Kernel = Kernel_;
 
 protected:
-  typedef Arr_x_monotone_geodesic_arc_on_sphere_3<Kernel>       Base;
+  using Base = Arr_x_monotone_geodesic_arc_on_sphere_3<Kernel>;
 
 public:
-  typedef typename Base::Plane_3                                Plane_3;
-  typedef typename Base::Direction_3                            Direction_3;
-  typedef typename Base::Direction_2                            Direction_2;
+  using Plane_3 = typename Base::Plane_3;
+  using Direction_3 = typename Base::Direction_3;
+  using Direction_2 = typename Base::Direction_2;
 
 protected:
   // For some reason compilation under Windows fails without the qualifier
-  typedef CGAL::Arr_extended_direction_3<Kernel>    Arr_extended_direction_3;
+  using Arr_extended_direction_3 = CGAL::Arr_extended_direction_3<Kernel>;
 
   using Base::x_sign;
   using Base::y_sign;
   using Base::z_sign;
 
-  /*! Indicates whether the arc is x-monotone */
+  //! Indicates whether the arc is x-monotone
   bool m_is_x_monotone;
 
 public:
@@ -3537,8 +3546,7 @@ class Arr_geodesic_arc_on_sphere_3 :
    */
   Arr_geodesic_arc_on_sphere_3(const Arr_extended_direction_3& source,
                                const Arr_extended_direction_3& target,
-                               const Direction_3& normal)
-  {
+                               const Direction_3& normal) {
     Kernel kernel;
 
     this->set_source(source);
@@ -3547,7 +3555,7 @@ class Arr_geodesic_arc_on_sphere_3 :
     this->set_is_degenerate(false);
     this->set_is_empty(false);
 
-    typedef Arr_geodesic_arc_on_sphere_traits_2<Kernel> Traits;
+    using Traits = Arr_geodesic_arc_on_sphere_traits_2<Kernel>;
 
     CGAL_precondition(this->has_on(source));
     CGAL_precondition(this->has_on(target));
@@ -3627,8 +3635,7 @@ class Arr_geodesic_arc_on_sphere_3 :
       Direction_2 s = project(source);
       Direction_2 t = project(target);
       const Direction_2& ny = Traits::neg_y_2();
-      typename Kernel::Counterclockwise_in_between_2 ccib =
-        kernel.counterclockwise_in_between_2_object();
+      auto ccib = kernel.counterclockwise_in_between_2_object();
       set_is_x_monotone((plane_is_positive && !ccib(ny, s, t)) ||
                         (!plane_is_positive && !ccib(ny, t, s)));
 
@@ -3644,8 +3651,7 @@ class Arr_geodesic_arc_on_sphere_3 :
     const Direction_2& d = Traits::identification_xy();
     Direction_2 s = Traits::project_xy(source);
     Direction_2 t = Traits::project_xy(target);
-    typename Kernel::Counterclockwise_in_between_2 ccib =
-      kernel.counterclockwise_in_between_2_object();
+    auto ccib = kernel.counterclockwise_in_between_2_object();
     bool plane_is_positive = (z_sign(normal) == POSITIVE);
     set_is_x_monotone((plane_is_positive && !ccib(d, s, t)) ||
                       (!plane_is_positive && !ccib(d, t, s)));
@@ -3654,8 +3660,7 @@ class Arr_geodesic_arc_on_sphere_3 :
   /*! Construct a full spherical_arc from a normal to a plane.
    * \param normal the normal to the plane containing the arc.
    */
-  Arr_geodesic_arc_on_sphere_3(const Direction_3& normal)
-  {
+  Arr_geodesic_arc_on_sphere_3(const Direction_3& normal) {
     this->normal(normal);
     this->set_is_vertical(CGAL::sign(normal.dz()) == ZERO);
     this->set_is_directed_right(true);
@@ -3679,8 +3684,7 @@ class Arr_geodesic_arc_on_sphere_3 :
 /*! Inserter for the spherical_arc class used by the traits-class */
 template <typename Kernel, typename OutputStream>
 OutputStream& operator<<(OutputStream& os,
-                         const Arr_extended_direction_3<Kernel>& ed)
-{
+                         const Arr_extended_direction_3<Kernel>& ed) {
 #if defined(CGAL_ARR_GEODESIC_ARC_ON_SPHERE_DETAILS)
   os << "("
      << ed.dx() << ", " << ed.dy() << ",  " << ed.dz();
@@ -3703,8 +3707,7 @@ OutputStream& operator<<(OutputStream& os,
 template <typename Kernel, typename OutputStream>
 OutputStream&
 operator<<(OutputStream& os,
-           const Arr_x_monotone_geodesic_arc_on_sphere_3<Kernel>& arc)
-{
+           const Arr_x_monotone_geodesic_arc_on_sphere_3<Kernel>& arc) {
 #if defined(CGAL_ARR_GEODESIC_ARC_ON_SPHERE_DETAILS)
   os << "("
      << "(" << arc.source() << "), (" << arc.target() << ")"
@@ -3724,10 +3727,9 @@ operator<<(OutputStream& os,
 /*! Extractor for the spherical-arc point class used by the traits-class */
 template <typename Kernel_, typename InputStream>
 InputStream&
-operator>>(InputStream& is, Arr_extended_direction_3<Kernel_>& point)
-{
-  typedef Kernel_                              Kernel;
-  typedef Arr_extended_direction_3<Kernel>     Point;
+operator>>(InputStream& is, Arr_extended_direction_3<Kernel_>& point) {
+  using Kernel = Kernel_;
+  using Point = Arr_extended_direction_3<Kernel>;
   // CGAL_error_msg("Importing a geodesic point is not supported!");
   typename Kernel::Direction_3 d;
   is >> d;
@@ -3741,10 +3743,9 @@ operator>>(InputStream& is, Arr_extended_direction_3<Kernel_>& point)
 template <typename Kernel_, typename InputStream>
 InputStream&
 operator>>(InputStream& is,
-           Arr_x_monotone_geodesic_arc_on_sphere_3<Kernel_>& arc)
-{
-  typedef Kernel_                              Kernel;
-  typedef Arr_extended_direction_3<Kernel>     Point;
+           Arr_x_monotone_geodesic_arc_on_sphere_3<Kernel_>& arc) {
+  using Kernel = Kernel_;
+  using Point = Arr_extended_direction_3<Kernel>;
 
   // CGAL_error_msg("Importing a geodesic arc is not supported!\n");
 

From afa58a942661b42e7c2c432b286dbccb589ca33a Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 9 Aug 2023 17:46:35 +0300
Subject: [PATCH 0599/1398] Cleaned up

---
 .../Arrangement_2/Arrangement_zone_2_impl.h   | 64 +++++++------------
 1 file changed, 24 insertions(+), 40 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
index dfb8851479fd..054724aa6e4f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
@@ -28,8 +28,7 @@ namespace CGAL {
 //
 template <typename Arrangement, typename ZoneVisitor>
 void Arrangement_zone_2<Arrangement, ZoneVisitor>::
-init_with_hint(const X_monotone_curve_2& cv, Pl_result_type obj)
-{
+init_with_hint(const X_monotone_curve_2& cv, Pl_result_type obj) {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "init_with_hint()" << std::endl;
 #endif
@@ -80,8 +79,7 @@ init_with_hint(const X_monotone_curve_2& cv, Pl_result_type obj)
 // notifications for the visitor.
 //
 template <typename Arrangement, typename ZoneVisitor>
-void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone()
-{
+void Arrangement_zone_2<Arrangement, ZoneVisitor>::compute_zone() {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "compute_zone()" << std::endl;
 #endif
@@ -253,8 +251,7 @@ template <typename Arrangement, typename ZoneVisitor>
 bool  Arrangement_zone_2<Arrangement, ZoneVisitor>::
 do_overlap_impl(const X_monotone_curve_2& cv1,
                 const X_monotone_curve_2& cv2,
-                const Point_2& p, Arr_not_all_sides_oblivious_tag) const
-{
+                const Point_2& p, Arr_not_all_sides_oblivious_tag) const {
   typename Traits_adaptor_2::Compare_y_at_x_right_2 cmp_right =
     m_geom_traits->compare_y_at_x_right_2_object();
 
@@ -307,8 +304,7 @@ do_overlap_impl(const X_monotone_curve_2& cv1,
 //
 template <typename Arrangement, typename ZoneVisitor>
 bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
-_find_prev_around_vertex(Vertex_handle v, Halfedge_handle& he)
-{
+_find_prev_around_vertex(Vertex_handle v, Halfedge_handle& he) {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_find_prev_around_vertex(" << v->point() << ")" << std::endl;
 #endif
@@ -393,8 +389,7 @@ typename Arrangement_zone_2<Arrangement, ZoneVisitor>::Halfedge_handle
 Arrangement_zone_2<Arrangement, ZoneVisitor>::
 _direct_intersecting_edge_to_right(const X_monotone_curve_2& cv_ins,
                                    const Point_2& cv_left_pt,
-                                   Halfedge_handle query_he)
-{
+                                   Halfedge_handle query_he) {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_direct_intersecting_edge_to_right() " << cv_left_pt
             << std::endl;
@@ -446,8 +441,7 @@ template <typename Arrangement, typename ZoneVisitor>
 typename Arrangement_zone_2<Arrangement, ZoneVisitor>::Halfedge_handle
 Arrangement_zone_2<Arrangement, ZoneVisitor>::
 _direct_intersecting_edge_to_left(const X_monotone_curve_2& cv_ins,
-                                  Halfedge_handle query_he)
-{
+                                  Halfedge_handle query_he) {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_direct_intersecting_edge_to_left()" << std::endl;
 #endif
@@ -544,8 +538,7 @@ typename Arrangement_zone_2<Arrangement, ZoneVisitor>::Optional_intersection
 Arrangement_zone_2<Arrangement, ZoneVisitor>::
 _compute_next_intersection(Halfedge_handle he,
                            bool skip_first_point,
-                           Arr_parameter_space& intersection_location)
-{
+                           Arr_parameter_space& intersection_location) {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_compute_next_intersection(" << he->curve() << ", "
             << skip_first_point << ")" << std::endl;
@@ -591,7 +584,8 @@ _compute_next_intersection(Halfedge_handle he,
         if (is_closed(*icv, ARR_MIN_END)) {
           // The curve has a valid left point - make sure it lies to the
           // right of m_left_pt.
-          valid_intersection = (compare_xy(ctr_min(*icv), m_left_pt) != SMALLER);
+          valid_intersection =
+            (compare_xy(ctr_min(*icv), m_left_pt) != SMALLER);
         }
         // In this case the overlap is not valid.
         else valid_intersection = false;
@@ -670,8 +664,7 @@ _compute_next_intersection(Halfedge_handle he,
 //
 template <typename Arrangement, typename ZoneVisitor>
 void Arrangement_zone_2<Arrangement, ZoneVisitor>::
-_remove_next_intersection(Halfedge_handle he)
-{
+_remove_next_intersection(Halfedge_handle he) {
   // Get a pointer to the curve associated with the halfedge.
   const X_monotone_curve_2* p_curve = &(he->curve());
 
@@ -691,8 +684,7 @@ _remove_next_intersection(Halfedge_handle he)
 template <typename Arrangement, typename ZoneVisitor>
 bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
 _is_to_left_impl(const Point_2& p, Halfedge_handle he,
-                 Arr_not_all_sides_oblivious_tag) const
-{
+                 Arr_not_all_sides_oblivious_tag) const {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_is_to_left_impl(" << p << "," << he->curve() << ")"
             << std::endl;
@@ -723,13 +715,13 @@ _is_to_left_impl(const Point_2& p, Halfedge_handle he,
 }
 
 //-----------------------------------------------------------------------------
-// Determine whether a given point lies completely to the right of a given curve.
+// Determine whether a given point lies completely to the right of a given
+// curve.
 //
 template <typename Arrangement, typename ZoneVisitor>
 bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
 _is_to_right_impl(const Point_2& p, Halfedge_handle he,
-                  Arr_not_all_sides_oblivious_tag) const
-{
+                  Arr_not_all_sides_oblivious_tag) const {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_is_to_right_impl(" << p << "," << he->curve() << ")"
             << std::endl;
@@ -767,8 +759,7 @@ _is_to_right_impl(const Point_2& p, Halfedge_handle he,
 template <typename Arrangement, typename ZoneVisitor>
 void Arrangement_zone_2<Arrangement, ZoneVisitor>::
 _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
-                       Arr_parameter_space& leftmost_location)
-{
+                       Arr_parameter_space& leftmost_location) {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_leftmost_intersection(" << he_curr->curve() << ", "
             << on_boundary << ")" << std::endl;
@@ -880,8 +871,7 @@ _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
 //
 template <typename Arrangement, typename ZoneVisitor>
 void Arrangement_zone_2<Arrangement, ZoneVisitor>::
-_leftmost_intersection_with_face_boundary(Face_handle face, bool on_boundary)
-{
+_leftmost_intersection_with_face_boundary(Face_handle face, bool on_boundary) {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_leftmost_intersection_with_face_boundary(" << on_boundary
             << ")" << std::endl;
@@ -899,8 +889,7 @@ _leftmost_intersection_with_face_boundary(Face_handle face, bool on_boundary)
 
   // Traverse the face outer-boundaries; iterate through all outer CCBs.
   for (auto occb_it = face->outer_ccbs_begin();
-       occb_it != face->outer_ccbs_end(); ++occb_it)
-  {
+       occb_it != face->outer_ccbs_end(); ++occb_it) {
     Ccb_halfedge_circulator he_first = *occb_it;
     Ccb_halfedge_circulator he_curr = he_first;
     do _leftmost_intersection(he_curr, on_boundary, leftmost_location);
@@ -909,8 +898,7 @@ _leftmost_intersection_with_face_boundary(Face_handle face, bool on_boundary)
 
   // Traverse the face inner-boundaries; iterate through all inner CCBs (holes).
   for (auto iccb_it = face->inner_ccbs_begin();
-       iccb_it != face->inner_ccbs_end(); ++iccb_it)
-  {
+       iccb_it != face->inner_ccbs_end(); ++iccb_it) {
     Ccb_halfedge_circulator he_first = *iccb_it;
     Ccb_halfedge_circulator he_curr = he_first;
     do _leftmost_intersection(he_curr, on_boundary, leftmost_location);
@@ -921,17 +909,15 @@ _leftmost_intersection_with_face_boundary(Face_handle face, bool on_boundary)
 
   // Traverse the isolated vertices inside the face (if there exist any), and
   // check whether an isolated vertex lies on the curve.
-  typedef typename Arrangement_2::Isolated_vertex_iterator
-    Isolated_vertex_iterator;
-  for (Isolated_vertex_iterator iv_it = face->isolated_vertices_begin();
-       iv_it != face->isolated_vertices_end(); ++iv_it)
-  {
+  for (auto iv_it = face->isolated_vertices_begin();
+       iv_it != face->isolated_vertices_end(); ++iv_it) {
     // If the isolated vertex is not in the x-range of our curve, disregard it.
     if (! is_in_x_range(m_cv, iv_it->point())) continue;
 
     // If we already have an intersection point, compare it to the current
     // isolated vertex, in order to filter unnecessary computations.
-    if (m_found_intersect && compare_xy(iv_it->point(), m_intersect_p) == LARGER)
+    if (m_found_intersect &&
+        (compare_xy(iv_it->point(), m_intersect_p) == LARGER))
       continue;
 
     // In case the isolated vertex lies on the curve, update the intersection
@@ -960,8 +946,7 @@ _leftmost_intersection_with_face_boundary(Face_handle face, bool on_boundary)
 //
 template <typename Arrangement, typename ZoneVisitor>
 bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
-_zone_in_face(Face_handle face, bool on_boundary)
-{
+_zone_in_face(Face_handle face, bool on_boundary) {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_zone_in_face(" << on_boundary << ")" << std::endl;
 #endif
@@ -1190,8 +1175,7 @@ _zone_in_face(Face_handle face, bool on_boundary)
 // curve currently associated with m_intersect_he.
 //
 template <typename Arrangement, typename ZoneVisitor>
-bool Arrangement_zone_2<Arrangement, ZoneVisitor>::_zone_in_overlap()
-{
+bool Arrangement_zone_2<Arrangement, ZoneVisitor>::_zone_in_overlap() {
 #if defined(ARR_ZONE_VERBOSE)
   std::cout << "_zone_in_overlap()" << std::endl;
 #endif

From ada39fdfaedc8847ea689b54dbc382c145692abb Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 9 Aug 2023 19:10:16 +0300
Subject: [PATCH 0600/1398] Cleaned up and dispatched
 is_intersection_valid_impl() properly

---
 .../Arrangement_2/Arrangement_zone_2_impl.h   |  50 +++++++--
 .../include/CGAL/Arrangement_zone_2.h         | 104 +++++++++---------
 2 files changed, 96 insertions(+), 58 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
index 054724aa6e4f..6903b44429a0 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
@@ -504,14 +504,46 @@ template <typename Arrangement, typename ZoneVisitor>
 bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
 is_intersection_valid_impl(const Point_2& ip,
                            Arr_parameter_space& /* intersection_location */,
-                           Arr_all_sides_oblivious_tag) const
+                           Arr_boundary_cond_tag) const
 { return (m_geom_traits->compare_xy_2_object()(ip, m_left_pt) == LARGER); }
 
 template <typename Arrangement, typename ZoneVisitor>
 bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
 is_intersection_valid_impl(const Point_2& ip,
                            Arr_parameter_space& intersection_location,
-                           Arr_not_all_sides_oblivious_tag) const {
+                           Arr_has_identified_side_tag) const {
+  auto equal = m_geom_traits->equal_2_object();
+  auto is_on_y_ident = m_geom_traits->is_on_y_identification_2_object();
+  // Case 1: the curve lies on the y-identification
+  if (is_on_y_ident(m_cv)) {
+    if (equal(ip, m_left_pt)) return false;
+    // We set the location to be on the left as a convention
+    intersection_location = ARR_LEFT_BOUNDARY;
+    return true;
+  }
+
+  // Case 2: The left-end lies on the left boundary
+  // (It cannot lie on the right boundary)
+  // If the intersection point is not equal to the left-end, it must lie to
+  // its right; thus valid.
+  if (m_left_on_boundary) return ! equal(ip, m_left_pt);
+
+  // Case 3: The right-end lies on the right boundary
+  if (m_right_on_boundary && equal(ip, m_right_pt)) {
+    intersection_location = ARR_RIGHT_BOUNDARY;
+    return true;
+  }
+
+  // We have a simple intersection point;
+  // make sure it lies to the right of m_left_pt.
+  return (m_geom_traits->compare_xy_2_object()(ip, m_left_pt) == LARGER);
+}
+
+template <typename Arrangement, typename ZoneVisitor>
+bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
+is_intersection_valid_impl(const Point_2& ip,
+                           Arr_parameter_space& intersection_location,
+                           Arr_has_open_side_tag) const {
   auto equal = m_geom_traits->equal_2_object();
   if (m_left_on_boundary) {
     // The left-end lies on the left boundary. If the intersection point is not
@@ -699,12 +731,12 @@ _is_to_left_impl(const Point_2& p, Halfedge_handle he,
   if (ps_x_min == ARR_LEFT_BOUNDARY) return false;
 
   auto ps_in_y = m_geom_traits->parameter_space_in_y_2_object();
-  auto ps_y = ps_in_y(he->curve(), ARR_MIN_END);
-  if (ps_y != ARR_INTERIOR) {
+  auto ps_y_min = ps_in_y(he->curve(), ARR_MIN_END);
+  if (ps_y_min != ARR_INTERIOR) {
     // Check if p is to the left of the minimal curve-end:
     auto cmp_x = m_geom_traits->compare_x_point_curve_end_2_object();
     const auto res = cmp_x(p, he->curve(), ARR_MIN_END);
-    return ((res == SMALLER) || (res == EQUAL && ps_y == ARR_TOP_BOUNDARY));
+    return ((res == SMALLER) || (res == EQUAL && ps_y_min == ARR_TOP_BOUNDARY));
   }
 
   // In case the minimal curve-end does not have boundary conditions, simply
@@ -738,12 +770,12 @@ _is_to_right_impl(const Point_2& p, Halfedge_handle he,
   if (ps_x_max == ARR_LEFT_BOUNDARY) return true;
 
   auto ps_in_y = m_geom_traits->parameter_space_in_y_2_object();
-  auto ps_y = ps_in_y(he->curve(), ARR_MAX_END);
-  if (ps_y != ARR_INTERIOR) {
+  auto ps_y_max = ps_in_y(he->curve(), ARR_MAX_END);
+  if (ps_y_max != ARR_INTERIOR) {
     // Check if p is to the right of the maximal curve-end:
     auto cmp_x = m_geom_traits->compare_x_point_curve_end_2_object();
     auto res = cmp_x(p, he->curve(), ARR_MAX_END);
-    return ((res == LARGER) || (res == EQUAL && ps_y == ARR_BOTTOM_BOUNDARY));
+    return ((res == LARGER) || (res == EQUAL && ps_y_max == ARR_BOTTOM_BOUNDARY));
   }
 
   // In case the maximal curve-end does not have boundary conditions, simply
@@ -783,7 +815,7 @@ _leftmost_intersection(Ccb_halfedge_circulator he_curr, bool on_boundary,
   // entirely to the right of m_intersect_p, its intersection with m_cv (if any)
   // cannot lie to the left of this point. We therefore do not need to compute
   // this intersection.
-  if (m_found_intersect && (leftmost_location != ARR_RIGHT_BOUNDARY) &&
+  if (m_found_intersect && (leftmost_location == ARR_INTERIOR) &&
       _is_to_left(m_intersect_p, he_curr))
     return;
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
index 71b5e4a74092..5d22e410109f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
@@ -55,65 +55,70 @@ namespace CGAL {
 template <typename Arrangement_, typename ZoneVisitor_>
 class Arrangement_zone_2 {
 public:
-  typedef Arrangement_                                   Arrangement_2;
-  typedef typename Arrangement_2::Geometry_traits_2      Geometry_traits_2;
-  typedef typename Arrangement_2::Topology_traits        Topology_traits;
+  using Arrangement_2 = Arrangement_;
+  using Geometry_traits_2 = typename Arrangement_2::Geometry_traits_2;
+  using Topology_traits = typename Arrangement_2::Topology_traits;
 
 protected:
-  typedef Arr_traits_adaptor_2<Geometry_traits_2>        Traits_adaptor_2;
+  using Traits_adaptor_2 = Arr_traits_adaptor_2<Geometry_traits_2>;
 
-  typedef typename Traits_adaptor_2::Left_side_category   Left_side_category;
-  typedef typename Traits_adaptor_2::Bottom_side_category Bottom_side_category;
-  typedef typename Traits_adaptor_2::Top_side_category    Top_side_category;
-  typedef typename Traits_adaptor_2::Right_side_category  Right_side_category;
+  using Left_side_category = typename Traits_adaptor_2::Left_side_category;
+  using Bottom_side_category = typename Traits_adaptor_2::Bottom_side_category;
+  using Top_side_category = typename Traits_adaptor_2::Top_side_category;
+  using Right_side_category = typename Traits_adaptor_2::Right_side_category;
 
   static_assert(Arr_sane_identified_tagging<Left_side_category,
-                                                    Bottom_side_category,
+                                            Bottom_side_category,
                                                     Top_side_category,
                                                     Right_side_category>::value);
+  // Categories for dispatching
+  using Are_all_sides_oblivious_category =
+    typename Arr_all_sides_oblivious_category<Left_side_category,
+                                              Bottom_side_category,
+                                              Top_side_category,
+                                              Right_side_category>::result;
+
+  using Left_or_right_sides_category =
+    typename Arr_two_sides_category<Left_side_category,
+                                    Right_side_category>::result;
 
 public:
-  typedef ZoneVisitor_                                   Visitor;
+  using Visitor = ZoneVisitor_;
 
-  typedef typename Arrangement_2::Vertex_handle          Vertex_handle;
-  typedef typename Arrangement_2::Halfedge_handle        Halfedge_handle;
-  typedef typename Arrangement_2::Face_handle            Face_handle;
+  using Vertex_handle = typename Arrangement_2::Vertex_handle;
+  using Halfedge_handle = typename Arrangement_2::Halfedge_handle;
+  using Face_handle = typename Arrangement_2::Face_handle;
 
-  typedef std::pair<Halfedge_handle, bool>               Visitor_result;
+  using Visitor_result = std::pair<Halfedge_handle, bool>;
 
-  typedef typename Geometry_traits_2::Point_2            Point_2;
-  typedef typename Geometry_traits_2::X_monotone_curve_2 X_monotone_curve_2;
-  typedef typename Geometry_traits_2::Multiplicity       Multiplicity;
+  using Point_2 = typename Geometry_traits_2::Point_2;
+  using X_monotone_curve_2 = typename Geometry_traits_2::X_monotone_curve_2;
+  using Multiplicity = typename Geometry_traits_2::Multiplicity;
 
 protected:
-  typedef typename Arr_all_sides_oblivious_category<Left_side_category,
-                                                    Bottom_side_category,
-                                                    Top_side_category,
-                                                    Right_side_category>::result
-    Are_all_sides_oblivious_category;
-
-  typedef typename Arrangement_2::Vertex_const_handle   Vertex_const_handle;
-  typedef typename Arrangement_2::Halfedge_const_handle Halfedge_const_handle;
-  typedef typename Arrangement_2::Face_const_handle     Face_const_handle;
+  // General types
+  using Vertex_const_handle = typename Arrangement_2::Vertex_const_handle;
+  using Halfedge_const_handle = typename Arrangement_2::Halfedge_const_handle;
+  using Face_const_handle = typename Arrangement_2::Face_const_handle;
 
-  typedef typename Arrangement_2::Ccb_halfedge_circulator
-    Ccb_halfedge_circulator;
+  using Ccb_halfedge_circulator =
+    typename Arrangement_2::Ccb_halfedge_circulator;
 
   // Types used for caching intersection points:
-  typedef std::pair<Point_2, Multiplicity>              Intersection_point;
-  typedef boost::variant<Intersection_point, X_monotone_curve_2>
-                                                        Intersection_result;
-  typedef boost::optional<Intersection_result>          Optional_intersection;
-  typedef std::list<Intersection_result>                Intersect_list;
-  typedef std::map<const X_monotone_curve_2*, Intersect_list>
-                                                        Intersect_map;
-  typedef typename Intersect_map::iterator              Intersect_map_iterator;
+  using Intersection_point = std::pair<Point_2, Multiplicity>;
+  using Intersection_result =
+    boost::variant<Intersection_point, X_monotone_curve_2>;
+  using Optional_intersection = boost::optional<Intersection_result>;
+  using Intersect_list = std::list<Intersection_result>;
+  using Intersect_map =
+    std::map<const X_monotone_curve_2*, Intersect_list>;
+  using Intersect_map_iterator = typename Intersect_map::iterator;
 
-  typedef std::set<const X_monotone_curve_2*>           Curves_set;
-  typedef typename Curves_set::iterator                 Curves_set_iterator;
+  using Curves_set = std::set<const X_monotone_curve_2*>;
+  using Curves_set_iterator = typename Curves_set::iterator;
 
-  typedef Arr_point_location_result<Arrangement_2>      Pl_result;
-  typedef typename Pl_result::Type                      Pl_result_type;
+  using Pl_result = Arr_point_location_result<Arrangement_2>;
+  using Pl_result_type = typename Pl_result::Type;
 
   // Data members:
   Arrangement_2& m_arr;                 // The associated arrangement.
@@ -193,8 +198,7 @@ class Arrangement_zone_2 {
    * \param pl A point-location object associated with the arrangement.
    */
   template <typename PointLocation>
-  void init(const X_monotone_curve_2& cv, const PointLocation& pl)
-  {
+  void init(const X_monotone_curve_2& cv, const PointLocation& pl) {
     // Set the curve and check whether its left end has boundary conditions.
     m_cv = cv;
 
@@ -267,8 +271,7 @@ class Arrangement_zone_2 {
    */
   bool do_overlap_impl(const X_monotone_curve_2& cv1,
                        const X_monotone_curve_2& cv2,
-                       const Point_2& p, Arr_all_sides_oblivious_tag) const
-  {
+                       const Point_2& p, Arr_all_sides_oblivious_tag) const {
     return m_geom_traits->compare_y_at_x_right_2_object()(cv1, cv2, p) == EQUAL;
   }
 
@@ -381,8 +384,7 @@ class Arrangement_zone_2 {
   { return (_is_to_right_impl(p, he, Are_all_sides_oblivious_category())); }
 
   bool _is_to_right_impl(const Point_2& p, Halfedge_handle he,
-                         Arr_all_sides_oblivious_tag) const
-  {
+                         Arr_all_sides_oblivious_tag) const {
     return (((he->direction() == ARR_LEFT_TO_RIGHT) &&
              m_geom_traits->compare_xy_2_object()(p, he->target()->point()) ==
              LARGER) ||
@@ -400,16 +402,20 @@ class Arrangement_zone_2 {
   bool is_intersection_valid(const Point_2& ip,
                              Arr_parameter_space& intersection_location) const {
     return is_intersection_valid_impl(ip, intersection_location,
-                                      Are_all_sides_oblivious_category());
+                                      Left_or_right_sides_category());
   }
 
   bool is_intersection_valid_impl(const Point_2& ip,
                                   Arr_parameter_space& intersection_location,
-                                  Arr_all_sides_oblivious_tag) const;
+                                  Arr_boundary_cond_tag) const;
+
+  bool is_intersection_valid_impl(const Point_2& ip,
+                                  Arr_parameter_space& intersection_location,
+                                  Arr_has_identified_side_tag) const;
 
   bool is_intersection_valid_impl(const Point_2& ip,
                                   Arr_parameter_space& intersection_location,
-                                  Arr_not_all_sides_oblivious_tag) const;
+                                  Arr_has_open_side_tag) const;
 
   /*! Compute the (lexicographically) leftmost intersection of the query
    * curve with a given halfedge on the boundary of a face in the arrangement.

From 2549f47191a4104e45b20052973a72aa95fb4f4e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 10 Aug 2023 17:27:29 +0200
Subject: [PATCH 0601/1398] fix other warnings

---
 .../test/Barycentric_coordinates_2/test_sc_deprecated_api.cpp   | 2 +-
 .../test/Barycentric_coordinates_2/test_tc_deprecated_api.cpp   | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_sc_deprecated_api.cpp b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_sc_deprecated_api.cpp
index 9b39a907f43b..90ec34747390 100644
--- a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_sc_deprecated_api.cpp
+++ b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_sc_deprecated_api.cpp
@@ -44,7 +44,7 @@ int main()
 
   int count = 0;
   for (int i = 0; i < 6; ++i) {
-    const Output_type result = segment_coordinates(query_points[i], std::back_inserter(old_coordinates));
+    segment_coordinates(query_points[i], std::back_inserter(old_coordinates));
     CGAL::Barycentric_coordinates::segment_coordinates_2(
       first_vertex, second_vertex, query_points[i], std::back_inserter(new_coordinates));
 
diff --git a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_tc_deprecated_api.cpp b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_tc_deprecated_api.cpp
index bd83f52a5bd9..58506a5cec07 100644
--- a/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_tc_deprecated_api.cpp
+++ b/Barycentric_coordinates_2/test/Barycentric_coordinates_2/test_tc_deprecated_api.cpp
@@ -43,7 +43,7 @@ int main()
 
   int count = 0;
   for (int i = 0; i < 5; ++i) {
-    const Output_type result = triangle_coordinates(query_points[i], std::back_inserter(old_coordinates));
+    triangle_coordinates(query_points[i], std::back_inserter(old_coordinates));
     CGAL::Barycentric_coordinates::triangle_coordinates_2(
       first_vertex, second_vertex, third_vertex, query_points[i], std::back_inserter(new_coordinates));
 

From 0762a3040051bc0eb4fa611e20e1cfd57302321f Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Thu, 10 Aug 2023 21:38:52 +0300
Subject: [PATCH 0602/1398] Fixed is_intersection_valid_impl() and added test
 case

---
 .../Arrangement_2/Arrangement_zone_2_impl.h     | 11 ++++++++---
 .../include/CGAL/Arrangement_zone_2.h           |  4 ++--
 .../geodesic_arcs_on_sphere/test40.txt          | 17 +++++++++++++++++
 ...est_construction.geodesic_arcs_on_sphere.cmd |  1 +
 4 files changed, 28 insertions(+), 5 deletions(-)
 create mode 100644 Arrangement_on_surface_2/test/Arrangement_on_surface_2/data/test_construction/geodesic_arcs_on_sphere/test40.txt

diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
index 6903b44429a0..222f869444a8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
@@ -499,14 +499,15 @@ _direct_intersecting_edge_to_left(const X_monotone_curve_2& cv_ins,
   }
 }
 
-//-----------------------------------------------------------------------------
+//! Implementation for no boundary conditions.
 template <typename Arrangement, typename ZoneVisitor>
 bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
 is_intersection_valid_impl(const Point_2& ip,
                            Arr_parameter_space& /* intersection_location */,
-                           Arr_boundary_cond_tag) const
+                           Arr_all_sides_oblivious_tag) const
 { return (m_geom_traits->compare_xy_2_object()(ip, m_left_pt) == LARGER); }
 
+//! Implementation for left and right identified boundaries.
 template <typename Arrangement, typename ZoneVisitor>
 bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
 is_intersection_valid_impl(const Point_2& ip,
@@ -539,11 +540,15 @@ is_intersection_valid_impl(const Point_2& ip,
   return (m_geom_traits->compare_xy_2_object()(ip, m_left_pt) == LARGER);
 }
 
+/*! Implementation for all the rest.
+ * It would be better to split into the various cases, which is the cartesian
+ * product of (contructed, closed, open) X (contructed, closed, open)
+ */
 template <typename Arrangement, typename ZoneVisitor>
 bool Arrangement_zone_2<Arrangement, ZoneVisitor>::
 is_intersection_valid_impl(const Point_2& ip,
                            Arr_parameter_space& intersection_location,
-                           Arr_has_open_side_tag) const {
+                           Arr_boundary_cond_tag) const {
   auto equal = m_geom_traits->equal_2_object();
   if (m_left_on_boundary) {
     // The left-end lies on the left boundary. If the intersection point is not
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
index 5d22e410109f..2a5db1727c3e 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_zone_2.h
@@ -407,7 +407,7 @@ class Arrangement_zone_2 {
 
   bool is_intersection_valid_impl(const Point_2& ip,
                                   Arr_parameter_space& intersection_location,
-                                  Arr_boundary_cond_tag) const;
+                                  Arr_all_sides_oblivious_tag) const;
 
   bool is_intersection_valid_impl(const Point_2& ip,
                                   Arr_parameter_space& intersection_location,
@@ -415,7 +415,7 @@ class Arrangement_zone_2 {
 
   bool is_intersection_valid_impl(const Point_2& ip,
                                   Arr_parameter_space& intersection_location,
-                                  Arr_has_open_side_tag) const;
+                                  Arr_boundary_cond_tag) const;
 
   /*! Compute the (lexicographically) leftmost intersection of the query
    * curve with a given halfedge on the boundary of a face in the arrangement.
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/data/test_construction/geodesic_arcs_on_sphere/test40.txt b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/data/test_construction/geodesic_arcs_on_sphere/test40.txt
new file mode 100644
index 000000000000..adccf6ecad93
--- /dev/null
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/data/test_construction/geodesic_arcs_on_sphere/test40.txt
@@ -0,0 +1,17 @@
+5
+0 -1 0 0 0 -1 0
+0 0 -1 0 0 0 -1
+0 0 0 -1 0 1 0
+0 0 1 0 -1 0 0
+0 0 0 -1 -1 0 0
+0
+4 5 3
+0 0 -1
+-1 0 0
+0 -1 0
+0 1 0
+0  0  0 -1 -1  0  0 1
+0 -1  0  0  0 -1  0 1
+0  0 -1  0  0  0 -1 1
+0  0  0 -1  0  1  0 1
+0  0  1  0 -1  0  0 1
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_construction.geodesic_arcs_on_sphere.cmd b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_construction.geodesic_arcs_on_sphere.cmd
index 547aa5188647..d995644a0954 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_construction.geodesic_arcs_on_sphere.cmd
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_construction.geodesic_arcs_on_sphere.cmd
@@ -37,3 +37,4 @@ data/test_construction/geodesic_arcs_on_sphere/test36.txt
 data/test_construction/geodesic_arcs_on_sphere/test37.txt
 data/test_construction/geodesic_arcs_on_sphere/test38.txt
 data/test_construction/geodesic_arcs_on_sphere/test39.txt
+data/test_construction/geodesic_arcs_on_sphere/test40.txt

From 0ce82c0bd5a389b92f9ef1d9f6fea0544fa97442 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Sun, 13 Aug 2023 18:22:07 +0200
Subject: [PATCH 0603/1398] Better showing of `#include`

Getting a better (and consistent) output for the include file to be used with some functions.
Normally `#include` are sown as in a typewrite font, but the `#include` in these cases were shown in a code block way.
---
 .../PackageDescription.txt                    |  4 +-
 .../PackageDescription.txt                    |  4 +-
 .../PackageDescription.txt                    |  8 +--
 Nef_3/doc/Nef_3/PackageDescription.txt        |  4 +-
 .../PackageDescription.txt                    |  4 +-
 .../doc/Point_set_3/PackageDescription.txt    |  4 +-
 Polygon/doc/Polygon/PackageDescription.txt    |  8 +--
 .../doc/Polyhedron/PackageDescription.txt     |  4 +-
 .../doc/Surface_mesh/PackageDescription.txt   |  4 +-
 .../PackageDescription.txt                    |  4 +-
 .../Triangulation_2/PackageDescription.txt    |  4 +-
 .../Triangulation_3/PackageDescription.txt    |  4 +-
 .../Voronoi_diagram_2/PackageDescription.txt  |  4 +-
 Weights/doc/Weights/PackageDescription.txt    | 72 +++++--------------
 14 files changed, 33 insertions(+), 99 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
index 04ce3c47c289..a23221fc04fe 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
@@ -47,9 +47,7 @@ namespace ArrTraits {}
 /// \ingroup PkgArrangementOnSurface2Ref
 
 /*!
-  \code
-   #include <CGAL/draw_arrangement_2.h>
-  \endcode
+  `#include <CGAL/draw_arrangement_2.h>`
 */
 /// \defgroup PkgArrangementOnSurface2Draw Drawing
 /// \ingroup PkgArrangementOnSurface2Ref
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/PackageDescription.txt b/Boolean_set_operations_2/doc/Boolean_set_operations_2/PackageDescription.txt
index 7c3b7b13e71a..3050f0a5654e 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/PackageDescription.txt
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/PackageDescription.txt
@@ -7,9 +7,7 @@
 namespace ArrDirectionalTraits {}
 
 /*!
-  \code
-  #include <CGAL/draw_polygon_set_2.h>
-  \endcode
+  `#include <CGAL/draw_polygon_set_2.h>`
 */
 /// \defgroup PkgDrawPolygonSet2 Draw a 2D Polygon Set
 /// \ingroup PkgBooleanSetOperations2Ref
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/PackageDescription.txt b/Linear_cell_complex/doc/Linear_cell_complex/PackageDescription.txt
index d8cc1ad2fbd5..03264451c0c0 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/PackageDescription.txt
+++ b/Linear_cell_complex/doc/Linear_cell_complex/PackageDescription.txt
@@ -12,17 +12,13 @@
 /// \ingroup PkgLinearCellComplexRef
 
 /*! High-level operations.
-  \code
-   #include <CGAL/Linear_cell_complex_operations.h>
-   \endcode
+   `#include <CGAL/Linear_cell_complex_operations.h>`
 */
 /// \defgroup PkgLinearCellComplexOperations Operations for Linear Cell Complex
 /// \ingroup PkgLinearCellComplexRef
 
 /*!
-  \code
-   #include <CGAL/draw_linear_cell_complex.h>
-  \endcode
+   `#include <CGAL/draw_linear_cell_complex.h>`
 */
 /// \defgroup PkgDrawLinearCellComplex Draw a Linear Cell Complex
 /// \ingroup PkgLinearCellComplexRef
diff --git a/Nef_3/doc/Nef_3/PackageDescription.txt b/Nef_3/doc/Nef_3/PackageDescription.txt
index 7edd3f45d4b5..db62abd9bf7e 100644
--- a/Nef_3/doc/Nef_3/PackageDescription.txt
+++ b/Nef_3/doc/Nef_3/PackageDescription.txt
@@ -4,9 +4,7 @@
 /// \ingroup PkgNef3Ref
 
 /*! Draw.
-  \code
-  #include <CGAL/draw_nef_3.h>
-  \endcode
+  `#include <CGAL/draw_nef_3.h>`
 */
 /// \defgroup PkgDrawNef3 Draw a Nef Polyhedron
 /// \ingroup PkgNef3Ref
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt
index dcffaea8da8e..767fc2b01e05 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt
@@ -16,9 +16,7 @@
 /// \ingroup PkgPeriodic2Triangulation2Ref
 
 /*! Draw.
-  \code
-   #include <CGAL/draw_periodic_2_triangulation_2.h>
-  \endcode
+   `#include <CGAL/draw_periodic_2_triangulation_2.h>`
 */
 /// \defgroup PkgDrawPeriodic2Triangulation2 Draw a 2D Periodic Triangulation
 /// \ingroup PkgPeriodic2Triangulation2Ref
diff --git a/Point_set_3/doc/Point_set_3/PackageDescription.txt b/Point_set_3/doc/Point_set_3/PackageDescription.txt
index 271b13b4634a..c6d433e20bfe 100644
--- a/Point_set_3/doc/Point_set_3/PackageDescription.txt
+++ b/Point_set_3/doc/Point_set_3/PackageDescription.txt
@@ -1,9 +1,7 @@
 /// \defgroup PkgPointSet3Ref 3D Point Set Reference
 
 /*!
-  \code
-   #include <CGAL/draw_point_set_3.h>
-  \endcode
+   `#include <CGAL/draw_point_set_3.h>`
 */
 /// \defgroup PkgDrawPointSet3D Draw a 3D Point Set
 /// \ingroup PkgPointSet3Ref
diff --git a/Polygon/doc/Polygon/PackageDescription.txt b/Polygon/doc/Polygon/PackageDescription.txt
index 1d48e74493c8..fd7cd1f7e0cf 100644
--- a/Polygon/doc/Polygon/PackageDescription.txt
+++ b/Polygon/doc/Polygon/PackageDescription.txt
@@ -7,17 +7,13 @@
 /// \ingroup PkgPolygon2Ref
 
 /*!
-  \code
-   #include <CGAL/draw_polygon_2.h>
-  \endcode
+   `#include <CGAL/draw_polygon_2.h>`
 */
 /// \defgroup PkgDrawPolygon2 Draw a 2D Polygon
 /// \ingroup PkgPolygon2Ref
 
 /*!
-  \code
-  #include <CGAL/draw_polygon_with_holes_2.h>
-  \endcode
+  `#include <CGAL/draw_polygon_with_holes_2.h>`
 */
 /// \defgroup PkgDrawPolygonWithHoles2 Draw a 2D Polygon with Holes
 /// \ingroup PkgPolygon2Ref
diff --git a/Polyhedron/doc/Polyhedron/PackageDescription.txt b/Polyhedron/doc/Polyhedron/PackageDescription.txt
index 827683c79181..12ee7940d944 100644
--- a/Polyhedron/doc/Polyhedron/PackageDescription.txt
+++ b/Polyhedron/doc/Polyhedron/PackageDescription.txt
@@ -6,9 +6,7 @@
 /// \ingroup PkgPolyhedronRef
 
 /*!
-  \code
-   #include <CGAL/draw_polyhedron.h>
-  \endcode
+   `#include <CGAL/draw_polyhedron.h>`
 */
 /// \defgroup PkgDrawPolyhedron Draw a Polyhedron 3
 /// \ingroup PkgPolyhedronRef
diff --git a/Surface_mesh/doc/Surface_mesh/PackageDescription.txt b/Surface_mesh/doc/Surface_mesh/PackageDescription.txt
index 974c86b9f544..4278f42d86cc 100644
--- a/Surface_mesh/doc/Surface_mesh/PackageDescription.txt
+++ b/Surface_mesh/doc/Surface_mesh/PackageDescription.txt
@@ -1,9 +1,7 @@
 /// \defgroup PkgSurface_mesh Surface Mesh Reference
 
 /*!
-  \code
-   #include <CGAL/draw_surface_mesh.h>
-  \endcode
+   `#include <CGAL/draw_surface_mesh.h>`
 */
 /// \defgroup PkgDrawSurfaceMesh Draw a Surface Mesh
 /// \ingroup PkgSurface_mesh
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt b/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt
index 408283838941..7087216cd1a9 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt
@@ -7,9 +7,7 @@
 /// \ingroup PkgSurfaceMeshTopologyRef
 
 /*!
-  \code
-   #include <CGAL/draw_face_graph_with_paths.h>
-  \endcode
+   `#include <CGAL/draw_face_graph_with_paths.h>`
 */
 /// \defgroup PkgDrawFaceGraphWithPaths Draw a Mesh with Paths
 /// \ingroup PkgSurfaceMeshTopologyRef
diff --git a/Triangulation_2/doc/Triangulation_2/PackageDescription.txt b/Triangulation_2/doc/Triangulation_2/PackageDescription.txt
index 65b8c9137e4b..f9e1d3a2c047 100644
--- a/Triangulation_2/doc/Triangulation_2/PackageDescription.txt
+++ b/Triangulation_2/doc/Triangulation_2/PackageDescription.txt
@@ -14,9 +14,7 @@
 /// \ingroup PkgTriangulation2Ref
 
 /*!
-  \code
-   #include <CGAL/draw_triangulation_2.h>
-  \endcode
+   `#include <CGAL/draw_triangulation_2.h>`
 */
 /// \defgroup PkgDrawTriangulation2 Draw a Triangulation 2
 /// \ingroup PkgTriangulation2Ref
diff --git a/Triangulation_3/doc/Triangulation_3/PackageDescription.txt b/Triangulation_3/doc/Triangulation_3/PackageDescription.txt
index 6e12268a1798..b1bbaf9f3aca 100644
--- a/Triangulation_3/doc/Triangulation_3/PackageDescription.txt
+++ b/Triangulation_3/doc/Triangulation_3/PackageDescription.txt
@@ -13,9 +13,7 @@
 /// \ingroup PkgTriangulation3Ref
 
 /*!
-  \code
-   #include <CGAL/draw_triangulation_3.h>
-  \endcode
+   `#include <CGAL/draw_triangulation_3.h>`
 */
 /// \defgroup PkgDrawTriangulation3 Draw a Triangulation 3
 /// \ingroup PkgTriangulation3Ref
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/PackageDescription.txt b/Voronoi_diagram_2/doc/Voronoi_diagram_2/PackageDescription.txt
index d888fa4473ae..dc6ca27d40ae 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/PackageDescription.txt
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/PackageDescription.txt
@@ -13,9 +13,7 @@
 /// \ingroup PkgVoronoiDiagram2Ref
 
 /*!
-  \code
-  #include <CGAL/draw_voronoi_diagram_2.h>
-  \endcode
+  `#include <CGAL/draw_voronoi_diagram_2.h>`
 */
 /// \defgroup PkgDrawVoronoiDiagram2 Draw a 2D Voronoi Diagram
 /// \ingroup PkgVoronoiDiagram2Ref
diff --git a/Weights/doc/Weights/PackageDescription.txt b/Weights/doc/Weights/PackageDescription.txt
index b59f3e06d683..eb5f9bf451c6 100644
--- a/Weights/doc/Weights/PackageDescription.txt
+++ b/Weights/doc/Weights/PackageDescription.txt
@@ -19,9 +19,7 @@ Models and functions that can be used to compute weights which have a simple ana
 \defgroup PkgWeightsRefUniformWeights Uniform Weight
 \ingroup PkgWeightsRefAnalytic
 
-\verbatim
-#include <CGAL/Weights/uniform_weights.h>
-\endverbatim
+`#include <CGAL/Weights/uniform_weights.h>`
 
 This weight is always equal to 1.
 
@@ -35,9 +33,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefShepardWeights Shepard Weight
 \ingroup PkgWeightsRefAnalytic
 
-\verbatim
-#include <CGAL/Weights/shepard_weights.h>
-\endverbatim
+`#include <CGAL/Weights/shepard_weights.h>`
 
 This weight is computed as
 \f$w = \frac{1}{d^a}\f$
@@ -65,9 +61,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefInverseDistanceWeights Inverse Distance Weight
 \ingroup PkgWeightsRefAnalytic
 
-\verbatim
-#include <CGAL/Weights/inverse_distance_weights.h>
-\endverbatim
+`#include <CGAL/Weights/inverse_distance_weights.h>`
 
 This weight is computed as
 \f$w = \frac{1}{d}\f$
@@ -96,9 +90,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefThreePointFamilyWeights Three Point Family Weight
 \ingroup PkgWeightsRefAnalytic
 
-\verbatim
-#include <CGAL/Weights/three_point_family_weights.h>
-\endverbatim
+`#include <CGAL/Weights/three_point_family_weights.h>`
 
 This weight is computed as
 \f$w = \frac{d_2^a A_0 - d^a B + d_0^a A_2}{A_0 A_2}\f$
@@ -137,9 +129,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefWachspressWeights Wachspress Weight
 \ingroup PkgWeightsRefAnalytic
 
-\verbatim
-#include <CGAL/Weights/wachspress_weights.h>
-\endverbatim
+`#include <CGAL/Weights/wachspress_weights.h>`
 
 This weight is computed as
 \f$w = \frac{C}{A_0 A_2}\f$
@@ -170,9 +160,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefAuthalicWeights Authalic Weight
 \ingroup PkgWeightsRefAnalytic
 
-\verbatim
-#include <CGAL/Weights/authalic_weights.h>
-\endverbatim
+`#include <CGAL/Weights/authalic_weights.h>`
 
 This weight is computed as
 \f$w = 2 \frac{\cot\beta + \cot\gamma}{d^2}\f$
@@ -202,9 +190,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefMeanValueWeights Mean Value Weight
 \ingroup PkgWeightsRefAnalytic
 
-\verbatim
-#include <CGAL/Weights/mean_value_weights.h>
-\endverbatim
+`#include <CGAL/Weights/mean_value_weights.h>`
 
 This weight is computed as
 \f$w = \pm 2 \sqrt{\frac{2 (d_0 d_2 - D)}{(d d_0 + D_0)(d d_2 + D_2)}}\f$
@@ -241,9 +227,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefTangentWeights Tangent Weight
 \ingroup PkgWeightsRefAnalytic
 
-\verbatim
-#include <CGAL/Weights/tangent_weights.h>
-\endverbatim
+`#include <CGAL/Weights/tangent_weights.h>`
 
 This weight is computed as
 \f$w = 2 \frac{t_1 + t_2}{d}\f$, where
@@ -278,9 +262,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefDiscreteHarmonicWeights Discrete Harmonic Weight
 \ingroup PkgWeightsRefAnalytic
 
-\verbatim
-#include <CGAL/Weights/discrete_harmonic_weights.h>
-\endverbatim
+`#include <CGAL/Weights/discrete_harmonic_weights.h>`
 
 This weight is computed as
 \f$w = \frac{d_2^2 A_0 - d^2 B + d_0^2 A_2}{A_0 A_2}\f$
@@ -311,9 +293,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefCotangentWeights Cotangent Weight
 \ingroup PkgWeightsRefAnalytic
 
-\verbatim
-#include <CGAL/Weights/cotangent_weights.h>
-\endverbatim
+`#include <CGAL/Weights/cotangent_weights.h>`
 
 This weight is computed as
 \f$w = 2 (\cot\beta + \cot\gamma)\f$
@@ -348,9 +328,7 @@ to polygons. These weights are then normalized in order to obtain barycentric co
 \defgroup PkgWeightsRefBarycentricWachspressWeights Wachspress Weights
 \ingroup PkgWeightsRefBarycentric
 
-\verbatim
-#include <CGAL/Weights/wachspress_weights.h>
-\endverbatim
+`#include <CGAL/Weights/wachspress_weights.h>`
 
 Wachspress weights which can be computed for a query point with respect to the
 vertices of a strictly convex polygon.
@@ -361,9 +339,7 @@ vertices of a strictly convex polygon.
 \defgroup PkgWeightsRefBarycentricMeanValueWeights Mean Value Weights
 \ingroup PkgWeightsRefBarycentric
 
-\verbatim
-#include <CGAL/Weights/mean_value_weights.h>
-\endverbatim
+`#include <CGAL/Weights/mean_value_weights.h>`
 
 Mean value weights which can be computed for a query point with respect to the
 vertices of a simple polygon.
@@ -374,9 +350,7 @@ vertices of a simple polygon.
 \defgroup PkgWeightsRefBarycentricDiscreteHarmonicWeights Discrete Harmonic Weights
 \ingroup PkgWeightsRefBarycentric
 
-\verbatim
-#include <CGAL/Weights/discrete_harmonic_weights.h>
-\endverbatim
+`#include <CGAL/Weights/discrete_harmonic_weights.h>`
 
 Discrete Harmonic weights which can be computed for a query point with respect to the
 vertices of a strictly convex polygon.
@@ -394,9 +368,7 @@ used to balance other weights.
 \defgroup PkgWeightsRefUniformRegionWeights Uniform Region Weight
 \ingroup PkgWeightsRefRegions
 
-\verbatim
-#include <CGAL/Weights/uniform_region_weights.h>
-\endverbatim
+`#include <CGAL/Weights/uniform_region_weights.h>`
 
 This weight is always equal to 1.
 
@@ -410,9 +382,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefTriangularRegionWeights Triangular Region Weight
 \ingroup PkgWeightsRefRegions
 
-\verbatim
-#include <CGAL/Weights/triangular_region_weights.h>
-\endverbatim
+`#include <CGAL/Weights/triangular_region_weights.h>`
 
 This weight is the area of the shaded region in the figure below. The region is
 the triangle `[p, q, r]`.
@@ -431,9 +401,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefBarycentricRegionWeights Barycentric Region Weight
 \ingroup PkgWeightsRefRegions
 
-\verbatim
-#include <CGAL/Weights/barycentric_region_weights.h>
-\endverbatim
+`#include <CGAL/Weights/barycentric_region_weights.h>`
 
 This weight is the area of the shaded region in the figure below. The region
 is formed by the two midpoints of the edges incident to `q` and the barycenter of
@@ -453,9 +421,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefVoronoiRegionWeights Voronoi Region Weight
 \ingroup PkgWeightsRefRegions
 
-\verbatim
-#include <CGAL/Weights/voronoi_region_weights.h>
-\endverbatim
+`#include <CGAL/Weights/voronoi_region_weights.h>`
 
 This weight is the area of the shaded region in the figure below. The region
 is formed by the two midpoints of the edges incident to `q` and the circumcenter of
@@ -477,9 +443,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefMixedVoronoiRegionWeights Mixed Voronoi Region Weight
 \ingroup PkgWeightsRefRegions
 
-\verbatim
-#include <CGAL/Weights/mixed_voronoi_region_weights.h>
-\endverbatim
+`#include <CGAL/Weights/mixed_voronoi_region_weights.h>`
 
 This weight is the area of the shaded region in the figure below. The region
 is formed by the two midpoints of the edges incident to `q` and the circumcenter of

From 5db243629a35d535b6bec49990680fd813957a5c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 14 Aug 2023 14:02:39 +0200
Subject: [PATCH 0604/1398] try working around an error with MSVC2017

`error C2338: Sorry: std::any doesn't support over-aligned types at this time.`
---
 STL_Extension/include/CGAL/Object.h | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/STL_Extension/include/CGAL/Object.h b/STL_Extension/include/CGAL/Object.h
index 8a3ed24dad50..765b5e70e3f3 100644
--- a/STL_Extension/include/CGAL/Object.h
+++ b/STL_Extension/include/CGAL/Object.h
@@ -29,20 +29,20 @@
 
 #include <variant>
 #include <optional>
-#include <any>
+#include <boost/any.hpp>
 #include <memory>
 
 namespace CGAL {
 
 class Object
 {
-    std::shared_ptr<std::any> obj;
+    std::shared_ptr<boost::any> obj;
 
     // returns an any pointer from a variant
     struct Any_from_variant {
       template<typename T>
-      std::any* operator()(const T& t) const {
-        return new std::any(t);
+      boost::any* operator()(const T& t) const {
+        return new boost::any(t);
       }
     };
 
@@ -59,7 +59,7 @@ class Object
     Object() : obj() { }
 
     template <class T>
-    Object(T && t, private_tag) : obj(new std::any(std::forward<T>(t))) { }
+    Object(T && t, private_tag) : obj(new boost::any(std::forward<T>(t))) { }
 
     // implicit constructor from optionals containing variants
     template<typename ... T>
@@ -74,7 +74,7 @@ class Object
     template <class T>
     bool assign(T &t) const
     {
-      const T* res = std::any_cast<T>(obj.get());
+      const T* res = boost::any_cast<T>(obj.get());
       if (!res) return false;
       t = *res;
       return true;
@@ -103,7 +103,7 @@ class Object
     template <class T>
     bool is() const
     {
-      return obj && std::any_cast<T>(obj.get());
+      return obj && boost::any_cast<T>(obj.get());
     }
 
     const std::type_info & type() const
@@ -157,14 +157,14 @@ template <class T>
 inline
 const T * object_cast(const Object * o)
 {
-  return std::any_cast<T>((o->obj).get());
+  return boost::any_cast<T>((o->obj).get());
 }
 
 template <class T>
 inline
 T object_cast(const Object & o)
 {
-  const T * result = std::any_cast<T>((o.obj).get());
+  const T * result = boost::any_cast<T>((o.obj).get());
   if (!result)
     throw Bad_object_cast();
   return *result;

From d8a6478b57dc0c9965b322375b17fb4a6a8af744 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 16 Aug 2023 09:02:28 +0200
Subject: [PATCH 0605/1398] remove another use of deprecated API

---
 .../include/CGAL/CGAL_Ipelet_base_v7.h        | 21 +++++++------------
 1 file changed, 7 insertions(+), 14 deletions(-)

diff --git a/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h b/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h
index 276e5d5c651a..5373b0a3445f 100644
--- a/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h
+++ b/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h
@@ -822,41 +822,34 @@ namespace CGAL{
       CGAL::Cartesian_converter<Kernel,SK> conv;
       Exact_circle_2 exact_circle=conv(approx_circle);
 
+      typedef std::pair<Circular_arc_point_2,unsigned> Cp2_mult;
       SK::Intersect_2 inter=SK().intersect_2_object();
-      std::vector< std::pair<Circular_arc_point_2,unsigned> > points;
+      std::vector< Cp2_mult > points;
       points.reserve(8);
 
-      std::vector<CGAL::Object> ints;
+      std::vector< Cp2_mult > ints;
       ints.reserve(2);
-      std::pair<Circular_arc_point_2,unsigned> tmp_pt;
 
       int indices[8]={-1,-1,-1,-1,-1,-1,-1,-1};
 
       for (unsigned i=0;i!=4;++i){
         ints.clear();
         SK::Segment_2 S(conv(bbox[i]),conv(bbox[(i+1)%4]));
-        inter(exact_circle,SK::Line_arc_2(S),std::back_inserter(ints));
+        inter(exact_circle,SK::Line_arc_2(S),dispatch_or_drop_output<Cp2_mult>(std::back_inserter(ints)));
         unsigned index=0;
-        bool ok=true;
         switch (ints.size()){
           case 1:
-            ok=CGAL::assign(tmp_pt,ints[0]);
-            CGAL_assertion(ok); CGAL_USE(ok);
-            points.push_back(tmp_pt);
+            points.push_back(ints[0]);
             index=points.size()-1;
             indices[i]=index;
             indices[(i+1)%4+4]=index;
             break;
           case 2:
             int right_ind=i<2?0:1;
-            ok=CGAL::assign(tmp_pt,ints[right_ind]);
-            CGAL_assertion(ok); CGAL_USE(ok);
-            points.push_back(tmp_pt);
+            points.push_back(ints[right_ind]);
             index=points.size()-1;
             indices[i]=index;
-            ok=CGAL::assign(tmp_pt,ints[(right_ind+1)%2]);
-            CGAL_assertion(ok); CGAL_USE(ok);
-            points.push_back(tmp_pt);
+            points.push_back(ints[(right_ind+1)%2]);
             index=points.size()-1;
             indices[(i+1)%4+4]=index;
             break;

From f1f6126f1c725ee33d3eb96e68a3c59ee1ec2ddf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 16 Aug 2023 09:11:30 +0200
Subject: [PATCH 0606/1398] add missing IO namespace

---
 .../include/CGAL/Curved_kernel_via_analysis_2/Point_2.h   | 8 ++++----
 .../test/Arrangement_on_surface_2/Traits_base_test.h      | 4 ++--
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
index 2d194eb5254c..789f24b841e4 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
@@ -700,13 +700,13 @@ class Point_2 :
         default:
           // ASCII
           os << "Point_2(";
-          os << oformat(this->ptr()->_m_xy);
+          os << ::CGAL::IO::oformat(this->ptr()->_m_xy);
           os << ",";
-          os << oformat(this->ptr()->_m_x);
+          os << ::CGAL::IO::oformat(this->ptr()->_m_x);
           os << ",";
-          os << oformat(this->ptr()->_m_curve);
+          os << ::CGAL::IO::oformat(this->ptr()->_m_curve);
           os << ",";
-          os << oformat(this->ptr()->_m_arcno);
+          os << ::CGAL::IO::oformat(this->ptr()->_m_arcno);
           os << ",";
           os << this->ptr()->_m_location;
 
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_base_test.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_base_test.h
index 696c03ebb69e..f03b66bb81da 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_base_test.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/Traits_base_test.h
@@ -136,8 +136,8 @@ class Traits_base_test : public IO_test<Geom_traits_T> {
     typename Traits::Equal_2 equal = this->m_geom_traits.equal_2_object();
     if (equal(exp_answer, real_answer)) return true;
 
-    std::string exp_answer_str  = boost::lexical_cast<std::string>( oformat(exp_answer) );
-    std::string real_answer_str = boost::lexical_cast<std::string>( oformat(real_answer) );
+    std::string exp_answer_str  = boost::lexical_cast<std::string>( CGAL::IO::oformat(exp_answer) );
+    std::string real_answer_str = boost::lexical_cast<std::string>( CGAL::IO::oformat(real_answer) );
     this->print_answer(exp_answer_str, real_answer_str, "x-monotone curve");
     return false;
   }

From d6c04e3b8a4222e552b0bfeeb8c5d953dfd49183 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 16 Aug 2023 09:17:58 +0200
Subject: [PATCH 0607/1398] do not use ref wrapper

---
 .../CGAL/Arr_point_location/Trapezoidal_decomposition_2.h       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
index e461b86a4432..1a3549c0008c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
@@ -272,7 +272,7 @@ class Trapezoidal_decomposition_2
     Base_map_item_iterator() : traits(0), m_cur_item(Td_map_item(0)){ }
 
     Base_map_item_iterator(const Traits* traits_,
-                           std::optional<std::reference_wrapper<Td_map_item>> curr = std::nullopt)
+                           std::optional<Td_map_item> curr = std::nullopt)
       :traits(traits_), m_cur_item((curr) ? *curr : Td_map_item(0) ) { }
 
     Base_map_item_iterator(const Base_map_item_iterator &it)

From b2be6dbbef3b5b62ecbfc82164f740cbc4ca568f Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Fri, 18 Aug 2023 09:25:39 +0200
Subject: [PATCH 0608/1398] fix istream for optional

Co-authored-by: Laurent Rineau <Laurent.Rineau@cgal.org>
---
 Stream_support/include/CGAL/IO/io.h | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/Stream_support/include/CGAL/IO/io.h b/Stream_support/include/CGAL/IO/io.h
index e57d4327bac6..d9c2ea7f761a 100644
--- a/Stream_support/include/CGAL/IO/io.h
+++ b/Stream_support/include/CGAL/IO/io.h
@@ -281,7 +281,11 @@ class Input_rep<std::optional<T>>
   Input_rep( std::optional<T>& tt) : t(tt) {}
 
   //! perform the input, calls \c operator\>\> by default.
-  std::istream& operator()( std::istream& is) const { return (is >> t.value()); }
+  std::istream& operator()( std::istream& is) const {
+    T v;
+    if(is >> v) t = v;
+    return is;
+  }
 };
 
 #if CGAL_FORCE_IFORMAT_DOUBLE || \

From 9eda4485d2283b6cb67ebaabbcf981ab2046c9cd Mon Sep 17 00:00:00 2001
From: Sven Oesau <sven.oesau@geometryfactory.com>
Date: Fri, 18 Aug 2023 11:06:30 +0200
Subject: [PATCH 0609/1398] changed the output from unoriented polygon soup to
 oriented polygon mesh

---
 .../include/CGAL/Polygonal_surface_reconstruction.h  | 11 ++++++++++-
 .../internal/point_set_with_planes.h                 | 12 ++++++++++++
 2 files changed, 22 insertions(+), 1 deletion(-)

diff --git a/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction.h b/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction.h
index e78c2d390a65..9ca8016600b6 100644
--- a/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction.h
+++ b/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction.h
@@ -18,6 +18,10 @@
 #include <CGAL/Polygonal_surface_reconstruction/internal/hypothesis.h>
 #include <CGAL/Polygonal_surface_reconstruction/internal/compute_confidences.h>
 #include <CGAL/Polygonal_surface_reconstruction/internal/point_set_with_planes.h>
+#include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
+#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+#include <CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h>
+#include <CGAL/Polygon_mesh_processing/repair_polygon_soup.h>
 
 #include <unordered_map>
 
@@ -455,7 +459,12 @@ namespace CGAL {
 
                         // Converts from internal data structure to the required `PolygonMesh`.
                         output_mesh.clear();        // make sure it is empty.
-                        CGAL::copy_face_graph(target_mesh, output_mesh);
+                        std::vector<Point> points;
+                        std::vector<std::vector<std::size_t> > polygons;
+                        CGAL::Polygon_mesh_processing::polygon_mesh_to_polygon_soup(target_mesh, points, polygons);
+                        CGAL::Polygon_mesh_processing::merge_duplicate_points_in_polygon_soup(points, polygons);
+                        CGAL::Polygon_mesh_processing::orient_polygon_soup(points, polygons);
+                        CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, polygons, output_mesh);
                 }
                 else {
                         error_message_ = "solving the binary program failed";
diff --git a/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction/internal/point_set_with_planes.h b/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction/internal/point_set_with_planes.h
index 09d628e7f4e0..02e68d733ce6 100644
--- a/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction/internal/point_set_with_planes.h
+++ b/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction/internal/point_set_with_planes.h
@@ -67,6 +67,18 @@ namespace CGAL {
                                         delete supporting_plane_;
                                 supporting_plane_ = new Plane;
                                 CGAL::linear_least_squares_fitting_3(pts.begin(), pts.end(), *supporting_plane_, CGAL::Dimension_tag<0>());
+
+                                // Check orientation
+                                int vote_for_opposite = 0;
+                                for (std::size_t i = 0; i < size(); i++)
+                                  if (supporting_plane_->orthogonal_vector() * point_set_->normal_map()[at(i)] < 0)
+                                    vote_for_opposite++;
+                                  else
+                                    vote_for_opposite--;
+
+                                if (vote_for_opposite > 0)
+                                  *supporting_plane_ = supporting_plane_->opposite();
+
                                 return supporting_plane_;
                         }
 

From 7b00717eabbe10265204ad6261a364064dc0055b Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Fri, 18 Aug 2023 12:49:32 +0300
Subject: [PATCH 0610/1398] Fixed comment

---
 .../include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h        | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
index e3a934889bce..ddf3688c48de 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
@@ -95,11 +95,11 @@ class Arr_extended_direction_3 : public Kernel::Direction_3 {
     return (*this);
   }
 
-  /*! Set the location of the point.
+  /*! Set the location type of the point.
    */
   void set_location(Location_type location) { m_location = location; }
 
-  /*! Obtain the location of the point.
+  /*! Obtain the location type of the point.
    */
   Location_type location() const { return m_location; }
 

From d3b5cd997cfa98cb4de7d7415c2bd8ce6c66d989 Mon Sep 17 00:00:00 2001
From: Sven Oesau <sven.oesau@geometryfactory.com>
Date: Fri, 18 Aug 2023 12:05:26 +0200
Subject: [PATCH 0611/1398] added Polygon_mesh_processing to dependencies

---
 .../doc/Polygonal_surface_reconstruction/dependencies            | 1 +
 .../package_info/Polygonal_surface_reconstruction/dependencies   | 1 +
 2 files changed, 2 insertions(+)

diff --git a/Polygonal_surface_reconstruction/doc/Polygonal_surface_reconstruction/dependencies b/Polygonal_surface_reconstruction/doc/Polygonal_surface_reconstruction/dependencies
index 43aca366b54b..ffd752d9c821 100644
--- a/Polygonal_surface_reconstruction/doc/Polygonal_surface_reconstruction/dependencies
+++ b/Polygonal_surface_reconstruction/doc/Polygonal_surface_reconstruction/dependencies
@@ -5,5 +5,6 @@ Circulator
 Alpha_shapes_2
 Surface_mesh
 Point_set_processing_3
+Polygon_mesh_processing
 Solver_interface
 Shape_detection
diff --git a/Polygonal_surface_reconstruction/package_info/Polygonal_surface_reconstruction/dependencies b/Polygonal_surface_reconstruction/package_info/Polygonal_surface_reconstruction/dependencies
index cf61d44e4ba4..650e4a65343e 100644
--- a/Polygonal_surface_reconstruction/package_info/Polygonal_surface_reconstruction/dependencies
+++ b/Polygonal_surface_reconstruction/package_info/Polygonal_surface_reconstruction/dependencies
@@ -22,6 +22,7 @@ Point_set_3
 Point_set_processing_3
 Polygon
 Polygonal_surface_reconstruction
+Polygon_mesh_processing
 Principal_component_analysis
 Principal_component_analysis_LGPL
 Profiling_tools

From de459faa76881bd151204fb1cedb16324f4f94ed Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Fri, 18 Aug 2023 13:35:00 +0300
Subject: [PATCH 0612/1398] Fixed the Approximate_2::operator() that returns a
 sequence of points that approximate a curve; in particular, respected the l2r
 parameter.

---
 .../Arr_geodesic_arc_on_sphere_traits_2.h     | 29 ++++++++++++++-----
 1 file changed, 21 insertions(+), 8 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
index ddf3688c48de..3dde86da5a9a 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_geodesic_arc_on_sphere_traits_2.h
@@ -2889,18 +2889,31 @@ class Arr_geodesic_arc_on_sphere_traits_2 : public Kernel_ {
     OutputIterator operator()(const X_monotone_curve_2& xcv,
                               Approximate_number_type error,
                               OutputIterator oi, bool l2r = true) const {
-      auto s = xcv.source();
-      auto t = xcv.target();
-      auto n = xcv.normal();
-
-      // get the approximate points;
-      auto as = (*this)(s);
-      auto at = (*this)(t);
+      const auto& s = xcv.source();
+      const auto& t = xcv.target();
+      const auto& n = xcv.normal();
+      const auto dx = CGAL::to_double(n.dx());
+      const auto dy = CGAL::to_double(n.dy());
+      const auto dz = CGAL::to_double(n.dz());
+
+      Approximate_point_2 as, at;
+      Approximate_kernel_vector_3 vn;
+      if (xcv.is_directed_right() == l2r) {
+        // Get the approximate points
+        as = (*this)(s);
+        at = (*this)(t);
+        vn = Approximate_kernel_vector_3(dx, dy, dz);
+      }
+      else {
+        // Get the approximate points
+        as = (*this)(t);
+        at = (*this)(s);
+        vn = Approximate_kernel_vector_3(-dx, -dy, -dz);
+      }
 
       // convert the approximate points to vectors with approximate-kernel
       auto vs = approximate_vector_3(as);
       auto vt = approximate_vector_3(at);
-      auto vn = approximate_vector_3(n);
 
       // normalize the vectors
       auto normalize = [](auto& x) { x /= std::sqrt(x.squared_length()); };

From 51fc8aa18d314194a8cf0c6b3ee5aff18aed2c09 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Fri, 18 Aug 2023 13:38:34 +0300
Subject: [PATCH 0613/1398] Removed unused variable

---
 .../include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h         | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
index 222f869444a8..7a824ab974ae 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
@@ -581,7 +581,6 @@ _compute_next_intersection(Halfedge_handle he,
             << skip_first_point << ")" << std::endl;
 #endif
 
-  auto equal = m_geom_traits->equal_2_object();
   auto compare_xy = m_geom_traits->compare_xy_2_object();
   auto ctr_min = m_geom_traits->construct_min_vertex_2_object();
   auto is_closed = m_geom_traits->is_closed_2_object();

From 3b84bd05f86e4003804b3b5b59858f8ba02ceadc Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Fri, 18 Aug 2023 13:45:53 +0300
Subject: [PATCH 0614/1398] Reported the fix in PR #7644

---
 Installation/CHANGES.md | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index bedbfc898326..a0e667f03280 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -11,6 +11,9 @@ Release date: October 2023
 - **Breaking change**: C++17 is now required
 - Support for Visual `C++` 14.0 (Visual studio 2015) is dropped.
 
+### [2D Arrangements](https://doc.cgal.org/6.0/Manual/packages.html#PkgArrangementOnSurface2)
+-   Fixed a bug in the zone construction code applied to arrangements of geodesic arcs on a sphere,
+    when inserting an arc that lies on the identification curve.
 
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------

From 33e88b2e8fea8fd747a4095d7ab6665aaeb3456a Mon Sep 17 00:00:00 2001
From: Sven Oesau <sven.oesau@geometryfactory.com>
Date: Mon, 21 Aug 2023 11:33:50 +0200
Subject: [PATCH 0615/1398] removing PMP dependency following review [skip ci]

---
 .../doc/Polygonal_surface_reconstruction/dependencies            | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Polygonal_surface_reconstruction/doc/Polygonal_surface_reconstruction/dependencies b/Polygonal_surface_reconstruction/doc/Polygonal_surface_reconstruction/dependencies
index ffd752d9c821..43aca366b54b 100644
--- a/Polygonal_surface_reconstruction/doc/Polygonal_surface_reconstruction/dependencies
+++ b/Polygonal_surface_reconstruction/doc/Polygonal_surface_reconstruction/dependencies
@@ -5,6 +5,5 @@ Circulator
 Alpha_shapes_2
 Surface_mesh
 Point_set_processing_3
-Polygon_mesh_processing
 Solver_interface
 Shape_detection

From a0255568dd31824fef300eecee5a1e00339613e0 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 21 Aug 2023 11:09:45 +0100
Subject: [PATCH 0616/1398] Update changes.md

---
 Installation/CHANGES.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 388f336227b9..0466359b82b1 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -10,6 +10,7 @@ Release date: October 2023
 
 - **Breaking change**: C++17 is now required
 - Support for Visual `C++` 14.0 (Visual studio 2015) is dropped.
+- The demos as well as the `draw()` functions using the `Basic_viewer` are based on Qt6
 
 
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)

From 58e0bf13a685e5f0d88685a69a5e34350755b8bc Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Wed, 2 Aug 2023 10:41:21 +0200
Subject: [PATCH 0617/1398] reintroduce mean curvature and gaussian curvature
 in "display properties"

broken for now
---
 .../Plugins/Display/Display_property.ui       |  26 +++
 .../Display/Display_property_plugin.cpp       | 159 +++++++++++++++++-
 2 files changed, 183 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
index 656ec4827c55..d1e5e795e711 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
@@ -180,6 +180,32 @@
            </property>
           </widget>
          </item>
+         <item row="8" column="1">
+           <widget class="QSlider" name="expandingRadiusSlider">
+             <property name="minimum">
+               <float>0</float>
+             </property>
+             <property name="maximum">
+               <float>100</float>
+             </property>
+             <property name="tracking">
+               <bool>true</bool>
+             </property>
+             <property name="orientation">
+               <enum>Qt::Horizontal</enum>
+             </property>
+             <property name="tickPosition">
+               <enum>QSlider::TicksAbove</enum>
+             </property>
+           </widget>
+        </item>
+        <item row="9" column="1">
+          <widget class="QLabel" name="expandingRadiusLabel">
+            <property name="text">
+              <string>Expanding Radius: 0</string>
+            </property>
+           </widget>
+        </item>
         </layout>
        </widget>
       </item>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 994dcd2e8d9b..5b212d5a4703 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -22,6 +22,7 @@
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
 #include <CGAL/Polygon_mesh_processing/measure.h>
 #include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
+#include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 
 #include <QAbstractItemView>
 #include <QAction>
@@ -31,6 +32,7 @@
 #include <QInputDialog>
 #include <QMainWindow>
 #include <QMessageBox>
+#include <QSlider>
 #include <QObject>
 #include <QPalette>
 #include <QStyleFactory>
@@ -85,6 +87,9 @@ class Display_property_plugin
   double gI = 1.;
   double bI = 0.;
 
+  double expand_radius = 0;
+  double maxEdgeLength = -1;
+
   Color_ramp color_ramp;
   std::vector<QColor> color_map;
   QPixmap legend;
@@ -98,6 +103,11 @@ class Display_property_plugin
     MIN_VALUE,
     MAX_VALUE
   };
+  enum CurvatureType
+  {
+    MEAN_CURVATURE,
+    GAUSSIAN_CURVATURE,
+  };
 
 public:
   bool applicable(QAction*) const Q_DECL_OVERRIDE
@@ -196,6 +206,8 @@ class Display_property_plugin
             this, &Display_property_plugin::on_zoomToMinButton_pressed);
     connect(dock_widget->zoomToMaxButton, &QPushButton::pressed,
             this, &Display_property_plugin::on_zoomToMaxButton_pressed);
+    connect(dock_widget->expandingRadiusSlider, SIGNAL(valueChanged(int)),
+            this, SLOT(setExpandingRadius(int)));
   }
 
 private Q_SLOTS:
@@ -252,6 +264,20 @@ private Q_SLOTS:
       dock_widget->maxBox->setRange(-1000, 1000);
       dock_widget->maxBox->setValue(0);
     }
+    else if (property_name == "Interpolated Corrected Mean Curvature")
+    {
+      dock_widget->minBox->setRange(-99999999, 99999999);
+      dock_widget->minBox->setValue(0);
+      dock_widget->maxBox->setRange(-99999999, 99999999);
+      dock_widget->maxBox->setValue(0);
+    }
+    else if (property_name == "Interpolated Corrected Gaussian Curvature")
+    {
+      dock_widget->minBox->setRange(-99999999, 99999999);
+      dock_widget->minBox->setValue(0);
+      dock_widget->maxBox->setRange(-99999999, 99999999);
+      dock_widget->maxBox->setValue(0);
+    }
     else
     {
       dock_widget->minBox->setRange(-99999999, 99999999);
@@ -432,11 +458,15 @@ private Q_SLOTS:
       dock_widget->propertyBox->addItems({"Smallest Angle Per Face",
                                           "Largest Angle Per Face",
                                           "Scaled Jacobian",
-                                          "Face Area"});
+                                          "Face Area",
+                                          "Interpolated Corrected Mean Curvature",
+                                          "Interpolated Corrected Gaussian Curvature"});
       property_simplex_types = { Property_simplex_type::FACE,
                                  Property_simplex_type::FACE,
                                  Property_simplex_type::FACE,
-                                 Property_simplex_type::FACE };
+                                 Property_simplex_type::FACE,
+                                 Property_simplex_type::VERTEX,
+                                 Property_simplex_type::VERTEX };
       detectSMScalarProperties(*(sm_item->face_graph()));
     }
     else if(ps_item)
@@ -527,6 +557,16 @@ private Q_SLOTS:
     {
       displayArea(sm_item);
     }
+    else if(property_name == "Interpolated Corrected Mean Curvature")
+    {
+      displayInterpolatedCurvatureMeasure(sm_item, MEAN_CURVATURE);
+      sm_item->setRenderingMode(Gouraud);
+    }
+    else if(property_name == "Interpolated Corrected Gaussian Curvature")
+    {
+      displayInterpolatedCurvatureMeasure(sm_item, GAUSSIAN_CURVATURE);
+      sm_item->setRenderingMode(Gouraud);
+    }
     else
     {
       const int property_index = dock_widget->propertyBox->currentIndex();
@@ -629,6 +669,8 @@ private Q_SLOTS:
     removeDisplayPluginProperty(item, "f:display_plugin_largest_angle");
     removeDisplayPluginProperty(item, "f:display_plugin_scaled_jacobian");
     removeDisplayPluginProperty(item, "f:display_plugin_area");
+    removeDisplayPluginProperty(item, "v:interpolated_corrected_mean_curvature");
+    removeDisplayPluginProperty(item, "v:interpolated_corrected_Gaussian_curvature");
   }
 
   void displayExtremumAnglePerFace(Scene_surface_mesh_item* sm_item,
@@ -809,6 +851,119 @@ private Q_SLOTS:
     displaySMProperty<face_descriptor>("f:display_plugin_area", *sm);
   }
 
+   void setExpandingRadius(int val_int)
+  {
+    double sliderMin = dock_widget->expandingRadiusSlider->minimum();
+    double sliderMax = dock_widget->expandingRadiusSlider->maximum() - sliderMin;
+    double val =  val_int - sliderMin;
+    sliderMin = 0;
+
+    SMesh& smesh = *(qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex())))->face_graph();
+
+    auto vpm = get(CGAL::vertex_point, smesh);
+
+    if (maxEdgeLength < 0)
+    {
+      auto edge_range = CGAL::edges(smesh);
+
+      if (edge_range.begin() == edge_range.end())
+      {
+        expand_radius = 0;
+        dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
+        return;
+      }
+
+      auto edge_reference = std::max_element(edge_range.begin(), edge_range.end(), [&, vpm, smesh](auto l, auto r) {
+        auto res = EPICK().compare_squared_distance_3_object()(
+            get(vpm, source((l), smesh)),
+            get(vpm, target((l), smesh)),
+            get(vpm, source((r), smesh)),
+            get(vpm, target((r), smesh)));
+        return res == CGAL::SMALLER;
+      });
+
+      // if edge_reference is not derefrenceble
+      if (edge_reference == edge_range.end())
+      {
+        expand_radius = 0;
+        dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
+        return;
+      }
+
+      maxEdgeLength = sqrt(
+          (get(vpm, source((*edge_reference), smesh)) - get(vpm, target((*edge_reference), smesh)))
+          .squared_length()
+      );
+
+    }
+
+    double outMax = 5 * maxEdgeLength, base = 1.2;
+
+    expand_radius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
+    dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
+
+  }
+
+  void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item, CurvatureType mu_index)
+  {
+    namespace PMP = CGAL::Polygon_mesh_processing;
+
+    if (mu_index != MEAN_CURVATURE && mu_index != GAUSSIAN_CURVATURE) return;
+
+    std::string tied_string = (mu_index == MEAN_CURVATURE)?
+        "v:interpolated_corrected_mean_curvature": "v:interpolated_corrected_Gaussian_curvature";
+    SMesh& smesh = *item->face_graph();
+
+    const auto vnm = smesh.property_map<vertex_descriptor, EPICK::Vector_3>("v:normal_before_perturbation").first;
+    const bool vnm_exists = smesh.property_map<vertex_descriptor, EPICK::Vector_3>("v:normal_before_perturbation").second;
+
+    //compute once and store the value per vertex
+    bool non_init;
+    SMesh::Property_map<vertex_descriptor, double> mu_i_map;
+        std::tie(mu_i_map, non_init) =
+            smesh.add_property_map<vertex_descriptor, double>(tied_string, 0);
+    if (non_init)
+    {
+      if (vnm_exists) {
+        if (mu_index == MEAN_CURVATURE)
+          PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
+        else
+          PMP::interpolated_corrected_Gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
+      }
+      else {
+        if (mu_index == MEAN_CURVATURE)
+          PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
+        else
+          PMP::interpolated_corrected_Gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
+      }
+      double res_min = ARBITRARY_DBL_MAX,
+             res_max = -ARBITRARY_DBL_MAX;
+      SMesh::Vertex_index min_index, max_index;
+      for (SMesh::Vertex_index v : vertices(smesh))
+      {
+        if (mu_i_map[v] > res_max)
+        {
+          res_max = mu_i_map[v];
+          max_index = v;
+        }
+        if (mu_i_map[v] < res_min)
+        {
+          res_min = mu_i_map[v];
+          min_index = v;
+        }
+      }
+//      if (mu_index == MEAN_CURVATURE){
+//        mean_curvature_max[item] = std::make_pair(res_max, max_index);
+//        mean_curvature_min[item] = std::make_pair(res_min, min_index);
+//      }
+//      else {
+//        gaussian_curvature_max[item] = std::make_pair(res_max, max_index);
+//        gaussian_curvature_min[item] = std::make_pair(res_min, min_index);
+//      }
+    }
+//    treat_sm_property<vertex_descriptor>(tied_string, item->face_graph());
+  }
+
 private:
   template<typename Functor>
   bool call_on_PS_property(const std::string& name,

From 41bddc72d6f3feebad57682345b80fcbe289eca5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 2 Aug 2023 12:29:29 +0200
Subject: [PATCH 0618/1398] Display plugin fixes

---
 .../Display/Display_property_plugin.cpp       | 141 +++++++++---------
 1 file changed, 69 insertions(+), 72 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 5b212d5a4703..037d5bb4982b 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -47,6 +47,8 @@
 #define ARBITRARY_DBL_MIN 1.0E-17
 #define ARBITRARY_DBL_MAX 1.0E+17
 
+namespace PMP = CGAL::Polygon_mesh_processing;
+
 using namespace CGAL::Three;
 
 Viewer_interface* (&getActiveViewer)() = Three::activeViewer;
@@ -206,6 +208,7 @@ class Display_property_plugin
             this, &Display_property_plugin::on_zoomToMinButton_pressed);
     connect(dock_widget->zoomToMaxButton, &QPushButton::pressed,
             this, &Display_property_plugin::on_zoomToMaxButton_pressed);
+
     connect(dock_widget->expandingRadiusSlider, SIGNAL(valueChanged(int)),
             this, SLOT(setExpandingRadius(int)));
   }
@@ -669,8 +672,8 @@ private Q_SLOTS:
     removeDisplayPluginProperty(item, "f:display_plugin_largest_angle");
     removeDisplayPluginProperty(item, "f:display_plugin_scaled_jacobian");
     removeDisplayPluginProperty(item, "f:display_plugin_area");
-    removeDisplayPluginProperty(item, "v:interpolated_corrected_mean_curvature");
-    removeDisplayPluginProperty(item, "v:interpolated_corrected_Gaussian_curvature");
+    removeDisplayPluginProperty(item, "v:display_plugin_interpolated_corrected_mean_curvature");
+    removeDisplayPluginProperty(item, "v:display_plugin_interpolated_corrected_Gaussian_curvature");
   }
 
   void displayExtremumAnglePerFace(Scene_surface_mesh_item* sm_item,
@@ -759,7 +762,7 @@ private Q_SLOTS:
           halfedge_descriptor local_border_h = opposite(halfedge(local_f, local_smesh), local_smesh);
           CGAL_assertion(is_border(local_border_h, local_smesh));
 
-          CGAL::Polygon_mesh_processing::triangulate_faces(local_smesh);
+          PMP::triangulate_faces(local_smesh);
 
           double extremum_angle_in_face = ARBITRARY_DBL_MAX;
           halfedge_descriptor local_border_end_h = local_border_h;
@@ -812,7 +815,7 @@ private Q_SLOTS:
               const SMesh& mesh) const
   {
     if(CGAL::is_triangle(halfedge(f, mesh), mesh))
-      return CGAL::Polygon_mesh_processing::face_area(f, mesh);
+      return PMP::face_area(f, mesh);
 
     auto vpm = get(boost::vertex_point, mesh);
 
@@ -828,8 +831,8 @@ private Q_SLOTS:
     }
 
     CGAL::Euler::add_face(local_vertices, local_smesh);
-    CGAL::Polygon_mesh_processing::triangulate_faces(local_smesh);
-    return CGAL::Polygon_mesh_processing::area(local_smesh);
+    PMP::triangulate_faces(local_smesh);
+    return PMP::area(local_smesh);
   }
 
   void displayArea(Scene_surface_mesh_item* sm_item)
@@ -851,117 +854,105 @@ private Q_SLOTS:
     displaySMProperty<face_descriptor>("f:display_plugin_area", *sm);
   }
 
-   void setExpandingRadius(int val_int)
+  void setExpandingRadius(const int val_int)
   {
     double sliderMin = dock_widget->expandingRadiusSlider->minimum();
     double sliderMax = dock_widget->expandingRadiusSlider->maximum() - sliderMin;
-    double val =  val_int - sliderMin;
+    double val = val_int - sliderMin;
     sliderMin = 0;
 
-    SMesh& smesh = *(qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex())))->face_graph();
+    Scene_item* item = scene->item(scene->mainSelectionIndex());
+    Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
+    if(sm_item == nullptr)
+      return;
+
+    SMesh& smesh = *(sm_item->face_graph());
 
     auto vpm = get(CGAL::vertex_point, smesh);
 
-    if (maxEdgeLength < 0)
+    // @todo use the upcoming PMP::longest_edge
+    if(maxEdgeLength < 0)
     {
       auto edge_range = CGAL::edges(smesh);
 
-      if (edge_range.begin() == edge_range.end())
+      if(num_edges(smesh) == 0)
       {
         expand_radius = 0;
         dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
         return;
       }
 
-      auto edge_reference = std::max_element(edge_range.begin(), edge_range.end(), [&, vpm, smesh](auto l, auto r) {
-        auto res = EPICK().compare_squared_distance_3_object()(
-            get(vpm, source((l), smesh)),
-            get(vpm, target((l), smesh)),
-            get(vpm, source((r), smesh)),
-            get(vpm, target((r), smesh)));
-        return res == CGAL::SMALLER;
-      });
-
-      // if edge_reference is not derefrenceble
-      if (edge_reference == edge_range.end())
-      {
-        expand_radius = 0;
-        dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
-        return;
-      }
+      auto eit = std::max_element(edge_range.begin(), edge_range.end(),
+                                  [&, vpm, smesh](auto l, auto r)
+                                  {
+                                    auto res = EPICK().compare_squared_distance_3_object()(
+                                        get(vpm, source((l), smesh)),
+                                        get(vpm, target((l), smesh)),
+                                        get(vpm, source((r), smesh)),
+                                        get(vpm, target((r), smesh)));
+                                    return (res == CGAL::SMALLER);
+                                });
 
-      maxEdgeLength = sqrt(
-          (get(vpm, source((*edge_reference), smesh)) - get(vpm, target((*edge_reference), smesh)))
-          .squared_length()
-      );
+      CGAL_assertion(eit != edge_range.end());
 
+      maxEdgeLength = PMP::edge_length(*eit, smesh);
     }
 
     double outMax = 5 * maxEdgeLength, base = 1.2;
 
     expand_radius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
     dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
-
   }
 
-  void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item, CurvatureType mu_index)
+  void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item,
+                                           CurvatureType mu_index)
   {
-    namespace PMP = CGAL::Polygon_mesh_processing;
+    if(mu_index != MEAN_CURVATURE && mu_index != GAUSSIAN_CURVATURE)
+      return;
 
-    if (mu_index != MEAN_CURVATURE && mu_index != GAUSSIAN_CURVATURE) return;
+    std::string tied_string = (mu_index == MEAN_CURVATURE) ? "v:display_plugin_interpolated_corrected_mean_curvature"
+                                                           : "v:display_plugin_interpolated_corrected_Gaussian_curvature";
 
-    std::string tied_string = (mu_index == MEAN_CURVATURE)?
-        "v:interpolated_corrected_mean_curvature": "v:interpolated_corrected_Gaussian_curvature";
     SMesh& smesh = *item->face_graph();
 
     const auto vnm = smesh.property_map<vertex_descriptor, EPICK::Vector_3>("v:normal_before_perturbation").first;
     const bool vnm_exists = smesh.property_map<vertex_descriptor, EPICK::Vector_3>("v:normal_before_perturbation").second;
 
-    //compute once and store the value per vertex
+    // compute once and store the value per vertex
     bool non_init;
     SMesh::Property_map<vertex_descriptor, double> mu_i_map;
-        std::tie(mu_i_map, non_init) =
-            smesh.add_property_map<vertex_descriptor, double>(tied_string, 0);
-    if (non_init)
+    std::tie(mu_i_map, non_init) = smesh.add_property_map<vertex_descriptor, double>(tied_string, 0);
+    if(non_init)
     {
-      if (vnm_exists) {
-        if (mu_index == MEAN_CURVATURE)
-          PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
-        else
-          PMP::interpolated_corrected_Gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius).vertex_normal_map(vnm));
-      }
-      else {
-        if (mu_index == MEAN_CURVATURE)
-          PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
+      if(vnm_exists)
+      {
+        if(mu_index == MEAN_CURVATURE)
+        {
+          PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map,
+                                                     CGAL::parameters::ball_radius(expand_radius)
+                                                                      .vertex_normal_map(vnm));
+        }
         else
-          PMP::interpolated_corrected_Gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
+        {
+          PMP::interpolated_corrected_Gaussian_curvature(smesh, mu_i_map,
+                                                         CGAL::parameters::ball_radius(expand_radius)
+                                                                          .vertex_normal_map(vnm));
+        }
       }
-      double res_min = ARBITRARY_DBL_MAX,
-             res_max = -ARBITRARY_DBL_MAX;
-      SMesh::Vertex_index min_index, max_index;
-      for (SMesh::Vertex_index v : vertices(smesh))
+      else
       {
-        if (mu_i_map[v] > res_max)
+        if(mu_index == MEAN_CURVATURE)
         {
-          res_max = mu_i_map[v];
-          max_index = v;
+          PMP::interpolated_corrected_mean_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
         }
-        if (mu_i_map[v] < res_min)
+        else
         {
-          res_min = mu_i_map[v];
-          min_index = v;
+          PMP::interpolated_corrected_Gaussian_curvature(smesh, mu_i_map, CGAL::parameters::ball_radius(expand_radius));
         }
       }
-//      if (mu_index == MEAN_CURVATURE){
-//        mean_curvature_max[item] = std::make_pair(res_max, max_index);
-//        mean_curvature_min[item] = std::make_pair(res_min, min_index);
-//      }
-//      else {
-//        gaussian_curvature_max[item] = std::make_pair(res_max, max_index);
-//        gaussian_curvature_min[item] = std::make_pair(res_min, min_index);
-//      }
     }
-//    treat_sm_property<vertex_descriptor>(tied_string, item->face_graph());
+
+    displaySMProperty<vertex_descriptor>(tied_string, smesh);
   }
 
 private:
@@ -1119,6 +1110,10 @@ private Q_SLOTS:
         zoomToSimplexWithPropertyExtremum(faces(mesh), mesh, "f:display_plugin_scaled_jacobian", extremum);
       else if(property_name == "Face Area")
         zoomToSimplexWithPropertyExtremum(faces(mesh), mesh, "f:display_plugin_area", extremum);
+      else if(property_name == "Interpolated Corrected Mean Curvature")
+        zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, "v:display_plugin_interpolated_corrected_mean_curvature", extremum);
+      else if(property_name == "Interpolated Corrected Gaussian Curvature")
+        zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, "v:display_plugin_interpolated_corrected_Gaussian_curvature", extremum);
       else if(property_simplex_types.at(property_index) == Property_simplex_type::VERTEX)
         zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, property_name, extremum);
       else if(property_simplex_types.at(property_index) == Property_simplex_type::FACE)
@@ -1401,7 +1396,7 @@ scaled_jacobian(const face_descriptor f,
   for(std::size_t i=0; i<edges.size(); ++i)
     corner_normals.push_back(CGAL::cross_product(edges[i], edges[(i+1)%(edges.size())]));
 
-  EPICK::Vector_3 unit_center_normal = CGAL::Polygon_mesh_processing::compute_face_normal(f, mesh);
+  EPICK::Vector_3 unit_center_normal = PMP::compute_face_normal(f, mesh);
 
   for(std::size_t i=0; i<corner_areas.size(); ++i)
     corner_areas[i] =  unit_center_normal*corner_normals[i];
@@ -1453,7 +1448,9 @@ isSMPropertyScalar(const std::string& name,
   if(name == "f:display_plugin_smallest_angle" ||
      name == "f:display_plugin_largest_angle" ||
      name == "f:display_plugin_scaled_jacobian" ||
-     name == "f:display_plugin_area")
+     name == "f:display_plugin_area" ||
+     name == "v:display_plugin_interpolated_corrected_mean_curvature" ||
+     name == "v:display_plugin_interpolated_corrected_Gaussian_curvature")
     return false;
 
   // the dispatch function does the filtering we want: if it founds a property

From b6cc7cabc5168de04e5152b66d438b7c6b90871a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 2 Aug 2023 13:26:02 +0200
Subject: [PATCH 0619/1398] Fix UI + fix connections

---
 .../Plugins/Display/Display_property.ui       | 316 ++++++++++--------
 .../Display/Display_property_plugin.cpp       |  27 +-
 2 files changed, 189 insertions(+), 154 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
index d1e5e795e711..0a824308300d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
@@ -3,7 +3,7 @@
  <class>DisplayPropertyWidget</class>
  <widget class="QDockWidget" name="DisplayPropertyWidget">
   <property name="enabled">
-   <bool>false</bool>
+   <bool>true</bool>
   </property>
   <property name="geometry">
    <rect>
@@ -39,9 +39,18 @@
     </item>
     <item row="0" column="0" colspan="2">
      <widget class="QGroupBox" name="propertyGroup">
+      <property name="enabled">
+       <bool>true</bool>
+      </property>
       <property name="title">
        <string>Property</string>
       </property>
+      <property name="flat">
+       <bool>false</bool>
+      </property>
+      <property name="checkable">
+       <bool>false</bool>
+      </property>
       <layout class="QVBoxLayout" name="verticalLayout_2">
        <property name="leftMargin">
         <number>6</number>
@@ -82,13 +91,114 @@
          </item>
         </widget>
        </item>
+       <item>
+        <widget class="QSlider" name="expandingRadiusSlider">
+         <property name="enabled">
+          <bool>true</bool>
+         </property>
+         <property name="minimum">
+          <number>0</number>
+         </property>
+         <property name="maximum">
+          <number>100</number>
+         </property>
+         <property name="tracking">
+          <bool>true</bool>
+         </property>
+         <property name="orientation">
+          <enum>Qt::Horizontal</enum>
+         </property>
+         <property name="invertedAppearance">
+          <bool>false</bool>
+         </property>
+         <property name="invertedControls">
+          <bool>false</bool>
+         </property>
+         <property name="tickPosition">
+          <enum>QSlider::TicksAbove</enum>
+         </property>
+        </widget>
+       </item>
+       <item>
+        <widget class="QLabel" name="expandingRadiusLabel">
+         <property name="enabled">
+          <bool>true</bool>
+         </property>
+         <property name="text">
+          <string>Expanding Radius: 0</string>
+         </property>
+        </widget>
+       </item>
+      </layout>
+     </widget>
+    </item>
+    <item row="11" column="0">
+     <widget class="QGroupBox" name="extremeValuesGroup">
+      <property name="enabled">
+       <bool>false</bool>
+      </property>
+      <property name="title">
+       <string>Extreme Values</string>
+      </property>
+      <layout class="QGridLayout" name="gridLayout">
+       <item row="0" column="0">
+        <widget class="QLabel" name="extremeValuesMinLabel">
+         <property name="text">
+          <string>Min Value</string>
+         </property>
+        </widget>
+       </item>
+       <item row="2" column="0">
+        <widget class="QLabel" name="extremeValuesMaxLabel">
+         <property name="text">
+          <string>Max Value</string>
+         </property>
+        </widget>
+       </item>
+       <item row="2" column="1">
+        <widget class="DoubleEdit" name="maxBox">
+         <property name="text">
+          <string>2.00</string>
+         </property>
+         <property name="readOnly">
+          <bool>true</bool>
+         </property>
+        </widget>
+       </item>
+       <item row="2" column="2">
+        <widget class="QPushButton" name="zoomToMaxButton">
+         <property name="text">
+          <string>Zoom to max value</string>
+         </property>
+        </widget>
+       </item>
+       <item row="0" column="2">
+        <widget class="QPushButton" name="zoomToMinButton">
+         <property name="text">
+          <string>Zoom to min value</string>
+         </property>
+        </widget>
+       </item>
+       <item row="0" column="1">
+        <widget class="DoubleEdit" name="minBox">
+         <property name="text">
+          <string>0.00</string>
+         </property>
+         <property name="frame">
+          <bool>true</bool>
+         </property>
+         <property name="readOnly">
+          <bool>true</bool>
+         </property>
+        </widget>
+       </item>
       </layout>
      </widget>
     </item>
     <item row="1" column="0">
-     <layout class="QGridLayout" name="ColoringGroup" columnstretch="50,50">
-      <item row="0" column="0">
-       <spacer name="verticalSpacer">
+     <layout class="QGridLayout" name="ColoringGroup" columnstretch="0,0">
+      <item row="6" column="0">
+       <spacer name="verticalSpacer_4">
         <property name="orientation">
          <enum>Qt::Vertical</enum>
         </property>
@@ -100,7 +210,33 @@
         </property>
        </spacer>
       </item>
-      <item row="1" column="0">
+      <item row="4" column="1" rowspan="3">
+       <widget class="QScrollArea" name="scrollArea">
+        <property name="widgetResizable">
+         <bool>true</bool>
+        </property>
+        <widget class="QWidget" name="scrollAreaWidgetContents">
+         <property name="geometry">
+          <rect>
+           <x>0</x>
+           <y>0</y>
+           <width>236</width>
+           <height>335</height>
+          </rect>
+         </property>
+         <layout class="QGridLayout" name="gridLayout_5">
+          <item row="0" column="0" alignment="Qt::AlignHCenter">
+           <widget class="QLabel" name="legendLabel">
+            <property name="text">
+             <string>RAMP DISPLAYING</string>
+            </property>
+           </widget>
+          </item>
+         </layout>
+        </widget>
+       </widget>
+      </item>
+      <item row="5" column="0">
        <widget class="QGroupBox" name="coloringChoiceGroup">
         <property name="title">
          <string>Color Visualization</string>
@@ -118,10 +254,17 @@
          <property name="bottomMargin">
           <number>0</number>
          </property>
-         <item row="8" column="0">
-          <widget class="QRadioButton" name="randomColorsRadioButton">
+         <item row="5" column="1">
+          <widget class="QPushButton" name="maxColorButton">
            <property name="text">
-            <string>Random colors</string>
+            <string/>
+           </property>
+          </widget>
+         </item>
+         <item row="5" column="0">
+          <widget class="QLabel" name="maxColorLabel">
+           <property name="text">
+            <string>Max color</string>
            </property>
           </widget>
          </item>
@@ -135,20 +278,6 @@
            </property>
           </widget>
          </item>
-         <item row="9" column="0">
-          <widget class="QLabel" name="initColorLabel">
-           <property name="text">
-            <string>First color</string>
-           </property>
-          </widget>
-         </item>
-         <item row="5" column="0">
-          <widget class="QLabel" name="maxColorLabel">
-           <property name="text">
-            <string>Max color</string>
-           </property>
-          </widget>
-         </item>
          <item row="2" column="0" colspan="2">
           <widget class="QRadioButton" name="colorRampRadioButton">
            <property name="text">
@@ -159,58 +288,42 @@
            </property>
           </widget>
          </item>
-         <item row="9" column="1">
+         <item row="10" column="1">
           <widget class="QPushButton" name="initColorButton">
            <property name="text">
             <string/>
            </property>
           </widget>
          </item>
-         <item row="5" column="1">
-          <widget class="QPushButton" name="maxColorButton">
+         <item row="3" column="0">
+          <widget class="QLabel" name="minColorLabel">
            <property name="text">
-            <string/>
+            <string>Min color</string>
            </property>
           </widget>
          </item>
-         <item row="3" column="0">
-          <widget class="QLabel" name="minColorLabel">
+         <item row="10" column="0">
+          <widget class="QLabel" name="initColorLabel">
            <property name="text">
-            <string>Min color</string>
+            <string>First color</string>
+           </property>
+          </widget>
+         </item>
+         <item row="8" column="0">
+          <widget class="QRadioButton" name="randomColorsRadioButton">
+           <property name="text">
+            <string>Random colors</string>
            </property>
           </widget>
          </item>
-         <item row="8" column="1">
-           <widget class="QSlider" name="expandingRadiusSlider">
-             <property name="minimum">
-               <float>0</float>
-             </property>
-             <property name="maximum">
-               <float>100</float>
-             </property>
-             <property name="tracking">
-               <bool>true</bool>
-             </property>
-             <property name="orientation">
-               <enum>Qt::Horizontal</enum>
-             </property>
-             <property name="tickPosition">
-               <enum>QSlider::TicksAbove</enum>
-             </property>
-           </widget>
-        </item>
-        <item row="9" column="1">
-          <widget class="QLabel" name="expandingRadiusLabel">
-            <property name="text">
-              <string>Expanding Radius: 0</string>
-            </property>
-           </widget>
-        </item>
         </layout>
        </widget>
       </item>
-      <item row="2" column="0">
-       <spacer name="verticalSpacer_4">
+      <item row="3" column="0">
+       <layout class="QGridLayout" name="gridLayout_6"/>
+      </item>
+      <item row="4" column="0">
+       <spacer name="verticalSpacer">
         <property name="orientation">
          <enum>Qt::Vertical</enum>
         </property>
@@ -222,97 +335,8 @@
         </property>
        </spacer>
       </item>
-      <item row="0" column="1" rowspan="3">
-       <widget class="QScrollArea" name="scrollArea">
-        <property name="widgetResizable">
-         <bool>true</bool>
-        </property>
-        <widget class="QWidget" name="scrollAreaWidgetContents">
-         <property name="geometry">
-          <rect>
-           <x>0</x>
-           <y>0</y>
-           <width>236</width>
-           <height>397</height>
-          </rect>
-         </property>
-         <layout class="QGridLayout" name="gridLayout_5">
-          <item row="0" column="0" alignment="Qt::AlignHCenter">
-           <widget class="QLabel" name="legendLabel">
-            <property name="text">
-             <string>RAMP DISPLAYING</string>
-            </property>
-           </widget>
-          </item>
-         </layout>
-        </widget>
-       </widget>
-      </item>
      </layout>
     </item>
-    <item row="11" column="0">
-     <widget class="QGroupBox" name="extremeValuesGroup">
-      <property name="enabled">
-       <bool>false</bool>
-      </property>
-      <property name="title">
-       <string>Extreme Values</string>
-      </property>
-      <layout class="QGridLayout" name="gridLayout">
-       <item row="0" column="0">
-        <widget class="QLabel" name="extremeValuesMinLabel">
-         <property name="text">
-          <string>Min Value</string>
-         </property>
-        </widget>
-       </item>
-       <item row="2" column="0">
-        <widget class="QLabel" name="extremeValuesMaxLabel">
-         <property name="text">
-          <string>Max Value</string>
-         </property>
-        </widget>
-       </item>
-       <item row="2" column="1">
-        <widget class="DoubleEdit" name="maxBox">
-         <property name="text">
-          <string>2.00</string>
-         </property>
-         <property name="readOnly">
-          <bool>true</bool>
-         </property>
-        </widget>
-       </item>
-       <item row="2" column="2">
-        <widget class="QPushButton" name="zoomToMaxButton">
-         <property name="text">
-          <string>Zoom to max value</string>
-         </property>
-        </widget>
-       </item>
-       <item row="0" column="2">
-        <widget class="QPushButton" name="zoomToMinButton">
-         <property name="text">
-          <string>Zoom to min value</string>
-         </property>
-        </widget>
-       </item>
-       <item row="0" column="1">
-        <widget class="DoubleEdit" name="minBox">
-         <property name="text">
-          <string>0.00</string>
-         </property>
-         <property name="frame">
-          <bool>true</bool>
-         </property>
-         <property name="readOnly">
-          <bool>true</bool>
-         </property>
-        </widget>
-       </item>
-      </layout>
-     </widget>
-    </item>
    </layout>
   </widget>
  </widget>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 037d5bb4982b..33a48a19e0ef 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -89,8 +89,8 @@ class Display_property_plugin
   double gI = 1.;
   double bI = 0.;
 
-  double expand_radius = 0;
-  double maxEdgeLength = -1;
+  double expand_radius = 0.;
+  double maxEdgeLength = -1.;
 
   Color_ramp color_ramp;
   std::vector<QColor> color_map;
@@ -209,8 +209,8 @@ class Display_property_plugin
     connect(dock_widget->zoomToMaxButton, &QPushButton::pressed,
             this, &Display_property_plugin::on_zoomToMaxButton_pressed);
 
-    connect(dock_widget->expandingRadiusSlider, SIGNAL(valueChanged(int)),
-            this, SLOT(setExpandingRadius(int)));
+    connect(dock_widget->expandingRadiusSlider, &QSlider::valueChanged,
+            this, &Display_property_plugin::setExpandingRadius);
   }
 
 private Q_SLOTS:
@@ -512,6 +512,15 @@ private Q_SLOTS:
     {
       dock_widget->setEnabled(true);
       disableExtremeValues(); // only available after coloring
+
+      // Curvature property-specific slider
+      const std::string& property_name = dock_widget->propertyBox->currentText().toStdString();
+      const bool is_curvature_property = (property_name == "Interpolated Corrected Mean Curvature" ||
+                                          property_name == "Interpolated Corrected Gaussian Curvature");
+      dock_widget->expandingRadiusLabel->setVisible(is_curvature_property);
+      dock_widget->expandingRadiusSlider->setVisible(is_curvature_property);
+      dock_widget->expandingRadiusLabel->setEnabled(is_curvature_property);
+      dock_widget->expandingRadiusSlider->setEnabled(is_curvature_property);
     }
     else // no or broken property
     {
@@ -854,11 +863,12 @@ private Q_SLOTS:
     displaySMProperty<face_descriptor>("f:display_plugin_area", *sm);
   }
 
-  void setExpandingRadius(const int val_int)
+private Q_SLOTS:
+  void setExpandingRadius()
   {
     double sliderMin = dock_widget->expandingRadiusSlider->minimum();
     double sliderMax = dock_widget->expandingRadiusSlider->maximum() - sliderMin;
-    double val = val_int - sliderMin;
+    double val = dock_widget->expandingRadiusSlider->value() - sliderMin;
     sliderMin = 0;
 
     Scene_item* item = scene->item(scene->mainSelectionIndex());
@@ -878,7 +888,7 @@ private Q_SLOTS:
       if(num_edges(smesh) == 0)
       {
         expand_radius = 0;
-        dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
+        dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius: %1").arg(expand_radius));
         return;
       }
 
@@ -901,9 +911,10 @@ private Q_SLOTS:
     double outMax = 5 * maxEdgeLength, base = 1.2;
 
     expand_radius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
-    dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius : %1").arg(expand_radius));
+    dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius: %1").arg(expand_radius));
   }
 
+private:
   void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item,
                                            CurvatureType mu_index)
   {

From 15ad1f78eb521f66620f7f99792f4581ccf16db1 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 4 Aug 2023 11:20:52 +0200
Subject: [PATCH 0620/1398] Change example input to be analogous to uniform
 sizing

---
 .../isotropic_remeshing_with_sizing_example.cpp               | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index e0564d27178d..cb4cdef20ac8 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -1,6 +1,7 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/remesh.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 
 #include <fstream>
 
@@ -15,10 +16,9 @@ int main(int argc, char* argv[])
 //  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/hand.off");
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/nefertiti.off");
 //  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/cube.off");
-  std::ifstream input(filename);
 
   Mesh mesh;
-  if (!input || !(input >> mesh) || !CGAL::is_triangle_mesh(mesh)) {
+  if (!PMP::IO::read_polygon_mesh(filename, mesh) || !CGAL::is_triangle_mesh(mesh)) {
     std::cerr << "Not a valid input file." << std::endl;
     return 1;
   }

From 1f2c0f2471e02ca8a20894927a4c480141adedc7 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 4 Aug 2023 13:15:32 +0200
Subject: [PATCH 0621/1398] Remove extra

---
 .../Adaptive_sizing_field.h                   | 23 -------------------
 1 file changed, 23 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index dc14ae91d119..dea4dc457282 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -149,29 +149,6 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       return get(m_vertex_sizing_map, v);
     }
 
-  template <typename FaceRange>
-  void calc_sizing_map(const FaceRange& face_range)
-  {
-    if (face_range.size() == faces(m_pmesh).size())
-    {
-      // calculate curvature from the whole mesh
-      calc_sizing_map(m_pmesh);
-    }
-    else
-    {
-      // expand face selection and calculate curvature from it
-      std::vector<face_descriptor> selection(face_range.begin(), face_range.end());
-      auto is_selected = get(CGAL::dynamic_face_property_t<bool>(), m_pmesh);
-      for (face_descriptor f : faces(m_pmesh)) put(is_selected, f, false);
-      for (face_descriptor f : face_range)  put(is_selected, f, true);
-      CGAL::expand_face_selection(selection, m_pmesh, 1
-                                , is_selected, std::back_inserter(selection));
-      CGAL::Face_filtered_graph<PolygonMesh> ffg(m_pmesh, selection);
-
-      calc_sizing_map(ffg);
-    }
-  }
-
   boost::optional<FT> is_too_long(const halfedge_descriptor h) const
   {
     const FT sqlen = sqlength(h);

From 00b4b93d1cf613f91dfe9c4c8f815b08b86d1d1f Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Sun, 6 Aug 2023 12:16:31 +0200
Subject: [PATCH 0622/1398] Remove the adaptive sizing field dependency in
 remesh.h

---
 .../examples/Polygon_mesh_processing/CMakeLists.txt       | 8 ++------
 .../isotropic_remeshing_with_sizing_example.cpp           | 1 +
 .../internal/Isotropic_remeshing/Adaptive_sizing_field.h  | 1 +
 .../include/CGAL/Polygon_mesh_processing/remesh.h         | 1 -
 .../Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp | 3 +++
 5 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index 3644cc490978..590305c0c8ad 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -25,8 +25,8 @@ create_single_source_cgal_program("orient_polygon_soup_example.cpp")
 create_single_source_cgal_program("triangulate_polyline_example.cpp")
 create_single_source_cgal_program("mesh_slicer_example.cpp")
 #create_single_source_cgal_program( "remove_degeneracies_example.cpp")
-#create_single_source_cgal_program("isotropic_remeshing_example.cpp")
-#create_single_source_cgal_program("isotropic_remeshing_of_patch_example.cpp")
+create_single_source_cgal_program("isotropic_remeshing_example.cpp")
+create_single_source_cgal_program("isotropic_remeshing_of_patch_example.cpp")
 create_single_source_cgal_program("tangential_relaxation_example.cpp")
 create_single_source_cgal_program("surface_mesh_intersection.cpp")
 create_single_source_cgal_program("corefinement_SM.cpp")
@@ -69,10 +69,6 @@ if(TARGET CGAL::Eigen3_support)
   target_link_libraries(hole_filling_example_LCC PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("mesh_smoothing_example.cpp")
   target_link_libraries(mesh_smoothing_example PUBLIC CGAL::Eigen3_support)
-  create_single_source_cgal_program("isotropic_remeshing_example.cpp")
-  target_link_libraries(isotropic_remeshing_example PUBLIC CGAL::Eigen3_support)
-  create_single_source_cgal_program("isotropic_remeshing_of_patch_example.cpp")
-  target_link_libraries(isotropic_remeshing_of_patch_example PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("isotropic_remeshing_with_sizing_example.cpp")
   target_link_libraries(isotropic_remeshing_with_sizing_example PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("delaunay_remeshing_example.cpp")
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index cb4cdef20ac8..5d2ad63792ec 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -2,6 +2,7 @@
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/remesh.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h>
 
 #include <fstream>
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
index dea4dc457282..2b56d6691392 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
@@ -79,6 +79,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   template <typename FaceGraph>
   void calc_sizing_map(FaceGraph& face_graph)
   {
+    //todo ip: please check if this is good enough to store curvature
     typedef Principal_curvatures_and_directions<K> Principal_curvatures;
     typedef typename CGAL::dynamic_vertex_property_t<Principal_curvatures> Vertex_curvature_tag;
     typedef typename boost::property_map<FaceGraph,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 76d97ad9484a..dc11e0d52a4a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -19,7 +19,6 @@
 
 #include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h>
 #include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h>
-#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h>
 
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/boost/graph/named_params_helper.h>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 52076c1cc4c6..e495afc7e6e9 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -14,6 +14,7 @@
 
 #include <CGAL/iterator.h>
 #include <CGAL/Polygon_mesh_processing/remesh.h>
+#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h>
 #include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
 #include <CGAL/utility.h>
 #include <CGAL/property_map.h>
@@ -405,6 +406,7 @@ public Q_SLOTS:
         else //not edges_only
         {
             if(protect &&
+               edge_sizing_type == 0 && //todo ip: current solution for adaptive remeshing
                !CGAL::Polygon_mesh_processing::internal::constraints_are_short_enough(
                  *selection_item->polyhedron(),
                  selection_item->constrained_edges_pmap(),
@@ -672,6 +674,7 @@ public Q_SLOTS:
           }
 
           if(protect &&
+             edge_sizing_type == 0 && //todo ip: current solution for adaptive remeshing
              !CGAL::Polygon_mesh_processing::internal::constraints_are_short_enough(
                pmesh,
                ecm,

From 64257b9c665fb538ca7bc66aef47de5413335d6e Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Mon, 7 Aug 2023 09:11:49 +0200
Subject: [PATCH 0623/1398] Add remeshing quality test

---
 .../Polygon_mesh_processing/CMakeLists.txt    |   6 +-
 .../remeshing_quality_test.cpp                | 106 ++++++++++++++++++
 2 files changed, 110 insertions(+), 2 deletions(-)
 create mode 100644 Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index 8ba77a7ff15e..6ec0f6e00139 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -80,10 +80,12 @@ if(TARGET CGAL::Eigen3_support)
   target_link_libraries(test_shape_smoothing PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("delaunay_remeshing_test.cpp")
   target_link_libraries(delaunay_remeshing_test PUBLIC CGAL::Eigen3_support)
-  create_single_source_cgal_program("test_interpolated_corrected_curvatures.cpp")
-  target_link_libraries(test_interpolated_corrected_curvatures PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("test_decimation_of_planar_patches.cpp")
   target_link_libraries(test_decimation_of_planar_patches PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("test_interpolated_corrected_curvatures.cpp")
+  target_link_libraries(test_interpolated_corrected_curvatures PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("remeshing_quality_test.cpp" )
+  target_link_libraries(remeshing_quality_test PUBLIC CGAL::Eigen3_support)
 else()
   message(STATUS "NOTICE: Tests that use the Eigen library will not be compiled.")
 endif()
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
new file mode 100644
index 000000000000..6f04ffb07fb9
--- /dev/null
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
@@ -0,0 +1,106 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Polygon_mesh_processing/remesh.h>
+#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+
+#include <fstream>
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+typedef K::Point_3 Point_3;
+typedef CGAL::Surface_mesh<Point_3> Mesh;
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+int main(int argc, char* argv[])
+{
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/hand.off");
+
+  Mesh mesh;
+  if (!PMP::IO::read_polygon_mesh(filename, mesh) || !CGAL::is_triangle_mesh(mesh))
+  {
+    std::cerr << "Not a valid input file." << std::endl;
+    return 1;
+  }
+
+  std::cout << "Start remeshing of " << filename
+    << " (" << num_faces(mesh) << " faces)..." << std::endl;
+
+  const double tol = 0.001;
+  const std::pair edge_min_max{0.001, 0.5};
+  PMP::Adaptive_sizing_field sizing_field(tol, edge_min_max, faces(mesh), mesh);
+  const unsigned int nb_iter = 5;
+
+  PMP::isotropic_remeshing(
+      faces(mesh),
+      sizing_field,
+      mesh,
+      PMP::parameters::number_of_iterations(nb_iter).number_of_relaxation_steps(3)
+      );
+
+  std::cout << "Remeshing done, checking triangle quality...\n" << std::endl;
+  double qmin = std::numeric_limits<double>::max();      // minimum triangle quality
+  double qavg = 0.;           // average quality
+  double min_angle = std::numeric_limits<double>::max(); // minimum angle
+  double avg_min_angle = 0.; // average minimum angle
+  for (auto face : mesh.faces())
+  {
+    if (PMP::is_degenerate_triangle_face(face, mesh))
+    {
+      std::cout << "Found degenerate triangle!" << std::endl;
+      continue; //todo ip should something be done about this?
+    }
+
+    // Calculate Q(t) triangle quality indicator
+    std::vector<Mesh::Point> pts; pts.reserve(3);
+    for (auto vx : mesh.vertices_around_face(mesh.halfedge(face)))
+      pts.push_back(mesh.point(vx));
+
+    double half_perim = 0.; // half-perimeter
+    double lmax = 0.;       // longest edge
+    for (int i = 0; i < 3; ++i)
+    {
+      const double length = CGAL::sqrt(CGAL::squared_distance(pts[i], pts[(i + 1) % 2]));
+
+      half_perim += length;
+      if (length > lmax) lmax = length;
+    }
+    half_perim /= 2.;
+    const double area = CGAL::sqrt(CGAL::squared_area(pts[0], pts[1], pts[2]));
+
+    const double face_quality = 6. / CGAL::sqrt(3.) * area / half_perim / lmax;
+
+    qavg += face_quality;
+    if (face_quality < qmin) qmin = face_quality;
+
+    // Calculate minimum angle
+    const auto v0 = pts[1] - pts[0];
+    const auto v1 = pts[2] - pts[0];
+    const auto v2 = pts[2] - pts[1];
+
+    const double dotp0 = CGAL::scalar_product(v0,v1);
+    const double angle0 = acos(dotp0 / (sqrt(v0.squared_length()) * sqrt(v1.squared_length())));
+    const double dotp1 = CGAL::scalar_product(-v0, v2);
+    const double angle1 = acos(dotp1 / (sqrt(v0.squared_length()) * sqrt(v2.squared_length())));
+    const double angle2 = CGAL_PI - (angle0 + angle1);
+
+    double curr_min_angle = angle1;
+    if (angle1 < curr_min_angle) curr_min_angle = angle1;
+    if (angle2 < curr_min_angle) curr_min_angle = angle2;
+
+    avg_min_angle += curr_min_angle;
+    if (curr_min_angle < min_angle) min_angle = curr_min_angle;
+  }
+  qavg /= mesh.number_of_faces();
+  avg_min_angle /= mesh.number_of_faces();
+
+  std::cout << "Mesh size: " << mesh.number_of_faces() << std::endl;
+  std::cout << "Average quality: " << qavg << std::endl;
+  std::cout << "Minimum quality: " << qmin << std::endl;
+  std::cout << "Average minimum angle: " << avg_min_angle * 180. / CGAL_PI
+    << " deg" << std::endl;
+  std::cout << "Minimum angle: " << min_angle * 180. / CGAL_PI
+    << " deg" << std::endl;
+
+  return 0;
+}
\ No newline at end of file

From 36f8d39f92040b70d5f1d7d2f60d9c44ec4b81d4 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Mon, 7 Aug 2023 20:59:06 +0200
Subject: [PATCH 0624/1398] Remove extra code in tangential smoothing

---
 .../tangential_relaxation.h                   | 20 ++-----------------
 1 file changed, 2 insertions(+), 18 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index d2e955841f11..c0103f943299 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -363,12 +363,6 @@ void tangential_relaxation_with_sizing(const VertexRange& vertices,
   typedef typename GT::Vector_3 Vector_3;
   typedef typename GT::Point_3 Point_3;
 
-  //todo ip: alt calc
-  typename GT::Construct_vector_3 vector = gt.construct_vector_3_object();
-  typename GT::Compute_scalar_product_3 scalar_product = gt.compute_scalar_product_3_object();
-  typename GT::Compute_squared_length_3 squared_length = gt.compute_squared_length_3_object();
-  typename GT::Construct_cross_product_vector_3 cross_product = gt.construct_cross_product_vector_3_object();
-
   auto check_normals = [&](vertex_descriptor v)
   {
     bool first_run = true;
@@ -450,28 +444,18 @@ void tangential_relaxation_with_sizing(const VertexRange& vertices,
           interior_hedges.push_back(h);
       }
 
-      //todo ip: handle border edges with sizing field
       if (border_halfedges.empty())
       {
         const Vector_3& vn = vnormals.at(v);
         Vector_3 move = CGAL::NULL_VECTOR;
         double weight = 0;
-//        unsigned int star_size = 0;
         for(halfedge_descriptor h :interior_hedges)
         {
           // calculate weight
-          // need v0, v1 and v2
+          // need v, v1 and v2
           const vertex_descriptor v1 = target(next(h, tm), tm);
           const vertex_descriptor v2 = source(h, tm);
 
-          //todo ip- alt calc
-//          const Vector_3 vec0 = vector(get(vpm, v), get(vpm, v1));
-//          const Vector_3 vec1 = vector(get(vpm, v), get(vpm, v2));
-//          const double sqarea = squared_length(cross_product(vec0, vec1));
-//          const double face_weight = CGAL::approximate_sqrt(sqarea)
-//                                     / pow(1. / 3. * (sizing.get_sizing(v) + sizing.get_sizing(v1) + sizing.get_sizing(v2)), 2);
-
-          //todo ip- paper implementation
           const double tri_area = gt_area(get(vpm, v), get(vpm, v1), get(vpm, v2));
           const double face_weight = tri_area
                                    / (1. / 3. * (sizing.get_sizing(v) + sizing.get_sizing(v1) + sizing.get_sizing(v2)));
@@ -484,7 +468,7 @@ void tangential_relaxation_with_sizing(const VertexRange& vertices,
 
         barycenters.emplace_back(v, vn, get(vpm, v) + move);
       }
-      else
+      else //todo ip: do border edges need to be handled with the sizing field?
       {
         if (!relax_constraints) continue;
         Vector_3 vn(NULL_VECTOR);

From 4a8974d256ccd06cc275990099cba8aba9d899ad Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 8 Aug 2023 10:17:52 +0200
Subject: [PATCH 0625/1398] Move sizing classes to 'public' headers

---
 .../isotropic_remeshing_with_sizing_example.cpp              | 2 +-
 .../Isotropic_remeshing => }/Adaptive_sizing_field.h         | 0
 .../Isotropic_remeshing => }/Uniform_sizing_field.h          | 0
 .../include/CGAL/Polygon_mesh_processing/remesh.h            | 2 +-
 .../test/Polygon_mesh_processing/remeshing_quality_test.cpp  | 5 ++++-
 .../Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp    | 2 +-
 6 files changed, 7 insertions(+), 4 deletions(-)
 rename Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/{internal/Isotropic_remeshing => }/Adaptive_sizing_field.h (100%)
 rename Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/{internal/Isotropic_remeshing => }/Uniform_sizing_field.h (100%)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index 5d2ad63792ec..dacc3e02e1b2 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -2,7 +2,7 @@
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/remesh.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
-#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h>
+#include <CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h>
 
 #include <fstream>
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
similarity index 100%
rename from Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h
rename to Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
similarity index 100%
rename from Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h
rename to Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index dc11e0d52a4a..ac815afa51ab 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -18,7 +18,7 @@
 #include <CGAL/disable_warnings.h>
 
 #include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h>
-#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Uniform_sizing_field.h>
+#include <CGAL/Polygon_mesh_processing/Uniform_sizing_field.h>
 
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/boost/graph/named_params_helper.h>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
index 6f04ffb07fb9..01f97b210cb8 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
@@ -1,7 +1,7 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/remesh.h>
-#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h>
+#include <CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 
 #include <fstream>
@@ -38,6 +38,9 @@ int main(int argc, char* argv[])
       PMP::parameters::number_of_iterations(nb_iter).number_of_relaxation_steps(3)
       );
 
+  /*
+   * More information on quality metrics can be found here: https://ieeexplore.ieee.org/document/9167456
+   */
   std::cout << "Remeshing done, checking triangle quality...\n" << std::endl;
   double qmin = std::numeric_limits<double>::max();      // minimum triangle quality
   double qavg = 0.;           // average quality
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index e495afc7e6e9..a63e88a69031 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -14,7 +14,7 @@
 
 #include <CGAL/iterator.h>
 #include <CGAL/Polygon_mesh_processing/remesh.h>
-#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Adaptive_sizing_field.h>
+#include <CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h>
 #include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
 #include <CGAL/utility.h>
 #include <CGAL/property_map.h>

From 050c7f951235904b5a8251860f26000b18b68406 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Thu, 10 Aug 2023 21:33:27 +0200
Subject: [PATCH 0626/1398] Add split_long_edges functionality using adaptive
 sizing field as an input

---
 .../Isotropic_remeshing/remesh_impl.h         |  36 ++++---
 .../CGAL/Polygon_mesh_processing/remesh.h     |  26 ++++-
 .../PMP/Isotropic_remeshing_plugin.cpp        | 101 +++++++++++++++---
 3 files changed, 130 insertions(+), 33 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 80ab1f342a0c..bb65af3e2d10 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -383,19 +383,17 @@ namespace internal {
       }
     }
 
-
     // split edges of edge_range that have their length > high
     // Note: only used to split a range of edges provided as input
-    template<typename EdgeRange>
+    template<typename EdgeRange, typename SizingFunction>
     void split_long_edges(const EdgeRange& edge_range,
-                          const double& high)
+                          SizingFunction& sizing)
     {
 
 #ifdef CGAL_PMP_REMESHING_VERBOSE
-      std::cout << "Split long edges (" << high << ")...";
-      std::cout.flush();
+//      std::cout << "Split long edges (" << high << ")...";
+//      std::cout.flush();
 #endif
-      double sq_high = high*high;
 
       //collect long edges
       typedef std::pair<halfedge_descriptor, double> H_and_sql;
@@ -406,9 +404,9 @@ namespace internal {
         );
       for(edge_descriptor e : edge_range)
       {
-        double sqlen = sqlength(e);
-        if (sqlen > sq_high)
-          long_edges.emplace(halfedge(e, mesh_), sqlen);
+        boost::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_));
+        if(sqlen != boost::none)
+          long_edges.emplace(halfedge(e, mesh_), sqlen.get());
       }
 
       //split long edges
@@ -439,15 +437,19 @@ namespace internal {
 #ifdef CGAL_PMP_REMESHING_VERY_VERBOSE
         std::cout << "   refinement point : " << refinement_point << std::endl;
 #endif
+        //update sizing field with the new point
+        if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM>>)
+          sizing.update_sizing_map(vnew);
 
         //check sub-edges
-        double sqlen_new = 0.25 * sqlen;
-        if (sqlen_new > sq_high)
-        {
-          //if it was more than twice the "long" threshold, insert them
-          long_edges.emplace(hnew, sqlen_new);
-          long_edges.emplace(next(hnew, mesh_), sqlen_new);
-        }
+        //if it was more than twice the "long" threshold, insert them
+        boost::optional<double> sqlen_new = sizing.is_too_long(hnew);
+        if(sqlen_new != boost::none)
+          long_edges.emplace(hnew, sqlen_new.get());
+
+        sqlen_new = sizing.is_too_long(next(hnew, mesh_));
+        if (sqlen_new != boost::none)
+          long_edges.emplace(next(hnew, mesh_), sqlen_new.get());
 
         //insert new edges to keep triangular faces, and update long_edges
         if (!is_border(hnew, mesh_))
@@ -552,7 +554,7 @@ namespace internal {
         halfedge_added(hnew, status(he));
         halfedge_added(hnew_opp, status(opposite(he, mesh_)));
 
-        //todo ip-add: already updating sizing here because of is_too_long checks below
+        //update sizing field with the new point
         if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM>>)
           sizing.update_sizing_map(vnew);
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index ac815afa51ab..7d88ad209f69 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -424,9 +424,10 @@ void isotropic_remeshing(const FaceRange& faces
 */
 template<typename PolygonMesh
        , typename EdgeRange
+       , typename SizingFunction
        , typename NamedParameters = parameters::Default_named_parameters>
 void split_long_edges(const EdgeRange& edges
-                    , const double& max_length
+                    , SizingFunction& sizing
                     , PolygonMesh& pmesh
                     , const NamedParameters& np = parameters::default_values())
 {
@@ -473,7 +474,28 @@ void split_long_edges(const EdgeRange& edges
              fimap,
              false/*need aabb_tree*/);
 
-  remesher.split_long_edges(edges, max_length);
+    // check if sizing field needs updating
+    if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM>>)
+    {
+      //todo ip: check if sizing field needs to be checked and updated here
+    }
+
+     remesher.split_long_edges(edges, sizing);
+}
+
+//todo ip: documentation
+// overload when using max_length
+template<typename PolygonMesh
+       , typename EdgeRange
+       , typename NamedParameters = parameters::Default_named_parameters>
+void split_long_edges(const EdgeRange& edges
+                    , const double max_length
+                    , PolygonMesh& pmesh
+                    , const NamedParameters& np = parameters::default_values())
+{
+  // construct the uniform field, 3/4 as m_sq_long is stored with 4/3 of length
+  Uniform_sizing_field sizing(3. / 4. * max_length, pmesh);
+  split_long_edges(edges, sizing, pmesh, np);
 }
 
 } //end namespace Polygon_mesh_processing
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index a63e88a69031..00e34c5e63eb 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -294,9 +294,13 @@ class Polyhedron_demo_isotropic_remeshing_plugin :
       PMP::triangulate_face(f_and_p.first, *f_and_p.second);
   }
 
-  void do_split_edges(Scene_polyhedron_selection_item* selection_item,
+  void do_split_edges(const int edge_sizing_type,
+                      Scene_polyhedron_selection_item* selection_item,
                       SMesh& pmesh,
-                      double target_length)
+                      const double target_length,
+                      const double error_tol,
+                      const double min_length,
+                      const double max_length)
   {
     std::vector<edge_descriptor> p_edges;
     for(edge_descriptor e : edges(pmesh))
@@ -314,12 +318,32 @@ class Polyhedron_demo_isotropic_remeshing_plugin :
       }
     }
     if (!p_edges.empty())
-      CGAL::Polygon_mesh_processing::split_long_edges(
-            p_edges
-            , target_length
-            , *selection_item->polyhedron()
-            , CGAL::parameters::geom_traits(EPICK())
+    {
+      if (edge_sizing_type == 0)
+      {
+        CGAL::Polygon_mesh_processing::split_long_edges(
+              p_edges
+              , target_length
+              , *selection_item->polyhedron()
+              , CGAL::parameters::geom_traits(EPICK())
+              .edge_is_constrained_map(selection_item->constrained_edges_pmap()));
+      }
+      else if (edge_sizing_type == 1)
+      {
+        std::pair<double, double> edge_min_max{min_length, max_length};
+        CGAL::Polygon_mesh_processing::Adaptive_sizing_field<FaceGraph> adaptive_sizing(
+              error_tol
+              , edge_min_max
+              , faces(*selection_item->polyhedron())
+              , *selection_item->polyhedron());
+        CGAL::Polygon_mesh_processing::split_long_edges(
+          p_edges
+          , adaptive_sizing
+          , *selection_item->polyhedron()
+          , CGAL::parameters::geom_traits(EPICK())
             .edge_is_constrained_map(selection_item->constrained_edges_pmap()));
+      }
+    }
     else
       std::cout << "No selected or boundary edges to be split" << std::endl;
   }
@@ -401,7 +425,7 @@ public Q_SLOTS:
       {
         if (edges_only)
         {
-          do_split_edges(selection_item, pmesh, target_length);
+          do_split_edges(edge_sizing_type, selection_item, pmesh, target_length, error_tol, min_length, max_length);
         }
         else //not edges_only
         {
@@ -438,7 +462,7 @@ public Q_SLOTS:
               }
               else
               {
-                do_split_edges(selection_item, pmesh, target_length);
+                do_split_edges(edge_sizing_type, selection_item, pmesh, target_length, error_tol, min_length, max_length);
               }
             }
 
@@ -637,6 +661,9 @@ public Q_SLOTS:
           if (!edges_to_split.empty())
           {
             if (fpmap_valid)
+            {
+              if (edge_sizing_type == 0)
+              {
               CGAL::Polygon_mesh_processing::split_long_edges(
                 edges_to_split
                 , target_length
@@ -644,13 +671,49 @@ public Q_SLOTS:
                 , CGAL::parameters::geom_traits(EPICK())
                 . edge_is_constrained_map(eif)
                 . face_patch_map(fpmap));
+              }
+              else if (edge_sizing_type == 1)
+              {
+                std::pair<double, double> edge_min_max{min_length, max_length};
+                PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol
+                                                                           , edge_min_max
+                                                                           , faces(pmesh)
+                                                                           , pmesh);
+                CGAL::Polygon_mesh_processing::split_long_edges(
+                  edges_to_split
+                  , target_length
+                  , pmesh
+                  , CGAL::parameters::geom_traits(EPICK())
+                  . edge_is_constrained_map(eif)
+                  . face_patch_map(fpmap));
+              }
+            }
             else
+            {
+              if (edge_sizing_type == 0)
+              {
               CGAL::Polygon_mesh_processing::split_long_edges(
                 edges_to_split
                 , target_length
                 , pmesh
                 , CGAL::parameters::geom_traits(EPICK())
                 . edge_is_constrained_map(eif));
+              }
+              else if (edge_sizing_type = 1)
+              {
+                std::pair<double, double> edge_min_max{min_length, max_length};
+                PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol
+                                                                             , edge_min_max
+                                                                             , faces(pmesh)
+                                                                             , pmesh);
+                CGAL::Polygon_mesh_processing::split_long_edges(
+                  edges_to_split
+                  , adaptive_sizing_field
+                  , pmesh
+                  , CGAL::parameters::geom_traits(EPICK())
+                  . edge_is_constrained_map(eif));
+              }
+            }
           }
           else
             std::cout << "No border to be split" << std::endl;
@@ -968,10 +1031,25 @@ public Q_SLOTS:
         for(halfedge_descriptor h : border)
           border_edges.push_back(edge(h, *poly_item->polyhedron()));
 
+        if (edge_sizing_type_ == 0)
+        {
         CGAL::Polygon_mesh_processing::split_long_edges(
             border_edges
           , target_length_
           , *poly_item->polyhedron());
+        }
+        else if (edge_sizing_type_ == 1)
+        {
+          std::pair<double, double> edge_min_max{min_length_, max_length_};
+          PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol_
+                                                                     , edge_min_max
+                                                                     , faces(*poly_item->polyhedron())
+                                                                     , *poly_item->polyhedron());
+          CGAL::Polygon_mesh_processing::split_long_edges(
+            border_edges
+          , target_length_
+          , *poly_item->polyhedron());
+        }
       }
       else
       {
@@ -1130,9 +1208,6 @@ public Q_SLOTS:
       ui.smooth1D_label->setEnabled(false);
       ui.smooth1D_checkbox->setEnabled(false);
       ui.smooth1D_checkbox->setChecked(false);
-
-      ui.edgeSizing_type_combo_box->setCurrentIndex(0);
-      ui.edgeSizing_type_combo_box->setEnabled(false);
     }
     else
     {
@@ -1146,8 +1221,6 @@ public Q_SLOTS:
 
       ui.smooth1D_label->setEnabled(true);
       ui.smooth1D_checkbox->setEnabled(true);
-
-      ui.edgeSizing_type_combo_box->setEnabled(true);
     }
   }
 

From 600f72fd0ecb521eeafba5f897e0b94548ebe72d Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 11 Aug 2023 15:09:23 +0200
Subject: [PATCH 0627/1398] Reintroduce constraints_are_short_enough for
 adaptive remeshing

---
 .../Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp     | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 00e34c5e63eb..940d576735e4 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -430,7 +430,6 @@ public Q_SLOTS:
         else //not edges_only
         {
             if(protect &&
-               edge_sizing_type == 0 && //todo ip: current solution for adaptive remeshing
                !CGAL::Polygon_mesh_processing::internal::constraints_are_short_enough(
                  *selection_item->polyhedron(),
                  selection_item->constrained_edges_pmap(),
@@ -737,7 +736,6 @@ public Q_SLOTS:
           }
 
           if(protect &&
-             edge_sizing_type == 0 && //todo ip: current solution for adaptive remeshing
              !CGAL::Polygon_mesh_processing::internal::constraints_are_short_enough(
                pmesh,
                ecm,
@@ -1313,7 +1311,7 @@ public Q_SLOTS:
     ui.nbIterations_spinbox->setValue(1);
 
     ui.edgeSizing_type_combo_box->setCurrentIndex(0);
-    on_edgeSizing_type_combo_box_changed(0); //todo ip otherwise it shows all remeshing variables
+    on_edgeSizing_type_combo_box_changed(0);
     ui.protect_checkbox->setChecked(false);
     ui.smooth1D_checkbox->setChecked(true);
 

From f589b054ed89d59e3554a416728d8ead6ab3f837 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 11 Aug 2023 15:46:21 +0200
Subject: [PATCH 0628/1398] Documentation update in remesh.h

---
 .../CGAL/Polygon_mesh_processing/remesh.h     | 59 ++++++++-----------
 1 file changed, 26 insertions(+), 33 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 7d88ad209f69..e22b48013068 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -31,16 +31,6 @@ namespace CGAL {
 
 namespace Polygon_mesh_processing {
 
-/*! \todo document me or merge the doc with the original overload*/
-template<typename PolygonMesh
-       , typename FaceRange
-       , typename SizingFunction
-       , typename NamedParameters>
-void isotropic_remeshing(const FaceRange& faces
-                       , SizingFunction& sizing
-                       , PolygonMesh& pmesh
-                       , const NamedParameters& np);
-
 /*!
 * \ingroup PMP_meshing_grp
 *
@@ -54,12 +44,14 @@ void isotropic_remeshing(const FaceRange& faces
 *         and `boost::graph_traits<PolygonMesh>::%halfedge_descriptor` must be
 *         models of `Hashable`.
 * @tparam FaceRange range of `boost::graph_traits<PolygonMesh>::%face_descriptor`,
-          model of `Range`. Its iterator type is `ForwardIterator`.
+*         model of `Range`. Its iterator type is `ForwardIterator`.
+* @tparam SizingFunction model of `Sizing_field`
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
 * @param pmesh a polygon mesh with triangulated surface patches to be remeshed
 * @param faces the range of triangular faces defining one or several surface patches to be remeshed
-* @param target_edge_length the edge length that is targeted in the remeshed patch.
+* @param sizing uniform or adaptive sizing field that determines a target length for individual edges.
+*        If a number is passed, it uses uniform sizing with the number as a target edge length.
 *        If `0` is passed then only the edge-flip, tangential relaxation, and projection steps will be done.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
@@ -202,23 +194,6 @@ void isotropic_remeshing(const FaceRange& faces
 *      get a point which is exactly on the surface.
 *
 */
-template<typename PolygonMesh
-       , typename FaceRange
-       , typename NamedParameters = parameters::Default_named_parameters>
-void isotropic_remeshing(const FaceRange& faces
-                       , const double target_edge_length
-                       , PolygonMesh& pmesh
-                       , const NamedParameters& np = parameters::default_values())
-{
-  typedef Uniform_sizing_field<PolygonMesh> Default_sizing;
-  Default_sizing sizing(target_edge_length, pmesh);
-  isotropic_remeshing<PolygonMesh, FaceRange, Default_sizing, NamedParameters>(
-    faces,
-    sizing,
-    pmesh,
-    np);
-}
-
 template<typename PolygonMesh
        , typename FaceRange
        , typename SizingFunction
@@ -360,6 +335,24 @@ void isotropic_remeshing(const FaceRange& faces
 #endif
 }
 
+// Convenience overload when using target_edge_length for sizing
+template<typename PolygonMesh
+  , typename FaceRange
+  , typename NamedParameters = parameters::Default_named_parameters>
+void isotropic_remeshing(const FaceRange& faces
+                         , const double target_edge_length
+                         , PolygonMesh& pmesh
+                         , const NamedParameters& np = parameters::default_values())
+{
+  typedef Uniform_sizing_field<PolygonMesh> Default_sizing;
+  Default_sizing sizing(target_edge_length, pmesh);
+  isotropic_remeshing<PolygonMesh, FaceRange, Default_sizing, NamedParameters>(
+    faces,
+    sizing,
+    pmesh,
+    np);
+}
+
 /*!
 * \ingroup PMP_meshing_grp
 * @brief splits the edges listed in `edges` into sub-edges
@@ -374,12 +367,13 @@ void isotropic_remeshing(const FaceRange& faces
 *         has an internal property map for `CGAL::vertex_point_t`.
 * @tparam EdgeRange range of `boost::graph_traits<PolygonMesh>::%edge_descriptor`,
 *   model of `Range`. Its iterator type is `InputIterator`.
+* @tparam SizingFunction model of `Sizing_field`
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
 * @param pmesh a polygon mesh
 * @param edges the range of edges to be split if they are longer than given threshold
-* @param max_length the edge length above which an edge from `edges` is split
-*        into to sub-edges
+* @param sizing the sizing function that is used to split edges from 'edges' list. If a number is passed,
+*        all edges longer than the number are split into sub-edges.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 
 * \cgalNamedParamsBegin
@@ -483,8 +477,7 @@ void split_long_edges(const EdgeRange& edges
      remesher.split_long_edges(edges, sizing);
 }
 
-//todo ip: documentation
-// overload when using max_length
+// Convenience overload when using max_length for sizing
 template<typename PolygonMesh
        , typename EdgeRange
        , typename NamedParameters = parameters::Default_named_parameters>

From 66721bbcd9ea9a4edd6423d2974b403a358a93c7 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Sat, 12 Aug 2023 17:36:16 +0200
Subject: [PATCH 0629/1398] Add precondition 'remeshing mesh == sizing field
 mesh'

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h      | 2 ++
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h       | 1 +
 .../internal/Isotropic_remeshing/Sizing_field.h               | 1 +
 .../include/CGAL/Polygon_mesh_processing/remesh.h             | 4 ++++
 4 files changed, 8 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 2b56d6691392..543d6645844a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -213,6 +213,8 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     put(m_vertex_sizing_map, v, vertex_size);
   }
 
+  const PolygonMesh& get_mesh() const { return m_pmesh; }
+
   //todo ip: is_protected_constraint_too_long() from PR
 
 private:
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index a36c30aa712c..1cc96e883444 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -92,6 +92,7 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
                           get(vpmap, source(h, m_pmesh)));
   }
 
+  const PolygonMesh& get_mesh() const { return m_pmesh; }
 
 private:
   FT m_sq_short;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
index 3640e14c092d..b60148c3e73d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
@@ -45,6 +45,7 @@ class Sizing_field
                                           const vertex_descriptor vb) const = 0;
   virtual boost::optional<FT> is_too_short(const halfedge_descriptor h) const = 0;
   virtual Point_3 split_placement(const halfedge_descriptor h) const = 0;
+  virtual const PolygonMesh& get_mesh() const = 0;
 
 };
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index e22b48013068..91a9ed2d6074 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -206,6 +206,10 @@ void isotropic_remeshing(const FaceRange& faces
   if (std::begin(faces)==std::end(faces))
     return;
 
+  //todo ip: precondition or something else?
+  CGAL_precondition_msg(&(sizing.get_mesh()) == &pmesh, "Input mesh is not the same "
+                                                        "as the one used for the sizing field!");
+
   typedef PolygonMesh PM;
   typedef typename boost::graph_traits<PM>::vertex_descriptor vertex_descriptor;
   typedef typename boost::graph_traits<PM>::edge_descriptor edge_descriptor;

From ee640c91dd6817ca8afc05086e4d4f282693f450 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Sun, 13 Aug 2023 10:41:16 +0200
Subject: [PATCH 0630/1398] Handle the special case when target_edge_length is
 0

---
 .../CGAL/Polygon_mesh_processing/remesh.h     | 24 +++++++++----------
 1 file changed, 11 insertions(+), 13 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 91a9ed2d6074..d146fb57597e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -339,22 +339,20 @@ void isotropic_remeshing(const FaceRange& faces
 #endif
 }
 
-// Convenience overload when using target_edge_length for sizing
+// Overload when using target_edge_length for sizing
 template<typename PolygonMesh
-  , typename FaceRange
-  , typename NamedParameters = parameters::Default_named_parameters>
+       , typename FaceRange
+       , typename NamedParameters = parameters::Default_named_parameters>
 void isotropic_remeshing(const FaceRange& faces
-                         , const double target_edge_length
-                         , PolygonMesh& pmesh
-                         , const NamedParameters& np = parameters::default_values())
+                       , const double target_edge_length
+                       , PolygonMesh& pmesh
+                       , const NamedParameters& np = parameters::default_values())
 {
-  typedef Uniform_sizing_field<PolygonMesh> Default_sizing;
-  Default_sizing sizing(target_edge_length, pmesh);
-  isotropic_remeshing<PolygonMesh, FaceRange, Default_sizing, NamedParameters>(
-    faces,
-    sizing,
-    pmesh,
-    np);
+  Uniform_sizing_field<PolygonMesh> sizing(target_edge_length, pmesh);
+  if (target_edge_length > 0)
+    isotropic_remeshing(faces, sizing, pmesh, np);
+  else
+    isotropic_remeshing(faces, sizing, pmesh, np.do_split(false).do_collapse(false));
 }
 
 /*!

From 6ee23c6fdddabbb95bdf1109b4f571f34f70966f Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 15 Aug 2023 20:07:58 +0200
Subject: [PATCH 0631/1398] Replace pmesh with vertex property maps in sizing
 field classes

---
 .../Adaptive_sizing_field.h                   | 78 +++++++++----------
 .../Uniform_sizing_field.h                    | 45 +++++------
 .../Isotropic_remeshing/Sizing_field.h        | 16 ++--
 .../Isotropic_remeshing/remesh_impl.h         | 36 ++++-----
 .../CGAL/Polygon_mesh_processing/remesh.h     |  8 +-
 .../PMP/Isotropic_remeshing_plugin.cpp        |  2 +-
 6 files changed, 89 insertions(+), 96 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 543d6645844a..1e8151c14b32 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -38,10 +38,11 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   typedef typename Base::face_descriptor     face_descriptor;
   typedef typename Base::halfedge_descriptor halfedge_descriptor;
   typedef typename Base::vertex_descriptor   vertex_descriptor;
+  typedef typename Base::DefaultVPMap DefaultVPMap;
 
   typedef typename CGAL::dynamic_vertex_property_t<FT> Vertex_property_tag;
   typedef typename boost::property_map<PolygonMesh,
-                                       Vertex_property_tag>::type Vertex_sizing_map;
+                                       Vertex_property_tag>::type VertexSizingMap;
 
   template <typename FaceRange>
   Adaptive_sizing_field(const double tol
@@ -51,25 +52,24 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
     : tol(tol)
     , m_short(edge_len_min_max.first)
     , m_long(edge_len_min_max.second)
-    , m_pmesh(pmesh)
+    , m_vpmap(get(CGAL::vertex_point, pmesh))
+    , m_vertex_sizing_map(get(Vertex_property_tag(), pmesh))
   {
-    m_vertex_sizing_map = get(Vertex_property_tag(), m_pmesh);
-
-    if (face_range.size() == faces(m_pmesh).size())
+    if (face_range.size() == faces(pmesh).size())
     {
       // calculate curvature from the whole mesh
-      calc_sizing_map(m_pmesh);
+      calc_sizing_map(pmesh);
     }
     else
     {
       // expand face selection and calculate curvature from it
       std::vector<face_descriptor> selection(face_range.begin(), face_range.end());
-      auto is_selected = get(CGAL::dynamic_face_property_t<bool>(), m_pmesh);
-      for (face_descriptor f : faces(m_pmesh)) put(is_selected, f, false);
+      auto is_selected = get(CGAL::dynamic_face_property_t<bool>(), pmesh);
+      for (face_descriptor f : faces(pmesh)) put(is_selected, f, false);
       for (face_descriptor f : face_range)  put(is_selected, f, true);
-      CGAL::expand_face_selection(selection, m_pmesh, 1
+      CGAL::expand_face_selection(selection, pmesh, 1
                                 , is_selected, std::back_inserter(selection));
-      CGAL::Face_filtered_graph<PolygonMesh> ffg(m_pmesh, selection);
+      CGAL::Face_filtered_graph<PolygonMesh> ffg(pmesh, selection);
 
       calc_sizing_map(ffg);
     }
@@ -134,14 +134,12 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   FT sqlength(const vertex_descriptor va,
               const vertex_descriptor vb) const
   {
-    typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
-      vpmap = get(CGAL::vertex_point, m_pmesh);
-    return FT(CGAL::squared_distance(get(vpmap, va), get(vpmap, vb)));
+    return FT(CGAL::squared_distance(get(m_vpmap, va), get(m_vpmap, vb)));
   }
 
-  FT sqlength(const halfedge_descriptor& h) const
+  FT sqlength(const halfedge_descriptor& h, const PolygonMesh& pmesh) const
   {
-    return sqlength(target(h, m_pmesh), source(h, m_pmesh));
+    return sqlength(target(h, pmesh), source(h, pmesh));
   }
 
 public:
@@ -150,13 +148,13 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       return get(m_vertex_sizing_map, v);
     }
 
-  boost::optional<FT> is_too_long(const halfedge_descriptor h) const
+  boost::optional<FT> is_too_long(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
-    const FT sqlen = sqlength(h);
-    FT sqtarg_len = CGAL::square(4./3. * CGAL::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
-                                                   get(m_vertex_sizing_map, target(h, m_pmesh))));
-    CGAL_assertion(get(m_vertex_sizing_map, source(h, m_pmesh)));
-    CGAL_assertion(get(m_vertex_sizing_map, target(h, m_pmesh)));
+    const FT sqlen = sqlength(h, pmesh);
+    FT sqtarg_len = CGAL::square(4./3. * CGAL::min(get(m_vertex_sizing_map, source(h, pmesh)),
+                                                   get(m_vertex_sizing_map, target(h, pmesh))));
+    CGAL_assertion(get(m_vertex_sizing_map, source(h, pmesh)));
+    CGAL_assertion(get(m_vertex_sizing_map, target(h, pmesh)));
     if(sqlen > sqtarg_len)
       return sqlen;
     else
@@ -177,52 +175,46 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       return boost::none;
   }
 
-  boost::optional<FT> is_too_short(const halfedge_descriptor h) const
+  boost::optional<FT> is_too_short(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
-    const FT sqlen = sqlength(h);
-    FT sqtarg_len = CGAL::square(4./5. * CGAL::min(get(m_vertex_sizing_map, source(h, m_pmesh)),
-                                                   get(m_vertex_sizing_map, target(h, m_pmesh))));
-    CGAL_assertion(get(m_vertex_sizing_map, source(h, m_pmesh)));
-    CGAL_assertion(get(m_vertex_sizing_map, target(h, m_pmesh)));
+    const FT sqlen = sqlength(h, pmesh);
+    FT sqtarg_len = CGAL::square(4./5. * CGAL::min(get(m_vertex_sizing_map, source(h, pmesh)),
+                                                   get(m_vertex_sizing_map, target(h, pmesh))));
+    CGAL_assertion(get(m_vertex_sizing_map, source(h, pmesh)));
+    CGAL_assertion(get(m_vertex_sizing_map, target(h, pmesh)));
     if (sqlen < sqtarg_len)
       return sqlen;
     else
       return boost::none;
   }
 
-  virtual Point_3 split_placement(const halfedge_descriptor h) const
+  virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
-    typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
-      vpmap = get(CGAL::vertex_point, m_pmesh);
-    return CGAL::midpoint(get(vpmap, target(h, m_pmesh)),
-                          get(vpmap, source(h, m_pmesh)));
+    return CGAL::midpoint(get(m_vpmap, target(h, pmesh)),
+                          get(m_vpmap, source(h, pmesh)));
   }
 
-  void update_sizing_map(const vertex_descriptor v)
+  void update_sizing_map(const vertex_descriptor v, const PolygonMesh& pmesh)
   {
     // calculating it as the average of two vertices on other ends
     // of halfedges as updating is done during an edge split
     FT vertex_size = 0;
-    CGAL_assertion(CGAL::halfedges_around_target(v, m_pmesh).size() == 2);
-    for (halfedge_descriptor ha: CGAL::halfedges_around_target(v, m_pmesh))
+    CGAL_assertion(CGAL::halfedges_around_target(v, pmesh).size() == 2);
+    for (halfedge_descriptor ha: CGAL::halfedges_around_target(v, pmesh))
     {
-      vertex_size += get(m_vertex_sizing_map, source(ha, m_pmesh));
+      vertex_size += get(m_vertex_sizing_map, source(ha, pmesh));
     }
-    vertex_size /= CGAL::halfedges_around_target(v, m_pmesh).size();
+    vertex_size /= CGAL::halfedges_around_target(v, pmesh).size();
 
     put(m_vertex_sizing_map, v, vertex_size);
   }
 
-  const PolygonMesh& get_mesh() const { return m_pmesh; }
-
-  //todo ip: is_protected_constraint_too_long() from PR
-
 private:
   const FT tol;
   const FT m_short;
   const FT m_long;
-  PolygonMesh& m_pmesh;
-  Vertex_sizing_map m_vertex_sizing_map;
+  const DefaultVPMap m_vpmap;
+  VertexSizingMap m_vertex_sizing_map;
 };
 
 }//end namespace Polygon_mesh_processing
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 1cc96e883444..2e047548adaa 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -23,11 +23,12 @@ namespace CGAL
 {
 namespace Polygon_mesh_processing
 {
-template <class PolygonMesh>
-class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
+template <class PolygonMesh,
+          class VPMap =  typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
+class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
 {
 private:
-  typedef CGAL::Sizing_field<PolygonMesh> Base;
+  typedef CGAL::Sizing_field<PolygonMesh, VPMap> Base;
 
 public:
   typedef typename Base::FT         FT;
@@ -35,30 +36,34 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   typedef typename Base::halfedge_descriptor halfedge_descriptor;
   typedef typename Base::vertex_descriptor   vertex_descriptor;
 
-  Uniform_sizing_field(const FT& size, const PolygonMesh& pmesh)
+  Uniform_sizing_field<PolygonMesh, VPMap>(const FT size, const VPMap& vpmap)
     : m_sq_short( CGAL::square(4./5. * size))
     , m_sq_long(  CGAL::square(4./3. * size))
-    , m_pmesh(pmesh)
+    , m_vpmap(vpmap)
+  {}
+
+  Uniform_sizing_field<PolygonMesh>(const FT& size, const PolygonMesh& pmesh)
+    : m_sq_short( CGAL::square(4./5. * size))
+    , m_sq_long(  CGAL::square(4./3. * size))
+    , m_vpmap(get(CGAL::vertex_point, pmesh))
   {}
 
 private:
   FT sqlength(const vertex_descriptor va,
               const vertex_descriptor vb) const
   {
-    typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
-      vpmap = get(CGAL::vertex_point, m_pmesh);
-    return FT(CGAL::squared_distance(get(vpmap, va), get(vpmap, vb)));
+    return FT(CGAL::squared_distance(get(m_vpmap, va), get(m_vpmap, vb)));
   }
 
-  FT sqlength(const halfedge_descriptor& h) const
+  FT sqlength(const halfedge_descriptor& h, const PolygonMesh& pmesh) const
   {
-    return sqlength(target(h, m_pmesh), source(h, m_pmesh));
+    return sqlength(target(h, pmesh), source(h, pmesh));
   }
 
 public:
-  boost::optional<FT> is_too_long(const halfedge_descriptor h) const
+  boost::optional<FT> is_too_long(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
-    const FT sqlen = sqlength(h);
+    const FT sqlen = sqlength(h, pmesh);
     if(sqlen > m_sq_long)
       return sqlen;
     else
@@ -75,29 +80,25 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       return boost::none;
   }
 
-  boost::optional<FT> is_too_short(const halfedge_descriptor h) const
+  boost::optional<FT> is_too_short(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
-    const FT sqlen = sqlength(h);
+    const FT sqlen = sqlength(h, pmesh);
     if (sqlen < m_sq_long)
       return sqlen;
     else
       return boost::none;
   }
 
-  virtual Point_3 split_placement(const halfedge_descriptor h) const
+  virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
-    typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type
-      vpmap = get(CGAL::vertex_point, m_pmesh);
-    return CGAL::midpoint(get(vpmap, target(h, m_pmesh)),
-                          get(vpmap, source(h, m_pmesh)));
+    return CGAL::midpoint(get(m_vpmap, target(h, pmesh)),
+                          get(m_vpmap, source(h, pmesh)));
   }
 
-  const PolygonMesh& get_mesh() const { return m_pmesh; }
-
 private:
   FT m_sq_short;
   FT m_sq_long;
-  const PolygonMesh& m_pmesh;
+  const VPMap m_vpmap;
 };
 
 }//end namespace Polygon_mesh_processing
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
index b60148c3e73d..d4109708352b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
@@ -23,14 +23,17 @@ namespace CGAL
 /*!
 * Sizing field virtual class
 */
-template <class PolygonMesh>
+template <class PolygonMesh,
+          class VPMap = typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
 class Sizing_field
 {
 private:
   typedef PolygonMesh                     PM;
-  typedef typename boost::property_map<PM, boost::vertex_point_t>::const_type VPMap;
   typedef typename boost::property_traits<VPMap>::value_type Point;
 
+protected:
+  typedef typename boost::property_map<PM, boost::vertex_point_t>::const_type DefaultVPMap;
+
 public:
   typedef typename CGAL::Kernel_traits<Point>::Kernel K;
   typedef typename boost::graph_traits<PM>::face_descriptor     face_descriptor;
@@ -40,12 +43,13 @@ class Sizing_field
   typedef typename K::FT                                        FT;
 
 public:
-  virtual boost::optional<FT> is_too_long(const halfedge_descriptor h) const = 0;
+  virtual boost::optional<FT> is_too_long(const halfedge_descriptor h,
+                                          const PolygonMesh& pmesh) const = 0;
   virtual boost::optional<FT> is_too_long(const vertex_descriptor va,
                                           const vertex_descriptor vb) const = 0;
-  virtual boost::optional<FT> is_too_short(const halfedge_descriptor h) const = 0;
-  virtual Point_3 split_placement(const halfedge_descriptor h) const = 0;
-  virtual const PolygonMesh& get_mesh() const = 0;
+  virtual boost::optional<FT> is_too_short(const halfedge_descriptor h,
+                                           const PolygonMesh& pmesh) const = 0;
+  virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const = 0;
 
 };
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index bb65af3e2d10..27ea3cd29271 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -78,7 +78,7 @@ namespace CGAL {
 
 namespace Polygon_mesh_processing {
 
-template <typename PM> class Uniform_sizing_field;
+template <typename PM, typename VPMap> class Uniform_sizing_field;
 
 namespace internal {
 
@@ -404,7 +404,7 @@ namespace internal {
         );
       for(edge_descriptor e : edge_range)
       {
-        boost::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_));
+        boost::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_), mesh_);
         if(sqlen != boost::none)
           long_edges.emplace(halfedge(e, mesh_), sqlen.get());
       }
@@ -438,16 +438,16 @@ namespace internal {
         std::cout << "   refinement point : " << refinement_point << std::endl;
 #endif
         //update sizing field with the new point
-        if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM>>)
-          sizing.update_sizing_map(vnew);
+        if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM, VertexPointMap>>)
+          sizing.update_sizing_map(vnew, mesh_);
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
-        boost::optional<double> sqlen_new = sizing.is_too_long(hnew);
+        boost::optional<double> sqlen_new = sizing.is_too_long(hnew, mesh_);
         if(sqlen_new != boost::none)
           long_edges.emplace(hnew, sqlen_new.get());
 
-        sqlen_new = sizing.is_too_long(next(hnew, mesh_));
+        sqlen_new = sizing.is_too_long(next(hnew, mesh_), mesh_);
         if (sqlen_new != boost::none)
           long_edges.emplace(next(hnew, mesh_), sqlen_new.get());
 
@@ -504,7 +504,7 @@ namespace internal {
       {
         if (!is_split_allowed(e))
           continue;
-        boost::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_));
+        boost::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_), mesh_);
         if(sqlen != boost::none)
           long_edges.emplace(halfedge(e, mesh_), sqlen.get());
       }
@@ -535,7 +535,7 @@ namespace internal {
         Patch_id patch_id_opp = get_patch_id(face(opposite(he, mesh_), mesh_));
 
         //split edge
-        Point refinement_point = sizing.split_placement(he);
+        Point refinement_point = sizing.split_placement(he, mesh_);
         halfedge_descriptor hnew = CGAL::Euler::split_edge(he, mesh_);
         CGAL_assertion(he == next(hnew, mesh_));
         put(ecmap_, edge(hnew, mesh_), get(ecmap_, edge(he, mesh_)) );
@@ -555,16 +555,16 @@ namespace internal {
         halfedge_added(hnew_opp, status(opposite(he, mesh_)));
 
         //update sizing field with the new point
-        if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM>>)
-          sizing.update_sizing_map(vnew);
+        if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM, VertexPointMap>>)
+          sizing.update_sizing_map(vnew, mesh_);
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
-        boost::optional<double> sqlen_new = sizing.is_too_long(hnew);
+        boost::optional<double> sqlen_new = sizing.is_too_long(hnew, mesh_);
         if(sqlen_new != boost::none)
           long_edges.emplace(hnew, sqlen_new.get());
 
-        sqlen_new = sizing.is_too_long(next(hnew, mesh_));
+        sqlen_new = sizing.is_too_long(next(hnew, mesh_), mesh_);
         if (sqlen_new != boost::none)
           long_edges.emplace(next(hnew, mesh_), sqlen_new.get());
 
@@ -585,7 +585,7 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            boost::optional<double> sql = sizing.is_too_long(hnew2);
+            boost::optional<double> sql = sizing.is_too_long(hnew2, mesh_);
             if(sql != boost::none)
               long_edges.emplace(hnew2, sql.get());
           }
@@ -608,7 +608,7 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            boost::optional<double> sql = sizing.is_too_long(hnew2);
+            boost::optional<double> sql = sizing.is_too_long(hnew2, mesh_);
             if (sql != boost::none)
               long_edges.emplace(hnew2, sql.get());
           }
@@ -653,7 +653,7 @@ namespace internal {
       Boost_bimap short_edges;
       for(edge_descriptor e : edges(mesh_))
       {
-        boost::optional<double> sqlen = sizing.is_too_short(halfedge(e, mesh_));
+        boost::optional<double> sqlen = sizing.is_too_short(halfedge(e, mesh_), mesh_);
         if(sqlen != boost::none
           && is_collapse_allowed(e, collapse_constraints))
           short_edges.insert(short_edge(halfedge(e, mesh_), sqlen.get()));
@@ -818,7 +818,7 @@ namespace internal {
             //insert new/remaining short edges
             for (halfedge_descriptor ht : halfedges_around_target(vkept, mesh_))
             {
-              boost::optional<double> sqlen = sizing.is_too_short(ht);
+              boost::optional<double> sqlen = sizing.is_too_short(ht, mesh_);
               if (sqlen != boost::none
                 && is_collapse_allowed(edge(ht, mesh_), collapse_constraints))
                 short_edges.insert(short_edge(ht, sqlen.get()));
@@ -1053,7 +1053,7 @@ namespace internal {
       auto constrained_vertices_pmap
         = boost::make_function_property_map<vertex_descriptor>(vertex_constraint);
 
-      if constexpr (std::is_same<SizingFunction, Uniform_sizing_field<PM>>::value)
+      if constexpr (std::is_same<SizingFunction, Uniform_sizing_field<PM, VertexPointMap>>::value)
       {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
         std::cout << " using tangential relaxation with weights equal to 1";
@@ -1768,7 +1768,7 @@ namespace internal {
             //insert new edges in 'short_edges'
             if (is_collapse_allowed(edge(hf, mesh_), collapse_constraints))
             {
-              boost::optional<double> sqlen = sizing.is_too_short(hf);
+              boost::optional<double> sqlen = sizing.is_too_short(hf, mesh_);
               if (sqlen != boost::none)
                 short_edges.insert(typename Bimap::value_type(hf, sqlen.get()));
             }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index d146fb57597e..70771b6c81bf 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -206,10 +206,6 @@ void isotropic_remeshing(const FaceRange& faces
   if (std::begin(faces)==std::end(faces))
     return;
 
-  //todo ip: precondition or something else?
-  CGAL_precondition_msg(&(sizing.get_mesh()) == &pmesh, "Input mesh is not the same "
-                                                        "as the one used for the sizing field!");
-
   typedef PolygonMesh PM;
   typedef typename boost::graph_traits<PM>::vertex_descriptor vertex_descriptor;
   typedef typename boost::graph_traits<PM>::edge_descriptor edge_descriptor;
@@ -348,7 +344,7 @@ void isotropic_remeshing(const FaceRange& faces
                        , PolygonMesh& pmesh
                        , const NamedParameters& np = parameters::default_values())
 {
-  Uniform_sizing_field<PolygonMesh> sizing(target_edge_length, pmesh);
+  Uniform_sizing_field sizing(target_edge_length, pmesh);
   if (target_edge_length > 0)
     isotropic_remeshing(faces, sizing, pmesh, np);
   else
@@ -471,7 +467,7 @@ void split_long_edges(const EdgeRange& edges
              false/*need aabb_tree*/);
 
     // check if sizing field needs updating
-    if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM>>)
+    if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM, VPMap>>)
     {
       //todo ip: check if sizing field needs to be checked and updated here
     }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 940d576735e4..1185567f05ab 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -698,7 +698,7 @@ public Q_SLOTS:
                 , CGAL::parameters::geom_traits(EPICK())
                 . edge_is_constrained_map(eif));
               }
-              else if (edge_sizing_type = 1)
+              else if (edge_sizing_type == 1)
               {
                 std::pair<double, double> edge_min_max{min_length, max_length};
                 PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol

From ff4bbaa1554bd33233a08dcd6a35ffa4b0583e64 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 15 Aug 2023 20:10:39 +0200
Subject: [PATCH 0632/1398] Target length fix

---
 .../include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 2e047548adaa..0a259d3ef31a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -83,7 +83,7 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
   boost::optional<FT> is_too_short(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
     const FT sqlen = sqlength(h, pmesh);
-    if (sqlen < m_sq_long)
+    if (sqlen < m_sq_short)
       return sqlen;
     else
       return boost::none;

From e3727e4a88c318bdd97b20e6fd55f8ebd750587d Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 15 Aug 2023 20:14:11 +0200
Subject: [PATCH 0633/1398] Remove todos

---
 .../test/Polygon_mesh_processing/remeshing_quality_test.cpp     | 2 +-
 .../demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp  | 1 -
 2 files changed, 1 insertion(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
index 01f97b210cb8..69b2afaaca01 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
@@ -51,7 +51,7 @@ int main(int argc, char* argv[])
     if (PMP::is_degenerate_triangle_face(face, mesh))
     {
       std::cout << "Found degenerate triangle!" << std::endl;
-      continue; //todo ip should something be done about this?
+      continue;
     }
 
     // Calculate Q(t) triangle quality indicator
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 1185567f05ab..3f1816d7ce31 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -1289,7 +1289,6 @@ public Q_SLOTS:
 
 
     ui.edgeLength_dspinbox->setValue(0.05 * diago_length);
-    //todo ip - check and adjust these
     ui.errorTol_edit->setValue(0.001 * diago_length);
     ui.minEdgeLength_edit->setValue(0.001 * diago_length);
     ui.maxEdgeLength_edit->setValue(0.5 * diago_length);

From 98a3f14c7382cf23e26f0cc8fb8e5ab46b2dc6cf Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Wed, 16 Aug 2023 18:55:15 +0200
Subject: [PATCH 0634/1398] Add PMPSizingField concept to docs

---
 .../Concepts/PMPSizingField.h                 | 59 +++++++++++++++++++
 1 file changed, 59 insertions(+)
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
new file mode 100644
index 000000000000..5304beb32205
--- /dev/null
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -0,0 +1,59 @@
+/// \ingroup PkgPolygonMeshProcessingConcepts
+/// \cgalConcept
+///
+/// The concept `PMPSizingField` defines the requirements for the sizing field
+/// used in `CGAL::Polygon_mesh_processing::isotropic_remeshing()` to define
+/// the target length for every individual edge during the remeshing process.
+
+class PMPSizingField{
+public:
+
+/// @name Types
+/// @{
+
+/// Vertex descriptor type
+typedef unspecified_type vertex_descriptor;
+
+/// Halfedge descriptor type
+typedef unspecified_type halfedge_descriptor;
+
+/// 3D point type
+typedef unspecified_type Point_3;
+
+/// Polygon mesh type
+typedef unspecified_type PolygonMesh;
+
+/// Numerical type
+typedef unspecified_type FT;
+
+/// @}
+
+/// @name Functions
+/// @{
+
+/// called to check whether the halfedge 'h' is longer than the target edge size
+/// and as such should be split. If the halfedge is longer, it returns the squared
+/// length of the edge.
+boost::optional<FT> is_too_long(const halfedge_descriptor h,
+                                const PolygonMesh& pmesh) const;
+
+/// called to check whether the halfedge with end vertices 'va' and 'vb' is longer
+/// than the target edge size and as such should be split. If the halfedge is longer,
+/// it returns the squared length of the edge.
+boost::optional<FT> is_too_long(const vertex_descriptor va,
+                                const vertex_descriptor vb) const;
+
+/// called to check whether the halfedge 'h' should be collapsed in case it is
+/// shorter than the target edge size
+boost::optional<FT> is_too_short(const halfedge_descriptor h,
+                                 const PolygonMesh& pmesh) const;
+
+/// called to define the location of the halfedge 'h' split in case 'is_too_long'
+/// returns a value
+Point_3 split_placement(const halfedge_descriptor h,
+                        const PolygonMesh& pmesh) const;
+
+/// @}
+};
+
+

From 9e91abb5398fe9a94ac08ced0fdc4c80f7213142 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Wed, 16 Aug 2023 20:18:22 +0200
Subject: [PATCH 0635/1398] First attempt at sizing field docs

---
 .../Adaptive_sizing_field.h                   | 33 ++++++++++++++
 .../Uniform_sizing_field.h                    | 45 +++++++++++++++++--
 .../tangential_relaxation.h                   |  1 +
 3 files changed, 75 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 1e8151c14b32..1c6915b4c96d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -25,6 +25,22 @@ namespace CGAL
 {
 namespace Polygon_mesh_processing
 {
+/*!
+* \ingroup PMP_meshing_grp
+* provides a set of instructions for isotropic remeshing to achieve variable
+* mesh edge lengths as a function of local discrete curvatures.
+*
+* Edges longer than the local target edge length are split in half, while
+* edges shorter than the local target edge length are collapsed.
+*
+* \cgalModels PMPSizingField
+*
+* \sa `isotropic_remeshing`
+* \sa `Uniform_sizing_field`
+*
+* @tparam PolygonMesh model of `MutableFaceGraph` that
+*         has an internal property map for `CGAL::vertex_point_t`.
+*/
 template <class PolygonMesh>
 class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
 {
@@ -44,6 +60,22 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
   typedef typename boost::property_map<PolygonMesh,
                                        Vertex_property_tag>::type VertexSizingMap;
 
+  /// \name Creation
+  /// @{
+  /*!
+  * Returns an object to serve as criteria for adaptive curvature-based edge lengths.
+  *
+  * @tparam FaceRange range of `boost::graph_traits<PolygonMesh>::%face_descriptor`,
+  *         model of `Range`. Its iterator type is `ForwardIterator`.
+  *
+  * @param tol the error tolerance, the maximum deviation of an edge from the original
+  *        mesh. Lower tolerance values will result in shorter mesh edges.
+  * @param edge_len_min_max is the stopping criterion for minimum and maximum allowed
+  *        edge length.
+  * @param face_range the range of triangular faces defining one or several surface patches
+  *        to be remeshed.
+  * @param pmesh a polygon mesh with triangulated surface patches to be remeshed.
+  */
   template <typename FaceRange>
   Adaptive_sizing_field(const double tol
                       , const std::pair<FT, FT>& edge_len_min_max
@@ -74,6 +106,7 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
       calc_sizing_map(ffg);
     }
   }
+  ///@}
 
 private:
   template <typename FaceGraph>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 0a259d3ef31a..956ebeb21706 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -23,6 +23,25 @@ namespace CGAL
 {
 namespace Polygon_mesh_processing
 {
+/*!
+* \ingroup PMP_meshing_grp
+* provides a set of instructions for isotropic remeshing to achieve uniform
+* mesh edge lengths.
+*
+* Edges longer than the 4/3 of the target edge length will be split in half, while
+* edges shorter than the 4/5 of the target edge length will be collapsed.
+*
+* \cgalModels PMPSizingField
+*
+* \sa `isotropic_remeshing`
+* \sa `Adaptive_sizing_field`
+*
+* @tparam PolygonMesh model of `MutableFaceGraph` that
+*         has an internal property map for `CGAL::vertex_point_t`.
+* @tparam VPMap a property map associating points to the vertices of `pmesh`.
+*         It is a a class model of `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*          as key type and `%Point_3` as value type. Default is `boost::get(CGAL::vertex_point, pmesh)`.
+*/
 template <class PolygonMesh,
           class VPMap =  typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
 class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
@@ -36,18 +55,36 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
   typedef typename Base::halfedge_descriptor halfedge_descriptor;
   typedef typename Base::vertex_descriptor   vertex_descriptor;
 
-  Uniform_sizing_field<PolygonMesh, VPMap>(const FT size, const VPMap& vpmap)
+  /// \name Creation
+  /// @{
+  /*!
+  * Returns an object to serve as criterion for uniform edge lengths.
+  *
+  * @param size is the target edge length for the isotropic remeshing. If set to 0,
+  *        the criterion for edge length is ignored and edges are neither split nor collapsed.
+  * @param pmesh a polygon mesh with triangulated surface patches to be remeshed.
+  */
+  Uniform_sizing_field<PolygonMesh>(const FT& size, const PolygonMesh& pmesh)
     : m_sq_short( CGAL::square(4./5. * size))
     , m_sq_long(  CGAL::square(4./3. * size))
-    , m_vpmap(vpmap)
+    , m_vpmap(get(CGAL::vertex_point, pmesh))
   {}
 
-  Uniform_sizing_field<PolygonMesh>(const FT& size, const PolygonMesh& pmesh)
+  /*!
+  * Returns an object to serve as criterion for uniform edge lengths.
+  * \param size is the target edge length for the isotropic remeshing. If set to 0,
+  *        the criterion for edge length is ignored and edges are neither split nor collapsed.
+  * \param vpmap is the input vertex point map that associates points to the vertices of
+  *        an input mesh.
+  */
+  Uniform_sizing_field<PolygonMesh, VPMap>(const FT size, const VPMap& vpmap)
     : m_sq_short( CGAL::square(4./5. * size))
     , m_sq_long(  CGAL::square(4./3. * size))
-    , m_vpmap(get(CGAL::vertex_point, pmesh))
+    , m_vpmap(vpmap)
   {}
 
+  /// @}
+
 private:
   FT sqlength(const vertex_descriptor va,
               const vertex_descriptor vb) const
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index c0103f943299..54b614304e19 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -317,6 +317,7 @@ void tangential_relaxation(const VertexRange& vertices,
 #endif
 }
 
+//todo ip: doc here?
 template <typename VertexRange,
           class TriangleMesh,
           class SizingFunction,

From dccf9731862fb46e933de623243b466548d7d411 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Thu, 17 Aug 2023 00:29:19 +0200
Subject: [PATCH 0636/1398] Fix templating error in isotropic remeshing
 overload

---
 .../include/CGAL/Polygon_mesh_processing/remesh.h        | 9 ++++++++-
 .../Plugins/PMP/Isotropic_remeshing_plugin.cpp           | 4 ++--
 2 files changed, 10 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 70771b6c81bf..bee2a645b2c4 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -344,7 +344,14 @@ void isotropic_remeshing(const FaceRange& faces
                        , PolygonMesh& pmesh
                        , const NamedParameters& np = parameters::default_values())
 {
-  Uniform_sizing_field sizing(target_edge_length, pmesh);
+  using parameters::choose_parameter;
+  using parameters::get_parameter;
+
+  typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::type VPMap;
+  VPMap vpmap = choose_parameter(get_parameter(np, internal_np::vertex_point),
+    get_property_map(vertex_point, pmesh));
+
+  Uniform_sizing_field<PolygonMesh, VPMap> sizing(target_edge_length, vpmap);
   if (target_edge_length > 0)
     isotropic_remeshing(faces, sizing, pmesh, np);
   else
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 3f1816d7ce31..a819c2c22943 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -435,7 +435,7 @@ public Q_SLOTS:
                  selection_item->constrained_edges_pmap(),
                  get(CGAL::vertex_point, *selection_item->polyhedron()),
                  CGAL::Constant_property_map<face_descriptor, std::size_t>(1),
-                 CGAL::Polygon_mesh_processing::Uniform_sizing_field<FaceGraph>( 4. / 3. * target_length, pmesh)))
+                 CGAL::Polygon_mesh_processing::Uniform_sizing_field( 4. / 3. * target_length, pmesh)))
             {
               QApplication::restoreOverrideCursor();
               //If facets are selected, splitting edges will add facets that won't be selected, and it will mess up the rest.
@@ -741,7 +741,7 @@ public Q_SLOTS:
                ecm,
                get(CGAL::vertex_point, pmesh),
                CGAL::Constant_property_map<face_descriptor, std::size_t>(1),
-               CGAL::Polygon_mesh_processing::Uniform_sizing_field<FaceGraph>(4. / 3. * target_length, pmesh)))
+               CGAL::Polygon_mesh_processing::Uniform_sizing_field(4. / 3. * target_length, pmesh)))
           {
             QApplication::restoreOverrideCursor();
             QMessageBox::warning(mw, tr("Error"),

From f5d23db40a57b816024edb19ee483aaf7f40ae37 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Thu, 17 Aug 2023 08:03:37 +0200
Subject: [PATCH 0637/1398] Add template argument to constructor

---
 .../include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 956ebeb21706..ce80e3edd0a6 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -64,7 +64,7 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
   *        the criterion for edge length is ignored and edges are neither split nor collapsed.
   * @param pmesh a polygon mesh with triangulated surface patches to be remeshed.
   */
-  Uniform_sizing_field<PolygonMesh>(const FT& size, const PolygonMesh& pmesh)
+  Uniform_sizing_field<PolygonMesh, VPMap>(const FT& size, const PolygonMesh& pmesh)
     : m_sq_short( CGAL::square(4./5. * size))
     , m_sq_long(  CGAL::square(4./3. * size))
     , m_vpmap(get(CGAL::vertex_point, pmesh))

From 1f9142bfc2e116623c364c1ff884e4533dfaf284 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Thu, 17 Aug 2023 18:19:03 +0200
Subject: [PATCH 0638/1398] Try to fix failing test

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h     | 5 +++--
 .../internal/Isotropic_remeshing/Sizing_field.h              | 2 ++
 2 files changed, 5 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 1c6915b4c96d..2914a1c36053 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -41,8 +41,9 @@ namespace Polygon_mesh_processing
 * @tparam PolygonMesh model of `MutableFaceGraph` that
 *         has an internal property map for `CGAL::vertex_point_t`.
 */
-template <class PolygonMesh>
-class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh>
+template <class PolygonMesh,
+          class VPMap =  typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
+class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
 {
 private:
   typedef CGAL::Sizing_field<PolygonMesh> Base;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
index d4109708352b..331e2ab922d0 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
@@ -16,6 +16,8 @@
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
 #include <CGAL/Kernel_traits.h>
+#include <CGAL/property_map.h>
+
 #include <boost/optional.hpp>
 
 namespace CGAL

From 46b50511a70fdd06405344128ba9fc63cfb9fad1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 18 Aug 2023 10:16:45 +0200
Subject: [PATCH 0639/1398] add missing include directive detected by the CI

---
 .../Adaptive_sizing_field.h                      | 16 ++++++++++------
 .../internal/Isotropic_remeshing/Sizing_field.h  |  2 +-
 2 files changed, 11 insertions(+), 7 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 2914a1c36053..06b662afbe04 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -16,11 +16,15 @@
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
 #include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h>
-
 #include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 
+#include <CGAL/boost/graph/selection.h>
+#include <CGAL/boost/graph/Face_filtered_graph.h>
+
 #include <CGAL/number_utils.h>
 
+
+
 namespace CGAL
 {
 namespace Polygon_mesh_processing
@@ -100,9 +104,9 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
       auto is_selected = get(CGAL::dynamic_face_property_t<bool>(), pmesh);
       for (face_descriptor f : faces(pmesh)) put(is_selected, f, false);
       for (face_descriptor f : face_range)  put(is_selected, f, true);
-      CGAL::expand_face_selection(selection, pmesh, 1
-                                , is_selected, std::back_inserter(selection));
-      CGAL::Face_filtered_graph<PolygonMesh> ffg(pmesh, selection);
+      expand_face_selection(selection, pmesh, 1,
+                            is_selected, std::back_inserter(selection));
+      Face_filtered_graph<PolygonMesh> ffg(pmesh, selection);
 
       calc_sizing_map(ffg);
     }
@@ -224,8 +228,8 @@ class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
 
   virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
-    return CGAL::midpoint(get(m_vpmap, target(h, pmesh)),
-                          get(m_vpmap, source(h, pmesh)));
+    return midpoint(get(m_vpmap, target(h, pmesh)),
+                    get(m_vpmap, source(h, pmesh)));
   }
 
   void update_sizing_map(const vertex_descriptor v, const PolygonMesh& pmesh)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
index 331e2ab922d0..8267df50f556 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
@@ -16,7 +16,7 @@
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
 #include <CGAL/Kernel_traits.h>
-#include <CGAL/property_map.h>
+#include <CGAL/boost/graph/properties.h>
 
 #include <boost/optional.hpp>
 

From e845b07bab5a8d3d11dd1a574385bc2658276869 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 18 Aug 2023 10:51:56 +0200
Subject: [PATCH 0640/1398] using Koening lookup

---
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h     | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index ce80e3edd0a6..fb88321d6a2c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -89,7 +89,7 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
   FT sqlength(const vertex_descriptor va,
               const vertex_descriptor vb) const
   {
-    return FT(CGAL::squared_distance(get(m_vpmap, va), get(m_vpmap, vb)));
+    return FT(squared_distance(get(m_vpmap, va), get(m_vpmap, vb)));
   }
 
   FT sqlength(const halfedge_descriptor& h, const PolygonMesh& pmesh) const
@@ -128,8 +128,8 @@ class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
 
   virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
-    return CGAL::midpoint(get(m_vpmap, target(h, pmesh)),
-                          get(m_vpmap, source(h, pmesh)));
+    return midpoint(get(m_vpmap, target(h, pmesh)),
+                    get(m_vpmap, source(h, pmesh)));
   }
 
 private:

From b69a2671fe9b0d040fc6123993d5622a2a6d357f Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 18 Aug 2023 17:45:59 +0200
Subject: [PATCH 0641/1398] Rename Sizing_field to Sizing_field_base

---
 .../Polygon_mesh_processing/Adaptive_sizing_field.h   | 11 ++++-------
 .../Polygon_mesh_processing/Uniform_sizing_field.h    |  6 +++---
 .../{Sizing_field.h => Sizing_field_base.h}           |  2 +-
 .../include/CGAL/Polygon_mesh_processing/remesh.h     |  4 ++--
 4 files changed, 10 insertions(+), 13 deletions(-)
 rename Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/{Sizing_field.h => Sizing_field_base.h} (98%)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 06b662afbe04..60b5e3a8855f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
-#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h>
+#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h>
 #include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 
 #include <CGAL/boost/graph/selection.h>
@@ -23,8 +23,6 @@
 
 #include <CGAL/number_utils.h>
 
-
-
 namespace CGAL
 {
 namespace Polygon_mesh_processing
@@ -45,12 +43,11 @@ namespace Polygon_mesh_processing
 * @tparam PolygonMesh model of `MutableFaceGraph` that
 *         has an internal property map for `CGAL::vertex_point_t`.
 */
-template <class PolygonMesh,
-          class VPMap =  typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
-class Adaptive_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
+template <class PolygonMesh>
+class Adaptive_sizing_field : public CGAL::Sizing_field_base<PolygonMesh>
 {
 private:
-  typedef CGAL::Sizing_field<PolygonMesh> Base;
+  typedef CGAL::Sizing_field_base<PolygonMesh> Base;
 
 public:
   typedef typename Base::K          K;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index fb88321d6a2c..d22e0079d7fd 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
-#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h>
+#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h>
 
 #include <CGAL/number_utils.h>
 
@@ -44,10 +44,10 @@ namespace Polygon_mesh_processing
 */
 template <class PolygonMesh,
           class VPMap =  typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
-class Uniform_sizing_field : public CGAL::Sizing_field<PolygonMesh, VPMap>
+class Uniform_sizing_field : public CGAL::Sizing_field_base<PolygonMesh, VPMap>
 {
 private:
-  typedef CGAL::Sizing_field<PolygonMesh, VPMap> Base;
+  typedef CGAL::Sizing_field_base<PolygonMesh, VPMap> Base;
 
 public:
   typedef typename Base::FT         FT;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
similarity index 98%
rename from Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
rename to Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
index 8267df50f556..81afe3af21fa 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
@@ -27,7 +27,7 @@ namespace CGAL
 */
 template <class PolygonMesh,
           class VPMap = typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
-class Sizing_field
+class Sizing_field_base
 {
 private:
   typedef PolygonMesh                     PM;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index bee2a645b2c4..842d980eae80 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -45,7 +45,7 @@ namespace Polygon_mesh_processing {
 *         models of `Hashable`.
 * @tparam FaceRange range of `boost::graph_traits<PolygonMesh>::%face_descriptor`,
 *         model of `Range`. Its iterator type is `ForwardIterator`.
-* @tparam SizingFunction model of `Sizing_field`
+* @tparam SizingFunction model of `PMPSizingField`
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
 * @param pmesh a polygon mesh with triangulated surface patches to be remeshed
@@ -372,7 +372,7 @@ void isotropic_remeshing(const FaceRange& faces
 *         has an internal property map for `CGAL::vertex_point_t`.
 * @tparam EdgeRange range of `boost::graph_traits<PolygonMesh>::%edge_descriptor`,
 *   model of `Range`. Its iterator type is `InputIterator`.
-* @tparam SizingFunction model of `Sizing_field`
+* @tparam SizingFunction model of `Sizing_field_base`
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
 * @param pmesh a polygon mesh

From 35153d509d2efc054be9a3ec67069d1a105b12de Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 18 Aug 2023 19:07:07 +0200
Subject: [PATCH 0642/1398] Update documentation

---
 .../Concepts/PMPSizingField.h                 | 13 ++-
 .../CGAL/Polygon_mesh_processing/remesh.h     |  2 +-
 .../tangential_relaxation.h                   | 85 ++++++++++++++++++-
 3 files changed, 91 insertions(+), 9 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index 5304beb32205..da58562c5577 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -31,28 +31,27 @@ typedef unspecified_type FT;
 /// @name Functions
 /// @{
 
-/// called to check whether the halfedge 'h' is longer than the target edge size
+/// called to check whether the halfedge `h` is longer than the target edge size
 /// and as such should be split. If the halfedge is longer, it returns the squared
 /// length of the edge.
 boost::optional<FT> is_too_long(const halfedge_descriptor h,
                                 const PolygonMesh& pmesh) const;
 
-/// called to check whether the halfedge with end vertices 'va' and 'vb' is longer
+/// called to check whether the halfedge with end vertices `va` and `vb` is longer
 /// than the target edge size and as such should be split. If the halfedge is longer,
 /// it returns the squared length of the edge.
 boost::optional<FT> is_too_long(const vertex_descriptor va,
                                 const vertex_descriptor vb) const;
 
-/// called to check whether the halfedge 'h' should be collapsed in case it is
-/// shorter than the target edge size
+/// called to check whether the halfedge `h` should be collapsed in case it is
+/// shorter than the target edge size.
 boost::optional<FT> is_too_short(const halfedge_descriptor h,
                                  const PolygonMesh& pmesh) const;
 
-/// called to define the location of the halfedge 'h' split in case 'is_too_long'
-/// returns a value
+/// called to define the location of the halfedge `h` split in case `is_too_long`
+/// returns a value.
 Point_3 split_placement(const halfedge_descriptor h,
                         const PolygonMesh& pmesh) const;
-
 /// @}
 };
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 842d980eae80..db036a4be6ac 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -372,7 +372,7 @@ void isotropic_remeshing(const FaceRange& faces
 *         has an internal property map for `CGAL::vertex_point_t`.
 * @tparam EdgeRange range of `boost::graph_traits<PolygonMesh>::%edge_descriptor`,
 *   model of `Range`. Its iterator type is `InputIterator`.
-* @tparam SizingFunction model of `Sizing_field_base`
+* @tparam SizingFunction model of `PMPSizingField`
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
 * @param pmesh a polygon mesh
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index 54b614304e19..db4c3f9955d9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -317,7 +317,90 @@ void tangential_relaxation(const VertexRange& vertices,
 #endif
 }
 
-//todo ip: doc here?
+/*!
+* \ingroup PMP_meshing_grp
+* applies an iterative area-based tangential smoothing to the given range of vertices based on the
+* underlying sizing field.
+* Each vertex `v` is relocated to its weighted centroid, where weights depend on the area of the
+* adjacent triangle and its averaged vertex sizing values.
+* The relocation vector is projected back to the tangent plane to the surface at `v`, iteratively.
+* The connectivity remains unchanged.
+*
+* @tparam TriangleMesh model of `FaceGraph` and `VertexListGraph`.
+*         The descriptor types `boost::graph_traits<TriangleMesh>::%face_descriptor`
+*         and `boost::graph_traits<TriangleMesh>::%halfedge_descriptor` must be
+*         models of `Hashable`.
+* @tparam VertexRange range of `boost::graph_traits<TriangleMesh>::%vertex_descriptor`,
+*         model of `Range`. Its iterator type is `ForwardIterator`.
+* @tparam SizingFunction model of `PMPSizingField`
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+*
+* @param vertices the range of vertices which will be relocated by relaxation
+* @param tm the triangle mesh to which `vertices` belong
+* @param sizing a map containing sizing field for individual vertices.
+*        Used to derive smoothing weights.
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+*
+* \cgalNamedParamsBegin
+*   \cgalParamNBegin{vertex_point_map}
+*     \cgalParamDescription{a property map associating points to the vertices of `tm`}
+*     \cgalParamType{a class model of `ReadWritePropertyMap` with `boost::graph_traits<TriangleMesh>::%vertex_descriptor`
+*                    as key type and `%Point_3` as value type}
+*     \cgalParamDefault{`boost::get(CGAL::vertex_point, tm)`}
+*     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
+*                     must be available in `TriangleMesh`.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{geom_traits}
+*     \cgalParamDescription{an instance of a geometric traits class}
+*     \cgalParamType{a class model of `Kernel`}
+*     \cgalParamDefault{a \cgal Kernel deduced from the `Point_3` type, using `CGAL::Kernel_traits`}
+*     \cgalParamExtra{The geometric traits class must be compatible with the vertex `Point_3` type.}
+*     \cgalParamExtra{Exact constructions kernels are not supported by this function.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{number_of_iterations}
+*     \cgalParamDescription{the number of smoothing iterations}
+*     \cgalParamType{unsigned int}
+*     \cgalParamDefault{`1`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{edge_is_constrained_map}
+*     \cgalParamDescription{a property map containing the constrained-or-not status of each edge of `tm`.
+*                           The endpoints of a constrained edge cannot be moved by relaxation.}
+*     \cgalParamType{a class model of `ReadWritePropertyMap` with `boost::graph_traits<TriangleMesh>::%edge_descriptor`
+*                    as key type and `bool` as value type. It must be default constructible.}
+*     \cgalParamDefault{a default property map where no edges are constrained}
+*     \cgalParamExtra{Boundary edges are always considered as constrained edges.}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{vertex_is_constrained_map}
+*     \cgalParamDescription{a property map containing the constrained-or-not status of each vertex of `tm`.
+*                           A constrained vertex cannot be modified during relaxation.}
+*     \cgalParamType{a class model of `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*                    as key type and `bool` as value type. It must be default constructible.}
+*     \cgalParamDefault{a default property map where no vertices are constrained}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{relax_constraints}
+*     \cgalParamDescription{If `true`, the end vertices of the edges set as constrained
+*                           in `edge_is_constrained_map` and boundary edges move along the
+*                           constrained polylines they belong to.}
+*     \cgalParamType{Boolean}
+*     \cgalParamDefault{`false`}
+*   \cgalParamNEnd
+*
+*   \cgalParamNBegin{allow_move_functor}
+*     \cgalParamDescription{A function object used to determinate if a vertex move should be allowed or not}
+*     \cgalParamType{Unary functor that provides `bool operator()(vertex_descriptor v, Point_3 src, Point_3 tgt)` returning `true`
+*                    if the vertex `v` can be moved from `src` to `tgt`; `Point_3` being the value type of the vertex point map }
+*     \cgalParamDefault{If not provided, all moves are allowed.}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
+*
+* \todo check if it should really be a triangle mesh or if a polygon mesh is fine
+*/
 template <typename VertexRange,
           class TriangleMesh,
           class SizingFunction,

From 040b9ab19484010d8a5732b055420faf462a6ac5 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 18 Aug 2023 20:17:38 +0200
Subject: [PATCH 0643/1398] Add precondition that sizing field and remeshing
 vpmap must be the same

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h      | 4 +++-
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h       | 4 +++-
 .../internal/Isotropic_remeshing/Sizing_field_base.h          | 2 ++
 .../include/CGAL/Polygon_mesh_processing/remesh.h             | 3 +++
 4 files changed, 11 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 60b5e3a8855f..36f714dab6ef 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -223,12 +223,14 @@ class Adaptive_sizing_field : public CGAL::Sizing_field_base<PolygonMesh>
       return boost::none;
   }
 
-  virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const
+  Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
     return midpoint(get(m_vpmap, target(h, pmesh)),
                     get(m_vpmap, source(h, pmesh)));
   }
 
+  const DefaultVPMap& get_vpmap() const { return m_vpmap; }
+
   void update_sizing_map(const vertex_descriptor v, const PolygonMesh& pmesh)
   {
     // calculating it as the average of two vertices on other ends
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index d22e0079d7fd..46ca4c5acedc 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -126,12 +126,14 @@ class Uniform_sizing_field : public CGAL::Sizing_field_base<PolygonMesh, VPMap>
       return boost::none;
   }
 
-  virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const
+  Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
     return midpoint(get(m_vpmap, target(h, pmesh)),
                     get(m_vpmap, source(h, pmesh)));
   }
 
+  const VPMap& get_vpmap() const { return m_vpmap; }
+
 private:
   FT m_sq_short;
   FT m_sq_long;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
index 81afe3af21fa..13661883b2aa 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
@@ -53,6 +53,8 @@ class Sizing_field_base
                                            const PolygonMesh& pmesh) const = 0;
   virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const = 0;
 
+  virtual const VPMap& get_vpmap() const = 0;
+
 };
 
 }//end namespace CGAL
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index db036a4be6ac..a36c3248db12 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -277,6 +277,9 @@ void isotropic_remeshing(const FaceRange& faces
   }
 #endif
 
+  CGAL_precondition_msg((sizing.get_vpmap()) == vpmap, "Input mesh/vertex point map is not the same as the "
+                                                       "one used for sizing field. Remeshing aborted.");
+
 #ifdef CGAL_PMP_REMESHING_VERBOSE
   t.stop();
   std::cout << "\rRemeshing parameters done ("<< t.time() <<" sec)" << std::endl;

From a96054a05151983dcd7a00b7afe681cf75768b01 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 18 Aug 2023 21:43:36 +0200
Subject: [PATCH 0644/1398] Place Sizing_field_base under PMP namespace as
 Uniform and Adaptive classes

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h      | 4 ++--
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h       | 4 ++--
 .../internal/Isotropic_remeshing/Sizing_field_base.h          | 3 +++
 3 files changed, 7 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 36f714dab6ef..b2444f258c9b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -44,10 +44,10 @@ namespace Polygon_mesh_processing
 *         has an internal property map for `CGAL::vertex_point_t`.
 */
 template <class PolygonMesh>
-class Adaptive_sizing_field : public CGAL::Sizing_field_base<PolygonMesh>
+class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
 {
 private:
-  typedef CGAL::Sizing_field_base<PolygonMesh> Base;
+  typedef Sizing_field_base<PolygonMesh> Base;
 
 public:
   typedef typename Base::K          K;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 46ca4c5acedc..1b3c3b3f60b1 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -44,10 +44,10 @@ namespace Polygon_mesh_processing
 */
 template <class PolygonMesh,
           class VPMap =  typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
-class Uniform_sizing_field : public CGAL::Sizing_field_base<PolygonMesh, VPMap>
+class Uniform_sizing_field : public Sizing_field_base<PolygonMesh, VPMap>
 {
 private:
-  typedef CGAL::Sizing_field_base<PolygonMesh, VPMap> Base;
+  typedef Sizing_field_base<PolygonMesh, VPMap> Base;
 
 public:
   typedef typename Base::FT         FT;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
index 13661883b2aa..2ab66f8532a1 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
@@ -22,6 +22,8 @@
 
 namespace CGAL
 {
+namespace Polygon_mesh_processing
+{
 /*!
 * Sizing field virtual class
 */
@@ -57,6 +59,7 @@ class Sizing_field_base
 
 };
 
+}//end namespace Polygon_mesh_processing
 }//end namespace CGAL
 
 #endif //CGAL_PMP_REMESHING_SIZING_FIELD_H

From 8cd75d86f7ea01a8efc94c35d3f07994e8fa3380 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Sun, 20 Aug 2023 21:24:38 +0200
Subject: [PATCH 0645/1398] Fix vpmap return error

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h        | 2 +-
 .../include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h | 2 +-
 .../internal/Isotropic_remeshing/Sizing_field_base.h            | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index b2444f258c9b..236ac2fb6a14 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -229,7 +229,7 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
                     get(m_vpmap, source(h, pmesh)));
   }
 
-  const DefaultVPMap& get_vpmap() const { return m_vpmap; }
+  DefaultVPMap get_vpmap() const { return m_vpmap; }
 
   void update_sizing_map(const vertex_descriptor v, const PolygonMesh& pmesh)
   {
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 1b3c3b3f60b1..0b45fecb7689 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -132,7 +132,7 @@ class Uniform_sizing_field : public Sizing_field_base<PolygonMesh, VPMap>
                     get(m_vpmap, source(h, pmesh)));
   }
 
-  const VPMap& get_vpmap() const { return m_vpmap; }
+  VPMap get_vpmap() const { return m_vpmap; }
 
 private:
   FT m_sq_short;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
index 2ab66f8532a1..89337716c94f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
@@ -55,7 +55,7 @@ class Sizing_field_base
                                            const PolygonMesh& pmesh) const = 0;
   virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const = 0;
 
-  virtual const VPMap& get_vpmap() const = 0;
+  virtual VPMap get_vpmap() const = 0;
 
 };
 

From a00509ea477e52494a7bb97985aa8c3bda4fa70e Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Mon, 21 Aug 2023 20:05:06 +0200
Subject: [PATCH 0646/1398] Remove precondition for vpmap

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h       | 2 --
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h        | 2 --
 .../internal/Isotropic_remeshing/Sizing_field_base.h           | 2 --
 .../include/CGAL/Polygon_mesh_processing/remesh.h              | 3 ---
 4 files changed, 9 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 236ac2fb6a14..a5783d811019 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -229,8 +229,6 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
                     get(m_vpmap, source(h, pmesh)));
   }
 
-  DefaultVPMap get_vpmap() const { return m_vpmap; }
-
   void update_sizing_map(const vertex_descriptor v, const PolygonMesh& pmesh)
   {
     // calculating it as the average of two vertices on other ends
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 0b45fecb7689..aebf1d43f4ed 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -132,8 +132,6 @@ class Uniform_sizing_field : public Sizing_field_base<PolygonMesh, VPMap>
                     get(m_vpmap, source(h, pmesh)));
   }
 
-  VPMap get_vpmap() const { return m_vpmap; }
-
 private:
   FT m_sq_short;
   FT m_sq_long;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
index 89337716c94f..9b8c545c1d32 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
@@ -55,8 +55,6 @@ class Sizing_field_base
                                            const PolygonMesh& pmesh) const = 0;
   virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const = 0;
 
-  virtual VPMap get_vpmap() const = 0;
-
 };
 
 }//end namespace Polygon_mesh_processing
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index a36c3248db12..db036a4be6ac 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -277,9 +277,6 @@ void isotropic_remeshing(const FaceRange& faces
   }
 #endif
 
-  CGAL_precondition_msg((sizing.get_vpmap()) == vpmap, "Input mesh/vertex point map is not the same as the "
-                                                       "one used for sizing field. Remeshing aborted.");
-
 #ifdef CGAL_PMP_REMESHING_VERBOSE
   t.stop();
   std::cout << "\rRemeshing parameters done ("<< t.time() <<" sec)" << std::endl;

From 9dff62200795f9e5074aa37b1688e1a3191861f4 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Mon, 21 Aug 2023 21:10:44 +0200
Subject: [PATCH 0647/1398] Changes for documentation

---
 .../Adaptive_sizing_field.h                   | 18 ++++++-------
 .../Uniform_sizing_field.h                    | 27 ++++++++++---------
 2 files changed, 23 insertions(+), 22 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index a5783d811019..5b3b8c398932 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -48,6 +48,9 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
 {
 private:
   typedef Sizing_field_base<PolygonMesh> Base;
+  typedef typename CGAL::dynamic_vertex_property_t<typename Base::FT> Vertex_property_tag;
+  typedef typename boost::property_map<PolygonMesh,
+                                       Vertex_property_tag>::type VertexSizingMap;
 
 public:
   typedef typename Base::K          K;
@@ -58,25 +61,22 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
   typedef typename Base::vertex_descriptor   vertex_descriptor;
   typedef typename Base::DefaultVPMap DefaultVPMap;
 
-  typedef typename CGAL::dynamic_vertex_property_t<FT> Vertex_property_tag;
-  typedef typename boost::property_map<PolygonMesh,
-                                       Vertex_property_tag>::type VertexSizingMap;
-
   /// \name Creation
   /// @{
   /*!
-  * Returns an object to serve as criteria for adaptive curvature-based edge lengths.
+  * returns an object to serve as criteria for adaptive curvature-based edge lengths.
   *
   * @tparam FaceRange range of `boost::graph_traits<PolygonMesh>::%face_descriptor`,
   *         model of `Range`. Its iterator type is `ForwardIterator`.
   *
-  * @param tol the error tolerance, the maximum deviation of an edge from the original
-  *        mesh. Lower tolerance values will result in shorter mesh edges.
+  * @param tol the error tolerance, used together with curvature to derive target edge length.
+   *       Lower tolerance values will result in shorter mesh edges.
   * @param edge_len_min_max is the stopping criterion for minimum and maximum allowed
   *        edge length.
   * @param face_range the range of triangular faces defining one or several surface patches
-  *        to be remeshed.
-  * @param pmesh a polygon mesh with triangulated surface patches to be remeshed.
+  *        to be remeshed. It should be the same as the range of faces used for `isotropic_remeshing()`.
+  * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. It should be the
+  *              same mesh as the one used in `isotropic_remeshing()`.
   */
   template <typename FaceRange>
   Adaptive_sizing_field(const double tol
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index aebf1d43f4ed..05f3736f961b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -57,21 +57,9 @@ class Uniform_sizing_field : public Sizing_field_base<PolygonMesh, VPMap>
 
   /// \name Creation
   /// @{
-  /*!
-  * Returns an object to serve as criterion for uniform edge lengths.
-  *
-  * @param size is the target edge length for the isotropic remeshing. If set to 0,
-  *        the criterion for edge length is ignored and edges are neither split nor collapsed.
-  * @param pmesh a polygon mesh with triangulated surface patches to be remeshed.
-  */
-  Uniform_sizing_field<PolygonMesh, VPMap>(const FT& size, const PolygonMesh& pmesh)
-    : m_sq_short( CGAL::square(4./5. * size))
-    , m_sq_long(  CGAL::square(4./3. * size))
-    , m_vpmap(get(CGAL::vertex_point, pmesh))
-  {}
 
   /*!
-  * Returns an object to serve as criterion for uniform edge lengths.
+  * returns an object to serve as criterion for uniform edge lengths.
   * \param size is the target edge length for the isotropic remeshing. If set to 0,
   *        the criterion for edge length is ignored and edges are neither split nor collapsed.
   * \param vpmap is the input vertex point map that associates points to the vertices of
@@ -83,6 +71,19 @@ class Uniform_sizing_field : public Sizing_field_base<PolygonMesh, VPMap>
     , m_vpmap(vpmap)
   {}
 
+  /*!
+  * returns an object to serve as criterion for uniform edge lengths. It calls the first
+  * constructor using default values for the vertex point map of the input polygon mesh.
+  *
+  * @param size is the target edge length for the isotropic remeshing. If set to 0,
+  *        the criterion for edge length is ignored and edges are neither split nor collapsed.
+  * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. The default
+  *        vertex point map of pmesh is used to construct the class.
+  */
+  Uniform_sizing_field<PolygonMesh, VPMap>(const FT& size, const PolygonMesh& pmesh)
+    : Uniform_sizing_field(size, get(CGAL::vertex_point, pmesh))
+  {}
+
   /// @}
 
 private:

From 039b02710ebba36e8c7049b55c9e4a5aca90e9ee Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Mon, 21 Aug 2023 22:01:49 +0200
Subject: [PATCH 0648/1398] boost::optional to std::optional C++ 17 update

---
 .../Concepts/PMPSizingField.h                 |  6 +-
 .../Adaptive_sizing_field.h                   | 12 ++--
 .../Uniform_sizing_field.h                    | 12 ++--
 .../Isotropic_remeshing/Sizing_field_base.h   | 12 ++--
 .../Isotropic_remeshing/remesh_impl.h         | 70 +++++++++----------
 5 files changed, 56 insertions(+), 56 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index da58562c5577..8f89b3a88967 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -34,18 +34,18 @@ typedef unspecified_type FT;
 /// called to check whether the halfedge `h` is longer than the target edge size
 /// and as such should be split. If the halfedge is longer, it returns the squared
 /// length of the edge.
-boost::optional<FT> is_too_long(const halfedge_descriptor h,
+std::optional<FT> is_too_long(const halfedge_descriptor h,
                                 const PolygonMesh& pmesh) const;
 
 /// called to check whether the halfedge with end vertices `va` and `vb` is longer
 /// than the target edge size and as such should be split. If the halfedge is longer,
 /// it returns the squared length of the edge.
-boost::optional<FT> is_too_long(const vertex_descriptor va,
+std::optional<FT> is_too_long(const vertex_descriptor va,
                                 const vertex_descriptor vb) const;
 
 /// called to check whether the halfedge `h` should be collapsed in case it is
 /// shorter than the target edge size.
-boost::optional<FT> is_too_short(const halfedge_descriptor h,
+std::optional<FT> is_too_short(const halfedge_descriptor h,
                                  const PolygonMesh& pmesh) const;
 
 /// called to define the location of the halfedge `h` split in case `is_too_long`
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 5b3b8c398932..fcc96deb9baf 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -183,7 +183,7 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
       return get(m_vertex_sizing_map, v);
     }
 
-  boost::optional<FT> is_too_long(const halfedge_descriptor h, const PolygonMesh& pmesh) const
+  std::optional<FT> is_too_long(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
     const FT sqlen = sqlength(h, pmesh);
     FT sqtarg_len = CGAL::square(4./3. * CGAL::min(get(m_vertex_sizing_map, source(h, pmesh)),
@@ -193,10 +193,10 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
     if(sqlen > sqtarg_len)
       return sqlen;
     else
-      return boost::none;
+      return std::nullopt;
   }
 
-  boost::optional<FT> is_too_long(const vertex_descriptor va,
+  std::optional<FT> is_too_long(const vertex_descriptor va,
                                   const vertex_descriptor vb) const
   {
     const FT sqlen = sqlength(va, vb);
@@ -207,10 +207,10 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
     if (sqlen > sqtarg_len)
       return sqlen;
     else
-      return boost::none;
+      return std::nullopt;
   }
 
-  boost::optional<FT> is_too_short(const halfedge_descriptor h, const PolygonMesh& pmesh) const
+  std::optional<FT> is_too_short(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
     const FT sqlen = sqlength(h, pmesh);
     FT sqtarg_len = CGAL::square(4./5. * CGAL::min(get(m_vertex_sizing_map, source(h, pmesh)),
@@ -220,7 +220,7 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
     if (sqlen < sqtarg_len)
       return sqlen;
     else
-      return boost::none;
+      return std::nullopt;
   }
 
   Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 05f3736f961b..7e8c24f3dd22 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -99,32 +99,32 @@ class Uniform_sizing_field : public Sizing_field_base<PolygonMesh, VPMap>
   }
 
 public:
-  boost::optional<FT> is_too_long(const halfedge_descriptor h, const PolygonMesh& pmesh) const
+  std::optional<FT> is_too_long(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
     const FT sqlen = sqlength(h, pmesh);
     if(sqlen > m_sq_long)
       return sqlen;
     else
-      return boost::none;
+      return std::nullopt;
   }
 
-  boost::optional<FT> is_too_long(const vertex_descriptor va,
+  std::optional<FT> is_too_long(const vertex_descriptor va,
                                   const vertex_descriptor vb) const
   {
     const FT sqlen = sqlength(va, vb);
     if (sqlen > m_sq_long)
       return sqlen;
     else
-      return boost::none;
+      return std::nullopt;
   }
 
-  boost::optional<FT> is_too_short(const halfedge_descriptor h, const PolygonMesh& pmesh) const
+  std::optional<FT> is_too_short(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
     const FT sqlen = sqlength(h, pmesh);
     if (sqlen < m_sq_short)
       return sqlen;
     else
-      return boost::none;
+      return std::nullopt;
   }
 
   Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
index 9b8c545c1d32..d433a4c16d61 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
@@ -47,12 +47,12 @@ class Sizing_field_base
   typedef typename K::FT                                        FT;
 
 public:
-  virtual boost::optional<FT> is_too_long(const halfedge_descriptor h,
-                                          const PolygonMesh& pmesh) const = 0;
-  virtual boost::optional<FT> is_too_long(const vertex_descriptor va,
-                                          const vertex_descriptor vb) const = 0;
-  virtual boost::optional<FT> is_too_short(const halfedge_descriptor h,
-                                           const PolygonMesh& pmesh) const = 0;
+  virtual std::optional<FT> is_too_long(const halfedge_descriptor h,
+                                        const PolygonMesh& pmesh) const = 0;
+  virtual std::optional<FT> is_too_long(const vertex_descriptor va,
+                                        const vertex_descriptor vb) const = 0;
+  virtual std::optional<FT> is_too_short(const halfedge_descriptor h,
+                                         const PolygonMesh& pmesh) const = 0;
   virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const = 0;
 
 };
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 27ea3cd29271..895083fbbcd3 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -43,7 +43,6 @@
 #include <boost/range/join.hpp>
 #include <memory>
 #include <boost/container/flat_set.hpp>
-#include <boost/optional.hpp>
 #include <boost/property_map/function_property_map.hpp>
 
 #include <map>
@@ -54,6 +53,7 @@
 #include <tuple>
 #include <unordered_map>
 #include <unordered_set>
+#include <optional>
 
 //todo ip: temp
 #define CGAL_PMP_REMESHING_VERBOSE
@@ -404,9 +404,9 @@ namespace internal {
         );
       for(edge_descriptor e : edge_range)
       {
-        boost::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_), mesh_);
-        if(sqlen != boost::none)
-          long_edges.emplace(halfedge(e, mesh_), sqlen.get());
+        std::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_), mesh_);
+        if(sqlen != std::nullopt)
+          long_edges.emplace(halfedge(e, mesh_), sqlen.value());
       }
 
       //split long edges
@@ -443,13 +443,13 @@ namespace internal {
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
-        boost::optional<double> sqlen_new = sizing.is_too_long(hnew, mesh_);
-        if(sqlen_new != boost::none)
-          long_edges.emplace(hnew, sqlen_new.get());
+        std::optional<double> sqlen_new = sizing.is_too_long(hnew, mesh_);
+        if(sqlen_new != std::nullopt)
+          long_edges.emplace(hnew, sqlen_new.value());
 
         sqlen_new = sizing.is_too_long(next(hnew, mesh_), mesh_);
-        if (sqlen_new != boost::none)
-          long_edges.emplace(next(hnew, mesh_), sqlen_new.get());
+        if (sqlen_new != std::nullopt)
+          long_edges.emplace(next(hnew, mesh_), sqlen_new.value());
 
         //insert new edges to keep triangular faces, and update long_edges
         if (!is_border(hnew, mesh_))
@@ -504,9 +504,9 @@ namespace internal {
       {
         if (!is_split_allowed(e))
           continue;
-        boost::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_), mesh_);
-        if(sqlen != boost::none)
-          long_edges.emplace(halfedge(e, mesh_), sqlen.get());
+        std::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_), mesh_);
+        if(sqlen != std::nullopt)
+          long_edges.emplace(halfedge(e, mesh_), sqlen.value());
       }
 
       //split long edges
@@ -560,13 +560,13 @@ namespace internal {
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
-        boost::optional<double> sqlen_new = sizing.is_too_long(hnew, mesh_);
-        if(sqlen_new != boost::none)
-          long_edges.emplace(hnew, sqlen_new.get());
+        std::optional<double> sqlen_new = sizing.is_too_long(hnew, mesh_);
+        if(sqlen_new != std::nullopt)
+          long_edges.emplace(hnew, sqlen_new.value());
 
         sqlen_new = sizing.is_too_long(next(hnew, mesh_), mesh_);
-        if (sqlen_new != boost::none)
-          long_edges.emplace(next(hnew, mesh_), sqlen_new.get());
+        if (sqlen_new != std::nullopt)
+          long_edges.emplace(next(hnew, mesh_), sqlen_new.value());
 
         //insert new edges to keep triangular faces, and update long_edges
         if (!is_on_border(hnew))
@@ -585,9 +585,9 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            boost::optional<double> sql = sizing.is_too_long(hnew2, mesh_);
-            if(sql != boost::none)
-              long_edges.emplace(hnew2, sql.get());
+            std::optional<double> sql = sizing.is_too_long(hnew2, mesh_);
+            if(sql != std::nullopt)
+              long_edges.emplace(hnew2, sql.value());
           }
         }
 
@@ -608,9 +608,9 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            boost::optional<double> sql = sizing.is_too_long(hnew2, mesh_);
-            if (sql != boost::none)
-              long_edges.emplace(hnew2, sql.get());
+            std::optional<double> sql = sizing.is_too_long(hnew2, mesh_);
+            if (sql != std::nullopt)
+              long_edges.emplace(hnew2, sql.value());
           }
         }
       }
@@ -653,10 +653,10 @@ namespace internal {
       Boost_bimap short_edges;
       for(edge_descriptor e : edges(mesh_))
       {
-        boost::optional<double> sqlen = sizing.is_too_short(halfedge(e, mesh_), mesh_);
-        if(sqlen != boost::none
+        std::optional<double> sqlen = sizing.is_too_short(halfedge(e, mesh_), mesh_);
+        if(sqlen != std::nullopt
           && is_collapse_allowed(e, collapse_constraints))
-          short_edges.insert(short_edge(halfedge(e, mesh_), sqlen.get()));
+          short_edges.insert(short_edge(halfedge(e, mesh_), sqlen.value()));
       }
 #ifdef CGAL_PMP_REMESHING_VERBOSE_PROGRESS
       std::cout << "done." << std::endl;
@@ -752,8 +752,8 @@ namespace internal {
         for(halfedge_descriptor ha : halfedges_around_target(va, mesh_))
         {
           vertex_descriptor va_i = source(ha, mesh_);
-          boost::optional<double> sqha = sizing.is_too_long(vb, va_i);
-          if (sqha != boost::none)
+          std::optional<double> sqha = sizing.is_too_long(vb, va_i);
+          if (sqha != std::nullopt)
           {
             collapse_ok = false;
             break;
@@ -818,10 +818,10 @@ namespace internal {
             //insert new/remaining short edges
             for (halfedge_descriptor ht : halfedges_around_target(vkept, mesh_))
             {
-              boost::optional<double> sqlen = sizing.is_too_short(ht, mesh_);
-              if (sqlen != boost::none
+              std::optional<double> sqlen = sizing.is_too_short(ht, mesh_);
+              if (sqlen != std::nullopt
                 && is_collapse_allowed(edge(ht, mesh_), collapse_constraints))
-                short_edges.insert(short_edge(ht, sqlen.get()));
+                short_edges.insert(short_edge(ht, sqlen.value()));
             }
           }
         }//end if(collapse_ok)
@@ -1768,9 +1768,9 @@ namespace internal {
             //insert new edges in 'short_edges'
             if (is_collapse_allowed(edge(hf, mesh_), collapse_constraints))
             {
-              boost::optional<double> sqlen = sizing.is_too_short(hf, mesh_);
-              if (sqlen != boost::none)
-                short_edges.insert(typename Bimap::value_type(hf, sqlen.get()));
+              std::optional<double> sqlen = sizing.is_too_short(hf, mesh_);
+              if (sqlen != std::nullopt)
+                short_edges.insert(typename Bimap::value_type(hf, sqlen.value()));
             }
 
             if(!is_border(hf, mesh_) &&
@@ -1986,7 +1986,7 @@ namespace internal {
     bool check_normals(const HalfedgeRange& hedges) const
     {
       std::size_t nb_patches = patch_id_to_index_map.size();
-      //std::vector<boost::optional<Vector_3> > normal_per_patch(nb_patches,boost::none);
+      //std::vector<std::optional<Vector_3> > normal_per_patch(nb_patches,std::nullopt);
       std::vector<bool> initialized(nb_patches,false);
       std::vector<Vector_3> normal_per_patch(nb_patches);
 

From 4ca59942bf63bbde8df5850f5eb34e287ba793f0 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Mon, 21 Aug 2023 22:09:38 +0200
Subject: [PATCH 0649/1398] Document Sizing_field_base

---
 .../Isotropic_remeshing/Sizing_field_base.h      | 16 +++++++++++++++-
 1 file changed, 15 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
index d433a4c16d61..55cdfceff24e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
@@ -25,7 +25,21 @@ namespace CGAL
 namespace Polygon_mesh_processing
 {
 /*!
-* Sizing field virtual class
+* \ingroup PMP_meshing_grp
+* pure virtual class serving as a base for sizing field classes utilized in isotropic
+* remeshing.
+*
+* \cgalModels PMPSizingField
+*
+* \sa `isotropic_remeshing`
+* \sa `Uniform_sizing_field`
+* \sa `Adaptive_sizing_field`
+*
+* @tparam PolygonMesh model of `MutableFaceGraph` that
+*         has an internal property map for `CGAL::vertex_point_t`.
+* @tparam VPMap a property map associating points to the vertices of `pmesh`.
+*         It is a a class model of `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*         as key type and `%Point_3` as value type. Default is `boost::get(CGAL::vertex_point, pmesh)`.
 */
 template <class PolygonMesh,
           class VPMap = typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>

From b48ef206d962eb15beb8392faaa3f3e3ef78b883 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 22 Aug 2023 09:11:09 +0100
Subject: [PATCH 0650/1398] Arrangement: small doc fixes

---
 .../doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index 5254543120c7..cea994341a9d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -4780,7 +4780,7 @@ or line segments. The \link Arr_conic_traits_2::Curve_2
 `Curve_2`\endlink and the derived \link
 Arr_conic_traits_2::X_monotone_curve_2 `X_monotone_curve_2`\endlink
 classes also support basic access functions such as `source()`,
-`target()`, and `orientation()`.
+`target()`, and `%orientation()`.
 
 <!-- ------------------------------------------------------------------------- -->
 \cgalFigureBegin{aos_fig-conics,conics.png}
@@ -5067,7 +5067,7 @@ substitute the template parameters `RatKernel`, `AlgKernel`, and
 the same requirements of the corresponding types used to instantiate
 the `Arr_conic_traits_2` class template. Here, the use of the
 `CORE_algebraic_number_traits` class is also recommended with
-Cartesian kernels instantiated with the `Rational` and `Algebraic`
+%Cartesian kernels instantiated with the `Rational` and `Algebraic`
 number types defined by this class. The examples given in this manual
 use the type definitions listed below. These types are defined in the
 header file `arr_Bezier.h`.

From 6f4804fd1e1aa8068467e5f1a629434b5faf5b6e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 22 Aug 2023 10:02:18 +0100
Subject: [PATCH 0651/1398] More fixes

---
 .../doc/Algebraic_foundations/Algebraic_foundations.txt      | 5 ++---
 Number_types/doc/Number_types/NumberTypeSupport.txt          | 4 ++--
 Stream_support/doc/Stream_support/IOstream.txt               | 3 +--
 3 files changed, 5 insertions(+), 7 deletions(-)

diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Algebraic_foundations.txt b/Algebraic_foundations/doc/Algebraic_foundations/Algebraic_foundations.txt
index 890716d2c09b..80a69b1719a8 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Algebraic_foundations.txt
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Algebraic_foundations.txt
@@ -169,8 +169,8 @@ Every \cgal `Kernel` comes with two <I>real number types</I>
 (number types embeddable into the real numbers). One of them is a
 `FieldNumberType`, and the other a `RingNumberType`. The
 coordinates of the basic kernel objects (points, vectors, etc.) come
-from one of these types (the `FieldNumberType` in case of Cartesian
-kernels, and the `RingNumberType` for Homogeneous kernels).
+from one of these types (the `FieldNumberType` in case of %Cartesian
+kernels, and the `RingNumberType` for %Homogeneous kernels).
 
 The concept `FieldNumberType` combines the requirements of the
 concepts `Field` and `RealEmbeddable`, while
@@ -277,4 +277,3 @@ subsequent chapters.
 
 */
 } /* namespace CGAL */
-
diff --git a/Number_types/doc/Number_types/NumberTypeSupport.txt b/Number_types/doc/Number_types/NumberTypeSupport.txt
index 705e1fe6d272..d22aee9d648a 100644
--- a/Number_types/doc/Number_types/NumberTypeSupport.txt
+++ b/Number_types/doc/Number_types/NumberTypeSupport.txt
@@ -120,7 +120,7 @@ To use these classes, \gmp and \mpfr must be installed.
 \anchor ledant
 
 \leda provides number types that can be used for exact computation
-with both Cartesian and homogeneous representations. If you are using
+with both %Cartesian and homogeneous representations. If you are using
 homogeneous representation with the built-in integer types
 `short`, `int`, and `long` as ring type, exactness of
 computations can be guaranteed only if your input data come from a
@@ -130,7 +130,7 @@ integers of arbitrary length. (Of course the length is
 somehow bounded by the resources of your computer.) It can be used as
 ring type in homogeneous kernels and leads to exact
 computation as long as all intermediate results are rational. For the
-same kind of problems, Cartesian representation with number type
+same kind of problems, %Cartesian representation with number type
 `leda_rational` leads to exact computation as well.
 The number type `leda_bigfloat` in \leda is a variable precision
 floating-point type. Rounding mode and precision (i.e.\ mantissa length) of
diff --git a/Stream_support/doc/Stream_support/IOstream.txt b/Stream_support/doc/Stream_support/IOstream.txt
index cfdf25073ec2..be0f7ee02a9a 100644
--- a/Stream_support/doc/Stream_support/IOstream.txt
+++ b/Stream_support/doc/Stream_support/IOstream.txt
@@ -69,7 +69,7 @@ as a sequence of four byte. The format depends on the machine.
 The mode `PRETTY`
 serves mainly for debugging as the type of the geometric
 object is written, as well as the data defining the object. For example
-for a point at the origin with Cartesian double coordinates, the output
+for a point at the origin with %Cartesian double coordinates, the output
 would be `PointC2(0.0, 0.0)`. At the moment \cgal does not
 provide input operations for pretty printed data. By default a stream
 is in \ascii mode.
@@ -519,4 +519,3 @@ which might look as follows:
 
 */
 } /* namespace CGAL */
-

From 55ea7ba7ecd2a88b4ac322ce34a50277b90c9a6e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 22 Aug 2023 10:21:46 +0100
Subject: [PATCH 0652/1398] More fixes

---
 .../Concepts/FieldNumberType.h                |  3 +-
 .../CGAL/Arr_circle_segment_traits_2.h        |  2 +-
 .../CGAL/Arr_conic_traits_2.h                 |  2 +-
 .../Concepts/BarycentricTraits_2.h            |  4 +-
 .../CGAL/Approximate_min_ellipsoid_d.h        |  8 +--
 .../CGAL/Min_ellipse_2_traits_2.h             |  2 +-
 .../CGAL/Min_sphere_of_spheres_d.h            |  2 +-
 .../doc/Kernel_23/CGAL/Filtered_predicate.h   |  2 +-
 .../Kernel_23/CGAL/Kernel/global_functions.h  | 28 ++++----
 Kernel_23/doc/Kernel_23/CGAL/Vector_2.h       | 12 ++--
 .../Concepts/FunctionObjectConcepts.h         | 68 +++++++++----------
 Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h          |  4 +-
 .../Kernel--CartesianConstIterator_d.h        |  3 +-
 .../Nef_2/Concepts/ExtendedKernelTraits_2.h   |  3 +-
 .../Concepts/PMPDistanceTraits.h              |  2 +-
 .../Concepts/PolynomialTraits_d--IsZeroAt.h   |  5 +-
 .../Concepts/PolynomialTraits_d--SignAt.h     |  5 +-
 .../Concepts/EfficientRANSACTraits.h          |  8 +--
 .../doc/Spatial_searching/CGAL/Fuzzy_sphere.h |  2 +-
 .../Concepts/FuzzyQueryItem.h                 |  2 +-
 .../Concepts/RawPoint_3.h                     |  2 +-
 .../MeanCurvatureSkeletonizationTraits.h      |  3 +-
 22 files changed, 83 insertions(+), 89 deletions(-)

diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
index 8609a9a9cbe7..ed902b7c3f1c 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FieldNumberType.h
@@ -5,7 +5,7 @@
 The concept `FieldNumberType` combines the requirements of the concepts
 `Field` and `RealEmbeddable`.
 A model of `FieldNumberType` can be used as a template parameter
-for Cartesian kernels.
+for %Cartesian kernels.
 
 \cgalRefines{Field,RealEmbeddable}
 
@@ -32,4 +32,3 @@ class FieldNumberType {
 /// @}
 
 }; /* end FieldNumberType */
-
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circle_segment_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circle_segment_traits_2.h
index 43b7d56bcf8c..f7a5ec818200 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circle_segment_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_circle_segment_traits_2.h
@@ -168,7 +168,7 @@ class Arr_circle_segment_traits_2 {
 
 
   /*! The `Point_2` number-type nested within the traits class represents
-   * a Cartesian point whose coordinates are algebraic numbers of type
+   * a %Cartesian point whose coordinates are algebraic numbers of type
    * `CoordNT`.
    */
   class Point_2 {
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
index fe6e70de9c59..4d7d479fed92 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
@@ -274,7 +274,7 @@ class Arr_conic_traits_2 {
      */
     Point_2(const Algebraic& hx, const Algebraic& hy, const Algebraic& hz);
 
-    /*! constructs from Cartesian coordinates.
+    /*! constructs from %Cartesian coordinates.
      */
     Point_2(const Algebraic& x, const Algebraic& y);:
 
diff --git a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h
index 1fe3c8fc2bd5..ba6951b76144 100644
--- a/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h
+++ b/Barycentric_coordinates_2/doc/Barycentric_coordinates_2/Concepts/BarycentricTraits_2.h
@@ -159,7 +159,7 @@ typedef unspecified_type Less_xy_2;
 
   `Comparison_result operator(const Point_2& p, const Point_2& q)`
 
-  that compares the Cartesian x-coordinates of the points `p` and `q`.
+  that compares the %Cartesian x-coordinates of the points `p` and `q`.
 */
 typedef unspecified_type Compare_x_2;
 
@@ -168,7 +168,7 @@ typedef unspecified_type Compare_x_2;
 
   `Comparison_result operator(const Point_2& p, const Point_2& q)`
 
-  that compares the Cartesian y-coordinates of the points `p` and `q`.
+  that compares the %Cartesian y-coordinates of the points `p` and `q`.
 */
 typedef unspecified_type Compare_y_2;
 
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d.h
index 856d1a169296..7b48c2fc1147 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Approximate_min_ellipsoid_d.h
@@ -8,7 +8,7 @@ An object of class `Approximate_min_ellipsoid_d` is an approximation to the
 ellipsoid of smallest volume enclosing a finite multiset of points
 in \f$ d\f$-dimensional Euclidean space \f$ \E^d\f$, \f$ d\ge 2\f$.
 
-An <I>ellipsoid</I> in \f$ \E^d\f$ is a Cartesian pointset of the form \f$ \{
+An <I>ellipsoid</I> in \f$ \E^d\f$ is a %Cartesian pointset of the form \f$ \{
 x\in\E^d \mid x^T E x + x^T e + \eta\leq 0 \}\f$, where \f$ E\f$ is some
 positive definite matrix from the set \f$ \mathbb{R}^{d\times d}\f$, \f$ e\f$ is some
 real \f$ d\f$-vector, and \f$ \eta\in\mathbb{R}\f$. A pointset \f$ P\subseteq \E^d\f$ is
@@ -94,7 +94,7 @@ is actually achieved; the performance of the algorithm in this respect
 highly depends on the input pointset. Values of at least \f$ 0.01\f$ for
 \f$ \epsilon\f$ are usually handled without problems.
 
-Internally, the algorithm represents the input points' Cartesian
+Internally, the algorithm represents the input points' %Cartesian
 coordinates as `double`'s. For this conversion to work, the input
 point coordinates must be convertible to `double`. Also, in order
 to compute the achieved epsilon \f$ \epsilon'\f$ mentioned above, the algorithm
@@ -171,7 +171,7 @@ typedef unspecified_type Cartesian_const_iterator;
 /*!
 A model of STL concept
 `RandomAccessIterator` with value type `double` that is used
-to iterate over the Cartesian center coordinates of the computed
+to iterate over the %Cartesian center coordinates of the computed
 ellipsoid, see `center_cartesian_begin()`.
 */
 typedef unspecified_type Center_coordinate_iterator;
@@ -313,7 +313,7 @@ int dimension() const;
 
 /*!
 
-returns an iterator pointing to the first of the \f$ d\f$ Cartesian
+returns an iterator pointing to the first of the \f$ d\f$ %Cartesian
 coordinates of the computed ellipsoid's center.
 
 The returned point is a floating-point approximation to the
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_ellipse_2_traits_2.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_ellipse_2_traits_2.h
index 25b54759c1a2..49c9b0c7485b 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_ellipse_2_traits_2.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_ellipse_2_traits_2.h
@@ -46,7 +46,7 @@ bool is_circle();
 
 /*!
 gives a double approximation of the
-ellipse's conic equation. If `K` is a Cartesian kernel, the ellipse
+ellipse's conic equation. If `K` is a %Cartesian kernel, the ellipse
 is the set of all points \f$ (x,y)\f$ satisfying \f$ rx^2+sy^2+txy+ux+vy+w=0\f$. In the
 Homogeneous case, the ellipse is the set of points \f$ (hx,hy,hw)\f$ satisfying
 \f$ r(hx)^2+s(hy)^2+t(hx)(hy)+u(hx)(hw)+v(hy)(hw)+w(hw)^2=0\f$.
diff --git a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h
index fbcd5f02e2dc..3590abf82a7d 100644
--- a/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h
+++ b/Bounding_volumes/doc/Bounding_volumes/CGAL/Min_sphere_of_spheres_d.h
@@ -90,7 +90,7 @@ be used in such a case. (For exact number types
 Currently, we require `Traits::FT` to be either an exact number
 type or `double` or `float`; other inexact number types are
 not supported at this time. Also, the current implementation only
-handles spheres with Cartesian coordinates; homogeneous representation
+handles spheres with %Cartesian coordinates; homogeneous representation
 is not supported yet.
 
 \cgalHeading{Example}
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Filtered_predicate.h b/Kernel_23/doc/Kernel_23/CGAL/Filtered_predicate.h
index bad95b0defaa..b809ff933f28 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Filtered_predicate.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Filtered_predicate.h
@@ -21,7 +21,7 @@ we use the function objects `C2E` and `C2F`, which must be of the form
 \cgalHeading{Example}
 
 The following example defines an efficient and exact version of the
-orientation predicate over three points using the Cartesian representation
+orientation predicate over three points using the %Cartesian representation
 with double coordinates and without reference counting
 (`Simple_cartesian::Point_2`).
 Of course, the orientation predicate can already be found in the kernel, but
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
index 6be2530b49b6..1b7099243c9e 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
@@ -753,7 +753,7 @@ const CGAL::Point_3<Kernel>& r);
 /// @{
 
 /*!
-Compares the Cartesian coordinates of points `p` and
+Compares the %Cartesian coordinates of points `p` and
 `q` lexicographically in \f$ xy\f$ order: first
 \f$ x\f$-coordinates are compared, if they are equal, \f$ y\f$-coordinates
 are compared. This is the same function as `compare_xy` and exists for compatibility with `Point_d<Kernel>`.
@@ -763,7 +763,7 @@ Comparison_result
 compare_lexicographically(const CGAL::Point_2<Kernel>& p, const CGAL::Point_2<Kernel>& q);
 
 /*!
-Compares the Cartesian coordinates of points `p` and
+Compares the %Cartesian coordinates of points `p` and
 `q` lexicographically in \f$ xyz\f$ order: first
 \f$ x\f$-coordinates are compared, if they are equal, \f$ y\f$-coordinates
 are compared, and if both \f$ x\f$- and \f$ y\f$- coordinate are equal,
@@ -1144,7 +1144,7 @@ global function are available.
 /// @{
 
 /*!
-Compares the Cartesian coordinates of points `p` and
+Compares the %Cartesian coordinates of points `p` and
 `q` lexicographically in \f$ xy\f$ order: first
 \f$ x\f$-coordinates are compared, if they are equal, \f$ y\f$-coordinates
 are compared.
@@ -1154,7 +1154,7 @@ Comparison_result
 compare_xy(const CGAL::Point_2<Kernel>& p, const CGAL::Point_2<Kernel>& q);
 
 /*!
-Compares the Cartesian coordinates of points `p` and `q`
+Compares the %Cartesian coordinates of points `p` and `q`
 lexicographically in \f$ xy\f$ order: first \f$ x\f$-coordinates are
 compared, if they are equal, \f$ y\f$-coordinates are compared.
 
@@ -1177,7 +1177,7 @@ compare_xy(const CGAL::Point_3<Kernel>& p, const CGAL::Point_3<Kernel>& q);
 /// @{
 
 /*!
-Compares the \f$ x\f$ and \f$ y\f$ Cartesian coordinates of points `p` and
+Compares the \f$ x\f$ and \f$ y\f$ %Cartesian coordinates of points `p` and
 `q` lexicographically.
 */
 template <typename CircularKernel>
@@ -1186,7 +1186,7 @@ Comparison_result
             const CGAL::Circular_arc_point_2<CircularKernel> &q);
 
 /*!
-Compares the \f$ x\f$ and \f$ y\f$ Cartesian coordinates of points `p` and
+Compares the \f$ x\f$ and \f$ y\f$ %Cartesian coordinates of points `p` and
 `q` lexicographically.
 */
 template <typename CircularKernel>
@@ -1209,7 +1209,7 @@ compare_xy(const CGAL::Circular_arc_point_2<CircularKernel> &p,
 
 /*!
 
-Compares the \f$ x\f$ and \f$ y\f$ Cartesian coordinates of points `p` and
+Compares the \f$ x\f$ and \f$ y\f$ %Cartesian coordinates of points `p` and
 `q` lexicographically.
 */
 template <typename SphericalKernel>
@@ -1218,7 +1218,7 @@ Comparison_result
             const CGAL::Circular_arc_point_3<SphericalKernel> &q);
 /*!
 
-Compares the \f$ x\f$ and \f$ y\f$ Cartesian coordinates of points `p` and
+Compares the \f$ x\f$ and \f$ y\f$ %Cartesian coordinates of points `p` and
 `q` lexicographically.
 */
 template <typename SphericalKernel>
@@ -1442,13 +1442,13 @@ global function are available.
 */
 /// @{
 /*!
-  compares Cartesian \f$ y\f$-coordinates of `p` and `q`.
+  compares %Cartesian \f$ y\f$-coordinates of `p` and `q`.
 */
 template <typename Kernel>
 Comparison_result compare_y(const CGAL::Point_2<Kernel> &p,
                             const CGAL::Point_2<Kernel> &q);
 /*!
-  compares Cartesian \f$ y\f$-coordinates of `p` and `q`.
+  compares %Cartesian \f$ y\f$-coordinates of `p` and `q`.
 */
 template <typename Kernel>
 Comparison_result compare_y(const CGAL::Point_3<Kernel> &p,
@@ -1564,7 +1564,7 @@ global function are available.
 /// @{
 
 /*!
-Compares the Cartesian coordinates of points `p` and
+Compares the %Cartesian coordinates of points `p` and
 `q` lexicographically in \f$ xyz\f$ order: first
 \f$ x\f$-coordinates are compared, if they are equal, \f$ y\f$-coordinates
 are compared, and if both \f$ x\f$- and \f$ y\f$- coordinate are equal,
@@ -1587,7 +1587,7 @@ compare_xyz(const CGAL::Point_3<Kernel>& p, const CGAL::Point_3<Kernel>& q);
 */
 /// @{
 
-/*! Compares the Cartesian coordinates of points `p` and `q` lexicographically.
+/*! Compares the %Cartesian coordinates of points `p` and `q` lexicographically.
 */
 template <typename SphericalKernel>
 Comparison_result
@@ -1595,7 +1595,7 @@ compare_xyz(const CGAL::Circular_arc_point_3<SphericalKernel> &p,
 const CGAL::Circular_arc_point_3<SphericalKernel> &q);
 
 /*!
-Compares the Cartesian coordinates of points `p` and `q` lexicographically.
+Compares the %Cartesian coordinates of points `p` and `q` lexicographically.
 */
 template <typename SphericalKernel>
 Comparison_result
@@ -1682,7 +1682,7 @@ compare_z(const CGAL::Circular_arc_point_3<SphericalKernel> &p, const CGAL::Poin
 /// @{
 
 /*!
-Compares the Cartesian coordinates of points `p` and
+Compares the %Cartesian coordinates of points `p` and
 `q` lexicographically in \f$ yx\f$ order: first
 \f$ y\f$-coordinates are compared, if they are equal, \f$ x\f$-coordinates
 are compared.
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h b/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
index eaeab03a882a..df1aa0c913b8 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Vector_2.h
@@ -13,7 +13,7 @@ will explicitly state where you can pass this constant as an argument
 instead of a vector initialized with zeros.
 
 \cgalModels `Kernel::Vector_2`
-\cgalModels `Hashable` if `Kernel` is a cartesian kernel and if `Kernel::FT` is `Hashable`
+\cgalModels `Hashable` if `Kernel` is a %Cartesian kernel and if `Kernel::FT` is `Hashable`
 
 */
 template< typename Kernel >
@@ -25,7 +25,7 @@ class Vector_2 {
 
 /*!
 An iterator for enumerating the
-Cartesian coordinates of a vector.
+%Cartesian coordinates of a vector.
 */
 typedef unspecified_type Cartesian_const_iterator;
 
@@ -119,7 +119,7 @@ Kernel::FT y() const;
 
 /// \name Convenience Operators
 /// The following operations are for convenience and for compatibility
-/// with higher dimensional vectors. Again they come in a Cartesian
+/// with higher dimensional vectors. Again they come in a %Cartesian
 /// and homogeneous flavor.
 /// @{
 
@@ -131,7 +131,7 @@ returns the i'th homogeneous coordinate of `v`.
 Kernel::RT homogeneous(int i) const;
 
 /*!
-returns the i'th Cartesian coordinate of `v`.
+returns the i'th %Cartesian coordinate of `v`.
 \pre `0 <= i <= 1`.
 */
 Kernel::FT cartesian(int i) const;
@@ -143,13 +143,13 @@ returns `cartesian(i)`.
 Kernel::FT operator[](int i) const;
 
 /*!
-returns an iterator to the Cartesian coordinates
+returns an iterator to the %Cartesian coordinates
 of `v`, starting with the 0th coordinate.
 */
 Cartesian_const_iterator cartesian_begin() const;
 
 /*!
-returns an off the end iterator to the Cartesian
+returns an off the end iterator to the %Cartesian
 coordinates of `v`.
 */
 Cartesian_const_iterator cartesian_end() const;
diff --git a/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h b/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h
index bdd0dff34731..7e4e66615233 100644
--- a/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h
+++ b/Kernel_23/doc/Kernel_23/Concepts/FunctionObjectConcepts.h
@@ -478,7 +478,7 @@ class BoundedSide_3 {
   \ingroup PkgKernel23ConceptsFunctionObjects
   \cgalConcept
 
-  A type representing an iterator to the Cartesian coordinates of a point
+  A type representing an iterator to the %Cartesian coordinates of a point
   in two dimensions.
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
@@ -495,7 +495,7 @@ class CartesianConstIterator_2 {
   \ingroup PkgKernel23ConceptsFunctionObjects
   \cgalConcept
 
-  A type representing an iterator to the Cartesian coordinates of a point
+  A type representing an iterator to the %Cartesian coordinates of a point
   in three dimensions.
 
   \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
@@ -1365,7 +1365,7 @@ class CompareXYZ_3 {
   /// @{
 
   /*!
-    Compares the Cartesian coordinates of points `p` and
+    Compares the %Cartesian coordinates of points `p` and
     `q` lexicographically in \f$ xyz\f$ order: first
     \f$ x\f$-coordinates are compared, if they are equal, \f$ y\f$-coordinates
     are compared. If they are equal, \f$ z\f$-coordinates are compared.
@@ -1395,7 +1395,7 @@ class CompareXY_2 {
   /// @{
 
   /*!
-    Compares the Cartesian coordinates of points `p` and
+    Compares the %Cartesian coordinates of points `p` and
     `q` lexicographically in \f$ xy\f$ order: first
     \f$ x\f$-coordinates are compared, if they are equal, \f$ y\f$-coordinates
     are compared.
@@ -1425,7 +1425,7 @@ class CompareXY_3 {
 
 
   /*!
-    Compares the Cartesian coordinates of points `p` and
+    Compares the %Cartesian coordinates of points `p` and
     `q` lexicographically in \f$ xy\f$ order: first
     \f$ x\f$-coordinates are compared, if they are equal, \f$ y\f$-coordinates
     are compared.
@@ -1458,7 +1458,7 @@ class CompareX_2 {
   /// @{
 
   /*!
-    compares the Cartesian \f$ x\f$-coordinates of points `p` and `q`
+    compares the %Cartesian \f$ x\f$-coordinates of points `p` and `q`
   */
   Comparison_result operator()(const Kernel::Point_2&p,
                                const Kernel::Point_2&q);
@@ -1514,7 +1514,7 @@ class CompareX_3 {
   /// @{
 
   /*!
-    Compares the Cartesian \f$ x\f$-coordinates of points `p` and
+    Compares the %Cartesian \f$ x\f$-coordinates of points `p` and
     `q`
   */
   Comparison_result operator()(const Kernel::Point_3&p,
@@ -1633,7 +1633,7 @@ class CompareYX_2 {
   /// @{
 
   /*!
-    Compares the Cartesian coordinates of points `p` and
+    Compares the %Cartesian coordinates of points `p` and
     `q` lexicographically in \f$ yx\f$ order: first
     \f$ y\f$-coordinates are compared, if they are equal, \f$ x\f$-coordinates
     are compared.
@@ -1666,7 +1666,7 @@ class CompareY_2 {
   /// @{
 
   /*!
-    Compares the Cartesian \f$ y\f$-coordinates of points `p` and
+    Compares the %Cartesian \f$ y\f$-coordinates of points `p` and
     `q`
   */
   Comparison_result operator()(const Kernel::Point_2&p,
@@ -1725,7 +1725,7 @@ class CompareY_3 {
   /// @{
 
   /*!
-    Compares the Cartesian \f$ y\f$-coordinates of points `p` and
+    Compares the %Cartesian \f$ y\f$-coordinates of points `p` and
     `q`
   */
   Comparison_result operator()(const Kernel::Point_3&p,
@@ -1752,7 +1752,7 @@ class CompareZ_3 {
   /// @{
 
   /*!
-    Compares the Cartesian \f$ z\f$-coordinates of points `p` and
+    Compares the %Cartesian \f$ z\f$-coordinates of points `p` and
     `q`
   */
   Comparison_result operator()(const Kernel::Point_3&p,
@@ -3983,25 +3983,25 @@ class ConstructCartesianConstIterator_2 {
 
 
   /*!
-    returns an iterator on the 0'th Cartesian coordinate of `p`.
+    returns an iterator on the 0'th %Cartesian coordinate of `p`.
   */
   Kernel::Cartesian_const_iterator_2 operator()(const Kernel::Point_2
                                                 &p);
 
   /*!
-    returns the past the end iterator of the Cartesian coordinates of `p`.
+    returns the past the end iterator of the %Cartesian coordinates of `p`.
   */
   Kernel::Cartesian_const_iterator_2 operator()(const Kernel::Point_2
                                                 &p, int);
 
   /*!
-    returns an iterator on the 0'th Cartesian coordinate of `v`.
+    returns an iterator on the 0'th %Cartesian coordinate of `v`.
   */
   Kernel::Cartesian_const_iterator_2 operator()(const Kernel::Vector_2
                                                 &v);
 
   /*!
-    returns the past the end iterator of the Cartesian coordinates of `v`.
+    returns the past the end iterator of the %Cartesian coordinates of `v`.
   */
   Kernel::Cartesian_const_iterator_2 operator()(const Kernel::Vector_2
                                                 &v, int);
@@ -4028,25 +4028,25 @@ class ConstructCartesianConstIterator_3 {
   /// @{
 
   /*!
-    returns an iterator on the 0'th Cartesian coordinate of `p`.
+    returns an iterator on the 0'th %Cartesian coordinate of `p`.
   */
   Kernel::Cartesian_const_iterator_3 operator()(const Kernel::Point_3
                                                 &p);
 
   /*!
-    returns the past the end iterator of the Cartesian coordinates of `p`.
+    returns the past the end iterator of the %Cartesian coordinates of `p`.
   */
   Kernel::Cartesian_const_iterator_3 operator()(const Kernel::Point_3
                                                 &p, int);
 
   /*!
-    returns an iterator on the 0'th Cartesian coordinate of `v`.
+    returns an iterator on the 0'th %Cartesian coordinate of `v`.
   */
   Kernel::Cartesian_const_iterator_3 operator()(const Kernel::Vector_3
                                                 &v);
 
   /*!
-    returns the past the end iterator of the Cartesian coordinates of `v`.
+    returns the past the end iterator of the %Cartesian coordinates of `v`.
   */
   Kernel::Cartesian_const_iterator_3 operator()(const Kernel::Vector_3
                                                 &v, int);
@@ -5992,7 +5992,7 @@ class ConstructPoint_2 {
   /// @{
 
   /*!
-    introduces a variable with Cartesian coordinates
+    introduces a variable with %Cartesian coordinates
     \f$ (0,0)\f$.
   */
   Kernel::Point_2 operator()(const CGAL::Origin &CGAL::ORIGIN);
@@ -6033,7 +6033,7 @@ class ConstructPoint_3 {
   /// @{
 
   /*!
-    introduces a point with Cartesian coordinates\f$ (0,0,0)\f$.
+    introduces a point with %Cartesian coordinates\f$ (0,0,0)\f$.
   */
   Kernel::Point_3 operator()(const CGAL::Origin &CGAL::ORIGIN);
 
@@ -7287,19 +7287,19 @@ class ConstructWeightedPoint_2
   /// @{
 
   /*!
-    introduces a weighted point with Cartesian coordinates
+    introduces a weighted point with %Cartesian coordinates
     \f$ (0,0)\f$ and weight \f$ 0 \f$.
   */
   Kernel::Weighted_point_2 operator()(const CGAL::Origin &CGAL::ORIGIN);
 
  /*!
-    introduces a weighted point with Cartesian coordinates
+    introduces a weighted point with %Cartesian coordinates
     those of \f$ p \f$ and weight \f$ 0 \f$.
   */
   Kernel::Weighted_point_2 operator()(const Kernel::Point_2& p);
 
   /*!
-     introduces a weighted point with Cartesian coordinates
+     introduces a weighted point with %Cartesian coordinates
      those of \f$ p \f$ and weight \f$ w \f$.
    */
    Kernel::Weighted_point_2 operator()(const Kernel::Point_2& p, const Kernel::FT& w);
@@ -7325,19 +7325,19 @@ class ConstructWeightedPoint_3
   /// @{
 
   /*!
-    introduces a weighted point with Cartesian coordinates
+    introduces a weighted point with %Cartesian coordinates
     \f$ (0,0,0)\f$ and weight \f$ 0 \f$.
   */
   Kernel::Weighted_point_3 operator()(const CGAL::Origin &CGAL::ORIGIN);
 
  /*!
-    introduces a weighted point with Cartesian coordinates
+    introduces a weighted point with %Cartesian coordinates
     those of \f$ p \f$ and weight \f$ 0 \f$.
   */
   Kernel::Weighted_point_3 operator()(const Kernel::Point_3& p);
 
   /*!
-     introduces a weighted point with Cartesian coordinates
+     introduces a weighted point with %Cartesian coordinates
      those of \f$ p \f$ and weight \f$ w \f$.
    */
    Kernel::Weighted_point_3 operator()(const Kernel::Point_3& p, const Kernel::FT& w);
@@ -7590,8 +7590,8 @@ class EqualXY_3 {
 
 
   /*!
-    returns true iff `p` and `q` have the same Cartesian \f$ x\f$-coordinate
-    and the same Cartesian \f$ y\f$-coordinate.
+    returns true iff `p` and `q` have the same %Cartesian \f$ x\f$-coordinate
+    and the same %Cartesian \f$ y\f$-coordinate.
   */
   bool operator()(const Kernel::Point_3&p,
                   const Kernel::Point_3&q);
@@ -7617,7 +7617,7 @@ class EqualX_2 {
   /// @{
 
   /*!
-    returns true iff `p` and `q` have the same Cartesian \f$ x\f$-coordinate.
+    returns true iff `p` and `q` have the same %Cartesian \f$ x\f$-coordinate.
   */
   bool operator()(const Kernel::Point_2&p,
                   const Kernel::Point_2&q);
@@ -7643,7 +7643,7 @@ class EqualX_3 {
   /// @{
 
   /*!
-    returns true iff `p` and `q` have the same Cartesian \f$ x\f$-coordinate.
+    returns true iff `p` and `q` have the same %Cartesian \f$ x\f$-coordinate.
   */
   bool operator()(const Kernel::Point_3&p,
                   const Kernel::Point_3&q);
@@ -7669,7 +7669,7 @@ class EqualY_2 {
   /// @{
 
   /*!
-    returns true iff `p` and `q` have the same Cartesian \f$ y\f$-coordinate.
+    returns true iff `p` and `q` have the same %Cartesian \f$ y\f$-coordinate.
   */
   bool operator()(const Kernel::Point_2&p,
                   const Kernel::Point_2&q);
@@ -7695,7 +7695,7 @@ class EqualY_3 {
   /// @{
 
   /*!
-    returns true iff `p` and `q` have the same Cartesian \f$ y\f$-coordinate.
+    returns true iff `p` and `q` have the same %Cartesian \f$ y\f$-coordinate.
   */
   bool operator()(const Kernel::Point_3&p,
                   const Kernel::Point_3&q);
@@ -7721,7 +7721,7 @@ class EqualZ_3 {
   /// @{
 
   /*!
-    returns true iff `p` and `q` have the same Cartesian \f$ z\f$-coordinate.
+    returns true iff `p` and `q` have the same %Cartesian \f$ z\f$-coordinate.
   */
   bool operator()(const Kernel::Point_3&p,
                   const Kernel::Point_3&q);
diff --git a/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h b/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h
index 4fcacb5b5841..ce91a8107dd0 100644
--- a/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h
+++ b/Kernel_d/doc/Kernel_d/CGAL/Epeck_d.h
@@ -79,9 +79,9 @@ Point_d(ForwardIterator first, ForwardIterator end);
     \pre `i` is non-negative and less than the dimension. */
 double operator[](int i)const;
 
-/*! returns an iterator pointing to the zeroth Cartesian coordinate. */
+/*! returns an iterator pointing to the zeroth %Cartesian coordinate. */
 Cartesian_const_iterator_d cartesian_begin()const;
-/*! returns an iterator pointing beyond the last Cartesian coordinate. */
+/*! returns an iterator pointing beyond the last %Cartesian coordinate. */
 Cartesian_const_iterator_d cartesian_end()const;
 };
 
diff --git a/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h b/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h
index c951a0735efc..b42e7d362031 100644
--- a/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h
+++ b/Kernel_d/doc/Kernel_d/Concepts/Kernel--CartesianConstIterator_d.h
@@ -3,7 +3,7 @@
 \ingroup PkgKernelDKernelConcept
 \cgalConcept
 
-A type representing an iterator to the Cartesian coordinates of a point
+A type representing an iterator to the %Cartesian coordinates of a point
 in `d` dimensions.
 
 \cgalRefines{CopyConstructible,Assignable,DefaultConstructible}
@@ -18,4 +18,3 @@ class Kernel_d::CartesianConstIterator_d {
 public:
 
 }; /* end Kernel_d::CartesianConstIterator_d */
-
diff --git a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
index 8d5e82f7fed8..7fa1febc458d 100644
--- a/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
+++ b/Nef_2/doc/Nef_2/Concepts/ExtendedKernelTraits_2.h
@@ -8,7 +8,7 @@ geometry\cgalFootnote{It is called extended geometry for simplicity,
 though it is not a real geometry in the classical sense}. Let `K` be
 an instance of the data type `ExtendedKernelTraits_2`. The central
 notion of extended geometry are extended points. An extended point
-represents either a standard affine point of the Cartesian plane or a
+represents either a standard affine point of the %Cartesian plane or a
 non-standard point representing the equivalence class of rays where
 two rays are equivalent if one is contained in the other.
 
@@ -353,4 +353,3 @@ const char* output_identifier() ;
 /// @}
 
 }; /* end ExtendedKernelTraits_2 */
-
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h
index 61575e3ff892..df2bd3fe0e2a 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPDistanceTraits.h
@@ -19,7 +19,7 @@ class PMPDistanceTraits{
     /*! 3D point type
      * It must be default constructible, and can be constructed from 3 objects of type `FT`.
      * `bool operator<(Point_3, Point_3)` to lexicographically compare two points must be available.
-     * Access to Cartesian coordinates must be possible using `Point_3::x()`, `Point_3::y(), Point_3::z()` and
+     * Access to %Cartesian coordinates must be possible using `Point_3::x()`, `Point_3::y(), Point_3::z()` and
      * `FT operator[](int i)` with  `0 <= i < 3`.
      *
      * There must be a specialization of `CGAL::Kernel_traits` such that
diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAt.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAt.h
index 3f778a6fc9eb..1369e95f5182 100644
--- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAt.h
+++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--IsZeroAt.h
@@ -4,7 +4,7 @@
 \cgalConcept
 
 This `AdaptableFunctor` returns whether a
-`PolynomialTraits_d::Polynomial_d` \f$ p\f$ is zero at a given Cartesian point,
+`PolynomialTraits_d::Polynomial_d` \f$ p\f$ is zero at a given %Cartesian point,
 which is represented as an iterator range.
 
 \cgalRefines{AdaptableFunctor,CopyConstructible,DefaultConstructible}
@@ -32,7 +32,7 @@ typedef bool result_type;
 
 /*!
 
-Computes whether \f$ p\f$ is zero at the Cartesian point given by the iterator range,
+Computes whether \f$ p\f$ is zero at the %Cartesian point given by the iterator range,
 where `begin` is referring to the innermost variable.
 
 \pre (end-begin == `PolynomialTraits_d::d`)
@@ -47,4 +47,3 @@ InputIterator end );
 /// @}
 
 }; /* end PolynomialTraits_d::IsZeroAt */
-
diff --git a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAt.h b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAt.h
index 89dc6556dadc..d1645dd00e29 100644
--- a/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAt.h
+++ b/Polynomial/doc/Polynomial/Concepts/PolynomialTraits_d--SignAt.h
@@ -4,7 +4,7 @@
 \cgalConcept
 
 This `AdaptableFunctor` returns the sign of a
-`PolynomialTraits_d::Polynomial_d` \f$ p\f$ at given Cartesian point represented
+`PolynomialTraits_d::Polynomial_d` \f$ p\f$ at given %Cartesian point represented
 as an iterator range.
 
 This functor is well defined if `PolynomialTraits_d::Innermost_coefficient_type` is
@@ -35,7 +35,7 @@ typedef CGAL::Sign result_type;
 
 /*!
 
-Returns the sign of \f$ p\f$ at the given Cartesian point, where `begin` is referring
+Returns the sign of \f$ p\f$ at the given %Cartesian point, where `begin` is referring
 to the innermost variable.
 \pre (`end-begin` == `PolynomialTraits_d::d`)
 \pre `std::iterator_traits< InputIterator >::%value_type` is `ExplicitInteroperable` with `PolynomialTraits_d::Innermost_coefficient_type`.
@@ -49,4 +49,3 @@ InputIterator end );
 /// @}
 
 }; /* end PolynomialTraits_d::SignAt */
-
diff --git a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
index 5441f324e943..a4f915567b47 100644
--- a/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
+++ b/Shape_detection/doc/Shape_detection/Concepts/EfficientRANSACTraits.h
@@ -39,7 +39,7 @@ class EfficientRANSACTraits{
   /// The 2D vector type, only required if you want to detect tori
   typedef unspecified_type Vector_2;
 
-  /// The number type of the Cartesian coordinates of types Point_3
+  /// The number type of the %Cartesian coordinates of types Point_3
   typedef unspecified_type FT;
 
   /// A model of the concept `Range` with random access iterators, providing input points and normals
@@ -63,9 +63,9 @@ class EfficientRANSACTraits{
   /*!
    * Function object type that provides
    * `Point_3 operator()(Origin p)`
-   * returning the point with 0, 0, 0 as Cartesian coordinates
+   * returning the point with 0, 0, 0 as %Cartesian coordinates
    * and `Point_3 operator()(FT x, FT y, FT z)`
-   * returning the point with `x`, `y` and `z` as Cartesian coordinates.
+   * returning the point with `x`, `y` and `z` as %Cartesian coordinates.
    */
   typedef unspecified_type Construct_point_3;
 
@@ -106,7 +106,7 @@ class EfficientRANSACTraits{
   /*!
    * Function object type that provides
    * `Point_2 operator()(FT x, FT y)`
-   * returning the 2D point with `x` and `y` as Cartesian coordinates.
+   * returning the 2D point with `x` and `y` as %Cartesian coordinates.
    * Only required if you want to detect tori.
    */
   typedef unspecified_type Construct_point_2;
diff --git a/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_sphere.h b/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_sphere.h
index dac7c110cb01..b9ee673a03ec 100644
--- a/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_sphere.h
+++ b/Spatial_searching/doc/Spatial_searching/CGAL/Fuzzy_sphere.h
@@ -76,7 +76,7 @@ less than \f$ r\f$.
 bool contains(const Point_d& p) const;
 
 /*!
-Test whether the fuzzy sphere contains the point whose Cartesian coordinates
+Test whether the fuzzy sphere contains the point whose %Cartesian coordinates
 are contained in the range [`begin`, `end`).
 */
 template <typename Coord_iterator>
diff --git a/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h b/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h
index a8aa2640a2c3..12ebb30eb80b 100644
--- a/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h
+++ b/Spatial_searching/doc/Spatial_searching/Concepts/FuzzyQueryItem.h
@@ -43,7 +43,7 @@ bool contains(Point_d p) const;
 /*!
 \note Optional: must be defined when used with a `Kd_tree` where `EnablePointsCache` is set to `Tag_true`.
 
-tests whether the query item contains the point whose Cartesian coordinates
+tests whether the query item contains the point whose %Cartesian coordinates
 are contained in the range [`begin`, `end`).
 */
 template <typename Coord_iterator>
diff --git a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/RawPoint_3.h b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/RawPoint_3.h
index 41b10daa4a71..32925160334d 100644
--- a/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/RawPoint_3.h
+++ b/Surface_mesh_deformation/doc/Surface_mesh_deformation/Concepts/RawPoint_3.h
@@ -9,7 +9,7 @@ class RawPoint_3
 public:
 /// \name Creation
 /// @{
-  /// constructor from Cartesian coordinates
+  /// constructor from %Cartesian coordinates
   RawPoint_3(double x, double y, double z);
 /// @}
 
diff --git a/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h b/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h
index 824b21454e51..c5713628db93 100644
--- a/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h
+++ b/Surface_mesh_skeletonization/doc/Surface_mesh_skeletonization/Concepts/MeanCurvatureSkeletonizationTraits.h
@@ -28,7 +28,7 @@ typedef unspecified_type FT;
 /*!
  * Function object type that provides
  * `Point_3 operator()(FT x, FT y, FT z) const`
- * returning the point with `x`, `y` and `z` as Cartesian coordinates.
+ * returning the point with `x`, `y` and `z` as %Cartesian coordinates.
  */
 typedef unspecified_type Construct_point_3;
 
@@ -186,4 +186,3 @@ compute_z_3_object();
 /// @}
 
 }; /* end DelaunayTriangulationTraits_2 */
-

From c11711e728689171c40bc18fd7f8abb7e3e84add Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 22 Aug 2023 10:29:04 +0100
Subject: [PATCH 0653/1398] More fixes

---
 .../doc/Algebraic_foundations/Concepts/RingNumberType.h        | 3 +--
 Nef_3/doc/Nef_3/Nef_3.txt                                      | 2 +-
 2 files changed, 2 insertions(+), 3 deletions(-)

diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h
index a2b6c5036f02..fc53fb1f4ebf 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/RingNumberType.h
@@ -6,7 +6,7 @@
 The concept `RingNumberType` combines the requirements of the concepts
 `IntegralDomainWithoutDivision` and `RealEmbeddable`.
 A model of `RingNumberType` can be used as a template parameter
-for Homogeneous kernels.
+for homogeneous kernels.
 
 \cgalRefines{IntegralDomainWithoutDivision,RealEmbeddable}
 
@@ -32,4 +32,3 @@ class RingNumberType {
 public:
 
 }; /* end RingNumberType */
-
diff --git a/Nef_3/doc/Nef_3/Nef_3.txt b/Nef_3/doc/Nef_3/Nef_3.txt
index 60e98f188640..bd7de74fd27c 100644
--- a/Nef_3/doc/Nef_3/Nef_3.txt
+++ b/Nef_3/doc/Nef_3/Nef_3.txt
@@ -448,7 +448,7 @@ We recommend the use of the \cgal kernels `Homogeneous`,
 The homogeneous kernel provides reliable fast performance. In combination with
 `leda_integer` it is the fastest kernel for `Nef_polyhedron_3`. The
 `Exact_predicates_exact_constructions_kernel` uses filtering. In non-degenerate
-scenarios it's faster than the Homogeneous kernel. The most
+scenarios it's faster than the homogeneous kernel. The most
 important advantage of the filtered kernel is that it is a %Cartesian
 kernel, which allows the proper handling of OFF files using
 floating-point coordinates.

From 7f1d36c5142fa27f58d20cc81e77b2d2474c9c9d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 22 Aug 2023 10:34:51 +0100
Subject: [PATCH 0654/1398] More fixes

---
 .../doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index cea994341a9d..b4bff8ed2db1 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -117,8 +117,8 @@ special type of objects. They must, however, supply the relevant
 traits class, which mainly involves algebraic computations. A traits
 class also encapsulates the number types used to represent coordinates
 of geometric objects and to carry out algebraic operations on them. It
-encapsulates the type of coordinate system used (e.g., Cartesian and
-Homogeneous), and the geometric or algebraic computation methods
+encapsulates the type of coordinate system used (e.g., %Cartesian and
+homogeneous), and the geometric or algebraic computation methods
 themselves. The precise minimal sets of requirements the actual traits
 classes must conform to are organized as a hierarchy of concepts; see
 Section \ref aos_sec-geom_traits.

From 4187e40c2551780dbe3823b5db36fc38ba5d97db Mon Sep 17 00:00:00 2001
From: David Coeurjolly <david.coeurjolly@liris.cnrs.fr>
Date: Wed, 23 Aug 2023 15:56:58 +0200
Subject: [PATCH 0655/1398] (WIP) documentation update

---
 .../Polygon_mesh_processing.txt               |  36 +++++++++++++-----
 .../fig/bimba-dmax0.040000-0.000000.jpg       | Bin 0 -> 140843 bytes
 .../fig/bimba-dmin0.040000-0.000000.jpg       | Bin 0 -> 167482 bytes
 .../fig/bimba-gaussian0.040000-0.000000.jpg   | Bin 0 -> 48609 bytes
 .../fig/bimba-mean0.020000-0.000000.jpg       | Bin 0 -> 53722 bytes
 .../fig/bimba-mean0.020000-0.002000.jpg       | Bin 0 -> 78071 bytes
 .../fig/bimba-mean0.030000-0.000000.jpg       | Bin 0 -> 51750 bytes
 .../fig/bimba-mean0.030000-0.002000.jpg       | Bin 0 -> 75293 bytes
 .../fig/bimba-mean0.040000-0.000000.jpg       | Bin 0 -> 50398 bytes
 .../fig/bimba-mean0.040000-0.002000.jpg       | Bin 0 -> 73835 bytes
 .../fig/bimba-mean0.050000-0.000000.jpg       | Bin 0 -> 49763 bytes
 .../fig/bimba-mean0.050000-0.002000.jpg       | Bin 0 -> 72992 bytes
 12 files changed, 27 insertions(+), 9 deletions(-)
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-dmax0.040000-0.000000.jpg
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-dmin0.040000-0.000000.jpg
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-gaussian0.040000-0.000000.jpg
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.020000-0.000000.jpg
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.020000-0.002000.jpg
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.030000-0.000000.jpg
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.030000-0.002000.jpg
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.040000-0.000000.jpg
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.040000-0.002000.jpg
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.050000-0.000000.jpg
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.050000-0.002000.jpg

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 6b6f979ba59f..9baee74449b5 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -969,20 +969,38 @@ Similarly, we can use the following functions to compute curvatures on a specifi
 
 **To be updated**
 
-\cgalFigureRef{icc_diff_radius} shows how the mean curvature changes depending on
-the named parameter `ball_radius`, which can be set to a value > 0 to get a smoother
-distribution of values and "diffuses" the extreme values of curvatures across the mesh.
+First, \cgalFigureRef{icc_measures} first illustrates various curvature measure on a triangular mesh.
 
-\cgalFigureAnchor{icc_diff_radius}
+\cgalFigureAnchor{icc_measures}
 <center>
-<img src="icc_diff_radius.png" style="max-width:85%;"/>
+<img src="bimba-mean0.040000-0.000000.png" style="max-width:20%;"/>
+<img src="bimba-gaussian0.040000-0.000000.png" style="max-width:20%;"/>
+<img src="bimba-dmin0.040000-0.000000.png" style="max-width:20%;"/>
+<img src="bimba-dmax0.040000-0.000000.png" style="max-width:20%;"/>
 </center>
-\cgalFigureCaptionBegin{icc_diff_radius}
-The mean curvature on a mesh with different values for the ball radius
-parameter: (a) R = 0, (b) R = 0.025, (c) R = 0.05, (d) R = 0.16. Note that the max
-edge length is 0.031 and the size of the bounding box of the mesh is 1 x .7 x .8.
+\cgalFigureCaptionBegin{icc_measures}
+Mean curvature, Gaussian curvature, minimal principal curvature direction and minimal principal curvature direction on a mesh (ball radius set to 0.04).
 \cgalFigureCaptionEnd
 
+\cgalFigureAnchor{icc_various_ball_radii}
+<center>
+<img src="bimba-mean0.020000-0.000000.png" style="max-width:10%;"/>
+<img src="bimba-mean0.030000-0.000000.png" style="max-width:10%;"/>
+<img src="bimba-mean0.040000-0.000000.png" style="max-width:10%;"/>
+<img src="bimba-mean0.050000-0.000000.png" style="max-width:10%;"/><br>
+<img src="bimba-mean0.020000-0.002000.png" style="max-width:10%;"/>
+<img src="bimba-mean0.030000-0.002000.png" style="max-width:10%;"/>
+<img src="bimba-mean0.040000-0.002000.png" style="max-width:10%;"/>
+<img src="bimba-mean0.050000-0.002000.png" style="max-width:10%;"/>
+</center>
+\cgalFigureCaptionBegin{icc_various_ball_radii}
+When changing the integration ball radius, we obtain a scale space of curvature measure that can be used to tackle possible noise in the input as illustrated in the second row (mean curvature only with fixed colormap ranges and ball radii in {0.02,0.03,0.04,0.05}).
+\cgalFigureCaptionEnd
+
+
+
+
+
 \ref BGLPropertyMaps are used to record the computed curvatures as shown in examples. In the following examples, for each property map, we associate
 a curvature value to each vertex.
 
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-dmax0.040000-0.000000.jpg b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-dmax0.040000-0.000000.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..8a878efff69fcd973fc96180c5bde195b7736486
GIT binary patch
literal 140843
zcmce-Ra9L;*DZL^LvYuFLkRBf5ZvV)+}+)R6M{Pdg1fsr!QI_mg1ZyA`TF6$+|k|t
z9ry39{j$fZ+BIwJhgEB?xz@+>$2I_6R#HY100jjFkpA}oKGp!@00ek=AUqrb5D5JA
z2>}rq8wD8&37G&B3k{o?kd%a&5CkHlVxl3VV4wtnzHrkru&{D)aFEjQ3i7ZCFtKy6
z{bv)XPoF*^BO&9Xpy0ESgUH$bx5q~}00RM52D%#tiUI(Q0R@8r_0bOi0RYf2|4s`9
z_@4s?8Ws);2#@e@Ru&xq4Fv-Y0|y6$hJ%3xKqEmx!vJ70Fv;OqMX@MUjGW-H*#hG!
z#Z+@^duDd7fH>^N&Q#*p9BM%cCb)TZU)5cDsb{%d6aVc+2=#v<{ZE*GFVHamkl_E#
ziDCf$!N9`60b!wFU|?Wj0RLJ19~@RuI29u-3a7w$Y_|VkTv3YcT&w<rp>htQPRN7j
z5U=~%JNvN;K!*AE2?h)XKp61&@+B{rBH~LfLSDodu`hWM=n?<-hFpf)9;7k);Arf6
z)_p()D*1UVS_7Qjy`Ic=`j>l-v*;-<%eDj_1M+&fr5P1{?t#wEuKF|?+!qn8NQ8Xb
zA2;iyg<7$zQ&v1b=|U{N1K4Ft@QTT!EEX%8Ld0wlAXNFRNW)jc0_^njoA0w6i;v1>
z`&IJae;o?i9NPcxXTpKS17cE@mKtM1g$kk$k@>kDUfQR~tLn3<*HYzuk<S)a->cnO
z<PIF@PjUYK6BgId7i#DLLL|2MI(X8L9nX`YQL`RJxtDh5VDSOy5A!TsZftABI98o<
zBQhof#&1z=8=78j)7v}PKB<<cdw2)2L8<(p=}sIw);9q?Hmm;1kFDw6YI>^u01z5q
zy~=q_3{3PSh%dyz`}~mpV)FU*b3#^zKu9Rh4XMkcfr-;QnPT#;#LfsVnrBB__bonj
zm+|YHNQ?gG=E#0+E=2S`^j9tdn)u<#BOmiRo><V%!&E>y+29%PkwEi=EGjc7E;MBF
zATz`<AjAJ2yB9$xQRKN?Wk7LpV**7`;k`*)fc;JEA;f1@av&aI&V@tE80yK(A%5z<
zy4v6x&gh5lMNe=>BrRRRv#FmJ=M}ET5^=VbxBbj#ui+@Pxg>Y9ou!<7#UV9QKtH-q
zc}N-sJL%Wmgfz)@fDhX<bNdeIu0rJ|MQ2@0gz74IH>!?%DT%YQOS-C8$rQpU<+$CH
zapttA?+^0Z!5lDiE@PAXL`9V?q^};@YBLh0rY91W4v&;D)F*_Um%!M&y>qvxQVl*0
zKTiRAVR&mnvrJi<@QGdty4+L_7shxlN*8ER+RKNMy`A=RtV<YDvPe;W?#Xd>6zEyc
zPSW1-u?Z6=>akvu&Pg_`!`_<Cd<PT#(Y6aNq1sX4>OLhYU;R=|)A&#v<z5x;EtJEp
zWkN$zOr)0gP#&$V*Kor>mNcv0LVJQo3F~s8LimZ%QLOwu{j<9x{d`GvNYlgNd4VWr
zhM7|r8z;zfKk%-Irs)yMb))d79n=aK|I|RO%P%NyMv+T}EySW33qY9*=Ua($U4B0G
z0hl+DVHDHOjtbHm%Gwa9H4u684;~cpBL~pn6L$FjP7-^fGFL>Tr8SQVIIN_j6U?(>
ztaPnr&kWV3OyJGO{Ce`oi!I~(ZOKnWbrlH&32YTH3<+%IU=;~$a_s+q4Jsa*)9p22
zm4tCeII-OmBx!A(a0mwsRqgw&zRfvJ!;*k1CFXFldwIKAol<u8v05KYA+KennrfFz
za(Ys+_dEIV?)25EoMlvkJXV7jTboO}>uXMiOVO*$c?UXeL#?^_FH6ka+0mgs;YzQC
z&Vt`3Ym#JA8&wymdZBU0&l<ijqod-)1<v|<&0K>;!rgD>Usb;%Q0uv}aCh`L@~w1P
z_*4IO8LGN8(yXFMbNr3IkYvE-WnKfc@|1Zj*{O&0U_@C|q54<CPu^U8@3)ueut@5l
zVSYnPw*LDYH3Gq#pC4btd9?~vMo3UW%Z9B67jZnPcEEhKuS);B+CHvb+tu<#mNesD
zmfyG0OgbsXNvCJ!B>~C5qcU!AX@2NEzb>blZ#9@&eETCHN8u8%JWmv|3YC|L+tcpo
z^}6yC$<F+fTU)Y+si2@3sT7ZGbDzIk;dpn55D+1em03!ycPZ$cdUzJwBw1j>hJk$m
zZ{^{OFyiMp;8>>7rjrn*2R`n@AOon>9I^j}_|zbjV7C$6;#EaM+2tCSKWuS-s>)LL
z0Hs`JrYj;CV=0{7I&@$<9~`|gMhf7F9S!#%%U8Kn5l<X$Fg*MPUXuaV_lzKm@?7O!
zFzyjQhCQ>E5{HcO)<P!u<(uP(ZKX+?nst-N-MVw)O=IX?-FP9I0c1B5EUyxMi5aP7
zj~*FBip3!-8=~|-fxu(+bKjgDF;RlXXv7%H94O`8CJiKsH^Bhi?oTH-+02dZyVnp-
zHpyiu4R@N+Mr4SGY=R78!LLczXscVCco(lehvEQH=rKnfksdnN3$KVqr(R0US7|~u
ziU4n>C6jEdsi8_&Jfe$Vvtob*=`qH3>6#OTcdlzGBY~WB?{E#76^qyp0FIa?Gg&Hf
z2H&g&4c#a<=<ON;>HYHoSeCfYEX8sX?afIlOrr%g{mKnX-Wt!GeEZ=TXnUhU9$)Q*
zq2$OLV0V<@kC~-jhtU-4={8RZ>=0QGyupsNda7ULZ{SnWXkWE`YmG(AG<W>fl7ilr
z@UCM8F&~bRk;G-)=gSs6b=&S_ji*|YN4SKWixu)2a4N?2Dzzx3ikXyb9(qOCsT7<S
zrD=}q3xbG=!u)a3)?lY@(K9i5ocsW!@QpWy+nJcxrfJ>Cx!aN93yA~3p&jiB=p(Rt
zP24{o9Hy+}h~P%7sD6ECL2Z1F>X4Wk(KSN8w)is4_kFay!3+faDIjI2YyX>76SrB{
z*q)Qaajk+OUxy(dhRA|M;Kg%swQTB3GA0xt+=K?!r_-j=^IIV{$)N6wMPevhUv|;E
zyL76~X8w2m1VzUo8WOVma#`4K;&JMvQE%eUC1$%J;w2n5zZvS#NM&Qu(zGgJ&&nyR
z&8Qunp}HyBrr~-P6c`phTONfkM)!%Ix+LpX*VQwwH?c_LtkonE=cq-CIMaZxbwEg~
zD!pIh9(?nLS4Y{c$o7a_uPSJbJ@*z6!*lGNZeRRy^r;`4l1!CNU@aLC$nJr!rz%~z
zzuUI6iVBM+dJ$USnlE)TI{b2d@3Whg)7x!yo^Y|4#3zX`N{^?CV_r4pw4I3f4^!>z
zDS!2@noheEEXB&t==7i6;DmYTb6<WD7QB|#oL%+YTq)G^A~&J5B}q4oD5Qq@bdml!
zF=TMpF@sBgOTz0%c9X^%-~0%}uC&Qh@afo?z^R1b@3xpt8778ZGLQKD;nBdBLB$V%
za1z)JIp-j);GKY9$$e<T_Z}y`+jAV`AGGGg??w+gQA}_ag)Jpjwwk%NCuKa<DqL4^
z?ASx;@&Sh5l>Jh)jsfaMT2`q@;PjXL7ecN7_h9V5w1U<HYrw|-c6^6YH2HJUc*&2A
zpt7h0MF7qr$&$DBQhj4#lmnZjVsNw!gO@dB-*ahh@aU;+#hhAdrX66u?9Ds;1CZ|Y
z+5HuRcDjtn`8&_^-hCOPmHlwZ47|jCWy{<1+bP%V=8gs1Mh&+;dk*Li2~Jf^h3g4a
z*d+aQACY#Cn?^WTeT>FP7KG0>4EoQ19BK-2=2u?|4EVHmtPq2rBSslbsoy379nZM#
zBpXk=z@7njb<4?aUk92TRC>rvIewd4$J#)Q`dI{+(Y@j2Ft@uQO=apeGCoI5-0Wk!
z=NQzp97*6rHg&<FMg)KXP{UBtE$z(>ghfdj#O$5!+sF%++i69{C+?ZP0<u9@{GSxf
zWT+e-rMGI!ovvQ_Ju}H0!*N20WTCPR2)kQ$moj8O$A)OjP<#L`d?+2*166n2K`Mq;
z%o)ikz<SL1;^Ffbu%pClt_@!tCLCBHv!(O=`h`(0y<L$ApGG!n?^ASXlScej&stA)
z{RmX5Q?~4=lLcr1nVzc5Lp^G^`z6h*vjd}Sz;rmrkfQ<%X6{Ap6UwbN^R{bU1H7=%
zx5Ve|OeY&l3kr>-)Ys+3<+oN1lg3)x;~4n+9^p*0^=s~Cu}3_o4F9!I;YzXDPnRZm
zT#&dt*3l7Os%+ND782$-1vODvTjGif7zMvb#o4VN()&Gj@QurVe+`!ozwrl)l+=EW
z+dq;-&A2afa2UW2n}yBT6D;cZ^6W30*_pYUPgH7xlC{tBMuqCNmg#<!ApN8Vy74e|
z>RNh!*VAiB+pz1ut{@!zLv@i2Ge>Fcaa)#mBEw_K&0@(=Ebbm^^qb9B>PTkJWB?)L
zf-Pa_ku&Kp9mxTOBAF`V*>b{6)yt&Mi;4$ULfi88&d&>*a0Y=hd+E7X4UH`tN5Ng8
z?rP66fXo$%zT1$EA8yI@D!EEMkKVjjmYXFqGBN;|g9F)pSp>)@7D<V?sNyytkKXob
zw}tnmqdEGmX?1;rIjrpShnxM5U4|A|DpW{dyEJCtWKX)197I-GzN--9r+d;MG|L)U
zpPHIK6}Xv)gF=8)sM1qvT5D6ob6)booZD6-qth6kM(dC1c8{Z}YoHU&F4@eATE-?d
zmOWb++lU63L8gv#woo`WS>-(%p02Ikcbztk9%6_HOaM=_B#$paHT}*iH{w~%e~8!<
zJ7TRJff=5?xS;HaQ^KzM4F7^KZ$mihWaYyoR+Z;GM6{TV-q;xUdjbb(fP5@k3UO#`
zGM{>J!d_*OtujP15~G@96VEf2{z0`i(R@hs@3}Ucfs}2?fhd^tq*zp)$F3i-a=Anz
zk-RR~SJ;2F)o$e)?w2AWTWeH|7`S`=`?y1F62GpUp^M6VOFzE`NBo?!*Aqs`lXcZ*
z97Y3QSRoHga>(_|Vz3k6Duwjdgff6ma?uc9!5?Wl5wbIIi0FN}%KGqkcs5eywSF)4
zre4_*s%tg$=$^v1@6DmCDFVp~2Q9k-vh-T#7szbn?8nsVCdtxwmH6T5VRS@Zlo8lQ
z$-2-o_(NlyE^5hS<+fgXze);*`;QGB9VMXBOP+q1={k=tannQjobMf$=wGebj9}xh
zWD}Q2#s%Ag44=K!$wS=R(k}jD7>Bch4ELd;r>2s$n-a8`Rt}pzgQRkuMNzt38u6NJ
zzOl^8Mn>U4x{VI$e>wbuQ0<-tRm0e=1aM5*w%M1gY{{X92AT%R?9G<rDx<rMKbZhe
z<!hR<L!D0jsOI=97@{8jtU)8txa`vH*NH=)B$~;aei?x|&^iWXNYWRL1kr~ue4acI
z?FP8+d)$_65xFi{&Vap5H4E?+&i9hu<>ncEn;+c&0C=LDWEOcvA!^&-{M>STTP{)e
z#2g%3&XJ{15tAspw_~Jmb~7Xw2Pe$iI!#!A{{8vY^k}sDO6MP;pxYR5vLTnT=g$ld
zt}*oJ*%B7lnpM_*QnbeEOMAeRRLU}tIB(Dx^=3cs(4W30uuU6YlP=LyvZ>%g-HYpa
z?<hYx6+Cl6$*8A_o@qxK_{ZrZ)WiNiy>@aLBC(YyYt$te#=QW1ONqL#2K_X9a(>Mb
zl=a5))b57eQ6@zjE@?0R*Jv@Xu_z!uQ0fJM0m#z2>@)n<aXS7A8v(Ue!z#I2_yM@4
zy1FBRL{m|IatSH72%UrOeT>|&zOJ@ui9Y}N`4Gac5D1dlz!#K0$nt)I*mcPC<>-o;
z|4z@h_d41auGh5@>V4bPQ%qQ|dF8nh8x&CVj|jIq@`xEBR8?AA&#V&wUeWF8gp%Rh
zXu;T@LOowY7<TDq|5p2a0IG#0J^<FU5_2-FO*<;?3C>=_7diLGFKLuJkIi)t8d1~Q
zl5Apa7d~vL3l49+n;XePKe|bjVDXU-{nO%5y?hpUi#(am>WEtY2=Hc)6|XEah9I>j
z?}~3aa|?G@5*Az8(D9~u$tTwI4E5%BBi64L+ma(A9Ww?_Bl~k&r6Pe+;;Jmuq-5aM
zXUb!avK0d%Zk;XWdNvNYjvSA_VpsF=fOXN0!_iJOf@;JDDa@nQ$G24h^uLHoC#1MB
zOOjexwK_t?x7+Xm0DPD@oS~(aS_!y-W!7#^eVf$a5PENjJ7}fJ;1vA1ZWr&1ws%g;
z2cQwnfKlqHigyiAF{dI<lurFM$I`C4s{6}SKTY(t;J8ZEIY{u(I!Ae9tm;X|4k&z&
zU?BwcFDfe3Y~ESg=Wf?2%*(PrQjh-oWD3r;b527pByW~Kh|0V@%5W)rpaGw*sK}9>
zX<nrI4$T-Fh&x~-FZyttp=vv$R=;mGTCM7Dj+w^mkhi4cTf_*mR>$!pqh0ov6GdvY
zS+@A*cD4ff_AlwYE^F>9BW+T7d`mw7tZib?Q?9o8-Ja7kS!IQ0>E_+tkIkZ$Z65%O
zvV0o&-DVz}7_#K!1$Eqax_++X-d)tk)!gWC+oFFd3+WF4|M&0>e8&5qVCsE=l;g$n
ztq~6^q=wNH+#LIHNqkbu#r6&2?aEmxAq<9Dq6@eRK1)CAmNZ4?ZzMblof%qmPkp>X
zz`iQ$tM;r_cF>ES&{?5N@jO_^kKSUXtU&?6uBV6KWnq9t;Ytyo#Bh$KCfY@7jz8?v
z*fMN<Mx~RDpJ#>N>SKg-Pa&;CVv#8k7n+EpM=3LW14@}>vi@(&S3k}2TiH0P7$iJ0
zWaOZ-90=#ZTQjop4-Ju(^jsmBe!oWIG<dHhrLe9Np;=i%UTD{&yx<w4BG%;|kTUA2
zTtIG@uY`IsrR^cv*k_>|3;16%BQ!7d?PyRnr4$S{g_6KZ#&CKe7kPXl0wxdkyn@v!
z7Qdu%QWy=YtS|oaZU#(^iu$yK=Y+UI|DrcrPP&rTX&P}_2K1m69{lyi^UVHa8|ojM
zSddj6p!L*)Q(<ds@{2R>=7LKA7vtRXi^kNo5IN%!da~mg6u;qJ&Tk}99an`1p3cJ6
zb~4`Ri>}E5@-B954wWGR26_8@sG-0?dTSCi7}`sqydl6tZOPA{Qs1eMxg{7czCooU
zG>c=8a<S{Ys$Iv)4e7z9lyL6)+kCuWf&S>8T+4Ts+9%N5)!Mja1JwthU=B$jh$0sv
z@{bk3;<23m+#sNwcBg+n%*3AF)c#)IzehS-#u3}sH7Ut#`$}oyCInwhhP-54njxSn
z`^LsCULTrP?LyDlw_1=mIJpxX_9Mxe_4j1FO&=2@O|ngSa(ti($jQ`(ga*hfL|Um|
zlT_H%3PDOF+>XijKTNt15WOJNq6!m7F8iC8SQ0pge>$4q=gq5`9md|20QBx%mh?T1
zX56jPHYn`TG=;?Y_%IY$;5byVvG1fs%4R0A^5_k|3zQSyIK4Zn>vj-CYp7-;-;xl`
zFNdAf5Q&1uldYIZuxzZEe;<yj>HTV{V95wa&XsfR0sWSp?NII&63Hm860J_(!<ew4
z7{7U#Y%|pu<Rv}UUP`f!wsCMAyJV{&qoIcR7RIj(Sw|<Z2+8A)B5&ft?b^)ZW74{E
zg~*jhJIiC!0oUpQCJw@U89o%N{B!Ov>pu{3(|1M&x3mumkFE51g%`vN15S@22dVkt
z1@Ut=x?B|wwG%A8k`Z`nV{i`E&)&h&ip5ExRH=-{kBJOlzYY%|5Y?ODlieNZ$el~!
z2N6`}wz2UUS|^EPEM?!OJx`8rO)wsG?#EHci_W(bhbm?AT#Zd&Hh6@clf%~HPtDEd
zyAXZ=yqYzv>1Yp3diaPP*HO3|D|bB%<oY_>b{&TyFKC`3&eD1`Bwy{GH5Qj&)p{Mm
zz^&*bPc#>#d$-k$Had5fTe3~@LFoJ00trG%(futQ?%X`yR)uYb(z>qCV69RL-aomf
z>W#=Po&#OPf_Q)M4<l55?Ms2`Do_-E3ter}4_4ABQesnVYOZ4|J0%V7v^g{_oCyF|
zUr~7&_mHUYoQv|2qPF*_V3vrUoXarhcvGW#O9ip^CR$_R?l@E=AnG&!?Fl|FsmAwZ
zC#3Y^9d`{R#P&b0>>1S*F5}<ts>>fvqqtFOVtA^M9mtG#q$gwN9qu<fLU{FAmIkyg
znO@_hp45hpqF$ghj*V~!4@xDFv^Q53ghZ?%3lnql&(3D?j%ia~zXErC;3N#^|436R
zy;y$pZ+V_^uw6XH{~78SfS#Xv`aECMA*aqDZ9!#YH0*`A&`VU-47veB|8X`CSet)B
z2|3F9nT$IT635=Ue%bylE2v!8$<i=N9005z%*9{(m)OzPX^){V5z|J(c{&`F^MaaR
zC`_9QUSm*^^wu~a<)WGDUt;#TLqvMuvLzed@opU=pAxPsi{H3b*ZQ2YVMkC?ia#cN
zt&yKF6--HnM2OB3aIn%LbA2F_ycE8X6E^}<^gxuk_)9yjsqHwfz)!%0w&{|X4dC-@
zTx{$U<V(_)jrbOz3ADY?hI(_`>Z4lVZtkNZ(nOQ@n7Y0#kJFK`MKf=qNykd?b3<|w
zh%t3Ln~tI*@hd8JazQD>P3<0hI#mNKMoAc}d+X_TP2ogJPCQB-alD+XH0{zdwkwgb
zN|m?inkZkBaH{&TbHtGEJS2>sv5_jm3pl%15okkeJ~4_qoii*(PtB#R4g+BWl*lZH
zK@%q8MikP`KC+i=w8Ij%bRPhYr>D$@I_bEkt_e4OSDfy5FM7Led)En!@89VYlb)At
ziodR%E`@v|{4yTM`{O8EwhwpC2`Bk7LU)9?K}yNE7+ERxSUDLfi&H>FOYy5AZkjO*
z9t{u4=jvwogne=2)`(ugeUp0GZ&5B=gSp&Zoyl+Ys&oA&@Dujkr=6h-R*nx19{}dC
zm7(R{(^9c2)W80fs_B7i>$>jsdb-kubtblkv8cM`Dionj=nUnR>RbV=8-*RSmX5XG
zDOeSVTwaUsUgrB*0uXQSINVhEl$Rb%tx>!DT{%>!6MO71>5h3Ml!3Ed=6>YFTSPI7
z-d=<gY(%PY9ZkZz8q@mgS$KvC8+_$(V@dl;0nbb0h3jt+$qp}>VBfS-z4|HMk^-_8
z&T_FI?*k%cUIQ-PUTeEe+EW|z0bk=-N1M;A>m3W@K2e6}k1P*5J%dd<k{5aa(q;T@
zb+T`*e)o#E;RfsMRE7CbXH<x;v3#Ut(EVR>3JSf)r)9NK158EV-WMZR*~sP6pZYbQ
zw3?^JgxtimcobUsE(#Jy00vY3v$;UDoqFU64}s|IiNI$EZPsP6_&{5VwW|!$$@pgX
zWJK#0M}DF_*U(hq4?uR^^H>*EI4%0u)o(Te<wA06;a(#Jo=gjObB-d9-wqPi^F11*
z#|uo|y06O@yQaMP@xC2yj~_X=MU>oi18+;lNEE8-^+b7zb7IwU-e!DAJ_%7RCjG8|
zQ$292%m^plOKB12yR)(Kq>lRl6zO=zMo0zud6w#LtxcJKrH~2dK_bL-=6?1$&4X%H
z!T%ifogGQX@sj~p2ERm7GfarQ3>lm5a6Zqqa1JS5wMUO99&|Lx3GYQ}EA-P_2yN|^
zAFGF-MXQmW_0T!G%%<t2QzPe2!|t1&{-Kx()eJJyNDZ6J&GCIvlm3M-q`x8}2M@*_
zi8bxSLvCktM)aTm<=Pz~*Q27HR0J}UL-ZHjvOL0PAjFyYE+qUA<V)gaVk@#}N^qQQ
zWMFKPufiO{p_K-H7RpqiTR{s*_6WtW_km|)obNLGE*)7aM6$K#M;8kkWtMS1^+xBM
zjEx(vI-n2s@{MpbHmn)5_LEbRs{34%2tT1KYneTj#WGX^DxLD>^^D;>1lVny&8z9`
zczu}a;KG=+6CWX9#z7Z67yYnRsbkM_QNUm+WL`4fmN@PJE=`ZC8%rqCqCU^Kc;s{|
zO0y(f7ebECG&TL6Sr*(uao?F|=zt5E=Hyi%mx>$NvTihe?ueE{iIJWF?{aIXc}py7
zHl>=6CJV%i9QyM`sLmL7(x6zC6nU3@BA>i}n-PvsWHPnPQ(G1b;-o2kAFy22S&hMM
zUS+2Zz;&k%>)sbK?y_FgXpGR2(K8({TvfPHWNl92^I<PAbRU!<@B=8hNySyME^*V5
zP($P-VT_k7c~RK*o9z~uO){rBY)zN2SbBgk{GN6Y#wvnFDT?EGKaRfxhW@Evc-0*$
zC7vpNEJ~=Y(opDR#~1g*n}8vx<g1<63#fbVz+VR1-q&nc8%E#%*kB&Cgd)!I)g)8n
zQ=x?pQ9c%EIW=SaN&hS6EIkN}yD9Jb01&;&_sy%dghpPJ&Mk~cK60_UV|DGQ3oQyb
z(@D1_g*dyvfaiC)G>$jo!EdCt3!as>g{k?oQ3=s0IYLQEG)T?o#2Bla>Qo?5Y~fc@
zO1^5b7rt+Qe#l8$B)9qql`Dk}@ih3m`eI@H;0wcv@4jTV<0<b*Ihz}Vk1~Z5>f&^k
zizI@T&^e|?5Sq@w5emw87<z(qbtfFtM>n9PCtK-j?s>1}rKRzOQDexS*&ZrpqI$h)
zl)jRl+c*)e@OYrNPV^`n&gWPUx*^{S{N{VLzS3#k3JuGKd)>)PmE_n<{)^(9QscKa
z(f_nDgtUvt$Sw=>FMMJFi<m8YBEK9B)?1feB^<s`Rps}}N6jVN{UhZi6%GGgA|H-Y
z#0C)wj+--xJcg|&Z1OMHeR<Ng|1J>wjFG%Xa#N`>aY*{$UiiII1_^1C5WA+HsGHAW
zo6`VhfXQsP*?x)P79bjjm2i~zqG1@q@4<~#W3|;@o)-&sAkhW;ZDj3{QzMMEJ(VFh
z5&u%U+XA{1-!RI+ZG^617Z0w*h%n30Qs5ihSa~aTt3`A>zh_9u&+ITa=(551&7}5L
z72+uGuc7Zp*~O<|YK*m(n1kf6_$v6qc$Jo`YjU1rZXQ2=NScH>4~h9l1U7poH>%gF
ziQv0VLzV9H`OGJLswP9SuU*smJ1{pjg?;KR-D1ct-)mFE!=T6_&;f_kFBdHB`cUOm
zlJW0y)HZE`3}+VhkN?#Q@6En^DCN)RI-Ssn`E=xmn4j|0EF!$`mtMp$tE(Gm%{h!6
zGksRZ-X&mDo9?X>G&@QaFR2d^hz%eXuGDDnWECkz_R6x$Q*5~w!j2?CDQO?yyg6Hq
zQKZldHRx<9>~}~uGssHAL?XR7Hi~;PS0cZH6ztY-oai8QN7-7$?MO{Mm6<Qz0IeE1
zW=RzHzrbX5XDmD=i_=)n4uDipcma0%K=RRI#5Mg9a%gePy^a;AE?>)9r}4v}KgU{@
z%eKP(zT9uE(oHq&+*V%y2y#}&Bi4g(cA=FVC=%-IP}Aj_A9)*0RK;m$6~>s-l#)<j
zBAi6d;Ls8o&Jz{F(<Tz?aw5f?viM6!@(|*4pD-wX<ZsUP58;|_A2*qsY<RYD4JJsh
z2{@M|9${pcR~HCj=ZA#?5K5`t{iVBOp<)f&6A9z}g57dvXVk)8Ku1lLu;J`A-<j>+
zV>mRxGWi@mQrqX^t;a<+v-@S9!8(BaiZZu|Ol^}N)nc@KU3x~g4(pdDoY9j~w8eE5
z)w<9i!~>}!pul%0VlO-BQ9n$zPX`urw+qQ&TKC)9h}KR5$0N7LP~va%>}!M5>_Xj)
zK(?{26he?+=<7{^V>b}75sFZtzgW%%HY($J2?B19(bU8?N-{eU7yxMHD(7OVtB+{+
zrOUJ|?#10am2(qEE#@*MHt1;@dYK|lwntFcpTYNodRec%kiqHvnznhKJ1B*dI%>G{
zer}MLMZ+KGrbe-^UaLW~aA&QeT3@|oosq;Zjg<r|b12jLU0qW!X;rPAMz6C@F*FGM
z813xq$|V>C9X$+GBBY)>3jQ_*I~)}%NQ6_Zf5tDU`NeSph5K~*Cy6*1^CUrSwchv4
zit<=jpC|<hc9zn0WVrm(fGs%On?}rQPnmRpZ7xD9;D*(d`WNakkM6lHG<!l&@fz(1
zK%)uuH|1Spa&%#B5RMpS()(*2RGOEK<A6SoU%8fs25w5cZ_-tS=x~C_^LKSA1Uxe7
zbp`SG&9h-T+Oe>aywkW>hVcRRja97X9Rq2T+Bl<x^;mc$`Ea{j)tU#4Qr=!17-72S
zkZn4kN2J5Hb-SZn2eE)G8kz0~0K2n1^jt&fQ*>{C*H$L(Bf+kWoyiw5`Cr}m6=)Xd
zk)=f@S(Bf6Z-rN?CVHxlg1)4^%+r}>@QzR&^%mM*{VSBIsVi^zPH+%FixlooQPn4Z
z*o6zf5;eY+S$&i?wNul0iO(mQpX~dL?8cev<ax8)T}zuR;e;PsI=TGU#v<@)O~;S0
zzT0g~!0TMo@N#Y#{8V8WED6SIkeI6`N;B`3Ua%M%$S)3G#PiNLz1#0{zk=Jv%E9k*
zz8RpxL=_#-*~4%L$sG78;fkn!8a|Hk<IE&?bnLG55EGl+MfUnRx?}jZFl^4qHmK+Z
z0uvM@>l`))@BPjpX*3Cq+W5Zxsm#5zphLdFRy~EPIp9=w*B+oc1k0F@CC$#%_@ZTV
z6^T&LXpa1~oQq#{+_+p*J5uiSosz0>OtOa)Rh&O<1`l0Jdz3sX2T{&iP|@S<1jIMv
z;G2d?&NT3A?;1sm@~9Kv1;()xqpYZ?Fh)+(R>1YOf=Es-vQn{hgTUOR=9*(6x`3`M
zYM@ye{;;dZj7_XC|AOU7%jqW1OUay&-YfwuINguzbKDOhtfqCBq0}K`q<RdW9df&N
z{yI|&QAIdJ=)rD#3EshyBWTz1rtj5iI2+~Wc`Iky3%({#wWq}7rC~%T&B6XroUk7i
zo;y(886B!JVK%qhYP!-srpy|*>YDMSE{nrM_I=wX^#@87Q$yZQOcJhj(A?AaK91?h
zlGQCl*BFZ=lTuS&weJv$_ACN2QPRG)_^H>;P+q&MaKb~Oqzg)1lOfl}oyC(gS!>`$
z)3#4}f_5J!YYhJMEu1>y-ZgE0-0MU*i6O>|ogPSb)OA*CI;$A?R0WhOiuhznmtjvr
zeDqkivUBkPIH1s~Wvs`nqdiQ&EyI&tXY$(|6w&gYk#6TBrQFjH%ueRTJRDf(P^Im;
zuLwEMNvbS1D&_%_W;#98=%-~q9j8X>Xg)<nJo=loyf|IJ*q@y_P((uxw4}*fE&M@P
z2BP}(XAXo87A>nI9KCX%rX^VU@n1rQ0)*o^&*^%8vc;)K1@RINWid@WteAj%mPhO&
z&aqXL%ZC3uGVN4Qi8a-Dd+XBIe*A8pY{m<DI09irFt2YDz8`>w_vO_qTEdyi&Rt1`
zg%~`i;V6eAeJO9p)%_6YvI{wWv=G*;?9Kc9uf1y>v2djl^3qJ6!*5c|0v$h(c0Ye<
z$NxFzl*w9hn$?KEP`R{WWJEomd2ISeIH#b1fjq`WlTb!8>zRko%Z;<t$Z$qXssG3e
zbe_1QEpL<Iq5@uQ{@lwdv=1NS@fdq#0F527;?3d#!!VTk-iXxNM=nDo7JmiPdVf{M
z&3#ibTYy0_7suEHIJCOflt8^bX>WJBa)p_D&Yi{c(8<e6h@sPwzK#&T#L79!-Vtpb
zC}K1mw{BsqA-Eza)n3`qJ#OowRso#t7_;~wk)qMH<77yZEwOzWzMykfIe43A<`@yc
zX#X2oSN1jf+ADGAKvvsBo5JvEyorlMqj~PI)qzk~4_*QjIpJ1#^BU=3G`*jvva#&}
z>7kCRm*d0_oH}6ED)%D-i!gCLhG+R?Xb!r{@f5#;oLj987%!=l1q=|FV4>lP1*fxT
zkgP<q%GsvZ`)8RxQx_&}JWzG=VO{8y4$a5t2PJYA&dE02D1b0(0a7rgd&4F$)-BBT
zJm2x3T)&wRah#7G?8%&)@7xB0R5AZ<P6wO~O*<cqwrsDN6;E)o{CWt{Vmd$1|EEIm
zoi#Fgx)q~FJy@4!hcEAEt9q0O;{@<VY>@0K!4jcqS7mTsq&IdYO9FrL)c{LDr?Ovi
z8zbc{<0ZM*jMM<9&Pecgm2pkD1O<n#cUw~nVr!e53LexL2&>dvB&G{Br3?OiquJ3S
z3GQ6OOIW0BjXBg*FvY;`yCNeX8CZxC`P|dz0rreBsRJwG>k0TLx+H?24VzTZK&_|A
z+3w{4)%UoASp6gq9naaq7~Z>Z6$6=hPUP*U>BFtB%8)eG!xm$cA7L8gmQ02+d3};6
z1kxucpD)HVF?%*LdHvgm=Q(TkhfY;7Tkw(nT+!{)Lb9YJn5{5s34MRsna4P~L4!bS
z?^uv1*62y8$-3$%ACFggU6|{#44Z$2vjb@o5+eO{0e~y$klhW<U3PJfAW3ed*bc5X
z-zhX1m*pu2@+p5&;+<Cr@g;I=(->Mql<&du3B9I3%<|%vcBGU5s#&vf_r*-@(I1-_
za}9*z_(oKW1!)oJ3BJI+8J`7dQTp6?6XSqAGPlaXrn+5Z+3(2Pk3W%pCFndoe`1E^
zCZqqlXyp^RC)&-ShoHidQ;nWAQSw(fIHxH>ZW8xH@;vRfSdq(kt<C6wlZ~<lX!o9l
zbsvBs#y3^cMyl%P8h3#tBdWxm$+)bDIZq;@O=e-Jd)c(L5S>-%M|K&CsCKE(Tg-ID
zSQ3s-78YJkiPzS~z;Q$H_1VEwMvLX!2>ztkd7?JP)jLzJNQZ>VH0#<y#GmjX6*D*`
zg7D-s_UpE>&;Tc*=vB@pgU3<LzwkDYsTCW1V-=V5R2XY>e)yZA(9^}NCS9dVCv-t9
zj)R8ZlW3SUvv8&9NRnd|_B3i-nw8rPGbV^Q>Hv5EOp?zQ!9%nyiJT*WJxm+`l#=_r
z@S0vw6U)uLAIFVYp7?C1x#S~z6kck{s4N0}NkCct=R8J;lhRx?o?J0if$E9?+|ie<
z9IeF~1;)!RJ*6@Q>Y5=aseo(##VnkV6hJIrB^ug4VJAX$9QR8|^T^SGg2piL7l$Nc
z!elv{^x_m5x7+O+lT2K9O)8bDBl@}Qj-zDlrz9Pwoc$QD_1#t{_nOtQI1gPI9UoTX
z#P3?=sLE9nwLokR7@D9~)%U3o$uZrQY=#AK8=U!YP`)ZAC-d$NXKCL!ip9mumneXD
z{!~d>J%hXaXDgv`l7PfJ&`E=$WT=?vAu5Zt9I~0nvr>(eg*nLoN1>DJRcaVv@@K-I
z_o}qC{gnk&WZj_aPTu8V6E8}#nzJq2AT-LqPYW_F#v37Nfa~?#*?p9Zr@iV*@_tmg
z8TBz72?2+)nB_VevALsK-NYCzk*Mz0S&zxVmaO^ZEVJ4_C~BA5>rlSdF!2TKOydI4
zdOA#`uAJV5?X1^P=1EoF4Ro2d*fW4@_|Gn|Z+5r3>5-0dJrAQYZ`zK2tp$AA9b%ey
z8zPlaEaZuYybA+6y3CG?$z^>-@k%zHIm$JI@x?n50JX*+Lu@$Q3tUmiEXkp^XFV{v
znuqlC&7a{l&4{q+1OL)B4iv<H07`;Uqj-I7{B-2J`-v+IYu1!kLMO`vq(a&nQoI^z
zV5Ql7p$=YDTYt3uNu#BuFT{5Mg(e$+0J4x60HbZoS*ZoOtCRq3>O_8+VovMVu&Y8U
zk9@|Kxt13&#=to_Tz-o=rDGxM^I@J#8e3b#CjO&fugm7V0BInBpM501O&0<3QXO^>
zhb^64oTe8zyz*X>xr!6vl3RVKXIt>wI~YO~-dVU8Cr*dm%mmv0yRdb8a9gQU{-njs
zC}U9XZYl;vL=rH|5iJ?1O{dvTGPvL1kV^xO_9qCY9AFnPwW2S^C)K{+x|&<X-35_*
zn$4Meo4w-F@a_H))JQ23I33RWM@lh~erid%?Z%-4PRBSszF!mgrtO8hVQ65Sf^GLH
z+2XUODmBs=?C1zqR=Gdnc4Y}f{Kb>-IjYN=%eFL1GHqg=0_fSc=UXHT@Di8*Ic1$-
z<dGdo;FjE7vi?`^t6K1XR`}~9-1NRQ)oUIbs>vF2C<Y@_fXT+*<P*#1xyQzjq&7t0
zRb#;ZPPs1ba!wHQX~%wYogs>Q`sEk8&vkV9K7-xrQ<A}74ljlw6Y}>DK*Vpx21QPp
z>_=`0iJ!p9r3Fd>58y`>^e8+qAyB8{dp&^P>|3%2M3N!^eJ0*RF;l5W;@~We-?E#H
zWpNpXPPqCKY~IdV(iGh|3Rrv|RuiKd)N<_GEZUS5$kPwXNuJ@=@pjY`4@nkZdgfSi
zY0wtVmz_Neu)HI6&UWa_l3u3YmiE47*$53F!O5GB^p=c)+M<t^_n_%d)7yAi6&=R2
zix*j+_tuE%Yi^;`)R*;2%P_R-y-jFps=aRi97+^&N7`~rA|%Jgvtg>^RiHmJ<x{$%
z(fw^9V1&9qeszS@I&w2UX1EKHUP#j-S+jECnxpf%Y4XQ=c4;MCT|{3f{&*lxbF#kt
z*3w;BH?g~ZhC1rJ2s@eX9qFoGWfS8;^0Is4@BnfG@fF&EY|JW~wj!fbQlt@d(-!+;
zR(+(m{zjuHNkYxnj!D1k>(426J$=V*opCil6{#MT(<23&)xNWOJx~3^mR&SnsCXft
zkQ4~xQ}B{v-Yg7Co-;X@KlOE0MO4a-?z&>d2uV^D@z2D+!1)F57)r+VqNR|kK8v3>
zDu3_Fl^xSn?8jJ`P|qn@354lR#bb=zi^_0oRE_!-D;>uAZmAT8OxPZ{lsj(rp~Vu5
zmwL-K*0m>rzZKljC;1DQl$4!?WovOJI`dwOkpqhiot0SF=d%y1w0j(>**6r*#8@!=
za7a5{Ij1&10Mtn36gkloj5b~zHXnfa_cySdB4v-A$&AB;NfqkR{4J-QXEUlm5vOe)
zH>cXkm$SJm=Gj7w4pX!q6aKK7j*a=}55PLulWDIlbr!jeqLg_$L2)bPkZus|hnt8&
zFx0U;kYgL2UCTv!sH2T*2UP7Jp#VBQBDRjjYE4*NNJG$<(J@14t>RhM)5<OI)oqa!
zvG#&fJqp9W*sY0>U}J~==V0TrM=NB5WhHrU3LQ5wn;s?~HN8t8lRAV~1!-rr_;lUt
z^yJ9EvtjPa0@5cw$M~eB+5)n538hsOI}_8l#A+BE%-PyW?DZrZ?)q+Q-C&x=7$4Tr
zVP3v72~#KjQVLo-cjYV_GSI2pLC|NqTP7(M-g)1XCE^td2MFau2^9+eVW$*=1x6Gy
zWsCdg&9wM?bvv@1Sj&VC<tNrS3%`!z%Kj(2bZF>U6hwHd>k;hfKP_qS42tTeQ5HsH
zeK-g$4hZ4Df&*`yVZTGN<)h2fpn`)desl{c!DKlkn?}3OJ%iU)BN??-2!7oVw!VXB
z28)0Crl2H+u$RUMyqwXisiS|H#!Bvi11E0}dyfOICU{IHtJDqjU_RMcts)$y$qUH3
zYZ2~l)gncac$Kj`>733Q*MT($r)UL!f9o<8eOx+KVV4wo${AGDOd%NXW|4Q|;JJWL
zLk^nw9x@oasyOK7b>b&J4W5O9B>}T@NKGB6B9WS!#Yd^2+HN&RyK+_%(3vz>B(Jm%
z-Hs@?dRBPS7$%^-ByU7Rh>*c<HI2K?iAu1EjG1{S#QA2No`{CF0iweKW%%m~qf2{s
z&E|_u6VN@{4L_Ke@?*ZD2Je4A=(Ha}_0adjiAJt;=v&!^*))%nz@SXYK6-|nG)W1b
zxTD+GSsS{l3?A`s!mcIzgEgaypiPv72`4j=ok6y!yN&z!@o18x*{h`^=s#ikxuk)U
zLGBO~q{0wd<MFnC;=Ph`EAebc$d*2KY`wkaT70=K>xH3~!dyWDyXg--a{sKPRN^+-
zzZr=L86;mFw9(}@EhBAQ*C4EAdAI{<TXA3~I%p8XPPUY9L?=h>6h@3Dc={Hy4j~@M
zUv5p_)cp#@ho4a;fOe}r5T;v}EC|5K{00(dwnQ)vzC2d#j3)OgvyLd!X=4-FN_nU&
zYT<_4VyJi<y~RObx;(F`9i<U{RP6VO)&Lec$%lB_A$DA)4liRmLfsCiQw*L?t6YmJ
zYhmZ@pD1<TXb*k>!V1gQksNWF5J#cj|2ly$d6M>%i|E^NSY=sbE|jK^j@19&tv7^K
zP3Im2#ubl!D;DSw+Z3zSKh-s59sK}s_TDa7f$@zkJ!?*bN$Y+#<JPV`ScH_btmq}G
znPwCIe4~4iRv}#7oG~S^B3^0}gnzC$+FPovh4=M56s6%b2y<#Lzo$FXtU<()q{Dpp
zp(tZzW^vNCZ_dE@sH6MYkD%wmly&kEwf6B~uI>djs8X{7uZDnW`%GWvQ;Y%+&vAB^
z)jH<9ql3k{x!W8^J#M;?VE|eY{3dUSV8z_)a(F<DAQiIbQA*L4c6?5Nken*lc7U#?
z_QTUtnakQ~Qj}6Smf>H7+kY%_aC}Ojz|>>Uba<-DpU+xnI0i;qlrk~OymAbdg=F-C
z!%<Q^gbx2(5N$gfJ6#f|ts5rp8oBM1P^TY~$;u?h`?%hi6RhY?#+PJ@BUokztT6&%
z?FW9VzlXB~ci87D268S01U=P&c8P{MJsH}lxC$aijm1v2WhQ={CAj9D`pKdTfC~Hv
zzzY3I=eT*a1S0XeDxlJzLwdpCSzVJCK`&_XFKh5$YQy_qD!<G14c0Wjnzkk>yAmtq
zR0lOaEXwd46r?oI3|O04t_u7hdi1yf0;#gV9F9VgDJamjI2;KLoo#62DO;QCk^BS~
zpA727`c%4Uh|p5233fXy4YoqMqBpmBz{WXtS?QjTY>eGlC;yaR4KV|$nim>zFCfTQ
zWS$@Mv*kvZ3OquT1TZH;jim|-E9Qze@+y4zVJK)W6^wJP`Uaw~v!5`)cDswH?o%RC
zkE4mJFxH9i7q`fLgc*O&yj;u94eeWgKH^ECTf><EKg-*55pzG!w<L`-VaxXzi<c`_
z-I8Rqg3I^ie#ZJtq`+dVv}bZGyNvnbQ80d!hdjrubNeY)`MbP;M~a(wn$l`;q<XtJ
zA#zh5J5HmnGz@geXdtkh<Kq&^t2^osVKWS3e~iE7&CPEAM5kx*OEr}Xj<|n%JNwk_
z<V1n09C>FuEbkNg-=4iwg)9+!=$&6*J9Aa$?{LTlmg_-umolLmrniPEaVIcig{}?W
zxzvoNQK*%1j~U_;cTL5^pS6P<nz%iH><XJ?_CBGbg>D|!$#O1^pO|ujoo<PI>5^$8
zR_-Zf=v|eiRd&*1Q6uD5R$s1g&1}CG!$R{mS6Q=$#dSAss3}P)o`hsbtlbI^F{Ze+
z@m-^m*C&rVk+yaD`4=+it~;%DjoU;_2vM|K3`6=)?N<18bKF&iOa6WXi+X18Z5U}T
zRAq*1=7H+mNm_COP{PL!f3g+c^@^K!t|rz@9n{=!FnPb)V-<bLQ!YXCAi{c`Gj8bI
zHI?(H7spr^OXnWHyZcwWC~bzPF;V5xR?JFzV<Sgo8V5MBHka_bz1y#~*oD<j4(*O(
z7tWYB45Ih!cN{GFo`b!r%T6^qfGXCM@C~dp$!ulLVxV(_*u_a6A5B<>;W*lwC2Ch$
z%J=Q^z|Dv7+;nxrKzBX-AWR%V6-Q^6cStd*pbq}@ySPD^o+wyx*|d8J==SNSx+M+v
zBe){TtDn3stfN0VoOmv_np|tKeiO;^LZOwlNk?iEh96y!^+?;Iv-UtF9w(?vQc@HL
zDc!{x@&Q1qNDWY%V=?CLd_4Y>54Wx%S4!lUbBldaC|KaqY#ltn@_NGk9Mg#5#h8w8
zsSfax?&$Kv1}49*(o*LHRZe1{PKuT*W=Y-l7*wI3ywq_VcLR;m6dGsOyFaVDLTIF&
zf~3U%(bq4n5yp!rb>zI$I>3YMO!ke97WEcA0f!RSQCrDWXf*lRmgvld2cbzg`jI|#
zfAUU~-#}3+mGm4E$+;q8rD9_ls`$X>AHE_f<X`ja-1k2b%~OThpsHK%6A|q#=AHez
zb*l!0wWP388BFrib8ebf%&03mn8>Lc^lDxwopt^F)I&lp;f`u!ShLLj`TxHPzR-p+
z+w`Ar_L}12uTYZPp3*q9X0BJ81_|Pu_UTH$U6Uy}LzG!iU0x4cJPT+$k{N((j?1MK
zc#h@cvn{d69lsbHWj=}VKl?cB9ILe8Mn%-Z$={Q;udHr!@_@rWhn(4j2LKZm0x@Ix
zCPKgKuJsXC#Mis<IC8wZ`5|0tATe0>UAvcOFBX{GOju0yowSR6{b~>={B<odQlA*j
zhTFF`9-p+*RPNG8b(fd<UJ8m*q3%rj_KE~-?}ty(j#sxn{G#ZJr^<d)B3bR?%(A1I
z8GbA+>e10KejWpvQ)Q{gz-zhmQS*!nn)=>nT7sz)4&R^<#2h*drc<~}VRO3rY&zYF
zSmH99t!vad8X2n)lfz;;T@?CW1U*FYdD(SD;PlVw5#uhFE|u3{Q4eS5>UXLzsByc3
z#3e)jZ&_^ca&(pl2|`;Bk!Yx*Z1N3e-)>17;oOqEd5u{W$QE;BDTnR3j-TiE%#`&8
zE4yz9igZyIKVL9g5e(lS>-kwwH}>vx%<pP3{22?;X}I05b)d}LM{$e<r4FA>y5C=y
zi858D>oS=V9AvP(+gKgMd;rw>f~E)t6Ij88O=;LD6o&tLM<jk!DQMgLp>bJuVo7iv
zn@T8m@T(Xnlu;FPcJ7bA5u}^H(4LjFSX!r~XeW;Hn2x7_DR?v8BjqcmE_g_basfsH
z$y)<sCw~H2ZgrE3_(uH~Iy|@!XT@^LOWs6%trdviE}4cL(5<uzUbl?AKy*W0Y-7`i
zs<w5xwx~vE)K!GUq8d?TIe_h$uMm_a`w&fPmrdTO*t_anDGdVnas%zkey#nn;U(%=
z^mg@zq{95VUmKy@B|5L1j@Jc`&O>&#W93?WF#<n0a~pQFO=~}End<M?0c1^GZdMEJ
z9Qv6laVO6&u053WVnsC=&fpp<lf9^XL%OoSL=-fl_T{qLX?&1X439O+>Z^)%{lee%
zj(NYWd+wq|Sj~kD_+}fT$!Z^e4k9R@@Pf8g59LgEJ*bVNygLY;vF-a!gmRF5PTVo6
z-aa3R!ns<LGQX)$5TsWY^KNwb!Zfc#RS(eC`&Haj@dGjHt2gndmi~2FOJSR?NqcLO
zx-xcB46283az9ZYokr-gRU~%s@<v_I4r&oYjD87DRD`GUEN=}i3L@NbfjxgF^rRDD
zht*$O{JN?n0WhAoBt@?((MGI_Qi@2AZ1EF!2zShR7RWFlIJ2<yQSzmf+~Y)*Q&BcF
zI>LC~;UJ}YS85g8IzOmco}<kTc>hg01BuNr*{yTf3mHC<^403|zLRdr0UIF?v%1pZ
zUko)g+{Fv_gqySImrrpmU%9o6=l|&t!T;KZaS*HiA6ohUml)!oVTW9lDgb^z?Rns#
zccf*dezDx1+ygVdo$WI4W@<Lm`&^+g7RQE{1*{V8t78Mh=kK6bKCG(bwWp!Vk6!yl
z_sERFgL0~PvPx7T=4mKsrXcT}c@@dZfwOqfGk;yl+fQqep;ly4$JxgR$eiR;j40ER
zg3**Fjo*iHZW<rzAuu$RWa}h>Ibzp$gDA(ul7E3R`~sula5vC<5CN|_$q~TXJlY8B
zafKwQg-~L~4-aX*A`PHxN^rl?cfyk|9e1q#Q+{nSA0VW@iGdua+2gneFLFMXtV4Oi
zdRKhSj*<;0O@Vw}A&QP__g8_AVhXb(x->}>E6NqSTXO@O6MvQDcGGRcUhLt?v|Lw$
zs<tJ@1Qg}0LqHM$_Vje++OnZcahjCj`-bQ?Fx))kTH8Y|a->z&%-t{8ho2{qPsB>%
zhkemYY#x~uK$W2FKB2|zxJ6z%B|i73k_KI>eFlLc0#%0qu#l0=J1J9E3UciK)bE6b
z+Lgr5o95w#$yRHE=;Nc{R<PNBSfbu-W>kWLY&neTpRtf07&Z%cL~r<l>UtpWj{_UM
zKXwCNuidAwQHrC6T<j^^>!=4!P$dzibIKV-aZOCS@h1@-BeNnv{SU^@A}o%u%fd|{
z5G1&JXbA2uK|*ks#=UWO3GUv|jeBr+w*+@daQ8q6?oOs>_VYjgrdGA7MSXS8t@EBU
zaAjXPhpGE~I1+7T|Lu)?P?=DYCJR#6=a;j+Ve_yeA1b2gmx@iC43lu<x5ZOHWA0`d
zx3JMk+xj}88X@WZkyDif?uTC*86{oacg&t}(UK}T66jZPlYkW)St+}x;JUU+2Hkr5
zd5rkpFjm32zuB!uGS{ld2d!wawN=r)IXdNIU-Y{rjH`=bAvH@YyUx8*=urKTeB^ed
zX};Ha^O-<=a||AH$YvPncv@^#7+Dy28z3O6Oa2P79gpaR|D>_BgZLL-UsEtWeSz7J
zRPRaKejcS{Q%WKBuKon9Qy+Ah_!}t5lD_lfM;{+cbq5XP;=%o4A*B?fxlyPvfeY+I
z<tZk%6PuOg%freN#4kl)hWh0vZ8~$gMDJ3}5gD<_SoMH;t*_o=Txb*3@VW}%nxHQR
z0UWM2k)+zu88QT<Jw+B|*U+_1%eDv|uh<wbh|l;32!453G^Fm%WYebJ?&I^Ek3{z*
z%WFM|X~~we>LR?Y=P4^aq5Jb=Gu*KEQy^0qwv+?zAR3a?-dnDS5ELKHiVWDO_Yx_x
z*3*sJ%x3Im@wn5<klK{QbNT!)CDV==BKc($bKg~6HE9?Lk_KL)FAOngLuM+?!O8Uw
zZ_=$O^7L>%I|xo-<S-c;==}pU$}rnG`W}~hIw8EgHk;D<+I-P~zK&vjq(qsjj5T^<
zH&*=zu#Wl#rl<}UiT=I&uyr{~77mSp@d>Q7^StMI>*s^*LzxU*-CSh}{Xu4h;*y)?
z<1_PxdnJ2S)==zrPb|OO0JD&z-X@;J8lp0rOy#TQa_}%|WhCQ|gT>_u4W8t3e}rpB
zVIz7Pgb3WyZIOR~YMVh{{K@<){BBT7MOqh)AeIf*vfNH#$3{VZZztL+K{K|6)|#SN
zdwT*ei9kXZifkb>Wl#OSidw>1HOLJ#IMA{u<C;z$e0a%gT4mAIGYUZ_Yuzy263et~
z>ttO(!7aw{av~uncWqf`eb{TLVJqp#)?Y?8!#wT|EVk+GGxzT8X!G|T0t&ooa;VyE
zPH2pvF075dDYbS&b9pzvT%oq0gy;Na2SGP)@8TceX@2A%U{5SYvx_dty`#-^8=5!M
zBFuMQ&PBtfo1TaCd43iTd2E2dW0s8bU=Ay@N5PF!E>q^xjIYKbC6t-KLJ&zSXCl=u
z)tW8(@8?~y6pa`hmXV?qEn!l~B*|NzL{N14&QVu(l>}3DDJJA?_l{QrOFD5}PBZ5;
zyUGS!_S2f&gCLBqNo)OJ5;cN0+L{31u3QZVLP>O69fq5kU>D}azRI%b@IQbd)^oUR
zL6Vm{3OD;dz!>w#Um=Fld%MU@_UtetMjr&D$HYB|5%F{R$`<(>OAa^`(e)27e%y?t
zuuMEn!(rpx$U#D4y5{E%X<7$Qm2IG6^sHtp6lLQD^;6Yesf)4v>LsN=v7x;)5Cx{~
zkKUywu1ot$6c6|9?r7*}qYv&LC)N2R4RKZm3Uy=Q^uMdYA9~>)c_am`5yiV(G)brO
z86;MZBp9cNUoN7@Yo!o~TsIJ}9rbxFj$9r!3}s&06iMLW4}1J<0f-8SZOrRh?tUr?
z#_o7OhRd0dCzkTYx~RjVTP8+a)*b`f@9#4AGQAynB@fCO;$uv8R%1suPn@0ahxOks
z>*s$O;oPJ$8>=4oPG>+f+xx!M*WHa%_8oD3trQaQZ%7u1hHj@zD$MydarjQIXX87J
zjm!?8nOxypXpUsY!z?Gn=X<YdM?prdU5UwDXyieQoQ7T#cU!9qO}PMd-0n;fRpwYR
z8OetTzMApAWZ2JXT6<-$Gc?Km0khAUshU6}E2I}&jrfkR5H<?on#I&>vA`39*3<<?
zRlRXws*r)~o6vm`W~GlU5Ri{$xce!piL>2Kt!XyH3~h9pKdl>F@0u-da7($6=brNq
zHQ>V?H}N@(y%wH&Ul}&&t-q6zy<t7@t<6uh%+-c$5NCdLwa9@eJYc=ASJKs6V8k&S
z<HF8IF-p<fAU**eZyTb+VP2aZ$s>&j3vk6$AYmfN^CI}W*1>eGW|l>|-nX3Zi&@|j
zIQAvPGRT-DXtqp0T<nfLfMJq(hMlm^Cj8bxsfbfxh+D}r9F$P*=LjwBct@W|FXf1W
z=lozcz4ArjqYCG??k#Q^@`|FhFyfZ2fgnBXOi{VeVZP(}Z|3J;JfXDP(e%^2l(+ix
z1POlFnsMu{@0PCanYq7Qj0effMl$tmB_JBrAImh;Lza1qHx_Tlc=KKce^)LJb+r>4
zNqoy|kyyXNpTZhcLE1TYp%CQ2tM&k^LqnLV72inzu4uX(T_W>cGc3)MoC|R5-jA8s
z$_|WtlCWg6r<>zImtGaJ5||Tm<t^12z_!=YMI!s(iD+=(zjs?2@t(*>`Io2AjP;X4
zjx$zC1Cw<8xRwl7I@iVvNQ$^p)IwZZPPT)XtyaplRIJ%|SfgoEeww(dF46yC$`o-a
z7$)7;1blO^l~kNidb^fV!)$a9gfJv{$33iUf|ghdPi9VZjphHuq6iqcJ)FE`Ru4uL
z5<ja`PfumSavFwNCVxy-T=0DqP~l!Fg&(Er0tghzW`(V_?EQA!hk+G8ce(QXq|CbW
zlv+`yugX5(Hz!l3KTm3>qB_#eT-vfAlSFVP$TvXsSVx;qBu%*#{B+4Ov1p3&V`Rpb
z3+_0!iN@3Kp@F<wa-u25O|vi!eRqOVA21p!g#|->T;l50@0d}D@^asocp#;OO|}zk
z*q>!hR4XI%-3`j+9}b?&P#2i=<5#Q{o6o<7$ulf4wB>8O1TRZv;4E005NL!%c1rwV
zE?1!7NrE(_aA)ZLrUYlX^%rvSjMmYLE%M5q2umY-X$DQq6!13bJI7b=ypkLA-+V33
z=l5iqGiDr1&wsU;9N9~DaH$%_)mdJxZXail3w3KrZ!Hn2t8||#=brxozI(in?Rr&k
znDL~Um_~8wHt-NN_Hca%Zfb$xFJqg4;A9i?Vq3dQR2pY(p2o}l+{&@a09~}$Y`nC{
zl=5}CfIC0lEv&JAN_+}XZoFyT+b~w@y?rG|q3reMcI~K^&2R2QOIDo18Ig~Ii7%AW
zY2UA_W1$DG4*_CK)vNvF(l*9usKgh8R!=9xIEm@vkTw5HQQ)4?B4Xx5RtA&TtemQU
zN%s<2-R6kH18ml(Kqpm$-ilaobbm>tUNbLdZId%La<EuvY!$24IE9Ilpu$j_jo!E;
zo!W0$Z^m(KjR6`Yl0uY2@BK8?t7m`g7Aj!>dCPZUcJXSEW;S9NBSbfST5Q)*@~3-=
zad%G~YZEJw;*uD{U&&MOdc?Aw5rdSYvXb^}D*x4nu6MS-THznyzPceH$MdA$qyV2+
zb?)}6%c8UCl0pP_>}@yl`ZS2Zb-)C}28m#0RC})}kanEDS5qco?YHaBfrGhbcbb7>
zDaK*ab>E^G5=ab1>eZ$DxLy|m@lqLCZixhv&d4K!(3>>N$~mgC<$1FPYR^L!mV?`&
zP2lr~%(=1@_1>m<NfVcD=5zxVv{o4%#v(4$_7+1dUiB5arWV-`GA3P15UX<D(KklY
zW|ndYOZmi9BJ(SyF8!vtk{`=~;P0xtfuy_X4wmKCr6nim6~X*#6m#KC6?_0JV6&nm
z`|H60+^0@wA28&R6NrANB<ljkne}m?m8k?f)iN3A_-|V{y>KxOG3iSDaTUvzyVOHX
zQ!L^*Y}x%euN!^>3q~aQc}#?;dcN6L9eZSh_HJ*^ARA%Ue(xW^-&QIzo{zB0fB{%u
zwGG=6bf5DhRCx&PLtED&(3tqM`j@Yg<3gV?sQ>W!5auH6>uHgq!$ET9Dw+a1Z3FFJ
z79{Ox;@upm8KaJl+ts^YG+*{C8b8aT9A4=$)4F2rMQw^`t9a$kXLfx=1uok0#0Z&A
ziM=odTF@}O{kaA9qMDQ+#X8mX=n??D7jbG|ihcfmc)|tIpIMQ1Y`ZS=0-TNG{sUa0
zT$eR1{1v<5#M|Qj@mtYIumTt{zw(lCt(HQU{BB3uY~xM2vEhpIpC^Q@tl?!X?(;l$
zJcS(*t=~W$)|287?QP_f9~Y*C?d!(nH}T`!c@eV@vOn1HsQ=__XxjCeO=K$0!%F>?
zyYI=$(lwWT_%PoiQHlHB1!v9)#PA-25S>XkhdXw&TnUi{CC5?9G0|v;GkDqj9;PDH
z8{gx>Izs7D{c0vQwc9eIGfp@d@CQ*)taPU19VU@pQ=H58Y#vsGh0RQ<v^ho|DTTtb
zhIJ*afv%Y(cRsX%TeXtM#XzR`Cyyg9;45Xb)QJ<zs$o&p#Z6oe{E*aZ%M@mn)}rAP
zN&+NR_8@$}`QTnl+Q9r?QouAs6ogFJ*>UoDv!c>pB)+oP%TsaW=)18oL98#iwhK=h
z2Bo+UKGV@2Gac)`x)vj@&h$Ds)L2E#U!m@8my2dmh+qIM(*32FUieQ(G?(G@D;war
zZ-8Zzjb)276YW=t^*Xoqt4ffeX(|yiBP9Ejtgm`V(lsjE(WP67qNkovm%u(0+e0|E
z)~`BUsU^IK_U<#L{qi7_T!<_vbrG@FdY&G8qRnX$zj-^g%GLCQtlVKV|HMa-dCntQ
z?KAQHg>X-xo#-iTTl$Y~eVSba56<D=@~y2gxbma;wev~BSnmg|$4zZ;HWoO(zDaJ1
zV7OWyh|c}0i7{u!?VDm$P>?d|93NhEGj1f8s3*tTskA~vlkJrtR13HIH#kmu7#Rd0
zp{QKi@;j>t(MY+1#k~~Gsf6}CV*x_g=BESiM=yBD&6mte%&$2H7J1Y2y03pkM0bhW
z)H<1+6yV@K{Ok&<6p;ii61U;J|6+pSjUX4>TJPR&oz+NRGca?{lO#sSwT6um=ltye
zkzhPgT-y|9RGB7m+dYAZu*Fb_ZFL=8zu1hcy&qf*g2>UfCI9F<TSH8zVDe%v_zOCB
zQy{}usdkRtFV7scIZ<5Ig$SNi98J1_ojnj!M8mZG_tvH?mxI@8`0$S^M{;@Nf@UaU
z!D&<F0|ksX!SzcqlDV<+>WmiHp^uK#p(C5K_soIIxjY*a7fl@!6)VbnBSPhZs}mIe
z0Bp^t^&?4NU_-sT9vD@n@S9_vPfAresX*7YaB}>;f5C~vYKXy)mBG|j`id*&%LBO6
zk-)_OjCO`y+IFJ9-;Ei=P;~?O@7FKreJ|ySR5rCS&}ueX%A70t77uq^&Ys^_N5;Od
zbacfBjr9ftpwkZ>$I#w&Wz1r+mq4bgr~!Ud96`=+q>>osH}nVkO$|gt076;wI1njZ
zpIQ@=PX+md(ogm>SM}nd3b_8(ZOuLotosf@DRS2+g5~RLv?81|F)n0{ruvD~5rLVK
zYwa-$a^$-${a_QBaOE99z1}aiFSIu81Am^IthJjGd}LQih`}+#T(K5iJ8o}`v>D&r
zoR2*0fhuJ(W!VM7f?jIAFz*Oj9dsKcL>A~5Ws67V(vkXh&kqMtRXeZmZ>!)_gnddP
zH8fL@89PvNL)A`{8>nKHu{Ogk)AjS*r0n{8QeDJ10t|lxDJ`#XHR>>^?kMP@KH@@L
zOhvg{$aCSYuILCUo)$TaNh#vM>liIViJt$0&?zb5{Ckp1FxBkQb7lYsBoLblYL$!#
zu<G%i$0Xs2V9YX-OAb*!a7=MYJKoq)ObjLMc+_?QC-6#he5myfP7~ZFPY^@M{DVfL
z@4a|@QA)`Z`xJFdb38S<3=;uRFy=QU_FQiACXy=C4>gS-KmZgFp=+wmaM~I{-VQjM
zbi7LT*Rs90lsT{B=l1REkyVAnZFO4W&2;2ghL=A<Hfi)km2l-W((BFmGLN1x3Tg|N
zv>kWkDhY|>!FtfATt5*P`2*}P_A1H?G9=aIL~aT06wgTx#};{tX>H8yI95)17kY}L
zgz@GycnK-UUqU!$ykfzhA??M@MQ-xdeoHLeMS=)`>wW9df=P{rRGZ(p3$ZyF?N3+)
zvjenko{<rQx$%s9Kg4#5o_Qn@GIf`xWQGF8#lG&k=uoRUn4+d60(jzf?~BOnIu~(`
z6jj}D@;CSGLWUKmd-XB{274yXdw9SeSI<`(vH}kIC+v<=<G~Ftzb=ooWJqA3!SL9Q
zYk{7}oN`s2)gB3)2xqtIAl92|hT{2k$G~cCurukhYS}I)QJNGnea7@p`|?`@tv~y|
zVc{z4$``L<dOw4G->Fj%hA^nA2>q#<i??=+g)8~5m7XPAACX4^R`kWPcgTh*G8t9A
zZ33~f7+gcrF4-ov<FyL~UHBss?OnOxt?r+J8V`${-)|8N9K<leq=%FSK3IFKsBJlM
zh(82G6+mKB3(itGMU9wxK?0ALrNezy4w_@Es@6z<UCJXDKjzW?8fb&3s98)p@2-!H
zV|a(TU$^J1Urn>eSXS_oYCAdo1DxT!Sl`8(1m1AY-iBsQ{R7BVioJ5>d$I|C^1Q?z
zpA_Q1sR(!&FhOZ<vcVhV*j%XnH2FQW;Dn$9ms>LdyB(>aLNRC;NcI@$&qSZ7)T^KD
zGS{mT@~ycVg?c+M{`JuLf|AmLz5#no8WS070(1={ky)OA=S^wqN3D+VtgT>+ECR1q
z5>2)nbF{9~v7S_J;GY0W>2TRc23z5&D9S3YpR0RKrG&n|{friC=B}@{*{Oa)TgR+J
zU(1+OW-2H9=cFlq>vrIh<yF&po3%dLFkFM5799`l2?X<`l()&!Z=v0fM-|O3cHYh{
zR}l$NL&*-2`bQATHc@`#s=WB05pgk2t)wsmOl{@wZ9IE*-EntL!T$hTGH3E&dad#w
zbBt>Myf*#xAHOUxDQmn^!SLNgZZ_YttXa(f`Cj|0ooo-6vyyn<`a52FGvslE`FYIw
zgZU2;g05xzxnR>tB{_RX@;I3y$|{%Egkqrx0rTV)KG;{<p?KP090kt3x7xXseV(!E
z^~QZ}N?kh&4q22Gk!_~8N$!ZZ1oC7q02ZCDgwFPTC27N`C04W;fpW8cVC{z`YY`2Q
z2M2}RpaWeI$Awd)IEl#_Wf6??$H<9ps?CbwfDkg$LU(6X>m7{Q%0tly5SVEhWPm@n
zHQaBR___mle4ft+`J5R|q<TvZ#{EUl{yJZwI9hG4^mGBe{s)*;pznl51_#+88X&X@
z#h!S8*ta`X)y27I627*!y0+rv>b|cuV@?1&xQ7_Nr3ez51;0GbNX5^zguxhR&qssA
zU;Yw#2C)j^Nr*hiSh>>dUTp=tz3-!(45Ei+>LQWj#2DNXjys$6ORz0*`q4WfKA9y~
z`a88CmA_o`6v#N@dvvj-B=k`Q<v_rvBD2#>u`Z0qi(j-JwDynMMVs;4<WwxxU@Co5
zeBAg>HHV!7k&=@MK_#?;?F8znOff<&%|S%M%325hDJbo`ipm*4si|fAfDo9)&e?16
zPQquE3oR#swD&Q)@<kK+&J~-pJk2{o(@W<W`aN~_fdmM>6V)=g)H9Mrc7Y=JX0RPP
z8r@FmDOV}|*1Oo$S#rJliA%(}>#|;vao5Im-FFL|<!T%X{_nNBc8JzAIikifBszQE
zA6}Re5@~*dkZ`J~aqtPQ`ioT)bXLAn^{3$p<hs>Cxa&l_ZMa+_&<Z10=xwESGa3tz
zbZzVtlh%Y1xK@*t5^$`<5k<}gXLfw%YS13Nv#e<V@u(9eEZVqJZ0u}$x<U-gGFRHi
zO~uFT;}}e8E7AG5GSq91#9%6+nkrBzrpa7903#WXH2uJQp5omnWSeJs8iBB-i%Dtb
z@Q62!r=f{J;h7@K)R!U*cN;XKf%`d2@j+-5Fjb1JkQFp5Y+4I5-7p==3BLl-!x)L7
z>#U=GB9(Q7sawDn>@BMruh-<#SghhHvGu3<qp--vkv`b~3VO0R@vL<td`CZ(xcy&d
zo2|2xN`>wQ6ziB07X<PLF)B7L__w$s+?8)=4P)|{_PnO)mgaiXkMZ3_@$1y}mlevS
z5Sg>VJPG`SXxDJp_IaZc_xUsWbpi@>e=8MtWN`hY(9+BerfI%kvq04#;^P19)^+8Y
znHgbOF5B^_9!P=uTR$aEDn1o27%2okw6wMT7n4g^i3ECjGEcB_I5<c}aqdq(dXGTU
zmHvgUw_nwc(a&hSPwQa&$E%GtfMHsyXNj-%dRlWDzj4H2^t3o}`3qA|2z{o&l;%jf
z(kK1tv2G-+ab9rL`9nn>goEAGKgBnF*N8lU>#rJ33o>_*gutVETSQi+wI*bYKS$O2
zslu7B*q9c!w)z=C+XgC2-*fh~kh6yFMQ)gcOXI980+HhH_NW2+0vpK^Eo!@mf?2hM
zb)g?X`cnPGec6A>A#UR-1~$IhpHG@%;~!jKrPKvSr-f{@^_gwv%<OkRy_Y{njs=Fe
zkQf+ZMBEY)?eX3-4X>L;#~RqcK4s`wiKZ7%=&PIOG(M^i#CrL1cqd!;vl|88mnw60
zB#7H`yN*|4d*WQsbA8;d<KJ_XN(sQPviCR?;1b1}n2#;D<fLoJJ*r!!5PH4N-FT;z
z%@?Q31Cv-v^rF8jZS*h6-wrmk8R(gp)|n(QXow7$@f&?J-iS!iDA+?Dp~9_eAf!As
z;~OC?$LIF?EBJ}Dewcmt&O2Yq!qMdYrHgvV22W$miV|x$Aaw2@U_Tjlmu2714J<5;
z;ocZ<q3jlwLu$qAVA+bbo*KWOzR-3w7$gic)EHgYEX&AmltECFPb{n4Jyal4Tk)^|
z)V$WoK;<>!v&cru8b}Zzq-&A1Vo3;GN0Gh}Gyn6;9&dv^N6&<#0`qfBRo&=-6+a&L
zFuFZnIaOVWlm#t3p3rxC68uzov}1d&u31NhX_-^M=GCOz?5EJBtB?h$SzAq0nW`92
zmBKKki3iC9m4_j1v8kkdpqnN0Qo!Z{?As=Ge>eLjfn`3Sz&(Nnf1qNwe%FS48R?b8
zL%KvBEH1y)!YVbk@*LH#XPQ*8QdPrXL<Q=nwTr7gM#RY5_?o{~>93Ru*Ok$v1!3`T
z%J%ThlD?m~YQ5Az(*6NjEa?N2zK1@lH@0O85LkiclM=C54`*E70h!A$zUz;uXOPfv
z2{5$-tjfzq`=y2-6A|}4c~^xNY%9^1$qQ^t421R^4(4SqR?Su%zQH`<qc{C^S=M(>
zXHJ3+@lq%>=s7}37qXy})-e_%c-AZ}JePUmP%!@iaO6RTIFsD8F~zLR)IOn{n)$K5
zFdzWMwc-a>dp3@T|A%Q#;vv!Y(zWG5cj0Ai@*GcIn-ncmRF@S3*3$7O-qB@NGcLK*
zVLCOK60zQ!vdtT`%!sC>D66ra3Ym!WRh`KJs0ll(D<{hD%yKi}PNPE28eNr%H5v~x
zea+fKfcu|gwzjU2{Rc&@o|kM4XZ?u;ET$RD*3jMdc$e*NYCzT>!tB1{dS6}vH^?df
zJzhhVfKn9koy!&Yc@9af55t8)6KM-AJKM64yV$TOAXr8$MbKn~McJkOvYagJsgkfE
zw}OQ=edEdK5P&zLsW(KTY#xnz0e7b8bpTZb7v0g4-rs1F-tnxLjKy&*tteGCG4=Sp
z9euI2iq;8*V+U}ZQ!V5x>!|UiJP&d1D{0VnDmB8X=fT7f)`>#!?s~(#g9llmbuQPz
z`%$r6eTKlyB}_NY2dw?}SEv5Sm!aqKyx%QUufHAs0iM(Diw#)2B)_N*kPT3;#L7)l
zE=x3v4U~Vm*x<BtOBUX{E>m%_u`F6!W0P4^n$%3%K$2qpjboMPm7^6IIi%m*4oY>x
zYlCA1X>#8b`}=jK<|pYE@7(J4gqDS$PwgV$+qI^TUKt%&<asOk1KvHkl3*)7iaJU~
zxK;88KHFi{HjsQBKBWA8oIFs_cfAxCwK{xZB%kd}4db0Rnz|dtwqs4*$e#CRomuDk
zw(lypR)4|M$Hm+{mI!zoa>eH2(h0E+UJ?A2=82LPZ{s}9+tk&`rD)#nPuD{XBHO~6
zs?d>IF&>202_=lxF5v;!)~KFfiJy=+YwUu&di5sVe$1>#{f<JoVwR-&w)dvA=N~{G
zp~y&h*nT3qECh8}>0z!$kU%E#M`K0&`sbJ*=6ZOO${RV1{AxVg@_f<w$APvICq-!+
zdWu8qKRFjkN|1rjV!L|2LH!*?4+<AQ>BR}3e*k{Xy_i>2k{PLVylhu7$!1SchWsWK
zlKAH#rk~Jaj82xy3GW0P(4N^=Rj}+|;x|kjVm-?S<z=ZKn?OynGhAZR*VQc0F)j$|
z`H^%dVg*@YdB>3SeDcq4_CvZN!K;Vr$*38MSt-J#hi)ScmE>!pjQT(w**(wSjsdoV
z-P2gn!U7f`wH>URN(EY#b0xCC%i$xPNwEDtz-`b!Ks4~WIG2KG9j1Bhw4W>_{oADN
z;QUZ&Z4q%dFlS+~FGt=b(Q{;@lp?!8iL3G(bK>Xy1`}PDJzU!2k>6G3h)OU_?t#P{
z|J;WK9gGBO*_sTBab8|J3i29Sfh>JyTmIQUwH@zfyX_lV;S|NTre9;`WP9qZ<kD@+
zuiotBAalQ4f?RJO@NKIG|1|!e0tHnq4rebx!Lri>%1awNo5HYRc^2hcDzg2et4VzS
zbRq2;p}E35;QQ&Jbe^`gHzJI)t9rhT1|PwWQJB(x%wdFCVb^h9*ro0&^QrZZez@s(
zsFyYR4HJL>s}9+Hkv~nr2cO;2uOd`^H<_xtyL;ctlB|)EJDK7B>}O>h6b@8cCVPfY
zOVM#3LW7*idhS7T9=21y;|XcuqB|T_6aj=A<x1SV3(hEBrFzlJ`!ytnvIm3q!SK|;
zrehI;vV83hh{p%StyU=hGL0Gs@~5xq4kIQf(<7PRbgwAmQWnTm(s=_`woBWb?~$@G
z+^5+m0^GmF6IQXs_ji5|sDyL8{f;66pnre|GWI0{Zb9g#Y;=(DF4;i`{LvQ=$e5#N
z9_`YTC}8i!9hH^EY#(0{PU08QyG%u9JmG}Ppfjd835v20F6VW{tOoduSF60>1l8~B
zrO^*5Hq?UlR*1KOh<cg3$KIH<1pe5x&Y%AR&TYKk#QO(e*yc8hiVNp>b3H1sIo1WI
zAD$I=ytJkX!rsv$zGq?3sTCs+){sHmBSIVCX^`jSmkK}ed$Z$P87~o*B+4NoCs-wL
zV0zjrbiwkKB0<D^uEyz<4ajntfyIa6c2(n?<=H`mT8RVqCZXib^41^+F;`carzk=`
zNgHG3qiK7|v17MjBU@Q%!5#B4?Q{d@eUFe(px4F0wq{!*WagGJpE%~DLEtd-x#A4R
zXl6!S47C)o<J6R=VPuMCAt@=-U)q*qZN#^F!*qJ83Vk4g?*y0_Eu0T>l{?ggn3-pO
z>LsBB_tl`_GFS-1P5g4seI7czRM$y-H3;h-uY%ZG<_)~vmqHHJXj=(+C(1Azqcu+d
zXzDmnaU(wwGy8fJp{OrT%wHDQZ*L_GF3)-5Z6+%Qov9mYhQI$Z<HgifUh!_S#pD?X
zRMWO_#e^yMAF0)SNsC=;f>wq_Veqp~Ust}wSsRIWAA4*PjI79ZBt@Ix3Px@OV2eP0
zWT%Rx?%%~$`LE*)=^XgE|JM7pOe>C$kaxi`B?>YQ8Tk04J0tz=TMhbg+Sh`ragPgZ
z0BO`EqCiO;58r`$I|!q;3LYFM87dRsd?^oOC~5O8kANZPo-VJF+*EY2&7jA&<bL)=
zx<@~iyE!i&I|&r)=#%fs`z!GBNy#9mu%$(l_{*|5C4La%#**JcSQ5D6*4a_6vmH79
zhhQb)UBHcx8!o%&Cn523!B-{&=|h?rhIj82LSbLy?<zQrCh*pezv<kLx37}jyfVYS
zuz43Z;qFL~TP)$!i?lvuo^t7t5(&SvF=o|jx3LfU^L5q2WTSZlTpwgTbqQa=?Oq=0
zF=-1A5kDlU0vO;0Fn^en)})+lm<8-pfYh!8{B5WokKWdZ$mb^p5&!ZRwA%-Tr+$DB
zA6OE~cppPH(IDmv{*C_tzi6*oQf6T)dc|j4E{qM81${u6%I2`d)6c^yu6a4hK4F=i
z?B&)vcsPBea>e>UWRyXX0^0{wiUctUJ-oF+2OO9c+II>ivqEK4TnRjpM$vjmke}G3
zPHQXIm{ogHbBa#9m<Lwcm0I)Zs(S5w3*tY38sor%m)<6(RdqN1>V^PBSeirsTJ3`W
zLi+=R*}ADOSo}}7Ew6U8F}fWX4e}f*4$S!2VgJj2jz?Pl;bP2zjJqZDn*ld#vctf~
zxhsL0GX5S~lYry~@1|Jtn6kL%r>7DX<3q*P#nZZIX>w`|5lp5YC(?cNGQ*(?Qdx^y
zH@E4ug4$ONH@-U&X~|q@O}5{ZO?fYi>hD4ul{kpX@3Gu=di#f+a-)lM2X<gA{pSPK
zDLH{9ZQ1zt#2C-T#Yo|%I!a@@qQpU@uOH%pC<P2}8sTpDR=irQR=WC)Br*W^LLog~
zr@m)frs#CjX)h|pj*2n6d`hy>5y{AV<{Wh~^}t{Qw&BDP#<kwQUAKBO-|O?WYSLI0
zC#uJ!x6g;tCS#x^>Z^+32wmAB8xLB^%z7au;pk<n^QA55?*@*x9Dq_%obw-viHYIy
zH_+EWvVVZX<GrM5q=cPfb9*|U@RTm`A@|guL}EfYz481Vol=OWAFtC~hz6R;$TE+y
zXRz?nZv_27PFJxHI&WKaejdy9tdvC4wll?T(5k1teq0$EJ;mB}fj(=HQqp-Pc(?0l
zoXfPoq8vyXcuq=bV>o@7cjawa&X>nODSF2@ZHyMaev^mUBiNSx%z(V9+%z23WI-sC
z0DPMScuoFJWlB(=>SJN0Ho5jbGN{y(wF%Vb)kqi-0Zz`YEnQ`G(=3gRx<JxBGw0Ax
z3Xhi^y}Ya$#BeT2Ph@(~Hcz>)Udm`_si$f*9*{AXH`S9};Z+#iXUjqs(OOJ-WYFeR
z2M)EXv!powjAE^E)OTPE*1ER_MoQ#<b@g}Cx%;SFow|av39U~Wm5H}oPKC&^x|N$~
zB0Sb_3O)w7S9t~UwrgXH2#Jn_kYyZr`KNRk4BR??b5w<1mT2mDCG`u4eX7v@(|8XC
zd+3u<w|(4niYZ1rYH_FX`4W3%fCEE7GC7lV6Z+DfzKqUna*AxrN1ET7D&zSfI~nC0
zJcB^#6MPZj^0E24if(-$ca!<|Icfr-g*u(i`q%7T{MAki>-k-%;YFK~X30(^KKqJ(
zNdsrOMvk^x$9nGvG?_jX&qB5{^A^T(6Q0kwE{NlwyvSiA)LS8+taXLCYa4Yr@ARub
z2GC4%Wx3Cj>___LF?m*fq0QXT!OupvpvJqZxeeNDpz1A-QB+MlvI0Nv6?+V^?nTgY
zGGV}Y0GtXk5Vc!Z<V#`Fuz1wBy3pk7PqxX4s|TF2zgkmwQcua&S>}0~v1kgoX1Ll8
zA4ZLnvD<)1>WGshU=p(U;7_(%br&*dgzLr8?RY_ALc}(n>KtRTz`odBwRV{E0jjA-
ze+Ltz-=7t>!Vf=)?xw13b%`|XiGAG5xhiYYRL8fZXqVm<VUdaWyXQ)`A+F8?OH0a-
zM%LK&d9J8(nbs5ICbXnROydqxWTJYYBf^5{*urC9K^}>fU?IJHSam!7^ibPn_4%Qm
z+3_x6qNNbTcq2OXj@6!|5CG$!K2lB6yhx?z!n7JHkkA^NU#|WlW*>$$^f%B}fuI)k
zwrma4Uf2<H_isaSd*W)-2cLx4veISU;+e@>OMs0N7U^E<?;3n*arX1QUHTkGtG1Rl
zrscR+&Y1m(zY$8lx>_@mO2JDZVg(gzRjFx0=x?-pj%_Lh;s^Q#EQZ#xI3Ly7c1<Sk
z%?ds3U8mzU^%DuwNKjmk)Y>Y}M~_q3Y({^i8teB06Xoc;7_~ao-wC?{66O{ceHs11
zRD>bE_a@MSCq9@I(r~UK>hI9Sp3H}=6h}I+g%`rQEGBn+c{W*?!3EizzLpg1H_5yu
zoutj)w_P)@p@3#!Pmi9vQO0%&&7yCS-Hp)$M!gc+C{i@7qHt9h0dOQH$HJH2<e7bW
zm03_*5h}AuGPMT_)SIu;fR6e^0#Fg)wip)|_~rj^9SYAFK0R>|_)_hI;)J)uO|(M~
z@87T+sp+0NNu65ZZEkAM7*eZK1*m+wG8!Lf^ApjIRI(5j8e~9-v%=tzSbDA;squD5
zL%oHuQIK)#^`6lw)+Rymph>%xRK-R`-tV2)ZO<P_7X+*Vk9NL;qv@Iq)VEo7IrULK
zWt$(!Uz1dJ@v3h|DsjO`9$rIl%46S|H}d0+kna5MiGwJ7=WNXr%9+DOXJDD_1~!zS
zB#!&@KWarGy<G{QI-Xa~erln0*A&RtSnly@;QVIvw{>9Htm|?9Nx{12zIi024%mtl
z8n;z{@Bl(T#dL6l@n`8+&DQO4LdDzK_X}#dM2owVd?)zHqeiG=qPklMM+tTQs3Hsp
z)eL$<52fC&NUp2x*s)3d0)BKW+T~>yq*M5liIaxGxjtR(MbgInK7m>&(-3t!|GTHY
z7v`wQueT;RUiQaIS}mQ}E1w(Q$SM9s5jl$RvFh$zKmbYnV4Z$t*v=;1QSh#1qxiyl
z=k^^s?j*EpuyYjNI>4B|1P+h9^ODJp8B-vLu?Xf;*`#(GRymsr^`rj;lOD`6?f&@6
z?LScDt7+p)hxR#i9VK-WsMyl#tF!Uf-Fgf$+@klU)Go>fQA(?VNNJFCA$zdh0<Mg*
z*p|X%jrh#c!BxBEybe_#zI!%Dubak;k6j@lKEjwq*DdvBGc9JWMu;&x<VKz=PQn@*
z*TRLgo2YT>g|!jBe_@T$8pfbj$Z$)@pj~!FcW+gmMCRY5&#0IPIg4fx`?Gqtl&gFA
z{9Lh&+e=#9ANo=LFTJp%#MMe!jpO>amN9Wm^Q3aI=|jaUUqHiF2?SY*Wr~kBHpgD{
zk@=%lS5`x)wd&p4&1EGl9ru(vuIe|>vD+d~)0YqmoHDdRQ_V!^0Lu;L6*GH&uUNDD
zdJWOMhzIAK^Mg15!IwXg)Xz<CUj6VSremECsETTEx&d+s*2z_Zq|j4(g!|yGP22ZL
zJ1&4m1bRr;0-Bd|QbG!Q%hz#uRY-JJ|5h<g4(6CA6IZ2e#W_?3^i^%#IqWt^z2!;_
z!i-(Ktn9EcI*s>E!_-Mu|K?6|^m6|bTvw+$JcwTGclp$V{i}{n?%+<?bu{SBF7Y9#
zO{=B(WbGfI$|L;zA7EsVJ<d{7-<rEd9oxsM+Fr&9U#-fz4PIli$6Wn(`V)@!hlmIU
z_N>m~=`RJn+S*2+>v!Q!hu!xdMj=ZkKJ~8|k1<Of;d`GGD<X!DJ<;X2vBgt`RP8>j
z>O(L1ym<T8R2o|DG6QheSX;RB4pi|ARZsEj)OKtfJZxcdE3$+PuT{1NTHePex;=p1
zVo>82)VGS;Fpb;KzWww-uoqt-Yq{LIpfo0@#L~<?^24lCLa)3sTS1>fiW2r^oQK=4
z>UIlGFG+WYsw1(Tr^9t%lbT~_jEnkS;EdjJVWHUd!F9DlEHRs@bvB3AL2*>E9eU@O
z;|F8Bj~2p_E*-(sX(2-`ivzWK7s=^AQ^Er^p8W0997f;f{K9vmy{t6Mv%<0hX!i8Q
z*)tRFf3Q?slXiERG*!Gy$l;_&S5=puq8I+1o!x|(rt#463s<inCnJk9;rm*`x2hLy
z5uZzv{CX5K!O_F#xo-_=QEeSNl8r%ur3g#lm;T$wd(aecFn>Gs0c7aCM70CEn_OYF
z$7DS&3j*_dt-9@&g4C6X?W=(y=uJ^r9iyGOMTtIh)Y}Wznj_s!!x{E1uaYU+IK#wn
zXeU~6W^Bnr(Ny*7VW-GD=VaJ(h!z6;2k=T1Yp;3p(_Ql~@Wjln(-lZ!Res&l6|>Yg
zkdcx~hj<1j7g6tjXTL8Xu-Q9D6icj->!)k?TbraknW#AaF{#oRgHymTPgDbqNo+qT
zm_D(#3Ezq9y7J7;>#MiFG_qmINfd5T=?6JEqF`sOeWP=r5r77-Cq!0D@94g4*0-va
zU0Dhcka_zO6JX{@=H`BxS!>%C`pAntGrJS?T6hD;gyDuyO`34kH^D(D^0Ds^O`s#Q
zi<Ac<@FEHa*H5<UTW`inN?;`tWW0<XOWP;KI=#JM(1Nr((g`#ht+oHh&DS4jNfLq|
z3&RxDM{@FM4n0@&qiDqs6w}3+I-TG?x%knXjH@k#A*M*QvyBX_b+*lF(GkK9>CHEU
z2d@W{(&TdJ?!9CT^mXGnttmlz9pTc_2&m^9?P|%~U$)<2NDSGUxf*><U$Mlgr{a~C
zdlD}HiPc3$Um|l|L)FxnY~m&BjB)^9J2_p^f$5z;mh|3ty)|e7sFW6ll;k6&vVY-_
z8C;t!yc7jr%`-Q^LvsFD<HS1qG$}PA&Q2wh6rMsGvi%t=g)Vts7BLoBxD_PS6+HPq
zfn*wC8!jyJVaOP50-{Duhncsx*kvTntI=ZBAANl?b@sGQfHH4CUvCOje~pJ4ZB@s>
zBiVX*_H;K23r4Un@Ks4yP~RM*c-@t8LA$zmhcm5itH1Rmaxr?bFV{y$y`Qtp?nC|?
zwBz=vcsjlYQ6uti!%nKNvk`t$Bk+TM-c)&PJ#CnBu{k|$%pw={Q(p>u=R_M+GJ#Xp
zY)@N%P$ANa8^Marh!U-fA9uA5M!#CFAvKIo#4lt)-@#cnqqo$zQe9*pK=^8xV1Gv{
z5q1QGz5mM{Z$!Y;m;HG*I_&T%GE!_(+bWJ@I)R2!wH~iPwj<)}&kG|R2JT+!u<SP@
z;^kfzs$(k9zYO15S~ZJGcxvpA`K^KZ=S=f!9IFK#oETo{Q)QnfX1=lP9UjgUJl=Rk
zvk2n)%(6PfjRFxnb`kT7XtPt>oc&H<IO~aIkRR@P`XW`WpUT1LcdBs?q1jZ$(vOz8
zCKNp3dyG(n?usUg^pQO!4J#YXPVzS4nYH)$^B5<LakT53YMJqU8LT67pL5a?bxX#a
zDdy1&947=3^sqSMWla-T%{s|aVotd{y`vryj%V5nj%eF7BLs&zp^sl{3%8SG-o`oa
zrKDo-rVhZP#_b}EM(r0GxKm8Xnag_Bsmw%Ep#32PO}Kjro}{iS?pqpW88xR4W~ns5
zw-M43h<;Sn@|fc68aOX}q2tHh<I6v+&2A&6<Z$UBI>a&zK(nQ3uK-Z9G0H3PsN1Q5
z{D$o8`ffHsvY+CfY4A0IX!Bi4JhP;cxRGmqFs!}s3*3!N8vY;Wt}yKwmqXKz-FN{g
zOvCx<?J9<f7_`>z|6<{YZ>!D^+k&zpR-2Gb%#(3txy-ZSr&_UL0iVmLt#gCql=dT2
z>-$sZK}`H!5_LJUtt(z-&AX%fch0!j7Oq$y1$$nfnW3Eq3^tgGF>2jkH61LOQ`{C&
z7MioHgodTqNh@LRghPR8A&D@3Yj#e`G{1U3bB;fPk1y8UP|LPPrrroda`N3av9FD8
z8_gb<V#PEIgyd|5O0Og4U(t>-GOR&1_enYAT%%9X<kdN^5~}sv&~+)E-_bS{5imZo
zUFzq`&jPIX-W;C`o2l)<(_f{MH+~~I$ED5bLUN0ep61=Z!vg3yaUvWfTz17-ErLj@
zTBTPa#<?MoM%R6RdAm|8{6cM?h=%WE;M)=z4~8blJQo;*nAQilsNmPObYw1+PzTbU
zK_@UkbBRs5Bt68yzLbm*(BB6@RSfZHo5zcM0t#%KjlC$?Y(`g-J2WSfwcAeGlRsE%
zS2|HbNCNO`*?8~1gGnWLe8Uqr><0NU(}`cAqpmbmj6yQSxC_L@t#BdqWG8Ux<j2KI
zHD(26Eq};;B)8R)V&meocSx8PV+wCX!udvqmnuqo2C9kHWnFtChtc_!v?=zR&mxJd
z{LdW^J`X`sGnBo2ANucWv>MbPCixUvY?)h|aWs8;^K`T<2T+YH#Ap^?Nn?;F`DHPu
z7F+Z98d>AJ8w_4^1MU$l+2x7Q`Yt0T{*JQsk)GT3x}wp`shZeclK&r|!gi2Nr+E}F
zS9bZiylAP)5f?p+8~K>I^-jIG(8l4@Y_>;5YK)!{xp8NS=&#XLdSx*U!yQ*d@COQn
z5($i)I1?Z_1IgeA;v%g)%|8O}F8=_Dz<%BmtJsU$g?2aRdL20yb;OSx?+!t@GgboV
zH@q@Y)OO>()IIf3$=A}mQs~}W<Iuj1U$e5S&4or4dqkYm9PRd7^d3H2xq*X*Ml?hw
z#0i|Bo$cBT;<2Jea||#d!9qidv~o5UqM?a1TCsaUK~ee@2_R*FeGfvE$|Whc4!VHr
z0m7lxMpj@Wg`+YD8KS^BnU*B;h6@K!9o*6@@N6jdb;f6cuR(z(g+VAzooC;u`ADHO
zlZkAPHE=3a%4mD=js)^?gIL9ennFe5=7s4DH&@po&a=O3$sjlAidQ9~@6g^Nk#YuH
z-PMIMQ)6;ZdZh1p&{3!{K)&*QhJq~d{FhDxL|9m0E7rNt^RJ4!&5R*kmlEwa8$|oe
zqCyfg_li>`%Tb_<Zxwm0Ko$zTYFLyqmuD&fC%m$W=LE2z`Ba#93QsD2zk_>$%4SLH
zX&OR}Xxb9!BHNX^v2xcsyP^~v4pgNK9cogSJqPqXxK=z%M$y5-;ylyX8)(ktw=MTI
zpM|uQbPhws9UAvg7JEUNk2-3W?c?imukmeEm_Fv-vn<CX=KR{`a<2U~+bBV=cBy>+
zSx<w#CytvL`$QvwykBj$n?74XLG|ZJV=2`yQ(CsR^gAlYj14ApFR!C+m7G!_+MJ#@
zP{!uExaPT-w#`OKIFg_;#8xvJGr~aJFR#L6*d1pkewmsJzRU7|4(H=K^U(7DM1fxY
z;e=vb;^1MgnC|7|(z-cLU!Ur`4|Gp3(@dI>S4$|0n8hd4Z{!zW8nMVB-B17Rn-V*R
z3}(@m2AlQZ-FJ>53k|1XpEwPUBcsc1M|bliG|q0LsVukCkBQAPw>9mZ0z23W%&y9f
z=)rv?Sb~PyN2;AUZ~p;0KBH2<cgU4_dST2q*=9APimQJJ+$r=yGVjL1Eb?c}mGdxp
z2v<oltQP{e2lkUx2u-JO!hK1iTiC+=NcXBc0L?ZQ?@H3Mi}rh68Y0dW&R*IQaSA1C
z=S~}k;*5_;O&%bmdp7|}N!ub~kpXM#Ii@>elbUtAFCrz^k!T%-7@u!$iXCduI@xWG
zllm@&i~N-4hY~UM=MYm<5Ps(^%`vILU(4KP?j~Ikj+F*6f=s?lc7fGPdyU2rVmGpR
zK{j>aDDa0^Tk|FF?D-PX<TxmFLeph`hTxP<5wxR%_@~pQ*m2F=>%7NmDEU|DI2e>V
zAOBbQY&k^YLgYtgyW%)BvwYBy>~HK2Kl0#b4&Pt=^m~3svG8_Vwiy}-3TGwK*ZpX+
zZwI?yuH>l~aZcr$VnizVz2xWf%?YmalWeC9pnXBP4{mYP3jvy0uuCP@T@zY}nw%)r
zawVZDtANG&oZUv!yYB&cdgTMVW<PbMdt$wN-FAkbc>8u?IoGVE+coB;pIomgW#1cC
zIO`dS6bJ;<Uapyy;;p6qTDBFOtv^zvnDl`R-n#^+=GsZ4ugZdE6f9Wdm!~{0E6QCk
zj&5Cp))5_)I%0(Fg3%K%tw&EUFDr1DSKG&!r8k)C9@Vq;EnAF5SXg7c&)c(N?H+cj
zj5g#61&XDAP1BcOR;<2#PjdR8$?1ibjL|4FuVM_X!CAg5-1EsV>vd)t)Gx2-q1(mz
z`7%5&2*?;P52uHomjr(bvad+-51#6o_uf+-r-2wU@walVy%$4+h<o4v+~HMso?%?3
zb-e5C?rOOJ6?M#WoN(7dKQXtXGCs3#gKFk-*yGHdjtrr{?7^0aM6^NOE~@LUa=GS-
zcqyU5=d+7ah5gmQWEE~C=;!n~Y)n4*yc!*T);Uyls-4O|Bo?C-S6v~66jv*$XCV5Q
z-_kdYm8%aZZCWSM^44=}iScli;>(*Jo}`Sc=Y~c!JSTvKP?(-9kUU7N*`UoGaw!8s
z%5I~im#x5=5T;y~6*6DSZ8tvB;EHy{@}-qbIQt#rtkvjhjXwLM?<wo3c!y=`ZIFez
zY9~*e@BkHcWoyn?I`9*#)B7Kd<UIYPjHwGmuCehB%VpC)v5M`rL?8o~+SxfTMd9#h
zTSk1@|M&}y9TvG_(Y4DjLb^q$5b14d{hgOAv^4_RZT9*K!ij&It!MYi;<|HyH>aVx
z{t;{Hd){i6*4Fo5x);8h=&*($zz}??kia|puwdL0Z~yFZ$|{PYQ{&3LfgzZnrkDIX
zzaLXP0k#}HSl#tzDJv~X$8(yZD=FHoMEsrFG>8rKM*T0JAFt@;8tS4S@@#PYrO%n}
zBE#)v{piwmYvs3X<}M|e!sjjhT$#TCmGYld?B({j#F(s59SpeGd~J;jah^bKG`*<W
zEF;nqLr=f@+mb)7efS)#6AH<?DF=I>u=%h!0_BdMh4`F&^EfjtMvgmG09;IwC^XDg
z9Y2fLmm6fpZ>#mosqL%+emReb3m)j!{V^gBVGm*e-2Z$c$_;kSfW)Mt2ONZ6KQeI)
zu3nTb9W)3GN7FQGeRx|mrhh^VIXq}q-`=7pf@v=k0O%<LXR5o(X)oVhYVxb8aj&=X
zdTK>g80)&Mk8R!`{p}<uhm7&j`Uy~b-;_E3*02k0*Rps%YBZQ&9k6yT^p6w*6{Z(u
zzn}Y_fAuD(WV)f+klb;*8piE+>ZdFNe|v^T$+?2-l3oAsA*W9exGH_#xs`AP$7_pR
z_KPt|${H(BDk4w`S+>3TTsg2rfrQ7gh8!GFcwQ(6HP<qm*hR{A+8%@Ykm)Nqo=wUp
zC2)p5&4#83BGRfmA+AY$Y@zQA&P_odY|_i-D^AheXEgNM=Ux~zutMLrMTqz|fEb!h
zap?J21C$2Qrc5z$DMFuR0uiQ4+h~6KxU76pYUmzbmy8qbBt)NgW`-kk!SO+Z;M@8&
zDe9DWh;L;-`5k?K;@5gai?2Z#sGNsjl?J^JeyH~9;24_f#1>khe-HK<TsiDPz<-g0
zJ02b?w24^ki_A78MR~{H?Lqj_<l}WnR!y531&SyLdKAgo2A+lwp5K124o#Gzk6N!H
zwBOscEkeA3PEU1=GyodjjJ*?}otvVKeVZi3O`R=&;p=y+)h5-cuM<i=Fp~s)z#H+4
zU^+a*pcvGc8$N4YXs?hMT|F`+L1!?B&WLocq!ctj8=aKqIy|gQbt#HM&q#NLJGhAK
zIeL3*cKE&+=2;7?c=^(;D?aNTuk<~#&c4_n9Bzpmsq;mw;71_!QTGLFR+~aL-a<aC
zlkHv64?N5^%JxWGfgC&P=DGkZz2B5<);qR*)V0=W+fR6E?c(f2E<Ou&h450>{}Iws
zA!zq#BfO9ehpew<`z%r(Va%-w#VHy*I1(dU{i)e-(QE-bnRhpjlGVXc=zNMcU5q<*
z&qm79#B2QYwE6^jFSkydi9Bv?8psMQp5e&n@cAN-hZzso28+z5r%yoVx&VW`X`WT@
zOwUhoChQw-aN5juH%8J@kx*gPVE64K)=v4_1?t(H4B*aJVuYQG3FixxE!n{PKJ)i@
z(=Yc?C5dFi2f<?z?3{8>n2jQ2?HQ$*J4g1*$*7W^<9N8_8IkZr;A}!J+;z*RgqDo0
zWXwr>pKF}O$P(K}&CgYj$F&VK@||&@OC_#ptKN{rDdAB58c6%Xh@-FM>)yD=$t~8G
zgB{4TK|Su`MUiZE%-X}g{}tXhn7DTEr}bM|1Vhep!fZm|rPskP`p7|Mg<8PGUi<v+
zPfd0w+T2%s=1Tc&Xr1cU%yx`&>*)^|%AqkT=(3j4`;Pa3H2UGb5N-fN{t1;#q_(2U
zK`&bdk{#=S>@IT|Ic1S+(U*PMn?z)}ArbCogF1utQfN8X2eV%&GCD(uxy=8=*joj)
z^@nY{p(#*Yin|00?(W51f<tkNyF*K%xQF8I5Zs;OZpEDjEmDdUm;cWD%|6>R@BU8L
zBxh^Z`mN`=?&}V6(q#~-t4&m2piVVP{pYSYD*KMQRLAUQ>L|}fvc;%F^BIC9^u&Ll
z%!gt6GgD2|rKA}L;t{@vp#0h)oPkN*ur~-}B3QR^930n1pQ9VTLdq84L&8e7#xnr_
zq6>0=nwmE!LSQ4pI#nWs0(aW=q;}})L4s9|p5#t}<ue_mB>H|8zAe2E<+|4ABU2)t
zg`0E^kN)${`zx%hxjB}dcLvrek+Kv^SP7;$)3Tc4_Q{>_<W*$nesL_ler?@rR6=5D
zntqT~GC?FaG!3dF2ici3A>62?VTfRL^yVzQnkWWP>}OdASlcB*XO2KAiV?g-J+F+j
z`(QiUMG3DEA>Xv`&&p)b-=OhqyoI6`axpsj#64>;?*hLBDZX)J*2f6sMWqvm&IyBu
zdq`#0`pjz0DY0GuotJ1n<14b_Ddv(ofi+Z*E4JZVeuVzDp)?1lOCBVCAF6&!fG>4y
zf-OCWfK9Hup7#eDMmE3|n>Zpf=}~5+hVk9%XhMrHbqQ}G8p4<uMF#Q0981uB&_c(O
zRYO&)i40PTzir183;?_;F;#P9Sa_F7#}xcF2mPD|;(JkPOl?md7AdE$t=0b#{n&gD
zlWTQ9Am;mJJ^GNZXS}St-nki)Q;|$fIC`&yL5YV0nY~IbjgZNVL!)8fR!)bI%^G=G
z(5Yy&Thpi95>+$yXr>Gy>Yh*1{$P1aJ&HyiaLd*vbfbTrqF|&zU@7bc%w*BH%2r-c
zKJqiSM})z6U|DAzYvMTREZ1{3xpJ`au?nZKibBSxJCB9{WPe+76#U~_*F0U@&IoGl
zgtVxg{U(nw3dfpn&A27X#6;F<ZQe?se#o-<&l3w1g0lPGpA>N5Lq9uuV0asaJa6*G
zTh67O5^dkp$VaQ%L^&{X5`;?~M=LxgOr0zGri~CW>6DB-Sm_Bwe0bisy+g>Sm;;W^
z(HE*Yt=i*Ebk>Z~3WaqO8$_*soxg@q=ejJ*hUds!|0QxqModA#y8ml1n|LPBb+G3@
zz*>i?yxHpQpi7wTbF?J*O1{^g-r(GX(}LQPBEM6Dx=iXpzgLM&<^3pKgaWbwRl&-)
z%WW)o^98^--6-!+KN@@ZDmTe~P?HgXde6F#K7H<4NE$|3Qc#=0ovj>nUi;k8P#5ZZ
z$Xffz;U(G6v34O2)=U;dr*J?YtW#Y|;B`oXb*oiT{^D&Px$%pO);EV50-09ho)L-`
z@{V#5S*jDtkW-Zy^^xDWfzZU6tSd)USaJ((x``0QiZ}nDPd4mwYT|xB@~BQju56+P
zsgFF*TYYMrLJiOIgH6P!EA@6Zd2>=K<^=jt*G$#L*g7|#i$}>m#r5lLx$qD6C3*4q
z!ua9xe_Q#rJ~w)*p7NnKTOU0XICD{CDN5pe`$U&o+Z_Yx2^59TG-wSM;KSV^f2x7k
z1vyOpqW0tryg4iQRCAuIZFO};i%1_Md?FQt{ehJfu%gyTbKzh5bXb&=GK1}Voeu2n
zGrl@uro-Ev6n&4t_wr$*0;eZzGI{ErGsWbDR(SiOlfMJLeCEepJ(9h`7OtF~tnpr>
zP!31>^9!1E;z>nseG=OVyGvLiWiS|x{>_5ERoi2n<9uN1Po!IsO`F@3*{~+D{8Ce6
zqY2aHlxR`sX<W~2=rT`aTjU^bf<x;MH*iFHFj+CBQKgXhagj$R_56q2<TeEEhMf0a
zO8M035@@()_Ksf;Yf5t*FY!lzgS+Dq=B(IBWqb#A$*n}tVqAR(I2{kUCr9?SIUr|3
zC=|^$bV+J{h6nIlkiXC{H||O(7^}jA$-zAY%nXGX8k|Mem0}4gF?qFMdz<0mj>kVZ
zKpH0`E*@7z5vf127l*p8<SE;1GB)M;F|NwJ#f5ZSn9f3{|68ZUsu;LVw;YP!v(kee
zAKS|N?DBn|IDfzAlV7f6duEEA&_?FsjK=qF5`k5=2LV9s=(wrC0_OXSJl!ZuUO_SD
zt?WK+j@tOiz|z76bn50We`~OVQ?tN~J!Sq^aX|rZ4|i$LsaU<A_*Z}AhpP+Ob~<nV
zrhYF-3n@+z(osaxlJf{W>iy``GQ`C>B0bL69yN9dNz)nBG}ULwBw2NEet3X65C4{0
z&JnUk*mpDj1AIx<i$KB^niLIE^-s}gYXhokmKRVuOx@wSwE*8ZHeFQgpmdn?di*)u
zMSW}aRt;fgt{i_q^k}Nw${VH=8`-jV+ca^C?lPsm{e4o!zns%QnA_kn?$2))K|vmO
zCforsR{q}toX5{|YPZu$$h<6<sz=F08^m9z`GsAPrz)|k9oUON#1>NzI?2(r5J6D@
zbIf8mIssjREa7sG3ImHP9`rcjyW|eo)yuX@K+v5fE|WjL<?-!PY(~4TbdF=EYbbXw
z&b6*(Tbg0d$;C;|m6?TPjbX%4f98?P{J|@ur0<x{PcjAcV$d9!QWtb_8I@0a9z$?<
zw@P%Zx`-mvm=>ar#&7h_x)rkxg<G`22jcu8Ai2e~XBW*<e0>$oCEqfD^I!FbpDD=K
zX9e`l1@+)&+Eag%HPxbCQy@!cXL)e+3+OndRpuL9L(EV2fNmp9X)UBohF(e{l?DFE
z8jsubgLR0%u509mkuk85^V9a1wP75JHZ8Z;W&FEI_qFC#%IK%V6bd6PT_*x_Nao?4
z<5(IE!EHb*b&Z_70gg!gHg&W}eittF&V1)(0Y(mo{2*ov4snC)v|cmRkjM}{1Opmb
zd0jTlcI|HC{L!{5V(jP_O9%h}1b7fKhZv%u@OU_8@Q{|2?<zEVx;>qv?slTSsEr}|
zwRs=V(f?|Tnwj9-0UvaurbWe<^rK_-ly+gtk|(&YAo@cvTfud?I+vv@>gbBYw*s1_
zDLa%To4~3dWu`^dH9F#<xxbwzA+fSyovk%6y%4c=!+-gm?yW(m4UJ>9A&8)0A{5tS
zusoOJK>3JEK}}O$mVW;WdXrxk6DZD+^kJS?yQ}k~_f$C#?IsR-#kG$)ZcQj}4^p3X
zdhC1(Q!|&ZsVgU;LwjtkoOZvo(D<=3G?>VqM#?Z@KhNy@R}T%u(W4<en}PQiI}er=
z!u<L-x(~-<P>+@d;FGaK#lJnUgT*z`K@Ro&F&i-T$9PDW5vrhxkxO4t0*YH+gj_7W
z$E+E^4zUk<7GX!}H;GXhAs@S6@Uuc7qZ~*!>cy!#34hHgKU?OLurd~fD*N#NMev`<
zBPNt=;N0PES6T))4XqX@lfhMxyd|nb=XY<|rqNHQ;#l4=-h_XCTlQ2xt$z;dPOjob
z^0w4A0+n0>p$%qLduj|ealhuN;rz&!@yU=GLzd#|lxD|mS665gLB7+s8xsB%O{-*b
zXzyov*es8HU;K@0n=*OShxuprNL9h)T4Jo_Z#<(!LUpNE7m_xX57JHA*nQ@Rm@BWW
z$45nHu=)%5jF`ovj1tta30#@@KBqtcjf%*rFtHP2LTF`bm*Jw^YHL#hV-M^qjEpmn
zdH?}}Kgapo<?ILl0jy{Z-?bziM64_AtN94%hu$-uR3!vb{0G=gM@n-HA{pEm>XeBX
zQ5>c56?^!CQqmK;-0|rRf*drfd?j&@4fN9w#UD|^vyFpMf{w|q;bYXf0TBPudr03=
z#BlpoKft6g<}GW)J93X;<+uR-;$`cDGTCs;C8A6v2j-%fX#M})fKPZNv3!A6T?^{P
z&tyNhu~g3?$$?58wTm@9uM|Vf7%Yeh;0tT&1`0gK4A}23=#O-yxuaLmr`cr-KGT++
z_Tf|e=J^?V<s3;GDLBRA#^>t^=Xw7a7V?R$iYgg2F=~=IN8zs!nmzc)xWRo>lk8|h
zAG0|AetiT(kO??DI<01_OQ!C#?>=8Gi`J=Wekj3_`cY<NoP}&p?9^cb6vIX{;w#bo
zvyHUD(AJ;D<XEmjWOrM5Gnm)VrtE75r&^4la+R~FoIj{>e~<O+g5-ToFRc?OZX)cD
zews)k(15o!a(QgB%9c|4vh=&T8+a5uuq^tg*qsSZ^3IWW$)*gGOhyv$7qYZ6A?cc7
z7!JL%obK_DcrJ^tCf9{4!nGF@jRW?Z9zL>#uX-7@A@ryf{MrVqTOyTx$^5`y_AK;6
z9_5Qv^3^3jCw}7h8{ng-%;ye?jKSx9Fw;l{X45k9cI8$0OH)azxZgVK#Q2l`3q_*`
z(zR^A%l9Os)>6Jx<iW8;B0qCiwe;mr#geu9E@oozux6E(S;E@kv`12d;V7T@gVpB8
zy92#tkUU$}w%9a>eHuq#UT8=k@@D%3J1sXguu%8!B464ZGm>g-@&aK072;f$sF$%~
z{28L5(PILFh7t;H6x4{a;<=NnxC|mXOr6wN`B~))p-YW|ALgY<0yZ&H4WuHhSg};)
zx%_qd(YXk4l+~s;1r$|Y${qtF5w6k`U%gW-*f<0H4+-Xn%3ck1ul_%zZxi7yO@`;h
zAiF#(r}LcZa!@@941HInEhFyuyyD`r)TCbbY~&;xQF#z9v%L<9_D&)>_r2UsA@%Gg
z?2K`jQwRy1ZJ8a}QHMQtDZ=GZ97SVHTBc5IkY;!JCOd2zKUk!3^q|VBHo$iYc!aIk
zvRmDg4@|tb-M%SAMlSe7zKmY4es(B<$pF+9NoKh7OBG$-%?KRnP2u+CmJSk9M~Y@u
zGYBShTA(=<e4TQ5wVyFW))S#yev(rf*mCmrP1o)Ct2R(mTDMllivSCP?UP0-LWNcU
z*s?cOnrk0mhE|FTRaVpwCDVRrj)CvO-Zzc;<LEr;vq$p6T5l!V(WoEY+BAN-q)pT{
zF<bnS6IowrPNG>L%PX<02H88hFm#&(C>la{hPCsI^XP^OaAi<%lRKznI@Ow&WHn?)
z_*4u|c`b5h(+Ywh(XMZuobKIlxG5hrXs?fzjQN`M^6b6G{2M5qE0>d^=ncMG-_Qgp
zjMPl>tO2;!P1**+O5Iuq&X+U@t{}?GBXg^n`Lq_Ze_pD`U9i@c0;oj&LeKy*J%x`R
z|EhdOcJ=Mc-|*ACjl%hc$Vzj|7`gg&xXiocVH`g%6-XDxiKG(0-widlh}}Axy*H(&
ziTOq(a7^=ErgM~$p6SH?s}hawy1^dF?3ivE!YbWU{7#sVF}if1;<V$U`kY~?XP(oy
zk*qYh<vt&5vxAQ-<4r;P)G^{H@smH_KPikpK2nbAO|fTe0&d$cJhw+JO}Txy$)bbO
z%y1RO_0r(2AFj&tvV`$XW@_=hfPgG^IDQ9*JDJPqM5T)0L+Y=T)Mh5UIvItJsi>V?
zEz*jcG%Jfola;TMd|F>^cv?1}W*P4#z5I0PGtcX6Gn2lC6m~kp_125WEIUap2^B6;
zdznVy+419#93#BoL=lsoa|W+%haakl;^$$G_!?pc-(j7$%(ARqnGC(4uskoJyAU0@
zEqL7t{6fz$e89J3w_V-w`>?J284k86LFV6<on3y5cD4YI5iBF)uXhpR;F4sR@hQa=
zOzBZ~Sbj1#w55G88x)t>DHN<zi`htn`)+lg>heI9*@!33L-7#Y{pm_bm((TIVTVqZ
z;6&b^h=gW=+|GLf4NT1^9Y*WE*Fg-i1Sle0it+kxR=Ir}SjjORUKQ!s$r9>3(!U+P
z1vlSSTkjLRDex4R43N!4-#o*WWfPpP#diJre50MlpURInYx^d>{=9u6pR8%^JBa$*
zndf|!N-Be53423hmhxyurY`cjhns39!5WN32wPnKUs{7}=dZ^&-G0Uivr^we7wP-R
z`Ob}x{3<cRwbmN3TMfW*nhgzV+T_!$94!r6O$%>KuLzp2`9_V6tR5Dob{K3t!s3Ic
z^BJ)i;mYyJlN@NK;XDKL26^@rgl5C7m#>$)?cP6nb_TI|O24|Q+qTkl7=QIFRD>kf
z>8Sh)U~l(cg45GG-8;9PDgxTg%8KHfM2OzIaVQ<Rb}A6|g!{#ArqsYiXcNh;y{m;O
zkCIDMTNF2^?cMJ24>&-Xz)X#8@;VdXLatUvf{+U-y~l)D0GUpnjh(x`;w_qS3PsTP
zlMNI$*lEviG3u37qj(TOz^LY)kJkgyZnsFdmB$I`pZ%jBDROp;J7|x2>QM(;kCh=v
zm;!!HS>Y#-IGMuhl#%s8|L&wMXYM9lB?jj89xjZJ#hp&u84RfWXmNJaQ`3e+jP!lh
zO$qd;RQlj%J3{b%>I@}bmigp9??1)%@ajK|25m|v1+ykr56@N0;yM2Tuq7vi6483{
zELb8?9HUk-(V|9BgcA^<l%ubQ-3V9mUJm=Y7S#lKDK9BtPIr8J#{U=f#1FaR>ZsZ{
zQUhx);kSN^{2J^uSVXBo3HDenX<88^HM<6d@mBHjgu3SFxdafxwEv3$@<ZLHm(uL8
zk8;iwZox$;IE?BKqUKfuy=hJD!}*x)P5yp4cuEAyN*sbf#ECa>F_|bb6z*15?nzF=
z={(AC^m*IR;8N1=*PejpAlAf$_=QZNVJuec-Y!x|zXbmgcEVScLQ`3KdQvL>yBs4?
zM?t?cGskU&jiwmvJ^EwtXw3B^kN(a*V<9;j`#3s<Ya;qe^w;?M`;*ctxJyzxS1t$A
zLvWgr2?_3jEX!|4TZ}3zGO%Kx-HsBu)kHmqMHaudPLOq-)~R-jNS(7jsYj%`n1lS7
z(OKH3^5n~oCg7H<@8YN4SWxas{7dL&z2y+5MaZc>JwrOk{EB|2L|z`t$WwMWW+K6m
zCV1V+%fNZy%B^WUFLOH*t|MQlLg_ySvT|68{w4@$qj4DA$vN%_Wf|R7_j`_)LR>Eh
z6}I%;qQRa6mM2Q$Ag9|~c=MI<rn&@V9H{v?VpK%0xYCSj@*pe}%iV4MMnZeZxD_*H
z{j+IHTl!odMkMCd8VeI&k%<7-wWHD+427x7=^nfY==r3wk0Ja+B1;05pY!!^u;ihP
zl&Tb7O59;8C(f?E+J*{Avj2B%ft$;+1PZvU;yB((XAAYDgXWPxr~-a(yef<5zBLro
zD!q%}kK^#W+5oPJ?cGn+HrW{ZnE|UJ44&7L>y1bm>IRBGaet%w%)em|F-FHweBNrE
zrh%T%e$bPCt0|CM^ml!8rplt2>Tg`sp4i4j<qv$Qp<Hg!?^yMtBu$Z@LmcQFHnbUk
zC>$q`6v4L_Pwm`Ko84n#*Cv7I9>$td>wX&~OU1l<b>Z`tnc6nCPwJyxB+nX%IqPSB
zH_=g`si}nNXTslIpKVL+2dx@4?>J#*()zhFx;nJbUm5V3LUQz9Z!uR8Hlr1~>HCz~
zLFfl=4gc@%Q7bsKsLA5uj><ZOCA9A*>*p&_!OGp&%(z8^@3y3=2_=}{jM;qt7g@PO
zl}b<MMODSq2un@)gVE5@iB&gScc{cI&DK=1LXU*%t#rDlm-Q+H(Ien7;Ti*$-|cDB
zaM4`xlk6%s70QIcwSUnwre;$U*n5_xX5_cgd~f~Bd)uZ~)A8-8_@RojryKpRDE41O
z$<Vy`JjY5iZLFPW&R<h@8bcT}tCd%6TD6rZRyt*^P&A5+MceOUTl(9wnynw$dXPk&
zxOa2d3J+!IhHa5%wd4GL$E2lf^lG{dmzLH%Gn*z6{VWz~Cl=zzi)$03x#=rIOO0TD
zOIF`hZwj!t?Wzt+M7YvyMNPV|5X@te&-xu+Y*<cM2+N%DBqp6>_)x8{t!VzSX-bsw
zhH%0>ue;>#Z^@VsK6m<U=y$v}O-Uheh00T<&o?8E_7_A8G4`h0Yc*3lh$h*VDkdN(
zFEo=a$zXVW3$N;Y1RGJMSSS9hXII}u*)o3kLVOSVX`I63>h@B-dF9Vp>eZf;RV9#z
zj+9W`{gPdO`Fx{hTvb)6+K5E)!NLj=RGu%-VwtL68{XI!K;@>^IaL)c=GWx;OfT$4
zn(L2jq~czpYIW#Fk~p8PnRb5osQD+u{9`B=mquN<FaJn(#VNhDhq=|If#dD(Lf?S1
zygf7#!-&S%9CSn<q?{ZHgan}bCY(eQa8;!@$I7a~z3|3GBQezt!xoZRmJ&6wTI3uu
z7pxps%;vC<TQhb)ADi&KvbJ=W_>I>0R<&a3);dXLXy_DyClldv=ShtTW{k@WljTzt
z4ofTCQ|)g5oCfAz7{jl61SA!=f0hd~?RV%ZVXf&wjP7)sOkAu}ePi%&6TW}$&yQXr
zEleQl_)tR5LgJ~D6LT6Lz64g*(P2c%w(%y~UYGtQO*j$O^wt?nk{oA8xX7mI*yrS$
zpj)h+Ww%=%=fWW&s1_g7Ztf<>a~jpWuMi6Be)il`tQe<iNN&QJi3C>YwFiH(UU-|y
zy%8@XZzPNpCH5?56d^N=&2>aF@-$zZ6vQTQ@I(2NL1A0E)>Nc5V2_X-D{a~aEjJ$e
za`<;D_#uF4+jPic9&TjSAha2D%5i=I`qny2_oqaM{EyW#s-Ke_Q$vC|q}6IXoIZN(
z<99S8sRl>H!_Z#uT?w*51i4kJ{@bXzwjo`7G4NC$$wd881L1g|Wdh0+x2kvNb$g()
zoz$h>=vA*nZymVB(QN|CjBXN#VgVHwfmr4djM3zl%Ii7{j}&o9G~2>7MV7DxdhJ_R
zY)Q(2mihtTSLCTs341+k{}O6J$|!Rle%q^WCDVjT9~>xo^w8ut#{cYo>hPz;`H4nP
z+h>V%6sDBy)j=s7lP>}yE5=&%tQE}~ED>+!ESI45nU^NqRPQ6i<aswXY`59)zKI!$
zWFH_vSU9*#ET;U9yMmZ3GTkT<KY{v7dkh15%m!!pTNCCD@|SedJ9q!zFt>ZE$46Eh
zYI5`BId8tnv1PQ95Q!Ff)+&-3N!veDIKDooUn%?$d;KpLtQf7l(;ON@!{M|<Z%)SI
z>lXw*Zk|4Vaj1Gj5{6jLH#-`C67sN??`jY|7(1GDRi1_~<895ZkBca*iTIM>Tkj-Y
z92oJA(RKb=lSR%>Ph+hnnl^%8bkuh`uIA!Q`<&?5+0x^AkX!G~{7|^~9wC8anYMOD
zw9QRrthG>L^|?#`$nAC|WdbC#4iF*P6Z;SFBR2rCL<k&~zEwvGdWl7w!p;2XkLrbK
zS9brPOBfG&!>6+(bvra?8nfp8(NT^-FJStApB(%j(9-%zHF^B(W;HdYLQ|Sbn54$R
zWNy?QV~__meuPxR$W|01tb-~3o{Dm;jx^?ly&R8kuvZ<$LtnC?c7|`tyB1&GDd)`d
zC9$w7Z^_V2g^GnBhr?~+WSnl~;2X%Q))zIn(`u$Z&)!DM5%cFbdfR6ceBFew(efkX
z%OB+KNU(o6yO`#GsMxmc4qSp-kd;;N0&+9K=}M`3zkhj2_|;{nvC!_SZphCSzO_Tv
zD0TdRzkaL4$YAS*fv2g+BusxrC_1j;N;!2q3&n1rqi{~J8%XXGG8N4wA9Kv%_^cwb
z5w&Hq#ZcCQRcx3-e&pOOoVB0>QbWWs#e0+CxgUqE+K2?jZ1i@8;2vI;a{YbB`VjM;
zuGB05EYkL<;vw;Gu8&~0Vc98JK!E<lg99%RD<SJ3_xm{~`?e;n<vrz|dRm}Ck<5j1
zU#&NX+vil=6}+T|X7{?#GD+o}c)kEAAer$qTS~qN^jrxSKFyI_+U|rL#kfs8wR2IS
zHe5?PPx}rxKDA#D(UksS)9lv3h_?{ouA@HIAu64_%}h$Uv?5<fMgAtI&CqUph(@lR
zbZQHUssh6fJ<SEo$=0NUcON_{$K`-tqx2_g;N4AQ*{^OOUm?qnN&VZ!oVb}%XM3T%
zKlMqel}&tn=kxu}l4ElY8lL7iDMFigcPMk*#eaR`bfv@@){Bjd?wwgn9TUk@ueL|1
zP+Q2(UE~$Eq@R|StuPI;PMF7!*8aB5z>N7DN9?@p4@~cNezT?l8IX#tw%7Ju{a)ui
z-g<5krHvfQvP5Sv_d%t<CMsLiS<rssQ{p01{dPr&$G(EMlu5KsxO$X7rmttriUb4w
zp{|CK@igYf`!mXur=<S-)JB`hR5$Kj%@{tE4t^=zQmF;}tBw7%?Xncc`@Y^PNt`AA
zOYoQ0$TOt3DfO={mds^~=mSTyN|j_}o=8@ZR<l)^H6_OzfrX!Jl{%r^+6jV5aDseg
zr<HDH;&)q7PS#k)d&f$|`m?N}V==4eNlN|yh9x+p-JdxUSn5^yJB>zHG(zn|ZA6C<
znUd%VLK`6)nunO(9d{bROy28CD%v6RR32K?sh_b$AwMs!OBE0!MDrt(?J}B-tLWLH
zti*>zTuoR6gA|vbFz{GYuv@NUCTvbC?#eV63rHcI|0|E(1?@k8y!1(X=^K(a*wP0k
zT0<PzDSiOwUW(8E_M0NML56iHod6MePbpuqbQ`$P>Wa2$-?_)bnm!cn{I4OdW5&HC
zS<|j_SNt>@)16AIZ1f1Or}h^kDhV?MZ$WYxWjAo_pOM>DjN()rpbu4SnwFi(xaQsQ
zNpXnOD1UijSK?93H@8vrPw{W+QW+10_em1uq>p<{lK-%cR8=lzUodgjK=Pwi+=_(Q
zziIAMv<|J97(0Tw=5@8h#1b(Dc6h#s>so}H$AJ@dc7yB-@O?^7UCCmb!_kY8nJP)k
z=B%4&`$2s(r@%^myROIxK-KM?^9Ag0Oc@PS|E_A}549*xXK$Xjs3>x%KxbzPx-a`!
zThawVM_p;JHy-xHlKSA~7Y&hwhr6`1z1NHgsu}T)_M7dUEDl6~|G+3=R$%1No{$zO
z>Y_0LD`xv@@P@G7SFG~9en*LyWTo9eR2?>4(~&!FRmQNj`VV%OE_uk~!|m%-Bs99m
zj}d#+A=mirI96+U>_?h|Vig&(RyYu#{gFC!G4~Jrl7vn$utid;Qwjj!LN;jB+8`x|
z#}V;GE7;+SCIKlhv+9I>qe=pKom1v?gbtvUvgDQ(jxZizH)k*0hmlvT4QoaZ6oCD4
zCs!mHKcmQC5TC$`u?*WFU~V(CN-V-Z=eol*sB+$iA4FDDra@S0YPZuvUv5m1{*kbh
z5$>qn$0C#wMV{CWNjl`0pwWflCE?;=Rdsfs7Rx2_Vt_pT3E6f_px<WnL1$?DEM87N
z1!bY~qcnlxeQO?&*<kq>g?R1uG+!v!Dw2kJi@%0?kJw2Q3o1$xd*@abOxd76QfRAO
zJ@4bdnYKmKm4x@2j?$vU`{gvv>o<iAJ9ZfITG69k|4M`%>gFM%e7^P#2P+SHg>h!;
zL^5NQ9pKNL;M^%Cs`g@!M}S50k5W5h4X`|k0BOWw_S=`7&V07=-Rs&N27>p4I*gXH
z#HbZh!L2H68b+-PpCXoZpv0_?F*egRu=VDj%`vNQQE0**AbNk@S|r2&0|XpHSj?db
zzRmw*BpKV!bf+^JnTe54S#C1D!SzgzadH=%T`N9j-*uDl(y-&N*2*M6rdOo>Iy;}j
zmzuz@i5?NpBblF7F|tNdq=ZfjB$ePN`Dzc*CyVYI2i{a}OVM<mO;s`i#^d&J*ludi
zn&_S4U-Ya|PIcBMU1lJ;BP3N4uRzzutiG=A*~iwX*;$V+)Xd4Q=V6q1<+fpW)o6v$
zeo{HLc2J$t#?RCmCM%Q$ja${<0(t4;_BmW<)}NPid*(E3ITV@L8I!~W2(!%_K!WMm
zQCm3%CLwM^XJ6<wytv)Q*tL27(qj8QO^2}PU*u5_mWCNMDM|1n#laHyv-BzFJDJ*=
zJe#dP3vc``9@wY4Y8OKO{`zIP+C;I=m7@%B8)+F}TeW5%7DoDyqshGqua^L*i9gI<
zJa*KJEid^)`QS=J{gP7D(x<j31>~f{3Jle8tqHDcGJ6@W71BU&wjsu&Q#F&Ph3KFL
z0e?$CE?NOQ%F~S6%yXv}@cEwnXQn0%ubytM0=EHL#*``&RP`XhLR-B2U0QuR%g|9h
z&(}J*Su)~?;V}Mxal~-X)KcL_FR+HX0cuwgpB%(164!<IB9>*H=?}@{C-CAzjFU#$
z{B;}TLEh1gd3m&~^(i(re@2^HoA`2k1`bFjCdmi!Bd}kLHAN|~4R($`qS~NTrF~Om
z-#iF$ip#2!#M`?VW#~DZfGIlT<v9scV;ep$hkxI+s4?Dg{#i^iQiQFLur|VK1~A~N
zq8cQ)q0C8eub*EtcD&lcard|LrO-LB!m7MLF&;!sW0kpX>~3OEFSVh;o7;PY$n6R=
zNw%9&yaMyCsEuH!?8TiULzU!Ic`Xt&(rDBQ42YEx$1pk12}+s-Y=8OZ_B)Qfwou2Y
z5vUCXtY+xy!{}??PJ7@kqe*Tz%FQ-TV5x0u<~Z}?_k7@sr>@X&$?5QJSEJdSqQo2v
zMWjR^R)gZ+)(}2VNyFb_OqA_E*S)*1%EO}s?aSheAK+0KCGnp#j?_ET&VTOHt+1)r
zXvCYzQk+!$2Po@!FJCa$oe0)-9dfBVXm4+S$M=<lUa}kv{{eBKq8S(sl*aP@H_7T!
zT{C<=u%J2(tXyr(?LSWNmOf1LOiu!?D1Xgrb<Qm{o44~&UlSr+z{KgUO@6qkg^R*?
zFVSEaR;8d*Pjk+P{YpBzm$@LHD(#5{d2X@Tukm11k@Sv|45Inlu3S~O0xNRQ>&n0q
zEm!_c$NezLVIm@}Vbu5GGgvMziwD=8GXhUXyAq)Nr7mM4Z~W$-49RacKT5eU<iZ)C
zwn$Ck6f>{<<JP>gYyGZZ+WmuuA2S_WYvSS<nM{r*9{&NlBtz{TS-Eo@z7RP<KO1XX
zgtAbUoy9-{JFoL+^6hO%M3MD?zM}ax1}tx7|F~%SGfxY-_<Gpyh?|J#vguiD@43$M
z4`=xm4`D|=?C5Q1lNlf5eBQ^Q;eA@lNHP<A0jEbxPrjde(9Ie-@I5nm#9V-5Ps{Ob
zs%HrdAcv5B^;V*z)1e=mSsi&LEOd1w7^LisxL&ob64RDTm={#NS}f63#0*ysJ6hCt
zwtyBRe+X{y_Ec%Seq`0Y*vPoUyN%r=oxOpb$Os0bjc$qRn>!+&cnjmSqpA*s_U$=)
z9f6-31L8+l0uDJG7MOqU(<xdH{@mj<m2jXtjpPZ>6O8(2QD253Y8c`Cmv~I*<v&2F
zU2J$e$0=GgKcTMhKDNmHBBoZ`Cg46k@xX+*Wx)Q_o|@KaF0QdlgHz7O1<y-eH;sz<
z;kjdpu_-}d0c59n2pX5nRipB2i-E6<<-|A_86(aG@O61xtK<+KrAN#aHqH#y!<g1q
zuoC5GbrBrOXI`bdZ>{JbL@qqzg$c)9>grI}RaQs*!JbwB0S*f9LJyg!0?Bk%O%*!A
zqy7W92L3C?nyCnC`8OApO-1g4{3;A%aiwss;4r=vI6773r$f)dmA>Ey&UBgc8E6FN
zopx^))ewdbaIF7Dp6w^Teuf}mP7wh60uxEeC`P7gQ@t-a$HRiMQcvi7F<<@YhRXKm
z>5ZXE<?D}=>zij`@Ysh}mP>_oA+7q8Amk5k)KLy&$K#t-oQW{6uCM+B45Lh=!SUVE
z;+pdIJS8Y1V@wzSc+<9o$Ml6^D<FcR-UM{W<RRQW9?WSZ0~|r)Ck{3S9MzN(e0;{d
zusUPC$MUV>PCklIq)NJUx8llD;y2YB$rRcqTzy)t_R)<AF&T?9tG7FY-g-AfE2p^k
zG$zmg0lF9M^&YHw1czxCzqn3hD{gU=?DA9g$mZ~o;sCm`pm`TJ75cjIjwdXsio@He
zx+ebtPP506<!rfHOErV-Ylqy?+=ySer+|-31{sZ2f)ZW2=4U;qc=3xjmavD9`}j1z
z{x)n}XcMnqk52W1u88a~Uff<OIO0>&eYH)hdhdS#YXnp_DXe5r>%Nl9aiSZ8lJqM{
zfb>Yaw3&ONuk#>cZ^}<w;xW8q;Lxd>4~h|1el+Z!kC9iNO4q_^-73)eL5r=N%qtG>
zUv(#%t|N1<;>Emc@XDJIE@ZMG)|L_TV#aov+Hs0e)aJuzDg}u4D8`td&XS=MqrSZS
zOw9_R9*fsZtrCeicm;QtviS{=o=fy74=m2nBgdcuHjaM~vblg*WXRHZ@Q78V`$l*W
zU~#|Rm`0=|NO}CLTpQxx5ETG135<&AqcO>)D)DCRDgX5z8ULi*?h4Fm@B`4P$1(SW
zidxIZuSE;dhWilVud}#5Iq@Ew=tv_umXv(ng@1CmbD?Bte%lb_NQS8Ecv0W>*1IK<
zoLmw4HxNUtG-7bBbo7$tq<3ZdQKj%7Y|q#(iO`-cKWY-6NHgonA4zCpAAnlBxR%=b
zo9y=mQcL7fQES66K`TtxR;WwohhQJ@>8hH=xpXf`j}`JpXcu!{Xum2a<y60YF@{Wu
zpAd`5miwpF(c{vjV$V*be9f&d@jlVz2gEJu6(>J_5a0NkyzsdSBYGUGanzL{z#J)t
z1q9_m(Wt%QZ>2sE_ymzv#Q1f!)jB&C^JlB*Qqn#Pmv3FFpj7|~Rr&$FgH6X|((WzZ
zNt$*QrsLP?5D0aug0m7NV{+^c0U<;VAnM9*Ox~|8{1Ja?`9?Hve39)lJ(bKsEHsl8
z0CnG$_cR-~8a%tV`C(z>OxbNX6SV>q0!p;MseBUdxB5kaz1@%A9K)|hLroF6>srT2
z!>ZSG^nL8~tO@3TIorE|5I$8v{^us6{Xg>s0xcOlIRedZ|DOx`15b`;vt+y7>g#*q
zY8hLB!o~hx)qeZid9s5uy(ch4x2x+Qd+_c-l<F}66Z)mzK{4mBoyei|>tCz>M9A*S
z_SBPxm9x-px0o6khgC;NBs$Xgj3AJTMvuLI*M}F#t3&{LHpE1o?}>QY(6DpyQ(M&d
z9CI~vd8_^olq4^(5peBTqn8A_mCobw>h@nmEp^bzq{8MdnoAHiGZjl<XK%~vj9-$V
zb)roZE{CKs{ym8!ToievJcW)UdZ?U5Das5fQbGcPE=}7z()^$_QS}rJl+p)Z4`!O4
zh)B*|2snbI4)mO@iejVPN#Z06etEY3P#f*%Y{uPD06%kXN=kgpb-?1NtyWLhE~(?r
zM=xDvYaJ%#OY$J`EFT5G4>up2h`=(^bJi)bvaCteW<Sc<a%ZPA&_=}Z*VYxp&+<1W
zN|KrtJMY|-8-Pv=F~~NS_cW{_*sl=ss-bY1UrMx_EaHyE7@li}!E7z=g5*-}r0x5F
zURm}(7be!?nV$9Jp+P~FU{S+2`}k^lKiQA%IS#o;+C}6fTMfKwnx%8jFeAT|QkE_{
z!?ikU*nGWgmFDiT5cN1}&2)?j#!&+)$ptxKka_aA9nti3w!)y~N#Io0nO^eoR70__
zu&DKCZ)@(hL@wizDfQ<F*3z;SS~V<FP~w@9Xidl4_6@dwJG0h>Zf75SS}~QcID~`0
zI1oN;ew^SEg%O;w*04W!k!tf_m?D&cx!nv9i?;&mf+wG_7{t1jQSiv$1*#j!I;U+5
zuhE{vQ_+pr$7$$y$4MW~z+8s4qzBRbX=A88U-iud64dZnw6T9JX6=HO{sYMI{yvn+
z`3%{lA@9($sH}_r`GK6=xYa64QwV~T>6HWbrv`WYC4#^8%(Mi(VbE#Og8t*PYiuyz
zw@?ALEtl|Uq8!Dac2E+;@4mk{L=m4(`o!kd25nh2>K@<N?9TGhw`v%>c<`G)_Y0ak
zSVWD@u-*aAz%tU6AR^L-sGOzB7_l3|1Rwf~Pe?oTd0ocKVen_UwxnNfJJ*^~wtgkr
zwYqjekmO)jF1+m_g7|OIi1!A+B}2>Z*A}L(8R6uWgRy1nOCMe_qcD4+v3<vKv4L-$
zMWMK(NFdN@#Vg@oj|9$ElJ>C7{{A=Z7si`^9VWtkn3W`R?MCKh*1{+56Cw}Pvu<qS
zWj8GMX!UeAsI2di_LP;-r*Pn&GKUtxpqncePX&-#>0;&esWJ_fIknLu$`xy{J~!yX
ziXrtY{lT+#@H$57l0D6=u9a!KFroTq96r0|GSI)DgVz^qm-v+vX*#d-aw4MH?Y$UK
zg)q!T9IvDRKeEo0i)%FfSlPUDmG_Cta4fBhJH3hBvC;<e_g72o_rp83lOXOX_g3GX
zBMAQkq`bkBU+NTmj}@<LV=ZJZP5G{X*)R5FTdLAIYJ2_Rx4yT(R@FqYoVRVc0?%;e
z1hmgL*dd2@viT~p<qLJE7|VC<WKVC$_59U9q4~SZOKq~;&;;w<4u4uft&Nc(Hd*$t
znQRn#{oD?kjpa(|%G9ziF|t($^WP7h>SX@|sC_t=^vcA+`VS!XK7>sQ2)e5LI7@Cc
z==eU!4(oV1+qDb?g+CzvS}_tTPmJAjOA2`TDO>A-uB^>`Ov&4Gv@eE;hQF_j3%9^;
z&@B07y;~5{1>@v#*Xng=SeN?omY!*))GHh8)m$B<t;P{g>Q_s|*zrR)Y)`B9FkGpm
zrGL<7(uys8mcC&jUg(m4Yy`*|M!lSk_eSofbWd$)@CA`z1`OyeUU$Nx=S4OD7Ii~Q
zbc#C$GRBw=!6nzDd{YpwuWfa?I(fpjU|@sd(?&ja>b$?u!OA>>0k(%E>#LG&DYl<F
z>)haw9X4o(0^J!yen$>Z3!L}=!J{mR9(3LW?XA$2n0?Yww&IDnlRqXK4Of>X@Yz*U
zw`NKrf!th{ER=kOa?Hr9sh5UEj00x}Qis+|;96*m!k_r}eGIQR<?rySjZbEZ6TwXm
zbGHSmS)&}*5SMcg1wTy#AY2O|?{HC<U>GR8k#3r}X77&Nj7HrxK%Wv+Vd;&NYu!X7
z%%}Lcqvv~BiE4<5>R$RiuBg;{YA!AeYwtcfnmFH}*%pjSq^@D7f&J%W-z)1Gt7M$U
zMQJaEgLiOb;Yv#T(KjROYVI>?Z1bP0CpE3zf~(=}dJJhQk$Sf5RZfVTlKrqz&ji$Y
zg&i^Tj&!?;KI6l$#uGqTOb;i%b>~EdR)Y0mh}4p!juJtB?VcTGOxqwsrt@I}?JcyP
z<l*z;L2^oTf*d>%P_arGv7-r&#Ms68t3JdGutxvckXvNjm1g!FG6Fc{{c)+j;6{{#
z-zxuR;U2ejtLKb+>)2bL{C!ACu0pyP=8Jv$%34RquKJKPF4sVQ+@JiU7kkI`%}qMF
za69B!!A(?;&&rY_6TA4>h)6<x3&^<G-lR3){ELpX04YO7dXw`;rLebX06V$7pLl-S
z@qd6D;=~a5F%Rn5ncl>(Kw-h=-k<%B@1trgApQq>gEXk-y>`?b-pQYTqQP6GdUC)7
zm~T)`du6Zd5Z#&BF9;%<2|gNaDvx}#%W}y*I>ixSm-&y1km7IO<l9spAKYKP0l^bb
zAEYT9!h|#d<KvZDayHcniNpWjtN(v~L3q8r`XsbHe<9cs;S&QFy~s7t-p1Ph0)8Z8
zElA7$HtlXdL>x8wN`0wer>fsZoW@bhmywyRS8WIEio4#SD@jit$>{vn2ih>osg!J}
zv)ZMQ*oiTiwDZc^O)|eve1jvyI?_`Ezw4bv^YiFu7@%ZF?gyfZjbH5Wmn&(x8F?G?
zL8klQv<;-NHlp|D<9P2CX0=^Dr^<8?gw8PBIj-=$95|0%|AWQ4^Em+9K1ux*^|ad4
zAN&iuHc@^@pYpF3ZIPUsOX0Sr(=k2?ibTmOFu>C-Wh{zJ%7%6vKW%J0{4}OeDr3z<
z!eNdSD=fWDo{t^qT>{;{&~|HD7hT&Ywx1o?@wPqrb9BDWrz+B0xOqcyQY1sOI9s_d
zi6<V^!z!~ofK82ES@OnqkjqTU&p%(JAe}RqBLi-Uc5anf>zY?(7lWqmBJgIJdf(p|
z!f(H(8qZVII%MU2Ma5@S;=!w$Tu*O4+rhsPWv4e!|0%!H<~|tN_?vICVf1gMQ`M2X
zS|44<Q;K_X)N`K><1e#Q-@otcRuJp;)JM}M=Onf7kUr>e(&drDWzj))pvIh|(;ihS
z?3nM}M4yU-5(1sJe+)Pn5x4R>LICIF4pLpsEvbfwi+yJV-c<s3BFYLhC}M=JTn^2x
z?(3=($*`NZ*p{JcXN0Xh3Fx+vp($$viW&9S=hUuBoA$4a{hwAb|6Jsw$9xn+Z-=Du
za839hmfCr*mfKP*CH>0BLD#pn?qoi&0_~+OVt=TD&T<VJt7RskB>6u+Fv5(?z8vqL
zm7J1ay?*bje1~T;5H$q<NKT!r+tI|0YfveUo|09y)}=nnRzm|O)crT|B@3Iu05Y%B
zGm}Qaxz$BgoUB*g=11+mB^Gs{)7Ej8nmQ+DZXMb&ERWHIe(MPYp^kdAu>5iBsYW$X
z2=0hExD~0$#<1{h{du>RyU~7$X#DaqxWc>;(2Z|)j!{-k2Pn9`8NV~};Hx+Y^j#ud
zz1A69iilwy;(Rywvd<TBH*Ff>GfnC(G_<otx>D(S6rO5W;Ae~}@H@z1((QTu_Hrg%
zY8<QKUunsocibj#eqQZlEpmJwl}?blq#UrjF2=8;#wn(qH#?K45fAw6tzsNq40*Q!
zgqD?N2Tq;OX(TwfA=J-3EsL1LQ%+rJGppCt4|v|V*ag_rlSd|Wk1W*U5L_%6NoE1f
zp_t(FlDZ-l1&Y~U8DU-QUt#SR2!9AjRt0-rqTsq>>Vg}E;vo?oX|=jDMlnn@z;3HM
zq4+$V#M*sr!fO16T6w``(bzFZRxIeNjMAeOe=czVgydAc*KEQGv~G}V@uk%5plBHm
z!RDLwI(m;P_UbU?v+Vhm&g7FB%vW;0$j>-stE0{0KLGtRgkH!QLEro}^XBx7(W+h7
z+c{6?vlL;mE-6e!WWa_bcRl|x{US^maETmT`%w~hSNa3HD;|SH31EFp^ZLD_#)Zmd
z+&UFUCl5l(m}vtQItPJCYRLmQ{J|(`Ax$kp>zq!1>WU!yF&Bf5<iI-L(MY2|A{(Kq
z(;G7%WG|Ik#gWBpg`CqMvZhmFt&jRBh8;=}C3c-GBd(F3=IS3OCfcEfxW)?I{+MeA
z$7+lnReJmOR~NOr5wW(7FxW@Y5Z^yztVEBN2`Ul$VZh}|8ImeR#EK|Vt8&YPeh|4R
zhe-VLVWFTE3XhWFLQxV6cO%cPx=HR7DlRtf5YF~|#b++;DhZnjR|3s^vmH57oc1}T
z#;A)}tL3J#QCt+ZEp}#A2?jysF&%ObHm(2doXV;1d|sK-ZnyKU8aO0*$sK@??iV|A
ze%gRlxR2QZPnF4SaJE3Y=FZ@FxK5`{f}7`S!NzjRuwnE$u27S~)))G=X+-6f5EFdg
zLB~w>9ET4`Qi89+YclP#2F^dhwoc&2J{D|HBeUH?up{4Im)H&FUNqr7;12SAC;Nse
zYZ2;-5ql-k8gv%>Csp?x!Lhd5<>!AY9h5oM+zp!$4^Iv2_MWbYWfB#oNvoWPh1zz=
zLCIG3z?6HgR=n&9Gcm2sE?@0?;j_143*Pe0pkHkb2IOsW5c1#bJEIBUSo#t9QX6p|
zZVeY&aG#c83+2~YFwd6UhgI1eTX%Z|K~|)sD{7DFrp_C)+}j4v+wc8dM*;JN>fgU8
zD9_xjxZdn4ec6hmuGmiZ<@133Ugq-E6V<i^ur>_8b?=#N`r8YqGq8^J)kfO)54$em
z)%yvbH(rmX>xtj2HKK4nPHCvNH&1(io7@;SmfW_S+81sFi|e<;Sgm;Li#ZY3?`w(T
zerhyr<HT-h9~V9qnAC?X^l!U*!~OGM*eK@vcRv-@IipWc4RV`i$OxExpZKWk%#q#T
zl#o@+7yyU66_t|D9m=-(Ao-am{G*(WFKos(8Yy*LwtS8vG1YQ*V0$)3&fcRxA=Up4
z<)RfRV0oyC$*y){r@?TeDS<(F)x!6No`2cIRAum6LnNv-Dopoo+IjHEizLmnzzV@}
z-)tN!|61PNo;RZh?>C(7Qi+~_ajlVm#PX0EER47Qj%%h_lKdiAWB=j350N929Rc3C
zNXq0x*_*@X)TBWMd8SWWVj63r-!7<VNB!b_TD4HpY()00w&I*C@&P~`lieS38zUDR
zauf+5FR5xcf+%%y6AsXy{tpn@inkU>ZaX$H?VTM7UL$ppU1Zh_>aVM)KHeWW^)S5A
zA*FT>MdTd9_5Lqb3IFdjA^h-lJ<#z>zu#J8n{T)=dU(-5tJL`0_&c%Tp!k=?P4xpB
zrTupI+a^WzV4fh}2iqQ|^}km6>nOxrmrCrVQe05LPk_WXs*dTP6_Q(~2)7wb@-X+R
zK>JNRu{L~S{D%<UIM;egM|rf>Ipn6_M8o{5v|lqkg~@Ryw}M26rrqfjZtE)cM|iV}
zS)=;d8!l={IBNZ5NSx2L&uB%gfk=sF-s)&2ij!N0vh0)4HIH|I+z821GtQqjDuZ;v
z2i9rCg6+ay5N+ewou<f0pY^~JSWeKTk-#Pw`|yvRDE4uef9@fa8fqhpv3acCrB;D0
zVNSo}1rUQJn9m9lC%hdhmoGhoHa0s`)ZXi;45ScJcR^VT0bCyDlRqu}JK><R(;t}F
z>ug7L^5EOwr8?#21{g~7OcVnT^fX-AhoGhN@5rqc(;2#X1co7sP|e_9$ce&u1^u4M
zx#3)IKUGT<wy!T^s`o0ebsPmXGPe;65_1N7yEEAiYAbZuQVIPAUobb^Lf?}xnalt3
zpU;jexr;~csSg1e1!@YIc#xDEUMzU^<XoZgwaN;tN|2mhm)rbvNPv;qwOhFeQu1#|
z(q0^PP+lv!lS|_<$EVPHkKWC<upg?FI2v{p<cuiIq`(yum|A+IY37kuTl*Gj2UOn7
zqBE0@gSn(D`&u7hUf0UE5()s4jYyug4Yudc6CK}1-DtmCbtBa<wMpUG+N3lcN+0%m
zXA9yhQ8BO6x!^i*CLEI<$U1bl(kLFY+39;XRC<ohnRdEROnmwX0_+WEP>i%*>U71t
zJ9wg7eP$E!Cp(!)8Qq{~OGKN$m)!oB`X8XOh2=kh2Zxzu*PyKdndTU}{iL%>Wha!F
zNBDy(QG&_nvm&+V*IzmXxz-<j+r<|ygpc>_dHXJuN;|wH_#SGK_e}>r?AZe8vUESh
zy1G5ioi$n|U+}H8W-*r*q&0-6#EN&II-Q5xQ9*{&cHe&SF|XbtPr5E2rr=f8ROdTF
z>Ko%TkzN%-x=F<4HWly~i~+C9XGIN%jAbWc5X4h~Qg%OKlnxdXx{t-Qxq4E72R^0l
z0Yz)wm9nvie@f}}5+~J?f68t4RKReg^?v5362~_)EVW$tG)qI^RT?#iFLUm{IPDQ@
zT`?{O?U{9-UN7l(BKR%gSHb#5vIjQJ_yOsLQ=)jJ*we{{sD{#$n!0f*uv~WX`kH|(
z`bdv$fbXOlNvCzU*qcI2Ra<aTfqRw!=uN1Bp7n03Y#H^Dg&_JVq4D+okHYdrYt1p~
z(-zhdl^h-^hO^w_;oixzA{1=hR0+C5;Co!1>A<o~)3I>fOqNpGvLV*Al}35AG&yuh
z5hHhk7Jsq{{Hq_stXEX|Yp{8NY<s1PlJ$6jWZ<kKW6GVOt7!BzB{`zVYh|TOc`&=`
zSSn3FIUC9`P=k%-le-x0zW)o+IrQlO%9gQNDR!v^bxao)#FpGsOIp*mUcABNs7fB*
zjL6T6*}ZTqz9dO`)y7%xdeuI?G&RO~Rk*KSsD9Q_3^vNOx8IoQ5Z3A<_KXYu)UlsO
zavzk4*HG&Y9)p9KP=xoAT2&K-nM<~JI8y9vy+(eJCzL-_YJ9<sF#bd<y^WMbTdpT|
z?7lM;g?n*dFS#yhWE@XalH8B>#fk<;G^ISW0)`7f8E7%z^XzxI%)3SDbB6TX4&~i^
zC4FZ2k!3Q!+O5!_M5G?lx>HI_PAKyZ#(b$f+OlSsW!B|?J09Ize5@KnlxWDHoZO(J
zJBBr7+u7I+NZuydcl?$NV*#^(GHcoU&a(*G`_Ah9T_5MWXxAetLRNL5@}G1?LOc{V
zN>%s@-n^N~Q&3=CA2lJ+XIUP{m@4vDb-$spey&o#b-|1#P1r)v?r9@I(*jDz6`%@>
zKt+HjD_)}_<Za5FUeS}JM{C~2)hIzW9(nHN;r~P0TXw}2c3rwf2<}n@DI7v@cMI+i
zq;L%oTnZ-;+=D~m5*!M5cXxMpcS0Z`r0aeA%Nb{!ar)`*AF%hAJ?_2MJ=a|G`l=!N
zCyW-^fQZh02_9C#WK0u#xe+hj@3!D?c$9Lf&(nY_tpuY$TN`viv-$_%ngs=|1|=S@
z>^wVUw2QT(x9%n6A-V%{r)n&i<~U`T&{iz6(Dy%pH!Lzf%4<@vlPLi3t0xDlE)T8u
z+qg;(HtNAu)y1tJ>rUxF!7-;FI&JJ-6n-SuTkUZxg64dRTvEIj)}bty@?feG){PiS
z%Y>5ZY!<_Dd?5Cku4&l@X#i;?L#jS4XJ+XilZSpR<MgfM@@QDb<3LK?TUpJ~^7vue
zP3iAsM0B{Et)P1onZcH_F8Q78eU32W34m~cDCZ&Aifc=S@VgMjM2*IDVN4UE_|^i^
z_XF*~eAar%28P4LQ3Q*!!Znwj9x)#{TyzKrJ}S_P12)?RkRY4KF=yecLVgav+Hm&M
zG??Mofub<$Y!?axyRfX+^%VxaV!E++%TvCfeh-e3D-#8f(9M76=Pe`C@BOYesbycG
zw^&P@cxLnV>!*YE#5dKa#*N}nc4ngCs0|CHO%wW;GiFz4fb74raEJ`l>JR-ZsgbiI
zJMi-G2E&QkYmR&(W}G!4fOE#_h<Of{b-xjfAy!<7|JI87o>6;gMsHot!2w_9ts)Q)
z`Ay(lrVJ4L=|3;y|2-7&9d4S3L_CSb0?p}X{D1n;rU0B`L`KBG`!hcLmrjkbM;KP}
zvkxP40?~|O(!meF-{@CoWMq15jvzYD=z0q19k+iZNa&sOXL^Y%a<7qFVF&Fzx1!Jr
z66S~NtRX!D7h|14hxd<M%P%=sQ-V&|l#RxB@$0`7NbY_jm&ME)5RV-0ns{HndkXCL
z>P${a>?a*^2G^%*aJb-%_jP^VT3b6DHn(vb8@7r+RjXo_#nkorU06{7gZ0e-YK|XG
zgs#SgfyY_ep@r|b+sZ4f)XBK6wROUVu?B+m(-CpM?qy$DhGpwbt-L9*mp-c11G94f
zp^<+#;cxA3!1%DfNez|wK<G+k1=J?A3sXwp5elUG<%|rc5Vaz8He+_gt^!NiljskG
zADLvBE-h^e6AmraTQqipTo313U457HJaHoW3`kfJg)yhhrEbRaRTc;gHv(y4`tScP
zZ9JP7xsWZTXh#tuZ>o7mQXP-PHWIJtT7Y#|w`7MBy%B$dZ>@w{BU$@?kYKg|mPy$(
zm7h(}GLUh1i}kUCKl|wyOARo@@F>2$b;sn-UwX!z`<4)k^0|oY$88}O4|}l;LhI@K
z>c+;7TY@)xpSX0uigIAZ#NsZyL<CpC?*g&<R{nLB?vAEO4ztagicwOSu=Dwn7!ISl
zNA1KOBX`Gv{g1D<p0_gS74az6(_HcbRU3GpVJgbH_j<BE`9tf$EzL&?vwb=6xNWEc
zvc!;F9&GuBg#f<-JwuECof=6jhTo#>g(tno36c<6=$KFA2s71_!dl{^z7x;Sh9e@2
zW6#ist{qCPcBQTn4~<`W;;%6VE{{EDe|+Sg6XZqMRFIZ*Bgjk>apnor*gKc_^}snG
zd@am`Qwbs&dP`}5gwCdTL$(OcrXEp3q2gnjwU&Ls)!crIby%cqOE)iUW-~3fA+AOB
z5PN^FngQ5|l^VrI?^+a(k8|7kj;yH2&84Lcy4!uwpLZrMHXet{xF+qMcLRgz6Ks;G
zmcM9%$67NsqB+N@4!$wN(S7ni%H|o5k_|yov0q)~_tll16UtRX+>XS#1ZfpV+V%x0
z2w`#7c#T8rKgqFhoa=m<B+fHV7$obN)>U}mLSCPz(<<i5iWYOSj<)_TG2PPx>^j-O
z5A-sq>j*|B0g`35=r4e$2B@<(LkxQ5c)k=61Jb5ddhg1BGy#r4p$H=tPO}A@2SzjW
zu?f_Etl@0cs1I*Ot+MAwEIf*MM(tBHd<HD;se+p)z}9uN2(^c&hMij<%wFIl)`?|^
zA~!@IeBG}`NVIkuQ7nfV%;Jqc1BV7#Mu-mdi9CQ8<SH$f^%WFPFLePf95&UK#u2mM
zGvd|QO#Gv|yzH^+w%_}baQ<1Q3{{;CiMrY*I|vgLhg#XCU9J(`nPQnlZ3%nLDXkok
zwwgWcFSr)bWlL`4TN1{-Ps4RsK6h){efLS`CQs(5Pv&rcnpY*cz%1;i@cKda0N+3_
z9tjt@oKt#<6b`oY596_taxvm>$c&IT_Jlx@_xwB=E=nD8H?RfJb<|4h?h<6JK*|#)
zxkCS_!MVdMq(l~=0LI556ntr&$E_>gUF7tc5Yu~s+Ari?C>J!d(4H4M+OkB)glm-a
zL~E>E8iMtm1@L)}nyS1~v50Of_&8fs0%#%U59eSUB8eO4bI3V<?oxd@bQ}tMW!ZCF
zSrbV~*iZF$5lEUr_>Df<(&7`obe0!M2L(++Vv*RAH+3>2)Py-i4tH9W%##8&&1YPB
zox*f6#^a-RX~{;8f4tgd9F)tD6?&N?jcP4I&W)nbst#u{HRR=_HPj9ben|!0oO0E4
z_Vb-p9h5#}`wQtjhZDAiY7ET`BJx3X&3mTDZCQxYc7wQoPb2=AfVn#Rq_Jk`WqcSR
z!K*)v8}a*@WKi8(@(-XHX-tPPQRd+EK<4Le#<J5SowzjIfYp+78pgRF+<aioO0Vdp
z7au!96!&a*@@_oGt$EvQshMIs#DLSL*e6n9+6r|pczhtP$jW#_f*BF1u7}VRpfFu!
z%f(VQF8!o$c*j2W3{#e@LQ#|uwNu>>x)so%dDQ$2UT87AJdQOH`j%VoYB<QfX(;mr
z*V9L3JQovDDR5wIJYi1tK7?cQvm7%^Z8Wo4AVPSyHH6m;*bqG%yQ=hPH!17PeLht-
zYUYw;I@F7JatYaB5Lj(>uP)!|8iiof4IQzO(2vBb2cXT#;&36H%cJmmpdR?DMjsZJ
zo4<(u1K_N$VUzg`ltA~GcnsKb&N)d&w|nAV7f-qdebD&pQ@^}k9lg&kU|i|TUYz1*
z@nmpJt1f!<=zX#RG&Cdt>14*49_W(drW%<F4k7IlqikG5X=y&C`B6+jeE1z0_dnS1
z`;Z?3AF=15{#V+d;f<6#VlM<=i6ELw=z!xMcp$dw!{8-QZs0rx&|W)}SRHj#Diyza
zL9F7VRD5JA8WhOxMy*M_JFF$W5Sb2#DiOw-U0sy~=?q;Rd5(IM=RUCx9QW>tC=TKL
z1B8+(f8(EHW{$j>;_h?&2N<tHm!?4kh*c`hhW{M=HaY#2;E5I2A=95?xfpPsi1TC0
z?vRcBDZF7rq1v&suz7(4<Fe)e=)Iq9Jzw|fk3xRa)A`E$>Ypu>oO1l3i8Z@LT186-
z{Ym}Qn01MDIlH&jOmcxCbV=FMP|?*zi?A(fC&07~gzxnSc0<WtM1*5#2ARpjK5Kx5
zn3%b3lS*i2;)j!MHFg_8q^WJ^uikb$rOqP)A&I;{2N$%R+wK0SOcZ|GGIu&^zZw-e
z(hWq5jt6CV$L+O3hK`7wFtzcE+7Z)fqoLcmqFqp(u+5N(TDofdi?wA$zkmf#$BeR^
zU$wi3%hvDrOT<|fXIV~5hsKCGR(}W1+kU5J-Dt@|-0OK=7=YsGO}x>IV)iiaaQ^xV
z_5D*`Xv5*f-C~KTAaL-FNp__SmS2|U7ZRAiW%)&ph$Pa}MUHQfLxD!9trfE!F~=BO
zU#US08m-z05Vkly-_>%wpa5Q))5!aiKKv~ENL1HX^`oN5xzuhv_87815BsbDd_t%t
zAG;IdNlv&d@~T4ku#GGHa#mva6DU~CkgmZmWBF0Rze7#p_p4T+eHi4uh{x+iuzLNl
zad!?5LW{$+9od)nnuQNy;Pr&-6E<2G3u9Z=y(9;30><XdzwdAV6qmE?t?fp0g#-4P
zN6Vb*>X@kQCAweVQSu3!s0<%o8yJcVtJ&m3#&sC(#C$YU;0Bq;8fsGrO+t&9Fjy&K
z>59^;X#{dxdVI#r#b@mn@|ovOaI4j|F2|8}#VoccZCIp2cEJ6pk<DT5^Or_2s^8uN
z46F9O+}Vh(GI5Ww``xCK$x%BDV>ez>Y39Keu@$!H%SRfxu7T&;ERJoAo-Zuz5>8>n
z)MH)c{fqv#P=TQDx1s54Lw#WDv$~^VH1AZj2T)~TOHO?!=VUgE<F%nJcvIdSEne0;
zLm@|E)_S0Hfs2|NH?tYmL<TxDJu3Y(?uTdePFd{a_c8<t8Nag8rNvTKeKlJeYnmlP
z$F2)|cq&>#jhCe+z?e&j5sDNz#o@yAHI!NJuF96T*DU{Few4R1b48CQz%CHYR78bc
z{kFgWF<#ZKS-oi`j1|9Fv>HzgulmUU#s&)bA<RKmJIc!>`<)rw_$J?#YTk0qf^W{S
zE23xJMWN>nR3(V9<coY-e!{k2faZtO0(|8q0el=*@JWzCiW0H$*`b_w&xpxhJ=@#?
z97mw{S|Uoa0?zwJiKX3K_qN@?^p#;?$%O=!mHCS-U6O)N<rO_Mb$}FJpQrWj+-Y8>
zz)#+Rnx)z0Mcy;=vj%~t)?yoP3I-CQ3N1_z^Adva-GaNA!~NVkXFDWHHxswR8h_%U
zra5=Exoa;+7?#cr8u`Li-~`zH#CzvHUX>cjXdU8R7ooc%9c_0N`@81)lx1>mqx{yW
zdW*lwgAcU3s&gOA9(b5$1}x)c`L$LK7R$*bAk;S4)Do%UjjTl(zjxZ19%EO~qX@k)
z5e}FJAIhEHtn|r6R|sVo!+!E|OUL?l?Td+oXB4nou2Brssu7hQJG#$=JXDgHh4qcd
z(b>^2w8w8dt6LI&O5ZweZbSa|W@0l|H{&<*Ub9l4_^E?FnHDMVj$cg7U1K<0ZY6Vk
z&b-N3Dk1&}hg}GK`OqN?j^$xSzXZvPW$MUE(SJ?2)090u;A0~qOM3BL{BUKd6q-E(
zT{u7?A$ce>xy8sFMB~O+Sj+(zr+92|aq{C1B;6}Hd;5<M&y~XYr=;DVYR}?-fwf#H
z2N{Woq++zxK~DAA1)i@&&Y$utR&LH$i(*ed$>4K9ST+|0M7gIAGd9}VceBJ0$cq{@
z)KG_73Fw+NJAMCd{#`sLYDv%h`{UA(3TaqlP;uvU+jZpI{8K7nTXs5KE8Fwt%%xtL
z*Q}lP_!*odUP=yYr}$C;5h^X*BM?*mxaz2@BD!sEM;FQB&1UZGhBW2*yj<WP=Bs+Q
zzLsuZ?U?i~uw8)m5K7u*fcX5h9M_;JGBc1MUuO#@O(owS(K+oxykJ1tc{lF=MuC1O
zPR@q*SXCBHeO|m%iY0&>1NsZxIKkpPeSgrE6ZHYc1g~KK+hy#(AK7PWgPM}a_rA5j
zGs+KPC)*cc+GDq2hzoPhJT<j(>!AxAuvP#hH1QmZGtKVh^xg`yAwmZHC+J%C7%7UI
z!^EzHLeJ!1ZpS)R;a|vyf>`{lM9TrG@29B<(@a_NYUQd4u)ZBbuX)hV4^A8wa6>*E
z;3(~lS*DA_cb&K|**4A$H?ZCiAx|Mu3zv$@Uf|d=89|y?dc%nzqLvOL(io;BXvvUy
z&w~y?Oy72zYvis0ElefE_|$?_k(%GHzHy@<>dx=9tnx!}LKL@jtk{EZI?f!M?Lj{6
zb?w|5Y!syJEub2Ck$RBfKtFOr1bHXWdnrZ%Jtmq_Y_vLie2UJ5@??;j9)`ys!J(Mt
zq4&hp)_f?UjU+hut{QEL0<@uf%{K1=6^=R`D1oK2b3%w5q`&vl2dWub!9Ii|o<ixe
zk_pp1je;BZJQu&B3Wn)=hNQQ}S-CZwkHjV|EF~qFXLgP%*NrA^{{g<Zlw?rImTSS3
zsm+H6U<Iy*6fVy$%Go)37D<~FtGqz;p6KV7Q$?;G?BWLezi%Rn;~F9Yvzs+P<@C3%
zuZi2?h_+Uu9~z;?XGFPxCgn-v=(8cnBvGK9>tnF~Y6w#wSNW(ahbXfI8KoP4LP>|D
z9pvh?f=y|_k2)tGI)<(&@o5?N+`wtFEi}%_leHo*IlDD@sqv_}v9n2!HD1o8U(d*Z
z68b4)WSk^r;~a6%q(f9jQ=u?s5xN3A>}FD0)sJ%Q?V8qJZ#bPV6}RM<mHlugL56FM
z0%{txH8Ae?&}ok47K&-a47)2al5_BSBSUI1QXqg91Kx;=cMebSXt+bcY7$?Yv}?5p
zkzS$tw#Q!xI{rEn9K4|tPeE@so9RCXo5YY}mVTmF<r1V+WGP+ZDqYhL%h93MaRigP
z^jX-yL8+9K&!G*|5cy5ISGh8}`j~Qcuf&A)u?#3On{lK-2p$7P)u5|pBu6hAlqW!(
zKsIl!3DVWK{JCs!+a-U;A5fSN6|hayH{)G=#!TCb*?v=LhY+z%n=P*tM_S?o!OTvN
z^PD1%4a&45Yf7j4Y=#v+C;Njr@2qe`^dc2exaXvL?NO5(twa|<vY^%Emz>0+JY4_H
zCK1t`<bF_6p%Uv{%5E(g<5nR$=?>O(zyzFrFJ9?M;bD{$Eu-cl+_UnVxovr<jo2%y
z+0x1K%0cv~PSp*T<*=`3!=&7{Kb5G;J(Y3R(V!tiVCfO7uYE%oWdZFQ=y*|KJ9?Vv
zjH$WUA(u0`9)jB0upWHJ54#u#OwN2=idjaFB1sf*qWxyrkBN8ONCGXAXCPcIisLSC
zzSCn0lm(Q1Zro|9-L-!*6RBtsN;W?QlQ?=MdDN^BO5Hp{cJTJTs;30%<c5udyfz&7
zn@V=d_Q`GH4JC-Gmhe6})O-aG?(koC1PO%y+3;H}`v*uiFkrWF^(NcTg8Y1jizlee
z4aq=<cyT!FbF*Yn=ba&I7c*B^^!DUiXK$22F8_PV7MLf7WA#6P8ne(pK&!X!??o%e
zpp-MuB|Z|4Q4B{x%R6nWur<6=!!TKU>?_oJSP9@lf`TS5PcM*`&ZTTFRJ#c#6a-q*
z&Cf)*?tW2`6gYtP$wpszGeu`)Fh(Bg30EL!;7Az>(dF4ZhLJf|-jsjA^?+5}w}@sG
zW1~cl68~Nl&ivAtRTvvby&08tt!+<dCyz909-jfpt_3&x9QLNi2J|xs?`VA2Wrdy4
z@?4sW?m41xX;w;p47*Z?N`;sVEIN|O?_&)JWCa|%N06^PQ8G#3X1ce<^IOD3m>WG#
zbD!B}4=$v#!=w_j!vu94^PR(DsYa20HFGcjST%mLAG^s{j3@m)p0f@+Q}atl<F2A<
zjgcpD|J1&JYN(YAL}<t?G!0phTK1^n(o28+G&kbS)bPdS{g(ObHG<K*Rl<8AzXyko
z5*>0<AwQ${^Fh;o-#uLgVi}Hx>EnLfR~kHBKIvdxRDL1K3)3ZBr2U!|<z&Wl6@AY|
zgL$SkVEfh7Rh;R$iX*m}B=MOIO|UPB^X|2Aev<?#j}8KF7;0T(kMF5>>eEu_YUy$;
z=Exk%UFL)2;T3q8sA=PFzoUP|?<oCM3ixu)+mg67PK?9gT||2m+g&6VP(d^URuq=x
zJuWlhrtX`QBr&2jiCp<Go$YjMQxJ>SZ{OmR&uwm)kVF?Payva&-i@5mBLzRnmZAmg
z=IUU?On<mqGAdrvp%7r@;EmMm^iBL-YWU4}AIp|Sp&0eJhyzCv&R9R-Z>}w*rpBmE
zG)DZl8XGsr{MBgx0LW=^c2x|KVCj+BcmmV3#o7aYjE8C;m^(Wg74S>3l~PD6+#jtC
zPWb;cNB?IYD)1hG;rhxrYj$(TR5|qfC(^FQJwweXh_NVy{V(DDDCO!%omf!joggi_
z$EoqP3DV_seTQolM8NUM#E&o-ha?`ehAtX$x=6n`o@3>@ty6|0W`GRis^j*`Nq>&n
zuEnA9+j2W0-pLdWm*V~5^7~TNvH4yny!E%q3`c5};C+o-Y_fsRagl2s+&diHGKHsi
zFDJ|8(W`aYnV;56=j;@!YykWjmkOAd(xzsvPDf%GAN#Mgi}&}wP$Aur+wfz)@2IDC
z!2kt`#K=W)BL}?kOn{%owgz-Ycb6Y^cVa+3{5?7PwCDVi$XGjj!#?(fs|?d7J7@Z_
zLVGfd8p^r&(a&6?Zf-FTr=x#u(sE=u4Qdsz$+WYAP^3PEzEPnyT#uwTYKZ5j(6VxA
zOk1<b58{{eiBY*b&YgERgDX<CBgXHk@Tkd1KkKgvaH2Jgd1`FL{xqtx2N8N%MPmmG
zQ0kY$?}ej?;#MSmiQZqmG(R6i4zf6~rx2x_dSt$E{an;<sn1#WCTO1>+IcyzQJ_<$
zi+muM?pbzVyK<P9Pii!lF)7VAh<M+kyVqo$sbD2|^$ZZ}R&;P-1`UJw%kooIB;ZLr
z)CTQM+(Y$p_;$jrvg@Z&r73r`C_3o<34|wyDGXQ`rvjU*J8(jirB%>j(3mh<+{|qJ
z=-9&SpdP!E<OMrrvy`9tS*eI8zG3=LIfCGTPrk-hPgUDD18q&eBAguo<EYDDp1l@Z
zO%rLi$md7HX%(1ygNF`5?x48RA2kN_guFk5<OKo*A7-9>{TuJUWrhtUk_ikOE}mRd
z)^JX~vx^HjeoLvp<QcZRyp>d!<;%^$@?Wtp`j4}VjWwj1N$l{wg5JAQdth1_6XQO&
zhKPs@e1-MpATep8&AoQTfyQ-Ep%L|-N-yt4Y5u9GZ=FyWZ)V{}y^$8kkRvot<cO~c
z>4*k@-p}1&Ad3arZ}7IUq|H@uXFbK7<=4~f*0T5sY<!JMXp}^g)Daa7K4Vl&G8lys
zedtg5L#hD+t_Z}?Rg6s>@jcAE%+uF72g$@V@KcRX&kvP()DD1n&?h{M3{wx6DmQNp
zO0=|PKl2N2pXzCDk!2>7DdL2u9@&6y^JD!eQJr%#HZDuW(1iekl$?f90@1r)QtKj)
z*-Nx@p#p<6t|Z3M?NOB+OxOUb2T>;O#B(#tnDq^z;MzZgv9lyovZd2Bve+Lw+Qq*F
zNe-Lx9|&m_*Z{{`u7hg`M=Qt1?nEq@b`CC+cGVN*N98cG$>`#~obG6vQ+tK5&-PM^
zXyr$KyECUfjZw`Pv5Ta0sZgx|CjkPO29`93gcXdrENIcwM~e|ukKuqCdwu*jTB%%9
z2LakFrXS!Ygv6=AkMWTQCsD!$&#=cAp*v61rYk-M7M{4WDnorW>;9%V2}gtA+#*E;
zl8S4alp~vh0lv-)vB-M}bL2<xA080&t6v|C+(|IK&_UX!M<f*0o#PX~F#3Wjir>H&
zp!zWl+>5@!e+FG#Y?Pc0PJIe~0xBuwOj+ho@v=d3mBEo-%ecwcd<h3k)6Yn&WE~i1
zKPm6fW^5DpHmIIz2C}>zR6>e_#25&aXl($QuSQ=w2kv}bNBrDU5bDbr78b|bx$Rx*
zSQ3)z5xXbAd_uA|_GJqSTEjc(L$8dHcC?b1W*?^j3?vVQ3YZC$4YDTchBg)g^y_UL
z{0B^sTfxs)XA7M+3h35*h0q`GQrdlv#6=eHNaeI-SO#_gTq=szTWI=>0PK>tRsy`A
zg~z`@sHHFh>j&0Qe>><^GV#p4b=g-xp17V$Zb342u3b$8p{=bkr~D$2oLp6*vkXI%
zr4?5!%|2jS--)-&u8CaO*%!Gr%o-)UFkip^s)JFl-Wcc3Xf{%_y=c?%b%IDLg_|M%
z$Un+Wy#%k7N&=*Plf_*u;m_u-Pv<!3s8`FguW0o{RP9`2FE!E(T~D7p>|#?boA)x^
zAkM-l-skVE6Pdl(x#{hQm#>Qq*_&g?jz~E&>XldJxPW0jsNDs_a5qcPaoWaZE;=i;
zmo!Z9xUVb7CNB!lvOfW{Wpk=mq4;e(cfOqL@5gYZP16aiF>pgl2l~e`eWg@Vck<d3
z#-<m=qjRJ6^)tb_II2FHr-OUJn@O;>y_c~gd$HZ<ottbwx~QD~Csq1O0`7L7&KmN$
zo}Fb!H;Slv&<Y?XXd{F7R(z~sUTMJ5Jh19JPis$HJh{SM6>DWKYEnzs?}tPw0aDHB
zez7mDPBvDSYf?6ATSlk-qvanZey)7Yn8@*}%<wAm^i2p+;38Xiax#3snyq6Jj_TX<
zMlf^z)ZN$QBSYfVtC~*&U@pKD*zK!B5VvVkzrOZyZtNcbZ@8zc6HtT=P}e?=+>mp!
zCFHllqn}RsgI)<4ENY$a7a%W-rEw<WOx&{g`IEQr7|Z3k^dS3UVV9!t38y>1+ttUe
zuTnZ{c5)!ZN~`1>-2(*$Fx}BIIQ-Ay@S5RP)~RCx;y7IGc&XK_fAk~piu~qcVev;{
zKl)HIaHKg>;PCj|#NfiS-tIEI(PeuxM1*T3cE>?z3L8qi0g#cS9XE&^;~%*Z)<eeS
zA@|Nrjr!evled$z9i?E`k5t(<R!*4qREJ%JGLG*5tWy9V>oHs76VuA?NrXxh1H92K
zEk|A)+4S(c8@xRt{);kW{a?E8|LGkYt{t=FT7S#j?V7*Yw;C{8D)2fm%HiHC`7`Nt
z-H-!Mc6ye)8&;WZ3t+|_bgN6sj+kbLo9K-<2MQC}-g(lo7K1}qi7|JBvOqdX>o>97
zmsY^stxEQ#HDb&JB_SR=?h62B|F=3hl`xNTw?dvh$OtpukO{_+FowbMNte*`z?^=v
z;2$lxXk|OcQgDq^X=Svw>3lQoWB=I8V7>UBR$JmY%H{BfLR5U*XvE4tfLEp01{y=g
zNQFg;IcSa}u79U`{V_>+5YJNMNBX;~gxqQ&t=hpv;|F2ys-NRFi9Aq?&#)eHMbEeH
zusRRd8deZ%_V`=!Ymu36hfQOp27T-67%{9n{^%}v^Qnp%_ro!a9M~vKmWn*adXH@M
zZH(;hwJM-9=bmO_@>1;^nsnZ*8GJo7wE=#@WzDv*ACe5LSJ?{%%_$$rb(r@Pq$5z7
z_Qj|coh>w!T?oa}%PIaaRk4}jSMRC%tGX2p*aBB<Y~IIoCbw7|xOGeYEow;R>|d4P
zheV)gA7HoqWg>6)La)o;I`?`HcqM|}uaBaQ=K+2meQ;<}GC^{#Eqxo<Rj_=O|Ah`$
z3->FjfuRznW37#8PweC`{a`UZAo_j)QxUJ$!qp%_MI!wLgIt0V@cbz}+ju~S$)ZX4
zXIv%N4ZF<%O6|a=iLc*Qk8MlVsh-&^QzXZ1E0v#~*4#o8+X+62ZL)@AVNM<5juqp%
zx<F>FJIm&su?H18uv_JJ<PAK{tOm!X3yniMN;E`x6Eb1D?*-zLi((X`#ISqLSCC+E
zt8#@4UuY=GwF$eW;E@Uzq+aWZrn!A2?&g{3D2sd_Q`q2_nAq*7DgxgTm3K(cT3n0T
zuC;GVQe^?Qa%SC31@0`_->K%4MvlM!2J+Qe`tZn|k-PrBV#=PzX;6pBlOTwnNj_8N
zK-2|)L?=%aR>w3C;Zz^P#;sxn6L+H>LIpLuRQcA*6+G$w0dV0K=?`m7`csRQOTr5I
zI-@M}KR)|?V=5$~zfNb%QY;J3=Z-OKd(x6A`Pi;b*qiDa?0tQv<AAPjfToL_qcZD@
z62m2U_?FYG0u(%rGM3F$);gCm?wE!ig(m#<XXQAvAWai9(t+ZI3wQ{jEMpLhF~ift
z?HI$LjAY|^)vR)J)OoW!NuNVkx}N7+#53CYjo=)TwGhM&1y73WAD|&P7y7BYJyBVP
z9~-ZUdyUJ6c77-q3tBUaXm}Q$x-N_>Hx2gqa32Gr+1O85NdIfAIo3q)<AYC_ovUZ+
zFTPYWyGcyw@z#rUHVlm&ZkjIJGvo4~WAga9)$Wp!8!5wWxc0@fXRiNAeosUd<LZHP
zB#~`!v8LouuV@1vb?^T=)YLs<6fx_LSYk;2n$;}?H`=6ts$@pt2eY5@AHdxejakgP
zCF|~8Sjq$PHu(Om<xDrHB)xdFzZ#S?#bYW$r~W%*HYuRP(am^(Ty--ax_u8j4uTNA
zEgE1${=4d*rIC^VO@=t1Vno8sBSk9w&bf@q{JO~-THr_jz)vep8>tO%OL*vqML_#+
zaQgK%iy<?g>rKMQLgD_MXgUs4JD=77+<ug^4<un#UQ;xl>wToP!a3DQtxHd1<P7rA
zY#HPl`*2xBa#cyXhg(9P)h6o))*~e;<WjyQdnz3fE8w*ViQ|$GU|hiJGFUL(=5=V8
z4PL{uvzni!8-H}7qt!+oc@exVF(7JpaFKnhRG+XsR^;&3yutZGA3V2ei13op4GiG4
z2`Pxf+?nSMIV<=k6&*0V<+!6qbN0n2U?y;Nh^Gn#3h{z)Mmk!`&xYld9{goIdLQ04
zn|w!0*woLbdSK73v9kf=y2YalZ?tJ<USE`-1li@Uh_k+z6HbuFA9ZvuXsTbx+Dk74
zNBEBy#26paXQ=1aqhS1fIjPeIYiV`xR$(HJyv;O77I?pURaNJ9evNR#tfhb3Ui1%8
z3T6E){A&c|bgG;ml)=Nf+7GOwh-l1&ctSW?S^Jw)?9!3)E)%3@mgNoo_n|MUMK;@p
ze=2B}Fn(O{&4LU@HdS5qmb#`l1@#;=gsty$n>OSA0Vw<pwJ)Pz#KTuALTTP%wlY<A
z=Lt@a)gQF)gKW*Q8jy*@F63umA__kO;d-Ygp@x~;K#t10muKeK?xS~3#XFl!Y=-iI
zpD5Cgo1x5MMFT^2c3NSJN;ux>gjmcoI0Vm5icK}R!>rkz1I?cJW`&$h5&Od$YS#}%
zoePg1`1*rF$tazihq-+skZJL!s;yP1HQDMFk$7g|ttx{Reg_e3Gm8I9DZ+bgk#UNy
z+(93PC-aNTVT4Cl{+R|Hm)5Hqs*vL#?B`K&sMkLL!cO@2KkEIJDaW{vy$4oC^ajHA
z{0wydiho(ki-0bw$Xu#NrC^bhx^hcz0r{7gXSP`xpn?^=%>K_A>;FZqr74313*Fca
zHN_8e^-WY1KmxO2m%tf&$F_NM_x(qTq3u6rgBH2bz3vX?lz#l_&X%8DZxXThg_p#i
z3VNpNm$l0+>BcQtzC!gPjclE_OT~qLMcq%|+J$aG*l?^J?6=%QvkTqcCKHp32p&9x
zQ>KnbbI$f{DOs{F(eKt76AdskvEI>M7&0dsm~{yez%5EO(t-Kz#0aj_w!d3MQ}!_~
ze&OuD<LF5o$aNs%5oVVY<#jsnAa~WRHxg2yinT~$V5-9ez=Jv8g=2(%{;Fu3_K~gM
zys^?h3|7=3t0#Hz0W?~Ep1=OV^b#HyOFEr+b){S`hn(oS{Y2=2>PecMiy}U$J8@Fl
z%Z{_V&mFURgtATV#gA=Y=1u+OPaU>NUcnY!JrsZIr{zLX5a<Hs)i$vQGisndAs#`n
zc=+vS!%!`IbCDY67KKITr;3keg=Q#@I>H7ruG<b@*3J+K{I3|8J|zk^dSDv!e$I;+
zg4Dj8ed*K4D4<bx#ZZVQc4>3lxoR2Y=!R2RyCi2ALU><>bY6AzH$jJCue9brOO-%r
z=vE#QqiQjFD6}+5oYx43tfVl^vh)hha1eu~q!gWSovq10Bd{f=>rvG9Mq?Q8B>`ds
zGJlW1)(RD1K2>z&mgbB!CUF+Zeuqnfiponcf^`qxBmtdi%l#&e>X}uh*g7bGP>^L>
ze$F1SC3;-f$LWlbI+r)bE;q&|*57dSduQ*_95MUBQ2wJH^u5FgJjU^iQ_6-e{IysY
zlvPTF+eLg^uJmf;`I;O?Bq|s;mEdhDf@doyE7ep)dm60xk!IIg`uB>Vu=c(aXZn-X
zS=lYdsU(csV>a&};1j0B(|*wx(T6+v66~>V)S;*H$9dkuz<n^LAVF4C`>UJU?;FW~
zfV)p>$LhOXMLf{x%)hO{z7o&5b%Tj#hrMV7(9=?axO0_6;o?vYrBa<F;AeNl<3{7w
zJr68gM#u8^ey0NW>rg7u%-EUnqG?fuPBy$rZWFDI$y`6#ZDIORk!xGpi@f;LxhfdK
z@A)S=obWASrSwHZw)|m+14eO6Y9U7pvt5u$mx}eOF1uNLOxRO~s?}I_%-c<MSVm#O
zT622~im-dr(kr-Nb+e7NuBBNsTcxZ1fRS5rfcO=eWScCii&zq%V|`o0tU>fRpV)Wf
z5$&?}VmpMFCoKsprnD~Nqh+C4YOeA#`=rU@b#av7=Ut}e?!#LD(F#d7`ZA`z)6kKG
zPdEmYd+UExuHwMkLSAA2;{xr_s1GQ&01+USPODrn{94p&MYk4$il&}DLh^foGIR?w
zrSZ!HX}2Qkv^GUJaF%t<zr>a5j=@$3I||*&yhm7L=j!v)AK3ib=Eolq3~Hh*jOxb5
zup>c>9)W2IgOp#MLWDWA#D1{R@#745+TE{r2x5Ke1s*t|=e5)N(E*)r-SCmaWrQo_
zj?R(yBMkF|4lqs9$iLavv?tXG9bELjMgAh3G2@5eci&O{CLtS2r~UVwGD?4QnB&qk
z0oVRV6{orgE?fO1*w?ZB+H3+YX<uGfs`DtkQAuh|`g*V*Ol-6?UmqVNq2n-}$E(0*
z&$<(%PnTmf5!%}$3aF}_#{7b^$&>pywmm8L-9F{}d;1uqC$yK7bPz6bxH6s`8K07%
zgMsg95bkALsPf?_%x~7Jleypy%qbT_WklHJ1mfv3uRsM)2v@VOxxj6)b=O!NfseVJ
z?i|uj1QSOxPXMx#r~1sk6P%L3<{IBEdUjb&*xpP=F)L_euA_0(cN_MxDR<JP<WL)#
zd_iURA~{@rjD6%lvYL>;Gv0`mi(`dwlFC`Qm<08c|5FJ2xpwt-R3D-(78<-=lz53G
zE@V-13y7upTg<P0n49uoXk(ejkAt77cr4K1g1G0dE&@lM7H!sHckZbjFbln|Ivl8j
z#yMy+V!^QQ{g;&!t^@Z|e|GO%Z%j@VRB2u4@K$vt5R(E!5xP1~Rgztu&$MNcZjvT8
zo^&nh3TnEt5XlP%)r?Rm^~=7!T?#c%=c&isr+S6{<ky}rwByI$i-yVS(Hho>k-Ucj
zTj@lh6}Dg1ys213Zs!jel{}0@@S18M-A8NHY0W{>)>n>H$@<L59&^q*q9S%u(SJ0S
zQ;vjPW~)39`>JoTiLXXpq`rI9@<~O=v15N@ips$;m2U{sV<SAYfCih!QE|#kh3V8~
zFzNk37T7d(XE32c?<Q<k_Yt*C&==}E!K~w)t;q577YZ>HvMV!1ohiI$Gm})nE!$=o
z*zf<n<S<N-vbWG4DuYPMo0OBoYZ4;*^A~x2V{`JK$%XPaBg4C+h&=BaY)cZGh`;OZ
zsVdEg_d8kj|8Za$(zv;KawnKmAfs~Fo%kJSylBFE5m(#PHQLW_<;ps7Z*Ew{*&JV8
zRMDD4@h67JNIFOX%@KaTWukxce^YP&-!+?VbG_f)hJ_${;7sbPPRK3B+i<QPcUj^x
z;wL%9$0@#MmENk*Oq*O;tusXX=qqoBjN9?y$n=Cl>vmO_4_D0zm0}d4`|f@@35`5=
z9Jx4@6Db;Z#nsfxF_n3er2JVHG4jQMo)*YU^M7$}_04)Mg@aT{F|uY<2Ua}<Dfq?`
z?hkCIpMwMk2NRqB6uf3GqGpX`tn%QidG>#`U3T#8ixQ*f<rYl~YyFWevzYvg-+p~-
z9PYFVZKhOAG8qTOV2)$0C|i_p=9;jhSBzC~jG^8GNAl&rTYusO<%-rS1(a9sKNZyL
znJ;smRM2lmVwI87j$?WNY3<)Ts82+9weY0KK*B!t_e2G)%K|R$NkCB`^{r2&V`u^R
zgCX~}jjO~>Omda)_jf58SeoObS-vwparC}6t_pmAe9vEZ<Oy(lR{x%{v%4^NOt`n{
zBAyM_$O|KWBZ9@!r$vCl#s3j|D2uIPn{-KD;r6xRBto-l%}eRw5{Z$ONmsz#f*mRL
z>K^W8#!?(^sqIeO$FY`0zKCqSUkls)l}E@k$KpL@8JW`Hm>DIAeeYp2a&nFMz^hP@
z-X+|MQ;a0Dy8W?{uA->K8=v6&58CC7hA`brw^91W3G2c=iKMu+L2A?5Hr1J%q`=8N
z6sO`vqYLmtFi)$<l-#ZMPSASzaOtF2K6jox-LuP&AYP4L12x^fne`PbXCkA^${<C2
z5-VBXFl-l{1Hf9flx085h`c%fFKO3!vv-Ft%k0LFx3hCVm4<_6FZT4~g~fAbzdiu*
z2dBsAPfJE?EWcrGy2u{@kSFY>Sr1|J!gMz~^Q6@(lp@iB6ooL3`21Z$_gh|i5>v*%
zwmsImpR3ekx4R9YjJzHR`Rh=_Y*honbz2JJ13~MBT#%FYPs!`mhOrRx`?+jj2l<cp
zUfI6fQ78Sa`fNX{p_8t<#8?d@UI{)|b<z^5;B2)d((gle@-cK%y9fYE5r1GAYw#$o
z5Dyi>O&Ba`UBR(Op`<g*EO7c)#t~7eEy;kHT{<=7OURMjLpcl50eAtxuqVpYyPNcF
zlsf5^{bereO$c7R4SCexx$%>smh+49d7*for~s!4gR@8h(S1%QkHv0DoNINWI|EPp
zn(SCV5w5`d@&s~qkr5{ifnl%UO$whV!{%!G`U=oTL0VFBNcM~CAFcP}iyAX>X!z21
zGR?J=GK#9SPI$EZoGk}|Z7+j5k^3Eq+HD<fST$fkqR72IZHU1p;1|DoM;d@oNd9gL
z+m7oz)Om07{CmjEfCX30UnFYmMK$U&<iUVAGG8DztCa&tmdu9Q9<cLhhGSHp^fzOo
zR>pk$ldR{Y?Rc+!ra?8n2f%_>=FjmXOo3FIBNk*O2t;%GdT6dwdm;M6GAt9=Y{#P9
zhKer72DJeVt))_OW(+lJ((d5Jb1_R8<_)W%*Ywp}=4gx@G=6u%hUW)ETeFKlY4FH`
zZkNhheRuCfU<=CR@OnHKSrmhyv++tA9}QKYcS|I}E=eq1cFhmb8H>45)33!L6p}RT
z1(k|4Q-l=|E_u!K);j&Nh4V{;gY|AXE**FhY>rGi3dW0M?6OjS6ubMR%@YQ0vb!Gp
zxB23)7y_tTeLPPp+;OJ;r&2u!GA2h`b+3TfZzH(layhl)-dMu3`hT{HzByxk7`~Rz
znIrSCzH&OIJMge0;=X5itis<RN_GdbnGKW2MKlk<t_OC_*A(ZPa99oed2Jbe<o}r2
z2oK0g)yL=3#xr+_hdS?EyZR1Z_U#E6d{&EmlkLy*tDZ_b3Pb8OQ}8XO8@iykRbMiq
zUGhvu(A?=qa%4-(F(PlSiJATx`GJEc96T_o<m{twsyONplg@|Y8#->@Db?wcw@LFP
zyd_q>i8ON%jhWI_8murE?AM@pp2Yg%4DSPu9@dF}0AZ$DXQfmO`k_oam%Mfb91dR;
zZvC#YP3JDk%Utw~HO3N-3EX<hnA|qLyHVP?QUx!sV?v_&F|%NGx+j2;&W3+jhj^gD
zA1jehbj^t#LV1ZFD{AVp*HaAxaMW_fS%c9K>Cmms&D<OYkPCAYAHROcuY=P4XCv4D
z|4gg@=R5EnCq7TPGSYC8*$s=Bf4#NZoe52Vu5PLpqqKqC=-@GigFY6u6*C<U*=$9s
zB3Rx!1Wh2Z$34De@%C1Yeg{R*mvW_WGy0y&Sb~6kyVS{1Z)C}7>k-H=GVvl=RFzrR
zH#Hx9+D1nIG93<MMH%F+)X9;2)WR;VFAg(sF^3v?t_BXj+Np7rYx5QzEX#bkIQr}P
z#B99l`VY|j4{(Zels_|yMxKAVIL?qw?@&d;6(?T0{a8x;UQa`TRC@-MbeLuSvq*~c
z!-7h5Yg%vP;E>!-g^rw11UywO-Mnm`CS{FE`FHrKQk5yl!U~0_B)?vXn>txc76n^I
z)OgKkuf;?bF5Vmp!_Fx$1&c&G*xO}WZxK<>!2`<SoRc)qRy0W+z!zUWBmE<a^pIi6
z5+z0oX$=Zg*+YQ%<@!T8#V@a5B`*2yE6PSK*3yGz_XVc;#^fvH9D{A>U@Cx?)&M9H
zC{kKA`;iD-2)%13m>fG)s*Q{=CnW+!s%OL)HAWhJA8k;NQTDgx+7uOWQKE_xRXmu>
zB%{*$a<t!0d_%$eAyD@dH<2lT<!eT19q;A*mUy2}Ee_J{^J3}LfDT!X?J*uSpecvl
zJ>4sNtQPm0U{}+9p%7m#4W7nBu$1RY6-D&<tL6z%Uw)hJ!W=8+uh27-Cqd?VVUR%n
zA41ac=m6#@lJ7Q6jg}}Rh^l@;3HFmKfOaJpAIUAW`MbZiX8|yvETA-PLl1iLlnVSN
zrXFwTdPC{*BVLMeAgxJ|{1DzqAo^;;G11P7n---^!jh`o(bsoCqEBbwFo`Pq%7`sD
z^iDk;|Mb77;~Ymo-IfA7QmXV+$T+R3AD^0mbVBVlUZ|+VD@4k<6<JY*07nyi*tk3G
zOw*JI{){}P<o9#b%V&K|-Rakj`Cmo|(EbLd9YjvnA<;d4k<MahCK1c49gTgeW7MTr
z(H#7}pt^&Z5T!#8hn*!F+|<;mp{&vR5AZ!Wqs-m=+bVH%N1T_y5T|+z+_F|1-M1__
z(frJB5~PE>$Jce1k0BG0*E1(PybMgW9QaY6?Z`=&Sh}LrW;G04@@VlL`N&#J1$Lyx
zWET7d?)yNRN*C{Ii$Va4+>p5YoXEFXDIPXvs1z~&jf3Qq!ZmI|Hmg=BpjO}(_IRGk
z&{vtCYFdz9#n0_hduDr>^($8Ku(AVICis?mDrsNahbTUgj%f=8svjz`i=gFS_zzGi
zi`s6JB5E5Ld$AF!x^$4C8}fzOXwn&ZdE>wyhLSU9I-GWx)M%p0h}47OiC+7nyL~=Y
zX?U~#>2F#~WDg?JBd<aW(;GdW5ze~EkALlosz{k<Wx#L4-phFqw6xq)i*HmOlU9}>
z{;htQqc>Q0uEjqo{N;I-^jk|Msh9Xl4c9PRLJHwb?p{59QyKQ%l|Yss>8>z$`VUXh
zMqlS^PS4KM)v%kOpP!ylYPjB7ADbF3Gh|9u_343Z$xU-bcJS(ouGRjGDS#>IId?Am
zF_OyTV+8@-00No&u%g7i%xdzZi(J;56I9w$Mfn?@nlQ{dQAfWrPfzE~Nm9KYaI9=v
zAl(bBLWDiagy}qT4jvvE8~A+xtQ`bV#~-O(r8zfZU6m`LJyZzW(=#x7&{XCOXdC$}
zo?-9?tRQ9hF-6IZ#CM*xa%Y#jvVTj0?gTpo%z`j9EbIr({N_o&v8PAIBD8ey!e&2Y
zzI(eS+s`u1wsL!<qNRiZ(C6VcQAMCPBL?3yz()#m^Z7xxwqeaR0cMWPt*?LIO`+-Y
z*#IM)NdFSRO|uO(k2G_q`QWxLWE(@Q6^oN+o8g7!0JT0g^SBOkZ7cLrL!yoSBERz8
zN1J}QZ6#Wcb6qmNYGw5!;sXpw7l5D_6RZ2Dx<%VMKdLnSKmUp2{YUPcP&A8+Ja5iy
zbOVxMrrYz?gI2rf_&YJf6q1FF>2u?uv8qsVDP~MuSqb35yN}Jd@hnD3kz}0vs@STs
zLiTn_;h+r>qG?pXzRlJ+-_YB(-SEb5^jvuLL0yDtSL{C`BJ(fJK>e;|Dvb4A94+L*
z7W)*uf^2J}1InF+nEV=iG!4m<UKjWAK~tw)A(wvH;J2OGjcG=^p9YW|eqY#p_xBUO
zhFj$JwXve#DXpytOzWmy-xV^n4;-?!OVj483=#ppXxnWMW{UxKX58ks3`$izy`5?G
z=!~fQIml(Px3@zLV&S9>jEH{sY3f5Il+f0zEsmeP1)D5%_J8&$!LN<$cZ@RR%5(3Q
z<l>kyaK-ZU__+34X1iYuo=bVN;nt8f^V9BAEq!744Cyc{(R4sv?Qwv|_EZ~vOWa@K
zGXH1O*@!#6JE{JRyJ2%P3Y0_le2w+ZjfU9RcA#08Z7|3|iBWVRc3zPrC>oc;;~!x9
zPzi@lSYROsj`dwsW9226e}foup>lCus|sthk%uG;-oYksDfR6(&DGRcaC)g~4Xch?
z4Ou>XD$}~Ek}5P56T2!%SM{W6b=b;+lfU1?q!0hdolHSa_zEGdb<2gG^%`By+>kyY
z%k-Cn1|Jw;1wkV+xt2N=F@2h8x@;6$%S6nq+{dA&e3|k250Z9JvesnaFf+cti1vbp
z9NSyR%7i9t4;V;CYo0#C)nm>#wd}VJJq>eWO%@Y?u<Wq${h9}VlHx%tRtZB62VW5b
zFlZs_{md|P<u-E99XzMiz4(L&06_5ms!`kYRg<>6kuH)tHAVPG*4JhI`%uLbtp4Fb
zyaL<Q2HUDFMCL&1OF?^oQ4O02gtzcMK99vhbbN6*;~zjjHW_;y6!fv3h(hG{x8`T0
zPq|?W^ZcNgnq$ZVQ^kyIDbEL4GGz4@Se<@4rCyGTH0Ir)jpB?nLhBNO0I9Dn8tZq@
zA02c1y9;@t(mUfv4Ij*^6FE+DHyLt=c~g0zn@vHMmO3OFIwUWrCP(~?6zOkWsEGS9
zU-KKXpP*;I99d_fH9m5p*UE@sHdd!S6-~J>XC6rM8?TLMP0I$cB^6HX^uyYJQ>RoR
zh@^#yKt~HNyt%GerPry+M2SLNiQwEr6Fwb<L7i_^wU#CB6z^)6yAPoO=hFa!iCEbN
zjSYD0NF5Ye9cp+GxF@H)Bwtxm4#CQ-6|kqpn@SHG6W9eB<;|?^;6%0e8-0mA!u2ke
zk??lVIpi}GIzn}j{RAJRJdX-HWXM1>jYaA(i#qJx1=mHLnLM&Cs=+s>F+31{ex8I>
z!&h`>Qh|jr46h8V4&R}?lcB6$VPcE89a>;-*CG`btqfFy$%YP#ouB5Jpe^Ksc`{#<
zsn|YwT%}%XS6iEm>KG8C*~`LwEK4U`%Gy{dMgwcqILBa7VnD!D5Q`=4h>xTSgveZJ
zojGXkP>VTK7~L(hh`c+ez;8VjjEErXET(lLp!^HFR*uGMSYhSsQKixCVLWwnQ=GuC
zH+SFz%xUl`_=Ssx@uYyVQSP@7Mwy{S=t^;x*$L8EJxcvqs`4+*z~FWg<o*$VUX145
z6#QRR^hvM)z{@$8<D7SNoxJXolM=L{B$wK-GfZ-<uu)5eAB)|S%fC7?dz&QXPWCbo
z%3UKm`wX_&=UO-D;QX7cd^jcxc)KX+H`{4j0UsSPp$MG2#qK3_u7oLF2<Tw$)IuEb
zAm98MY#s5HLa4YtjI5{r+BGRS@AL1yB6&x$-`uQoQ#9bgNgXYZfI-U#?))fae5qw?
z2)YPLu}NpdHm!r}K~;JGn>*$I>mNMu;N>ey-Cncv<7Pu|V<h_N0wf8Zwd@Bz2Od!@
z8NmL?xilS|kF{!x`;e@U1j(4}UeQPju^Qv=(bMKX3;)FT;CB3M-W_oZbTQEF+@#?m
z0gxEgKz1`IHh%3}(vUQ3J{k1Y@3eb4k}?OwcR&w(?KEX<CEoI)G?FN!D#gUbYTs+G
zey%k=rF0<TQlk;|?`lx+H1pdn%+SpxMrcK^nuA*fFL7)LuE)}vQZ&jE$bUYl)L6F~
z#y`efd^TkzA<Bw4kV!QNdq)yxT|`0B3yZW{PsHbOB4`q8w9J?pUg_|=xcrsmaMs<T
zWQSfM-C@fCr@NwGF;`?vkzumg?c3G7o|COFi-X1QR(IbHBWqo!4Y@v)a<zekxN<q8
zqNZKK86i{@D9((hgX}Zr4RRFbgoZKDcfI{Z5Z2`80V7F99~uMI%2uyM>ni2BHUU7)
z0(O2?4)Z@irzJ+x;>QYaJ!pz4N52PRe`%p>g<}=h`?j<>zK`ce>uyuS!&jAUA%fAn
z9YPv8pD(k}G2W!3P~8>H>tYdcpB4KWeV^>nSU%T~;lh7MhM5&Fu7BXHz$uzRL}js;
zO2+p+`mzWTwacfWKKD4+SpAk~TO3<)LW9Y`P#Kk42N0Z~wc~(G6YpB$ug^vE=m!-4
zr5OBY(JCuD)ofoq+{)dtGyelkXs24)sF6YeH;tIH>eDfN$%4Nvhz=7E!K@mP6I7~S
zW036Hf<ouDFy6U2IdD>;g)54Lw9KcbJWGxlXMHWq&QjG-&|`kw$+j+3!cbB20NjEz
zwo$)013;t4hiV8a1G{4676*=^OtMEi1#TMr;T_$EdfP_tboR*h+U+9}+l9YXbfo?*
z_#>{LzzlMrHT_Ve7v{;&eyea3JnP?i3irPlMa#Xzge2)?bu|AE+Ws=A@h=S91fg+v
zckjjt?$WqhaB1A#-QA&ag1fuBJ2dW%yVJP*C-Z*TdUtE5=AD_{?@6jsmHf^*&$;jG
zx}VXpG!BU7Z~(&QA^*{mO0wlhNuHX&KT<BE?N^U?pvjccIHg8wCFkO!U$~=Y7H?H8
zpBR9MUGTezkOLWuNS^TUd{ka;jnFDmxL`Yrw4RHq#W6H_XN9d2)pXKFTbCs<+S!G@
z(%0ajxeET?Q{=if`NtV6{y^teOkd{f5Z%JG0JG@wOZkga598GOhlh1y5>fr=`vYx(
zlhv{w_NY|+$crxMa^IIz3lGp{iz-9zR*p{K2EOI1(3iI8OjczpKf%%BG8NJVn$)Z)
zS)NWEczF7Gm7=;ma^YS%3>I|cNvk4}UtAc{qxb>pgEv;7I)@9jA&(B?zzkgaqzE^U
zkfz6+hx*roB2Qw@{zYogeMAO{Fn#kq()Shk^}*?ZlF@g&lz)|J_kCEsHkp!eJ8=Dk
z`qQPlVZVPc8p__(8<ai1si#jEhHWS1YM8U6z6Ry3TNnS4E`?|6k0vM4j^b;O1xFln
zuG7*kmN0`0Y-nS`=#ti!XjMpt#*z}fywo%Q0%aA+pBE6;{y5q?_k>T?c{p)o9ZHLi
z0;>AX<QQkBQ}oNTelgZpTAP+Tx@N_uTrnQ@WH%*1*`^8n)}-ExLrUVD>HPKR93U#g
zE=QOeFDd^pZ~{COWw1%<-j*qGI;|10%!UViGYpuU0j3!cV7$w%1bkm4%M@<G^$=kG
zag?-cH3|`DHVPNT3F2pzDS?1~K}`iJNa~5IjcF^6!2vMRbw3tQ@*-l&kj$@k_~Cd;
zw{Ek4q#@uQ*_pb36X*RE`1<ndTphs!y>Qf(+P@?^FvskM;K9k^=6VCy9P3*DcGxrY
z@xuUb@MK?ra$)bJJrOB9@qkbgkBstfUaGg9ukedWf8pNO%+F!dW;Vl}d@pKa=ZWcG
zu4Hw>i0{#}8Nv5rR`n)=8TH^Nx61dV|D|p8|G<I#pFg_)$18mC+SpiLYr5$1*G9Sv
z+^JIneHH(L{H}b<+BS59hX{<3<k|Mdzh0_1;+qHb_O6GNmrp8pZlS%St4?G-n0cc|
z_YwFFlISH#;^EBKm*=r`uAnDqE709lZAZMS?&qElfW^R0^H#7QG+{SjL|3YEW#9E{
z5zV6Kns3uVu6%vQ%lz96bP#NR<E3xYWc!|3QVH;{;31TZ+R?5xi?<|`1NIpdbRHRD
z1ygmaR9ma_9m&M3((LbhMA{|zBHXTxt*9-}_~<D;k;`A1D_~16=e-bYN9q3fMcAX%
zBX)@;%W7hLz)F5P<~o}UtY&52MwpIwPyzvu=(7RGt)nK)Ov~(InHk0VK~iO7V^L!f
zxU8#O>A?FtrTDwBt800|JZl%^LI!5{qnR8%tS#j8blgYE#Kc5-{WxWqqn|Z^M<sT@
z-3754TxW&aESHnd|L*l;bD>lBTc#;R)+u$Y*e<AbE>)xRH_-%!rYthdx3pa(hGew~
zei99cZ*M=whqbo2)94)>m_WZL=&>C`jJ?#G1#_r&^4;D=T%}87$oR^J>!2TI$7ecE
zspd)~4{U1QqzTt3eP&`rr$*1alWn4DCJ;k}O4H14OH!2SIMN#*7AIdp9@(2TJ`r7l
zL&1t5XfnQ*q1s>Z3!anpcBYrSu`6zsP10fwYQ;Ix^SceP{9WIM0XKWe-|enj+g&q^
zV>zt%g~-ebEHP^0`r*{0c^|MHpE0zzr16BUhi~Rmoe8KecfL<PbCHt*g^2LeBLHo*
z9<zKm8oHVIUi5C7rl?mBpYk7!c-q3#waD}$ZK6B8{dD;?6u)$LvnT~-e_-fJAnPZS
z!+XVh6;D{;-<W{|Q|up0LGkuJ<$3x)1>ep2hG>IqBTk|hp1DM{&KzMK;{pE7neD0d
zz(qUeq{LyUqzfSC3Kx_Y9Qd7z&piD+UQ$I_BpW||RqrLS)=Mh91}e?CA4IRk0QnGe
zf|7lfGHz^-z)Nb`k{UF8;8l69SsQH%O=?xJ0rms=uP=4bBX&zOCO?n!S$aRU;qU_h
zUUo9jg5LY%0#{k3xp6OoRdT<24nOK^1|-QIdtAZabhLK(vZO?PUNvbIh*nBXDxuub
zZ}7*9b^Ni?$%W&L+6d306`@R5K*k8{%xX?%C0sKtzrU?an^B_5=5IibYq~?gsK_#n
z;_ZT&@uQ}p>(mNAN7Vy8#Q%J*wkO17=&_&)29fsd*ywC=U_`_?7qKMGt(2H3R?eXO
zq^R$;r~HI?FO~YC>l3N~+6vrJKbvRNur4y2I|GuV6=Z%r;6nAQU0cM~<fHWRx)G@t
zks~Ixp#4_d)`4v4OkGq~AFlqC{#HyhnpHpfvWNxJt1t6T?$55~IZTHtG>=d&$m%gq
zBgrP}02~^rIJ2E(0b4>>3CxF;D~6;$dJQ<Isy4qHvugLJu)dTgS_IG|)awWcB|vp~
zhX)RP8H#rP+`3(I+3N5mcESIoC;bn?;@Os@?{Mr52$10wIH%slQrVvH>twqY`z!ac
z>~*MZZUI~<zU(+UQYOBzzKE4#LDqF}k7<;*jC21xCUC*)LttVh0h%oIRU$p_EyE7q
zT3Wc>*MD=c>UCedWsK7G^*!fGoAV2Bupk=~sKS4w!yXHkA(>{IptLZ?UR`jMkwV!s
z7QP=#{yIz|U^AOlgdnmw6tE`di8r6*)A`9TrDqF!@h^u>3Yu*QGc2AHv62t$EmN#;
zbj=k)_?0eKx@T8}S;0GWMnI<1rESJL@xS<p{XaA}{LfSF|JQ&7$KY%8FOT0$t=Q8a
zj$cVRrY4-m(WhM8`p_Yc-7=Yv94@f(Bo7U$9&q!=>HIOJ&sMq;gMlguRECCEHDSYg
zVm8MiT*=UCw4wu}Z1E;MV~eA`fcw?9FrXoT#hZXH?<tROCtmSSM)2b|7iy9snAe1|
z=o$e9S5VyS@9tRJt&r%Mmfqy`29Qdwwe`K;&*6M7k0H6;%8pMIv#reu8+Hlu0TOSF
zeTEXR$+Mg>uG*Z7B!M>`m)9x}*1@~%E)7K3>&#I>`p`Dj>D}>-dRBo-=tGkdk!aN>
ziwaEBflw03)nhEE#UjBX7@~&C{Qc4k0SYtt^I}sWE@8f_%c_Qqc#qbn!)(SH<Sbcq
z$rq#9QX09wM+lUoRzZgPI~q5Pt-{WiB-P{r8j_Nn!2ci`5>9PGx9!vxpMG^BNe`88
zQ#G-=$FGqyk5*Ay_DT>?+^!3QbXXGYuGOnZB6(rcxnjJoHU*b9=kP})uk7o_6tMCK
z$hv$U31Xv<mgg-uD77<W1)lIXnwn*?T9Ua{D3*|Z5LBt~s0f5(?j17ZZQhsO<uW?F
zf8V$LNw#&$HA35wI(fTJPTje(SldB!yNULIkgZ<Gb3kCSN~#`Ztl~l`0iqv9egS5G
zw@)6`%`i%B@c^bG5V`DtAVPN-!NjKYJbOsyp<IzOd6;|c($w6^>FN^_Ust{G1uZ+2
zam6z}O@Xyn^{Zc&2RFzT{4S%`BPZxt$2^pt2S9T=c=&$ehQ1OfVs;2;fVE^x@wRiz
zZ1Dgz^P(U(@E6!<wT~K+5|W^z3oc)ybPhvap9mG7JXcqxTG_`?Caa9@`dOW?*~RbY
zVuhB!%nXG<)p9=kv8^uO%J4n+9WfsxcRJbAtf?_e@7aJ~oWA*2C3-<hsBPg7A2xaU
z6Rqq-afsgv$mk0(gDJ|B39V8^4vl+-7cg6jh8|cR%_OY|4{hrA18Jq&7guANDr;9)
z8G#f}#z`jWXKe_*RBnw*;+?BGKr3CXgP#4<I<{?IRy2*5(rC5pL?!cE7AY!p5!Qf1
zT(lBSsBSW@C}rw;m?>7MgKVFt2$KLe-_kDrmg^^q8ZEDS(38Cs6}SY30|j#K0uD}*
z`Vha_3tbQ@%y7b@BT}|z9UtnB5Xt<YhE_>-nr-$}LQ0R(YgXwjEIjwH4|y#oM4(Th
z@Qp{doG!cNmo5QpPY+Ye<2Xv5WPVCm-zl;)y~a^a_M<9+baT&`3Jgewc4cbCu1!KQ
z`7EaL_(F;48i%(eMXEa3!f(hx+BUX~h=0>^wT!WsW;#5&1M)c2YKd0jASUX{@p1U;
zTmWFUCOI+YA=$j@a=eJZo2E0v%=pBQt<$>sbv|l<bU9zvYSx{nUv}6HKeCm9$zW5>
z9k#0CP~za*vTEu1qbesHH05hs9P}o68;{o$-%nnW6RUefCh*#WfV_}9!yX1#>b<ZD
z>Bv>(k!C)TM4f~ji?GnO3*<#bMO~iKHd*N{SkNgl(EDwTX&ZN@&&&&%qLaMI*%H_)
zjr`mOr6ST94VFttFj1W&w2D{<@YdzhHebDbwC3>WPyj`f*N9rJySr(>Nc2mZf-Cjn
z8X?ZDd-{+%x}#3`j6%POC+B<v=f9<P2pQCK7nN9?N)PR^!7YRf&nCUuYxHyR<v=C*
zSIx?RupDwHo2bw7?kNFh{2I|i)MS#rPjdD{o6#}k?lfJ`VPup6!CWsgtg{otLU68{
zr#NJ7{1=4}eu-<?vQv$B+sxy#_Ra_5T6u-9xUf>+ZSNo$pn%x<|H}Xj<^P<BDR-*H
z?KTOUGF@=@zWsT&97}v(N18<!?)8g)0$_W`HAXem5B?Ee<J{*i`%s`^2g^-iW86{S
zgrr0TYy>#)b;zl#KkFChaNq<JHN25!-6L({V)$&a3!E#OGD4UMc~-BRCQB_-$G$^A
z3d7&m<^R@`V3@<i;2F=_PA6=bb0EVo6c+fS;6f#V5iRhnp0koB8-X1tE|*~!qcT^1
zcCS)EqAFpoyi1%aXzeIVo@x5M7H-=p(MICe-qz1gF0Llh2shyo7}b(e*TK7_ND|bq
z4jjErZG-<Hir96>{SU5NXo!^}K2$ObNYud7sh5S?7ya#wrMq)*s@aL#@Jz2|ACK#j
zgO_2~CQXM;9q@yRN?!4p;{oopn!$00oONnV*1Pm?I=xC`$KJIWkek)&rI3f-*Xciq
zEEbj;2W@^`Gh{Ts-@o!Q$^=^D@GNXRjU@3IxMUu7+NE{mqv`lbMkxxcT0X>P(__-w
zBPS5+BR>G&$zKU81V>`dJVW<IM2C9wofca1!q+pV>->mV1(MlP9yoKzEpoJnDRXjC
z%~Yz!To#HP`ODAA)X2P6gf#n@mSc3=d**eeY!_K+@@!-C=2eqdw&_?Lzm>5eauuB_
z2)5HaR(d2AF*|;%Cx1(H(vJx>bdSMj`*qK_R*K@j2h1(F>7StNdV;&Eo6xamb7hjp
zb*kwMYRy4LZFW>72EztD*g`70BngP0J}LoHWGIl#6z(~(yC1?VgeW6m;v?7ZqXIre
zr&_Nn=A_ox6&^S!U#dNSS@!;hJ9c!}#Gm+j72s>=rz#n+N%@1mC9FK?#MycFb%K`~
zxRJ(|I{C0AYs4g%vyH7SS`xVrU~wQwf(x+{Hu$|LN`TLCsIMBgMoR3`xWBcrNuN;!
zkoU6i6aE_~x}ia76Sb@lR)`!5oMVc8OAbWs0=iG&3xgy@32WvaCEIsn-R%TA9s~xP
z(c@L6g<sWDO{o}MzTc03F|g<*-Vl)psxNQK6;Sq8Q;=om<KpO&q1zVHb|<^e8T2Bg
z=xvFJ=%&;4ub8l7?NGlhcNitfxa`2)AXbnMS&X)Of2S|5a0#(SXg{vf`~KaLn`p&v
zIGm@e3_1sK!T(7rPLajjzK%n|jb2CRfG^M8LE_6AuNj23Fv2m{tV#FaX1Jc=K%I4L
zqj6cEg?wVidlGVRW~hP^+0y*%<GHahjXc5I?}e5qaM3L+k(#yP7-Nx&oor9L?y_|9
zvQuub6KRg(0od+ijUJPJb$eapEQm8`&81cCXUiEa8>{@ir9#d`hN4^vp_xc~Lfq*6
zz^Ult6O)8~MJiMLSLRf}w?XWVz}|;Q*K+|rNqU^1|KYBp4xM#Gpx7GOm0}e2?@GHg
zU-{Y{LoBFdGapKH?zS?Y(Mtjf;$PL>4ib?XY0#$JL_<4%W!h;{krKr<1<#zCVpDx~
z6aur4Rtg-M<=R-<V1}VcLxr)c`1I^U-0kBz(951|+qew~)|5BRl~=5PW@TnWQf-mp
z7UPN>@r&~xkY6dKDh&Tw+q}ke2UD5o;x*ML;w7KKFgt$eP3JAK-5tFv;$I&hm7wj#
zZCSk!g6mjkoGPE;nK~4EGFvCg+GNS~Ii2x%Dvsz7{@h#=o3ccOVZGgzew3Yqox3$p
zn1E2-Lb$%X&+q=|-Yu3tEBOmpNy;!XY>RirdjooY*ps^uTd-~FGK-M;eR|o=rW1p$
z@=PO33xg4S;)(!YMWw|dko!kk4->o9J~9Ew_df^@iPi4+sm-G7w#*pI7~4Qzta-GZ
zs-1>5Gk@y+^Si!<riAX8y&RW+M;97)Ocsq^n6p1=rl)RuKciooY~k{56buMkFISUU
zukej(iELlLAH#v1hb!a^?tFB|9QvlR;(9=r2`CMG?LF`G+@bKp5WP}q0VV!{^^FnX
zx9>g-Zi~nm)s_N*Bc6E3y=kayR-SZ#$)@Vbq*z#_UWAjlgsGJtu7EoX!L6D;wBOtC
zk0iQ<py%;puKUVVHW><hNjbiT_%u;$uQh+1XKc+;AG)iY9GxRuo>1#Hz_<A+!o)_%
zX^i<xk3*-&cfP`xtuZ6#ximWQOO|EuQGqh<|1al-|NTP^v98)03-1DEY+H)&p39^g
zo&wQgrW2;UHDmOqs8?Ay0?lSc;ngwbcUR9I+D{Vr?j0-xhGh2AY`Sbh1PiHnQJQ0>
z4&5hSfg4trtnC$s-jP0-7Z_!mg)h2Fj=7L11D2%|!}*6~D*7FJ9$Zx$<(NZY)CcLo
z$)1cqj%#DJWue3`S-#v0-#J72)RwCo<ZLNF_~Up6sS(j&0g6<%G>kNIA(H^c<rpCb
zC!0VbRX2?a&d=W|;NEa2k=^$ar;`@<eH;Fwv@ko1F&`p_Gxfb-xhQ!j<~D*u%UcaY
zP6Zx}-i46T{~#uN(>_q0T{wpsy)jvZ>Fazh_W=lYH+!B-H|0k4zHM_y`t~rxL}bQA
zD-vHeeTTjZCclCO^1xj-J5j6FsQp-(uPZhZ5vtwFO&_7iaNUd3{TN|n3&y`=Cz=#J
z^-Xrf%**nD4g%SEb$7}E7G=~N&wt?iN%m!UZ$|*0?fRXeEr85=_FmD4`&!t|!pzIG
zT)-(6O6xW6t1~e3Bzbp+x;Qt`E@UMq!HEHWz6opGrOMrxvxK6=z=VM`AIZ;4Jxiu=
zAEF};+7l8zq}ZaCUW6%mmZNF>kEZ%1Z;V-P=RY-ndZR`ks{$|3@5;oEzhxz+9GYB_
zHQ!MqZfY;`(CGgr{Rc4((rU%Gi)$^~Dr-s7?*FcMATU<KMRejuhk-TuvQBG@dlOW1
zmHD+o>=NvZilQrpa-ncQ%>2EU;OaIg@K?t5?u(~eb@z<@o4z!aFX7QR7Xy81vNY*2
zzlm9)&F^wL?F>4)TMqdVBDrTjB|e`p-6nrxjj5~)nUL+bg?c&6nQ}6W9+zgN(LNm$
zQ73AOnq|GbX9%g4-)mLa`_9DUqTEY5=QTrPxI^x@l}s*3(v_jXJ5)q3YDdlB2FM1N
zSOEHo@+J6+q#Z_!%PAKKRjV-AfL%~?NxNv$<tsFCyCVk)*(e3l{tu$8+u#g=?&x1h
z$<oA3NCKZzM@xr3W|{dX2^VE2K=*e~oE$$dH5$=3Mk&yeT4<FtrU8Wm#sdB>E}ws(
zh4qTcAo-Y$>obfx{nOenR<<dl$2w5%sOO^|QYc7-fKNpDXNwBfwhV13vf*vv&8sHc
zrWv`PFd7#!w~)shOT|91&cvQE^RY4PI6P1|{l<`qeNd}eXD}tD&P5?RLSG7NYpbzB
z{~!BN0+=1jd9>WIrph}EE|1WkQIq6iLY`C_Www~%*A-NGB*U-ZOKt0md#%V#Doz=y
z7#R%~?A5VgCY@x|j%e+19i7N-c4+2D%Md=XJ5}(aU76{?wp(D1Yrx!a*U4+nJH8y`
z;$E3O+sGS<#cj^LpJ-DB>c3ax*-+ASUvi}J2YO-th_RuX9;nNZbVhR5`_eA6bmU|B
zos1~Cp^<%dQCdcEdtS-iCB;Auu#RPej6CTv)GfDVU#s^RMflLJo?s#sNaaf;^&DFr
z%yu$QoJ}fOQVk!~cL}T23#=S`rOc8Voyr5_`-OkE`q^u>%J5RJw4v=0sCapN4_|lO
zBz<t}zpWm!gR@lEhlSXEc0@bTxDK0nJ9~~XlfTTb|15`*Q;>G*wAyqjhdB35y{{WF
z)v~oyMZzJPo@#}QI<`KSf{wPU;c&NRV_FKtbowLp1Y`Vnds}C1%mUe@=|?d@Nal{y
zCQN6*W~i`xpJoF{*A$kA2o7nj<PcxB7X8j-#c;6!1)gU54V#1_=`t}m<aDK^rFOq%
zr6V`x#oyt^pZ(oF&>I&WON2W0^&&JS=BzbWBW7;Yd(IM%=|Jb-CDnd-^ZMjQ*ozuG
zaN6KVpyhN`i5Ef5IolZH**b0VEW@y6OJmzUm@?C@ZudZh88gFIDL(KJGN3Kjt9iyW
zaj?T^YlZ7x_*QfRnmc4TEz{yGu0!mqb!{+=a3D<;8KJ{7$7~w0X4_WiGRzZDzn<1s
zE68gsW6ud%9^M|lw|xHqI+(qL3eDX;Wo?6{w`OL}!!U4#|K=up=%+UQ@tn%_+|#PL
zA%E9XEup&I7LJg|N@3C$#==11C?1)HVkUC*%J!4Z7AA-PfZ48-kl7MnTH1mj^vd>C
zy6-VZv*Zz+{$|-;QV<K`W&i%SKcrm<SYik|36{v1B0~=TfhOo;at=9AV`#zB{uk|_
zRe@&A$g-ASshO5q{y9*@W7faDdi}ecD3dTusZsRc93CI4KU@IKwX23(AK4z>FLwdO
z<tUypYsfc}vnM^-sVJ(R)Fn;CxRO{~)RbN8C@aD+y_O;68Wjng;qw27CH()lW7+>;
zz7|n3CN<lE7~y%SiOJa7D^$era-0%=MIg0ybniV2mK0l>`q;z=+Dkhqk)gWX-N_J-
zmk*e$bdIsG{Re@2S7-2)5Ir{Z;+ym%s@6=8+L<|DGl|;MM5yIZ&+1=_YinYE=w7H?
z0X+VV6#-aUT_b%a$Hp(w^^<>V3vi5@e)fQfr|h1D8PU1`Fm4wu_a-~jR=J~gL(e#n
zfI><Xh5GvGpXw~!3i6TWG_}HPE)gN?Td2P(kj#}nVXPt*{m%L8B>h4I;V`XJn=&;%
zDt~`UxO4G82)5?fK;tX+Wm>;JzRNAykwW?yK55AjQ#vv=U_nfTg^E|P#4)xB)SPvj
z$4I-cOL<dcOtVVIJgb0^+tg8}9u5w^-Wd|%U&G|_zW66vLvPG-r&Lr{2F>sx2M5wZ
z?Ad&4^TS?$*UXpc)n~SvVe6+;H)yJC*D8%$pRIiZiqH@Ot$|TX%h^3(nJsfpJAX5;
z?zMZ{aV5YBE-88wE96doYjYtL+AqVl!FZ-TMV@^vCR3tWbv#mJz$kW=RNLJ7NCg%G
zzPnO#<9S(m-&uj&!;VTKUV-4ttD>rrxMD;f4-0=dt4m@Ob+h8%g|=Unml{Q<Wu7tt
zapWELScb}NFV)&t=z9H!aG38L=V5CJY?%C02R}w!;N92nbt9v0Q_?JAGwIvvJ(qOm
z{30*sDyP3iv^3XABCTOMxy9-{OKKBgR|FviQ0c-@x6(dDQod(4G6}RlQ-%LdMnoUu
z{BT0gCHovEAY+>bmhM|7H5=m}X%N}H9aqLvt+kqHB#fYfZ!~4az=^xY!Iz-XdBuFI
z<HZkp=QW1fE{!E&NdAw?(hehMPC)&c=5D8MSDP0*Zc`KF?OU|M5?+ej2B1K6OJfBr
z-Qzz_d;X(dQDAGdC?W@cRPgRqJ2GNVMW_{S2&M2`g%HFpx}IAdf&W=qs6GCALq5jX
zCM?@!Vt(6@tV`y3Yw!pDHTFh-MnZv8??rqX)o3fOTWm&~Dsi8S&R+^7v>2}BBvi2r
zA}4BspP(BDZuT<yLGP(jSP@;K#$q~6*}K+xVUoR7#egvt(Py8cCGCF{zOrRD4p=7N
zEQPGwFk6H6OpI!IC{@i+=m6Zrv)-=NZu@FO7|{fX702Eyhl#fp1FJM&XrUqhL0pxj
z?yl%3wY6E9&mvAkXN3!+vgM^x*n9M(R%|jRki-m0MZPdj5&dY-$)94Ab~6Gs`lot7
zhdKJ#)Xs8ubyA3aFLwKfQ}5$5i^4SFdGIH9RuBSmF#z$EAK~5p2Wkm~%@AsM1jHti
zb?Uq*EC!3$>{b;X>Dl!$kF7YL((tq#)?P=sIOos&dyb0>uB(%F<W69{W}VV;D*Pmb
zfK8x9)?{s#w6!QoOD~1Bl$(=#6>-Y`_i+<^;yHznAJYX9AdPU!<ZxBCSZ<JD2KhwA
zx+A-~XP8v8Tr5dMx_B!CK25!Vb-}adlDtwCKMoIRi@99>o2p2V6gk`pkVU?s)Z_(C
zWg+R1`1c=?mk?`Xp1{?z$hYDt#0uhKwbpkGO-4^=0Am=W38>UL#DTtqq^ofBej6TV
zw4k+6DxUtP`$S$NhUoy^r%>RUZ&zJxb;e;aP59Bw9P8-wEsW*9s<dl$ZEzAW^)xB=
z3JIF4-2pQ=uN_92pjRQ1Y88j1^*&}F4HkB;J>n<qj^qkikJjSIuE!Lru6Z=!TlbWq
zL(Rol?@8@c$4G@?U;;4A7;Lw;+&>!K!unnVP{ZMpaz=ZO`41mU-w*K<(+5W(&8Z-~
zycd{j4V!UWU)cNDr^)X)*V^5h>BG`>DVFr-*!R5ya2)crf^+dNt%F<>xCi+j?p`T0
z<c`tkf49Lg5FCHm9UW;(n2&IdEU#Ts(=HQVI77?{rVl&gSo;(ZMHU(?m`q410lX1+
z^(#xuvuvSbI4m68LXti@owA4>7=6cIBG_ijW&AeIb-$xbz`@LpqtzLvvhn!ZAL}MI
zPWA`0ZA1L~2BPYg#oPu)C;S`T^uEX0TBWc>ak?amP1w5366pPkp|l~O{v(XlD^lqO
zpJGbZQ7-3ae=3gA-G5b`J0tuafKzpiJN(o*gxL#F<RZ<iY*Sm8!-(Bmvgnn8N2^On
zbzwz`UM{h!Ol=eb><YWYMSPJXe=(fwHaA=uXm2B^rN;kN>3<ky*EN`ZmtkpKb)K?8
z(%akyJSEBQ!9(%T%Z!gI3At%#ZRi5yLLWxiwxh(Y$Hr8)zSOHC9qf%Hw5qR6)<u_)
z${)X4^zY!f5s*}lvD^)wm%ho|e*^oK&yoTnKgidbAEfwX>&ogCn1}tzU1EJ741s1|
z4#SN5T`j3*!9e8LvJB2$tlL@qO65)}Q@`?@!;cPs;J+>I4>5m&LE*`l0JPRfk#=ok
zm_*YP73c@*Tnm@1xvb=!lNr^t&^25n!%U>L?{!&E+#BvsDdBkS5e=P@XZ|8G3Ef4!
zP^)!nhH~n93ya20TMG+1;43RlOz@)p|Gd&4T^2CH*ltW^ph$`8*a3YqmI@vbv<NNE
z3{i(O5K!=?%9!j-ID|=EJm63}3H>w=<4_h-g%W%7iHWrPWmT4B5+^CgR>!~pwYc+F
zZ-yy#=}xEiPbG-=EGKUE%O99M%#)6>KkRd~C<HqWi%v!&=<lY7<1Tnv9DqTh^ju%#
z?TtFe%TBNJBY*Iu*_etVO;bpy_>#GUbNU{|`65}9fN#@fG53W?{Ww<E*j$;&jbID;
z{_}_Pxi+pC{1zUSqX3LdDNt==9L}d*rhn7BE48}ytYVAKb&gjH^7S67=0UqnkCu*w
zJhqt}PU|PhDF5204UdE$HN{@&6QoGwk9iRyXMr$#*d&$}D_W8u=zJ3HEi(Bm;FPr&
zBMy+reom!dDAdo-nvT^PPfLeb;wqEi+70*24z6%8`RkhCUjh0#fnae6(ji+4u($yL
z$>0QEoTV^M9`qkXkPe=~Y{>-zWhdhq$Wo0dZ?f^qF3EIclM6d_o{JL!6^>K3p{F`7
zSYwNXy(KLIg-Zj_)Q*SseU7p6e}~a&U+?#}CyOEniDv+r5@Er;L%pTXCtSC{5R~@A
zXja{qPb<kYy7rWYHuPb5#G<;W!smMBmGMbgJ@laQgy~7=%JRYQ${uUR*@PSs@FfX>
z*r`SdD_M)uR10<MWx;WCv!#7B$CUBhd=H&NOL;I1<^0gd*PRoifzH->*1c}qR2sDw
z!#P=a7?X|IsE`wC;|p7*+4U~{q3C=cOUUO%{L2}H3>ml7!@02e&y`!%HQ+BDM^i^@
zf4;d{tGHo8d?pv&1&!_0_h>+jM(&R|p%K^IJ{AU`A{<AqobC%HHm@wXO#B2LG8Nt7
z2-oOpQ^n&Zvo;RJf~1_zK94&|v8(sA4o9GZpe&HbA{D!OTM{L)BC24Ze_bWaR>owA
zP&+Orytcxfh_%%GdFM}$e8h(i;5faitr@Un2HrdC!adEn=&e){sh_O>X@Xn|L>r<p
zW*gF3E^U_v295*GjRid_!w<r0@1~s5-nC2~W>{sYyCzV&4_(M(Umr#!n5s`wnph{G
zP)&t~E+npNgt+Tb2jX7Z_H4Y11F|PDhE==jLVi?Y{+;5u7d9@(zdu?e*r*-v1}xlL
zmZoWoB^8N6k;hBT7Po1vgAdSq^Rb_=o0^9K(YlX7>iF7%l4RJRW7#STJEvib%OV~q
zcawURee3PvhB?4(JZApsoRtv&*qHzC_gW_G%N)K%wR6F{ZwDH@LGh`wJ{Ll`O}e7S
z<eAUZ($nk2Z4+<G(ybL0mL|nkJVE?<`D(q*X{aPHIov#$q_e7hNG6#$!AuKtk;COj
zfo^uMacB1i*`ZNd*bD3ZbVe6I0$Kf5kAY?7_F!jVm07rkaqM3NQc-IseS<s7VAsnH
zUn_T+a;SNrPgN7m;N(p1HJhGp5wW=B_MkH=cPT1<ZKV_Uh~U;x#!GN(krdm+cQIAY
zDQ;2irtKz7e+*#qUNS&`6I@OeI8F7@8Y-9zV=wM3!J#ruz_#e-Br~m`VFEpsZrm}U
zQab9ew|XsH)#@9iQ8%Hn|3W}Lg7xLq*xI6s($TFhsi9%Uwlqxe&*}4y)jP&H$CuM1
zUR?uKyDyt@rq+zySI*)x@kP#Vy2AGM1&)xR?18(8ko-CHsHT4N0&xuCK1^0L$uq-D
z(=NEPAaN@aNN{w8vosw(o^}DH8KT%O-)u7t?_U*$q>dAgH<yGE^Gsl%%Ni!f9mKJ+
zfg&mL0vKlLFUw8!nU5OWY)`s}g)Uh;(<*18lvko2&-P8m&nJaHjzUy$-v9KWLag);
zbx)TcOuFUkDJiLWHF6`6Hdc<xJbL7L^58FjSCQmI1zv|lgJ#mb{?=~87w<w)dekoq
ziSn1owQ*m#bP$G4b{RK!IjSTkEfM*hP(X=x+BuSs6RoHoM0AfY1h(&Q!J?QhdddC7
zL(|u_tAh!#>z_983m3#%5HJSMh5t&l;o73DuGOV#!uw5wP7-uNbxQX|4^^i_{Hq8A
z1+5Ps-~-1QhxgQ7XggsZ^eb%EBf>`^p}0x-vO$5zF4B0t_XAW;*tV|W@6)~!vi0iK
zI+TK$CsmoRCm>1&r_HDP#Ki+!XO&&J8-+Ar0#fijsdV?;ojgpqb@fYS8Tud81K%((
z!I<{2INNfw&w0DadFuWjR4Ut1FgD+|Ix{TaD>BgOo50}D@ZZFHs2GYai<uQu#2B(|
znk<>HlUiTF9X`m78YM+>3mcl9n*TvWPAz@?IR$zhcXS#|?yReF@vOS6{;|f*q2-LM
z>DP^F@yLih=r<`{=H0mely?-b7Yn$S1^lG|@3N2D5ZQE}RP|=aj|UVJl@gw80x=zI
zYUQXsp<(5P?_v!PI*wC)NJ?V)mYE>o7(<bhj^bNXiP}rUa%ggtJKkSmx^L;HH9j~`
zE+y)%M5f?w&K`L=9k#3Ym3u<r@pn<kP5*?=PNRotDoOibA-MD%8T(fu?r0Gd<0eVR
zN5D!G+@eKpnT+9-4G7ln`_H{EmQ3n3uX)7pbCI(iOA?XiT>EiV0mRAmMo>#;WlJF+
ztKXxTj#X)zGRLUGP!dXhGV#MV^~!GPi7r!K$F+MILnL5)vgqsyt=-x)*!{Y2O`P#*
zc9eG9h)_BhD{)voo*HfqBPi<Z42%U-F|$e@z#SPBT++4SeR#ww84at%x4%nk8!cdw
zVdl6FKwHdtk7Z@U8euK$+S3wu_r}bh7DiWA{NLYa%<gyFPlZ%wr#VjpFklr0d>Lx2
zoazy>#su~(J2WjanXV3V)glj6FP(BA05&J~g0&6c!8VfxKh4534uMbq6*w?emwnK?
zynXl6$;Nb$Ut=&>4Q@JR=_LQYE*tmCV(2g$+2;4IG*|`plChG5jc5M@XPh!rW_{eJ
z-<aGMPN*!o!Og{IG(7vPG?~U26Y!q8nR%Au|GR1eXWACMVYzS%Dn5hho-DDn!*Ul1
zA7&PV)AivM<-Egl#nKh3oX)k4Ce}q*uu8tA`Z~-yYEeP)Y(vWXMHClz9?A3A>oAYK
znH5FwEUyb+NJyC3ZOZKu&a8SO|C{^q$?(hL2qmxnl>X_E%ytl(=)u`ao{inQG=Yb?
z;4_`GZ$R(w*RJjgwN@Tv*Z%F{Y+W%Ar?YyZK(Es2uyh$mN)h=8=q56j+@+41{Y-gk
z<Tg)CZj`(;wUkb3ax<qInSsNAQtQ;=SaDTx$rgiK61FLhR-JqG5oiskb}qX9Y+siB
z$_Wk|^QQ$&5<|AD)w&~%KQP<PSVGA4A?KP-Z%fVE+Y=Pfc=kRYOz}WzqHLtVz+@AF
zaHkMGZ7Lk9jk5<M$TouGMfa3lA%v8%8!V<vJXosR-t|$wC7#so#bW!`GsnF~^T-GM
zbD`9!?D3j$8#|u#?ms7cchH`8ZL?vPwf+l}hVJb|854tTWnq%G&BQO%CWXA+$0Bn=
zcD?$}hWvgvm|zmrD5pOEy&<D(iTF%8^pxo(9N&6g<c!mLnsjV*|5N*4sK=c&d!m+P
z>8k^*j`8_+s1k9BCaw6e)KpwR4Cu<{)#Ws3eM7R2XPNEA<o2;*h-g|vH?d(<QD%-!
z9cq@v_zwni2f)25WNI$4><%uN9dk+`MS;o$!U*D10rI^DPPLzs$+C+e6H3)PFJFV@
znlbB+yg9N0QI7b~b>zo4h&j6cBD&e%p{`?-CFB5{7?Ke%cdmUAQ-dd&ppt|?i*Nwc
z0gA}dmPmw)QLWg5JJFNQYf*OQKGAVsxho!j4rSC=&%u&zZ*R%E7PTS}SBRn`&pLw=
z_aTn8Xpv@ZeY3RtqoVt2k|jz6f;dC;sF-j}7h!B@bVxRauzuX=L?<7NMLzD531M99
zidEXc<K8}0Ep6KagMbCLE9@FYc*aVEa2D7d0#g1^8*T+)X95)wl%)@)k5nc`0n)ep
ztE_8Pj(1utQI|}D!hM~gG2e4lI2WoylK%v+(*-cKl}r(*n0$38=7pk5aBbC8HHB)L
zOt;U-)FHQ7k~hTG<1?(svI*&1!5`PWs{@Y5-jdNacPo5CCf~OQjz{7HWYb^$I+fNZ
z{Ksscsb+mUR(e()tZZtvnF@cKh|`A%FEr?HZ`D)CVQQ5R(5<xVz)tc?(D1^_ZJqSp
z-RY#YrR6X$A2b34;yqY`;=0|dXIECNTsRa3^p(8&82!~Z<!F175_u$4(#$JUB-W)h
zm5p+ZLwsPMF3eo<V@<xb)(l~rG=M(9d#oUJ2O7zCCc?&AKG6Bn7V{n>=2;ebEudVt
zTdG83&qV?cU4}+MRFuj#Ob~^k&Jj`1fn3Z4dCc~zv2@JuLh|R(Zq^Kjc?bUVq)$-P
zAszwe4|{`~=rPxGbCLBaI<{Q_8*?9f8kgbxj({daK>p<p5gN%UI6!>X?xM&*v=&3;
z>vnG_$S3DBY{0`5YCjVeO8PU6yUIh4*&mhiigSA5L}xg(@_@*q;zU=2_?vFbgOlqa
zhrC<6?YZ#Zg;r+MXz8e>3j1t=$d5$-M=B#~OpRDQF0S@TXZ`@$wkBUfHhcRzrupfs
zj46k(u|t=vH#%ue%+CDFXJp9>ZQLt*4iBvJw#GO#^H@diUu`Ffu`(k|a_Q02$oaF#
z5o6=PR_&U4t&~3z>h6u*88@kIbc{@MONS|?1`HmdEF^_odWT1IVfwf+$Y<0GRg5-~
zCWzQ*>1xrbq2mMj;Y=9f5Xh*ayu1S!lO;|J0)-pI1iVcqpKJ#gd-@PMXL%g=Kt5jn
z1`dxvUfBCS_Hmm+b*deQTp3hx9{7xPnRDN>D{JZwZL=hhn(NP4r~~<E>TuRbRyad4
zcIhjq9Y8o(U;ssMJofVSs;0A1Ze-gn>qUkXL-cE&&-oP4(Rj5}p-&#`k)3_8YtYB1
z*C0hShKx~XkN({mpdvD=;6?x{1?f@7@3RqrCri^`zsHSnPj9HKU3QYjM+5Q;S7)@-
zM4>j3@o0Khkjw(M_FcJNoRys!_oert)7I6I(*!1HJBlTUw)A+J;>OPo8ImwBpH;sB
z`13!Pzq-#XM<0_lpc?eB3C2xcdIY}1`-HL`IDK;6bSDtM8Rjwl`L<Qzg;?3#&dVqx
z+PijFA%kZ|oXl}#@{&`(^_Cm(S|(6|4wJz3tuj?W4CubGjH-h6IkfNF*JqH(L0G<D
zS!MC5uQE7e3js5HcKbIiS|eFWKrsIuU6<`ybaL1AY^9nSfrtQA`>pFbpoC4*hHGE4
zxBb~i9->ReDIsFqGwZC$J5>^jNz13$!vf{nt^_Q`BVwp=4Lu8!pPTBsO;7`t$<WUA
z8dS5zO*>t^E}s@+h$q#uM#C+X?-&?M#4i)t1WiF$krpp>$uG|mKMRi4CqNrNb2mIV
z!OedkY<(Jui;Hb!KTsn*wRPTFV%Ch(m;7@oofOUr|LIXfB%aBXvO}akZ1w?pOZxl6
z!upsfcKPSXHrAZ+=*zKE1-BNP)G#9x5V8$8YamIJEktKs31{WGs4$Ww2@6eLK{sc;
zlfI*2Lae%ZLfG7X0})^sr`(l%4WA{|*>ruaDNTn%6o}*>Ekm2o>%t!>Rp)VDIYG|_
zvER`8&X{yw-N8~<+$q_}#<|6kn#+7ai^l4;8$EA%!vo5^w4bM-@*gi>`*%0WP`^H7
zf*W}t!_BD0reX4?n#Q|n_PXEswxKL9CPK`caB<vL-8bCJV4BRd7k?~@4%Aj_8VZ?C
zn#RbR?12k?H|c*F=_wir_%`G0T8+HR<7-+g5MYpc;DISYf7;cUn$ElJhE|Rfa+9Q^
z7h>V^J()L6x{EDd93#F1ZmvW*H#I9ZxignnH>x;bKY+1MS;dgyGQG9_U4i=P#@deA
zMEN|d1p&+ccI{WN2hjnQ_gm$xi=0CAj1Tcp*amn*RwDa<Nv-#4XxUTLvG>dZO_D50
zxeB&`fZ`9llX*Z?^(}J9ESYNrm2Y09@jG~F8c2l54T3OU0nItuo?#<Pquj|H_)*kH
z^N<f5<?VC0X+P{vdOX5axy%_|A1<ceaZ;hprKk9<ugux4X8TdnUtcwPm<Xa)-AnXJ
zlj+^%IB$Xvz-Z6LZ;c|e>ti75imX@sT4;o+Jimy$x8(@eSkrR~uRWQ+^QtXaxXB!8
zTL&g7?<+~%<cyI8uGkN~Vo;z^v&=bwFfX$Vo}DA1h|l-;N?|P0fU((BcVN<bAVzYz
zI_bmB)Z)uS8D#@=L#i??6x+oTcz%MTC?Qypr*jt4nfboZx;_?2wzCWsWdLqqnu<3*
zwKQ$4>rR!Hx&4~j*ujoNrBrG$b~l97*r)%K4%Zco{qmBx(L@te7-m<*6Wdyq8NWWK
zr1lD&@=Dy8atf?Jk<HbHsyp=mJutRSkLc}A5cf0NCPB3RuC=?7cp+B7dSpI`!2U&G
zh7}+k4G&3+Zw$+NP$O|1tuOi)@e<L(_SKJ`c7vB%6B97p52Nfp_W=IiuR`d;`2(1Y
zU3#ek7+eIZE4r~nNJZKarA-b%l`}mzc0|Zf96$X`2v>(Vanj^m)+XI9f8z1Z>3_L)
zy#q6m$9tyZtX`DvWbG?d+f~KStR{RQZ#d2u=Z>EBwW{Zd;)i9BTzDoDRuXyqvVv=<
zI@_;hi^#nfnMl6_-^B)WJ2#Xljv0bij(7Anro*Ub(`H2<v5Ohd-PxtEL6PM5)6Jh9
zBw|I}2)Wyw;-%8z1Bn(6imoBZmHFNFMFk_;nRRv$8Y|hqUI?l7@z?@!HK2$qT-Qx|
z^CEi1pu-}{KVGWWnIdc$t2ibX0^#Y%{j9kJgxfkVkJB3^z%tXP`x@ZBCUZz@JRG$>
z0c2$z@&jWSfAw%ui93`)gUT*pV3v%DYup$!S4aj#0;lLY1!w^w4X75UHR=zv79ytz
z6L*SVdoWo@+@jy-djAf3=pgi{Sg#ZX=;?)FRJ;(o2&GPsc2JkO%!oX>AGM5v9R9#6
z*ww1)cfX>gO3M}{QpUVb)YkcE1X2@<Xd=Z)t=6D#%J49@s}pa>!?=>l_UN$-6^})B
z*TAcV30Q6DO;S@aLJ*OaC~d#U9Qlwxsz^8Yw(dC#o60xg4A|NVRH6@Xeqh}p97jWF
z?ZIzCEp)}0)mjzW+F3@`rZ}RFJ}dbcU~5uEvQhb35v{0?k{BA%mfQ-AXt(z4?OY4)
z&rhG+z>%9AT7$>P9C=N96S#4YB>lAp@8w~fg7QYyC?*LXQB;#t+}qlC>eCG@xrc9v
zyWP)jKP-E4-2rW*0YMsS(Ph1Jj4Sh7lDn2PQXZp8-uGK08$QiWMGYALsL{~qRmD&k
zC{Uj?zwI6S)+Bz+m`fjRHBjeaO)uF<9xrU{jN;L%u?Olph0UcgFpfhMQ%*6L=2}Jq
z&RsOF%sjQ%QTh9HBx+h#@!Hw?v3oh$vBFeNfS<R_B}j>q>^genL=qCQ@f%J%)R$GV
z@N|XqMX^dmMs(yd!s59!oWo*5q+(s81#VFFBf5K<m^xZLH96kbrRzDgZeHGqO;!T)
zb53~3CRF^v4}b%F;*Y?pw0fSX1p=3iWV3dDYeBJ>1HV_7f2B4G*DYFuXCZ}rW~CvC
z$KGG0+BCy$f3iXB6PS!f^QIC(Qv!_v^nDd&po1_m4ih<f*xDJVanFWQU7abW_Tcqt
z6$&bCh?Ii__5+QY#qE9ER#}oIkTdZwtfi!tYR;Uc#^qly4M|BiSovp5|HxoeWe_A#
zX)bjwYsSXtGH-DfA%mrBJwqs{C>hiV1~%~@YN#98LMT&hVoBfsgYZEtVUCdzWn9&h
z_#&Z7&p-V!Wmg%LI#Ywn_zc@NPFj3_%Fch7PMKK(7bQ8|Fw8Y6DX56{MSn5wKr9wo
zQodHd)|YtyP`-IPQ4%@f^+Vg#*c3R*5mG<L)^=`v8c6*I1~DmrFu(sVS$}O{{*_UV
z3^hbLXBk_=VkgJ!>Xg|kEHyArg%Zjcl_O}E9(NoUeZ$eP+hs0*ER7*OqM2>;KZxsA
zqAx0!cQg=}R~n68O7bMvgRR<M{^~x9G+E2jH4$pO?4z_*<&F$d)b5)c$bBUWV6o!h
zI=Yoj*>#nPpH$|*6Zs4TmV9~Jf)d{QezJ<%=B%4cEo3RunlVbHgnSNb;8XbGFl!9{
z23pJ(Bg@|7X*v(vPnc#p8FzSr-}V6%@>!(o;bnd#Cin|}?lUY}+{v<%8qf>en{@7<
z74<wmo}fm~?>w_kNeBA4+oFa_$~z<VeQevS{F~kW(LHwn$+W3ilkhQdV(_fT^Bd1?
zK12}&<g01{Nm0uHMGMN0_~;+QrY6d&9usFLpD&v3BQwr~=IX0li7{j7kNkOn3XGdJ
zDGeWd$s7~NjE6Vps<2c%>OH9=*;a9B9JR!cIm20y{K^`m0hQ`mrL<#{jx8KHps|KZ
z@ML{(gz4*FNcJmOz!*1uHuOvSYCcoR{d=Mdr?EDeuu2Gu$AAM^!3Qs!cBBq%3t^ku
zvX7(D$88I0d=eS{u&ssA(vMw3+4B0BtQ~Z1G7QLTRJf0Hz6MhW>D^l&1RC^Y3pW-7
zeusiSqCTy5F6-O7I?a;$Cp`G2z|x4%tk`b`RDdZ!z#sY)e1CiQA&kA)hw>}qS~+Fv
zvXPk1ix|iq4-qcX60Yk5J>J+tifyx`h6kw3%9S=3_-0+Cm{pS$3PQDuy@yiyr+dZu
z^-bzkfhpI7>D;^?{k_(QAzOt->vos4zvQTa0e+U#sW=L*t{i&}tejvBOHF4sJ=X2!
z`*G~HUa>S0V-i$Oz+~<R;z-Q~b(^YeB2x0-%$;W1)L*e(A5?iIW(3vDP~$n0o{K7z
zRS=LDvC(HJNJ3=xHIB)~yIl3-uX<+7tV7<F4KX&3RdE#h;cR<AX8RjEHT70{H6Er7
zQ?!Z_1#UD`v-snCO%mmkr|MI}m8Y%j0%~b#di`0l#i`k(xkHVAjQy-y7A;u<Gf@gQ
zT_=4mFoiJmNU*jQ!dHKD!Ep>#{A+E!siDEmbZRPMo;iS!TdiTZ00X?|GTt8Iu*rQT
zH`bU1z+La>B|h;<x9IKYrq@C?@`MUs(zSyp2N|S85VRkrr|Z3AF1OwAB{Q*{y~~=k
zYcLw85P9_D4%8JG5_#b9^uaOU<lqNjgTL4shfXA_?au}7w`ul16G=8897$ex%c{S<
znG}?4`Yds?8HhSx2zV`&zmW=DHT=6BQOm-e$XIsP(*8d59zhkLzk1fma2POjW0^qo
z<j-S&?7r{5uDznl*?4#sz!r=A5@M*YZEt1Opv_`s6C(?*UF@s>f33Ftf8<|%Z(4kv
z+V#s!kj}Ei8K;G)4O!TGztrzWO&x92lf=&q@V90ApT;(za~L)5yL7)ry9RgWv~u0`
z*JXF7$+c_ok6-^O*2%dR1(z)zC9ts5o34o2V$+R4Qzj68GUeqrGE~wYwv?pWM_K<c
z#Mb&D?Yr>_jU&w^A_T-S9p+6-C|KhVLmTu^cm@xN31h7*w&T8?<Zhj#lgKXkb5VOc
zlO<NjRG65HQy&oEujRJb*h+Z8h4WQ3+X|PidY?J_;r)c=o4Eb}t7~B?<dWJ6#y}|F
z+oFo;iJ%~Tm1NZ<e-?6&1kGjO%v@Fn%MtL{Q=X(_tUNiS&ixVMnWD5J??n}W%dC{f
zv>6|O7_jfSw-D~15NfeEUEo(s2n{p5dEcmzqwCxpL6%0op8y%~+>oV;c-5(!+G>#p
zFyukn<gw3)osquXZ1?}cb(@Lrvh8j0rG(*10?}}cPaRE>iORv)kzbkp>bl-)A=HnJ
zZ;<n2yOAzg<K8w1&O;?`+qM``r_F9jelgs(JmzFpO5;EldV&?D`d5p?L=epcmBMN=
zH|<Gy=t6=aMQu7RY813hWRLJz3Si7K)j;e)AWjG>qdnl%$;wQUKl@RA`q$`}&kS4u
zW&7vDnnK`Z5vGal3y>$^R7c{+4pW-i>S%SL^dFy|$vCaa)Wcq&hA8{wpv7zsG@+x&
zL-Dt>mpCOO>x@|wit%%J$75zCbveso1S4Z(A>Fzfr|Kj0^H#T1=`H5>H?_3A1AQ2`
zVMzkf0n+d!K5A1XJEt<0(VV@Ye;0a=$7vLjqXcJleu`MxUWaa^5@H0`#wu7miO#0K
zP1WrgEs_<K*Pm?4=;XqoUr|$e?V0J+HKaFtx<l<@(Qcw^BBEL?ejbjdjcBCR{vI|i
z_wsu{h0sG2_;C5bf}KPxLsa$={-a@MOT1X>2RM~b%bbN5tJg~)J@J>IR>Hh7;ju`J
z_ndQzz8<dOKZrM<sVIUY8$UeZ={hB_u_EA&BV};EFGJ479XliqEW|mkZbSWrfQOFG
zy`FF<vgeGEZV4NJrP`5SL+HgYAhbx7%WK-$-tu`gaj8ZUtBVdRl*>7bjeCiIee8Kv
zNStCUBhaL?a|CVD=ke`e$h(fFa$6?j$P1IbjNXyxNG5RSx$|-vbBwj3+{nhxPPC7r
zK|9*kM;k<K0xbo>HM~%=kHQDQMZ#DkC$18Gk*J{4QzG>amb%cOs&D$=_&SS#wi>Wm
zhoZ%u;1*npyHngHIK|zAOVOeY7K#>WaSiSi+Ts)|#ogWAzngz?S68w-n{1BFnRniK
z*6UTcR=#S&c}j*n$|6cQJ?9iqIZKN>#B`z{VFE^PlxO5B=CP3y{@pR9MFkK3P$H~j
zYDR{kD$?M>OtBUmk{EurHA_54h%RPw@|&^CU9l2k$Nd$w45{!NWh*bw)7(?znUA<z
zuqTh@Tu02b-~r%1Dk1R-IOD*g%{v&<>jSt7m%5j$rUZ7Xw-~kTAos@R<%i>c0JiSU
z^8q_-MiEQpf34$C=0&rTvhM`KM8kb&KFDFFVQMrg%Vxb8qfuJFMyV^WpBaYlg}a*<
zVsx=M14bSLW~0k+O&#r%R=F20qCoDxcnr#bAVcX9P+qp(sm#|*t_pdZjG)O`>X`={
zAiDFYrYM%H+XS~7`|s7+aRrz%YHw6Q)4kG23pE~owgYU6BLLa9O}qA8%AtZJ7vbvr
zq}7?-tW!{`-wpYEsC})HlLuCH<{P!DR!SUWz|F6Dw=G>EN!Twf39t3k!a*yKc<Et%
z*u3yUL!8ZWNdxW`E$M4>J!)zB6=UUlv^>@Y5MJL}9h}qe2wA4yy|+6dFt9Ondq(_E
z(js#Lh5-caEg-Il#^LF@0)S((6Y<T#YA7@${d25QN@1O;xiM$n-yZddNAO<>UK193
zb=5;mRsdDN*+`?6@}9o-pD>7$PTUp^2vT*WINQ>8f;GWWNyae~N7aS)q!;OH?A-!$
znqQE18>fj9Pi-ANg*B|KAd^%b4)-qeoW6r4l~xbBp<_pHBQ1<%1ma>zi8<U>d8Lyl
z${;EJBp68xxn%0hx@8a&y;>q!axYgBfXyX1%~OmXuOyk=Jg;c(Zn#Zm7`pBuX}5%?
zYqG8~MKxL5Iz<V+sKOK+6<>;#?+3o&=;tBufB1%+AY5hnaDn`;s>*2855S#pBkXrl
zEF3{BadZia>DCH<yI@ZZgZ5m(nFbU?6_5zc=M?Wlegp2TY8I3v2M>9D8*^`?v<!CW
zf_Ux$vUDCgtXXDYQ10<7Y;z9#(Fkv%Aw-2I&^{e(_Duoo8jcpU?mZ^A#xJ-y90UDR
z%(iT!JaJ}VXH5jKEug5iX@(c&U-7$#Eqgr}%8ZX-W|v5ajNUmg#^i>#{$;-uh#Bf9
zL?I*qV(=y^X8SVqx-ed1e0l}H%^D7S6H71SV6~OlqnE?|v|%N3))6VuUNEFnZ;&-P
z5@(uCP}g>!8kUnw5XWVs_;WIx`mkvy&%sA>uaCE2`n5;3OIwUuhU5^(&{Et-TS&%~
z2IW{f$U*29vkbG`S3-AWchA*uuN-;yHNL*EpJJd0^BXJTYbR&75<61xT|sP6$~GyJ
z0B%KIJ@VJ&4ISl3(bR>!@PX2S-rrR?M8jvTKzx=*Rwe1XFcMA`-s9XWvE9Lfm8v(y
zeCVP~q4=7;qnI)M3(@;!<uTEx3A!J)D)uF3)9RL&ei_2}5y`$j8^Y5R)`_uL3sn~d
z1lNTFNcW5xJUD$_C8%r6)Xhxk_ZQdmD)f8E^HGxHTQ(P#>{2J!0UYxmJ^fu>X@#A2
zjq!zvsbET=&gkn+ukS}6pT#BMBm%hewe!KdY+*^kiEt1&Pbh1X);_#iv)d-CFFj2k
zmxf~fA7J}<VxA;Ngl`<L$4tdjYXzk+`TNA4Mr_pilPy?Hxvt3iPx<5a%xo$nMP6iW
ze5E0k^#F<3o&~R(eWIZam0ZUuN?XAE$2ZL@3cnA)kC<u`?nOTYY-mqO;&k5*A9L0+
zlg~GjSiq-KZ3J33SXvWim${2FuvISit_~FW8)hBQ3%jZ8#&^6PE;KiVTL{cJq^<XR
zH<3ZK>bm`T>BmQ)H&Sbw#N{iY7C*$aE*;?+3JG)<wm6tb6J`kONFctnj%k%6y2bvP
z(fdf&U!0BZ8%py@;@E$HKfJSp9)Cd1H78X9j+P-*=^}bLBi-#u%DEcu=jvrh;YZN$
zk1m<~pv;x5P1I)WDvVni#9wyJRN+#R{MecZ4CqMi4Tl6lc1FH~I_V2LZtH7*uU=g>
zpLn}}Lp6;yUpfE4W!G<R$3TjWzr!biR}&mtpFi`i*^JwGQDn0%Mvp4BXwUTx&=;^r
z^KCArc{?JmHJg%p3XRV>7Gvu!1Udf4PQq80ToNC43_B1NevqrEb>;NGCTO#E2lpb6
znd_?(gIE~Hbs|aLueLMXt=ZD8*yXoiWkU+pFCya@bhLSnv&Ja4239DP2&G8U-}nC&
zk!0kNZ1y7Bd|J_g$;}cbQcQl0PRHN1>m#>qq1$^`BnJ&n1oeJXSz<}mmO<CG#BC6J
zpFk3;c;YR}%NiP*flM;$^hcJs3l*16y1&zF`-J({+#AYiZAM+6Zp3Lf3p1I0PLzD8
zHNRayeSXR@@@sG6e~-Z(p`_iuT#ymQe%k3`haC-4h}D*k)_1!REb?ub6YHxpv*7B|
z8Z%4Kce0J4U;e~?ILMzkc<_FTLxt)copOrbRA9uPs~2`sucszndHSb7q}14K@z<Vo
zc7wRZ<uO)ldwK%pT~XGTS6}{IPe7fclT1~H?lRXTZpM!n^nL-+f|c8U1x;4#L3p(X
zI`KJ1aPGWI<GS#?i=j}{>Fwz%4t$bx;&&TEOE+VFB1rLka)lmAW#66~%?|Z1>N+L|
zgoG}K5FzIRkZOcmv&%0tfLPkgF3eDvenP;Uaj*TQ(va|-bJuS&iRYGA$Mn85C=Pp3
zW~`pMTSG^!g;TIB!RWf>UVa#DVTB*f?IVYxv=znCm(a*2JG0;Q*M4iXpFEy1Yu+3v
zeu0u(h~F$_4q@i?|7>guj;A$+ydOmL;ncZ}KbBMMjp-W$?~LRnB&W{Q$|UOhB|J$-
zlivQ^1{A*cK367q`=ky%0Uw{JMz^);obm01yE{vupBZ}cMvWA^Ew5gV!yNYyd%vLw
z*oJKjO9g|*UvjGXs@iQn*^w_HNTunVBlSok_FfHQ(6nvm-ug&VCh|?H@LfC^ew|?`
znk~o|IghIvPq0=}C*J@K-zLRmynFdEF>b~H9o;qLsCqU{nZj|DFEPs7qDDv=D+(m9
zyXPsIpiBuVoEzmlopq<d5qvMxv^RZ^-|_OJ4wZu3#wMaFWSU}A7??9eE3%aC#n`MC
ze)%yQQ&D*->{)ND3F3i$(VF1|SUgfRX5V(PAf`X2Gs33|C9jlBcH_WuES~xn5;Bn_
z(XMYYWz92ts+2>~a(hCKCR--{hO%I)Q0I%S7CX|M;gwmv@wOiNUGG-lJa$)ON3k1b
z%Q*=PJeR_8W2$X9BKaB7$19Sxt>7e*2FH~F(dH=$*#+M<j07F9cwZI|yCjiCWV{Qc
zp$i#7O;h~TmcS#tEA5<+VJ0$khyx+O5=XM(Ec@o&BIWDl&^hoW21uf$lZ$DepAc<<
zSK{PIxRf`}xc}zZW0AR<V5;bJl0S{1aW5b7oDukiJ-&an+;||0NsRP|_J;|9;uf9d
zgWg7exv{Qfo!ImgA#RygWT}X68+oGKBj#thj4iXc%WECr8e&&IK&ID6lm-ZwN|`_Y
zj4#aeQ^(A+&LH3;=MCSc<By(^TjMs=;MtbhAyINb>ebdu&Y2Ua(wq_IJ){Ehp}(e9
znynrq&SY#PkRfwzRHzAkza{wLbam0^xTL2&UpA@`AWer<uKeLw)^{lH@4;X!q@&Ey
zlJ#H6<R+rTX(jrV-$d5{RB1UO?-^J%SXE9l)LX)qfIC;KWxXf1roTT9TSo(sc2<_$
zzn<)ws>YRlNXJ&hvI(+p<fyK=U$c5=102lwb{G;nY-fBvOzOm9Z|88tjD@t$Ter5S
zkuOT9kjzQYf&~=yFxY4Jmry~8SzYA!7M-uWq$w-WJ4VoAPTk#^P_xBT2Xk2@W0QHW
z;oGQ@L86r!%7X6zc|cJY@B9z`Y^n2-ea3C6Hc_YY1a!0y)bX!(<ua&8#2-#Rz5fO_
z$6~~jMlv%h%T&TOR^!n*Bf{(GMjoB5PF2FGRHBG}Psd7)V2lIuP1-gqZ1I@Jy+#i{
zQ3H17eCA<-@xe@BbysvwunNC0Q3US_RG@5bgSP!a&-LqT5|7kA+qK9`RjO&P2O}^7
zu@o?>={0Hl@b9qe+P3$EJ`r>fD)+D=CsDJ1&c3zZOZ!7;|66hw)*Fn$kyK`bLq4UK
z(IC699J`4?vY~>>$tDE*@P<85>(nKbVZ<-%j#U6=*l0#HZJnb`qB%U+W}0YLr1PMs
zhP0*m7k1T%09hZmN(<!Ed(ST^FUliP65`$MX-BdV>Zj+avJ)#{b>rghN$Gbp#WtmQ
zM7BMqYB(kQ!3MZ>zsl(Dd=}i#p?Rek5S&*eBg$xjn7{n_gpoI8iWIR7p{*z@#Msie
zh*m@e=cVr@(BT#?-k#(1oEY+TsBjY7WS6?{DD-WG?B-`kdP2L>?WAvDQbNju)7x{N
zG!9?NXK_>J*N~qC-a|{W=Xw3m?FP_#`{w9Y0fC21-DLs-_DD+j<#=W37rD9T=uswF
zwpI~o-5T7izjM)S@?HDVWThPy16iLhon_XyuUE57=D+YaPZ<m<s{BT#P<X&9$kq)(
zr`J?UWY-u`nvmSRrk%TnKeO|vB_#OgZPP(>vF~v$e)ufUvogR~ze*er<sT^}l?}1{
zPQU<9eap>HpH4S&9$#RnS`kf}lItO-&=1Uues6ASs>tX7`i5Cq#ME-2`T>b<zce|P
z+^Hy-(!UL+B5H-UaQ|3(SF1_J;jt<7?itf&d1;AHA-8^BF^c5?Yz{w_o&Gq5$F=<0
zdsV^c`AVGv`tY}X{m}m5s{G9Tv!aRLIQQ&r#t>2(<zD+y$3JX56G$#x!{+l+cI=B_
zHu%}wKaAT4QKhPEo4;kuNI~M+ycR4|w^JB{Mg@sHm6z6Q_`y(Jt~1R?V|i1q;O2q%
z==nb1Ib1)zSAV~ukY=4H3YIBW^3e@-1W5$Iwh%w1H2!&pU!lZ2C91KOSD)<Duf}DG
z2Bfj#G~~;E6dE<nh!jF9wLcF6AHhyFZ4#)Xi2zW(JXo*cj-%p($Z=t+_WIZYlol_~
zaWAI$C9l?Qaf?OnKJXu-jAq=lEzDDBwQbgHjma7AN>=9jUSi3R@FV)3K(b$gq@u`Q
zU#b=~esD=NRrn#IQza;Hy-9bDuR35~Q$zQ|J9@lRgCrX_D4e%I{TkjrO3uo5@3Zq;
z#e5;jf$_i-%qF5yRqsW~wyRoSuJNi__nw+5P4*XG_uGerW}G$RmRZ^On_NKD2Cdjc
zTjZ;u=Yj2rDWmT8YdZ4aed~I&lWkd~_%P4Mal>wdD+{Y*vZjn>@kNxnHykde&ApI;
zZ@4h6>5!xOsw<I=dQd%IeOwGmDhzPc5@@*JyhSCtmq79(e3%s#;I%rwMbn&aOcWK-
zQYq?eQ|TuX6Z|r>$XZyziqK%%|L;CQ3+j_IvW|_}I@6`dBM4ByvEA>N#h;)n%B{0T
z;Jkpne1<kehH5||$f7mZfXFgH-@Qhlnq+#<+N+or9tz$$^x+s1c16`O6|ju+#=K>i
z-?XdNIN3_+Nn!abcDPf*feP2LmCT|so1eBenp$)+@-MbaB4%{u?q!?{E8$|kGg?TM
zSN;!RLw<<sFKsc^0WRVh%nLoC@!lNlD0(`tcucPZIR+%Q)S<lq{_KS*_$>*O2@}=-
zoUkLGpc75KdSOdD5Y9L+^0z*NiP}PF3wHj;GmBj0%{ID=Ki}0rU(YwX$e_@_zoyL=
zWSd&85_)rv4foSx#MoXz*g5!^InHi){8pz_Z4(Ly4|?O`miXJwOVo17dxDArgZP|M
zSOJmAbN5xLbx9j!hJi9V$wcGfkcNh-)yW=z(pG*15Sf;+-4n^wu_@6cp6j|;wU)@)
z<EdTboJ2IwK!K%@P*O#pLdEF|DT^}In2)b<dW#6up(p;E&k$1Bt6E8M&ZgkF%_j#M
z`=ScFcASOkQvR`SlB=8IBCQO`$>MFK(fsTxJfg+8lOl{Mp5d7x++u`4FfkjM{?rfj
z{uJKQtK&(rT(jvt_m7D~5%zikUm1@ZRt|q!dHedzp<oQ`sKQb9{N4B=__K(54Lin`
z-lzBdek&SX1b%TJj4Aby?jUIX=M~6*Ao|e)BoJ~MuiH#y4lBoHi<+3v4Na|gp9$-Y
zxE9R6(h?!3pieb9CpIsnHGNTBiLkCH#ts*HbkpeQGTOlMScB<($Jl*aYSU}#U0G$^
z%T$?V6>z+iVZ4D{koaY+<8X$6S6Wh~<)Z?}E1V3|I%&i7D|OuCzjfS<i}<*cH{pGd
zap6+^=<sV}FE5ieBzH~?;k!o6A_>|%n+)Vl#gfN460TEOU$8H>;Rgh7DhUy2HiM(m
z|I!5j5ZF31PR2?cGrbg^xRqDA+w;1^N~UTRz9D3PSpX?ZL2U`|2tx*sE$;V&ak~R5
zjT;kV*gAfNW4`M|>y@%X6Xr2}$^06p2kqsLS9(1s&ZZbXB^pg-@tpXsL|ZgqNj6|y
zKLl(qLJfi`C4r_DNzmU(%zT6J%NuP9HtZPU7u#+RV)(YUGyYQm+x_stp>EO%8{Mg@
z!ET_x>s%*kFAVR2JMZtvD9qF<&q19BZvN4NQOukb+hVbV(_GgQ;osq0ph|(ZXAbD|
zA?qAUWX1u$q<MqVRJHA#uc4aCbh&BYSF$Gp!5>-ykLff6hWDqG{{h00Z^pRAF$(>C
z?N2DrT6R9N!OZ2|s}`lOAOPDO!ykwutpigbY2sL|o97D7r3F*lTsgn^0v;DXP(+#R
zt>%A#chO1q|Fbt6>~>A5S5MLvqz`fwLkj1R+NgDa{{8`bBOH?V165YUnXk5M<PICK
zkVLjG9Wn<HM;-o=@oR>tLw+cXqcy}@WcstdOFYsqjN*tZ5^`?$(q<#LweoiM6VLa?
zh^_0_{txesrrBA+RN=rk6~aqiwm?)XXit$)@8uY38KhdrU|?2-QwJ?Zn6aW=)Zwtn
zGKtc$&$F+*8@cvM|Ne7RgDfT$|B&#2C)z`4^Y7{kd={OVf^?1s=3~u?@^X4Zsz!Aa
zj5@GQ4_^AjmzAAN_lJU(P_~p?KYWa4yM+jQMn8Lz;nLA#YpbMm&4=#ctgVjk-Jig)
zKB#>RbV$v>WL9sw$=+RMS5~Jb^~-3KCEROYM!LO(jN>CY4m8$ca(XMC0fmlHJQt?&
zIJG0!(92x^`W;nCa*nnJ#R%0p-@*}A@i!7VM{Dp&({U^C(-=iI;3q^Fc{UycK<LTe
z?b6;aTi1*7M&e+sy8fV)XLMLIKv}zy&Uhd&{0F<&sC|aD;u{|IAf%o>Ge!&<;9{m*
zkF$5~$XY+sv5X0@R)OQ>OyZ;J&e6v#9atY6Kz<~1=7l0jDl9E26DH^g4{vAW%Ehc9
z3%VF0#{!a{4-595q1wTeS+^5U>Rn{0<r7akYA997eaWS$Qd>j|3fRAF-v&@CTU5Xu
zgl%5R!}woVvuGBX{sZ`FeWRW2kX+*6qnstLTSD=dVrmb$G|$e{-dFVQ?xmseokv_G
zpCAD1QpJUGWz~UEsl&7f{iKl{J8e<K>EvHpL3?!h7^=dm=9~tcg`jyy4C#R>6fC=r
zQsHqkApnxU<%Gz2Aez(pagHQXyD!UP_7i<iD$>3uyIhw#g+=6Cgrp!?5h(Y%VzU^X
zDdE<5r)D>k^@J%#%F=Gh11EOZrNRwG_qGaXFd(Rt9xic5_zj3mXJZB4&OhCDZjHA|
z)HG}o;o5_SHUm5<&1zM2G!{k3LC2c_0Sg9K(SR#MIG0VH)O0#>xix#Wx6vZa_@dP8
zhaWlH1$r_K{8sSYz~qhbbXt0iu*U$oUuZJh72&9;aLE%XXJ93pktvFQnBi9e-_{jA
za)&gX90BOZNlKPIb(oPAd5*2@(GUBMwbgKNbi)HQ?eev$Wy7EjcXorN!*x#tgqLz~
zq-wU#NA9cFkP+h?zCfKM=Z!Pmlkfa@OQ`=z+%|AqB7Cu0UhpdN4!_uI%WkIa;qv(~
zS9fJ7+*lSd?@mi?f6xx_R`xYtQ4>8MPk;1&K8hkAlYE~mMVgfuzAS+FkUQmQ^m@CK
zR@ZbqrD>NJWf{__@*jZPX<l+?y0M@)kK_5(*Nv+v(MOiB_F0kNEXT-o4m|x`Wjo4G
zU|wcyN9M6|WX`JC$wkcWP&?yqKTRA1nCiT0JoTO1LS3W|W$Fb%&i22Hx6>ek;9`$I
z2A4e7yHY+9Dd+ps=0j6zP)?4{`l}*J<^3Wmu>gCg_`4K)jRqPA@COcH)LRE|Mku^j
z<a&a=g>f1>{)>@nrCk@DFj6GPv@c1NynCEPJYo-Q&fNXcA1=;&{<8q%=Hm5X4mk$;
zwzSv=ugO3qjvBCbOhl?&@<;CRp9l`rzHLj;iOa<3^LGXPCGP|ht2>sqB%>jeawkzL
z@1I8+3B7_JaLFX~E_mCFyvcU{K`O?q#27lu^+VN-bR;Iv?~5>Xcm6iJ7)maCOf_;d
z-Q7;sdP$g~r6#36=+nl49vL+!@q;@|NzBK+2V|WG4y9<>Z2i5HOldhY4@62-zN^^S
z+4^Evm(fKHMd{V%-g56w21`2iTKN$f|E>VJKV}8)^<M8-D1G>N!s+D%UY+_E{d=e|
zflc@Sy&ZAy;V#1AcQ8Qjcv<y*(|(|3o40;=V1)-Yu+XZ&ss(}?^dF!l6EV7Gv&`X}
z;GLmNU6CucP1}lkoJ$d?SKvoyf+oGU3+*X!({8&p-@ZxJ5ah=SbAP9Xcfdz%eAdg4
zL}fmym8|!2KfP|7v*|12$pql{o%aBr+OoO&*qG*V>}r@aw*JGA`N`?DYV$Z#pL(v7
znZ4zTXy_+!y>@{-J<r+7xbNy)Uovn8<0>S-N`0C7WuGv;u0$Ky^n!kNU3r^j>UmMm
z)VUx|m9x3c+2GJM2q-A=*2<Z5txhd&GP3?D!Pggd`<cUaNY_y2O{1mF(`AL}uQK&f
zuiSLx+C0M~A$GZ>!^CG)DV_~wC>(BjIUrmnIa&F4guPPSiNdpG+t+uP)`RJT5|L((
zHxx-H^-ACqM3jUdyG~pxH*S2dgfV-}?+>?gyvbWnu0Y=xKGLfW>r<zU+KTKY$a8XL
zG+TNGzV~Zs?_H@P-yt8`OOT<Wdk+ZiQdsI5)*&B8UslnsF!J?tn<ecVn!m4Rv2)j@
zYs<hIAVZ?j&$UgPx|f3j+g3uyU*v!~(cyk>dFuX66k0pHz{Z)!(Dq`6tqRk6RVUl*
zyGCnAN2-Zc#HyGzO2X7%@H}cf;HI)=PH~;wfI3JsH&Q<;@j55^sVR}9DU2xh5vlt>
zK)Px2%5jbO$tT$Y9HkoG(Q8Z!rS1%o1uWSd^|1$+g3O)CT6}_Hejqv88})WXNw=Qb
zFm8=@ab>lBm&SC^RmsxunNa1WB3kv1^3D%IM&(I{|9ShCx!``QoT0L{Jnm#(roQqp
zwcsrPPj@6aeeyyqqE>u{+WZXdQ4J^oXwhkv7<Oh4DWJdSB>*LFMdb$m6TL?ZtZZtM
zKI9i2bw`V6J_-F0hH8I!NGWcgV=sbiN9`2XUu3|D67IDD#!`^%Z|5boE}8FmCa1(>
z_npigyv3vpJs*EdToWh^fwd&C?k1(Spe=Ofy^cWYbTa7hh~$cphqlJcM{*Um&AJHo
z$uZx8f=<-#OtYoux*R5WinPwm2eyiIpGZ(FPRG25P)h_ZWGTgmI<eQO$9RE!kz!Cp
zrr{I+0XtteyK(#_b9L~7)vXYu<$101aVlQ)nK+$_E4s$V59;FIX7+$X^2i=jHJlKS
z?L}wVuLsJ-4|8s#?bA;L9XC{3B{86Q;O$vG_;Lo!x#Yy~=e6sYYm=s0E0)8dd(Jz$
zuwAt>o`n;j2rLYb=|Z43l$In27B`CBK*gJ=HR;Xn?|(wz$Yt2vHlT?nhexEnvA@p@
z)395q&jf;yo_DKFmy}#+;s*IMY}#!$HFy#fo7M>QrstX`p9DC6PsCq5RMsMVz}Qjg
z69ea_g2y3A)9WhoHyvYt`@@!@{{epWfU45xi10|P9>P>@xj~V_RN1nK&O+7{%WXWy
z1OgPVO74*&fI|sw$04~h#iP;2O7SD{Xatzqn`zVwfF?EB5`xQ{ELIP;IkV6lJgsCo
z)H+hVg1o7h+aeLTOmw9@^nTz7ENUV^rXL`72ufr)-X-~54JX<eeFe`^qS9hR#fn82
zg-)fA1Z{2bVRA^;Z`U$3lw!|Zs;?Zp5yF!qi2FehCA*CCG1eY8`sev>Xgk~yTpm?<
zVD>M4o5ps>gG=8=?6gFZm_3=XUAnxYt7fs-cz$Q-lJ=owf!a%=?LUC7qDO|OwCW*S
zaC}y+uRcqL=HBf$M|45E%g_@2Ek!8f>>6D=fz*{aavNrWgu@-YZy@l4fhhav=Y!S@
zJ&cqJ_V2P{$=R>{a+B7xl66MTQe|PQ*)@&f>=YxtOpH73=0(^00CSiDe?Lv|kKF+Y
zp_fA!P8U`=S?^)*qklW9Kks_(2OkR#GzJ4T#S->Wn$m4rkK39wJby%)9!h^{D`<+h
z01oZsPPb0C?T6W@d`bn<pd^nMpD?4_k5uCcnY~^w*4xT+SZ<1}rQk{nj1d&`-oF3B
zF7ODZtk^ZQOG5Y5ujOh8nmG!nN0M1EyYv3r6J<8F_UVP~<L(CYAI)xl1zq+{C~23O
zk92nN?j{d1r$0ed3RKua6{1GG#2T<hM{K2FkdHeP#o54!_uG++Ypk-%Ojj%|Do#Me
zRc18Ewbto)GL!wAFLRYJK_iq1G%xxSxrWKr+UquvGy7SWcCl3CW7dCw+klDkG0$w=
zjJK5Uu;Nzg+gCv!IX`W3d5*UDb<_zv0Ra+1dwRSd#$JC+%Fb9>EdK`}zSfTxuPiU}
zj!38u$TeADNGwY$EIZRlLGO02`K70)7pIHX_X{4iW#@*EnD>4~CKpHOB_p@VrYi<K
z{vUcUmrOZ#dsF3ygJkUaqpQc6fXN|#J7<Xh-Pg3VL+Nk*)ZZuB7JfU?JLZ(!p-aiU
zX#M)o7CM4Exjg7zcE)!oO`mG4Ju)TjVn>(_%w1I#{tvJz7Si49@Z6=oQOhI@@+gTR
zlM*S*N~+;4U3rthLq^#y_sTxRNPJC~U$#%;#BHyjOs7Od(reE5(HY;kntmH8@AWyc
z{Waa)zqQe9h4<YQ@k%0-N$|}(iTnfSPXrX+Ql;%HPP=6=_K|Z+?PGG=zZHiHmse&<
zq<Oz94<+sn_Oyg1<DO(iSc_vr3)qV!N9T-NTNPWIFKDR>raphB8CV2vxAVY*GoJh#
z+b3?|nR#-N`AJC<IwROgZ?+RrTU7Jyd)Qn0H<~QE0*CjKS2Je4j?~G(n#y?oh*p}`
zzy>8>vQ3*I{j=5CpA|-nPD#Icywmn%T@>9_e_0rb+fxxhV}9b*q_ffc=rBj(UkVP<
z3{blTSO8B^$9KQHUP$Eq7|r%NFMMWaS95oVL?9!zPtYI9wqt%#1UfIxCr#q!<VS7S
z1k;9*6tv9pcV%iXI@>vL^E^f%GxmZg?mC|LZzq_)196GIvMn81fRCk#HoN4PD2-<I
zzT5b>v9RcFQ9h3#NJ{W5Q|j5c)Em6uQlRprsj0Js+${wHFgops5I%B<kQx5}v53&^
zy%dMt{l{#ivQ(MpsQhvbedt(A?EG4?WW%GAVnZul0`aD^C~S-E49i>&-i&FT3|5d-
ziVk49RKVF9L~%~781!+~N<O))5u;2|VkpayV+DEWAnJv*(Ncjg%j<#Da5cVS)_(O^
z2p-dsw){v|)$JI)B!EV)X{fEv=z4}ao3HIIXGwVCU3f=OIS#Qh7)fMYNShT1(;R1F
zBB(3&cE#HhXjdUf=^^r0;A3%luY)^Cf#wpcYmhF{ww?gsG!MC<bBMdoeIZKSo;f`l
z%B>@@W<nL`lgT<9cuu~{sc{YmrIG!lw5forh>I6F^_JfcTBQ3pWE*}upK5$7iXDB!
zh4MzB747z(<!PTuJ}MoUX@JPbnUo&JC?1<O$#(aO(D=GL8W;&Gt@++R9!{8;SO4wH
zOQXZ+i}|@9G^a3SASM>ul3&I`>-*&9p;yaL28vMwssK=}zu~Fs+i>%b<Z()-R}E;&
zwXuiDRvvm$=DsX{^eg=lVSFWbWsYSxJJyrY!!%!@?nZx<@sMNJ;pd37l611`WHcU4
ziy@YLqCw1KUkRQTMmB~sCa$u0&|k2Vjxe?7K)mh@B_jU==sjYZO>y2)kn*!alg{Kq
z5SiMv--dbv#s#Mp;>enj1Sqmd!@Glh_fs)#cbW*t`Oz`9Sz$Hx!Dt^ncIO`*A1bph
z7ExM~{79$w5->`!{7-7iAo)4TUocIe2OLb$)a(8;EjjL9uWQ~4ODc{`@&-m}HKG2w
zg*Jx+kE_qwF2_>el~G|pE83TVP}#)l)(IBpzji@EuAYfGc20MiEKQL<RTrnw=9HAW
zl~i`1Z0eF;MT?&SnU{x8a$k9f<I1~Ncs`AO8_C2X9P+hM)D-h5z}5r7)Pe&ACm2Vz
zK><KOnput&lF?t^(KSq5`Oyd6v91OnIJX^p{8;E9;^n~*Cq~22iKU8ZB5&Xp#DkS0
z^rP{dtizROpL;+tb^b0pIabx4jo!ToRrd(siln~&(WTU7hH{Ju?~a?@a`SItZ%z&@
zF#a~uEU;<y)x!1#V-&7WN|hu`vRH$1(eDA@-Q^h_T@6o*xUP6QR(fHz&zu0#nxNF^
zNJr^6_eq5RZKuQQ2=dP@-$m0(XIGntA*gG@M4`mnl3J>zEv;lknc1UWG+t4ifrK~~
zNg|sX1cin7NC{?I{xVq|Ny*H(f1f8h@MJr5`@JL*?)cW<U?fO}-$**|$as^8?K`?B
zL@TH_bN91#K;s$){&uU@{Q_)$Qb;5rkgJ3OL^0EeJ$y+SU4@6qiv+Y?s^Z-!vXQsC
zL_N&mb8LE|r~X~;2`8S0%o!YxPbzE5`(il<bXe(Jk^;?mzwmqh^{b>OP$3^B)L>g-
z*H-DIH>V}j@jmD>ndZ}%(Jd`S;wE=(NrteWYo)WEQ7#x&Vn^hCf>`(baC`SJXNO72
ztxq4R!b)zCHttxO&Uva-6Hqxdel_HF;x{m*@i!zk{`(W#z02Dqxzi(zdVlVyY_?3@
ztZ!n{(>C8FHD`E{xjK4r`N#nEgPOi3l>Wl_RaJg|7f{}(Q@@FSH&sasR`|P$rbA&S
zfNncers~wx->2L11b!w3Iv)XQP_E`;FPjg<EZIv1M`qEv;Z(WX^%mG^$s^DxNVyd7
zAIl$cygvepz8Y-Lpm&o9(b8o8OG6^5>^qDg6{%GmwgtfpA0|^0I*ohlXNElK;B5I5
zNR2Az@#(?x1*75+Ly-C+v0~tTx~f6&d!JM@!D3p|y@xRd#%$^Z)ou1fv)lgwW4t>?
zsRj9|DeT<A+m>%|g<hX|b>I;zb^3?ScFA$%`Do0Yf8HHv#36R-(Y+!@DYh!08<n)T
z&s!o7H2QDsKZo5gE_4mbtIiRmnlv}@jMH)&4xHW}{&PvjcTbw`r%U$-_Hs+nKmTJ&
z?aRL)tQz>~R`7Xn^0KmT_fxJ(%xv{!-bnc{`bgXDY5VVhrYy<4)B2a<gY_WhVJ|#C
z**t8|u*DD@UTZ?`a$95c)YX(wdQP{65s9D&iqC>g)fhOa!y@!T69v&+%Tpz^2Qw+6
z^E_?#uHF}9L(vYX%IG$GdSI?0B7NK7`|UZZ$|oC;J9?Q#jVf7Jo>B9ka&+Y5rnF1u
zq{-D;eH>H_2S=7az0ztgq%koQza80PP|9bLd}Y6T3aWh+(V6f>KQN0q#rRUJCfN6B
z`>db>Zqrh+)N7f;@aUhLWH*a^THT!3m6(Q^F%CgDajl_JRfn+$*v|0H-O&=2G=;uh
z_1L;8ZmVw*VLIiGJKgK*o%pG{*%CQ2Dj`Kqp%MsNS{<WtkXG<v#WY{hLFXH2EZHn6
z;Wc6nL*(zj(yHn$np@C5whJia#tljrXwAa=?WmiWrsyisw(}-N=iYjEpiFk;=iReL
zgv4?jODF%S6v}1I?o@Qhakra4X8)t)#?joR+NxJRJl&_*qv?}<YTx}t52y6HH=+*X
zRgdY9?&Q>^bkyqGLcU^T{%n^rtbw(WP>U6xp)ub3jaGa=W6sT4U7Mt>^TPqc$yEw3
zUs8C}lxaA16gDsza*r8#i_GD{mQK9h4jevGS953^&$@|dXGwXSlZSLvNfV^b*fUZu
zzCBHR%<~xIb}H%i6(v}tANBfv-!;Z5Q^BE(Me1(%RnT5!VOfb{`}$3`z^orf$tYxb
z&kiTGK<og=v0Yn{LnLik_V<JgIup>EpuDY3z5lNlY&EJzH}mtrT$~(n1f|q*{Hliq
zd!uid-|a>Jf->~z$3R{~V0ak&sB#A97AW7<pJg_+uWh@DR!^&!!PV10*SjbAUtyC-
zA8H9KSh~@!&odecqQ%EP*eLba%u~zJx;u5EleQ7YL{%i+Hve2D7|n@F$mTn;=ap-#
zD<&Z~uFo#g)yzdOFD&?|D6C>*%xF3Eldo=D_DHuDAvN(NiwoksoB~W@Oj)^n8QO=j
z$raHv-aZ-@8xYsuy7vZG5e_c&;GC@^WKNOJ|JCflOa?Z`TzxX@7wc3i`oMVK&<PFP
zHbi6#lnCsjvj<un9IRkkC;xUVzHtoq^l_-UgmOoYi&%l<{Nm!sI8{I|7**GN#`7dG
zNSyD&BR#TO6)rKVZRV0ry$ZxUQBAQiM7EuCb)zI|%WrjXL?-wr?#l))1)QgNIh8)-
zgR2KuY{5D$XlA*m=y~vue3(-}L%u)V5zAVA19_(}Mg1|T3u=}Sld{H<qQXSQVz?oy
zUm&I11LlTkO^|)8;{3L|Up=EK)hiB7S!IZ4wgVdthDPI5!JGGLps%80ia}tbyaofw
z6m0%bMnij95QEuHCPf@jq+eX6ffj|qP{JP?)aoi`H|-qsrF>hcL4;#<2;N+tW|qRk
zil+Q5rT@T~wDrDHGey~hXj;GU&EmO2#QgBwARXSk9(Mw7?85Fio$DZuBIjUgPvw~0
z5IGVB)lLLu+P|QzZ6$dF+eWYw0c?u?jLU#zHoV?tvno>YNmjT;sf^=cw=_3V8JlAL
zjR+L(Gq{ywX0n^2zFwIeA?mj2($-j~!<RIfT`Hn<va7X}t%dHTUXq$%CstUsqWoyE
zN_5-c`^;ETCQtZ_a3IQ#)`V2hm`1B>dAL+pupQ=W=zM5$+X8H`31xw3b4b>*!1jlU
zHMbKn`l#9Y$7@zqhz+tF+#o3thBoc}g2Vt48GtLG#B;!Rh)bE41vfg;#sk!TkJEkN
zm}<(vp2pNSmg%>byje{Cva3g#{<oNo8h3l|NbU0pGb}W=EkCMu^mY2Tz^T~P_nJ0z
zyG1zD@mVnaU4IO>tp&lAXdnmX5yU5jv7omoNH?4Ri|-AJ?$<7!P^I4`l<K2n0wq`B
zoi+fx=YOA}E&A-vY=?{|ZZSGFO_D*x3U1h-tSxP=4^4|4MX2GDfp`=r;pFV76RC4v
zAUNp!?(;}or57wPC%MO@;QC1=`9DBRaRO}NJ%|s>tNiAlh8=74yc3ulbP}O+*UDj6
zTSkgNFejT9gb#zvG&oSz3=$!H$GsUL?BmY4{<k~1I1nK}eY0Hs{;_|14b4We(3+k}
zL*$r+vWlYMWol7dKMK4$gZdV))<gi&kb&(T9@S8*A@_D2J)?%G=)A{7P=m?imitL{
zD00`{Ey<|=$RF7GNI=e9hx-9lqZHyfuE8nvr!o+X9w9zQ&{q!s7OtqM$fjf5OLT+<
z*BaR4dSUP9={}5BJBY)HC^m(7OPO$6Lk%5E^`}@e9Is2d#I`-U2Qj;w+FT=tm(+Ki
z{sT}#Xrf9?3)??^*fIU+T1tQ%T(i1#e`QwWUW~_Y4oHhoZtF;3od0yPYt^LIGdGgm
z2k2B#e2iUP`Bfo`6;S*~v;#L)+RnLCMVet%?RmP*=R%9}smX*Z<v{NqVbDIzF*XLq
z!4RENk*V)~7L1wXIG)(dzG#xjtR$x^PRjP})EWx-W)v6M{alkl)VwWB%%~cZVwf0;
zfXQ!4<STR#q%7klk^3Z}LG}b$rrx*QN#egU=z^<~j4uSO4UPV0;VYZ{BlKl0jcBkc
zEj{BAA?wT!_QCwoZl7eV%FDfn1*O74kcl)G$idJk>~WQ~49)3j&2d3FhzvPgxnwfj
zGYqlG+-}C61{O_sPpJ4Y^_1E}zx_txU$s~Lblap?H=o~PmJGripF_fyx7nnK38E=_
zx~T9iwfASIVGb5<_=1H-WHTzV928I@6bubaEq+Yc;axCc{+*|K@9J~)sM}~}H8SEZ
zjc=!%Lb(apnNWKu;-qrYUF@tzk0vA_Qu4wdA?PtnDr{p*VQ7>H9H|@Dk|t0+ukmz_
z)kGES9BX&!w)uJXmmLhY9D+dkn!0@lT1hW?{zVRg?&n;J6ynX$n|iQ3_sW<A;)|)5
ziPmv%u<@6mJmu+P%^VFp+xq_${yhs5yv@9TkFu%7&6p+SBn2!oreWRnf4^E#r-J??
zO9#CalGXd9BsmV^m?Z_TC!h#jg!8VlFkY6tqhy;v<K?G*ACY-wz!8u6-QMW;UN#nV
zisIGiD;W{PUW&rnRYh2q`WC(^Vqkmr<$zY}z-)jd;@7&Xc~M!Nn4QbB-XiymPl~d*
zt8xif6KOW!6S^N$d_NcLGVI2^>D@-0&6OZoeRO0DA5}oR=ndQ~_osIKG=6Ji@bblw
z?b>_6dx!!Q&7Sto!j^W7(?kXG2;b$W`8=%jr^fUrGQd)oS>~uXgZ9E&TJ@CjC@0QK
z>f92@xGb!<S83KtI_u65!{{YKNe2YqRPIuKeem{qd}h%25+-QBI)`Z!Zxrd>KC!3M
zmM;#nHBCLk<{=fBb%~|-=a@eIDBmeUxzO8AQ9$Ug^Tosn^)3b*F=51bDB!AOx8GzP
z*wylF($rD()T*egD=yAvR+wF0I-@mdnpOSl(#b|_cEuu{0yk<iD=jOx1ye_Z0=~9W
z<hF`qmHVYF$24u!XK~FTBIALB8P3=lX8f2#+}uf<^xb%$Dc0M;N*`$H--~FU=1Fu_
z=#-|Y&=<Qc)Q?UgN&7UDTqv%dcmARizD;U(Ic&Q$TUJ|KR!M`RSVSv;o)w!&r*A(t
zo!0f<7u0?$@5RZ5&f!imWl_(iVVXSzBplQY>k@-!;3xTldztI{TQMq2@12cazr=4I
zuM}}s8@g5uRgnpMa9cL@3H>nE3OwL3X{<{izIjzC`EjkHqeg5H{i#E3&rL!U_Vrgl
zbr%tI$qS=FT`NQ9?#prSF2BV$u7K#0W3M00eUP{KV$oKxGC0R?x0A8l?i<4D{qRG-
z1=(}7rWa`DXRrSNPA7}AMjJ7!R$fw+knnJsL+?L(KXj_2;lTKMEJa)z%eW4ID{;Kt
zqa}ppGOYc7)gc(Q{I_@E7pC#2@8VQy$WWvmNm4ZdW`R_%UAMLB)$g3{1qXqR@mz2e
zZm4(d#;?PWL9ILulq_2B!g`H&4$Lj+9JScIF0vGN+Nr5KIg^P7qWa^-%zR22Z2ktT
zJ7JRTzNuEJnN1eaKMy66&s3m)yxl8-jU%3&mnewrXd4CvyY?WHeD)IMhHv;@1*F}H
zo!rEmqG4!dGSH*0&`!^r0cM`I$$03cJL>mWf?hV&llYoMgpo+KUgkTB%Wcj5*SRCb
zV$@E27!d2T`=wgVCWIF0p18)wB?hDZR;PB=1{PAUI|DL_v<W?!7V4M6pl!v<la#$!
zqpcCNGmUe2O9@|Cwh1{i5EwZUV)s}7r9B(B4UEaZHEiyB2LXeVyj(}4gZVFzCul6h
ze5*HpHitxxELu=?u{O;NNAL=17hum=W!Yb_d&$0~tMsLd^a??-@_qIQOB_^KU~a#Q
z5U6Cx{G~Zx(p1CI+2s87nCzyCui=Af_NJQ_`P6H`5f~MRGTQL7lw+|Ep0G_4{WIjS
zq_;>|_4ZC1qO;H_1o>Tkt63bGSfDB=8lOH*sJ{o;tl|3E8OTVeLiKsoV4M$6Rma}8
zR-P)vntoA4@Z=BIVD!`wd$kY0rGqlLAkeJI+04n+olR%OqL_1-J^L*kIuIEpA?NVt
ztgL%6w#R|`9HD!o$S0qazWHy$p3J)oJJ*_UiO<AtjJfR4oH&r~3Ps>gtGF~zX@XKO
zp*k>YHZCJ*uw(h8eOv0l?=QKnuwHFoi-NRoSbnqH4e?*{H!8U4pv$XA`viq)Xl4BX
zQuc(mw13}}2wKCh4;xn<g`JDcqgZJ}VWz&C@)V8ol+FZJDp&oQ>DX*;<d~WWvspYX
zDJ<QHpnCxjR9EIySFgWa`tf}dEQilH^!>|>zg_aC$a!hik`wKXSDJaioXQL+fQC68
zsF-N14Ul1U-e?ykvE>splBp~cW-(34$Cl(~looq$?e9K|6^_3HF=Vm%cVK>OEq(hB
zLB22RBf)16N0&hbs@%a4$4YoXi6u#E;yb(FY}!2%F8%}Dmy`55nyU_biARl+QgsQD
zSQl4n(P>bB)pv-WQ+8XVeYZhD209>@80YA4@*b_@<H#iy#QTVc;P<t{Eba(OLd)_z
z+lxRK=N+*EQfj<i%Wmg05^VeY=Cq|VrV7WsC-z2$=Y4#kW%s3p!A&6Mc3kiFVdij^
z1<<6P0Ga|b3(?5fjkLgI@pbwCmNGH^f?!a0!SOVf4|>-z-{2&qOx_M#YZ2cz^FIJY
zKJ7(Hzm-M7vR^?pOlPI29XmFAZ5YC~-R7zLCgqhygk=&8HFRkknxNlwTIA%{F9|-}
z0RoXG(V{7MbyRFJ4ed96=MqXd`)m#helU<?$&fILCN)=8R2~{o;?<5^<?v+?9Pqan
z&yceJ8f6Zj|FF-eOdh%Sc6=!SuB-bO^;h0Paj2@<p7Q0Z)6FnQ*_uyv1K*pu?Z{cb
zsiyo(mSs<{wp68zeZ|NaqXMyMnNvmzb&F^}9$TBOF>OQqD=~WaYxkS1-y+%vm{sK1
zfP<+*7SiB%3Mv}MA4|kl_}V|MxrcjS=zcggJkL$OFF4XD7dhiVf(dbK;)!jll*$v(
zC(G|`T$gqe*<rN>-+v*Pw!o@!MNrTvO#3|kDtv9=YLPjMC@8PsN9*MlKp=r*71Gr3
z1=&VmqO^-`iHj^7<9(rMuQ+7C!8v|OEWIyz3(8}nJ7pPzm8LXfPiD3@xDo~(^oR}Z
zQl+eKu(v4gqBDNRQRNy)+J^>DYZuq>j`fu)sf5DpzZC9tl4F8xyL>n5<!wViF(axN
zY8;+c1Op6>I&4}CPfWuHf4%XLJ}1)C<n&wOZ+}PkqDi^<%rKoDaMECqB@?+3cOj18
zwYehGC&H~Qy?R=9*%cv^W`eMae@}YS%kG*~CvD)P!gh1wKNGA?&ST|JVMR*X8X-Ey
zL~Yw}-n8)|U8)M#cfKr+my^FCl+1ipP`(%%6#GtXlmzF2i8j4tB00w`n0$120V+ZM
zmjUh1m5N4l{fWBW8ERHv@>ejP)x95e^%eMc3iH?Z0+|<-3U8hd8J>?xpF@~|^e2^h
zd9|@x9Iy5@So7Ort{W~fJLShcCi-`BYk0xz5`A~ph@9gG9}TMU9P2Da>5YQbc9Jg7
zcV3F{YJZkJrJ$qQO#$_Y@2Qc#Ek6^v-5{v~t*!0vy<I$}oz939nyc|e%}oryiswy?
z!;7_8e)mYFo7ny1;0Aa78Y;y>mYgB4Vz=)V7-Qy9G{Hk9fA`+4DE2pe#lbtJJ6-3y
zlkEw&t<&~}yZj{hzIvYCniTku;TFwcTm!uIBuoEwri|_rXvirI$@ic6^VY}hc$3m8
ztU}uel)DMyRFVK^6-N@b9FcaWK(<TYhdNAEJt6j+_+*BPb76`%+V9&!_TF`-Xx_|O
zGymekz7~MGCY^O1a+O8jski5H{TgyvO1;|##!I4Gj903I@}ATxu;D?ppMo&!DhcFj
z5qICa3th|IqMFSseZpBPuKNNKd;sD{jcVMs>8<A2qSI%iA>xEY`3QDCK%pW)B*ZIR
z>`MD=UKW_tydhkKqkNyi6aEzw5;JRd_kYgu98b>loi(Q3k0Y}!(VEewvsLH*oErK=
zY-!7%YhS_C)XGgt%+<p?6qJ)Viee>R#n%njqbxzWJp3`Su;x;8e{+4Sn!u94%f`B3
z<^YsJ_p(s2AbO=R@f^A*S~ivY99G@$Pv@o(CkmXPkHi&P?Ov>B21vww=4d3%%ze`f
zLx_#|_y5O$Ct-`dgO3N*$TDi$&;|N^x(Yjz2SL9o5Q(a}BhQ%{*L53y67nQoKY7GF
zbL3j*J(xO)ET;bX(rz%=B7sTkP}ctTt<es7jN+O$5ajSj@C)Nzw2D2l>EN;g)$P(v
z&HOSJWW`+x0J9%Ux@|}9Ln<&WG5v08B~S}D#;q&L-`<kWoN97A$tNM$!&PjNqP&t`
zQ+=;J=)gYapYq6G5=tG*f5n{X!PR%iJ8~@BMz;<*j(K2w+S6^?7*-SHNgw4S<Qm!w
z4K@5zVFHmTJrwr(gW2glC_Oq8u}EHwfrcfNn;1X%>WncZ5a~z9{_S4@(F84fcJ_oj
z(hSHhk8F_g>S43ATV)CN?ed+-U0&wv@^kkvK3+idNfrR(=NkM!z-;BP`|N&rI1(Z@
z;ht^4>l-e<KnEE!$>$Yt{oFq2LR+Sz@!d!<bBVS3=oU)uOVPCSdp!h<VTWIDZT5!8
z2YR9>)RAeXj+rlW?4(6Gh+x3)DD!ggihAu25<3J(tFk9}I1tZN)3wS8PDnndr(&hg
zgp>89s(f9ED(9?aqq7RUx+ur;9PB<_hoII;vqKb9p$yS9a_y^rm1JtNNRr{+$$V~?
z^?Fzlb?|7=Iwnabh!h!_MG}>>bJ^c|L}BK!wS?EV0kex(;pC)L#CY^DMD)wd8Fpg7
ze-Htw07el&zfoPRQVXX~O<?gTkzoLOR;QCwg)-8Ld-Z0j4yZuR_~+p@-GSYVUOYAL
z8I?Qm{Jkf@&Z=G#J^r%1c=ql?@+Tgkmh&H_s$9*kF1LqaL}_YM@`_EgdS9gSn#_d6
zWQ!N;nkg+Q#HCJ-P8~TzyphJ$X?o25bVdihS(`p@dCKF6W&tYjMF23IwBXlQC5+=g
zS$E9f5-NNLUIob0dM3RcjSH+HQLUiX&@kfF39Jks3x*jY$!Z%spX_tWDb(~fZEUOC
z-KX6G3ihPK=xZR{e`ZS>*Xi`V`Q}jw%pf@4VGhM{=q=b`iK=yQq+nrXBy{#TJV>$a
zdEDu@u*8=+iuXy%lXcvC0OW106SYt7;55Sz`@<1gK(t;D;vUad@u3>F{{R=jf|2TS
z04e|=1OTgueBxb>8|JD%Egxq2_Tp^byxkX9XzKH<30aes@mAEpWYHP9jc4EajT`v2
zK*2SUky9?2NJkMjVJi(g0nS<EoxM=zahKPfi{QRs1uzkW7y&V(5NFPxq!9wu?bqI*
zW*R1k9U*xXwjoJW=q~pnO^#E@50mAwkY!qs-#PYR=C<ERMC0^s^6n?*zaurX`=K(1
zPB6(<=z&`rK$t&y=Hc`4Rn_}LKiU`i;=Gu@%)6PVS1aM}%Y|Xb1AY(rJ?y^C)qeE{
zP(sb)!LLF8veN;xzf?p3`SwuZv7?y!J~1&gE5~W*Ftz5NxX%=y6flb{0Xy3Hn;e$n
za%!~EWPS){9OqmjTN1`K+ESBO!^37aYK|$jtMRToM4EqFLXx8`ez={<Rp5H;gy}`;
z$m$!SZ}o*3?Cx%En+@fy80m{e#8Vib!1X=spZN;O{4k@k1$BdK{7&domP~Qol|H^m
zNV<HA38?s9RI%w!r0)8wq#fe;Sh{R}>$YH8=HYd(#B{|{0{#zR;PduBfR1NW*We55
zL~@Oo`2S+-t)kjsyRO~f6!+p5iUfBH?(Qzd-JRl4w75fY5AIr8+}+)!xD}V@&v&}t
zeVQ?HlreJ8HP>9%v`X^`fAn(?RZ|Io9x?|t=>X%XMUyK2FZNuD?%o8N*pN?;?#{&(
z^A?#@=>c8qGP(cAB0J2NLr7r08Syw&^EcjXbZ?8a+TIJo%(&6`owXlr9&34E5^POw
z@y^hCLql*vYz+rFQZam9c3?Fv(isM8#zQ(h5@3(t^aIb5?NrGSb=@hVd^F+Ny<kjX
zupU!n4}!7-=wON1$9Td20Z@J3PI8!>Dz9I{)F>K-mRu$ylSq7Pi__I*`{5$Vk%o^|
z6Y-oDrM>#=_V70%(-w7^3gu&+kl(NEOia-4+C+#+G8-EP6jM{AbT{&Lw@AJQ84Zmx
zS2VcoE(Xtt4sCZ70F*xsdPr^0G}@{}(F!aO$sTbq){N+B)tOTWf;KR%UUBcqWs{5<
z;L5n`R0hBd0VQq?HjAN8Y(wvMu5uN~w1WQu))Vh<xmiZ<@rQlf@d`FJRdmqGVDR}a
zfV39^NfUuV3Kfl5eUgqi7>Xi6#CdGqCt`<+qWny<rOBTo>sP{YT_!<cI9ZqjUCz*p
z1dKjwP_<b`wHq3-0i|n6%x)-0h@Pi8<oGN*0X1Z#X86X=cMrWH=IA*oBR@fkAL#R&
zP4wo7LCt72=PVyd5Wp+!F<`qx822jqhT{wkqcS$}wPB@9cyjm2YsVm)d&FLCt>TE0
zXFrvycz;qfAW{f=qh5Vc*Oog}rF%>tS_Af>eak)BdqDUpA;ZYSqgqZ|=5#!~s#oMg
zMDjFAHSJkLdR1;hQBKIec91VtS9wwM%Tz0QTOsN9DsY@@8T#CZf;#+Gz5Eh`|HTEl
ztHi9SwvV^{;NO_X(AM?Dl45<u@JRRrbcPrLD566XaOLgKJk8Q)TPDIPR%NETxI-tN
z7N)+1JA|AmdWJ56Cz)L7UyDNJyAedJ;7o%%#UNh6Z)rM@Kl9%e-*bXqT^*kn2u=yz
zKVyXQxONHVN1kaD$R1uvRmmtxAh!E1!+9f!UNVDyvgk29Zv|1^h(Ri7DXm={+2&8a
z^v@dF)IBt|`3P#t7mifwPBcW|48gfqzt@DOP%3+(zr`%}1<e*%r*hWld5s2e1q;vc
zLcg@fYi~WH0<qi{TAH#YAga|C)`q#W2?9b>s5rEpxddW={LjqawB#;Xd{RTm2nTbU
z58ZE%4OuBy^}R8R9dr+DEt@;81jn7Cr-kCGY>De=-xwMbG}IO3SgCm3GaVOl5Y%P@
z?-%P0Y+4M#UZc}U`EyM<SzPZ`sieVz*oM4n8T}*@c9i`@^I1a5l@s1xds^{*<cp)j
z&a8bx2uA6rePgy?(q+0b3Qdra#_>}zphjL;)Vvos_}H*1gKD4292H)|Fmk(2YdPMD
z*{8cC3(YTT9rW_F*tHI6=dOG9S55|hKc#ddlXAl#bEgSWuJ|N~+hjeWWl-VBWHi{X
zeCwuZg^>Byp@UriQne6Y;o%H%ceqQWS%FF4Bv@|DvC#c`y{=5+4BS)@h}5D(!<fuZ
z4`9!J1ij7nUzP0o>o2`fdWwNYkm501Uv*9x?V~O)Ogp}x#%StcJ%w^Gf|^N1D-r9~
zm|b9CS7~RZ@a0_pKQt#is{i}oE6fLQO@^x#N4aMR&Q=^_g|guvWkRX%FT2~#%Jq&u
zQkEw;SL6PR3GDInyROd{*uk+FlF)ANn@L}AucN~j{qltsaWqox_MpA`&jA5evHlSc
zz`8<0<;4=6P2p72<Z2}Q#2aMkjwHG~vD&r{tC%d9{A>PP)%t|?Y*@v`O0urokQara
z#=g=goP>7Nd@%YS{dRr`8TXM567ZJDf8?LeCh)wO(c~f6GGc}Fk9?}1E28H(Z8iHa
z)7)2`F3CA_1HKV*!J~4LKlZM~`2#)Xbq^rb^dc*-hHXk@;lfk9cy&K-3U74^`AKvT
zfz6@Ge*ll%zKa>{q)a9k!x4@_kDPB;&*~N}ljDGX1*h_1uD<o^Z!6Y(WU_m*<AxVk
zJW$UHK2sLW4MOjWJ*h;eC|4nGBn$p`pt(9hIdl_YtXN|57U$h`KBHjI74_+f1bh~;
zb5K37W)~%y25j~rJ8vSV-Z?BCvc(k2feLlXG@`lB?$0xHA<{;VQ?RuM%YOD@K+bA6
zb^zKr;9qS-`$k~|weN}i;g%MiOdqi;iGjmLfb`a9`2cqU_C73*6IzMfZcyJbz?v>i
zoNvPQgh}@xS;a7Cj{IcFD}o9#0^_x+V)&uC%4T?~?S2r1ozXZzJY>A83$t67>_5-Z
zW=?S1#yKk!r}SAIbV>(DBxEZOv4bU8WXye2$tqvg%j#H^8TgS&glZ6;9qcKjqMpLt
zk=5^2Ti_VJ&NZ^HyP9dyM4IfoP*H{s*i`q_oQjn+bct&<nmQF|81y`9jS9Yl-46Gr
zO`&069m0?aq0S<89T1Fy<Q156_s5(r;HWjS$8bD8t@v}Q`L3xF5RyrYu^f|FSUbx%
z5ocV{Uq1b-$jqHN`4Y6bt68Ec#XjzJ$3`f-x8i@(&6uONXsa>D(cN8L(=%I!Z6YI>
zlQ3zN?&pI@Zpk_;{qKjKGpTT@tebmHYI30FU(<Llw4_QL4j10CurQ+@qn|O5kCHJL
z137ZsiKD<#>D2@N>?569B-u9z^j;d*PIiHJ4_dUQ?+BO6W-c9~n%!9B{79~nZ3Sme
zNt^^gSA;4oO=G{(cFP!;PyohpC;065;aaYaTl3_TFD10EdTx)7Hr%thxxQXb^-br!
z<|P*|`~E9~T^y&|0*~5Vm6YbCW&ns1s_+1$!No0c680{I(sEq=T|Z;O4;K@#=cVi&
zgv(FMjrho<Wkf)wR~klWdi1i>?~f!DPw_1jE=e0+%Lx0gBQV6>%J!K#0W-BSauSM|
zEq`$T4E_lW$|~dDmmL!1x*&A0bW92i2-Ko?gl&h0UX`BK%L`6aq%>7yU@KMtJorY(
z>ATs2YK3C`6aCNvB$rtJoG~JHh^@J748fVB%0lXBtu`zcL$dkk=f~^PUWDEb`yW|w
z4TPG8yWk+Z#CTLfPfoy8k3~*X!-@v&MXaeQs9G77cN0(lIcMxV88KqM*-K4OFlRiH
z^B?gSBQRAmPplG;ThjAWc2q063;Hh3WSp4rDW=L+`ymrRHg(*Sl_{r*0>>ZZl`f6w
zYmw5NEy|r2md{#uD33^IRjn;Y2JL@YZ+$@@Il43geBgI-6lcL@aK;={%JIQvRbMy<
z@H)ZyRWok@_6;z8hnBe4Bx>>*;kjXRODnd+K@N8(`7q{V&~NLhz;|2bZ*a;Y=CnZ<
z{M+v}`%q#gb#(@f(~x0)L3!h;dNl`fFJf9vyN-Qjd08z-$DcC4)|HSX<g;T#lSV3d
zOXUG#+0?#qRK_khaYVP@)@35UJy$U;sZu`H{Y^aXYWH|l8<P{-*dr}&yh#4~Qh*be
z{!(j2F?|z82g2Ax=xj=oB1i<DC@ADju0JMOB&h}<H|UvxRJ%sNM+7p)>y8Edz!Q;I
zqe(Z}??2)tosf^vr3gpUOyH|-U>+l*$|BTZG!nhxHI0<DX1o^;zIozd2VSe7<|;50
zR8K~-Vknb#mV)i66QzezZwY&F<VqLJ_}O!fC4J@xLd9x)t>FW4ckEmG;0F7Mgk+F%
zXXEcw3J=8f+1lX|X4#%nh9@-r+_L0C&PP{=H}A{9jMQhCr3>fZ!c={=QmdczzL6)K
z$U5=rE7BgR_K@$o%@;@V+#9i{Zu4u5#QeZ2rsE^M27zc=rox$tj)~qOkkzSA;f+C`
z2&rQY@Ut(;NB`(2n!#!3%53;pMJ>`94uUACy=%eh(w{6TF}fKr9SLOF5rl!}_qBD-
z1lJp#&%8cC+~XY>{{fWJmZ)a))gF!XYT^}?f5ew1zR54r^dY9nfH49y%Q#ybZ}s|t
zNpbcK_tcpTeuH{>b|_}^@TQN%$$^vyRq<auj?Wz?<i9muy}$kCRZ46uneTGKJCqKR
zZ;&EX;i~=*aQZ2eX$gSy=k&nn%iNYoFY@-8q*wjWTIeY>Awzd+`!*=uNlf4<g9WL8
z8jGuLtLO^glbk_@OY0w9@J9QOqa^-SC9BLd*b}#_<b?dG{SJfNa;3O~Q=sr^+&m-g
zrQpii!9D)zbgw~fhrHc;L)p8wyzze@wzm=pl}CF%duor;$0zb)0taojq^7ob*co3R
zNh32JAo~5bh*rOzf{&oJPc=ASr{ol96nr}6CNnkk-vR#tiklaqiRj5Ub+V(Rd&S+2
z+nynCRq$7;BKeqNB@AWT?B}Gc>Dr}(N<x?bw<c&eX7rS8qUiExRGf3&yX&gaeye0o
zAU4*203RT?)+H0A6*kv0$39Y%fTsVT$7*E`7dK~jljiHsWXI%-2_7%ZA3sCS1My;=
z>=U;(3DB)gASk)FpR8_aA;l_NXyV1BCv<8ri!FP+SO&;cQgbT4P2J3+6ID0UGI;Mf
z@N5QK3)^X9=XaY!N4J+pjJ^w4KW?z|S<=LpD1thb=M)9cEiAW+(sxT1Ba$T^f4b{9
z@);Q0bNn$U$T_n-mM8X9V79L+abU0SXzQ3Zu%Dqf)|VjN8yX}yvc*8FmL}*HT)DC-
z+}&X26TuC@(HmlCLr4pu**9%P+{(j0<Wxcb(afWkk)-l%_vM>bJlVi*TgxwAC8nkc
zWO&?^wtH^8q((98sy<>~xm6M*2gLq5&LI33Dl!Wx50kNes*n-jP?z4;^w6vyZ{NPp
z7LS5#YVn)AIC=sUibS<&nPhJ9|BFNl&mX!Ve+}C(7^aq<fLS<3VH4YUax`XUGQM%a
zH^;WMLZa~)vfnIAXbqLUi?h?=o8n;XZ=d6G1n1VOgTI4>IY%f;ZDzXY5Sse7H~st<
z`DR-v9q3KiNczF2H))PrGKy?*u%|cR(@@3R5sTD=iut5vxcsGDXH=o4WS6Xk?OGAL
zIbw_A2-UT6)6dh$e~H)g<9^L6aDoB3p`p@Vqr=yB3mAFtK!TBN!ZWQB8-1TWjY@8{
z>UgW4q)`_P(aNr6>@yge7d*(+a-cgP9q-P(>kUI2E6y+%LYl4|<g;MXGQLr5Qq3F^
zngtTQ=sLMo)&Ov@Pj-wOkL2S|sX~WW>1R~Xn=qP4wx7FZiAPzHmAJzWTS!+6Wqg4i
zwL&SInajjZaD1_QN*r|1(;kyQIpEiviCRfdP^0kX<Ax%U_$<AMgbsnOVl8)SlJ<7`
zs|7ANq;XO3!JfdoFP|(slf={Gy84-P;L)yPGJuNb+f)}_49op|70pvTe(XszJd6dw
z$&H~!s>_SAOI@{Jv6wXVLLufOXp5d5zNyTean^hO4!@0?7ju!lGno{sP=XKsz2B+g
z$Wb!Fn;}p00Nrm(-5YE=6y$Bf@_DelT&Mp7*lZ8V(`&O=c<0=?Pb?g!nX1YzTr?IO
zDba5**P8bF;sJgvEF>ZqVNx-BGs5J>@Fxn3w;QEpXJ<$LwyyNtG~2<X>gx1ROwh6F
zys0ADE7{!SKN^Ok!yiZ^5mhHTc>0`ft8P%z#FsS@-;N|lC6idjvRaAU?h+SK+l;mT
zT5R|src`UHJxgeNaBVEHltI@$9@<9@Gm=osk8Q46QK;zwhyUe@PpymW#;7;Qr($(r
zo1}hrh#1VG61_-2$lQZ?WX(@fluH@FTRuoE*=ep?Jk~)|59K{qK0_6Nn;qzO9Mlji
zLx_Z$J6!{Z%!6DNQ7cVkx9y}v$GO9!jr9*=I}KIdG*JpnA$YfBN@6}a0malnf?-cQ
z?}T`N#xm*e8ZPqDg7c*4M}gaZjG&%B){i|?B7fA>(vOe{8QFbR=w~dlA(xLD<7=a=
zX60tl)8s@|iM@EA%4h&k849UIbNbswwYyOM?~36p@gq>qdaG6k{fAG&CP~A4xB+5E
zZd;{!6oXeh;Y5>lXK^}MuJ&LM3!hYO*%jU1KTN!H&|LhMO^bB2`XEBED>co`DqLA%
z#LImiHm|jY@uAJ(i)p*6;E&t0Q@c$<g~^TFdo}fezYsCLMi#**^bDI?9d9_gj5zs*
zeuYNZzomwo64oEZp(`U&8~HG2s=vAnbbH`5ryD7cl&HsglQld&)-Fl@hK)}ZxkvNq
zw-%N~#A6HTb|rLfL)2qdk5dh|FrFxf2?b@|vKw4oR{&9+$3Y=Tr~U{6Rg+w{?s&3)
z99|pX0^nYf#9)eg@!aJ!xY9V#qzaM(VAfd^)!V`v#+&T3K6r)vBhy6G<5qS&h4Clc
zZ;2}X#a5FAb*BT}%YjArBJyWZHlq?!sFjt1-(pv@X#Rclg{0o_+L$xdGtg?2$%qO`
z8G(LZm9fG8?F;5d(=teVG$4pyu`%Bi6~QHL#RI{U0N7g?5iRhYqeqq{;4cWJCL?;_
z?zSg^MCleHaM1aPn_^Iy0aY@*BR5)D$QA?QjGH_)C7(R(K5dsBe8yyQzaZ=f^<Q>I
zR_&H|k_j}&*g5f`;N#EeZ}TB&9Y|c*Nnv9ts0Wwq)z;+j?s%t3WxKwCR7&TIEODK7
zV2o&FVjiqZ8NSi$)8?1&(KRj@m=Zg-u5!6iy;Fofy!W+!Wn*vOT~Ume^~{OxorOzS
z*v@tH)Y!M*%ZGj*_%6$$m0%}&QKx1n4Jf5Nk&uDW$xnWdn!4;^A(IDb{XRJo86HkP
zh*FDfh|T}~Cn|`GsR68?niKY{5k<KZQ^Um47;Osp;1ZI_$aU>oZBdZW!u@&f+0Puk
z_$NP$YBBX8DK`HX^n2W2K&REbWS@@EktNKLC}SZNom`3*T3=L#it94(N<<EDW1|bI
z1^j9cp&(h@=NVispLmUpDf~BZoa=?!A(C-4dlMp%Yfvhix1RyVy<;V&x<?vzJO%5?
zkZk@%Jy(F4pk>I4r|}{%q-P!L(4(KJA@?)GTE*)rTmPXtc6D?u5)NwyyNu0j952~Z
z&zk9s@7z(d#<nzL{vV>D0Q=xu1tS1uXKDM-4+%QV*N6|sGTt{dnZ$}jolM|T2eIK$
z3G+Jo!(~j0k<q~Hp<)lY@9<Lgu}hPllo(@uqn}U037+OKo_Kj{I^oC>#(n=l(GY<&
z)L-50v(M~nz52*QpO|3YeXA{T`VW9S=_cLU_8-7_7w-dqW08)PX|2KIuWupDr{@E$
zD6=@XaR(~%d43W79ajOG?Cj9E%(^wfw2NbtEV2znIaztAk=sE(6o9}`SIFW=sDGq*
zxiVKUPZPs0O(SJ`#Hor>!Bx>07Yq$@EI94mcu~cLw;`p=qci`jbZ2sX0+qSS5+oHa
zNkfzmr(U0}(+pJQo^<0oHB+9|4}QBGGBYpmJ>{vziGYqh@R$6IJZR-g`w2y|5LRj|
zGh9jV&&EY^X|JNa6wSYXsbU#CFwF5a&noh*qf;XpD<s*YXAAlU#R??&%roynmziP%
z7aZzRdQzg}V&3gn<^PiB!7(1M1Es$iECYZCf1d9vY++mq0Q@le)MIAZCG$Audx`rm
zi(Ijz^l`{$$}pr=g#{q)JFSIXkLvn$;FFfSk(RY1s5JU7qTR)Y7lGtwUpl&Ex`Y}Q
z3|1y(Jx6S6IGf&$d>s4C@P)Wtqo2W*iJW^nOkX;hef3GSlWxibn)AVn3KtrD>3&V?
zBJbhOktZ6zI@|vQs4xzFcly!#FH=xZE?FyzCnZ@RKUdnxAAj2+0y&)2nNGw{l*RMR
z;)9~!tn&ix?t#7FIPN5exin#oM9#;kR(nh<snq<&<RI)6REM*Nd&8qa&t8<9WLM3*
zOuz^-_#Hw!Y^S69!{Ez?2Rom*(&%IE&6$%P>+A++RR3VR2k+AEclEH~et46_AU3;A
z->U}W#V>8}yAOt<!GzUnV<c6$aeDXUX@9kTFe%3^QPIp2Zf1@gfw86VH05djhcK!0
z!_S?Gb+{yA>q`iMBU6QIMJ;FjO>doT9r{Dg<bY7EcgK&-L$tuj2$WdI{G{ijS~b*P
zRn1QB5*xGb&M~D3UERM$d(7jYh|#P<HsqN<zVY&P)Ckt2;84v79s%qh)-xB+3;Why
zNvqL(b0ztZm!*2oTNGDZ$|zyO95?>IhE9Q>>d)&~)fEE!s(TdGc#=I4knZplTW8iA
zhbgTL0bmvAJ&xYMT!~GmHui6U6h-cO`J>LX_&kk#pR=w;@?ge4FI5~OmlETXcGcDj
zVY}_M;T`d~T&%@{_C0*hT2cEkHeKA5^3q~L{*_KYn5)w(Wshx|Yd%vR#;jpaL3^i%
zq&mOsyIGvZ#lBT`Ny=VPt&gX<rWWrU>Zwd<FqgA2U}m+jvsPsx#tzAIoa&D@{K_o(
z?O!*Yd745h8&e3Q1Oz~OtIlvHu|W#T0GjkEX#v&5p=uVOqv}qwKmt%U%Od8^P!Zo3
zS|;0XdKvyLFHe`s&p!9X8VG6K?KhH-S*`3y5!Jpi*E-CT>X?Pim}ArR=jZF4PBX}!
zBTCuA>mcf<au4T*myGi$3MU7c{rHS(16dRxCK3a5@1TChlIn;Lz$tE(44e)2RpA8&
zWrTZ1+Pb;801aWmD*p!cG9>M>#*$a9dJov;8?{opfwmY5`B!rtY3E#@V)2=xIwgF+
z)DxY%i%5n?JM1!L=Sg4I)>=Gi6ecvr!n$qy{!-C5nh0x!Wkbt%A(sU!DX^~&!C97=
zH{P4e_rcIv+I7ZVMmP5^2i6LDvWU>^HvsMrWqrzR<>dZVp<xyKs}V!fHIVjH00#ic
z^eub0!&mu-<xI8f8r$*7zTz<w+M*48NqGh-Yu~y7Hc`rN?7AaJLq8tKNcw5iy+cI6
zo-mnmUanBr?bH^hTGasgIHz`{Z(prcJbn;4K^`&%;r05UXAwRVKi6~>@7K^*W_%Rm
zp-X#wWf;nISnFMVQs6lkLizw5AOl59e~_kBJf)-<B5_lVmDs~+TRP+B)pfpQ^L$F1
zaaBWay=VEW<kZ6|v45f{OI%s6F|PWC&2y-TE<reDA7ZMco)}$D*$Sx4(1{=e08R4$
zEqj}u7{w!XFfuQ}#?4`0*VRQ=G-Qx)F|YDDa-)eYDu3DD<2`vhD6vexHX|K$UL3g+
zDZkTBwNZuk5R>H08jXQCM|QQmCuIRnmR531Z{pg6ByOw4lp_3vxoW5#D8+6{)^c8V
z&F<|^0~9Ylog<qVV32HibP`h-LGUB)&DF%Suhs=%ghZAJ2C(nKfXrcCpwG5A*dHB1
zu<tvP*99}-Kj-L}&0(Dr(eAn>gcpc?__A2M8JBZjHL)O8=^Z;aiBOqRCOy9M-aCD_
zmib6xQZZMrt@vywR}Y`xc3lUP5;C!<Ae%WUH1LzNHH{pl3v=V0VQzY*e$J&=!9Tb{
zw~0Gdop+ErQn>uvVQ)}qiyBPnZXB_Ig!^v&GrnLn8MP^iX{IgG!d{i`@Y*=@@&;-V
z)dJ{FL}V@Nn|b1TZynk#mh@{d=Y;>M`g<HiHd?eo{A8U(Jy)TFnRXYux4-1Q?`X>c
zQ){$r-qR@r&LSP!PYaj-xUUo{okUm<I5Tal(Tvv1+`y+qhAneV$(?3R6Igk?{M@JU
z0w=*5bL@$Po0L$<F6p!~E(P5Zzd{Vlnk}cei&>{i@s#k&HDh`x0SLXrc^@sS!dU*u
z+{k984_Sm?n}Cqsm5-J=ru#M3(|EKaUXJbVkE&Xfj``ny<EQ)yndPw@2jp4MH!<4M
zkVpD?EC>6pLS&`r`(?ppjt7#RJ;6rxlVxagKiVU_QQOID0E#EIT4|R`S1jM{&9i2K
znHfxiuV4A0;;|7BOS35HAHEK8bJCtj8orq{Cj0aAvYsacAn_aa%-pMNTCoxh-zDz+
zfQF52`=st3R*XQk>Q6XpZk>4P<?YwufM>Q7Z6tv@4%2&Uloj|V^2mp>ftO_((})2d
zV(kN$G&*dX+_)O+%h63z;S+UMOIr6R=vn%`Glhhb^in~rf29K)13WCo0C8BGRcFss
z?#+o|OEeX$;{`Q69RcO~=QoujIgX)<@HA1P@nB)9r6_OlxKJHuwYhTA?k0sa)QBN4
z1cc^}0GEUkfXTX-;-WP*csu+BH*TA#>)RcL7WW`zshIKlL@*fhLLp`k-mEZ|h7`|q
zLpUPuMLzMsR*>|zq>@7x4qbj<?iAX#FxS4D2enzyYAYUOGPt^sgogIs`h3Gj77F!L
zcKAyd<k}iz<X~o8c!-8YFtkMOkcm7xCv)6=pf#D7j24<WE}0;6+<`Z~riQjzrlH(&
z+Y<XBZgYRlQ)W+-Klr^W&uFUFEx_|~J<?mTiP`8X?l;<+ngP-Jt$h_O(9tJBw7Kwu
z!YqOb9D$CNAntiyEZ5-ce&{lT`AzLdvU~r@J~W)|dhkhumDC!i{VPjziXTQ1^F>MK
z@m@fB;g>=vkzqmc_Spe}jn1MHGM`>^;y0)WvME4!K*#WY=Cj;)%0un+i5r<Sl+2Hy
zdd&_Kv$amoJ3s`#u0_8?+)yF6jf(2*?btbX_alWCK6p~j_Jtv9a%?L?%HG_QoQ?Ci
z>dJ;+GTYI+mtIhDs!6Jlix5J_;Yz>mi43X+GO`Jn>DI_3E>pb(aWhaR@B2ZvG<Gl$
zP;sQvBvJn|w)$!v?EOoGk_={l#9cTaGBD9~kySl39lYNqjFr+5q*wh1&~YaYX|pCj
zeu5}*k4sbO!4Bxa!-U<J_V#V$+F~Rv$zh0aO2r4$qov+<)WOXCN%ulJO8PR`AwkxX
zB<18LJ1jz_b$Xs&ZHe92=Z5&6CySWnYHe@!<I7~PFnyT+lMb^<VRm+7tGc3TyW4?~
zw_Xp93*tQie1jqB?Vv7LUX*LqfC&{ENO*10y<kdSCHdnS=r;_1&=$d%84BEGPTaL9
zXty81BpWO9ahw^prLZUuP<LPyzM<4%MB7srW?}(UEl&>c<%~LeC@Slk!t}t_peiUM
zP&!dk{S;)9<$ReVeL--37x-+<2Ls-4Lsx6tMLb=OEbZRw-W-TYk^<U_4g;*`xvw5v
z<($o((dN7whlz_vpP~rqj*Y*Zf5nP8ev_<E_ep6Aki%)bAhG2GP6H_f9_7btJhuR|
zLYmdC*iF(0&|nv&vf_X4`0FShUiJ_l;t%I&<;1HU4E-hDf&C7cX?_U4pPzn$j9$fv
zd%M;LfN7Cbzk@!^wIL!KBaF?ob2w7Bj0bztvw7vD?;_ca1=3+imZT@PV?P=DSBFtz
zyPQ76Th9qO^ctp_{li)**>m@wujRu1Ue+%kry+;`@STtc+n1(EuspHzJdv?c&8(<U
z?aV~}$Xj*~==l)g4O1}z_{QQ>i#yxQu(Vs|zz1ZtVa(vBKiLfk&uQx|fPn)DTz{#!
zjs7RDV<)@*ikqT6gxJW~Fx1Nu3}Y=b3q8kv$+a$)Gqhv40nN$rFIk#&5S)k5IZ3B2
zFF{W@RUO!t)7W4#m~l_L^06#jK1!<IDVZ9*Y!Tnsu^(lY(2$6Tt5RWOIg@#m*!qx&
z+V97=&iG<aC1Z=l%S#+-LipI&7p>N~@5F=wC4!{)_*x_i5koHSD(Od(iAp77WbEa9
z(-QLMaf|Up^y%rc<v|{nPNG)_jys8}oK-o8zGxTuSNG+eHW9oIhoi8m$iiBm^s@at
znOwL@t!H!$9g8N5qMIH<6>^w)?g^eNu&bi}1HAD;%S~4P1IQl^G>VlL8;L%;9=XQk
z_)QB^43<z(irgvY!4l&flcb}@2W{C2dV{rdFN~Oq*>M9Yb^W#6;X_F!)ykNNvR?MG
z@T6e89VYs{1ouaLHTazs9mP3LvrIS-glxz4Hx^N>wRI?<jTS#s9$!JTYv^C?hLk96
zHAVxq81~bm*cA#AK<E?6nY&u5qhXw^)GjXIlWmuV1I9RX=D*d;C{gy=RK9)}<Lq<m
z?r)unE;QEKs3JP%DaxdO-AO^jI;eRPkdhxO>nfH+$%f>6w}wyejO}Y1q0u>@G8gL#
zFYL*&IS5d@2ctaAi-^F)gG|?~ON(JiC%U8~F(v-o_B!l!9+;=M_sOmZS$c3};|1l2
z*LX=ih8P!vidOV!|BrOrsTM@D@t56SQnXwd6Hv9f0xbc-1tB`E7uh1k1(}ljTZdli
zuUj@G7uPLv#M%mE*a`qlFp@kQ|InrKB_jfjP#W^GdXPvsvf~_S>jl+QZX0cNSdwZj
zr1usQ4A5ozEOh((ikHr<WTK*UBN(cV)Kxd629jZ03l5>?`^KH{*BZs4<wh$@M%cV_
z>nq=UR!|#|#^xt9*D>S`NAXnge!f|>Ztq7cjKb*+P}rPt*q-<>lGL45!vj_Hz$M~!
z{Y-BQ8KY-ekwSt9qS)}`D+e`qhYCk$sf?RGUnx=5*K4(lcv&l7t$e!U$INbq4&$oH
zgPKm?7VU#ty4!yinSFV73IYc(c2_4GPRK2d#Ne4=eE(=K(;r@0r^ewnXFm1j9?Fp<
z3vC)8!6#LhAgMj(`<e;(dZZcm%WXUYU}uEp>!=ZzA&TOL<PCIjZK2*%;*f+H<)EkZ
zIF^c<chb2Yfj&NSbdQDQzs2qT4!>x!@Fxa(i&zo>x0y#zFA=x&sy-77ttsa4A;Aq(
zF8aD(r62cc{~w0hn{aO6gY+HqzVy9(@N399So|~gl{E9r$~%X8>-egqG;b_fH;Ct)
z*ta1pmyYsTvxczO+BuB~xl-(;6{KCW*3%9k>xCO2HgQK~pWQ8RvG(bHxTb!%X;-vF
zD^;Op*Rl$qB}@4tidNF<(sNv6P&#%Q)62fC-W7XglnBd`5;A6>N$uKX<mwn>R_~!r
z8Z}aw%8>?+8q{t`F>1x+=6fGL({55kA6zoL5%`o#e!)QB$<-zB_*!D^*57~lqG6Z2
zmbjLY*<V+2By3j07^ynuhCISm&C{iwL4cmxSd$I5-s52S%zhBcv)JlS=!7mn1mD1T
zJI%iHZI=2hE`x7m<w=v$P|{+<&gnKUqNDhi26tIwL_aT77@h`h(=5THLN>_aXul+V
zViH?NBJ)3K){*V#oQyA$mi`-Z*|~hHb?Ib`yp2o()c!C$+3h7F36twoHAnkK_KvaL
zEj~`WsQIRr9C<i?J1EUUDn1ACc9y{Fs!z|)e4_93V@wpm`73yD{54HLdv2WGFzxt{
zyi{LWfT$C)>v3Gdp-Nh6b&{JS5z(1E7nM<>yycIm;nE1;vUnlfYu|*Pi=ec6H;9_I
zg>hAOhb%%_R0u?%RA%rU?q}pn$eUKUE0FKBCX}AQ<<pnsviM5*i1;I>XDI#DE_Yy>
z#<Vs=8O2(36sQv!XN<ExQZmdoa#YiRuYJ%n_dRP24RW~Su56!2e$Fv5!AmwdNI!Dg
zY;9T<9-qwS#Oklzw#g}s=S7p)%i%9tGU{o!57@xulE|M+y!&C#akQuHMMGUbp8(eQ
z94?;`(lSA7y%Mj@&-ng5@{;(tYjj7rsLHR4EN<ZVKR~Xm%e`yzW&f1A$hV8>FUBB!
z1~K+l8G}UB5|h35emiH2q+oKJ1x$iThU3PB{VtWX&v070F4@C2;}|8Fm8XLcw}}d{
ze)6LiR%;5Q5}jnMdxg+1_j=GAM{dukKxC<I{N$`l68u-uqK+-lMBu~>JX=P)eE{nY
zOLChx#+swU94lht!7|DyHtr45dX|9iTcr-7z54^lfbQK{Oo?NcFZX1nj^I8`LaDn@
zS_jC~o_H-}3-O7VN#JXK?OEfE<wdB=6ObPYYwzd#fbz?DCUFk)ZaqnA8)1aAs<5w5
zvUo&)#CM@c^x8Xl8gA0c4P{0Y`8OFd3#QqjjP)VM<Rc3>AdRZ}UatCaTeL>Kk9@{A
z9Kua9&&SPPOkTC_FHv&DBKdU@_m#yXnt3OvvCY=%XBB)O%#nS%jV8$Usid^`Xvb~l
zADrj9$L^VJ?cp6GSt<{^rtz&caC0|)QMAXw^5#sNoRP!~eW6beagQ$|NT5QNpAt&|
zZmQj#r}JQ5K?V+vkZ_MlS!zoN$8T))g0$7WBKJf+!y&`VeVWP5Zf|XxVJ?Xs{76_~
z)QjJ)#fv;o?ppiwJeP=1i!uuI3%@?q<P$U$8#=#qG_$1%wa9=Q3G4XFQ#V6OvPQzf
zQCZ)b_0KB;_<OaN@}8&;emCRMD?+vgh)MGk+TZx^Kfv`_uz0r5Mvml$5f?417XZdN
zoqy`nD2;>HkzKBVUKsY`*Rlv~xi!NK3bEO5_;_l1c3l5!V*Lz?0W;P&k?L>4aA2cV
zAfCIpY^MvSop9e7Z%d$UjTl8+p8sp)pcv?lK$<EIAFLzLW-!*H2l{vGBrzdw5iYJE
z!J&0*y6!84cydnocJ%zi%cS8LWeWd+voZ?4dCzXn>>&-V6WutMAFpJNyVdC91`2z<
z<}5qaWYenZTB(I1aYMQI;sxm`qz_*yL2Lx=83sA99t_YhoCF##OSWf;3Hmec?!Q`|
z<pJ$9QI5g$`h%fF)abYEgX~bP`ow`M7HLJ9vZuw{lJ%*j+eo8fYOs{9qxS8W0p>~^
zuj@N})J)CyUm_<wACY~fsA)>sJnT1q*9YF?Z=KD@J7LUiztY273V`Yfo&F3NfX%gs
zhAv<kfoM5=>_=pccAF;0ZmKOm-HEo`BV)nXr?|*?2{^IS^cWrfgp|$b%U1oCRoy3t
zDy<(r-3Q1`p(N&q?=gmZ+^JEydcLuw`y<O#Ny%DsvZH{V8TZec^nmgjHkHCImHazP
z*iu~xNm$H}gH4H$M4<D6MvW1U_#BRW*m1Y`mh76%v7?l@V_TlBp|hn^daU&F>I2J{
zu+jdzS3}g2M1f=#2sbWJ&TZ`nRxtha!pGveFM&EufIcd2Ui+kL8SaMSsar^MT{>eM
zd^mRWjk+ed^Pmg;d1d2eQ`#%l%ZhMK8a)RtKG(j?wy<?(LT|IF<bxGc-XW!;4eO*=
z=*V=37us6hSUP@?k`~Xt@U-B}>$bkzAe^04g6+my+A?);3nRdZ(B0VZWwmX^>8Pmh
zek4nrlEmbF<KtcsRT}d*H<oX1st-zPvVyluQlXl&)BDkz1x9`v`;3v8T=d{&2~kke
zXI5{<b8P&gh^5tJjmMu4*R_?DRx_0tE&~`=p%*L#@zf#8#LDG!#drmU2BHLPe)Ifi
zugk8@Hu&znR;k81$#;;ojn4dFm1*VTTsbd3@J)W2mO=<l62Mls?VI(gd;R)tc`)-2
z1yA8}6GV{^MViiXI)nyyb1ymv#O+5iq)=x{6|ruGQp!<R7nI5eZ1NKCgqyo^g7_^;
zO9y&Fq9fY|Cl4*7{@PtUjG_07f;)A@pU4uFOQLGi+**QqrFuku^vePoB>7)aEPhf6
z13n_UqISOsF>@)^#WRWRJ+CXg2Ufa_(8RJ)9#<ULby+^80*j<4??zyMz#@cq{598j
z*1X7Q{?pDRIu}z64%x_GN*mtnY?6X2aTJZR@++Q5xkVXr)vCF^GgO(d7SG4}vyfen
zY>9?Ud5K)hKTkpdupQ~>oQ^OjAyYIkJ4Ve%?^dUTj?WwU+!SfLgVY;VP=!Baln~WZ
z{;QAP;?hn)4&XSJR*s54mTj&#P!dam8x(Bl9<}m>wyb5A07Gb(m;n^B&%(&kNR(cP
zT!^n-xg5b*KlkDuCc)CUJ{smGUATN~fvfm*MbLpg?od+!5ZK3G&7j1@5qplwds@$z
zH%y_Kvyq}aLE~Hq`*R^tQ_hu2xFMynohntdee;1wHIXj&)VzNLVjEFAn(>C0FCIzw
zYdbT%DpSnAk!MWD74p3^q31N=ks{3{4sXF7usWc(%eQ{u{zNCnC_5L)Z?ZbYAJz_0
zM3r=%a1xTzR%z^1n>pgV-3Zij>zwymsr)5<z2r5U6PE+Nd#+6HUOiO1P9*fd(>}o_
z+-nCN!@<KHcoV*z+Ja=WQx9|q-5P(!YGm+f^KJ(GYLpz$yhW6M49B7*=z%a5<fp%C
zwxARWfX&;70jFX+(*FUrOI?SCajwwWHN{W)J^9-PztW%-dsI`Xy9*uu2T1&|>*Gu2
zb{&ndPlnh`@y88fULmMNPM<FV$s?%+NPnZq(KhR-yGToU(+ySW*Awsm#VGy9ZIOtm
z<XN_NO5BbPo{BmTDji0cfzZL5RT{7xWEe|Jp|?e?d@MX<T)*1^)1lN=Ae(05LWCF%
z%V&(XB$TO~OK)!R4Y{jErr62M3?gBx+;lRPr3&Wt(Lr?%e9`D&#%anJ9n!uoNmsS0
zxr@k20gh3w5*(r;jYR)X6y3a$I5Q)cYgr|Z(*ox`$fGM{5w6FoyX6GsPHwzshBi&X
z8cUjfN+gFSl%ErzL*~6UZLs2)r#VK=_;t?wDRH<5ae5Dv9Bs1dQv22_0`*w?f(s~{
zOJjTNB$-;Z@|$zc+e5AKL=Su{E-;rKDZ1RC=3Es-!*gA9Og#1W7A|e%)@@<P*;M@C
zw|d#&+90gQ&>T>CLYXfw^K46VdXeJ}XdrwsD`j4&2%L`=FTXCb_-G-Y@&>dV4A*(X
zJrpE*X?-cR#x$`%cEMOd4N%HJ$Zg+lkT~iWsZr2O+>x-Z6VkNMAvb7W@uI?bdp4g6
zb^f~ltLIvB_)6?Ao@QNnaCFH}Y@h<}{qy%pu)f$7-{)SL4+h-TcDS~VWbtoM2b|eS
z_q}vr`gG-;URIsj1D11|CVwfGcM;!ED?YZB?)R$=Qa|_9+Sr0^{C0EZ`yBG(J><*#
z3etI@)UYSgm62&0_lViWS0aEXZ70d1^c15SaBa*Bu%DhmH}T=Ab;SGmJJF$sTANi|
zi-)nCGoYpAyEN}B)Z!l=%I8|*nX|D@w&njG>j6pc(ACy8ZEcm_Xf9_$n#<^FTq=)@
zAtHSyM|iu~LHvrJZt8QWcbTpb>J6(do}${_+1`!1CMaF(i0s8}rLZ0l<m}G<FYK~l
zF6{B00oPc`l_<{9EP~up)3V!LVN(EfPg|5*XPRT3|5i873|kh}@CHJ(li$pVd747z
zyQ#v~o#r^5FBBokr7mktf5g08n&(;ukE(rFJ60+hj)<srUbI&c%zgKi-y>BIr0mZB
zhKFQQUaFN4zCmgmQmoODEGqhv=jkNbynFnabzNnS{uxt4H9vO4F!NP+L52ukCN~~z
z$7z3@rGLvlPiiQx2+kJntWw{S>#x=yH0cop56UM@)%XcrSPrA@X%oD$Y_vN_jv&^q
zq`c=WPrEX%wx<>;#GCV}jp!@~efP$exsaOt6_Z`s#!P}gidN!)sq`ZN^l8flw=p@8
zj?mi_tIN^(#7_%PO?NExe`t}6#{n%n8Ki!z53Mbu?eSXa+zW_B9PB9vDs#VMVyxPm
zLvh&;<1t8Br)I<x2mT%mbMT-!u({_w_}?k=)Ax|#uxB?6(<Q&IDZI8e@$`&o7584Y
z86MZJ3R|V#WM(o@o?}RTLyo6Kt@Nz%;3lg=G#kh(JHG2h!XALde5fd2UmI&U(NkN_
zgW1R{gUDZ1Q^V>-dW4JzOrPi!Mqsn9*Y-Gx^@<3%{;V6dnR_4~8=-JtBOMvrq7(kg
zO$BZ}p$1hQm=u#WX)|A@nlZ>g7Y|#;o<MWt@FnuQ5Qw+XZnjdh9AjGI$zj-zon)=0
zC$pvt+K|atue0y@tc<lPa0X+lm;8_$yeH)L$j!{hh@1SiG*_mE5W5=-APx<kCpo!q
z2?W#|(n~U1p_xmg>FH$e9=D1;LiS7FLwvX(4YlNypYTkjz0KZN{3;X%F?C*nG3yI5
zX@1982NkWQn;c76e$q!XZUI!C>eBit)3JqOD%2)Lm%<Hv_<j6~!uZK0jQz1_PE`Ue
zWBWI#<Fh7AT<)lZOzGno6Lo<8%$&}q1hn|U6aDE=q6qhTP*aoQ9rCAIeU_gV>j+)L
z$K4!SKQ_n|(%d&S5;Cr2dLm^Hc<^>~w-famV^t+c<Lmu?B#8M1%#9I!uO7xe#ZKVh
z6#+ST$=R=t7?t{BdV>?)X$vfUjR^_S#5-s(EH2*WBrgYV*>RE;o<io&)HYxOmQLdN
zt^J+7U4og*tW9_DN6TRJB)hZg1~zR~duwEk)Wp5#^X`1}QDO;p{y5Xqio1sfQlPYB
z+%xJ$ZI07+#YXV1{v9HSt$TPa`4Y<Ly;&kQN|Fd6p|MpE<SgW$2_#)i1?|Qc;46RP
zD)uHXO8;x+I`KYhM9o$;Fa_j3@Eg~ciuMxU&Pn3pkRz^EM{dq}<NsHL>KS|HW|2YC
z<^JrWS%?FB!Jt0n=5b46{!n&bj*j$8+Frmens8omcr*Cv>)B~l_x!M%x$NpFfMs*W
zU+&{s0~maEVd*qy{QdSTG~pEk$JwFs#czTdd5GZ3@g<GY-&coaK?bjwa`)5vT#V#s
zEss$M<&Z%Sxy(bYtWtUcEZ*UzN8X)Ze~<m0QnYNV*kdTnvucu;QB_K=y8W{WS^z^Z
zG>RVXc^E5QDYl@T64I820q1ED*;%*}D?^)j%fHI9-Wf;k9T)S~k+77jwJ+d=82GY(
z)TI@3hQ3y`*MNMw9VwA{Hz}<UTv?&v(nBy!>8nF?@aX{KBhq=RSOCe8T#+k3pLHr~
zy*1eGNSb81hUKvGUz4}(SvGTIr{nx3HmVF+rSt@MvCWWhs&e+S${s>c!dw*xuAs$!
zi&#D_iS?PbTI>ws3h!SjO1=<Oi6|Zc{r1Xz0>^X5=MhLhOP6QTFOIElTW`k8+emmU
zjM^ZN^Pp@CXi+Y`ix|y5iL)%$=Z-lHW#nEFocz7c*A;p`LEC($8O%+;p!MhM7Q?yD
z7F*(9t_p2*jVP-Nx%2rTC)+ERU;mOiiO7f+ERx)DIXDZZ*tWitL2bN(U~e*84R8{K
z{deN#oIjX8LV1a8z_f$ynk#s9&~7PWR0?i2k0jKW{HrCMk)7C?R?WKPM5LqN3)>NB
zlRheWhsXv0arAG0U;A$E-1WFJh4j^S=3jA3aZOetxP10ABRL$cg}AgS&R87<`XebG
zNv6v;oLhI50Z{7{ezvga<ASdzg?>|xmJEy)MmeEF+%MmlB)5%8Mkj=rmH{KY6t4yf
zA6OY+yCG_s$(ZyiIW$b8pJX;nvtXY<T>$MR2k7bK72dV;zXT%{rEw-!O7D&bch7iL
z&T?{zHqgYy`&VT)HF|4cE7Sd!T(xa(h<6fhN&Sw&NfLW92L+XLauw$LNfY+K6YCsX
zn#D-BGGr^&E|xP@jK)1DETuM8KL$%AHVnaqg54A5ig6<S8xH3xSJU;5Qvf)<Ue^@Q
zwfR1bE&{Uch8Zn6ZqF3y3Wn^Yf2{=EzQY}HD#%G(j67)|!+uVS!mbd2<`-wJW~Gm(
zHker&x+4#}wfNv4aes}nq!|{m8K&&XoM>lHfh)4*zIYvw{Rc2@k#fRUl`x6v^}0~$
z69U^R2Fwl=G%qu`d^(c*3kFe{bW4OCrw%-00GpJR$dr%ExgAa8;R>;_LXxZEDm62U
z46M=(x+?ld#3()1(^R${gDz;Aj+3<3&y-1d_3%l_jTZ;YCRW-%C_+z;rA3M8;2_-O
ztB3sdfy1N`1#&Mswk@b2X&wfb4L%Hge58&>we+;;{{SXacI2;!!c$Y;!puo;nlaRz
z92E#1iTumx%n95@mq0j`6VYw(vOyH`f^8Gk$O?8+zCMJj&6}}ExsU4&lvU1uqRM6Z
zyCR6Vf*F>LWC!2o0viwZmIuSz+%Vs8;Gwar@HMWz2BF#e`-q-uQ2V}}<c1#e^5%}#
z65{lY^S=DfQtV=<zTI=LM<W4O+~XgGl3`PD(k}H}800cU<1<5_TK)AnXO8LDG>v56
zW0Se&d0+M!C}46N+Y#@AW+r0YLTfR_a6mbWp&%wX*(xeGMj~yLfK1D``#4HjfveHt
zg7_BSd~-c=UAU|LLIE>Gy2w8vTrYJ~IV)thp&7_;TADD{plC;$?Af+Y$6tD_q<&@L
zlkLraxo-8nQGwrUGl6qoR641zDBZjs;0_sp^6Nj)C3H${wzl=xAqn9iMzTDm(cv^A
zgfta-y9O1;9ysGbF)L%eQ9HbmQONHdhx+?67b;iBLCQbTUnN!I<Xz;z4SVh}lC<1i
za!xR*)~r?jOXD}SWLE(Nk&4=95A;>R(=+?0wr-m?s_Gi!taihCHT-Z8U=YGt;J}Uj
zC41i`ZC8v|932CEaxKvU%zf|3^vzeLuiWR%-T%lZWxl+IK4Mr$i%mtXz!pC~FV8K}
zw6gLj@FU8Y&iyTl0deE}kCJ)2AGoX)nc@pGltm>nI-HOFJjMC4z$`C=@=zG<+A4y*
z)!N<OdLB^GwcJ0zz!j;mv!~oahT;3N#N1`|56KYUi2XRdsqL`aN&NCJm8~4Ao$=Cz
ziApp9c~;6>)u@wID>~wIE=@<zbVi)0__Z1Bg09bfg@IU+yVG4jaj0N9rFlT*#X#~J
zXpr(V9H2NiPS13sR@>!?On#|(2XIv=VEx+<f3VYDR>dya)NeGTU8EPX(X38AO#*Md
zx<7>h-LlVaOX}>V36s9>zAb+KK1|Qj?!qR7&bO#un<slRVEu=ztB!cvS#daYHuTU^
zv<WaMO_*0ae5hp|)z8Ur5ATVW)9jekgh|}uq<=ai0kq5GUTugo=H5h+nb@LJ2713v
zcK<n?o<8m1`!4oL`&As-1aT<2pPk{2Iqa{@KS;B(qhh$1_J}YUx&%;y;Vhxn)}6tE
zec%Bc%bd)C8TY5ON0uLd)Y`WerIoFM{~PrG9xsgvu|KQiKftSD@%xY0nG5l9*=G_N
zwhp+iyGGB6nAu)p2%+OgR-rf1^|5@)yY6xi?yCm5?$X3i2Tqr{5M%HPPTe%B9ca&d
zGEDc=?L=u`qZ~=ILZ#fNIT0!i>}rW7=>@!fVY(Vu3wz!1A=gqDc1e@(fSk6k`ez8a
zmd3xml%$u}rrdM<WkeEhwXrxEOn68q-E`vNC#uB+5lBZ%xc|MxHQQDZi}J1dUKz!3
z>FG8-q+muTC_ee<xMq+b(A8_qNv)5dZUAU(V89>SQiRNFia$dSIn!eEm+`-G!#~*Y
zqwSypK*+JfrfqTBIUu=GCkrbxj_9-flWg>2BAW6TWtvANO<5BX3oyd1PDwH{(%MA9
z6Z#~Gab!H%Eb{{&b$;N&D4wu*6ANyC;@vj&!F8bm!IM-6TNG1=B)_dFRp%2^%<s#;
zm|Ny!#hjB@*h3AKMXg35M{Hg%`zJ;>cZ3jzi_c>GNirTERBy}ZL#4*$6)}yu*TW<R
z%yErG@uFv*8w;}VJGZ7KAKSTJq2Y<=t|QsjsNr!^oRCuzN@DxnKfUriOkv=m;iY2g
z)0JDNlUpIo<@-Wzv<%9IjU5xs>zYmTCdYgfji2t?5aX4nV6LMJmilY{FO=5w>*#cJ
z%Y@X`3=5)Uww8W^p`Brfr(hX@B&5uhWnwp_0VuBxThXtmCuseRr860YEaAlPJ41{d
zHv<1Stn`*hF8#z6JqPJ=XV6+u4Ms5ZH`-RcA+!I!{R@9&6`d=-_-8lCxqhI`-^^J?
zYscxYD2B|@vVus&-N-93)b63*59)w>0>qhObvlLzzNBVx4&oJ-Y&>@IKl6-%D%8TC
znzQaJqp6{zJ1<2yCzthD<`F)MZ7zIGQg&#PBa2ZOj%TiDUZBZhOv%mPp_I7S@}7Sm
zpb58VEFShfFgg%p(AHHq^AV+8Y3<@0K9B0DW^7oCMszGMp?MP-^V!VX=}~2!TjguK
zwRytG%x=4y%SqN&dFpE26Io1?Tn<e`=G61`i2^Q83{gb2lZ-w$CbkjnX)rDCW;t7>
z<OSNGfypq^^6;@XgqJ;n_^mzwY@ak{45o;3Scn_{Qf@e_hHFm*8QlWEEkut_;*b3;
z)1#6)Jii$aB2QD(`zbJ`OG=y?PZS@R+Umg3zQNXekN170hR@t#A;E;~!FnO?9q%0k
z>ZMJ^ZJ>&rO8tLiomEg<ZP>0up~YQFaCa!~QY<(WcM1e|mqO8^MT5IL1a~R!8r<C-
zTCC7-=if8?V9$S;OeRMwEAP6W=f1A{WLn}WhNDBiel5s_A`UW(E)EKd0l!z1CQnM_
z%PV0;u@R_}m<J!Cx=|scamd&Z+Y#~R1wD5rIT7B}g+|3(Z1kBLVCSA`DE1Q}y`Fb5
zE3VM;yB)Or>kQCFJ&gO3KxaUysy}f+kzL;`q2(3(zQN9{3<$4Xpp1BaGZ2!+`mnMq
z826o9rvbE|!(5gMBC`B9b!S1FfA_oqy@HU+UT|8_*^#?06<CvU1GB)?Gx?`)&-3_E
zOK70xSMJ2=K`!y7mhI)Kuk7T_Z9)jRUcU(<Yt{}P?s+OC&=6xj<<%%P=mYs6Qe<H#
zYB~C352XX{nFW{qOr(TjeL`(lYM<VZUgoQX)6YZ!B@F7yznXp)w+f3I9V3y;UDPl$
zZ`f~wfXMbElk&<~Q2VQAZyr_mUg~zXtUu)jMDPBv8&Dy>o3_t1MJBJ}x{+b1pc6}9
zeiwN_dyN6d@}<2Q21750H<I0;#v94E6j)1}z1wh~m_>CHNb`YfB6zan^u?-hsUeIm
zxb?G}T~Y7TwbAtIe*l+%EV5ACcLN+Bp#{I7_N^je2xJWUsGV7XY89G9typf<f$2l?
z`l_nDLH?ta;X-<kSEUl15_V>nKg{sF&__cM3XdUif=?!_LRU}Up=GWEhlljzm49@S
z>_Bnk4xGz266+)y6l>HBFImoAgY%~Hv@ZJZ@;82%cuwGEW-n<dJ~X1|)D4~kO2|jB
zVz)q-K&~M2K;dKCK?XK9b{LAV{70mC&DUkCJ;10~|B{%T`DAB&icUuDKyhm<ErT0Q
zNTq*;lOpVr`7|qhx0u}Elj*kvhp0Bb`B4#lA`Os!#@|ZOmw@IEPUIFI5T_$bSAKQn
ztnH_cu#4ZrWtlmw@jUXGYr`;n(v7q1xHB1UgnKdjOj}4ah-;d=e}Li9^(r3ytU`$?
z6BIB7p4l{!%C{S;i5<GgG*f=6UqS13{fNCQPh@1YaX&wQ`nt@XGCmp}{jF-kbm>Y}
zddymK08S34Mw4CAAy&UX*KUh%uR^Ku<Wi4F$Vp%P3*~e5w7(kWi{r-1FUzs+v!p-l
zmqdHXjTW_4^?h%yqd7c>De?VkJMHtw&i?=rk3DY}5*Ti7bHirh2B_-K2wzo9BrnRy
z{sY`aboDVMR?i}*80{Qne^5WoGt#YH5|d#NIPS<au%!Y>{13J%_<v)YdeC20_j=9;
zE*%mjeTm0a1&nDCDLUd|U2EgG0+wVo3;5-)w<d}I82;`wG^dhsv2h(_NLdVz0KOsq
zX6PCnzSyPH`TSw$a=Q8Cf|f{UYw3Zj`)JaZ?*2eRh@Gg3OeC_nidMKIsQpAZ9@eA<
z4J9b2({jcf`3E0jHV!|g;tCTk61mSiUuY9Ut%8K4Ytq4&s1hd4{^&N<f#uw}ZmVJY
zkU{cl1MwDJ4w^@$go#k#H8ojeX%QAJs%G;f81N6iC+sTrt6ljZ*L8G+j#9W9eSm)i
zD}t1wFiSiA85}{qRhHzq=6z3z(?t2vh4AYiniJ50_IvNxW?EZU_`}E6)0hXne6(<I
zMPp-T%7UWQhK%^sb9}!IvU$7l%dbD2op5hS?C>-tO%Zw{q=CyJcI-Uo*S9Z74!*Im
zs$2XJ<xjy=OnBZ-)_FB9=t8;`2@?ZF9KZ<N!1&`3*Bp)I##y&%Zg=%ism-(`dN26m
zA$K;Y?Ctzzp1?B9T|<rDtQiZlEUtfgz`tFv5Rvq2R|92ZFV$0arg98@DvgjuYwcsE
z$LvoBDxpDN#z7dNVn;}^Z4BmrfL|<<<>-p71TNFhB#2S8qv1j6b4}4)H?_V|r^Xz(
z=oHyqQ+R4rq4h@QAjCA)W|+AaJCm?(7m7%zn!C9+(TM7^t$uFW%c}}Zx=Ff0nKViO
zJZJYkBb*IXGG=P%Pjp){=tms-esZ4tvk&6_U6paQ!bf{nTcZn6TYY=0(ke%#Bhw%6
z5E$T^cx#GI4>XBCA6YYqM~H#5xfE7eXi~+M1hR;1gK&;(F;VJ?b9%u^k@<Ij=I}K<
zt@OSTw)rM<sVZ%4<*(rd!%ANn4(3L&v22g_<`l^56C-2@2ZU1Pmzc<L1iojL_ubwP
zp#X^Crgu%UGbItXas}fL??z2+dX5fWQiOL;BnL42Zg_`0)&2mO7oK$KVun{l<96bj
zVUlB1#i>j{ec<?CJ8Uf=*p2gZ!m)<uOniyFJQ&%Z)nQ~{IzPyc5#GWBfrK?y*2dKb
zf7%Uck|1ojAD^|Mj$z&+c6(fLeE}kpjmLH^zi18r=G~@Ai_~mkMw<N_H%VbEDy2s+
z&q$ZQJ>_rvT+$}O{VIJ=E{mH0P`}w{@vi`Z#)ov@962i}{<?XGk6g90U>w5<w7xzh
z$;$fjX5q*mN(+obxQ1(54;6q4^3xuV3drDHP@FQc)$Vc{8)Jv>z4HQ7$AbgP-_GE@
zZn^R5;W_@vHLnHIVaR0_If@YByP(osy~9JJdJ-y~`LWfWg0^gKZ}s|H)U`gKX5zj&
z-P5)9ViVW&z%@4F{;6s{X_y8y9X5`xvgU4kL}1-<87cP}nZc?3#6Iy5Rm?E`{ubKZ
zsmw!i=6Slutj>ijZ9$Q7tkh$#Q*yTe1Fo?9nG+rUjaU?{7qfL*UF(<%K2|C-@g-0<
zqC-eBlG?A+-agg7^S6f%W%0f1b>|y2=O6G-b3gvV%_#<xD>FENBA}6qSUYKTYfprf
zv8Sefk#7u(zGmn>@Fx72OOJ`)Q2|$J{~=s-$i^VjOiX;%wvF;d7n-iQv*UJa*v1X-
ze3N2Z`+oFvemlj%j5HSkh)J4R%Ag`C@b{#8V?pCBS0B~5aspB_(b6}dk=N%5>slbN
ziU&`5KnA(7K5Wa{N%dSZ>~~00vV_Wuu-i!@Ir!TNv_#hpTiL`wu;h2LefKggI#kJY
z=s(A~sHRNk0eqL8Bw2Jn+v$xuNT<*HcZ+Fz2(=^r2N)o<BR*2dRfy^%?^X3GcDaKX
zaX~hV`@;YVWk+5jnsvHbW-Y)kwuYH4H^al0$&V%m+y{KmIFag3aOeyY)B~Gq@;^X;
zc6Bjsvw9ekOC{XIEJ5P$2&?95lj^Uj^pq(XJZ$}3ZA}`Sne44AnSn>Id|lHz0&6Eq
zGbLaAfI3!+-uAK6kyLfS@vDdbi7VMs8CG~D@nk4ENuYc4-M<8O%Qm4*xwM7Tulc2w
z#b6n`%KUvaPG-z&0m^fgf<Pog>>5=9`7|jEG{8xfD{6sHqlNqC<mmxEw(z0HGIOfN
z&%2G_BRd&Gnvi9d_UBpcXgq?%c(kgOA&3X_jA-<3&-fp<<hiDY+cf-AFBMxh$*tSK
z7kC5}-*t0%>=mFWk+~ZSAeJS*D;MhRg?cCdTb1H1gEO>racerkbP$R`CoG}pi`F_;
z_>$OaRPeT@fEUDfmOnpqicVBAVc1|L%WvzLZ)ES|F-r{rVm}{reY>PXWW%c!uVr&L
z;XVJ>%$5Pjdp6YJdC@y9Vx5Od->FzLG&UJm@iS?So&M9$-i#G#Y!QS<?JLHv9=96W
z<ZWfw7{|MkRbqDNVyScixBT$I;>xE_9A!#=o^gw$xnUbv%@c{%17A5v9(Ef*USD%K
z44@rAE1G;oG7|S56{49b(XU&Ztli111cJ1hkDqJv64FvOd-%onbxPa1_cUzHCy|*7
zNfGW!M+S;oBh?1!F2JY6Pgze;D|cpldPvXQX9YyfqQH_o!md_)lme;AZ)i(dQHD3?
zv|uuYYs&BQ&&RUYL}4|u-7!|Q#qV}Gzq3GGytOWCd7J?ojs7a9M*jhtMREOreQGZd
z@(08rXFuGlT-aahRo8SP&x=fXFx}}=F%HTZSC!qP@aulBPg<LwvF-N(v-wq`{&qSX
ztq`@*%!gl=-33mZ9Ml~ahE0z4#JzucVsJ#`w$(_cDx(G;GQ;q*L<?YDTf@sFzMqQV
z8Ao*R{{jnv|7yE?+g>bQJlKV6t92ptA9uNUiCE|OymCvj2Sq)mQ!xUFG<QvAMrzEv
zb_8Z;Y8yH0g@rELMkaNm^bBa__g3?orOQ)q{|(vR+}EV$5V;DqaTy&6vy*BQ)zOM1
zk{;*9tN(suiM{;QxzSL5MZQcfYY=k1eVDnWb@5j+Z0zqqjp~xg5<Wh7i@lFpjk{a!
z(7@Zcyfg$#Bnhl@iZJGO`Cb1n)x5&J*j>bZNWZmNuNYT3^9#d@Xc)f_MEh~VH37>Q
zdsAXaQ6wFzTi?EZqp;{7%ROFJ5XbB%q_XMPMCmy&BBtTwIMr3+x+wym%;eA9L=iJ;
zkwx8BouLKJZN4J=9Nbhw`fn7~hxhNHF@Ln}Pji&_*#s~=`$$7O)#lTUqjFH0<dMx~
zsVSR`eTEBFMFq-4Z)F`SrR{7#x=!T2XL)b=qjlGf=bkt1x(dJd!KLlO3H4XF+@U3F
z`Zx{r01_MHwpBWJ8b&8H!4DW>P&i2aizWF^tmVFN&sRCM{_M(51l*_M_KZJeFrYdf
z!_Obp7GX5dQ<Y%zQP~2iGzA0MxT5;sy~kUwYAKagNs!E_Yj~pD_K@z6hO07Ub*gwx
zBP&_8A(a(#KTn^h*dB#66xvSQ&<5<8zf%mm`-qKcyTjE1pI8#y+2X0k==K9yz=lk*
z(9+MnDS9IjIUf#tSOhm_oDy$;J~-A<04bG6GTGCm{@rtj_$GYAMl<eGyyNRLVkH|c
zyNX}ybkCQ2_=T+fD%YQd-$}&{Ano-iwRyjEkYDRjH-|O1`HVTbJ<w~Bp;_)x_Q3Ix
zt}qXokFQtH<G1EQU<*w4(vS2#!gQ&S*89WCa{L0#r<9RXRcXghFS_V?AC492Yz=sB
z(8_1rrf-B^2<OH-;&A<h1R`_dcmAaegt=uV*8#H0_W1_lv|$KZr)LZW=@D3Qwi}+x
zT<P1$Y0~?$%ow4lwHIkF!pF<~8AeD~MO8Rn#q+tR$E|8~_{HIf^xp3}jEU`H0PTGg
zAKKNaDmX&fV{qrfT$dMEo3z!5W9j8ORQlk>-<g5TtI9|tJn!S*6~k4`2!_A|(vjX}
zY>&hQ*In7ZDOpWfO%UeWd`jOaloQDm7HqmA@$o-Ewdi--l;JM}y|I1d%toKmWeKgp
zJ|)uvcH%{qS8m)aR@5sGm1nw%(<8iLU<k^FJK`Tgpqw_{6Vyv$DMsJekRbVHTwkcu
zNCf)#O)E!X!(aOTu8@D7bid%O5}ldK^m5;bZ^|7_Xp^2-wK%7Bvn)-0w)7z;7Rrwh
z?z_mbxTawor+1~sxp3#IkmyPN+4*Ie>{Gg?%QS=88|wF|j;}{TW%e^X-9QSybp^+0
z?hOoEAZ9kDB6PltZyKB080)=G&2FPcll&gK8ojBL3rqDprmXK?DvWEJ?wi&Jh@`{*
zwRxMdMRJpQNgRgQZT^wKy<}oMdnKXU(HfJPKAwgrc`(^o7N?0-*n1VWrkOsbdJs>m
zNy>+S&^&`<2gy;y0oP2~#c^3gr3B-EBNr8ryluyPZ0@E~IGpf3B^<_W3<6Ve9_DJb
z4c3YdOW%U!$s)wHxmS*C;#^|fNqQs^)kP@DtKtAhg}aOKQT=3fNjYx>N(gW@6$5A-
z0{Xm7@T<vh*!Nw?M>X#h<G3?H$5jQU*ZVk+f@NSCF9u&Y;2e801y$|a$6Jl2)9VZe
z<kj%`I-x`D)xoozOvun5mf#*1tm)AkD5tmSCJVP4zX48HLjm+x*Sb$a^}3OKJ?~51
z#g2o-FOoR{RyTZ{YKKrI?!5RJ!YHS!x14rzX~%toOT;y0vm}zVT+zp}NQf5S3}!xV
zYfij$2Fo}<7IV-J3|VYSKl+Mzb`PJfC>Q!!8?wWvpDfC+IFXtFI4Wg(J4ONxx=*{X
z^vxm2*y1#jnR-;3U-`9M3+cgGj4j_qE22oK$IEBpzt&*Ra1v(zvJ5L_6oLt2Iw#yL
z&lwYZ#En(19_Rzvp>0&062y;Ta_KkqZRWFEu{vfvGu7M)hZ1J}ilRe!&OGT(Q7wxm
zracRwRklf`&ajlBuu3lG4u^N+qYXU`-E_5J?G54|n#=6<-u|Ja{$l`VjS>12BA+Wg
zW??wY=gIy{fxQc=1W>#yPKCkYs_UiSmI0!3jQ9`B>ve;m%;ZK-3ompRwb#HBRDur-
zzD|UC7&~Np#Sh*{rl5erWFP-YNv?NtQG^={DhM!S@r1PzDzvZ81Mcy@UgBs)&sFMu
z7IUb|(2u}ATER+~;RHSn!DbH*ickq(@-@f9m7Zh6zu(?Ta=e(HIr0IF5_~|Yk0!r5
z2R$5~)B6$~@f;-iKqgK<!jNz#k!xEPVNA5eSu~W67LzT!FLjExo24-89&cbs$Xro1
z@S^qf`9!T`@k8PoC@?I`z06Eqo-U<dChp=JM&?3CM1;#Bp5isvVLmRr#~agS?hEGX
zE!?7g1RH%<VP;3JRQo-qM`l;tzv+PWOIFZ2D^!ijM=~YN>1O>@i^IyVDwH>a?HhjG
z@AB(*HoaVn>{<1ubC}05aCjAJUs*&Co(!156-yU#zi(*9#^^L};I(3Uet<Zzh=N|u
zBS#%S{wvV(mO)eFXsg0@|2~Xghk~RC5EMj&6ZXkxcak_;GKGxOl+3);6m|WH7BHfT
zC(IZTn_XvpFn+<?<?DK@F1u_E9Y)hKj=6R`J@3B<*8Msh8=ApS{ZpK&pi<JL*oM|-
zax11F0{%;3=*zbJ*n4IT0U>}~fBmzEb*Js}e7&`2Wf#AEUu`SGYwe<`DsapGYpEc8
zFD5hr&F3&&-k87}!*n_0pQlNyEP)R9m@I+16ucGw<;VZqr~Q(t9fHab7|zG`9Wdon
zb8+cD$k<gMMirZ<(Hs2%z?ffa-5KmuUDoQw(l9)#=Ya&~+qrA)lpobGJzH5WHzk?d
zeLzYnkR>G>X&($>Pv>vxF{zT5MyhtwvgHO7A3=FCRW5Yjd9^p0$AA~$7uww@Vfu0!
z#`9$)Nhl6KGFg?A5F*L}(xCkCYp4(Ij=jdCPQE9*y|POdQMT^8)vV*^or;^wZ+}LZ
zu%Adxx3r?hc*Gsoux|SW&UI?pRVm~VG|Db%UKs~{HHv!Ja#9AZED;_2rD0jJ8R{5T
z46|dKK9l(A;>hZOnM!IREFg<X*4$I_?*UDymgas6`XigjSMdl+B+*r(jzB7M_DNk?
z4}{A8+`@vv208NJyE(UGpEM`cvU`G4D505rszkKW*-R{ha=IZRooRdx=-4v$*Q+dL
zj?ATkVX`MS!9{Et&GPFfOHuPjiGP&WGG~7F8j`~;BXHxVhQvAY*+)W=tjL_2qFG4|
z7lrd^dp+wZnUMy420!Ef0Q)c4kPBDdG`g5m`KZ^^FLx#x(9Vw0HS#nr3OPcQl@kqb
z!4jtuz1qZB2W+n^q&$Fl)IBJnVT6<w&`#$`m!u74#C@QVGb1)1l3dyAs3fwwg%zD@
z;sP1C-EifeA;_1;i}@TOz^|h9Ee}rFzyE2`eDL~+=lS&UCjO{qIBfX~)hD(jrC8;l
zA7kKzqM4`S6Nr?C{)fovgsQsr;dC+~K5gD%Q+w80b2miI(Ez(F-nlj|Dd4sQ@d_HG
z4@iEg`Yjc#spLw6DQhmd|Eh&KXpQPreN4;Y3$F3*z}(D`sj2eU0s9e;@Yug8nin$m
zNB4vhZnErS<iA973nz$935!@KdQ$69be-PKSx72r3UbT99LJ=HVcbI?KC+y%1)C&G
zu+!5~F>I=9Vw(TiS)GaaigTcrhKUwZkC=tOd0C$n;N5nfX{#e0jzlSZiSBa7JK5b7
zK)XlCU7!9}zF0?%rwwX;lxsrn1*|ZREn4siLt}#K>KOb;JUFAoInB0egL>(!`4#;Z
zZ{|^_;-rcRl{aiN@Yqn4Pp3)hrlfst85KhQ(4L8>Iuw-RC*N-EA5ESzUH%Vo!haT<
zk6sSzgM>|qV8(>&o-k8VQr>itG5p*0>7X1xzB^?mze*2xiY9!d0eHkVsJhv4^vUJu
z2!}rWjMbk;S$TnFHyJc7CMsYzESxsBI^UFjWoWO=aQ8#1Osr-l%U%f^(zSxMzkESq
zLEECFXOHiiZ<_;Ypwc1+c;w8(N~U8RyP0iRlNay$9aI@kBw?eBtY6p&4l;iV8ikdR
zKQHqUF=fmRaY9ly{e?X>+bwZXm2is8k|xH}vhR--a@U(NBTQAF==Q~vFSE@3wrga!
z-aAK~wk08{jcprWKIl5K?Y6}<PHT7Z-c^s$MvY-*Kj$_tr7Y%hKG8WLY!lQCeZV?@
z(KT}7(JFMHo^lXdC7qEA_^wq-Bk);m*hRvi*?Hxsm$j@j-bjj7mwXA`C3#3ru+Wff
zG5h4@t`Qc${4-Tq)gXAn#fuSAXMq`2NOdX(auZ|r)^#&B29_oWng#g+kQG(BG`dIQ
zKB5tm!!gK(d#g1?oZ~0c-G`PUoP2~+srA;j<m(yyGY*ZE<AK;6h9+waj>2);5fNe5
zTSgC$7-#ZAeWFoN{IYM~Q@RAy*c#q_?wutC-b0NJh<q{@9XZk8VU7$xm%Hq4rHnnv
zI<C!#(g+>PK~!xTj$QAomA({3mxs&9H{W|*?Kp@2uCb5WI=laB-!ad*E^C!h--5j~
zf!KKFTh;T2jE9R0u2HFvz4>k*VN_eGfhELrz>J#Wc5nusTnuv8G5B=N)-g?M<wdZ{
zlRo|*0FaGsV4m$hEn0!nr>ci1`ratyBKh6cjAop}K#jZ+ulC7_h}A=!4}kn$JeYsW
zFEk~5*827ri$#^27U|C#Au6Q!cS)?97fx0eU+&O@r6|ZUjXM>Jr+ta2U_P}P7fzAk
zc%q>nGLN^6iRPH6WAccuDW|ieS5{S#gNnAv;_Dg_`-+`kGk;F_Qc;&`As2qSvTr4Q
ze_UJ=<Xy?a@y&Rfu;0yAl`NYLnjeFMHS$!dW$|892TRnx*w|`7v<`9-g<M!}eofh&
zMtN7B4p+jsNd+D%GxoPtPOGLcl3uW;OQq{-x2?!uYqS%<4C-yN*yIGZ3iyT=2kdND
zxy1=YbQK%9V8t(J2`$-o;nFAJG1PkTk-Db6%cS4(wCV?-R-bp2Xp&~M4b41K3%3*;
zYxd@gcRL4WNMX?9Zuvp(P%?*3Okou(UZu&y_@87j+);MPLF$slYhPMUx96YnbdRb)
zJVO1$Op`EB?*h96V-J@3{N|C~Ucwe)Lg|RND+U9T1&sJ$$DJ1=)wQCuBB#_UwY7jQ
zS3milJOWEFr~7Ota9!=kx7=pd00zjU%8gcw?3H2Rqrz#Xw97;y`i3GNmD{$Bi{3L@
z(R6!e!^<)Zhvp|bHdj`JMvW^L)qU>tJL;C<(NIF2?XVe_0TlC}S@Qb;?5&iZe8AYu
zCz92@<uo;`I%BGqpPylfA(P+Xl_N!?W)^vgKgi+=WBr>Xyf;0;x+c_)VA6GiIt$~?
z4UGD`+L{OKpN9I<p2Ku)ki9F53!UwRn0Er;--myfvp3dM?DJKC@fv4e{8_=P=cAX^
zpUjb>=$=}LXVH?LE8kdv2!S3aHJXcmrNekKez=`3kNH_QbbV9hxxStG*Mx^yx5A1U
z^c;TtRn~;Bzb$8^@s(rO(b`OGJUj_K6*FA$tMbbwtUDP4L+87)9{G0!1w&+uzrm&+
zDDc3ep%`9={y`JXQ~-a)B(?ueD@;&uWnZwCaKB4j6*y$I+gkpi+?`+|o5%fYV&7Ly
zljX0JaM%@A>V8DYg-dmmL;TwQULR}x7fywnD&7X7UzitY&5GxHVZ(iUL%t+j8r4Fv
zXCpn6ZxslfdWcp2zVX6DJ|*?OrA!U9SHgSwjnc^I38Tb4-Fk>64)~t*^!OF^a%))s
zazAf>l6B-r*_(5@!&~Pm7(mE1Nna~<B-ORG8`dJ1<I?ZX!Ef`>P8jLoLmV&GqTW*}
zXLtNE)pH)+dS0*d_Hu|7#kqeo+6l92!{fGT)q6f;3CQa<;F+R>86pyN=yt&3+HNc9
z2nFfzgi?eEXPpbvehT|!ShvZ~r%ZgNI*aoZ$<Wa&h|*PJMV!e+ney6`_mn1Zgy29p
z{R3;L{{t+>&n}ZW5q`7T20fFyI8D5)-&cBqJYycPh|e%5$X#q7q9LkP)Cizs#vI)Y
zNf9tfAAxA`Zk;ITS*>H|=#>N7Ax+rE(UG%HOLbS-a{EwAW}kqCoL|mA9WluHT2(hb
zM`%Gurc2_^^5z>SU*U>%+Whv8%v|?b6LY?#Dqnj57Xtbn1DVu2I1_n2+q`fcLK5aZ
zgYkh!XyVtR0~QzW6@ZO~et$-TZ{>e#SH}vEt^zK6o!q~)Vm+KQc!)+cG0v1-%Dm*R
zrUWot#j|`18!zN^3MHH+jSSPj(-DqiY=D!P#keWyu}0JvS%IW)8$HQ?dPy(dOCH4$
z!I14g$&!V+@z9>xMng7{6-`00+Lie}<Tc>GBM;Y(ufnW=^&dKrU0qsX&{5HvJ~KU@
zw>XPDWeSK%i)%KN(LMT<mJTtSOx@g5NB=9ih;mb%e%F`;j5>3lL#APv&s!SDt2D!j
zE(HS;u07r7n!QXLwNCvdr?IZWOC$cTGrW<qEG<>b=Zuq5Ec|5L+|VjB$4&iCTUc!i
z2)|J9G#aHQIIuui*nf@{v|Tv0Bg%_DV^%20y(-n`heX;{{N=)w@mj}s6Ze0eZ$(Bj
zeIj9D_vTdLrkRLS{_uw`6}1=epf;xm<~2X+{0E_b|GNP>&VW*ugvFUu?iM>wG0f9S
zfpp*N<4=mJ@YGRBb|6AW=;%DQ@R6$#&1rtFJOw4NUSke7Xq0XMvkAAyt`qJFxrmJK
z;oOdNFFAu3>$Tm41qoUkmi?I9!d<=T4(r8)=plN?Io^_``wp=~><6evHv0I|bf5aD
z>XlOIShvN~kG1<Oo;oLVhYstSlUjoPKDS{YA8S2WE=1_28AzLdt0~vlRYCEPksl~u
z-mPq=pGwk$&}d~u0+HVAg{4ORiE9&WWXGq-5J{&9!DAgah<<q$x%t-Qh1Wf$mSbXK
zVrHk%?!P@CPVrz6s`+=XO4XAutu#W>)stWIKB0XYlbYmp@^G&c6}0%~j{KsMq!HUg
zImnFEf|V40VkbWtVbyz{+0EBnUU%u|!oVIJA3<5eeqEW^M5Deo*YU7&AT|D1b!CFJ
zV*GT)yxP!k;@crLQ@*>k1DfXAxc7St_=D)op(37GQ_xO0Io3i4Q!a%ycJ+r5<K$XL
zhNkopYFz+gg@EzvSu@vFiLG+jD0p|g@UE%=BZyxJx{!vZP!KNll^|DjdD)ZL$pBS}
z2?;j@(<q$y3Vq7!SegM>^C}N7&~B2Bsr&(E%R&|=#?#EcY|AP_y$WaerD<`CG!$ML
z?YfT6!DrSnp-mXaZh%AiX>4y=|BG+)pfVtMi(Kuifef#vcP4hQ2vcn9ftv7YUDAf1
zP)VeC&5!S@f!|7OQV-hGlY%$ZA7k~K+VCcS3{@oW`eu3^7B)+6dD}Agu!TRz1*+O>
zfv|nTwWgoRDyP{BmAx*mV^drNDjQVTpz3+@lpYwm06@rxeTT(-g}Kj<vl@sL6muKD
z(GI*T$iOPOt+!^c^F%LK4&gNPCj{=r%%i2Cl03&Q6+vh2q&M@D{{SVbvoN<&tCAwk
z58mEX$6a>)mE~7K$YNpgl6Zw(tz7xEg2x&kiR?H-^ndMPi8rq|aY%$OkGpCKZyH@+
zx;jxu*m^p-#ssAB_~C4^GQ;EePUof6M|LW-)G-nWx88Mpiagme5A$I~cw$W)1J?n@
zbUXC#<#53C7RsBqM2T*$Uj~RFMc=)la{oiNn<`*TGz=T;(rc^y+FLkIt8c6g1e1DQ
zkt{0a5ni-RMD9yrOORMU`xos&2>-Ym@z;ME@kRMPmJgkS-J;N4(!^|+Q)+A1wuJ`%
z)qy7|&B(d8btGrT&$@^#qkNc(SUY4^)e}Qj7U)R!sK$*kmxqd<b(qh~a-cj~rmd2J
zh1D%-NqHf*qAPBN_Nawnxu96Zm{Sh!faHp@j^wwRg@}2(oaBe4u#!}PR8^&%-k0T1
zbFTHXT1wWVd;9HmB;TMn|0vSb$Jp+OXC1Jkph|=J^<Lrq+uR((w(#Ztn(v<M7i&3n
zp%&W2y*HJE0DiJl1xDFzhms<M1Ofb!D~Y`9#lC^32pm??!3O@915*P3N=HWQ-DfRz
zUl$>W$WNuLs0|ed_UV*Jj%=nO>pHYHM8YXv<J^W^Zi<-&-_12_Ku=UO2%O19_NuB4
zaN>pfi@n!q)82L9a85UJ{kVxQq;+3CVIR@lroTVje4z3%_nt-8+odm6MbdEg+K59J
zn=tC8{leMD+Og%D@=&8A*DzyC!Kg8}wC2XgxD0{^1pdA!zPeI7)pn{mX!X4O{C+r}
z8+9Zv%y!i%3(DwWB4wN)2Rx4d#L-M~mWPe)scXwDSo`Zsz{Dxrr?+wM9z5P}1jVXC
z!DHz@)~Rq2Q?2HM0tfiPZpB2FPM4&Z4f2lI3N$=2L3pz@a)UeUlb*ZBxkMy`DdBm5
z*wOQ|{zbP?fNZyd8q_Iky2dF<dQ5z{uXVN^xnnc0T{dVjd^HvFuuy}>R9McI{Qq*2
z{~Mfq#T^kVZrjQB(u0z9hjx5WpjqHe-~*?+CVh3*r<lL_8$f&Uw&9IJ+8A3Ry{Ioq
z6`jh+E7HY*mYZ{F|95Za@U@oY;pY!5{Ndtg20Z-@EEp=mp)uB(<ZF+1X5whQSl9UY
z#AYAai1hCo!_yx|d~6J9&A9mV^=Cne6@h!cFQI#ODT`08MEIz6=Dte<2=AtKO92XD
zBVFr)o(q)fmD=UpLlk<5F+7w7Wn=gQ3}pTzv<eq=5KOLGm-;2i4J?oIsu8b9TXYIu
zN=lYw5&E2eIjX3GSC3snMBA5{wN75vw{C&XYuO^z1EqGT6hF|j_ewVwuG`+2g9a=W
zU})j0$fD9qBRg7@a8M8szBo=<!j;@ugm`nzhZ9yB6aS876DCLAr_I96Q%nLNp|I08
zq)oSu3_&EpPM?8|vEHgX;%3t+20R=e%NfKr#iG(<5%UBz2^tkejIZq4=W=kZJP{?7
ztmfEsd+tA!jX4(nF_jFGN90o#@LH~jqMklJS5e4iEuv}lbDaLu>wN@OgyY~F+i+-H
zW(w&1t2^JZZrYkErf#3Ab%lYIhutZ-v4hrM79A}V_3+BX_@U$EKia&I5>{`fCBE&7
z&DPElE6@M5cF&U%-zit3{#-BDRr?>{B%b6XLh*g<steXW)b1M0Uehr}mN-L72GLZ-
z&JzwXN%a@yKhNuu`&~-3IL>?;>F+AZkGF{ceERcDFGn)mrhevcXV0ckJ-&h-96Xr`
zR&lzEbswxmxEkz&hey&D)fCjU@`kzMrRi-3Q(DMqo}y4lKJw46hDI-&o+X*CVdOC;
zh<ki1b6_K;-Zwk_DT2OytNOF5(u%R+DH4PP3Z;rQR!EXC;+$=F&FG=qe*jJvjBZG{
z+ebzKg~wqC2sn)V(@{3FmOp@HgZ=$#OvCzprdGqo1U_gPSqX#UQb35HIz$hCD$-iG
z{EYaed~rcb@s;nxVLS5|EzSXeT#f>*uQ(w?NQnZHX*60yV`2@SUhvGbjN25}=-T{^
z#J%QYm4AgzhJv7lM0v@alD$on`Cfw_zgH9h_VQ8zfgI*j)kYYoPkTeT-+8{%{)KaF
zd>I|1+!3*_Zq!avfuWTWeoHZR48F=kY`|uL7|$R%RD^5rBi-?#qOp9?#VAW<W~z00
zAt+}o5QLsp^`2F-WMh!OvDd)%6YToQkt=hxT6HwH%8b`UF^J%P=|fdlc|1`ta!=2P
zB>ozbv=JQ{&yTVDd7ZCJ5WraFvG7l3n12NX=Q^?BHzA%>%(ALIAw&W3nzS0UtJJg@
z%yKO9f$Xd)t}l8ADvaB0*tmyhpj081;CtZwr)1NlWNH$k0HBT^6oQ#d=wDcRsQCKH
zWL*YQo@y2(CXpmV;g)o6md(xqvI#onlC-Pwc7kd8ArtRN1w8(g1J}3TP$Ld3JVT)W
z45o<NAN{zM6^+#>5``6yvJCdG*{Tt5WfC>Id5Vdv;`#m{E=75krewF?4YS@j({i4Z
z4Ls}=DWxd-FV%y=`?_sLOI~+8o9j{8uk_Pe{vFFs&g^S@AVVe(_|2w8XWs!Lxs?s@
zqPNmgAPHgw@_B4Y!(fyp)^!*ct}(eL1SOiOL__8j<U38*>^}ZpcB6MuN*J9xp{-Q!
zExTkmwC6@5`8d%LATB~$dH}C?ZSI;=V!WZ96!^2RutmV13Qe;R!zd9!u(iK6ny_}G
zJw|<RY82}vPS@lC!o1lp>d$ChE(%QaArG%(>QdUFSScj~=yG0nps?8(OOVI$-`8_)
zGa8}TWd#%S<~F)z+@ebAi{R<H_P+aqp1bY=6PbQS%e(^A%~DJDtx=IPVm@2mq%8;R
zrJ{e%E*3UR=K8*mUL#Aze3Ppzp14W5&6cJ6^y6nX;PPQC9{+W7zVpmBS%{g&PNOx_
zzL_ew%Pc36g8y)!T_IJL#7R4ak}A=C{9kVHKZasJ^42<;)eS7jd9-wd7uQ180(II`
zUXss>&-dUHZ=&4haDo>cqGC|gCUPPBj%g)Ci_GKncM&QH9sK5J(KlIT*|%bO-ZA^h
z3^-r}Bz8yPk?Zak2%lP?dU&(t8h+{rxgM~LbQp180-v*W9eknO@MZc}JM|NzswSA?
z;V5oyCMJz`Vnl$qGX|OVwX5ZpLZRf5UGrQp0m>DT?(~iaK`|z*yGxZpTzPFiV|~{C
zq>?zn$&*rtA;)<Db36?tvTY@C65h}{PK4IlxX@Z7_u15uyf;YA7ykNECK&gl>ciN_
zH>I|Zvq@i=2lmDOUOck|GNfkn>ux$4JtvoRSurx{Dj|k&f$Ro~iz3Y*+`d7iV&@H0
zDK4%i7V3s{MJt_ewWLz101Bc(P_{9XRXPr^1J;=KhhqaTFJMmY!TWIBibv!_Ee<+;
zCkmMuP>frpFq%f$ce2EO`XtsYfah6?aW0`eZNfNu`zk;L8_%YEa;+#P0MAzOPz3D7
z`R3rbmlB<zz|qV)Sw-H#12_iwVsqQ^nMfhRKO(>R<GAqfAg5+PA`(vU|103QzCEsF
zi;^+T^Xt>bqChHY4Rr{sl>o_@Ee~XM1;FYYvO49^Am@q@s|Pu_P~}IYEj_qYoO5dx
zbf;vuNmH+ARWE$$3}E-q=5>Km4E7NZob<<JA9Oxnw|Jkhj5HFReJ^SXp#Nk`<-TG#
z*b!dsaN*x7+Oo2w^-)U4h9>L?x4>zdcns~s!H(N`_xIy^vX7hWl+iP|aYwhHWQQZc
z7tBYb3$^^4@=CImeOmW1M;)<5nWF>LmG8c_)rHZl)V>G*--*Hqo-YSUu7oai%A%Nf
zU)I*&$kE*XWc9@5ct4542{^1q*lqdz=eAa)OUWXA2;GkO+BxxSAqtXdO!Qr#lh{ua
z5}2zJkXFe%0ju{yJ%0Bzo+G6|Nj=T#@EbEy4Tg7**!=Gs3HsZmWo~IlIx0;4;i4DV
z!oy9&uc5JSJ4d9Oa$7JAb=Xa4fsk~Iut-D68~)&Iqqi!(E;tJAmri$@n|~Czs5ThB
zUvG4*;5S>Cl|)8PhYs=dt+51^JO~j)T39VW$U6Rr$;HZ(=d%izqL8Czre{aB9ia06
zWlehE8bW2Ooa74f%`6dEogvr=_h>DEZpf|4d|rv|yW#7VT`U;gh{4^lHTLgs#V<-i
zTw_~~!Ma_klEDoPfd}=Kse<aMH{|vZ<6<wIa~%!<=Hanst1H>b!46_h<>wu3)bbyn
zV%z>gTl_HN3$<`EI2dH9DB}awPK{hkCHJGvjSIKN=NNr3ygQ<+Ax#a!W3hJY;NAt(
z6QX8!YI{Z>M%+4yci81DXNKXenHsLeA*f<p-Jb-}+#50BKl6a5cJOqusU&N02n*50
zrBz4r4mo|-5b3Idn2Z#Us4pH0oc&Dm=@#AOgnrORM?=ek3><j<Sp7_uioY#|a3H_3
z%ty}hETpqNNzwt^kVcBFo<NaWp%wA*IZ78Xtm1+74Tf6V|1>uH^Gv8Lvk#QY&vsku
zIGGcYBQ~`yitOT_RB8dNqFIaUpQ`ws9Ga~guv%CUip(R&5;<g(AlLOU2a9=}yM5}Y
zs#O&L;C*;)<=uCyN^}aFp=DHl){^ZQ&phM;#VBYq(qZMLGWXnD!gaziJt407x~S)n
z+>j7?;$z}opSkJziDN(dngKi#!FO$c@2&!*Lg=!5OTF)q-$lwKL3MbJcUasWymstT
zl#*gujS=#VDq)MR!qvvPDr5~n&+Rcq;skGk%7Y706@y3SwA9q!cEx=bMig2|fEb?I
zB3zZ+@gEvrggF`P>zyPiwOwnV`0uqB;;Op6TXRGjha2L#LKQw(J~`1-at0be(rnR{
zsNGx;#F!mDo!1M?eq!>BQSR-asLF=#-~&BqGwaF~@MXAH;D1%aQF<Zh%;Z{o9dx-|
zW$oM)X2Y1kANT{6>7QQU+0B07%=`E4EuVE{`$h(_WM%igN%B2C?~awHlJm|6X9eQb
z_S%-dRM|zF7yr>TY8Pfc3}=wqwlQS~g3Ty#%2Qb6sY2mX6G6f<x?477$iNy7zk{{J
zkadF`|BbxF-pDr&UTw==4Lud*SFlm@Zv}|{&+|(K!C_39$rvscTZt(9TGC;^Gr1ZT
zX;{0HqQoEOh|`5u;sa1XN0`@oc-9Y&R@^YkuO-$BNc&xL**>vDp882TA-c541kDin
zf2hP75Y40k3jpAV@=L*&DwE%rO^L<1K3mzZG)M9VyV|tM@9G<`0)Gh~RSLM=?MCOU
zj3{l-S@9q?>(z(DZ2tqCGgzvRY59K@PYz5o4!jIK+4=VexxNGO4HdiasNHh3DEA{4
zjN5>pYE}4wf;dgJUWv}W1({RaQ)_*#?rIA=6Z}}5uohPxy39-Y9tc)+D)lsG-Ec-O
zpjI`ZbV=Yn$tgw*n5A6L;l`q?*Bko?rf4x{MB)CfB6(e`<m?ToLI}-6E87f2avuE;
zKv29=r3?m(mEg9wn4XDBh-o$VZxayTgN8U{eo~E8P4cO!S(U^KgS@BQCd3sJY311f
z_dsS1ID_!Vqe3}C^saVDy*+O|Tm1+vRSH^5QcOIWW7z%>L8u!t-}K@HYmp;)UmR1W
zPE44!QOb$yF`N%_(^<7XByYyjU>cs(QKrj=508FS;*`FHT*e7(9Uae}Ki=rSomZ@8
zIX;dkF7G}juARk%Q@6l6mkV6fZUXqC==KHf>_nQoTY7yzivE-8c?|R8>1(4YuiL$m
zIsXsft_okmyznl^G&JCztc>NB)3P$#c-4(S*VYp|Mj&+qec;*E@OwrdDF{NHK>WMa
zGw~|7%kPz~v2?|8+QxQ2OuYYv7Ben`F|fuzOUeFIfRafbo_L_NF11f$P)zDBzF4@O
z2I)`3ZO7~9gTmHF)qSlO%@INyB?^Q9y60iVa#C%e*fL@rw;f}W2UM0+XdQrMu`n>C
zO{P)Gh+<(Ski+IiJ0?zAP9?}GI^f>(%s5^Bi6DVfuLd0BlbbSNVQ%sot$>Uc!I*+h
zo*Q)S1)xnd!ZmJ&ry00HBZvmRhn}?VKB~}F_nf-6A?D&-DbI~@|KK4neaGZVX<Bi2
z$TuwzD(R(h9V-pAGZOS~T%YIEIbHoiGlS&Ufx?@8y3woHHbS%TZBftw9wtc2Z{tNH
z1vpKpL<!*e+%n#5L5QOW<Qly6Ez4y%3#M+3<-J?r=2CQ`57>TOL=LHuvZ4D?k%)G-
zVU;4Ak|8)`uS)4XzRf3)d!`n5CVgVdD6|3bS5Ykl84~Ed2idisaVHKI{~EOWB6F{r
zILr-i=Vgcpz>I<Q5W>cI1AhUU>D5iZWj0RnZzvwYZ!M?qAXJeycQNEmmfOGNUg~2N
zp6AJN`n|-jl}TFZn35eS8}J4}CL0@sw}Cqhh@cC%FGv>Fn>;RQ?^>DnZxMCWYT)qJ
zD^OWz$5^DAic1f|qRP9{gOmSIEu(5NuZ@VqY{7S9%*DM^-jN*>UbNvzDgY`JR5t%t
z6?!72C>_DXoORPmZhPZQ5vDXPfH6dYac}I6h1;p=={vAIc3;vpucr5ju@7u!JpgV`
z<+pDpg*M(&q!T_+%($r14(~P4%*yuXtSE4LPNy(Z!P7*pyd3|pU;%sLI8+Y0QOwm4
z1vjh&<k8DRljDn$oEhu~lm4YUq>w$qTRNMyAR$JfThW;ezW2&UTvlf-XY>S#k-K&O
znr{tsymY$6Hytmj;!x5cpf-vg>*+jM!sL2|j{jBB{l9Ni4GMae5j6T4t`ON6X0}T2
zVM`zDl;@Ljgh;lT2wcWD=)U3!UQs7Pt3i`}oL}Hs-*athYZex?IHZ_T@r`&KTB7$s
zgHsZSq?_|s@*i2Kt7~B2pu<<jjqSD~=Qg?AClTjKofyK5HCf&`LLv@+pSf+Ru9t@=
z74An@%01EhS6%Za{ac!`lG(dqNkWy00*_Q0Uj9_U1Ai8sd+zYh2h5~6fh@nG&udbk
ziSx=Lz54s`I$>(BIX4zI*HRjZm(u~oIobYnRS~K6?DlD{Tz`#b2zl<V#RAvwzPVO@
z3C=))qmDCjw48gTW^n%CNLSXkxD?@?FLX;n`-Cu&Wi)=}dF2y}b^fO-(ZwvMF%I$r
zmVzSIq%-VGtxOpKB{qxG#e(26uBA57$_kV59sG_Sgg+;?6evPAt+w{GxiQ198wkI+
zKjg_4`1+D16;@K*Y{tjps*n*i7HCWw8q|(gD(4hiQ{rq;3j4@$(Z#f3<S#ooTih;Z
z(-dJ2RFkLvuux0ap^CDq=i%^Mohehy>0XKEt}bbz!Zw)F=%a6DlcKl*R`ee35BS?R
zewlZRI(i@ioyfI0_+tf<%W2amkE0X9+$1RodA5EAb_B9$U<%N?Hib%Xy-6t6RU*(9
ztjuGqHHKB3Pbggd3W%G1Cdfh0PE0!P=2Xb9xagE6J$=?H3Og7j9tHj>k14_kHKsD8
z$7E}i(-<ph|JeM8EF}_Zm1#2xLD@$lXEov;AUp^sh8Xdy`onRR>Xyxt<#q|#G|^J2
zh6z}G^Nb4`UpZU9iYar-Th_Y>ApR4!ZI!LKPAUvHw81q@mAEw$Shh|Y?up8*6&p45
z`2w0;3!0&BAL1*(8J^)SFUB~XRuQCis~Tg(p$<>p5JXG>VEJaJQCr8+V{W0hRGa5k
zlO~qP2C|rz%PBjSYs%q7{aS2Lek%A6FvRIL>4_<t(c&6;?&`1@ncRagdLwwOnCj9c
zw<(oVv}AZBk*PAYA&J;KgR7aX0BJ9l95eyaaTHp5U0Z-%TjWxx1H24wZ!%pK^-w;!
zEPs_Ph>3mH<*jtcN7#Aq{yK(_k;u*Ot-*~_dFP72R$GOluo9=eVP=(!c2C4qj3pYL
z+x13JmUi`Na#27Q3=y~`*ee5)#^WkEd2Z@xX7KS`I4yr;ilUG5`mVIIP(cg%JRcc7
z(jrfa2E6k+V3}|gDRMF&&(&k>PhB#=T|gUt@N_d+BmExmQ@pybAL^85WTuU>(h1j#
zdRDy|+N=*k7wI~puw9RSfZ;x&R<t2TjNm)(Vk~EA@QF5mv<%R~R8+pasliKy*lTuU
z*uJ}Xjth5sNOGMv$75quZf%GR-rLGG1C3IH<ITkJOMU%y**zY5<$-Af>QECS1h)yN
z!_TDU4m;1<*4Op4meT|MsdLsYE^-EP9vYgr_^S_if}w%m{sUw%6HV*o`eo*1pAsAv
zpK)S`QJtHG6Vuklx=R*5Y9V;CJq06$?&10h<{s=&oD8cO7;voet%8N;Zgay62Xj3_
zD^r`7vzpBw8`aucm`&5z*-S-F_5QpYG(Fhwuh8`1T?5Oqy>!AAqIdbLn|x!<@?_IO
zP;pA0T}gHMVKe(8*y>Zo+LR-n>b&8@b(!M37pbJ2X`%fE&E*gizMw8x2u}~XS^a)I
z+R}qxu-`U*XoS8B#)g#X^b}1(LJ-dkX-?cztx6MofK3}`DC8_y-1vYOWx^N3(vE~9
z1V6RprN}&|Pv%rETGC<0_<>r4F#Q!?KJhfvi83JV;prKr_fYymxM>&svAEQBy98qY
zDh)ecw>comz3)FsCaacpaq}10CcO9uyP<pd8LD7<Ppn{iN(CIi#$9l)q!{+2${kxX
z%5UcxbKA{AM9X&r_)q`KB{W{NoNQ=XYiYs20C;>=ktNV3%<kcNm9Gy80C41fu%&Xk
z_&Fx|Y9h1q?F~D=6r30dA6onBo`?&P&AW)K)a>Dn-ZVtcY$2KM&j3eqeEieoQyI3j
z*@a_?EjI#@baL>6E#t=LfoyZcYk$$d<@o-yO0ys=5v~tMauT)c@588TSub)L-x&H5
zZLMdF6GUu!nH>!UE`fd;+PK~vo7>&GYTn!`j*`rq-_~;Fl{YN<UhYQzZMCy_Rp!ae
zDOR8_^c$>~Iqz%{a7c=uAWU=eiv=>W)^C?79@hP})r!-j732925REWNVS5byiBtm-
z2|sj(^G#CfurXp@-IV>?wTe4ih^AHt6Wd9xy(;Ty>V;?%k71Ql54Z27(2~Nbj+fHg
zP6|tM`9X|a_0<A!((A7Hu-*^L1B~he$VlNGAi(-q<!7|f12uJq$GgvtBA3m&E+RZT
z?`bA>69dunj*`)F2)%C=^5iY!rd&K54lNzG^u1Gc+>c=enHU9nwt(zEhYG2?WjSLq
zpW6_=m}+idr1E6Y-FB2*wId-;agHMAfP4!X1n0<vG$w~y*2%&}Pko`B3nyD>a;HXg
z(0MN(IxOJ&CvBqt0LEEGOr?b~qnB*`qL@J%L-CT$%vpr2wu3y#aQ~18+N4?>w7yh@
z+|=LkQ6Z5*0pRilENB+0<4~h>%79HROMJj>>#Zs6(y-xmSshdl!hu}oje_~C;4{FR
z;}qx*?i~oqlnd!eQ-zOxQO$n<hNiE>j}%q>7waP=4?G`}>oLMy2oPJ|Y?tOTsx!GT
zl=VJBbbvOqxDbIF4s^=_dc!U1Z?W9#LG^>E+TOIC5TQSUNDgJNo`F}s9d)D4O;_7l
zUKd;>6gdxZ?x}bj6vTx^Uxt3zUb^}SQhaig*(^3?+FcK~(#+js*wRQNIz@^jfIrvw
z?e+XpEaO2O+xB}-R@C<RX3Yw-lkPuQ6>i(Tsr!M@mF=tZ3i`iKmyQcJGvv)bs*`x*
z`1q^gOB7ea`*{YxZT91cmjn~l3Cy%XfM;!m%Ac8tikXECx6Sog&XDIB%eR<@2S<`G
z*RFmv!E_B|!Ew>T*wa0!(JUFRuI>6)uCATU@PUw#;{UhQ^1seRPtMNY6I;4>b;(qh
zRhk~=nqXnX`r4A_@|1qLZ@xa@sqdLPJboIjElb?%KdZhpd@o8|V;=1t_BD0>ca`#j
zm5}N+XVg9EbxU`}+Y}wdgK>=Xl9`hNA8&?9IQsk*K!2*8$(9bi760fi)_hnzZaQKk
zl`5H-xJByxc312b?;xX5fP@i~bNjW}{)hwKvHK5Tbxqfna)CA>^3hsBk5J+g*!z1(
z&(g7bC*Q+WTzql^eVc7$L?Ze&r7gB&KAO9-UIP)Mf;Q)S9?AbGIRqUX{d%Dkr~4ZQ
z)6sgN^#cxAgZJdDhd#d=Hk^akWnBkrB4c~6hx?Xzo)pO94|g-$##@9yTLdGa;mQxI
zl83Evvz>4o2N3BXPqDJk>L<%Og^ZR1;gx~jq?JZ}>cyWRuWee<2V}EuO<fxc`VYw3
zeAEeKEjoXZiJEr{1zI^GMuu#x%3QsvT4ZF2RRidJG}H&9Q6xU0U8g9@4)sqIRexul
zbb3@(rF?I`_P&F>um=bNZS?&cqAudxbYBg}61C&MQ*gQ_;nFrs{6DQ-XEYn`{*O_L
zklM5O*_#SA5)`$nsH&|-1#JllHA7oesXc1es!^+A6Sc)I(W)XgwIx>Dpha))J?EbD
zyXSw-ee=I>pBK-o=Xt)L=ldDo#C+w;WU~KNL+6g!ws~ZhJ?k>tetcjIc^V!Ou?Z)W
z+aZfLjb8*pfETXpREV_OJI@ouYs|kHmnzne^TkbWYrZVe_~Ktcz4!i|lJ_J-%SRu*
zr`$OlqBq3(67JcSrsNq~rSK_?%UEU$Kg@c`m#D~S@rF=l6fLvT!3f&Oi8aa@v{1Dj
z+gIXu-9y{-nG6O0Xsc7(0hE3e(nY4<OCDIh62jwlSIZ>?G@te%EaYyxUAHt867#?-
z(a%TB{cONC*alWT4?Vu6oKlrqnW&%ctvrDKM!fb?Jl{aQHlY;DAFb5t{dsRz`7Q-F
z_0L1}46THdxhR}<@%T8$#|3k+Ri=+LA4U&!-zrn>!9CWC=DpT_oz!}(fasp6_1kmN
z^^1mNiy3!@GK-|UqhmVv`YUwFP3OMA=I@m%d04)s@Nmt%XHrqK_e0!GL@YrO*egDP
zLt&ODr4vdjX3-~wd#3t+xQv*IHmTbCQZ{MElikZ{Kg+mbR?2QAi1LKe!e34(Y3T};
zgqR~}C5zcCMLOW8aJ9A@j4>V-5BtvlIyV{NnN9hgTS}}*1fxoorQTBg>%u!PMNirs
z9j(bWZ7ZdpDIE6MO8Ca9ywJ@;Sf*Ct?!Cxpitr&w?242wE0+2N?8*JYBQ)$@v3`zT
zqOuGD0oZl8MIqK>iJp8H(*y47H~y<<!WX=9r_^*K1Jl&o_gAH|+ye}IjEJP5pP(;V
z4mh#4Zd~&=f0kb)c@{ATo{azta^2CI_x#k6OTHE|n5S`xa;tmG-a<}4rjLC_3UjOs
zDy%mPQ#oJGU(qkt+g!vUn81O;_h)R3q>A!Ml$)P&fs-rWMvshG=3ch?0;~id9}L%o
zCQ7U%xV~Z+HjlF80tC~aZ4(tz!iqXFP`W<yUVAP*4wR<9&qFmWftIGhg0SWj`z1Da
z!H^p5KLEO7U2*Q*qE~+O9@$ht<hEnB)1?bu6j+|I{trMMlSOLRVHaXQv1D2<U@`cj
zeB7k}fMJ-v+BmWlN!H^@iBkUS?fPDD$cxXPu3ydINOapr^}O<h>R!<d*0THYSn^x)
z06`mUk}$oouBr+6euVz8Bc<I#&GQpP?lEEUKKt^RBv8KQ1YD;1okF-Fm%6>`68F5{
zuA`fBM}IYTZeIUzG#Z$QaSrYG#DZaPbV&u196Q_UULBJFIX~CP7Ar4jFp<y1D6_`L
z9JzVJ%Q7QQ#x6Gcwst_F&CeF4DV|TU)emPB^_KlXx>gi(N>L^%8if$&NC(6|Wod*y
z&m*DWHG{;RF)KZZqriHugbKpUT|L2CzOg6asLIi7V#4PH#!h<Y$tNpon&PB#Zos<U
z`)OJ5?TnsO*}1lA<j1gPHZ+2orFtUbWPy<w)3SM10lu{HNN4l*Rv|D|;WExs_v`~{
zuLncii1C6I)G=X(1zqWjvE-1AFC8TJkuP}rrw{?wWFy~S@a3SoDqnJ1D<yuex9AD6
z*#IS3v@-5hd<E0*)06L%Y3rba-+1n5hUBS#&cS9P$Q0>gSB!!OVyi9ps>NHt!2UUX
z3mbm!O){AIJ?^5BxuW?AaTtj5Q<~;zQ4OM?2<UN$hedWd$)#_dc}C75JNe=0D;ySR
zPUyGfP#F!7X_J**?bR0`_6oJAbR8?;KqqwiB}%2+M|GO5WregSnC==Z@`&viFhfw^
zPfVA82q$9h6WY~y0&PSdZe-{SJPg$dUl36ABx=Nw%#seeJWbYTY^vWHytJ0BTBKMn
zLo2e^BS$(HkMU0#`hudn77k7}T1WD{ZI0HPk*D{(%X=?eOn2&d35>He#)C5FuSkij
z1CTav7M)f_Ne@erCnKp$%fyyjKYd&^a$8A0QO1|P&g9#c5^e7U3ae64K~Mc=J5yt8
zL~ucM_tq;zt9zf2EAE}jt^YGn=f5u$i<pnG>Pg9@V6ei#2<YVsa~;ma-^LeQhvCnl
zx$Mq4iw5#6yUdNYBHQ!J;mu5X_J06Z!jg>H`2t_|)#=ca4hYm<hJf&o)Va*xc3Y~x
zqULxVMLk4I33M9mS<}4nk&!8<&mRZi4zwZCCRNF*ta+J{h$MGRS>r_enGhTE`;Oew
z1#=fwYTx;UUqGVSHz;i^;<5{$&M4Z*alt`RZ9Cpq^>9#%<jqJpW*~)$n{vYUwjt5}
zOrvxIii)OE(^pnV?RN)^Aww^chZMB8H=v-rTeE{r3v73}N|1d$uDj<o<C0Q!)K|}T
z?v_1l<yDyH`AkZ~pN3_wrfMSv;M6g8bX2aw&~pQG+dgAYPoD9|TVIOCfJw>RT$Gm&
zX&T>1^Fi<SYn!uGr;5`u_+Zv@UerhEgUs*mKocKPlo)1M>6G_9U!Y@G%H}Pv2&cAn
z&7aD52<X+uShTgLHS0T5J7j^TN|x2P;XUPs5jUkC1&sFCiEWS-fCv~OkG=znE04Eq
z#1n^?bbna+r)=NCm@DZaBX9G@-!tqf6I$)}u)uAJvb5YO<Gq&PPncPns#<u<<8Jnf
z>Cq47a_6H`1g1VGwNO`61yv@b&L%@<!5wcaN}%<4`od`tQXzT@9SxR_Jbb!Jc=G~+
zck!EdWR~fo=>d%8=AEAv4)(8#B=estf9AaeXf{>RROa$7b}JUOIhUM45jiyNLSEQG
zW(UC0>WHW5j@&$9ZnfMt5wz=8O10aTtc05Ez`nSGEHqz?86P@7;gEGNR~PH=EKN^H
zey!&Y<2k;=$NB@EW|#t2@&b428<<qpe3l0$>mOqX6Y#nXQ0jvKy@-au!#rho!+c&B
zEsq!CfV_sYsmFF%Xlf!@jjp&|W$@!fo5JKlSERtF>1$WO40%z|`mP4CZWd^;WQGjh
zHFrYzZg|>39cAAAghJctMXD|655F@~Vf<ck)Om@10l8hH&Q^~!7kk5lIwKEdfJItS
zq;v{cY+A_$x#}UWwky7$P|u)O=<48!dk4Q{5;rq(<2vS-cW6dfQ)|xF%@<6cn?(rF
z$J5NU#|$rGZi&jYQUk3pBuIj`8!c<%q{E!Tlp|f{<qjj<S@aE0LKhYyCxE<g3Em4w
z3uT+TWjEEwd%$Z|G-yJ1+BRLe496TvNF`8))$tzqLi56S1+J0)&A0#R_^IAxa$WE9
z7aXU4RJiwuA=PM>mnbGytpBK{k_e!6hQ;WpCa6Y^q{cCRX0SRXACbg1M3eXCb|kOw
zdJcNFB?FU?UP&qV>IBfIvS4nNl<+L(OlXAeLF(+J{)eKy;(%NCYt<u`&poGiSAz^r
zkdJybisE8Rf7F+#w@KJ4=<BO^?I&qF!SAgjL|i_Jl%pJOxIY)FKdEWR6-Y=9N&>wM
zWGGSNa)v4c1#nFg<>Ae-0K-u^sTX%D6$+g}^hCBhnE$~1(wws(x0Ap|g$L_O4ibHV
zbcgas(4=)-b2*ya^SnLH@uqR3OY;!N-oLz>Y4v4p0Vivkra0G}0L6N60TQ;`Iq|>c
zz@8~YzU$UGjlVl4wt!}`@>LxLK#$|&*`u1rU074$KGpf}2p3nzlHDrfHhK4j0Kj)h
ze9(`ogbKOgfx(>Cx%$vj$}{4#oYSgtkB+x1Q2HIzB2UU7-&@FCU4?P;$b(HP@qq@p
z>P3D=c)w8Mj{PHnoADSSMYReIkPOUQrRGzEz3edv<vH^?<Kd56u|~WJ-4KDipt6Qs
z`FJc*>lCc*#~wABaCM%QQDTc?c<BKWBOKyxsWGOaF5>BuUdDTAFvFPMRMy)IA}v7{
zQM9jtzi-{(n)5c8#(u?koP-g^ju~6p;}+LrSC!Kl#xT?#y!3C$ra0_xQ)WWxD#BP2
zy;qXL9hc{Oi8f4-;+K2%vnWz%$UyHNza-zGZIwiG;xfA%B%>P=jyXNshGn&4a&~QH
zKKGvVIA5L596Cr8?RF*|$`nKmOo1SSyd%cnLjS^ge5}a}p=~+7f>?U65iU59_CY6(
z=Xtr&*R*9w*@m8`mh%Z)Xb{pr{5RsfXs|rMrFD~QT;p`L^X2L+Lt9`=Ym`{j0FN4*
zV(oXDqSQN^w7w30t02!Tr53%@2~)72IN%RJeDEBq!l-cQE-a8iHu*UY_hOXG8nsq7
zf%Wap*C-x`gTxFNN>qPtZsshsEays1P1<3x)pr52y#Y5895p-rLjg2^ZuVg@rlzPg
zlRE-lLQ^U>7r5Ulu7qjO^(mL^`JEgOwMV>tCn2D<seZP5BB|b%4~$gEh)p^!=D!!e
zf7>noh3@|DzxewCgKz@sTF?1g!Z=$4YvW@}UVBNv_XWd)3M0ZM!<z{0Uh!sD+a8`l
zmLVe;z}clWGO?*jFJS$;I3pQRSQFs;6u};NOd!074*0x|8b*12DeKfqwg&hiGfInt
z<0b0y`n6kIa|7K}UFM@cBVF1{2fK38kKsPVBFyvTSrLc$MEwf<Z{?noXN+wtQ_a@~
zJpx9*=+I$V-kRNSrb@SiTRi9dYENpv&6rYnQgey5v2N_rYq^7N-NsVI5zwlzv)Z)m
z==YMu*s^-=&}0Ru=TeYILnvpYT3YnMN6%n-wnxm6btBqKttqv?tY4F*-<o6g2<ej=
zS(-S{F(>!RCj(e+{%AF-srP!eucoBH?8?TqYM5aAwa%xX&sP%P8BS9Ax4D>Qgg!jZ
za`5^CNU14oAouk)S2c(6$b9x7yH&%uVIRQ_Uv2suM{5SSP91!sijQmqRBBd)OVDHJ
z2gLWN3RubX*%~S)$^9^Ik=DOTiZ_r>1sQ{*+rC3&J*=6k9Ct&?_$|#9=1-_hxF?xg
z;uNZrFK@R3_|sbn=g|OCWZWELD4Mw`!_BpN!-%G^G^Sg-nPTbaow6+DPKN<K%2Xm@
z?&zLU3rw_!FfKN*WVh@?<#eA2Izg&{mX93phumlunkg69K>7}rHq>wZqw;2^wSs}~
z=iX`|pv#-K$`2zMPzQ-|V9F>cPBR4d^rHh0(ShVTb0JJrem||C6i_$Nqn(}<^m73G
z(WlyAHXqb~!uU0>>8zH^!9_F)23cNP=1XW;^DHXO#D-27U`vAiOig*1!q~lnCXrVV
zYhrIFztUXa?qe)D{?w<l*|e{|iFLtsj)#-;*zO>AnS((B*3nj}EHi7&qkOeJOTDe4
zy4?FBB&nEvg#O3PJ$86R_LqjQd4FY6uT~fZQYP+%4)=Q=nz_GSdAeY8fR^+}ioWg_
zX04!~ad{p%1kfBD;`t%*te2dqC3G^e<L$&Za}FqXvgv+rtc!2w;NKRQJ+k$#&eG-S
zUCH(b?+$53vJF+Ae>)c%)n4NivD}AO!^84OMM3YYlY6+#`AqvGGHwLoHhmu-^R7;i
zgSw*6<YVUS2VEo;?Qyc71pP`)5ww{fLoMjT)BE>ow4!M>l3aQ(&tZ2e`w2DN`3q>4
z5zBCkMnyv<xm*u5DCwZG{vbwpC3VT<8Ed1jj5(GQWs#DWu^qLvr9O>5^j5665HRXn
zvk>=z70~gmQG}^Ag>s%Cu^1nLm3F5WPQ3&x|2z?kh>is{+P7zkk1<uK90z@C^Dm$J
zrnvd(>KNA7P)4c(jHyd)zOWRz8$(z!&v`Uqu;~~{6sT>Nj`*$7ry5m}Z=b&m0@F-<
z7|>Y;`r!g0*5fEwLg^BHXLH@k_1kb*ceC5RQtEfO!67`?xBF*JC#ilTNDI5|ctLqA
z4>VSdTQLyz7dVN`c{P!0r+xO}(*QR<250?c%$lS(Hhtpos+^PKnAs1ffTLZH9s2{I
z7ZH=Y#&O-&)$3Qqg;ZHB$bTR#^_v3=N9v4l{=lIr9+}!D<I^R!-Sp^L^y0{&DPvgJ
zvp#`3mc$--dOff4v+}3W{5L1PYeA1TiqjbEh3Rm+`&Gl!;iy{$t1ye0HX(0*zko`h
z2@S%af*R;IJf0WQ&(6SakMgcEkaQz<8WzP$vOWACJe`;S7kdDhblKC1oK$hMObjYa
z!FG&Z@9QOo?=l7Z?`Zm0={@1)jrwG$!mxgxLAtKx5fpf(E@$1xxh?Fbk{#*;LVJFC
z__r*9mTUO}Z|AhA=RH-+tvR6vPBo9n6Mx#Y^V)*$YJsI-_Uh?w<v(R(k&fbnUD$kx
zia;v|R6}FLD63y+<bw`h@?~*hzE<mIb6pXc&&;>C_M`nbyH;B2L!I#3K60vAgqxMZ
zhL9Wh9$axr%9@4={P!~~EelD1mt!CL>48m#R-EASuVbUx&iq*5i!L4@S~1{F4T$85
z_e}CU@&5w=wfjfC2YOQ1Tqd%r?Xfnn52zh=_lK0#KOGw+v|QrTREzKHdbp=g@c=Lr
z6sYG_HYk7A<zj*E)Y-p;7xUXwV!&zjjk})=@?x6aM9-r7uJu_)urpN`DAMugw$wC`
zym7y<_<#P*)bfv152Z6E{c^u)AQZsscCW1&h9CNfpkKF!N4p*5dY&mqk|`I}$VE(3
zj_JfI3j_~vmON11H6e}9v<7tn>snT>#xu`y@b4c~(F}YWb*+Ksojsk6-AeC{3}dBR
zqvqY}48#|>8_<$WH5vN&A^kl>w)l6Os@&Ulq2P#vJ*HH7P@^Grw0xOJL3Y)TyPPb=
z@?yse?7dWyR)7cv?cMuDm~^Y!6;iI^q`j^EAoX9_5kkw9re?cV5C3M8{Cko9|D3e0
HKlpzDW}<QF

literal 0
HcmV?d00001

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-dmin0.040000-0.000000.jpg b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-dmin0.040000-0.000000.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..9525bc0da26df8b36ebafd5ddc05e312b1ea4cd8
GIT binary patch
literal 167482
zcmce7Wl$Ya(B&hz2X}qAyF0-x5Zv9}HCS+m;O@a)9_}vT;qY(^?k?GUyH)#Rt9HNI
zTDkLQrth8G^QWi#oIdyO%HM6kXL)HkX#f-y6hQXh1^BxTkOUyW!NJ49BEZALBO)Ro
zp<tt;AS0s?U}B+TlMs@Tk`NLTlT)$Kl2bAPiHYfW>6zHrxwyE<X!(WtID}X@xj6n~
z6DUMPL=<Ecd{k6?4hmulj{oiPw-11U03-IP9~z1h@CgG78UyO@5P%o}_yqm$YoP%D
zeZYKzhJ}NINBB3Z_!;mC3i{tOEF26BG#o56EYv4x01O5!1tz;V92TXj2{wmIa1v0W
zu%Ukrhg0o}%5>)%UeXnp>sv^25jFQ0GdJ~=0kBkPqsG78h@k$PumA1|0Qe7IP;l`7
zCM7Tc|JBn!C!b)U|Jecmu^I*glY$*qT-C${i!wN=umPK+f9?t>v7>g4L&a(88dB5<
zCz(7z4d(iG^LGt^0{!nD3}_61DB$%STU7!>3j6C1RVi!=Y*i@)ssFjbkP}92%DKQi
zpJAZq+#o#Hh1d%|%wQmVRz*m|RdMW$*ujIQVP?)rRmXRxtku^j0HxttRxGYP96j?z
zi<->#F#J$6>ludn(-jbx{CPjFN8`(VY}gY*M>d7q@W7>Id-R5PX(F9a)6`oP!>OU{
zAu`f6If11GP$YDs9jZbpkSaxr>#X{GK(^oHNG(An>zN?!;3@b~a0*LHNkwZF(S<vX
zXW=M6q%>tPw*J#DYk@)YM#*6OIk5jACFh<0J2zweqK;T_5EB9sRtS39YAp-9NM2+-
z2ZtUe9o1ief0Z<UO$$QzPq;|X3V=uGp=5L7kKgQcxu3ll(cMecI<-(HFR*W4vwPP1
zLaHGb58;<Kc0wf2YClodaQ(T|{r=pTX?y%u2ZtQJL)!?4fJcdVb`PkfDIEij-8-F@
z?@**gSVgsYuBNnEHn(Sp;fLDrYz;FfwOQcTbUgnw!S<xu=#|Z7((O-M-0#7<X(W|)
zy}Rr(o;Q+~t`_*Gx$Ql`>vGX^l--G?8=EXnb}0>Dm6@rCN8B$y>s|1Xn56EtT;Hdw
zo|O@Pk8(mHHyeu~!9k*G**!;G;3o7uw<=bo9=i)F&EVkeR!D}s#UUGPUx)5rKuda7
zctI=1ngSWrpu9$!(DPqF#xs)dUx3D9Ko*_DfkodSSE!KLF2DaXxZXx$&AZGl)dD)M
zp1rN`RQ~j<GIefuqgWe-gqImHQdi&Yj18z5bAgADUtu!bua{%`>o_tchw>CTJ=s$X
zTqZ(G@&T#$N;t<C@uNwC8YR)z@-Ak-zN^Mh-RpG50ph^?$0g9noYa((ds^$QK7%Q5
zDo&%=2;!0U4XRC)@XXJWK())K8p9KtJr_G-eVv+Wsq>`|6R9TYZRD`Ja-92jQQgLc
zBAIAIT!+rKmC%FhveK@$aE)j=4TDI4Z`RX&)Iy|_b=r*FZ4$9X5cEEy7T%PQD+HaI
zC}BtyJ5?=)y&$R9*zc#@Dkm?d5YkJo1ix7pJC$;6L<;?wsKE1=gbIlte)bi^t-7L!
zv$+PvMz*?~Q)<VGDj{atefrOPv-k(f#(BdlEO4#l>wOG@vbAuGSf%~QCqK15iSFWS
zA{|1=Zh_Fxi^+chLomsZNa|*}Mg*%}#ssFo8pi7eR7WAC-iGf78>;#S<!_SBNmSw1
zTI=vPd(n#3`Jbd^z^z5+!m(NQUXJqY6y`sYh6(OTWa?_P8B7KEzl`jF98`7Evd(iM
z)A&i>@OP-YFV~t+Mr2pvXo$k_xSCgrqUkDXDWmBM5&qpt&=p00j;1U6@&DDJd8FFh
zymwiO+{dww6&;ha6w|)y{>fcQi?;4zfP}|W)&dQ~Umt)qd|TQnzQ*=@Byqw_=c!l&
z9rUyZ2EEE&aAhoc#8GkXUyu3A918fVH4@kYyG7DlTd8io!6pfSoqICTs>C}rTx#^z
z9|KKk)oE!5I-w_PUq5hi87J*3JB?!O#^VW@Sdf0<pMK*>$`v7NVfJFmp{mQgAz@dL
zvus^<1&aDGm=H?1`d{bg%I914>!`sAZ)|(C^RIjSq^V5Hqg3$KQ*b-Xh@Lp{^Py!#
zj4PowjXVkt@Wj!#Hc8~5tU~LetZl@z{7xit83R-A796agJ;?R7H-Im5WAZ=?%I&wW
z<{~2%rbx79NFN99%z7|hZ}fETG?Rm(c?5~{>80+H7v|Uy_mBcFTWrQI8KJ}>PxxtA
zyQYe_GhwqX*Od}^;ui|FjU9si>L=r5g|M!6kWC5u6%B+!{c>_P9h?@P(p2lO+EQym
zu=N!!6nt{bz&_6-lT6aF{#;{snn^wfrWN`&bs~b8HSM6R#7+WUlY9CZE6w2+R~f~`
zQpd`iwR_d&jIl9F=zL9lKIH1AOMTwFdW4riMod2fkGs%oI-yIiqsf+@9o~F5#^@)b
z^mSA`!@6Zc7wu(cVvbdk`F%bUMJ{-Ql|A2R3x^XP^>wSc`Zjgv>*xT#I~h`^GD!JQ
z$?}B~yrEn_M5X9Fnlwh5xg`>kv528|AYY(iF{73A@$k#uH_|dulF{*%h`15jc`G^9
zUrl-*h??EyBBWM$kann-o%W3>2pyph5ZJB5Qux5GD@EK7wn*vTxr%j)o!^|aH{M|w
zF#oDwagdZ%HsaAHM^Z1&P^u#4`*K%xkd>?}I%h+P2kpqeo~M&s8PC6}`trkI`>-xv
zQsk#6${c2Oc_rCd00U0}cV_s}d9meAEH9f&o_l;TM%pp+T*(i9z@wr%Z|znpC&yrU
zF%if+dgmw5>{JIl2;+XJ+0NCzYtiGF=}bQ&q9u<n)i(|is57$+KU~{Hx#FizjTH0{
z{Va}SeziJHIlh4n>-~JTX&j%LU)<7D?n2W<2>TOP5w)>k&+RBlYqENMa8u~y*L52v
zy*(Vvci}*!X>L~;I)C#BjLn9Y8UMhfZr&C4sevm5LL=9QzW|k<)FzzVPI~+?(@uYo
zMmnx%9lk7c@ns)-RjaqcuN91am)Trq+)^74%nd^VAQmQY$8BKc4rgb9(k`_r$Yq@J
zI(#3B>|9}-F;BcDa?340^P#b&8nwswPMsWt4w+_-##t?v8iYO=`-Z6v8R9F6Wk`ul
z1E{Im;n99Y53sHus^+8!^drrF_84|RPT1vf8>$-_bjj}l&C1_3EH9{y;yYBID};8o
zwY^5Q2@7c|9Gm7|uyl{4wSLd4wjoc9K)0Te*;ow?KrG2uXiN8L_5spn%a8`5c`(MY
zW=8v@{N{1FuXAYjJ9Z$IE$zq%ANd9iO)8WB65VMn&_Uxlug6r2X7nb@fL)Y%akkgv
z?{SNSyJnHv{rfXqye1L!P)!0wzHW+smlrc}h)1gPPzR#4&?wWp9oM?Pfj*U*?XW5l
z^Us|m+2atGr)3ETv+xZR-JG27Zcu{>rKWN~EAq)7BphS;3O=jWEoE%Zko(zZ`I6)f
z>6JXXpZ1nt|9rh$LGf|W(<QTJb*Rk(>xBscqvWocVh#ZZrxU5sc8gzGFa<mP?Xh6|
zT@JMLMs57~QXR|<0fJ5aJBl7^J^?QBvg5{l;gT*eWU9%aTKkZ#ysD;{X3ZkDWl^ic
z$=$C)4-m~CybtLlTW)SxnQ&j>2t*mScV0hBRYXfc0AjEKoZobi`LswDqWL25XBhrG
z<kXDseng{{+00Yl{VTl1VMzK(?AG?QzJXdBJi>R1cfJjVq4t)!!XK#UJ|wM80GUim
z=r}20#YOyuMF`4^*Vx((RvAbXuUx0yf2t9FFUL7kNEfI0)0I7m{mwT|1a#qoFzAEl
zP5)(<viAR<>4lL~dl5^y#S)XwrPG6<TbTh<xS<)e2D{YUzQRmn@x{s$sggsE51=(!
zQ=6~R-Jv9JNOy3sF{X}{8^3aMpm=If0_urf7k3AXo$w75kVS5SPCJo<av|eXQX}H<
z@Hp=7igl$U^HyYO&z9Wka_T2G^+_9qPgOy!4<IlmNs%L*qt#B<zsS>1(=MDpJ2xno
zfr`S{FygRj1v}hr2oNw6u_dL=j7Hv99H&UMjnT##5Do4UjMzT%AVt$ClEgGl?ch$i
zPHf5tnMW7SrLB`nJilBTu0i~mHnv-`0upY_SSD|9cG_IZ*SBQx<vfR1wT){B0WW*G
z4m$a!3xtyqeP`MtJ|R3f5j7{fo1-8mi;np3P<We`{O_DPYReeS>w-`N4m0OM@CJ}?
z)n#z8L+4U&e*wZ+9d<F+ERIBpvA>2XtmqzO8~frh(ufjtb9=I0N*dR*D+)qn#}cLC
zlo9roUG6F!s)ysMJ=>juhQxB0{-?GXqHprfuZ9B~yn&1Y_GIw5B&_)cr=CYDc)DV(
z(FbNaBnk}#yW^x-@jBIM60z#BIDEi~7WY@NEcJc`R$sn;svMkk`xmIMe&($UdVM$2
zL84gy;&`U9_4^#Q>&#k&smG%eQ2pM3;+MHJg~_>x#!u6Y(vBQwCM3Nf_7re+*2v5*
zQT;Ef%o3D0v&bs60y2g=jo=mqm8%<<FGI~af^B0OxQ})uyGpDW>tWe^e77R*T?17%
z+>6uosJMf*lAMpz24rT^dWv3`n)>yN+;nGho;=4RweUZ9cy^yIwZb@7g}Y~0ClPiv
z&4Lr+3|KN9)00ndqboePy!ZZm=#)V8PEJhP#oCbA%mO`n)Z?g@>~#D9;%IFX7yfZ6
zoTIJ=cFD|+zze*zbU1oNhz}#d4s5HF$}IM}9LhP$IiVa(=#N%@%OoZKRBspwY^6qj
z2GL&m8{|nr{wy$kcj<v(8C%t%oq~NU{{H#4_t1_hyprq7Ny_S>3};gk2o>>Rn&)QJ
z6cJ=d6ZD=<T5wYxTBd)ho8D~HDQ+M2z;oIpchn|6nJ>Vt{F}+udG$*Z#0tsn;wAP>
zgj+i8(X(mN%Zt~~jU1`K?-yt9&`ouRy!<%6WmFsL-W~kxpWHle{2ihVQ?+mU8x=f+
zO8=nEk3=;wX+6OUFPhr43BgVUCwp;5ib0edt9$H?A@DdO!3rr>lQC)qa*Z;Ptj;7U
z#?x|1$*QUXj0VNVSyYelHBp-4{j7OHWNb6;xDHFY<**)T$HEYM@H4hAng*jD-#<X+
z1TAYQ+-4uz%CGSo(h6Gbc^QkW-6IZycbRh1cRTHf#w6Sh5%98m{iZ4s-O|WDx8vN-
zj~s7X9v$tv3=bjx3kX}bOWYI>++6K=<fy}t7Q~Xb*(l`kavo-Kks0uIjRim-w77EE
zdTC)1u+S#muy+ze9mH!_5ObV)a^(;a<VILg@NStUk>K2Dbv6&pr3+6U<MFn-Zpo1}
zr5W>OddmXt3HEK?1&(@DEoBhs`ab(4yXD9E-^wm$EiiY_7*aI0Y1}<&>6!Rpr19@M
zpP+e`*&gdqLzS`&9mcf2WcwW?ml5c%<*gud<-7&5B=vN3Cf`W6H->n!_|T1QrM-S|
z!*$fRu@dN*_Cbo1%V+a!-oNSm{t-cJaEoaWEJFOEN%E1+ywIRx=H^7j51XuCN0zZK
z&3<ZVs|g+(5#Z4E3ccX>uJI(uI)Vpy>z%Z{a>LeKWC~TdPmpIOvQZ`S0Ljf}Ux#g&
zw2;gty)f952`pgDNQ)}KMG66wC#%KEe`v$0Oxhud>__UhSG$rx*(<O0syznZr;huP
z0DAdwgd=yc2saX59RsYGV)Q9j&FT@IzD(ekk^TL)<#(HYcDgxnXA*vsE6<zJ*ClMi
z*oV>8S^$Yw%uxA)X4rJt@N|27Bb!k4AVMu(*R8=b8H>g;N0wyj>N5LL(j6UIYOx@h
zl%EuH#vX^4tqRjM>jnLv3;F(`Pg7^SJEGmJr9W{wRoE@f;m;;-0D*z>x;_O8A-FtZ
zV#af4(qep+#ndR%slUS^ZF&YMzhdh}9^j)JcXc$19eDT__8;d2amJ3rMnoCb=lvvs
z6Akh+DXe^@B3GxOI`wPFkzc_26p9uqP&1qf!WG89o2Q*zD4_5w#$YN))E9QLk!8st
z-*^1tizNhBZuOJWdExus`B)2eA){V^G!gQWL`fC|^6m5Yqg(@hab6xRdOy^m8;NLu
z81}wXvI+;kX5TW6dP1bM+he3)LWHC)#yMTh7LQ1D#5ci*niocj`-NRfM%NQ|kiFZJ
zWq$m_+SiOMwi&q3^}AbTLdWeVriqEmh7;w|hbLJ7C>;HQ|F;RZR>5ewj_b9rQC#SA
zu_aH;@aD^nps(*GxMRdZifIZ*hC`WNSlJplzb1$DFZSpX(Iev`D;abR2rf+;b1Y}T
zr}@q29>e?Z3!Z4@Fe#KAvHqvH+T4P9Cq}m7pJ^lV0+cu_x7G(5Aqrj_<DbkA8iw;l
zMLcGSDlQ9Ry9YB6#$r*RuTOQFofnoB1(^ojE^XebPN<`^L>DIBu<wz%8n?a8wc<u3
z;RtAVX3~0>Sy(lZiTrH%7DtJzg&6Y51S~g)ooKZsVVK)6wy^JBbk|o1G$sW^Q9=uD
zL{oj`R`G05G#bAbD{I2&lduj-B@u0f%h6{-fPyz4r+EuIi>$>Dd>3Fr9%JpjAz@f|
zUFB?&0XZPs720Qn8N~g~_UaQar49w3Oe*Ip@*T*YZ<EbDPkgl2yq8?dzeJmg#6K-1
zNyKApUAfR*QM(5xiIQmUm6RV?06fStz^2%x>dbRIV*2jkZ=03Tv!Gb3yQE^Jp~i>K
zlyd0x%UC1u#i#iql!(YGHtJq&ZRV%kkIoJ^WEI&?jOL_IA)5Wf>OBSX%y&`rXl8u)
z_+y8n0$*V<se)w)i7Rd@9+x@Cz#Fm&6d$R5ICj=FmS7L*8fVHku2+U>MaN<cYhC}v
zwscG-?q-*<Ydz_LUSynS-$mVz8on-E&v2lN2Of&aN^t#*?;Tuqyn4JCcz{}^E5bh^
zLf7POQe*l(nvszO|JIyTN0^Z^AX9}z-&uHMR4^YR2Yw6WtwE@=@JCNAW^Z@A((yGY
zJ<PQsb!@MdR=C}!6{=FTYU%xcaS)JqG+X@rUIyb=I|^GLS)Bc3qb@>n>PGg+b>Rtb
z^`BFSxcMNK%AvfZMhIlu*il@29qRW!&@4^LLT~FY0KMf0b4db^0yJe?m)yw~;di>?
zFg{8tsT<YkTqe=GS2Ri^d)*)=zGnlY4+g2~4K9$Z(s{bY{vr!aJR3)YZaj_IZ>!nz
zQ*}cbCp(PBrYOnwS1pGbVYwrfO$f4`R^sgltktn*_&edQ)y1~-s}B0U&@{sdl69G%
zLJgL^!Lpn9a(;4`hT_wj^W%oI$e(#G?-JMRqETWqOhsSxh2^G`&jcm$b1{{qq%@V>
z%<5YSCiAzjKdoSwv&j}-7U}JOuX0UdA$vbC!HLxfFhrFG+S`vcLo+>p1k%e#7MuBr
zX1>m%$$~m|Vkd<n!u(G&+B^MTTUgNDiOfmhFZFQgI$A6G-FwaYHXuHyhXFodj`bLw
zywB}Bd}SnpM)X1EVjaJvb^BS`c=WOyTX1UIYhZ*IOM-y(eNV(lbuEPGa1|trAY>=^
zL8?#Q+AnB6CGHy>0m^ck7{S;Us|ggXgNL5Ap>j)ENAlXy#nZ@73h`fjHDS$kB-zrS
z{gC;LgziN0CY3*(q~XePPmy^HLv*;Xy6h+?uwN$--Vorb3~!*)`V2wFj5X&x>E{Ae
z0xdZWlFs!mkS}o1!PCLQ{-Z{-N5NJdsb+EJS(>XF;+CRNx<6AJW<UFR5Z=oxDgN2|
z@x+p%I-ji^j!2UPJ<+9vv08M4x*xzW4b)Co%#R}IY{NIM2~9|lr<}jcmep7|JB)~-
zL#b468@piW=54^#uN1WVJY@c;hHVv?u>yTtB0U#1<?i9hBbwG|4DPN)3puTds<8}q
zbYN;eu;G36WLZ5}Aap4LfdGaOuSkCBVkAaPoEVifCCb6x+|pEnr}@~#^2v(}pEt%p
zR??Xge<=mCIkl<Bal0VDwjJ<^phS`P+ES?9sfF6Abl#r8U%(-^2{qn%=kea3V9<9Q
zZevKCZv7<rg!GxvqFha;HGPfq@4@yUC}a_ViaJw;2<R+nnWmj>JHZ*019eC2Jpv+!
znac1hUHLL}J6KtA*&jKfxmWN9x<%mqzks`&zkom7qNbp~fC1pHShWrhGs!roZ&=Yr
zp{gCi`w~lWEfL>O#*H?AMf+MwI2iY<+c6TG4UzFnM{-cRn;jv`Uw}DIuCoyT)AMCR
zX?gSs_<qegwTOABQr2uTgRInsd3vO%XzO!~Sv)T-EPPgi!01n&gwG~JUVOx19ZviC
zCY&qn+D<Uv&2zI}P=&&wvNrmqCPVOc1uPqfFVa1SlXr?O`T6_Flq#z>80hrESPcy+
zTFC-4N_xW{gB~9_WZfDVIs?SZtt)s!d#C!YTuxl?VQkZW<)!wPGJZGMvRKyHl6Hud
z-lfD56XWa=8m&8(Eg_66ZO@_yX3$7V6Ag(8jZTtkBsr~)LdSIF;=N=(iPhi;IA-Al
z)b8%uKdIOA3&Q~jsw>y5z9p0DD#V>}0w)zV1Xb968WaTaUA|WBb?IdnjRX5VJGs=%
zt>#G>c(b}}Je(|$vADn{If=6Cv{%?^6~DZwyfnvNVv7N+>}~l<pe2u3-Q0ppHGJHI
z1gvS`0mu~wI{5f&cyv*TnHeH9H9Z66j~%xlBZY=#>SSVBoPE?DSt9=`!=)R>_NQXO
zzW_NP_jQ#V>&UOh%?Syw;C7%xcEC-b{K?UxXc&Y>qn%(-hVn+j$7-JcWuC^jQVzxg
z@Zq*ug%WMK8(UZSkNWj(&(q$?{3IBcK@#=OsN6!Cn%stkI-oPf%;Wlx?QQti;rU;-
zdH(Z8(EqqX>qnT{lo+(Diu?m8e#vf7NvdVrii5=;#yl@{ex?w3#q-c{DmDGH#XybU
z@rPZ9%wz;@jG&d1>hm&D<tZao_}qCpItGPz46K@O@Z?e)izm|c1_YEKyu-i6zc13<
zT4<kSn0K*bsd;V14-|24)?>b`JFCpKmw5I=sY$zEUTXQ*=%IWN4YO1#A9kNS$CP7@
zp%OGFQ}oeNePa>S!B{)s!)9dBBG$WL*EYWT?31K;yzG^}7OH29OxEB<4TTy`l_+zd
zyKa#3bp#d5xpfp*GPS3I5Kl&JmjQLdze&rE_Z+uzcXfFU2@XkRAUU)dYi(6O5HoD3
z3D+2J2x=d0A-6lOrnSLyl4)MQ3?ol-240Nku138r^?c1kf2bU`kso~bN`sWecaZzQ
zQ!iAPIQ#v;z6C7#^-y{}&S5(fyy^2wSm#CtGoVakSYYMU7p-Q;-O(z1#`ODWvmZbf
zd7wP#j3?h7tnGpe6AI3Zv}#I$el&-xF3aE1V`SU4N#qsrA?=`3B6HL}UD@u@PhLWH
zGAS^S#I|in$-_B5v5f?BjzuCEvedMSaDh^_5+Z05pu#=*Y7_>j=4u=<#CC*Gqb&+w
zMZC;fN<G5bEK)xvQo<`KA~cb+FL%3o8uchhsaZ!jFSgB2HCFrDzTtQNu8ECn$}&A)
zI+bimiS&wu@X@-8cB!S&;U4I0g_53HCEec@F-%19_{YQFYs-S4LkG(g63U}e6=A$c
z%<2|3k2*c2VK{Oyz6gZcoLNX4M{Mf5O$%0(V0P$J#S9Ii6@-QeEPjUAICs?Nd8GQr
zy1l3~oD}|A-C0B>Zzn<~&Jk|9`&J$zTNxR-&woKLx{EREv89K>4N~e8$`-0P=xWG+
zPU`OTiC3S!?u2em4|}K5;PU$(L7B($=Pv-<C7No=X#*!cV(QJj$=UPP4`tJlf(1F{
z3LRxt^^j}!B-RAWupNhnN^Wj^kx+3WmHD7DO)^kXxRhXILNh`dq!rQA%(<TQaN6**
zS1bsJX=5G8bX?@z<PX&cjAhrq7=b53zW^^~T!zrDw9^A-$~`FBuf)+2DVgYKC(}!<
zPVi=bCE0!A?#adb0lS{?n`~-cpeN6?H5{h{^IBfUGhX><HkIO+VyhBbuC3S?Vm06V
z$4Z+D=Se(Umk8n@nhm9UO(pJ?Hxe*huhed3W!P67u|DWhTRZ-ix$3*?#9LB+_;Swt
zw1u)1!Y!jgT%O&@1aVNEhhBoik|Py7{pXAHThUU7bM)oP@SoO#qXqLPO%;Li1T+GF
zaLxHzI^>dMFo_d%XU|c1uh;cXI24Q5Rzrr8t`echiC^}vYcvfh;#(SgoNOvLv}J5u
zrMiC_bJ8&ky||8e@mDOxs7tNJ-`28@eR4PiDF(_t&AR(l8xGm>;yw_jf})@#YNz_H
z8^~ixUd*n!;xp|k4IiSMx<kISa6r?GsS^0OIC|Z#bv!mUH@Bs)7RGZ-cu&Nw@A_of
zf^U!wr-oClC}EhiOnIsqa=3114A<X^S&WUIjx0(MIYvpb90D+3W+HIQP0+G8Gkz-m
zs+E={GJALie?9)~DG%1p+m$tA9-0LLwD-#3-awi|DcnQ6d=jO6I*7pG_@2~=st4b7
z%>~RupCk4wG=#-BV8xSvRW^BdV;27kf?(wDwU4n{!07tOsrz<P>p4%RkLT}k0`nQ{
zDP`^F1cpXE5-G>zTj>RiJx$iLMnKS+4^E$B&Rg5G<z_BWE>XtBhG-@hS^h%=Q>bbA
zrbdtPHNc=G8TP@Zf4@6G_Egb9*1Xgwne}JPXE;fZE)92A4$JL-h=h^qAA)qghCC)s
zc`->7y&mbU`GXMz$GM>?N!q0ckGi#(!Lm}VrS^^S@+&hU@EIj61>qA?enjCO7E~ka
zdq>N4;3j(7c!Dp<GJ(@u6RzG{KxFMxW*gQy&p7Xd%oVl9Q^Fr&2&G8nWsDp%5Bx)+
zeB0lN^Lhm=Mv1M6p0%3XOzVQX3p$lO4ZZQeW6s1Q@`Kg3N;8*a&nlOOejc~CU1nF<
zDc*2K1MImEYd^EzfiUHf@!br;jlcB%0$PQ?pUlQpcwIawj=L}qUx)7=KdC#!Ma|aO
z+3+M_IzOKML8Lkgc+te!tl=pxT3`QyOC1)2$xHn<6Cm)-GyR(L3TFcALas;JhfHAD
ze!494GG4HWO>Z#xT30!4UU~`i;8{>})YH(G5+oZ(zf$R)eH3pb;3{lrwWEhBobIqs
zC--uxbNdi-tMmoKX55JgrBHUDf;0m=w!40z<h9TLWVMpEHm)WflVE%azE-}yFg|m?
zL!mPRWPr0-N9$={I)8MjZw@?)R(cL$ZyRXDQ%g_=8GWFb<#sV>bMj8oG#s3x71B|S
z@pX_f6ms)V&jtu)k`W6j{Z><7Cv<%k?bvv}xKdPT2BLPl3FE%lVGIh+a776&<6BaU
zk1pF<a0l9b%hn7+XOsTkl9(041|O#FORO;&Nbr~%v1b^bVufTC!6WmT*NBxmRoKWL
zj0`*TeyT2;5E9Q9z6Wk4Ren?qmsY+y>U4%v7G}(CY2}?$Vq&TymSmYt6d@z51YfO<
zzsapc?y4p2zpfr7$SXJv!+!A|?DOOGfMl*FB-5HOUvwUKd)=IT)}v%p4$(jwrG?Lc
zC+*SbEHg^aJTFabLU$9)(-C}Qvpe7kcTiqd>#+vr65wD^Ln;XPfrkPMg8aYiS~u?8
zQvI}-2X4@qo*7cWUClJ|TBN#Rjc*+Boy+ULYQ37)j=Se~)4U8xQ83|72JN*Zs!1g2
zCz2BVPhAOC**fLr&X{-@*XW9Bzy2>&DgR?J@}CM>!m=xE=T=7k;3G;L(c&8=)cF4e
zs4e~&TPg&4&_>FlQ_LUfZPbO2oape?64DncQ;HwD)Q=iw)>=+}`Dv@VX27TEv1=MZ
zg`}HWKdE+1n>--YN8H5Nf|is7_ho%=?5X5wRw>L@U+VMOc~=x+b&h$%2qLM^i{_Un
zxjgoEO>*`9mIZDHnnRq9cw}wo;dVK<KLY4+jt&*1!0;kw!fmIq_lqV^H$o#Sl}&`V
zKUEd|NV6`OY<w*InCLqi!9j3Gq#kW%7JmW#<?Ul~_}7f2(Y>IxoV6B|kksMb$4Oz9
z?`x&MOx;t0=F7gz1t>FmER^DoMVG_2OLO?99NLNRTy*la^9_0>oaSkyP$f{6S?N~@
zCN2NgTyU#-&wcNrjigc-5OAGggtnHW#u4U%(Qgh>K8w$*QcJD*m8K)Dg-fi~At2?M
zu9^|-ng<8u6Z!e0BYC)Z*1k*HKUQXO{HBJP^nkemW9<4Gy$qGwb&Q3YzVVt^qfu>A
z$AAlyucdn#^~GYxLyyKnn9G&zlN+f|m7@c5+5}j36eYgbny)G4NNG*_yj;oltMSgy
zG-&u`ZiKz~Q%TP_Yz4$|az~lRXH7;4ZL^+Knc}a9Dq47hLoWE6j)rby$y^&CcL6@K
zwO;bWeWG$voRT$8f*;i;Ec_PF-x`lksVjw;A}5=}vVnU#xZ>nFoZ%iom?kUI_8Mji
z9l<*bRtE}-@qNV7D%v&o3%4;;l&M4}lJ6ZKuA2QM*abZM=@ywF+z0tbd&~pLkwZ#o
zoUH;uvW(J!^At^m&rNx<W-hVs^HZuggX`_?t(?6Z(1lMPH61?Y(eN645xan(xyjKd
zom=*Vq<X0ERm(upRAT33gnkl+p>V4WO3!-@nyTLJrJAevp|8ccnHkXe!1(5<Y(3DX
zLW}qzG}$b6te&TB2oVggaNv)@2Ynahaq0+_1A9pe%1?e_F+$@5-#t#rVXB;y{<xxA
z3>R%e(D>`9w@*e9dgB9;8g-iAc`)!n98>6FP!lQpa$7eQBqdLBINo9(X@{rJ>ob!f
zag6}u?x&oH4I?iUPv_Tf+W@{)|8Bcz9YUYYo%dtq@6e_00zdLLs9TbQaQc$J@($br
z@1DVJSwbV*+&@_<8y+#-20wm&#rnp0TJkKdv|)^A>wrw8xS?!SX(y8`h%9#*HQ9(i
zs!VoiJJp<N5fek+ggNw_Y~2&G3uZO#FoZQ55i@o>P7FjUT473O8v;RPutwM;wWd*y
z?^pQ+!z(x=f$~VO$gLX)?^Om7(+o*NGiz8#afo4R`Ar)yJfO-qy1SgO!yru}h;Iyx
zYX}jy%=<>caLol3@tTPEuJm#ge#F}6600&^A;zP8y0we18?Y&)XGo$*(!!p@ML)49
zIavS}?-hEC&qwq&_J!YPQO<k%oLWpYzY$pcq9vD<rB$qX&~?ArHW#xL=XaWR_grqh
z8Xe^-#OfTxJ#KMbOY51JW@b`w&PPmy9@-T1sLp-`<=`YsO!-=wsN3AY^tQ6*VKAiJ
z;}n=-%)Eq?WmpPOOU4x2D-+@<cA|KcHw)T<?&+p$)#*w0Ggh@~18tW(&#t<b%e5_I
z^%yNy@i7sP6GS&V1odR?x3wMi5JD&GDyodlY<JK_8AE>5vdR6h#Y~aDEfd>r7oVK^
zzBr?pB;_->tAmd<Ah!~IW)YT;(kXBwT57hrvd&YEIyoX-h@Bkk=@3cq{BAchEp~zw
zr0jC~MzW<+)~q2>MhU0#HpLVh#LG=)P3I4@P+O2hMH@kC>|R>6!2Xm)3|rfv4`Cs%
ziE#u&(&K-BAvTwemK{wzYO&R~ITY{rTm6%OyFY|?E2*FR6V5=4q)&24_KmT+rM*?%
z%)LpFg-@c>yBmS5)aT?p?P<-boCjKedRBp1*LJBZ@&He;x$$ASu@$p8@{G0(wG%^>
zHN`SD09j_9`jVyA&=ozLnr}8u7LupmFp;0;Apby_Sh+fwfB<y6Ilir4X-<px5iT;k
zF-gFbb>(0bA=KU8HhjasnL7MlQ9i9Gj*4G@^=+YLTHenhdeI^rQp<CQm&QJ&#Y4%m
z&C0`9+osZ{hmMJMf13<;)SKT?>fZ8&$jH`voepDKUE?&t3U!K*FO3);Svr8MCK(y>
zUEj!EwACIYzwYd{q;3B3k)a{_v+{OIda2S?pAvGirXBChmu_|?6z4^{9@syShWo4c
zpl|fI`rT`{rDqyXIE}_Xh8VbCf42^QDjyi>faGcRE2eW)WpB>ts=2WfMP+u{|C!1=
zd%)$8QF=7`V^`2Sos+*$cN3KVWr23r4+>}dJ03J+$|S6hWvP=Lyrq3DYtyJ3ZwTy3
z)$7qsndm4%P!O1`on*hVcQBq@4&VFc+k(6lwl8(@F5M`}LUCRG)D79O{`vV>XO0X$
zvIAb2x+`B@K$%ywchn~xb7rcbi@^0%JrnbE-rst7+QnueQ!c@;i|T&DXMW|CbD(>H
ztwGnEdnLCo&bF?9aC?G(3Grz0G*H5k_hJyxmY;uH2(fu_g^1Ibw-ehJI!7ht7~fY>
zM=|?JCzwZ3iSy}TpRw_b6L)CZYbkjJ_+iPAc~coRx($_zueh(%21Zs#Z?BedW1!?f
zCor8~<dt=~MCSkEAw4Yx*X}g8fT2wS8mY19OvRasnfw#*((?=IifmjFnJ~Qe68fG`
z2J2??XL|G>F^mk9Z?DB|obcl|#QB)>h|PX6pwG{=zM}q`ME&s>U{ACAGklNM6wpsb
z(%WEAnpACNdsdV5LWYVSa#lmV0w1w_dDs&sMQ`Tmm^4^Rf`-OV=-7h)&|NtFyEKyg
zzl!Ww{;z22iY^+81#=i;Q)CF?5wu;B5<y!ylMl7K4@8~b#UWZD9@{!Nt_?lP3O)|c
z8k`fRv0cckN^wKmcsPE5?sJL{3ifRs$sCfL(B-3<W+o51i%vNofw6?M<32H=*#|}<
z&33$WOPFgZQlS35i2GZsfJ5neK}@^sE&-c2as$557e^HVWp4$Fc-4)e!L)9bcP-p+
z@nT2a5kf3vdB|jI!1grDxKJn{bb?4=jnkh$M9OK<e*p_)c;pxGk6A}GCXw(L4oe7p
zv!2m%W4BZnDgs+)e*y0|(qxly$oWh+WHpZGxbpAuVAN_trDvNxKc+P;_Ld7m$j=4b
z7l-a4umS-)qF?DQgatA?(t_GuHMCTzf|6t+k>l;^<9n(9kkzPv0<ttAj#a3WCcctM
z#nV!<zwXWs32R^C5!t3KFB8xt1(#JPTMiK$L=~(HHEwmPR?d~A!PWQlX(zc~6jeEu
zuB}(lhHb&b2Q3On{ch`4ym1@&juY@wTWH=kM=XFMoB3vkQR=?Q!8gjZw1MriY~NN-
z)V@pW<)?bL-&9Hb;=9zo4;yq`wAd5E$baChDL&-=mH4yJDP5~g4ST-&VyIC;ECPyk
z<tobPWdH-nL3h(DTG`e`%igv^&O=zNIS$&8EUWV22NOU6Z^G#?cg|5TJ57rqUaFte
zJ;{1_p`OLN7;-dGNQtL9a2AUu$tu6H07zGC2B}W=ZEY<TvL&b3@))f$2cO!fYwHPP
zSY23tN9MI%0OQMT={AtdcKX`^V@Pb*?Ft>-h^zYmK3QJ&ebj}CBm*BhrLAt047$>9
zU2{|xwM#Z|R8n*@br1AaBD9@R(xXDh3d<R`N)KPeDbsZTeY8NQk<2FH;hO1nH;rwT
zs1k}_;mj#(UwC!5F8KXkX!gV980)((?-1JCr|-b&rV&V=Nki`|i8Ocd=g;BO{n*Ls
z{xF2N+D+KoXACKY)iPTzpwxONS3Dizfes2%N*~=-)0Qrt+v~XD7{2cdey4q?I=?$5
zQr(HeiWva+$Za{y3RIS(z#Urra2Rb3V3?CsQNW6IK&|J`d0VtBvdM!U=RYnA&i?`~
zHACW_o<#Xvl5}<Z_DiRwMwjO^LbZbouS3u?`eS7+TvEX&3z}Uu=cLMQtkVTB2gKHQ
z^^+w}TIfbJd-!M?Khmv3<f1NL9qoHHDS^@ausvR+-|WRp`_o^5hrwn#c2kG0EwdK~
zz$n((3jA~4#QWacED5RJ)LABx8?1Z$d1XERD#jYLeR1)f_@iaFahzTFx8WHnuFwqR
zol$9i6bE>`=E7gYOYSA!F!82l$}8eIAr(y7cM5X#jd3~gf`40iqj&VEb#L(K=a`b5
z0<*)I18N3ez9AM$^t{E6{-N(qgFe;?^)wV*#A&m?7y|7$T6oAV#xx96#wPnW7%<ny
zi3EF3e;<o{7>byIe2J|a(u_~Cf{lA~9f`*O1SK>gPJF!KqO=ZK73B3iC31U|rA?)7
zHex)<l$c8yvAPZG`i5O&X2Q+F-~8cID=2rid>!*FTy$U>7m7bn&$OxMPGa|6dD5ms
z-?Q=>(LzH=jsMUsPrquKQz=5BTOlJ)?X&?!8sQY&-4({l&2k~_90KQBIb=0d3{S#a
zX}h15)<Jiz6TWubMHXmU9o#Uh_^8*NzhSNO$UYYNN3ggR&)%Otrll=ftbS}pVBht5
ziAs|Pm!o=|uq0+IjrNLbxRpBms|-#@B9zO*4fe-ea#^y8I_mBif3J}PW^-(`_Y{@a
zBlbF<x|LuU0pDi(QJUVgco_>8MHFo!z#M&`11IUs(YX&HA+c|mBCt$4E60`KizfJ>
za|RPa3tw<stFARnah7Y3=Fq=DWS7p$y<%fH^Yk3tfJ|`VNcuu)BD@w7)^~`0tT^sK
z-1%BQrIm4YU5*i%!-x?(uj><5XQuGOGV+K*8F4MAEL=bv4LR*}bX=7yAxk_4Smeqm
zi0r_GzmvU|^XZ0tT@;<6sBQCB89~Fr95t>z<6NhdSuq&GC*H|$U!f+%gC{c6YSmpA
z^zb#eEs>Xnz-G5@zShtZ_Y7Hd19)F`37kK_<%UF4k^S~sUurU6%uO7$AzUB4g8T)1
zZ#jrw&%715o>B>y;qQM7vr=SuNO6V>m-ar~`|bEP%}WrHv=Y-Gn3kWPrg@TE$*C`e
z5cb6iW#*f6H=FF~SG}==Gzv7M*gZ#EI|qB1N~(5*q~J?gQ3hRMapv5ed0^hdp2!1_
z_-}`LGQvs!dHdrp*ma|m`X5n;BNMHjDZEG>n@jqLw6Am#JZ7;8^2~J<dFOE%#;s2_
z)JdaAN5=eaqNP^cH4mlk6#@Kequ%{H$k(**^s8qzI%_k7?ePPfV#`t)@y}O0E50ay
z0W~t#i<&~*O^Fc6gAGTTkI0gc+>(rbo~_xSmlBpmtHr#-!x1`a9Vl3I3{f&&aN}I9
zQ=Qbooih<-36niCCc6GRSeRZ%8#1<xAb0@JG=awdp)p^&wy{n<0Fv#uFBBR<7@Y(j
zORohtUrAEwt{`tI*7Dy8eWIgwZ<Jj=uIUxlnr(?=Z=PJzpeV2uUJp%5V2!N2o7*(%
zKO_<jb6{5h(d>zh=_i)B9=~YtJn%d`R$hZp2UMW=*IIwneV^nMf~2M9X)i5Bt}(IT
zkZ#t`LdZYq#SHJ7%mz81-_xGTAzLN1a>^niG~hV_=gGEGfmB7p5(?!`ND9NCeW<eY
z`>=(Yd*r8W_M0epT)7dI6ULdIEO~1px>+K7e+MV2>eXzfuzYYpi}D}cTu{1tOK*C}
z+Bu>oc@Eo(y=ZrpS(6h@k{yxa(v9w>+(2?Madmc3H5&hR>@o?5Kqbh68XeFFy#a89
zFJEfA6UY5mEtiZ98${)8s{C>0CEKb|#)TJq;5$eHrr)Eb<NX0qP)fI>+_o8#GIl%u
zmMK=TuN&Gu{P)vA9EaJ9bf0-$HZkJvY42+81@F0stJ@@*JECOli+U5Ep^M62p0O5n
zMOOA$#zHaVM&}z9RzCQRIa%(_>3oG;!)#!y>dKk_r^L>GeugP*{6sfwx~CT(fGZbp
z!DPbcmQeVTvn0~CmT5lcNR?<@Qr)m^7P)61AX_G=!Rz+Rz{MDj4(db*C|c^=k-7`n
z)LW$&UaZ`Y_i^HUUgBa(^DS1MPl*pyha}iLKa^O0YLg4gdRQbrhzWN)bW3?zma=le
zdA}&o!5+a2QvmoYI*a&M>Ix5s<)ssse(v3JXm3hsn<vwqsb65SS~&1F%Vb_M+4VPW
z6MBo{F4TR{Sm<B_!$|b$J~q5s|17gBh!jdxn4XQ)<@MyLsSy$q!o3<E+7X83^slnA
zj<Rf*6H|<Pc%Now-U%6bRNH;k(d&%-cbdm9fPPY@jgCq8tGJX&o?mP@{Of_jtQM1+
zv}I>DNih6NjoU6_t3OUd-)O@|p44&!v1n>m1$DAM=OMqQ5J39%zB(t_)vjondCd>I
zeRQqQ4<sxj`To2tn1gh$M_9GH>wdwXlCk3ed3vgrfAWKm3>rh{@?+ebB$g*sB&EO?
z#QL2dW+PLy(U7F0L4p@a!Owg(tXjSi!%r26hb65cf5#8w-&(Vny_PI2zb<?yiADZ8
zDeEA=7ELc37R0@NUe)e8&Ml*YqreJ`0(t=&h2!n?WG@?$uo}K4Gw^!FxG+p<r!lq<
zJB~C&coX>v_UWMCwW+>DAF>qK=|x0E3elPhM2F8*#CO!S{9HYMc1T?daO4eRXwOxG
zgF|jU9s3JlRGZi&T1RZhewBCRJrrt?Fo2u8pl~gz*d@QkFTG0=?j#yEYLJZJuk*;p
z$GtC+zEbQAbLBv1b5YRbk*nO0TSHEV=SnHu+|-X?v0ZZ=+s4`!&<^emK1^$n?wyZ2
z)4u2%hq*N5fLE(7s5nHmww_8-ID=4_dTb-X0d9Vc+Khg8$ZS`Zo#E7D*X&N2hE>Hi
zMuS_6u~ftS)-u;9EA7a04XK4?;Zpk%bVY{dU&VgVk%!%e3TV|rV?)Py%2PjBteO51
zl$_kRiMt~hdc~b<0j;-w1)`3@70KiuwmMt$oMhZX?c!_Ty68pU;nrd-HZ$^*v%?rS
z+Gz0^*wip~3@<gzG&A@Xx^K%o+SgC*J&EE%!>OpQfF37)-71~Nr;kI^)x7IiB{C^3
ze3zo+S;oCG&ce|X<i_=nF7AKuHP=_<;pIS|d}pXIj`sJ8N)&K~-#hw-6a>Hq@I&cX
zSqfjUgH}ulxj{x1D*kr5?7?2wf*lNfK2*D2Hs+4yZZ}mVq!7{v9*Mp%7~^;PmWKe5
zxw?z1&*-00E`8q^Mc}ipUJWK1ITKLKFYpAd#$GhgviNEK0?>l<%Znp7Y7MitG>pwM
z$%bVw9(IN$HYuDi$+sc|_ok8qF>OLzlvZ@9hu5mmn~bpDVEufEr8h2bfRU4ZNkwj3
z*n3qr71R#g)y&&0t|ZFek6l!_&NyuYS@(an88vGP%a(DYe>m{|1;mN|qp=^`5Tcdk
z{xEdgzHBm!Mc$4~?t0$+fu91WCXnqm@1=B0^yHRrmkNy*U2l9NmdTf&?gjY;d};RH
zWru;d!KPDo>HYLcp-R?9)6o32wYN2{sNZ`sdn|vxO{NMh@RC@!8iArFc<Y-jt$@i6
zI?z4$ff2xzU>=t?uG{Tr^2r){D4auI%1L^<^InN3Yc-n5_=mcf;WE=c3e&TyEchN~
z{;2OJS)n@cNJ8(>=D#jDV2@*GdGuY6zBT&RNvbW>ZD-VZ2DNe0<Bu>BGE0>&?{Y%C
zz7`R)>EFQI5Z?xChh)yrgRUR7S?oRRBG6=R74JGNN9pXEJSE=5U+E-nwB@hHf`4Mx
z5xJV=R!OhT;N=Ns>j*(pCxPNB0xWko4=6xEnA1U{_$%O6EG{i;=+F4u2?Fb@H-wRy
zR4fBK#uso9pLGcVrjxSByhB-*c~`!$-*Wga`~Jt45)m-pDBeyK3rEm)yAhG8%?xOf
zuhEpA7s->xmQtrd+rW%JHWYU3ZM-C_7|`*+)_*mD+9TZC$nrO9mN{M`xnJaZF;O~S
zq56mb35G3YEQc-g-C4t$oXMV7vH4*p>k1o+HNVfk<Mg@+m&JWf+pcb-g+zG)KFS(-
zV%0zQhf5#s6)fb>!n^}dN|Mh7oCE;HI7REnr!>X9C}LLraBj0AAr&qzH9Ey3yR*uk
z7u!f6mesx|l>5H`-|;THZjC&>BApD<i_f0$W&YD1=>r#=(+<_9I=G*!HjV%&9u5uH
zV|Dy31Uz(GY^W?_=*Q3rd4B;?HPV014o6+#%A<tvM9WT2Er`<!EID%LrAJ-jTJOso
zX@1&Zh=u+5S5O(7$L4vz*=02~CO_Qi6|?xH(b{{|MqN;byy(=U==$>^=6Cf4Kf%4x
zpLbG`!?B?#H}LEukRAtQt+MFvCAO0ayfUrlnr?DipJ6BEz`3+PJ!gf-UQ$DDWrs7Q
zT~$UJxnWzr<Q>vSsnSxmU*+GgH57IBc6BHi@J%#Mc;lFv62w`L{eB^ffLj7sZM(^H
z?3TAsKJtEDyobxO3P!`wz7EVdZ1H2?nl@E+&|6L3$7?_2Ye?)3dI1}ho-NLVxi}#*
z3pGj*Y7xa><@VhX5T6=JwB#XMv_)o8hMNGda_X>H5Jx9-tritW!Jh;N&y!v8A**pW
zjJm64UD3Ns+U=V31h3o9(tUeEC+7@Y4WQO6dW2{W=*B#zI^CO5rL4zw6gl$2#F=XL
zc#H;^=xJ}-7BePHT=B>G^qHm#$U}3aKI({BKzz54tqjaUaLGqOOT3KNRYy#>=CbM%
zO>;h@mCIm1AD=bEul&@YENkgOHwk26nXJ7;KqaD(l7rguLFD`9$&<IMqt9RrwL^p}
z?9AA3*4l7xa>in521IYNG|SU(QVU=~vQ(eXPdOy!fB&aO$DQ?wRf}_HJmu1K%=Dq2
z9INfS3KA1~>y>=+SxOZ|Dbj>*lc@4jQ2Hn2{Xfy`s6Ecd=pjc<!d~oI!aVQU?(pD=
z;VEip;bE)|fG1W|?`g+;muEXg*BIX=+dfMYj=Na@9!u^yqg;=~^mQz7de^8~+tA%6
zus3c>lSzQp!ETi^8YJMVs*EsOTZ7;f0TYn+{j@3+*jzJqI9wWoo1C(w5$)}pqb#!)
zguoU-rqUw0Zc9zC7Is{?$G~_@w*d}BfN3de=ca+5!Pri)7RHco0*9!4_*Aq{a6G2C
z3rGm=?YUM{gzxnRIk?~-zB#me<tuZ)*tJ-rI2ub)k-;#n?+YD+YO!9|8*->AHYfhZ
z?&{J}aDSY?)VSCArJG|&2$5nS^f%!hb}C!*I4Y+TISk}um!tdAe`4ZSxD1>edlPCS
zQQaF2_iEy#Rr!#2QLr~8zUJfgtxC9bo1#78^P{s@$#~Azv<FjvmUuAXYgKQ)ZX=ua
zHOa|&ro35MKd0XeRmby5RdtSty=qQakRFCzMq4sb4^zikA0{HS{gOv!W=%0KG-mGD
z&6desg|1%9!M^5+vq3{X!=G%$`STjd_RJl=;el3{KhiuOk0o`I4M#Lbz3r9&#lXzE
zSY)(|4@Pvpr+Hl8pB?sbOp>wNPn?&87I!8L*K3Bu41WO%-YPF(EnHWfF-(12AbGs{
zb4B5rY6f)haA)AQe59=n$y(alru^k@N_Ufs6rn;MxB4ss|G}}m64OiAnHI+=<VS3U
ze(2EZQCmSprH80|BS@wGnEa>WI>b#a-9`n7V!6bqAf2hE)f#v(!QPu|wKeLx!^~o~
z<6R0Lr#vh^yBB?J)al%}9h#)8o82<>*`N}IZJUa4vaUFUxtuupt<m|T&`C1cHLFNw
z4phC^GkTUBH|5G0Z|kP3g@xtrSQOjn<?S{J6YEy(Hu|yHYhkgm5|%pd7bYaTA=Hc1
z>m=NKkV;_0lNjhM*oEWAUMBXZgXoGvl?YYh_t5Cu7c=s|fUnhHq-3-qHyngRKbw9c
zAuEC!qM`Uhh~aQ>ZjKM(0adZp3}x@1@obe(Ufv&026>{<vAur*E}5kMVE(F_tc_Ac
z7gkS%t9)JUtWZE-I3V=*(z&GJ)1;Xvo}<93rBqlQns@tl3(dSG@+dOX^>evsDWy0}
z2m&yJTTxBP*1M+M{9n;X939~C%L2-S(K+z7>h<G3;rhNgQ$r@IcVX+-$E4(r&Cy?g
z_=*bj<HxbCC4!l3*2SNz_0glp*;H1pL;|waj7Btly)3mCoqK+>_#HJt?Vur9Pq$a~
z!!`8kNS+8ad*zHk-hc(OQhW5_Z=Gy>zq%Svz5WYjZxs|*7ijA?9)d$~cPBVBP6!^{
zX}ocFcXthL3GVI|oW_H@H0~Z8{===hbzb*A@9S+<&AHZ)Z<yRT#i)xKlS|#$dU>hk
zXrHP?(PS?2|4b7^P*ISnAK=zhp>f&l+1rB(jc&nzK0Pd6zG@Mcg_a+9vGFpV?tT61
z?fT;(23#OCxFa9ZpZ~c~i*%tU+pJ~Fa(A2SX(zcY<3#v({00F}cl$u6-@yol(8DDE
z1Mh?1uRNVhvDQ!%p}pJ>V1iZ_uJLV)RYPZe5(NF|0mZP6HFAUu8ZnqNz2M~}dKJfW
zu+8emlm`#zM&>rkETjBTJvcG6{G2~$d{+~qx3DVadLKY&z}LIt0Z~gRc1e~=lG300
z;#QrT6kU8-m0_-^7eSkEXsNqQ4Mg+4Rpa~i7dbQVllWG70h)?KvDG078XY212S@&9
zotaOZ;&v5>;8pN9hEagMf-B<6e}E93UdnCDAl5;TQ6Ntt9lqj7xCu4$)j_HeYt$rL
z^PAc)R5PapIp=_Pnf!N^r$u<W9XM#8;W54SLe@R+3@!{bLk0tBs(ckX9TimY2K}e0
ztW)bYea?8w>{-;%&Zd5iPJ%N|yu?0JU_-*tw-k6)ClZhgG#@H<6TD`uS}t_)oIsus
z^rvggC$uxYPS+MPO!M+nv-Nbv>RDnH8G~dzkN_c5pG3l|;@W7X-qR2ZzA#XDrAXS(
zi7jgb03@~c%)C}V;(`0^u6IsX|DM#T+H_0|_#eep!qtw|f`#&^A<iX6W#>Vi@^*th
zOlC2SZ@qVlBR)=_;iLJr;GV*q7cwi?^`;=^{xrwer6<{u@P8ZpgwfbGausRMt33=J
zXi|-<el|A#aWjrrA5@{n;uuXK7zOs;-Bf&HlB?@Of>*;k?3GR`Az4gDCSuCkVS`z)
zwyZ;LmKpb{f1L6I`tw)1ZK#ioSm2}#rDrxaz`aG67bQr~y)_u24a9zLTeqkkoUdhN
zJ$LQ11@&~a`QPXefc=fYe=(-I*w)Hy|9OVn*&9%69J~8UF|fD+-_jHlP%*dk*QLLD
zp*28>38uW?5gXGyoE%5~1C$$0=TqikJuXsjby%a=5hr#=vHR`DYm|TKyBFk3^_D5i
zI0@m7z^sFP{gbo!BNg3NJPvOnWv5_O?L_!aB`#HPAW#uNffF=MINcvVb=1+5z3NHO
z$ITG0vcF9$Ly?=Eh7NpQ42!#4b%V48)j4XkOsU`EF0Wc&TNA0<5y1TP430(U-4p#R
zVK>c95xCaezXWxinu-VVJp}J|ihBh(mGR4j)=4r9uup9}Pp5iQw2IlYZa}@X=qN`)
z`S;8oa&^WOdHdg6(u3LpMUJPo!q{EWnD`Q#*Ixm9q~V(ee~2`*D#H2KzC^gYPY67R
zOprqjS$MuW`5=BAHh!P<Hq+gNv!}VU#~GoJwa?71{{hg_AQOU+5|LBppg(io18Ia5
z_JsIk(!VS8@BpT<&eX-0>bB-06eoP35qb>MDv<c37fu3{e=$_fG?w{~0anOe)h@~6
z9CCp<YH1|<0U8f(pK2vP4O}DRkZ84aixhmy@*qbI!1Dq8A3){wwu13KGw3Z&&s{(d
z!(Zg{sO4bwIfdT{Mk~UG6~6E)?H$|n7DFO)D;^wx(D&*S(!Rb%>QZyBVJIwd==LpD
zk6M93>GJVq<%{9!7pSCNI7Y_lSVuLVhHOF1%7wVjQtX4XZI!waiNm<ve}Iy@FtOs)
zN#h}cxvw3wXA@Nj{ZsnYUuv=i^|XgC#Qg>wAR&uc)oE?O-vi#tF~lE^TlxR9?Z%W{
znNf9K)RtLKgqkk^ZGNAzj?lq-b`9ol!0=oFunDzn31jT5D=9;yy|f|YclvLR`Pbz7
z_ksv>P!rRXL8w<g?VHn8Dcw2Rz;MNb=8RnggQClU=w`c5ry#3@Iv>~8LqpnxB~Ikw
zbl$;FH(M^UsYmho<>SBRRc8i$(Mv)&9SZBZ_!iW&cJsn}gQITjKoW~Qp(_A6({vkA
z^8^(8;nNx_8^`U(oBRHCKN?$~T0Gq@0c%Q1BwyF;qOeKvSq~Fqb06fQ_O~TrhkX}d
zDg(?#)G>3*7_G=vSuw;Q6~5KmvTRxeiDP!$XD;W&vs}FcH13tV=kM<)R;Ior?E$lH
zb-Q{xJWB)XV&D44L-Tw^44O7#%fU9nYo-v0D!Tw#Q#Gy&Wnr4*IvX!ZZEh8x)7FBa
z+K*#;Q`2>GuN6Tj-=v{(gOJE=gB{TlrDGj$OQgou*fG=!aeCrILLSZ1A-iA8Ivm1h
zhdtT;rGwJPT1R=pf+`8Gf$whls7hvEngItWVpmk}rX{963KCR%N(E`DmCaR%)b=T$
zd{11YQ;jWsooQFU`1RgE)cqEkC-hWXCMDCpzW(uPGPiVt_-MpY<>xf)HU8kQNe2zq
zrYuo)ZE%ScYwX$4Qo$O@bWA7C1g<=#r8d}WKi-ZoP(!avc(?L4HDZV$o0ne=H2$Cs
zr*qrj4*d@MX(UUyb$EDNe(pZk!A>9BMtY9VdhlD!3|%<8w`Ipo-mo}U>(48vKfc+n
z<r05_XvBE#_i^Tms1i=c8wjylb&(jhPPM(Jm^2>0qoUA5RZGfPVFPuc&-Yl$OMC5V
z@c8iBeC3v)A`<Lk?ox;S%5OfEs+Dc}kAk^-xuxyJSm{lM6Xji1RnB3xtIj*)@9;z6
zKRW{Rrzd8`711UE3LCS0aBXF?gQHMiBadNlK5eL<jiKVuaJq1<`gK`VW2=CTLI>Vb
zP|q<u)}iWJ;%<@4$i&pumEKB&aSr#<S#(WH(=lDAEVAt=G1BN-i73-(yYB{<2O`6o
zE093Mbu*VGENkNvObAv|i&M0OHLz2{?EaiE_Ss26rFp(NHwj46GuEw$MS8pKX^74&
z0<tW2wSqB<U@CePza7c__V1vrz2);+RWcUc8-B(kX~a}Ui97Se-4E>6eTZRN#8Jg6
z+Sv(-wwr-t!r4*|%D!r?*t+Sq*W$vWb5sO?10HUCvFl<av--6CJY6YDu<jl*1oyQI
z<C}<EgpBRU{bKV7j6II+e*mF54fT?opy&sDIks$Ah#@DoqK8Y+O{ra#0rZi28K#p=
zPS_fuKQ_nDNn`UQSwF#~9?j1F&xHF!!bQO6Fz`D8qUw-GXKLVq`Y#7t`O=Txw*Tj~
zYFRrJZ7b^TcH{dLGBN+)g51Th;z_rWO#?l8lplvk+d^SlxCP5n)EdxTm{EI&yrO@V
zJSZr#=TM!#EM=~6@Bo1@J1{@q2EEa2bcH(toOCFX(*|g=Iwg+ljb*hQzm2}1g-AQL
z+^Z7q#UduFHC*RT{Rb#b)!<3C<dFB{j$xgz@f2HcpISR4KuQF-R_g<)=WKsWdHUQ#
z$xPjNrZ@EDD^H}3Mur@SO=tz-4g%zKX2vy?8E)JGFph-#WzZyuX$^)cN9HX-6RF3W
z3JunA2V-{^WzEH_j^I^o#`}K&fkV8-OYKBlL}nv*bCNedo6<kBJT?niH~fQ6WynOy
zS|V;7cmO!S=Q}~pG!-l^6uskK)WFvzjZ_^jl->kEhaJtDI0wA+m0p&!nUbW=29SHk
zb6&{J5Eok<{71q&E(TN^|4q>;B**_-We1J~S-J%bGyN?|t$45kYuPlD^&E}8hEEe(
zeAoRe^F$x5#Hqom1*nOQC>P<(e|@p5I;!cM3k3>ydy&4xU8#LwWk(*u8iM1x1|&<J
zhJ-m+vD=g_D9f;30Fi#+oXYE3ZLXg96taldK^1rRr@GN6EB^yr?^tbQwDB#mZfNT3
zksoyO4@-^bwFu!ec;iI>&aM8ZlL*k197VdVw$mKcv34M_)c6uy;WB<GV@UT^0=%i{
zS`{u3onh9zdL`xC_@Kou!eDB4Yo)GYFk=v8R^3U<xi%;|t}BKBK>wC9YmRIZZ7iji
zk54_7#cA)zd;Fb?5ZTHKZ_`y6i^cdC=C;G}!VlCObl3gn>V8pAy9Ok-tE)iYheH|U
z;@Io{S8NQou5ww;i~Xp)drdMK{s3>)&Rx=HWp+#{(`-*O@XqIspJJP@H575Z{_q={
z`Ih!%KId}m6VBt<hu7TQv6}K;+y%C)gTH&7`SahHf=bt1IIdf>lSi&A@K%a*Kw&#9
zo{rK28b5iQdJjg~VHfcTF-TptI!cgaP^f!6_~uK`mQS>1t(Sa2VqDmH(jTIDK()(r
zf~CD(vsA9JY-zg+2^Q}Q2Z7L2{%UjcOFit`(V`J#FR;)5g)E;-$D1zQ#cvH#^2eXU
z-dECn$EYV4=6NZ{l+|sodDlkYxGU(-;9FW}p0xYhj^wL{X8;qYyY_Kwi+3`?1@+f=
zIzk{#7iA=w&CVLMTXWTJ{gOKo#8r_;MMVfDZ?-*gK2&dq+rTD)nKKfV3us*0nf2mV
zS=l0_u&n@ogy}l*_<21mp7M>nK9FYOe>AdQITr|A?cTJgNrseA149mM0wn3S<mYLp
zSAtTX9iG*)hDw`kl4u~g>&4R8Wh4@U`Eh1jKeF^6u7)UWH;v5TEk4OiLp3xNnXTZR
zUZ)7EAtbNr$2;7&_?=>Q2Tk0$KUSn#Zfn2LAh-!LW@{1^H~m_bY3YN+MWL&anL58e
zR0v94`Nin2IZFTelB4&$ORg&|yRbi}zd(*P9xvoVR(PuZ%Hr0vg|E0K+kZddaQZZ<
zvnG&d->>HGhcUzcw%--L2o;<^ZaG{`&zff51SKE82}@ss?pu?Ka!?pAKaKGV%7}XR
zdKH5*(U1ACSc%<4!plo)T}&Ho2fD~p*Y7U!Ya|t|l@AU#$qFx0Dkeu`IY%JD!c1DN
ztWLag9;T@5!^k2{WvYV+g!D!T-qIYYSk1GI!rq=$iHF~I2rl<kudB9MGAX@K7fUkB
z6-xA2>UQBwifknf%Z@dlrE+mL*0BN@;lCk5g#Bz-Vca#uwCj7}d>1fZY30cSVUg>{
z4X2n!QLlk*QAp0u_ff0FaQ&y8AGdP<2SbA_v!-50AC3`0+Z1bFYsj^eIF1wQ&<tp~
zpCM@&bJX+3;4oC5b>s2zh~EvS4GF`RvPDMZ1pccPm?0G^$xT4FoI63Dqpd+HHcFbT
z-)ugrg@K3tL~%paUGfv_f5|lb|I_2zxka<Z^HrpU9cf(HX;?MvgDz9+*JC}_F;?fQ
z5~x~Q9+B)atWZ&Oi9<uf&i44JMfoU<AVj4-<^%5sYZfXlG@il)el5w90l$`I=ViNQ
zvn8qiE03$4tf1lbG$8>!NB!ohO5#Dx9YGP6L*pHAO46}f45+EOJz0TwQUd}^!o)~h
z({vuFQu17S@H>@c3XNg%^m@9fc+4Z*pj{59>_)fIOaZr82BzKv*HNs}q3@%gqi>0)
z5ZCP)*N9JFvdb^Os?(F?Aq)%gS9HpeOgj*FR{hA4bc#)2x9OGHv(8oZ$=p?ZR^(QL
zLN;uy<;0eE1Nm?eTLnOhl{_iQ4`T{BssfvZJHZ;eJIf5Z&himdv^$j8innm(Z<QD-
z1~+q|<d{IXYC)1|W+oQf8@>&dWTpP3lESd~H2T&~N6EXbv#bxnhbO^mnmw~S^`ds-
zcRlu5A#v+DNcVG-@`g}hFp#>x(Joo2;#_2SacY#VJtq2v<|=Kh?1=YNa^liao?Y3~
z^IO>v-QyN3S2@EjZT7k=FLXp<?7qD!LrM9HbRfduvz4EVP4SSGwOZ&fN@DNrVb+wq
zoBo>1qxvi*JPOg>f$t=bne{_sq)HNqa6ISp^2%M@$`$aolPi;1q{2mm!WK-K_&Jf|
zs;ntG=Rrh6@W`H}gng1w>PU%7Xo!B|pqZH3;O_x(a55_^uVcNwaMiu{AS~Tb^J*+J
zUGJ;YRD*pr*_aDjKdybmZ!)7<tVZVGqVOY0Yxx>!p7y3ri_33NCFDZ`(-yz@mtl_K
z-O>xBntu(bZs(UdU&+2R#WkWhSZ=?t>_*23ZXOt8MrG12UtK<`c?-Unr@L5gUXjQ#
zv*LYcW{~P{6|zg3%}kRppf60PnoH*>d)HtwD(0A)=p%g73Zf0RO0#_|q7^^t`t#%U
zWCkmVzrSAD5Bm4jMoA}9k+mj*{s(!SyaKE|O11;#AX5hOm2Jxy$WgEcsk&!ug|S{U
z4bJ8OhfmX4&vG#t<I9-vW|6n5fR5=r)ijlpX4kX}n7T2E=10xvGbz#4r21~Lac5{M
zH8{61$7L8e`;)Stse;~`0~1N<tfsu)mj_P5=H06tQe>cqfsXeLDL?;Iig`d_eSKPh
zxj@hqNsml}>5iB+tjQ??g_xyd$>8@M@j=&+%`|S6t|{+LJ@$1%6LH{Vynjw5U2Onf
z68}jk4{hs@q`^_JJ2AiE?Qu6pBfIbgIP3zq0zON4!YJHwnhZ%!%EqT`Eo`37%R50r
zm&h1>c4%goN5AFQbw6b;JfsJkc+OfebK%R&H_t+Qc12cO7ig!yRn&LY+2IEg-tqVx
zO^ZejphabMH53$T)o_F^_p~sV5t|vNqkIP*D_NW!BH`?Kq}@<(kb9i))N@RSGyXld
z&H`C|^?=>Rn&BzaA7OpM{#K&Bi^w$>z;P_Iwo<(?TfzrUv%Miz@bP!56#WknW!+dN
zZvo$r;zX0o26w$(Tf*_Yh&PEIVdnm~sr}%7t7lU}qgcy|*@rKi`@^qga+6J0UGNEo
zG&LEJzy*Q`M&@q6Ffma`0+?a}0vfzCF`nOiCX{emv&qb>cX?_XE!SiL#!szzR-ZdU
zgu>QZ8BMwk5FAZuC`4FL&lfAc1|>VGcNMpglphiYBg(q(*=uIbgXaY$NYc*UR)59X
zY5@gfearpiJcz1S%lnhtA7giKc|MAbLuCUj4J=OO<6JF(wesSc8gTOafqD`lkrE1A
zq7;Hxv^AZY-KXF7p4tk}$t`qcuJg5CV|y54Ed@&UGmD(PoHB??VhRj%>+b${l~;V2
z%Y}PHnrm9}Ag^64!q}L=-*qD9r2&{da|M6IcTu7MTS(O!D;=LR84nzeWG>Y*racgZ
zOk_YT7XOHZ5i2%SS3z~H{&enoi5@#-Chae&%k0O^t~Rbx5mt_T7a7C5bEU_!TPwv2
zoq8anJ+q(wZo-+`R<cFebP<>sB1lK=I*N3#p8qJYMJnO>a^)&3&rQPx!}zcslAO&(
zk*;dL9~xWnc8sC5H!ROi*+vu+xmN_)sbZbgoQ0-@1BZ0^D9}caHT#&&B85B1fDH14
z;Bh%78V5zXe8=&@6Dp;XpI7fBCzVm$<KL-l`fpsZ;u>!c<&>H&q5OK+{&1pZuC8hj
zHsW-l<U7_qP2s%*&Rcj&j@dM?mF|tOuU~H_IW$nLsazF-WS`4SIfR6)@!Y!j4&G`D
zIf>(ze=4$(_bzUk?Wt4|TBN(ht>i+8^B*dk?)?O1^Obif_l4&re&6z+zW>XqCzW~$
zqL#E$lz}sz&!1SNE{s;;<_P?|2pxht3*kljEQ6DV_lNKAnfShU?@h)YNQuUY{@P&6
zFMF6Rhcak6aK-!otZI2kTTD`*BDY{s<s8T$Gf0(bBlq%8EhNF3lwurhYawYjP4!KP
zFKlk{=&`Au|GV+sG){vyG(r)p9(Txab==Q!PQiJaa*gGeznGTs%2U2_RHFS~bc;*I
z<LjCL&5K|27UB4)>W_ghrDJt1f(XKDM+f*W{%Yd^c|A5#-NV`-Aq(oV*Bgc63H&j;
z&x!o7`yGkEB~d5)`#ElV^bv5pTk~%n2|uCwu3<tA{$2lU(!RTOjpyp}y!9X|$P8&e
zuljr@jgLTE@7%gut=~w3#8UyulE$2Ss7FMZjFp<tcd5yoqG-?U0P6j>=S79lJmzvd
zlVPz<su7yklLa;6%Hbg$Me!T%gIb>EjVeAsSjQd&(dL_s4^cL>lLoTyLtei%&0R@z
zPT9f?>?yp!mUT@IOo_cio7b#Ktvt@s%;%mhXkJb^%S@-=5vt6q<xojCNBVxGeM4lI
zj<J2EZ)TQ9b`bon<zoM`mZl?hWm6&%^y{YlIK~6_S;-8(k=r7&fYKpvzT5KHd;VES
zOMlRK)eI%sDK?-RBqSV17>~Evzc~A<PMy+}BYdz@+RS`f+;jQwaRxT=?^<Q06R$gj
za2fTsnwV{YR32mx&xj3T?_2LYkHyG!HbGkCVHk|Zwpyn!9|hz_FdgH|Bs47DPo96%
zp?9#D{?wZoD0W9*>=kwItNcw+ZHt-$b~(QIMrfP#uM6{uUv8W99Chea!;cWQwm!Z0
zfKw3eHN*|Hfo+pu*@2(_1IbgF>==13^R$h=luhGKWN7n5H^Lm+zJOUZb>5d}##Ik|
zdac(~na7WXx5PJ3K<-`=m;9nO_CJTX{_hiV*6!6lCF>xn;Yq5iAUe+gw9{>(v`n93
zn<eGV{+X+KN#`Qw%SqV-j*#2hzpXgc&7BjkKP`6mn8W@9MDl57rJJ6cDHm@#eo0D8
z09>QKiapN%vQdyn|A!oPrr+m#s<qV2$Zsxd%6koSFOj?y#hCfMI_FP}zt56N`SE>z
zKWnWW=Jx{JxRmDzj(lCY{>?Ejc-UE;3mKM^>E6mG@Tnx40xgSTnc2AymhFgvTt`M}
z?hZXD?g7^z^X#kr!FefL#82%N->H#mLBzrW-F8<Th|EZA$g>)e-KjY3-{?=(lwoZ&
zo+}_05z{<3-S2hsEFYbV%xUs3feeH~AMjgd&Pr<mi!R^=ngB|I0a-c3GStp43z;Z2
z-R(EXIz^H-n5W4uaRniU<h;LY+EC7X^Y5|owsscp=(qrM**pJh_=4yT?COyWE!T!K
zg5UhK*aw-!w{oqsyreyT-bul8S1{jWHe=-<r-;m&h6~~B%TpeOLyufXSr)-Ay3#Ae
zk$&=fRvfE0ePgasn(3w7HLgSsMjYO=+xZD0Rn(qJi;F>Db0Wcu7&Id8#=v)Oj65*J
zA4P?`{lXS)p_8WAYp`@EdgQW52M&>`_ipXWQ1!-QitD#)YQ_P|>g>ofx3;iZ%IHI+
zNX8MuM@^xZZ*m^(&2d9GO^$@1Amqnm5VLqGujf3uW1&Trv=>tSiAq&W0!kkEzN%aC
zlbr(|zY;d*hXC<!h-TX{aXo&%gKGG5iKC*TcCz)DU)HmA;v>0b^T2fSUb9^m_6o@3
zT4{L`MgFL`ms0Vm8qIqKoNHe|ZpJ>f=@z0dl_phK*ql?!R>+`Ktkz6oMIYZ}b<^f7
z>d=r%fHQdFQd3wlHDk_h&9LRv#R^(tPcZHXAs@59_D2fXtOqw|uk5u+lCbAs<=!e<
zEt#CEB2xn|f14VOq%%#dc@k@nMaEsN;kIHr9GYHC4O(sB4AuI$ijJxJEZH#(7Q0|g
z?KCyj6M+UC+s7eb-zU;a*b~HPFG^?U>X6fJd+i|>UG5y4xWO{7JuUZKU}=$0ChZz^
z&<WaumlwjA?DxhdV0#njb^((z{(fhrot?rzHJ#|wTp+4rvM7<Y{Joty<0s`Bu4XMq
z@cqgnpC*aURnAVvN-DuAd}u(~#B(e4S!GoW8qnyi=1z3OGqABD-gKv_83km?x|_V-
z8SFSc_^GO6X0Av_<!tXk&(jah+73t?$oV^>V{Vf~d}}+U2uwSK6K)|f{UodA9uiNS
zk+2z`^3i$HjB8<X(gbZ3SEeWFmBSk&%GR7~`YOP^2wlM7oqXQMI;#N1u!_qwaO(bI
zJ543rHYtTBb<6Q!QAk2m#(n20ML%Fc*Vr&4Ecs0Kv$OI`me4-OE^T_k5^5hp%slbX
zWxbq)=<;)yJg~XR!PqY;DQ9W@Q_YKaSr#LvGODk=U}_3<i2#A|G)9WV5hhOl0|Jw*
z*z038yA&KGIH(TDljrXU|1?TO(kt>thD_2-E>xu~$GY}Ez>cnZPR@ddM}wY0Qwe4s
zplx^hSiWhl#ZwI6rPfKsH}D;@he!3k|5fjPRQZs5Jpj3bt<fAxN5Urc?XXy_RDyM}
z7~WpifF<`C?L@aqb<4oOu-sq=5zF5Dmj9KBM^HvW9fB4}wU@7?v1}zMqfaq!<)B`<
z0qdPrwa&2zC};f{v1vvgr`N)f;1%PKTWawoO>UA%@}2QZ%2@dqFLw(gKyQ%)zxkg$
zNs8Yt!QD3EMp0f=uMfqsmdGU3`Epv@2}8c(9_P(n4sHR1=mQNcFB?n%IM}8;pW<lu
z)|4kTTbIAH;kZH#Ou}<;sdht(6+hL#9p(PHV(8<D7Q1feDyLrQ6HZR97>VXYA9*Xc
zAs%TmLT1T{4-oKB?g{o|<6r<gm%@cw9QZL~*7Kx@%dPzKu_kiDu`u)^9yusKDc>N8
z;~)tKk2q;re}!+2y+7?Q%`d+#b~30tHPCEQ`IJG8c)ydBw12@SxFk`qzM`X@$tGiA
zF2p1?Fh7S@wV6|sZ}kN$Pt_DPA%1Vx+vq<4Y(CD@Tt?CU3RQvXQxR?H{Sgjo%~=L9
zF@V}zPn>olM>nmIs?-2s?RHW-ZIy+d>gsSp3g$W4`Uea=R#s&Y#)e_B(;DT3-?0IK
z=nnENu%@LA*pk_npeoF*89w72FgUSwx2>UtQS5=SL7bjwUzzl$q`z98u!JyvQ<Ka(
zG}?M`_<77p$O^U%9!?My<M$-J)|bEEcb+Q~xi4a#E4O`}g<#P2T$t(Ax{@8tn`~TQ
z*Gi6*)W$`+jyI>IqwFsnG2D;=So8k@>Wjj<IITH-?0=)$Ui=6(&3XEoKVt3Vu-nxR
zLZgxWLa6Q);<Fa}dYz|{O$(y_FugJGy{7S<pf0&@DRx2A73YR2pu~gxbF}B-avOo`
zh`_{O7%1l<$I*Mbk_PQO&8w34ac1)(c-$y&@3?6#OyWRiBu)X%;ogwO0-HaTq6HFG
zqw&AuQM4K!Zcq-ISR;$zKV*6jOK=+q%2G4&X<Kc7phYCrJuk{80JSnF{I;@F&5~FR
zUH+<L4=_TmsPR2XfVFOkcjNvgz^EELaP&#Esm5QhopoOp`y1gWYVXZOHuHw<?xqnJ
z*N_Z|s`sLQ;Yw$m2#ObtFJXF2Q26PQpN*Pg!ee+CT|TcMWF+ui-HyI~(oE)(omjB=
zJ(Mb`2I23~sh->Wc%DV#ZWn|F4&WWK*i{pZhUf=s?7j(3*UXeu<roPWKh~Rth(i;N
z;##YT<c1YVHqLoPmAI>}1ei%jc-%)aYEg}DR-@Pd-j$h$>q{upvi$lt;<>5eCi&g<
zI+Nxv(@xZE7e`icO_OC6_oqwyVz-W*0|IrlrHNN-ztp<u3!Q(&M<aDBv3356Z}{Z-
zV`+=cj69_3lf3YrFSsvVLJcArPnzMa)hm<6c<Cm^CZ-63;83{5x}vg5H$kZ<#d9Lg
z@lh*I2Kdqtq)bp2Pf4y9T2CcwR#7Xy<PH<R=eLxQgs<rSZo{Xo9vxFPR6&1>v=jus
zD`9x{qW5^}VZ^z47oQyY<<DX|?i&l{t5f6;E=}D{nz6dcdu_lW{NzhW1RmZT$|`?9
zCZ(xu@Bd_X`#STnN76gY$DHKzwMg%Hak0|Dj>zewKFr^{*K6Vb%bA?RP-ezBZA-c}
z-VB-uD|0hS|F1S|#l7c1WTVe7J&S{1Q)bv_a6eGQG(pen^UF|6xtTi^`#LqDRus%~
z{tvG+_rv-!)mb7R5sB>ZXy+d^ZT3NY|KF$H&;Na*UuShsfi6jq8FPm5CwfGv1!50Z
zg`vj`H(K74J!v-5z(9YOpx0qSK$zdu4wjQ03(dAn81iGRR^KI*e2~sWhEhE!x8v}x
zOgyZ4rY+7MpRT>c6ZuU9c^^f1ZOo2}#4=)?4Ty8~ddyKq`;$*g=GB0jfa3NfK+aM>
z^Za+rDyj)Ll*92bGH9A7-Nv@{0do)rbMVO*-7Y8DPjvQYGGUzBN(4aQYQQf*2)8O(
zWT>WxihI`|`HiI~kBtu1=d=dTH^GGzDRV2=3bed#oi>}|+cLvUlD-vJ|ETW9+>N~)
ze@wG0zJt&}KK_E6;lSpAj6-&?Moe|)^sEu8)`Ra$@;z5R2T{zM0gl;}9P<h>5N)q~
ztxA(!)`yyz#k9&3h!CM`@xzm{&QHp8@-8epD(dR17}CSUqUmE-TlnUNlNBN!&vci!
z`ac~)yX096{~rt@64SRl`VvKDHfD6w{t9p|QqmJ|>N_?jv?2TUrg@_MzX|^l*V+f5
zb5?L&Vh9{@cPl;mHI~tc5;y`N#<Aep#-<m(%;ZHtC)>I-07gO2N+7Onv?*yM$DiZT
zyc?&SAzP85*pZ0XV59<qGf$`>f$(6JJl|2@x`es0!Y*I?hft93%my7DMOaSMM#qWR
zxNy|4TGHTtAow&`=4TEflNgVGeeKHTYA;Re<O&U;_{b-?+FUB?WXh}L_aa3Izx8G}
z{|BmWk*@3h?4rwDYWL}B$kMul#YM~wjcWv*^BQgJIYI8wYLeU_xqtgp+XnK6ShcV!
zitJ-;b&^_SJS~!ulAcDLro1FYN#(?cV(vv2-Ojk8JitweRrbPSx$`o4gIijv#NrYO
z-B^G07)J9dUhDJlrO1pN%K>=L-b&Kuz5skxdgkA(qKg|;{LlDayo;>{pe$t@KCHQn
z6X{y_&af!Kj$Vh==8}xfZP;W^Esxdo?GjaM2258Efz*j!&$C%MXn3_WmZ4EXa)3!=
z+b3|EhZLu6)eVLAo7{W_IFrD?IR1|AB)dJ&=g_$?NO=Wrs>SwVClAZE^mE#y5XfP%
z{eY4nu&9+vsKWh{X*4;m*IiI8HJc?jhZ4ShVggjV=4_Bx_qpLez)wNLsftV(C1i4s
z2!HJ|sbN|a@-S%%pk{7bD(O@LO;S0&->yt=9=LQHfsSSGL|v_uuDEd^6b0ChRhp2{
zVbDQMl1{gMfN_X$vJs&BI>hnibhs)m9EqwN&%oIq_p)Ia*hn<zYkbb?2`O5=nI+ly
zw(>{Z#esAO9gJ~Z6>fV5R5sb!)=ZWl%87jJ0^U+rgEm+x8_Uf~BKvP0ky{n5D%vx-
z23A>QrYj0lfndKg+slw)vCq;953fvl=e}hZ>5G|VrMA}u`M=eN7^9%)^Ym_1Hw62;
z7IEQP^!$@V4herE-|o0|cPtHNo@0NDxR%hivTn%D$nfs;()hX83Zg2drRir~=4QFz
zw~6LxR&Fl-7^}bOG-%P8OdKRL+G*hiL~-9J2L0at+!roBx@Ij-jnavIrYKKh`t}j?
zoo%HrN%mG8?3kjkn6!}Q0_Qiu?(Exsva_S>=m@8a>5P4pH$}Y}nQbs1yLX-h3eR_+
zdL=3bFxg+5cFpQhn|$lS_*iDhCCVUu>jJ|VM*@UpYDuL=nNGB6`1s)B6$q=J)|V;W
zv5dh7ngPf+wcna`B>iB=$MwH6PVK=+)!L@<VO5z$cU+s5GgroQ^+xmq^9AP50lUG&
z#t$jDDf%ij8jd`r9XsNO#VPYM99MEO6T0K%UG&vnIrAK1NK?&h$;xdHNW*E>)gr_;
zJvW3NKNFCrzlNEuuXQ(_<HU^^a>zC`@J$_YyZCuCZz$dmu6W=oXh9ZI@kp(bEA;VF
zS^v~Yk|gzbT-OdRT=v&|YsEbBQq`o!Qvr|vD-o~Q4!Q<TablzI+IBdoC2My7G6uv!
z<$1KOUzSHa98gt)>TD6FYx=90E{ddL&qD$WX=X=@tue-?oK7Iphw55=O8l@M+UV|@
zYVs^v94K3<^M=X`_I@uzhU}aH)@{YPsbwAWwR;^NWGJ3%a0gOPcZl6YbibT3Gy+ai
zrB5{`SDr#VE_uqBfP|c4cdK<L$GnzCwwyd&F72%>i$8G|(s8I|p{c=RyqgPdwBsY|
z)cN~xJ;F-j$NGo~)>i@sP2#M-*Dd-n2Bwn3^~n_@R@uz%+iyc7h(F+@V~zjNG#@m5
zrw;g~#<6qkp4A7|XcUW9&LA=P`O}kQw8gbJ3xWznI36CzE&(n~EfO+buLus|4Iz!k
z_#JH8a9jaewZC|Vxtuuo;phc5FWT<~q_XXnLOIBpa&493iL5m{hIbVW!3A-GtH*R1
zF)?2<9jh<VK8zgA7qynO-5=~@ajr#XpXhNX)Uv+o-#1#eO(%#d{0ETxyQ+SkRNz5O
z&?hX}h^z~gCjpapjDwpxVtmweWhB1BCTf4QR5gXuez9C=ew-s2w_n`DCD>XWy%|w-
zTzke!EgpTqj-vyj<WLZZxrd>Rlv{sLH+th(H#BW%(D9s@wDrJI#Lp(I)61eQc}H{C
zi=dGN?4mCf@yGlh$LVuGu?rKl<y77_+FV>k$ZlOS{_W)CSf56v?XttCF|E$<#Dutn
z3PH-fZ{(});-3Yh_RjECo>;4vq(%?<(G0lQr^}F2z0t6!7nW<@Wm1>f4*O4nqy>CL
z%+^ab!KMD^N*iw{-L+WfaC!Eh8bQ+uVe@5V?3gn)=1OcRDP3J@cY|h7(s{qtFoHFj
zchdz%u2SmOq?+``4z#@Lq78$MaTa@;3*|Br%18qK1FxGJ_k%@wn-x24Cs~qkPJG`)
zr)I0U`EPnhU`V60s&>9H_3dCY-JhOw=GEm`Ss|lPh4g+TCE*^oal=*N;(@~7s>ld3
zeQNvqc@b80Ne&e!ODY-rK|YbG?GeT)x5J|UG;>qKT54I-x?MgwIXP3^d#MXF1ofrl
zSy1!jUOTC^&op@;M!by(dU??eV*EtH*%TRIuFYDTT71CND?=zWGs4K=Sw3og4tqA3
zl2_>e{_A@L2N%xx9N-;y$|g;r)OzXuR<{YB!!srEv*MsPSaiAC%S}-A0ZyK7aicJj
z(=qHade6zodHtq>H_~>dev&X(7`Lf4ZVG-6|45$~TGP}iA3<PcEKMyGrEFCJ^&wpA
zv{PKMZDyou>5OtDfnv>L{1QoBuS8TH6IbQ@B#5OS2c2wFb)-1xE{JBbi7faZH>7^u
z9Da;Vp+u!9_cScfdR1KzeFs{B5nBGi3HsxXS!dZ*?~Vr8l?_Ih4ecgk#of+{7-;;9
zlg#BFFO7@t=--z)_=MPlwn}JWr|CG`Zhmc=?;~_8GoV1tq)Qdx!}+zKMMv9&_I&(D
z^7TfgHTy8JkyEQ$v<a4Iqi`33v6j0Pc_ujb4~#Z5wIq8Y2|EyJtaF1{w)M{}PWUcS
z2t&%CGzwfBS$?<8VzmEC!$RKixPNPpZ<-%4y^$qEKLA+cdVE2^?s$gCpPkFWle4%d
zH4!)XD-RE{^}94K=UTstYY^gDCr+*#+U3D#ORah~83tEv72HP+j$USwg^r)@rSR9`
zi#*l<p5L(l*0)Lvp$vYxLRj-otKO8bF*7gZa&(eSh`6wN$t62f@}%k1-~bYC1OHL)
zMo*@J%T69RzZ3SCDFa5~YL9g^U_WO)>f_XQW$zmociHF0G)Je2T|4+LWqmMloQXUw
zqOnUO&PmEe!yHytPaPq@PI$Y3>(|NB+sw4KY|F5$H5^BAn(J1rx&iJtQ8-<C<(J4$
zE{A%x1!*N9Bq@jDce7RNG)Yp3V@nr~_r^gj4YqDio>^cETJMH*66DPWkyVgB+I;jq
z2_)cO>INqF*d$awq#O~NZQ%bVk52lw>H=1gl_xIDY?*rKzJ#`aZDJzi3Mq7Z{i1@+
z(_f}?tj@*6<>70<=1-ka?0M7pjKOq`sA!{q20o93v%^Mn$@U@E=Q3k#?TEL%s6wvp
z_NFk8-xprdx~{_A*GFaHL8C%Zbz-+=CKK~s<ehUYDG#qY_ND**V%@~hmqkdiRd#|W
z0GTO6X;T|Ssupx`zOiXhtt5jbkWIN6Vs?Q8=?Q(EROB-FzOnuhZ<+0#Kjk$O2Eo_w
zCp9<mq5S;U(7Q8ojo;JGd@0fA$B9URxUYc{g{16HmAklvKTfev1*el)c`vk4{l$Kp
zbw9bHM+g_4OvDP}2COC+|6;rj2c3fRR>wZjGGL4*)ZTByhudRxnkxPgZMg<4v%JJI
zso)ZxiHw3UzpURCcHLD3P5Nl9S1jai-*E58I_cxbw(9_{5(K8qd;gVDH`$ZQqN0lz
z+Yoa>S%a4K+w~QX)+jhpLhnl3lL`|t`wKTIU*;b|w3>GaKtG8S1V+u6hO~|1B6*~y
zSIMzwmtut5v7Xv>G~|~%&L>O1Wobc;#s(ru;!f6{j9rK;%aT<tEd1JYH2qY2kxYKU
zdL=D(3X@x@j-?UfolZFF#TTL~M)hw$f7$p_=1%VUW;4V5H1{CSDhPaO?+tK@K*l9r
zaBXKg<cC9=a4p8^acJW>aIa)5Y0nN6q^gL8Eu?vseXAs}y+!b`2<l#fB^}SuCI3QG
z!U1t1V%p23A_U)@Y8@^4-TyLSg6+U${AwPX(~3jRX_YOOs5gA_3v>PWybw7pO$r@>
zRhGi^+=DwdZI1YuA`XQQs~5Mnf;#szr0)7R)cABPW_|4>{uBZoVyxQG<IN8fp>tG*
zX;Gqnd(z6vE6{35me()Xut$r$)4d)X?r`565lI7XSRgnY^SCuv>Os_EDMz>t)icrA
zMVfKVrBI841(qtyY{RK2dEHN|_+#Mu67{~40ngZ^2|iM!7!tZmSS8g)bP1%-XhTxO
zZ4L$ZK6P9(9j_Hd@pe>4qJQj1NF@H%@(4|5_6-`9C3yTp*YjqLEVMO>*@@Z=11ANG
zFGoiaYt}TQa&+i@AHcp<IXu)!?UvRYD+`UiCiy&37W7xBdE9!GK>OQ}j4Chx@}-uB
zuHD43Z4P!~p*@Ml#kwsBU@=w`th2teLTJRz*Zs=JAO{%`2iJJSFyJTiu;N_t?`^6#
z>YbnqX_fB%IaR<)idIW1n{GU=AYYXm&*iHb(%@F;AJJyOZ42<f0bljLF$yO3>Emg+
z3!1HO`!TE1hAq6T#UH|f2Zo*(45o{I(<#VFeT1?pMBk+vD#AwtGYtM>P&kYz<J4sx
z1CmO1%d{O=S%_mB^Xxr%>}+s;GdX3}WQs#sJ_qF&TNrE{SB#$pd%@XCu+xzLfH_r*
zu~CWT7({DF!2df>+`Z>jHbCwp<n$jv4dFR!`TR%bd|{+>JjVxbrP*|KeaO!3%UN-#
zEpbGelgj)*jh;Wrds1V>iNZ{79K!$p_G~PM<Z~9Htgc$LJY_SOw+M0uH9L-6NKL-I
z+2rzB6!<A9qJ29-WQ7l>l0sI97b>q97O?gh9LU5|pKFt5HaLgvd6uC2?f7nQog1e~
zvjYUTucs^)p~>ZmjM0ts0t%V0A%{-PEv;?Mjc2JHve-jteS@LAdpA3yr^h!ngkUQ(
z?Hz>7>@aCnZ!LxDI?~+PU&H)`=+a|#EN5TYG<USASz1On1rs_%16J$rL5}Wo?JK|$
zgYRpb<KOCb&UWC$pUyf#q(p1q>f`Sn8@HsYsT~@;gO<qL2CSW@%hpHTxUOYJ?C#;l
zI%*cz6&x%qKFjoW(VA|#!`ovFw=+bsm4_P*qB4v=sq=n!$mwWsiOdcfFGzLCCcu<p
z9m#q|$V;npR~%a?@v&uSPn|PI0v`T-UkF)=p=&wUKbz&?&>5a}y0-1>UVqvnc`e^u
zww@buII|39q}3Qh+<~h6eX}BDE1rA7;n};)-cbFKMgi9^#5`Uy_<BkO2Mm|af1CU8
zn{D)kDH4c5Z?Nw$%&X^)23Bc~G(oH1W+56*OUBo5a3ZO5%L8Bha{i(QdN}@Sr=I_c
z`5#~-#E?Z|OCHrlrl0-W;j@%S&0({5zs?cw;+2SmcyGpgo?$TvBxe-QWNt0Xcc)yM
z-Q=?Go`wRavp_%Z2C~VhCbPUdVC4?-9KIadIl}+-v8!tAV&}8EV*U}24~ZR1{I&L;
zpU-t$-7~P}v5~xV0UTwxh!}PG4{%eZVzkOLlvWU*+!TE!PaH6w_#58VV>zpSDtfAv
z&=`+ovi8z#IAZ@RPC&si>m6~=tU*(j&o>>z(0a$NK*$s9AKe$c2rJh3FtCk4SQdkZ
z>F0GZUcSD^r9SR%<EDmIOr?!!(mtnwOQSHz)78?EjZKCFt4Vunl4-aGYHTS*h;o4?
z;9B#CeRV-J<Np70k+YD-L_3dn8ii3ULH7~EDkVZy^Suc7VZ{{d`whDZmON%5%`U{P
zHrm>qeE4hCA|b5Qm`;&#9>Oj4@xKaEX5;c`>1>z)GpYfaua--+*;d9Sq_{N}!8->R
zQc#&4Tcg87QrVjLExGV%iEwC$&ZbU0-6)~iVff=gQp=xr63MWVq6QkJUh&9ZG?xbf
z^*YbFX`PkU*B^g(eby7*AD1A5&^!MdqmHDRUf9ffU5Y&k_wkVSR6io%6bZ!B>{hll
z>4mLO+|l$|I}<3I6o@1-l^&tGK(ALNYix^twi|I&m<z11MpEnuruU+0_2rh%BwS9=
zKc#MZhuoWZI_!DLel{^De#+Cx2b`mrz#Y^PW_$VTa8dT6jLw*yJXg=OqqmlG%gB5}
zK0J_KESqh9nH259bPRl)LPWPInLWFc{A+w)$#$nij<XJvjG;1=fQ~*t+WfaTn%V!6
zo5Hq|sC?~ppjKesOrM2?dzL*B8Gd!Cet)_^<?oLNWZhFoZHeZrD5t@9k_#B2%F^hA
zfhKnpR4rBq=gxReZHsxFCsinSXZAI?=(y#U#mT9i{TdfIj6ympQc{YWTO>BjN)aqY
z;68v33p9$&?{8nJ3!jw4$%6hSe2PhKj|>Kvc~V@DL#nL6i`=ZTrg_T^gPv_O&Y@l*
zpyjzvH6$Nm*6u6fyx4#VQQaD#8za<*x5?+{HpN6~zp%&FesphZ0|;3nCJMFkjSTCy
z`cq+LwNL(yJZabi={@!Bhlhk9DB*7|D3bfR;qXUSQ|fLOl4^uAqV$M}hB5&`^|=2G
zBsu<OAv5JN$0)w(%)P^GVzf;6TMgomv_Vr}u{Wm2`}xGCS5wI@v<4dcy$b&+(}>s3
zzTHt53OlVeJ>jMtIYmxn+{!8|nW*!7>ga_BGxD41a~;juKHUE933HhUZo;i&T{>&s
z6A4Oty4CwFr_Ks>PHU?HnEKt$7gj%K_H(q=mj<@O#Re{YK<8|2)B7p*5H?mgai|Dr
zcCt|HM0ZU&ZX_ih=h3{uU2!p(03IiYwkXKabv?J{ce1RY_D~;mh`!RG-?o~xaqt&2
zCZm9b>YOh60k1v31QJ@Ty?~!}>}Mb2VGvv+LQyj7z^&8d*QOlQ5N2ZYYP@t<7+|>K
z(TzW8MThg8R(C^xVMMH5zxU_A3KH@?{Ou7d`=VaF{{bZQQmiHwZ<tIdJ9D`34xhF=
z#`yOw&kT^aowY-R89U_(FX0~aD9ZLe3~aRrBFlJ@d*aCb1pXUQx$lUw{Hd8F&J=Tq
z_01gQ!Jc22L|ZC;D;j$~h9}M!)hT=lqm5e_VV9H$`cw4A?9VD`E{=O=B6+l%QA<Df
zN_t-TFmu~`AnIL_Zv}gersl(U`}dB?c_xP+%Ab8A5EcbLyY{1DByr%n<ez*7ZJ51@
z+7@`Yn@PQMm03`rlhGawMB3M@UAYkuSCg}&Sjx~ZsQ~Mm<nz9KWj#OWV4+Z?Q%UC1
zK+$Q7G=oy-;|i1e*egevC5e&LVT?5)4Dyv>@4=@hCTgT;OvAS(3l0sMORL<g#DCg1
z%Q_Ve+L{4Z7bJK^J!*_a=A8s->Gj^XeGM*6LF+3<ExN%i{4yi6?vyA^Q@HDcjvs?-
z#luh_pDEZQL}KbaTa+@f;K2M%<u5eEyrSY<A0?D-szuIm8yk+IZL^R&4!)Y0ax7n<
zaup=_0d9Gx?P&r*A|f#eaO2CS`qZ(NC>V7=Uq*%C+<b@`L0TGW_nbN%q<F)XY!r>1
z#K8dLLoK}l(#bzTTH)V!63AWSJ>Q=-5liCj@K%lcpWw*%tL=zfgj2-xn<B4iy%?!7
ze-?anEzI&XfguC>FBh#uj~l#jl@W)Bv|%H`60o0^=R@Ei^Ue4Pk10jgz3i-Q`|?^%
zMHP16S${ehczga(#UmYi$1{f!XYqoWYGUQV!GH8A9wSY_d_83YZf=TG`3$64?Jto@
zBD=x<_;UdBM__ynjZ>#P>7z(p#<&Vg>=M5oAI9oyj3e-E;@XwwMkFuQD_=hMQI{GE
z2_|t@l)Bj)G0r6rPu}8i+a;mU;%Z1rA6G}`yk;j6EX3)Fal%ZNEEB@sp+<Z;Ez+45
zdhX>m0GIt#FjL2BhaA1BO($i~A_EYOm(+2Tas2U(Q<@U;%1kx3${Q#mLvyRi{RmNR
zr@`O?fkcvvQ{1OLUG%$f&I_h1^6;fsnv1X?J}1S4)<{kGi@P0B>ciP=|0vYiclZf6
zyYKA?{sa7*eM0~>8%moulqGe2r1K^9Q7qbBDVRjhd4D<ct8FVitN%GCt8Dp<-gEs{
zF#s;)6&)G>4^ZU)53A%@LP($}Wc+O8Qai()?Iz&jg%#x-t=F67rSeVg{WjVp2o`}w
z3DdZJ7-P7cH!1&QI#)+%v94XFhJQr~{WSio%2ZZE=Nwp;wp*4sf`o|}@ap}>Y!WX=
zWNo4FiN^bh#=`DL<EOnkk?8SrSUx=Vm8waWx+ogxwME){&IxrRZ;NNT>L2Z1AO{^`
zLWvi~aBk~@8>?MhcW`xX0n7+9BMkmOk<dlWV%AX34AvO^DUA4o08GQ+n~z2f{_bhQ
zlY9L2A3p742rEW-33-Jpnc-Myd5OM$MW4N7i?5n#Fuq7O&P~NXJ32wo6IHXQIe<Fy
z@VazygT6VTBR^ibhhk(?lw3gWz)Dptr7%Jnuyb>)o6YkpEq?LBZXk&7*gj8|X~a|!
z1<r<;r8HRmA@Nn}A1-Sm;@({~oTK;GU5!l6zBc?wl90Gl%hup2r0At{am;Bmn;Z{z
zrrkYJ>%V8kXGzCP*WYpF0$;U9ZDSoiAjV6{dit_k3e0kk!`gd`mtdGQ&~itU5yo)W
zxf%1X6~%Z3DS!U7CLCmDiOiC`=$f^491qJcs2(~L&Rbum&0O)QgiVgc)Jfd0@|^i3
zu1<uecWQ0z@<`=)j59*zA~!w19Czf6*D1@H(uw^CFbDYpHnFaX;r0{E1|dpQb_a4@
z&GA(}c_JzS%xt2XJ!$^|)bn->D25^dXX@yw^=`i>Hd2D`)*q$^wm!8xmQwjS={;T6
zvc2CmPW%VpH3?9)@zI~Jv4i(^HHD8~u*>b8l7WkayQ?NF<haL_u#I~KOtKOWbjp(d
zIcfhTsoV0vx7!iTXwQ!?^r^T_-K}?z@6|f%%!ip^?uD<)2AzGKbiy<t^G)REf}L1t
z=%`KZhFn1&+rp!RQO%ht9XiCiybXtg<M2IEltZl{4dX?$)as@JqEBO`>kPvtOY^lB
zYYmz;?K3>{f?+|q%e7g!@7az{-9L~oH#SQXZij2$p87G?G<psPh7u0Loc2889xzcR
zOUqIa;@j^#wwU<n5{)04>BpyTPWrGU7cc=TsytZpFHa3E{sV;Hvs$h2Z{(@cxtr-A
zvcvRJc<&xZKd~0!BjYZ&t0!+t4B-qq>pumy-Qqr+GnUwqjn<f4SnytFQoV;m3CXFO
zLGm6DJr5mcy)1yjj3n-_^#2*Sufj=@D5WovC#QJ0uif#nYX>G4yOsgdH2H$*)0L`C
zPCG=cYMK>^t*CsgK%_TyYM8fX^uFE}+ywyxJ}XxaFS3G%SpygtJF>6kj6PPnM_0>E
z9qnxd5;d9GExgYP<xw(hBTUups@~vTJ(14xkA2Xys~Dge<%Ah*V@TUt9=bDvd%EG(
zoP2OU^mlt(vOTQl#U4DW!=xDVHSR4+j2F18C0ZxXJcv_gN>&(YTr^CJ6h7GqJPHgN
zTX{=2R9-~lM_U4EdJy@=3bDnxIqwMtvh_ZJXPZRNHSV$soFu4Lha;jE_`ofQHljaT
zT6kSP>VHj^naYvvEKXT07gX&r|A(=&?24m}qAUap!2-c)ELia1ZowhAHVp)KYuq)s
zHtqy>Z`|G8J$P_;d8cRAnvWxYp=#ArRp;KbcYAO%qzN%fvz%LxOT7qXR6ebB5zcXA
zf#P^1*C43^PGG@$!!<+Uf_b@Ls8ngC7NIZO<9f9azp$|PM#&ym*O4_k{yVA&InxEO
zw$G~RgXON#AG<GU#ebTn&kJ^WzEoIG5QU&@r~k+|omC!1yZ{sLu?tqEMbvqQ=+j2t
zJu_vLKUI;w+F-|=WR+zIP<pu5q8f)%#7~UjW<7*lJ2xhdd}#S}G8`MNXiKL84X`t9
zgcuvf?RtBI#}4(=t_S~#Muntco;{n!4_T8@(>!qVt=O$uv^HkZCn&|Q%x7k!@`&ha
z7Nqp<z@<+V)I2sLj>>%(A@eH)-!CPUTux9>z0U8gX3gJk^vCwM;VAJBB$zGAQt6&j
z9ECR_Vx}|WFU&RkMuT)8G#<)wmI&nyUdvKpG{;@p>U?Z`o``54L}@me!g<tFQh0vF
z0F$xzr<oY|9@%y#-lx~l4B^es_L1=oI><iF)2+B*_gd+`$YGqbrf#RKm7TgkgvCDE
zE<4t)tML~lxY&Da4543OE303Axms6sP+&rIQ)M^yDfd1eTv1!8!kCxlyZDIYOIJz7
z^;>!LdPBFsVv_}T{i1~|bzgJlO#8sUu^kP~%nuA`Po&HBb~GyD%aIriE?H;Zs(0W#
zVsTF(dYnz)%puKu1()Xu0H}Pn<f@qMHfMjdy0qa)5v#R`h)io*Z*FZ(P&d_a^M<<q
zK7=!W;3BqLlsjKc3Wj9a=QiafE)yvPx}gYK_R}#{wPk-xjf=NY^y63ja9NILM8X`1
zRke^`d{pZ3MdktAi{P*wBD<REgE@T|siiDLIrSghXlmLEH*qOBN7W9K7~&hAN@L|^
zLj@5AMz>Tt6K#WvPpRS(V!SBD*C%(&!5O1CvnA!=DKQGh$EaD6UT0^7_IZ=In1COL
zS6m9$M<J5;L?$8nwUpG}K8)PN#q25=xGOj|XpVsD>ezHU8S%7Lbq=<6!23uk)K=~b
z1ks*s1!6`>UcC)WvF9onBr;Oo0t7Ogzn^~#i-DOgO`U4XPpec_kt+$j^Wzl752vmx
z#kHW88=hf(8C@S=pQ(T2#y8z&nL7cEp0|;|Qc8K?fI+RUEjE|T4X+G-Q&IMZ=?SiW
zN*zeIFSErks+-<_aKsZW(^Y4n5J{@xUE>=(<w*0z_(#2f*E*`cvxABu4W$i8bH;(-
z;`*~qOxD@&a(<`30^i?GxLD6CsRgM5hPWsq9wgaUHcBmfOGqgAc7?SoI}{Hl&k2}q
z03{SMm>)$NSh;6>I78x_QBgi~T=Ox)U@Mhh<^XhoBX#rJvY^%NT^z4Tw*djJP|vKp
zs6g$>S8{jXyNF9Lw^5JUiCUv|8z1i<YLBQ>%T&t)6WfxN3)s$Co6_HRJ=G^;rzj1D
zsW8ysJx`qs3nk7Zft_F=%21Y3oLJAHj{b_RUoT5skF(GU%CF5_FGD8AK~buF`sG;?
z0Sj*$u@D1sz2^71dj*Zz`zutc@fZ>q9ezJ}w&q?w3RigB_UcG(OVps%6tz3lg=li&
zbkR}Ts)>X>YYJ<lsM1_PYJKgeXp(e5tWMoe&V)~8TJK3O-4<9%Q>MuJ?k_|cTa8+q
z^$aaLkUShj8iKTvjWlLci<~V|h6(P6;PEej!FL}FyM={Le&0<v0N3S~X$B&OcSmN(
zmWvR}sTf;?(!OkM*&Ui$UF(jLLuM|X-dh`RD(A_zHNEKC<J=}c-j1R~Ol{iVnidGe
z9WM{%mQM&hco(KWV4I4bmQ6@YWt7{Ne2bXO8CNud)V6RhS-f!sT~>2Wh<$CrZgi(!
zK4@PsvX+l3+b4Ih8g>1s|CYr%e3E=C(2i>ghE$fDk8^3A;D?j`%QOy@yj=8%7NsL3
zbJ3U>X$cYLxDV?i+RUh(pT)H>kK*UMGBM|3ASx=z>wO$y;%<Dg_R}Cv-ObKB^9c&Q
zY=^crHDT7RF_rC^M~e;hji#aIZRB8i*uBfGkc+=8C0IIaP$u^(qi(esHx0umKb)!(
z2YisEP$|5@hNNl^)p4EOl6R5TBbH)|7>gc&UsBaGcEbCG3wr*@E8QJ=G?hz%mF5gq
zeLNeL1N{#GnU{@sKw&(PN*I;M7rCOjqcaJIlHwZ{HubLO-pm=AA*3?SdFo#q$&tM)
zZ_TrhW>G@E0%?~=@&zhIMGWp6CVkr3xgn8-HtQY6(7dKkQE5q>vAHbVKP9DL-UmmS
zj1uuB|5HiDc&q#2uczX`v)!%{DR<cV+xv711LogDPx&^bf4>R^<TS6~j_b~)B82A6
z&sk^x7{-c>{rnGZPIKC=<lg3QTlBgH_L}5p%FpOGLRKdr&gS+Adc<fFo-ipv2~TB}
zz;ZlF5M*!=>O7_(-o-9yNgq~<l<E*$+FfY1XQMvJwrpaX`stDQa2%n^Y06Vvb7_9)
zl-QF5#JOhRIJ7(eoIU_55DUokW-NLCSTZYHa?E{o1-R_z9lrf1LOeMy6_v@hT98mH
zND~ehbPXuSiKvRt<f>@PK2t1u^Bt4QL*1utqmAZafR06)#Q<p_kZb(!B;I$t*Ka4F
z4lDxn9`n#~jHUg#eckQ4sPDX{kHphii<>e?X%y^NWVHKl>E%``3RfSr?_85d7Xj-3
z%BW5wN&oy*C=AuVo_HB}5A^=U%0H?1(DM|frm8C!(3V#_k%<h04A0)%pea~0N)3R%
zN<P%TsFyU3NAp^70Nftm_3%i9VkVhl^BA4#&Z*j4J~>RFQp74fRM5|Alb|DG(E_4@
z#q08<uY#Cb(F-6F6C8F%qh{{1=<SfdQ5}muY|b3eW(zgF(roiCHqI#HZaW-Dj?TL!
z9m_b~f2$@u!CocXn8W?<sWHDWyBKy~<hETjksLootj#v$?38~y|82CoPH|-}-~=nx
zFR=Xww>{k{gft?^%N(Y=6$z=@tb>*d_|WM$#~V#CStz8J3_GsCy@`A|QnGHG-P$;M
zOM|+%Eg%E4CQ%5uMO3Y_M?@jI8z)~3D&Uj3P6j>SIPOaC`8F>!7w^jb-Q$H3sjpG|
zrd8ArQOEbzYxDnugG_sFd=6N-cWwOY-Nml0nT|NN+UCP>#LXV4BpqcZb4x+Ic_w%T
zx|ajVOT-ZByP8O@^^%}mA?IWtdtu<O9y>>~tg@f>I2wnU1mtie<Y?Yjr~W#A@Qm-T
zA4!aM*O2PVwp#48&E+8dV_Myv&45%pTN8cW(aM~?bew!WVQ6ck4O&~xqcChC96Hhy
z${MIi7NQ*o6+%_qzXB0tbRX-a6$=s?AFGq6`uhc7q&x5O+SB0RuFFy`bq~y35_w{Y
ze99yhP%=l>B*W;jW?fpPQzz&#VZbrl=tvgfmqC;BuSXxZl6JLzRpgMv=(z8_RgPWE
zu@u&4t}`TF+J-E;g8{r@hXGMbQ!kWGEQvF~iV=2GBX4d;aJ;OL$D5=Neo3B}{_NSy
zLj8w1+u{Ei`^v#kf1hEzzu*67X#_)B)t@E`d4^Jfi~U0_Ez&gwDk#CDE%xqLNz|`x
zNQ{9VU*<fkw1g_#kVX^W=-S)Q=qzo;v?<a|!Wi9-QHe;5@2XVnIIT<Hsstpmt%I=x
zs0`JwC;J`>T+XL3r<9ECnL@17wt+0#wG6+g4G^aNDm5@On-YeYns7uRb`>3<KX-Q}
zO7;7ny@3g++o=HF7puI{A|fwz0-2MrWH(tuOBX=NVT3+uv(vc!WjQBw8^WBc5aTW?
z!T}_XZeLst_sGU~WEW`Mq41o~O-l@?GOFN@F@oO9xcg5y=${>)?8H}7j8e_yJDw76
zeni1rn753H+!1M@FSkk;Se7=&_~T(h!4&4OSpb=;Gy?rZ0Luhw{s$*~xDV2FwXXz|
zm}<mRwhlWe{oz_EElxzWri1?zWWXfCzkxmR1=Up0B%#Z5QfBsB@7G|Jnh%*x3#`l}
zrw2BE@^<vHzP(a0zYt1$G?#-EHZ9#WUBNKXSA@z1<rL~QSD^+eb#CoX_|BZ6%lP1%
zLHXTISd77NKX0SIvk0^?7FsbHErYXpifPEFjV(TgWJEJBP#+kWt?haGd6y?0YUymq
zT7Hk`rie*9l##DL_>D3vBWAZ_hiS6*q`+RrhiY?%FEA)UM+Z%w2~;45r=qY`&z357
zDc!I#qokH2WrtT7A#2DlI$A24wN5agb>WrSTh3vJU%o98>HmovXjQbbj-p%XSoSDJ
z{gz3)8!;ZSy0dFRX@0kd(tnM6UzxuGT4TB>Nwed|0A#{Qu_@%0W*gQ755hRTxFilS
z#`gt%!*<)vZkEJfKZUG+k&$66+cPN)sI;73PB<*iv&_Lj0CexjUZSaP$+c#QJABN4
zZxN(=5Mi(*;@tSU!>8~2zOD2dBau9m14y9t(B$|%+f464rS@q78&q#HM8eG%hbqFK
zkyl-Ae+&~9Hk-kuYjt5hOeoE08&eYRh2^qUzb*%?*mFF-^dF8b78)0hm89Vies1@@
zbVPm!&EINvK<5!EleS!kyIZ^WFdCOJ9tLcs3x}w!9iq82z~9k*uMdYy_k6euOiLrp
zd1{QsxbeZ``cGTF;_`az!@tzMq;Yto1(Rt8v%uyFLitkg4{6-b*M&Rh+lUm(s3Uik
zky#+!=}hK5Bkc^+ButI2E-HPDU$R}Q_E0F|jf*1wbJguUNK+YMFK{=~#!qm8UFCcH
z;)rqg{?lIFTP{E34kpQAdim>pbn$nwHU0aXI#n+9hxg0tkrUvTl@W8c2zMPm6e*I$
zEV7x93bOG79#T~e+;~y1Rq%S_?TPEWe5#4)FkkYZ4<oF*x8|XV7AUG8Pd+wTOPLMw
zK<MAs_Rx~HuUOmq!F<P?l=xD;e{%!`De|EHOpqWa$G*XASDRNtN;UQ+xa7x6)#nzz
zz8T)EXllOqK;7MmZYkyRx%a;+&7O$5bXwc|m7+8BP11rd(MypelFVyp;Tx%nG_8jh
z-uxPHd7TA^GkExNgxH^CIzsA9C|*;Fa+r5CtCX4l?raacQSM74zh>L2q!&T~bB|Nh
zemLcu^;BbBy{Q~U+(wR~q*W?KrMcC5*4;s!j^hS0-yEtB(<EYbGTBA4V7ag>ejVX~
zAWIweVzTue*-pIo<U$A3f~qQF_n=Yw1`JG0VlDEC$>=?zY`J$z*lF@}_fw!L19gP3
zR5pcWhD^1|r4c_5w55IGdq^a6F^ev{JXGo=lDd5CVz|MDOehYuo7-e>-0w8fIXkvg
z^8Mn@wq`%LV`1aKF+~~3hUV+??Qa)1WU)EFRM$C7H=cCLJrhqw(9`;UoUb?L#XD+r
z>#NJYY&~5PT8|hmKhtA9#(ZEt$*s*6(&?#W!CL*ceD^qeueey>5j@4(s$d3snEqKu
zL78|5`wOl{dT^n(!khM=SjsY9RQ=?Zs`Tt=`M%`Snf2xNCJnUedw()cQ(dW0IEd_y
zd2D%PpWiks(1Hsc86(f)AV+#D0g9T#TKg()CNUjvt(P@~roUFplS?K7QN8MFPTDR@
z*|Ev!i8273uYYT1n)5ZO5dEz*90$w(7}&7sUzYr1T&w|5;g@6d>#qEu-w$Zccf_zu
zOV`HZ65#$Q%1B9q{=_5KXNEQ+J)70EctIi1^!ZtnY$4ApEIBLdY>$L|-%@#=^TUW<
z3PP&<Ca4c-MuvtZ6~)(hZmCdBhkN>H>C<%wbT=%UPD|j+qsBzRnj&u{E3zk3{vCOP
zmUu&-SVYB2p9k5o1}Al<16ptjf}0clKUc2$Q!O!s7tVERbD@<1;}Nv}@hW7Eh)lpW
z=Ty^X^r9n*C<?<ua-KO?RU!P}8(H>mJ<O@e*%3DZi<x>nN)kX8E(&;}ZHcX81;a7M
z2}%!4?HewMFf_2s-DaEWXsPz*$Rp<4Nn9&F@2(wXo8v#9{QAYczY31tY5&2!$9;Pj
zvd0%nkPQb9*P+K|*lVLXs=-eiPrzCwdi>keUTwu;wBO6}>4b~#D^~u20A@O+>!RED
z6FhjbPC*pWe+upH+MevG4K}8ix3M_J>=~{aNI|LzK^>5AvOUq-N^<+tx3m{DD#zW6
zpYn(MW0xiJt8JU7(zYK!L(xg1DzW|*2a*V}|I}Jw)8=71z?0}3P~6i@wOF+M{AI0V
zRq&;AdU@w|=$xKgaX-rZH}>>r>1}<z%}xC(+7=@Y7+ZU({^IlpY%&WCdudnM%Sjfi
zl%etY##)YH>;}it6)304?G*As*KO-bP8_`n={K8Tu=E#1RR_WQvIvADP_-Lo_{wx+
zLBquP_HYmV^zNU*{{?>%k7A>KnoEQU$M6r6o0{2CVgd1YxEubqQ|`ySjNVosNdmu1
z(wwe;x%!bww8jUstSRv1=*%>sdKuDW_>)TG<nTv383h+Pbh~HkdX%d1T?^C?*pa$3
zKu6ZMB&`L-!fh7@#Yp|o=h9;`tPM*+vi6icX}tLdpTA5AF=nQntD0yzq61Z8yq*^m
zgR5`5N0*b>5{`K)_;%9c?rZm!OeC+T{FLk%<#>ifz$=ifhg;P%X;``|avNb^{|RSE
zEu|Wc{O9}K)aLOQeLW%;8P+ihqb4X3+%y+AO0oz;XBB~X-3y%+^M7#hWhjku<Hkzc
zPBT_1pVt&@;vI$<k&TdF%pa<z>ITVQSOqDEJe-`V3=|(>wg(K@1$w$V{JCt!ZrLRN
zwZybXkZuYQ;iv5<Y$i<Xn5)_oQ$1!WRCw^12wLU&(tQzKTSsH;8PSxh)*odN-FLjc
zWsri87e-bqL9+R${Q38!0_V19Gx?K$n}jck7p9mpQ+)_o&glw?K9JM;6E`c7uubVm
zXTe?Z=bW)aSt;W`p$JYMjk?1>dHD+;L|8nob!|5?8&fz|CgI{af`TA9(azJGvi4=`
zN9oMX?z@d_{#7VpyDXs6NqVwLi|UGo&B{^%+MJKZ)M-6#RHkZ2uv8odS0Fr0X!x)>
z$?cNL&H;ICzG)*1GJL!%w;~%M2AgSfkW~4uJeBm%_A<wT$D&iD$;#bUI@l`KR`mbz
zxfc@I-G1jY?ot>U)>^w&_(7^A0XqX97qvBFo+x%5e8j4wtmA+*gGrXAh^k@d@oV8d
zg21B|*dt0R0#&w5=&`pXX6|3Y?xCr$j$yv4If}}9V`Lyo9pdWg67KZ=Qf=t)^_evf
z7C)CI{lDX9Ni8t@+S&-mVF(u!cn=Av;tVvl*bt}sP*Ds)DRkIeq4f5HwicyuH&fpS
zP*SGt!g@<^i>7Vd)l_4=f1y#Bh-!g6%V(EdwPpXo^)XB0Jg9<FiSjkw&+?JN^+o{F
zReT;xY`I<<6Jww?Nsc())UR2g)rDe-RX&tXTbmZ#ok2d&$9YddbnulUt5=#^z*WD`
zS$}@uK8nF&c~7I4N7|G;YT+@argJG1O+J+E{kbGYHj6sI=cje-Knzfx?&{hxj2J+5
z0f&J$&YPr5p3QNngLiv9^m8gygvD$%hm}3CFex@|qvWai9GD*t2>eu+`C00tkQnY+
z<$B{Rs)1vLV7b}dt&pi%nx3sa0nI8~Qe3RkFaARajRgB8k2A^dMsAcb&H-j!4M?)g
z8tECO1}9drgA>N!4uN(`x|>DrXDgKlHwr^Kg;d|&>3Qb!z0=oHW6zy~L6<?G>m8zf
zgOkMoC|o<}fYDyQt1kYFd71bY)hV@8d>0mLlBwqDp(xW@E2(X%J@>`fOR?qg8cQP%
zc-^za+VcY_$g5~#z-nwzIU(^DM(fz-i0w!}<|3?eZWd_s`kg!~s^XsDz}BQQn7t*Z
z-8r;sXi7-^nE1T=W*MEM$6<tQ-O^O!Krk0J&rnvH&kA)#aTk#oK4V^$s_hQPfse(U
zZ+~7aW^Vhc>(KJ@7ZRWhor}LyAL5tpOQ1}kFc$dCmNm4m!`;<$TVAr~v3g+22j`DV
z9`YYt7PA1iu3MXYPM^TLi<Z>!(i%*$oXmj!wUj!JEn$3qA>zB?I3VKKu(f{iqPVSj
zjsswT`G^cZ`Lth4g(sE2(&Jj`l&?S%)a5vY=#9l%ML*2F&oLY$3QT_E|8-%~p22PQ
zunKlwFz(|IFYZ_#`%)2+M#yL5^0>Hl740jDX}d1vdu!f4^q#pS0RE$|vo^vt9@npI
zGI;9#PWYi?_M#ekfB}dic*alx%8g#?!DIC$RTqmFr)tiPTh=AwZ&+@gJXk;;w8p4o
z2IMZW`vR8yW+5pWomqh$Q|Q`P4(8O0k8N{Yd#IjS151<)r@p=}6UX>t#$Gh7Kbrt3
z0F|KI#{~iQc*x}GzWFiwsnmrL?g?Ecx{aH|1$i3th5$5c)=TJsHlR^ZT)=bDuH308
zT5Px0?BgFW@*XNt_w7CqSs<JnwO2?14c4~xnD^$Xbm#W6JUla?Mksf4kr`1pjYLe#
z8uE19e6j_!<0RVbT?VyO1uj7sQ)VLdRB0fd9GJflX6v99&W}az7x@>OV!dcSTfs`|
zr!U$u?;CAvY9lR4kFzc+suOC<%?1fhAzDX6*CS!%oDTQ?J9bx<3H&h`w!|aMQLzm0
z{dl#RE{_YIl2C%_;Yxa7=g#|Giv5}1vo!7=J}*L~p{AaWo+W{t?46drRKbk)@`PY~
z%=Ez~H71|0S)MPTS#A-)kC)e)bRX$3^W7AoSTL4NZsV7<L!bl`_2hQqg-+v=>*{`W
z{ra{!Lhpvt0VB@+s5Q~JYOIFgNHDWFfPKNp;dI~bkA=r$d719LxZ$SZ^rZ$-!F!q6
z;LgeF?)ibBl^|uz&}{r4Hfi)?L_iRz;XAh(e)9*XhD96p)b)>y6|I3=dJQzS7^hT@
zYu>Sij`rBmqul+Px75dAX=+s_C)VIGjIe?`c}@RNJAAr}+{^c`?VF?J@t<OU`=;%=
zk-=T+EYxtzw7H&~LmJY~iZF}q@+YBHw@0kG_hS-FqGJZ6|G_QR!qm)XbQ-j{H8#`+
z?%?@DfyI#d@Jk2~?gGOj#xHwBhpti7a-WZszv4yVheUID!3JbL1n{(^;JK)`;zh!n
ztn52K$m>f5<J^;#8%45@kWCKtcL;Nl(38#74<rdL*6*#1mlomS`bQqG-@LA8n1b?B
z>avH@v(B2_J7?^hg|FWm&=|i}=~nh^QyaQ_zMjbVciCfJHJ;|*6kL3k?jCkP9UhWP
zLQ+rqoc`m4e`9VA{5s=UgfB^viQW`jRywQ4f5_ZSD!qw^IG?T{>($VYiK$h}m5+F}
z)pvSxM)9CiTWuIW`|rc2r1kGF^MsP#sb++x7PaIH<G!90vX|p+9I(5ymp)%HF5MaJ
zO}9y=k*cHya^(+Pr*jhKZ83q_3gv;cX^t~h(yl|0oAQ5+xkbp?O<y;#u%EgDi}J#L
zdg*xgXus5!BHolA1j@V7f4$7<UU2!Bs`D2x=b)(;U|FjlPA&RDW*9~C&luZQ6xd@I
z<+5Z(PQL!AkY>uDMXRpL42^4rm1*-}*7v2$)qB4g1m8(TGN-j#(Zu>uo_e=u$5fe}
zdl@2c28EswR_(aPpHXbv7$(MB65ZPZ5E`5!MgPiKF^q;Q!XZRRR7vgPA?ua9J^Ch*
z-!yRBOGIJyr-%OsR}bO7(UtLT8z7G>$6U)N;!Kz(-`3=I5gYdx)Wp@iULXA$LYFkP
zAxS-Vu~NG8d&CWFZy((&0Os}ue#pqsubDe*c7ELdF|l)1yR(+EulqJJraL}G=PtI+
z*a(*Yv|2WTMq!5^eNHav*Vm`Gu9}ezuesain7iPA+#bziYzgCm!C-!znF0yJ6hg8`
znn&phgXQ1Yen>F%wL@Y*1zf$=>(S<yFI#@+DoX#ejfE@6j)@{7_?+#+oC^&WCR}Ed
z{l_1h7tKs(?bg=1<qT0^tdAhp1g*UX5lILKRrkN+nU;-}i93~9|2(lIPJ&^LuW&@<
zb`IOJ<wMfqsA?z2qO`<TNu5^zeAdZ_BEXHJgi<Y4nrW&kI_$P(zrAD>iTbEPZ=|yU
z>09datyWtjXHBb7n#aci%}HqNtfErg<XNKCW@o57UXjVy=AVT9&9ACd4$bVLuCNV*
z1q12dbC=2*AN$R0m`T!wTMJD}L$O`avaKB-R2$>UfZ7FMNEEm0-3VV9j3K2jQNv!*
zGI|BT)PShQSW?(s(=z=1{P749;rU5T2_fIQ_KT16>+S$E^$w7DhY1B~#)@Az1qanY
zJt53Ju$h`T$J{xi+QzjxJg;7CfJ&|a%b!$%Zl#i2PY0L|3O8)}{b3f}c)LqyX3+)g
zoYMzAfMxgFbaef`B9$J;5iPr6)9nbhugDkMRs)Fk?j@E~$MtPWKDG?fcuDPSpcHB-
zICz)Jc1qu6RG#vnn6Q#m=NzbK1i_Ol(S$Q5+<(+mdnszTx7J-X0B{_3P-%*###P3s
zQ1q;nuN=5($L(SV5*#>b=&Z?mxM4ui2AHa_QA)X%k9{&5Th3@Ra+g`rDvVdFP;N`E
z*Z}oY#|*0x!+B01+Lr8O;u1-OO;mfyiKB-PL=ghtLkw{AzdX1Hi1=6K>%^1ITczOJ
zgaAL40n7N{2{UoPdxH1foM+?VJQn-h4k1Bujrf;;h*+s&@P6q9`QrH|<n<MbJ5`nk
zZRp@JM*m*vV}~VP#<9_c^P1xHXEMwVL@xZE@CQ(%fKx(Nu%Be`TI8~G7Q<XUu_et{
z<?6nPDOK=%=A7ogti&0EIon6%dS6_{)6FBn6k%}@oxSZv+YIPgxh^ZAsEMRq74lZh
ze{k69N6&=||G`-qb*13oI#FuU!C{>$9|I97Lq*y6U#5^|7{NQ2fKa^hl}Mt(1(5PQ
zjcLT_kvN%0iV)8~QQFS6<um^NmBy0fVLLP9@GN*=@^F|DCs1ZitznLmO&aTpq|jV@
z$*|vJxBBPO3RU!1QAl1Mrd&Rp3c`j8Wzq_K99p$SbTjhnd`Vt}hwA@5O8(zrGj)T&
zRk4oS0B_y8a8UN)oYmvrbDpIZ!ASl({RN<r*FkO0*TA{DerrXtWO>Ar4Gc&f5f7@J
zI{Jl@BikATeXgvAGllL@-!WhgEqyI<_9^Iz=by>)frWbzS7ZWCy&j(Y6Iaa-L`CAv
z*QLxH@!tADan%Hk37z=@%usMa6`YZ<#C4Tv$F6E{l+zG}=qozO@2H?ID#bQqNw1E9
z70@p`-T1tYXHK}z9Fk4u@i=`b7V*F)L%_DpSx}BDy{*(tRRvZJwaTDh7NY;Q=yCpA
zS%<1tj@;aZa*~-MG6Q%H4CFqeUQ+pCXDVq#@Ns#n&~T`(i1R-<JfexF=1nHepmJlJ
zdluq<o|PmX22HcOA<u)1k-YO*7GZWmiafty9BSJSgXcUMO6_(yEi%gpT|*_+Udoh_
z3V+*SunosggTX!{Qp+fRd8U+f_HWnZ%b!f^V)oYD<bXjq%|h_U>{iD-^ZW!#fMpve
z6vf7=xnGi~YoEQ0y;ys=iml^y((uozThwCk9EhZ=Ff654Nn{(}39OG1<uJZ>WMNmY
z9di%E?UQN0^HzA|v;9<O8_kMkE>~r+`jqxD{NR;XhV+N*je7rDN8b94p5$V_ZS^m4
z#Kr-EYEM%d*<VL@@2|(HOL8G*{H|$RU3Vip8c&UVHx+B7nk4c@b3bTWb}!>Ow%7Kv
zz2+Wta-f0C2O$zRXWio8U?MBIiR=*9iRIbQ&+LDBPx?mqNPn6M&srlKK(|9Kw4|`S
zZTC>RhlAsGQ;(W&xhBYWh=r?}xSIqmDzgPYhi)sp*dD?u!hA>S21vRF8vl;m$PrF=
zA>{@I$)Ws>2qX;+(Jdvi%A=Wo+`KI(oM$#HpNrz6O9tx<3}D&=@yQlF1Iv3JpM}c4
zVO|70!`4GyqLa~tmX_>MjVO~{aJGaRt$?l0=Y9t{;d`D(&xkr?0kf&qhNa+j4nXyT
zGGwAW79Kwid<Wc|zTy7tP_4FD5zQ<62@@E8L!FQSsvknmx1fsQ3_0I$z!rsH8g1E|
zH>sJ&ZVTka+#bZR?a^7uXGeY*xZWD;-p`KYmosPU`Td~ywzbZvBbt2!e^t7&4wCl(
zIJIbxYy?|w94)Ty*S6O%qzJBf@(c|x@i)d-w14r*#w4Kv>jri-fScLR9Omsm#wT`P
z>ZRT?x@pgm^?OO6#4NP%uy+wZ$Sh?~Kk$%S+N}XDA{H9b1wa-%t{gxaURj?<rRu@D
zYN+<@NkL1rz?hT)IH4)`w!(rT4Mg6jf!21Ph1#^VVKIVGy0Io6x5?{=S}FfSmg@fO
z+ZE*%VJH`jEPh{Y!?Lr$tPp&86#&!04Mw)?HH0ZyCLs1<MmQjuj4(iVWcnD51!APi
zi%jk+ZR|USMqkfAuB#V0JMXo$-PvRJv$8O;Kwl=2&}FWuN)8xRxU^ZJ4^8b+P=9xs
zH9x_*R-fx%{a+IU*rTv+KJ|5m@LrIjpgCl|GE5(8j$PhFec=!v+)7cVgr1%m^X9we
z(hiSND&i=*c2}D;rqh0q8BOTCv)TuReSyR@l>N2B7h8HNoop~IO^%bGt+gB(3Rw3&
zq7?`19|*?$VH)Ezfo95JZb)ZYQ-_!8jD7j0NfNNH{aT(+?5(T~`c)A5<r4mDZMXeh
z!Tmhv8MIZ#S#Z#A;F<B>JHGXFAzx*|AkrdkHxzuR$q@V?N)E4J^*I>K;8op0OBk_`
zS8A)ln-J6CR$xW>T@JX{pd5Lk8vQ!Ie*zr;REua3F&(7X8S|~0GPdIf$GthVw={p%
zWA^|p=AW7o{e~oIMoX(G>`ayBeVfayzwbV33+No;tIfcPrPQ5VYYtJj4U*Jq7s6&k
zoIxitrzt}@p=q+6!}-}c1*$)q#=V$7ZgEfk0Y-BLk(ZuA$&7OjNvc-=7@qDCH0EUD
z3as!Z=2C@1ZYmSAw^X2P8=tF!1oibB!pJ8B5u#IL1FDv$@Ba#OSd!%G7M7ldTi;mD
zvx*V%{sZeYx*h)&bMUyf8ifmVbP{(iQ4+g~gBMmJd3sCCFMITmjpV)rrF{5`Pm+n}
zbZ@)FmE>kjQ@iu9Bbe$7EvN?5Bdx`TZfqr4fUJa8ADm)11?)J0&X6T#&J4YLm9a3z
z$z!WLq|@EpXS^I~2Ir#`M@D&od|-drLXRnVCB-PrA1haL@Uf>_OhF4zo=wVkw`?>W
zrT3KeBeO;e^)4Mbah8S_UvBRtfd(`=BbbJv3yd{j`8$m*%3-!Qf_Qo>ktJTQ%*A%|
zSRw-Nf;0vfv#3ETrRWGdyulLRGGu21>o>XD()QDmaLi1NiP1+sM6KZQ_>`oy^|u4Q
zg7UAWSv?RDG{s`SK%=b7LA30(tabdD;#IV<dF&r~tIIYeL4@R(NnzZ4h<i7D>x)@Q
z)s6ZCw*6Y|ygO)_-sSnTw-!vSI{Rj_%)5jh1(AfpGVE@5N3t@<LWyfwsgXCr^dX-j
z=A5pdv5=w*E!>*w>6^p)Y&z+w6Z!%!57V2V1o%yY^yo6fgw<YMivBPUO`+YS9al5j
zz*mr^Yz{f$PGV3qsW07;%;t(k;5(xs363-xU*ZlI0^M(Ptda_)D=h`p5pyCQht~y*
z2uc8pi8)7ml~^Suj4Xr<wQZwv0uyFi#?K-&dxW5p1*KJfJEw#;Tl)|w#2*}d=MW5v
zs;=^29kQy@!XBSHSrWRza$TjzMEwtrjXbxKKda&}QgqFUKRf#QUt-8_&P_GnboZnz
zm)sZ~^$T~ZRZW+V9RHl6Zk96_ZNPupwON*X+eKx%!45I)<wczx3oOnJEg+bdsXAB#
zPB&KadcV0!EC40j$LcMESv}ez^{9(+EBmw=sHHiqEf(dIqEKZ$EoPIh8K28+{E+Ho
zuj-j_s5`ozYRWG4z2Lk7<W$alR@B}s@8!NKYa+-HIld5g`e<l4kj4*_Ys!^UJM^W%
zL7QRIu!QIcGF=0c*q<&HUMKdZ&B>JgDzcx(+4}j3&$ukkIDMxE405Tn(K+hK6xXMY
zZmSfpkE*?z6K%(mWohdz7^sIVdf3(j#?l>&Xbs!Ku<F)NkpfBDDvcZj%6Tu--s_k4
zIPUN|3Q#L-?`(a~<kt0kvRb)^f^wfSedse3$QUt4G7uQ0(SO&EH>00=2i$g7iR+!o
zPa(SEkB-&^Moo;zfn|hdwbVuG#z`=v$sJQIYy}mDsyZ1>liGL+l$iU<*Q;@7;~dea
zY7pL&2p=yb;wNC+Z@rF7Oq(;#<KrZJ@EHg>MU089ZS!1DGNG*BXx*aX2++oe4ky!=
z+RR_IWCCZurIGlDH@BG27JWOwv~aQmfAD}W4wxEom>k2w)EuFzb~PjYB0IOo6S(ty
z8LA%T?p60E%0(d4yvkY@ryC?vvzGc6gBKzTfSbjq-rJqmQYn<T=P|pb0$bxv=5K^;
zccUAN4k3~m_eISuJ)>h4Z^+x*L0$y6i+>tNVMm=!q1gXiaMBo|JdH8=vYWG_$g49G
zWnX7rueq*QFkP9E)KKb3crNo3D_hZ5<Bs^Rz?Wj7&1&v?=bE|-pN%g3i_G(Gb2#To
zcDMbduA+b1ppTt*>Vp@sC|IEk^8bf(*P8I#sXVL)^{j_P7*zZ$-=?;We%H7ydm?yM
z;z?<ZYjP)|ih?UZ-{(udzIirEE~Ah(st9vS;r9{%a9cXLl(3NET?a+-5mDuc=qT=L
z#e58|jBb74d)cL#O1mjLH|2LZEiY1H{IOP=%r%DTPUQeTeA03=v@8aJ2F+%7W1hKt
zYY`%;F3kPDJ6)C)Rn!g%M6SJvj!oUDOCxJW848R{jW}AnxR=D~a?X?m++)QN2pp30
zHxQPGpul1w`4j%i$->nyh?gJt)&G(h)DQ{egzC7Q+EvD-C74pW4<2vkb#P()WDU<<
zwDfh|QS7uPD<dMlmK?Uz(&?za_i7^%7zs?#IDhS-BhlhBrKrs+jNlZM?>?3q@B9_4
zf3nF?o@}DIqhTC}l}&F+5IkIF!EIf7G|mC+&XMF#uVu=UIscS&BJG|lLH{XaYUNNw
zO{O!0&%r1q>KY)8oK6kjAqdG^SsO>g_u!S8TtD6=<@(}?-!fMHR~aikcXhLG##nz%
z_o#{4)(2Z!|0fTkM=YDhZX|lKADfQd2uEEbsqCKB3~?4$#SE1)s*By3d!64z)NPfp
zd7t8nDZ%Xh##;((B`R^SZ*YBKqj$rCo~sLIg1oC!mNQDnHy@z9H3Ufbv9^yzp!*p-
z3ZoPX{pfWKIVNKSPU9u<=<ZghOpT^BEhxr-l>VBs><v*qNVz@VR1ln@3?BAx&0CJ^
zZne6Qk-HSFYBqBnwo2&>B*97g*t8pmE46M)kL?1RSQc^I*9bRcPSijr(In~@IcK)C
zA{HN~MEK1c_`kO|#;VVaIB#G5;e+#tI0N)%i(&IbD6kHN&N#Y{R}NVVwHBUUL@$i4
zgXHk{rO0Rnc&oDX=hUI7V1Q}j>11w{?TZ$IxtZ;7QtCt2cMr|Nq`l+>aP;))sAoiH
zwej$F44oM#$yx9Frd+dY5Pa_yWa+}*CEpKkGPDHMX!|^8AXq?6i{8F+)k^|Nb6@IM
zk+*{(oHF}(Q8uw)CQe3!E(|lsbF3*@-gQ?z<oZZmrA{Z=wPIBJ`aih1zaHmmB~D*m
zQOt%solu8qy{Kp^yLX~Ph`c*-&ojyyek?8-w}(ZczpHna<c{;upO3cX=uCDCeExV>
z$vq>kC%>vQ>FNVur<+pGFQYEXz&M{d{<PSb#9L6GU}5^e?$oyrtP0^HBH2_GEBPSB
zBjC7MFp!ySBzvsDB`!<DHMZe(vJ@M(l%7}SI$<zVl*Q{#!I8TowQV>&_r3e!`v@&T
zI0}VZp=BgvkgWsBc~+{Y7Go*enabxksiUcs2zv9rXQd~l{RP_8x)$!6K%c()Pr<W!
zy3Nr6KliZJ=P<D~=hifvecgkVS&LIrm5#Z0_z+9ah3^<Gi4TY<Advu5M=NZ737c%9
zYZ)?hr$Sp8iXeWM%&1nvK0EE!(XW&&G#V<*&x~_0z+rAaeCAs^&?Z@HL5tX$$wJRT
z7gv7wF>q|K^CW5(I3Q3*LKNCyRy7`j;uC+jzw;Awqgb-RynHx$%sd;H3MruCrQ8@X
zjcj|*(qW;{mSID}AZ2rKXfnAZ?DQ#G{l}@>xNuj_>c4D;{L^1I7+5oA2Nf}!@(F!}
zBzCe#5;L6axb~2nvYl3IFaMKaCo-3ErdVgB+k5J$W@_!hM&%Vpk_E*=Ksh=LxP4%)
zd5_fUuiMKGZYGs9S#aixE{nwfZ6f`lSWVH;mvk*L2=a3c#I<5jz=Fat|D>A4d*BY>
z2ar!zm7aM~EwAC9lx?40#mq_W1?)P;6lyymmseKTE*QM0CE9p*&DPNd|4kgC=))RJ
z&a1MOVRG-iDtTS6Dk=KDGQndxT`KM-)N&~U-m{kFa<@~L_W96!BP5KHTH&Ox;dGkr
zfywPg+HX>b=Uhpsw+Z;Prbj#Y?@HX$NW5i7pUL~0p@hlVZkr}YIWw7P8~ZoaoTD|~
z%A<_zCv)SNymECaBBSM-0S3#)WG2!kx9H%79V-E&o*eWgQIdLx|KOg(V-w^=L>VG0
zmE>YJg0r*wXr+iExqWze_kqBCF2fbacHe??;fSvd(ND(kKby!S+prJMgEG}+CM=Hl
zjji0!izFky4dKQN#odxxW+|yQge$}(eJT*|qi!A(>Ax%AtFTe!PXDfdVc4IfMn4|S
z!MkmL5CB6GWPrl<hdzsEnnc0=$P2{5tI}8$_j+W^Vd612ujMa`W(m0sFBK1TEp;gU
zr{IBq^c%l)t<%(GXN;%=HcFzLukj#_zX0`IkjQo`H_Z08gcqS|6Vs`Y;st3a|FQ$q
zS(v0)Z&_xXpATcInb{80sVpCzKmsT|1X6s&y|qJ|b-qRv4Fvc5fIHY$DvA009<we#
z%u*%7R^n3oZt)nXBo*Y2e639s8U&I4gX1Zg_m-$fw!Gib{LSrFXAw>_Fscn?GN`b=
zXzX(osq>+i<(%M=qf%Yu)pyJfnfqh7P&*}H`!wGWt$S?PZ!_7yL-@rJmUNu}>;4fu
z)RRQ(T$9+GyKhB@_DCN~!g@0)1Sug1htu}-PhoJJJlL-bW+!^NZ43K?imKS>f7Yx<
zf!uxeI>ZB6!MWi!Rh!#QIQYsuH*ns^C%)sGvW1O>90N!tid;;8>(8?M-@y9m$#OCj
zm{BXmF$ERjX@Yg1w;hFWT#0Qb%iWU~EeFq91OsCVvi-HB1sC<=o4mYu2#6EQ!|8@v
z1yhE7or9|_@@8KInJfOFx-eoh73?)Vduk#GjPEZey9y+Xr{_s2far~1YJ+wzc5e!!
zot;lH?d*kfMqzK!aIfwg4pbR)q60}gSL6DFyRLBk+EB%S`hnrmzVqthwD*1+PSB6b
zD%i}B&tN=_M7oJ>9LM!`Lb^eyh(LP|dik~fw*!(w2#Q>lRpzh#l7aB~b9mUU%=26h
z#?krAec<`=v!KM4P8BhQ7JTRrj#|7SeUQRug81<|X{ONdglxr^SYhYe^!<UmDZncc
z!<ROMo`7L^P2C>*lB4msmOz;)A}Kz#Ile<#wVgb7<KTd$mm*W>88t}}t4q19yypFK
z?zvhUTYjvU3uE%lp*8`r(70ADNV<<L)r?lW9&2t9%89{#ttWOGoth~3J8=BRDJtT3
zMEjs8^}WUH$;Ef1@IOwU13A^=^TU!y9_O&bzk1jRZ5wutWdqCBweN#yrA`V?i!E&`
z=;kVQhZ5t~<X#-Rdx-XUo9OKHlV&Y-+D2Bh6h~+@1OM_xk@naDurC=iUy;14rRR_a
zL;bv^ba-Mo5ggeamHwhkwoWjNY0i3?8e&}gU(3iCh@r#r^^hlt%}+N$9fVF<Zbp_!
zdGZ_Lw(&=I$G&&wu8b7;=utF<t8T6?qYTktoX5U(1-s%6-&+Bh8`>g8%+cv$yF3CO
z!2T$G)X(o(E*fHX-Jdn)UiWcTBza5!Keh`{lGpzgUQ`>-o$j?{1?FKE6A2+X#379$
zTjzu}#_>0MY2h#=_^$!%d`Zk|1k`-6tZb-amMfTvo1HiezVW`5lbw56hr`x{BlTqR
zH+KcG537Y@-kipEbvNb-9_WQew|D$6d1HBpeuYi_TCF8jVT$hEjdzz?%<ykz98=(a
ze(cEP7!&wTE6FSB`PbO{?(w#e^|r*OFltqocOHI>!j1;vb+DvqNtKyjz?Ki)sdWcv
zB7FGg_O|GBc9nObp!tgLs{Vs^j?R2wJkGchcNk#Z1^gFz`xuh!flve0I~3&vOyRU!
z^Kw-kTZioho&y4vFOvy3oaO=VT+E+Lvn_8c#bg20?nB@C%<{~WuWvbj8aFo4Xp#H0
z_=xBf1MTj=?Z-yjEg5%Xh5PC^m#s)Lrji)1wC&SrUeZBSUBnTp!C_WBWWw?S8nfq2
ztU%7Ez2@IJ9}%d@nOsU%rI|Mp&uAsC>`*Yd?<#$`o#!h}6e(CV9P`H`<a&*o)~*vM
z785nN?1~`8bVJnw=Epd(A@Gcfm43zdjOgv-u5hpAuCv@ev<s%HSne{Do9@*v^e7D+
z&dUe~4p=ApvK)TMF`_GM<9yzdBpOr65q!uJah|%k%KoFFHUHorfUb)7&jmje9)JA~
zI%zujsXuPZMTclAJK<F(P6T0r^j<{;P0#5>S7;F^L$3+@=r#aAdloO3&GPsP;|LF7
zt-vMB%+}II%#&TSN{Zk=>Gc`7P0@0tdIeOe*LeDc=x(kf9PlB8_Ts?Nc%|Zow%Uuc
z*x(L+;@rac_d)H)a2FJ|=Vwho4RUiQAV}$62rF;K<aZS7){{NrsGA!$iHARU*xY+z
zv59>xsJK)RYeZ~tJ~<aPaFhNl@)CXr@f<^9L(;{n9v>BqO?byuOwBfmWt;(UZW=x3
z{_7JT4H*|HO$aS{Dc9+SXTQpRa_nU?*cF7;sboHT5O;3gR=zsb(1bC(Ibw=fc@pk4
zEcA5K(=o*W|AW)<j43KYZsl8ZL>dZ_@KIg(+(#9Z&!73~R#;he2-U>qo~R|$0P^wS
znXa3Wv>0F8miM5CeEBB65#3y_`0cOtJGF^EN-P#`!WO-~kyD@Zy#1D?W3SJ@RQ^{!
z^2r2Ts=6<|;QmiJ0mT<}&M#6zC>ZKbl7N8paMFFh!;PO(R)l(QRFhl1QXOR{KhDDE
zm@ySO0^tuQQ_D&}<9}cc3z$7FF=P+@Y-{M8<yoc|Si+<v)@jw+y3owBV}BFTsg+#Q
zjJC{>y4L)m-IT3X3JK^@O8B+CoC|Mz-jvLMSSKYnRY`FLuHga6_NN)2Zm+$m1stp`
zQ(RP+Q4>?v6MztA?y2uE0{)8QYP{IY0KAey7dp{@{gGmH-Usc}YDkVFn=4Lwxw@{{
z)c8e$M8O7kLv*NIqN?gGu*WR4L=w;!ae8xKX+ia!*_YupmjBM=uYtHhgnk6Ln-?Df
zQU4&;48l>uSb(^hYAH?D{^L3T%c;zM(oE)zXLaCp)SBW;4aLrB^;2v=r#@eQ%kafJ
z&$nFf@*#ZTzW!&4J}0g0XJl>ELT$kJkN(qejx2BaZxcs{-Km@Nv|=yw*qQ{D+-I7A
z+!l4JDc6?uUB75Pqx(p<`-a^g-wD7s!<DiOBmi1fRQyhzf)#A%tW^0Ss{ZZizY$Ba
z6blsRdzYhpWO@0t5L-vI<qf1M>I5)sz0+(%TOWAwRVE1b1>lBqz({7UrnM^PwyILJ
zJAI`zNK@2CW4r9KiKi5{?|zMi;IQY&m21IiY}L7X!!#tk=Z|h~8^#p}k1=i(QoKPb
zal2jRigH28M2_nik4$?5%33mm*&5IPgL{KP&z~*My?FkEi*@@C?t%_hN7D8fur0g~
zwg-63_17Z-B(sJm1?wZm$|LeJKbUz{cO%>>iar+7&Okxo?>H$FdELsO5rI$?noKrT
zwkQKk4-q+4M$2>UNDG<_Z}-nRqYYhWxTrj&MJaai*u6xC${yD@Wrt^)B~L$I3D<}O
zyvsO~@Wz|F4}U#JcL~lHN5I_b{zvIk$*bq{U_nRe%u>Oye`41n#D4&AC=A!2v~xNS
zv$R+Ou^JI#>z~%-w!d}&X6Rpj^N#$(D(-E_jhE^-%Sv`>vNnJ~qMiD|0xZ_D$d#+^
zv)@PTP2oP>VE1M?Bb45f2Wzq98?XE;Xq>&_nzN-Db9(Z?k}K9cLtiRkuEYhcQuO9w
zl9prnler`*i9Vg{uVZIkMk}e^Dvqfy*ID*&cZEt;=N&x|@6S!SP~t;sEDK@wsgk=&
zf%j?P`W8*<rMBpIY*(xp@onvT>p4;~Qf@?T6?UQoJCR?}M!R@a^;ya{tLRL23J4oc
zJN*iT0+aj+r;X=aPs*t_c@ZCzVo@cxc7aZMN)EEg=Jw%bmXRbdK=g7Y^HPK?CQ955
z-LzU%ZjnC$q^RKVJjLbbEP&z>@z5M9wP-&@^cNb6A(&Ys7+PA%GJPLNU*LtN?Oz`w
ze59cWcMUV1?7wve7tw|n)$9zK#W|TBD;T*tNx!p|I*cVX{02|H%kN)_beMlwO(AZn
z3-9{2J9V~~LD7rIcJN?TIqUqf+QziAJzhIctq-RxU=uQh_~b3@JeY>p8D2;#2g?UW
zlpeLW&a0({vTP?@Y~37L`Xd^X6{#Abzt7M4Ofa*vd;z<q+S*JI-4mhR(H4*IkIJ4>
z{Kn%qkE-mp1fx4Es2Hx>B>+LUB9Po79H?Y>C^qo#g<Vm$Ytnj}_7(mVgOp5xa^+Y4
zs~8%lk2_?>lUZ%pV=jV?wRNB?Q!&16Qe;b6Q%HUc&x4vE;?tKWbFP0Yp=b_hm;iR5
zV#g#^dRA4Io6lxL1+C(~dk!M{r|Cdaan%rOZNm>Bi<c3q?N6uq2y}v1>BT=2RNT*P
zZXd@Uj?r^HE`tuIO%~4+icVAnOP#*1_Fko~Lrb(v4{-M&V_9a4^QoC&<T%dGPT5xX
zpzd0#h#u%7`OlEQOz{<a4%AjM+d?3rk8hT1)_mr$&UyA)%*xk`uPLGZZ2?hF9t%@e
z(@cw6#|fe*_fEkhC~*|enx<vP_%M9;hh8-QihUm7hlJ>N?@nlj-j@q%pV^N>($qaz
zq)P{%PG9Jqtn4|@ST;o|V&Iv=AcyU~IJ&jB-OmBDxkzvCxodjgClCtjMmW0nF$n?t
z^;Za&H-)f6<TQE0Z794-TxTE{1up6^r+5sxb-q4GG4nfhWg^>}l#;3plTuaRu_b?+
zL5SA9$2zvJ2}usfqdd<f))>5ReA);_ZqI;T2B!oYM86d{o9@9%X)06iYI+lnZ;<);
z9iJaFh7PJ?Y<_J!ghNApdXfS^rk6=f)ekOUV{!Th)&D&l|GzY`Si-+1xoE15e;+PY
z`9UxxU|!mPAfUkf)x%7XVFrHJc!?^N%#V1xp>1%sGT~>0=_fd>jaq?hlUGIS!kQVE
zm%-+H0X2NxvJrvbpPH`^=dbZ{*7Wc=N!ihWHN*d?9og3%jnSO~vfhL6!tP}b@2l;!
z6a%NfL#vcjEu6;+HOzZNy&ubUkCPW$f69|W?W)>U<;LBUI{48wU5l+?CqRpK+APb5
zWnF)EzGpR@Bm8j|uZNUXV1OdJo2igfr^g(msWF5X{wey^8P)CcP^&8Eh}FOAA+7@D
z-YKep;mq2T9Gzu7;ma77z3Mj;)<a#z4ARNCUWt_c3a>i;4{R@sf96@}HZAuZJdp=H
zwL0q&fM~=>FxkSsL2aMq6@ko-(|S&GZFA#1+4V1DpxJ1Uol?*+q-Nx1Gd>+>5r=RH
zai$AjY(zK*ORf>yo`WIpK-Hn$EAv$W^p%sxILbg|rTLoc(0V63tY&vSdTAqXu_&G)
zN*q%>mTUi&(Wl@;zEMEJZ0(<PZRajiY*cE?0Ft{kgv-hkqncGF#s9(CTLs10hTWQ2
zfZ*=Iq4D4@Ap~tK5L|*=<L>V6?(XjH?(Pm9++Duidk*GgYHI&8$NhHId+=2E{oHG<
zYe@!6#5l}eittbVuzcXOw5)mdY5M(3z*!n{58f0M2{INv-yCBeeXcNSW*6nkIEWIS
z7xd<R`E>dfxk7|v?UM#;n<MK}#8dVq4W(9UE%G|PFsg!OeGc4|yv`@n!R_i$hfs5*
z6FC0rKvQpykhcS_NvB4!%xjs9@OG5d)UDvOhX5JdghUT5B1Y3E6t4_<r$2+s;zvap
zB?x>wkUW&rH&&C<b$KFD4$?NRtG*JGU`g`6kTOY9<rK|VIUIowL^vFJI4AKjbn-$%
zjaLMPCF)6+3X%$jp#)F=Q92FI4ewHn>G64*pFO})PmHxKa9$%3^%0}4zCB~+)EAq}
z$?<uFxOI<m&;AGXHClZZL3PhzalUfeRhn;)0AW0>IU#)d7{<-_U>~uf>VnFP78E?=
z8spc!I>bLltPs&W)1}{Y+|<cYuQA2GcYb>b-c9aGlw*+LYcz~F7|&>UlcPNrE_baE
zEOt{3jxWJyi))}!Yuv+BT<d{=$}sPh3KG7_&0O}>PgZ^P)FhF7{Yw@_F7XxT-dhN5
z*9T~NT>xrzMoF}GkfB33Z3}UwFkQI2%J20o9669G-PaSGW;9fere4s|{}~#MhHOew
z-qpaNwZ?iDO7{J-q@jRi_+q&w=TQTfden&=%bxX%T6*(_N2z2+%ycugE$FL&zi1Rq
zFKv_GfM-;U8>4XJLtj_NySVXjJva8vZ@=EShu4zk1S_HEAWJM4HO!v-TF&VTvM*qa
z!?Scrt|G6;b+5(`$-vJ)kjVTW?7MzX$JhLn9=N#Y7p4VWMYlPvuW*p|3YHqWGKpXf
zC9YnUJ_&jFhqfy7GDBl45?2~%mer@QV;^YgMb#m=$f(!Wiv1GLDu;|*b=*ty3}mxv
zFg^9wy5E(dz<otEgk2@-s$xxb7h^9>mF2Y5c%D+{;A_8Ik~Db%YmEi_jd5&0o*qdi
zGU{*u7Z(D4<%a)rOI2klR#iCn#8byuQVK!Y%2ZdEt21ek(q1(e^vNS?Fb`xIwi%8v
z#c}^0&k@sfZoe25kUr3Da!ePmn!j0{#>i=-7=3|^5)P(zW~<q>vbTV^XChf1(+jc}
zH!|?jU-xp|Y<(dwm!c^sryzsOSV2<E=nnhBs*9neMO&u162e|*K%f`BSiiihsIY4;
z8v^<60?vKH4-&Y*2xHHSJ~gJBaZ#ogVwTu{{My8ur$cp51~Ft|B1OMMj4$}anHSLC
zrO^*tt8FjsU4%PUf>Stg?R_fvuJPU&y=md!<6f#GAESq%R2O7gWFzfd40)fk&XD$B
z_wSFrzqPqacsCt&RSj)+Z8c&+66^Ef(p4Sa<ML(O7Cee;CHD!Ch>K{;f#S0}KOoFF
zcK_Jgvq|Z~wA31&hegz3QT5@xohI<xP@}{}_nq{N5UT_$<JV9VYC1)Cw8RS<kVTDO
zA#~>zP(fb5nUY1t=_@fTY+6~{-WX>aA0Ou$(6=)`QYBWDdGZ7fQCCfnp&*S5>jyrA
z9(Jtk36Y`2dZuc`aNd)t`2HTL=LlE_cWF3ljXR!MP_PAS@Xrhd;W0OqJz0~M6IYKB
zX95V8DLwGu!iX&P9(Ne>UsrA5i<hkCNq!a&f@^ydJ=~s+LB9Lf*lWf3qv=pMLK%4e
zm{;?ZQZz4MJJOjgadwEn?t`wmmCRuXnc4FhwRN-sK2(wL44zN_5OGzjJjhHOGrU-4
zD-^C|cNX10monC-4D?HZI2eRBEa5|#0JB+B5tfoY>G79Sb=|&KxmmjwQmv(POFLe!
zk!~j;)vlnR8l!xCd`p%lbD`0M!8$Sp?wu?X?v(1s97S`Rc*q6ch9m_lS0QdQz23?i
zl}bys>sPjG{iMMr-eCbC7kmR#aiLpN4m7u7Dx;}ah%cA_s*QRxUmCc`uTNpd;vM*p
z{|jhPG^k~)-S0tuTgTbvr+747@}qj!^tCb0%k_hBi3r0%Q<jC5{RM3*0~`r*3(bpT
z;l4j;!w=_2Lkqhb^kR;T_lS6ode0*&i|}2?r_n`y3^yS6_5-9u<a&}5E*XCz&5u6w
zr!c-<buE8ji_yGnqA;Q;3bQZ`g=XwYQd>>DXiZZgx9aF%f@`tspi+O_Hv)Vw5=3A9
zZ=EH|jGU)_b36FU78D}i(T|5aK*@MX?rDk(cMIFbuR5veJR>H%{@mD5wq_n`aA^@p
zckF<DkmuM@O}S~V1NJ?hs1ZLwo~4Q`oM4e*Fl`)4u>IY<i~pcY-J>nhWy8g^?6%?~
z@2grio?nI_MExfIW;gm?F_8v%6EV<oV?oE%AhgARjvpC~Sx#UlBv>7tw0Wx-u#MkU
zT`^_m67ce#Gumxf*uUxY+BHdFkOGhdJHI$pw+lc}@DX$rh;l<W>7uk}TLm_mZb9$j
zcCTNewmSr0hZ<cRv_+Ag#!JFPEq!rN$9nhoZmFg_<Olw}`Yn^*7flr<b+G%{XR^x=
z>YaPda*L1)p7w-zlt5^WJJ}361;0#&T=-2=Yzj9x@%Cz`b<(1x0W-U-!hbGsR7atZ
z;nH{}A$a)eJjl`w@&CMY)3)xw{Rl4LTB;Ais=dsJ2?4-T*=R2#SaOX%T(DKi<+#`(
zKgHEqGeuWGpw6=o9?+#HSBNu2*_?fS`(!=evplsL@m7{ohUve>n;FeS=z}5LlHmFh
z(7s#0NA;7Ogyti-^v{~qYG-H1fdt!^J=j!mg4~H6OBE%DRBb-_zKKBG>?h~Zpfi<h
z@JhEsZ#K`~OyE@<_;>W1OkEx2^lGO)3}zuA^})=m7XxQQGmp?*K#W8z=T-^ZlD+Fh
zFDP`NOUq*|ZBW};N!%s#2sVi7OkL?@<&la<HNKytfpz0-yvWVT0rg%Qt_pw6u2m=4
z`DCH$=b2(pN3*(dPLxV(udplCL)9x%Rvwk+lg3ncJ6Zi?S#VNdqc$09pgp27HRh3g
z)mr<0v<Zx?<+hP`Qxxv#G;u%3TaFeDnXb@)g?8&T2qAgfae6U4+ibvSZ1_=-iN%w*
z+$@L5nx@_6@eX+UyFznAzGQ?R#nw$PW_9s<VXzy8K4ow$l*^&{Y86%Tt;bhnY%FX-
zVpE@oO8DkhMn?AJXxaguD$@lq1>#k57q_-}mk=Z71*QZCX~y--StA!)3XAX0e8nwo
zo&~uKeez#%f;!syCqq}qh9%e`)iULh6|3c=gK~%h(WX`v6K!zK$x(~+%D2_$k8uJ8
zwl5vk#5D$@B%#{n<b$MWX#wL0-{Ck}Pcaqji{|nbrKr*hi-TC022t89cUi#!^No)G
zLA_;N{|9vu@G>8Z#uz%10sXw-n3$I@<JJLb*1GLk`Yw2w3?vmF5D{P|Hlq#!b_M^T
z>xJ*D%)eztnwCKWMyt%}bXz~*{0DXJ{j+VH8`w?Vtrj_k@VP<R>P%5-zA0J0yo`fr
z#mbf%!Vm??%kQQbj`@|Hk&QP%wiHMmV&ci$uA6rB`f*_Cu2p9#x6QNvpte(C9#&mr
z@&~H2s6J02$x~Tx+$39EYibn&#X)E}@tEBe6bYGDsuTH(kg#TN?$2|;^q2*F>S=A(
zij;QEm%)IsD6w^;@M*KTX1fWJlT{VU`OCi@Q4!q;SpJf|cQ~;TQT{dTwj95#tc>}J
z<98bn0a-O4E4p%m{U#>goQTEssgb~8t%=y+F1GS5neGMakO*oLOmNGIGM){nYzVtk
zRxBXVcEj5cEVE6@EWi7LLGM0#P+1-n<>EZJ>20sN&^0SYmC4cW4-PasJaCXzM`L`J
ztkSUhR<FLPtwU8`4U=ez;g%ydUr^+`aw=g9E$~kNnqJILpSq=v`W`>`bN6}E(eAaV
ziICL1!;dM*Fu}8BI!|@LhI#A#1nEX#R0_^-)cu`-L!72Fn9tD2Zc1Hm$%B?|&zF<*
z&X?LrsoJA3HlCf3PNm9){p1QxUmi_DP2f{ST*RQ_+{OA7DTrWn`YmTYs+Pzc7`=~p
z=Hd0bVGP@sXUn9Zf#rGh`eKFH6dd_}sx46w@<N|&WVCqlPZX2$n<du#24M^C6=p?M
zVVE_>GzS46xl_?t4TBO7F|rM)nsv|Csk-^Hv9V45b13*N_3p)cvAA($gCZt$mxA|I
z1<yrUYdoKOHPbd*rH-qq=zg-nD{Gbj1<ePo=?Lt&*o29cVgQn^+v(7aFrgrs6YOV_
z&vR%aKeRO8uu?r;jpWngC#t?31_AbxJONvFV`Z8<@kAEGI=#GhpQ?sN=?LmrNdMpq
zN=~VQAHSe^{|80;`gvdV7>C35wdyipSf2N<30ap(Z(Zk2<xC%;9${T3(%J<IHys7{
z0^)TxPE3M(`cPJaqU>ndwv_We3qlN-tAMzm%rJ*hLaTqOHkr=U`cv`;Jd|?OnE~)A
zd@ekxBPy7e*Irt%`AmBPYol(gMoBI5h@kAAbI5tz2{<^#?Si`PUS4+gORRx%kBzJF
z1W9JOfzpuBh#W;}sRUHL*=suz`sYC)0>3$Gd!;p9mOZwU1h{w*N7^)6QCwgaUKSEZ
zn0G(72%)>})`KL08Nh(9gx`L}#v{(1M)c2qZH0M3)c`5IfreOoTaFy%+N$4cjE~#W
z=ll0=4KW|&3rh+82K^_j`?K34eas3teorV}Nhw0rIqjEB6w&LXemHcmNCVlA`zH}{
zjNR_oP1fIyDaGHsbhos|IhkMfGn*G0i3#ikE8OV3S!hY1-1V^IUX}$+))EJ>1ujn<
z&f+~sG*~3tMFiC#v__Zp0!T3mlkZ;UdBhFC;$Ib~4okn;{IP;fr^szA>4iet@F99h
zkq2JIyEL4Mb7NhQ?Z>3Pny`$6-#wS>A1Q+T|DaIogzqCcICpeDO>M}{8M<l&yOv!L
zm_0woLg@@ltgmoG);ofda-*_0IX$QqSw_1xHcrCF<|?%yZd6|hYI*W`7+YQhp&>C9
z54R?1)EL*BHfS-D%-i0(>U;s`SxyswT-4Gj!g%EmC^U^*va~8pzJfeM(T=T>n2jw4
zgNsvbAG0O;b&m<oFwP5Zy8SS%;ku}qWCadc^*(%K#|AIQw#5={NkTAzkTBrwOxv_^
zwBc*gj5~2CkD}*U{rP#EMGbdVnKo04qTa8lTCtg!3BFf@@(O<$iy!@G%};jQ3TT;&
zyKxQj+VCE&Ec}<3S{o_ZCQRqvNsG=FgXZp*Te%%SS&=sUg{xk@KsjcV8QPb|nM_J@
z`>{5@^6%{{!1XOx=5qBB0=8I1*g7aH)#XuHyM-T2WEU?l=|KWaPZJa`UMpliZZsc<
zDOj1wLheXsZ@iX`(UTLUGZ@jQ-qaeY;Jyj{sFs=G)(K>3F63usWkID@?dX8A7nJn%
zi>O<d*pucrF&IC;lkp<W-raHDTLj&J%QpFa<Pz^I$7DYcZP~inRz?_QLQmZEL6E!;
zw%=Xxn{>I{I<pniUL;2tFJ^09yu}$MC)((k<A%=Px3*&pkDjtuRe-4#>SGge&#j)&
zd!>W~4w(2Q6RG^du{!5*n2G=DjgbQd^UB%SSyd<w0mwSyM#7e|*U^du<Rw`W;`ipP
z&Rb{v#yu}b_3O742rGfw*EsW~?o^JFYfC{Tt@0d~qTV-tCXxZ=4lt85+;$c~npZla
zZ$&wRJQ2Y7aSU*=kl}YTwtEhkdHaCTpJ(%RHcWX`^k2Tyh}VGLYZe=#uDL9^^kP&M
z`nmI~2_5FCjQlH7Yo9*E-TA@pOzPiKv!W0p2FDizY@+4O*Gb<S;RZ~I#3VENFAlAB
zURm$45#n%~Nw8+I@+-4ps@kqk68G@j?DCaoqfoxKR&lL-IWD=tx1<Wg37xGWLmY;w
zmb_T0vivuTe8RG<q5HkwET;n&h8r%^{m@36?GOYp#V)c`IUd-RsS7r28f`rNhMDoJ
z+tayqIXO~X#|S0(h7a^gEGuNkBJGBV3aFZhjcMmq7eS47xOQY{#NIR$Zgq$pI!*Q;
zVRMJI3r0O1!Rj_Pq2`ncpPG@^)%=$BUUE*jj?n#VF)AY)nDvmgU6bhlY}EYU!zk9%
z4d=SopqZc*G2DMp6~x|Lcfh1z4@mV9uZ&ck{}k<{pzn*?;#um2YKn2?@SIBoS{~GX
zxC8;5!yaJbR)k-s8Eviwevom`8yoaJJy2@5tvPIK|EDYO%kHaVkx`Q?WkW+Et|Nh-
zJIQi*{s;$gl4G0#T*N@u8N<F)&Yxdb0@HX%($Di7e1q~t{LjAL<tjg%U4#U`B6akT
z76{xE{DxSz+<l8!j#D;Fza6*|Lz%`7NihH91w?MKve}_gWMVNcorAd&E&tUqtm`OV
zR+NU+8!3Fb+uD#ejXj5^$f#zESx#$@XN;KQK8GIS+`OBFv1NE`uqhd_`PMnlYWZX_
zB3#0I)S_8B*pi^Zp8aoQlmvjrF2pzr{7bzM0x4|SCDx+yaq9TSK^226(X7j-Zk@h+
zu5_O#99hoxFl4;Vx9|{V$T);jGFVa#+EP``_?_KHbGZgq&ioYl*2B=F+u%`W#b8Jy
zWqFYaVJa{rVW-m=(!OXTUN5>=|AF<Jj#0FEy4M}pI+=SC{ezPUv$|OT<09lUU!N4F
z*v3mz>XxmxZ#V<>9?UqY-vHJf509z+a>?UR<=wNH^96irApqoRN5zZI^d7!;>o@mc
z%UDIojCfgSMk<i$iY?t=6TLqJnzs@KGRfm=QNOBus}L(!K=#?M?6pEXc+!jr>yUIp
z_J|Hb6O2-^Dqc%!%XZW9$KS)G?-OznRzar6vtE)KT_Z7iZ#9>bSB+L_2@5r`zm!aQ
z^3!#vH#I@jcZyiw&?=ir7PaV#6Tm*iM+L0$RFYCRkn0in4G9>NXj&(;2n=v8_$uKN
z?Bq@vkw3O29U4%C32J@9Lh_J23SQ-707lmW>kD`639hv*Ml*5R8~aP&4~1j1s7fw)
zui;)d>Jrr}!tvP3seY-|D>=#L5U2m3)K28jlr_}NZt@wWS+?IuVC3ICr}U?&v&ZMC
z>TfVu(RN6bt4f`$XHcTj8XH|vPaH5x$_K$lyE68F(GoB|+rGZ~G^rV6y2OFwpJT==
zJFnL@OI|pBHwbO=aOAXSQh`4g2aM1EodUMO{M*h*`I9P`lD+8d>hcnKG`-NB9<Yn3
zJ?@G!rmfl5SmjgA7E1)bAx>{Q$>9^CNIQ%#JYQh-9cTbYRy{&Ww@ZYu1+dCaPETtm
z&a+OjH)J6q<B8Hllp5+4h6ZT&mo+He^Yt!9KO_1}sA}F+oxV5Z8;f&nLbSks1+ci2
z))vkb>PIfX@sd%9|MXUMg8PR^*axF9>rb@ru9x1lja&+~%}sSAAK;P2PXQHGRi(f3
zRC0;dmlETGr^Esc=E<dpbFu$~PgPt;ji@-vPL=tsqa4bqW03nJNMQ+y38rNBDNGA=
z@@48t**k%wnP@7`d8I5_1huvOk;Y@k+a=3&#cfHIN^3tLT(pO2dvk`c(+Vx;misU$
zJJ|so&f~$S-Wh*i=pUqiPFDj;-n2F)Nu{B+zm4R5bCAyGj4mx;8iW!u-?A3hU_OsM
zqEu9<=JS52(NKC6=FNwA$l=S7Ts4oou4d8y1mW&-U6>W&HV^P9#@y9_)hv|QPv_a=
zkxKi>_@#0fuH)sUr)apylbvPc<=`~ex7bLI;`jo*8srp8wYBpl>Ba#}q~48XykM=a
z^zf;YWRH+H^<YDZHE+JVLMOIu)+8w-QVdBZRZotEd6je%nD0m4(q&Z1u5i^<-?=j7
zL1L;~R$5acGCvz_4Bc{TrQ)(yp>QRn*K5`RD6_o(K`B)y@E(#RTS+u>ed9cN!W5+r
z=rsOvSF7Z1I^Wg4p!kb)UYP}gBH4yW#_XW7Uh|=Z#y{caazl+vzl)y$N-fxf#-Xh!
zz6V?->k$*6iXqImn^Gv-1DJ+;v$rXEZh^orF$+(WNnHt@UD@((mgq?|0v<Z~eLjhQ
zmpBOfqz(qx{xonZG1hdJP!>L|C|t>d!GBbmo9A`5ByBKmMpsF*8{cR9FW;-+H<jwf
z$S-S8+exP)oLV}%7WFjpp%^#|W6^cm+-x-Q@RmPkm>1oRY-k2Z5t4pHQT1-Zj@lfh
z53gA7HAkbeprjg%xI*{ouN<3$F6TD4e;OdxNk(Io+Vu-DPIM=`w-Dx8r5{+s45V<?
zuNC+r9`aCaSp!^b2p`qOH)~<{VKD}-zbTaMRDZEwS&v%IWAjKOxVpT@Z7DfT&~#Q=
zEN2h4CW#~ydViX7P#QIgD<ntB+*S5qh~;*JT}Q*#^9ho(JRIJnUD<3$o6(Ro#XfUM
z#T<%*$?4qEI(m7hUs}o|q8WPVmojcQU}v?>-Gx2^YgbK|xj2~O7RDzBGbg&csU~-N
zWhm4)OrHis9E!L{Suq}F6)R_C>03=9H{Nl@kq|-WsQ4cN>wf$MTds&AJhO~7ToO40
z?#YrII;WfmWbqv|%x}Nrc6DkyTuRuoMRm@c$yu2b4YNh_>4J0r%r>@7+b(aPWu0G?
zwk;i)k|K&Gb!+#KD5W2*buQ6(9{srv-wwviH^;wChL<Mu<Jk$cf4R~woCAIpV_;9i
z;RlyzON5fHhnL8r$>EV6VQ~&2>MtIvNv@^N5BJ}xr=ml#iRTC#eTto_C*#eZweL%;
zy{YZT^%TJ$elToQ8CN?-Sg{kJfJjFI!I5CTmjsP42ZxgBVM1L(iQldA!sLr-C_%R}
z_I9K8unO%5*^^9qlc?@hy2}<ow=xewUM&y1-f%t?D>c4PgtZ^p7t6U~EvfPWCkc0z
zTWAB%)wN;tZ#0t)*dJ6mD=E`O6`M0Pj{)t?N}CE>g9RzC=<}s)O|A67QByma(-yP)
zcEHX<JWryiMeYWTAu7aT^7`oFjL&ae9Rub#R<tE{<6K~Z4>Z0PBpU_4+>2k_%Rd2+
zdLCm&+NB$V|3Ohr9BJ@05Ilq(haVLVhG50Dks&pZnZ2=U?ti%cy*n)kLAJik;;sHT
zw=t~u7Z4DG<ozUYHSGGnjtDwgg58gu(8it14|rPmttKNU;c@JmKLY@`H3i$-JK7%j
zrV)gNH?dcHDyQoE%|pXAdSiG6WfCj)qy!gMe>&Js+90kqzM^8D+8%+O346Cmqx==_
zqkM1&U@b~!`BX>gO}0IXIq^xFT9$A#(z107iqu1G(P!^6z|G>XVplg0-*|pAdr1oO
z&C2!3ln|9d$MSa@=Da1yz(E8_LjJ0oUPFi-5z#yq;93iFl$~-Ym4-MW2=NC9UK~WQ
z?<)-17i9ph6X*G2lqT?*E0W?ks^L2S^LY;Qe@8^rMAqe4E{_2n^|4PC1j+=&_5KQh
zFIPHWaJB2WRrj33<?PH`|57YJ(0zAoJxtTEG5off0NBxKl}Fenj=8cH<}IvURNDUS
zw~dDPva;Y|ye5(JTWb{?k3~$!*JXc(Rmh%WW=~teta7(`5lf2JtpE^uXhbnBfv($_
zBw%bTYUbh^*><Zsu5Q>y=)pw15dbQeqx4}jLg~TOSf9@0F7eut9si+Cr-Fnq>QvRr
zyti1xvaK#<4KuMne1Mx$rnxF<FP<^^42b9&7GjkYDKekui)I_#6<ZfVlDFL@y%sfR
z)SUR!w&=v>fZG@Y_thVIhuYKStjTeu`ozmXkqnMRTd+N5yS0lH(AEyLyzWQ$0QC9P
z>6m2bvs5sgQvR$RF8Z<GXSnz-(w!93c(MkUZ2bd$;%-Sunm#UtUa~nsrL8lr)zHY+
z&=w8o^kQFR&0_t%aV|L_jC$9Wo!9d}D5Pz(NVo~oO)91?G`{(Tjj-Y{a@#mvZo;~(
zo6npeiFo<hrkEGeRzc=8Qu4p$iBtW^8D(T^@<Qy(8s|8S3=`<Y*DV||n$gka->vtD
zy{CL<@~UuSS{FG-8;1HL(~dG>-;^{RO;~2NCFI{(L^S8D{v;@m&+kjXNCwQzk8vOy
zCPl++o%yWeD!OtKL!jt%xEaK$o4m)U<}w1^GurW9XEEyuuKF?Z(#Wl?&TDpijBm?9
zC^u=e7n~3;y=_ui*k0Z4M{bUacL1rAs@)Z<32kgzgA-#1%uwhHlA&xH_Y>2>&K|jG
zk_lsD<mCW#X596Z29BKdJUI_-Ej0LJ(a6o|+t_3W=f~s(HRifjJQY>A#G!O?C1GVg
zC`hpsC->Rii{bfFuW8O8h&;;r5Dste%P7E-ESSMPxoD@UILqv3`DmtDhN~zXc)?Kp
z!O7Cd{^xK;+wdho5xoWO9fNP$D4GvC_Oz}j+R%wQ1;Aqa)8Xr9BdK~Zq1<-vXy@AK
zOzd4L5LVJ&A5Op&s%%tP<)5>8G{5sNDKzG;Hryn&sN1&3QDWMQl4Jtv&ctBEuFW6O
z-aakMNj&uDUK4cEM&6X=+%GCChX5yw5=M-j#rdQRv4+7Zb_9(6GrytS4|((P^zNxu
z#49b1$zmp}<o#U)GLwR^nIcVUtDm=S3;uL@M|3)4WP(0T9*%NR{u_XgeIE~!UP!m~
zbVcV-Ri-oM-3U&h3a&$UHN@6rJ$(0B;z(vt>CfFqFj6z=9dMWaQ(E_QuOv2Lj+M>t
zvx)APIlq9vij)C@_8&Jz2~qeKEh(zvb1Lrf74VP=;l%O9-)xJ)U^zpTxO}Prf_;GT
z@5%HvY^^oTv2SgI7*|x;)(;`ju~KC=NrrnQ0uCn%+M3c1)coSvNVx}TV;h8<38$cG
zD<YS{)iS$CVIAqCK9G{kO3GA-$fW-;JTPtjC$co7CDhnG?yUOB&A%fqREZz)60Y$W
zlAl-W!EJT3e~M}!Bj#C+goH_d)@f8f2;>ctnyWwmmax0V*^QS;eIv3y|DoP`b@Fmp
z%521PK|2Mu)#@1rEH%L#CN;Lm3zO*K37{{xwHfo^V@-R%SzY7SF=rPTg3g79D6;o}
zbYZU3@LPh-kVY$$miV<mdvWStmbi;$<&S^ZkW!L~gAe&`L^2Z33VjS_FXT<nyPEx~
zt*L_e+J-&5%s+Imzv2z!%AeA}(uh*+x`iia;*Ae`{gij5Cp+~~s4_B6ZRqI+hn4lq
zsW^p9kbO#CJOO<virbbxNAtrOHOLz|XHa--4t>2LSA!DP);crdZP+kxkHuY~<p>u*
z+Q{B#V^n4F`X8T@)py1jpu&yvqSkMa6EuijcbK;(uWM09hEI9Ex$$k6#qsm7ESX&l
zUN;jU5@dQB8hS!bg=POx!KnfPFHmP;aj5<g<{w8}dTn(7SAeafpzPO9W_;XIN_=(#
z9f<}%ED8p$Z8vp5xhQ;RP+1*giuS%scwR}I;v%swuv8$#^ua1i&)c_uOj<fwo}Ff~
zJ`e=7_vx{JodIhn`c_5~XUl`^jEGEPPzpk&8I64bwh9*-?omr!gK?b50WrkTF+s+P
zz*QAq{!4^*^q*N}rsjxLR8{RopxpU6&Mp=mdHpb>FO&!qGshrkXmi{jOwtemxVoST
zYqcs<^*Z`1CJvklAP}{=3blfQBJtoU^A)ZN8^K-q&1;38sfM$PDzkwkJ;*Kn3DS}P
z&&kyemyxM$tvWQb=4`#j-!`*&T)Wkdw7!DwU~CNU@`o%*@3^7a#L_coabGzpjjw7K
z2BZ+O&V}q+7dwyg&i{$CV+Octk|11zXB6JP1u_P<MubE;L{r4I4*eFKaS|AR-ZxB$
zRsroflxNVtXriZm;t-Q#B-;Syw5*tZZ}s0E=C?B8XG3qd1BG;fQ3j_V4Fa)Eo484^
zRd>@^PmnEN`syrxu)v7mTdfHHUyGk3zl@!8wI+j{NCE{}&6Kv+m_G|}n~nxDOjGTA
z1!rXDFM@^=8}h~82ce+wp}r^SuhJ)|G!smlXuor)p4AMM15Z?(<#5^HkM!ha)W^aO
z!S<==<r_YPSJiP@dXb~KD82&(fW4e*Mn<)4<Scn}s{uH}tYMxiImUP4n9{B6T#25v
z_aV1jv)`xO_$>{s$QZkkb~eK<WA|h`3};0kK)h*YhW>Fofex|ymfU!s^l>xw0ORl^
ztE(0vsYFOiTeClLePkGg(8kMt?!RF}f*T%u#NijNn&Q;~;R<RjnOv=6Op&Vhn?oK5
zDAG-fU<kZ$U4EeNEVIRNzW3-U0Cadv5qB8sds1|7IXjW-3S^%V#9RKoX`x1*q5|8|
ztb8^~_P3<!wtv9_1fN;gM;*tgy-B~Xu1qlPc`aPH<f54#+fHU$uqXDu;qR$LS~>M`
zP-KMAbvd~8@*fl+1@#b}Cln+e1D3a_A`-a3S8oqd=!}~E1^0wpD|=6Bno8=OwCt=U
zouIRl8|+4GYZR~Y)Q|q1DIVU-xy)Il_Nt=Lm;*0|@C_KOb8Ou@BO)KLc=6Yuc7f@B
z!gaT?MQWb)XDqwR=3&;foz8jWt#kB3aVgsQMxc*TcT}$VItsgFNnfwAHT}2L2ELPc
zZ>|z?oLwm7FY=|3--6Qrvt0ZCctV%Gf?gFWU=s5$$AydOL4D!~nt11_CaYwtB-eW=
z#GvwO<?yXOQrZfNZ<IPFdgn|=)fnH5%PRCvbs(cQ3+aV49Yr(6@c=GZ>>l#;U^+fe
zyhOP)3aGR@Sn3$~oDeL|8%JQznO-SBdBi$tzj{~YPH9nu%RJjWQp(6(aIdb<zkQG|
zF%N42L=d#>1R%hYs?42;PbX~-Z!%Cb_VP!fR`7~q9=$A>UBG8C{47UzC5s4QVmnj4
zu#gy2(2t`wJ+LVcLOH76JTb@#H~tf6VvAEYz*hN2#T(xXJ%TJZ9OOa{8*oj$q<VD$
z+-yb(3fl)HgMhz+fu_yjN^Q(^q`m<yd+B#}T#H$S3QeC=&Jj9;3Vs*wlaQ{df%4Uy
zyVmy;B{-c*Az0WKWo0{Y8++NnM)qJ77eQ)O?`G-{#b{%=3I>1A({%il?5P6w5uWOj
z(-OtmxyVafkzdKx$fXS}&M=ZB8@w}``5%d!PoT@eyf56!A-`ERnApJJn1>=fDflev
zgkPGV5N7OXQ1o904^w`+!>GX>Hwc=a8@AUZr2^f96#lP%+QS%wxRw=Eyk+-X?!HY(
z5}mQFt(|U0nOE8#9MqxFLk+~>O^~%3eKT>FKNtYdw(eOr$2+;6*!^#O5FM;>%@ORD
z<3_#t>V_21(Fh{O`Yr#Xm{}iG7SH)M0{5b7q{Yu0u*G-jr$1^VBrV@vHN%V<dF8O;
z?>^TR0*t>HV;BC-?)Gv3ZW+%jZnOn%Pi~Yl_o#}j6_fPYl_7397#ro*gVPQXj=fb<
zsIMF90;2K&1KUt&!Wu<%wM&Fz^7y<^d^|uWs>_<vPUyf0Ux(vM`Vt4~pc!@tHBC-w
z+j_Z6S_mCJ2|pT<bM-jcAffw=kPwAmFIpnjd}$>xk7|Oe8qA%aHK)wKe0kq;9Sc1t
zL&n;5C(ku8=DZ@g4d}}bC=xw1*Y0>5$<pD(*jN>3N<cjJ8k8-uTOc^QDYrcEm`Do4
zht1%*k1j4Rv?7tcAn+Cq%ucTWaG^URpr>wr(J19G)gMn?G;YL)7tlKhFgX?Ob}SNr
zyU1pv;uKVxA2e_?Y(g?S=H6FsJ^JM!AAMQvaU#exG5Pw3ZlA6%aW^2=0!wL#>P?dS
zc==k%=n7;DtM5@ICBWwLJ?hvWmv`Ts%mF+hupnJz&W$=^S0Odc=R!^^Y|51Z^VcGp
zGO`2niU$t|U30w?GK)$vGglVGKN{41B~lx~T&>$l(NzIklrvB?DoYW2O+g(^gUMAJ
z*~Dpfh^3FEUumqJ{v9|!YNdrD^do_7AWb(L-b=bt9%WQm^#8WJRXB1_(n0u(HXi$E
zbK=e3fSmc{_6xY*y^rly`J%`*$Rv8TM?K1SMOt!FpGO=zRIUFI@>{1kJmzEP29!!%
zT#Q|uyXVuI6tJniaZN<fbxwp-9DPhQnBXet^^ow#{kr83_>PwAd3gu{*$QP3c@>%g
zCUVe&;JEAnu_Y=M4UzyvtC#8wF+3hk{pd%6EkgrX?m;xy(VZ&&zxm=W04G8z=}EoJ
z3m_vq#-F%=^f?LOs!a2=Naq{?B*vE-|8J}2%@bo1mkqJEA*5WRI`%}t0vc^9^PV%?
zVywU{v%rBYN=4Ilh!|KH^JJ0`FPXu%(?WAVZcy?n2Qmk@Eqn(6#=HYQKmaZZ!3yL-
zlF*Ixd(JKu0#CGXM&wwp?(u&X$VTW10(5l!ek-`VvttYrovXgWPP%eD#nL$Lf!_tb
zi1Urz4evy8P<8Nznawh2vUS3C7I%n}V-Hwnp93eZaU<o}d_)@mPLcD$?UKo8Ca%?{
zmZg6yn|!V~Jse@95{+Lu|ETpCZclh|K8Wx+J$ZYt;8ASnNtu_G7v=pMWT`{8rwQkL
zV16m6aFTOhiFgpNx)(*bF(x7RUGCGM=m8+{B)M2&{6VLMv3RVE=WcbGM-BvPm;he!
z^=|}&RGh51k|vX%FjJ2s_Y&``qP{D3%`F7)u~4=cChbc=`kaxglvb2mo!k8sFxT36
z$uM=|+s%$CCOhD7(urk9YBiQ!U~0jw>E5J|65g18gARTwYQU054~6ce2n(zcj5mMs
zsfSUrAR`cw`9e)$Ft<7LfGZ7SG{w<Pg<e&0+*YQfkQImysK5x%6O?X$aia6n*?OsQ
zF{3A$URHD?0;O$OA^D4go}QJaqD2Zed1JbPVkAqiXF2XitDYzA@=E>%kCC<(`HFa~
zpxhv+;`}pb+w4gx2U)i7&jBy&hr*ur!{E1tLlpXxBefGA)C+de!JkqkmUmPi94gD%
z+mY=YGh_0Z&JMo2MTT&8&T$lBZ-bJ&Hi9r9d2qv-SIL-rrTD<)CiU$evEeD&gYOkh
z)CLgScC_$1(|&rXJSBzwQ7`&sB+RdGgd=A;u^bzg<fcOr#(?D8^CoX%*E+H8gjT;N
zvp|YX&G{D=bh|YTtrRbAgkHlBbAgGMYKm}r0^FdVwD8=-%Ik^W-vLr}L9T^~@JPZp
zhH)=THBoaAD+YM;e&t{83Idi^u2r&k6qLtstKFmXsEJMJ(euHH!lTJDu)vGgpo$!W
z(U2Tppk);Hp?nMCB)r(f;%B~JaIqI3L}sYoh=~Si$%WltPDzZmr5%|2p6V*Vpnq`5
zX%{vP+E5g1X}~i5*h|y65p!`hm~GV4`7wEWJ9awlPWK;_ywmz4u-@5aJ>|N?Id*-p
zQ?11!goE|acQ=SM`^Oz;bPD#G`Hk7Dr}$+NLklY5(;*<)uIC@)`72r!UQpqXF(%5u
z5S3pvkKoK9LM~3H(d0hDxCrFX&N6DletCLhM$C^!RHBPh;)GWDqX)&0l!c=_o(M7F
zQv8415&hp^`RxY!c9GdU?@`afap+DKw_TIp`h#)^d4K(=X{xwDsEqJBn$^wHE~gqI
zp-P{yu`W^UwQ$6aoIB58AP~;Tu6V6aF=YXJ_}H}Rb-$ko@={$ZKU6cyG-m-al+6Pn
z7l#0po7(s04~B8`H4>}_AhHvHHna7LAuZpb$gruc2a<F`uEIxkv%Wx~n=c9W(179_
zNvU#p4VtQSX6Merx1&d)l_1f=VCR{6N}uh4-%*PB-E5!lh}uHw{+Se4x-CsP#k?9N
zFmJb22JP8!>UqXOL@3UdR=7)r*QWgq@z7DkuVt}zYAwT{tMdt>fe*&TEu~Nl6QB>O
zDWJRFX-;7IzPnMh!TgEzk~6CG-YVA8)f^%kGet*+x54pq9wq35%@NM50Ld>xdJ2|*
zR8~ikxe6oLj90I#801wZ@&E%4-c9nP5sb9^o$5%*l9i%O+xRoteF=WGk!enMb;VzL
zNcrbQ^h@_mL&M&cFjp5?S-gbO6A!xxHfStYWC^<&5XSQj@0#j&3*#ipVzvqrZ+vah
zj+tY9!iSmXYQ3FfEN!eQ1(GNP8{p-+|41|V>r8`4=YPhNpgkGju-7a2ei|YuFMSGf
zFqucOi{H?<8rzo_8`UvcR@k&f>zZmuJ!Q%Zevtkmk7}Vk8hdiR?m}m5(}-oym@{dQ
zn}cT3Dn(+OtcQ%2-BgFFOlz3U4i$IQML~@g)z==6P+p!^Yo2_hwCP73$Z)vp`N2@}
zJU@MrCw-76u{Y-j=Y9}(U+frLetfD5jdLAv3YoCH8><}W_@ibPF;f<nbmWLP6p8b`
z0Dq(E8!+9%-L;t`^6gZA`X|>nKSreP!49m<N%9Bh&&xTlp#6YL63w~+f4nF+=j=L;
z)sXmK@+zXae%@#}&LhcS^IUpo4~z+L$UabttZyl;XN@#jFvlDX?EOAdUa%6MS`Q{O
z$_6~6<?#RBzocg4tdm+BbKMD(7JRCbp1Izl{uM|Z5jFM=;T82HfV?o@$d0({)rmjn
zi@JVx-i*)qmM4}=3u>u_>^SllK}<i$$@EZ-S`3h?#jA_8J|^Wjg1q#+adSgdu@fr8
zp@j5V%rr!xaU+r%m(b`*JrdP(+a*mcLL7WlWOdQHbNIyFU8^p)n>?9#Q7ONU^is%@
z!lIv^Sr-+WO!!+Mluv=c^2g3`lPn5QvH9yYBI1ww9uiET0MQz5U3g5e84ql)y~c3b
zG0SRBd#WBtX+n}ig2j5X&nhzDDQE9(g=<IpLn5<%>9R%z&z!v+s`u=sOqD-x3Z<mB
zyYTW~8>|6byY@v#_*&<(iov5C7n~xRCI2UQxuL2$dtLtKX9GAQELci7I1VfQDU!75
z4>5N(H(sj&K*@>0US%8%v!KTbZK(xvalS<uZ$R&qfMjB4`7e_G4d)p}EAT+9<-fZe
z2xl}Iuq@LJ>?EB@$=9Tt=KV}vLbw)C1;pAX2JG0Kc2Uq5sJL`1*4{t@uue8k)KOUl
zM#M3px6f+)U*T-QLTm~wWp+CTdtrMU1S6=-)VS9e&xgbC2W4vPni>-L9A5?Ix#$kf
zHrX>VHL=$v?Yl18pr?=AdCoyxi50kdq9lDMnw$@8D#KR$NJ{E|VH>U)CFCz}SL-M=
zB<$T)<w1rG*OgC~>XFo@{R)B?6MN}usx8gUtzWHOcA`W_agrF<<P=X?rMLO)Wv5qw
z7@592q~=JBlPgV?alcFJPL!<5aR<LM&dS6}vUTA?{5{A(kVBaQ2tupUmyS$~Sy}x2
zQ>6nm&u8b=`3pyDx`+HFLviIQjw*DDn-v$H`%Va9xP6OJE~Fv)o5p36sZt)rG=>xG
z%)UAC^rEEs_CU${Mn74`Pe1ABxar#AHYY+uOr)7B5pEIw0iPii$+d+Me-Xz2puXWH
zco6&zS2M6*U*gQNQExY|UZ=x!7UdkcC9D=&4AI-bur(iRLT>AN*?d3EGq-=dvTwd^
zWW18WNFu`?Z=%yrM!W{<@o3N}J<6QRc0Fx*fP94FOduy<_-$$SG-hyXZw9|>sMRLQ
zG_!8K>+7+FgJK`^m{kl$+c(+B@fT)#ri)8a4`)p254dNA-uuejLNe`z<j@%h90qj+
zJ#=(I)#|d`K4U#=%2xaFA9TAmS<U5!347TTX-`AN8qZ~2SrxKz&C5$7=EZ9Yg_2zB
z!7Q1w@4sx{852XRn*JG4=l8JlP>D406{S(PYpHw*EFriRc5<#M7&Dk*;2%S@G>s$u
z6|M=7<Q}pxdY+T|##m^VOgr9};Usm2v44np*?j+)MAmr1Y~%01s)$g{NLc75g)+GX
z1>mZ~!B1C=CXTSr-%AY0TJY}f@@Y^i^{r173%?|C_3}Sd3XwHx25ztXo72>J6R(vz
zu>9@}1*PXeCU<7oklqwD-5|I<`4SFA8Q1&9HX3PKz45AwU;$U*U98KzKoxpl(m`xU
zGstsWjqCdJriErT;Z;eAQ^YiknukgO+h{<ZD1SJzCn(L!#-_%(iP?%qJ@Tq|9#{|d
z87V0na?-qL)YNZj;b>D&5|f`uHsG`5KJz=etyZXi90oUT9Yp2sC;8nSieL#Rl~H8h
z{k=-lsLGqnvWv?^X9=*mQ{nOrVP`yCt{|V}dz?(#fHXP08T|*<1Y_)r5yu}{W+MBs
zzZpU)?DP=6`v!F*UUsTlK0dYiLzH0iJBCQ=>x!G&+<#E{=(vR4j*zinzU=?+C;{;k
z{a^Z1a03Jl-DW6{$q>yuff|6G3T}N_nf$VE-kz0}s$xx#(t<z?<4jiM1>3kj$nTxO
z{!}p%LxA8!F#V~qag_ctRGq=LY-QTMzu)@p-7lCIYA56*CXF-EpWcMYt>FjtT`e_w
zdGnPaY&wfI^S&}s=l=9Du@rtd9p#PDTbqFQlBKiVDZkrgk(#p-DOKHz`wCC__7L-V
zih+cit`d=;{!duHo<W{HEj+K%x^}w@Ze)^NANKFaUXuLQ^k)>grbftN)R{HA5^dmA
zpfs*v63ehvQA112lX87?ApdHbP*%P+8mlPosX52G)+yde|L~8lIVD!N<sP4c(>cVW
zOgz#PyO6(Gt_?ph4Wbn<h`%sL8kySk*Pk`VWrpBE?O9e8wO!p1TFWadAr94Pn`S+K
zTB|$!m=N-XMP;%i17sKqyq`vK64P1dUa^teiz2{fLWnUjzH4J2_;6&wKFbYjDbG#+
zBvp0Kv!XrAq5GxesxlM`YR><J_P;;BMR-&?jp<cPW<o1$Y5j1*@kd<y0oyqN7B+IT
zFFMEW><aYB5Rrpym(sWBy4z!8u(85D+kC3rHOIp=7zuH2&ACZ#NyUwnhlo?bBCjEv
zMVAl=h*3hWAY~CgoH_G^AzL-{Go-FOf6i*J)ZZ29ep;&7`|DJ}vk5V==I4J<Dhh*~
zi_X)8-WsM7S;u$^UmfBVWS1N33bC{_#gn7ZJt*`uA9lcgKp;NB=u?pTQSQ7z@AM4)
z-q*|nPd#-0nGFoQAHCm9BCAG1lFhqvXz59$CXeH~x`7)lNmd7e*#1=0U+;=V*-mt4
zFKtT@Q{k}quRbm`>cqCj<Kz+tpguFMbc~kQE!`E(4cz*DSh&0~grx7LALQpf^h?4K
zHcxWoR1%}UC*5+{LvB|r=OZ^<74}45<5wAG1j9v9#}KsjVn%Fa9{abj)Vlld=KKx!
zsc3o@eEJ)P2F4t%!vtm5NCS$r=&g(<jrf9*pD)Rr;9=pc9n)JkE>)9e(2`0jp<rED
z&fTtGJuBFk=YehWh`}1shxgy4D@<A+{dML%7N&09ye!_dmKqwe3}W7YWgy(&Rv3i4
zQg{xvB<*C2irz{xMMV;`(x0~c9>6+j4h)@j-6;DHN?C&f*%Bwy4NaxS+_Z#P_w&@e
zFxIsY^Y!IIt-8w8G{CUrn#A9T2}mZJUY!0n#N5czVaNNXDd;uHX!1gv1PtHeA|IwD
zKlN7!>Jo4L`)THNraPMB)pZuK0*PA7jP1Z>F{Y35i&DzdYd|lHE&%Avt7g<|Qw_>a
zHqC0yJbY)&YkHu)bTxEE^$|?@S{!P$DVaXMRMQAf{U*$Ef%9c=6TCtjt5qcU_&k3E
zUBMjGE??zHm`6CO><{|M-Hv#@*}myOuNFsjr6-gCBYTPXq9&euqQ(LIwmyN>XqA2H
zq(Ag*U+MNH<b;7GPR&xu5$LU(RK#P!B^79JIaf!}-=a{%@Uyz^PSQWtU%oBIAl*N!
zt_NpL!*a(t>3##;oIJkS>3WloLZ&E%YyTKb<7a|O(x8V?0vEI1z*)V<FSg0R0>sm&
z*a|yS&~*-9+Y??Z>L1<QQZyn9-6ZNw#<nAj40-5!7alUNd%@o)a5szXxqwraB?4i@
z`!y7=k+C=?9X&5vX==bpP1H9FnnKd0Ch6gq!=J8s(QD9ZC{;rPk=~BYZ8ql6<8&Hp
z4M9Re;yk}7uq8J5YTobZ-2*71hIgBc^5`jBkI^jN7QbD`d94r@!D7lM?3}!i-b-Fr
zb>+QUN9TGk7|vF{>b~h<ZVM^3)}SHq6W)wh)<^Vo2eY#i4vXHNJ*!4+6U`sw%5W78
za+zDyi<y`7nJ`_v9g7aJDG&3XJH+(Y-f0poZao&iod@9NNLfyrWC|T0t<aZGQff1A
z#dCz~J82EoKXRo75>kIpcAK|c+bDA7TTqf1gU62u5+gk(Zd`NHNedB^l6?(e9-4rG
zV-lp}GhO`rOZ3phGNU0-NhB-Zd%%w8{TDlYsBX@Q`G?*5y3E|&72@9Cvh{ZA^X$}g
z*<vqX_)`vv;rW8sFdF!}lD`g_hE`)Md#_`{R#Oqb&6k}m`8H9gGMZulRI>3?WDKe1
zkUq^rYv)9Qa3iLZgqiRtx~&otdEtRXs8s`FxFch>D}+)rE_YU&A(b8j|3Mw7q&kBx
zUW4DQz4H_rD{RhHGIZFlT(hcD?@4K1A-x|&s$Qh0G%S9mqEGpJ?|e%<&C2Et3^Jp@
z?-*>&;#>u3)|YQ3nL~(#ZZL;_6Z(q_DW!f{1=Q%KBJKHeQs-#qpf;w}L)StL%<%e5
ze}2`3zf+|neFBFy6p=8DQ#Nt|^2t;n+l2vgf%aX<#|Bcr2ha>s<9RC#usC#vltzTJ
zo^^_^Yl7Vz&la<p@P5kNpoUW6Jl6Tp93si%aqBXD&!TZ)V*f$Hx-a4)5THBw>lFmx
zAbc0;oafj&Hx}D4<y<W`Xwd$bZcW01<*Y_K{YV@eehfgtZ6i@Lw5t+-*PRq9vz_Ef
z$aEu%>w8f{bLN_tf<42NEdEON>L9Tg741Q?*S0-c;1HmVK%)S%vAQ&c=z0zvn32jK
zIZLz+=MBR*b|tR;tl4*_WIB(Ps0Q;FaaSIhnomK$(ui|H1XY*P$8fWw;7|uB95W(F
zYF)<)3sG>GVzl2|o@t3g7x^}mUM14J%vM_Px%;>G@9BcEw#nh`6;jxqAz<uWk2*A*
z-nho-jpy1w=%uine=UxIITnn5#00~{+tfZ)ZpIEY%^4g}1X412(}$T>FX&Y!qfev2
z(B&PY4NW4Z_U+z5@|CPr-zU6C7h%~{vMev!)-LS282y@!9c|mx+(1q<vQVZ%J-@6`
z;#j*yH#KuD&PoTW{=>{_G^c)uH(Foye^v?b|4uzP^blS9`Y`qTQmBj~z*qn0QI_v2
zsjrteZooRdb>p8lo+2XE7|ix&$*;FB(JJ@j`yEcEC<k4!uE{8j*q4{~K19=1C80cx
zf?neWgx@?F1DEextJ0UHa1X-GF#TIMNo;cd@(+Q25{IE9qvf}6+_vbX_@#@xRZ+7g
zBWyz*hy;VOY9#B9FU+rbw<f8{P=)ZgJY8u9;pM0JO3YXAA8+{^fs`b0CVf63uM2pJ
zQgMXea-vu;)kWlnjDs20ltk}K=Fe%fe@AePv1i_$(#y4Azv1&eQXZgbMDtZVI&7>%
zZ3JXJ;}%p1+F)yi@f!0$v5Z*m*XRGX@^G(j4`$mn)dNjw-gPf7mdBA{vCX84oG30Q
zzFC%Y@Bda`{1Y!M2(z`j&+pIDXqpw}Ow}6kT59&jI5kK4uJCA19WAwT@jGrcnIaes
z%z4uY0&4xXK8M?+2zEnRN{>c;&wW)LBB^$s<uelZ`wuFr=Ct9I3MM7%3j9v<=g7Q`
znH;DNv<o|&u#{jsQwpD^_22aWIIouAW(-f-^t(b6TDmU1#ko7}a1R#yI-B|T{>TPP
zX)2&TY+i~BW?RIlT{BOw<I=9J*jmH&tyQfZ5#~lhiuvZBx8P~}U6lYcqj6k~-RNKD
z;dghMG&VzIt+MT8B0+p)MxdhsxvNG>C?24i=dQ8@A8$^9jF^7d`OpjGAz)ba6X?|T
zZG%Pn=$PI;TzIJ-p;i4PInzsJc2SSHpJQjrWNq{+7tn;I_m?WzM#e*?zP_#7v{jY$
z3k&7`u)H%NSxFLo*&Yfv>t$?Y-7v%jS5_*@CS@W}rm|jVz80MBwrUlj&=aP~A%HVC
zD1K3%GzsE5A2YWYtvkHVW8(FEDq@xH-CU8&RhM<dYXc4XYe2_NPza#jJbOF(*Gt;d
zOgbd-q4BZZ6>}Rq6oT@*Dd$GmUA?|LsTi~BqyI13&MCT*C|cJ$=-9T=vCZz-9Xp+l
zZQHh;j_vH&+Of@!JGRkxpNI2s#~F8wi*sM=p&n{g)tYPm|NOsM%s&{fZt2cmyFvWl
zo(@M~`1dDQ<cL!cqGs1>CTQj=$RvC9Bk#Ck-K+Fwpv3i%%9UH&-{uv3{kPoxX7wEh
zI2s_+DoWS6LWEZVvp?_t)`aQkIEFn(?wEF0XzLp=vjDB7DL+G0X<%m{8x>kj&*My!
zyhn%;9qK-}z<=g4<upPjA@ab`;l&~rZg#2Px7EHPO4-VtXmueFL+76Kab^`oWr+=)
zm=k!shz9F<^kav=JenMNZ)TqLVTu#wim$aT62CVAD3k5jVu%iM;&Ywn9^F+kE)#!)
zcvAhvRF~~j&2d^9MVwLA7{PJZLXG>y(;|1OoQX?twF4Y8-A=ws&K*Q<4hx}anX_Ce
zM%WNgm7C1q7tq6W$t9@JRS-2FF`;kSaq$w(p?VTjLDO8&23#UXpVZ-#q8tMA9r(|4
ztE8X9fKxk$c0xZkQT_p>6FgH6Fiz5AlD&E5fH&8Y($H}s#I5&LMcuk_+*%rfHrIEg
zu|{LITp_1Jah{q)u@*2_DF(Xn&4ki<t`Z8IrUg^3>we%^J(Td-DvHb%vS{@3{h7KB
zgM&fhS!<QC#khb4WTN!?NQ&>%0ci*v^+#4!ZQ|vvXfa_&Uu?lMz3D{P2IMlu5W$8C
znnXQZ^pSX$*_8f^_QX!hA6&|jahQDJhr-%_+dEqLNT}>^Kxq9{wMTJ#hs7~Af_x+F
zQaT0Q3%ZWHN@&hu;uad#{ZZcuT)<*LMDY5$85!JcVz0r^M6OH~O%o)n#Kifks@Pl6
zzx#^^Wl-y5P`SS~IGr}PuPZUBW_C$Dd9j6575Tlt@UY4y$6?u{JxBQs)n*&L#%zrL
zsV2Jv<(lfQZ(BXZkc&};+z2=!2#)=w<2Cc}1BjX!4c&+g7)h^7QV2}*p~(FdJ3r8D
z89Dtl3&L3^YumHu=vA6-q14Be4H+{p^Ohm~kXXj^k#u`S81r<wfZQrd67%-Z42j8u
zenwrcw+G5)Kkc_AT;J=R)4{Trwy1_4NF4|tvLkVx<Jx;q*_`UvfgezUOkcqMfV0-;
zn#=XLz!*LXV*W#MN*dAx;b=MgAuRc+m!_rp`UN-gmkT3c7#`$vfgxV|!%TOw{P?KF
zDzvf@&-?zLO5@^O5aD?{IY*odX^s7fZ`Kmf+B9$b6mB*qnK6b}O8yUtNA-#82fKc@
z0=SBqz!9Nu{hXH|{33l2@)fbKeFU&!JYiK?=xMMafgI0@(D-$I!F|kew2b<^1mrj2
zS)~J`9H7?ZXQ;m1fyAw}&D=_gj>oWxf%>_trD7H9=`^3|PHXDAiV!=z&5M*cG=wGv
z8-5m}vU)~rp`Rd7A79yu1l7ZF?3A@c4S8O<S>0#KE8WK{cyl&gv7oBpD@G8~L`5Vh
zoA{Lx^y;LzLpt7_CEgv#i>;2ER6c^5KhkK2zMoB%FIn|h=Zv3hZ(;Bh+m*Uqux0nB
zPare#o=PGI3HG#yFNa+5ywq^tp+^`BD!(7i<Am`@8Kv3AUn@2pkafB4Qx3<-WLan+
zAjp%5z=<F_7^|1V*QPv)0qxPk7snrmf4N$xndWp}MvTQJgu|Fmkhk*Tt-!rJC~a0(
ziU3;rk0Le{)%&!}b^<Vboq0DLALS2en0p1Ulqy`}-oUUpt{Azsrn0w-rb6q2ajPeo
zEHn`8lScbgLzvAye;8Zhaz)wtM=ROKiS$I94O7Gl`dz}f$>2Kic-G%f-D5FZJ@bl~
zl{`I2(0@``>^SN!-VzC-TPZGDz4Vgmo&^3va(+ifPR-pq^Ih>Q<|~!`aqcwz2lpJ1
zK~9K|BD18U4MnzmPo36D7>d^G`?f~jrCB$PA%%nEf?YoQ7vEm#`SS~=8uKXh9Yn3Y
zD>$<2zynXObJSe7ER@BkxQN7ONxAQElr61MaAA~@kYqDtFkiGKup5*Ai}&RJ=7Qr^
zM_Y@oMo8OL3{zq+h1-X9L#-z8RWJRUU3ZQGwBz+CRvsD0qATgyd}@uQ3l+rRmM%QR
z-dW0pa+5EC_ZABY$a%1zpbidDP8GNSmTe4jX-Z1;^@mQ8TY1})*rq#9E}1@}rf@hQ
zt9QlC5d&cOFErLpxL@sxxHd5yh8-X$U{=RYS$!>K^(!qiY0%9v{r7jc=>CRG+fh1v
z=}o;`V1FU_%ZcbMSH)*$V%8QW>Np&Li#ILYD;o+jHGPZ*#<^%}OGk0zp>)063*46f
zMcX>**w@t?xXC2<3DeJjm?V)p)Xo0hNH9(tVZi+5;?$qF`c%i0tlZMuY5vr!8Id}x
zeAT@w_%KUOM^C@t^oMHesY3T&d}rUEcailbSGlw-kKp00`k$xM{s=Q`iq58?owZjQ
z&825Lh*W~%1$4=K%?t4_H_!7O;EH9B{oOLfkaL5^IH1YSr%SE7PcHiru0NO;Up31q
zB2Y)_K2vDG;5VisDv|JnjA$hK%zK9a6Y2T#PaGxm<E-8vPWHs=5rmMidY<!re-^wk
zV1aRY-?HzBxt^$5noBGlB0G4tSS>U2S2@j+L*<{K84Y7D=Bt1Ko10Q-2a3m|u9dEY
zf$kNoq5|2DeZecFt;ZS{xE<Qs(u3AVo)Ay;oVG~DWp3x;DyjR94aQkHny8pJ$RF@^
zRI#bhCDPv=2njLen#|Mb=hC?4@MG74la%9}iHNx1FSwT1y`zCQtSY))fY=eXct-Ox
z+4Z%t@+}@LBLVjt@VFr07V7P;4#N)7lXBz|tQR2UaL5~Zd$gdSVww|?`FDH1R(jIy
zrA`uWz{F)G|8dc&mt8aH+s`w3nBSJ$GI-R*D~U|?&H*G=fZz!ImK1<(;bOWYNxWf*
z%}(I;4KdI2LJg%zP^kF1n;RqO!Dq88C9+(##4Is<qrT4jPERM4Pn00tH<P)R(`<j6
zQRz%&++ZODW-t9+vW4INE=+GNIliqgId{nf>rv?;dZ6`co@;)hz|!LWqaSJN>mLe}
zJv~>N%nR&uD_o@(wK%G$G_GCJZ#qD(g+{Y}LW${5-COBF1<WFL-UAE@2{T?pMfd*l
z3A#uz25fs)$EYWXxuTxT(j07HxH}&u*zF}<1+<mmvP8+XHYJqR*Ps=L2;+-+Q7fr~
zG#KK3_duzNDWT3Sxfsj>d502pNdg&xbj>vcx^1$IcQOMZBQ*hnji{M5*-WGg^Sfwc
z2v!8aF}*l{^8sF7dH$i)oEqurup6D_7X>zOfAGu&M~MO8am1Ns%5tIPZ-f4<ywK-r
zwb4C_)`=?fqku2D(|yQeTur4C=gXh7mmy8qtmsJ-Ei$+F&ze#sHAp_nT5A%PBq#zU
z5RngpXT;UD#i>!0@`?wAS9g%j#u$^R7L&-wz2~XknfQ3b5fwYS4H9`c<{`JF3u^0v
z339{n@N3~2rN(jJNS%1&6g{MJHB`s5qS9tFOn68YeO@X_g$^$86JJXyI&^g#7-fl}
zV0VADSj(v`zP)7tLg+_@&X4LxDOz2&IIWu29L?J!<)oz&@IWiriOm&;W#<Q!Oz=B}
zUU8n(%(gF~GyK<jviV0d%U$*^3$2f(3{TMeHa=EvZp)}dQ@;O!l^B=<`2AkEPmcJT
zO_hb(BV)M_Qqh{y(B~`D;(C7<v?Q|b<lq(-TTV)ck-Us{_Y@QqgC*uTQ~0(63>LG-
zN|M!T%2;ero+#1Pq>7EYvGV0B7ad7|x<{PSIhd$~Gab+!_<lXoU*8jAD?d}y^*Au0
zC>f|-kB(*9;~L7AB0FF>AnMRR0#`1^*)vNSI3VC5AM#dIw=2^T#fE90hyF(iBLlOm
zYr{Wl`yT+JY(uCaj<9NtCrbu3R0!hac5~UbeSxA4acitxk8MB#kKFn2$WlReU;c8q
zJB4wc8EUgBpEPf?YDz#kZtj_U(#k)R6+bcjzV3eh!X!7-fw}$qZPfva%aLgaqQ!tg
z_D*lfPVR(NhY`UUzco_i8_;;BOn<fQF#_@`1_NBJQtGU8%>^4^4rsaOh~DHRvE^Xi
zVm+3gIOp9D&Et%!*<8O{7{_2X!Zd5IpLy5v&r6=b&rw@7f-FpfF7Y;AF&ItWt$uLe
z+FPq-u#GW7P;>zx0_B-XCUmnyTT}Y@M$xY0^XccXSeuE=IeNdRaIs^sUdrmPiN^?p
z540RO5C3Snsbfn%)BkBsFwNjyQTsbG2YqYoD>RBv)9CGX{S|3XXPSK2o{{tMkFxxS
zST^XiSlN_@&x~xjOBv~5EQcH)`gZCoHOQjLtd+$Ym*;casV;Y+w_nAcT86e`qIWYK
zhuVS&d`mH`i+QuCDdlZ4a07~!8c)aohcYvg6TKiyPiFipN_Rf;e!fFpjf8=;<r+o?
ziYZ}maZXKWOm>`S>8q&hT{qOSoS^e%S3(OD3W}=XPVniz#E*iKBa1N4T?l)CHe%gA
zP1{xORAcxc&(JMCT!h`4A92vsDVZY7_3vi8QRWhm&OA%HEg*t>{5MiQ$FbHlSXiaQ
z+f~E|+w_b&IReu$HRYULmif8$uJyKC3H?)C-g#b@Q)4?Fb;Rt3DOLM239n+>Uq87(
z>*G|NfmiqkLEJ>&GIChb^}88b=1S6D(&Q|P-4Zh?;kx8Kq5-0(O6l^>)s>^fn4*L;
z;pBgEf<$jU{jg^rr4%~5m$1+Gw9#ob*`;~ajU}fKJo9oL|5~3fWf%NiUdKttPHpv2
zm%N}fjeHO9v(-`eL3>naxh;I!12<FXAO0i$?f=?&@}F|if84{Fpw;NY)q9)HJV`+1
z<7_0{&F8B9fdAc>f%_kzVeTX?>~!1n*u_YRum#J77q;xD*opp>hp6E<KyU+0nlGag
zw9bkKw<aXVPyYJZWZlK1$B81VGc>IvK1mZl(}u}%sD;ei66RX-c~|QBD?3(LZdx)E
zn{UVCt@qpG+b6lDz%KTh;SN}spRNI4CHIBBZSzxISI}yPP%)hhr5NX93s6J22Bs1A
zg>g5{a3_GQiQ0H3Nn|A4lm#<SQOB;VB+DZ{NEz4CwLw1Zu~dU_qr0Pr<BbQo3J=|#
zBW-a`d<SSs>C;tfs(8gPD-FE`q$V1YBm*pUn~X;tzl;(9D5QM1<r`A;H;R=Gu|v9}
z_f__@)bHZ}Jll$Fq5F-7Yp%aLgcK#NqPU=Z(Kme);HA$1<(sdZy-BMpV}j6TOfXXr
zjB{3vk6k5Sa-d@Tr_w*b3w<{~v%vG+WyPKdy;a_C5K`-lF%?R{7x6jR(Fv<J%stg4
z8In|UCk;h`An#^q!>p+=bS&B88y<F_8CB&rM{kGAPbw*LDY0G-O$JAVDpN5!m`Z1N
zK~!q~6Fep)ZJ3=Y#Zz~jL|qU=wK<K11{qI5btYM&d*rQ1Nw1fe>K>@XBQgD+#O0my
zJRFDkAbBq>NmIu95=XoA&&VcoudEqj#Bj-EL6>YB=;^x5m8@ywoBcrUdhKz5qxoDz
zV$b^-f<9B2Jj*{oYOj}yq@23q-%ZxdjXq)@Rb&^3aUu?-le>ufkpTAMx?W6kSmEZJ
z<=MB2<N!gRNFk-=MBzD`Rl|wDo&@bIQgpZ^h3#L6evF?;TspN}?3k`uky1jT90Dy7
zEOop$tK3^LQLq4Zu<0}R)pE$fzB(U?I~}9UCcp9rIX^%^F=L`#8fj^0S+#42Tf+P5
z(Yoce=lv9z5q6$pqq3~qi3npps3g-{kQw{d)|vT_wm7)L1txYfh1~ZU6<@1w9>>U*
zjtDct=*Om8YA8`KgZB9~MiZ6r<H13&WRZcr{0j>gzp_TRHw~hxG|1%&Yyu}^)M<iv
zjX)f4ApJk!VB1u~O7ER8?!$u`NrInV4SLiYtV2oU0{I!$Csgr9MIjLFv`(H$*208M
zT$2_<6dVBQV{jxOqI;*|EhfQLFUN`e{KBx3P@Q|5zyCBs=Alo+j$~+2iD+x%=;s{L
zkAW@~8A{^=SZ?9qhZ+UeCza~hu}4q|wY^;cJ$-1bmukaD_1sXeXVCGUwTd+2>f^X~
zvBN^7bjyzw&U!P1j&(|u4lLU+DqmzuH~DmxCZeQc=bM_hbPVf5sjo%5B-t8B6`6X$
zQ<3l13})jer@EBkpR3?A?`dweVHC#Phra{^VmqT9QX+eW>DQt1U%`K+N;pi(nI}n6
zc){k7{J|2kIcc<BC<myZ)m5L<4}q7Y{I4@d^jmc@gu6Z~lMp8#i(hHI4OTA_-(MLE
z&u=+6aH!)Bj%!o}5+H+Tas}*(obZM+5p<pS0u-c_flXoiIIU&}t~3-m!r6DFMcxFX
zyZi|}4hZSM;pqemglRRVzx2;Q?uC6Y3_i_mcaUz=x$@8{dKce#R2?2;2q}rEm0d|T
z=eorVZ>!+*lucUe+*sYkd2P^^Yq<=)vpw-qGBM@d2^=;rdwiT=r|jVoH^|plibeSL
z0DWCmuLrIUr>uT5rH<x#drKQNHI9e>@F;N}#au-3ztWzUUZvvCenIYonBpJFBy7`N
zqQ%L#rs7_PD|w*Xh}?-rM7Y~@9SBm;d}l41wk^ig?Gv?>-W?Ng`l#f0mQB0kM3`}P
zfEzt(i1&Ckxwx%ChWAY~^Uik3)K-Fa!VK6paT4K=`EK3TyuH!=>OjI@+XXU2(R}}u
z<va=^Y`fi$_8r|w)h7~Lr?#Zhn&1Z5Ht7?`g%h2;OQ|DbSH=_@I^4v6n^o7zD{mcN
ze!QXL&V0gl9P*hGmo=%eH`^3P1WU*Q<A`E((;S8_dp<Z$>$L1c?+oBZnTo2ZwO#e-
z-^%hL5d=<TOoa~Jw46;!W?pC~hhQ*ZN=~~y4%rGOjF~GKBFyuT@mW;dd=`IXwk&}o
z=jMIuZKo7rVa%kWI0H*x9G*=8pfyS!$;Z=|4mXJHDWaqnNN3WSWN`SboAwrXTNze>
z&TDw;D<RUfe_lufPA@uSQaiVA;>7<_=g#Twb~BRqDixd<lc*JjEA*{K7g3-_UAy_&
zz!)EJeG&6+&6Y9Ycz%;dC+BcoC-|c7@C{oq9?4D09kPTmJ~eh|^J6)7vcWw|4ShVe
zPcu3sIQa7c6C6C^?{V2>l>^tl<7a;RZi%?TFhy{=E;nJW$h{}AhfjunUj;;D5>pOR
zJR05;cNm)d-o$nt0P(!6Hp^CLhx?>(>9qfhIXAku;C9569(0t^)d=|A)X)boNmfSd
zMcao)GWR-lsnS@eJ(Oc_+!-pnym2JL@Nk}m(BRHV=ilQaPrR6X``DAZl$y_ao+Wa+
z4D_q43+G<pnwCJ6ZG=|w_>lu~OB#v&bO{cY(%O+ZFE1suz(Elt-Z26RHr3DQvDPKI
zx%Kf&UW#P875P<>#(e$^^*wHQ96_1d7+u?MXA&@f2T}e5*dwzDyjdm8I@up@>0&xa
zI9KQ{Dog0K{lAJV;Nk-9f4T=fm_`$AX}ZxD+Io*)MW>)V>18wI3gK6bx?K45%hLVJ
za&!Xj)Rlvs2^?xjDAb~+NO?i)%Jj=km7hAWTo0IYE8ivfU6GN80=}Bb^uSiE+o4hm
zvaQ$+QGY}0?;okgCQJ0SO)EIzvn_28S3X|{e}pEb?df~}6h9#N8?xW~J6d*Ks>92O
zyr^dz7J)w8<BzahUT*B>qRe~rXTyJ9*Cj@ocd2_{RH>XE+yxi|{R1R*H~vDd*&5pj
zWJLviR5-G7!=s?0Ijx;URURECD{@EWNSglxIO<mpUpKM^^K`}k+;t*!J9q8{8?#m_
ztR5d{aZPB{_xl85F8%o%;qol!IYF32_L`@J`jYu`Xrw#yH46Y4>Na~fEZQUgCiy{~
zqw_ny7SWACvdW|!f(Eo5>$jAmp(;lTTul>RLB2jNeuK5>5fghaNtTDhXQSF00(YS~
zu6ds!#1d*`RPrqPOQHUok~59ZZ3bVGbxG(=`4|1qt2cXXkMe$%u^YpW;&`-9M&_v1
z*66C5T4>0h2uWiDyeX_N!D_1(8XYkUV-6vVj_J-MXqXGX>R(V&jG8Ihf;O6-qNpH`
z+z@bUMH(%M3kR{3(irw#!<8D%5?8mEMGkQpNL6I)({#nVt-YnO9dRRyNIO`Cu~Y2}
z&Gxu57bUeExjhk<rg<Bl;*=`t7@E~kf+#>82iFo3KN5GR;1OfVV;4YnyT4!&Ku&(C
zMc%dqQnsbua|4+^w#lExN7bq^=#!c;rE+1(&|M+^KsOy)e(74f<s<v9OFdI*WZ%%p
zh11H`#!x)CJ@p5$tx?CPFfphI+j>pTtf)&r`wF?g4$U;6Y~RI+Qz!&|h}wW;Ugtb&
zBWOi&@d9JZSl2pZ1wo4D`DLkvKvu^QI7B9!gn~2e2E~UR1Fr#%0e2u_FSM(VH^CTK
zjGpAavv6I<2Fz5ILN_M$*mghVS${`87RsU(`|&Q(;_MTDTVH*61(eH-e40qSCR9Pa
zY8|QdmSIXY&U9FvcAlXWsZl!%U>k2~ab+<R{~g5IjOf(;q2a2x8U|G}CL(_R4`9AF
zL~NS=FidMRhL(~XN7YyQK-ph<a&wG-<A;5eZ;Lg%CG&MOPN*9m>>jXDj9h$Rm-j9?
zR<Lz6*&iILZxj-9zn?N1DWO!iGgKFZks&1UInx;ZZkOI0BZmi_LKVl<HFBSNf8((Z
zClF#Bsz|Z=FjkXDNl0r5G5RyLSsI782}r9_RB52A=OAHk4()?CISR+rO2H8|(Bsr6
z8lHFV6KZW)FC}zu$x6dCVYtr=J>SZv`_md8CKoHQItKHCG$QTPIk5FYmg_wDo>?LE
z(&J}T7jWLMR%ac2EIub0E*;pXkQt-rzm5ZDJ-H)Vp8K9$^0tk;?A_Id0}~S~#LM%I
zqPN6h^^89lzFd$9iEebHnHrX8W(t2#4O8a)b-Clj2k?t}svp@~zL&Rjo`Utzkc5<g
z8=UmixJ>m$t}Q}ZVTCVJ?f8^hZmhLUn|F)j$~1mTP|RToJ`zDq)we`y)r3ca2T|Vs
z9LceW8F7c?;HM|jkFh6r@d~RFu43~fghLI5Rf@%(f<AB19VVdv`X&yI!+X{vg0!qj
z3WcTxLx^UrDM`mPmpHzMy-z9lUWpQhARWAsU`R9QZ}1gEMqonGbUPO(MWr;>a<hlG
zjU(~HJkK9OulRh5g9A+~Cy7CNi*QSt1jBm_0DX)2aa2&fjrf+PY!At3PUJX(o%5PF
zo$xzyPLbq&hm7hLzA`-=6xz;Jx}~A)N^FHpCg2c!Q-$2(X`;%_FSjkdV}XrHBvt#V
zUdI?jgWI(V9gH8_U$eyF&f0K(Pl1gtLw|5>qv-WP-;Fc)Y@2MAPAC`|p;-=FH(j%Y
zP16%1i`poD8XNp^k6lH<Tu?sHWx=#N7>b07!*A$P$M_;0&9W^+oBpL`8Oi^qo>;^8
z<6<NgOPs!Bf>}o_Xa_Z5hQ7zUIQU1S_BS3}guwjwp<0<&r&|AJp6!K7nI3gPGF5{O
zlB#t%TnQ7=Q-GZ}(Nc9`7o&IBp3L<q{gg!BQE(q><>vY1WBp^gI)~&Gt&0a7Ab=g>
z9kegy)^yfk+46%jlY|;MFmS*@1VKv5NI>0BaL@5MN~~!_rc<L!afHF|VIaw&lf*zb
zt7c9weMb`YU0T)p9LlyTzT+?B`IThzs}%?V)K`T`)_-M6?sF6G)pLa<gG7gAJrGf#
zE+xv14VELlONM<bYc2-qBkPJ&MX5NRjQiLHGuXf;#I?$GjZ?*TRPy}FgK$ys_Li;w
zzqT3tmmTnb^TN=DMAK9W{yx%-o%i$?=o^$Gs54y`H7Y}IImL(Nqy>i_32(?9C|7RY
zMVpKbD!<h9$^p~PrdVl}KV-BCn+Wq4@_u8Uu1K=z==mWmq9}tW+FoO*$W;~4Xbw_3
zGi#-i>XHLacmaprAL>gP^2}uBiH`=S%M;d&%5;0=f=VBfWmU=BLt6xF23DPG{j}_O
zL0(y09K-fzpN<HAkpmhF`;(A2e^bl9gz52_%qPXs;o~p!eC=9A4xcU~fK8R;p+Yd4
zJeKPs(c%Pl6_~|F%pgKK9_kj>VU}8wo`AKzUqJ&rP<Ory{DIR&<hKB|OZZ?>dK8i)
zMfB^#xB15DR$TVcOh79;!^T<d=jr;EDk7wP?1*E`r)y%+eahl*pCQayGvDO^?mWvj
z%kwUU2&i;=Be<A55XPMwWLk|cu{u@O&BrQQ;*DUHQ;VaL;)@5W{&p329`mwBQ<SQH
zrrA;m-Fv4A9N;kj>aO~hUa>KfKqjSX(tDD`L$DV~^${Lp^{3u=)Ocj*9{$eTu=#>e
zGoetUfDrtV%%`d<*AkaR5zDSAN9d}ZRiO+Y*B9ClN9Qw@DeGWImp~kbafbEV5C$o7
zRlVQ@M`gl5)!J2bqc-HU+}ht0r0%R&lmcj0V@!L1DJWC^3W2D}h&!wUPc=|J|BTrT
z+QhnQCmeq)=v>vVlAQyo@Yr$Zy-t*|?<-ZFs4Bs0`6Uxps?hii`hm!Hxh7kigTuFy
z+Ttwlr_7ubs8Hv2VW7IJKqdXIakd*`^2>`WzoqyO=|48-0R|=^YP6<!SRW~l{;1t;
zsn|ixxX}gG>kCG<Z|p-D1eO7?$5Cm^La}6VBp0KQYxW(nsHbYi$pVnFcUmFwrc~zu
zi3dvO7nQv~Vr83sl^!K{$a!khHTGDzI1Png9dR*Rcxd0aa#`B%id%#jXbPCpS@-=J
ze7~FZxJ#)ZazUuuqb2QedO}-h!8kc!xpJmeAkq2V^z&w6Kk1RUY)P&Yx-S;sGUAZ1
z>b<(wL}ndz0*AMt<g5~6f>?FgU8NoPDS8p<iGz&+?<dH_B?MF1;*PXFo%@2*5BJ1o
z^WYxbn#%^`cP#K2KlQ0~@|>+PaTPq?(2u4TApq~Yqt?{A<6_^F&Jd*SgnRy$1p&_>
zrNmP_r(3>O+>U;bh;is%v)zrFsf_LGyZfQm>o;7TuGg5z5J~8mW2C77;mlW+j{Bp1
zoeuxI{S#dRja<$w;vDYEu+z^2a8O-QC^tUsXc%Xck%?M$k3=8hEnmJ|)x_pYJVgF1
zgSRm*Ow(|@Cx`k8vaP+LsReXvm;v65$HYLWV{RNn;e}!-cR|(K`nr*IP{_EZiNuDJ
zPq!6~tw0m}=GwJ^mB$U31j6#_(<69_rY3nxBa!L2$+hAS=%iA_M)4CxKE6|**&5{c
z56{#FOZ^(hy~paCYteFA=5i(O2`1Hs&%W@bwRQ$K^V*6gyMsIrM9KLhC3tWA+fle3
z+<TX~f6QGoUUW!oGd2^Obpzo$lnx8}Xe(|>T$Z*%mr^@6HzoQpjfaO&jtd^j_B-G=
zpSi=S)tqSkcen_JsJS99X?n~Uh)e@CPCZdW%{vN9`Sf1!&3Js9TK-^u|7tJ-jO&cM
zw8rg`JUF}MI)B2{9x);>+$T%=25bLRqbtNcBO7T~DnoGQkT@0tl^YM*H~41mxUMh5
zR99<;Hi92i%PI^@ig0$O%S|43ZdX=@^3|3tZsgH%mf6c!;;1i4Dw(L!t<DB$SzY2D
ziFQ*UHk_wkRrct$Y^#4^W;tm+eA!XK`#=E(%L|l>Q3KDb7}KU)en?8&l=I>r@ZH@P
zT160SPYqJQXe_^eS(YH@?Vlty9V-c$@2B33TC;>K+;^k(AC0f!D;;Lat3XPUNRPeQ
zN)A#Y?;YvXx4Yc-o71k0goPd*LIWH(9BZ@dTtBv>#RPw~FZ~B7VNp^uiHRgMJW7Hk
zPwlB3`!%o|a0Ex<xkX*nNwTn+^czP8f^=t~{QQ-x`?JC2RI?+n<yX8%5bCTS=Vc<n
zKfp#Ld2)oL_cVKv1F!#jZc}UXqAQcZ`eb@^XN24&T16_Qa1l{gd@7|fnQb3F4$sbc
zW@PbM`>^}Z>p}TTo5@=m0z4J+zZdDr$9vfK{Ks$jwwsS`d{L>^6(mkV@B`rdarN4u
z%m5uW-<Ox8-~Rxa;OPM!aNvDm$bb9h*5kTfPL^!Y&cUqqg<P?}i{V+5OVFVu7K%Oi
ztIb!{Mvtn7e}D)h*dS^)BNvr3va?CUmxsFaOscr)E%h~zjE4Tt_bRsfwrO$u8MHf|
zw^CwCao^q4sMQ`pFAe`fBRcCBD#&%HIB119ew8GH@pYSoplTh_jo3RNM|n=P)Tt5d
zZQ0j9J{(d=*?Imq?{{))(rc71vD-V9<_bg_tyM?C4|SX^G=!<pLB=p$^ChCpQ1w6N
zE|OzU2^e4!`}klez%9?F582Y#3(H%zh4%y!6VFQJK&TRV0K4dBPQK1>+t#$j#lKAR
zm?Na!icEocHOo_&x+ILz&9~a6JV|F3T*_tS?SG;O&6qK?0S-l%FMrOhIY&YB&86;t
z=J!xGzXY=%8#i#}w@e^08HZl_g>p3ocS`Y<i567rgHPvjTgMDB2WpqSgO65U+qov&
zMNl8Hv+4F0YaQG7z}z5Wm(Y&pW}@HGB7(*bTsb2~rKM$`MgD+n=NiWOYn(f+aAOIt
z4Zi0^IS7MXV-{zFqu;vYMM)MNIOCSdco^ayIgP;sgwQ_DQL-ABKf@$U?J3$yI!`>J
z-Q$yc`5)yXO-1A0MLp+PI~wYmGvqw=uqK0YTF%?(pY4pV79vQHo_mO`6}>w-!h<8f
z9fkX7sCl`b{dQ?;GyRnyE*>PDde+ZL249fG@##u=S0&AoS!a`Fx2Xm(h;M1vxgup>
zJmFgwUF9xi|IX4Ke^p{O8e*!2Hdt^Xw`zq;;8Q5A7ti(Ax;)NTq*?iSH0U1He`fz!
zW=vm*D11+1pOzMRGvc*sLjhY1*2w0jT;P@22xzYvwjtZH3h6yU8q45YwrTnFg(e;<
z<5x%GP03|h+TJ4{R32P9RIRTtWP3AI<qljho0A;}ATYh-f*cJVshv<~tXt(&AlK}B
z_*M*nZDQuWxa>)4B-2_9>nvTBYCm4EtNp|B!f8Z6SHLtjHB<7KayYrY^6zOuQCS#<
zou2eW{1dlod63Luk|>kSofa25uD2_Kv7im^O+|u)t%bu{gdOv7@<kyu8CgI((cQ5Q
z_7X)_?tJd{TT=6EW(g7^ZnJySx5|bf^T;$|q9Sa8cVR5hui--AW05men8!+pBPt5Y
z%M7~{*k&9o*L8u?&gozr>bNcIyNGxEnX+AkMF4AdRoLQY$0r*Ea;_)*^yk0B5aw29
z&n)ZtBN*9ZZCc}9Nlf=5HOq{tfu5^#Sm<!m9GV(9%D3IQJth6PPUN*+98qD79yaFT
zm|Oqz{&fX+?SdTGZH34xJEDYDD}0J#e*dz3W%E#eNvps<3EkWR0a?e?j$l@kTVP7*
zy6u51r2azy;Bu@;v>aAeu7Hw?e9n>D)~>pJ@El;AM=EcqL6hp%U`5B7SXFpX??6aP
z==?CuXjhysA4bbZ*Nc8iw<RFc(-y&r<2(jxW5A~*C9sN$te1S8_~m^(QCV2}d-O5Q
z+;(%J=}hxUEKH^i^OX`0GIybQ!_p@0=<G)v+?enem6_IAgi_(jQ``5^{Xn0?RH@yZ
zPi%p1CPqV4u8XSB4LCXU2gr^WOT+l4($s3IBR}H@J!_iO=c8W^w~B9W;imrpu8rQU
zM0w7M_p9o-#9(%q@#PN?G_2hvS0AX)Ry(s!U1kjM$5~jdZw*~=uiVk|$mv#{;JEc`
zfW0_{Lp(a;<^+jrMS%!R9o%Pi-LAHoxPi^ru#cKDnZh61C{noeZiO%%nX~mee*zEE
zqEu)w1fq;ph_~)fKAm;ahG+r_HnC$O#YTw!)X%W#oo9u#>Lj#fVh8gw5j>08PjGdv
zSFPHy*pj0;@MG_iox^x)Fd1+VVa4I!?1nHA_>kW!qUiCb=GH2<yv}%NGIlZY+*UJ*
z8MJpT`c|@%xvpXzKh%&cadS!j<iegvjwIaI_#p{WmE7Y1#B&j(^U7bNXzJ6NQ+w<#
z0lmY`T;c-+hz@dR4upZ`CS-Zmi0x$Cr>`eW`}ia8)1O^pC$ii5yC0E3q;7I!^0C(k
zA^>3^STGpu7VQ2EwbP6=ioBxQNaUmU)7F{Fn*rHx{@H=~2cR46Y_o6sIaF7#{hg_r
z=?{XM1jcXGNkfRJ9x&DJzfG_FFC%h3cdcRGa?j@NL>d^Zl(1<qa3Z-5Izu-zzK=c-
zYQ~|gfER?<CmYFJn#4^jbjPaXzCoi96yp^?^*dztwdRwO#abM)#vpR0PSiW&GM#Db
z!m`Q>MYrkArAzCQaKKLLe50k~VDYe<8H->W13_$naE~joG<MKL1lo6p1TWjq)L&gG
zTgBZcCNcP90zoq4pPnxoYOT%&?$pIbztj46ZjPMunwNys9#k9m9$jCdQj>1`vCun4
zR&Y)=fEW93OexgH>%<vk$T3c|b^Kv58UmyHP(~&GNb|3WyJ=HCg&$wOlO9XOnFhd)
z=aojtNihUm37|d6P2P@&K|0~kuMJ9Z6w#^R-H|j8KR&uKoeVy!prW^Sq~aY$A}v1j
z@6FY0yqbXa^^)Y(78@O$rP{=FElbVORDSOP%b+%z!An~z_=%mM2%|*ruHMFK#XW<s
zqCpu~RH6%9H%a@NT`_!KAS#CUl>4Q7eu4$2z>$_w;T2)FK0?V|xXKN*R=6hSWW=Xo
zn_Ha~d*zmaOwI@@j4RDtzA_dhaIIawK3{zUy=|xD5ecOVh%5o?`s{`Oc-(3ZQ{RkV
zB|V*LxK53>w|S~?#p0b;@~aC<0+|E^Dh=#frZD{VwjrJ`{nRT^qDxQYX%|_3wYidx
zD(_OoI3M{V%=*oi6dV5X9VM_*I_9jhG|OELwm}WhTjY>TN5>bX8{rMln0_c>t|=RZ
zBTzFWrI0$)fPdqEV%{FvW2+ykcJjB%>^N`RSR?!g*z)>b*g`kzh=J%Zahe&GB^_wH
z>Q(I>9YJJ<C;#)MQG`I|GGa~9*SfM3xIo!poib;ag5=N{iI9`yy1H!tkrP_@7+Hrg
zg=hN9pD;e25k=qmSfd|!63{0X&SU0R$^JuDkpcCKey_z<Q6xD=s`!thI{NkpxvCU8
z#!ZVYhCCE7guTq()T5M+0A2;2Rjd)MTCiX6WaP&@*Y5L|ha0($Qm0McM)^2(Dsw5M
zkSY{$jj6-ZR8AUQTn`iFyi>6RKiKJ}i|Sgtt)y+-#8i(6<@xNeQo226ia`&D*4+8|
z@6UMz90E02^DVvn(M&Zf+W_~_3hPeIrgjg~tXpB@g5q@g!2+24tdq-mtOV1A0m4aj
ztY*nLBXESj!g?HR#9`-{E|+L|{DZJ#8CySxFL20soRyAP-J_1ND=5h?<pCTlh8s^t
zr~kv~72**8gMox*Eyb2UNomPKXvO8g4nPgpUs_CoGNZ@Gdqs#(DyttRA*XA1_8l1g
z4}f;#2P|swo?~Y@b%0mM-}27y!zPB9M7PrUO)dF1Lxkg1<EKpttM2+bo6ub#)yAET
z{l}}u(1JwK34skJ40*0;swTd`LHvB%<*b!lrPaKiq)dF$fl&il=z@mZZ+95ce*h5q
zla7j@6bz&{=qxKOw3a&-``mGWz&c}qF;^3;KimJVEo7du?66BnU++>GE0+!XX`ZC_
zrH|GDAlN!$6*ps%_KKWvfzn*How^5XalCvHKoueX2q}p+xKKYc7^y*S`J+I2O-4%6
z%eZ)yAjc8IJRss+H|U@jTap-KbnNh&nhqO9y@7wC+w>Uq`4d5Y3=L0x+JS+8Z<+!A
zOP9Oy=5<}<tRd8*nhqT%kz?a=nk0v=8G%;|*EC+(VHQ;yEH6@9O)k5f_aNQk<s~)@
zuLluQa=z^Bqwq9|yC&@3xWDW%wuc%5M^wohOOHP0bsR*2*828E-bP-DOWxGlKfphL
zwsXAX&-L1-j`<5_<Q$By*-e&p_YB@w6!i(SRsl}zvW}Plxxp8eY{@vc1-{FSHsp1N
z3VI6muohPM?Iu_1R=Hzcb<+qJVZXeT<QyhTE4G_2nNmXWBTYnCQS)m+VjzdY9X?3`
zohGh18)2N4Mg_>*u6KzdexzAIj0L3u^nrkKUz<_@)cxUq15xR%z=KoAj>?v0;B&SQ
z>#S5OyV_Xd&W_PhTj(m+Yrz)rI07+c@yH>)0A$$6j+MwP0zwRFUGwpQ&~G<Vo%cGj
zjo)$WlQxMW>+llunZ=%7mbm@_3gjumDWsu>broKd(#LX}=$H(~-}Jq!3XP)W>aVL$
z;WY@IKwV(&+N?LcC;SCn8Z##Lr2Zz7$Ztrge}EIcu%e2oqDPd00SRp#i<`bdLT*Lw
z=apIi-IfHhpreaL_7O^8NbcyLpXe{i&je%fm=mI-oY~HhE5fu}f;Jnu2Z*(wQD1AY
zzyEJ`5C6|kZSC9ZBcx4@X2N8IJ0srRafG`$zSalMGVUnZ_QZQJ%{Inh`^?3Jo%&OD
zW_RAaWzdbg#Z0^)(#pu2WRul;ib_8za`#Xkon8zKtrM)EhOH|81`qnm92+_>a#%F;
z>#}2+6am?lnfetGaRBImLtD9GPwiVzAB5uBm%Z+&5jq2lWJ7I9#hq?Xi!cc4$tX2(
zIDEVtr;jr!v-al2c_p97iG1i>E%wRLizUzU(WLF~#)kbyBb#?EtEJ4gg-zamgdy&{
z%$Zxdwc7^GrRn%dn!PzBaJPMlllS03&t!S?HqX_!WBX9u?<ZPEeJG+BSH!UD2nir4
zI{a*i-EJ!@v2gX|C8;xm%(eT6X03j=6o;H!KBC8}q&<9~vx_R*ATB0DY||_$=;TLJ
z7Jf<lA_f$aa$TTDBfE3ki_1f?_K%ex5zb#SZ@X_vDw5G{l`PxWysWCaVsxgB<RVHy
z+cBShlC=$UcCMb(?a`g$F#sLOKG+)X0$uG%s;=%UQs_Jq%mMh%qWg8=bWyQxYr{tI
zV->d(fKdzVhc2amjI^+J*ftByZJhZzO`k!>EYqFg`9ejJ>+;6ObOGz_Dc}IBe;3<A
z^m5d4VQ<UHp!IA^8Fw)YyL;1aW8ZVU0-0>9DYL+&F~7;^bbT<b$t*MN<oVttEm65X
zK>erpW)h(*7Dp?1mgt-T{W8r-?~lR*-|<9fTC^Bt(>Hu7SCrYEZT-n3Gc_Y@Q6bp3
ztkEQup{91@BSmW)-A9YN_HHnsJ5}T}YG5h0*gZ@DCh>P4*=S$R!@(CX9oYHS``usA
z$kMOXQEAiOGj4iOfA3G;xNIoA17;Y1Idy4E+7-vM$o3oqHCkGkU7nf9*-2<pe>h^e
zAHi6MQ018wD$=*RX{D|tNnvwq7~)t1^n=~v2*Z&*JvlqyB6ndQ-m7vJStvVxZ534z
zV(2CKNjAM?weU`W0SNTI=~(Q>mS58vZh7G0Yv`95HlF|F`R!rm(Xr*&9_q`xCkv&x
z#nM?AfdE1PJnX4KQV4bB9xvA#T}(<nM8lYQ%z;W6nfqZY5T<~<{q(vM-|<U7*$Z(v
zqWjsD#R5*cv$ov!_jlU58kNz}Lw(tLUa}Z;1Jy<eqPa9d{Stam2M;XgYG^^ZoP8yw
z-fwh+uanX9-;QspmuQW6xDKKd6DQSn6Wn2h0b2EfQW=nGVY!Ppj|x<=D~l+deV^F#
zvebU;jP7>|G9un0UYfAcyj&9Ju|lUJA#pIUA;++kR`)pwxj8*E-dKUy*PHRjvT8rV
z(&SNJ4OboCXpAbDQDWkAP79oE9vk5fK<Gb)Jk1L#x$q5p7w_NHeu49ro?AdH3tWC>
zKCL_pyx+S3P`&)ewNPWM2#5kUu$h$<mbGPZp5C>%6zi@Uf>D<Ggd8wCYp(01vBc|g
zmHMM~_Cz-IeP!FiCc!PJvU_h-Sw>cv239u3I-qSSMC9D2$yZdCP@A)KrV`8LSJUPY
zhg!Y3vbudeahxaIl|-G53eQqIY^YkF4+iEiI%3)DpJq9M2VBB*>*3AvV0KHlub5nK
z>jie#Q<K)4Nz9>Wmf$b~)a0>Eo<C}?lUJ+7QFl9Q^Azjeu5{s==*dTn#!*=Xi)p8b
zeZeq;5}E2YI6gw~=73|qV$P+F(_n0>YHNd~RWGUDJ+gy^F~AeE=ToctxghrU_&28R
zEZ&b~CGSWiSOL9TEjH;<N{b@(1U930GE~toR#Vkmo7#kyTG&SHQhN5<QM)aIr|M^Z
z2#`8^n;T`+Ay(9rKlRlHp$wK>|5B;CtI=tI%yMXIf9JqR>gXyow03E7Y(CNQ$^)Fd
zF78W5qW!JeCoHZvOWol%sp11cyIB*pRe|S8*=Q&&@7*qn3*Q*@)@)N3Q4u%w*D=`f
z8kdQNq!{RqQ0bRi=UMDs;U#@zn{sAScn@1P=5<C=nN!`jWGE)9dDGOUQCDhIzXj2;
z?&Iamx!pmjn`+RuJUc-jk1>5YNLzvD6m=vY-P=y+>`1yjJWeOFb8_G=#U{|ynl;V1
zj*qNCR&6RAnCa1;VE@Vtx0=^hdYlD!XeW|!fX&7(RlhrH)<6+kl1lk4%?S&Y-MaQd
zBU`{9b|De2d0!fWXofsLT<9#VzWq@_a@!FtvnYWbl;cQr(L2%;^_t_(KWXH`a6Xsm
z5w<Vb@SI;_V(Xbt)R4fAD=aeL6~^5j2kV<oTer#d4`5S$0rAG*JS3$Aw+EWDzWhiF
z`zpXzR!xOA8;KWJy-g#cV!fNjO;`08cX~9gZg1h*@_h|IF~c06820$5?>y(~eJuU<
z0IeqmHi+<!mXG$-D(jaa0VlvSXS_q<;EHbj|Brt6pF40}rrVup!q(8bECY_95}IKU
zW(yqcjC1^UPqtpZ^&1~^k*%Y<r3g|Xy8+FrFs#_@zCBAQliCVjx?%elZFIm<k4$vQ
zQc+tf@pqn}@0}Pt$D_BUMIFSy+i(`X#AZp-hMO4j>`Vw&Y^j`nb8BgpD9qeLB%*G_
zda+H+OAW`aZlU-)31AB<n~R*L(~72vNRR$y*{Tbs7ulo4ek^$BylU%njmAO!awST{
z+YA%$AHAKnB5;l9PLqjLi{geZdoUM35MS5px3{|;7^fAz$%{d@3Fl5@-N22558O`{
zxX4#@tx$QKANYwnLn|UcwP#(LjFivd57~GxLA}V$F0+*#HaRT>%QBzVE73f!vJ9!)
z;{@WJL9H8AXWhz<ZYK?ugfO$cUBx3sam``Q0z<Gfs!gtQUy$ZmmE}n&_#n)A{k&;R
z%43?lTo9Wt%Y?Fnmgo0y0g$phC<n(r^YCkL>D`YLD?!qZ!&@USl%vF9I|#$QNe`3B
z->GyJ0_fd%Plbf6C=|@*x0sdu>gz|1*xB@g(##Dkwr7tqYui7RsU~fUoMj-lL>fEQ
z0(IoSL9o-@;`Ix-(2h4Mb?V@BG{3q8-EN}LNkQEYdsn)JSaHW<>I~5saj<}2N)Ubx
zJ^ZoZx!y#8jlyT7PDYXA1yqgivNod^LPTtdt2n+J8N`u-e%b1lReGegO_vHE*hIsh
z1ZKgJHg?!0J7V3PQC<HEf(ttr@@O~9s;mpk@3`A;`KFA_aX5*ThNPdmbSV7QIK*GA
zvGNmtW>-;ab+(AdYq;1ik%8~sQA6L#%LSYh6p{2@FeB%aE0v};rr$6idA1(*zB&y&
zF!L$7F?gBBIuE)deEvu)UMC4QN90>HYfseN+J!^SJo2?>U9XfD*Zalq9v#Fm$2C#6
zA*<-VOBCvzPAib)wG2cSQYF&=@wVgsM|yDzF$^!;)P!MkJc;=-gmosPw(|5)0hrfo
zO%Pok@9G#=Rv;2FQ(mj?J>VF#VqK_na;$_Vw=G9Je?95ZB8f+t&UD%h{?%HWdhoBt
zk)5Kp9pPH&Jf*XBd!ZLvxdb<_`?qL2L?4h)2{^v`Sf_JfIVDjt(DlO>)S#O>uT42B
zG}kb7Vn_<@vE`sIzSDPmt2Qs{z>^zMjbSj*!Ez~1Rr#<-c}(+8hkJWso9go>hH1vI
z5X1>#R8jEIU{PF;olGYIk^uNLEzJ{z^)V*R41`WeO7NrrFCPZGMqo+<K53`x#buM_
z$ri^Tq*hK=ZrkL^O^w`{5dDmjrZor`?_>{2Nt8~AOoHn)^BZgV#64&_G1+2JS&A`{
z7-CV^O(so623w5a<A9OwVDbrS`ez@+XY)v+4OK5LitzN7Tz<UL&Y{L*kgqUdgT1L;
zBJ<@myb);6Sz5T^OG_jtx+7vFp>v#3vPoUCY1jbr=-@py`w<r~WYh`2x<=!AdwYi4
zZIh)><0#l1*Q{A{g+-G2SY9;zvf%7SBz?O6-jfkmEf9!<XjR5C#E!B7^;eOu#_7>u
zLC-*eXf!R&dZ<e;=Q!bE#4iu1U<_wXN0`i%c{n&!MdmtD%9q=3+*3rg-uP3IcQl1h
z^#H|D|9XY_P2JtbmPvMPi2Y8s2Th72Ki0uFFAO~Iq7Q7zU>LdR;BdHkfmlp(tgnsM
zT4Gt&SO}s{L3<WQ0{~ua=sQ*k8LPu+o&xq05L|9?*yaTfWEXoI7R>Vl+r(pr#arH^
zoi|;p+wZM20zIVLql=`jd_Wgjo!>98I@Ai((a9;1(A{S;1*a^TdyTyr1m~XE*=8_2
zl+OKJb$>QnC{*js?FsKnx1^N`tiCYo1)-pfWY;e+KhVj$)u&TtQUQdimVp=D(`9Uz
z2JjRT101Yhn!w<2BKKGE0rN1ez9Yw75n=T*n0YQXfkuF!1^mhyEj3=~K7OZ1s76_-
zz9o+tVJJS{V8M8PU}XUq12_|821?w{_4PZI$=q?ZZByLGK5n*5*Hy5iaDFNj6bWY;
zsB#s%4qF!UGaB+ou#If(7R)1HP;G9^7;>i@X&)uK6?OqmH#dz=Mr<Mn4(#(0I>VmH
zoU(qinaeO|X9#Z4L)X!vPE8#SmU9NAwv9fm8XC{eH_gwov#D%^-F~XiO{pAb#MaF`
zOAB>(k2ih)80v=Q0=uZIsw%FUE!Jgn$BDQVo#RCY(iS26o%uyCwqVE=y)@3(ISJg-
zsh9*fLp|0ahyeSJpTO}lH+kc{cga7kj2FF|%mZxg{WUEbg17=jlC&$flmY?o<_8?F
znhM?w>nH1Rzt0A!?BK?Z`lZ-TlBCAlV_}XMd`*dGx)8`moIt-`R#eLwKYk}Mac|G&
z0lIHAAdD2n4?eLK7pa$!dnbNfWi`g=P}<s6ogZ8kY^-fc;aQg(Stpb@XOe>H!-K8!
zy`n{q6b&lv`29x=LH__@kB)4Mt~f1;W|jgO2POm8$o1g@mpmI2x$aB!W*x%^?`yTA
zk_v>05?HGA&Hr6fEdQk|j15j|*j}5mnN*W5@d#%-)11>ILpKV&_VouxjWum?)|y56
zF_UG?Bp$Ein(3Y1>UR(E^p_CnvhOM}OWA%3o?Q`a$HFuiQ^_a7UkkKrL(qSl5jOOD
zxZYl{0DW5u%bNqkTKh8>ld9qH5ZFGlR0!O-4aX$bT@L-vtJ9?LCNeAC5HqM7E={t7
zLtvtC{1K3RH<xW%mA7jq10ftTt{?>B!^i8o8WXdh1LM@xejcXo_<529B}dD5dR$Vs
z018`pzikEXSXJWfd%AI0Z?EtZ#uw(qJB!wL1CMaL<WG`f<H&<g=`I-8@XTA=fZF)s
z7^6bFC+c8c)=nk{p!>jjxK9xte`IZ=##ZOA?{;1~1{Co)ha=QeI3wv*jjb*G?>HV<
zLV>i_Md!xp5|cQO`pZ{mEqF>`%5@d5xS(uFhbk`rY+Fc(N>hhJf+EPODDa||1}TJ&
z+8u93N2x<X`0wbMT4Rh_-0WXbvb&x08doXPEyBj@&6@e=T6>LUjaYKp$hLmL9%$#<
zpjUliErFB;BkN2-wwh*fwmUN97fm{c$z-Ys58X-674<cJbESrsESY`GQ+6WU6cY+h
zmNU7PK@M1ZpOJ#j8Ejk5#LjzA<)i|tit4s*zc)HmvbdNpw@9df(57-F$kDEmooogO
zsmr^QaaRC5i{3biZ7PHoz;zCTvaMJJW=E2<ZDxC7oh!$qQ6AChVW&dla%Ovwa@l>Q
zz$g4UMrVr*+zX4FA0(puAGEziSX*!SuA3J3BE_}AgS%6pxVyVM!Ci}cC|UxgxH|-Q
z*W&K3#l64Hp8d~kpM9M($spr(t@VEI_dNIg&d=IXzp||xLg86)4DW3gISTFDhW`5z
zE9PK*d5*U-^?td}FZGzX`dM>-uXX|tI-XV`HXh?b`s~i_XUj-I=k<x=0#<u-M{rcm
z*}rgT=A(Zz;Uk2FULf4o9h5g0D$<CcHuSNv;ziN#W3UA-U5XmnQ<juhck+mNf-d(F
zgE2oJjb&x$L)YSjrNS4o1A&KidtKxZ>1wDhX`T3*YK!`mxoR~ApB^b&GDHUlqxX!-
zDy%_3tO1%PI4q<(65sO{?@CalZ%e#zz&Ap&hxO@^c>e5GO|e8^$ff3UT&-EQZV!n$
zaI$3X_dmKy18Lk+O8|k$Cl~(RqPqiN45QwIWEz^;fdDz0<&21($@_Y|*cjowsnz`j
zd1hf*A=q>u0H%mOlp85u+t_Oy0hU#5p6XspayN`8R3sF`YpQ=>*j2$1n<5KZXhfVW
z<nSDTMNjT+jzJXW$4Qnq7PcWPF*Kc@q@w(8>0FiA5A1xQ*SZpCJn=h%Z3~8Jb@y8D
z=8H_@lxH8}_?d2aS21b`IIaZ@<BI#k+w6czXx1t59KAahxt|q(aW?*I{r(ySf6_%(
zl=wHe|GSSm2S!if<le%1Fg}{V-p|xj&sX;F8*XNiF^#!heS1Nlg6INZFHDIE({U_~
ze^J(UN&ZcopshVgPoK$f&*zHs<`^2WHdW~0$;OiBh42H~&$D8B`PmenX!AKE$G=`j
zGj$vToG{6}n7*y&qTaeC2&xnr_Y|0|Z_R7XQnqPpY~qmF^H%+tq<RF0{+we_9@)~$
z>kA$4KWum1jQ4D9wySi^pHn4iZ^=@@`_PQZJ~bOu2^O%3;igtcSE6zHL;=~mDQr?N
zYCExl|7qFAELT^<F%ccHT**wkGJ2c^D%GVndzX{5pLWhy`z)1@`AG;7uq!PS#+l%V
z@DJ_EaS5nHh-rvkriX)oFIsOIvlcTJl3lGk@yZ`Ok-}@6q<Bj-9JM3wlVD3H$Yb5%
z^ha6x5n?;2y9HsYvy&DP-t2RwaHpdcDS91{QF+f4#$EWk0e3WT*{U;XDVRb_A}moQ
zNMXi{xG`>nOj`NtL>G2kK7~OXac$#S>edJ{c;S5fpLa=?HG4698tEd7PL9Q5s>f?u
z=+!_*;GqMU^itj{_S7gOad7$q#QZK6HR_Tu8W2j#g{wizKr+87XWoL`yEivWL9F>S
zR9mV&Fhovz_SDMh<5I2Tt^m@a#!zkQWVq$_Sm>yOMXsP!?8vk{7LKc6qQt(@h@YEZ
zKAsO0hJ`Y6AYeUNPkf-MmN$$suBo~y+$u|4Rs-(z)pGw)g}se<&+AOROKa;1OdYg^
ze!zG1+>D2ri|f=9ZFlpD8fg0zJ)D<gfD|>e<j-N(h%zHg%1K1eK8wKRN&&wFe#*EJ
zq3!}ZBuZYZs@2+Q?#==yK67}f&weu+dt2wt>BjL^+Bqw(0GQ1<?QsP1&FJZ=9)9{O
z!MDcQ@j-LcB!f5$i1MuOpDO&>CQgX}up@ZA4CDgh^va;jv2a}_39_!No2$J15?2vD
z*q67IE3xp?zJer5Zx?iV<Sv4snM^x)uk=Uqv)TXdg#JHk8~>mF0mEGN)R_u+_3IE%
z`in1h2>oI198&eKJO{bT)Z0qZd(AYpg}BV-dmJ;Pf+w!W-#59Fd#~-p0o(+94}duw
z=|9aB$8zPO(kA){4o`n4fx!7&rFl=X)PczqQs@GkNo*kQU%@1$yPI_hr7Swg#txA5
z3W9pm^Enrd1g(vK)iZZ2-2Z#KS=`|hB);%!rrIKNm!l%zZ6MKLKAm?)-jmLAT!9U+
zhrnKB<7&9{y?v*NbViB@y)!5OzSxN?mZ|`}ibKp9vE%r24sLAfv-^$s&_lh;MGiuj
zcpj-Me~SfX0BW_y9RA5fWwO#1K9eZ6LBX)<UwajHofu982=iRZxOTJ^w{*OzhqifK
z&ez@KA|C%u6wkId4v%{gk(jKK7eDM97o7=v;Z-KjE1^0kZxxGOBHAB1wU+^)JkE`y
zgG1%Ze}l&8&`sJ$9L^(qmID^tL0+ViQ@t)+pRd5yb1b}c^EKF<9YGUAro6f3=e!ub
z5q1>k6RruH8Xf92H>IZRoDuY^bzprWp1%mqzkix}_9bO{XrL0Do!N9aOk>p1NCp_6
z(DBistPm$9-BhK<3C{#MO8gB>0K0c#tB4WZd4RCFa*m~e+GgcYCSx?rv)TE8wQuU?
zaX}@c{ByF5Y3*<i1>>g9#~KI<5lJ3mN2g|IyyP0y0SU_Pa_ye~KM%<=+d!umzQha<
zl2^{XsyCwBi?-QEU3LXRlkDgDCF)>A**yfo>Qna03N3cM9&}VTm;vc6H?+{sbGkjz
zr7xa<{d|1RbS0nw>qkxK`s&o-Z|eL$pl&R%!`5KzmE(`&j)TEiTg^+?xvrJe*e4k#
zwxQC;nM;4V)C2!C^ILLF%Qm#18QWjilzOD*N9C+)6S95}T#Rpev4nW~$Y%p%Y2zZ-
z<*I6RS)jY2>lSnr_Fo=9S-WNBYc=CHlTW6r4zqUwC=(@;pKuMya`NF9@_?EtA&8W4
zL58jKBuWi2CPyTm&|R;?(7J?d&wd#PseLFoPr~iPy_w(qq@^HJ{2QhFzZ-+It0`-c
z7@Gw+RGa^`+*q@{72<Rv4%CD@n|tYu9IZzUb(MO@!vEw>Wl6+4*g9Y>JJ-*%KPRju
zE@~)8@kr*7=5Ci_!BMz&!MN$#R@6CC(>u|sKT#6S7}vx>5|Yl8rgj&iKEJsxzY{z@
z`~%^qwu&JPj-zNr-hWbi_RI$d`4Ep{n}-l9;Te1c_oW<8LLhZTzhorC^!=`86E((c
zx1*Y#AhG9i*JR@RmaS<z7r3pilm2p;tGB0jg||y4bqN<T#ZI(|-6-3ZhtL6SI)piz
z$3K~tG+{LW^t;;uhR^eH@?HZV2%#5R7;IDUjemw+f+~8#^1(pgc*<gIWBRW_(oeQF
zrr<~<7h7%DA?iPFu9lgF0kNbz9St?Da|TiB*onSU%LF_2f1=@l2u~JuH3UN26ZU=1
zmS-vx;Gph{mWw}dq)z;Yx8;s!+ptgxYv$P`;hCi!QS?Bo<ey4Sp-LAdDFPvF;oC%~
zipQR`JLje{7qr8CGHY?Z=QC*#ehLaZa_=KVqntv6q1vi$z5MfsEQdiPFI`+BE&d_B
zK#|#p+Nf$u-TZ5yC{#+32L#$+*t#UiMNb^K+sGwLyU&1Z^*K7?UdSe2BmH{k?JIOI
zj{eELfJc9_4)UNk21VOr{!F|#*uPz<c2z8JNH%d$@_L$iHEX>guy(w_Svod5(Gmi!
zD>7I;A--=MFemj_D^?OB&&phWJyaAQ5&v4RB!SZp85%uY<OY5_!~tVXAq*KEwI*aI
z35LsBAf$065p3VA<{fu1+m=j`j!{Hs<X|WIaWC2(*1b>Fdf4z~eA_1S1e1@#L3Z5@
z;VcCS+grQTNV;yY!I#}!Mx8~J423h;nxk{|ydJ|}KIHY>Ea<<V$hJ5a6Te!vry~2N
z0=ieZGqEf#H|~D_3^9%Wyq}8o$%raRSb1M>+N+9%mSu{%4jG89gv7cQ0BWvpN|;;_
z^bST1BO2nI%T-rAE7{K_WF5vb(%vemN>1A5a|2CI*(|JBC>=YyCUYd9upuJ7r;kY5
zO7>adzOlp<X-Sh33L_DSGR?cJjeQt*k}lMxK6bq-4KX+KcV*~?BRBHkRUx*Hl#gmK
zZeN!+UgKX%@<#ZeL2HX%1734~p&)%KsCdiyh;UvvtjudH8tx!X>PXy?9scp{h~Tfq
z>2;x#!%HI;(Iu6rzq9;+BR#FY7vl+M_$2smksU)`rAbMIqW4<!@W#fPco9)Sv6m%K
zs7~}<q?g~YaLJ74_f^-F;^xzSV1V{@<%^-##tsXwd*aRu_EmLm>`QT5^j>a@BvO3-
zSNT^v95J6l3Y*%NG(XQP&U&y#N~b-4Ln`|y&<BIs0^>{>;6*|4Ebg`Q#f`mb55uwK
z@9T;7?C&i89}Q}t628&wOZ6(2K10vu-Davo&5>X>BhLMnA-SVU?hHBv%P+jfeu5va
zrdV?qN)rmq*hkr5cBrtSG+L6-hLT^Oq{N1~)a45P|2rTjR@tzfOe3oHxZ&&30??b*
z{)PF@<#<=-*%rAZmyEF=>-eVIF`rLYz5_r^2R+fUetY#VtVkrQn;R&uz$$%M-M8+W
zo7$9k+(Ii4d*8jR#0T<RU#a61f;^RvMWi39Apc%Zc%^v#3#xZ~FqcJ>D)b)%Aa`4r
z@WB8PVDVtxrqUzydrh$9nFpNw^=qqTUE|Jn_r;ZNGd`MEZ{@w3^@q;m0;h`V2LAN8
zl3io8d<*Qir-k!YSs_JRTvkv2fK?t$>Ezc^&{#B8ROT06lxz`SEY<1f**OnaG)a>K
z=+JSH`Bq5|V(#4Zm9EQ1LG0Q(y`@lAd(NN+(f5a>X7=$!!?F>s#|v{#9Z}-DxLllh
z{AN!5Ve=#Ya`#G>VIf@ko!O`4TiIRanxEZ?<MUC!xipX{(XA@tUETIoc3ApzEap%6
zq(I<&nvC77EVxi`O(hyL-^S|17a4q+;ojuhr@7nv`*Mbgwd*U&!iq+e+e2@F5xz6F
zDXil7l-4DUUNUDDdpywcPH{+?u=@#P<x;#j)3L}Vx9`ghx%-@3`I)EPHNDyZ`M)RF
za@UXd+r@vW8H<*COeLSldJp-^OFU!k>fpYzco}<Z&dm_I(WxhGT2?VjPV}3aYo+t4
zN$q5uV<f~no1&Yo8*OK5cNiwfu4TIwo>l7&DW{#7AQARkS66{V&>}O&xT17B?y1l6
zf8mA8@0C~d;MUY}x_akOD09s*JFuB~w?ThxiE_$J<kjt09{dLw{SVN=`+G&+mii%G
zwwp>E?<r;R_-VfPnImAKh?@u^C~qIo{Ub6cQglgOP_<i%%Jfobwa>RG3g-sc;AEcx
zQ5ULa5Nw%1-It-ft~}<7vTjZ|VjRM&(BR|S+}0?HwRaPcbSy!%;@h@ZGxtp{D+>K%
zHtjUIuyFs!MS`p2#eTaQ0YXT8oBh%5$^9U~7Kn=l=W-a9yQ`$Ps;jq>J_m$s4KKw>
ztx<G|&QwAQlly7rNc2`Oe}_@I<(N;$tG(Uw3h4D)N(O{QIynBDR}8;{wi#n{RB2;}
z`oz6s{5ga2RwSA0<e6geVhsLbydgf74lM@=&|9P(SA9_t5<U&a8b)8t_5U$$e!~;Q
zf^^ek*9d8u7&h#(9KI5o`TM(`lPpzAmb>LYfF(;nMnk&i-!%Z?0F?-KPJyGL$H3&z
z<#Qt8oJo3%Ex6cVuj-SboY$)vSclSuE)_wtA}#fL{fkDp|7;Q!p}wC%6|t4H>y2Aw
zDh6gs(b#TkBT9V}61w?rr}84+MWIV)f6{1GiVU3eCrT#S=}+t}1@0i4q_NU<`g?h&
z$jdIt*XZ|x?Qh$?wid{adb(SdZ4C-70OE3>EZn=|CW4wSr%Nurs4ekYYl!%>bi%%f
zy8$^l-AqrDoR(ZO>|>fHTxq3FFdW=yV=lZ~GkWMYC5^k)84u%vkk1Zv%G{zD@d}v$
zgNI;9XeZ&W8P9R9-a$bU<=ty3kyCGizs`w|=I2|p!gw1#2X8+RgEc!Jgw<ni-7|YI
z^gV@XuEM7cN5Lv!tXd1X+xe-|6(jKpgNaH8czavWpo8uLRokLCZkCw4o;qTLnifG8
zVWFBnMJ}j$WBe!Y=(9?nV<J5DsN+Ur*n#tFpiQHW(c{?utP2WSA7W#Pq;v7Iq(kyy
zf+TgQK+2v_WToA*{={Y<Mw;4&(3Xjn+amw*L13z9Z2p8Zyk{sJe~#*gKq)H!N4`il
zUb;e$)<7sy;8|tw)WZ_lP?4|Zgd45r$IDr(f}cN~dFKA^{W?>P`|7n`yv%A})c5h5
z?xztVCe%29a;g*4m60PD4*ZU$`^Ni}(9k$g(KHdM-uIxNS4|0nti$qwB8@FHq%6hf
z^uYtLFlWOzte8>DZ=nvK>6o`-p97NlVi;ZupcYQ#tjL1syFsks;!re4U)OA&2c)cA
zk1jhc9gC1hYPI5p%3tL;&GpHfCEV~jPXSVLWo7=DgFR~kpPYo|ezl~n*ONH-l&%qH
zFKV5bLq0<ULzlM1l7uFGQFXEyoqxrRt<-GO>Dz3N+wPX_+HDYpEXS`&i|2YZwNfib
z?f(ZDP?FwZg!Qd{Yu0j_LbHxa4!QY!2I6j)T%k!@kI-=&I<v#_!l;N^s2e6qxJn(S
zz}1B`qrK24(2~|<zZ-7?^t_F!j>t{h!0ozg?!u1wkz^+=m1%e1?o|l)k%oGgjMEMN
zecmJfPQXs$sEC$_;5Ye;+~ipm?EYJ(s3~M8DP{1;C0D5^O9nVk$)Ws7n&Kw^AP`t7
zu7DBwSzifl3HPSvZ`TDWGF_gUsart<yjkP$Th$B2SdoMC!At?hdR~)3)M4Ddw=WVL
z;cI#M?43^4juCI1ASr{fM|<t*u>p7ZU6;rDH@$_gE>)-XuhNy=$oJnahL&U|a&8~<
zlkWD%xYMp^1ka|Wf$c$>&2D|*e)t!83j(@FA=ZaxwaySp*ZZs=_cvAYeEf*~)O^4R
zpG4;Na;G5`0$`}p=X5$$PT0R^UyZG*7&BrHA#7?)E5DTY^*3MX{|!6xe*&ET$Lbq;
zUus)ip1F5b27a)=#LjlSsp9YXy;l{iB*w4%@H|nJOCO^)K}EzEwoY!%o#?f~&k|Oc
z^<cxp!M+w0v|QzS;cbZk+|4;qNZ|OY`hKSHFmbDq%zW)i$F+2c=)+yesjM0+{Wcx4
zzS>2JDDPuFbzSAVmFOw86Vw{xX&im31!huENa4C}8Zdu-e|NFu==Os-5iFL!7|94L
z@?&u7vf4e^=S|ImR-*xER>=IHEizg%h=oL+R)6ttf;Gfr-a#I8#@CC&zOP<0HKKmk
zRdL9`<c}#kgquIjGb<bolO~9zLR1MHBV3fcgzZik!)X8b1WZyT&$2*Wn{&K0HTsEU
zrq?RmPD+|uIQV2ycBVQ-^*q0Axg`(crLz1y|9c|L;K+iP@E_p)Tf^8tQzlm#&9mfq
zIQ^`dJVxq;-7wXIJz8(Q&bRb0HM5annaqe#>i7N4FdcoN+pqSYX^wB%p608LRywkK
zNUi??uvYQ~6}{}q`gCB1J+Su=*KyWyUYPP6*9ZXE?##KJA_B$gh0Jo3RE<n{Aj}bf
z9Q4oRKWd+j7Rzcm`tuc9lSUKkLtEBey`|FY$u4Rus_<t5uT=FNEaHdy7IIpfWOwg>
z2HdpKmz>~>Z*|<2Bk7`e!Hr+Yyp@9F7n@Rm9zsJ<`<=&FO|_iI;jpgcEpNQ=Hc$`S
z1r%#u-<G`@Ci{+%>TTRu`D5+(6lF8_Xg<`w^x9nU0+Z-D_dMMKG6{9qg}4icOrbR#
zU$}yrfr$djHX|#wjclZJ`(D@qL%%zdGe}L74D9eOEwi3=jZDTEol1NV-cHFbP|utE
z%Zoef+GNbrY!rCKI5Z;#_6xp_%VS{+&aV;;!DY=b@wy1UVwQd0GJ`+8eJQW<(5;Fy
z+({su1LUU<W`t>coUg1Yt8kSid9#Zb*+6VJdc2}1(im!ANAR(CcrL2!>*>L!Sxbl!
zZTCM;Cp4wym^`|~ZGCvq{6L-N?P*QDnEW(-raQ*z3-Hwx{<T1pBW6pa*%WI@3Mc48
zYE2<vHze1fbH3As+c-Z4D8~h;i};Z1XN8sLvDf)5o5SpUtD3UD9!itcZ8Y5NI5s%)
z%sGgA#V2IG>pl$L8u!xNDyB^Y4vC0J;<O?itI0epn&TdE*igfo9~w=T9-6&sR^u>v
zdPF2jpEdQlnzt1oiCKHMjH5LdOWcw2fQBuI{pwc4*9a}@YzKk)*6hU1(!?hhQx5-O
z(O+CewKS>Wqtd2K*8+RP766x=VC<>tZPl8VpW0m!D_%~guHym#{@uxf7a4PCRf7XT
zBh1;rh8Zg^;ib9S*+VdPFtMExT>@3bWFaBbGcC*BXwCAGc2J+r1nE*oU@fi2xIw_Z
zUP$g2r`#``b#Ov<IroK=Ff{M7;9_J%37A-j+e0SFXJOWTxD~bMua+*#(ZGGK=|R$%
zOk+zx8rA(dyMBV{%e26EtJPRIqPru;?^13dcSUO4%Ib$&14@HZKsd@@PX-1C9w2i)
zSST{{Z7iKub2E{(dP9OwqqY9(7?`mS-jO;IQc~OiMch?m<~K#iq9E(LMjFN}s_t4~
zb}+LSCPSqngt%Rf++3IGQbyjIU5W;+y)|m_7b(vLDz3lMp520SaDY--l1mvwAxb{@
z`_SWfwMjC@W#sk*`~1tn_8*RMK6e!n=ZN_txsH~k3HaRGno3qb>KohU=q{M4{9+^4
zYiH+jBo5W%=OsEoeR`Zi|N5>^SRLqSxgbG8+9?L?>j}!Ka-;8HYj^fijY)+HAy9(f
zqO9X`xv=oGF?(01<H7=#*MU!Nw^sI=OWlikJ|8Lj@>isfaBtGp-GN+CrA6m4<Sx->
z3QK=3I_<rd32Tk49g!VmYly;w?H7jasp2Y-cKurp`%-3Glf=6c*lJKY3l!-6R&Lg(
z(Ak;YFhdRgyW7U{!E`?%H@BoR!*tF8PZBwak`P%v8hl-lAE7<4Jn;RKn=KDrA5#ie
zYJ4EwT3Fu4-Iu~2XtG)$hJ8&9bh$YC+s#TP(9a7Rh*q?r>;s4L;v3^~Bg<79D3)_j
zV319uIMpDnc8${BN1BL;UFNIlagJ0&X*^ISK*O7qg+(&Uxj&XyiJ!Xoe3&`pF=X8@
z`7rC|5jt!M|Lu>-6_v8z?&F(XTPD*AJGHpXJ`+Lfpx7PKuTxFAc)SQ+1YMsn&4mJe
z9>Q$uLa@!Ixr;x>E3(XpF0jX9m%t!Ot(55SGCygG>S7RE-a$A(QU7znthhxS;?O$M
zz-{3$qYPyzf0&|a5%ghX(n&v>G?gHWc9jjQtn=W`@_ULyk*gG${&#;x7UR*57|R%w
z@sRE#+rH0@r}&{_c*WVy!><_32?9u_-Y%vaZgA<J1oo<WpYuFdKdt8pJ(Z~)(0=c6
zLmfdmKpbq(*+2*{j@U+*pD@^tywsS&OA>`I(`?zAC)^dPkAHG4eI?7i!b|Ln<?N_B
zT+Cn;#rC{cZ@QlaQ)DmH84Y=0H@Ey{crf(!xAoG8^0@Rgy;KM<;N{quO{zyPeJ51y
zcM;Ll_XJ1p*Dm#6W)^#~1%@jupb(S3M8+fEGqg1|z=9_^NuRF1lv4d8EZFlQC*Ljr
z6Y_75ki?iR99OKhmRRu}?k{A#*XmJOe+jA9e2CN(X_QAUF2PHQQ_W3k6QnqPF%}-3
z^)ch@ceuLw(3iNbPqwnD+nAZOD))5@e88xkE|Bxnl0;C9VHZ#jm+cc&DK|6kK!sz#
zD9~n-<4-2asRC<(tQ_^Y|CW~~$DTzhsTO(Mf>i#QWfKlwi$7S|5_mMUYrJj(97Drb
zj9s?D#W9OB9xs`Ov}~h}%gRI$gJ7}a#i^J58OhQWg_Bqoq9#Bo$&+=e|MQ3+RP|S5
zn=Iwlh}IfFxizq{M7kC<g3I}(W+zsVuCL^#tf=(SN8ZfEP07UCkE|bxe3)L>#5W$-
zHW0OV`Ns=S3nQUmdKiADt-sGqNk+t{a^7T=NQO~Lj5J<QS!HB3x~vq)!~=Q{0#<9j
z7oPKw-+%sZg7%E8U%rK}hn5`37F^!xxIY2o|E%w!Yq0RZkv`mg9_%dj0-s}hjZkmZ
zU&#%%#nPEJ52ezn>MSK-|AYn1|LHZ(*`G1AAA(!fWY6_g$bL34zp2uCK6c`k%98EK
zn-rPoMuts^{IsgKXlqR(Z0mjE+Y!6e3>;ykx7BWg4@bCPdsdHIPH7;RA1B6?khr{^
z`mH)&LCu3a_CBCYb!VpSa5luzY})LSVppHoFJHRGqILO}2iMYSBBhrWLMdZ7^qhDH
zN5dRm6=kVY7umji`(;{idc!3Ufr!7w;zIIIYqONRyDf`E9Td_J=z5b{M_TBERO!B(
zl=F4g5=>0OuZNTx%9J#RN4CvA0HOLWS7k1FEd3Yf3uOtM@DZ}<WGh!DPw%aKbd@2w
zGlyE<F~53P<An#%@M)FnM`H3#9Lul|X49Awx&4R)^XvCi;kCd|#gx`23=G@)r7XD}
zsAk<?rM#z@tc&$rKTxYjTcSl6y#zd2llaS&y(D9Kq^nuG>}&Y_a!wqrzltI^4*Uy%
zg9ZC-^gmuHnx5;CI7Cyw2@gTa_NjAZFVIJN><JUYSNo+N(GFuq+G&1CMQ!T<PN({X
z+DnfK8w>j=I+&Tc>oK?typmIG`NZLN;4v+HoFBDKi|w<9WXt8H-+sM7{IRJE2oNvf
zpWi~Ol{2qL1|Kz<%8&uM24RMu7Ir#kzsy$YS|)sZksKL*-;r?MR`6P8+4DAq^6CDN
z5_cesuXFXuYU){-{O4^ML$^c172A3_JC<1pV)*Ts%N)hi&s^D4dsnO716m;-TeI=S
z2H&fsZ5)cHbTyd^hmj3>87E$97vO7Oq$jfyU%d;BcVnlv?7{j<5c-|^txyBg9V?~+
z|C^Y@MrIa6?!C4ea{}b?Wb&^*iR`konwiE`M3~ysg2{*7;r=xdyz<SFn7Ni6B`dc7
z#_-sQ&>axXSd;+!U81R`hB_k_f~Q(mk?-<7e|wxo^&AxMF@h-(;AE>jnVewwDA~VT
zYpCL14TlGUoEOaY=f5Yvm%o$|N_+H48m#AK9jKn8qMQE*usPKtd1KT{m^^{ccG<T;
zBBZ!Oot)cgj@b`@Mv&r+@-q~`#7ul+JcXgkY9!nY%p`YR4-fL4WjeA6V7C?zo>tFv
zvl+v0H2emv6j8K3TOl%Q@D0r%z(>C(xLDH2%;$roI#{v=Hj)rVtscf2A`z9z;I=`j
z+k^IS;OAUzMIlW>OR&fJ{vU4m+D=f7-p26~i<*X?rP;#$mWyOBitGD?cDS!)t2M(?
z_^Nh^uCfiBJWZZDZZu($PxvTH2S;Wv^>6RJ<`@<p4fuHYy0jUjXI5@4z{C{26#L|p
z`&onA^ucW)Ea>CdLIJ@_WB(ownhEi{Hm_l(Vb}9db0hqEtOMsPxmhj9$nVm=)<;(e
zn-^O>l<)>HD=0-oRh&TU--`P*peYNqNS*R*OXvO)ZN(uo)W7U3uvs&kF5e96<NzTi
zB6s<SZ3gw$D%kmIoxi=+My=LTN$dr4zQ+p+8&-jO!)8RJbz4j=QU|b>%e59>38uKc
ziy@(Mb;TKnjT!q1$wT}j@v`2pR-$Y{^|HZ8j84x%f3Nh4TW~HDD!jP%&OGr4$h9}S
zF#<=U)>w@G1N7D}Ns)d38g=b0L3TAO(unhwi2GdavcDTExX2w9DhJzCYN~Xo!^Y*s
zR`I<qI;%LRRP`vUMVVlp+b(!~!WwMg${8^paj7?U(bWszwY8+IA&;ICB`fzmIFt{i
zsjmrvS8$y*^v-hTOqtr(N!1*;uaSV>HE$-C{fU6~n+2Y;)Shz-o*vT(7(zRKC^w|j
zh=;4NAqE;m&NMkXLuSTxR$BWA0fK|S+OmD!MAPgtQdSBi+5buv_m%{kV8*mZPW`Q1
zXV8|n@`$&zMWnvurS`EZ;rfgls!s&aS@pRR`01qOuc7)0txCxt5~2kUi$F?P0227R
z-pGh0N0wG%uqxGJV_usz_h&cc96zd`+hgnyIgs=V9}!-N;1#G;)IF%R4$Ph-88iB#
z%8886sSoQNoW=~UOLny5)Xiy_W6O0*G&KDSH)i<>9>g0+nb0BYlxml)K1)O$`w|2Z
zOIA-479S+X8?Q;}iUr-3?RIv=eHNY_n&DkD-<5!J8$T!UNWGsXlsd5fd_&$M8<EHQ
zC_FSTBez(gdcNE2^yOPckLJi>oLi}I__%p&8&lU@q-d&Qqn{5!OWGz51;Ga;ZqZ{S
zY2g|n*>n8LDRxnuH_RYZxva9L%mfRU6heVditRz)$EVfDw+@Hl68<^{O_ow-BP3wz
z>_;CcS1R+rAG#P6I>)}ZN*S>{kdlgGcm4-}s*)z+mY055bP2Hk<8acf@zv-{pCiJx
zNa*tZ@8R-d2absJjprYrI@!TE%}5p7t{oJ{@9nYeM`WI+>heEYk-F+H*(Y}3v9AVH
znH$?i%i+(^+;FO~kRNBJ&gj6LgGU>pF6&(f1mt!H_q7ek+2pgZx5Pg(OA>q&g}t@^
zqItM?s_O>TE=FM99e-WApEZ=A;0bct_a?HK774SIJ9gLma*PE-?U)28NT<m?zU#;5
zLqhSX!d{*%z9#7cANCIqF&ASlLS8@VVrd5_o2?8Yd;5~E*=<_?k%y~gCw_R{z`+;W
zDBW5}X&^C^zxY>P23HSf){)E@h(e)VZDw8?%w*Cee@EU@iI*^|>Rc}}CAuNbQ9P&C
z%mY~!AyY=7!<e4w^CYD9$7Fc1-#Ay$mTqr$^0)T5n^3u5ID2U)pP_=ic6)3(l?`Uu
zbsiH^3qDXZ&V8x3t<<ww<D|NxJV1i-pG61@sAG%)U3N49*ki&$0xIK8&99!WAleV)
zOozf4!kc0r2$J8k{c1Qi?e)5TQcc>mh0BAx(JgkY*E#S`g0pi!{?zvK(uJ7kWDfz4
z(rR-P6K0NM2Y5H=sCl6{D0QvwC*i8~8|?g=B<I(^PX@M=v)GKtP1F6c^lZm@^(;E(
zBx0D`jUKRa?A)3@-76yvUvpB_4pI7h#owz&&)~N*1X^9aO>EyYCT@GCHQUf-Cp~Tr
z_EU(4i-MAYf1QOuk?+rMMsDSoPbb92AN~Wh>tA$Q+K&AM*~fb0UmMhtZ4$qoKl#U7
zE(%ZiDe7NrdnP+FL(iDkfrC%Qw%ztJAsw@3LV@{@y4Qxfpvv-QA8QdJDNIv`TcMUW
zkkvbRfXH!iMPslh5yt{d{?nR*SbRA@RM$NuTqQ%iueusaRW!jwb^!IQLzZx<2&Sla
z`njmcnX@Rs6zkyAQY?+Zxx;(6*imEqVL2?FQtGl9Gxq47*X#ll*h{S*sX9H&JxX1-
z3iwmcHChb+iSJFQxw3=tJ;BFp&H<@UhQtT^Kl`|fqShs})axcZb^PH%$c)Di$5Yiq
zasPjR`4&z@t&`7kh{~VUJLjiti_pG4*6c$BCnV@|etmqZ^L$XYsQunCD~4$ieyGzY
z@&0<)=~cmCVw-#Z-d+lYUrSWqKb7Ti0}XfLqgR)TUXe^S73v+BIHh}GwNAHm349OT
zkz(bP;@KH`kH-k}-@X&5zXPgXO<WVOd&3SFQY<Vyr39;nkiLAkNgeX(S1&R0D3`6(
z>$MY9kWl&BR=FrD7KmUy)gWJqk4E+|9O!YaE$JrkD~1P@GU7Ym+2cCHkb!RPI>Qnq
zP`q-UKjdW%5g6Y42WNNJC|?>wEf+@qSyLf5RY~S>AtoD>#T&30HTimDV4goyq<`%M
z<*IWyw$fDquMT5jN(cqhJ!ehYSRu=5As1)vYoW#F(V@X@uq=UKr=#sz4lLJPDWv2~
zXI-e2{{e7{p3bSh>~gqo{vx^o4&eBcZZfa%9*O2E(~y5~_-&j1j&)_mI<T`uld4e+
zqmJK@3n~m+>4>0%wfP*Zwh{ID+?D~-^zAbVJgv5wd=sfu{GePJ1>S?qexxCEtw@T>
zxF$slQOj1%t<G~HrB~A~M1>c$oZuRGuQ+Ta9)SC6sr<DCEX9mZ2_WbI()s=HM<2S=
zWW+BN8`NQGC^M@x)6BDxoqx6;khO7yG`xhxwt9P#R>ErTWC(q$7x}jO!m5~;wX%Zd
zG9}cmH0pxbmp7GEAp0Kx`A_l=jx`1AZ6yk<@-VVpEzcC*x=LeS3#WmA>106Jb6F%~
z1I8Yeea(X8?Zyjk4z4leQwaIB^5m@(;8eG?Lyr9i7FqnzXfQS42496&j_!ENO}|`u
znBaYHv&6T`M|lwYgnm<xiMzwR4ZygXc2v(nSLcSgQY{L*0*8PH`FJpM+E-EGnHkXP
z`Y_*84pXSoPAe3sUY|2PP%=bXq726rnI^4V=*A2h`7%ZyUjyz-@V+Up_AAb9kN6zH
zOQfMDL!o9bJm*+a977~#AATmaBl27nF7Z3{nr*#ZpvXgHO2SVlT|j;?MoF^GF(e`K
z;dvo2y-@HZXUq#s^Zl14N^ES@o1}Z%%0P-vqFrO0jEp+9eQ%(kI%Bkdi0PMescrDC
zvFcmQDEFQFnL8(XJz(`R`AR9qhQ=j1657RyhHErKzMvsb$pS<f0R9d)@rQ{$ogdzH
zU+N2sq|Oc$Zi*E5eZCbVgaj0%THcUgOg%K}mmZtaxVOgB4!u4q{Ra@eD?hsb$v_MY
zh!Py^q%1q3U*~5fKni(g(Gv_KE!jh7Ky3F(uA+89*5==+?5ex}N@k(^#XQ)D;{7oS
zca}2CXv&Lt(qS4x8bntbvDLxjm8Ig>5He<mz1rHR+tOMG`9#yE?gCS7-@*JvqkkxC
z5{QT-WZ9B4YKNF`gL%vL{LD-2*E7A`T{pZgpBZWk|KK-!T3X{~+2Q{O*j|)9(7r2x
z#q*oOFV_9E0a{rfc79Cc@I_5E*E^B{kFkoQ?(=^Ua|#^6-JbMSI~zz)w6W)jHsy<E
zG0%O5c~btHPapIzb4Z0W2uEy{wDPiTdzSUYUC5A!7Lsxp$kg=4UGr~iszMaiI`$w;
z;C!L@i{C7=kElztZJaBzRi;oT%O**a^}R<0EFpIIdG*QREct9CO$#vp9su`#J*hdA
z<;8Fgf7$2Z)2GQm=HWoDYrAKjSe(xIqTcEW7V4{EUkhB=lZh773TeFm@BaWQ`kmCw
zy>S7TOg`o>H(E1uhQ<=M{Xq0J{vpO82djz{u4aHyAC<G)PA<zCpnLosL!>OyC{kG>
z<*Xma4hkEay?Q<F5R^?<n@{7vhz2DS{eS?;Q=M{`kG6F;tUX)M;Xi1D5-R+=Iz8GP
z9n$`Mk8_^8qirm0a{Is<*7~&uw&8}v^?lx{#-ZiVKjDIi&YZ)Rr?YoqdU&)uBH5GN
z+R0CYg*wJBjqR&hBHT}Fx+)|wy_zTwLGF;H*o>j?&7A*!{IKPY+yCxkv2=wVQxsv9
zF1&@!=^UM2Ll=dVxcEC&!2+@QOJ9Cv#<l#HA1+4&I<6*O<<>1(r_5ZK18jxegwFB8
zYhu2I=aF9Y>v_&I>AFsiIu%MPcTz-1JD|E&;xT2oAkAWSf0iRBjJK95DeB^O*PQK5
z`-D7g_(l97HaU$T38$h8N2&FtXr_@=FH_=e{liA(mF*P!a;1+!2jZU3L4}CO)<2jF
zuDT+r@d06SBY%~Cm}7<<8n0j_<S-uiOX#>HgWmHQsVCCKYcQP)JtR?AvD`v~6&Z9u
z3zAT~V4#QC%!PqTFQE?@?s+k{_m1#Cz#-vpK^J_AoLfcVZ{IvWJG#8{vK?O^e)Hv}
zyy+kdRX^gfFga0W4}O7s#p5NW+CK1{%9(4C#^_ZI^TF=0q2}ysGx}XZ@|MTFa{`t{
z9)I}8hJ^GT`%zux9SDM^N5Vj|qWrGfBrnUP&wGkyLW=J^M!v9$d{X0h#V~x;IzuNw
z7s{}z6f3S{7m@=vli+rZrr-Oq0qp++;Pbw)-c@y0TTW29UoBlR@jrcpt@s`-!7Ib|
zr01pNhmwi>VCk`$I^Em`Ug~|XEzm&3Jho_B6!Zwq?Ge{@J`s&Gz3-}DYsLT&T5=Y$
zC~o(i^zFXw;=vg&H1eh|FR5V91GQzE-YvdoyQoHf!+9rkhs?EB#O`9JU-IQD%;qsl
zWIa*gA}x3oo;+R(7#*9aDWRlJ#iMDkP<@i3uR7QxEf!k-V0C3d!}{FtiK!3$NQd86
z_p<n+${l;gJ~hs2t=Lj^6bKp5EFp;9m9a1vHl~D1K4K5Qg0yCAE*;}s`I9(8zL492
z6R0!@?0N46yJ?!8_gjunvx;&ZHBqAlRb9Ak=Jdbl4`m2@myXq&u=CdQ&`AuHjSb$;
zEhxibvaxNkF}h+9q*Xc!Vp7!8(Mzi;>dMvkow<?1y%veOKWR-UdL2t^^myM1NyBY-
zSobMz`eX70ULd6>?0bX{5j-m9Ybj8Xk>murcSQRIe3jD3h9oq~=l3zFZ+nQw>w|q$
z3?icqE!lU()%&u|%@>j&$(6}h{VXF925=FXe+BLoIlS;2FL~UpMNG;rD~UIx<F4LI
z$vE%a7uHl`8;n6Hca<!JwIS+mrPx(*K2Do-SqKNqSoCrxo>|kH10OApo^Jd-grUy)
zlV|dL1Iey0v&qZ0F;VrRB98Fng*Iom;mB=lz;{}*gv5Tqjf8c1SX$_o+kYiaYo)+5
zF^55Wh!TK)P2RG4U7<f*AZrn&u#1t4sbZb8D-1F;ZJIkb%h?ec2_gC9B7rF_x+yna
zQNUiuPe)e=Y;%;n0c;uzk1Ww)x@8g)_DnvLSUA)(Us%pImR34Lmo0lEcSNusWUdeO
zR@^oQf;=$hCMPS%i2&OON>WRO))A{J@w-Vv=~~@?6BL`3fhv*exhk{cO&cWTo;x-{
zmD0+Wqxov^<5=+-hDqRQxEBLHBrGfs`snz9Dvx(eJZu9?nR{c&AU4)=WV{UE;&V84
zsHjb3TI%(8$it>bhToEo;uHAPkUOmy<BBm8GoPC5pXj?Eu`{be^mcD#7eqhuxou(`
z?;KB6nelyyRr&sZHpzY-J6+G`xmaMM-}R)Q8n`GS$yH{B+MVk4`)W30_ar^#x;yXO
zZ8~UAITHbYG@K~J?_AupS(j7Hq~wS{!DDAnHW3H|b{}O>7lIcuNjX%Sv%FxgUxb*H
z@$$_RnR3M2TVR@rE#Xt51W2uc)ECN?OtUg4aJ=7LRfjb|N-6&VloF=p*=z7GP7mDw
z!o4SD<}cEuGk1$2(dMHanpS+8)K4F@zFh&Y<gru1byw!T?RFq!;ej&A981IcyUNj+
zQZqiPDA?nN1LZ$f18C&zGJlbxMdZR8J>iGPkOv11f&)p^7a&7+We3+Rgu^=*)7B@x
zHx;MlFR{@i9315V)2o{0&Zc<Si93`AB4=1IsUYJ16=*?n#DWY_?AH%GyKY^}Hh)a*
zql>LTc1lL_N&#{^pn95Lm=H=}wChGo#bZiH4?xysHJG2Zw3x*dVufN|;uRgok%ktw
zFTbfTk~N0YnwHEl+2M7(FLM^UG5&4LJW#8prSWcSniqZQ+q?^3ZR?}{7%L`Sm6*7~
z7-i%4P@T7e-1&c@`81>7PDzdEx5=??cr#0Pmnz99o^E{HB=7D@CCqB{W7~2hJQAnI
zxPSF2;#p2TeW0|wf$hn_4Lia0j`AryEO)UJh@O*#JTPWzNEH7FxL^^o4wRqe`q5<G
z(nRERF98ui5Gs9_I4aZ3kMzs7`99H?)pGAY+59C8mGYr4-{p`pVAqLlIdtKv*WVIu
zDO)2vB{A@?+;N-O%+_Qaq0JMjC>z1aMkFHFOdDPOft2=m1hTrykHB@x7Lq`gA<1@<
zeabSL_EK3>KtYNO_CNjMivQKhhR?6kMzDMIA9d9nmw+k}|AFjw=LUf3)M~3WJc5Ii
zY|wYH*;MaBy*Ix<U>fj@TE9$lvEdFE%E95LwK`a*w?6U((XmEZT$x>Q3i!n*<LAl*
zC74=&ofX&MKI+{5Ffh1Kf#=dhCMtUVA&IBo$1KIt1t1tQn(1zV1phbd9%Zi?N*f*1
zN*aoZVelU1BvZT)YEWUtteFMNS{KXB&D@Q3u;ImzL|u0Kz{wk6GhI^AjFF}}j&RGy
zxv!M@GnIYkvD*6z+kX4;6PO3Ng7Q{Aw#m};KJb1*!f38uXorQ+(E9oPjJ2l3-N3wl
zZx`J?X$j%SQ@ak+#{2!kB+PE^``DrMgq>_jrJsRVOS=SaIovk*fDhw;dtj!&j}4P{
zU=2XlmIVjdRM6JOTp)_jen-N%GV;(WE&5=)i9vo%5{)PDMQVwkZ_PO|Vh|c)Q4b+H
zztC?tg~;s&u~?rfuAQ|091XV;;zvtGqN5v4b>vpyfnd9^`r#nzg<@^5RdY(vxk_X<
zRw4ewH(*LO>@O^+hXRObl7f+DvRZdjl<Pbs215A)c&n<&?5+xv701`;zcTj?-{FOC
z>pClp@=fy+#JkGAD|gy8_R7k#+24}KI>2tX1{Q3C25Y{1rGIXNnW)?5-2WaahqeDG
z0-Uf(-!s~;V0>8*$RZraf7ML}?g$0pPX-ZtZmgYDnRTRb*Q-K^M&q9W$h4*Hv$rIE
z_3&D;9JPchgt)mk){YajPljCIHFl;1F#uODpp_mHv6yu^#cDq)svUcrmc#oQ=R0m;
zfmOM-c8I<qaK$7l{AyfNTksOXsV?s)YIm>W9xKD!!$IdSEqX$CQ;iQAu^7br%}+{+
zU=*n7?=mI$9uo{77^HKWb*-F{CLEw7UZv^~2CvAvZ!IjStm=hKP=3un3<e2oYIe*O
zC9|+l(4ZLM#-EN&a2uUR1tP4Pyt6OGJ<z;Joy;-%HrQ9W&IHLh6{B~iT;A4#gw(35
zU9u)7@*@!<3s)3Hep{duw2hcO2^q4nq0sprH&o(){1Wapsn(-eKGmuofy6g9(D?p_
z&1KD@IlGoQ?qQE5dL;C}`X3)FaM4u%*mjHf<d`J7DgV75J(aSF-34Q~)6$w61Dh&&
zI%Q<>ox|*jR)CG>SFjUyQA1Lw?SXf-{s9c)%7%lBrNokJWLmHsCqMxv*!WWuGtxxZ
zSrKQ#$^Ply2Y22#=SmJQQ@aV)Iu8Do+HD;had^x5mNX8}k6>l=V|`+6TDPGXUHWyv
zpdxI}og2#JRU6SvqlG^dl284bV82A0HV?~lfSbVFTF^9_s;u~^y_B|}8sf4G_J5)?
zDJv@GBXPkZ8w#~<jX1knVT;)Iy4Wo4n<<gzSmQKi(^BnTpUK|CeVNxLVDLR!IOeVg
zNU(i{Q6`G!Dy3dV<>C@J72I&mBT&zDH3xLpV$dCu)UUaAS}@v`0pmMT+{ST`Mguoc
zAWd|st8{Ow^S0I|W#4$ywygQk;!l>CVIh}}7y2TXo-hgyNhQmMW(s>73Ag?f^xZwX
zva;enItwcn(Z9Bf(BAA%JW}S^!J>Q8MYcTd@xd`J%SV`4Gg*eR%WA-nB5a6W)bp|)
z=nU`m24~`%HE^H@J!>@~Bcs&RSRa|ptcXo_PR^b)%o-ZAm0H`LanSf+b?H8Z@Lndp
zalAPYpSfP%7@fHPG)M>#{|x60Rg$^m*G5Dj&(k0dPPkY>v}H2)AgOQr7?_G&n3er;
za`FiciGV`;!%5LShq|?SGY)_}UPcim(#nz<f~=k$z=%SW+M8gg#E-?Pr(z^EY7u1K
zya~r1H<$H{{>eFl-;5soJe#oUY`NpdbhUdled%8BX>Mp8=@rBa!7*Ez&i3=gJ<5Eu
zyPy3Pj<0K-G^o@sojAnppyyGdwmv?CXb6L9ljr+>mr#!oR~ZEEzrTf(f`}(m>@+&x
z;=l4NY*%#2uk(%4>pRVWjOB4I1*xkgOU#(b9w|1Eiuj$CdW0bQQ69+D-t4K_=s%to
zo58vOjBflYZ6Vdi6cL@WvqqVhAE6q~R_@ylXVSv|QW>l)H93s|EXi4|3ofKi974>w
z^ODJ}M6s5X>?;^UX}&a;XpWv^2)%7o%hT7l+y&`Zn|d$8Qy=B9!don!ebjh85l2E4
zxUgFJ_JS5tDalQ=@=Ji#5&X+^Cum;X4-~oIqRKp&5~3$Af@EJR(d?H7y6QIAE~a1;
z56Xib5z9FP?-5d_1TlbhB$D~*OtO(qu>(s$nv1@7whQdGtc;$fz<fVs(Wx+PIC0&H
zVE>QqX9EvRdm4N}XjkeS*<O}Mno3?OpKI~P=4b)K&}{AsbpmG+LA>ZVqr4gMdj^bl
z5;dn~|8F@}^{>M4O7n_ML8C+A6CAa9Wh%FbAcs_*`XMCWdI+TlRSn8e6#^X*r%6BI
z9XSrxOm!BK+4imh2t90ijxwbs)8eEprd_<7rX;MLoNG;n!VtB(!DAUO(^TLR?oq)A
z%eE=uTsn5`hwsyjeE>~rLob&$2RdLP7z=7M;oUj;fXGSBQAPF%lX5e1*I;$rk}3-H
zPkpBTUP96lR9bA?i)qMO_?YM<JGx_gfGg!D@OIu^SxRgl;#{ViXZyp<d)75jqw&#E
z<eph?8XK?p9G9@q1F>|rk;2r=3E!n}9f@RCAg)eNXU#=oQw%&|kXs)#nF>K+VEm5h
zxZ+B2Vf)sh@81pstpcsT4`U=0C+|*QD$pU+L-jT!@!!oACMKRYpwnahruqyc!6^N{
z1WLC{R+XSG;0#O{q|Q_Kp#E4{@Sdwpx~ohb=iq^IO|2;vFBf5iwwV(Zc*dho%U7AR
zc{c>;cSRj#6qH)T?Rk)5ExlCdE!(keptEQxSd_jUk8X3FE;glF=-hBI0n<c9G9N$r
z{F`6x<1i4147yfuFrLVTfn<WlMOmWr(RqnM@0Cli+W!H5{VIboO(=Mz+FsC*7bpd@
zmjW?X<BRol^YaPwApYJBFQ^J}v%Gmz)_`@!v$Cwxe9T4NcFPXYW%d!8Rpf%P(xatq
zhD(dxado_{-5@(ye9*$*6(Rw+)l?#z%ofpy-hXpy2Rj528(YnOU3k@WJd<q<0S*qA
zXQ^Eb<}4B)AA2AJb=`)z!1M<OJJsK27bJH(c8Q3vi`lP!tsY-;MdKG^BloyU|2j;N
z_GNMC=ak0dWbSJ{j9`a7X>C_oYUCx&nRbR@`dVk|{?44P$4fR^y}U)S-EYjYvgbHJ
zKQjn4GAniKQ2P3(R$HxdPYQ#N_CAA1T~3?QgiEXrs|qAJ)0##55$%D%^1w-4MT*uh
zs@})?UgjG!VXiGia-@5Uj3Moh;`&;=1rEq0FS#ht5B>ROf^o%THJlbFMn5t}8F^CJ
ze)()uUf(NcOP+N3@=N^Fhv7hOs4i#!VyKCMvsL!fzT*>_x{K5-Sz%l-@9|;4@`WBg
zab=u}Op3k>sfi2e-qWl7@S!PTdka;;h)zBz&b*4Tsd<L35yN4o;;j2GZc_PT@uBk4
zrlc!oE)fA{PiT7#fQU@kXE8T(?n-t=d=bYv=Aj=jymT{;<Gwy%$0m1gniSHzg4=fE
ztMv(6@oq7Z?ri$)=J0P>a&gBGDNOk$Z{LqTS!K4xX;uXA53yTAX$->|w)dy>lxw4%
z2>;$Y>agwQ!Iks|A|=&kH|N4u^pX1!Yq<D9{GV)Ahv3&~1dp3OM+YXe4;fD9dqKWe
z*zRwl9d6MU{AhCtxgD(5$Uf+^7JU@aOLrp10$r^Ea@sj&YN8&1n<J!CIYs2?TrALa
zCxc->lvv;`rj;LUeWkYLsAtRv#O;XDuWlgt9pxeFA>+1SJPvr#LhtZ;s&*9_x`LaL
zcMw$CnkD<omP`W+o9}ar%!6DX=RoF*G=TT<beQRQg>ak1&GV)ox`8?(GNc$GQdjHt
z_gJ&SlB<Q3VcYiW)M%maj(lB|5JS`)mR!9`;P!b1!4J?7>znioR|vj^LbI>*jxb_i
zXb%Uc+j`(BiF0vj>qP08EkS+naX-;bzwGegv{|*c=EI)<fNb8+WsUFSs@eEc>Z1)O
z5+SCDy-&BbW0NC%4iX^*JY(YlEcF;|2|C>5JL=g|L!^H>V}c?lE92*ZKPcK^6vRIU
z#!cN2rVxhv3{Lr$n3npZlu@CBym&ju+6cdqhrfj=9THAKy-ReqP=oY*+>a~M2xxw5
z_-K#cQDBsV?B->qbWA^9bUb6#c}C#RA)#;)dl#yW8oey<14B7h^G^TW`Li|q_A?}Z
zAywL(y($OFdXVhgoBuDu&MGLbE()`q9}g1T-QAtW2`&lJcnCDsI5ZBy-95OwyF+ld
z;O-J!gF~jLY96MhYGz*h<vw)XI_K`azV$_$Uo%Z{GNCF37Hw@vGKns%n{m7K--#E|
zX=?+y_$5BWq;FRY-0nv?5#})J`Jm8z$<zaVb8M+Iy5<|<d=v)T5YNnevIV?)^o)62
z_X|^ACmawS|1W9mj{Yea=Q!jX8n+{f-u#}rb*jhv$yNkiWXjehROAr5Nrk&rabx#g
zuX2=ihf@sh8qIdFnYs16YL7B(NKT{6IywE`JOu=yMcv(22IS{A|BjItb6yak<$xA#
z*)+9a{pMheLPs}0e>VJz#yP^yV4W0H3XilF_Vh_Fh)ZA-kO1A$bC)V0LGKJ!GOjJt
znB~XWm@(y^u_xGqrbji=OJ;XGJ<^)Z?PXtY@-X){i}b)zl&D49KrZo0`Okjs?32Pc
zWQb#J0rYEjoSNFQ{I17k_g(@`8Q1tKuYSs@gPw-I+n8-89FT^q<!_N0P?Z}ub)U@f
zX<^#MEi59ef56pA_2X`}hpkD6=oJKipU7+E{SZJnob2HVIV?m>Xy-m`-?s<83Ooll
z@hWHD-%T}yCR8eNpna7iE#4(7bVDK)6jduFEzb{Ury#jAt}8BVV8^!>>C?2|ro{Op
zi_XkXI9jC=H-!19v;EjaFmL2Y5}?{ObuqH7_x1|>=t@&A{qe!kOWF4K{#XAm?-Xva
z`+GB-f`udSM`5vnSQ;UCPV3qsm|c3H(g=k=WVF}ct<_%ZN$Lp<c?LBX2VP}jBK`r)
zTZ2L^9RuS?;_r&(uGI?=1vN^LQDI`;VtxFNBwDQw7><NfK3+2nb6{8^sI1F0DRy2R
zXMPfNw)d$8a09GI8Wh0Anv2TT_o4eW<|<$K4{+kb3s<vh|7g-+N1;Z*7(cPZljB@|
z?L$%Z#q6@k^<LiO8(SDjyhe;Jb({i@gW!ITQ%RYttz?ukYadU)f9}CFcS?FS<t<T1
zD5=~U?VUDp64#Yfbw#$}ipYHWrPg<8w`Jh_^c$0L>6S}7^sboguSHZ#BkwHScyL|B
z*<FHLNkUrT<t4USa6InW82^OCAAmw<!x8HZM)q|nLHs@I<Z<TQq+{`j5-(1G0`2wR
za#)%g4aC$6CjZ0KiaW1L38$iz!%1Q<?IOMAB-3y(cA=O7$w}hI`BU8KrMny1nZTem
z#odqRF@G5=lJcZ}Yp5nRD?j-M@@QHO4YeF<w4X>kONnosg!JvIDKWQZFbuuG7TUiD
zd`sV~=OYwIg0WJM2>+`}U(^>$w##=Rg5N8>1D5xr(~#M)bvM_xU1^0glX8TumDLv}
ztWWvyQM#6hKPs14v<5v##g0`)sx_tc#D0+y4rrzP0pYhzXB;9h%#4(O*5y9WQQvd4
zaHcHJo!@V1N<a)#BSB;48iK9j<6O70yxeRS8&by+zghLi;}KgWWM}<M&yhPCFD0qz
z`udf&y3y%my{+QhEJmbsRr3>}NTBiwCaQiW<AkbU+%xEh^_p+&9P!3KK*pyCo<rf-
z%h|-5_`8Ps!t9-kRy%^3r<3YputoTc|0Yq4w^XKv;jleUrwvV18QWmomori8dAp;p
z?uM~$lsoX*(#2w=<&W$sC%Cczslhz6n~~KD{AlOWqDS*cuEaxFIX0TN34|uj7^8I$
zTzW$@>M4hmx_X!q4_=DR&zecA`k1mI>mY<F6dO;mY0dRDOE+2JBlmzaUY>^+Exyg$
z$R(ImhrxUe-bb^3#Q9DB`&))rw+y*fQJrhxc8GjByPP`)|5Fzaib|g1iYa)scIHh~
zLvgWd)Jz>;nYCPq>GrO&V-j1Q%41g3)F7d7`?d49V%S>b{kq^QS^-))=cnfdH@5`6
z@&5$n8o$d?aQECj!5V=VH73YZ9r>P?FPjVArIi~rvKi@OX7}}fD!t*Oh%Cw3ma*sA
zpUsv6Spo{}`Wo09%ldhn>(Y#eF?ZJeuL`Ns&M&ZrgOgio<n+-<^fDDtVMA3X;K#9&
z1Vtt#Qz9~-9S^VK45j_()CX+N9S32HTfB}};GjKuhMOZvVJQD>*)`LnbGb`?dUBG}
zD%`z|62O&VNAb8N<etZxH%J-yRbifZG^IGdJi0zH<C9mINY=w%PT)iYqXjEPhbp{1
zg;|#^ZEZ-%xrue_-nBz5Q0aH)J9VS;xep5{fp)yS6$7~kL}UA&c62l8<n~p?%kq`=
z_tsiKO`n6IFBle+9rhU&q!t)<aU>+MxM+De(xoSmMOQ+vDkW+4ojo6paF!>PQN22P
zjXpi04B!^P1+j;FE4))sA?zv#W`hOapS(}4n(~tCYehR|YaqsTu&@%S^#6n0PA!>U
zG<s}B!hi68)4!=A9yurSJI-2PxfW!J0h1)&tsQC3lgRA4;|UIK5=_kQP8r%ky*^&a
zD_%1Vqr8`UDtXz8ey+M>HjYcgo3I$XEp~YWZs|)xKm8XL_>dhL2P;OfHzqz&uq`tj
zXSFA{rCVlBoY;G_;+k5a3ZIB;{IF?BzlWi1pEWYOvPP$0zy|9oh2Nq{j((uX(|E@M
z+eBh-Qg;TWP60Ijz|t|odMaY4s%}|dYBYFFF@0S0{%C(&15z@0R^;G-JIMsCN;*1P
zWE&yGyc>o@Zm-tr6yXkiE4mz*5+mgJ>$0b``)B@b;Iy7Cb-~A~k;8OTRI<NK%crE{
zebz9ZX|1Z--~MXXe5|~-=Xkc*`P4d9xmmzlxqywdAn0i3rgA*oEW=O!Y<b1WL(5Az
zMnI@HxZ3<mPZG(^O--Um`^)wR2dcF&0i<Cg&DZ-&D3R`8Mq<JE3_yy|aQ}`HIwJ|B
zIQ<!GLsl{WAY5?Sd3X;rSTwxHqef!vgiQnxSLXut<E0ePLhOwh0|>)Yha3j(7$$Cu
z2IZstQG3znn*w?q5T7&qTIx6m;tO$d*#*Q`%$ALmjGgFWk!a9L5<fAobal?{wYRj_
z5@w3ymbVR`@hEQoxe7N?5eBuI5RPB~32%oVnxy4wRV1rvE<cXdUCaKOx0d_|K;o+i
zJX_OU?;SC4Q4(m0eQmRyyb!|5R?=2XzHHLHaK|$knD{T+U*ywNP3LSu#6n5*W1$3m
z>gnkp=1AnDIo`F5He427i6K<9%*6NPi=WUl*Y4jA6UVGsTPXY5-Z?|{R-}(7(Vuy$
zmuq>^9i5P-j+fKP01?I}uQC@cd<H;m`C41DPF)M%`RDocH+P+ZqAwiqG|zJCKUB1-
zC!t&oO;M4mS9NiApYp_Vjx`N|qE9+V{@y^{hp<CPgic<S7vbs7JX{*k;C5nPh`Ge;
zc=ZU?Na<>uWKKO#RUe_nZ&UsQ<yBwFr9jSDX=96Z+alix>GIRZU$7I#h?yZ^lPeeo
zcg0v7>60ir>|Et8>s<gzehvJ=#&wK;9x&LPJiOe~GApWNf-~Act3Uiq`veu&8;(I?
z-{;{HJ-Zx?^0=W;))2VudNK`ra6RhbdV~A9nBHUzfnS>9*}xzi{ws8#+c=d#Mdy9q
zEWy<o6FAJFx!xPgS`@V<()yC)TzJ1ZEz(CS5AI<_MD#9SYgk`i)qguiN$VyJJ^m8F
z@2bhbe!eSadRuWBW_^tO@CA8ko9S4WHMS%`!wuuMQ#|p{PjKqcI157P7|=H;1rCZk
zzAA~InjoKJ&6_HnSRdo1p<tCi#)nmweIik}?^Q08ZloEf;A0Z?mRyhglT3~0S<|fQ
zF(O4nO1_~1n348(e9|RpBZ)m-Wski?O?fHZrF`<oNBcgKuvf&pu5om!iwh@j4l1oj
z^k2Za-^#q_)YeCoyg6X}720QY&}qLtVJ|sW-1_b5si8S>SN?4U*p33HX2o$SAimSU
zew!BrD@n7VnJ<Y~b3rp5`l0r7?z)sd9^tKlu3sG2F$Dpci1&P;Ztag0y#w)~8In&L
zi53%$EJ;xO0H=dBKe05g3tQ0c1YgUxxG0X3Ch`_eA^v<0o`xi8ZP>v#D*w#IS}oP-
z^3o4p+W?A>6QdO>`^77^tzTrShO-{S2W^%#gjFYo*5VEmXMUu(@b<R$$LOfEC%wn@
zuX#1Z5aE^;IcPI`M8^(QG__$G46`uxWu9wqJS2QRmrUw0cUHv;JW9OXE!_XPb6*rT
zCV}u^VDzWP=0_D??_|&uvu<dXj3S=@4tiiFdDA!OXFL4=SQ{kk+80t7FU}_y(zjy|
zKQF+b=}nx)0)&C)*>DpZ&Swh6tiKCY{j7`Ugytsolp=w#9LXmAtc@D{>0WKsPlmq=
zU`S}-=WFg_9$pWu(&u2>6w9!96r?!8k&1$jCYq4lQ3Bw;pF>V6ZliGWK|6fN_i|yp
zkqXs1hpoxx<|G%^R`FyFBluaB*g64Xp=yE_*qCU~)ZI%GTuQ^i2i9eYc~P4el-Nkx
z<|?HNXBp<3=L%2&+Wwj?ZJTFX#kb$-#6AxVyAYE~>PZe1=9lQXM5a$Jz&p&FwCq!@
zhVtC;GeyJ(pZU{oTf)`9RKdNn14FwZYDo(3e>ERmzxMq|AJR1{P?S4Rx~b73o5CWB
zeUi1-S`*WbT`F}vHh-bj*Br{34Rc@5=NTH`bQn(HiHd97aw!h@uz;CEnRBXHo#Vm4
zqU&S%S(~jh<(&WkHu<pcU9QpES}({9rxqA~YY?7`Bqm?y;Rj6gn8h{SRNT5N0?i$p
zSQbb-_C4*oe$%;GO(L0p(o{iEYASV$`)GuNJWF+wjZ)0Ddgveu&Xp^QMctS%a6$3c
z>c>kQDAwORQLX6B^x<QwVoRaEHlm4tP>j!+O2*zzti@9uK<_rHrYLW%pF9`AvUYse
zj3S00h1^JZnhUE7L<lLkPmJ&cPh(g)>aI^^I!aBo4N24(sdY*w+Omrh@D&hR6aOhH
zZ4<JZkyEm8&WOyEUcvL*muL1Jpd>%cB6tU<`z<iYPJGdaL3N5~@0w+$^WwdbjrW4g
zi)v=0UGCVV4>RyL->jCHr(zTX+fe<OhiezA{VrQ0Zb_8^6wK4QWP<Lxen^5ySvvML
zaPI6yaIedJ8T6B7#W{GSthF;4iI?S$O^!-<<+N^`Z1=wforO}CN9JT{k)ABZ_jCv4
zmjhr!OXA|(&g$3+^#YLuCk0luGzR*{Qt<)OZ>xt<3`+WA>%v9M-FSJ`#js;Ets*~a
zoLRQ;zhO9r|Ek-9&n+xX;ljP!h`(SXQ*KABbPm2};GO&faErtL`t@)G(p(VBE~ana
z$f*AVV+TGX8{5GAQ<)a?_PX9$B_=ncVCtbQ2%@3pjqyB4OQdLe-H1x;)LnnuDyvOp
z?YD40|3hcfU3>OqMnfqn#y8)w7BxG*4jBa9(PYV6isg!$%T@N>Ljo-vgiGA&SLvmq
zFLGBKUs6V*b?&A^3alZoiWVUZ1B^p5dxVc4Z|1%XUZZCP-pNA*X3)~1yL>0jd!@eS
zV8=J5_`l>It5o4}B7?|@lKABgG}pHjSUCqqT4U|ROy_p#Q>OIghP?=)Iic}77u@Lf
zHl=y-`9c7WuzmNyyhCK&rkeOr67=-z644!J*Chp)l0lyOkg#Aoj-G!2AD4sU#&kHM
z&k>056-Q?FGulFU<9!K?r1B?{MtW;?-Syeadeam*yvB+*>rR`U=XR5&1(_o~4sZ^#
zt`x(3Wop{E*CDM@GUgvkBs-G#tu;-?G?Qt-FN;1U=8K65JUzoT(pnV?g(rr)#exdV
zD98HTQ|VDarxsETG;E(eP|_{&$L57T4qU%)Ytvi4sfu!hWkJ1Emn~{jD2C*-9&D>#
zuDS$3ZW&j>TXL5(HuAKxjGz50QyqTXJo3Z9XO%Vmwijw|>F3Za!9&6?gItqI{mff4
zR_Q~X^Fq(flF7edRMI_>e%N7U3ENqqGwWXKTZGdshd|RBr7n2OkMtq@K-cX<CA)@B
zgVcS(Id@FjQ4YsuBOB{s+i&;$)cTzO!IdPZ&8o)WJ1=8WXo0>#CX<ukJS+(wI}E%2
zCpSK(?u7;D$$GT-rWCkO^4=5K$VwdfAi3R?KzzVVzShG*Hn5(&C?8XDtveQ_(o0)#
zYb21JCvbv1cWLsjW6Q$7aX5-c!pXh+CULf11@21#o2rt7JGgb&ZNTSh^i@)v>(rnq
zNm?k#yYS#njLKDZFG}3!?*h!}SDW<z76afVuJTD2ipZyFnbEaZzYZVVR#{Ciea(^S
zK<<?5nBs{Jfz2ID>=-kJ@aRbd@kXRw2rbW-$uB_L>rk}T*FhRLlha}nktkquYXZ`r
z@p+13vE=CTlSF+3U1~&B!aYG76oF+5f26A__||uU!VRF5{82EB;7z4;WcTe({)xaR
z!&Ps-zl3Suv)T7%pF^FRpi>Af5Q^`J`O9Qap*5$R;vfQ~<mRs3RT+{4?v{mqZC;?!
zabaBQCPd+cxeRp{3F?m@lz2@8gi6=MlFJ-TSCi=9Cy*FO9q7+WrWczrrp#Eg;_33X
zSpETElMIE^r*sLec60E5`&OI4c@yH|WcTJjd0u-vXmY5pPZ}*Lqfoow)Ak5iJH{dA
zR63tnZ5Qhii-4{PddjFZbQl7%2l4w>Yiypoiv%H(TSNV%>>e0RE-GxU?3?s{*Vb`r
zURgCJf`Nw>A)Yp(iKBha-4_P-6U-dEkr}k%%LNYu!B|`j_TtgD$8~I#Ospsa6^$dG
zHji5me+Yr-(|9LK*ZiqS8LA)Qpidf1BGM%W8^b}6qA`ak@Q>!_1$}klG~#7i>L-W;
ziX)|2dykQi)fj`!tf}pJc84Dzhxb0-b@9H10DAzdV=;LOC`a~be!&d{3-R#%Vc#~>
zq4)OB{7!CC1oh=z#qIkp_|j;ym$oZ@tOUV7FK1Ela59Zpa>OG22bi<c1ISrxzMrD7
zIV?H!+X-bW9wQ4<+1cS!9{&<4(I*~hZ&bh|!d0kUHJs{sg{XXaP}g7KV5CO)bz<j|
zVc}}a-Z6hww!D`+X(P!>9Gsd=Y5q%Y^b5BUgNYA`W-u^=9hCOL8QkR{?h;1ux|wfg
zYmIE&5c7?oO+{~GutdMt!l^^K(o}1?lp)*up@<J%a3$G&+Qa63FLva4ez!j6C2EvM
z4mR2=?Cb*EmACS7o))*@T23bv+W7bwLZY+iQP5@V2*W#8ooc%aa&NV?8gOLPAhl2O
z(_%>FS(Vv?W^8K~Lfc^$oA#?I_bK{D=21K<P7?8<K#QwM+2<XGPAnPUe!Up@e*hjA
z@vXFCR;}-s9A<<u@O$e}QRbzdQL2P)o4_#s-QPE{&(YymUu<Gbql#liP>uYBb3VA3
zb>)+!RUP<{A9E|($LRa;kxA(ww=_k3qe7uAB}t62I8|C6WLua;q6J0|Q{9~SB<H5w
zw^!nfS{B(+o8Un&b8p_B=dBKtn;bs=d~k9En9k)gB;ObY@DtK<wg7tsCW4}z2-k%(
zu|^i+1|9@Z2!$+c%<~{9tsU}$t?n^AQM;A;O|_RBa=4L6DlH5t3k~{T$%MT22!0}u
zC!Yyfc~(BV=P+6u*o?oi|G;Sxh}Uy_C<++Hyw|sn-K4pqpwapLAC>yLfl3O{;Kr?j
zo!+Y>Om{`*OHHuqezSmBGE;nk{Kn6Z+sR@sIkkU`R6NSLq4j{Lrz{P9#iIK6Ox;Fv
zwfv+@$I^|SI(p+^CjyehD4b)^$^h(9Jvx5F@DcZ;6Zis4?i)1QYT*^Ul95A+g^oNH
z2kO|(G0b7P_*ju!KGb4q?D)i?15bR8b8+GuOyaJ$#+^#2wXq_5KEA~1EQ*fADS}hD
z=1I~?XdW$LuMbtCB=3KjZi0U)`Y4ED1Wh2hqh>9Mj9x1?<zT7PbZgh{W6ztEhA+#u
z9r>rPHHWZd(aK~@m`)Q&IF27{l-HQCs-#H9Q#!Xt@m8l@fH6$oSy&gNSZQafsqGwF
zUBq)vbxTYnkCfT6<}fa}VxC!VmuoIHZOvU9x9fT^rTyvq>1<JYnK0l3kogZ&<aDtN
zRkcDSZ}Ip<qHa!QzG7Tc!3CKz!r3@iTvnzJ`JAWekj)3qX7gc%hDCM^82F+Xqed$A
zjIhYhniA@_8H>LS{sUM&JnAU~BK+;l!Iry}hgR6$Eq0)dP?It^O(2*lp&N=Qy)#g~
zNqCi{(PC$c#(0O{t7i{cLqoS2h_0Gl%dzz2G{2^p0LUAE|E9ZyYuZ=x_bUd+j&%_m
zSmu(vm;$~dfSaUptedJFN|S>wn%*>v@@Qj5W13%9lp#F+X|w_2&xI7lR%{Rpg4-rW
z?f3Yc)dpJpDoUOG%Z6zo!N;XMJP$^S59)qPTAcDL=^wVYV6LiB1YY)@Kcm3u72(ya
z;_P0VLr8HPESq+7SDIy{;X<lyAZD!nb5D^wPF9wGjiv~1(Z)UdmQLZE)Gf2?zrBjh
z#Sj@zzbfmBmWN9QaZYi?d_nDB+#(G;6dqIVR$3<2V!UUXxW7q;dXTqFJ5Gw-8#3k9
zs<IM4Ar@hYRm3iK3ETY`A2+A?i}kDy|A`qes6J+O1<j;*Mw+Q0<Ku!2Ra)MR`r-|+
zF}N{=<_hFn%@Drf#AiCr!Y}!K7%|BxHTw!z3qu4@o{M&!so!!L@>ItmKP-rxbirim
z5^~!RsEd$++jQ)6dHp~Xwu;QWae>7&53$hz|K<Zry{5=P^nidr^D=0;%sPDH2LLs}
z>c@L}+D^nS_{4#^v}(WA4!LJKO%Qh?1yfhH-mo)@#G$UN_i52?CY^sw`outdb%vva
z%KNE=3GDctEr{GghD;YUu{KyTgcnXL?}SthO`ookQK-h0BP-WiZTnE@>mK!{!s2Uh
zYtMnuHT~mI&@nbkyPg@c!jeZ=C%DyVr>1Y|d01qGR{h-vM2Zj^{P#*xyJ<T&j%AiL
z_}uC^fyA84fa<~y)9;f}u*FJ`-9-Ys(qwGh>F0yKO(S6BYw7zG)jkprtZ)m*3P<x=
zsyB^*;n_Ct)TKxUo{f)v#uSO1W$0>>)}6+`)$RSwT55O0hRt?g0ZxtS!GA?oNIfMk
zBcn-OVRRhlKy|}_Z83v30?6XnCkAIFXSt|Cl3N6=R;jy1;xL%wjg!5m-8SV2-8xI^
zf|zz|uyC414y28Yo<92Uo#AwK<|V~(qrg=Od0Eg5aLBb{;l@_~HSErQ;OAB&x~B0e
zDZMK&A60hMF&zLXKu*-|KkL&!_8p=PhW#nv;Y)t-!bi5pK8i<dP)aeGj7m)G;}p{>
z-0Pl`e7Pc}c(!IwUqQFS3G*rN3c4ZoWM&y1V7n3N1iFB>RwB(J<kvgZ*`+<_8#jbi
zq`NL?QF-0XkP@M%cg2-sn|cZ+M}skp(^V|RRec-613S8IX5wCC%%PyERo(pf{>E63
znaG1fZcv2##P6=a)(eu@>vHoOE)Ot`AgUwc1mX+KMaZ9_#ub@5(%fbcI6<LjZhnut
z&?cGT(d=?lVwS05#-4^79+0Upk_jCyGUd*dLo(5iU^w~*AQyjC^&ZxI$sc5}M9*Gt
zzq&;s88L1D)!Y!D47Lf%AY!m>c+^ao^->^F?)oxzqQ|chA1f}YyQh)BVr1bg`l_<+
zdt4<VQpXkgMF^5R5{EuYSYbu-RZW$~OZI~Uth9LCK+s67zM2NN{wME4OJKhg5c@uH
z65_CGb0H(Q4s4l{EWYsSD7v?BXn{Ay$P4`{?-~P2-z7=?t&R-@in$QDcGtyRkX2X3
zY`c`x7GZ~-a@gptNt_SdFns&CsN&a-Zd=0jYNyRxuk_!y+<yQ(D|a)a6IiD>Q&Os(
z3An!@<eRq;QSU91<5i*U!Ua3HyYb67Hx{q%M%^@wBa#}{Zf<IAYj(BF191?zw=#QH
zi@KFlC?2OPOY_@p@=SIkaSgDL@aV|$#BUAzUlZRN>CZLcb??QRTnDp`xe85*)2J;?
z^P+39aqODL@v`ThFVe$s#G9Pe?od_rk)!(Qd8>-#yy|fo7z;gC^}kuO{tr6(t1~tY
zjnj9@GVM@7K|pp|9_p@Wew5r<#)02=*WsU+%J=4HBS&fwcerfE8*WsvgVpBz>PX7L
zJ^%=fll5>G539CA`9_4T3H#_ptjhOq%HXLLj*JO;K(R_w5w(EKjg9Bdov|IJT&lHy
zJ9(_*5(4{e8o_DI*<9=p@W>q4*~Z4KU2>96>Xx=Gn7mWjfU)&+Ew%~4r#Cfp3xUJ7
zWkXWmhNKifyqi2n_@zUP`w&%Y*~FXrVVj)1b*KhcU4n^l)P+FcuhPFC|KfW-kKS9O
zzcBXi`%M6c*<MeHH~S!eKbX6l{G?O!Xhtr%G{*k6wxJ^!W*EQ2@PWkUwS6i5#XzpC
z@1|5Cg{wXD2(4c{nCmlblp7eeqXxbO-z>-sJYck<@nxvhH34n)^Lc^))`C&-ark{$
z1K~wqqbe<-Cd2rFyp<E{mqC*fdR9lQk#iNR_Ch!O8D8}8EswGD1OVL2U8SyJk*k}K
ziIYNpKuW%c4}I=|mwzYL&$y|PvTVk*<-r=VMWLr-=eNZo+{MJcu)XNSpiG-wt+(t}
zd~TAIjc=bL$-m#e4w@|HI8Q>X(QJ@}44>Kmy4dn^X?P2cRtseZJp2PRG9Mo%D0FC~
zS&k3<129GF%cid$LfCdKn#d`~_`jaQwlS!-?g<Ut{tF%vF7#aslwK^d+;W7YtlRiy
zs}Qb@Wu=c5!(}oGj7Ox><9Nz=sihMxCEqUemZLH+2zI6F^}P8$-0dmf&h9zvX0*?(
zKD%@^x5dcVIL2{mEa8!X45g-UTcAUnGH!q~-(Sqb&F$GkK8&LvjervSD(jU~se{$c
zXIf6BNy!Jb)WY&VRx~|y-xKK3WmQ|Q$Ek&iDa*niBguj<)}aJC@g=SifzYS)xrJ(-
z)fF8Jhe+Di8`99FzvWG+pX=IGkH?4l!xbKv>ibF*BmTrTCx9@V9GCvfu1paQRUhef
zzt$g?5XHXYx<*OgvsnA>$qt%U%Kp-$#!nL~`avYUcoAZgrnk~cgh(I~o5e1NrM`Cc
zQZUwh7M+r3)$CN>>rl|kNd7Q9Rg)Hw(Ue}+x_S$?U)@-GUMnw);rSke6Vzw`6<P2U
z>1?mGWpNY_Ppd^##dxum@66j6rEq_DsW3Btc3B&B8mTPr4<gNmIsd}RuPeSkwybMI
z=tB(iF9rhO0Qe``3^B6m7&GPuYWY8SZ`m`K9Dfm@UZq~QlDmlN_HD>nVa&)>+yYNF
z5O)%;^M=6jYM3{}dXrhJ`fW$wB@?9j#SB6Zv_jSB=P}1q&0rQp069@vJPBh|)WRZC
zKhI%i$A4t_ix@4~X(Zc1K2lvxS!~YZ$7z1_?3mtVAZ{z-tlCkmQk4FqY+vS-JdPi}
zPDnTX2yl7B&$IbLCDHTMghov4KtJmK^OEw;ZozeW#Pja}C_i%$<xrsoA>l}Gl?nye
zdGibL*ywE)7mZ}TTiCM2ZY*iNCn#nkt~qSzx6>}k(|+PgB}VChN+3*O;Bk=%eEe($
zxh1rvjq@Fk*FP9p)KnbBu4uve&;ib})OD|_!I=WaCd=7!idbao*S-X^WuI!H+W)H0
zE<uiXig-zIUpi7Y+?rTibSn86JOaSbInD{@aC5{t#vD7}3riOHv3lixS3>dVg!n}6
zlAvT-9Hx>M{zx`+aIXf?=b7+8YQa1$H$Om_r+#1Sr~U`vljHP0iOgwf2-(Zv@P`cw
z%V*Ck5BFX|Es)}I2RKMuH1uT(CAsmX)To*HRDZxnfg5`4<~my*c<;y~zJ$y-O%a*k
z(`4`MHk@GOJtf}If-+s>#L{SE&Ke4E{CHZ}wKBdX5T`Qtr>~#c*a1^y;zkj|$4<IW
zcqTtQUVaNJAVFR_)~G@FwhXq5hU*2Hddw&9Qp<KS=E=p?D4BG!&3wU4uSGS*McK`a
z)%_JM<rek_5!PW>hOTAs)|_ScUdrjKD9>2tuWJET-@^F-*_T&E&*Q5+CC_CrtUQbm
zw`fM;Y5w@o{bviBRnEO^Fd!HuQ<I*}F_t{!3Cb#1P1V9b)b|MGcGFN4Z4%+V&&u=q
z^!Gp8U5@kZR7gmrac^*caPTX70+zgSvgyZ4?TgkC-piIXd9lqtu2Z6&*Yb`mv0X}2
zO2tqgULgu$<;BRd<I^f0a(BaODtfw<^y{{QJd_JIdX;M^!QQjxBAL)9;xP--j+QI%
z5?`9+!57!b91Q$<;q^1M?9cL`&t9nkGYMYER~XsD;&c4IdWA--G{(Gt$*bLe>8a*_
z&6X(Vo~->ZcO%AORbkWjr1te%o$u{pUxgf{uB<JKq%DLF2}*1q)8zd8+DS*L5qlDM
zsXMneZp##5%D9)8&!TV<enI8&@pgx3@XK3pLv%3%yI?(V^o50_u{?MWPAuJ>angma
zABQ#SJ#968uJM>diL+0pqk+6TptEIe0c;&Pbde_|iDV*w$Q&81Y8|o@dS*Lsj0>gC
ze@dOZT4M{ue?TYM>n!6Jz*+;ft~qRa6SUBaTg6k6GMA9v=45GTudZ-3@J(ERgOP&%
zf;Cyobxduun~Ib~i2D&)RlgGep9_z|2m6!-_4X2GcKL-R9h(M!Z>xR2eVwF@z>=z=
z<YYe0zBf~9Tc(w8b0|CPpZHXyF{p6nh7y#_{<IDy1<cU1^v1%|9Kf-AD|!&F9w!>G
zi>&yJiHBDNcdY$kjVf{&=@*stSm3W8g+eV`B~qRQVUjbUr#Fb#%kVt$epG4vqvrk%
z3C^+3g5!L5*#vq=WMI?p+?8L`^)vpz`7zHxmhdhN+>M7_90l=cmH#;)0l?LJi=_=v
zDr<8F{~13~t5k`10{4Q1T$%%|zKQyZT-usQ<Jszv;H)ey78iJ|#ifs*N?jSvMJ|2K
zOmP~~PB*Tv{|i<af(YU5#23VWY(JA+!#&@|+<XXJccLY%Xo}3S4MFwCW*kEOarT6x
zG6&)mV+!<L#D|T|Tg~iUWM%}L&VG&N?yEO*5s?)|kBwvQYQ2~9G3^E1pq{z{y3Y#o
ziq1>;A5f_8M4lrawEblNT>DaM40VU3RE2;W*SuG+Z61Agc1l5WBh!KW3&rmuvA?aA
zNZp#34cwq;HBaB_8<iyK8)wEQq9WvtXU;W#Uxet*%Jy}ict<mp8H}V?aDJdwhU@cq
zg?K7jh0$eL1Sa}Z=J=9*Y=-2=$1h;zP2aBY)#!vB3ScFhF$9lgHONCA%xCwx-t}$z
zXPY<OX&WyK1p~~k&$IEXjnkwt+h{~^RL|Uq%jIV01?Uf6T_{YO+%czCc7>0gMyjhx
z2rmpP&1fZ=e})flyibD1?Oj%0>d){k^;w2W`rflc8f{$I{{f_}bqWx5LL_}>JG;{L
z&j~^ps3-<BU5qD)M*<*BW-h?p>qHB<e}JDXQLi{RvMZ@{Q7b(LKT_~QTG*0D&15dp
zB@W!KE@w+B^uqr>nr3TTvTyjzKzn;u>!x}1L4_xJJZl!OpIc&hvaa=;9GcT5HOP&c
zHZUX}Nm&2T^6>V(KExEbML?C#&KDC`OTVl$s$yRY9#E3@lCc~Mljq-TDw%B8xMs>%
zb*~H!AC2!sJUMn|pQ=TEjb2-`S;Hp17+(^{GDLu_m>v1LUWv>Mlyjk`V$X{R%5%-G
z<6IMNDs4Y{Td(!v>UoGvy>2P8BadN9n|Qi#+UP(Uzp?&OV6<YR*8kg{#*ubEgd6ii
zmf?ewNY8p}I8ge&ntO5Zg4ND0ehJgzn!$kl*T-iI8{U?#u3$YigaLC-#|wwc=k&eG
z?;+z~ngc^aNS29-G@HG@!}0;acxwIpAc4cdi1jMy;fJqfp-oUy=cZ0)@@B>5jA;Ce
z*`2;dZIpx$Bh0Rp&x;Yg@U<Jqj{d(MBSC8nuWhHz^8po;CF{ram!btk)PLbNDXN$@
zHkQY2d01$;!>NU)<Q`@lMHp0XuC~cVZ8OwT<jS^_hG;Aywrl6!VYhR=JZ|PT=Qh>Y
zCa1!VXlM?#hvLk$ivvqnI_s5Yu?+-q{v&XpWyKaOnRWTEe1H-0LIJL;(Y0+$4;^1}
zb0;aTXvyP&eUtL@O*3$$*961+kq#>QQ)Jn_GMYm-Ofqo7amSLuyAeYZa{`Tp_ofju
zuTB}o-<{piJ|~1@n$G?Q@T=e>YCRt{oR}l^CNNgh)IzE4>rH&P`8AJ(^_vYB5vVTs
z+I|0wjc=NAiTibIc_)$1Z8N`KFlvY}2%G>s-q7ghmcWqV3VvE}^)x%USLs9>6T4pi
zp}OEjXWH1O7-=kYR8-?w!@`_7%xyAK<CtQ|qd7=3u(Rh>DIBQZoRurO$v!hm{Q_GA
zDcx3LM}=Y(sl^jksPk;Nr5WJw47nW`RIc1De0L4x>9jtK@GQ#}ofIS^kaR=nu8(!G
z8DR&BF?}I-r^tftWkD>p$*0TZ61Nk3wuB4Ro9|VmEInCluZ}fsuAU)TG7l#B9iEnQ
z0nMe&mV?rtqt86A_2M6hvlD(NX|@Ntm>D>J(vv#3%bWY|zmSiyvm`2~@#w?b=mfMO
zBTI_OUEIv#wsMtIX|r!6>8JVw`B<*Ngh7+}p?8s>!#A=xH!Csn(_a`W`wpTb>K!SY
z#95oTR_tUif!D6@Wd(|!*<?zGyN7VI%!bzWSa=;zf{mdH<DYZeQ(GJEVXp4&pr4_%
zpIDcgpWCpis^+=YCA#rO)-m)!T6ppAaEjy)Xf;LkeIB^~0FRl=dKj)tIa)IYI^!SH
zSgFV5GpX=~hWB!!nOwlGS9)@1w>(1u)QaGr?D`;`1epz5mq)G==a-HrI}l%+54r8&
z$S2`3pQ-9X_X>6lw)ypd&n+bx+A1Pm0OY|D)5<w&OZ%(?_2LbpRPs=~3?kM{i;RS$
zqb_mZauhcEY)*xrn0ci4r>8ly2?h>PXs~<aSlZv@Pi0;Xal~6?ilCuoY8y6ziJbiV
zM%b!kpXpfCf^jpowVkQZjfH~5ZA@ZHpyIx_ff`7@@NJsxDE2;C%d;rNVd4X!Ag!qf
z@x9=x?thfyWPSyNv@Y<0*HsLJ>s|snS+?W(U-Npv<kp*(qYpX(ay^U5NoV)a)olbu
z{S*bhG!-3r>}#IUPKG00FHm%BVIrXJsZ;JME58(KVNR2h4RLG_@Qk<@uTM5p$rAGT
zA*RKIIm|QUQGo?oS<M(v4&qdYwiQprjVjaqJfMEMs?X(@Rq;>X9CK|!utyz{)OGz)
zD^PCHVp*-niY?hQ3`1&ys}3#Gl9GY*`x?dI4N1>jB5ELdPS2ugQDb6#{s&i}@qw3{
z_nj&y(VnyV>!iTd)`RXuFk!`i$cM<q*bDRx7Ey`J6xh$68p0`dAdx}ZiYS366$X0|
z{RuJ;Cz=TjM33?^`1vQ%60QlW*>Ws7_(LHmWNS&PY)I&9#9S-P+9o={I(&%$XGd{Y
zc_$Yike>pc`REkWPF&gnBGK2sIQf~KcJ&LcQ>ex`xFi{@{=rUH5brFWmz!|iIM_Yx
zptf8I{hnkofcu2=!3mQc*Ioa)i@CkLjHwVC%e`d{bo-|SjWs#AfZ<}>!$o(&)Io_^
zWSE4zq*LPHn*z?j0j+waFw8!8Xl=0@BGnDfD=zlVN)dJ-b+d@S)|6cY_cKv4=^Ko~
zNA|N&?>mBjbmMN-txhu~kSs5!j4BX>ie+eb{mpuxt7(|>J>;Od#*H5A(4PRCR5eR#
z#C<juz>}Uf@gibNWh1)nzMjCnZdAF9`P~tHceUO`*DOOSr*Mhu5@K+)j{z}FRCMxM
z)1@+?z=Fn3B`6fdJ~_es4WNrDpiHL6yzvU2gzjzot8{E#_lv#Z4{!L5x>!une}JIV
zbqJ&pG|i4N7*27i)m_ESP8q=nd(WgU70MfGHPt6v0T?d%DZ9NQr~X)pc7&s&<iCiS
zEsx96Jb$)p+d+i0C0&Wbi(T?8zi&#+4YISDwf+O(cyPFo3$<{IB6#wBZo1Ny!4qzP
z+DFqtMb;+_H&QLWdul17Py!T00L;txUMFA*f<(4NL<tw+go+;;CXQ!3t`B5tpADvY
zZ+7MApmBjI-p7x;voW*Zeq>@r)lG{lrs-7ToMYG-*ap7V9bFgNT^@FuMb8&<`TM`g
zP0Xrf!RGxa4Z7we8&6MxPubytgy`p|WNvnL-zwI|hkhkt3bM^TIldQH&7C7m6zvNJ
za1ES4t49>2GT-uUybW0Y2f43A1EcfAc6yh!`4vPrYUZ4X_;y4Ti_8P()oxm@0A(E=
z0!yM7T-fd=MpQ@Nm`47V2dju)cXN9#CbRJ{<zw+ko=!5rwjT!<n~iwU)yb^mjSb`%
z;#tfQSa@=jT-sahT@znrdj{<?utw@g-(gqobUAarSt90a9*^<d5&8;bJ3{>exv~Wz
zQ^EXpHNj}zLIXL38Hl7E-_CHh_lcei%<usBd6S3g(6J?1%hvP(g#AqhnXxD6sAaf{
zN+`CaJo*TO^0$v`t%?lAiqv7`>ig-Wl;r_)B#~@%nuDsuw~VEf)N~?SHGWcsYrKQU
ziEz#X<^Ug2h<hQIVm*cx^fMoe`HFF!cR$x?|Lp>fGPtVaZmy@Cf+fx)x@^r{X;N5U
zmk=?^F^>;aLR{73{6I@8l_&*QM(dw-eW0R@{sYxKmLXEmg*aHoRDC{m>n1Z+>L=)B
zWG!&QBVw*?j_MtsBYmGJj2yw>&AU8WaZyBph6`(BjJr)_E?qO+5yF<?pEdHgsQkoB
z(Y-lHuQ3X=)9LY2ksAp+4SYh?^7ZAD&2(AK#8BiyMbXWsQ6)tN`dtL8sy?Yj7^=G4
zp{Pf=>ySERo<Y!Ua~_lYTM5wvb14NDQ;U;xc0buLv>yg|UeJ^-Xz-9-MRQxBz?C3?
zGMsGfzjmLJ<CA}1T(>@3y3ynRJ-HVvO5FCMtIpDD3JsP+bG_l4vrg=H`MBOE()<~l
zCNYLt&UR=k{5uUpB+j(s)xGlBQTE`<Yw<sT?-a|=`Lk7$cU;3lp|7X&Kdkuc$BRxB
zXA5Yk2EzK0$gHJK)mz$OmTrJj=>Zxh+7X^Fgng(8Y~dc4Uq;9(@ZCGSn5s01Ti7ba
z^t3VCt9{+Gd_O!ji<f<NfT8h?SlR{Zg7_ob41|@uDr1~Y`2*O^o1LjQcKCy@t#9K@
z=p=L#_b|Rv$+2*d08`R7Y%MeggA>EITk9bC_3M4)@+I{bG&*%vvnkg{+w`8K3DXoJ
zgsWKci_q+E!H|ZAzTw8zqphz`o$R;uORBcCb#bI?6mZU_BGGRGPbMv=N1k?-HY+Q%
zNu>`chq<J9G~<M;-64hC0mzh5`%b)*XhZT>S$cUQob7v__YsUGTCil^|HThnFY+1F
zR-n6wo&agzo8fkPtlMo>MBJ=7<dEB`1yS-{m2Ko7U><3)yUfdu{jAu}&uf6vBE=IH
z1v0nJV&26wGmjQo(zrwzS@$&c!HrxusS4kdviZ>!(Z0Ox<rXat#OE(yDK0`REbD6k
zY{#fXM?)-Ievd4c_CN9PN;CMJ_r6KsWkKG>8yb4lR&`sv(@siK->fhp4Pkdr=UbgA
zJ8QuJ7#TM4dJ5jzbta37X~=L5oWT}9r?YUavB@exScU!tJXhCmuCB5PsB-tXCx5NY
zaQ9<iJ6_snVFxsPcGWpxw`)jjWkxZ99472;9E2#ir>qXteZvI04?%S`MAmxk!4$W|
zn8-I4LgFD?!s8{Tv53P0SljG|z8IGQuG(CMX1U^$un$S7<G7p8W_b?I_*I!Myk#B_
z0#F%SjNRW`Cib#O+b0qbGeoT)I<Q&kq2=bmGi*%|+3^9X!sXRkW#(fD98ohHMhf_I
zXxelh6aAQp<EN?BTgRpGb&k)aog5BlW2T9HqQW^vpq8kXLjC{31{gKPlZ6~)K%?*s
z;i+y4eI8Hmyj@l0y`>4J7;#MTVI-!`&$HK>aw4?eD?=apHl<cx^wXG^1|BnqhHtUi
zJ-43jv^Tfb^!0}A;>PM};syjrD1iGW@%rN^7=-05@v0Of?@0|KX7Pn~Hcpm3H1Out
zCCln^B!;Ae)mu+41|1639vI)LIE%g}?<G?pQI;L(5pRsG8|Y8@x$mt9PE%a!a^)9G
zl^Q&KOapeYX#O5~qE5TG<bJ4~#|<k5>pZTmXIVSduP)-zHaB!eOX$+<P@;X0n23>$
zUie)*=7d}&qIR8?-P&?^CE)(+(<NWDmQBO6llo}(f3m)_Q1W11{abF=_w7$%3$|7X
zd<TsLMS==f_(Otqp#Patm0)!to4Zh2P=OqWkW}&0N)DoYJF#585Vg*lucT0G=SoZx
zDe#CGUfCs%a#o|O0f!rJB3*YfoQ&`Gf0;ow0647s3YO?MJbc)fNuf8}Ac#a*ngAKZ
zE1-o4VZ{$~_9JFQYR20RU?Y9+C<xh55yCG+xM3wulANYXb2Tf;uUh3KATGV;v?u=C
ze0`SuLzFfb+0cS)cr9VDxWxYZT#%w8)Mcrh&d8;N7K<e8;F3xmDeaX-RQchd^48%Y
z0W<s$GgPy|a>vy7*lKSMD6ZZ{%3j!!bNlD_l4k&;<`=~A@!8_s6abU~kI95n@tO-E
zZaaRg$g0!Lp(Z1Cs_8`*S-Em{=}!K;V;tA&=GaOe|7|C2fOZ<*f4OmLDuep2uX@p=
ze@yudwWMhdi%k;_<q>q%7l(P$CqF13{{uWc`ks`>{$ltCh=<YIU~S0%`e{M%f`})E
zNyilS;zQ(G1t7b^$o~K^!vsn}?fb9%5CqiZ@BOJl6?9R9yzyCM{5(frtMEk=Wl7gp
z<?^+9f42`)<1MMPKCsbx^aE671x~+2XVdS>Qa)=kTa$+HP|7m$vm*8%X~HBen8+v{
zvbtrXJo`x_+_0wNUy=-N&ISF9*PeW|vdhQQxPQ}d*2b+o;)imGv&!Y55W4!I3c+hc
zO0zCe7W$OJuXXdcsP}e6SCE-UOWS-;OXUmf+BM9-#IbmWK@sb&^%U@(UFb}#wrEu(
z=<~as8~UY`Z_J~`u;Q;Ng2)dNU#Is@)rQq*`9kD}k2?)+XnbRDQoO4YGP$;RoDT)v
zS*rLDo1`f|5!&hQ15dQM_<~o*QC|43sqSuyXjRY0Qq<+daN^Zgwqz*rA5e#P2P{G(
zi5}0y=;JDj9<|%c>36|5ULIt7!y9~R0ye)<Co{K_-Uu45{Mb#V9hv^qM7k=!w0X-3
z*xiVfc&TvF*tfDFQBBc@_`4g}$bFrOxK-=Wd91oX!o{|cJU;yzHm}h~8{0kf53t_<
z53te>MXfn2N`&jE7K?eIaIwLWE0toamd9ay5%QImSAkm_`#sWXEb}LB9q6cBA7tam
zG<|Qa0MdV9N3q@K&V3R3Z%-^Jy)Hq(!k^dtN<_ro_94bV_CP<?s)l5+$iC(q1l78z
zWf$ERx3}&3?os2vQ`N++diT*ouxI}6n7(E50at*kAY8y_DOBBRov^q}DA4a|4qH-5
z9bL(s(w=IONIyogSP4ig1%|((;T`WUuE&o#)TFe)Xqzrk)cg!*fCp)%J~W6)EtL;p
zBIcH4c8qgk#+|^u2}xKP_a`zytNEq;s>Q9?X9ETVW_KGTs+7w8mwHCC4gY;&^H!a8
z;!HQS4mg@OClZm|)cBJdPsMK|_2#P#Z_=HL^R$5LgNV^yu1w<i7a3c85<jKdey#f@
zCM(jQi9&as8zb>7#p`W4lNO_o(70Q$BCFjEycX+ZEnJo3GRtv)mTUbRyU-1@G#+a+
zKKpImOR!03YfiAF2kFAk-@VB4G}lud9f7rX6&p(`Vf|R>PJ2Up7qL|G)I6<P2x+ks
z=^&);Vu?Sh$ht-KgZA&;?@RKFeY3Qe@|S7{nkX8{f?_UspAF&!fYTbP-_{0gj<MSy
ztx!tRU=}q=T0DwF8iEZkhiAGXo4EJH=M_)JT<ykD&9btdvcU98ry6L)Zi1Jp_-@a8
z?q}5@-5=>*TJcE^EyzeD5&5HaZbUb>$LD-IE%WR&3GCdues`zeG;DZL4#pn7i&1Tv
zHA$$MPd{ND5~SQ${V3vb%tsFYKIMQs^f$egyBwQSAO0v=$Udk$eTxvZtBjKqY=Ot9
znEicw&Wl}ob(By@5GnS#>4rIdF$(QR1KHe8{_NuUIZcWXTh3D;o$R(Zx+y63ZBLmd
zqYrvh$kdh0^1>j^)R8JLDuDMHN)jdC`+di^J(EA=uMQIFmw+CahA^qCanjl;p@vT+
z!j<=jm?e8_AZ_OL!IuTLAOQo&Ya0^wY|>PardTS;Fx|*$LFj@JXWYPws+w8NoTK&$
zxUDthox*whTu;Dc_DJq$3=R#ZSy)-GhJV&6<~O)v1*_A6erJXv$nmjgC*tA>H*J(-
z>3b24H;7Kj2u|Xc4~|`xum^=p9+pkW{Y9q-**`#LifW)SMo}p*&NVz&9fBIo%-q~c
zj&U38hMb}g9;hr4!b@|YP@Nx@k_y=+6v5Ji$~Uhz5=cJ@u=H&S|6au&XIY{7<kFAh
zA=LI98B?YQ;);fn@*oc98B}KWRAte;x~935WUa_~QJgASwL8xk8py{d{)efAAss3B
z8m+%laZtOcF87V{1Wd9Azjt5tu_dA$hgHvyR0t~_gqUgtN0B$)|5-H}de$CMm?6ip
z(kk}r)X=R?XVSx#t)IaYE1&XK_D}zk@!x8zdj!!^iR*!|TNdu<pG2GOq9DP7wCIk|
z9aV0>3&1-ppL6^2O_F9en>8{c=O}+Z&lqe(a*NKK=5E}X=pQ&V+^LSl&2M~5k?gjS
z)^VRjM#DC6f7H$}<Mr!B{#hFV{#w3n{pwm~jIQS>fV2O=5XsaIL=Vyy9XQBiUhl8K
z{1qZMn^+Jx%$7CtcjMf2ViLn_SZfu=__oIX-x*)+u?{VVRSrlt7<-(gGHi5&yCn=Z
zi!Sf3FoIzX;mtC=2;1ajNpZqaw@(y(t%OTmdCxfZz^*0I-9_vTmzzn)XS6@*anUi<
zt)QTz(GZrh*)#Tn-|EXFeh+nH$l!Wx6w<cEPiB>S?sn`Ozr(b{!7K@%K73z!B0j0%
z0QIXSd`YvMkPZ~w`sk}zVKrs=bw!F@fgJo&{Z)npUm&yLMttSF6@gQAhX--n#bKQ6
zsh_*w8pXMK`v-eF4mfhYozKI6&*P9%#Dzf%11)aCK@k8c)8VJ^WsSPE37fsPIOYfM
z_!zVpwayR6iA{z&;1VzJTs!fF2U`2`hrJ(TxI43rzYH#f%%QimkF;2Zrs)^^n19wV
zzKP$JpRM;yy8khhWXbN7fxf?<N--v!JW<BK_mS;`7k>R3D{obTkn4PBJ6rs7K6p4l
z>LZ?v4Qje>iy3J}U6ZY~Bi-nDmqagNb9b2d&)dK!@Q-@@$l~JAh4fFG!jCYo#rvC8
zYc*(f>dW;{>%cw?Zs8+7#LLSX>fNxRLipfMl(2u`Q(xp$ic%h$(MSs^>dA(RtFSSn
z4X7?|b8B`eV{PC$Z#IQM?4gfuckiA&BGov-1H||<d@Zg*eN|h*P@4r`a7uQ5D)HV)
z&A~$&2kTnoV?A7d-iFZOP5FCMm4*?mlTZ{KE1Vd+xM>h?l^0y5%iuoJhF0+^-NtB)
zR1duQ)l-B)^$}vu%s;>rY&&}`aG-mlAV`v^EyojW6Q3Aotyb1vcHOd*e#O)FOka8N
z<7X!lkedS)oJBzFwLA=P+q<OsloQLPi7DAjNRw9;8Go*aURmH8-qG-^#fOf&U{h+B
zK+1kIUL3I;o{l8rVh5h)t^Vn`s7+{2&4h%yS5jqr%KeZIQbx4lye@<55c7pI_<NAK
z$Q^bFM<@Lsh9q8I;faL2ZS`0xt$I*aEsF?b7D;ikK$+`9THQSQUN4`VXzGbVeYe!>
zqN=qls$ey5c(HQYo=q)-9kG;IG`&m2=M+vg)Eatn=l5_Ys&1@bH;1HXEJl_J41M=A
zWULnj>Od*k_^R_4A=wtPPZWG?Ledbo+EO@xAV7W9{eSRvPSKHe(Vwn#(m}@^+eXJm
zcWm3XE9}^|RrzAuwktL}wyjQ2&02Fe|CyV*thH*@`<}DUKF@xB)A@jZ0G?_@9{HL|
zpw$Kg1r(^Tn5qQoLj?_$hBIeeONaq(;wU^Gd-a`qbJQ=6NwhAHQ-5y1GY3)#65LmE
z3{MwBzJbdo62*b)(f#9m^~ef$tQ`qzgm<CM@Dm%q9~caIA9XHYHrfuO&%zvd%^i7h
zKRK4bbZ}0X$=i~n-4tKy<aj47shfUGt4xCX{8^QN2c;bK&_*s4g=&M^w3%<$#5Qe|
zEMUkkRm#8QeobbPB<DzG1ea#B;fXW{-ZY$4U^LAYbJ<8`T^nT5%|Z359+0HSP&Z9X
z;4Cte?>|klRU+gI2`>zFEQ8$8>jAXBI3XO%*$|97(mW2Z-~9vp*1|6}O|sJ3+S?yX
zsHz31wOw%uMQubNcU_|Mj<EO)3zlpd%NKg8=)DB?Pbqsmr9IupnR^oK(J9F!NV2L8
zjoRZw6PETM;Oy+U(2usMsD-m1atVEvU)I$P`!-A|8ZcP89AR!{p)E>G3QY1^u8Sg)
zfMQj$VCYYBf_9x5so%n<F>|AzaQam~t0t<m!lm)~AFdwv{f%-(l#B}^suQG^r@IuP
za!Pkbh3Ohi*6?Njx-W_-GRK%$4->{SI*`>H>R_b1;ReMTi7vsTn2YH$DWxl`#NXPe
z-*!V}pB{85ipRq)25cVN9V%OsM80g)Nmb8vnd@bI!~eCEI8jHIvJ+2F;T|RK%46h$
z%;^twbe|i?C3g{8glf&7$<-rb;xvE;5@tCLT<+(uR8)n@!!i;6QGQ0qFq4-U+nDH6
zL<8IXj;B}NwWaGF5}B4H8zZUZ%SWVulNdzqzvDRID+XKlv*NIVOn!0~6&F>M{4j&Y
zRM<q$`B6jCV8Xkb!8xBT;7Go+AzO=~n#O_X=m>*L{EQ<1ZDnO<z=6{4GL9Kt)8n`A
z@txj=jNkrMNm2rb$~Y=66#;Ue3;T3=X=y<Q_Q0Pdf}(aIii@f=ortLe!NI>=&+@o-
zRnz8>&ZqE0`AvMDj=|p3-mWJie8DN9E^4*9vcS0nQ!3VADbLuZi`B_odWZbuOmiWw
z@5iGu04jimw#2@gs?!g5#ds>7Ok)y=m0-o#m*k+x9}{?k<tFY;<`l-Y=l>923&=-i
zD1w#DVcPS{(M;Tsv_}Ko^S>ve*xwdA{4h^r%h%vEO{!qMt1OI?J<ZZC8eqOUF8#0K
znp!(*_!~@+kgmh%bfYLzvpp7cli!Vy28xfOzE5&SFex?jxo57PUm%61PSHI0Yp2r~
z_dbO=aWiI%R}lj4Byq~{;-oD?L$f3Lr)%LI=JrwspKyrP(DMnevq1L}CTqggW;SQ%
zXK<Fvp{Z^rHXTv`(dr||9#pArq?X0euN~EA$;_hvTw4>V=!VcPK(5m4n=%&3+YTUu
zRMEXGI}YxvCM1RVe}GF8bz4J1kMeCrSEnO26c0ve2$gnb+mDwRR5pnb0H^bCS6bcI
z(99jjPT^^6$bPJ-uErJxx+Kiv$?a!?Q7B6rx~H;ivM0cDqaQRu_EH60X}4v@X}xB3
ztP_78@w~Vo{DC8Is|*RPH%%x1I<usqg?Q5_aHoc%ekoir{zZ?exX7kn0>QqO>CF0D
zNnDw_7?o8WpT4#LHO>z8p-ofE@;apn%cMXRf(dV8?|e#AZq{EjV4B4(3E#c40K0CV
z@S%9}t?-4lXQZ}LoEKKIH~^Go9cTVh<z;PKdPd0#9vk`9(yMm3AMwb13(wQfbMkx1
z;{^LM!@CALJ{Lde#^$^09#l`^U;6hlDu2u1PE)>7klqNpnsUsSEQ{PB;;h#%RXKa?
z5}rYPkcufA;ftOVcRT4WN7Eb!I~)4gUVziDyK4UTJnIEA^GE=aXB^ww%R*zi$_kef
ze}i^u&HiDM0l&PQmV!Olbvv!~9{|Ucss1^6BsJSvpz#-`!YF#npKm7XKu6akS2+Jr
z@A98y9aO%fw@j)x^$ooZesMe-{{Uq7s92VE$Ev0dg&n^ggb;{2V&V#?I|#Z>wC(I`
zk|=j$ZW<n6EZXlF48>b?r-Y91sKsC|2xbV+rrMEwv+0R{gdBqjBh)X}NFwJr*7p~!
zQWqButm_OUdZ=#di0F<Q!~Dhvw(cTl&5(|TL>FvyMZ08~#5TZkiAf?c_QS{B`VM29
zi02$3BBi7F&<XHWSvB*pPmFWn1d8v{3j?PwPGjDZHoGB@GEe?$2{Rt{v>1W|MtF*7
zH^G7NnN@ImaqjO`)w3>~uBzGc$`*+I{me4=ebalHD@>ia@(_w^H`H#30LwyTK;qAE
zZ~ue#_0S7DZ`~Wop<xYeM^n=xruX^4%YEr(O-P!CW)-l{JF^GQadi<kR{&cxOMMJd
z|8z%&QxlsMu0<>R8<(%Q1DwkB?qH6es;oo&zwLTQY^8JYzrQiTPloJla6?kA53sA7
zGZ)BVMToy&?DB=sAPFnqR=B>`?shzT21KkzhbXuHK&%D(Ni<q^<ygmh<{-P-jo|s+
z)s3*Xj(t@Aw$=645<jT#{NXW-13#|vbL<0kxdB9iSl_jo9gl8;THo`rP|f5yu=U4q
zpeGq=PEVxq7riV-Ol2V~k|2EfGKu*$d9rlWl2gOaZ#zg|+E?QRBVLyeA+E`%aO6`O
zj;2*e^R~Q({C|vjt5R6eA`)%Xbf&-MtHpmq|IDoJP*rX9uIBPIN$zwvL^R4B`74Bl
zlY}qprjJd-c^5amE}*<V3C()FHSg4C!bQNmogZtv-S^z$QZzA(-6e)Jd5vT$R5(#H
zN7>5CG(<0|$3>+<xhH<)=ZWReO9Kna=XT2yfI6|I*w1AG8hnkU5W>6Ov@iXc`QkL;
zvQXSB^vRIbo~6&&9YZA-am;3#m$t=KVv>Z}-kNqfDHhyUC1q*4Ld3h|Tck`}XCddg
zq<bu_)8|lvAy0>Ahx{RSzcJBdS!CB#T?GuYry4qw-V_XnDN_HMjPJxj-ski&WwrTi
zLYKyAMMjw<@oGAYF@ss_K2GS)(3C{XtC;>ozmYu|eH<^}N;x_l05ysZd1Os32i=@6
zpT7|jU*?d64elq<Y2E%p;fq!DG*tc1k>8MgmSM}9B#ddzh0w>tv)D|wGLUJwpcRG~
zh9W7(@kK*~=1V9IP5FIw<@<0;t3B6hGCZ$|!tuV0bzN1fh_rAj{59bRgNH?$IA&@b
zwtW>(0{2VKvb_Zz@q`ob&sbiarZiF-zCb1Y&A32R+ssdP%?+LGT>AA*Za80lRy#{5
z$u||Y?vb)EbDpU0W=5lLkpR?Gn@R#QKK4U<d(XJlK^Btws;r7kT`2Fn)S2!!<1cGo
zHlQ$UJf~JJ*bVSe$~>NNuZ6`8jB#EnQ|Wh30+(NSDW(*7commzA&F%?l%a3Sxogl(
zv=smZa#~`oVY_L{xT?JwLd%8ss+UQ9K<lOFql}HWjR(nNmcxKLpZo=C4jP^xM@eN%
zCGa1>@Kj}fp4TxAPZlNtb0P<bDK$tvX6;aID+LKG8a-(nh1F~$LZFzknv7NbDLrzp
zbFpo1i<)a^-GI!mp0@n!i7CbSbiUyVO%h1X>{K0?)o3xcTI|LmIM3Qz*i8IYqCWHj
z!;xrVk-mReUMmQf5Dn4?(pba6X5b*OXu7Ti-)~IwxTuEKgZF37)vcA&y3{mxO^4J2
z4m>!z(4?J)#B#*dl27PzS=-!rP+#k{;4DQIW!Z7h+c@If!2ufoRVHZ{0z<Q;?q`cd
z8dy=*94M0S%NI~0IJu-@RlEBkgSR$l@ITCBVKIrqi>*|a*ycoF%>&{Hk{SojdlXO_
z>IU)V_cPVtuD{ja-xWL)O+}8)xDVc9@vDv&ZPBP1?KQ6P97+l#5R*h!jYx7d^SJes
z@#aF|5F@Pcaf$k}vTc)A6EPkg7M|SJ6^AprVOfASac=VNO}ef0w!3KCO%9+G!r@zz
zuj~l>d?FEC5Kjs0MI-JJywHn4*d{U~DBR}@k0nf7rfspAqO`^d;u?LGSQIdX_;*=R
zN!SA?`>*=IbRiOP(c^?M;=khE*j2X`qaFyPwB%}(4^?%dfL|~~{g{t^Pq9LH^+|aa
z{{Y{lkdVHCSJ5X%#z;msuh@jVFs~N93AJ<wXHTl5&aBXvsg+3b(58imoAX^O{Vje_
zkl5l5{paVFs=2-`ZE<lD*bjqA163Y%_I=bxpZ4!h2mej(_^Gojn}pp}Iq&d=tcaG(
ze71<y5us<9j)D6%bFxuP#m3r<O2$VFxV3S74ki%C%bc%K{eSH(0`5~Q6>s<<jgi}D
zd?UNVcOW6*Ma)bRi#b8w9wL7pTEn$>j{HIaCFu_CQyGACA0EeW*P;0@c04jAX99=9
z!()X>OXNF`CnTPLThRdc7fsVzUotzatSkRZ0cH<k`X42B&uMvzr`tR)l)gy^q<)8E
z4|;nQq`^V(LJ~Ey*_{@<(gz|aI}6ZSorknx>X1SD#ZZko3x^OM|K^P@O(c%ES2NOk
z1VW200CS&_CC9<a?4%><6a2DD5d~QvT>hzyNltOjjLXR+{Jx`D(;WN-{>_f(4~dWR
zeoLY*5!++dA5x<|f9Ok=jwFYhe1IVBQ<cszT939ic0+FQP1<wq=H^D9pC!h9$c>BH
zH^c{}*5!p4ot8)%TmKO$&WY^3=|;R~q_16uQyO~pP^W(b^Z}p_4Q8Pz0c?sg3&jOt
zsYMd(e97f!D!@f))@y6XjMlzW4xwZ??}&RDx{lxwHhjbOOU`@RIrzg?px#6`fLg)x
z*R&u*%2L7%MJ9@ojeY8ip_hIdNNSac`tQbKVVfuV5~lfR@8WNj7u*rLh`B?jh~kX9
zFPXNuNrxuZ{j@ni)1)_x^duQR1j1LMZQp4xP%byrPK~V%eHQ*)vdiJ$m!eRRy;-{l
z`beS4AJ6$A^y%Erwx>)?sKIY`k%#AM6?nMx<tG1|bucG5POM4uJK;lt&SO8x=QpuN
zif7{#P^8q+jm~_L9-!R=9?*8?tvm39&Hc9<^V@4dQ^$0D4bR{}!tX8q2je^;bwY`^
zZN(Pn)#{z2{_#a-YDpFpQI&q?`wwJ09f=m~T8?a91?rhCgP?>)w5nLfi!UQQLH_{C
z1#j2g%~H|jX&!rtzn;}xKSJqR&M4C)lt$mHfv-oZ1bo!>Va4xF(hTgkQlAeY^{)#W
z%FpS}<pxyKQV$jAa&cu{t2-J+H~#>zt%;pONgiZMwPcDbYHUe4q9kDPEJ4BVi*tNl
z-jY_x<Bw8j--kIrV!zcXc}hF78fZ(IbcYTwpbc6a8i<+;w9M;KdPO4a+r{~uPa0=u
zKzKS#aSYOYSHNa-$?J9V%rT7MRZ@|Zc#U{6_j8!NiZqf9J{R=t4s`EwGlt4^F?t%O
z$($#T`)J;&7Ps*8dEP$&%?VwLA6^xu@Vw+618hZRNn9S&^dru*juKex?veOOMxK0J
zAg2D=sQ%`dXFIF$-PZbYhOJBX7PETd#z3J*!T<N-f*tPKyGxQb$=1C=bFns~r8(;~
z7ngnSfpCKgERRMTRM($^L4h+2j%1E6k``C@@nkJ@ohRPe<Crcq6g$>-8p(KAcFqcJ
z*c3Gng*k5?J*>S{08g#&?7?Hpoov6nZ9Q-iF{Ar_u6~>0idl|#!ZlX-_E_4~s$KnF
zx;eD>E06J7yVLj*$ge>V_I(9KOm~5S`UL-|6FRis0##hDMfM-SnlvUJCXT=~wqrqO
zlSY1-sV49%aA0&{x$BaCcw5rLYRGAy63JAc-oT)&XFep@<u;7u5ye0JP;1ZRNOj_V
ztKRtI#1~^L10^*U?_l?Jkx}1es-QPXO@fsLMGHC1=j=U<n-8ma6)^6wi41Bx%o}KW
z5Y!=v6wEsMelWPTPa6L6>fa5-37}dmi!l9p46n;mZKE+skqv>wU#fmBUoI?CmH=^)
z=8jel9pKd4YYjJT@a2nVNCIN`%KG4HtIbZhg=Q+na9=3jxnA!+the|-EFwLuJgh$F
z7?|%Sj%7R1!7TeIRqVkl6r6lo`$%a4hbH#3N2sBT7T)!2MJ~NcElirhTD=SA0LIf@
zVl(7kq`!1iTxZe`FXDrZ9N)9Oc)H?$ES$<1hNo-H*H+))y96I88jdvE+a>NSV~cSu
zc&rZA;o;(v*Hr|tz!87>h*rQj5=_gXjD#mtOq{ZPqJP*pbF^egU@`jUvoe(TE=_{}
z_SGkCY;484j2SMFDw%L;-;NM9PIA5{zf_;#QV1~#=MqN<qxJc8zP2!hV6@ARM7IpQ
zMVM6(MYkja!4lB^M_=%d9C5_e^S9iF(lyG^{a<mV!ikui2P!tv=JXBC6KzHktOtX8
z3?5BEh`v(#EJ~B#u_;X8(Epq!-qna2wzKM=uBSHA{XqD(+28*Upfea3-%{l&s&~1F
z7;=#O<P@IE)+@WF#c|SXZiSoiqxzPBJxM*FXnq};-c#pdW=N6wq5>3Rc26P$&U*8@
zrflEaNt{-MT^uPcGt_T#-YOT5F-NOG`Rh^r4{-Cg5SBUJqyUbo*{u25bAD=`eyjHP
zG~haxb0)mN!uzDSXCxQKeR%9^--r;_;YH#oW+H{NRGVFLr;yk2d_!u~OZqk(#q4s9
z#&?lAeLb`pmOU|naT*g}z9r61Hd?|3_DC!I&tv{KNd_+lx=IpSau#OA079RY^xr;Q
zX{<6Us8rwpcKg6&uup{u)Cb`JA%z}Y>IU9BYaNNeCr3{)x0iDtiiThhO|?EDtW?3*
zcyG^LCzO7uyARujtYA_2gjL>^6K<3=98nlU3^FS)Dtp)CW^Ge^5Cfuuyfcl@KfnX?
z{`+IuloNqMPrKu1!2x~nlIFv)viG6B$djwe)~4SKJW0murHuZXG;FR#V-Bki%=9b4
z^+VM&=MuY#yZC{5Z<k~G&o6f9NbdL?By!zX#b!Ak%R6p~{(L=WMx5hC0!em%S=F_r
zH}!`pP$Ve?Dm2Hi_FeuHsNCjaU%Z@Iz&fQz)NjhfsI_E?7xeuy5`jI}z7GuixL4a8
zr&`YEPe8@kbzWSIlC^Y!F4sm2jw)9~{K7?g)bv<~e?%8fX9}BP`D%(xTumB%5AbEK
z^f*VL=O7I}Dy<pL-0S+alL<9bt?<UtHE+}%3Gn>*9w3bW^yMus{=&M?0L_pFwDnap
zf4ci3P1T>?ZMXlv$}{KaC$Z3P4>YgFck4N!8zN?my9t5Zzkio~8-`X`BOABUpz40B
zzvX5$^mwkkS`OuXGuXrUI+XYwL4tz3+2J2x)GA>!_8{O!c%X%*j1h#Vb3XEU&5*P1
z7YV<I5+yZu%`MC%qAQ+2T@>ZTL+j_JMLbg$bJ<UGF1s;i(jNEgSqtA=J3d(19oiBq
zRFj>_K>NSM5YONzdgacKI*$jwPq^1_+3o!2uiKnP&=$E%J}Uhzhm1cz&iH;^i!ZhF
zUQ>*{L{;4F5-2o@f^HGyD|uv$DuQs%iL(93rryxac8${TC>`QwisP3QM$BRzuwDhs
z?2px%x<Di8{2mTY0%vTZj9<Nn>9t*iFds`dtToZx;!&CoMgPcCR8lxGIvWXoUH8ii
z{DGm%{*}KU#mcRFpi&`>_o}m<J*hM#I0nCj)V>D%pXbY+pZZ}}3Elj!DJ^`UY7Et`
z`Lh|+=yWL~6C@O|DKoq-aJTGE*(`kLYD#BEabXER3#N15&_#(*CFP-Tog?E<w#X*U
zjy3LVX9$dgbNjG<gE><Ps}wLMEe}}`lOfY9c&+e4GX5@i!4iQrNbyjHN5M-Sho!lD
zaA<S!!e`ja*^#R1h<g<64@F{WO?Zp-?H1~h<WBPLu}pePT75I4+kQ4hAJOQrZpf5^
zu~Xyz({`g(L3VwUY{QB9PC7Bb3qw~O3w>e4EMfI)9;QO-Dqe+3c0;eXBxxLvuBGUr
z%ALfV)YzGN%1*Fy#hLYPWjORb+zpzhN#>1oWIOt+NmcGn(w?YY4cSb1jH!_4L)j?B
zFsbKiB}ze|xRh$s09kq$ld11tO{CJMOT4X<CeYjb6)g8)M<x!r8s6T+sLnJTDIq#2
zJfm{Iqa{3qfGaaRb3}3Frc$DsKCiB^C42>sGhCW6W!lH}R&c84=PJ}}&P7vcY%*+*
zW)snYg<^mjC5H4zTkb!=sfu;Pg_K6pk$4d0b2RWxUByQ8E{1d5@D1~uj>+?PSdhpL
zVd%)><ez4$MxBv5qURyWI<@8$IdEHNYPBmkE7FYRbj&#5eSsUIRQsk)p$11deE_oD
z*Bo@@I7SznIfGri(BY_YW-Q0MBPM64!sO?>O5Mj>O!gqDAhfZ$GxhEam?J}C;=ieZ
zE9d#r9K&jz=17~ynI3L!hWBS&@?2JMDK6(4lYt8S@+S@Iqx`FPwT>}kf`wv7z;`vT
zJo?G9vhsD8Cuc$yM`!F_VqybpNdF`@BQGb1Q;FA-jUUJTXbQZz7kZo^iGLWY@8*aV
zBYTMvn%XW=7?FH9osTs+NWf@BXB_6xR^3)%;v=5I#pALw_e}KTQM)$u($h_T`2NVB
zw}d*E5xx3S%6fWU{;yC_Wpjhzc$ycI#<9BvfBVCI#ij5yVzj>%|DG_r{MHLr@uHcw
zB}Km@`nqtg>0<k$ic$B0Uv2Y@L~DA|T*$Yuy}8)A4wRyzQmx}QwZ^~{qJU}H-^-z0
z%4@t)T$=5>;0D)7|KDJUq}Y#kwbEs*91qJL20iVTm`=OB@%I7*8mZ7|$ineZD9V}n
z?&a$;r!L8X#GLgDbVW?K=;$DSuoIiF=tNu!o<D=&wn17s0KTQUe#&{6NLki{ue=o0
z30(+-O!sj)g;>r${LI+>XhZk^Z7X7oYY<SGg-K>}*mwX6#D2?s*){7n-Ze;k%hMTS
z4Nvd##{~HqertM;k(C<WywZ9swfBzZckj*!Gx9WzFSn^|e38J1$eF?w^q@WI_AWO`
zgF9v>ld4-oIX*AOgFRRW=-z|Ni>~!+A6YTA&0}tUR6=|;)k=5L0@WO&Y}~@60-;tC
z61k>-5(Enzk$yf9yQVbVi99VY5~}0`d*#A~Jq%LW1uP6P_Lm>_PN{pdZAdUOZJ2Ls
zka$&WQEzWc6=xX;-NGZpX;&TM667Se)09`I)PrQ<3u8N*^(HA^y-;Hnx_cq3GO+3u
z)oc3`S{&cf{qgILhYlO@xGkcrcel*-y4kL{1(_tfn%+%ybG^nMA{kV;POBme#~pfm
zY@E+23}B>3Ys!UQnyL&9=a3jBi{Q1U$Gw4hmYaL;S@Tc)?NEGA)RKLpK$<2CHl>p@
z?F^$TzJ0Qd%a}Q@);^hHtxUlf?saF&c`E0)4#CeiksY%b=yV9CQ$MuW;>5Uec<Sf|
zy3lWnq!E;t=yuylO!zx5Ip0+)jySk)I}-Ax!OYrrQsLkzXJ_o`@@k^U=hW8PHw?1J
z)WL=JU~xu?MLMhy(yl(1+sp;i>;34YKR(t<ipbS^3A~zs7swHgS1%a2Rai;PMjjQZ
z?rzt%vy@8ckPKmThxslws^6;<8{;yWKZT3bHYv7m_qyl`mM0pn^asnuM^rO$ebP2@
zwO(n*An*V2^G?*7uYX7o%4oT=&2n5c^8+#binF_GF>)b|pP3rRnlEggXMEH;KnH{9
zur>&dK%lll)!Dxd4B3-<nF*12zuC|i7LAtN#SB*e{H)l-+mDaFtGvwK;4ssm*<xv%
zG06K<tt}`n$M!TWc+@fa$qYtCS~QKK!&?hXBrarlXB0#^&^@yv3`qJCn|!R3TLjXr
zW}7|Yj$>1e04Qt#YpnYv%>?@UtE)NQEyDj#X{~GZb6IZUDHpz1H1)3vM+1(;nQ70{
zc|R-tjOkh~*RAPw8^k<gYIWlR_4i!l=uS4*hL{_cpwk2cfP~)m*H#E|BYS#6PZvSk
zI|hk)&5&N78Sw;LGrB8H6|i~-mp;2JH){e64(Q=V{S>(ra#xh33aFoi7t*Oo+CHOf
zi0`2LGe#NnCHo7T)XRlm>asiAj&wn`PfXtd)ThQRDmXsXNwwAaQm!+?Otz@+sB|0p
z#IJeI-A1=k-vKj3V!8EeL1sMb03x%X2lTP_LwG}mf9H=12Zwu9s_p+jVi5{{DwU2_
za=oTZgh@<sfIj#|0s#~guPz?3e2GLOFJYpw71mS(d#l~EE(ePDMrL|lWNKGv?%p(K
zuFSZ6o4rK88a%L4UIuZ0oYH2Qfi&ueu#rT|NCLI#kW3Ln2V>(!3JaQW-0!S`6{8H?
zges;mg2L9G=iVQ}I&s)Lcp3@Ny`>}hRH0o&C2^7#QVya53PnbO8uki>{%-cZG_VB$
zj0#*D&}rLELp5O@>Dgh};fCJQT$C=K#j-GoO&mUb>l+bx$1_2ON(<!iT5X|}vYu+N
zU#Gp|vNdAvb$oMLJrvBM(8@$!<GqQ1>bA=&`s>3!72abBl6=IbL^hQ(Hy5omcyV9F
zW**Vs{oKUG;wr+vpZ+MT!`lSF_rCXZE+y27QU-8sTz9OWjvJTlCs@+Z_y9{C9o1`f
z+l*8=t`>+;=(%WlEZZEEM}EHK_WstHCw@Aj4Vb}*`E2f0#-OK%_a7$!o=MJnSB-&A
z3cmKT&;0kPzHZ)*b5r<5rXDzaJYBuyh<$X2spO1lDWpxqF+Vx%;SbC$jH&o|!pgNI
z@%2XXdC7pzqgSDhib`8d46WxN0FvhYG6#-FVZd|$aGuF;?EorIba%IY63Pf!bT9n_
zTo1!-iW?5(vqwI<+qZdd`UKWGw$(6S(Zpa!2&1AMsunhym7;R-=w0KWKkJpXn-v!_
z1Rhjo%?{ead>BOnTX;=!y5H@;Pb*I$h-%o(7N>?*7lLc~lAMC=RNN2rC5e(}HuIAO
zB%SD)D_mz=DwW1jOy7VwcVu6%M=A0bFeLQ;0XpvGI=IqrWfypiPi%fiF}0ME1qK>0
zQ&E)IZsg)$ExW2<6}m%NsP6s&Ka|;MJaZ*iag#bj?K-y^A0hL4mQ>m$@?dutq5Deg
z@8+v{><85E1kJ-AsIM&BUnKmggw=L8D%|2^qSr*%7w;b>D1pCwtaO!5@;qFygbXJH
zyy6>7{gGP=8e<*UL=mK;X+BD`A=w0POtrSPvX-h1>dkSu@#iL<=f79opyHsg0b^7>
zE?L{u^CI<?P%!4Zm+XC$mD~)SyR3YX*(?45A{v{z2-iGy_vlK&Yt+Tr8rjF-SOMRG
z;`%g60q^0in(}%5WaWr5O3UHE`L5oWK`%yq=mX6xxf1?I<@hF*?A%tYt76I|8zeI*
z-H<PExe}7PcARkz;yptNKJ189BnOCrv+svyhjZ6WmD;Z<V0!~=HkfX8p^Je0g3-%|
z&NjXpN*xhy+TFl@f~Xi4)3B28K(3RE(Ta;C<0O0#so@}b6^I>q5b}e>xq&XpS{q0h
z<e)FUblClgo2Z@#3t4tbGr%nwsXbys;%0kUGt9ch$>hR%{;6t{LIg{DN;$C5j?+OY
zXJbhgkvTPQ7%uZB&112|W~IWAv$sSp*QWOFgRyp13AdSXm}(G1Hr-%rZY{Sn>7QtY
z@DpV{RC7G5Iy_hY<!lI!gUlf%oCiB~)|}JGM=_eb)iwyQ?&g`o$W9TNt(o_s^REAH
z&>@}_K2%CzI*}en>#faY7IwkgGAe)ARb6&a13c(kA3?bpyFcD5wJ#lev&v$t-U`5j
zngqb{6+_0BRf8aajd}G!3ow#G82yNDV^ZtNn7c(30>-kjJ}c((+33R@WmO@eyeeG3
zfc#D!hGa?X;lNvxiwr*a-M!*nG5+URDHG~Zb&w`7GP=y1R82S%%CFMx>9Z$R_b8$~
zcc=zP)L6aUni#Wi!6kw)-SXNQ%HbNIGG+|!4Eg7unXAULF{7kCWlY(0fiPz!b2F2w
zVyPqe{<2#vUYOt`6b2JH3pSJH%hZR@aah=Jq~DHv)mhuN?z>rBqG!BIt_OV0i?V%(
zmhly1>~f<*iO!&>t$g5tg0Rh)`ywdAKRYDO9_){>D^6JYKuLrm`KqmE(WJw~2(_&z
zjc($c1Yfbe45q>KI3*RRYa87c<@$>lIvH_>x`wi*PP)Ewi{R|xQWv4(E;TCt_k8+k
zPilFc*ApuaFPfMlPsf~Nu#Yn92)B^`AScI%_L?I@Vv2LYKf&0)H<wP8dOUGtYGluG
z3nu%;Tb~utHiMl<x5Vu0*@pEKbdV<d7_4^&lrWpu$62|XY&k|}pvpYSsr>4PyoA1t
zSY+D31cS-%;~_ulw6D`Tn#{-U)P>@bg1Xmw3n5l0qL4S~y<AO^5V@HZhwoa*MsNZT
zCWfboFf&eG(B3LZ%z>F&>pufKh2ujRHEpahM)o+-Vh2U&A;DZaBtedwy++g25;;}<
zZMrp1MhWAE!YdPgybRB*B*d7UBt<p_>2hVIqP1Jq@3-4tOQURRr4>HiTln0_XuK=U
z_RUo*KL)>J9Q{U(EXi3t9Yy_QhRCOoedlf=eWF-{xv-oa!Q)(fcHz;e3(O=LR;z6q
zahEi%J8Dq(&`-~+5?sjQeXF(kt+-83NU;aSv)kspvNHN2I+7)qLO!4(C{(F}1<;2X
zHjxja>G68>Al%yX3*^*QC0JkGpY=qg!e>GLE%B~8XRVTQ%}iv!cb}X$-*iTAT<SoV
z1CSm@O3IdCZX6?48@}w`?7~S79GLjxz(s=MI@+?ferXQpOY_Om)uWbjFAro%vzCP%
zwKRa1Ni`bMg!;>QnQH_@PVwdP8EY^Owtq4=g^DHCDLBE-ueqOC`TkBOE$*>VO?U8%
zwGXwz%Uun1U5wO9WP0B7_IUwiHaOT)=MHlMjgleCLqGLmlC}BuFF+mC(2<2o?0m<5
z?KD<8C#Rrut=wbEhlY(@CK&iWO5~u`?e@cGoLwCkFva}72%DKk3<+~@vBf?#=5l}N
zMUn^64@Yu`@^uwBE*8$_kBjUD|7$U?e9Y>`XGOfv<X4TFY@?&E-G887oKKG*tI`PB
zc<$UuA}b4hR4)+<VRu?a`&Qq}1Z(5cxD)f+o^`p7`Y)R)C^Pp3bm>;1X3n$vNxwL`
z2%P>Efb}Z;Y#Xb3e3l&OY&79`WLMpzMB?g|^+!yNzce;$0c8J~5;l!A0j>UhocIuD
zfC)Wr2?Gvex_FnSKj)}bn_oGY`crh{+<I`=4vvASD(Go9sB8<ITUaBAQSeCQCR*sj
zxpHgqcDV$<)u>YEmDk63rZzyG>sFUk7bQ-Pv~?)pq2=|)8F^_aRCHf(J^%Ec40~Bj
zQ+ZQUwH$S%rF<NwP>uU7RW$n%w?FYo{z(_%G|Ioxc|@Z26wB0HlIP_}gPy9_3FwRq
zzNvVy+6~t1YypX*b4Ox;U*n5)zh+NXNi&*xxcnNDgcy7qCcD=E7AcKveTarOJ_nFA
zQxF~dq;U^Tg2c4mqh0CJb+{V#CAEOPH@?^o#W2dYem7S{gU;wJ>^)1fhTh0My^ezQ
zJY6c3eK$FeFUeYe3)SM>^w3@z1==7p{2<%$e}IuE3p}sxPA5Vy|7L3>Rn?!*Nl=}r
zaX()JQYLtdY$Z&)1USD<F(Uf9T#Y66vzU_*n?9DEq#ao|Ba_APjA+uNp|C$toNBcs
zXWNch!V#h%ytq~CuITzf@~U;~yn(dH<PK10>^B_4>I_+TlOJHbe}MKZuZsUNc=I=j
zN@=K>t^<~h=MQ&W5}F(3YEyk1gh_?mnv18LO;NJ_<Z>5Xz9#<Szxf`LxI(Jo21<8$
z`z&fmiCx0>q;hQQJ3c*PP&uRumTFC+3%nKqtD}ZT1m^s<^gaJpBh_zOICh|@H?uNl
z{c}Yt{QhpvS0ZZUqNfz4xZqbmskO1Vv>H%F;FH2X*KWB}k8pOkn_fH?f-0+}qyJA?
z(xKC~L3p)WxG!l`hxKrb?!w<j_<U2cq6L=cq((S+-KL#}NakDI3Uf7B=Fmh?a40PB
zcp<h#*^cV1|17rBq_X|A0mnDBg31(YDj(D<MBLC1I!IQo@@*Z*SN~beQ3oVZFF0sX
z5Lf=)`6%o0-_uBYZYhm>`bu;v+NQ*wqY({Xbcs0d!fMcmg0K;T<o8qUYkU1A2fOYN
z_WBXUNPw{>G!pB>+j5l~`R+#F4?=i~u0H|>(m0}>&W(y_65(s~-KEjpD!0VMgi^m-
z6%5pKYxEHuV5A$$HkGSRrb<{+SUigoQ-8j<@k8HLRdv=g4{yaCPdCxJ>vKC2iSu?D
zVdN3~6^fL}TJxq6XI6M)ShkckI4}*|h)Ckza4fc7`-O={HA#0ZW={<qb0JV^mC^C`
z#_Wgxav^kktkT`dz<4txiLe_FS5TWOQ6f1B9|zi*kQTn}LEmw}%(vAhb8Wc-!08%J
z(bBlJCUKhZk9_U^Sy`pkckMO+A7XY~;zH*Xb8tgv0xJd0ud0f2EEC4)S?b6B4<L2;
z_iZ`Wl`#xQ9A}CSdgceimz0vkc`4$*xCkG&be?j_Qf(wQqY3xb(V656O#AX6<ty5=
z(QJH?X|0Rhq|*Slas+$~FsQe5In7JQT1Oidqt)<-j7mxNhe&>1Bkleeh$i5qHp($1
zV(dEeHSkeKPDdWKC*fAcVvzel2rJj1k)xgxfPEVT_~>aXpRske+T=#-viul?Tpzi+
z3L}|CtbW<k`O(o&r%7WU_6sEP7pS0R%Z)ACX(tP{I`ST)vDUWm$gkd#_@ev|kS2XA
z_NUoMzG!RMBHagS*EmV(IDG$5$`mfb&gYc(NnTKO=)rMd#|<y~VJ{=DMN4;WdLxLt
zw8q}SwQ{zGWy~}6f3s0doS2_f4sP&4N1R`NqDVg$6)(yk{ukynJPWAJSz2eBZS7>4
z>|&3@zAKZxRfth<Z!?Q}CRyC9eQZeP2kZm5O&<<C=(Z<`w&NWcNLnLqh}xqV{{e=r
z(z!m?DYluIfOgC2GZvSF7%YGAHu&*dJmXTmDP=CVIxe=PIAvGGU}<Bg-lh6>y%TqV
zN%b|bO3#OBIBpFR#GKCLbOJD}q%PG&)=(YNi}q}=Gu2-IwW6iXy~>hM9LsKPO5OBB
zk$Nzy#dTXpRv5U4SbmMRLuI*rAX6t~!mPoq_4&~8%jcoMc2C$8r?>%!>b>HFqXp*=
zlALqTRlx5G@y>AD5x2DijTL`0NnRs!?qvJxPb(FZD(e3M3JG-hiwsA9FLsNijjSJW
ze&g}PMP-$u$k@_X_?8njyAa=`wYg5>O=x{vwGNt^Y%WX|pgixc0sE@i-1jSO)(DEM
zb~}(cmJPRJ^K`=(yGa)$o$*q@T}pgv4||)tM%y!06-FAm;f>J$j*aTynu6ME@m;7v
zO*K=6Mh4Q|YJ(|JpIMIJl=3nn>2jHBh)m}O86MPEw+W;bBrz3OPQ1`H&#-OLWFt_q
zI^z+hJ$)JYnmEpvB6YTRoOOGKyfi?w#V=lAv!SgNM}(5-U{tYO#;q!gG*R0VubYzu
zfwOnnHM>7?0txO6$Lca&?0hjd!MiicDy^OcnFdzi2;TpAri6Ke8e%$zr^sKCK7RBD
z=?Kk({zF_1-rXPfBGX7{AVG8tVvTy@Ee>rfNKAOc_YanC|J0k;Wj%S1zdqI!FBlQU
zZetcYjRZborEL{9W-E}E(J;+e_qH}TFE(4KQfkb2^3tbkUaL`Eb|~~N!s2R%F|k>y
z63$D6yAb%OWy`f_?0%9)Z7V?LfLrELT0NQVvq`-9_fMrVt+aEoq~p`fJilN-rJ_K<
zf3$Gm#AlSPu_fs{lMMAsjj&Egmb5zMX5X0mTAb~eYdNuVM#yY%CmBI}u8?ad3yYm6
zoZd|Q*pi#K#&0KR8<=#Gc|qVCUB5VC$r1Smkb#%6Y0{~{yGk}DReaOueB~2K&0=}a
z36*OM?ymBR`Ql<r1(89Ur`@x`&*)lurW{i5I`_jUqqhOjgbdu^4K=m;?aYg=24)2x
zj!K^Tp<^#l`ID-AMQ9VU^*J?uvQ&W)h=YYvaqS&zg=RNGY2GwLC1<LYkz!#Y$rJQZ
zeo<sr8k~LJw&{4`=Cz}ZzAcxn-6>1QCALyp=v{;dEK%BID}mXwQ2@TGl8Ql_&IShJ
zxSy%K9M!{@NngX}*GecM=O4NFAyb<cB5cPasqg4ZhxQN(zOj3OQCje{Bf}0$lOapx
zH|Y6X4Tr~Xb+mY(gQwvyPZdw+MOtfP8|1Gvi>n^<wGL~kZy0UShxPxUZKY1hR_k0;
z`ab1|Kp>I*UC^fovqK{CDh31mD9ktK_!4RalZc@h-8Bt5)%0P6T^_k6&1mbjjTCcQ
zuhQ7@o`!PVu9)Jqv?UtRkzVFhfn`k-hSKQ%;1VlN&BlY>df16CeN)p_M@HbN3zw#D
zc~4GC43kORkhW;OcS+%Dz0-wXSGBiJ0xO0_JXEc4l~YJsU6R*!4LkRamKS(gbU84T
zuPfdiBR-TB6xj|0s+r|{yCfo#D&zdVmcEE|y_i>U@QCg%Lao2N?H7C%M<Iz`tB7z$
z?<7W@Ysy9s`#v?M(Yc8`e@qx8Ud>F3EOSR^K&K&Q$CeXpAUD6+OEgr?@cWL0elcuC
zQDa9l>*}YI7(?C5UZJz!vg202IgEjV6!5WD=x?dCGQSw>Q#`(v;OC@#6L1)B<b&x?
z?;3f_G&)tHmWbAu!O2~@T#@C4L1P;;=YIe`!-c<eyjKp)MVeU}cCH8XfbS?!JjV(>
zNjfd@kvx*HIT2efWp?0z&xrOtiChe218JtcDKGXq{ejpNl2D3t%OuIQBA3zk7n6+E
zkj?3OhObO@G-<XQ+1k~VJ0Q035-*Za_iucBzvCC`+=+M%4TKny6b0%%?r~PKo|K16
ze)^Z#S?<wQYumk7dIZMf{VatxjV*^ujjaoY4v&r&1Zr}xTL(Nw{sTa3$A{VQ>e6vp
zC!F>#uZ;7o;qfB^z${*&Zn=ZiIf2D~@N2qw{74X`9@+{!TTZ!)+MBAojR8Z(8;3=L
zYAPI96;tiPVLo?I*&#DJPpP6TbtH+kQ&?;pw8>rnb}7wwGjSec9PwduQgl_U2`xaw
zQ*q>X=S8`@yKlEYk%K115Yy)&YrpT`pf|A~zn1%}H#CJ|vNO^$iI^N9PPzkpS!up_
z0yAmsGYm`(22Pi%6H-eRB`%X5f^)a&S%iL$))(x=d~jDIl*IXB;t|5`Zp={pJ(Z^l
zxtW2JHr)d(UP$_vZt42&@T8^GXXtE=l09ph#?$vlCBD#?>$U~Kl|4aO3%Ntm1V7>%
z93>X7OnP*IG$C;Ssm<T&^_%aoy<Zn-@KWXMq(=yNXl|;)axqk|_r`uvOGwJhEiP@S
zH*1*d0?B&`>|njF@5+`S*nOsHb$F9;+XBC3$zOq#|FR$Se)uqBpZcVDE0pXC7FASI
z7Q-vI@J3ZOl;9nLCJy2b`&>}<fTiA=<huD%_}tRBiQpQ(sJ_{?bnWI{Qu7<&B#~{C
za)*7=6UfZd@~U0wX5uJujD#?iueb}lBW8AE%z(;18i^#-?u1)O*s>WBr}a9US_F58
zFb2tO1544?uCRHDf2>$STM`GJm*KX^TaYDQU2FBlLKW}xQ*E<`Q<p^w#Rz(D%Qq@N
zKvYXhLTsb2+LXt3iufak@pN<imVzXg-7G{$uy;F5oBYpzLac8pEgEcRT+hGtBs;UF
zML85CHt*n$6^`4N97Ml#Us&^~@L~!50Bd}ea`@igsgT|#q#z`#!SDzDgO5ZB$9`3c
zB3L}<zrpTF9AT=_-KaB$<cn<1lxJ*qLIi>+Mi)v;;df8ls?t+p5=1FAnR#MmaZFYE
zCden*|D`xKa*vZH_x7;5cYsErIv$ezF?e5tqXxRMX-ViSi)QzT(0Zi#s(XBB`0J9Q
z>$i_Wp)ubr7yAH<$J<_eFmfYbLP*<Q-1pJ96z(GiVj!Vg#sOrnFKw_7oDN5nZ`8|4
z*K~gaOVb(Lt(z1Q)(;;a>g!)Qq!gj{lY?u*qfH1hcus6{E|H6p&c+2;8xhMwqT`B~
zAx5;B=_YS(KE2bse){k%_8n937dGx=u<E-AskKRE&>%bxkzab-y^Km%<R7GTZeHTN
z;pD6+g1_W@)Dqf>FcVeWHy3{Vnm<ZLVx8v4*b;w`%oMxcpVf(9c%bNO4<e-q@E9j2
zPnz&*(m7-FBQ`OGq)Ei=9ALpYF1I%pWu`cmT9LM`x={~7Pps%ym^qZ$mHw&?Gsb>4
zVJPiPzz6^Xj*}-McddAMHrYGEjF+TOY&6p18SBT!yg^K>u`QcRsxl4^klW+xy55B9
zu?+H>fl&`p-~sGUuT4-imn6=D{veynk>YKV4J_9a+e}g|+0|^EDHtNnVBj3wR7?X<
zTA{P95Kgg{v3wu3$*y7;Y}Ghd+tlrD3~?z+Kp9Oh7Kx)h&e0Hf&QU-gGZSRLRVni>
zj96$gV*<_?PDiCFfpM<~C+G9R6^Bf`Td&BD*sr<!R9fz{y_VILhJgWoSa_vrdm{I|
z?vDpTm<P9uCKsmxR=nvz0XSmw9~cEKyphg$P#-rs=~)Z%w#dZ|9!?T~ae^F|TKmpl
z9^amUPBS>_&RI1JnsJEcLAtn9;%5_V)+uds4moi3o*9o4JZ~EOJ3-hPC8gd0lzU^K
zRv7eQA<8rn62fZOK_&rqMeVcYZ&eUPFvPJdW*hqM^sa)YzHSMtq&|@>hlEgX@hzTy
zVo5k$VE5sPO6bmLS24fBKJ7HRxh|QuOHRp!xJlLSn6soNNo7+9&i`qDtiYyDe^sH+
ze()rp(h(_C3vI$#PG=k!#GNQgUdPy6Yfbt4D(?cAz`TbSIb$d@EbF0L4-?+$z>K{|
zSZVUDo}V(xICN@!FdcpDN=g>a?5Ibef8j!7y3IHXcTEv95%hh~r&jK55%PGBoXqOo
zd-hD7W=B(8sIIfag1(}}!6FuWnG<#W{x#V`qoD!k!*UpP?|R<?%HmGf8+k{4NzBUt
zGkKY?fsX?1<Y&r+#X{U?j4wO}eokDrL8r=UHL>btuE5eMXkxkbzT~3pVO;lZn(i)_
z7;d=o3fEx69Y%RB$r9<BySqD^#`ap1HoX;hVhep4xf$Y%iK>*841IqF==PYJW{D?9
z?G{E4@9z?^E1vp0n!DL~1#bTs((p$|9UeOt=5tAJb)U;QU<AB1<srV(Q(uHqiVDm;
z%MX|@IF5R@nXiQlR-{IGM_y%;-%wZ%a6tn;o1V&G>UFnj=`fIQu{6@1n6BY)?hbCc
z)kbArdWTG32c?*{oPcj{bnW%c{{ZmUDcQk`l$EM79Wf)z+ys5^U;Ivse_VE_UGBek
zt?bG|lsAfsD6^%g1bs~W{hKLq+H~ej{0$V&@&-EHxr1U5RlJbtbh$cGzb-BfoIu6t
z)j@k0XG)97nqo!;LlcHP2UTOsG#;_fD0#a&q4OA$#U<~<LDO`c8D2|gm~m{N0Cj4f
zVpo8LtOqn0DZZ>YVAp|a^)<HAf}qmdiM4Y4tm?n0iSml-wOFXbTI&UJ)RJHPn3#_t
zX<Mb$qcye!1P)xBXZ%Azf(9RCn@JB-SAB;c=nXDi2;DyztkLt;(=;p&RyRq)b<W+F
zIOW{SBhGDg{s9z^gHUF&Xbf=P)@aSL)W29m@27_#sn>68H8ByQPn6Si_mc>N=pUA@
zC}O|E@BaJ`Fzh3_xa4A^69RgiBY9wE=+2pruZv271$r!~gPp^l;xqORguiqM@+)bz
z=~zYrZo-|~D{vG$GNU4ne29I_;%l5`<;-)PsfI=&c4k)Qd~ep<%{oI$+=?|xZGwg{
zfmiECdWW*WeO{7h&B1&QK&E*V;ni?9lXB)mrPM_Cpu)la#Z&(sw9k^pQ_Di7w1+FY
zTD<>|;&Sa%E<J!hTANv00sM}-UY2E3!e7Tm5ba@Vk^RV}AxX$gRD%@v%zu&^#hrVL
z=>QxvrSx%DkaaGzo}=o3FHp^E!ljB8kvDi;31dFn5-!H!JjyM>GxNF{9?E=%$Hl#y
zQH(Xz<d~O0HZ!hAnwr}5sm`O)LmwGMhrYV+GZVN<0a9LO7AI*4;$A+KlFrxYyC{j0
zJWB6=@GfY2EO*!$Gj+Bd^8?C9{^%_WEX=rg)=+y1Pv)ThSCCXA6QJ9;hh(+wH|QTJ
zcEd)FtU4JF^-)qBwsj@nojfT}xUDW1AaJjl%gMCR)zcpL^)ta`F+@{!ec*P3C(_J;
zhQ2emUN&*)!$DT~k#!uBwY>o8oQwfJEA>FZzxMMuRr4h8!?JI-j+!=9n*&T08<7T6
z7W_>AGVqK$v$Jnbn3=fat)j}%LLx)$Gm+Tbhth>3x#=@)DHFRh0Neo*3}E%-e$G1Z
z>{u|k9Qs_QDP}teWV?Fno?Setw_w89WM8-drq-Qo#6ym|lsG=t^v78EZ+*T`%D=|(
z@oyz5a^(Q4cH_nK^qpDis(+E0fM>~mg`GWA49*@<2Wa!$_yfL8O0{4Fax9&czAj*I
zKKRK?Gcp8n%RrC1bpjFY^K5Xi#UMAv^Bunc$sAu<@UJKhE3Svzk3WXTb_+K7><j$a
zRU>?GgsZh-mffkc{-`TW1+2yMJ{)U(Q}dmBsDxHmwL9ww!#x6B@&}7#)9*m?u%d;E
zZN_V7xHQO<n7vX*SkL8<Wu%$pwuV&Oo`-@deYg&_i~}}sv5JWx3racwfz0jp<~s0P
zJ2jgel!m?Iapu;-OzMl_q$$l2j&}79l+`;!b^!;?)6Tk37zyE)Yx@?=KtW<u!%6UC
zH;EQA_2*hu)gew7g_`IgNku;2rbPM1oOKrk#^LF3U6&ck_T1YgXxcApX52JQwq<*4
zVsp+-(TkU@G81;rT$r>l0dO)s+X{%y2}qvzk7ZkuTly2ZJPkr{zc2Zbbj8xoo}l;G
z=-JwY5{&0+9@GI^0Z^28Un&Krgo`<(%ZBc`uoNWL#!uDHa%XPwIs^JWTVYK7WoBRM
z=zH)tYF%56youM}FVd|DbrJ4(WS!y#mTrAp5}irZ$cBISS{H)5O`VpG(td%Y;_1+$
z#;dZV|I5a%Z$qEe*-lsJCooOpw|Y8CUAV$tztq3)^I?jo*Iwng3x%O?hZeLlryo{i
zaaM+gxo+pBT+Sw?F5QF7ZQ4gX$?z$WUFflYRT>;xn%y>_?9NcCqsRe(M=8-;+{;g%
z+@D&nnAh|s5q6=ZaRngKg6ZT|t)iC2YGX!IV#+;&Wv;pEu>AhH<F$nIE7EKdU7B*b
zg9x<iZTQyEfm(IqrNTj;<E<b+ioYi-t~?j6@BCxm@~@W6<o22VigLOq+HmUAY9~n|
zg_ya*SaNhfcGd)Mj;R+lC*;$+urAyTGa=QK<kj0&LEn>Hx`*FK^++HTUcxVR+<&Wf
z^;XEX_7u89S`kJnLD*0AJurf(Gk}}xn@?Ok8Z;h}G6y+MtvdVC!`60r4+jA;S$hKC
z-Ttss67=2c1HsGPB|%aL=3!3)TqsZ*HdAfO{{Z1<%A!o2SS=_q6B`{ZPLQ6jhN|FR
zaree^^><+;xuMjrPENw#E|`q!)AibHLC{!-ARLN3a_75YOSNA_bk-@RxKfkpYen%e
zn<_m<P9F08_n#sw7t<wXy$c4~eiH^5L!(YQ?16a^qtiW!hPd;^tx?;o=+^~}Ic3*4
z+dED>=r@#_YiAWKc(K9G51Tb9$(F<ryYl}F^-fz<6UufiC7E#W|Mogk>dRSDUJ7Gm
zoTi8i%^&>E>B|NQ3Jly$^-Nr>M3vdCWlTe`Y)Qc*h@JmF==RkK;c+9c+Hz^vEH-iP
z5=?^ruw;leDXU}WLf>n}P^Qa2Qbbt`hXaw#_Ko&I-4{1?^80d9QY}t1%dk%G0_%k3
zKF;ttcNf8TiVhUoL0#Sl*oG*;I8#K;Y3R-W#nw5+Rr-c)do?u~lUun-lWo^z+qP}j
zWY=Wd#>zF>wr$)0Z@u5{`|ds)YwP(v>%Q*mJdb0u${R1!k&#di8s&hB5@u*w8Qmu2
z<Julk>=UyeVcZmWZa)oi)M(e60c`ril}(TEyT~&qmsDCB5PH69`X}wu2yDe3c*J=u
zHt*CG*N)x$wZ_jOD8zHw;#N(CA?`?$Flvbxe*C8HzW_g1$*jZ_kO=pEX$xNvW}F!<
z-Y|QL9f+qN4*X2yz(%mPddj;Q!T5PS%~M}B$V*9V$K^8UP2;|d#9}8&k#12KC9m#E
zp{d>L91ZdLrP?SeM`cJ+$RXu?yLs)Jt4Nh2NHW6c?f0FA{Ax*hG_5YqL4M2m^Gl`P
zEg^m5FzsO8ky#HX4^Z8SFi3SG5AM(#@=pFND991=sm$b78&}c|UDZH2wHVRQY~=e!
zy`l+=y`9VQ1Ydy!thT08I!UvoQ-YO*@E94M$e6DxOT;pYN$V5@@qiJvG6^d>=N`H=
zmc@EoQso%PEYDd#3Xhdzt{!wnA_{lXVJPtb-Bl-8S2p!dmx<z=;B)7Y<T7w8^6)v$
zwRN`vP<OHj*~}jAFe4|cMx!!Sj$lV-(BypiY?^e1jUi^ju=PFa)KE*Tjr;q}J$!j-
zeZlciLHiCqFG7ux=y;r%#o_!i1j^Y**sZVau3#QUF16RMzfX<$VRF~D8uA7MKjbcf
zj}NCAfo^bk5(H}^6seoD>zBR9#eV|^`nhmS>`}^&2SpSbQJcI<QskWu&?^4}&~<iW
z3^m(t_ogxsxw=*GEaHXYtQ^08P$5rmb*iJ-taubF@w5ODt<}!f*J+OfnL#Q0{G#(C
zuXFdZY-~1)yhj`Lj)u*(m&^RrEBmol?p=kHc00TOgn3#rWg{Pv&020G&r07h<x=|g
zwytK~$Q*}r{wQ(tt@S(2O0gi0DGphwIpGmV;^)GH;P{QJnds0-F@MAeBHJT;lkG$r
z@{X+GPURgWnK|$}ed1Hi;O*nNx)S-5EX8gaL(Lv}rtPl0IRV5BU#&mXe6}I&NhlZ#
z8Vs=jZa!GlU~h*ikB=<7C3vr{4Xw8r%uety&tG6uF*dIdde0{Ma1=KUv9DDWI*p1|
z*#Ep@AdeeusfhY)OJJEMWurP|nVLfzXkp1%h)9ATk~#XgXlz5xy-D;gWW9<eN?vu*
zV&C3#@!UO{C1iV1GvKTwPA{N^AZF}0SQG>R2&l(6bCG^ef*j&^7otCfV?@@;6x%;{
zXnk0<v2nWRly>}?Q4l_8Xl;ase5uE^M{V(&d<0%Y-Ae^x&xl?U{sWwVSNKvyF@+34
zIF1d^mIL1dH+NL;eE0-yYLgJEbABIjRAQ^8D2LU9QvU-myr~p-G>cO?7CSH=VeCIv
z2t=RJ3r8p%+dyr6vGG)DzZ!;WkEcat&q0maB#fs#Ca>U_S({ph)NGNpdpDtp9W#a{
zd@afjZe^Vrg>L;$N*g-xkvx@}KP{H19CjviJN+_FdZ<-<>YEJK5_?9ARpMyp_Mwr(
zU9p5L01q3(4%5rqtCZxtNvqcu(Vkv@u9}ZW&_Y9dCC@CnAa7<e8_%C*I7IYKi`C&d
z{7;f|ocD3;0@RDH+CKwi6*urv8YBdd$Bd&o|6*)*XS+JLiwW=Z%GXu1HqT#@FiVvh
zHp;Q&e)M#iY+8XhI&~MPi1|-dhJ5|NU~e{Z<p~wUHoPg3`#bQW_vT4>!<8OHoNld+
zC-8o_1CHH?VI7s{s==W+8k%9^yw3yt%)w3@zf7`y<G$8$nU9E<d5Wp21;;Ht5|~8M
zHi7NFva*Z7W>+D4tSb=hi)lp*ty>qXATs5v<}Shyrh(OUyXHdVEG+)FC%HYQXSoUS
z(quJPLmZmYwJOL|PvUW+r7~Imb9Lmoi79NSIVRQP@v*d=h8l^{n64y&^0imHTUBu=
zB;Opzj)3_|rVphhq$-<W!o<lpB@lLMs^|3;-k;Bfo5-5qS49>tvym54_>nP8(Bs9f
z#h#aNTl@aIs&poO7xpd=z+bTO96y8xxc9x1y`wL|Q%s*xW7rx)`l{eGl$6A4hFL{J
zPDH?ntuJ7!JQU7~U~|$`6fvn)A|X3Y6j+)oEkPpWEC6-2qOkz|cEwSaGXte2Z7qbM
z3+Sa>Sn_GF9v>gtT;*MqvMEh*JdR$HS=5%xTg%~v)Xvm-J={IZiN)m%JL^F`ELaPZ
zX#hn_y9;1(5EEh&@%K<y?CUm!2O65=F~2up08l~<q*+r@hIwO1{nPGVRa0j87W=>?
zLi8+T(m-9ii5&gK+O&8MNW<6Ny;iGzbEotiO4WmBY;5Hw5SpXE1b&Fz(#EC^tx%tN
zCI>N%&?W06tJ&9icM>?2PpGfwpG@VvMujN*J*LxbCLuVmjj);X90#~!b255dC?2sW
zI>Xt~RN>lY{~*`Zl3>PJ!;qnS+y7%oK2@u@xr=@K=e(@Cz%obFeH9#n#O~&58ls(*
z!`jBiHv>?L0y4@stdGj-y!6XKO{Np1uvv$Np?NEh;qW$XMYpg{qh+jwR!I0@)7RLZ
zbG;r5VoFHqX2`F=cU3n!`gC)W&e`Y+?WkCZAr+tJN-<CgYVOXB&tD}9SUl1{OkKVH
z(hbit5#)5x;!T9cY))2hI`5LjWda8`Ut%R>Geuxqg(FID((6%DlHwf2aq$fit5Z)x
zQBhl{q~9bEJ$_PGUPf<ciCfK;i~2B)tu+hhDx=!daPFI<sK+rM9-h~t+B3G6=bqps
z9Onih){B~@stp>%zmbP(9$7sN_4e%FH`$RbkK7sDB~1|mnpw!do$<j|&X57aPY%b;
zy_^Bu<VLzS)ugnTSVmte1m0CE#pWU79WE}63wCz(B(kMcB;+r$vmSVP4UYPWx=muc
z3l9RveL~l4X&$3NY0Qn~Ggfc=gmDo&$<YFars+CopSV@;iYP}P-*li#z%Vc9uA+7r
z807do53@(J`n5Dg<(0o<KbM@SZlXe$tS2(obW)ILh#ql0Ag${QzG5ajBU~BpC0Gs+
zCba`%c7|87k?;1z{|8V&dQk<;bEh0_$)82}C$p$;)CPVyqDY6x@SR!W^$lV{c7i&h
z-U`W-9As`L@$2`A@A$07wS#S`3?Rmm{}mOwQ6m`qkOSOJEovJLsw<)b`3l#@M4y5v
zW3=Qq<#x@q+hoT3G;Y5SF(RpJX|?WUzzNh4`z5CwBgoi<?H8Ipn;zIy)Y##M(VghW
zu%5^LG`26MGUBOr+k+f^38mKZzCCq9t{cJkVNunWB~R&Y9M~X_%-YXC*0YVzjm*dl
zcOdi#T6W1T#NU7w5RMW}m0mDuXcg19*roPqU#Ko5cq%vPC(dEy{Wyzp^Au~wPn4Lz
z4*82dzAG=+Jy|AQZkU0J8zCH>#mMt1ijHVwlG`o@CTq^o?b(`+Oks0nruo8BO$zhK
zJ?+|VYL>=zGsSA+0ADY4a?KGD*6`d~Nfb49h<I&ioWOlMxi;k;zhALFaU?JBLyIou
zO|NKgv`w@J$8R_sq)MwLo5j4bjX89C^mGT2^*+o^I;`8hD>aF?O)sobpZo}ZZ=5Tw
zN)8y=PcQ0Rwv~Ny@kJniglF594NCiwrL|gL|G#>_u523|Prr`ZHj#&b@3NT9(<m-g
z8$xlskb$o%7MXYjNiAe6M#uTz-SXOM&5&Nbg0R&~EN5vsR(l6`!HxgCg1Cj{xd%(c
zcDBqcq6P(6u04POQ7*5`p*}<VH##*}VSHYpf657e1#%uA2uCK!XOtM7H%3n6r^Eda
zsk~s4sL0M>N~B(Uk;Wah!58e-<o{<H=8ro08qONcDLHX~)Ch_&46;9|uC0MvI7Y^r
z`WD@C*z%{plvJl4n#T{-h2tJOny~JU#I;Rafd*}!emrVdk-gEE9bfBtm#5FN(A7{w
z;I5rXA!1yyH(e13w3Z!Q>P&V!NbQJ!jI(VYVlqnhHhI{fJ!ISl`a_n;V&LKRDM#%f
zgi%f2>r--YH83MYS?-`JO}gT=$GmTB#9O6e5Fk?fOmkIK8n(kh6k@5fD(MN4a@$cP
zW;*6<oRr8Lx>B{yd0opE>LEPJjNd^&9;><4%qE?+%Cvj+!AmZ*9-ciZZk<k~h+u~h
zCAgpdG3pk;RzKpd^Gd5hd(bM!IkK}4m+0WfS!-Xc-bURa{$oc!pwcY+q5ve(%S??$
z{MxK+h}&5r=^jhI@AFt~w$Lp}q)dDzhD>NK{pM99LuZVKz;C|x0s3-L*Fm+lX^Fb-
ziBx`tmn$f0yg&)R;QIJ3ooqQHc(Ol8Idw6;-v2vWCGfg$JGl*I%6h_HPN;ZWJ}Bi1
z=275}udKSIH{IVDGEPMGFfyk~!n>~v7NDs^2MDmDVr5b_9E!!hq2qK1tmzx`;Vg3O
z0q~cfcX7*d4^n<n1nJd(^9!Cz3e)NebZCHvx*lMWVAl;a(ufI_bJSAvV$oksCvJ=C
zf%*)#k$9P-h=nbnv@qo04zvr}Ww}M`dMfS~k>2D(u_(m)+^B;Vd*0(ICrm$-JFOoe
zk3UU<j)_lcj=y#ELP^bbeoB%qJQF$w-Ih!wGKd^%rD8?k;0{G^eZQ52J<9QT_^9MB
z3HqhGDlDz_F?esu6Gqy5mJwQhhv<Zma&8lj?|BbLActdXr)14;sz&yQ(qm+3u>*6p
zqa{o=`0LhwCmUu<Um%rRT%jdOqv4Cvq%~XoB|NqEHQ>JLl2XBz|1g4#6d4O=QlCt&
zq5$Q!*z_Na@?dGd$S|9>9!WXfZ0v-?f%u|+)gYQaYuz`})FGIJ^Ot$Kq5H;iN-nx>
zm|evuPWq;C@Kv)Vu^%xD2qmwU6&sChFw?tH%z;mopxhO~l;ZkN)S<Ece}K^kaWg!n
zlLwoC_1b3y)_UheCu?=tcU$hK?OIsJyP_(R=rhajeTUMRq?}vnp(2K5lQ`>KLOI&=
z9cpHhkmdUXJ2SVow6OE{zq>H(Y=YFYBIx*~$6*Uo=5Cn3on=W$Y$$P+Hc^<hy7<3_
z_ovP!l0pT~TXjd8bJr-GuY|TDV`EWQg!cyiv7?8X<T8tVa<3Xgp#D}At5Rdx!7P?r
zW}NFP8Jz{uR<0zmudOiWgyVm!lbxqLAoihmCW!U_4H7hZvOhUHDK4cEu{rz7K4t0t
z&J`f{@*M>C=FXm30tqFj%>7tmh8R)CtEt#zRZUtgbVFjeT2JI@L0%8)!-yCcT@v7|
zW0=b80^OxkhKrB=$kcy;(l=F9z0HBCb9Ph5pbM731Kx56%W-KBlbEB{R*eFY;3MmX
zi#Lg%E{o>CE!okVmK=oWiX8P&p-sGix8fJ__P@~A6!F=OJ-b>z=a$Ac4;G4cjd*{>
zGV`-ZpJl-s&l~>8Um4pUSj<t6iIR|s^=!PdYJsl^-6;Vh;PKq!LJv7`j5tg93R~?6
zX@sHbJY*LKCJ}$fCzvzb3!EzXss}h|Xp<p~cRHpBRGSB&$exrCHFTK!r^UAw3gz9l
z6sxRlP5322$`gU07TD3POxH9y7rd`&3{aApP3CQUewExAw)FQ=XWFt`cZkPJCG;VK
zjj^0B&J~w7CT*NyVeNWOPJ&dDq;X9?MvC~h3ml|-{`9rR+aa~I^p0E3gb?1&{_gHg
ziSCXMv3y}m`KG1P>{zg?^^@z5Y<7hdxfq{=xgJ*>X0))7r_%4Hy}_-T=|86=^!&A2
zlIwjqtQ+^S=dK=krT$F$TL+b|I%(0i`{jN-bFlme*exXi)9jiNItG7f2q80~@h7Vm
zXDuVD!QOw$&iKf3-)o#|+q%0S@GS~#XVdUH4Bc35n5H_51^2rv)yB;6wFDTL-G5YE
zy5!&yK53@FE~k1RYj`fuRhe~i1v+E7C4|B6PyKD{PP`I)Ht&=P-h>Pp^7L8;c?~We
z2jrZg*2S{Kl!x|MK^n|J%-GrM9#mwlF|$z8c_bIyowi%j{0H!9BXaSs1PA(bFE1w_
zB27&-LO<7>9*P$i5FrBfZp+Wr2OIICrIq%cW4Vz7Ro?plG?0XJmzE200!wI{Ix3&`
zM0caAY8&FVGGZPw@jQ;RKP$|D8UZUrijsQg>Kt2G@uIMY_};dPiS3>nMnz`n*!Tf&
z$xHL%cp}H{0gD#${F%kttUrcQLBLUSK|%f;;d&Hb-m&<6%e3QArsWy<>_V;P2}?(k
zSTu);LPuTFp8C^E@*p8oIJ|Lw?_olZA^Bo**6rPrX$ncAVTv!OCz+w?D1sT>rPr#F
zCQjP@rx>Fh3im6;hT%PbD|OW+(Ia9|h!IGySR8ej?sZA!8Er$#Bt^_kz_U_ny76ur
zr)`1kiAT-^)V)9B@{&<M6Yj8}E?E)-gcw1R3Wy)|D9@}ZI{%<iTb2x6ByU?FSe;>v
zC4&s(H#xp5URR4<V~>)z+!uBl%rcFe>s)N+fsU|cU6)YB^pF`M-zP@&-njEQN9&M<
zJlD`y($V$_tix|WNRnD}H~fQe3oJG5Xv_4ZOlUk8ZNT(6NY>H14RHtTmx%e?N~-0W
zH%sJoU)c>4WF`XP)+udri}@HaW|AOzq4jj;W|LS0q^{YzU2J(2^!S(`Nd0%EocKG>
zneU~#>b5*^7{u|)Un9ZlL-shAhIJl1P4|d@hbOXJh1R%5HHINbBdX*Hot6AlXZwHT
z@doPeNBf86S;zMS@7(MyjoZwyxFwYBjK{KKIWi~`S!pA#e{d<Q&!0XE-P+NW;Ki56
ze8f`6@F*mX-oRkUUXzrj>(b6}OBi#8?x$)~6UdAlASJvK?0RC<Vg$}cwjPMGc-&7#
zIBDuf*^b`KV`DMt4A@n<<FD}-?y6{lyb`t92Se5QV5`nXiOY<wjR=lV!!2yPKlx8v
z@yO&@uemr)|9P8<JjW9%(Qo5Q1|kX_v9nn<iV_<(Qhivp;g6E?I8#z$mO~-iN|zeq
z5JKGUA0#FU8lrX_S@KJ<eqJ{9OE;#cQg!c_CX;A!aJZwLR3L_h=uiP55>#zDQuwh0
zV27Z67EadiSMmJU8uvin0UtOwHF7@X3e4=)e7}y|_0OUsC-D#oGgWU@xE7rRF9A><
zXO%v(KiGxJDNZ|9_k8&$o+EV#zd?**G(9<ySLk5L!Egf1+0Zy!ok!(Fc?9AFl|Rwu
zkkA#Fs>h}hx4tubbEl$rax9Ql+hwepDfajOG`NLVJ3EuExfl;R%OVfcN>-%ow!9Vk
zQO+jN`etfxQeN))N2JZ>Y{^+Kyfnn4)%Jb(zIXUqUA&xkjdpJ{3|AOSNu82(T!7nJ
zvh#QIpHiqqSVDF^1{WK5BI@DU4OwSzY=980$xW;X%%}CZMmyY3Z~s{iLi$Nt9XPG0
z+{f>6i8Zrpa#K<myO#(1Ixgq0%c;-G+iq5HdTPA%A^~ocyd#xO2sG)b3W3H$27CAh
z0rK(*+x}8&eH^}|3JnQTqrkmg-r?s+JA)yaS3JA(wJSHbinLp<7{jeOUa=_s#?%Tr
zx+0$hpanj}OiYi|v8%eYt&h$?RrwGZ;Ee#xg{+lbC~izJ!snYGsd~k)^HT51i|Say
zM-yg;r7YIOBnh@?{|`X(?@i|yzu(+nZMFCgJSsz3D-S!Se)2YtPD%%fz3l@5+>;Iz
zKc4d_wgm5#Zxa0|=<J;GJ9&F;>*+3cE}ljSQ8&*L8~k?(%QvjYraDE9(!8c5&FzqU
zI0p8|fr)N+FOj_=n^`d)C-y1tzA1%66bY|`zRZyjP$qW2svm;>Z|=(Ya-rFLe>sjg
z5XzkE=Bp>$N(p!T*F2eWkVZh^#IZoJvJyl{?+vwMCa<Q$Govih2X3N-Gw~G>AM^q0
zJ?3apqZVFfox>f=&)l=oZL2f-bTUR}{P1IVxAVjzHNr~nX-9MT-U@}+3o)-qu^@F`
zSl#z3xE(y_%fy!A0KdG=v@<6a?TII)D35TK3BmNn1~8OWcT=4AMyqw_r^pZrtvTR0
zWv|fL+p)s>*HV3B`?tujRGp7<A)EgI1MgvWlzY2wFaktNS*D~Vbmh*$`hPn3oVuzw
z0CXlDr8Wiw-`Bl;@AoUr)tE9vc9qCzQn=RVt!jjc=L@5W2!>;NPVswswDivO-tN@#
zTkH5Ct=hdk3Q{l_h@A>M_qbGG#>esI>x0I$JP!FbHoTB;Zobf_uH|V~SY|v9s+tF@
zki7N>uLgM6r&8$eMx=k}#vU7XX}goO`u&=TvXFNRE3x#N%R~O#UjEi0^sl4yk&3%g
z3<_z+dgA(>&fcJ*3E0(vxc%Y)2C|>3QFPMgr|_{a8tvh+5R5*)E%|7<UVQz!G&6AD
z+u;=8_FHaDb>>2Eayx?-;ekv#46wuvH*gRjQuGrH;0-lp!AOMs(xP$Z%H<nhv3IEq
zSK?V$(-gdw1^zQ$$Y^8T<lhyVug&2JIUpxRxyP?W+rt87@0y93aFXK@f1Je+YA|R0
zaAWOnaUOS6ma%cJzh-^CQiX2`wk*WP8xnu7K98ylzcsB|zhxjxEqhd6`Wxz<P492r
zqW&cAR5rm&4<ofazp!PQ5PqaRte8%B2ub{~%bJs1_OtMmJCVrTxPNb@&@VX~F+iM@
zhbJ_XD=$-<r!DUYSsj#UCzd7SMuVQu{Xi+)r8$6&wsl(9sQu^NMJGf_)>Lk9?=}O&
zzR9LypOUh4sm1nvYuYM%;6T!xa~ONmmCxTxUZviaQc>+s61r~@!|CB&=`U#@SD)Q6
zNBj9luj3I)fnF(k0X7!kh?7t!t{o(v{_v^ZmMs<b&V^YyN@`1~yQ{OSO?8GsZLA^W
zZf#%D$29a!IyRaMw^XGaJ0+#jz&)H37<jId{=0!)n3m#uEIvLnkzM4*_ZV8>lR3KQ
zpXPCCtg^dS;xI(^;e=AQ0m7ArI5!m}rA2|k)1}nH98RKrRlRBacGYwv@4*{_3f4P=
z7fXUN3JzaBVRAG2)nF0x?|i5QvAa1k$UivcQ{KNY@vK?E?4j^c)Zd!vxA&0ydKNou
z`=p3rF`+ao6e-Jc3#O9rXx#Y74BRn3N%KpStm3?M&9Cvyx9!O^U=1PX7Duk2)ZOBu
zjeS2OzM_G7dD*J25EPO_g-O<bfL|^zb1_MH6mE_|RuW8ghmmu5{E}o@BQ|9Hr6g%@
z<os08CLZ6%?Q2;Q8#s^JTBq(dB)t4Y=BnGlu{Dh&Q?!J{fP=Ef%DmnB;PqmlokHHx
zq(n-J=GLCuL<7X&0aK2?)&)A}LZp`g4~5D8biiAI#IT8J+Vf_q9L<{1)Xe4vwL=a-
z$n7iP__mUcHhRn~xueqc=(x78(Aj@$_~I#`--fI1Ij2}%XYXEChDov~*fY1`0Hc?q
zC2h64v>^GmA#&%R#hiqS>E?>@4B)%i+MG6MH`<2ph&ODgtDzC}qj_*33jddf1mQgq
z!%$boo%QU+Qv$Erexg`6#mj#H&*Bi3S&m&J&I2NrSXlzUv3V$azQ!Re0>DCvX{WTc
zzu|nobY|Ah=w@(`zt#8Z<_KlC&4<e?!OTQopHt3j^ZFoZ3sh346?0O@Q^}xz<Eci+
zP6t<(9u_nRTQl!4R+q<L0&|$P<-rJ&wj(ok1RlvC4{_JQ3MpgdD=k6y;RI4}LC1Hg
zkZ&%$_lI`PIEJ_Fd89((9BZsJkF$}J<+v=f_Xweh#T*%@ncEP}-}j$630=+FVDSBb
z@3iWwb#c~{14_?LlB(#l3Q~Ptt+UYX=&r%|Y#6D$w#LuFOZDna?U-I3Y%nB!EvEw4
zqeDCsY2)pCE<Ur=2NJM+sJ-gVKmz7_!7bWO$aK!Zk^%s!n|1RmpZvmifM!E0+93}w
zA*TnoeOrcLxoKO#(S~E&%s#|SS!T_xyCgq|ao_P%yvFMeZnTg&r5`=2x)zX9SMMu)
zLX23C;wQ+isJKAV)Y5uISK^uO`$P=j$8<fan*U8#wY+*ME>v$NwKZk=(v`C%$#IJz
z?EW~Y4VA1kLK(jk7r1cG%l%7Y#Ms<q>i*?3*%glHkAX8ASFqqjB9%JKclqpJa*||A
zWyDc`BA`qZWmis9wW5+ianyXrw#j}J3Cs}VUVg{=9T{^x8bSZiekqZzvleTg;m%O4
z!SPH5=d!sVg(sS_LoQmTvvxsweB0Va=@bt^DZQSmzp}4!wJyTufKW|?ND9%CVolV<
z;#|yL*`bb3w9W&~(YgGQp43y^q6gB=T<4?<<W;r(3`%;e(2Z3t`S=g8#zCp^YJMfm
zSZDo_Opz;faq~`c2`c<DB*fs)(a&~X3$1i7AJN-W5*Nh}VXHo$KbxbrOF3^JV#kbA
zvw36Qp{5Qw;B|Mw{f=AS%lDUJ^6)hyo|BDxVZMXU(H*C)-O$o<x-;Ic|D&+lyWFZ>
z7WCrFJqBbH$appKD@jkX7+U4|_0PM_?#xA{A>lA>%OTcMnufgFUA#SVQ`Ko=C%X&q
zIjHf}E+hEQl5TNx-UcWL`5!>;KR`CUi?5P56@zGDaqIUed}3lx$mv7P77)t!4X5G6
z-pg2X9#to|B+jlx69J2s&M7OKe>h0aY+LrF#2sDmuME{DGtG=DcfuPBUwe(Z3@%8b
zf6;16frRIgbFH9IKB1x}z-EzQ5I$3a#J2qzQQTCF9^CcAioLODf-y|Y%pGB2w(-15
zBM7noO=)fC1mDB;W1g}kWHX26c{Lwz`1r`OC}X&ZDUb^5InQQ4$;aoM@NR6c&+f`)
zmk;(}8&b2rO$-VRMVQ8KTL)c}t@w?$G7b_Xq7{;KvGw5l(rRxnN1FO9878io)KR<N
z`Y5%wDQ!!fNb&EC8`tk_Z_Og*ilMO$$`od+3IyNKPzbGO3{&jc2RFrWUrGHdQ*BmJ
z&Y`V;f?(j+pn?Gfm1r-&c(^=|xU)wIZ@_^$X|0yIR#VW{0WWe|k~0qf^_!X!pb#>d
zkNRD-x+B(VbM^JEOlDb;AAx&<V2=AVBg;gET{`wDpIo;8DZ_To6VO-aYx2ZFLCGtU
z(ZV!9?d1tANy?iITgjf8$p@E0>I-{AjbSjXg!9q-UA35<VSf2%(qD&3VsLdfM$?v|
zaYLMfrO#7UNy@A(`^7`0Z8smh6p1jx<;qnZM!8Gbxh{CZK$8iVgh)fG6yAftO82!Z
zO27y>cs#IX#{y%?Veec&PCw;N`uX!=0k>s5A5;Wwv;`I`n`|IPWgfO@rnX^SJ}kxx
zljljTHh?+sJhH@ipY0S&`24cT(9qVL<6}4`MYpFC%9l%>tC+*FI$)j3Ojy=Nn*$M7
z@)118H_ft@<bFUucO|IVeWron$mJYh=I?7!2^4J_n4RQ!T6X+f<K%a}ID`>!PVV}1
z3p{lC?Jw%r+cfo<V?ug4r}bm~nnyLas%vW9><;aKkTfhNSr65mrr(C8bKl5zroYxk
z7DgJE*OUVLT9f|VvGL`~@n{nJxkEX3NX4j>LXz9<p#;LwiS_yNpLgUiXNknPPYE4r
ztz~DPHCmc6L+X?%$;*O1Eo+wbqgv@4zt#R2@i~Z-I`S=1`!RIK6w8vV<c7CYL{M$Q
zG=0|wI&L53ViY3XU%>NSHeO3Jo+oK!Dn(R~#-rzkh+E5PPQEN!kW3!X-4lSdt#7gB
zQ3>TKwzwh+MZ3W^@}!sZhhJV8V7M&6M${tPgDe&Ld{a+m_KOml*x3G>YpHu4-86jE
zS5Q?^sK{3p13&`cpAzTjKRYCv+xYK?ID5|Uhz4-ox_%Hxg=B$K@9GNwo2V$RVbpFD
z&FN6YV)6jP<8_SjNLpFgok=Ck3mNk_`WB*F0K9%Qkg<adR5G8yp1w52_R2o26sr$E
zL_;L>_3w!>-s-3H=PiS{D&VINNQ&F4S*RiG*AQ1IwnJ6D<Bff(pnrrbXz6Uxm=A#u
zOqgc-J7QvKQcbXo%!lhMWim1!@#hHT4oyp;6~wGBRz(^iK^GG-OkILkPMRn^BnVdQ
zLLB*2tk6@&NwMDs^;sfg15cR6=gQH^+>metEXe{;zZ6*BmmUQ#iKs}GR@UvXr|<un
z4LCGs)$Bhg%@;6l{3a@m_|ne6Z$6yI#1|9miyNzy+`>%iAf&<$-py%tEjqPH<Y!?(
zK{UQ+UAS^#ZWkU84OogL`vRz<29o0TUTjFm5o10(h5ywQ-ZsU#-M?m|();WB&!M+&
z4+{LY9a_vPKcPY=IXP2Ca2K7KUg|r>1Cb+EU9Dez&qE<cR4(*rB22KC8;6P=;B(C4
zPxVygS6zmfM^<p<-oN>(tZOrRIA_Vz<QA-bL0a|V`N~m56TJMrg?RhIAe<ENDAMb-
zUH{uZokv=16eLa>>6xiKzb{E(8iQ|w1w=&2y_6isnv0x_HOoAJ0QhO&P>}kPUg-k~
z;Hc5p^({bBI;^&nx^k-B&`qXYO^X-VSBu77G4fCW`*C(+`N&;(+OYI_XamD2zzr0|
zLoIZXQmeY^ze)qCsI@B+(Cl9+MP}t5-UO;ZlYozXX(X>$UN(GmFgAt$M=Mv)oX6*q
z3vQLusjR7o^bZubL+3unW)@TKGcTT%4STZRtPI(M+Rml)`6V~vcEk&`VF&}zoXd~*
zFxAd?gM3*PWa5!B(12)sTq9f$D-CeEzzt@v6?$`iY(4x8Q%RbP-rkCded&zr{=1z;
z{vRjH<?vC=u_T~j%*UY7B)SO8z%V%;9zk5SojA?*2@N&=re@Z0I?eJ;m3GA7z>pjv
zn%MqQ&FWP0qY~N-1mEtzeqrt?yjz7zL>t=rX?I3<56tS~1m{xS)%p!&)=85TqkOoV
z&?!DEg$YAHVrJw4&jnKWxr#(Vy69JXS#cTT^1od@B{sXG{rc_s^F|?orJeM=@cz=|
z4150VDB%x~OQr6CB~lfuXgYxj2S@@2DJ{-h>r%L4RJ$wY`1hL5;}|J!qrfSG&9D@(
z6uO?8oNe)vvE||_$WtHlD@uw2-b#tkd-Zi~47Kmx5lU%;T4O(t!0H^&HF-@^9uYOV
z!|(54$l2QI^W;Y5k91nOm%FMjc8d&p(#?9P8qcMLWR_{Ng_~&dmiqJBlAKDex<Pc~
z6q$eBx&ka}@(%XqU|Dt9faC%1`AUK30qW5IAe$?zaqRuWPSMbDz+gQp!rRk_8kwVu
zF~JpW=Xm_lkM;|LB{`YUe!T#)ni{i?T}>Q!3jl24xAM_^2o(i62^_XlLX}Hi)V^`C
zb$yma2HM($Wyf|*#OMm_@MFVstr(9rzWnBh)*7?T0REkdKwWAGnp(__VASDH{*p!?
znTb0NjA*9`uO*qDFDVgpfjO8?|FW3=_`MwSS2385V=(kN@)i<GVVEvvI{jQJ&(48s
z>3~K1v}N|+uitGBng@^rm4`W@nKjj>h{BU?GZ5n^m>3IJ<(_SITWYS!5v>yqIaix}
z$9%ru#ooXtuR`{v)zF!5g<(cp&8km%%f-e*n`@<QIPY5}$z(ZZDUlgc$8Z&c8T@LW
z@@&pWwu~1$96ZxAba-4gwsaGB!L$_~O8B<7kHsbJtqXRlMdNLp63g+$i@4${qO=nZ
zfOD<b+mm<$hf#mx!|Zq!t94A?&BmHnl#wk0E=QU=>~SJ9o@yedy{fLrc~K7y2|GJ!
z6Dq(j!a}dH&hDHqyF0fjln`+eX&%-FAeqsXXMHK_I;yXOV$qH$zKmBwj>xiCmdhT_
z7e(uyxBJZj%uT_oOzeeaNQS$kXmZx_y@Ob*Vh7hj;ZjTMXPkTvA74-&OlPZezy(X)
zeZkYwybS0^>rS+H9my@%y|K>VS0UfKZ$840XCvLeYSIVgYuEia{Xh15Y6&xws%=>5
zI%2kxEwkIQa*7@+Mk&(^a^_viAE{vD;LyNbQniD^NB-o~Z8C@9h@(jaf@+u8M$u7e
zZLLXn?tUnnI}T!jZq->>mrue)Ta(zebH(@_mgowwGNzx;QoBoQSt78iDIpzsZiCR|
zKY%YyW}<jP6c3j1L{4+;)wab)Q3KzG?i1nZ)00ZZbMA>i^1_DI6ZbEVra`n#b}&PO
zC^fZLoz2miZKFi<fd06gO;j`sMOk)kMjT>jKjK4vKB&N}REjY=vzMZp_OPcTb`32^
zoCn(mev4G>;^cdHPY+&n+&3bjw~RxcVML$?m>NVt<FwuIRuoF5NrL!dDoF+t?mRk7
za?7SR14vkt4$NXDd)%oi9(w^sYz10Omso4vNN28>Rojv&yqY}=fum!}F=xT9t6Nji
zS|XRr!CyAL>?nB$0^Gw(Y+X|BDO0D*7uztwhM?49lYdalO70H7=lEGd@Wav{ib(Pk
zX4llAS%TeT&ArT|Lc`plDIEm_o7wnh&bZr14*gMkW4Pbcyeyv;bhV4d4BQihLxF}#
z(_z_4&&rnSl4R%%{=lP-z|)LIxvthImF9&j&Q+O?df>E3^oM2LKXiwAR_OJC+{xF9
z8a;a|jwgh&g^qFWR##XU2(rTXPR?XGWO14Mw`Jv$GY1{5%!R)3u|4{@^EiR2I)nBw
z^#%J&GJ*wl18Gzr5By*MUcXdR?Oh#9C&vERIE=>&y+#U4k*dr6{5Hpk;A}a8g2Wwb
z^|Sy>&cIc_d{5+BS#v6B`Kzs&q}mi;3SyIwA2X#iTx~INvfKhhqQ&kyjYw<<!|&1^
z#Y;n$l2mXr!89PYGvDNTKP*q2X5?Zv9Mk&ZRa`-3>{Ct4j`FN}Izu-xi6^0Qb0~;E
z358))n#NgRVKUE#Xurdyd_+|(3gOZgxAE8fSQfs4I&-Vj3Hkab|JN&Z2f)Bh%^BGj
ztsr;)fHRRPme#SxXOI}#YK7v8Qj=@viu$uy#>!G3XW3n$vM5cIMaM<%%-vbHx-)hQ
zTHhT%hPcecHO8|Zpe#4e7Tgf+?&Jt@fJBFQv~@_XP?SG~mrT-tm@wCk=e{DRm(Qky
zdzwl9UegeBS-7&vi|nLw;WL~qEf12;%sCzZPMiz3m9|u4(%PZNPe=$*|5h=F0tVX(
zeJLwrI!QMoiN*Fg<M%WK21Zw1fOJW)LoXdiB$xMPt%LsqL<&@t7i}cB8nKg1A1g25
zdYWjrAsahjBCqeY>d30{#?CYyPXx3BevHkweku(FaFnoRN>r1F7{MTC{Z2}hC6n`9
zs<m*p7CFXbQm0v0hZGvw>)~xs6&z}Zg9Ao+*U}eTbO;zzGpVa{k`}9)UGs;OxyS0h
zfJu{-@ukSwj_#|R+1MLqHiRZ7cSSD#1fhjQ{{d`>rt0xEZ{`y!O&$iYq8#03gY)fY
ze{k7NN{DwMwh?7(ugNlPts%(~YZCYvkGKeA^VnjRenz`+C>Ao&4s-qEV|u81uY9kp
z85<mA`GFS_z&qrqfZ|YjNjd@tJN>!6D$#_)$n$1@__@e&GwNG(+BJurTo-^`iaC`K
z96Z%QKc(|iYjtF&F4Rp2**o}sS)jHPrAp3rkEs?roUn8%d$sv{GMbV$v1CuAUJda{
zCf_5#i#|-dp(jZ+c5nU9b46ehA?ab9PDV<tCssP&+B7w3R~<aEk4$O&+uTz|1g=@O
zQ~B`49j&Q;>cjDgH48|c;>;p#sIqUs#C1iDmN8Xs%{@BM;ke@hE9#)hOzqsDdvxXX
zPy09G{{YD}B|di>A~%NGi@k0rng|$f(aiL!6ogiqfY-a4uiO$37Xyd!QAOg$+Cgwb
zRWI*<pVw~!dV?TfjF7xVVfE=Q`Ld`=WpIcrnloX0oppAO>aKe|Ow*haIoI!N?weaE
z*Lar2ti7{H>+q<Cz{M~oeWot&aC)+4Pn;_7idrsNlz{8+2j7L3B=%RL(D;B?L4gp_
z+4>RIZT%a@VfM7kDev#v#@`x56auSNcSGXzD|?ibkeCLpvh1SD`w6|IGyZ19w)Ql-
z{lJJjsTNN8j%fiz`;5gx)CSF>4dgF%%7r2;gpHBa&i?=aZ<^XAoSHRGaJ?J&y|J64
za$nt+8wZ=np4}ag5XV5T(iCF0n8toK|DBU_-B61Inuec3CIn0nq2l5)2Aw|^Rh(xN
zkU<QjX7beTHW<O1wR^&jw#7}WBtMR(92Dd>g!KlGV~SZ7LD3&mrt>#l<)kF)+~`f*
ziuU<PPP4T^ijx0Ao`#+F*H_J?VwsZIQY&yv5&kx5ZFk20Pe`r5>a^4FaBf$)BPd*e
zy1awCkpVO2g9YW(AMVrYMf51uz_@#^AZ3ev)VOchule}UY?`)<iZfOXnfR6Sc-D$(
zQD`X*!SUz*1T8p#eB5S9mv2#E+s7gDuKecK;S3p0;gSfw65$R|erhlITQLfyDBOVG
z=}d`M|B|D6R9vDl4wu3C3D!F74X1?Xk{&82wr40%Srs~LAcXpQyy}Ynoo7tX_uv(r
zFL*i@tLs!xTxXOU{~M!$;e4vo%YfL1FLCAvg=@6+bS#$!dvF*W;KcE7t>r+QewIQp
z5$X3YvO6@}k*|jV7I{Gj)htH>g6j6WdsRt%SH2Ty>=^M?DZ<&`w)=_7Q6me;{6s$f
za+a4;qinu(Cc%Te(u3HU466LiW1E)CDbyuL(9r@v9faOg+wIEvLMH6UjB&FUa*}m2
zDIqYm`Id>3YJNLl-6`9;5gS(629CeVKDq7mm;E*30Vx6HweB>a(`zdv@(Yk*M@Fcv
zHtjesujjs|`x*?xhbhig&QVADw$91tem@VBel@W>vMHOGkFq%A$U$xp53lxVTxYO2
zPGHiUGqTm}5Mm||!wu7B6ub@X%e7sV=nz`<C!sKDGqJjp%5}Lyfiw9LC!0u$)kDue
zibu(FSbAS;6fezNEXqyhR^$~V2>U)26@};Vj?5M3RjKrYwLs2SlQ=L(G(UecZb*b(
zwP75d?=8!=5@5rCjl)0a?l}*MQC`&9)lcPd_VBl{+P?;+Kt1Sj-%!#TFi>_m268O0
zI)m0E=hOt5&~Dj%D#5(XgJ=GlN;wTZJa4=viG<AHC`z6;)jO5$>__D~ouF+4Oxciz
z7Mu+mS|!x-ghd!;2kP->6rXsC+jR<od!mPr^L1c>n0FX8e7>pT!kg0UtwV~x?=-rP
zEc;V?L32Rth0%Y2M*`ktq@UF8Kb##w0kW%_U5_InurNTf2h79i?_Kv*lon|K`LuJT
zW=DIBXWP06WRz-BA|e1Ynh8%m@4b@E+_>J!zbjTVuH0RRp&@0Mge^+?Ksj~KQp+Nv
zsZDvI18Piar?DZ)z*ZB&Y3zvASP00x`;wd!OOkF`3za~!J4bS<P2;+jr_&*wOL)&*
z?n!e`6HimFgel2S>h<xk&NdeQG4>d*Ulo>8)SmeFstP>ELZ75zdem<bTDT-phqyW9
zo?2?SChAy;n;Y_*gFxbnICNXdwRLc`d7$StF8;pUDs}9N_Ob;OW*gUO#rBAn%AS$7
zdNuU{gZ`jf5)oKpDemHxY}%b~Yie`X8&Z?D%L#(-!5y<C*er6Ry#S9G%K;{VV@=I`
zR4%PXXgYB8Wbb9X)ckx_LVq6?A+9;R@35zP9S}n9Cb6)h*#2h~%j(DkFiEQW)=ZYM
zF9K3kigG5V1damUe5pr_<HVY<K{SI-`xi#M%gg((YWVlk&MdMljy%q+O~)Tna)Y_2
zO-CL%kZ1l#^>KgfEv~apIFZSPB?&dPByk$+M=1(?H<nV;i@M%{1Ra$o&j$kWU<&i|
ztgQ7#3fA^6F+UZjbK7}_!QvodOfi_*qir!eolC9|c*i(N0$Ma?4RG36j40C;w|W|-
zp{3st70>oGws>An_=lUQaecy_v9{3kF5Vg?JDbNmB4?T$hmPo(BgOGhP*VZjRX4`q
z^NL{qD+o?nCYl{oOWZaV#fX1inkbDtx!z=jcCP43k_l9q7W%x_^dih?Prl7LVx%o3
zFXo~~c@-7Pl#De#tVgs9ixavWl$hh>s_OB$+FdkZNjjnFMfd?A%MKv0Hg3XBan=!s
z&P8O>{>^^1U>cXsJ5As8AHdvvp4M1$c5PoFiC8RLQeRL&>mXAEiLtEL&IRwogT5sd
zV>5*$<>4q|wakVDH>E+9ku#Cv^vq|v*v$H~nuA#qIg6)k#i1$Ss#ne3($)KXQdq)H
zry_ri(bLD0@8{VZTyA$ghdUwwBxgN%#=T@rrO)^>)_uD%oA>e2?l=!SZ3wL+DaERk
zCUaH2ncKY)@o-;KvRuTiqJ~vZ-VX6p6$~wMBx`$)wY1c3y<x@tE>?CL5*7sq?GtbW
zM(j!L<C)S02QFm=Nt^@S5i^{2KVGTHjPuwnC*p{9tu!r}@L0;vWRynzQv!BN?MY6L
z{Of9OVXs{w>1Ir06snj8>y+bQUr^>6Gc5H;@OW?*60v!{SsTmG+wRX#75ixnIMtKc
zK+qk@pZ-pX8IqJ8Wyji_Pv274bO#I}gFa@hCAyxH?VY&t83m4d0tKZ0*d_!|s0}3*
zvz$gDND#Q<`MuHA|ND6zH%z3}zo`xNL+HSA4Y+dm)U-7`^BFT7q*g-70q1sm{#m6~
zlIr*7x;N3bd(c0jRsu4qP*!UG`rS$iKC)*k53uM$2bYN{KAbnEk->!VAt^TfbV0$a
zM_8vsrh5<JR*%5Dx!%s-@&7xPP<5KNzLrPy7NTtATQQ_9{=9!nVaa)D%b-NTzNf<b
zAE4Z73cGuePy;^CbZ-|a@EoL<oXYasmTAaecJql~l9ZW$^kmezp4UChwLg5XtKpB%
z#O!mR1B%QQw+ejL^;EuvY}MFCt4{7vc2~5x)1dG2Em$Krtop0Mm~8g4^*}72_(gN2
zZDO%xxa5!rHoG7*!f!MTf{!JplJ}VBzPf{E#CYyFpwGkxi#Q8XBYkQ=S@pMcWd$78
zjO+N%Vg*1+IO5~iD7eRk!QSwiudFb;&Ryl#RxZCkyVyQVd93+#pGK((K}sOXAUBLl
zwPVrty_d$+0TWfqJwQDb1{*Ez9&{{cm1*ha0UiWTH4Di%R}yuj>^#*{z`r^EaQh{d
z^{;;ych}hQq7VoJB9%WhS!(I&WT!jEG+BHL$dUHeB+~?U9Hr5NZ>FV;+G5!lIqfJH
zsLQi>fI>UyZg(TzY%cjL-+coF;Kv&ma0kuc1K$^Sxp*t3`Ums3Yg7IMgg9R~Sw&iC
zk~O39>R_W-S5hQQn#fyDjqA$}wDUdiiARAs6H+m`Yfo-h{AC{^H?=NU6Zd_7AL8KW
zUIl$;coNr!X$f2O*fv)zQYr&iOJ;RCo3W6aObA1;8~e#w@cL2?8P$#GafJLG>KSJ@
zR`YLJi&)kF+!6i*NSA+DcF)x!SAi)gxL%537EBvj;tB1V>2s|PB-$n2-h3X=ml#2U
z{31^kJbDKk1Ht&T`S<5iT2^}fw$4PZTW|{uUD3|lDIaHAj}z*S8toEQdq40YbI=2)
z5?yK5^~gxuCBf+WD|EW_nv#B>-nZJk{{a2xRF{vL#*W11k?S4sodKkz#{v8$-KF}!
zX3Z@MTYD_Yf;hkBnQ+p3V5cr)J`he>p`CfLs-yo0;2_sd@$+lWmE?5J1}>`{)UUuG
zVKrkY%2)i~;q}mF3;QPP4p*qQ=q3Yyt(Vl>Z`~}lW!7ai>YF)?tF`URLp%!g+G8_N
z2IUS%bS+ooXsxfdcQs(yM+xOE`;CCHDG(To4NCq<5sfa`T02w5aB`${4Feu|d0kMA
z(wpl_G2??Aks0MThxYRQ>Lf6<#W#dVt^r)cfXw}A2S3+x#1s@uClnXE{`f!M8@!}v
z9IVBr#yZFR!@R;9JbC8(-jxOc&H13Y)!T{W>D9_jJ!06wqWBi<9G09M;jVT|y*ttL
zmp|r#&J+99SiYAr555QVWO5c_INx}?p^F-aDH`s+qX5&q$LsN2*vdn4(b09*o2y#S
z5<5Du<87p?RG(&tp0H(%p;i7NO0M`iN-kANe80Q^d`ANI;)j?-x`h@^vZiPLSVp*l
z^6k?qA)I2r#fIsvCZIT*TXM5*)e|L!3<=+TTx*A*#hztl_i76SN<BN3qHZq>6gxhi
za8{hViCCFjij24i5{gP?bj>tE*bXP$YdvS@b~Xkc(P7k=91N|lPgTx0N1cONz{Wq5
z0)fCOD=o8p44K)jamS5>kgIJRewPg|A4%rTljV~;igWx{wZr3)FN~%}cU|Zi3o@UQ
z0oKD|cU5Q7$p)oF&KQZCt+LD&HcgLs1e)xZR6^+94=PQU_f7s^43WN>hQawG`rzQX
zy{BP$&b122TD$hc1&6Za%asfFyfKK_RC^rQ080bvCqh}OjIGh=4awVnBj_~up`Upv
z?}p}l`tu)PfrHR?bEmTI5`IE&St-V(<?r>E^0BH_27XHJ9-U;)WY`bKN%3mAd&!25
zx+KMUoe~(-fH&ts<q|7*2aT~PJ9Ciy5y4H~+d~1$96`(U+><l1=1W#wJK1&4RHe2K
zr$1gIog+=(PjhmJ5tw4@)4O5!f{j&~9h?uxB<bmr!4E8ib2GD{dB~Zs#azT`NJo;F
z*wEaRUuUOreF6B(I(ChLQuWtChU=L@+y`pK+2f*xGBq)=^qiS^CeGE$KV_*a{i&ab
z#k|;QSj6qE>RapLV}BOU&peimx{%H)$Asss$-@py-Mjw1Vq<X0o(~6`w@L0j16^z7
zf1$E+Fd3h?=xti6H(1`bhkE3>(Ly{so=S90G=^N`@k0KwoomToR948Y21*T58$;cD
z4P;<}T0Jr|GS*jdf;TZm0R9uau9}NabSM$ac47Z4&$xA3*l%TGC+(?&oIE)aDymSh
zeR>vA%SUNb-_$Xp^)&F(!T(mpEq0Nwh44`aiCS>`na8&OZYD5^hZ;&a#P72C%PrhP
zV80U7%1>3rccUTatx_@V`Ysfk?hu%T%o8R#JfGaKo<7a|*k4dClpbA2QjAh-i4cFg
zTb{=Hm(G<ROI)mEE%9ByX6?znJKe~t@nW-8&p_C>Q?1sJHO>EQ79**FGlMDk58zQj
zXLx<3$c>(KQ*l+q!O@`OkaI$K#WD|>yZ@@n_Ec6Do8&%m6)d!;`WF;QIo%^z0iX`S
z4;X~<RM3ErFtXPE9W<94JGP>!74)1G-KLm>su9Et&1F0V>MFB*BMBcWI6C=(1LoAT
zkKR>{)2MZ{N(A;EO&)M({9A2+Zuc~q8s>0pemGzrwOr!(5fi<|x|23<TNuQ?K<}T7
z-HNhhHPznk9g(3a559_rI4B%TU%Xz@Oj+9Qw}<X0@>tTddc)aNB&qsqeHRNEr&L+y
z5z&L(Us4*OCP@ZDE?&(JfN$Hjr(OWfs!=UA1C@RSxku++`H!C}HHOkr&scFprOV$L
z@qV#IIeI&LvtYX!lX@54e5**YEcMPWXw=%&oep>}Z{XawNGv$WhM~9CI(pMJ+hslf
zer2m}gA~f0bgHz>uykoSXJdpD(@TRJfU`eeEvBXmBXfljXWI&N{)8NBeArZ4mkag$
zZSx#vv2h2ue_e8MfbpxMqqj!Z(K-JZxPb#nh&zcGU3wxzW~>Emx~%Yp!eQDK0XF2L
z!w1RztF=$-*kY3={sXY@Tuu40O*bF*vqqcwj5w`uj#gvO(-q8wJlwan{Wbl`i39#-
z=k}FY{8n;nuI>KGj5p0MGWuJ^*bd%ptzQrFO6koklfBx_Bdbb!FGYFA?_sL3sxLl<
zL;glvyq@@dxaJ}AJPC>1<wem*K_0!9<K=BBq_{aWslZ!x!*hXB$!LG$7g$>-a%Oc_
z@H_Ax)Q*%k+j%RH?!65Az15g2!JQKf0!ne(c=c2lvGBj>O6YI~r+w_uLyQF+<#Vf*
zi`PU=tz4sS;Det~bGx?}AFH&_PwlUAJSAy|4G*Yav#iM&K?mS9gn#MvL1nZX(k04-
z%ll_)mHC2wgbD-eWJ9fzwRhxlL(3{Y`q>=PdRn+A%2vX~;lhlL+|S?eqfbe7TWt6@
zzW!F?ItzO}ohXR9Yrl3Oxn37p*yg6F1e*;0Uuka@6jv8@Yj=VN3nX~s7Cg9nkVb<$
z1b24`9^BpC-Q9vWH15*4yF20i`<&bFoT^jx-|pHMy?57MbFQ(*e1^I49wxI47;Iu@
z<UJyxix($b_V`i&;R7a=EmPf1mG-A|jr<I_C+Z>6<6~2!j0M!cCzGaE$%O9;5ns8F
zoXUd`&i&WiMZtCg3vwx&-+K@4O=gMG1BXaI9ft5M{r2+8NQ#5lt&jUxqK_qlU*@Z7
zXzJQ^!bn5ZCNW2>uCu^HX$gaSiHp_NsPdtZlf1)^EZuIq5xegsE1<+7w5U=NEy|m!
zKjhOS&D|@?t%9*RNbAbG!QCH*{n#~WxLVp%*8lApmG02lCX!*xqs;T<!abi<)fh6y
zD3DuP;$m$=L0{yQ0{2Bot}7xq*phiQRDzDxR&_ax=bcMAc&n?O5X>VUSoRg#!MCNv
z?1hzBpiC0BJ;}mBN7=A}yy2<zQlU`4z-r2eY(CkLU$f+Z^J(+i$%=-wK6haHGVwc(
zUDOtYsnaR>yAVeuos_A-{7ywlc>e87=l;Bl!}@gj_-zPZKuu`bYw6_<mR=jlsYmD}
zY#`)#X7sT@fOcCc?Nu@p4Q5~yKv!K6$eE_VZjhoG0Vq>}PiVmGznP~741R$7=~4Y`
zf;OMkwS<_(auhzzl&-qJB#7+NSMQJnmI2lj`+8SexGPzD#$KbGe)CkCIA<%9VzpWg
z*cA$!B61)*bQ!=k9_3f9qVhN5lhrsOdaB#<S1>a}TwKvX>LC;9bIPoj+*~s1l9bsK
z7IhNr<$CUQE5j9lA7okcOuz8BK`6c$%xx1)PT30s!}xXL{V4cv^qg1?R%vSyljdH~
zrboT-$r!v$le5|hb;V>WtN#FRl`tn#;aye5{K6zhHvfC<Y{e?+=^U)dKB_8)*_8Cd
ztx>_YXSEdRPjV3-Z4?ylqt)xdoN7E{Zc>zcb~Vj!2niR-lg64Zq-w6s^C`|K1tXu~
z?YKC)Voc(*+v`V%ycP&k&7dCVIWS_`8IOHJEV&wlDxvjj%;biRv%HR$p1~y3Ihm)a
zT?DUJ;<Sc1ZhX<vH=2cgozDEWmZ+x>_kw=(3Kb3b$gusi|9A;mX@VXb(4Cpj0_t#0
z`Hg=sO6|oh*|l=xRj|UGs53hmDV?))l}XLs9669vDP-%9q2vIm;Pp+d+0r5e)KXWc
z7R83x=JJ>xE0D{lxu7b9*dD(!c>^446aQjDJ_+`!si8Z!&DiMQ05L1ivdw<ExP~F{
zyM2VE=jP<*3|o|TKB0xaWWv$(;4S-`pHt8Fqr`SzvQpZJxUO{E*R~vajh$Rg)M59(
zu?$?~c*o{fS&-X&>EI@6^Y<;bXg`o1@E^6Bk@)&j{6Dyf|NFx4%~nF;CY1dkPutwc
zKWHiHAHqiRX>sl%_B##iT2eyQT0ny3dgAa@p#Ue!R5`QqRD7lcL2dhtM29%-b7TYF
znKUb0JVIGgBA@DZL7>a?<$Vc9Wu<qec**+JTH4LELLLL9YxRt+AyanuyeyD`!95-n
zg})wZ@cnl=YPS%&g1Eiw=lc1Ov8PvF|I^d!LsgK5qN@H<QxovA+;Te89*N<K?<7Q&
zk-WHM&vf4IdMk6Dv0z@GTMKWE>91>I(ainx?fZnGWn@Y5In;fI87EwQrw{Oqp;ll+
z%lE6LM-p`Iqz3b4wga*5NAjwc@qW0vbb7A3*<=RW`F)7;#X%-~Ncek*>o2jE-H7D2
zTN~X<2iBHk0D!t<-n!pM%WX<z3(J2L$cpgjmc#ptUK>M_og=m(IPe%0h`yYKT*aJG
zS0fhhIA~p>4a9sVzgbl`4ZNL)B0UVT@(dbvafQsUs)?gU*T_8aOe5`!tL&Juy+vnI
za5pBGrWg~w)cz%X9<}#2Nt8U#5%5U03(XdIK`4GncgY+Q{+F(R{6xCZJ~LSry%!@g
z)2@CbI%G8^_02OSM{L#=i7OX<1LfNZzBT~^Gfz~+bf~PXcOq_;NsDr+e+`DtLy6JZ
zso*MS^PY-mRu1mA6FV4gF>~IAQ>Rh^e*+clW;1jd8~=|XL-4+;SP`g92L%Sw(R*51
z8?%_?5r5y4(x)6gPS--`AJFZWBF0><2~wFM^yI0gF^k6|nc^J?NCfBjZSwWCamzlq
z6T?Uy40}#@96P6pT}BM~o8KM{cwC<dXMODY_x~k4Fu$*hV2%0guT542-zT+c31|+u
zP%IJiypU8laiLrs<^IVY5ns9rPApzuTZ3YGevw6`(<h<eabE0@=UZOwR4kHf<x22l
zTLJID%}q8kdvlK1*fl|7Eu-QG2uK)RpJs8dt@xaY^5JKy<hp*#NC|(pZpIqWUINLJ
zwJ(&4xtqo#zV`1aBxHq*kB9uRd%+rYz0wp%NzPL_(}4RTGJr?}b8sd*aX;7_dsBD*
zo2$PiMz@u!l{1QYPzt6Rp$N#T;d=jP#g{!#n4F$Kt!^rZG!kai=;rDw0o<EJu>{`(
z6;fNeT;&&3qy$7Hoe5$hNrtypHzdBlmih(rSNB1osj<&0{_`=J*m`=8Y$<&z1N|Z!
z)m@#QRXeTbeF1F_p7A<r#l67(Md%)osVyruK<ln=6KzXAq_Aw><4*%WWvEIB64{dU
zBI_v^;te+nA4_D|wqlNTdNn%RZF^!{T+WGjP)~o&>NLb(b?)u#o~XYjL{fK%W$e;t
z%*!OeE(4D;<mb;fORf04>^UkNo^t5$VydasI<JayZ(GcPBh{}!k)5e*H`JcuW-QbO
z$wP27%UL+%vYeve0kDG<QVWkwWa!xM-2fHPZ`QLC_bqI^5vikNZ2=i)9aftz+$Ae!
zfQ-FuG;O!rH3XQVtDNPp5z2jj8^|?=c1R#m4rJGBB~2{<2SA1GGSX(}dq#iRIO)8s
zUsTsPGQ%zv(b!%PemhXrouIhNzu_3Jc1{ii(+Al3V|SwMj#bPVW4aM{gZrFsidMx1
z668F=LokEPrve#|z14ufW;4!9B0?3zV+Trc?wOcQg>uVlk&$sk&(=H6$EpRLJXnDS
zCA<qud|~f|GeyBQW;QZUP|Rq41IDVb7A$vQhk>8G^G<59G4K^^gXm-1&f@8Q?rzU3
zY$m`OEBZP+#aP!H8o@R4cWWtr_?G(<ESbQ8?}Hk9;}$zM;@>Z0rHXK5VIu2*soRXG
zh7PH8g?luk+_~T;`Ew0V){!h4_LSpXnVeKpV1aC9c69;Kp&jMEv;<0Tx2A1;62FI9
zjDx_jReI)k9|605ZFYYD?ZvSpW5xl7p$jLVin6ZXmlSKrUTV9+Cx`DqsynDXNK2n4
z*P}6Qu#2}pC#Pw+)|pVc#qIF>UmmIF%yP~+5G_r<1S+wD2(EDhTq;Sa8htu&#ooKk
z{_x?Gy9V2)p1>^j<l!&j4?i<d@_se`xK3b$D~Ex8OIA@k15H+uLxH7lg{6~~JzWVe
z+r{zW1Oj9^Vl~ly37<Sd<Oy!J4=SBy(@Z_bvwAB2QS{jzT9&RZVhvFeHy+;>yXuKH
zqYft~8Jif8E1smbJgmC#xkd#{$MBjMbXhV94R0K*9_$>rhwz91{(z0V%o0t~a;y$U
z3uz+F`yX}`3k=5_e_$Obn4fP|&v4weC0{c8KgjxQMkbO(zQUNau)jvAy|Us*ar#;?
zULNVjy;**R6iqrpZ~=$ow^uRGM$b8IIm@D>IV&g3mdrj3&w%;2seM(MXM8;svdiC9
z#P0V(W5b+9$l6W|Lkz253;`j-Ls?;<U1kt<M=ndT(GbxD{Rm--I~je9$$ZhT$;m^;
z5t?FaPp0HCMMPYQNfd$uRz-2t?NIcK3-2*~5D`^sbLfnv)htb-QHL%X+EhrJ<NWh)
z;htu*+>+H}FZXLEeJn~j;Q<kM{(n1sZ|D|Bf>{waE6wX>=9)n%nlgSo=(kxnlaj2n
zb*|Y8^4k9ne}@f&bHo~rx@tJi+`PI6Vn3XNX-UM9thWCHVBOPqQq`jf?n48zF^pP9
zdK8s^ho(L_@3|#N#&;j^a-QbmxOicjrR;1z<y4N~=Jf2KXE^T(3i{^6jvXBbq=<uk
zLRA~#4jKuCd27tNDdA|XPF^*BT}u$Z)vvAcZ&Nl(Y@5aseTnHw24~fea`JhFOyPU0
znuZO(QM-00&nK<Qm;4~0P1={<jCvCkma%Vg>mEAe{sz*T2If?Cl1{&!<V;vLgb|!g
zGe!q6od&_Q6h>e3ZS8-h&9tD#4xqR6C`F4@*!{LZJK<=Eq*PO%<#P>YYB3mcmK7g7
zZ-P~DC<;dGV4@z*FIFsVzs}o@<><-V*eqN%aCRYvhBTZXT6=mdLEt?j<}-0z=@@an
z6?C)ao(~dY=I6AA&nd^h4t{xM>K_|Na$7OZ4$ZdR9D!eKfB>Qz>WoI)$(95(*;C*E
zSphm;R&og-TSp>VZ_+<JeQUF+tI_G***Z?nl1494;lRHe)deo*K&0;qQZpLxjXlW%
zN)De3X(=59={&N^B`0?g(`MH?dn|Mk14GI@#&px#KSTK!?qJrB^w50|3}TFm_Q-5_
zyNx;f26rW;O~!$w2%<yjt|@Y$jRGQ~*Qb?pKp+wR-dIrUr*F_V1lYi3NPl{x3c%Hn
z%;jxV*7AFU&V`fRo8#)5?2+oCHJ1>_e5=TE7?0v-n~*7b$*h&D9$X>rNHocHZt9ag
zn;7d1chq|YOISX@;Fj>gKl*M74_BgqcW3=&5~3%}=OLZ);i*cw2)6MxOu>rOxb>1*
z_qx|gLKaDp_u2xntOYxDd7)uy^&PdoNr7_fFzS}nj%2Ym0!p&oV+HF^f}x5wXlWq|
zf(VlBeYYwpS@k}6mH{?Sf$R;#WeAL7W&i64$!csfwh6bx1eGM+80hQ}!<#ucxa%{)
zsrK{9AFHk{htMN?ERDkYGJIJ?R_j6WXS)*96hac|g3!1x>eNj|vyLFm5WM=W;CR~m
zF99Kzkk_B9SsjTD>*M=tsgWNWnSXh^Z}XS${XV6qRg+f=bl;*Bp!9$-E*=JenuT@@
zm;7B{xK`IEb4x}oZHCZd2gi}*j2bqik|CWik6NO#Dbq!u1DgY%dQav`W+!-P0>YGC
zD)gWiiFs3NFqZ34Qp}vb2!G=K?u25NUh<JO4aN53rcB3tQKXuis_AwtdMwsyhW*bo
zrad-U#xFzEc|Z^y&l)&ZIK)rJ?wEst)ZF4cvX97gKNEf;C_6M|dCkgQ>>OwP-}>5+
zc_cM~ZC!*w5A9f;6<4r$)^T}lsL#1QhI!yzObQvi)9PFEwX_>6o<i#abFmGbX@DtU
z7mm8l@v64mjX3!Z(d5ry_UqL(<`?uB#hQcmWyUJz4YsnLDQxa1xnCc>qMY9++<dY-
zxjPW5hN&X^H9AEAKT+TeA-}kak4v5+O2?dp1N5I>zXjpKwglRiCNOvT|75CvjcJVC
zW>0|f0D__}kjZ{e&fkk^7Us}IsG&uD7cJ{<%g`BeEg8hQR#?#L4xTq6SYB1&AB-Z7
zd-h$h%Xcl`IC@A`v<vyR7A6zQ*v)-|*s*Re-B8z=u-VCC?GO-U2kL_wg7`gSqn%p0
z9=lVLX&cj^nvkqYO!sNnq$FWMj$0=hbz!sNW(s5DxIJa`MYs{u;A<Af-8&!suXAc>
z>f)>}8~!d85Y1FkAOn^ZS{kE~L!{-CJZkc*9q?PiVqM#kuP(fbCS-9xz+7?)1^mWc
z#^4qtF|4%z$A;jyb!;k2HYeK5@Ycz9!c)!q;labsoQiNt?+hI!Cr%848sC7)4*qqg
zu~WGel(UcPJx*i!GIjfjy8E^>^F3|}PY`6TsiQ_Ka+@EBojCKMe91DK9o$%tdtq&%
zq?iJ()xFytOfc7zastgwvbgWO>f(@`NWugEne^Qcj;S<kh-X!%b!Vj6I9mg$xDHd9
ztgBhVNel5A{O8mU+{C;K@+*;nHCK8%av%2)j8IAGl{Ynd>OOMB{V_m^9v+x&JhZ`y
zKBogX4;KMxr($&z9r?7K1HD6XG)S|t2jn|aRxY-J_gdA->Y%Y<hoHq-Yg=GBQv<3c
zsz<+fl)&}ezP9>mc1bzWfU7Nv(#|&#-7n+iI4fMy@;odVB$t$Fz~Rs`uA{awX;U6!
zU*FJzL#9jSEx7@Pic$e5f@+UuNLY12M{bC+f&WLL%g2nF=7yB9Rqtq$eY4073tf*<
z;INcnMHr``U}?n8`y$tlI0YTSPfw@)>{G&?lAQd$@h~jMwC9)`WN=KSSO$R+uJfaX
z%YIHox0I@$+1U1?5XKS9xP7;|MVogz`7dOTNg+<^&U!oz$VYHWBl#8r%1Fs3pN4$K
zH&=X9j046qD1Uq`d4}1yG%!8gnztba-jeL$<bx{skx#mq4;o}w2?3!uzsdRTZoR7x
zmy<e|jUoQcA-^rUSVzCxVNXVnbBu8<uEwFWc8ud6+=kwA9A&xP!E^~7S;hQE*|c5-
z3s`ds^>vYEFyB?KVDGlv9Ke=>zhXgiVqr||oowDOH*sR)_B~w-J%kS;cV0b=9?gus
z?yzx(^Q64$h7p?%l~Od5pY&A1e}{vY-#MzQZ?&r`{}P+%epWQ#%Z`3aaYl-c2x>GQ
zYg|!OQADdBXj{+WjmvbYgHV#vO8LyWU4gzXaXB*+#0ApfP?b#yH9fzgtMjraB^}b%
zSb_>KE~pi0g}YT6PxxhOU_boq7j2~z{a9I@c<76+RKNtQ=YIhA2GV^_u|j@?pCH<g
zUFu}9^es)tbkY34wT-=8j;vd^8pOpqxKRtMpMI!wuSv>g=^q<w6rTUZZfmm8=>=ZB
zSxeq8Z&IXCF^a?StHNQ`L%n8+2)XgImB>4DoUcYXn}BeG^0??E$M2KN&Ew9K<5GAl
zA@A`^IKeKF#89w*Fop>Hq0N$5YB*xn1nO6;AF{^wSXJuL1aOc+1Gw-=XHLn<-?O$T
z&^Q0O`n$WSA%*h#h7_)7Kj!Mcbu&>#M&5<}J%++d4^<Ekla4lN3IcPUC$Ble=($Z<
zB8NZHa{)h{a2WXOOGO#M`6aI3Ixl)Rk2Q=kGVsP9Hl(sby8N#e#L=9kmsh>3312HY
zE0aRL-9d~Wl)MjLGAimiTkGcR%ry|N-;moLrE(wlwGvpF5<s+0iYh-TDN0Eu?FZag
zcoW@8Xq5|28rR&S3D82Rm8cRxqXHAWC6?}d)!>kIE~3s{SEO`~T>2vpt-U#pNXXWZ
z_c%qZ<jCtn@@<Bd)6qQ`qgXP7l_QT|UdG_3^j$W?@=lyUW4k46F%$hux|v?(%?}%?
z0-rM_aWnwG(UO#OcO=)CU6SU;?Flz(|I2RGapbDxZU;~Zzx4J_CL!FZ)@G=<XT7<6
z(07=ZTV&rSSzGk&EUJlh#%cB2fb<QK!+pYxt8^tl)8@=hrFGnt7F5jL5>orXm@!<B
z)!{nOvtK75aIJdEO|noSxAmlYRr^;}n<oBhh^yejeQw<)ZFz;1B$WJKt51}YcSKjE
z<DisyR~(^4eevt3yePt)<RaZu?wl#Rj|DMwruMFQ<L?W_tL;tJ7V0CiO|2T}4+#N-
zYhKwWW9f!ZWxMsvKn}bO--z$^|01*Vgu3yl2Tt{b&H4Gi*8K;-T|kyaepD5{mHr1a
zU(ZrBq^g9wq7X0zK(?Gm6y=_m^f<dWttj2qx%gBmLugo^bck%&gg;eU%<~2{TJ~eq
zZ1G@FmCybl-lRBmc)igS%s;2fXj-4=jakRQ(lCtpTWL=ovvHwml-cvc28G9Q=%%`7
zOu~qn+1~Z5RBLM#kO#a&Wz1;}&*8FMNZ^%O#^01<!@~PY%g?`J5oKL*O8LeL7_ea<
zq7!I5K3)>m&sFQuqrvO#3In+l9-x{K=(z5o46p3>%2Y6^%Z5=eY<7LC@yUw)gaAjd
z3AlgJ;4km1JSCH`MXhqm%DKAg>OG(=cyk*W@#8pzXeoJ4_#gh_b-lmR?yCx9kYx5*
zqANSm;49vRLfg%aA!98~(TE%ToC~h47gdwjA{Zq0lt;bcZ`QJnepe@t8ogUxY(r)Q
zNmC!M;i95K_?_`jd>Br>?2R~>xOhaG9$<tHrHfb(kvk;A8=P*cXx6afiBM)>&#7R1
zmc&hD?u5qp9c02<ZT{Sj(ZxG;E{}@JQL5knS3vt3C2w`N9bL)U#C8@InQ0~xk&lq;
zJ;sN=zXFu_Kz`$G1HOg5t%mOChG_xY{zC{Y<qiX36B~h10;@IY7h}J#Z}>SQ&BKqn
zG5$L{8<&dCjkScot(lSv*;>0w5vyl1G%t5E$P-ESo!fyi0?&(4DG#X~)nIfA+@II}
zh$yES8&4_9>H<8Ex^Nv>@pluZX?lYEww3Z-cpVWVOxexjN>ccSA;@`Xb2MA1I{dSL
z-OYnXVJS6QZL>8@Vb_BmNouRAPI}9_I`sTN#~MUS`gjW<iJg)AznXW<f}Ss)AM7vf
z%j8-cQP&dk^(FN02|!eyXXw;rx)MxB77gO1SUkg+la=-H`SXcg_`;B1Zo+(q)fAX+
z_|m4aE+71LN##ubS*87HQj>GJ0CShMq<i5QL+HsI!pszFDoXU<2Yel~W>;1-=QO2n
zB<7<6o@W#3VkD#f&1p9&d|r}Q9O)8p1*ry6vr})!t7V^5G*XVMRa>$&WcDJ5^1!!^
z@(u$Ibui<jS}3jecjBydFO&3?h`z?_Vt<Nrq6=W3s$x8QhLjC+9m*`k0d*x6rAV_G
zlw?LpSF=SZCk(z$T6+r)2G%UJ%pW}a!b%_!#IU5uV)D!%K`Frv$8{s#r_737u)0$^
z2+$$|*d1RiE=hJaW@H=nO_{)UIP78OCfb%#6tkWf)dZK9Ly@UFYnpWw4kx}*{JqqC
z$WEN6(Z4zEY>Xt>NxOt0zjBvwOczRmir12`yU+duc=KbXaFc4!cIHa$2rc-zx|8$M
z*TD&Ym^#!7YHU2AwnOOh@@XevVaFP}f?-S@G$6{COL6sG!QBeJG6tW(Qpc@WhYvH(
zRnd-)1NNxcBYlLXu><3adl^hnFWpe36jb-UNJ`UpDolD`0vC+Q6q6L$wSr<0Eo#vC
zFPEo9#tENQhUAD<;BdA7xCk7C(MQNzg?+xGdcwvS%~-(fwT%=~VH75U;@KH{{^_~d
zhh`S9b?#gYgY>X%Cq7n=B=ZfybaTU+F#iwV1X(I7b{TD?{cuaQi;vK-QNt+CI@Egb
z-@)|AHE`{9HAlAmb)-E)YVhy3v^=yem+0U1(a*L^_(i#}!k)H^C_c2QI2oQYz_1cL
zg1jYEiS$0z<&ImZ+iof$g2uX4r+3wkl)Kw)PbAy<>QQZLD9Zp48~(HHq-elC|1P9f
zn)kqCoux6S=k8e41|;D!LVSg>(O6sg&JNCUG6m<^xqsL9LyguA&LE!gQFpgP>IbT7
zi0y+qAp!E;SsHL^iJr>`O|!c?sNqxzoUaPxJHAD=si~MO*|Lr9GnRIY#ch_@2O<>u
zXkUH$b~Y)6u&!%{>tHk!Q$M#ypZjrcG;zn_w=g2$XCGd*$>Kh;1Ypcn0d=QCx1Eye
zBb(n#xi2hP>~2P(LTz420$Jj#lGy)n<$R?Mp<4>kOpv&7h1cM9U4Dw170mhvRfZd}
zrB9U<(#Z~8?69J5r!Wbe{3P#a7rEng5sIET_TYqIfkFGH=g4^ibU+`8ZvS)ETrCN#
zLa^mW!Bv~D`v5y)LMVE$4vTN=k9rK<ZaJ(rSr4Styg+E4mtzZ58<xtyeNnbsWwwUL
zi8m%#&bD0&yHb7<jcf{dQbdO&<Xi|^Yiil?Fky>^x)MO)+VA&ZE8chm1_M9DI$(dO
z-#4q5P(?p*aq@?SZE-93nt>bp<=0!RidGyHhc`kQ^I3tx4P#bQ^M!lc0=F^v?yxq#
zVImQZ%Grv@$+?Z8eA|aXK15JOGJJdeM-W25lrpc66_$>h+q(potY9N)=TQ99qWnc+
zxh!&XhbQiLM5O?N5enbr+$^UuaZ&yZ6E<9d#G3?d&*gO)nY4_pX{bEzyykOoyJxBH
zDuirqLnl(%ErCoy5QCR+?AK7bj)2ytz^(eKRci|CqucFQxx)}xpi@(7ZNHgju_>>*
z$*9T!{nI<!M?d*m0nvIvr<aP{W!YDVCzb;r6_ZVkeUU|V0h@H?paz-kZG|2Qm&KmC
zlwL$#A5N{Xg-LoO{?F0qVz}Uuap!zj4_83kNgR^EpX0{bsmGd@n%aW|l1mDdn+<_j
zReZ8%En4rnCw-mcjJ&x7Z#s{eH+i7qu0iTtGP%8>vop^J{15dkai3jFXw&bqC5D0r
z(ppSt%Y<C>IKBBh|CjTEY8*63W#`x`BW6iY*>o0Ni@}Wn$Lhn(y~0jp<bKS%-vW-@
z-%{P4IggTn3tTrb8}<Q|=S+H2S$dy4@?v%wzbLGcl(e5({?Nc`O#F*)e!AFN+CDSO
zGhR;qtxKj~{4ZwCnleswRY_UBr>6sVU60PlepN>4cX^xv2Y;t2FIbEj>S*Y5#c7+$
zvdx|dV3X%|qnRpI@{$Ua$EM45puirGqXVZ8!A(+U0I~3wP472|*u;a)Z!0mTW9v&X
z3=xW~*vL$5heVWno03A|!iZmpmo&)^n$P`)j&4QVJruFu=z@xma^01Zev5E~<O;ZD
z#D-s^V*hDbBT*|=Q^PUAII|DW-gc18R(241@kFvLY*>o8Ar|sHBRK}pha!k>?#cuy
zYFoi6EKqAs0R=Q2r(<P0)#nnvv)Br#-`KaVbNUEPJH~MtBtOIKy!QhC7Mzs<{aTf-
zr21iDuVz^)!j>4j+tQA8yrZ;>-HjbwtsmuZbqzz)%0S;d36ecTdEq!+88HJ3Bm<ys
z#_@cy6@O-1G}AzrXtDA`x(z{7Ry|zDcSSrEvUFm|$Jz+raHBU~vU02mF{d7C0mXaW
zS~Yv=DhU4gLb;dvuNu$7gyLpmPjm#pz(M_YQ%)^Plk7>ma7Zj-oCZt;5b0&^tu}+O
z5d3|VV0Gl})v>mqi0d**$TO#X<t#;vwzRf{wRXj%fQrFgdcH#&WyW$-tQ762$SfP~
z_`FfJr);Hwcr(C~>tl__ZK+G9Nn1DKPc)^#%lH-qI{rZuvoOA)NAWlvlBPA@hG|7m
zEvAAY(t~f)!taZ(i?Ihj{@1Sv@{A&ojhXgbgmiZ*XJ}WvWPLvE9~MT>1$>Iq=z4vX
zc&U{-w#PbI!R0KyA=NR>sE?qvk1d=HOtwrM`;=!(;n(y30lFz|8QmV0<SFn}e+`Ka
zTUDMGdU`V+lCdt61jd&K-^>pqUvM3cIGGU;g7xh;cs=Y@sT4WFfyT^(-$+arhr0#b
zxKdtJnVPK7{<sQXYPl`3SURO*U0vsccL=^#4^Fu{+=87hoGi*qf6vu*?%DY$Tv9Ka
z+BouHrtNQ4m@!?I-bK^+=wEh34iH8`=pKK1%?eO7W3+R4F?!i{Fw&#2@j3s_=}p#B
zHA8EH>vB4t5W^y206UR%rG(U0uN}99f@VVDjh`Da?7Xs`m#CEXlhtstp<4hp5T`xh
zmb19v#JX@@V28@wbX$wS$@u<jCtVLV9&gZ>djXIJpWTKC&}P%Lx!BEUO)lK7xqgJ*
zo;U-x65YOUYD+c!E66$C4MbU>RB#*=V2BYHwB}b{gs~#~8|k^(6vKOH?{G2+KA4E(
z5%FEsW@JT=JTAtEL|B^O;CRLtx?@gp3?^gMcP9}zt8450^<8}si;M2B?WG-n?CRMC
zxLU(Zb|a41I+nO^<iFHMJfM#PlLOZ^W>bwFDf!mt)^NpXWCWVtBRu^vwl}rK$HWnx
zjnnyftdpu-#?5k$z^p{_BS9g86M7;!W5d6vZN!@`(2##C*P{xtlxcO3@7TxeCjcm;
zL!?DZG}I>v;ECC_nOe%XIOEMiQ|e@Yv6rPS-FDqVmG!%OURdR6F()xk(b09|WU=HM
z**5OOP*RCIG?<oW?PJH-cu~Q>n`fW7hKcry&jZ9=bZD$qj(PnBQ2=@uCGB!m4fNGY
z<P_9XY1J|hv@-Tbe<-H->yopkU`3tv1h1av2drzftvG4mv384I+TV#HQfeD10b22d
zXWv+KSO^Ov?pVr8aXk~!A@RjqZ0_+@MaF<q!oN$3rZfi<8s)Y=k}DGL!(<m+2k}A%
z+$Qz#G)BAdP<l_3=ux8B;pU=1%SK0I1_^Rt5ec>>h^qu8>wxQ=yWU+;O3^x*Yi8Y_
zXF1vyqBwCH7P8I6nYueRLe~f8H}^R{XM4F-1no7)Q@3IabTEpNw2jbvUF!8V7~)o!
zP?qlvBC0=;sHu9@1k+755@}&_DM;<`s@)?NsN=c)2%KhS+_LT2*1$6v(INSjn4^6$
zAw#SK>W&Xys1WB}27fje`dz^S@ZNZ#%QwAv(sYcfyM?RG{<SIbl{;#&OMg<q$av|M
z)0@4D&eLjr4K4g*j9I5rV;GhYUIGbI&W>bOPp}hxp6u$wa;rdVum;hx6;LMcs%0z7
zM0rl;77C%XLG=*f{X3Fvanjm%R$ZvB@^xY(%1+i{_ok{oVtFO%ONbiJqksQzY@C?0
zdNB@~qtblhi);>`pVyyih=m?pF>#7+==PM^MBf-B2c#C%_bQj=>Ko!f_?2#zyBrsn
zX!7IcUGzs8*WbX)`v=9=E8(Sqyn9{E5p-X_Ut>G?u*%iII_dA$(Yn|e4q-?KmPlud
zT@wRPo-p7?)1QDRvqqM?wMxWS2LjMvSDPSEi&lkRa5EDg6hQl0f=c;Ew_m<Bv!-TO
zWu`hog&2A<GKd#BkmZFbvsZgj*p}5qd?Y@zDJ-Mhdfuc*&#wuK=Tby1v%A0wWIyq<
zic;lRW9`?{2l0NeJ*_RzsKaG#Ay!w<EQb`Yzy9E1{#pjUEip^fS^SU`o{q`VQM#ot
z+=S7dcid_DVg(}Grz(tkbMpLMfuwX!YH4iJ-0T`eiJka2=)m)>q9Y>k@lE_!>uYXm
zK^Ci_y@|<{{kqs(BiFPTb93fhxZjoGuW?@{urJ5xIlQwNhb^3<d+b|YJ?X*dey{c)
zz2xTbh30CF9>cMXW!v2F!@FudJjKpMP~Gg86-IJj0z00ML3blxj9+nb1x3r<@Y=dA
z;AmpY-zGS}ijliT2~3()WphjBpgym@Xwr5hP?86%eM9DV#F`?}ZLO&lJzE&A+PVG7
zoKk)8scRRE*^wLmLbxdyIqQ?c;QA1Z((cH*<K&p&%X1uYL>WyUP7&>)^p!rAj8`qX
z#CvaqGr9@x2LYT;a3t6;V&iKF{vuDDL&dkhaMP+s1v#n(5#RD*F-qUW{?FjXZv}rS
z{?{Ef>i+>Gx^wRO>-_#$2Rky_<rQ3;wg?OJos?A+2PdrI?z+-+wLEBYuctJ(rN%4_
z<=G$5(_;66vpyZVVm|#2eqDxzHUxlKN%k9I4l57Ed5!6BHE!te?WvXmD5!0txNbfg
z6Bl?&jnVoiC_g;6nH=#=Z$}>Yr6FAL(7Lv|R>9*>+6aAm&o}rRJ;ef8x`Rd;obi~P
zh9KyXmnl>(K}&><bub=AbF*;-eL@<xM+Lv_)vz}Y^sLp!kLDHK^w#SZ_`5}H!_=J=
zI-+ih_aU^zwYn%$A8FH<h!=J@{dbX>QF}vr8t|+ME6Fc^=_>1<$x(_?Q>LE0d<;bg
zxd?&wKzUxo#p+Px^j2c_Tco4plt3hC-SWGyRofcF3M2FE0a@`J54f7!hgJg`VCdo%
zuw{J0_qzh@!m|AmIQHl;h33fuJW?87vt6udo364??5<B-$!<k{X3csgF-k96<xo}t
zE~RvAexLLGL0WdLIt2O&1~b7MD3;NmMh^Oq7}n@W(K}#VSiE40j~ms7$~Vp3JztzJ
zGOVc&;O~j(vgF@AYcP}zc-uNc^{*Yvzz7Yj2Xx*1irw>Pdph1pA22bUreerEUwo|C
zer}ao5B6148I5l*DGjWEl6i`m7~2U=b7OJJ(L;hOd2ky+mUOS}JEY>hyXr#)P)lxS
z4%~RF&)=7Gutg3pG7d^xI_FA1S`>wdg5zWJPgPpxYtD(ac{c%v@Q0i(NjM6YXQr5j
zq@4!u;(|~$n+ku@c{4l%w;T!k36eyUe+%z%R{}W#*SX`Q{gn#^)0uLLX7MRopHEO2
zb*7(<8adI8F4Zk|GZB71eMP^q#8sE1A5#ncE{X1xXad$8poGq%L+l+>F-XdC+5;xh
zEx2*Jt5lCFZO%)&vqV2$ON)|WBeAF`^qSwR9-1A#ClK9mwo}WYxuKAJ*pk+Y3XwvS
zx1=m6RcHu#KM)mMU3(JUVaTC`jB7}l8l|Y;NZRMOw;FaB!~bT;Ak@z@!Fv6=9V<@o
zwbGHC-U)d*NK4Iyxq>*0&40YJ1rgdePn%c%Im_w$&aQKANTeI{q#*R-N)cPf@pILo
z^A(BKYJ)u!b$z=9ExzGCIF?m0+GulSk=*L~`_C>%A&gDp^5Dg$0wm93N?5ARKv-@#
zN3)>*Z16)4+d)*r$A2&wECMjP%MMV5LB?R9SYJ19Gw3^O)HN!^;t~^B+rDt;$wWv!
zr|O6;BHAx{JK>xcCkh{QWG&h#uSI}{5&riQj-xz=&mB$OL*UEOs_SCbQx4nL*9PVj
zU&M?#rfR#w1nbKDuQ2kERF|LC!$1?eNcPZbWEgUvI>Bmn&m6}Z7-8Yh0gW46JAc%R
zr*h+x;un7UoNYb<)Yz@cos#g25j+n+5V%~vw$G9vNG6y<p@GEwo+CqZ^Mn{WTNIVh
zrbKzeyGiD0)I`}Z$Dy_puaNH{bW)?HIPh4$zPV1!zs3xQvNz@U=@3}}Ts0LQLvqi+
znqV8fn&3gpk2jh$*^lTUxjkWWBDT<s)70{_B2E4GEk{qWN2+^hCxTJ9m}F@lPWB*F
zB9er;q-*rH`siEMlH@UISQD{Fw&FD7C_UlUL48a6-KUqUc^uuFuM^29$B*^n*HXfW
zPEmO=`c1b`?fxxh$qPC&f87sUDor!@=<@z8EpCc$l2^6!=h~+$kwjlHD^9FRtA0Aa
z<gVs3SFSSsy3$^qtk2Pdnqbz_gS+N9@k`Y*xRRmUG9+vxkjc971(ja7JsS-uGV?1F
zIgqvWi?+d(NcO@#I@9)pH7fp-*p|%SYs_5jgUa&A#u=@@cAS*~cC6b0$jrWiNRMOf
zMj}*j@rUw1`2fT~Mdp^G!&<n~gpx98Y424cAIR#}O(BPRpps-EIklvhQ*}0bqgO~-
zps7UQTGcHH&a<m9{V_*3l1#+0?YZsVB1_+>08hA}^d8bb$;Jw|q|aG+gBNhZXIUW$
zTI|z~3}HcX-5sIbf$Qt+Q4uG1=v2o>bWuh=>Zb$N*q@<*=rsr|jd<c;PQDvc@_~Q8
zL*42c-0pt>=B;0zFB<N77D~tJ{h(x$2l>4?v|t#r_yu#sS@WR7YO#YKvDK&f_)#0Z
zIOZd%ckcMCHn$md@K(nHGoe;~U&L4AJ_2IU>&R72Mg;xQu8nQ~bSO_76jqqZ%l>zX
zD&}O+VsSaH-iedEK*W!V4&xCD#ebf2(Ev_wiEebDM=#;K2&(g2>Pi8@__5~BofyT6
zBXPpVy8HX%Eh!1I*6vhngTK}1@+a4@4l`cLKLjAfFE7!$uR!`->DPvAIm@rhvS6B_
zA|+($6!tE{AbMZy2OZ_vjJCw1Q;|q*F0KbS=qT<dBu{vo_dqsHgQ1~e^*>NINXcV-
zti?6YLfr_}8gqu)vpd1Qg#yAG3q-{1YJn^ACHe4$p{C4IC?jH$ch?CC0P13VQXil+
zsqsM)T8@|&w`Z3`Z^vXPXkH)AS}?gk){FaMbX&;alRgh8szd@W$7zTZ5?MYztZUnW
zsU{CnUnFRR%T>aBBo|y`Dp&b8Sm8w@KEy36c#g2KgBNNOif07k#*qZF07zj1Q?+V{
zEuSCOaLH3Lg2y?~@sNOeYtADW->N4R70wa!otT+zG#m01Kd7{Tj(n{6G|Vq*YQj32
zQ+N_Lu+4;60w`~)H5n{-O4)e)UCBN>U+p9$<Y++td~`<*#IAG8RBCB~B`ByxBjQ<E
zq02U<uKi8Lz}%3Y6zZxhi#El^LP*Z;90}e{0*C<p$$(KBiQ?tsf4S;yzj|CdkW+b~
zpH7T6S?bGX0^m<TuS{mM<I}JwaX`i5xR{sCdD#*vjZaY{O_6uf;AZ2fqBfc=3Q7bo
z`99!^i33|TxNlk@_(`=`Hy<1n7n>Ph>D-42nYb0}HU;e96EM@J4mGAV5V3VWQ(6Ae
z8PA%hw~U1KK&QER2IQUuEfazy;T3Wfmv+}9(K%+wfalA*+D08WBJt)Q7S&>U%m@1*
zmZ50y&J>3GvI_2cYD2{NLA$Y6r@N(7ew)A)BS|(_HR!a2`6EqC>G@kRMbR%L0wL4`
zLQJy@!F;opFoV&H-L`Rt)4?@!NV40kC1Lj4^opWAXA>>;g;TXZQXIc|vRfYDJ0hT<
z(X`}zgDQP!(9@Ha($5Ua8i@cKB3XuLCKVTtx16XV+I^lJDQEosR_WG1DJV2dq&dn!
zxEpp0Gm)Gq$g@l6g46nCC6Z*J65%kJQytdG{XeyIu-pD;(<h}mYwPN5h%lQ4mki6V
z{yXdBrX%<LO8kr1wujn4%G&&wK;iC6tBC5W;Wy~CY7mrz;Q;T&g@wx6u~;rqY(IP4
zJUE24UD%z>OIi7ti=8KD*3#v9&9N7o6sAe{v}>mNq}8`EUn90AuZ1;`mW{AnLagNG
z=6@jly0t@6WD>+_+x5I`9r4;)Qf;5pW4bR2^uRZzg6A<36!ub(MW@xu0iCn>q^~!w
zHv|gLd7a*4^h>cj{xHt|E&>V{6GCvC0&Bpzt{ewLA!a`$1uzbFL`Vfic!r^^<#Vfe
zy1fmKTOSOs_~;K1c9tDm-}eR{?3L?Pys<*m{KG#)Hz;5@M>Gg6fGDo?SBD&W<nrEK
z5}*$uW29ymcJU&#;To}&5K6MyMQye9f9)xYLf2~JCXRp=IDu%(7M>GAJ>7#$i!IxG
zP%0k<!gt;i<c_0r7JfmF5VzI`bG1JDA<1|Do%)i6i|UIa+|&jTvOV1QVF_ML^Iz7Q
z6ASY#tw<YM6jz6Wyk0;5C3YOzJKOTzT|4BKzRXT%XVAD?GqV<FXIKA?KdVmM88?Re
zehE3NY(3Y{$Mqh@Y+1Rj3@I<t<(Kubnv;9lG2A9)B!tYn=&UpI?6pTBB*v>`ky4&Y
zF9vbx0edUucGfN}8&ntP+1tM%mFclTR?;=UH7A3X0q6Qwgt~kY;Z4>cE&*mdASs0+
z-@$w`c|adggoibu|9^lJ{Yu}d$_UAx9OY9h5)jFld_}++Q?kF`AVcrjMlCEaG50@!
z^7}neHk@*E%NK~9hwqh2LhomWzG^Gd_wu86*57)va+(;S@lOj+EoBtvhQQkUp94Qc
zCpN;ZJudRvBTSm($L)X^A4U5nT&%4f%Mns`G?`TE?GUNr@Ae^AMMTYn`Tqej3io9c
zs|*yj*LTf;;iA$SGmDGMX#>)m5wP?<vkWgUZ~q(nQI|`n4%<womf{ce9)BE%`Y~Sj
z_FgVEXHKzn4Y~(!Iaq`Gc@VWyZ3B*b{65`Gm@U}uS!b&;sVSo96R$0$mH!8TpD`x2
zu52W|AtNoX3Oo80ePOC{w%zv8H${=JK&pukch5c1zG7&8by#-xfwiMw)r1{e)|G#@
zFWHmH#dmbYqx-b7Tru_YKLiGMqmG1hmufD<oxXUt*z479Adv#DVZ>zXJ&(?KCS$q9
zp6h1v6M{mvbCDEU=+6)sL#!VMjQ_0S_fRl7{U5-8HZSZyfCgY{DO>JAe|X)<dP1%e
z=UR%;B;_;+1|&akiYEE|X%%r~vpbdaRqBL+t)?YVDz*F4fj{`~3(Zz(xv{wRVr$O5
zUh_k3xen9%#F?90C{-5rASSt%^Fs(af4BU1jz(Sq4HdiP8xjM0&TLC2J^9RGU93Mq
z@gS1)A)})QbRXY(2*P04%Af-#flv^VRZUC?@9OcMX&MKdpWfj~snX9QaCl5-Owqd*
zld~)5d<baI90rH)fru`+B4FAYv*$y3f%LxSAA3Se-4x#O39a>LRu__G8FaaURgQBx
zn6p`t4KEjYe>c`&8GS^5o!{y8KB_p`5@^EF71SL*kh;oRtnNl=KyM5L1yiz_3tLkz
zHn^#f;1e{Cvm$&2QKe(vSI0q)K6ImocBL#+ltj73KFpB17tX5eyO~jURv4^s?>CR+
z^3y>J`E1jvXNm<QlTk7v&Mb~P+;o5{pUetVjI4_Wa`{T3{enX(Ay+wP(q~PJ66B{r
z>rI}k@<|Z<9!qWwL(A-4+MN%z&AFI+L?|0P%J91hrpoDUH6i`?IW`LE@$7y18$1(r
zlFXH%hI!lvostYy<+6Z}6^FU$Q<JUV3aVqchM|nOpD-L9+hL2hithhBsB&J-H7)Gv
z_%h%~CAt}*I_aF)t}=alOZw@^qGB&R0aZW`RKvuLnywGgUCV#)QCp4?v*;rYrhX$;
zSx|(3sI;K8BYEC*;@e^o&S7XQNOgrr=v%g_`T|C%X-ntluMnpfMF#&4;7QxE&F+Jb
z(U;nlTXVD5Mt@i>`quVZW+Ds|!A~v9qO%n+QuR2o9d(lglRJ8%{BYWS4A{i^4`RN=
zo@=Y?CC%Do)wN#Uu!jG2z)S-#FRtVKcA1g7X;wcbIhRq`1kIf@XB=!y;vX2saEc(~
z4{sRIJ4MiM0cJ#DGeEBY4;sY(v0(k*Ws6jAR9@87rhv%T{X(S3-9tGgT{7aIbu8ZO
zU)V-Vd74s%7){DaF>>i8Pa9q$+dOK2xx)cX<;<^kCS048rwRfN_S-9U*jE`pJ^!0%
zsV(+jqE7heA<IQY8Zb4lZo4<-{k3kj4;~LSN=BE)7oX_u^aNWnAs>XL2U8{DtiI^<
zId!oQ04w)S@O?STSE4Zn2kZ(?royST`hF{_`cC5m_1B~qPn^6<Fbatk*jtCQ>gQZ!
z*GxPPyUhRY(tr3+-?nd{*l{))?-tXbRS^oL`Y|4KRP;&mu%YYA@QdkG!|?ZN0tA0z
znU@!pSRXlu5K*%@KRb<6@7D@=M?N`a^Q9+U1`9&z{{XLlX6~-@%1g~$9;FvtkvviQ
z$VHHrh`DOcJNaE7In7A##V}8$p>EVQ1nbT4m!v?&v$ZV0g9?71%74C_rb7L(FFs53
z{}LPIC*EM}I5Oe*3YEqVuX;ACF6*F%k$$NWXFdG0h4nwzYf^^jP*b<$m^J5}Noh{w
z2fO1w^nz9UDeMnFpVrGz@M9A-d<kPI|9B>kU`*(P58Et?qH<BMe_<VV>t`pWySH^W
zhk3CYzi24YnqBUhOoXW^1xC7v2n)H&_znDMYYDh$W+-l>WiMzmg%e2HB@388$PVeX
zkVbYyZ+-R4q}~L{%{j2_wC@%ibG<@OKlxyZ{F8THjXtmLeydx>OW`DAz~)|??TMv*
z<FBhr;E(28TcwU=dZ#f034UiCxc^6gba$@2LEZL%ucVnZ@-gP>w;O4Qb?*+2>J7F%
zSt|gkc-oRYz6IAl-GD{YRVO~ph8gyTsnGmn7U!Ba=Be}sl|X0`kzW`P;7;|<yL+0;
z=)Q{*SN+<J*(LA2+ZEPTyK!??@l>Xnr~Lk9H;E2I2(|6*Pz};#bwXf_+$!+zYhhss
zt**dk0<7IXyDRu^$7zuuK2D3Jbl9_CTM}F<1N}baQvm^AVb=$pNU@~X=IOZU$oPjO
zz`4@i>$Z~k>R)c_01yBG01<#sm55jr*Ez^<2XNoK5ZZ`D?pu^Rcr1K%DTB0nkE+Fg
zNcGB_+DCE-z=58}G%sswt}ctOYwHZb`^^ysPmN607Gw?X0B9c65dG~w!oIbglmGh%
M_y42q{BPy|10gqObpQYW

literal 0
HcmV?d00001

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-gaussian0.040000-0.000000.jpg b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-gaussian0.040000-0.000000.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..cde52f1122656974259b90793a511aa67c278c4b
GIT binary patch
literal 48609
zcmbrlcT`i)w>OMk(XU8}bWl2>Nr%wBqJRVwB!K{-NpI47_p21?LMRfN5Fmt5q(f**
zm0m+H(joNT;o*0mb?>_CS@*v0bKiH)A7{_mXU(27XYIW|^O>2e(W^gXPr%Bm%49cg
z+#q{%eUV*Fki8<ifA{XayLay2yLa!wgZt!<X#RTi@ZlqRDryQEW(HOkW(FpvXB>ju
z&)E3cnV5JadHG)mi;0P`a!boeiO33yii!NIksA*lJb3i*5#3*Z(TO}~dM@%mE>}Ov
zDDU5vyqS6H1{>K;${V*RZ(KE#F_Dqoymj5%8)W}cZr!+f`_A2a_ph~TPsnaw*KXat
zb@%q|+jnl>xkGm2<}J$GRL_O)ywtc$&1UTMk4Q`gjUuf0SN}bBQ4@gk>^8@%PbE*`
zv6+pWV&W2}E_0f$pHTzXjnV(h%ysz>LuCJI?Dm~&6+7j>DQ?~P-<|o_8#gF#-nuqJ
z{qi=OhVdQ6t8ubN|58)lq9juwJ3IbQjr=F^hBgeS>)_#|%QrESL9WGV`%2)7jGE{p
zH2E;zCF%oi+JIJQG$J;DX<|1j{OB}6Ljw_}D)@$cDfzQaYIeKo#BMdEo5Nfn)oyaY
z_n$WlAf2k5j5Y;DUHB|C7@k}yJA9u1f-Ea{FjhB%UhhN46<Lxn_P!AZJL8tQ$<LeF
ziYQ|L=PR=8I|=%s=Fx9z{9nDyI#TM32UBcmUXfkIUbMR|(uqTzNANYL3Grfw{qayW
zm0X&L#Rr}w)e}{r{=41<tFTmpSwOXydF%*DV9<J6Xtes4CP{isQQE6^{PH!fwj1Q4
z>bD_qG8qP2*iU>Jm|;`P6kE1=Iv9KLz|9)B;Px#0*o7~VSBlr`h2UN2=8F_GSj49s
z<Nqfm&bc*fxMq55&G|I)z2%k-x9gt~<^0Ql6>!T-8R+(&kM9+k4>gY`C4H+CEHEzf
z(0YpM@BcKu|3AbVRI!2jS?gcRru4=ZLr}!anXUKyB#v>_4z<`TGWX}L&IAYkfJ%?8
z&I^(OM|`ZR7u9WLAh2EM>wg$!Poi=!<&=qgLq;eU;S(6+=<Ce6xNj}S6<8j7^kRpF
zZ?a{uscgB&H!(w|G`hTjHM)q~u(s$+N=+NRRYGeR-502|jaXK7W%a_E6SACh9w)6f
z@{$4|Ew}F6u%J$oo4g|1JH1?+02kcB7eKt*X(M&?=EL`@|71%_T5Ju~@q(Po_ZQTc
zugIE;wq35s24`q+=|Z1f!ken_pETDbc|K%!GgtM9hQ%SR*ZU{Zutug$3p>+-2=Xw9
zfn*W@tE;Y(MPSTp6ww}6k#OBS=ufpAkysh@5*o_SSb$T6dc$#qu><ibRX46bZE6$=
z6;`^|gAOl;<JbmVAbZ^bJ@d}G(}FFi`bgc_zNkyb@^h!<4x>_LXg(0%s5;?~CptfX
zMO5F%g_M=@VJoa^gm)wVwsb)ehf)GM;_GwE@*r!FUwB`k^oCPvV9HJ2xz!$Bvq^3r
zB+{tQ>puqi|C3;e*ML;{wPe-Ks2{D|v>o2E#MDV`ES+AFHH^L}E!R`1Megrq{Yf^>
zxIcZuR<NKYsZ_<4*0ab7kt-v2a;p0s{O@LOJT(@l(hh(9Qmou6A?c~PC2T@;Bo-ne
z-?cQ4w@mb4PPojf^M*J?3HcdoISD$&S=R`pCv`O|m2KK$XH(O<+QXU$K3mK7W~tMn
z@Wk=cG<w+p_GH9AJ+1S(+azeV*GgFlv9d3Ka*mn!fQS>^O!2nwy%W`{IY(E{YYkC&
z1PZ{Vc@;tS7QA)bG5353I?)%x7j0K$b165Y!xGp#n^-4z1+ufWX5PKCn<90eRvj!C
zA<xthwRS;aSk~r)#PvvD_Oj6)KqxeS*@!~pc$V8eU2DnnR8TV;Ex(2vjC?bUal`0g
zu&jLTi)#}H2kU|&Q8E;dl*q%fr3*M3gq{@ue0D9nswC-~w|$ju9K`7rmS8?=hn9U+
z9yE<k-jYp2y5qwsWmX4!Lq)XuvxV%&24@*~@{Rl;Xn1%(`nab|vEHu#!|I+$t5eXP
zzL_Px9fzFuxLB*LMY~IMZmzhWTDj>{KiKr?gA`6?>$BzoU5;v6W%4)|gFT-d7{JyT
zty<A=J1uSMapW7WLbhyio^ta|g;y_*^E`vhJ%_-X6afdXdR|-S_6jHusH^k{wWrc7
z#|ny@j7Wne8#-D)z(2OjI=D}*Rx7!Dt~rsRz!)a5N#h`@E|qNW-~ao+{-4}$xoi7S
z^77!@vj`OyZmGJL48AC2gVE6$S$mIj(5!2<H6HLtcE~RCz!ak^ZH_!ibSYNWQhwLW
zF|}XUZLO>GHczs$i(R@%e2Hc)=$B3CkH5)o|EmK}77|}@1b2X9&efKbJuf-*P4?>=
z7e(9hxW&9P=j_-S!_EYmyEhjwtcaf1%Us%JRl(Vcfrj{#=v^b6t|l}Veb%uuzu@hw
zz%I{bckDoNanj<Q&Fv}I<!J<NB#+xoF7CX2*xd0~Zxgd7a^M0gwSOj?1}fwZAMP5&
zhJ<e`UHWHRzsC)XOZw>!wHhye&HxeZrrNwzj52-}wBg#oG@RVS_P@QyeU{g743y`5
z3rfguZzamHU<yq6rAl&9ixY9*O`q-LmHL5jReMdHZgo?lA;bf}Q_JLv3Enc&<%sEQ
zaq@+zf94bdI#rIiSllY9^$6vg^)zJDIEU%7T`Zb;^9yaKhiO5vPugZ3;|3an4;b{f
zN={R`1-0{b%8rL6()J=oj#Lh1YAM2Zm=Hj|ho9ocZN)P9l;sOH_COB7?)L(v`ISZK
zTkt9>4DxhF?RcS!uEEALNRv~oqRykocRk;Vv7c9iRk1=%nW_p&RV{wEKF&MQMTpIY
zrg_1wjnaFQi0-j{f41-0R0R>0E-lSVbELI^f5ZL(?CkSQL9IKp+$_Y~Ui7{hOg&$Z
zLh0`egjorTV^!`UvRK0??ev%GCF(a>mlgI!b{>msY@aJ5Ul?_wh?T#SuE>xvlRurv
zb;hL!JH>Zi?usu(!xz5^_RT+!$jTk~gyZEYIH(ytg_3It3%jIf8kg86^~~qnI70>W
z^C0U+9BhRfq>i3EJsXPyw)X6y?>Xh}CR*H(bJdp3aIlN-#tN64S>@2OZ-R`=9B~rE
zVzn?7w_P=+iRA|POv`~7xsgJtbx?P%Oq^$d>B+Zx?~UH$L9BO_v^dLwu3S#V(dy-)
z1XnhIr)*Fg;vx%cGx_1Jk>IV5k+VBZWnpZUX;&T8H7iejy6<m$ahkl`-fI+PsJ?Ty
z(|ws1cc;IAd>;c#t~DC`ZCv?3@hLJgSb-9lKCQ@%P#=`60jY>ZR-Dks)r=jX2KZ*x
z6Houq9mI>%ODlDvZFg6=QWrgH7Hqa?1zzW57EmN*>mnKI%=>B?<Lpnr&{O<#8Yr!T
zGYe7?b$>NbGW1cKAE-6UoMyQI)WS+ytuB1*=WS)BE;c+BnjKQifa$H0B&0kG^c+_H
z1{L)c+Qbqq4p}gO_B(y|J2iGsK4T=RAH}8pF3375vqyIGtq-nIAy{m;o>x>#Ty*9b
z+4MGQ-Sad0Z3<3dd{YfzTV!OHX(%vlbJ9Pkiqz&dXH*j62%9aY#N8is&{?T%-I-aK
z=Wg%jY7pvMgik=<wz;eo(Xy8s1Ll1IO(vz|0M>96Nxo#;C*?x#(DAsA^)l4}xh8P=
z_K#y)<J|F?XP6dyaFbz=OSo6MEIw(I_q}l>42zJ=BxV)ap0Iq1;u7OkjN?^KmExpp
zC2tqv(0w@Av3*508*s0ws*_%iGCUU9dNIjbGD7lBWBuu={;2eq<GCEY0L>6};w2WB
zDfLZ#YhvVOXf+?sz#APCUfwY`mDRL;1f;V8R0Rvm_@)0v%awj4p5?Jz6f;+qNWM{I
z%P}lSv#q1N#XyBikY6>ZT-z{R6%I6J<j73q%$S!^8DF#fwcU{hZ&ulj-r6PEysl<p
z40pHutC4e3{YyTSQwAz#Y}M2$e&CPjYnp0|=OlO12peOEvT3IhXn#3Q8UdQyC<3#V
zB@TQu36<@%^xiDL52Fgm%Xv(mPnSdcQV(V<hxW^*;`Oyge9SJ_U8TO&cfI=P*dg^z
zGhSaYw`O%c|Ace!==Pv07DHsVY~{=Ck1Z1!+Vu{PV#|_<A5j(pG+Q@@$7N1pI=ISH
z<VE7#KXf-s)w4bf%EPNl%nj?14yBHxxDCq({3bz4mss*zyeZy8$J-59Bl{yzKY6c2
z)aLip*rw1YTq{pc0qDef+Fm%UX4TGn^w6!wJi1x+-OoPE=d8p7?s;ps)eQ^ZiPADV
za^j3cW`pD@3-*3;cxq}zbq7JkUl#VM3_ovcVpFHTl$I85R(J1J*;mXqG(Yie<$13h
z$eL7Ug0>!8v1rZq9(8a1<c<qTHqc7!>%Wv%p=26bOc3f=4zXVtEC7jgKhVot=<!p5
zdKVeN%J>3$V7niBrNE#@h_`683M2V6y{F|Mik_S2T*S6N1+=&}PnZJjMi_ZnvUv0@
zs<1M6=I<{9ouNBl5vky>JCL%pu5OStCTGdA&1bsHyXUXgR7qgiz-M>-{f4|NGJloA
zra7xQ95Buzn|3f}ha^QvQDCHRso%62RKd=Ao__PLz)F<W`u4BS7g?R88OnJdAN?_z
zJy%WxB_oydwZmBRb|uix|M#I|Dt`Ls`#Gt2sHRoH!k(PB-NE^nPhQlh0}D_>i^(*b
zc8NbLN5yr|Oj9N+y=f%0o_4-|ZJuPsQ75xpvh?oP{`X0@ej2bCaS^{liIeV}g}B}*
z$;ZrMnR+{oz4(a76?+zOv9Fid;vb0^Q8&ag#Jw+5W#beF;6;1v^)~wc+06H{(IBEG
z6yxTWf2<6s`TeaO=8#O!;Eb$vc#h-zp~IHf`BlXEdq-Gz*j=;g1V?penW{t+bM4xd
zP%WVabvKrLnQUToc>M4AT7mi8y#0nEh~06bI=n-Xw2Bw&%`j6-YMeW#(pu(+QVV%s
zO3Be&LpXKfq*s%cteK_^VNfkAo#cYg+s^~JVSp}rE%^IB!X(1MsILb_AOPe^pj}x)
zeHfu{%&g_67sO3&Q$<)5aC}QL&fkI}Y>k8KLwJ=bos%`x+^1r?n-4!f2qt7pYo&vI
ze0%AERbR3hN^v{_D3moNqRd*ujRhwl+ZkNp)I*#vcJzGH4#x;Z2~QP9rf>{utH1mv
zNZssNj@Yh3#@ipH767iu;C%<Re8&M&9pX|6KxwajOu>0dwU6&_^qwz8>1e%NnEivn
zCZ*#wRjb-Wgx{;+?R@SBjr<Z+u@V0JX(h>|u~LeljNlA%8s0qD?*(*iX2A>5ikqCy
z#}yPCDMFMl`Kn(o9w3Wwf40lHwrzBo;tcgLE0byf^&9`-46+vDzZ2TmJ)!iTgL%`N
z`B5oT;3iOM+Gb~_=p0~sPv*dp#_2%^%Y(g&8TQ2RpCi}@uh`@Fp`e_0tEd~l9BZMl
zG=(}Hvmv_&dZNqz?)&o5O;r}Rg8SM(Ho-7=%N>!O#LbIdg^$1TSsusVaUdri_>K{O
z%}ulDau!JLiw^w$B}m;QWeG^XB2#agpyq~A#R-<m5z|8Vj$|HED!ZN$;!LMD655Nt
zPTD_?rffWNu^;KCZy}{?x>&<;iZ;POL(c8qxRFinfpa+J*ff1)O$IvfimcQDb@BMA
zOv$%#N!KB#Czn&K?P*2kISI__Pd2O-oZWiFyM62HpSp6*!l(ihc4A9Ks|vBi9U2}J
z>xCjPfPDbGoYv+Jzhk)DG!*~9^*FKpa`|!jOcKk}cYDk#w6LcU=T4`X4879P4$%an
zb<4SC`6+qO{lRgG0C+rMt5?b<${XpTO%)$0R_5*_QWC6NX31FIIVYB&192-R&N^*v
zi{&Ye7x1-QroT#T<>dTqFMxf({k^Bhgs6=~xud~|Q~j;E3$NM{!{i&yX%Fe4`TJq+
zxJ&JZ&H&TN95jK*DqW-yB2u?+`F(whv77F_Fl<Mq2^<jWtlqU@+Oz+Y?C<}pAaMf~
zs=2vsFIk#9M7y^CcGzj>INq@EP0irv{sX_i-`a4*{^&Zjvd}|s55so&W*peU72}ri
z+ZlNp*;#-YnAx%%TN$&;BaF4WcAp?EISe<S7QQE@!VgFY)XK%Iwcm$SCe{5tump4~
zS*fH277ptj@X}SwaJt{Fme`zNgnmva>35}vhDDVSFJI~XxCsUcgjTD-_);&(LD2~x
zK`WR7nv-G?)KbS2E4S0vm;xaV0ZQ)QLl)V?sh3<T0q`9^@)*+qdT|pQF9nl$r}+0M
zumW2UFn?&K%S<9~r#xM(E*y?WVrp}ClV<Np>-wMvG*kt`V;;5`=bBnCG{fL(mZgRf
zdpei5^eDV$CkoWC(}t55(VBOD%ifWF3dC<4lhk_oic1o2v}xLki&N~$T&k2u<(6o>
zzy598-c}kL!ITHiU$19yJrGg(WLk3olI4^t3exTra!;=8JK7G`IY}rH{-FIWLvXP5
z>E??aH6_|abv03Q@o|~8OIC-??o(!*d7z8xnAbPFX*Oe?>(<g0nTf5Afq1KZ&DbBR
z<pj}-PBj2BvF*$E#baYg!=*B)Dy-aJy2f>kob87@iWPKVrIcS5Yv<K)WEvmnrKMb8
z$#+4!?&>+kf6NI_;oSH3Zxg+BA$^KoT2wofRLoB88M*ttm@Y&M--td<p|1P6ikk&4
z83m}Uhxaqfs!#-O0TF=&XG@U+>45~@mYff`2ZQc4m0T7@^jcX1_G?<W))CeADp}JE
ze$;UCDKlsYXJTz03kxiV_*?CEl+E{C=A2Vdx#r-8)N33TxYayuU7hH>^!V^<D7{RR
ztrb_9m3?!w)%K~D8QjQ>g*IQedBmje$lvJ5H#IJk$_k;gFT{Bp^DXvfG%Lz0PvWpq
zO$goGp38{E5rv(RsPIplB-_${)R)=O584OTTvudN{pX!vu(SOH+UhvNk|1?jM_ZZJ
z?C$Oa)v-w$nN5pca(0U2Gfu_B<2WnuE<;W%qOb0FyKW#FX4T)EHuUWtr)cSGsUn&+
z>k=i+0jCrQ2dE^qs^j=>LMUJ5ri%|?#>BHnq+kOqMq`9>-oBuT3SgO6aL8NHK<QX1
zTsRbEtoTrqyL#$R6Kx?wHRm!y9hb|Pmfn%{_K~&#N~Lx^i~1ZnV*z{gDYFj_uaJ~h
z&kXU$8dkf+uT@b{UVp)COv=<6426XgKU@sHT}`7X^;~T799q#%K<dO{{B;u>ugJu=
z7JQmgt;qf}JNw`H`Ca+vp{~|IM?0wR;24ur6?(?18Jg)&o8?D))=*WY)C1;ow|OlQ
z#0^7!s7@u<j79pCSoOdAq#q;BeS~PKP(s15baH@3&l*onw*yfqmV>ifDQ8CRkyyV6
zw?~Ztx49Wi6k;F~JbP2yotd5h?w`!u780rLU?6p0EUyFM4&NjlBPAuVUH^PNelq&2
zZl5bf)6|@>WN?R^a@Dy*_<DY<$WJNrB%O<_<DW($&!QM@FvVs9w7KG|Vj2rY9xag4
z$m={rx?YLj#>V(bQ?7D{k>W)YDR`8>v;0NcoWVN}(Op(|NZ(<OsE2b@k*SiDo`&0^
z8KyfvA}cf2VM$=LMEn6hG*W;z%mBpH!yBDS?njg^m$tti4~KHZ*&yoZMd1ZF7RT2<
zsTZqP7R9vV`Ui!F15p~fX&Y$Mm+jn1y8A<YD;=)&`?H&UI5mnZvTunQsqa2bubV`e
zmb}S@N{B6g$}e4wAq}dae_nHsQZ+d}4OGp`u<U!YVI$osP-@m=Rr%6@SWcapX$AKF
zL;p-qP>fGr;wgJqYJIPIiy`d-`ZQ^{c*Ou+N)#19K4#%rWBu(m&X4tb<T~kfZXmc>
zFg!4%=^^8}PV1*iux&0^!?lD)SWo^O-ukgBITsvJ&rUg&U+gcrFD-@K%|Ps&b#(b{
zZcgV<T2xK?)yz&E?D&TOshw;z?8Li8ac$%E%r4hY*aW+VObBA0g=`6^a;0U=2`YMC
zDsA=Eqh&QQH{Y3<s1(s|LH#xpoFyh_he*{D-<AN<%v{#^rDQ)Hk}~g?kp_$&`_bN*
ze7xLaXc%<%Qte4G?~*fy)3Xh;e0kpUXtk%{4Lnc})z8)g+wYX*?Gej7hhKw))UnaQ
zw8w&IFeR3bbFg#8D~-PKMVxgt1Xz_&3)Qcq+&YtP<Tb8>rDP5k@UI%ZuJ*rNhFTyT
z2F#ga%O`#3UgsgQX(r$ynr^nnxvJ)2BY74=B}0K5Pg4xn*U-zy?S^r}akYYjNX)Ri
zX;|-<_t~$WOf=7)i#T`*s$X1UzZHB+<xY!SWC?eLKa9eCY=gHBYRCDCvo$QeLLXd2
z8K}HDeL;gkrh3090E0D`0X*$4Z>ziiUo$G*alHRB`CNJ!Hpts0U<;S273&^hE@MA$
z_ek7vi_rjz@4ztfw9HIjk!_j$j)Hlh)%uy=3bGP{t$o#3=wBRLY|x~5)fsdh6jSA|
z*S=WMb28N|)*J~^ODzP#8!~!uGIbJ4hSEb(Z)(JANG|2o40sb$b)|fQD?k-&)SX=8
z<Mo^dcZ8}Gv}i5L<Oe^8^KW$~mCBkH9Ek96E(!D1uw_JH9A4{kReG2;rWur@SjoYl
zI$fpbs&(d>%x3Xlr8#Q=z$waGsL}@r>|adr=MjZaz2a@J?}Y%WmbT571{iy|gDOWj
z$kC?-;QH)DeDju;GI8)_n!)QlUDjYbs)a*>q4CprL|IK$?QY$khzudxk|ODGs>6n0
z4jo?A9wmrZ+H$pU#b1$Cgb}n(uzL)q-f@QAPnH2)%LH+U?GkN2)*5b7@V9Z&z7n&l
zy!-x>yv{8}!`}q7@1^-5b#3AABBYe}<E-irgp$>)N~v$>+T(mkp%bTmuanq8y0xKr
zWR$Z9%EQ9uV0AXP<6rC^9|Bot<7(Yga4mx>dWB(9mjkBG#=L4(p9fBr<(>WhZi$?W
zcdGiWl^C2V&3)hX8ki3nJ01Ke`o-6@T^E&jZ@q#dxQbZtL7CGgn{zfg^8%W~eFs{P
z<CL%HN5{}RrYHsj+hxlYZe4&-k<CY9yDi6ym5E7Fg;Zk8)&pU_sevOksS^%R`^6!y
zfZKJCWVy5(RSgf54bkkbmk+#|u4&p*%|Ym1fZ4s5sVw*4Tyi=4aSZ24z2c5-iJ`DP
z!l|f)INu;4I+isgYhzl?<42xYP5at*LHD6(<QdPLqh}OjRr6BVwz}5BNm_902RAxI
zQ<Xxv=PBwhuZeNheeoo7T3TxX6<mOT0^4H+mVmB|l`FDWF)l@|@v8%g$=b3WR-Wl&
zFZ!D_63><V0F@EfXyWuKr-zggRnuGz@m`k2A8ZE#6!K+#@hogd!^@Os%}!xDB)e&z
zSw=CZc&(e!I5~9t*u=<%*9@xKiWnUW`6I<o1M@VOc1cxoZ=L&&e+U0uZ{WJ(CIuCg
zN}<APU_t)0{<bK|E{p1&*<*oWhS-2b5ILlUuZA;ItoI%m+17Yk5V4sY6*?tou_I1v
ztEme;i+`3LW^a~2xL*{AHL!?`YoJ;(Tmn^PE8D^C8ZtnqDlVluiNP+j#N--#S3Pg>
zZlT^K?^nx1JJfFM+TuBA>%zAOwL%f_)@(5TU17CzVn#;=>HjgI3Kr<}2V1-J3+6xU
z01MZ+E1E58coxxJ0%{Jp;^N<Ulz8|_t6UraK(&}X{!pYbfQ}<R@g*I)xJhZKglHoY
z^me;+ib<Y5QYYo@YNK`}uT=SRmp^%4ES?vtKZZngGP+F`Nb|t$4n(x`FUACH_zcU>
zDJPOrC9(>t9yh^jOY0I^8SSvVim^zpBlCHr)3V!=1~(r^vcGbk4!3}fj9|En2AY?s
z#gU1sE_u>X+a4qZM+CxN^0rEJty`l^b_>X%<z>)yynRlL&6J>ui(oFWdfJ>Xx+JzP
z2!zmfR(+@wL_tn;d)D`-`Zh-fpG1DMbhW_#Z9tKvqF}SKz5HiWaiMpi_P=u_-O0e5
zs)gpNKtU|=DNOxaDD;JPTr4F&(i{HyE8}lxHFp=LVi#{^YcH;F<uu9I#JZ1@q<tfi
zD9C1ua)M}@x>GSmZwur<Lf#pHn|c>tneb(<x9REnOsux0cRiIjmR4FKvjS;@q<OCD
z`79Al7tLRF$B-8xF7-KHR?J{NBz)M=+1BB;H#wb+r;Tv7Vx0A0RDW2Bgb|K2hQ6c|
zb8=VJpLSPFBDThz7Pw<XUY)OK^KQ#D!I2<Mw@#C*+p+{1pX{m4>(O7YjY0s6yb$fH
z%ukpIVSR}h(f8IKQb4DrVaqMtm}8L6xCZo;Y55Q8b3fLkG0UF%t=+wgwLL0H3XWp2
z<S~c>E+69K?Zx{`Ndb1T;GMLo8V!e}nk9xf2~16Gs*UEh#D_2{4{TBOZ<=~rRmg~j
zr7)S7%5KrLw1wnkrI6~L->JEF!qmu)g+u(8fuD}Ys$)c#?WQr(dGzzK&7R@;W897*
zJM3Lk`}o5xh?lF1N#%oPr<Avxk<O9)CwT^A?f!tlLpgaCN-PA91<)yR(zWPva6E2$
zzdfoi=6LM=4y$TMhml|pc^5z9o|xh)Ha$TLPnbZfa7oekIaK33>t+=u+k%_hZZ%Ib
z#fE#C6?I-b-tgA)N$QE@T1tqSfd8I<;rXo+ScauH@)Ee{6cjZb9?suNpde<(6mVYS
z{QK2P9LXhud7bU4a!IY5ha$(A%`b6(;wQ`YL}Z~l67xRvi+Xh)&W8+Deji??&NJp-
zT6n352&N^PVD;ksEd+FFqhemMbGr^&7r@mu-=~m%Ed|zPmvSXO$ytoebH!dv_;yJg
z`BF#le=uaIEeQQIb#XxSI*_^737pTHl?npxb6dm9;;Ylue$MmGZ;Lr;)|1E75#(*h
zR$g2Eci@;zx{B0yrmW5R2Qia8vRgbLt6vr3*J9fPs{^6D45|fa2Y#7iLt6=&95@J;
zD{-itNgsQMV~Z%79PW-~-DBg?a>WJ^j>J3MPB&EOVQ5qYJU+F2U>Ox@6X*2Ud#NE*
z-ZH}_OtqTNt-5h;O#pfr=u&N8&Bgy_bmv7pr`Z0=X%eR)+9UqW%+PGMQC-~|$P6S}
zsqsu2PH9usHH5RzILbbwD`<Yd+R3U{(}b0%=hb_2TH2r%)EEcD$qp|v*IN)YamKlM
zV%DuR!~LPgY~!zu$ze``uvcCW@URzl?MVh+ngpauhHinlFgfUz_E6Wt!sgT%3>@4t
zrJrQN%()}8FM320XayBRDmIVU$_Tp!I|?RuU|0~UjJDww1{(O>V%T!&CNCVv?YTlI
zHRIvW+cILaj{)Y3;AKv40OM%cRyp=n$=wKSh508kH?l-d?nipLoCgC3c6lt67U<dg
zA8w^9`fP37PuqNOE`0Lz+9maqm`@k#zl+^I>doYv?#yK%hawP5Y+7dV6DCY4sS{NU
zqDuDt+6eg%FR4;Y%1>ydhYjQ{yuab>9tsHq_=@T{64jCx!*VKW_FrjW8|;n?$IM|u
z>0L|1t*Xj9VTPGnHV5Lp3G#0UQ8`>i9;#!<X<wG8Hi^j&-8JzwN>9T}MNExt^3<%^
zAuV$VZx*Ma+{Ubt@8d3DCqD+04`WtMVzKoFqeI{$ZLT@ApRQiJi+S^4M|&=5>T9Ux
zyT}QVp8P!Umi?Oq{_BC&|6VuN*^&*bu+HWhULUY*_O<P6i3I=N-uB_DqqkCmyQA#n
zgE~}6mJHUPn+`_KLRyrk8TEcI>xaN=MkI_JL9k=p*g6Okty~vsPMrN|MqzS0z4nvD
z=}-O<gh)}$16y0~2MH`{vmSS%u}2sV#kM|Fnc2juaRw~B6b8|6?XUO5sVUJUrsep?
zpzKy=#5B^jY*%PmR^%bV&RCwUr)FAsj2u!puYfaeY@cZ%vv6Fk>+O!1!%oimm%(e8
z9+-a+&E-AawDYZvT05u*30clA9H_uAo_M7>=hys}l4B!Ai~lMH9IG>=(4g^9uRk*q
zsau;bPaoZ$6&Bn129iQU_esB?@{#(E{|!jK*DJM1?|3N=i@d*tfvIsAaSgZ|$x&pa
z@qJNim<MPcbZTua?B5u~0KdJ#se+2N`}c&k@-bQdLcfP3=l~J98Fc)Ui{+oHUld8n
z8JhPe^BQM2n<k`%%9#zf8Oq)Z=^rjYqI@^k>(w;egr77PF8>AL5l9xd7o~07UYCC?
z9ScKGJ71A`Go(MspgZ?UmthZw6(9@uQ2zR#(g<{}BQSlif^)KeVdLe5p`LlzuCi6*
zc*)_T99Z1KBDZ@xwkupdB7&5<=g^mHYXjUEqbDJp2S7qyStPK70fFWwB4X;*BT_c6
zH3c5<ioyqK3w=Z6J+e9a!H_{W7#XYj+@-k@q|$sD?Cs{W*6LFbex$J?u9m7hbexuY
zGgSq0;_^x+_atUY1^=v{o|g~%oo>o%An~7Sw-pJxDz&*<9STl~3Sd@N(Npv;$6ek+
zvr2O(MN6&ees9`W6E)R0wN$!F;t!4g>O!t4bs*d^LTWd}ooF)8wb%+emb~Uyg@V9F
zFP|Db0eY2bsE^*%IgOr;Fg*}~*6CKF?Naa0np|?!Q8AKh{@G%1YS6pU5d<ukCwERn
zD}Qk$?H-r35mV)N_Fm_G8B&q=6#+izz}R1i(em?;G!BB?7+kZu3bV9DFb^>>nU=GM
zasHMsiTW|BkWS^q-<Xtf@Ve&GB9`qqeXU*KYix#)ipf5EG9_5fB5?>PkmSppCi6IL
zY9T<RL%aBSrad83kWiGAqlyEIczDok&jcHZDycRCH&q{QX>&RU62xiwPU(e(W1R>A
z>^?Z|p6Ot(PO(Z+Q;pzW46USPssERi9E8uemJvZUN`dFfw%wWOCe7VbO;crVrPQu3
zoD=^l94>rFOzEilpy_{~_nPxR;1*crHvZhBsYP9`#Br*sli8n!CV>Z3i-g5r&>_Pv
z#-meQx%g0O)JK+kVt8>^^P=E)DAyt$!J6=FgF$Z_!V^~-v{0&f)i=#ZCC>&^p(l3m
zPmlupTeh=2bK)s>Ld|8C5)F^=(9QHc_Qh&%&+)Q-R8Q^ENiy$zZo6li%94`vbA)S}
zF1LC6uC%PplQYO81A5P*1canhicHH4CE&cJGf#?=xNr`hUeF%BA`9__m`dGh?9fho
z>Ta~?T~u%xQY0^Wt}wSVTbF?a=a=+1V^u3l931kDMAv`)H))WCtB^&<pWTqEA=r-V
zq~MB-k7cZeuP&Oq8JJgf((8cDzR1_TYZGs(s?@&4Nkgb`e;%7c6_lP1Z|kH!?BP>V
zx*`*#+CDi+MVH&c!Zuf-&>1Rd({B184uPpSEfs&W6pfaSD?ZpOhv}vtv6~71@P-O1
zXuSEXM7OAmCMG!nR^NqqPtCUrI%EVn5sGZy8LoG#|DFGur2Me?BI@S6PDmE!Hlao4
z()^MLvlT&??%pS<Q}SA~l2f_Zm{<Zn3^@C6)-Z<5R;{b`BC>K@4(zYU*dlW}=zNea
zGqHR@v->Y9oWkR-$Y`d<yhpQX6Vk&Byq<+XZOFG4%;Qp0$Gl-q9;h0h;!WO76nQ7T
zRJ%Aqq7|$G({BO2^9>DqM}Ul-#Av7L3?l2i>1`14>YRPV`^FxrpvWsS^c7ig=0mdj
zIin@WKkZyE;_B%tSEAMp>4hj<>-azEd=p4*ef;{xaq_enNywJL_>pD+j&9-%U7e#7
zs<y>Z8?>bU4G_mIHKx}KOKm<6#_4VfiyhwYo>cE#QgM+_hZ}sk1q#yYxLo9er+kku
z@aRTw0x>mj9&I-YI;&4QXP6TVzkC!7KN2RjZ)Wu6SQ1fb2Fl;+-(1o_Vi&&R5bvU_
z%VL*${JFmX@im`pWM?#T1R`2I2HNlaF@kfBkJ4b4kUP7AnKX-}>#0@FO}u6&qrjLO
zy=~1fN>5*>wNR^hI5W~f4Ek7LensetOhW-DA@mtBC&sFqff>}{*LjGG@EoyHmNV#z
ziNlnkB}`U3Tp|n1A}+d4g}x0^9)`9GS$>Z$SKH3mjJP6u(1VkW%&Ke0M+(u3m1|JT
zx@nh0);-#&*c`h}Y`UD#KJ$NhINmU^D|)9rN9>}ak}I(|*fXqp(OTg2u_ywOd*1qu
z*}G_~qy(>(Q`)(te3_+VRRHQhs;QjB7X)j`Y77{C!{Jpk;?|^A1++CVT-F2W;vCw5
zP%USrRZgE&hPYWI!<qQ+*^z9J8|Q<q5gfohXy`Jf?tT!WETMV0(v7R)M;?UX)GT=r
zwc_lV!?=EcK|cJ&?c-|E4jvb1#$DtDy%n1YUAwp3$4&#xlgjN7(j1C8tZ#D)buy%t
z((=HE#73UBoC}<z59R4$7gN%E(LrfPKV%`sRdx5<ugHX`Sr%uCrcSf!ei!9`{4bYj
z?miX|^Ax1~QW)z6L-^YX4V|=6&5b7E8at#DN|6=O-`&xI2C1zaMOj9d3%&!kwb_=P
zrW(AyB3O^+6$B102DhGxA2h=4GdP3e#Lw`iONKx#!7}T#>xl`dY&E~6m!h#9At$yw
zgora4L079OKYWwD5)mG5EMn+p3N;G0?|NI+diQkB<bpaNBcZ&yrtWp`14V2L_^$(S
z*Dv|L?Ngs2)PAU#%*)Str98uGC@18_%L3cLS@RCt0VUja*b9G#c;C&Dbr_TB&FOOV
z!RL#RfQa{|<;oXqKgV7@cttUXy_2-Xjc2}ITkYmHa~@%CtV{rU_>T8e0}Cr7J4Jl-
zOfrbYBDmS;V1*>4##!%Z7CRat##!==FzP04C~x&<+@^~+S~0LfX<g~Ie)z{5W*r}u
zeg-zeI>Ojs9kneuvEO!;?teel;<V$qG$-1GZ<UI;(`5&|V?IQO`zRQz({fEXDFMO#
zl^Pm>IU95p=P}|)1h30y!^H%yWKvyN(+#8%;CpTNi=VLIQhW7<kNP%^&<<^Lo1xrV
zF<iA8zMtJB;(fvW+#(LPY>cFPj7Dz)HKn0$-cU4Fv48f*8Ij`x5GhzLwFOfUDWX;N
zTRVM5E6d5?hzR%IGndJ;)z3vAlfX|kP!`%>A|Z?Gni8;_vOxAVQ*j+$naJmOJb+%G
zVUMT(JN}dTea4`YRt<-p3^%Ia4VoaU)+}>Bv@uKJ(G9N{=@E_0@`TVZdSsRsH`n0{
zHO7F|Y*K5u$=Z=)JMCOzKhv7N>j0i>nV0J%v*edFUlS!KDKrm`rCrb%w6#-HyAyg=
z4nMMb{bRJe*6f1QSx|suctt-?QGsTzPB*QdmRVz>DsO(ZDx`5I;ED{Q;d6^&S}-tR
zsmShiFEuzn0ddivrY}hk@G>TG4mVEf8zRuQD6Vg#x}qFFsZ|0iLzv-PLeSh(m9%LV
z_XPnYcy)?l93K95SqlrIa=}(khbn*3jF-%ry5Bqy%totsu+ltO#6YkU3=$SM;NdSE
z`0xn8OK@?DEu}{0=tyC!OS0`xpQ3jJvLXZ%ybNJOkGfi5S=N<Y8-*dp8lM(saP6(z
zBWZAq$FRWV-)5=M6HWK>X$PlKegl13m%-e5pt^`{q9~ICtwsK!b)Y3m<XofpsRH=@
zj&SRH$KzZ+#d4{ksLFo)C8o#7qTw9>>x%5MBl_YC>EE^?{-3$jbZ%64UJA-bp?-?W
z8Pe7!sB}^}#bs~|p-LgT*uK+~*&2;T?n{N>0>yC6Vvttsgviv1jBn>{$HLaxsz`F3
zE@eSjAn}X<9`<7lD6WY(M8vZ&PdkQ5^IdP%HR!C>KUyAKa5YfaW+JW(;@}TBYC6OY
z;#lXxmIy_oGoR+FSe`Y^7C%X;{<X@vMw?sK*0xvOUM;cMa~8v$Adq%N7U>R*l3|v$
zV5DW@ODp{xG?*yqv+5F~RvhoMU#vq=r(o8{8E$oIVTUM$|C#+(&l{@wBF-G<;L#y(
zw=2he`DAV%m(B1bzN`etN=*BdlKY2;Uy>pxchJaNrgC^;U~Y6AYOtuq(LjZGwtG;;
zO4Aeozoj?)5Ok{FK?FmT^Ep|P;-f8UG?1`PwR_X$Jp%YMoiVjYlRVDk8*~Ba%GEf&
zroN`(W;Fo@c<!m9K<Wpf`*WIhyi)JN&&oM{&V=^m_;*TU%cX#}nb(sq<GGab0EwF!
z!Ex*aha{i?xM$oeJl>1wWjq^gX!<P9M9F|7TxqO66RYvkc2{)SIdx(vY|64vq*PXz
zDk{1;@(KRI`oYRikr$myy6tRHSx@)Ej&A(GLiM__OCkLH3N%SUBbg0LO;=>^_}zdG
z;Lg4KGlw?*0WUml)IA%L5@eAf(+)%~Ia3~0uB>r?C0ZSj5bEUfFO8Lv>W8!{I}>BE
z#c^J}E5CEk0IZwW3fLOwrh!Rr=WOc57tb%dZ|_G@g?U(CX9E{jx?H>x2jMxzlM@w^
z#vHe$t<ZaMFqjWvnd*6ZN<W#Bx-jwVF1Rdh+?(lKty_0SkKH&JU#IIGC)g}$?yi$R
zVAFjA?cB{5FXo{+ePkFR-<39adi%L*n?+xXp{<Wd?_Yv2CFTd&K0-+v)XjY7pg1><
zlZie}RM*r$YB&vm{LMIwcTD{VJ^YWcvO?FVrG=0C3p%Mm9c75|kNKwMjBb`7*Li^>
zQlw{6b=Jg^<+IoENFUj?UT5pM0dMS6@$gisZkuuvAScyIa||E-X~}6>(Qz1bYHxuL
zZ*Fwg!rH5ea^VN`lhZ6Wi0Lgb%oQ09b(o|oM(Ug@#*`y-yaH@Sd*RjS^0$!zZc(t*
zBac17)I$bF?R%dRiqljs3YS3N-Zl*8=F~BmcD~A`Glglmn|0%k6VChd3hom}tlfk)
zu{^RR2%w0`i^H8?-WX0@u)DL}n9d3?_H$XeB42+5DpkStu6UoWb&uHGBDYx(9M90-
zO-mvGp4LSW@mSqo_6hTN%}rdj%Yt*VN8JJGu01;~6BvEgNpjg-4zrD;27Q}ZnjNa&
zH^j)u{Q^4m^cnvU+l+V5hS_c^Do|h4j&rhlukSO<cRS`vdN45qc0YlXc>1v+8PG_c
zMJyCZ8MY8xqV)6sj2{20@1<zdk3Xi?t81FY?eKFfn$zW%8?V<3X<g>%t25%7Uz9EL
zbNVuEUXjJ?BGr0k602A8h!H!FAFF!!){bAK6VqPNYt%nC6pdfVIUp74?NV>JJC24J
z(kJf}v<?3nD2$tnGbgw&Iav{1^LUHghPGz&lnVenH5dU~u{_WV2WlC;E!9mICw*jG
zEzkitE-a%%@LRl>y@C6k_B8Mk_~JxoQ1HWX`lW$_mk6)PA}n(&PTz>nDiSsO%_21p
zvnn*%E6+0WOY9u|Y=WUQti;`bin|_n{4MMW-W+Oep(nFxqob=3rs{o%@A~nm5;&`}
zW@#)>%G=g;1}73083!{A)M5t!%#becqSIe$;gw_8xPKddxa6B&(BN9woX)zTs->oc
zf99G^*ShPj46aHPV9z{_%I1NLXR*!jq33y2Y%~nRTA1R=QOBmd-h7c!w3Gt42EWHe
zezfhGT5sy#yI?-%A2}N4m(CLBk7(-X`yg`PM%7V3sof^+sD12uAq0fV+~6r^iDWJ*
zG$3otLK8gR26q?R2%eZ+ygLTL&tlZGzet<1{~Q1AdRFCs|2zy#^Q?#mZioZuvKtEd
z-8GP^NNrF306Ml-Hrmg!j7J<suwUwY6*-*5;{Zz>5F|;Sj&w!#j9HrohvzJM#a7_q
zC2;y6^-Y^@yHVHM;&(>m4l8#LI1bGjYolzNHBtSG`|PsWwaEwXT~jhEV-551MNkDl
zAErM*5UX7dq2V=Gp-`=Rsm6-=&5XLOn8%p`t~$33WXF-e%UHlMiONYj0%H~*H$hRE
z&?9xtm+5!l^32?|u3}`@yAf|5P{~*BUv#ZJU~B%U^;YT&yhw<~AW>|+4N>rPk|rTJ
z^wwWcDr^DhKpPd`CGM$YzD<m1=yvs>wq6ky7q|E#+dC#)#ym?ev@4SstN>63i}O~?
zN9v}1(u5xy1a(kFt?)5FGV<Bcz*9)lIwaw=u;z1oLP4iY9d1lwi+y1vkNwkzuY{^F
z0Zt9sqSOk}RvSHszMSWV=@=lNVG6PvYGd2!BJq<rXz;ddM^H!rq77>{nH$Q=Q_i#d
zwQ3)+495fE|8nEBsIupVpN(jcve+lxig?Tc>EoagGsA`%B>N=E2I>;7;iWg;Dy8~s
ziou0fNsJO5ui8<l+W}E)-0bx^=WBh}v_sg(D*@xJJsgu4Hq(p(`nJF2n&suGC<*v=
zS1~EQrJ%%y1`(z0=i3!VDf<67*T}R4v`Q(-s#y<3q=FJAM6SrJ&r;w0SMDuaL{R{W
z#lv7b9lFVTmNJn|0@}LA4tc)mS|pp<19o+JOLMahQ-&554&p5Lhn#}3z>|a4rX7Y-
zU9(|xqP?4^2VDX~4)QBBrLrPHT56h}Uq*|kVr0mGyd$%8K+V;}*XF{9K-VSDi=@^~
z+xAw73C{8%#6~MS=5}j_1y&++t`9LVGMj4Gs_pP~UO;RGF=Joic2846nw=n5WUy&n
z4Wk`~uK`^e))#A(2Fep2rq7X%<49LakkrCaNPA?INTO^f@y1{<uN+swQrMjEi%+`9
zICS4q?~}!CD?)hqh@pk;yH!XBq|&_;o|l0c)zFoDQ$UrwxIlPfhKmShk(a4#XHWhz
z2Us)Uj%8*)i)RKOlcfBZO4YZU^*xFHuCoq4DPdxZFl%Lj`cP&DeNjrdF6W(#iSv&G
zRkbrbMaD66fIRDaPtRj)WCa8Hm!?#fGsPAIpXw+n399PkzO|WK>{cQE75P?iy2d}0
z>gg?rtdc69bWM?BPk|x)l${M7h_ZWru_0s7qwqp#W?297pF?z=_HTGIOt0IA#xu{*
zVf3?^a6GzWdGj%(rqbPI8p!G{!YAvd>q{<tF!VUGMIE4=-lAcYIkYf@Lt@*c75G*J
zd%rUlGpYKDWnSn8>x7}sh7Fa>3d4|pXw3>#-+dT_rm)p&bZ-JuYOSGqO3Ca%TdUl&
zN4FT7hRUZBt30SkkwFZl_j?aLj=%b)pIv^|k3FE}wRYFch5`lKCvk!siIH3f-fWpB
z1vHRwUADjN888@WYoCHb37u8voJ72+%G@hXfWS}gaJ<w+V_i@iGhK~Vc=VBg2G!?i
zG&PJbCxS17{A+H}170C6ZorpKOoCABWr&34;=MGK^@*GkVbIwgx|RCVSn_EecYV;H
zx`mQ1R4ti5uicgBb?Vp0I(QjXpGYnH!q^v2BPLm*N3Dpmr4aM-Qzq}YY%s#d4fG=y
zyKwpdPqWA|9P!vWKx7Ypj<YyHA;Lq#Kt;bb&o#3MIZ9gMoUWTuepcgIiAg|v2AodM
zjuXxRXEoi6Gl5$V#Y=iNXufaLh!UZyh-aIKUbpiWW$<uV(sbnfLr93U+Js4k&|B5Y
zJ)UL{8f<Op5oy;e;wCvd(byQ<f+OFITbYP!;TWp4;@4<>Tv-Ei^NdUUP6MttiK+>_
zE!uisMgjri5(%V_XB69|l)QgDqnJCJ$iJcum{3ON+P_b4?4{4jN!Lo!H1pIiW#L*y
zNCPO_36Ya@<^Rf^Z!LM|jizu@wj)w-J;|3T)kQ>kEF$&Ia1iLLN4N)Qs&Lk^b({F*
z_tabY%BT~=!~OnKE-!zYJY(yjtu^I$b+hd!mqAx#{SC~z@XWdV1>(hH0VReKIMxbb
z;BLC(ISzx{XFB_dzW~?Kw@%HeqgKrIa<#e&Q4w<o>L`#H3HY@^-ja>RNv^TEBjtOA
zmcVT60?l#6Hc=rRvUvV(ES}lRc$Mf8JCa8$&xjVPL0j*}0$7ATd3!_#479!q|1(rp
zbVXKv`SU&gbBi%!+_OdX6hsAE0vo^;I<V5S!2|)Wowz{uMNB=F__au|a?r$y+7KVV
z*>IDo*m+V19uD}N?uL-C-4PlpI=<$oSlJ%WdF!`-X#sjfh^H^OU|aZ(pu9>(-_R7)
zVfd;3PjR&g(^)MbjPo#bBRb=Asvg*%?n1Y}(Q#BmbtD!CUr5ZT(6nk4gn7Z1MiF!`
zH6n4Ieh)!=pSpo1s%|mnAaS#KC9tZ4<d5DG<Apsa{mhZ%34rOe7Fsy8EQCM+gbyUN
zveLy}-HpjLFUg&vvp!H4K^dgmB-Kco&Sw#(!!Yzg{O?VM<H>Yf_1v?Hnx{KdJ{+G!
zb6aIN!W$vClhYR6jn!dqV>pLSW3+j~<-)$|d@`k%%bY283n~yIWY&&8_<$>sdf-P2
z^?qLbb3m_JZITbbBe7+>FW&SQudNWdSR>`9GLu;TJJ!a3vhs_T+VL04)>x+EJqw#|
z<!dzhEKCNu*$OI;%eLa<?9D~wk!p+Ujk@x(PHJehM3|UnUdz2yG1Fu#{uK55$CE=K
z*)y`ZgQ`8g)GxsTMNyIl?-*L3v9a!b-w;^1wQYZd)nivIU3)8pix8J$47cVxc<axW
zVlI(YIn)FT%*Y#l{yOu|xuUsYykx=abQCA4fUu(C7MvE()8f^p{yR)>&M~?%TPVY5
zM~Qnb*vKa;kvv1(+l`|>_w})o(za$qoz_Q_R%yN#rNT;z^6N0&CeIp{vqdL!5MEV@
zsAJ}Xxv$wi8F{q<U!^LY13c$U1A?a`y2<xRc6{;?h3r;83gcxB7;4n`32KV*rVtzK
z9in7)Yh3kn3RSV&CO|_dr8jp29N-Y?&0wRFgsxb5UgiYlyUy|4eXYj{ERR<^5GxJN
zT}!6c9&U_AkK+4t<A*a^wg>9Yey`O;ue*5Gf!%gGvUz!VUm6tVfRV4!Vg22Gxk@V5
zcxT3tAYXf66g7pqJX;wNWbI-%b{|z=+k1_A$ZMFTdgL%|jXmA(|D5l;1ZdXHC{kb?
zA5*A&+?M733uBSnIFLAx8ipO&r9S(w0stACM#S7aNA}bF>oZ`i5_88o?=T?O<TxH;
z9NR>VQ+;~OK4wYod!#-$O+j#65d>0I#GQ9~eQ<Qt;?~__Pm*ia#=~jDPh&Nohp~^$
zzVG9Bj*aS@ubEIOwZ}Lq>^-JxyKDlBcG&yHCSZOCyixs4H|ft6*~2xGH_~kn7G<zu
zfhdp~!2;c2ac2300_O9E49PYcsE!i>2+it1NMrnIU8jjBz{U;PWXh?`^nDgReI(o)
z==A1XD$m(y$@=nd2S^UuPP|k<a@3y}X!nXTZ&9p4w72a>i?yM1FHg}g{+X9$JC)no
zk?E2SePIWs*&(g{y7LS_rbL;J1@BazV_8*2qrq9Ls^Ca%n!`B5=p%`Nc{l6YDzuI5
zj*7C9h+leRWi}Y+O1Ov|da?hbtOWKcLVKtQ9+`b1E0cJVZOUvY6o#MOjAJ`;@_29G
zGC%vWs;v!<<s_M6A0gzu@+9M3e1u+${uLM)i_=;;(9mmu+v#iZ%kh<A06%Dhq%?9e
z^D!(~`AXVAvsp#yjia<SN!AwbF9Wc5*&T9z*BoPAu-8%q%eYPFmwq@aqNqihv)>9v
z84odjdcJOl329O>%R2o{w11P^1Wn`g_9`_80xXJTi}y`u!Q-6^V!W(oYYG{B4_TZo
z0&kP+*tjq6aT??H1B63KI=lugQoE<I8Gteve>)Nb%pC=<b?I<hy58EOLYq@V^h2Zy
z-;0^^OfC7ab9<k#aUz@%&h9IBS4XgaEqe4bjUQ+sqmIC5PbuN^?+uXSRJ;-u{Mez)
zMV7@l)L48%av)g;C_EvXlk4Ok4~`1pgt-f~bJ&o3bZ+bc3y$U)!%~G1`2p{S07wKk
z8eILI8AQV9#;3z>2U`5uAn*W<hsvWO+BA+}Hc0tkQalEVN{1R+N&uKhYVy_P&!Wq~
zg4=y&o`J)t$n$>Pci|H+0oEPlTlN_S_f2sBi?jERYI=*dg*kdW3bupvu5?0^-r)!W
z5+q0<0RjZ22c-9Ip@t@qfOIJ#gb;eK(t9UBsM4z_y$JYnzdPO=<GbUY@7?kJm0#A*
z82KY}t-Z77TyqU0NJoD6nkG**sVCxacFS1ZZ;t-&8Ija6#xsE4W>ubmq=uSj<(+a9
zP6)HZXZ-mUng)OAdD0I!K)nQcd@66$XuMSIBMz#%zH-O-1ZcgFh60iU!xOYSs?_~Y
zDpA^PjixA1on0ez|A$I*ljImVC<p~v6Xt9j^r;8VuR>D2lCv}{V>E$42alsWr!DP6
z9dCTXIF0s1lLE(^gm}-3t_3{d<|-=X8e$;^7AOmJ0<f2BHQ*tKAtnE0t{^DAWM}7C
z8Pi@HD#G(ImNO}NOz%>B{lkjUfA$go*POl`^?mO?KsLY)TCul&UG|$|)n83o<!)Hl
zx5A};*Qi`6gxSo3_xA0smB`paP_Mg<N{y@`1hGBdGz?L0b)`yIt!AgmFO8g$TK}Hn
z=Nybp!LnS6<QMS0Uv@OqhQO4WR3L>H$xqQvOdVVhee|W&qw|B{Y?5Lu%|}<KyQy)1
zw=bZqeIOwf&(6&pe^^!s*@$OIL8G5UV4Xv^q<&pSJ*r;Dt%rHm&vl4o*_Dp}oWy|B
zNQdftG3~7jG;X@icSX2NdE)awQtRGF#$Z8oiZew2^t$~!+P(@NFN$1Cf7KP+6cW#b
zVcz(6IFD0|Ox;kDu&PrM0JSyf>{&LI+iA*!P~G1N)PXz+Tc(}zWrV~Lg9?z}R58+x
zQk+vJ(=9Wll~rgX@{N^K?!HobNQsb?A;Xz%;rVCFuVRChOLxxeg1*YR)_XY5kEdT|
zMyxK&X7VvXe|YCa2dfd-2PbO|1;^vg^@GbQZnbWHbC&$omlcCI8Fk}teYf-|25)gK
zJR$Fw;k5TlELGcN6L=@*OI`J#0iw`hK%iZu#5I)R2Iu*sKM9fkf7kq_ek&0Goc_SR
zip5c=8|P5IWY5-4toXAxY3=Q^*MQ>4+DA61*|dPL$s{9_G>P~Ab5!sSoM}!c_ku+y
zPs8K1_h2Wzdo1O3qIzKT;wL&c$2p0=dv2`e3rU!KR%2dAN_o7rH;<=Dx4bQrV}i2i
z>KpxVD4_wHcZ%p(&ah9_7&YOm#pwC{?U8e+F3H(g!owb-S3<{RMv$Tglr=ccpa1a)
z%j7F29+JChHo4hsu>mzUY3UKr^?GTweB@=Z_t55615vKBhP#{6I>DxLFYy^=YCqpd
zzdpmC2L#CRo47R8gnlJ7ZlH}=`C5S?Y>@qg`M5@EVh!YIpraCQNeJn%4xC$vvmJp1
zC`m!J+N9_0^zIj;R+Pa|Tjr(}<Ibx|k1YuKq84L!HSde;d}D3a<}rmlx8CXv@sbsN
zL{QgmGFy|es?XBf<)FqO!^A^)f3Q}(a&VYe899eA+oNTly^TLoS@Lk#jWQ@7uSW)4
zU;U=|r)7Ne9mU`OHGlr&J-a_kr{K?P6@Y%UHL!>a;7F*GT_j5T(R6#olBK>h1!>Jj
zU1A4g<hwr$!@S&>FkXR9*}hq^C<t!ZWzIg2XNf?S5Vn2lu<Cd3HVZc9THkCQ9&-u*
zK#Zv!kWvIOV<?;WSp0l5MMAJ49iUJ%VWE=V%;{CvSZZAckS9*Np#$Ub-BZEM4rs{U
zeD@(NaCHkSby^n{_aIj;aJ4Zdav%3PAve0+Kp!Tcz94=|r(c-_%?>|JyP_soPiEb3
zd**|yQ<1hJwB=kH`C0{s?z$VYcMP5#@DZO|`4m6-O)&sHcmc50@K}JAx+ISxe{8?O
zq^74Pf7-IZLt-#`wPj{=e5;qycy$pus5~T_$+vTw^gt{$b>H^mq2Xoh^U{*N%1$6^
zrO}AZz7Z<!m6v$vd?bM*b^wpL=L|(Om}Pw--hP@T`dHN{uTa^|cc}SGnU?tKXlpuO
zQu##bc53qvTtGIxjyTYm!G!it9Cc3t!vM&};0~X}Z9a=XcGa0kN-LYfl}I`1n+?AL
zXMe??grB|o#90D3aJDjRN{-j8y=C5%3|8np22eaob2fAnb-UyDw-FVNzNwE#ygZ>{
zf~EZJ(ENN4ONPgjK~$~jUFk*f<T8tdu{C-}Nk}hMdU5ExQ{EmL?+KBM(s1Eh7Fav}
zV=J>`Yun<ISK@tQNt*_ny@CY2>Mp-y<>k|xEPfv>nVZ*488{;ZAS9lNrc@feg`f~R
zZbIKs&WDz#dG})8qE_n;By8O#{st1Pear_`iN>*b*{+8Y;-^vBuaHDOkRvytC#$9&
zm51eErB5&?*DWb){`lB0r9Sth1WcMc;Ek6#C5)oK7VB?v!)xRjg@9;lroE#eTLG<Z
zxH?8qQ{MlUm#a_D8xAi5ph?~@%ix;+^|t=*ys0MyVX-5_aiFPwJP@FPmY+uc#DK(c
z5d^6_7(6QNYIr=I?~ey`ZBIW_dG&|qGJBiuRt5cd74z=D%K!?BfVi_bc*)s3%wroU
z7HhgK(z_rSd^&KkbQrt%=2!9KZFT9Lu1BNpFq6#~_Y3sl<zEc+`_yQrdWkjO@9r}{
zH!TZaflG93OhEEBC$g6kclEy;Y?#5QF5Lat7h)uTj%pbbVlMiIrk!raX!ChS80S@I
znd@gW|0ERI<PFOpU*+oQ00nA_oC_{IMUv_dY!$msbygIW=@9iPv^m%Ov)jILKkc2W
z(N?&l>K2KKMu?H-@<6hHy{p)GCVQj(n=Lv0<W4Px%HI?<CjgGHr86He$`UBEO`HzQ
zj82TgJVeJ-=6p-HN==woR^8DQs&Mm1vu^$TCA~ScI4c~|sATnhzQr<cZ3LaeS+|cd
zu?4}a8B2*gqka`%a6{TJ8hn#u*$$I?ke#}Jl`JPZ<Vb4(#45or>~m@B66cDGI3p{M
zM7Guqft?wOS#>_{R0GQ^^|#7!c^yNP4s0LjPaY@zb88o5CGs-loMK=>-CE%>1D}^V
zQ%N0<){SSo>V16(J9P>}`NMmgfK{c40c0OplXUlQVd5sTuJ@4NVcd-@Qd0R8HtQen
z!Um{A6SBd{w*>!i0jwvd@vkq&-<lgc77(bTyYbGb)!F6UjU60QF7c1YlOf*m+nT<Q
z1U&f?7&dykj=e>}SYN?|)mH`KwWf^qi9L;90S0|VH4^4vlV%K$P~jT2d<sKKYF?U7
z4PIn^o|M_7&fqxxr&*03wftP}p#;duq}<&{<nQ|NhN>&AN90eyst!6eL^}tM01V)q
z7@KjT_~+=CWuL>LhGSwOkP|(vpbwY|i!FtGLX9}!a5@L1D>^@)l)1$wa<{dN)j8@-
zEu01TInrmtq2QS_-{yy=;h$L*9QK{Mm9q80eL3@rfP~TE^rq@#=j@Z4G7rAKIWvFI
z{>|l6uWAVG<Hlr}je)WMwyu*MzSe#@gbjaaUuKv~`*>=2rHn0*YYcvPl1YjDpjF!~
ze=>FOvSLke!-!vQd5J?w_nG;l%`w#LD$^m|yU@-CLJnyplThKEZ{@}Z0z399G|if%
zK0Pbmn<#8hY2X`}7NiOPv02&7QxvGxa@1AO3zB9FZEpoh6;=|e79tKO#2|JGd>+j^
z@^r3l9c}bul#c5vbR`ihcB2FVuzg-$oufN?VWNajKA}aum)g+yR%$u2>8O<1rE&vm
z==`-tJ|27LJKeT*_H8W<(NrnIr-Je)dB7Whyf54z*4*;;BJ1uU*(0(=zi{8M)mePz
zC{-^>mpOS;(A(-B%CT^|fSM13q)%G?gJLz_SUL2cWZupiFBqsNo6hPhP6YbT{pl|h
z1~+d|ggp}q+ogc?XWyTDCn(&imB{(UOzV+Qbf4l^D@>AbiizWVBD89k@TE%fYv~^k
z^kR1@DHY3{b7%m+DMAA}b?W%MU6AW$YVxL?w5W5@6g4bN3~u8sG<4d)-*baZc_1bl
zu5MJ$qnx-otz~RZG~^n`9AgQ>w0<dTU+DaiXx;j1PWR@hH^Q^v4mh}6LTAR%dagnt
z%Aqm+b*iCP!`k|v#Ggy!{u9Jtw94XvfR6Qhzi~)m9giJ1N`EyeG5~qNiI=f;-wSSc
z>Qkm{3+{0JRP%S&GwIYxw9-T%{0GTRk>lq|dDhCD?f0_+^YCwZX}b1k8NDNu7ANfd
zKmUDABuDR{402YuQ|$+pt=@4cmVk^{9qk2uwA#MgPw|Qr1779N=L~h*Kb@acmJMl?
z%1JwhsbJ!iB7^SUzo^^y*?%F-2h<*&^Kd;w1P}CITU!qA-vhVnISBysx0K=7w2oz0
zS?p!su;>!($%|9Q&*M1di;yLGH@{lRF>9O_f8~+3e%m)oSmqOXeb;J2W{O2&|6O`Q
zngsX|#t>v-d}^`+F-Tk;G}2w4sy};kY|AU5A2T|&6yG22b_rUG*eY1ZIyt=g<Q-86
zhQ*ln2}N27w|@Gg_UUs7>CZj2fat<I{*RFTE(LUaUSj!Es!fZZ=>+%>)!a-{w8`3n
z3jX<SP->#1T}PjYsKKA&e|%a9r9+|n)*rv)-Ocr~MmBvdf8&<+_pB8?>YTHV^yeS8
zO45RLj|5BUOK(_P>uC<Y7azUrZdxTEAgA<#Dw(&hm-I-up;S;9ndDE4D*qCJBIL|L
z7Qx<6_Fmb%UQO_RY_R5SU3wRl-b9sf`uL7N-P_7ky#@<5gZZQ)PBh!brru_8U!P-j
z=iu2trkGTnlpS4D{G7umlgS|O1qur4dA{a~Ru(jWBT?zRO8vkKDo8(Gzmfg?hj3sQ
z2GfQS<f<YC4Oslr>$D8X_IVYDZ1OkLkK114xiB@fZBU8*E=m)7_tt&-D*Ij^L^uA5
zLE?zx&u^bahJW_?u+k}(#+E0Z6>6uaZT~Yw)8-OD6Q;Lx#_Y=vh8lXi1<VG_O27M8
zD3KRfGe_S9jkaOA)6jew#%`o5wyU_TWox~Wz&UpvrL?kR;HMav8&=9kOSaeZ<$1os
zeMNS0g22wQ{k6l@+^{*z#*gmL9pCoBSg?NnETVcZ*5j$OU+lt*V@8~HyTOqhbx2{a
zhL~F-iA#CVFZX^pc3z9eHt;-cb4gJD%Nl<p;mlkgelyHlP{~0~$-tMZN+ZPK&9+U<
zv5r3_xx*q(=;s-dNc*(LZJspKbMzVLltJa<bf8xeXmqAQ6&1q8NIHNDXpt@?^4#q5
zi@FFMSer0j1Op|AAD^tsT>rReyKlx$U`W?j{2->%qK9B$ziw>Z!fUoYAmOFHHPIZi
zt&!TdC-U80BxCf}ryGE2YCczIw_W^n!568(uLc`|^k2a_hCd@S+e0Cs3yM;}nypRh
zy`6y^pu2Di9R=W22(tGN#jR0w<39uhQGV}5RIMABEE48FL09L5{-H~+qpg+kb|XyR
zmE*3GsI&1FmcbU3NB!L+D6kgg|DKM=+PW5>r`KD9=buMU(|`+O>dMSk*LN!g2wL~N
zuz$7DK(=%Jo2}ONwxmzrfMk4E=@$Cu{=A#kaKt!|?kJ^!%+PO(2y#m_o!{$UFqm43
zUB(YxxZPCDB&68)U3e1X(nk7)t+)F`b<BJ#ux+v+(b#>UqQcF4M0+KZ83AYB3odr%
zP*Zh#kEcf%FuA)=KZI^B>v>%B30K)sgK)cPVZp?*)Yy-0VFN>c&E7!ss*hOG(9pME
zQf=Aq+xYnQA$Xo;oJh%$X>9HPt&Q3jM11WGm0E5osM+HARWfmG^FZR6;gY9^;fJ9t
zZRevp`84MBwSb{~cB87fE}(Fe$*PA-`ja==msRu&2hLD<GebQt^}!x2I@g#axqF`J
z=(nLF6<h|rUi>`cxU`g@XSnFD!O+~%FC+jAay4O=?V>U=RidnFTH&q#@hc-BxEQY6
zeUn<R%kZOXLq%zy@Y;!lC4XUAg_9^Mk@&FPoLiqbGw{R4Fcn(c&?y#!42yRdXaM!T
zmnj8SK2EYZKHz_zlUGC>{j(7wTou#?u&_vTjs9GZ%8(&?(yL2Lq2bWLyL0_XL;Is~
zA%`MyshpJ><yHCL*WprMG7h`f-8Y2B4*pU1^q)3ai5m!&ZOUu5WxptQ(wjuB1X?v)
zo537@<fhSUPjeX*+RR$y(56nmwZY^M6qMElsNGUBcD)G%4&FtJwjVJ0|79g+oLc?O
z&R%@Z6em^W`S?qn{d9MZ#k+Uh?-)cQqLMO~=jv~nONI8qcAwq5Yx7)dMyQ~!p~3A2
z%jUB`1YpANwG?`Cy`EI}+%Tz4Ehk?>#gL@AplyK8p~ECd`P^G{5{52e<PRP?D?so-
zCS2RK+zaO1Q)G!Yq8t^8WU>}IcpGR^g?68dXw{r5U@GkF5>Q%v0u;tNspV(D2v<Z*
z8{S~c`0Zc77!5gwy4c*ttNV|f$a^O}&R9-&@~dSU@to;fiP$mv%Z$v4{=KrMq9s|x
zGZ0Ou{xE%Ux<R7D>Sqq4YZfnImjQ0s;lIgB7dDtoE~T(t>)}D-g|K{<+W%K+`_Hu-
z%wQeKR6ogH3PoO(`|>pSP`Ao0?N+`+-Fet`egNBxW#)7QANbt*uM&g^REf{7)EBEs
z!yeq9yxwA-y|FbBAj-C=|G@=!r9N@!J^V|lS-E8j9(PNZak+wM@TEG0GkGf;&;C=Y
z)V*z4jJh&;xj{D(ZuM<nQcQ9MAOYGw@soHyVO2EdFvuo%&g%cmTn;a%T3LF`j!-A*
z2nvYgZYnY0HXGF2l!+gIK^QTH4@#_>`48c<m%~!3hDcjqFIi)BnUc|_1AX*93kYiU
z4>2Qxi8rsYqqkw2YKS0vX6un9U1{UnC1|7tRMxdr3$cIJrmf+Q*F!U{CE<22-t`(p
z`!0?c;I)&&U>R$CKGokYwpBaaP(jZ-9b%k2n$>8>qbkI3W@a=4pX<k7gvyC{AM*@>
z<OQj9-1RmJQY_Y(RMzsFfQNLVk?4EBDX1$dFwPf|<Oi~7JOA2()u2WdqeZ9^$(QLy
zKC@dAyl2#-g~;x$N&y7UG$1rH2JPkNuTBh4xtas12g7(#*Hn=$PmoQ`KUo^KJf3@(
zABY#d^u3}qN_9?yx8Ga?gGbA2tm$5;G)97>NF|?J9m+*+Z1?r`d%cA4DUKa*u4z?l
z{`qlQ=;G#2e02nafUz%<7u<-Pqoji@^jIbUch!<?T{t_YDX4nQjEZ~8j8%U%Jf<NF
zUtS`#&L8UOksjS>C@6XQN;^U1AKFy2TRJ@SyK>vMMaO!ZH_AzNwk0}4S~7OIFY58n
zzYfZF{oPMzDQs)+wT(z?Oo?sS=NS>Ce=<X_<oq)?Jg}j90^bW~1nL+4m?RlqO`RwP
z@$6XcEVgE{%)1mn>By@pfl6j?(Rm*yk8o{$`@bWWg5obYmxfU+2Rz+5OL#e1x=MRJ
z?g{KJO&Ca#IECBOrHhQ4u8rlR%FRhcan_N!5Q!}JU!MD(X^f@QJxjkSlI2Wf+E<67
zUFnhvtH><{`m(jr_qKHgaRN&4)CaB0w!jH7hApOpBT+Gh63q|GG#C~`RH45A{Cw^p
zG(=!UP&K2WN+xO6B!05xJy(qW%jZq8<LR-`?{@EfE>*Y6qCBjgHslw!=Ov3-Z}pAW
zyrQvXGTv+>$P&YhMT5c$QAG8PUQ{f5Wzwh9x;$5VunP(|Xr_YuP{ju{pE<EDz_k}b
zLosM&ou+81S`eQgh&uIp(p0J~IvxITMT#eXO>l{P2C&9~^tL=5P<k1Ai4qn&;EDRt
zc-0vDsBcqKZq`iCX7mu}xw7@icXw?IQWNWKP)ARcRCjo-G@Q9Cqv2aBZ``q3f>q9{
z_dE;v#~m?2nj$$FhQ2y2yw08KAWR~HOCjg{MebcJPyZ^65jk;^R-=jYBhv9X*aT@9
zPo^(a!$T*!&MX%f!|Ns0sDb|4q;yZcBz<`3ORtG~g`D2GRege<qpv8Jff!9dR<63n
z>I^9f!tA%RZ5wK=^lfCI=QWW@;H_4oLi0x+xq`g;G{*YI?SjoJ3m!f`ub#WnQujW<
z+W?>o;mEKY_kqg@b*;Lmuy1{GM}poH*|<Ne=~B&rLk+RW!FZh}WPQZ&LQVaHV|TT`
zqIYmIx+!VR;W8E#9nXY$yl!qNAO;3ikjo7_j&8-3X~f6ONTR*utTn{waAXi(9OUQr
zSRc1)iBlwUUk*M(@LsT9poJMM1RxpP5=U_sX9l%0R<d3XT>By59{@pPoYp$x96vjK
z7XI3Y@9c*|sRtkH1iwlpw3%daa_R-&*c|)vKY=mD%>l2>kJzYoi>Y>=`Tkyl;jnr9
z)_|$WAJ;tX+i%A8vN|c1P)Un5bwb8&jeUM}>2J6va#9a9fU*<$n}#5?onm=(eeTOV
z&y6JcEdb1D9eQ0M-Io*lohu8RXB&|a)l@aIGo`X)l)R(Phv0giJ<_jhH5j=dkm+r}
zGhvx?8pSykIwjmS?j2fB$AD$YTkIKs81kIs$;5dQ=N$RKPl<y(o0*dN8=4DhlA($R
zN39Ogi-t|KX*Xh5Fq1Rg6T4TKAcn(-l_l-RH{XMbjXQTw;kLT%P|8XS1Cgn$lD}^c
zB|O;bxNCup&19y3<%uiSI$QZZFc?KRXw^#_+ds0vwC6QbMPA^k!<K6mwSjaA$xE5h
zBxt@7$!TD@4uXSXbHbdZaIuCBgZ}3kX%U^Z04Pe|S>5AyCQi@Baj(MwZ&!V!9Y5|v
zc5?|xdur)2aaf>1KHmGKRN+|bfZwZ61wG~XJI%_f>_#yA5cGx9P@pNu7)bkruIfC|
zkXdjdSF@ddL&c0b=V?r0S&sq=SEnwMQ#wwM^~sxDj~LYQ{eZdaF3c)z`z^60yUwT#
z;OJb)nCj0Edw(m_{7GT7Knc|puF={^O{B!F3SQ9E3GvG{N+q<dIYB*XAFrOM-B-6y
zu|zu!5b}!WKc#+77LcJ`T~t=J&U8AkvCmM{<rh3pWSKeewo!+PCH5nvFz2R_x28Fb
z5b<+$duuaFoo8^cHW8U5O--s(;fe<wB-UT-8A`4V{-QP$SlO1s<b)`iE?y3QN|i-G
z{N^uM1b!Z$Rvyfy)@si1UjMoU&bwx5QP$Y}HvV%gH?1hM3mG8QWDi=<W46q?(~FZ4
zB+=H56I3&#S8h2tU8KATHTPZYrFm(qQ)5*Ow|^Ce;4Ueb)*$N*z#6RTpaXnOTjf6@
z-}iV6OTV8;EZd@u1I#~}a_0S5S{rE9n~%jQ3B?Y-IRmU*6}P^zSCeLc^aEdP%tgpb
z^n!m2v^}#VW&Knh7INauD63s91nwB=|0=sOFNxoyxbZ*A8}f$~H|%~XD04|6+xSn<
z9c5+Sp3K4<s}2;s{S7H2d|rYx1WM|_TP5=x2I8&{n8>2_pbaufZ{*gzf8?KQdK_uf
z?8^<Ht_tW+tx(e5Wq4>l-tBq^kps~;KS@t_wkk^p=rXZ$mN6QM(gJw%N^-U{ce1C>
zc|La&P)L81T&Z#I@azPZi(DPPdRci6of)XV(p_~coYPCa+?5Xj=X4Beh=wvj1K5Kx
zjU4?#Z9rWDoV#16u3sI?*)+R8_}s?NiPzIP&ug2p3Zhew&=GC$mw41QHkjm#>vhUQ
z#_$T+Fi35;dln_@o7ytryMWrgs1iZddDTXOPg|2Q(AEBm<t40L7O&r7@wi?iSAqBw
zg~#{8%p;xLx0e7T#G;W)?Rd01;Ho?ZB^&mHuV3M+Psorure%3eFi0ltkS#JuvYv~3
zXFTknVKaKBT)G{(^5p7;UaA>Ol$=qfFs#bBu~48HeD#8WbdQRLB(7WSVZjLf5DZ@*
zU_<6bazt?WHm_KQaRFII<Ii18BDHx15wvybMD|oZ$dkMJ_gHSLQQoUW6dVUE)(P8d
zKD^y3CYj9&;>>!l66)ZrUjoVsSVlRKX36aiYIC#KEWixqV|~5!W<e%mSy$|h^he_o
zhr-E#sv^(kUP|HBranbh_Sly@{mG!`eF{yF>c*39Ff`jtJ%b#Kg}qScJykeZGaX30
z6kX+PaB&c~Rozga5h7+Kg^_GMv$$<LbZYU<Ha+8>YzcKAS@=(z<~Z6L4rxQ>@+>=+
z;iVs^(l$+K1oV?VD^nY`W4(CujZR(X_uL7c*CPk~?dnsX3-!=`Buhe-n}tD!2CjQ<
z`!&Dx9HO(PtZzz-nw8bCQ}BZAB?DEA1_mr0r`aI&#zicD0*la1e(s5QRWSA8QF5xL
zf=N1_%44fj<0%qJ;(nRS;y`yGr4~Mww53UmPQIUjY=Q(o!^b*=m<#&RdCbh}`+tR)
zSSQ!kz1dOob32)su&7PIfZZGki?8<hR^{D$d*@za1)PpHp)WduMbd!U5~D`#Nn(bU
zVp53(W0NynY%mgJ;qp_vKCJo0j6y{Qlu$xgZ6nyEc{irOXw8gm&<EGn?PN4DrOuH(
z*?+o!^kx-h>H?^BM`pQeRh@D*z{|(46W7pBkHw7Al^@=}4XCohjepn>P~Z+q{B|jx
z{MWZ>5Ss?+=@CjKx#PUW+k20H?!V`~|0T5<Wr;F|AD1oaG-Y}hk7QEz_Xpee#dd(&
zn_quQqIY8?vk^b)QZr+iaV^Y$oO8nE1vv}KZw$%AOs>hr#CF=U+fCpMqf2sy_$!j%
zAD0#M3uUY>LV1g+7^{+AHC&pG7Spm!!bCofX&DQ0y*Th0Vu@}CncMd3iKM>R2#&B6
zFz7d~o|;ds&@3$^K;ij*)Aq6vYXp!4+~KuDxMt)iE^j>l@>pYHA~#i7@;u+R(<|t~
zK|9gqnuIS&8Nj_;o|Z{P(I&${WLL=}2}^KRWVVJ;WDW3PZ%%w}SWL?jg14@KE8c{r
zV;&(O(7KrZ=yH@w7Pn(aBU!JZA!Kjp2S7q!g#?tN2$9)ZKHIJS=|*qx%aUy)c(a!C
z80ltz=1nh?2&gX}m_d6wDA<DCv*_ATEn&=MDRe<C8s@OIZ&}tB9op<Y?cL!gm?zYY
ze?8Hp%Fpnt0?c|e3S777x3J#$5F;-gO^=kWicg&r4F9(DXL;91*c7p5V`5Vp^KIec
zsgWO&iW(?pS`5oz(5VqLO`xxk7ZK^#(~mN(k{Nv4*~?p{2{)~G&$Gq@rKB9-1)GqZ
zyxG`H4Pay^3C|vD>W~IQZE1kD#kJ!HV^|u;gSs95{!Nj{mAT}xS`GZ3W*yFCHkOYY
zGatx|*G^7}*TcSV@27!}r9;LJSDm6Cr4<~f*PVOFHiC=Fd@x~om$cV1eXDrZI)e<Y
zi4rCAPTtpezLMqmk>&gPF^a+}huQ<{N@hcBhA+IBr3XbV$6Oj8i1@ty`7y-in)kb_
zDZ|aM&^wbQ%LT`J4lk}Z@Lz|dp77^qWDH3+9J0=^0*U|{?p;u@?w-~)R`)kW;j8N;
zkqpm1schRrlQ<9kSq*jHNlcZ>!{xbt_26g=yWbS2rph^{Yg+5(ock-6@<nfVPTejg
zqRcmK(6Gd_yze6$LumOdRxVM9TTfDhL!=)5it1DHl@=PUHN2b{q<O>Vo@7;T@}L5h
z2OG!c3ZQE)@hYZg&7llBlGq&O{(!UGCCQ*DakBeC4Rz;`V_*(gTisphtrzdp%Iya2
z_(rSkV;oqwoqj5*n-gQJLUWcS64tY1Z-~vr9&9;#Hwc8a0!k#&Uz#zknPHDSe}D~p
zvIeHfVijX9cVx6MomKS<^%q^Fw3^QaN917@BKNO(W_tI@<|XVL_xg4;!7xqo&vl|X
zGkoik_v<NJa!E7_mLy6ez&p7g7aHi!e$@WYzvS@0h0i;@;rXApc(!>fO~s_%@Ypg{
zPU&cOnV8-W4PCenP2|$-wg9#-@$4FdJMc#A@2dYYHtv`woAAHibTTN5Ex&%7O0TRf
z@fH(fPfH|*#-^hb7u6)woR%2eOq_&Y<;r0JlCx$Ok)pcG60oSX^6}StZVAZwB(;J(
ztXGYgB{=O4zq<N^Tn@UvhxvqC8@MPIv|IUHoo2%$=DgfoiT>w<s`k%7CY#QmJFRW}
zwxknfh7xMR)w0Z_z=Lk&4aEpQI?ReANx$yylf-F+NH&+tS2623Ht^tO6QawcFi@C!
zlhXb2PM8}eEPbUOs+%iEsSzVRJ8IV39AxW`#N2y?gn|%3wi#WEyC)`Eq|aLgYX*sF
zc(^%j^?_;VQo$*jE6AzG^MxD_yWs@!U0#OiTuv;Td^aenZ#TB&LDnJn^6q!{Pl?fq
z3bKkqxYi+^E-*|aqD!W@39t>*)ts2U|2j?q?1R)bHuEgM6-P+s&YP1Lrrd5Gij~<d
ztB<<2eer$IjgM;4TQ~+a&m7g>qFFmoYLaKnRMnj!zvw3(tS<rphw|oRBJAS+ne$Z-
zh_wMY5xkPy*&f6rm&e;cQ~ll>rQ1gQs!jyMOsrw~k#rwMUb|DWX@IfO)NKYm<6n)S
z>zMF#W^59+0#obdC#-#`r|hlkhrbwScGGinwHN)YIyYyr_}qPG!YMs(QIJLKp|F5R
zJ>62R=)SU4`&nQ{8DoShbd8?4NX~c;|J}^nmonu6qIVsDvOay<d3hDu+awaj(~*Az
z+P}mV|5Eu)(J2;uO~(74MQ-UHFUqG_SoD&lQV>xNiIKGSnN4N23Mto7HXRh6i(vs_
z`AR3PSU}#RiG~lNc+k3F_{z(dFABatd<7c77&~m*L!AMX1Vuc^dajta<!h4;a4=+#
z{;`NX)a5NKs{^`~6yAjl?=*{Uss>a(bF<hn4S*g>=CaefIt`IEdsA*k<;4K7R;(&O
zP<!HYJ>KyXg+0$h%ln>wMGGfl(Cebugt|!~9Xk0(kppO%`zPC8Yb^Qo=>uvWTl28f
z>ijCP&J~WUCfQ>5tA|P*ieeZJsNVxVDdjELp!Bdp$J*tzNW28m{%OB{_Qx=wz+qDU
zoo)$jynN-HNwme(^H{0s0lEh##Wsy%Q{>Ld2S>}7v7U6GP@a4H%|FaYEmSMujBy=4
z3yZBX4AT~WeirXX>aRbKr7&`1LE!Oic@^3~oz9M_q>@%wkBp_rBS(|%=&|;FdlPMy
zRK&GyX^=(cgBXKD^$R{rebiK}PbP1pSkCH6Lu8VV6Q2qa^?g(_&i$Gx^pb3Bsn2yO
z@vvY1H$}n3n$(g?TUqixxay)eXeImWJ{<(ZukK0A?8?7^^fJz<FLS;_{)@a971sD&
zgh`hQWmVDZ?w}jbNOl+hO_6paf7Z#WBqN`QtiHGo&st`jHozpI;HM2dtVJHn7{*02
z(w0h?5l8jO0$r-HiwB<}oM3H!YCe6y817fnbCLDan_{W`EQ=ZyOn^#SEWW_E{7UZG
zfW_s%`-Aphko9k2c8)l_>wrd5vmsgW&U#6L*_v1V9W7gFRg=NJNSL{LAn46w<Z>ZV
z-*^7j=3`?ZCAe>VJ$iBlK^YZe*DJWSZKm{c2h2vfV`DZXn3CYWio{iI>NqgZTlZ3-
z=JICw^FAx}1B~je0XsS$EViejUypkSX<#hczUl@Bb4p+vWCSz9>M-m2O$pvnr8TmI
zRb+jsxzC(U8h{8tOs?Rc^{>8CuOB%)Cl8krE6CZqn2pz~&kCO#Wg1esm)FFUB%x0p
zROC>|p|jB0O3aR)kqSO$&aY72f!jU~WPQG+;LINO))*Ec%%WrVwx1s#L)W*^(+LxX
zpohxB%0YQe+TR~SwON~=u+|5A4)uqt#dVe3QA={XT^6Shvk!yYW^^}BV^<TD=tY5A
zO^J$4TDCZWV{hKikE^7Ypl@|V54l*qq`sM7LPQVmu^G2^IjL~fsAjpVK3z|0&ZqKN
z0sKs_j;b5ckFK`7uN;ejAa!*}&FiL;2CvtTYB!*QKbSkDlES)d&4d#Lg<g(Tg8y-(
zF{A;aOi<_x;g@bWxl8cdVYBbl`J(y}f@hBx)1%R@p4iia;`k9(CqRV(POka+iK)A6
zhDmFyQdJNZ;5TM7pzVg`J$2T<Wo(@*vuX<&zzOz&mCr8~S_7j>$<-DHu>_1A4)RWo
zb$`V$aA(u`YURaWc>fU^dpmro^wXIgIEKe5UMnaJ^5x%v^RMxT!ZX_lgEq(%gulf>
z>bzpGbJJghsOKpwl%I7}s1c0a_Q7zYd!bBOT*t!xDYFB6;_1cZEtXQX9vqycIWLRx
ziaPPRK_@mQ0ZykUDqlJ!Pe<Cd=OU-{Mz=c*2z?x4JkS&fs*dDA4Tj}WdBF}IZS(FK
zbw;7_Fv(o+7H%-aaoYyBjOe|n_J}oOVGs}+o8N|FUg#Spo=8k~b^0JK2PBG0e3b%*
z;=@vFal<dpEO<Gn6Y>QCqj!vubrrS_J#*Ic*>I1H<tsy8FBjQ}Wgawd9(qRc2W9Bn
zAc1EsYu&Jf>i$!u$%pqf@6%B|)id*L(Kia=_hh<*C$X5xYWrln=iu;!l-On=SmMvB
z5evUuB{`UmCkvCk?+;yFMfN;P6uCu5K`A9li4^DcA3f;1L$_J+Su|7uUz$s<a%%(x
z;lJ4R8O)pT^2uiycl~PTn8D?Q-uH<nHO?s;Ja*4|4-`zH#c$=c-|igP-lS8aWl%C6
zGZd-o+^UIJuCK89%X}ZzGGOr$7;UnNSgOIteT+r2^A42_H5owSeVz^3^V&huGs@S4
zG}RuUAPWfrG2){P4kGH~FJav1H}57x^{vNWb`k*AX@k;(QtU?6R*u5+k@yJz^z<OE
zM*MsySqxw^XTziaWsW0qGfOR6$JCH~en#)P?YsZv|CJ%6b`3t3C2pkDtm}x4?PlJ+
z)U0OZqarTvQ{^Q?9@1R!21P3iT=KLQ>Duos=Vg>mBV@^zF*-a)1A#@jfBqF;|F&?a
zYbi<emdS(fmp!ui=gPY40o|q~_87!opuzc~UFq=MZda;dVa<ikX79xvH%P4CCNysj
z8aohfqP@nzn=TSDra)4Otl5)C8}nEVbXqHaw=p^3i2*L`>xFkz1>OQx7Ao!5b3F`L
z{~_F^S_m^&W1Jwk;QP$QrgY3CSkf(7hqOfUVV`>&y0XH^PBKx1D!gzpDp*3YEIu|;
zX5G3Wi7<bT&f)?~H~>r1Alw!m7O45edUZa*GiaAh(TogN2EMN-bA~egdvj6IwuyRe
z{!oJ4#EyWyG@1#Tk$cD+dRxCwkwk1CaYeq0ZPr+|srrc%qMHa}lkh#yY^Rh0r(0zZ
zYZTF}iYrVtcn2#lS-8NrOFGYx>KZP?WzB5l`pYp_#BOIhord;u4Gy6t<uNRih|TRD
zDjlr%6gn4+&s-DJmUI^$2{mkW@1N3jW(`orm<YOy+i*fe_Bw$<yp|@%jD>YB2im@N
zaePQz5~ZiDJDrJ?DQ=7Hp+sy(VZl*dvjdx3e+SQHM9JRO1Maa54bsH2#PxF}CwGLV
zlu>RA-P(a#CiA|Q7M`o*>(ft2ynF(&5*_QYn#~~a7EK~8d0_9+nxZkHG;nNga%O{A
z$ZG;^f{+c?xLeEdoLOJT%sxiE(q`&2QS$0}*h~U$52#Ry1U5paY@DCUO)fhu^YItp
zxwssgOe_HkJtkrfZsIE(2g{8E8buCg47kYQY$=y?kAo5IG+XwHQ7#)1-;L&ojR_}D
zVcJ;|&p?^rZg3kr^UurMOdUKP`<^Jv4MyI?^FDK~&2X7_E}gAsf87q>N)2V~^4bty
zy>`stdiigd{P+0Hey`yh8=<+eA0`ufRSue(TT-^wEnJTFePFeIg-6@!oxdrXzXW7n
zh!;62+&2tgad-nLVUvSh=GCcq*y_KH;c1{O*drIvCScE-LX&J6=#(~XI>z}{$+|TT
z5Hq8bNDtZ2>oYWQdybQkMu@!SF=;T)8&kXQ04`0Pj;OKTv&6-^L-i{C7F~nw;w1Yc
z31-`?(Z@RtBvCzQIxW899EcIfq<WD%1~?eC(eecKLjd2|!ZT1MBxRp<Uw~&4*qu$b
zjLu*b*ofYCcZkP<+n&}UIt3unhA%|mSXC)Yy0_JEwdP@V$8t+maj$5np@g#6WP%4d
zcpsOS{CV4hOXqFLWT!1?E3Y_n-!HAgQUz_#7@f(~@^IDO-F5Pj!=OY$!D<19Iq}uT
z{i&)G_QJkscXjznxmtYfFDIYNX60Ps@}86~6I7v!XWcedL>yY7C8kfH8X-4E>uskb
zOB-Kg%3mnT0}K5XB1=pfJ|;i6a;xr^V2j1^B&0Wr`8DUoR%<c;>Tg)oA6~Hyu-4^!
zQ(UyRuhZh576C0<G}Ad`^}iI27(Vw{8QKNW`J^`%S$7eg%42QqL<?#sQjuD{HRUgV
zbogAN$ME*G(aJ1n<D$hiSj9x^jAq(bms3?>lda#NT?^IKusVo5Y|~Q{pB2A~C5gWg
z&?md1(G9aWF|AA#5Segz?C#5~@QJ=c?!6K>+sLX$p+O_pdjtF8YqUsUla?rQAzUOw
zE^0_idbTvhP}|z|enZ1{&(p0tT{=UqEoyX#)$p`YW>*~zL{pL5KAi;c$Mg4E9l%}@
zTa(fN;r$@eH$?3^MkCk`=jmx@U$VX1G^_&4KRD-bxn?@Cy`*_3WW!0{wUUrtTotO)
zz(Kq?XO5mZ`9^_w_wN|~_Z8nEq6=R~>7qls>RG*@^=}GsB_%%&`IzS=Evd>QJ|d(O
z-_i85>IWSC$-gOF|Evy<Iz5lK_I<ur{GMC~-%zK)vXMab&_`JQgZgcxBw3*`_%w?b
zW{@lFXuE3QUbuuwmSl$K8@A7pcXr1Mw#cr1*D}<{cgrUY@KFECQ^#MaV$}T+1ub=n
zpb!jx^pB_QBYTG=ks5EA*DkW#$v&oRrcM40>c1-Rt#(DqEKT8I;G~2N>ub`K(XN5Y
zx|wg@?R2Lmrqzz6!m;FZv)E7oBo!hcEGIcS9qRXaVhf4^c{CqSt*vvG{Dsp#Z<H>=
zo)zevHPxvMPn3d@ctJp!UZ9h6sO&h@Tq0SUIn4#nK#8?UC8|g|Va$vje2!%VY1fg-
z^Ja8qlTaam$3zt=#UzuRFz%3DucL0(bgzoHP)pE9JE$#yw+UdBx54tN!wttq+XPZK
zHG8Y1sZFEXQI}hfQ$N-ejL>}uIW=_auN)&CDJq+DOx3inA75FO#KpjT1+)$KmBXOL
zsS?oqt)U%FB0V-@P0v4fcqcC42kDVll-P37m;961^>hf#BRA7sFZT3pzr5!@%K8$k
z``{FH<OY8+r8s-Gwz}u8TwBR+&^3ul`qVU+LTZ157)v*R%=-22!T*kt<yYrU=9d4k
zUo*<yEEj*+uzloDtafZu7^~56-vCRlcposRQOm#wN!r@H&c@w{jz@A*uEh)n>vQ#s
zssa!KRK`8cdtvoNj0Ehoht1-1({b1<VCIy_Jb!CJpNfS1q~!ZhEjQ~5Wu41`=?Sa>
z6g_Y(Cb@MuaKR<zcTjMEQ^XIuD~t?D<x)qWVafKrZgSJeK5#!<(%KGmUewFWpNn+Q
z+`ep3y<Qfedp;djeLa1gymrtOFRW|PprEYMg@%<j-=#!M)YqfxG;_BvlT%KCtXgtb
z9qP}nd1_jo1*m*@Bdc*E^Wh&l;9MQMx|+e7!SciQ1vo$HSiyZ*E>;F#{J~xi9Hk@W
zF(nQHhngxlq0;piW>qZJg@OS;`>#fc0X61exR5<`gi|7V8AB<czB^ve-S+<@$q-Vu
zg%me8=5f1GZKvs)VO>W-fXYW_@>OeV{o~H;m_WT#n$DB7vM8D?mbRR1^W}{DsLPen
zbH@wx(u&y6jM4XXV>o^TaLDp^{$6A3Xm&h~r_kEE3ZDWHs$v#i=-o~+?j0K3d)Ey|
zLEr~7&DQtbkm)dikC+8ZL@NQ~y{qnBpubn3k3F+UWJJ$sd#PC#sQqYpEiY>{8Y4TN
z>UzC)k(x>6H3)P~IA`SgnX7Z}Ij#ZTu1(kZZ3#&}oLc3h(LMp%#N8=eXUES==wHW{
zA_sBTj!I2aeA|B8MiIlBc~Pe>U`KV{Bd?8}iHU;!>7Xacz$j3`;zDbyj+W#}8J6Sg
z(^?$RAiZ?_H^tF4NAh>e;bnih4wu2cC<vL(8(tk8N-3+)n_Fn`5XkZNXVsJgXL-ZZ
zaf42IsiL`t8XGTHG(_3tYcS#9-XSd~3j;t)gELfF!eQX8O%^VVv#<YzPin=r>|xle
zzPZduw~@KfWuBy{!;#K)8TsPpE{t}S^Zb2U^KuS0CJcglHHL526+I^0crVIrSc+mE
z6?UQ6uKCJo0EA0<k$i+sUrwlOA4ap%qPY8;BW$+sZT}(&W27OY)oWK5i~Eov7u+!c
z#9kYi%^a`BFapFN1}H}x9mwQu8vc3x8hq)l%wOHhJbbtQ%*8jxW^cMk(sSHryxMXQ
z1wRxNxg8s-IECRmv*Ziz=>|Yv&!oSd+}iZ_t2}5Rv~c|;&1kIun<7HHw<Ky>uup5v
z&;kR7dO7;B6n>l7mLU^C7Xn<ooG81_g*=nZcYW()4WE$cHSRG-&5~C*p2n=QEd`G0
zbaQ*bA`q7{N0|B!bY{X~ultmAPb#@Q<5TAemNfyK+rHJZVIfSOUZ7-s?!KBef9Cz5
z?Pt*~A$qE4yQM8b4YA8b!*!EeAKG1Z*@So>MI&BeSW82^UW`Cxz-rImGf<&vPeumy
z9}Z2*+=>Aey>x4+8%spX$!ZsFT!<a*kHw<1gZGe^Q@i$P{{9~Im&&R55-t;Y6=uXl
zsL^@|DmmWr^CnPy7(^b?3L3ChbObtTG`fp+B(;bHbva9m)VzmzK7mrbN=P^mvi|4a
zx3K?qg$@UnB(9#4+%48%JLmSlDdtXoQ<$F?L<+)nYWN2C?A>uCN;AdxLzjIJ%fG5L
z8E8?q98G;=JJ_D{L3@Y`Is-7;&r_pOpSx{plVfBz-drBPE>;UPs%HXpT`|x5(YGlU
z*^5+LuaMm$;G(w;Z|e&+zFOnvm2faKO!*6&jSn9ORu&#s>(lZHC>ZyT?7VULQ5TcC
zeatA?CE})MIvB~Hm;6NXO~R?SWh9gmf)ZZRxzTYPH_?D}t(fiwPhb#QB4IEmOe}H?
z2$dOKej0<q_?&0@PUSc6KjZ)+_ob(_>BWy#5ZN-GQ09ZTnFkLMoxd_+WU9d!PGcC5
zxn5Ak<AGr7oAzV;Y)$yjVPIS|q;$!&B>KEf?Vp!==PGk>yahyyfaTefbQe?PVhC$M
zae)PYJiAUyVUxqYO=!`!_t=QQE%esa8DD+Zij_`CaF5Q&xRg&Oi4E$NFgRCCk)8Cy
z%u9<Pil*g-KCI7wQ*4rFxUO~b%lw>x_n+SGe7a@ceZW_~(mmO}?`x(>wN=8KM)Tli
zhZvnGOfSE#u3zGU{R8&zf!Ppc8{iqKEiD6>Vo`6WO*Cc-{`!*<5V$VVkZO{DfZeTn
zYH`+x7)J};XI$EH^uYto%hH%)Jh$Px>Xn9E8G^*3WWF-AT~1mo!dcjOti4-AS2`sL
zCCbCDF%wJ-Kaba&ZX5q0i2u%JJpb{h=E(YM+-hzLSq&aTw?9!@33hAJsC*%Cyi@4v
z3hO=Cbls<OIZ8uo15JP666rdu_I{w1(<<U&4d^u)yJ9u!61onoo^0F1)?szBEP7`n
zDV3)bf(MMhLOSh@B8k<3TxG%Sk+#^5+ABfW80KU0205wE&yNI(%`JZ2)Q|BF&_t?w
z)OsagbrFVFxf{dD`nw+d;PzLc%(P2D)T8JpcS!0US`1n|Rz>k#uZ$?}eEEN%9;N*9
z(;xcSK;H<IuNDhcA3)o{-sAInUr4sdL3Fw`(fK-e%QCgnp=)uG4qLx=eZszVWMQwT
zW8XB2M>$02%HlMDdj67oDSW~J6i+JZU=doUVt~NJhGfF}8<L?%LF+=D4*z4pMA5be
zv$KevNtv_aLJ44tgGe60?IH{){Qk@)VYM1wl$WzsG=HI)aMjP9LuQQL#y>)5#Jotw
zPwN;PGoWhxx&8v+UG2u?ST*qY2;Br2BX6Uyhm4_dS~4yvr;==5EXO$G>NKW>bF*cj
zewQIQk?pIQ?wdPmfmjbuwIOramUNxjW}Tar>#?yM)V4lNa$h=LbHNX>b_N$J`dKR&
zeWCG?QI*?YLJh{8*JG%YtXy5D@ro5=>t}=AMy1jdg<p!Axwxl%G98TtHYP6)dAsbp
zm@8Kk`*z8<PubA#RcV84si+FV?!b61l*4PM@X_Zr8MIGj4R~ak`1D6Bp9)`DVUYnk
zFY#Cd_&Gq~S9S2r;M<pEet?>|p>cP;C)v(ws`JmwFGB&PVo5}9WN`Q_0=rG-Z<j~Y
z8rL(fUQJv695<iPo>*6;Q?EAM>?EHO6|Bz1A56_YB_n3!JPIGv-j$ve_%NjdEkGcX
zTDG`Ua5<>I$D&?JmcYLS5^=_lvKHBhS94-xW(4gB@lM;$d!@hVv<Bsb%C?^+{f#CM
z7iy4hr^2a8cxS=GkRG`pIg6r~WVg_h8<kvEYZF%XZFJcwS8F+o?m~De+N7u)8s?<J
zG$PjjkA+TG`*9$eZhn1~r)8iQTAxP<7+WU|{4&Te)>3k8QPa2?=E^Q+*zom@y`gtS
z0-W)pCP#`B0dXZOq}I3$DZeS2RDO>BETrIKPG@|EXeVAHcTd?eugPxWFP3GAMw8Wr
zq0$r18^Vh@HF)Kiu(nriBma>DAQWBh9Zi6CFXwtt#qMEX(k{ot-JMuK?k~9V;$-?;
z+;56_x8u3v>RV;J_FpOf{C~|zpyqz{1{!t47AOw08$b(~v~zn1iR9>N#MrN7Q4ve4
zU)dY{rueh^WYf8QMZkg`;xiaXa{fLsDDQQs0jn&k(715OCHg&TXDgL6@X5v4EsLz2
zjS>BFaZDPn;Am9N31VJ?|I>fF_xzvW4IX~7gvILxCD{wsPv0wU<*NST+DZnH+6%jn
zU~g_IbBuaS_KL$Q&3eBrV|WqHiP82_&CIhI6n*T}x1QGls3a`GH<W9lKt)8bVWJHz
zd5~`Pwz6I$Q$k^Vi&{4Sto)%kBs6cOclR$q<)Iu`hO9ZrZbw%$n2XKcI1S}}`L(kM
zjuB(@v3P>eI3W>6^QU4`rwbc-oIhzks-j$)$1H~n1g#WU%u6NtbtlJ9X7Eo$A@~Bv
z*WJowne;&(`mQGJssAB8sL{tWIsEncXxva%avL@ov_50h`|K>q`dEx$nFqA-S;lFZ
z$s7ouAcLbeHInck8aO|8JEYKHa$>nD4A>;Y5&3tjgQ_I0MYWbc(+-b7<(SP!$+hLg
zLy?M*z7US&>;wXn%}*^AeN#;EGxwR5mv7Ki!>K{h{qm0>%wC#6_g7JgV$!pYdtE7X
zF|yt0MR1k3+AX3#y+K==mf5Zq0k#{h!6TETz$GOQ*>`uvu*~`@<rqLQwgF{lSu#DT
z9)*xfL}%q<$9V-tEfk!6TVR2pD}}jwXiJJ6)R_u}RUSeYp87xY46@0yi6>=tyb7Fm
z;?tSL3q$C4a~dyNxVB`4?z8gHfoNCm@Z~*W;W=OlX;r&@_Y%T>a1}!(oVIw@d4YCP
zPp|?6YVbHl!^;1Rq!6F}KVbOZ51gIWw5RIrE=32SP4|d7x#f%TO&x>qtOa$VJ3t>y
z_VO!|1{B{QGy|NM<F*?Is|2<@qO0C8X_}qWb~`_ez((d3g3*(M?z*|mzD5v22yS82
zD`7ztArgHgE99u?c?+Bwhfx1PuL1jq;@$uL*8lSQho^m^7Q$C0OeuKet^tnOwXx}u
zNi`2VZ=%p`MoDF&5TrjW<Lh>yo{sXikos)1TQvWv268ZB;<!yJ7&M#gFR$l>7!)Oo
z(ea?o5-It(e`M$DBFm2{9kPX|3z*=z<{W#xj&j5ZF$e0g!c%<pPdmSj)7$`h#Yezh
zQ^R16w_Yh4O>Yd8zDc`<bF#&$X?O07EXsQk1ELS0))5<^ByZ2WkhLixbgI02UjAOC
zMd2IM$?eO}t&z{L&7m2BJAvAL=}Y^fF3lmVbB0t9XK<n(?kET=u7^_%oVTmhMxO+Q
zV?eE7wEWQ=Kvg1Ybu?|LO1?WSdd_TIQk5)r-85lo#kU={PPmz$yZil8nOg-F^F7oT
zHUgz5|F6#8JF2O#>-P;+0Tl!Sf}*rgLX*%z6oEtn0uo5*AieiqMFfP<1EKfOLa3oP
z3(|}9UIYZBiGYBJ$nWO4_dMr)-ZSnv<BYTa**nP?$ryXCwb#m=^ZWS<!uk}1ebV$1
zZppWE3M;S)!Q%7pWZWcW-o2T96l$x_as4aeeEM=M289T@QQi31hv%oz7ZMX-IC1#S
zY@Xs%lBxQ$$Nmc%Y6CKR1tfzK&8@2Ohj+~?a`v-`z&u5$f@>B8)!W6c(j!)gXx8fB
zx;No#W~Ts*_vv_uN|c$heel*w_RSAoqVA>Fco0uj)LMo!`>5-2(VvOU?Wle&7tdM~
zuz##p<C=DvTxg#$uVAm_&Qq8W^bQVnm)@LJx1BV=6&2}SJ_d=s{qPjk12Sej+o9Kf
zA|ccCEq-uSF$XU<iB%&tHp0Ja`h?nzJ@ltFU{_ogYC28LJGMD&;DY5AQr$h6Sen2l
z<a|j`gqM^%`I>So&D4kedmlm)MDh~GxZz;U4@o@Y3X%UFVko$=X)Mrn&FZH2PCE!U
zpHZRvXK0xtU{W_W_8~GB$5--w3zY$es>|<eSr<kVUU&O7H2)b3g0t@lbqqnrMi4Uk
z6q9S>dUYB8GsOpadpYJX+2cFTre+*5KP;-`91tA(2Z3$CoppQVMnT&M>?9BMzkmC`
zpP2~=N&KMK{GFe2BU9Mae9(Y5Q*7nldV9kq^Kz&8lf^Bwoa$3?r<z9_lRp(G^tl)v
zB_<M;G1%NF#cs`m&&i*Yja<HLn7ut2Zrn92ZWe*n#}2N<H6>tDh;&QO9VHv5Z))u+
zUr+UE)o<w|ieY7o$6*ei9zB|D6W0$9tj8~JPCMJ;;nI^vis5pfQ&xW6HhL3S^$$QI
z=*^q@GaExoIYEVmg%nv$<+I7mF+5aVt|-lISdS$VMm1)#{q#HTSZ3-I-oFsHLt2=;
z5=adO%0hPwMKvL<{2c51PUJU=2hmm6XjAKZj#FLZlLLJ36qnRJ%kTDeqR<WWv2Q--
zo&Dy;{D(u!@kE>$Yf?t{SNB;1&Ri_~6}{P;Ww6T^UbmS~lUYG?zxVci<@nQqZ&Nmd
zYQ~D&A9R1Wc_iUh{AD*0CoICAEyFsop+P3QN5j8Yn9!2kx*R+clCYk-y0J_L3IgYE
z+a=nbN4!6_x^lQ0$XDxrc_fwZ2fWkcy41{lk2P0)W&D}Y(L_k_k*`+AdqP}9Fpl~k
zfSya2@2hKJ3Bd`C$ZCf@H`Sp2!w%ucU$d{aq}FyOaF0^IvSRnE`ZoismyYhU%RaK@
zIv3Ddwkf*Ey}@cLerKS>sMz9`qkR3ig*)&_1nw_*#eczp_GV$vikDsX3LgIJ_SZ`0
z*6O(yhbAlsI4kWI=TKVND7ZWr)XoD1lbUa>2>J81&JMKFyg&FJ&4dBK|KIT85oe3y
zt5m^&k?pKZ`Xgg8GO4Hl{?=QB#s*P3{Hbu3r3A!F9Ce?yHsiDY(!0>&#uk?oI&5qk
zb$><+5TTv<G7M1lA-xXKW8Ac6$q%C3IFmcg4_!=ePP)|aD)Sjw>hpB+WD<~Vmyn!@
zt(VsBtsKS{O#FnhIU4TtH`A|6tYyS14AIMc4d2}A=y%-h0)LV;3aUa6EllER8@?iP
zQVT)evyukK!SpeI6WY3FvE_Q9ELR)v?XG_3)y9SW_gO%C#cGDby~XPYwLk}#oulsf
zcTD+vPx^X#Xp9<P!O`{KJrAevl?6!uXb+xm%kTCQki>0|jFG6Za(zxlUxn<4IvE<v
z)wTKzzN+}b0&7%b2aB!R+ZndXWHwx)?x}XTO+{;JPnFn(K>NI;tV+~z@vS(^d`T|>
zZHU8xONmI)-{`8Q;dK&4&xhHpo!*F0Z3D<kZX#HGa7dH;s3mPH_p#T|aK=O1J5ujc
zSJC#&aQU|aJs#v^!~<awwS7{izyS6lA1xx%#17HJ$p;at%ehaU!FqzwF5m4ot|^Yi
zT?ss!=`p*74tkO~md5sXKDa-Du{d{SrNAPAowea*eq$e4E4DqdGk*NjpuE6enDWu#
zh{G23<AZpEE$^?#*T;%Gq#Xhj<2#4%PCVfL2VfnMHj&s`<G^O=|K#J7O#6w-29J@g
z%(go|9QU$S^cd%QcBSq$emY{BF7KO;PrQ+JUa>eJl*=h+C{)}e{_O2X*TqwjGj)yU
zF&Dc|+&gS1@j)m0e%8-?A6=^mLIC+a#!;%T?PSvy0HXIxlgRWRN1Eg#RxMafp{75%
zi0kYm56K$;jvlj(s@Q0k_20?ft*Kmbte#LqfC<zZnV!~lz|5^iAywWG%4<^WCu&ok
zaWDi-*iRd7VA*K4Oi+uP<;$?l{Uyr1(N^)elM)|5@>wB4wr%k`t&RO0HvD!4nIpEr
zJylxn!{ZKR!=D6sm)vU47A0m9(SMb3kX=-O9ZM$Su4J62q4gxIj+wk`Jo0N%`tWCz
zfl!a+a`V!OY3_O=5V|Hbc)BA-_bTv7n=IA>C+>%R*n;-Yf(#*U?O=tr3vAcU7lKu;
z-GC}eI0&p9h-FD8|F3&yPX*QQuZu5G<|*>u=o@O^u}5lbmwt6aUPZi*9o@Uh>a#K8
z;TJRVN&Qf5nx?#+Eq-B<10nnayK95AZfLKw6ZMmSCjT;BxIP_s84Ihl-aoM<p+2)<
zf#F|=8=r=fR1lgC2k|G?CD@z=&%nZyjkO93Q`4jcB>Q3JniPUojp*ygZe`}JWqrmJ
zgaJM53ZNUcHHAxf*2Mq-*RBtFqvh#R>>cM)!}RPsm(iuuuzU%49!ZD(qNml#q>^Jc
zAF}7E<5b(iXw9m+rI97De4;9le*K;QDG06@Nu(CdLKZQ%rMVdW;*%ohMl$=cf@|zA
zdngs&Uwy%I{J9j+;WU4ju8N#W+0r98c#;3!oO-KMZMh633VHudhc3e(JI9R@eq%vS
z1*(MR_B#!#ycm$<pl~{5V3|Q3szjMY38~^UJW#5rs$}6a#yXD}r0x%R9fPTbJnRRy
zmTDVuDr{-kmy~k6(G#;{##1ryq>_!NH&jos7m3-Z&h9D4*|xFkh}+Q>Kg;`!T{Y65
zB9^mM?XcAoEW0ur&sWj}^o(|*Nto>9;Gty0y$8xfsG%Xh8_!J_W7K%|Mm-eA`!!2?
z%aLp8TFhgPZlpY>>3+LT?wNMVKY&+-2ijSvDEs<(UpJC!G1`4otN8u8fIt6M>yuw&
zde!}a+yCuhb<b>a*?rK{+?V(Y=9}R5pk(FH@xrus!VE=9;c1}jw%kvFm3hN+Bs$Vc
znR@Q?G0g+D#!|+2@#&6TOrpi#t9!p*Pur03|AYAgi8*)K(t#hd_B%%|YOuX%m>Pc&
z$@cqJ=_So=BYWh*w~b%Yf@Q<s3J<Z<tvIQc#Y|Bftm>JqL3`15R@L>p+aS$uOT3q7
z>s+0E6WWxCO(<)|i1Vj2q>CxC%3Gyv2I71C(!MrEGP@Otcokil;<`=;!?icP4muEh
z!Z4DoiXU*E_c8pbubkZ?5;o4(^RpRmR|IJ_h?MiOW><m*_*lzhg6b-~OVbuoT{?TV
zEHaZ!k^`~?Hoiavt948U<r9;Yz@UN7d4OsLkc2NeOh8s|D6>o-m;l;PsxUFnGcaW=
z^=r>CyvR0m_JttdR5ZeR)VgQchx|Yv44u`3`B&Q_-EHn&06Tw?npoxb3gxo5bX*PD
zs>pQ!%{)(&)EK}uU7f0p{tfa?{m5};T|wy-5fR>r+x!92dMKP5B3<;%k~Su2TXPZh
zvWd4`bNKX;gw;xXO!Wl(y)sTwjj-%I=zi(lqRkS;W43ed2>LAc_sbmmc$iofhpd;~
zU2H}q;(K*+^l%`70aM9?EZ(1rN$dIcpESr&=EFrbT9;oZ7f+8B#o7MbDBxk!ocXXW
z_-s8_5E@jtdhN4)yQC{l$fO66T^K`h-KA-{%q&f93VC6)%wi_GQyt~6NUdxprmKUU
z9LFTn7!b)Z#@L|r;K4@s3aLVW1t^1=_}GYn<(%V^Itmt1!~EO{73&a>Xd6S!HOOW5
zU_G~smg>r}KK%6}I05PmlhkO$u5r?BzbOd_$rZAGuhuVp;{|om-*3rsH5)pvYAhh&
zT<Y)J2o+v7AY~FOIqz>E-)MnN2ml~_L5;dh*3lP@;9cpr3^%h0Gb)>oi(s7TF7Xvt
zDZg!b6xj^ojRD+JVzFVkfw{k_s;H}cEhbQ!%BZcju4q?^)suFm$GDZ1Bn*T~=cFVU
zdJ0c$438`ke0g-LsI6OZ!l2oVPhhX|PW9I2I%T!C#xF0p0H&hVMZNIzjOG?PLb0oz
z<kYmmsFR{PdcfbjAe;R@KJ(zVfM_~|I9I5{7|L%Y4O%uXEON@sA|4XsCiGzeeO_v9
z$y?MWqTm|(K1BD#IezeLx3$J=_l`64kr{g)cS@&xGUC~glZv_S<e5Z_;ndo+&EJ!n
zQ}deP@-qNH^*`fxEpq(?dtVA29yI!7#QaoHd#zaow~!?#8%aCBTcJBtCY^s#lRR8J
zM4jbkd?R-3ISQY}EHzf{sc%Dc*m}-V-i`__;9h7@4M@n5Y7<zUDOAVQi*fAVba1ui
zo#b?Bc<><dI>)t=Xu`sFMzB)D(@ee$$u3<kh1cRf?%>=Qt*uN0(cfeMeFg0oqZ^F+
z`rt4}Kk|~47RDG5|5#3^0g%%s`4(LYcOgX0-JWT$MfEk8?QdpQa!-io@7FIxQXz$5
zEk+yVCe|;DUckUY!x(4v#1~wALpIP#7S4zm09are-PtSUEouabX3{C)D%vIV{sri!
zSR3sQ(@;EGU%d<q#yAd-ig3h*Zz^4%fI*i?OwB^(by1|kYpVK(?O=6_7r(d&m|x&c
zw--Q}0C6vqAqeR3y>g_92FjNm<)jfIaw%Lg*2_hZMhlOjhkiTT%w;VMkY$zt39S5?
z#@5fT_y!}mog|I6?8?yi@NV569c+az1|zNM<dtv4KENDeMHf>R*F}n@U!;Mcm`7jA
zz6`^UTA({qs66Ay&CtESxmR|T-2WLjir9rfj&F2Ggg#D3{YqPV1UEDhc>l*;mG1`Z
zCz2hj>oqeAA=(tm`Y7SMGrj1*dPNy;$AW4H`tYfC{TP;do4jtM4N*uWIlvh`^fGdU
zc}wb`r_t6xG`4h7ka2r3JE-V-!VKRBL&#COj(r<h1W>CdtZj;RWw`MI0CfDkQEME=
z*sL@iO}4YlD53yaRp*UR1F#TnjO@uEJ;DR<RD*DYGco*ng)nZasXt7Zl6R<z76j{l
zEod^L$EcZPNJhz0N5+6~{Nrj6^&+-mzkg)PdBSP<^T8mi40gLgU~6ux8tnbOVvd$!
zdYl&%so2j3@{BjkeDUnzOUg9FyG<pu6=$`RtL6dFu)om3QSW*XHofaF9pwJ-ja5Se
zgq#UvXMtpCexT#zp*zhips5}8mwL#;=Si8Ek~q-b6*_ef81@`Hj_wE!Enl+ferE3Z
z=JnTq0A1&sw4V(f<VXT1p}ig4+2e{}C&nt<#4=yI=vUE)_Y~m@Q>E?ri@sl|&@~Qs
z5-|CH9`qF5<$qIR*98fN+7J!gv>5(JB50vaPJGIV7lYSY@bY-I8%u4(-c#?(VeeI2
zeUeZ@XAM<hpAx+V-&fKj7B?YZ(`Pi-_BODbNwE=Boqd6~V=XNR{N+;z5k*J7+!@K%
zx)PN0REy+=K~x3}zTn&e<JXqAIjNeVW^u$o3VkKG;2g6zUq4-+p4!uNA{d+-dmGD`
z&dEtseXZ2B=9H$Rq^v(jL_e)_>E}#k5pH1T;xhsC0{{ZlVE_UY)bxf8R_VyaT_MQt
zPsn0#g|%VX?v-q#en}1rZjZGhE`<d-pQmUeEsM!+nldT@2UTJ`iNVoA?f~v0rMyVE
zKDqJ-=qWAx7-6mz?nUNeuh)udB=a(&vHErxgV~}E*b$e?4_`L8K<{n^RveyOe=3+n
zriW?BK#zBr7hEKa&{RyuJd<wg(1y<mzw(Rgen~2PR3Fp*Nh8Us`d5(&+vfDWkMH)>
zo;L>RmgiJ`R**VwdGL~)2>~z73M`HJk2yjSvw&9oMi;NwSfV3+!C$sDz6kM9f8em@
zp9L1x(p%AMZLGK`z83pY<G1Ir9U@;$CHb{q>E--Xi4Z8X1gGq4Q!U&Ea28dWV_+01
zjIL~M#T!;sT~o0}&?qcfTRF{5h+!cjmR5Dr5=Ku2VhvKjb%2;!2E)h22Er6fW7t-;
zH1a)nuA4+m%k66=G2oQgV^PXJ%bjH)9Mb?6rX)P9Wuzo{iCF6(h7itS<f8?=1JCOK
z$<myu{d5nflDNZ2h=UJdoB&$%fH9(tMG$250;Th=E4y~hEB+L!yfE^vsDxA*j7r+H
z6jEp#Pm(q|Kn)d=FA@dJ)c0|k43skcw2I2rRJywc;bdWoVd0=U-j;I%TI%YUI!@35
zp9bo!#<~q(b<Nm~#cgg4?~z-N`M?$RW-qM<KUh!aUc?4rH3&o|DgV0D$G}~I8$QUd
zBz2Pf(zd1puT^!2;0eVJM@nDF`}!6K_=>l_m)M2xg~9i{Yv&>H12H|TyeBzG1E&#^
zU`py(@rdDnP7>0^{aehBM`F6ijdg1TYE(zu&tXRfuzP0jjD;uSD&G%ALg$&~WJ*gW
zr%cSETUdjxac%&#Io1EX7IKe94?WQ#z?nN^)1Mm_xx!YVl&|TYy(Ay9l*5E2kpqar
zI<5wEB2iC|S(-rhA3UsoGiz;Q3S;I|tOxl$cft&-V);D*G$85M8WkYJRP|(qaA-26
z4PW<b%GZ?1u#cXAB3HPwZY_&7)g(CpFM{<{E6-*azZG&@pMR<dgyUX41v@b3m>n^%
zf!ZV)o@S<|Y&fLW6qHeop*7~pFO#=bidz)`>C7a}WMamwW>GtXZo8?0bu(l$AX1;_
zQey)KORKuUMWiiG(pY=RND2pl?*pGvlkPw~X38W?6<f^LG?3*eM2ODnP_BoYUJuI3
zf=r{bH7wEaFUoD)YH7na8XwDSS=BtCOm3@~&vYbgnJJ0A{`%@u%N0GtLL3mv)=Z4+
z5c%sG5_TTq<Fr`%c3u`G_WhEd2Hm-dO10s4@~^6yS-T7PkAySDfCs5G%wDti;LnSO
z8pb7ye*mWy|AG=X0!t@R<cEPbv@JX)Hq&};w2IrHx~uN6-VBSPs_{IUrWK(v+@;X5
zOb4ldFu^TlCyRuo9#HAlxpd0E=Ino7d)t@93I#aZOtoO^{D+cmY7JZZDaXXtlSNLp
zv8el6+-wCY6?G@Y&=OOGizE3hKi+KR*0m?5Bf!6IbenBRQ&oqrAJ9aat)kZ4c_kDW
zSjlC!092|BYCr}RVPvDrhw!Q|%Ea=tUqUO-hRf6Mlb{kC!5^n$cd67|yMG-1Rd2Xp
zVC5?Q1>i1U{S6$vxXHai8^~a~JJ@o<U7@njllek`va_F@2$U+=aR$4NlWCe7JWq@B
zZ>=&w*|ui#ueVDts&HO+;U@a2cHR{d2}45HAX9#}ZTS=sxV_Fub!8{piR;Jp_N&ie
z5yIN;Aj`X^P|)x9$v+pyJ7;yLUfnt}^qAY{`E&9W8DQi4>X%s3v$6lo^-~ObY|DE1
zE_b-cVc(e-rtw`(=sIyI*DPZn5$2mOaFkMN)V<J2me}s1jpZT$b(y!>EE>pa(X2*G
zCezMuNfXx!S$D&Gf9TxT@Pmr>4-X0(F*YUI>Zq@Nu*SJ5X)8N?zGB_ih|J3-qelpv
zx-!N$Dm`bcv+(e>`Cv(YTY#>t5X2JK!un>z1Th{*t}A>dV01x7l>${GdmTha`Jw$~
zrg7u}FsMjW@4ARD8#?mCJ8R9c_F|QMRSMT=PmPQ+zJBnXZ{rLbJy`7Xch1x@Q&rt<
z7!tekF=4}jUSKtEf!4>-=K}b{ZgyKwyr+nzvLg4{=(dJt)u|}=few0!Ko}41QK%Yv
z>SaYWy)cDo#cZ**iu;HmgaPx}z-KKKOV=xg3XK_;=P5~~CA@?43!0@7nE>O0v+g0-
zheGxIo4u)o!-th;5D5#6ajk?loQRq0G~b29QR$uQ<Z0-f`l&rn3$v_fKDMnMT1U}0
z8VEj#DqiL%xzIR-INOz1f5}Aq*uAY%@06a}8PO6^%<=<2UZoO5Mg~44Xs$4!Q_b~G
zp`=yv--j$m`I`gxY0_Wn*k9(`9)juv_p=)$v0C&fP1BFP8sFRo>IcXDl$@boTPoZ%
zZX|5pgr=3;w%#Y}x12N2^dWMWxN6uKQ-|}dmRObpTn>=l;7pmBO{RL`%xA6k?@YSb
zum@2v!?gC)*omI?{R5zNzVZ%JD<|psZU+pB7U2YeTw>tfT+V7N#NZebRw#v>u4kEn
z4n`Fg8~FhvN=e3<SL{Vj1EB7T#bhdVhIRIPZi`85X<qj8Qnj84oGx9n)yU$SLT~YP
zGeeNZ<MwC<GRA(c0g&%LpU-b-P`%Er)KuhRU7pX6V*PfYpqxUp@9pXAxQuT)E`0j$
zNhVu#IR(wBx~Gy+71O-mv$a)CkwI#sv`HH4s=tyvNoyYaR0>FAcsSemhOTzV^(vZW
zKz3uj7~81?O86J}4D>GI4$^20@7o{%Rhdt{b7q<ML9ciQpDv{9_K-#O^bH-h{8DTf
z{dse2RFSt&@lHi-k2_@g3dbT{aYQQs)s8dCdn42i4=B7F79(;ilw0QY1g3L5irB%X
zbNYC|GEahdPSccAsNEiFXofsd`+i^O+#_c6lSj+5PB6(XRO27O`lzGQzvBr2<k;|=
zQ<<geqrEqQp;h-8W2YZHeZ<0zDU7dCml>kPpx>*Wkdc6pX1)GHPsjYohCEUGk$9UH
z7GtI$q1!|*GEhA?fTpeWM)=)rs<4tTFAxotX9A9XT<z+c#`VwZr?|$k)4hUh1^a#c
z-puEZRc;Jw$rlb9hBXeAdA|U(&0#8@W|FxJ<-{&g3vxq?lq{`dM_dMe@N7MG7bF>9
z`Xv@ZKa~1yKo_}dGC4a30j%J8li};s`^fe;ew+e;n_+<Gd&h5wHSlt7e77qQaef$O
zP;|oh^r@xwaUn>BWa+oqN}gh`>3ICkpxwu|hy&3ecyMsRBh;;j-9N65*5z__g=Few
zpBH~22zfK6qJHQwrKA@YyC9j+gMYikx?jd^YA!#qGG(vBlgwc6I!rfV7V(9W)8lC2
z4!+fs#X{<q_Q0Dke@#u(;HaKCtVKDdIA;%TIn)`Mj1Y`#DQjT>YaM*$+wX*uk?$%Z
z*!cnnBEe3^F@!^$YI<a5S%o#*RzpjszmKGp_jsC{#0i;HV?Coh?l4Bcq`?+U_{8I)
znVF`(ee2udKLEz^v+zdheZsh}sdd&X>}ctOd;4dg)jyh__RI#R^%g@wYp*iT9)|r_
zgpZayv&(v&6bv<CPMdBc5_5TW4O3Gd{*JRV?y2VW+NUo)Is2Z@qczOAl9$Pfa$?PO
z+|Q$^j7b58h!x)8Y7c8^XYKrOcUunwpj8}N!U+(u<M!{MEE_As)Hh>mQ+xRfZgvhq
zw?!1`dXnTN-X(f=p*AOLNsGN$fhm>x5{9Nlb*t8{Rf&A#n8i>HK(iFa_nq4I9{RQO
zzC-}fburazo4HT2nWy8q=0%isG)E@2HP<wW<i08WE0D?oYw*<ZZ`{v{Z=+h_ya)Yc
z-L$Nzdh}pk0mQST1D$CKzv8=9jA>8#jb#UG^NNioCl83swN9n3RL$Y7r0jHy#AkXm
zqzd-azTY-$a=Q_F-wmIe%OiPp76SiKvcV_1T~};W5?t$vF}m>yIU+nTpR@0x36vT|
z$<RHae1Hu*n8b(N{~Gr&&AzlXTR>YwBeXzT+^=)rA-0Xt?A8KXMX)(nxQ_o&inviM
z{9K*!6l|kJN`WHG8JIC!PwgrM!tTe^ix=S<rER%mE*VcCS!IVBV}r}s52JF%TDFEl
z@WlM?9=-9U8`FMjFBY=q(J4d$Q@H(f+z&l@^=-8~j_P_FWvmV`eeK~tQS2Qa2I{iW
z!BQ4%HL&Vn6^4d%{Hbg2`n&0Q6DH3Qu){>Cp)owT^7hJqjR4u)(r|xTiKe;=>;+%`
z1xI~$Us1_N!gjWy(eV-Iqe@@VhB`G?vgEvyA0BFLK~&PBJ(1m(b2LxgH&~`P0RS$n
zc8Umh&R{I7j;2YGAGF}4R+l?j&>%v6>2-96pMaS{Bq?uY=)X_3u7bLLU_zCyp<HD^
zoF`);?=cMr2xU^caf)iW7S+oP7w2={+wBQR#kxkncqmNDBGO_q^iosaMGPz|H)~{4
zGUwD3LUQyKp`-+%()H9-?v0h#Nc^MZpBpx=2m4jel|9{jxsf(vpbd&mfj-iu1SG<x
z1)6grF<r4y*+erc9cvk>+z%p%dzIr#_m^y|GF1!}L|szzz)!r)C2olloJ4*}bh$Wq
zd8DE1Q_45_TZZp*wOSjSe6w`YR0m%e*pe4-#t=0u6Llie62#`_S?#=Xp+8|4p2Ibx
z88~bHvZU=!SF1811)m3Ol9r9^$=0HbBg{iMDU{ZBm})&ZJY|`cRcD`)y9TD7o~&L^
zob+XG!wl~?DaSHU*^naNC(}Q#Q$iDXr`ejeys-t{*1LRd#uvTIJ*#Aw-^CY1pEq(n
z4WBBEK(P;M1Vwlq-5m+Y`*H3R<Fz)oBt(+LAxXFfL^BEV-(|_M`~2knCv>a-nP{S*
zMg3(7@FF!t5^(+Bv4<SV!h*$^i>tAMPrR$+mFpyzokbiq^kvnbNM3szhfyO2#u|ML
zWTEvG;ppx~kxH}G6fb&e32C|$Gh`hx#;Lk(Ah`L9*oUCqYNgvE=*Q5_!#bB`lX5ZJ
z=Qa*N5S5}rN|3m?i+DPxrym=Id?0I?t})f4jE20*l6lxEg?ezWNq@e0ou88U0C^y@
za5K3v*Bh<~6;&1?J`6eU{tHp)2h1HA3s0BVc9Q6}#I#6fXxLphUj(ALT;0KIN*A+B
zxpJ_P>LsB^5NtR9G<NNChgGqUtx+TBNz5NILszIC?Vv~0{_{OK`vxUxAD)}Pw(anw
zeg{_N5@QY2KIN9RdMT2?1SWC7nU_y(lLlr|o5pEU;L>L_@TX>4{e4F5`BCz!Q&4{4
zW6$70>10DqDCzA1R6V|Ef-mz<oSqF5>Nv5qeJH2wRg-C?E+jVfbJDN;OXln<Rt!wY
z8vF+!E^sPq7gQb9<~bxLY71smcR03R!E89Nqj0MS9m7+bB^l@KcdB5~3gY8_640OQ
z+1e`E&&W&$XSu((N1Ev69+<wrPNa>=?uZ(gm*%}LC|G`xmfFVl!=0v?_kc5KKH9aP
z66u#;P;`8rUydJK;EtG1k0}=DgyNMV6$ghb?ShB(mecV%;brI_`00Hq=Un0^63hZ3
zMe<Rodq1{0U^sA%tUDy7Ay~fSM5p^H{6us9%EH|1KieniuaO+%->%=ux+Mw*-bemz
zp4_nj2Q<v>oaNtK_K?-r_+-T1{?jNFB}X$Scx0v9CV@Awww;`P`GC#SW(>2lO`%)o
zv`qV1IYn!YK8|?7@`E*_a-izE*5_p<UmM<iP~-x3{N^%{DXS-?<(;aa>^}4Ho}S2~
z!R-!nZg6*1KlwGm9b32(S)CPAJ?Xpc0yZedxp6v;mR^u3taGW|a4m(+-F80h<QHLY
z3wa+3Ece@FZ6hO;+OUxA=F9Ms=WV1mah}JO0@kcAQZ^8{7pV8K1+;`GZJj+Vb?R6i
z&43efV;z0h{vlMo>-e}2w^!=&BFisw8SamQ0)!?zJaPzHM1Be`-{CNLOG5A+P}#_S
zG<#0Ngz9kEZcKkFbp#naKG&b>^Zkvb&wVBnAfae99u<pH-6ZkG1F}>H5!oHNJ;-wW
z$9KW8S^@f*2@N?VmT1#@!iNo<QIYFsxbg5NOa=ohZ>G*M&6>+<IrI1PUo3nVaX{?+
zeJ_EP1hdyd1P)4vmhY4gitc$CeU`3zJBj`K{A4kQskwZvr_76`k)5gj!8QLFxMapc
z@OWDMoBFyS+But(Rw}zf;}j7z6`0Tzey^s^5#yOH064RZ(pa<n5I_8VS8=E?Z;d7|
z#n$)WK)$`9Y6`CWt&LTLT5qDOn4v9Jb$G(hHY@SN<?ttcHm4nFi;5-JnRv%cVp&27
z+!Ln$<>ml^=ZCEN9`H?JwEAF`?1&iBUH0DHhC7ZX^lv9~gyi~eYC#-CjL<*Hi6;gB
ze*6GDg0$cM@HeWg%8Hvj3w$#2#A*=a;~hf5q%2!0V#GME_a^>(kg03%1?>wG1X4=2
zsW_jnnY-ufShJWCT5~=HTehJio}$9@SUK660xrbrtp-i0^Q#yu6r6wUL@GD<?jnD9
zt6(tOv)r+A5d4xHgVKU$eKVh;f&{k}?$O}V7%Dc|vo4*_;C0M4++hFaF>TtA=W`<~
zo?6BdTPX!Xv<RD2fy!&R$X!;ysqiSXi`T0A>Pb*^L~-&nnSQ#awDoTylAJMs4niU4
zg8Kf5QGMv0?N%%c!CWj#;Z#D#&zB0U_rfeV42^{di42eG`?ZQR9sCkR6qPo9DWJ;8
z!s>A}+whwq#_c;IYWWbJel}+4{S-y@%m!mJql~u=z>fLcrsc(UQNAjJPteM+61eGN
zp~nA<eCFB?tJ2S0#N0+WvWr-2s<(O@XAW{}4K(riZS~0xx(?a2-=*~kpA5x81rbfe
zB~Q3BGRn2xM>xx=y=&Lzt=}tV7tlfA9k>>)M&^b)5MsH$c;3NZ);0Q!-dn6Y-?&^u
zxN0CPPH=wNQ>sf}W4NaZhW4EJRJ1>yCHg7#1Ty~X#)3hyjn9@Ea;2;EH;d<BHt<~m
z->bXe=U37Q#L(^yCg13EA<SahrZR<sum1frh`Rnua1*hmu2GIQ@a9AO``gdzM3$FC
zyrn$y2-94UaTBW<O=3M<Hyy{9(FaP4t7%{QWOy#@<ngbCQPDMeQu8qckBEFU9W1Uh
zenOFZ^#I`nsbVgvs;Xt(4GxU~P`JMQAES%@W?y+oN<50#;J8p3^6R2BC}q^Qh6+s5
zKeWIO-ZbpL+xxcv4?tSI?wf^<f_VB=AC2K6zEpJgqx+EgONW9tGd+uZ85LHymB$0w
zp=0E{+-z{}?*@cvATy#)uv9Oizm$7mQOD00q!1~GJig05aFB^*Rb~IGBV~QcJHjFl
z6vNTB^ea*&<rY(9Qj)(UF{8S}NM$C){#y8ado0$!&&5266^JN`-Myg0It=BeCza|w
z-`XTF8o4Dki-s{_(5<<ZpO5`)DijewR7LpYy3JFBM`?qZC`>+nV0m{)da>Ql#->hr
zUqzUN|HcnNoRVk>y3!=u0RrQCHS$v-wIi1AB;3J=X<55$YF2i0HaQO&0F~L&G21Ee
zoltiCZa=irv*Mu8j&)DbR=)9fDtNA6C*iw2<e`Q>fe+Wf2FzXf!*oYZkxYm<kyWNW
znv7?}%V?ozdqkrgKI;a4AMmDL^t0`_e^=p$ZHJJ})D91@KI-Mq9<9o(R3DvZ1;tAs
zHgl`Qw^i)^(JMw~pZhEbT28pue6a!cuixD^z2)N?JRmx`6WST)L&7Ptd)3lUmz>Rc
zz}PH%&txf&LUFV{6Ui+VVofrH7IzptSf(}WTKoy#w3hNPY7~*N(B}(LzbWpN)X!~B
z$DUD{7dQAzQe!PNoXxvy*BPvSWMx-NbX=2Gg&$ul88pdiQEf;uv)p~ZIW*R32$I34
z-!_|CvTU@01x&p#HCN#<oGejC@~-5x)e=yWGY$&PL)nVW)_<rT>FpdnR)m*}0q@;=
zm+-22v|vQ$ep!UC8{k}&Y!(+dO0qV59|V3sMGyNIP>NGt?tctI(uus0i@jk}%L5TX
zq7-dqzNGkOqH<02K>|LKBthxY{_!kDkT(5`*Yc4lYt*{8LfcUTt`hugJ@)u-A~12S
zr5b1~;%{5Lj58AYBsTw>tx7#-QPNZc(wYWoE|~gW!Sf8$EX3;LKAaBeb(Vra@%;6o
zxg#+Bgo<I~@wqyt^O~s%mYGU|@JTYGY6bUctKFJI6`Ct~+5nBw6(a6FgHQ|d4s9vJ
zwUgL+Pz#E&TQJK*Y=ec7mE?4_!DqvVl06tM&2DGMUgPb4jyt_-O=>5stacu=Z7nod
zuve%+^LGEAn{1ar-h7w|5z4mtskjOMAmqlW`_D2~er(BjwlT3?97R}Bd<?9G2}-ZD
z0q;))6(TKhtagMAJ=@gk#oMH$=B`|6GkAJBY!nO3F^X-%Nt5r2!{MDex~e$aaYHF!
z0JC*gL+4W{@fefZ1ZV!&mOqGruU$)2$l6LW^LtfmiXKc<tDjW;C@pAC+Yjb0d@zzx
zF{Ft4?HpDSjGmt9PcN;C9mz+$Q6pTh@}1o9KDWEpcZB{sbB!L{<ePdHp=d)qS-Rk-
z+`mOZme!<L>B{Alrt#b3?AwoHSQG4(x%`@G`qz6Fuu>)}{-?VHWB}*iyI<yh-FtHG
zoo49qC@A;+rp1iG<x0&)Py+^~K0qes6JnJgwi+xE1v-1q0roW3noS?s4Y)PY$8Rsx
zDI&#6N+XB%y?><dTr|sA_*e^VF8E}r&piI<V*TlP$W8G)`=vg0ql+v-MVG0s)#uY%
zeyD9lweCDaQ+5d<CjIFmh=(6^8LF5WGrjTL+Eg3W9-CU-BTv)_O8o)ako=Ta(Nzr#
zcx){_$!__JYkzR7X%l25H0<~?`>+mVqcgBe3!Un*Jyl+$O*yjX^CY$~6QpvB!MY*p
z(*#<_<Frn>%=>}^=T<*yvnF4-bbbyoI>W?S?&_s9ST?%kCUDFj2=x)(*CU2tXFj_Q
zR6EnZdA3a`>VhR+4@xcgS6a@#uOO*NT0=u^H)a*AJ=!_uUe&c6J(kdt=v9!{yI+wA
z`v=f|e7d*-xa-xd^j{O^Usq&?T|f%~y*N7>Az4z>g#qCBo?RHSOUC@|xQ~F*&(e|r
z=x-l$-8b5-n(cBn$H^y?xrwVL3ehXb!z1K_%YJ{Gt9Ki9cr$U0EI;VTTwbrGee>f7
zaR{RhtoJJ^+;1MNSt8Tgm%m%IjzR$?K0ozUd*+R35Kfs1d5`0Mxr&Xj^B|bcZSz~p
zd+d?HZ#v#{sb)coPj8OHHI$k6)y3+C8*C)FU2V#pP4koOC@&*TtZlP?a+CTyqU*QK
zHYeN29F~&faHg~%c(pbD6iUPCm=!$Gw#$Xderm*{(`UDDPjWD?;<uu<8CAxl+2O`+
z5%JnbeOtyIZ%JtXP37S16Tafg%4Um)7pL`)>Ovn3E0yrY%A>)@bB?Q|6y$ssX|G@b
z&fE;z8DNm?hExlFFSLaY;Ukby`W`kF+K)QYdT29{eptTdxdD)%LZ_xd;_JZ7F2OYT
zKDVP6cHfER#M;F6;M*9oy>*}w-!P(o5huu)k}@5W)etWyA(`sBGI0Oxn=|G245^Nm
zoL^xVrQcuazaQGx3via9@AGh6?!87Y{|>}5GrRNZ*T{Zi2#Hks)<00r@yKZTa`rMy
zvs_HS{URu@{_Ww?lUq1;Z-*{96f#W?Vam99kxecLix*bBGhV39jE5RMjL<`zsI~kn
z^7oyZ4Ail;%ylHB9owTFPpyT&tivZIcGssO3Q4Ljcxm1UEpanAD|LV08PSA0|3+TZ
z<-v%*(`s?A1IW^J9P(hxs^rns<fAjI>CrE}Lpz>UqA-6Xsy>Ltt8F~f?N;Z2W}!!3
zRyw=oe0A5R7@jfDpsCAZpt!n6ugb^%a`?D%>ol~xR8J#2h~%trfIwQ^T<N48z$kA%
zRvXc0<zGvP9tGo_<UqTFL)H~fMXVECc^+i8OrXqTa*a50zurTL8wB&>5oxDR{{TdS
z^Qr=QCJysHtR4>NtxG+g);)wBh5t3599!C|4@_S3e?_}~&$6Cmjw@e%CHS2rJ1YF)
zFJs}JA>8O6kp?Eta!=4)xqaCPtkA=cm9XnMbmhwK+))+;Z6|x_X5RbZTO=OGS$Ms?
z7d!y6PUfV}{MSAF|2?d_533)<jeJ?%)<Udk(P(^Y9jckTx{El7BaHbjNDSBf13>-*
zkPHM+^sXxic0b&crU%jvh=n@|ofy|t$RWSQeb5k9xQ0k;`ka<HzJFym-tPdHoN(Bl
z6iv)kVS*74HD$)Phnxd1&27)MAP1$lZl|x8_=g(Z8#cEAsYkhT#N?DV9@O2G665{u
zbIL9olLnb0=+c{x^&ryj6IUdRFCJT2AohZAQWo81cAofBIJ=^TMjE1CqStpaIk+1Y
zyA2&nIMz@`B1Zrdck7S{MK#w|ElUXo6k;O`B((hkLsNQVM5N~t6!s&d@tF_SRfspL
z`VK++D1=szAmh|YyP2-!sA*V8i2m_Fd9bP#!ljPbN+)ozGZ+s&oMcAoZVc*|V+Nap
z(g|jglaahNBh@gO>OWB)PSu4zQ--(Tf!K$Z?EQ^fcC=Lu)nJnAONN7CwKa55Q=oKl
zBYE+|nN^GxCKWHNDD$gg`^q@NJ^s#py7=|;^m|f#t5sRW4RIkPobU3g0?(&fU##^J
zl2tyR{wjavoA1Av2FhS@^+9ozT1(dIVd%hWi?iPDKY+*Y<>2<6x3?LI#5q9ue?_)(
zjW#J241+{qbF8bg9_2Ib2aU=vi56St)zIs@UDynbUykpErD<H$6Gp#oHoBk3arkL4
z!MrO%*+l-{9|<TzYbxM&frlp^db!|}LIiy(_A}IV;IN{3K&z4OcUNWpH*e2(V&^{|
zP5$vO|NK>AQ{PQx0=chwt?Cw6%$uw8E{*Nvg!h(pJEGr66xdC9(I+XkuM$g11_J5a
zQp{(+>8eC<2R>_a)dCA6-4DlR_3y|ThFp8KYNDF$Bm3FyImG<(?a_(3n3(J)uw4**
zgl^s2@x4pOX4WL#G2MiY^SQ`ATuxn+^(_J4>PTtxDS1^IyY1+|$2#;t0lBvh_Vc!o
z8%h=I8PuM4^gis&{A$o{e7(Hq@5Rr-ck0I%57cnV3HP(glv4$ty4-<6gOfgaMSly%
zt{>*UZb$ST(MWyHyU(V7Rpxu8c9Qet_2CMuUBt)9h}p~Ddd+_TQ>PcX04d%$V|xI3
z!GGQL|IO8H^vAWjhV~B4>&UktP*9-vqcgF(BhAsb>m~5xGNf(dsL!dQ64}p7ZMyXq
z=|7kEDxSU?E?hTjS`NyzK)><zBw2mzz#h5Le(<3B2LOyL)438dGMB=O`>gAwVkd?3
zdGP3cGvm>>R=bFF0pt<iU(^>qFQ>!DiX;F$t$(!Gdzi+t?<-|1M7KG@Xv;D;@Z8X*
zd(Ck&1jO=Q;YL~FCr#r{oe)qV_L1l~$EKVUdva)8gY)lFp!ISi74z9kC8m_&%7X7W
z=u}%uD=>2sv!NWES)7BfQmY)9Blt;`>jugeO7TaO9qGYOv{rdb;5H~@VxxE}>&evS
zUZH_{uFI~#z%hor&`PCC&!~*`z$~AxPai)1Nz2g~E=E6U*<EeMO)Q>ReqYcsFk%Yx
z-NWYLDCR0A(}NNS*9Z2J{i`+tA3Y)eV6p$FOsA^7?^S6pvCcX8IDvvSJ}c@0Jp%Wx
zDIs?HSdp5dPKr16XnN`ik-hVG{ldSjhpm8jsxT<E6ob#TtNyTSZ^h1oAL+fnJ7X^4
zPWIw|6Sx1HkH{F&sV3Gbnues_+jUub+MZYX6dELA>v1jMUd3|EhoK8u^vOl(RNQFo
z%(;JxS;MO<CCZ+K=YLq^Vnb#iaaD&~vGG^>b#%mgnosuDs$BjIm|u;NC7qRM)IYKm
zDeq(&uUL4J@&54E6QKWOXhQK5cd|X!1-x#=(V*6C0t`N~8DH^C|0k(ZOYa+AicT<>
zn>EM1q&$7wXiQRsdN?-ysLQZ!6NE2r+n3C-XX@g+kKZMgysG*@m#j!|x&LX+>aU3}
zUtq}eohygzZC~BU@ptw}lBnlE+YK8=t>RRsLJ{%F=HTH}!PojY<dtpM|KTL~UvB1;
Hf9C%mx}ZLp

literal 0
HcmV?d00001

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.020000-0.000000.jpg b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.020000-0.000000.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..5010eeda852e0b16ab48547541b662ce6e812b4e
GIT binary patch
literal 53722
zcmbrlcT`hb7cYv(<53Vrq$A~144BZQcQ{gl0SOXFfB@mpODKlk`Hl)mKXmDb5<&<8
z=^c(p5h6XI7ij?k0-<-F-~HphJI4Foc=wJs*Vuc^J=Pj??Y-BUzrEI+zkNM<{hi@~
z9vA{<xN+kK!^@wA;d+Kai{Z|1zuo@r)}7n8Z!<F9VPa;#$9(rLGtWad7IuDKK>>bV
zKE8iFl@R&Y6EPt^zGn(RvFB2<va*6AN@|MIsuD7?(*H4XgOQPu`7Sf}y?fl!kNF-;
z{~ycsKMbsQepUFT@aByt48O46xXF6sx{HC2f#H{%KkxPi!~c|<H-7o`)^E4({H%TT
zfZ>;)S2utAPx<Y}FE<$(ex6u=efU`F)(fNG*q+#6{*+ECxXrE!tNJWtJHjF3^>%Uh
zsaA4fb*Hhcot!tF6Cm&NE~RF4>8CZ`|Mc@8`JY|=$J)=ne%6Vz{*Q`Z{)gPSdFyAJ
z8^5sLeEd-A*B5L?Po!_zU^M?M;1H65jVxYIGce!0@$(sOvNC8eoS*#P=KfdhhAxcB
z+|xhUTy$olfXO?J$lS3MROxW}yNxakWbPU0gPb{IO*ULET}bt@o}eM0$H9{!KEG?`
zto}xk$M!+6XO<D5iSe9=d)eWi{`n<&hp!f6)L;<i0Dx{d;^ik)r^5B`IS9NbFr_Jb
z*E{1aoB(f3Qa#h9;?G2x|FCTkl`Z}3y54=ds*OMK!Z{zremb`_j-f{Xz&o6?#sON(
z!Y}*6jWQj$<)FoNwC$_H;Fgl*q8Cg=6&YjeDa<7g<KRO&Ic3l9G702sF^ZLMwht%g
zjATvF;A8bwPLTdJCuZZ)HHSN^)P3|BCtScWR|$Js+py^c)K3|;`i-g2wUsZqcKfVT
z{|GQ%j7uU%dXh3NYtVn=dlgci^o{-dOY-xaEIsMqx}vZZJXDIrn~a=4ZaJIHwSMQ!
z6MTkW_-6uKeigoMWxIiMnHTW%%s;Gxkyw5aQXB-mPEJJ)s1$1cuW$VShyDZ>_hePX
zKCY%qIm0N>j-qCLaLo|>aEjA$p=b>$<pJ7DUgfwNZqh5>Zs)#ckl0zsI48s0T{!Hm
z<n5>%yNgM+h%7ExV=hT28usO%a(lB4zI6tM$6H2(IM4{Fa|RNa2I)s;WYv9q5fDdj
z-(#-CL%L^&g=?z`;!|Njxh?F|il$h+i<dtQnd<9*sOs+$jMisbd$$OS*CRnD=AR$X
zuJTIM<u)(Edl&M<1^I%2<5~E0q=lWkSm-VGDh`*i3=t(jc;+7OY&d`Hc)dg|cEkX?
z2L{4Zi{~?f+Z}7fLJhCtJ<rkkCy5QJe!oqeQw8VC!%NqfoTtKhvkjdx1%D-oO)G?z
zK)O3omhp$#*9?pr7S{~R*9?be&*5;f_IpDaN5&15H$2Z(kuXBU=yPH#{_N1&BorL)
zYL@kYs9Ed^%NpS6p8JU&d*NJtCo|Nmj(VmTLz8(Q9nc8AXw>Rn9ll5J{3W$NuX+7T
z;;d)9Nb;p#v%{Oo46JfCG2a-KY?*1k$swj3?>1aLRx<yNsHlSl67~ne$Cs<k=Owy`
zKCa*RADiZghcD^o1H-}Uxn^+F_bK(4re!NIlN45E`E&=LqX90bb*<bp_nV>wph|N}
zR3YN5AQ^A8Y4Dj4BAMTD_G|T*f9t4P0ZC%nIF%W(+Lk?m2me3j4+8@ajcn|3_d8O5
z;NYgZa6_;-|3<GTH8fOX;f0AT!RaJk@Qe32W4)E8LUSCvHO@8IcVOjvfAXE$)AxVp
zbs5JR%<-TP+G3xAV>5xhcr$`_GcZ>?de9Z&M)=cYhJ`gK$1Ju2>-Cl0Y@@4RA@&I?
z2AN*-6!+Sp*R&|22y{pT=RVVEf<pU*jGOinYZFFDT+x;yERx@0{$&$O`Gz+0Y8p`|
z(--+-^r6bB(1IUrP|<mt03V$G?cM%hy|T-UjG=;6Uq><7J#qt(SL6fEP@fvgDtZ(q
z$&yH??{=*yB7_8WZyOBO9$2OmKUOKOF?r>zCf_YsD>JF=!Y~$-*+#syF?**}q4x6^
z5gwOwo@b_qKy{6Gm>QhLRoW#Kwz$70`Pbxb<Bn*x)#}Owb^pj6Dh{h5MJ1S=wwZ6L
za7_;iO_lX?;8elC6t(Gz&vjopFF38%oaNa@-ZDx~wM|iB$Ahur99eVR6Del_*9<~?
zBH0@J>W6Q87aQ{)=1JZ~$T^cuVb(?K7tzF9!Fx_$Thw~0LhiEV#SUn?``4mIuM)qV
zMcrFEfl9qlmD4U6uU#unn&BP9HGJ8#Giz^8cvJtS!2CRYn-^KdA)p(qVP`F7I3uGx
zu~E;l?>ypmO!ek^PyjvM*PV1w7kZE1ort++;LI=0>OLccpddTTR@{ARkDfr)3pY&O
z=aN(Qq02~4nfV9f&5Wr|w}Zmya+B<^6}xnWy)D~ZvEyKcW(ONYJwKK!;0mHr=@B`d
zN~w5KEXi5kM%ud?N({?-eo__?&#`PI+NgHTKw(iFHZtym*EXqR!d`6vhn`xx_UPwe
zA1$ofY#s~@ME#i%aA?pn<`uJc+kbC3lvzhiTgIrgq-o|asPXR%|N1|l;lFKF9Q_1G
zp)3OcrG~HSe)(3b?3o+^&}yD-m_uC*u#!N!c5AW7vDfMkq(?YpOI$hR8ttK%A=^2k
z#d8O3JzEj|g!BdJGT5P%&+Ncr1M@#=BT7cUdKg5%6no$tZNSlQ{;#xvKCZ^Phcr@V
z(>Un&xRDDIm8Y<&=w)&R0z}i@f9ypNC?yZrZoEsR^SrrYMb;^}CJet@pQ*d73+wGY
zNoO2~c`nVbjRf1k$ynX{c@w4A3_9m|7OXmYOo%xv0c-X01>E#CL(BqwY4aGx<OAw-
zS8T8q;nB>_DI_C)<h6ZgTe0ijt=Pl(k1Au`CCT~U&L3S24$@aRe`|P9iZlHT36WCa
zcDn^))q5~OP@r_`-vz^6C4cot8|NCw>bQX8iqA;ej+@Ak4$16>X5#SQ9iUS-n3=2K
z{9ul?ZpYUpa?di_nWorVEPKsh#1xm^f=st<ZQdUmBbdf47GcFS0?zu(xuy8DST&*m
zk|0b2nfB(Y4>SL?GGZ|xT6Z6+^yHGSJW(g&9JmB$!*@xYSU!E&5qZdKxl?_XEBrL@
zaJ6p91!L(TzRFWcO*~M${mW907F$f*n?|5PNsZpaT07eOf(+p@cT(Wt3Sn8Q6;bQ+
z2D=z>kyU-o(3I6^>eA?;@PTyW?LR||k?+H!fDqZ$Qy+-PzJd(jcIA(q009}c4_~0%
zna9Z`qb&<--`4d&FIV5N>|pMe#a=?Y{x)#H;AGgMnuGZI{y1#bbz+Mx(2-LrInzaW
zTXTF-S;eWGPVq^g76h}XZ$1pC@{hS3zH+eiQ(%n1!*T-^?#uyO3Tu``cNed`t{Jp$
zKUm@rxXGFxXS%y`=vk0Cb+B0}?5okQX3Ds9pjg6V5?_E&hGqwK|7=^7rDjCG;_sD8
z#nk2r<Omt{>39<7znyuov01a;Rx*yW>pN5n+=GUvP<MJsR~pb1mu^ClS`gV;R}T5<
z?Uj?Au*lBC*t%B)k`{?>$xiFkgS*O~sqh_BQ)p@$@h3I@7j->@;xqR--UkAkmOvG+
z5!Uh!okwH0gj@Q#voOJP!X3t+mv+ZGZF$FMGtHKswm;3pla$Y=t{LJlJfkWW&Npf7
zEykZ|DxsS~8z3+1y7yl`7@cpG{Xu`7-f+c7`7zo%xQu$Z=0ttcX1ODVip`>;6I8Al
zKF}8qDTxg>Cvo<L1W{`jVt%FJaaFT4EG8A{LMUm<XZd_o8TY3A6a0!EWue(T;2C;_
zYuXw@<1sG{Mq+SC-tjL=UKb<bJ41i{$oEV;wWhaQGoOa`Hs0_N{lW^Cb7|?ZHhdhJ
zFZ+Ll4eUgOtV<JV$~W|`d=VE=HrdpDPfAI7e+N*^)tSFZ(+?Q;o`%Db#Nw685n|gd
zSZk#SVT#vsxta{Cg%|BBSvM4hN)Yd%DhmP{p3Ox+V%fgzA0U*bzbrTQe9<o-KV|Po
zdFVgf7Nb`yRMWD@P8;+X8SDFX71xi6{K2tPc*TLyXMq{QJ&lq&dzAYP&Yacqm(?l0
z*2$opm4k1W_oU+G`hwGapVaeRGt{hJYO;egIxk7b#tl!bz}F1JwI=!Ut}oL^&!Z1t
z%nt28-mu92ZGhAZ8k*HR>$CV8T{>DajZAcdyLuFhH6Um3O~Ii}X7pKvbeC;elghJc
zVBk|P=Th>n+H&E(N{EBMSyrr*Z2pgPKIhTVO+57?&fhBdnt_W%AL2T1_^Y`Q?px5o
zVgwz|@9sO~M<hmGIpr^+I;er|k0a`TtIt4mkb6J3+=^K~?i$52OYk0f=U99@U9}vt
z(T&pL#zM<I_2wl^_tZF;o#r+)<A7lH@2Pg&qEB0sCisSCqSEIsRd-m<CB9EO@z{yl
zN_pv<HOzfJ7Z1ag{_{qFt#fPFQiBDo|BA*)y24eGYcV6~`wgWh;{z4w+>)XJOyx{=
zcZ+V+;<m|ivM8O|*6+NXQvxb^nl-AjKk;?<!tnjkM4cC!i^)t($UmOZge2%wF>`oS
zbwKE0t%b#zJ`KnlIciz{yxX5=T+#9Jn!!55$W0g}6zhk+*9n+4{2&GuKFV>?9EnOt
z(=OwzW`VHRI1X-NvaD&k%go=iEcd$Umam>q>Os9dP5VU&A%6``yQ;C+t3VJDuBlQ|
zJIIIvmCg1cJPm}=``A)()OW?b9=PT2_;_lYOP7NwnP6q2S9^pA<<j5S))oam9UGw~
z>d=oA2liS#gq6wFWX}{bTowNEO0*&_&h#OcNdgw@mG~@2ZrN`r%{NO$-fl_N@LohG
z1zwzuL5ukY^UWGQtVC_-w?w_{nEh^=X6fs($pXciI;B5|P07ejN?b;tB3snD-@p~y
zcqljvag~7{DbrB#N(+I(4s_LIG)NJ|{>CTyYA;Ma1C=-KG;prL{E2A3?<#s2UbXSO
zP9o>9enQ2N#j-MOAw=`7Il&IJ<l43-dlhTn#$4Ap`quS+c?P)h?Bmlhiigo^klKBV
zi=dt5i^^Dejc8a!7CthqxhN5)H-+zD$s+$SDc~W-$-VIq@8^|Cl#8P5hJU36ZKiJO
zv?vh{+{%k2V{&q=Q%15uHo)=SK}P+d%)!b|8q9qpwP@8laL;gN<D^4W`6wec#~2Pn
z=N?Eeo)qr}oGg7xa{`wG0`xEUWNhI9({h$=--uTHxCR0;E3y7azfPYm;(SzZV71FA
zw%y#<dWSSNzgT60@qr^b*q6?{G^E}@6-@ucn3=|=6c{-WZw>f1z^{(g+d3QLU#aPU
zIAoIteyexMyk;<6y=G9LhbQ)J(%NHw6L{3ML1%Igkt=L{eL0cTIJRc~&;K?+-J7!7
zx~&qu1XlpZ%zMgAB+qP~vB&R;4N)>h>tec__u5i+PXP_*`;Rh7{slv*&3329$yrlw
z5BxQ^q>}^7o1&9{_^9WoDzAU2bs>;Uhs*Fvq(uWCxj~uvOi;hFae~w8r}DZo&xXvx
zjbHMUl3v;*pX6TrwNi8oo6H4Vor_MLZJ6}aO0R7mSuJgXr|fb4y7s9XIzxj_xBgW>
zn=fy!LtLl|{Qyzh)}f8KFuy8`3#z6`t#~NSaB4%a-*QUhlGZ(>AgR++A^pwOds=hP
z+Obx5+TCWW2C0o9o>8jqa;WsW4PuA%1}!ivSoXjr@5<!i1wxU};%$HV>W9y(I|4QD
zMj(eM$0k_=%SHq^E1>k5zi&wfL?+XG0&6rz<k3V2)Y<rtd~6qitW=t7@qAgn1?6t$
zTBoLX4v$uwn7%IpP*n0bjp8W9DQseLd9GeAM5F%233c7Jv;r=m9D9SOwl_vKm@%>$
zr+^5*Y-@M=EBBQ)EZ%(ZwS|cAs3@Wgt3wVduHBcSdr~Pq=kWOM7mGpwXk5EuuV1tL
z8*+-N;fs&zY+V6$;N3=Kn#W--kz@Nn&6IhIefinYhb6m=TwcqIoTlKA&qw<gEHx+X
zYB3&+V_$SmHX+Wf8HiBb$TzJbjGbcg50m4<+4H+aC{-VWOrF<12FJ@mb2y5)xBfbO
zmX#)EyUZ=w@g@f<FyZ}<bOk6oE25gYy;_VK7cXsXP{(#j?f&z<4B?`L9JX@!dRnLK
zAw`r3-OBuN;cj4&wRc)G<Z!udJU8W|gElc_c>-YaeRRRLH)(+MwY$yNR9T45TwjRj
zaUp-_6S~{As<b=@k2C<2SKWqkPiKbD6j&A;??2KNzIjhCj+gQoEos_vteVJN{HamT
z1l}r&Xli%*d-0@KXC-$|;Xw7uP_RcqZbFE^Q_-Jk$vf+x*L~3`cpgP7$6$h6^LawL
zd}_hmU~=E7Th^&Sl;D?j%&SL5My-|IJi0z-MZLBsVWLr#?J5>oje9z^8HXxi>NOqo
z4!2Vorz+Ek-C3*i+V!Dw`BRNa>Qb;;OvD@)Fa65YY0pV7FIKBa(>&SWJok7xY0$M*
zdr_I~4S^A??+b9$ixX~8`|(OvR14sW$qAD4@v2hG=%loMIs|B1DOd{!`Y#RUdapJG
z@-_nGu$gJYcoycOJPnf|_-CoqHPLCJVn<ARhvrWJm8!LK8p1E`hpCa~zF!a~VwNnW
z<w{*1saOfXh&&_NaU%y82p%hf^N@JgiJRjJu~KMgd2V1ebf@Pc-?EZFIx#{+hGvyO
zyeyb12j~D6Y<9qiy_u^SLCGZ(oTh}tnc9%ukwcufr54lt6bP_yc%){HNj#N6_fDOK
zK8m7?{Mj=`kV^-y;;*<mNa1$#C0WfBL4__zfJbF0i`LYjQr7du6MVq3^Jw;kesY+7
zUj9wgWt$=c$G`u#@aH#m5xDW^x?rU`j`K@4c|O$R=<{y)9hI?n3j~^8wQn8=muxR}
zOxsD{7{S|*0tEk9v0U`6Th#NWoV=zy8y#iZDTNFob<8;<<oHqL%{9PGS0Sh|-C!yV
zyAM_tXM&ff=bSN_hKV$FZp=HKI}i9F;9lzuoHQ4Q4p>!eO0}s?K!)(#j2&>qYaA)@
z4me^oj;!8G)>%6m3NP?|WbubL2Pl@<ubh}9k?w?3deXLKOzl#jYRZha-{Ze#c$u=G
z-*@L#`Y9(epWBWIJA<UdX<?p!C--2>&F`B<A82mc(mH`y!6aB6!qt=NH;{mQPvSD)
z*Pr}gLNxk0R-#NEUe(94rN!m-DvrI6cra#2?*2e2_SDg73%T_nrG)RkpN{kRo5^Qk
zfFDDXhw<zf1zOF)ZtACivdWWypz8hpEzhEVFo)t<Sy3nX2Wp{eQJ<}H4nNML`*mwz
zaeQTZ<y-B%K8I2jw-eyx_1)B^b`EQ?wrP(AtpzJhc@Q;ot<`@B<(l$C)+VFzOSd>X
z%1TYFSH~~%O61?y4Dz0nKL#-|?){{1YZJW?D`Q-^y!QlujkvIA?3{niKiDBLr%Syd
z4n#&bD*j9}JN%r7U<)FjP=AairN3JB*~zKKY(G|}lzuL+O?D5g`Izz63*pj#&7keF
z%sLPmcg^s$J@K+gozdxw;e{??_jsW7njs^R?nO5gtI-9czo)g#B3weAUuxUo8)vN<
zi?O`%mAxHR#}{6%>hRzopT}?!gHjUi@o?M*No?%ZvJGE>gTEc|5d~{MH%>4nQNNhA
z&xy&)n>nQ;$HKKxfYGiIOcv~Y+Q>g}Tt@I&8m<eV87Q3Zw?O)Ka%Es?I=V~s5VwdN
z%*iP&A6`c!r}ASt+u-pjy*i=*A+g3h-2mK<T}R>-xNqRxD!kV!xVPktt-6N7d;XCe
zTmNl8?cDt5(kMdt#Ddxp!)vy_sCaezK`LIp<D2W1X(DP3#~;R$p@AuhSEtq!3^MC0
z?|-o^x^RVbe5(zYVrm2JNTZG28RygT)?4-rpiNG_-hn9eha*>rLS$J<huA^5OfSar
zmZfSILC+|Cnm82N-ALgR^4XXsdPHvsTCWFOI3OGGdi77RKZx@&qDSgsYo54Ky63XM
z&G<j;#Q4o2&S~4u=aQetL+n1l4NpLC<2t%l11{O)X8i@KD7heIoA1XLJCy~S!MF7C
zxZaV{kYm1&!ZRGstY?3GA83d^)kvBRu^X{<RuXlaAb0IBqJ75abzNz$LsW;#D42EA
z_@Js+n<vAP#<ZohOm>?q%!d|4%x`wd)%xt`$=B$_o69sx(tnuhNs>OXrnOxp25JAz
z@XP-OVo1@M^@||J?_9m9d0&^;BW(#~C(&fX&V$6lYX<*gwqI!`uM@WBF$*rfL%PFQ
zQ1zI@w*@9lNe2QU!452y03#=H^2=N}dGEczl2Bbw!MB@p&UpZ9G5Byp%u0HRj_}cB
zc4?jedSE-^Jjla4-#`iq-LmsT=-2?zg@M^gLr6yXtthb7X!UH_uB3FyNpDbV*}#?L
zU(o~Y4#hiFI=4j%;uX@0b_;3Zr)+mh2~T<gCNyK#t#o{}#qXv|IqRfUF}O-QnzfCd
z-uAzJqSrm?FiM`aJ>>5aG(ng=>0mqM92&j{cEf5h7d!%nGM=~4BL8fstE&MP*H(;v
z9xmTTlqRHy0FEb<=Xjkt;ytF}_?RWovu;3(bU#dg$w@;bV}f55B{+2m$`rM;Gt}OZ
zh!TxicG6R$DAg%>>{Kh#+Dz$C!`Z#Li5hj)p@y&$5S)Ldi}WCU&sru{nY@%jP%Se6
zWNr_zb~-}l%n!&z=;D+5AvVZ`aa4=UVBPK7AM0?NKN?I$n&bQ+Y%|_*0kbKcaP!*!
zV*_qQ_^T6$VoUi#RnZ6XAXZO<33*y0c{AeE!~N__)|t<nR)N<Hq8X~Dk2seOGz0YX
z<erR=b&NcsKW}#Q;JIrns$2Hz^7gVjy+Ltn@t{H0*ZFgCj<0pWK+$jY%4X)P$>7%c
z$^N>6WbF7T`AbaV`yE8*@xh~#R(+G^95-!Gwxug*xF`0c`Dg&#9)$4h=I2S_u$GLJ
z>^@`117XB~{gG&lf6MIYP)qDa-%@O^&OSY?+ZiRUCyt{?%^C%)S6WY6-Lk`cA%(VZ
zLxCTP9E3|+e>$C?WP)ujhan4abb#OLFiclCLUmt1L&hq|ymU_7u1uLqU)~G;BVBGR
zHdpr+M@xEC&T{VG>7b0cPaB=tCu@T!R7A@Q!v|HYf!RfXfZn3DtBWBG#X;=LPF4>?
z`ylUx!B$g0l#B_qcv(-fTftLnV=mWZ^?hs!@y=M>!;RGg)sB0M0eZ5tC25vgC=m(N
zhvT-KMUzh#Qcxq8@xak`QpVx2%E?8D_xM=`bEUta;(Hnb%OOl&BySk9yeO|iZDh_r
z#H1CD#m=wH%2=Kq6vSc|{jw+mH8p&Q5UpDv?#OwO`(*q1J<I&_%ON@Io63@EkNVX(
z*HK*j#y1ji@g<edPF!_d=C!g8ucAbBNB)iFCDYk$kg2KoL6A{0HPh=~|6fjglZ&m(
zU(uBP0<J1L_A_M?Y9L*nQfmjC@qgs(y}7s=Uyg&X#tAvxX*plG+(OILNtQ0_`Df{m
z2!*nLs?EV(E-!o)4PCe`;#^L0Jakef>V1qx7YFfOTzP~?q7r*|{VxvOU%BSwnAEoY
z+`6-+pL1JE98BFaYfxNCi1#?lgJh%HJRn~wuv(WByYglqCf3xBSOveM16FWGpo$mO
zqhV1u#AbEAOC;HU<ya2i13D&u`#U4kr?OCCP>D3g4?cQPHaC~T?J#40FJ8s<(9zvP
zll+LXg&Id__hDPuX+F<4n32zYAM>v~?rWP|R~@+()2bb)Q*9T$3b37ea?QXb)bws;
z*boe?ueF~$<itCK@zm<Oub0O^aez&W;NeQB(@g$3-Fm~!`?(%TqQX73=^Ii>M6R}x
zq|Oe_3XUe+z8JoL9WPSz`x?hLs-nq7wHOwu5ot)_J?#mTtD~$(^cUw#G1XkWMvrg~
zaeeD1etpzh#}-56Ww%@<IZzTt#0R+^bX_jh{e;aZey;q?!R8^TZ=fDgS4pL>rHZ3$
z?2AzvvfAi9eC81ftNc9oKf14bp2wTsqePyRyLwh#0vV%H`<{4VWV1~V2K4cpC5ZF|
z`VjhH;|f>Qxh!gv|0gwSHJBg8I^`yEA45P)#%WUY^uGw|oab7Cf5{Dn>4myCp`|A@
z?#36zAPmI~`y^-Z+|z9Xs#Pbe|A_%T8_UJ%0r&h^QR0I?8gL3;A;{Azs5)a1`}c|y
z`O08}N(0ss%&z`$-)E0chq7ZDTk%U?O{bD}?g8_{ZcIi?yjRa^-AgOtYK1aBz{1=^
zS%@cRAq!9aY*rE?IaBHbJ--e_7R?*>dHC9}HDrY2fRCP&w7nF2xSEK0qMy}FQ>cD#
z))R!la=U}sCk=`CebxEZU=2Y^fa}4I$^oO1Jfd)E8V!>Uzo#LzW_HfK7Zlhoew(+p
zcIBGEhCL&RymS!4j`eUCaEf2P+K5WvO(mk*V`h3(r&@b8B(51e*6#KWca_Dkyc~Lx
z0W{kz4wxU*xtwn`L7DX{&lnyTY&<`~K}YcALHoMai2|Pa=8YNm69E1X({(cSq}P!d
zH#+}FHoT9O@Gh;G8tHlg{~N~@jP@N~-<=-r{$tOiCRgKbhg@IYLJ#?@QY2raaoPCu
zA3MHLCHW`NHYLXxQ$KxeR0B)#Vd9^M7ECy($-$hjT2M+}UcksB;%kbrzLb%_c1>^d
z&WF~L<Owag5IN;}fP=_@H}@(oX^<FW;z&{OKTw@O&1YuXjrcjS?{0@E*X9uiV?Du5
z-C-RvqxlNhn9?$E1=>J%Y<<X~Ghj|E$fQh;S#z}?6<N~ULw9O0W4NdE@BdfOxGAr~
z|1;2bP8*nNt%9I|KGu&tIrTk-w6WYe{m?!>JpJ~ElsHMIaD-#VgWM3cSK4!_#+bL$
zYHAnX6p@1nqtiV1({Q67^e_cLbC8>O+S7Vq9FbXE0Y-x3xp^G1PR&Yu`rK7!nPcxO
znP3?7Q09XCMX-PYWPjDJl|adbY)`r9faOoqvChU`p|2>kc8i*v-XGJa;jf!1lHU_%
zySn9`j;~CH@#e1P5;=RQd=)c5z1PL*(fiJ=XsGITYyZ<#`xMVYIoM|fqOQY;hi6V)
zDA~BIOck$^wajsg${Gjk8IE~bOase*+wvaI^-f9YujNu6A5p1JfZ=Np8(u1zzPc(_
z_HYC0x5;y$=%jJ+XiM_T!is`L=w_+$>;p}``vV0M9+n5czNlFAmUUcSSC)ZE8u@L(
zZ*70(ltG9UPe>PM#~HJq74~)SvjTgV_L4OLu@=U$DKyWdgz*b33f`hL7=UjRl5I`V
z?ok|soKI%NN@N4%`tGK<AtNR83^6geo?RQ~mfg$V<pKS<6h@0c=LA_w;av8f-qz1A
zFt~LrC)>zETuu`D9w_<i!+mhT0t%t}OC=kDH%CiORn}@bDs~*@71GAK{>;W@v9u?R
z$p{Bk0fWBIwvx;yy7N<>yj#E0F7vu5CvT<Ad}=a{If0Yt`h_A<J9g=Bnw7XOm`kTB
zA9{K?*}|P9{7|}*9Hy-Vhgu(<6=>t3jkEqp^gl-1Z+w;q%7+$=Yo2MAi$BAK@(i5_
ze?M@Ue1#pguZXLPukx|puOyFy`b<ma`}Ggi+VA#e^a-TDw}UcTlPR|a3WaWrM313n
zi(Mk%{0(CB?x-abu=ZjriNDIt8*>t@->R?MH1MXTL1=_hQud;IYe=SxF15IU*BK<7
z{Hq~+J-|QFGfXuv2Q{|r^2hTBDK%wli-|RqQvvIm+-yQ`mCRC(W^qAON-ft?*4}zT
zn+L0PoUM%*I@QH-0Jc4-zgLkze5e=zPWu^>F|lD!wd1hQ(4=DGH*q$fKDtTpDu$>%
zGcK%;Gs<WEQmT*oA*s0Tg5)$#pUGb4Y%=<1FxDepzk7%An!#9ti;bC!?Txpd_-b;8
z<bg`sI>p3ESvEThsq1bi6!&@QU$bSSIS!#K4aah7GNEmbPl8rs51lPtA)bzQajWdf
z9$%Y@fVRx>Ky*I60oc9sD2OBHd)mHeU?xgb>=9;?1e)7y$*77)6RB^ePokmpcyhQg
z-*RSPVsqVOOj@8W6;rWS;KFWYf^jJsgKpr;9F>y^g6x1wh+DswpaBVBvSD~yfBKO~
z64d<8=cTHd{lzrdtPGuh(M<_FREhd3pj>e`+NkSwE*3h9poUu9h{tukVaND{F;xwC
zBxW7?>sq3#*7od{LuLPcqv82~hmqSKe{ckldq)Z~k#XK?;cV9ohU9~_K`HKqHq0#C
zMel%S;>yzJB3P&^DR<2vpe7ivG1PD{(uLtsbX$Z%_ft(N8k1vRoJ63~u}6*qLV_nq
zbos=#^Wy$CvZM1@^>he5)gdB%AY0}8>~mwcV@-Xt<z7-HEaCBx<pf>i+kr8jyXQ2m
zd3Ha?YLz(uI>BFj;^|P)GX0t%cGWX<teE~hjYIYzBwyGe{YjR;uTZ%0pSP{s+FlM&
z$LvOT+Xu*9$a?7myhp(a_VU)Z==q}CjCPy;0Y21;Zc!IOg#Y?(qj3yeB-ktQP!5LE
zzpG<Z0Db;;S_<&Bdp6%-h`+-D%)VY<z@Fsvn1cYm*Cg|_>LJ0mHi)mTy~T;onGmi2
zl6ID9;pOkK^%m+8**zz$U$G$>z3_L!DVUy6ZqefJCW7P-M4aST{jy=43qjuX2)+OQ
znWiW_^EA~72QAKBE~E`$3d<`F_r#`uFVmb>Ib((4KYNL@r;Ob74SJ%|7j&b5>*WCN
zDAfv{k%Tw@bjYy+H9OFRn+~U0d~I`De%1HuL0p*jtZ^krvqSLJhc>9d?@>rA*8Ann
zDTFWmPy~W141bz7W6PKA@3BIo<77=`b%Qx5nIjLg-jb_CwaSxcs80g$?sp|+<n%V_
z5WwgXAf}|g<pA6~;Od(lCR%N>bec2W*!OH+N}miPqAHh3f=^LJxDSN6QNJ*eLZ#x`
z>AIPHk5%Ibgzl+KslQ0(5cj7pjjeh^T7$|(mbT*@!qKqURBK%?qP%9L3n0{@YT-UI
z_*s{mt*PkBlyXJM4_hsEh+j;LpC;BwQ^Ab{D=t&%u=l3;d{eFvP33A);_kv($d0C<
z{X861_2`va1Gpl=R|ydc)#zad#hz@s{MavmrYDmWmX`LQYX+%85HP^qQz+|x=ybbV
z``XJjD`1FNAF3qbZXOjv=S_-Bl^Y8b0xdnfcx^b6)w(P_wgzUguo%`Zg@j0~w*Q>x
zbnr{u!a8JH+WnxazeRH;%K(C;g5C0fedaoVHGIC9{q})pmI#!62W_o+TUm0qwqGx&
zsMXxCaMmNPt`uBWo8FqQW$X(2QQX>P$O=9h%-$2>G?nndMdjvItqj>sO2~2By6$Er
zk9w+!`=!-ci-)!jDVd)9^~SZ2Ab@^vE4rH}2jG!Iq*7ig4B*1?BG`$h-t~X8z3&?9
z`M$n{R~aMTQaqEx^qS`UckjKiFQM|{&DAiXASz<LUtcU-)I~*7+($ht;QrI|D}`w9
zaZ275lysnUs-D}b;p>{}V11Xn52r|2Kena7p-Oi2u!!Y?>d0GmuFt@CW#%o+RudaM
zMaD80ppvGUK6V>_taa7m79l6a<GsP>x1(&9gAU6K_6?>&(o0+$8yAaa7hSNoYMd%h
z+hwliAxq6AiveL=H~9L12A;6+1}*Iq>@9wg%>8Obxhf9V7II3MWrSwQ`aYV3rX(^a
z%$}5o-;=*ItNg*VKO<(EtVG}E=kz{R4he9>0!gyDQ$Zo!#b?sqApiECN!U<+pS1Z8
z+O#GYepYkHz-GhmFUfIMkDa$Y3L<@BskMoe*n+4woZNamEZ?s(n0HytB~Az`4|y74
z($%A^+jaH!v2lBI-lpv(S(!EH6%C5(I#_3?ZnP7!9?j`~OQ5OSFCCoJ0elXg_AP)@
zcID3wc$nczA*Qjn4L=EwFyckKOIoA(l&iC-$g{g_poA-~zgaxCR~X@f(*35?o8Fww
ztX^rkrKHh+3@mk?b#S~Scs1pjo#`*aGKRtM;WR_}7{+ssU#kuUzi{``>~n)^JY{DT
zdhZH$WfW=^=;iP)-&r93d$ltSng8q4%lHS2hpTjln0+URNyrGOa36$u8zL|D)~j@;
z!+=RuETeNw8P4moTA7(fj-i??KPrN$bf4c%4RhQ+_0n-LA|;=4DE>38w`D?IA%3kF
zIX{)qOls@~5aeTx65Mp;#$7@orA-;1r<Ol$Y|(TNm8ngWM~rN#sS_qp=R<4hxu@^R
zMLa6Cz{O^LsxuzO8b6!-aI->hP0gh#*+CPXcFC+*+NY=RYF)29UnPjg)u7)Zhv=IU
zcTYX8crI_?OsK#sB`9+<#5;c;Q2cBlu-14xAhV@0xJjs_qz|TZ3Lxb)`UZ+yauJl$
z-b|KWJb+o*ZU>=rdVYx59_A+s_!YZ~xW+&ZlB=}F9ASuLgTQF~zdPZk+vJetzn2sb
zsyKItJWA3WEArk-aXT<7=<U7TY|Mh^DwGfk6eldkoZEfT(eIayP+|jJ{P@qp;|({`
zc55-bgYp?vq)e`LBn9Vhc#^a?+otO48U$HG1z!xL(#iI%hC=#|MqeY$M+5D1Geo|w
z&`Y&;*rj~zYeJ+Ov^=@Lv|0pws9ch;GU`mI6rm!HnI|UO2Nkn={6ZH2qU6p&(gh3r
zuw(d0q`Q6Sq&2|Fd1I6yR*M0SrUVNgoniOYM_of@DnBvYvj1;hEx^>yX%+_ffD_#?
znrcV;9#rjERJTmhXTg=>T_BUGklNLQs-eDv&871{2r$`H%cedZz(7qM6M6R_8RtX|
zgiM?-JS<7M;sY%1@5|bv5jercvFt1R+yv!qRE~GJ$AH_<feNlSD&O7L%`1qnWJ)jH
zUNG_9Jy}<AglZT|&!79uJE@63OULTX3pWU{BGaDv6XzxEo7y7*-841477e{Tq13J-
zRnpAq@f_J<7cU@g?Zgcj2QD0PS8)i}0EvN<<Ze5Z*?NC@UeXBr%QbQr6f~8cG9^Aa
ztHIo}<d8>%7{$`&u5=+$qATt%r?gnmP&DdgoFq#@L`|F}?zCi^1n+)!;&OtWNLHXP
z=aX=HdQ3m*Iby}sZIW?HY-{e!Tw)+<Lx!^f;1G*RM*FzMr50vUfn)DhSoOFdEgCZ7
zmC8vabwLL*CPd&y^}0*ko0h@cpL~sOZ*9(7VZU~CW#3GFWdjV6@*LrBY*ju9uG_GG
zRrSC^<-OPAs4f&8C-=k7<Z(=5FZav<A<Mz4qbsA}Ro^~Sae-2=eqidh$cmEQ5GJ}r
zG1va5&fj$wYT$R5E6N<M9GiC8kH9Huj@K>7yMHRnp3Fg2e_?9s)4=pcq;CZMtLlcS
zi7CR+S0F-0y*y`+#u}1j9l>Vb{1{eVz&GY1QT{o4iK%S+dsd<XnX$*VWyAj6t|UHF
zz8-}A2{lH0w>ga+QZHgGt&o`rc#EX*dxSqxxV}kqyopmmlsBf&%Ivw3C;tl{Jl7$h
z@I=l-=*3}{vM%V5^OqMX`a;6;i1&7s*-qTEt!a7NMc|-(U9xnu%zC>M=*LF^;bPmP
zAf7yF>$Ll6z$@cySfKr=g}2lMR8G}?l%lOor=a@f4`k|RTI^Yo>gT4XVK0vRJ4kyn
zZhcM0M8ObZA9l+&Pq-pbj1=}Rj*?cUA&oOWj;W+q^Sj2&<ylL|zMdqPPXfnbqeu-h
z)=kzGWi)DC+9b)QvoVg@9fFg~tLJ@i0}%FZTexLX5CpXb#ww0Swh!>>9blne?~gah
zjLB39+_Bfe9XJ}|#zCBe5X*Hy@uAWN8+`{#s)j7bK_kRl-&1Ca<oXdK9zeq#S&&W1
zg`t^-dPKAtTt}aSM~9Y`tUfWBC#Npi=>)B5bCXSdL|vMQ=tx2JekrqVd4Jm5Ipls6
z-kr`;%MR>^z`A>z{4ZvDX~b=Hyof{Mr=Kh8fBhHly{(a8n|Jq}t!Qy}jNZ^7By4Tq
zB#NVJ0Lp3ftuBjF8+yBz?zKgg0)#VLUw%C;&j<t$`Br7CSY%|1Mh%HPC_?(m=*Z`u
zTFC}K>-NX26;7UB;6QMRT9>?(C=BmkCDkM~js89={StAZj`CBH`Mb>JSxGCU*SLU5
zj|L2SY_t@hnu$aFq}w@eb(7-$V4GkQv|rfr9*Q0d3#&(Nne2WH%IDx#7$0}!If{xh
zo-fWX)=YGM;|nLF0ey|cFq}(9-VQPL{h~uZdQ|(%d!u)|WWt(XM}Zk8=WftAdR+31
zImGT3e_6u@r*E>-^pw_JEtVzRt;`(}0za^abwI@4%apHkLCkw|fXM0uAFrLQ5vi+J
z_&S7iU2-t~!Y_1|h866(jObLt+JVP)`RA2w{jhC!JN@IE3Jl)MCQ&It`ziaZUJ2Tc
zKhuc9mNIw0aY-64wUO{lO$w6cpJpQZ@xK-q#*&vDR0-c;DX$3bEuWf#a-8EK77&e0
zUu5C5TYqjnH#Qtr^W|#a$kS;Hu(Yx=69a@H;+tdR92A_p8&>}8iHJ#5tVTS^rnMQF
z{ozVlsx{3l<mP=n?%sEi#QRqx<$Z2yohSmUvxqh5w?akpCdY9UaB!@=H%X4moz~v8
zv`J@UMVgn96LFd&i^J9&5Dguh?KZ_7n1*yB7bHyd?1^tc`EIStXLE&0dC8WNy8gHA
z>RAz~_EQ-<OeK3q{E9xfTg890xjiX1$vsVPl=DI17%}K?vG-o_86PU}9Wp+OsO~ZH
z+%NFf%Oe*4Mc^jKRo1-P<U>>DSJ=P3Q>Hn=%ezIlKBh~znUxtdR1M`xUo*^A`gvD;
zvJ<tBeA&U?{$b55WRxIGUCE}#=>NJ}F4`AF$n?Z2yPUH7OwYjfKHDn64d)7^JD1Yw
zDF<o)q!XKT6?K<VO$jpNoy)E&{v4K}3J*^lCDR3PU(4%St?uj?1-pU*V&L}G4cl>}
zi<6B65{r@K3l9kvQ3JWYv`1okj?Qq**k6+a`h9=uUER)`7YNf~gPB698B4LR)+q1S
zA%l4fF@Q8Nmk7v<Qy(EVJ?;-yo)dp(`4*WPV24XU1njScKZN_^<o?(gz>CVLArqcs
z487g;<_=Y$>VVp$h|zC5K=jIQcI-6pLobi%bzcg%gh5WZ)BV6zWra}Nh4shgPR4C;
zexiT&Y>Z+|V@REgL61+Kb6p?tb>qCmfcaLx9wIJ-iV)9@&K}Uv|6XO(^ZofrqYKkP
z5lndjB6_tvXzHkO#rA#SCn;R(nt|R$%kuvFzj!;drNv!UC&q4@jcbNLWp^Flkfgn?
z9Fb=bxu;uW2$uu(e*#eC-AoCMNTOz}NtH4@c}9BfR3)VInqeeFrb-bdqM0Yd8kh2(
za^9>rpdR0`?zuFVjEh`sTf2izCqA9Q`Ag8f7cxhyzXw*ay9|~*g!rerY(CQ%;20VR
z*D89u)F|+;j>W16IZdB80GnKRj~@s50;qO%Ds{%a$-8|;&)jxur*XlybQv?&V^d|+
z*|e#sXr<)s-=3jJZs9SXs2AaaERI*0RQj)$jnU9D<<t9$68tes0TH^4V7TycNJe%@
zBDh7U2l(RI;-aXF15DwpW*BDjMwV0X#w~Exh0$DlgQRZEGEm8>4C}tHV@6pq^j#&q
zQ5TK8I=*Q!&N|qhAzcScF(NSPmN?i=SCHYU)uW$5MDJMFt8sbQvSL}Z<03ukgb+6M
zs=r<pz^vw`T|I(TPAq;hHPQJd0RX{6I^(Pt@uCY;;RPE`v8ieJ&&F1)dA@dr-Ad>~
zhvuZGwWT&WkLkjvsjj0nXw90gK>{W!QY|peK*u?-p}h^IDlx6YUKgqZFDq<4<MD2S
z{-C|7+ek@>m=XR)V%9EdFAWg|2df1=Z<YQgPSr|_Y5vP%P;}N;apaD1`o7C)!R9@d
z0ipck7||;?4Vthb&160;gJ!Z^{ORE0%Dz=iq}BRc_kD3Kx&kdlw)YVjA}2hyCpYdU
zXY=eJTsmw`x9Bw1tY0H<{#$d8(Zw|b7*%5%wx)mDZgZ?`W#86kRwjMo;3Xienj&c&
zoxmC6@6vb8Aj6j&Qw!5Cly22u6~seqMV!!2Led>7jE%r9OG4v2Uk89qY8DP2(8_yh
zfoiq78f;>e-1)EMsmSt51gdz`(j;=LqR;e+i<~1{+*o#M#qU?N?D@@M^{u?IGY&==
zW~x?Nj@nQISj6_fjM8+mHvITPOta$)o_`BFIRBP^U%_@H!`Q0|TNZK)s4Mq!0iB+I
z?3TrP^^{BDsc%|OZz*U*e99H%n>=GIU-uCzjVSUcrw%e%>`-{=(q54E5=Wcyhv$=S
z`;}^axERQ0K=oGfMo%y?C<Vv6L5VOZu25#BVsPL${s{yUhC?dg1GK;PN1vm^#*g(r
z)zMyfkY4e^X{KjulW@yaaJ|W96|yAIbJ2o_29iPGlPalI-;CS0uN=l2p_Qh$-=<e(
zzq>N^2D}nVJoaUuz<%5tvF!W=N{+2LOOeMeq1GwL_pa#L=8vwLCiCW^Y&agm;*aIG
zhhSuN>ek9kbyXAmCzqj&1DWcWvvFSZYO<%9$+>ln7vq&(t%;|^J5yti)=dni(uuwc
zisEMpmFl$Y40T;#L-2n43M}BgC58!2m&6ab4?UcCR^mg?@BRV|d!`0H@_%cx-1hgE
zKY(+fA9}?T-`|IcT&hkhsDJG6Y&-J1pWzq)m)~A~S0tFqItm2GtEw^ixaf*2V_yH{
z!lorlApQ&RFbFusE(hy=CLEKWA2jAMc~!@lgT_u>B;i*j%>IJ-t~cc3-MU>b(>755
zs3Eb#(7UQz@xAo}vzL9SWGIRlZb;tao~{m{^%u3)s09@bwVgL5Iwf|~T-)xmaBu3!
zU!c8xUx|Y@pg`buZc`pI@`*_qu=i&MM1ti(*@%Hkk<tY3LLy<1fc=dwQ`f<sw<g2U
zT}tZ2E?R&^tRJLVs;s#~O?Js5bXe5a9fgh6b`6h^6Wlcezeb>RZIu_^$iH7gGOZTe
zv^y)C9%FP6P9_=O0PGrQ2uF-OUk8oG)LLa|NAJ+W>^SZpN^HA0TBs0>N@VS?fPi(o
zQ+|zTkE`(9wDIDG7V6~WXi0;?S+ye>1_7+=*X2ow7Q_E4OEclhe*ve1vNk2&$~e+d
z$4V9xMM_JfDJd;MZ)e{o6e7jVIdg%}2o3g*cq`J&_2$IlMFp2`g??)3Y65wwjUy)4
ztB7$3&ZD7&8R?uzCoi-|LEx5SVr4q}j6HY0i>l3<62wkI1FmjKf;|n??H;SY@>x#a
zJzQ=B28*U+5k6MMS&86;&!+0{a6Bes5S-8FZzG(AJ82pw%J);R8JLYXY!6O8IZE<r
zFAr{hTbTQ@r@I1sUBnRxzDs#Lwlu`|3U$Ucm}6leT|;;gB3mT6H>q8w<j&oD0qWZL
z>YZg#olv%k;iO4mE!(+w&KPKo<uQHe;r_C@d41Di6CC#@5I_T&eUyxlM*)a*m#wcU
zElP8j5VyU`Co*~#eH{pN9CBR=(4tRC+rjtJEA8$@R|VvHoUh7J&K}E2SuNLPC2A?&
z7cqdF{=UO@@nl%YDE1X>pb(+;SS(FQvVV-rz@x`(*0#l?s5G_G=TKWl{eIv&U{IO&
z)?>MeKZ7!-N*a#CsNNh+`VL@OqawM{Cs&RjIu3<;y48epMAg~PyiFd%K$6e^C?~F5
zlyczJlz?L@&r4(P==Sk5uHnu~t^s2mdvne!<lnUl0j{`$<03WKe)1xKO+f^i7Lb0*
zrv^q{A5;z9u^@KGCyn>hK4y&Syn`=peOcblweJ1cs2BRX&s>0S_+vTri0c@1D7T)C
z2QRL$4r*>y`$|UC3ek<TQo{<3sWA{MIr2~D&G$Vr#a9e(r@(;)z~tCk1=80CLzSzs
z#<JFBv>@K9h@g9(oPi#Xvm#7&Hz|+2iE{L+@^S604r6i1AjVZvG}x?<QBkGHfLxem
z7d?)Ii-4M(fO3*|ThxxH5Ymx?@e^1C(1f7h@_s?YXYc%~_ieWp01i_IqPN}uv330;
zAYRo(0#EX561n`fRctFP`DV)0pjhM3ZCtdwa#9KoHsfghL&Lk={o8-Rh8z1K9C{xU
z9>-JyQC|4W>Q;}~xE5;l0$jq7M0UDE;;ma1&+Z`4#G=_Cofzo78Bx{1A@@*8;nSyq
zLEJQ=d0l3phwq6$R~~PPdAFi|u!|k1%6q+tG9wS8vm$XIbz}q3<YAt@xnP4ikP;OW
zuJL|1l35l2(o^H1mKqp5Bl*_I8FIuYlvM^~P));W00YCBx=`jr5l`df#&lrEj`(UC
z>tzv4@+3w)49%|r)qppfdhB@FA>N!g;K26hwBRpu(g=x^`ArIU)r4HT;-E2NUq?!@
zv0IEN|BXXbDTG&|5OGx!F#Bmj0VqE=BMB`_NVGxxR>!9toRX2ej(kQ^HF-{_&$UCi
z(RKvHh-%V?Ak7slkqesamzDJz&>%fbS~_eRi)h>SS|9VyGK%#q)CFfScbU{AzqTIe
z_&ULTYMjB5y#P9r<a2jT{AXz)nO`^Jb!3f4(f$apm*!ouCxsbL%avHt?2WrgS&3yl
zJf;bU*#|GtI!GDYfk)6bb5W(1LM!A#{`z|>O~~BixfSsc`e{o1f&XFp&bsbA$k+Nw
zMIGQ|xXBh6*kOwanqYQt5vxFbUzus4d_)NgMoI%!-OWRoq|OrfeLO$`S+Z9^!T~a;
zufNVP#{JY<Gn01(CF3(;{XrbxeOB|7V3M&^y?2}cj!}mYOvZ;;VGdrU$PdVFXo`08
z4Us3f>vEsai<I0s-QShe$0UB5;fgzquqi`slV<Z<NM-V776`j2^Q-M^25FX-YX*&B
z?_|wYaS75FEEFWsH;Y%UN6BU{{GMLIG$N4%d}=l(Y*VHzou1J=y$nc5@6SS&Yll6R
zHi9A3p44<xa@-eDoka;TegrN-xiaC`n0;_i(%#5N4~3pLrIn08Ng;KK24B9alZD~W
zAg^}=2DKL-@$j7D+1v${pY%}u-!plZj)!G~WmG-j<dvps+Rq;tfX}_E|215N@Jl}C
zE}L`vL!76dMR&^too<f9w%u1l!my%h&ABg4;x6)E$Q9-kXN{yT|B~?y1ixY%*cV5{
zM#U&s4!^oEDQ+&&ikX90sTAeIk;NIAAP-)g4GR}<+H`vS)>-;(V?4;S^D-`ATB=7A
z;$ozbamHKk=&aJP=^f}j79n|yT#MGlU@DfyxuObYyWTVhOg8mEIhyyvaJN~(C7iXT
z<oJ?=9Is6S*CaxOIjYKEGNP=^W-m-RydW~CdPwx*<wp}AQK00{jmubIWz}V>t%EAd
z!!J!JS(>J+8efX(HA7uUVnM##xe(T9@uXfvbQ`3X`dFO^ly9rirG`Em56hgGWca1}
z|Ka^C$%AGUf?dH`2djEmh0EEdiguSnl`1@MtqtrxJ*8>lM<ru|MueD&?VP3PK)_DY
zg|)a~jcNw7?{l&vVLYxN_)E(EWujWXpdre4|A@9!R{9z<Qs1u2*~X1X5Aus}s7#SH
z?SWxZeA!Yq@G-vYgUTi~D`)(e{M4i6w%N^5a>-6j+|r?8in44Ou;=3RqmX9nI%psF
z%nR;bobedbW70{!lG9+JCVX4%;2-eoO?Oouj8IP4Lmq1DM=41z4#=KD?nH5X-namF
z^!JV}HOd|k_hYZ#Cs#CnvA7-6Isf`ys!})F#%Hs$B3r*m?VgwpX!FF|;6Q3QKt~Mb
z3q<C67PlG5aNACEXNBS9%jsrH&2T%%4(ZGO(6h2tmZZG@i?a8QYAXHuzM0V(6}$94
zBB6vPolt+G1PBr&K!5;2fzW#kgf^o{2~A2sx)4GLp-3mxkt)6SCcT%?L15n8&%4&M
z*1g`jpY^=|<=Q9zoxQJf&b7ba&z3pxNg9_jYArxVd1tMAuC;EVU4+yvJ{LS>z>?w<
z841f(Pgpc`D2mlSllX@paHfzT)+>{NZ~GH^<;A0rtXHmHg3V$uKiKM|l?*mR1}sbT
zy^!3k_)!8Z)9zDWQZTe$Qio`{%6)AM$recUnwdY8yWoiH+vp>=7VJPhj#2NFyv=d;
z0=?#31#WoVA4Jv*;hS6fp)u~gLl>z_s<az^)=@~1*%HS2`ZUT3Y<dC0-%o8Dls@t2
zi<%f27C^J^Fh+c^vrbF;hb~*&B&C#sXLv0FZ%eFAh&*5herm4}e%E#m;B|WaPN2e+
z{c9!R%)ls3Bx>rVT}X84->PkT;;&@of!YB>r!vo&OJN^eHY~D>S?yILo1^tY-WIXu
zMgWDiAN~eFp+^&pezx0%cy#opIBJ1CoF^aqk}He1t;wd+MNHO>x$wfx`qD;=k%GMQ
zx?k?hgx!)GyssDK^Pk^nXGC$fUmu+S|A@aM0!cisITTJceavZU!Rb<)Q#Ld}8iGNm
zm_K5?Ws@4%e4@sd(uCTdxF={869m}3Wne~|DR>5`WE#wf@}6+#rD37wkie~5`4QuU
z`<r~1Dd>V~u@JPpL#hFuX^l%&P26OqHJd9Td7$JZK7smDyrEZe!GOO6>S1AEn{_L{
zkv=ZDpj5trEMkN5%^f#QI3)!cSY<tE(?>_~6q>iyR_1RY5~@v&(~-42m@G|P)+5p#
z5h@IRWMgbZR3?;w)dO?>UVq5~E*>i15dCe`;8Y)b;OZF%@&KcAQ|}HU3CjyCIsV5I
zqi0vqQf58JX!WRJyG1j&$tFc5)M5wt2n~f*t6ynz&Y;A0@s11ewQ{VL6D`yL>5`xW
zh28NZP&!RZcD4dbOicVzJgzS)`fOLn&~9xbd(4Qv-)ITGEJ+hhZyR#*b7uyq+ZT8Z
ztxlIQ2n70N!G8j`y_V!pVtMW=%6#~6IM{myI}N;(Uq(H0>EFjF-T3RByfcRkm^raY
zDYGoO&S``0=Kp8spaovx+1lFmV3BZ|7c@4RTFChPNPu3nD}#L~#1!o!H+-a$6VO!Q
zM*g^H93?`)I5@ZYDH{!bp4s-IZsA%#)JnTu^0r%LgQ0^BE9<D3s0}yF(L!`0Hx9sa
z_bO`5%++se9Q_>kn@*dx!=#__VSw%}F%CUjsIS%rTZ2bqYzb+@9<EPd;X22Wp)wm?
z8LtRz!qWZlV;T8F8xy4Hf)GUrtSh`+DLq7h@X#A=wp;o#A-t`>PIN#xzbvHAol5A2
zxNBa@=W7K=5HC1Y9yG}wd+ny_IE_EE;fbhqe)*`Fq9Z=Cpz%waJ<_9Ju;lw;;O{S4
zv)<P`o!14mju|OpQWM?IrnIH4U>tdtq;Jo4nik|Qw9*R<1;7vkhZ<r<&XLWOnL{DB
znU0LiIUWz9j@dJ8U$gBfki2TILpND5#t1*57hvH{6sg_lvR*Oyj9|ru6vC1hb`yC|
z-O<)(qvzmlr~;!n>)EE)a>MHp(xUre1NflW6}29@;P%Phpx_9TUo=mu%>yQJ<EHem
z6C0mbip1&N@H*-U3GC|IqP7LLnl~~2K?0?{9aODFE&_nw3_m^+1$b}*TAg`&G7R^Q
z>l#b_d{G%B)F~FJ_9?1h>vr`TjqRbrt_Tnq184Ce1&p(G8F+M8ZEB4%2}ZOgrPM1S
z&*bm+Y3wx1f!CI5wyIYwNb1GCHS?#!cXiJjt*@rCG!EITZ-_F@=wr`<2#LH^Sbo#c
z_2`=lPihaJKzz_ZX(4ZsTp{VvZ+*fU&78<|m)#Sv%5hQL6Ea8`WIsUUAR^P{aPzM`
z$)ko2inGGoERXe<tT*@D9PKm{rzXm>^oB#3R_V1q&1T|>%uf@&SwtbA>Yl>=4!$bj
zG>S3e^{`-Cg*r?Av8FNfcS_Dc35-J<8dYGe^`!EChBs^ymjz>uXPi+QO!`84p>4e0
z<IUsEPr$D`lMvDypm`UhtwM%|LVSO*vo}36uO2$|!?W1bA@`<KUIX5f0Ue0P`?_h8
zm9k3=fBH#AmPWQuaV<V(Q{69t^YzB%{StSoiu$74CX=llng9HD>b{8_>ieLGb_RGA
zH!lry)3J%kPm&Qgo+ya4QGoPjdm2Sbj);5N7MD$6P!f+l2@7Wl1Es=1p$NkKyXAPQ
zsGgxY(f*aSa9gK_!CZ$HXOYL3B9^h0Q4l<m$mFNJV6^JkHUw2(HcTBt2C~J-a0v;C
z?q!n#%Wa7bKNYsYEa8iQn8kD3S;e7d*VO*SWW$xi!=EBntm<GPu#gE~VZ6%Aza@^{
zVr25WhKa%#=Te*Liagp8Z<oRegrme@5ehzUO_=S%k?sclzwHMPnWnedqd8TSg-uR9
zgN^^8+xFL&RlOV9{=;E`iWLhPC8SKvp_e=1NTW8KUEZ`0cGWsYroEP|3(wfaP<&Xp
zj3NwMhDo}+5mPd&r^vMVjaA3?z+~9Z+N4_%GUlR&c4yXCaPp=t2sex<6Ky_=a>$oG
z%1`c3xQgkrjcwi!68>hEPrawS0XF(*tS!yH;a%MjGu^f%G;C<sERThciEEW?9k5X9
z1!NRvvBXriu`N%gVzFequjM9=Fp|#pc}}H7jjwsLi`Mo*d2TUWy4{2?mHuddB7e$j
zLBF@ih|)uf4LMDyeueE|`)!|ORy}o3<0ct;?8YRPd6ahw8g3KR8ES)NfQoiwdc}Z0
zb_9{iuB04-lH8-by6??}eiq(8@wgaD@lBw<V+%~wyCJd=&YV<6W>Xc_So8<6A&ni1
z#Si)o4<$7Iv`Q-vdA7Q&#XOwMK?GmTf^<9AW8lvs7Ts|!rx?MG6NS?4702Kw4f6lc
zeU!Vp@2kR~al?-|XK=ZLn9F!T>BbE|xDnDNTNHU#{bpm+ThhV?xd}ZT5c5v)tfa@T
zPRqW@BV8mC?mC=ue@r*F{FV3oiQ8~4<mvkv?p5L37ks~B*zAocf`2~Kex!5s2Yu({
z`#6S~q7JCIn^0=&YRyJ#6$%Gloqt+MNMc^?SvK5rs}nSNF6t4ZD@(vCPcXkuiv&m#
znJ2_i9%5p!x?#)Xw3~S|#b9g0Pe|fDiV*hR*y;muzyN*(2fM_Mq+78F<bV-Tz8i?=
zNE<tCgR%8u0mdyIge-Paxs6n!7L$%j70Q-b^AkK!7c{~~B{=G+E0i`&*ByvJQuL$h
zKc}ea9c`M7uQ#Fu;3lR`-$y)i8%%%W&y4BGd3%D&E$GWhpRE>p3WTG1YHL9gJE^_m
z_dZ7~{>aU#G@CSYnjzv80eDG7Yb1hd96;TBS7PdU2=eA1eYJSal0E!wQL=H@Rik`e
z|FK%SL#H)-*3K(=I68CG!%&Fi5nnEUT*BTbzF&@q6f$Y)K?YY!Bz)6F$TiSZD$OFM
zki@LW`7nGeJFVViqk%<#)BOFS0j-trCS*QLWQ2X{RQE`ui}V6UxGfs5^5FztKDxvt
zQnC9bOSL0-VytqiCmna>MtASee<{5i9qyR|7GWpZLnQmbBB&HG$Sk!<RNuB#1w9Si
z`-!pdIu}xtIGDX&Qx(6cyH@?#V8g%xt!K<hM>(fdJ%J%M1IB;ra2QSwt*}|DZJ1Iv
zy1O(|nnV;|7+s%lTlZ)`+i7AbiD@2ceOI8DG#uTa)X$~{YhDDX6({*wBq$fe$IH)H
zg>*37ffE4GT7;sxb|-%HAG+mOo(l^X^8jY<il3dsP)Dj0Oi3Y%a29`H!?QzrJ4A?T
z(b2J^@n^bc4533Nh)|w6*AuYy;`BH&K<?IWi+RhJ(-LC~dO;#eWvX2#Aabmw&7~j1
z=BEjoW4~!t*pJWPM+V!lpToCi3$W05Cc6o#im<F;Trg^7Z{Q+gguZjG%6nLN8qHX<
zV!QzlL9MY^naTGtJGNz}9a;=5_22u4?(XYX3-Wu+F7L!LFf#~ApWK8)*AvOpN{J`b
z&YEJgD8~FQa@~+JG@4##ig77>2o-4rvp;hUenx}sI4YYs7^8j*oY&jDJ?@+3sGcXm
zsP~e&gA2ZVa~0S%v*cJ2xq3@(fb_etyVEu~;p?OC1AQ&^f%LL*;A!5p`RV=nnb>;O
zu8)s?TS4e-W6@;?f~UU%ua;}$=Cny~eg(+R75_-NX?*uDgKZPVKap)HzO<2~?KG(d
z^S@nv!~5E1#D1H0O)(U9VFAvj==skwd8na;FBpN+AX)WR^91zBErECP6kkRoIk&pa
zE^Tw<7nB=p_HG87y17Gi9_Co}*VEhW6a2_lc`@~05V6h4urWIw4L=OCl;xd<F0;bT
zeBnc&TPS^%rcD1Qq8z}ZN(#}-UsmtBD(Z;mfa^tZO{VC0@i`0?jNm{O@uiX-l;QaF
z05^nI(1L6ML^DqX`|XF@2*Ks_G3M|9TmO#6!#D+}*hG%4Y21i_72=iWVtba`p}@;X
z2t3B?<o5QG#HZ%Q9fYBR*RcxeME5;OyIiK`qoKW(u-wCajpjy5Y#2DhNyk@@z-G{D
zlp11L>5&jTa`m!VK2U|>+kSvbMj1^GoiVN`EVp|s@>9pc%$e?n%iDh`8oD#$l(~I(
zrF^PeV&dB`xe0Uo7VCk9=NeNgEW4N9V_4Tc=><_1nT6^u!H$HD>2KF#N~#aOS=u7S
z66;7F&J!oToGg!ggAQ^Tx{7lvde>uAZ@2U=Za}I&HO`!<ghB4^#%Y-pMcGQBqqmGY
z6uMjFk46kd)Mt{0w>EvUk*wi!QZU=Zj-ik2U4;O~X)5@#*VkcO+uTpGvxJ+X<Jp;&
zs2KH@cK?=Pk!N^U(wfz`jjm!Gf;cpF*{=<6KyGZMcqI{UJVqAtJjnn;z2=U_id0vw
z!^--Tg7g+MON4z`!WI@FdLISn$wt;!bCFQ7M9~c^6l)ECZfg9jin^nQNV$i9W<c#m
z52@v#YQ1Z|TQq9-qxDYQPc9+tY|fYi5Mr&J$;U0ZC^B#^w^khPrAX<vtMf}TM)zLE
z#7m8_`^p3}rkOvkdaMV>mT|B@)=u$$;f+#%=5@rGonkKhgoL`rzm35ZeSaBgngef7
zN|?Qq{$xy%Q^wr$u0In1=d@<d$MV%io$veWXt9-Ln7;iJG3YinYJ4XCHgDm}iO4u1
z!k0(Cd6r0e{y~0p@=TJ~keBk8?A`xT!WMf3Y%}E9VJU5%=XVmEchx5poC;RqrLbfG
z<ZojU!(MU880Yg}(16DtX>oLPZz%uy^Vh9>n^*%qKIQO!?(Df&PrU`=<<`D`KSqnf
z^8C&{fO^Qc4?S=|YvfxdAPR1pQd0D->KFwODOg}ozzX+t!*uedN0XhaeQb;L)Tez6
z9{bE&mXo_wrIc1zD4?X*ZHrz7L(Wszxf7<NvpBK^pMe$CGw{{}9Lzz+RM()@()~%h
zrT-+dOCrSZL{BTIRd>PlyCIAJ#@A95(v;E2Ra|t^{y;<Hy_=Z^*W#HAOXyG@FA_Ah
z`N*{M;t%EVNdeULab%WVsn;GP(rdp!TSK)?+&MWd@L_3+FZyB2elb_r-|wErf4nXD
z!cWY#KP7)8-Lv`&9sR#OHt484_N+!?Tp!v2SEEKc7g`p_u_GsI43!hAjVDIo`g-+C
zx(zX@b1I@L@KY($q!kf+=+S7}Y)X#BKPVeH8KsKhSZ=#eGM|-8>Mv?FeY+(-eX1<;
zTCLYVUCICKC+6~66}OZH56PWLMPsU++uyl!4I6A$WeG`T-yvb!-;E+fO<OB93MN<j
zRb3hPA}x-lp$@qs7tGD?gxbqm4ee!e>IVJNMO63+zZdRtM~xbBh-hmsyr1N}MuV0-
z84z3eR*4FG!$gt{3}#mKdZo5fSWY3nNxhRPtv;e0u4mMkB!g{Vm~ikUi(35U;)RDu
zObM#9q9GCigGHhbUll7E@^Z4gh_GW8@08Dpu#V6yP0PzQ;gy`6Wd=@mAiVnC%wj`Q
zI5>;EQ-E&h0eu~pXcme|gNQ=C4W{gOi0r770dE<GNmR7!PbTL-60vbF(aguFv@+m>
zKj~b)VM4b>s+NDD>->Yh?5-wxfQ}saOWmj605#@Gac}t7<CC6tioM-DNHVTM(NanW
zQC(K`k@1sZ@y$oe_`2JT3j#@^M`|e312P7i<^kPZVCtz2^G%je2dHS~du@S*d-_&V
z=1x(_HahE!xKwYk&LRO6M}%OCF8BmYvz|5LH@jcw`Pso8O58n2XYf{Nz^A11RGSiz
z30vOwt|Y8CKSk`o{k^^U)E;Wpgl)ZOp@rC&N4^xk3Vz`=W_+(i20@O8W3|*(wCv&x
zbHI+dFnsyzpCywe*7G+ORHx*pd=}-u^A9722(_`~*`Hz>?|;f|XPum~Uk|kDH$D8O
zC7U`#&>0D2-kT<!x<6BB`a<`6%D?T!wAlYTPSBFCv`HPz`Oib_P)qj*>SfSx=4e<V
z@6>4fHOp>cyHUGAXst4I-u1bK=Z-8350jnc#&W{7@5Y7vWvom%I+?OGvs!a8Io>a2
zG2^|T4if?>cpzg|&#k@=$DXDHw-)+2oDo9tzPX#Gug)>)uWiI1hwC;J9$XvdC?g+M
z_g%(TS0|$lPZMp~zBQO3>?Qng3PUkn<0@zk7Na{6(GVtf_mN|X#aIq7&JJ->F~03}
z8D)}{pc)(89kT=M!jFTUztNz44dX2jN0wlz8PbDO3#Hwm9+!P<O5$-tdcDw@;Q=R^
z@B&Hb5`25hl{0tq`!6n9S@D-|nwMqat72(=ubqm%)g>lUICs2LSa@~Ss)2KP3iB+?
zvy;w)Y)ZY}X^-G~RrxmBqFpnE<(-p>E=wpKty#M^h?rtdPT?<~W)psmk8fPI;r(Vw
zRS@fvvoR*mxNUaM&~L+a8g7#kFPQqi{{ig7I2n1c(HYC!?CQ#iO`}ViiuBZWhIB!7
zVZVBTWZ}^786T^Cm`t4B)J^1Od}2y0%E4gkHlc-~;a)axSL4yV%|zikQLML?R+Cz8
zCF!^SoCtPz5;&>=BRZ1~%}jb{SM=2=l8H{$1f}VY+KSSUle+yD&Od6RZ_ZwBq%^fK
z<5No4%4Pt3o!?nq^_gC3?&gXKeC1t=;vwd4Yz$%k>4v>0dc@K{TliV!WKfTlqJA4b
zBpc)PY_SA6Zm{&Tx-)2;WpcOQs!peM>HRmgPDgk}a%du^Y0^{m#lFg&_uI6$JK~>z
z4|m_*5>mzHQo3|W-7!`BeUF>n0v?9aPRiN+1YvL^v`4^nz_c74``iB^Gyf~hZB;#S
zD|)*U^EG;Nfv@y&wK_F;YWhUQ3e-gq>`V6qIaI2wz!QZBGuTUEMERO7@l=d-07M><
zuF8d7sI1InF8q?Uip8jUlUlk}UC~R9HI(bmEAQJN=_^3zsx+7NZ$`I7GUZ(PFe$!n
z<uv+fN9&6b6Dt-W<#@$wRa&z^gZP;Q0eWcbK&yWzz-cl_aiBeM>mRyxIPoElK4r7W
zVqqPV+4D9#eBrDUDp$XVyC4M5oL<9i_f5@$dCU&L3eu%a%h@06GWSePxXE{QhFga7
zW~ZXlHoF#t)G~y?5_;v!p+i3BS&D7P<H2$&X3^54p#u52+k^g*`p>)LfDtZTAPdVP
zbG9wBS6h%NJ6`>Sx!2aXiYGl|OX|RJ6YJyUZjkwBo9)-YdGIl4+<0tR%?2$nVvX{G
zR<<OFx@*NRo0yc^3Mcx1u$FZ!bTg9^@`xt|GPmJGUJW&cysn}(>Kfbe%z}RwJK7D{
zf>TJqZX0z-#tS2gWr?S#_f2W7n}#O8@E5~Qe>G)3MRjR=gwxSsp=MY!jyfmuJJ@pk
zNZ$(DV;F-;{QBhOuK=Y|CpTDbVNs9akl^z4=%-oS1Qd&7bneCO0R&Llrl9XumGZI%
z{N!=b-SdQG0RP;!Q1hPj`|?TuKO-H0n5GwHgJ#--IvRGEL~Q51y@^KTL0;26G!qg%
zAlWxpR4!wGutnyPv$i4?UYXQil^YQ_N@Tr#b#J#(=Y%xE-o8sM(jfb*i!RT<vTR=1
zTol&N4kG|73p&-(|0rI*;0yd&$`wnPbYWjH1QQ<@CkN{}<WSU9v^TGcykQD~>D#*x
z%awqvoV*^vOo%chFn)D@o5JOG1NeW)RobP8DS_EP8W%d;(%}-<%s}N)c$1P(Q(-Vw
zCDm_t#;tz``F)85mMa2tT?zC;*f%zd8#+mo9e65QY9-^MvE+L1mc~75#i$@eqSuvS
zIVM-0JzM+CL9}6cu5i)EistbIFbR*wisc_0I8f9!CJ&{4%(s`UoQZj(u9P|+FEAl6
z8mkW5SNosEHagles?c-nRbteSYzBdrRZ>>I)@M%ko$XyNz2}*Goip<v#y6HOgQ*7|
z*OQLD?K<CTNM0N->LUkwBXY@l4m*nGTFP&>p9RjiHWc>r2agxiobEQcy9umw@9{Z7
zgj65hxUSl^gs+f_Kay;&)gQ@|_)`Z+Z>R=Uqd(aS7I}-8n41X#w^l|>Ur|hQ!6m+P
zNrAUffV+wvV5GR@xJJ*KRh2_m8Dz-kP@H`Ly6JxYc~hxhC(e{@iD(YJU_M(q1Q<k4
zX|KAU$A>W#*O8d&lY7WTIziH&mfezNlR!!p=CLO*A#%XUL14KnU15dq^3{wfCKZ>)
z?2{DDh*Rw*fePvE8f=yus_#a-NY3CtSUe!$(s1h4KHb&UZDtKnI{sxkO28`y)o^_B
zf5;$Xd}iIFSMNnr9?RL4y<ZcqqmzB{ix5KeFD=FIgzpW1f2m0=tLq+c^w9|){feD1
zE0M!FRdWEW4TTxiw1l5}Uh^Fsm_{X(4F{=Papv=SY3G1Vw58K{;5#U@Q{Lx#$2VjQ
zmKZa)VUhOJpEihaa_~oc4`3w}mlS@ll0C|!#1o+5ckv*>qposN9n#qq{D(yE=4BMs
zqyWPX%>6PY=c9X<)78-z&izI|glcfuMkX@xO`Y?*ir61#mAkYRvxS7QEiwi#k-<mr
z07a}SL9k$TqW=2Zf9)jvw_JWSlxSw1pkqSp`E=ul%-7>O@u?o$2X$D2VOM0pkK@=u
z^3TklAFb?{gqkb<AjswB9G4$S1Qzb26K-_am2e56nVOn+7q8LC^&f7TqNX4FWbA!O
zBic%s%wX}exsKVHtb~RB<kREeLmq>ckrEubCVc4q)T5~2yb!AVTM2ogH$_NU$3t`C
z_{gGL-&0*qygc-DTzKZ_sH`gno^TAlM4FPj&Mo534tXqGGi(!q-S_oY6U`HchBSRR
zG)wdcd_H_cPXsr>u!e%dlcGz#{w{t~lKU1jdxe*t)_$vvaKu<<p|i5(VCFOXZegW8
zwO*9ZA9W7ec*g05=njR5Q6kU1Bi%HFl+qH{0zmLwIr_n4(ycq9Y<)#w0~&XSSib2M
z*H7+pM+SxZjU-hK=s*t=>P_7OAy<oAZ9H+&@9MWl^$*44P<+GXOx^%5y&|ZQ*!kcX
ze{<q;{gpPTvxq5*iYbqeRec9*(@_@6YtUpKk4O%K|2(N3sy>hSc^UldJklLD%ZOvH
zj3F$k^4CxWi#P$6TWoinJ=2o<4WOvse1^<+RRlVR_l74eW)#;3R@)nd0%RD1UNSib
z@w#JX=T*WLH~d(~0G<F#p+;x_UkVISq8!4XA>><UaVY5%y9OwmhYM^42<__jK@yqL
zX9&ycT{9VwbmOp6X6q*Uy07Yd+aGTd{T_e5!=kqx3F0emrPw&*=pMV#jvloQEvw7;
zmmzYqlMm7Xot-oF_MPXLD2T-5jZYg?qdM&2J(9-@4-PIB!BjOOPQC74f|OwrMQiko
zY+WTa{vkcywK;75g}2XZuLTCk^KK?90L}WlX_sE|jLXkAejS;PD!yb^cAeCC@N>_Z
zWE5ZjJdtQJUsP6dS+ecBxx3pje%*G4MmN{QK8e4+F0^Z*;j^~HvnfYww$&qabcKKZ
zx2*ox1xPt>p(OIeG5js8esj=|<*<Y?h{VINP^m&~S)>#x4_@3p(_n56w)E-7x~*_l
ztQj@tP*BMcfDM0t&iZmnpzGPZfM*laKXm>7(2eVcEHT|Ab-{b96O?T@7)$^Tqb#{8
zi-K<na#@A~2g<kZwf5oi$7@&EJdWh8c4EI@XA&RAX2{DRVCmeaXuCt)v)h)y=8Q5S
zrK*kZTMhPn?zv^7LBz(nvw3l;G=&?_sPuof)hhMB$hT34bMaBIFYO^i)%toF47O~O
zWJ%y~w6T0AMkTa1aa4V+Gt$^$2=Q`m&8cRbnIHg#rjHI^e0CV}TDdH-!C>kY2zCe)
z{pIP2Z>AxO1_-yP@q_Y!EoJv-0xVuKS~~U=ru|X3W62Ss;8AU5m!Pg!O1Fu3U$kc0
zWHMf@^3^5##V#xtaLZnuxEjMU+!#n`laPvpp<g}|y`w)8U-=I7$>u;BDejf>B$}^y
zwBdd?=XN2kKv3VA5Tqelh%%h*ZQ^%rZI>chPiel)IoF(t@fl-*XeWRFJVw^FZ_>!`
z8Z{Jfv<U)(#?$AjkfGOHRx4Hk5+&4@*@qt;Jg1O7%fMOfg18{CYXoW8hhc*x2ddcY
z-=EX|K1e?tkc9_}IeDewie#&t%JPTDE%ctJXYSiI3?`*o0YoDtNs8-8{Zy>Z<k!5u
zf|yA7)6UM>vM&brB0oHa5spl6{zyMm<*nvj@V^mh^LrcUNI2z~cmFusMET}gAOu>6
zt%{B*dEilMWc0mvuDbTYvF9r|PLCl)#jba*r3eeHe==nB)-HV~XQo?jv4)74Hp3V3
zA8X#flSl@zJC|Y0*0NI@oGy=+A8Y7;?*y%q1Xg8XT5<y|ph-n$0KBkxT2<>r;G_2Y
z6UERUn;N2q+V%NGHUzm8;%bSj)xy<ZKZ2(liod;E;~WuGtv70%v>eN%34^Y<y<=qm
zq!a$*U(@}+2hTO8Z#~H1)V;Ulg{y8E@mVXx(^$~Qp3zgqHy#Z6pqX0C5`j8Gu(T;D
z=*ERdkWLt$sx;rS+P62pbAY_l#^m5WZl0=a!(Iq%AHv25>K$O2$ooM8`uDLR`D1uF
zXc5T6?zCQ*v!GoRvXQB?wosy5eI9hjwp-P3>&x)R7&yOdL2m`Hu;4&@G)2NAiY&w8
zucATjC|)@KhmJo;k#RQn^ZCnEsh8Hh_Otw+E;nnVy)vmNXWv<m8D}A+?D_*PsGL^!
zvVB;y?T2NRw3!X*HIH(25pyib@Ws@)f(~e+2*J2D>_%b|Y$QHpX#u`nnH#1Kt?m>C
zLg(j<R)U}V;?9Heyz|PF)1zOP>)O^H%4&;hIwVAHvTiH0@o%Wj%rMV&NbPyHd?T<R
zQkS!${XOMfyf>(Gff@RDAh7*8m8e(yk{0)0T^U9YTK7LkKQ$BzGO_D0B%@Gu^3zs>
ze8qw4@Fc9<AtHQ_>r&T3%Dc@H#l71nRGm{RGU(3P2{%b|g^PJ-!soi<NbmBST3o?4
zG=IX{o2c9(^2k<(($AKg1fOYtERHBbGA~z0NDBoR0)o=Ylf&CkiFoLSbC50ZA%9fs
zC_!DmjiNjLN|FJqxip&Z5|V~(3_rG2_N<)9hIdN$eoak11Q~E55aoDql22LZ{J_dG
zwb%=jfKb+RKH<8@QMLy-;FwWM-7mtFcal1Y3L9@i&5<h(yP>5rXfW41G~fI3RN^iE
zqyNAfUYB-N+rYPrXFt_`4il1NT%K1^<0H!XF)27vIlmNNyoZh_)JXvgB>kNEE1I5q
zmr7!(2Hh)+NU5<-otGwBfYsK1w%gk?S#iA?{&m-NSnssS>U9_2BAatQFH}^)NyVFF
zq$~9@>WI`wUcI_sv2S#i5#4{6rAOCawXZXhq#9;89#_SxE`A?q(v*_A;Wj-v5|7m5
zX?uE!>x~vdC3raJ3g!6-zuVAvc@Ecdq_sNPXcT}>&RuH<hcUj~*?5Xn2&w%*%fi}=
zk<l<-^BXd7#mG4+yd^hx^YpRNOZ8%#)=qVk0E;hhOnhTHC54;DVzrsx$2Uv_-L5%x
zbTig!QQ>~FM<!NjZrLu+CQ}OA<%nZJJ^m6`VUx$vt@>4p+&C?BNBZDU)w<&Y<-h;k
zf%e~v^8a1k>JJ(S>UZ#osqiJ<^&(MkcZeG6s+)*bUUoa9;Zq&`HC_@*;;j3eY9C+o
z^K%U47wy)T$YfvKYiW~LeYj-oT1UMnBK$1?RN)?|k0`O?=<jmhrUuy@#)dX@^zE1J
zXCKB;lE%sv2Y#w7R3z`a&w!Z`V&^nqL_~jwk10osIMz(v^7&V!ppFaxjT-w|{DF<~
z)9ql_;Y3pZ%y}@?zV7ed`&Vx+#JwP;IcXI|ok`jNZ4b+^CQgP`)a#cd$aY_5cmoKP
zTC>rf(hsDhBKdX^Q2nH-Uq7t&_DXoX^g)DYm~L>@CSVN>(()3AF6GK4M4Uw?ZBx^e
zh5lE|i23=_SHA@EZ;OadZ`pSD)OzdG12hZL=Od+T=7PVW-iJR*cr=m7TrybEs>A>p
z*&2U;ZBjlw-V7@)0oVtjD7{4=NH5{#FAv4QVq5}o&178`b;3Poe-)GYV_<<5u4xe^
z9E1)YnT@b$rMWixDg|8uLE#B^FY|^wmY!0ZqlOOcKMPZVqd=`mb-B*#<<T}F^>$$A
zp+qml1Cnl*dk*l-Q$o(1uDquD>F-}b10e_LMXVI914ITQfV)VSnb&+K7)WcweL4O}
z2#bss6g&=?+@+o&ot--fA%#WoLZv&~mFH<Wb?xy+PSY=Zc}PWXpWa5NI14nyno&EI
zK~r#shqo&-OL}(SjTzty-?c0l<fc09zH^JnO;73X%>uhtf_RHScDTtQ<J)#KY3B4s
zoe;LCjA=9Hra%3kuhe>6mMq(r_{yY6<xcjt_RG))4{@3=Nfn$wljYZGmka0}{E)wm
z>kE>7v*%wE#5E5$hNJnSKBsGsJ;KnmHkM{2?Yb!)^JC4`MF+u-x>)7jRnR8YHrydK
zN*X?&5<Th-T=`HpTg6-HvjctR=H{ZKF57Pu+ws%y7{5fb?lPtwDSQ@VFOXj2(7>;<
zngKsRkwP?XUdy{Rz(NRNHE#XPy*qCZfBOaaxt1s{tX8kP(CGW{%P=EcabloJ(LO~`
zc+}_!<Z9+9Rcz$VopdBn>*%a=@V8;iBx;w}%b^A1aWZn~_<bjf%bmvVSe`a*B>1QJ
z-6NT3Xe*`=O}f$B9<@GwjIE8kX%)CRYzJrsJ5nX^I2EsLYG*})Pc>NZ+0wjC@Dh~u
zyY$o5NvVX{-R?JEHoK*Ulrd?2nD**s5BXt_s>}YbfiZ3_OCOiy+cbTtQoHuDO|%IR
zV~F6ybJT0)*KmP{A6i~?6`26N7AZ8C6Ho4$+&#j#8d-)gy{gyBfV%{z{<Kqc(CSRu
zpZ`|!|5NN9r$ZX~8&$##pSHaBlcVSCY;|Gc^DzN%^wyW&Vdv>lw*6jBxILfU2P!_p
zyYu|9-Fjg-Mc7lcaC9li@;q8sEg@DKRm^o~UZZBDhZNoaBhbkN)@)jzw%IoNO}|~F
z{Nuck=wMC;^KnvScAgNxx{#)hP>2<XUidttw7fs*02tQdY}&bpVo!0Dow}5Q+nsnf
zH6)Xg8rfrbL5})S<Eaxnoa7H0SiQ^yXxiZ@2jdbTRa8sGKD^B*h`sxvVavHqaigtR
z-i^q&(>OsPv5JiAtaZo53`HhLNGXF$B2NN>-e7;Q`cj5(T;`^S@S<-*5da`xb>2Mx
zHLp~EERWyb3nufqw|EK1SeVUptuOnG1(HfN#GZoaKRR5zTOTdD+>veczZYgpt>oIQ
z(ceO&j}&bzMl4C;izB0>@)VVlSI-`DT0BZ}JT>s^6t&16YdLWVbsQxrB+bVwsJeCA
z!OF0M!cMVZiD0K`)z`ivd{#Eep^6r1aw{-D=IQ~5<`F$Ttd_XMM1WM(rRLsIvs(?g
zYGf0Zv-G`^UADY*fcTrEwD09luhtzD=9vsak3>csgD)!dojY`&F}+&c9*xB{`1_Y8
zt5gcXB5~z>6wZmky85|>2kpET-{Ssi-)Ph_FHbhFX^Se}&^Oo+U)0qkboYGEAO8E@
zN<@i06u9AcAlrOLX9Uw{c3I2mA_VvCfwjPb=z}>{f{$d_hLaT%ND8>s-D@GKwD9~P
zmun#|6}}}X<9=dOo48a2QfD?Zi_@=KGqQeKQAzPW(#sPp2GsT0wq2M&K<Eh;jG0xA
zuP{n?VNvn+)B5Ya)UE0M0whORFH|ZCSm1cjdA$}y6HMSXEbYh4@CfD$JfDz-^ZiW%
z!V!WAa&9N`LPm8XE$xDjl~i)Da|W5H1Ma#PEe>jZO=$6M`3jowH3CkODa^`_At-o@
zXFg6Yp!_&cX7!$D#2Z0mo{DSn+maEUXSwrn?W8|jAbb24(me?+wH7mro8Xy*>##Jv
zjb1OZmKt>T`?v7IbO27+)Sol8rruz6JeWTTyI5c;+%B7;VecU&Wm*>}<Dj3Hk&}i5
z-_dDeILjKC)%{Ij<Z#49$Q4~D9QqAdB8~gfNOZFL={BFx^m@dtyu`2RuRxtrEn$Fl
zbTR$&3YeCMngbYQmR6lIbP=OJi*YR%yMINP>ZH=gHE{FX>)O(QAvFG>v)zuZ;=a3`
zc4Ni|*(j^$U|jz?H_fzNh3UA*e^~fG|5IK6d;FI}-`%jbDeVz+-x}JdAf!*qzBu)L
zQirl4s@#&s_y5V@nU)(S@J05OMM&uPnMh)`<AfP9r1}d^#4ak5#I_*%yFm7^g2$X@
zaS0sGIIwys+m(@*>3=7_wlo88s09`#ucL6&lrj6ryJ@B_w!Rqsj1|cJ^EP%fH3=%0
z&F9j1f}(S2>KhLq({cjr*K94@hHAytQY!^~lC1j1;AkDYf9Y3(U6GtZuVfGDAzq{H
z>x#C%4m%>+^;4XKmlvB;snr4pFYXV5=#dIKEf5o6V&l{uUT!ZH2yvL>V(V))hxTVL
zjQW?eZVmNw2%tQFSIM;>j=pUlXzk^o1s1KguC!$$Svo=rD<Ux%R<F{`iWS}apboFX
zEU-sTHaN|BQkWvw-?QzmsBtp~S8pFgyums@TUeD)uCUVKVrWmPtz4mMy8^!dO;U(Q
zx_n=Ue@Ha&vw%H6@-%D`#E&n=at}j6=5d36|3l}yy}gZcE2j)MF92>+>e_Yem;I&8
z$ON?lAK2ir!kLCIzE^83?-*_Fq>?FFVHMX|<Aq>B*v6ayjg9kicJy<7PC@a}M*B4h
zY6b-~i&C#%6!QkR&RX$gvGvC2rC!3tXDakf?qWi(=;L)yjYOmGtBb_BaeHU32P_ZD
zT>wg)I|0c-{_KK3?1vM`@L|&EcEkNLG9;d=CGMFO)h<$%o2Kj2+UY&&F2iNorYx)e
zj)~n~3~{%G$iF7)_sqb)^F?RdioYUzWeUBgd!(y%j1Mo~Yk7Lb%7)j(Udt21xKJa$
z1C?v33Ct*E4OfG&Fpti6t%`1WsGLtKJv?!>K0`8(CAv`)leM&Ll1IzS=-~gqb9VRX
zKXi+qoBp9w2tJp%Yo);mQ8Hyt{)bK^YosTo8#<|yxX0neI+-Nd$#?$HgVI;0=>#;@
zDD~+X7o|@gOey;Ag(RdgX68~D$Sv<g!4RJ?QZnt8g;Z3_Y%m6WZH}P8s#Pq1b|)5z
z|9Y&@EARO0>8koi5;IIehhhf!f~7Keb-t(KbEh-9IK{f;P4(g0yu|`|MGp#G`p~q;
zKM%|!><khvk<$Ka%sGaE9&Pm{5v<01=cP!)Yd_gBOP6iKGC#%yC2q*^*<v}3zWTBO
z?38~5sw7;Ra62M<)`n$)^j_96{*kfSL-~8mwdq}>=JMu<)2dutUDj((!^XvQO#g}e
zXPQOOUSl*P=&7D=9lYGgmLa_R?5jDicT4Ybl;_A`7$GS>U?o4iLrR-8h>c3OVy@-$
zS3<{f=S-N%`Rhv|S+{n5?A!N|?@7%W>=3r4z`6QfUljYNTKn97sMnI^Gc~ERoYX^6
z)Axh4vQTjCLa=A^Fb3*${a*KY73daaF5qi)<ZQYrI<Q!Ak`ydGe5GrW5NAQrE2!5C
zikN7NBO$f-lyrQpv^sat4ANigp}|Z-(>eCslWsk7%fZKzTcK~3SDSh~OG!v3w?fpV
zK~a#4_C>1DKBqd3EtjspMph2lXJpW_874nnU`MivdwC4IuL;pCHLvi1jACc|1EE&Y
z8I4Pe(#iJxg$>GRI?QzIC%0$#QZ_6Jp|$5<jw>z$$#2HNqFjr&kFso7c^Xd^nP$s=
ztV4?%5M50NO{GhvPkK$xc?^GY{4MXcE6|GK*(+#|GTmT8|3epl{zR-X3;I7PivE35
z{a?}jhHUuK=M0fdnpwvIMDr*4_#57Ci3Dp?hjcDxOC}byW>!k70|HswVHsmawG*$+
zm(~rtg`1>sKHa7$eP%LPJ6mp~&Fj<p$XHKBfx1hNXBMBHf#X1QW$jix^JcZEy6tOn
z(wC*z4h*p178^s}N{Po&>@IuX%gQ}4Dc-75S)A&Zkp&Tla>7Yv({m*-Lwf<=IyOVi
zqUA{7z-5QoIG6P~yx<=?&W6t<*;D6>xcQd;WnSM+iTs@1<FT2Tvl11&q3T_vRpJ^?
zs18PgUN7AsXW0DBy2IccXk7nc<djVCrfe7RP3?F}M?_w<-_Wq{5oova^H6JVOl^Em
zm8H#)QV`_Cw@e2-HON^o<WN}b?Wp@Q7Gad0m9kd3(-#O_@$#US2v;AP&CS2WwV`k?
z&qIDX^h164O^U>&Vxy7*v=6knAblgl{`~Hqw&}U&bs76qzt`_+CU%oj>894GuSf>?
z-GAr`2-nX>lVfTPg=%^`mc7^C?B=&~4vmlW(!1mAAg1aw>uv3((q5@coQzL}46&vz
zeeczuSB$(}J&*Q$zjh$ra~6ev%5yszE^OUZ|7xfL_Hs1<u?@`Q#j#ckiK~<1_0z9~
zWNnL2BGM{TWCPSKzWsi=j4FyMQSHEa#eC!nF-j$9^&ZG?K`GrCty{<kcXr6fASP~y
z*OL(mIFMW&CVjK48{+!C#RF6c@PlZ~H}-wC@Yt4n5DCvP?y9Ii)T%rx-M_`cm(Ap-
zMYEh;eE8*K42`Gu_0yRhEE?bvrxny*)|X00H~fFdxqrQMkWre4dkrx6hDDx~TacBS
zG2GLYiRQ>#Ld2_4&Hj_C{(HIcl<r`cIaNaX!Skfrh=fK$ws2wLnt9G(K)9#-WSqYu
zE^TDZJUeCh>35wL<<kM&5ZmWMD!qcTF&0PBSmj-Y6XCEmYoNzi8{>8*%bfX4X=;Fp
zR57W2FG#a*b9%%e(<VKOY=h5CvxmS;a*r`lIAeXIgp=pmtnuBttAH`1`i%LMX^FL2
zM>013C^nSWipu6-SyuEoZBNG2rf)oMqt(ybyo+f~YfgOBTalIXl{-UMLJw|A>GXEA
z%hSj=P5VnlTBfKgUB3^_dM)Z|iHt@_r>&#aepYV|R=gwrjw>Uuh)K)bsZX(VSZdP2
zC(@keI9<F09di8M4I_r{?;+=PTVk~hNqCSH$xl_^5JD6k0X2B4L?v$b$uSmXJ!ZAg
z6ela_XC^CMAsTkH47P-m_}6$pZ`Ax)ah@*i#=iNGupIq)lR{D#E$6&A+|L(>W1gSS
zS#8M8wjGa5{)KLb{X_ReLf>95GVs2V<gxp{`_OZ$Eaq7UvRI;w4a&BPKa|oZgOn(q
z7%omF11ofH7Vp%{gf3bWT}LtsZ!1hRN!WdfxwFSEQ2)BWw`2*iib$xRW`pG!S6O*K
znN3(8X+B6IKI4km1D?A7mnV(L68R?QK$T%oDn3PVbnSQAgY)jp%HrBW_pX=wlWY28
z`D0?L4oxCdn-Tvl*zTkwWC2l+d}<KCnY|dSS$^bB6)#hI(t1+X2-KRsADR$*mOEte
zx?>uea^dms4#R)V!T%k+Y30_<_E$-m&ov*Xen6JMp$dFAZvkLa;n;IAdFV3q4#^O^
z$dnpwG}qRMp5OB1$f~yBI_*%zeJ)6FhxWtFoyC(k#hm45InA?S=~=DQr=s-nkj_Lq
zvz1wL(fO11L;Om_o3o@wFb0QG@iBiCrq?-V`aYxK9(BxaeWWV>Jh@?XSgK1e%2T!w
zMT$tMCFWddwO@?G3#LxgGJz6<{FgoCHu5__skP-sfsChP%59Q41l};jID2Hus8?P}
z;Y8y{!6yTSMCW4^C+)l)ZyTVI>?ON=EDlX1Yl{R<O6S+6?r=M8yvZ4Xg#>AkL2i|G
zAv$mKMuNDc{LVAS@4#e)z*@7Wo^9{;4`XbOeI~j3cp`lTSIC8cN($@Y3AA!yr5+<P
z#sYKDv)}G<<$_pX=LiB3@LJmsNR1|LW~bK~pvlibL#o8tRDqkbvR(%%9PYBl;g6(E
zfr||_DzQEW4VA14KaQBK^4PSBPbjTlqzx+&Hs^#3i?RuCi9Qe^2j3Sf><wQuA)6+8
zNnWjJwF#6qeT+c{Gxco2`OzUPhis|(Y1ZT9g|MQog*gWjM+dR<u-`fMzHe^sXtGr4
z-_Jim3OBXkLvWBwPLx^Npm2F*GpS2nlOhcAO+8jtQFVQ=#x<e#oF*q@ws9~__evrk
zNz(@4Or)CO6_M5o5$BS8{CPcx8yn3B`S?0bgHj1o^AuD=*Gx-As8MU5UfDnwO~Fy6
zqviYYt6RER{bQt!L5Jl^Aqy#4Rjpk_pF>~tCZ)>5QIRj&xFBV%F}wu^^%iBEo&@yF
zc$So1#qM{6{$TBUCQOVh#Pi61lg{dco%4V}4Ot73AAEvuv{dw}MOi6&CLILJ_Qj3K
zTX@m^^5%bM>i^x3Use=d|MY&I=)R8_^b@#dDL=m^l9{kA`t9!=7Pf?kNi1ys*URPQ
zk!juI-^KAj#qf6y`!j(70Mrse*dj4mU^i+qO<ws$-BTGQUD#>eNa0^YW*A0CjUe^a
zX?S$WDk?v3Hg{sNmq~U-_+VM>?XX!_mmkye(5uDEC}^7iLUfXCCBkzM+&%7Q_>A_6
zM3}LQ8dt*s&kB=Cy7e&ZJo5b#>`AhmK<BeOkCmcS;xd9I5l3^YuOgGUD|JJoa%#I@
z4(wmEK@%Ad+r2@JVNR2r;*R_rccl{x+QdH5lnNpIIYmj`-$%X<u1<^JleXSroz1X~
z2hA|OXd8js1)9g(r25*yOofk2A&Fi-M!LQY+7!7=wkD1-?yI5w&N<aD1-KdSsMI4X
z;)j@kF7Ia#+@M=iKUqtCAxCdF^`H&+=hPQttJeAtd}Xp+iD&=N#YJvj0IMI7?#^jl
zq!-LUnbCgUQj63$cV{hWH=rdKV%)W*G?pi}gz|$Lkb#(}HaSCO#~1#rbuoXOdNR?C
zZG-A{ve{*><=JNGqE;<A>gr}X=M{`292aUpG$wg`0d<~K?7e#E;NU(=EAL0;Gs7WC
z#mJ7#Xxq7b^GPmts54)Bnm?aAWsTT+*eSgu1U$pC1{v~~2Y+<vH`SWbJWN*%RT43D
zm>P3*rHwiK@}c*3cY$&c=cQ-Yd60QP<wm7RQY22f()>5Dd({$?=Cp?&uVrRlUU8$E
z!;WQ4u6}Jpn_(-t<gQX}ED~78BucN#Af~7JYD?#^I=in9Qju3YZAmZ}t&{>O)_rVF
z#^$fc1cf3hC0ly8r5N~#=z+CyQp)VMaWA~0Fn-mi?nd)G>rU~nX)z840;kwyBY0@R
zb#eF1p*PS~Jnq!B{6SCfJ0CwQcgCHV4gkyu(VVpqyL%N7Ly6(2_y0tvApd`t@c;c^
zH+p@l|5Oq9_;Ze(rCrZd{5)=r2N~9jSCqpaYD~vwos5^qM6I>$zq#gYy1=@ds`fMm
zr$pPHY(#sG`Z3vr$2TT_&4*6qoF_&p<QS}Qjb-R*^B0cxKFZ>MO=?F>FWZvafuC)b
zQtylFtDd-^F}SoK%}p8K3ZTfG@$mZvXR+}wDJ8N_tr}vyIoCGgy9Y@nuQ2Y<ddZMj
zpX?OEnx_lBao%)xXg+=%kRazaBj*{m_cS;6$cAL;{`eA&wCAorJG8ClAm1iplbmq&
z&?iT>a2#+5LI4mA21A(~7P+<5p2W&op*WQtv}KuHbgBCOKfOWcsvP4Ua{-N4)p~oT
zkV1oiT`v;&d316eh_Q4qD>T>4x&q_889hQa5%tt4SoRg6l$fpJT~^FAqY{i>Q-&2i
z#_nVQMB!0w^8F9tR2Mk~8trH{E-4ph<md~{0vVsx)LVUcCqH_pPUB%zb!debEVw6N
zn&Txyi$p^6l92pJ*r>O;-tj3|sW?`(WB)U^kjCz)%i8^S2qEM{V(I~CzDbvGW|2|y
z+u7EYg>ohUdgsOF>66jX4;=4H{%ln+v>dj$mo#Mlre<_SJjDXzmv@za^4N3%wysi$
zzi+DL>Y4rihjA22<)T4A_hADem$1`$E9*e%jA~n3tV_QzT6z{HT{fg^($ElV_5N?Y
zZ25fffvbsfI}A@Ry+nhr)5z=b(r?bD*TeEJPZK&z#A*X7om0Oy0-?%mSnp?0xr7sj
zmka_HCMMe2yuCFub$)k1OzwRw(V%Lv>VYDfVy=1D)3vCx$lJzuTiUkB(WN*lkTzC1
zMSp6=7O3|@&;2~z>&SXi`8Un}6mQ`2xvXdDm|=naGbQSyFvZ4jb%*%0DqEc2F8>&(
z!v@n<SK;nx{IXSvzI0i!X)+mhsy&;r+u<X}Hr3;)=MwXK!nMlNqNXHe)P>8r0EM$M
z_k^R|bLrCAkPJN&0T5xEn;t9NvE&0JZHI8zq*%AAzqm$KH@yf@{p-h>>O<oDg(DnL
zdMq;SzqF;i#oPx}VU@hAl^C7c2$DKPRC;vStW$n)&#kvs-(A<==_=a5H-4&~2IQ0W
zwh$d385t?YP$%YYs=22dWCH{nQqiw)fByGk`@dP;r&Z4Y9gotEk<}ba{i2d23!ZBD
zCHdQEM|XE}-kgl$W^8SyK*bf-IQ?vwiHQbGWn6b6u5rh9yUw$y4*SiY?3;wDVb}<n
zi7U`t)Sb2|z4&rn{Hs+*1JBZFnL=$7n}JHW=}dWAg3iHXZv`C(JwwHAhx3R;7bknD
zC{r_R&pq+SSl`~nk(I9O!Nzd*>_CWU1<aBN+3j@b3;Cp%owDXQaJ=NI-1Yo3?Hrgv
zCs<Ohm`&J*2ml=1hMDLUhs?@3PRt&@I)g)M0JM+i0s;V#L*|JH>Y?EsBEA(Lh%1X<
zYdY^z{4<Mjn*AENVZcW)XLbG~pH;Vm0QAY6V)Cb!r2|C+xVhe-akzqmgBGzeZ0V<J
zXd48Yki;E)RlRT?tj!(FG}-tp)WrZ%!n5KN%<m@#Iy&m@KG}elr;WRO^dyim+&=ml
zLZ{vved*&u{Gmep#VMI%=j_za=VLTKKoZnL+mk-q@R|ctnz4-UTbM8L2skV67;<#$
z^8K8@_!MHVNC5cL2WBl4h;~2JhJMnVoTqQKlpMtDeYpm&dJ6zN?e}B2AQ1Ovm`7w!
z?vhVd@{0)y0X%DtRhY98aRG>snj{Ww&UQ{=%h;<$=`Yh`y4LS}!$d384!iU_p<<r?
ze8tGAEVd-<=g{fIl&q%20*yqM_eFPLII<SH>C%3-1o@X*k^`xci0@da-dUTE4@yP)
z`@ReII17-Kt)EA;61euBX`o#+vKJ=Q!6Eu*nT5x?%$#Cdk=z{7ohbz#2T>XS(7h0g
zel?ZoG`5jhw|lOnWhc&}OTQ7^3RoU*+jcuxV%Qkw815JeHT1C|37Je*c$0rDDMUBp
z^%}97Yl|dsl=-H5WB7sb@#+}Iq<N`+{*=9J4#L@0U>oDoe)5cIDoU+&QEK7Ln!EDJ
z7~UdObv(`nlR7U@h5UXZ$1+uj(Sn9O$fM1+4zIo{-4Y*0cm6+&y?0R4>$f+GZruu4
zC<4+{x+D+;q>FBW00|HzkkCQtgeIX^-3kbymw*XPN(dno>4c^tq4!=zdWeYhrnql@
z?>*<dd*<GE?#*N-nMwZpuJx?-to136TDP|ZBNmlelm)nM4u2krFSz`>f*c0<`1Spq
z+9f^ahyuR*k~&gCf+_d2MVI3zyKba$?twpMi7iWQe+$H+o}J8eJ}G>c)8T0?zf%3Z
z6H4G!F;0zWru^=k)QeGAthl}h4kw>p%f4`8HfVg^V|+4M&EDVHV4vPr>SK&gq2qkw
z=b@Z~FqoXxX!UKqXp^EbZ}z?qsun*hXegAadf?`%?@NN}`?8CwXn5>eEZ*n;PxAiz
zKX8H>JbvwrM-gNey8&_f?OcEQ4^xYl^2}~3I(3bq{ufnvHktk1^itc7{)3&cnF0(3
zsvy!#v9Nw&zs^NNv>|=TI#L<k<;AB&-r{t=`x9F_xXx#ib~Fbv|Gt|a4fIHF?{|)x
z+`eOh=tNwd{6$k{W2xpRtD;V(7WC$UfCqj9r(-pW+cYr?M9{3{AW=n6Pl@J#FYUGu
zzrr|OYzgI8es54TL*DKc27>0)P>~7nS6w&%08?Ux7LsP$@W7*-_os2LP(>%zGB}nX
z+Q?f=N}mbUkR5TIn%BV?C!}DP*Mhnyi$1XDglgOf@F-7LnV<T`u)fQr4rMl@KHI>w
zN`^vUGIKj74RI1c(zoGE$)#ua4Kr=q_s5H$P&K7dPe`{?;s+iAt8bduOG!h9G7K?~
zB+m4ELKzxt{T?bZ-n;Zr<#oHjhw`lci+oA8n9Q?!mC*u36TrtSKbA6`BTftvUz^We
z8mo~VOH0Lj4*V9>5wn@v`*A%UUe#u2%h2J>*yoJ-v;$c+ISv=LU9CFJp?IUNZ;#pZ
zo~DPIUdvcM;kFms^EwUW%TkK(p501$)A&12uUbI6`G<8!%G#>bAT1b^r6cdjc7g*g
z6IeX`0FIcAJW^JtdXSP?hI51epSeM?<#fxCX40t`X|Q8Q*O&+}<CFb7GP8qBi?rJ*
zZ_(?f)nQhA*0L?S(IJA>4yVs2y=GjEJyi%zW78VhS)tSH#Gt!n@o9O#%z_JQMziCm
z+#dy5yXKGQVB%#igk3S?<8^g%Gk4oWRm2k_@>8*Ng?vpL8x4CRqL`!um@v%HOpd8|
zLkKddA*_>9dD;uNeqbN!`FoR>1j<*wb9L>x`M2=4$D0j^sggRliH6xVl=d>q2Q|~~
zV2i3Uv71F(oB8$br?>4}2MK_*<3s_1Lm9wK=ad0cJUH1G_x7Ermsh8p#cp!J?r-c|
zlVBcQJcVYf6Kqd)4pzs0D&D@XcU9xYUE@gACs5f45l61!I|KtT5GeM3B_ShqEU2up
zg`}JGhxA9LbAK_NyJ}@cYSni|P6K*+RSiQ>;zp~Y9!VtapKmK?Rek1pM{<L-VRF0w
zFa_g_y#@24<8#+Bqx0y0m_j%fhcP6GLdlVaCHI=^Xk39ZNgHYua(@da!3`>B(1~G_
z<K>3q{4U;nezz=o8*?*<f8z1jUbD&?rmO!4hm?P(?SH<rn2`BGntIcan_5ITdA?1Z
z`}dEtpDE+Gn(4_n%eYV<s|*<=zzAy^obW9z=mp8e7{ZWolon5arDt(~wJ_2E!n&H*
z{ZB;x6fZ#OxUVNzOj_j#8I4thLtLKXw`)Aht8HwGpqLRiQtk}p=8Si0O$y2iM{VCe
zfww?;yw`8J?3>|(^2%u)*i8KnVqLWr3&QGF>^T4Sai$uz$w#yD=H-dzjarsm9lDPg
z?+7W~wasPKzRs-$*63=xhKd+VU%zx6(=+Bw7>EEUf8%BV7RuwHJuJQEyy8vmdv53(
zW3{c#y+A%}=1n)as{)Vn+EY>#*?*>gEnyyt%CFt*+si{fiuzU}!&#^7Cu#m*#<DoE
z74eQ?mnI=2Q8`2A5_4r}^rRH=U;BsYV(xBLs2D29(>$-!8yIY4YxLpwkV!q2>o-!|
z?6RI~H`nihx{<`j+a0z_Fe?lBfUMLH?~m=b_kQ^w+<R~pTxYrk2t<+fbH#06KT@*%
z(eUE8ODJ``^Vu@Yu$93!hQ>{7yG`{QLE%-f-mXx?)G!zj_Gtc7_d&2oMr;SN-DIa{
z*b?k+OUe8tvvM0vQXz_^tLwGb;@Pqxj+iDTO%~Fp?xw+t$NL-FS!k+RP1()5Lxr1!
z;iv>_9gRZC@hIox^w_Yzl+qE1OQVo12^G^~G0{<u!v*YES(K&_z<_{Zu@8NnmTV-T
z?R`p}&%*-=I2<-Go6+{QvKdySFUEqkRT0ZS@X~VrQX%4#`rTrRfx$y34e)<D&bU>P
z$_#EOqwDGFFt9xahL#_Hp5rk>E@8P~sCdP(urEJm>0y5`f8Kbu!MON)M=F!G82~iF
zz2jd;_0lIR2N|qYXP8gV&2=~*9cOs~suGeI9(t?aDBoR1>XwQ}dg7DflLH(M1f2as
zkQUrpW@+B#!*`gpU;ZbS&*`N*262=k(mbit+IID<8Swg>)P`D`j&9-C!bV;IoRN5v
z_jBUnJD_Hz+Shty)E{+Ax8#bDqB@PJfp&9F^%3=lbRQz@i%UN;#}cYEyrAQRb1HSV
zQ3=n9yQat=r;3aMY&|FuD>=}ylZ#s-FiSF|*8}u7q{{jF2WS5J|A18kRXVZ+3OAFu
z<xSdE0$mk6eST-Z__9PtV7>0D%N-p2epw^ycc!|2yYVemhwSA)Kg)j;i;)RozKY1K
zx-sR{|439TJ9$>N(*!e8A9)iPSVQk;xOw)~%HV-rw9mO>f%4J_-&{@K@#+eBX|oyF
zgPiuIgM_jN0}xN2RsJ81s;R>ZUERnWr&YmIKY3>)Qcbx9ymW7<U1K!<d$nZ&qJm$c
z(j-gFE4iZ+V)KGMiu5L2hU+22<rSq&ggB;Go?SbD0=)ep#KzEphw@Q9%wz8|UmfT5
z2j8Ul4KUdA8<TOhapf-YTEpwh@WGIveFftV=ymFnj*_dGe}PbPaz8PSDCWD+73yum
zFts0I2!LNzc*fjGy>a%00K?B@@l@UpELz^l_hIy}6rx(>2xeMr)49ympeU99ZNEzC
zNVsFB(<0=_>sdohX$xt+&th9HSiMu$%#qa-iBAb8fL7O2d8zGP1fRc-w%-lml|B&6
zpuXw0$WruZT#(y%Y{`M9r#N|>vrM;a#59B#Xxg+3mc2;`tqc~qLR3u{J_=1H&C=zA
z)JG-EDUJzew!)Om?Y6C7r&T5FL>_WlE<O0+;PW6@Gr%MYm08?UKo9=)BDU;BbyRaz
znBwzWeIu!n`o3!2y$HP&n=r$$zdsr08ED*#6V6G(RB4BDb1S>p1}6pyK6qdmEHb-2
znE0T#zii&tBaH;oo-xT4G7G-C<tucN%OS8i(@ljf3b7{37NczOUHC7ic*bd+bSLF5
zlY2qZ9}bF|j+U}+Xz?S!C-uve^oGl<scw;oj-RY4E1m9|)fSOhT*sGJfYK)E6MixN
zVBT+<J0hT}g8`BO<bKcBo!SOJ%TSZd9nB*fCw$TfZ4fS-<+qTO5mi`?rEO2)%}M}e
zk~T6r;}7Fpmp3NMUXi~H`KNr5aRtTg9}D<Ng$p8x1v5q=)NIFZ{mr2kfBm0#Jr|Z_
z**>@JP8cpGKB)>Avnewhj&l6~?r)7^Mqq<6@DZTP{y$7caFXhQyupds@YVQ~vE_gT
zBidl%^43{7b~?lyWdzwpURShQFa2g^+uU0<ghRl(ec0g;;TxkV0Yl$@SN6QXx<s`b
zTK}PdjaJAOuj=(;4bvKj7(9#~b<-+?dZ&!Ljcoukvz6CU>*d8910{V`<%<@LY)uYj
zP0StdW-hBcX5FaQkkHYiejA#;Yl+z9*mqc*;58mB8PV`Kb|@Vl#)?V!6-Yh+;^%Es
zRpx4e0#8R5G#nue1)U&`=f@e1!l%5)wUaV}pX{Sspwb%T6TPvo69ty6#!VHME_LsQ
z#~nhE!i+`(1IsqkejZvF=SH2>4=T5jHlWVS8>rH4igHAzXNFqzFY1Ufd_9yZs(%yD
zmsXlt;DE;2D*I{f&nFae>&a>Zt=U9VY@5QIA~xZHci9L2BTc06b*pa-L*_Vt`$WB^
z$$sW^A;=H=%%f<ZtZ;|3wcPc@z81sSyagQ+DBqQypuaOVk(}Z+roUr;gs<1?$#O4?
zHqNfd=laq~!Wdf?#f^IpM<wk%dgs&$3w-<72FCCMU#c7^>AmQ3K-a!~F0S+8PANn3
z_rbnR7j5+8;<k7H*~;Wn#%7{U;-@lYuih+*$@U1oAHI_abGJstC|m}L<?GHGx3rsd
zLqYIh!5qPlLT@l6^8oCZd6A8^FvHGYo`#0vztYd%KhNQUmzg=m(_7pRU(pBOZEs$=
zmu7OOLZXz=AG0_oFKqraHDqf4tv)N#!#XE>?s#3mV<RwBbZvae|K1cbrSbNg&!vq8
z4o?}h;nls_jppT&QR1_@3y{_N3a!5A_Z$~&gg@&35iQCjz;sdUof-e#DMh1d?nYgH
zz=~$FDJj-6*?r>5<lQN&LDMJ+Qb=^4+$vVeJZY2X&d6UNqq?6w6y%n60himTzn)HC
zH~cz7i<=H(@pgTS0<G4{c*%oC4lv&EgvKBoBaNo6=!Ah!VAowmz>Wca`84M&&vF#f
z{RgqU&2Gc~`A!+s)X;B0rr=g!^DV`StL;bcn}|R_68!^d^R6i|CXZ!|fM-xsRC^~g
z%#Rt{)c;rB4v$66U515g!Z4;u84DcbG#}52r{z<Gvn;uHZZ0%Y|6#h8IyqqV4->Hu
z!`CF=zp~)fq27A^cIPAD;iQ4=P7KsrAlaLDp1TqP9iUF(TBhlJK?=cO*ZLR9H*#OX
zgo`Z28X6G<9;bchN79GimJ+hWH=`tc1W>iD#lyVTyaSmNrrr~)VhsbjO&D)TL7m%R
zaVMO2v1nudCc|CTe8P8kephb1Fw?c{R%d}i2c>1KzJ)se?hDE7G*du8Ft=J1uHvdT
zGn1-ppt0fFM>Bax5E#}|q62O-NBWGe00=kLk%?Wime+DId=I0{JG_tcCo3yrCR~l&
zoN#(De(F?6GH*HR*+VeN3OAe}d@b7oP<UHXn>GwHH;_f?X)1!#o3})&LRHK6ONPC6
zAr%vAEZMIJMz+@zvu;Dv##%`Q^NZgcw+$D+4UKKUgID5Drxr`sPyGi|eGX6Jnl2^A
z*;qN<GE70~9dd%&cN|Jfo{9b{(L0JcP>L)tc3L{M(%P0!c%Ks9$h_2Vxjq+KMYKDv
zRaQ}Y<H~S8`j6F5h-^FIgU{_9!&C9FN1U(Qkzq4NamX$BoK>Kl?HA-BM%A#BYWEwq
zz<^&>$o%krpP2S^VJji(di9jl1^E@fk}{t`M$MSldGpNm_a&uYeF5_uZE?HCaW<w^
z^&+j0ZgVaO)UJJLvDi*&TlyAyL&CGn{1NVclM05~D-F5ZiBBj!eCx??$vvtk{iyFB
zCi{wOf&%Iae9s%#PO^(CbL)X_ozK+N-n3bM3K-v2Z3ySlldJJt?b~NxY*}upQN0;{
z8^#dFxBNws5Z0erd#3CI33T@>UNqq@dP@bn#5~~NbMrjefgF}#z%Q?XQl2w3O_;!w
zPed>Gz4{8_5vnSiYUZIp>KXfl)VVis<hYPsyAxeIuG~qJA+sXf&l=2$TR`*6THgtd
zZNd5OONww6r}S8`z%4oPec6`R`gltvd#FBYczP%dO}TjEwL-l;kyG+6QKAw<{*j43
z+~to>%>q$SP9NTWLqEqorcOuWjTmE|z<npwkZbVys<FDcsO>Kj4|$?%Dx@APB(P@S
z_W;X&_UdL%v4%cy%CyvKNROY8MH<RDB~7$~o08v|^i{xe%Ws0Cxr{Lxmj2EBLg)8M
zPV+Yz8xQA<m;X=Q5~O&AcO=<ja_j4=XPqgZPvHKTvbw{3)|_4Qfo+vTeJU9@E7HH{
z48U5g&7#Na`&(dT7nf9Sx`Bg={9O9Q@y-bk(|-^(GV9{}+k}ccz8DX`N%Ui^&FC#s
zHpX!Q0d@j={U^6@`+LYM`nBQt1qw0}L$w}$d+dFSl<y0jVM_4gWlxt`=6w}kXW!Ae
zY3<<E@J@*r^$-j5;H&dENfW)Wc%uMQ9jlGbAiZdOQeDx@$_3S+Ei-2Wn4%NpafiA2
z<n!2hA;i6*VoFh+Q+Z>S&!%P`U(9ZDexOD2w3Cg-GOvcs-I^SHeh>Cl8Sm)4>o{xc
z8zgi|kR{;QgXZ6x?c=B||Alp;ZGs~ueQ?c}5cR9-1RKSH#?Fk6E!a!#Z*R9?@1K>s
zMJhpx7QO5Z9;jhz>`;WjW2c%u6|V%GkZ}Q0C0qG}oxL_@dz!Fvs8DjRHR+)8MPr-Z
zj?UcPB<%g*r2+Yq{OoZ=L4wzP--0)KI^x6OtJ3iXy8Y=5Ugx57$^lCBZYw#$0f_<N
zrx%rx0L<?3FBIZ_NuwpVbI_?r_dmZevTXa^n7R3CgSXYgc4m+r5CN|OkKZi^?|}+c
zV+6J`bClCkra2@htddR5_htPA#U+oloY=p#MyOVF<tiK-XO(LEsF6WhPN{3oD`THw
zXn}v2-VPXa8vZ?<VfhLl1{U72;LFzQLb>j-68Z=|b$-bM<8#A0!ez-maM`h{vXn28
zAWLqOm*;vq^~ZdG!gF289Zf5>6b`9+M+dw5hdm)l^U+z!+FL%g6X0>}Bk7Rn233p*
zdFMA?-W&x$SY{-Z|CFE9NN|&{BhdSNzLOvj^F298;ha~cpEz|a5p!k$?SCyt=jgpZ
zdiU>YeWbZmm1}Hq1^=ElW~UL(hBO0q&<_`UMi1R$A6WCeZigLX^t6w%UX=WPlS97R
zmrOQhj%Ji0soFbRxY94O&4&-u|FpTCKxlt%vU9%%K4R1|XM4Y2$Mo%g?qC0U2|OHE
zd)^~M@cV};E@5%~rzz}MUtNz@qC7kPB9AepE%WO9z0>iz>1Q^JVOs){e^GY<3I%oI
zb?Onr#1c(Equ{rBa6P@ItNjD(p%0phS|aMx(fcp*9FcPV!Lo?#!hxMnImE}nw>__L
z@!Hj<3HSm84~~ix{!-kc_;o8+KB{0eb7R6nXso1mQEn7Z;u4irQ;UJllz<$oB`R^y
z)h%DV4@GsgPJ>JPZCAHkzdQpE8PniZIbjN9%~tO96%O?4&Xmrxs#j95&yIt}u0MTM
ztDP(F`546Gw01g34b(9j21}CjDlM{VEtCDwo=ndw-&y+sC4IT)W4!oq8|B_sJxAoE
zH^3@^xX^6z>pt$}q^uPcvZwRPhd%^1L5Q-}e1cI6W{Nsm*nWmvc+?}f*(glneD*zv
zlR?vr?ULe?o?7x}ZGE>gDJL+|73o=2WZoFlFVUB_V7hl9hG90R?jdW?WF0rng~VLg
z8mI=D>T$j$J0hlARc2bYE(iy`yjS}f=MZConQ50BVPHR`O|9B(`brD0rll&=TX>`U
zwvc~)Db!uHc90||4f{t2^Dd*)skPoI6u1(Li+(wgD6jS14U=6KQg;48HW@me<9Ks-
zuG}-ygRF3K<ZQWi2CUZc>y?)t*U&81;)q=Vdvc|51s>d9nv9s1@DjOdZE1yT)w^#Y
zJD`$*gHBFwi5~~Bo0LGOg1>7A%*Zj!)1806X?bXg<jo)So-PNT6?{ghru@Sco%b~t
z&-iuWzF+_IUFXB^Oy`Jq{uN$Km#)`B{$X-7PWh#f|2u9=U|<OTBM>BHv89-@TWwq0
z9iE|-{vhF&o5P{gaX~V8IvXnAf8onI^DT0Pf$#jjJ-#wW?F!s~(!Ne)urbC{GayEK
zPclq>pi0FL^6lA+2nUR%hFPU`E&uHZv#wBP0YAYV!#vZbjMTY_5{bU`&Db`=zB4fJ
zyM(pWh7WjL>(J>gjArMUR$0dBqgp&PHL$ko^L`M%ld7@D9fv(q0%pgvp}@P*Fz(vn
zYv0VeXU7)06JxcF<f=SZ5s=?@DNO-$p^2|{NaVVRFH3g6G-d1`iMO(nder24n$}C$
zR-d;<G@8GjH*59hk;JV(jO5HP#*WssyYyX+Zf=ZnRiDnO{VdSPReL0)XfUNlO%W5O
z;K4pBJ_;g=Z&xzpD6`XMWikJ87-g+*V&%~ESCFHQ6ed5Xj5rQ#h%lgQ0l>?%rWChq
zC$m~5@k20t4N|0<W>z8v6+3@Ti|i*%wH}p_7kAU5*01@D`}OG)&~XA8CPo85Tqj~d
zR;u8c<UaR-im6$Q;XCVA2TQnqqt<=yp-hhG7U}%5t1hveu@fkATZ>l1{C(Hb8jTtO
zo9cI|ko5EvJDV!^%1k50BO$p#r@M1LWcB^47S&pvPXTPx_@Y#&H%**2J^iQW@P&vU
z-Kn3IBN}wLqeN^rj!}dGnX`o{>mVm{WCtJtrds!XY^;>-|FE7{`#C%=tw79ow9zHC
z_fQRUw#+JZ(fkDmrbTV<jiJ{<*TE%c{J;~YbN>pdI1eSuKcWeOj;e6Xk><zi_>tg(
zFlLK2)wJv@1{N}b2A_Va@wv2^;#GWRKZGfLii7RA<>g#|oSe=eN_1XDqz<Pfn^+6p
zG%D+<%!Vp3sDI|tAPZISCE?-3h}Gf^e9WWEIOs^jiB21!MJZXKB~fvCcBv{8T9&ic
zU??}VVpKd^FHd}PtiN{9vL4UQ2fAyg6LiY}Q2-*08a{Kt$KB)>(j&>(MK{rTaaYJ=
z{V0it^_A-D$$!bs%&#Yd49X+f?JieJo|D`au*v^qH^F*MqMMo1&K*MHZG>B2u5_<>
z=NNWXw|_`f>hzD;aNV(99w^1quFl==l~%Ts)pr>Qq{TfwOU|ZBKTfoFEW)AqKzu^9
zIEtye?(g&GpZEwD&B(gAG?`Z+-=Q}0q@I`5!PW)U9JMz=u$2~Qy*<`HN&`ZMY+eQF
zYXbU^t1h+CeHr(iW9c>>fs+P4R<(eYg=B8li?pWDwoi7tE#f6NRD-)?QGJ5q`Be>>
zd?*il_0oe&PbMQzS#EpWd~JlUd0g9%O{YpB5gF}$Q`x3@C3-k~)pk`}O8jt+_c%Th
zk$5le_<^+zL!>6A@R!MIh@aIY<-kf&I7jBH9y{bqwk}EQMBU{ZJ-C(Xt&Vy=Q}s>N
z^t57O&9@)TI93k-V)E$vR}3)S;*5iv1Wo{$e>`C9x^uVS8J|7h=+)jwd$VwjKum}k
zFpozEwjvqeGku@gu>J8%WwBIRq*yWSv-P!;1d~-Bacdnzxu><@nQG}`gIbr8+sfAS
ztj}GO^-z5^*4Z&A`W&@qBUQepK54Cj!}-csMjm^BW_|^$ukwlP_XX<8ayB1#rpv+`
zt5|?;4LnwVG0SZKN4Jy;4@GO#f?KU?4-o?l;mGcnAB$YLbLSOqCOGPautNn&!)&a`
z^P<00c3<sSp;;PEB{)IQ<Zle{oia$j8CHT5N`7Y(k`Z^HcphTpl^mF!#{tuZ*~-J^
zQSU5e-a0CYaObahT8j1FT~$(-f0CcFcc&7dH0O7t`dOMMTtLSdQ^+m-^gWGGdU1wg
z`i}k)?l}TN7JBjTi=ntzrjg~P-G8CWQ>tO0>js!D*AxSD+)C-DPvr=L7imVy<j4LY
zyk(-uC@<Es`DL#H&U**P^?^RUdmK!ji>i?pBWaIZf~HsTDDU0WVz}H~OATR0^|_jt
zfiB)|gVP!^3M!5KYvd<PU(*#g4XhnWMmT~XwR;UY&7Ipmtx@oR0as{;Q^!8pxh@q$
z$0fTVd~|6~pKm(mLM*3;oScTd5d|@YKUm%y+bk!FO~FJKo}V@_e-LDLiuw>`JG`(K
zJX#a9xyr=E_CK+3uKhds+Fm4p1RO3VypSMnCCWl*A<Z7wTb{ZNjqJU~e6VyqcyR5O
zDN^D)X@9<vl8<ka|7?aY24;tJtq*#zS!AGSvF25CaR=pqiRjYw$ki&K^cxtDD8M2y
zq!JG9KkSb#I(WZ-Fw~P{@p@6Dd}qOZ-O6SD4@q8YGfKyDLMlYxF2l$T-TBbFb^qgC
zg54@O{T=eqvHZpj?`q1^HSk~3!_sE25E~ow9B@!y14oPyhgrX_S#7EinPC>qoQiIY
z#0AE(K@HN4v<tzkcMqg1|HMJKFJywSFC#f1jOQyqih0==EhjX#h!p-T5X@B>94#sK
z0{)%NjLSb8r-H4O7RB#zk}NQg)esj%cV%4zMPsHc!CwIoM>YjV%i5zEd!j!a`D0y+
z>^fF8@1#G@Q5Z5;+j@LqspmaAem0e&JZX|eVU?DKPRSrbl4T-Kxm}`ao;nLtXQ~0`
zZ4%nnY8z%^Eo0M*FD^VbKK7IYOPtNMuwdiJNWT2W*RLvzbW<AdO~w=H@tfVz39T!L
z<Lhj{dzNc}6i0$&fS;;kSlIpW&WY=oCGP&)@Xb!PP`#JW=-pok3iE~&kH*b^X3JaE
zKl1#@#P_eA_NBj<?uV~;$le$)CE~<}=^0~3ohjcD0&nU6E5|)l8a^Cok$GL*xch6k
zqpkpdvk&FD6UO%`Z}wQReU$TagUI$OW-pD>5wkaa1yfB^<f#_th#sZ4G#!l_p_=)n
z36tRs>++k@H^)o3W5Lr|TbW7iu{ZkKwti;Kn7;y|J-O`cD=p`+6t1UCEOj(8(y^dY
z+KQ>l|Dqss)%oG6q}MVINEBzKleP)eDqh=&;t=zPE-#Pxq!^fsy|uj%I+Q$oA=R!I
zrbUb7wtYI6s#wC5Bt*3U4E1tVI_j~ySk+AVCe@XCBB4AAqFdNb1$3F&P~SQzm^~!X
z+tAl&BorrQ4n6OH56-{Fc$&P(@>n*;6Eqg$)x)N)z!b)HMVYBs2wP4>)s?Bacdy(v
zhm(V&Y5)_FJ*`gxP@1J?WVd<pGX?Hw<J(4oTD^An2i3(v)!UY2esx6qnCY9m;(jr1
z{fIx`f>8Z9a>vFgUx}L8AmWQ~sgE15egEub=TTrY>^yp;<j0-dHOsR{ngfW0GOopj
z&d-6Z{M;2NKTa&A(^UrBn>Mx?mUP(wB93>Z<3(v-|0hG4u1TQo9%X?P;1gJ_Sz1mm
zS;xJbdXKS2T@1tnKya)Q7UY3yC7oN^_6eJ-=%T@ci_qJi`?;B_CIpYutZ#MUc;jkm
zZ^vOfQJLo<Z1J*4$-b7JmaWU&ub=MgTX6*FJJ`GB`vtb7ir5*iK+GTCeHC<3mo4V~
zImsl0SLHboM3Qd0aCyCG39q9Vn)&redzxwN?#(AcF?0F)RYRqvx<EO1*CcK+vA#MJ
zoBYBpi;p&0V4S3!v1s;rttn;-Pjs~eT$jSc#B*Nv+4J*-_buAx^`}g*(L+sOF@AZY
z9Lc*2cJZ@g9+3kNh6zT;^<!2fpTsVdP)`S{x<%=Zd-j2&dz`nPCzZ9|s=$CVb_h{h
zDP~hxNdo`<%As0O0Z<$jbEz^%2~Y@eF%t-tiXG8K(OQzsFn#Ua<~1((nztpfdix?q
z*!>$5@z>pufc%;a9Cx*-K`g`^8<H)81yu-f+Hkv&OHGT@%OgduA_#qmWztZVuS=)p
zqTxH!Q8lr|pNt;<-biXQt$gjp>g<MnLnuR9|A$~IXWU1~FK@)N3Wb6*)2`EVBg*DI
zOiac9`}u9lzI#8FWx!RdI)d5PpS&8i<DxBK&z{~ZA6NRJE%GtV=YwZ8jaKhi+<u^u
zzpts1Cc7!{xBH*C3uV4{unoG=rPc4dKCoNTEjldZ=Gs=IA(ik~x<YDdTpZ?HYv$)f
zIsW2^<+4lx$L4Q`MwZ1`$ldpLIJp6%B{9ajZsO9iF?blOLZ!pjUl*1pFKn_{8%Y+K
zESWT>3ki3%C`)m(Ms~tPS>`~n3eM+EKs4i%yU$<?v>3ukyy6Z*KvyzI)W7M-MH~;Q
zeJZM4Ggk}IeIR2Tol+MG3C32oR#PQ-n!(Bt^nJGRmwnXk-TOUONkp!p3rT9C!E75K
zgZ$?bfRHx<w`CJDt%l)dB}Z=LYg==@*fpmPf^pLeTxfLH$ao&%R*{q^0<IeqDphG7
zD%A^S(>06Na44T54kzNPIpq}?spiUDR^@~*IgQ3Q>kePFW(i4rkHH(v+8f1kdD5vK
zb{dxQ?y}=HN^8$5ZeK|rDyegV4!1h4Xy<2L;y=rt5x6B*^RDD>e@mL<qSv<<_M30o
z$UvLUnLwEQk6$9pu`LYgNJj~`z%s_vba%C3is{dPUH5~o$^OH%?007W4-<xm>#KAJ
z1BTMNbE}fE!Qd(yMXLOscOKcELWQs-%6+rTi%B<x$J+Ix^FM{0yTUBP<11C;=%gJF
z##m+6u%j!UQ#kI&N<6=tjSH(?VZZa~KE%kf#!?<|IaV?`1HP2((yHZFM0Ao>%hRGx
zC*5ld;33KSKV{rym;q7{Ry$}++<dH)K4Q}>+bzlp1lpAMlYoI%Ol5fh)2hw3_pB_R
zp&1GNk?{GRa-|B+GP2V&*5)hnD=s+8>J{kE#{QT)Dg4%YK*jSF@T%hU4eSs5HMi0o
zkRVHqVbE<kLEU{vx;LD^QtkVJ5OK)YgpVS64Ws-JjBb6ci>5&d>g+~w<QUADQPM;t
z9^hEj#b|9VnCsy=74q`+9&-uiJJs{9lnd)=yVyC^%WYhi*Q5Hot~g7TP7yYdFj|7U
zSY^ZdGe4dPswL8cv@I_%zVu0;r>A!~7rJ>3_+fJ<f2RKp8Q|Yq7cO@CA$bo!+%joA
zewJldwOl!+biC0~vfIOu72UNJF?aSEr9J(3cYAIn@Rxw{XU~Z&5izffP3ONq)YQy$
z4v~)?4FQK9ziI2Az3g+pPlO5b^1zmoy71ucraMfITd^}c8mast!hk~VmMJz1xskpP
zLOf%Qj#psqEq3s&b``m*N*CzBpp%hWN>3D2aWYBVKxN+1p<$Y4QvA%W_qjLCgdIx7
zfazAfMrd~pF?J-l)X1gxZ<mK)D$&V`Rl-Rx_y$F3=&tyR6<PSLrrjrbX{j%H==v*@
z!ewZFz&Rv^=g#G3i$!$CdzJl5S17zGYm(hnmyF*yU)eO`C@xs*9eY1<njC`rIsNe2
z7sC>TiNGPmC-oZkFM}0BYSRa&JfzP878l8tV0gj$zSP#lX-4Tzz+I{*Vw@Ive{`&d
zN705z^$Q@+rIbV1@ykT244m&gzl15KrR!1y+fo$`*<SDe7eW-1kxso_>|~L!Td%2~
zE9#t56E{JSj3IC1&G6)peWqr;_DacRII$+-WNGnFE$3hG3%Prms)GTccL&9aPb*Bs
z^)%h@A(39)nQFioGtl_g!ry$UzPTr<df)675dOdV;N%Ai!HA7IA`Ip2x;fgA>lW5I
z&qM&cuh8ZqHMM!eW9d1?l;My6bBLZ>|A{a-x{2y_>8Jjz*jM%?<f}h&Apx@Z$hGrI
zyfWDzv<HD;n%!BW^F}34!jfx?l%m?p_FhknaQ77RinY5@x+OcjUaYEK>>X<g!O4Ur
zZM;Ot7l2cmSi{k#Gr%@0oy2=G*s>>6y>iuag$(aVYc;jkv7)Cuy4fFFV632*Bl@hm
z+2-e=v)olQggT?D#ahTDD_UXF^<~&>K(v>zKFoV|G)Pqn@%NRNtn>@)g;mUdw&fqr
zrTiVji|C>FO5$3&y!rrre|r)&60N(4PI`Ee=0qdKJAd{N_AR*X8uVnDu~0<Ir$|dG
zk3*^suA_}iJ=+|u>s>1Rg}Uqgw=7tnbmQpKg<U^N!ksQU-<4jy@oO4hUNV+iot_hI
zS8|xdfIMcj*NTlr5Ezv@p2an#Fm9u^(((S$P`1r|BD$UnR~9RIAgEkD_vXFQ(5nL}
zO$#p2;a%jDL&rbW-x4di7^QK{r7@GER5F%Sdb0ySY@0OZ8j-6X>Qxu*mo|?sX@(rg
z%{k^C#jz{!M3*S=5=@SJAT*omnhZQArCxPVA#b1^*uK&28OJrg^zrnAgZGQj&ARgi
zu01z?5?8USriZ%Ub0jurxpE_ypC<+@q)iqwDB`<=?!F01oBx~X!`uP)+eXkjm$FsB
zwq%{x?+zbE1PXw~H2H1PywbVExWZ#-PPM584Ya1}2afNi)RK#X#XJ#e>6WQvYI^&Z
zo_3qA2rdT;T8XHb!T6^w#2;Z-wNdS{O>`C{mckcjY;<*cp3AeJI~enx*0Z5N@dFhF
zHp!CaZ<c*t1cCc{U?3Vg-2qm?LvfpDm9X1i`ep|u{poP=V>wy|?JEoWYQ%A)y_<*8
z`+upBW4(w8Ag5g0*=K3GQxvcQ-nzIa%0tlrfvrk$R((-my<k?)m3lNU7Zc=aB$K$`
z_rh>HYe;X<Jq4&y!mh5?4!c1y{j^dp-9-GW3mP5Z`Bh9Y5>WwMjjcy=<icwtx3*4&
zuCv1prdM}0Sap1i@YPwXJCF}Z@DS8U&$=CEa4IN@9``_SVtUTn)ZU7~O;&x+;?qza
zMKceh%FXd^kxn(~^V;+3MoBeJU-xJ8I+{8NKpu8p(x#l;O4o2q`dxFm4pdujOC;Wj
z8Y!D`<LJse{p=OFf~tcX+yE+K<&7-ognqv#T%3aY=H7^3YnJLZHet*@obYSX&5a4D
zje`4MoM~oo`Zp)ZtHr<0_iIb~%zZ|<^p7*PEo7`n(_v7INr<N9wRvptwcgTH!+pyB
z-m+j;``KX4FV))3Y)6Co5gVS<TxX?RqWa*|f8qLen$ekr4zilLfwtSK*SP%jE$5p3
zH19yv+$uBp=ly?}{GpVeXyJ~>(`kCP!ry$I>aR!i+H9IU6pFI6c86kdmNX^>4iKoX
zWecf!Cxy46<8K{`TYk}TTlc(KjSbCWuJ%C8?3wQ-V0Cne;ha@ZajA5rnafM(@-Bq+
zT4@Alz&_psX{7({YXTL0^;gz}gaS3?@zdI2xXH^m@2u+LicRLDoD78%(ab*2GP}tB
zch`q7_IS(WY*{5bZ|RM>uDC8e@^C1%$75?>xCUB!r#8GJXxwL=_?RQWfgN@SK}D1<
zRS}D?WL4{Rkuo2AkQW+DvFQHQRx=RvEIc%hk}{7;TU8?a1JMMvW~*d;Imo>1l0&@<
z!eY8vb~ckP$(P_qLgd0jHbAf5F+>)G^?$@nUPYAH$vy5S<nu?C5~RAPvr7FuxD@Ce
zUrRQ4R_*IMM{{j33i2*TAcu(RPYQjbP`AbOGehxp;OKITIhYt0&yF3cWApb{nRFTE
zMccDQbZA(;)#FLsPWy99!>O@9mNlemRcwdP8Pm-LI?&i+Q|Iby!UNQdo$RH-s8Ei5
z*;-%s+)px^BL3QzaU=diedC3ly-Ri_(w<y7<r_CFGf0hgt9iv#P-zXSBM9}T-$s}v
z`Bfo-Q4{>r913%_!zNj6luN|~v>x)kkDDwoeaIDUp*MEAV7Fr%vRTATu`yZNcqCO;
z*ost0R}$Q2Qe6A*da>l6!~FH`z)VMpDGmRE=0D(k`&GupihK`8x8C*-cD96EFKM2<
zXV0f7Z(t!d@?(x$;%af)7IGjeRie1v$id)XD59L1TOP^uN0Al1v?LTK2kfJ@9fDF&
ztHN8ck2mbOiW{Nr1UvS-jEyd>YK{c-QD~s}QZr(QFb<E&Z1o_MCyi5Nq_kl26EkL^
zDJGV+$8TSKTrl!9Btahjr817$;{i-gv;GOzOLbu5X?TK!opMUpW$59!&aa(tXKPXD
zKsh>?=>inWj`q?3)Jh}=?aC<y_#=yi7`*jePC!-oU#f5;i%L0?|C2X);H-8;$x3NX
z1T3h=lIwDW`HiU<gwd$KrwVOVfk7PdaR<Abc>Gci?F%gFFRh>JSewXDzonGxW(TM@
z>M=wg3mE&Es93Eo0|(@xr)D{~ZQxWY@D@eDX8jK}BF`qubA&S3_UP)QrdztpLazL$
z^#hv^tR?{06`NnfDOsDF3I+v(lLhgv>72|?@k8xxqnzhSDLsSS`lUx&X<2m&yzjY!
z@Abh;_ecFr7X8F<)9#USRP&3@+j>J(rLJkkG{MuGIi>M!C~0F(W3$uiCEvNm^h}X=
z`qd*1TvYYihKSXSViVKrq>_eTGf8j~3967^IKwSv9eb)V_%f?V1kVZf17lJpVv(x;
zXu8a*IfPed?^*RP0@u%sN3I`;3@upN(tpQCH&uvtyA+<%xK(&I(x`xGAN6~WB}rQ?
z-u*Rni-Tj>s`h~MQlQM^=vBcV)5D;8c4qS_R0`#fKZQ)iV7*U?`MuuIfE8;4TX+ZR
z*QeA*$|Wm`E5zMsD|T?vk-w2L96@wq96UCE`HTjs-)nhG5XZS?eJfRm$PKgQL@pXz
z@|t<erWnFA9QnuM?-$7(%1QLOTMuhi%RGUPK6XqtH~4t@GT)t)Dp#3%!Z7Oj6)R?;
z*Zw@>Q`|nf1(_i(;Ar8zx+A+)U~sBR@kXC<ig47{$AaAC9D=#Q%;`l%zhyxYvfNk}
zap#d8v=<Gi6Ydhb``KUEFRRAl4zEfFKmGJ_HUzS7&4Triwv-&3PX=JrD&b{4k7NxN
z&^xLQ-=MHwEn_)IeHBphF0kIgfowgfyTQ@nl9g4sa)P6)-|U8HE2UPc9OJhF^mKD_
zxq|9C<EY^Ao?2H=*RKj9#$3jV8&X70PT+uH-{eQPSzfV0&FMFMr;2}?#y9e1RW<F(
zew~ShuM9W3T57JJe5qhDrsQ)p${Ay8?3Xr!ZcX6P)wg+kL>>Er{T&^)DPYm@wo|OK
zBena>X6-LAR^Ink`tvJtu<pu>j>78-x8VcUSAM`>d2}oGEuY9<x0B?uUZ+Xbv`WxH
z=(^|&<Kf~-ReKg`j383)%4qA(-jnqi4rUCB2S{ZL#${8`mIaS{!wj#ic-<FM3!CV*
z(ixGLOAps)Yy@qB!FG2FPsJG*jwiO>M^BklRsK7Un3x{Eh_m%yGAp?T0w{=KUr2AY
zrgIbDZX6P?&h0=0BbpWR%0I-oo;s>9XPtbXZF!RyGtUeks&N{fwByL-MLS0F7;4-{
z`QOYQiaX^f9HrPR<jZ;QOElZqRa?98RM#69S=D%qrRwUj)&k#o(r9fy<{UT}*ysMf
z%EqV!H;k4aU@Fbiwf2o$%+mw}Rx#9*gPyxF6$k6n$gY?95_B$)L!65rDUHKkZH-Wr
zhAhCTT3=TAo5T(E*x0y&g{hW+yYpR+c$&$pizcKD@CTZK1<u#<cT|`qom+@*Vi%Ds
zjOBY(`vVl=g0K1ooP&hiAQ>53+iIMf0eqk4MIk+AR6%(vJ)S>Sq_?h-E1pzJ7n7?W
z&{bS&z>DK0h`QwQXpipsrj#C-_p2S*&m<mX&9nRo>kG*CUSRK{t+8;xT(dI~=IOa>
z=WKCr7}b?kMXi=4af}V1Q=0;0mrxF`Lr?fndVoEZDU$WnzFlW7%)`}FJ`!nCnc+G4
zK2Cd0zaP3WU6$zds9tIEy?p<hSXx4)Dy{&#Rrlb?+1oaFu?C>Dl;(bh%&nZ>0nf{?
z1+{o~R#4S&7MF~%XIh^q9fzR&QObI7<4}$L*B|VX;;H<G2ABCSIX}ZQw?sLOeEphQ
z_YsHOiiUL*C<2klAx&&I2{`6xAg_6BmREIbmR}X+oO)|@Xb^p25F)QOKIa#(RBr@k
z&7l>@80)dRSK`aS`A)8C)do6W!=3C4eOeqV3a1Cl0*fZ%QMgt&b!f^;TwvrcMQTpm
zf>-k*uoTG>B?JW2EZ=WIeB7JktWmbGy7b1F#IohxHWG)|L*_SsWQemeF}?h+SX^X;
z+?Q>FxupU#DMbA?J-2dIxPrfcW>&&ZeTEv!_zb@$J#*MNcQXHAY!%?gX&mdF5{jSe
zXq}hedft`3q7V0iqo-aP<nQDPxm1Z*D{xElpt~vo8`BxVosV6r{FMauGv~-bj-G{j
zAw`IO2*^P2rmZ|<ysN_Htge(Q1XM%Y8&}I)IXL6Yx6tLo?_#lW6uGYWn>o=bl~erZ
zEv0)_Sv#MK%T)_xkN2%Ei`M`IV&HoIfUj)5bIGn#RT=Ph5<tH&Sx3BIuG-ZT4j<KE
z>H0ee@#Cq~40N;CqB{I0jgnkkYcU-vyFkJpJ%tyJ@#NkqCL0S^9miFe22h-4140-k
zL<Vjj9=Fq_00i)#6PtzKpcc|RNkz)OkRI43dDuE#ew@T8KQ<C3r09^xmi^HIp5Ny)
zxR9lcsMIcW8lkK8%(K`~tulkFZbdi4$VO}aD-i=IKAC6$qAu1)g~VISflW=lH<5m3
z-~-R>6{J*Ux7m1+CfVan#mkh)PNo8-n@EDMkDIY~z)CPfM5m(aX6|wDRLJqWu}OwJ
z7IEy*C_PXT<lO&L#d`6Ws`g94m_elTD$yBwKRW#BwBXZ8(Aw$2u}rzbaE`epDSu5p
zyZ;_`lC)f*??RN8l2yC!tnU<drJfJOVil<!l<d&9y#*Fyz;k*q5<W(;H!?at#)P_)
z@rk73b!29ZRz2F%3tfbJoZTd%In^!Uf4<}!FqYpqsg8}*0<P-Ey8Ttf1-B>!SX#XS
z*3AOp49+*Lch`AQHzO*pg5hcp96a{8j@3Q#nY0w>sU2->XmWd~I&GM!jlFB!Z~BQ#
zP;BU$%wZTRN5KXU9~aMgY3T6_eWu8C$vNr2g7e(hz%v<&H+{Iaz#K4qv_QxGNR*t7
zyF!0@cZbEO`TYorkWLXBoSt3l^V%4t{+{y|La52stC;C);GsXWFT+mdIjwysq?#G1
zOrfIs%j$ad_SViAqLTuvezO@2R3{n%X`WDEqjvl7iyDy&3Vjfed@pn~d%OZRrll6>
z51v&qbu~bQMrl{Mne@@B<R&eajnoPcq?{6#3m)pTGWxbWo|>0#cV6mC#-t$Jb-6`J
zVsTTqR{jVBLz_kFD!L}k7hjc_8102!?5SC;uG+nE1b7bfptq-Iu1NRhrAMq{tp>*D
zSGIahg7Xl7VreC2Fr>uI;DlFvt~Mk+!1D)MtdhhrvZ;xbnorLsN_Cfmm(|6~^uOHL
zKLe|oRbwco=XX?l;f1S(oO;DM^st9Tjmf<gA`eP-F<yO>>^2(&{}ByTi!^UYMtYE1
zQ`+-XLyaBYpS5d>H$<A#Uke%Nn3BZ{YHrrQQSBRP{YY{S=7w%I7m`NzR>Wg@fulsj
z6T;B?*gLvf?WXUo@*h4<tQSfi9=f&F8R8~_0;!*6t}RNhlGR9`NMM<~Z|`=Ya`&FC
z!g7R_Qfj{g(W+c2@fOLntpwX-3Q4e;qu1idl;2>(UYd7a^d!MhD)oVv6)LVGPjY$+
z>2`nESwx{B*#1TZ-8o{bxmU&9Dt>z!x;1}JjdwIm&!(#qgU3oMJqw_4&>z>U@#yoK
zv>CSbP6U<`3gi}ycEfpSj;Ymx<~e1LB1|$O)6<&81Y#$`MVnYjYQoMyt6pSYrsaUS
zn@O*@eHjLtRlA}MYK$Y0)*Eu!w%&~eI5~UlAJ}&;7#w()sHwxkLiL|P2H?SH<&h=%
z51;*i6DNK$AKDvpY<PQ)jG$OX3jR)6C@hgV3lF=N+G*S?feA45{`gb+^FK`QmA$^)
zwW*(X4M_NhDHiZy?D~@wh-hh&-~wodiRsRN#rJuvt46Kl2$>7u6C0O*=t>)Y{>O5|
zFKO7h4*E8|tf8}0+iT|&qk(W<!wnH)j3Eog3p?c(|6XpeS?4kA6m%U=NG&=g{&Wvr
zh}mX<<LM{fPyFun&)j?~bD`x0a5sGN!6|i+vVUaXoh!Ba(@)4$t0MpdUFS}hHh0S_
zxtZYl_M~h_l|84xu8*xWv(f1-!rH)D-%9`$EA0(%-Rvb<ZA{9<439h7eRsAqX7&mv
z>TmR#uL5SOcmoPCU3CXIwp_V>^LclpE3u8$49lQc6m<0Yv>yPxfq}?PC*>QjD7QRR
z@F<w7b8wd7wbTZG({jSs_VS*j8?J#}Vx^po-K;ybOKnc&fLbONd!T|_QGP(R1bCyM
zEvAYH^P+N}@!m!kJc=qzrM0al2M@NBo}WmUfKO=*R=)4j%5F`gJYy&4fdfqV31+m_
z$rvwni_Zcc=`=ECQnJJJlMBoDvuEv`1--`H3_KBJGM`f_mMhD~)I<AR1C=4B6PzEF
z&Nz4BafsDQa|e7)i>{G-a}hyWI7Jd3WWRO@;It<4a8=3T^$(lsWyhC9cqAMQLX2O%
zn&0YY#}IFizoqx8YoDMMyb2KyHNL6Mi1t9lXXP79EV4k^)v2EO5#s@_bMtM-I&8~+
zKTH4QL%4sJ{C+vO*KvcgAAV`-%BAbQmeC6F?Pcih7c38x*MID4_-Eikk0Sk@<GdqT
z-s<1TzEo0%Sb1$@@MAM1=k{Tcd(~3lk=l!%&!v?oEw)`plA@*9lt0k2zUyBDC9W=#
z!bUGaIV@q58U6IYoU!sBHGYRX9WuYiKG@Sb2SbAAK?;$@huN$$u8-*U-M`C@!+s<f
zsJPNx;r;wsbVP=A|9!HXC-GX#3+^r`eg03Y9)h#4nqrh2{AOlsBZw|J)7J~g7>aI^
z1KK@Z^>_YZWhA(_3osiyKytq&APsRK?M7<UT-3f@^(;E29UPR9WrN<97o9er^q`9)
zl4_kyu?CpNC=2XJdQ|Y+OyFF$+gE?#MuVxfCE15|mC93}9*n3cR2~J(y#47rpe%b#
zfXSsgW6O|5K(>O*Jp@Rvln|Hy?6hdeEuN__YBQ(bwtPcM#eM~rOvWorEZ|OLLT=k^
z=1$jN*d#{@-}|}FW^qPuMl3M|0M&HpzXo*@A7s1PrY2tb{cYeZ>nx))q9oKlaX1nt
zR9O6Mwe<O~(a@}am<+93i<o>vD<o2F3_@#|nC|^o&i>yYWzgqkFcW&4JW<S58@f>*
z&&~AEXC|S`?jAgFfb|X5N}<B|I<L)>Fgr?xG^0ohYQ}1uSXI>)z(+dg2PAH8CSF+f
zH12r%Y(ejLn9PMAYZJeZRNSaC4TpgrfT@{>Cj==we^;6(A;!QH)p3?#w_P?E;SGkX
zm6&0%|1gaU@*nE3a(!<2@n=)#b9xDDaI!hWe*xa8Jm)53I7t0a^1YL-F)>P_Z+Gmt
zMXAX<+^NS(gJZ_^C+@_|_PR}qa@xriMC!`(jiu2wRFv35r}gB|Hat*chK0G^&$c0V
zU_s%6mEY3)qj%!Q&H6V|*K7*kv?0U6bDX>E-j&7p1*6f|KnqWBuEwO}XrmyE8z(l6
zd=)Vb2!kd$8Ze9&HQkDfz?;x96@>S60x>4COv0W&W&IsVPkxx@*g!8Cn_RY)o8N!*
zAlw<i`AcRBpHfw?sEr4j4(w8oO&{iu$}<qldw}LTpyJK7{PMmn7;Lk!WIfy}NgRcg
zGJA95a0tYs0OaO^t629~0ZayE#47a|mQ6RxcMB(e@`@590!T!*U#w$2tM<0y;exyl
zl*?Jpk~STYaw%9``19YYIsu?pw%bJUi6SDr^AWo_AkjE`)~6FSLJpfwF9UN^2O2$l
zk*9*cFHLO*@TCF9i#8T3N{cpgx6WE!1_u_5CIXAXCUZV7%Fa1+yq{v>Buj`1Dt@T=
zNe|<B6^4ICb1drso-MiAETwwCItckdq|lEa{n7T^U6rW8KIo=$cNP|d*3sX{df}<I
z8?qK2TcDA^7w0lWU@>`DcGDOW2jA6w`oC2FFU9<Xew-w?-8(*&?R%dZwq#ihoeb|6
zndKtE7;mhu<Y<<aBQLNhXCq}`Kxuj5v$0{sGjEKMMfPPosZmO5t#wA{q2X<Ki>eQ~
zO+sy?OfaO7p*DJI>9%>Me?zu1i&KBsi$~#59!J_8Y}g;J@C(69j>D0Zb&@?-Sy;U9
z4r)f8xq`m}ZBqKwtVQAJ4zT#!BbEg~Ozfc3v!4S^5tR^d-SyW6d@;Z}WMHkE&KlY|
zzQ5^^d&iAre0;j0#~#Meb@Ee5p<2GhE$4sWTF~Olk$@4r<fW|)MF%|GeeqTPvL;mP
z>885P=3Xk!mu|O|+MIv{#?;M3&BG@CsI)FzhJq6QG(&Ox!<2~$n>h(JoW8a2@+|Fn
z9~ap>xZ<`YLsY`%M#1;ymi=8-=T5iuU%wxOFGw$1@yGcmvTbbl2|^G3vrP+yzDW@4
z*2jJ-9h!eW_S84LSzLKcaGoz5zxjWacBWBDXj>fT)$7)+%-hwRa#%TJT4`n^hQYo0
z)WnpWaF#TO9Foj#4h>W$jzDTonRv~ms9>b#j9@BRYMS#r0HNW4IG`wqkG0-<>-FxZ
zx7Pc%_owsWoU`{{d+q)ELv1<B#MI?m*9+qc4l2bsaUGt$59&`!@ujAX_)Pg);XiM=
z50keOo@?11eXd!kL^@UEmv!Yg8MEg9iVZ(FM;@Cz<-gU+U496bK{!m^Ev`Zj);BYD
za{2n3QGX=1*z5wToj)V{T((^WGd4OR6vQ@go)&@?fmyCjbFCHpHjBpxleL=^xI41Y
z<al}JubpjofF-1HhzDc)a(<V{UPkZaE8EK|54$57x$DdM9TTDrVUxO!-5dTFWZ}f%
zVXyjp^Y#tslNE)@Fg2K*cmQR)3m6X(5zvV{1WSTiPb_P`tfG+@e%>L4nhsl-lC*=F
z1Jb>oZ&8Bz?eJ1oe{V%EWj2~@;fXxLpc+8pt^uPY%H`tzS*%ldt&PWPQQ&y>iVg4b
zp7LT&0it_OUFrRL{TrpY0lF@j#jaM#vS4fFz<<p$TKENPYl=KxaM!>Or?XVxpO8GM
zvH(@-eehykp^UMn&j}x3@hntxWRhRjYq}3SbEx<FRCm&X<xx3dPH_aT$&~QOgg2fV
zsdi)%oboj(BVZ}Az%%Ux@wWZnHwhLQHu6}Lvt!=m&>%;T4mMH$rt|rXvJ!IbAP-Sv
za3K?hpkJ(4@<)gThVZy@(_x1QgOb+i=-4)$u7~Nu1v^cfM)$Szuq$Q54TCvF-V=;o
zBX_lHWb%TS_pFsy2h7L?<(E3e%)_zGZ1uX+TI|ud8vGboyl6eX&JBnF6OYvBScF*}
zo_X!~9z;~#_Y;>GG?e)QPdE8i4asc<?`t_{05m$6d9iXxKs&T$h05!JAG}j!caC_V
z<tV~Fsq!k<%w>Z^`P3!IUZw7R=Lwby;V{r2eQUn}Z?*TL9f!2jDtiHHe(BuVApuER
zM*e%*ZBMnHV>!&JOqz{=|H?)hz$MvH-<R{gjo<|Ae%+jz1!N<AwKHlPOu2wB{@a=5
zaZ2(R`Z3<=wXjQBax+o%#_(&$LV<Q}LuqU90BWzikZic(x}%6~W`b}kuAyNnnVKoJ
zajvC?UeN@PV;jiPYqk@2j-9fe;$=ir3U5C;j8qTdvL)t>z+FHDWEa3)Z7_owBf65|
z>IFi4bb?5AX0@?p1#-d?*~Prj@K|0#)K%O7Vy9)=xdYR%y2#`A2CXF+DCW|fl=Pq?
zk!tu<by_8UkZ7I`KUGqcqmIiOX_w3N7GZq~-qxS$KzO^{8kenbTAsd-iQr}(kS4!I
zL;lC=EoAa8U}+c7`k^PO-#t)Xn70ARvs%0v`_ZMmZDkEHrmRJwx=k_Z0Xx~udgO$+
ze#i=oNRW1d`=D2({G_|Xvl6p>_L#6njcp_VQ-Laj#4WwwyOBDj+`7mc4{UH%Q6Qfi
zf}X?@>5;)yTKw2MVXzWRKT`#J=|ZLy<S*a!qOV6aYIAFBc)J^dYNdVtUQA?w@?cFt
zJ_V`h0p9dy_5Qf~5wZNMltqb#Wy(<AQkB!=sz|hB$xpL>+tHDnsa?RBREFt?A(9_L
z%3n?6n|1eP6Tk9|>VjR99u_*7)V}&I?qvz_qec7moR}akb6VdyGfKRPbewu>;4ea{
z+p>2;*x9_Ujd)D$^bH;FS5giaCc1yEW?@n_JAD7opwI7zur`)>>T8}(a}-huTOm|&
z&YuhJL(U@5jv4%({y}^feVhI5UIka8<z*K9uzOivbh_xwAjnFN6i=8ZoCr+bM1;&o
zPq_Gq+@6Mw#DG2-w#S#ytpe9gkqU)_`6lsb+C_7P+zHf_!lqeMFx4E>a}vBa;m-|;
zj)}&=ZHSR&h^P~SH&?Cb7jm{^Tv;ym6>VFDU^AFvU&t&(Nl0&t4>4(8hcyk6GeD5Q
zBOuN|!^gLU-`e@Z0W0(WAiTP8H`6r2pC-&VT7_b2IvlQuM7O$7%Cq*Y^htbL&!GtE
zzb|Y<=HThY>p=%flUvPW5@W!)YO!5xTXb@1Qe|b#>li95O=t}DI=tHc`+|NBGJ6BA
z=oRFvXz$SWmZ%vu_&`7P_EJD-3;!{=t&*y7kl~a<Q?B!mmCi<!X~o5Vc+fObcugm3
zOs`m<b-T)Xoza)kFd{J1U2N5GE}L*shG7LfE_o^1<joE|=*c2#U$Yz8m;!uHqE6e=
zFmuVyoauZ<K54k~PM!J*hIYZT4@2bT0Jft4{DxI2lO6~v>o8`ymh^gTI#C_gQK*cb
z!j_}NeFrQo_1v_{sk+vz^d-*lxA|QFg=iSJ@gR;LMQQN4Q5Hdh%1<|rkIVzqwCDQc
zYNoyd_WkzPhxLE?KgdBBVzG<(Kq00MCx=0;IpXh2!ruW{Up#kQ@)(a^@`EekvPmDW
zd$Mz^A2~~i5VYU*T7KQ+)ket~pmgoM6re0@588sbNlgNA)asYmtZ>G6yXhk_b|!+V
z`*Ma=>QIHsn|EY9A{~OHAb9|s-RZb0rjMJ^x<&RsTU)wDYp;j5fuXOAJ1f*Go_pYq
zT1%W0h-eZ(cZE~GMT2h#l19UZ?K41w%)XQ|n=@w<ib%VFl3w_`JW6@!i2FUXxa*o1
zof`^3t0N?+^nClb8vc2ImJLsVa6cVfV7}x?v1TS;MOq}kg_TZ7I5B=_f_`I<_&f)F
zS_)#u%2wiz9}_>;#g#154yO)J8W&-tGTWT}G1<X&ggk+Z{~{THO!3_k*X{xw=}%`S
lj4|5p%%F$jLjqwheI*ZapU9YwqZ<CxHTd5zX7BFkKLKOt(;NT*

literal 0
HcmV?d00001

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.020000-0.002000.jpg b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.020000-0.002000.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..08d07221e04350841fe445f988a77bface57966b
GIT binary patch
literal 78071
zcmb@tWl&r}v@SY01P>M*f&~xm5ZocSLvRLn3GO-&1|I?>_@KdEf;$=9ox$BD@N&+N
z_v5^C@2zv|tzEUNx>r~C*HwG3TJo*eh1U%Lo|2rR8~_0U0if{j0lY2)qygxtsA#At
z=xAtY7#Qepun4iSFfp-6-xA;wQj$?qQIb(m(9m-*(Y$A)qoDX8z|8iMi<g&|nn_4Z
zkXw|4hnM?5HbKC^z`(-9dWVhuj+>T(mivD!uiXHAbYx+~LL`Lu07QHQBz%O|J^%#(
zfQa-DEdt>G6=Xyt6a-W>^nY3vJOBa`A~F&RDl#%M3L-KJ3c|nT$oMF4X}Kgd%uxy6
zyM+>ROC|rTq0{^gL$laCC*qNIr`HMtUs&c7d(`%jF!0JuF@~oU)cxCy3<2<8j{1+Y
zkx@|p>DclA69nRa3c^1C0006aJ`(L)E@VjpjrZIr=7gGVKczyGYc^r8O8_jSe?ah&
z@BtElr$@X9Km;v-7X1^t6dvM#9W?LpfjB(E4F%{I*~LsX4bX9X`RR`(Jb%Sr2@30x
zP?2ozgU@pFvo7vdukCbeChFep@doHN4J$UV3veXLA&i-wc%iGP3b8x5!LzU_(kD~+
zE@Jq7SEfAlu}4E)Ry~yl@yI;PK7VR{I4(*>sy(!zF+CC<t05=BLwGRx)B(TsjtHRp
z958vD)|W-&KsDdSe*B3wm3vogv{C#FVpP6HW#du4b~)K6RE0)D-8lRv4!p+&XCxQ2
zrAOLSnQ0TL5c`uc`deMMI>9z~bEqUi;Jh2V<xVzo9@qO7;P-R=^dfMUkjpwh!e|4<
z@U|hrW5sbUK4q9dyNlw+)7b$flMFV5$xJS>#!00{cU-sOneu5dvfFEjk~9C8GOHg^
zoyGktpkNFHa&`60IJ}f!^&008R)Sv>{{^Gg%+U-&mJiFFj7Vu*qb4Y|f*BP941v4J
zjrCcPH)E^nBO_u*%Z}$cYR3Xd$Eoi!UNUA?EL6AgA1WVq^9HN;hoGQkTXBuHTa&Zw
z;a9+|$gMU^?{|zQcYfAl<`KvTNQU>dT$!_)uy617ENC=zn*`n?A<L*pkuh}Jy1Xk;
zTkw$#?PON_xf)q`f>O#fdvkio^lODhg+QSP)~9>J<@zM$Mcdw`0HrWJ9)bdo?M^W2
zF8>pCK4WBml0`%$Dvxw5fO!w)6>zy)5M4qo^Jsxgi;jRU1(3oE!Hb~z|9c>N=0NU4
zj*J}pt7Vauw`1cML(PSV%}d_;cc$;nZzb`QqGPWVheZmfZ7#LuUI7}8zGtg^1o<Ad
zj{GQs3rob(O5Ttk8K@$rvNn#+S1K`d)VSmN0K{&6+Bc>Du%ZwBro%Mmc=K6i?wMA&
zC9OSr*gD6t-Aaj?;F^hfY2Wti$pZVNb;0MknBH)?XmIiTBKt_ok{d!QLN{BxdpWBt
zD^7{tgDa-Cuk3tYRS8EwrMB_bl$`f+$WEgz%(=zr`j3yRJY~mR=(R>VTXcTCcK?dc
zB80BdvG2foqvmB*nQm1*3NV0FaZ188<Z48pTlNY7-M_dDt&4iR0xpi?9i3Zm2MjSs
zKOH)DnlQ4P>1}~q3)fv4T&ZasQ$5*}`zOZsD2Lq`*!!xDs4qlb0Y~ev0Niq+nj~*s
z>c_AUe;y+dmyx4g+}KKD<dut^y4^V4&WG`VAM3|;n}l5#Jg)$=R{-_Dx70Cxb9~L4
za6<Y&3X0#F7x-4#$If4R?sh~HS4k%PNtSh|@7{@jn3JVS2>XGFdG7F-H+}^VN`+EU
z@7xP)tPi?n8O}>x@Q6(pMC+i#Cpe~qB1QBsR`0x#+xCf7YlXLa<ms=(JOV20yVowc
zzm|5gx;9A_$ZB>^%{TL|Jzl6ggZHAc87$8Ay+u~_Ni$YFvWnW7B=<e_-a)*`h_tI5
zvB&8`Fs)w}hlA1ySQTl|a7SydU;b(kj%Dy`Z2{}D`>3Fjahe~4bI~suY?Zap%RFJ)
z2p)k*p_hvkmVanDDWc@~syqq;8;J!Tpen;E49RLnjGKLkx+p^i^|M;jZEY2^-x(-G
zAH56}oWB3Ff8GCUOZY$5VEp@r-6pV|hGBY+gQB^h&hW{sPd@D&R0t(-kzlhkomdUs
zySc_sTerU!a4bP#bIDc7iB3a6Vt$=LLN`pV(1KHt;=tBg!jH!1ha#&Ifi`i)rWP!x
z8MdQ*BlIY-65Tv-Hg*hM7|hWUlIPjmCV8dGr5sQ*AiRNJqsi$YyRsoVBGS0DDBHq;
zUI1(cg%6=9fVT7HL{|OPlQoekzeQI3yE2hBX3r63YQ0}n1i2qm20B_8Y>mL9>ML7o
zNds8nu9>fLCZ(HQsl~jcG1zZ@1dTj+*B58SVuFw}KV<PTen=kmQn7OE(ep)M+hwvv
zynvPLM5{dW(U3`~-g=(#_6%1%)bEOG1JN+=6);^ltRoiiafQUj_1>`IHi#NG>33|x
z*JvXxI!f<6We#ocFbF7O0>fuFNwfX094+sUg&kYQmjmJ{Ma}2QW*0!b)sy<A1k=0R
z?1>X6d;z=}f*IbRvXa{}h$;$O36#dbh6l}IJcK!F0~YE)4N>12jS8|2wl3!~jGIIk
zTd~~$KIO6=uJ;CSA;A+xNyxs%lG{wrv_JKR8~a_d!Y|AnK^sve{qKlr*g6d!-CuMs
z;FE*uT@%AdqqzbiATSu@GVT{N;60Q+7-?~7yuZNYL%r*>uh&>w1nN#FryeQK@mcXT
zn(TRY_*k~x$MW$3$z|=6w?nfZ;dz0_vfJkV$=e%V4o~Z%<1TESAcMX7PT{}2&<kPv
z%u&dbAZ9w{E1*o*w$qP?INOyXU58Dr1Uk;~8L)PwCbaOE?6z%a^{vfc-NlyEp4!dR
zw0Tgv+XmE|$Z*<uBaaDp)p;6ga(sw!rec>D<}GKUN^a%!os4sgoTUi#chT|`?o3$+
z@hdJ&u4z0Kmxf3IbC~DlE)CYm)RLV%YZQT$YrlZmNsvELM!$s7?){v_jm3yf#CUkr
z$wN_+gcKw&W`YV}JSgM~&oI@r^;8hLDqELh?LY+|cG`qFsp;x+5XJ1MSbg6Ry??xd
zK%L8-3aOLFnto1rRQPf2BHF+-y1^hx2@!jVW3nRc3g6N}XI{~?_N?n{9k1G^`}9vt
z5tQ+ihOc;$MgN^E@<00l8GH7uF&M18$Gk*v7+C37_l4Toc7t0-t$4?wHK*yNoqMg=
zb&?c*uYlmP_8VdPWlfmt@1Rm{p{0%odD_;=tgfWuLf6qRP^J)_y8@f~Ma3qOhIRV%
z>uCv+Pd8eY6<#DJLr(q%9-kbEhkv{1g`u~eI<WNC8#4%K-4~lSn?gM*nwK)!%ln_>
z%#u4<>#E>7Zy>>w*DOIWwCC=oirtqK9MKF9PaU!t`NvSiV(Q6jR%`3{CKK%^ZHerC
zZB;A1Ut@s;!$2p$#AR)9h_Sfc-~Fq+kM8^Js2>hk%;=LyJQ`S6Z~N}1KP{h-^6z^5
zB}sxNy-*9hC85rqTN`{1PT7u53>1?IZ#%=Zq#!SXQ4x1@$Ue{iAS?j?`f{TaAvY&1
z*vXU(-ACjE&;Rp=Sbc6U;hD-GtQ^n7zW`P$Th%68l6_`v+Y)d+{ReMN^TUy>$>qI}
z>fHRJiYzUf+p%+C2y}fi^$noyL9d*qgWjF>GwssC_{}eNJ0yXz(GG<S1I0^ZOn&Vz
zp-dbMal`(mT*C=3Bfz-5PW@%xPnau4Wk08;1~z&%@I}KzO~1;`j=69KyaMiwD^<vA
z?+4h<fgh~7PS)D3zwAM$cObsgoeq!o{QRPJ($P{Kx|mCk6+#uo)edFMQJ`=BClsx(
zfUgxS?Ns4)pQE<YI%iEB8o`+h0)Hn(a6jp)=zxVkABb`_CyagR)EF|mQ>FE)nsjNF
z=V1yHDxj~Gi{{^2!VgU2jxYLUESE&oYrsI5l|`9p=mSKuAkgHEXm#dn^gLd*6{gGk
z*i2_ZoMU{UHDJaQZZvK&p3u!f8#^gFJVNNuHMq0mFlEu8T{$9c<#L4`1iamrJf?3I
z9HOSm)7gUel{3JKYLa%z{^|zGXwD2=u&!N7Qqg&-Jn-RP`nHSQO_)9U4_eTCpAr`^
zi}BUvE@KLj{ByAyfYyeMoD=p$ZS}$QWq9*aX!A$EThV=5z)_borET8f3Qkf7Ck|QT
zz+U>gd$DayfF+EX2fBfJ#_2;_HdIlSSs!DGMX>^YC=N;=+;#}|Ns{CckyR%3l4%4u
z*P%JNW>q04ep%Z6@lw9myrZL|$}laOTv`34y|2RGSUNtG0>dchd95k@h39w0(`>^{
zhNZsB6xx%DV_Na%wtA~ub3NsdH?<gB-7jB5dnEBj3F`|flNtsib%d;EhyZgZ>-v4t
zKl^5)x9ZwCHL9V%Br1)Q4wk2=NNpAu$OQ=6;i}H(o8fj}9Jpe5w&c4#+jV#5WqMI-
z?006!FMY^aQ5v+(Pi~r+hRiP{<`6vk=H=XrtM{*Sw*2j2At8fz{2X`nP-v!E!E25F
zXF&e1{nG|(y*fEIjyp&3T{C)6oPffWO}%jiFuo86BDwW#0e3_YIeY$nu4q7YSN;v(
zWlf_0JIvUb=2b(}y~8`;^_y7pNz5gbVKSCOdir$0Cu$vL2`^Z=c>ccqD_{!(E3{QV
ztY7-Hf!K}UB+C@2M8EAo&Fjy;2Wv#sIk6)vEXaYyx9KL@-yi0eT5tJ^4&s&PDIA(s
z`uA6q)^yCoN5B1Xz=rV$p|7Z^cx>y_x6*Vd2-ZmlQ-S*+>ZliT+mlHu`#<ug-0CXk
zF|~W{5M~ox!bkHP>bD5|6uJOKG|4B#WbOt`xBk@!3YIM#yP|0cW3n+ck)q$HUCX$e
zb5g^p#NSpUg=Jz|bJSs4yYY`W`x*#g3&z-ZS3Pk=F6Sbb!*7Ldaz%rLUmhDak~i9d
z?+6|%Y(A?R&NcGild0KKhF$+H{5di=%M0`u^Mfcsfs7uD<%$;{kM$(-#GfdG<9Bv;
zftnlVS_XZ#-vVR;!)#mY;+%8!%YMF<amLw>xiaw#Vi+Ct8EYfAzIp>U!-qCK@BJNl
zEExK7m==cq#UqChpQ~@Br2>#LahTOb*q#D^*yTry)iG+x&kXNt`tXoLTyGNBXF?h<
z8AXF~lFju9yfNLZqoUPk1QIjB^B(YDNaB*P%6cmfRTvZVHC~EjI`)Q3K2ZHAD!;&)
zpIE8wgeEL-e@6`w@+B#%C<}`{b*x1ga#k=PdUu@I23$-Hvb7IV>@;ETOCr)ByqH|m
z;g`#x=o`WwzFE~^P|n-52|ui_8OdU?wWLp;WGA7|KF#?3%YMZc--&^c;nG=c+zze|
z$Ym&=wBm~WXukztg$d$Zgl|y<>dhS1*y~Q!+L<zN^9qHQM4Kw3;T;!I+dh%%tn#XA
zPYn)>WJ50iPD22-c*H0ld9|?;RnHsk=3_ONv`RhtG<TAbqg<qrOT{}eqKjFsN0FYO
z_}Z3a#Jy(JE6q*@+bo4xX0sS+No25SG%;p+<eTr3QzkVgm3w{FOiL`IGGBnN03WSa
zK!iG8r}Y9Orq+_ufaX*vxq6%dWx0jz+hEE5z&IgSHfrp!&<5IzPh%hlQ`2o{@2yUr
zh*@PtH5GLl(UtmRr!h`x#U&*Lbk7+%1Nol2#gGRCk89l*mZVFuXDwN?N(L-Y+$&&D
z<+$LFgBMwaut3u~-Eq6;--dn`BRi`oR9F0uPNPN@Um;6nqffHhQ{lhQ=mS!{HXC3`
zqIpioI`toIa4W;MH#;VWO#E67n9C7{c@Q?UrEm1KU}!;fQQt|J3bzP@NN~<@;qH%?
z>e0d^*5AN_c&RxzgyV<;2-F|Nk2Ljj{}|2_UvJdeg7Y!=K(%#Ah?StbS^ps1v4Ilt
zm{Bb*b4I<Baij3ts3z2On4&L5fJU2cp85;}6POv{G(7Uop_xIUxwfp+)Y<(hspZz8
zi7;)(F_FKMln&4;;aAl~*NkRL#_6W0hwa6~6gqF&`Q=hf56*@}9E2U;tKn|ZX<#&7
z61)xzRLv~XB{JR9R5P4k`Xu16^wn>bp^5J*IOo3Q;_O*W=`oI&18wP@o7<{T$E*Sg
z+s5Wt&?r!3tS<EbDjqkc=Y6XHuvh%_#j-hNqcSQL7gd7}bT^YUeV7A{O&BpfCqoU7
zRkWzT(3!<p&7{a8?^R9-E{op@sA>a^SCmvYT-^|p>aTkez{@gyDqHN3nfc-jJZY`Q
z^ADwRmb@d9Av~u!@{nS|(bX@w`Ch4KKp?+OD-QFEDAQzvY{25D$lR-@+F}aIS?pIp
z45@w)71OO@jWm`EXTy$2^Jz7*>nwYYfTK-a-MtZcDr}Hum;GO?JL|d3eDGn>Tb7WW
zIyodT!?w)v{c_tkgIcABoGkcXA-ZX?dNWg4p<|b3dZ6}Yw$1xz^8DhD2j~v6BY&bY
z<v7m#kiaZadCX%cCbuehWE^MTG&zvuBDF#|S{TerY9L2(QsS~cv~c`^+xLjy-VF3U
z_rmn)>^2})8E#77h-b<xP=C9|pKIrWXIZrfSb#fWlHOvCtb3Q!t+~be^i+)GMAx?R
zBb$EC(^EbS4RgO54cNrxpY|bedt#TgSXI$fkGtfP3xV*k)g-*)(gdL-yKf*%rq6m&
zW&NuR%Yc#fF(1~Cs}p029D9L!;_Ye`59>-^!}O(w{l4gKZ(99PRcVky+%WF_C3V@b
z?)Gn!TGRUDZHHMG-vV0rk>Uoc2EsWh+2fmsyZzY85_I!xeu4%0+OvL$0}UwCB8oOo
zQx)loaxTUC`*IXTszS=`4D0n#g5IxGnnwx5`_y6rghE@iV-EJt$EfP+Gkbp&SpW7~
zXQq0$JeH@fbDMw($UpvzUR-D!voOp|#f;1I<f^<$=;=#EF(Ql}uFvPOTAq8#A*Q8P
z>fhvct&=X}%qJ(lu-nb`F86$8W(wPvqIeYEtV2Jw>8i4A(@fdG-(osVRXQBm5wb8M
zEfHKhP?DfIC5;(8{l#U7qk14EP<mXPf|*iO+P`hAh)cg4zoivhYR=y>!^~@?N2(KI
zJDuK81mEV+@J|c$^-WktlvhC2&kv|=lam|BAfft%LRP)mWXJkp@$=oZENiSse%jtg
zieW(fwVA^4>Dw`m?_wLm(8rFIu2fD*=gWSnVTemwm-@G9Z^p_>M~^va%E*ejmUVx2
zRBxQL@n>Tt%_BP_Jfu^-KV`0KSGoeQ53Z2(FgdLug0lVW3xmH*HtP}@zoukdu+4l0
zje2x&x><l-<Bqp`>DzFU4hM?)Z|Blc5rm_pu8_Tts(O=#-0^0z;>V(PlBSoA!jOXJ
zCEqo_-FbLj@o_%|r0;=N40~`^I*1LZ^5B(`07+=3elwo?EkqikaA`XB#XT;Z&<i^i
z`*@kiw+FhkPLBCqVEl<gf^&Pt-^W*ib)A~I@8e1(j~pNQa@-INWzS<eUsS^%@Bl(a
z2n9)K->)lzgak6TH>P4Q<@;R(lYHWQu_Dr+-1z54*EZ4;`~3NkBFC;dPR(3K+tkzQ
zugyd%Qg|*w*>^^Nqx#Kc6ZyY`EucV9Z=etI-yr*2Z-$45?Ebx@<$XdT^{}!xnQQv{
zE0k_G)U1&=6ymMI`#eqZ@wP6U`<>=|B9`8E{h23@f<#Tx7B2ZwB#i<-V}Di_gxcc_
z4zA{x*MI6Ek3mZk?Ldok(vYu27FIp~H9h@*iU~19rEGeJl!viAv((vRNp7gMw|e@^
zk!$a;#L*{8vb*v}tCQ+%C0KhdwSA^-T+i3{8%d+3P*26nQNoqepo%ef7wDmN3+!;A
zih&^0@tyg>8GaxzlMfC4bEW6XM)pwA7|^_uLv-Tm;7H{1F*QR`9+QsP4r!Rv-O5dr
zSC14)u8962*1v*{qoDF8z%mLmWTgr%1CiWSsA#zg8q*I+DXuZA?NgnwP=BkvtW1K6
ztK(r<>`BHLSz1%mf69yVgF~qA_{W3(`1mAEX`rI`eyvgQ*wUAM4%PNqZta=^RV9N<
zg7R1f9slgqJO)OgTW8@v*tt`}AT5n?irk}60~uozBO+0-{_+R7)~GU+EL^IX!mlVB
zAAk3Zde2LyMs3xj<>X3dMA(j0I`9Zr$LI*SFtw)uK-^1Ov?emDkVLa6=V8&kSnB)(
zGEx~07Kz@k8P}ekY3QE_hzP-qE4I0F7y2IOfe|iRmD4M?zs?6s7)mUyJU+qp8vE8z
zOPwfz*=2dye&S-uYTgE=VshCLCka}&K23$_I&jC9Q`4t|i!s`=pu1LiY2yOSF~8U}
zf4oppfBu>|M9tm#tG5jJ1HU%vf_UI)_nWsgh43AFOz@$Cc+a784<%t3OKX(yVE^%*
zPtkbBGz)V<R%DV#uiArZHH^j;OC-Yi70_O#DsSpTH}M&ZDsDh9#`k{5+48R#ak(3r
z?TLt(YKlDI$15N;_>2Ym(U@P%jIw=A(?AE3#yEq>F^?!r#Pv~B6SuHOKj5QaZj#R_
z)Fa>aL8GP9z4-;|-%p=$tyNECaA*-h`EF%!>=m#{b*)Ns`bXEq7p$U3!!VKY!S0b$
z(cshjIR0NNd?83XB*7aG^z)o2{SUb!6O+@#QgHIfqNsFCg*(JkB=B%4hh>awjh?20
z3Ar+*EpGC@UW3O<`(R~MQBIIzqi!!bgq|UE2~jQ{F%eoT(&iJU(WXw#;h-|Gn9t@z
zoqzS*DOkm7+wK&KjOR_us>hz~s+Z?DOPJ(gcsYerxuHG5zLt0>XYIEDin|JE-76{B
z7#tbN&u@Xvz<pxds2tRC#vzQuq+`7`m~RS^JahP&H6mt6X=!0?>j}qa3pWNE&y|+X
zUZ*1eg7k}rEA@<|xvsw*DN=Q9D7G56NjQ}WLWR5+z(4gj>a|sAFFWZb5|i0aevoH%
z4lxG?dnhIqiv<<`p*-&u5PEd5bjRcNlRWa{t%xnsP5}yZmz{c7!Sh8gSf}+;Rc0@7
z<ahr^#dq`XUI9co0uP)y+k{~`wX3bzVUMSD1}Kywd!=bLeZR}Ucj_!*Sw6d$pZ~<~
zp7c!K3f6k!pxj$8DcZPPnRLm~-E0*)`BO>t+q|ms<TD2lyEyXFEb`jr72x*3=thzJ
z@s|Vbh9LXIZ!L(qfi}Aj@vpDOdCj^Phsz@+d6zC13pYtc>_BYB?NAw?wCF1V*Bo4{
ztz{9grf(irn68~v!T6KQtvrFlx;WXLZ-Lm3&yEi@Pq1c(<^#EdO|P4N&4(NIz%}vh
zArQ&zK^a|naa=x$O`>je{q+ZH!w6ce|4Fv1fUeK2WiMnoPX;j)WKa@1p726T{$h66
zz8s*|gz{7OPC2V-Y`f?o4gCWqIYi!QSZcY$UAT@ZNvvpxo|o%KhKMrqEEO5NrFLv<
z)Se8d6MFw8j(89I0{@J1>PE-=oX5+*WjpUSF~Dco|Ivs~OJCZM(~7%L;)~0yZG3Yv
zus?6VrK+mh#0(4WI?ULYrfg{JNL1ZvggtWh;54#o92C2wt}{&WZUwZ8-}#wCq3Ltf
z0BVV5v0Q9(-Vo`|#-~fn1f1lx_X>yFirA#z9f{b=Tr;?+uq$dIl&)xDm9Y9}T4Qv7
zX^8WiO$<lJqNgZ=a+kvjN3NuhfYeJUpjOh8Yybp7%Wr5D#>@Zbpe2jw`dEf-CV(;w
zPaTR*sPVMZSk&yjyEK=n%xT$hZLe_59a?p7SfYn;d#`lIp?VqB30V+$e8$0H!@&>2
z>*EAhvRrH9eY$j;<^hgrH#o$~?IQ7|tjRcHPl*QexE?apwHvx$LHcQF#AoysAeSp*
zFlH5zgw&}BZ)&q?s~S3g=blG`oKV}jcA;_k;7@Yl8(0A`B9bmMghBOvPw5|7m|CjE
zjv}-6#(m{ybyXAtofJD?0SRXf^VB2ro)>#O%LivwOmh3_;2O{?fa`?hxjz6_KT(>K
zJgUc+>!=*-bJz%c;*$QdC$1RiC?3-x?v-^z1$LCjqK4~eaX$sI${(hB1yM3R=z#n>
zDkiBHS&4CFaa)wBvq&Vg2i*a`064LZqBDe*k@tl<IDvhtOsm4V6vAnB491!t6MCLG
zh{Z&Lw-jEqXFx+eM~(^0Y#S@%;|E_CvP3Y*FAeIgVI8oXrJ#5vE$<b!7HfR9`8H+e
zubhR?E}XWkdw03Iz50up2<OfIRpb#jj5PODv}M=6TeUQOrQIZ@Nq<)P-6({0tpc`x
zVl%GG_|>uU_|8{FDC6a%^OG&d=zC$aySlEBM;1t*XmC}5I(9fou)VXQ#k{q3r3{#z
zH4#Vvm!=Xs=KDe751%v9ehE6t_6(NCZB*J(P2+m+0pQvCxfu4DO{T%qtLG;h7nx=h
zFtJ1r=MzWA%>1$nJ5u{Yvfzh^zte)(x*ros<4m*CYfJpGAIMLfv@Co_*;g%GBu42~
zefHn{u?5zY`DE^Sv8C_flN=SK2V(hnTmDj=lU$Rbx4RGsrho7YGCP5bNG{nQE8~CD
zK~0z2A|+SEw)^{75xw=GFXOhjr@VHnG3Y|Y{9$8*LR^`?y=Ai!rEecFlQx@2Z5j8#
zsVi<Pn1P2Os!nv=MxurJ@$o0mwnM~^kV`}CL2=A6txX<fTNN40^j)*#7S@825?oi}
zHc9%972bXEgT18OQJ;17qFVd+FQ;1cZ{7W-_iDZVH2k?Y`HugS@y<Yy5j#d%%Dj)x
z!5rzluI+;S375~()&5W@HnD_`v$<==v81Y>YlIa@szFMd?p3iNn6&D0OI9-w=E$#S
za$VK#vo+{&E$|STm3-o~_PiG#QoBpPht-#5MDBq}+)=OvTtCLmXGnG67keaf9jBCG
zgOEfITzEIT>9VW*FGvLcA1@6v(e+CkC=3aT^+j-Vw`OF2htm$|Lg_`#TKu$*V^ecF
zH`kCfH_G%bzwf9wFshhL51VIbY_|XuHQ&*EZeUwHIyz&Kz&+uEownH$Wt%Mk9_ig@
z`E^k2<Q0%s`xe)CGZn!p+~o@--Dhlz{0F@5Yp&4P-|_@A_6LW9rIArzqs}!&!QXx@
zH!OUby^8NVs~T=8lqSKoicz}0bUQdN<r!<$4z(+Lq9BZNi|C$7@(1j&9NKg#tF)!$
z9~+1hMd9t>9bdU4Q|@<D>OXWRD3%vX*Hfcf`oO#tX}>pInbE(iY^1aTFZsgz0*S1)
zNK8!DaFlRzLXuk)JAFjt_VGm7o2WiCfl{i5Y5kjEu8u8E+99oJx*R3n`;I8}efH})
zgerb5Gi?gx0}rg;)NX@$h(_NJ;lNp2T1!g_GM9Pevufu)-@(Q3sH9SWYjWuiP=DSW
zap0C$_l6J5wLyI`Z;T_(Cn<(y+)X4+#Rc?n?q`iq+agM}k=N8%t1;P+1B_)EVi9mC
zvMY;W`5uSq&MK=&xS{d(7nETY#9wZQZMfFvGl#DL4kh6`;>ohh`xArm4E~>miv>UQ
zC+f)EbE<vM#&7Lvi<59F`k986kqSi>7CUXf)Cuu78lvHAkx!x_c8FjWcr7{V785PB
z+FL9-tg+C)0@7FCNoY3ZMQTXA0+xUI0dLhW)OStoNtc--*GK~2G>q3N8sT>DC&F4f
z)g;Ocn{ch!Ic&sE5xOaM$Z=1HgBY_bT5Vnd{Q{M<H=XZ3!L@0Kq2`BevCTdeNiohY
zc`wA45_`BEuYgF#c{{^EVkZwz=J~hSJ%(kI)`LVx_ncIE$>Erey0@5;C$k`j=uMu!
zf44L(ry_oPgy7+I<_h7Gl$pc7ufC9&%*d}gARBWq<=$s+lFf@9khF}MF(%yMyeMb=
z;$)2Y@wggwqe_Cq|G<p6#Z-3uS<_cUR;4mI_b6t+{&1hE<exQ<TF<m6GMWDhGl#DF
z<*K-M1mmXda@8=$F=I+1+%9Ln#G+gIE>@a0z56*HrEFf#wz;pD^8JaA4eW-bE{@3~
zT#_*Y>#0%L!LjUi$~C0mXZ`aLQ7EjP>J0^aY^*TU)^wRuTHb_#8QW`}goAF_XmgO^
z^6n%pX@f_5>v*V#=JfP{{a4H1+4@WdZ1Dt8_XYi7pk8$`)UtLG19!9;E*RF37ipdb
zYt;2|;vo66P%Ztt{n;;Qg~}kvG?zn^J0rpBp}CTUMcDqc2^O1WPFp4P#t?k#t#A|d
z*=TsZSsNl8L%yA`;6@f{G})}~@b2JKyJmW>Q4+ZBSxL^<-W=J(K3_n;n2l-~-&MQe
z_=134H2Qqq;h6(Qr-h&JO?JVTC}2i%TuAVorOeO}%EPzQ$at`|z0)EPD>kT}G#pee
zU)LO7T8Jk!5y+cVGZs9`WVze@JYQ=jn$Qrj^Czcgq37un^UBiKXacI9r>4<Nt%+BF
zj_Q4zNJhC-f;+b^+Q0@pCq|fvK~M1iTo`bhbRaXnL#?-0<VQf5&0WN*yDM6R;D)P)
zC6@<E)&m+P9-^fJ!k{gdc6J-!qb{W}gWGBCi3>v6od+Ci1M<3oc@IoF!m=UE?;EIN
z)MdUIm@N~~oKwaP@~@?{+S1ZEwoikrE^mJvmX<P;nQSHZY_=<!x|bE*@Q@50fx-8G
zZ_A(CzsDVxfU7*%qIQl20R;r#dpE^nU<ODYia|&^bpxY2KzWfxJO{@$dnx&|ocSy5
z+Edye#<>U%nxA93!R9`$F7#KTv3Cu^Z-B;|^i{M4pVt_8*hvN00w0A;d(&Dkv?2Fd
zj7B5~eU3%m6&K}+aX+%}Y>R&y9die$Sq6;!(&JX$9sLtVR8jYLkZ=9Ol~rU~<-8o~
zF2L`woF5iYGgkv_0!vxYy5aEe)coX8rE^cWAq`!$?)*6cYehj71WD3d$xHjTxbM<p
zyHSw_pJH^M!&eLO{OAf2!TIoLY`xD>P<A$fM<~CaQGMc#fUYx}j!WVaD7|N)UROzA
zB%tS)o`>yF;Z)sh)M`z3E)y82XyqV5P-0#eAG&MZ8-vI(VC+g?Ev(46r&%~m(d*qD
zvC2uVR*|)gw@y<U0G3$uPs&oNtqvb7RpA@=ZBt-&JlNd~yR9Xl13~6is_8EntToty
zo?wwrBtQBn?xy5b@i@{gQxS$-9vRP9IE0C9#F@W~s_p(^xX<3Xx)w_~W4KLFe5i7!
zF`u4!S?4>XDNKaW65`bg4vc>RFrvoEgm5Szl>x!esXIRORz3`abDt)YxOP@GC;O6q
zzoRtP7!pyna@$C+h)gO@7owPpt_LaUDz)UbN8m`yX2r~8ZVutbz5=Y%dli*5hS!9-
z1L4hREL_Z-F(Y!_QGbct6pwGPQ#P6Upjm%+s#C56^B|7umj?pX7aJZAMJq>PYbc&=
z$}H#sV7`Re2^xgiui_uJVH1;o?i$pf--0OQdxJP$@@j7w{%T&==T52(W!1?wZuzG6
zn(vqUW-NzUOqWnG51Dz%dw3sLfQs6fkJ72dlj4OMg$q|DQQhH9%p$vsJmeWx9{Ph~
zJE-->DczhB<9W{O#JMi@I)s91q&$a30{)l=1V%pX%U?*sdR+~loyMV6<H|~2R%ZCr
z>u;Mb4sv2f9<%*BH+I&{%BFiM7<!pkhqHnVgW`OL@7jzD3c|whv3V`{af|~Vpu@6?
zpE>SHJz5Y4;Y9u4Q#lOvWG0PoQ{E|?r?eO4T(qUMe<}x-TZXm6hUt(a(5%rMit8{<
z0-o^80_E5lWUSzv=fr2`KOX7wh<&PmY`x8d;%M0lE*Q|^FlbTbJpEODIrzY8Q(hF=
zP$*A_(1Lh(r8XGdXtO4qE;7u%nkS!icx7z%;>aaYN~#XieO80yj5%EKwlDB+<iX^W
zF!CdJ!CVtapEexZ$5Ll&bO+g`DURBG2MQkF`>{J+T%4HqeY|oQk$ka9-6$=|45ENF
zU%Q&h@TReaxRj0l%$$NI(VscbF$0lIS86d61He@|=c0Jd)6FcmYQsjZjz24Ira^Ay
zivgcuma4t<$rEwVNSN7|i{2Tt9g<cv#&XaJm~>OfCUWzlEt%{k{*af?vFc}3nHV`M
zQsrpo^`b!H<5m#x#Uu(Zg5~}Hma&HtzQhurY4`ij3w^G%`PDqkh4Z_`yTX+12HbB#
zHPPu-@B0vnSFW`#*KFfoL{FcBRekOAFrEdH|1kH*jN^8S4BV`IEn_a=5vu$$p6y`Y
zMkj6U?~9ny7cA!3n=l;*6qONP;yv>UH_|*<rdzMdcGu}-5}LDAyi^_;UYbXfJ2LX;
zlpaiM=Br}y1kWkl*`Pc-`_e5GJ&!%4$&roZIl62NdE5t1b>uLjj-t&-2wXNvUKv1n
zZkb%BM`a^t)sAZbS5vQm+U1|eeU(m!*4UjVHYM;5a#Ad;QF6mSf(X`wYKV#LwSmle
zltrYGQ&aUmju$T$&YG8^a%ZFfl#yfAWWjphydky%-ZWf}Z|mPSNW`C;Omp-vRGx~9
z%LCSkS1X>%qT)es6s`E6i=HTW8)z{h!f8fFP)oA0>6g`@QD4(W=3Em%OGmwC`UkjE
z?()qRaS*u)#rU^+i4Sx}&Uv>nau1U~45nQpuGJGyZ9!e1p`fI1yOxS##Mws&79<`f
ze;><0lBG_Yv<ae7ou&KWj8o)bcvt^}Q5RJ2_a=~?82OkGnR@(Mm7B5QhrQD*CB=5=
z9^@N`i18yUs@yA}n6R%P+0ba#$*LrJ+;G9HzxyjktkJBe(i*S?^J_$^#t56~?Rr2V
zW?As>gD%l7t|!KXF}oJ8u+Z`ZC->}M?PU`GF~83B#EkVm)%id@i@G+eLIM*FssqVV
z?{}eTs`(E6S02<1miRlu(YtSsa+)^YL~&R$;%I!AjeV-Cs-y9J*Eu<<OoVixxw7|Q
zH7jc;uyzGIx-w1E()RBMGU4V`E8Z0jvCXhu2ORZy9X!R952Ekb>Ok6)DI$e#Vyd$)
zZhkEqfRryBe#i~ARMu`}3d=VbQEJ0zq21StgVA$JqP%CXfKsE=>Q?|-4rr3MrVrMa
zotja$7jJz2N0A@N{Z~omq)4v!f+wcb&zAg;jkcncYerVFg=vt`OiyLb2Da;pgmF5E
zei-i-fiBHLJdyVJeW(4s`|<avrAi9al+IEw<>*L=z~n!+q-XXQFPTu#jcC|<?>m~9
zzR{3rul@U%@7eYPeZ3Ya8su@-iK0^u70EE7W)AerY}SNIP~;?yK-pwz9}l_IGVYkR
z^Rcega_&&JPcy=-mBo#7Y0*b1_pkt&3yM_JJJHn%`WtN}mlD~@e_7()XnHl9B<JXz
z?BCCXN%1en5x8{Kht+>pD0TcIMTS5H{ZQ3J9?jl}Qo-<6qoqmWfVj;v^M9-dp7(sg
zb&9&w>PWp*x8EqdowEx!k58$U9D5#2VV10*>K#FpauhKw=5<!!ZhhGNi1*eH1Ylh#
zTB#9~lvyiME4gj3EVd^f*k+ZAKd^nP9*JS)sKV*@3p3j-K(lI6nbf0<0-lIV(yB`q
za#9bUf<kj<aa&*o=EIuH;l*(zH88eL2xBgD|MEt#D!6uf7`J^@2$Y(iZA3{qE<&*p
zF9L@+6gBTnQ`x{1uE>hWwx(Sj^?pFWOko?+ICmTE{U*x5LUwFU5?HTAeV6<qomHJ;
z%}$4zwVOGmLJz$!!?<TM=HVZK>v?#m^RtxJX;jl;!J?znf{*jTVVSA%F!hSUo~uJW
z+7LOR;s~F=;L`|R#KHfTrHpa}4-}`=;q^YFi#>B1#KXXZ^J$TlB>_DY!0G{OccSyt
zT<or`zhD0&P5c7x3|3d5PsrF`{_qgAUGm!xa-)yzs`;6Rcigj@g#LIflr@I0bDbH8
zQrw5XlagOL^l~yN-2{QLy=@!}LLn_$^FIz{h#=mVs^_|?93^nxV*AR<!kneHJfkv~
zQfE{i$9#n5X@DuxXcn~xWv%stGyQGpiaUJ;z?ST2dbev_xhYqlm_^?DOX4@FL0O|I
zZw_1K;!}*~svSy%CT!ok>uHN@VP9e}mofO!wY%MDCC|g!Jal%nS`O>nNwDS)@1tXV
zSdJ9T+hUMFBa7)KH@;*nOl6L0L+cdLo4fF|(rS;@)#-H;o}kfWnfE{@J<5^75dk$-
zKhJM)W(ixrOgX+WPgbdSR?t*=au31EA?QYLKKn1Q4=z5P%YM8d&sVtwZgli!Y%=50
zaYMD_B+ZIcwC0v^=k~DDzTWdlOcPBak9g29{f+Llb|&?Bv}>_>QpW73?rs4ZzlwwA
zdC=yAvg&UYG)@U@-y$~$1b^Y2_VftB2oF07GCvX74r>t2?s8b_TM<aQtq1E@<rIEn
zdIWdPodb6r>%}D5q8fqrj`^A<Kt6}i4<Qvsc2~hmP1NUk#KSpFk3l_cCyKY|gIo@!
zb!e5|7f}z*OrbO@<gDbPm5Y1x+84r_qBzBOp8rq>%X)}NkP1M2nlJ5;?o^&U6G+^g
zq6zZzjlDpyWLwd*{9u`bnDe*~jUj?pey#0KVm#i7v_k-5-puxC;F^zRifkv;{TRMG
z&jf;5TH9+|RM?FodE||G8}KO8pN`XwCM|kKGD<y&&4I!2TxY4>Qb2hAA8RyH%6+1f
zIKjVjq4ROdxy*cXG82*MPSTDF&B*pCS*a7i)3wbYWG1&pAXa!5@a4sUxrm=vol#v=
zlEM|MkVHg}aQ4HfhRYaRa_BtJg*^o;wN?(yY0=j1@9x5$&SyMVmc?ef)dcB?EU~~%
zHYzjjX-KwVck5_e{a{XKd1Y8vCra-|77?%iKxxAZZfPpI0ING>H!F*+y>H5vo5PyQ
zUJhAgX2Tm&<O<!*htGOhvgu_DKTlN!*}iQk>4n_p9vV@@-=xcn5&!C5>HVu7xc0qM
znWvN7RJ=qvY({P3)?&#nShO`DY%20zoV0??OQv`G{jGQ_u52`eOl{|t*s0GId0O|4
z`flkurhUNIV%7K9F`gt6I-xoS`u5cJEfB@74!28TMkFv1(+lldp4GHfCm(^uyGp^a
z15$dkOu6N+3&t$L{Z?f(>gG<hAOe--F#%xHVg4hFeSz;#N%kwivde1qz^{+@{r2Y;
ztMY_;kIY=Q&GTF_DGMQ^4}Xq^*`w0TNl3I3Ev9V)W{iflv@ftl!PF6Ev&vfWdvYZ{
zK@-OvzYCHT6(zHZnjDsVh5YVW55I_Gm^iD=uqy?4+A+l>!EKKlHLMC9?5LHFKn7j9
z4=+c=c^?J}aT<oEcSwGwdx%!0zuc}VW8xR%>v8APrY;Yltv~HU#R{s`8@;9fRXs?$
zx6dfQ#s&AJKV>@x%Fi7I2Kd*!JNxAwhi>9JGAeb^v$rZC(PCz9gaJLKMK}Ck)7MeF
zu(-99$$dP~sebxqEGFyQb--vaa}dwLqQZ>$Z4Lk2I@Ybf{b<tpZkdA~=%=+=jhw<!
z4>&-(#Wl5shrIkmzDR{99gS!o2wFqC9}&5qiBL}NjH2cNmGK^l;01$(%!$(&n;`Ho
zn@(2I0b}X;u`<Sh9>>mKS?$Gv%U^YOkY^5*j;+gUlF%8KGjD~}UXmS4_7xYppEFQH
z^7*qVDk)2`5Dh4QcS20qx$Zo7P*+1kSx<+<emFoaf_%XRy5(h}CFbTJzg>D}<a#w@
zW<9Uyw0dLkdv)}bm(IT=KR~nYqupV-sA4c(BIF4d0^OY?o&iIiKXMqZgSW{Uluxi^
zmSd>PBw_+q!te>41Gh5c&}O>m*Z{K=!l;SR%wGe8r0G?T733j0xaGIeF<)$b)TRU4
zjs4QnRbrj&d+wPnPNBw_NgWI~EKT-xC5hWSK3k=4ht|DLsbr;t<_C+j!zu~`t8AY2
zt}tT8ruwtytZ!*P=pT%G8)Q?#_rOYuX3R4S?z){|BQOO;ndjRkZ)#Ot@=^n0V*%7b
zSt~b1=JWdG$*?)Ls4~02`GcWD;xs;=0QXjIT&`L}7DoO7>CDTG?+)kyzE*bxEYtlR
z;a&bsCvErSX1Z}Bb-HcXxSMVIaFn(rZJiBhO%3BGGXsrd9#_qBLkY}vdLW40k8p)k
z3CU|_u$CwMJ0Z2oW`QZ^SOhFiIo!wx4~;uD1JA+vJ!uk8t=(qjw>1N*tIIb7=I1<i
z%ZHqIsst7C!)&J)Z?}h-`N2P*WX?>)j{>B~*x1lMwXJ%o)3TB_I}WaS7~SXzV12nO
za=Ro}AKTw>23kAFo3iq&7-YpHa&M09=SA|4*kyVmzXF<9O&~o>Y#A1sIkinN&BtN0
z_Nr?bW4+^U{eiUX%BL&k&PLQTx<Eets=)E#mMa~x+c#v>B|-vmdcWEEB{N$$K*U-U
z=*<FeVy(}tx)5rsPC<(hPi7C*(y7=7(>H$kXD*orTq^SiH9HL-R&&NEBuxaTGyLp8
zZyL(@O~_bQy_f|Xssp=mSZ*iwv%k#k9^~iK`j~-#l>!6kwDe*4&8`NMl}Ra`ii?)G
zK#DoujZa%tPA+A8)8)h*fewOv!$3EizQ7)J*21E!NmwWTjdD8uR-ODSV32u-7?L&k
zhtS`YoMR%LZng=N8Me6WoOn9?(+R|V?~_<8kk|x#EQF8K@6n9$&JZcsr^PILPD4#~
zDoehdnZtD|i{P(-Z#vvQP14m6>ojbU{aj54dN(;4na@Lt#QZ_K?H$5wK&)%`UB58_
zhiLpUqLR3F;mRN6A>HW?S@eNpy}Y*0PNF>(rTS^&G=q!PLMCHn7toNBM8>>;l?UYZ
z`nOU?&EceXrmNq}ARqMw&f{Hv6Z7kOgdw)TF15cIdTG`ee67uOETI*qOpY1Y)56f_
zuoMuNmnwCjIOzm7mu0T}8RI~&@!_kzj2A)2aQET+NG>dZCXh+@Slzmj*{9z@K#z>!
z9tKaOIhL0_SIM2!zvuK_t$_;?9gB#?PRc7I|LL5PQbynSv=PXbZFv90$aQt|6c~uX
z#!47YobM!qI%xYVNB>lD=JG~_t^Fsu)Vu#aghi4dFLR>8)naXAAMWTlk<i&Js*Wvc
z`AudAXuURR@*g0<GVh8y;Mns*lDvE1#GAK`Z}Z;P&4Vci9ll5yaAA8S3LxLrt9pMH
zro=GqtkNK4+zoiqN(B?At`>oH1v-l9qd?Mkk8GE|$73@R;ltv3e1XzATH3IlyW06E
zZ_RE}x~l2(e--7(-Jb(=U<b2ixBEimq@uZ54oVGOp5JUd>+Zt{52Y6FPhJmqE0@%T
zm62(T1&fe_aQBA(rH1zC!(4AZ%61J=Km7{74`slHw2H)ah}_Ge_Gw8Oy}t>MwCZ=2
zN`48x{rmb$(Jbk=cynFtML1^@$D?OnI+~jezkm1fg~xbwS$83O;>+8WL|l2hDr)g*
zJFfZu#eNyBI(tid0s9)j3=!5e^>ZY+R7Ald&9kYun+xswlorIJNPz3DlDNV4>9GQM
zNDoaNW~~Ye@iczAd<7`&4gRgHs7kL@Zj;0H3jb1~GWN41RzQiXWsNK^X&n<XyJMP~
zD_Zh#k$+BD-r7<*NoLy)$&w>;UEPy;smhWgJ)`|u5iP_~s08P5Fu6c3<OB0;NeLdx
zc!)0d`x9@Br~xuwOst~%jih&I`S$#EAL<O*hdwNNMNM2ulOR}6NlVf%U=M5fFOy@g
zIl@}>XVa=mg^UWn><c|qvWzTU@omQ>QxiOZaS}uwy7*>iD?U^5qV?Pflq<fuzYt!y
zE&bQ!;nub486q3^^E|oSiy}p8dTfxDyyai9_0;9KSVWqA!rq&j39mLyl9%Bts&^F6
z*>tm?@F9GACfZwRUGk~I(3rottUqC-_oD4nBW({5NS^C55DYl!R05Z%*1auB=b__C
zPudZ#c&sq>@a`uCb!GKxk0nmvbQ^Z#U?^8UkZg_nuhPZmZvE@t6VNcki4$<{F6VXf
zY0C`MT;=~#c}i%kbE%oBz%9xbab}@D#0bra=I^f?xV!SJc_0$g@xYLk<y~54^=sjF
zz0bnzuWPQ4ZvooL{%+p?u~B3~>SsH3k+A$zTPVV$ikMaPWSA~{=vy<KZ)*Zj8CHw(
zyT-6td54cIzNSDkBRzJ)^>m0nTffrK&PW~4GEkix3Q7F={1^Xw*^)DfGn9p&EcC9;
z_mrskfM2koI}yFlLy<s#SjBu}rQW{r$?94QzkgBPce8GH%a_k@Z=4NGN=^5DyM@8-
zJC5xuAlU#zBJJW^(1C%giVfFhBE;-g@TF1FwQ#9;LcV?ZftBo5!m|2(N_q-u^jhyq
z@WRwtjl!sw0sgaoyu?b++Z8gW`dec&aEN{HE8tzJ4TxPF!eVBoA)c6;2>Qd8<+L0)
zC9_D@bGzsE%jrf}D8d=t;GL-0uEDpHcU{nzk!x(P`u8V0TCN@RQV6xazbV2_{*+Ox
z+@5SvzCFK8&m|t4gp(6}hYKav7^buHzaN1X;E>yC*_!1$NHiBi%3IFGexA3jnd@qA
zN?!O}+qNgf?`*wIO!##T&n&12q=z_=-a*P=0SbS)=*=yMSTZh6lPIjkWK;uaFcew>
zo4qiHXW~k+^G?rQ$p|5FHdW(JZ=`CAeu=FZd%wX+mu_3VGMJ@e{_awy#=Nd<o;8^&
z2H*S0>Ykf#7rqVJ{c&F*(Z#T5u~Hdqhu6a-g8GuzS~NL|VQWU&nfA=-2o@lQ`mez6
zl6x>17eoFP)Nc3!F#<&HZI|RX1<z`<+n+ezpJTs}s<)n*B$Y7S5n3LF4=-2!iJ;{+
z|L>W?Tq61ltBViu{VNnx<NN~DMe`Gt7M*Qu8k3k?X`vVG2IHbq5Al}PID8EBFn&ic
zG2kdZe(8~|<s^Edg;a-T!Aq8kBt|SnT#0m91=aZm_6-e3q&i=#^9>s6D<Ha`yo-mI
zX>O?`J6=PL5-X%$(3<w;0M1cq%X3jW>fEVusR&i3EWKoDk+i~Przdx1U9u3%%*q0Z
zWQ)q{#xKr25$#;O0RoNa7%VfL>LOEv<JWaw%#5w3HN<O+g?-<dutkj{_?P7l&2G$8
zoCa^vBA$7m{<vs1Ic~&qeROe5wJuBbb(R=)IqT<p5sTLt+b_ygGIX;2MSe4_JvWw-
zp@KZdv)*%6jo2i|plBNWJc*OI=l34A-Zg7Ced~`@W%JcXG?BK}36ArVS|}*{yzXRo
zrH$0j)j`rt1OaN=ypgFx+m?BNz96;(^-1oVdJp<0+xHQ{OGN$quY(UPrkHId{I7s)
znH}B=tAY;jcA~83EJsSuI;QyHw_TAU8^eoQ!3E?m06#bFS#j7hM2#gw#;++xBfS%B
z;0}or;7Dg2cG6T6CNuUV(c{MB6HZ&$0rj4*ObL@iSJJ+_Xx47$q!or{UK-aDpEuUA
z)YK^*Da!JE1+xWes-1ArDSg5<;Cy7?<EsWbKq#i0-)~fuRlI>Xw6gY`LXyB@I8)nX
ziS?nH)C6*iqS9lPWM7q(e%|w${{_tNwq9MC>v$%%B#B7y@EONJiu&Gdrsg8^7KB%;
zxrX*wh%W!t3;vfLx%t<h9;_WnkvSuSX=BT*ATeu)WiPl2_6A&Zc^`KNrnq)^JX0(y
z{^zpb@U9oTS3twZF~gjf4UQX4!R${{bguySb(I5w4UXW)akN~WKz;&MC1;~GiGKmx
zrwYNm4_$Y`vLqI=z0WnlykBjx6<IBu?$0p<#HNJzH1nA(SAEWA^{LSR9Kfh)FJwOE
zTx(}8X0AOIV}gt34K8_my5~TUf7WfHfNe|g`<6Eu+XI<Zj^pAUJGp>N#2;=GZ=a8a
zX6}l@sWt|%3mW*i%2C6Fi*7b6Y24gkgLKS`19hw2w@nL<HwDi^)9rV}e~iPDYOYgt
zihWYp!@v8GGxieu@9%{_4}C`yF%FomzhM;Ndu%!+*b`GXRik!rl-$W1`R1?$kLC?~
z!=<7r%8HTRs7#S?-gG4r@=!iWCNSij{xfA}M(($F_r@Ukvu+F3|HIf@1;z1&@483`
zA-D$y4Hn$pNpKB=TX46*VQ_+5a2VX(eSqNZu7kTvf|K8#bMAK4{_k@xyZWZ9t9tcX
zuRLF1>tPn|&_yI_;?Vg3*VjOxn2XX~h)A4pn#kb`PV;!6;>{j?5(oMZ-p)nr#u00;
z>l-F@;;yvzy6rOP)b*UZRim7{BXD1{ikI_pZfE4Q+&(<0Ub`i~-|ss=%Anq8NY`O|
zc$ta>;~x3JxB8YB-YGP`sbNt4X+HO-Bg4se6ej#*TE6c1)$xsuiI&ABDX;5T-NNjm
zx*_*I>PiH_AyuMLr*>w|g}M%7{eAU$NerXE-|XRJ1w>Y!zxPwcdHp9khthOk6=N^2
zm;I`$dCtWSzFFnJqijy$TKe81F{_Cl38xeIE(Bo_+q`o{p$ku?+Zdbo2n<-;zH0d8
zKADAXI8w&)YK050x#!c>ylOw1k$XS;kCV=MnNV=BE;2A1Bdn=PR`e7N9JsN#6^(+*
z88q_=zqx|rmJ?tWJmrQpY>xYm_!_%ZvnjFfK)TKL&f`3m(~db&Ztm5;&UOL@wpK;v
zd`3@4I!4CBwsoFZ6j6}@Jv0gWJ8P~e##6_!O4U&^-89W(PUc${IT`L=I{a>=0gP{W
zJZ&N=`0aPF1Y|o9^DJ^kmlicdMnm+bExN6IrK+AqE0_;BOv{3a`zVJT{_tSruWJs%
zIT92=Ia${yyMZze8T1Xrre*uFB$;9q$HZKD#o#Wi0*3>J23{LC>i;<HI9a~?i#1$f
z_WDKM;*0a_)Jpff$<k}uk|u$Mv&kQ|*|{N_V50Y&g@GUcHh_eEaDK8H|DWw`Z2Ywi
zZNl?=b`%TRgN0_y#{9H_iOGWj1ARw+-QAjKvN8|4?_YtcIx9V-IVYDy#Hc~7*wDXT
zu@*O8Hu`3%T)XTy0RNEF#+xC95ys8C9S~J(!p?K~YkLjr^?wLh^MBk~s^XzpNH;yN
zhQK|nLIhk@@;1ZDF)q`I8k@$jywGFkbNOb@RG~hZOTp6L>Z-Uq1h_KxBP+e-bqFjX
zDm9TkX!<y2%DunPw+b#f2@U4nN0myWt#Ec%^n1KpPE-bt$K$R4s}xUsgF75#IrF&`
zkx)rMk;qgKBc@t)*|gTu%A=mX$NB>EuvKldHk^y_uQJK_wr8Tgt3iLJxLY~bm&5v`
z+P>yLgx9#Y1zlNH{Qf<+bLW+o0tx@qbh`AoOBn%CsNHadLm;MsqlS3GqKGKxdykEW
zL>zazD>iX;%?4s&{Y0c9IV5s5QeHmU$?gHN7i$7?4kvPNI=Tw%fDp-PNT4S{m-ukx
zBE0sXe6AA65^h&Z$ar*BObafQDBzukc%^2&AKG(wYMoYDkBS7$2)rc^k?S1>uX#3?
z?t$gd>vz6~TV_usY{>NT19$V|P2)XuN<jO_q<i-&{o1jkm8Y4X&H!jnx`t$+fsOk5
zYO+8eR7k+|<5>EC2oqW3{|<Tlg58_10QEn;S(?qA9#spF)l69*3us1aAZ_Hek)>t2
zrx~=rLoC90HF-5I##Ko!;|Ivt0xYs@m}H;Xo|w(Duc7B+W<h!!nhg%3%eP;SAM0cA
zW0knDpB0iU%cE5(lY(JTw#Mqm`qc>Mgq(biv9jF8!6$N}K)c*LVjw|`_#tm;al+E8
z+~KTpOvcc;UFW?XM%0(Ck+m(Vd|rtNeNXb>sTOH0JelbM*7g;U;;*}UG@lIxNQ`HS
zCZ>r9R?!pYa#qa+80MkYpByle1U$y2D_EsSwThtOQs$;H-e_M!7xD=baPpA1++JHY
z3cwC7Bq+Owo=`HA`cfZm=Y%9~e%^5sF#3xl2h(BEKvYM|cTi=T&ktwOjab~WNZWk>
zGJF6vc^r+gh|87WVRNxbG~`2QFtQc0sm-C^N}s9H<@9Mizi)i2ew%Yq=IK6Ec<_dv
zKJB}nuFXMmK3d@un(0r*^S`jOujy2BLLj7a=WFzBB$SY4+O>O;@QrHv;q0A?r+jRS
zussWJi!6n|$B?gjq_dVm#sqz`Sh;KP+{aaG-xWtTIxm3f&~^^*wvq9;Ha?1C=5VFP
za9D;BZ+EVQwoNUexG1=cjg?=mHLhw@`AFA&C3<5IgG;a)&|a$U!*o`8%MXotoZ5Fr
z=dJlR&zs_|@z(|EMqlmzX5!Z2xB>Q+*>7EV(UJ3@WP7C&gHz+e`rw&RUcKGBRF>BN
zj!bA(m!N@TlcBxnAJC$fg-hzZ)}dQNG9?k5hhKc2p5>BSiaXDzzV#;gLR(KJR7h08
zB`e|$;flzH8*4%^dpy!PZ<eLD=GEE?(&^H^vy=Y9)a<^Y?P%OTO8nSWZJ&ve50PLc
z)!2>npI^zRC%GQa+4vMq8i!cav<}8u99&f(Z3Zl>`l+&l;aURCOWTr0d9{=gW2Z{C
zd6+s!NcvOTgo%)8c~hM({V$mW{$$HoznmNuCkM6Z$aPY=4>z&MQs2Ik@Vw)J#Sx=;
zm#^syLp(_d<>GRJm3$Jvgsd4HwSfa|MV1upXj2(}e+e9)fLV1KRFl$w%5xYh)okHX
z$6J_W=)80MDt!XqsXl@$JEWy<bw0;=bPY~5XU%7H3+sA6KN}su_E2{^j<s^lZ9AeO
zNzz;S@<Ik2o~x!S&zD=orSr}21BgD=kdf^@-gwcGO(UN@K$ld0{ht?O#1B%)LtoWL
zZ&sO#*~a8qPsaX5tCC<=^d7KMrDEL_xow@e2jMrMCbZAc+f>k5dR^_%nAM}W+`rVU
zGnDm3<M`&a+_TQ=k}K6Ktdh`#K-{RRo*|57#r%t{ZC+Y~90|~u4Jl@eH_;R#R&uxZ
zOutCqqQj9VvCPt6!+|~U<Uh{X@wi32Hb3YooUU#xi54T31nWn`s$%(2CBTWN>ua@J
zSw#l)NSyB5BCx(h<#?j^>OFX`x-Hbm^NS*VijrL7>3eM~CW>WMoj&7~nz@4x+~W#%
z#8w7}W%^R)g&U*6sY=|Y_T@VH-<?YCewm|M@+l9(&L8oB7J`8@RSD3AFkNo!Au-!g
z;nfUS&)n|C$O<-3M09~=s_eXcMkWZ=G{*wa=9q~}KLkHd&TYXQW@o-)W{vcm4OE?g
zCb*(->69gGKJRj{-JLw2cOEjVL!g1Cc`-oQ7T3y=7wlR{iK{K?Mm$)IRW`JV6dES8
zY(M8KJL0H5+?-ApJmey)6Mz2ON>*M!V&b%vPd9Q?Hgn@CrJ4vuxO*ZYhMbqF@xu>>
z)<%H`tD@JE*KZ8>3f-U1UurE?HuFm#bU?;#6N{JN>Fi*K<m4L!5`5X5V#@ac)YCT@
z@Phln?*{l!rcUDrPyuC+7wgy*vvqPTcuE1Kh^}2^c4(pDyZw{+hPYj&u9Eo!UF4>U
zZYF^{8jDCZ@GJYF)kF;#Bk%aocT6%R1^1-^x)E0%W;%y`M`H(##am<`<#?F99y@Gv
z1(ZOJWjp0Xr6w#Hki(<7MTXClDu&I%c9L(~?wrSn!2G2}_Yo~v$g|GVlt+}jyY$0n
zv~8Ah;kVJb71NLspOD8!(Kqy_Cz_P(c(W*v)DSFqvq_${$=sjjtcRWa$6Cc&!468E
z$u2MGFP!pK9&Z)@xeOE48DFXIO#4sqly5vcIO~XfJa$yYWC5$D40AySW^^ej8hY<v
zh);dt<cab(VJmO9D}@hPRa)iq&m;$VkNsx`dC15*fkSL8rk!*kda;erFWF8XSC}k~
z%p~$GW3eTUOv|k64OT4N?^Ts^Dn*e#w~xE&JWY5P4szluVay)vRT^7DZ(CJ+Zg6u9
z;+bW`OZ}iTXY|&NlCw&BtLR3&TUl8#0dC2CU^;OXQ(Fpl%2(!549gZ4p*xBT(v#Yz
z&f^=<_2gXyH8qDOt6bW4rz&ITBDK7)L|Hy8CUmQsJrX#B9zS`|O^ITFQ@HBac?gw8
z&H%4$a*N+p(YPdOHa2x*`@(k9JDpT1Oh9cqe;1M7>jb2Gkfo|NYs6O2QK&MdsnYw-
z;k{hSw;QaD*8<#<(i0t34&*C?CVv?gBTFS1{k3jLN7R}tI<jz5Z^2jVw_OXsvOJ2<
z#VKTcZ|T`ob44<M*{4Qm?(&-fm2<E(T_c70UA)-T+3`+33T+Fy2x0wxnYDQqo%KuA
ziA^qGWabH^q*`n*g1@kMh-l*;;oCR0Kp{<t-Ao(zPaPN8A+c9|>K39kvPnfQTX5@F
z6wgMxtiKsUS&n9%%}k3GI%PLBSTex2n}V-od>@Ybd%zNDBXRZo&M;@Jmow&<yU7M!
zJrmIJt<W$>T+>fjcywixczM)DrDt2Y=0iPNqhA`Z{-Av4>J(Xwd^&NJGn@xAV%3Ed
z+lrl~9!uy)8m%g~4b3!L;4#8(^?*=8kx|0A#|w*fq@#!H8@{V4TdD;5SF_(6>hUC&
z(9|x?dN9S^qgAw~<QhE?jgr>&k*sgmt)Bl+E6lInm-x~8wW~AV>CnFWKZMEgD@E5o
z%5OiZ(W3qbX?TBbNp3=N3L)-%pT#4`6WtaqgBy9pjcIF_f)K)Fua28??&;19;iY;h
zdct*5>+Ar<U!Suk@a`&<{`i;e$wZp<=XALH)=7Jpha&;w7LjpjsViKg%LtYGvxBCv
ztISSDjb$}W{?5L34A*a6rFf9*hNJvO?bp?sdDWnW_aaaQ;@p8~xQ@#0P1(K3=gP=i
zNjyK|N+eiZ3kZh9xym#8Uyl|J(@grTP0(OmprG59e=yrzAN-D1{}<rB!A{OgL8D+u
zg1gXUSYz|b|8L8@8=bxIKLpx^hx=Lko6$?T`F+i5kXcCBj<>c3SR}*J{8#45CST9<
zd1h4g5=tVD5IJEz*^AAt7n%FTJ%sCXIq5GREb;u)&ViK01($SNJtI<gyC&zqMq!!w
z5E2<vxIob0^E)w#DA2Qd?8S@DvB-Z1aH9+uJX~TgAta)a7Y*~j_zxlF*-xv(6w4uQ
z&|7bUz9jMzD{|UcNHms~a#iy^qZq~Z(!?R+wTR6v6J@{Y!!6y5Pxv>T-H)m`)$!OR
zT;1B_pSC8{CoeQ<6B51yGHGPOIGugmbez9NdQ{@N=0&q8^Kps8Vq8vvaQ(Tomf;Uj
z<nN-zfRKEV5CZ!#aY^3`*OCR~_msyjl^cas)JA`ug288sOR67?6oQ6V!uRC(w6;)s
zg9jB3-dGH?uX-qfNIi^98(%%0DQq30<kz_5M%MiKk>qaCe$$<1oPI8K*mU2XZP(p|
zX|l8g6SZY$n5xd->(?1Sf(>)LDTSvF9*~c7?>ohUg4%b2N{vx!T6cx+W`Sl6e0vx+
z<Q8`RKT9&g%v6lo`uA-1Z2@muD+4y;j(tXgtrqx^sV_0D>Ke`IzDqj2AO-}(cdUoP
zFxgp6F-lg>#{Hi;tY(ok$C<gG%2F@h@#c=_Gddr3n;qwu{kGwnvdfUAolhrJF+uYx
zsvv_An|byf@M991)9sWb`mx}FXIox-8Vnx|R369<-+&<KKm6`@^VEQm>)DZPwWW7$
zB3Cx{-bQjWm>=i+z?=lSmerrNFKH-_?+%;Rc}1iq#i`;Q%~V5c81`G-T80WqQ38pO
z1A+f99stBlWUpr#Ewj|}>d7pmdyu`HC@b=pF>>k8V=;>!s%Ll-?{meP@>kd2)HuS3
z-4%LK;T=s4@x<?MRr92#g0jX&25d=?`)T+CD5AgORuRk|I5u>cj91(hCo0`au+g4s
zoUXbp9P%?5RkT+q>Ra00)oJsE#KgfVDtox&meB}!f8{d<o#zu><(y`1zc-;tAoZXZ
z73vXu)uxadEml>#u`^)VaYvQ#wE4r-Q$pyfwm`2Z^HY~ircx~|VV4+<gk~Y3e!DhX
z@KWRFfV=vzF*#_YLQZP^BEkGdQhS#&l<}xB)!<r;fk<whur!H>Z?8>*7;hquWc5iE
zn@xe&en}?pBwwq=ADbdyp@gG9qm}h`f%b>`P$uZqzSMMHnNI-M*^$8Db?TT%yGa2%
z@Ic)G_>VJyE(@-kq&f=}cJ1RSm&I-o{SYPGhS}KbZwh`F1)dzl4qe7Bzw@u?QD401
zMBK<~QP=T<zgm+?>Pbeup~iO3aGmbpsS=2sMF-z5*4XZY=-?DT9XAVRY!#7p!&f58
z5J0=2_0QBV>$6))LHa{(ze)8JbL3EANdF;-&srxrCzlk&*$c)bK%tkY5xRu93p2{F
zw64M(R$3%Hkh~xN`9^VQ5BcEO-OBiQ#X3ow9pH|Rl_s0f6>d@daM7^zu+<WdMzgsU
zieGfIyccvAROqb8X6`}$I$n^#&pdyR-1z-Isc9mrxOl<s;;Iy2i7c@Nbdu1r1@o~}
z^gjYuPH4bjc>}UJNdi!kT`-H0Z!eX1(x{&asM?N{bcS?>1%U{Gtw4oq^C$I(|3S8R
zccW*`%mIz^$$U`f8d?wOiEC|m%3+q85Gwdm*lrU+HXON9o97X~rW+2H7QnhR%sBu2
z;DmqjQi~X4D%Awsq#ADI%e&-Jzg4N-?fiU3gd^RnUf8GqLt{ke-?8wfdkv}Js+MY~
z-S*svAD#i_#ZNA}(f!_Li^l29V4+oVa*es>-7Awiho_*P=kh&`>Xg`;5Umc`^<&MO
z1+*_@WWEymv#f+x9!E0zImFSTr4h$aCl;5fu_4#5p%L#~n8HmK)B(_pSWiBTqSvHm
z412CN-kk~3a5uT}h`GTlm1!!cd-*IE$XUH^pBWaCAcY{3BeC^?8yCbTG(w0Dw)W9$
zldJv;;fWQG5#(b+%jK2X7~a`G5;{9I;9v1lxvKVIls@morO~W{vlF-wlN8%7;)?o5
zD~+ImbSb=kZt9AhhrO*C_DP5lVr{)b@=hs=ij8zA5H(NN)Vpv_&|r(%zs%jitZLPW
zHa-@DoN62JmH&m4CDvh7C<jf@9Q-zK;mz}sX7r|@SJ03O;kqNCa!6nMm%B(psNujR
zZUiVT%ue7Ok_~IJbFuGimf_TA&W6dYeDbjS#3t$xP$4&GN;p6{ka{Ew-<4;^CjII3
zVcMKQ^iW6t58+h6FZ{Bek|lA(JmC@?x1U+fBsORY3_Mzt1Yi?&cE0gES64U=NRr1&
zyWJ+VnSF%^V3^IOW~0(3meh~9C@{p`k9W=c#4ZbrA8uHQC=7x0O!i{@z&UQ#w<AZ@
z3Zr{|^+l1m7h&&|epCkB<C?C%9rZ<R&i6yR_J;l~>X+CYMKE5i@(L9N&-WWTf8^yD
zoSx0Gz}4EBnO}Yd_JcqhDfX`IP=V)^lH(P)q?z{=s#sRw(bGCo7*df*C0vP!YMOr@
zZw0;H896Rm^91q9qJB>%7R*CWs?+0f`;0^T3z-4&Ns}W8zrQ*?jv?4uh5QD`CqK-|
zLSz2J9<5GCAT)>yJuxBmE6r7ZFh<ebLn4W#hiA4bo!B{#4g%^oR5-~I8`Z6a)GjJ(
zFjIYf>Yz@7Mmm$*iTic#M!uk$h*>5^kIOqb=i36_`yqhCuW=tYLJm#Lgwm)wL6P#6
z^SDNbNloZpZpJ{3p-8zw!QnL%N><9ST7H9ffdO>dnTg&}`$v#c!+=hWJcZ@2h6u@X
z>~|E*e5EYr^%q#jGST1H=qd{Exb}@kHQu<(%WaCM$k7qE`ncXwhB3lD(&C>-4I)cO
zAQ$WPs&I6y(?B=9O@DP$yg2)+?8@e}htw8TlTt{aX8S<ZV~cfkNg}?LV1wVs{l*4c
z&sH^u;$_;X2iC2`!h$JMqp;R54VfMqoKGs+_O+-Q@A^vG!xZ?NoQi+j9!NXLHmXC_
z5S>5w+(Esv`9}IbEnz}f2$*clDt-=AwY|_%4eff7|FP)OFVo{#=ojcz=Y=6I@3-#K
zKi+EcTozZlu~YpelT_#=OO&0kIjLA2M)(f_*PHSKr9~!x*qpO|ymriOfbAFO=T3zh
zAzKA+dWb40#$ojAVA1dBF<_Mu%=&Zk!Xm7txOdK+AH$lI@6}VB_ppOJmMhGQ4y+5C
z7#e!Ot<*o7Pkb)0yH}l&!m0b8bEg7_%@?fBST;md(ZR%{U`2^@24aF9V%f?<k(GcB
zANJ~6*0om(tQnIVPeNr24K{i~lHImln5dY%yO6Iw^U-<7ZENg#;g4v(?2?aQA<2AC
zxX-3pFx7wmv#y0Sf{ctGJVG-r^{e`vO<V%)US@&A@znG189-T}w6~VIQGZq^BH30#
zw7fMW!cG=tXNBX%p0m9YD}x#Ni4O1U=4y@Ex+ylYDRE_LDIQTO!=Uhow(FHuvEoU3
z?=lZ)s^H$lJ@2Y_Xe1xL%7u<W|ICJ;<{o8sDNEBu+lE2ts?wc=WgIr@z!3DHTRElP
zLKYZfWfFhI)#7zAxlCzSvfT@Ucz%qMi=?p{xQD*6`uV0w8#~Ux-S~fzE0)!9nd@KH
z6ahsU<dq`BY~?TLgF^*OkAoEKD$h*8zHDGcJyi~s;p2pizbia%lZr}pxuBzn<A84i
zUBxvyB5`q9i7bj4;5YjOc!I79H{HsdYyLlkF<*%$Zx{Vl-6={-YDHS_fk`KhJySwF
z)8vx9H4_9!?&zxW6KkgT)_Z<%MsC9DD*Vp}new2xy`A}VnYVUgXEqxUqc$)P$^VHM
zfK@rQyk}WqddTsM$C^Q+{U1K(gTzy{l5l-nMn(#-XJy+d!m}2WO@xP$b!Y#q>F2!6
z)cq$IUCmi+q@MkNSwQGb8-59-27})Flsv0Bh7{lV>`B*dZf1TCyWavfc)3viI(^NG
z!YfC8(>}XpWzh8ROgY6J#L@hhUNPEswzMK-E7@Hm$;~%>5YK(lIc52aAzf*P!LVV=
zKGajAdC8^CF?D|AmlpDlX6X8{)KGgn6eqOGIl4wy**Q8tLKnR<!Y;y44cxD%N>#@U
z(MC+D5mkSJO_DU?Ikst$3TJQ3ZVF0&ur<|=jWV3R>EIV#Ow*7r3Plt~Za8yuDFfJR
z^gk8GoJ4;ax$U*gR)9BQjb51KX*UW($|DW<7j;%8x1{A((IxY?J-!G%6$jB+a59HI
zS0}fy+EpExWs%P9)e$SmYa)w2k@k-yD{`Bcl8}*+7xzLp8$)9Tr`bf5;f@fgZ!);$
zudJs-6jIoLvP68wGb>4127T3a$8iFrM2LTwC9rKHkhF;N)PbF>aK``S4!9tr^8>eW
z{j66D@*e_8ffw~)kGrjr0tEGp><RmTmG6cAulyh7{sG@brwI8<w*WR<ZmphCGVU!S
zM7DGJ5LoQ+#426*RLaP@Kuv?9wTFSbY*W_2d+55WnnKmRn}9_-6_y<UztZBnJ!dYu
z@^~9wbrqJcvZc#X(#dJVe(Y>p^X>rsn2+<fd-56~>O;9{=wXhzt}a<d7!W#78tOFn
zqeU`do@`E_eH~AE&OMGgHh!VB;vh!r)5=od>@F3EQ4iv&$YK$qZSBLTdapHo<0Hb>
zLO;_S2eNStk-ldeU0%@Iu8%6CkCF?tc1uVNZ`s6S<DGw5^i|0So~`dfdT}zh^J{E$
zTjuxW58e86@u$JhXyNF&73U`lTzdSU$lYGAnn@;Jl`(8AVNL*4^c%9)m(X+KN#P&s
zALwcclD|jg><kv~ELn@V?~Tu@j{mFtC+`2_&piR*uGiO~#ujI?B{(`=@8RwTPv46?
zfqL_tWdu1HR^f3M5cHiHwXsuxG6oPYO?ElmD)R~i*4Ian30ZeQp*pAUpD;|8o@xOi
zb+fywarEuUiJ3!WqWuHjtV;qNz;Z?rMQjUmT5#<KMP;S<k-+Z4qjlwWlofwxY)$=4
zLPLFQT+a7jxS3LHjmA|x0YQ2$L@%|%0^XI`TEmZPuE+y)SA#9SsY^REnuZtT3#Ab&
zPeo-6<-N>5<IOr6Tskqcgxpp8Bc-<d$)^8V+5CB1Y!+xXuk!?b`b-9ZA#Ek-@?Ufh
zAHxEytn1}MHSses;z>dvB5ZeL#3@yMXXTWM3NBc^1COc+O2GSg{N97hQ>uvhw#^BL
z@Hg>>KgqDX!rH*Y7}0Pkl=ulk-I`)63Nn*M0oZNOK}A;^7;q(b_s6KD5Uc;R=2U(i
zzAa+D7w1jVl>RQ~z+%oH5|;N|8mcV^F9q_)_gziiU~8O_S$S9qbY#$<d`UO57qgkT
znd3qGVDWV6Q!o{&y|!*0qPAqcR}pDG*YxT3Kp5v@K{N{Z<ZnwXqA#SI$=BMo%$CP!
zWir!xSYxm9SS6Btp`}tObWFh2&TBktOhC4Nnmp!0VS7l9uv=)cPQ@Y>;mJ$;@iaOI
za9Hrfng`Q#8`RwtBtO}&gtEmoMhlN$OS;sYwSM(FVQP1a+*IhR$bC%=RF)HmL=nB4
zscZ)@q9XqeHGw~o-_CxmmZEYheb>JmVHcfEJcR7v=K4D(EowJb*1*8`K{8{q7JwCl
zYF1K27kfh0%1{U@agGwPq=)N#Fi~B{854OCPYwBx(pk308?>$`WLYYQdp-1O8;~A}
zL*G8=MsEENvFiNykJjUQXNiu=RS-J~QbsCbRvPC(&3lanc`{rQ$~>~Rlvp#<#G`Ty
z0EeIIJ)R_<f<?xa$0h&wHf1#6cW^^f4s$+`n%!S3*dC&;Qx$!gr{iUt;UFk>)B5cX
z!Fd?Owg5(B!rG08Bt&b0AVCCeu4UWMDeF7G=7bSk6zG*`E~59Se*Rbjcg9{aM7KrQ
zcB{&~%(2;obg4!IsiHSn(qb1*!|P||bS}u|a(QJ0C~h|fs~MyXRrJz3;Gxg--aWEm
zUeZ~ZF}H$5=N#Yrv+)7d*>2t+iQ+^`D095ippL9vc|DD<-4FrvwPnHHR*$|DfmN8y
z(w{|ax)!i<gm6)XOtWqh+8`!vP<$!}*?G+jh_c{W`??k<rzH*lefD{YeKkwcj_ZXL
z;!<yApNCar3an{}7GnB%vax*%35yMFvU9q@y@mPBWA~ppS9~ff%eUvb;b;D|N!fnd
zLae1KqxO@Y>VGykkXyWt&mSx*nZNd1v0mn#(KJ!Asunz=@QU31I))>+2rmLO?|<z6
zCOZ8$1TEoEO6KNsMkRWwc^3K?y}zPys5bHYvr4b(=-GN}|IU-wZ{Ukh77c1_eoSS`
zTpD-)fFQ(5X(?d7bqyRjj=OMP?9Ts~#l)1=^PB6_`~B!@Z!^5%nm95ouRD>P#9KQf
z;du>#%-Emjb+40eX+<Tu*qHC+J@35!_1)l(n5KXI!U}qjC#5`_wVs<yfz8L|qAAne
zoF!*AdY|jY&VQR_F2+nu8OXVTgn6$!iKeB6g-JXJC6>K6+N(X*u1ZNmp90gASKI;7
zk#5PR09UhaXOtrMf_JsC2b`+PB4P7_sg(GR*|>bdysdSI>E<TYb*mCc57unjl;j?_
zOukA9q4CzPD%+tcY}nsb*#pA5di&qtZ2thw<HBMF?Myec5?=VRA5ojDuyP5L*PsNj
zBw^w_x4l8ByfDQpuk?YXGJvn?J<oII)_$SUGHDPxseC&XLUl>+zF)R*1OIL8B3)6D
z`2{Xjl#sxQB&_GiGhdh%qePon@L)<PQKi^tHf)wR!w*8U(1d@ds2FNe>V+UawkxhF
zf1ax(q_<j5{^)ppW3y5#tEgscY#+wJ^?I)$9Xi(_Nu#sp5E9$BSc1^p6N~3WKdGUi
z5}EPYn)v-F5PDEQpLv28x~SC5*<aduDQShdumN-Gl^E&m2v(Y;9Y_Q42Ljk|T4PR<
zzJFRfnswGlLw~<Q7YO||Q)OS-A0)jfq7iZd9lEiYb;sHM?&jVpN3Kzm_wizO3B;=`
z`O2<oG50sIKE~QLkiRRnUV-p^d5Ez>)uPBbf?mHlGl?P#G;GCH=!?k|czhq!RfROe
zE#j-l>=MIc%77}m8nM%>(5S;c5}aoh@U7ay$rBx-hbD|7)bx#T9eLKOrG9Gt%bohw
zfjIG~J*$8uLh<J7P``zdXZFV4X<!Zm(D77(6=tvmVvLH`^-~#}VZn742%We%40EUb
z@(_DkaI!X(CM>~ETW#v(s?&D_;6YF9yl~L3DE>Vg@5WqNkF2?EnGgaGJxP+0Yj}Q<
z+$f<cowgE(9ZVvA%4f3y*N}>p5jh6xatl`zhLaO=44mv^IF;|m#j%tGPJgj}kSQtw
zl}2#b=)u^K5&pg<{Tdjd!7#oPS>m^4z?~WBbI5oQlL*kvzTfn*G`XBaw0TspPRR}v
zIOynJSiV=%nuf`yln!0xshZHy>GONj%jBZ_7qiTTe<8LYmMhX@;OxY4*WTr=(~=BV
zmmqtGc&mW5y5SE+Xr!b@$R11iGPW!@JfPq^m82cL!K;}NfX$=GVLY#%QBryp!xC|n
zXiAE$?qC6N^!t6WqCow1WkWQ>{^XOTr@=tNpN2oS71jVnMNDDQk@QbnR4mmhDgRdv
z7Qy1&prN!V?H&*J&~c7nbKmf>_MuKeCd%+pUao8}b3s5lt)YM358{8U9@cZF*Lw>W
zucQSuIa?Tk)_xLCA(Ix_Sw7-7oAUg=KF`blA+&OcC@8G0`It3gdFD>M-_mDye5Y)a
zae>m~<&$zJ)*r2@$`fB#XD0uYI}0YWE&WGIh1uyVlFVJZw@eKe^Lr;(9OXhr8G!KI
zA&c~b&J60*4VeQwXa&*z`1nO+Np@3H;NhqB5~b%d<OK3he*FH9%_*)}mEUJ0PK^4m
z8c)1kQ6^mm_(%vd5l>8yDTEAiAS3|#IB!U2rt=`&hXR>x)H2+dj&%g_f(cDmn!FsC
zKQxy7^3wAL(OET8X7}~(vfnr9A68bC#Mus$e4^MhMsJ=Ep1&8eY{IsRmV82*xGOZ&
z|EW1HT#To1bo`-RuN^i~b!=iGT<H2~>C6<N<>arjj|y1#6GB=bx3H^&LUZwy^T(E0
zBvZbX;*&Nl-*a!f_%u!BMgS{Q1b9V~;(C<^;FZ1T`c|rrwDfT$PTeOIWr-5^R=$gp
zbCukWP=yLp?FoS)QgP%ix$PP~r}pE*LT6iZ4$&PTxr~@;j*TD>^U7Ch$3CWcscD4=
zy;5Ik@5&mVbqoc9pe_+QDS+JPewya0s2tJYRZ;BgK;%s!Z?j`gsGIyl(xmTrN&#5Z
zk+WVADY8tuF*FXqKn-Rq&X8LA2#HGVSw|<%4yTn=FRQ@e&y4GZ17qN`Quyhlr(8D-
zcI8FXa-{Tdpio5DKtMJ=ZmrZra_r%S=Ae5uhM688(ipq5onn?fl7epqL}sAx$Op^r
zvo=(gSlFc|$Bg^Z4cWMint>p>PK)=_i4fhkh^QgmJnyQY2~f1GR6y-=#u{2GX$VzL
z$&1x-m^4_6$iC5^{x-O~|7EM9#3!}iGVljY*Al<__u0Wll@Stnz5YR`Su;@sx_S0~
zQl;_3K;`}wopEHT<MmqqxO=hcD%5)LDCJi8*L7%@)zC7;(9Yn_GFX+0xGDN$UNo%O
z1P*A9zO3gw_fC#=$D&MWaG+UXP0BmFmz5okNiV;=H7BZn2ymO5C<eJ<E`KlR?(|w6
zBuwy)ahq%5!}PpW9r_Hn0F4C`J$2#G?N{ohwxzMeUFFes1&^xq807~^?<bT4u)NOm
z7}U!i!MY8(y!E)5t*%t`p6AwYrRT-}z|nuTwveSs*`dXusx0*@OX%gs8^PvTa2mKD
zWvoKHPO3l#5bEzA1=ogLnhb}J)50Md_S+8EDFT0t4a|@~ISsqCgJn>8Zb8Cewd5^L
zc)>N)FT<ZPI?Jd?c%|&eqjEdqoul~0*3|g$PP(BAZxnE6A+~eA`-=#vK-(Xrqgnri
z-a3dq_J@*w8-TU3rJBm6a2iF?#&hvYNo!L0um9WT<o`JW5urMikw<#)6O@|ioxG!$
zLE>k*u~}C1ss4lWp`IA!{ZI`ruej>u8>AYsLAJhYxq$cgDlLaRn<Ack^CfZa1r|Dk
zIar&QzN=SspY3(F!zp#Rj8V?+Wvz3P)`AZ`cQktQcldZl`)krhZIua7?fbwxi9}EL
zW@f2cKtXYl@15vGZ15#5JGOj`BnqIU%*)t#Ipfv{2pDGKjC4F3R@ri)@-NL$eZ2p>
z`%fdjup75v_=~Q#^cOFzMu?j$+O{laqVp(BG5Op-`mhaHY5__lp%~)rjx@9HPx$x9
zp4Z1cGp``f#8x{x{OG%}74O|0dDwSyR>*4OK8@10!DgRPL|tSHXlKSb!=Z8S2s6!@
z>&2LQwY(9>d0XhzJ?U&#%*Y|<CuP=i<q=MYLcKcLvrTsV3;$}=w>t_TwQ9776*xdX
zwr43AF<47k<ecVe>@J<oCDIJ2@~kTd-70j;B#mkd{mGtgR^ihSa<GTBrI66Fi4xM5
z+bLKvM`|nx&93J}nJlCEgd0veRb<0Q6tFevjyd-|ZKZ@vT%#M23S{7#Sc8NU%kk!g
z_${5(s<_M@V0BvK634I{{ESXLPu;uGj8&Ol0$KA4aFf$dKlP#gjnh&nd@4$pL}-s3
zkXm{P=}02Af9%+qsps(9dRGsA@8>7<*v!1c$_69KeMg_|Pv8>R2HFfuq%DIDo4auC
zMDwz8o0mc$x;bl+_#ll<edKmIh86`&(!RLcSz(-{RejAJT9r6jzAHI%o?RBXoj{_P
z{C*@%%iJr3&O>J>`zT4@^+B)6S>YsuW*1C~`KpDw-?R##an$0ha-xq$nQP8=>vYjw
zY$TRXvi$j^3(TCjTcnFpsC35*$C9_PGYOX!JNmWAj?JV(<o(@st=AI=Pu*1VQjk=C
zp`y`>pRN5clEkK*X>^X$WTGN{p5}5_Rk#e%)fi&;Rp0!TuFL(ych@SRD!Z<;!UqG%
zW6cCpUNwVZDjVUf*!E{SPbp*xGxu#fX2ZiCxNb7T0&ZMrwk%Vmiv5}Wh?3=`ynLV7
z+UCY`xpIU~+ysbc)y~|jfT|n1s1#L1C{sI}tkG<{dIL&n9AN&4R<i(woe5Sn%eYj$
zqf8xxf{2)ZkGC557OOwQK3M!Bf=U>s{n{3jH-*<OYS^t|{fG68@jg#SueShi=6a#H
zQ)GZ@WWQ06OODuS4j%~l2hZwH*qhLQ2<}#0hc^BCWsWc)@0@uIkK=(f2X5b!KsHj5
zLOad4bYyE9p#l9RXupuVS4{siAmVj$tZ4c?waT@2zint#Bw-MpoHm|1#!PxVo{F#@
zC}vfkUp$r2n^5QYK#qWZ@fLYbC~ieV*jylZBOC9F-h%t2yPWZF?1yDeGCXH2jQ4K}
zIBFQt9FCja{#B-HT<}N6+&@Wh(f==2C*p2*WHwxVB0E2+2>Q7+vniwR$-V0|@?*Z@
z(UMZ-VPQk4=hW>-1#u4ugG&f&(X>wbQyia0CufLdQ)Zy(M^(B*Blz@|+~1;J&Cd@X
zOgRM8joFBAf<H<z5sPN*cj)$jm=`sMwyxuG-i7lmlR4Jg(o#nUkh&lF8~%szIk{b*
zCB_=Dg_PYAfjm1REli+}2+5t60(}?=)Q~x$^R>wDu|ReCorFRI=YNpHc(3A!4juKA
z^19NT4xg_NsUJ6<?(2{1(daoPOnl=&EtZ(j<o)Z>Pgqnz9R@_P+@`pweM|2t$5`;)
zwuKNrbk&GeCJlmfGRFmL=zf9?l{_jvx4Eq-egD8kSKFrd@7n`;jF!-3OtFGxr4Esn
za!AQF=QaC9g#-PvcpIDKtHENfC;CiZmACQ$DJ8ubc`XCD`Kay(hv_5sqFYc`i~(it
z0rjMf?Dzxm1|Wad9I2|bhUFaJ>*5tvpB(=?YpL&34V%wa!kXH%58A2J+q;4+eHYsK
zscK6bH`{fmCs}BT?4B;Oy$UBbIaJF!HL@zt85<tPGwrO|8%xDxeR2)QWUxLV0oyOD
z_{cgegbx}`#Yg2`EB&Q-5OsrMP2diz$&90xVpyw^(izvr+{@3o!~tS$LYD~|BG?Af
z%Gi0ly_w+?9mRv3`+A_Ez01^DpsLZwW#A_W8dXvc{SJ6gvW3WiTH#pN%<>nFRAock
zd49qMe36p0H3`4Y5vn>bO;9zN!sJ2)7%g>Itc=ZkK4p^FGIPUquac+=x0OF^w!9wL
z8zDU4B$Ijw!!Ma~etFl)Q?^UE8X1f{J4I<+YhBlhl7R2TjLMJFXzr_j`>h|)b;$Gl
z<%Ra$RtNIPs@|r8hi<QJ36Qg7_df()v6C*%K<j+k3^zdao=}ZUeMs!wKAvM0sC`jp
zTwt?OsxB0dg&q8k7fAv>ab_CwmHDd29-kLwx{=gZIB8P-vz_$RZ)=p?%ZkMY;ZFC!
z8GFL|UI)W&x(1>Jo0UTm`Q{eQ`7OdhU7Q=>fa^#AJeWE^N*f%PPOR_-Pa6Kwk->0Y
z`>fcgOc#C8{|l|{M`G6Z-=C({8;V@b%yQre!m-ss)NP*s5crR^QwK^XZqPkQJ0=+j
zPWXv6HIc3&w<MZ+h}eX99Fy`Rew#|H=>E|CVh3)aMEAO5jJ%(${5Agl52A}M7iWDO
zDZD)u?F+>3`RvS%Jj*9GURx|dEUdAQOWc*m)1ihe(JqQqKtwDoeGjKM4_nambF`Sc
zJ2x$9V9Xvm)^mrp<F}t!7;5Yh*9Y{U-bAVI>GTks2ldI>sMONh8$Q|FJN(WfUQ`R^
z{-52R|LqRSP0rjP%;SYPnh|kGP~V?FwpE-%do?ZOAC-xAb^lGodZlDBJj~750rC4F
z{y=-HatMVlNv>jw?3V#=-tu1#D+}y#__@c24tua{o{gq}a~xv&%3=>RGEdlxKfVdK
z4RbZEY~Qb3#t&}|6+a0+8FdcPeEUF)QmY!x!&z;HR#(@qtuar+MmncTh39Hg+rJ;C
zjhygoaFO})!qz?B>Mz*-EPG=QY3pvDPf(WUmAFO~;};Au*(0VFReBMe_<guT2SlsP
zOC?(8UN3%%m0e&|A2TmC?+|DbUK;z<xD6Y>z5m^S%DY<(ZF)2kbYUuq&a9S;wkYK%
zwrisPatgvlR>#VhdaD(S79#2}j4F_WeQGCl)uYaHRxz0{Z<Zp_BPWYxbrw@JvExc2
za_5mDMy3(N^-KKw=|W~AC<fl<WVqKhebh*|kV$jH5<~qLULg^<Q`V+$M&IU=M3QJq
z!e?}6?2xY-H4HNT!#wpni(Efn8K~Kw8do^`9|AOGY;{Xj!`%CdbfYw4Tl2euNwSDf
zob4_f-V_lni?Ed5l3=@;bNxnz@X|kvOc%^vpnYi+;wX7m3^cHf^irWj#Av(Z6E|T)
z;-F)g)Or)*qGWP?)1hbV#@LKw@ECi9@b`RGMiw=mbqi_9o1j?^Jw1Er#3aC&4?~JD
zfoP{x=={u_B3sMYriIZt6BkcH&y#gr99J^LO-1};GB}ZU(}#&%T77btVO#@?*|4sG
ztG#5(1~uV>#4bt^pxIfG#v`GBq>`9y{HfZ+K&ryzE7g@@8M1%n^x7-Y5)D~=WI}T*
z-IlbbC^I#&7{lFua}=X>gsXXyqAh6?IM0KLX$TPQBB5pKysyT_LsgmL(#>qo|K)?2
zqL+R*ufonunc|n&R;om=ch2r~@F{9iSI%gRwhaEUB&f=BgSGVgc;9a*Y1Fl^V}I8e
zmPRRrdp6?f@sWKDWd$4xZVY=GpE^M2#?ut_HgIn!Kf7WNx~N+b=Un8JR}_Gk-(Py&
zYVhU<_u_v(8QH}k-ndhP$aC|30OWY{SRX9>(Qb}UST%FBa?x{hQ!2Lch|Ab~x#*T0
zVaTAH6A;5C|IjYFf3<k)ALLl|umn{5W>NNw?}gvRH@K(vf>l|1uh1qkJboy^0uq~&
zza~`1Xd{Qm|C^zol9G3iCQ5!ojugK#$|1S<ic4kpA=|-iW(=krqQ|E0{C3(|T~IPM
z{}{iJlA(5yd78tTSR(bJ<0_1jOM~dmPiIjwp-nV!$HbL6YGEebq9~AfL}B%9Q@r7c
z(&AkF`ZSeP!52t`QI@F1Czl6{eP=-ID#~~FLlFVdm<34|#jK#G?h#g)sSHp}w^pTZ
zE&3ou^naPW`@cbR69<pqGyGhb-5iqf!e+qK^ZS6dK;5tkreyBtltD98i~zPU?t#qW
zjA*1jY<EesaE!^wt({#M*LQ$IAWB*yD(}~rk`ncue__5!JO!tQ;OC;3*w@3ZlWa)t
zsa^CzHKM{XPp-VV>l=g0syOeZ<^sN~u$i{G>EsZzVAT0F%FgyXt$MGqXs?Hu+jXK^
zG`^d9r#s-ykelFC5eHwLcCPMkn&yQ*BVV$d;dp*Lb=I?pxfcI6Z1d$UwP|AZ(Vas4
zx$WP-igfqb+Fd=iT;ik%M~}bmJcpn4uHb{`=n7#`QJ(Kl4<9p^AtMxbNp8GYVIHxH
zDm!MzA4f_F=D1wgK5aWp>T2WbQzbx#-XziC6Fb7NNK@L`a?*DN92t<yk31x9D$VB?
z$kS2>IG#A3Lr4U7J?cmJoYmvzWSt_I_EBcjjSPQfu26_9S~Zn3j0}ONkPGw_TF#e}
z4m*G{$0{bfR$@jr_LXb^K9@}VM0SkWNlN8Dzqw%^!+l3A07dlYFBoYH2>2L3r7PvT
z@rtW%?42spG`*)G82N>Uc#Mlb*EOf@azsB}qkd+~Q(kn0A$ko|WVYMf*(QPXg8H}*
z@s`>azcnUWD|o(YX`>4XjNFPtTRyJnozF>IQAWFGG$ds$ab5DEjr>t6!{a*#%N=)Q
zZ!9M}IL9uNta<-D|Fl9XI_Y(muj{iq2Al9s>ASSivCGTyqF^5>pLpThP%z5et-k-2
zC{;e2dQk>MQKC;yC6cN?WF23dUnr_LvNL0eopg;0XY300QqU?fV`)Y0gCSMP$vl^>
z6f)`!=J%BItS)O<Fey)h;i#5*xJ|2|InX|k;vIWsy?}yk6~K8XD@%}_n8KhHnrEE!
z>#3;1#MSZ!9i8<|Km$o7YG~L&;THlX!LF4zGs#mHl8_j?^jBi{ulNq-#A49ONW`M-
zu+y&+2rDcbMo=LIJHbtcOdZF#_(;Yax|C@uTP;5sYBFtmE%5Ikn(u}z55!~BW8xYe
zlHh**c0P2=w&`f2*xFQLWoo)9AvZ)LGywjcmdq@fgYjy?SYu&TeEK6(`A^jFUuez?
z$wdQRvMA-uU-ww|dd-!tKA}0rb3~e{qO*M<z4A&FWJGo@n$Opr?fdJ5+nWNloIxBl
zYZuj~_l|(KL6Z`5{K`SpaV@X-=@djD5xvCB9f;)s`@-5kN!kkoRQ+0~SFTdtx2Di1
ziMTl83F#Vk`;gPKXZp!~`nTl`y`}p6YQ$>zgg0ZPQ=Dv$|Lt4;|GMzrT$Q2gEi~B^
z_MbA6$`N}`lr!S}yeSPfT14MTz<vYWyWFyK_MAV3M>}J+8ss=V_;g1LZ^OeA!~IMu
zlxoMD=Y@QMcl%u$pK`r=OdLBE+t|7FrR?arhD`!~mN-A{7yXh|pF^AxD9X5MbQ(WP
zIc8$Y&{Z<4D#5dWJ3Qm=y3T=&`VOfvu|#dFYd_Pi?VXUrDjwq~>5Db^mF8M+5EX;K
zKQ9Ctd-m}Omj#9lNgl|{$e=|`<wvE-59h43$6l15n{4$xEXjx_BvW`m53yKw>1-dm
zQL@R-M*3cB$>Ji@>O|c22-C5yiag;EXwVBmgx%^+LUAoAj#P=QPpE@k)6Y<4%*#hN
z5&aid8<O-NQ9s>o$LxpjmxDX+V@<y84ky%;eRSdgI}$auano8_b>BGTJ3UlP_z}#s
z9o*=H>Vda=%c^@@&GO!c=_d_Pb-i_+VDI9nL-%jHshh<1)gC(xerl(QlPD2nOQiil
zZUpI-B6?!By&9XW&m})g<WQXxGHMg{57#9G8BC}7+wn(^9Pr|(6mI<3fCDG4_|;_^
z?OA<HH$Fag&EZ{1Nh%=|RU>vsRpp*OXB_-8trEPd+;hHd-u?9L)n^v-x_Y0;R!c6!
z0yowVQ#hM$>Vd&}5JBNFZ-Zgbm?ya`VcPpl17^B_E}k@z4Q<8oR@$fJzhVqw8ms9w
zWJ?|Y{JxC%j?09<%-V1_{8^lNSdpP$)qSEPjpyQ}r0teHGV(t?9<^>`gk~WV6r#+j
zx1UoISaCet{m~dy<nC!QcNbzkVbkJLa}y%u<uf^4PLvSh)rB>1Av+y@Ujpgts5~<U
zBFuW6MVxtcTd%ddGgxm?Robly6rJqrq4E@i{f3|EL)N@P4b`wqJpr~YS~}ybC@P6M
z<)@IREM$Ebq2!`PWs82fZmvY%bNb7KR*|uHKDr?OF;-kmCk{s~2Q%<7`C$J5kr{;%
zdSOT4Ml%IWn8(iG>Vc-@F;x^_$CY~_Ejyk4v^sCV#s<sg+WIuNYl}JX$-awD+~Jr6
zC-U(_nD{uZ4J9*5>e3PZ{p3_0yr0Z$?UB~lOnIm_jy7X>%@dzbr~N&`!%>Ga;oPpe
zH0a`uCFwxpQS~D62?84%ukbrXYp!9-%~&yM59=x{3=-E&)1>u==(9MHo-VVdq=_Zj
z82V;!IC@f*nFrpWuxoyYs9coFylmPeHAY3wBti4{5nZalw?hUy7P%}nzy9nu)!P|S
zD2DY*{BC|F&1cOY1TpZ-TiRnVB%w@p8Hg$FFC@=vYDg<8_0!IEN&{pEb{!s=|8!ej
zd(~mQkH`2KOcgifUY#+lExeEj98vTOxSW&1Ne}v;a~l7LJ3zetoq=Pz;!K#=Y`;g&
zJNDS+1?8YUJd?H%MRSvf-^5Ml+unrte-FT}t1=!*Xk1b=oF6UIBzA7@Opd)=#L9Ui
zYg?Umyzln5hDZOk{)Z6%;+4+S^LeUGn6Q}O0&H(Dxvf2Y3_=|QxEc(2h$q)d%SNE;
z544}R)ym!m;2r&kU{zJ(jDbOMyyBuM{QAHj^btxd^nHi8rRe&DTmE7(G#Hh2SvKyq
z)QCUT*L~QGkESG-_OIZ?g&^&?z2TADBu@z=HzH_&rNEB|Ma%=|4e{eE=l)Ecum|4!
zu{P=bNY7zr)46)k;m2}Q`U!75Z0`IQKXpwS<-b(cld8OuAW%o_SQX)n*4X5?MJFPr
zo_x08v(jOMjwq~Rc1;y?6EMoAfU8nq2@Pnq=$T>hjOHUMDlx~IpSwX~D)AM*(~Pe8
z52^cr!J$5~E$>pLz0x1hg2dlZphtDD$L8HBis<;!9AOc?v{~-pz8z0XE17KnO0i00
zc*!k=)Wuc1AW`dmQo8=6#e$r<`_u+fX!9aB39cGv>5Y;6K93&G;5+|whi>k2&5nxd
zxd&x-&~=cDH_d^*FUW&he`9{%=B8Vfs`Efo_EjXPRH;<cP!n8H>e@Ws<E9}JKBRND
zQfb-lnTXT#1WSp%6G8f;LqV+aFfj^9PX({z*1juZi;cmw9z#W`3{}PCu3*TKX`ml=
z*>xkWsU^JM-`KHz{j4Vg)q!n(n|1a3fKIi@1BRxsm=RSE*#Zb~M#=HXoj=t3wdJnT
zkBrkf`FtQ=&^0>zQB=HV8THweOTOH{|Ccs@XHl{uG7JzlZBh>`ykwGq7gB^n3|O?n
z9}VJ&ruvWEF&`I)R=fAyRlFSx;?t4aJt}45T1bYpIt`qK2$COJVl%n3&>b4xnMU%>
zNjY0Y9?Nu^s`1V@71CbDlsqh9lK*bL5f1QcBQAp6!w0bGQW{t?wmz1<D>h<4;pF%5
z7H9VIzST+5$(Gh!_f7bx^{*I@Z)sACSykC1WK;f0|2ZX8H%dd(u*P4@U+Y-BB2<(m
zg{_esfJ!`ay%Y~wFYM=t`Y}*Z73CR6d>yaC?4NPpSJYo|mTgV#nh7S(CKc7%&>>_+
z{(1`Anrw@)-a5@GzrdnYru0;~e!xVq!-Uiw4nZD>KWyH5wXL#4ZCtTO&ewFSt!H=(
zda#0+?s<o%5UL(_8#`cTfTIe-MNRc=3o5r+%8y(7<I>j%Y?LOiqh>UE4jH8*Fd!lG
zp@*4g0C$uJlfa6MN!H(0p24@oC#&POl$y1p5xP?fgY$xWbe+C&n}W$QOt(^MtV5ZR
zN9=tTBvJgB{Bp3~&bv4}I497w+L2NX22M+w8rcKOH*j|}9T!OFT$aH5tS03&uW3F-
zb{TY{keifCzz@y9SfzHD$>sl|?5v{N;MR3bi<MH`9f}nTP$0M$*Wxb4T?3>@Dee;7
z-QC^Yi#tVwyX$|l&$&8hthM$&ml?UrMdp~_H{bVpnvPT!RNN}7mspsQk(0=W7}$mt
zRryc$eKaEVyy0ktjJbX(fnVrOT1rcKUR8zPzt@)kaKF2KPRU8;m9zx8!R36gL%>z5
z2@-{eC!8MkDG3+}p!)D1(q;eR)PmKugoWM4kg86mtjdalG9|aJWlf{x1Ny}qMm;QL
z$U|-E8vSa`vFM$?aJy>PJ03o>PSYTBHgsc3ga~NH4GIUnrVeD9+hOLGtjS3|{Jb7J
z%YsZOP6|d7yi`4S38a8mbaH4EqJX<0w#eiK`qaOOxqnX!Opg2@v>Y93Y@~}uUHRHI
zhjS<Nn+g`iw$5YiE%b{mf@KN~i^#ZYmGJGoH8UPbCeMw7QAw^pgqtw{KeF3u9Hcz4
zD}6ti*>ifK&w7?MZ)iH(BSnjjg#nK6_YvFYW2DbcW+wW5NTP+_(FRYv5(eo$D8Asp
zmHz{mYfZ#);C<ez_0z76NozVy86!1cdUz<bn}Ul#qb9YU0PCPClJ_1%i_=g9n~SI1
zX}vn)Y`@#*_-kn+cxqdZ<EqKDI3el}k0GRJ#Ri%wvz{uIL{WR)obe%s$b_6V1YJ<$
zbly=lrGVx+lJE8)H1jp;a@#rcqg_Uyln{)Y!0AAJ&|yIBE1?Rus=!^{d(eMo<q#Bz
zkv%AksFggMDd@r=7)pB<8PjaXTkc8}`KZ$9C8_0EqVv^Yx7q<3myA5V@7Njsdl?8O
zmr(R5{rgDj#%<-&!$HdGoqkeowLIl$`E(ZNx|;@d5;%iFiuSEqw$+_B=cRnWPc|tR
zPj1+cS^PsiIJT^BJI~Bv5t1@y?M8#FTc+-BqiI&Dr-qd7k|k!QKgKOltH{xL8+KuP
z@@>4h5dZFG`axE+B2xP}W{HlS$;8GzL*H2}oFZz?0|7s$Sx?-l;xMFPvX+hzeU~8`
z$>RoZZnI4YrNRAI)vAC49NXTq17tsK+7OpZj5WYk@?w2^UCSrO)dA0nLUmcm01V0;
z=)?7N%|=c7%Lcs`Z9cPSaPYj<d`+GF_Lj>8&66gYmcumoj&C~_C)s}1X@u%~sOq=<
z_xn8lbz*-~pda#GdJrRN{HMV`RQi_e<!w)KDM3!s3LzS5ZEYs&ReglI%|3AE0rLw@
zZN8{Mw)<~A24A)#bnv+{;Ix-`4ctC`26M%S3{jV;6x*>NZ}m<-<-gg9|I9>rIx6}m
z&mNl<-o<*W1;W5$Yv_Ewr&-G^vuHFFt(AtZ#q8ra?+j>MQf-_a!16COT(OY`3Kb*5
zazY+Yksmt+yrp!RDHHy_dt@S!p?V;@(#6GnTmQZmx)pMr@F+F$(}N!?gg2*GM;X1p
zJuO-!btfX#!`!$|S}K6OeJ$Ob3|B-iiM)-~b)!#>WWOQ=%$DHl9bj&}vDh-Py&&OG
zLVr@=fI)A7)4Hn>NpIoASWP;NO7ysU5xwsHF$pfe@5HFk*zsX1^zYZo^m`|su3n_w
zgF2`~phvSO?lM<pxs$_7vqW$S|BIjPpDjYApu{M8MIr8oF{PAO9K7Zn@0}tV?(l~!
z+C<rm>FWfpIw5WN%wtGAts*SpHtCWMufs)i0$XrKv^pCX($<_94s7T_UbE)-Lw;<3
zHY%i=Ini%+xHa%8Zh3BQl_G(-U+a^<Gd?GK`jYiwR+F4DrB`=Zs*Y+DZ3?@y>xJs%
zAt)@5EF~)x#wOn}hu@|ihaICZY-eG9VjHGkR7OhyEFaJ_9_KLclMW-F_c<O}6T)GM
zl9<>hb_7<IsD2HgGWw4(miPZ&VL3H8QT@{ojM1!v%1w&yMnGfSgpIjKE}k_xj6rjm
zCOU$}wiMTJub<D`=g^GLkO~YQq9&VAQnwv2g5#8oG7D*qOV!$*DYKdjOggOf<bbF4
zxI}F$S^v7U(@caI6^ft6iQDgD4ivh0D$%JAE2VVBfcDj>6L?@i794GsbhaElm|Kg<
z5Fe^fR22xcSV1`O7QAxsVU5J@GC$5yeU8O|K;VB3+R`?kh>xVE-OZxi!=4Py)Oh0m
z)N?jeIV6P550ZFLyVL6)zTy*wv~0l12q5Fx9x@R-ZO5Na-y0usYN)BIY&)7JF%9+J
zW#}HYud6H78FC4VQp<fv7b-ASh@KpZMev>tN}^fUP&=`jShhBYkZ^WK3TOz|P8OeB
z1Qu*85|VDLb(K!~P(^MhpobCdgLmS3ky9v2-LmRFzur-E6#Uvn2j0S@M<YHtc3rEy
zH)fM8ez_>aF!Rv1&rdA?H%f`yS!8F~pL_X8Kc3_TNuZ5{pMg|OTeD$q{Wz-)jnU9{
z*6zG3kDMWs3AXh1j-6uY((c!0-&y1S3IU;v?iAvgL-a^EyYbQy$g0M@ZBbzTB`Q)l
z-eB#M&i!V+QSTZkW%(zX?2KO~p)^+gdyh+9PpxZ*UTX$D#@vX8rh5<n-NpkbPB%IC
zQj~;^P*!`Pr(H#*K<{K&LcwDmFY1ju_2Punn^MW4AwjDa*Q}g5?4&t(zfh2Eitp9v
zn%<0Pi#Z@a#%AsAv{u3=IstB7Z6iGH`w=H2aQlaiVDu=MJsVAW{Fg{(FTcR3ZQZ=@
zW7DVg^4HNQc*-o&0aHrMp_Ny;P+_wJi&SDAZAQB4NdLJ^IFJnJNyFrBeBcOPXQ|2|
z<SqPtVHu60+XOtcjZ5wb>N>SPWG@aG>!$^{7}>YWTA^5d-WNOr^JU0rb4(h@r{AHf
zG>7R4K0W;1>dLxl?d|eq+6GOv22GADg<2VN-r^;Q#->;B5n$y`nwpCz9}H&5-th>)
zPD>j&G#eRw{Z0YURB1XPO*!3l<4f(b)%U50P3R4zoy`kwAC`G35L)1xSX3<4KmM`y
zcZ4;G<7Q1G5ZNKGIUJ{eo!^8;r)iE%YW}CSykb<V&|P97uNLBnO~+sMzIm^=^4fxY
zAv&z_@PwEXq4zSQn~JFd(esXWtHFP2gchg2L!*+P<@>I(K3ofU6GZj1kG{w(7N_ra
z#@0zjD+-l;*}DAON7FYdmTO7c<D@E-J}jK8c=2*LI5)bU?_ODoz4IQ<vv(1z8%>Q!
z3fG@GA%We$BX!Yd^!yDkr`*WaqsJulVTbrhkNU(VnmuIOc^f<J;d5sM@>v{Qct$z5
zL2g$aCn1ch<#|No-a<l1bj>Yn1{vo%vvTbRzH6}wT>taS(<_1FGhajIy4Htn0-kl7
zMBoCNC8=+<_AT4Joy+RkYl3~Q-p{Tr4Xih+l_E{))d6v$I6ICu$>>CrgU;=CrHi^x
zb_6ENs>T}{(uaB;OQhM}D7Oa7Ok)53O#1J>p{a4P1vn@*E9N^TlYRG}ms~XC<uDxn
zdm|E!hj0?rFoA$Ca6WH2bMPpo9&|8fM1ap5xll<W?2Q7x5A<*Eje1)r7tX7b+Td35
zu&oQNON_F~rzPjsO`S~3oONi;zTaJpM&SAz>|E?wsdm(2cv_bgwIKqyzZ%KQl-`X;
z)F+xZwF_FM4#u-FgJMrGcEdoHc?lCZGl_oh#?eM2SvZw}Cw1xW&L@RCjB30SeApNg
zUYbHVS0%BLK2etL$*uWn?VjB{0AWl&Hds!Kc#kAuJ}fAsq$sbbux$y3EE;BUZhx8X
z%r*~w)Nw;6U<83w7UVL;v+s3)A4k7?NbjoqeA}VZ6Usk>t>8W<c$1!P(EmiOlGV!W
zJ8)_1^0<h0brG1A9i&D2_;y&CdV;L7K@V${i!9}#!5WR<#`5Yyj`9aR)XieTzFD(J
zUAgP7TLdpgA5@gYsLr-3Qj72=@G-iOalm(M1I{^0$2x)HH^FRZLig*RAKFrL$Fz_S
zcQZ`viq$mJX9nNs#k`Uzvb@6|>P91?-_difR?0CYZ!g-+TWHJ$sg7QFFT@o=u5Jyg
zqG{UjC+{G&75hvy#ZCY|y?4LnnId6t!`ob9Jdq_orv0xe#*;GZw;ou47)a4r{>q|D
z8FD@)ACeWHShBoH($m?N5uA93j7w!AXeVQzItKT1tu-3TEure)xGDg2-Ara<h2-2o
zt6X14qUch|FJ$~DoR(`>8kjHQn2C~x4174<EE?0Tgeadz2g4z*`aS|J?%s8UHd+X_
z`0uQ@)RpWw$Y+a*FpBQ*RV!ua!{&Qo*b`M5hTrSU+?JhPw9`@dGoThkktDtTObKfh
z9^L>liH9o2<>w|_XtS$MyhpZ;E%YI3$Zy@#)Lur8B+V^7%PjQ)RnMVGf?aF>d67}l
z$tLj-+U%9=`f%U7mu-vp_3ZtgBE906FGt(sFHrL1k@cF~ua81mt-*t>bo*#y>S#hy
zp!G-H5;?wFD<Ih{*h}h8FY3eAlK$H0Zi`*&rf%tmW5<!-qT0e&%2UF%Gx}X&^)*=z
z1ol>X9<IWE!=sAc<y7Rk*z(Edf8Z?t{PI@CV|SmsVmr|R?akwd^7Wa?2lf;WzTzH%
z3Oz{TD|p+JcI%5v6sbc0Ok==aJ(Y*2Vu9bvTW+2gEf^3n%&SL@m`w^J_+OVL-kNkQ
z#Y(CE^_=y8JwX4P4+I|&FhwZOJ|1CG2vr8RCTcnOoDMYY|A1ACAyIk!Ts9rhOeQ6)
zWT8SUVwQ|EN^n9P&-mDt%F08PxPmH~yqNT4y675XAu#qY*Z$!VO<}wcM-^6g1#fBF
zogcBT(>AhSYL^wz>zrk)2Q)w@gRC&ClL$XfQ)<=?()^}!KW|8MQ7#yyqwZU(qn5e3
z04@qSdVdU2;lkmCU=BuqO=fLXDSPP#2WsbYWhQw+_&1!c)bY#C{1y`QPMQ4d&Ejx>
z5neGBa+%?xgOrWPFB&F$H0=1}>RrtXbz!IpkGF7JN#Z|n)x>ZG2;Ws<g3O?_v@`V<
zb@NbTB9qHX_Eb7E^8r?l=Va1Nz)qg-ct+er()MJ@KX76FCPfa-eeU2(o!%bF;E!iU
zE_>X?9xeQPdgyiG<X@XD)ox3{_-pYUMlYCP+}={BRD!7RG?48e$i{WzS_|*gDReKW
zAC*;#ZGtQsvl?ob@1nok+;DgEVyMJ6D%CMC;o&mUGSR}gaVFhyhc(YmW6rR)(Mp${
zx+1I`s!%>UoGC(zOj+lILX!|t7-FD3sf-L@INEPmitlMeL(o~ZP3g0&ZJCEe_j}a6
zd(eK)SX7D<_y>;Vm0u!QLR5Zf>7CD+cY~A6j>>KjkLacBsaH@}?W&`JLBm<a;JDL+
zzW^G17Db7^i$Qw(T^(x9U24P`MKF0$$tHfEe_rfB6bttn2|a@qiH!VGS_yIUHN(##
zAhw>z32&)|USN%K_-bihkQ_nVc4IbrSL>-HnmS55Eu<--T-7`C_l(fbrX%mc*QtZ1
z2=|Y5iJr7Km*u6!MQ$>iKvEqLc_9CXzN2AmCF*n^6tbkl+>OLUh9GSd^lK8Dos%-g
zwQDq)5L6GnahUE$ri#EPk~8?ho7Az5g&#l+`V5PTg*=GfD<l<Km@#c$^n|f-$NH}B
zB^RtOwTlkPixFVl;TPKssHH`7P{IJ1N|dawbtOmE>#;S>oQHdJ6(iOD!SkI&^rrbb
zQ2qn3b%n8su6Z~jQzp3;VF?MYoki~-ICzLAL5!*~7rK2WY3{n~tA@V}|9dG&-zlf>
zOy39U!K<CaSJ{Mc^Y&M&&y-4d$1slAP3Q8eHL9OBoY&-yUGQAs-i}$G<w0lg3sn*J
zc5;PXU`}XE{q?wv@GBL-XR7Pg+w6l_UGo1_pZY=MUyK;YlZ;Y9Fp>F^f8R5M*xC@Q
zApW8iLq|Bi=gN#xvAuh}7hoxC-gNfUqSGQE30l<P7~u#6R6;dT%de{9QuS*(#ka^y
z)xp>#e<7XR8|<#_{;d}{E_REb<9fa3ZuJR+^v7+BHfn)>_i*uEkFF%Ikis)3nzUPO
z5);weeanH?1U=`LDS%5Ta668Gr0j=#__RQYmUpclqjg4}Y?WYSZ^Zco+9NI~ivT{p
zM*@%LwyIv?B67p^-A^4-p~L{>)|qi3dRqZM2bfjN4bpePTWUvh9|Xwj_vWE1ea*x<
znHxuo%)H#*nJcULq$Y}j=Dy7@`F4!DvJ=^oA6r4XW}6Du_9D$3?*y<sGM2~3k>`e6
zeF~0yU(j4!=9#)AZ`ZiDk|kk#UTJ3%4lR!3+KHVQt3lM4ijw<O!G+am1mx%O3FRm?
z5VbH&?fhQlBo(T%5Zx1R@e=hXw>693b0He@Z?OSUC8Zx)$Wma9MD)Dsa_yUdS32nN
z?I4$ngbEf>#lRr;O28T+Q$9DgNgcAWK-IlhVPDmKNfO#8xO`@%tb^NSt|=q2g75ga
zmSz@eaE>FTTdDBcL4h#~Xyo6E0pqrKL~#q8OoMXo++%su2g7kN<7k13tiT&>!8D&d
zHf(G0sC|_NZC!d2{%JE#A0{QSw9rb=J}nfdCB*rptd^6tC0|nvH#wmVGLH-GjI7Y|
ze!csL{9$SO-_7butUq7TR)Dp2XzuQz-#oCT#u-N=qm^X@R2r0lBBW4%dn-R@KgAwb
z%sX(vtR5@+=Jan-b6+?xG0UeCJxm=GEf1l8;FJ#P!}0cGk`Ob<US^YZy;RVDvoObs
zpSQ!0g{dzs)*`2R)bXz9KVy8m9znhQ$xA`Xo<i%X)zjist);%6ZL>_HhDO_ye_tdb
z;MY@9R$SrpGgR-on=Cj+{`)rsdnfX{u%B0{#)+^C8NEtM(WrKHv-%jm4C#jCu<ssZ
z?PJzYhddl%8q-UDR_c(p6$T^FEw*46Kh{%~gf8pW@bSSy8td2ncPQvfJi@yeXE{|3
zbvFj3ibn!@8^R);JukF<>oQ9_DtAi@YC;;BcKDW0^)HJ9rss_2XeM&`F+nwXp?q*%
z@|zEyZ0W?|7-khpsMO8dA~ixq>M23%H=qw<u73aB&G<k5nZb(l!NAspeh+;jOF_}D
zqZ&>$I96>~83l-GX4#hQ5oc#t^Za+(BP?_n&BnEPUCzcM4&oLZ^v>H$W(<zAp_Mu0
z^`d^$$3u!eH^G3Q!fXef^yAoF4asw@?RD*HN=uI8L3@J<|HzsL8us#hO(mz!-e-_D
z=Df_i(dU*d<$59}QzIAB4|0=CM=9u<V%_`B(|}1ccGMTC5i<G#r_lD%+#kc;_~T%*
zgsK>>CI*7^N!r2Pyo#;9DD|4(vB^u*)i#`R3ek&AU=o*?9D2@N_C<*3B*5(lhzUcG
zsdA91v~)ey9c~@YJ}i+yaM1}sAIdEUXPU9=<fMaH&B+Lb-EA6dzptvcPUjN0Khh9U
zql}WGw!k~Ly>W<(?Mn#c%XBKwXeveVcqKHFHgA(M=LNkBog%fP!yh?o6@6k=!Z6FW
zuT!F)qVt`8sw~OmJq25??6<R5&<^?P;wIae)a}=0^t8WUvB#5vPp2}r;P8yQRvSaj
z^*~rJ`q8AldyrJw4`QlfL<2hNf%SxBPcF^Wih4Ehj3;;x8qM5}u~k#0$jzJ=e?`wp
zw6O|Da`iTIdbYT{gLWYNfR2$+*p=nFC9?m%WpcR_$dW($38s(did<OD@LMRh^)M$8
zs92CsoS1_-yX8NMaw*8nGKuR5b=3x2)1MvY6d`N2v0qU<J~2U`ccN7nwWcZh93YL{
z?#{JJqnqcDT$~3MMnEwET7<b1kTl^3-f=0-A2zaEM%WT#%ppd*B4!C$FQaP0VQVgX
zaG7S4)9O`2hvqPhUO@qV_Y*?r0`gf|Vr{ONc&6?j%M2%(@r8|ks~-9ZrJX~YbxFx!
zwm@!4$%;9~Yr0IazeHwbIG)X^8=~g@t8+mYNQc*y?{^PsPnIv^D(tndeT?d?t;NwL
zDe!Iu;&>XgFuCbrldV?HqHac#7Jmpo3(nILE4RuiytnLXfBrvke$gceFG(2*%jvQ#
zcQiM%Ck;Ghr#=`cmX2Ib&Hi@ciY9l4`2;<`f*jpnJMw;gFiBK;E$Djv-yk>r{{V9P
zcg6Mp=gRxeR;1pzL8ABc%+P6Oz^l_^_kySXw;jQ(6Bt2D&}7Z-0RTT9j!}An@i{l^
zF(^lFMB`GaRqQhty$Dii(RLv+7OME~wH8)&0GPiq>%-p?Spg4OMW%(&0me)LfDv+>
ziut~`I(vK57{oZAM~~$pX}5f)RRc1{x9STb4@>+iZAzn`?<n6<iNG7h;;|GstF{v4
z?gBR=IrLkmWZ<&02u<tP{}x?4)35AaY1OXqLxF0flI9T+KnMM~hxWPGrYwMo&pTSp
zkl9)80m^YVc*ELJ*QulpuzQM(#y@aH$4@LNEPrpzZLLWM$76SIYKzqu=d2LFSiVfX
z^(K%3MKk*PeZpmdg}by1UA3GKX5ZmEN=JDmh1GNLNfdj)9CG$wd9n^FSZ(FUuZ{4%
z6?BU(qCa`HJeHaB3Z%-mVVen{+rn{GY;$&r)EqF7aR$|98$eHyqt(^{6hiFU5T3Pz
z&wQ&E6hd+fszz9Y?~18*Z3hqjv<YY($Ni+2;m8XkB9@+6aX~#K1X8Za{;tL5AAB(2
zyEfp<L&u)QK^5`z!DMmm#0c*~Et^W1H2G~CvGNbxysk^=l!F(DzLX|Fj>zgp0204c
zz<grkKPKKl<Oi;@Nps`jaX~sFS15~M-$mlaZ`Sh5zNbIVJtxZOym$(X-}lf&hP1tC
zt25Ozu`h$^_95NnCA4*6{%yQB#?h9bV7&cjU3yoBkcJIX);))HOQMtGb)&mR+um@)
z$E??qy1OZWaF2uex}~{0_wSpxG6ISUE|0n~{mlqdhr)m0bc@)Ix=ecLQlFAYJAcAe
zYd<8sf4YQ?oDD;J=@8<&=f?Wx1E9hdXHXSR*jL+yhc&x~#;0Y*dpH?-kq%9>Vt7k3
zZ6+_5w0d$h5}(q?yWPdYe%zRDz{2|9<RkU&7<;s^pqleC@RdpzO)F6KE{R(THD~s#
zsLd0jUQ)~#tJ%Oo`N9EB<{Bhu?1Y1gZA}ehOY#<}3Z_VlaPBax%X-QgKwzYGWcD~(
z2~SPp+)HulVq@X$0l=pz?Ikr$FTECDPAc8nd92;r9M_H&RX~Xr#}n87J({zOSP5dK
zI;S2w;X!G3Tk~9=M5d~KPX1@hn-K0*MPg0XHB0&p<Gb{W1$O_}H&VwB94-JyP}kjS
z(h@=P2|CgXYHj?*<ah!{oWR63Y9o0h{KD~UsZxG}rx=Vo@-MEd|I_3nEG<<@D}8hV
z%uT68bB(B`x2Z~#+7PAQOelazZZC44eSAv2>L}~cr@hqC*w6sZR%3YQZIemOff*h-
zmY15sz1pjg_2mytzj7LIlN?@T$~eROE#iIhMAciZkCftUs`lH~dgk!`yvrclSl9cW
z?pCu;R?i*<KGk%lmL9c@yC5OOU)Na#PG3c>T;oYD8nx4kF_k;kt2Ihi9Jf6H%kn&j
zq)e_ZqGvgnzkJrkz~1Fc>>{Ay1W<OaKk!ouAw#+_j9Z2+vVsJH&B9`GUrGA@AV%=i
zWyy;l&@mAYjRKsev$nh@>F@@4NsZ6B4E4iERa{Pz<BKhu*pZf-xj($FKkOL01jD78
zre5*WOl2&md-*Og^vKcbWvrrDK4d*gon;ktn}U%F9!Unu=U(n8)DNv3S9o&KLW@{c
zt4bR!gw|F%sH8X!C`~buLQ<It#lXqw_A?sz<R;1~xQ=Lf<gJzWpX|piuTYEl#r8lX
zJBd*4VDxZd!oIKkE4dB<&zp_{ixgCM(J0h_e)^n#bc3^;j2-lV%ci4}3O9U34M8%w
zL&Ob~--G>cDvcxzb}%IAHmdA+u`7?)VE>pLLp7R}lORh+Z>Hw7qf?PvHV>xuD*-a(
za(NrlfW+{f{0xIM9gnV}Hkh;pv;uSZ9YMS`WLUfx0cC$KO^U3|{v6d<WKQu_s{eTB
z3pr-x(2Ry>3a}eTN@`^fFUr}uGyv|FG~w-gN~w`Q>ARu7VxJEb{OUz69UNpdWXk2&
zdGSiP-rj28AbJ56u;?FHmGnUGy(W^Z>c`K_OjYDkn!q%X_`dNq*=Vp1)P7MMG`({o
zh`4mPM92FcZkq@3W|$BbT5$3uTnMU1hhxR_HLi@hje9=Bw-n&3GL)gS^yQBv(2N#{
z<{qh>)eZb^WxmpsL~F!Upyc>a>fo4^(i7nl)veD4UHyKg-JG8l^x6Jw?(x6Wa3-?y
zwY>Z8B&Gbhhs4PJwrOXf>q;$_R`_#)!I|T&mOJ>YmQARo`uc?TqRx|_2gj1M2k(+o
z4PLkQ8mk*Bb4jz&!%~ijaFyKbL}u0&5^EW0&n>{6f&EYVKeM(5QP2ff20bMr1xdVf
z#y>v}Q*wg!)*e|2uj9d0u+;`46<rxYnjDZP6?~-k>sj69E~u(#@y~y!ivBk%r2iMd
zDnMZ6$R0fRtj=Mlz|>$#EO}-i6+8wRCT1;GLIAM|5hYWQ3~F*-qV9F%_Ax#4Yssq+
z75^<a7xhH{cKuOj=!}nj_hj!oQx(G_?a|kcjMb|6^B+n6SWzYx59HtzZ*>UYxiC$Z
z<TERP_<}?1;&S*v<rHGAx#ahE&mFJmQ;VYNS%PQkV&mkyzS51*M0H8ZVXOWWQoU37
zU!?=%Pos@OIm;)m<`d+iw%c<<%b7gYP~_Z!qJQ87Gp*`S+k8?5$5@)?3ifQMt(=_T
z?Cnz$B?pK+Cw#S`sYTe1PDo#P48solqx5xT66!jOr4)x`l9wxLXdbnHT9XpsLxgTG
zfyt3N<j*`WjklUc$!cm7uHzQr>*)NMHij#VThufKeOF!T%R86*cTo+pL$vBFfv(yT
zC$#nzLT<~JLoDTYn4)_%;?_{dF~Ki28$&lTbtoBA5LpJDY0nS`6NmG0nyWX?x@Mq2
zd*>?F=wi74L1_L6k$~cF<Buz)+H&S0Q2Whrila2V@iJ<v&wo+Y!S{P<qeoB>KQ{c}
z$JWuD?n36OjGtorEBH0&2n~HdxIb=b)BKpny03XNkCaN@IlNK^eneO|FYhv+vY6p=
zok&a`3pR@bT>6_F4&N{h{NSn6A_eGDE7bC6`Hy(oW(x@BH|$t&E|n|JY&!06?k(Da
z{MX|#e&q!p2}!v8#XUEOhV@wo^RK)G1if8$@h8d}u24C@%=LX2S2<uLgbuIwbt#5N
z#_;E;#YJal${!yZ15p_7Ht;hQ<z+aC&Uw(oV?<sw6u0RTYd1T^Vb9FgLcahU;a3H0
z2WBN1>$9l-Tmnfs+1U+pWL)VEo{sXhi603E1o^*KTPqQeo3TrBsIxKOZgjd#>~$&#
zeqtFzm69v8%ExM7Thh6|Qj2__t1bT9aw(j=q%I!->(gzckdq#iFn6O&-XC7owlqh6
zD@Q*k{v$Cc>9bodFKJuzAqe(YW~zSdJA|XxAYpDjHusnX$*rHuUx7FNnth8#pX-`S
zklPdfpvKS9)S^;mo@TFWxv3=9yq6AbCW{{VHbRYf&GQb{0UfP%+l$HknZH+Jqo`pG
zzEGdyhh8L+=BOqP$2Lil8l0|afb_aY*5Mo9tPUw4R1O}Icsv?d+7Um{{GyO2I3`vW
zuAoZq<~aivLOPK<J#tO-9x057r=1mU;8<J!fkX4;=eA%wO496zC@ptE3BP*h`QD9Q
zHCyjw(P;bR!OpbOOp!WqVAG219<A#y=#cnI#^yJ2?8lV-Qx>-=g#hNlVJJqQXIepE
zWcLjpU3NLrM6&NMVfbe{rT7)h0Ji@)^8Qcm0JQ7^e4jM@bYz3pqlw8`1U?+4iNSAc
zWg-hAn$}O%KsX%k(GkF<hb5(+!EJ^p)h5kVMQ(M7Zd8(tB|Cu90M7~nRtr`k>Upmx
zh}1n~fLhJ~?JD*M55w}5x|JtC3Q(hY)xw#f+5AB-Y?Pgi)u`^_Ry$+&PnJ6mX;cY7
zZL)QxI6z6sM(?)+TYElc*XlPB{Rt-u+A4gYiJLgu3U3-755iaV5w*d@6u65_(uMt5
zZoZOuW>#zkD^eixx<js!q`}2tcoGR*;g*HArLo%9Rja#aO(Y7mmAwd1>r`Evn$DTV
z<*%Zm9H-7-(2!>yK~cKr{XJuu=uJ!bp8l}pIo0j!%F6zP>%Qe$Wk6y$Ch3L*FBvC?
zN3N4iP~&criMp>DrN7BIbEg5&q|mG&s*oMemh4!njam>|PAXnkH{-7=yYn3$bWVMr
z^0xK*#43TPH4OvOuVoseImQMJ`THf_bKQACr-}mns<x7Tjq^NKux-VYhrSr1<(Gh6
zjL(Wb@0|eAuN`2t!-Jy(L8yByI<>N}8T$31y^d{K@wz77H&qOj#Ss1yo^WRwH*kPy
zGKa#bR&(=OT73ISI!~fZS`Kl3mOus2B^`q$(JRu?xiAP)$67xt!C*gdiV&E^YF4cc
z0ufp@R4$YLt*MR87;=w0DoM?j9Q)hvrh8@EmZknX)XnCTnQF?rl;7=H-ri!ZnIDQb
zvA(TxdW}HUulTv9aLab5?fx|B+}c#uHEC|aRDKbQ=JoO6g=n)bFhQvd;^dFjD<+{a
z)5yotRK#$9DOH>Ny?&zzLv|ri69u*iy|o0s4-?-ay&^l#jnut-SnMwaAL%rj$8^~t
z1LgdNo-FC~AJ6?a?BS*xf%BSVye|GCEp*+iCc%F~C{2xQxvmX@qx&K}JJ;H-tZPjA
zvZ$qP$}b-qWz}XUq>q(|jQIK8veZw|zL@rGTAsellFgD4*{qPxa3Sd7P3%uaJ!i&W
zIyhwUElfDs+YmR_b^dZEdSL?zES3yak8_p(s#Qahbq^t(5U#zN{oaUg?&bGFjC33x
zyS!42K(K13CbO*=KI6t(TXhQfOj~S|79@7wPc2UMlKuLKuskJG;S7>8Z=(;nD=htk
zewGk4qt@=B`v)WB=9#r|Q!u@+jsF`%@sApzm&*BbL8Zf5pQzN#s6;+%trT4LCMLoj
zqxT)cJV|54iJTYeLP)|J1iN6SMdomXMr<z(<7(bk9(`qTA3FTZ@b44o6s0B84Q~XI
z;DVN}0`t9RS}a%LJsI;i6@YLT%`D^1i)8G4YxKIt(~mw!z&!b}Tz$b=p1qS2*QrOF
z9x1OsXg(u$!p%4@7%MlcL4ibYaM(j{?-fU3YMC|aEt-lI(bOe9=p^on|Cgdwz;0cZ
z@xS$e{ttEpPLnn|dfRX$5M?s$<U)+#AMovE5kL{<WgXjp-~gSHNB0`;m18*mQc(UZ
z3He8(z!{R}1AxNFt=z^_aLRt$;kFYgu{HBl<oXTe!R9Le-s=-HW0>10>Q19Qb=IxH
zU3Ch>nsigpomK*_@?3q=r&?VZlDy#aqX_8g;IWFQM^itkE%bO^Ps^mnzVD#2JW7kc
zejLHy_H^bgjM>BEPsx#!{6;=SMqaW~r_WhR{d5L*%rz5d?cnL-XZ$&V2OVkXY2pNj
zw&k?=Uv*9jQ0M2yF%5Mp5C>VF+<J>9pA|)0bZ(_vWS=xDA_3nR*-2*(3w6I2NV{`k
zC+@UkBar73sG4DJ<bb)4%1X`fl>#U9pqRO4=12(k`nzKQm6uH{V#<Tr<bJ?Lm>ppf
zADf9D4iO?(ct2a2f*$Qz`HbS+f^?`A)=1AdP(}t%o?x6GiV>Oi6u5Co^jl6z5I0fT
zOJrU7z6R!=4A|*N)D3QF+Lk;nFX+v%zY*N92X%^?P87C{XD+ED5ms6G3dg4<q)_i=
zDj~pf_XHh5S;%H>%~m?#MATQ+OG4jzv&1(T@^t8RQK<dzoLA4qe9f}H;$2%@J>%B$
ziAKTpWi9@-=g>iiiPeCFSHi5d-g%$ZCX(-CVR+(;3(8AsmlEUT*no5oi<yy)C{ehM
z(g;jykE5r+=?tWMQE5FBW<iEb4<5H2MeS9-@H8ErAGDt;NP#yU+WN0`(@;xf73F7q
zk)RW(&VF#qI@5JJb(U1;j4ry8s1--}zxsdTE$(zR3FRDFvQh$<9YiyH@df(|W?V1!
zjG!RR3Dq@mbGSn{c;BP%yH^($WV-s1tzpcWM6~>zk*#U0!rwzRHL(|^w`VW7MPDCF
zo&oMD^x)Wil{%Xm^MTZl0xdy-o0fk8X3jQltuCQhWeM?-^-&WHE5NrRzoFQ(guQd>
zJ3XhlmPwin*s?r~PqzF=CnNEfvAvijbT}6QUpcA@e&5Xo!Mp)&Da6$emvSuiCg8^_
z)Uzc?3WcEW5;8J`rtI8IQbMNJv}SiMbr(j2CSNv*c7+(s8f*Epk|;Y6Y?<vsYV=h(
zcwy8ey8ElH8?&%KWkwnds=HJlw2YcX_ygxCc@SGmC*{^GHO*3LI9q!9(N6F_TNd)>
z#_+hVG1t$~$+7r+tkrU((pt5E%axYAYnGeLG*H2F;+=+?g%a<5-Yh+=v5@>aN_uzQ
zG5q@KW7X6<T@gasn?2)S_F<mB#hdAkFTH}$`bRNA<mReVKa&R2HVlVX(Ku<f%%Kok
zA4?{K=8hsn;4>iP{<pqqXTRl)Q#pWM`v3Dz(!7sU-!j<kBmzR=Uf_XzHfw?X=-TLQ
zc`pYVo5DT=GH;ca{R5ca`IotAMtL(ieRP1s@rcEokPL;zUvK1huh&XaA1vWe0V76S
zOV;1Va=5-~WTvsCZ*B9V%WC<H=ChFYT5|eAN~mVtEtC;q9u}9W{M#~zM$?J$p{C^8
zA^zWgDoX6g6b;bf0%Pue^*02poHaaJ#|hPYdydhy0*U>||7cwnYc;4T<-2=~wF11_
z7hc^eDZ>Sm&`Cqoy6;+A^nb7ng($%+prFG9gvi(?G`PZTNB4m9?t;?opj5FZFtL_W
z82^z#6495>o0Z-cS&9)3oh92d8+oalU&8cGj|XJN(TPcL>m(O2T~4#t0S{W&&g<Z^
zeg&vnzdTgEuAVDw3PdS%+-Y6ZeP_QKWo#`3Y#dUZIr`ojlSN`MJGVx+TW}g7HY1<_
zq|!%JcmYh08Cd`P)Y8DcJr;MPmEc<MK;K3fWc;Z3{gyywF}h36WNfN_zn{u)vkeB{
z{jyGZG;&M<d0q1o2ZI<?1JZYc=5*sig>!3?bvubQ+ur;%l!zLj@h~V78_7nsZjezq
zUQ8qh&VkBA@6qX2p(6$Dkm?BXV{A)Nv094kd5KaeZ$RUhN^tvIDB!ISyh0P#<C)kb
zYGzvlwHw?LOV{7MLX}=F>UUm-kThjswuJqV&&&Oa95Fea>9t@JxS+_2#m;^Yv}$Od
zyQ%aEQBXOQAr5+-=Rav)NFqU-{oa#0PSX4vRFjYs)B}m<IlKNPQ6R(2dA*;~Q&DrP
zeYH?aN$rb_Rq%kZ&VrekTac|kMQdOa;!-8?M*H26+ew<g_>BSm?iGh-NC}I!r>5R|
zpQ1#ab9T#>ubF^sczwWFeO^YJl65-!K?_LH0&@mva)kciNl&00LSgT9rMD2iLuF2^
zes}fmXF6*QPbHI;`Ir>S(x|{USBG=6lZ(pUttBhlB(GVFTQZv`=Nq-5V9oPs5Ong_
z={B2C&vx=$L}D>tSj=(C&fwN`SIJXV*`{||pCg|!8Xk{%CVhs%Tcz-lqQqu(V`w1{
zo>IinY~~}NbAc<;@**4n<K@J;sWkLv>3(kHDI<Ov9L+}g1L&L{G;k;RTtYylxuNT=
zW|}%t=PoRfMZD2(O~b3VkYQJXT3>g6vG&|2#fZ|(KzNiUd3Jk_7U8)lfK`53ds_h<
zW0;$Y5@)6xydNzmJR?(<4$`J|-!o;UKS>Y1)X^ini-zKVpX<;i-c?0Z@(^(xqvWfv
zfK!Psvgz0=Ub_4!Ix}?cF(ep9TX&ioXDF9GNxfUl@~*#r&z-z<L9wr;DK#y1F$%#&
z=}z1B8DM*tm;tCOC`700hVN&g@6|0+=*=HQf6lM5UD8M_)Y1Jqa2f4;_LusJ#nK|m
z%{+1u$`j32w~pjg5c<eSmYMPRV(a*a2eD2MP{TTFhsyb*V+~0=*U3b*EsucvN(XCr
zB+oXsnYWSvQJ_O|ObFKVYWSb^yd<uG!1XgYTi;_?A$OkyE<Se9!X{60;ybI?)c7gM
zMN?9ix(gxXZ&Go27KLkit?x<1eRHPF1M@-ZSvWUq<QY`fIpc4jJ=`+UR885EY1&C*
ziMOxOPKi7Tdy-HIHW_tzly8|il~v=|Pq((n^0?2vGU&Unc-=@%U#=M#_xUboYnBb5
zNpWMoO3Au13u~i8XeV|12#SlV$`{h|eaul=GyzFAUGGc#-`U9pzeiq{ow`ynlxP!`
zHc3c`Am;D=2TlkPd@>p3$)S7n{=R|jYiY_w*Sbf;qchV;?e9Ux@Wxq@O;X;-UuO0o
z;arDMNVuSH{$4h7+on_3o`8n075H85?x86!%q98T>Nw~7oQeh~hz><S<afWbj(kcL
zfsKE#SQ{6oDo48uV8-@B2xpvGXAO{>0JU}}s6H-g$K{G%bKMyeDzj{Tv&6Rf(SD*8
zDemTD<LFjWxDBHLe&r{(WAxc>Pbhx`>>+EfM9$b1V}F|9!?TPjN~683h!Pv}?zO5y
zCm^Bmmk(GKYhETpE#HFTzl^+CoK+cLAcVy5=#k-Ib#-H1QNVvpij>||^M@on1mHTs
zUOzpS{hd=SlRl`cPJgAB<JTsUJnJZLA1;fM4HZnJZ)G~zPt#Y`))u1W`I_}Xh;XR&
z@7k@V<TMGqn0-<>Le&ly#Vw+`GWM+W;`_fSa~GP(`t+ePkSxk|=tek09#sIFB^R`u
zD5?@j8ZUzOS9L`6DkCWW08aPDux>8Cc0mS$znr(>w8Y}xnT8S~*^_F4dMhZq8QUy`
zyI^TCmK<fjbNEc_SPs-vDXCL~=-gZKwB3Eo6ee%a{0B~AqmW+MuACaFcp%qKE-!Z6
z2?)P^yUAB&@_Q3=Mo5Z}CnAE<5};$}srMMr$N0IAEiNG&$VNPf2C&Q4;rXT*jUGBf
zGD3MyuEcHKCLArqd*tbSJW}C3ix!>RlHH)S$QCobE#TKtZS^ZRv*|T7fd%f^hDp4l
zT7|g@aZForqbZc@3|U{SBOfa_8_`C~eVMM=s~;d9f*ckoX(8bwc{C$n<{IwDlFR4A
zh;)LSTXI&TvCCrVK&u@B$#hHwW%Gli9`tcG$e8u7gVwjkg>=1f-g8Xole*0n%=>|s
zwoPr(Oo#^~Q>Tpzd9yR{zRGwbjcQcTmL&PPij@?|;}+G0bo^d90hj(}Z_|%MR?gP-
zUeFkO%}d6EBf}X>+m3i1=UXj)?W!9ht!zU4bDP0UfFwmNp6V(fsy@2<sYtnvq<qJo
zzjE0AT%sYaHVMXz>9!m_?bRI$mihaQ^a0~BHnMyF^^yKV&Hs_yi&zrJ%k^o`P7jad
z{@0NaMPNlL2D#=;ZmLn^O<|F~*8{$79qx~%-Y8Fzo=lMR1!MKoClwz94Q*f!*f0N<
z%KLxDqYQPIABg2OpcAEc&k2bm{JQDu1`^kbOOlID%O!e~v5)EY$6BtkTzh8#nk2Fj
zl|)|Jv%F}z)-!rvmB*LP42q$P%(n^mX{kcn$=!9e=ld8%<(_Lsc9kK*`%3V#ta-hp
z`<%8Wk<?F`WfyqwSzIM_&y+{d$E1dGBRJi#J#vrI6@x`izMb!8y2DAWf07TAQZ=Lw
zjVH93lV~m(WXLSg!)af+)9;*Rh&~z5keKt)K+#eQAT>Qh3|2Kqxa=~p$3oMZ>AjVo
zfbWONx3&4Vd|B(7v`m5xRW0Kzp0<$ww1>CfRvXuG<M~dQf(1>>6U0v?hNt574%oAB
z?hXM3yMDlhVX3Ebq9J~(r`%{x9Q?L*$2AwVZFCp9Fv&E&p&PaMM7A<31upRlPx#k_
zJjFW=Rd{NhZB9q(umsf<%@5wbv8g;RD14r?N-14?ZBpp^DwfluVbUdQhtwDK2T=Qu
zQ)kyPOZIOf_Bivi7V*`#vsI}R360#FDuilxDuu1*cD!MRQ;tH$;L;ah9cnR~hM3lA
zUr<h8GSi&6uBy_T+7+8K`s{9HNxz|?yw&lKC^ttZd>17)$q`Ug7P(wfjGtIH20E3{
zP%xb6G=ruL3sdEED#zeokUZB9jvWN}E9I7&#SA$TM+y{1`?|o8X0>m3$-k`-$f=xV
z(g@okA>>ld$uNlNh6MHx<=J{<?EN>5fPi@i?>;Y<rvi!z%ep5HA=d9)D^q<Abm!O7
za_-+Qz)YVejOLyg4VCo^PI&1PnBpnTCD)z@^wVj_=Hzp7cPkEkkRp6hGZH~2<CPej
zh)EQ@;KOb@qdptP;2>lqiqJQ#TP1#<&=UGpI!&ZN0S<<;yHF(afim5RHDOTsI658a
zJnK0IQY75#VnO!>k|ZKX&CUd=dQigm?FWqA)c4Tj{*wNDE&s}q-DB|Nq8s9$DTd%g
z(ej#jMj!%Bn&bSH$Z2&{q)D0S*1CZo&V8?&EC4J-i1u3l`HOT%DBWG-wU(-&Z1B>t
zk9sG&@E#VZ`2G@nq}lA3aNcl64Ajdhj6&jyt>((JVUg4s3m)6+xbd3I!BvRR&Rth;
ztc^i!)N8!ej@SJ9-c7ZZxvub`nHZ@@&h(4m+Iyi1>I$lrk}owaQtIm(TtjxC_d1yO
zn9NDwQGi0QT9clT)BM)<5o<BLX<LSIZoy+%W_yC(L+<^Y-dVPJtE7}5#O0%WY>_vH
zx^RZ!!)~zl7icAhEPg|uVQM@$$aiC;Fs>#3nymB~G66<b7ONk|xn;_-Hs4g|J*kZC
z=~3R~&2O;v_B13Z7nmFSO<cab$2MqaWY<ljU^~OVF}fjYG14{g*N!pu+)Rirg?g34
zgVrKp{uGHDsh@}Jd|ualxOWk?q0cmq8bmXY)P`OmoNM(H;BlBe&TPPSP!<JtT*=%!
zXQ4pwPcjIX#U^(_^Q*$l$5Vs$p4;bDNz`66f(m3p?gPG>?>Q}ZTmCYAx^hjJa%Cw3
z6QwevY~xpAgn53e{WE#~kPJe2vEB3<I8og<ERDJxSy~js%%J?YXpHw-6-sr=&Hfew
zLGbra`rsbrd)}1wEo70*A@lQNZN=Gqg|_x7jD$`bHj$Uj42gTxxUtIPXsOG~%OQu;
z65OVHsS+LBe8_RyNlaiP%8?Ryq}@rFg|}M0CGfcAT2{9w+iQ{hrGnlUwbWXAr=_v3
z%ycZ-&@2ac`CzN@EHeKkkydpqjk@(Sq~Ri{rjOG^F-J-FuF~nS_}NcJ8TZ_$sF$yd
z+9NjSgtGobePDx3vgA@`H{vN3e{>;cn~Vs6e14~&j~_g~&P&<AS-Crddw95V^yT-T
zy^fb#r3#S1e#9bwTj{7P!W!PkrTz%Gmq#XcLcQ_)s3h&FRLf=argpQt&b$#Ji`?1M
z@j>K!B@Y2z69>6<^KHCX-pgS3*jT5BnndSqiNr`mEf+ab*vt4kg%kjbvB?BC>SD^y
zG^l4HqK&G0$E-q|^t-zQR!vK2N9ucOavUE9Th4NGiBA)C$sFj^5_-*!9#ql7w=4|B
zwO#H0;sfazkRVM?{R!%E=41*w(qub1pr!k>too%4MHfjLl(~b-dB^_RC~ea)Zla+d
zEAf8IEC=;-DUtQT&M*2F|683}m44_0G4Y#`0~F%nYR}?WBhhCbI_IX6aW;WRy-B|v
zr0dhD4HAql1++2IJ7|kIK8CX@DHt3G0NV2QMyyb@Io%O>E45#EyYiHPMe|-Od9}^s
zn(RuS`eH!QbGk>hOkdbjfpLNY-7c2s6zrhek3obPe@;}QV*<M#Qo1Cw5?byasWR=x
zqKh?V8*3{S&oYVV-09e|YM(e`w&Ijhe_B#}5yp8(Kb88EuTb(2teRoD^v);=CN_UN
ztlEQ}5IbKy$s*>p=G-~U-&|7uQavS9Q5YLXE*GWTQaV}<3+cXUJd}ZV9B56*4c!GG
z3*i~CoX!pu`%SXG&m0GlW~jNqhMD<;eHW(^X{6=5D3^5ShDZXJXv+6DHy#q|PUqzO
z#ZfKk+*hd9NhpOmZ7JkdA8KM(AiS<9b>jsUpdGf#F}aimLVw*fw{Em<SQTLVCz`-Q
zha@?TaKwI46k0=K!#CC8a}+dEIL4r@ufs0F2H|BS5YOUe8ye$!&rg%r?k5cl#-<83
zTC*@3m0hxKS~p!zKJ#37LfW-OW|_HV04Cx<oUNYiH%ASwe1M=$={`f?9OBqtGg^~k
zG5<YNJAh01dtwSE>ihKfd8?n#fuNRUXUSQGVh@{^lQ;;yq&qt4ihZhL?FN@NH4TBu
zZ}llvT=>BY3;@H2)r9W2()f7CQJET>Xw0T9sS){y96qrrO`kD7E1Gy5>aq5PIJUO-
zV7csFF2w;+#U5iqcTMYp@|8lj>kAD9#K3Egs}`#sO*Bd0y<dCIW;e>nTD?=x>VUq(
z=qK?%@kt*Qa=w#i7Z}Xl#N0djqQds(Gf^LZPT>zG_Mc2gnTQo6H!PCkVYW`OKmp~n
zR1bC#b4w~QG07a}5zo5H0o`=LR^0Uy*1iN}IlFmt-IE-uhO<PQ5YUW1Yr5Pgc@EWK
zK7I2BYqsF}=+t2^KYYmPU?Q|3(%K{w|7P0YAob47t&9RKWd<mh;bQpw$bxx~5mFdB
zZ#N|&xL$5Qb1XU|IcVYHuRER~4!{5M75?|e7DI^f)!?5y-Wkd1ng`YXV^p$!K}fco
z0^SbzKC~fYx45_}UO_6P*IAJmJ{{P(14U6#>s~3ffDKb2mSA%0HO3fH?zW7i=3&vp
z+`qN2f<Abm5@CO8a|O|-EcV<nGYqIPY^oX09;3lUJ`m1hr|0N%(CKe<IKK~kes~-|
zgRU<tb3Vw6{EI{PBaZA6l~>ih77C*c30Y~KuJmkKko%*dQt=b*LMKPzppQ;$B<eb6
z?HFzN#?^MZ(KM6dtb^*k4jZAlOCCNpw_7DIzd>R7xITi!34P+|0lJhxoA10f>Nh7&
zGW4Ucla0xJsho#s2{6yj{Hf%}LZXe{bDXFb))8H`f8hFTkj{ZOS|`R%b&@3yavQK!
z-o!e`7eQI@s%m>of<@4KWbF6a(akmM?E0RAJcjCe>_>VUj~qSQf4y09O1yA(iECc?
zDwM37Yb@q}42#p6_%=i?qy=LZF}B96iw`}xglr?P3*tD74PIHI5?vw9?1Af0S2)N5
zA1lgFp)iN!nxti#fJ8JgMeg-2TPp!?6mfLvjrQsUy&=3cW%KmT4|OMxs7x>H50p!R
zMM_^%y2iOb7XIP1e#FR@pH&?kO5$p)UP~}Y3cOTCV9!*1#n%H(MQHg#VGxR{yu`{Z
zW=aBhPaK;negPcSF6QZ$;No?h)A(nbT%VNMObNC{==+s&<YFKg)_DX-acA=}LFo;`
zsrAp{ym1ZX5F%@=95i^EPHL$K_Us{CRmU|tH_o1FVj`$gpBsB`(wq6SeD*O*BQg<!
z5xO4qLGXd<@*9itvlf0_mIAgNB!oyk0>eWt3Eh}m#R6)ePGZpSllp#SAmK2zxJ?<A
zA01?xM2GBAA`T;$v&q)oRTGA;(BTCGfG9G}#<$Zd)>_OA-=+0t-Zk%PW>#UV>bH;@
zc>h5<UaO7fL3g_OxG=+>+f(u@Q_{=MtEL_XNt9qdqt^`?bta`C5ZdGPf9=O;eNry6
z+|2)MA;;Vmi^g6Ql;7=Sl@7mUY7)vy>{Z#JkA#XyD#AB2(&7?K{@W62BN6BqUS#4?
z>@a2Ba!EsE%9|ajPFL*s{d`EBVmE9G?=7*B4o$j6!!nV>@AnsI^zQMm=pasgIA^*0
zvW!D$bn+XAEbS)kb6<ZY0p}SjwDz<Pm5gV}X18TS;DE#^+uQ~zA5pu+X*zdZ)-V<-
zT-*+Q59>I^XBfLAvz)<~Cbvb7v}m$t`+aEscE`Mh&v$x+<9fMd!Jm<UQFLZ*MZnJ6
zO&%`RjYjb8mUKn=AXVYifp#Iyvd~R!)VaP50zRK{YaaQvjowOzW9JqQ5E$rPo1ama
zA$T%sN@jA8K2RWw>tDV67-OIC4;-fZOU<>unX2A7=Gd`o7wR+TbP7o-H+r~Wk7d0d
z0GlJ~r0pQDy;Z>T`-cwkR^aG9Dq{(9<bJlMK&1_tb_d{Ao5mU~tY%Ns#!s#E5`|p9
zwJNM;LYeAEU1%r*%u!JNez%JMf3fwJ4Q)l;+Ac*(f#OyiiWPU4LUDI@_u%ec9D)Y|
z#UXgG5Zv9}wYU|El*;pFpATp6ectmM)>?Cod5<x!OG2Y{_W5d2$?=#Zj)9diS&ooj
ztRT|2Xj`-{yfl;&)3pjVKWO#>6)JH5`)767l~<gfJ()MBB->JwnIBKub0g@hm8)x$
zqywl9?0sqK_i2mJt7G{=Khk%=vW4dgAWn+yb26L1`ynrkIczA=hs%YFER;i%)+%CG
zbNjxzi}!aB*hg<+wW%-{)dMZC4l~fXmi09M`~8H2$XEhHy+YgagP`L-!eIK|xmWjz
zZAo;In--+bv%IVJPn!_`dDuTj5xU&%u~124T;P`=dtGge64He0o<7!x)<^Awyt!cN
zG@C{Mx|#wcP-it<qq;;#MTgjq-50L_Aq?!>Fa_iN{~Uc-!`3O)@vX$_*=w9Fd2S^R
zZ(f7A0NwvVa-w$#RAcP673nzP{|wh)xY7IJa#Tu$-krqrXZCltnkSE50=;hnil!fn
zyv_`NNz|8hSkf6uUkhR~X0`Qg3aOw&heM`0IIh9Jxq*N{1L7q#d*sA`M2(77LFecw
zBG;YW#hH*x-P%QO?SxGNJ?5Mu`fDmV*)hvG+Pw}=IIQ)aLg|0``dQBPG{MZ5EW*eB
z&l)*<KXQY@Cc5ygPdRUAv`p2<mYLgyZu6eJYH|UmCF*-&*tRpY_!E%ZRT|Aq&hVvt
zQX^{hUNa-C!*u;ObSy3>!y0GA3!#Jl-pIi1R1h3i6TD}(ShQ?aLxAn-2C#BBn(f%!
z@=(#6u%-Y&UIUMcXkTUqURfb-yIA*npuZ)vy97+XD=i(O=k!!I=P}4xMvUGdS#ZGc
z5R8Y&RV=(tu@5gv=BqGj98$~-Beee@O=F&>A9w(SnQ~h}g~>)ua0S8_BMm_yNys|C
z{4a*!kVlin4&9c)%hAG>Q-(nXn~`#t0?$x({aKn9FWa_A5@^$y2d>t$e%?E}tLHcf
zX!(?kZnfET;T!zeFT~B`kf_KjcBGyw*)KZFLyNc7Lr+q+8`uyU$W|-KqTXJUB6?N9
zXsXqIyqAtewP@Oaq<;Q6rxwAyD&DvS@R~+iO?b>chbRea97^;;E*XEBJh{g?EG{1U
zGro~B<vhhE6-5I(5U}M!YgVvD`78vCrvJ{BQhZ#~73g+9t`%U84s!wT44%k(rH(^_
zI?KN1z)+eNXk8%V&EQ=S+r_LC%G;UW6+;+;$lu*ZTfS2Y5OeMZhTpQT(-wU@@ktvO
z2KuTl9o%rva5w$wR-SjYL_%u93S<9u*X<!F7}sQo=54G%P>(HFS1if@_}zmPhc%zg
z&gE;$;I2vaitf8jlRO*;pmDNjyG}YjmPW##S2U+oI{zilIURwi<Gb)y=i<0;itIlA
zJ6vos*bz<bi4kfyIFKbtU|Z#pWp>f`_7lB@uI^;v+YtlW8CqwAP@(yQk(DpN<lK&_
zMNLru?S|b_fWf+rXV18J+*IGe^`Fz@0!N)U96PSDWb!YMuDkhq#9Gmeh1YTIC#|*t
zDY0Wwlfg-aO4_@BIgZAh+26!OaQKdK62L>uRdTw#g{zYqzTY);UIA_}jX=ilmKhJh
zn)~07^!p}0Zm$0=N0d7lJs|ZFR$y&yXoVZhxq=deTvH<i-oeiL7@DdV|J#XIroU#w
z_@$0qT0)!2Z+I)S5vl%be8j!DtQmjJCHE4WGkD~iFV>uOT@v0fn8QRhU;I64VLi1<
z00kB}>S31g#yj<RN4$;0o~$CSh>DDme5hoSJwGRX{rCrtoWtnhPU3Qu&35uNZAvzC
zt9$vKliB;U@^E;FYTq*Z?)>~P>jpaxvPMd`C^J}OcCGE3Nag+yCEaL2%R@lGqlpC8
zjbM{fXjBeUynV_L-<ZxYm-3pxHI5TnmFAbbJT=Rk@;GgBn@*v9;d=8ao44==Xkjsm
z>q{)mHCzK!-dFBlytRa=)YAXIxgH6Pv$${wFA|@imCfSlrKhc5DvBiKsL<}MG)hst
zT<&@2Z|kKdTbIs@LJr0lWGD+`z*i(i`Y$BOdUR_pv4tWm4&oNZSL)zjg~mQ!uoP{m
zSXVx@rKqN(v)v_b7IQ;J?!ty(_=MV+T22oosiq(gDBa9x#8<aQotUVz&+(|ge5@W^
zqt3_82VQK(N*Af3y5)aVc>{FuT~J1}cez~NSYhV8n1(E=kvQtjQ5#s~tti*OAJCL}
z@1Wz3dsXA(Md&palFjrzBHFs`lLIl&#_sRXgV&0KS94IMvXZypljMU2aXq69Qwp$Y
z8~<KcaZ0#B;e$vkRAS&_H|p@Rya4Xc;<UmTj8h#2KkDZoS4xP%`VGfxG5)XbOGu5f
zS-5lB+fcqd)|3wJc`WYK$IuC|Zg8pT@aecmQ|!$>$Qk=vVGdA`7=grC3Ld*bTKQ4!
z?{+GWz`0yLW*{rUaYJ?_XoJzj;-20Tv}V9N(4}_dWA6BO>FMJEw@F@3fbj(=L&`bN
zxuZ)PpW`J7>L%jQhgHR%?Gpsn-F_cEd<2lDw0pX|Am5=l{4Cp5c#gddXu#`$<a+Ja
z2F&InPp$%mYh~Gw3lfW%A}IScctNs{r78a0<<cCSHY#8Dk(X>eJM8&`*pTZcg<L;0
z)iC%4?xa&GQq+HNvW^I&KoWnc0xqd8_%$I16e;y`_p$12b{AD+C3Tqaa>6;Y8)}KN
zPQGv|O)gAV)|tAJ7LJ|rt}3WdcM9WheqPs~)o%MhCdsUmRg7~ZPEJ}GC#W;HUPj^~
zmrcaKu&~t5EpF1eJ?V-+I8n!}H;q-sfDP>DAc?7)&)YkoCWKCet0g(9ZJxZ=v~_rc
zry*8dG{J_(BfN|6=F87t5=hv-!930A^=2|$3E4jU_0<Pv@$v%>9yA4#Et`e3S4%UA
z^i}c)qOEF_4Z+#p&;uGlXRPEs4TZCEMj{mu6Ngk;X3Wx>4i}A&8S0r(`@(G!YVugQ
ztUMJ;N@4b+Ah-nz<;|DNx#f`}-hdSSzb^4D=Rer11nlBK9B<|b0cyW$^0t>eI<a^~
zuJ*CVfKG*}Q^MiJWZ!|Lq+;f^N@=zpO+5p>_?;>%-8wCUZ!%8V(0TRZGSX1E86sV`
z_5T?8vl0s@QJ_W%<`!0Nznz*xT)vco1@V{ky00Yq1KxQY`{*6Oq^cx-_LE8C{|bi$
z;;&{cN+*cNW4<|g$k`KU#>Q3|JIc%dH>hz&s3jbi6q0=vAc5&<EUVcBI3<d8r5f%a
z9luW83TVk8VNP1gS0kcTqeYveJ*Vn3$4DG+NMpz!po3yjur`6txx3Xx<6N>fX8O99
zVCpJ4j?iciUo`tU5)Hg<0EkedPFmcTo7b_BiehB*OLHL3_@P}RKd;yTb0Ql!4gd1h
z*StrILKso@{O`V_gN>T!x7oR$yOiO5dZjsy$rEz)QoUpIc={HVr`N|PmTs!4?(lnR
z2`NqB6-P!_3MRbVHrO}}zvK*dLa?}o%n1yw4NIFRnW6wAOz+bADuhN<`DM~uKpCt;
zh27!HZ9M(xij<j;zklk@Z5qGQas2KuG~Mva$@|VJ775K99m-eh=WQx--c`AfZI;L)
z@g8!A*Am3j(`S@!8vb1w$amp=RMj74C=U=v8!H9BigVE<x3cKs(v-%sQ2lV1ojP*a
zs}V&*%Re?WfzYN8X;Wguh@M-9%~uO9SJ({H=`-1Ff#ewID}u}_U8BVzYAr4+7R1oZ
zP!d}{hu8+O6kJd{f?ICkSA@|~#77}{isk0h3P>pWNjH|yI=}y9?*xOIsU-gVqo-Aj
zMV3{B<XC=63f9&PFI;|XXg8jsL+_xU3S=3hdK6=Gu#wq3^p|lxMABFcQ5BMpfEnY;
zkt(m=_#P8;g2#49j9hGuuZ37q&2+rfCRU8GM;0v{ioi_@rQg@|h1!^Mz;9!fCxPs`
zp!?ktce2GBtZ$B_0IDz>kMg&X921opn9_bz1?&g#cBY-ReL@WTISL9lr6bE|ePQm`
ztof`<DmTogbhL>kqssa}<n!4zpul`9J`nobvl>=?{>mCom{UtYkrVTZG))g5x=NkV
zx55i^+XvAKQ!KT@cjAeGEF6H(#Fg%F)BhmR{f3w%N(Pz`;hD{fnoUt6Bc@{r)FW`%
z=CuY$s7RdN@xcP>>)~ihEF6N*i9!C7U&J}450M`XRRIkn7J9TWD=tX~_uJBN5=h80
zA%B1gfa0cp;Jl{**KVYkIc2YEL0_HOMXF)comPv{58GUM>*tW0X|5)&u8^+MO_~7V
zh%*JT03mz|=O}3kK<T3kRR3;jN-m%$0RH9S^k(QlT=z;xKnLuWEoa2wp1d(bXJD-s
zm6|hdQ%F^D(@02Fv~+@;^nv1}jK4miLo~BVvCbS3ew6Wff7ut>(NR4GJk*F*UbUoL
zvUNKicJ6jWux!*Aah46<SkW<X#jbiR6(dJ3Kll&Sdqd-{U>6D=wADh^4XM_9SZy@6
z@AQ@z1@^!9VdI?Lu%;n=RSaybj7(O!_B4=%gn?@u3Mzf_W~%sE7uq6Ed*~|xPB-BY
zm%#QH6EzAEtYST+B3ZXX>+NMVS-O#meSG-Es84Q9W@e#lam+8l!y<}|UA~j}RoR_}
zqj~nc_!Q%ol$@NgALM;j*pYwdz3UEzI@s<E^CWoOsN7^?>lQxz+WwbhLuemF`m@<+
znX8@Dgp`^4&)iSLy{*>85cCBz{=ltZmywScsQ56A5!#H1vid`i0~}odVJyD#v(Fd^
zWyYzur;{O;;qb@Bqrrm3J~)+)U(IZ|`xy}4u+GrW9n6LZiG6;(zSqm9vb#p;KUM$N
za24yt2iwZ*l$~kXknFEg0e>`93&(ZJ($!SCYTRSW2xFk{hT;=aC&T+>!KghuTFGDr
z^1v7%qW_aMwsHB;8lZk4uE+sfFTXI^RXiAdWjo*efd+2Safx*j(e7CELeKOw;giqZ
zFi{Z!;^%jo?@)>m53=v^77VQ~njgOTxN6ep<FKrGN2W!T)@6LzN;nslZ8JpM{L-p#
zt?Igb<0QCjST`B3xPC|=#^);aX>Ez`DO+GmcRna)!T)e?frGjs<;bI6$n<gHqkEW9
zUZ8VzNd6D<$X_y2zryv%n8@Y`sv|_&?oT9td*gz(^#Rn0l+z53064<!u%DmMp3o-{
zY)OENw_stMjls@{@2%84e^ZA_EHr5Bx{HbUo?Q(DLX1`S_+PLDNjLQ^@{BE0UFhKY
zbuS=MMwM~DSPR43kq!z*l2v6}ili7L{V|gXV*#Vl$3=EhLm%k57B#6wl(A#84<{Q1
z;ZBPNWOT)rlh}Km-fj0<z28%lhkz4%39oME<D!r!ywK~!QgB6WMzAHSB!!*Ro!+;^
z$y3~b9ag?7vc+Gwe}UF*K!}Wi^F-}ZiQxBB_27^GED`!*yYM+0q>Ifybbvlyl_91y
zzFm1_r?R<*C5$XuRg9X`oU$8ffW`;r*j>u*9=-ULU>wVc@{#JU%RF>9Qf(etZ5sgg
zT@D4$E}t*x8%Zv;W|X@2w+$bQJsNYwmLuaNe&prXSMUS38rA;gF>Q{E;PlnAU_o^x
zhEmRn!#)WIXi4^@a=7fwC@bM;wO{1Tp|RjZa+d7h;xdjYE$JBvYAJ<MGbo8>tC$<#
zofP0hnm73&i760!{-caGeDk4d<tYjyI&2bnC7CMMwBVsg?S;LK8{^HpC5UoEC`*p~
z;1u`;#|aC8ZWSSrSnT8LyQ@oSch}C0KS$gbn94*70CZX(T9BKoSl|qHweK{8jg4jM
zb5qu6#1uLkb-T7r0m|&I5HljHQx*~BGe^LH=eP@uC_dKSt-=cs`|Ol_BY+VUd4!&4
znt<4#6ADdV5zx40E%(P-4`Q?SU6)j;8=7k4O_TN+*8ReBd-4<NsDkH0dEIMgt)jv1
zPMee-z@=cl!(m(DYTzEUGkX4Aebn{serE6FiW~i=Jr4{ezk`&r?;hkUuKwb7oJh}F
z(Rp6sE|?vS1#P##^H!L~>+#7-o>aF+YlF{ytBJ>nzheQ}di+p)@CvugDdHj1;4eDn
z75iJy$U{j?bjsh<D@ZfT@oY>C`>tu1pON}GyAM8j3l>Y-eHIz>I`V4T7L@W<6eCLT
zKAL_hlvxM7JHZ4nn;PB_sQN-2(tfp|{?gE>unZ{hbY&thxy{Ito)`+>TXAeGe&WM>
zVmEgclySTe*ZS%4cWj;O8>_5<$p5tt8u-VHmm!PBPaeJX(JhjOEo7}QI0?%Za4lrM
zL|P?4gv(9}{7j)BAwXSv5YXbl9b4QImWG}{Rp@%;^OyS%;d0%k7KjAccD6Ni&z*VU
z_6ji>R9eyYP}h2~4(GG2yPl$@#DVy<gt0hnY|$G;F&g{Wgla!(o|Y{6B@dWrt6bnR
zMG((6CEvesFd5YBU}vWyWek6FQOTcd0<6Do!B~->t>?m0DX*v8#BA^HY?vnjzk2Ge
z1UNVVlgjTh7Svs`%^aG~%98n!eUIzl(?c#OHTR0HM&Fo$3oe_tzWu+5jmiO<Sw?Fo
z5O0}QIt$t^_X+Lx#c{Klo1I52DMs`8lMOzyZZ`=M`S`&JfAR+mC6;39vSE>!vmHg)
z8;Ct01+<;nY@m;krC*YEUIc<t_w=hQ`F!^_U)oaJrltK)K!f;3`8@_}z6nAWL;`!$
zaN#w(Uf_+u_xN(CSf^b3J$ESxj7cnt@uf_f7aU#N`ztXyP-IOz3^k(G1=k9xVd%s4
zaUi9}7G47Y12gvCZ`FA6=f{i-)xV+Qv=$e2iqSS6dOzj{_P9Hee{q><-cq;+&@d8m
z(H0!e0hbY_JJnIb?l`AE-vdGsXOV?Hd0_8-@Nu$|8@3nK(@SCGz7VkgRjB49Y9*kV
z)RaT%o|IM9Uu(*`5&Di~#eJgilQCxfG%eAkje|)|9DfL%&|F-;Z3^~sc|eo83Z4@T
zc|z$pM8hS|ZHB)mRtKJrdWE4T^EIWy4c^8*d0|9tIGL9;dOgc^ud}9`-1!E384m*A
z1qx0MjwMAkLs)h+m~?8@$3WSM$|bXt7@|l(pIPr4zkT8s(&>K}Ou61r>-Q{UM&PV4
z{hQplbH{5slC4DhN$)XAsdpgqH+!J^#@_fZsX~<?_J!l@qB4Q?8Ca2HQONGw;BE~8
zsqK&Q#!bQ<c9tF<mlL|W`a1UYev@qr%;+HtE`SRC*pn;_6SCd4dnu!x{~(20@HJKr
zjWb(kM#{QLkcmiB)E3abv|i-KoP9}Axo_nL+(NB=P6H|8dzUUsPmpo6-yOF|n@Mqr
zsWCC4{d8goBCZN0(F;~Nv_d_>S#TVo1u}`d?qdRS6Pq!_AY^94$$b(eM1bxue@JqK
zm<;LD9z_3x#Pz4nld>Tqu6<z43ko96|9c#}EzCN=;g?V%|Bn%(R)YFce2-xqqrIJq
z#;nEc|1~$IwJ*EPc)B#9%5-eHZd?0(DgnPEzoaSQpc8r3gqk>UdKdeDO*2xCmV{bI
zLB+pBVZ#1y7*e_Hj(z<p$_31~$;I_H-=|!#dgU@&r&JXs<9>!Yij6mfzWYrB3Jk5P
z*;s4;zncEtf-I^mJS?S-cjnhik*m7}L0n$ld(N~U6<Lu4X`70WH`6+QvDe42P#j`Y
zp!n8HA4Zj`1F&fX^5v|&|CBu%2N*dG6>Yt=bgn+iH@2SyahQH4=ZxGdt%-?m?eOqX
z)#L8DqBXsc9JjS99oiK&BQFy%Uw`;w;b!{#l~dhIr!SwxK-o){TpXz9|77%T8|zP-
z5lh`sj8P&dsT({Ej<S7bLFXQu(@AAuEOVa@z(HK%e={4diAv{s<Z@4B?XDW**ddVS
zzAs!7q+DEPeJnqS-jh)-^3$o!u!r{6wg!o(eOI0Ae|n@~`x7d{*`@Nl$ZshAdXWP(
zid<DNDS?KGODg42uZ<e}(Pq29D0#Ger%q9$=dfwNmHeo9p>szwM6$TaXloT^Agcg(
z3v*s)vI*f_JoWA7QWsQ09}d-d(*We5_dO9|?9L<t+GVnA?D-bDYkG7kDv7VBCfO?*
z|CLWQB39*@HkN}`9k5i2u{92;+c=sAv3_u;(2!%HJe9I>>`EQbP_}Pj5Gg*cqJ;8C
zh?@~+Se0M0)i2bnAEe^jbK`Vtdujl`=F{0*4{qJD>eGAVn`vbIG^AiLC3dpWKr>2Q
zn+$XQ^>s6W!?LqUWkSR+Wu9|FgGUJF52;uf-&qe+f|<vSpHQ?`l4-6vUgIu&QqFP>
zX=ou=G8+B)A{uK$RuG!yR6|7#MG%K32?tWzlQ@pTR^He#ibq507hrA>6E#}g$sjhF
z$PG^T(g2sq$df56-LbDWDly`LamJhYt_<SMiuz&+_CyJL15u=V=1~7mX?f__-(?@O
zI<rCCiHZ5Y7m%Ug^qK<euWp!r<n@2}oPYGwe2>SeSsN9vePIn)G3a91M0^`J=9us=
z$yiX8enLVwvm-M)?5S_Xsh3IV7CSIyaZyJC)G;gyfKI6KXL&*eH&U<>Kanu~b$|hV
zc(gfYe0R@q#R0rD+#|5!D!<@QpDx@4drd`Jlb)&ktd8Q7`1S???}~b%2aSM9Md0~y
z7d>x5N*0RBR}?Sk@y1efQ_n`B5(=mnQY{xdL)Y%ODb*)QQ+kdpd_7@%XmnZ`!Y+s!
z<+D3g91iHCfqhAoI>$I6DWimbVkw$T?u>*jxHRXh6=J_u+_r3-eHZ^GHtcg!8=MRz
zrDm(!@LKiFcIc4oL54@c@J)#Il9phpBy8!c?@DaE2rn8!><zaEhS^7HFr2oXn>Zl(
znUfO?RxNT7J<IP?0+*sP0FLmRnlyz}I0r$wahVITr(2dH$(pTa4-#YTM*{BFs{=c4
zCY$(pP3(pe%{%LPXOh9qDSih8C5=YY<S?~v^d|b#U)S7z7Yi8#MlkFT7fuJaKTSC3
zC$~s8RZ(L}$03rvgNfmPke(Vjl!&q(?b67_@!qZ1J4p1dyss;IcappV<QJ*R`*@%h
zm^!-l+^VhF{jx8TA3h##^Nh6wQCW|x;zIsk6bkm#g;9%`-0d)m&7-Hk`fv@B=uHnu
zUhD)95b039>;jK|da+<|EtP}rv+8!%47I}v0LtBw&tglHzT+ZIPeUkU*0jL{=_~?z
zPf3fdn@?!`z#BvU*m>Yp;5e<s_EFmD-LY$n`BuSb1&3}nz$47G-|U;0L9dWVs*}^Q
zktNhYhR@DwC0@ODp}hjA?SCaovK?48tzl4x8{1G85U}_~no7{Hj;pNBhf~Or0l~FW
zP@TO23I1HMJK}!=vgV|Un7uN;yfRC@*-UYVW?pB0TE_*I=AdYf3H1QE7vGI5Twr>!
z(%<;sON?3H?aiZ!!~$;LX{qe!iIRe)?ux9O%r9Bn=_!A7C*gT@T3{==$G)b9d?_yi
zc5L;oaZ(tn$UEBpAn`r2>%x}x)lB&4yBP*1;jpz1vOc*msfM1QNg9<$fGPQKdH((-
z7zZ?tl(Z)2;RX+eta|+<&cLWCniWeEh_eir)$gRdO|$VFud=RojWOKVPE>)V?+tb6
zEug?)Xwhj3gu@x}-aCwmqpE88T}|u1h$%%4xbt>@M>mVF#xy6;dsDT<W-1$x#i{ha
zqi}>NF+H!ygGY-Dcz#>3MS1?b_Ny2CEZZ)qOIO<wXV%B-fhRWrGXlz<(BM6qCHfEg
zEPJAT1UsX$9_DBM*Usu;!=!&R)NwMUA*#Zo)U`g#nbB*w;0>g?9$i}sbKY<!(!?pC
zTDxs?d_IT`RXS=K2}jz$`<O^I^<L#Bm5J254Nm&zL|dorcBRqxm&KP%p=GMoKPD7k
zjeH&(QfI;w`ZQaO=xqV^!g!hSzSB6{tY9(<XX5e((~3&4F6Q;}l=O1Lv)hS&u)9s<
zvo@MkTlC>4a&PEvO9nlpF4mC_$J=l#(-Nd@SaKXka9}B15$h`Td+fMEJT>d`<_-g+
zZ1OTCvEBBxweBfoZO8@agGiM|Koa8<7e}@Q@{p<)dN@^vH^qAuGlsbD_0%%HtEy|~
z&BxlY2)S<7-S*!1EV#9>t&d;&x<~KDfX0Vy!V~QuJuJcekbY)MWvB0*-Ly!ew4Xs6
zZvfXfB$J^AsOr(fCcPs<z5$NxlX8RXKPL?D&9<_oQ;+LK6IBArmOY(SIBN?6eP5o>
z3mBM$P5?0!^<O~~2QF9a3KJac!8D*QToKc=)G_@E1gnIQe-==`?4>8t?jdMw)uCCF
zQc7?rZi*T5ox`Q>uvB+4!N?@Lp2QtA0dervy>tzcS#kM1L_ssyPqV{ff}bwGFX)?=
zp&0hb@h(<oEBiGt=C`%yL6x4Gu5@JFYt~&G)jOl?7TEY%Tnfdbu~tF*c8;25k8Y8R
zEk~`>=LreScIkj^QPyh2FU8{`Z(IY&W~B(h=1Y!xMa^;P;NE7Yp*r#ojEMory1DH8
z#$|pe&yKMJ%8$A?<Isk6{IpQDAOV%kYmJ}K5NSBkJfl4Y9J@C2$_F<(dfc-#<z_x=
zBWfD%|JhhZPl+ntpsPt!d7gFbka1u5Lh&N9jk=@LqS8!O?)_CPsrVunyY--Ny1Z}M
zx&N&R9<hB?x};JlICAvHJ7RCfcok+C2`z-{h(9bC6ajDB2=<p3gY(OnGhj-K!!IAs
zf~Thgd+MP(@x!BCd03wWmnQy{$E@Cyf*X`1<iuJO=*9!6q-2_Lonq%_@I+!8cBvD0
z&ljWS7p0Ydi$p01?A~b<m+Ha%Ztt<=`JBiD@tRp6@Ab%}oBWDuWz}yI_3vw#t?G>9
z`yv;)1L_-Znl=G%%!^nv*rit=RNABRp`>xhN<FCq{LQ%n8LAW8m&1b!)JlQmfA|Pe
z5QG$w*tVsw<~ghLSd5<JJVwgKNVgQVxaKNvq5zBT!Lh|+yuE)gTX3?b;#<Xb)B11a
zM2x^Op4;s8i7bi&ZdRl?PN?BwD%p5>3{!XD#7gGx4PWm)u*?Hu7IMHZ)Jm)w1sFTd
zOB%a;Y&{2$M(k*5-lpvG7boJ)12fy~AX2tkN7G;Ln+-F&^n4aYN13B2cSCZb83{%y
zB@`Gj$j37LqU6Vb!Ac*YZ%D*gcd*`;lpUA;n&z5f^VvTbF`O`BhVSc>e;mr_?@(dR
zyE}=;PE?yYB>I*~4+SSOl8}3o-^A*kklgSam`~zlVYjKVu<H^<o>U8bVM(&J+nNRt
zdOq`Z@V)bRP`h^+!MBcvcEBCDAUX1>?|$*c)~OE|aIj>VVu^tQNlYFb$RtO&|MUq6
zpI?;t*}n-h*m2A$;plPIACs8*(Zcco&#@GI$BM=XQKY<wQH5e29?-!vZ7UD^;Skp!
zU_O%>BM-R&_^M%cKdBgM%o3S}XPNw@9-qC$mU^_WqLUc1{^TqJ%?z$(u%a2>co@n>
zIZH)ve-Px<RDDp*tx(#`Tc*Ie_=!N>K^Vu9EnkB|&~1*l;MkmpOpSi0EuI&g_*Sl|
z^F%*7b|ug_02Pgr;6ZZe({|-|p5d*GnswCZZgqwqDkgZ^wi;O*DU8T7wCfZeY+o?P
z3sK(T7ne?$s3Zz0kOl8llOsV0x=I%j2%4Wa^rce)&G5h*(x>8p<L)|K-)o!USj31Q
zs{yN;r%XwgBAQ<jXi;GJLSVtj*XPSjAAg9#M8L;QR_D3>pc?yTU45~;g2v$@hXu}r
z^jg-PwfE{0L_$TP;z1WD5oZyiQCo~?o2ODo9dMnGS1t-zfUL$~n*=C=w$-ZT!?}<9
zxm3CBIlKOt_~)Z4h;s1Mgi5&lBJy?$hF|Ks=p2M!ObVK=>4KD>f~KS)utS%skn$)c
z1eMSBg5<}fqgZ7?&ry9R+cx`RIfCl!Q~#2dL7F69S2K{RB;!xYVM2&4ZPYf?njCOQ
zupVgGF#U>-<a@Mc(%AfDU$)uB7q2n~bHOc;*Lkv_jWAT4eKX8e`y}@1s-Dnz-^;<N
z0~g<<7<zjSkD(Kl{-3BjT<T~0;ftf5d)3PzV7TvOwW$rEykao+&*N&FUC)}St?WgS
zk)g~;W4CABmqr5}eZf)^vwlT?C&WrYy+>-Eg-e|??0x`iOtbVgp**tQ(>qUK4WYg+
z6e3~Kp^$QNi|cRWQ_v&27oHxC&+J1>9js5-u%%2?)3KKjZfo7J*Kc28uEuI@ixcB{
zW<MQf(N8}&d@6|A8Lad@1I@MjstH={D%^TfuB6ZG%2JKloYadkoCGG!@<f<kD{AdL
zb)-pxd|IBp42!WkjNMiO#+Ij;Qa!2OCVfe)H2A`+xPNjc#l{FITg>oW@nDa$CdS@5
z*tIg<{-O|l;3z)W?o6IEO*JD6<PKmY^*BBlTl*=k{JcmSPf8#S53RSI#sS0<$-iaU
z)7BMqoQoWNqPH$eA_O`{k7|Yf+^{fG*^_!H;-{Axe=rZipiyB-Rb%&pg+WAXPXsE8
zlyF><ca_tefd3wQNCA*^3oUr@gi#SFuJebuy^z&5hkds&I{!A6w7J!s#=(kRD*oqf
zF={#f1%U8+4$};oOAkU{#Q;eBvgRm1;(}E@hXl?M6?WCLyAbp&oUAb#<384#sc{9p
zO}|lc7(Ux^NFrXJH6jlx0SixdSg?0Is3O0Ei84+}lP5LslhC~BP=Du49Db6<Xi5NQ
zY2m+HgFtI}#t#=c*>fGbbC&D{^Cj)0um|)Lq<3rw1Ql$VWuQJ1gs#1OR{d96dES_D
zRDgPKls0mr2Q&3q#{BNV1n&T1l}M*%tXzeOKH>`f=eDi_+U+D$Nb<+u*;$Jp&*ugu
zl&gV9UVw%huIA5-3yKd@D-INkmyO-3GhUR}5vuL@#8cx8AwWJw+w`t@v_gXN3Cg!|
zyNLr@%qOpmAXmLe*U};EBJF)nfwMx}2uB5oI=Bn=3w5x(#?TT^K9Rvl8-s#^<$0A_
zqO+bui9@`UuCn2{gu~qJgR2OH6PIYAQ2SKmhSRf?E%A`tADWPsVPrxqW=D;wO&L8>
zs&`N7gAoK^_chIEVZ)8j*ig#W8fU-7xP)r`yJ#;;SlpQFGJ0frC|&Ov-Tbs8usymO
z7ng*lQ<@e#1`K3mZbLCJ;>E1yV`~u5!RTebkUh()3FtC(cU$80a8VLND>^j4KN_+9
zxpg&c_07qS8MTGlMnZ&1Cc3~ww>uLOaEs&^qJOLpU|PE3jS?XFtXD%iOe~PKyF{2L
z<d>8>YXES!PGmLBlXdGz*-Lo%mteH9D_41>+1~0RMgHcSQ5*J6mEf~kwGmg#_A6pW
z-y6f9DjrmtKRhU~Ou@wRUT=jMsg*=v)sfy!86awy@7K<~2<JZDX5V1wiQv?i82dDh
zrFU$%xT>q`x}sig?%&*O?;U}XI6A^+?M4qKo4)f|5Mk@7xOJ4oTSPAwND?=DNo5PZ
z7ifPFR0#!{Q`D64ue^8cOJ$;XL>>tS3}_%Uz6OeBH=R)az_YLc%OkCqk69s{lObvU
z2&q!4xu0S)?uvx?j`_l$%8MYmyA}#x@T$N5&yf_ADeIsA=F)gI#R=aJsc|*a*j&`O
z$t!or9vyfrl^9c%`x$*|B^MdHYH~Jv$sa>!=*=oRvJMD-^%}h}<O|8Vs|p|L>;}Iw
zePTa+zMGVUd?mYD(Zj#mq1@xpcfQ-0Q=K95;%}RF8{gfmJNJ0Twm~$~?SrB<w1DzE
z<;d^Md`f1}s$@n;UI7l!dY8D=`5!txt^2SChfkz$ywnrCD=%5b_gBprZt)pzbW$wA
zCBp^S?3L?=J0J-y2YGk0hAJOWTjif+mck3;LMZYs4w~EO6pWPzQ@<O7V?G@!zvsEe
z`<k*wzc9?HWA8&NroF>8W4<cX4REkS-Tadcjf=7dX|LJ!0SoSa72JIH&rpGjSPQWu
z67=+TD1UVH$f{cy8L<`@HO6P|qZ5#Au48aO!^9`#eS)%z`vF^T9qJ4F>l>J>UX)Ou
zRTVEdf6g1Dce7^1i5`c#M0xTohmX0O4*dN_dUdLqn<Qg!)%fqYH<tRakwZK0prQP?
z4M8srrn!SQi9hl}#Up7l%ibD|qNgfyh8r@bT=ieu#)!}8GoZs89{_7uu_0rEtue_s
z3;lT7Ky4Glxe^VSDeIC4SUSCPpYWUb%1lb#y32G)yb6n%ovWS}O)$PY)fi|JkcMSj
zcTo*hrxx_z(NM8d$s~F>B{L0?=KOAMrt7?@LV+EYc=K3K4&xHx&ws1`dpn5LrUpc~
zAJ{=(ts!9TKgPC99+%-_rccQ=VLOz_f6n&qVkfhAfy~jvcVJ6)k12%VRmj)n!`li6
z%<alUu}AprOTuRiY8CqufQu>xZBLmOiA4wh4Q1DL^6@QjFF!na#3pGSMffIz-D9W1
z;`)79)bqWR?`jA<u!#8M<fz#yif>rF2dRyV@txE=2hvtMN0g|GeVOeK+ryPv?V^aL
zb}j{K))E<ZyE}v816zZcRsW}F|4sSV%5&kUGu8o=)LE-XvnPiK_ZfGi5l8)CzF%!h
z&60ctpFAm$G#Sj^OD8Wo`|C|R#dnVi|8!KD;%^Z29aGD)vA6MVQgJ#~OYc98&of4U
z<5d`(Poy4*+|RJ5MHKchmad{<%xsyG+a$#B!-x%FAp1biC+4NLoTR5adPNWE{4eC>
z{@V+Nd#pxDfhn`k<K5Ex&$h*k^72I(`9E#GBzuxx_&A$XPUmt1*MyzPIrTWQ__rxI
zT+5g=`P*{nx2zTLa(=u1oUclkcm>E$#M@f_5Gk9k%PZ@3@FKxX_(-n>O)V=UcUIC<
z-#KwFflm)#mikhHr;;jMl&m_4TB1s|{Dgh9nip6&XN42&t(FF{b4xtXO)f~m<>4)>
zt$zptl(%r8<%`CHRo1#e(VS&*I=|UpFV2oFT{)S47Z~a2;qmtF-Z8H*`0N;bU*-&O
z&I?dF(Y_lfAWIZ;+D$;O?DGIc7}GuIB(Von@K;Fz217=RA&7PSDssaZiO2WTZL=n6
zJdoibRyjdNB~7&g%4zTVas2R#wJINnnSj^IL?>r@zXf0@!37QJ&)=d1d1eM3R=U0h
zogfnNqH<&%r^Ww89t-SUwZ|@}cj-MnhL$I*s8jEZ!+)BU$M+2EUKR{L^=`j})y^z@
z<|hki-O#XbK05D=TjpuyVER6cwLzfBSd;vA9n3Y&K00;PNp;7ce)}=pXGHg;aD-3F
z6L<Z-S*fp0JY0dtu;t5y{I#H@oDSZ9km9V)8spkAUo6n>$4}12070qFuu;PgI5F5-
zVKGI^pLNT&XeH^aeyWR(yi(MX6U?<-p0&|m-7ht3yxlH`6l<u?KT|et3v?CB%9(EF
z1mKvv9o92fNpx3j(UbostUiXHmwBrwGT_^0`gj=7r~IP(astYg(&#x@i`)<Ibw0OY
zY)ly(j#_MClg&`s8+4-=c)+r2!#mVXsf~DvK-TwkLIk(o?;%fcCW*1pJ*+>2h;wh|
z;4$UfaAm52U7}3zy;y87^#(ch8an@#G|YJXixLXk4h9l>t3;p8lj@s_oG@-xJ^lwF
z&+w{$I{YiDHFjHNao5Md)6M)fdg$O9&+7a-gykRv0Hd20t5Te=Aip2-NQexH3(0PM
zVi$GB!0;QV<Rm&X%TxJxSqVF^e?6gByCy>H7220Q8NIk^cpVX@MQ*0Xy4A6+OMn`=
zsnIEi9<i)kY$;L`3;V@e&%(|PS>GE|89k}0qGlwJ1CT!@y=m4j&u1YQ(*)T>7nHz_
zL*RPaO^VZ1^R;TQY=SRfeZJ#_>20SO4u0@@({tK_3!$f-VH`K$!+hWdGwv$AHBiQ{
zZMF}OxV{9uhZe8h?wUlOe96m7eYNxC-J6gcUut!|BE9O^sX(!Ui_GJtXNzS9k5N9n
zUa?H~k-BhJwemclQA&q(h=HVz>w01%q!5N>OE_f?s6n`u>E@WAet35ccm_JT??gYz
ztvoW6P!%Ss`;hX!9j6=c4}m8ZXhsy7{HZp&ciCggAEw8SvqCBrOkYudr3wN14aB}`
zyxN@Pfs=nX><I8VS&@1O?Z08ogZ6YryESZ;m4Q9$yt}gs#bAX1cYw1$w6x;M(w(<m
z-xP9NPIDo4lKRhL_7>D|X0rIh+cwAGt$ok0*v&*C#kryMwC~Jc8lohxb0vT57!wq6
zGuV{+8Ic<Y{V*k`i0yvaV8b$>-wz-z(2DKs@D*$LOedwBu{N{93oWVk<u6wr!$CFC
z{o~6$b<=H;F<+T2M&;jaV0@Bds;3cFIZ3MK!eEgP?6!#O|6#!J6=onKX_N8qS<*?h
zn;n$%y(Zw&x2~mj%W0@H<}RCQBqvAYZOK|6cyX4ZUimEs_jq)>2lI)N(Sr~?d)ku}
z%eQC%>;=qWyAV?9X@{}N%{uV6R-`Tt7m=94=coeK4Aa~O(8MoJhA3o9b`Bgx+}!nQ
zm12i5=4j`bUQ>`wXi9EtLQA6VWd%A&e*AKOP+EaaW{FB|T)Q4V9p~hTZ*I>1t{2Xu
zQ5=7XOA4$|-2dXb{FvRktfwQ;vm%~GG9OnEvV3v(%V}MrjGo5BcyQk|^zCkK^I@Bh
zPuvIF$w8mR@4ZSq^hJMeJiQY-8Md=so#u|Gyntc<@*5=Y7Is~RkGw=y9&`MMr90%#
zt1E7tRdC^dB?7qEOl7kl6&{rTgVbr_-mY~1^I!i;u!b#*iI*8xF@E0{#aFx@-e3Pg
zx`S8#42Y%kxKrFf2^m2D4^lbTH>P5xy`~sCm;crc>gnOOYOCQycU!s5Va4t{nVu*=
zJ&;<+n3F)c>_?6Prr(tJ(PcVzm`Z+_W|8vA%s*moP_Q}Wqek=PAx5xi2we@lzIz-i
zFS-T}^p&dpK7>84`uNDp|6_^{>st_<9;g)RndR7+6=Lw!-{MRH>--5HF8+M46Vlj+
zwgJ|cS2p$+*#mFBdDxL2J%7b$5rTWJbOkbGZswXL=j`jXi1#|tJBa}=vt`$Pega<@
z5X?dOq~)GXBSs^VfEMhn#?oGgD#6BfQ(|?P>lM5I$-aJ)+MxW!g>$h(mdN$&%vaGr
zIX}RDewnl#c<DCIO_Q_#3X#VEv#6eELCW7IYE0PmX`K<hRK%%|?@o;oI0<NR`JU=T
z#&6jw?7Rk8n(!)W2(kfTsJO$nX}HS`-+7x0zB2yq;Q8f`Ze7Ey<f8Wy-7GkURr(%W
zo?&y~4{YqJt_ldS*;K$IxK3`4Xxfxd-w%rI(GYWX+F%Q#t3D2hEkvl3luRchvsYcC
zJ?AELk7_WV2Pjge(0={UoaD<G(e~(o40s5UGkKii{UQ%Yf)ui^e1K5AKOEv|ORW{E
zaiGYzb76F;`CD2TdE231($-89bp6vn&~Wdjr)ou=yxH2%aj=)gj7;3vAFEB%pAWd_
z`;YE)L_Z1DsF1K~MF}X93X`<bR3JjftJ2LbUqf#{vSqL?rf(ejs@`@T?2S^YT#nVQ
z#VfzFyKthbri=X_B+Ve_1hiV$B*qyZde^aW*79NgR@X-_0O7II6E;HuQfBZ2SWtO_
z{#YnDL4Qd3`33BU&<U?QnT?-QB3PpZap}AxyUd};?Re{>Qtb80VI|qjIv;YbZKgz1
zSrW=SV%$fxo13$lXxIQI4rv+6y+TbJ*BlaG_DsE{Noes`?D!jnzZB|BVKow^I-Tj4
zFK3+`cd-1^Z9%*ron76lWWIuYn(tgQ63_+Dbks-I|AT~T{5chXCF$S(PRSAJ3VDh=
zGjw5dE*X%IRj87HAWBR+gpooXn)Q^Z<A-<U_&uvFzqY|A)yFJT3o<%5WIYs$4Bn=}
zM`}i>*mF}NgscjDiy3tw7T|k($zV>@#VV^ZBfeg-Kr}-3)LjJ{Jw;Y&ZCN*N%4gT3
z2ZIs1lug+BEkv#5>p1R0mFjk)<yF#KAD^D1Bj4_YJ*EF3@$5ab(gKg@wq5J!fyH_+
zkIZ7-9f3#f8*SQ-j?Yrm(mKIx<i|^Lojys#Bh1d6B|d*O5;#fhmnn#_v!m@&)X5U)
zfQ~ol2;?wHjM6Xnzki7kxd4O*oiJ{8sRkRyQsOj;{<X>3zsr6Ycfn?czA}4J%%5mD
zn{=p#)@lCB;H`KGYt8aYr2fLt?lQ7MEU0)v|I12gd{-q7{qSFnTr})4h1Al&nBQ;M
z5!wWq4GN{;i1u3QGQ5ynR|A{CA8g<?uF_i<mP>{zn}JD`h~5$eAsLm`*~kIo?O3=#
zN}`^UT+))-hfem%lYdsBIVtkAD!fn*T+(paMUM{cgsmWdZ}N&G-@#*IKHZ6Je>cW8
z)KtuN(Gl^VV6X^FGY;0QI^||39|iExefDy`dza_9`SR!ouhzfCg5HTAKX<NBqcU5i
zOU5`<)veI;e&9C$YOHBYvV1fjvry3)WC0!3xAxXvv$mXLhsMxhDgQTy+FYg;zca6V
zwxfG>d{5eaA?WcWSb1=B-FE-wJ_JDw)yr<V`i9hgY6Wq$)^#Phbw6GNM(%4j73mvZ
z`6*f8?<->1N-WKH;l()+5}H*$lV}q3DwtR;&?$9N4hHeg?~F{=zbc2;X%X6HR}@6U
zYwiiZ&41#5i3g?BDy{xDr|v&!Uh$|q>FGBV-kL$p?1VQs8z(~OZz?$`0K^VE2Aw5C
zdO9GJ5;Z65SJt67Jbi{{W$~PlLm590`bbKBXKNHc{PBuQvmC+BUy*yhMviW+2I-It
z10r}TiHSMpwj|)NejfJ1xYFy4Ul2P%*LCC_MvC&Na$E>tbJOBXgC{WylC@E;F?rD9
z>2j_WNkXc#2TF&gEAqne0xSJ7<43Yi+$XpY5zw<vs*tkl!bM$NUYEg{2s1f~Ttt%w
zze=`s;k$dFX%Iw}U7Wp8PjO3ZMyKYkIl{xM{;m@QR^To$Lzm6E=ew#)7>L(=Cl(u$
zF7VnhsE70alva$|<Tq9UeSTZiw4Xr2>NE7?kdj=w$<U>r>Kw^UHQ%hB%@0l?HOmCJ
zzB8X?UkULFxkspyQXK*v38{`gbL)<?KclGvp>+N*)U01Z`Q4O~&Klr)y9cbIS_0!!
z;qPBfYIYbI_>_O=z={BhWdSo(Gskua)-6#er1)P*_;YOXB;k*~c_s>t_twAMmoJ*@
zNtOo>Jn0qBVCOBt1>Q#A*Um&}2?RgAO@%iYX)}5ph4c5=1>2-`HP7CdA`9>4LJE3w
zHGJV{Qac9M?~lJPh+!Pv8;wq0HR6w&jYZ7~c{1GSCsg>#L>K<%c71#PwZ=Ma$C5dJ
zg#gPaLwkxDK8Vg&3U$p=B|G*mr<dnn5BjOPy2hK`Y2u*lM+wi4d4?P0_KeJm0TF8-
z4gA%Y#V%qjLWlD@|CXt42j>LOnymc{Qssmv?qAG01VU`8T^x>cn7N}U(b{@zoW-?D
zW)e0E2RYY#j6U>)>Hp?;7`_cjMFG0JMOHd*kVMAK(IyU0>&^V-*}H-0pc4U5V~!Yb
z9qBBUhlm>7#yLcZMyPC)Guh*=L<vVcZv_n;(!AP*%$kvZ$M#E;Qm~BvX>4Avd2}Ig
zX)H~c-!MLFto0Gk)<FN-j0r8NEAKb;A#I2F8!Rd0uz|O0GYS=|)fRtXRVz7gM{(lB
zaPG*R%7JM}LR81!tMBsVF2yfS+C?h+eb0t^cua<CtayG_a=?F2O1dG$D4Rxt{^^+D
z$d@*Ny}7enhYf(MSCH)@&c3)sK*a8IYMuwn77RMG6OC(%5Zy5$lqp3@y3@-4`=}Zp
zA&BV_;Ei$u`eKGy+)But+!yzIW3S5xugNHjP7I4Z?F~HP%pH-k(<vV4$A9{ZKRT)J
zJUWJlz4Ek$nESY;;}FZJ0%`4MhA}#BI4txY@ucFnZM0iB4Kn(?aG*9k7i&<Y<vX$+
z5qlc;Zi`EYx<FSxmbGNb2<%aE*u>MmEtU&e6FfpF+-wK`Un>+AeXB<TcNy0R)=*r*
z_Ig_5f=dODVB3qG3e^vJsfU9{D9Xg*$nKIU1>T`3`vqJ{&FM|KDM}bZed#7KRp6fZ
zeEv5!)W@a^hXyB!+bzgpse^tKqqF^D)8F*_;o`Tshc8D|JIk$i9?fd*r5f!q8SVNf
z<YFN05h#*B93X_qTPx*H1Kamw=iEE=9V+^3OOtrkR3IOoguEf0+3YxPhauJ#u%_WR
z?GPrs18cpWD{XAbH<zU+lL;+5)CTDRoWow@2mML4&L$4=-YU7a0lp2urEyoR>Ip(<
zJht5R<=<=@O3HbY=4H0Cf@|bb+^@-34;Vj6FWH}vsa%*qTSAcf8M^JS`mH;VF6i)s
zh?&)V?3C$-EQRPrzqm@0`m_PX1iCd`ftWP7YQom7Xl8MFBL!E8@)xsA<Z-j5Ukp=e
zHP4IL&EE`x0q@mxY;jT=Ja1PVNachlyh%daNi6CHt#Zr<rL<Q*0o@#pqnd$g!Esvo
zLh7u<#~x~4oGSTNOzS`bpE}?V=duSKqK%(ZUHCiVa>TWwX{#copr@>2MZNB;n|~l$
z@rY8&^gbcpbSmHb{v4DkUj^t$a852YKuGmdm$Ywov)20rI6p3JE<-MXUW3c-<>n+#
z8k<VtK9UY(7z4=^Qh2qi+@a#{R)vaz&X}Ug!a6i~Sz$wNs@P;a%*slkL2Xl;Is_W^
zE_}`v-Wl^M2m#cj_uP*z^xOAjFD&#6aL!${CGRh)MRcBl;__$6l9c>&rsV2e&_MI(
zQt>3s6|=Pb&Pw}jVAj!|D*3D)KZZ%qol)uBub**2`h8@a-MW=C>l4Gj*xhDkFYS$d
zEc?Wg3NK+7N}pgS#BVIH*;_7FH~R9<i1`RsJYe3KPhH)Xp9O*)ts*P#3!g~WY^y?4
z%dc?yJq(5w^b*V}T-#52&>fPJe;~8VU=JAaPL9_yFwvgwdFgjJTp&Po>B$Z3f@`7K
zF!`Af*_`o(KNXrMaghKl+u_B*MNZ6VNX(#$`ZnhGhl#QOvJwI>jFV${#s>YwGf(Z3
z5g}tmbx&y^VyXHsDOOKC)`L*BK1ti*EUA+0p9b_3u#*Oh0BLk-&8u)jykV(2nvl+c
z6NQ`nWG*<9lNMR2=^_W4aA%?To#0yHY{6HF&UKSHJ1J3@K890I+I?Jzx#RZOb`mm3
z_YogZ;nN`GQO7bd?2p9?S3hJi6<QC>hRC%W2EanvkeT??#bxi{Dnz*%`AGBi__7Cz
zzsx+YI^L+@lwvd9(ha)`b9~&2!WrS`uwJ0h4UEbe*#r5thI||`BO`h={~VF7P0Yz_
zcIpLy&bj3-Xmai&t)79Jk8_%AJ0w<?r)M}`unn9)#XJbkPExxbe(qVk`|B_-Cw^63
zmoe5E4CSV#H8l(F9XTv{DI}uBqfp$xX+#Z+__IoJVB_?jr&XZd4TO&6ntvtL;k+3*
zcwfw4P*kji2;L+9J9xJ}x<-Wm`-Syk-vX(^dtHoJ5=I$@Sd9U0WF8$n)xX*M)QVj(
z*-OFsilWX9-l)kOej}DkE0Sb|hPN2oRGG82)d#urEQj^o-_E9W?8J$=UNk<|@u~2|
zS@WNL`%yxv$Du5Dr{eH7+wpU%0&ga^cOeSeWI+{=`u26_{Pri8>!q}^dzs?l9ja$t
zta!sDq9F%VQ><9B!ols;W*WWDifw5N)ob%zebxw>0#7JdtX@+=Fbwkd=jmxnU2LXV
zBe}_OdTpf-4tW$J@@hA~oY_Q^(@20{dR3NSI(5~ka!L}`1~GqfHbHX*c=w~OZ$B8d
zX|1Ds={B!HXMc2GE?aBb<|!{6gzwNk9|H;?=a;+V*y0@_3II0=B5LYW^Gy$p`zz+L
z?DdO$dT7_+kN(OdA*_#;d}a0Xwbc*{iX>_!_YJ1f{CX4CV-l-RI1Hv#cnA6A6zk;&
zucbnE>Anl5`aV&LyYe=k?U1MLp2)S&{H?#LtP4k7L-(MTE5if+iVGJ|suj(XJw4#k
z2Akb_9rm;L=W*7);p7III3!AUFKCoi)QlRdpMcCmQnZI=MxqVb|LN?kqT2qqZ68XJ
zmSV-d{INpNV!;a(cY<pv?h>>}DOw~*aCe8|?ry;~xD|JbQ+l(<J>%?q#@+YjK4$!$
zv)1~qHRosUf`SkUxx%+i8}(769PZ1wp2u<RW3$HG3Sp4oIg4zccUe4>312&i7fGm@
zL6LDn-aHNxc0%mw1o+l2&{@gv5~E7*7%Vj=)`Wm6LB5*x;4=!96uGxW8nHdv4yBN;
z!x9ci<1(zb(zVNK^=rYNGwbXMET0HM6=0PakB}>ejHSNPl6)1jvcG1%TgRh=_3|J-
zDq*>KexFFQzv2ac!)Zs^$CydEMH?-i$`2!ZnG7$=hSo<!W!XNH*LN}u%AyCVmtKf;
zImmxW4&WPQxCG4qUKJ%$<CG$GWE&~{nnUU6gvf?zjf@g$k3m*ZvuDePsi%H^7SXbU
z2<8+_(6{U!Dw_vS47++xO}8}b9fpELTD}kFTE2pb>o7+C1tgUK$L8Vs+O(9%b&veI
zUPYe;1+ww43@MM5uB{mDrGywA#z`)bBBGiBJzrdgh)^w2bPs{@X@^%EV3_Q!!_}41
zH`s!41ec`FZhF2AkK!Pz0Y`Fy-cu$2V%gHxpaHwK$qf}jjOaG=Mod`u5;WW-zrHKD
zItg)9tN=8POmdp<<~S+$?NfdUePGGh>acf6`7kppYHFJ2iI$_hc1p~jJ02xGQy-dH
zrg|E_SVhmWGa-O#v7hGM=iI#Kuj}9mXdf&Anz#|*V9%zZk<8Y4XU7K?al@x-#V3IY
z1WH#TD|UkPX8bXQurX_x0`{=Z3}I;38P9Y%r}X4hm4>#;%2eCB`iE%E3`bJ8$}<*Y
zI^RJ8v(_iI1W$*r9yo0LuiOLn%qd!>3iRbiW&GHgBZD7MAl=+Vbb6DNjt(f&9VT+(
zz~#?J=Jw4A>HMm;KY94IZWNPSEtT*l1z>@{5|M!G(cJh)R+-?6%PFw{jSo1>Ch9cq
zMweph%eWPZ6V;VozPgwaW$FL6do_K8C>Wr;)Cuf&!^BM`PA-JtY{X~<DKqjVym3gM
z+1AA7r#(GGq08*_j+PqHJ{KY)J8WS)K0J3*i}zznt*V6;W|Is$H!0;>p7`+MeP8AA
zKNZnt$(x`yY4sar1snxb1~gw#pL#d9-9@h|Su1w4D;Te`+zJctJG@Xr>e^6~X<VZe
zVm&HE@qD#*Ni;@{OuZ-tfGI#SO^OJAYvN{R2;_@Yc&UYj37z}Vewk=Yr~NS5+NY1d
za={(&DT=7Z$$aJ`^P(yYZZT$c*B<Ni-3XN4B*GaH%h6D?AENxoR3iF7iet|TS&MO2
zl^?$95YD%oLj`Lhu8Zq+i{Po2lS|!W1V2T&{g|?*8wqkzTX(EZrU+TQQh^m0M{`4>
zy*ka-%^q~$6hvW*9y~Cf68mis&T@>8QuTmDl{KX@Qo80k&GL~6(zsNK;iKht@zH0f
zSX*l+tDP<SaeGE^F>}LMN_g>S7{6hGe7{QgQ$omH3s54CEJt|31>s2M8b%9ccdo(`
z)JviF?fu~hC{hC!ee)n?$lk{wawXN6))}^1UI1Sz{o^5(rn=dLCZIexQKqx84wnwQ
z<2>}VbJ_FYw@LP(?G_HIS0JUcvUSIFNqNnVcmY(H)%p=4UiLgfr0K;zG!YTDQybM1
zUw7f`<=&`9tMv*^Ru;6M*ef4#&kiVxM|wPht|S#`yoA3)j|PX|@*S*{*3h{Y2}7+M
z5}7mu4WkuAwhPeT-;7<*Af(@C>XD;3H<awEw|q?;CLZ(V*}zmEpMbBYUcqy`>%FjP
zKBSn_E3R0GXkBE87^}{U$Ab)4qS0awUhU)S$oP=+p|B_gpMCc4I0*kdk8`p7MEhk-
z*YS<za{-uz@t;*>{PHOf8}wTxzSFmv-kJU4cL=GT!99*D2HObSS8{23Z{!Gvq2GK=
z_!{;L?Ua)I)%(ac$8Kt(kRB-|NrvRd?w~YR;y>y{pkVr-hSW^()3{scVeOyv8buf$
zCEBPsf|Cy0{=|G{dnU_y4@vh;c#Gl8|7vZV5|+YoCODehMwU#EYX6!unM!_lujvED
zGVJ)`QNDf0u~h~(Sy+5V5j)t&cUb#5n#UQj{96%|!2~Vezy&yZ`7jrCMtEut+T7BT
zK8i$oW8r6?+3lnHWjUi*h^F2QTn-x859?}cQDE9x_Fa_h5V8F;l<@r+iFhZItM4y7
zp+`bszf^j=##m4e9B6-%&Qoorw2+($Q%?I5Gsv^6CAh)wP|{OVay*C*ePP?-?YZKn
ztAys-9UBs7(yRkfw(wwt1|;|@9I_btlFxi5LUGV7n8fXSmER7!prP-{ec$>Kd9FFX
zRcyYE`a_~Kfyd-#KM(#y)zaH<BQzYOBuebKTVKXRcrGZ}(FFmHy*1cU8WxN%G*onR
zG7R9j+hEJSU<XTY({8Y)HM&Be%1e29ApzYdFYoiC(rH{RJhE`lO6P9^(1wU9D!IU1
z#U(J)i?jzPrB{kmBl_sd@5;WUAuh;Y_dW+JQ2W$k6<E{x!2DPJTcf3X70staLM5cb
z?0<<`nw}IZOlo)=Q7M7{0t6Z5t^hfPaFhR`o#I$pawOsf%Yat=@~(AMg?e+0W+)49
z(y873xj8+col1TS)MdS(WV17jrZZ0$;o0lMifFHG&8YE74Vts&qA#W4b^(udW%RUN
zB88jw5A1%!0ztBN96QbQ><|ZX2SG+hYspZ;Wjm>!bgdYq`%8b&bx~vI^w7S08F-v3
zv2=!pW#%Ll%%jhj*y1|ULK#Q=Boxhn*-Zp{*5=Ch3UGX2quv+!9!>ntO5HJRN*Sx6
z8W635&>s{`oF=hu5)2YRtf}xAN^OMfp=upDn1I1g3TY=o`WjtAgw>vGWS-C&9tcJt
zMMXxZY7^^rgHf^-q#lr9YT~@sjn{DsQ9;dZV@pVU3&S}<h)+4E<azR4DQe*23HKBp
z!U{~%0#GOjW#Jd7eJr^iJ-!57j~&H%td?NGR4^~ML+@E1=$Z=5$`<>5j32|?r+k=}
z62!7N(4g3>kRij<cF<v<NAdYZ#Fkya_*l{p47V>7XRLb^99kb2|FO@rvMf5RB+nlj
z`N|%OU(Jjp{S*#YX_mGw7#m7dfk0N8pe#d;*#p#aJFj4u+~Osg4~e}>T=|7DHiH(F
zO$En~%lenfnsa<G${h>uC@oHhJr_e$13I#?_10+3bjP9W;5{deet~@gmgWL{ZmxCz
z-P*17Sg*{_=Ba07<kmGksqq@}#zH%>NEXpaV$K-dSy{Rl3!|;Rs0<A$i4&#p)VmfS
zHky#Ehbzy5y8NOYSK^EAc>L^FJgeNNJ!^7J%1tIt%bG7RS9JMmFBHY=oXzYb$Eop$
zAUbO`M=YennR3k?{;bVKK1E=Q%h&7-<LvY>4;JT-2N@P8eMoyqiIxn-+8L^xii{Km
zug8yT1SjA{@5icDOCeltkjDgVpap+)ieYIYt6=67SI+5Fw(p3ISBeTjzSpF$76^LH
zO&)f4ye9sZc#h{nc8@Gmx#g(e=(c5rXq@_Oe5z`<Nr}cFf=9VQ8*_*p=1Qy!mQyvL
zKFD%%VD+rv-*sXKie@{sIt6<_F_zRPYY;U4n029ZtC>m3zA|E}*3``|%V%0~^7eHV
zGr2MvNng!(G4j|M_X4(df9pEo#DV0A;myF=g^8Q$P6_G!<n&IZguuk^yAIoj%}2R}
zw&iv|9m5)g)$=d3rH}mMpMJ-ywdm?o$oxoSOW|Bx2jJ^gTKxsIjsZh&?Gwhuc0oF9
zT0$Cs<bMTh?B|bcNT#~898g(}wpi7(l<2CDxq2c-sdJ)(Ff&<YX5T>~EsuZ`S45L}
ztzn0iAs7lj$9BOI*5;fYX3P4Hyo<SJ_9GajRkg7ia>S>h?bXOEk8W+A9`u!nIAo*L
zH3rs#9$ciL39s*!l);Xuo_-}jeY1U%CT2_NPbpr<NzlVZ3Jc>faGVy=J5~TC31$;r
zDtN$wmfubO<LWcb>X)TQCN7MWQWspefVDPFHk3f6`=X?v+6q0Zt-}0y={@(K3rHbZ
zd03=-ia!bcK4B_1cs7&mGu`t>+cOh5QS_L~uoI^6wa`4e!JWNM`$h&goyNarVHp@<
z|68K_nRMze;LkslES3&lD_cn2w*kLBUS(Dh-yW~&8ZD-t>VNCXQ2-HC689&rN_l08
zi64E?m!N~Fm&OuC#tp8=gjHHg6SjTIBG^L@f2JM29%c$X8+h$=13q4Ghw{z{b)WAG
zuoM@xj{1VRrC-6{jxPFICZNv>Zf)RY6s7zmb9CfQtFG4KS=K<0FNaT_vhlx`V;tH&
z-Xc(w%gB(hHeoG8SKUlDU_`4Z99GxXRV6(i^e&2KsHy3P!4`PCwbiW2KKp9cMgv6D
zPXrS)1%r*Lw)8WAl=;J}!n)gssa6dKHcimhfyXgrb>*cWA+{E%My0785ll76C$WC7
z^G+FL^$k3sHM(>fmQrKIBm5T9eP_|P;$)C|b1;z?tGpmjZ+)IIA1Hr`z)Dtdpj<OZ
zETl4CL+|Hq)5oA@vAL~aiFTrv0=mxhZ_~0!#f>OXp${Ak8KyMK8FGJ;`Ksp`+|EI)
z2!}VVFlZIqdc7=A;?wWoD#9P8qEyF;Xsp((+b?i!NR`Sr(ABQ4sj|!6ESLh?9nv5A
z+d1&4LYAgHKq&Au7MdU6T1yg|U$5h2SF-HdsIC;gXyVUI-_{7i$zd^Zgw9BQBd1`~
zs>wEFLVb~RPhbIwv|P|QATc?OBkVKQe_!Y9Y3c~jTG9(osnbvl-`X%7tR$4vn#%vO
zmx2Ilw~BicOrptD4+~wvkMjbh4_#Bz-&E4aWnb#vb+CWIDJo<V9gj;ApF^QkcpDxT
zk{PvnFf~E`>$!~aN0Ok-Te<0-3wf`i_w5UrIe-nfIKoTx5$xZBggH)>8s5uP#OFM=
zN4k<I$f;`zy8F$1=U2kj$N|0E+O`W=v(o2U*{5*NWC%^xRt6A-(~Krm$S=s9#hX3A
z3&pmodZi`ITf|lM8n@ik9oKoE*tuP_X$w_O5I_t*Diq!E^0}5DWB645E-CF?hHP$*
z_f4YRG|0@cWn#8;S*XA*C$hC<5^cze&$Z||Cc{>50Fey<y+n8O880Xzaoh2l#0F4m
z{zE_~nT-9TNmKq?A8-Y!6;H`Ntj~*$EPy|vH@YIs%||8&5KH=Qsb3Ns91b%&9E1RM
z@DE${Cb9kl*u#jtl*4v3b}DSv7od=ImA76AQ&49SX=BUtsSs_97X}C9I(sx(D;)Yr
zjL}~1m>rn`=8Da0xBP%tEARb`*-|5(McQgIU*bDC5a+X>F)w;9^_$94ulI$5TT|}a
zT8hp`iub}c3lVPb_Vst0%6}h?-9R;Tl})NwHL;q2ho#$q`aFRL`Y*{OSo>!!QUz9Z
zi!b=~T-|&(u)Qv#ONULG4B3acjppZ%<kyQ!%z30vXU{3;U(TV+VeL4<e`RU@(9lru
z5bd%8Y&6UE+@?@fG<5P-)%6jcOtuAh8G_y_PxUeL_Swl>gRAygx*Xn0Xh*TQ$li2q
z*>U80fvXjE&dj|wyVdn@C0fal6P%c&tE*x*spFW7mYId`E1RPX6Q=^&3FR#Twj+U_
z5X;{hDjNGKK1=7Xm1(o%va#56!N9ZL&u?dXCSrE!PnCu>Q;1;V4A=H;)3vqDCf;j+
zSN7Thf=ojTM|sJ5e#Y%d31#VHLg~C4b4%g(r8oxt<y+(pj~oa)<2v5hhD2s&tIE5C
zC~E-9(3A3lnVgarlkNU`?~{CLXzjE(_X=h)AHZ0#LgKo~2um_>@<S91kItcBLLmLB
zf1JrB*k_c9(nv|kW^qyiFZtg9BeX2&=4n5tO(~xcaL3XAFM#u1bTO7VW^F~{=)de_
zHIiVMR$_bMxb@n$TW7q;_c7WrT3h$fTBTC&vf^dys2WZmW4Pee-d<-$k<TnF^=pVg
z$PLNfFvMtk&V9{GY?OIul!8WzDm6K#L3;6lT8?DM)Lr|5+Uh>(?(qDCXiCnKKKW^|
zx3t|q;MMzkzKzFxGVxa)o~as<9Q8|*0pDAde!RO@;>qYvW)T`vbP#1cnPnHfhhQ%k
z%VC(ow!iBUqveb(MwIT!+6o&D>C&5QBH?WF&bB2i$dnxD@+{*%!zg|HUT9dRyk^y&
zwbN}{Wo|`#*j0k-hcNPmXw@Px&S#^kU1CGwRd_b&jwWZ{lc=uO9c{vpV3~kjPHy?T
z#xS+aYR6GMmPA8x=w74&Ro4crAyH>O7~9We1@0!uI~XmIqLWxt4<pE7e75xzocRYC
zI6tb|3rAQOTmgf}9di1-h@jDG$tWc?fu$x6m$kcX+m=l0^w(NQBC5`O&@?z{jUVbk
zJSC%SP22A(ziVH-Q!``XR)m$h84s0c>>Xll(7+0qDc(r8>mGYaf6vTWH!~ya@Zg#8
z7ogNJ5*{whNP0Dlg_w$_&q_T`U<*!3_X*`q&{RFp*#oWoi5rVE;@OGDqC3yf!o5O|
zuPsKpE*BM+$yy-|YaA(RL1bpw)J3pq?~g@n4qYrtIh8bI>L~_}49EZz^t$%VJQur6
zO@RuW8A&+Pp^v<EFWIV86*0qmIqUs$9|w!pD4V=uUF$-_kwK{5%r4%$;57mYJ1;Dj
zQ*kZcjk6X+p+RXJj`ci$>|{ZHeyRw<d90;EOK`jN;9u)#O8K><Xl|{sjD0ngPX~5;
ztK|;~MPT*ed|SQw#K1HB617BeLI*EI?tY71Wa%weCEftQmcNlFTX?}}>z0ISxLLg*
zXjbEc=*y#>8Y_d!f?Qbs`YN)qOzDSz5R}*1ijWalU<zw|)*7-xW{aV8dmY;tTq97X
zpr{M3zf1FCWS1|tiYpV~fvuMJFi#orzS8CQVThj?yr1S2efm$(`mk^SFGFJAo8S+S
zu7(nkCk;}52CW-Xzzdz=+=PQRzL^0SvNCNl!I6|Jr!<f*j^Z23s(4Z|b4{f(E)>(X
zCQnnbAu(_zjDZ+(vMnUEsA!5GHm9j;mFru>rwYNJ;K0@A&{lZ@<sxmpB|kHbpY<h0
zZ;hs~z7AmXn>w-B;!9=pZoy;(pOYG=ygKHl2Sc~<lhdqrqjubyX>2)iII?c8{{o)v
zm3zKTzVzB<7EXH7Jl|{Glr>D{OHh&mX1vSHk_!oP^4w9sbCY$o;HSZx16hn#+^~qa
z`q(tI$&N18L9vuigu}nv&(|BiPrt2RRIsJlrD+)-f#?l9!TzMWGpVTSZpNuiz!D6)
z{0GtkOK8P^!xG;vTkOPJyE?LZzPsM2ZpV4qhSEG`H84eKk{6Jh0QKqR$8MVst&N7O
zP4(0`ye7wj`h!c}gf)zLP`_@N<<0F*yw(S@@*-ITf(fq&{V-BAAHiNk2G?&AavI+m
z?I8H&Tz>L<&PC0#%P?>Y#KCi>XEHKna!2()6zp~dFRtfUBYH-{o43MJBDycP5&{b5
zJ|H?smz%e=M#jt(hgoo>u{a&JYmS(={SDqsJoWS3Mi>W-^9JaJ%*@mwBY*uJdf~Zi
zk$YJ-w)u8u&4UW8;a^`rPklj#aYQzs31)@xT{sH|toHBIo4c`5+MgX-*h=cGhwWsb
zJ$2|K({mkb&o@YIO;CQ8c;aNLT?obOgV+ZAl-8aJo)Mlj=SP6<Kzd)XhS^3h8)*|i
z=%TNR<`Dqf%Jw4w3jkuzF;WJdRy<-#5Lf+sIrzVa)YsvuEH(qg8WO`O#IrUc9<P7D
zQ<x~4;99bF3csRh$9ht0y8N|Etbkm}+dT&VZUetA>_7NKB;bz&U*PoL&5WSGp?SrX
zxLeYE*V^s;+u-4R?ZLzIFMx?#Z13j0YSsg?%=zv@B@8^b8c^<^G^tVJ4t0^+@JP53
zlY#<S-tTZ~e%dc|Y+GQq6`WYQZ(4ttui#bbQh_<iQnDW5&v^~ZnmfHa{1*#z>?L6*
zoiSPI4{}-8uf_olFv*zeCF1zzG;aQ7O;j~le^H+%ccbW&w2kA-Y7K7pH2jIjIjf}l
z6I|<719oB^MvD;nOKvL6hH(5@m5-Z5ayUU*FSD(WhV?~NX0rT%B9)~D=S_8nMb5)q
zA#=Ae$@yXt)S<<@&1;zvA38D+%V1@f_Evwph_BqBb>}8c(f2#IsT^bGQ>L`@QDr?R
zwacgVdg3JQJx1p%2bPm@<qp4D0_BAKu<nV9QXqosaiT<-^I}`3sb3?Q%>WQ(fvyO`
zw#d<)nzaT6EaJtVb%|*K<q!uVtAL8LKz)~KAK2N?9~5}!J_*5EH@w?@lWL!n!l?|g
zZ=HUFLrI`fBU`c}MCy~)DTTeITJjLmWk2EBpV|Wxayk}%UwlFtG-}p9fcE1p@|ahE
zCe{;va#~0)@JBj}j*C@69E(^uefH2Jw%*Q~A{1_fDnpQKcfhuh;ui4pRu!hzB4aK}
zvG1>Gk$%fa?m*-i_H$pG{D{az$=ZwoNI9mwGUpZWOXJUWP2HW$oH}(<;oa|L#y9*-
zpAwX;(|=(A1t5m8H(`UhADbPAI?)z1ws=XxVgt+SS;$~BtrzTWQ^<%DB7QwmpQ`EV
z>5(&vIsjH01M{}qr{l2JrlqGi(i}6*LOy?T@<~xGnW34%MGFIijDI3=ej54JSay`k
zi1fi6z+c8ispg+i5rUDDc;=tRtW8;uqn4hy{e}yNeT-{(+M|opUWc@l%6vks-Z_6S
zv9DuFn19B85(?K21LpZSK~wiUR}XsUydP}Dl_!nq3gWIhLt{2llrEl!JtkD!iLlwJ
z<d<wfbOFT216a7CMWrT~%E`!!9?8gGK-gS#-rxb{F6h(YXYxl+g<8R_rxSa@%2Ea{
z)(;V+Ik51KjJTO0UenN77ZC|V%U__zz+qwUd!0LT9Ok?3+wE>g(R_jIz#QE_MbA`Q
zzUhhbE5Np&y)r+lY*{6Xw*;eAi4Cb4X;39s<DoyBZzGaQxS<n?9H#ru8ZWxGJPpNX
zLfbOft8~Nrn75xk`p}sVe5uB`OP9J2X13*kb|Cl-5@O-YvXfrav<yTBF5KKknENd@
zZdLCOzD1X97ed(ej(bCS`Vtsom)65ZVel*hJGP--kE@*+-cT-gQ$JgC^Fa}w)s%5|
z=h-ti@UZn{Q1qQYVx2RGLFb>1yuwWOG|2kiVHr1md(Wr&D4WKG`rKb#bam@JlQ&VN
z&9)R2Sm|1dceSL`_I}zr^`vRLF|aen#sCBxTOYLKh)U>MFz&Meqy7&m1w3ex(A{$C
zP|rS>kJ|b<sm~n$45tYjbt~GDl~_pAi7I-Ho;-0}aiizOKF>o@ay^wJ*<+;;*qB$+
zW#tYUNHKV8lvmp%qM=w%#Z<Q-{L3e3>HSxdKV8iS{a<}3?mU7wA$(rDsSOq<Yr5ss
zf!7RQccq8&Z0SsO1|rbwbO0s7#>-hoUSe~5=j@}AeD#Y7ZrTlBI4s>M$r3^O&9>;z
z`76JT!Z0;qDr#f)jdjR3e%F7$@&B#e{VxYYe0lGC+hd!OFY(_$@A3Cx08i5-DA+Q$
zCsY>O{;@QKrc%ca{{>vO43-_6+XE>NUm?`d+gCC%yikkp5#I6i9m4C=h^J`wZ;sI_
zVWXk5<X@NMHWFIvdmoz&1BnV_Z_hro`ujy3Hbs$0h0i1dOAy>33-ZQdp=hbCy=Rh{
zj)L((LKsLH?kYY`b8X-o?--h;oc?U&_6#p!si6Ms{;opjkc`LO3CA`h`|!0p?&jP}
zd|_{2(@gP(3T%w;_4W6a-0BBaa;tKN8?hl{!qgyqIQ=|tf{*vby?t!?BK*bF+x<@V
zUmXTL2cGW&t96*DAi=rkQI>ARTk3VYxMOh8X^l;-5xXysIZCu3PO$Q8#5++E!_N5Q
zc%sR<nyz0lJ`CVBwtIq&->P5m#|kbxFB80Cy?h=Fjd2+7$`|gIud&$dMtw%mhWSt!
zc-0b?D0uAR63fShsrObt3Pa~d#!PZY0{CZvl0l)poeb&2#8A-Cs)tZfs*H{ft+2|l
zEN{i)*Aio?Pt!hhbN1!22GQdud=xB8ADy8~f%UTiK^2n%lvKaKZ0|9+dBi@|mgNSV
zoUZJlRx;!c?wLoo5lf~d$Jx&w>p4!k1DS8>Y<;dZMt^7yNqZ^yFXHhSx`70tuM3c{
z?@kzk%wBH^A-!2Nr3V-9b;p$`QV7tRT}*x~qzP9NO{-`znwXZfRNPZMm63jmb0<iw
zWj@>~_LDu>@owfZG}NSrI=V`0+ntF2p0b*sA5@^J1*2D8jIbp=lv{Rk$_)9iz;GFK
zn+#pUi{Kbk>PucpEcA7JyXsPhkRe0cf)xqD^#G{@uk~!;PZ2dVDlIy0>jM**?kfb8
zu{TxFF*@%K{7JQ=V7awtogGL=TsHQ@f5t_R6(hyy5T|deo~u6ERU?)MWlJE#k+x`-
z4USQzV}z}Law%|~kc%*j2OyQZOKTWE3;2A#Hr6eSZVm{n&6Ai55eZjBH4@n7TF+HK
z$=p0YElh5Puz02svf7fa`oHc2?s1E$i1{hB9@Anf{;O#Im)z6yc^c_pbXu_!{i?5~
zl>w>lz{uKlJQOWkq&0{ANu!wOfEZ^w+X2ar>jvH^$8No~r;-#_Yh4J9t(I*hG9jj~
zoF?eT*1!$Oeg7+LYdlIil()B7sFLQ#UjUXjufgSAP9}8ln`NBBJqS;P6?S)JR2g{n
zWU!Yc_DloJ@9(8CVGQPF=Z)9F!zFM#C=&~0ujT=DF$FS(tUrGLLz4OPndGK0@t%3J
z95s>v+IcjhzW&B-d+e^IqjBQTAAF=Z&*W}!%=s=4aNAQT+ILfE{l>1Vv>ScF(^dwa
zre8W8dS|>e+<qwNDRy6vE%t|B=Dc^+kI(Ox?1L%xhMe4Rlt5~|x8ApnaW1;F6VD1l
z`;NkQ_iX!;+C@l&df=bTd^TU#1W@3>=GiIY(xFr1YA_jj`sKc;78_jNF7IbKq<>?o
zv|>lTDrc01b^Oix;v)?;5v!uup{7s^4c(Tge`Vw5A|F{0HzSp}iXvt;mo&Lb%F07g
z?0FO}(^E+Ob8U2@>NiXpU{LY^y9&sf44Gcy-T4e$+{_3*-X)}1*^HIFxR|&LoiN16
z#+st#fk&}<c~rJ+pj2R60Z=|;pv}_S{EssY%Kv$@`A<Ix8A6!1xyC5yBTpCV@O)pV
z;*o0lLXZDgGu+v!H9<ERfo`?3ST7pyY%yEUk0mV9z9p$1cV%%E-xHnTC2kqlLw48v
z%C_%9EiPDj1g@rqxmr?mAPuW3xcaO&$~XHy;=Wz}Qa_rEfHcR#E_<atdW$=&vyZ&%
zCp%y5ck(Jp#OCI<pGwNc#)b8na2AVYA8m*r;MsnGP(&d&zXUvFQ>hM=@?+#lu&jmV
z5YsUJD?%Y*4!Ov(Ejh&UEZR;784!I>AK2+-`9Kkv3--~U8sbJZaXoe^e{X{_|G=20
z#fLHXwy2ZBY#i0TADj%4<;#82i2S1|Dr-z7lFSaHWE-=5l+m05|2*=udnREa(<fsO
zo@#S>F?bq#Q)EmJ<?4(jRuL@R?N!g-4U;NpFp|+|w44Yi4pIO!dEl`Nd*Sl7O34wu
z8{f_}hI@L^AC&Hwn4Yeg2013TEL^qZ=GBp!Y1f^`Tt*rn)fgv~sl3dx{|m69ocE)R
zYyf--?i%fTHa=_{Q?W@ts$mp?3bn<^Uee5I6Zn>-930Xmg^|>TCd)MZ1(5hfljq9O
zuVf6X@ycNgf@#_bq7ysK>gw4)^V`-sS&?Ub;=U{ARtuLHiP~ueR(NN`t|2Ax>*1NN
z5Q3=(*oLlehveY2(0ru2R|fHQW^rK-ush`~^32%uVa@(Itl4pvZP(Jx%(L0J=7g75
z$!F`eEPX2Yyvi8)|6Q5-hO@}Ry+xF<BWblo+?gVld&8sS%SZ(XiOK|-?o4&2tYq;j
z-c>w8&Mvvd7MA-=XnF@*S)1Ar(trAxjJ5sNc~ADM9ux&pu&IQd28Z*$aW`Kp=I9Hg
zJh(UxSNxd_qUHL(+V%gtk^ldHF*l{k?7e7;u=(;rU$>T9rg0%U)`+3A7cTn+oyIy8
zfu8F}?=m_uzp6bw8K*PeF@JIYlqmpT_>p!8K^H&1i#&01$T@jQaA51JW%nndza)5(
zu9)JP;`*L~BR|Ld!Xiy9;a65ihnxtJAz8hY@RXZ3CdQn)!I6Q`en(FY%lQ&P*c7Ui
zqU0mIx5Y6+S&-Sbf1-5%;#p<<a&UCzzS5#O|DMQB1GM_FUF2oW3s)!T{C(xmUL_S}
z%mB=-j(bvy8?C}jn$slXlnF3LTx~7Y&*V4plU+0Y(>#8^bpHZ2*R4x&x3}V*>z=jS
z*A=rlN@;~JEEv9V3>$Mq-$?-nY|>qKg+jpghe!n0<}?21lX)LWyqNV32)WpU%BnBg
zs}9bjiJj*)LEOzyi+_;OzL|x-Y<CG9)E#dLjGt+4tUKNp8)N;h-7bznR^67-nH)#j
zZ)wQEsq`=4-b4~X$@mXMhP5pSMkT7Hr)m<<gHYsg;%u};$9lR|$|3mR%WY(M^rs>R
bQ)2ohE#`kJOaC??{JTB<=Tav27xBLU4;%j;

literal 0
HcmV?d00001

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.030000-0.000000.jpg b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.030000-0.000000.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..e19a87475ab6c387e9632b005d94492617a22a3e
GIT binary patch
literal 51750
zcmbTcWmsEV+b&91+f}2bNTB!viUck0@D>_q0)!?6x8hcu;IdYWwCExbC=j4X2uYCQ
z4y(9pa4QbM-Qo1zKla(zb>8nf-?yLfXUsX~e8!k^KjV@6cH;IY#dC-nSdHS&ojVk7
ze>IBRX$n<}hrj>+;P?9vA3S*Q=+VQ+lypxipFE*tq@ksvV`XAzV`XAt`QxQ9?;o6k
zTr4bn(m=siq7o7k?7XsyGGYqC;u2#2R&wXjqeqlaC|^8%`a+C@g+uIrEVutqP(QpU
z{ag0kJDe21QQx^sedo57f`x+Ox4XYqdxzqG%iTM_-Mjz$gNMIHHJ?-b_Uq{G@BeQ1
zf1SQhap$+Y)c0sOMDM?b{Z7ki;r^Fcd={MwyyVBw11?K|xT?p(-b<a2sM73adTxn*
zNvnk6MX5KQUY~wxWBT_z|Cawf)xWj<n(Nn?0QLVG`0bb6xqJ8izpuFS8}(gL8jgFf
zX<?lA>BLmr<Hc1ivKDTqC@AmV`Sk>MsVS5xF3<j7W&daIj=COolJV@^806%5T^H(6
zk%bP?84VDbVUfte0|cw;YlWOI0bRgAB=bRR)agZXG(tBUW%?We?0)C0<7kqYYL4!N
z7X~@}5CK+QFqCl6CHtj;LF&W1tFVz;h%V3efMk;ZrL|FOp~?ybvz_|bd&pM*K3L_P
z>&1M4z|)f79mWh{A4i9x4!gg=_g0M5b4?>k^h}1BlVC4iUz0O$a+^HPZC+GBJ;sT3
z7idHo&r;4CAVj#Agzvi0wByt0fWr?Qf<L3-M1KU%C53%Q!yPqFhK-cfo0myoBoX;*
zHV;=;51r2Gb=hpwWpf)(lCHXkQIi|OpHw9(%$|Xbe1a^vFK9O5I-O)y>4n}R!zc`0
z{a21}mOD#O4+p-kow1lp6qcK%1kc@nT6Zxc()OKl_V~@NujCL>IrD<vpw?l^Cn9Zn
z?Q((_`16e&V;h799yN*cdi$^c^Hu-f_wPX<)E)_?Dy-^y8w%eK{F|n)x8zE_y7Z!r
zAqS`xz|CMyf9_7>i(3ll?tJnk34kgEbCTQT#$W0^0@+6qO9i8NIP}0YD%NT5DJY(I
zC-V>Sw?e=oqK*ei*t|kpP5Rs=v+N>49q20YVZp(Am34`y4%ETaQ$(=L2p61fFJ#`k
zf1S78r@$7-@F>wy-$<J}Ct4wA^jcAatLf8zeP;afneWo@IA&Cx(LSjKzhs|}H7k_!
zSYCTs6d2oNUmY%ObT)O6EQ2p^)KI-ggup$9cYS(`iJ3>HA>&O~>eFV@_nofGsBS69
z9jB};y38VLIu2WhTt5%t`3IAoMhnNq6$ulj;H~isDc+m4TMF}=rq_x2*yJBIhdVtd
z#nd0e6xeAJ34=x|#IbkB<R-3l2|{xP9|<cd12z+js<pR+Uj(`;FYW#)a=N7u1kh#R
z&*F`cIf`tkbyp%(On*vU%<Fhu&7oUweZ)_Ml$+Jv=605hl}jtk)G<SusxuTIzMnhU
zhNpT>4~E22J3t&7{ff_LTr}j{CQ8TE3VsX&{F=vato;s>w>n0Mj|qDy?|H(pNo04T
z!I#1EG67treVrJu{Kj|6qTIAPyo^7$Yo|3qYg6mT#$IFaEyX%*1VyB8txl4m^rN}4
zq~s&E=l}PA%&$8ciMl#2sb}=4AoG8fdPReRPyFRaV&_R0w-ikiMQm7t#La%l%G#Lp
z2Wt!FSvCGSb@@|Mzpl2qv{37eWFQ~!cbzD$Sy~+Lvl?!%)h;OC$dflECYyiTHHjU|
z>i<UAQZNIN-QU*&(G8RQe`ul?hn`18lD-4vqD=ZCF?=occ<vW%rd6FI_+@!mEBEJw
zAHyL%5$)qrb^%}0z4v^JlS5t{HsH2hxR}WAtGyk4UBi*|DEy^J?|zE)Y{8B{&;m{*
z3`KgaH|tm04YAmzZEjx-bj(NXUzxK&WhM5|j?T<nptpnn3?oIwhdhibFPMnq2>WiV
z`s_%Y)&Orz+W_-ttqm<@N`J=lsioDcX{DSdjp&~YXOg!R+vYX6OP>hqeR%Q8Lfnp@
zjerBIIeaL}Wh)7}Fu%OL&hPG^7k4Fy;5y4FzJ3;GSEnEQ^F=NJg51+(CBt2|l}gsH
zYBJ2C(6Xi>r_u!#cvF`u6>qbSw63OQ%*f6Qg<$s23l@>hqcKK0`f&4v^{bEN$R?h^
zgg^J|&3|jN%RU@TxN&AEPhP(oz`6BH{<ValZPA4|J3;-y!E0q~;Gjm=gf`FM29`xR
zKxVZZM8NQoH<Wx!!KLqeGx>G)T3V&idFaE&p{PnZS3s8tYzWUlK%FPlG~)M3r%YBa
zkE$WCV}{?0@!o>a#If2(iFT|Gm#yRPVQ&Wng3#e!WwVC?d2j&HVhZNmu?ODR9-N0i
z9v3I&Vd)DRIzlQ^&^c65xX*g}F>i`~o|@OPx#!%&CFM8>Wy&=1cp=tM!je|p{qUIG
zgYUMh?SG06u;Hsx(-QS%<eL&ovST@uI2rL;V9%;QFnJUd|N5W*%1<Xvx87i15W8|~
zE3MH!dLiMNY8An`RZ-k|B)l|p^M=QW9_I@`zG)D-y}i_<r^Zgqcx<^O1)eC7JA2g7
zM_&TgYG|}U<kt5h8+DAiUU7SPd>a@v+JfpmMB(7sQMr-ypy<(mLci2hcm5`>zAy6C
z*7O|>s71m*TU<CF@5D~mu0a1Al6Jo<UwyPL1ivKE4zHQqw($v6ViR#9g`lpXNJP4%
zWS=RUw(@KcRZ9~~wG08O4UEloSXl2a)K8+;|FGR1HrsDby|7cC<L7Hdh%z$Ax2sp4
zD`n_2!kcJ`0dihkdu=ztScmsn53=jX{Y3&#1i2aYh}SbdPC79<(amzO?B$DrH(scD
zsI*7W*t$jXf;p$7f-t+$2##TB_do{e8!lEEoA<Wy-N?1(<jdK)0#e7xQnB>W*68Ad
z!G;FaoKh*6EB*7L@0Tk^pr1}mV_iDs0~_Bp8vW+I?t{2RR2Rdp0N3C`NLU~w8!39W
zB~1Uwyv098*k>|GtG9EhkX&!0BovLS&yl=_UB}MfTMSgCjf`ymxx$m`k;rY|G1|~*
zXMQRDJ&?OgzimmT&|rN@<E?oYQRG^4w7Cx4;$E*}z(W7nS5t!Pss;kaiL_*cl~a6s
zN3X}LfBM!#xu|3;9eq%F!*%m(y<2MhZ<pL2-cm?Eug!1j-QlBM932wRTILw6Y)_q-
zqNCO2N!wsG4BIadcNLPI@9#8G@e`C)gRKs|h}H^JqA7f<HAn4ij<C&Sh?{M>TDb{l
z<7y))v48GSdrVqBc0S-0JR0wInr>+EMY9A^?)y24#6I1+rLgk$Jy!4fZu+fVryafn
zY?kEa1~gU$u!Db$5kE&^e&(<ynDn2|teq=N?N0_|LO-G09oG?S4+Z*R8huge+YRw3
zg8q={*LjpSG((v^Xw=<z3h2uP?DB+kHdpt_!S{y>vQJC3f~_1?v^!hO#PsW3+-^*f
zyZdK>`s8-(loA~_$u~mlC|y>hu)r4AYG3dH7uu!*IlVC%-5%~>U{*<gTYhw`kf(&%
zAaxhVD-Mk_r}`h>q%R(5?~kHS{8`k*V7ldvBgO$ow-f=)Ioy1BP+n@SQ_9{JyW?5M
z<DUEG+b@vi0tI8I^W=b{-jmv7y3pB|__6Sc@BJoCbmo_b%U;_Vb5vco6j}#oc0Drz
ze=?|)i_%%?rPbRU9lUTj{2#&i4y3{gl9n)zGBsD}%Wtb3*3g^hq9n+T3<z;H(w&Fk
zg_aBl94i2hNePL@>tk~t@pD=Y#*<Y2HI6VN{-JZsb)9FFfU15$Ekl$?%sh<CVow>4
z)9W^Bvr1|BJwLaCMMD>SAS^T%>g^M(Vq@g#ZRE!>l9UN-XD*drZ$P&a0NjlkIacA(
z$i%dx!A!fef5<(9p=6B@1A~DGu2cOQJD5-uXJAu4BuxD@*ya*%953wQdcqA<a%PH8
zb4>5O$kqiG*N0<WJ|qOa$AS-SQV~C=K;8YaIo5I*-~Lxv^UtFm-mr4`!P|idBGY%o
z^q8E8xE;Icm{=fY*lEReaB0NIp$j9OF^=mfQU?u-kL3^sgV~?s>=9=*N;ytCd-J_3
zd)^u98H?4fH|FLV1yvUqHo(LOJ62a}h<nRIv7KyN{Xm9p?`iq>=k0hMBJ;50@Ywi)
z;(eyQEC^ke+AG|B`}QYq>f`JC#S4#@WkU8kLI>TG#45P}FDqgWK$k+nIKslr-LSoB
z1-83X5RKh@UXja;yv{`qktSEu-+88L(c^eL%XX1E{q|GJyJ$+u#}ikU-j_;D!dl8?
zr?<Pk`+@4ACj%AmN`AUM1GQZy8hnz{hH2I2w$%pgW9SD|q)Gfz0BCC3_Qzg#>bBhe
zRnFyAZR(<eGX2&Vb7)U>=JQJ^&k4psWhf%aiF{RHxw8O4g~{Z%eTdJiFP8UW{%fJS
zQQ%7~^CNJ-Gx;2ZbVW&~j7j<)nf|>EFai+XwYD@=$gB8_2W9GvkQR~d`lj32H(OpZ
zzKy*)zmWSR=Svt^x0U~kUPku-%2e3{kpM2t$e;f)uuM*IQX3T+hf%kZ!iQ_u+ZL<S
zWndnO#)*EQ<e!;5VL)};-az%pg}rJcLV1FVkWFl{Rl?^*^yVzk$8Ce*0>gAbj4PbA
z*dP(M4w|VwJPu1m-Dak>DHbRAF=mNmox-H_)y3?h3uCiN#Tb_fs}dT78-nlW2KV*y
zm9ubzV!=R$w}0Hn3ZK6G;=Y>*TytA>&E&Mx*BTdxsW_T%h5TpT)v3jPeTs_oUH(tw
z?6cH=rt8((G_AVZffV(kHKL4jl<C*vH}swOoOP(AYKbCQ4*UKxpKWo1CBga%m`JtU
z^&Sb<`dZ9!#0Nity3cNfA**;llO?NH&Up(svY5<Qy}h0mCCt~z!9-Vd#d?1*aem>@
z@Z@l!O6S>120!9_UW27qnJ$BhokfqPV0|>S_|Yvzqj~_N3Nrgp`emm0r^tmu(~+Sg
z#TN$}$L2c9@#$+zxUo9!DQskO5SH6%r4<%+W-}VnB%&P@(K^&NtZPrwiQ4GA>iALJ
z7Cf-;JGSp5Zs_#dGtON1=2WS!xjF_y3yslY>ifOY-9KGXS@FCnMj=>x|JeM^U8<*x
zi2b9fGbfO5)<rRwJ8q!t&;PdTz+754@hpV4mEeK~)X&)!b61TY03Oy?r5%6h(=E^w
zTI3E8iRkiRT3)FeTnpZ;49-HOPJYm|L4M0V+Rf-mvDV0Wp!2Dx=yPF?mTgjTmad*>
zQoNQI!+NGIq|`_!)^6o{0h-`im6FBXTbisAV78ZUfjUdSe!$oMMB}BNPEQ>*u*UWK
zMTC&zSmdNh4v}{m{;0=-fHEd)*Vg~tV0~T^|0%Zcl75H=6);n8OKQtC6{E8nO@gT{
z0ba^-_X?&kat#(_4P@V!Pl)#m2d%<7m+FB_`2<o^Q(onj1`facEw$FMPkcQ^sLbw3
z)Sj$9rbI@wVROvQAE-p^O+wl%^%;z4GXS3Lln-z4yf0=tBFG_g__SQ<3%Iv>uk@FX
zeFI&oq5(3N>!u!_;7X_HESMQhbTVSc7pNkxhtkyiKIVt-%B$q%GUvabEPPl4g#cZq
zOJ%=iD2KL~>R<>1Sj9%WIJC(dc#I(_k-n>|JaUZ4gfLYnXlRSJZ96Tc6WSNQ?Zu;T
zYUV6fb*9WR{9q#PTQB?LMFpcAUlSonm4E+O<f%U!G2Hw2TpK2gIxS26`taKF%4J~h
zXq@stb&63-6L~+=6(r1K%afwIkanbM*T>Cn7^W5rAYaEWcoW!I7}EmF3d?#-=RolK
zS@@#EItJ!$r)kJI<LO)ZbV<gH=cB&Iryg>JIl@;^$RQ|BN}Zb_Y5hW(rd{WspN{$t
zvfTE<r2%YrBcvZAU5<CH{Y7t}Ocz$^ego;rZ){uZ22-XAKjxUqs{RlWYE&0s2rY)v
z#HtIdW00EjKVsAV@l|8^0@3L>B~qrwWC_>??yjr{v4{VZ33-~8a3>tAM&)zApuuc+
z=3s(Ftoi-Mpx$1g(dv2nhu?(;lfau=*T2_?fDbN#dyNb&G6lC3=fSK6nzL^q?`nHb
z_567UX11>LLN`uz`8s$eKct>hNB;v~lrh_ZdpFucMGzO5i+98bR92)9>dda&=~Py;
zd%hb-Jvqk^Q<s$*dP|YxnsEJ$O}^B3O4=(?^!ZIX_kkS_+M^}tfc@eRRQ8nH->=_3
z*iw7u#j^m%EO6Ib7Yw1i>IaI)TNd^a2m08@@qxKTZtk;jKP*KA6;@PCmADW5uc1tB
zKK)Cpqd+k(vs?vn!=+>O+*WTZ1~vGZ<4DvQ-swp68bx;mE4#o*vK2V=?TC-~yLfI|
z_zWIVW0Uljdq?+967*ynbUOF1RPPltuB=&2pE%v{{<V;cy_!+nP<C!iQrKn4zUkv-
zE+`bwnV3<ti~M$kf~A_P{fc{<VyBOm&W+D)wq!zRd|903%Jd@r97E8%2lErB_`ISD
z^}c<YGf#neHGj5#_uiohsy2-dX0^omIg^A#`2k%2`26(9pLY!Yd-lX?5h-8K9J581
zynk^`E5+i%@kN)M|9TF?c5VKyY?3-31?hEhmJl!OGjIa>qIav}Um9bx)I3Me-fazH
za{=@3(lF(br9#k1qaHn>C3uKqJBFYz;%)wQG>N}QrGlUDra8fRH2`z5!KE4x9_`7V
zF(K3$x{`8r5=!;0a5T%)byggp9z*+DhA?hcvw}JnXz0OqiELyI$g?R+UApJ>NV>Eb
zS7WsQ7Z0EZviOsB$S}uzPZ#3|ccbbGe35BWtLaNbh|Ye{ea?=zYx%BIyhBfj(fE6*
zu=D4_ga+wDxwk9t_A4?a8mJwSP6(gGIUR{V)&xX6t>KZS6XVb8^_aq?GBmZgCA*Em
z{^EUBXZJrSu0^<12q*1}xCD0)?(*-^?a2^|&wc$%54*RVu>Xi23#Fz;oTvZ#TGMT_
zH0a4xk{{oR3+xjbtec+P0?o*i{2@xHO=qKJ0PGRYZFWYyFW7EGVPC+ECDn&sHdFR3
zBJL59Mtt?P{)VX>w-l|?`%3Jt<h~15ql9<*E}cJ&StXIsv|~H@BDppC&mm5;K4t%4
z2L$ad69i3-%mMyFM`2R86sIp7^@;jRX-AWEq6e-&yQZFT$c@^oXb8PbGjqM3SQ*+|
zLseh}t{Jvmm*@^HxL~f2g4i-k2ATy)Sh9Z;yZQ2=-{Dc9lVLg(0M;*_tMGjt1Qi_7
z+;)2lTyV5C4+*gjda|)tg#K{PZV|VT3{{hcdJ$|eMz%HZMA<qIOClTzEKjQ)eQ_-q
z^OeQw+kv)`>$=w_9QzrY1cuOzDvz?6r8~5_hUj?HevyMCRx`clJNI`E8e|5HY$94M
zRu-a&8VSbPR>I!4U6$X_sQ9Eje(BmMZM^afSk^c*&iO(vU7uZYa1hHB?>$MB@Vhd%
zcRS<%jx$Q|+g*&DYT3JTdSYsudjl7}N@+~HVO^Vso6c%^PbRjxT}cUrNTFQ!h1h$O
z%>cP`;}XMuS$4Ie`1wj~*>s=frL?4<1;O?vW&OsEiZ!e-Vz>gRV(eI@=tHw4@k$>D
z9d){)JBlM-Qwc=2>9!%zA3z$@#L~#?XFkFS$hGQp02`|re2Clox;N+(&X~Hrq$1=;
z%zcIxUJ<IHw=EsMP1EFBI%5NS<;!_<)e&zdx^=gd2EtfAS?avQ=G=T{bE#uGIk{_M
zXVD%4nHeXw6ma)R9?83m=!J+21&aL&yenlP$MttV-%>cZb@sa)<G~|%a%J#F9+K+*
zWWE0a#?eclM@SF?YZB~P2uVFXP~4#Tlj7lj1Nj}TqQWuU(5Lu;)BvtnX<GB9*8c1>
zv-l(Potwo42Dqc>Y;uHF7DSgjugBXpO!7Xi?xC6lKEFtXpxc){(SFKH^6H44udO5e
zLh&07TGz)$7b#e!w>hYowBQKgsqHQ%!17KHc+wCMnxGH;X~<a4?PEbOohqFv{-?e>
z(Ug>S*^K2m4^2Pec-^&bTk$k%FS}c4H|td-r0uW4>{^=a+CM;_B<Q0`;9X47qa@4I
z$aDG~d{Zr4xP=zX9Ib1{Mnzzdqt;jq;ph)~?BW$|08)_qSeiUo`|Tnt>1AbEbKMu@
z>zRR0k9cX#o_Dc3u+ga&3qW=Ko2^6$5G?ZLs@J%Ec~fJe%bfa!eMS7INUJrqOeEA9
zYFvJz4p`ju#AMc_<sD|odwSpnx@L^QF2gct(eEFjg_;B{kZnNO8wUtjp?e??CvR20
znZ>KI3t`)SoIH7s&=~rRu<GBkexKAu4Q^MV`7vgA)P3xb^VgsF)M$*6Lm95sosonG
zomo~K+Hr-pPsl2jg`nil8i{dfI})UX_1LE0@*Df$3Zoj=)SdY;SI_kDW^6G*+Ss`2
zJ%^3=BYOUMZ`KWMV@s~WM!Y45Gr5?O7>k5ClYR6y7m~7>NIOffOpoa|ifKlLanv~-
zE0_ND&{+DafY&@%u%XXwdYz>miy^9#{G~a1`<LClDFT&qYsuQ)0t5RKo39V|gCmp@
zXN(e!wLCS+`=f>T2ih)Je9sJD8k<H-16tvw2|8x}$|*U_?IpsI;cPm&SXOiC<yhT^
zYpEtRX->lf>YxIoy2<#{8jlVL#)K@xS2$CyFweYwuLRN97XhW4?@;nMIAWZ7EE89b
zOX-eAFR{gCULMMbW92G1pwuqfZ(_@Y88j0-FiQ}THfdK?GHV)Q?Nd}<;lq(=nvIns
zg#pT+XAp^*JhX|18LzO}=hIot0^Ro+Aw;4PG6TuHo-8syGiOCl<g*E=K5xw>>tg{t
zq=ivdqiX-BHj$^=R$R?c@p2>gfSFOQOtVDM#Cka`$2h~uSOF!Dk7!C&S3rcH_1u9;
z=H<1vxcOZ<5k-M+Mf!C!23DOrak$vLV!ks+P{@~OPU9!9M&ok+f=J>Q`I;+$KphMs
zhr3T~;qU)H4F0afZC=w{&AW(SFvHAWlI_vf={bzh>FR0Krw}S;Qz)@JhncT!e(siH
z*RmxR?vtu9#L7g6e(VB2%N#7v3U86NCw8QbR=#hw<TYKHQlxYZ#Kbl#c%Nh{m~is~
zghZT<Il7uu(|LXJI@u&ihMZetyZC1H?8ys9;^!De`qGU-EC3iH=CZwIht;l6ukn<c
zy5RDVok~TD^<QPI_U=bE9E+(v@{6gMjn891GEd%5ot;gJ7OE_@veFVVD?sPxI#dyd
zD2D|8NYL;W*7fHSQl%~9)U{w;=IHA2mZFl-?X0Jw29z5gKU{R#=C<?zU6WXQ*?Ahe
zGu41q1nbox5WgRLxHHZ2RB7oUzd=1gasU>zJkn^Z25u+~?5;&N<reInjiY9HMD?TQ
z*4sD6Zz-GsUYlMa;yRl9L%(WI-;kU&nEoByf=xmpdmS%1>Oecnvv7zG`SN^vu%FPg
zt76t!i!oPDk*ha4MNevid>7W`P%EY69#dgETK33GkQ3;ZLRd~jSzM}ui-$9pK=Mqe
zPpcDM6c}lNp^Zvmp?U?joE35sYkCEV769+b6|y?}l!C3M5YXq9zxmsazQ#PGXqh=)
zea7f8Ltlqxa5Jki>FBE_@`J#hhJ^ByiH*J39t#<7ql&`MtwO)Dw4z7mcv9<o;P~iE
z+(r(!qu7GzkvsV10qKhBh-}RGD_@@^(jin|--~|bj+2Kb>MU;wm%8{kH^|m~p&5Qz
zPjh4orP=+2YS@-)kWiZxxz|9cz;;Vvi_c46TaTTSJz1(7>yCOo!|5lwt%&_Stmpkd
zXTC8aQsYAzy8u6_qoGVyZ~C-KKiAHV2<)78mkaWb!YqZVOqiH8tYy*HWr;RJ;D?Ux
z@_G8imyV&ZK>1H+RdM*0@#&$+L#jpXZ>Q9rpQ0Q!V860wLdsly9>;c2DpvE}ob_7@
z)!6H2Ys_IA!|0j{&-Rl~pRW_BSR{eQ)aD@PCAJT5M@LGUtHUVOeZL(=&(PICIvjZ;
zwibiheDmu|P-9ae4OH4;ZMEJp8r8?EQM>}urlI?6?39{yDLtGXQ1Qz4EoF)y?=7?U
z2=Fzz$nEIXA9~*iuW`w`E)m9|OI%-m@FST#aSJ}HHR3}NX;3fU;3vrNyv%dx#{_rC
zPM3WxljHjh4TCdt-IDYX_aXTroLP|UF@qDr6hVeP??(>5SYvj|N@}D}cj__(ADXn!
z&4oXnz^XaxI5%Z=j~lYy^e$$w4up>-)VX*W`%Cr<9G+(+p7$weK@TJmg)oT`lawtP
zZ6;hC1g)3#*`!8eu*}rTU~Rg9;`gurwLSQ)1h5c+%Lw{_TK&PRnV87A!fPF!K;*A=
zdf{c<1am8%2ayu$R@h*-6hWX<OwOUK>8}Fl<o+#%OBh{_md62YB#}kJR6|G)yEoDY
z9q`4Nam5&5G&h>{!+<gsYrPwavhxIEJb!88N?&AJX_b`b%N(sLQkPlTN}cTF$!1z7
z*1u{`eP)1pRc|K#%+V*wr*r~iRtfhAlPK3t@g2kX&HAAuUAlOtmtzp$wKidsUdE|Q
ziXgejToia_{Kblyb^CK1vl@`I6l1k7Pc!=W@>V%OZfr=tlqFq@bF|i^*i$&a&qW}8
zwRd6@C=lgUP_&HVBet^v2xO4#k9#k(1f;@bYlMzC?i4L}D%dV<40_pOHwQWUCIL@o
z9)IBm7g^uQHPt2vVi|fhaSsK$!Tz6<fX>io+WBe+ET~z`xFBLKKGh7;mZQzsr5tdl
zVst%HR=SRs$)M3svAsRUwSME$gtEFjee{vBpM9*vm8eVKIk&fulLeQNyJv!<fK8Ua
z7YEq)kK|Ndz=}Qvv5mhS_q<R0DTA-Y;&C!2b$W>HV>o>hQ?$c7ER)w#xn)627s~0&
zm`U7TX+TXd!+}I4s?M8%f8YFZ^;sq-Z^W)ul3T6pi!I80!?sne?cOa&!AgHm=gK1C
z6#bzx_Hz@x3#K-{oO}J3E%1@ycV8W|+r^K&g&9o2pcmp9bKq)4CU5DlYlJTX=x?d*
zu#mAPu?1)kwN^vo$VEmbt2@d6;xXM%^tF~K#y<t226_rDV`4=lN4Psz?wmd`eeOYu
zt+8kyDz9rT54iYhmg*s|^AZ1mp-f?ywyh%~FBd~@;J9DkG`L_@UZn0=9VYmIDl{Fd
zJJ3R9M?6sQvAdKvj<dwI$%KJbsd(*08YEYSSZl9%soULOB}sNml&#`@?6}YLwI`0M
z{omp4L#bh*a9Ff1>dg}TmpQU<^9>YcwAee!daPmJ_NchU9<p1f(JyB(j1E_WPrHjb
zK@qRSv*$hG`vJ`%H3?6@#6F0Wk;T#<beSh#uy!922;%8XT75!XmALr!_xrD0bRD2#
zjYS$Eo<+eJ*XeP+g54yl(d_s_5p$h;Hhj4W{tUXgwc_45=F85eNU0+M;17Ws0lySB
zUO{8`hUnqqxdxjp+p%1wMvngd7*dEh%Tmg--a>CXym4Z%9sedeCl`j4N_8k7sdbpl
zv%rwsRzn-GWsd_@(vl$f;ml*_!&mF4R}W$Y1KF7B3nTNYLKcOI1NbQ=4F#kLJ9Um(
z=r+GMs!E(}Kxw1I@mEe1c275Ed+5-te|;lu{OKC{8^zOC|AiS?bPv=F9%1rJK3FQM
zpT96(^&ZF=TU2&fl1Yu#$H8;n1#5tg-ma}QEp@ow+o|2qZ?E+-!b)LM&2`L}0l*(%
z`D4w+#S8=0t4?qFDx~s80LJ5Jdz~XXU8buY*xf(1;n~$*2$6|U^fYhH6d$sSjC6s_
zy0}%>_UP1SvFsQZfip1kxG0_N!bJ;yh{O81QXW`8FMS0reJt}uf7caG>sLN;q##~~
z7MLm$m*h9j584QB|KP~=0BUeCJI5+Jy@)Q4Bg!B7n##c-xrfGy-sh=!9c*}Z{t)iP
zYv&gU9zl{P2rFn}YA76(Mr)M&emX&{_5hD8_oo@lwI_bocuT%WnfCB;*~0T6T6Yq7
zbZ5Eu<&VT`$wKXNB`({uVT$8u*Dse81jHKL`{StRx|hRXC^DGmbp~1v<r5o4lv4Xx
z+IxH;<n=|D11+(;{*M2hxzDO8NC?G8J_4B<dJJ-$@HAVQ9*WF0ab~6HzkwPYsa%c^
zqV+oqt_x9*t^}6B>P7+y0`p#=r+1*l<#>H~&|4fDQ&8CZh5#0*5q+jrSLNoOBcZqb
zoZLZrZKwru{5`_Z*fk|1kKb6Or*{BedpQjDs{Ue$FD$yI&NE84osZl`;TU>XN87;y
z?LdDrP_I~jcO?!bAe_fZz=0>vGCr@Oc1F`&`|8j&mO_k%DWcyibh*pp^A`676scs$
zQ8Xn$2{RhQ#S8hUimqsJEdlauY)uhzo1~Eo!*!L4aQCGabUK1;NxIXe4E&MQb+!;R
zH(WosbB(a^3?I3o6;Otbf?z+4K(q=c3sXdunT}+QHn{|{9&{C}8BxbbFFNA}OAHm?
z;F#X;?PfHQ>|+u2QdRMN4|M9rrOZ7|Z95?5PsGOXIUm<*VguE3ElH9ieq5Z3G?%22
zBO9_i!OKF(+4Z$p7WZCV{B;&|j<1XQ<Vqnuhi6`caTCtKSDxxX{F*AQ4FK9_qYg>^
z3yks&%&T8U7oMF|9P!(GvCle0qGi>6OZBpxO&K>~F}e;yeoEmH+^oi6zt0(*G27|V
z%Qi(dhd4Q!vN45}E%`_7IV>PE0NhAx4O=u^NnAPi%Wx#_{_*oj%iu7Onbthiy#@p(
zl&@txJ#?76S;+(!*L1AA(T28;w7*|pbdVn*-j}(Mbnj6AF97+VH{f;nP2bY7{lb#J
z<V%dznK5|M&nfF@Y3)j@UYo5r(*$jH1MN9bR~Es!Qq`smr<+J1Qjwg+I4OQz5+J9b
zi3<|ep|jA#08@Eom~k-G!6-0P2w59xg^K8>c-fK-d|J62{a+p@EF(Goc|`}<)Wu8p
zne}YoAz!~*BzuPECDQk$W0(5u9M3-d&i;GZORQx5%FU5PBZrFU*`e}Fcfu%Mch1AL
zC!X%Omb<W%tno#CXT)_h%9ngNEvSzYYiF4ZU_^AoF__$)Ns04t{h@Fh=;?fxZ@OqX
zdM?}_jVX`)T(Aag@LtzzTSPul_jINdCnREXl?qHL6|X!`)bQGM`ZY2odC#M{tWj@G
z_Fu)u?<;3z00K7KU3E)>$%+rL{RQMeZRlUnoV<%7dpjh%n0)^6d;91_^vEEkOSyyc
zU60Md529|#ZNA^xAkH83#Nhf-T7L93Aksxrlc+u|f6)!YH`VF7>W8}QQawQPuc~FV
zUN24U9O375S|%XACc4GK?p42~4UsU2`D=PpYW~!uNZ{oinneJ6%Zm=OO}c-XtHiW)
z#}kHq?)AUdVYmmr&C;9iW#3`-a6h2%Bel<N7YAph9i!=zup@2+2>MDpy!}-@L27s8
zwd)h^z4CsvS~}3t=2svQy2P9Vmv6g#f;vyTT<M}qoT<`SMl9WR5Ga9XILp$v-cp2c
zcf#<7-}4H#%tAdaf$9ar7x6Gpk&k5^79*3SxK*z{%Z{=q_m@V0w?8%)*DGsw9FES&
z&S1`Mw2e#%)ty1nZ3;tHC5_`V5Ii;JgKd$~i8)^Vp@go(s;pFxKB0cyu~&vima7L1
zX$NmNo@7MF$QEzY4Aa@xPXSL9G-qd&oLNCUhF~!qOIr)E%kgJ}VJ|VfP5tLb)Fy-H
z2&N-9J#v7}BRe1K7zsW?m8g!Gf{nnEtDJdvpXiuvtM|)Mo1_{<8HrEh^EQY%l7V8O
zX;{D4$QfP!ekv{ff5|=8V(`?fjzn@v`ZiffKljGnOEa1QqW2O@nEIuX7mdWz%)>`<
zKHBH;2QxMbNJoE-_WINF)QzS5KHm)Wp}##i^t|Q_d2PB5WEC8rUxFx28GVbB^rYRR
z<=dn`N8VVjjIz8S9|UtBKQOnxVc7@8Y+W{Y>u1n=n=ktp7v4mCR}#5WTHIe~$ihJi
zN{3o;5Us7WX>xM!<?EV_9<zTa0RIWGcNX|9xFZ(7e(k<tis3mg93SqebLrl->T-Xa
ze)=3Uhq>?%613APT--+?IY6KuOd^~-IT7IleWWtbd!W;LT^u<SZGNyILY0{^UZ_{W
zSG1EjUDcXUk|r}VZYo#7S~Z$NP?rcC>cz$t<&A=ELr5`h?LV&E-7iw?MUSk|woZCB
zt@>CM#Z8~Mmo<&ylI>(g{Of@4KCu_34-=QDzFe|!x0f)>{17gI-cqE5R3K7oGvd;t
z+FjCR#}mtAqsV-#q}G1^$=v0W$k~{dy<Tq~Lox~dqOov(*(v(Cd|Z{v3F>6_Hd>l0
zD@;GqBXcpWPDr0FX92gE3~Ocv<_k2%CwX}I*lhfwwn4XdIwUeSUKGVAiMgYk;!DNg
zkxpN6P^!N{e5O2Gy%m({20t8+*KP4eIwLkiOk6C&hoRHA6tB(%X)eEnq)0t@^|c*-
zW;vfN5A*e^SDZR3ePsDZr4PUCyOu=}-;val62kK~^`&U%)zOaH9dkbsm70WrzYJA8
zVv`PmGuoXV=!}&SZOiD{-m6bFnc8?ls{zMj0E56Kx)ACSZfvxhCJ~jtGtAdV$-nmU
zx`UtInCSP%Z!CuJI6dRKh}V9ZdQd;)1Iix2DNIfn{0MFHa5W8#w58O3uB-3!B>ynz
zb?f53=~3zHGX_$hccnE@y|>i;fZv_}Lv8x0X12YlV~TFlR{ntDTzTr$Vo!xfr6ePv
z0%<wHR~7fI>8kDglj<wS8MRNF5{`O;{vRK4M1dLIOZU_iO?w^Tam`bbiwnShsS1?1
zocMa9t+UI&_Gw`Oij=n$PRR?Z>A)M>bhw|f#;R3e=kR`lhAy>u2O@xPda!reW&3Zr
zdizUf^NsTd(~h?k+MV4DtWe3I$||1Zl5pSDn&mQ~i>EcIm1y>_8?D#b#LF!r5tdih
zv#KBR&an;TFxrS3LKlYXD!_)#zv2bJS&5r68$$Z<9PTwpASvENk6X8kAs4;l<){;8
z@3hs=?Fh%osstR9UyGTvk#2U(LRE-H8VD_8AGnj#eg2prF|CcRBUuIQrzid;g<8HZ
zch~zo&<!BqbzY37#Qc}d2Wx{R0(AWR24A~H5Ty8%{&x42eHVa?u1{eEDk{iwJgh0f
ztfPhBye{;-qj|t*;u-J+Dyc%_pwp&a<Fk1hOqg3aHaulFp}4F0pP>25y+G%OTQtZk
zp&M0p=n#zSmx-fq?Ss<8dMi>#%Y*Kg4|#0uh;j#U-clTMt(KXt2q=#I2m$R)o(4i<
z925HJrhHbs#>oK_TKw<EcM9Xu%n&$aj^>eq{1;u^{UpPmjho`t^RW#Q+b|=TmLD;(
z=Y<ewa<*7U<bs$P(h6!G?h1o1y?C<uCF)4)CR}E|tAxDMru|5zxDE33xFRJy=-UG6
z6wkXsWAFXxfv%}qsYzPoIN6Y9qtFc_SW!Nn8>RE}=>3%>e^HgwiGX(Wd*iV(vyzbS
zYwfQ@r-;Gvwz-yLwJ#tqLI5&?1AdAI8<1DA4)R=It9R(nEpf$C<!`!)g-ag28DkUU
zj2ojRV)%u)aOD(;d)1dqK&U6ArIw4yRoP)#il#p3-i{fQIJ)TI#cbsB*+~ZRvFeKE
z6_@)^A&;&^if|g;SBa(B-!NPCZFq_9Dj&C+cW0zzpmK_hS@z}bOn(}PRP>DfB&BdF
zxH&^ut8y_CfzENs&SBJ=5_LZ37>N;}uW7sL5!8}y7%zGI-mzz~Tt7`h^*)5DuO{gE
zMjMwNjW?WBXoO}6M@s{d{x2ONqI#hSeH1k;ziV~^>Dwa6!&zUZi)V+1<+OZj<VOWZ
zwnvy@eDLfk>QT9k$Jf+y?%)N!X8s{pvk%2ST25#{aco|eb?#)^_T!u}v$l<v6+R)3
z`<oVkKXP|_OGFTQA8g(2iK?CM+9Z-CO8SXSboTs`N*-F#7{p;Dif1&pP02GW`Y9qt
zW*mnjeIt9`w9eQ#mLM=`6KeyE0jEy0sIlyc+UprH&>8kfUFO3uk!KCabDjq`kQTD|
zj5<~`0{&3uEJ`zWG%{dOpCx40sc?t26)y2^2!v^(tAPA}$F<26>v2}nGQ*~;2}>I_
z>3j9Yw-lHDQ4>#H8B~-PMV#LZP(uom^sWcLxXqXVRw7bOKM1w`n9NIEZblZZB-Ee)
zEb406$qB47MI6?C+Y4*UFiCE&9S843BRi!6UNxxK$r>%Z%u16VLe-P?BK2LXs@VJi
zEwtQmqr8@`P1oyNqG|3V>|+6|Yz4P1XQAeIcWqA_quFD5E#IVJH3kidw8TIAE%ESI
z&Q;D{a^2B#=A@M+8P5UWP~9f|Ed?ha2`Rq<n;Q3PXtxm6b=%hkYPEZ1*jIGz*v2ew
zjb==t2jaoO+*bO-+OESB3YzZKEK2;32MeK+T!lx!%vAm%dNT8t0xP5Zi=aJpOYwtM
z2m1a$pqVnz_=$quqc)3;TM9opXAm+VH?V~FQ8x`#4B97Yo2k0F7QU_hF!|(!sp7E^
z{FlcRz+Gumci?><_IV*Frg@*AuH<X93HA}O)(c&5@vDSs<;t{G$gdz>zd+}qpPlBW
z)l+YBx;C=xqH+1CyMYPGZ}BoYKrN&6(-q9*YH0X}`v<D$=6e%gp@Bb-P`_48hMu^8
zC_Uc4+VODFs_|@G;I*#|n3JBUeK8Zb|Mi23TakbNGX|*1>@Kz+B;2mMJKScup`d{D
zzy>r4>1Dzt4rSPwqZYrSRUfJ8@|*_dtj=={-%{*_yufPlEi4E)*ua&4g|%4qyRR+I
zf+W>aFNbCutAx~}tQ=&0(1^k_REc4+knvypCeo+XOmp82$A?#K2{1=V3%;Y?f&j^>
z)Zru}1Eu34cW3jd_HGj=08H@gVawHMlO|R@A}gZsbCQt+4t5l3EO%x`-I_lIcgtcp
zb%dOrn6LYTmvG#U?uhYt6xP0_P1f<|LsF;al!@EU^GfS^Q5Pw6nh_v_6KQ7PYc>8=
zty_+zqNr|3!EEC>mPqEug6^*k_NCX%HbC|2-p&)384Xikd{I{?NT`(Cm5t{-uGE7X
zdp;20jLoG#j67w9vOk0;9Xgz6^*q(y2Y+SbjJ&0wXFt8?PTJTuWWaZTEH;Xo#LU<d
z=0sL|VT&ZC!(hC)O8XE>3tX{ohLPS%40&??>BrFecnv5j=d5t6>(Yk3<H!o%dL5g5
z9N4nuRofMSDnVfPx|bDHmVa%39Zx{=<;%Ae_*gK=2*^Fen89%nM<N!>J6OxP6Lerk
zCA6*T<Ac4+%RAH76q9<1m4iRN_z~qdt(`=5eTX9O7%YErp@b~Uz(fh^U+%NO-^#Ul
zr?p4c*BK%X=tt2QZ)eIFzke@8q6YkYT}xo&kpGb-;3zhG7Oaupa38ENUczsxrN)Qf
zqsuLZOHZwkL%f?qLsIVdburnHAAXk-)<sRjfd*BMdgT5O3yhAZ<e0B1-C(KSR!8xk
zhVTKo!<k>M0~uqmDvXsGKo-L#nSkSATB%L>>jHHczd;P^65(K`PY3WhOoM-<iaRBN
zaD<<z7+R&5BAyWtA;)4pv_PJ8L*qWQK!s7BpX-7#BiTn>4<BDlF6q%}+_|wCX>3#F
z|G5Vr6LSk0-m$`e>baf;Np9HM3jumRWe_0317yu*?4t3ZlwKAS;Zg(t5i6_XXI=2S
z<5__3&jwgh0ajjCYOBCm*XDtPW0)S65hoYCJ|ZP1{4rHXwjE=VyY+W1(#l9S`&wTm
z+hr)V5IJvcTx7MWU7NQu5Z~=QcS>TlTcmbt#ourr%N`_T0E=LnWUG*r2>9iofAZGp
zU3^D?YWP1owYuB<3FaQuXPMipLpmpyYj*E9PVB;TTy|vS1Xk{OMZ$8lsZ`RLU_DR_
zf(y{aZ5@^B`5%l7g<row^!9^Cg>wsgq_ZR%mu^u*$Ck-JGvc+TZ@;V#dl(LA;q-IO
z=ZerhZ03E{Frcni&ilp9L!)liui{dfs9-CXi)|I9#uRf)7wdXvR9qn2Ly!|KmZtW3
z^D!>=g`aSyz&387kt*>BH6m70a;G-^N)n_OnP?UvZE2%B^vO46YTjSlGxN(L3A>=<
zB4FRTX_+<m&fjbbQx%@29GS?T9s}vmxp$U!OYtnTK83Et0}u1*78Xe`;xak2Wh|u2
z*$|l-P`GP;Z{)xZT76hip^MSY-l~16{fntmruc9ahFDFqDQjFshbNrnCTFGP<sp#d
zU@4d_UTEjM(!s#r$!k7ei*NE}a#oZn4+0D_q?U`MK3wOoK!TA$_iYCj8+I&fJ5#`2
zvpa~#5Q34AA>AYxWLn21q^X(|KNO@6PvqH#0~_@v)!xOD78?M6uC&u;wlHc8nS5}o
zSgDZS%^K0QS~Wy`TBVH*bOU7U2#h8LD%A%sCg;dK!j-9VC~2~I{7QBDU`1>^97yR5
z4xs!a`)z>d`Y#@fM5>Rbh^L8BRHH!?Lg`uJQ5W5X!87~L|5YnU7v5q2sLWX!_CkaX
zSd93yi)lZE=KC~`8Rx;P_wmd@&HN~rN0)g@H16E$eYjN8is{>8QBHy$Y*?<TGaqRJ
z$ty@|pd=K|E?2GdAh}rWUN*eZV7R}B6Ul-N!nJMT(5*EE5Ll5-cUfNnTc37p^?AJp
z<T8A06F_#q+?@F5ZiMm8v=%b>v#zGO@3w8uU^m!sqhU9mbuq-tkSB$Rw;dh>{X9TK
z*GhEj7?*AXl0D_~6B<TF0pdT`GCrCtWqlLmZ~CX<4U<5K&yF3p;~zvpRWTB5-J(?`
z-Oo3nbP{JP*I+&U5p_tT_SMm?LeavEaNtoBi+fy<fkrg-d3h(438$jUKx7Yv-AVUE
z)&)k91NoVH(TP+z46oHQYM4F=Gf5At?v~F!RuUwM2JN<~6)4PjNf1a|^&p$QCe>tU
zPE-}=v#Jnn;`w8uS(IL?ci@(73`nSI9o|@e-7{o#wDf_rnpa;XzIF6SAg?wBxM&h6
zDQT)fQ|fL6*X4rA|JZPeUK=6u>+~^@Ycs;jxr{y;$&~fDQ<C_*<HiXRZH~n;G2W%T
zHs>jhP|qlspYc@tTdg0nOyWS01i}Uf_aG*DB*6FT%H~5Jmz2M{a%tcnf?$nIXL!!#
zamn*X3T*t0{Dk-+4RcSIyVN>&TOAfHkWl051MQPX+ZS)1>D&2MoeVs{eQ}nHPr$*a
zZB1?|cz2Lm|1k}|e@6L+3@rph4igWhSNnaKV~zUD3|$F<nYv{8JGv^m;)+6U?Hb$f
zx+HzU)4<i;>B#{cJ5?*cmSIH-(m36WwQVH=pOj0B6WYecLdC<o!w4|v>_q<4DASi!
zAiH8uRYp~s!bb%IzKZOf9g?&Cu)vh&97#Ao&8*|ssp{wtfF)g$#=bz)@sqjQ(xm7C
zIf9(0%<gB)w3~xDLzwpV<L@E8FsFS3Z<M;RxXYHcKtHnvG<sE?C1dYgG`@W#VAU+&
zYpIaM#Js(5HPX`kRivR&f|F{Bf@<=QY_hP}xS6#MR-vy(zS0PQ5YA|h1d~BZx-9j{
zDl}rGw&u`4A6JyRQlngjGi?`J{B_3@Q@OJ#2?>urkrrzAB|yzcSi_FT`mkquc3KdP
z9HQEmGp`i#<f6&S#BK#@qUVYPY>CN`N0lDXU;W*!z#lD{hGft9Jc@d5XaS(B;kIZg
z=*|;1AqBnb?63DJx<-ju3PM?xGB|V5nA!0xJ9shhni>sO0ayNgbC6z~p)BTJR5-6^
zauXVqjnh5g+Z;9zqVr8PbDdyy3KuJ{7Y<&ooUR+ioPLRzjc&BDizSNurKbE2Ib4lj
z%pW-;2pkz<Qqcm4v(<U@5rf@eJ+w-H5q#zVx+r5Q0dSud)JIBY8Jqknq`fWuWE<(V
z09cH<{^zytFka|e-`{A-QrHO-!qUJ$X{={PX+SuC(lW*{lxu5u|Bp-M<Ld{qFZtoa
zTlpr7*<0z|2}GMEaKjM@@>SqXMbyi9o)qb)u;Ik?Vq`_T1}k@kM1#TSz_-@f*lIwA
zaKV!6;}g1)A?T>((zOOc^V`yDC?YN?x(8MZ;P}N8hMQ@s@i!q^O3vm7*Say^4u_qU
zd4OYS2_8OyJ8HEyKg1$)&EvgBCL${xgg;~)yv5Ua|7(K?uyYV`k1Rarq83ev8d+v2
z)Pbe?8xJlau>A0{Y5ZsyNQ8G#%K!)DDSz)tYP9YzKES3Wi;db>D-4YWtJp1Kxktqw
z!r}VR)yIU<m-Wr!Zlm%KeXB`Dq;gj~5(yH>4@s*xC%js+?_hjn4Ea*UJ~7r?;^VsN
zC~Cs!D~!!Cl244~Xg3m}Qmy&C;I&`k8C|Nk*>!=T1TlRz8qR@BrAl{5)mCunKQ7&6
z2zgx%iOgdcna3Tg%O#eQx^E5`p*dNG;DDn1B*EhEw-k>{XfhsrUYMzWg@1${>XHn(
z7FZ5?cs{U~ikV}Mw4^ilgd=huAsxUK+bMwqIrQQ|e^T)Oe>U{HD>AiT3m9m;Hb>CF
zk&xM*)XmlU{tBk}LMG2o^~N=`+i{P>mBR(q)W{a;yQ~L_+Z#D2b_olwGH4{_FS_5&
zF$|sGL_D=allyOAgYBbTpf+Q1{Ue!UE+&*t9!WsBPV}t6hL^DlCUxOxiFOo^scX&T
z9VA7YN)8g!jAeeMHO|FzppLmB11a5Ml-h13VmLk_w6U*s&3z>f1xe8Sh+hbuw^ir}
zUQkjl_P}i2<jlqX7c0b}2nAxG|Dn9k^efJYjsyI_JD9IAT+&7zcsjjzH_+(Euw?ZM
z7z41M!?dK5)%=+ZB6Y_PR@2t4+V>(2h$O5dvg#liFKB3x!&9NkC2^I~OH|N%W;$vx
zS=`zL&vYTws4hb#1*!swDWWg1(EaeTt5~lybntc?AMububz6oInf?N((dA5r3Js08
zK(}WbZKIVQ>k0wStd8x}AGL6(_1Ee02cnLoyTe|9y0!UDrX|`ea9Xe!{8`Wwxsi{3
z{H0*z-<|zvLzy8s%D8V!d@J$gA(V0cSo)kPJ_;vSOhc@Y?YZhL;Eg4g7QQ?u=9EF{
z@K<z8>~AMh#&AzrmeR1tBD6*NllyUo5T`MHffMiKn68VomCqliwoFQB0$zTx?C#8Z
zQOFr@4=#MtRkI^JX8XZKCo$nA%tknO@z^75uI<CUKh?wnc-jku9Ij`GeSd}z88ch`
z8RGBY&r$NvuyKvX3?<^*bVKprIHknOzAubGw{+jW?WI9JR#1ViTtCRrv1v{mBx4ho
zCO+mUp5W4T4~BKBdqEzBqq7T=N&I8KLZEq(Rb9BNk7YJpJR{5e8`;<D)~dgie2nd^
z`r~)RzbF9o&|Y_Rf9Ge*sk5aJ352614h)vJHv()7I5-U@+efiXLPZmzQ?-x`GR=9z
z`s5TGEkrC0ZcKhpRCzb*L@Oo9kBa(K#vlmd4<LchUpbPevk6H|{)imF8mls=1aZ+V
zt{Kx98sgBdZD4a+-O;?RWk!p-$P!zSWcUFWJJu5!_DC)9LoX(nWu4$}=&X{d+H`!P
z*$YhDYAf<Lj1sDh4cs<Erf|dDym6S9Wo_WVlnlTIX-Y4M(P;DSr=n0%FUM`c(hZ^e
zqcM^MjDCV04}3ZLU|5Sb25EFG!uzm+b{-#F+_q(pXS3wriDJwfYLh7_8}$gHY??y+
zv4g?7M4i4|vjX}cnKfFtJz<fX3ulc?`b~bUKJM4Ct_*l+qbvf;&CMrJLF&?Yn*cMC
zt!3p(x69v#8KYQL0Q=Ph8BIlnv&a#|Mw_Se<imvjhqCvMYHHoShVh)^QBhQybUjK>
zD2LwR3KAqpkc5N|N+&?*y?Io6lM)aJAcPP?i}VghkQSOiLNC%G^bS(|a^LZdciit+
z@3;TjduL}Pf6TR>XRkHqTrEw5MYKH8$Rj_Xg6(P>=zq1|s=}jnq%(7P^M@SW_d~yX
zzqYwe$|7S$g+mlnY{h*hhW}H7_~(sZ_}K@<B*FT~ei^T!12OUUVf5a@!^tT^l$0k^
zjqWWuiHD2JGr3`Ak625?Q;50-C}0n@C3YaQ!$W~#{!}xj3x*YRnB6~ofckz!Xy+1A
z0f1H6cFI{db0JLaMbKzBchaJZ=(qhQ!y958a64!=Qvk@-@W!d7C2Ryn%t-Oragszk
zb~Y=(3RAHBcIicZeq&*H0UU=iF^L?k==FLR7ee$nExT@#h4?()0}VTT7w%fx=lT5t
zs&*H^WVzya1v1$PXmBhTF_k`+eSL}{^l05LtJe*|)63r#1s|mPYlhsi`@x2fgX|Ky
zR8e!EKBK94oqKWlm7Ow=8|(lWw%?|%U<vu@B)r0K5}LD2cuT06qauf+Sa<m=3}zXv
zD3ygCMT)9k3v<<`=-|dSU30^6VYs9e7OR#5j=hxD#`gLEQYW&>l-00(Mo4peVf$-J
zLt-OqeAw+yRRB$J3F8O&VS)|}T*VD54mJL)doEoB4^S~c?2xBmtU3(fEuju)uSC+i
zA1sX1AC6@|`V+CR8#^u30h#mP^mM;~`b9WutEUMa9r51MXb$&ZiG4VU?C&dg(tQzZ
z(#o=wrkVR(9q#?!^q{;Z{?YA6VZy2vGNwt~kk9I=0;)OW{*=#00z~EVL%T?5O~o05
zlxggo&4${i;3Vaxeof=(^_xZ}A)%5X{d(B5IMXECyvAtv<s*??)+(sLv(lFaM$Y`+
zD<UbI+xM5naLMW;x@HmbWv}FIg=SU)c?APTyQAP3T3d6?0F@QsHftEnI6%~g7w&iw
z%bx&(oNpKN=RScsSy6-kQE%}oKSz>F$Bi!>PByD%6PD|H9FG_;c1eMX2BKLrt2E7;
zwTd+9|0;8+0@5^fBUr#knSQ#7u^o}6l5Pi`oBdy=yfhJIJUT{eeKKlk0yylN7ZMRG
ztZ+EtkLlJ^Ud}O_OzOnJt@zpe94zF|N(H&jKA~?mS202{gyQCg<e1S@E5e}T#9;tK
z^XQ2dD>;E6@pT~Q@5vK!W-Oz+L@`j)SoN)7P-<fZmk2Biw1S?KewKvXqp)&(%qX@~
zD3*=ZwGfGhP&-XFfS^R9j|#(0s{EfhUN-59o!{e2i$X>Nwv^=K!u;xmsF~x_R`qU(
zm<{(tJfLSdx(SyLKg%fhN>1=+wW~_Y0a?cxg27H+hcfKtJFO8}5p8>SUX)K;ik#yE
zjC2o-FQC+>mXJ`JSnHdG9YP&IK6H{+_o;wt*<Jlo5F$&#a%_wmtP{RRZ>D#hTT@g#
zAA4%s{{YYVH{BoqRkSM`y6!saw=WJ?=lIGUC0s2|rk9_-kd?b`crPZ_{8lk|d-R|c
zYD`H(?|rngF7vgiuN0iZ0E?=s9cQE{dY_GcVAM-*LNeL}9Y!;2Y}cEwvh6VTyDd2r
zBY*G7ajqkawb}(~q9`b+=t3$IRDlPs>x<_I{@_XOo|l(<@V&lp?~ckk$S}-E8_eL<
zFg4qSH0m=~M3%B^F+wK09Ety@<yOh6N0YsbuJA>}wjMkP;UpKq0#zMwFHjHJ+%l5_
z{fy<Ck?$*%@@Py^E3D&4n4WC4#j0eGI@2s<h6%`Rqq^-BF9?hLj&__a`vo^Ln=-qq
z=!d)2U{nOd%QTO6StYQ#`C!B!){-eucGP2S-^4JZeQK+Le6#;4B-4U3(W$gE7=K&G
z7#<U1lJND|Lu|ht?j9N*KurJ3?T)95yt*pN@^iWlc8m)Tx|~rM>{*M4@J21TqfsXT
zAc@PnC4mYibA3dJ+OqCdXCK>5>|aeIJAe?`Qdda$lHKT?8@EzSN@GrIU#?TV8yh!!
z*F{}(ZJeSgyiYw{GS)^6($ZPx(+ulIWL_*iWekdvF#XF}V;o(7XVv`4tv}G^sp!DB
z({zBZOmt94U)UenYlUoetdOtMx1_+>l*}dBs;%3ecCR?x>MDAsZ`B(Le*9b?^y0Rl
z2bd{cU(`4;5SVntDr|oC+p~hH#yj1`e-zpd2}j=<U18~ru3{_>d1gRh@95cl>z=^5
z#V#%-ZQG9m39@V$AmZ|B^xVODheB%|1Wna~fc>V5vZtUX1Di|}qyU`PXR2{uvKe8p
zC@uha>3&ExA6;v)T16O}wsz-=`!FWQ3{9lGh^V~vV8>u(c=}Faa%}RN6NI`JC)ID8
zEM?H~RJj=5AFhak=|g%PF8Xv;(*06%qT5%@H)S?Z_L82+JjV+qo)`Q<#Kz2_%^&o{
zh=QUX8^nx*QU6^qPDZ?u-_Cu*LIz_wV-H3f36r7`2{U6KOCS&67(rbN!(MSn0ak9L
z@{1oDDUlY?NJ8~^t769=^6IeOvAwB#>e2tSl<0L)&$}%Bi2!~7py!ds)dMZ*(`Fq}
zr9%AR&fFo-xx$q=mhKwOZsI>5*H%s=n2GJ@PXREnK~bAz!Q@nO+$GFDU)j>JSZxa#
z)wulL`jJ>DA?t^0*Vej__2Z~$cZg(7Ul4p0AJOJc=s0y!&(CdWo;-UP6S3FeN12hC
zp{&hyto_;8<lH$=u=?{zNOxU+YNT(kN>Ewgi2-2U9(^V?QR80MdOI9|*?^|`M(Sue
z5loY{oU#Y;clY{;Z`((6{1qMhgSV~5?qY?5mzvUJ&XGp)MMixxnlgDQ=8NL)GD_OE
zNcK?w)**J+_^MOX-P;|yJ!h3XC|0(G_Flf$+vBUDu2yyz{>;=oNo5!lO*4hqe@?c6
zq^vhpznT}vvds-Lh>(}aP2s)Fh!Ph-T*p51Ok0RvcatJTC!P|Ib^uwp`^dD%zD9~a
z@Kcis?OxKkb0+<jgjsAdnjbSEvc_f+_%5a{?@)0so;7)(fN8v}oOcU|&yN(Ph2<Pz
z@sUlM$&RP4p}a1vLdAm!T@l3sVk1@J+3kXK8+}bSQ;y<m3X!(1)@ZLp=Pw`M-Wgr+
zr14)PZ<MDdW<~h@U`4epP0{;?x;BP-sD7jEnwWlrFPqm^0B3u<O(}0*Nj0TGd9;rJ
zbhLn=OuyfLdd=_`LTYoHpiDGaTaF+)A#3m3+?JW;@yy<8o9(8Z-B}9sHab8uZ)=9t
zLmdyyHM9jq2y`?1lEr>h+z@<iM4&OWH9c+2k8A~tb*Ze``p}tMSseV{MY8D|<nx&6
z!tQYa^L$d>;mzyh08>Jsv;cN5;2QLKy*Bx!;mR)@exp6QWkIoL)78JRf=RorAJJv8
z-o~AO`r4uPyZ}%j#EUAORQn`kdKCh8-}~aoKhh_#h=4}1|G0hQuXZT9aZ__+kObI^
zxLVzQE2+5=n04naKe!_HBtT6nDSvUz1X|^ZFW0i?iVbHyK@Jl}@Ps4Rc?dmDtdG(~
zL8MAny8oo(3j%I@JPlU#E|-sl;yDbyB4`9c3Q6~Bb^VIDeZH*@bnhBu!tKx+vXPZa
zoS_<TWm%TV{&&%_x3d6wf<L}QdacTL0yvU<AbX}cuT?ECG}}+OO`D@#79QVns4o@W
zf8Kei=!bWG$QChQ?#jrapNUn4qPlA5%R9;K1jDy|H5jk{P5*5+P$&|wIQi5P;;Jz_
zKOZFGTr%3J8j7mzlJ~hCrzhwgX`Ek^V+li+(oc3GUwpSp5jKEAqg^(*sItrrCL2B3
zO|IpOv(8O&F|S@D?)tOjT?tK5{aZH!P&H^9!eLFT)KHVIQTsw)nlREs0xhWCWUro#
zR&do;s`^QXKNd_@Igg18DTdJg=R8<HPH3*!@bz(k*q&Fes}7e##~1k?8UBW#XhgiR
z{nCj9XPNV<ccz!U>w0S2L(U4H?YZ(1kG0#@?inkcX!9(Epl}fxt)YO*+?fGW&G9O?
z9ZU---5USSa8J8>h;xyZeG<@(#In>UPnVVC5vmS3XcSI_=*;qE@89UxcSTX)@!{dX
zT$w*o%f}a;JRXpex}7_`-X8Nx3Ja*)nOMptGG!%R=W2WsGw1fl8^Vq9>$WnV@Be1^
zG@TLg;$es96MpC)&u@DNJSp=C`ZD4JplW)aaV*W8+<r3w?<=*sK8*%mdj(iYOV^UU
zcw?QBP*|_qU3g77`hgHB>dBJ1_njf?o6L6<*1?Clv(K)Rv!Bo9@Cs}%7a0tyiD{}o
z-hL`#wwmal!V0iOn5Gj6qI1xSr0BY5ki6&vNlJ313$;_u*T<fyuQ}yopzbqgB}iii
z+d204dQ3F2Sx4xU3d|6x&kMG<NeE&pK;pE%C2YYPjAlXBWD}ylF4)F?Rjg=9jD13^
zh}Jn277uHEY%sH3`Z@naq@k<m;Y_mV(C~K*8)KJz3s=~D6~V$nVUl{^wCBekMDGj!
z&92FE*w$UKoc+RDJ^K7A&-3Bq3IEz}=Zt9)ZWn6w^W#CkGjRyLeEXg)Y31T9BTh>x
zfR3*4Kd%6EboV$ep0z8uO^b<!hUtI#p&fb=g0GaHDQ*j{tYrUz6edZZcdrkqimHOV
zl``hy4?J36Z;}ad_`5{d1gR1CwDYz>t+M4W{-@DbA8W6!>_5ks*SB{mSqygnq~kbT
z9!SZb&d-|No=V7#d|9nnHn`n$ARFEB5?)w+l3ISGVvIT5MV?Ib5IWm;{Tzfln-S=m
z#vyKcql}b?@$12(u7sG>C--YU=(tLmjtyG{*X(h-aLU*MbPZC{L=#CnNJMHtQmbYU
zBW&Tfj0&A#5i1!JH}WdNu<@m7me5G7j}BS$rmudirL?0d55Lv>yTDwbOirp><Adj!
zNZlwe_dr%sa)XG5JrJ**BA5G*WQKU3h8JjgrPF6sqbuRtr2b-4g5nrQcFEiQuxiu$
zih$WL?bN0FzsV*V>*T)VujyzuwmYQNu^7eyT;=NOe<S|x`GdaV_VeOzblBiqsHJP#
zC^nlO*3S<b_;NW)`*<w$L`)@XeSJ(y?G9_gSUxb(X{1;;{-Ul65<OJMneG+`L}z+H
zw&xXbV=o8NBy9OrpBH*<fPj62nNrQ$B*|+dv@WI;1UI+Fn!ky4=YK{DkgJgBnbkdd
zgfOv{>Q&Dpx<d&kh%XBJ>ZUcgL{Sr{BgfJfusq&4t3%s2IhGl`Jr>l|@17mq!mSuY
zMYfV!X^s%r9pXx5Op22b(G}4_Nkig^5Rj9;b|W%)?9^#O?(b8*<9Nxex_HT3Rijk|
z6qb4t(wq4GCtdhu^407jFw%-J7x6tmQ`Zq%Kvj+L-6EfVPLv7#2OWdte}y^Py(mqv
zn51?`vGiyh6J3y9_CqtlD!)Fq3j&GJ!=!FbYrAA%u>;KFYSZhpdi@wOGB2@*2nTTR
z{iG{W41uWe@@QM2<2iD8_O=e@vIXK3SfYo$@|$@&yB<ZPou-HOmALtZi@q+bWx+wm
zwD*scM}f>yU+0=i_ODp;RE&w&6Wk-?6f1WeAk6Qx%NV57rStP}Y<VWxH*RhWmEl1s
zQRKw>s4C7(TA(zrTJ6(5#J<$;YKP}J1<rS-l<_&IpXj~YexPu_5YNizBX8p|Ki$e)
zPeN>Zkv&Ihr4Ko7_{HF88rB#eFHd78_32bmK8@QSCfF2a6kmLt(0S(z6vWYh))(_(
zHVlQ(gQ+;hn8AE)Ga7h#sfzBm&?zoO97)q8GeR5Rk<d&RI3u}XDB9h9h81o6TSe)_
zpFm+Cy6+#X*C$LTlHl9dN9tI{qh$Y1*GmFs{e@t)SCIwQ-+3eO<yF10f&RfOs%;+G
zG-C-0^$7UzTfHm-(w*os^Ov!+LFIUU)(1vmQ_Z^Kmi!NGclx-KAWQU^vaRmxB#6cH
zm|v%3(7%pjZI_1Q#?$oWY>TgX^DOC40MRK^&iQi@<U%vNzpQ<!Qsd*e^r^;HXkLYn
zx*+h!9m1aJr}V0{+`@j1EOd0iNW*IG^9}Jnq=^~DMwD@4v(`=`xNu>p?PZgYR)<A%
z8KLXQHR)0eRymW?<&zezb^UF4j7haklQfoc6_fts-e0>f*z8YjmGAzZZKP$aeF5hm
z&^?mqJa3oRy7grj!l4!M-Ek>b+t_@j=fLH_d6EwCkN*aDwA<HK&fVYm4fMl{Z_buI
z05`b|If`Rl$9JQvsNcy1E$KOd!7@0Go@@`!Hz3gJOff6jYiGX+>4h)uvD26BWA!^!
zYXZ-UrBbg-h<Y&>O}=U)nNeRBaFBewZq10x4EOl_qtp1==SO}~rnh0=7Ed50Db{Sl
zDoI*F#uhFE2oo>iB1vuIIZwo|_Yl%ZVa?^{1)Be0BhMYV+uOX^H5CENOYyY~ZJnie
zG%&9IK+E2rboFbqwtI#mPMHacg;q#|m+j`gzNIBigRpl6>+|bh8mn0{slA~42AId}
zox@8}d0U%<cY~V)4=H*e2^7DQwB(P>YLezQ6M?l}3%Cg{#;UkRlS{=+Zlx@XE_IR=
zjkGh!s%WQ@in(NwnTcp@g#fEKHUP6xf~;q&!weGqNNaJsZ7BHt3FC4}U!fEJ3XXu(
zKjfxkVlX>-<0X40QI>520gr3h^qq2Feg-VNe6!blh89g{y?HY*Nn<+i+8gux`X88(
z%UpF#<M=&^x66Bf{y|4Ctl%N+hT5tq9lx!>S1na<K3z4No%i==>8DKDMm3D!<cf-E
zI7vbF$VSfA=NdFGuD;xSi6$2VmMoc1Vz>aT@Qu`ypq}2OOjjS4Mc?!=`-+om+#UTh
zu_)4l<)4iDld3qY3Js-W@w6rav7M*GFzay1z}^)xkx@d#n;V@qi;{a(Y*8g-t8`s+
z|4MwDJVZQx53H>8>m3SG#dMNp^RgD}hh%kUC46fiMuRCfxsdyY9>Gki=i~8R!<)4X
z9z|GK<d{xtVYR+l?j!!AkkKlybA^fNM|OS&f66~wx&qK}4Cn7}9r958{@Z_#%71=x
z?O=9h_k_kw4&l9d>Qs^(O5tg7+E;z=-U$E8XnSDc6V`tuA@H6ckJoX-iA4Q$qo3T~
z^bUT|aVS+W$CE>7rF!X%CszE15i*pd@3JFsWX~H;A`ST_kC6{qfC^8gH_txq`SYmp
zc6b^)y+Tf0s7ZWOnlD^(AKhx!JzO9A+Eld;#$ym2e)051iqiR`6%EM;s$mt2>j$f&
znAjK7_I`3KbB|L@dpCL6G!bE$?m_w4gt&G~KG^K2eHzAhCnO`e3C2GAHaFjr;G`sA
zHKxs!^%kD{TczASKm!c!cet+%7p)HI4EPvXFl{Y>zzN<MRne@1h!g{g@Ici!U+X4j
z6(tf=ZHEp(BHsNnaBUOFtS#2$)|_&P9U!UiA`!;zT1E`K9prxY0Z%iE>|30J_Qdme
z<K*!rX??||y1|E@dA*W&6C6x-inTsVyJJmJO0NfvCh07Qi8h1(%BN(o0Ycw5w@U&T
ziv$)ej8Xa{PA*yyfM{cld82?xGlcG!U);5Wo|&a@>-XkrRvP8w%f2%HAt-rENi&5_
z!F>E0?NueRo(Y{d&XQUI^x*oVFf*!H)a9GCk8UL8GoXWX;E(8auRxff!C&qtfxFEv
zJbQakk~FKCGe-91XTL{zJ?|H`Pqr?aDJfrVeDbIMfh`9W&yqZ|&yqLkvn1<CDVm!x
zxsD(V*K~U=icH3O5IuRc{97OIyUc8p00;=|=rf0)sAXb?B3T-){j>_Tnf*Y1c61jb
z{Rw|-fv_552mxqU@4uM#B+_hj7#bhc*)eh3N75vr@ugft?^CN@ot<f4KFHF`ee*x#
z@t=@n5Y{Y6)&u28{^MT!q8r6ei|y-o)Cd-Om`@|K?1iispJ%@dvzm{NMS?QWI+HJv
z$4UFrq4(=tf70o62$x!&XS8J0wPuYq$eS@ohT2=hpKHn+)OeHkkwLy)qd(~=yZtRu
z;rQ4rJ}TV6u{8H4?uP^L5jTUG^zLcwGjG$CM!h20S9^Xz=Io@{k%s2%MI=bnIR8?A
zYi|zUwQs+55M_`8)M0?Hq?o4+59<_CIr*sp55Mi^RL!eWH2Dqh5^Y+94lJfF2IWA8
zahJWVIyo-J)ehb&RwGiSov>8IpwhQWgbkaEwwG1@%qCI-o@J!DoE>%G1bX5gJ<0@4
zNFM(-&-uYEX$V6l+k*Tp2JOisDkiY#gF|LTniBa|@hsFg26d018QD;U-Iwwp50Quq
zmQP69csl_qcnv$fYF#q)H5ULi+t$HkjA)2rR<MKm(2gDz;euw(Y10q^gMzZhWmTm=
z>GW;C@`i5D^=W`j^Wu{&?-r!HCNRGpYD0*We@Gh9gQ1;NbO=j^F8l+_iz;5{8=J&!
zo{crn+(?|-+dS89B+<1A!sEPSJH$BqyssRX^R0GLxWy&#E{`mn@6fq)!eam4&L0hd
zG6(e4ZA&Z!C7|aksAs?U6ETBK)iBM-z+dz}snIt&JW29Ve+zAjp1x&8RY~;aLyt#@
z^jEw|qPv+|)FGC{U%}6{y%_;vT3YG_VRF(6$2+uabbCgk72Pdfrvj5i;3*50I-dv=
znvHkuki(Q`5%d+NH;J?+{7hclFVxMC)V*v+5C^n8wW{>Cx3umo2t4>TO&u4Dp2@Wy
z3#FI$oeFdTH=*a>;}i!jUC^P+q1Ii7zCNn07aa4=V>Ht&u#U-*HRxfYVW@F1!yv?P
zYW+K%!T$<oIyz4!jW=n`n^#J=ew)!AM&0tv7*#V!h~1s`AYQj$SRcyqS5x&#U=SPh
znR^uW-eU-Dv5!Ga*e@Uso15c9UIgJSO)n+;`%j6NvpeB?^6D9QVO-AqzP*KfMlakX
z?=V^UcV-oMj=@~_VUrS<5DwIW!3x&qCeSqZdg4odAu`lIgVepSNZL~38rWFn-|#I=
z+1vqE>r=2l<>aBbe##_IL6~eF`qulM^>Z=poreA0FvD#=k5#Hh@bJ~gXb6LcYoVQv
zvhL`NO8S&V1cy!YBMmqhnRl>6>S8d_c^<6WrMN)OpBIK@G=##gBOxiRxXnQrECNy`
zDni(I*?d*nCc$Ci7CUxWsXca`mLDawbsg*FV?~{n_sMvn!-nb(A;^jLN3z#ITsaVA
z5l2s9`$8;Rf-t?S${RV*0`lOXFV~*<LVZDHn*QmInTmpHiC92jK8chiU5z*tDH-oK
zDT<Sww9t~xw}sF2w+c9a)r8=Z9Uq(bF7xJlj&R}mdzVbuqpOZHYqbag)k=7qN;O`-
z4T!6$_%jrweya1-x|LgHD33iFHfbsKq38k3;@v_}R{mv=f){mgdse4=g#I8X2Ma=(
zWH{@VrUP75ypNbUlLEiwoq+tvrHo0bU(-FEa{UL8!YX2**ep2DgA$$O<VM?DfX5$n
z7@@vH&c8wYvol%s)PFhtWsJWZ6-+;KbdB&^4O@me7*ZJ@-T!84ytpv-ax;4^`^fVj
z>t|z7RF1U$&g=g1{Jr}++U9T024)M4FVtsHX@CvwX6Uu3lwy8Pmx|_1|1~?JshWxc
zqmH+7Y;ra-Da0DbmmGYDRnTVB2yGI-?|dmZ-oh%zFmadb9ma!V&`63NMMC{ELXgMD
zs*lDW-nwj@+~m2{B}0F2i<MYoRE<6Iu~=PO%y<7pNB_U4Y&yC#xxIw2I>daF)oooj
z3QtV{N$tEvYZM}fth=M6Juz*_;PH|mjRU(n^ef@ld(LDZ=6pQ}y_czUsjC0Q$v5RS
za617Wp^tG9Drg#-mlp+p1RVV-->oR0!R$p<H_NcEZPRN@V5P~*kJJD<t~>#*?bhir
zh~h&zScVQFjS#~oPb${;ty~J&3w*@YqmT~^;ZuFN68mjJ%EVXuBl2b$)?Bd3*wjMK
ztd<LG7}xLs+D_<Pmu-&wGlW_B(PQ%L8o9*iHC+d}=+l-{20G?CQhH;=jle3@^5VO-
zyv=UXj^pXNr_ZP=-gOH|t2GAWLYUwQ3Y_WoY?U+qnOmG647EFsG~LGoBz1@JDAa9N
z>nv`Y-EWRhM+@o&7ZYlwvavNz2D=6}hfTrk>2B-6lTkm4nKhzcONa^~z?R_wQs&@)
zih@=)xHGDdBSY#}PB38eh3Q$=dmzhqf^moJp`m8%*e{;OnStd}g=Et}F)h8#6#f%c
z-H+uTk^bZ-OC@DTipyQ_-juQ_SC4owR3E$*M+Aq7N0$&sd^|R+DoFZxFIvg2#beP4
z9#G|QYBjyOk@tw3AZQ)A;=MkrZ#ZPMAvG%Mf)y!R8@ojyO7Y8g;EJVT*sN2Voi%Ge
zq{FgoEro5)1*Gx&W@ArK1mJ!Fk(G$>Ka$_d9M07fBYL1~HNGNd*uBEuuo7f$D#+zM
zAy^a`Et^*IIs$8L#0nmhbUPGOo8DI|H1?oHCH>-G8XgD;PwxBL*&-y8Nhuk_7iD5K
z0DTKUdQe{6^ZwESF#SHd*@$5Mm?txNUqP~LY3FPk)|67?I!^Ae+8WMQ#7+)bN{BPd
zT?u~E<YX#3Yt?X3{^fj<^Gf<GajyUJm>#EnAs6EFZHAjOgj2fGJ9(U<7w$>mYs%Bf
zW`@{U3v$Q_Y=%u!M{~gpo%B7ZA0HRPOnc_Ob)cjKc5KQ_kOuP^+Q7}YB8j(EP%Sk^
zSX0qf#SjNdeah8c#*34eS((7U7xMHu0l41XC2G4AK43V+Guyta+0|(Jw#^{iS($&%
z(5ynsR83&Bx!+EK+ERHTvDtO}$bM9g5i-6R0O$8E5xyM1B93*R(EUFB_rI~K{PU5A
zz#8+YG>(q0sNL;tb_#d(Yf)C4nz236>SdP_zYFPd_B(px<(~=aB_YeYoQKq=p<~!1
z#(5(#(THt{aX&-^aOaU$gTh9a%<)b_H#vuE{k!nmTlX=^b-RE^SHH~fUTyGveO(aK
ztQ)%EDKV4Ux!b#t#%L5P!WPY}t8G5vt>^u%zCYF#_9ErD7UWp4^Q*Mnk;Yo{5b)&>
z)Ntj*nu#iX>eBH8rN!u=zAB{kdSj)u`8SeBRhs%yCa0hXjhVqK-K3qCoU&Z=CYO?l
zj^UWijLI@y=b^Qq;Rcy_R_T_l%|0NPj;!$tUJUu1u>Pq%uFVcoDpNG7L#UB@Pg&&W
zU+P%kcQ7T;x{@NA@`lC25K&94W7IisbhWakpIBnyW`N=;7*1I#75`eRQ2iM#gdBAU
z;nR!mSCDxi7MCJ%`aVZw=LAsBtxi*W#H5s-&itg4IL+B%T8phDg1LI+h91~7IOD(W
zeK?&5Ir>)(SP0UbHleP7XxEfhDA4MlqZ80`AOVpi@a3`zt7@CAV-z;j{fO&7(v`gh
zQzbl-C-{8^S|0sHAvjvu&UEdTTK?csG%}HQSjOsV6|Y<lLV{3o5LvD;!}suj-Ce=m
zQWvThp{v=E_O$|zpLD?K;m<7d4^Q~>uYeDu5{P)E0<iq^r(&*sQ`gZZqg*<-IXn}~
zvYAAk1U&a`OGY7o*&Tv6*F=63%eEU+2ioB7e2CWF_VYP>-Pfbmb_EJjcSEjc@n%M4
zBZt?j<QqE;;rk%77nr=V9YTxrjFwHA=Uzob;7t4W_C;G|J+FWu)6x5fO><8_rh`)&
zOY<pn2A&dd$*#uu9ZwGhYRMkMQxK<EfddI%Z2PWNc07vWS;f2U`~~V#_eJ(tg}ptz
z%EoQOAG`{?(as9OL1h!P8pXrfK$*~-=+I~0Yx<b9w@hgnTCOoUJpl&uHw!y&X*wtI
zq$+qvpE2Ox5JiU*iltjP_*nyrE=8>Mt$%;sf;a>MT#(grEsqdNwrO?s^BWog9>?T^
z^(irybuuQ?$(LM=RpZsvrYSS*G0UQ}5r8dTG5!XxNvL6f!|Pu5;_~rm0@-JDl9$IM
z9X?A;;x%V2wn4<Ns^*`V)|lY5e1lB|?>(jX<MIQJWF$MQ5L%orQz7;=gQs^GuDW@@
z0SV|s<rn7}y2N^($)nVq!yFMp1R=WPHLawq059f;VAvG2CwLEYZp^3D$^G8uMwRV}
z$j|j^5$r#2Z1qIx{<}f`e{#X^cV%=b-%mf5lBI%Zrj8o^Ighxfm6#t^<+sG%yQXWN
zubRS?eI6N}1d3GSR2Xy4N@R<V?k-!x6QZYMs{LkAa1|XbE57<%%KUEDVPLG3fRx%_
zN9DFwZCp*6)DFrQSf@y3*qpHFP+r!9qtuvO9F0Lyp$J~J?pgG+lVeZ_&J=yt;K-YK
ziH*g<MD3<5eex=`%1bXdn_nF5lHDbGO)z#%qn(R)86FCQ3X&n22NX^+mfx>xWF@P^
zs!@f(HoR#5Qp(U$Dj9aI<FgAXg(b~|CN$PNl;KrTV+Fl0XGW!Pu6@Jl+~x{xhw6I1
z)Oyk)7^OH2g}rN)H$7x?HaH?gWtj8w`uEB<w)TKYj0u-dfHWGf1)$twmE-k>;Ru6z
zsr~7sOVIHnoyw0?qKqNExht?WcS^Ec6D10kGguUEAwDy_#cj`&YImM-YeT5iGIzM`
z*z#VwA_Zwsv+k!qX2c!+C(f2N4^f>srO;X<`u^4D^0<;F#>tC`Z^L>|M!$bPVll8v
zie7dn3(5C()K857M%wGvs--&_JSrb?21@L`MfN|m6w8w0kX1(x$LX4k70Hr6Wj1;3
zOZLk*%2<DCII>bWB0y4X`4_Z36w0x_{;k%Pk!kxjp3^8Ce}$p*;+Q|Xd-V(_63u_n
zv(8fQpU%qZcSpHgW=pukTwE12{zaIC9rc(w^OA2ul<a-Ph38+eT*;AWx;P}i2OjDz
z2yHqFAiY=_D?IYud%nIW$mxcEkGpd8#~|ZsCgvDdD4MJ#xJ}<W)IDZJj$F3uf_rjK
z(ep-%j5yBfCRo5kDdYNQXzZd;K~~nFo#bLsSHwJ;SDs|lKp=h*{E-!@6{UZ*!3wEZ
z=KNMm`6VxVk|7IRRfESbOj9s+q7Ox*a(~j1cYmasl9KxmAKg`HF9Hp;`ii&9S6_vz
z{>VQ`mLO#*CUo8GrI;OTk7@ICd@ZC5hdtLB)=nWnJx}xJ693Nrl>yk49yIbf>ZMm`
zeFr73Uhw>(i_-FFse|^+1iJ)l^7{&$O?HiZb@^$1f7umO=h;MdnG_?tiMKhfd$r4=
z-3fu$R=Z<rVai=k@!V63x@7qLg-p~_(VQ8c-SIJGcni011U{wBRjA*1F&@OXG3)xB
z)&<oD^4r7>0RF6kCoRPuS##HC)}|M=kNl*&Qzv(v<|OzP06LTpk^+|UXgfZ-9Hj7W
z*}uJFeiazsJJtyn)nSWDNp|w<YHO)ap!L4~{~bZIO1XPJNk?oJV(b~8lPY5;oeDnT
z$_F76&dqO^xrv|6R?Q#p1u%OghA^2*jh;3jJBY9K10J}llTx|!dkHsVtHgsDz^fj*
zE=W?x?b`I|cO_*eVbxyW!sD1R)+;|a3Z{G&SL%)OGp0P1+J`YCXn@OE$32HgBIA_I
zKpXD1%V+!zLEA=|p6l{Br76!EC)Ve~FXIxCUOT`zcP_|-=mSOYAj?bfn||SiY<LD8
z@5AR!!t1YU47%DBSurfQmWYVnS}cdXbH7D@et%^_>HN?~;EX}#h(=e@(V_@?-9Fx6
zGn4!!fxv07sLp9=%)^-k7Ol0Zc3zMX(RGBUCc5fr@OUlCAd~Rnn8k)6)z~FX^*Gt7
z3d5Al)fJyQT<%+aaIc~c)&IgN)UIL@(l={%yfm7bS!@x?a=dSrn3N@QkdRp+i+Gn}
z;BN^XM;aHcEVBeOxi62v1<?~c%D?@j`#5c$6^}Ax^DKVfM#7jaP22M4ttB9w;=Bt-
zp~EJscyLS;<H|DNaJHgh<MoFwgno~(+}#-UNsRZN>us*W))lY#*;PsX(i1b#Fd7ik
z-m0M<%f{zM_KLU3g<pX6sJ0#8m-#e1+umpK$F?NklII?5$Em6&K7xyf-`(;1s?$>A
z!O&goU-(-M)h4u20uupTw$Lp81&m?+JGR((Q)r`}Pv2fyaa197R(QPvc(ZUs+v6L8
zM?p?OX&+QLk`$91qaQ>HtFP;*?cv_k1g(>F&p7w)iP8koEc12ZTM(J{y5OvG_DFTa
z@&n2oX~iU=#YgYg%ghN?wy<g(x3Vq&Fw_`#<h=QY^?&t&{0}G&I;WYvo)(Dzq&v|2
zNhk2w*<pd86=OwHq-F{pNeL2qArlTbVCVFZPv20gvE_$#CCo;ZB&#TP+}aM&tBx12
zt>@%@V#<Oeh?yi8w_~4-pt01);66bWmv0r79#&RV3JG0*AUtb^v;S^^*T#$5vb9QT
z3Yb6N$dcc9ocE+jv+Sd$-_VqzN4Wy(OR-X1uMHeq<F#r<QYc+<&}WTsM-6~C`Y0*u
z(loG&ay>4OGS(1jez9Sx^91G`-ZR0HtgNc5Vxb(Ra)&)4Aa+79cd%4^rTf6-Xhq8E
z6&|FoFd)XYMW*T)jKR_^u=v}>7RQx*rA8}z_5myl^@E4<W*X0FTM{KRP+pEtsa@H?
zJ;t<yR}IfLBJT0B%=F6#_&eYSOwt#*`^E52ZBY_2=1eLfiu(?IVvm}O(}{PyPn4<_
z{REe6u=HMzLiTYd0hzl+GQu;`!#*lZ^+r`fpimZ=X0aQXRR%9S5&|8eI=m0kKawj<
z9a;hGnwiV_S*dU#enk0M0CgPg4|LV~j!1mL(Q)vFm_tYxfb6$Z<t{TH$0k@k{bHnT
zPhkh_vzDRNaMjy(b>k<U=e^B7#Q+83k9hC8-Ovg7sZ)Z<#dO-X1OD%FRya-wq~dK~
zPI&VvE7cxVf^9RMPdWjKBDFBsw)J_Y*i@hTYJ4~GzGZg;?KP`BPQQJ`vsgaAcI;4j
zhp|f?CsLJn(mWAgExELaXBF!Fu|24DA@TQRZOv}kaPPZZ#fBp%z)w2TRo92Fy)uSN
z!Fs0(Z`|fD^dd=WbMQF!+F`)XPdfg6=E*rd{C~rd`452n*UM}3f$F7Q?usU7mRBjB
zp0>V9Dn;*KcVPKX)&(w6V{2~t+a6=JK>;%5DR^)6{`fQV#WjsoL(eRqUYITHK`}@t
zSB^|evqOZ^bYCdY#|m@yq{t<Jv8K!1Lz4%w?8C1s$wl@SafHz)HOtyVfiOn)FU2!w
zoaoGCgBSuk;>ndJ<=Kh7wwX+7%U(d@Y>!gcQ=TQn{<D*B7g}cP?Z%RDq{^ze9YD8v
z>eYtE;F5i+Y%EfUdNev6e^!Q&88J3FkOn~$+J(hI_OV!bg652>!w`eBYl-`C`$A2e
z<#}9kbc$H@iboO;sA*lv^<lV7!HS7ddgI-Oq`n#}fOLXjvYurOpr^Kb72yI$55(eg
z`%8fXdVTX_WwxLJ3#GQLOG8D-bi5&3D*PVx+vm#lt_~e3=z)CQgnfq^U*gzTC7524
z{q;c=ZJpx!se9rdx<z%3yfc|~F1q`#&&#|z>VVQ-kk<PBWq3G7dgUG^PULFUW7$1*
zEMcOG`e;9hspj;WFvwKe2OTf2E{Qh6)oiZivYR0P^b9Zy@e^+f8|o;L&Dc$ET&j5y
zWmSNtS#BxJ$nZL3)MXgtP3Jd1C=fQlTnWqC5k;}vR_pc2NO#tgKjtv8=yLSx$$nYl
zH!QOSI7?2hyQ8#w)m?Gy-P=IqCFI4-x|D?g#9(Q5i|R@36%}rMBF;UT)P&>RX>BiI
z8*gN2&!gZFlBMFx!!E%hLBHsyl-?{R>GCxVlG*QwxG5_!ypL#CPjLi#(daQUsb1gy
zM_0^$#ohlszmc*Pr)1CuAA<|EI?0?>_6g>0H5zMDzI$YZ&KShf_PgX=k~R=iyEWCd
z?tI4623fG#Avl1keXHhqdx3e}(>^v9eI;2F(HnPQeQy_BzoC`3ZHGBBzUth^VkzmX
zG{TP+>UTT>x@!B)Y`I8%QArehlIAO7m-XPq20*`YF6lmXifquNtDuJH?-G?6LFq_m
z6QQ&@c*y;bPQb@;B7<6bD*UKl(C0^%$H9788NgdQA^gdwCXn_*Md|&p$l^>{pQiW;
zx3VqzgZv#fYQ0qDo3C1o$^;p{vZ2+wXF%&cFvCwefFc=Pt#hI>dyhfuHY@#~`et)-
zR1{V+0@?%2#6y^7g?ddg^2=)M8P=ybsMcz~n%_ARTzG6y>D1j1#mDY%H_wW2Qyn~4
zm3nBI=+52T2<(D&R(j{c(ZK@m-ItbzS3|=ohpid|RzTlsTUbdMQmXz?>wdNwcg9R3
zx3|O7o_#rY`uf5S(Ms;3gQ2GZl`Rj&MUeTk&s!QY{}ekVS+0OMT>$#7xx{dbGS$0^
zpoanjd&?sfkb-`In`cH;c9wC^l$iaJm)o9x+-y=%+)*}nm9~fGh~`b_RWEW++T%@e
zrKed^Y>?!~m7>}!nbydE(r6U&t9>NKXw?I%NBMa6KGBzLKIW_vBF;h>@_!Vymflr|
z7GaOLAbO@n=Y&05v*N$NQQbH6q+I)k4Pg~V;#&{LcQHW2gh^hgPEkbE<&(jo)vvAZ
z{rID{%!3S4KRQceLi+`he%Pr_dJW=51L^)pUcvtb-oKv2qByMol-Z@Vblyd~CNEvt
zlV-@%d?llC{yC<qE|V{$+T1VHEA@-c$7=`9FHzR+BV8e<s~(?=lH4IvNgIy4mzw?f
z+t}nLQF8KWX2|k7ISKIsroJk+Wtqb(Q*VNcdU=}K0t!Ies`{8SW>Gv{dfnol)vwvd
zC+jj6yYL@y1Y)Ietla(ivDFe#UxP!li=NJg2}IH4v3j<c#E`&6U(^bv@qKD%zSVlE
zVSnjRMj5~EgzPZ0V5VldCYKUdVy}r@Q}UF01-h1!;#m{p5#ijG33ss-)zZfTMtXVb
zKj%Ir?<dH5?;dhnrSK9HN40<^rv|C?RA767tD4mKYk?wIY;r@*YEo`E##;8sB}iz)
ztq=AEPv6jHYPua4tf4w{k|%|5?7&y@FRW_^A&wXkj>QFj7a4&~#-2s}BLq9UEK4r&
zxYT$ZFHfAMuV>hK@V$rk2qwM3FHnU==<OX(k&V;rJT2G1PD?;0lG+=h_moUZKcyj@
zzAjW!st@BMIGbHL<BsKcbCT6`tOYL$iPS%hAujPW6C^Vg&G}Shxt3W=XliiHWyW4K
z6xo|T`JG)}h?1pM><Hwp<-e(*lGLb#0i?{ojY+CZiz32?KJGbA#`0cw$WKcY2=K;u
zr51k6K(4Qe@_{ogY)+!iBxB985_=)_vM~Lb{3m{qrDb1r0%M#zyc3b9=_Fy%JMp^B
z=Dh~KA8J5#ATf)ZwDNA3)$*=5j5kO9>*pqy7gbCv6Fo(T&&Q$(*@0`Z%qVYBmZ=H;
zKC&mV@+aMmQ|orOJNEa{BORmq37A(IdaJ@g33-^=!QGB8jcR|*Puk^zB(myz{naw<
zpKoxB&(Qr_4YGg5E}cJQ>N}0R&K>li%0l}m9eV5NVh{mjrFCoDDD9&(t5Gq@lS^%T
zdp5Z=;s;9*Jicolxx4A@%x`-^f{ZQm_nc!@ov`ml$lBwYddy_o?IU46Hk|w+;CM`Z
z#D&N}T(K=IILx$;*@t>~pwB#><<&T)GZ7Lkbou0i;vmz}2Bi-+V-Gs&i-jgaY~e-+
zFDiw7h70N+!=0RLs#joJEW>m9`h;6LK1*kOUg_?maj<<3oemkl+NJtroqHzucCfa0
zQu&%+C<7iu@4u*snbXLRN1)%glZ3$~R;5*J;xHV2Ie5akDF(o3TGI<kF)L-C$>L=p
zNyQYF3?V0FRvfVE(xarS_hhVJ6?$Y=T%TyhD<W|>CmgkR@fK&u>PPd%6f=5GSb-7P
zJ>U9TjE(CC&@$pchIb)qnsqw3mNvzS=j7qejWksPd#vqqyidk~f=4IbYXo5p9E~$t
zd7px%a2M_O3ivMtCot>2Fmu`CrCCV;Ft%cms|!VPKmkt)BLYc*SCo1BaIs7NWbmO~
zplQpTudgR_2LQcHlwwZF-ikCqw8DIu6V!4P>VJ5bv$}FR^=G(&_dWK@yF5J#(TCBp
z`YB{6M7KG~Uf~h*puJP25}X*(u2R%*M_WKB*%g_U%7gdj2k%k>297d@LRinU<1v-$
zlGFr52zGU9a>QmdUz3zM0{<q}MYx+E@NvZ0A(l+}){yX2g$kjb2pcljhGB|p5FZHi
z*#c&HAEHJxS6wx-ykj7avQwYa5jrl<z>w`9=z2~dtDJE0p(H%p$iI9%onNUXLbdtD
zz}8yaGu#+D$!uWomAvU9Pxaq0_kQsEt05?r`i){qnF!4GC^>Xp3Z6Q(o=Dgf8x%o3
z$toXTDgtj9!OqJsEs2RE679YTZge-a?*D&a{BK_Pw~X%I_`2Kb)UJL?0@_~j`FD-w
z9vIOk<n%v6sfJEj3@A$Fuzk@u^Pmmn6~<Lw=p3DW91TT%9HTZx`;LcKI?RNDd?;*C
zs6yi{Sc<QSx2AJ`38iZ!N5Fg}wz{^P{}mw|rSNI^NUDW%Wd~a6+QZ`r+I3Ku<39Xe
z=h0{pW-fi=a-Jc<*c(~cTKHHUN?D7ah?mWicJTGzOf#jre0l9Y(%AkQu)LAfb6!dK
zvIbyB9dm-A!)9Ao+g>eGQ4yzU7LGgxww^V0kWwVHC$gQ47ng73p?_J*hu3!ODTsgX
zG|1jqR7DubQOc{BXB93xh%lfH1IiU#IHq~)NEs^YB?&cDR1~v5Qpy4tkXh6EmWDe8
zrU4yo+7kuUdi^}~GU(LW1OxkWztI>*9{7-;C}N?q07rdA;Fzb*igsS!eTM{WjrSvv
z#nnxMN~VduU9TM6Z-U*c?^puLhiGX;f3bXr@qMu(dxj6jw{~?U@I?Kd6E>=2ecs(|
zn{OHu!kK7!dwnI|q$^}`;`Aq7a*%J@$ZB0I#AlI>C<Qb`D01sW48+-GR4$E4rKf*c
z&ZtcvlOwh+9t`rWyS|1Eb(;T9aa1|9*ZKADa`vL&<0qMTjX)i(Cu5Jg53IX#_De8I
zzZ!BW;Zn0MVD<%Hz7zB@);DLGmrleX7-5*fJS%%Clg64jS1_X#Ux;r{W6`&nDZ4&C
zqIOyA7ihj?=YB|=gO%OJ22j}1rr);=wfKxXx^DG$Co{_2HP;001dp3unK`K!DHidO
zWri1{%3_g8Kk1n8)!oTBb{V!u=>uJ6Bc{T<GGhYpS_)><8y%4GydTDR)3b5y{aCSZ
zQ++mkwLWW2eoWt@sfgT&&`FGLHXA0@Xckds#C?1ldB&&hoh14-8{|3l&c<V0E+sa^
zdwqLUo_AK&zCM>zRqLdfRPDTNGw~KH!;9&!{b=Q130{a`h8RmQz6`Xpyw|FZQTprq
zsoFjK+xbH@KzcL=lOsDP+g8T8zXuv5v_e8nypo~ODJHaKxIW39jGWK(Dp<%qo;c@p
zbmy=3v%M;$wwMwL1Z%bja(^*m>{*4h!QysVL;SD)&0zbN$9~l=mhqyyF{lI|KMC8B
zPhbdJyMR0J?|QrM?=P>{#_DCLZu(`991B}{F8Uc5054#<6*-syHPKcxnnMUAeeQVI
z{o@bM1_>P%KvLLq5_3!yO_Q4giUH*(H%N3@)Nb2n^vXtemejsT*B$7eTpKkS5v9?5
z0(+5XDb@WRV0XuqFT*<$Ro_R48;=#i%ht7^G;j6$7ZTd<;$~7eojBC94??<}*GZii
zenr}J$B~31aq{eE$r_|*Y+830`>8(mo`peH8ET_skG+INLOZx3Hf6YicrPlTIpauy
zJ^oSj-?JsQvor!$rk<;J&yVbi_$N|B>yMkKnO!smC|UJCj^wEgcFN&gk;^`XB@I~I
z9L(#0Ado#Op734X%piYV;Wcf%_wt3B_+;0w%oE$ZVJHI=;-mF|i}ZnwvScv~RiW8u
zDSAfKBJyCngfQ4hgcz*UYa3ZP7Sr}<ah>Gi03&Y^%u?#g_3)yrt!87Kfm5))x4x=%
zai=0iQDzv9y~STm`8xRKJGW^TJ!<koh-wBA@OP*lQ}?dl&n}M9dH-Fg2P|)5oZOHc
zH)&n&QO)J;!{hl-5vjoJGZSAK7+fiB43FbP{iI`_;8-@^;!*C~FI<N4%Qv7Ok^r02
zR+)&FGMJr~1su=;S~qtj+nR~2_g+15H26uE#^%%P|Kt=5Y=+kKZD44#3Vbl1DNAL!
z2iBjb#d#uAvSe7W#Z7Tk!Mwj;Q|>5R7uc7?x3YIR4TM@-WA$X#wXfKF=JqAQanEaT
zTrv#-4~M<>8%tYx1!UQcVL$02b$W;~<BRn?Qcm3l#_&n00cd5V0~PV569<~tFPwWe
z6u}IVezF4<J=D6*v;5ix=QAFS=1$h0<fm%83T_5KI*)l-Cu7yWE=bLv+B}NRGa)-|
zcbzN=1k{>kl{6=AqQtBH4wJI(^637gQ(|=ee*;pjWp|tB{k%NAJU1)*Q2THk_U4sq
zaj^E^-#<?)-O#!99?K~$tR?c8CrLVsZ!vDH`~GlX-aj5Qf66YGptO5d$EO>z^i4O|
z_t@8RfN&fNu;lmk)q_)ZNZi+q-LZ&Eeano?I4LX}sjnZ#Kr#1c-j=&kMBx#v))^Rb
znn5oHwc?f?0Ci7V$@)k&Q^(0-BjasPhsS0@Ix=FNy6o{U=wZe5-(Yxtp%#aF{C{b*
z^Dlw=A5X6X;9)|udPAO8%aJW9sjk$(P~tgRBYr;_rI#rfT2K(`y&4Gr^0^6iPubF^
za3L=#?)i=wBF$V?YXJDI_<hMbO=%>aY_5M~A*C-O?O3|Z+h^^TQtl-QkNY9haL5MS
zU&Vij(_HK9)Gp<CVMkwf7aQC3a+&Xmq?5T}dc1oJX{@|B;tOEEcwpkipBNmDxaPfE
z=R4im?;Q}2ae6z**O1AiuPp{bGWG;EmY>K-_mlREg-qKrfXCUNf21WrWbG7_3~-Lx
zV((URZm6fqN(^g{&*((9$wCYh(pN)<bb}Wj-N$MBWjf`lZ{!a?#4Qx+&cMT)G6kF7
zO}dAyrs87o2*dXyuF2EnjHCt$Q}kqML~c~L2{{+4!dK=Yp@M1esefGrd3T}467s@S
z7x_+kbR_9S>UeG>D{|hiNoM*Jp7rDtZMbk>yd-3TKO~jBW<Z2BC3|>Oo=?7aPf1Dj
ztF;fki^cQ)va_(cW*ADV*jauqF_7>i5x$o*|D?<7rTUC9=gqatY__@uLEakfT|^ir
z2qGfbl9BR;x&Z|p?Qiz(XzGlnIF_M2`mQ28f}Zxw-akv<ShS}{c>`>t*K-MGhl7`4
z?Ymy*eYU>RwYtlC6G+eUCJUBzQtI!qZih8Za2&6yIOhhrDLclYOiR(X*jP-@y2i}Q
zMX07y#~(Qm{*c4Nze)hD)T5PHlXT^*))${;9bfPu!Qb56k;ixr|LC{iyCL+cV1?}c
zvGE~G9-Z5og24V#CYm^gQVeh>RVOchTUr3VUY7%;rZgQ%EYziB&FtfQPy;GK8t7#?
z+OP6BmDTrJh(|&4+`|YXt1e=08)Ji_vd`e9fMNY;)HVs|Gx+IP?KD_WF-R*OT3re-
z(mEUbNjG({CY4!y*g)<(_iW@E2V)#Z7Pz6z`1V7zVj#G6>(O8uY;)X%<@30oJ{H2V
z{#2;*K0@D|i4B}Rig-T4;#Fbip?qR!Snc)vk3ZMx=&sWOfzm;`m&~rgZ)|K2{xPM`
z6d}y(#3n!I`9R4Y;)zp)?FjXBnj4;zDH@Sm+|QhU(s3iQH`30>D<ePxIKC5$H63e1
zg%Lal$Q>G+l6UMlBMA{PH<KoUeOgLALJFreB1bZNjeTJU0cxHwXx+vG**E{ShW9@P
zC5^HRM!(iYZl7tQ`u4NHMBkf-rsu6E+d6)gvRR6IG42WRI!VjauRY-6W-V`$ax1w>
zI6n#8^T0*)x76w*w2O^E6<OaOvPE;NXV$Og^B%DA9Bo+Iqc6h+?(1m$HWr5U_RiQp
zk~Bah9|&%7V_f8WCbeb6UMyJo1+81)Zj+Q3`yVDS-}!a`;wzc7li})jbD+&)6;;57
zJYu%@YgWju%YMXpk|q29aQ2>2O?F+sFY3*$fS~lESm*=@Lg)zGf}sQm5=iK%ROt|^
z6bk~<1wuf&)DS{3^iUNDHFQFeqEsOirFT4e&VKjv?03BTd^w+zapl7`M%J8b&AH~B
z|6i`r>N(UFE;809GcSY0kDI(=N9nYt6|us!7;Z#Y8D^&{-7H=#HA^{~MO21Xj%zBG
zZ$JE2NxiljOuM(pXbKTs_Iu?ZI)V$T$>;~+Vd=$nRUl}%>G^bdakIjTL*KTOd%oy)
z;79)-sGQ_lUIaa4MCT+8@O)LR(eYfo*`c%Ig1`7MpLSmiIHYsFD!k0$T^JhMa+YYY
zagk&|zEQC3enAeK{VDT{64B24KIbT9Uopp~xVHD4i!e_qlRis($u#kN;WxGZlDo@k
z!u>u@QT0R(6bJCOXw#h>H0*^{Lc5W?<>63Kh}vwMQHXWqip@3}&;HPT*aGbOt})}Z
zGzUMHIhxeRG9Y;B7$yiavnlV#x0QI3W`7>vz(8ddQvlu7>9H0;x6lL25aw#jhPXIW
z^=gn>Q?<pGU6w;$(y))Ztsx+)*?hbmL;Ozka;}7+*=N5$PN9bLysqj6Wx*pWQ>0Vl
zEFB#cx7J4=AO5WtP3{S8A1nRkC{S%(wi<Ql!EcG$!dbADPrJizwJS)nZqf#SRAT%Z
z47V>-2y7j84g%7iDTk(45GjBrGLKvF_x`Q(vaO&qIi`4?SW!a^&%b!HkIV#D{RZD1
zVkBM`ob(O)+2R%MToqYx{6oVYUw2p)pFqtsm)8j!q9YVUI=+OVd%QxJ|ATvl^Ru!~
z9qQne_kgvJ2{h8H|F1>U&!m_n0y?BWsFQFYi|{_IZk)|BNAvYMQSZ>CRXeN!N^=CI
zv)a8TCLs<F7EHDdblKANaO_^2$B%hgbJcN|%}bm&WUd+2rGwy@l##eS|KX_$^?t9c
zfaSftXI`IYo{v;Z>D2$BA?d;?@g4TuL<kEkhAgv{Hey}xBCk3^Lu>axed|9@E}0F;
z{Gh^@-r&=V1pC@`aNaqa6X#pNLNmn9J4D~a#KE-=;>6y1=Bw2(iSn}MX@A#XTN}P8
zf}Mm}<9)r@slp}3Da-ZSSlL1kdd2-Fb6<ys_#FpGYCrpu&+|~oZwIBm$0xjWol_HO
zN!4z`cMNPFDs>^!Q|#h{^Ft1`V1dfV+<+0%40WB;WH}JZ3eDh!2SXj|qj8&67Wwds
zTQYEAI*TPFe#9iF<9W&RoEV}(aw^3-LShsG8h_XnzYmeZa@wT_VMq&$3a(g;5mQF!
zQSN|h1n@OR@7Jj_#$0+_T5qTzo$zywT=jisT9;cyjfE8NUY=)<l5S^*K-O9leIqeP
zEny07rs`hXU^Qb=SW#`5NuJ<D(c<>K=JAMzOgh0zZLkZ(O(y-0L&mnwahSx=yPZ90
za^6^zwDn3F^aRPNQf`gmDpbd<<m7`4ZitLIO?fM^7Uy0SvOyx<nx_IYA3Jp_i?x&%
znv_U-!Ktcw3&5nt$sY5XDLqX=`4sW)#@-#TqKa|LM6AR~?3{s%ap|so{J9xC{S}wh
z_Z-9DZJNmz{+X>tV}3zzbtb|g3H>I%oYgA9gC-xgHxK43#Is{J4(-<T+sajQUc$^v
z3|>^ImY&>Upw(s6QGXE2mz@w@ss7tk`}y<n{5j24Vsj#8#Y-_YokBU!U?VVvx~;;p
zgbrm#G3Xaw;{^ix3bHLLk$HSE1ur+(%bz`d!|n4|f({1_4Lwav!qQ)I8g`bYX)zXw
z@&v|&>@dqg^960!7?ewVN!ioq$PYsDHoVzO&Itcof!9hZ%Q(*BlHzJ72N8E)GLKjj
z$f8)GG|M}3bxb&qXw)l_S2)rrjK_*!MO)Kr;uSb~+&;5H>wU)v(Gczg*$&z_$ma<-
zfv-O+Ijk0Rl2|xMS{*ca+Xd^ICz}VV6mmA1jaWBLcM%KzziC4>P=4m?4<#k+F1YsZ
zq(INX6mmG1L&lD7MhJ5RT+li%c~AGn9yP6pWv&|!%KP^qwe8$^2joNce&yWl`d-CX
zz6E+*!=AM>^l+-Q(^u~oa-%#HZd{rw#V&|;e(aEmYI$z}ef5p6x?b1nQX{)K))r)<
zzt0ReciPj$1wf23+!Fp2A9VE30q%@lX_L4gg+r?Y8DZoD2PK?%rmIJ+6qMdv3Y1^C
zu)pexR(5VtueHP5{)PQXcDgS&A&yR0f)x~ORohUWTaHuC(qeelZ$BITu5Kl;-<<Zc
z&GRUgz+Da6R$5-H7x&`Cf{Woli<0&g&`#rRV_WNAzwUTAt`1rkKEpv$_%gyxH9dn1
zV%Ldc<-v85cX{H0Yw7pRbYAY={jhQVVy@_NJ~h)v%U4vL53rjpd?rgH!qx^0@@*sV
zrKf?Qru9)gATuh?gwePZc|YD`@zpA_;znnSgZW~`ZRe*vt?A5wZPbI1yxSD56|HYh
zuSp+B%~1KnL<*A*rbN-Z%g9_)2QN)@oO7OKy~^V<0m~{c4fju^I3$m+<x9A_J}-C(
zJ7LdOV(n0;-|@3{RHKT01wTN1ur4h2JabSiNiq|?P+V<J9L;Zk@!U3JG5vJpJbq4%
zsd}*$=)Jf6{4=P`$++qMXog&aSM(FiEx|nP+4pVZMB^S!CRpH|uCN1}czXJBK|uZc
zI_<!h$Ju{q?nXO~_OuGN%-muA;tcgno(~)$3)je!kF%$*zQu%LlF}Prvt@5gz5m*o
zDRE7tu2FkRmoe4CD$9K(L}6}3)G*~h-l$-1(P^Y%a+u!l;q;C#7JXma=ebR<;GoKc
zRaKaP_N7#v{}px7z*lLeG#SyZ{bk(|y|qk_xoQZs8@CcBEqk}ckZoJm%gK0gtUTcC
zEejAb7hVo;43G7#&|j?%CZX>irZy;{La8`np2RJy!p#-?acevjU^rm_QoY4$aVhfG
zixcP#Cw{Pf+KM?a;$<ggrBGLCe^Sp%-2IL$7P7WQAnw@?a=z;%&)1h9@Qk9-+P+T-
z8zLr{s9gH7!t_k?s8ZiVs@c&f4Nd8r|C|*6{w8W(Ekeaa#t%m~DpZw;gB=lp@_D*R
zqC_bJ=GZMN(I8c4{U`8s9Vr^PMcO@<pYA>g2!4J0tfIC!K6=RV=2C=>dyHumWPnJB
z&ZwDMCB3ZCu8{k+BNTICmca}g*F}mVy!<>g^~dqNB0ZCp{vb`91?9b_iKe|fG1Hfz
zBcX}ZxNQ`z&+BdJ%MH+YC^M^^&ln&~AaCugclRNZ+={A$cngu`9=;Oec_l+0#x-aC
z158YVQwhe%5&xPRA<y*iO$;am0x;}nUpOOb%uAOC28Tnb!d`0pA(l$1(LAaVW^G<`
z5|ZlMO1-N(uA^cpo^!y?j5qTmtOTbg@qA2K=755`qMECtboP_M4(TA9-rf4_UQbHn
z2<}nqSD{wrj{rXoG&opQ)zbwHaeit%y!B#1`bhZqg~qIs+jjwv@lLgPB?BSM=B}CF
z-Mef%3%_@QQLv|<uzr%!h4x1D(`$;a@Txfn5Lr2Q$wH#RC74p1&dI7;jM&+9a7#$c
z!q|_cIo^T_d!zH~+Z(McDd!}$ezhsk+Q-;CLRDKMu{L$clqHQ&YGhEh$>tm&oikWB
zkUvGg`?SBaP1W$->k|1Nr;6{sXsK$MmrOh)Z?1j_VPX%D`0f3AtY6Im1Bu-+inTVW
ztm7{aHp@XOuJ_@#nl68_*}m~r-H$>}9h-i)QOnP52&iGZ->-!TBuO$>L_6!)VUBWE
z{jkr*Inv`4X1#;^XMd_4BAbx`uP?WGo;ayf)i|bSU<Tj{(&X=*jJa;R2fad)sefpa
zkM`5qn&NI2smj2XtRC^F)Q$g)$8t^DJpT5@yJp;xN_ZZkS|H!NrvT6x=O;<Kg>YNu
zpy;S{``Ww6yyv(+tL-KouNN^j&;U-;k0kx7SL7;B5}yl~bbti1qogYZDiaC?$C7)<
zpJzJc410+dgg}%S!ID+fv$=-XT0&GrXs(l|qUDvO$Nl;!#kTd7BD=FL3sg9SNeT3D
zBxZ~(c_+5tno;r}gxTIw=kGaTRnExj3h{^E;~7%ZcSXqLFnGj^sV!$~MT(!wvQk1B
zL{_v1!eSC*Ic(eQ$s~55v`%M@XdipUak13ucyXNFv@U7w27N+9`_I2U>wkTbWHza9
zhnKk=dLrvA#9|ej0-bO3mADVMOIZh23`<+|kV%_~KR=TNVN}T}ck|lgTA$Sl=AQP|
zX715KDuLl8|0-oie$;Q~^?hdYb+_WI?K@Uub#{)_B3u)OePBZ)J@dO5?_$5Hm-M!p
zp;vlNF=FDWa?}cPy7t!Em{*;Kt7HG|1`w(AQ1csTLhRtd>Z&A%VMdj#QnaL1oRq(b
z<v?0_V2mkPd)oLR(<oGqdT@DFNkf>Vdj}e0tylH+9s+<)Wodzfw@=x(sFKW1{CdA@
z_$x_G;hmtcGehSSS7&2<bRqZXtP`2tg1=~}Wg#QT?D$sf_*He#(Whot$&F;x)Y(AT
z=U>S!_O{`fh2@=zDGCABz3Hze?qD1A<*&DNc0Zr-G2~_FYL~^NWe{UavUu>MHR35N
zJzHu-zoam}>`C0-`)<dn`+|qmjt`0$>(>kJvmRp?*Tsx}-fPd3eUNU9#v>qK4#;9T
zZ)A3vraYyyD?&dQ?zV&;C^2VoJO-SZK5w7roqm;X8<y9y@TwvGA1g}EwY)fVqM|M>
zY5$cJx1peA5`WVUXuQbeQV6y0r{pYZ$7NB^y~BZp(wE3xaEw}Ny|T-kagvbLb|7gG
zHI=lYUfe`<H*<9slv~^7TgU1q^lKAw1im;lL;8X*3t(UTKon_O8Okkid%eh6F`;Kg
zLt)}Y$qY`sPK;l+zK9gD!IC7h?9J<w=nFedZSJsCCf+p^^*+BFBo>*4SY9$|ChZSd
z7FDU*Q%Jj06djzZgQAWQ`G7kO59eQKHKblY0}FJ;7e+;*WVuR{%<Lu}`LZwiHpn32
zqt*4Lzgmmprb7k|rpm>)eXMUVi!F#sG6W5%HJpD?LEOq0a3;6eI4!);mC#nkTpaWC
zFWwroU3+Ffe?+m=qBUUE1xpCtnkDY)jrqQO^WW|IQv0TE9b?{!$<w3mtvj!4e13(s
zkF}6*yHQ$)2L8}2T5MCVgcP|#d?_A9Tk#I;b0V`)2(T+%s|r38fxZ4s(&)Ccj+6iM
zG{VfD{qj`BbD)`{q}DM9+*a5zpWW=6-sWvH%7&mf_Y)(E_n3!Fx3Y4+8)tCo&o%>N
zrOZrUy=ALH-;_u<K<)3d*lG$O0Y)V^>p@JvmGF5B<Fg>kD0vxT&xE+3K86ZqNhA~j
z5rAPE#$IAHB-6fu9l(IX=Y9LzA|ri~0|b!F3Z)-)+Lg6uS@i4Mp?C#!8Ab~jk*^~N
zF&1eMf*sGL@I(PCp#ANNyn9(L5mdDwde?FrUo5KX=8~8i>^8YhxcewAooH_XT(E~X
zhwp-XX1Wf7D$dnl<yEWUZ?nf+q#O~}j~!6=fGHby4Ha{qc)R!+j#=;lb3ibV^VHJu
z=SIqf9ZSv7OdqF?iTi}D-0;mZHoDm?A<Ip(m#83gy%-f&YkKMGgSUxx?P(&2yjncM
z+9Jkvv1I*Y%oI8~%AUKkafNSd>A_T3tcm)PaTQ=HWr3@?PYz6~W496X72CfnSLS6@
zYcc!6C{LQ*97oE(V}Z)}R9j;oJN6S@J|Z?Jzr-47np>yTJjyDv{0dx-@b}sSup$s9
zH6&SIH>AU{`0$G^g_RHK;t=xGme7$uvvCPzGH_GV|C=<mPN#M8zFE}*!JRkgHB~Nl
zp5G2vqQ;$(xj%B!slR@g@$L8AaXi?hxrDj*f7;U38#PXUXzY!WPHXZmVz+J&48eW{
z2;Dc|l1tjDdRo{M0`w4nDK0}U%_e<kO?*^6PzXr-lrb~UPj<1A58)awb&PK}PB+i0
zx)TDoCos+_B~9tBZTZGS3=$dxG_?z>@#4;aYTmnHPkLX|Yu)0lG8Y;1`MGo`3y9i%
za6NW!!pFN6O33nI8(E0}L~RTNJ3oE29Y|L=ZaypzDv4u+1AWk)?F^dw3?y@DlbM-v
zKN;}KWQ!qP+jzrO-`_pcJ?ZNYUwn>|$soXCucMOD)Ah&Vz1ziGo1d&tV?K0PA4s_%
z#W8|a_GrgJLy6GIlnNg9$2~}Cf@w)+LzT+Y7+rhIFvUKs<w#Ja`ApA12t9>3i}C~S
z)ti<(L@O$~xA{y65YXNp_BJVk{FV;Ge#hZa_ZxZAY}RNv`F`r8Di_3uA<O*5u1%W|
zT(X2rYvd&=0jbjZUfG2l0R3+9NQTflnE2xi*mY7`87s$B7GkHm5E=Vkkj(BKz2a4V
ztP42cGg_6H-9nashJ;+IJw{VCdfsd2^AW%CeM>Aa9%j6b=Md&BfLpUuL~+F2{aW>E
z(Gg}AC+U$9eY(J&$|`57^b}nBmxBmCJ+&oltMsd@PH_(>XzX|YhakM{Mw09GeZGoU
zdJ2v=Q?D%yb-2vxw!?v5ueUDR)*<VF$u1L6{2?A|HntJsEFJr!kXuv}vWD>)7Eayp
zXFt{CFr}}&uxAhS|H+j7y@Hx}46jtBzM;ANA2Yhd_07HZDl<f>*Qbzu>;0R%vIQH%
zL%Cv>L>MYJ3J3m0S09`eXPk}ezg=+ZU$@q9-Og&%>iX}%>#;Ta$_@(7<=L^!bf%SZ
zZE@}zGmR^7Tv91aS2ra-@lkiRZSJ7qgsh|uY)pC;B(V^$6n|V;FjgLSGi#`ZWp8{%
zVQptam7li5MyZQ2$V?Z-mCjB=c||{$0~C(c@#O(eA{@ZfI%%To$tG51`Iv!;DkRpl
zb5-ap+5$Gt7m6V27$oxC3Xc+MfBz)vGi!H~V~K7qZDq?_G<EhxE>uJ8dgUwau|7@+
z!AH#DK!c4%+$YUugsfWH^em<JukucjjKmnYpcd9efcEi&Aesk}mo+}Jy3yw5&BZ0v
z+$593rP@l&l`^Z>(H5Tx%1N`mb+&PS5$aA|;)E-@C_)wm{;@o<XjYq)D&rU<X(Ky&
zdqM)DC`SX8)U5buDz2l@EL6g#6xb8vOyULPRo2JwI6If}JKAKyD;W0JRKHylla&%$
z^A?qeMzg1OkS60ya*K4+vMYaA<_n;Qv%O}<0HrU(9KSA5es6?`>kBVn#HLGDng>hf
z@od`x=BClmJqj2i+_SD_v9I#frarqy!OhGU3;9C>KRKgDC)PTrLHB6nmj1KcRE03Q
zPEo)^7k0K^FMl2v{Gov*x7^hz{Fbh$5Kg})P-4`Fk;^%$NF)^;fKEMH^&bRIHd#j+
zBd{N0Wrx;N0mvAXc>b;gZ3&Q^rY?a4KRMRiTFrk4T`Dm~r@hz{($)38FO-%onlj{U
z%_i<Di;ya9aMS>XeGQ1Q_@@E-uO*k_>p|<QM1d1COa$`$#IyRPU>a_&I+u(GM#n%c
zVLeY_VK_$UD!2ODcc`6lo{nJ%UGF1UzVQ=(7nCGZaoRJ_7n~m#eC00d^nT~39s<k)
zOLoh<)CDi0tvrq}cGq+Rw@nDDFOM1PYd*=#`zt9wq&Hd+Ii))(4$Vtp;Q0KPAx>H`
zwx(Cs!OWNs<)lq8Pi&&LgBDx6pq(isW?`i@F`0!QX9RXx9idXv2*OWsat#oR6MqzQ
z3(X<PiOj7U8su4v#XZaV;uQ#bFc!lS*=)F_Va|~>R*=>FXr!<-yx*JKM(}s*KLvAb
z=2bihU0pQ8YX*^YE<v2~Ush$;_fy~Q-|`bGuN*5TjYN~9Ge~8Xl4?<v;hHZyw_QF)
zo0fbO2S0>!n-?mI@>`O#NK~k7;`66g)SzSWL9&-j);xmVWyWi%k**_X>#oTq`NdrE
zp^2@&1OMaf>h(K8ivQ63AL2A#%7z+E^N<qAp0nuFp0(rZm(d0qvx_f6a96A&QZsME
zPo@p9KRkCD>Jru54D?rr^{vv@8av33EZ0<|2CIJ50LjA~RrUmK$~K}JY*#HQk!a>>
zoe6w_k*e?$#YuM*@lg(kEd9Bno{Oe7+~dc~IV$rCLPGx5v;vp)G4Vd27d0h-Q$B$=
zdR%Gp5&q)c7Kx9<d>GB%ON*`>)ADWfz2WQNo2FwKekRmYc6nU3GmurF*ercf>?TA%
z#Za>VY-oR{;O!F{fj)`L_xW`20D;xw>%H#)yikr|4z9(aviD#}ul&BmGkdy5C@J%s
zbIgEfg%nRZTxh46BOFw#G{Fh*BfHvk78;_H8pIzBbS?|xZps<f*OrpJ2v52N6QHsp
z;#u8%odL~OdDr^gdS+zF!obkJJ_MpeDc>BO+IG%Rd50vX5{dUK?R`UKzye$>;)`qQ
z3C?dUhUs$Jy^_AQQC|D=71{yF5h55;Dy>Z}i-{&+yZT(e)AF%zJ;#rS8mD6ML*>gU
z$%V6HYv}#G;nTaOsuGciDy^{~sgAoWKez%b{jvJ~M*APOO3$h8Ymrm;jD}J1&A;9E
z%9m{(HM>QwXy<VwQqt<aE+uHO$FC$_&zI+4u3MWq^Yr8sJ|zP0I{WB__wR~hEzR)C
z`_3!8B%q1(5(CoLRrg-X1{|HNYR~PDM>r!~8N3oF3v|n3HmsDTqGsvAc^jl{J#D-m
z3AhEpJ6tPkTY~pVL<=MPkN|Cg%ViA!a+*j=`6EHpXOUI?L~u$+m{|~C)sw6kBtJlq
zuS0V=Nq|wB`>$_Hlf_}>=3nt{Ut%uFiB~WEB~oksg#$GDhVHT?`-_MeQ~FHNyvpfE
zWo*u!h3epb9pyr=O(A&4cTE#TH@wBnum~n!eOCC;EQ5pXuO69w#64mhBtpaFae`wU
zr0B6G!m_l1dl6Rh=pIzkIORtz4XCs55p5}a3ryh|!cC<Dj>84>@_9taX>8asTB+Tm
z$35QkgDL`ms^1nkURhr+cKH0NX>yVg0ik0CbncHVyG1<V0Vtb-5t$H0GI=4;`it#p
zlY{UjMJKp_g2A@LMNZ<+k}gEF=Zx)q=2ONPlNzO{-kHU!r(!9_)YCWNn!b)ux)UW`
zVD-np*NcWp*jeN-6DSKCM?aok&Cbcta_u3Cgy6y#UKA4`#&gDmnv#=(t1({(kC8h{
zGIONmXR~Xqaz1Ol<Amt-9DTZ}6oPuUdKpsEb4gu>Xj+lz{#aMbGm}9#HlBFj$x12_
z(Ht|nP=mUUV@Xp^#dfenPG&zgO}Ni$BO;yyE0~P7xr`V8s}L)2KLuvO7pWp{ng^Ba
ze*RAk#s@BB_M#VU^T_NI-b_c1*4=(1jxVfC*X)uZ$Bv+o`O-|*%|yA&?%)OSp0SKX
zB;92?n)@guO)-lGKvdAp&@lYAt219x+<55p=MhxgK3M%*e@ou70jB#o6GG4_+uZ%1
zDdjChUv4&So!yfr@|0$p!o(xQct^4w-d_K0s9hD6s!+^zWpa=QO>0*z&ZNqr*`R|c
zkC_w)hpBY*m{ltU>QE&M&aaJ1CSWCojwM;y;bs*NVoSssdd$9KwFpJdXpYFo6XEHA
zV6ib>uqL2{vLgQ2SBae?jtf^oA9A@RZA$$0^r>P*a@J3<KZq)t>QNX!zx#(~eok3P
znEMUtXrZLt+C}TQB606Z!QQ;12+ieB|6aT+UphnEZM<X<W9tyHVUVTYEn+U0SFCzm
ziX*q#Yc$=vp`RfQgIdH!2~FV=cFsIt9e{_X_KG&0`D(YIyZW^w2WcS5YNIcFKF<5H
zyudwyP}VBEp<wi`038jDkYKMwA2R~{<Cx9j@^H99WpK2xkM?yasY)kC&&K|-!01qe
z|GmpXOPFUcN|e4zbQFwY8WzL1w;-+``a{X<KC<qzZ$L))ltp+Cd0{H5zA?guDO2h*
zLAOYo;^p#gtgKy{VvS+7;URFJ@RjQ|L;1{=nLPs&ZLOf33e5|mZMr^AfW0dqQQ_`U
zQQ=RRYkT)}CyUP#S2YR<4_Fqmm;AkUdDf~;Y~V%>R%YB1q~}JmSYw~>R3#*7nVJ_)
zTG*64tia<I4%5;W4*Ozl)@OLJCs7intwKsJhOptZ7g0D!n~MaijIoIct875HgY&BH
z%&4ubmC(o}J{?CkeM9HkFWmzVn5Nj2-Tf=ErDQ4%(B->CtH30GDqpSeP{a8FoXugb
zSNeC|ek=Y!V;)Y<n$XyMD9n9u!5l`M+rdGkQ8i77iFNOn-ZQTMjX?YGJ=Y(a?S>2d
z9~vTk^zYO~>P%hMf{N`QnrJcoqEhekhC$u0tFkKLT4}!cCmnslSU6q`nfEp5(sh8p
zB=3{TA#`?ukrCd@Ur?KG*?Jx+;KTv_VW`YGJzD(u-DFtbUx-Z(QtxLy(Zp2PLSjH4
zitl6A$Br#=)+&0ZfW}-CAt33hkj_8X2m->nf@>X}P-4}6ok_fs=ky!gWag}vNsOGP
z4N$|5vhCUpl=w_gYNEa*l>vpJihJ3+b4o%bg5JX1tuswSfjWUyW{M7DdExp)T8q|P
z9b;Xe4XvQN()$Xjcf!qun?HP1N(@d5%zSbuZ0@82i}?7M+IE!m7i{J(AK~evMs|-}
zK-*koaVNYhmxmgpkXgE=hwZ453RcWeCl_RXBWXx)FDfNh68@ZJ>I0`Nj$e<|FUj8T
zH`L1qD@Q<A?`+;YkmW8MGl_~XFP&0*n<i9kuO-(oI-H}k!6eqY@h$IL|9c$3uch{t
z;Bjl>Zpm=-*&zH(foR`l``P`13Uh3#Y*af-?H;GLjSPLEnf}jM<dq(;BL%OB*(T3e
zbj#D+^uI4gMqTczSInXx;->0O@^cuQW1qTL4G$;!5c#&RJ(st;q#@~JJrT|J-b&!n
zKSGDkz~(F?q&g`R@$7KwEruW^+QCjyI**tu_OQaiP&uhL0wTBf*B-rhYxpULXVvJl
z$iPIK^?$rpFR_)H7FeZu7Tvqg5{aX(k)M5N#nljoXmhDI5I=hYn?(0D@pL?*w^H=2
z*W)6v*=K@9V)_z%OT!+h-;J%ej0tbsw(F^HoP4kP4#P;`PFfM|X|ZF<R957kY(%5M
zcjc@xj2>7{LQXSkg?H&BkE+T+UoTu68Z`BXrdlgVwN-sTn`>c6&<_sHpE{@WcL~uQ
zn~yh)CMWv_N`9<OpQ*O(PsI|^$IUuJu|3S`i<m285pQk@n?$R0U#(|`r>bZ6xNn34
zD$UvLmp^|l4$POCoo(O|IKGyW<lyoo5B=&^yba~-dY@N%r&hikw|(QieifnKJ{z*C
zoJnGRKQRAy{=<~~688jxE5a0jlV9r3LU)wjb^Z-|&8X90a8WRFGT9HeY6Y=T1{tlX
z#WH7~6%0pqzjBJ;-svZ{LInG2TaA1Gwd4|FMCMddc=PX#^Wh&FXKc$NqnR6beXH-q
zd#2=SEzBmnpwT<Ho7JdS((&|;>rS<Ggk+uGi7R-qzQjZKy2YCg3uI)a-{qH_BGmDA
zJ^*5=7O_-)329skzhq;CDE`2QMTO`~%h?ZW5nk-A(C#!3P4>z7&J^590ap88hM!#5
zPPoc!Ka`U6OfRy@OwcW~FPFhaz0B^Ig(^jcy39bFy~&^nHjN4Iu4e&%O#oj)axufY
z1#iwq<{bzvU$Fr!TQ;yYGQ^jtFD$Eu&NU_)P_sG>EISDtdCj%tDL4=CBqJ5W!GJ~@
znz(lxZ{N;qp0bDDS;{M)4Tm((<~2`7%w$ay9?X=Qx(CKMNh?!wqTcHCGQ0$<$vL6e
z&6E84F?n1i%>{hyqJ`TMkH*3Z?FBt$R`in3NNY8CdznMN?Yt#R__s;4Y5`^2k#OUg
zM=tFe(Y*3r)nxHwm5=xe2hq2hz`U{Nkc^i}HT0rJKkTE8kDjJQ&p04g9a2!X-^SaV
zC0U-EIlm6*jV)=iZX1Rr8ZC+n+gUeOqbOl>D`^G#PTo0@aX)+t>NM$lx1ZlN*@&0i
z%u4xU?53!m<8xM7$G)e%nJs+e7CqQ5Rj<{|)9W&#`-f&>(A6hie)2!ZBWrBI`VZW2
zv>66!XhIqOv8rOY$NyzP6u|XuFF*J*Rs^?apdnkD#oGm*O<R=s`|C{H9SBv}9uk;{
zuwV@mV-DiG36F6AL|x0ky_*TWwdxE)2rX=#grW-_@kNZ#B^BOb#Kx%jJ_A!&Im#jx
z2Ku^eYeY!N{T&>WHkN7qF1d=&7a<Xp_tq0v76mBaPT*uf4}iC>7;jx(B*@>hv5V=q
z2_mkr+d%wda+xrRv{SU8RzBb)d{+Rx1y2A|Yxb5TZZ>(FxS3mozl<*l$g$C+jW6H*
zm<mJA=`q5nD$d%Ex0xFa$@@0;V)sQDnV`_k8Cv1zaF^a=n@uu0J$PL`d+S%;&24sp
zITN&xI)j$CVFru>eae=xZ)bHcIj_z}SXfd6CgtK>oQW{my7`L#x}%74*OE&<Ojd4q
zPm+7x4p382W2HGO>kSYBc?P--5q;tyh&>=52xfjgM*918y`)s}G@~dHs}1qeZFhD1
z`Z1zPZ!}f2HDRhz(on!O0#LNZ7(|y+>0lA2@8Tuf!se9zyGndNhF@>jLJIbqqKGSU
z$RM3xX1B1A(r{LzsQ?+KTaw_2*l8mNsy;D5xwV}H$^XVP>9>I!^0Tr_e~li*<Zx}Q
z2ycX7=E)Uy>j1Zwq~EQiQ^ir$%(@MlOJ@Ju&jaR^^+y)rS*1n!vO9GvX&WCv-vS{D
zO|mZQA`ms997>Og>P!HB$j>HeqT9}2)8c)bNrO1xMu+r@xs?iCbDHrUO;H}0IF$-r
zjveY2pbk?E8B%M$jMA0<;5=$vgbL9?a9IPtMH77Xq^#~wNN|X9#_(%t`hQ2Z8I3jg
zU7km>4gud(3M~W8e?VPW)0crXrrBURy*CUf!gZ0x>!fV3DQi|@MmNq6eEWo1&s!I%
z+|e-uGL3e()3g&LQ{f=Xa))+^D0mo0#pIw;dGOvUA9Ujl=B9|1dATav{yn?Gv}1OV
zW9ovPQW9j#V8yV=yN6+S$(~e!V+AB-kQ-_HxQh;Bl0a~xuI#6clude^g?xnC4f!#1
z`BW8|!zv2zMpO8s*+34$h<z^^^Hkt=LCU)aWaGj#Wl%;OF0UvjgEtKO<J}IvBHDL0
zTzB=5i{$w-FMY)&UqwRVBy+>39})vS{Cw2AYH_Vm`8KZlMJ$0+ot2v#`8=R0C+w3v
zl2uGp<U+{OvV||NielVIX1n%2&$ahO@#fzS{MtERB{ldp31=*O(kje6j;PwmenBT0
z)u*iNhGsL@$^P1=y%|M7Xg5BIqN`czm{RP69tw>GC1d-cz>(PU9L<mk25W^<!P}2j
zc|ONZ<eN~-edfAjClfZ?PhB>O=m^%v3u|iPWd$t=*;JLTU>Zik|2_y5vM`|m^q^XN
z3Hn4R=Y+Q^t!q9bbYfVpvSxYVU)R&(2RnFw@Bt@d%+7<=CVL0zLzX(O*lIhgm>BRd
zI8ihKJuJ!rg3<iFm<3PB;TsV-l<V!`)R9F-&2qdO>2xNJAOyv3MoC#ckNmi0TshOH
zo62S_`A^Yf9z1hk>a|>-Y5+M#BH^(qvkh<JKeXP=A47k9H*`0^>ZtysNRHkW1x!rQ
z|IH56Pv~ZtiKg%Qu5PyhTgS4~3IiVxIC+o3CtxBpe6S}ms6bjo!H(8oBD%4$vPO!o
zr+G38p4^n0ps}pb<tGFON!hv5&UC;_mP%{Sx-)lQ)QZr=u$fB>!nMFSC5QSg?ko+&
z2B8)hP=DSZe9YzLn_=dGlkRj=w%oJttRBY-8}=G_)j!nmeqv#{V&gI(9o>>5`35Iy
zlceM761%_d={-z5<@x34ouh6!Tr1swYj?$K#<yM1*=foAY?unm_)Jv36J(vngAx~F
z>A#hWO~hT-3&o}cp|gdS9UBA+mhna4UKK6}QG}nl`xh%6tK<9j(QnOyS@xv*cjWX7
z>Ewsn32Y@X#vSl+)rjbU;oY12h$}J&?6RNMB)BkD;t(VC%1LigK@xUC{$@=M_E&2}
z07mszd|T`9l9HH<LXUGyXom~T5p%&q?(4!Qt8v^?>ot6eEj@L#&M~05;{MNnZ5!7!
zVaz%7L{YJFiovW{zG<nxyak<k5_y2-L;t0Det{&35U`f1<fF`Z=-6bcx~-V<b(jge
zK6t!s3zD62Q_<DT9SCZetV|*l_dor}vTyR3N~uFwumwlx&f64hCDy{S(f|nie~8X^
zsI^9$<aGOT@A8CwfxgG;&eN&k`mXj>QB-PouVsGVTdee<w2%^T{R!97TV3_=L_>L+
zdzbPUsBNn+!w^v7rApvm311r-P#&J*D~Vc$J3}!yhuInHNS1{jFh`kYu%aYPq<Qvh
zvUeT73Zycl=1k=>wIw$`kxWJE8XbLPPg!DTU>5CE#<P|#=MB@!dB@6s&&~D~loT8a
zjVr|Y0eoF5D~t0R*#UJUYEtgM5Z1ybXeXVuJTV`Xhn-;$*c#g1k7&#ZcVdM}l|=On
zxEp-L%GB9Gou!(xVr6j+=@NW_(({H<#IIyS^C@>91$J#?oP~6CGQwy8kwuYT@i}4-
z8ZRc`)JU5je_Buc3l+?>C|=nLbhs^^lpdU}#ABh+zvTBd$z<$fV}*1Anw%!4`O@d$
zd0u8|7jdSC+r?{b+F0|0(83tXgdw%`cV7&uxlevx1mR4pKc^wE$<e{i0`xZA7wnzB
z7V?k442qB$G^sK47u-Lqfk8qt>Lez!?3224E33BI%Q8s5p{N0}(wr4WQD50;hV<na
z5&g#~2OJgt(|R(mSJVsC_T*1)_lU_w{!sW(>4$o6lARbYL~oGiKDY}|rTjPjzB^aA
zTKYS@jBi^SJ3qvoc=+ypE`0dS)#ubGVk@BVp}IBC5c&Hr2{myHpZL#Hzr!0EtPLy$
z<{+o_&piBMFZ%8aj`F2vMF@K-zSY4XJ6#^zEv^~_G!Y&2UvQ3hY5#<h3bMjJH^Lh3
zH|FbMWTT+VitMEEPO+B?4P*u=WjSxacSIaAQ_P&7yjLagiCI5pNlF={gpP1reKQor
zP9KM(W{43_)qzH!6&*tfwEKp@G5fWo3U#6#v*wnD_=I{XfYunB3T|D}H&64iNZXjE
zu-|~?vk4rt6_2r3EUbcsN-rpf>^2AE8&;6SqNWoXc{G*rEo<K2sP*{q$_ka>qE)X{
z*3^v$LI9hQStb%3k)9MXps>K#<`&Z5{YP)FSLn9%wo)QoOp{0A=_6UZbnnj5YY?AX
zYLwG%MrMVOP+>qj7$>G^7vtcPo)~AS2yx$W2;65^kRMFwMHyN<Dl;4QA_%K}aY9H!
zT`1Xj8`fB}=>f{z_q*To6~pOJtGuE(G4dJNum6&l2M(;Hvdyl(S$H)XmT%bXcuNgV
zm`b**F))7laBlWYpOc&0VIR~6^=fX`Efm-a*bK6J0VM_VE`$+<P`3>9uVEfdO+I^z
zT|<UKJA@wBiXp3P(DrVB5i9{Z4Y4I+_cw^Kscl5|E1LfGhro!SFrh%5$Ur=Ku9hN@
z>%C;SYK^(Cp8_&2sn#15_IpuG&3=&ivLQmlp;cb`7>63osUwPUs=)IOHAW(i|JS6R
zI`LVt4ND~s3eqK8-cb3ftPx)LMZs4oq5S7<36Y+H8fP&Q<9^=<=zqFXJWt{8e+9tG
z%hJQfnzKLb8cgnZnMA)h;SjrV8^Kb0=QX3YLY>REb?=`tme^k75@GJI^*yTk?%oq*
z->#YYZHaDvM}lkZ9!<=PCdY1baj+~0m~YFBL(ocD`j_dd1P8QpG0RMu0&l7q!_BR}
zmlYt$xS^}0>*|pJ5~9*o(9yAqCo3)e<a+F`n96|f_#JRBaYx*~ighRn_so^fwN8MT
zn|Sok$6gZB-vpEzn?6+R1<-LPT3+T3qFf%u+XD;12VlD7L@gm>vqrYe>Y>oeXOe*C
z4IPPsa#9UWem*`XgRcxx`}Dd$#lijLEd=$%I`~aAT3SqkRAx21Wj5Q`+-sa(RP+7Q
z{BW{9B${cuC0y7XHvFO~oN8<W)GSD>vQgX-X9TL8Y*H%I)A&X|=Q^-8JKYEbl$o}J
zOJh0%t+ZZR<myi1P#&;5kxfvX;mRv*FeIA3&y3cbKy`+!xs_e68grDN+s8t`v;L%a
z8I{u+{0&dcJ;pXum3nv#{Ogrma&tS%ts8xnA$_e=B~wlV;b%{rU1s*vl7AEs@;iRV
z40UySIF(lHsrb^Z&ToAXUOEkY$jIiH;<wb#DP=vdQVdypnay+18I2rix7ip@2ey09
zG8bhe6?Plj`<O{%7+XS@f&VO{Ev>eU3;P!B?&Wm$5(Fs-alP3*!QQ3XWy0TS|D<e`
zE2i0teGZ3@n{axe73l-nfbKgY2Y+vUExQV3Mwl1y8R({>8r`C?0@%J`6pmkJ4kF$1
z3*qfD_@&>-MZB5GS7&ZD%iX><mDjkqE!%nSTJak2jW;JF&QP@EH^h7j^NHsaYJXx%
z!!&sBzmCx>KWB6E5AF;hDyzi=%~em&jZ{NlzWVk<(Bg^~FH}B-M<3c}`5~vOuK(lA
ziO=@aoyE7%Qmc>C6y)mov{nBY#me-j%%<m1Qp%T6@O=qQ2T8M|unk#yLV#{!;NW!&
z7IlG{^1w)Y0Ya?H5*09kF*VeoHdEXO$=dwLsuA-8Pb*Hm2*fQ}%c9JS9Knex>G?8y
zdiZqZ_}E|hmzNjzM8F$gT<*Qmi?*>tTd=%Ig3KgjGEyEfPJ1CMXlpCFo1t8QLNF(J
zj~y_YGC-xE0lYvNfwjWaW(hXr>Lo=g1sPQ1@3+-w9GD9Sh)Bo-=uyVw89UO(?&efR
z&$NFKI)%8vX~TneV`=16bkIjivKElB8ISkaHf;t(aPO$;l>`KplAsUF3&QT5q*Jtj
zO|d(;UeQ*nkyiMOG&<dveRWIIdU<JC*x%2vO<#r4i~F>Gw~?EkdA98Dwsh)iWO+Xk
zn-s^Ls9W+@X7)Q+ql6H4ba%-`NtfI4n$dS6Ff`L%-hU&)d~4(T+crn%(ur`_9FU2V
zG`a04Fq4f^TgYpScyA-o=Co_^@%MhN0rRaM^8+;D7M>0;YVEJ^(!;hc8d<$n9sx^<
z<9;#LpzULyqLb}dF570p&FOZ%7vYqf7F#{aAt&96O=l&=5X>y2?Uw!B!-Su6=fJ4=
zbdVto6IB3QG6+Hw%szjycV~IUvY*X|9G>h6(b7M9nwtXSeHu+xWriJ@fpWr(i<I=R
zKGD#^1OjvdG*FQSO#g`ReP}QScFyTb{ghrak}=j3NesA+*vRsjCpuF{mP4+~I=5xX
zE6QW;`?`qW>ijNTPlRp$(7b2ufaI`mG75bv11N|}qH_Mw)cqV9_jXYp>(~qeGE8M&
zJ>b0YYt_1L3VWD-zCl%_eWC*RmkQvUy(X1U|LH*xgJp`rvH*#&u!TjD=JcSvFIRgN
zvgw2QqsU*4-HMN}J?E<`Ict<ObJMsA!d|w-*Uy=@jI%b+7vifaT{@4B)rO7-*?&xK
z(V0(1Dh|01RnX3-R%k6<U@`&-r`g%x?<RRrPMyN-?YcBek{T5D)-AFlJ|bL<Nx@k_
zUP0;Ylp+zbfnjtB#jMEv)<U0U4^PiV7a&#30EKRUERY?WKOAEOT=sueR8^;9dw?^q
zEKS+u<8Dp0ym&~rD_B~-Zi9`DX>zr%k1<W|p7I4~#=&$_NZ~ALR~F$C+`-)>Yw4x7
zYE37cB|fv#4iQ<|=_^+=<LXTOmCsiV23JTUyFL~74lH^M{FsMfpdLhybMCt~`D&pB
zsMS6WZJ&AR`5g=6nEfHJ-orIw9lCHh{g=HzKEB4paP4<l%-G`X4A<gA$NCbyVf+V^
z?$YgSSfi`HHtu_IpDcmV%5=;Dm0X&)(|G-g-ngi!d<nqGdE`ZDAs4RCR&QJfr#lwT
z(bo$>j)?N1g_BfWeHHZmGA$9^oiAKTb#>CgE#HpHxCqL8E`^Zv&^ZhIZ%C%wt^++8
zH0F`gZH1zPEdg=Oi6&xVwUVl@nPV_I?^q4hDYf5%<7On^Z8L$MHhh^cL=22%54|s~
zwa&=V`VsQ>i|1Jle$&>A!Lssc--o=PzjnY`rE^+?0VWOstz3rKu&+8pfrn&kZ8goq
z1C_2D7k8$`>$4RHzRy1&H$9u9iW|=eBvm4`8NK2^KMN3MoX3WwUWKq&KqpfBDFN~1
z^7U%?!L~@B!A{}HT}{=H>7{w%XR;zByao1}@Im;@>Y-ZDVhq&$g;Q*m=1-+?i`|(C
zNMTk(_N(Srj(R9%_NtIAtg7K|njnGmeJ2#SYFmt{l7iIif#JFjyjqqm%Sn_*-5~U@
zoCJzjE+yL1AV`=LWjul0R~23XEa%^(Ocvm!tZgwJQ-fbfBMI0EH;M$A*9`qr<z|{O
zJEFFM`={ZzO;nj)QH=*HKE6!L%}mxslcD20KE%}s^}B0@1MGt66FUBgF(VYKOJiZ~
z!?EybkHqO8&8S6{f{I{?JHKuO>9Qgy45Qm>f_tjCsq(L$@dNb}h5=2;iA~wmHY&J2
z<oh6X0NZ?ddDrpo)4Cg<TieO)J6_g`5KxygB#zFxc+aD>Rnn>@mc}3TfvLtfh{{U;
z&-Fa@sG)T>3OA=JpE73(l!^3M$*#oE+__R6f+`C`5k1qHitbEg(Tep-mYT>e6PBH9
zp9jgKcVVg{$bcM&dIJt*iZI=seX8=aLAzS|_qm_E0fna@3_k3LXO8}4##I?S+Aj9>
zqFzAh|NXOVo1%-rP9R>(<{$IFkN&b9&+Z@h#rTQESaj1X=hbDe;=Ms3SxOByHV#qi
zD3o)vP+~e}S5||W&Q0K)+Jg#A_PV3N9<-ylT`UI@FP*7vNW}v*g%QMj)0t89c1^9B
z_CQIInZBw+i{2TJ&Bj?wz3`G_Y?o%93zb<g_&1`OZ!lLeM%0QG!wy|aA#kiJc{;eH
z*{c?RqLtNuKx&Axv+h8ABzsMr-oQk~l?mJa?K`NRl<ip5VPa;CIhr8Vy}Z$NH?1ce
zs#l{kWu{`vBQ{RjAs)S!l4mIxb~FTATd?UB<du^~sNe!VxOXcM?5>olZLb&cRl2vo
z$Cn>HW7SruH!^CE*Xz8{3x=2P6pWv83ls|bWAm9M>Gwe^l0B+`WtW5~Y_AEvXu)oS
zG%G8u5!-MLxrGrLZ%r(LNh4m990J#*3rZB-NxOat>kfVp>fC4UkLEa{myTvxpgWsn
zxuf0r;c*Dvv`JFPL|WVLGk?zV&quc(QtAXb#wVzY74q_~#*fzaSe4r~0X6OyE@$-m
zoeboyi|n7J^TGU#ZN-{d*B;4K&Pi43=2^BHy_`_In2~Qe0mjjrI!ooNCyT;DtDjR*
z(SZUFXr@2X&|K;ILvz!U9e*1T0ZjH5m&x|2Gep-M7X)3dxldoc3@tFu75LY_9~_09
z>cm&X7Y3__yO!}Iv2I!isZ|Q)w9#44p2@#iQg<j4$fsL<m<muTwAR@vTSZqDN3rQ2
z=z_`mH1{bTta#s#9GRF*L-bckuWft$DmQ~Ws>%k&!PU=h1r7ZQCP8yqDpDlEj^s;f
zO<aw)<ww*&+1pGWCL0j!3hTlMrLK{`2}Fp_3h45$P{$BUj98VLP*TQ3h`H8dLGrXr
z-LO@>@Te;eEMXTP66`i@d_Wl(XQ+G_6r-uqNpCFD7g(P<TY=h^UHxGDRV||aI&aA~
zB*zW+hXyDgCwtP0$sJWyw)9^ac<qtp*}~9qwCs4DiKEa$ja{q2c3n7k@70wv`7h6;
zCl-*VGwKsUV+-f<sjb}y$uCCQhvNWjxsYUd{xvXI@^MU7)nek(_Z;*6y~xf7Vbs67
z6VNMaMjfpg?)a|&@qc_=de8Z_-a%RZn<rObQp&E+xW{Ro!esW>-+>c8s>2a}-`GK7
zC)Ca{-8-3d-jcONH7X`=hzGYK=TRwFxarp<L-TsiIo5X+0*bepxW$_^t{|eDtESt|
z?+mVlxJD$S^o6qHKv~-kC%%JA&OxWaN!dU&d_KKZ|0C%@<wCx)iIdmg<PwzS%(&v}
zp2CdA=kwXCK+fo5isr9|4q1`D9%ZYbnV-St*;!S`+%0oRS<RC7a!t4&+c$2+<~~%h
zKXj<uHAt7FADEuKeX&?4xVP5%sheCy7>KhE={qDI3vM?=mkryiK<&gPk>y=IIqz~m
zX0EVXTZ2>hOC({-RkB~JV|$wd-(itwX-9WfqLpHeK4Qm~fGN+Wj0u))-l1vPHQQ<`
zgs6bD+Bq9k78x~W1d}vc7{Rlw?}@>hvdZ^B0jc+pepMQnFIz`w(?Pc7MqP4TtZ3Qt
zYp)&EtAL(;QS-{^-t1C+OG~FCQS-BJ(hX^KwuSAQzGI;BA`|JPlElCqs@Sg?M-%C|
zgPb)|UwUDSAyz0tl2(L3$p!gr(?J69R1(uh4*P;A#3zLZb-M5KYIvrqZd6Y1eBv@p
z#&e6dLt*@W7ah2s%ATl>4WUYwuLjHGgC%KGd>6KT5p_7~0Q2<e%-(}Ar?2YFhOzKu
zo6^LQ0BU%q@)C0{srXg-)|+`RxEPh9yr9^t+t$py2GcQn@rEf$XRVF${n>w@BxMj!
z9MqVi4hlmTa*O>79#a4P_c7GF!_yg$$uJ4WQr|QRwEkcq6ZBcAN_Mm9rEJX1M7vjj
zxFchS64#6hgk4GBV<o%)WiGuNXe*#p=<cmY!$d=jdB$l~998e#`)%aLU7E7s`oL<7
zpU~=7p>GOL8P8Sf&!z@<KBQ_E_W7sz5`Iw~h|!a!v3>itz5KZ|tL`5f$ZMml$O|4@
zMExsCNYRP$r^S8!3r&yr(9xYU_|l?@yfk3YE-?CayS2#9VWtryqi>&1Z{Mo(hu@tz
zH}Ya-s$RWu>*0-s;n!ls^Cperl#Nncan9rXGtm4tdfj&08}W@^YGP@ih~e|u)xXEG
znHL<gc5MVR*78m`0(^c}^mXhVODNiS`6`#H0ML#{qK|s15)1whtfDvnmK)sgYJaqz
z!z_C@uc_tz#Ea*v^G*QMK$$fo3-wH6*ntKUim2wH+A3x;7W{|i(wS6IdJfBiQI2^)
zfZfwW<+>fM^7*Wsc}rf&&p(`C>C}1a($QCy{;!P+uIi+zD7f^L1yR8<U;c-K|KA>f
z79Vgy?`t&>=hw#H3o6Xbx#T}AQv1x7;XVJc=SeV@Y?i+}8)D$_7a?`pY_5vZ0*~AH
zLv!nk{P$<}2!=B~<$-3mhC?lBg<=f4k*dTZ6Y}Y6hk_*ILSn7_RS513QQf*_ehxKh
zS2NIj4H!Ju>a&Hbe4He!2q_==8kqeaxQ~b>7?mx=og;7*&uuHz<{jqNqriY-$!2wz
z9lzHa=xt{e?%kvPQ<$tT*U$djB~`>9_Nkm<72v&0p0m!81va6wIe`<E>mglG-L;_s
z-ep1>JV2M)ft4>_lp{5|Fj68<qRs-SdJaHySkHU=WUFmX+q`F)Du|3dNdD%f_6Jrf
zT?TJ_=?OEHPXZOFx#aWQZDZXY<@g*n0s|J-+vmkDm27h8jNBh8byhFmmu{6YimBy}
z+7j-;Y&qwCRVWe@YyaV*uj^z!{OXtbz;~UODukMC`V3t^n5-pv%yHdz;`gulEujLm
zHGd>VzZv<+!KDwg5?FfI{s_S|Snpd<>znOSMAfR>rZk=G+NeH{n4jF@m%T2;QDzci
zX|vI6-MxQX`RKK^GiZS;a>U}$=geSsb4TUuITu)y*)V!opfpj~YymYL(R9+%lDWnE
z<;b5Q`V`1R|C*Y9<TNVXyQ-tG=+^2(L-Wu7%?SQ~KYL7tsB#M|kkf-e=;)0>+Rk;0
zh@n<f@efpelQ(pZ2n!X38fqeFDV-0E5N6f!*2hYAcTy>`y>m<wg6rykXineI{T|$#
z*>!)_jXhKDB=$8d$OwD9e|Xztr#Zaki<i$H@!7Z9^QBShUPLpvy^KA+W3UnBC;S0i
z!}&LAxa6DK$JD7iBc1Yb3@uq3YMz(Q%v{a~da+Xj!!Wc0xvl!AIKJkE^Mx({<i*I?
z_ZvK~e8q?t`fpf|D(iOq0xxcFr`P_%PimJ(!~FixjKul8jsR8q2DF%ruzBqFpV07J
zJS2Qq{k7Th{`dDwcYoDK00Tov_=#Cie#C~_U+s;(apvdB-#!?i-~2!02Kr<A>D|A}
h3htOQHwFGS6Y5o$oue@M=esNhljr&5ggfK^n*e=u8At#C

literal 0
HcmV?d00001

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.030000-0.002000.jpg b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.030000-0.002000.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..a54258caef14f705cf10977646e8bb94034d32ca
GIT binary patch
literal 75293
zcmb@tWmH{3ur7FTw*=>4K@v2<U4lEo9fAedg9b}*ch}%>aOdFe?(Q7i-5+;;%w6lg
zcW36UdA)!2s@`3_x@*_2`ueN4g|`g=wv2?d1ONsG1|aqR0N$1Xq5xz>L?lE6WF#ac
z6cl7sbX*K{G&FRg4<E5`Nr}nHNQr?!3To!h6rUKWfWR+Ybd29v*xA|1Kl2E1v+^^u
zv9tciBrqr_DClVDgculvtdu}X*8lDH)&amlhUbONgM;}5fW?7<!-0A00RRC2Sh)Aq
z!T|p71`i8|0E38x{4SNl2Ef3<!owjT!o$NOz#_mR!MqQL$3gf&$?{#v5b@(DhrhV2
zA~D%jRLY%`Y(|^sNO+=-)GEHQ7dh4V?8cxj8ZlZ9RTICs-1pgtVF3R{6#(XaHUz|X
z*%zGuYZ32q0PK5%dtVO>4lLY%=z&-I_=(jJK?K(!d-H7xfc`Fn#eu^C2mziRvHb!5
zlmJR(VPp|(*#FvT+~X)4*#ZEiRb_vCX9|Yhu$Er%K1`4Fs1fMxPuVEA2}`$I`l*V<
z*VT`IwY<}`c;-3T`VRznDF=s2bu#i=wX+Yvd|1+x#<sqI<UxlJcRLzRn`n%KF?cG9
zD0Dq<l`D6eioX!F_nP03{Gx!nY}y>N+XCR6M|{5$s@C}Mfg=J0+*n@tqiRkwe9ye_
z)Mjb(6qf!x&CJ7Z(zM~=@MIlRoD3Q9aq5B#bQFK43t7*YBinxj`?=B8*KVg|$@McD
zW(5Ll#+w+K8+Axpp+P>)y?3gUl8K=>c7O0d$9)8ii)93#V`+*9;(%26#@dquXw0$X
zX9Q87ac-r1si1#rFyP9C54;4!T95jvJs74HSYqlrJI~rRV)LL$q_m*lXx@Wx%JO}3
zYhd)Eh*+fHVEe<Y7KW`d#%j*FxNmKcz`|WqvYV57x5z>llE1gI=)yk3DujM+ecl#N
zV!xdlRr^kAvc9Z7(YcQ9yaAp_pXiH9HhSoYloXCfoI9aYTu9)?Ft7qQts#Zh<CP)Y
zao!*i&80wj{Vi8@2{$p4&FuG6<0aA34L5AR8}@(zO%{o?DZ&xq{khe=-}=L>%+p)!
zA0WvIBw1uOWF+y+$I6rL9`Mv(SW<yfFp7M#Z-CuqNh}4ykn1UIe+qa?WEf--fC%=V
z|HGYte(rC2ed}PjyanCkq=bjQ-Kq<|U$0r~DOA_Y-r?j}AE9xnAiB!QmiQZOhp~!C
zsg>i*{RP~Ch*otKmH6rO&ZzkqmC>wO=h0U}+>5BdS5s{OY=<T#nuJa^vIq(hA$53d
zm~RZa`Mt=5(&>WyWq^RZfq*fs$bHt&?f4UC6Wf^ON}bHXp~SkXAjAkP8qK*uqnA1l
zILAMnu)|cqlA%eN?&8^3UD%m6CFi}8gW)O-H3IJ1Ml-wbHVI}uw(8F;u1**I586nR
zYK-nEI~5=M_B|#xSC<|l=k!Tx^=cAN3%UVT-!Bxz2QSINX+n_|7e4)$505t&{lx%3
zXG3dSbLIx{1E|VVB)8{qDZ&+21ZjZ2H7C0d>Mjk{S8frIegpK}y#baBXLS3xl&HL9
zN~J~?LG{n&ZF&s9;!VHC^jz^VK74zuZ^71cDB_Zx6E}Ee$U5_R0|>nV^v^0|x0rkA
z(SO8!r=%6x{yA^oz}D$;N!o84*6G4khgA>?WWY71GPWN04BI`p>XWuN>V;sz_{y&+
z6x5F8-O75Ty{}Je*5qV=m<wF&U9y`fv|NMtTK&uXh>(!PP|i*jTRJB=D&x_{>gF5N
z!=rgg-$WnWEvvsVum5=9bh|%7)>94Hs66RA>=<d=P9J5;p7>3Q*T>Q=u3KS(F-r9Z
zIDM}j!&)2nbMwJPFl!xrtir0hs2EZ(W{0hu1&t3U?}vB)P?Hb#S8Xx}10ZdGJ07eP
z(SO6!Y)23D)s3;VEo0bSDJR4x%TlG+%XbIE=gCIb6dxA;U0u~L-Tbn-H);M)^Z&5n
z$_I=MN7`FS({^eYZD+hjwE2yv2)pvQHnKnW+a0|eR+*N$ms|hs-7M&UY25x<PffH9
zlIHx>Hx!&5Ddg}6K|t*a-+;}|26-znHa*S-OKd65W>&$nwJK$GV7dfrP`;23-d<Z6
zvxw1f_1}a4Z}R7?M~BD>oGRt7R^lrg{G&;%)pNszG@U^C*{WK1c82gn`IyK%{plUm
zziq>R$_t|XDPh!vTbL`Gv>7`V{OqVNcZ0C~rfgk|YUp)I7*@7_a!{AKHy2=|)MPjU
z_}&1n`ewBp05OZL$?@5}LK=aG&p3ra-JY#deLW8D^q-ssSU?u(w$Al-`;|0*#}*Lk
z@B}t(LoD|43#fS(*97qoAwoNct6rZ2FE+O4qhgXU$tk?84u*yfLzjS@{IjrU<mkT>
z#Pul|7Pb_fu~)c!Qm;6$oW%nAZQ)`;Z57uo?NFWjYtcGF``OwX_!}$9!~A!<zjg$c
z<-|vtc4)bqZ+>+S8WjLi=5%~&Jj-f+;n2|&u=P9NdX5kR^?GFX+)iYkq4eg}1f;>A
z@?BcBi?mP?*-;C^cq}{X-k5D;F=a|;2yXIGTMcJ&ZE?!TFxri}XZGLrt*+sPNw=oK
zpKU*vzo6dM;fCAO1omH+kCTH6lXkW)91@*T8!u491%-$2qDfP?8)6hf>441q0;D<R
zo~+WwOyi{YmURtT!&<xMDqE_vEJ+-<_5_UYd#YMG?s-XopJoq?#f`_qy&>AM5{9$i
zsMUT&Ff(~&w!8MPMbz*nVchOiKBlcJyr+KP_C9h+f#i*L(9Rguwm1+>ODvL@nG!%T
z5*&L!yJ$YOrUhXDr$^bSBf|CiCutbR;xFHiHnC>efKgdn(zTS>Aao+os*)G!-rZJE
z7vF@vbd=u~9=|0q+WTYCQ_Oz3Z_Gv8g&gtOkc2-?`-$d!V0H}w=c4}VvNv#cSfF-3
zTIz0>Z?W)3Uhgq+uy}#nTu@zB<`RMe7b-%(C`TP~nbB=fp~v)CkX;m+-C$f-ckHSt
zGmM{&{Qdv`PvWB?sM>GG+GWI<4+f$NdD*|X*AygqnVOEBCpJkeY?*JusQC_be*^e{
zYY!l*Pdd)%1cy1g+a+s+JQ!1TpoDRIrpm1xcGU8lTnYAsk)3DehcB(nj_u!&t?PNi
zz;)GWB8~|$Zd?R<KM-6F>oR$N<m~;yMbHK6f89}Da90obR&?7aBs5X%At!VNTWo0h
z29W&$=J*zM1G`t({qPz<f=0hX?^RAddd-kIk9W*QPLW~^SI4242kzdDTKfgE{kbe2
zpvIOTGj2cIccf8Qj#W}<a~q!K2zd?rWNaz?N|Uo@l{Cs#nElG7-%<s(+>5<H+6}k(
zb>PFE<pO{x^3v!g+vu5XRz*gB4cRT&`-jHpq<`XmI2a+9!`;b<B+Q-Qq{)_slUkI#
zAc%8DzWDpME@`~Y^B16A?<sM@UX`vs&X4^vsveUD2A%%UV%HtTy|sAGRK9zyct`b6
z!;XX`S`N;MNxsp&YZNUOeq~`B7fd;`TQvnM!Ir9h1QytbfF`h>id+}rVQ?4(3ASa#
zw;bf|vG)dO+O_<-n%sL~<|i#mXE@#JHq?3O^uUnL(x!MlJ1~go&+Wu8{j;^Yq+5GP
z`}{D}FxLdBuXDKK4%}DLY0k%mY|Ef?qBhrTK_~C$vvO5=jbOrAd>YO3N;pVhjBw0@
z_Ij}Q$S~7hQQysHX&7m~B1<*_T^BV5H!#iVBLz=xxp|OFJdZ?<F!9y?t<o-Ql<_$>
zc%d*-I;~S5Rl(qwkX|EPGYcI~t7Si#BFv(MZpVK<`p8$Nxf4sfnBA7`C{w)9&v)Jd
z2m1F|!6C?_#T?EU?DJ**u!eq}NmcQ~zyn&UWXQZ4Ulmu#^h{IT-6*Z3!Isru6;oYX
z0*C<$CkFMofx&Sk@k291(8z=K#QrHGvnzwQ$NHRrLsmre{?pX?W{I_}yUpDfHVLe@
zuagcJ)87k>?wp0H6)eOf(hM)r$ev@pxi0R@UheI;DkYHJ9jKyPrwVJoeb9+j*9kEf
z0uN_OHf<JuImj6*G7g@JJA|CY721)J6YN^I<K!fqct)Wo6r4oEB0m%ejZvAvE#&8?
z{=!1j6I3jVXp`-lQ-LBmwyfM6KW#yMsoH}tweO$P9GhBvo?XL+FP)7~Gz~0hic4@4
z?mcT`xpz$hIxkwzVY+3nTj&27V0TnKcnExBg5<bf<ib9B|Ky1(x;Bu@JHb_U{rD|t
zQfhh6u(hI!l$WXQ-5Szfk$kppl8)a1b`k-7kP35<6iBL(Vg<V??azOcIQ;i1#eYil
z%X1gE@d-TY_umaYmh;QXT^c(=9AElvlg85}DFhQnQRCD7p53e($5|+WR3Ge?Gc%WH
zzEf)JJZi||n#k>6M~S~03@Zvc*u13$4b`HmH|k(3Z@9u6?LU~`-DewcS5LmgJ}&i-
zs<2V|7b60aOhuEKPqcYTHj6{EAvyN^{n%isG)pZFRvpu+bMC``2i7PPFpw{ew9Q5I
zA(jiHBwO^h%&x4(UUc5s_4G{by@NveCMlQXIMdO>A)5{Lp_|Bm)|A=okrS$=5CYTV
z_n!3M0Quj`cbXGc;<qvDg1JzkHL1m@Q>)8^cdAdth{tsGf4J!wV%chgtwQQmyww#u
z6+RJVl)Mgy{mX<0KPw&$7*`WH5Wq_MzHj!7;$dQ7q~(6DiE+m=)M0_icIwA2Mv3{<
z?eDJcqut#2*3`<ZkC?rt>%7bTbDRg2Zgizve1k|mr)1xC_gf^zR{1Z~x@bb?ksNxQ
zzIgD<G7P)#Q2g9)lML>C0~{u(lOGA4YAl*i`mQM3D|f=J+!t>duh{N!{Q2M>8}iM0
zzGio(5%aT#Ei}+bh{aavikHc)87G8r80y3V_-efvHLVDKr11GxfToc20A31@f*~VN
z3(}fNmZuTReUS<A7>`r<A@E&Q!-%vz1!C%@LR4wWCn^kVL7P(_ML>_Vu7<G*+=-$I
zQ;BR@tvwzRVyhFPQ6eDwltZ_j)dIFIW9A8oCW$+0(w7Mmk}wx6Q3Mvpf?ZgpftQnx
z(n|-PB#32w4){|_A_lZO$8(q_=V;O#NgBj2F}*vTM`3BMV!~%c4?*N=Hx?J6ng?3!
zUq7S}13RX>D`@tPp6DbOU;Ae6gymJy$f-|l3wvN1C}4OQ>4^+T`B*bJre}pzpBm^b
zO-tej*~;B8;RfkU2M&{8NH>MV7fnorA*V1clZX0SgT&7Y#K_b!dn`ZOeiRq?kkTyU
zEv<RVT<YbNK2yOdJ~d@M)9e>7Jrf`mpU@c7SqMiI_A*A!R<VT$6>{8u0e@p8!SMZC
zM|mMU5@DsUzisQX)yCmJ%0a`z!vE*Wak{F09&JMT);BRdNM6h|-t((hGFCK!kl4@p
ziGSe8mbJ)0iC&*=x#QdkD`)E&Mz_0xr>`hN)>YbpOGK1^)8XYv9OsTc6*N^>zfP;M
z|2y{>B&XrZ&^?uel%@K{zCbAzkXIq)XVDO8Ng5{8r>5k7Nxj0umJAMoHvmqz0!olx
z!Nx-A<7NYyMs^meO}V~ew7w5sU=H#yks-mi^`>~|8u2_wNKiB{xtMI|khTuLTuh-i
zf^nio?&g(oj|Q)s{>A~hEphqJmz=Ur+Go12Xc4O<br#nzA~U@?f%$nN^O&4erqIFy
zPgi)0QRj=5L(|_rm!RFf`HBk2tyu#uVFcPIV{%3Ip9E}c#vw<Ii2XlX^O;oD;!iRO
z^dcYp1}a805gDHe2m*8Vn%cB<Mhkt`C%yFfl?yRS9rDxb%4<4Wmu@pNT^~xGD>B~z
ze9u~2XKv3G1(e1=GqQv5pFeXo6~peP19_qrtqZQY{woObpC0S~LDDE?P8|)HiT%^n
zcky|8u2&8)7%wIN81qOA-Zr-%IVa|XDr=VFsLi5eBm+}Ox@F^hz`(nq<8dxdt()8W
zy&X-mzNdd#94PHL4NL^cu)}$}*dYi_8uX3<V??=vM|EVD!P{S*{|JT*9IQ=ES$BHz
z6eOr!X(DT#@p;g1c9H&AzmG`>+T8Ln&By)LbNQq%+8lX!yks8R7X1q@Kw_mJln05<
z_6_hdFIP`5!?_wGjwZSDliYOhPzSkcc0HbP(bThi<jOlewsyxtI+)#p1m#e99Gt0Q
z-DBYAB-@8JU?n~@8JH}=eCEzndns<;84q<S7ZU6HG3iP!T#8SEfW!%f9&FnF({s|3
zZQjvf#Tleph*m}`3w;A%3(9m70`W%0tCXYhS9KBU@g<%Dtgp-D(7}bVC`f-#stg1Z
zGp_4cJ1H($=7gFarNc>U^$qISMHuTgEUc?FJ)`a>88Dsta!M0J9jMI|Lki6h_P2YA
z!Nyi8RAT;CM7+Lju4-XCcQ)Ju>m#lV?2z8Yut;0i*{>?MUP|+{d(I@973nHlbxybF
znZihbE&O!Syb^pwkL#G+)0|7l@-hiPngRx*S$Dr+x}8_$(x(77XsT*-gI9_(1g&dN
z@a=fW+jY@g`ArkLN~gq@pK&SB+mj*92M*DtJJdyO$F@oBMz?#9lq%tpfvQWz96<pa
zHyQbTq!?7pXyp%5=Y4BtPqSWyupQ>jLLzj<L|dG!GLoU9Bd;qTG&z`<k%CwweJSQJ
zbnh(pn!}=0A2KCRw`%u_#w*Cx!`(}h06m{Px<M)f92<^lUo$t^Kg#=e^3_`XT~>kU
zx09tccV!MQ42cS<+{!5R(3x-iZI&d_+56dWG5(A64KN$MB$d{>3RUJVr9fVpG%V6j
z)i#F`1qG~h4fdG-a^|tp)VF2bC4gu@vfa7|-TgBS{XEQ8YhrET;IIQw$$Dn#KQdqZ
z@nB(?Fvjep+_HjcQj6mqc0iidMdUvf)PkfY#eC;&u#0BJ<34F-IJVA{^9I1Q)FaVh
zrcxNmnTsfQT^kl}-^`~pE$GPyon)IB=I%PSIz=}<Bn!Y+m1a@4hHOM>y^b$lJ-h+B
zgGB5QEaH;7eA-p>GUAK#Um56;fsVd{hF;ilX}umd>Qy@qGFL&op1m{qIinPjf0^$y
zCcR{S%V=k9Pm5iRG#I1~6(6^e3s$923Sjil8qPR581J!)ol2V}VE|Fk=EfHb?@l9$
z6Ni(0Fro^IxeQq(q&#%@Fs{6ZvkJ{3phVangT(%=>SXhNE)|L@VsOlJf0O<IKg51_
z@SvMF5R`KRieh|Q+*tT%qfym)NDV$d;o)La%G~YoR`h?+Q525}>!XgZv>p{uTTL$Y
z!l$LAz5}8A+wJ<Cg|26w3@W{9B)#f0w)Yq3fIac-Rr@acSvu$KW<1LYX1*|_=pnl7
zUs#Xsz7ULjF0@t{C9EMW3xaL<wxTriLu8Yr8ER2n33A6Py}z`cZxbm;Nl}3ZN!a$+
za^o2l82)c#cbQadh9=@WyG|*JOd$j}<f>b}z4XloVoY~byqUJIAv)&|X)<lLx7K51
zBro_i=9KlPf+Zh)XL5VsFOWNH7MP$s#ZdOc6!!QNG74|YPsqBSIKN{xgxm5;h^-mf
z)h=mmoMTv7ez9XwH$q~1SJ>qU5X0irpchSDU588tEEW{DKjsNw5jvp7WK3$uHmR{?
zD#tOg(j$t>c}toVxk%s^&clvnctiavT?bYn=YIy#>R$xa*+8HHdIRO{(=e(X#@fzG
z0%|~UY<2{(Td3CAXN?bPVk`OJ8`hydKeO7%T-9M3lgy*PTDAlPDxsOu9Q8^gg<q-)
z5JD@tuVm{#Q4OyNKA$Ef(xsKV3ba{n3#KCeSa<t-`0sImaB5Eq0J|4DNRK&#?V>&A
z9MM=^NKRazl6BL3tCdrrb*L$u{($y}fKHm&IA(+&b-MH4I76ZRWGdJA(^JV!*QCMX
zZ{p{%Sj2kK*F0|m@BUf$->=;o-(9Ep71jqlnP1w5_y3g_RVlYIabT$Nua3-IRx1uc
z(-J(n$>?}$-Mpj^jVU~bo(OfBfbnXV56)aB7t^m{M&vKjNDF%3j%g-aM75N=jkj+-
znx~+{`%{zEZee75wWOD6x{gxKfPdr%e6N=^)wPNIFX);~q~Q+HZ-8+I5c$D=osOE!
z8^FcwMbFfuQU>NVto@8WX*1cx`w98VU2Bne*e8s{h<OTmU#-khtkb{to^C}^veCO}
zobVNBYnNUj1U4YJeXV&C75p8XjU>UvawT*xFKX7+57+!%i!j`AI5ZFqGPR3AF1~N|
z#Ve@U3Wae1ARs*J;uB?d)4P|Ysx`_#eeKZKxz^gzc+A6i{<QC^Ac2-+l`QN=Ooo)L
z=cO2_9^^UJPSdG{u4v~b3m5U1N-R&M?u@0yB;IzqzX)2Ih(G!<`6O!6)I>GnS0W_4
z!xyuMvai!!6HNalkI8sginrmfw(5OHa&X=+jf~)ha{Y2%?man$cf6@_J@kmw#jgWQ
zZO^YJSL}o}GKI_+X(j0S+WvJrx8mZZ;OcP#!PQxX;b*iZfIq%@A)}_W{ATpojNj|(
z31v<tu|>6q-)1J#s-mE<JfH&f)ghb2f46fBHHXvnBeqcBRpDjUVRcn${WtKrmT_|~
z={B$3rM_hoi!^Q|)#}3695vPN;&P9nDLOzo0%pgDa)Bsx%M!+K!3T?{vHXgMKBi=0
znc7z>J-YKBi)nYY7KapVP5|b27TcgfsLP8g!=V=XFV3_97dYRkV-wr3C9uR!o!_bV
zrbR!w*4@tibyPm3Kddb`-auze;M$cd%Eql64_~ah`6{ljgt_`czs_oGFWkBy@ts?)
zz>e#VE4hG|%#G}hO<5XxuTf9#OucLiR?#Ju_|0$2;KPHQqJYKRgzOUm)Q{@_n;4K%
z%og{`Rfo-Z4vght96GbL_XEkR!C|Ga_Qxcdt>u*yZ&T$ZS+v$S01elP#rS}XvNhp^
zY{owr9?3vRxpfV9ZG`Ce`B^>$eh2i;wod}vP2o5A=M7F3D#@U*SsCp=^8kcLy6XH2
zVmR+&nDWDYukD?h+q#O<K;YJQ8s@nq-cH?jOYe4sJaaBKHNN0UrP)hekT^Ctv1$oJ
zc%9KABK!7~^IQ}Pc+H}Zg)foAc{T3Sr4H4^0>c{jvq^Q*m`*m92I+Ey`2yfRVs+sz
zZQKU2ui#RB1c&3qIW9kz2OE<E9vB$?f6j;!bDEQV*IXt=)~()0>8cYvw*MY}u4e@)
zPpb9&Zb39vqr!1VQ_tTeqU~B^;08j|nrbLkZTsO(@=)epm*5_{FqjgMv-|kF>`+Qv
zfbSC!u`or~31^T^-<ZIn@k*ZS%RS7E#_WAEj0*8_-h8bmz?}iEQ%k$Clw&3I-Pj79
ziOAqEA`49#e!l@mRMq1Sy1+4`w!6mL+$H<p?pmvH82+MPL0jM#0-So1=4X%Ew|UnY
zit0c~)6^arx#GTBTb%Eq{|Ui!uV*)79Ugk5_G0Okk?z*nto5{uqyL{hY3jCma(Q)E
zk}K=y-^FHKi?)~52}w(rwcf=(R^7Tjh)p~gC%@cYhdCLU1IZl|`L66oyo);~5dKu|
zd>HVMpX`NCF6F@V>S1!YQz(?R<xQy3qUK<aGItx{usLh$%n`a!0J0X+udgZ%y~=C!
zRzI7rB%PS;S^J*wUMea{rvwzPS@vR0aN~|LnK`q`-Y#T@O+lZBHmYhk_{>Z*Htp|p
zxlof!$Q3_>)cNy(s_i5D+RT>5*Ia6f!JD9O{WQY+qS6hMW;3%O^(|}^s*nA~hGmTb
zamm#ZjkXwF-U$gx67zj)mnaC`dIg5#da(&OgoR8)+Q^Mau{)PChZieWX##({jhH`N
zvhHW6L>A&eHh2o=KKmMu=&nlIk@EMOv-Qg37^hDe*kCj=nwQWopU$bmy#ZD~@2kH7
zEVRY2F%f!R2+}dCWaJF=EbcG(4gFm;)5b3cKaxJerjX|MS**RkJ!tEI<K4tVCp9t-
zSzstRcpC68Bcrw3soNc0?@u^EvN)<@l#rN3ymR0V-ZrExBX3s=fBsqJFG-r|)Ou#R
z;*g(Q+L8|Q$e4qcNj#Uty$>LuvEl)(#W{<HF!RRsR2VM|B?pqLtqXEOs$t;<%_$;1
z2~rC>&0@#WgM*lcS|)>!atjNwK;q>S(qDZrc(Iy_SvZdl7*qY*o8t%J(=(kOjx(Gv
zoCJ~f;LW8Gk3Pe9R-t^6;|{m6rtroG-ABA;TF!0E)`C9b{V@L8*gj(&S<jGFG&jZS
zwj#=Sq%{f^a&BL+>?cO4T-0-&YPwhtBdwTNhvFOOf^=M4xG(JSm2!)?e^C$3aebSu
zFuzZAeS+IBa4wt|A{Q1ZC(11fh!Z)#Ut^xfr0<pc|D3rs?jfQzE>Q5s^wy+)ph}o*
zX@$tT9Th$3ajb<yQu~{AwC99$7}JfSK9*Z~`4-S?*knqWF#)YPTTl9ZF~xH6XG(O4
z;xx=>lL8E9o!I2@Y&;XH8+}dehbEXj5Z5{_6qU~Vuas;#pdLIb+&_m#ry}6f67=N7
z*u%%!%DjR;)O;?Fb@-JYbBW}m7Pai$T9Xo!tz>}9WyNo|!->jXo~Ue+uoUxe19rS1
zs3mr9m848_g>Y(nA8%l2+F>w05Yp2a_IFU53<)+mq-P9;H-37@3Mu%JUS#duksdR{
zuNxvg$d{4pgbc@E(;uo`{4r*CPcMlnCwNs3EzhbLjLtmdY`C5?HNsOG&6pLim}7BZ
zVqWE98$6<F8&;s1XcWFO6w&1uX>2_TS6pqfy`Fq6?2c+v=n<IWZPhmVSuwRJbi+*m
zTO_GQC{070ufGRBuGGv3-7Z9%xM?As>(fyI*Y&m9@0mx4Jpo!22F_}uz3$Md<W8a5
zr_ai2%=T8Y>DB-Uf5I>tuyjZuAxOjW4ZtibSfc-n|5ixXGOsN=Z!tF-4OTLcbC)N0
zh;JK|D<11qi<g|&8(+yQ+7pombwMRS6Q{&ujLt|$y}lUOA6>Fm4<uM<`t3+l;g+fR
zU^D4=!{EFiPx7AgHX|iwnc_M4A*h&Cx(2L^B=f?m`&II?)d1H&lh3MX1l1=dv60;Y
zHZUDAg6>Rq@QbpAF60kUn+d$NzpamK;NhmK_Cs?cq|mE+y+lDe<8J^o{m*lH>*0;-
zM%rGuVF@2}Ng^hwN0?hNY5VaQG4m~c&V0r$w?clVz0bScJ*<YIxh0Nu(Z52-!DW}X
z3fgM#xtdSP$%KAq(3-3}9{yK9w^3Q88Afd!Ts4E&GL_I%ysUxcLYlC#f;T)f_pIyg
zwtByG>?B_=O?5{mseqaqN_P;o^=<hIL!^mvEpQps)LpIzyd61#pXQAu0?tLxFWVYF
ze&w_z?<~{rCoUZK9|GJlZtnY-ZXTK3{+6cMLd^8U9n&~<MeWT=;-iMCcQ?0RD7#&V
z{8^Fp6OvAA69PNdTCX1&h8-Ip$k$K6Of{&w_t9fP1^0NTZlQ6YivqnlzoF^toi=W3
zR<}h!Zb(PQpiAMb?W6`GPlD<x=5QmF+qYp=KF|oKUj5Dn6mZR>2;PT!f^=@SB|eIA
zg=cZ$?vmm$ePQ-RWEorSu=G-IS@@Vz%IdqO@Y1C;6W7J>kcLV1qvB&R$K_wQd?x<L
z+?_lJf`)D-WU4E6u=Ww2bL#Cvm~X)-kAqHrVe~z@)id)XjS{|yw)ld3Nns8q(q}RR
z6<KLDN|3&+ksWk<r}8M>2{iXw`y`<Khyu?H%95u#29X+nHs0-cp06?x@|Ebfhap&D
zO6LONo??$|?cV}U*O?8Of4?fNM?H~cpfY+;|MUO?r>hX8&3pdevF~?BQw!+<aM8fb
z_?euUoypd)lVheKIHXLy0k9;<!$MwSPlic^ft;w$psd?THH8aY@tp@uQw1)wh;k@C
zCxcd8k1k-*??xNMfxqo5${5R^cCM;6+bfChj<Mo3cR`N@jtq<mcpTWYU$YvWRUK4e
z@r;BpkQL0WtOTp64r;I@ih?@qVI+9Sx;F(wQI}kP#XchzlhrQrEfQK;uUX|to@LBm
zseL2Bo?uo4)E#{BV|)-_?QoRK_*al{`ax!km;)|EZdgK^CJM5%GmNNyL*H&4607OE
z!5tA>d*0%t2EQWl+Y)cB^UGa&-$Q&yS;RZG9C%F;VC?C=oqBfLhzqNb&(gqYwVdNS
z!RTD7?JX;4MCpLZxs#xZ5^AAiG}8Tzj}bx-JR$k_!;tESwR`b&->r$BS*M;Idea-=
zn?ev0=Ltomp#WhFgFg})-f($gzEKi;<ttb|Q~iXhRem-t3{PddKG)<1pBXPU;xg-7
zDc*XjP>i%5lYqKTy@29}5*7Cdvn{7%P6vDb(nbe>_`+}`e8PJivvR1KLX~VgCF0$C
zxa@2_wh;J$Ae$fadbQ#?B*Qy~WmhCucjDG8MQ5>@OJPDQNy1SEVHgx@DFxG%F~>^k
z0vf82TCZcK#nAGTcL9zhuOTg5=#hU@A~M*5LROmKBmRmnjNKZT_hh9)U%D|f3vVAP
z6cKQpCXxRI#Po4m3B!EDh_3-KOTmF1MV9eg6?P&IR+7kd-~{>m<D6yNKL{Q4A!*=V
zV(gDQol5^6Abiv^ju|!gkebQQ(%?@U5Z+<eN{;v*3H)=Pbt~Cfn~x4zClb8Ug^OLt
zgH-WIEoik<ltdbs6<KGY2-1j6xz-3Oj%=N!wwcX1>$*=elPAn=s4dqInu$G7TTu~s
zMEp5y_EZ~PF~9YWT4K;sp?K!b*lZ{8QC#$pS^><I{^m87Rv1XDk;rr4mzf9=qMng)
zp4QZAaVzr8wW_i=uN;iX*)(EQBkKk@fOMiWE|1F)oX@NsAZHXDIXjs!#>QHj0=cEx
zUEd&CYAnqQ+5@S}t<Ysan`_X<LLe`6W*(ZKM|&K$MfJ3${wl;)MQ5Na*?fvAzx!Cm
z$kL_Dnz53Sv|G5Jh~XF+iHa=7J{i2g<8bI+LY<voMBs@I*+Ph#)Yclb=cAMScl+sE
zV#n)cqHEu&WDja}Y7;lZC@}V$l(5SWmnNrZ@%ga};=&oDDOCvtqc;GI?JY4@e!_T+
zP(}9EhvZ`Ui1ckk6Myau)!!)Vhjw?;-*q_j7%|E|@epDR5VWWMW)!I5yqKw46FJbf
z8l!l>Cc`IOpFuC&2Yb`WE8KECr0QD}Gb-*k(~`5>w^Xb1beID%l9Eyr>xt)NmHT<m
z$XJSG7hd$IfRb38EqUa7778c_Q1T#lTYf*^OUk@rM3^?PjcOwMq46N!a$RU%^zCl6
zE@<lmbH+J8ep>D6RBEK#u1#l^*3DS`UO|Hyi;!_&THqj62A&F9Zd>PeP*MB9SL-$n
z&HkWneo4lOc7EF(iT0dF8$2C`B13SL#8AhPfvxeh$$dLZR-)JJz6f5;|B3_npYZok
z-)Aan3~GbEv+0`$1aJ$63lnwY$f+C17>jX0JQz+MvY$KX$Z;Wmq=Tc{1m_|pDO?<d
zllsvt@*=~P42*+${%0KTwi^81LZ4et63<&|DTuHTcgii;xz=Ls2(?^Nf!gDSb2&C7
z;M6&J>h!N-V-_W5$g-X3?ALxKfBge1YWESe`<3(k+~W_gzdXl}L#4nv+Up&$<L6KL
zzngT460tHC+Y_1)BC@oHE-wr@*!UQKa$mO}*PDB=-g4fs!Fb7P6+cu+0~tdgniF%E
zFw$g&rO?gV+R^7P&pyd%2}-rLG|&#)^0Kl>B%Cv$%cxnCCil<opz&xD1P&$78->IZ
zyMQcb;Yk1`qkueqQ{>OdEecE%aF&5A;oPsR+oM~lW%e`XKe}-?1g3#JX=e2=ZvK%Z
zI>3|YTA?pgI<{G7+1u%l@ZglVNkP6ux8)mEvHk(as=UnaR)adS*v+YD%%2azY$=Ow
zQpQ-672vo4uXM?0jiU#h;v4#VekLCAzkCRtilggd)09@)h=sF=fySfK`TbT2<^$`0
z=t3kvfoTsb2NkhWt18>Wg8nI=>CC#e+Ht7hIP1nM4J{M2fQE#d3ZHY*u7<D3tIbFH
z!jd$<5I6SC(;X|Qk?&luXBs>O9p`-uRf5Dn#5~av*PPe>E+P(5?6sqa@T2$HWzQPF
zQgTLsr+`dB>bEmgA232ZMg#8{Xu(Be$7Pd#hna~SFAZ3QF27u3+vXa90@mO-5}^a(
z$#;?jWs|=^r|;g*A6rlLJYTsKNm?|<D;2h#u>+u@inB_(uB`@unG<#|2Qf3UF@oCW
z(SHTRs<dG*@IlFNHVzAeKhqZfsUQ%Ik7P}r(Z1G!cK2&xNtoYv>IDpGO*}TDJ*RX|
zGFjzpNcOjCGk(%F9n;iD9<3sxAhBKE>~1zGS!{`r5^QVn&;s?NG-yTYa8X_wQ#h<&
zTgI#c8NQp&`$rtrG#rSeDnq!gGVoO`pjK4D(2#<?Jkzd^RJ02-R0LB-M5JI5$3||q
zuQp;vs;atbnv*k$|IeDKnW_;{M7B*3l%C0gvSDDMcWnbnEiP=fDJQxUrPATzV~^tx
z(8`tT2Sqix)PqUW-xfTEgCA3Jm$T)6cGFO8y#bOa;RcQ#3y@c^!C1IwpE#rN^FM@P
zmXnZ9bycK!i%Y3ip4rzX()Q*gYS*`A5(EmIP;eiwa!H9Vt_a4=8G2UO25OKP4A`SN
zqW(@k$fEigcY#n5zrq!np@xuO(1ZQE(3%d}CqX5qxj#noK~<j1I@Xta#d~lU#l%|f
zt9vDyVA7DUfh-Z|5D1OLB52a4|8s6r$QfTJFA63H<w|tN7DrN)mi1Nrdo(YY%|voq
z{LI83{WRJL<<#hBw!w^)tJc}yv3RV466I1Q7E3hNt`-dcwv<Xo`-{%E?t8`I%v2Cv
z%idxji4m&Jk`L_qLA-4|_&alGtBW_=U+P>o_23i1>_5AMic!zid;h{!47*v$>V@gb
z)74Hj<x8m4>E@{`VzaR4-zo*~Bn_zGr9Y((#ece||M_+fM%=o>*Eh%f<$ep428CgO
z&dv(Xs;%!ZdAz*XqCnfCg5Lno<rQy$>h~NW-}5BCb^pSAHY(|s*ONTqu#$VDAm^96
zU!FaLA4xc|hj{%81r2$?`a7AlC6Qxulf%Rbw3Zw@rhdC4AAxpC^SiA-6Jffg5f4)6
zoWO@z70!%?%wM(VR?ajs#OvLRAsNed9fzJn%j<-XHs<2Es%014zxWb_uHXnM!y8{s
zGs%F?yf=EE#q#+ugs_WT#xO2Xq)TX>`+sjA<>X%)NSutSC*;D+tcS*XUv9yrPP<|Q
z)^-Uw>}AJQ7cyen=&-tnM;VlYc}`Cc&dO8TO_8^7*yBnfcj+AlLz1L1jpA=zQ_=|M
zStbgz17$+Q9BLuGcB1l#q&PPIagA;vBtBvZsFNJgDls1H7LK_b7E3I)`C2rYTe3P8
z6eTQ@4<ci8)gP%FW2HZ*s86dBl8*-2mwxLXKFs-PS}qMYN+VHfi#4Qei`gItTWMH<
zTh8?JtC>netT&?sT`eXCe?|^_sX3KcgWIY3*!BhPb>(Oh3I+iUvtIt78qY&Z9Hac{
zSLb7!PJ09Jww}#QmjgSjI~|65Il`=T-d<>V(QYIPym4~f43Xa)pWD(p7yLaniJz&l
zSwb`a<006Hj{BT9ZFNclDMcs;l93gjHu~ev$sF!ZF7$wqd21PCa8ikxw{L%-CewA&
zpvNM)@;71oBqslwwA}lR(^SI?cMt_Y)6wWkw$ObwQXc;?fA}gE^o##A%J0Z17eB&}
z5o64UWr8uKFxK@~%x-@L0&LU3I^}t70w-7u6{c#EbBLLhZ-SNx*WsxQaJ7{)7t31c
z#8hKu6GA{hocGI=?eFQ@=7j$%=O|@dvBm4F6*Zpjbtc4oQWW?jJdc1+120>`aYp9~
zjWN`9U#G|NWAqqQX3Dur=V}^_BvG&0&n)~|{Yo8nx(aE~pxQpeL@RxsWZC9chENgi
zN;|HGpW1=gKaI*Wa;Ps>-AnBX1yXLi$$YiNFd->2hdxcR{AZDghMhH5?x(wXW!a9Q
zbZ*5c_1-Uc25-+VQd6H2`{R7|YNscTF!(@NH#Qk->1|T+XY|G2v{RO7lIv5+$C<Mz
zYB%GMyEy{Ni;_J}^!twm@WrZ!8P3?&_Iy|%N@~2~yJdm`YP2zkJ-ldH;0|zEDchjs
z;F5HEtHUKPZKAWrdo+KhSY51S=w5}co&m|Aq7J)4UbfRg3s8J0O`t|O1}uM>WFG`}
zyQGmfh3yxEBNi>)+pqa<CBj8E!u;$T;~f$sL1?|{To&6iw8jb57?>^bYP}mPdV0Wy
z^JZwG;oK0%hhVy$_~%crU=4ItKQ@o*J;X?HvteP~spYy8eqdF0553`?sRJ;hNE>@Q
zVnPwGJteCe%Q;I&_)$aGa`drb{7&;azpQT!C_XT~ga2GZwCmJxSAVIg8SpK#t_}yi
zpqu-}dtF?KRC2kQChVOZ^)vj8^mnijs?MoR)eX5$+3v+_k8xY~60w_}{m`(;Mc3Y{
zkPyV+ry9|OKPBsbA7W|z=%!(>YH<Db_mCiv3AO{_Od6oOPY?i4xOB=qKWVnIOniST
z6WGhYqCzd&1Q@RJ-f+jXuykua43r!>+9`}MbR<A+qS&PUdu&H0j&FG7)SS832pOZ!
zq|t*beFCXXDXFz+=TZS(+K)P=FNWnQtize?=k@713V;ZPYR0Au!~4bSF2ch@k^~>v
zugSebO3gkvBVcS8#)6Gwk(Zctx2FpZfaF!PwN8$+v$Cnx1|PE#Z%Gc_GSnozB>YwG
z${O7dzgEX(*{t43Rk|uR;!}B)A@?ZPd^10+i%F;xE!e$L<A-c5#kzeSrh?s#APZ#-
z)K1bS41o*Af6V(-M2S<sx5iiSsnARIlC=Xvcl)0?R3&E9I*^S?cTsb-gHGB?AbX3D
zXjO%M{VM^Psl2YG$m4I#X0QhA_L;Po%wGmx^Rq3I3)v78yQVv=PdT*_j{jsvZy{+H
z1|zgvY_fQ(zdlyMm}&Rqr^H~$k5h-&2&xoU?%-AACf;FMB{2K`I_*9H%Y1hhTOq*~
zNq3N@JFkry_eHT*Q|>-(SCITsOIOmooiG{g9ua$?#L+YWBGdh7V+cTOP!Ogt3}O{6
zSFy#P73r}>zEW2ixW5MJ#SNQG(^JGr43k7rY=CKFl@SN8NEA*iu9es?vI5s+s)$ud
z$}{4~2F5V$e|YizsnP#B5}?E(ZEt0}1%N8Y8DZG;h_XOk<eD+8122c}vZB>FeGzR)
zyu@D*3JIeUwN|%i`lFR?m_%<w)|!|$kzu<!oKW@VRbRu6xiFHS#;m--P{Rna>vBPn
z!G{bW#wcT%`C*MoZ%T6Tf-X-6HU?)Ztu@LUz@e#u1-8?q`9s38sa;O-ta7`%-a(G)
zw&@gNgcO-&l6u$bj$J_sFfA?4`D5LTS~p?76RYwLOz%9rd3EZBc;}>u*<Gx`pG9Sm
z#PKLE?sxCZhzBy%i6|`+D83j7Y2S%IF@vNA;up+dYekl;N<#Mz{A3p5*PS)O^m34j
z=Ggw|OT3<BAZ)G})J`b;w0LBED&HN%9#a|?*CsPx$&&}tQfU<4BD0p96)&UQ)*(lP
zs4z1DwN04$%d1VnpldsSFEvzW8%blQSPKre@qhFUs)mkF6^T@{4QRCAx31Jkaq^Az
zR{Jhy`Yz^9gw(Qr^h@&$u%TgmSA{LWsHe}D4?(rSyd?v7N<U;>qD5qEM?B9)WE6U#
z{?;7tCBnfGrKHwed`f%+D1;G<3IMY!cmhxCw|IPOFEoPG{$T$7%Q(*}^^_85K0aEQ
zESFK(L->T0UJg}tNI6ji3O_;j253zG#S-ZCU1T|Lo6-LY$B%gaw0y3jhElF4Kf;gq
zYvV9q$%en42k6B2Ws3zev!#xfJUSjT0ZyIgvrBcPPhL(X3h2aVhNkC?heL<sAjN+c
zC%JiAI>~3f))9Mid(BfQD5SK3!dqB4lb&dl1*M(@Ew&3+K-9a8q#l|eEMKWr3rd=x
z>7b#ZlRjm;{+Wq{f8}A=1t0pe7f0L5=<=ohd-p^cp~e}9T$Hekzq7V>n+3j5s0i`v
zcNl>2!oRc8zX%lRSnqa90yX{p_w<|;Vs+KK+U!uGxSzBB#18eDODpI}XE}5~Gf#c4
ze^tq5SW%TCUX^)ByZ*f_00vcu6o*j2*uOk34L*Dx_3QohVkdP))#RuquR1_ANL2%O
zZubTVh+UibuJnszZEU-F2R<tQbuhVd@UY(<enJ6rH`eb;b4+J#PDx#qR4IL$V=8dh
zDy+`R9ieo@i0Vx2V%MlL|6g%FS3+sz%8uP>S#E4*-ootkH}=Jzp=sk`=R%ewJz%+S
zX6wr?P0yZ->0Q&cnu;M_xV^(bXAgnFaoxerKVJq>B^03E8m!Fr1**iE5_xv}qRr<%
zd<Z@fa!nqs=)k_9%)=pNt{>a+Tm<n1*Zv1qW2dUhJ6l%1KUFZsib^zc1=4zs-lBu_
z4yL9~b=7*%5wau1PL~XbsNx6PL}O43{E@(U&0!ssSyrA*CE40Lq=03LkAYZv=VSOk
zjPNF7FM)~bxoS2G3y<-hXg9>}RHsALHDQ=sVO-p~*q_4iX)w;5VtVDB`g4d8urjJk
z_LAXnlUyW3(OPBrJ9sWC;ft%NsAVut(G&l{c4CO~FgElUz#vJ8(9%BiOK6h7^vg;$
zpE<G`nUDM==BWtPIt}NyYUkjX8EABxAV*tUE2Cye2~qDqo#B52G_IfK34iJ_FY=_e
zT$Q9A%KXKnxjOQGQXn5w$|X7waOPN0fzlMLCe{kaCraL{u(@+oq7$Xe=OVNI{i)Pa
zm$Lxe8$Q&1(fs{Iy@gwii3&7)KfXcQFet#tJtC7SHN2Q!>q9wfre<`NR{v$h=6Q^O
zE~&AF^iSP887JhxnB&YdlG!6H-IaP3r1oz=*X0-$F{1nqgau}={Kti?AsF8!n&)PP
zveuIotuV!hX%l7^F%G>lzN7;NP-Lfi*(9{AWD$C@bX-`UGJQH#@I`K<hzyo?*v-pB
z(!AbR9uE(z>l)TN8Kg=Zi2euV*ct=)@5q;mu%<Bq>86My#1|%ul~Vm1BaeNh>q4h}
z5vO~o>@dbz!D1GrFF5H%7)d|SRa(*-A~$uVr8yRLf!tI$qtx=oG){&aE47vhtoMQ6
zhCKRFu#!SHX7|>W*kg&vsnWM0H2n6`S<l1+($5v)es?mmzS}HOXmojR0OP15lPU$y
zyeKz=LG8ulm&lgTvBV^zu(f{<??TzOUK%Df6UmEDjPGZFEQ_Txh1M{rT<J4LPn0XG
zC~IEq<t6sWtIW$KocPW*+zqKlG_!RjL0nh+Rkng%b?(MDR71JM;-m7Cun$x3uj}|l
zXckbcr?(<;;j;g4pW1dQGUU*X225c+(%!?#z%uG&TctxnLi*vVhqPM+th%6|S_nCB
z%|35lGgMdI{62YiZPpSVwzKu2JiPK6T9I4o#c(|vv}S2aSpBW42TvCARXn0PGl#Q{
z0zOZ-ZG|^rmtIE=rsf(5L=2D*jqld8L6xY_uM}9(bwO>Ard&OJD1GR&NVfwkleXiF
zGh}`97#%%rB_q)i;Ew&W!-RREiOJ_ZJlvm~*jS8v5$ad3=WWn5^|BlPFnuVrITJe*
zuI$=6Zmd6`EiHHs-?V<m;gN75bUt5e*L6{0T;$Ha;MXBEOegs9sOoyBZ6Ql2V18c&
zJ5}U=&Mg0<VAjZ`s;ar>iXg0!CqDzD|G@dG*|H77s5FkYmGJkX<(=Fj@{orf=||>8
zBZi*NDN2adh@@j6&T0A3I2doqTiolvh18yKtx})NF4W3Mfe}PHKbaki&e2)cofER2
z@&{HjqfQQ8KQxz})pueuKIo}1xvBXf;p3h0PPN4Tsu_KOgEbbD1L6wmt!9*I!7pPu
z=s3=7&aHD>uRFg;thU6!U@l0$-oAQ>!&GHbu)2WPjZlv|a1_P^962z%F;jZlzC{Up
z215LI(fIm;+sxz#6ii#%#Rtc`*$M@&krii0Zq0yr>3)4kOw&3czL{3bGt)##Hfs;q
z(?_sF7YS{713YGula5`A=eGNRC;Vy_NUcEAkR1n%I3*}%wm?9_ZhAhEyS<gRu0jV|
z!jaFQJy>+hIFIV*U2Oik_($YW&hG@Y0Op*VPY+vjG&BgJsrp7ByN7Ezak;(`zCmX0
z9SwQ)gGlvztvj^{*x~ZJc79`Z&VCX=H~@>8zA0%j5gHfjD(2o0tee;tEA5yX$i<vU
zJH%1IORQ^+FgxOpp^%Rr%Z1eqlG?Y;cZ@ldjdV_xBH&NLR$=-zv;8Y!E;jVn4YlS2
zZuSXJLtr%Aoa}3u&8XFqHZ+L+6uFUsxe&G>^)&Rnxgd8Z#Y>r`@kk1f@`Bx(Xp79$
zTxDuXHL9}&i~rC3ZqwDYp|evYb$>=yN@`KRyz&;h{g5Io@ef5+`<N~x{^b{?SCu!w
z{2O5MMcovbJfn_3GNv5;zH5Xt4$aiZFx%cIi+`SIS%fYl-^U%i7QF%JT%R}J0G4Si
zn&hXjXKHLAm^kFAocQ?O@CL6n+U~m=(}wIb1-q@=5AD}z?NGB<jn{kvBWC+o!iQYh
znU&b!<@rA{1iX^EhpHrOWJhgxhZPp^y4tHag+`ya941wbet|qrQ)Jh6l^LB_a(@NT
z0IVU5qmiHaGXjIr9~VJm+MKo_D8-A+&3wt~NxCZ;GP_-fYy+t&^H%9=;srzZ7nb|=
zMGoX6Fi!=T%E+HKzrN}pWO{^I6vO9AFh^mtNy*JwrMr^Q+E(x8XOeG;ZSX8@Lkkg9
za%=QTyt7s1E!Y=3E)^MXx%rXUSMV5BK1QK-(UisZQ}HtieQd-^t#_Jb5~ZiNH2&HA
z)807Zl|eU3Sm#OsIoGAfZ_wDq2!*nPE{liu_a95@&yIWP>qhuh&e0rf3W$(0Xi_v%
zVlBU$TLKT-+VIMPy(%6jy=rT!Xo+Lir-Eq}vVi>Vm|5`(evHt%nnqjZ>^%86B#%)L
z){nG5(|vq{yAchG<@Pcm#HXABYAO=*d_5C(BUJLHI(&TZ3bic^Mk|l5syj=%_yp)^
ziRrdKhnY029m!3Jo&2?nksXEq@idE5^Rff~TKFx1nLKE!YBW?PFo|SMqHf)aL7oi@
zqD0a};&)q}qdmkaMRM|^F>B~tq^jI1VCg%sQv!pur;N)S=_QZvxM1GO40hg;o>OaK
zjOtZSSXS@8;=GUd>iQ+NdoFEhir=L{wY1E)2Sos}WL(+Eu?e47#01__de*#G3E16r
z;!Zlj^?hiMCs&yZCDo-j-qiRzNqmGckad)(X1Oruy(Gbe_uk-wD=W5G#jt6hd0;qj
zL-T=A2MLa(gDOV<4=ImtrJ0jNfqE~MLCn%FS2d+Kn`LFC?LNCu^lJ#c9I;Hw%ERfv
z-@3+xePR%12}ye_ZwNU_aC0c5dQVljAg78XBTHcLGc`>2(^CZ>e|2LpC_Pp4tLD-^
z_>&U{9J8U3#PEo$)I$~F0ilFziv;qabru)&Gvrodvc2nc)I;pF-%{(I<-^bqiAa~;
z*EGzAowmxNoLoPwoWRIL79e&dO9T+00gfYDey;*I`Cr%m!u8(P;P&zfg^6lN^Efk!
zTJM`)u(7!|;5gVcu9}5{8Ex|yGQ=_D1&lQTGk1#im5uxujb8JW#YI?sp9=7KsA%W!
zBi>0*Y8gxT0}I6~+rK`12S#DdO054%5pY_i(P1z?Ed;dK3lXTEJ$MnCf6C;uKd)f!
zPuvB`r*pu6l?<G(2Y>3<lv?c<%r>Ym0EIO-8XDFR_C+|E!<ZPUIoX<jsK@TGMgOD!
zf?JhLzY~u*)AU8LiEw>BwaXipOg2JgIO@alD;PKa{+e+Ld6g3CgknxF?kr(h&|rWj
zYrFhA;63ib`X7wFWm}w4x20P^2=4AASa2)c-62Tf?(Xg(XmEG;!W{~S!rdK$yAw3h
z?CuYJo$h}3b$&p7dupw@<{0B1L4V#)nESsKff!6^6Qr>L-N-f40YGc|$S0%!NfxN!
z2+5<17`8GCA8Nsd6$Y=Hajqpv^U7|aJ^xZ_C53dVHJ+FKzA2*>N*6i^C6n`;h+j;R
z*FPso5+1*Utxn*g?PIEOcN;G&od5W82a;oRtL`_M$%;f0`wFgPip--E#pfLQwLiqE
z&Kf{ZwM7j7)!_m5NsEdFoapR`m$xOv+g_2_73}iHI83B}6teEsQoipei_)-*g<zRG
zo%mb2Uz1Kg#tql+ZiqAfQv&aw<oYGEB-_`rVgBLyKuskXTo)cDdpj9Q+>7rz@CF(|
z(42{*;rM#x*6w{zws@Ls3v<V3m7*LzT?tGITyr111ueLiTi`Dw6b5sT2NIee3wUZv
z8a&K`RuB<P=Z-&VE=83H&#W)BpHpuj7s6)WbiaZ)9E4WxzMyid@GcHg{sWX$w(4dy
z-@fp&iiQre>lh74`-ToOd``BCzT;<R8xaxRsFK3LxFuegANy#%W<;va`%HK(l$PQ=
zM9@K^cYwtuVT!*sVw`1TI`-LWFKzRJw{$x21I>AZye*q~RfQeWPY=3LG_8!f%j7N3
zuY)N;lga8QI1ImVMk!;)fRnM`U5~Yy#($(Oe#{tSze20=IA(jcW!H_jt4+LXC?Cw(
z#F=%~JN}yanOr=>nW1HZ+D<bT*T-~fXyl|(@mtUBi(_3Nhc?HEN&!Cn(8qP;OzX<B
zr#*+4Smc2~X3al&%Rw!@5QF<E)>|6Ct}PFj+!`DD%F`T0P^=TT;Lb(YjLqpeJ2;D&
zw|bqnorof9g?crcT;fXo!qMwv=wc$mNQxu37ST!pzMX_F(<~D#_NxEiIobK^fF1&$
z(D9O?nAI@Jm~mgm;yuVw1PUIWbJ_5j@#dFy{A@gu)ry+W6V+M2#jae!-#sg_n+ugf
zc<o_Up4(@f`_7ATFy;pGKNkBzlq`?y5p8i+$xc!kXGAicR=zc}dkdb~cvPq$5?wyw
zI1qyqEB8rB{I*#{Q6s&%NtcS7eh_`*auWR~Pp#(oB~1KA6?a(o?o?a$b=?>R#TSL3
z*Y8F}3Rr_+cH3fV53D2W@y{MZ5fU}aO|e;WKk?lRbuU(yh`r^rQR=?c#_4)lJ0dnv
zNcIg@u^@&GF2Xk{>7!+`6a2giv{~U%h)tA?k*z#;JxJs3C|A;F!8f0ppvoDnBGo;2
zrmR!biicWw&~kqLSnc+W`Pdobtc)c_fuPC)$24wg%K7x;<Kdi7JNTfu>e@`$;pgs{
z)8g=0!KboI=XS;^<@vRoh4$I1m{(tf{l!E{^7&(-!A&^TqsB}<>IR`(=to1#bH2TE
z>8S88BrcUpz*9ckvZR+hhf(Wp9%JVxEzcj};@Y2ocy>b}%glTc)60gwkZg#TcmK2F
zD_-Rqe=)qoMn=qf2nJT$SqlFj?6Bmu-`b|_&TjGhLqAj81TpHi&vo?J{-ex-kXlx0
z-rjju$}%oTRnGXz%w)^G^m9Hf;UYhBp5N&Ka$lWH?MUScK>9(vrcFV_V^L$)0B^=W
ze$sVeE@AlM*yq{-ae%b)XBMS4a>#I9@_fL{)RN&sg>I&8@9r9X*t0w@9^O?WACAZW
z(F2F}6)kY6&)yqPZ{OV&p9H5bHXd}W{WPq{<lE61Kgq|;y+mZQ#-v8tYc9`Z9ZYhR
zp7`h@$6sr5o1au9-?49#0JSuJ`Yv?4yeX~;mcwW`kaHW6a&bZ7PlIGNw1sH4-#S8l
z>6+rM*}3tTtaR^Unz*?ML`3o3&UM(I`kVlrg5g#>yCfe%=gd7#8dPJMp931DJ^cdh
z8lx=ZJHM3<Z6wx{+W~3m!A457miAsYt5u1)<&^!cobPN8g&>a_ISEv5rWh2LJx%xL
zzeF;aNo57VL>EE=pNBu5hGw{zTLz-+Chvj8$7z2RstaN8ft7FK1JbRpAbr8I1_yVi
zW%8b|gln2mZC?q#hnTPn#hO1PF0B(gb4l602|FnA-Y=h{rMR!$>z3LKK}o*L%5I~R
z;^H7XE&q$kMM@y&+OgqeZny5jTQy=mzo+e!(D8IX_qe=wFltosj9Se1^?cqq<bQzO
zp8pcX>NP0T<pJ!F!Yx#>)|U?E1ZP!d278UOTn9<lXsfZmyKe^i<Lay(Ov-nz<7)~P
z>ZXUbZy(-Q>Kq*x*s&6s_w@Lh8ZuYo=dS!^W<w<u(Ae5LZuRKYVnAjOk^a00+ZOjA
z;3<l(LMH}#x+$oWc_d<9swqTDfLfk9k{$jv@wcy-pdJFuN#~A?lfQ53uGJ-)eLB{`
zdzic9wfY4NW)O+x+?nlEN%B$HUpLJy8@w4#%M5MYke1mK?t;D5j<B<{jm}oFCiITg
z5AgP-w#_Uy6#Sv}MIbmQ3~WSo;Nu_Xw&~>-JEml^$WmK@wkW-2cqQ?qyxR^hO)as$
zeT8yP)hjmS`)ZGz_ajFNhIT#aa_m8>osM6coBPZ9Fp#STA3$Gjph)#p{A&vUv<Ez>
zg9p$_9g3=-;^wNUDpABnxO4E#wby`2xbGyE$;uyEF3yU4Q^p+(5!1)kTL?=WTGUw5
z^M-#qJ|vT`v8HIl4Y}6Z<z1Hl8ON>mJ4CalCPQwI%fh{=XBG6+s(Aa(9NEap7;~CM
z@B}iNppBUMrh7iKd9NvB!07HX&7TXh)vKPZOpT)rDGiHj=p8r+1L58zQ)3HFZLh@+
zWK}$HG_kdBGOdpnDo<eSkwvgnA%Yg0PgTF%`GB%A;U-F40-jiS7zK#O&D+zl_gy_`
zkXuLB;MW6izp0f}6EI<U5Ogy77A&_`mfcQn-rn!wniot?KW1+2^TvH*sE(6?UQD{!
z9O0x?CCLWluFMUJV=I{4i|G+rNJzRmrxsr|S(N!JGta)bDDi$L3&3e!I?B;i$QYSq
z`XhFr#b98ogK?Mg@wa-v#`Im5W|s?`%Sl(c4b?;xg5GuvMI{oi0V6ef*tFg7P#Khd
z&jUx%_%R})2Wr{UL6@%(h!<{#MY&mjg`JT~|5re|Q!ucyg6i7J%-hI_rdS=5imMi}
zDa7rediAdP=4lDdYOv!@kCyF7+gf@w{CoSPjwz{oFU**$kDeU4k2`{xBcq~uQGsFV
zh36YnM(ymQ+sZ*kHkNxM_a$1~n+u4q!@T|dllKd{S-=B-Z&obF7M4A};R}PFnmV02
zLEdzqWu9#>x*<hQNA~$|q&-(TGGhOENIh7>o9D!QkAHI}G_3n<GDG;XfuE(xkQ5)E
z5Y6YrA{#mk7q&(pug$KK58QvDOz`0S127Eez!_3kc{;s%%;rl)s56$wwc5G%;uHl(
z(j_3NpcoE<i>f~6adX#Zw#5!|>hIvlo_PD<?d4J(Ce9=d&A4>X{dgeDx&%JsiN+qz
z&vyN#)_Mxc?26wx150}7x-WQrn{rby-0>+7$w-+SH?kX~jVF!gI<u{><{>L`0Fi{c
z3bn-*;W%Y%Oz-*-6+mt7hmS_o<~%#fZ+6}Sk_R4n*NRiN>TK>9mU$cc2c5e*kFKbh
zQ<Egz%Dp$>&Kn(x%eC=kMNiz7UA4;6s6sfJ{Xke(w$deV#`~}2Rb=f)pQM$9^c269
zf4w9X@~)A$m$x=2igZ)n8ykP+*VlyE=3z>^k>47*!tx<~l+Gq72G?VIIf<Y=yk6wG
z!DWf9)_u|oTT<=rzva6?kg3PUxBy4sR}5|vujS0WkfZfTN$pnO2}xvV@6D$`8TSWI
zW9pVhq<QXfll?#n)K<N*Q{KdcL;Zi!m@xMYDxvx(RAV?wG4W4kq>vQ1F^|Q+cpNH5
zn)+^Xzz9+JKd=w&MwYspO<HTyo090?CvWvKJdxx=CAOd_hg2hsZC)4rw0BjDR3y5?
z;SGf~uzfJbxEDqCbCqyY+N<Wd#njcY<@?Um@swa`&-98cV$ZE(Lx7{EQyWNurXZ|V
zkjPYJ;Zg6#c-74y&&TNNeMdl_%9|#cXy4{d-$Fg?iVD)ve%XjQ0il^nPL0!S$^_e{
z%_RJ)zk^_`gyt#KX0#K@`=?%G&1$Ao`-BILlD=gO3AQu*tT=1?wdX5CSwULH+MT!x
zegib|K}jV>Lt*#B#~_x_()Gt))25nFrW=kO#(3A(Aih?$_V@kTyV(<^n}Dn_M7rUj
zUhZ0Q<DQsiCk%S+a^<wdMRL6>aHH5rdrdVc^VvhJzI1@j4~1&{PCD3HGY)SpvS@<K
z2D>-#!moHHYaV9-%CvBYlDED5R^zqC@jP!QS`XXjj8gllAW0N1O8eflsaco1rER}M
z=WdGWsw>`YMlFrJ^>~QBs2%+pgVydBs2NgV<u6X@2^R#CB17=9u^?wbJIHI)_N`WL
z%9Pcb9wn!WISLw@<1)~uHyhuwaGrHNt6v|Z^{Ho}J_E@{YkCzP9h@&oTcvSN68Nmr
znij(8ke%Q%5HHK61_NNt<@uG|<Q;uJ{9zPLd1w7Guw<4z<@o9dDU&eUg%_QrtKXVD
zFr3$JX;ju{!oM4CDg|oj05XyK)aLPOdJUk;A^DTD(rD51I4L!Eefb<c!LK0ih+TP~
zi^EJo)~KN*?jalVDYW(*4Fc@RIHI)|6$}=6+kH0dg~A3cj<R);BV1cTLO1Ti9^KI7
zvkbKGKT0WJ%}#w%7PNuNtI4Zq*7Y)*8&a@RmDljb3r$2rVFvn_YXm^5g{0$i&2dq?
zeTD)bz0aAE3X>y`8!6%^ee9*nE||@n93}n*(%XpEX&ZS>_97fY7x+zVjV3wNbjwY#
z)hfedp`mFW8bM~M#FmgLBvOq)Tt`yUe0ch()`#?ipQ`W@sN)y&*f39`y)zHG=mhw3
z^K&EI#KW>XzE=p5kcmA0EF@R2c<W~cIY6lK^0a1n8Uet`1$@6c8MfpQv&j|vl9Zk~
zlRE9UsegVYA5$*GNH!GO{6Z#k)^ZpxMJ+(NC{)uLk-Dhw==eU;3UE))KV~Ls)I;KO
zyC3%L`|NkrofL{9AB}dk%xPk$E@_<I<UXiLE7c-4_}qW^cILxc#llr%CZP+b3m^Qh
zsxRXGXN`+KYGDu*t|6uxczW4D<?M~M{Ak1rJ=u^@B~|ROi6I?{TCMY1XSJ~;yTtt|
z(7~5C!0LG`oDaFt&ZD`E3+AUBY2z-q0_r@j46BKvnqxVGG};yHz-uTJTM-mEHO_O>
z<124bzd!8}IbQz)BBax>dz`b8qGiBQGgZCcbp{vQsJ(2w6rfGp)JCqB`m=@N%Lj&M
zu-hyz?{jclkuLxC<uJ$QO_$E4p!jkiM{l+3tW@L&SB40a2NfO<PU8KcJnTTZ@yHF-
zT02A1sr4%pD&_ztttkP)Z@p_;?D*fphB7|N-i{yb;?4^r#R3PQWZ2~tA#@?bvNsq>
z3*9X2@)Wpvv=_VAY<HjD(?!HBMx=c)NdU1uO*e)ZHDuqyB$tL~L%#2?jQ6SO;6L$x
z@Jz=eN+=I4n|<yE9zdWyY6z_qCIPCMDBLWyP?05y3}g18(~{UPkGLjt?=)d<Yjl~)
zH<l#n=A`|~pJ_>2B3pc*^0g<H?$=Z)DGO#M$An>75=-u0g&+-OsZ+#t^JGJk^8L(2
z>3ym}U9Jvpl(9uKP-D868uv%CtYMURJ)^TEV0*0Jx2~kklNSn;dzZ#)g?TN{P?W})
z_sHL*^BcyN@fa{^)I9OZFYX|_hCz79RJ~c~m$UTXP#vp?l5mx6b_1r2nW~XsiBn=>
z@wvOP&$^h}%XfOWr-<(uTfT&utX^A-iqt{ab0&vN94D3a&r?Dq96Q^d2d|}dRt8oJ
z$_8va_ju%c8@#_$pCG$B%ZVQwM#Rs5HC{XWgmIsOTjY1?={HGS%;xCm0(TxpNuPA<
z_}4VW(PH%XJX|zK_=tITDs@?6<DarHGC=%sbPk>`xMLqj(a%gr95mpm)~>pEUHR!-
zb2nuX2bNr$JEj2oxxu<X_s^Kr32<~UFCgb{DEE4t9eGHFY(Y>N@!<AT2-qeY2MM3$
zC(HMO4p{{{@3$Kgnh5Zp9Jx<vR#rZXcUr;3OaQn94FvoPjnJ+KvC-CZ;gW4Hx>^jp
zT=uS+dj%CNh-13!*pZrC1r1sZ_Xd?TDZD$Ly1C6>H9ViXSrY$L8<*yZUlVWYL{(~T
zBwyE(R8H~-eTLBnjdYzWc*&Zky1p_UQ>J2SpDgiIaaLnz%Ifi)hNSnL`g^1ld?`5J
z@->Rcl|?-DoI5KkPwnT4Hu_(z^oxvt0M_VTR*GNAPax?9)G5!))f!mQ%>ry7{<=(l
z`b9gv;f$x+j^tW`Gl43r%bj90(GE_v{+e)@t4$`Cz($1^3V4USq%BasdjWc4CZT5`
zG*B2n?wXt0&p`^ptL9J>DzGc<u?fLmYI@^hECpaA)(c)G=9ozkE~8}u5VH`^OxQ<R
zgp0wG<-_~lWEU3Y*&ZnJ#2HouKcqVg_<tue``C_~DQKSLh@J6<W+G50-cvYewsO_@
zjcyeLq?xyxVB1*u7nkB{2N=?5k#W%oCM(gk4|Bi6J(a7jDc*Pb=A{=sIIJyc#Ovt@
zvV@L=vp|REt3bP{M-gHRG)Zis>Z>E;*lDV-J3{X=R9R*aEM_R?e*|*E#n~CouK<n`
zO%dBa`R6w`vkbU+4#2qkc0^>WJUL1IN<9)V3Xxey6{b@8N~DfbM;ZgaLaJ9@KE}wU
zzgdU61C1?k;g;XyZL;YvFK;R#CUACo2XH>pH9N#k{_sZ8=Se)kI)qHuUa*LWBjJXW
ze)m%E<(XamgR89N>wAHM>Btzy^>iDLGV(c-G6K^JrO!AcOc^DLkOo^~d#%=N%@hO9
zlmMJojtx-2Dawsd-EC;B!l8$pX`fMbuC7=d;R|L+3H&l~!;o<Kr5WSvN!qy3y6@tO
zd*FZ9XBmfq03C)L_9`WZ>97oJZClviZe)L>Fb3WH%$Rx)S(2J3HtqQt1g7=$$cs1g
zSUda!sCg2do0UC|b7K#m(#qJ*uup&&vZC?d6tzReqY29c@Wg}(gi34ZGU&`6WT#&*
z@B@!Z%d}P6@1gD@MLmWKS}No+GRktq=^Rh5Yczjdbha|A%sCeFAM!Do$@NqJmb|eu
z=upk<aCHsFMk-AFn9q*44TTxxg^X2{6y#XO(JhF)kmcr6RlHQMm|U|m!^EATCDjX2
zybPf#@qr0N32x51E(3XO%V=U~ilsx`kr9wHE`+Pp(JwryEiE)|xOqwT$o2;n;?a<`
zeRHXDl}J$QhfkTk^zAisyi=TRdU#;n7c_Vf^L!($n9V+hhL8m@GW+Tx`-(l=clHXj
z&>Mx|g=CdrK5w2}H`VF}d6bPq+O>6GlWB%ptQVG~uE+Voa;mlmqS;BxXEbu-2p+jL
z)OtkiZ8Tfsm9<T&Q(IE{a*BRnl(w6Mqy+vH9S@|mBJsVfT_j@0sz}9LeF(1p&2sW6
zWnz{UOoD(iL&%ex>Qu(|3B;J7Gi%qcqiCE)zTlc1J&fs8&~a+Uy&uU&s)U|V{R3Ib
zs=eCYz6IM~YhrsAVex)r4+gXZ^X^B`X8UG2a;<$W$yv31jlfAd2}_tP5N%d!M5CVC
zUSoqX{I#6HUV9;RMYBD;x%~ouz7Zrk6DVDON8>4%Ny9e&^XDZC+QMf`HA8*x>`GWt
ztgSY%K#vq5u-sWmG(Pi{?x@J@msQw~Wb+c%yfB|R{O|#QKw3cFD^B%9#NA}POx6hN
zwrwRO#Oe25R9^&vUX|LN#w@QP-yOMB*^YU=4UhHyQTqurE0*F(V@eN>d^hj)206l1
zk^G$0|3TDK%nFx75ki&{P`<9T31{HYQA;a*kJ?79mj#8M?Sq-adAxNU4f;}s?DU^?
zCl71r7M9HANQzzTh9XsvXIJwE>#2&!jj*2d7bc_WhiHb?Aq$(79NCOz)T4XHWJol0
z+7~tUfu#cKobWoavDRpC>~K*EpaqDI858+qM3LKr$MZwGhrLpvnL@OJJ27j$ry8WF
z4L$}W26UB#lPHO47HXZ1j&(P}{#MLnPugeXa1ra&>gkw~>^10Z@P07uDA4^;xor>q
z1PuL;0AToI#%yj1!+n$qvt;PpU`6Z3pMeLv{>SW=#i=UXheSWUB2Tp=$dr?icmA4+
zQS|<=bL%sBMVNgV`}cVCV5A`l!X=0>vrPZSa;|@G|A?SG8_RC(9{}~SyZn!IcD$r(
z05g=jAW8VDF*Wtw$!ccgly%#JJt!9?l+ZF+lCsUVdqqw)e(tlvpDQncSzuvK({uiW
z0A5)!BO90rp^x?(T|Xy7BB5`nE>G`6oGK*HxmhM=?W^HK30TR^5nL*(jK6I@LWum@
z(vo41=jA8k!OGrnFFUIO`nG~ZKH_D5=uN`we%8DTHF0Pf%=`zKz7&>t(p)laNfz6J
z8b>-ixuXP#Df`p>`jb~Q^chb>*`7nt65aZybJE#RtqHZZI8cs~^2Xyg-DsKdB|hEv
ziLFI3ta6v`j17#}Ad8dAPB9rHgdc22WQh18Y@qS<C_?{f9{&O#+gb-Wgl?*>2g9;r
zw81mSGx_j=e}M5n@l)oDa~f(CLowg_2fqe@uyG^SJmLqgCxv#;avY8Vt#~^#X-|1G
z4DE$&=1)$EKZJ6;8M!Sn5X5rNxi7Xrc+clFb$~S=1v`|X0v;G<=`VqHEa~H$Yc1VZ
zVR|;@CbMnhXOGb9m~RJ7HRf7&C%6ivS@qWS$ZaTRW#BKPK2@15?G?A;AO+Y{RfMcl
zQDhcx>$CQ!4KYY1hf0^1q*r;uSAAKgYu0`@j*ukOFABfueCWZ)f00D#{OA$xRT(2u
zYQtoy$#4hzx2W91BnP1wk^_yp`t>c><exnc5}O9)R_P-<Qe7O<F)=A&3Ph2W*Q6f_
z==;?^z|^LJ_-pa)6=rBrY6+}_c;AnN(jA?z*FWbImtF(#Fyb+@cM^cEA9u`Olf_(Z
zEO}58M~0}JW(`D?B<anV(K~1l*2mI<XCZlM43x10c;i`7W+7Bm4{+(&nd}WZZj0e)
z8N%gnNbqYG9OF-&UL+Ozl>9|c7B+$!so2<0ht}OmT;@g|u!Dmd6E<T{u@Jh#a(mzc
z2>+A>$>BKxtC%SE1B~5ChS~iU69`j85Y>yV4t5j~)Ov$6y2Y~G2o^q5@%F3T%dGIz
zgS#hVYLYC#l)AzRlNXBnAwFV#lyVDZ?|VwyY$-YE&>&GK@Sn3Gx{fo;0=IN8!!eb>
z?Z~c@obJ(`>|}k3fw&&G%(!&s?8)h-Fkc_V!9F(3I9s!<8c^W~w6AYVfL4+=gvy{~
zv&5-eM_50I<v4`3``j8k#h~w)rl4KRPeKl~)Mx^0ifg($bOXoh({MH4wL&jutQb3O
zV&#BCw+rbA8jC=C=3>2|$oRDLtBgPjg|OKnDJc|_^7pXR@XenYjpM7-4z_X3u>Zy+
zX!=-3NJwYJ03K|d)Y}^T`(!Pwn=f@^*)Ld!5y9&t{Od9Z^w_g)ve(p9X5Z!k3{g>v
z-~JnY7;D!#9KN-}uVb;JqxanYm^D98zg*9r>L#ou;EMiz%wgdA?gfq>Ozm#<J-p@*
zqK-TJVoP6lnl-7c?ru#MdjKhK<#BJ-^~i0NN@Vvk&WOoN_8T+U=7bmq+u-*$Q&%zh
zN#3Un%>An*ppf9wjY8_yLR>zQfxkhV@R7bz%=`ce;~`p7Dm3plk8(!9R`AhK7nxo%
z&V%{um|t9Pp<#73&m1Ddhm`#<ET1MxoVweodPM5oR_<y`%km6p-I#=FcZ?*jJy(A-
zcSmr!JD?iFfJ~pPk!Y;IL#~oz+S>29kSjzT9OL_iiJjd#XXp1L_a9(q$@j~t+|v}~
z!vf(l3Q$Lg7G6kyYwDbmo!2IV<ohWk|7DAYjk2}oX{!b%R=Dixg~b%rr2?~|Bs&R!
z?EValZz}f`dyzhu%~JhS-2OQ(j{mEdGvC&U@)!=Q@7|MO$B3F-2je0STCp9+8_=rK
zn(nAF8F?`71`w1A4Fp#+o2o5O$zBh7MMNtP`SR<2SBEoa=Sx3s)MR4GOhO_aA+aZQ
z#4i=Dai)?=SM^_#az3f^S8C~R)W2$|DWY+4zpBV8<8^<^9i>-OCf<@99lqMVm&?p&
zrx~95`SIP_Fh!g(ydoTlM>Ei;?I!=tgS|9?;CsLiJbAI-vo?j!n4Sir$YPR?kl-_L
z@v|Wq+O1!025<}JS^H2>%V40<Ur(cPR-PM-$ZMlV#?*L5VlsJBH5k2ZL=}5!j34hu
z`J4m}L1xE7_iMr$3~8)4%*m6)GYY&NQ`OSj>N`pcQSO&dWx@YGN6U!PIxaYCney9+
zdfuWhSZyZYf#gfN;MFk&s4r7v1CsRJON%Q<-UiLlL3w<Z38*^B7dClGs*Y4B(d7gp
zP+kUhtiyEBaOfVl#IU$DiFPo~XfE@E^)5*Q=3XmTOh1<QO;I8IJxH?A^kQHvcdZS{
z7s~lVGLZ$8Jy0b8cCP~izP{7ybvW6ZJxSd`5-8;f>^<d4sdP$6dHS6|TX{2L@9zky
zHS<5&{NEo47i^7$gM@-JT=DBsq3&30*_Hu+0Dmh4p2r7wvam4*)YEmm%_1GP%6;lC
zva0hT@r)|5JEE2FRdm<p;|se^i=~T>5dw^k70K6=P9Gerq36cc-_c9T(P49h<-|4w
z;#WlR{o|QGTxr-yWgWLa=cs<yN}c*GxJZ-2=Iucb)(w2QX{5@Niv;|lT~=2P2-vA_
z7LRCX_v2WbXPdn0h#i@qm}96caA0NvUOas^HuDc|Y_T5wZxit#bvTAfi}Dm4(rPAW
z(#QrQ<ndQQHF>$_BqB1B-~FEgPW_92%k~>Y?58|0qWuFzR0(bN`E$S&{(?Kg;L1<V
z%{u=Fz<&SNEdK-OxTkWeM2RV?d@Jcb&TV~N^JB1t&RV*Oxk-(v_j`BIUvLSXQu4-p
ze|tcgU1|UE<wEv0FgkzaA0UlCXzXZOB_E4seRD^ns}B~D@$;7*U<mK3;e9=fFEaTI
zSM`kMeoid$;MMEBL6`Y&p8%&{#6C?iwZfl%8F&bOi%<T9I^};XR<E=0w1`Jb&o%DP
zLMj7X0PpCKI<ee*vuw6s3RLbr4}-py-s&4<I8Y%rl_hxV`nb?oaZ=>&_3yDhHtQW#
zRhP!;t`O7<4fk0t4~8t@x=#W81T`r}@!3oDLYF2uOR(jSH(^;cYrWj)33n|-JdfCG
zmZ3mB@mvs=x-lR<m{Y*bK|Wg{=O?aSz1Hvqp8w)}6GF>jt*|_r!&F+#>{ElyHCj?)
z>%g)5B@=$@50{*hU#bGNY|l|AO;^oFbX0Xkl~5S){sAD5=Ic{70Xd9??m#M+3JbGU
zSaIZLDG$R6N?cXF#kI7Fb8xb*J)G3iRJqGjvmy_3^(<_Xw87#}45Srs=@c{f=dpQk
z>TR>mfe+<gC_~J^BkW+<id#yo#foIwmb%*%nxmBtpwId9u6u{;GLmgp*#Hxl&#J4a
za#@AwmWR(OQ+oG2Z^!UKE#LIJpI449O1vU#Z!ZbJ;tc0%AG}-`PebL?sWCu2JIqyV
z%oM@PUOLSUBc-p!6dM&b{Xn{`QRiOE;(4eiIQ(DYEWA9MjRkl2)LxNPl&GlT8qAKA
zv3xC2sQBTsVjSA6T6GPA+MtD-RqPuth7cw`OD%&{r9CAO_J!=K;hk$^-o){dVANjt
z93R~9i=}n)=i)tEjC_ysohD+I=QUcjV4JS{pRBSNLmwlm4h%#wi#j&QtiJuM+yU%k
z;w~<hUvss{)os8stx(*E^vc)W7d_f}p^!Cx^j`A^OAgcW&anjDkuCbtO!>VNlG<X)
zzQlbi+>qnp(^7kT0)ZE1!VNTP9XFWC<Vqb&8=YPBiGYhL7V6FHJZtWfj8LT~F`pOs
zgEuAZR|v%09$@DPI14ITHT121T3whKB!oMCOW6foG%Go@I*w;jbBr2Z&dezd|4eDh
zBiu+;Wn`*KuqE)D{!v+Wb7*}_QDh@_z)RvR0W{XPgCleraW|X`21Cy((WX}3aa_o6
z9KY2Gc!y-Y8dODYvR&bhHiI^LbJODo*&sP~xaEVDBtGSVU%i1YbOi*A58)VL>c-wu
z+$6Fa5^x+LUM`#Mzi5w_6!Srj5~JdHl>hDdfP&DP!U`22iyFicORdk;M%<gh&sC~9
zYfE@Hnd{>+#?=Wam*2kZz=64NFI+aU5zo3yobVdNP#YshsgvzC1JB2of6iRA*@5fJ
zjn)o+>snDnMK~GspDmT|U<q(!TTp<ee5SX1Uo>_2^HVQRN(N8NCJ;TQuc*|IYAT0M
zD(UkDuidDOJEKshg0dDC=7ft%cSG3gI1jqe`QkLpxQMs;E#DH2&U{jPV-H>^6!I|(
zM{briRprTv&oSNIkbdqCn&&cQqN_J7jCl)B%};UpZIQ;u(bhkOm92GP<n=^vh!I%`
zAW;n(2lYy|x&4Jq#BXvKyD#0Q0U^i1d#yTQirR*6z*q?{8q=<Ac8BG^SW!PJIx};h
zFZTjJy;U#jOwAyXdTO$-Wnr*;xZirIL*6ZZGG|~j2bVrvICkzSc*Fh<g@H>%#kMW!
zJSNLAnK$UY5^$A*y7<9HFtHeq7fi;|O5&!PB)&hVAs?;vc}Yp4h9d9BFl3im?L4h*
zNxC^v?I*r#4!f|`q4B*S>`HhXt>n8M*2q=07*X<K>I|<;F}AZ6dF%@rNz;HEPqgwW
zQpw~+v2i8(n8uU!4&rNR>{!Q^oO39W>L)-#NV_cT!79CBH9EX5`KX>(JFGX;lf1tD
z76R7?<AvlEz~C15)lcPbW(w*8`ub;HBAIrzIbINuO<L15BOy1tAbC|Wend3&3&s}j
zb0%fe>I!-xXT&a0*{sAJ&Fy>59(8<@`BXfXdF=!#XV;yb(`$_`FOB<T;;m53$G?nl
zce;wPiEWI8%WcV0AxUDJ{hxH$-R|sXb9I_XChwP+G{IZW1#L;Xx~nF0GaUz9(&Q!A
z-W45}F$PdTQaTQX%jo=esd|1F56jf@Nq?Dn6`kx*1P9odL->mN9#V~x{b7P6wN;58
zehJFgUkrxpJ}-XK7dxqrzygOH@xjS$9yrX*eep6tM1zT4fvGNdsi%+eY(@zrI@4{!
zrAd$+@V-IpFK0)e*L)KwwDKI`)$T6XM9-?@@GYaJ=}YpUQIlGLo`R`<y7`cln>tz<
z1?xOW&v$eU%%xeMQnL88gpGq#$GUG1s#Mdv*d&;OTjpUex*}liG-x8q+?pMC?+rcS
zb`(@a5JnvivW6J^vfM~iq6Q7Wfs`mbl!sm5jJVWjXa4~_th$eE2K6c&x70!NUM}IW
zo9Sh+yoP`2L@Qxs(xS<j$Fz_p^?mF+IKK&f9R0B;!s*(4WG3Lj1Nkd!W}YXz7tSL`
zHEKpU=ej=%Z>}+ud0}niR^n`KPtrXi3i}pe+KHgDHag^B9p|sQzXN+28mQ@U6x3Kb
zB(i&Ln!h&g!`Se#evh;5i}gx}72`d>(U@P#C(8e~ne+eCO$0X*6q%dP+lsvY>WQNl
zLH;P<cx02?`zc7dYCvtCsD{oL;8`?qei?nRgw>c%SW^}o!n>DyY4@?eZPq_h`z0uK
z<LA|{k>6g=eV5eAmc(KNFh9Rr9G_N@eZfe(w1R=wSwyFGBJ%~)aXPpRpTqGr_L4mx
z-A&f$f8?%LUT*#v9*Y28uP}B*zdL@%a^a(#$qM2JVo88dv8SIEbZ<Dmcbr?C2ITe(
z;cVd;>h@<?bnx3*%pLAL-^Rz&1sQs#^~jNtzF#-TB$mb-mC6dZiGV#s1kHA4O(`7h
zm4W4t0(U6z0letJu&j1r5d^wV>`YYaXT|>j(Oy3}tps-H(*LT13fS1^g6I5n81X5M
z{R-V+>{QUu!7t#SdAa>{P2sJcQR`|97NRDd4{)x{>zqLR1YN0q1dqexj8S``9f%Vu
zREhJg(%_lS>_z3GRA~hmj#D;XF;(J})gz87`Q7=wKcwz`?+<<@Kf8kplIl&oGVN)V
zBuTfl33@Xzj9bB)M|yiPlj7=jphRd_H0J)|Y>y=bvS_@o0~d-j<S-q-P0fZeCi<&#
z(0;7f4p`c^(DTwzQT1zxm@LBc1eXu!4i;=yN4O~|p36Aem{n*oFo_|86xbs5yquBJ
z1gJI$R|4f^Mo-Z@oe}M5a#sM^w?At<IE$>QLsS64)hH+|MJJ-pvB)*L9>`s_2O&~6
zCJ{H={MEn96IDz~fTN@ie!71vi2b8$b!0I;zwj5>!du|Ds&G}ZhSTMR`RGevcJGFs
zHsuKS6LL+8_p-Bz`tl84;O#B9!N+2DRg-SwkF(juh4VO(sAPNv*5d?TU{G0D3*shz
z2XSNuZyFs{Uu7>T6-yC}rHet>ej&8PkUFMQCVTLZq(ZTq>DMHK;jf*5#MHq^0v|%>
ziHrhCVNG3)EP>BnbXgUW%V!?<l8g!>Tc9eMAn$Xaw{*WUuR~SaK_(*ck)T{lD+HYP
zT+1*T-h4}XM=@mq@{mlD{c`%vy>9mKja4etcm%D8I%h$y>T)mvk+%-VDTH&edZfEy
z__$LPetZQw@>@XVJ}}J3U%r^L^F4!E)ip=ioD$~&`ufgIen63gG2JhgKBSYvN-`B)
z)iKigV&~UNff88yVY(_|LSz<xq?by!f6!>*N#A;kT`-Z2fC8ldx4dr1n1GM#gT)>2
zW4bNCnt-lA13Iu@^yc;KvL<^o$()gEj>eS=2lUCVR@`-zyz<qtapa6Kd~Y6zSlY)e
z9c~DwUxN!xn9ntoUG2PEUEK(x`K9qmJmmkKwfVm!+ZSQs9jnV)MnW4jw@gN-;R}bE
z>GN|GsOKB{Z+St`cg<}i=F!cz12_NWK%Fi~(9oIk-Fripcx|5Tx+*I3<lXJ?GU;*|
zUhu-#@CoL!96MK_Q^Fq*&=CJSv?kIh!$ar!RVzExiU&bz#Z<{DEHU{A6mJq3`yo%v
zwH)J7`Ao}jnmCUr-7DyE-|BX7X1YG+`q5U$@`>0ycG`H=duUWe^mm;be-gIGEO8cn
zfkTr}>$~YzX7O{LI*p*~#oluJ%bE%C0-iHp9Uk*i`M~W&BB)t^%SQZYLfMgJ#abM6
zgBVGi;DOBL4Z7uey->T8KC;~{=PFJ?N9q!aNvoD%lqgOtjYAltvYa=aE{h!aX>K)G
zQ(c))Uh#4ATg-c+m+n#1bX6n6LOR_Y{fRtq1S}f7ThXrAQYsTC$A_BH*0oAvt=_YK
z#YDk%ln>x<UM)MV(%+C#J$VOJN<|;#RgT{0){J|{!GloCh~VC7yLjaq4L3=A^w#rf
z4RMazn@nB|aksr0OtbrbRV1vy@$8giDwcvT7G5;?f=1$Xc5WoJsTkqn8_gKP@~vva
z=vLlalQnEiOn6SA0;+|I(R#sas(iQK<~Ve9?Zws1e2{Ix<kO$TPfu)U()BEyIO;s{
zh=^r>`Zp_bq<m8rKu+;X;@b9QFpyH4Qj~nL4H;5sZC@gi<)-{T8ny^;5o)`LWKJS9
zI9f$OI=O{hk_u%gb3pyx?OA~KS|?<e+7>xNwP)@?K(iyIfg2O5|C~RQge1j`g>Ii@
z;~=3K;f_8er9(77M%;uG@%fueA-)#)Fi>;VQ5|`Qri*zetI~NBPrnIq!w*{p5JQ|*
zE2o2b+x{UXl?!98nDP{&-Ey!Q^8WJZV0@O|(fXW6&p@_4xu?sGU|Ogk{SxQJzO~Aq
z?bv*GIKSNX!Q_-LVlSm+hSke+Mq^1%Xg_OfhFm_a9;od<7gjNXY1x@)izBQ!6_VR=
zoGcw@pdvZ=z7d}waT7>dEH1R5QfPLcdD?M!MHk~((w4>?$MPb-^E#)_FVL$bVx+J5
zbZtw6)(hDhyF-~-c}y!Sx}9r=4&M4(J*xj$j<5z7l$27+Za*ic2@Bf|%it!rCjjZR
za5roew#{?bHa%Jv(8jlvV~JBHexcSBm5nbv$1kSla<-r;<BzF-3aIAG4UwCKKiGb)
zTrzDR`X)FY8h)o^l%AwI&6neo>K|C#JF+H#^_NU-P(kH~X@4rV{O}kqNkc(&$dy&u
zw%w^HfC)ZW_Gh)bHa-POvztw^%{>~@!R6wA)*e3mpQ;31^w$^#<jP`!(E(x~UR#XG
z4||xdYo5ZY6569>9$e;VaoU^O`{|~@MOGC#RF1TRsM?-o6rR>qu`*~ew9uibg3r7S
z;ahJ7g?QRPgO*9WSxp`SiR`uzqJGe`N4!d<V3*%WXIWuvY-cdt-M0c&X#K5@1huGl
zjps{jYIBR~qUhLXPfK2XJnzLTnWT&3x_HhW;qzmq)Hz;+O`T=R8?{J$i1rNJ`yJ$2
z7QJQ{Q%w;e5*gGP`6ocl#k<JtIW1VD3SV8>l%{s6?S+{sq$sx^($Pcv>!?xqb5>!6
zI~Ur!j}cchfqsa$EHxR+c?8bUcD+4oC5nnC_B90GLH!phDc6@U!;C#%M>@F5V^7gr
z(>35P1dGE4RAEKog8G~}0qp}4UV7;diK|z*)bMi|h6V}QtK@=9P&Jj*n5P^B$>vmt
zwHmr9&$6i5q+Ku0d{$tsMjai$fKt>LLAdl$eA%w>saY1w9S;Ipyi`2yM};#0QkwYZ
zrIO7n$ENeNt_Rce0<c7U*0nG3doe)iTH{%}9bL>?JizsnhJlCPOq384`(G=Kg-V-y
z+mj(M%sS^uTKA#?A462RG9zQNyG!ChkcWkkJ({P@=cf1}$fTNE*67u~aV3W2_&3T<
z@)h(SI$Kjd(kqBtF1h6yD*dssc}HCyv&HC|TQeN(D!?whdgYHY(RU1Ext4lSvJ+!A
zNHl6E6CT82u9(`o=U^vxN5kd3QYtM0-GR~V72Xrq>{U8?ZQU|6rZ$8DATq2t&ys|O
z_T9TXtH1A7&87iTG$hwiX95;o$RVDW2SGcasXnoH?2uqwq1@jCCJJE#Y9(j0%>q$;
z7+LaV1l)GK+B$#=f;DZzk7uF)pn6p9LABM9Gm_2z?AM{KStxTQQIGANs12P7Bmn^U
z*l%U}t6^SUXZlufeb8M@PX3mu)(1|l>5Lt5?`FuV^8}j<uW`o3zxsFaFNK!UYc$7$
zRoWbT)#Ee*C92wEGJZha<Zgoq7w<Y%Y&8i`M^h^IeKO0+2u=_TRtPUCwQLJ@)=g^a
zifKD&w0!DQP{B(B-ZVyjt9^>1O3HmOaKfz|Evnh$<%nf1fH5y;G@oIIvph+Hr1IWd
z^2R>XvMDm{dAHE8KUrorV5r-@e5lS!;NPrs_)D}ve6=S2yFf+`=jijwZbE=TkW{%y
z%<G?k?ixE{;#uNZCICKwr4Tvc|Hst+zejiszKySB-|ERZ+b#}&eh&0DBAWg4<4LF|
z9dhy8@x9YhZSKMKWdf|dVueo5+;`OBzwmecNu>Yw`uXj>rtDWh-f$SFK&2ruYk}Z%
z*y+1sr~7F5ar2htXOC8zj`{QiOpjWd^Q7ucN5f(WYnf>rzspOPj$v&pgyBpb&*4il
zT~r6T9=JaeMsc&#88YjG@YRv5f}RmD@~wW!VQPg=9j}aDZy)|E{1r|D_Y7Que2#n9
zumRB%Sp_Mi`W0+*didEBKgnGXBT*NG*2(Frr}|N2Ze$zCS8Gg-HHUdV3cYAVmysM?
zCFidpo<#7P7x)LbZU6H_f^ls(@ts$WDc(Mv)>1o<4FUqTZcc(&FIvbax9t)aCg__8
zRSc2$2(i+o@0d+_ac7<V9Pu~XnOr%pgZ4JWcdkK+G^n$Jhqrnz4eBcl`=y!+;};`J
zAw6ok8`>d0p$*#mJ_hC;?gI3D>tPD1ESXc>`1MC+&G`{xYUr}a=`JwZ3_i`j7ozHS
zDR1QD$*AI^9RLTJ(Oqe4pMB09gl*J*(s=izGaOo(7L$bUY8;)L7HY+)FBnt{UF2lB
zlUrCx=m|L}bgt+WLbxD+TFzc#y8c=_-!+e=mLj&JDIRwqdPmz7ttmoLuHY}Anpetv
zN8IY6KwR;Uz|xD}4Vs{CV7lPuSABzP-h7Vy@*y@z6(`<c){4W<d`!e-vvp86ez5?v
zf)PeQsA+6!ev)d%J(cR6{G<lt-gb4&x?Kh2>4#ekKd;ttL4hm7_G<T_A)~;#4v2{t
z!bWfW>dud6n$5OvH%3WDTxMo&{&8or#F{Jgx~Lw&t#2SY2+-v&RIq&g64C4;3JsQ9
zY1<4cR64fV!{ZVa&fVgYj<LiKDVL+x_@(4O4O7!WCa-4O+PYg}lqm=C#PO2d_(e}H
zMBSc!h#wi=mchfw-;n!DApDA)vdPTFn<efF&ULo)vZ+bBW%?h$)eJdtj4OO7ubhvV
z&1i`|Vh`9H!6l7CrvB7<=uE+!US4)NOg<W_a`7B4GJ$17!T3SfRa$D1l;tR|YBp}c
z)3N+H1$)4qz#on3MDA+^RDhicWAu6T+~(QI>eNC2bWZ4)z~kBo9_387(>JhHbWV0d
z|J>&zi1Vv)yxL#O#D1>JuFAlDyb2y8$crR*lwtk0FC?X^Vv5dvp*Y|gh~<^NnX1Z7
zz~Cyvh~z9M_sJ`r8cm;^T#f_{_I2l3KvYjGYLCU~*212NE?H`-TVGh=pxJ!^v^b=o
zJn&NL9mgFX1>LyPI<-eYjE3zyWm}c~jM(Q^bIp6Ue<sH$N2ELVpL6v8*KGg4o&e#T
zp$ldi`ipo<U9M<kLvcTM7g=Le!WNC&OELn?q`jwVx&4%<$&lX~@4IU+?p>-ydcs<3
z%i-s+ZsVAQ{rM<B<jMiXZNEkC>VCX>`~$@LUlGQbqmv@fM-{X}Vfk=-$o16aSN!R$
zT<MqD8rEbNS(FU|ol*|zM?aWtk)X@7{N;>bD@Ap5xruF|3kLCPLaJB_2LlMSu#R3>
zS4_F7N(Vf1jsjk(M;p9y7k~?d7BhBnpKyys)sIckXE8GeDSYwaI+1K17|{I8js29?
zrTXPtCD1e)a4ZF*5He@~^nf)N0z`>9)u&kW^&R(Jiy&YP?X&%6#zJgsmgdylANr1J
zEh$IR1oZ~{5y1Hbv$!d`ISv!`cHWM-<<~RFt1LyAQm>f#VF1p)@Cpf{Tfk#3XIyUJ
z8LoC1n&@wOL4Vy_D-5Z4)m}2(e*o&Ry{pOTSpGk1AfY@vV*T-4KEA3sVd;-MY;9TM
zTA2oJZGc9|wi&u0P0U}$O_fhYt_<3rpUfOya^;<yu}py=*$;}WE;m5^JlQb0Juaak
zVd;F5hdWZO%&PRi<f2=Rx$1bSj^NyxMIK{*>O(Yli@4PqpBUfj3Y#5)>fx8<dc%Cc
zz-it~acbt6Rd)mNjjZ%ZM&EKwfwOMAlm@V_BF~3-G?Q#1YSy;(IM-xJ2D6{0)T}gW
z>p+QsXEwM#|LgL}mV6Vzu$>DyZRi7sjO2(uTwy>f-J^V~U?We@2b42r@Un~Q#e7jr
z#$=MMQT+i9s(VUfl(Ap2_u2(F!@B0eVlY*uwb!9@!@K;NIx5vv|FXr>f!#FCqw$os
zH2M-OkZ#*-!)Q`Lq<fp;%#R!M%oJij?abU-2uZbPYeb{6M##qti?t9ww!G7jyJjT5
zn1WRPy;Ym%h0J-uEJ?|8?ti#Zvn%!JVyG&qVwa_lf`8vc*X$mTnSx9`@U$H6WM1@M
z%Zy04v}=U8)-inO4xP?4@hs_7L7p8iIxl(!?-}2RBoP0kyS)>^=*@C`)<*Fl+Yc2o
zkhyx7Gs1unZ~3!`w)=Z=s9ViDz}m_5zE}pl84X)fU>%^>UF3)rODy7ksAXM2zkhYQ
zO)4GC6+Wfyy6@l?9qQyGsBfRX9z>;dHPv5ZJ<C<phc3!ML1Ivxg**|+&iAA}9M?wg
zwE`OVNclFagOkPTQt|3M=h-v(k~FN@yxLJdx<xxmow*jp^4AJ?(><|ut;?!*Y}c;H
zdwTe<_^EHDL~epTPFz&$f>f@^4<i_KQk4%MSO_@b{l3_eF1L$OeQ)(tH?4Jmmr#03
zPo5ry&l>RX%*7>Tda~(&_<vnY{7v9nVpkj>ly#eWMPj5!ZO%YFeU9PLtCr5-$m5v}
zUl{!JZvXj^mI!IwDj?^2e6A|K0N#i_U+eiPf0xG+O-XL#Ec2NSd)!#2myW;(rr`Xb
z2bx|`SUzY?SyURsfk;R=94GNhkwNr7x+(wnWCHVlG%3LyJl8NAS$2wPK1x5T%F+8f
zGSTwD)f(y=Zbw@twIM)vF*sU@!=p0>hjRD>Cw4GN5h*d<DQ~rTBg~v__YBvaEYt57
zo&&Q3@Og%w%&PtY##-gfV0{xQv7r5=RF-i<@~W4=HF?pTENbX1Z;{z_SGXJ5fZjK~
zi#U&rWVfc5V3R;RAa1NMA2sYB-qV^?Hztdvl!>s|mr$9;lx%py$1g>MWtERM9PNK`
zX8x3NX>UBa#v#z(i7dkB9Ua>^ad`l1ucnyR^#e)bXX$k+EPBH>ZWNgw7CEf&h3~`%
znYE<nvY>EB71N_5QGIv_TI^ZP1Xw4{M@?rypmk3$HG_-xey0i1)=co9Webq~eLl3^
z>d<k_a&*L+oOMi(Ye9+nYKm$ie$D4X{(IL)>xdY?DN^5>Lu6maS2dOPg*wB?e#Rl#
z0ClV-UQ9CT>c7_8dJk*9_9{*FONP37Qrs`^1xXVVDk{vt+8^Fqq_JD2N{1yEtCcnQ
zY^E^#ccU;GTAHSAVw=<bTiXZ2Jonn_or2R|C@1Y}1{9Ddp3yb>{+&-piD|#nB~`p)
zhZ>qMPDzP{J4?t^8G9Ff1g}6e@ri$w4~J}KP+u=gUQQ@&STpat{IP)Ff;iupqN>WX
zoCa-Tj0Q%p|D^oZ_P5d+Cz}i7SS^m!i9x$FAiWuWFhVbdo?F@Ltj~(k@pgwS#UYGJ
zvN(Cat*?0rD`){q$KcLLxst`^ieLYvCe2)^kEx>xn4@oQLxZH|_(rF9ipa;+#}HZl
z*4P&h`Qgo+!54zwG)dYKBA9;$dcKo9rl%1~kaOP}o-2anJt=+Q)05nOYw-`e-J?#|
zD~xJCVPJsg!Dg13Lj%WI((+np+D>yW?k7hKS2-gFW&26u{_=Tryaas1Z$M_EJd?0%
zXUc|>1fQ@&xvz_h?Q{PC@|gVXC6-V|1{KedPNQ(PHn!h@DWs|zCocej9k<&*fN`b+
zscP$NOZ5q?9tPvISg3|VbuCt$UMhe1{A?g8`_q!hRE3jzzlec`2`%C1%+OByYc+p*
zWHGZ-&z~_KI&kHGk?LhS+Nk-Uo9(xtjz$5$&H{}$bu&9E;;!5dW`3RTyCnM7nq9Zm
z*XB}!<v&Gej7x$JyvFS3)ZZLrT<OB8rnL?!xK52Pq$!UgkZeQ+6~@|+3$#x1ts*Q*
zfT7+JBvWI<CUcVTV=m{7Pl^{@ay`DQ5y?neBdfFo=#SmgPWX+C6uC2NR*OS2A?zsD
znqhQSE)4agqbO9r@4RKMdZHE9&J=}*ku3=@VxDvFMT%NowxI6_UPO}QqIb%vprp_b
z`>YjB-nPH`p9dFn|BCTiJLfPCD#+lJQ{eoz=qZ0t(loVripxpZX5I5oGg0+$Ls^zR
zHAnZ0a#7IH(Rgf`cH1Ogj+Ntv@ySsja$gBgNgHVhBJgoVOwe`18rnc&TfltrWZC3-
zVw_&$n|IthC3TeBnR54*is&9G+9i_CYQNRulQF>c<M0;i*wb3+9Uz~Hv<9=UWj-e-
zqY{v?QDBi<sl3X+fP|=9Rzq>!FQ=I1xoOeOvjeLhwkaggNg~w0_5pq%ZjiXQTrhjs
z#}p!p{)b8Hzg1=b>o+sQ5B+CI2g1A7Oc!pP^&M1b?Fr%SccgzkMSTd`*y|4>GwfAR
zt~%xR(RzMrmsJu{kj8j%<vNTf0M?v!rWy#;{|9Mr71ah5c4<Q?P~3`pvEoqNDHONj
zkm62pf);mocemh9f);mocX#*x`R-=T|H;gnmCIb@Cg+@2_I|bp3JJg!xj2J22-p4=
zHEgGs<$`m>D0<TbkDr?0gp)QugUjzBWR6+mYgvgC#<rFVLkKz2^)E#<4>=tc<e~Bs
zXQ9WMQ`ID%`0`+camUmfTqn-+_`Y?#lAWm9rZGIgc<SBA2T0Pb(30`mc1OyR7^;c|
zfC#YA;8Y868-Yq-c2B%S^1Inn1iFyue775Nw403jEH?@+2#;BClQ<hvi$q+%TJ^QD
zTF!Myxc^D7HtqQR$6qoTi`PqbD5Zg;cK18E(^k<Ck9y!-N}W?BHMgZ7kz0k2N#a`u
zW<%==6<o$j%AK}SufwQH-julDg`h|0Co+>?#|`uzY%H|B2Tl{Oe*Nnu(6yP}6<!=C
z{5i9Kakit#9&hWujp2<32Rz8-BC4aXa&vGyQVP{3n!O&tgo}~RZ41?{SdL0GX09SH
zcNDxswJ&P31cGK7{WM8^{mXHt*3P6mp)iXMjFLgoS3*%Nv5&tDo4++=_O8ee?~CJD
z=HVH`M<v<V+%{hP6;cWkTBpxSbR<eDSCT`e{<I7$=msjhp4r0vym93q30R52z;yR*
zD5J&cCgWL*miWV0_A;zZY-8iFk4H>TWI9GTs9yjk>##~0iE?8gIx4Iu(m5c70W`FD
z7}oFA7w&b@S{`i|o2Clt=(sZ2GKN4-wgt)PnCi!L;b1+hN`XW$vylV0@IrwuF8n(6
zbAHq-!M5|>dvdU@KG8;XnCMb_ohsW(OSZEkxXesRIF`hSWr8rr_05mVz&BH)JIcIT
zy$!54JX{Gq>CCfq#4*R;DRZMwIjzyF5T;czl>=^srzD+TXBm9H3*f3Ve|#NX=HL#U
zkpEn@eNoSD?Nw)wkI0d8@P?DF-6-%**`mH4$CWvfEV>v{Dn&TlW3ML}!A;OQVCLLw
zBTV%Se_mseI<&aB3`fu{(b-X65IO?VP5oG#;J&QTG-5JG{Wy+lC&$=>*d-`0a$7mT
zUS$h$mg|u019v8u9)B*meBY3ij=(8m7ciy<G|!Ss&HaH0%7%AvFf+?L)}X{Mcyt(t
zfSy**P30UrXt72klG0CwGvgh3af)N8?sVR`_d5c@?jgYuoK72892mo%aHChZdK_5&
zCs#b{`HqC$+!j+u19Rpi{EUw#X&oxKI3axb+aL#9Tf|#!jrybD+2OT9*DBCA;}4l+
zmyNylaO%G-w%vxGhm+yj(-*vldzR9PT6&E7uCcv&AD#o7Sm)d3X~IWBW$iY@pV`PE
zV!JwLhMhD=<u5$qflW6H9r;ooakYLq9Kd^R`5v<U6a}*`9%lPi2*!n7d|7Dgrv`5V
zs!%EQ@}yiXu3X0tf6dh;;;KBnHtH%Rh0Gt-1AS8O%jTxJuYUHMtjM2F73`%xv$j;@
zyyF>0<)3;mSPKjfkut^*!zE(m374<X#{QSs37G%s8zd&36_kvbbDS~~Gek9mJNCvU
zMfrtmo;OUYzV8BrP)Wmwfh-L55?Q7vsh>6SrZo|VK-}68r43O%r3lH^Q6`Ap-?W_z
z;*vIQ?UefDf-L8ZuUD;O=2kNJHIHH_*H(R+#FeDOmE&NrYI%?F3LklIb1X{MYn{bI
zJRgmp2HSCV1RA##Py@+5u!f;a{YKk)nClE@diNt-Dsd9gZ>?OLC3D{MJ$i+HwOnAj
z6E#_c?H}OX&^4}IRQ1#t`VGEXQ_;>k?4S$fN744)cy5c;%BQ2Gu-TcZ8CBg=6C1l-
zJg}a(nJ_fU+*{)k9iKrxNo8IxTRisxz>Pet>?XadQD3;j@SCWhHQ+T|`L@2^E$fh_
zo$|LUM&9`O+fKL8)aZ?-aB*!ZTS#iUSu5;pbJ$z*n;>&I+dL<yBl3WhIc8;4Hf}}T
z4}?ZZ9@ivvxHa?OH@Ek2^>5+7&4*p#zK>S@?A2E6x^O$b-~dHT4K5V9xuLnXKWO7f
zt!gA&!`)s3&@PYTd&#ria(WMy;<v8vkFPEhvOg4EW0yMxMN=-{sm;n0Dlqxxpdih7
zrO;G$7_-*0xz0K_#?aIb{oK|$V}U`ulQw>Aev0}Tjq_VeAytI^b$A)ldEJJP@-aZ>
zqrq&f3(IWtz6PVQ!^V$;^Q<TK`9Z3vaRD?HYs=9i^76H^!}P35D*#`T44Rc(SPjYC
z^++)-4~u2KuRUQ5NCVkb@db^DM=(WPKhy|&aAl7U*u|Wz!jJ3-7_G1X)5%q3Q)Pg}
z4CY~R;M3=t12u#i;@U%geiN8^L4ogWiFd24phB%SrH+Rnx|;Y;Ii%i9*-gBs&EKkq
z1>In~`Dgj}1!6fk9}ufhd5>F#NEFG1^Uy?iN*VuUppv+)_;SW4JVYlZ9(6~Gub}Kc
zzehF+1I8nR5^`m9(BKR}DZXkG5vl|B2(CV?P;vqYRN*l4sGO}28NQx&vi;LSf9p|o
zF}x-#a|e`lBAwy$l)BfA&gO0WaK5i;f>!I?)vPWIx@TO26xYTE6cA_izJ?qZg^3vi
z^YltvDTLl^S9PbQ(=$lVo9p;AScr6#fkJ=WUbCG7ocHEF2)-~-v!HSF92TkngBcM-
z8!m=*XC1Oop3W4<$;&5y-_DE6`C^^esW=hS=HeLp^WF-z_(MOxMNj8iqW+0<aUe6{
z|8H;ezjamrb-x9pLxK4nCZL6}RMhhsLUyce*#6Rtw~-Y-5nd(B5IH(m^^h@UvCV-v
zJ4WR+{(vbsJd~-MvRil5j3Ev$@63)w#qWS<pOU&PrEBn4nT8X*!+$FEp`jRb(M4I*
zOh%!h-lmYS?{0^V+^vGoGvl-m{w^q%K243>#E~brp$^0dB4W}(&d@1?M|ZPQO~Rwq
zb(EFOH~%I^fS9If4$&xo^u0mRo<Rrye4=)3+u6;nfP4%1Ysqiw&a%IvhZHUn>5khy
zF7ZnOB}<J!n9?fCf7&TxXjzs+l{q@nuFXfHc`dks69qOG`KJV~pcpr=CAecx3($1X
z<Qo6&+k|cugt5pr7i5~y;y3=`e5oK!fY~c9a(UrJgOZfP*%)o@pzk+ZaF8w;?wZ)a
zu-(r$nb%U|x|Z4<M!#CsxyQ2Sws<iW=zZ+^C4IBBj4;pbu*EaFlkj)&su@|iZ~>bk
zP@#e1iCKu`uQw$nqcgLx9P&{N|1p01xrYgcM;IOV?h}YQSSuzf+D^TMQI48YA>qjU
z7%P7utIQ1pe-lrGk~+RIu_j`KZy08iw-QxWvh{N&_ut$jn<h;|CwIN$A*pRaZQobs
zxA7A_Ef+`#dIUz1wLDCxtMGD5VJ-Njg({HzbJfD&Zy$+<y*<W4XIpOLm|nt73zEk-
z+2j3J$Hh+M{QLCGbMg?flCn*_Db{Eet?e1FzjYn)Nezi(VUW1;m~Um}Zh<MJ<2~ui
zIugzmyg_RAa^^xCq-~<;osc9&L`|eNbd$<miEyiWwSB1xjW?y14e%R&9#e~w=^N`n
zsP!EiZ=D-j@Lq}Xp(@rl{|Y~*YrcWa*u7_q_8$#Xir+?vb@#bt>g$x}!TUr7pYSdr
zQ1Wf5@&ZF*SWoFr*plUv{Y)ADONFKw2E@AE%7auNBN$cPFL|-c=6Y16`jneOF*TBf
zRO{DE#h)aHJre|>Wtm<0^CTxOb=$$k)%h&$m9k%R1nfPa4b+4>qZOS2FAOSY?p=d=
z3IFl=cs?|$FHseb02mlYHKXfrYudcA$z)T!lak|1tFT3E!DKp1Q-oxK?__i-<VweC
z4D4mBtB9n-cV7O5_v6cxI@pVF`>qAn!iB6H#E!jFQ(kbdG`<Sq+eyAC;y9F+2dVKs
z_aDJ;`udL@6@iq$yZ*;s;J?#nAdVeN1(FY2f8Tmb%(FF4$&RpVNZgLV^GHYXF9NSm
zUA7wes3*vB=nm*W^wUR*S1AUG@il=AH1qEAgUlf9T4C`mvT}xX>M5YN%-~%pjpKtk
zB@g!+2hytu)Vb@>J&+%l6xV>y3$Hf4he!OD?Btt*Ekg&A6`-YXiTqWjHo%cZ3Cxr^
zPNa^S-SG(%Qsi8s=?;>aDq>k!TvIgP4}J|VQ(pLrNdKWkLPA;RwWj`iYxLhgks_Z;
z3hGw{mO43t0|pthINCVuUy=Wm%Lr{nlwOhlnA0i=eBt7NGd6E?Wf78{sj9gD4NQEe
zYOp(RyV;MX-A|UR0Xo!yXN18R(aX)dAcnBoWr7B5LJV4r1(VV~iC?SpV#YSjEVIwd
z;0peT;?l&9tHJ%fMgP=-0h(Zq^w8ceYZt0p>2us~DEzPUb@kPDGNIG+5#nDbo=6K)
z7|ZH;+AXfoo`bdl(i8zk+>};R#&>G>)}1lrbfn%s5Y2+P!X*?bwn7~!&_uRLhE&dD
z5wKsoO2TZn<}ljS{KR5MRnl7tVM7-i`jdQmA(l2h^t(ih(;0H$EIm?bmbWulSm*{t
zf1XatLKpqJwsu4Ary4qmU~X3K+fV+lhV6ZGlmoyrfWy3ujkOn^X(w)WS!wz~8&?#~
zfbXyC{nOn=UlR;I>lZiYoxi3An2o6c+5ccZry+g3<oTJcclS)(U}Fc#COW^s3caL`
zN&N+M2#Qf~bOSL^TKn>iA*{~z21CsnPTHq8DEcPGnjg^!+^j@l1f%ehl5LTS1S<qW
zHjdu#iW2UbzK?dasV-_=$?|`UOz6Ytxa4<`6Ck~pY@6vNIj~H7!T8ZWF?X~Z&r9`9
z_P#d2m3NU<M1PsKJ-$zLT8BvK&l$`$%J`h7+Wb&<zNX+MqTw#?to$nv?<;`m;&*2K
zNTv)F1~R$Fw5Y?dYbHZ7)3xM+lPqV?z_2}(6PL2>gfe7=ejlzy>h&YWZoJpKd~$wl
zGj5e=#&lojl9F;jbn_oftOz8i&spWcdU(U_?ZflKqk`zM-XMR`S#3qBXQkjW)6|{i
zQ+0S}TWKm+6ieJLR}_iNB>b~6V$Vw8=B$<n^KUn8(gAGvusi;eQI?}wO5~;g3uVNA
z^1@zwm807@GY(!tzD@oKc+>b=W9nOXmsMKKVThm+^BDu%rm{)I<CztQbC;6~VulYH
zX<Fyp&C1(K?tm1Z!qhZEn36rVEW2JOqm3n!?CAd#A3~X=#p;a#t<;EFRq0vaeEU1S
zKSfLXu9W#&?ftcCB2JN9)xl%&7v{5c9{sXi`@ERN4JpcuwNh!XvBbUQMh|b;YFdjK
zqxtf2zRc+_{!Y5U0Ak0|hb&j(_)rbbw8**IC=;(4B5pLZaK(Z0G^@dtY(lY-c(dL$
zo=xmxv4edFFhhX=R-eQ2b9ytP8eU^A48gaG(et<k2Ns8Ig*itY<{yC$4x0UwbJa}z
zVYSJ#=Q;UAZBNv{s8H%c{Li6C0b@>17AMu=9~paSG<H21#fySJt+z~9nRE74B?xG-
zSRqG<hwbu0NhLOsGlMrnxt!kR7Q<}`1P5*GmH+X-|D0-N412RQzPS!-8%Z1gVGGqX
zbL?Dcj9HKtfBC_3v7jtLDW{b4SlyA2uwoOGv|L3_<Lc%vO^VH>*w(a*BU<s4l`chA
zPW#Bx)*(2}*dx`N!bWB_&AGbdem+I4*?-1l40o)$|3*3yIY_^oZPpl|XKv6~g0+>Z
zbKU%y#+-TsjpSAOkkC<D=8^^=n!0;S6i^bDwXpm<cRuPF^6nj>XSWKxn;0{Z^g-&7
zUEEk39ui>;=#X(!+H91#`><6TIZoRXKd*r&<n<#R0i8d|#HYtDR=Xm05mC2)zLV>a
z?fB>63Uz>CfzokKotM0_>+GbkXqViXf%h@^_c59ELGmpT-Fb34_lB~=Ush8^=`}G0
zEwRSS<l{B5La@S-s(&+}rkPs7j-uYk_IK<$%$g-442y!l-tgU{EI7@4?C)RG**RBp
zMvU<1Y?)WRvivNt(CK_9jjwE_BuTY5fRF#MZB6bL?T*n7E8!hkxDe-B?~jz31B2Sk
zX(KP_%mo9<!k){aCBQ~p(fD4!5dW`F53j)cx^nBgyyFm*-`NZuw0j-tGrhch62qnb
ze|q0OECwqF&*7sqgS`giaBq;bDXd5UqD>J;sSW;uUut_-E_D#o@W|CSO}@B^r2fX!
zlU?cKR$<3-R7@rU=|>Qd{9v|9cV&@NSIBxI@}%-EVz}C3a461kp;x&oNQK><O>^jg
zfQYVVX5w2gx9pQijwo@8ESc&nTZm&MKD`VUQR^1k>r!@wu=iCHV^-oSl-jwnp(a9U
zh<IH4J?!e-3Zz@Elf~PU2~$SWTckI{4AFEP0IeRg8-cPrOa6)Z-FP$T;Zf&J5@Pgp
zL>(~TdSPl-d};)av<-`OzKQ5h@eS#XkHmD5SPzlyOb_RUElfZQ|7nDn(SI<fUzKM}
z2v-HA4jT%7S45r_=H*uST!8`*zpgx&Q1z58veH`G^h@Eq;qHxv1zm8%n$6BZfJq$$
zPrw_%4awSUc`cr5*M1iqV4X_t7KH~T&uQAjRJ46;5reEOoavkA?`9?k@Z=BYrg34<
zl&1XCTV<HzcrwXR+bEQR)Psgd45yzxRJQOfK$Jr_?k}sdes$Oa{f~P5H+Onw_2|~O
zDM5bK22;6OxG90#7v1G3Jv#fmc!OirZyHIgo;!|zK>Ja3{aRia)D;AkOs7@>BjQ2*
z25A?7`?V@`lE09Fp%puFqQ3O2wuVD7J*l-3am*M2l$8sNQmv<RO$_Hlx2GQ1Wg7C7
z_?p3lWI5il`TE3qP8`!ck6$d}N;c~xtb2BAb`V|7q%+|8GwU-nT1@re_T}I`$;Ygr
zByDvaapt)~-n(JWXoA_*pFOT4<IT3g{y4{|%QX8rg{0#TOxp>fyQ*<DcGJOwPPS6K
zIJb|>d<rSTP#bORoRNd1Liz@AR8!N&FPe368R|p)veR}LTQVyeyKOb%1~N2a=;gFm
z=|)fKs~gqY$v#^Q7oiy3r(PkY`|Dm6l3v>0sAwCFkGy^tAEB=&L92!wK26}fY^`zw
zp>5`jw&G7PO$%F4?EVri_6eUZCcejGgQ{L=90*QujL!~dNUd+b5)kR}(DL!1=Qo%3
zl$xTF9!;zuk%qJp(}2cU!&)zQNM*+$b~s+6;(0Qh_)f@s=I+l0*ctC+cn)(WtxoF{
zS7+$>Q@$8;R2g!KGx|^*CSqx!H%I8g-Yf4WrrEyE=84bI3u_H4`yvV2Bfcs9R#qB=
zIjws}FTS-95n|;+2|%e|NcX>{JpVVn<o~+wgVm8tnrm^o9kaJ8wDA+r^*pNdRPy}B
z*(ALxp6-Twd$%v38~}dkJ<4z=SW)Z}x{nEUCRg4q=y0*pC)ajtL$hJbOB{sXacF6V
z8)A|)XhxlC4=MtuOBSU6nEbG<^}^x%WtXYQ##jJir*5Lw*S{IdSG*=Wn9Xv!>Z00W
z0j7Y-PNq0kU|H~-uAgd)*qe0}?Y*G<2oN}wJc|6g$;-ca1!0rDsVDpqyf=@~eN4Io
zu9gHOm)dYD^UL(w7_5yW85J43Mk5*&ts}Nadte0L>v~2e?uWCSWwL_bQs7$x-=toH
z)0D}f*9H)@6_r*E>;lRlL?a{cOt3|Br|{Y%jVmwMjtCrho0Iaw)~J*e#aAhw1vYpp
zy%szuscb5_BNROm`#3{#vU`r(nYoE&K2z3m?j1Yd{kj>+sA_1$6~BBWgy*#g3y{Rh
zpN_zfT9)nZ8U2k(PeCjx<g9{K+i^l9=s!(aAj1jdOkF48XYvH1p}98x*g$&d+H|i<
zQ)+ONA#|Y>Aa!SApJkKo$rH5BDj-mE#wfyfqeUdf8LZU1j1cCD^ZIV7eUoZ`w2Jg?
zdL$Rk(m{y1y}P0RStuY%ppnoIK4%K(Zd}kK--=xt<BAxwk7TGursKG`U<KOakxAK$
zUq#+II(p1IP?)3V?DzumY}&2^IS5FL14s~3AS(Pq#^0~+^nNv}>}RLERlVU%^sYT2
zj=7)yshk;s9kD{hsGG_5E*YUKQp_)2^kQZc+;uJEep7dfnj7D@PO^m0yP(d1sk(@i
zKj~sN9=~P<qN!V}Mez@Al1Rb69e1RCwhl*-B7lvuuoB(;aK(#2vd=d+v(aW>54*`%
zZ7f6UCMpnxcWvUZ(rCG)2GDYvYXdWehiT7e=Av~6#-JK!?&RV#DB{g}CVSIy6<8~*
zE$7f=SrIx8n#N7Iob$*LjO<#FW7V0r(mAu^h)XvWegTOqrt|hiEHif>hiLu~nmk~7
zK*9dZlFTTtz}g_l+cb~YI4c(6gbWG~mcUud_{rJKxow44taoo7>jcdnZI^m<@E4D9
zsmz`-R+8MX0DkIl{DelP$s;V+KWN=i@{S_vRgRw_$IYAWeyrp3s*!LPqPcT2D25mL
ze=6PoZ#&4KGqO)#8H9?nnu?Rw4~Znt^`t^Z;s+WV^cAx|9UFLZunF@-R#|T2k9bH0
zZ<A(K(9)yM+RbxNw1<3g4@!X|zl?1K-qmr4hyPe4m!f&Vk$RSR;K~z30y9J|*WE~C
zKy~7-Iq|{i0C}!Wv!JaVXu6U%^=x%5eB1I?9^mIt?Bb~^O{H7Cul;ek9HBEo1Z4@f
ziGxRjl}jh6ht<pG7rDymJwKbp{1bd*#0<Ha+jdW?JCn3X^aPjZj&P-gtNgCFsm9}u
zv0Uah%<7spHPoSc!EGV)!lg*PxsA$Z-$^b}%^p>>1B#bz8c@I~8nvEZOd+ShFV8*g
zXH~}cJk*vwTc-BP^cGiA7lcCzj;qRwyz<B!0FK#lH`RUkCa)vHc=uBIxb35TH)qn3
z-HBnrb*b&U(qReT(X=whfx09Ol%}}eZrbiGvL8~G{q&`OAS6zE;&h<_B2zOQ{Np8_
zeyI6fxL}ABC=$f~55`LCesHCsbo4bYVZfj^O5K+H=OHNfi{#7Lmw|h#QU&D26DDJ7
zEsqlWI)L)wWvX1%C;A|~DpAQ?fAQd6+s{GPaVU!8_adWHr8gvA!m{vP3?o(fbAx9;
zP?Ix9M2RVg`_W=bsHWVH7^yr$KQ?Y2FQ8y*+y#4{(NvS;I5CRg=SFu3o)0f)W5Zf+
zoRfnFs!2MHt9uUGR*z!zf5oK{cq$Uzq7Y6q{0_WLfbhY#Z0^>BLP#;xaZ*b9vNj@$
z(nnY^T`U&e`CI@^`#i3>Kf~!A@E@2gtyoa9y)hdzx1Op=9K1l7VGO1t#Bu>#&?GWk
ztovksE8g`dH`<R_Ds19#)_=j<vK>+2<5b)m_APgTcFjCLu%X3~(;8DgPeulc{%*=5
z15FAWGcojs0g*Cmc^*AkxHJVYnHSzUjEo3W%8cTz{S8<SaXDZ{e5@2Eg;3iwrTA9#
zRN+|8EG_HEDHhHwRjT%*Y^AJ@;WRSzqV+;h7UiQ@(cke|e>JUz>?j`kSzesU+=}f1
zbi`fgdlIp44+k3WPbjKyW-7eoFEj&LDQdXI2qSahbl4#|3=5a3tWaSrP62aT!^bN!
z2?cUpHpY0U!C&wmLZ>tXw{TO(DHbj1H#jGFtfW{>E=kp;qs#DB+i&`ai4NMI5gK$7
zykJny^|zYMi%<7SRgNEOlhmUP*}X+s4HSEiolx2{PEp<9erYnMsfO;=x)Div_1HbE
z{lPrYX&mF(6`PiSGxs@rToM~Hsfu(X+dnci&b{TQ-K;<uOZ4>-fjbydVdW+k!wmd?
zYhM3DPh3nF@;!V~PUh!I?T&a~i65z|g{Y_8=PvWyisZC;*2tAnd#W)_Ie0k(k5FM8
zg8>J9r87NL2V{12B|>L;sx=F+hr9dLQ+2jV`?icRRCtT<q{AcypOm_iQ7`w+tZfA<
z0vx1ylm%5q%DEFTy;G%suOCC2OIzk6Rp~pi&BqcFUf^y{)srO9WBehiJLW)6(@e&z
zbsCJ)0ObDaE6%KwByVXMi-EK?rYVB8Fo&9N=oW7!eN`h2T|29-Xqk9uL9LMnkS%j&
zR9cv$EP?jL{y=D1taV4k6qPu8X31@ZP*`NS{=3AfRdNCa@wl|AoD1W8(Fc|MB{_<T
zbWDKI#s;|Gm{s4F8m>wn)Ww$>?m{cYoP{!?!_|x#H(b~autoalfLskw;i5Bft_fvl
z@O}$eOX_&x_lNHEmdcJ`LHX`wCAQ$Df~EJZ=eLwx|7Nq1&V5DpB^~Ohc|nr77+ubN
zK_=Xkdb1jlRBO-qXrE6)c)_f}(`th{iymczU=Or_7>)ONE!*&_kacr+%xx~Xdu_nH
z{5ORK7VzgOc|kfoit|Fir(Njb2g!&dq$h$M9KigblHgoyZCcw9r-a?K;&GtgUY%nE
z+Ju~vs_iqLj7>fF5ut}b;7ECy=rP&WbJatPKueCg+Vq2UXRnLAocW&N!lo1E9E2Bc
znRsYnPL@Dh3Dd-=%WjUH3h34X(y^Z1Wt{5-t-|$#UYT>Qnq9^$={1Mv?aFpP|ENQW
z-Cntb=j7QhwU}(-YFDU=Pr)n+#nw@Z)w)rn!snqbVGB2#9bPiGaK1<+P0n=qBc*E`
z6<mUyIXI6e>B6$xE{wRem^m=Qye=6v>*xGwhvsi3QGx+}Rbk2J+tW}_D%H`dXiv|6
zo^q{;zed?#424z${CMDv=4KRroHk-5!__}n-sw$U?Pjn+NmtHv?9k+^Gjz+z5ETE~
zYao%soEsvR^#b00Z8@XI!GlAFBznmWt8(;~o0YLoo!X~8fnId8oF#Yn(hN8b;qTsP
zaLyCaVbd93`Cc1!fGr96w_f3=g;~YDt;@;a7890NF&5O2>wt${oXj))igf*Yq4-__
zRdowQXXzeG20cOML&V-cUMVXzWaC?FS^1x5*|l=KHGe;3m)tIiNGT{u$&qp~$wO5m
zNs$IMuzDbQ(?9pXuRlGReA-wCuQe#y8wxfl7PZ$%SjyNXT`esSH3BkHy+QeK(V7tg
z=@~>&RppY_3N?9mLeG<Q%lm5rDyS)*ExK~n`y`l0s{2fb$ttM(mqC5HX|+|~^5)hk
zaaAFzMAhhwIXaaDt7SHKMr|D#KA+Ezx02iH=zlQid93gzK$76oglhpGMav-h(}~Id
zY4iKvsa$rTrj7$lnAJo?4O{wvtwmo9P$c(HrX}rySI84_`IuJRlGbJyZx%G+WXvC5
zxHk*_fo@K*3g}af6S`TiZ02cuk%wr{bfNtA%!C|n$h<+`#zXQC2J~=eG9<q()#Je=
z8~&96u)V(*zbw7>>FrG=^Q@=cxDV_%z?cD?W7CfPFcvZ;TgPXRJ;R2LR^Kf5%+g0;
zKe?um%%H71mQ|3dB<y{h)-aXD6MI9C{|!1!F2G?R^JJz5x(p3#aDFwq0HtF<Hn4t0
ze2ImmMNbu-ua=W?#;gqti5T7e&L2TL?a2H26sY5@&R^EnPDHFXY+Nx47YYnYNr*R>
zx!}zXuS8m6yaisJ7WP_#<a9|YsV$t9FA7A6y{$gr*Hf?`B7Phc{H{Geb2M~VR>GGq
zPQAHL%zz5)xrn|C*fCg`Ww^mz-J%kc<3(&(WytQAX1e$1FGrok{_bJdKP+;I?SnfZ
zT-7{CZ9QDN8N4e$pEIm5JQz2TEY}$AN`YS!Ey&)n>$G{pjQ?C>?CDaEV)I%g)IH|;
zc9zX!>V#nh77#18*HJ9$p5n&4@fbL4M=`h$e_}MlXK~$XxP%i`O@X?D-TjtI%d|H%
zG!PoFQX30j<JE2Qt-^|<C3`o*HFXE}a<2irYj$2Djx&!Ac5@q3?#pF2k3^n=N?e}v
zUU-RV`!Hx@>G;JxhNwvu#9U2UZq`D38jhR>ouFGMD0v1N3tm|H)H2+kiM95y+ej5J
z37d3IR;E=j{CD)Yl}ic;CH59BqQjLb-m4}hEv_6<4Q<7%)==3Nk05(WLRyj`Qg}Ij
zP*KE~7ClgKNMK}LVR*c{F9Xlw>-9bn-=@U|i>dL#pM`9!@}$J5hUhW+W$w#kCHM%=
z>ZH93s#}zJ5tRepcxUR2c(9a|dZcEbgcPA?9We|yT$rG*_ItxCpRa+lZc$&Fl#)yL
z#^>o3NuHb>ijIfCt%gPQk7`bFp<7{K0N)K=nxO2+={T&?(kpwSJ&#~WA5+u36!3Z%
zKi?STml4;maWC`t)i>8O)!#L^ctI5T(Yj)o@!dP==v&Stm{=cHZE+<=+xz~i#w+8<
zMd*mG|7Bk9qi<6}NBrf0Y@^Sif#0<7lO|*vr2>u(-bFh2zD4yJ9KR)7nt6C5Wh4of
zZef5}t4~GNh48gqIEwh_ryEXjT9uM?SIk5$N`ky6`qL&<8O4Y~LGU|n+^Y`AbJ35x
z2BWqs*85orpC1!!sY)pX0&`H>o^T6KwC;8$YI6fARoVV8Z-D<e^fEP{(DN9cOGv3q
z!T8?86f*2rym3_-Xl~ATs%Ih*nfk|1bXF{gVLMxh7enT=vJV~O9na`+BM(Y-n3FJg
zI&Kz3r(9o06!qMhl@ui+LPAgZ=ok9Y2rXX!a?Z#7rPJ6v`Y81iej>fYeWKsX)y8yq
zb=1S%ACHfl0tjy-XL0O!X%BBaIPsWVci&p+4JgQ&Ik`&G$3gp!VF4uLLcs=w%kn%#
zw&uUCwk_mU6NY`%K5enz71Kj(JR3g2vK15)I5+~%e9P95-EjJl6&m8E+xa1`Je<f9
z<!IN^Q26UbsSv(V=|?F0JVurH#_1+?|BeKjXb~-XzY&8w&`ZL}&ETw+H~s57ByWm+
z9~xMv`S9f>X??G4xJ=dk%dzrh%QGkoXQ^c-6`&YZ*>q4eTi{Ijuza6gyd}hB%DxwT
z#$So--W$L&zFU=^9l~OObUc!9tBtFyn(!!viB2B7M{ZT*o%uLfR_&j@H4YsZ4zJDs
zIx(;G7WHU(48A_ru&Oyo!G@QJ`5^Q5IU{(`r8sWghK3MfKE+3g0PRAHxra@vsi(=v
z(@(Y;wY)hvtLL!g*q!2?iezS%E~rc?6kOQ!_1wMfJ&c`M{-!~O&i}a)g2G5+X6VqO
zT!QZ|=#O$@mfp&oLD}klg*+;UX^M-KC}`#qd9z;^s-4=3l4pEw-DBlmfZ>gqo;MxO
zZMUZ4jN*%J%_Cn&(k02`&^Y%)BbX4wRhGony|V<qOoo&5<{<5FW$g_k3t;}o6bTG(
z6l<6Fkwsu5F7t;AcZNHHTXUS!Ub=I7L}&6o%Jq$WlhmUv>K1P9D4m@<hU9clmJnz%
zHJG@if*(}INDcpfD2#^|a;~;qHmns*Pb1CVEpJbXv^4SNKf;0r1H1d-&P~&>)*3K9
zmK+XOo9H%pxUoL6yrmo1V_&zhb|Wt`Yma}scUYZ++u4ay%_`VN3%^LBNfZ}97ow~}
z3KVo(<>$E*QNPQ?sMoSZl%*^vL7nNnDc_hIctIMB{%&QFVeE(eW-b!R>RLUUJ~?IP
z`#A>k6W=C3NV-DsM%DPn0#wTnzp(suBzni>Gz33SgZcop8?W6#Ix(fFo~KNY1_U@a
z6|ziEZ1e#y&`3%JK1Vv+6uAC*2(Iy1;GSY+TTw(JEdAu3441Ufp|0bV+hfKZtWD#(
z7mc5A55SV9u{9WI@L{Xda$HoTm+{t&tb;3;b(WOYrU_W_uyza5zA)bCU-wkoXV@^;
z8E1ZCXh3h_Qz8S+kM?wATS1xTyqIw#Ii(i&$=Qs;0DGAlm@5*Ts<5%S;;kPISXD=?
zIYE{n)1pf)2>T`JK-?Q%1;>B@hvdl(iB!78>{EXr&b3^NjN;{sP&5%DyvmkyZ)a2?
z(^U9_eVSQlaszQ{-`Hz%pyM}a31d6DfZ|{69F^={7)bf?|H#w$S)Yo^*1QF_IUTOb
z-b#kHi$?E;s>+2J9{XYRbbP84#ohf*lRcbyBd+jZ;f$U-n<;7|Y&Rz~<i|80Q<tEk
z>o?U{!3XY5v?Sn=tJ7b>_(qm`afAbvG+{ie<2Z`J?VVgkMQv5<<l8e>Vr_=~M}5lG
zocu;#PE#^V*#pScOzjfXjiAH=E7(o-%lj#scts-X=cladro7GA^l(jx;}8;^?jx=u
z#kbiOdkU|_i8=l5$2(S64u(ZepP+Y7<eLR2)ur@+Qj~SIu3?aQ_l5J0w@&zVWS&EC
z{#nB$FCx0J{*t9xK2AKXEYtmm_!JDL)=h`bJwc67OLy4(-NO$%>HC>g@Fi72rp8cr
zygDRXbRi%mR1mM6+Qk3V-u_S>s4BrBF!1e+b^>louzR4q2SiWJp$eWbTu^dj`m^)K
za{ygXIrs3S2j^CNWd{WRgDFd2C1c4nV_86v!y*N!aXvaqxg{yt+!0qH{h}D3$<u}W
z(TbpEa$Thj2nhN+#k`h=5#o#oo`j5(g-!*ZS4Xb-F_3&}Sz;%={McYLr`lg=&(Njf
z7UcO^8DD6@Z7IMJL<<6y<eMlao7Hhgt$Ap>=V_88VIym0A66G++c>M+m^>zK4tr8O
z8k3#)0Oz!cf7qZQmE2h*9k@X&h0?ET%K%HFO~AJ-C3v=zB6dPY)m`GYl_}W7ZURoC
z8wO*JMu(c8c(%{kvaGSETy&xz8n&KgWvr-&P&}#D9Tu70$rS>+2{t~D;~)P?;vMW}
zOK$2KOJOHj8+bWP>|sl*l}(;d(@mDLKtF%;pXu9a-*}_yI3RytZV|>&j*whVAPN4a
z5VC)_$zN^bXMm{;k%I8bS5jE80Bk&To`S4Z`hpCl7)7lOxT1)3Rzw?WQrE~xaSD0j
zzpo2s+s?W83{1pa^VxYhzbL?Vl@m!HL&&-vW3YB{&q}EE59`~_kE8=W@t;;%Ro3VX
zN^Uu!Fr6hi(k{e0&oX}hXi)~MHBU~1kB><mLQKX0zTs!Q=Fv!A+jH`jsE88$9(-nb
z2>CgW=R5OPagf(HhWq(rZTHvA%O|6YOzsP`uG^KvEXd)$+A^4(019V7Glt6M)29q7
zbVhN%$$23R+wd`K>9K&*ev;>Nl-=ut?5uSD+^Cx}@oW}BotWn(N>|t`AYUg|7MnG~
zhg9cg<rg2b15C6;8ToC)+V;FLello&j3AwIpF=wDO7vmu+Ikq0aPAj_kDM^1Et`q2
z^4xmQ+~7-`9fS4Ne=wcYo802NCJrfrzLQ)K$E=LYUB_=08PvAu#zD(cn1yX)EKE={
z)8vSX&;nX#ixNvn3fEy?Hbbyk)K*XEHttBppZ&g2F&ydtb>Z-z>?JBCjE!5hjZPM`
z;U4IJ(JccrY$XzAxnbbz1z##jeDbx-;+A%KoGbV+XvC3#5n(g~uB5|s(J~&TJKHBM
zS-$VXBg?lN(+;SvS5n2+<GX8Wtp{-)2pDNP;mN!M?ZEM26|Q`aj{FftQ}emNG+F~Y
z$nUVN2@esLyq}lzY%t7yjtPS5Hmp|Zqz<KZ4c-lOE@|#XG~UT1vQ647GTSPS0=>+C
zHF+L0L`rn2C?omBtp|QoY}L)yN%HdUGE<Y~X@-q2gv*hV>6YXNv82WPVh9c2Ei$aM
zx*KKopswY97kY*-@fcV77Teo}i`Fr2u`nn9rg?cr;tw!DFY3T9^~9=cQW2Rm80TA2
zniGqJAVuh&x7hN5t`NcX5>yIV#?Q<@d#Z{!=g^zF{=t}9%nS|>+nZSFNJf8jPyu-`
zY+=-3b4Z~Z(!d{;jBaeTN}=m&xG*4xYn81ZQC&71?%N_yocF8}qiqbLb-O^Uuan^l
z6g#Z=H5ON`)wUa#vxn8@*Un1VWxWObZcxTGe`**yBOnjTkwQVsTcfx~l$B*A@1L*P
z9MNZXE6aNI_2n&3jH6xb9q@okY?8x&t}eD8ugy<JRY$d^MnaVkLr?<pC(4V{W7h&W
z&7(S?9E2Zc6Y#mODMHEKkf*wL?oEE|N^bl5pl$#mkr8~=M^f9*IReJ`4s}s_G;7Jk
zHEV6(by6^c(|mbTM6Mfj3X3W{Zta3P)e4@9Gw^1O?r?M~Ub!7@|G{u&v9pA2UTZ=$
z>VbzTp5xvb=(2kfdq0>4S909SfnP~K%k@YMbJkkAS%4>*o|_4E$h%PJJ5+9Fd^LMQ
zW@lqiS<pmq8j!)s?^G2z6=|O=<PA}+PK5F$*J_TZ##TjqB#O`x3A}%&5Mt~R!JoDA
zEDdgd=%}Kt4bU?F(uFZ9wdCyf4`u+mSf>;5wiNj^y@`G=t{c{{AM5v-E=JRPL?5Fk
zLhcwK63l6NoLw2KHooA=glF@9qKX>8OhN6je*%#iVEJY9=3YFbzN6J4PPLO;Jhj((
zEE4;+P!pVW4R}B!ncei~B_Je*18~Fg5e;<GJ!6@$)v+7kz)Ae#)^N~i*R6E-lln?$
zD)434*=-Ys-Z}^|8<rdt-84Qwtf6e|7!8skjwVrKDON~Qw1@88&`bG9iLxWA9R1wj
zBtBfL0l-`fd>XRFGCBh{D3xi^JH~SomFD#N>d>?q`-T17$*o)-72t7y4tCNh2#oks
zEX`gr$?tp?m*kjrPMrRAa88D81U@AF#Ft7fa)M1#zrE#SK)I>=L&UE^szslHPNzKu
zyE=j18ET(YdpRYJ@?}(8v`~A24NzO~VD|z_LtuchGf7`_D|)3!K9^pZ2ZBA|Ac8Es
zbUy{P>|E~}@h`>RLjJUGn4q{pUZ_fVI?&LyS$QG9Ox0L60rSFoC?jc=1R>;JshUwr
z??7yk+<FY}<Lmd|h6Fhca?GgX&@MLQr&9ko;;0_f?xsK7)4_3SMfpi>^uJa>WYh8a
zhxHQk?Q)WLPM;vv^NriOx_zIdy-IsoZt9vTG}h;MW4_UL*CRuk)wc(Gw%ci4Tsmah
zy;wC_Sxg<PIu*8ZjooY4+yFQ|S_c`f3P#xGhcPVwz}?92N2LpwSGz&ePVuF9NZP&3
z<~!-Xyf70KjY%PGA1*7rCNqoQa7&TNsx`*=RT>9d^k<1_791p8v`{DE&9pz~d^)bM
z3iK5U#LN1wkwVh?JB3RZSa@8T!AKw;>SWSF-nk^1=#4gkE$i^CDtoR#K|eFoII9eo
zH)8L32heLwsp60sQcpZYYGL4-LeheLy4EnlgnXNplDm->woD!2YTsdPyd#sjdDgsK
zv`X!I-@8DJu(mn!s2F~3iP*6UjEi%4tW9>@mPjr_`w5gIS>QZ}RY+OIGPEt%uw#>K
z$K2fS*Nt6tXo}FQ<IO)`r!tlcYft~MYjno5olI7198RAup2`6oav|AoUW$`>X++-g
z>92p!+a5<8`oT4Z50t+7bVt;afL3NUivADAQcjqj>R|`y*_Tp8g9g99!TBe-tw-h~
zmd9n?A3Q0wZ*x=q?@Ats$4!L=VP}_|T(4alW9IGAQGHc-^ib(RZRcU+Te9Ez7#h_k
z-FEOV?<Vae()jW*7Y)VrI^V4uJiX%N#!1Wt-Kp!{hQB6LtC;(VK7D;};n{izcQ@`Y
z>`_t`sy%GGq{esTpyBeo{?bMH+Zlu#EAfy~T`x(kNX2G!`0wTmkFWn=h?K7R-#d8D
zu-EqnW*N)g>Ok^|mmTJg#z-%$WeVa!W5Sk4mb-~S1L~(6`6fxp$-x3E05^=**KCXj
zO`pMkFv?qBTj?Uzw8klm?QSx1V&60pJn#nB(%p4`A|hl4>~+rl0dh=W3i=aGzmB`p
zRN^zrY;XGzI`5sgZFU<Kr#^62ng;oyE$kQ32<F020ke0KA}v}o-C^*{3;r^cE4f{*
zNji^im0hEFM<5mEf};h7B_gBedL0jOUxpsXNA$!$o<>Fje>>1}cDl?2*l#?L(dEvJ
z{UNM*zkTOehf2^I6K<pgqbGxTeBm{|l6WfF3*kZ!*nPwh#`Q97lw8*S#S+^L3AA`o
z@U1~Un9dFjPg?*Zy~w|)M)#vMei<recZkDk(QItex|@F5<pTY!<JLiVVXCyD<q!PY
zAt^b1KnxSt@}y1Pwu$||gq2|aD=Uu5vILBQ<|-6l9W*Ksf(~DN$ejVLqR;FZz#t=E
zw{_UPJ{sb0u`+Wm0D>ZFU%*Z;UD%weQQ;8^^XoWN8aqAol~yXny%NFDH8w;pcb7{^
zLR|5$A%Uyr@8V(b3_>>Kw+G6;`JUr!NmX!xsAK1K>#asdG>o;Od4W1h&r!^?_+%2E
zM*K-5+)tH0c52;KQAA$9(KQwg7q0#Eu%#Wu(8(%%Oj}&1i~0!nh_aSKM=u>Rl9eFU
zA%rb8nnCBqat_31ai?ab1;(_e0$#P2<%dlW247XlQsIuqtXtVGDNCInAn)%P)qX8?
zqS&-<j~q}*Q7P&-Fq`&vO6M?x>RYRNOz`*-G0ix*dhcz?l3NNR6q*B~(e+IK3g|y$
z$?@1R<^cb#JaCrdn0Pcnglq3s#q8OO@;e3Q5K9hhX%enPq5`ovoj(99s);As6e=!g
zbmp!f8r&l3sJ99@f)`dj|I(*}T;^1T@n6No2X9on%cP!MT?JUA2frWX|H&X5K<Ulz
z`>L%>7Ghq1-5RP`jT2(lbs|6NF^WDdnN5|G`u?Cdi@EuUBA}GgYHUHo^LgQC;D72{
zLdKC@r1Y$Q&_ZIcA|@@X|0O+B9_;$0uT=U>fBZbAN%G=MMT^hxI>eNHv#z5GoBmZ*
z(xdpO_ibh}l?J#&B)hiUvfFs1SHeN!k9{A{Yn@Td$B|-BR3`eD#OVDuXmx#jhb&}U
z2=7(i@nOC|Np1Y?6xgP?)BTz>r`TY`-a6Kf$7#*N4J(4>v3mVrcAl0<R%9t$TL>E0
zs^D#bSEU|ha#gKDynNDECvy3%=Y`!FesJeSDxRA|d+LK;F17rfsQ$Q)#@=diliAog
z_o|l$)Z>gnzIRR)O73*4FoZ)ql*{BgNGz9hz=*QUK^pXwRG-$?J(JU~J5f4@V-^Zs
z-Q8+&vGe0YyYCp##`wA=;E-4uR)E)97Fw9yY;XFbg#y&B!%{`qRvG%>B&%beY3XyL
zVpyzf48e>Fig<mZnEmd!X}DI4Ork*Va@&q*0K~J#R|oA>p{nh6_C~dnX$l-ty2dA)
zV``$}sjWmu3y|||D*u?5gx&MXN3!mF*ce*<eYJ7@5^>65)?RuAFZs?m!h3{4P*3BC
z3h)mm@7HHL+@E1E%p~EiyK=%hSQDMVP<2VguGr0FUUe6;D|J<##u?6~%_sl{F{@%f
zY>fh!??9sOccOqk;{~@4vziqdc~PKYq(3J&ygoc9MRMr!<i#*k6{loI59u22D+NmO
z?X{|jiVo(?Nxt_D#%#l*w^{6ry&LH~jWKm$s~m}**CfKpV(<qRHD5S`f_L#-&&{8j
zvT{K*;$idK-!el!^-X}~FZp==9vIgtl_2eUlBhV??jN)YqF>^#N`_A+l?`K6Bw;^D
zo$G83<hvv3Rq}n<!k0AQElnfhE1MY*|8N8=I*dt%@wq)_jwwpif*5|JYF|lij;7mY
z$no$ptM7FhDy4oo<hs^{KM-Xq)SE|>MlMm)myA(~FKoW1{r=&c`-Yx>`+yx9KIwd;
zv6|p$TRe#({bfsy@hXS7YQ+I*S*wC0u55|nQ6N1y=QeW_L!u;?$Qm>%nQLSmb!JBm
z7}oq5yHvCqhXW#}d;Pxaq`-MtpW(T^vi6HcEzXXBc^|n0%*;at<bD+^UXY8F*ti}T
zlSz^XMy;gGAA9*MAIL!GtM-R+lop2){dtr;TPa?6q*78sl!|r&&)mZYps#NS*?xfQ
zx=OIh9ZFm&H-jxh4XbmKoe12zE+kZiQgVpF0N888O562Y_WEYdLqU9_UWQMKqKRE{
zR*oPXPlt4@3j%$cn9C6#>883$kh8n>ALDs4?A~7IM-{#aaxz(SCl~YAkmIC(qG&m7
z7sL!*GVmM*-{ok2SxjAAN$My`2R94i6HV4%otiP>pgD_I9A#|<g>1W?@>UwBubCRN
z7M1j(vYmXjb=O);^J-Tt9tO!a@$P;k3v$mycmG|^aFDfkJ!H-|03GEQ@@Jckk$2nK
zUHJ1HcSa4NLKAR3DkixO(@&eeE`!Xcc;9J+dRW1xw@((rG7RAwYSYkCE9|VjlU~m@
z9c0Zxc%faec(UR*qkLSR6LxOxC4-y}NG+!~E)87ggYSDE-Ydxb&nm+!-qLLJNi~S7
z;|X8zGT!A|JARX%N5fQoTT%S_Hxg*xC;6IGydATrkh$#T&ALkCKt{(NU1$QXRy>bZ
zEEl3tax`HPvq54L*_UVd{KGU71uIcBB5gyelJcq^ZGpuFBvRmUX0&XGCABYHm!DH1
zGaBO8=J<NkhG=ilYd&}ElmQs2LG{l5g<*rYmFULEg)Y2o8qXYVo8k?x?Rumt3rev&
zxoP=n8wulHDtk@gK=-R~E9sOB=TOb1laxnz48S?i7R^E(r6ISEEr}LNQC?b3PLd{b
z30Rloj@n-Am54!O{?beKwFnIkY&8;qkg~o30zAw=$b}ccOD9@YR*o_zk@CQaZYGz<
z_j0ePVvY{&U>LTDNJxkh4#c;c)5g=j6dRZaOsK0aPO{e35w)O*f^Awb!xXPA{l`)2
z8)G6H&#e45x9rRAOIa}7KChnc@7O{Uwks}nSaew8df)L>Ukd{hTbLxDs69MSHBP$o
z{@P5)SGX^+xf5)9^n;u6r~9n74q6jvDn2zP#edtG^_tB>YVi=-0?kx48JRqLa!Ko_
zpM3JPvERl#!>6fy+SMgYl!Jcs(#JIr7jIQPmj61c*v6tYGL#6m9IJVhzYFm%EuUnU
zx1Zfhi~fTlUOBF!Vg2JB``1T(^vHA9L74*~qV@Y2EAW;h>qiUqn6YByoZ1oD+eE(J
zaW;otsj=e2wK`Gf@XWC~cZ+h}FD0r*-01-<X37%7e9>*LK&|l$xsMtmoPGsnZ_``N
z+(e09<ak8GDSCI<C$D?IJ_2V+#*>~9v3EdOLU0lF@=PME*bRV57#OXO{euBi);4Gc
zHOO7k+nS;hNjHRdGkNDEvU;*dfNd)K=Hz28)nLx1O`u@>tc|nv0L2%)9Gs_H6m5d#
z-+aerVBjnH8Brwx!;b*Q2G=!aMsYOXnx=3+ds|LMoyGCSuo^YRorEzLx-=@Q=vOtG
zD?v`0(Pyl%Hg&LF@kxbQI-|IC#ANq+4{_A_)?VGklZTt&Yl023EUUT-jtz0agW2tH
za(N^nlWxuY>U?A!0$a<awk=I>0$AJCp)>kRf3O97RR~2@mc%0yV|fxa1sWE0r0w}9
zt8~Dp*{>E%z8_E^G-<lz4XOHDJoPe*g_t1jw1VXF0;|%Aiu0SgQz`k<zTf=`W9Xpx
zFL2VG>PRNm3a!nXeEE#Lh;iHeCCC}!Ri!H$ezUAX5d(OXVf=umv~O+%NPGan<VOmW
zEdQHonsZ?E?wTdD@oboC&qsvOuqeZguXSd!sz%z|h<?%`c&7~%siBfCaW)B51Wf&e
z<kJ6OoF3DBO10YyazoYYe!Id_PMvK{@oZ$Cc>v(jZ81JqieA(s;s6Ig&<51}W6C1E
zkp*9Y{pi)~70Ptun1^`!cgtDKHWnQ1M-_2;H1^euOA?K0)2kTU@`@6=t`%WQTVnE=
z{f49vPbh{r?UPus;s5Sa(Gn`Z+?pJO8C?pBkt43$i&>UNlO*cr@xI06J9Lt(?gPFM
zVq)}I?z2=g(-gv|NHO-J;ZrnsOT|xy=kmsGnWM`QlHwO0ZKNh=VbHh}6;TVVRwiZM
zDe{d`RuS_ugP}J{cxi79I3zhFPOWSE*kv{Tdo7JFM;qM`qr4OI-7hmq{jzbCRKoEi
z>ApddnW~5MKSh=CM*N3$$5x8J?`sGK)tb96)Mg~oae)I#3rC<4q9e#3e*$Cv3^yNB
z)ij!Ot&4b_mlTA)-#=$x<P8Ki?Al+7aaGlZWLOM6$lXiA=i@E*qvC7UN)D6V>cgoF
zD3|GO>#U+_7G${i_mdN&PO(!C>vyVori5hJ*<qiYC@ElRyL5`nc9MDU`J$~p&BiwE
z*Va7RyPXVu9|Mb17ZX8#<$Qr09mTXVcOEgk<+FZGMlIg4QS*giF>ke<aTp&-fv`&P
zDbyvSz%WBlcQ2no!w2vo>YZ2|l)E6Oz}$?|q@>D1`=pWFDpLj<o$!JLrvHzs_l#%5
z58Jm<s<msAShXtl-fBisTWnf;&zME4X6+e!Z?Op?XzfkyP3^s@RqgM|{dr#8|NC8D
z<z;exuj@RI<L)Sjl_^CR-rPM+OcvLMt;*$NoYo4yPnZJTp%i=pRevIWo1K}=aWRAk
z>tiWX_<ByLR8$sWn59dNcv2j{jJ(DJ@0K)|_PJv^h){~!3Vq^~HP$dPU*xw)9y+;}
zWMtbRoR1Z1kd-39xZcVeNzc-6IsJ%zy^{|Q8kICine!P<Q#z@2k8k(pHPKsEg)&jG
z?Aq_?KI?O)d@e1X)+k~4dq@Om`lTL`^ZIv%9PmC@-{jucV`H*Yh_5k^t)IHdm_koz
zN_(b-Ps*fib;R9f)8@msIWj(!fb0@mvkqB*(!W=mlAt}9$-7hFx^X4KY{FL>MzUvh
zUXRw=FUGx4&4F5$05|(_z57MrN^!}95DN~S+qhL3N16End@3^=CzVl{W_#%KUa!um
zMNV0#4uf$oiUb2Q;20z&OQ*8MZ%5v*6uz?Iu;W~W2m?~gPE6K6gd4qZ;Bt50D5h0)
z*k=Zw$sZH>*u~~CL+bP|PaXr6?3QpVW`^FYkGahWOv@qHILJK3Pj*}>PP`G4Y{s?V
z&Iuk5lt-Pldwpkj@tf6>qkZzr*cJh)-B>8A`s_&}!2%1u?N%PUk_O9w?hrH1K1VBN
z<MppS-p=e7hw$Yf{NM|c&7lK$FJFVk*`qr_{)?y1z&S-T`7{ER9mz#$bI+B%=Awd1
zzo*ZK`6n#@zKW8E39->$oQ3PDiD~h<?vsaG)Boh|zml|UrC$-N=F+4p7sz@en<a~%
zCpRtmxr2<`dcKJzvzw_A9{_TPAM$l*NJKcLE{#8pONQ;V*~Yw)pp!Fder3}XvF)u>
zT=CdPHmLiIEvkE}!>ojpD&Zu8&G=e@IbQj`sBQ6*{zp0Fgfb~E6CEM^zy4FB`x)R7
z!Pq@L@XHTKL3*u4ay<BJP(lG?=@+8U9kH>56-ncF<_d!qcmjJC&T*^ukhy2=i9%1z
z3R4~@ER;y&V{zK$&%rH*tH-9VEb$r*mj{eOdx%z(#Z0$k9@)(|Lh`*D+DdGH75z%1
zqwtensi|zN&C6Jtko?++_CU>jz-W58r=NbwSJ2?+atE>0+O_r+GI?KqR!1;uke+EU
z4`wOxlfoG+`YFTtX#SSQ-mHQl>Yz>a3w3Kz=Vjz@r36l#+l!=+$`EQ6zS&4D*~O)|
zCzn*hwck5+n)No5cVm+k<QN~z)cFOYXnr4MMlZem9wR^_*t0-45IL?PzB>59Cl9ZP
z+g`e7zInQVI`dq9f!?|*G;}GmY-`w?=6AqlA>n)Fo&g)F;3@CEj-%w@W!v&oZ_lCu
z=t|OVM{05WV=nBvq3{$Mf8dfM3job-qA4RdJ(Hh!Wb|91b&M5(XEJ9|=IP>wr=lS2
zHC<2j;WqvCtz*zMRuM|uM%ZIMEf>Mr2C+7*ZQk*I`Eibg17S}t_xx#K({QQ)Oh{?g
z$kpyHs`<Q>jOX~`Wg-P(9-GK=%0Tz?dUuQ8pc19BMVCT-0H&uirAPIb=LlBEvOHVE
z_j_NvQQXX+sjOn*UiIw0l6(VAhE73Tcz@Q*wMze#v7=OXZZz(D&h%Sz8yolgUtXR6
z6z=py$&>v}$Vtp5BuuLl@pEV=RU|OP>g1HvDd~tDUI-%nYHCn8B}yWu9EYn9rc&Hv
zTUghNQm(cAA0UiK3tkyJxAP)jipoHQpzwFfMVGcY{!pDiJoKY6GMa!Nnnl%Wim-VG
zYAseY_fxD`24@FeI*Y>(-wExJn*EtNhtcLl!H5J`dK)mu^Kwu1>#0b>JlyT)bmo0`
zyGwA1!!C`C+bG(eVAhr2MF*Vs5(_QWLq=M5_|Kd=SgQI4?GO*)lzgJ*AVJl|Y-pt<
z4n>Li3yF|INvQmW=o&<0-}p>2SC@k$*}S`7c0>#d!B%RG`cu0{O4@ZFmm`&cRZeU=
z{tIIPSm4tCZu;$49Q`TOcMi2ccI{g*eTBDBoV&R1i~=gA04}qGJC<0Rr(;9oV=*%>
zGl*L+=BzaJHRSQ--$t5!N+;ez#^Y`Ypm?RFfU*5bchUZwJ{h+rpO!F5B#AjDpmxcs
z?XDsv$)nLP+ayU($y0LRX*Sn{ENBIJV|YnS+AIJ`*n-#wi{ReLO*DO5U#;u5*tqFO
zcsCPKHYvJ1tp1Dn@XGZQ`%Qz<4Q~sT$*X(Q-s`th2A6La97^tqi%|C0Ew|SySaR5|
zWS3IX!B127HixT6zRgp}<`W;=r0yV2q8eK!1quajUt$sld}R2w|Mn16)TVvuy(Y3s
zD4C%*<KETh%kPyP1T5X-R4WW*{eKSk6y5{^x~c<bdn7WdeT-5*Y|chw;Vvv8jut^`
zfo#VaIc#E9$V>hu&AWrtf^=4u*i*)tu{XQrkfk4+$JYoyjScp5503_w+18Gv-nbis
znaFR>r=HoS-2OJY>EiVGw$Ic~YD#m4UyQBRy2b;ex5KkP+XzPvEKnhX-!;RGwciH|
z*p~z?FZj9oU+7f(SyR5Hj2=_3$;up;>W?0+@QRCPVr~-Y!-74DKjsRr=uP^qvOzy{
z|0TUVI#?IQJEn+pAq{98=^fQ;D*5?smUx5~cl5D#R5T$|wFkKT0A&cYWe|Fv!;d?l
zF>u7=VA1gMn^KY6xH;1~ZmfNddRQ?uOFcf)`=dL^Es~?@vuZMzw&Dlk%j`V_r716>
z`UhV#CJ>J)txAS1K1!E~=mO?qb;^xg0>!8ignD?->6+Qt&oRd**|5=Zg|s#Nz!CNk
zVlrIJJIxBx>7CP{eN(mbF{(A7SrW5f0mWhpC=V~SbD&IWN0;%_1)pbC0oS-TQH60_
z=r+209%ap#CPjZg<6ygOs)Zv94`;trWB{=+Ggx!bO>u`)mCU<uxabS6Pz9}#au0Em
z!E0`IW@lFsy|(`;XE4Lj3UlKD(N8$Ep9~~E05tTk0X6<g@+rjDAL22cezs3?s*ADh
zPM|)GexER_oGI!|BG{H+$}-;aq<gGk>zT%h|8{m-bj&j|#p!zq+WlycwGYvEE-{fU
z=WLR?+Ng5Bfaia8hql$KFpY?;$%~pAk-F;|&=DUX4{<T!Uq$Hjcp9tXQ=m|Ig;?|E
zxCrB#`d|-4)mhJ>pV=<@mQLQ-a0M79Wc&z!o!ZN0(fVrqgRUUJf!7_JtM6S0DuvZI
z?tgxkC4ZJ>I$@futonrBC-*dpEOn~JnrFs-rZ#9;a6yKf;ABwAjT{&C!faB_X^j=S
zM(5<N5dm4hH!7g3+n%l^bEr4HPb|A2i^6ssDyG^EEt^ueEpb7`KlKB?wBhQqm!V^C
z`mO=jgtu~O@Gt%lW~6!Vl*y}htcDDKpEB(Op1Sxju=LZq<?xncTEoQ3o<2+J^uX1N
zHe3^4Rb!LV>Xe#@?N0ky*Bo`*?h2Ok#`>y5;0%9U7jPVj-2D$Db*6I5x7UrukeRKt
z?XcAC3KsdSvBmZRsyrEfv{PcM10~_EnKtx(Z|KF0EOSWe?Pnez{u}bTA$r7r=Z-09
zU7eMmPFh`joQpRu{%Px%ceznK<hfDq3h)c(7w=?rP(Eh;PJGaF+cQK!7OJMv&$uu1
z`UBaw0K#ryw+8r63|)^>ZS(uf{4rAs#f9nm_v*+N3PP>Bp;5-2%^&AS2!r4gbEXqN
z#G+Tk)U03e!RDWYdh@>yocID^OfM7v-z)vIpW8`EECqiW(QUN37VN;9YjckYF7Bju
z#44{t%uH6S^lr$N^0xhcS@EnXFQxMyi8$+DgOj&8(n|vqqMEwI-O{QPr8ET=oaS*T
z!zThB8Pw-0MI{|)GA}zW%{}L|3VWwWW;l%NSG2K@&xqG0Xu*Eq5f0k?sZe%G6Ot>(
zQz5ccfD=$n?H5cs)8j76^(y|Wrx6#IwBD(GKN3eV?ji*qpXC`=)3h{KP@5LA*KWBk
zO@0J$V7_XsJev%s?QrcUvBy5DF<Nvn^rB%A;hH4tV_&{)Ut@fr@GR>0M586<TrqpK
zY7@=Sj0#OP{I)i_@}fyK@xpN?ewq#!=~v;kGS5|oX|G?ZIONk8_lbwyuX!a-dFBz?
zirP4X&j}wm^e_U|?SUuh&wsjQfdkkD+7o#imR1&`fzH$ZIKtXN;!c}R!L)IDrI`%^
z`?_5$4j>b9O{e(Qc4cAQ|55x6>N(ggsI9SN=D6ze=RfZttzI)~Q>1Vz{dfdtExqHS
z-1S~fr^3U2g=%~CNtnS$ISl_VB#Ok@74N(Fz2qK+rT3?!NWYbUu7@|7${2Zs#wbjV
z&zF7YHq-miw?aGWWddK@Ot~ilSqwq6J=;^}zX+={Sr&Ug!C09rd0yGj@?%XxtVwDc
zH)$PnO2hHx*7WyC@Vp!Nu2C6Q$~_c+HgX!X3sI@@wB$QU&$AKutn2|>P}5%PJNfK2
zFDxJIvZB7{(=BVpbv7<630yYsm9~BMsUF_IV+TV36-)-+?JO>^@B}IxD?MFQ-uv2F
zx&-03@MzPGNtH?Lm_2AdTK$8ve8^u@oIZB52^7<fZ<6G_YW2>IW96nRdA(j)Kwcg%
z7W_&`=-IWFQ}^USYBXY!(*8>2r;JlWqy~EyO!1+EK!%<@%aBm}BaCrt?YnB%#kq_s
z_8SWHcbNKUqrRntes@$*pG8F5rM?8vtl~esDaqyyG7+pR>m6dF{$sDpe2Lt}rU<ZM
zpv={AZ<l|i&6-6m>boSat7#Y4`^(|Cme<En%NILM-SQ6HlIm>CI5!R~#IF%wkw$)@
zYFiH2d$>x41R?J-E-x{(%gMJ$eZ2(QqbMH^8Z5jw>B#P9(?Z1l!w{@P`*ub~tvxed
zIC*)jmUwm4owM+4c0&Sdr-V2d`p5C)!^H0MuU;ls?6v`?A*8;3QGP25hc5c<_Li;>
z37JM2B{V=5`^CivcMS?~;g!y;f&qTxcTucq@i_U%enJz@gOBipHQ3kr&J(``g`x+B
zAYdv^ojZ~J%#6*6ByLn>*CQ^{WnCG1pnQC7FmAW{P-h>;WWxA=(!(7h9Pi&;aunIM
z1&+^ronO!X#Ov9y;K=y;9SB2&u|5xLIic-=RpV8OYhma|72_Kj(5EPgh=lxqlr|I*
zR%l6sv7brS3IEBDZ=Dm5<@Sj+K21uKk~a`Oq;zR}Xwmn|(sK)}eQh+9iwi|)>V?WS
zczrwQhd*)l*-dG9Le=;B^~giutLF(UFtfi|YOXl{jLRTB+_aTF8$`utW%T><5BPyx
z%|l1XX`rzjvUB?2fsFrWi&;<M>^T8TVm2*IRODjl6W5M|V-{PCc*|rsJ72^6V^PX|
znAiKEuG`-L&ZOMZKZmqj^g-UL!(1E3%r%os_JfhboC?eLqZ$LdM*p--S7fvgX0Os3
z0hwo)q_TUu7Yx0W8>vYVc?OEgD3{NUL+nn0Jk$GL&uWskw`3}VXIL!d>iCDbglXA0
zSVq}&o4y|=6Hz$;r!_^Gi<Xipe`pt{Dd`eG(~u_7m}!!nbzN1ZZ^O2yxO)ATKXFJ;
zcs&=1K^|biz=5^soG|N~y+jh+m?Bp$p<J6Fl&~c5RUg;D*M(@qPv&e=P5c%v_Y|D3
zkc~FJA)XXmgsBK7W5bzlWz;W@hnlunc%xxA^kaIm=P95-H#y7F&HWsrR+Q9U|CFNk
z^~|DOwG)Q9EU9p#MzOdZST^S1AuB~xXgpv$ds3_pJ~*)sLjQ@eW4knRf7PNi)AzN4
zhZg(%2}4{6KWOsR5aC**4x~uo5nM&`-~91pLrM(eQbXGc!uw|KlV({s7n#F45@`v~
z{MhSkCgn6t8S3aD(%$M@MP)hl2i61<51y)`O&Qq(Ru~`u*(FQ`v@b5!p5;Zxm-cWv
zoZtj(HY^K#DVmRKim=Xut7H#%{|NYS)Last9MEfS!NJP8R28UDcJKf$1v<yISSctg
z4d=sJ0I;FljfIfH^NB6J#Y#O5sb}L_8QJ%rE4{_4%(#iP+=nZd3`Mm3(F9&?P`ZW~
zaaQGY$Bj->rux80{WQ9hT7BX$?ju6O;7cm2F+0ZGW1G4n<jhF+GxDHd{>37eeuu;-
z(Vjs=Qhdbv2!Hi44Kg4!N@_We!&D}9P~6oWN+@LfoU5!4@LRQ;GjSBQ&Ri}`dd(6(
z7@Y?(LEA_aTDSVAktmASZ>p%uJ%C(#mesH1rxKI)>H=-wtxolEwJ^MNSanQJ*Bcq$
zb57=4D(W&n;B^k|?Urr1^j-rq+kO41xTzPT=L6aomg_R!x4uBIa=s=NLY!=(ovl`p
zky?bcg<5|G3ualITeV*;4bD>D7gzDO7mU0$0kyw1eH7oWh`rzV>;!dK4f^Nw8EYhO
z!jfF%NtR&j*oh%O+~4@kPFXdV-_%AhxL@1q)O}=lGv0oDiCH1bKZJ*TA?qaQO91$h
zDxaKP@a^&!t2_MZ8rB8rOn0Ui@Bg>sjL(cnO5bF?`v+LwzWu9@(xeDoc86z#5A!Eu
z><KeyeWkaBEqtxpn<l#%A6A{3*xz$)<Qq(%e)pCMwGaW8VT;JkZp{9SNZEikuAW;o
zmRP<P#d_Vg=~?Sq0!#hN!kp9yo-MCRt~nzf&2XF)=gbG>3<@ERUKn!cPEITtdOOU(
zZ(J&^Q*-|ig}2h-RYddMD^#r03ng#FXMaAXXgfHj!;fMleeu_zq|DA&9pJY+XS1z$
zn+!^e7dLxkpS{=l>s|87qvqBu@m?S<a*kIGv%+d+eVEz-w@dj5&lAM#ocomEvDhJc
zg9+w+H>I{VCqb1fdy!{hzkbZtC<wglh#~Q86C_k|3H=Sc58HD3zQ6;}R}0h{-r_nQ
z81<yhfLo9%9wYura2XHv-IR{cwrbmq;RQCSU`mMD(p&v`<c#_dqu@Zpx3o^S*JMyw
z{Z0M-t;ec=wcxWs-Yk7!MZe^h1R!2XnnHo)^}xiAj&xtdKRQ$;p05Yv8<VMlOBRdO
zI~B`@6ntCP6A>9DWn$PEn<#4IL{sP~mK3}vX@?J*w(4cwz$Qe<v1I>(;Q7+}n+~1^
z*1lYrX<lwsxOvA+Xx1Tc{50GpNA-N;%E%ME$3XI1C&IS}-NcV3EF&o-A4~Pq=#X#a
zSRWYfTi&fj#e|tcja8$$+AP&0j$G^|k}>pg`P<n`qx%KTs^f4=Q~O-3oCku%v1!C{
zdYL;?{}yk<jh5H&gReQn7w?W1P)~J*DkR?D59-0olxEUaMNJ>J+-A8c-z@<$<B@9Q
zDOq$#h=hR1oRRlvYCH(%9e`sOS110oQ|GZJSmICRn;m=fRb<99%PE{vr(PjvUSwyH
zy;5mloOKzqpZByr^qe6%tTB_A?c$|)CTuC9UoR|Z?gBF)R~)<jQa@pHK+^!g3P2Ts
zt$h_5{nYkqlMPIpLx)@=R2OcfqV;MCr+dXkFGh?6fdUee@0`VmKrZF6t}m}SEK)nO
z^f1^zs@m+fbueN`@I(@`iU3Ok%8@1<+9W7q8kh5iom_)m8qXw;e)Skw;+9#PY4c3V
z^ebQGiX9jxukJ0&E%naWS~qIJR`r|lAFLM-EH-Wc&I$(D#J3Y~M}w4HR#tx6R_$S~
zy`^p^8&nxw<eS>JOLvgR=jEUBr-@0`_Vw3BkoRZsT$hAzpKAP{zgzrAiTMkq@tyv%
zp#vX1Dv-xhJnNByu~>gul6mbx**eavOOn9!y_7`nE4F_%>TuQCO934BSVKL&;;IH}
z`VS*3W!zNBMCFNWuO`u4)E`vwA4bIHoM2);i^YfzZRq>$H{ZW9ZkJggHDx3R_Mk7H
zXNM6wZ9pPYC`(`^Hi2=mzbt{Wf87qgr+w#URVXY<8k2dGH~sbu|KxIL$<jLZ&U|un
z2jc#7_%WFz+_~rfWgpOs(7IVi6iM^`5-(aK{Gmkcwy|HJK8L!pe=*LSBe!abMm;x~
zICTB9$^YGYS^0v-S$41Rg#7E3+A5#e+Jrj*=45>O0>H^Sow=VEU7}RF+g(|5CkWPL
zc26mdy5OI@%gneAFtKSTj*9c;qcn6WPkB(mYY;&`?3ardC+<iQ74Wo^+-8^&Og+mm
zKHUg}g|MsQE2!Y`eB^t#*Y2LB+uOPSfK$-xK<iJ^-~cCpum&$mYC?+Gd==rFIr@=5
zzE1P`buHW(eq6=sloG}=?5){LCl?w|`bmJD5<nNiC*Y7NnS1}9#bYNefTfrJ&HCm?
zA`2I<txle0LQ-TnbxkQZhHu<lWF5<vLx}6NTxZYE+{_Oi4f+<-neMld0b>_p^wGmc
zc>-b=N+g{e&ugk*Z=NzHoDYMG$gneg9Twq5pN$U^*fE-qUXy{1eK-8Mstm`&&Jc&?
z=K$FH#bb4gP{X+sdSDn#6BDD8*DW<S(4P{&qOojX_kkZ;qy54pd)GU8)<s}kVhB}p
z!s`uE5h<9X2mZ6dCE31#BU%|%;+&qR##Rj?Afy_WOpO2aAb6Wd8CO)E?8GlXA(A{M
zyN{!rO?g+6LZ_@(Bd+!U!eil<Z21UU<D(^nuv0v<VLWqy>M>`ufXzAvHpLmBoKU_<
zqHtQnZ=y@?RRLw5kCo36?wV@k7#iL3#=38il)ggCq%$_OG?BXxmCBkB{3bqP&NIX}
zbgchX+ypexdFWiS()QU$WRa?|-=V)L(f6>56mL=mZ?+L{!#35Uh@UjuZo>AAF`@2o
zod(We9`#_O>oJ?4fj9ui?9c3rWiLQ!7yC!eWY4m`(1%(iE+XuO^;=9G7opba-Z|6C
z`T}gR&~9S;0B7BQJ*H6UE@)$O>g8aQtADQUv}H?{a=R0ejW{_$j0JS8hDv19AgMf9
zj%p)4^Ogp@E6N|wwtD7+$#_l{C8bkNq7yGV;yjQXN9*>{rK{!zr=>dqBlvTa1)N+X
zUf`}>O9)eYy}f9<;_by5bJ3XJRxIuLr=5-(BJa~W0H+TmS4WsQM(`a9CM{h;#I9W%
z?Rbw~so8f|g@2pUHhOxtM^WP)4R5+<{yXBVcbIR}&&l&`_0yY%k}}$7MHol;I+mx<
z0*{q7j;ReRrCM&38cBdvTw|guAwmmzNc+s?UliWHxqfS+hVE>mJv1iQ*=sAY8utg!
z1~^Jd&r-xY%|(3;!Y(zh8Fy9{&zAX%gE3h>lGP*ECynSdkJs<mRrR{T%=8PYimYUv
z>xxouqo1p={m8g^k2a*qDLYMH%7aq17Zweb3E!a8`0I`O!(a=Su4)qV>IjHHJRoe|
z+FZTBzyiAyF$H~SSW>pBSYCLRE+(?M#c}<J<|hIw<SCl|Po3HC;Y0Q-c>LY4V9k-r
z-vtnpN31#x(~0Oza)I<dbw+2K>767W5bZchSTp)L-+CD&Yz1PnS;dZ&pDF94n5%s?
z<5bT{TPsyBe>qD*HLK1-=oFLFUEA?AcSP75tv4`9YhqE)tv;>SFS%-Kr7-*}q~EH!
z@jJUsP+RGV-%YPv*{A^GOJ82W>#X`gTbbRQ`|#yyI!^i-cN5en{(N2a>`UgURb}Bo
z0pA8(kHv>dko6Z&Q!9HOpArtlj=j$K+OTCH&zb{9M<7h#hqBn$A^W`IO4tQKvY0rE
z1kV$ept$#I+@p#W8Lr^#=bNFAW*cnW8x!+YsRR_BIWjQghG_c|X#j)1D9x4!G5L9T
zuuv4tH`>~|hLacn+{*pUs$ds;5A=(R{=}uKvPJBw9dxtAZ=~`|_d9#si^+K0tm~We
zAg(fToN7<x=PJ-jT6L2O)3`_WFpq8WpT86%ya^)3-uOPW!><!<MJ-mjeZ<h)5m8(%
zgM7b6U!qF>c9j1GUBYWP8)7%AiLZG*GI=;zRDsC}!ED)54X-FCYaCQ2j7A7%LO8|t
z=pd(+&e=kdo~jb;;A1JnO0WyFrrsu<i%HZd_tV@)2oGV8X)w6xIPSTi55Q|9jyl}n
zQaL$Jsy5oWcNVGxAM+GL#KeHCWLOZF$R((dm?K`AN57q}deYL%$<xVlo&?K|TBIb!
zSZ@ZTHK6i4<0&{?x>=lYLOh&wGYGG8oLhu5%CVf^WzH?Yq^*%~sCfuNt#rp>>?wBm
zvxj>YZn~vWc67G&hwRFXJelr$CFhP7dER@j&LL<Ers<-hVtV2`6*Z=0`7<ENTV3mT
ztc{f^LlDc;FU5BC=qyiI1VF0R9V6}&I}IaN-=~tpmG*=p3kOa~f{+(eiZLKLW-Yz;
z6=M3;86}P3Pf>~r>Sn_RthO%9BEac~uUi><`{HLjXpAFhi`KU>Dj^ANE0nY$Ox?Li
zpo}sYGAqYc<+p<G#AO<u6EipFKs<)H&hb$vDPK^v<wagC&?m0P)SLR=n<*us*Ku)#
zgcvx_fPuURu{d4r)fw6ZgrfMBL&ir%rKcAS3;R3O&`@KQMHbVoJ1Y7&^{O4u<Eld{
zoJNWHhfRS%9!fLeT_{GNz7*a>KXp)qwu@52oV|R|MzMkVDIZFPXUfJz{zlK=-EYMW
z@PlmjKMch<#h@MVN}T)+<MUvQdRm-x11ews`ipk0Qa5R-wK3LJA9}}V1F{zjTDn35
zprhzu<LLp^IJQgW`$09bmrjPXkUqo0<hQ{*`W-pNd`uslQN|-#aaoAiO8@nN{>%vs
ztcC{FgKY3V7%D|4q@jB509}@zoW{);j*<$xu-3oZadO#n&V4Vg4R$EEQhM^>OPR%I
zXuSO!k~jO?E9_6La~%CAhI;ca)Ct|>#hX65J6|rcPrT(K5d;YyQm%GGwrCTf_FH4`
z`$rH-crnTUyB5KP4RHL;r?W2bW21@4`d}$DIHxlb3)6@j>^VhI6fYat1W|@6i~UWb
zkh`=40*n43^5gsq&JR}yjtm6@VHqYrHgm)!Z{AyUiM2fmB*5X+ompi?(%Hq?yKvFX
z;osI%gUs)s0O-JSSj+)XIBw$xbht0{8z&hb5iEx{aU)%TIPj~S+tgZc-n8mhy%pIg
z`FjTEp-tB2FwD-O9!;%eN!B=wsMna>+O{Z#g`h(Q33`X%fC4X6bJ^3J*SR;hh7qP4
zE>=si%_;?T9J4ug%Ymxa8Lq%%+ye7dACE2-b+At<8baJz?U2-#n@Z+%Wk55TQI^`g
z<hE1t_%i!!*EgxLaBB2bd&XW;U$}}RE^f=QOe=nLMS24E4>TTS=GCxIWNUQx9w8MW
z+p$csh7+Y&d71Rs>B^e>V%X^GfLr>~4?=a&mz^jaYfVxxP+D(WomE>Ujpyo)@hII%
z4%@vsZTKS;U!%{+<~b#@aXHjR=k?6Ji*_C};OEw0;gNWGdM>oIsM@)(v~|AEcsu%6
zJb0AM+M?Z*hhiv3D=E$=3=2;~Rn3X!hT{%D9Q&f#<TbR5UDm&91z=Rakf}hFri14G
z!HZ;WU$09h2xpAbQ??oX=HJPYBBZ<1HXz|x_HQ59^|&O4E8%$?F5)W5T-MMgcAQ*W
z(-;SuegZMWv&c65TbU~$5=xtgxq>g6YvIW6A)^97NV$rk$s8(d9|1N7(z*Lg(Jw<Y
z2{>uHgkSHnp0)|U`ZdR}Cwl+x3f$9(kZWb_Wd`qXox519ieoj(Xgsi=n8#EBt?dc6
zQHl-QKB+$u0_r&b-XYbzJuQ^1c#bhq9gAl?sDb7>B-R0bmH+~?TLpX^A7HqWoKx8#
zDqiitBl41?Tmay_u9hq{a-44Hj`v#f<n|GMtG-LIQuz(&1C??5KK9Q=Q}-x@A`ksR
z$5}IWZv+VLBDe3K?4uqBmwTI*Wdw{_CCHLqjdRB3x{Euv0R#cLAwriT3eWQBE$o3f
zBd+p8MbIHitV88lC5Da*V#c(J8nSxu=prE5uUKu)SyMnzu$5&^bp&p;!3=NHI}~Bu
zcA3R*<LS6h=k_+vkypF3&S%w-^<!h7s=?#$`%pPmf!N_WP;tr;CZqyIjL^CgrnP+>
zP9@~FiMU-%>f@@?FczAQ94^~&&gQZHe4QmV(ifFJc4h*~r)vgqRoSn2+erFm=0zO8
zC94g;5xC>wNfk<S7#NjSdTi(|f`LESjb;mtiPDoew*oO6z86}_21L)dZ>03-w+tWr
zj3#1Lt`Im9vw7PHMzx4j1Ms81@6GG!_4<Es^Ame46)}byc@xaU2<6#ulhZV06u0Ca
zBz|&wWZR_t#-WrZrITgg?AjAJkPrWqNej93ofT+;rfrWoHq?(KX?~m5BeNak1Ri^0
ze>n6$#3#<W66PkKo&|3fzm$pMzV%||8>w^csRY$Qg}D5s-(i={$721T2a#KIW~jr9
z<@2@&u0b$s>BQO)>PEUGva^T&IKL<0gOgkDZ*!mUhsws>WoPtn&i-X{xE?=3oo%-d
zf60t1F3YdWB?j?>ufZyN$$ap`MK{wLCdXsuxTv?FF;L-Fs#>p>r@wHVj1_=be4u#G
z{EsHG$W~$`P@bxbNX2x<RuVc3h4ct?b$Qj#Q3ByP$*{&}Ta*ln*EQJ+-jk{1HJm3`
zGYuNetsD~NGc%%+@djt}t<Zxu3aF#ehPX?+UkyLHL(WY5hpbMCeH@TwEXNqbLhZa!
zD?4kSGoy3x@~%VTLh9{z_>vWCU0hFJ$aE8@Vv^b^N%p((z@8-+MKKt&<Aw|)1}w)I
zqPPqtfZw7hr3Wton_n{2voSj684Q;RRPA?t3`<0RVEE!s3ZEtwj=MuO`T$`Uh?pIM
zIxn^^>B7@L42_n{Mt0lS{kochzEqE2b_F%{M$$|HVy^3|&IZC9mJU`mg^fjdq65bv
zz+RMnOh~F#3}H`>e)jl5O*v!zVFe2-8qVWhu6P`!e7$BG)eHn@FLR8CuZ}C9G+iv`
z?GCUrJZq-ITUoQv?>?FH555rFW2n%)_+cW7)Z4?{Emycx?bfoKJo?#a`H|&gQrQM$
z+A}*d!xZZh`%`&`cp}$`BgY3X_-^dGvGOqrhgJ&GjiwqV+<}9MVhsoXva=P7bB3Z>
zwxb5}kE{Hx`!-@_oL0#SJ`EE;7;9X}&+fS-U=22-j7w8mcedwD6T98~i8lsfjz#b6
z+hp}FsCiUNyIj}OZ9IHRAsL8+5RIev7XF9h-igRo!7N#QTMR>1cwg2trC=SDz9VvL
zGP^xdt(DB(pC_u;jWhAH{ZyRP>ViT@8Qvp}Go9bs(=Sv|L*E8)5`B7rSi0$eyb5E-
zKC37XS$qF1FlM8kIKfd~DtwFaP|Ohk4q9-{&XO=xS|z;4@CIdsnon=6IJF!+F;p~%
zudBM!t!jvhHs*~)r~5tghv}5{%RAsc#y=GQNWX5=5Bn|F)~LoADro-HbE*U=aoZeH
zzDg-H=%(@+&G$R2QPF(MY=+-BG(EEry&)os|LNTlC%*aQULKCEo`tK+n#OU$kdBl_
z(!%(hpmz$PLS^Y|eKGgf%jH|}h!5UdPx0a6s(m?uO5U~hbNxDZN6tk=DEO>JOrvtl
z#UeduBYBmxFq<D8dk@GLRxxilGD$1ku9@!{t8*#G%}~wpuHP+<musr~B3b&a!5Be6
zYLSHNyrDU^W;-!)WWe8tMd>4)+O&<UU8pB!BA*Fe8P~hxUp7qX8I_n8FrVBo)^)9M
zeua3q;2U1B+uW(&&qGCkD-|l0eI!I5<?Ivlqx?347^q-g^Dn!!>SwHf#-YHtlW)lF
z4lIrI)Wt4n9{EioDRzsNdoSfczSdD<ckzv5nNtAVpPsvrP~@Q&GO6~y``1p~UAv(v
zenP>@oY0s?ZG3DmL7IhxgXb?EHU6K_ow0o?vFv2^VPnC8HQ?XBf~G;6h1cf1fTW4K
z>Zb3n2~oT%3cOGq!=Q!3<8J>?+v^5%^hB`#Fgz0*ZvJ&c0yM21l!m={0yTcfzk4L<
z6nOX#<K6_4l|WL$L;n)M=$66wAI2&E0lv!pz`y@<W5$CQ-bSkwPWr}jw{5z2Pylj<
z&Aa=|f?oPLB0ICG13Y)J41|ax(U^SL2q~hi6}Rw+%+<N3#F>;}!s>}7P`v??X4IR+
zY1FW1@q;dPaa!NRek}A-2=Mz~6f&mwy<0$zNmGvNyFI<3mY5vZSlW0enWtBh@S$Nf
zjeW`Mc3G)9RLunHb41|yS&lcrpT(zP0LMgdbT3&XrH!XeZ#+^{g*OD9-p01?RLJe-
zFre}$vN#w0pyZKjBd2o;ki@5ZKvEQlsBj*_gYvY@CvTnQs2<p(Qr}NoQv$+5O&}5a
zzBe0`l0F~g#X>q+b&Z5MZQ}a~<$!5kNl}*E+udTEBHs=7l2X9<3K2Cvr&8%0NBd>s
z1*t86;=0k9QNELLcfC6er^e-t6UY{=W*=SDw@oj(6htytAkUT78JuICp87Va4@Wk(
zA-H}SoYVCi-zUpwcBWDPk~UsBnM>TXq{c;d<XA+*^eOe-{K$e5V8XIH!|C%|VZvua
zTTSN3)p5}!6ZvB`X8#!YdLXFcNKr6`U|?RN>RXL<r}tZgZld(<(cHj%-+6#w5XEVl
z=$|@=-%4VAv3s$BuuIj0sI3{KPGx9YZeKv%C9w>sls!f*{Km{W-l~=;N4{`~hzV3N
z?G(D=j!KM1+g8Td6_)qV=TZufxltY(E7x=TYtVD}tB%kaz53raiRr?VaZL=2@Z=wA
z;GYJ}&$EL<|A!hv|FmDEekG&ei-dUzB?RRhH~-K{Ix?bT4mIY{)tZiQJSY49)$E0{
z6(cPt9ymfTSJBd>If3g)tjreua`{1yQjHyc!|GboG&oecKFGIp%6*OR;U28?4cq(O
zBC7_+Zumm9GT#lSs-rQq(pC4V(sp`are<yLYXrw-<{5y+QhOXlKGR_T%SWmBes80x
zJW;ntO&0qAYt(@y&*7BUaE*t@0~*D0$$_%EH?MjQYGa<f&mJn%5F~g-*<_@$ctS#Z
ztqFX!59_Y^Q*E51KCR-n_zWD12K|A|be_&r#IKh;m)Xe-vW9anSBBnXmiSzWJ;Kvv
z4QQ4v>H=Dz-yObLb9u+a#Xpv0i^T?`v+0M~N$<<U%VY9nL`}w_ohkpUzB?jWkVC!z
zPT;z#;})^>Zu?KVA0lvdLI8$T$k#P50Ed<YIZwM*5niRXWf#&Y!xTW#RSn>TQF29C
z1t!~{;bs++QHH5Jxc&W0K7?%u=cgizn3$;~L~<l`NN;h`=AJDzU^SE{&8QyIwMW|;
z$863f3LP+6_~vP)f<O=YkQ=_cX2zsV+wvPdiaI%B-}gY}sK<OBe2IBpcP*cJiEwci
zYZulttmW!Y)pA#64Q6rseU%L*hiWm*mB~3$q+Ktl7C4sw!+1>!)86&-TRh)u@Q|o{
z<B^4?+p=bw{u<+LoT}`L$%G}@`?WtZnt*iiXY#D{O3$bm;aO$o+wCrE?(a5=2F)Be
zIjK4pBXRc2ow5yhtUOKCAJ#sRRez3QCQ0a9QvRdL*wFlsVTeOgks9bZJFrLMpFr}5
zA?vZ|zLpqr;upuQ`J&7zzJnM3M+aTjqx*>_Y@?YsFEIcAfId~?DYmOEhhWY5^PyjI
zZj*K99fJ;rCME<q4D=t8ejLGMzNitD7UV`$HbqU<n{;-z36(G=;^~WBwPp=DHI5u4
zV9Bb|eZn>96^x3ioe79}^YR08P5nV)@mg<&W<5g4kw>=&CX6YfVr+zztdNoSqQ${H
zCl;nCd0cbqT?C4}KCa@gbEhN{xz=IH9iO|3hs`Rly*CzF1(`Kkj1y6U(uG>(;bpu<
z)qG@t-{H$*o=3GJE>E&(P=rzCH^N2b*QpXG4b9WGxIqigj92hE@j_dT74^(}*8Dg&
zXM8DK!w1IF^>085`f%&WOJ?Y2s?guEuB^M$YS(7*F3;Vv*cvdx(+!TzEu*7MX}P3E
zj3Ni5X6&@m1NFtTuhbSl)#_NgCN34vnNaYH2-u6WEu#mEdT>6x0pry!3-UK8g^U=B
z%rO%ucd{7#hL4B{B10vpTd_x``tcww)(*WBwV1^s+Ndh|T085fS~?}39VcE=EIr0c
zHMBx6r#RK~nN%vemc|oUzV=pe`9)=c#hv-)KD=_4l-PUxt>WVm<{OJ>Nh;vP)g+tb
zz~_&ZeoaG1mC5>wJa-r{J@L#App2ttZjH?~eqI%+@xEj)nak{1N-|Ap(5R`VD2J~5
zINkWJ&3_oH<b;s7Pxt>}oZ~a4vTuJWFlfo5?!OA1Jxb0ZtPJnj0w+y*%<SEX>?N{`
z%6|2z;Gk)$J&y9=90WYTIXPDVlI_5=-7ZEBc=q>nO>Y#A)|wW`Xn3@!FzoVyF>RDF
zTHs6yYl0<NWwm_m{ZS;Y`0d9<!kJeyN(`tjO+mPOl?2Ga`p!^x&r3I_F)CCl-Yd+0
zAe-1cDth^Lx|P%UP@^|pr#|m)<mwLDHs}c%u6{&Lm(&GSKb8E7k<$#&^8JA?wNlg_
zwPY?%M>eJIhTpP>_-%LMeWi%jk8E()oao&6WgBk-n#9A*Y7d(DqgP{Z?SDq~4)_zP
zRMQlxRMzrtFh1BYz1908T9ld4RP4^ezIbsPLX`!J53v*2q0Ghe326ZjrzvDcLi_Ek
z%$=-Tj)*L<{)F3fQvsObNB+=7M^AI&hJ2k|61bO}L(!}FhKN!!k;ah5Qqkd@!gJ?l
zr*@<Fecwpull+EMHUKJyo@K~U;mT9F7G0z3#xxD}!e#7kG^2;Thc>Ufs&m_HoI~vh
z%5VPaX)7A6#l)O?t-x8_>(NEU^sN$NbW+&6EAdnH6%Rs(hmwWGSxP5E;yaDTxCMqc
z>O|k`Bc0#tB8`7V3S9tVrJ;D!u7`qM@rZshJ6M<B36{Li9YjFL-9z2tT>APa8N7<T
z36%4X2qU5O;2S8@2|z9@YH+m!&&=InE%)R-N(~zRL5je$k!dvEq!w@aVBf>)b<d4m
zdzY^XNXWG3+!ju<fu8pEQO&n=>wqN1<ps?yd*;PFF&u7;JqM9X@+37G|C_h7_K7EX
zdNX<{f3aD1C&GMuV|@5tz2-BG&S0Q+qSSqm^H+L}G@jd35@$K)q6v6O>U<)tQkUok
zWf|qnD&@)+Qkvp-!~L_!9_J#V`fy24>4NNRM@YTISt})s@(cN!hP5>{O<a76(jPQG
z=VP{=YlvvYLB@uE=+3gDmR}uJCAF=)AepS3K3iItksHOur$hKpT=yYXj?@d!EYY&Y
zJ4)(ckvXL)Tzt}+^P)ui4PrAYJfAXfK=H`dOt&hT15iBNMa_BR%pq`zp3Z5B*3Yr8
zR)XD7@~g=2e<KaGMD|ei?pe-?>{F~FA{INl3<HoesLQ7jA<_%qE4X5M2MDVnWu=)6
z=e~gmEp?lU8r{r9k`s*#5`kJz0#lDJ*0?n{5mJXglc5S-Tz*7hp6b2gcH!&iOWabD
zu#VIZ)KD*p0*S5TR!ud$Y{cRjiYWS!nqH!`znk$aPMl1KHXNgbFqx9^p88Zd>_*Xl
zY160pE1uGJh<+Kg3iDc>EtkvXE^q3n%G+AOseOp+_k8RGrhp)G>^h?w<}Rvu$@079
z^!E6`VK|jN4@^(rQ*kBY>kjE|A8OZd<1Tx-TX7IpI^mA-rs^9hMjJ%Df3PUDbnKJ6
z>CY)<b+0#j`0+`x4j!+&1>}o-y6LT|;(N0Op*eR{Vyn3$4pXQy`3Kgx;zaM0+W2_P
zN}n%!7tJ}eD)m$x$jY4V48-2mlD%-;$0lQp1ClLjG_sXenB_tiG~ZdaS;}h?C6MFm
zk!Z6;+`E_B$De%Mulmk)K!bhQ>PUU!aLAyT^<mX?-)vAvMQM<)0`K0zCSSj0{Ao}Y
zv6}$t*&G)pYeFz&H6Zx9rXMr{@Q)jf8dEqVpVjZQ?g>=GPdRO#W!=!_kFWQ=Xdn>9
zu~y-<s7@MSYr9*8)qI5rI4dyGm>Rl#mIVC_uW<$gmssup>7;)o7{SFs><N!?zuq`&
zbY$WiPCf0a{k-D-DXpAo=z3F<US-g^p{_t`Cbd}<i#`7~f6BtC44i|0Jo(~jIGJ-P
zO*j1Dth-jnO3RIro03}=E0E|X-q4-hN^e|_gYinTsRdK9^}-8;G=0H=j4S3GhlZu6
z6Fut=PS=ziXIpYz40?zu@%T1M9Q|^NubwFR=bP%x?v71PyJxRq=v}mpgYgR2ds7+X
zuVl3E=wJJpQ46ON^-G>;+!~A=M;dQ%)<2R=n_s;I5aG*>BN^lH^i=x`MJlcx^tR5&
zC5>fXSyqSrkv53gU?GR8#iskOW|v2n4%A|}d8r#;sTm6RpVgGvI=FScF8Zb^=zLQ6
zh|T~8>JU6qm*>JLlEpHteZbH9@MG$H7d!Ocl7<9hJ#zrk{ku>;ARf2)PAQVu3s5kg
zUn+2K8O}quY^&T1%^_Fu`-8JuVcgXJJB(23ODzO217D6T9N{J{{Ml>PLFQP#7bq>;
zn@Y!r(k3+O?H^;s3h6X);HpDvKPHvdE>^34D(_|Dk|9G%vaK0t_wp8KkD4cX*>W`I
z;bn?C>_Fo4jB*4`G@^-VU-g?+@9=AK=g_KlFbpzhz7wtu2>#e+AOR&fomle{#i#w1
za@E7I<r@E|G?-~#f_&5t8w;l=_RPZ7l1rK1v90n51Uj-aZR@CpFh+`O+elbBCa=5v
zg)~VG83`|6mVQ^kL)qyf9q~2#WtIZ!1Pk=^?z3xKIre*|$(!zUGE4*6^~>!YO>mrD
zp<UREt7vJg_AcfKfoOv+sQUf}nM$|Xqo45X-?8+Swafj5c1Y(*@XV-hpU>XRl>Wt?
z#O+K7Hz_NHE{l(WpSc+MjqRqz?0{0PYdF7x&i$~}n$Pcz<YFVpn<f>riFZheH%MCt
z>}(29^p<xCo!5I<^1mw%e6_eiy%}rXkKRAW)%D(z_eTt_{o!2G#m8CWRE7_OB1IlA
z!Fk}OOEJLN-j_r@pyJTwy)5Ry9jCBqw{1aI+-D1SSMuans+LmAzAw=WF8_0nZZSP|
zUY`|Wzmw$EHBXf+Q?(o(xbU-0Y`E%fAa^~Fl#T}to6oKN`f&XT%3apbv^b!EL@Oz@
zQNGOea>+Q5`KSh-|5qemAXQ{5Imt{L+69~=3dsGwnv8G8M=Pp3&Z)I!QrS6@1^*Jp
z22n~k9+X<DVKpIOQ-Buxm&+1TVs#6_;*(a|<_{=@`)jZ$PuuHi9=Nd-<k&6X14(--
z!0WyOh(F*#c^Ib}Yq#csM?zL)7CvByBplXDA-`-f;!U)1Q=i#1Aj8&<xLSpm!(R>D
z5oWz))l*ijDr;{q%Y9yImoEH+1nu$?U(>?RQ}JLsnw((YY1xIT*6O25Cx{)80Q#s{
z;c2}1f4n!<D!&aWbSUTFDN7nTZg^AP1`~&GV97Wc{pKz1mUQG;;uLZJk-T&HvY1=)
zLMn|CV0ce!F>agUu8D<U;G8&rD?GmAwr!BqW%Ihv9@2ouN$r8shV4jvKw|@<t31ZX
zJAa771@X@Wa(h(SBOOIRd&$!;HbTXUxyGXfOnv6Nc~7f@`ZTcP9zkZlANV_GSOxXI
zL#>Maxg~6OzQ!HGhohxtnj`b7tkJ=L6+6gqp6B!Nskh919&P)<M#O&hydFoY4!(S@
zC5vxRrNwL5B_G7|eB!c*z8Yq7d7b+Lh@!*^cR0e@4Q-NpJ$0Fd^0qr>@R&kGBH~~a
zGrmG@zN7*PdfL>&b?2ZD%t3=>HVPfuFn8BazC_%jco8AnsjjCalrsWTA7Y|^Fntat
z^?g71ZXSUPSP9mu%h1tMy<L=8GI6zG6&u7AB5|!fDdhK=$YLshvf_?%qiJy|3LLkF
zKh**e#)e!cp)HGgk!$H439~J|$JYBtpPquWU&zk||L-v39=w-^#Cp+y8+}B=ATnZ^
zG$x5i)Sc?c=++)65L%p5Qy&Uw?|Qdix4u0E&U_;3x02DnJDJ-!YU2$2<e|g0Qz*t8
zqk-2fz#HNxdzK~pg}w@=ZI{5e_QNLq<A$8U%mRve?Wb?6^Q!V$5h8V#%)0sSbZtQI
zM8qaLlaq3A<g>G+VR@O~<vql3_sX=6fh#dj17%JC1P~MKK-tFOYr2?Z)eqqm<U_iy
z1yLr!TvgYvUZXd1FRz8b+ch^Fc%POWPB6!Qj_Bp`W!Z@rb-C~MJ1|R2a>-q`m47pe
z!-;R$LVQdY8wuL{tvWOb+#IUt*fl*ATA}lKU<G%7plPZZw=-5sz#L~h(ZMVezsmE`
zgefWdXXm)i(wPvH#uLgMKC+!rdZVFNJx?bMtBlPf6-|O-t3k;(KbvBR=~Ai$s#V_o
zyWsoIeYUppr!;z|ZW46T20W>VRRPpaqtfV$Q~IY2Q3D5`issj-g$Kp>ODE8ZFf|BE
zvZ+|a1)jH{gzue4h%r&H2WXM6a;G7v*v;&p%9ab)awK6F2a@{Xw-XTX@NMetb2?4J
zc+<1JQ(dCnVSzcWk5&pM^=9t6jWH2Xn~pC(MR$`7t$n!FhF1;yfCEi6S#!KaB}*eg
zC%elbNH`UMBkK8}VuLZmFnC0f3IN~Fqct2$8KVC6Bbm>s4Z;F`(D0|7T;tNHdj5kx
zEnrZUK>IX%>uqDKwiH6R0J&lgY7psEvyQRt%yP%(*|*zs8~4A}8ag#sP#!CzQ6Up`
zwR#%rnVFj-v=&zgUmHyxhK{0eMtUSSrV8wrc+|s(8=u#rY%`t{U9LPaS&o~y5rFrv
zK})*)l;<D*!|;&nB-?>bpomm}Y8^pL5p3z`0ush<n^8hVfE;w!J7Nb}-3Di`PJhGe
zzOj-FSM*v7;o>9;i_S_@<G%}iDRRL5SZdp6za#G8P%0%TKF<Ij=A%?emVXx9W-r=k
zE3)fy(z?fA4L_tGsl;5&PGGHD+C+2q@78yJ?ho5-CE3O`60Q_pX@0Cnr7`8*C9bcg
zb@UmOhplqI011jRCwz1EFL5Xw+jv&<IVy_7+M)d&@~BN}BH>lYIcamk*lM{)BP9Hc
z3hE3#nnzrlqE36YI~o=M9=g?4gkb`LTYj@wcrA;;2J9c9n9SBgF{Z}o;1^Kd6DW5&
zEtdfWl$z1d#>q3s4*3(YVlNkaK{afwYB5&eQ~0D=WA65o>`Q_x1KV(SxL;V0Sg%U`
zYTa9@Jv&ePMNSXA^jSUBqi|UlD^{7)M}}xJl}{eq>_rv=?g!Jg<&h|xpB=sj5dwW=
zs5Swmm1-&d;*Jc(nN8b&PR5NMn$Jokm&bu4*NW+4DV`do&s%biHlqE$YzMc*UGmHf
zY%^_eWpSUydsMFI#daA=7vu{i&4ixCPF!#P{cXHHDcgqC>%9jm6Pz99zmNMX#zvs6
zYVurzu?&5Ty2Qh4s`Jnp%;)Mkq-B%7##jq(Pf(nDZ!;wwsTN0mM(=d`O>I&yz?@E9
z_dg5?HkE6PLf5_jgE_}dKXnm}&Z;c9j2k?93kk=sT?y$dlT<$ylU7h_;`5FBA#!|+
z{B2Ix*Z1!tApS0rdE9PcWF@8pv3PQdqxfe69hS4qW@|@O<tYS1)q7qPXDEz^Kf!c*
z_VFXK<D*8GWj8W9`+KsGs<AdW9lq+IX91`fcc0;~O|4?*c-)XI?jUY&k957_&0!9=
zUgVV`ce82ho#{Z*KJ?4f+cjK-@FR&3hZS1YN9AIPNuS@i4EE;3f5&)4#Uh@kv0$c^
z3d|fhonP&d$j3IsL(oO*4dH{$nZ4G4Ti}ef^VTCOVJ}Z4?pv*wx+G%fAItG;O=r3e
zYF|W`u!OezXnAQ{c)2}acgXs>jayVv7X6V#X`r7}P>M0G2hJYIJ|)b6`bu4vJKLC9
z*}r)HnQ5@%D9b9F8I7(W8aXsdmPe=mYGR$N$AsF@WfPqZE)3H^^;Dz&CBMb9Qt$b*
z;2iD{wq=osPoLp`Z&k%?q)C9_zObRCNzk0U?xiC|VRx^5mV9mTJ333bJqmbqv3=l(
z^<Z+IToql0=T>^txr^JdsDa+dJ7`konYdwhdu|s`L+z{Bz4Ns}IHorK#75;eV%ZGH
z_?xKA_^1D`v$Kqf!t2)fAkqRN0t!fobi)iC0@B?L0#XvvEg=m8lG2?+58cuX9Ygmp
zz(`3-!=3l8yWanOKi#$N$FtV?ywBeIJkRsP0@hr7nBd|W^Zb6m4(U!$)lx7OM#Mh?
zMm-EZwaTt*Y(dp|4Hj>ks9%veQHo3jEA&dJOut#h2f-2=4WC&C*7aadK22~*p8sBd
zM9l8gv)K?8^wg0pL;tFnW=R0TH(*VOjSwurgzU4tf@aINbOhq@=&v)+%bem8(2vvi
zC3w=SFj4bXtcD>9Fu{;ad*9U!Tjnd|mQ~dWRU7LsfF9n{m~5M8<8RJ}J}$;=?WpSl
z_1s1CEetMgCdIZvz|oS>X^{m&@W9c!CU<G(mpX5Z67C%B4@9Elydr<9+O?~ETNx-t
z=o#56t%5b7b}TI5v`o4hSYj^3P*gFK`rV&qegKK1wa^g@2cBNk-v#6MWd&hoE#&94
z_JWJ4gk0_6mSA4K{LDKJ0;*P&ilvy}glA1LZsK%aHH=XOz0j4g4|t|gYZoCLs^kb|
zH6E(O$sb?oU8B|>I=YW45Fu$C9id|ONE#A*o~}4ZT$m&?1!ovBQR3s5e5zx&Bz|<J
zHHp2<8~H#N8akIj&?vD52$!bM#CBEb=QFh;bDOe(P4g7BB2Vg4lt%q%KAcz+mZ~re
zD21K2U$D?RWi)4l7joT-Z~4=7hWnFxwxKo4-uX;vuZFR}HFfbynU4F_z7~$w6c}1{
z*c2`tD&5v2tlJ*e6z7O^_39+pHeVe@H@zJrprcz+i09qN#3ynjg_UV~=C_k%Ry}|K
z%^vnnky5*i<6crw+nso8j}Wq+n=B3N!oT{lsrqH9jn(p*QlYJ8M42s{$;#2}(*27w
zoq@S54nPZ|<@1$E7!_?`-0io4KE{#f-`^N_CB)4w#{V53(7}Be+B^$BCN;RVbav>B
z(978@VnjJl+1}<`?WB#<7U~(H7e^RVJ_y{T&H5(M;uQW93ibZ&pjziw{pSVcDJk#$
zFqdKm(N9e!Oe`9Kqc11t(6;Puo2VT4>Gm(xSFS5XJdZ>U1k<sp7@T%u?>Da8a9eFf
zbaY04`ANvuDGn=_x!=8io)Ko%Y}wKB1ac%%s{>kEWf!p>Ualu<Q-<|OLj>CdLRK`a
zt<}H`{kio5R%AFqcD4|;<T))&5$?6$TTrcvKdi;{Rd(M(2HP!zE;Msiu)uk-u=*1i
z3bK8mPFV<DZP(x0OGQsNsd{U;*0lEdbBYH{7T)*~v_GreMT|>&>Bzp>e5%GH^g4si
zlUlp*#tND{weo_udxMW*E68Y7NYF+~*qAB4q{q_$Z#XQW$3V{2+r?nPgLVy6tK{d4
zMa9f?A$N>EROFbEWWtlg4#7sZaLNi=OxIurzZIUIsl`dw=jG+OlT^2}boh%Sly2YT
zXQ4uupauV-6$E2RchkV2H-~euffvdpn$^9Uo8R|wg3)M@xw{SdM^5Nzd|KkqORUB@
z#D|HK`G6Gc=bmHiky^6KifhCBTz2l+cj|+3Tj=F6a}50IqKY(Tz9@P!(81lN)`RMr
zTS<Br5-m#>#&?Y2P-IiKEG;us#euQnoz0X`nY+a8I(qQK<PhUP^?m6}7nQp+VWy3#
zR!AamP%<LHjY?6RtbbGjcHXzUIPHQI0;?26nyae=XVjNFgao&Yx@J+Cp{=qn<fjou
z{3_~%coS-Y&Q-MBsx<bw>r#0NWN7`a9kp$m__#N7YQIblP24QJQ5YjZOTW`r`8S>d
zD@m(%>!OM|%q<HpXlmqGfNath4B=vaA>JHN{v0R<-=+pfMg&yCU4u(lVc|jO`9l#i
z$H*D2F!AG);jeCkt5&9>8g=sOtl0ENT~B?otH7n7AUpBBbYJKEi?kM3nd`ZKx(fkX
z@G-|z9|6<EV|IGWKmZoKX`~gLSSTgacs_pjJrLlm_)2k!@|V4I52EC*rvnAMl};xp
z*RHm(brnN#o=V1Uba>>3mW36+xMS0$w>snV2CSUbP|kkCaaQ;>^vgmZu}+qE)+b6x
zz-EI;5(xK79Ib44wL=mn75;hJlrA*$Y;fd<!KlCPH8R;MojJka&=bSu5fJ~dD!%my
zC`c!AE;UFxnm{L{(5ukh{Q{SQ!}YJ*TPvS&fCaa_Y?n0%LObnJ293(Cqgm@>Vv*l}
ze^NChmay})My5nL?E>69SLuMt6*8N))7qYapxptna$cvF492LxjZN<zVOl)tY)7zT
z%DHDVY43RCHq)TE?UMQViY<T9-(%4a>yWh%9Xd2zgOyu5aXoG)XtL#N^OctbLMKo8
z=tY&owPW~kNQXE3RphA_DCM5qutd~qBK}x<Z+2@K5K2Z&L|k)p`4-56(ZZ0)Ew6JV
zB`Np$knxKf&dBT}L`&8^2{Fo^4jroo<nM-klb>W;EarjwQvgb|qq0wp<X19Qb>NkL
zFHCio$JAMci^)Vc2qGGc`tNsix{UF##W~kTMq#5?neo+_q3+V3W~pAl=lpdlvqwFw
zNe9d69N088)Ynf~M&tklvT&h;q-2lLn;U8~Zrsn57{>~`PZ;@XI@1h7_i9GT!*TK~
z>Dk0E_l(ZcCPd^JT|&Efps`{%S?;#yw75V1$%v5KdMQiP^O+fy4|8~&o%>BJPb5UY
zgu^&4k*gEubZDA#rj%9f*#Uv==rmdWV4Khq<OXcDq*=a%xqC*?etrFCyWrC~?<<y9
zhOQsIOcS>EO#Fpg+AsM8>Fn*lzLcn$1>QmU1}6&(Ibs%#k={iI{$YCip?<2ha(xE_
zy;?8_{-?>Bh3?QnIi3~z702lccj3ddLID>1CHoBt6o6Y)c?Nd*BXz}3dAU^Th$7W-
zRdT}aRNnblC9(PB&Vlq?V)0iehj<>nrQ`i@yoz}cESbJi2;JiXCsWKGB9^rxqI9ZR
z6)mh7-j13hvzK4{z^^P{fU2qKSyEk}{Eg$PV=g(eLL2;bPbl@PvN)rLgrtOx)zc*>
zUb`cW+T*rFEvKrO_IiP1rkV1E2wR?efwXC+C$F$(fsxlab8>jD&LFeUi!VEYv+Rw-
zZsQ|ry`zhkJ0cTfZlb+vaFHmKzFR$)Oo$~*9nUj42ecc4$a&2OhHUKNYDt~RtFD<a
z#(0uWxpco>9j=A6WXaOA#xN-wvB~5aCbxf^i2W$XE)<J1*DjbFQh#sc&JGOwQxds;
zzR0dA8!AO*OY1AdjYvFWjx4cf8~r0OW-+VqTW?ojFB4hK1f_Z<yV+Vny@StetpV&v
z<oemj>#^(5Zpza}{0xE_r&0gz<IC+zQh-ghx&@0SYYd_bnLqHe8R)2-7)4+wRZl9?
zgECAMXL4u34AIOHd4j6a{4)Py>=5J+H;5ImQi1GLQ;nWWx^dT|59v$(Wih*4ceCmL
z(!2C^Fn+SAurOWx+g66V!FTsT?dc7)cMAmc<eZ!!ogTJ*H`e-d$CUA}OA}=V+90-c
znR@P`+}pm-TJ%3;DY89mT766^S}#G>&j$c@{AUVJS})0(n~#)-li3*Z^Wu*gP2Z`6
zgKrF&S(NYRoSpAUnhWR(i(+5ZyJop~Wdv;7M}u<FJ_>LO$0%pF(Fk$p`W(fXU+7W>
z9d=PM`&=v194+3-i_qo5wH=Z^?5~fhgEZfzcH}k(nf(H!WYa&B6zHX>fwyS<<>8`q
zwJY#WntL5;?zJuJEQMZ3w?@}9K;Y;}I3H-Lb}(<o#KkiV&d`RVtFwlO@!kbr2wgMc
zwwqe}VnxHbg}~+PFI5|5h6&6Cw>S4K_kKSDdZS1K&OkFGkAP(x>$Ux*JRR5;W=3r@
z2`D0eeDg$}E-OHB8QDH>XG@pcU%<^bH9}=BwDOQ*DrG|0B*vyd`Up5jqrN1`Nq7Xz
zHidn$k1+LG$`cjNqRGyY4-0YfLTJEveW$Vp@<iT^RQ@%ZZsTO)QK$Q2J`H3S4j!sn
z`@J`8#{I`)+EDKiz;!?8)#6_91xhZe+^w53mZ(0FaHzErIFJzo#qrb}wxDkugEB2X
z`@-f$H}MTqy9#3h;OJ&RR4@C=W+SEOnO`q|NqRubmmQ`lK~9d1D!wB=@+ugq40}4_
zSi7;Pk`%uQ3^Y-$4QkC&sH%Mg1a)p}A37kkd0{*{VJkttiJ#6pJ~*CW*z)5xBTB4y
z7}Jb--g`KsI3|KRm->Y)%M76<)_6>_6O_(7oLD1KlFaLx?CCrMtJg`kK9LmkQV?Dl
z{1xpJ%|Spjndc76r)4OEo$y}R%nWdhcP!9xt%%&e7Wa1sMRcYcWTK#VzfHnqSV3+i
z`=0Z-w%tgTromZ6^kjZUgS+EisnW*IKy)|3jqLQ=v9n-t1(ywv!2UgGmJl#T1NSBf
z{?;k@*BY@uZGDmU?GX@uMfLpEW%pq+x;G0({|&#{g{W>B0F(;=kOKrb^1d(#vNxUo
zhk^Egd@ZGA1tk^VA^D_o*o_4!JvR1>t=;BTwp0}wi_5%#D1IuV_MQn4(eO(3Q_g(2
zmoXo^5^X5~K$zF42R#T`hh<Uot7mdA`oSK)g>1PwUcEZlx{Li9aCmck5a7-=w{fD%
zBVA&=&|3UtPkxbWo%N36K5ojqQ}FjYF0BFNw&S78M3v9(MU$xO`U9v)6*M4)tmYsf
zr6HQNfY_rb4T+Vhg1NCQ?j{kiUmTQUoZb5J%ts?{+H|Q7MnyqdLK-8ax5FiJ`=J*E
zZp6}RW8Jlsb3eTn$*E>MnvK|U=anX*CNdU9mHAbIyS=NcT0fBT#|oIi6A3NL9PL(n
zwqY6usA`JH=w%gNc%~{IO%-0cQ%al&wbqrqJ46BaOjdvKX&;uJ59ayjaa^S_wom!n
z2}P3=*1MaKIb^T<D=K~F{Q9DVR-P&HfuaL9cY1u)#dN5WN6VESeDQX!3vPy0suLC{
zSWGEZ&r-tAiJBU>6*J76acn2cDS0t8d@>Cf@X6R2p;~)a619X_P^V<9+G<i)2|2jb
z^KZA!J`A=e5e5fU?}DeS<fV(PG6=w($N><=$xbnf$D|M}d`65AWGR|^i+S^P`bQV9
zOIFWkik&V%a4+x#JFU9iQ}>O5ELX&L7u#~<oeDRz7!FPw^yqpOExl2OUTy6uwivhA
zVaH`;fxFLlqj@8yR=&18HM<J!pEBQB*&MA3ZO63Tv|ygG!!w)I+G_4o1!NHWFa$E8
ztb#YQK*nXKg!Pa(PC8ow=u_ERPE^{igc^6s)LTsg;6|sY#NtcU&C_0m!4cMW$EjR=
z`=2F|v!G|88O_U3;iwNo<-(2im|;M|<b;_E7bD|AxdQa^6bvJXyf$4nT%MoxLm#F6
z^2)K{6`4gzMYW}}lwo|JfQ(1ivvr75g|&tUU%ovH`Cd~i>G+@C@A!%ic_LLE1o#hB
zy>xxawVeXtSi*gORH(|=W~L*^@epnhe`}{xN@6_u5!U$|PFX3%@EN}BSWGEA4?B$T
z9L-s-5SI6-tu)z$ZvbmvzwL_NK`{WWF=WTR|3MKc@3Ta1FOz&e>&&N@)uu{N5U;r|
zHbd@pd%kZ<5>+&oDd*XRQT1CQY6Gb$ntPyaLTaimonHLi?jy(5pn9J>wR9-Hoc(L6
z4K}wHqYhW={mI?3m4ypQyP6kX#+>hRhg8xF4NZx{#9xUKLBI;g-YR*(31qCP;xnHy
zZj~A3SY7|k3622Rkd9;iNimf?gup4&Sxh)3vo{>ryRT>gz=Mt?Naojn;NjIhL&X0v
z&fv4~w@u!WiCMdRu~lZ|gtA2xurv$rRQ-_(?QR8jyr6yfEEuu!(lbl<jj$faE+B?e
z*0mHWY+>daccG|duKr<pd(_J`Y9Qyi-}DP(#M}Xie8tVsREjQ4+!$JeO3<|pOW-){
z<UeT=2WC^qN10>7fG=RCN{cu)7Ym$<@(<J&$vPm7X?0-M``0U?m^s>o@Hu|y=)JcO
zxC|^~>?hM5vvpgozIaEPpA}l4)H!4F2zZu2Y?F)Jz5mtnyWhu;u13Ivg4HV9ww%Fn
z@n9}a;<j3AfQJDT-%w#89c;h`&=oN~Og`IvV0%VbhmK$AL2s;i=oP)V8jflCNqMCq
zI6%WuH&2ojB7Z7)*m#I7N&KJjBmdiU14u6KE#0s9Y+LXn=p%})n|!HEi^ZPvow<!Z
zOkux9nNUXjvURlVpwbd(33GwuFCn~#{KB>lI=;O$rRKky$q`S?+27WLtK?;(ij)XX
zlSgxar&=&kQS#*<p0+^$=-;zf4pfY2VUVnZx-heHzu2uQ@7G<uUT@TPr6Qn|vQ|Pg
za8XCG5!TI#L0NGG>P=4Mk!Pp+=s^>5&6Xl8fCcI`2eQiK)VR5w2;lBP;P?$_9l)l&
z+FimPXh}IOglEGLPKk}I+m9Z-nHfavw#5@{!)~NKrLR5NPj_C11V+C}AU6Nv5&x_p
zZI$(qmutr^x+UCM!JutakoAMh8!X9+Fo+ys==_&$VS4FL+DapS5d7d|?-`g6|7KOx
zS5A}+H>o`OXZon8Qg@`7FzC|PKaa(Q?|a~9<v{r{4NH%7pnXb8;kXC@p&d@t>hjYl
z>(dd%9!XG-)aH7Ee08e_QGDy|pu54u?8oS|Yi7)bcA_*+kuK~D>5{iRBPd$|iSrQp
zchsjxRlY*82?o0e&<t%c)!y4l&7Yn`U?l#?X*~hKyXz1MW1AO3B=(bg*<Qg)RxBuX
z!3OpkRT{!j#c;s;DYYH+#;EXyUPV)=sPaz6tB_17)%@D##IOUZP+i3k9j%2FPbKk}
z>0kK`wVFxT_}s?b#u08`pj49qgL2(^H{pm_9I7K_GF`2qzfG-ltexx<=ToBkM#Fmd
z>8YUbSoM$Vdk~|$ZmQlXeXN9-Aqk)0BK$L%I9V3cD=|w{x-jpV!QQtgK%Z~g#93%M
z@v{o#EK%1P7$U0ih=YMdvoUf}gI6ScIzmOgx?cL*ePHK6;|MO`i(M`~LY|JVWLB)c
z#oXOLxO34`SC)s^!31MdQ?q<ks)J=Vbtao1*J&rfRbG2AcLZE1PJFRys2x*#{>ikv
zoj}~5oCn>;D5lNtvj2_lQO5Ir=juMYk9zu*Y5yJgi?Mxj)Hi9qxLe#nuReE3g_T`-
zFFWfKLjS1?yjwoDaMgf9<!oqPf@(<nwl<PmYqG=7S2f^x_8zA8DX&T*r<5t)#ViTN
z+0a~nYrn8IJN79dlVK=ke9%1aN({PT6FPnblzfT1Ye`%2Yp8Y?`T2BPM3bY^Ly=$7
zlXZSJAe_fiY%HR7@N|TTT1|D)T-$@1x~R)j`HdW<S#n#zta)9hSl3KR&Z&s*Y0cS%
z@pyV%-NGG&lozwSnePNJb;bZi-V!hAd*(+`K~!cQ0gcG>{rfkkSG$h@E5QJ5&2oK$
zyrpv!Fz4|MNpkO!Gp-JQWE}4y^1Y#(_+~L78ewIE&!95_>VGPudRFViUElpdH`f2F
z-zXe1bUY_p9ur8O(0~-?U!qj9ipERf%ei1NUX6=~-8|`RlM30qvT&K4l2COvxA^$<
zI%@*#Y%9Whv$KEKS&i_Ui@sw^vBu%{)4ACvVP#`~*!3To-CT|S#r11#pCDE?E;gV~
z+!!m@5NV+D>CW{6v0uHkfrjeSP%8lp7_G*CICB2a1C!!Q*8z(ZKDpjDlSzqlO-XdB
z637C(_DHEdMMT3UgRl=Uuom2gfqkMrr-a`D&2kRlzU4Fz<&XWccYW$UvF+FO{9xPo
zIcG}p2EJ0v2|w)kLO+`?fa|8Z_6K$?86MQa_=m+A%q-@a|53?e$$fi!<Eh>Sd}2^F
z?k>{N?Zg4q_d}>hnI<Stl+6CxDiwGj_;J-|%rWWckSxA=54oX>vXv?N#uO8``l{S!
z5bp#mywF5c?hv2SAhT`PlZ4v*9$u54y_2^Jf@ow|(sZEn&mjK9*z7SH$Di~%lx=Po
z0(;S6W{!4+rR!QaI7-6{DDi(x?+;RDZngdG_@X$3bPBX(5-)j1?j32;v-XHqgR%k0
zW~@P)aC4CJ){uAQ9-Eku8r2`luGHgGjiQ981hFG2N;<!B_v&5u*R>TKtV^D9ve^9(
zZS<|vuC#X};?Mi~0R4DDNk;*k7y2`QL*v?LBM)q^pcuVF0oqD#R%I=}_vn5`K3(h`
zrNg^CQP1jI$w=(0y4;OIB!QgQj+-9=O{NeHSurlh!JUmskSIW@<HJ=FH|&yr(b#U~
zpu+A9FWAYe*hy?iQJ1-*&)gR(7((<71?c+vvmz0q4h!6wO2xS<piMdZa<2RHD*DrX
z^9hfzCClf}QHvqK$xeO3o^JO;X5lB@YNm#|*|c?UNf}3z_nDBkPFEj*KX@2iY}Q9l
zE(~0^nl2{RGt#b37Ie)h4<PV_ZHi0oH(!l!{pM>6@``#lpHIIZN`n>z@D9#$g;wmS
z4)Pmc%p)bAm;F;Lp8i{j{Lh}|pRfCW*OdRyHQrjK7ty5OBe$LydRaQgQg?w*9S)S8
zD!4tTd<9_2eQ|%!Zrn{SaD}$Ay9}JS|3oIVXLf`~)O&)a8-9JJ1TxNi0n3;S!?_6Y
z3<VmF1`p35mvRbME#Pc_6h%qDbhnr<{k3`L;*#{Nba-%Q^zVI+;;_WKf$zR-q#k~~
zZREfEt>>e~E1S=5{Re~C5`)tNem{Wc%&s!W#_+klIzwdOVs^i|HM=oxQ!Qd|5jND8
z=B~Yufco`Q&Qmd0)bxB`6kpI5^(s9em9Vqa)2#M-0uI+2wOyO=?My-Y`WkmPI(7W|
zwmNI@fvjZ<B*O_84(kpm^F(Ha-*NY(Rm>*Gi4Pl0{bgOw(=A~_z4u*z&$vAB(8AZE
zyz84{Jqb<m6A2C+vHYf{g&2?hTt$d342NVZ9syDhDqYJg9207?e{fLJVc$o99iw?}
oVK{SaI*nl+B>L`BiB@nl=ZE{h%FFW*hQR-5bp9U)tjERw0!D@wS^xk5

literal 0
HcmV?d00001

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.040000-0.000000.jpg b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.040000-0.000000.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..2e0d19d1fcd3aa04701ac55f670dc470804645c1
GIT binary patch
literal 50398
zcmbrlcT|&0-!6>XZ2=JkK{{-uClu)&9+6@a5+o2xfFNB!dhdHHMfxW6E+io&p-Atr
zl_tFgkSZNQZ&IWjp7&eptoM)StaHwHCRtgN%)Ng1tjt`$x#pVdzMj1PLG=i%1=6Cr
zb?X+@tD6_q^)%H>s{42E-n)C}{=IwmsHyMM&@w%weei&mjqx!(6Bj!VHy1l6=O27x
zf`2>{;pOBMk`oqrE+H)~%_FFwA}^^dCM7NT?;y9Rsi|on(6T;!$SV1i^Qq+jb-DhB
zisAn6a=#VazV(diH-=lc8E##-Q*lyJ{dW7Nx3{SNXSsdrx8LvFy?6hnRp$}aZ#Um=
z-@SeJ_nUI(w|i8#e!I=^JL6M{J1_L^K7MBD{+DE8K9f4U{LAn?W?m~PkA=OL`tK|F
z&;?(g@Jq{B%Z_MxdVNS*+`oy&_V4@Ll>d1rs((lO{mxAjFT;N|+`dKiU!D2)CAS!U
zyUi%^^zjS5-=9gsEw87jXm6T-W4O&grAGDZ^uGo9Z`E5MM3`+#v#S$-V89V@4rW*-
zc}<l;X-?abaT_Vc8dS_3tXJ1=>5Jg@$6R|9#pfwV2|dGTke9~jBfRj7YAC@2?hs;h
z2QV?7&3KR%ns4QD$2O-Iq^UKvQPzjSdnFU0)45I|hO9eAcFacL?Cne%!|&Z@=_9XO
zUUkaN^|al3H16>FJ$d-UVb5P`bO>yK=JbIKjf2XNiSLHvqtF2SHPv$34$MSLR6o0#
zvU7z!F-cj%0R1(;rx^(zJ%ztci^t+t_*yl<1VpnSY*tcjh9fqWw5m5+*<>uqNi^`R
z2=h4fufB)@BuK%sM=Sy%A+~S3-yNmBz*(h|zH|d&yTyF1>gJAMf38<{7YZr85}xnV
zlJ2tKRo#(Z6F|r2Zoi$c6BOzaafJHM?QXiYl>BM8OB4+JQW|G+aZNQ;(J=}eZBm|_
zSDX7Hnftqzd$vJ7zfg0guSVE^`=|e3sv6jQ7GWhm{xNS?`&4dSqhF!T@4E}Z#a1(L
z5A+K2)lhvyQbUXJHI>WmeA=(E<dK^ZVlgbwG5fm2%v>OrXeIX0gb$i%{H@%|fbsX=
z87E6(Qr;pydejm${ULC>5<8tI*v?j5@p+1q-h1L8pkg+S5rN?+wqSbz5X6o^#6c@z
zVA0H050=V|SM^p9hhaAfeN*!Z9TQ2#%QG5SqI|DL4UaYhwYI2<mZaHq^`M|>)Hv~)
zieTuG2Kmlr`!TsGUaeoP=w$FzvGvmHM6%?C<L1aoCL8<FRvBDXSK_d{zyEt<GU%(}
z%C}IpYpS-gQ^9L0{3wk9y!Xe<p)zkgI696K;)$zB-BD{$Q5IzXTR$whfIMn8FypJ3
zmvAqwV<LX#4S`L1%2iPqR^|BiDD7piu@?B(tJQ&=xdy31r`#H?tnLt;EuA4R{l@@(
zLc{lC83+Ec^zm|d+e%616QtMlP%!>}6;39^zwB(r)z{vy@d<LBoPHm%_Q0ZxI{;}>
z$pb3}bnc;j=84B<A5(<NAGb}JBspwniuDO-eU?(_Zfr<OID^-cSyDjF4s|lF;fE*J
zRO(ii|2)eTOI}HZe)X-!;pYF|`}6;0I#Bhah*@3}|5PPW&hI3>YM<D(U+~3qwbmaW
zT~h_qSgtvis5K#v4ljgjWS__FrUGUe24+h~Y}#bS*#v5t7J{P+Gn<FT-=#bMQ&tZY
zHUW#2e(X#AlGXR@2SNbWqLuNAxpK9;`~|;XmBzEhY7wfj`|WjKgh5y|x$;HZ;w0WM
zxQ{17>8w)aWK(9eqhq&N@Nqkrt&pDcOS|*z%w9<O(S?j?cSgB9@wKyH#*ubRX_=AJ
z<|$rPA-jC6@J*-ny4yJn=f7SrY8w2&dVeQ{noJPe$qsNCd=TGh(6yM1TPVzn;8Gj&
z<Z{iLSQ^!?I#t?)FkDlms?~K(#oo1G7ST?NP^(|gMvo{~5JelCO<Ik(n~o{=Q|u|2
zcOnS+E5YK{q1k_aA!2__rpyg^?^W|03wO`r$^N;jNht~_HQs!-&T3!@`z-s~HI<z8
z;Bw0$a64Vco9<~ugy2Jj0Zs;+wtW7)gv+%%Pv}RGFY^}(g$?B~zMClx+U7r3liCQ9
zihWbp&#^$n$yVc4_*y+Dy3iJ7dGpbSp>*yXG=nqt-;1mNu6=1r2!1$Me@$hQRQS=T
zzd<zjqFtR%jxE)6GB4)W!`P(Z&mN{O@P~q>;TaOrH7Q4rg}{oVCsBCy?q}Ah;rBSs
ziJ-ZS<Z#DHyJYi;A4#Lr`9p*|P8k$<|C8e8Z{y$)9v0n4#bxYK=3jPNy_A=<Xry}e
zs!|8DEs_)g-jbS~#WwXldd*jc?ENdBXg#}#&Z~th%mZ}0EBOWS&r+YU5uhN?+CNf_
z-%$Pj|6^9prp&d2^`e_HAtXDHk+-dDM4nc42)6bKMCS(laU1LPN{;PXVPo*&fb#O<
z?1~bILI7K9DcV{RCu9U_+z8BsSFi}z*7orVi%W@`7n(ih2Nt|bG*LGaDY%bbQcPho
z;fsD^`h?&3zQ(M#^ta!nwD-l+?aW^@{(kdu^Jc4y7k;xBkDqf^S1rl)z+(Hki0#!P
zs@&qP6t(V<LI;o{*l8Dt8C<z6v-ofzVZ{-`ah`plv9VAzP+}tV6|kKncz4=fJo*hv
zK(A@em{KsFMse@L&o1wi-8l_w>~fTqE#8YC9<%7)f#nW2QU+?I=tcP1#z|M4zE1id
zOyl+A$TX5kn<@-VwM(i8!LIRKA<PFrLt``5YCKFFGr#QS<gV--h(~-?d5S+zpRt*p
zTgB5_h@Wm7EwR4ZfY8sWR)Bajq88Jm^X`IC21~Al#@pXR<k}H?GqO#XQ*4Fiubywa
z3u@srV4}Cg<d*CcYKu1is``1`V;R19pJSAI9!sbGoO|Zg`c;?jdw0~+s18j_H;*K!
zT{8dME^>2x=0bD$f=MbbTkK+rH6~8<=@vQds?c#E7_%@r@Kl8E!5w8Wc805L9N%c#
z!Z2T6Uvcl%#E?9l(&LY9FxJeRWkOZy$=RWjghOs%<+(w-7*YICY2$v*D-XVIBc7M^
z*foFgMlO@2vn#GytsKbNcP@U<E(0ye;-VjvvG7WDQBwAqd&h~}?p)})^`f$4ah(sZ
zD69BJH)VQR#`DtqGpBm0WUALee~?~K9MOqz(8u#u;_ptlfx`=f<YdG1*{xuXdy45F
z>jwbOmnWn=377RK@uQhF77jB~t)2(^{c^L;G4N=t3k6bD++U((A)lk?^#R!qy}l_s
z;RD#|=Jp=aYN=bxO<G)V^os`WPLnyi4gG@N5%r2jTux$EhN{-?4b0)?ST1#G#?>;^
zQX6&8>NkG{OmV79>LI*ZMoj~6vTGoRHNOx+voN#4DdVunUD@SU5#c1+U#p<G`9vv5
zFrGL7%j^}}gvSJ)m7Q#U+Z;?a%Id$S5;TKe<rd!=DxuY6B^U0p938NF`~P2o?H0Hi
zA*7(<&rd!QnTj=a=Bsu-kWgqC9Ta`m!gLl&5bdnbLJ-)=qJl#6nNF@Rq<4X}r0?vN
zrN|hlCXz>ru5ynrpEPd%;7h&MZc(Z%&qC{KaVxOMpk<G&(K~(w>YRlcFcd#<^?uf*
z|GUF-M26GLY|BRAyyjLZ|7(Ki(J=?7vUM?bzVO4b+Tm@IxVkvp)Gp-1Vm?npbFV@v
zGF4;#;8DKb!CBf4&PAiX1`H3Hl40BkZa**RNuHQ{$yh6kT(POvC5Zyn9~N{tYWB$f
zD}klsaAFZ*D`?B1Db5#dN$SM%LYu7%4tcuLJY(|&r86&DUnc4<j3&t+%dD?16)!$(
zk{!xc6;#RBUtB(qE8(H9k9F}{aCcO@XlSS&H@(RCXCXMUV}E>~3C}6Z{?jwtwC`-i
zY|tBWo7OQ!vAkKJgg?;Y+b+C}oe2YG!qB)G#=a>=A83X*9LUozq*1rk^|F{UM5B?N
zXU{HETlGiZ$kRVqsPR+2%blE>G4?p^%AQbe#Vg+GYEDfq;SY7oE7fM+zC%lkd-+hk
zM(s&XW304UX6Vd#;(W%^{)J$TIl-qxJ(vFe?2<Y{vTGJta~TpjoPXzz4H|-0PI#+i
z^lnm>O-*<rVTEUYW$bg=<BmX?hy}?V!FJWrsAfF->nh8Y%=1=j9$y-R<fqK6C1@EV
z-%RtnKm6>(qZchBzQR4T0$TLUO_$@*@>54#e{VA*nTfC4Uy!Rrsprjq2J7mn@*6SZ
z1K+kba?uHhR~((*dw_`w2O-)4F)g`0gJ^R#535lS9z&)#_~|WTSHf8>-c1o;ro418
z_p+5R17{1>gGGCk3miTA*N=s@?fSB{V=VXTki@Da7g5{zGV8>sMeog7VPCfmmh)_y
zof^ej??^nHRM~r9v%B{@txD$UJ(e#9i%0f`Iq#}=<(Qd$N2ZR;x7@kPyB7J1-W2J5
z8G&4YPN&QR0!{K1w~jf~tL^)X%KEP&@n1XYdVGAQuI!xPjlihar=%soqGR)#^wE(i
z|GK$P1XBn#*$G#6mW@nKBERh$fhtL*#2*rm_P3pxw)N>{8%W}xuBq0%oVsKbY-0}U
zm-q?Nl!4gF7t=(F)xqYVHwFJO+~SmQCi~1k^>Y#`b_L#{U$T%E5v(9N5{ucZX=WSf
z!o*JzC(tpwjP7f}bO!Q~p3w*gnAZx6-?wI$1Gjxpb%>q+5Ip|966&Y*_dRa4L`C92
zmQM*xIS+Alk>C*7KHLFE2=&9n@w|)1@62Hw@o}$eXZw-vW`mYrPs4RobT<r~ARVP|
zkKM<+dJg@toBKz9Jm1^l*X4nh@FIa7^kjdI__F8!$NA#!R_V{%dF}gvER3eB?DFw)
z&H0u3M#l<Fmz?1^%@XSuh3Z{6fLIQ|Oq*#frZxwcW%W%(KgO1ZKfwq6H2YFWhv%Vd
zV6Ji?^%@Nk2@1VVrD5ZryA2^=C#i!;6qqbG-8Y1WzzyEJo|--H4uV~MfX6;beN~Ki
zo{WO_21iw}xsJ}-_QFfCd4Jbw4q6Ul>nUoEYtLJm@?>SDr)Gb#fS$p12?W;WJ2vKz
z3Zg3HSgRf_r%57pViVWzm-!Fh^|^@JnMn6_A_-Ei<S%@~n}YdKsnr`Lt&AHKe|dq@
z+&HQA4AK5<G4X#^P#*0+4o=EUzN}-<%Os5}@tNfXxncmWSqI#RP8&*Q!@!HuX|P%w
zWBBN&okaa8*>b;0^|`@9OnykbgKR(ebx|3$7KG@l%$Ltr#;Bw5dE6H-kU5z?wsAx~
z#o&<y5}o!@@XJ*RYcto+CJy3MTI>^3bTpjVE3-e<z@S*e5(GGj&;Zeuv_|zSJ5{sJ
z7@!y>4c2>?Vtt)3_UxiE-k<yEsTY-z7(X*naBaZAc=SmCcVoEEZ|=#C?wkf5hZya=
zq%?8c9Y-zEiR>T2xgGmk`fjjXcJVGGM02^Jl42$mZYd9YX!$ug*}4gPoIG#XZ~RV$
zR`mYse5gMD&f88UJ{2t$x~651jlRW6-5R$h&EHE`?xm3(TZ;DlkQKk!Q?>b7QrFJ~
z89PS*dE;p0puqoDtYX;@#pX9c+$E8CJpv_MBnGP18Y|Xg>vG%<m8w5WJK=@=1XpUm
zEidkQZ+w0IZ6)||JR$SgUgrlV$Ak72g{5EQ2&mTB%Dcgwv+1F8ar%WiIu31t+YiC9
z+&d3U0-ERRSNB*EAHIxyDp^2Q_aE9D-HG+{w@Iy<AM);6gk{)%^|PQ|th}aLISsV3
zp{T>d$L$*`hgCz?OeQdj!LwkA?iy2pmY42zipts#X8Rj0qy<@s!LVRf0}TI5W^u+-
z`yQtgh3{92o};RQl}%D?zFJ3umsvr1>u&C|$(`^<Tp9!Y_K1Z*;5`nlUUh3k3ICz|
z<nGOq%p=<VhVnWq9PAmEHjA#5Qgk95XC4VHIxLrgnR!RR>pzwP1>cwXTdn~ZH}=Jo
zF8ho(f&bL0V%8TO)rT_&d5DVDjS4XsVHLn=%qhX?=rPSB9M;<YSi)Rzu{1LUh-+YA
zot%BRbrzMPT=}+B@mGjKkk<QN>e3n|v!}tB$dPQ@OQg|<OVv~bPV?$87tvz0?u*Ne
z4nS$MAa(>^J915xINf=8=F+T2zo>gV4v!4bR5G}x0?x0rmhV1>nmZ<BS@FNCPua!T
z7i_I@_OrTO7&N(8Iq2?-fzEQ4ddKD`@KnEj{y$3_UF}3)KRJ%?V~!7w&jsGePhNn_
z5b9z_KaLKAUr@(spbgpbptPHwhTJ_U{=n^Jt%4z(0_8%;?(N73&2ABN0I6w0i;0Ao
zIQAho1cYfk2#dKfhdj)z>s8N6G<k-pp|u%1n&*Lk*OPk-X0XIY6W1}Ueo}>zwGrd;
zTuB;Uv)Q)x#ot&Ai5%<F#yG#H-B#048RKd0x{eqNioloVWH8KYiDyaGj+IF|o@<p=
zc_oZRqC#G&^S5Z#;8w*pVdt-MukefKG<;*llde<t%RPt=@_VSzMRYQOV>DE<g48)4
zG;*X#AeZUQA-ECC_F<eWwmba}LY=)<`F_PRw9d-unP8{n8uXEUM%NzAWZ)p(tfRT;
zB5LL`!RXrunWD2xWjX-qDwn&s>7bE)!;Ll=Vpo`dWgq(Oguzz>=VM!RAh9)uxd%X#
zl*A))R7~QP>AB_!!waB}AV7;rVAX6(<PeibS6{^QpZ-Mgs-Xzf5<OEDXk~Pyk9=ne
zc$!ClO+}Jh_g>?_<Fgg(?OthQuu;3(x!CPkHNo1jYyT%C*Ld(mTm<20@#NWuv{(AB
z*HrEixPa;qg+{OMOfPk;wz*ZkDMKGj9QdXVLwCBw?;mvHGAmQAVty)eI;IA(7uANf
zB<N1AzG<Nj$Z0}!b#w5-2iA<jh7tQ*n?_+QV@p!iUmS!N0OrA$JQXTDqj6qNZ>-gr
z#c3Nno)2ViKtvWtWnkGG&9n6q%s(h_2RU!z7z5@`tQR+Eb~N-Q9+{#H1%iaNkcF+%
z{(j@x{_|t&Km3w#{IG(ntY9Dc<1_CO8Gv!Daz$N3RXxZhs+v6BdG!;R1QZ@kEfu@e
z8!T=$U9)CPO2}M?fU)MWr&qwRFNiQer>@E|#K|-?1MGJpW1AUUwmx8}!byJ9*pM3d
zuI+K#=Skcp64bjd%G1|`V@JC>WePP7RnBtmiscR}L~U&?`CAh0Eg}NcGP*inmqdh;
z@j?)1!!_cfnN<YM(Z*Cs=-1rD<Iwz-8`+{R6J7F=5a>Ou84}j<)4eVmzEHg)%4p;|
z^JUW8^l_(qO6ZTy_b~@9D4v4Efu$zPB}xO6%{cqb@F{Js2cX*2bLbw+5lKiFjBB=!
zMat#CoI*S|ta`3}$iwh^86nablIgVWGp%oEhdj0AKhF{IOxg6i$9QGi#;edcjuV98
ziQj(}W{fGb*zNa5xD$rTM5@Y#wJs{f!>^p?zn$b~Qc?Z!zeo0Mo=5Es(kb$?cvXk3
zc=;Kq%QY2)V$>-r@yKH5YH@)D?kF)EE*mbWw^6a`5-!7x@2ggHe57ak44{iXu?r|U
z{5Hti%=|4CFvrXltaCu<4(d=Ss+vAh*u*7bOq80tlPW5JY=xyc-)3$B8z1WLkW*Je
zm{*O`5woDyCNceY94%j171YGA`cL<sMvMHBY;E;L6dW7yM9-YTpx3NCGucG4s6vK~
zWE(RFT;>|%nZ4i0(xA1(RI5%;1OgZ={9`@W4G76amSfDxE#ZxkWZK`teHm-k<5xpo
z9zOQ!jwzm<!H}vW^%EphR&3H_^}t|Z^NYUu&X&%!^30lN(nrYN{K3WavmyMfeinki
zQP;*jglw9<eAzdb>ah#+DB2bDi0}1D{F*EI2t+2NfQpI-eH_CD`EqUTN8#^WkB2?5
zSHf+x`OXVxP;o80IM$M#&Q1waz6czUgWdCsp~=y=V+TzC8zL$>8|hG4*6yw_M$kO9
zsy?)T9Iky$MJ+h4d!TK>Ga)wZ*~&ZQ#zwFNh&ke}J|1>CRUYgcMWUT30sQXea}|#L
z<`T?qJKRE>Jl{MT*w`%8gLM2apkg~E<0E5OUnS!imS9kWQ+xHR#ggH{!lnB6W%HIJ
zt{o3qt=ze$dRdl2UuHy<0hnERnu;YF8*6<ARE$E*P^z<gyLmB33VK;kuxMd@p||{@
z(Wm;;)|Uw^cD4=c!;5v%NHCctH(}M3tFv4T9l<q#PWBF(M@#5O_~Uxhx1b_NUdS$k
zdjiJa^<#3h?=Uw8aJ$C+eD9ZOVb_MIab3z&@DF&neMdxlO22PK3%sA8J$QMR%{G#Q
z{2PD2R<J<x*y`9sFw-+msFi89nZC%!SwEFdEVGIi_8fvw8#+{$`mi80>XC_X7xl}o
z58$2m@ePBwxmCmU+`Vx*!1Xlo`I!-*kZoYySv!_uh~uci(-l$3`7esgQ5zZDjE+7r
zCa4qXSmuqFY>=<pGQ|2#C5aCE_UG{YkIsv3+gi|F{_bn4*0DpGJ*k4jktWQrOZb8W
z`8n&k-<0D)LIl?6;*}?=^|MGYCyic-E`t^`0R+xo#IcDvq|yFwVJ5K;xEx^aP-E7m
zIa<A@n%CDL@olsA_{?@ru{sX<O;Nm22-fdfV%Jm_C!ftc^qWRdA1RhazOVbmqjr}e
z_=q;yF}VBcv9IKKJD60l*Oo871ebv@Ls0<Kr3Tmq6{(0lRFTz0DU6vs+Zx{`^h~@Z
zn?7a_5Vals)BuKG70*sj4-JC3mbZH|$_p=qsKa$`HgP*ngRG=^eUUe5S!_;?e~3|J
zk2KLibJ(xB777wWg*PkhU$5XT6_YMeCb!Y1<#5taw4={ca+q&oPIvR<y7I8m(~o}X
z2QfC<k4vz{7JR6E4d3TMnZl=zS&kb?8OMwSn-I1tNKyb$T(Z*YfH)!Nk+WPD)K>~l
zu&2+U%W>V7DPHJlN~Nrj-!>mfDk83_uBqZ4Z5Xa!*^YI+0E^pw^o(Bh%mJj0(^l+a
zPHZmqyd|p1>(PqnpzZaih_tz|=0tDlvy0C3nuA8*$1+ZpdvLQFa}(z$TZ`8F7H>=5
zwr+H3uC0R06BytK$NKI$=xl}r^Nq0A^ZyBZY3+u1t;Zxo@bl=#cZbZp3EKj40#A|~
zKdOjhtykyuMV+|iqR5>~PYqG*ZfLhi-D4F27A{koagbf)LLiqa!}oWB58X+~$yjwV
z7}Cb0d7h&KyPFf(&4(YKk`%H1>P{n1;yW0-pg*FRvVGifSc%#1brqN5GUIa?7{xK2
zDN&dBD%H$o&$dG#d0)h}EEnJ{jNp^1siR>I{2pXzZ7=XLvoO;)uRzIdX*4KJ3iA)q
zrmJcW{lOwhVKtZaz#V|{wb1fT>8EhPJ`P6~UQ@NFUWDo4=X8G=u3kpHjo}pIkJyn=
zSZsPs_E)v{8;rxzoci9|cjeI+)y`?g=DmbS^+?848d@i}7Um`PG#r|tly5X_?cu9P
zUWth%_a<RTKPgwPiW9Px?zcbyPez{uU0Dx9caJ2vfc0(i@jT3PMJl{<cf{c3WMy4@
z@foA&m|iw*Q-`Y~6)_IhjVWfarHM>2sp1Rm$Tr4b84y0Rq}c89nn<cIZwd<bdi2*6
zqqk$*zaT#0A9`$h4{f?-o4FhF!!R(f3$cp{0T-y<rRP%Ho@uenjkw<9B{l<ZtU&VW
z?0MN12hkHJ2R7=qcG4sZ8cOuM^$Bp1=c8sRrALyB&yzP%;2zz~RT(8#r^OUD8C|0z
zen+L|^bTdEyoWc4@GO`fE_JuaYg7?FB>F|2Boc9sHwPcfH=FJ{va*K(v6@zWr3dxi
zFktOhd=VA<oBuV=ACw@ag;&#57%BfWVe>h<zq8>K5TnLz1+(Xgu(Ckz1K2Klh3909
zL~`bB)#sktP#7#RSj_(&{W%t4ykJE!ajfQ0FZ46niDzNxEH)JIS`fb@EML9WH@<AA
zOGX$O!n5nkz3o$FH|rmv!{r3WI#89a{pr=C>Cwk!KjLTlHmdoZ|MB6@ne(lfY;&$!
z5z>cfoTbJ&bmd%Xb|{$eO$Q~Grc(DJ<8Qe2Z#f9PBJ7TH7?V-DdbV)qaP%vF`OX1Y
z$4mX5Di+1@VWo;v82&4{!7P5&{56Sb;BfU_aB@nAq9M7PPtWM}UWt*uDEE)|lCM*;
zkWro<rt9|~`aY<!kDc+E^s>WI3?M$5pn%VS-wZNW|HaILP%NN095M)Z(j1`G`J+ws
zKO|8YhU)1+E(6x70M}Rj;(WtzM>{=q=Q_03j0ym2f{hI9#x4FTot-JJO&h<=XeWD`
z$<(I)Z{wwpVtib?ft8IG)a;`%*;#s~qB5d1&#_I9AVc(`+_#LP5pl4mnYrv@du<(?
z;tDdg1xiQH$3Bl)gTsYJ@mv^Yn|G~n7Z$dI)~{DD&=%nradaSH&EEv8XD!Tb%<#xS
z&dTuNZ(VP2>I34Et}gZ{guR##N?ZJ~Q4^_fc$gNvYG4@F%o_VpZ0!zAd8+U7SaIhO
zi32QrV6W1Ib_<Z+@>=P|PP#nSalYHie$heOR#h&Y^&J{w|Eg_TzZ*s)e4e(;JNC->
zjSUgoq!i^`>jObD|8CVeT)E3Qyi2i6O*M-jTg2aEsZ`!&>gb9r#AZ{PpWbP_rh1tM
z%dWd5E;4=QRAmexd+xP;r(7gF{k}6WzBEbLhus`>w{=fF*oFFgX<M~Yx4UQS@W*+?
ziF_xTfA0=q9{s5z%l!xs)ekeUWJ<PXwn>Zxo%?W5M|@qtM7E8D35#Nw?91AUz`Kng
z@Ay>df*y})x9Z+_8ZV0@N0hjq?uq1ryTm{Ha`&VQ=1hPGHyx@)#UZpjG0=J()@SU%
zxR3jpXitf7r_mfF)YGi~==hkVwDRHjE!GL-6@pilOooGD->gc+1)OtScCD_2eic+?
z!&{t{`w||fKCGMT^f%f?Rs6hlTu$d3>y@x-lkEw7*ibzgol>v8YE|1aJR;PP1eKn0
zn3X=(X;UD7=%)^Z*fE`k%Za4u<J5MhS1pHk{aDzI*Og`bO_~2qWEaIqgM=wnU41U2
zd+iQJ`AXm%Y)RjF#BDa+k8j>CZUiw~2YLlfR1R&3)%y+@{z(P=Um%=Lm$6-Yn}!Z#
zgWSAP25>F*#(Um=385YPkCV$_*r}KUq<DdravE=0v?~l3<b($i^?j2d6xnz&{rBjU
z^Fohu#wzP8t1&=>)YU|NZ(jUturF^M0eW*T)^G3ZRlmH1#If%LthPp}+JEwl2CW)y
zdPa7nB6C*muX)UR=*-nmj_*HD;g>!N$`i0j32>N0@P_I~G+zBYekvC%tHMINwW6bi
ztm_@YH$={*ZQYOMQm`hT_<60lMjMW(7VnHK{EcTK!hWvs%zW316OmyC$MW76#W1#a
zevFfcC%uk-^_Ex}%i&>nGv&on6W7fkNWdbKS9}>E71}-9_?e20#oH~#7ZjvBq#aT)
zV@-N8?Xv3$2rL84Kb}tfZ9_i?gnTfcKa5vrs2;at&P`E7`^LwRWYynS^c^1vY&=0&
zrkKnR-GaYgmf))a(Rc?uD=luAEE<A_X*I5zBSJK7`bY(WA^}f>H`l?W<;TbG5_Mmd
zCGvB<E!BxX^RR$NP?a7ZY51ZkOpBE%e`gptnAg~Qc=)<3kFs+v))$l(2Th_Y(eEdg
zZ|B%Lx7Y=w6PzE2OR0dnFW?}rx(q9alF~~C7NpYZeDqdBwuMxd5gT6_D{ix>XuQm5
zcO?N0KyEAoPP}sRqSoWxMP*BTE~bG#j#5T3m6Fz$jzow9FSKLPIyW-gTWcxD3jWqv
zxOhL9-KtpUX{LjxOXrff4@fJ|5Hag%TjU(xT{K&31NUa)_385lfU%{QiCG4e^iqR~
zMg`+KVoD`cShm)#QcQ3O6#;aQH~8ZxG~n_5&a8de(RG=a+*Kg<?T7pciya=$nmwE=
zZ;ln`uVzo%6Pk_Q1v^Kww42$9gzm?&SY$+lE1#{Ix<vr>xnxg&oF|6b$ti$3l^e3)
z`_!E#G(hrS<wtzmY_jLZbLHVZq5{~=`l!;vjYS;4EmK-<p)YH9&5>&+yXC`1<T-PF
zfdS8~LsW`_wqK=89mYs2pvoG7grIakoq;sXtJ2b=7T@CEZM5==YEh5oP@8OW>-^*j
zThfbvRz^b*6*wH3a4<z2Tr>?z>7D%T7ARvq;ARF5dEB{jM}Rn*>nGQb5B&8pN4IPJ
z&Ev54(atyPiw;Voq&xEGGVWd4kNz|C?)BGQaqaCWz~i~)FmMQ8=mQ5OaZxW-w4W-!
zc$GV`Ct!tma^Rz-oW~Vp0X5*)f50p(hybpiWl+ZTMig7W4Kp0=0onA_pPSV8I&q%G
z=U7Y#$gJHX^)*P@a!S{Qd5jJV7H3XwiQW3Mpv({lYVq~4;4f-OS%@$nV9$JQD(l2X
z{@kQQ{~_K<80xAJ+WgR!M_uByQjO1@h#(>6JY0MK)*oND+}h}k(%u<$B~MyRJN3RR
zN4*+kH8nIVUQfmeD}ZJz91foiVrYAEc3c0&ItAYT&PFu!7*TvynUyu+5`O<PYG8GW
z)gB=Xd39yAZn^6Kb?9cdRozA{yGVbP2z!SHG35$KjHn9OhojCZu84A%9hLh;STQ9?
z7xotn^MTU9vV&RG_U10;)v&>q<_rr6BBk^Gs`p-(WvzoOHW{;1Lkoyt@J3-%l#o^C
zD(c+q6~VxFulcs1?DRtoKtfKhU8`iIu(!avW{;r{P8@Pe#$7sT9|o8ywa-;WpBmtf
z7;J|b352%=d7l}?p6Xpl#D)}_Ops&`p_M^y<)MtIZ(c&9ADS#Vjz4o2!Abf*@WTGs
zw~=&Z;xQt@CZh-*b%X}PU><Gkn{1-&?x=dg1OC0LffTJAVW(Bw-Dma5)?SX<erlE;
z34L>v(pRLS6%1tA(Cp`kkrhsP%0oQrnu^<S5>(@$t8JOgo5cX~&a{A6vq+=^m3_EW
z8oyoHrep^`FK5G$@7j`sdJCBilkIleo8%VK`i9|d(T!;J9NTWQ6l>+8evj7t1ZFm2
zt&N;}hPpY;v}C>&(LTdv%gXf*gN8u4<;3B7lU)xn1rOsW2O24qGt;jp0xmn;+nADc
zu|HSDI7~{+SV#)hZj(h9kKpF|^%Od@s-(}{J_SWNL}9@ZaL40H712>cG}J#T_x1yX
zMWfzf{GVNbRDn6Ri+<r*b0v&ukYrdE&i{q?j5%N+YZNi$X#EL0EaoKIp^kL~cKl-V
z`%o><H#NRkjA~&_<u&OXxqxVSlJ=&mb~di5;Hsu+_&Aa-NO^NGG@~L{F?J$qImE{3
z8M8fT1?^*&yS}`i{&HJd!V9<9Vq!eq`F!`u+%w>LOqzikhSYtUHuj{Y`$BQiiQ^yc
zC-A1d%8DD&m>leSr1IB(!omql!o%%{iU`}(cz#8=tIgcJL5uzO{x0AV)vee638mam
zO4*G=1f#;r7P3GsPToi5J6RQtlLuy6Wr6L2DlNHr5VjqsAhTjm0y{v=Y`Flv`h5zI
z&SnhH%UBkS`engfP;leqqV@~A80be<7j^i0;RRiz1g$0IoCt<4)0Dny-b_W8cyEzl
zZ&{-9;IG6|)=9N!F*W#PUy-z4JR+mSB#i-;a^JUPP8q#=&KjCS4uroyu|)l4nrJc>
zD;Lsr$DO#V&B{M6Jbx(ulbB?ZJld-C$ZPFma#cb&jY74A%(Ie=dKL6+Y}?+9kAMkf
zEQPhDWPX{Uj{K6|3Fd@)6)Q)dA3iSJ6B_NZRs9a05Rn&c?*Gg%zcTZE;~AT+pq$T*
zxMRM&Gq)8Oi`tNqsX++dIH|P0b%TXVt#ag5Uoho+WmO(ND^pB-Pu?8rhgabXd-Dq=
z+Fa$Kt%vM?e1`1sU)fA@77T~s_BvWMd<yn97j`Cae?uPMscfy+>xtlD2<*(BsE&Ib
z0Z`+#c9kuC>pjzQfC`rq9QdJ;ub|b_Thy``@-i76m<E-Mz3jXA(2%D~C~W`zD-%G>
z=mdz&UV#FUyIImPMaQ2dGFcHP*u1)9P5uVd$M<5iQVj`)y1sPp4^@k^4=B=Yk{!Wg
zuo$$ut+~1acEsFduzmjy!q=@KL2k?;W^v#AsN%&n6*O3fP~AsN4(i48Jfj$=$WhF7
zyHil=n+ClcqTjt!9S4rF;}cKJNh#%61c~(Ii)K^sog24i!s@^J*lQU+o%gfobAO@|
zlaWZ{0IEw+cC6vaKF;j>ZpmvL$ZodAjI*F`756@7#(ZD5_p1+KQW?oxP#_DYLiuZ@
zM71JgGm%A6xr&(YT5}OT)4uOWyn6Z8j@MMK-&CiKeuZeEY-Swd)SOF#M}A7^G8ieR
z+P1zZbnGGXWO&~$LtOqeL^w*1`v-lSi739~Fb*F<N>+dF2@%>5?=v7{hXcH`y;4a8
zEvJFxGs3g<VlW9U4g$`skKt*CCca}LQOO%)$%3t@{3qyDG5o2=k&QYD2{C{=`NEx?
z7(f^coumMdU^=76ZNa%!PA~lUu5>1ZO*QLqYE{F8h`jdW4~Odp#jlA3D{G-<eYo~?
zAV(*Eho9L3Vy=`MEVucjN%SJ~rz#8laz=1K^-18|Kkk|li>H1!GL`OQ?v?qn*>h}j
zFI!m&)vdz+gi2QVap50zTF)9lD<G4zs#g6qPVE>gJNyHoRb;>8l<HqoZ|i-0S<x+t
zq34N*CZz`{xtmso`DU`g^NbiIPG=a34>5xB{0q-l)Mn98qw3%fCltm>4ZB?l8s<o2
zM20N9D`kp~4&94NggVM(JQDbxBtnK+jaa_gG*O5i7m_|!xX$NtjqRG}0ymol)&79m
zn&~l}y=1_J!KZmslkBsfk&$fy=#WIwmsPBaM2ZZ0dB(8ywXE3V@HF8v&|}>&y$^e1
zq&1&btE$t^yXWIh<KjO#Z)!>gt|KBv6ECS>(l6rgWb6u(xP-MB`UPz~SvbGWi+FDK
zmoP{YH<foxlBTAqrY18C_PW}5`f&1>Yg=%MexQdmKT*rc-Q}evu&bYDrdh_Wugcm7
z==LrqQQt#~x$c&nNKOwG?QeuITnbZrkH1lRwLpf}&dxsq+(bxn=7|W&z#=#!>2nA0
zJdXaC&iJ;Pr8tYgw7Vt%JY1`%7hAZ^T66I?yP>FO%vq{&rYrHMFzrK=Aj9ZG>9*To
z#s2!>M`m!Dd_h}LFqxp|=P>G#W>lb6&H4q&poe+|g=oRH|A-IzoF0A9Z-@<6WJ#cl
zoFfRX7dv<px&ji<lKqH~U5jBRF+cF@=n7ZVyE1PmaOH(57f8JuR4LUC$m*Re7amD|
zlKB3(JhzxB=PdSaX$)KOfGE>je<P-zZeF(<;~vo~X)%YFKGEvM)^N#|e#r!*z(1S5
zNtI$p8BE@$lhR5I0ZB=Lto(7Ur%tnRW~OWwjS;U}nOZ)s(PbiRRun*T{SqEu>YZo~
zP(^p@1ef(jgQ^AmM8H$TknQ`a98YRv^Dy<P<qiV5IIdUPi`hmbDZ{Tzj!M4FX2Eig
zPVGdmsV-DBx9)bu<a1HPoizp-V8yA1m&3VcN-WI&maA!>YFX~tWjZARWS_uRjS=oc
zUXH^4lKFn&iEFiyd4FR^jbQ7OBiTrM#S(?#q!g9<_J>RqaMq~HUr~5k4XK;>PnkBg
z3bP>jI#44pwdNG`uZUtUg(`A-X0_y(4wZgypzr6Z#Y$0ZEG*Rl1qVn;F@qDsva@O$
zxV*I<B!%F`IofjlVR7@uwP*JYL1ViJkg0FF&pj3+dd?%Fd{0teNpD8H+>LY=_=srZ
zVG%706d##X)^ShgR0YrsmB3_pOO9^RQPE-A_p)m$@LuRORX*mL%1SXJ{XYTLdU4WZ
zNgf8I*S!FZIs!?vyem=i1FzBUXdefX^f`}(vYexzMr)oW>2(2F1eRh`(^ne;o0l*I
zer@E6STqo}1}@Iz%akZ0rO#!rsjOYuw@MV1<(d|x4S;&kI)RlrvB1NP1G$x}m%>&;
zqd7W!=-s!Y<9eadz`RUFV=>Xc7TGP!pJ$(a+2FsXf{b-;`k0)bZf0d?IoEr(EC{}>
z2^>(EY+xODs?QS9p-r<^{A0murGM_+Y*}y1*~nZ3CYJVnywsq~cZE1gu_c@z`f+na
zFQ$jTq}D<RoCIN3=Xpm;zqtn(jKp&@)}$hM&nufj!~eWCcHx2Q6}BAtx|Z|~FP=`p
zOeh4?eST{_VDI>kAfty@Vs~qcpLieDrx25oamHX3DIoW-Phk}<HTNOHDcjWOXL)HF
zM~4AK^|$BOR5Grk!l7)JegUijlTo%9us6>u%}P@E0w*{QCrBd^>Vqu{wY`eO5#o}`
zgfIH$45{AM^h_(Hvr3tI>InAN3GG>{T821#XPTZSO4H}PuB=t0Fn@mZjH!kWs;sEK
z|AqPPP=8MSY_m?yto=}Iv4#X=JbM4>UJ3Qq@%mRh?>!Dr{+<r5SE6e?8MiHA$+cO!
z{dC60A;MCR%QQnfBCp=WE9S`IYz$nD9i7VhxY?8D#8+)2ne$JwjzI}G$TSC4UHsYl
zUFeGC@ZJZ^aGA#wv4o}CO2KWfP@dtxc&u@k^Ur^AiB+IhQUS>=Y-Xy%+@QZ0zUslY
z71VaD#|#h!X!A#rAA>N*PbYG!DsI0-M~~@{y2xj2+1a(uf4%NDOqzaqmw%PGTasAZ
zftV|9R%fx|sAv>{JIL7S<$4SPQ=|a~^N97ft?q5LPwEEQKF+jp{v})8ehwb!r$d?J
zy{m?L0Lr;GJRX~;6hM=5DECHZgeH#~tk?W%-YG5bpRci@ggfJ}ct;bhd}ho@n$85K
zVzUyhS(AZmUeOauoN<N%c6!yGMx${m@P@>?MTlxrvb7~V@oXiA&96!xmC(d!mC6D$
zx^t-8j44gEQiu*KOC`W)txlgvnFe%F=I7MlB0=w(YOMR04z`*k?xQ*3SYmc?MgAOh
zB4tQOEZZsXMu<1IW_axwD3;RS5w#Y)cUig$PS<H&7}H0^NpviY2|Vw_7HnN%`#Vwm
zt<sJpEg6|9a~&Ds9(s|qdVMx`)<C}>&3fo!oIrNYc78J=nF~jJjEc3(-uP93VHeU_
zV|VvRs!-n`#~H829GgF2aH^DX+-z|(#nn;BN<<g4GtR=<-C!4ntdE*qj|y83&a;2c
zl*7$FWsp0ssf_4wC!dbRzwg}BkN+9@@K3xKX$m3Gvdp`$Hr-#4(Bcz7muKf^z|j~_
z7k%>#Nqiz$+F@Z`9|Kl!7>y3Is^=?C^n|_n4~c|cp~F4r(}GOnj4FE`<5%c+Eug4z
zpm+>9l#s;S1#qVoRp_O*xTn;*VQ7dxtX<g&0F8z1Gsd9J$5RiTeuf(QZM|C&dy10s
z&CHr0)@PZnhPu@7Jlg!aeLB8GdPA6~T1>WW@L6@=K%@Yooo2n2>KvnS%tDQrq^9DL
zqV<j@orCFJ(2i%hGBUOa;0l<MP%<V4uiV3J6S`BMgk1riAD3GhDF*3YnXCCr3R|tf
z3wD#uEP!w0JQvdKs^AHj%XUa)^&V7Bz)`~5gCI{5v>pCqmlz@-NY73L<Y-ii=A3Ay
zgeRS1(>~GM{4T3uK!gOgIA>xa@!Zh!Bx#Hd8Wl!*dSl%9CMa|N?1%-~fNkhSGp^-z
z1kQALB}yhGHO>@0NHM5FR*K$`2f&SjfUJuY<t^X>zs{;!dU9q)X1Tu&0}dP0nOQ1q
zvq6T<-nmt;RLkw=k0PvBO$=gI4Z2k2X$F1oP<mB)P-^aw;jB?zyNItr=@Q@k9EazU
zn^V5#fb@KlQK&esiuhovc5Eh8sqm$*tY%T;iY}S{15QO!Q#JK=x}=Ofx9_oH@Qmo5
z_OjvY{5$^Yna8ha6U$f{K2PJHjMl+Qxq_rI;^%M%K-@NK*F{m0wS!AfL!#NvA5dhE
zqPEc))p;EbY9boIhHz@^b{*27XekarW^~G5ThO?!GYmmhZs^N^Q@cUZ@Cr)9KDjn2
zq?j)0#wUh8wlxoM|Ft=}c1v&Qm$MA{{3*gccs12gh4zzyT+6{dJ+%fQbcI!_y_0bj
zH>lH`t7p`-qMw<oR&NY6w?X+R^<ypfz1dR!r)WgzUjZMb4X>%_X9k#Q-~TI`WXGxD
zFp(B5)@zrOK6RYrLIZ(z+={@{=#Mi~&K1l$jKT~}4PsmSy?jO;)+J<Q?EXAdv*{f2
z4YO(O*+H>xL4}3JKBOfX+J8!6x?-_}<ArwKSG?{xX#mH)@~_)ClqQaCl{~9BwaD+o
z>wTF{yr(x2X>`D%&!E*K^SE-&TG<X)b4g>xyz%QV=8ewpgnqD^zUou~dxH}pHJAU(
z3V}#*lrlao5e7sPeLt)WXP<l9f(zfaBF2tn@@dA9b0P;bFJ)*dFvpZQDI{sh+PpaG
zdx#w}DSL6uJZq}+74*w2yOgk|w4n*XAe*?7jU8(e+d66e+GI;B$5{rhf)fnWe5qSt
z8!IQ5^wiN2U?SEFJ~1=>SDF6pcHu=!Zy2(c8+7>d_R*i5r33q}Ys%cY{8bb!SPsNF
zBed#rfbbuQJvZdm$Lv`oI%Q4R&b2@LO0t6NofmPA?><Ih+z<#krADBDKGPMMGs)<K
zPmkNr%Yfie&IV5PVlsBzmh9p!AIg%-U5NY}mR(zusvtkW1$YRHac07p7$ks1hs%mD
z0*R~*tSN7yc5C-AXRMAd`9azkc`pH?rn+g#jg<a4F1pF_Br1g8KeR~HYpzcRi=lXg
zrY~k)Q!&n&=;^M?{Bc8i3Pyj80~I%FrW@JVM<Yf?F$$ZUxqBx%4W017*?<B=44xAi
z%3hnv^07mm+SZ{v`#e2T{DbD0jztX04(PT4?XH=f7Ra%E$o;hk;sMmSQIo{N`0NNV
z5!|XuwcWfq7Cflx5&x$nYV~f_BV}=z$l+e;Ybsi>cC67F?8!-eHwK0fNVb|@PaMIu
zNifTxUt8SRN*_D)#z1#d0%_w_t9AeCIDeX4hq&(~OHor{!1KMS_zDpA0Jpa}DUxE+
zWOxi@nSmvnwd;va3~!t?l{G;?g~o!*ZIu2w@3T~pz!cBiX!T*&s-{J2asB1}Uz#w|
zvgo3)cuRA%GJ;2L>+UyepiIi(3}=>aK;`X@mph#nl1W{N(BEQ1K23lZ@zEIF#iFud
zM-NAX68)v@yp$tm`{5Lh&3&dL91EonUIw=am<#9b@D-B#z0^drQbYJFu!E!Z^&^xt
zUbLX!&1<|{d-5&oI5)0ztGTT%&ETC7IbB_K;AR}?Zyb}MLr!Q-K~b@ua2P<Wd#1>x
zQ!6QOJ-X*j36pWfD|CLkV|+4pJFuiw)_B9CFpVVDahm9_3Gooh6)P^72oI!*R}`Kq
zHVYar;=jiu{R|saWofzqXJ%gD=U;ALB%SE}m!BjD;PIjVhOp!o%sSM|3HlB!Bf52v
zMY-ospelbhWT(lRApZXB^6jrpW_t&5_vjMxR`DBAwmKD_a&II)6|~{{GR`oW05NaK
zF&@)D2>zWM?SXdEx~D36mP#->hxZ=};8^IHye<AF6pvvW3SStErHnQ_M;H?LS7}_>
z@s{)~>?u>Jaa-r9{E9gs{SX#Pto)Qjr#i?%PcH4Jtc;yaOk=2&Ui6RNFW#c;!!uZS
zI>}+b0InwO2l%*{Y+H0KN_XtXqR`ma@f7yNs^J=-IXICNZh|WJ{d~c%ssAu(cl09O
zR@k<v;Oc+_hRHVp1(p`kf4-)o+3Ydq=8g2&`-&Av)8?DFA|I%}4_Z6bg}FZLkf0H-
zCji{T&a1FfKl@tjhok%d!%|HZRLi3O_`@QMnb4EG(Ym+N?|rCCAmil6!vyd7)q2)W
zU9r&m(i+FcjkRt1?WXLyLU}5c@eks3L;$|W7$H|W-N7UI;{hW~?oZhz;&Q=aNe1bh
zGirq(BQHbKTROrK(+Ni>c|T6tAVeUF24r^`gYsTHX<!1Z8X3hF9P4@w!~vqQu7jEK
zW9y57;U7~JUZ^lb{A}u<;M)Zw373umAwpX{ZDjx^ic+@|nI?~}pJldR`V92I%;H|H
z-^8UzlV8n42>6;xzIBq8+0Cz*f91Zy%WT6MAcTRY0X4Eduq^@wY@T~Uk0h=ApdxT@
zVPuXgwi#4nEn+j?#x#0hFIK#7tZ;%rWL`jyg@2xtl6lG{yk~SF84|2G*nULiMSRd{
zPRMqLP?>}Qw;;2ABj%2<zi6}8lN{L<lCNtP&&xZ2)Z`0^^GZzE!smjdQZhJ?FRlWk
zb>qzLNt5k~mHtuGId-8MTUjCx>?uZ@+epAt9OQ@LXw&{Ji>+k7Ll~WFe|c1?H;UiL
z(KC$%q)De_0Y-E)8<d`h148e}ca6vjcoW*R<ySX?!A>bNR&$lf6UC+4ZWEo$m(Y=R
zO=ll5<0uuh23s;O7h05BS|=-YMbu7nbS#Mv<gJQzu)^hb{OfN4iR2n+nlW<p7ZKS1
zXX>!NjT_^yQONMa_`B%Y9@Gyj+}+vjkcc`<oT%-BR=WCg!&tcHpCz2iOerZB-yQQ7
zr8MPN5;Aft^|G^kUOkH+Z!C{5K?oxO-N7Idg6wY{)S7{SHqS;!7t%3it^d7phb!?8
zb1ah&YUR(!^4GVh7=VEZlJ&UqM;+DsotwnluL&b?*wmBo0M9Apk?j=C8rVHH+h%J5
zo)imk#Fmkzw4P<#%3^Du8{`W)R)1uWmsio~X$H6=qttFR(vojPTtse)P=|k)?zd?D
zMYs6w-gTq1%%pL);2l*nKp1&JL7d2-%Agm-%qxztj3AFobfYAo-gUu5i*Ppnwta)y
zrF)xCM9C%E;IW*BskVo%zYNYbip!6m^5+5|%YA!gu)>kb^_~f&W}^2HJ_cjtU>nSz
zk1Q{&)_;HC>X{(yq0WtdTS!9TmKRtG0*@ugrxW>wSpSSom-ignOp6tR1~tL7d3{AM
z<_=OC#Ai|md?eF+^{SdAjbvC$Yj|Q7aH0FWrQ0E0axr6g3r->&jZS8sqS)ZE!M#wV
zLIX!E91!F<6S1&h!4ZuKYa1Q>SRw<<G@JHO=i4olqO^W3?Se@qyxrfciF>ors=_%>
z7WW-0I+vsRapXsT`>WfOtYfUGaEOA6t+>zk5vu$DDG5YrNyWsXlaZBBbLpV2m<3C9
zX5o>fWFd0$v*||nmb}EH!<FWIywSZ5(gF@Ry2}xL5KxAZn8qjk@(_``^})EwOBggI
z*VIhIajJrR-3g`#qZ7if-m6cPh6_RH2zB^-oTaiOv-IK}&pj4W3~hxM1hIC<ZlU4F
z$0{<4X9R7rpOwOf*-oP=icw%mLx&{x>Lt{ZEJwYho-<J>)5b{T*Oc?--bFuVq&Kq7
znjg$ELdS+asgDohi58D!rWQZES$UsfJQ^GdN0&z@rz00V3dh{pOZ6d#@)G~JBaN~v
zdw_coxglF+#}JzR%GK@j#}5PQN7|MgME2uexn#r#vHU)N3R6Yf3#5QX&?)St!rMa4
zY&B`@B<M=}sJ=zC;?1KI!wx?~Y37oMX^^tX`Iq#N2M~TCp$@NAD?%swhIi7fYy#N;
z`|l7I^j`TajWLa^Ssdkl>#v)vmk6WiV~G)bRM%L)UQ;uwcbN9;!XG09#QL$GX{)}o
z4njl)ScPFOC$Lrf>Bq4<0(vAUo}2D(wOp92bLaiHJj-WbesTQ#G(nh&vFGU_KiSqY
zp9eaS#01L^yU3({7|09B6vnS_tl6r>L9pB#K7}W3@<QvMMtoLJ6;N_s?N9!EY*(gS
zekA=ht~%|TB~UMKE64tbzCt@Y1IrdYW^au2SvwTm8ar1@pR-9UXpDAWIp$ZFm=dar
zLKXlpmcTNJH&wp3C>n(s8syTK*+$RVC6irtermyv5B^0N_#c$LWk6f|_vXuyp0-qJ
zp-7QaJi&@PoI-&nkWc~y2-f0GaffqSq<Db@mm(oR2ownr^b~hXf=h7-?oMxJ-ptIs
zzxmIdyxQ6O?OI=1>v=v4Jg_nRfLIQF-n*M8i>H*}*>+GTg1nf{-e>`16*WHRXuvU$
z$si3-sNbOYS0b~4jytKKVE$#aEKdb|S|BwsYG8^pn&e;b_D{!j5nA$#>gx4g-Ul?3
z<GVs>M#q2Za*BWOp1sAu4{&5-j>_LDAXNuFAPcC|XI{7;$_{5_uH=|ZebJcWVf-;{
z<#vF8N*}6OtB5%Nu8-jtXsZ8bI2@RHl9i+JwR5Mo-j<FOb;v7I-1fscAdD%BF4kxY
z*mFcDzl@(vc~MTkrb9sc4AAixmb1N8f3FYkcZ7Qj@c4dvS}!(kgpj=3@oEsYurKs?
zw+NkPb6bx{q(hX?wmeuaCd`+>Psx}d*$}?KqmP+c+)J}$u)PR1zw`>vq<B9Dn=JI&
zNa~W#Xkz-T;)8FeEp5&1?|tKV4d+CXgNRLnyyvAi053ChW#!6F(NH}Lqy;Jw+{3l3
z@RY;&w#-<*05r3Fb9t!b!`uta$RD|p`RF60U#H11vWn$jn$o}jLu&ul;eGiBid9Kb
z!06N?go<C-Q7q2j2yL_cp#R~lu46d8x@_B3{+K7dawX7#DV0*Nl_F(z=@I4y&&J8m
z9P4g9Q^GvPsXQ(G7C8yesIlH?y2-YQvE8fB`H+1(vTj^cA3^m7>X%%6ZVE1MlL>VM
zx;LYqoF9bbPA>bg^8K+m!zjuABBF`EcMp5l=98&#&1uC{vN$s|9jpGhU3ZPKV0`yL
zSRChDVw9idQY$)vRvKQgUBH3S(p9Tb+Rr1xX1JHL=bqU<A1l)2g3y^|KWBIj%>?@4
zOHO5z79S@cc&{fIF1<hXFsVyVzj}g`C;v<BppItDto707N^3HJJy&b%<&J!@pQ>|x
zkDCiizO=c~YBt6IyHfNo@)jNcp+!#Zk)lmq%(o2@h~8@Bn^}#;0NJ}{h7M&Sdqet%
zFUx+3bH?1!80b4;vhRx}<_GU&t}P#F@X@vJ%k<U;G|^jLu-Tos;LBl6GCyfh(wEO)
znsCPbaj4x`d^Uw|V&q(O{NuM!uoN!(toH2&#jBxVtM3ZBv2Ju<jp5cnjblCpW@e=u
zZfdr47cTsl+5z`~%dKxOjX#MRM<vqKaDkh8UjM>i^SR>BUsv*fZw<)%YC?;#(5-u7
zgPhI?3?EB2G|mtYH9P$^g$KOyi~yhQA%Ft4?(u?DbZH#grJXfhc-<R_?>>9D7~Jp1
z{+SzE$S*#fs>%W!R>z&w$##mm`*Z)H;E7`r5f`)`aQXB!$_rEA%upE+sn7V8jlXdO
z;vqhcT1ok;Q_gUgcP#xg%5b)3=jwAwZ+c1+1Ha5}E$pCtR9VymD~Ox<y%x(WZoj_O
zQTWJ4$K@F6EYu^W4i$s25bGf{k)@S3h}0rJltVd|k4+j-gt5bMq=jK!o<cho4mFy>
zo1FVs2A%aF$`O{>uyWL?yT4-2EB(DAvXNlaOf^s^O|KArYE?R@7SLH0eObCbioGSP
z10K1oKV*z*?QIC%C}%k6BNi78c%6yR;nXx6O;@C?>T_UQjCAP8aIsL{D_NVbW8?K9
ziAuWav?!TZPN?|2kbC**frvtVj2Hd+_2tdSAd#+-zi5d6A(v=q4(o0J<`Mhnuyhz2
zPKS~jo5^&gWGK=t$!i+@q>(7fXg2H=J)pXxinE&~yT%LhW5Rg>9WuSsqCKV#zJVev
z#mv5rDh0XqO;hLW(GmOgzT{c_EO~vtV_nv)<+)p`gJFy$_^Cfs>gZ6x`tH!(&sntf
z2qW_(#e7??m=7hsbx=IO$2YVrs|@1;Ve_!eCP?lX`V)8gAhP9+)fP)_MT6#kBE0Vd
z9SpgPEnkx9$D(w6VwyViws}xR@2{!K@7Eso<2et$clZ_)l%*`oTl20A{j5U5wmd>|
zENrg)o>KC}6bv3ym1_ci+>Xqo!I+IcAwwC>^$xkiHcd%cNs$-C4t=WLFyAdO%*S(W
z`6~L8ny@TFPCu8~uVZ5Jp=en8zHQ+Z`6mrmf}p@9P85cg*?p!%#&%fpIe?U@ZGl&`
zUZPK$K++6-3E^?<`fPIv6we}<%P@xRaXZ)@wl{a9P7y`wQ;aI@-;*VS=5^9Q`c_2l
zk~ft+Z=n{<x(r1%?>vI;{9#?kn)XoZj@a;En=E`wsHQbzetKtqChq!%o}Z=~3u;O*
zJ26vZ|8eWG$BU~m1@`rKFr>+}8@l{h&4jiPar&z+0KmgnEHo))>uUV>%;r~Hiyg4F
zT83+y=0pX^j?QtG!CeI-kZbVH&fV!Bs;!}c(#x6^W`X&kqwOwyQCT%MK>5R7P16(T
zX@wdqn&52Gu4`%)t+{m+@Z|^L7Z@t|xfiodD9I<~>pdR%FH|WO!}$^Io9?k5C}_8P
zAgd4dRt<=4y|M5aiNnftKHTb?6OJiTvmeY-PlPXPPiJoQK$T>KxLe+4#2SHL#C`qd
zdtVY@+}v)~c$HVqByu@l&)>yp>yi6UdolcN_O8aNJ2KO283C*Iz<kqiWQ-1HICU5;
zCSr<@%@@obqJ;<ayY%77!c}fRX}ALgHdD{SSiCAE7r>d;x^xH!I!yzB^kojlSNl-}
z?E;h5EqUv<ky!aMZ$yg^HKm+rey#jZIq~QV^|CL@pqvB8Kns?bmIw2We4^$z4wV`M
zht57l?D*yv(@(dnJQ?vo7%wMeH%oVI`zmpScQn4XRuAew2Q{!yN9cCxwH1#SRtaI)
z!~<BB7{ha>HU?|H7}T#GDUzA^BBH<pPL|Whqx)2kDoZwW^Kli(S*f{j#f$+TLrPn#
za0>%QIp|Pb`9bQ$Y%BbDlA?)eytJ+`TgTo@EM$liY2NWXNL!*#QC5Gn6s43rzUmLM
zaOmWCW<}7{jgKjYg?Yik_<-(b#eCj5CpYc8@jD`HA^MmHZF_rY{!XMT8T-xGUkoaY
zRDw&5Mt^imbkOuXr^nr|9O&7xff14xPMk-wT562%`ug`wHw1Tq`f{zRCE`5o$0ms>
zxbRX*BTuu^xnc;8^V-OFVO}=y?+)!h%9oNH^Q6>)qSdfB4*B$iq?xi(+Ct)R118N>
z;MvYW@XA-4;)lZWA0?`@*R_5mS4<2T8Ur;ssnR^gZ#HV&-C9u%ISEFPf>-K0-NViG
z|Iobp^MrH7TJoFTFD9G);$H<HSr8JQ6h8s}WsDtR@JL$y&6uK3ids9M<J~1N{xXV9
zLv*Okpag#Tz`vT3W*~JH6)uaWz;xaDA^*}c^3%~UzNWHEo&k?v+s4D>yU)X51qUiu
z=gcBOJ;k~TR|JMT?8{F&NZD$udJI5oxN(}x&ZNz$lS#I|``0WrhE?lgUZOLluhz%g
zwp>ST+WYqobi;7u*a}Blx`+Er=2+OIt{zTmww&@j7cx7G!kP=}SzMXStK@p|=Id7<
zYngF96*TpM8;pvE>hDt3g6qQO_bfK#3vu6`O6MBRX^RL=iqCRkzRL)6#ko02-)pni
zr4wP@_PQgqd`-u&(-JzHdI<*x<#rHnP|r3N^pfKOSGH@hL65$r)p`H+sI|_U<G0Xo
zF#Vsox0VSlN;XL@p8qMrso1jR2A}Yue_9s}uH@n#jZ$k3m%$jEtSP!JsJv>Tn>#cA
z;lBNu7jaTt5fba>QFLB*OLlRALs47RfDtHB@D*<|_~@=rdkg=}))Zy!?#1!(IqRgl
zu5*uk(`+q=>XTwT6kBy!890y-sRd^<__}nOTyd<(E^pbh-0NwDdCv0E&<>#91V`00
zjQC~y$MNEBTkWLG+Nu{)i+#kJFPg66<w3!+hswq>aZ<4?l_;qaux4`iiVt3(PZ4CE
zxBRiNigUn7%@rNzjDK%GSc-Rk<>HwSrJE8U4XLn^EExw_k~{My`NNZz!Q7)j@UL1^
zl|mK-r=94>lNpG1X{)zsN`G05t#J=NyrC14B;+=rGT^nka%1As-mm=Br*NNH>ahL{
zyvAStdc2%qq?rqgbgqn@O`HpR!!7ui^gB*y$6cDDiu;K)*gva)M>N2d;pYSznDNIX
z-Zw>zu-DP|C;k5M(-broqgHEqaW-4HTs4W_NbZlUNS}9xk&;ZcBeW==Q-glJ=|mqN
zURqNxJ~@*PdgM9hBAeVu)FEAlc+*a=rUklP4BFi%mlBfeFzT&S_cyQZNVB@Ed{4!(
zb)l|8H4u2p0L<}ndYW})eAhKi#~$20z-Mn7gRF88>T1liNH_3qSXtE@F=&f`?CR>@
zP@T*n-6qcr@8gs%N()eVi8`iFMmQTI;f&HYX{W9W<<=a(EhzW9Rd2VueSs9>(VAWy
z1`Q`B@wcv|w{i}5#IM>I?(JRCC)wkGdb1iMF4rmII~@r^G&JzP{&S?!QNb;pAQ`+(
zj@Vz1P=hgbJ`C;e3B-(#&JN_G5CL(m3RsxHl;HfdAm8NK0IP{X1l>L5Lk*21yCr?p
zg5?meSG>8;bfk7X{l`(yf+n`EE{<^O&Gf0rIVxVU-A(h6T3rDJv7uy!NpD|tlgZf^
zP-qFWi`Pq7!tc1fq(ZZfX}@H0AAhhf=%d;$-TZlq7hVGK3Mwc7-q~1DV~Rp*Z3R!3
zks8Osc7j>w$Ii(5+~?x(rx*C0W+snAS-SL0m$<I`aVGL9i$1coap`dm-mBT4{@kVW
zEGX*~nk*VHdZIFuNU>ltVP+I{4D6T&YLZH`lSLg1J`<k!|6-)5<!Ja1WH!aV+Mppw
zz3c@&(z%2=d8T)UX^5{FKK)$I0fNt`UtFpOzS#Op?D<G29A+Sp`jM7*i`pCpp8mQq
zL(8k0^!_Q}K+WSDu(fopu*2uYm)|FTU9r~D82CqQ<erB~6c`HK{_;u~f=a67HukY*
zNbb;7i~>#m{u=H4Y_aSjQS~q8e|org{?=Oav99E&-cobl2K@b6F{<evsGzL9KC(dw
z%&0S`W}3WWEj4YidiCNSl9*)UPi&}UI#T!E*(DW~W_^k5T>=Ke*Lj^qEIOT4v+`Z6
zb?s*rkNC4z&SNz-QNO}994oI=J5KVWy6&p%<#I6ipVVVG$jzEZb<IQG0c=xde5}uC
zpJ^iSR*e$*<eTWUi%0+LX))TKSu6ZOn{B9J1iI4a8H5~jZe((W{y5{ipWn78aqzaF
zv}|Yjyym>dnFjcugY3V*{Vi;2i({(p0jNV-?twnsq$WgtzT$9_ocZk(!%E!n*u(=`
z@qp1{*5OPOs~m|_C5ZV0g+G*<pXE1%&bW@vH?MK<t)SNTLpC$|qCdA<prHjANDa|>
zmi5AyddO?{KF}y^2TwR;M+iUmvdU*7fVL8)hn&1x>jH(8C?Em(9hclt9QYG5f5El&
zBI_YXEBRJ7J~O*SA%PUjM8fdM%$lvaxK?*P7i(;2TLhBcw$AqX*gA5J{@AGZ1blDk
zQ6D(A%==nYry?4g!()NWYD(+7^t?$gUhfp@;IoM?gn#%K^`;yaXG)9rlyrNF6|n!B
zBCELE3G#YkgJ-da4=f~&Ckf6K0vb5q!!D$Y2kSc<kc??%)=PrjeVVtrUwq?)uG|x2
z)_Lo{^D9Pvy#@%-5jazWtV`&>-p$qd3%EQM`^Se!Ak<3lF7Q-Pe@BPrUtv1<UtsWx
z$OoPZZSR*R&Ae1x8GR;!zE0YE625gSGZB$CQ?`R})z-0ocDn+`qbq1U!-?mywyw*I
zgEZ8rdK<iB0P>$#m@Y4GRST3Zn@(ju=hrtVGoC%<69zjsP3XqXQN0a)GcSHEk#Bib
z=}l7oMbg^NxY)4t%iwji^)AqHuglGAEr>Q|n=&n~k2*TFTs;!&GxD#}NpF($S{=-}
zvmnzf-@(7PbzfY+=-AZ`-I%c+<LkiS#!x)mHi`n1t#YA{4cvpCC|yp(b&YP-J{Ztf
z$Iz9fgy=Zr5mb~ka}2f};&N=|<v(qW(}v%^lbO>2FHMOmsBal@m;3R5;IsX*C~w<#
zU}<mpXLU*G{He%nutu$HP;RTB`S0!O<0#2FjUJr&=;ln9ho9%Z*XB&%^wvSA1|bG%
zg7ZFSb7H(>XcwX_;OZxh6(7k@Hu%(#+>B9=)vzK~t-7sl5|`H)4Ov>I4*`M`epX2R
z)0y=J{lM3itw_u&;c3@5kq4>|V7)v08Kyqw#hZKc<I#Pr_tn(1eoQsTwb|9CObkTk
zm2?TX2v30&bveSD->j0S`iBBn%={<D8GQ>yn{KJT!LJ(418uxYAzM#ycX-lT5>!}V
za7PuO88CV3D&|;J6jIj-p)ZDfKaSUVCnkx~+^`)^cqru)7vp4|<{3B={Tw+l2CtrN
z>{G9P+U$GPug{Zq&Kd4DYGBY5)+}@N9V)UblGf$=woY;!xtLvPE>?z9?u>IXatw7u
zX-zx5RY@{_7(;4I)3HdLsjDUEJOm=d647VDsv__DKZ;8bNe>>V8%Lvf@o`0YA6Kx}
zb1BbW(SUB<OKDf@({_(D{Z%Nvbw$zpSMJ|eU-8*heq7zz`dxbXqwo_{k~Mu&W0Xns
zjPPR<eIwK9Tt9i<c83W)31Nez-WucB#7aQT_g}%lZtBKZtbkoGj!CK{2ESI9)&D!|
z$$`2NsMk5JWZK9;vGt|SG35`3;!c3#{0p!U#znO-3xT^Pqq|GUa&R?uBRtcJ*(x~h
zFj#eY+Igp=1P;|b|FsfAxeC=ViZ4n0WH&phAmP?jx*%i!3i`A|cj#GJre2cca#~$S
zknNfC1itO%mn8+2_#3%uSM?`|kxy$Yd`Ac`rEr@6jf>-dtc1Tj0Pv<m6j`kP<`C<A
zPx)}=709*?)V;~ffh=AV4UTO!BF4gjqQxv=eUaq14kw8Ra%|uJH8TwKl%{svFohd8
zA*!)$74cz93<x(UgV3BXCUMAY|44eiOD;f=N6_-47qCQPY&ev&1#)*$>|glzp?jap
zpM$&_la|L*uXx46g^|`^`&qLgH$1&nWp(<YMpeYnuDK*~1={$H%x<qX2@wDY7e*;G
zX{${M)174UO%-(j>%0PZ_BGN^=2!hn#2Q_999u{WI7I~81B;Pt`4|ju+V?45O@WGA
z%cK-_AY`rsTuNzGVqVXYs<!d#6fgvVm9#B2LmghV8jEKkVv2?Y@!GbeqUsVgkGf+0
z<eK3jeZ7L+XEPk8;8InG(fICxSnx15nCCz!O=7G6w7)FsP~6hJnkMtWWJfbIov135
zx|-jwSK%K0ljeaWMc2*!EbT41-Kz@idJ!%Bg5%tE)y54rdk@81Ln=1q-+v>-%44y~
zcvtA5`Vfqg_p!lVBdfO!JI`0yQs+~iI}px`yrGS3c~R2Ty#HZr@Wk}7Po-EXc<o5A
zf_`4A>1{g^4TFtTrU=Zvx?YA_oj9&C>Uyj7Fv8$)<4S->2D0%p;TPNCdnOUztlwP$
zx4$w1jQpYqVyI>K!V}@r8nu~31B>VV)4$%O;V;Dxmvv`NJ_$SZ{)<;zT!_UzShL^L
zl4&dQPhB*_Dl=?38ugB9*<zGH8h=~0Ej`v*f16=s$JxlboD@uNw=7&TB6j~!Cq}Hp
zZ~y@htB=oUj6uyu3WtIFOwR=U=NB{{Ub;FL8zeTqL}HBQah2tl<y*d6s$*T_KWRQG
zNY^izs78Vu%}VW6M}fPWBDsY9!RBn5TYvqJApPGx{lP98<~v9il}kUf^2d)9Ss?>5
z*BY`AI}C9-IabOGZ1}7jC=$Q)(m^WTcMU4ws0h25o>*AT5tya|{)|N!YVXF!-kKfs
z9@sk<$FM@IOK>{=plmZe9yrt)1iFd~|BX@3JJ;-*OUdk0T;^4_Lb>**MRD|V17wMA
z!0c@P06Y}1B%qSjfR|35HclAR{x_k!q;fpi*3Vnv#9E3c?@HxIUzZ2UD?DX~Z0MOd
zx^i#S8&!|GTNP7EPSr!ReCy-c9Uh0J7u73i6?`BUR7a3X>+k?MchA+b9MX405=LY@
zK%A_%K*ZhC1O{dVFbRB!0Y^jW(r?Ce{)M^uKZrq&WgPL*h2bKKlhLwWXmS}q#it%3
zW=O(3skUAp#_0sIT<pBg<(CHwDNA^iC1UycYGSmAFdr>qcPQ25_enVc_g!%`n2LKz
zL{M)nOq+T-h0~hdtE3o;JfU`ZU?LSjs&wY**8XrVt`lvTB`a*sx!10bsh-a#H6fys
zDvfdy61{AtaVfc@>O!6`;zNSj*GKNF0k%bK+{o%i5dZrSZ{kL=^B_d7%KX86ZXv_!
zxw3j>G_KasW(4T0=ym**HZkCP-gcfv?{ERSg4bzkgWxyl08p|)kk@oH)Ub2_S^1j3
zeu2NTt;jCe&6@!7DGWhAzy9+M{`;0rUoK-1m<ja{juxO)TCgdD6*6omy1H1Kstpg#
z_3V_fQC7oQM$&E(SGk%Zq%D%#UkUMeza*mN?P|rf7h7~(@HGSt1cdTM7fkgZOj`%6
z9}W+gl?D5|b0R5z%(e<-?yD{^i1&gC2p#bT>H`}Fataz4ThZSeUbKDlh(na5_~{@9
zz}n*417>qwZI{1&SI$0ZxUJ$gpz`Tb&2c+f#FnzvG&It=grcF*``^X#|MdQL*!C*j
zXy*^#7=v)oNXGhD#ZQ{q1I3Ynr5S)*Hl6Y9H1+)I;(={uA%pE5+vXrbmo{T?R`1@K
zk7w*iC^wG3uyLgG`(i*z`Gd%4^yk6@s2HVI{_VuU;n~T#aP_MV%Zz9^HpJ3DF>YH#
z_YYw=lzQH-ZTHdMzK^n+bP4Oi0Q16Lp#zj^n<+xp$9QJ%`v^F8ZYD3;gZGbshR!mx
zyyF!mIjy#zmgRE9azmfAlS;mBJEDM&IvBGI3=F6fnD%eyhn@wVIpY54rn4o*`)0J|
z-g(3n<HB!)DuqTJTjzdR_tXm*Mv>-vy3Zr>1?u0{8VWVVJnkHN0PTH<m+Vny4I-pf
z5QutvdNx<m@n4HSOa}EvUSOZK?Q5~~plN%>uEa;uDcV%>b!z8vH&z`lkG^+~(<(dl
zt38x|0~PuXtIo^t7s!W+I}Q#yio1IAqBYfO^GxFMTi=FwEKh!V9#L4B%gEzwh5@mb
zLru`$(*el(Or%BG#1yFrc2)wumbR5D;}b;F`e-^H$_<)qJCws>Iqn;0UVEy4?ga2z
z#(Lnv!a9)kQb)4Hg*LEWqSL`FZwdOqgZaLa&yS>*-00rk`V3=AIB#~_i%;IB%gw5&
zJGur@<5<~=4ZvFr%5(=_w*Dc#A)jIN84bLEEF&wO_lp<BI!?bqOe(R#TMcNzS}>!V
z6nK6oF>`kLC6Vv5@hj6~A^L4U`6|wme7@vSN6mw}`iWvS-xBMCC{m@kV_@OeasYSZ
zM6u-ywv40$S+TO^on}|}v^AlO6KPr7Nn*BA{?v%M=pzQ|2L5!NGmb^ytTs4&Do`<K
zTM2z^JDIcnG$iO_F)ZZ4d=8iYcMKXRTi=ro*c<fXPC;so<!3PU6iW+C-XjokDp^uX
zw;Wwpt-~3D)<RU}=EMu9D-D8Q4}c#JaHCGtCt6=3xMO6ZvQ`Y7lRu}|={i$7^oLz8
znfJwe6U`Zy)i?`w7gqYa_<WY7+?V6l-k)(U&Emel2dYZ3KiS2W8FArqlDy4Umn};!
zhW5IuIJz&DD(a%VJC{a_1#s`Rce;*)n>FfaBv${Y?D;Pr4`z$D8tc&dvETUx!LcQ;
z8hnzc%^L9s>wdIe*mo6=Zb$0_^x|iV^UdoIHOB5|s)qfjE90o^Tv&j!mNy2muXik(
zk3$2KwaR~u8kAc-ARU=s-ELdDc_#l^74oDc{U=TJ%2I<+>_SS1FlPmmp$I*1dSXN6
zX3)4wkA)Yh6nXR9(<a?zPh2%bPbqqq3D>sK03Nb26X4NwxA2QU`;nvcTKDaR%hnKM
z9y1i4xb7hS{xDl_GTn^36VmHGVy9Agfl41dn$e=nzu6{<I#99Vqv__}CpJ8>=nTO_
z-4sb~ov$4+t*cO+a-<^<X`H#!VLvhPz*?YpxK>KdPvP|ovr@DSJ~*~eWUCBF+GqMK
zoKQ4)9moT`=s}oAx_Fc<I1H0Zhp#jfiU!J@^`rBxAHMhuI-si9+#DI&xm>SI(5{`k
z=W*>V6rK@gKC?_|)ck7)b!VrDXPv57U{9OI46PN5I=lnf=AfwXT=Q7Km?2wO6t0~X
zOUwfC+#!Gtz-yp>OW3~1-t}uWXz4+#Ff1^!!PfHLzYe783bCD~GkE#+!-4xe_XWj9
z3iHW_!E2yCsk&6NN1riFi=y;bcdrDD{j(fC?50N<IBmV>I0_nYjDTSto^r;l>>F-U
zx~kIdGsy6q=A@o=2`5+7%NS~AMhkMYZ)aY_g8x0IvpE8<sct>4_scN7gG)q;sQ{##
z;-z(_(^r>M7DBj`UdTv#4yFyZ4@vrr*m;yyB#;9WGM@4-mhBcdOU!Cmm3dT*Mg+{Z
z?d)7s-roT+Rmh~2{&~E5@t^~&hn{ujExX81i7Lux-;r+`=pMi-sJ_(+k1k60!;V#(
zo)g67Gm1!DJDwjTj9p$vyIPhj5X_R}7=kuTDDTb?MWhn-k&S`)ws%XAV(4hj2pdAe
zmgh$(dNpC391D^AfMH;21qxVw>0(+L6IhnZ{<X0dtW+AXP^n{3Qoe3mR7u#O3&gF%
z^rjFFuD-Nbr^-`C1xY(ssM%DeTwLZjt!D`of^TSE35Yyrv6XxXUF4G%I*}bW?2BxY
za|Q?wsaZZW>~N5OsxKEeHT~KGYXEE@AE+{_IZQI-6FwGfdo`v>0v*nK!e}322ZXrJ
zlhs|-WblxlL#380)*rnQ_d4C8zU(jB&Wt(-b?=OqR{x|aIJeeP)Pf5<`qcJ{O8NnM
z{vh;1dpHWtl<%Xz*GWB%(5cZ<<hh65S8|=5z0B}%`7e|B|NZf$TZv2g?e-4$aMz@k
zbyxAFrHlv*%Q0li$Ulb{4%=L6{5*>Nd!uiNx0f{JwtFV&eAi2(KKiG+-p4O_s`w{I
z4@U~yfs;Aznrjd|<SfO{IE-1woNQeVT(JxWx3!rn2N?qkYSq&{jmHqe;h~9ea0jUi
z+4-U0h27oP3IAlHAkOyizBMq-QEKWE&ycQ&GT*nR*y6(TBjXUHCCSwqN#?Q#?0o8l
zNzjZ#^7E%Ls6}G*YF39ugW_!}<E}2mi9FuFqPK8m{>LHgW8x-ge&Z&*z=Bwz$FE5z
zwehMf_FgQjgwxFcNOIs6Yt&gb-#iEeebD?t^H5DFDjP2<u32E^xhn2hkD@QlW%x<+
zrsOPLA|<ZWfY2Go-pr*XNsFIfvd14zjA&FDUX)AP>lS36qUMRGasw8HwT$TJB_ELU
z26-a?giA+hi>G)*Xd9_HTqTTrKQXvpnB|WLPJ1>2Zd!C}S!ttU<)m~F{8M8ZprMP7
zmIdGY+%KFes$bxb8xG~9VSBDYcMScbXhlJ4?sdI-rqX_hHFeOAiD~lJ#c?5sdt5(?
zeynI|+AT&OtW%6d9IN*XLu%O+Vh*9g1BM5ursr`%4&rELkYJCnhMa`Uu5`I-)#s3r
zgnwEouw~S=tYg_rOUHT%vYh5c)hNLIP_#s1kICM`aY{F;-YhV7<l`Vk(N;Lv^dTPu
zPQeE7-d_2Zkj=UI_3r{numTEoh5_XmnKpov#<oOhXhzBqV-<Kr4mJCiwc(S~sY?cJ
zSXs@9BUbTSQP~^{oD0m#kquO3<@fgs>XMFUC5rC&yz3#IkD0c2)g-od{AE{q$CV=P
z7c+Odcfujc1ip(b{j0%<Gs6<E6#lWW<|147?5U>+FMDV0wzFF4&!6{WARIT?2$E)I
zu|nUnltM^^er#4?;+1%``ML!Pku;~(0o0=eeu!z(87j<gV&_pWLprFKAM?JZKtt#=
z4it{QG5I+riKKf!TbEP*u>|a#NxF_>(|EH<uIAp^ieXCcX*IGaO+Jyq*M$pvIBq{l
zL<po|E#2tCF#1y_ao%#!m~wa)_m!x#pOZUAf2jS2uP?WT35?oUD{81Wp55tP_y)!f
z@YsnIeZi-PKk?dyng4o`@uU)uvkZue5n`|+a48ygPG;1m8Tp4Sr2KJXJ=L>Mo6yA0
zaldy{1BRgT^E{5<TpImo37ueHsywbpjD~eAT60g$iSCt`S<X?<!2egjUk-iO$BWKd
zo*Xln2{WaCORUb9O5Z338k?*TYlVC&r1@v(znFA*#nMe=AV2LTPD+00sF40v*L2sZ
zvg&=W7V3qY|I+|2#6T!~tTdh9w4vdP16+{me!gpok?9)G&4$!^luPz@SdAA&sKl&h
z7VEkW@_TR!w0o}-NHWvTVJq(TLK7#^uqfRoyscpef}X^g_*|V`AS_}uHm`ADQ-D9g
z^>O=WO&G#L%ud%a{fPk30XDB1;WeJBGNBeAl~Ch}YLpXy5KxjF^hiX1eJL4C^5_D3
zLn!YSpT+`pavzA4#-Tv`9W`6YxJ-3)Bo0_PDzvfgF>Yd24)gp*%=7{G9NDt*Q?F&-
z;DaQpDSw`!`XvxxB#S=J_F<Wyti%;;4IHeI+yx*5<Z|Vx06$@MfBGs??0Ewh#7>rn
z-GJo%Fwx6|pvHFo0e56(VC5wfNUd4%G1^+9Y?*nz_I&Misr06pf@)K`IoWXp%1ekR
zpW=!srCYO=JIb!C-?SL%g7+oDT-ct4;YCL}gOa6nLP#5IO@k)6#ycyLu$>Z-hu2Ii
zcZA=pkzF)+^(faXe8=JzXnvRjU^V&k?yP&%IqR0*EMi+IKeu;mDO&rkygAQ&c3bf~
z`&Jj6v0gEGtLedLF*I=>BI1z~-O(kC09BtlwSgBM<Z7e*5#6Pn`4FB{PlgC6m0WwE
zUPMfcPKxe5{~IICRCDrXZM<k!R_fev^0S{kh$>Be@I6F)$wWS4a+>aQD36Pdv*}eC
z!)bHRkC5aO?XU%BdyPlTAWvkneUP#IpSP_3uOgC$hC^vl`I^Z1ljaa}UU7HbZn2o^
z<fiIeGWd?g3f(v6b7JYyzSHT<!8V3{f=Mg=!?S~4W6ZS4BQZ|BW(>08Lfs?JG%b=y
zHO}g(PDbLWd<sDEO|ekWJpn1f)DpZH+9j~tqq%i6@E&QV%$xI+lmJSB$sL;b|C7hr
zs8*J$<~ukuF7T|+8&cYbwo=tFGTD+6ki_+q5;7j}*V^)UtvbCKE4)WvujQ|@c2AQu
zWGcy7vh~eLziMC}I^$mD&*b*-*a+8jUoz*|%5U4>Zzba?L@$@y!}|6kRjiP%Db(3N
zE>jp6Fx8(v8)v}iys*(#O7)Bn?Q`6>*C1!j@#ttbz^fotLvDZ&xIh6Fgmu!U2uU@x
z%FB^;u+r%tr3@n7YneLABH82EUD977<);YgdtK%p4cdkxst@>y`5;vV*M@O#m)1HG
zCLh9Q+2~Q&iL~8UlR2V5g72zO&7^X!y@()<SHAfa&nNWpqQ;*rHX7RK)~9O8caxt-
z>rNS65w#B$y$B4xKuLorkr8=TtlLsHS7iBpJAz`_qIEW7Bxw%0Jt7hBbyaomjN`_J
zqwnRWt>jM{ohah>pESVE`3~@0rFq>&;5|Bh1T55Y93H@uN_)4UO5V$wopG;kHOA5K
z5b0~Gz^RisI4)Iv&aimzf;!Vidfi*JM8@C6%a+0U`1%pGlQ@jk6yk4*I(_ff-30~e
zgdNXj$DdjLL#=x)m`)2n45e(6OR+bbm+Y!^g5;cpW9=WSzqCc{D{=8t`HFCfck^$s
zEte_XUs^aIG{0&6{eKsZzqOu(8OK?8;tyJ``B!DFN!#8fbP>;Dk`D_qjvLH#TayTV
z<z-iak`+jd7iy=5j?s5I_o0#Lpw|=?iy`VzZB_qFTbE%}H5WG6Z&}RHAPNmk(3kp*
zYr0sDl8b{mf7aDX5z+)24i~6tTuTAo;K2JaEH1m<q%v<Fu~RYN>49Kj_SS|#yiV?b
zKWdjdYwTlHhby;6z$5A+S~p=;LJAl(>(_0Vt))DyR=82&iOXk+l56s+<to^SX4xpk
z`K5CKG#02Z|JNqA4E)u^)d(UvA2BHB8)!Cy{YjHLE`h#Ru8R~)=Jd=;u2^^5#hA&C
z6?XK#o&}jY=}fKVlx1hjK+CQAC9AOl88b&O;ixqc-RuT`<Ya$WV||F%AoU`wU;(9z
zIJM&uymE6(>?bu2K9e%q*Y4r=b`vHM19<&5v=u?xSi*S9!-X%1^u0bQ-jwqM>Y=cl
zO2{C?e$t4puQtwVsDE(Fi0|Hdn?ExWBa5cexajkNdzm%Sgke}rjor3DHnWNt%CO*Q
zHjCc2^}G5*SIzj{Kb!Z3xW(FD?4>mv)j&|mKzjs0L_7=EJ;htbi{h^Zl&cj-dGRSn
zLDH~&cBy#6gW`5L;m`TZ7*qucb9zvgFq}W`Cb?V;^9YRDG+f)48~^k%z~LIIHM=1W
z=Y{Gm&uvrQVFjxTufkJTNvIV7N8k<HyXKAw>Uxa>R-o+tR+AhzEPp(Kp>i4gKm{pj
z7oUC!i@P21{@a%`J6J4_O9Ci3EaqsK=8v@hyV#?-joglv*K5@u*XM6>lsvEM=gZx0
zFj6D`a8D0e(2Jq6F-Uv8Ac4$=i|wVes%-UC>7ds=^RQvmm_eUqmUp<?!EI@_G|kBw
z?wx*vHx8(OAzP-<O<kdmT?-yl4Gk=v+)Vx<y$+g;Buvt0;@_CqT9<Xmx6k%5uOIak
z8^L1da9g2rHOCCfPodi6s&ZjAiB|-{QU4|tulEo$?TH?P=L`#&L(#$dW_$S-@dCGs
zk}{x|M0_~sMmb%aZz=XQj|FgE%DXYPOKxYlTn@S)j7^f4x&PYjNpBJiyv-gEs#_l4
z!7qJHoe=|{3|?z!eP6U-k*iKCkg+<zB@E5A_Q;j{ki4&sAfY6^s$_gj&!SoplEc`P
z&#<h55tAFPA##As@|yU4jGwYjWpQzYY?jxtWN-h%e){A-UD(mbi<XnPY7F{<-IBq$
z2`iUn?cV916O*a#A|q?;z2(M`dz-I&eV?UF?}@RE%rV98Ym?D@N=gq)vGi=mF=_fA
zpH6CYioG1Q*NF~#5GZ!+w&ynba$m|jUPPM;v1JTpUCranGU}NYwq5poxvvvDmlznk
zDdRrE(_L?m{1s8jq`ze#{(4nw&Cy-JLkMK%oDNi|aOzx6-WsgsWM32D_`C}|bqi(+
zGAd_`)LXB;z39(3yd<Sw!4z>V;*k=Sm6zu!`UKBIaoZdcckQnbr1oY$-dIkvKMix(
zzkKZg@_M_kTwrt|bC$9f|9gdEX?b*_cia1dr5k&R6r$(}5u?mne?jw~72E$sIR3&k
zBi8xOabdQl_%{7KU(eN0vV5@&$OtF28f14~YyWcSZr48TfI4>9VqSjtm=L#iva!@s
zx90w>KFJL_^wz7T+GOfOy{vreEJ!)Bc1JABh{rL~Vohn=)U|uS1>R$!r^HkKC5?<c
zpY){a`UmEWQ^H<XH-~m!r|0V;n=O+dc2*uSmT5iQHrc|^eN2Jhd5mNwULQXizxrZv
ziS3DNe}5yQ*86pGQKhKAW31EEsygBf&1bdqg#f+~3PlX$7sM&*vKc8>GXkcAjEtaD
zLLEDU3B9<|?ELi+l>JJ4!+piuy1fdM<8AL}ERbB~35CyP^pfvNGAt0KbJ8}yCFujy
zL9@mly(4W<(G35ZW_m9f7r>8l+WJ;w;{<!QRZblGS$4k?8SJ=NTSVnGnu-t1`d<YS
z@Wx@9N@x#CpQVCM{Vdbv{5{+3@rF19EWEoXl}EmzLfDL#O;I-zn;e=VYv&iJruj;^
zbZgPk25WT`7m?kmc~PP$?3kjoz_byfB5)aJiY%O#Ucy{6`KRvf55W1i`#P2#FC~}g
z3&;u6TQ?7BC2ipdsz=^^h3Af}Vq$}QBQR#+pXkJD^r9nammQjw+WC??1M!J1#;6PA
z(88r+kHvTjaT`I(#VGa{kuMqq((r_bNTiQFZ8E2TW0gdXSS)p=d{!QrnU`28+6!qi
zwx(#d1GNTgxs=4riBX55Cc$FnzaEPcj#%p8QiTYq)ybZcqc`JG*?zluFChd{wXUmG
z3e|~tsk|2wt{_d*>2}vt!PJ`Ryz_3sjeAP>1z=!{YG5^aUUkOKiu0$pWS-8fO**gf
zjH_t98UFv(p!#2;m%3Ee{6cEg>H6-dww!ZrHneu0T?!X?pv@eHjVPsJD^09-FA@i$
zg-rv)FT`R(9=DPgCN3txeHTcy<3Zx`c!{_T;rj;ai8q~Y`!RFC4(yFEa#368O@?>1
zbBMUaVXeK?%Mkzpd_~|KvG6jPkjt7H;7t_fs{*6KNafGAVv;&#vHVktt^|FA0#Q=d
z=7=~a{LvBaSDI365Lu9XarC&P6*gOQ&h6s9<}a$<?JPo1UYu(Xwj#ET74MB84U7cX
zKSk_KdA`GBixm$XNy~aP0Yck)0o1{kxN1fbT@39Ac+#oypSST+6Wuy7XuHm>=HkNP
zOluvZuk8XLYUxvg3*=Nj_8o>If~XMFCM|MIb;Uz==9WjxV)`s&VvZwe=+LNayTO9@
zgLh{G%q^;hRD^Y)xChfw4e>Q=In9pai#tLF%rNN&n3;`aR7`ahc*Ox8X19vr;Xl^u
zo-?}04h&)!a4gF1S92h6t}NRkOFi7`dXx54%;=AUG`VnBvCO+zTSf-?MT(zjoJaBj
zbwq#>0)Ihq(RjGKSU35T2AUZ-$t1bxej>U^kv3A_8F>Zu=uLEY-b#`?War?y_9{e~
zsB_#u!RpvhkCEi;`iG+mU5^%q9+LeBkEce087{NqGOJX?C~=1e3d!4w1+Bt*bLnNF
zRNW}sn`3cD7`0L0u(=F(ZMEHn`4|uoby(xpe)vLcbkes-3+rCM-7JU1%dsPIQ%+)f
zgY##UXAMa!qk#bLuTd9v@i17o!YX__3}6uz0?Z!C)<w?Ft|wT)u)RIPwzl6C0Q+%M
z?*MhHXq6DVVlOW{hw}f{eUgRyG@NsI-!Pq6o^#laiPJ$Rw%ql3yh;Jr6F24K-5dRG
zJ2#5|(y+1q^}ht||Gz)KtX>-ZtDLqFJRTmlkA(N#aECl9S6wafZoY7duVw$OrYY0Y
zR!Qh%#L)^B5u&SUdzP|!C_1h@jbXE0@%w$J`bFuK^n1}PyebzDS4N37RA&XFX8=sB
zGT?v)rgnkF#^yQO%Yw8dDpx;gl6ucPGMc~xE!^Hb&pYzvsLsKApPI_XbImrSv99EF
zfi7Xryqi@melVhmZd7(E_5He!-&TroL&i5lK`+fl;U{HgO|yB|ljI-OaE=FaZEXNe
zkVoZD8YfDrH?Q)(aO0>nQ@PxV8M4yiCD~qcP`L9#4+{c}BD^4MzGKC)P?Uq-n)a?~
zNYiW54>BOcAe@AppUahAJX!upBmM@>0EYl8bPfrlm^-af=Hf}3Oc@`rjCV0M>11UI
z*L))*hfM!6RrPPb@0R?AaskLWm}z~7i|4}jU8L7NjdcuMy8GY`SbQU|K!Jy-p}!#>
zAn>;RpqP!m3Cb3z<|L`1`Bb}|kWcIl<<N7hi*6&|#LiT1OVk8CRP-n}i0-4TjCFRF
ziV^)=KKCVW<a(|5W<leVco}d7H#XwzJ<BILShchY06(B9c{LOA1{P-z;@@>s><F}e
zHp{2|@DzFEZuVweY+QuTBkf{o;TzeFoSFQkX(ny1_1%U}rXH7{bZPc75ySG~?MJXc
zqQqM>sSB=={=l7!u}JxvfmD!LQoQ=RVwl8|Uts8P`@r}Z1YmD9K#-3$iDr$eTf5i!
z)Wy^_m)>Cvdyg>Cu<P!R7pQQg#X7o_#Q+mS7WGaDVxIYb<nv$k8*U89Zt0|X2y3zC
z@D6&*Q5^~P%nlYW9{L15PCrIVqd+TW0cqKxop^@LUK~U}aru3@fkb7QaWc-pGY2c5
z6~E;oj!#`f)yuGGUra<hUsr63^!fBCb`P0~Ot=haSF_sdW1(k)JQx^-;(l4Ne$m3S
z8Z;OG)Tq*elRAm)$@F}#8Qb@lfgBOU@9zLWJ$oFZ)PK_xBFdgiH0o4QTt)j13y(;7
z=x6B;8)a6RVYGENvw%8GQ%!JZl!=<N8FNUzTzT>)#nfis(wFXTryGnq1^2{$_R0TF
z_4;3>oJ4w+!Cy3ihj`O?U$eu{d);&K9q^Clw+%Q%gv~O1+t2fNx+1rgE%GCW;udt?
zmhVHudxPE9uWGK{{C?7~$?jg1-(^0QAZCpWCHw31&?X@H812=;14^;?!$3kh$<tGW
zWVb%4NPVkg7^kjBm7|`6sF46Hs(8-Wpg*@vM>ksSrDsFGwTxtS*>$X_Ws^z{b#$Ee
zUI*t%1IVRysYrFV#S&H(duBMIw*<BCx=f)s`Z60!0y;I9-^aJcN{Buw93|kibQwQ}
z145Sg`{dyI3;QAlRc4sybboiebA^lTQt!kAnA-Z~Yi(0aI_C8&G3MFt)Nu>WM$<Xv
zx>BX_9N~+yrX@mh`RMsqL|qs}u~eMn-<Ng8pi%d>p`SFJSIQz&T{-P10iPF)QO~el
zmu4-zHh3<KT%4<EJ$(~Cfb}+94>LQC0eTo0^M>=L*Ne?4KaVL!92Kb>$@U2K3p~)j
zp7yWObC6sWg=mtZ+V>th5c^!yj6Req!Ix`Hs^xyI5bIMrUuSfTXJ-rhq)mt^$RZ}!
zSXa1^oXHcTmR%qXPFJk3xFb(Aup%EaZ>0DoQa?aLTU??<R_`r_5tctCYGAW$L39`=
z_d4~>526h_rNNtO{mxpf8-3KatVBsjUvz_6<CiN2rjinn(?Iw4=v$FUm*Q#ig!l7L
zmYcm$+PfMCer&J(Ss&b4*c*vULzgzGu^a7a1p-!^0Mxb2YWJK84K95ivt(1NtvaKR
zLCrd!Gl_m{?ajG)A;Q}%V#z=-Q+EV5(8=}=4wS2+jc>D{o`<RD2hpc+J>!kB>zFGr
zUXL-{5O|&h-ck3*TM<E1ikf<fbJ`O}L9tuv0(hCQ$adSdy*fn)9-MmfR!C3+H@V5`
z+GZ=>(k%<yRe)UIqqtI&E@UI#DA>3ebbT1{VT<qXzp(G`il}`Fq%)JoVURJ!__vR3
zAGX*8d7s4CEo^8AzF<p~VB_u*82j6S(oge3H!pjN8Mr{0>iR3ZO!Ilx#8Q!7KGmM`
zAw`OC=`<iw7abqos7#5v8Y%R&6o!lIwHc$v6LKczZ~UDxa0bitOj3$oU#83I+iZV#
zx5U+~)C&_8v{e4*IP0^~@!8;xEb&0^K+nI?a^G;b<lJG=tI_Em|5XnDr*AOyo6*?i
zYep$y!{`l=&COcv#ZQ{1*OHAHF4`G0>7=!5zd7;;ClUI#A;#GfnYw~}n0y}!J+7T_
z7<J_MZc|P_KUs5mTrbEVW<XHF9#e|;=(qfUtU!wC$6hEo4*OFsEqm1SHf^NDV3Sdu
z?@E495N7=DiFC|(vR~@i*rrWCx$OtaUVqK0kO>MK9k^g~61wXnT4id6CbHyJ_3-ph
z;ph{WZF5;u8XDNBLn;hVMk;gkBln(;DZ{n_>is=1651Xl9DbeJNikf<aicAR*tzaZ
z%9<(JW_xXvH|j5K=$P?NZCD`Q9BV&SaiNq-E>8fz1VBY*4oDTAls*aGvU9}&9S89G
zfQ!7>-jV3bJ_Hh|afupK=c_WbmlhNP4TnT5#`i>3A@Txxa2TE)>$)`yUo(*hKKy`=
zpmk-U2fGo*DX~S<!PCJ4=u_zeg@**Zjgv}rRIu9GT_B|sm<)m#T^6bE{Y%(&=wg0U
zw!ZeQ&pFr6%yp~lvi`VXiJlBzZsv;s-za|}vO{s~LPA_&p5rA>dNPk5x09Oe)zdd+
zZ9-HVlwPFGJw8vvF4@w$cmb`WHgX9jTedeEe}5<LQdt+Hv(hMK>*B#qH(y;0(2zy6
zZFFiMj*OY;cPxh;_zUF`SkLEhRs_Ykguxs&S;5gcL=`$B&LrDeT!`NctU$;pE~m6z
zb=RkEE&zN`<deA4UDY4)x&7aDdo;x75SJ_hOB?U)3Re8^d9Q~rj>$50IID9{nX{+~
ze@HJHE$l;1-8TV4cg}T}Yi-$^U-TYiR2y(f)pD7ML_$m4!itG&&cbd2<3mCcnijw@
zlo5Z2qA3!-o%3odWbXp%c^1!#c0}lXi$BcyNmIKv>@l#pcuZP#_PBgLA(v@STx5lb
zW7>{Tasl9$ZH}Q7-K{zY`fnt_NG_Cq<CS&HpQU;A++n&=qf^}Wk)u7zTtog%=Hvtm
zI$pLvX=uLE(6H1IUL9E8@wq1;xM6PWz^Svs?P7s>zGKm4=I=2J7|rpc`dklw()g#_
zxv}Mcj?Gz$BF?%~r|~}fu+EF-J~dm<urx>`Vwlz4U@`xFI~0Qonwm(IgT0$^?!iUV
zs-KA&eMUaIhyKbQy2U2-i=D$X694|E)cgOw1HeiFJ3HrUF7041VAG7{i0ck@#t%Wr
zXrOSg(PGAOF>#sTUjc&^?Mi#~DzuQQ0R>cF`I95d6Z|;?{!7WIj@pWlIrqDEva^Ke
zTBc<gzGqR=6mhzo9HHdcI#ORh;OCzP6abaw)Ae)`W3md8V9SHNd=b4U%G-u`nL~~I
z_BIKHkx1SQtuCE1$4}}F5h8k?FVB$pXkz-h_|vw0v%^9XFo>hL-vP~%=D>G1KP#@X
zVXrhDLS4k3!ZaQ|imKAdPLb|(5#F~!cmm;X;fU@YWeQ&g+(63Nwdj#0Ik^;}EdV-C
z#i-+^gGD4fDOB}M|B#%QW$$K*;I_!a0KZ@%AyTyrUQ2!tG}N=Dln;X^YWL*xfMtA6
zoqp2bQ*_6ujrn~xjV30M3<2Tcp6hjyH&r=;tURa73FhB;s*{dY_pY689GM#i?dQq&
z<K!PHpGEp-?pEj-%T(yLk)e~pT2_)1mo^+Xo=O&!rI-5{zIlyRH#FGM7Zkuuu|bw5
zRWb$0Ny^};M(~KckYj(Yl;}=)yWW0-8r4zFSD$oQno~i_BqsK;7v?jhKSqJ9qZ*{z
zXp7s#eR7uVFkp$LWMFriBvZ{K&Xzv+xmsV*IyqE8Rs6C~jS#1w9-ADU_mm}44?-EM
z;VqLtD-(j-!}1y$))VJft#F_9P~}uGh-`>MiXVUvSIhkA-=#XVNveV(xZIYz+6=cI
zI_=Jpbb>XYFPnCOakR;Z&~M)gOqF}^Jy72oE#u!Z;^2RC>q;TQkL3!HhjrFxaW1-S
zn#VT{<-Y&m`GNEv94kYlPV#J}?GaI}RpQviC^e1-yB}VsZmHk?M`qFHh8$OWMvO%&
z_Y(Yf{3nQ%*ZRqyEOJy04i99Eou?WZ2oK&Aylr>K9U$NQDYi*NbBh|w@a4(^>~H*i
zQdEkz$}%C^$q~ShU$?0TYi$$@ha-^Zpy!5!f+M@Q#41>aL93D4T4D2Y%}HQf_H#B3
zhJ|Ri^tmVV)5U|CLaQ-k`<3eaAhsiK`(&?}<E50Pk$*bd_9MW<9lT4_g0_%Bi98*W
zT5$(~Mf8aEwji&y#>wM9{|_2PxJRsvENDs~^_dvCo#1QNVstYbGPeTMM>$Kzu&4Q7
z+<d>o)a2S_<~ua?;-P=dsq<{be(dL{3Y$JoL`q&=p}N!P!RuOUkAgVw1O$Aq+~bz(
zvn+@{kDs`Z=4zBwUk;D2IGc4|(8JIrr_KHz#IvM$zHjZ8SZygQkCl7try4MS`EzFA
zX#Y&|PntBjXaTlNGqfm^oyB|m&XY;pNZ~j<FbdlWKWE)<^1D)JDP%Zn)H{a+=kr_4
zO5`hAp0iCMEnz|h=>eE3nTcjLpgrkp#>Y9<rFF})kS=Jz4OU;SBKe#B`9oMep%nuk
z3h}TOwEB9bDRz;Gt@Z?Iy>`<pD9bp1w!3j7lFJ}z-|BD>6<mbCK%DQCTkPPaIU?!u
z$+zzERK9^&p{3Hb{L)?9=hG}D2s)ppHi!G*NMxgsvaS|7<dw%neQFm_-(2GVDeXPO
zn(ViAUo5CJl@btCR63zaZ-R;jq)UJRfq;}yLJz%LKuYK#LAunC06{v0rZnj_p(u#-
zj?x8z_hjyCp0(yW=h|QPe!e^@UvfSFHZsPzfA<+@y0;xcW;1RtJ>1-0P~f|}FATrI
zdQJTi@g&K3Jz585QUSN`G}nY}+Lb{!i+EWw`Z#jaB}<~PP_4rs`gREIP)Q^`CflWA
zwuA@h_4|ulj{HD|@GIdF6tY?KOky=Kd+;z6Sw>&uv|L6)edBI%z$MVOS_JO)?C1?0
z>ZN1?7uHA^enMfd$WV#uySHD!?S?O@o+P*ep3)>20s32}vw;Z#Tys|rHHd*b(y1B5
za+CdT{_bF&U%60k_XYy90rZa2nw^d{ym<0sjCfMp_#z$4+m1BvL>3zL&oneQzf=;R
zFeQF2u@`fDio7M5%Y-($!1Nlr=maVM)Syv36XhF}g!jzq`tcU{RlF}$y+{4Ki$mFs
zrYNc#3`H0(kY>RxS9iU{Jq8^r6k5_x0drXlfSFT#W|QDb%U0zYksYI*2FBDL)u03Y
zd@lbJ<BeB@qiR?|9qOBQzKZJAyW006jh$8xQ!IC=Q+@eY0wnQ&f23Sch<*O>x9*1E
z@2|yX^1Bj{Qla)ov&k0US7W8{zymg10c2$DJZ~BYEeeePW!Jzb3suf6H{Y4fRtY_`
z6!|c~0?67OM(x3qGIV^9&44yzBTT9!fFFannT*ssxyzfS3hd@5hS%9dkh|=O8S4TB
zEvJ3;3@E>#o)q*KdAf9*u3aW4ExE~^Ry<POds={`YOhoxT6mi)7Q*@EUov~|CQB-k
z$7qXie61$U@e45E0Qy3=rjOq~J_Rq_Sayr_!9<qSDqz!96aUcZSFTh+c3qVO&?~Z|
zxw|F2-J;3;N?Z^*j|^1VAGO4B6)M#uvS$1hw9!G2)dR_!04H#Vp-0KJ!5e6GrJdfj
zA?)t1K?aIsA7u=-47qCihsn{h=t_R_zZf6oRcC|zS|3VfbuhU~UKWM7??}jn1S)R(
z>`==#mk|nxLfbS(U-!8015Cd@9t^hFL%-@NbhPk?$?zDb<UG3<rgt*<SW5ZCYL9nM
zXewLfY4sT8&f0>L7%$&!ahi?vFIl(faMfmGMd*6Bp8o;cw;36DS!}pWWQ>(sp&Q0u
zP2R1qe`UUcSpJ@VWP{vtFLFV0%P6@=e`g4^8DD$v{mZtmDviCUU)uW`ZjV&F7iO^<
zymak2%h3{l!?l6)ubN}AJh@aRwPUjSv>Z!|IL=S)Iyf+pd*a<8IQ~j{S+rIy|JEpX
zcBn&D!ky*NN6km>6AW(;0}EE@j3PF)jk3uTCd)yw0vEHdr~2v2&2|bl%3J?_S;(M9
zFSb3BCnL4nC>xv{s`0oqDOX^7q$o?UKiJw^N@f$e(Nhr7m2vwPhk=-F+}cF;%_KQK
zM$!u!8X@XgaPij7DRphQIe%IAd*e^Y2Or8_BtEDVha2`+Xk#yOUdCA4Xlcpq3oMz}
zBcveB^6;u<TfFY6_RL+)FM49qfEPz%_@IEKQJ8h6Q9d!-K3Gnm_7d}tk+79_-(HNE
z+51u3*#f$jFrpL0Hk&nDkDW3t6MdgSiF|JVCT_WMrcS?4jW`it;(Dvs<jZnu)DOT@
zp%*1ZKB<<L4F^Ru7tE+X^8a^%YfN7j0@1#)5FC#&+_I!Z)_z|T38UQ+)$XuWj%r;S
z4LoiMtLqn5Zj>Hc{N<)m-o9{<O(_z!fwH~jN?g8c1pOlD%HRc%cdlxcTv<=Dbe&y<
zCj7C79*B;bM*s&UL;@w9`n~f7Z44W-W$&qI2*X$)rP}dzBK*aJFItS|(dtWH6<Cj<
z8#3Fm#%nlgP3;E^(uJr-yUONIZrs^OU+oL&pnUv+cRtRTzH>LH3TT8(_N%E8@JNr?
z!cjAEF)3ak|5nMDlkc)g^jWu5szcRJ>U{*$xl}XL(!E#i#fV9${p?=VbQu%Ddi)UY
z`Y6CPSVK1)=dWO#M|irM;uhzLg}uiMGr|Hk_2Km)=07k{v2!}v<LNJ|9pLnqdv_IT
zdOh^l(^Wd@kAqqN1nzUM83r!KolFkx?48S=X6bM31^9~GLHEV9_w4Fz>~n~J_0%@g
zr~ketf0DnJW0!B}+__)h@JgU29DOhx#=&qp(*jrh>S_A4hs3URXh?0=coZbv0dMuX
zx2J!oa{>!y=c(GB&%agn9XofOj#@9QtA2UTt-rjsS2)GB_YVyR=e1*Xrt{+2cbm&M
zF5KC^USmuQDEU6ZeUd}h*6y#^x@})xIaa71AlxM(GG(4LmUEAJs9exw<MUVQVw3n1
znMLX`dz?1%`OuI#Ha!lJ6s}l|7%~W-qg04#|HS=CKaF3y^T?x`?9{bEEu2~|+KObg
z*I&O8X{dFR;^hD`$Y(FDIga(7KJv8$E$D(Ak<H)F&=?~FAg@$Jtg}~ykv888R%m87
z4NV+%#$6QWxcGu}zr<IZVY>8tpQjsAA9>ddI{3xL%ZF#x9Q~jtbE5!N88?+!@T=iE
zOb4=Pc_b3_P;a%w9s){(i_zl63yNeaf)Zz<+&XVJPzl6-4<7OyPRH56`7eK;Y&Sj{
z>fBnCzd1eU(`P6ZYHOZ|2X#)REvLZJ2%)m}@Ukn|#*YxEsTt($cK^&jmOP_PpY}o(
z#4Vls%}vx0?J}<Y<od6Mwm%H<^yGYSW=bx<f6V~<qez<hR$JmH%#w?W#+>`M_F>qs
zw2i^ajXrWO4NdX?XDQKA?XPYjYFvX8k#*)Gv5M2ah&uuVw?Q{a%Rt<*fHo4bC)fSc
znxIvvAuKmt<GSadp4x%@y*;w0vpSkg@_UrDuT(~!HJA?nY8}^v3$-1X(e_mjEPsw7
zC7Cx?Tt|2Xm-;5Clq#h8XY2`c;#(4O0a-I0W&Pf3efe7XkX6^%hWu2u0JOfhYrYDy
zO02G&-5{e%MJYxC7ROA1dC801eIAX!ji|kIRnwx>Hj{0^-Zte99FygDt9g{w@CH39
z-Ps<d@hE;?mUW5u`R^Lu%KoMpb?NX^11HxCyqPUt-TTM{X24+QU20fg^kY0!J?YJG
z__>gTIfK8J@TtVIH#{=T*Gj6Qjf|!^tzS`?n+pOu{k1?8t;y_~PtM$Vl%JPCc9FQp
zIG*7A1_RCq%X`nCMMuzEF{NATOcp<Fez1G%Q)2Spkt69qRICK;ABQ~w8E2P;i~;F<
zMx~f4w4+T?QjUN9qDJJrz&6=-{p+*$y1~X}i<m)7wDgt<CHWSY=S<H@oGC(kTX3WJ
zr(lhhDay=@Hu~Z%Q5sNN!L@$l!7rX3?CYu^FU>uH@-hV!F)zx+>HTudvW9<Cr<>L!
zIW{9r)ehz(jAV#vOct8rxH$hHB`6i!wyj0J{LoH1%V&wf<5k@iB(cJ{@d|_QGkd7X
z2g?pcwgE3C@_XS~<h=OZ`KYmpQ<Z8=|6cKQ(;G_v!LU&g@i-N_l6m50M@fqTYu1EB
z!YTl^^Q|xIrNwhaD^WTh<si;{STmVpw)7^qI`x<x5|{;ID$=!nIO{cb=!|*<<9OGh
z^(RKV?Z;licB}1>@%v>{N=bN!VaG5Qn&_u9D}SeP#dhrpeD2S>g$AuYt2RiC|MpDh
zo(|b3;Pd~StQR`Ap4DB?J2A03?B2?}PBCm@y#YP}#>*X;oG~6zGrI0ysg)n(r;~C+
zAGu6}zP83rULQrFM(zM^Vo9*<3;U74G+wZ_b|c5Y;7X`vD8Bz07Mi>tmIQ}L`36cF
zXB7-qbY>HC9tgpo>f__{gU4QNZpV?~86p}=EP=V?#W{k5yos6P`_U5j8{GqXd3aj>
zZJ4r5Uy&RTm8OWE94tikq-RM7C@s~h8GQ>;7Zz|cQD%7tijo&$2hMT2C22fW$%+(v
z!?SKJnRh%HwPt|pAG2nO`z}iQK!T>eD3!Ieg)F<8u|I#q@sNyS_HIZ)wnU*=q3zVi
zou(2|3+f`?Mv6;3e(42i?!gg`9#9OXbqKR_$0$K+cDqUA#hDiAS03Bt+R|n54ef4X
zfDe#^YRq|R{)qIhctX-GZwf$KH^mayHTSI3VOITk5ksUTqIc`tW=n?%h^2;_FQz0f
zQ*Gf~08^z7U`?7QQeqxK$<fe=8k;hXB=td<(r(E};^GZt=@RT%&FyFRvi8Gov3Psq
zDzT^CALY6mxT1ohFyv;9fdZm{Z(mRueV$Z(`hg|<)`n}(z_2;AvPwNbXr{oh$-O(R
znMDW!A=wn(Deta@cb6U{<Q6%}LN%4GlHS*r5p`zy)5SOi?~LrJ=gZ=%PIZ58^Wcpz
zpANpo{;G!eoF|;!2n;5bN`tazs~(vgCombUYg2v9pM7~OOSQ{saa<el*!4PVd_v>Y
z|DV(7Li-jptQX%C@@*tc-S4`Cqp)8SD|6wrEB}&xt2VkEHPFXx$Rz75SS8P!5b3K_
zO|XCK?iHJ$TV^z~@8S%R?m(cm4a+6l38i%p8auGZDJ|J6ri%r~47Kn0z~4-%Dqg~H
za40jcQ!BlO$X&Q&zQI@ydYViC?L8D5{?k~ZLhV8No+S>)JU_HIZOmKMq9Al?`g`4Y
zZNbY+$WKGy5myGV7^ld#H>S7!=bnpH8*4<FH<N6s-PXFZSr_UW2JHtV=<fh9-&+=R
zpwfQ6!x^)lo_|oa_TvRwnb>}eS@VI~_j<9|4gbL6H0Lyn<Of<XGg;4~pHn%HNQo<g
z{ps~yIcjlr^^GmLzEm=oy%QVK-S?8kC~#fALQOk5Z)^MWHMA_R+(#Ow7o8uyc`?on
zHzR6-QssHs-+t#|S=MaQ)dIz!kvuOLN-jDV1JH=4S!mfjo9{54{b?w;LH)Wm0k{I_
zUl^;qUoy<E`u0a-=0-J3&J)*~26KcK6|?v01@>JU7UPIwf5o9$^1IwX*HY|yiSq-f
z&jmV6h9(x9?5I=YiUAaVCl_|9d`Pa$4rC=&(N+lLv3fl^l@7Vue2XxyDaYx62L$cf
zdGrU@Yp}oPwOqI4!h2Em(SC=*P!ltQc%s8y*d_wvGBIu|G)QldoMJ~z_tRww2>t45
zRc#G_T_Uk=V1f(vSlc=|=Ke@+#FBdbpSae`woar;Mv%~{VWCjD_amC)G7f?g8{GK=
z0qiYl?ASafe-B+jKvM$pQ{u<#p2ng`&biq)o+e^jaF({I#zCt+FT$fW)Y+Vo+_8<z
z#wE$6)ZGUgpY*i5+BUcMs~#0HE7n<P=h)|;e``Z1ZmfPuBv;$!_p%NQ=4O#M-C!#V
z7td$aw|<`Q8Dq_FM8Yn@9GLycnf)bp7KrZJ5cgNVB)W42d>})MdO^ep_Qi-7JO#M!
zK7;!-G@6$&0QBNhMXM*hC+yFwSvaXLW|L)k*$GR-;Te-QZ=Yu*p|p)=<)m(En_o2X
zy_M(ooXl=eyIA;2<U!(RF5hdf?LJ;qWOxQ@jgBEdGl8&op-Swwy~;Xof2!Tq_5;qu
z%YM5}CwQlFkx5)vS{c|6S<o6o-boJ1e`I9|FNHVgdRZ3U$=JP57w6a*-1f!h1xeS~
z)AzQDU9W7h41v)15XFUXwN)ML)P-obon4+B9*=!$AbDkU27~RSk4o+6pN#Zbbxfwp
z!J9;j2l%}mGW}#wcy73QFt>R5^{=Cy;7}m4nM8D+J}J7*tj`fq7*+5~ufQlTIIr60
zK*hwSKD$Q2)yxM^rAHZ`oDS?+H0FGtqPb8<eLDYr`KwB58Z7u1<C^wPN5k+?D<;xi
zaq>t{hmeUTKR6qvNX=kUg5zNVwtwBjxIP|y>Tae5AtHsGb0<=jknz;eV_Ap2xDjHX
zh(e4o-xZpfVe@bX3xgr>{NXe)v3`_tS_NF{+x3LD@c4J5Umtl>wmv?a7fj;NEYd+3
zG6)#U9P(M0unU<fr`s32|2CO?i*0a>oO%9~KSWEcy9kHWaxqgrNi@44XScKt0ACRz
zzM0v#1L!R#CFPl@%_CecPiB_w%JM+NHGzzoE%pUA6t$(w_eKbH9}WhKT5YU>f&5K%
z;R}4lvmU**4T=Uq%+`4{85fw<OS^5k8q`bs0JH*IJWB}momMqUgrXc1%q&r}w~lj#
z<LaVux*a+$EnREytI`?(ZpL@3qQSt1s?>eeOf82mNhVHl)U$G^+jH2Nrhq8ii?X@)
zHNctXrv-gx4C%`cqk|=eFHdVje7PXn+OO+=S7yYrP_klBvL9pmPFxW6>EHUm`65~(
z5OIB}+V1Lef!-8{^d@LfbYTqsZHHm!OANs<IayZM*^AcEna^|}#E&i-7u#mgG3pm#
zDqQaQHF;Bz`B#02#pT)f@TzB4q<?4}!qQco#udy`XlS1N*BD=AtzlChWFr)mtLI@(
zvvUZKIt6pLcdAt>Z_1x(4_*hJx#Gyb6#`)9-5C5%vx_6HG<N?$oj||5aP<oUR+1;@
z-e1Rqn6I1yV7r@YLGVuu=|ZyGoi(o7XFPq#4P*(jyB(Pkly_0yF)NUj15AWz<3SD9
z??2E|9dPpcUOEzd;lw9wo>dK^m<9k%-Se7P%OFMNJT1^vst~iC8b6~hyFka3N|aN2
z$8ee*q+{K}zThp`rSh$8ECD5SAoxm_na@o(TI<Wrd>ieHCUzrW?WLy}R<%ub@rB_s
zRPo!YxWnmBQlC*Z`GWFBmQJ$E{L=)BA0~OjC1_h$Ph>=mIcFJ&(@Z3<<IbiV7+P@&
zejA18?~(^{Uaq8z(_#=rUhL?kq~DJnpU&zg6)X*#1t1_DFoW%XElq~%XHyXlpG>PD
zb~M=1O>t-Q_~M#+JmR(a2p#_Sv|a5dQqEl8aB-J$E`e_Es;+6V4rU~#DLAxv8s4Gt
zQtY#T<StQJtq}_ar}`NdnM{mnY=*r0Q~LlqaL-`#>&<ic=Z6P&zrg9+xQ%-=W`DC3
ziLjxqNt#RlX?64akygT#LKjbZP0Ai0iAq_>{<8}s<fHGZlQe-TTR3@+^J3%JYFU*1
zrqb}roYj7O9D|)2C2`vtDJ@vRfD}VXU8pQA&D|3^6d#YUq_WpUJd-9Z)WxDml_Rlw
zs|JpZQZ^rwY*MZLkPL}2(-{$_DaKNeMdK*Gi)AF>zFi));WAdQLueD)oi{?UsOf$u
zVP{0Z*;}A^Y*3sZQ=%_^v=h)J>KVQe3qc7@vPaZiD`w|+d`d5dt>mNoNJC>I`V91%
z>JKX-@u2);-EFQEQDYF_FM#J3)hkI|LpTu7JRlVlC?jsv%D|6cxlGMZnZ5(SpE3zV
z-~TXP{4>fE-rJX(!G!_SU9?$Go@W1i?Zf!n!ro?14r6DvGDnM&We|T}KE0+{k`}&_
z?dyO)NYn9()7k^$oVPQk>oM!|z>@aiTv~L)OQ0~nlO!PD`|K*&*U?x#lRn<n$3Hvu
z)2;JgoY9~4pvJI8)>G{;++x6b1tl+2`PLtYTkSTKExkNsox<is?^5i6oND)FfdZ;G
z_kk{px95K?HJX2|wV*)`F1*NSaYhL1*q-B7nnKaNEei=&5U3Yiv|Bh(W<t6D$ntvF
zSSnh{=*N#p!K)&pp)PBqm}DxG%t^1mrV|T_FiQ%0H~F@*0#YNI#xh-57zJf|w+yCJ
zE|QY0*))RoBvPVvvgk^p_;2d-0H1{GzGe_4<K=ihym5o@zpjM74v4Kxt~YwRX4A>y
z>9_ds0*BrzL8o#A1MK(+aTJ9>7BAfPlE47iL~8_oJWm1TJki9~yUA!heI>9c$!@p)
z!s0bG0l>+3;j(EWP>50^l8a1+$O@I_heXI*x2@b>e{H_wCT?`X_@MEo17>`Y3EPON
z<iXA)sqLA-x$Ge?jraLe_?-=3Ez-T?`FQKnWFPorDK_HG*S2ml-+Lm;G+9I$z)!lX
z!q=<o6dDe3-DehB9m(xn_5~Q5l}p72m@=kUwHml1bA5c(?3zSF^dkaerg`~|{ioZb
z;&E!u>aji(5vmayqks7m{)Ra`97Q*+5|_jFxArThRl`mneYNXYc*qi{2P~Cct`18-
zzV}2)<2E(A`42$ZBSuG2IYCyCt6p_pGplU7brY01@>U1DvVTEDVmJ3;;GJI+X217m
zu!Un}3)rYQiY5J!#{9xd7R>%D29Ikv&hN$K&CWW!b<wSfhrCD^YRDnzV3Vf}Sbo7m
z^Tas6!P6PJ_6A<zuL@%C_%U!(rZPAN=ly~MRV6wKXBAI-&NtpU)<9#V+oSinkiwE~
z%~H^S-G9K-GwBpnA@_oYkjS%WkuGq^*#BDKLuSYHN6U5{*e8*oh`u5*kLj{@sb_|)
zHe3&e@_>tdMGs1pZ{7ei;3Ebl{866Ci;h4_RP3fj4zEr@ty-qZbGFn9gJa&|NKNGM
z8*$;JnXmoMMH4c;n;=6H%<S$=Lo84owLLp;b-#O*k{e-$#c1;I|E}zW|E?6}qx)nU
zr)Ec-Y!y(_>Nlz;$1(Fe(Un!&$Hc5jN}EJ+77)W#26Q<QCAvfqh@Vh#o8@`64zCz!
z!Cq<Sx8`j^SsIo=a_%n1U7%WkiEmxG!SXE@0OG8xjBOG-a|?<61M_j7{HsCN71A1R
zE$P=p7>zC1atG9$OwWpkbbbEM0>Y(k&xG?MtMSK&xdxUjr*Nt~jC4*#chmri#vqEb
z#HzW(Kt_FQgJqbDX-Y>Q2=lzG7e%{y`5|87?n~<QPrHP!5*1&>o8~Q9E*3#RAap&O
zUT5w8I<w6!DoYa32&$3_FJkK+D*htW#NU%Bt1KBkLoXoSFB~yO;_yIKUGwP?qUGQV
z-=`MsW3y1g4>Tt$WZK;>qAL_haTc&jX=d+dc4O@QQ4Q*!5%WhpOKuzjL@|&4-q&NS
zL2oXn>S$i@5U+auUXzJfIPL*(J3$Hqqp7gqgft&XaTWS%{h)hNcVD#V+$xs0aSt&e
zm*`xZevh6`zE+{Z(M>cNb}|tU2meS1+&X~Y31l_~9*XWiNYZ-MlT3aK$x8;veq3__
zx{XMUP`xKuppx^;HP&Wn*iexwc(v5)jFgPw)O<L+;$_3BfEIC?lyga{$5OPkp=LZg
z_C)`cC+r^@dkXuwi;9_H%|X?U#K37n79{T1a$xz~poqBg-FIQ3nTT>x;?Vihu56#m
zX$T_?Q^SAneUDP_y^Fl%`fV)Su59;=aajHkn_+qa2;IalSq`*P?)-6SX0)OX(MXc_
zwlGK3GrGnH2wKMGkswPUuq`o}3PmmVt59Y(<aDyP&^-`OGw|Njrm!_uaHbWQR`WYx
zHhTq;mR}fCkS7-dX%%PN&QJ<wYo7pt5vT%|xLSH142lg^CH@qtmHd{N#?M+MPCI|h
z&R%UxlX4(>C<HyZK#PU|ry!t*;=siskmaJi2vXW2y&m2>UDmc}0i8qEF+_B3a|k1)
z_pjVWO7r(?ql3G-KKOcbe#ooDr|M4mJX{ekboacwm?Nd!a{wZDy(Q9Zeat=#34QZp
zsC<|-C_X<z2TQ~mY@SD?ySn2I9E3U%y`*N2esf(F&Da18he^;jJ40bVYC49y&_$Cm
zCV%?E_7gx7MBC4f**ICq(wvQ_Lt18L$?bi#B+IByA1I~d_q3B%>m?>>)7}%V{z~X4
zX?@Mg<jH3JxD>b=Az0`cG@fvvR`^LBNSN5QZ|SoM{ratmEvFsqhNj9-Wm;;bjZED8
zJC&;1O$seD5Z=o;_Ur-W^w`-1(giJJYs**>L%;C(LJo?GfmeRie+}lPp+iE(_CpGG
zBm;G1wdyIX{d`FG8&C^(h48JhXn}vPZgFbKu`!=xBly$>v`|lQ*Jd=2kYtCZfY6_e
zcEt^_<~(%f$y4UZ!?XwdS{*#}19C^t0ncX*U$DoL;M_}j$6gnYEmsj($EocY>N&OJ
z>vyq7HDXlY<N|;lc2m}#wvY@2LnbrCBOskoVs^(YscMC2`nNlN&o7R=vAMWtLC5p6
zo9A@{4M_Wb$}?Xc6dL)a0)QmK=wT6E1h<RRCv1V+m#X*&n15&#XWYC52cL-10|e&S
z>jB7r_5T``?7lsMKU?Al_-+aqPglnr+1y6@xouXn7kwylD6U2Gw&MRx@vI1mEwP<x
zy(dukHkbB66q71u`jpW>Nh*tXN(+caPW^9W$!e}HX1Xf-JlSa%x5qp12Rwz_&n9nM
zMA4T(KxTdwPabS`R+QTVp95?NVs0`p-KK7`XrcZatgzvnol{o#fC#=~3n7q4kz%B%
z%89xf7w6>yRH>AF#_|I6dbpbrPtYw%=BDeh*wuD3OUB}pRy)rym(ALX`A)rTe{oBg
z`tm#tmz~G$E|5^pxHgs5aYM^wtAA)pR4T?5W<Szg{P(C{Q0Ucbp>MubnC`s<2rc8j
z{%-Pw`KKfshS4=pvc=RW#rQ-pH#>dt&$g2I<^Y|e()C5hT?4vlYRnF=5MHy9u)9Vl
zmIe^`tUIjI{h;N2zN`&s=HOcIXw~GHK-mko!POFK7erv?l{S+qu0ry_ReM?Gq~hRv
zJj*@;S;I^Gd?3@B?HJlNVl5vb(f*0$9I~Oi`7;7D%n-lynq-F>uz`V=L8i%B^Q+JB
zi%(w(XB{*9ww0ybZ|;4_Lo}{z_#h=jtt8aTJ!QLjdGqyaR;APYJysw(s3!uEl7IJ`
z8ayhVpwv?OybwdL!~2Ztcj)(kUN_g+x%b#+i-O@2gt8s^g)nE$1GSDVt@wD;9JdjY
z;B`GKwu}Qi*!`5ey6NYOORG*;ih)8Y@!b0A{6lqQ(XV^nF1Zj{xsiRKoLX5mwxoD}
z%tT!V%IXp5I^5e;y=iJ>Ur>F_t`i3u;n!>c@G~?=u$k)A-S*V?xUZ8n+0&>&HUJp-
zaO0U+#q7EZ2An-*ebv*-8Fr<HjJiwrpcXpS<YCH~x>?iEaIr4Tr6a!hlqUzA3!eUJ
z>~B^ZBrQrA(eV2d6m1mr%>4QcCh&S+DO!KGVSjHyC9C5sq54#*W;4rJw{Fyu<2c7&
z$!q6p`9~UhY8B^yU6;CczPY7xm2SahIm<DvGDCI&*<`Rm=Uj=ES(`!Vz++1CsdEnT
zk?E?kq^9$tlyW{(4xN=++t1Ty;sCpSer2h;;cHwqd=@a&kEQ5m_mes6J88L>wv9>)
zl~>KEvCZNh1EYAMJ#cA$U(!6%aw%`0Jv$<=8>j9!i)=F_lU!*n#6kNEA4Q`Z)Fv)^
znPwgddtB_;71BzivB>JSqn)(3+Xc4aq<Q6&m<sFbRKpGLj84bzNXoBsmV)G^7`vYn
z_N^q58O{)pBgXV8;w*NLu<kYXF<QCuV&+8<rF6a$hrcB7OM-_vwJCMpPAM7M@HowY
z;MK#hw+QdYZW<A^+##EgB`rVy23|1>iz?{#z6`bX@qsziSjIa4?RXzta}GFYDuDhS
zX<yX&76oU;cc%awWzR)OsS>pJs;H4Mnou#F7CpTg3XzQ_ZYiaXY(M;ZHC>o!PmmrR
zoyEtHi$F5Jg1C6L!?EEt73pgadUi!4EU0PPG^c>abWhxtv``FTtP)7{pVy@mQY7}k
zyw^9LPo<0)e9Mq#etu3D$jK!;^fNUV(|BK6^ShqCnUg>q%bySFgn@_BkeLVOO!%@7
zct<1gf@(w?cd<8Ro{v$MABZ$WRp*LQ!38r9DGM>w#K5z;l4}EjvQ$gah=PRDLkYlP
zOYf@;%o3F&-&9$fd~CYbm*e(_hU>q2Z#|U_F8>MP{BBCoI%Cy8yFS&w@EiQIW?z>o
z81_$H)!uQKz{D4mIG9ko4_BMu_Ew%R?98~N#5+6lRvE;i^>f*WQ&60EnoFL8xfp%4
z7*FPaR1IoM78yOm{%*9R3^WSicU0rQMNI54b9-4i-AlAQQtSKrs-%PKlLqqhOOgo)
zTH(0)8g;?uZsHSKuRQ6N*A}T_vVgP$VZrVzqzX$o9QyacleWU1O3n*NArZlli+bOv
zNqo>VVMU~Xm!^Ah2{9Mk%~x8G%OS9Tzf5y6A%|DQ&kv3;(bL`T=q=4j-n}rIY1_yO
zOtoo$C6V0*q<BHhnH85uT#QO727E3MV>WMSmFHl3QEq7#)jCZdaIc{}ZK!kH6;9ns
z1jbX9x>uZaoqEVf^t9Uz<^aE7qL-xX3Ma@)n{n;{E~=#|7H8v3vF6W59m)#Yzsft#
zci~U7%8|~Y_9Z@dz$N*JrDb0q?A)FoG@iv)e>PT}VU#YjSxYolW`9NNKoS+tpDd>C
z%J#yLK&M6^0Bn|%%x;PYu>9d)war*`&d_3Mea5~?ONJKl5G(4Q9%SW_qH2aYi<)?f
zs_*g7Q4_^F#l{iElTMoM$o!nBAI|+pIqf>yIZR)ztxkc2JZczV{tu1Q&mAsu(%L^X
z?<vTgP1wE8_d~lWChN{vr9USgG`Ih2M%c}J#QuQ@Yr_1%p=&U%P8(_pSc{A$dZdIp
z-k{?&qmmMgeBSPh$Lo<Pc>iqysj5$%{2oQIY8m|cx~~H#KWvNXZP=`9s_3dCzCYw&
zCqAuTF%XMU83_m$HTN?S;W@PHf+Pb!V~PXGx2pi0GJO^+um|g!Sk%q*3V);VE~vtX
z>g>|O-nwE)%5mP26t3R|Hq3~8Qdkthz?0|3c#X#K?F+Q#Wr$wqzk&cN^i8ec`^9Z1
zHlN$y)kL2?H#VoL2(*6WQjG<KdzeAn+nO4Wd1bYdvs1@D8saP^N0q9?G<)4U&R&<+
zUA)){S7`U;@hKEzkGiVo`Tp;|^k6~32~VN9He~Z51#PDkBLWdHZqQg3Yut9`tnL}7
z^1)){l3h1r8iYi8rZ}BVyhu=uJteO@B*LKC^5Sudt2mrr77(D!dl$N0gnE(1o24hn
zL1%0Lt*%pgL|*_jDo=xIiAa$5eBgm`$60Q)&;uaRS>%*Tu`0KIj~Rn8y~LUYcu86>
zri?9)H1KyXjp4-D#j_?pe9+dGT8Aij|LRHfP5jflIuL5hS}{Q0b<YLyJ0~I6-dk8?
zZJV_+^#W4pGMe6NPRa2V)Ak}%sm;#sLq79OmwWPNx0zR70Nh<#6|HU&To*^yMyLV%
zI!4(o^T@d`aSbdrZ}Sm4Ml-3!>h#$nEjX)BluF+rhI_|}_#0<T=aB-4!50eGc{j5P
z<|r!#w$X3Vs~J_NeJn#?XI|5+F8=$(q27KgP!8RAqd(5i=Nc?oeGe)x4972z+2X!s
z%6oMR&$Ij<e@{AF!Y!pNbY}jVaQe%|%9S-7A;zHYs`4Zl-jk}PE|`1Cup(%NZs?=1
z%r-(A$}4zJEvR!@M9TSz-r$UGm+({y`V*D|Ve(ww8)BH=QDm58F{sR0_N-6P+u%{}
zYPF7uDb>`3w!a#I#o86U%!rT@MflqLh%o+Ax*wSbQqM<pRz2hlxz?cbZC%qqEX8dz
zO%<fZS2CQDILYR=q+K&yaxrh+s4s7JSD;LXBu2HDQOTf>#M6@bj@gRIfb#j(Cxpts
zCDWQgY*ZcAgvs!Q8fqvRTO%U3b@!$oGNbXBA?TfP&2hw=9uTa8m9UgI!YGTt7<tE+
zK6BICnodS%zA6{AnZt8{tF80KVV5BteIk8xr~T2jRMeYe%Jj@)hjIBW$C@No?2Ecx
zDLL<DMWaDvMpIS?q!|CDB^ad_V3PK}X}Zw1G?qiyDsAK^hE0;SvDU6^*^9*u!kP93
z$6;Sv(PAsRe}}K?+3>1C*0>32a_+Z<#<z$2ML#OzatKPtc3Bg=kx66kTR{2BC#ZK`
z5nJoez<MhgxRR)m^!8WV;UEF@U47l_fg6!erzT&ebj@mGBw2hXQAuJkKRQ9cMo0eM
z^EXtSGMv8Gvj1gIu&CKf&hKQe)TbO5q(^n0`MJgsH@C=|2AaF<`<w>f+U(kd4II<b
z^)^SqmRFbIE{FwLKc^~M$b5$003yzZI}me^&${%K*W}*EPah&;zP#+<heI;$QwjCl
zL2rE{8MI&jUiXUdQ<!s7*X1uUuzckku(S4==KjBDpF#+s{iuoG1Tvt8upH7j#%%@&
zm2}F4+yF$zi_n?hP~in%XZm(Xnm%q8R6=5a(On*HQu=79bWRxN``5pcdCI1(Jom?@
zGt7t6>#OaCyN41}%r2|2#DJzNMYTx2;s^0>N9;D;6e;D%vZ)hH(9F%n0+Ng?CNs@^
zS`i=#ecuN0UF^cy+qb-X@Thml3otIjjI0PoaXNYL^ARR*-=`X7A|n<mo_9fP(WHjV
zYQFK;k1%|7HpI^lQtKI-QNlh#73N98d<NY-TLoa`n3_05haPS|ndr*z+ka3ZKNpY6
zxQH0<n~Oiw`QG?R7>r=(zgA+%Lp@$8Ge4HHiNBB-0eqR?Dih~(a`DHlMq#B<EDE$J
zoXYw<Bcsty1u!KLSR?IN3q;gN-f$ENs8VjE{_&|N)YvkySBeXy8vKB)f)9a<-zkav
zpd>L!X;mXqJrKht1Fb|*`tqjxr^Y_4AgVBEm)?U=+a*rjDVI9<oTi5BNtP|YVct<t
ztWol!<Z}|#xeol-#<uE<VDfd$L0m!ekUppIQ%$c&@fVIvi+lf}VUOLP3|O7pj^{Q%
zBmG%`b1q>TBu6DJ2UjVaGZNB$mMuCs@n?CPBN%1LUO)A_T$<peZVQJr_Ik!3di0{6
zOEDGisfFIDycl*{XgPn~s6yH|3McX|pzeO@8>T6XFkZewUn5{i6H$C=9mz5iT@pi1
zjWYV6NUcZ~Bf53X5J}l?y-Nk(T`PQ4=>nw?-F@=dl=8;umGRW@3BJm{;ZFIWkM%R!
z@jxSMy@Oz8gHagGGVwN~z=+~lDCX+$@%EY5pjE+Zn$5j`Pd^&fpl?d|Y!(hm%jkO`
z2`&H77!Boe+t&KiK|YUmjm0fRy6W{=B;-`p4Sd+ujn5XzdNc#<nMxSI_ZNZ(r_(A~
zNflitdAsCf>=*k8wZKU?Tg(0*5WRkcjiCgmBg~de?h$4;lMWtNS`sZtmD&OX<_C5O
z723EX3k0-4ZHMHtNlU6>kD~FIby8{eT3V7Fyr_Oag_Vq!vCPj`UTq^<N~ncfj^1~^
z|5`^lI@#Fe1&eO)bVm5IY1DnU?=cvE4Ogoq9l17ykwJ*nQ)HQ<%Vtx=!|0Unl$hzX
z7SJ6M8w=Jr)ZRBUYjL~JD6jxnXiQtQWM`CKR6U!NoR6fe_sM;4oGz`s28%*;W>j)0
z+UttNJ&;A%|Hgg9IkS6!ER;A{%@9VJ)!|Us^CQEx16lHWSODjeNs3`8+`)J|-Ncno
zpltV>)RFj}=FD_Sc&6oR`|XJg2`=Uz+D}J{u;mb4-TMQBX%z|LjqGuPg1PY974ceG
z%6p4ewrnX*BUA#!@be|%X5U59CD+F0f%-e*zJvjPNFP39wEKJ8Z(sr2hL)DLF`y{Y
zMy$;sczpSeilbqN`tIl<rs4KRiBWN?dFDxL+|FaDyN|b2%D(5SZJ~*_WJOj%+Dgr4
zQms^jf3pkRkRl_i(`P!tE+y5F%?bu(mJ%7Ikd1X}b)RB?;jjCG$Q@+7QzLzI@4yDK
z;eF994&e{{5_CQfwV=`>fpIBK62pU&V-#pYn}8LA1Q<$(<Z2<n*ivG8A@y}U&Zb5=
z(I+UvKQuUrCwQ5n{>hm0tJDmo4o@Knurk~U@xW;g>aO+SWf9a+gi7f66?FIXQMQ2h
zAKbkHGDl22z4qeDKQvp%`?5oF6%$mQ@xkfsD$^T_!H-*W1841VIabXWtM#h|n*4U9
ziQKUPGXGsPq(vA;Kn<yw;g{*2DONH^qBOx((LWv9>M=TZw#mUpi|6|RkH;u%IFsd&
zdojObB{<rTOr!ksOMx2m@2FOcd)tCvcAB_qO4?=Fx43pJIRp1YHF8=+&k`IGdX!FE
zA;xl!-avZ|Ro1$XtApQ)ye4$qs7)UT``B%iU$mEa)%pY{qfQT3^k!F=pRAJo?iihw
zy1{C%Fsrb0XwizEU*eI_{;MS?W?sww!1<m%{u1S~h$1=h^$yAx8$(_=xvaYg&)4Um
zrl}+H98s7*S!?GY!D+63C8|f(8LN)$NrKw+@hWAY*5zbv#r9vRN}@oO8Xt=rmE)R+
z!G&6xvoT^PQmxkckKY%dSGz1KpK>m>FV^Dkg)kmGJP_`z!xWBWm{&GRLI~^15)m#}
z6y<)90NkTNxyImF@4yz2jzbFZJ1baewzw;OI+9Rf#tY;z2!Np;iWf;~YBn1fY?)0)
zYl1Azxnd{#WSs&N^DGU)*l0fSf?bV)O_&3HIp6$zt-46MoBjCVvMvJo0Vimu8)R7Y
zu`Z}$Sc{oz;$XjG&|=Q3G*KMe03iHwOq{`dA1(_1@c>8Y?O`Y>(cSb`u)6wnC+2MY
z>J4D6Z^~h~3cPZE`b6;ZCi|re*jklR`v=Zg?Gw+#m0!E+MHNWZpteS;Av!5eM}S`M
z-9!sv_vwjzYsI!g*zdzBc*oA5?>{sVk!H4gL8l2GR5h2`eVOzxZ+>RVzb`zrxGSXT
zs%&W`k6%zW<o=Z~5eU_i_=iU8EFqVhqfYp1)NqcV`mFHd>91j@b@TtwtgWzZZGKfR
zr1X1a%@(gCDMTE0qD8&ih*bBq*Pd38!*e~ac5%GfoEJQ}>P#qfmd@NjigCR&q|`}j
z>TM3q%G3$}s3?-D^Okr>+|^IJ4uOx|p!T!Hst0)iHwudu49PuxZ5`C^Fh!N8I*3<z
zvG869eU0q!km8z0r3eIvdMZ`C)u2^lOB?XmR-~ihF=Hs4z06R=JuRltAx&M<2dMi^
zGN#crE1PvHUg8_qQQJt5+98&wjLd;ES!{_M3sRnR1AM;YyyV}6nAifCv{9=NA+tmM
zYeVey0guo*Us)?u-u`8XWLq#=c;uFx|8%{0-@UX|0@m`D#t+S{O{sIFx%lz_JvIJy
zzeqK}DN{7WUmIkB{Hs%E5A^y56Ez|+p%aXrOS!9~QmzCvNwGRSur$x6(r~gif0&GF
zObl8vZ~kJKj|X>H+Ynm+e4;Yd>W-*1GPc&cfA*%1$5wj%D9X7p8s?mnqPpxW?Vi2b
z5d1hKOg8_RH#+9ajvHrK?N5Y|*b2b^lrqx0Lk?8j^_n;gwB<D*Iw)nU#vZvz3~*UP
zSpL}MG+--gAR!EX6Oanb3le<XMR5o`MU36eeoZhX4dIWfBse*%@_O?mDg$fOec{uF
zyHYEh^!Reg&A>EFnfyM3YPfK$A&I)Y33k|i<6{mTEwn|S0|!!E*TT_IKTR>!$i81I
zaf~b9_^ZRFYPJA-byj?+&yZSjI(lT4^{x*%XCa}#F5t%3ducrpdOGRo$~rljuJnVd
zM-`!fA$(Q^(0AF4Vqk)${sB&pX_VFq$eLm$6rGX)^^}fjDcqv*CooIlA}Og4ubl)Y
z1_X%3OpjN^m|%_4p__JCC*@|{Taj~?ML}`;#x7%%&-VsRDvIWR#3D|Tu&~RmYlFIF
zVZ5+@iq!$9OdDKYY%*<)7gQya+!(|c$jvmlslk$hn0Oa=dp)Bv^zUg)1Zr=iZ_Ynd
z8D(PhP$7U4kYa9bHF0(@b?@oV+4f8o02h^A6h_76T|^@oDBI`RE2VQyB24W<>RDVK
zx}x|lIZbcv)O9x{y|4*xYI_Gmz8aP*)^WIy-YBo^mKspfGMe#!mB%ji9&XS=S{d`B
zad-M|2xf^J_)e@Q7(qPZw2(LjyqYE+v^mC~AxR88ApI#*oSGahbnx<XY*dc^S)WD;
zzw;ZM`ZjMuB83!+6VKdxD*csQxfCL<l%*RNP~9Mzlr0M=3yJn>>F>iI6SdH4`6{v!
z9@c5wJ^cbFNx(Fl?{snWnj*D8pI-%`_I_pq>t}CX6u0;u*)6kAX&T4M2ku|<S_c{~
z#!@`Nff~<wj9sbvG)gLG84}M{ldL!y>x@QZ&zOB{^EHY0H2qrtr8kb#-Guo}b~jX@
znR&xs{`U&i&$gTuf7si)yWl@&RdNz|S8?at!feKe;}yoAP1<qe9$&0+CRPBA0^1G2
z+<i-`sPOYosquNRY43&wO3O1Wv-w=3B3~WLo#JGGqxYVtK0jgp)g-SvRYh*MrWv0d
z=2+`%ZOjI-#?-Bi=gEH-w*GUGQeR8j)IVnGTK=ndB|=j>pk8!VWl)v3;*LPs%vG!F
zTh%~&lYPuNRz--VC$w~Z2s7siL(SjvUV77|M$-P7-h0Nru^uljxHYY0=J^L$T~q7b
zBr&pi?m)Tbq$xA%v^pjkj3n(XuZILzW(#28Khs+^^2LI<e{oKQGQ~CG-{9y%fhO-x
z9FdYUvEIds9{su+2F^1!T*;})zNC{6Eh4H)`ttG{gTm|$*rp9@&l@*T`HxiKNA`7l
z`srfyBzJFQYy6&wRuWuUIm!@J#bn`ZINXFl*v4rGvj3vP$4#{>#u+CMSC&&a3@IhD
z-AL^Z5m345k_=mY!@Z=en0|=iBC3c}csd^wV-H-ERnh$=)^FIU+qet>yOunFBvKBX
z|30VoqH1B5xBPN*IvOsymKkydX3VOF6WVy`w9_q1y`7$A5@ilx5S>CquZY+|5T?XZ
z=9DeDRjz?Eqh$fy?nNwEff-~*Dsz~%i}Wan1w=JyRgz3NGWtm$LVAbrFB-HoL5lK~
zFSdW5_j>9Cg0uJ|3(gN<_bR8W+&dan>rG@{DR4iIoxkHzZT_|vkvuASbavyT$M#o`
zes;47RHrfY2d@1en$)9)*>GMx`kOJaHl_IhySTx}6XH$ilYn!k$<rH*F?i@?tcIed
zV>9z=vZk5i>+8ucmRwt(&;b5DDK40eML>}_Fmoo=6ru+v<KH4VsWX-p$_$bDRnl(s
zCu}WMLIans@`;t`U<F-hsc*c;)$w!3lzuy2;)ar}lCJx5_CP?cywhq(25UraY~Jd;
zV_TX0kv%c~ZfK{6)<mCr8T;{AnM6-*JV$#Nt~}>tIc#0klXKcWm~filWd0}U9kyB_
zUOeOcfKH+()IqiN_tBl?ZG{?Owy}`HnPFH`#@yO?*w{k396{JcytLMGr2u!TG9N$n
zC!33F1Dk<K9Ug9tl+AF%-KMI?#Q_p$9p~cICQ|)`GyfI7Iyel@7WD0LdlMr(aB@?J
zQX3QNL$z`V-*mX#RwHbk&7=9_U@2p*ZkYUgzmpoPCampt>oZ5=XXe((c!@81*TJEE
zhE?x2!??Sq&f*pPTU(>jV~$1oRzo1~x#PK#3)SM3jK)WB0Ko3E>*!9w3GUXl^;7>x
zH-7(+2hTrJ_uA0E!B|3t{xpX11-9J&>~BS<y=e+GT5g?}O?N-X`5h?T_s;CuX(yg+
zZ2j+j4*%yGzL3N5rfp&M$dtsk@hmyh-CZy8L)RgDhFh>Q2T%f|R3Z}^RF2>HoSGI|
zGh~vJ@L@sW9_Qz}*;j=ShI4_tEBb@q%e`N{7m%;=bw-cmz#cCAd3=4|`5zk2aGdeE
z2-NBrixZj88LNA|Z?&!JR#Z?8Ul7*_yFGcUWa#}4eKoun&}86FLA2;B+9*qZyCdS4
ztItY%L`~`G4Xt{$sOGn-x(RcTtJZBw9zm{~d75gGb2LHa{WXt#xdZ*8Rg;IiOxHxq
zOc>k#enb9o;8^Vw$az?AgJ!Tw(?%n2)mlkaqH1F^zXZLz=8?Qew`<$&q;kMORYI0c
z59eQPdPzXHwa*u)Ci`6xf_U|o)&UGTKw<B360mFGxh8=zQfqt=@TJfJLp18>p2oW!
zQ9YAqS0M;<t#Q;*AbaSkHhLq&va)CtS__u;GBL<0OE7EyOKVxs_~U`)P4om`Fl2W%
zFj&Gt!Hs>W!3R1;@jG$dSJJ;{++Hprxo7eCde_2oZbZ8=;a7=)uVs1Cnt#}<4PD`d
z9eOHDAwIi2)aA$^)*5gNq%QJ2x$=3IV7xw2o+@v69QoVwUOP|A!27qU3)srzESgJ2
zwpq1jRORdc9N+)TcmHjQDV-LxxpK8DEUtZZwv=7}uM3Sd#9UQ@YBn8ts^os6kg3Z*
zAXm`J%X@yeyrI*s*^ydz^|+9u7e;M$Np0OvJG^w8Lww_&n(rU4r__%`CaK?F@`Q^?
zDrlRB?mGQL^NmJ-VaXw*5<a=D$SKRgjvgU=d;FpGoPFz#@dBuBtT}R<Mt^=OET?ka
zgL@e45vQZ9=Pv3B;c88TPw9=2|Dk!EyP~uchJJPVTpaQb&B#>ApO7x#_m-|X@M@u;
zdoCg2_m4t!Nhh);F+YsxK1?&Qv)j3QbY5q0&iym@T<$SIMRnP9V>@l6{ZRVdupb6k
xL-NCL=ZMg7jOFY|pi8Kknb3Rh+Tedx+2iEzX1+onr$1qO_<!<*Z~Qa${{Rw+Vy^%I

literal 0
HcmV?d00001

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.040000-0.002000.jpg b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.040000-0.002000.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..63eaf236260cfd71b3d643f7f4389e57c6fd538b
GIT binary patch
literal 73835
zcmb@tRa9KT)-Kw(Ymnd&EI0($KyU~U+#$HT2Y0u|-QAr=g1ZHGhsGOsJM8mt-u8d*
zx#QOQo@&;pS))d+SyR4xUwYpHV9H2HO8}stpa4=IAK-lzAPPW)hev>iLqtG8Kte)9
zM#VuxML|I&!2X1RLqbSKN<v6XOism2Oa6tCl9>1_HytA@8wUpm87;3M&o=>Pc8+iV
znFI<62?-Si^)njU=Wi6m6yN@@+j}<v3lWwNx)28H3ji7m3I+@6y&pgf06@chtQHFJ
ze;O<_3>*|Z0^)~M1`_}U0}TrU2M-Gi3kL)9A@~>$iv@>G!6u?;@afAp2Y+~+AMts0
zluA9*?1tMH2)Lq-RLTLsOAe!ar}|zzYOz2X&V+)Gxd{HF<)i%{JpcgI$6Rn9A}Xx^
zE%;c-|6a_0MnGXfQ?S8cizveWM+=U_`w9T{KVmExEWmfb^Alze^nb%{CL!|<0IaHz
zy4K8(jTX+2v96wcz#i@dN@B8fs>on=TDKS*Ke`c4aXj4k#}kLKa$I^~YS>p4a}-I{
zrWuB`OP)E9Ypa9ebCR#d<2RfB6aY6gWwMrkUk@zXhCaw#Hkz|Z^}`rF2@+g9_d|S;
z$bHONrVGD|Hqset<+>xsB}A&v9vBkczSey97%UOu*oMjplda}$JvpkEDgHSSd#Yi*
zof(JWqAQTLZm><Js_j8%W0!5}!AZ1(_Co$|H3zY_&EMGel7s(s{k*L_Mj-K5>>ixP
z)dFkh;Dk9yAi;_k+bGCz+)8*4E=9KQMKknSM{=1CwI&^YqSj@Ygr#I!gG%6seEO3p
zs<n;l?}N>Xkyn*Wl$ZqGPPi`PvP4XYp9`C++9u&Zgyt{Ad=+=57oLpKO@$NHpp3Fd
zP01!to9s_z>mgg-Nnb!+SBv6Kc3a;$UD<Cd#DChZ@?J%6)~8r+D7*veHtWkH+E9Na
zHQ_+Uhjd&lhyv$z#9!urLYo5Na%#B9mR*3~WcNIEZBFe>^v&VZnvZku+0G~y>;-yR
z=0@>Ie)q3d(M9#6N1Loj7M(Uw-eq9rrj7TPu033vU#t~x8ivQ}1qH*ii-rT}4lI0M
zTFkePhNgwWFoVed|3~l;53BCrW;uF-fm404q$weA=^gOgRdNp&T)`hHfS))3C#L6)
z+BA63S?LUn$H%(L?i0beM>#QY&>S65_rxy7YbN`&n7ruF?U13pjMf6+{AzW7Z1Ap{
z|G*3jstY$_wC|j;i7wcN5(33{C3+>>@hu7((fqvpE=gQsRW^8}TlTv}Frf*}$_O2e
zkW?nGdURL0XaeRdj9>lG5dBr7Qth#eZwjEPCQ;X8<;n3>abCQ?F+Qsku31?Cdqn#}
ze0g?=Y~P$roPZ$iMvcpqkK(KSu=usJW|DhCHp&+Q?Z>dW%8e4Cbs-@>$b%jddaF8K
zy~NtGL0a~i?D{*vF&bi5GvV|ONcNE|_KozlGMU!y-TI@eTGxULyw}j+*-V$0=xFb_
z@*2&#dIuD}1NPnlmV&`4SgsVmjDpgUkiOv)!M6v4vdNb89(&dr4?FHqBATP?{!I=_
zB0>fz#r+O_eba9$x&-Bmha&fOYho)a+ZNjJ!_&6;cw7`?ymq!W^W^6{5TE&>b*KC^
zc|~;{)+vD-Y<E`5>z4`h*kZied8&#ktQ<`cH15A0%By*W^`NcVv%zD7;J*mG>Dr>X
zH+&4^Mj;U(y<wtsNdRwNnVuTZF%)C0?&j@P-7pOZMiT^Q@OFsE_@>RU`VwR9sW~_O
zib#>e6~^cO$3s?6BM6OsIc#jCb->5HYEboNsZ_6wWbBkY(&_+6!g9oO5&U_<-%v51
zNlh&9#Dw!-4bguyQ2(tTsTQ>CFo|m66z!*y(E;`?u*<y$D;m!||2PNCUXygy+?V$!
zgCI55(GE^p)(C8aJ(eRIMj4J!cwDM|unrHO0U9m3ykG?e|M7n|dBm#N$~qfthp9?d
z=?FM-6w87oYFLMUj&YK3`NXpmuxzV-UcCl)Xs&+I5l5a{%m+|lYmlkd!Yptrh9;w#
zE0!j>7#n-=9A(8TB98pjwiQuV6`DDSygXMAUqhFP^tZK03-HfaGD1Lcf>Q%-nvxCs
zdHqsOy#e6xK*taL9k9MYLv?{J0XfrA<AXSn_<WDKS8di7)0%PQ*;r#P^_(KFjPgP8
z0^+77adNKcX6<g<RtzkvS2W$c33==o%T0O8^=K}IHgdFDA!VlUUrCl}x`!|cR5~!9
z<`adSU+W1~tE<T9I1?jKfz|c?O4Ei`39bEtto#AGuW|U43auy)JJ!b-&9$Pid?FTy
z)ZWq^?x5kJco2Ua+M_1bXjS!lCs#!ui5$>QXG*=^qS;8Op#s##=VFJ=JbnJywm&rA
zUe#JbM+c9_5D)L<JRs-(6wxISH8mbLxK=RnuB9hr2WYn*;^y$C?i2jyID(4@yD#xg
z^=ub3=LLD_Sg<|DTAUIgw|SP5pK!zYl3{}rgHN&%qnLvVl!|ov_QJVS_0+&|D?}})
zOyHz%2Ibh-bt^M^KSkkS(E>F>D;=uRr<isb3Ds&(_jc_iM>)>8YfRlYUfp5S5DO<-
zoBq!?(3cit-A<Y7e4-n6ey%vhSo~(XSz>uv{4vl(rA~SoPw3oqyHAqiT27k52;bpG
zT9&;?AY<fPj;W{BeuS(PWIj;#@>-#fbBP4zxub=Q8RZ+HnpyTYL?#a=@)uhDxma;8
zoS5kQ2<z%SiD0?6mS}f+A~q+f(L2cM1-M%Cw74TcvWu?sboQyZfnSMg?vxlVbXm^y
z3WP*<&EtKRm@kz>w}xP~C`;C6N*H!vvjoAfTUQyw%R>}H{DJxZ9W=cMCiue(8lTFR
z;6&F~U~<}eE;b>>mFZzl`(;y3%kay&*9Wg}<$ZJI-us1dJ)RDd?kALi2o!CTZBk7O
zUwYhxadj&sqAb3S>-KC?b2@x^llk%kJ^utG*DP#X?xBwYQ_bAgI?q5qfKpDi#EhKE
zR1y4=6jqB%uBvy7aPWl7;vRV&T$<(^iCKOhCi&#=w2}An4){@BtU9dXx%NHvB}MRx
zVaZfTMDAPdYjL?ZlPwv8z|To3FuE@GCzUqIlsIM=wP&@9r%~6yM&s3_sT--`mqz~=
zS@Dj=oV{zku8;#N%adaoc=DIJXvTFGa6@J{+~i39yiTi$iQP6^Ow6Yp4-3#C^dP@?
zwryMP+}QFU(r-SfOWdy)>S0my#)CZ<u~@Gu)kQr75}UpL18aKQWqNk_gXA`%`OuPK
z;TBdzLor9^{kjPgRCJX1qvHi}^oEJ{)MjJRV~rg0*B-CXGCImQz`GZ=k*K%Pxt#_d
zjm>*QI0)0cisexOMNDZ}wn%pk3rpvu9gFol;9jSSk!-nAAJ6;9+=P+OHI_g_P(Fvc
zY?4<WxT)ASGeY!R)PGOCsOPn|yf1y!a_cz4pg<49J1|B6T=n4C{tuZM1=;|E_i@{z
z4K-V>-E+1pX^N(GW!xwUtt&THS~Py`9?NqD_T~xXm;6eYQTjJoDsv}WMr-l;tx9VQ
z?1BN-J84N8Q%O_2tQFy<;BqA7(SgX`bJ&h1`&kL&tnKLM%8}PX{}xQKM+|P_JUgAM
z<_<IpKMb*s`nkGlmmL7wNbOS%uaKZNQy<C~vQf^b$~F*9dH9Yd8HJP7IZt8^b@0Rf
z-OXfqBJm7-+dJTs4#u)vl0$nq%63plV?vL&+cGNK^)plG=#kdH!}F$xq|KZJZ;;F2
zA8Uj`6BcyB=D~yHO~*Eqn5XZ05vIuWzC`0O`@YM{)Si?G_0d(tcRKBlysi%q$LTSS
zk{;F9Uq)%F@6mYwRPseU7PVq9*~#H~0XrZEWUAmU>X$#DhoZZsq<qQH;chC6c4Gs4
zJY{c{e<FX>BpE9&nyy@ZwaMzQKVgfUe>zUGVJIgX33M!ctaQ!UaaufCHOQVGQ`Go+
za&c6;M>8H5cevpW*e-gq?Sy`;67)*t@IQSA%-S&i)|dA&_>=DC;eRpAKWArKZQFdz
z=dAniNUQj9^V7cQ{Uv(K4n~P~()$OF1IOEov{JY@d;IusSKR;HpI_|L6VMCccP5r;
zmL|e6fpD2?I`K{#75c`Awor_iRYYG-&b#mgZU;|A2Xfvrb1Qn)#H~ZRmgr3lfcT9l
zKn_(o3R<Qxl<bpgDbwuoc{#goXRTax5s!fu)b*;b-nUJ$>6Phd)H2=FL`rw)cU8pm
z7b=p!)}}j1jl#5|*0tMWO(jM({dV$?tdagff#|jcA~9W6##9E)H!hFr>jsAW>BH$F
zZ_yeOyN=3ek1S}svMEa_>bIhMTE6sXFE_(@NKJHqm7$75LE~lQliGrF9RgCKH-(W0
z+sCHYF)GIQpB61kaa+i7K-B|hd89b|SLwPKXn*^Ov6JZE=?K&M(-#XQbJL|@*;BbO
zPrZq~mABH-REKbhF%E9B$Ml$cN{T0PRTaoCpM1ioNsdsuv+VU8=f{mHDB&gzNkIxo
zpQLPz^OE1*`-E=iUO`v>r6Nf7Q#JZ-*x|3c`xF7^EPO_Nvi{|F03=C`?Bx49ptYt>
zYOBYfO`cH8o%mot;S=eu8*e2bVLUM#Z{4do1E&A@9S|tWhOomlDr6>JMpow@ANAKv
z6chSxBK4KysV4sbjE`h73rQ(&NWE|{aMAG2k`7i<k@-GXn$q~l-G)#~pMJb)WooNQ
zqB3YrBo8A@+#WfnIt7QawrmW&iZ((jOYh|Xfy_31eVLqlNiGm{caI1&i}0B#tLJE4
zYZJCrs6O(rBz`+#MwquWYWk)!IVeq;t;H-YFtfykrX6j_RG1$$LbI1eI6a;X<s5&|
zRC5}`LW8EKv)V=rwZeXlE>v+myNgpdQ*WM4{f&dyza&&oc53mNR`TPF*Ch!ih|LSv
zUCD!wJ-dk<0iW`F^WraO8|Y?rd2CaF&TD05$<<1aSx(*dq|(}7hm?j6AxBSiGIwGq
z*;_;ttj`!KSw3{=WUxR1FeCmb_B>BuVY^{F(Nwse!V3LVFDvIJ<k<J3ns(U-C2;Op
zT5DA67o}DE%<wtt&mD!M3GWcTObqzG-?=7IUccBWwH8xaSF>7cqPN-Qq<{WYAQxC`
zJhf@+-6*~bNQNfi#7fpv@J<y3fS#x|V|{Ur7$y!63$4}P7^_DG;ak*X#Yn%0NiMr<
zzSa-W+T;O06LgF9v@qG$(>oxKwm%Q3%mntFQ+cH@OtxPy2u_%YqmewzJlRW}O}Kdl
zk7^MdReTRs{=8_WTXNiCBfu?K5RwUPxnI1sRH>&+Yo~L{W2>hSr+FJvp5|ZIir9*|
z*)~>Eoz6s=G%n!(?}=uRjTNq;e?-e|OPzmg{_>?RO_LE4y+6}&G{F>Ng!|d5otvi(
zrj@URK_B((3w(#p@giEXXKrg#5_q@7d$L%4rZ(2{>$)uQPxSB!e1Kc(?k(kP`pr#~
zqMCBEyRK_H7~{)d>QI#~j4I>wz0S;y$T{{;<$VmgkXhc``|kB>3$Vb4XIK;4dH1Nl
z=cSy{@i#d*I>1u|o#{c|&O`}rjEBdGtbSRS^mh;i;QtQH*n~(_08XmhzQIe{S+#+m
zfRRKgxu^IiZ)HwvbNlfNLM~z%S-b%HwmkL*m;_393rD+K5vM{|vy2R8U61OQhe+5c
zyCCd}j7uU%xZXoN-KHMo{uY^ixqq!u(>W+jq?REPdM5zyPj$1MMTN_4M-zy}ZB|ey
z0`eQ9m|KuiyBDc3f(Q4UWs3n+HlDwWagg1%cAn<+JR9<H1mtLt9F8M*VvGAbVBdMn
zsIb6fH{z?-cS^wX*Ev-#3aj<aM8**+uj=t@pUlM0PdO*@Kc#GlkdBpV%CnWN`}G5z
zRU{ULKGF+XtV-}G?fu0o3r?e@7N<`9>fQ;OFyiZ1YJP+q$mr%Y;NwZ<v+~JO<jKir
z99LrpJoQgT{>VMJZxn}xUtj`SbIgmJQ7l!ro0phZUT_C}`j3B`s0zeM@yFUkTwp8z
zO)l1;A_4OacvB7Xn0ItFar|Ix+On{&*Vd<ez4@u%fE`n>Mb{sn5gT4&26wpIe^hQ{
zl}0HRWJSOi@Yh2%Qt;k}XLxhmje!F+u-rhrc3wU;Up9Mey0-@L<J9La8K6HpCE)Nw
zm#46peU?^ZM7=+vlw3Exnmaqw0l+5w=BX4ACA4B8p^j|+W=|^1Re)bw{X0gTv+AYt
z9~nnx38Sqb&QlW~Ek{hU+weU;whI-+ufU{8(og-v1`d8Ua&NIAuZ2k^N{nancwtAV
zyh|Z)=CE#MJ|C5I<+`Swo%hax?l$kt$-|k8IwvBartG8u``RLBehEo{=}VIoL03c5
zxwkxMkBn8>E%t12xY0G`S^hPYK4OphgSLa4Qy@?efv)}$@+owJ>k}+wx*EYou3Eij
z2z+``Qh)a?ZffooIQJ_;i-+8HdT`-!iD{%#AJuibe;soEEq>rPKmr_z_TyG*W{4}-
z#ErGyfl<g!Ik_%G)FI_-=V+J8Vq%;OyhgrP1HXjCU<y8|FxsNoI{?)?x2nKIbiXJ>
zod+~6b8XKH{3n_J<lFE-$(sIi25?*kw{br9l4nh#(x=an{|-R6jIyzA4d(wAsTu9`
z_f8Aug`<G6aVc@qyOA-B!>d}o0f=Ba-g8*IAR7m+6ToSBn5)U0^9@B0+CZMAWeF;z
zzEjH2c&N<uANooO#-Aldx4k<F*>*V5eH<FomjR=39pcikPkRgfk@*w5t33Et)b_F<
zr_kW;wNg8RbZ9G7k>wf-uK|&*@(hWA4L+p0b6IaM2q~)HC%m`zId0yr?YF)IO%j1$
zlWlBehNJy5`+iljhT7s~iL?JyHxeG}hOIS?WNs*yGiD6;-|yC0RoV6|?xTorVJYDy
zu^a1ti{$>C(3sLdiswDwO6{3firJA_L*VhUs2@9E|7cxTA+B;rpIa8aA7j*4z5W!N
z)cX_+=fsdZxlYQI*3p&!==G0_)-*~pW}z=&t<OPHQ3NH(_AITqxMyNdJzqU$=<kne
zq%>t%Ckfl3Mjl+lN>~cS{|h8jGZ@5RUpcn@EJ^N<e2Oi1G2BTKY|O`dpybQ8eT&eS
zb2_akKBFGrUhkT=LjEkgJ~VHb1wCER4||E&)3C$@=B=DUTP=>J=9hFQOAiac_N;pX
z{(`%u*6GRry!*upF8!ZC(igDgr#`W<OhQhnze+kM=FCNU>bzUFDx#78&|6NbP#G$H
zM5dK3<$^QcY;6_3sjN!l-u%A($(f=CzpOdNUF6U|{K5qN5>O{T!<LbeE%NIrg$%L&
zFD0)<fHkvRsH#{Jllg2%is#6DKd_tze8M-kH^!iamOUfTBqzz?h<@U)DUUxdPwzoh
z*Q_{RB`Zs*Y*<L_QM5{cwSPu-;M`dEb2Ss<eytUyF>@w-i7BW;rVc}>b3_Qh7f}0w
z*jl$##imp?6jD`U_i9U)KY@!qrPQl)Ff0YV&%(gZt1~HX@q6xZ-x)&4F7fyd@O4o{
zeg~M8T3z!=5iVmq#oy~bld0}kyoOW<oEN%hb;TW?ub%#m31+kuV&Ftm6<Cj&yQ<e8
z)v{H+*m5sCxVU%<oEsE=OuFO13+yo|eRScjcRy;`YNmJxfXJUwisiA5+(YV%LWa5^
z_ijZKDbsre#+P`4Q|A2pT&;TvLQ~uCfUA#0oQE>~Yr)h%$$;slAp&fS7&Wll&5hP+
zWsz@)`>U>rN4Gh`ll(iNqkJ=PJO20%3w%|~cx0r9*sg<ksOq;)b*w`X3X(q{jkSMO
zOs9DVAk%WVBpuvJRo0jvOeo?29*9yOb6#kFLrYQGyPhE&*46Rsr{JO5tUWr0#OB}N
za`<c+86hza0|bTV-5yRtE&Ft4CoB{tag3Tg{XLc(HP77L(ydwB@Iavq-Ty8GkxxvA
zxcp0FYeq!o{|$n}k$$`S#plb=^<^8mk9=J(iB+7CHxHWTjahod|6WNLP0@`hf?$ZR
zo*0pzAELA%&=^?Zj$0!c#pQ;$Z>ovjZ>`2?OOnmH>#(ys|4Ylp5m6mKaKMQ(x<{k+
zWV|R$71Sb6Tuta#=0w!J?0Ax5`^Q9O76e2N3-u`8b5j4Cj(n(f&vj3T)%r8pvLZMu
zsHot<j?ek~yb%e@Ps>aijq1a909F?FBa5J>rPQ7Sk>$V6GgUDhm8sIQq`Lkd#{-rO
zqos?%@+#CXJOtZRZaH&rBez1Qbk$&>+z2=Q8Z?H_5DXNgdq^PL%x<1eUuDUNEzkqK
z+g{6OkZn4m+|PxI)q84<Idh6x_jdb;OwJS&sdWi=P)~x$J)>1VwBEobYlMNrHbR7w
zgTlqp?wK-z6Ox1G**={;!+*seoBg-wPtg^P+C+$9ouT4MvTTR<P&^?^rLu~ox*V<;
z^8|4fhQ*;0o8cS<a_$dIzyDXjF?NsP7PugCI`p@EN<d|{_W8#B(lu`YWs=A1T+P%u
zxd?VI7pD$hdj|j~?$$05$K?VEk(?R<G=~?9O%usxc=4s?oAZKj0uE6VcJ8rQ>oS_(
zP|)V8B+0%S`87Q;q$w>1nr7Te+1jf9d+5YjsMNau<me*XR5UnxB)|pEl^02BYkkEb
z@$9!5U7scf`a6oZ1>@DiIF%{U{s=J5mxsk554)CuT!)j$6vj=vk>F64JDH42I$6<F
zb5x>liw*W&1abD9p<A>vl-JkPMnN{q<09BDFn~ZDfR)4q%=Axy8#09ylY~`gs-&qq
zE~`fYzhpmNT~<+1k#&0V(lrt<U16-YDRJ-Iw^}E9n%_P|j}_rH?7CR&Y!mn_v-7qy
z-E?JXm|L6zQ@E6<O5=;E11q)yv*g@YRbL7<vXZ(R?RCd-R4J<WRHIFr_^V}}S(lDo
zWnJri9P7L|xiYCm&aK=SJ`oI%i3r~}|Dd*~$o5+FPyX9xD0^~zJNL$3b=8(*k||X9
zn0ZE&E898U@(^p@1!maSG$}1LR$7=c%fLRs_o=YVSRN%p;FG34^28{v;3uJKm|YxG
z59V4gGGSn80-L`oy*-EgeT{Z@Bw86ie@#~5QH3Q%)~M!bHT|x#1wer^m=>U(O{`NM
zi|G4xu=Zn-3~BDjW=N^2LKjVra)p!~P1_Sv_jUbG{`VwKby^cihDWZk5@ua2<Gg1Q
z4<;EpeyK<wni_#c>n-Ium#nA>mQ}+)ED|6it>UyM)Q0wIQhc;tCB6~5qEq^z#J~uP
zr6NRpPPQkaB1;EiX4lVqr6h<JTu*dT5DEa0O~93la5YS`(!n^|evK$-ox{bxt|q#(
z5F5qsj2->YX>v9@&ZA>;05jAcXrbU=Q_m?n5swae;l=Ssa3pcy2hPyQM%o{3chc~g
z?!254)41nISz1~RxX!PyYiq7ABzr6SE}DNsI-3BwK!@9V#ZT89ytVJYOvYN?k*B;G
zK_R&Vl=(g-d@hL_;w=PjK8xvB$0(M>vR~UH^8^dIw@buab6@>hOuP$R`Ex3Z72hP%
znJNE;XGzLR@_gRtJ3gZU){t2ii+75{V6tI-3_9QyPZ4ek%}O@Y6`+&URY7K%QBExF
zuy)C?^h}_N*mvA+Hn_+oEbPGqi!~K+t+K>;wLBaDc^~xCGsjGqM3Bcboyj#o+VjEU
zpZ9#!;tT;3maiF$1#D)v^W$l@3%@>w!($I2ww+5t!0)A?L>giVnr6)JD7-HcZ+#Pb
zYk2iQCBt%5lY9K9=%m^tRU1lL1Bzsq$}OJQ^*<N}6~yK=eI_oOGABbmjILdxzNwnk
z;S)9+F9(r+^}$q--b)%aHc&{Fr)2+Z*AkgHwKkWKU$73lq#_DU@b+bgZZ)xLq`U#*
z52*iV=s2bKxDmmUNbM|7pcN!dcXWbe-A_s%bvaj2TdYXWY^*e1t?L~k1mr<g_sFSb
zy3HO0nT-y$EB7s=i1k!GDK1VF&gtzEl^wKb6?xej6;^vyN&TNFL)84OmbmUv^rYYL
zyynKO+`7|xxsJN1(x@_$klThWC@0v@yhE|;EZLCgIV^_zx=CKug(@ne38Q{|wOw%A
z9Ja=%(`PIkV`!oj>4r;@!?&QG3bJi7ayOD~y+F1I)nry8JiwNEqzm=$u6)S+xs^~R
zCwTVzoJ?#M-!%{zSz>b)EhBf$`@}7Bt83-RwI+XPY3JcFZ*L76kV46?Dk){-8&V^A
zVj|v6A8kswXy=d<WGrOV&B+HFwgxL>qYEtBjh7zg?q;sC3m;oI5mXC4#)=`t&&xHQ
zyDqe(pSMfTf}1|KZn+EM#6zaQ^V16C4*?4eO0ffnm5Ro;Hg_UMqir!MPy@mpS&fpW
z5ZN@{M}-lIcy6k7r33gz&|o)8!iZk2!^(K{y&8#b#S4gWp~&OZr*(eBTU5G1k{k~;
z7S(1d-w7+x6?`BONlo{aflc#DsrwNFo69b3iIGE#4zVmow5R)3y~JppsCw40v9`<b
z=xEHO#=SJ*P22hRtIWC&uGl-^9T3yAU$Xqul9jyNIvE|(ey9w)Tv)Ohph!~S<dx~G
zDy|D-Vd2DfZjTN)AYWoYE)H5L>l9Jj#Tb(ydR&9fk6S7J&i{2+35G*a|JT~W^*f;V
zq%T&C!Uv>~-+_~LYRf~DemVi?>S&gQq_A~^fLU!t{2eLl2t!`4494*a0HXHHB=s}6
zVX_L{>FT678JjkJ;5dzMIvumpwzAjYDHI2?^;<F{-{8+vhbuQ%laBK<^t3WCFieQk
z?mF|)Y6{f3lWxxjsO87}F?xvNdg=RB9eOEh16ns6l9qlJQDr~Oi|;Aqyz2zT9(HV3
z`ocH;sk9`1_?e5QX@(*C%z~lG-997Dg2{2cRlm`AF>XqCJw%S$FeVx@G-17j)gAEH
zHz0-Q=RYLq$<AiIkXS5W`nby`J~QPA8%HwT>0Z-P>lgthyzb0uFU!3a$KNS~#{B92
zE&086<>MCfia^rQayJB%H78;bJ^!0lJqjWdJJXqMZ*=A3CYnK;tII&70-}C}j0o45
zh~zkYQJBvMwkMX}Y8^|T(kj0NY{<X%s?Is}ZoHWGh0QUfTIJ37yB9GD#1!lWh7C`i
ziIKkp*k!7U2egDet;KtOQVUNh&<5XiA($tWMp7_+ITb+8yb+n;<q|+H2PT)@Ta8%D
zz4ZA~M;whQFCQ=dlcI3Se6k=jN<AUqCu2qccLrRr3P!gA0^H!N4VIQl>;ud`k#>`;
z?vGQQJY_jNlcpgvdQ$!NBqpA%gOj!yra%<_pMVnFlbeDG*!kr`zIfMgSG1gt;U*XG
zd-zdu`(DF`nf6YWo6)BB28F+BBzpy~t=ufkkVPmkO*wjb7afczL8lsL>f}en>Qmtm
zEe=dGiQn4{D6em(|LQbsySr_NT?(w`LzYN!E3|L5;{=zN8<(feNSy#dw+n68lalo1
zMU|OjbRd3ofTQX+$=Z8`e8x)uw8Ac^^1eUQF>cMQ3(FmIL9s88uJkfLP*1K-Hk7r}
zuMjP1@%5e#pm^girO|sNY6mnz|Ni2=JevJj(B9sh&FDOaS1?c`;DRSQY0$Y*g%fs7
z;*TZn#`f1s-so$(cwORj*St<d3h8EF{|UDQe^m<FnPhG*t5rW_A|?d31#XK+#>cSW
zex7C17UG}EQmc5T1pdpW(!UPO*P#QE2m_5KOthEdU2@<YNS0mRerKVh+nUBniaYm*
zE0XhQ<e!uuYZOf|elJfjOKO)oS9URd!d2dFE--P)z~`!0{HqMc4QRiXyrQFOyw$W_
zx)qRFsPl+6+i^bSa<CVu{HSz`FO9{(CLKsqtsSeRQKs6?{AkNjTdkmR?dKk*&tllz
z@r+HA8q(l$zeP&!tiiXcPB&<vGzuEtHEn94_Mp8>Y7%QI`q*ecygTyyzd$~75$6Wt
zTy#<2Y0i-C_<s#-4aN57{3*iuyYP`qlMDLp{W<C29e5H!g|lnDY-FCJd@K<Z$|&mv
z0CX!69X^0r3a0!oTKO}#<A*Vn!Km`jAvJnwE7}apxmiL`$GK>iyR+R(t_+SX26BTw
zoMXbohU4M{4@BaSNOtVf)9qmlkB`U>t;pPT@?qqXvzwPGVl3lRVswV-E3Shq<Q6Sq
zo3^7g?X~he;hLu%tS+zfq(L&FjdE(!U8LpC@Wp5^DSnXo9usifE=j+1=ZkS4v8XDw
z*%!XPdg*rano`LO<Cs`nf|EENBACue8NQ>kU_B=<ZByW5nM8}yB+QV2N84Jb@*D*<
zFmC(9ZLGc#cd@f>@SwAsGk-4|%Bilk`!1$F6tNfVtulCSls=rk+6i6-{PhUkdI;g!
zR@P5Xj?1WL35z`s*M4|`^cQ<elac}UHuTG<`-rLg=+;Nle6)NbGYS%&?SK8CD2|fo
z8H-h((4<CV5~jZR_R?MV#1P5L46UV%Mzuy!+tpZ<b=e+&4qa7TWsEx*p-HfUNs>rX
zodv6Pa^Rk%e9UG+Pf5$>Yv1CDhA?fFY;~v+)R{yvYJEV2!uY_(S9<fQYi<()3~07&
z)6muub7UooWAWuU)$la6*)22bNWOlUOnV2geQ-%4QSFZ5m2Xs~Bb0^jnjX{jtO+^4
z=aYp_5VJ7G$Ji4hz?kfVi>gAJfOB<&=OmY<N);=jVFm{tQf}8A#r-$e7=7v7q%kNX
z@W8^)JjZob4kf?F6FO`R3$p6DsR~#R`Wc55s4!rO8X+_3G5NgWJ#`v&Gip-}OR*p$
zn?B>D$&j+(>4aMM?PHcJlogib1<uF3bjoCN{cLVWO8seX=7_SSxnJ{=1tz~;YFgNi
z>KD2Da-1e>eqc6s{||wcrhDU_aS)N0{Ofo9IIYNDb;Ek;$nk?vF4n8@LXAj^7C}6I
z5Qz|PQw51^F1K-zGji%BL7w2{3VZeL{13de%!OLhiKZmSMlQ1!KWd|hqct0m$l2${
ztQ`^?Lbta5%B0z5$u3>4y$USB$p%6NU_)JIZPPTr&1u_72s^1sWzqpF%dU@X_BIRH
zZ2WDwD5R)q;suHSbrVUiItBhWn%DWHFM~4~=afLZU1(|~a#_~0A)3RHw@{>M<Z?+}
zOIaecn-%9%jU@5UXpqrwD-S3W*7>qA?qVm_Q7zM$N&fHGpBzC31nm=k>)M){B>Z8Q
z->+iljob32H*~J|;CpoXpDmvvN@QJI+NR26qw(?8Ec>TTFv0#C_AqJmC5tnIoM|Pm
zZLf({5(E5Wx%gD8;>!jxrpsqtdK8o)3q$<IOc<kx3#%p1?(PRd{wBrNH!QIolg~co
zsRdr441_u!aFtKT8sck<9!^i?QQ*9kpb)mTmRm*Bq<aUlOWlo^s?E8IElA@&9_(p8
z-8&%TFx{BRN|;-ywA55!E?vhJq!tzZ4*1CcTM)0BUiwYB4_s-@va@}N6I69vNM*-a
z7PYQQjpNunaBg!yD%@7`lAUoqc1>1qJw6zjqVbimba0XW!E7}4>W|$N%ec>2RWF?c
zB=ND;XVkRzg^9FCWd2)D#D<7&h)UO}#rON~5JeX_SaQ$|sCn%`l}|Jgbk0SzR+-*b
zz+c}YH8ju3R&(C!&ELQ-P}5Y6fT2xaI2il%i^Ij?!=r80@$7?}8i8@zX%fRW9_3{P
zG)(-QOyDnc5R{v@b?~fK2T(1cWJfS($FxRM**pd9Io2z#*$ZN`8O$f3pYgu~j`5z0
zR|6&o?-JyQnTVx9YNBdDLL{1QOPQXs)G7X)K7)Tunkyto!3n%ukgHY3#p%%r;c-6t
z#EOixLh4hA%pc|fXkm3Kqw7vy^GO-|s;9P{2o26zg^&t+NJHD^_ZRO4VphKVUxQEC
zB7epi5iQ0Uso;|~JYqPj1OBOg5gpJVRlsG1E3_^D(jRQKkJSj;gO8y$RoNlPGS@bE
zjIhk`ii*;O09-VAI<?E`P%(+~hB_3mMnoo^Cf1|{Rh6vr2dX4c<9SmsY=b!iQ4?ds
z-T@^PFvBNL#X8)u^r8d&!_ftuWjZH?0)a+tzf`jsA92}K`Z{~t4E$x8wDlEW`bh8M
zh|e;LPx!u@u|7#^248iy5$M?XQgky7lb6M$U2!3O$JBb1>vKPv|0QD4;Ezx~SGgp-
zt+Ho(dEClc>JL{hgShMPOgl#vAJ5te?q;am$@mNWb}+{~K}^cx+@XvRXkcqYrxlT+
zB6J`T9ZIcZOR>5vXDM1!6k(NoPcmzqId>(xW1BfRQo28pH$4(E;$X(8wu`L>j=Cl+
zB0S(&Bf{+xB$kKk4j~!Y>KM?KwJ2mlW5J*9Gpyg>*v*uJ(XsYmQ9i9^CQxAwCq?qq
zr4o%4-kjA>e{8r!QV8PgQYABSC^6XB5K&dS0!u-9Aa3yO!e0J$(r4M7LN`Ga&W`^B
zvqo8yAum5$%{`4MQ=nU4p#Q)|PO8)jh4dXj+5&s6FWm3@4j@o}2Tc1e)j*H>ESGRa
z>-?3pi@ZH%#S@YK(R&nF<PM@Wy+INXui^<R3c_pa$J$HD%V21yB|+b?61hauHtK?o
zJ9!c*tPNO4)M9I$6LUnrt(2r{oSP`IIY`UBuySFjRlP@{G&5bjSbI#WP!hcq$7QfR
zfZhcu-Cs?79*YG_g@#&r|0%PV(lS{J7Hzh-i<6nqWN$pv@m5s;K5^Sx78OH*<{)ho
zi})~saw7mVNKwU?i<IoLI^yW_VINXG3$2KI!SyV`+ga|@JRCzBpo_y=Wg`uZE){Qt
z!up1(^#@t^M|KDSJvG+g%mHpEoWN&iF%4<{Q1|$j8>Px%bFE>zu+DUjc}K0WqtCbW
z%S@EvPTDo(6>RKR!4XGDJSjv#X|QVJJUkL_Ed;mt^P{(lF6?g|prDE+Cnd$BtX$7L
zYpp>IPBqhS7Bl4*pbw)2T_ZZ08?AY;P$YEe8L@k{ncKJYR3rLrUh$D>X5FF@RnWkO
zOt{q5z24v&^j0glb&)REhy&V#4#vkEQOh(To3E|Fd@D|ZH&R!mRnVv<y6W0qAwZ;+
zOWFFW#Vkixt$=E``<TT|`tvRAjXL-8!$`+$=TL$$S)19W@$dFXYo07z?A=P+s7T%e
zZ`_Ni1gvciHXDEg_)5m`=4RrbB<3Cf1^cI#h4UFd+erSV3dq$_+SO?CURh0|Q-XOA
zwH9>}?2N*!xtFzE=;3hEqoT6>X-{wvSlkp(R2^6yUV7+0d@h`B%r>-bj*$L&q?EOJ
zqSPEV(odocsi4?iFk_9SJGdxDay>+3yzwL3&KcFhfX88O5c5?+2_>r{VkX~JE7Hfn
zBvSqr#lt!~B)487p(<kS<a1r8F@68#ho!ab24{r{$?DsfA*)NKHVy9C{2if0+VZhd
zb2SUQCJah+_^WPWB+bCr`m1hYjb498`|=lOAjja{LZ69P;=f^OXB)D!Y4JhW{K+nk
z$VoF`C(eViu>qE>Q8y3us;nS<?Q9F{J3xK#Twb3#eU3>sKxJ~8YM}Aon}_owTnTEb
z1b!uxi&)?8mpdU(4Dlq6`qAgnd(h^%t*Rw6r`b?>;SBjwsEE_82CiyTNZws#R$<0N
zwUDIP%w##)CHl=XP4(9d%mIr*GpUg;FTGr=3%%RQZ&uXO(4GLUQI4N=kmyB=Iz?|>
zPQ`Y_l8g`PMVE;STek>4{5BFTf%$<m3!eRh0%;yQaaEkT%U*G+F;QeiLHg^W*G#1V
zj-?5v@(A67_)vOMscE6>_~}RCh8H)7nJlZQ#cIW!hf%`;xm3Yb9cyGII1inNEBnj$
zw4C}e#Vl>%Cv_dmiKmvSdyToGsv#=$FMAdTzdKPI()OKOE^YQ|9S99@o#?+1$b~pO
zz5b0<%+9gBlf{1raP<(Z@ZDni;Iyo*8XXI@XpilY_V51PJ%bZq{$Q%*yKg&ffBz2B
z*VlH;`|sH#<m1oA#mQU{Fs9&-OIis({5C2mr(8Y4t=>fk*T0cDPU9{Q5SdDI=XG;-
z9L6wLkz(D*$y^U~3mNxz%Mi)&wMT}!Oy(ck>S81-=A?s{duoMdvY<)N$V_S4aJ6n5
zYEbpG!7VUS1)i<n!gn!%Iz-FDakO^`&1I)3TE>`>u)}6@P+wgBq#j;Rd7?jB5MeXl
ziJ)IsM8y5Gae3-q09RxR&&^TWRIgx6RY87ob-B(w@IDKXyLMB#|G3gLC#Imurf*8o
zJ4Khe#o@6~gP(Q{1*>x*$dFDmmBZ!N0D5Xx=!DwUL8PU$0-glin3f<u0csOVBO5jX
zCey8m3Ts$~(++<zWr??F{kLv3o!wmX;|$Z!!$#lcCz7JqINr*5tpvd$sA#8U>2@iR
zvEPa;B??&r(uGEox)XMQPf5LM#?zY}>ks8(v39`_QgOq!!QO4n=*m<tw`-)~sF?vb
z&6Fj-`Z8JeFN7a;I7-H;#A9n-IIAP-&c47T<^WSj-%&X|o=!blPhG203<34WZ_Rrl
zVyvnxy6ux0lV?7wemBHWKz>a`y_09<5(gG&r6nSOp0LgIQ&i{UMF+{XYO7)+u3>?z
zN<4R`CtMYn5}2|P4o3<EVFKo&w8WSLO>&Ja)~kdfXtLQaR)?#M_*95;Pg6N6w+`SC
zX4@951|H+e>6p=M)`Vfgr6<DJ+QisN&5UPj7l!Q^Ydjv|jLgYRr(5RqA>~F`S7ZF`
z{q4EBHq@eb;Tvt<3lBjY8XD;SBsr?6M%-wr51E6nsuO*m1(aGJQE0)=zqmQ-ISa}s
z6Yxw8DGltw&f?!j%~PFWKL}9kdPvYc#_iZit0s2&W%Ej19=b>Qgsb1+kEKX0ThxB6
z@7Wbs;N5f6>^mM8rw=gX0^@2C@O7~AhhVYnZSiRm8oeLTlF*r>mow_r*ySZoYY@QM
zvFa`3jIH|^vqmH4)9w7JJOM2PRllqYbNy7PbQb?^A>hopz|-ubTG+{9$D_2pB#m0`
zJXRE(%Eu7TNHkOQ3{A_OqQg3AI`IhakXlR53yp<NIPq|fma)0-%u+b)yTmie<`j4q
z9G7Y?)Rmt)0(EJMJ#OHXj-#0MQTD@bZF)!J+&bosH8}<g+R=8)qIauSd@6)o`J^XB
zQY}jP=u<=}jpwA4hTUp!m2tc_uMn*#iB7;()@S^O)lsLa@mM(Du*IWuKxQoRk$9ql
z#CbKmA!qhGya7#Y>Y?*~=>GnUi{GT42|~;#*H%1&#L6z=g?bJcKuM^kp2|a*LhMd^
z*ua0%DAl{}Q^C7t^u<wlXwUhp7mE2|N^IH4T$C<|Ndh2wNfPu?o<v(0o}>Us)Y>Bn
za-hb6wV<+tN?qQ+ac0CiH;yE`)Jba)KVd3b7ExfvIM%EBdabpVfLb^Z8a6nuAD#SE
zQv8B-%C*v4@SLbwU<kVNy#DrTAhd_dwlOY&;N~q^mvihpnc@$vkT&`!2gW}nnHx-W
zNt*x7MWTqBYfeBajeo}5+gLq%sv)5E`q^wRNe;Jg-W==RNAcTkyG<6fF8t5?O?Cj`
zAhN-AS1o7S@Y(rbI^9~lkF2D$GvDfJ^-(^k#)G|2yKLI4=Sk4^9q?2)Il5dHP7aXr
zd9^VqpJI`vDmsYUODU}~#xhP?PIom}d<URldWxfor;<SSAV*M?N51ujj9h=}Rzx^H
z1(q=;lBEx}d8;cf^o|zr7F!jgjV|I_E?l7~w)RU75Dg_o^dyHACvN;2KAV(yJ06v$
zJC=*qWrvZ={8`2IokP^+LV58c>Tk`2jQ?fs#G$K=806ty{>&3_@|xVlk;pn=Zb?BI
z*)A-t<3k~}eoT48{mg(3!XrSjK0=DS;==&`{S#)MJO0dBAkpY>h^=JgTsP>+O+eDE
z;a5jbPgRyU!cZ;0=64vRsjbUoo#N4e5FGfs{pT2bHq|=g;DI~R;fsM`oA^EhhljjD
z-4o5ykko0V1#P}Vs=F0RG52gQo|f74jB999oEv;!x>pjd24FfD8JPnUil&>c{@a<n
zzYgIC0g1j2Mj;Ajnwv;7PO}Pc4_C&aZL$SASl@~~?w>R{6o{V1)5ySc7>y_?Qd8$R
zKx>^6L1b#eA}Of}Y&C@SMTqvA@xE5Ts*7{AdL8u_2?s(u<?4Jjh0eHqvtT)?@0#7c
zNF5%<uZOVtwixNM(B&94ZYQF5z}n`rl&3he?JYk>LYSty%DR>2P_A90Vh%2UXhL<B
z?RTlORR(VaNS%fKae4(FI|Ihx8T3*pa#4}3M;E~h)aqWkL9-#pm4vaW<Md0YYL05;
zr0r4xTkQCDxy1pG09++tD^X6uXyb@j=N_NulIEB}dRpRa3D-2d`T|U*f(&EdR_#sa
z*EA!*8MJao^%CG3zvN`CEnw@*ok13_!UTspyR=H_0WwDw`n=`d?1mTbM$_ky55Jp#
zTo%j1M9w#8^RGy+mw6EydBM|h7<@(bl{ebG!H>csy^oTvPK!r*&qX5t)O@aV;)l-m
za-6M=VPmd;<0U+I$U&NFg2xlH89n(Lg+yK$sod(2eKkm$b6JO&hZ1XoO3sMd*<fp}
z(Xv5HG0X_HxWhi~(LEbY&-?b1G)4Rs?<7A^ITZFI8`M)7lr#D;{N1^-m5co|q&{8Y
zj_0je6vi@ay7%=5sDbU7>_>x1@u0!wFP;x-X3?f$Jg~a{(?h)RJHQE1Q7=HmbrV>A
zGW8C~oRch&RVa=~*}?sE_$YO_4viu9XlNa6;OW%5#Pw8`oD4zKSmF>Y(u_O%+*S5A
zdc)+>_+>X<xQ#je)F@83jXp>I?yU5%+(0Ibh@I;kEn?i0gs4(&1eORhr8J1gCQrDE
zQ^91-Q*_%cJXl*fI8<_VI`cB#EAxlqW$Ki?<rCk~%!oq;MtCXPo`KOYeF-Vbzg@Y2
zVy?gBu!TB**Z6|>>ETq+&mZI`VSf1Mo-rzM&NKN#cCKqx35@wWH#vfZC)lHJe>HtA
zasp3YJGmUOjxHbd$4gR}yZz}#yL(MZj+NB3ipX*MUCM9r`rV~#@Vma!I{<?!x#VTi
zgY=-T##oLj2NSk!^Pbbw<x=5db%l1@eYl|1gX1Bv`}-K3;Ot4=&EDUIO4FeK!Vw7k
zv@%$?F*UBoyai6SsB3*?{_FY|#HcuhvXkV0*`YZh@Z+%(EhdoEn_3JtlS}k7MrTa(
z-$+4;$I3JWcNgVIq<#!LhQksYR&!rV4PhcQmbNEGC6SO0wpM3Fz6}}x5~=IF9$N%`
z)W1;_(GVrFZGnM*V}HqLf!q=&{Qt^n9jq~!9N^cG@7!bSui4p3oXo<Gr#<;L4Lh<a
zWSJO@jVqnxn(gbyey0DSU6>nEfI%sYTh3*1Q9O+{MU$Bvd;5aPe86gnK@_}cQfm}C
z>$#RcuM~4Obg|mE7-4U;)I>ZPp&3+Eyx<An=~1P?xQQW@7U6lX=dz`q`#Bib<KxwW
zfDnJyUZkYYJ3!@ybaKn3YD)efzMo63qi2pGyoP>%X)H2O3nhFB%CXa-hqYXE!>Ew*
z_dT#^Me>tW1eXXtW;fgdlXHTGb0RJ}9GI5t9grio#!+cp&;;C#5%+3BPifmY5jv(6
zuCppkoe7U0?4|_3j70>C*4MAi#LFMXa$TYT7iXlIm46NH{|m4#koVKEh8qRN!ymga
zM8(IDg=k5Nx-iK^#M7gDr%MsUQm-;={^b0qex$2w$<SrY#T)G@g|0YCy2fGfvOF;j
zvDH{ur4!G#e%Y!Vt%OgvYGdeyq{jlwnuG^;tH@PC`=^`bFRtkx=q%_Zw-yj?VDytu
zrY3?_XLu4wU42X~3rIL+!`S-h1Q0D$Igin?dE~vdU)8^l`rf|-9(+}Eq+U!JP)yC}
zq`uD!u%+(0N-x0-zGgH)-6?*YPP%>WcL3Qj=uPSTvEXgqiA{=Z3vQ#_7tFMc^_VO7
zfaQJ0ijb``!1YN^##Vdf`$vEyT=@?8HY?Tj$jpyP<%_C6p~6lTz;(NY9m5>I$d}Z^
zPI}ViQ@$laXdSK^wmu}T7@jt9-e!5^RHjOT`g=J~TA1kT*w+YJf%x3%U%}RC2culJ
z;RF`T%pYEtT8hqEmdt)Hr9gODmMduD%`}5ycc3DFC9mI?6#<gQtHUVXvsL;IU~!%l
z3~t0HPg2HX$7B~svtHzZaQ)OfVb;>zdZUtu$*LBzv{(Inx@b97Uti3TZY{ExtvTWD
zDVlDJ4514j3O2xA7_r^uuX>r>60*{o2syIU6qFOQ#<xaCb?6$fia$j0v6v>dTZ;2w
z)HkI75<{n51I;oC_8itg2i!}+l{(OthJ65-0XvQkKY@_Ym~-qR3eRQF40Plo!kFjA
zAYG6`yply(?2no4;g1(GBt3O%NSWODnpH9<rs&fXP8h#30@rs*3a<uNPZxQpgQDGt
zNXygmE!;eE1INE^Hl7fj-t487Srqwl_0>#{A=e<?{ZabKp**O7H)7Yh5Lx!cwYz1w
zs5s=Smnv4n>mD3ej*@fZXKx1LrNUAR2hcb8_Ot&aoi0=)AR$|?m5IsC@j&?JIjWq|
ziyuujR>3PG#65C9HJ3(bUHyDlME{Ns{sm9Meb8jMrHpt|9$k=_+;+O!Kc7s^-f79q
z+gp%qG0oF4Seyzc{Il%1rJ-ZUGb*AHmMF|pOH{=g=Z{&8Usuzyw~G8IrPx=OSc~M3
zn^Q(8)x|(HNLb$;Mrbt;yFj{j>`oIo)$!b~(YoudG`0|6h`K4`wY!hTaRd4DIlnd2
z5x&GM(scrHb5w%^-Gr@uDPFOiQ#q2@LD%c?Fjfu>9@XP~mA>vkzHl<4;r5tJWTagl
zFYDqM4N5dDHz}CV`+Ge{4`Zhw-WWMX{7RFLz2PJDPhqX2Gyzi=0<C5EBrx^v!+J>M
zl9Dn6{zkvydvc$DY9}c(+v=C46CvbX#ecHq+XOzf<wwMz3Plj|Y4qFw=pN*-htg|4
z_;0UdNZD69lySP*%q@@1n2SqovQV?YrnYzc4mPdpW}XwIoJtOS5rpY~25X_ZjPFqZ
zB3m|nkj~5|sE2;%ogpf*)yHr$ZH)4XyC^9F`5n)+Fv|Gtr^>e$!Ow*iCf2%%TfDpe
z4{gP-y>S3>0oUzyJ&PEoQE&!UDa9W~E>M$VGGDI*g!fjd@}^Z1m66Nn^K@A)fH6v@
zJbDXB8}T<c+?L)ePF*VfULt1`bHt}wBVW~^7g&K5!jcqH>Xug(3*O5^%|fg;(eXp<
zT9t_7sChZt&V}Ul=3C_H)7y8zoBBK8`mLh6XFnKZ6kpSlr<D|mMu_Yv!14}wjd`8Z
z4DI>Ux65AFXSfm$MW*Uao-Wl#72PXwXg5^uk+|K~u2f`+7ed>-CryE%q<6J@OYg`z
zIJg(I@CzRappyXrEox|>pfK}px1W#v(Co`HMM3wPr%exNYfB&&+f>d)!P?4lFSay2
zE2eUn@K?1u>YR^fQesBynb$m@osEnLC*(ySt8X=Enlfi9@znC+ZuDy#|H9SI0dbDm
z;X>ZAFo@ZS_0cGH*n@$IUFJtq<E5!7w>GM@q1`v0bNEKHA02JJ2bUP94X3N(+n+i1
z2IlY%aA`UxstcVqWiWE<^~TZElIxfJJbd+)Gmc;HTH#k5eHvMYNd1_WVYya$$bL!G
zo#fA+-h(^M!H7cN{Bz;72=(5R+Q%3;^B$Fv#*40aaf9cMU1ik3H(;f85}SqDBM;N<
z+~>-gZAzv&8UjU}3<3T4X^W;9AO9A$=HQq&a*HDq#dI!pNz_TfLH;R|GGZ+8t>~&_
z=)HNgAZ<62fU+Xu5lXY2<h5u791zBqu!_22Vxv)GMX43i5{dK`j4GJnwcfLO6wxvE
z5oqZRO`4tU0gIJJlNMiVt8)UErl>>@^V2x>9{!`M-iSG8*hG4-OSx~P;KuteI}o_>
zzX*G)sJ6cFT{pN(p|}?-?!lozad&rjf>WTyp+InVm*DPJT!Oo6aHm*pv(GtK|8ahM
z-z970A}eFeHD_LVKA|vKgeXny&KgvUrDADHJr9blM}6Z8*QnoZy7IAUm<<c7Sa2YT
z`t-EuJXdn%KCVK&_+iLS)B3>gnm_aNs=U2|CfEGTV11^7G7#4?U-#<$x5j(11qpqy
z*6iF6f?d|G)mJli`IZYmoDS87%xy9#AFIUe5gGVxWgeYKXU#6h@L~Yk(*}>9qGi&3
zH@18-l$m2_ZxSGhnX1xO0a`hmKZcDl9MJ0>*b5}=8$JPrs1q?h^!8kVB1p)W!J7+}
zqWHvMTbu0>o*lQvI5^8SThe)LttEH(e}I4re_xm%@Il|TFttm6yJ|MXzy&M%ydb*R
zQI>ITf@QLkiT0Lja8Cby66ZF5N3D3un&TwKp0_@!#IGXE>f|4ALMCH^it16P*-Wl~
zcUMl5humIc4NAtw52of)KA*>6M;g|66wux1LqXWkKn+Cu`iW=Klf!cFh~1cX56b*F
z)pYMLf_K~qd-&XdRwbsP9WUiZTkJqxO%g5%!*sg27O0R>yAf;UTAHk2q>ez#@~(tQ
zsUN0{u7;&H;ZmF%yQ^@JhQ^dE-tbxG=hfmXSi5Jazxzq|qPB+m(sxTS%V6^K!b))R
zCn@FCJvZIV+|nk&a!{c`?DDVMGr1xhdyl-mT?BPl<C-B|gXr84vWd+(-~N%kI_EHg
zJZY{vZ%HbT{JvisP0>T|fcbRIV_bx!-iJ8vp5f`1x2V~DOL~4y*+snFz^2b^jj1)W
z5>HRzkg1x)!Qf9F+6N&*)u!i)VYl65s?nH^k1$^<)1KwVh5w4D;c&@oyqPXb3Pz;+
za;Fo2V`Ry~Tl9Eq&9TRXWfB*@m9Avtd4sZDKEd%z81j%lk9VOqpje<E&zOKVY6Bce
zNuQK3;3i<FE)FAF%I|9ulLTw++o`M9Czwub7!F&XaL}UthAs|o+YNg4(kVNW38H%u
zu+*@=4i5(JYP*8x`e+t!Xf3*bnLJNg$LsQgULxsB){|K=(@3yQ8z+^K+c>gn4pH8x
z_b6?7<R_IWjPD~$y~_<9A~~RN9%B1kgDf_WF!OoZolu)Ckk8Q-5enLDvk)Z=^1Zmn
zH$$!hwtUb~8Cx~_1JG|=;kG=0>rQ9LnE3UZ)+{kkq;?89+`OqsZ+gZRDr3$%_vpsk
z-sKKNfZDDZs%pI2^YFN^2@`;LHwDB-?8Q%AuUhOs7Dfyw2D^wTOjnHFObCRf^1+qF
zL<M!tl%F@=J(st6c>#taN0=-(1g}Nn>tCxr7}B2b>_7NwN>o=^IeSAHy8|MQSOe?&
zO9;IrXscx(P1#FIYlm#SG_zTU^7loykEd$%ZkV=y%M%YQXtbQ>ySiQ5iRL7`FC3x$
zNva#^$@RJz-&m><@4TNg^SoHP_MgcOac)kz1(4v&=9NkmfXE5{0R{uD-$WF%3bC>j
zjG?ngPcGyQ*kPsFZjl5!AJgOF=*Nbys!wk$7nnw70N&6wBWo(PZ+MQQ!S?^>jz6Kv
zbY$K$p`J6--b|dk3;kJO9WEi2Co^8OD`Tx8Muc8Xz!F~~PDhBz_UZBpt()-6-L7qH
zGyWvC=>2vx;?B~gbRm%hi+;>w3k`bExGZkDZ-aG{Z_h4|gDB-9?_%;HGg-AoMSq%S
zzDZt+DIADVZV)_XV-FG=*x*e%lMwmFi^2Kk$gZEAHNqCwb0edcMpq(>Bx|zx{)T`2
zBplQdRe2{Sn?Cj=IO-#?nKDfwd3F}G_1Ssp>QLPCkt|5d!b-H}Vz;+Z_<>xvwyeMM
z<a9_4&$*I)GnI`|NCwFLaeV}^+^h#E$@BUcKTK77f@QZ>@P)M{_6Zv}_vtb6#}APo
zvmj_Wk~$$!i-9`fO3YeLqbnxFeA*Fd)2Slh${RczsBLYOAWbIk|9FVU=5Ol01rSl!
z=bN!v_<Ll`Lir+PfYuwX2Q5EcGc)nMs5833Z2d5qnJUH0aRKQ|Q^v`MZ&}IjfK|tJ
z>YUu?cnLxHi#MwXIkV8qti0Y%M|8{;$6=Y&iB~R<Q!ei)(`0Oj$ij1VwV2k-t0T=P
zA@}>WrCnMIB6(WMN}2a^`@gP?T(q%>h~CV$<VqGuncNzRXJtqsQV1(<(UY~Sc3K*G
zTK-^W$HDOs^U>fv=cK~bT+XLW`m1vCy6-O;`wLSH5N?rQO?AZ)VRSl^u#i^niHNAf
zJ(jmR*rdX9o=oIqbVW^hh<8@^LX5lz@k>}ljnIjf1BHV=&Rs%L+kPH;nRm*3%Rv;1
z`bl?NbK=oZ*12yn%9*4Lk-|7ap-0wjgM9<~ltPhxEalD3(`xK;8@+|$ZZ!|_IEoI%
z=vng6sp{>z__ny#;k(DChHkW#adB;2TE1G;rjY9HQW4RXPp()qN$XsZoN$F?>{1e|
zM1&6Ho_*|cc{=m5dB$+FaKrYgJpTZvCZn#6lhKzrwxVAZ)*6TuX<cSluiFR=BlOt`
zWZV7$us{YCqQ%w%iFdN%dp+Sprxva!vRi?b0gS(a-li@U+0e#skAi_~AJoEVwElm!
z&w#wLR+)WvxAu2AnG|K4Kemcen>4?ZG%)46)cYPslS_cdX;p2W+WaZL|N0VslpXyK
zkg|svB-*Im-ZftIiht5!;{H}D9oeRdR{!)Fe+;p^#vi-#OEslk#(JmDHa{lRLl{b1
z_y_$~HSuojln&&v=_0>bb8XX8mJeU?uDjEKD1RvCjVi<AN7c8a2X)kdu1CVpue1#<
z3@9ns9dT@<iC8AWdiZomA}v##A;ljADK|#d(b}e*kKMX+X7_ntiv2Ar;V(T@_xc`x
zvGE+<<Oz!4@xBlM+ZzV@&xq0k{)B}ojMJ>B%(bGdSS|9&^fyYPNEKN)s^Sjl8;G7o
zJ@V0Nz}18P;Akgp`rsBb<kggYTBz`jqwLlR2h#F#!|#)Ce;8kXRWQ<lTjys@yHeO1
zy?WpDy4Z12!_FnEZAN#o{gvqS=bD%S`8@Wp@5B^41bl`4ea1{k6ii38rj5;}9@);<
z)KT!Q>=ty#9BA;X$8c3|e?D=@@nG;Ywr*)uhX4M3#$#ie+)TF&Y;3MD)`)7&d=Q)d
zQs=|51f^b<lhwBfuE|Pyy!i<E^Rvk)&ty4IfaxrUV)!ra<)f_LY43e%PfFY9&B1yF
zr4N+T)TT@nFUI>m7eWk^+6%ar1|ty-g*EW~aAxl>=iJu15=0g^Fq50D5)+$$yCCL&
ziZbvkDtF%Y+C@IH^}p0=G(a`j_qP5nuDa$r5NZzf_B#rAOYLpq6a_4qFJfZNU}6aa
z*gPp+gq*x3KoPugjV*nWnyiDMa!w-i+vYnytiM&B`@BbO<{ac3jWw&8uEA+%3aJ%P
zVj$fvMnRYdMQ!m(RaS_BrR_MHh`}hH>>Q66mpX?h?lNeykU65Kj+EfdhE3ZjnmFb)
z)`2Ay6<nqiC-3<b#k8ua>x?TR=6%fmYNpTno1M{@681+EB>(kvC&WCl&5v?9?(<nF
zx)EjJC0jhpI4NAAfq-rk?r@sJJpI>wu06_t<%EjzDE;!o_sagV;k9qptW5GJLVzAN
zoLs`3`<n@+*JRPutPgf{9d&Oy%+lX_Q{D1PrI#O8OIZz2yd#tOULorTYMa+lpRxO0
z&(ewtFD_Y&dj`6b$Ec}owewAdseR*kGJk(zV5yR3^)ql~i3m;Cj$W4M`3`7LuGHbt
z`Hlb`UxCEVuv%xZ-`6WiOF3Kl6c|-F>Qg&@0w9&yqn`3XnK};hO3m<s0B`x!GA0zi
z(b7cD$*dI&0b`BVudHI>CgDnS1_n+N=t<2va1^_!a^sXG;EoT>y3*Qj-_ppPxrntr
zy4AM;a*ZL)bljBYIor!fD7QgSn9K`27|<|M<QA~CJrWV=V91#6ux|%4MV+;a!w59%
zIblR>cZ+m8IwRRwui4b=j-lZL?OHu+xwEW^x-6=0M|T<oanBpy=()TKbFf(=B>L&I
z)$w~-C_7ms(QH8{>3O9O^9>_c;QkPC?Jt_R&buhdN%TT1vLfb}O<5W()n;KM<PtuJ
zVAgplwzW1~Z|0Tux8oo`y%8TFS3?Z1K7Dlj5AbGA9-5MJTS*@yd_t{xrg4_!Cox>H
ze}JMn4-eijFdMmtd3Bu3bM5&pk^URBE5s<bcwG!{{u7NOv6HnOQg}bvrcs?}Y<Fi(
zLv}<%pGHOQOzM^YrqTJ87QNu9-W4l-`PiAbb_JA)X3cX^w7NAib&=e~rANG;656zG
zYM)7<s915jv7rQ<LWceXK6F+*itm{=;*G$5$r_Q*OT14^b_`)P2^gUMlBak!33k+*
zT@G3fHUreddEx$7>bZ;&kx#(sX3@0C-$`zhlJMN0BiDi#T#}pEc<61mc`KsZ{ury(
zg#8rlMzPw(vnqYH&A9Mng58Jr)Ip6M#RbJ)q!@|GH`(%?nx7A{q>c%Nsw;*8J8Kde
z{v?2|g;uc0FEWz*^L|j$BwhUjXe!<vCK2|iAO$x8tin?@6;@(;A_mf7C<te<HmP-v
zj^<0{vKuFwTw1mTZj9YXJ$MbvRv>d1UnADXJm##iw?J`_?1u_(3Tc|I%8V6C)~n<@
z<ry;bRH)-%X1fn(a#C*+$NP&r<hOurrC!7Gp1KjT-0cKx&pq=x#8R2F0p)Yw%O4R{
z5)#^eF-6tCL?op+5i0lIZnvCwG>&}v@(i>&?~;@y_H`VYl{C;D3X?z$&nAMQuM9i{
zImW_QyiIw3csbfzwupsj7H8+`xluFUOR0_U0z}~z+cHC@Qm5|P&Z+{9Eu);`@kU3W
zaN|1Kbt$}?xvGfGNuq!8Qw`sA^A4};MTi6Qsl5d^@i>Ch$cjkKA03dFkrTIk%>}=~
zJEgH=P~u(<>1H<45i?iTnqn6d83H!c5^1!i?x$RqkxX~!bJFI?3zhjjsBxL0hr*{B
zV4ULI_xB)j_3Jshyj7YMUA)Jp58al%hCjh~6@(pKL?;o0yZeWQvsU|_?;*mZ(Jx1|
z0bndD!-|Gudn82|X6ej2C8oI7iG@{>*mRNE(=8hzrLiV^bXEwz=3EooZ<Wn_t)2^)
zCWD}b_$ggs45x!T-78!jgD4=su;lsA#>Aj|bmawY2e72ZLOXDOv`9f^t?x8J@T$d1
zXiY~ldXxjSnQG<HZg+6jY)nSAZzpE1aVC)4vT>;PNe=tWEVQw1i*g1dG?KO`+kR_k
z4avQ^0}3$84Vf=4#0{nkA`!rus0>3j&05Qyx=}_8eNLP$=+0&?%lQ05I;I_?mJH54
zG4)UJ^<W6tq0a|T&N_2#+e;)F3$CaiAjAyEwp#feg#vfDO>U8F`f!(jwfY4N`<B&M
z8gkmH{%m#6M6KzjfN0*jrsFno7UZu=z|~k0Rt9b3Q#n)hw#6%|;xo+dhs3ZoTE&Fx
zquRyy6L7b&)b*E<R5TbRi9l%&i<0~i!lR)TY*A^Vg<Gg|_PHYSOX_H}J++c7Vp&;P
zMtigM6u*i&)=b<^eC*%I2-W$W5Ki;V+O4klFK%Qhk}@G1a`$(CQlwed_EOsBgsjPt
z7BR-Pe$?jPk_keSPt<v*vT`pMg~OLr<K4Gjn3p~+A33K)6l#sG9tpF^oCK>I4ARrC
z^Uv?_4xoKmkM}P1EP&sY4nFpJe?Uq+Qtvbie>gj;i54y4_BDnZ)15zfeZ;`8O|6-x
zGQ!y+vGxSJk3Nuc+om;ReyNiY*YDjBU6deQe8wwSr<HHJ#*eHSr*SI1{c{dsF@ZD%
zk_o*o1s}agvNB_Etn>KaT-|N)!G8d&(nnLY^zBJ3XT{JGOnyu|Qs8eNaXwg2+=#w}
zCSts!uwVwQN7Pcy{f>&_S@cjZJnq}i`5*W#5Y%zqV3&NJRe}hSBgJ1{@`9GgiJFK<
zm#0d(@Ajm(zI&!+l}xl?aG&=+LTl)Jlorlwl<@TQP6O(g9gn*+3@!ix6)g0cn6m6o
zFHVueH_86!q?io-l3U#zD-UWJ^rMuZG^{?mezSmajhK)Wk*~_Xx)wIP(uIH7#KCo8
z32#+=8udCzR5ln2Z8sGk;6l$K!{bz-i)?8!8f_e+L>}VMWz(Spq%lehqqbkIt{K@X
z>uQXuQ`$DvPEN7<aYp-`{ebzA#Y37c7wV7FGTX>v5=v>0(-3&we8d>|*4s`SGr=y6
zx#3;S6Ke-;{6>MnN>ZVgyfXy6pd^`@@0VV$2Cpyd(X+saouA)6AMz}ZDqp8K(}U-g
z;+FC()3rN@%S2)1GBnb$nqtufdFOfa%gIytZ+BoD=#3_Bsj<My*ndCdDPGiSYF||z
zPn)SCPnypC^t#6M*F%3TgVBmdlj<QKmyOaWb!a)1i&Wlnn!(X8k_<O3{e3Av<xf<E
z2#{B@x_sm!=G@5Z8=HZ)sp-&*iZAOz^ysLVwlmbR@~80^j{9ihEDtTtAdamizxCg4
zOG-u~WLTtVvmbMqE$d%vM1)r_<fbMncb(k$yM<*V(kV&bzh>pq<|>n6){mUB`4~Cr
zr1++|UiI?BdoF14qvm~yv}LnI4%-y^t7GucjH`h&Xub8aRjG)@g2X3BbK5buV{6p>
z_gp^J3&h#-lR+`YVXho<u$AJam8-)7(%&&&d7tzC?Ug0ga0k;>rF~QCrM`nu8IG3(
z;**?u33l0eOjY#94`<Bgh{lMxT~^erF*MRMSoR_z6=4ekn872P8b?>Kj%;At5-R4K
z0%dZD+pcB5y>wua#_h9}op-jMp751MT_*%p)3ULvNDB|B15~k#lu!={59vSCBKtV*
ze*s~q+pJN5#$>ZZyjCHCg-<HTXzX)%v3~3kX~D}3%PH*jLK-uGUQ2N_HSEH0p3SLh
zJfpOFet2E1Q%M=tZf@S`$fxE^v@9``@%UbxQX$7S3s8#u4`u8r7xESF?!~1G`S7W#
zglk{vZ7Slxx0BTD{M5(=md&HSN0gyY(o61Abh5oWCg^B&_tA{-<i;*FisPD}E-kZ}
zewUW*SfNvp2dq#KC+nPCca|BflF&x@pZ7Ck(+%ud#%DIt))9h?E$>de)t~bH1f#IL
zT4C)F(kbrEL>EVV{HnMrR<5qj1@|k&G8Tj5AIr9E_F{QeALO>kVoX>iE26$%h>U&~
z>E+q;P~~Q=j#GLoh1i27vliF|DcGjs*g>;NF3B|@JEuSw%_SaA?Tppspt)^o5R<`#
zk0Pse=y2gl3vr!%q|VSf18;kCn?%tsoW_<Vf_7GmGPL3(YElY1>%z;{FeAsJ=Tu?o
zVoSfE-i?b?+g^V`We=Z0U*mrOl^sPEyjK?*RPBWSg6nku^l^?{5pM9$CeMY%QAoG$
zToDzT;H<kkR%U8Zm&9!E;5Vl8Ej#+15B;4K{o)w!YAUP2Y=%QBV7Dt+CKY8uh4NS%
ztFplE%VW2D3%bWxQ2oyJ26Bq<^;dlb^HWCOd3NCjVkSOnr%Y8Mm_Vl-FHdyA6=|d*
z@)zN?*5u{9=7asd@hmm-@{3m*0^tZO=4>~8ZqCE5d|>A151G(QTE}WnI;XOc#ypc<
zT40!|bUv1Ok!ZO6nBkt^+91@xA>;2a6*J%Pw6taOdhM-Cij?k=Q7Da+s0xY^oj=7|
za_X+r-U4JX@?CiA4EEdl6>fh0dNxt5(`bhYBK|;5wg$hGXc)Wn^Y4thMIt(c5lBMG
zgTm`$3=`mB(~r<q?{1Vs6(Lvke68AjjKLo`x;UebT4>*%a*q5X-uU3zJFC7jupKKH
zDTx$6MNo&?tu}ZJ>N-N0)ONHZ-FYAHGxw$P=0Xf|RZ`)^@w-llDr=&$sG>wXh6Eur
zqTsavlDK_d9k}w<HR?;*y0P%R;PB=+zrrwyU;RrtMsbN99`592;EWa#7I02(v87Ys
z48ocv6EfAIG9>Ip<&pB&Gz(fqWD0ESSwRoAFE^iUn>da5aUC0c*rBVUt(OZQC(BSx
z%8HcgLbPPl_Wn?0X-WugSi;M?B5ThG8`i01KaA4N55);=CWEBt`pbH1;899Qpce&}
zKGSlCB*94<fAC4ls{OW`f>w!guWlsagEXv1=Tt(8BmEw?BEu*6BvUgjot4f1_vg!T
zX=+lH0ln3ZRC9Y&3A|b4U^gaVYqC`%$ae&DcPB`o729fho)VEd`}7w#V*{H?FK4N~
zPz71t(+4fljIh6g2(r}9kE%?(L@d>-Q!Yfb@n2+i3Oc`LMQO?ytQaM`J6lbDvYYcV
zR?;vq96&$P{@gI|c2WhrrVzJRcR-}z=0eZD)hB4AX|mS6k$gJCe^i{sY^9dmYG{oq
z?xYrEe}qK!o*_j>RF-Mt?*mWrLUI!pl(h^?oao#3KS`v`ej@C&j%VN0gHU_>5?@8b
zzy!Du=Uv9cPW>8dt-zE#YT?@btO|cagnJ6srq2bq(pT@$#zv)SESo(PJeP=f{U<#L
zn{(f3At@O*$?kLdjB-JB4YnuY(=^~NOPsJCuJIpSp$d&nOp|#lq9a!x-{~FH`L`M3
za(Ze!Hc2sBiR6Z+CxC4UOJ0YqGxiNAUL_7X-Wf6<?ddQB8rG&KE>YgSa+G}wUk&@&
zoRPqLZOvotA}>ZHw(LgXMB2^RBsRU`ZyP(#JAAv)F|fpkMTTLwyt7Yx)cGroDsq0$
zlS^G)a@Bs{MTe_f+~ZBu;SQtG`7hs-xOeFQ0rAlrQZ39n+>;}I?Hzhl`Cy9dM1a>V
zM!t9WT<7>&*Xr*T8NFjW)!}kxkC>ND)$@mFiVS}WjD@r!Wau^1+t~Fxz-ggfhm@Fj
zq9dOrw*y7uuyqeqkiebghiMxcQS%2?PHka{ufLa@6a|mHd3|JJLs%A@h5YHL_OBpV
zAwc>tSeR9u=bLq#vihf4)TC?JO?QDuk#B@!Bo!L1)B@BLvBP*x;PfW-9CqO+l+i_6
z7KUc}(J7^t?lJZn*>6MrxbbdQU4hP{(jh`|)9VlV&(ExupK0=&%SqVx$>-W~+ZhAC
z4(9bSuN&AO&D(Mh?mPb-Zz8k20zQ&2VA@#%$e5i>4$R$k=nWupnJgHTv#{I&j1NYX
zU;O+71h25Ekp2O>-bz~(OkzAP!Mw|SAy7htMKew9$u*N&1pJ6}<lR@7w@`&}Nf{!c
z_ITj>Eb+pb>$fDZKe+=Ut3AUL0LdAM`LwpsMg6<ja{;YyowYw&NZ=H1tN+-iP?%1s
zOqWRTXj<qEbYfD|?u@UWzEvcuC?U@GIYWokCkWwpE$vSQ83I15#kk-6KEBNtx<#cG
ze4Icj{Ng^*)OUNH)xL?<pw@wrJ-da~NO)eomP&$JyxIUWc!@@%s|I7*aFAyy3=&5c
zv$YvAscsn#UUEqc^+C+clK;*QbOiv_X=K2p86zuVF(D;gO0DGc{YI7G_eAjMXO(gS
zx6;a}hy)wdyBbDts7Trpzd5wsbsBZJf&}}?w#Pn77A`4~!E38P{8j<M!%m)!lTA*7
zxdeJ3|H(s-I!8crmp;l+sX7vIRHW!y)ZT!h-o`@mSV-07&KQ-nvazczLa-g(1$$9N
z<99nzydU*lPQ_3+DARMV!oI^3Je;EF3pipjd`7rEUz<WrzN@l=-^)YaS)qb-<IGzJ
z1Fi^WCJ;V#39Bt*2sd>Qs_67?D4m|g8vn@VF-UB5U=!@Fn^#liWz@C~e3s1hrgrd;
zZI7k;m88(5ojZZ+!~9G=V=FFm2ZLB9N*c{S8S&y|0k8<+$1~&fss&CU5k#ugmVv5t
z3;1PWiwdN?c1y!tU=fK>h2>K>VwAc|&j&6b>Rae}hA-yw^A91^4CN-V<1w7GV$;}e
z(Uq{~-}HiBsSyGZFrU|~zvGaOUmx$9pSB**8x0!2E-QgWm;Wdjv9k-V8G5x(1h(1S
z$eg{UBGJb<&lKEtnbu$EQJk*CjRA6Uce5%-k}3MN{_%dpifBp{D{R?aLluggb_*KW
zCFPe&tWn2F7D%tTtVN?+fe}UT#YW99CT-;gna(pd16h0UAX&)s^Mfigh)S5Q34}T|
z9bx~CzGA5ePUW3n7(<KGAr#t-YA_|d$d~`#n`TTGEh}@)<<`62>v1`aZO>%~(#y7k
zVC%CD?7E(z%+{K+-qy)J|M|9Y{!QO=iF?KniR-35z5B1D^UuZy%y;#fo3lo9<r?)j
zBlXi(bSMH=D8C+5EvcjBYRbPo82R0s<R|~_o!SA`F29~tX0}pS+nEQ{y&L&)Oc8`J
zH~ULuxk=P8&Yjm0Cvqk0XMjH?PBJs^y*GH`V4F&NL6zDm$?Aj1%CsjLQnt9WgqB6J
zQF-UykcV>C=(5ac$JQ+CGC1UX$AoJp^H_0zwTp9I=AErF^;PrTz5>)nTzI%Cs&9SH
zH7neihrR}s7<>gp0Cu_=m>et3qI3;;{totV_Quy`olcNv$#+BTFv#4RDxnQef$?*J
zU0P|1Hp-Lezt;m4`$=*;T1yS)j|GqnWrDfLoOFsb7EoG_YQ+=)Mr-1{#?=PC5#w?j
z<{q6ILY{L9v?+OopL2DI{YS?wmJd~AO{LYTv2>~E<GCyRp)v7*`fY+rh#$yNxQ1Nj
zh=E<9<HrGndU8GX$DXu&4R8W!siqvX^LfyH9SZQ&P%lN!f!h-Lsnt<hHl#05m3rH(
zf9OYDir%}_R!>OI9y^Q_E%CUe=>f%ZvDHU_>yHT|VmJ6P{w1rde*=RkH<FH`veF3)
zc2KX+;a}qC0UnpyJZ|q8IlNU@QU-zK0YtdShie3NpQci3M2sQUATXw-0T6z&*3D8e
z#|inIjfNHcJ$(9seA%eZvzFcaNX0L9rWZ<vq|qLpl1-aEs!|mxsRm(psu4b^-eR&I
z<cu=voM0O0MAuF&IMZ{gb-ESae{*69X*`*knGLbB-~!@q8ak68jJ#7J+)vp!og<Z1
zfr>SIW^0u&v**-++>+{dyqD`_dVVg=r++fbVom%^X*;k_v_)1jJ~`%`^WymddYXNu
z5lu*KsGfX!&v7V6_2pL7_FfDb=0!u+gs}UpmZq!*Reh2f(!{8?1R5)ij1jyR8Kky>
zpwA}HJG?dEkYkTIJDFAc50e?#R=4^Q_WE1cEl;gyMe_U%$C(n93^e!w)ZM>B?!GSQ
zh}G8SkpW0If`sx<T8Z+iL|cLPHzOz;PfU2V&P9&SHy4#jQmo;}@pJN5?aYxPoJKXD
zE5p%{3w@eTAX#6pbmDGb*<_eIP~E8AKH9`$fXytip08roISCr*b!j>}pZfMpn^cFn
zJYp6j{ZsM(0npm0#hgd~biJ(kUhrU4jx;C)2qm^<`5d8y%Hn;2bMKQgd)5Y`g)Nvb
zf}1&cJ~H}HOvY=t1nO8B22j4$t;haPb!*B+jn29?$n)x~$?6msCEI`9Yks@R7!jUT
z`bV16Fzjgcd4x=Rqkk0Z4SGY+{RHetkYX+3Mx$FljNh_c-cxz}MwS<{6Q<&8{F3GU
zr~AiY3(B@(%4)M4toyfb`%}O_z+*P$NaAxKqMtc-$JUTTz#;@R!K`3ABfL4b%Dyjo
zUpriRdXlfMaWg=?l6hw;HgY==>re!{UEqECfO6)SdUmv1S2`1=cJS=vm7)<D(K$px
z{=-+mZH-BhK`Q0K^Uj29?F$nGgpwvt2jYutW&=XU0)9T2EE6la0i3<{%YQu>oKM;K
zR>fjx^>UA-8{LrWOmbGn@bp4y)wag<>iA<l44-8fn2Ro~eGZykzS8`v^_nO2@c7|(
zQEfgodu4HUx_?pbhR}H_dj_#|291>{*f6XWRITzeN97henD-KR4#%#2e1o5fEGPr}
zlGI^P#v})e^7mb(*Lu!S&>c};bYp|@hhZ()+?$Y3>Vo%^eW~WBzO&>mp?l*;Q=Yqe
zzdSgHL1}ziHV>)qo2h(OG-UVu6*?r`&FM}ANoqojwox!w!rXa$`OGz$0mKrBf3vG+
zpvK|mW~IKgmRoHkZoBUPj%gthp}^PRSSfdH!m$W05RvgqKqc^1RE-dDtTwuWg^<8}
zN|zvy%FSO_2Iu7zd(15|pkYho5hl1pH7+~fMu`(~&+~n&kQqy37{0(){Le5U*-tA1
zLdzh!fE1F%eb&@9%Lv;%W#@kY?Mhk1+RP*|#)g8O9<#5C%88A@BTLfdJG*)fjTXFV
zK{^%&_GAVq+6L?R|JEl_Pt>jP1nG}zBPhs!<w<Gr@nhd=_guyrPXp+Vh6XqNfoVV8
z3%bWVh-}0h_U$tr#^<@rryzQm@m=3Vt_t872DnF#oD)3R3*NTUfH}VHxw&T}i4*Na
z3qCcYVQPEfgptiZc*E#fv&37zq!T#V@Cl<;pW62FN~`!J^%0fWg>TRzvWG-VYIv{0
zbF<0!EFMGMgdDoZceIAW+VNCMAab1+_MNnw9)4uy7B04?LHdg_^Bvtk=9BDBso4|O
ze;mD6KA==+A?cD*#cYIMk;7=bBS#r$kI0;!>!9L0HWO`b!M_QJ*p{!>C~qj|YJS?}
zJ0akmd(^tH#pS#IjB``{)D0DI^upSJ*mNo-Mu0af$|!O;zTp=b#Lm%9O2?%g4NFqq
z=lFe`kPt<lY%r3Ax#%1a@OS=IOl*}ujQgl}O6P}ZNy={I2dIh8ycY#yv3tg0f<t}U
zPXMN_k1VS~-)w0KT8ad3W#fs7oM`Ww>UjR7e#n2b(93@bs?vK?FXza3A7PO`vL1c4
zRea%a5BvCkWn+r$wCah!L=Z9;IiK0HKW^;14vCwpR2|RGb=ul;2WJ~2t*q%zI(~2l
zvgsp`5|6>$9A)7G#nOz#^wTYuZoD4Tv+hmiWnktd0!AnySa1GSfoE$#o1-9zWz7<)
z_D608ya#ZF+@<>_q2_)ilKpw&fpV%L*7L&glbxgIOHK4xDCgQ_9_g_F@$gSN$D*13
zkC4J>{T(z%6J#|XQKue+Vu~1(ldNCZH<KPGo%gM}>}9&SWi?5%qj2GOf+K4gz_Tw5
zrO|RhAVjS7-BvPkNnkHwz0CC(D?!Sx5CFTi{k6I!5ATQQRhjs6+gA*rN4IVHUrp@-
zPOd2u=}WWJ7+g-#*^Z!=@`y<7fEG1Xm0c=ZET>Cct%;y{j0Xhw7Sc^9QY$qWRk)6W
zcSOp(`0Hsm4<7H#MXA@GFxA92Yd%mXEa8Xenl@z;@b}WZ0P%O^T`;Pmsn!C)irS;q
zB<>Z+mE)vo;vqh<+IfZ&1G_P^Ka+-HYf=^|YcV{_NtaCJH8a<ln3r8Ey(??JI71%Q
zB^Wvzp0#QGUMW1dnvlxNA!>_FUA>DqU?Q3s;$Q2C9qQgl&e!Q+X=9jW6cesd(5|bk
zsYFY-wFzJSozBV9_!+VI&@<Aw9g#0-`aDSa`9`NRV+f88&lgb(P~UiVH0Pxz{6pJe
zurWe&tms2?{lc>=h0a&avGV$3<V*x`oulazYCudyWoTfF1d+OzzP{CFGSq%@>-%w`
zi7xIChp(BC(=krHJcbO7X+{RMDEZza`fW=)t6ezE47S_KTFVgn-ent@&skt^&hRIL
zQf6W~4@q8HXTo=&w~tS3yhm%DS3MxplMF)r*boYyKg4q>Q(k$8+mi5h-~(W6PZZGw
zp$Q}9@<!<H1g$bSkek}@KKU?aRmd#I<Oa;L-fn5L&?h&0MTR-OKZscG`l=B3X@zTF
zxu#{w^Jy5Q^I3TDmi&$iYOU>bCr@2mhBV(N<=Xh5Cxhv>{y{OcENS?0Zw!e5Q_1Ho
z=8nO2?WEpu1q2w?ILUoQP`&>eGil*Pl0#!Z>u}9SBR_Vmtrc?pedkm2Cqi~1UIz^=
zbrJ?TH$o-t3DV8~=MO-|bd_J)w*plEJHBdizPIAZNbCasxVsq-c2|{XlNz9Byuy+r
zv4FQr4dGLVD0~?M5e3o4x50dC+Ck1%3$Fy;Wi8A(m`ejscn5yRsr7vQ@FUM}u{z>X
zcD`6Rl`(R<h?JP_#0H<E)`*SMfk16k{kKHQ{~g8MYkP^|Pvzj41qU}=M|9vF^T(w(
zquZzLJ<*esM5xX-<BNmrKR`Ov<HhFg`mebDw&_ZAO?g&hiWG*2NH?e+A#3(WJ+lLA
zqoRHJ+ntgfifd1poWEI)DK712?f1sN4p-e2#ou9p94+`s9ki#AM*8vmkVIrLpJXM}
zT+<{hd~N>zeM6d?j>aG5SFauNE+#?u?34Hju_6PE!Y*(oo_I3b6?FO?D$0UeryieN
zryRrz-`{029i-b5h6G%cn@k51R|P};9So~fy$;epRM{<`tKhBKgNN5IQ5AY~K7U#a
zt<Z0&MDJzjQ!iAMC(EoP^)S%?w3|J+I_?n0-7F+Xs<#`EvNU4Nz<y>I%Wj{TkJ?iW
z$)>D8o(hir2LQ4ENofdRR^l#J>_nkF_y>?$`tZqZ(OAnt{UAw2ih=DCNNT6K{d&bp
z8SWR^k6i;~nlM-a&S`xSf6}j!`YA~1FVn`fFF;_#ol$~AS)5gWhIciaIBwk<+Y;+G
zF^WMkVcKj9!{Fyae$oM&*pZ|h)3O(QwDO@J5iymlvzyYE#)*)eH$cg!*JQFp;pw`9
z>1536G4G&y7fXH*zcjb%k+=??<AkMU<ECb8Yg8Ct?2BsQ-^@({TPL=yO)i+Zc@z6z
z?4l+#kc56StM4Y(-p^^AF{in{6ElEB>pHu2r8KYghmM7PVDUiZci2snxuhLU)T!tQ
zdVvtsK{C|FgmoPNJCOUw&W$0<#5rzY>tWXkBqX&yChz{`PW!#a94>5}J#CTCjyQO=
zqKepswWx|q80uzZC!q^D`l_?)qORSm=wsN&r?E#zfM)%!^^q<Q4l#v_g_g)aNM2rD
z_`z;W$R&-<kDodzBa&`NKxRkxL!KZr#k$hI0T9Kas<b#@R5;^mibA=~KxeYF#sxjx
z<}XW<he*#>wx}i_-D4cq=IvpHBLY$gwk)wtSDpjDm?Uff!DEI2Ox~Fn{W$VMkp_hM
z(3i`8o{&kmJIy}`Y&#J|%GUYJ8T&zqW?Qu6dg<<KunQesby-2wr23nBNtS#_i1e*F
zm5(S6T*g2tPVy(^UU$gum$Wt#8xy?D_wQYn2e57{ki77B1W7NDGBBeDCckNNUsIb&
zV!-a{=*9f1w1^;00hGxf`g%me(}ML=`6#JO@|T{6Fk+z@2gBi60_1=Y@t$9MygE(y
zsC8UcU~4qf@OXpbOJMwJ{LNJwsX>4y;kY_otW%;y7b$8xJM4=ytTzP!->-)lhdwGD
zY<}CW4=n?iPw_IQTK!il;(uJH=Mv(IGEaS9?nh$tawS&4Fq^k*)J4Trnk8`LNub7;
z#Cas-B+J>xRJorJo5;7aKA?H&O=wnU?Wz1*a9VdGbo5GWm@RT2dysr|Lxf$>%9S#V
zgEH{T=-k>4mEF%pPgXM|DADf%JA&0x+}gp?kgap$Tymgsd1ah037yK+C`L%F^QLr;
z<WEpMiodClQ|<SDvHj_WKBSMqjz_UKLVoZ60a|#)&JC>XehdEE`3a(`gQ$o-fcn1M
zAvrV<E~r@0*WT<LHoK!o`yijep0Zc6#-5`cA_`|0c^wRVFmk<v6$FQQt21IE1jsye
zbv`e5%ae4wF5)&Z=U15RRjSn~fynvsf*0?*sC}0j?a#0$CoPBrG6H2JJw9JrCOGYu
z^wY&{O4fcdCJ8@UL+b$C!kWkVCq{g8P(F8^lQkKrW*sTx7hYrE3*IRlDe)C5MvJju
zfT2{%Kju8=phR!e`XWY)1|#t4f5MMf?7wrEcOBZY7&+or_tNozg?@A?mrmQiSYGnj
zVT_j%fg1~gK-~-eEGcyTo~|s{Sa@Sr#%Lil+s?6d2HVoBoeo>OH66sp)BdVrIyZA{
zk|)Ud%C>BgoU_b*1w=3X0#u<V$+(e~W}Sw0XFG<uv`;Tgv7rYz+0l8J2<D=<Pq(rA
zr4E*zMX{LWV8#RPm_3B1+IV@p(-MagDm<+_!IC|w1fA^F$xWL*HTO)U9qYt;qkPjs
z<YkYj<_?)%`Yt%0cJC3xTp{7ntlH88{gu3{5bjh4*s4R6^$;(fMlJm`T^XipB6tx{
zV81iP3?XO7OJ&pvFEC3^5UXU)Fj}kLGq;8>z;A45xYq!{73C;#PmJJv@27rv&*iPf
z#Sd<xGS)r}npYY0qGkn<A?3y_kIF0C3U}W-Vl5lc@(d+)9AYWVR1Ce<s44QU3*@zQ
zCPjzun%<aM?91uhd|k<AEwSe&@gnt|_Gs*&g#z@8X)^qKosj`@XS21Ui8c(O3ErY2
zYD&sa^n)52jT@bW)zz1@YzG6@%KHdK=!&Gi`fi_Ae8Hpie9O1$7Lf9&-3eZ30i1Oh
z)G8B3?X-oLE|*Gzh6y6O(cR53Y)~>u%6PWPY{2*l>`PD_bNO`cbtyh5WNCbv!ZCs9
znJ8w#2J*L}(lwoPO&7~|b$km4HX}D<yp1iysE}Ns`EOpw|480ry4q*Z4H6HIs6Vod
zjBL*fe(;WT{m>KNJjzb-?jK;A%9ewIw_%vWKF6mGaPD>Z()ak9zklC{{SVO8&dzq_
z6QO%VG)oyE`9MqJnE8y=0lUKJU;2Dj=`R<BaF+t3ijr5Rjw`{%4jy*Q%MnxII%9Dx
zsx9TxnMZT?$xb}#tVX?H%1(E|kdZ`f7ZO%Wtbf;y6;ajQdAAn5@V@5vCvAYq9zUR|
z|B%qpsN^_fvRG*3(s>dx11ZbP(_oBkPA=RHh@Pu(Udv8ekL50l6Pqi9dcaY~MN8Mw
z;5T-=3o%gk-!9qfm<jhL?)(ENk6vhym`q=Q*?eb12s79mjZ5ep?BKfgX8)S5IrL;k
zYLA^BrL4s=)*;E}$9D23TA=P~I=lJ15H7Z}zKwRGdTyO<i@a*2E6U1~O7C$V8CE3J
zLN}4M@y<r_ENN+NK)go}A>^9ZDo*C`+F+sd*3#EG&DlbVB44yyn)9rv@F5JJQxj-A
zi|SszkyoIgo$+@D9Og#JbA&MFwazif;dPrTrdsmJgZmu_th>>}O*mAQz3U$v-R)=n
zQggAKezve*QrJYCET14(m8=MZ@!TD=wp%s5ob6%-o0QkE;HI4K<%FnJakWzxmel3f
zH78)gmMK?)?}oK_u9NzPdDBHUbunVPKj(Ajmk+yjR`C!HX01>Ne^F0(Ndx0N6)oB}
zF1Fk}u8MtJ(|@5Sjpyd0q8l`Em{`4<0~M++`HM!YhnzAQJ>o>uW(4xRGSil1?iz3l
z<-Tw5<W}<(BCu%40KwnMp~zHbtdYRAZMf@b8|nu>=m3z%B<;*FWR`|`ioJH<BdiJ(
z?Mrmer(Q0_Jur1&ib$4K7Cv0HVQK1;gcnrKj}wS$n(_oWx_p9ZG->m-VSV^LgP2`r
z&hH8C(};R--&ajB_&~aCwpqR2{>#A!<aUi1Yt>C8>jT$eCsCan0d>s%dpIbccBi~o
ze_Y8yD}(V`=Js1MEdf?BKnwZ$6fli&)cEs#@22@h)Eg+*c8Ke*Ud{@JpB^(;iV-_3
zuWGJs{hJNs+xN&xv{~aD-uOa#$zt3`6FsUVxz%&~XIJaqG<7{}f5VOkeJ?AL@s?Wl
zmU034j?i~zB6(=9YgRhFEcLB++k8v4o#>JWJ8KQoheQa$t076%`MkNw-mWoF>1c9S
zcWtXxqtul?7Bn~caVDR1I_8VLD>^4$jPq~1KjEyA8KXM-hEwb7^OT8zKiyt9lIAp(
zb+rlDgfU>L`vU7?jQFk{rloG=A6PLEN(L>cqiEr#+rDqKza}Z1k~=R)<A$sKkIni2
z@V1s#0-I5ao^`PEwz$3dh9+R%fy9o*s<_fMuxw=GU4LB6SrySbE4hVMZZqv)c7P(=
zZ5*3;Iqg|TKp)k*)8oTGK>Ynbz^MCc9V+b`WZ4CYdmyv*t-G%yxxBd0a`403=R?tQ
znn24&_+WbZA&-hXuZ#$-`MA#Ye!B;{I@gToT<dX=R;IyO(Uw%iD~Bux73d>4J}sZ_
z0)^*#jzK!-TDXj<luQ0?ATABl<R^*TF!4{4t{8zQ#Ml?~<+G5C$DUv)zx^VC6dmW{
zBpT3iEWs}qXXC8IU_Pk;i=+~k?hykX?@*UqZm_J1o2><}&;f})53BGqDNKA_3cn!o
z-GlO$5Fa$jKS)F>T?|iox2<UNYxMuwcYZ}&^1?q5dm=;i2yhm%r4ahFXa_<k4Sv?}
zd2ZRCri=mdL)AD1=!m?1UwO}eDror&E%SB?<q8V+L3X%D$g(-xvJ~VoYdbcA^qr%o
zXkx{qp9Jnm5f?oZq<6o!!MvD$!L!OlXByC0<{fOpAKqz`Jg2Ift0tDse9e=Jz9(>h
zE7FXSwQ53aTI-jz1b^|H3DK2JoJ>;q6ZHCdoR=x_Ugs`b2Fw6@fN<fOqW7{a9!WEV
zLyiM9WW|<J1_+;aTW-E&*c+>h-0>xH3#a23EO{kPEcr&Du(24ks$71s>*x(big*p;
zbtyHCu~=H&QnUy`qb;<&f}8E#!2d<Rfh=#h0S^$0aj0A3{Yn0L$SPUmPb77%Wl2ej
zBElBg$h3KbvL<(42^@u@!4;NogHjH&23v0A^f{2V`aVuubhyP`%nbWzy@pib!~t2S
z+lCxFoJI_T)@JG$vvsXA)rqqa0~t7)Pmr}~C%PhvcjvnV_BQv@{4H(K27m75cCW4x
zKY{~@Zq*H7F3GiFQdN>;pJ6<5#Sv4)u6thr>2ggHpV(O}SceSTpVrR$%Zsyo)2Mgk
z5{j;BnVFcG*h2ZKR$h`+xolZ%>DwzC(HyXRL`f1l|CL_bN*jlqV~a9J`xbu#J07d5
z&gZuXyN9dAeX%TLI}*NRaGgr;+BX|SJXidryyPz{p-S~;`GDa2xgwx??g!N#F=4L$
z@kC@yusmArX{a;lG8n;t6>tb&B$stbKC2^jTR9T~<n`)M?8B`}S6K}H-O2L7(Lf=f
z=naK_Pp<^EZ}3-5?37NJ6mG&Z{yoi9acb$@<TGQOXkk$pY59%Dvqx(!H^B*ChGFAv
zl;EL|$sRVjDiR-ve859o+T)`G<#M|OZPsOO!fI8vgxZ!rQS$V78KI;6(z>UbThrF!
zme@xJ)mQeP^17q+qFJ}8S7fG!G-1qi)7M9?i>1-o;4Sld17d6(cJVk3^Msr-pS9`V
zHKgsY0G*ClFO#R=43B1ui#cB_^F!fS%Mg8chPOZ23B7RCm!5pIzgb89SZRqFf{e^n
zobX2zL+Ssj_x+C#i1~dV6hnxfeuST}?c-6*^5;jW>9F@_D6Ag1{Wus~9Z}esF*uwf
z^mTF*mmHNE*OU5IPcO3JS=5i?{ohLtl!d3S*?~kXxBmbX$50QJnHdc_iX5ePKY(@z
zi=~u1!<IoS)^&_c8DL^I$83FKij}sv8IWqKtJOZkF|CymO3Zppr2cnuNUxv;ZL5a7
z&Q$+!@JsmWqj9oX2jwvHU2j(T*3rcEp2$DI`rA(Xm%KQ5A|U=JoNY(PfGeLDZ|wz?
zbyIe){SW-4EOpwSQP%;Jrhx~hcI#=@0EKfPJNn5wj{}@mdL!4i8<Nf$j7KNr{0lP}
zi<F}P4LwIYajQP)$zxaCD^t^u_xP5b<i)U2zp-H*1>;Ve`K2t$$0qS;^rHKbUSb`A
zSE^S;nfy!566qJ0bq&?va+4kc>;3hEv#jWv9|Q9WGcfQ`pK^Nf(4X80$ld%p(^K1z
z>oq^Wg0w7MX%Uw=nXCC)D$C2tT4%7>2TF0)AS#GSZ`b?0{D$1nrk-)|oB!kYva_yq
z@Z%AkE%o-<$|C@rnlsd+6XZ7eRY5d+XB*_?EG#689AA5ipw82`n2_hgTnoJuuiR{}
zO-^I87YYzVPI}1~9v#4!BYKlI{-hbTEI>IgvMh<N8in5m_?GVt76Z8zsOG{2#@<FZ
z0+C<XruAD?h~%SJw1Dh$HH37>MAS(2V^lOw*sk{Umrh;z^fecklnOqJ?T!o~ze&aG
z*7QYX+f~`LcrO!#hvXZm=Dc#IECULu8ntGENGKnbyaZK3OH;m0u-yCuAT}!E9&b~%
ztEe4pKkN^pT8?a;hvYqV#0}w4cRYbTs`<tF{g%=EFevxRA@fz1Hkrdej<e(+YDw#N
zitcs4YCWo$cPWq3g*~V8vQu|V^RE@!D;;2RcmyMX=|Z|8gEl22Gp}mFOT)B48bgh%
z@p$h(OmmmLzcZPId|q#@Klr_D!GC~yC1Bjg;X+6KS;SR8zcJ1)-}zFaMrkWGDxBF+
z_6Dh(HNF80dsLAMO|{G!h{tAzH;(>Rp_lG|oHRW6dU&R)UCGBbikKwWMkhG5*?z0$
zVeP~3$1JU=M?$=GcscGcKSqU0_O8${=REf`hpAK??S%!2_PJ$;g>8b_HL&91^UaXo
z#P4EQ51rVM1ybSLNKF(A6P3JR$CG^9a2qn#Fdr#0==g~F+-Ib5(0SvN(j#fX^SK43
z61^!^y%Re{jsF{a%gS3^IKL4Z!_uGOIa_`jm^TCo@}Oq5Jx=Zv_j+(}wXNj*Ma-08
zB*wGtGgY}5H_b@&^l3Afh_Y7ro^PM}k*!g0d8xhauhECW#oWIVqE`Yc1Y4!W-xuP)
z|Jh%Feftcxp)>Y99mm@L%Q$Ys>gW0+Yn*~Lcm_nzs-4Q=Xml((P-C~4Twr30H)71U
zS4!V-VLH5R6w>Hm7;%ef+<=e8g`IA3Irt57|5L@|3FH~aPj?OL6b>029xVzcJUbZn
zOq{8W?#UD`I3Eu5|4s84ASJCHH#IYqlVR4r7W5Q#FZ69*ccSu?zIKSZxZK6wCb5Cj
zgKp!eY1z#yvD>ClRs;Z1O=fkYw9eeIrbF}Ne?+nWE291XUdIq8TR^E`O!yUE&;;r~
zHg}gH1JPiCei!FYkBKCYIHS;yWjM*N|Ekm=-)q~%cn_sT*iVdubv#^7WCM7moM5Xl
zwLPVAY|NNII`%K8G-tm1zSkICGoBkC;&!b_Pnr%yXC>W9n)Ik}U#lw39kOgc{dE$4
z-_^}H?kZU0k72|<-^jw0i}YN7p_5r3y%*e+QyM(Xg~e0S;N#Wjc>!t#t`$wHM-SAL
z2IAQ0({`=Q|I(MlRIxK4HCSnz7`8va`i;6ZzWn-4I>M6O#|=*vZrFv(@SR2T_1shJ
zPa^d7ECVHt{H7GX{jHVevz-s!J<7VBJA9%Nw2G)XVx?A-mzWoRxUy>k_U_6{BVIL(
zjaoqoYh{S`+YNt`lKnYX4YPM>?O>1Ae{`f8$bASZJ=JD}XDDYnQ8Ec%YlOtDhlieX
zuHL9r2?867SGw{f&547G+lH#zs%o;o%ZUP@)nX1OH>Bkb$3r_BZ}qp9hGF73;tg`=
zwHiY7@<kcwHpiT2PLm^7?~J3*;@d-g<}9at-~)Ff7wa@TaOua+8!p7SDhlguD&#`p
zn-|$oI!}4d3WVt##;)7ga-(J|qBao&fWPSbd((QJ*-$ylyLxyU<D@j23(7*sP}gTw
zDJJGca#e8D6-4jeR`53*T)&{)(i~M(-yI7<f>Vh3C6kqPOUr16iC=RKH!L=S=;TVa
zF6-cqe_U-vnJwcj^l<{eTr!xAmCu&T$PUM)tV+PcI<PI=ex*HB$Dw_)FG9#j*90|2
zK*(o-kdFlM(Q^HPQ{AJS=1yn*86*$f%Wlc<(CjB?90l2<B67XBF19B>8vf)SR#c={
zT6S`xEV)5|4A&-cbA1V#U9EGC`WpjZRz;`c4Ml);i7KAK0%o>GU8IsGhOF5=%v>{d
zJ~t<N<kRLIR4%5*i@;<_1TP3{{NA?*WIgR{_2oZw4!MT0caM_Ny6D;nbvW%Vdhsnu
z3QX&eh1~JNn#>}by?u;i7Pe_Gh<XMJ!O1NR&B$C~G2a4pO)LphT;N!(w!M>`8x!hE
z^GOGCzv!C~ivc{|V6O9Rhn7Zs3lJ4~GD6s2gBrc5^0!C&|KjW{quP4cZ4ae*kwSsu
zP^`GS6)0YyNRS}KEx1#p6p9lh#ogUKSaEj=?hxGF`oB5n(;fTVz3&}&jC{z-8p)@u
z_g!l~bN;4d9=&Y%baF-wgkAp-H}A0BkeEUC8);%<p|CFM5U5SUEVT4tOeW<k+kLXU
zx=Y;{sxbYI6O#&+{2_E<r7C+X6E-;ok52o`X!4-u<ee!I*|#M$=g)XF`^CixoXYpz
z`9=XTkdQqe;<}8jq~L34BGQa>b&|~8Hml+{`|nl;LoJKGJ|XcOP}l}qSw+szZPp`}
zJPJEl>#e3|?JU1@NMGbG{j>Agfm2;vdlhH6>2Fhlw7U--QRt_!P!h3_=cJ-u@zk7d
za_^&cb-K2<H9xa>U2pZ+dZ^$@qcX<iiOq(q=y%x<tfVbcxyP@aF}B^yfs=foPdliA
z<0YYWpv-l=MXm1>=VcfOQvYqq+_b>O*M9TmFQ-#^yUCB7%~gbdiA}({x8e!flm+I|
z2?OAt!|0P)fRn`J|GYT;yR(>Vy35#UGpB?l6qe{(#y8vzFk#+rgX`DQVgRvY3(yh<
zn|HOicEZQHT}th@QH^i?aLwFnLe-W(8Tm?gt(mwStOs8WED5UNFIpLm16AE&Zh37-
zt_C+S8Scz|4bG7&Dy-!7druaIc|lF>9-}8=Dp7AF=<*0-j5i&`fJlH+yTG*PmCV=|
z#ZeZHe5{p&$YK5y!s(sYh(6B*ETDC^{i2o7=`OQMzgDud&1CF%j`ZtYZ|m6X`=u9(
z$un-ZR@+RmPeRP1_(kCbr}S}^>QF=PgYmwEch_38i<$j$u$TbguJQ2v?3>A<xRwPW
zgWTFm;E?N}8x=7)FoUByZm{xqA$JBlk@{-aUsa`!R1ZhOcGUT7TFKBU_y^DE{qtz6
z)RoIIOOs}qC&rZ1PIvaL9~S%B;F{0m<TCn$9}^dQ-F3J;wO{D6SyKN_doFj6pFCc?
zkk}T!o1KU~MGb&!S#NXCaEbQHuEO2*8k~#NIGhvKI9mo1Ir{5sVaSi(Ov{BOwtJSD
zOcx@AJI$UmMchmXdsrsGQhI>6Ro@vft3;~87La*_Ipdd<R#cQcbW4@hlvi2q%^t0k
zM6hS$gd|y_;3F0J4^j#MBS)YhR1W!qdbFy%>>nhSPG&A4(b`*+IeN;-2KI+6NROR^
z=zi|{cAyl6qw|7oEJ)Q#;l=1g?ep;oNEe+a$q58h6hKL>N$u(1o#6Y5i^6@Qtf?uI
zb4$kO;7wcMPZy?0CpE0P7ocA=)q>>$94)toa!emJaSxQreTDIT?y_uf*d(g5r*Jem
zLylX^S}^kKh4yB$x}ta2piK=i7kQd1u#=F+h)XD!n>H?TC4b{)3KK2NL8=bq;HXBG
zw|vQ*$4z58sNs$c6>RemBa)fcsE(}Pd7_V^7g|^M$8sp)6hBHBUqN=^yV9+YM?x_!
zi$5mf-KxJ>LC#noLA1)Vl$KE_|G<*SYS}e&$;hlF^P_rdy=>Be_?b^<pqsCKd;1bc
z@wTs+#FHo7Wp~s7wWWO9C1LQe6!w`ik36IIXwtvbE1nU<%vZLnLg2&meVJ3CWrz}l
zKV_c!gbeSj)FJn+xLA}Z@!3czp2ToCc907Akz)?;-s&gxYmxoBzm&M5g7X`th_D~e
z5h3#XDzSd+i^Ebf$1u__s8Mb;p+8zb{(&8-U;vH(gKqO5PI2I4&;&@W5Y5s&+_;Iy
zPxtuTI<Wr{CCVbwig$%uR(OWD!9wV`{JvcB>5Hz&m*{C?*FH<{&iuiXLH**+jY%g+
zA+^E)pO!Z??owyq%elz#ibl0j0W1f|C_9LDRsxm)aT6)KZ9=S-b-`UTZu?9hnZne|
z=d#P*yRifSD#T}JYwYJ`5_Hske^#s-Di2%C)92eVy3*5vsVodL4{WoxP)6B@cjsBC
z*`hCm9zL>iL}i~FTDY_oyV@5oa?4-De8@H10n~qm&PfG*>7Exwop#$ZITVr6WRH&e
zuYJpr1|;*TnhYt-G$NChoPuv<-KCt?0}fpPoYc*3Q_d~w7qgUDaLqtF4VU@bh87)Q
zPQhj`M{griI?%{lCnBbCk)<QCj&odh1&h6)qPqsT!<Pe5m1upY>o^LHI|YXWo9Hgg
z!CKpVoRlP4EhnRzqHbeX3R)!mzv`DZf_CcbT~Y6UMOCa84LLWgCtpou`^LB~()g?>
zdi;1R;j1w%#m02;9)3e7Tk?@DHrR|sNb+lH^A(XAj@KWgT5e4Gl=6aKMtb94(GkFi
zEeQWY`DP=|Yh?RIjh>H}?Q@WrUavajd;O;jSYDR$KG%Nrqjqm6_MPiVS%fBeR$ZWw
z)S1$WZ%ENKaL;15tiattc(JaHbj6zD{zd6*%&E{RmD9Uq{K9K{_D1a0>gfG0L$s^P
z9on##TSb1MoysiOz&in80RELkIo^|cbjSs*K<p@G5tw#+t=mmr$n$rGrJc5$^qp{}
zwa>a`FDbtUAC9O?#QU>KUP$s9W_3ac0h-OVUN{K$mHIy5f)}rhMp-P{`JTb!TXyY@
zt7f0j2%Ejrp@2fu;`<|mD;)J-*q(+|KW5pq^Tal1ou!}akDG03KKz5^9=0!ap2le)
z4z3DnMPut6mqT$(H2wXfdf}&tDOa<*iQ{PvFoxyaY=v+VyTA}tMZZ=+5G|`nqp6h3
zH5AZ6%4A;92#tQEk~_2??6QnRO#{Xa+K|4px9XlmLV*+!$7`DK<2w9m`q*SBsWoGu
z+8MV~)1DtsW^M9XZ-PT2YqtDIcQ_AyHFX<ml(zs>^SOluZX|Y6^R|<l+|YUthUg}X
zaC-kG>}2Y5R_a8}36HJ68da2h`N>rKh;TzlFDL&859EJ56$HOwKV4UkUkK`XVwPSR
z;1nmGudiR*jTAq5-KDW|W_@p1BUw6JKzh1eX~;QRX()RB%SnKv60XB(m8lqx+Mvb5
zH0YBz=jst&ZLkh;5jREP-o~XJysy4U|G=9wZK9-O-p@bKBbV|C0H}Plu3kT`+j-p#
zQ54s*o^AdqBF8>kO3Io+>+H<9q5<D_|G2sa;LaUbVL4O<vlMppA8Ly73GM(AGNIa7
zu`I(ZWD$G2!KpZFZph!;MA3@!>Q+Sc{_utb4RS!5*Yt!uP{aZGndg18o-w($74_%T
z9)-qsb{A9};!5*XWp}oSBof`VqiWf>BA@er(Y=Gxz)41+7<J4KjTH|pN`-bVA*?@X
zV=s+gJe1yO0oupR83mSIPSkRbSQ8=(isL&j1`(Fgz?8fJh7j%45X^vuWBGjqb?|m^
z9^O>Gy*#zWmykO-%==f~dPhgo%F%Xe&EZA*0*4-7s)iiDq4?sl6eOUzJTNryE$g&q
zUPWQrF1W>k=;!9P8pN<xUPDwD2(MXM?1sI}*6Qm&C*hX;!55T69@JC+x|*@CiD_H3
z54&mE1=UBjz!pMdK0qK+@6@~(vlB{qdHdm2!jUSFB!(OBrfh||C{hYT4JuEOggi>S
zbUQy{(4UANcyf59PmeC9^8)I$(1M5ECm!@x_AH0fHZQieSB!P|uIp>RX=yUiHUWI?
zW!Hk%OT(l5tC@6fHx#M4T3ro9V$_l|St7#HXmDL+D#n1SU)7NEF?__j4{puKnrTq*
zaIBHg<8o)PIZ>uFwJCefuKz{?IOT-kEAFbB{><{9>UJ_e`nn*`MCdKtweZ6;*~UFm
zvZ}9j8=zFVdS)TK^i`nut1H{aZMU>1<VHiL*)|+FObsH)J0uxpl_eFw#XnbiZ{YR}
zvRbFyJ2>Ch8=N@E`DAV>GHFzXGFx_U0_b=Y;F)NH!Heciuj+ttZWDvuUKy`0-Oo-A
zvfXb8#Q%uCeXNqw<8+b#CRe}cT_lDP<~%7Rxr29_4+LwirtviO`v3Ivd}hja=d8so
z@v#H3P}8XiMDqCo{XtvNJX%U*{YeU!WUy%Z{Z}vCzf4ZLt8LlD6C1?XqqoCf^*&~3
zKbV!eV@Us7&e*?9LI39=9@B}jE2zXs-hC=DXqNi0M&Eb@+2TmNxRBQbO*{G;kHEg7
zQPSs;laOtPi@(Ld0qS|OynUViyIz45bhM_bi^L9c(_^~`&O^D976y}uoDHYuWP5(d
zp)}LGHxIb8clSLRBMe0d6&w@1P#j|5id};8o!+^Q1i656d)C*i6H-=`<PGUWL5^G<
z(=g%ZdPAHoK%CbEWJFz{cg=#pJi2?as+sAt@B```UE5LfN`i$5SmC0yk-I!hmRzo@
zd`j2(5e_`Fn0S+8-lE;hN4Z_C6-pw>Ey&=u+tVP_C>jRP781#Bs6ayMN;<Ap&Z4W_
z`)_)+#u_jMV{0oP76K-*zWNH&*KGM7W_z_0M^N4R(TigTXP7){auPbF#!TQC&zAr-
zIJOV!Q&{XCY1aAy*OYzFNIbIX7Ick0Cv}`5YG+j(xA*&#^^5j4Cj&XfT?l`E^EtLr
z(i=NtMe+1goDGuf_bL>q-S0<)(^j%ll?n;5Pkic+wGJu)Tz3%^TAWs|g%A(Chg%{_
zas_vZD}ff{def48(c(Jdo^fI$!%v?mSbO9{IgG{T3vEX2+Ro}zb^1@(Oi>Os({@EN
zNx5c*#B$2XE|`q#_ug(Mn_mjvr?4kqiQu*9y#C#oS+I^R1C;nvTeJiW9QG>dnmZl!
z4gKpMncv|&JV7=bw#N9tn)kzsmHNSe@>03;2Wo-r4GNc?8E<&?POE(8KvnVYPhA5V
z<uUj6m)QJ}G^C^E6MxX8$?VUmMn$w9xvV*mUe7zj20px4E`ldr!W+Pdjyf&v1p7W8
z5Yr~t{#bSZmES3NmYy_Oy8WE^a8)|Le5sZYSR+WU;z(1s6~nLKh~!Woj&NP0rs>CJ
z7>w4zpSvt(=RB<F@V-B0D$9_Ryh6M6XM_D=*c<w^>v}mg1ncr1PO@9qXuQCb+{l}E
z!JG0vpiJq_2hQGVrvrQpgSvqfI0g<h%U@@bUy=?`&%d3I<E}3c3;r02)|0$X{0HfQ
zvz`6wV5G_faRt%-KU)d@<sw3@c{LR>M}pl{<2Rs8bcLx$^Tyfc)e>i+=`_Z9!~mgV
zmlKt_uAfdIWDeoR8Rf^$a#(+NE62l6zkpn7^hLLGi`LpnG>L_!aQyFBQH$WA1_bv&
zcR)q#SfgNDo)2ZHL~J0sG^DNipoziB$*EbBECFQdR>6?y-h|@355=>2mmgUljYYX3
zle{$#4*ODD(|~gfM}~l7Ue)Qx&jM6_x11hz1oKk`_m=BX(7kS61pKuS1?u)#-jJ2A
z>1S9qu0)SIcG4emvwWAk+j*T4Fn?S}$qJvF7GA|v)DhHu`5|k?JnxUE81sq3ZiwoP
z_2V00hvSR*d+X<E`^S&!Gaf4Ao9mLF_w`dKzAwp%h%8EiwcZQMt<Q0dN}xp!rD_QB
zG-vHs`67}o69UMVT5~O~@t$V86Ju`C;$BKkZ!N@d@sVInVbd?K#=DCt`7)ora=Ln;
z43u_6zR4o17@}}+drPUXI4}XZ<CB<>#Rrutc$0It@cAF*yXI&6<OY(GI~RbV!PjEs
z1P%<J7BMNyL~FgTZj5Z}aP6*>f^({jr?Pd4eg~W3b%U^b4B$e<gJV@M(y-dQ3HPDH
zq*QJ;i=xR(Wtm8g@y?CQ$rCx_WCH%J6DKD)&OFDX$9AGvcK_u(Hogw_?}RCjsPT3D
z$KbTo6C?k!xdGa7#l$9v$+(g*%-P^(?Q`%?0VDmThd2Hw_G=WJllpf?za`3spDa&r
z@cuzUXmA(6y(Le{BlTM+V5*g?7d7pRPS!vfjyBun%u1BGV<938P$#2)YBVt>*=wNe
zdyVWJw!EZuR7KEob!O!7>`I#^SqD;%US_OLl>vnJkqUr(P6d{h{p^xr0}K==5v^S9
zNDfqoi~8%ug4SYW0xvqcSFpBsv7H?KtLw>!nh2Wt#zLuk*io7PuqT4}pQzRB6+G81
zr^JTa79qE<XDh=&suGdwimjij!yl9)pqHHCb`kfEhd7o)jhZ3wfs(FHeB2e<ypr2a
z55V8^+48hGU%|#ZvltlO%e=T&Qg5m&Fy4}#C~Y|sff4jk-aAK|C#1ODemuRF$x&!1
zSW`MQ@m2bE@1^JG{#2gikk(5jzS;fAh5VTB>dewxm5(SCn$?gb?FC)_rEtRFb>(n!
z|8xJ6v_O)4i;m)tdYq3xKAOPWJi+S~coLfT>89oSDF1rfVe;QW<Nlq{^S^)28aCb1
zgqN98iQ@*YW&%}Z)>MU`g?!Sdcc2OCtSaQ>JrTe+^i@r1@<A;!rV@w=bEj6{saY4L
zl#r<1?wp?%!TbUy0rzjMW9}r-2(j;}kuS&~3hQiz%db9RhnpRb>|;Q&6I;#rde=$^
zOCrHb3KTQZ`Q~aQ9*(j+GC)NdBtn2<!A#3ps*$by(t|ri5*q!NUvI6?a>xs%#!-Um
zQ2Kb%-V=0~&_dlCNj@d4{Ehs<lAEn5OPHT72g4Z&Y)%~}6rv2wvYi)?_QCVGt*yA?
z(M<j5BjD7rHxq~wieEJ+u}2P|rs$bcyor+=ori9)w|qhJ0Eh@qa78nc2svSm>$Qhl
z`JRn#BU%%cG82`cq5=f4XSL_NJGJQz4Y44NXK+V_L(yLKW0j(E$W$MOor>`H3_l&c
z5%7Kkj?DQzDXNflcwpBrb_Hjz)%<ccvHl$A`f5Szfy&Y@a`H_x`PeTiHtG`;W8!H&
zA&+c!o;Wy+rHprKQMl--l-zgGM`0t`w8B(0%5U7?5OD3Qkuz>>zk=jk=bpaq+&1+l
zDyRQ24&M1@Ivtzd6FPqKrM`9_1!$nA?C4Z+oF!lFT;!20gs=BPA_)<B_B=oDEu~xS
z+I|R(w0#YYHfTAHcW#NKPE>Yc9h+J1Y7%BewC3gSEt}Ssa&z|4f^kul*WE+ydiq9&
zo{Wzs<bEWqJ2m3cpFNnt+t%ynI5L&2EUJ-vj+;g=Cx)_s8jZON_LLuY%sop4UNqt>
zYFuLoEl8F*JRu55{t=93gna7(hIs?4KsZ_HLdkpgxK5#Hl&3jA4xz<&Y|&gO?<ZkD
zJ5jfs-UyF6S7yHC1t;SnkNJ@4@pdDxShx5K`B#V~c(94st{KEn)~-aO<ZiFM9}pk-
z#G%7(FF(W(K4zUp=;={3Bx^B7n<y{7+`P)RKay`v{kGPuj>%o3FDL(P2^MfRWK~Q(
zlB8Zgc#fm@0~P+>ced$e0uo~9f~%1;JUsS>;0kvj+Hh(_h%EMM+E>0NevRrwixVsN
znDE|5!|z$=+pj~ZZYwe`%+%!8y<9Q=SW6-24a4__ycTiVb!Pu`S>v^v&e&KE5UPnQ
z$NYm7aUkA&<15kjf9d!8-><xX_ulK94c9lPtTmfuTN}eo6ou81!Se?f-3@)&>w}Hx
zLi8S9lx?qJcqXlH(~_7V{;fxKaz3y6AKlTwTZ(Wv)N|t4WBbo=u9>%*3c*!KdkUp*
zkq^=5_feWH6VJkUC^a|QgAP}hdIKu#jPIW;gEzP1CQE?_CErZ3f5d~arUMN^229h~
z?Z9;bPKOQe%TuFdV>QFEDU43YR;v!HM|LX8%nl7R2jp<b)@d3qBFs)FD0E%%7=qD$
z*NxfAu@^ltx=8Zm?r$Svo?A#Os|aDA5PQvTGTxqDm2qS14c{{-^jbd(z^ygJu5Vfx
zJ`EQD*(t}wV$YlW9oi<sznzE>k!jVZJKo+$%PgI+a%#3-c-Xec*u)df1Wh)!)DrM~
zF_2`vd8!zC-w@8uNE<3}|BKWNZM7AH{iboPbfI9xiYrjWPA4~pFr|k<g;n80|A6z3
zwpQk7L=l3H@OAK;i>xp`%9EcwWG<_B-V6~q+o=5Vcbv!Tn3%h?qNmi5NDG%huy>m6
zhpEV~i9hmsW~3i_x;?Rp@)zvRtCWLGvD#fL<3?;T=!NX$Hr3Y6!+;(h<<FyJG28<)
zJJ||YwGP_uCB#ZF30zp1z$Zat0m;d0y}(9hN@GO*RQCx6b1j<h)`{2Rm;f`IQbvNx
z=o4nM7|!#+Ve`#+yCn6HRZSRRC#KHiOvu(7HJ-rHclI)|WiKybN{dH@)5?XF+TgqY
zOhKgpHZ{4Wt@Y}#vTwJ4VJ!yc34=9V$lgwEX_@3GnN2phlK?Yr9pe%RH?-==&(wR}
zk!x2|4=ta4DBLd|Dm5#tYv?e-x_aZbT^pv?rpE6_=sH);@jMXJ(XemqpbHc+6jY%B
z_rtsAA6Nvmlo^eI0wPppst#G!^j@yH1@*>+8K*P57RJ3S4A!33uu$x%sFxw#g(#@0
zos6fgZ^D9G*Y(f*!yd=ak5#Mrw&oJdnQEfT$7Mb}4XzDvrGjbdU*Ag&C{9kb?Ht^k
zQxuw=m~y1Bxf*(YK5*>C<vye%9oCrTAGn>2(2C)fkd~&-BxGz)1bi(n_FbLcj`!2Z
z$4|B?5}sJ?v(#37lMyQ-_=9h!b|*}~S1ux*38TE<nYc$01)c&wvECicL@AvOpJP1q
z?C{DnGkBoR2FVTyP9k+||0VYk7p!Y`S1!x!2WSib>U%(H|0zmXGRf>Cc>Kl-MPG+C
zMKf%-#*0keugCFj^*gdpA~c`sGy71q&WH&%L#>1)%E~Gm>M44x2;)XM+E{YH4@ndR
z;ncf&3IEsstDpY=sP8gxi;29^4g@NNtj3U0v5R3Grb*+4n<l@x=7-FP^j)NRN5A$i
zEioyv!*%^BtP*6{=O@3^_I~SKU?IjxsR<QvWKvU77Io^ws%X}dG6k63NpM&;Yy+wn
zy|Sn!&ue5~2Yq);@XWvtP+T&+*#AqHs+d41?QZE2Ew2@+-@t`=a0_i{>%N%!bOHSE
z>J$|Az`k%X-4om80j@kE8vM*NH=@-~oPu<kNdYSgvGGvn6@q{iHmmRT_tVXk*I;~x
z;{w>x#4eNFG`J}<tv&CjpJ4^2{cUy@?7Tn)9OK#e2C>3YPvv^M(`x?`k;9&^r(>b#
zUH>3KZ8Z88X1Eh;8YWU_%XM9tM?@=;M|U)xYngo}+ZuZGow3CgE7@rfV+-jyh1p^|
z_i7Ao7H3iP5bgWLSt2;Mq-9Y)T4^}EFry`@PQLD?=jMr13ddnA>F>@qWkR>Ys+E(g
zHoJrTufW=uMf)G40;~!`7U;Q?edkL`DcEUv7Q!T)Ce@y4KR|5qvN|$bRyO!s{3y4&
z6+N$4Dmi5NG@}m?9T;Eg^&w*pB#EEK1etXV`*&7yy;xAf%~M+NIpTcaHnihTVvU+4
zUxr@0EZ3VEI+!ps;z|F5^p4&gkM72R(|NV`vDET+oyA|eTGN*lqI-8XcU5z}07}Qw
zDCb5-3+w9bIj&pyd_=(#s=4KL#n@Pj8Mf84{c0Uh32@mcej^sRZ4qk_O1vJx>LR?f
zo|=;<y#c!sXi+kd&ZJRvmXI=67Lf8&1iojWa3>J>9)kYcH)k1nr-_cZG&-@0D1CTv
z<b$a2N>W9qUvfaLVqx1aY(WjwdEM?kelS@E5;jbulldS8|6Z;rWvdCoTaH;RWEqu=
zXF;=}NK?+zVpIGrv5=?J!~aC0Y-NN>u?{Ee4$uyc3y!gNRsHqWNk<|T-iBRaH%|<&
zIb!v(x^+&I!!5evREsw80-612(F#%W45Jv6ti8Na7syD-qWOdNv!!3;Fqg=|uW`=#
zY<g$Eouo!$Sn))TVQIGExO>xc>#dWyWIXjBS~$e!`%wL#I-{X2i8%lec~OIFNhvA%
z=sWTSRhGr=G5X?)=;AP~iVRWs#qf#I)$Cuy5Q*7lzr?JtAUsZr+@&Up7>N~@KOhPV
zM(-UGQ$brM;$sQUz(iLT%?qAmd_R7|E{^3rHY#!jAQ#&8s)Lp<98AcjP{jVgQa#)K
zu>EwY)0hutFrm~hewhUBKQ<79g1ghShjbcFyjl$?goE5?({k$S_;x+Hi*E6)io-*j
z7xA#u|K$F0Jd#w~>}A*}i#Cg0h4{-m9*l9-_a)>1qWS-M1rG@E7mOpC)jo>UIe($X
z?fvAZWm0RmsF(NL@<3jQqiJ-+-<9nwnxOI-97rPeN_BoE3&3vcYD7)Y3D0TW_H@J$
z{b_~A{qo307Gc7$P95feurdJ<)DiPSZ@SHvp3D%e!sd3Uc_Tzn9&dfl>YyX_X}doW
zJx#df=F9s_-8z$NS#y_}37ce0w8iCumv_0bV%82t1(}9p8F|U75)Q*D^-~#wvC#~S
zaDDCPcv=hP3HSVHhef`gYi^G@6>4msK8NxM=|fAA&4SaFOC1p#>Q-<IyV4k#k4?TV
zOiRLqn(A_WF{W&aqZS%JpqGq}zlXY$pD|5!6~15E%w&<4P{QV;$c+U|uZ-4)poX=?
zfJmtXp69cE9uM+ZqraXMlhSn)7RO=R<5h@O#WkrloYIoorYuA6@2V>PI<6x#t3_WI
z;G@!AaEwT-Thjuq0(Y$J?-#XIuo3rlds#e3zJbGawz)+iJ6~W~!z#mru^l#;Ad1sZ
zoQ8y4{r9A*csx@-O1}#ZfVgVchbyymCe{|WJ#;?7TYrNisyCVwltXmWuz&EbNXqV$
zBNbOc8ts)c?(M~pCaL*O5DVf!GS!%@QWw94F-VFu5~wyrr?te`{8aBE!1%1uaw^G=
z4w>#h^09eB%jyX`np>ap9xl1MBlAIQ+0()R0^vDA{t9Afojk)~^};emx$$B}wUG~Y
zXnh%{DA%{S??Aj4wHF4EdKI?A(<SgrsvHvV4o@rIez<G&u$5migq#aqv6=#1Bh_^2
z+5I}s{B($U;cb(q#ZL)3LnCEFx=6K7gi!%r$jsX|Bsv-+l8|K>*~r=@pTspafg<<d
z$|}%6m!QD|Zj4(jpi@}xDG?*4ziiP-YKvKPkw4udP@IK0D1jL$wK)wbi6|^C73|QF
zXD_iOp5<PAgabC*C8oDV^8-(Qc@`!vako7`px(7n;}v%Ao95+5$-hw<o)o%bN)b~U
zxCOl`>g4KI@8liynI1vFm?b%+zAFHAS7js4t{>HIuWr_t{y{3}`a*>NE^rSRor9sC
zoed9lcsKvnqR;e%qPuu-WW|8UE&6!D0H{E|$h;)W+@^;62bb2YB0Bv+Z&@&PKQ7b?
z6^+jl=@3d!Jc~o@(U5*h3&4bkjUvUB*jHlZW)ZrXA>3+?qAM}$^YDs6bS~lG@&3np
zu%>fWc^&h;?T2(D!9cm~Fzxct{@XYGCynDai{I431-3*2QJNLcTPNc5GeAk-sJy|i
zX|Yui>f66aYXAPwz%>Xli$_NPn&_t-9c2L}@gEj|Xs$Wa848e{A05`+g8euT512q4
z=-%6#=x0N;>a1%|B2W85c$}+ZgDwF`23|<EZe;Nzz@%g#mTO)*zbLMf`$dqP{MG9j
z;HO1q-Hn6S@?TLAJMM1eT5W-YrFdHxHr1^YMVG$Dl1O?w1+wm$)w8Cak0I<2J7AZU
z6F)p8JG5RnhAcP~Aj?4bBxg9~?_dO)GDYF<BKF~+5XMgoKJjsB>2=>CEN)w|ocS`O
zzlq#)m=V^nI`7z-&$1bjD*fn9rmOZ{^iV85rvw+}8=!yGBS}p-xWi!9p%T0$w;n@8
z`T>`WoQU6!<AFVUmF<4v%4OBN@C%YNYeuAZ{1YKWwGh4g$h$OyaIv`=PB>wvE4NoL
zn+J){d@`DuU13^y<lT;~UM&LTseE0O)69c1D^ubcEM=BMC1n#dhE0E9Y$5ktQskYu
zt*TXkMN;pXD=CgAo-0-@6b;4AE>RW-dIgg->L^3o+TzZL#W0z!H5@3eHVfm{>={7a
z-Zr=AawtB!ea)6wjE&^W+!CJ((n0{st*RSh<++F6G=J$GY!2UP74;fS>%Y?xTl?`j
zIknI`ZAozzAt?k759uWvIJ~pzTT`P6uPC*BZZr=$+3RI>W|NB7V*GlM^2j@pIzVf+
zHOdhpxUv`myV91PCe#wqM9={a13B;~6|2ASP;|-(IycNK8kAda#(B8?9PmtgbOO5l
z?o*TS&Pr&MDB}Ra<fbT)gnoj~sat>?u-u$%!!rgIgYUfIv!;Z%?*jU$`)JqJbIp?v
zwxCXS_GHk3L%<updkf-9)BzVkXWayVhPDFsGtHf@05w!o+a-}MLQ&(5({BnU*Sf4H
z)I<X^B$Pqa!}BVW8Ux_;SYiZ9O}yve{`%U;it*oWlVm-+B;T2s8w%7H;qUBM7t3co
zl)i13=epF@?<;xf7|KA!CAiQ`(NjwD$E?!FO6+48d7vhS^+6Bcnb_go4TCMu81YCh
zv{94;qUtAfvwF1jCW^~bHn3@vHJf8uHq9+g*IUy(Nr0u5Fk5E8g4A0C3>lo|3f4Cl
zb2oq}3${WZ*|wdr!WBTNGZhWA9*O>ItXcR|!$HN&?+=&dPGRyP{e12dsI1?>y-~Bo
z-ias)^Bn*!|4EZNav3&A>*WCU&=b>EQiFr>K>ZJ{T0#>A^VUnmu1H>Agso2hCH77C
zj-6NVs{_(Mer>m`La;-;h@}`vG15H2O#H=R6+zAN0X&qyiUI>(2OhDi=b)ONDVQdh
z2_-Z}-Xe?+ADb)Ol>aDtn&&!@J3B`(eaD{4eNH(L2aKJdI36Rf8g-_!A(2YAmXc(U
z2|8GzwyNp*v_V{8R%vm)C_VPR$_g{lI^0aEHIGE_68Ls-$jmOTmDhj+YYnPrRUiB7
z!@rpE|4)aqmplS+p8#_2?4xwDX~k+xE3v_&45WpRBrR5!9zmOqoD!w|+@`A+luW|#
zB#5zLT-t@$?<pY>#<(F%KF@S-Nczv69?-E}!>H;(;He@oNiQcTx`5{s$iYwJvxq!N
z1~R<GWml#4TPLV_X-HnMl|IzPKcXM|O`b_95Ze3xVBxrmos%gEsnXQP3bx(=3b~!K
znl;ekznv8$AXHbnQ-eq=H?05EGDTrm4t<5bsCZIZL{)eUx6nt6KK(QC)5r@R;lumY
z9oeTPnH2El{@bS4deVosx{n4X#jW;yxX3-p^S8j76onx|24Wv6MU~J*!*ika%S_hK
zh+e-b7dK?*F;`WcS2Od{B&_5~q*^!8MZa0QMtUg+u7RU*5P@TaDvp(FYYn%uh8yND
zZaB=0vZa<w<U(ZFMbmF7-BvjKoPSV49~f>|U0uCP73idEO!`>J_<r*@ix~>6=v5LY
zeh{gz^g3Wp!SmL*wVZXxr?(3dRShPQ)fgZa`3H$B6@l^ZAFdp!XW|I{Y#9uro08=t
zd~^P~%mAZ#k*8+`BivB?WN@R%Ey2(CoimB}ywhTkOQ|jxAWmrNR>vP#?{JcoO61&;
zE2T`hN_6cCt}H1p&mu@BRdb^{HtSwr9|QJdERhkX+%_v+wSE3E`;O&PVyav-aa56J
zmtrM6q1R$aE!N@6QMS;|qM<8Ds*0b+;Kac09coCCM(*A3?AZ(?th&(R1ICKq^z5fG
zgyUUyZ8IkLA%g9^!H*9KLMOjW*zJF&ahM9X#@tP@2X9=NHn3+Fx3WbOqkI1Ca=-s8
zy7~{&7tfWwe~@6Ac)zqvry2{U2F;uWP_}M1M5;hPeI!xI^L_Gu4Ns#5?iS8BOeBAi
zXVcYwcU*y769D70akYOn*`4R+<)#|@mp-W8TWq!T=0$jW*4xp~{kW4@hkM7}V7%K-
zbRbrT=auZ=NXl=ApO-c^hjc0J12;^_gK5~HI*Lf%=!Vku_#OZ~m2%PJI_Kib9igK>
zIj21tf4Rf%<+c*w7Ho>&Tq?Di$^_NDoZT8dBr=~FRK!g+D(XiN-Cdl1{$P5NE^vZt
zEH3cKgfkDsm@|ddz5d!L5YhlPlN+<H)~-Zx*I)NT8!CS&Az9gPHYn?e3?30^y1@e(
z?u}`dTjf?mi93!2n#AZ@0&v53$6E6w7%A;%{f8|(7e4Hl$(SMfE8WDT41P<+AHJg#
zaBiZUHy1yXbx*%6m+r){MiO=IV)XgKW3(gyJtw@6B41Aa`^Z#fF+|lbw<i`b$=?Ff
z>%f(#V+^mA+kguh<~w64k7{gn2YT|!+X}X9HvJ_PYoXFN{4Qh_k&}|=<+LRf40Ru<
zwA1|$5YSinzh2=dWR`O!%9|c7WTM=$=rc7ymgCHCaDE}%O-K+&OHOg1WFBAQ8-j3U
zhO}nZIOfI?j%F<uQntd6i+%IXqDauSj`5k8(kn6bgEU^KAb?|W$EYg^u4PteZr0~I
zKCHo?%iEDV+}o@Uu|#_+EH<LJtGhfTI70>_VLQt*dX+92&GU(Dt6NM9!=lD#IQjCY
zt;vKE%xevPkFnh8ZCvUny{|rSrHK-eu^aeYAfwN&Om7wxEj?p4`_c4w!`gva-bnrR
z*Mb@DBl86AFY)F46@KF;pk?!D#`XSdY>m70Obgm@<TIR(ag@_?=3(L2^_`T<IRFui
zMSW)K!)hyvlcK}2{IS=4mFLY4!lg$maD=oX;2!;lVdf%)!JWCV*uBd5M{QP7Tta;3
zAgmcofw5JjbqnaGHm0|Xrs$T-`b*|JCK+-<A?&VOQz9$Nrgi2PcL#KH6-2eV^<E*z
zSrbBTR-ISL)aa^H?Er~rFRcI6Brz<$1s2wx*$YQ}n{bja@jhH4Yval8(tB&xEM!X|
z9N7MjKY{Nbr0z^PT&X4Bga)C=qY|*Vo%8rO?uT(3IL4w`RrEKNi%YABE4M3RKFR_7
zOgvm9aH1bTtiJGsG*8T~EToxh@y=TG(g?)XVboz)*JFzU)xk%!nY<#H6fdNa`H8L{
zEI7W<w_;aUvE3eS(uy;HuftFkk`f@4BzakHkiT2ubM5H<M=L)xqFk%g85mv(^CuS;
z{E<4AO!E0D8nb8^hNG5icqRO3C(JJARL{L*KN0pqG_Ot<rp|#wBFd7S;`M6JB1?Ch
zHRvAM!W=@9DHEX66AI9ZKIXuYB&^5Q&_Bp5&s?~~pG@n@C4fEkf?H{4aUC|FDwKR*
z(LCR9oZz8>kzVFoZ><)KH&O7*!pn_e7-7{YS8s0(@9z=7v6;{xY?&#u9pkMlV;+pt
zl(erts!>(GB=%E>B<_`1|9wAIRCNvHpT<gA+7K-#w*Pyi_9lp(hTdz4!AHP#WW>IT
z^|ZkY#vMC&fBtAsrT;hY0dKZSk4SW<;gn23MMj0<%^UE~3UWQ3{z^aJKRrZ!*k;7m
zIswvYzygcCc2NFqXCz9O(qQd)Q#8`6ljF#bV&|AA<?fB{WAU@PD|w|54WZ3GsV|vW
zuR|gsNO1K}_7k!nqB>Du?WWGBQUE@e?xu`FmLoYZlTQW2wb|X$i<0f#hz1%e$x1t&
zCdn5OXvn#MyZDHF2yS+;*rAPCj7VTJMX27eFdke-TMdnjO(bCeNv=dO-8gK>2a#2s
zs7ToBOK1!93-5oJN#I}GKfU@A_t&Jez$#@SNDAClgNyESqZ7OM9=PezOixa}4`*Ku
z)y|qyaXbot3ULDN1>(tSxr~Hp-Ew-PY{a@8P1$^s88@l^+RH2p5Uy@rE<T#F)wZ+I
z(78=C9~(Z!MUi=8N=nSDa?P<99UPr9R_i6sd>j7MTRZjT>^{u>^|RfEZ{M+w;{0}~
zuT?S(fgXhaJ8eXbAiYcOxNzJX2mS22r7zkn1)7n~TyE+BE2*yk2k8w6{-dA+BwQmV
zMp)dj>D{5)RPNJ3#S8vh-@8I4u4I~=WC`sU60lCsUqyIAE%D(b(bzv13tZ(8DT(|$
z3lp)xlToL`I?%WH=5H1S@1XmelBoi}e=vl9-Ga9dB*Y(ps8N6eZ>GQ^!4;NrL8q7u
z+6z=yo}TgmR|9(FW19LytQ6<QJOF<=GvM>0nF%iK6a=32XHh!dALjw088e-#Lp}US
zv#1DEoQp1#xbbk<P_8@1F$9R;$80vJ2vh3Bn}B4}V&}2byZzyd+)at9(_i9ExS>+k
zs8d0MM&TVBoy(onG!>lIfeyDg!IcDZvIATFdL!Y)z<7SCF*a9&nPybJy_L5n4rPVa
zSFb@+&YdA7XymT73+2%tTLr@wR(jXQkX;1sRPGDk=x#+=E{>9hzRfK);1knB47Q-Q
zDl!Q#`D9dVdpo)B;gQgM?_WK-oISRBbts{i@pW4eNeTzY<l5^#92@Uy9YQ0+{1xK0
zXSRCUXpx-6N{C=4o-6ucqj@fP?39oHxpRH&!>x!QakFlT=>h3WLh$JX4&4URR*1fT
zqh15mAk4CrmB~@>lhZ>ar=~J+AH%G2|L=$vu?l4uE-2BF;#+^w(8`N1?1#lgao=_(
zX((gM0HPr%Nk;~(UY&9PM@hCue6^}X88aNV;>1F1aMm}mo&V7C;tN`1Y#)g!*3pb;
zDdExVelQ%0Vmj_9;723jdnhU>^36*_W|~Mf7LTjv`Irg=2M}ZPZe_u$#-3v^<&P`5
z)y+griX5-fvSNWaxBTTEHu>%{@@VNnyMN}sCn;U^uPM<MJfvT`)EiW`UGzS?9POO8
zEjtyLz{SD5dL}tI^YFrZ1|($i^gD`jGuf5xL8Nv7BRT-+BOl$*TWN)(7OOw23*eyk
zl&9SN&@XShCG3V>w5F!2t&`Z<9v2sFugwTcI$d&dApg7FdrjtDrOZLaC>eDZf)iwK
z;ai?5Z@tlfj+7Ix%6R7f$h7=YNc`TAQ0~+-?T`70kI({He;TqeQOBu$mwT-4O3C-X
zGl$y_?jMF>!IOQ6TcV}e9i;qUY$6Ky!6btVO9tD<Zw-9QV|q7;s2+&@G8{k<fmC~$
z9>WRqvMpEK&7L%sDWF{(1iPWL6kZa6e2*Z)Y(b($g$UdY6GNC4X^5LIFd_>36sL*x
zA2Ock8B-Odc*I)ABt}^;Fx*;jWweg9_%0$nOjZp`$$E;aQZsu5Ed6!Zf#2_K`OsPa
zL1O(Q%QV%A6UBCITQd7@;DvTyY0NEr7A&O%{YLMX{s~>^=jiHJrM;Od#yk(Nt}Q;+
zU$IBQU+~U|uSm3;%lVlSph0O)rG85e@5mWtD*N=DZucG13QcLB=Usy}>(>LzgmGKO
zxAXV3XFU&gs7Ksm+^Z?5riD+d3*x1x4SSSbwdde`2dkO1GqT>{wY;nix(jxvakT{Q
zWA3?&6cQgG6=8Ma?^aLD5NbvHMNP`e2JEUOCuQ#xp91#|(?A9<Q2@PW93lYz!?NPq
z@&5hk2kXPv^;1TIS#JgE+Tt0ik{a`RKL|77kT@+p#UwLu15}qvt-4Rr`NU%Q#aNR5
zL0Ya=9f9!Rf48ozv22ef3G0hc7swUIov_;V#LqC|#O=V=wX}=j5>+JgiuN~qTJ_<Q
z37`o?Ecq})@5j9(Luvdn+W#ppN$csq;Y|2T9GSo$6AjSii7V21b9UL0rGBk<_+r^G
zAnA~A*?p(<K<{7aGsIj7COGH1H5+}Iscs=P*zbo3dQ`EceUmAp_xKnErgvK8R&^ms
zaw03~?xHY#bOva{?>t4s@p`{=tc-fM9;p|WSlQhQukJZ-`YSCp>4A+`;cJnUQLckH
znEUB>(7w~LMV`(Z)^ex(!*Sh;(STC(l;G$?z<j-LRp~A(Kc^TUmUix=QmB-K%EDht
z?U=Seeych2(T(|<PCJKsj4fh)1Ptu2(bgJ`-weV}_r;Mhpq4&XAdPigo21@S6#I(R
zjMqE3d3RP$H;vCChKxG5yEuFjiWra|Hq|wy0$b2#KdFwB6Eu)|pDWM=nG%D=+UtHK
zI}n)$=jjaky)w<jSh$2Y!pI>lN`1jKUte=)s_MmQx2NJ$OkL>%u3hG4c7MIva5S}d
zYI~l&()`0V1r04;1*sQM8u0k)sWCC8dGhH40*WXud!B_U)&lm+i`S0H&hXKvoUgws
zEL*T24iLX2+IiKFP0R6bCr?&H2u2it4j_(}1?gFg{e<q^3I%JKA7kQTYW|uxIU@of
zRxismvA1PX+ZKnw$<@I2ax_t)R~WNYtXYO;8X%(j_+E5@_k(mY@$Y)yoj3I5GS-X6
z)@DJUibp6{iJo%j*$;N|7uFPLi{?K+fpmW@_<O|8I1iR9^(!iRBnq|Ne<H8ag&nx$
zBbJ1ij0my=MW_5?XOZ<f=H}{j{f$CDsL;<l)|DI!BaJsCZ~a<z^P-<17e&KI-(zqB
zAzT;)k}i9=;)KOIpPFT-oX1E5Lxjj)LEy%bL4AB(7R$64#?mBgxSQzMAw61#111*J
zGIE8(O)3xaC9(=D*uNe55}aL=dG3+t#|#vmXIB-o@uf)618d*hikuu0*4OA-(P`G|
zUB5(~(A}##q36yJqkOL6N5NKXFaQ3btJIc<qMTzVj<1#aA0&KlN<x)Inoie9M|Zmf
z9@#eIres!a#^g9?@cplrs^_lt%YiZH1~z9w2mPCtJwst7sg!6+0tRaW-0W4Wv3rYk
z*^wfDS?)2>7+Uil$gB}l=1-&T(muD$IZ;3-qBM(Wo(P`<3w|Una+idoMWPfg8!Nme
zkkq_@qiAH5TeN0N^^&T{P7yfYhx&Qy_G@*lr{Jq2y647f>WwUUyj2=kEYGdMHTyqz
zSNd<c2G3#Tz9NZ*BGuG{sTefBYp>6x=`4O;iNSVY-=V~x`+HX^Zdj&VyPPYqMXCBt
zySV06k3_6IO-$}Ho^V<7y(?fw+zjjzG$x^XGOok@$0H|)?o$9o?Ez0@^c*7)N+vLM
z7z+3Ht<@WM-cn@M3e_B4%)3`PE_`sjXrleqy(bK_CJ`s}A29`&7Wxs!Y-z6WJSBcp
zOAOk9l;m5e&}1TeWiBsYCcqC$3wyYu=TgO^+nXu*smgrs&7d_m^ei^ErsW0ExrAOj
zBqUF)N%HCcbEeHn7!kg48<;blmZUc-fS@d$?6=omb<D_(PbVsSj$5uLPyRikre8Dk
zr>e`h#sewMQ#m}vCw}+>FjZJJ{WMo(S{#8{$Zj0pNcG_s*}8*Ro)FlHA{QAIBX0<b
zg{j{1cgqv_X~rpv)<ZraZ+vP|B@PLS*B=75TyD;NOQ_)si9~{8)@$B4J+Z6{wUS+#
zdWa2|x77(zzeV3~8Qiu;u-T5Tnhh-D0>tJt+QKMQ?-YA@7x+Y6bPr~JyOZ<VXi`lJ
z-9z~GIFl9MPX^+aF0l*@aA^1-e2_hPzKs&2HJb&M#55NM1#eJlKtpfHzWMl<fYuGC
zPfED7!qHlmR=QUz{R9!Dmc%khFYg@po6$_JTk;@8J`p+HrptlrGeor{nRMl9PV1KM
zm4~*h4ze`~d($hT1UCNnb%DoYX4~vOzzr`U0~YZ^B&m~E4dZx%=&D$IiF(r}ZZS;f
zwOPCL3|WEFz69+Z9;^nz1jM^0fzL$8G`AJ54x9xMQ@P^lP<CV4@|0M^j=a+{2y6QB
z1&%MQsncU5^~%t!u74hv)-8CbgaQlrF~<_N#~frak3f&dw-%t-D;11$2r?d#6z-ud
z^M0$+XSV7XdQW{H<5=2p=$EwL%5Bh6But_6CL6o;Q_-S-*(o%wRDBM7&wr)WqVuQM
zZKr6_3Y}V`|Kbm%WG*Y=4^QGoZXv9rMkGqwdW#{S@0d?-kD&ZRzvp+|k1)m5PhEBX
zhXI%ZuXY6rW&3LjmS>f#t`gkdWEL!Dv8A9BY*#@}#IeK2xT>Gqv;&Z^k&PQjE4jho
zoN{7hWp4Oas67IE%yvqlF|DIS@!5g+a@D2OsXuWA*9rmzM^`5Ayq2C>`yuhumRChq
z{L4J&57(DGKmqEfSiL3D(}aYakWO8FSp|A>F!4niaIu_-w-xFDijx#G8SrNzxXUDi
zcuV0omM(u&nSVcLO{^?SwM`B_-Q2C+%(g<$g4h?c5;ZGmi14l^&9G>ficK%Hnp8k5
zNU7t32Li_h>3>5FzI$$~gL6`mTjC5@TO%t0Yc%rjaN@tQlD7u#d$GT^CDwNf#^*QW
z*iW!<v&`@Qd(fV$+9xYl0!zqCELE8`)cNWt+Ct9J>rV~gFAKgWB4wcu3t0YEN}o_8
zaJn7<4?EtVlJ`0+x16h)15l29IwZ;H%ZtSC&0yF6k|G-QI=zBQdCHE%1AAO-&o$kX
z5s}qBWl+HpLmLeTo2-AVwN+BVRXrEOlB#51wC)ndk2?9V%rX>3tRq8rK)opr|8_|H
zt={b|R-=mQ2L1hVPp;c6#fc9PCDj4%U4g<$9Xg@wK<R8bY#fubS)+IIc&gdb>(DFs
z00?i-8ACi8VHlBMl%X-x#)l+Vs@&tU>MZ)2t(P7#51k53gz1M2Tt8Gon(riyQV=Hf
ze+^#gO29mw7R-?>?Y0IAz_81K+e8%gkQ(rXNA}MN=^~?41Y=b_K@}-HG`R)ZnHY;T
zoSX3Xbjk%A(N(~XQHl}{3iWa^F!yW_@q|0uObuW1D=GL0>$3_Urn{!f7zj8SLZc}G
zMBL$~u6XQtA4-G!W>28>U=F}#=26V&0^!M~Ik#vVRqSNa@dJgvL5i8mxiN8#MVBvf
zOZ(6pO5w7lPBU7KwWF9+i`+3R!hwYOgVH@im6=)m9@5!o$=aY4T0u6?Ar{3UCp+y5
zRJFDNE3f4(>e8Cj%G6vXJzgX`UllR!^561&c5xva>r-qORzwR+7#@+|$Azv^4~UD>
zr>A4v1C<idsgT7Lxw&!N9e&Xx(Jx?UhL>9Jg8L@SQoH%-IUvx5DNxXWk#ey1kWENs
z;@)71NN(~WL(M-(HaeOp0mBXgb7VNPKFW<Jf)vM4pE3sm#zkz|0OD1(#y>qbT6uxH
z^Qvu^)x+MX`uQB&x#8}!4$!p>D~?r{LqXYaM4)K6cs<eQMwK9zefF^2eV1~N+y%>a
zAw5CGA?l1eSN&2%#*@6vhxo?uSbq)`sU-AmpZ-D<#FE82fHcK*G(Wf*k@jXLPlQYw
z$RiQ|HZk)+xMj7`D*O!2>^?dTF?e`q#1guo9jRhjXH$oC;z=+g*n>0tO&}zuEC%QZ
zN$t3xxA@n{4@a(vj;aM^w!sX-v5^p$dROK|ggxeG%omID=tOZJ?&_`Wmtg<$Lws2Y
zW<cW0>WUX1r`j8~qTm`iHdwGB4x5(SNfhqwnI})$OmJdRh&?;6avnWOF2GigR!ltY
zDX+ytAAZEjY?zmJSjg|}$=9Z1c2-?$(?}<sXe?BMF63<RanTZ%4_w4K-sMT;v|jCj
z=bbrM>!wwDv?zczPdB=%SJh2DuqMflS{^D}n&<s}nTN($wb(8Oe_bfeHMPtPE}FJT
zzh*ti$T7LXDx=M>>FNpW$uC@U;U3@Ns4lYf8rtI5Cvv1ZE9%vDk8>aPR?c-WJ4^<J
z31TXw#kQw|2O#ayjiKf$(x2{xp#2B^gM*tUK0$KoP=&c!EU$ijQYx2fR|eff53x7%
z91V5O0K{X>Z*n!7D3bKT6||A@AIWW*$8?2d&ey6<PNBH+va004Sgy-okbiGdCp}ik
ziz2*cy_qt>NLSt?j;V7IAqCqPPmDjRe?Pw7(ZHXq0`;^I$$8}(uZ}ab42ohpaK<eY
z)g%75!QrOYh}aMYp#rk&poqNVeBiXUiYqq#I3`Z4?jj&qM=^NId6w6paNH4Yv%<tM
z!lx(IED~79@?m6+91JTkD}Ed$9MD8z4DXt1Gt6ftiMf>_q=kpbds44OJmbARdUQAH
za*HOmz>t3X-x4)KrT*{Ncz^QVS4*qT^X-?%ig)ckZ{juhu#f$aQI!v@n&Ny=Y#G?k
z+d^Z$zO!h>Hh0*Tt}J%6`e?J5Co_d-(FF>wtYHdOt@=HSTHC(|+=#>nK;&RNqr}#t
zE(#{DVZBo#cdv<ZEx==lWUK6Q%H}}XPTjz!NRK{|*1LhWEq4?PpL*-ViXb@>S5}3u
zdJ{MuhvljiQPFY-g&I{Lp1Iw_s){H@g>x_L=S0@8ZDzvOhQ*YKpBgs1?`tPIixPkQ
zoo!H7Pb2%2QimqCM}q>B0?TK0n**eBbC^(C^d^bT972YPK8Kd&uqEgBz0ib?S#Zjt
zhtUhT-8}hFMwc<_erK}*DX<aVf;CJ}i7<NQfMR$6KR1s@XPhmhXO$)+3h7qOcz$={
z;BOhYD|S6w7S*!?`*}0}7guK))K=eaeTqwwqJ;!2uEm2FcZcBangSt6ksGH#g9nG=
z5(w^AoFc*9iWewQN?T}w_I~r6GjrydcV<sMX7V9>@Abddx_)arRp6)^7_@wWDuR=H
zCGKc;_+jz!I-Vqp;nK#;H^`f|LK|6X0<Pp4v5NwhkDYpZ5tPTelOWDxi!O|mX5moD
zsOWY{I>WIhSE_W;j!QZXVN{x`;~l@C(Phb;fzY6@<D3Oxfgf80@sGXemk(TaBA$p~
zm$r@pd}`&eN$vMW&P^*EmwaT2izBTI$h;(1U&UBbwj1k<@^eBJ_I79wi`>zM`TJGq
zgOG~%V14E!SF#-QRz<1hzR44qRu^r7B*hz)8m#NlG_RNL)yIhQ?1Kz_KF8?dE5F4n
zizk&=r0(pQ_5?JiHMM0UrDz`fAhMtBoeG`L+ctcws$XWMe1S?v_T7?G)it}VXb3*n
zp3B>MI4v6Uv=hfgzlL=HATS;Kwt+7RA_sGs17DX;+Y?cg1|z?se6y57XL*WAt+lFr
z6uz6<V!(-PXw6F+tS&KLMO@GJ6;E}bUH1Njsv-LoxWU(b#bh<`c&OpY$iA!@iA_k-
z_Ft|3<xhY^38;o4RuT4R8@76AOmF80)lgR%x#}6b=j(t*8hXrDclUBpG#c_8bDz}K
zK->%QACPCeUu-6zNc*^?ZRfn_k~MkiSjOLtT5Qx|+rx9&1f$;j)i^_L3~SK9LGcN0
zfMCAaH4Abbq@&978n&6*;&>Kh{BaE@rz!zPMQV7h5H?ACpQxGZvXO9J>_KktyPjP2
zlwf}DYucP-t3@~wfi2PeK04@G#**5u(y?hxn<UggTquDyCsHlWmp?)NC#AojgsG@k
zAn)5o$jW;$`3}xski!LM6`83cHxs8{aEnsXs6T1Y`U6lW-?e$JIFApbk8)i70w5yj
zRoU8TUUA|dLLOp*t*5Bu%=`$qdw~e9bCX4{w0l0+cT(M`lT6%b!fmdD;PlAH6{WU0
zm@GU1A`r@$SK(`?JyK`!)?mzF+GeDWVEBqPY_m*cm}w{bt|j-qlc@*OKV(jovvYrY
z!?J%jgio|9QFI*r_kfuO_Ef}JYy9ejLSAc><=e0HW;YR<tPG;saUbo_N+@;g#M2<g
z6B(Yre<-skkC4Je6$~M9#a3T-dqIzK5rHXZ+gxA${F*hFTienHUx(BDxD1Y;UE^sV
zJ_DXlwx(})*ozHJ1+?a|(ib4m3nS^uaRm`B;tAu6pSvP8+OyNO2c5rZJhV4lMTcA)
z)dxG%zM@T<(S+ycp}F2RTfoTDn@8CLT_Y7FEKn+E4VzUl%bd^%fj^Yrl6ycY#9wHp
zdPXY(EzCna5n*}X7@|Ikk>~t0%D4R&O9T-s)qZm#FLA;wPE$@Tb;#ueqg)(uq!LP2
z`IO(?bQ?1uW<*_~2i0tzze17W!LG9lK+!ePva5N*M31h&t5=<0w$*<SY8wKs2(=r2
z6${YH$?jEZs1L8~1aN?tM_9IPh^u;bwHA<Q^K@Eb9cc@a7<Ieor2GR!Rsq#ct3EP!
zwbpk*Z8DMVnZ(z?YJ16=K(#fGp4=WI*X(q*05+Jj|B3w)*eTb?4NsZD+<I4C)!B8W
zJMkcHjI()mqXOmV$!-Ux9<fjR>TuHI{yi-4hh=(!78PuCvJ4Zb=f%%9ypA~nkBb$;
zG13Msh4O8UWJAK{H8K0nr*u4L*1tn9rL1NkJ!+m}!O$0sU3iUbz4Ls!lAOo0J#VH5
zu54<T%2q#4zuE?fYFq0me*jml=PNWz7*6_7=LHrgSv{(7I9cLXgB1gf1WJq%8^s~M
z;8(-#awN)c56amSxVK=>(PQZ^ak2hUozRf-EYVE><E0cNQfhXaB+&LrRgD7bh+4I3
zq0QZv=^7gc{Rv#y+1U~;N(}tOw)8q8t^hya5{;;EN5&nl$BJW*s{how1@yxcG;5Hq
zpd0rjTV;eB^C=46;bznf_jo(89~VmIy7d+;6oj27rMui*Yuu7NqOB3$^3yQvl8Nlj
zq_@x(qBSdy+@W^VJCoAN^|ER*^j+|k-lSoO!=Rgw&{S6=^xK{^qNmp(anE<1f_*<Z
zlYn2fA=7uf<){y(a%oT_)9oUuim<Q%C85xbewtB(RjI9TQ}(RI@f*T!0;`ugmR6PZ
znW*@~cE};j(bO4#FLPkb8dc$Y`3{1WAaQV*^Ve9dnC*IN65mD}x}>%1!$(Qr;*H)r
zNi8K=8A#95oKfiL)O1)ebXbVM6V*v!JY$0BU(h6)*H;(o<BG^kR#Z7w*H%ka#(iu4
zRA_b8<|Vw@G%ecdlzRO7s^#5P(b(6}!ozOAZZN4NfmqvxsR#5xFiem2TS2r`bTNkW
zn6mGdV2Q+3j28%*a)gWGj&3D87_5-f(>ntTL4W?3Mqe|H9WZ@PLMLeWFsi?iPhswQ
z!27zUvG0nhzcBglMV*jGe-IG|!3Z1fJ2@+R^{G$dpMeL%8-QNjwYIS{v?|Ut-cjnn
z!kn&pO_weI#td88dsJw`cOu3@??d0>D$K?MqDV{BxCzmyw!<Gmo5O7Udc`Ns$eSv_
zX8rxlhJe9#BQOPNl4)zS)Y@TeMu`f1_Zn&20Q?~hS;*z{)bos%6vJwecq*$v3{EQ)
zn11S1#vUG*fXtquJ*o{2jm2!S9}`)*iPkB7$tTIbOb-5GI=dzRijUV>Zjst_+Ydi7
z=m=%;3uYcb&o03~Pc_Q5dD1(K;cK@rAQj#0@=<8AZN4KqpWnO)H*KkIpuB@SBs&x;
zG5Pi<yt<4pH7*0L);DaV<u+0CmCQk&&RT(v`(0CjnaY<w&{40!lds|>UdR%F+<+&)
zJpD=#i!x(ge{e(BM#T+b70<LCi7nQ$XRjD4u2VX*Nz-se;<@eG>(DkRxc@5scoxKA
z3Z1T;&Cr<z@w}Z2vL$kbRFzw{FE)Af)O1(g@zZ{{;U5@Ni3VAY`-n2Tst1tNQL>~#
zNR#?AuY=I$<Bc{3mw?xphc>6-pn#+2$~=+wZ3<VY;ECTsglD{eRJXOjY-ojr!73e~
z2!WOgR54%0|J~3KP1wWVTJ=J8nXskV_oBWY!NR!m+5ziEPeOvp(*e#*X!&q3Yhk~>
z6R1u~?5`1{yNQ?4+W$?e!J$(ewVw16HczxpnV(Dn(At7|Iv|!?WSbGfbnvZ0yQ5|=
z!|ZEi7%uNsr!%~zsrg{9-ZLr4crxppY$AWIBddE5TQ8E`MyBwgs0%M(?E9;h#LDf9
z+!$iNRX3NvrdQ2Q{@E#u&wRS7yenn>MzIo0OBjFGh~Lehnv5+etEI9Ren07@@1#Np
zmWAz%2L~5>_==NAi1YgRL8ex_Wactzp)Q3G@PrF?{N&IlaapAKawS(95rBSo?Z#U3
zwy52E7T_&M^%T}7!;{?e1_UgLL3X#0C+pR^>&0>}Pa?YUuO417Ub6Xi1ilB;sR2pf
zvSpz0Gz2*K3`R8H4uvylGR3*a6}=T3;H1#Azoc4_)udvQ@Wtbyaik0k5a~^%k9fmx
zZWElKS_;>6XG{H#i8;M|tgo8jiHz@5XPgo+<a^L0>GCz%ZeJrR)%YvuZcME>VfGj;
zQpE#N7ei=2$g0i(0O8pq?q!hQsd*N`_4Gh?_j&iQE<WOSi<-KIq$YyX>=3*PC_~)O
zB!&*N`5`cKyeWa@UGsq)S@Mxh+v`%+t0!oNH!oc-I60YdPJ#Pgf$7`#&+Z>rF>n95
zwbuXt^-mW+#uLZHA*Oq6CmOH^>#W*M-fje4s^DtkDd3ONQVm)e-o4`B9j1ma3waaq
z*(UVs8**VQtIz$5MIw?iNcC9$(=ym9-*>I$&%vF{IjSPgt36*Z>Qh;R$lh)C6<N}G
z6<vR<Cyd!e@?eTz+;8z*t=^KYkK@Sm^QQ&>h+~=VA}Y#_bn)^@HnV>MGq$4s$wrpP
zS|oLnL`tXjq@~Zs-O%1yc%`q9vL06eq9Ltj`B}|5QQ2$62}^xK8LH7f)!?<{A=Xnv
z6T`Nk0v|$Ss5Ya^l>Wi91yMGft!3{D>cB-YbJ_cIM21Jys=8Ha%X}(%hATn)w__Oq
z!tJ-FZ|gD6WT)l01@;ZoH+C4$FY^6l59bQF*iFw1Sx!vwIXY0{GBD?$tk64y{Ox^}
zNRP&7jIC3KRd^<KhD#>T#-{+9E>{mCt^$e<m)KW^<=MK%PocEw5MFS+Q-qmal$n+f
zNvcX6>H5-w`JL2!?xx^jld9XtFCR*bQaqku1@&;2jU=v`S(O_%j{ucs>=}cRNiUqH
zMQLe2MH#Wc$1=IWJoerucf`Zv#Uw@9zxC1PXw!pLk^<bmOgi@+>=rGH#Qu?fuwatf
z)yR#d3&ow#PNnta<|SjP3C;RJSVJp=H8^Uh%S<@0U50zfP+HD8{9mjrE*XicQIj|~
zS1E*5x$m-P#t4q{R7jk!uM9_4!6bh&T>}lpjdU$G+4Kuuh3~34&!}FU5&s(X{mhOZ
z<FAi<HC?j9F?Rdyr}3J}E-$agG+DgDNMjCrd3fRIuIO_dg72~s$veAS4Rz%c#tt-X
zx7hvH>zDMe7QECpVnp=8?C7JtPyLNQEf*CgWtDB60t(w2T~S}j3aX>H*FSE#Z!$;=
z>O7*Fwi{HgPWoubBZ4RqF2=7SLn@c3Fbp8U=H!O#1m0~C&p=Z+;x$OZqPZ4KKY>*j
zFejUkaq$i#hzzj0B0+qT+qI)3Y*z;wBuZt06S2BH9q#K2T<^)dOq$Cip8V8WJ1K@=
zH?QJGUxHd3zeq<7&2kkOS8({=J5EkRV=y~+G-Xax-ijZ<{2XfZBE9{c;#RxPX<gq;
zH;lccrv=Wn6#bsyfgOKbvBf3514nb4i%^|6hPj$=4~_D76rXu)d)9PRnd*x=r^lmd
zvG1%!BowRhD7P12J7&*XAAcx{te}&cho|sY*PJP}Rz}%9JT``>R%a*3u1WwlN~L$H
ziZz%}+zYv)aK+beq+0<!Ps@L{B((l)EYFsH`{?^hygR1r;c@i`2SR@KfLh{F;pxm5
zFXs2K5KqFRsyhDQg}q3%QIwk3rNPwXeu_JKgH1U<BwCPqE&o>OLwk8R)!ZAZy!V%{
znjhlM%*_8s1W^2+nZcjxe)w`&`^O`wed6*S6;RAa(6<j3CdqJOe=-VJUuI=;&0C9V
z1X?OZ<aP5{N^L))SJj^1+-njXfqtWcot+NcJvK@#93KKQM;ZdHiY{KdXpE{jOR7SL
zkF9q!`8e)nJJVZQ5Ow-y99G+F$1`}F1RUP!-7`>ay|QV%)&cr0KC=2(;-^~%lO8gG
zj3f}*6=#R*1j9aA4_20x0)Eq+g;i-fN(FWdfk#tkb~az)+ca`|y!MhEECBTH{b4$X
z3#)kMhq|>%UxO$%-B;E+h(8StwO}J<c^4Z|QvIS#o@`gW>%tarkJYrmAQdWIt@OQy
z5z_|)*l{scb1If1Y$o8#q*%^A{i80=irar>Em5ESZhmr?|I7F^gdz9bfl}p5+aGCu
z%a5Z!D$&cGhAuP2VXc}^q$ORMoF484#&sO$H!gC?=>mS&Z@pBupvcd=IPCgv9v(Bn
z!F>cBU@Pr9GHx~zQR4T$Qsr3Jc)hcQJgp9*#7_EQ*r)kCNN&-*-g$Jxs+Tl1-Eia>
z`Vz3?8_1Ra#*~N+%Ges0QSYqGwTDfhLPrVFLsHL)-AJWw{<fxStoCYmXujvKOIu0b
z$uaz$85u1|I%MImb^?(zDJ{A#5`X=oUajmP)>y=0NBSEO+^yT_<Wht7C8-s}e&&bv
z6gjiT%CxUqjj3h96FL!dZzyBBn((}hIjw){g_k=|z|y_xPt2)Qoi66;6(EQ+Q_1CZ
zMCY{=VK!fZ`K#`5Zz@e!*9Vw-J)rO7$|eD9P~kOVUOo4~eUsCVTVS6B|Jo$Qp394R
z0fGQ$qVlM<9ZhwX6BAT5wJ>EIAFdSI38EYAehAOkZo^5k`{Y0{8llzgBEqD*M+p^~
z?OLyUJ1>5Xr8`>~ZS$*6{rZ5b4xRyDMml4Jk_;z_YeR;z|0+3a4?UmV{0)zppr69_
zrxBij8Q+hmm#j^DlC>Sh!d+Z5Rd_F55m*>SlNSPkoMMqBmyRT%lX+|>XKANQR0LxN
ztU@o0k&oqqMuN0{RhoW*$Np<QkT*&)3+GZCN{(lswh2zxQ^lTj2NxBA@F?7{>@d^;
zswBcpnyPsPX<BK;A;r*XILUjPwr5(|P>Y23C;Bm7;W+`aqUpTjXuR+WPFj!~8(`@z
zrt6=UU+JBkewh<QoN1lvz~O_ov(23^qD)gxZ?yZI|5+AzMwLpQZ;NDQG7i@w+@@&x
z;^vpWK*|6*Z!?E%`CEYP?rUXN;%qb@sZJWwY%w_Pnt!q4_gBOKehb!aTFO#YoQmQ2
z$+87O@m~}#`XFvXt@#iNj9+2yA?&GXu4eXe9ev9>O1}Cx`Hb(7(nOkp9yszT?vm~A
z-oP{vp3SK-N3sc&P5LAl{-F8)v8c!yNkKizhD<q^g$t1QPi3*}cT%TR2uNSSvwU^Q
zn6B=>wXPjYQIFH_zce1|QHZR^k^5G79p&t-10kO&KyqM|S6kDDo-R*u$Z0!eO%8rl
z=1{&!2q3nIUq33IX-O3L+RMAs;j3`N3HCH;+f4wwfSTva;<Cb%6y?nHWjroNrtc)B
z`7BTpn?C6c^A`anZDL*2&DBC0C%vQ8FM@*-|0=p;imi)P_$@tSX!H!c88LKpDw(q6
zDq%~(T>`n74?h3E-Yx~kpx*=|ahnsY(1P4N1+2mL>;>x=G$R&bGextHoRpF`+H$EQ
z!rZ(2_GAt|0WxuCf%7CBe#F97T9#OsfI4zptwX+T$W}~fZ0yC<13amfJa;;wO=f)d
zFd?I`es)+AGvhGSP^|NIGq_DtzdPzSB#PGQZMy&qzY+*j&y2L98r>)tkhzx4_A<;P
z+VNOIZ?^LFDWA7KU!3S~pk=k3$d;6ZP_H&iPjSgBvj?(Ytq@y~zSGB*>if;L`Hc-H
zI(dB}O`{vYq`~Ty{H!c04!$fFmc=X;_nQM!2$Za|;A3Z8!&xv#j002fdMMsIjcfuX
zE39`}^@?>;rvmv5lROsMH!r|~4v<4V4>$snMT%diQ3K#1_^zE_3LI+@xjX?8eSDy|
z%8Qi@;Hh~FQZx<pKK^O+abZZzuy&pIxKboJ$_>ghYNP7HK%a2@yI}%PM{s8F<<tX;
zi{!i<Mk@u_J-ORR`@N$t1mL#8t!j|AH2~_J(^+Fuv7A$$2V1qg07H6tzL2^oTx&p_
zi|d3Y7G=N_H+^Bm9fO!R^?CJ7s6-L|nJ?zPZKz^rM#Bc>Dp-_Re-UST9DjIn-pMCc
zu3D&Q1XbR0EV`pS%)7!VLd;Yr$rV6n&fkvth@}Ru0;eF{^t8jD^DOmzhU?p_BQ<FE
zYVv+#>;qjLr^HS+<0c}4phC?9gn@Ai*Od2oMt8Y}1pYShd^IX@P$-K2o<Av$s{CF5
z)iNoTNnpxp+d288%-hpeCh?wZ@$xqRGSdX<+vY<Thk0&B1HoUdVv%O{Rc&xTX?TDs
zU%5{~gqL_tmpPn<=AS`%2TRhVs<yuv^07Y}uBAxQVf3u)$9H3fCDJDgSb+js$?daI
z6MrftWZt>Ak9BIU^*4`iXn^oHxogu)V4eGuZfiX^?S0XK#g&=Lxz=Bts%hR^l0$3;
z;m=H(*6TNu^J}Gcrxn4}x}pO{itMLStj3iwEpDNsuucxYg~|ZISHo>X>h3o!)qVb2
zfUa)O)htiqSro+L`L|IEeBqgUx=5JJ&($v%wrG>kwN}Z1zEJ$8-)%0hTyCCYF_ue7
z#{GQlbd%~*vx%9fN=oeS^4`ov6x1luZV&&jG4Vg2O!8)*o*`52CPh)_nt#@K9iZh@
zY8s)WKaOf<zbDVwZa0J$<&u&0ET#^2|LyrJSXJ+$!rvR2c53;LYPeTy!0>~O6L=z<
z&{jIS>^`v~3WbTzh_BsQI&Vu>>iD#3drRQe_Gsl+hrXL}50SYxua~Z34K({*QJJb;
z!oc6N@GlnSo5)^$bEj74ZZ~<>z_tXfiMDOptL*xB_etLWVkI)agGg1eX0|6b95#Qq
zA+BX!KM{_!zSK~uK6AY|YL;7rv_;w~X(c)@%(D11aJiqm1jtPSfjfkFCT~Cze?3{9
zJ1J@)n1(yzg|{E~LQw>{W~#FZ%{5`~7$;S?r6m1+GP^8hT~@p#7i5otm5jHz5`dH{
z%?HP1JhkHI=&vMqN4<@|IU4Cxg!(6cEpu$i?5GaYXLwc$Bo~j;yIY)cO0%5cOE_<~
zgj;ZADCZx7GRiwL{_?%yQ%XLZ5d;}CtU1(&>C?m4!xTN+hX$pp_Rfiif?J^EwZdJP
zMyMz2#ds#GS<Mozw7v5;79wh=&H{n4-li)E<E6w6r}FrTjIMX5=ap{25oCY6K&ETj
zm8RL~>5f}6%{scm<GhZ`%Jjg0`X8}DmgE@UY?fy=J%@@8SAc-Md`EG+F(xg{d5I^c
z;9RN}>?#GcR2@S+`?X{SfM<#-$CuQ)lE`O!r+hrzkqO{gULMOKNIISnDqDcU*2WoY
z=If3{o}y2vNeaS=QD_0_2L8?M6M-Jojd*VsAl)ksDNJ%@vXVZb7xC;ItU6kd33GD@
zPy8*Iq)GM(EZg|DQg?KCW{q`r9nZ_*8Ktf2ct558N0+qT1U%zSpY%a%z#Bff13UB&
zZL#$_8bkqIM~L;_6NVppA_{nKe`+pu1~ID)?>5IP;<}fqBCyf|c!$IjLLu(C`Icpd
z6ia6Q2H8zA8t4SE4*OuFBZk4@2Zc`>nx!rEXOT!ztLkm2YU%B*sni__F4>pW!<^Gw
z`51SO{*z|`M$caLHcWE;0x$p2%bpG2oU2us{;{Ac@&b+`CB?#{0)`37rU?RqEbLnL
z>^-`S3{ieBjc)JE13yg)9WX2&Hd)O1g(j!c@LQN+&C7JyXty6H<Q_GWk<sC~)C@=@
zjAdQ(y`pxwqgP}|W=76OUeWQM^`FqGk8N@<yy2DYk^w*-K2TwBWGZl-@CvmpxY7?6
z{79@O>>-zxv5gsTnTBQVrCAg04JAxI?IgR>PY4df1L<#=nJi<^o3B}vq#%EtIXVb<
z;b=w2Yy63vLHSAH+bi{K1hgZ>3Di((9wEEq>UpzR*v;RhPYcvO3!MZ@yB8pKZ$7sL
zD{C-?t@3}nMLU~*`?$I_vtg<?r{+=Z1p7KV5>aB_=yw6Ut*)!&QtNIJ3ptG#3c0W;
z`dE47|DNq%tk}=ZKN(ZxKmO7O<o!VZi*-==U|XHAKoKjL^4~#Ea=v%Q4+D~u3RgO!
zq+$c3;i<@41U+vNAQd*E7v~<Tb<tQh@BW$j?@F9O=*9#Aza1oV$<|%w4HN+5rytOo
z;m5R4N%a-oa|-PNKYxff{0SbS>or+cZw-KkwVRA(ssc7GPsB3EH)CV2??|13<%nI&
zp!x<DY>>q#xIBTSXuSBnZ-!;14I9G~Nkq+^cuwP;CS8%5yhJ(pEyw(t?3q3Na4Ip%
zLx&;D_1v9&IYYvp!s$B8*Jxv$B5iQCg4NI<s;eLfPmM!s11n>P$kMg!#LlqiD1u|k
z@sNUSxl{YQSvy<=B-#?~6QLoQTbb3q@p75x19{#6u;E6+M4HDD1O+ZirXj^G_pZ}X
z!v}R7hus2w%1$S!B<(i2K5%29n6+3zttA2u6kU>OF8XlkyB<68BJ`F4%9B_XnhR@h
zZ!$_!WWz~7PG!|rOw)OUropt@unG6Q1TyAtX^Y;rOg$Cw^I(W^F}MYoxV;_!{;T=)
zO^V0yXW*H89e~>_?q@S?*Fit7zl3`M8|mi0Z#$Jideo*QHnE<TlK8uO>W8>tl+ZFg
zRq+#PGUV;}s<&WBme83CUrn?1x7%jgZ`&dD<L=k(tKm8pT;w?F;mfEO#nlCE5HqH0
zjh!cMI^LvhMuP6!ai6Q-vrH}R9xfO%nq2>4^7(j9^T4%m#we=M-cZ{$5Irry53bfU
zw_53m{oJQ!31svQY|@6gN%otsl78&g485{Z3HlNMRQnf;h)J^&QAV18H^QfO#J^-Y
z(&c|zmztSS7M^+9(LAmeIV)44%_L8mcX^m*Zu?ier1r8~gxa*_stHgBPuYjTz3hCk
zpLdt@DFCUnFh6sA8v!fSoF(<y_NFw}bCF;GWw3`J)&!gOs8xbCF3l`PA-ynRoRnFI
zpEh@H-#vRAdmCyWT7S1|Hp`0^aQgwUjE$cvQ#gq;6s;KLI~+Ix--vM><(mOy)1<t+
z0iuAS=$_o>G=<Lzxt0V^{PWXVxC?LaB749;pQ#@N-)NhdCa$x&T#!!6f|tkA`##Rh
zZfC+|cs){mQ;<i?qnbD{$}8<ux#Lk_#-BW{ltll*U{1FMIPtSlyV`}CrruJH2H#~d
zYb1c%qf5f_x0=zGN6Sd4x5fc2Cf}>g9eM#`b3TKzF@6?fs&r7<+S%>^56F1#WHYk)
ztz=#9y1oI_KkD_+%}=j)^%yK#R0H^b(j_;KluhfrcbhH{n*lM-dw1+US$k_?5P|1q
zbFH}}M_Wp()l@oK^OG#caD?YihWJYJ$H8@L-8*&*V=(D)ctWt`eZ|VVC9#nneUa>>
zr|UC@TYAeHa^erMM=ut{17+(+&njgAP49)P&yh}AJ%XD_rdHOSOio}#+;UQwQbtLE
zgp~Pbt29hvK^t{2azckFB=+EC3!GuU=i*xqFCx+rsr%%M)T-M?lQ4yS#I0I0`|lX1
z;>n--8Gwe`TKL?gOOLRCMBtU`ML%7e?`@ZI5j41XZR<VxO2{VNNtM9Cl1uXC(tF){
z-cop(2S|{`yD>uzEo(0^wn;U^uTgbp*7Pq{6%pAD*PSJeXiq^)9*T_hfk}lr=>uJY
zm`)aC34??eB3Tmpp(E1qo+9oVC&Nr^BW3$1aK#{5VK9Kjv(f}8n1N`)*`;Mx`PSh>
zx@JgZG_XiplmsjLT&9Qm@ncYKg73}?)81&E)ZLEB0rqW;;U~K|**OO8(b>pCJUnot
z`O{oeh<`d-!m08-?ViXBUiFdV{P}J=O)n4zp=GB<<XN&O+3r$#u&vDqWG^cx8c8(Z
z>|zmFj8*z1>p387@02FGcGd3ePN<wC>GDUu02C8-feq8t@pnf-B=h2z>7|#xP`yz=
zoS#_o(bG{zq9$_p(1?kPypC*(^&w%CrJ0?vzwdwREUk!C=6JNmUmjIj7-e&2OK$>r
zS>WG#_7a4y@};A*yrxNq$Gle|TATjBVV@dy8f9ysAa#w6ANSwTI^q*H-LKRq!(Uy?
zZ!LcL=sO-#rTT5A#QE^^uFGvU3NcOqM}88wZ1zv6YWk83NHh1C635Ucn1*LkJz>Lz
zgTS;nj>OHJlNt+~u}c{FM!IU1$a|F9=4yOG-0CvC*J}CVR}uZP2l}PhPHt<M`f1yA
z1C0{*P?yu|*=YgcEno(qy#e+c&&$0!Xvkq1<;*gdl+X$aAqx^DdY4evzEvX`pNya}
z9<=Y~t$yOw>8y2gsZ~!&_LjY3oUXWVd4nVw+Fc=Tk^98{ncr%gn7Lr(NnMHnQExYH
zt1w9XsE4z=uR-y5$r70j8F3BYDMu6RFzEZ`cT3U~I;@lU^cl}~Hc&0Kw8FUSEB5ju
z5$VtK0$j@UJCQZ{?)roB9tin`0@(7=!s4*tNx?N%5m*?%zdOdKVXO2Kzj=1QS{y_+
z3j!2unAad-xqumDl8gnxeai2K+nc{Zyz_6nTeSINL~S335vqU+xBZXmH<_hoigd2i
z@1N~h(=bJ-NprcRS5`ODV0IE{AJbb*X))<WS>l<R;q9%SqBZ8UGDnk!0p}q;LEZ#o
z4V8M|J=J!-3GmZmy5t*a&fG7l!L{OOhAyP_AKfg)6$^`|u?_a<M+t(YZgv>)sT+Fx
zpXB%AC>`q-UaRaX#nmr1u4^4j2~bZoM0(wSae`%8`tEy=`BgjjbLMz8#@47;qOby)
zP@cjG3PS6h7uEj}lSpfUQZsr6$r`DPz-;#GmZWK@a+HUjruq5{dql$}iQ=@^8&s04
z;B#^ht^>`1a>dh}iPO+GuY>I$HRAiN{(yd$J~tje6G3|gM&BM~<YU9yi|(wVfj{1*
zzIE@+SAc7<zF4*|MdqO{YL9|DV#T&jlKSL51IdFwPVDZ-4fY;M{M6~Bsw*!SR^~LN
zs>%_#IcnA3zB_>?7wS%O9-%}w%L_WIy)fTq1|N6+4@+g>1!>Pqb>){XM&@BJm)4?h
zepbtc8}6Oi-SNofES<{_fkWq7#LA9(=;XQVO1thU`gwo<i}lOK#76zC5gpkPJPkBM
z@y~<OJ@y&!Wz&DVxL`1OpOG$EOq+wx97){X8Sq5wmh8osQ@#=K*wy;TRt`61cS(Ru
z`05+4EOrmy`LCttR1My!a&O9~vrdCv38Pyynh>)T6;ynyDCw_@3b^GYwVL9ueA0W2
zrrhS(uLAYY3T$8!zEECg^R({f9z+dJ{lm3&4a|a`$D{CbM36fH;tnjew%~4{pVyz6
zg4&vV_D+a*qu5R?JvxYEjW@Ar<ILqsgNPwo%(n7sFS9PWEkWoT$WGPK)S5<bp|z>`
zQ$duaz{ZQls@l5{#ZcvqX58@XL)yem?XmcMmhlw_L{YyaUdm1(;Q{dvgs$^4Dw~f&
z9M|7sQH|qmXDXhB>)Ir6QN%sU-FKy7r#j<U&icoM7$xl|zb<(P{Z_J>HS*Kii^4UR
zZN{W>&0jIi!a%{dB7qsIsjy97@GY47EBVt<jRWlJ7JhqviS%kAIi>BYqIR(hM4wuD
z`cb7hoWsi#-^`+g4EUI(u^b02g^wRcAEwgS&ax$qrKEvGb#G1Q0h%l)g2<37<UuXP
zEWaqg{5+k{Lcm7<EA<gM0Okp>diKp`An9Zp@c7c>r==Rd9{Txjz5~QUv5!pLW{nK}
zwxvwtSF(hp8a%x2A?a|FJht2~F())+*5s_JaEUItPLf)}>W^O@hlAxBAoc-<U37F$
zn>&NrLJ(HS66SMqT~n|pvBk<fra7FYHj|>O&HJZ692oMXBGaBSH3GU6t$QP{9Mpvf
zqizf@{L=oxs3comV{bJ%>qx9j{(JB2J)ZNEdU~uTGv2o@n#<!Hz2-Nw<w=en{37sQ
zNNP_}_K_0^s&zt_7<>^*TDZ8hEU;A)x$pRd(Zt%GXH2$9`kTfHQ=Escwq6j#_^~!{
zQEdqt6jB<`)0}q&V0W}d%~$Ott39*`UKB!oEm}YF>~oZ02jC#5@sB>iB39nlLvrXO
zb13yi3aVbkoi{nwWyoMdLFqb$p3h(KLs~LJ8KX%<s#5UjruJ6<tYYY!XY766PkNtj
zRk+l`w7(DNe4cY*9A0*86whQ%*;Q0PvvsCVteEuFN!v?ZZOs0zV$Et^6_k)U&+tAF
z!TI5_1bUHYnlN1~53)it*1!MG_}ye_(l6~w!ZiEF&@kjuU^D2l!^ePOp$X?BE7pcq
zGfsJqqD^qujR78q74431t3=6q15R0!cYD2~pU&$HU2+_>VIqkV`(x+dze&#6{NU#?
zi6d?v%kkUPOQZ%GFNR7&JG>R@Ln;Cmd(<I^0i*47BWElg^Gd^CWlMRRwpGOy$-Rt-
zu3L@oIg-{#_AhE<-hO>$d^|)wr23<InR}9t&Eusn?TWL>fquqi(#30e4wnk{NlY&e
zI+!C;lH{Br@WaPgxU+>_p?A=C^Yu#WEJ-x~H<FB*hSw)_8}2KPE;9no(o8S^zGaj7
zXMbnLGYfw|kf9std?6!|@g-Uv&x&|i%i$47S6qW>9p(1x7UX=q>ZfVMaM6Cfv$@rJ
zwFy?6Yoa99caOp8Z5Nh`Wpe71pEwz)8Q_ZrhZeJG8xQm3AEMd@>Mpgz?)}a~2$g6t
zVRwrEy+|e=6ajfjI$wfgoL`r8o|-k;I&Hert`2b#j9c7*{+JBpf8KD&YNKib=@#n2
zBgs~8j~3IS6?n`Kr*^#<8>acnWQm?=w4d78J)Py`?A5*EucI7Lw{louQxj*))fZ}e
zQo~*uTSpC$(6qGZl0klA4UADJ`$X~G!lP#`p-Ix)%+x+KvdOQLuhzN<y;=r_J-aog
zkl5z6X>mc5(efsUB}ccN3?wxT>bzd1bKjpvc5Qs1V2c8pdOG3+KKodb)!e@5N)Wz=
zqwG`GR3l}gIx~G#oq%2k_s}sN<#(1EF|-@AgTf%Mhp!`QQ0*#Zb3GSOcTpd7ppSy@
ziZ-p$3Z<l&c}P|r`2o4uVcf9IH}jL%lP;A=zwtBDd^vElQD%KUnPwA?YCb=;wJ8g>
zY()+eGLwp2Wo1Q#L<TMHrx@w$Uwhr1pYAuq8J)YKI{v1E3m@`?z!yA+af4n5AZ@7f
zx|Z_sL!aBe+~}A{Gk^iPT+@$CSaVpX!njTg3^>p6nMt-~e}bi>75Aa~3+}9HiHc7R
z&kyr<Epb1lzt81m;=hqbRv^+z`UhD8r22sJp0A5gF5jO{#H|9`X9LqoU@{d)@gcTE
zUWu~SWt}<;+q-IZe})uRjQ_=&OZ|J@Laz`3y2pch?5A3Hp2Jk(v@1$5O0ksWl=q+*
zh?m^>UkwIN(rlCCtJo&QA^dTL2634pKRY4Q?MujmEa)iECkY@f?I|%4&CF4`koNkA
z!_d2huv}2)+F~?^Qtw#)+|5K%YOWQ35R#ix%>5`pcLFoza8uXiFQ%oCDx&_(Uur+c
zR>Zmimtg9rqFK49^ziaN(;LY#YO-TH4hh}1KJ4c6n{7Me`{ebC2XruRJn)0@Fs|5V
z!G81tlU7PRt?YztK`qC{z8ojcup~V3dF_a4r`=p5oOKgQZr`DG6}Cz*zNG&u8T4^a
zinGa;h_i}4440X|f|Fr4$yI(9KA6__{Q5SUE)S6s9VBu@TSOd6j!JKFNjq`a{$|nK
zZDraMldCYWZ%)YatmO+MVpWEQcMR(qobKejofcCUAe+&GO;$DvY1uT4J}l{PH?^_S
zWioFF@=x9veS^$qDQCgM@F)XVVSW$1(;^bi_*}2)r_V;tT==6bWc;T#@Mr1u&+co=
zMpYaS9=I5d+2W!w*pEgUiDF{zz>=RD6m67(wCp^l!opf%E7wzjUW7QP<wMp5EZAPD
z;Y%N5);%(VZldX2W-;US06&os>xEBEOxn_cw_p)5Z=i7ixm@cU6|$VFmACLO8CGiN
zY4zE!SOh#t2(TLh@CVN^d*Kv}CZ~#JVzyvV998CMUwFgJz(TCn*|ipt-9fl4MBb&O
z5pFtynCm3FwzIf3tuP6dQWCZKHoPk7k7XWC`x|=M63gl{^ItBt2P>t6nq3lI`-tw9
zxBA*?`(kdn<)dI_%CB;kkn8&m-nrKt+H_u8gc2<23vMe$T3&>tFZKY}B*r8j7lfT-
zzHj)xI9-X4>@PS<o2wOdGtKLwJ53e7^lV$2IQ?ZYaO#!L&TNfKYR_E^&_$Gvs6(}B
zv*jm3s~iGj-_(5E{wjg-<94MRl4K`r1d(3rJF`fi8YgSgq~-$J=aI5zjD)_;yhCC}
zq`)U%%4qZI@6-{aOvDCfYzacBTAxBj^veRa5mYGeWQkycihlyBqQuX?Qw17OMaYCf
zW7+FI;<xfIL|bQgsqI1Sh|&&56PU-5QZ8(GwmnfTpry$RGk|K1?(eP2-8bN{+=prZ
zAeeOQWZkqZKD7K^Ew9;&GsvG56r>%(#rmELw%K`+-{suqZxE)4Zj!DGq9b{$r4vn>
za<02!$L?_0DAt8bNx0(D=n=<(Rq0Ekg}N5r3es0mFDhE|l%x^)HpF8rb&Yd^WC&>P
z9KDtU>(wXr+UzR2HMDmZVn^ixUFoCv39`>q1C#Cq1ZB4&xf?2{g5`!d8Jyc<<SaFU
z7|{pu+WoRQgfENYn8m`Q!S<;&>BdyrCRfh9@wJ{?P+XZW&lQwc6RsRh#x>#P@{tWm
zX^<iFqW=oT+@JnIJe_Lic_g3seSr908#atU9HWcB$ai~05?GlFAX1rpQQE>?E3VD)
zCJPi+0HGhL2lOo|Lq_lmI{Q#P_$&7IK+Y+@43Vc3z7fn~l@TH~!L^#C>yx9u`Qhl<
z^N%@|CpuSx&<4GVj2^-hnkROo{H>m=8y|8{X^$|(11QnQRQJIMPw&!r{G2Ih+RKKi
zcpV!a8Jwo09*r?)GZND&0`XH{imOEy)wd2^e7u?#q|PbA;&TH>KP=Z7jk!ieo*~BK
z*JLglINSWVNm{fP8e=QhMQFF8w?Y}rEmenhoacz*b*dqF(1x@>0&2?XpL+sjGaELX
zVtmQPjs;XP)2q*as()C2sdpcLM4waKwja#WnFw##{FC2@$Uaytq9#k>gG=x=>=~If
z8*liiP32tcT0imkrlD843vlZpZ9nK36TEeEcrDk%5jK`IFC^<ru)-s&=X9kSWnd!C
z8!AXToDau>(E5b+#~SsfjLe__=BLfVk-t50bv#&t68B+-Ib>t9+&fo|>1$-|gQuvG
z(-_UrkA46$5=C?u3!E5HGhX`Y8<P*~%Vf>`QWP^`v+1a+oLQ(VC9zgX9#P14K`9bY
z7unHil;3`o-Q@gz$3kmn@l)gqjhJIdK2A$Qf#knfVPKc{s?<N9*3_qu4&OQ3OK+1z
zn|0svQIn7Em11qQrI7uL70mX7;H24(1fbynFGYEI&r4c4Pc)Nuw!>xjLoADzYWIIq
zV~8S=|JPS$VgB9b%G;NV&#s0^-R^7tiq?T&qR>=)L4i=0Rqk?l)<AZs{X%>PBC3K>
zyrm$Q-NCDakAXO6gq2@zsY`~l$jm@u8WQCwZNdmBE8y!SP6T-zfvY^+d@+%QByt8x
zKg;?#SDwn&7%i7-OtF_~D8uJIe3Go8!Vwv0#{(cPLAh0dc^8uMQ0c8)AHXWXg=<Yp
zW859rjdGOyt^w9ea<lI4t2f$9Ab}&YX4^G^8~3OQ-jK8wul7Ujunh5l*=pZq%;YDe
z<<{0sp{Dk$#Aho+m8KDT<D-M$Rgq;uS&cVMbN3t;l@k>0x}u&%;16!w9U~|oEx9<M
zYzwmckgxdlVk<(H+P*QAMeGJcx$AEG0q&EV?Qh#__Nvh0t<tz?xa#xeIfW08)V_;m
zgv1FeoBWz|+6nx*SJfavBa$qZ<;HH!NNp`D7Ok6vhN!RxS`gS!X|tYa6kFwP!*pAe
zZV9X(=RK5#->sj2YUy90XtG&sds82Zw0+q~z3lmcDrx{YcS8hyo5w`%%s>Fxu7BWT
z*b=9ySvzrOIW;qSrsXKR8AQ~|rxNnjZ;1G4@z$s58)Jr5L4&5Kb|N%xMa^%J8Eoi3
zK)X)IB*T6nqH}q%&`s2Iup`ORgrLTR){uNT8q2zyGJIid=cw9(KN9y@l^3NAtiF9u
z(1Lf}TbGk~skx+p+LNprKd872!UsY1$cjg6<OTfh+J^8Jq9>h&>tQkQ<3*R6pV{;l
zL88Fcmh-HTt)Bbe0@%tJBURjdQFfB8I5<nIk?kMu-z@Es*6klSCN%Ij5u~<zAP$JI
z+0y8S^ME3vAEX~gnET=#DEru0&L9QU<vp*7aoUkRUg=bNF-GYx-Q`*2OjV#gzScL|
zi6AraLjB2rcVL83^NOHvsP5q5f@lIg?w>xpGmFvtMmb|vALm$Td-ec<T%3Z(RUei*
z+Uwa5NjD!=84k!S-HmlVtC&l51VP5|NF6hdj#T|3glNw+rZTiM<adLdv_HedlPpX&
zpgXO3_;(UU-og^+>u{zSeY?#f98QX8zR4f*>}5HPv=b=RlT9fCX&Koi%K1?#BG!Sc
zLodJ9hmY#v!tZ$twHtGHPr;%l15l^(f4D6JE+=sS3(li6OYI58b<Q-k=FNQdo86+b
z>iDPc(+?!KuN0m7_e=Ue*K*6`f{eVWZHyN7aVzYkiUZ;KWKot#{(!k409hgr=@Cy>
zucdPadOJ(?#{dCSZGnxi8k@WOI>(o)3-{eCb{8fWVRM?sOI|y+FhS0#grIVscim^(
zl5N|(42z%f;j?cAt03l$V^fQZmss7~oaL2X3^?%1LEbMX)LE2r9b_G*TX}{~^}(Tv
z_~)Noh!VD>-N&P5vY7ch|77bvtuR(o=L>7IG#5~2x!od8`{i=U_EVtge#7g%$6ECY
z#)E2<{J+PEHH%bb16DM@;z3U=Gib^wG&jhDrP|3az`nsrDBs(&GB$(hYMxT+%U#zG
zgX)M58JfvY+qO%M`A4X)XJZ<z+2>TzzuNZNW}im~D~EEXF;5_Q%jakvdSO2->|Jqb
z!sS8_<O=VgA>WvLM%3(cI2!kPH<*}0tM)k91>7G+faI|$TF-7#a`WL}Er&+oz7!y0
zVQL(#cCg2w+Ms2#CY|nx%*)Hw*y*_!xS7zMwAxfr_@R~9DyDXb`oSk(++oiDWM*#4
z<lV4G;Yl>s{?t9HyC_5G*Y?sV|4H<OIf~F_R^&a!eI>h3;r_?^_GBt=(CZ8X@5XoQ
zTlr%FiGBZBLNH>j;<+jIxT&d06~$Dfn0R=LWJ`+u(q91O(iDV78vA~b;SVBI=PjF=
zISl-Rpq^_@CTGknr1i1$(D*wqG$3%bv-MC@z3olo`D}LT?Pz*ITdn6?k-HwAhH)|W
zZ`RT*$%W4sKLeih%w!`q*}MEm_o&ZZVJbz1_SrEdK&_6af*$;K?ptfdHzt)^2K!xj
zARK1HI`h3xGir&aLg&HW{-1+Dp1FRj+t~F;CmaR_2|{0ER@D&|T}4Af%NO+cjSt*l
z@KG<D+!a^GEa%Cwj+fbO+-7uFE&hb6eVX5b(EQ<$sz&r746Jg!IPP4mF#hxKDA&`}
z<Qd>t>c~rBacr}m;qi^dS4M7O^$tvt>(n!~oB8?0Lm%*nZEcHct1Vg*n-1Fg9dy$7
zoxAwbR#|<f%0iP0M4t*4T3Y!@>MW%kxAXDZLNG)Q``8VGDvm0B+0-pT{4u*x*I2xs
zvApw_(r9+a&U(s+JVk`)Gbg^Ue-9ei<_FYYg?F<H3$vX)6>96g0hW+iA@c7N+AHS}
z7?jIFOI1yAi%v=ZNDM@4+p*K*V7O^rqqf$$m6^hUa|iE(NgsyUmmnY@RvqsqJ@V81
z1bb3ML&29$fWUd#ht%iNWl`9oy+saTgj2$KIO+W$`{|e2WN6N-_Z)dis`(OA@{Hse
z3q$rWe#VDg<${+S15OhC)N1=4MstPEeqTvb#bPN=f}gAslsPX>Ed_R2`ydaustJJc
zntoYdhg9=+2d%fBm0I)5t`$_*#a(1Iuif*Qn&J=B(|?u4^nn<QlVpwq2Q@YvmWag1
zsxH}?9HhutZqHa|q~MDU?>Y@@RQ&SDSx1p@BuHKC#8i5Zv<F3D${|<o>poBYz!@66
zjXC}$I#S`QG3dr0hx|T&I(xLxWO_jJvZfaH!%H_(OF-Ck@D(*@#*e=uZ#Zex$;NE-
z$z8YJKl@b1=JJ*c=BqdXY5HdIpc$(xxBB{|y^f3eT3Wfkeqp9jLKB(@V#g#BvL3o#
z5c*i-wY?6}$_LStKXG1o?F@zMZPo~yOa4*wV5=rjdpG-i|Ibg$@sdbQ>=C2Bev|Px
zc^oobpO&J<Jd?beoDYZ{d3v8JMPrPjQlp9Y{KIF&5^~?Mb|SlPboGW$i$_Y?REwrQ
z*rax{zEm{)8VnQHe>~0On!%1c4bl0(lMpMR;_;t`>ee&Qe6r5O|G>iHs2aAS`-|mt
zze<WLE70feE_9ykM65B@jY#ceJ}B-5z4ez}6YMjC$lff&H#Uj)zhR_>El-R2)na1^
z*%LH~h&CHa7}CTwX~r+;+vU-9T7bXk3N)tc>M}}0uuPEzU*(zL-@<730(E%t0M5QL
zaU5HA+BRM}@<~0wOxj18RCbj`-s2B(GagL#1%DIwDMFQ*_!Z`nPX$x#^;TJ!b1r%&
z#A38{hnBggAU7d(G{)F~LXzw+5C_NcN*x+s8S2_J+IM|wXFWWlaN*wZPc;^(n>O*e
zWo(mCa+!6$7va<S!8D%J-oIHccCr|$&20cN_4&1odm(X(3Yf48JgdSrSn+^HSY}^7
zvF4HYsgvHhh0gN9g}h_}Q#sNj)%zWpN0$tri>rG2;5m(ty?0)G&NfulRt$@KfOCrf
z;G$1Krq%}5TT&<x&ABNN|0V)?ZIt4Zs)DUH{xN>C$-v}x7I01j_w}7e=4K#EHVMqr
zLgGBjYBrfg+Ga)AtJ6FuT!CGc4|g4%M+J3AA9ksaGZ-?O{mw+jg^%w$H&DctoB{8P
zkZl@aqEjm3?n;VQVGPkCI<Z1X1P$9&i{9cVI*U`O{63(`{5ZSeNqJ@$ZhbguENZ#&
z0D4wP(nZGP?xEq%v#H$6TGf+bI^yuIiS}s;980t6%r20&XqfD|wZw`-8+?dp?0u3W
zX?ZdmzpL-OKX884#zmQ4bP@!b$IIjYnsx5ItEh<SEbq$DJJ#c76s_NhKdMVa4i|cd
z?reMToSq)KHhg93<;21=C&8t^DiM_ooMVk~1*PU$*X8p|7cU5-Fk9fv{sqOZ#=~b!
z-UKU-N8vi-Wf3x<G^^vJGQ#4|^u>BTU&d^mgH*j9Ie7Tdt}#YE6Vh;%t7q$;n)4P0
z%qDjPlQLJNgJi}Y(1$U7fz`^<(5KQRCPri2+weCuEsS|3-);3bCa*YSZqoL@d{}>}
zOVThb_43u!<+qW54(Ja3ulQmIf3@tcwksOp5A3L*7j2$wmw>zh)}OX-ek$=xNSJPk
z@&_aJ;%t`!qnl1`C5!mWBvQUfSW!AO_fWiOwZ(+Rg7T{()iw(CzXADa3rLfmVq*wW
zk`yOJNglJUBnbkv2wgT_i-uHyl(XK%Fs?qW?|qz;ga|tb@h{dDFE{5E7qWw!QLq=3
zzeKb|lEb;V6;j5%@qCH^*~;|-=>*?_ef9Pc^lJiZ3sw7k?3TeR;-5oo6oyOjMh_Sp
zXKl{BCSTz=Dqz@V%(!wOpPqAG9{X|G`Vy_D>%>=LjwQ)*PI!_uJz9BDOGsdL_YW-c
z(lmwrySSd(FLQw}V?1e~xqO6^T3)lU(RzRPPF?#wuWLOVB|(Q{q!*=Hk0w<-c#er1
zcJaSc@=hllTKVLX@Y?Y9gA*U#KP{4Bdyjb80~^*>ughpbzkD?R#kzgxtS|bSuTWW|
zqlC%EpkMYrxF^qRtCSF&7R!qDzn8*`34;Ns6-8NneuhG5{P3aQ;A750PVVh^dVD^^
z{HtdT7jvcs?@J%*!!lia9?b;*v4uPxq>!1}M{9Tb%Iy$v=<*jm@KxD!30WV*`l>c_
z><kEXm1V3&K23e$r^HNBs;#Oj;8Iq3r6Yj_wYbU7&_F+3Rn9;dQDt(zB~X+kcFD&_
zLNlXcDsm!T@=l*gJ8Vt9>`c=uf3KT|Qe^PH0liOvtO9vj2A|VeSl5H8D?YRYw@$2B
ztBduUICr+aPOL?GY#B1Y*@#?28c|Jebah5<O)9qqP>Gmc$=7NAKxZnJ?qw8{?Kgvf
zbn-<~?#ePY-04-9GS!2&CSuu?i^>Jl8LK1BObe(ax1bKMRGREmlaxK#Btt2dJ{NAQ
z*X%$BKs9TiYeuHdg87tXa4a}eRP^O22W^v62yUgWgw=p>^|MJu1zu$(8YdSP6AwQ+
zTJSSR6o9+W+AgW4{wh)fL@Wrk6#R^z;#~R34oAYz@2|nz@Rm;j1005oaxcC3>W6AA
zzK${eEwqRE^^A_6bJco3g(f!~y22Zf;Pudo(QkC7QvyJn^{qjg4n$eC4-Mc&R~Mb%
zNpQoY`9g)`=e!LQ+sh{sTqP!<g_$2@C%E?(dRj6?qYy_K0ZiI5bYnA$%RfdxZ!G$s
zN~1(hI1*J=Ms(F7%cq~={+KS6Ocm`SwnX*<>#ThLgyHYYEWXl{NkQ>bQjEkVU1WSk
zsFb8~rGfS=A-Z0(|5w|2N3-Gndpzo^YEwmxQdN|w6??U)QbcORj;OtA#onr_HX%l0
zs}U;*MXajYtBRsxZ$*t#E#>B(d(Q9N-yip$bN{&iJ?HuRbDqz5KJWJ{_x6J0sg<4?
zT&V`B2_p$2WzBz$8Eg)^`*B4WU61^5Po6@tR8|3$FJ1IiI+4z)mg=dJbeTjgHA9uH
zAA^62kxKIl`7?nJ6zPAqlOwZ3PISQhPpa-_Vh#)`8lkiqmS5!TJficlP#J&im$dft
zdJ*?H=yD~l0Ph6V&A-kT0OTL`x`G%{lMO5TZOIB`1>|v-YIaTtvN|^En^%Co>6R<N
zHb`~K^~tFu2DHmD|8?D=H_S2--|+s|6FT&JFFIg2@ffcub)%%mrJIi|fin%S37QIu
zQ_ynS{`5RiF7N)akaHAmH*fcevl!~*Xv*Qy8fzsF>N1Gm^gEE|t+LwcQIPLhdrtGc
zB_azJED&%z;9HONpw-x?nD*b<zuO392ZZL$#O0bf1N!I=*AdrgUUXI!A~9*Fc{Br-
zM-X`RHDPlrBgwBh!pDF9X`)r{vhx?HUxf5#2ML7mizfTXALr`o%hIlIFzAGDHT-}u
z1?kzPbZF9!nw<nBYCLH|>|T$c*Osal3rzhs=OJC{fjXFIQahqr_n8qA<dlp4d?a&U
zp!5zQOO}cW6vHCKA8hR<!!{1nRXy_i(sr;^j!@mwXZjH&)QKi!l}mT^qgvSW)y!j>
z-w=8C$H<ePOx!yCvB6?EMR@Q7V@3A3P3k5%!VIr#kGzl}la{c^_rK{cuvS5=@{xoa
z&yASyDGIPDF99;D;-l(gh+C$rzr#+gT#5{p*1N6fsN&)VD(DSXX3iQbZD(-~hnC*;
zGG8?K`AJ41H>(;V0Bd1<HG|L0+jWoru+_2roV?Asgc_y5bDF|+t8Z8p({*jtRtOjv
zY7pH^#^iI3KOy}ez<y`w1_tl=PL-v+eklGgV}zRljqIPqTei_|n@z17bbXV8j2SLN
znQ&qJ_U7Pe%0{lLxjdp)z6_*gmBx7*in2eswKv4q82p%c`C>Z%k@7|Bz4F4WiAnJW
zX6pbrYC5yVL(D^2@1jRiruS2zDEW&D@26B0$%R^-QhI|w)JMSZii7XbZjguG#<C8d
zU2wK^T>^tUp?V6c>5N#f;V%U1P`p$Og;^^&=Y}#A6+ciBlyH!>5Iizhu0B9FEbCr)
zj|ZufM4{ql&Ncs*u&v<T#+4+X!)e8(<w+Ppz@8bHPZW^)Hb(}GNOGCiT-zAG@YZpY
z+#v|A(TV3VWE{NjYNf1((v^=4*32^VnK+e<SS5zV6fPN0!2BpM<{J_ZX9oj3g|Y0Z
zzqr|4n5QP!aid+H{^YNo?Ad1=mT16p{6LC^#g+j-g-}t!z~b~=n#2iRSNZpoLKBJ)
z)fp^AYFCG`j-HcpQJ*WTW`6!5!$Ju~tUrJ%uA{L7%102WHK|rhwN-PR$XpOi^k*GM
z2y3)fn(<{%dYd^H)0@yRl^d^ltW!N$|L4_2`BI*16#9m$A=dewY^ahRX}xOEt{TkB
zOdI$vdUvZ22^lUEK-J<w$tfFk6>C0Kh#cQ@V0o!l?Z-!SQ`RK>fU}N5V##jy>-IWK
zlj6&T-zYo%Y%30B$o<`_YdH-x04cBpN{A$c3?J9177K79VgyAi5$1PFW3r5m>f{}1
zJ?vROn5GxXgU^6>I5Crm=l7OfP5UJ4R*j=J81F{UPjI>g(mZgX&I(Z6N82<l?<w>i
zDcovEPt$A_m2ZNUPh0xJ?gO65kjH{0HY#TE?bJeB^ZYsIjrj%*6)t8{iLT}}s)tNi
zeWWUvd*BRBY1SYPVSY$!eH|Z+(56Jd5b;FIy@3{k($|wlk}CgvCqaJWT;zqp9|lK7
z9~I$mx%s5m^)S{2*Fcy(E~+EQ9|KJ3X~t|NH>>;U6P&nPu|hUX{r6v<9U7SoZm7=o
zT|84PE?9wrGwXf#DW#uGfsr<+uU05x0M{n5Hl82(5+qvbg{8&pydqXHFwWu9+F>Ab
zpRgkJ?K`|@Z};n>FuC0)OC5!~)3xch+3lg=ibJw;RCg=;rRtyDkPH&}DgM-dM%R`p
zb_#0dR1{h-^Blo6CdObPW(K+B(g$4u3}H&0e`Vf;?zb1Qj7Nia{V2dT5Ae+)23ni&
zFQ<RR6!&2FeQp=ig73-Ow%l<KFZ%VpC)j~_a!7K5A7K5BO1c6ZE%uQjfrclbO9#Sy
zuCJ_;Mt5WBu)o|;%YAEf^*K&-2*<xZ-2sl(ltX0#qUxN9+!|Ufa6@qJd{xl1mzo<q
z1no79=^_%{l<){*mTsS>KjK&8`Pi1!ous6RYn$r43^UQGSDR*4VhpOp2KFSk1dt<&
z!o>L!q&&4Jq-$~<I!U|sHjg9>rgE_9yG9oNoD{+dsqqf2$rKhY9OKrD6)sj_iAX}O
zcC^J6fIM^%w}9!d*vLgT$gI&2F+i*hlVS%mTXTI4NN;QyB3TM2BmL_Ev2pe?&eWwU
z)BmXsg(5V$0^_@mR#M^|Cx;vo>YBprnHf{-jkpq6t>=4SEK;5{k=ew-wk?JGe|N#p
zzXdsDmj>3-%><@PYWN~$WZC4l?NHo27Re@(8A!>^PMr%8kDCyU%Gl+xxDGU`dT+<x
zRo#4iB~VZ`TrA`JcE{L~mvvUK4Lj`l0qqxh!IUjI(HulgxFFovoo<(&>h&AtgW&bY
z3)+!hVTm)L5a{*?Iwt^tlv-%YVek4f=0acdQWyMdX7*nPqe%n9De?LM^npfVZ>O|3
z<IjVD9+512ujC%)^YP}R^{o`2x<MlDAF%=(xtA(}fH==3vR2Cp8&(fe3O~4b?U?tU
z9v7Xnp5Iqmmv>e-v#$V-vCg}tM8<&9?u=@Wx)YIBtb<*5NX>rh>A6Tuk2Gjlnu#E9
zQAlb|TiVY3Hfw@T^bChe)wggmo^^nvN(tOUPrg^7IC>{O8+^4*9NNos>*rR94sXBd
z-nZ(scJ}QG=n-p*#R|}%E>OFGKxI?zuqVTp|EpqLvT={Wxz$qi<{eC_wH=O6;&Z%H
zxf|+saH}vz;bt&0vfy~F5y*x*k^1|^qEc@aiJ-08vzAc06ba%kM#CGGS$%!P7+&g9
z0_U2q51c|O$CZfuYl+AJwAhHlxUK4GQYB#zKlfw6`PGePSt?h9TgbP$w*G}iXtQr2
zY)3%tEdsjJfR^Db%RDF^`0X>Lba0hM9Cqa4k+HFda1KEDZU!dGUe<->Nww?kW<3s3
za|kl>6Yup;O5BBN-;->uM3$)0%?&o<aDRp;^D-cEJ(HWNTlG8|r4AVS3U*ps{qG}2
zy_5Lt#q7R*Z=(?e6M5OZ5N!)4eV_Sx8v5dzb9}*D4eky;LR~jVYvb0;*4o6!eUm4t
zZ={;r3yZyd45m^uU@t1l3Ez=}(^|WwD}Nq1fGx%Qh`i&C^VBe0oeAarZ82f{geEJl
zsryAmWetADd0T%fqG}qeLQU%3-mGmQu~nd)g4vuF?BMy6)$zO9E-OP7byPo?`6zp^
zmISNt6?l<z^nQK;lEYZR47TW(2(X+r1k+Twu+zwTHDwy@1DScNcE5e*xcynh7_6&i
zY1XGzOkSCpUx_+0>fa=+VNj(u^fK<7uNFSEC*{?&qog0YKLso^ZFbA<R*5+3pR?=B
zu+W8CCPm|04_3(y=A0lvoO;w1Af~px>m*e<m7d-|a3M$8q`j<!F#^t4l6I^Zld^=f
zNF6-65YyDqiJ6eeLta;>@pGk!$tQ*X>xYu0nu9I+bj6UKpFG~u`~`s1IixRnAh<-s
zo<%tngxx7}OI7p?@a2jdv;12s+XuI5JgifE{ZYOBOfYZBwpoFtBsrJ|8pAfGi7raF
z++MZbkxMGxs<p|v;jI*DTQYcbGLpA&1xUtD9{g0Dww7J?!4nnLUJ{~QR>U<IDG4%0
z115}q?;`wUEaykXw~9r)hDA;naf}sl#{EN$AASSLTIz3Cr;phW>AmPizc}Gf0MHB!
zA&ZJ?pD4<mgsbR0Qp7t9y9ZQcXgS5Se`?+dtYMXNQ;QOoQ`}%_iHhzb2mt#pO<<Gm
z)LGuCs46x@#2x5YH)HBG<a-j4eES#F$VU9rNAHdGFd%g?Q^?Ux*!vOpE*CIjXL-9M
zRQ-gA0kB*i({ZWE{95cKUVO>&6&194siDfRs^HMCqgm4xBn+{Z7_8*LIzK?`70~W;
zM?orx8`D5yG6)J)*6J5qkfHV9nGec$JaCCK9dZ^5-Dv+i%MC7yD$f6PZL^GJTRhqN
zU{}U?L}>y#JddBP=8pPhRhVF>>&oY9+8ckp!4yD%B>&kA^H`<)=hXG0qj3i13u#|r
zaCG2eN2SVof2I5Tti>ww2JHSA)5p306;e;-f~M9U`}>48CDQGatB3N$12xN^y_vHK
z3YxGY(-?tAzX)Ubvx9_yfs#}d>oi}I`kE|{{m%2cFclAyxqomz4h@OpkWXMCN$T&;
z*N~Z9=Y1yf`ZOE%;gQBqmtB>#n-Se6<oq5qi58@_>_PA)_s4DGmKS9`AN~%b7k3kn
z{pf|+_P3Cub6(&c>x&Ps^5prGM#+XfXLhLl@@L|-1Beta^}X5~$vS~ym6F!GvIoNb
zZVAn-XEE0lM0|VJCz8|haM9PZNvfictwk4@jNb^F%zsRGq0BZAzf{`d?0LZ-%;K5S
zv&oG6z=vmgrk}j;D8<!Nx7<~phIOXz7XFZcg2dja;w`ZRLKcyPiry6?jZM-^Mcd{l
ze9q!m@Noa8om<A;ITQmjWR7Fc?fuYFZpG57IsRk=C&IZ;R|b3C#Ak`JlR^$Rx%V%S
zA4*r;pPndIVq;}Q9Tv1de{FiP(@b6JtirTYnzdH%=!c<0xur<=%DVXx5~mE^s0lC9
z80m+*ZHHdf=;|qWrAzF4E+P{QH(th0icARDJX?8J87M6vEphO)_xBDepSdzU>5IYg
z2SzEVe4?TgR8pcl`T{kRZ{B9oFH5Hqr_SU#AN9EiLs^Bb+dUWHi36)(s^i?QWpFAu
zDmZ#8$gY*tIZ9(F>`)8?Tnxc2QZSglNaCGrcD>O_(l?Vd%B>`M9*h3UEw2$3UNPVw
zAXFU+wLF5+*ROxJ;@qggpFAzR0z_>XWEu}2eTNxZ*Wd$vDg<X(d<j@}b$vL{x-9lc
zDHlCAgD^4ZeM7E;O2P(A&3_H_60UNNo{1t?MdWl@QyR2~^5A_#({8Kt+CC<iXlW{%
zE<E)^BC(C$^xq1LMuMZGLSm#l0^iq7hx8v`jt1Y~cmtijHhsr@f$yAzutM$Ki%sce
z=TtYBqmUA<w~gNU{BQK6W7EyLbh#R5?4FK+Z>y$PU-@6nsURaEyN>BRoUHBYiJTtq
zEAWi*$0zQ}0~VFfj{n}WB*)lD!QmMXHWSB(IPDVW8dsM7hzR3sYY8!InsbI}9|gC=
z1<8L}2Azc`!}~6EPbNcVOD4Y%nbQx!9d)xJ<BoR*PguCShSE=2h65kbre-8(3GUVl
zho<ymBL{T9MacE=`CS1jdb~S%;C;pU`Kz5(76rE^#4TN(NrEUV+xPsXq(TPjz48Wv
z)dlj_Z^7(x%l3S7d@n4H4j-ABKvf!3T+y2;RvC{DelerE7hJJf3-Ta^h1V1~jmtaB
z;wgUy94kGEY<7<Qt|#XCY|t^>kz8KBqTfRxk)wYPVNEt!Z7xE|{pqPw?SSdT;iMv-
z2L>qs?)aF(u5--k>vvQ1#M%M`hxZL#-<>&rADjNI42R?zgugKuJrsBt=k-<Cc*f#y
z->FqG!>J-!w|cOMiafW9eCy_#4|k+{p>IzAa`4W14S)jx07wBmVQMV@2MYHCom+^f
zwiz=0-K|!l3`J;0JEL=ns7WFrHnln4>Yi;=u@;R$@l1eb5VFQ~t_!p;w(-dR`*VCC
z3cF}H74off_7D0ooFDY<ddX_rVm?K-W9{XO6S(DFCL2*URIhTn>#@;`YFfYjD2M#h
zqocV2@9(Q)5KSJX4uyczHXaq78ZNbjU9^y{$`9UjcVg+X_5<KKh;Pf~AN9Yg%=O6@
zqJglzc<c0rS-ELSnrKWg<8u8Aq`fRB%dOSNBf&J4AQl}GElxpH!HRsNFg{o2`Qv$g
zZzGb_%JAAUdn8R|u@Czcqj7Df+J>C>wH^WfFgK)B-NoC+uP3o2r)>!F^{WZ8%v3h8
z+3kh{F!Vu^Kqj|R4Em>(oSRXE{QU25iRHEG66BjCl|gkbzK~I0+@>$pVU;j&J@*UK
zM~U#7A;s!vZ}#zZv|5j8pQqTbgo~YMO$Mv=&8PJ6afC^#dLHpiL0PCO-Gf}-mTXYr
zW3qH%mu!2M;DHt;?Uc--dR>(o<t48xfP1H1L*!vpz#=9}-B%d^&CyrkqlGHR`k9!o
z<)%j+(?kUyLaaOb2B5%7FB$oLLGiMrjm7<@*`UDo^f%>{k_jImJ?ykinDC;n@Lm~+
z@A5mpLNhQ}-%R`snr(>p%v7{JSFl!>h2o^q{*b(wk5zCue>{kwz+tJvM0cMyHU}+x
ztQ2aZ7p556{OkDH_L?~EMc!`xiuXF_sl=U7*m=k_?p<L?K}>x~WGX1_>7`@b3z~)v
z2;>oLp`BFS*Z*sD^8axd`&8?q1de&1K=trl^?3KM6D#|Ue&e`eHdh{N>6<^V03MIZ
zpnEC!fXum&i(JHtQd>uFuel<}w)x{pra~1=sDb1;=<Q=ER|n4dB#w~X_Ig&2z7dy@
z`M%N8cj%mNPIgJ>j?QdG8Qk>Tg`p4aC&vxKv%WC+z8M|M^0S4>Rrww|esAKDo$E=a
zH4~%+t^b8q6@DspcXA%;`N^Ba8+ubXz`E0x)@v~&k$ktxI0U{Ie|!bt+gw}=`=VT2
zpY-5cP(&D^MscPstl(0VPp>x*65NqN7D`29xVj#H><?FQJagDgn7Z8*u+K?%S+ZE<
z$8#`E<A67Ywp{^)Ts3EKPSLn`j+c6!I9bZtW-gTnWtlqu8~)pNU8kB9lu|yp*j2|q
zP!|uhIXVn~mLJwxwN<OF_0tQfda?hv3Y`>(Rw}7|O5?}h#5ZO2I%i<3{Ur3?AMpRC
Q*8ewS;s5!b=W6yp0IAjW_5c6?

literal 0
HcmV?d00001

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.050000-0.000000.jpg b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.050000-0.000000.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..4ff6410b764337e731bcdf61d6f17da288a4798e
GIT binary patch
literal 49763
zcmbq)cTkg0+b(tm6=~8$l%CL}NrzXEK!OAbA#@Nhlpwu>z)z)DNeGb;KuQQ96lu~y
zsnS~j=>mcfklv*nzwgYP`DV_0=6q+)KL6}9yL0b7&$HKk?cRIs`S<f5bax;iFo^EL
zg$r~#e;>N@Njgos>sPN{yL#pNwQJXI+_+AEll9h328NrQ%q)zoJY2l@dARP~dmtbo
z{D4o4|K2?jd4Sj>DOp)rUSUO51!)xt8CmK7FmmC>jT<)^ZgSkZ#UcIh-b3mC=W_mq
zj_LYk`HR_?F7VM^WV&#P>B4y{-90+Gi<ka-dx7qMl}i^cUcPem+V#J!&+gD&{QGw4
z%9X2^FJHNI@$xmg3l}djU1okLb>)e{RTe%Q4{41zNm;D?u+p!C*JNxx+1}1=3TPUl
z%kE}33);!bc?~^=d%wfXZ~e8#`5)u_E&ppIy8p0t`O4oWey0CyxcEPP`Oh8~m@Yn)
zy2Q-##NaZYv<>Whg6`&}3x6HI#6+h~_vi4x82K;N3)%>#6!YnsQON$@vT;43$Psz=
ztKd*_io;181~hdG@HU&=2RP|Yq=gs^hMd#E1|h&futXHTnsrg+F}YF#0-eQvg%s_P
zF4yPHE<>nk#hTBame)9m<WE}49VL732oPbeQ#<C{rG6nV#XBic-cEhvA4x6*>^YsZ
z9pq7?PP_a}SKFYVo_)&wjP*F)qvuwGUG-8c>~7zN4BAu&+Hl8^Fy02kbGmKa17We8
zyW~EzJ-<*`9~!kan7pMm9#Lkk6A#v~QbOY}y1P#cD$R$ye-HDYex1-Y+7Vf)*tjeE
zEs$)`*TvM`yEL{fR-n?W<OL3zFy8@yEHco`9c-~{l~%XGW`4mog2&9OFvD*&P5HT=
zV$<Yg*2?jBH!tz}ad~0DAU)J*{K*qVkfI&Tx$hv<{2e!4?<^d8@XnH}Jd}4=tkiqB
zVuMk>s{i1VbjD?n2LYZXDAIuUdm8p%KKTDn^(m1<s|(tB!-vOwd@&L;ayGkRLlH^^
zmd1L3yL6L{|7Z!&psVAFyX$8vO*0?yW?BLfe5fUMjzvp`T=1>;BWTNu-B~8xu*Il|
zH+(u51u8^s|Gb~q0RDWhRVA*2uS|6mhcpqtea?-g81j`(W3j_#ACuuJ*^a6&8~I8(
z+Ac5XtsX{?8D`2A2Q*lO*$PT*wVMf+W`{fWDLNnp`^mlJ_+D|J_o=o5Cke(&nfZJA
zJ3hf<o>06QHL@*xi_GmTxa!qIP2Y7rbwzr5FFLP$%S=0`i?`lB+~0po11xU3dbr=S
z9IjOQ-Ng;?()N{!n<w5SSoQJ*(0o=FHx^bGYAlXp^d4u%vyn{owR3B^3x?yc`$@g&
zsy>71GA5(nhXN$2xmjJUHd~SqA9-`Nydr^GbQ?Ayg;)I5K-qBK%)255Eh2!j(;M2i
z5LBn!_Pxw+kn$)OxD#Hokf<syIi5&Du-W;8mEA@Hi=RRWFZuj~bfsNX%l}R_voAfr
zgehc&P!!@Mwkvn0Vv4J(?C2zPAmZNDK>u396tMh_nb8#7uI%OipC3(k)oc$wnb#1W
zn`!;fRSXXmY6?>2S?O@21qZ9oYE%bQ!un@~cBf90C%HL52i<IL{ONU;<wD#+>~R?L
zX!pi8a$ZT6Pnr<7Cnqm6;`ul86yqnU;_swvjsCe#EzG@M&cMoS9Q*W%Y^9jiKbLK}
z;?sOV?=Y<%oWG{E4(*!A8MVi~ZVL;)-E~<qrSo>jk5W<cJw@y(zClt71SHTUcSkKr
zrNJj~$7)@Xa2V4ibkC2aWs@e6$45jD3R2v%GI`sS@hlWr@U+72^wE7ro<vHkhez^>
z?C@p_={S{8JB#5TQycwZ-sBa1PWM^8x;DLN?#PE2ZK)!4+W$}~+KI>7fEfziFtkR5
ziU;Bwh!m^G&25H>^C@NLbeh^%ej{YUY;i$~W6jjifE&sc$0afy!^vb_*$_*;u0qsM
z?O@Shap=;a*T&hB@x*5J1jmW2ltN$u5l|%1Bq^ljxEk{8$l>Bbbp}IpKX@re_#ioB
z$U0|74b$S^$QU=+$dzsAZ00qjd!YK-PqbyWBY;w!5bm&b?^8N*S5%B2N;5m={@!l*
z(E9Q6XYZq!cmU|2^c7~Nh3|JnJ9x$2(<*x|XX~c@D_N5BvXFbS6)KctPmURF5gqTG
z35&(f%GV-o%szAGrjPx=)E;^($vr6YQiVVaP~G!dThNyIm3cPof`MqYuFs#WUtF?O
zhm;&A@l1s#A#XVCWo*1or&n@LQ&%gs{+y1Bu0tg-ZwBRRVDV%9%#2H99$@<rpG?K!
z_=qVSbpMq<{=2hM9_d%goNQYngr<!r_)MFQ`#bGA8`E?>URF$C9YjuNVlkf!`?*-U
zUDzo+T;y(vMMBX)@AisHpgo)*nmfJQ&<ikSP2Q;LiR#kr={9x>n_{kctTTK;G{xYu
z4g||;QXqzs`PT(@OGxxZnT{>VRL+HwOLs5UEQ~N^sA??oN7<&ZT&D#Mp~HgB6+8*4
zs^r#6F}3@WMhA)8*7+p4X+SY*d2TzPM7wRC#mc3yYESVHPu-+Cm=z}5u=(~DJzn>$
z&bu{_yt=gAVRW~m$uL9Nxo5%I*1zF(uab#>(`D;lG}ccQ`G2J9n^>l%V{^oKZj4e~
z*Oe<v26pxiPuNE2r7^3jOkTl4oxevqd7B$GL`R$F&gs&XJc4;jwpI2*00|}Dv}&#G
zh)kM|2gWZ5Pml>ZQ}$1g3r|RPKV4WAKr5PL0HVliKZ%Rb$H!@#mbiu2TGqE(oV(Ox
zbOo&25!yivCld2UhUCN!n@^u0XWYHSzCV&=&!;n#Z$tBkUFLl<)+4;%H#Q~2TRjx=
z3ngwFIu#Cu6>%I_RrM@~M*6acD*_Me9at&s4qRrMKSpq8OU`qa#JTT%55;aXUQrR^
zV)|19f%I8NJ}o>$+V!tD#(t6dP5^PaxAv=$D~b<}c9ek-?X<N&l@=Pb>~lJq`qUbe
z`b<w(TS}{l%`RaWr$g(>Jbrg`BPCt;Xq@X0D5UsH91?8s6+vOJ4>LDbEJ-NwW8BF+
z<~U5eN0H!(Hpsbh;2HS&h~1Fq^;NZ$#|baDdxM@YJNMOQihtdY<h+R#1SPY9!CG!b
zGaZAQUgYRl!jGKWdR`L!lk%Ah=6Da(a`BwlC*$FfRGP7_gO}=Sw0!^F5;KB8Rrwuq
zb@v2R(wmRyBwxdDXY`oh*0rl2v7ifn<%#mEe)g)s&@;|0s3Yg6H=ARl?;Z;xn>;t8
z{^2B6O?-3t`8*Rkrl2S|@AKjAIb9I9ouCL=D-U1moVvJ(DCX*tlv4w5^SqmfvI$NX
zRi+E=hB(fu3lv+PuxCmwf3f5mXobZ?T(?5?A4Y2bcaiiz`@xE|Ah-3cz&^nYkF(QU
z1S(y&r5$`oGrBq@NHuGkE<z8M>kO|TWY5Zu&ZJ)+hU#_Fj=0K;&0_Sl%y?xa%9~-&
zM^+`mKThTNQFZMAe;BDTF8^fL1>Q0kS`*Z0*p&c`h6PL?G5C<=kt8%1vgo!)WW~3Q
z`BSV1eK^>Sl)pTe!-Et$mAwz^d*Orp8Py9jE9@V5ZFi+p5@s<pX$X^P`lb=Cy?)Z|
z2dm;6`pe2^7kiE>*t^nOkF$+9O9I%9EoOVlaIghsI6PB+TU^xeofFD}XrkEs&0!Pg
zhKrjYU)=(hVanpOacC{~?@`n+r>a74D?5MMx(DXx62=<0?CG?^qbL)fuw8fSdI?Wd
z%e>bF8*eOzCSA69^6dLmvE*ISIo<Fo#S+=nNx0AU{k8RdHzr7~`*-K@J`XpUUsx|y
zq6({20i4#pi?67xJW1FSd*)~uF9M5KatDJRnF;=kmEh3}h-2LBemA$>&2G*Vi#BUN
zo#OrKyr(L3?agK}x5K+HHY;GK^e2j;Q+u*vPaQTU$22B7t!134wV7r=w_FDXzCz%S
zsG@eIPLtIwTAid*Jtv-{4CN^IjB(#QM4LtiBmMM(hLLo~Ja#gqNppGN?b|Z2VCQ}9
z3Z8<`uXt}})In=ca{ipuqS@yCOYA>Q30bxtMovhvS1ds8#;KHB8*fS-xD&w|1i0;I
zoe|3!CvVO-a~~Q-qZ7Dqfcso%M_N8^XeFIR=Yf6A3L{4&vL@60{ecSMV88J_)u)H)
z7Di)1$V0oVmNsA8dzT^%TAMv7QAW%~s@P0{+K@$zp3vvOESuu2j0#U`lW=~NG5HqJ
zXE3?V1L&T;C{iV|9hD@mCY|j2s=L*{k(VL7fC7FzKWakTS2)ZNwrUs(o>I~}BVDbd
zBos~Ctn^XJyRU0?HocXLTXk?aY@{c#=O|UIE|LPO+kqRz%2m7ZvEM1`OoE!1G!ky3
zt$Q*Pz&<OR<!Wx@6OY4D{b>f)X{U_(;d*3f-=qahIdeXlJ*M&TXCcarm%hGMnN`?1
z9ZkW&>c)sOvE+zgmW&y3>>1W`%j(GA=r`GQuB<3=np+w(Lhj0GCcsMW4Wz(Niv8P*
zJ4rBaB>wg+Ikvmv_uAPAech;jXK7M$PT|Y39F;y^cKXq{dYP3@{QM%Xy<VV<!tD5r
zKN-YW-z_p}zU(=phHh2VfaML>zZ}dULNKKHG_<~b&rXEnN{x+cgYb<7Mh2MS5IpVA
zH*M<}RaagXZ8oq`j+{axArUPG-!!T2l}AH{v_r!eXmbS<SWrd%>%rw;C5*hC9hr<D
z-$X`w0R4|$g5<L6pPw2hRWJYeZ-<Nvb)pUb{Mr)J_XElzb^<c$Q)aEd6)Dt5cOI7u
z>e_C(F^P@`sm0p#xtcfJtku8MNi`R*W#Y7?7fRnT^%693obcFO&C&(o>nnpV$|NsV
zj%kY9t{0dYnr5c7Nh8ROGxlL<Vfm-<**W(X!QaY956K{gr%7OFH$uqJbJq4%g!%8R
zQHx3-t@DT>kFd|fC7O}#BDMsW$1Jsj(h`a$zuAIC`Cg^ga5Ml5!HP_Z28OmobKMUe
ztX&5lmrJ4hlMgn`w<V{wDf~5w2z}A|>M5@Xm0&?D+|Ei-6Y~l!Ku4$;U;gZv*BjSh
z7v6R#K!KXX-M8BM;~oeID3N(ACl-*SrD6dOsvXwNO^v86f#i_Pq{C9SP|aMm_EJN}
z<gEBFAbNt7x7%Q^&^Qso#x^I?=>z>0k<2gWB+#nM;1KBPR2033@;(?sF?nJPbbZJB
zT0Pc;xM+k$MDW9^o^2L#RD2G?E16wbXo!!fGn7qJg_#A!sr6boS8_~QSTTzm=196q
zO&7-#94kgfTOO$hM{S|v=iDoS)2qs6qVv0|e)MO&ebVtz!RQ1lZ^xZ&&&AE7w4}b>
z9Rg$d_eRwi*BiqvT8FD($9fzhSTn-CQ20i(*kfjNT=0r2Qh21?o|i%MmIkYcA$;YD
znN&h2V<$^)La2je?2EJU<}Fs{y5#%TMg_+?%{C~#AJj5Mk@_m_LH`tqd+L{9b>L3X
zCq6j-7WeLUtZ}fVDOa!V@J(7@P@P0nf0Xs+j&kKES&tiCyngE9joOmzZ%d%e5!#~5
z1fORg@EI4ry4UOV`Je6CU<@FHqST!x<v?Doxf7WSEsj6G*pLn0nN^D;X$PS!{XZVX
zUVBS?V%}WooVL`L$H=j{-6`(W^s&_jcVmtq6VrcAN1FQ`jUnHFu$yMkCWZUwebNJE
zNYm7uduhlr=by^l?{Zq*8>S{JcR(J2q>+0QaN2WxRtzpWNM=#)4|?@ELEoX;UV1%#
zS^xO)k@~=og*xFlqMxo1AMbE(<Fmb9Qzv4qM!6aI1nQ^mT7FKKh#UI~Z|Q9&DmLr-
zcbcY73sR38P~IM_+r~ut_bY;4(Q#|V*O&rqegT<Rerx~SJ5Ft1^k>)Y8HsE&B02Ud
zcF+=tR(-b1T~Jz)LK7;b>B;jPdNa`Dkf79}7MNiUN!G!P3s9%5`k|&nY(gg9Ijxm^
zXd^e;p&g;!^wp5eeo&DXd#V;G8P}(Kb;=ydtp6lEt*xN1QaE=ARyA}^moyeBiEfZ&
zoY%h;PeKH0sZ^?0Zfwu~2x=WRHp^K$j5e1*2CWC)@AK#xjAU%n?cfF_pVKk_%uF3s
z@R9Ex{^x?pe=l6v%^NA#bH}gI<gOf_vOK=`Dn!t@Ad5ZFJy5MA-{cu87yYS2RaT~`
zS0M=CkKL$B!cUp8l2on3Z}xJTJ+a&qf_nMJlyPg{&Y4ds?EieCF$XbHF&qrBo6q67
z`v#VsSR%kL<0cb`8T_5~4NhAebcGpN7FN*=v^vL8?S*eTt0>&i*p#wCZ%HURp#&kl
z&tZP@%!S+Bc0Am{(p59<r=`OxX-OyHSc=xF=p*W}ub-pY>YYfXl&A{;9$|i3lJ{bj
zhMOvQPW9V%?_M%~*yNO7`#Q#`-RP~J$Vp6Weu-W@ImtM_@QAo6lx{Y{vnZeZ^uaGt
z$><_MHe@N6C|g8UJPE@B*7FRKTke-j{K59=AcLotS{u|o*Z(81Oib(bS;jRsqr*pg
z$Y0p+<GTOY6`0G(F|LP}{$3~$6iu=Msiq~rScDllAlHUT6zPsP3qgBIDnJR*aii_-
z`C;GV`}<PeywaUqNom8q&x7;Aqz^d!iP`!R87cM?&J}(mo9A>p_NTX72{zoF;{hLN
z3q&5ka8uf8JSdo==aEK2_+PGBj60|E9BM-lf6t33dWSzgr#s>(m<NvRFZ~{VDK=GT
ztX}cqXq2KMj?Be4_ny<$-Rt4*=8Bhd5ItpI^H!J^I}|i<yAgapv$W^SIh{mEUXJ)6
z1v|Co9tdpYZ$NFnJtoN1d<Br_fJ;_qi9h1)%V@@5G(v!gxLQxe5hrMJS)aHJd``)A
z%=hO&%$ARnY+CII%7I<)>jKY>m+8~;yGlk*u-2h&0U{>~e=@kl=2YyrC;!49LzIJN
z|M`6Ov~856%@m0(tF5R3yGG3#l@4v#4Pr4QaSO}i53BLszv^GaO}!q|_zlXn46{2-
zV7!93L*cAH7!faWIYR;#+(%MSGEF&(Golsid>HS7@wHuKslv_2qDK`N+`O53s%a-w
zZ%@`B#nE&<&dzrOca3FyrG2{v-qUn*H&iAuF30@l*)btYywW@)Eo!SkL3EgesywHo
z57ZvpS7{VwH)c~rw89&3@<_I0mRlaxMBJ?sz$@(J;Rog06x-@P>7uhGSypR|=jJJE
zg2Vj<MqZ<V9HCDGp$CnPk;F9>r-3=cz=Fy=+T)`R<dOBf_q-j>&+<g?2H4!bF^}C}
z*F3K=5=BGxbX(udZ89wKO0@i<fIGz9j9c0;OHNnHpg3&l$>jS>^e*6TE*NH6nL63R
z;*adDx=+SBz8z%Y>F6H(-%)*u_fBiAELPz$NzG|3L19WSw8GZGK%HSoE%tPFUV_O-
zD2HcU6vnB6A&Wn@=-pk;tvD>(b!@+5@bfJZs%wjwmjOv?c?!o=g=<?Is?a<&kaBm^
zLL%e}9Y>)Xo=8zq@ve3!3dvJ3=_7VJf_#AL_QZA7ckNI)oXPSV^vP*Ux2E{736pwa
zUa2NqYBlT%F&V_ivWY|D0`Gz)bPB{w+Dyuj4EzT8@-V9{Yrf)S-da=XF`Z#Gi1)*#
z7)V&?oiT}Ua1uFJ^L7?DAeiAmvVh|fYw?ohb3f^A9{1{RX<+ywk0qM>dUBDdKuuY6
zC#bV2RWf|XPV>8-#Z#x{N}Og|o77I0el6)SNqi!RKcUp9VWsl~Oi}bB!Hjr*t|L}l
zhZGFkhTlSqp4H%EdJgRK4Lre1h+sJ}vLz=Jvrl4-)mRi$2N0Kgwz94?d~f6Ec$q{t
z`9yf-)PKd)VVHj;FH!CdIS}UIL`hE&jP4^s7+Y93mil<<6Hf#(O`AHou_^0YNB3j@
zfy2I1W2fOwgZJHk`v&@A{e8eCWHPMdV;QO+-m~YZ;Ga_%`mpnRJu>*B${7&nhgfw&
z0hQD1eHj|Fr{(6&ay{-Y$E^QwKKSmPwxtPz3NuX?mWHT*TeNZR3ODbVLEN97o~(OW
zX&2iu*~qiA6%r{V<3!e~IL`C&|6|-z93nZe&^G>|sQp;QkVzjrk-al`(!$#=C4r9M
z=|d;`yq--;xzjIO<HZ?6%t(kep(XeX8Q(WqF^o;uW@D=hyzdvk|JEOGZQnwocbm*q
z3<zXj*ezvX&ahwZw31prA^?WcAxU9;QyI}Wn0GtnftYxaCf4Z&#{7K`!;IS!cnA}T
zLvXlzIUt0y`B5^UMh{q>QV+FgVA}Yj*bK0#h7q#oS5;{8gA&$FtwW+B$e`+@)<PPB
z$o-jgJD+CMGT<y`*aY8~RuNcG)+#Is!bh7p4@F4eBEdz8rsD~sY7gIHZ$3?HotrV0
zug3|WozofijD6{g?T2h9YSprbb-=&att>cEy41Lm%>3RjHH5xMQA@ZYGD?cdp{M2&
zp&qa}oNPDtpZ^=YuBr)J*ECm?=E-wbgxNndN9@b=98TzD^`zz%Ge&MpD5WchTSRMi
zA@tyr>Al=ZyzU^+GYQ_B2&W*o&<E?A-yM8d2>}h3JtL*e1#1<NnrdmzDH8Zive#^W
zYH#<zFL;JS-nZP+zFbeO@uFG7yH)%~ub=(LjE24?+v8?>ryCk>?q<#Ccc&IjFUM8j
zeWd$NGM4JM5~`@*KH}22u)9x;eYgYpI_2u>gjj$75>jKO`UHLg(EE*=-x?Hs;37T_
zHnMoH$x{AsB+T!9G`QRMF{7-{l_>uY+p!^8_jKJ_3r(9Dr=Kc4dW}C!{)Wn*sI^Jo
zV<sa*I4g89<L1=b6i#4~Q?S+nx?xAUMrhytC~121485x0StQ{kO{=gv02xD?{y0*I
z=J-%)nq43|NcOgeMV}WDan>zXxBRCpB;WBnZP!}5*z@(72AgRRb#YURI)8N1C2TBO
zRvoj|GT<ZFjU2%Zikr4}%r_324Tk#huxF;?OJf?qMg_m*1LS?}ORO@u;tEF4aeS3X
z$|woMLP0<tB@~tS^eLPT*?HPH=~llRItHnE27@0u-<SEjAh3Igu;Ow@yGQEpsY<Z(
znA4Af?IY)cc+?ojU-91RMpTw^gcl^^BGh8{ls*vHl#X+gk0(J+obCjT1b{$>S>{`7
z66|}AzL&n3b%J@oU!I=hhx(?AkUGEXIoC{o-d$Q3guqXu17)t=z;2?A8}i2TqNdet
zt>S)d2A$&b@P270Ohbxe8oH^2Ka8a9CfvYJN;(NU`Zog<u#(CpIrMuHq^IhPdVi0$
z%(q!IZ~^Ko=4lmL)GuS2Z(2W1w+pKnzYQ!A?%BQi%16YwrCQzD|M-1JI&?@st6<4g
z>+3j0ie~MbnUrRh^lhPkLnKgrU|~t=#L0@4xHPyBq}h7b8Iiyh*EBD>TvTuOca6|A
z5c7MpPcX90uYggf_p5Glq4)TFonmPDSWIj;r?$D%*{-S(FUQJ+oLr)nV~U)pB-7kx
zt8PtlnO3Jl*Ch9+lWSMr#Ke6nfc;X6`5o8x#OPzelbMNWZ>4&E&U=U(hWW$k>I_YC
zooI2dvD;r=KT%6g^Y(=1vD4^5Z@K<!AhV7y$3=1LX$gI+WOu62Xxj)h`wLmm6HzzN
zYkdt`xyTJrbN)bGvn`5&+m9$$?Ov)GCm6QWY)<q}S1E}%a4q3}?Wh8FYW<^YlPLHR
z7CpJnjHYl8y#G(K5sD+cJGp^Dl*j9j&%fvj|IgUI;6nk0$>?T8`@FD%8N~lwi`ym?
zZ1}fiPah{iNJ00vx;D^@ya&`=8Zp<8W<UB%eYC*C;4Rn$1T1`1>LXTZ7S}@UXHXq%
zo>v%&Y3(Bj`ol1>R<GL+1-1()z_R4UIwYzeSS4Sh1J+1$BcmJaPfcSj1rQC+hjvvm
zN-kh?cb-U+U;5f->C$2Xk>1HM^Rby6>Av3{5Q9bQRdsTaUl7Gn$`Y~e14IKj8mzqg
zxS7*v=4UejKmh?BB<FA|DzmfbnTgXwiz=XN6byN-(iO*Fi-TX0sUJ_{MGAUAvDhiJ
z*4>Ai&6Soqq@Pc2h(LOap4QZO4cy_{@#b6W=TtcM=HVm<hMCs!eVqQzdYLTO^N*M&
z8#KQR|GH<J@S+4DAY@Wmsi62M;mvKZYoA>T&`qaTQee=rg|kyVJ~n^qKSAxX-U>>Q
z%+QbeK2)@!6v_|}dWE#2g%#CTXx|OtsIosn*C~%|CKbv45~3oy^}ylRVOG}#m)RB<
zz5utBO3AG<hAmn%9R3Z+UqYXEwLfM>kRo!p-~dp%!fy@=zvVH;-G*K==jf_w2>bT^
zpD9J(Ehue4z(xA>+xv<R3^_>&Um@@GR5}}K(wz{5nsIM!85ZMu3bMlci73v%jCt4g
z5o;ZRM`6cV=8)zy^$>A4*|0J0R~6co5tJU^p;Q?$r=l>ycs#Zw;BqyE4-*6+?EzIQ
zRg!;XXOcs<RiD0R?HmRB`!P?tZg^U?=@cqVJVxiIB!X-MoxZL00o^@<WcodxS@;K{
zz<rdVJLXNhG6+Q;^1SS)duq(SSY!2@YK+D|18(>2`&RL`>Bnqwp(E}?2ds9-a8G?!
zHwoIDt<5H5B164+;xqv_XQ^&SwVC7c9#PN&F@Zr+2(Y(+#qg)YXOG!$emV?%9?n)_
z8&{pcqhTC8VdXI}9CX(($W_#2QTvLL_<@lmd%f_V)JN4He)#9SLmRk>VUI$yCQBd%
zIf{dMQ|KXORDhTjBh%eQMDl{@hG0|c`w|<o@<tPNL=30`r+iE}>@olgt;H4$ZQG~1
zZSYH?)L9X*7-LVwj<gEY<nclf=c09kpXVX#@T%>-4UTE;9T`1)1ZS|sbXZ@N$jLWx
z9=_OiJ=tL=lK1ckhl5gSK$du*u088vxT3Bgd`18G^AWo8{=u6qY{I)1V{9pWbmPpH
zR)3t1S(K9+aVLP{16eA_6OgHX(hHB|!-%U1KwK$8zDm3I_5BE<7tQWpbZqbcJ#AkT
zjT%dwV7-TX<6I(tmU5JC*rFfhcVf<@2-&6S<u?gt9}C#k%?&SPSV9iRAhGbgVT>+K
zIt6I-AeR_ICiLi5{M7+yRQad|<7%Q;hW_~4#goAhgP2|i7w?*%3uZ*F^}wa3Xf=oI
z<Q(TE#H!c3wo$Y6#p}O3r@fJ&s^~Z}fRyv|I2CDy_rvPUQs;=)4GlVaOT%`9n|*!o
zR<mO1U9xM|hVDKGsv6?iVYI%v(l<jb$_+N1Cbm3;0^sStyVPqwW4TOF21F3S>8lGz
zN~u(yzhO8)?s{%SF0gRn>Qrj_820JVkSYV8RU$dcV2G<R&p}u?K)H-gKuVc{5!1|V
zAcaKuS!z{xAON4IXMQ>n$FOcrC)e2^1R7+(nk5Gs#!oR#Wy`=Sq5TqKDUUT`%Ie0x
zrR7E&+2FK8|0PEL>M4dc7YJ9HW->-tLgF9VNEII8jI7^lN*6~-cVq)*j+hIM*i=XY
zEc<rbV&bDQKfi6@1mLn){7SO<>v7LXOp2xfQCP5`pOAy6r=ROjYCBG$*fEE~Yaob}
zyHfHE&{wvyBSUS|b^P0pY^sg|OW>Hq^yDgMv*`zCKcDy^u{w<okBcS1R#LiDSdkT}
z2^;VrA&;-b4?KRD5%udqIjXmc_N`7U+Bmjc+Rg@5pzFjBvE5?o*X)y6Ub(l*jL{_P
zIm9jxv)FfQaOPq6T-%WAUviodMza)pm+;<v+H?|_`aFJ8ib@8e>kj#@!P`9F9+qR{
zV#wyQLl|dYXBpez%D);FTkLgJj8)tREyEC@iQucODNE+@cf5I3L-Sw5UFIt56WkRK
z0++hC_-dv1O;alM?y;-(VCLoc?`9RJb#fxqtae#;Z3T-Avu-#$2i{1zuRHE{C6TlN
z(z&b7DD2o-HPpUv7b{XHCot0E!u>186JY=jpgFk5rMZEQvgc){C&mV16S3FUD_Xk<
z3-zXWsu9hh2qb5eTWPNLj*x6L2@Z(L5Q;yi`;fLRJ$#eg7go5JC=__syp`X<VjNCQ
z!33;0R}>W-g;+V@DH7Ya8Feb{`rKdXxw5nquLu<kXZXwal7dcjS@KWmFS>ug`}gqN
z(-RK#c|qa@6)Q~sAJBH`mx^y#b?80vUoJHu3!>G-E7EZ(wY(q|^*gxGc4xq93T3u)
zoO5;fb&wJqX?TMT05F0atJy16CVMB8oy2Pbejuc?!(NoDE>^~ALl&Fs=l23|pjX5Q
z+?@ooK!H7sIgkJ5%`0qyBPhL{y0Rm2Eo!Ug%{qdd?8ncqs_~!MBW*T4deF(EJGegs
z)U929UN@O-Z7!l&rR6W7lbS24u5XG7)ycsVF2{AOe_R57r-*iP<}jeT|AD}g3AyXz
zj$VBIIs8hbppAit@%fahm-b}SZk^>AYW~vRWR`~9MPI+i11(Bqh?yp>ZJ=dl2)_%8
zhOdvTgL2^f9H34?Rtf(P9Xf}Z1O4<3dkd<gZGWnFkCSxMO{x1C=@-+r_4X_VLuhI?
ze>2+;1~~zuq%0v}Gug~HRbwB&+s=s#`j^FD&KqrmCu8S_t)60U8tQwF4b5voC{5wZ
zclOu6XcQbxm0^$mS;cs;?*PmYIg+{;<UC|CTTtLsu|tL$dLK^QWkL=zlgW-BGr#Z&
zwgT1dr4p%~N_+M*PM^K`!(;c+yE?A`hVSZaxc5r6fvg48eL$C0)ZlGiE2~kH<MO-$
zHODgirF1n;w#$nKRUvp*f3PGn&zmN@(m87<N@nX}iytKO%%5Fc<V|fDu}CsD==N>|
z<;eBBXrX{!p2JD6^>-Fs!timhjD!{uvF|aug+s^5`8DxhO&30`tkJZ0fT|yu@T$f=
zGTH@4@vwrSxakSz&DjWRsXgKAlo|oRs0H?GSXbDX=rPBZ0otS1{s5-mJ<zMDsOu?u
zD-#6FOSC^_8ma*=_f+1i3C=dth#O1OIBSbetBY)_@F{0;FNV!kPK<mFEKf7O6_Z%1
z2lk1rq1`qgEMrtQfX7y92^@n>3LJ84(G_Ut9{8q$S;6T<BEef!VG-6^IhWZpls+;%
z&~1GStv6Kvv34DZ4KNHu)&4z^z9JN>NU?YZ1ZCHo;-Zud-|7{)azz+7!&)u-9{<fj
z$)uS_jF9~FH~1H;yZk4pyO_TEgCqRPLVl-z2B<dGn2*gtZxQWlPWra!@j>&qtduu$
zejjP)z|m4~xy5AdU*n@q&sE<P9sI=l<r$BMT>KA427r~n>3FE~NU+<k>YJ^^zZwGe
z#9O~_DH$PC5(Jg>8Zbe@u%k=|`Fkaw=&t<h-%+7Isye{tFoln~DZ)kQsAz1cqsFys
z!|vM_S3$`g!v1k!u$V*M;eI!)&`G4m3ms!=t}MH4n3pWJ(X+MPdRh`Q7-v1*Y{jcC
zQ;w)aNkP*Aos$#b?=3_hl-{H<MVgx6c$AZ-%WJ7ufbKb`BXd8De>ddeag29(?wE6r
zB4buA!Pfx1vteEzAlSPrB_VHgPS^GJ@RM^RT2!%}yXj4{g)>um9P=vc-yG*GiY(_N
zSMpvP>L0DEbND<b&5%WbVvoU$OW29HPx%V|DuTgnkE=qH*eXUe8J(d)+fQviu|E3j
z0fn6y`n?=&6FGD`B#xn_ry~1Mz$H^~=X45Dm_0zbs_y=L#)`CTH>X0UT<zm_hyl!^
zP3igTw*bRhz44>>RzCcCsJ&(TbSM2zZ`pPZmtQxkPFv>o1=j^nJ3lERb8hI4$A(0$
zwVU{?9XJnt!$rLvpUPj<WQ=N9fI83F!5_vXR&h-BQWCMgr#~C$?e+05S|Kb1@2U)<
za`e&bcCzWZl<Yp2oxGR2WGYWDG<FH~fCB`fV9x|a4GAByMSi{baBARpj^3NVUjk?R
zBMjmr^+|LFA&XwGGH9yw_Q9r#i&Tbut)TqRv1kpXsfJ?SkfrH6mR2^S>92D4-SV|c
z{fm!HADl4Ikb1>0h5sg<JHF*(6$5dG+sNm&Bhu~Nz6eu_@+ijK!qm4I(O$`hqP70W
zo>6;yPPZ=EbM?hYb^NtaM{=UU3%ZAKAI8lHb|X{mM3J=#x%rhYulS;uai=}UlBul0
zdD*e!%lyARPei<k>djsS`l3#fQ3zZd-WbK_kdVJ`P?eSXH@W`+U&QM|IaPn~$HjW(
zh*M($l=*q|=g=XCLo_8rS9<p2f;bXY(sSdFmhnbeaS;gLFPUn2`h;@91ks2d#1=&u
zsTd4de;|v3vv*e&4v_^kOOSJ4@)4QuLm`BMmIRAVEmKMK17kl1TZ$lX8boHc<hi(D
zkEQ-%_h1;XGWRq6=z8vGFMaM{NglXCQ7uw9dakkGOzvYnvtJeH73OoShw0g{Mjn@2
z>)yMaWu_Q5qkGSg>;)*DKW=u_t<@zA$-ugimQK*A?O1pd#`@BnVUypDoy72rbGlFW
z4A-Wt89CMKT03g|R@YBq*39kBs}Ja${@rHt>TS6ge+j0jVsrou5#l0AJ*r}!|DO6Q
zJlRX!zS4#F$!`^lI>k7!bqo7BT@9~Xeq9$Ls3>lCR{pES<KS8595b(8)(O8w@4;Pq
zPe`)d0ivU4185{Wm^0+QE{sT*OELY?Fp4CRGR$Iz;>>o80ghjtSR0rURLpOncPLz*
zCo;aa$o5Bo)#${p^2Zk%>KdN*-_Rgcf^O|WdVcj+sHky|V0NQrgPy!AD9$mJ&}(zv
zyJS13VCsqAO?ouP`eK6%`+9wB4R+7&O0cusD*K;Xe+3{s1@bF**|{BUL~KsrKgv~q
z?%5#~niX@`63iApAhtWy>L&(SfW_r~i>azbrQ#?}XIms}D=|Vn)y&`^^Ghy29w94O
zCQT`dG{i0}g~jC+HkW)Rf?vfZJ-PLM{PLA<A^61-Pe>kf3j7Y#)c6BYDD~F#^qc3)
zRBQ#tnweIqwIL(z%Rvl%&a;n?4O0Jy6pL}G&c+HlPUcs)8~VnXhv?j5V6ADxnc&?D
z_Ot*$ob@Lvj8pSC=%0_ebT7vMxCSs~DMS=Czh0JHqe~g&H;a2wbUnXBfRC6X?E9WW
zFsv1kf~w?S8L0R7X0L?l51I_D8Yb-V?*O;FjT=Ir!eRap_<Uj7SQ=p3(27R?orby#
z(MxR{C~%W}14{!uapI6PzfQR#?D^-NF+x<VPdp&mG2k`;d!0MHtlhwEE6WSQT>)dW
z<4VHrJH4T8xU;8T^`YWzMa5ZIttw4`dR3)wO(xIj#9y0wTeDl&Md&oKHbyNqXzKyX
zTs_flc%<N4&ryzONw^l^t2$r8Ef=!Wk5aYY@H6r2Dco#43&Ja+Nrr+hT}tm0D-}u*
z4n^VZRNr;r;_j5@+=r%fIvjbMud?3q`i8-4ITjTyr7~0V!yJ`rUkTuLORvP|yYutg
z6~h*(K2nv;={=tc7KrPSpllq5i#^Kpevp5_5q&MX)(_M%AN%Z=5lKnfi&Uk6<$7rF
z^~jr_1<Da+>2`F3WF;p%VM%X`s&zND%>B-R`Z}DZXBtg06uW0QH3q8+h7Ko2y9n5>
zmqWI3-}3ujkYSH77~e6?viz@}Zq!9Pf3JSPVBPB7bGip{UgVjAgweVl^-Hmo$b>+n
zdr0t7tVPX-k@>ZejJ}_syl358q8E<MuSF-wUy5vdV#Y>p&-H1Hx8A$&`A6=YZnNat
zIo&ar`XPV5OV7Wd%nPxxHV$!f3WcibOVBg}ORE)LF>teI7$y!=u4hUb_;X>d&ahed
zOg*AVBNkq&WQ3lSo<353-D$RH#r}Oto;gdG)0!Qifm%-&bXJRR`aazrBnpkZy`iAR
zMo%?#y;0*An{jgdIw3-TlO4G0L?ypNTmI$>>|)%~^4hU39sKHH!Fb1d^ZN&=#gAR|
zIh`mKb9e2vPj8=IXO)ECl%QDYtAi=8Qg5m1qlHJ`^XDw~2=^oiHFdMP1e9ewWp<J!
zHg|Jtqzk)#QfU?pel4d`KYA_FwmRdXL9+oC+%PM+G|N9&{B0}H9U}Ws)CmbwrzlgW
z@7=l*IkyRSDhX7s8Y$cL|NJ=R)gHX)FuTwJv6Coe{$|TUe#c#|;YE1~v8M>0OGRlI
ztfZRkJ6Fn)#40vX6pQ(Zrsno83uiV1|4&Sj2Z&Q?{APyL{e=6U`Ai*$(zS<}UeV_K
zwV89Az|C>ibui<muc28hC_4v1lskOv>C1GJmNrGy*{fbxjjX?Fj9Rx;pg5$jc{*Uk
zH!?ysAnt92w=_kRZ_w8*pWOQ-Aa$ooxr)qI+q=y#%5?K-PR`cDEehw_+VP_t{%hP`
zVv9Dexp#LG|DHtwhEsN&j<UKL7~6zweU?j(KAqE5^T!kQR!l=)xc-q-OI*@zfd#dl
z^pwt5hXzzFVPwUSoC4G|{cn7;FLMS@zW!L=4VAtNOkAk?irKGKPh9?zSUPl8@*y|@
zXZpHZOb-wwT_aH+AaunpEH{0^Gvw84+w3A%^m3Sr<{~fI*vfb4Th6oG>`Epj+G+63
zb*S0r@e4PxPP#7aN$;3<5PqZIzS|URAoP2(T$qAH%l1WO@#R#0*+slD&~csINSWug
z*LOOl4+AKyO>lDUn2)FUJ9(mk%TVCHwRE<irL_*tfQtF$_5{}G@Dae4WcVEbwkLD{
z_S{pAV6{7VZ!z`$J|ULn^ZcTjsEZEKb~=BOqBxvKq|6q`&D;OPxTO+qZZwd}|E^hu
zGQ@=oJh&vh|88O$G%ALR=+opp1}*xYF86VD7%kS|izS(Ej3d%(#Cl?O%~`y9gFlz=
z7r_7W7G@tOFieq*Whib#)hwQh+OR37QsCdl_DmLm>6Rzmc^?c>KQ>{b((a){>n}4{
zB)4gR63~b3K^jwpoFKcyo{+1|mSl86(e;rrCm$&|NkpX#al=l6pV93edx5l3a_%t3
zb%J}u^vQ%-mfUi?Q(tBq7c!nz$SYo<20Z@Io7P_FrFC2!9#y$!Uu5am$KccBgGwKf
zmw26Ek=C$5Hb{%o>bOHX#8H1)cC(I&2>Ez41x3ORKJH15uir3C*pIyR56PQS3B*|a
z<o~Tc+50iE(KqmRroBI$yDs5&%+V7bzGTPYmH`qd*>jl0cD>CLY|6Lv;on3Nx_}wc
zxZl@q6wS<SQV&y@UAv@AQ7u0jO5k>F9$odCw;-O)#$S8o4~($6nTRII=w+Hw+?K>`
zu;1(YiPOxH3}tQ@Y@TgFK7ia1Ncm8;yV7%7r|?R%h@oo1JhA8<$rR8gs5)HQmV<!j
z<u!_uXIkL#W<Uc!ka=8r!SdJoXTRM7^}W)f=PQVFhMPq>ER`{N1<wPmCJ3oEj`|bC
zYn%MgSBIHDNLv`b1fUU6;z+A)`*YN!8fS#lI7AJ7+Os|PJBUTUGrPPfCU?Ft9rrYP
zqaft5P#AFWIo>p-?@tb_x$_T9cYsTmVz^btM}(PA@4Onjrz%(LMipe^7C`R`q5vHE
z6g~&J>qjv~rZCHwM-080Z9!9A#Lmv?_ZJt9#P1ef?ScTeeL-f`I92}a;{>9J-b60n
ztSCN5L>pyb74yY2Sy<g(8kb%Dea^WXrN59xHL@E_G2%OV)0fCtc<`;k)S-paF$LRo
zTo%gcc_rNWrXz)`-j68xwnml)iLJ<{2Fm(&DehikMx$1yrMVw#<<~97?rHv5(Vvb9
z7GvwF@gF4wOb4W^t!FA||3o~`x)Pv)-_yC7)T;FdoP~pmlibr^DeXIftQU2j7F1Q(
z@cxef2RStTo~Gqh{YK7NWQE82=bhtfqMoUEASau1U8mc?Ga5*#4;&bkBEc{Ywbn?8
zK?g~r{T!s`QQ+n65<ZzO^Ufv&(~xJ(3^=e%`Pk!N?8~nU1_OUw<VKDk%6SAYRN@mg
zMc8g{;52xio(?_@vs9Td`&KWA&P5JR<=$N@|CgU~hk<Yqso+8HJ95Tbi-oN09}-QU
z8lG~A2Jx~eJl7PUqYN8f<zrp#Zew@VQ<mCW6|Dw{%QI`)keieD!UG!<j3156v89Z#
zHq|cwCOLd;rDE}ydQLH%PiC0VXJek59kxzj5b^OWsIdPD5b#H$nRr9nn=K(ivSB};
z8kv@mDFZ8lcDEv|x_1?mX$s1o4`>IQv@;FbSoV++OZhLCxGj9j<Srn}n6!1Va;1Ho
z+zVAVR3lGcGS=e+%v;<y!x!h}$R)-Mp~+mhO;zzh!m$q$5|DjrY&eJr6CH5&FYnsA
zNd<N#jupuEqDtc9eanQAe=n3ky<!al%qQA)^uA7W$pExu5vF7~fg;ieLs_x=25rn)
zNk?!e7!%C^aEfkS*sQSk_DQJb*ZC}TAxc|IJVa>iHecSgD8n`l8llov1#=pcIQYZ!
z?}eVGb_G=xT_<W>x>Cxd^f{f=36yO5Z^5l{C4lOKf*2EssZEc)4ym3aKA926q|QBK
zn&aFa|238VXJl-<TucO*^0f}B7&3iM2UX*Z8o_r9l}n2Ekr)@4Ti_n#%PZYMPIj2M
zxw4NV5b?@Ac2HS<<&duTU-cqKEeF<7&)(TYmG@f<jAt6Goul9_RG_6{US!B^%oLwc
zN|_Nn#4etF95YzsGwh~$S~IoDpL7QxwL)7_Pfq7!tz*8*4Y^eLO0$t}5lJAgQAO3c
zt!FPil53W%@?&`v<}pL48OJ<+mg|xXP<^{}6-``eHcdj(G9W1jsWRkJ_t`4l=+^z_
zLYR4ynV`I+;6PYhrIdS1M~Cl`fR_iy@m?{e^LEl{JJ-rs`(VrRB0e;NZ=v1Ui^TBS
z)zfhp3mzAmeVPz2!5Kv^M87>N`Cg45sIH$mGXC<?W3NE@Nn4YE8IB=G-?Yl$XgOYy
z|4IszfiC(f%+8oy!XvSOoBl)iZ)3N?2cItFW$@)<3DbiPh!VglQ<9zr`1AX-{q&Ly
zb!p(~9<uJ3X&>KU{4J*yW_8RiW+W-UdFiE8C2`L4@Oz}t^i1KGtw&7}(xNIpra|;l
z$8QF!$@BTc`*|gUC{Gl;$Z#?(#CX6G|MM#C1RNxreQFwG5`#V{tdEh)GPlT=zg%qk
zq+CnMJ!VT=zV$MDJfPcA<|R_kg^l;0FH(i7x|ZXw!Rvw}TwQYZ7uEXyYVjEV3Jt9X
zoY7i>;u2lqP@qKTRF=HU5iVZnU?Bg)3ahzsnHc(Mn9MDM!Q_gD(J^i@Z%kPpjv~``
z_`XvMjACPH8$nlvzrNDJ!}=Q`q2>&K`tk4nh?>~>W*}S#ZXA}3!?47(`WbYyFNA8Q
z0X^UK>Q$U%WKWyc$P4=(RNoYuA9;E(Q0q7T-dq;<7($WcBfeaFODIM7q7UPZT#M0<
z?#4~sPyC^UO3%%Vm~mV%A_8G!t|T)y)|1R9a@hpDGsvJX_6V15T^rE&a^&OOd;(>g
zO`Q!OL4I!}C+NMN5bQXSi%WIvZGo>j_*YYlsTFPxRH}U%G?(1OuxI&9VM3~112L5C
zCb{-1P)5LV@(3R{cGZf3>^Pe6_mYlBN^Hx(?|B7Fl~)!EV%Xa45Yja!P~P2&d}@4N
zOs_N9z^J*fu5ET8ggKiW(YY~voRbPMMIl4BxuH2(rr_7caCmU!p>b65ri%9M#kp`D
zJ?$K{^EqA25$_W<uM=UCe8l{RaP}!GR-rxE4CeA$MlyBRmPki;=YIn<uT&eN^~Ygs
zILec#<aXq_)C50HH-X1HYPkEwQdjqz!drM+?(*~dJUX6HUJN>^2)!EM%35IKMBP{g
z!8iOpLqfCqdVH2veU%Er+1VU~N|rqeM5t&2S2%La>2}+K6Iib{x@y?)GG&n9G9z%L
z7UndNWh`A=|2NqXl;`b4HF_BGda#|O%`zqSl-$LDgw1eDXpy%#=L&*P)fwj#dJ1c|
zTZZ#D1WVw+*YeWAQ^Wen?<?Cj_0R0A7m*8Xn<z8mqqegzFDUQYY$QdVbY&_Oy+Wk$
zv3WNT2h(XLc%!lDUipE}_&M29FqMe%soKWnBTPDrBHEpfWUw&*!h3%TO3SUILx>@>
zMxK%1J~&sWkMw+qgOU83`$CiYGg(Te6^LvhwvH-LAjuCz58F1sDLY;z?7RN`m_u=-
zf;5*nl73J4RyeoPZ#a2dcVH4IYr_suA$z^L`RHv9x8de73vlOcFR)CvPm8)@go$SZ
z2-eTEopnB`AAXm1mUm9aCz@#-Z8Skxq;)mtspWN5;EcR|ZRllBV>}{rU$GQHxfDC(
zb!pcmtJ@lofD%)Sgt-!z&f_#<)Z2+Q^H%U0n!YECqlj56OQ=FzXt74ubm|&eNC!Qb
zDWqkY{H*T#N27oEIaM)sckfm-P;qG&#Iy6h{Se&HlYA<z0Mzvp-V%!Q{xR85GB9#e
zmRMLXGRy&@AB@rY#72yK>m(TZ*o?Hpai}f!dOV}tfRN^^L%-r&XVQTvOD<x2*_ef(
z6l}L2g-Vy^9+hRYJp9_btC_?4`6(L{2S`~w5dHPi^?&F@?#6T7EW_(+d}^2b-M(6I
z$y|d320LXr8j}p2oCk3)@2x<kFmdU48q6bHFSlew>M+J5c>>+A_lTM$f~t&uBBG%B
zw3`W%vBw<p3|CMk5e76t;o&)Kzj)Li+&v`luaR|^4NsubAtK1bDer2_8<b%JZsdCA
zjr@j~BwRr$qfnt0(m!|1JaU3~Xb@we&Zal>D5TWy?kXaOh;p5Fc~KlWK^hW7whG@6
z+kzo>?f=s^(_N(V@4MF^84~f9MC@)#IItZ*0;T_xcc8G1-M_Po`4`og>^sMv9oU!$
zoSE2_r6$VAxeUV6v{~oN`i(kwrPTyAZm)D%#U2O}rjQcr6z6etjh)<B%hqezl8|ks
zzqutZ{|1Q9Ru>Tf06am}rUIOpN7!=GvhsT!$R};CI==ViwyFyho~f!F#tg$(h`m)W
z`Jl%;YUC5(n)iajej+b}<LK?Qok40SyiqdCG?@1v_du0vZ{`$SxaB~1lbh~kl;PSw
zd;dfK&;J$y=;*E|+bL9c0<<WyBg5J~hmChx0dNwyMkC%-L%gnvd*z5%Pt9_I!|3al
z*`X6;cLX$FpFvsf*`2+usp-xk7u%tcoSqZZJz(1OZiIC6<;PvJ$f0$It<L9$*8mL@
zAH6mOg+-6gDSvfvfOoi?lzCVNb0Emg_}Zbhwc*fk2|n3#qa1)BI1gi$q9M`<C$xA8
z*Ji~eEH1;i6Xi&PCaWfwjI3L;d?^?%80F>!K5u;Q-s=|M<MrbNrq%}}j2+1SMbNx+
zV6C4XsgqP%#n{I4I4jE7A`iFZ&i~JRMTw$Avhj};w~rJ4)DyM^hjQQ3t6X~+Vr2WE
z=>pgLX&He-i5pc1P&Kr}eJpqgjpZr^{1$28{EXwGT*I;G>4k_aw@aj|_0O3P5#hC#
zA?-AUKoc`lz!Q)tN#+(*7Pq~*Zapo^3EX;RWX<TE#a<U%$AO=W?Pv~P;N^i5aO4Dn
zl)`apfjo{f9{BLXD**v4q(r+QX8Je{I8U}&u_SU7MR3&vn&aizkQ~MK^iyU`Y2h5d
zs_OR@tJj59KxlNhn!zfK<C%KU%^lCU`xB^kuHa|EW{uRJIIS!l4I`g0^PSS#6y94r
zXv`|VUJakbCyf*#WtXMi<WGC{B`T%6_8(xs#E)+Zn)L5O%a2+1b#^ea??F)}DBoW@
z!fVuH^$#;IlOXGW4jh$`lrX533ta~0*oc-$`CeXI|JNQL9CH_s`l;CFMeh;lQCBz4
z88r4S65)w(gTCQ*up-D~XP<hlju@eor$yIv@EMaAkIglnCr^B@&4j}(C{xM959?GR
z(GRgc?BWoJ-p=)Mv^kqgL)R2KhU%M`pM<p{GtfEXzt@YxBZh`^fa!0F9p99d%$Q4;
z)Bg282z$?{rq->G7x&(7MQjL25p+u@H0fQoC?E+06G(v2q(efH-odT(DuIA>frJo3
z5hQd(fzUglH|Y?1F9P12G42@exaXetJ>S-|*4H`Ln9rR5|8IVXnc}MYo8<`=(WYTp
z@RJ}T`sjHeZ~(8>hZmPhr>~(T2f8C6kL;7o-#<%e>v52u?O_Bk`rF$P!1}{8(=X+k
zS-?RT*_xkPx2kI8d$9%|HCg2SZ<R)nDVBm7GIsVv{?qH3dx))On<)2!slmGCcMu)h
zxPqHaRMC&EMH??L^Zjbx8YXI;16VlVUgm@533DhW2F{-n7>+g@9A?>`@JiB9t2asV
z)Y*WWv<s^r*7yuztk=}dpo4((9>YSdHf31apjjY0T82wVsCcNKV%xC2vt7n!_Bb+G
zDS9alyA7iMic&?I8l?2~ZIs1Wu(09SaMtMZm#3`1w+(;ql_}^P!V90BN>KykBB1j=
zf|f!Kfqaje#q7&OT0heX|MeeIn{L<i>vx>yop|6#;MDAh>iO4jl9biXM@Q!yB@bBH
zYMJ1e>Ee|j>=(F6Y3y?*F8yira(A|KhbatC1g~Wk2ELnTkq<@O&6EiNcUDY)5!cy1
z*q63a4W;}H*-_SMtwj_L>~x$J8&K4VJ2Q_tIx|Y=3R3zKFK#y>9)jq<S65x_(TuRz
z21?cgnt-oRxRKchTm&nLq_x5di<|07C|2y~_TK$_q<MmEm}l)&E2-b~>41gZTrm(Q
z_hmV%??HIz6#rt@%zbraNV!t3@KCd5p2JY6t}Mx%DOEXuuRgPu7cSrKUsDpspWpZg
z5q$WDMJ($e|5#z4ET}a|hGr@hZ^bn{1k4EoS>uhVNWx9IyZLqPO+~(*=7nPX)prRx
zrMF&^MvlafGDJmf;F7^Z1?ReUJi=YKVB|}7>Q`HqZxTHfbJtI6g2>WKt!o2~-eA2w
zKc0k$d7lg$<A#}pnBeE74|_(cW(@F;HgzsryIHU0{Zl`*4G5Agb^(Vp8$RLWhL9Z1
zNwwj+dc^5ji?1V9{Yk7KeOB4=l2{oX-%v%b;VqM>YDU)fL{T84NZjl80^Tbs*9S}8
zAav?RxwyAiyEN20vX=h-Y#6cu^!`n|Jl);p19h-Mv?uj#!`934wJG`<_;eR@@<u`W
zKTv17cIVE;26do8(BE*Vv%$^wu)o!}fB~UlDEHqsS?oVj8o5aVY~+sB4{&A2v>4XZ
zG|7>54-En4bsdCk)VNAZVbsNqxD1;#p@<gn9%L0B>r(*SbSOxL#nR+o?eF-&l6#gm
z^qPUSDV}HIA8Uq_;oEzHpy5Pz`3A0!72h|$RrwU^;A;3^f<zK!@E&Pbn2fBuNfNJg
z0mJ5Su%feGXJ&3iknR2A8dvEJvqzHK7Ny4S3hwDJCf)Hd>Ktk*a4IX_uHV#AMFy_*
z-Pkh+nnQx7r3eX2#hdLG&0mao5cJ<=6yWUlMn4w8@5819bbLya%`#G<b)2jbBe}R4
zvAy(iQ(eLlL&PBYIlCH@cbrjy3~4KSF+K@G6a3#b<_%;zG36YZ9~P<D%FR}#VOl;#
z20o3V`}04xw60~gxdP8s<2#cEF@Vo8gv!drg<$>h)%XV!z`k>6uJfrCTU%E))vi>>
zb#rxf;c;Y?D_F9!+ie)>6C=(+VD~|(VRLF5CQcuQhws+<%+{jnhy#tNehs3t)GZKW
z7(vZNt92&JE+$84PC_!r0Hj>nkwsZ_jbqYf1$z=ebuD}zo1RK;_A{ug8kQYHzoBgb
z9feX~dvaSiB&lJsJ~eWe@EV;L)2yRok7M=en&-zmh!j7+vzvawn1M3&-I?Mvh)Pe~
zw^f`1h?B#UHBZdiWL(d+FX|%?ArBr3N2Z*UT?BK>1vETn5TD<q3`A|OgeB81iDu7n
zQN?gsjK=)wjjcJAgCKQ{C=<6L52BjnesozmrxgRl=gap~;-x0Hp}|%K8JM(CZ}@$L
zNVXC{YN^s3JI@s}wO^D%b;xdu7J1<q18=O~p`wRimAzhEge6Wc_}2EKQy#mznU^C;
zL@~d#j%qG+HBlQ~sh-^Oiao;Gqz5Vbku&v=dleZQ;rxHF+uK=W9snlP7AJ4G1iN_A
z?wm@;C$B#JHdxGmr0zfN%k2M_b(@b8w`U4``$zud@Kp5FJG#$|ZZC=aaHxUbdoP{T
z$-0_XqcR<Lmpe_wuBN+utebRO;>-KZ#p5|z4KJKy5U3`tAp3XpSM2oRYXv0<!<rKw
zmYxLfVN6zS15mQ_hH;Kwo*=OpQlajbHGlF?WW(Q9S{PT8w*+8(vomg^zc8M>dX*l$
z$dajkH7Jno@3D~%osxi<@hQ?DaQ&iEhSSJd4aK4bHl;7(KDAF65pH-{G<;EaGGnb%
zDn5=uOPs>L0Eb3c6^J~%b_)pKE@LfK6(qJY{GyZFRo8gg01jighci<1Z+Mj21$7-w
zkiz6;szk;0inHDn-WtZ~;dS+>jZNKLK+|+$Tw$?@sqMl=!a$(=qq{h8C3n4$UQD5-
zu#TD#a*6*Jo%_Ky{kP|#Z({g=%PgN;ZOt525;Z4N4U;SBuKdRi(6#p9h(l^{+z1|w
zU0_@6&E3eHuR42V_7rvgceA&$4$Wjg|CrvsrdV|EWuIC4!sPci=VB7`JOC*VyH1_4
zqk6?G#e6PsgG{QE{95`C*J`tS_=&aN+6tC~<pY&r4u`pU^cQ3HSy8h9@wW@mj%myL
z4x;!`$~4DLaba4b@{!n+JctfZsH(`Nfa>0zT)Ssyzo5Oq`IP1LN&--PBK9jj?HAoO
zJfIea#t%-M_knk1tnQ#BO>l&k)?N?c*8GQw7zKa*#5&!xV9P^Q>tZ&uN8zDD8q#?|
z#is9@2OP+Qp$#HVIMzQFcqz$idqM~WoAkt~ZUb5Toi7dS#%DI4Q^Jcf>#BAX!KU;G
z?!0UcSf$6(x<&LYs3|K^@kYjCMRZlF&)lp+z+1BJpQZDOs9aeMfJ6oKB{Gk>n4r>0
zZ5K?}Rolw4@hCE`>-d@cejuUXd34-rXc+-}%p}iO<Ryt~h(fnJ#xjg?CTK}AEvlQV
zCK!R+|8bg5z|Q;(ZKvaX*kV$YpB!@K4?8o9)T@RM$?n{IP~ngFZW<E@Slknre;2nb
z!5T>1bN(6n&9QJ9UiRA-@B`~_aSqJxF71CRV4-?$LT+l;K9_~ky}hNFkfs`Wg;yn_
z?@^1U@4YDfte585Jp5<L1ikvqQ#Zg>vmYQ<Xui6$1tT;cW>b@PmK<nUqg?po1yxX7
zN=8dbcBZJ#+uPRfklD1#<{7Kg5&Z~FDwXE$HkC0FW~&danDlBaaATgH9!HS&$Qt70
zo&x|YG&k0EXjt-NjCL7j+Q|H6E2BX}64d+?!C!QrRcl(t>21YKsAWc$xwn`0@yoRx
z@U4i24C7l(I}`dXpf)8_H3nbR7uRYpnY^qv4GBl#th!qTRk}B@749qIVKc=CPrupD
zjonmbm>UbYeUDx6)w>W@^z!*>n$DB|R4mcn?KM<4+kLkvW4JV#dPFuqILj(n_6oms
zRB|=?omS_Q-o~!d#Z<*~j^(9*mEW%^oA9g<R#BFj9MG8i#8mPe!ZLGYz;U(Hz$pXg
zRo0WiCp(o`H(XiuD7>WrfibY#>e!blR-d=`rXb7)N1o!HQQ?q$Nxj%`izoehvB+X!
zC+}S4i<>aS?T%@2&&(UuHI|PVd|oHd*q+s}#|CIV(1>*aCc^mmx~$#mCNQ`xZ0Ug8
z3z+vu-r*$pnPJlcoFjwUd0cUS1uQ+sl^a8OJgp%SFhFpOMT$f?+<SWi{YL`a#%+B1
z{^Qi*7b=WueK`-<k!r|ivrT;YRT{~MLUOp&OcZ;1-Cy;2PVkmnCU9L43%_xK8(lbW
zRE-DVj~ZD>UAb{N;E#Xkrr$m&`<w1BHp$<J+zgV%V|2v8D|H{P+EfckTI+LDUnW@F
zLY7~3fJBTXWhd)I;iQe?PbBGYAAaM^;~Hanod}5zyjuegqE;0Us(81yKQVXLhI!OP
z2?_0~w<vlpuq^Y)+WAi>C6hHCqrEg7D0LU~#R4|WEmtJ7VmD&kyc4acUE2A+_WCed
zse`Yrr0+cw4UsGEjP8VMIMe|*tdi|qb-WW}^nhEV0rj1c#JOgCZ$9y--UaQtm^5O@
zTKx2^2#d)@Lrm`th$q0xe@pao$o9PCID+henJ#%^@XkCj@0?_c0saMN4YS|flv#IX
z%YzrD>^4sd%)@_R({&u6`P8S;-aFL5v6l$C|J7~54S`0-pdE<Pr)au>i3Xw962q&a
zb8-wMqQSs<=r9?0w;{K86!oN`k1>o-{FXiO7oCSkFzBJn-ScY<k_$s(Jx{Zl!-jBt
zt6L6ns<-&gyBnv9eCxeLEeLYVnIKbvF3SE`3|N5Wyt7Yy4#9)JZQ54T(weDNNCBvM
zEFQjbz;;2=5Qo)deCW5<3Sm6ZS$6o#kO<7k!t$Uem0+CKzaG#gG+)(PND$~q`yA|V
zwmu#{obj;-%&KV~rYXkNwX5{eX$aB>o*L@6=9(8vN_4cGPUbVZr#6MoW&8avj71DV
z+>Ljm$g+wXtF?O7`cSI4{U4~e6-TYm^l9oa*%=C{EI@_UBvqT(C4Ld|kIR(dpBRXA
zb@j{5W&fkRc=f6c?>KwZTP82~ku}CY#8l}YH9r1tsk&(4%n#4hGY-Z|7D1Mu5Z~xA
znd*;ZStJJ-+)Y9|!Qjn*7{zojiRHY;-Zm`BWROaf);J5Jkg<AoQ6GU<lD_+UkI_^?
zP3KnEYgQq-Reio{mb*uQ=>!L9%vcIU&W0#xs_C2LWt<>XImrr{c+8OWMeB=-!#XBF
zL)Okksu7x7?xiLme0GztiTFvMnYROY+}k<TnLkv!lA}JKvMf7cQjk;>H)``!B6?Hv
ze%!s#Ikl&N!%a`HDls5s&DAt(<5H=j9xN}yERsw@cKA4G5-(V#4j%pf<D*#LPNxqi
zi}L5V^2DP;P)0iSmQ=`_j7NXWCHVyXnFVCVV5X<CWoKo3KK)-jsw-`qvaFlR53y)x
zeMDOM(w8%(^E;Ua7|mzLu02Yd{*R0aU>S$bj1hYs`3_I*Q)ej#<@>V5^y>~X!7`Uy
zZl?m7-X|qp58WBxlYuOJicXd3&a2J3f6nf6)hDc#-4Wx!=X8b2!GRLdNm(7-`+5a2
zVjS6?yqL^mxuGUFKD<Zp#CYdx{??<WpP@7GFNvc9yq<X)GWH!{IfGio{iU|jJHkf+
z>c}WI;~M8fQo`Dsq-jOwAJdC@wr6GiF+A!`j4_U<!pzu>*+eNstn`5ud|vO%b3H~t
zOJ}Zed7SBW2Wfq{C(cQlc}1W;)mK!6%wGI*SfkSAW>$Tw?N+yxm--r|_KV-gl7zyg
ztIMc#F`S1@%{|t?in4jt?|BOz^L;q_?bGn_6}`*@V;1HD%sDr1BbF8NR9&r!Y*Mr_
z{9f@ox=KJ2@CU{p{e0>=9m79bckdyWfP7`TUMAS8*MHxogS#z4e@su>7=KpJKqFG8
zO12O#x)7WDk3YP?CyR!tYZ)2QJCixFGeyL5gV#F1sHctwz6wgBH`Wzcz3_i_vcT4p
zj{`co(1|Wy%nRPBp?2jbA&<8J&fERgnWTH)bPVi`35G=<dM~e*A7f;Wtg37GzlLgf
z9Xh2JcAj|-$ETMcN_H9fmA4w?SM1yA(gMYtYd*=x>reJVieFU)bVlbuLs{lVbsA;W
zVhxBxmcPPZ7p{34`6zHh(`wDjIIIQ+A+(@yvlK)@$*XwuSz~BLT(+H(()*3k8)4V3
zXJnJ$MJZ9(+QtDl#UKBL#dl@lr}5iLezuRr0HWLl=-50_<)7Y#k2aBWESN-$%#8X$
z<u5u=>XxI+!n$I>_#7_UwA(t*-}I}d-nFLt9FIJ5Cuel1-z~~P(p*y{8EAUBL&a%^
zji2H_uZh9B-CR4D^n8KGa&xeN7v)V!_!X8iW$&vZGB;&F$ZdAgsOQ;vye4^b`BX(-
zKB`#hJ1LMWdeC|H_osj;B7^MwCN^>SPP4g)eiiBCmJL{pq&_1Q>+<Z?pm;~JcV{-Y
zsIg20#$Iha{gg$R7h5zEqF)aaB?bSkqOGmxERiS#O@F^f6^U|00a6D0a!{$|<1>m9
z{aH2x`x>ZMt0P(n=NTJ}y@03udAC%u-D1?9<di3up|MumvRcN&L361OGdXU;#X@8n
z0@B75ftuBn6(M~a1*BGveTw+k<N;}>T|mPDn3zj`a?nDCcBag+`~TG)6|*T*`}=c9
z^8Auku~p#}%O#@K!xZKxlq<Y+HU2M5Dvkx0`nlZ=vAB|NFW#o-@^0RT&#wsAdE5v)
zyZh{3vSFn@9K0tu9pP3(r$dHerlYH@$6}3tW2=#q!#Gy4^I5}$|DfkB3hmn#NI_54
zc_CcdBZ>;Yfg^o+M6gTzZTfXa1}aTYAcxdHk%U$umD$HYQM~i>{7gjgPa-G*R_Iam
zrxA&5$()H#)3;IdT1S;Psyqslm^7Oi731#L`1r2D$Fl+8t-N5HCtVLFdYQtKnCFyX
z%Dc!lvX<;ut@Id!5!JBiXcH;=+fprpzv$ZFv8zoW#FKz?>}50<-~a8m|D`VbpVyCZ
zyhB>}Jnav^f46)y)HGTg(trn=dkgGGpAgN5<G<^N@c|OBnV_X4js|QE4bK#REv=YS
zU*Tfv7oE)6#cdtH-kc%XEJ-i)1xB4Rm+DIW8CZi^-Kp4(6Rs~T7&2C4jJl9!kN3H8
zqA=$wv)~|XF0+`;U*BaR;UV!RW=%(lIKJ9*uX6;Rc&KS+q8KpYh7ozOGmJ>e-N?rz
zr9cj(s|c$<HJk1W(;wAJ04v$eI{YEaUmu+JNog3wUJ8KE+nxr%TMq3VMdpX3S{(Uk
z)7^U`aQ*r;^eS1aZY&B*9f}Y06X+>s&vK0#xd)9;92=bD`0xfjkU^!`X!zO``ak_-
z2IG08`V2}GL$DVfCuPo0zF#N6B7zQrUKmn{L412+`5C6E7?5NwPih7d{`MZ8ulEw$
z>4s9bl&wpPAXu)j;-p6j5Vxa`-^eX8Bbdf+BiHLRj99RgQdIJ49(H5`lQ#QM;A&n-
zk%ZM_K0IX+(Fdg>Z){>~rmEAZ$7>s<ySEPyG$q;6pg}hx8y^=oG|bPVy#2)@;*QKT
zV3F~vIW`gbrzC0^e<lE(yiweF{2^$Mf7f4TpN;`7R#a3}^%~&rZ1%$B?Uz*+)Q7`o
zn1gF`22PBi#ByeBoG(lDJpgh1rkj>&go~6TH{A!pBFu2qMl>c#JkRTyblAS+08U_u
z`cxvu>&4p?pm29anMpL}HPpd_MLNm&^RivhVdrn<<3`s@uPN|O=f?g<6=nKedN4$i
zY}jKokxj^T-jjp}@z!3)pzA6`{ATAgZ~t_0A{e0SpCsXpW{b;9&r5fdgC4J2t<QeX
zdNBQ_<Z%m@R0@~QS!3}&OzEGp{F?Q@7!Up@SpW6(rx~A`VH}rPhD&DaE+`#=+t;KS
zCk1Y#O%qG?CbNW@9(~^B1hZ>u_cRHk{Yvu`j+NI-+X4(b!df-&9J^<k%=9J7wJ{nY
ziTb*o+Vk^ophN|IBv99&-<g3)5uOv#__8l0$I<}%eV2YPme>gsYS`KuSSG45?_zSm
z(-Y}kPQ~r(r4~H#Mm8nqz3F9r%ISZaiMNQ|texhZzDX;5!?i@kUNz8+HB@!}Udb;5
zp$G`^X1V#pu)?Ha^_31x97jd+hqDk@B=k)Zp~qCEzBdpFPHMz$^y%q^>lZ%&0Rqzf
z*-$$%V0Z?P%!P>XKeRsJwN@lb=ZrC;X}Gyh6zCQYDkckpkG1~EB`3#_ZpajhTbY|S
zy-MQ3-Or|VA9KE|gy_f!c=QPCUl%J|ewN-ow!m7e`vXdwc6k-A>XV{K>KslL^>H>Y
zdx>@FLE5X9ukp~1iiFI804!2N)WQQ>6A<0Z2+tbwT0Inp=VCV<``Wt{htfy71~^(h
zzp@=~H_yl3ZGjRhzTR9Yj44k$U_(`A>wruahlmg-UvVC738sMTJQ}ZMabg^uKXMik
zs-^Oyzq|dt8alZp)g6`N+lv%>YVF`V3>iSS0BM!yhbu7a`~KGnN~@KBMRrN;J-*AJ
zmfL|Q*LZMm6ZCX|-$g?SPm8eY@@sjohg_U(Ox62)sa0QdW=iZ|2YFJ`@!fqh&FN)Y
z^M56y>uv-rIVq$T`WrB>8>29u*crmzC&fmBLr$3OyuRn6e&a`eZrsUKUv>fIVczq$
zPA&Dijn@Pv^<+LVVvp28isgw(wVbuQ*KOA>7<3yTY(&snb~q(Y{s?&fS()kFn>41#
z6o+JfG$Cy6SmqyKn$mK?;SuLSNB8&tH(dYY$v247?@{JsV)@l5a4K7aWUdmVS@2{x
z=+Px#bD_l$gs`cXIIiXNGeC<nHYz9FMV@97R6`C%p?cT~tnQ`fm@2}4>~%^~t7NBE
zxRASk#yQ<&BJ7OoW~Wj`12{;`6{C^6ZPz|k;&sD$P}?J?hkb4%9|>NQk|{{4jqxzs
zwQ=&9cCLB=Hi-YE=g_*QApTE&cDddAMaAqVVRu1H(8Bkmk}HT<#e*q;I#4`OUcQ%I
z@0!?Ac3g^_lNHtLa<Gx%G<?Ef?(Clx3q6tfBmYt<oIT}TEm*veDYkh4Gc9PG{%-Pz
zWtglF((9Ecp+xIsVQ2ZtNXP4fo)ecx8UPbnv&|P5u*hat?T3808y&hkeHxAgJwW+%
zj7)p621yBba|Wfy(=g+7-a8g!{0`@!E_-00fwdjYB*>&z^?iuKINhI#bW?PpfA%vQ
z?!H^?XGGx<5=I`%@!YRLV<r>*F|`><mL+2o6$Q|vLg0m*-O~~Q5!?;$sEPBg$YK^M
zByTR-J-Z}gfK8ou!|nDoz!_pNU|5}IqeSM9WlT#U+(;7bu6Q$^{SJH?=7@yl$yWH~
zq(H~4pSXbc%pZ4#2ocGs;nZTaIbE?*H<I`Bkl|@|`*M0=g@R`t4R@i$K0s%ct?i(J
zbGxbb^Q81Bw?N<PXo8&YO&wXE&<d7WsAXoUfR{B)-+FIC$05jo)tE)Fltue11d+mI
zyd-ngS4$kuZ#brDyLcX_O{`HWEm?B!HJ00vIkYnsTA->FGe4fEi5->$LI#?F#F6d(
zN!{>Lf8EDnUjlPoW?vWTXMgctX`lM+aN+>z8PT=UdCHET(GnL#7r9%p%kVEwf2jLH
zK!hr~xxOn0nM?6LA^Iwv@`y^|`8P0KV95|EExy2n$|o@_x#%aO*}kwzn_O;;*D({!
z&`oE9hl!6Febo3DBh+9hA<B8fQ_D>g_4%B|^>XCLXUya5JM`Yeqaq0-eI0e;kp$Y{
z=gYaoM&HRJyJR^=@Ys|ajL)-3=x5o5d1=BH-L3zvfAs&$p8deQjm48#_2};fB5JYt
zKR0KLo&5Gj+xPC48qi1hXhSmr(Nlyx^V+BR*7KZFSIKWKdgboi_`DRjuzIZFA_^}1
zLGFDjGK0v9{za$un&-U8`)*hoAB?8vkL+smGJeo39%Z6#`Q)>ippFcmx6R1Ul6Pv;
z*7yz5K$=6{w;ryGS7+iLmbDsD&VyC_2w^^un`MdW<U0$U=LD4(>Z{R1nEVnrIHSCE
z*}*5Vx??$`vOiR3|FxZ;Gry-e){6=jg+ZM&^aqb!Y%L5YjLQ3D6htYQw}Y0g7VZLY
zh87Z<ii%l~@#)a=mBcLB8>fqCCY9dsq;~2>8>~)PUUttH>oP{XTjPk?ra1;nO8Fdu
z_-cBKLx|5k(;h{-$+49<8N}q-+<qLPwMP?>xuRHGtXxiNfU~i*>t|%JPs$6cOusiX
zT3;j9cy4`|uWk>PWVWqO*It_UDMk+S?iJ*pf)0g^@2#-15e2%troq_35KinVpWD2^
z=AE4jbqy(^42=M<YmJ#yVgvUL6CCDo(``GNMyg|*bDxu*eCX0hi#O;w2Px>dz6oGr
z0y4JD3!N|>!7C3HDL;rZEX<QihH}S`nCwoR03JVwbu`?Lid?8^i<-aF2<^5(HWart
z6qjmw6UdkQX~(tt)V=~riFL%6<Vcg%`ai@2dP+i(i#W~?Q94_0Wi=)niRa>rJd8ew
zwM<_3GN~Rj)B9nFnDW9?9x;BMR=I%Q5Qo~h4wDrt-0kDK_eb7=hNiY|pq`Iq@+n1s
z9WI~UA_Mht(@y*)XIQsg8cnq>ZrdFyh3vaaVYbMn@}n_+<5tBaH%lqSST$89{M+2E
z1+ZvCgHC%7A?&vBM53ME)uucMK|eNcV5>*ok=cPHG@*CKLj=ZZ)Zb02AEf0f<c7x@
zS>s7m)Hp8!5=)9Y<*;~LDmoZXd?5CKkHxR>LIiZ*K&D9?({Mx42}x4Ca|Py<Y!;*c
zc{ry*AwWifhNNX))6Ympc~fZqKMnzzTOwQBdP!A&9#5u<#^USp2hnu{hRw+m23D>z
zi3OX*6&i{pH)4Z1uY?D@Gy$RXB^!<_?bS{rIZn=K$EaL`8{q;PQ>{TjS0sDd)EUjk
z;{M*7Q=GjO@VqTD+g*#arRmjRgFn?x)^DbeEkB<qOLNi~Ie0Kb26iLiO!xhpPLl`k
zE#y5PST_&8s)cu-Hb&Q-q*+wc{rBs}|0MJi*FxvgYb|8AIG4o6RTrs+h4gSstC6IX
zfq(YTkefW}@;H_5ok5KVRSpFMXWjPbHg#+LBw8PAF1g;h3Xtlv@glE>)#&po@JyvE
zLOlE1*;wtz?&-x@i02#qU6e?UcPGfhA@u%Xa`dMIG#v3bUpZeYY~jg%VzWF&Yj03f
z?)*7BFdxxV*)S2+^RTsQ--hOZ56_E?Lr@lEmMdk1W##pKGC9(86kYoC9l?^Z^Fz96
zmb3=c`})trCaU?!^<{U!n@jQczJzC5p4jaJ+Gx%-$`%kxKhHlcsLCIu5yl~lx}_!4
z^Ncg?B#wVwOACDa{72qtZj?L$Wxym|tD&)ESy!eHEe|m`1&*}zW9vO%e-*edk35Ne
zLII2h$L5drS-~E5TT$zWabV1Gk8mS?%ULq5-Ym(P(4-e=7UBF`mQs|iREleuu8}(O
zJYnFw7wATQrXL9~=}|9q*{IjR`P;i#McG#f!HE%#MG$E2ME;pbS;b@0VckB}!x*~b
z63EVQ2l7lqNJALYHI%znl{P9YvK1W{4Mj(rkYvHio#QG4efbMaOwc4Ga-;!LiDTiP
z^4OCCii!0YE*Zzj(5QYkykB^0ILG?y>Sr2mk37EUj=9YWO%Wtk+Ejm!Em<AXCx|y>
zC4f>=BO&;=%^)VT!3@~o{-R5)G#(Id)Rmp`Je*9_WsfpM=za%H29#dDV`(SAJq4ik
z)3YRgcVrKBdp==s9xT0}OAq>qTXw?{YYNCxw;m{fe)v6Q{fDf3D~s_>%xuMUiSYZ^
zZ~AjMNZWvT8gbpchWc45_9ajVZ|7bm5p6={6e~h%xVOTgx>Jc4U>a+jIp@3xrr4E)
zQk&IR7|?~~37dHmoOGK{s-!!kV=V1|(Vdjg_!9L5<z}9V+gxy2&ppsiuV`=%8dj+5
zEA_`(Q{HZq<e`BSB91!mf&4|skLA0x?(D>_Y-%;~^yyv+Pp*+X#aje6=bdMm8cw2v
z%c40j<Aq7Q+qqNUBa1Tlk^vnmj;_M4H%*pDC-`_P45Wrz=Xn^w#EKfu4QD;n2o5OT
ze19~#jUQ*H%5;=17B)7AG{9%&Zmqd^*Rh6u2b4-<K7Gwc*yV&|`cqOqf6Z?xD#D=U
z<O`ZQc#}J>6WAuDyl8%TRT_^vIMS;;Kn?4n8Qv^eJ3vWJ_(ivPdHtu+kH(O(hYRJ0
zyXa^rdESP1Vn$-8w8Ux#^S^K!{wI(B?I~bJQHJ_dyrn_iAUce{h_`4#Hf@anFy<sS
zih5HLoM!veKYGMU_}#BAP^Cx3J|TZLBU>K)*;O=GCGezTE3zS)5ObI^(~%oG*}e75
z#+Hnz{aluqVX=I6J<(}u$`aS%RGl>+vz$>d<m4G8rmd1!Dh3miML5C)gp8b9B@du_
z4ONP*LZ9D-=)a;$?3#Q!gV21Mo;S-3s=Ju|%L<8c$@dPl2SYp4l1c+_2f}l%!>rS_
z()qNEn{(o7kzS~T&QUFPVMyOi!no|~d8SwZB<GfRQC!Ai-k+1@h%e!MA}|M7a)OKQ
zbB-B_QG%i&GBIw==xJ<*b&f{5)3|V_&i=kqJ)-|x0nU0kW!bmhJ=nH<0^D7ewg^v8
zCz_d2j`mDKELM*(JVDOwfrbiv4-F^-|6nr>#2}hr!x9WDW}FNBNJ&32`b$}d7I|v@
z$4)t(RY8tj%f6PU$g=i;NN^B+q~{^?PI*ad6nlsnHRc{@8|gwrow@FZQaoH6ZDJ|r
zGahlXObLSUV-rV5{ItFq*O^4k>lz-}qPQ1?;p04kLn%ueK`2saIXRN+X9>idCo?LY
zXo{=wkU&A@D|Qk|d#0xwiphW8O((*RF^UZ-Ih8P>K{FxT?i0)1gsx=Fgny-F6-x`n
z(}k@;)EdeN$wx1Js#kP#b{j=Yw`L@nWFVr)$GX%zoh6($68cIZwQf#(Wu<rb22-*^
zeViH2bz|RLKC*Mv;J%BgQ73ut)j*EFcKir#_7`Z{sjSEgkHOXgLDFA~Ge7)R{%=wC
z-;Q^(T_63TlP1&bnM1$mIwEwRYq9{9jqj&i7^xDHMV5vdpQZ@`cdMkIbg^5b18UM9
z)b!RiJ5Va)Evh7@906|DC=Tup7l^B0VxUGo`+X)%9u=bUk|65TUz_}wDIyhG_4M^p
z@H5YbP%2VkSlmnNg^?82onYNO!M&Dv$8nvL5NVn`j>df8;(L8kG*Tr6)i9CHoz6(k
zvh8Bkepw}|$qR7p64#T%C77E1xa#b>jyLl)Pe3>B8x@|ht*bU9^lhvu*tQJ81c54G
z>rZoQly#8)s9w5R9v(~`Z6NWJ;xyS@HVzg>f^$}U;=`o#sI+pAsQ^DMY?ME~BA@Z~
zhyknPZb*HiGc_9$1{B&)&Sz_rMpJvSl2vTvl1Q!^*J49Ou1%93AFI-Txi)`fC%lWo
ztD(buX1z-`rbAr`;I;h3vJnZLSi!!DD2F}%#@}=F5N?@r10dakRe#q*IYY>@@Ea3T
zIUh@v2k^6;driAYV~}c^!=+tm6+h(1>aeb~d9IhjNM38bCX*T4fSbQ*OP8`ZQ#J|c
zwVI|``-|>o(<RMA>&|m7b-U8td|3kJru^sxE_(@pHyVjg1wOqRQCKWA6tzxNiPgUK
z$DmOKwNshLtUHCwK2o+KxKr!%B9AYN)&&ZPm}l7HxtPrvZ7rBvtD$7Tszwi#j~QE=
zibX1NFNo70++2s^>|4*a`n1j^zFkyR?i6jNTvPM(q>j)y5}3<tA6h^%c8h_!Ckk)h
z%$@5-bgK3eIV4=Lu-Qw{B9bpqn(jvXe+#>R`>rf*5361l0GSK_qML}bb*#-S8CH8T
zKY*U`NDQh%9mqqy6+Aa*<25QJleWqmMw+;{AN}ptx!uFLUV(B9Ap-``Cee68*y2+b
znJ;Wqb?0tqHt!4D(N7OdZ8{h{IdNV9N$uoAk)km-YuKf+U@C&Nz$QICn^3)CS&*Lk
zbN%#Bk7K)+OS<l$?oxl=t<2CGvI{S4IDB3axMERGglsDWuvJb@R~mc`&u#~`L1NWe
zy+@{EQSy^IHdU#)k{N-iT7FW>Htb}esPt*hj(3@-#86K3giP?3G^HZPvs5a{EScLQ
zGr4TlZ5<ExMLOnL=jWGHS{s=x`S~d<Ihl2QB+3?cuFigJHk!dUXru6yqBik|duta4
zin{HKyOGv0s>Ejm-<^3YzEpy5#!Zhe^V#T^oAa53{3GrC#4JB_wt;)8Oj|*{+<~kG
z+)+n-OXH;@>N_e5chP1>8}|=oaN5p)y=EIKwjA=fM>J6T1D@R=WU0cm_g#`rMZzHb
z<|iDW4CFLEpy4RO{CfE`&hxK^Ift;D;pMj5gX6Mr!&IC-HU>e7%@wwEfJVEeHL4S$
zJOxydI;q5lTzAso1HA}h{Rfv`4PbTW{_&K-%T>r2%mLt$G0TlITya$#egAHWc&H%d
zjqUMCl>_T+&E(%ecL816dD5W<N!Y;s6VG=)SuLtP5EX^3Fx*O-PAM+_ZHEGa(I6>J
z%QqXp!)Exy$Lj(89otaBLHHVT$|_Q7=x;g>>wgQU|8{(+S1CP62qBgfLV`6KWqm^q
zRH{&dwe`34bWdSCszZm$l4#(H*hO7HP;y_wdv7LzK#-b&5$(_K6{fys>0Z6jNz1I7
zl$RcMZlhB9l2W>X*Yor5mE`3Or>+<$1zCmwDb!ArjamkRa79$B7b3bhy{39)fPf()
zr1QLqi=myx4cdpwItnV{L|WK^-@6%M5B)-@t?2sfZyg2?SmyBi61}xw9h4fSAib@H
z)db4mQ?_XQCfiC>`2f9PR8>!ADUWN~R)47?csGbh82>iU6OpW+hBmO@pW@C82oieM
zSQ|&;bAn#<d4@DYn#gJ~%m!vI6vWG}6oQcOs!OIk$R|$*0ZgkM&!{b#YSBvx%^js^
z^EpVHs(@u1ILZ5LcETNJX?(&`zo*7}o)s<GzNzkUJc(#dVjccPSK%cfD&D_$QaHV7
zL<u@5G0fDxsSI?M7c%zRcykcKna%5Qg3$!rn6$m<mF4ym6o-2)EpO%~22KQe%Kk9j
zO=_%R6OtyVe+}zp_p3gUUt<&C@13f@P%*K>u!e9h=i1@nZeCsK{i_!9c@G+RPdP?z
zgFD1t*4h*PAXz^NFBD46b?3JoS%jq`LDG}b`o5Oqu@#s}+JEse?Y?^ww}<y;rTJsh
zc6~75=r=(ExqI@*JccEYFGgFIE%84fR1b-JKXFvo^*$*VTE#*20$si2nS96;iroGA
z0;%QsYF8C&bS8h2vJ?MD8COwh6xyrV0=sZA=pdeNwTTA@DjaV7FFLjVBm91osJ4mu
zHriYlxX7s&kS(zP)Nl(s$7frC>OLFT4;r+{Vv4t9$wHJiL<ej)jw~z1WpnMvAt#!s
zI%Fl4XTyU>tg;!-ao}A|sP2T*xrQE*x9H<LbhcM%cNeru85&+e+G9~H&sGwPXeq3z
z>vH{2ket$QWp3LJTN3|xFoa;6T3}mt;<e3^bl#=;hvX=hh-rA?#G2+lqln4tqQoHE
z7yHQRai(dGgx(RHxok~B+*ctm9K6PmQJOo}J4{11Dj9fM9}O@hZGJ5(!aLocKbGTR
zvGD~#4(vNC_S)u~?>wXI#mjo`oOrY0uCFgTg!QuUz0*<m@#tAu_L~w_hh|u34p%9Y
zIHecZtB5FTk7{S3AEh^Hn~aSUveK7kSe1aHDygt2oT}eUju3xIYIEViE}M;y{+Gor
ze6^)jnnLm_Josuayl$Tn?gd}Abo9V^yDLv)yKCp<3sdd2M3-`vzjAxMGc}qa>-WLC
z>{oreQ6$*I6uB<0GOO7s^<YRl8d@-^n4t#GyJMU|mFO`NkDN?NtjzvmCL|<d)4h2V
zeC;a7m%>9QKC7g~99AKfdv!`vfTX#9qR|z&c@$-xQ!%dFf=yUMNSs@nLTj{(#?t4P
zWDa;rc*@ofcuJpt%zaSKU&19MSd37^nF*u5D3iPa-6L3?fEP>5n1nc}6LpduGGq1*
zYg@%5CUG%kkQy-*8`N|t0Svre4VKME2)R2hj`;DS$do=+UialGDnh8L9F$ssISQV;
zcGJiCO3b`utxs*I#C{Bu*7=fn!hv4;_$6DloZXJH3gSSpRjNwCMPT1?jf*Grh>ot{
z|A@-}_-QY*@|)sEg#3x9gL2~KXw~SxieV9)BTJmY;Es`5=F94?g)?+dw3ul?*yVjl
znta&((%WtDCb*d*lys`)h8kvfmyMHEk+?NZpB+gxJNCn%x!1hP<c3VIr+e)nE^Uo!
zV<&V{nBW;xxFC~gAqkp7?skc~uXKW|xDF7`0<SkNm(+cbX{6Crd@M+8OS7lMn5ET`
z`_+*%!hBT7Jc0L+0wmCbye1bD2y6{(`DZtA^J(?QdnO&Y@M693Jl@(4!vkg2FulC1
z%Db6hmmC6HMLqvR2oPq)GRTlZ7z(w=IaZpzC}doo6u-fkRLnMwxs@Z|nfnEi5NTvv
zD+L2EVk-^SUlV}4$kFH-aj2(Ei8CA_ACtvi*S06Uf-=-9)v!puCqYP)BCxr?^EPML
zFjoG&E(tEa?F`s@N^}o58O6sf7?btmHnn`C4L|lEMqc)=t5rzpr6rk5lLeB4wCAjb
zdz{>K?cASoBQrQ_xnswctagV|-euHF_<hADjJmP=*L`^(<K3#i=Ox{VUE0)XjO=O=
zhP#yHpT?Qa{;|s*I4r;Kl)5vps}S&q6;aMeQ>ub>I3iYSNlQWYNNdY$Svhl742vd4
zHqT`ZBSmH>NOmRfzbLoenJc|L?ALoZF}YJZb&#}_#+ah-5hs0=IK?CMF9I8Fx7$ni
zcqml56^UF+kh4#%YsnnmQrCtR&w2B_n#9=pTH18*0$@~HqK2VdeS7#Py%+&&P6er2
zv!=kQST%`6_q4|6w;UG3)5nIR9KhQ-T`l@O!VUMXuq;`pNRh@K-alz`dcr*A4$V=m
z(66nnkTE#)GH2?AWo<78j-FVJ$L~DtD{|(}EE`)a1g;zE9b26>n)3v-JzbxoyE4%7
z9|QNlynN_F%DA$tEIzT*|5Y+-Jh(ev{_Nl>5^sCFuQ?fiWzwuyQ7ZfX_vc$nzv$+L
za9_?rho>LcvnTOfc2Rruv#(LIv12c6oL-G}ylkeizBE1Y`p=_~JthO-fK)r6<jBZ@
zuuLBzEZL;r!Hv>+;-20B>}lln5_mw)ldzKc?&@z^s-}cJb~-CNTu5Pr1nY@{LvX}_
z2bTG4eq1B|d?Q=S8@I1<LAMz~h$*Gs_Knes_4lKi=jz6MY=j)dyv#Q<J>$rlmo}qm
z>Xfz&=LYu0mbt>glnm3jPyj3qCM2quAJ-yGX~hFc0C(KBX^@#EU<aA>^*C%e=@%Uf
zeIsjg;`s$g7|;*1v4I1gdMiG`bGVkDW<(iMCPNLYb(Ew>2&Z{D8nxx4(tf$IkGq+4
zOdbD3k_B`?rm1~I_I`rTw8@&*zle=CL>U8+kG8?f?}$vr<0NzUh;!Eg5M`x{3lXZR
z%cKkIarRu%xP!`zk0YwN)Yc`NVv}byAM`eGdPf_ywHAvc*$~YH`dfyFG=Py!T6jB(
zjj}EvTk4UCpMYOcMYMz^TAwmAFf|%Y1jo4dy2i-W*>cd<QN^IKYjZPuS#h8aj%CEk
zEL2xal!HZL7{`Yd_vZI{Qw`L|v#`zRtP9lGt4aUJVMd#LIAds?ec_$3(13dG?Ueoo
z-5~HVW`#oFaHZ8;Iybea18r<XMPgr)OBP-jF2dU6P4&{<)&sBO;3PxSUZ+|A6nfKW
z1_H{tB<4ouFS=B{Ik%p{7!I(i)O|UjMYeqpi_|@rW!u&z#eB4se#=l;O5JMA;W{v{
z6T4Tc(!Kpc8wH6d1(3vs(Tnb7Ebbt{xU(e5bTFuB(@V8%tarpJE!yLaboQ*JXw^Ym
zQKRTA??$Ab@#pEZY<u|$B0O`)5Cp~zQ<k>c@~G!2smD>uTDBb#QSZ+|F7ayha_?TB
zsNTW9`v%o77($3S?K|x|lC&igcQyJ5gW7JpLvBc#7*t2bV^k6h3^kE*PRh`mnZWNz
zL+6E&J6#u$;eaZ02*J1b+Y39|E#@9HdK~Ye^&fTk|0Tf&kv*n#SN3~{y;SD>dwH54
z`#l{-(ED?l1k~5~IV~_P$Jad+sJMtS%sAO%VYzWhS#`v(JdE#h8D-60z^hymn_6w7
z+-ns!dofyi1a>u7uO#cDq1FB|7)sx!aB8@l#Dk2zSJ*+tzQ|v(J*KfR(ImFQ5*#Uj
zT-<|>%0RHb$IVzdd@s(N{Z_F33P1e{ue(F$mq891mlwz7+zC9t5f{e@(H~a8Kcbow
zihtyfAoXHW+P^=t;jp)~(ZRhjED^tU6Z(rTCXY|Lh}b+~R%+V-7UQ`R_06ovW(M+$
zj;QMrwRoXx3SwkmJxB=JqOZ(NMD|Wy=%D2H*qnJVO9d6wxRk(aIyzd?N1wZc>6+$o
zLQuD6UE224b5-$)w%?h?XLv$ss>#wvYhJ<pAbL{(hI6LQL&$^V$Mcp7O!`@SumnbV
z^7i)(4@7hEDLsfGAPx#Nj1)RVyM-BGKPwMy3n-{=M{8X7$C0wYFsPZpy+^mOxl`B!
zlh`Ac2w(d~l|MOXv!ZYvIUTUpv;xX*(fIzR#<XedpUNH-H~!5!5!(@s5+hhFhx1v-
zMhLKUZm7Et5C>xxYJ~w*@>slR>ITVT|0<y`;=zg}3$|&IF7<9tZRWMEOa5G#>YDm=
zsoBeccX@2XPzWg%Yx>$%GIm(WukLp98^=Ijt?$nSsoOjSel*0@^IL3dX^1XLa#6gH
z7=3)G@+gkKVXR|zPofiJD2sm}Q|tF|hNN7w?$Z7}HtaqPYczjv4>fVZK9bh~YAPWE
zu|*pbiY#xCo)1Db@&cI?qM0<LEw`bf2QQG43Npk*M)(&8?B>G;Edn1cmk$DCH#CGv
z@}W^JcFjB0Do9+hM#I=;>4!v+o0J!bmTJQbgFp}3;-=%V=-|zGqafq2S{K{lZ#D$z
zzd^shE@+K=nB>H!xgTguHNN_;`OOBG2>-np`?)nuk;g2#8t>h#GS~lhrn_4M(RI3s
zc{8<X<$KHIBZb<=!v~af!wadIOst$qsf%$h%$45RR}VrR$<R9govp}^!NR57zH!<6
zLpF+^iJX*WY<;SG+-fIN9}p~QG7{q{_86KDY0;ECcR=l$mw85$voik@0v8EC17{@V
zp5`vS{x7Nb@1L&#F+5<o!~>JD8cT5;U;0_r?E2*)BOj`xa`ChrrI)?ldqjLU=abLj
z^K}zKCi8J59M>RBJx(9V7XvGA*WnNf)?alzHHUp#2Aegq6<+SMZSaZM+{9P~#X2`!
zT`|~<7vP94{@C83@-f5qM&*rS+<dsuV@SHGL29;+KWc2ac@1X<^PLn5V@j&{l9Dsp
z)F0UGIBHNpY5hp<)e^HM+hdd4b=VdgrpG2@B^+Q$qPh0>1&V@jY0%iz<UD<xgO*q*
zM#LEx7d424%MHvwiA|(&3w^gP(~hIQJ_bhZ$~h;C<*Vqm^rzPnZ~4ku`nRj#S$CCb
z<|D=Odj67Al^zHZxQckWHPYPQ(kzO6MR-Itpsh~qvB3FSAi*JxcSw&CS!_u!juVZ+
zpn1y?+TWQ|m^G{}iFv+ZRdvXnCuFEn%N$2il#yUj8kdt3R`q`sCyPeA$7E)nE5@2w
z0P9WbqPBn0ZGw)NqQd~bFp>M*!HeZ*nIy8H+y=$`>QD4ZK9}&x<#WA<8pXH8`6+Ko
z(k4B|3f???96|6KjFlO2>%I*4!{6<m40&pcI2mtB&jhAg*4iT_j2ge~uqg&Ei`AtW
z=kMWn5E<uotTZJ8?w>qP712@_2hfp}<!(s>sAIJ<YSA6%M?x<i$#$vJYATQ~vN!Ib
zf}5w4l#HMmP&u~Z7hU?DtruJ|qEGi~zYYv%j@30i4VSvA%g5R0i`sb<(WcilsMWcT
zdJ!>jxPI)~NlIMmUziuRSd#-JC)LdA@e4<EOwR%W<?Ogg-ol;E111s0h9!K8gx33b
z-OP%bmQr)&ib3JmL<Gz_hvvA+V<9@8v0DA23m<gHxA<(*v_a4&(0=wWx~i4_`h6Gd
zI-z@F#Y^h5r~DAUMII}l8@>kc*mf|u$Xn@4(cAdwC;gf7SS?gu4|lzw^)8&|mrxfX
z3mX|d?y|z6ed1V&!>0EE(d@;0bab(_*hkJU(Ysk)_vSM)!UNAHA@|~ic&u0jXFc6z
z759g-*1#D*J0+8BmM#ya`{$K386T*&vEa#WwB@q*->j1Lv03Z$k(DyOnTn7kI~KtX
zptx=35br#BxEUlPG;v1iILmXo%>#B3wVBrKS-s?6f!27EV?WWs|2^&g^O=^67P{Wv
zox)z+dIZSU!o%obnzSPL9^y;7PNomJx{b`&;dW?=#X)AA*OPpM2@>zLc#9J3@&wYR
z(176&h2;?SB~jyXHVK%q4wu4GT&<f=tO2~?R5UJNG_)j)x-PRswJs>;uT5chbFEkq
zaNwoXNQFnv4dMJg`gbZX^gK*ty4k<4!JFnJ#idbGa_h#{9T$C%Hzzb1=fQIHypIQJ
z#$zH>H}6m(RzFXV@5P+7`xh?0(NCe)gD%VAt;m=2bGvX~yPR4n*AbB(XE{pIry^29
za<EU9QzyZ8c<W_SefjWvttAIlshg|AbxyYX+Uwvf&xX`252Pk$R3Ej`H{9(aPQukD
zhqDsGgXk4bRbpA7G%j?Ib_X<!>t|)~po|1<sVrpJf8gC|IePPEcEca%xxE3OT~iu)
zAwNVb5)Yq$U#dGtNO@-rH5RgS20aYk7p1yCyq!DV_Ja%z)!$56Yzy`JIv)OuuJ}$W
zuzE__q2sv!G($@-ZRVc&@5<XkMgrCnq8^2=2-iy!KDpu5I5Tl}V@AE!O_mCHdluDY
z+WI06yPT11cqqeG^f{yuBmx_+WP^d((`nngdDImlc+N67zmA6J7p<sQv9z&AYmv}!
znBBJM{bj8Yq>w1<3x1h<1?j`Zj_Pf}EM%e%K;OVS@SgE`H*LEwnzRo}w-eulZu9XT
zRxZ3TQGG-%JoXWh0rnobftnhO2k1q2Sw}I*d9+hi+Vc~;tMi#TE!N*@n#&2I_$_(A
z#sSl;wzt3NZoe)BoSPLAonSYd3TAta8`WJR4>)CS(>Bfs4&XUFeiXAkGvZtIT$%qx
zcd#_tC4kS~XtR96`6q};?x@JKF;jl+&ZbF&w~Dm|C1SNGOw&wbJ02`M=~c=l{ka9g
zy}AMyiM|{8WRs5WDlMKnr;_!f*fosGi!cQyDUz|Ve$i-Dau|xX%;^RwCmHt?s`1^O
zh6u0KKpLi<fCTFgMr%aB-bom0wz8kEmvELcZZbYs%vfuhvG0Lr83W}8W;Jb72}3FY
zZfAZ^<i~=<)(~vO>R)se5R4kv@~=iZtppvG-b$_UT&W-5{EJTiKWEkd`xZ{)5h`d+
z2!Fg!tG#QKD-cx*m(#&B^HdndNhVe<-|TB+nM7pt$eBlmUD{&?6w$?Ndh!7q8vUZu
zh~fEwi4pr3-Hv<Hm|nDmgAC5)#!1H6jHu!lnng#7PZufNJ|q^9=Oe{u<B{5*;gn73
zK-^D^7x)}OhG*IFx-T)T9&1AVP>VLjASpNFOY6@ua96*i7K@z7Q2c{Q+bWH8Gg*{n
z;ST1jhHJ6!*$MKa-TbcJlIoPrP2>FXKEu5|C6Zt())eiql`Rz;J-3&i38b$Uo$GxX
zrnqpj))!nje4{M+Gdk!wrKIEyfkGmkqzhTDT$?va=&aKO&!x56&l5UK<@N+Nna?h6
zQs+ok^rg&thiY}TD5UEt_e1XV_=-rV&Mou84!-i2eTczy9RaH1vO^bHVA)g~s{i_k
zMqr00LU%e;^<LnE)e>nEkq&^2x%35lng?&8^hR9Ba?Uk=OE)*ChH)Fq?;NgilcxzV
zYBawXacty^Wh}PjNMfYad(nU~QfDcy)n2WV-&q>7S)bKTnMmOVz(+*_@s!8(l${|R
ze9yidWR9}>z0-i8s#3b@x7Bmx<yLxw<gi>^Z+Y~NHWYT<ncVCuP1aTS@-Cwo;|(I3
z8wjE>feM3cgT+7w+J4heETNS#L~oE0{?eB9>P=qpO@06N{!cUQ2Ysbd3chF5!%Z9K
z=iHeG+|n*JxpyIBE2CO}#fXsDnSttq3JA(S+#SEY_*hc^?d6pRv<Ui}@y(y@*5=R$
zQiu;GVGNcJB>MqlS4-4k#0@b};sey(jrOUcE!hJ`I6z7C^a0-kKXz*K%nOec6KWDA
zQM=^M1LN@Fs{g07H;;$%f7^#ArLrZ<5RpvAG8oxIQubYjnPC{RjD6pis6=6qZR|^y
z!5BM(Ar!_k2-#(c>`4(7$>%rU-|K$e-}}Cw=l<t;{+nz5yx!+^p6B~GkMlT4dR?4q
z@C`Qt3p8O$kVgl7%w?^->6}^8v+8PJQQ3qK={PALPrMreIjVz)&&xDr?1$?GIG4Zu
zOmO(VQ>}XA19nN`3-rz6{*fzyuI_(}cjH@Ze0Mp*2LDJ~cMo=gj@-HvWQ~r&Bb~85
zV$=>Tv29>e*b{>GCaNqf>6;^2NE)S*SBv^KDqtHq9KV5{lhg`+l@X2Zuyl~?M?$G9
z5W*bPDRc<ZF3fJMx2#d>Urw>Skbekn2fZLk=Z3UQ8kwh0Y$Yl*)T7cr3)Oa+ve(ga
zVT&v{WQh@dC4tc9kDS|eB=R++dw9vbyCdcmWBei$J5$tb{<V^QDyw2sKO>?kIj?O!
zwNb}7AboK<0d6RsvuK+p46U!Y({acEGqKu{G2di$b)Cd+U6SH?H|0KAJPA=f96!m+
zN#9x7T%36xO;&6?bSA(W8Jk>Z%2r@(dA7m{H07dYHSqeng9vxPJq|OQh)WKw;1HV-
zNRq)>`cl`WKY1ve@13x0ciJu@SzqB!Af;d_DLiumuUH*x<};<=ckQ!(xYv@4clf26
zfHPs=4o{1raQ(9=G)CAd&@RGRAe;Y4?Ih(mL7sRw?0Kr|P69_C45h7CFH^JmW~xnC
zT5e}5z1*EB7_k->7qlpcAtpr2y^OcjfXQ0nZLTJMZ1|z{yUM+?;T`JkvT0T%e?ouf
zfdN>pUzPhE|6?_#o=?-^!8q;?s7>sbeu{hM6QLw+))&Sd<*4uF6M0<@_{DApGdw*_
zUrTrSMfVJ4a&PMa)x<<&{(B_#;oAv#y%?gmqfKLCboj`(cXMK7Cg_h(tB7-@u@6qy
zrirBY)hIC1x&7TI*H47tfT@o^OMiLHym;50E_qpWIVhz}&hNMr|Al;4N6llrM5K+M
z*Ce}0yx80r*^cl-m08~JzzW$<Z$e5fK^_;TH*W$ikI_Ps?%GvqgB65kX(@>F;EP?L
zR1f4o_k(hSk}&bsqya&k1Ux;ed;NMCHyJ@Q>fm>u2$K|$<<|`#T1_hbRL+(CqIeID
z|Ni4vRU73FK?i+z__v3V$HiM6C1)Y3rHQ}{=WLfYp3UpT4D&{tb_Ogyv8RtDhE|=q
z)0q&u`aNX+jUsTVdoQo5Qls+ksGWMpU8Bngyu{>2P4+Z8G;H&WA>jX=1c7&}E7FGx
zf4x?1Y*?vJLL%Howo=#HI9KnyjHUdNeiCf-W#jm4`F6Q@yX?!s>4jIels*%Z3pNOv
z5o7-Xq*03MRkBiFpy<u-e!2C^JbuE9w#|E}mVv2Nk;_;cuUS24DN*PtE!{O5-mjS6
z+494U%lq8<;@7a?EMyC5Fyc*^cI~-)ccM+2W-Hf7SX`g-a3bg_OrZWnMfETK8dwqE
zbbU(liEQ}u=Z(K*@H%25;Z`tbhP95SjR1%#EXk#odjrDMeMvQd8y0<IiF?h9_!73S
zp))qB?4Q(tH5g;|W(7AI*68(wwDZ1YE_kNQ_=XPxqsg}FD{9ZaX=j1KP@JK|CQi5I
z70VIWCs9U`!M8{212$?k_(e%npROsn@Ob%#-y*w5TdLz_iwD|&Jxt0K54$4Ezy8Ra
z9riPUinEGPf7!k!2dTxQs3A_vdR<cj`hUQ@xr*E$R@ZxWB<;XbXoladwnGyeX}iIk
z(R{f@j<u!#0LDgdjQBE09ZR2WpA8o3)jsc~=>nNM0Nc}BF8i3A;5ykf_WdGl3h$y*
zYt=SB3krz7>zca$JtF_zr(5~&rYlLK^5J2(mL^s#EW9r%{xzKXi3+F~1>d2phl~3u
zj`j~b)ST4P^Iep^ddex{)qt=yD|xnCc8kXpGIi^+|HG+*LWUmVDk`(yWM6G;&$OqX
z$w)oVi`?lkwWEEv&S#JQ`O4&nXnE_oF>``&748g^uVfO88D~zE=TAZs|5{Sng(+1=
z3GV(l52H9b`KY%5PTIG?=F`fqH6Yl|O<#lXtXQxj2>lYA!jbAM@)mX5>=&}H7*c9d
zq0|=pO5;DzGtKg=2ik+h!*3gJ5gn!d2C*=-f$c*J(tua5qN8bjX<Ql^rt3BI@B<jk
z`Ej-f{%e%-{eVB#%cpIfkg+zS$B=G~&WgixJGm7mT4uXHz;7{*z($QVLcBQ&nR-#k
zj2qtl^g|<|Shp=B3#UYK4lb#z|4lgzNYKVBiK*-FyXQ!RUO7jJ>_^*)Q)k0obuW{p
z=KcY6I@c->)k>L(0_a}<kD9|BOI)z4oYFtOx$f1ByyoA!HhBkbzL>XQ|K`Z#z%XNN
zYQwXig9T=mo1W{1YCdj^P;=R^Te3JV3lJMY%Z*BeS9?5f{!C^_n&<Yc$PZ0YHK!@a
z5gT;d^BmgSuWlB2<B~qyLG{FDCZ6D;Cr=C2N%@PX6v;t^vU#Pv*NcIn9Hjt}Y`I?w
z;{{~fw?jrt(^ej`L7;ps?wX$I%D+a`kvJesVJ3M@UYtw%J)>`<j6PJRapB7y%3g9#
zR*1Rvgq5se-PH>1;;?y*%@_iA@$j4YKAGqvtlp89wtl*^2@Ss24ARl2gy(qvQHa#K
z#(#NqKI)h=L|<(8%vs&Sd2eV#z1uu(#`|G{bk9TwPVS7GkDzR%$n=<Hyr-2Y8lm02
z|9!-j`pMC}Vk*hmnDvvPDD0;PO{%VsqRq0+nmpR@t~N}K-6r!IChAo7_;n)hkPhFH
z%U1uDl9DtR`zR}puiSjG-%mA<+@!k@%6u{g^VQx$H37R9BPaWGAG!7i3!nB?$%FSq
zzEpe?nXl0Vdot9W<Nnu4vH1uwk`EzkCr`VfnbN_Jsm<0b{s!5M#Sxk<eh5mhip=AI
zww;I1qV{x&j_09_10_6?F*I45n=dZ#eW_ydu^Z-j-=--!E5r3^4)-_d(PBIqM6NNi
zmNx#Axp=uXIR2JN?e~q{8fStj*(zDN(gaPfZy>v2h1$&fiJ36E=OiYVoA~p_N2jpy
zeOm(WyX-)5i3Y4;h2lU(KRCnao|bSezoK^h__)D_P<>91jUux7PeEa$wdLy8n;Rfx
zFASylt^b#8{pL=OKZr<MODK;kk|5pO%kK123Vz@J;ptG%{$y(sV}Wo+JW5}&9lMcT
zvGe2Ue-G00ar41m{91=KUHd5?@9<Z~e9sEYoG(f2K%Vf>KpFY2SG4=&@aw$}qdM2#
z4LkH|N^@R1I*DCX6|v=(JW_llqg|Sj86=gP|9+wW3ZdA#VKTGi6suk3xO-?%RO3)~
zNK-}ALoqvy5r)%b<y_ar>lH%^mbda5R3Gk`r3V`Jcr}c(;1Nq4a>A7l^tg@RuTS-L
z?sH_TMvM3jG&I`bo7K(dBeb>kX(Z;}XDU}cqwi>26(>cl&GR-(Bu@&<6{-NSB<(_3
z-8k`PORW!+ZCa1^-W(@bWfQR=F960~x6PVLw$)VEbmtz9`Za6yIQAkhJ?BYUHtN?!
z2?U%om>cq@<Oe6SO4nH-f&b5`=tJwAR)<<>ERi5GTy#axpV$6)ee$Jgjs2olgLuGk
zI(jl~V_*bYyJ3zaSn9Wj*XLeM)x{Cz*&N9k#%pwj74^)ifS2`%G>Kp5<twZZkf9;J
z#5`gxWOu;tilc0PP<+{*f%tIa?GFj(QvBpn6Rod<)+~r@DunIf$MYnLd9&4`3y=}H
z0qQ{JYu{~=SRXU{nGGwsTOE{Qyx#?KCdF)-+ib_BTVuSm8Uw^tT5&mWOQBl#>I68+
z)6Z#JV%%l$&c>_k))CiT8dvYJN^B(@?4cS|qVko;?@0-bKfY85B{GjYx9pAr{{gVA
zROahF>3#U!WW?{uw;W}E>wCseyv6{${{JmheEygh{)Q__1vS}@=l5jK^P<09=yeUg
zt`}-q`(f?NhaY=)Yj}%EX>+-z13k@2cu4l^+=b7##@)^N4;@hT1<;d3SkMgZ#j4VD
zXjqnnT88nbY8=FzwCV2Z*V|0)8eH-~6zj`|=p_7Z$(5AiMB}}nwO<Ni<-?oR<7HRA
zjPSVD%2*GHl{d;#7P&;n;>d+6u>+G`1dLOU;zE;^mMq8t>|a_FB==xr)~TB#raAy#
zMoP$klO33m!tSc*S4pd+Y?i`{zo1!7ZYu3ACKat+Y~iyb)w&IN86z3+Le+;Ed;0%+
z9;?*)Q7@ToohoRIwv_j+V4hneH}LDJ&Q7rU8+hs~DYm{DmX$7p(k;x3uC2EV*U+q8
zWok;+9<pD~ZE3%mT0J{y@DM<sl5?qB3DJ&=mLx8a2|U*m^arYtGJWHs^$*ExigeH_
zhMLz1BLZ7~nra%?{Ekx#S9*=<bN5QfCUAHi9jb?Xtsg<(5v(+05ohokO(JtmrU5?)
zMhPW3x-v)Ie+G}h?SP4tqN!%}rk#iBRK3z613fumRCBkOX$!$1AzT`)*>Na>sA94=
z5|oTBNOLGyC0bfG^tl2-Eo;>83y)iMxL(|{*|Fgz_|veo;NQSni6O`=1u2_U^OLrh
z;QmEA-I<<-<jEk7RLbJ+b~&`x&fji$3(s6KMV3eUY=8gz_|?O}SE||f0slpJfKIw;
z(c>a0JurP+Uwk#|`}vKg8x>pQxEi~B5e*;$yTp+mY1~(70^dl2sh}1w%0RbkUWBNs
zUhKA!GOP02c06<}W(QxlL$pACL6326TQtlhBU6e66f1RY%fBX>Qa5?TiA(-sBR)1{
z@UCf3Nl*TD?5+%7w}eHl%qo*M+MwLmg{9Bqb}kUMW0ew^r?m|8zlYcL$f&|PPyZBo
z(<Nv(@V==lbj>*Ym`Ny6LSM{}YW<Wn0JzL>6KcvHHcL>j!yU4T3Q3$?M4YBnIZau&
zT}=xYjAsZ<b<_4VHQVV^XK;U{ziS^y;4rnPDlFu4y>(4yeRPox@RmmtwH>dKT>e!C
zu7N~w^<fDZLi~bhJEzxLON4%l11@ll>Su&9u}4|w$ad&A0zb%kXrv?MKu}5o0xvxx
zNfO;yP623>6uq<PpF(lSaHi{$jucXbTxI3ZZ7i>wr-N$MF1_O$sWH7GV%g0KHf1OV
zQ?FhO{wk{=xERJOM9%&q#RQSnL-TC%kAQY`vP}ywVTnEUhxO)#@p-jg#GK!S<~{ae
ztKXaIIrFzC<I_#j5lNlpmAgoe>2ek#lq6=m(`B38>7MET^XGkl=YQj)-eARkFb`RR
zh<&?DD-Ta5tEHS4uVlKptgUj2m!=X-pn3C8b~<&SY0`fJmRZb~N<fF|#UzbM`LS)j
zZGsbKQtpQ^lR28GW~Qq}a)}uZD5@UUxtKp_P7s$F2NQ{GPT5%AbPDNZ|D5`z2ip#k
zQl1PioA{o~7~L-8GOTpn1z6M@WEih&#>~%NzD&$DepfgkR7=omHA`!iiAf^^9WTtK
zrN<M_b3P1?xCS&#_Hp4@qsG;7*n6BX8$65?xg{c%P2eF}afEYGwawkM1FR+e%%Ny4
zoykc@ZHV}AGFbahjwaa81J!Gh6Z?Ry0Dw%z*C$$AV=r*#>T6La6F)~rRf!GOx$QUJ
zY`K;1C2I_29ZE4XOm!O`0pn&VUXVG2#d9uY{iyw5aeFBzr#`$K(Jnm2-T@_hyB(m3
zHr>-eSvR6^X)P6U+3te=)_oRnQcQ>E6xpZpU*J+de3IOyGP6(RYH5;ufhE5@JZE#-
zhF}RJqI*=m4a6LWnrj1IoyLf$u@|$id{oc5Z;o+GUn@;CLoK{R@eXpy(pI$XT|eJW
z_m#_EK`^?n-Z?-=ud4oHB|gpFAIorg;{G@P%(+^*pGoE^;PStd{Ay6~%g}Bd+<m+P
z|3svG=asbHR`?rFR?;K)u@66<$9Gw|9^Jio1Bn2;g#~cU$eB%LZ-3!{)BBsIeWDHK
zSGB6<yfh3E2AT*1^@BNJ##^XvxpZxiWHB5oX+SK4sU&ElWCQN&*n6&BC>!cS>w^aA
zCjgZ}5^R_X8NytKhp6aO{vg=v!G-EE`A3X?!J6sVMks)WqdovwkkU|BCm=3{^#(G7
zvKBe140=tL4}dsR%nf|ACU0y#>qET^6!2<^=g@7icnVOc*_;Qd?ovd*pj)q{PgS(R
z>}t@AI>KIfRXDEZ{J6R&Z;(d)IYy+xQ`meJw`N&{D3ugo@f_G{fVde@;_GR-<IIa=
zu9dOi>05t*5#PJd!HsZ<lC|;+7KRd(RFfMHW?;?2(8^z8;FZYdypW%Efd%jEM=X=+
zP>pqMSgWK8QY+d0D(9iPTeu>R2tH==%({ay0pn>$Mn3dGoRdLnEAQ{0l(=TR36#Uq
zW?5&z{tATOkUng0CxCi#;&OIrniXr07(RLBbm!&oOhC_6T8F-STVd6cK<9nM5x>32
z#iszdjej2>>-pY_ziHT2F`}i3Op8vXt=aMo15$vWL&c097?$6(LBq1A*sCx_RaT02
z(=SyRzv*s|{bURDS+a}J9nKwNyU=j19S9NpA^KAaTx6rASv}NmA8U`|aTS|OFy1nC
zX}^693(9mXds_!;5&mS64p&KS0aZP?3G^ICR1Ip9{20J0>?K7Cx=cFu>h$wkT4wcr
zWK+lZbg<tveUZe3=%Xyudb+78S0^PM#)9>_a85y@X^kF+*##Kg2LLWu<N~C%<A(+u
zCQA~rbTQ^I<9(#uorMy#5pxpk5cF$dT(rDIecj-Dqr4uSV@??HsuSs|22!(uxiaZ;
z0-idU#%msRKfbgD>~SCDfMU#q`~vOVpxo$TyypnZX%n-<^EQIE%}|0ytU2G~Fg)d@
z(bJJkfll%9I~!q@-w)4SP9LBvPDP}#p%k%)0;Y3Ca9-c@xo8`avfYbn?S1w>92q!=
zr3Y%gEhmvW`9yw{SdZ_k7ru`bByA>lM8y4*MjqF=g*y=Hf8H0A7s_!huXIT(iT(Ep
z-N~;gS@LO}(zC&7e%vZ3%+>K2q}=`o;I<Ny1A)SDia4mJTPNY%>UaM?<WO0>NoEoC
zoytU{$F^C1DmiDH*Q`;}7c&;aePNF|s-bz^!%_y^F(SkD++osM;+t<uVy!)7&I~ez
z1)<2m3&lhuCO^9S(MC_1L?#IepsZ$kvPA~npqt)#iP9R*2ix}gbChH5%UnGiZK7%Q
zj=NO&Q=C&21tT<j%L}s`AJ2u#XrPO2++vXNvUsYSE5pz#&E>eGd-dES03DCeIe<|t
zL>%m?zlFx8)@xy|?~1iw;l8sBZ-p&mef{tgYtrX&v9e7Qjbjzt?qmaynCEO!D6!sC
zPV4E5<8x+`!qXQSjxK85zkR8m>t<Cm`H}DU201+zG*`V4>>5E5b$lhWi8A6EIKVvO
z$052X=aRZFEf3H6asCE^ug}PGxuS)vzOx%WXd@9}f(eU14~7T&UjZpEY#F(XC$)WF
zrU|M`HCWK5r9b^y#8lqL?>V2LJ2O;Xj?yNoS-Z4}JDthLc-qjrT41A7XY5K!-|%a|
ze^FXzJ<lu764yI!WmYX(t2vT9>&z8x*C);6(RhbC^yguP$}R4XRfm3FL#A;%F<Og)
z*yK3FN8D|6ufgsm0IN*13kb`TMB`!fk<=smul`IgRvz6<7F1C=C+<fHO}+5+D$pfU
zv;ZF~(advc05yv%IY&ubGgT?RZy)41Clj~OhPj_+#bvy9PBS(4KA!g7zQsXH_ZYYg
zuO*bu-2@0-Ze`J2fSO;dk@WNS%VeGw&LY!$`+1=ab=mx6p(RLmRv7sN=oeu?h(f6V
z+b-Up;LNja6YDledHtg5qEpP^fgII3xg0q5Ov=9GK&J?)=NAM@!>RVPzsl-2s&U25
z&Bm9Mwbc!JVdiWc;VLb^GY4ekNG^7WJuSFUY-YnC$Y$u)!(`!i_F^)N=?4yuByNxx
zO_@3xff9DDs7d3H4|$fMzooG-Ii6A3G_S>())|9{PNB)U$ZLI$bW$GwuKN+0CJRRz
zh0>-@pDdQYFO7ZLXQ_B+Zkih|I@G;9{SV;$u5<U7>iK))-M)q1E7uIs-ylsTVk%Y?
z&&U?Vp+e86|JA(mQu1ekvtZk4wckaiHf(vAe*i~qXZ8O8D4b;z2&HAO#_{AZW)nNp
z4YY^F3t>x@23mGq*XsUBcg=jk5j|EshAVijB-6d8pLUsyBrA?p#Y^PBEe?`ud99iJ
zPDZ^*0qcZOO1(cYTJcWw4aO7T7UaOu#%YMoVut3AHFraYi)MsgpYzi-QP<AO8k}uN
z<t)I*m0kDY%(WgInRLZ2vSneDXQwDX*nERqX?M(yx7FRB4N)uEI5Ib{{mi5L+=hC9
z^JeFmQ?H{92(g0g={T(s8I^(KL_>pD>eZJ*1#So4+F&++v1@!%OF$IfXPILWX*~z2
zSUu+SjkwrQeF(}p)Y6tAhq0MEs$x|cQ|ulYEJVqb#u&LM8$2)zisLM=<N%lOK@EIl
zWra?WP9I$yMKxTi3Zgr%i%UL*8`)zjztQlqy5R;JE)eow+r)UG?(P-wuHE_K`H`1I
zNKj{UB>1>1<wxas$0+<%iGt~OsPj5g_N{!=(5`lxIj}4dynT2Zps@DuoOfUyd4&%>
zI6o2XSbgx9c}($VMy|yPFk;S(+R4&2#rNBzgV~mLHsdKF?eSWxSKp32T97y|6<{m5
z8Y8T{eN(KC{m60mLZ5ZEuc8#UU-7ScDRa}ol<ahiCa|+}qiFu19do+p7DJ5Ea`zd1
zp2XoSq!z7CnST1&Gxjpxo&q|O;OrfQ#N9`$GKl79`$%yQ)R9WAJrLWm+<izo6pb1r
z0zHVJY@b$QYBn%DhPsf@3*Xbg0H9Jn!{$&q%49N{sZCSqP{UARi!XHpJlN^TVyL2~
zE?cjuU;K&?c>CiKWU*H{b%%fLq&6jx74oTIp7EQ=**O31$zP_5cC02iNIhTA|Afnx
z)LF#kmw>1u62~7?nx@x_Zg_yG-;iV>H0XM(xeTA4qYNbB+@1!A2x<nmr}#lqwG4*r
z>@;MJmJnO_jOQ6LQXS!p@Sk3Cc-!>`aruN-{&pD#h>NKB3H$XrYT+>E28DsJ8=E>A
zXf#HUq?4YqI+k_D)Qex5f5TbW2=hw&2O#4b;en~BS<X%hbbe85z-B~J_BX?tIOUIM
zyYD@M;Vh6PjFXEicL-WXCg#>#tN%X9AAc*$p`TeSJ$YKY;%Oj4oIdK-M9_;=!n?|L
z^n`Ef@y7#?gC?67Qq9MQv)CfJr7e$OMtcboB+mGq*#Ox@X2_mNq(TozmgF>gr{4==
z9Bfa9%XkwWO7a9yWyWWWAK8j8vLrN$t5RvTX+J2KZaRWV$moy`BGJbF!H`MMpD`WR
zEId@iWUnjfc+8%uj!$Ex_1Kzp<In8r)~p#op9VlrTV*a2Zl+$ZGhg}`6)ehKkCR!q
zZetogj_Iz_qAKUpxA+KTOU~bV6Tbm^dvy@riB-qnuc!xGry{+&@v-Z`eT=~sKU3NR
z#%6EamJ9qZ!x%&0oTdEx;-8MxUq@=!g{;@<-xL=TEaedd5of7lXk|w!2q=dCDxS8a
z4r@pyYv&E77G~!wG(*b@POjej1)<t}q$_+#2u}f7ZNXFE;Xvq5Q7w%*?6sfv1--5a
zsJnR|6QQ2|azUM)A4wqQIL6s;%ZYYhUrK<(R}GnQPqHZWBqa8eM2V`2CpK*i6YMG_
zcgrW*$mLP5_IG6&s}dk4M5ecv7^K7f^Zn2xh(cbGNn50)ReaaGTg@SbE6w6+%zZ02
z4&B9S^`vNBV8QGcKJPlff2vdFVMJ`{Z4x2~6Y21irVwTJDFOAn7eT2-iM85_LyW2M
zU7Clo6V`?N*Jf23?}B~52j9|RZxQ^z{a-U!RYH5<Dm!XjPs}WU)$g)*ktOk*K^?5I
z5yG24;Prmps?jjB;!1Q)nud8>_Uqk#kpL}a))ar`H0+pPhNG4RX)m6>yQW#FGTG_A
zwSssacHtrc4QSo7U@FsnGYy`km7h4VC1|vAfhHGS_Hqih2jn;v^h>mR4Nh&=c6z``
z6SuANTB8vy7GnWy%BM6mZ^zhb@EL(By;v%25&M<j76F1aX#sip^722DFT*?;i8ja~
zZm+8PoX20(3--PhU)=`^Eg^9M>I_L6*#w;4(0p2C74~&{aSNN0QW)?$TywRdD^_Fv
zwzgl{UZ*w{=wRk4pkCrZ^K2%ebwmOK9JD?wUMgF>T&?$UtTk)I$n^l4A6p;rmS8VO
zpXvR;(fok3&)SUc!r)>;ZbOTyra4o^k*-U&yD(iDsWoSbDyJ7>nG;5NR^V<Bmyz?z
zZM#Hb$$5*;?TeF8pw0^C363#iLmAsW(m0pxSQC#7{v94?9<E_^Wf2#4WvD96<bZtm
z<Fjgh@84HVr^=+=e2h`c2OI9=LMLUN8y!#oZ8O2j)9>15?bb+2pLFU(oKC1_Z>X5+
z>2SZOe*ZAt_Fef&L*RBz1o^7N>s<=CHhEw#L1CQ1Pk43ZD>Gw*Bf+BjknUn}ck%Af
z(nfYsvfjn)*Ch)bR2+N$RJKc}7T4M`OyagZj>O?d`z~F+4ry&ksxncs%}P|hkwIpY
z9lM;p54gvmPt%R48LjMid;bOWAYJc)sD3iQI)A{Ce%8tH0Mh+ZnCDHbrzC}Z2+G>X
zSPPDeYjvvU+#N_5pcx)Nrs#X_9iBJb>1IOKYTVr+|Co3kr_yk_{HiD%^<Eqj_H>T=
zZQ!|7s8sI&P3&}`aJXVhY3=#rV;(--k^Q=oNzm>C2f6n@ie;uK2J)|WGrn?GTPeO!
z@sH5VNkA0*jL_)FOs-I=Rqso2of*6&oDti}TfLs`;=fOlGoMklSdchni$q-B>&733
zCrUrqh<BON4ntWTfwHePeGBL1c%#LIUDKbGzo%6rku{Vivw$+`rU8rQ@hRRkP126y
z;zo$&PCT2&xPp^_>3pv2Q<K@uqRf=a$lea->N#uX4?z>z87RFH&5knR%IS5Uoo{w3
zEQIPTg3Hym)Nvw1Sg%J$R0^zak|yeA4E>PMC^BB?--ApNXV76|b*j20zcn@b!k#Pj
z=w9ROFmk?KEXoUsliOC4s4ne9(3&Q%-vHi6|B=<t^?udlSUGg|bbyN=8mS$sILp3z
zXAm_ruFybQU$rfg!WS$dq|~?PyI1NXwfUJ7j-<lltui&uKtouq>9-cS$wrCVZubEb
z^30Wwvt2ni5XgGRG^99pfS~{gjxDXyM+mYfOs~Y^$gnSda`l0A4g0h4j=FA3Pg^AD
zneau3DwN7i&|8a_j^+TQ@-3CE2R?oirlEzf)W=WViNFm6ytaXp8DgD#^C_7VnARCR
znBHbR@Y;GAgfRto7Vj0_2GD`Qm&uAnKvdeGz&&kb(B3a`Seu`BkTBfwG&7l&%NOHt
zhQmeIfy|??<4M+28Ozz0qY7C2vJ&9KOJu!C(}^HYnw^J+r3%zDy#R7=qtl5Q?lf(+
z=Nvu%VLc_^wOUCz2^OCCZj}$eSY6}qE5CsUMo7rMoJ_A*(DSf13QG`b@_lk1739Py
zm7}0;i92(0H?8ED7;p=h!#r<nF^xBpm2aKY5a)4<cce+(I_~jN%k78b8Ak*3^k3N*
zGj{MO#Z2Kca_hKZmic5sOe|f)Pw<vQ?wUugKKtSAI&M?9toXM6u?VC~O|eZSMcefc
z$f-#{e#IWsc+S4s4iE02CPfOmtC=nR17MMcK33$9d2&!$i9Mw*pPJCe1`}jy>I5v6
z>z`-a)UYgt>!P)jlMb~e<$!Z7xBnv&E*gtm9*tQ|$IS$a?CWn$i*p!FcOyz$^1uQ)
z=exBL`s)*uuxW;4E*%kvRZE71sy;FCr{l5kL9_KoH!Qs*jkg+dI%(#Z?rs-4-~;kJ
z6&Vx((7{iO=Dqj<<KZmo2#^l`vfRgO*xbsnV;HIHmx@^xl(!!vRL735_35cvwBx*C
z;xHF-$~_1By{8VTU;`ui3@y!tYgaGGJ+N<Z4SU8OB+3n1Vb>6BXG-&c?74CV3P@hA
zXSu53NyEiHPKwA2m>L^QLTrA~B}Hn7;j9;HS8fJ;=~LE0V2Db_Gfx2GlHHZ`m^(c|
z!hv{6uGow3OYJ)UGXEfo-NP2at{WhBt&J=dt`x^l#o@e6kK?`m<fgozaJC%syju3b
zs3V0vHNjiN(UFKA?QV)|r6BzLbJI3p+racm_}XqlpnF@6B*;x0(Yv|=sT4<KZ0bBS
z28!6qG^HcZ5hjW-WW{p!%qMuQGBJnx4?q?s+~LKuC_gsEfWaO6OWUobPppl%QRit|
zEOK57&@aQIG%_wnJ+-Z8MO>P&FpM9z$0Z>3ScFeFVTe{+7~~hXNO*>Kk6(<Ywc+BL
zjqzZ;BAvdz+r3h909!cj!pGF$tE#)hzZ%ZTqc^>xh79H-i+A+rK}A5!sw<O}D%D!h
z#IIo%qEJdPM%cW5RI&GQC-4uGm5AqU+MS8OnEVf5c6rNBq{QXUMUmZn{L0j3u|<~H
zy|{L@;f7;_yZ62WE+Mb}XLoq%S>Hc^9$!AAOWZ)lSCF&Z#Rv(oiNZ?*l7-i1yjd@J
zrJ4o(cfEW){d1p=_-ea}EXuyGJir+y#hbHpF?J{o8XcN|9lKa=mm51eh7+c>qptgD
zuZmPxe*m-PUwe#bi_N8{)n#zIA@47aKXj@WTPO!r8mTfMZdj#g?$ub{(-tqa;941Y
zE}2)3&jw!w%yw#UG|CbzoI}^nkAq4~N%nJD8d60p>BHX$U=F{;#nicnbT^_Gh<2P_
zyDuz@t1i=w63|@#0FuoKnOfvR<OZjzF0@Ew0I&VJ`U$r>Jv_6m6I6v-)Hf&ax)Zkm
zr;x96Je3H~d1a7@qGIp?*YxX2FD=@xF1ntha=mz*o5coi-jr0O;e~4P5f|%Y>Ky{1
z>MBW}S-2XuK+VFIHnxl>*&JlrUghz~$daL!{{9QBC7Tik>!f|8th?!kQ8HRGgrnl~
zu5S)xk3xP(BXiTM+}U)*^Y2}fXFTEv8pgeOZ*G>JDyP*dx4Jt$t$0g*?|Z`tt40LR
zA||{#N%3;+@>sc;D(1SHd7#XoO7(kH9b+pc=IGiTNUnd(*Bzsr;5&!k250I9+KYmW
ztVyc#N=R4M=hKwl>Wj+;QN>;#+5EuuRyZ7_-9?bPHkskt5OY3E8neDzZ^tF8pfpsJ
zS7CmbE87w@yR-LxQ4`2nDCjqa(Q&_=b`!5v?BuGy8(|s3gG+ShA+{Tp&?7zv<>ySv
zqD}bqU!}?*erjj^rH`(uw}4!WuBx0!_;7?gKk8#VW=HV3!EfwSv&knZI#^0_6Cb`Z
z|HEP8>A8ph5pR6=rtI36IF`koisYr9kDs}ovI_9S#}7RaH||t{J?{R^N%r-cAx&?N
z6cyyH>lgdxStX>cO((1$gtUFz56v3qF2j?<fX_{|QPYRA)pjXq8n;wEoDJJB(;hBb
z$raS~ae`%iz%F{HiAz67{u*&<-HQ5Gzhf`f4~FKIqt0cU?_DN9dR(dRN1c>ZWF`Ch
zLU9FKlz^8DSR8iEA`w~;Q)BAEl7jFk&`URLn`IKSOf=qERgmP7f6YS12({SPbbpfh
z1)^|B=2mFp81z6%-pSmal2m<^i}t#ssUbF;KF$*y<Wz0h#T;P$mV}ynEWJ#~4GyA*
z7(EC*xEzm@5tkeuK`-tZOfBxg@LERhUH6$72&NC3ND++2P59#RP)1DexR{bkg96eq
zduMWZw;AF_l4f-g4{cQOY;Os&hNJ3f0SA=VPdaFM5L}NG{^h8esO^cUYE<#l4oiE8
zuo;(k`=~|E-|>=$=T+rp7Y0w&@5$sg%z5>7r`t9EH4-$h_-N^+^Z=?k+wkLK#h+_m
zzsIeWFD}DfZ;f~B`@pP6MV@5_$0yW&bqO<+IP{6E*qrjt`bZN)_A(5268=gk=4iVU
zXp>|&mXX23?UXP$muNP&jxN!IpsbQBhGZnp->5KO23a={u^rUtk>7LN3|-g7#6(Zh
zdq?I$c{Nvzt<qa3DbY%n=tOS~A$*X$wEp{pR$^wwPtHYbnV6D|`r4r&b@#<y95H$-
zgK#<R!+Po7M~uj>!PvDSDHbu?VDgK`@4O3-We%lBt%?)VTj%lGoIl{-wRH3X&KI<L
zTH@tV3<g$Kj}+HO&umNH0{+dQxEC>hS8ew9k-NBh1KeSMc_;gjV<f2m9Ap+^LG^u8
z_mwagUR(I?<Hm5Xg7Raea%fnfStB2w5S3Rg?&nltkkVt5%PUb(A+IGUscqes)#Ruo
ztL)$)$)ZnLn>-XM#-z!MbEh|??x45eJBbn5Zz}QjG^p>w5CNN-PZA4$WW3@2aPQZE
zqq{K4a2P9$DQh*7$B>0xI&`%0hjvIQ?jm(5SHLs_?!rJBJKV#F8V3Lf?rA-1XT*i*
zc-kg217XG3of9UU>rj4Xa@mFVUZ{E`S@v<fQUHWuP|G$upGXT6RLPVe98w{vco|}3
zMw1>NR9M^l1#Vtkq8U3B1ql+pP}^=4<Ioy1Ftu`OWF=`itGpg6N_@UXl{F_QmU0+W
z6zoLYD<kwnYwg&Ho}gTa_@Z3RysnY0(|BfYyI)#+JLI!)LCj>I*LG-qT@nBMnB&ci
zT7;2~i_H7fK6mk5l-xqWQ`~I7ym4WnAR&IJy_mFbP*mWL)2Ug=RKMQdzOeYLd(*9I
zCdQ*J4SD^J&80U{`L1%)mEuNMMif@=wC}Vi{SF%|k4;>sUDExOff*<gcmD9vW5wZv
zIg!A?db!OvhKD;#Vu6?LHW;o<g@q)J=l?aJ%w^wFHRCOFK>OCn)Xh@Q$}HZ08SV@h
zPrN-x-CJa|>9$^m@$F)(Rw0v3i!s)5ofugb>G0$^gA|b>d0&}~gb`u+E~Z2FrI^X?
z9aVY*i-w~cQG0UTO(2tGRVeHe$Y$b*+w|{32h(J#Sy;9&u=)}w38OAzsug-D1J74B
z&(~8dhZZ4<qu!9bGtCx%YW$A4Yq-5{tfp5X1?1z)9Hc?nAAf9l89CIHOIf}9BmeX<
z2jI(Chj*jdXl)11cIQ&59@w!enSTlWZx`WnsPq*?9)ULY70z=klp6vFNUetOe19)!
z#-Q@16XF+n7^?PbgtHv>XD@;~-X~9rtLIlpY)DBJL}&i_!IPp-A(;$)K4H_f%#&74
z?ph(3FXP92DxdH66F(n|*htmki(MQsf&P3V-VercBppRW`VeJDSf-7v^kD;S!0Q0o
z&Q710OH8P-w5a>tPLvK;p$h_eQzFYqdB|MQ$@55%5Zci4o?{39G%Y)F2Rca#S*KHN
z25RhGUy2D0Ijci04U(t&Vy6vs>K_l#G&%}}FJ=wOyJyHQG$ixd4+%NLdH=Olg6T}S
z)F<tdm$C(wq3+465T6oY<%+A=$b?sQ<AwDwy+h0pc#`>G<-p4PRsRFv?H}dbA~^hb
z?sYwMBhanmbHh(WkG7It3&C_=l>*n79^W|z-j37%S`XxE*^yrKg6~wx-zI_@u+&`(
zDB935H7%^Toi!tgf&l|Vxy^W-OKT@Ntt7<=2AZj2uuzAMpS*VPwLEL&EuPn-o}R;P
zSy|;Gj&Zea0h3$@i%HSuw~ib6EjKHcB~#>m*)oN-kl|Wa50MyIr^&VqFiI3{)to)P
zl6Om>PyCk!-`&c&d9(SeM;SvC{#$t*bs@|bQL{hmvtnv2rP^Qh6!x!Sc{&B|uAsA5
zPwlkJIOs(l>=5ChH)qnqPg#9?Xfu#z(@ge$rH^L_e$1<pZwIQ~dg5TmrytxeUW)Qr
z;?11%2`B<LeGPrQRG#=%)6e(hn}MFz_Fv-9dr=_;^OPDv?Z^3?oknLHVTUsUC!r)2
z@c^kpnbuh9w@Hj55p5zFew-+`iEm?tNsDA4HGU9z+<7?<+Kd10<W~*Dh!J!$Oo?;x
z`oT_-KTWL`YC~^kjV+E<b^jRradG$E3+wCS*bz@^+qexztMn^(1reLRQ1H6c9N}$l
z+5j=3yv{bbA4^c<ioy#c@D>kjOg>>k@<w|EvhB^M3lJX{-oaYpw50<fdh^op?H*r!
z-jD2ijUl~R48TnD7V$X`!U7|8PjsCBuyy}tF0mD-I3T)QDmya&iZ7m?zR%lte??=H
zOWFUq^ppFBSRbJ;WP~5W3fCF=2Y_7v($WP`(R(G|y!hYdMYPt0ak8ATY2CQ=)*U^R
zX=<DM2p8b43IFb*wNSyW7h{39f4<okvoU=#F%{|+N)sRPoO{y=yVvA@=cV&+XAUom
z1Ua}44WPZj^O!dJ;K;PSaT4@-qmdE<hPp0t8*d`HXRVF6HhX+44Umh|<EPWF){>wi
zOq3AJ+1#^=*B!r!{Tnq&!C3yy!4XxN{ah<q`nwT4dkeNXa@|$n-4V4oU^OCw;hQ%;
zVLQW6m`BXbXfH+|b+z1n$1bx`_yqg@xr~DzYjo96Yx$aU>%gQ@Xd0?_uKN5#a=@Nk
zub6d%onMt(grQl4fip)|Zl>AJSXset-Vh;sKz7zO(YNw*<8RjTxR`1Yhx{dI7-yiY
z>W$}yL2&&iNs31zZ(e?WHN2)?D?CVmQHO%$PMT(_v)8fT&+M;XE%$P4tAu>BE0Ywf
zAl9?zrnQSf$V+S1uJ*&k`1K-1alaiq`CGUJe0S-Op+OIGVKEy^n0rJ*>WD}%p`2~E
z)=YJX5I<L=?o=*j)0g6{jW)a`bi()~SV@7Tz*G4TKsxbuwlQomE~hDxQ7K1X(cAHr
z#=AcPv8ytP)|z}S%jSz|N8zWPF>yAwEIs=RsD`3vMarFEuIZWWC%<MKBhEjkt&G(j
zn!D}0EuPMt#v4^gA=^(Ln^^X=+6cTDPgIus)KEo~@GETt4;?AwrcjSgp^1zZZqg;{
z>0+?>CcDcOlrW*&fQg#`0ITdrLw^0!dl{gdw%1DmWD(EE*h7l*<;ikUW5~l)H@)3)
ziP?trnSMcW71oaYk-x7$T}xt%&9`_kbV)1(BI$R0uaGcQE-^-4-@zQ52nfJN5|JO)
z`mCe-ib=KgP$Y_P(P$xkUX15R%7^IGYK=bvnGJExJ)Hc23}ec7-xkP<gZnR@p1X}z
zQf$9KRi#p^?Am9F#f9$`uiw)hMFK@i1JuE=rG-w9)(nz<Df_hU=1f1DWTG{dpCE<#
zy$nnUPv9fKGLC!&f;vqQ9c(+l)xLi_A44)0G5Z?$WV>&_tP6Q~sO-N#|9NI;IONLp
z?mMq|t5%|VjB7f@I&KMAs<IaO7{7f~r{wO-Q-uz!(Zb*9dT%R`@}*)N{}Rt@?%JJy
zhp2ruUN20@`pcb^%`fXMA8uXiX1p4oU|*Gr&|?R94*%!X^MCv}hXr=u2~t#?zikfD
zw;FusbiC*1%OAf2_u6Xv9qd_TCeu|~dsx5qHbcLWsCrjhynaFBN?x5sD?%@v!_u~R
zF~YR3H=^aG0aT41meKq^Gv-9KaQNgIi<oeZkt(l~cfWY)aah6f?H9s0%%>dhlJN|$
z{#MFQ=jWfjb{-Y+L_&}+*NX=GeyV<Wz24(1&o|vMEm($M%dhDylj^6Leo3_yz=TFn
zfj*=q0d8%Ju%VC<?~Ot^8{p%;q`>LWdus&C1yrizLZY0Qi>3bX2+v3L;{my4b-skZ
zYZ=j%#GFSxHCGT^l{$ngNV?;JVXAc%e(*evJBV2K(t3w=ZdgFh3x5oaDrsu~rfS_@
zw|Np<t>1{NIpogJ<@I#Sl7^IQS;Fge&C<#Eo&LUPu7g%X#)ik)`cp7VMB*OMy{|AT
zRquz(@X-Rnel8Q{4=vX9Yav*o+AX=>^jgO^v>~~l$P~4J(E9yyIi|)&2fBMcXVm?>
zVX%Dg%hJC)ZE8^q4XBZZaGx62w?2l!*Lqu5Tovg(rog2R`+r#@dj1IX_=Gy6q=0bu
zu!7OQT^;Wa1$liQM$=XrFxQAeUcP_*yF~Wiep*a<=QBW{CBxX-_b`-{W*BExRWm?Q
zSm`5ectL;vKMo$@6Jwzdyv5V4|DHxvyrF^(0{zI3<Uri+tYtByG4v(KVQM+5S?oWg
zn#p@Vg6=(t?Y8%kU*tnGj1xY%KhbHlae<{7o}Arc(csql&<l$}c`xRWDYdgpEQn(<
zc=57wApTfky!%w~@W}rxyYNWhUc!V_E~Mj7HNxwi9j5w<VEpql5`$E+ZT5?<NA-iy
z&G-+5PMm1#Uo$6f$^?yes>7<v8*jx~Em^X!@_m<^GibE8ZfwT7X`!m~Ma-#ct?;6;
z!usD<^R8o7%J`G<{-d?L)I}W4OwWG-b|&!Xv-otsy;F6QxkK$>zJ!QFD-=jDVBTjp
z{#7fnY}EOpoHD`vm+!1lI?+&DxI9=rZ^s~Aj6yZ}L{k23Jm|ZC$$3|G*S0G*C;nJ`
zXe&ZHk@1e3TRx-twwaZ7o;h-mS@E9OAKx#3`E5;@qR#lWcdRvH-=keuR&Y-i_Lc{4
zl)v<Wa(AbO+~tS(+y3AkQ9N@FK2p9JkT<wZ{WW8=^}p;4{f`fm#_+NKZebk={Q^|a
zckwerwv=lOe-39e-g~UV4Uxhr6XhbqYYAWOXBd1XOl?kVw01J}-8T9)D+Z6EDaJh5
zv}s;^Y<Ro3@29uTEA5C!l%y3twK%EYZ@|j0_E8`H0g&DNyEy+U|M;=|aWh_De>(%F
z()zwz%jU7703w~N-V&#{(|jzO7Q4IYa=Usd=B^=km$v&s&=ZaP-zP~E>l<kidJ(2c
zctc}$OJ589$wED?+V_<0&vid0-k3&!ixTQ5F!$CL%0rD&eZG+i4UL;V61f}3=Eo_1
zmkC1~nkC{c<4RG#&OzC&V@=X-aGChnDb{n7i_}>|is0aw@~`FwgDTIN$d>PE^$%JG
zjXy)>bp&Xdr9-}%Nfe5KUY}cbA`DVabxc?IG}v%s-R3zN9}K$BRJcM9M+U!+)LNRk
zN?LLAkckx|HDnXy(_P8Xp^pCPXrZG)0pOdq8<|XVd;BjN_wo_Vf&6E=5m(aUKSvrn
zY#iPRk`<6=R^YAHi9lf+jvl|#>-ocka5WJ?o6&R^CZ@iP6s$@ofJ$gp$|V({n^w9S
zxllXgUB-Or;#;5D+D5xo{O_fP<J`9_<d3iaAE)~N?~lvr=Ea|da@<DlIV;j+UD&W^
zL3D{H?;QUD^u0aLWu<!O=ns9*#*BY#uh~v6%r*u04}f*1og&oXVoQVS&J~tRMjCgO
zj@E??kb^CDI9eKWpo+&f-L$oB6QGHqHv9DQo17=VpK|OUbY(W+=WfXJ$a8b0jaSaA
zW!3(bo~QZqrg@i#vn~J%U*S#{xy_#K?-;WYU%HO0Csy_#e@L`T%|i+gIPY%SNF8_p
zBB971hi<#9+(fTGJTV5v>4jTvC8x>+$DMua+EUTwFIj*tW6RSHMbq7jSJdA3ua=j$
zXQ<^kovJysYF!F7BU;gRv<WTLxAZ5YpVcC}YMKRJe)^srIU0jE>UX{-emZjVV)p-+
K7kcTRx&H%N)ZRt_

literal 0
HcmV?d00001

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.050000-0.002000.jpg b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/bimba-mean0.050000-0.002000.jpg
new file mode 100644
index 0000000000000000000000000000000000000000..2e1274ae6d6d231dbedcc627fc2caf541da33e9d
GIT binary patch
literal 72992
zcmb@tWl&vF(<OWfu7ThV0fM`GaCdiicL?t84grG0#ogWI;?BjL;2L~*=f~9i_@0{Y
zotk~tzuwim&#5}Ac6YD-Sozonph}BNi31=YAOMn|58z`RAOe7cfq{jAhJ%HLg@=bj
zK*B&qLPSKu{f7P(gAk9Hh!Br}fP|cZlH@xb836$mCp8@tGaDNlF(o%Y7YiQ)D;vvy
zIe~zOhetw0!a+vHVId_TW%+Nfk6r*892C!&B1nkufG=nekZ2Geg8%{m;0xquv=D&*
zwV=L0LPNm7!hKq$Q2`K;U!WkNVW6O(pdq0Eun?cyq0peekunP@8KHk?aSDXN5Khdm
zBUA31Wi{Tpg2fbZCRYhcx@Ie=$1-v0rx0ZiHcc-4^o8?Zr~L2d000o5zCJDFX#dmj
z8OQ&O<-Y=fK>I?<4Eaq+iNy#C-RV2)#~J|XzszWmXaGUL%QI@om;ZzvN6U@~$V^4o
zkR-C^u%Qv7mohWJp%a4#>)UZjWi;N+UZK3cg+jr0!l@qq8Z0ky(*myI<WQ-chlYV@
zx(qV}pDB7qBl1L`!-lK$2r8b7f#T2Br?coU4ra78WI0D1nxNs;2*7J~H2?BtSdai(
znSjNE)UNQ);kI~3yR)BE`Pq!yttVII-A;bpY^#<QyVyK?+41Y9IU=`df^|j>fnFp;
zr_Elhyi`}AIttMA4!Qm%d(1F?sFrrqA)0zZv%{C@B0U?MFTk?wv?#RKfQsDhVeHn`
zDs0LGISc0D+)1riOM-xUf~z+I0>QOif$@l9*M;+J!@mhU1_}iU3D*$pHI=%3IF61k
zmy7%H?TNT?$=qGgJ&I{8L2zSP>!(25I+mXggCgOoFO&=CMOFZ*3<KQ(m7Dq_+lO^N
zN|g@e-WM7%8~=mqsKXDygdn>+>wSfoto=IoP3%^Ey6vXI2cT}N9vIb*B%IiUaWOff
zYttb)6TGM^_PQwhMLh{RuZDwo)h&rdX5U-S?##hV-;oVeAH6x!*tF!x2Pc9=YP5tT
z*FJ|cDaXT}Zbg({KN-JfD;{LQ`mNAq4^%kdob4NhbAK$UXu`&o@Fmwh{WA>rIHKRa
z=*NL@!Vv%Oq3aS14Yqs!bHahmOQY`+ouotj0bo3Ndy01ty|L_T@Omo#QRZ5*&Y6_f
z^rOaf(z_nzcm>m4XtHwYT3%&J3dy}QDp^pw;a{VQr~v*`s-dN2EdY9fHb%!%7!^oH
z1{Fi^*h<ZeuX7c0bEy8VbfXNic8ke$8GL~yD77gcKGExdZad2<vk^7wD-;=1WtX*f
zZA%*mtUxEmE}2;t8!eoE02m;wx2W207w-;M3W3qTwI!!EgOf6MIBaJ6h%FQd{8Rt<
zVmh;u9#@)9`Us0BXo~g8OepKK1e)I~-*Z1K^R4^PLWS$;YOmsZQ`C&88oacFE_glw
z%l;LF5Jc#HQT1?ODk+N4;Mh533(C%$OZMy=|B|+U9{15_bgj{K2*DWSGm=sXtt;$c
z`pK*J{>N&RgHo~BFb$T-y4f*&vH%YgZ?WKC#9N0g8v4J|JiT5Hubu1vY9H(Wun0Nc
zSrq5Kjc(k^mtX9Jd*S_}Hyxm*C8FoFL6)@1`d~f3ah<&QO_W>nh6YFz29w6$SMs<l
zQ<}(@roo3r826}xG|n66!qyxvbnL2;F@lV#+?K$}76<r#>XBOXJAWW;Wd7w|FUnjd
zgY7ZP_V5~-`rSgZ@6}Nvk(Nh0LrkS4>JQTJGc4pmy|Kv*DI-CcID55Ap>H$Z)?qO%
z1yh;?w{3PfD!dXlsfEg-0%QkImsY>hz;wZ^@Fbit>i--3=sz+W;bJbH;(%aqAf0>(
z>}y${&Qu0#u{&7ny)rvJ#ceIWEE-Q}KWe~3Mi0mZ5J=!d1K&(s>}|zjQyu#V{9s_>
z+d)-hxf)*xW<1e`lqlFidqhz;MFg;Ha1RPri{bkL&I#f>mar%lA<XNI#7r5!IX2Z0
z_?UAKY<g3WldCSY^tSEJy0%ViVDXt>Z1mzj<P@=+*o{w^Btk12j+l#DpRcN>$cR|U
zpgenshibQ<t4l(Ja4a`9sct86y>-}3VJp;2NFYQ4+4Ja@8o^!3pAGA^)>`SdaLD5{
zbh^vLOD@Wmw2Z$Vl$Zz(ilKkSdLsYJEUm56*uxjRV_q>~*KM;p&Egpr6K~bE<W6yp
zNra2*CK8>~EP3ywnGwd$SLwuXW{e+}<7YFnD0^BSz0m?OO3mJ3>J9tiA=F`Y8hMH*
zsHW4^QkuA`CB{rJ5m0|^8`8BzRLr(AfN$7jEdSTIfe<*z+txwVL-rMXt>3U}U;~xO
z^eVJ1IDk>jdq;azb&(sj)04G~jq}9)qQF=uKL$CG%gGy?R3GaAGJIh?*W_k8lb3s`
zoxBhnznrPj;U^<N5ixnvsL3t%<T;#(8PcIWWqN{iSQB=)Y4yT5E=WA@@a`fk2wBms
zAJ%a<2m^u@D6OvXeq~H#y>KC>5q<!G>K5HztXSEO1W73wW~!LDTR64&;a_quIfv)?
z`sL+F8Hmg{W1F3}%iPhmzg{`)@4Qs48D+_W0dkdFh%{khxmg^e>s)LG860Xd7&)0H
z7Z3IXd~&B*KCv-+BeP_5Qz<tN<XT$i)oIl9WF6|rj6;G*%Z9FBFK)m-t#m6^TDhKJ
zIC?L7l2=NDg?KR^j5w1^j8(nSSU45!;YN1kjJD?Shl};A!)mRwlFlHB9%`5eD?!&K
z3v1D=oIpU}gJ@^9u*B=sS8p?>G|F)gh_(B<k&Dc*0`7Hp-q14-(eWlYVG?1~fd6X<
zeX=iA+qqdF`0R_m#6v9iOC>S#`>9U!kHXBGg`>8!VA~n5+xHKEng!t^(balFpC3?!
zc}W5WMZ_(3S$Amg3mw`YgznWsakkXSgDu2vsq)D58{MxYrwpyycHRsD(L0uP*m}AS
z6cn2Ih#{*#RR@N4-^En5F;WHYzaBkfGI~behWh+ai%`RhkQm1By&#^xqpltAay|{#
z_<ATvLF^OtfE!=nTkvLszsA!tr#>S+jn10H9c=flUbS5!JuN!fcbUJ;)7OmGq0w|b
zt!I|%iDeG<njY&`m-kjbFMg0-BT`iwNzP9)EX_XsR%;3io0oP}O(twf!w((jct?OT
zEju@W&cxpw+D!&nj5Z8!$OCbWF^EI9j+R?DOx4>hv@2MDcjw7UmHkhVt0x-FP7B)O
z+D9&P{V92k9xbD}$>*W*0r>i;n(-Zbe6lcs=0{E^yq1c|yftZoNA~owpj#dXZPbLf
zKJ!@2`*@Fbp64AyK%h_mhH`afNo-$O!FMm%FP)R!kKCPI4Ih9F=SD|=b0;6I$Kw2y
z2K(7PT3CLC<C;Z*ms5Ty2h-SE(%u`|`R&c+g`K{XdytzL(`*e92a2A5mqsSApUO8o
zgcGCc5%^cHv2nPs=fZ2{m!A2M9(4*XiY8dxoXvo0pYf$idPM0l;)j_i8VHvniH*Aj
zi{twXt&rvl5v@d&(PUDT>}1>|Jr7m_2dOnIY71@7f%ADao$|c8h#YQ`M;PZt!;gow
zoEB8kr>~p@`FbX_mTYXOz4*uFY0?pEM}9Z}{rweRjjTN4s&sKIQNa|Od#zMwkQzpi
z7BQ)d<R#DPTYTX>5AdgpB;K~$<TB)gvYoCyf$%>gZf&U*#_AW+ux@{|+9y3)Z9>93
z>|OOEZBWKCN_-O|3SRT@QQDSsyLsF*&ru1`9D&9ke=_dCe^rIy`)HOZYEy7dW!wE0
z^Ku+dDOu`J*C7{*J(ey@+xEUAp~mluL5r-tMiSRqa>|5g?AGTR{wJS*zr6nOc~y;B
z<vxawVHR0+m>OZvx=UIA3A#&YmeSg>+0?qPd!Z9PLfa+xs<0|Y7I|W_SIeW<xl;IR
zf&36>^%t6mGz=s`&0!ixI_b3y8J2$1eup?dMpl+V9^r=%>l>hdE;ke#aS%DEpE#g_
zY`5Tg+~Ksf#<#^d;8}IYzz*^j$r8yD>x0=2U2H)OAqD(jpu9Y<&ak#4ZUgpPWs>+1
zu6Jw}mg$sJ?3~~T>3YI8Mho6i4)C-Nb^tLC!-V~wfm6{ZK4Igc9cb>J(Dg?*u>fcV
zPti;QJ-uF2h_NWtBu5M}YaOsD<TccSu~9{m^t?6#QsuytJ`a%QC_W=R*XFL+DT~T)
zEA-?WL9O7>tUYa8P3Xuhj2+)e>&*e+Cq*8tqq?h3s193hUZ2!wGI+3*C#5$oa13$&
zTS&fZOcs!v`knCI)7+R%Jt7+dM2*`DjVqc2VN^<ymQc4JO(ZRg@_i6L)G$5^frTq4
z-J2WcoH~KNJ_$#GHnP^LhnA8wK$MkN!#5#1*9?(J0WZCAP#2zXqU8hNBnXVbXwVSC
z|BhwikU3(g(mgwChFoDd_u&8dc2QS*Cag^@vsxi_$#f>1Mpq*y6DlNUfwm?oK<Rjc
z@ECWkQd%BWjYcQm${R<PFEZj~JffwV&@C7l{{e_nyU+Xpyhc60)*xZw7v-0f22S~?
zUNc{iw}A|ya!tz_=x?4v1rQ?_{b8bvzkUN39=d8fz2HaUOdPs00~l>r<L4EC&p(U?
zNe&#}=I+&9rvLVige@99xG`W#@fE&FM|vwHd;j?rR902<&}@E?dM|6<*SO6FG11zk
zW?HK_dN@IXwPG)Mqs5Lhzu`XLK=nGc@R}OABoR>-W_ff@lT9WQJ5dC)|9p|2ls|pZ
zAT%AdFhWCKo)eRJ;bqxIek)_R!fwwR(VP^8PM)3Ipv|4!%aFvSz4{=6lMYkOV7GxD
zaE|*Fe$ibez$!hiE{8r?A|B4fcJ+76>-hs<di<96z*1WO#rlutlZA^L|27;!0Mv1<
zrKykW*|_Vnf|{+AP7}NG;>4Ql-(1Lm8|gAJ<q^w^lV@rfvhUE-j>v}*=W}lVD%nt_
z$fk_@oM+O?2MH<GF;_Nyq;LFYmi*8HOBJHaKLGvp6eUc$M5Sxm!^(4k_zJ(Y2rG;&
zzWK}BoGC4Advf4HLt2Xz1ZLtbb#@Jd&xd?$;Ipiyjg7q^4i8FA?2Q~$yoF>SP_iN>
z7!SP9dVK=go@tc@0x?b94)0u*IcPrsSQchP!8+B`;>+>7Xb<{Ch3j<c`ORUHh87U$
zFyN;4Az)2qMNg-i92FnYjl`JK-<)5brxH!oWd%h&RtC_+=OC9GY-(%mEbAI*Srfe+
zN56`Z`T0Zs!m!`yKe4i75stjvbGpE;ax<CmH;Ab$iz-YUln|&ZVQ<UH#WlHKpj`OF
z6L^Tls!;fO#kF=#tM+=|C%AQ9M1epcl7dT#9~e1Fm8<YX!Hj(i{+SkdN?H~Zfp_gv
zq06Cl5w{&wBY<8(H`0+mQf^cl_2bYy-LA=`d;b@skc=9p8Lvg?vQ4+)4ekDd8$)rK
z6;Ja6sdWoFaDX=NVxIfYWA8>aY{qR5=$GeT-%dfwZw6nBNlgrMXGEg?(6d)n1D&T(
z2u9ADH6;G~e8lh#51t&rPX4EV_?mKFeLxnE#q1lpUy)y)>V^s)0c$r1ABBQ6st?ml
zGvg5UhxpaZH-~#=mo3@`F7T>Lw@u?UmV1mt$Twj2HNG=+|1p*jHWY~ljeX=4ZlM5r
z4X}i3V#5%@na3k&&URCpPQ`#dAT*b(D}|(QLvib0VjAn!wP5{17@V<}Zw=|jh?}1y
zOjbpt9mymlLTsBHhBJ!t#^*m=ooTC@V%O;;hUlLd;G1GivyR$)@tSWgMSI|Gk$tzH
zmYnxjURDyB%!prF>t1EtE+hKNKGJibh_niuRvJMGr=wHat|Eyh45^g0$?N%tGfZ^H
zekFj@u;363-q4j>G~IC0TD_q<n`Sm0Fa|JGh-&-`yirDj=+iBKh@xwUZqYbs?t?D6
zKu14QE`d=~8G{OLeORf1Apcrio(2!=6<22<!R)MWvX(`PrTwC*LzhNO_I9T{l*U~4
zm!jae6z=@4)oR}_s%swWjI~3_SyH@V`9C$eYR1#P>wxjCNe^1KwxQJq0`Mg;PrX$0
zIk{SH>Xc7os{C5I-5W-Z1Tr~7ThUugosQT0F0t^U!OPzLA*}bCT)=K!#r2={5gFt2
znBTBT6J<j{T5Ymakc}6UCNW!4IGyR8%4v^rgXD>YPrQ>8rLz3r00uzgCo$9v>ZHan
z4PV=@2^qpNandR?+e{g?@>?{v4*V%JB5A)&i9549R44_$h(iY`c?$|tm*Z}7ut-b%
z5}AAlV`_>)|9}mzj|-x!#A~~_<_AliX1mt7UkC`fCXSzL#B*>vA_-G=a<cOU>%&sl
zKV6`Q%W<GXUCdU)+R0UG)Q%jSU6s~9up~@xouwB9D9;K(y2o*}O!euo<>FKpM0RX!
zno&gc0%Ac}c%i4o#Zg918y-ycbp$*fDrt3LB91yK`UkS?`}^Ml)2Q<3re+iCiibuL
zAl+6!00YF9w3e%iPt-=KQxvn(w~pLNGZF>Q;SK-Dn6hN&0H@{9o0k)>`L<|o<+#g}
z$2|jC>EcTh5h@K-O&QC)m!|(d0LYdT^c<A5d3K23k%?(j&nZetR||=vgt?swmMDW#
z%j179_=huuY$D8)>|CY9bdRg5_@gx>a2-JT^gqi4f;Kmt_nma@JPrj6PdS-1?Ph3V
zC<~rl7Zz?m0C>6FJZXP#wNi<ujOMMU=CEBkiPh3xJJBM+DJzex5?_Sx6dv4$EhM02
z%*GkKn+3AUT9CrXEb68lw>ZxVK;}XwoA^JF?A&)al_0%o>;9N+!$P$#&^1q2#wOJA
zbs}b47xU(@L#c2)ZF3Xa>wd$T+$ieG;9t4B*Xw776=MqBPwO;0y4CZ%+Pm?xoK@pN
zD5Ej<GRe658~Yre+W+he?Lzx!YJ-SAr?aQvDP)F&(>z8iZfPJ0Jm4guB!n1Zf1X)V
z(g)htu*e<h7OsZRRDp64w;yTb!ZfagB8B^JAdP}5ic2PP{DdV}=NsdxK>1>9<if+;
z1O1h_+v(+T@m=Q&)k(ud=0Jyk!4d{jU`PCC>Pn9%`%?}zhM>l<CF8Jemq)JzM9&NB
zNt_jK0?)tlCPf=`!AYS%e4N#m3pSOrY|zHzfmRV>;mXDPA%%=h&Hdw&r@#M1N`t$v
zBNcG7{j-%|k*o{Y72BY$t#VO^?vjx_n94CX<cq_v2C`esZ$=nR+hraceWm~M8dN7V
zSC^fgE2R9KPKZZW6XrbsqgOWpR!ugQ&T___TB9>ZSBj=Uij%r@VV)M>o4?2nuSAQL
z{Hhf*ZO5^ckT1!`wlGs&c{mY^3dM03h?YpCKl|<>J%MrFHg(hjQnhsN^{nJq)zg5)
z(>(zIbg#8|tI-^VR!T~jC{*H+b!6B5d3($<Xee@v;}~4_834M)`xX{tnWI&7czJBq
zIRoOBTY{Gt#nzIc{`Cv&PdVhsw&8D*FV%1Hz?=K`fn^~NWj^_>QCE-i2Lo|o+TD32
zH5JebNP(98wK(j683jH{-j0Y^@mIzuF-v!UTM7{Z&QmOBea249b~EV*0G!|(I!_7D
z+$o}^JYcf*=-n}|!&opTKDI~aojc=!%+b1^`T;mO6MWa{xui}jT@!~PCPI`jAuyE`
z;MU39nxD00X-<8|-Me@D-1jCZ^Z}sWdQ62i%rMpN3h^3MODbLE;6rn7MVqOBXjfXu
z5H&w5b%~c~^#gJjI9wIDNNDBytCgkI^B3i@%PK-{+nXHvU*!hCQ|~#tpTi#4)kzkm
zV<ADc-5ekjE6n~vh!S)>%jlPZ1i+TzRf*F;R9hW3mK8=ZQFsS>tvG9)c{;XW>}eVx
z>JFrCTY3_O+MsL06fh6wiRt_`iUpm+8#>iG;gJ`Xp?F2^kr%q>@=LID7ue47aN7Ds
zb5)Uu1ds%w3^LSE6N-r;Rof703oUjcEEf*r^M*J#(1jaw(7;kg@NKm7UZm2KISM;)
z9R{0>$+xC<^Y%+qw8&>@U*G}tpqpu9|DAap?Z>o7=n(`JFrv$i9%lNWY6vg4wY1K}
z_P0%vsvvs9%Sc>p+6$&sP7~3(UuH~{_ZLT9#9!mi`zPHl#$h;(?s8yT>K_725NJFW
zRL56#4clDOLDy$KCTdznArg>$<Z-vpd8^C<lUk83Qa|>yQ~3~x{e}na_*Za_k|)of
zi~gQwBAIh!kGew!%{{PJ$EYqqmXiiw_>0YF94-FhoJ(sAkQ;8MGGeJ+AKd77t1;bO
z7fe$2%tHziw-jFgDs&b{wMr;}_vlf`U*xgxLCo(feJ`^wTa}G8WISlHOqcHY691je
zK(nMQt~!e*LNAM3n`nNf0_T)o7`1}*|8L=1DRGwzeA{a`T>xDHlx1qG`!~9E^I7%?
z!3r6gYi)kyHON$rl0j_y08nIsGlY$8ab{$4{y?xxgz<6LkMFKq<Dqm{2<K*T^?EvZ
z#-nY>Ye7PXom$+NEBRCzeOW%PGLz9~v+7YzTsW-^SsfXZvtjoJyO9_FWN=HJGoWuP
zGazYjb9$y~CHIVN(`i3*ma$1LRV-LJFJCCnNzstKaU}7AUKuFz@J!-KRU$29jf+BC
zY^&eg098iJ)$)d-<A3eP*4};yX9Hs{mS8@hC096{7JZNLL4Kkpg%#1}uq28yglttp
z%(rIMV-7{fRfhyQb`|a-YG%vG$S$Aim`sxImw2-`8%@%S(Edt=q<ZaPr_=MwT8YdI
zEjW1oRkfxG&CdFr0H!okg=vVc$}2{%WDmr|5+5q7ry6Zw=IJ6aU<Te{78n=N8?C^Z
zu=dbR`-x-gww-ov`g*`8b}R2BlDp&?)j#YcF{3E?FzT&=$U2>MrM$c>E9L8}-|@~`
zb<>__`rKW1GIkYBLrjMMD$!_gi+K|;Mni*((bS-IIM|x*S7D#M+K!Yzl_b@!KX3wU
zZ+rdqWW!Xl-dI^|_Rt9;2I_3pj(h-M+PRU>%{|^H7zk*BzCzP!5a_ZJXUYTc=%B+%
znrJ!jilcIM)$zgwcClLj$(PF5^Q2a3{<EgmpSjMkUf*(yl)U^``t?9|acost`dv;f
z$!VOpZaHbOAh|K3`R%ZVXIU5aOHM)6nYoqUI{K`Ztj)q)bAFnK+d%(Lt5kixw3RnP
z-2usNmOHgDOq0?xezA2O0gdORvnomm`|y^SHIgtIxv}S&Eqe=UgXZoS-cBnge7oi8
zj)?)jw<I|>#F{z5{VF}5IrYr}J(MownCUMLF8)}@mFUogI6}n{m59wNf_WSCRs~?C
zgXO-DYa$juh~j};u9cDdGBtLwsfpwR@Few2i1h(z+>iR@e#J<6+&Kr*Y<Zo=wR+`~
z8}!p6HR<lf9PyTjQ5iM)JvZj?K8yXgFx_f3^QjeDpF&|xY^~8FvnT0bzJ-0i?gL=;
zw~kI+d=cisi7QNePDESKuY&Ynn+aSTFW-sx=I98XR+P+GFLA*HN!v~p^b`*OdQ4rk
zOEpJvSBf{6!kgHH#u&#}!}ft4lz>VkBLwBL-MPVm$d~52FV1bR_I|XwETJGzv`z0G
zB<20jYQ}fb>@MQ4fbs0$oFqAUDvv+;qSR*RLXdwrB*DI(NfsY9DP$mGc&Q(D$3ie-
zYsIT#HCTO4T2@UcrhE4Tpj2M~ToaccL7m`Pay%4tJN6B$avC@sFmv0I{yXAF=iVdY
zpP@As+1HY|a}*s=U!CM(r1{$|#@@(yIq;h8LLlIo)O=(HwIa;&l+<*lQ-CwNX&|c3
zYLXQ0=l>aqaW0w+dxpW~1e$y^i3HWL2j}BDBYG0!C&^qB?sXSSOHJ`h6SO!*gMYKO
z9Lu9p*DVq=CnWHZYrLJdqrWS~6soz9vSfFNzb)ybhb_)bv#B-RsE;0fF?AfDq4$Q_
z?6VmY?4QocdtNGL9ki?6N|H^I8xK`8WlKEDeCQsC)NH~DX~JXMk5AxzuDsViWTSC{
z%kR+H@+YlTEb*yNrmJ3v{p@vRD_~nuOo!Mvk$IX(?e)^B?{kegCoFR%iGx!Ew;gE(
zu+h25PgUf-HQA{uI)p~c+TFp8*2)e!)3fc+OEIx6L{yQZH@Cp;RWVt_g6h&TW}Xps
z!e@Gd0Y`O7EQS8RgY$D^G@3nvqUJP+Eo#hkBU!BY)~fax1TOgImV|PtsdP@4lfOv#
zLP-@!*OqRTAFX(NmP#6&dapcYrCc_O4i`z~ude|W48y#eQ4<U-oSfdDMK;xC!~i8m
zKD5=In`$$U13?NbRSyc~Bbdgv;a<cfPue9cZmk6G3Y6-_cil7_rK7s%JvEAZ<R2h{
z08Ir?6MJ8D&yd0vP98QbS}7r|sOh9M*ip~K2A`=uDTD%Cxbiq*cSk|BlfA_24p!u-
z+5WERl2ZD#uH6EKC%f6;ds?r5YUm$;cfH^Vh5FWbL1Y!vS`W7^;fx<33QIw#0$yg&
zjnkX*eF}1M$>c~^FBjzRV8cq9D6$U##^#?2Cy#?d<ku+(C22bq;+z!ba-l4$nlgJE
zuMfbEJ@=fV;Eq7lT?RR-uw6BZB`Foi{Xj5y=LogN2JZETM-e~wuOc{#eF$gyiH+?Q
z&w*p@<*!5jzeJYP3t$c+Ys_^Z?5g?<jT5mXN6?HJ5bn$@c3saa!W&S=uj~;-y~>JS
z^}|JPDbpAs!90%As!G$c{%B!a8P=GyL<<~X4<+drAvM<H{KUQ@_J^*v_~Xu<3jYJ^
zd#(kotIVHx^;1OQ5A9d?$uC{xNluUo0tnW73P{7od3?@*3BE=?Tc4#qK%8Ms-u9GB
z2ndis_jldw*zy{ex^hJC+Ig2RrLIkKH+M=#FFGdXJ7A(+$5ZV6uXy_ED@TSl*YB_2
z^vdsbQq=n5&D3~<>o2(DNNRpQ>oTH7*0(fRId+FrD~ox~hRnw9QG$lJCB$T8JVYRI
zj_m(h`>GGFpl4RH1Z~Q{^(!s7^l!eJgNO53hFk>{88M1W6Bm5a{U`OO&P6|YkyTC3
zEvmWiybc>$m9UF17kllMut2_mpv4N?Xj`?k0L5zThNhjzx-@AdX(hW4?2};iBB=Qc
z55?e;Cr4K4LTEy1a?ty_T&w>Lwyp)BnbW^KaGfu|gEaMnKY+JoB11~0+TUc3R4m>$
z=Br6?mOH7`|B*KkL;L=uqXKpn-7F%J8Xk&Qv%b2>1=;Wx6Hfj8IyCq`CX~jp@(Vg!
z=a3B!)=hQFmKi&FpF7pmVH#g=lFmoDf`ri}0H4XPLVI!<pSCznB6(IrLkAN>YoF8U
zswGmUyP5|<JpHlAvDJb7@DykY%;=WTO`TenVp3C+(qJu40q2ARFl`gh_~(xcDg!f%
zdLV#Nv!<7}MpX@7tFHVnM{ci+w$OtB1_eOV36%&vdBMdtH+8H{BSw8!zm%?s_&}tb
zl&BO%eB1v1g5CI{LAU4_oscI%vj)1%kcgt(3+udM)g!z_<fKEU9Ky=}2SAlGABvh|
z`ii^y17H)V@$H)%wTX*)S3Av8bfH_Nwx5iEF{u*@hgQ`HI>sC)wYgCSVVZ4n+ZyN3
z3M(>2Td&FrZx)7z?P{_PhMr0E{65g+92}o;JGt}@ME?++S}KE;(VJ>EU)7q#uj~p=
zJm3~#6FyBEy`5>HPw6Brw8vrmzOt0n>CHynsb^|cr54`w;K_>Z?zWef<1Qe&E}a0L
zb}HG$r9GM41$k{3b76SB;)nYn=O~RH+19Rie5TZhR^Q&j54?v?y&??cOuSLqI1U>f
z=g!YmFIBXucuw*hptBOZ`7C*o4?Q>O9KenI0TA894;}eAIXsm)(0QTvC8{_7fweJx
zlbQ0ct;cYnwEV5xW<f}bkWHA1)YK_9s~4aVY&N$IJqB>omIL1KCb94)MgKLj7|FP?
zFZbA$*p5M|RzTceHouUv9@TudB1;5Wx=1dZrTXe#ZVJPa7EBHTdAXb+H~m+CHX*HU
z;R^g{g{7#Iaxr#JY_Q!*P!nV9Sm00y$-ODDcxaHKJaqB^Su?A{x@h#i5Og9ah0D+y
znH*#$4l_KW0!|xa<1K10J*$0HV_&KCHhQrA6;^-E{R9_VmA}oUCX6(Q7di1sCuLC5
zHDfstQJa|ztyQ!ah$tDCJyJnNXMjU4)6E>Iyw?fry+>`d8Kkx`iVVFaw8TP;Tm*n7
z9<@!0>@D7)W(c3huYK1@PW>f4?DV9Ii9VwKKGK^bNA47~r;=CyV1L}asmI~$FyP8x
z$WGkM-)Y$@%?Sws!m^n0VHx-p*tw~!tf99c89W0`?liE75J=KeX%cZnjFS23E@Qzt
zo6tHk+M~1}jCv-?pYDq8?e5QdKDTH<UvYX0QPV@l3#?0{KhM;dcXYxkn51<LzisIf
zg3*ET@*D3Z9{|@B%m%f&-nBWh!~k%h_dWG-?Zf2yi1LV+qjpRUS8(2|rm?>wOI|_o
zzhZXYmE}V#uUfl4!Ge?w*V+DCf*6;8i*QJ@gTvygu%@Jiy5UR0>oOT+Zz?A|$j&0(
zr!1A&vLFYj+15KpeMzQNl3vb5vvTc*7V=B`CECn&GG}R4&OFrmn46zhLLKtw)U7}*
zs#Xpfw$%rJv`0Ft4A-Q#Sv9717Wc0N{9^Ay-t0He!|hifv<WuGY5X>{n&a+dG1c)?
zD(k}8`dXglm20AGdgmkXZN*FoJrimO$$tWtIXyQnDa;mnkHYdkR@T+xN>P&WJogSL
zhOe<P8qJR5s9@S-z@K1k!AxbFGftQXs)HFfpZ|J|vwCk4jcM{Q3~9Bw8JL-!rqL2Q
zel$_z)}Roh5@p3Z$g{?F=@zL)TWTBc*KRkaw$e4#fT!@Y^2}mXq`+@|)hf(;gWfcr
zJJ26L7eQc$@z7%OeY7a7xC!(MPxpQqQllXgTnl*G%6L~lE9jimRFj>WKt<tae4)=`
zG|wI0EHPy4&?<kb5h0L`&97@@?+mD~g|3vdU_~k}u{_)R?6@*>(r}=)Uvfa`X=xGi
zMqCR9OPtmlD3M=M9E~CewPtk}l+SHcT{N63?}_!bpN<bM)4TO<<8L}bX40fDE01)7
z1kabx>cO`2eBBVva*fJqShDN<Eq@2e9miKnZA0^)gz(ng{!oU;xg4WuCC_vV-1443
z1HZ@K5L8+@?SEPEb))-!Vbj_AwkYnRIMFYH<K=Lg&yoCSM0{<q`C7H`oazHfE3cG-
zUMtb@0pOfv8P#42EWcM$MB!TqbXq%_)n?&*V=AE_h$>fOPs$}`w=wd^hBz)>YXM$b
zZrZ5ev;(E74zL)#9lDjF7Y+9BwsH+J-jc;F*BJB+3#|9>b*nsOi$4HkCp~;U%rDfO
zaK-qU3Yo<9iIswgu;q&EEFHTo338FCf;U+TM<0MTp#==4pd;zS^*A@3eGZCC4t#KB
zRC^(BeT(GqhT6h#Z}q^*MrP)LZ<QklQM2k;Y~I};%hNr#gn7r-$1ucHcE|mHO-fLi
zEWv#N(7Dznu9+KTk*D@RmkH4LHdHo1>bRtuIIcC8-0nF9>|Cz|cI5wtW^|tvcg~l0
zkLWvZ*H>!d0-|$lboy~X(wZ<M#Q~|T4lO(E1%Agz3ACP?IhLi*nTGX9TQ%>FQ@4h3
zdIk2UyST80G#3hIkpvslsVTSUZn2jQsUt_-`AyC~B)3-$bP&7cT?o!!biShU6etcq
z=L-FLrI}I5(3C{x)G@0s&_*bd_AG~o-;Fqdq9LH$#jME?pF2vxUo>0T<=(K=F?x#1
z9~m88_h^M!G&R1rFDqgab`J6$ye3E?IO5wFOkPy`(eA2TX*h<S>G*K0;>k58`LE|-
z^ydxFdwDnt6iq{vM<V`DP`Rc(p)Ln+v6unJYg7g>=F;i7pc<oovFYxrlljsL;>i4@
zU6|3r@mWJF^rq9&%&F-$9MD1%RGc!MSS$4}XnEWoe?-3Ad2Zg~%U9Lj!2a^ljlD%k
zgvcVSF)Fgyk+WQ-B=N!i$810o8N1w;46e&5!QqW(*W9%%5pv_<Txxl_o5+Q$<!WcD
zQ){?=b^g)Z5J%+&Z^;<7)qeQk26t?-(nPjMVKRNvGq-sQjteK7sq-S$G8TTYaTnB`
z6BqUu9Iq>V<LctZIjpes=;NI_O{-Fj-Jf`SCS$+y%<2rs^Fv0jWY$i;V=qATe3JaF
z#qPH}I2%8p!1$j0z*}b!u=rpyaU&Rff$Sde1ZiCPkn_v;08V&4;Xeyqg0k8Okuh!>
z21mg=hhLuFDS54}p+!vSTwZ^H(Lvr|k<SWZlfgUoThvwJ`~!&l&iH7(X5{&v3(55^
zg^nSEM<Y7P-Qj1_;M&$LybOK9N)TTv2J3-`>0bWTQ>kf;^g7``%r-t|hcr)$IOulN
zMq{V)h<(Dpns+iX(rZp$hc*f@Ey}9-m9H$L8Dw_<2o*B5ss?7oFv+~9aHkGrwkFt2
z7<h_A2AaCNG*qe6jWJPH`?`hb=}o8Ro1E@dyJe0y+JK8c-8grPi6g}zKsMF80Q?PA
z-Sph5I)d0sNk1ZeEA1GeX%7npUsuozl>|;?NRF-tjryOAOxJ`%!Oby253dYy_DNUj
zW22-3B?7z2-IhP4!6*^Y@IM?czj3@r(+e-qoAGmFLlnxSj@d}fG20i*JtPjMwdf1|
z93nnIL{1@Z1t%%6RF#%731*}0XswJ)oE8|yEw>Q?Y1LVXQyRfUH20y%p2bc!5Z*jF
zoyph6%%DGxR{Q6e)OVVg5|$S>nHx`0KN!bb<&~UWRk58YRF4k%F~50FY<S~4B7A>S
zL{14*OMu_S2)xzR<E2UYeZ9DdF98+AJgI%!yn`9H$<YGp6M%==UX@fJbN9Mm)RU!}
z{8sSjni#L_FJ|KiH`Y1dHIgjW<2v2l6?8#g3(om=vln9@6VH6)i*A&%pecuBa2!tL
zz$vSro7r<R$OFJ4$Y`8<^@9Bo?W=~{kbT&8<T{UcyE|z(0hqj;bk|A(kzatwCgSxG
z3Mx$%l6&V=WCu0GPs)xxM=yV7n=+4liu>{~P1qBaR_Z}H&E&dY*tKpYWVgLJTMYsc
z6$s)xkbXy6y}#Sw+J%K8DGkAm3%N8oX}c;+C^<~h)md%jJD`=xizpr+7=3>rRXSz}
zRk4T#+Z|S-!1izZD)u+k9nm{=RoOjAwxjn}X|3me<BAoQO6=A!Gm)aokZl5iX>xXH
z{b*ns%`-OFR&2|Xvf$wvVhbn4lme;hdf1|;ERwn~R#Z%_&}2-;`WV)<j@`m?+QOfk
zr!M6UD6;WF%bBDz*C;ZYvxuh|@<<wY{Ln)GBI+qI{TuCyU-?B>ZkDF8Y0)+HZsJ@)
z!?u`51Wc9;HYS9gUi5kft_>(rR8U&|c&Cj|oaJZ$_S~b~y--&~{TOu8#Lt{#k?diL
zZN9H<Rs8^DjVb@k?M1GSMW^#FbX&9aJ7p{=0dg8)-1?t+oK+XceSvG`gp=Z$kl>CI
zvOr$*yob*?uq_m+p<o*z0qf}zEMK%f7i-!T#EKRmcu@$#wcaW(<pUGfSsNG~E%()3
zTm8(_HfpT4528^>)nJ1((8kt63sJa`L#}n6GGC|`%$F4fQkU@>{Hku>me@&coJPXY
zoY`(`^~0=UZrXMJHQ#9Bgfd07rJ^B~Y+MO^0JcP9?q2-sHG7_#;fXE(E(rZo-g2>v
zFMHl_U`+5vi+hQ0#JFnTNllB~3!M&meLwK^b#=-A&zifS_Ap%PViOM+IHG*dQcD0L
zI0?`;!-(u?WYgMVAQtyFBG0eN!HFo8k#9;?kIZsr&`KndC7&y>mY;abDIk4jftb*$
zHVf;X1zXqYg;^E~KH?vmB2R9kIY!R2w@FdOOo~>8VIH*dUk*B}osgrlt)z2Y)~Dra
zH#1b*Gh3NBF5dtLrl;IGktqm09_I|#VJj-?!{E}CaFfIq98B@^*f(6oo7h+$7gqq&
z*-g8SgptoU7p{3KB1?D6&UGC377Wam1=c%GlMK)D9O=X#wb3Gq%?)Q4p;5A4eAN^f
z9Gi=B;de)S+iWBX_DIu;AHu%>+=V?2Dl<akI2!ag&WOvo|2jSaV0VcNECkwRn2^SR
zG&s~-9Os{l4k{lrp_n-9ORT!}8TiIQRig``S1J;#DqP=ulns<y<(5omw>mj@%fEGX
zW4C%?MxEdzMl&}he~sHKlNU8lqnm1Atb;I9PBR~5=edEWHuou2F&d>ckf6UHASic5
z=X58QQxrlB+g<@vk02%G?n(XagRWDP`x^S}%oCa~r?*Z}9TPlhn;sQewIq^pvz=`N
zhh^is|HUeLgP>Hm1WXSMw89VKTWq`;BX$G1E6^t+mj%h;e|EebwIhALiJdhf+444(
z&Wg?t`{Dnph%APzZg<znQg?I-3O)ftXI=Z5ey4H?76bnz7+1Cxs+uFsxaIwk6V@!^
zW#&Dd6I9oT%4)fO%J?W0_C%4hv8(F^%`qqcR^U+`?J1I?sfiNkQO`GH!ik*m@AuN1
z+T;KZpK|LHBITj0BPUxudm#{%jAd?2W<-`b3u#*tnf=8dY+r*yqN!!d`z_@RZ%a(6
zBK2kbQVug_X(xeG`RA=#do#=>nJ>F$=rZSz<L;~~X%J_Wh7dieAqqn)nOF?m_iZqP
z9HkY-KjftSc22zx%qj~M@w0enK9H$HhL+R#@=4u(qvb}<B!Q3`UMz=-BI2J_G418<
zZCK(gYo2gnaDFWPNr5`)W)Fq6_3l$e;hB6KJgW{irBBLc?_nayY*Gg@!mFtp=o=$o
zQ@FiMQ#7;}FB>|NK>J-gT~Pc{Vo@>AY`CJXUCK2#^JoTB2FTRrW^)j6Z`VJb;L*8g
zs>L>(-GRJU9=lhy=2sz*AD85kV2*_sRG|kmjuNGX@<0SMj=vS$M_mPTa^9*pyXV{q
z<wVtg{~jhRS=aDLcW^RmJZe#xPCI4Pq01F#Sf#7AvnU4u!-Q1mj**?2;}-I|SRJCe
z=b@UM5jl5cDh*pS@i{^6aS8}g(?cb+UvS3!)8}voTJ{-kb(FkfSXRvxX^n{w+DD}F
zwaH5mqKxDGws+&o47!K`KM^8CYaS880_}Ms*0XR!`>+@eqd=x@ym%SNIrzcZGx4Y0
z=fTExyN$L9sO0o0Bu=o#JdA-bc-ABHo7WvCla91oFN_9sny%l(|4P9#=P8_+b-C2t
zLs6936x5V{8_8b<?apPYCHx0{;1?W_j1^N<q(Pm%-1+YOy*`7k@DCj>vV<>xJ=Qfk
zjS^}(uQn*a7k?~2sgGiJphMD|)1KYx4U6aDWV(>8H9AaCLCITm`Jm+{2VVa{BdkTG
z;K`=(*B#{A2p5~2tQ6pj$m3rd+HYM1N!Ym}NhQCAg|MXbGE28VXBu{l<1PP`HQ-%(
zP<o8Q6U)4%UK=$m#?8TR=RPNm2|bknPo-D1R4v&0=3x$OqMK~Ipi98UWP7oD<3mO=
zA}Z1jRHp8)bDWPVMM=3ue>G%#=Pig9OGeU8N(idMa=YG&DF%<+&92>!fu;R6IA>F%
zeS_ErXHDh%`C+soO7MplGv74G2d(hCME$}(0A}=B1kuQ$&8|hGUWBk?di<hnj)%Tk
zvxVARcksAQ?UpOvoVbL&ngMkdWl1F}<kfA0r27q3#^d8BHl`h*3_d!1XdZJ-w(B1!
z>YTj23d6iR;sv{DS$w5TD{ts_CPnV*Y{|1+lYB7PvJRyobQJ<|$&Ig4u#UFeRgl2M
zT8P4*7)rWgksOd}CdLd~KWl76!~?~YSMVf!AZI!8wGy;qvGy^go!Y04l{B;`Lc)Ti
z0LWvy-s|{?n?EhVmD=OWsvWeh5rnXUY-VO=UKts?<PwALX1V_chC6Qc5P_isB>|86
zhxb;bx|7n){6HfAjhYR~0I{h2tHcU7f<%-Cf=c^C&d+46r#|5!On2iL$LF{3geoxh
z;Y9@ZTBX&C=k#!IA>3VhOX#IiTbH8*I21EJaNQyFras6eM^EcA@o#z?Ws5?@cCdUu
zW_0qP@Cl_tpaT2%MxD5c!=d9MD=8zaA-y3iQ~??LrE466cl2-1WH-!$<3jf{ga+|t
zPnWMiXrWd;_3o5@?Gqxremn1PenPyGuiVY_xtu-Op!m@OBTuT&9DNlZH1X5uY6Nnq
zp|vr(jf3Fxo<Pulx*+T2Wd*UsY9C7T@Y%iBtg>h!k8}7gTy<tM^czC$w=t@=ZKGr9
z=xMCj%51q}R!D2yWRO%-)O--k{2-YF@-$0z3I6mf?sz4B=)&RvlazN$-09zxXuZU~
zfuM`;dgO8@6s|_wpAC(IvO(rB6@4zrBz?+Yja*;RIZ0EWIG4Enl#{+6UattF3OC&>
zUpHtO5MzdUD@&5!;smQwAg$vE8TYGfC*4Q%#VllGVg`2qIDG(2WV(mQ=+#UmuD{cL
z09@e2e!)Yp`$<>S2)?^0gYdL}>4?c(BShZ$6rqUx{By^c_G5GjyM;G4*a2AE*y1QW
z)VF(1GZ}6<^rrBjk#BRJzt|boZsfLJBFj9=uz@LG>g|4s5@DnrfzQfuiTtT6C&aH5
zUR}UPGwl*3-LqSirIk}QzUYMQzeGo<FGWO&Zz<&7`~JigQnAOJ<9=9EROw5XrCa+i
zt9~9&9E&gLj{<a0EJtn$M>h#nk#0AbC-lG?S{1fuXM3BCrkG>dks9wbt@qK%YlSAJ
zo^bOrOSrI$HTFV@edWOA@T*r_EA5<7YC|u16gQ$s#}dGy<*c)T%`L6N+IJ)9&l#S>
zvcl$sY<KZHkrchc)9)MpOB4OkEM0|&FM19ySzYb_YW~@sqhC#0fKQ3!1W2yF-i#}_
zKA-t=Gd9tG3II?e{y!^HgAa9ec@~F^*e<$rAP!FA;^nFS=lxj;KE^0@*x_pnwrj-0
z1P(qyB3}woq~9DOIA2>^yJ`ximAV~bOvg8`S};wy<Vn1}48(Y?f<<1G`vEIX8@^c7
zBm??*U>>TRrwjnO*SebLFcpwhgo+*oSJFS^7F#NGd7M0UwtZv<Na>OdIiV}m@}(=6
z?5uNg(h9t~%hRYo)v{7U8KEpAy^709Fz*ndC1yH5+g)G6<B6k39tMK&j*2%0URkTV
z8(gCXdT<9TdV(2V7=wQcWN#i|0aL7;UOC=R>f&}6TzII>zolhso#EZjt1eC&mXKz>
zE$4V*b~7W;eCoZf`2=`#_M;{IJ|zl;unif6Hmvh)`%cKo4oq(FS=sSa_bU?<!P;}X
z?f~5yqj!l=WujX`QheCXRFdOeD>U)Z@4GmFc2KNzU(vv+KH>`{#|I!=^o%Xmw6G~@
zFHUr@p<Vv3cjZeNL_uuhZXDMNlp##6t||?o`KMGH=_2IT0X5R*ggl+P%*6S`*tXyp
znUM!E)rAy!;Z$*q%<=VePAu$iQLZ&SCbj^G9BCwJcQ<OXd>BMqKPJZdD~Zl0O7TVB
zu9yV2GW`u}FJrl}34~$=Msrj*Q-_pe-@x4Qkdqiwv2uzX(f(QfHL}n)XXjAmN_kH0
zYhT4zzJTR}_TFrSiXx{Ud}ptdi{d=m>8K`QI#;B{$iG}d;?Rj-{DFew{x2VZ7eU}u
zp&vVDXaj3X5%Fmr&ZJWZ`5DBXA80k;g(Uq+KI?O|vgNt(HGk_?;tjZDTr1d%*siDW
zI_enlIz#me*Yjrhl@IuA`#mcK+|uaJ`5vh0MApyvHqJ1pD{=KHif1Jc;`rMGNO8#_
zt9GLeGUs3Ry<F6VBNHhIs>9_y1~Rj9cTJUN7hgJ;9h-=Q5TpUC;##6k-21UG5h1ju
z(*jBju96e-V{WV9{>JPisfB_aRf|M+*6L;Mp2>MLAI&CLZG>>N*Iwdw)0H5&Rz6JP
zgNw|g+UB7BZx!q&%#ds$6XtCrPW8qI<}xyTf`gI0E=?mKX@pV<^A7d5)Y$^$2)^VA
z{%V^wf_X;`Cs}zuTDY`k84uhIheHpDTUB-$#j#UsGQ$o-N0ZohTHW}cI=Au>d+vk5
zW5(XBNT0(4)4!AXf3l9sA53$157PTAsfdLE*g+2LqG?_>A|oD=dI?=;U7&DiWq9w#
zaP<QLG0g!LqR`@j#6_`cKIEvT1}=MsAiE6S!DXg<_)-2%<~3Cre1`_z?Nr+;4}2nE
zd7(|b*Pr0Y@5P$a7Nz7M89CagW<o!AeZLy`hhNIFY%0TE&B6kY+BHRy>tD9Mr{u!r
zFD{}ryzN70+b9dOHFEjV5{wp=SvhrWLUu1{;JFh+i`pLx!JeB|Hl@TQaBk*138rp`
zn&>VgHU@DA73^!RO3%9o_^)kW*4Nc6O+i=ht5GAFeEXb0&8Mh-)p#@^^m_IiAFKmz
z&+#s`s8$vr;!7Q~>$@kTr_M6ZC6kaT%U8(bMH~{2*o<COFz~Stfxxl-%`n4wbiHu9
zX_Y1cwzJv%?F`C`%_22!uR7CXItLU3>`oT(OkhM}ia0u<*lo1YstbZXP1bfY6<XuO
zn$dIT>{ZFeSa~eu4T!qe@H?qF!#UNdqiJ_h<f_4{;SQ$Ldf!9IQ=)&HVql-Bd3HV<
zl-QKI2`Hl=h7*9}2Vi=`tNb8!3iXJa3;OS>0j8{c*dMb=I>}WpD=YH!Z)Rk0jNXHW
zu}vK66u$Vcj1LZ*lw9XBf-v8;q~T_#R(j@*mR{2r7co>FjqVg@=Z49Guwa-A0}$>@
znf}9t6E^mt0)2=HNgc0UYoZ*8Zy`eIm6_eurmJIL!L^{Yr$&ihmS0|4X#>E2P;jhm
z<%1&-_`5oxOc)~}58yWWu{A0AyyB~F&{!fo?yRtL_<h6EuY#k6G)lTzePmT0GM9@u
z8tC!bod6KybKlv}H;Qv{ZY!C>3&JiMpv_i8GpQuE-^)vi>XbmD<1oRQEw2U8*~(WZ
zo_|sA$3gB(K-?<GWrfyF3X4h?gTD&nyg#fp2nbJ-Q<;eWw*C&JZP=@AkR)>r&zzz7
zQ;xZa3(VT^uA=X-JH_03<NcJ+7<_)z=jslaG^{nwW|?1@rZRH=>GO#@{vUudkBc@U
zVkm{LF;gSR(bnX!7d1ublD%U%J7lh$dy9PIjvIRA8puje3U<?04DCse>BQwUV|YiJ
z;Dn6vFMAPR_E(^@7HI9^T-HF3`}uS`(+$w!0@g|D+8P?FCJ{N2Gtd!lZo3)f+07}5
zJ9yA?HN`cqp=x!l8(NpQ^Ub>j;&A}3x70%9YHuMs-nIGbt|I6qBeZbyoT<cD@jler
z5hsZrIu))Ph`^DvoUjUlWQ|1*<|PjFn|gDu!pJrg6K!q?Gv4o2LG?hvU3s%x6Nwc{
z9sTPL9Eqe!^})-KXR4*fu<rs?5jV6Y^{_UZR;S+(GKsT=>Z40&ihyPI+Md&<ek40C
zFLZli%7U~0W2_j{q02_M1PF6M<;hk%{@;V)=H)kJS-w6?XPcHstoQ71cOjq}v-E_-
z+{1^div5_z-gniGHOc#9w^)^L(i5?in<i?GoH{$e8oM&$b=G7OMAeDb)b&#-*L{$_
zBd$-EEjyFW_EmX3@y~8L=_{O?hOuj-;h2Wv5_<2cLIPe5qrrLfhP$FjivMJ?$}u{k
zey&FZ8H*e%nIX7s36bSj+5*gjX_`H9mD`cyKWk>~c<<`Oo4V4D-(d6^XPrUa@7|7F
zp-e(*)dlq0Y)S{=%o|%~scSI*;wRi(GsX-j2n7N(u`!iu)6=4I9SG!lnDaH0jPD&*
z&n;ebUW!d~t^6ZtHx3WvtjFY_StH}>st!l8-_kQ5auFu2OTv;!@I{v)$!@jxv-L+3
zUQ%B0b9VCC>4dHi@IMRc-E>P~jaq*+KXW}wc8pkt>z4LQrc9;cx>Gnc$;s+twZv-`
zM-;oL%2b#kP2~PS=#nA83h+n0%{6S>FpjB<Hm8ex(VfOFd(Qu$?5(2Win^}N0)hk$
z?iM6y;qD>99SV0Rg+n31NpK4eg*#Qa7aH8%-91Qv1cD{aH~QusJ-+wv?lJ1()V?`4
z=j^lBn)8_}ON?d8KTctrL^P)O6n46g`uASr_G<jv>9{^mmfc^_8~%%apmcjVY)OV#
zZZY1hK;~eBDDh9m&T(b5BAE+i_G}Pq{Zbk^y_W%n{AnwiuHp`gV0wKt>n9#+J{!(|
zfD62pcaavq$(l41lZP^kSfZ9lsBv2iU;Gy%b^-&{69HPUPHNl!pcJL$tWt(@$j|Vu
zOV)n-07MVyHX>^3UP(#}#63F9@$f{f=nQ_~|Gna_N@+Y-G8Wc5mXm3E#C<wM(zcGl
zK3_v0IeIGoDIZ7w2>I{^f&N=pr`*z~Nyk$)TJi!Mp&--(jG6cdVxl$!liyHb>~~V@
zs6eyBv+8=!*~ipoSF-02)9}fbt@zoGZ~T<A@9+Q=2?80TCrnWn(R92wLIyRYhWsi#
z(z9}99pR|~I<r2xPQ&({T($Zh6#+#B-_kIOGHcvCs_gg=X~hi8b?3a~8_h4oj&*D5
zQ<=#(r+2x^>8>aP;ll~j!v>O5yG6u(U$TQ}fcr(6+W~=hhGQ!K&9p8)z@*GHU=2?}
z2=ph;r9Kn>ndgM}9C%>3+3oVjXFUTup4`3MMAs6{p#_zxAy>&>_+aWt_U!5nIYxnt
zv@>+}tkSiLqH-v!5d))#@tmuSL8_<r^tf6{3&KZ5d;axWx41L0#g7vn{fd)u0cn9p
zQlz?VkW1Xmus%c_W4T6rsf%~TYGGnM&|<`)xp)kPDeQ=Ag*bn4Z9?b9jwroTMPM>e
zDSc7>4KG>jI1Swt*$-!W2k4B|@Hd*z%pPy*Vc?SrqtCw3y;kS`&zx_rRt}l_qSGp)
z6vY@U{C*+Xj+u@m#G+k)xFI)tDl%_4ieYcSiSD!W)1RDjnUJ&K7(d%~aP!)CM2Al5
z&dragGTTz)o{JIlc&-ae4mwDkxLh<j*cU|T%Aq2z*d>c-`&f1fbmq~LfDFi&l6lo*
zW4pN<3-jn7BL-Qm)<iDF6KWssE0_c&p8gEb5KV*G$SF-46fbG%Ta{_SKi|cO<|i&P
zJaVPaYAx>aiNYq*EWHyC?<8$L4TVfz?kWu8LQ@0y&d)c_@fwnx4gCwG>J9!ZHB@(I
zihXV>yEFCTAjoO!obtV?Rc%hnr9*jZe=`q*&j_bszVto1>R+5-+&Z)%1=Kx=Y#Z4Z
zryF<ecT8h%isaX{Mm{#Y7+qYSt7~jnQ@oj?Hq{JB>%WP=k6yZa9mMyNV<L}G4xpOK
zG`L#Sk>5#O+=r;j#|%qFQJT!#7dGY-3bnIC<$2oNa)Pf2)HUi?qO}p;4SeHfXDRTZ
zz0jSMS;UR&=$p?L;zsB%dheP%_{arjiW_8KVU0*&l)e8rwP2^Jr>PmZ>Oec)uAT(j
zIj=Kws6FEeE4AQQoJsVKyxAs=>JO-{t^hhoz?OaDOapvAGqPpn2NftS(;(?+-F3;Q
z4<AVkc?++nEK<KeJq_OY;IweDFXeel8LVSzEm3v0-BmC4i%PGiv>SE|>(@wff&tg_
zJ~SrgQ8`5m*2Up~KL%qe%gh%_?ET(w6)3U|Ij)}*jsZIn;o19hNEX<OAI^mqA3KJ~
zyozvh;Vov(8R+3YY6`s&RPHL6oN2>@!y?CCaX4@Vu7^&6SFe?w0pgkl5>wW5e-A)>
zruVXjue-u@)#vKFzvqUSwr-O<eoW^h(&pzngMUv`#mhr(N<*Czu!hXG$Y<|W9}8Kn
zSC9xpG1IIeaeqk}Kb0SS&7@1baN!u-(fO=Mo?+}v0x{7jvx&IE?Mnw8t?6lPz?o>&
z*~8%~_r-1jcR(SwdV54`KVm&c@%<M@@W5&SQOHLUs&oz_M7hL@(SnUOv8q%ApU2Qt
zBxo$+&>}5$qewWOUaN#EA!;RKcW(S`0mD>#+k>$Edqu}CeReC3a{G8Sg2sSF$Hu9s
zgEm?q3%kX3Zb=RQ?yT{kq=nt-+;Fvy=zKlx0X^E2c8|{FEL69{4R9(!ntGd<>Bii)
z$<p)iEh%iaUi#Shu*1>N@qGg!3~GhmAue&tAn-yqXDQ3@#Gi}SUP$Sru_^?`Py31o
z!bW`_6_+PTmqzSC{ZxF0+cCmyV<XyqYdUB@*Y7!#$vmVf@ayUG&#=Y>a7E36_glp$
zifw&8(WTLeh+k@^5<lv$F(7-RME37{cAI_^j<|MNtFCn&D&7&-Ch{7mzZAPo8h&!4
zZVdbJfqTowYH7@W(;jP@xW4`agins0FHrh6tN+C{^HNBm#{m7W;X<^mxovWmxULBN
z?6CMbrwfwbL{-pig^4IVKggFMagAMUaz=-<&D%?>Iw=>8jxipy>ud^Plr>JPm<}jc
zf#eGr40&{PvLwsFekG$xN03X>8KG09izTk&WWw%38E)H}bC@{&^O}87Qhtn~IB{Ug
zt@WL|?p=fFoO*~3#-<4;)>I(Z*we)R|CHIKhA9nR1>K=bE&X#nDoXZ;T$``Otr8DA
zC3H!{_fniHid^I6o3G~IJKa$Fu5&T*3&%;?Z!VuoGgUi03H{x&#(TY&-ov1ts11&x
zq7uRy>k90B&t&~={bW_J`{4{4UA2gs^hT7LST2`7w7%spThvCJ!hEnJRgmn04IfQE
z%Sc&;!#D2JCHtKp15&C{s@VC62%$)NF*8Nw=w30ogQSfSBgAuWv|&1V5xkbb%S8$s
z8sMegT5wKxrWaG$$5y_%{U`etrD%Cp<~dcv@;8~^7bCF@^amHTt+%DXPOD}8-Pv#b
z;Jv<+*qVhQIiVY({M-68g{cm?!{M2NSYsOKS#3cK!EFV;M}7i_svxgaAKAftDTU66
zM1X<Y1mi4q@b`SvWb9j;$}xd}?DKx<WAQ2C_6YNoj1LmobX{6v*X`bceTDXoCY*1Z
z1uE^qh7{8r01_m%vG^D37@h!gALBVWqqUP1WeB4$YTDQoKmU3AWCviqaw`CyW+a1U
z5|Cx7K6h&xicN_JZkS>?@?G!R4j>#X!^<~!_Az%@Mgr&GB+gmYW5x26P3pEBE7@c?
z^B*FgNebr56;yaX^&$g%O+{L44EkgIv0E}VY-1@2Tv4aruU&|lbVU<tD62T$)4z++
z-&J^Ewi{$)YL~&WqiQ2a2lw5wlw7Yt*4T|_AO;SYY`_&Ip(o%kO)-|YFa0zEpF*em
z5X<yHQo;^Ak3d-YR^Z82s7<1fFU?~7htvGtER1qLWroqmIKXrjHv39sAr7=L%6eT+
zoM8$&M@)2u#s3r<Qe*zJY3ZJMj=~9`k7O>)nvV9;6vkz;n21rEe&qyq=|9!=PaYGi
zVOYPJFYJ7^T*YCC?iG<N@FLQx%6fFszY#<F4%dy2XlSgDzeBq=L_#&an6$Cen;fQL
zh&>D%m=Q2DWVIUIuyLJsKdoIIVRowpGM;L(^|1K1ivHGwz8_pEycByiu0v(*ov&FA
zHel8b24EIooCr+Nx9$_pS0ZZw0H}tx-@LOw8|ZK!3iNdVVF4l=Wz(f^LI`H(EID9e
zRYCxHA7e)A1TDGsL}K<rcp4`XVjm<%ujx1=1KK2s)}FHCII-|o<47ziu}3?MUiV>(
ziL#Z)K6@&QNN1e4LpF5gXN^4dkvb&ysO9TeOS}I>pk5JIy8bzfO%S@hjUj}YNu9Yt
zqEVSzhH!^rF8MosPYQ3u3f?WWrb0Go!WY}E`%&0L{PvEh@i$jlnh<4cJc8adrJvFV
zrBwu_(t|lxq}fABw=V8YMqeawJFx_+VAC$Ri#uR=Bys_CYi0SwVWrP8oirf7J$Rw^
zVvS^8o7qYZ0kLOTfEyGP(0ft;1{Kb@j?WVCH@Z!P*Naf@w%7EV*r<&{U%PuH*#A*h
z1cYhU8ct(j1q&fsP5sDyAx1Bno>gFprdS^P`W>QmX}w&@L#u9GUs*kIJ`mpEpqG;#
zuygLzC|;ev=K(o+4!(8Doqbdph8vp5t8K1YG@J9|{1*JxR@s^UNAE1QuC;4s37!Aj
zM@H+_?HJNLZUvgMqzCw(;Ud34zCgY{fCFIizi+88`z)rVtE_hT6wb#-q2~U$o*n0w
z`ujtAg;kNgxO9dFw4<oq&hL$;*W+TFtli$0XHyoW?LK+x8$L=;>YG~tPniUJulx&s
z{U2*(eE$GRv%yw$F`?xpy+&rb!}@=Rh3|5};qhL2W83N$cyC6$gJ321?z#-~=K7Qp
zdDda69!g6wo#8#{hv+D$?Xj~>=T45IjmM7xcrVIvkpxPJ#5U(~T6{wTGw=G(cKODu
z>yK97s4(d8hf6jhG!>jrZ3Tv6#EPGiQ}LV0vllx=vLZZQi?E+qUa3vdx!fv*AXE&3
ztrJLB4|j;B{0S)>!XibPUaI($U7z6*8l-DOyA3y}#vkiTAv-)mytl+3Qm@7_MwlYS
zl_qTzqt(6O<nJhH!}c<y3cvHHFp1kc*hxIto0U`_q7<H#h9`!6`!HNc5nh*%bWA|q
zF-{V%Cp5YR|8n|++IIMg(ccl^p3&B(NHMD@daX3VkhdcOD%-dNc0Q!4ezf7_u$3jJ
zbIMqK=6u%10a0QnfjyiSzq;46tXunl<yx4>Ms=(N>RUHb;zA;9>q7SymmZ4afDEQG
zPm0c-{t31Bh!qu+&uo|WfOeLFm(FH9t;J&{D^rpIc9O)D+j=sjOz}*YNf<Z47{B%k
zJT~=`G_g{8`xfKu6MI=o+%-RcfO94umxuzJ8Mh74gMPd3&NQ4^dF9q)oaQf6Vc!_s
zW=2~>?)0;q&G)Fa<kR%dxcMsifb~Gj)@36*{Noz59XFd|Bg&it$is?qt$1&;=YnBj
za#BuD3yB1Qme=_|fJ(>|r2M8T1w$s*bQj{LJEXBw6g}<f=pB`RAEsQs>$T*PsHs8l
zrR^KtnU2KF*-wP9yC|z*&Qh!3$M+h>hrvL#9{ZW;Na-YL>}>P{oe!_LCLD({x1o+Z
zTlnaSnyw4yZPf<-DvbK=!EKdUSjmM-2G|MTk?P+{p06s{WUg$Ut26l-Qg8rJzUc@I
zv=f7^sXRd>jBGeZ?*4DQ3}&;&{{aNF3bRT`VsmX+prIPeeNOe28Sf+g)QK61M}G*e
zFNnb;R<f0%G1oUg)lVv21Bo!|biAYhAf@%{@5nXr{rc64G`5M?(pk$?80>;&93Se=
zagXI<RF2c&k&4vAtr&bKFj&bXH5SrV8}D=K5N?E5dcwoVBYY2y9D2T1r=Em%K!7hC
z(42U5@W>KvH|STN_V7+6*b$h2gt+?1_K7iaWzsS4eJlSNH0OMwdK(jVWqQzl4a%oj
zFC4YffPt^GON@m;$c0VeN<xh;C0!1o1Pcw1P3$EAQe+N1v2rRaS+YeOC<i`2&wQ`t
zH)Gn2(+0Z1Js;{uo3bnj)_aN!JJM*m_I%N&)L-HgHasO2o@#X043Ua&+!bkg$}$$f
zdlIKhiS5#l95BDHiaid|r7?IF{qVig;<6-%;-5Tmtx|LF$Duz#XDMA{JA8gC7F94;
z&yet)I25_9_@l#)t-9qomQQs4advimubkZ|nz~-(99RXxS9;9)|5eU;S=@uZhydLp
z#rmN@3^SJ7q_AZ<;IcH(w%SfND`;;fz`{2V{8P|RCgOv`5jHGpDP9iwM?B};+<r-%
zhbbM+qF_k>3VW30M5#krSwk@esjJIxLmofka|Q-aH+3X%__cVbc#FZpW}nqBy7moJ
zS+t9?K$n8L2S)bAZJ#f0#+>zLU1Bv<(e|OUGTU82p_atLf{f-Vig;k#)&!eKahyog
zYQt;=Bo4J`FMPL+x_bR2XjMskp;%{}m#Kx-*jMfEx}@B{Ua))np)!jxPBCX8QhGJ{
zDGoII?F)YuaFffNjhu3Ai&v(RxYyy2gj&`NSL08ayQT5G3M)T5tG_FonK5EcZxp=n
z&^h6S&7v;;MGhR!N!DJKH&ksEZ^`a5+{nU6cvK$PLj9`!lnvFn)rOA0<@{b|lDE>D
z<9OG7)9)!&*rx9Aqbz|TQ%#W~o%ilx?Kt@#K&0|)oUoo8mhhk+Ns<6m{33&h<48Or
z6zJ%Si&R#Q*2+rw{1pi?39LV5<$ef(3g@ZZ+*9Y|F_hm|4(&{FagtL%b+4X;cjDa-
zV5^G2^`%KKPCL#6g+G-t#WEGieW}$HRv9vv1Z(5o3K8=0!hI;Ia4vCYc1niA!?@>R
zuS?@{DtX$JO_nH$OK6xVA8X>ebNCk^hz~dOVj^HNe&(H}>-xo#{IX)|L6fbV)l?qO
zVxk4Qqqxb0<Z8npNa<)BLf`NqnQ5TOes00-VpJ5aRv`cb<-8P>FkzO;#lqpqwEeQS
zlF~_3)0qLe94+*=LWJ5^j>SU8^#V6cmba&D%EczHNJ$mycX8j2!MS|Eiu*($ZKZ8q
zbcX@$RWazH<KW$Uiu4x)V`ot-{4DHap<Y~c!E7KygU5!d=DS$<M9i0vWf;#QtA@gg
zKI36j1hKo~H+@P1#0t8d-x=&3Ppgh0lj|0Uhe7Ru4Q;p$Eu?EKp7gb=Q(b*VO5AT5
z!7S0!C1HV*A#-3#8XV1MAB^`_&nB~88@n18cXqpwh&SnauYW_C+tv7NZNa0Vc>sC$
z?Wb4%Q#1Ceaw7tEZd)Hx7O;!_-G{N_h5^7>uZ-2JQ3>>m>WtXhE`}|a8dO8Or^C4J
z2vVa85P{CLl>XtcFG*IwHx^H~8%<A3Rk?&mcu7@AlCWJ@2Xeu3GJ06Nr0sC(3Tn2-
z2=B3%=3Snz5S_r{8g#eZg&U{!?fN3~J3VSmN1pb!IrocKrR>lXdN5yFW1jMF{cE}7
zb;B!5V(GVjc*vqa@h*lP4|QISs%Vuy)(wZa_v}CsYR>U^pjUrVQk5Inh}J0OS!JBq
zR!|_HAG;ryiPcE$#3r`Zr%{5~wv(CKh|oS`c6W9IE#^$}#rL4QT^F6f9Ip^;@0pku
z(Y%W9Rvoj;KS2`rB`oyOyB?H#e|8`+v4yka{VW#1QK{A`^yVwu@PD%gn|?;9Ml6Zd
z`DIb%9L7_BY~K218s?+!&{<t-qY;|K<>#+9YP@7nbyP$6$npE6I-nE6qyP&Rw?EHD
z=O1>%>f51Nn2B1onL=}-qAkA<J1OngzYXdWmneId%S!lYxv>1@*gB!UvNXQfWu-MP
zpcC_|iC0!WO5$77cu~q>tgsIr{sE-TS#`4HU8DwYGx8SJ9XfmwOriSoBM)`46QmiT
zZEho8M8_cb)x@q(*FM3**q!8$sh8`GF0@ptYc7L^-bQ!Pq87AqPMuN~xqM%2{|?su
z<7<LdJFj~OPPQn-&~=x)d1dG2<96hgNB>yCR;M(Qf40m0L0G6BwJX1B&>{LCz^=Sb
zAq+&Ag`GhD1u9m3Lq(ce(FZQyN>acOr+SgxE4FWA2zw6BPU#}&5S!yp5zjBNcb?17
z)c(}ReHor~`cFNEKNCo}@7JC0gRd8iN6`|961-<VNBumLEWIessr`Qa-Ri~w#1A5h
zxU!;ib)Bcx>C-6oZu>zC*~;*VfIF4UN%3Wyj3;{*tMJ-OI`kf&P`rxA?pj*^tp(pH
zT?InZTI8ugHpxoU2I;KJ5zYk{S}%g!gtdwP>gL`1s+76fW1|}tK~jG&8fAfUc>ghS
zyu68k`HVRc6&HNMnRVE=Lf^B6n24i^(3l1HFtouavb?jW%iixie?zD6M`uwRFba>Z
z$eJ$CArLEUlpUVW)*AHnlF1Stv_nh;%?J{}qDL(Uh02Y}Y+uAw!%MGFW{j)S(m6Q&
z28+)}q$6LQ5yvHDYID+K7KP>GAjhRljxsJA!{bf+v~9G1&^z~cT${J;czIN>zj>qa
zFq$5OmJ(kxcU<nr^SZ+wEna%<EYAe299`K!88*DPnb>j+%quM<nn{bWWn9lP;9U$q
zD-LI+i|gI()YN2j{a_s!?7pk1zg(GlDl5z#pngk$sWobodg*l`q={fFf^&K4CJ#VB
z^jv|uF)R26q#M$;KNomM-Tmb@2&c8{DIDP08w?hl-wBXQ`6w`umsEHT9%G1AaHmkH
z$JvAH-x51@yt<|<fi8mNR}^<q+Adh35lxMk<DT^s1i><-2pyJNQC2LIBB=IY`4Gyc
zk^5qD;em#eib=!AV)M&*D`*(lj|0;{0lhh~mfzPq>Otr*a=Z-aXM9K5dcl}l_F>B>
zP1OCiY0A|exNO3NB__PODGORkT9YUpD1&I0=`!~6$SV9C8l%oWtDbhFEqt*1V-l%u
zq!@*wcB?I@yPv${ac+mS*i+H#$9Hz_-Rv`-tYStjmQAg#F;m+d=k)ijq)|<)#h(Bm
zsVp%u5odTV^MMs*-<<>~$|2?daMl>Otsx_O*U$vASh3|i+xZ9ZYoz5=FZ{#jaLOF$
z;}Ma(+gWqkwRXNp!yb^wd(aLmCiv_ac=yYU*BbAff&#1Bv;Jtyz@$sk%b|lE8ynlk
zcq*mc9rw$K)BC-MVRBVX`q-bY3*QS~D^VDh3X=}X0@f2DMJvs^2CKqu21oEE<8g;M
zOQ0ZOecz4Htx-x75e^^<_}7KxZ_J3mMYIg|60RhHTtpevHrKKGEZg&s(k~BFFsYSi
zA`<%nPEu-r?o7`1l-MWnTT?Ae@(=M4CJpSaoS^reZdmxgI75pX%gBMdR5L9(2zI+u
zr5sNF>l40Ai>nuphxL)|@?%wJgn%Cf*%&G)W+T6q9fvK6S*drZQKZcE{ct*ZZm#JT
zj^CGvo}kOqP9o3#KND@Q#`G7l_yJA$UsUykY(68f)hLW9znru+JY6JZyfM&wC)kL_
z|B&^Z0$$$Jptn*KLIBtuY8`0p)Xw6binO1J=b8Tj>>H3-j`xbuy-{+u`0785+W7kA
z8t=gv*Hcf|!Zigl16CR48wqc8M#3!0d;n6TyHX%d12X=FWG%6u8ymZGb*9m2`SaZ?
z*lITSf1@LRw&{v1EDEog@3}TQoEdJ*#c(QAxn{BFQA#5Ol~c0}6MGS%AVQrXlCOu}
zbhVotu8XH=azfsCP=yJ`!3#kbw6L+aP>3?xl4MM1al15!NQrc-E)HfiLjNp=ZT`!B
zIb+zg%nF7*h6z?=fwtz86v*AMUY93Wq?>Yc82+XlqK(#_stwQe0x&aY>B%eexAXR8
z&Va(xJG$g4SGzgs`G)#SG*RC~^-OtL3cKnq3jW%^rYnEFH4SI`;U`QrJFVP|(N^-I
zkvgfcw%xI40?k2v;QGTH?yFao3FD4}nq0mcladwDMO7P$AKNRSlT7FoYnSznSU99W
z^f#?J9Sa|NiNxf7YkHnry+n~vCTZv&3B&^38l+p<r*s$E;6~?UKf`PwzVHh^g`O85
zAY+AS`Gp>-+JPCWq@T!N8sq8rEXq*RAK@W4CIEhYEao!7=)U;q3=7X|G@<$Hk7`g9
z@q%{#PfAu4K3~vMgp`AOZl058-VZZio8O2p3N;a89KW>?9DjU@_^r{E>EqWRZ5T+9
z-8R-oCF^|oTi`hvlzgjs;BeV~OtQjmAO&XD&HWKr0z^cJu{&3=zHWaPDx|v$YW)4p
zVm@W3Tbh<J|2${tM?RLQd|IeCdrA?z@g2=gv_-`zXIATk9!F36C+)_RXINMw)wPQB
zckPmI0aMGL=w;8mXvUj8V|jC1<A!F(X4qi)P68Y{XFor558fl$e46_|gqLHU(%Go;
z*DAV?=<EM*e>>nGQY)E70O4<wWThJNjS0II*paB}4cH=$z>hQ(nKa<+*$&JPz&yHE
zr#S!lJDr^WW<mlY!5#tm+Ie(i<WiOP(@`^-4~hllKh?Ftc67YR>_->2Mt{7<LaarW
z#t*&(&&_zmcXCPWd4oLyK!k$*#BoF}Q0d`i)0<kP&!V(;&_%lnw@JA;i=PiSCVvn&
zcc|jeMec~Zhy}>}wT*u!hAsF=6en~ddqPIXGFfYG!*y4r)I|Sbc==AO4INTs-e!1!
zwY%KTy((uo36<G!IOtD>jt6?jw)UHy+qX=-Z-$D1jjhf7;(~!oYFH|obNombSCm0?
z`VP*7dK{DA6xs7!F<K2XH^z&t!cv}-GX`6X-pn{*LYR1jyI*x6Wv*p?0#yM$f<cY;
z$d-c36$QQxO$XJICLnX;6)AC(N<*LU5rs7ikG3yms-%`)dNgpLXbSgTLehluJBFG<
zSU(bcZ@=ykgy%MD?1LJ<&#J9+y}RgbH14bwZ2VgnVGJ?(!u5#{>nj0Rt=q(K)tma4
ziVzElJxbweoMo~a;3DTUJVseHvfk;v{NUoszAs%dy^bwu?JHbTIm^iAABD=!u-3!y
z7M^-E*$`5!u(7mS<pq!+$+CXOnaJB{Xd;R);*3Ol^MuBD&s~q|{{}4jtC=ZwNi~pO
z5c*^rxlR;bEupL?m4Y~ID?>r#VUI5q#(U-@px4%pDnRf2!}@){5;u<)Hji=JfXP1d
z3f&L0w_4!!O;L!kC;=k$a2WT2wIrRICDOQUBpiwblhgguj?-GPCa(4;Si)1r@^o8g
zUZ<IoANiho#|pxPFH&laJw;#pSosOsGT%1T*3+Op-pj*wFQ%yf)?uwtu=aYxVeXMn
zrN{TcKYm}Vz)T)`gH;92cAQq+N4~AIAj0=?$Ow8FU{EO@L}No~A{%kwn5A%wWqmCA
zoT_3ypzfVa*OU-(r&>9xM=HGmA$=XfFgVE?dNg=a;^;^!cF#$+g2O1&`o%X1!p=Rx
z5itG37;K}-G`PPG3vb--f9o8FdbCfPd<(7n4e|WB44836*LIn4<dV?!b96e|iN$NV
z&?2d^DFi$HJcA|4a)e#1KNIDiW1381JB`lUR)U5FusX{=>df7_H+m<`IHbD2*>>u|
zo(XZQ#J2cOy~JhT{XypN@W)nASnh-r(ZD2^7WIXW`V;ed@O=yI?d6fpUhO!rjC_Fg
z=Y!m)!&V9n4wd3D>gY4=mmQsDW<u2nEy3yT@%)^1Z=i%?>+g?^*Kfl9Cs+Ny{jh{+
zL*}+Y7Wt%gIYlymO@fp;8Q);k%`;usA1sY-!|oy}wmFbQ&7!;PqGzxPMj7amRI3%9
zXH3GgY4OvNHpUL)wld3H)@E#UMgz`l1V<$+CLR+^e%F|Mc#;ekuZ=Li*cFicbeioR
zos@YqdB-b=h4|JnGT?A>oF}2&_sYuDZp4Smg{pk;lh{&xW?AbSDedv<b@At}OwGs{
zt3QsA6s?Hxwti}=ULRrCm3OMlvMFbt*QT^9pIPB<=p+h%cENb|hE7@E?tdJ27Hg1g
z0}{Oq${v52I4vKDg9g!6&B(2kt9?9-IC>8`xW0uamOJlPD&p*sY<$LkM@a1E#V2;P
z*8e1%2ko=TUjLcv$4+)Of&S9H^l4|^u-Nb_`mIyfjM&#%=+hLOKsB9Y;=*d=RB7pL
z99^XRn)USIMwNf{ucG|%tS<|qWI*G@Z;{f&*gx#3u=1rEpM_<wvU|+v&$*VvM4P%Q
zIMdmK4Mvv>{HI2H4t-E7aHv!wUksmJ`!I#cxRtDVcI-?F<z~zg78A;beh;A-wUgJy
z<7Y+YMQS5DclMjd4{(<Nwd42YJ0`gFuGIv9Rzb|d?QKxOSyYQ(@Vn4S&w;^-X%7vS
zh<7zeUq7t1hlrxa2&hcBdBE2H+Ell>t+5Tu<htqi)J1JyvyfGa8@wA1JXsnXLCqa(
zA7^%bVvZX3j1Q@Hg|zo4UhDN7WYW-$n4}5Y`R*@n{WffLRXWLJ*!82pd0a%_Z_K1*
zaMtCia$$}^WlB{R-v3sa(RwdvuV!F7?!xypqe;RJC)qDgYa{dY=n)TxmzG{_vElhy
zk$MEb=yU=XA{0goqoIGN4<|D2E22uRE8i&$MDUi|^GaSY-n0di3cgNj6lj*AYeOK8
zY^Zez&P`~;`f0)pa2Y_T<L+q5t;1`1g?g~}rHzzvOGuSfl8%^GG*u|ieDh7VEXs6I
zVe3Ax`qV6GW_2Ii3+!x%g!Mb~*KwgWd_y4ruLuIw5w=2LHJ?Kp!@7qrWm%!K-Bz$c
zqugw3NAGNs{RtiL+iLFty4_U*lh)Ubg0fHp;F1DX{WTT(h$e(+#82*mR^W(EqOpna
zr+@gSVx?9^T^Uc~UADmSi->irb7uEO;6?{>)Yh<h!@pBCFXRk^p76?12)P$#VC?w)
z$wB^5D4!NX%{d}RbLF;Qz&idJC*2Z}Fuq<j$mRlhN@s9P9--2xn@Zg0iM4Na+Xm<k
zsNClchNp|lqsjHOuX_TxS{{kdsHGYbqgQ9B{uB+xVm0I68!To19U=M$i0B%ST3PjF
zuS09x<!fQFU#hcXzY#SX@k{xC57kB^Z6b5&viN&N)-iwQ+Cp+g3%~!<x4}LhuE9rn
zOuD2u@#C$NBohdWGBq}}C*PHH?zq)IS-ky8&u(GwxioSp;?2iyAG#IaQ$uuRyD_hZ
zbb`)mq10uAaU}ZlrXk82K^pC>9nqt)X+Pe<y1BY4q=Krs!)CA*cAu?BF2#{B2{MGy
z-2j0@tiwGfw!;bT9>qPXN-y$sy7Q8l5xBJ<=UsmQW}7TY9$HOm>yEJReeJ!c+H)MI
zgh&u-4KV7uy~0`DZZ@KNFW5y=%d_=OpH(~fSo-ZPV}Mp7$Ggo_tABtP@9hRVvBA$l
z2Lk%j-Amjyq)kb6mT2g0q}(KpKc`PK(%`R8vMC;g!FKjK4%%!eI9vIYsiiZS`OW?K
z1?Z4N=8R!SaVgJ3@<^!NtycR_wV~_06>?{hV*cFd@?VKvpYAcZlW=+{-lTOVg7h?Q
zt;gP6xKVvCoMNAqI0rjJzN1DNsBEhw;$9pSMI=ppB5|lQb`m?abEDw4H--Vd1xggT
zlc?Izh29fYeXQ#r&Y<YAxYMnERrT@X#UL$j{ah-DdPyKcrquwKVncwZfpY@*vG;w2
zi9E5+9LA84E0)4pk|0m@Q&K|Wte6Snm7s_nq?`H4huuWQ(w;F?9T1z38hUy#1Chra
zkkN-=lB>TBW#pvd{!2Ne6Rtg6=6ZxijuKY`Hd|1V3&CWQ{!-V*QJC*(Ag`q^0ORs{
zM-%32Ec>Q&=j%yBwq%b1!Aztjc~mIM%p|ROjl=9Z3IF@+S`Swv%w18-xV6E#Ln0iG
zS6dAz!z=o8-7vbUlrsm!_X+iS7Z6YV*Ce!Kp^q{<u~g3Gbjc82XNd6!T|J$71%T<T
z41x5koX{z#Ec<1*BcZ^nu5pKp3v~g7xGGZ7dw5vh4yb}Dxe*fHXI@4nxUhDu^G0CY
zCmHMn(RsCtsCY|#>J#sacUTW^E4Wr*ISKKsnLc>rlKpCagj2+b5Ooj;K)53*>wa+K
zS&#kA4wP>eUcaLR0Ck(+{R5Oa{B@bG;f&I;^$9DJspy!GQBpVp>4aWJt$AWe<6y<d
zQI@b2@~S9MVzI*ya8P3<7N3=1<O}M&Q@@ZPm&1#L!r+I%Q%>^IcS%er+^3bc`Dm8V
zaNc_g6y+uWKUVTIo27-DnbSW2Za_)`cJE5m;`=!R4Ze?=ZT*uZ`)WreY0H+6q<?Ak
zVztsK1_5Q(xCF9F5MKt%%P}h}r(fG$@UJZY%~<!J>!>$pzM)+9?0{FuhUcFf34gae
zU|w%7YZ}WMPCKL9{sV9-`~%z?|5fa0dlC}$ag>988r8(+9KXIAT%?-wu|-vVPs!K}
zb*mbl>5~1e+s)hjq~w+`E?UjoNt(BCKTjJOp0qgV%zsI|7`kWvT0FG59rw<3(8Irm
z<XyPS<yrfa(4?^c+~7B;tg0f%(&!wcGY2K^pVrsIv}y9Zk4f*<no+br^5ZnyH6DED
zDSrrC^;Jo^8f%D=k@PaUTuYaX1xX)vHgPVLwOx%RYMAdf?r^4MteaF%f2}y_|A3<)
z8b(yH3;w-aQXDsPDwn<Z&7O+T$B&#-BV0E^o<W%kFDWK=RK;X|hRk@5K@#8303;}(
z*+6F{wXXc#hQkaq8M}P;B4h}0b1R|6+^-*#KUXxwm^+@)(zxtUV2Iqbt}h8569qsV
z>eRKCM4F?EX8ye(BcJ%$c*T#bcyk#-bOu<%rLRs!!W`zAvU!t;s^q>d#Co_7?pU=d
zd&NHW*sX8ws3?weG+JtB$F>FMlU*ps`gHc_HQKVU`16t^O^Yw6l*E<swO<_SX4H~k
z;(Zm<EYQ=&a!k*@>psr(csb-NskqR8fSXRz>v=x$CyiCrw`A(IV@Ad?x=I>yGO#KT
z{iub>hn#umMyG4)H26eaFW@V2y1_5>_*W+AuIaso**NGnDnbn?8`j06n?8=?-e@W<
zEvT?qQx`P>To!yEjjJl<M5qZF>|22kY_JmpjMhu3JSI(5PJCR)q!TAu-Ka=v84X=I
zXU-8++jqDhk@wzXc7oWiV{k?>B$d65z6&Vf^nk`#;#%q$e_}8fFjhvITp%%Vew6)X
zKP>8;%K6e%PlA;(_6y5x=>g{kA0oVx2@D0%E#W0a{zGCJ7vt2P8xCv0v?jz`qO3pF
zisRRJUXDvpTi8&etMgF;ldK^b2fnejMUJ|_>*8;%wbJW1BSrGSvck?-|M)RV4-to%
z8Q#>ARZ%;iEvE-u8C8Qfz1(S<Scu!??|LH-sEBU?HUh8Y45Lt7YS;7VYT2KQVdWj3
zaXj27L9u_wB*CT(va4+6tPTnULe1~mX=w%atfCdy6(|TRqMaHCE_v0?E<{&P5>pG0
z<icP(F$dUHMWw@YzO*oQNjt|aonz}%UeeXR%w@*)Zc|0Z({ebExjG-@wLsG7Q}YVT
z9VOyMl+%4kz3vhJFZFDnvU;>-Pbz`J;0O_AU4BgHg<a_;_(U4Off}r^UFoS$LQ5Hz
zy=uSe-}l~E_x*nxIrslqH+oY-jPU<;<lUk!F|;_6LJ#!yzaZ@&p(g&oX|?K}?3AF<
zxLp!0kDVy6DdWBB&);V_ipW~elQ;VEz5J1=iPP$5_XuF>wTQI~%~vj_BcQ}hO^cNM
zFQR#sSmbT4VI1V|Zwg=TP;1l)Zg}pqS!RweBpD&B9>NOEuxE@RAaxcOf4;xH|6${)
zhO|TiiTlI)0n3cTE@W=F>={;YXE?_$zcaP@4^R>L9H8ZPR}}Z8EX`hHYV7;74eEi<
zDM|U1mL{XAw!LAzdGq;3f3IKLQvf%-pvWtycjA+93DquCPVHkK)k_Uo@fK`NAYbYJ
z3Bv&5GSBTgUtXi)MkPcTGJn%f=d)1naEd!NW=ZCs5g=m~Z=X}?j+0H4@hWlog4iAT
zc$^D3tU4yMH$jwjU?r}GQfTr!Zl&tognMb!bawBBousLQad{ktG3d(M+S&fWnIyR+
z-o9NSn@UiE1e-gPs~qs|ZR`i<S!Zt{gDP1T(2=A)Z{sIV&Ek>f7c08YM8;3_w?v9v
z@Rm3oP~IU#RWvP65Qc4-PhBJ#1vZf$8qpDTGcYMCicMg6gv~AXF4-or3qKiEF1!<|
zv{`o~mM^m2mD@<br6y_+zA{x!?G-Y%b2uaklN9DB5UHV>4C4`K^%$=<gPLM4vjIlv
z&=YmX&njC8s+rT0W`&c8absIF%T<5|Z{WoBUViCKWiW+>$?4wV^(EnB_pD`RU<xd&
zDQ){sE<{>E?xFmEWmFr-kP0(dH3uT6RlL52qrv}@A(@ow24qb2jl1S)3nr4-c<RM8
z=2z0mF(iqwct?MuFyFf)kj=pnqVZakonp+n7(mJX*3N;QO!6Hd@)r@0mky8MYNE#v
zcxyjEaoM@_Wwc_g0ix5<Gv(H!eQLH3k~Tbk#Zes)USc<Ii9g^qWY>O703uFOck{1&
zda1g2N-lBi=d)fCs=%5NV_2o%l8&fF0X5@t{S{<AR8HnAg`@QxKUi2{UtgmPze0Rc
z(gkA|g)XFV{~7c7X~1{9ElO8jR~DB33dcJ#NrW|wIcEk05|>BQEOkOn(<9oj&OD@Z
z+#m?iPesqJbff&KXP#kHr(&9v@y9l^4(qqz_ixH$-5%_#LE)Z*?Q1M%DHtbj{re3c
z*61GE{>HdXm94EV))iDCRUvmHnIoV6|A<(Ak3H_r!%0czGx9)un1u(%u0`md@9UMn
zcv*h^e4%aR{{aYU;U+}9Uaj2|h^`jXpya2`shEF&@lu>9zeG<$aegyt-zzMi-80Xi
z;I&+)b<((g)(M?K{YaGS+)thY*V+ni;jd6itp;462lJmrSC1=TDxk(t<DA2NU+0Rc
zK|raq3BtrdNoJlh;uFCuz)(mZXwFN-RtN1QTK6v<tJe?L>|ld!cPxSO<XkIY>>ui?
zR*1oZ=iJ<=pBG7zr#K#bw%lnYD`_RJ5>}MZXzyX%t-w$iXEprctcEH+`mR<SVhG8=
zy)5?r2Uv4^B+g4cyBMBbio>8M=X6?qFIO5&*+q?a@SIk$k~QHj>T4rt_4-E-@zEYI
zZr`xqm30sy(Sl`bOd>+2yz!@bx+UVGp7tX@o`~P#x}%OpdE!dWH0$v0;%YzPIGd)f
zJhKUPeccl=iH7H-b7()VLwH90VU&xHxM49HI?1y(q23$3SFu(8@e=2aC`p0zjGGv_
zpV!o(D&LrWy3*N()6#el&Y0ybCVFgFpFe|}BASwu)xL~ZE`#l=VBYpW_=V(Jq)CeH
z3>o*A1UemyPfusaJZ!V-C{Qxi4ikA$W(?E?REcs*_^YiD2V(I>(FmyBmQ7H!1JD;y
zO)9dM<UbmiN7Q>-Ic|gtHfeED;-%%CDfs)#F!okAt&3(2eSnf(im^!ZP_AhI%S440
zQ{j#T=<JqN4y(AtV_A|V-s0ENad~`_U85nd_%E47CESSjmAZVmf*nanGjNkE20Fpp
z<^!7&i?5f3834y(M7}v*->2QonJ$@+HRij~$1eOO9^!bv)a)E~i3L>g%Dh!|bPdcU
zh*J`xbF1oAwkf6+PPLL21X^(3K8<S5ac8y3ZNUsxKeM{M8|B2uap88>b+R^T#NFN5
zd`&ju1B|~wai4C#Om2{Cn*0ZFw<wPBW&XMBF`u4Tg!-(lA4sn(=b>Ys2$J&a(nGpl
z`5bNL?0Wm*ZBWB5**^e>nghvo?FY+pk<P>1idj5|XDIA1GcCtEY2|GT+V@Ifa`a~%
zwNeawR_A3qooNpSav8XOMy&>rujC`hOQePk*^KKwk+n4Hubv(2!Dhs(M*J>Yx^2g-
zSP4OPlsUsJ5h!)2ta_3TFNq_RyEprVr=g0iY@`6=v$nef3*c*38{qYRg@Bt+;u0ke
z>EidEQ{+)>b$pMY7<LN_aVXH~bm!WPsjw7U4QDg-BAsC9cWd-lW8Q*1=ppr5cGrrk
z2)@M#<)-@Klhd96W2}w`75*12@PD0Oh5WlQaY?J|wV><Fx}gv89<|!T=ZHDAHIX(N
z`9x~cb_1V9%FAzFKNJ3B$Z(?UQ5ii#ej7jToga!mnY~*Y_;ocaXBnv7f->RJ&jF!|
z_GAC#&^HveCYGp>mL}Y^`leOsa^4IH+dkGut}m%%Yryr8Xb-&US9m+0i=<%#hR1yD
z3%|pv5f~~@k?Z%I+s_F;40vE1u7k90@Tjwf8{Z;!3CcL}(Y(H$BfYNVxyv^ft4+&I
zV{4YEG51hig`fgQum!YwRWq&`Y3yWgA7B(!tZXQrwq;O*NuUt(fg5H$DHVsF+>a!C
zU})JVt<;p~BCKWLRUgzrfoI4z`MB^0L1uS4&+3*5sJbNNv48CsiQbZ?B;Tc5ZG_O^
zT&de!%?1%!7^?IWtJss_l^xy(0c}@dMp7@I2mT+wmFE3K$$AfUPP!$&!#8<r1@8ws
zX5EKvAd~CJuu4JmGm9rZM6T*Ib5U_9*DKZUd@%K8e5?9Gb9$@Xy>;aMYr{d$a3<|#
z?R|&K@9OjuzMn_F@9g7<+K85dD{xF?^BTNR3g0_c$JU<taw<$zW|;e5G*G@Y>rOiJ
zdSSWuMX8x1b}^O$+u!15UbcU7>Fs9jPmvBLn&Q_2iM(R1{l@|z;$1ST#wyP`vBs#v
z!-qE{gr|U+wv<WsXuZ8u)o2XH_^<>7`uj&m^|LghfuxpZ2jqvCPoVy}MvY|rBvs{G
zs?gSOCB+Z55;Gl+x0FN+e5|LA3^1@sPmNQw{f-vC<C&zl)<7!MZM3DMxmtc4X}uj(
zqG*C6J-QUT9v?<8iA4v!a2<1r(5eb2k+Gn3^u5xrlKYYq#3cKq^uo`!!T!E2QUf-c
zbVH1_5(e>@h#jl{fD}c?wJ<GZynLnDeSEL=AwD@DL91#nwIO?uRyD;c{H14GJ?*C`
z_42nC%p)3I(KIzWHM)WRTeGY<sbtZr$b9#nhGOQ%C`I2EPw`JGBvD7)^}FY1H;_ba
z`Ond|JHuR3k(N5&nW6<3+2C1=bG%CL4pl^~{mf$-TW3+<NzvI!@k@vg8uv;CrZFVm
z%{A`QZFkT5+UHZ}N>!2JO#TZ%Llvw%LTT)H7+Oyor{<4eS5!4>@+Zu=&8ryiU`D01
zskjV>6nrL?$z}^yjal`No8<^K*vLq_Jaki&SEO__*^=;*q1Pl|-WoRH1PR(%Q@+}X
z>fkq+`*z~@RoG1&Ut=6U+sLxo21j;v34_tqYjV^PRMmHi^xgd0cZI)q!a}rNEt;v>
zuPv)=09ErJ;Nu9}@qTH8DQ{;V_=gQq*oVxVr>ch(n6__wr686pQqRFq-KYvLVanvA
z$X05R9<4Oyd@RKD?uq%<e11MV5SI4^iKFzDPu{>w+KK2rS8d5Li^I=V3>KIbb|~5l
zcKq#G8|%OFbN^Z9|L3(h3Bx5B+B>mjEY|GD#@4b1*B6Ga>8v`w9j$*4kGCE({L~7M
z#P#Hn%Td~uE?8#z%YcO?&CvGm{SNKN#tvF^?~|4pkB%T}yRm2A)96GN{Qk*FlCzm1
zn3Bl%*de4D@YvZVg8~LP%YckR*xT&%^&@fov0L~;-K>RHkHXwmnzV%Q2|UTbuu~aZ
zSbr<SB*Eq5iXc|v83;D|@F~wLojqYk{2yRd8{+hrswiaCKjAl$U2E&0>8A$=lNG1|
zBB9Ui0W~eIkMps5E40(@EGt}PcWB@alx<90*JxV@xQEBA&_;C=8&&8}7-B{K(y_On
z2>>YQ?A8r=_42jnAw5=(!dH%@qFi4d(WHsQctKp!{m3?l{hXCzU$;jtsmSRgH2a94
zUHiQS=khsiuh}Gj9MRv$m9`yL#sS)Hy2ARRiUv<J9W5vIzl75prWZ^NjXp}={xNyv
z;^HTmQ#vktfe1HNb@v4F*?z29sYga6jM1T=rq$F8yem7iGe5g@x1zkSkrI1U%)TJ4
z)g<W5C8yeAuz``=qhq)1x2{M$ACU~sH59wrKU_3Se0ceeYQ6Vehd+ui25Gmt8TKzG
zm-THsaAn?f_~Q%qzR;#p_2X&HzNOU3DwfZS@<C52Ph^gE226Ozy?OC0J0x)-T}sc|
zIy?OOO#v?>t0=l<-U+t?d;@>jq+BNUq6;-8-8-dw>^Dnf6_2Pqq~lo6bW%vwtQbhh
zBXpEOsC+iKR|JmozYHHrVRrRI_1a$;Hb>&i=r7{abh2sMasN`)E5A9~q(vC=`}_lR
z3fK0MUA26^Qx&bYszVtDLJ&P3H{S74-f0qj>Yx(c!3n;YuqpoJ6Jr63?;j`1E9yO{
zy|UsJUth7=8_RfPyEMF?%^V~%Jwm1$Op-AL$;BzYWTO_KR3scHX1#eiby*L!n}u_?
z)V}z&#;2iei?^;wUJZ6qx0qM*M3&P{mB+|FH160mg{n5LaUCseAkLEfCl;%7c*5bl
z5NtcIroxl4kDR)UG|=p{7H;}Bwy8_#La|i>L`5)sxc=>k(0y+}W+L@zV;|-ut4~h0
zuzx-Ro*kyepfW1Zm2<L<c2MsQRI*HbGQ3RMC@dvzqK?cZOAs+j@n0&5SoW806joM3
zT24=Po06_(?jYn|DQ0LR+jLgr!;Pln@}_C$^4YS0<J>Ivi)SdcNttIDiy6L*H8mWr
z47ARxpZFw>XER)dX=Yc)R!cREMSj13k?@kblD=}PA~}d@ONtkJmvbXkSfB6ZCj7k(
zZU4A+^<>;9Ln6izx}+=I^4Iun-+azr8L<mtHR6quqNurqsOR0e!=Minw#+6z+k!5n
zSCY!ymG>^a&=C`kkSRByGV6S2l}GjwT2qmhT8MA9GP&nccuLw(T@b0SyP^PRA0iyM
ztQeXRp<L&U_5yhw!Pk#2c2B6B6}KixhdIRM1EbN^s>PK~7;;Kz#-S)4{WUfJ0AD4i
zBJJTkE17?ild(xDxoNIw?9?BW?m-faP0L@2JkKXMW(ApXt+N6ver?jq;!;LvYjgvm
zG1e$Oo6a~P&8#oTTgd;{$u$2leBEx(c3DD3JYt;_H7g!n3@eFyEeZpia6t9fOJ+ZJ
zeHB+Zk$XA0=}xOyq|XK66m6T>x|bM#*y?#ct_47XG<!HgWLNcf=i0vD7IXY4r7epW
zivQW(ai_{lcIo)VgaAMHSWOlPM%l&euWeH0%ZJ=qESKc$NGb<RfL9H7T)nYq>NDr>
z#A?q#Rv6V}lp>@0RNDC3qN*kvE*ql5Ym|;NHkx0IlpcWNbr+Xr%4Y>=@A&EXn`&HA
zqh|&w|KPVLSN-}MLo{f7vCWu^5?u#fjv+1!Oz5yHpE1%_RE*ZXbr0__YP-!b+Sf~m
z!T6UZ)U_05d*9)~4746)H7SQfB}e*{5m{A(?7HgKFd6y=6^yw~t4Ai=Ta(%rp)R?Z
ziL<eX$}f>t%T>ySp}w0ww*k}Q!z~M7%}18Cs4K;d7iNXdtp&DTH9BGU50FOM(VPp<
z%}=;j1Kwxp`!8HQO6fcs|AC5+NZA}44)4awV>`t&pDo6q8kNOmb(j^d%Na>zFJ8ia
zfu-PHS;&#2%l&gAlY$GqTh{#`iHb-ZK`N!We5-H=ve^?nNHEq~reQ2Jb3Bw}wwGfN
zfYUYN%2iSmi1i+u_2N?PtmxZ(6$|TjXs=)+;gI{65s>);QQy|fTboY3N%!kD)VKd<
zMBFVyqG>4{xR@k|bMAI1VCtyVI05DR_Fdjx!hcD!$bZ(N8mhI(-}*9frRjwGu+MJH
zPH`+)Z%%taWsKW9{z5D@V2N$rM_f(O4%&u>E~%#@5(kzmww20feWG0%K5?JdMPghF
zcU}xUP+z%O+e0*dMM=DOnMWkQfOe${4i46^taeItm^k3H<P*=;=iuq(8kfkwF;nvk
z`%zOX`Tp}|umIz!%tyreu)Be9O39=n&J7zYy2w=Gl-vBN(g@UpA?E&!q{Np9;Sasr
z+W4OLtF7PeE2kWLT?2aqwXsiC2T62kSGhd-XrHU;ODEe#oLM$!3BU0!@)7m2*51nc
z%+U!c)`AZ25`HpnIqP&As2|mF&b($rZ>B6M@I~}jQiq%*z=QiAV7BvBEI7OkqBz1}
zxxO_9svuOe_`4-%%+P<LqP9FjQuP~M^S5bz3_)Q{<e0KHQ6=(z(<UuX--7>P!8ptT
zylX)<+-fiwnw{h>Ojw%0@Y|pcW+pQrQB_blK`r#8(s!M^E$JUX8r$y%e^Om4&)Dxu
zY>-P(ldO<>>SDjM&g{}6-nyP$TnDLfPIUi`Ax%3{rWF652?VD_Kp<<+IhL{9HjYk~
z?5i&vsi~S@I-yH}qt3Uw;nm#Bb+Og&_F{sR!(zs?TT=V$MCxASJSLjSq1-8)uI0)?
zPI+i;%U#1a{bha=i1kpCk>3aj-g9_aBzPzv(%0gQ83QlAJU)MG{PJ;`dYl2i$Z1a@
zknfJ%W2e)%(lq4~aR!&L`vdwKl;NjydP3<_ZpG_V>TN%BJsv>1t{3$WfW^Hy<3}@E
zfje6-ue3MVeSmVT4!`~HDF**}^7>z{(>R>MCQj~N&&Ts&!MQ(Ytp1?Ntl4*Ypu5sg
z8`SO04;{+E0~M)o+{<g!j@#769DBUc{l7T-s-U>KI8QV{2o@|rW5I$G+%>obhsNEt
z(Ez~-E{(fe<23H>?hqijyKBDfZ=a@SXKHu0s$cHyuDbnl&bj}eHj?t#qj_Cfk?s?c
zZNz+-BDY!>lrYc4$gIyisdys!<JMBaZ=5>iN}sZ~6j96r6iDjbcGFa^nd+SUDc}W{
zZ<(wJxR$1FX0Th=Hzf=Q@Rp%@g=oyUx%M-z(iJhi8)D;O;H;k!{arWdygpW!5mhF7
zz<DSmgrAf_Y#U>0SddP-&yr}aHWY?JpDC41VX!SryhoBWt0nM3Sy@t1(d*Oj>Yrg|
zmzpBmW0Gtlb{<_6^dx<Kvj*@%+@T;d39>z9JGBd=bA&jMxS%cQH8a_l>1>1U2YTgp
zJ=?0nIc~d$bTCM8NoK-gt6AWMw$;0aRNgaZ<;N!~GnIEz(~H;WF$B)<2R$`cWWTQn
z$mXQ<PM$qqy%E}!;LT6PopU0leJ_j}Qs}<GA@oRFkXNwkVR25{U~L^tW*Mx9`v1(9
zy(%sP9#~}4UGd}Y)-KpEvA~NqL!keT$agBGiR{Tb@Rv1hiuZc9)n5}%xkMZ#^?}#A
zfFu^0$=OXfKUL^kE)0(whxC8XP?ab^*%wJO)Y1B@ar#D!g5s`%?Iw$2awh-Na<?Xf
zB<7i^9x0G_W2c5t=gfNih`fBw;RhXrc(DePx=25%l7+S#q``<qk|KB|%KKqxfmKoA
zIGl;oYVBGA_$rM9mO@O-nu2S}FL1@%ZAjCeanUbYEWk_5t8J)d)2T%FK&|w)+VRHn
z{19{dxA*3praxi8!RS$wVw8`@O`z?wm{s$**HIVEEQhXLrUEOhV3Bn0`@e3)$ZBB*
z0iM(QX4e&%O*$$W<UM5Cqb|fuh1#a1Tqiaix8qyg13U)bc<7bhZ=%PSq$fit;Ol}*
zj8by&OJX)Zoc}dkw;0jT(B4V8EI4|pSol>^5tt+0c@B%>FU-*uED>AbNa^=8|Fjvy
zEZWwRw8FkOk&5o7UD?}0ssS7hsyCHiQ|drDE(#Yn3gzjSu~iJ~5@tB1Ps;-rMq9WI
zy+{SU9A}gUD=SlB4zyh#*HsIThNA~5MnBVQ#6DUEw0tkI-|eEvE-K^=rIGw5^4BCU
z{u$R?dc7mF5Knl*II&xMNdA+@OI_rfL;Z9}@qcNa|G(edf(t}NBJI%^$I8)?SW#r+
z>69k;lNB))1Cisqfoit(Zy;NlaG=ajQAt8O`eEbKKB4&&i@w11E#BSN`F`rCqkhuf
ze0^%S#Si!&)#S*DmP~l@i@1~>rX}PZ1iGs<1?0<3ayZ63owU|1B7=&Lu6%N{DUo_K
z*$y?}%C)`AikVwk^4y5XlR9mVO+%Kb3n8>1YRYIb$m^2a{6BEmWX3jH!uh{ssoIqo
z-cJWkd$QDyra0AEL_H40fB$;TF#09)IJf5tUGJ1o<^ag)T3oD4`e|LyPqLYq7*Vu_
z7%mUVS*@SSG&CdQT%*V>O5-ECkZd-d3^zlWIon)IxBie+Kz~+JsZ{0PyRZR;b?rV6
zuPdNrx7+u;-j^?cC&gnj7UeyaiKKy8B0boAQHD#M*rEMOaW2VLo@o)XlYj8TL6W0M
z^dem@x21xnc!@w*UP7A9FiaLUA^D^*>YI5jO$$r6oW=>AQ@4qP<p|STQzYX)#<z6X
z=Px9+&`?FxCLAR_$Jp5Hj4iaIpkJbsV}oUZquL>RnR{?f0L@}XD*cE_BBN<hg5TzA
z+_8-7I$vI;BiYD9a$43MzG@jix@!A!d^SRUX}Mn*V2+-5canw^Ix?(|oBtcBUd^h{
z2osY|3SU|}=Yn?b7*%VH+i4>=Akg-oct5gB{B;MWBD4s2>;JfC(5uXGgVSnxoXca`
zA?5Kk;GLFbkUkY7@Xrl#b8hmacc*}dKgr2Uel>h~Z~|f)qZf`z>b(Ub)j`G2!Uy7?
zCAS7)ja!_aDqI=@k#zpc4nQ}u5JNmqUmXOUJy2{9W8E8aN_l!V{h*GiZTsK|!3!0s
zZMHFlEx@*6=HN|yLVJ?e4e-5-S%A}eKJsmmWDBL&uEXh`zZ3KH6BLoT*8lfjY7zB4
z2{vsXPDtNdNLOp0BR$2}b2LH!j@il3;>r~glJvQf6xF7Zo=H;8N3$$&^6I|8p_fhZ
z>>xU)Hhp=Fgv@Y(tuTQ<93Y9eJwF4j6y!?NBH4QMT%5k`jucB1eMX%-CxQBT(#!ew
zZ;_<A3gY>M^IEmqDKlNii?x`OyfIeVMs&?{T>GvBlOic$`#*5+DRH-#i;NJa`-jC2
zQo(+Y$d-+cB@5WW%<TW2(eeL!|EWRreC<!Go!Hh}Vx!&=s}R9Z{rtvWq|hl+kLucm
z)uVo`2xP2~==`QipLM)StFKE~#S9~|yd`OT(Mv&&8KNIAEU`{jp5+$#iNzs1YJ(!7
zCTf><|97#m$gg9lZa9u34V~QZD*74%M8_o(<L{WzW=lU<_BempLGIc$O1Dg%U7BC~
zfHz^`yBJB?p!Y_k!q$H4mWBpYZb#pwjc)>D2%(~4ITxRzDnGZh>Zi8OI!XH>!kxA|
znzE#2yE_ysyiaVGP*(3pl#d8pHe^=W)8trSXxK?%ksDRH4OWBB?HRK-RHn-tqSdAb
zD7hjp_~B+?BWoJoQWReSShH)B+c9Yxu-Cm-hZGNeG3h8|CsQD=8WD?#Xlkhl9{lZ~
zUv{gTlxfKPt>_^}nunzyZ-Ri2iM@VaiWXz}RQfQU7_#x3<VI1!J3>${xgP#Qfyl0V
zj9zug<i<il`}%XpHatZjM%Z#lnRM)enoeEzhOiQUtl_#T<j>c_75N__PTmHbPc#`!
zZd45+Rkoy+naqysGHgLUe`rRRbVe0t{9Opt)p;y`;0=b`lpHSJwGLE)Ic#;HL-8^r
z6cKd8?p8E5;~TR)JlSIt+jH)&Sy^{pO}VNXwE<L-kf6x})p{abIuiWMi|v}H@*Ugk
z%SD6(GI-Y|0ZhfPP|*i-=-K*GEOOfEtD?o{gRTx*aWO%R1rGVuE(!PO$_LG@>eH)F
zu?R9xA)R{9KQjBT<mdZW;6Ujxewf1?>GHkkFX%W+6xXF-0VakO97=rttd2HW;&shA
zxnIdG5CW{?Yg!Np$-XVf)wx!e#EKEcVxiaC={#IY_YBHB;}9`EgqBmy%QHC*nkAi?
zzS|q@@j8`Q<?a9vh|cN}E8Dmt4zmhq=&I?`{s`B*=_dUZr#S<?T-&*_g4(KN9yG&3
zEX(sob!wV5WY)lZB>{D(ETb<VorV@dd0HvM@M%_hgMZ*WivyPCW$s^3rH`8+`{yzz
zhl?4k+y|lk5-|ZVy8?xu8>MNIn!EF!W7r$Q^TDHv=&_+0sp|dmqPnnDwmpH>bN%bm
zfSy@t^0>8YEM=wDwvs>V?4uOf8soeCz7<=w-sN-NI4<E5jZW>uW9<L$V-h=<OnG&%
zrD49Bs`YS8>=^4#yP_thn^osbh{ryd2q-WuDBIY${C08Jt^keeUOY;5Xz@7vy>nY9
zyGll6xB8Iq1HPzo#tb@GPx;eI`fL84{*#6}C+4m?RfVkxY8=^FRdrfRzSEsHKFbtG
z3kKf(;*P~}lLOSK%7>a;z9Z**JyKLsz^N0ZvZ69eIb|5%YyEdy&%}OV)^A^pLfS{8
z0^*l-xgL-XD?mZIE-8o{;m$1#gSL{X6MA;GpK+uXPl+e+vSOF&mf}+c*^x7-E5ob=
zhK!OX^<F1=Xx#St@*g_|!Zb8_`Ewg8;oy2wPU`>%!zV2RlY+9XiA%}F;=IjeTzPq}
zNrOYguwGYX6$}F(@Mldzb1dYwfEEeobYen&`n}JJ*P-BsiXB&cW&l$ZgUAj2b`&mZ
zO79WMm}rMO*~nbu;E!->!E{9F<Eqqa1=H-y!TJ<3cpEk2=qQvaOMxIy<ioB}t4$U=
zoMaGBiwI|kf)wHEgY|NSo9;fN@q7ro1~a#lroMB-hP15AeCPG=I7QxyBl2`<vU1|1
z&mIP9tJqs%?_T*p@cSJSn5O0jLPZ4C;j7yHDD&m431wT+_<{+e#DgdOS%I^qcAgGI
zf|ZL3$>UyGDC;T#T}`EB9=+3xvDK%g_t_v)LG{h!2Mb|XYmA6wi_cD0Hdj2(EB6y)
zfuAL;)j9_AiDpwIaJKn4z^689lC}?g0^t8~oW}V9;Kncv3pn~i0o9?b!E6yQOuyx|
zr*O3gi#1M&Ko)Bw58G_4sN>i^zG#!TRsl!D(J;Ln#qww5Ca^p6cLLL!#l*$Zf@#SS
zLo4SQ)KzU&x$m91+5@G&+^C0MzB>^c?A@(c+_hNZVS4If({ba{!IUDqyAw=!?2y6c
zp^N0IszKASJF~r>8CjA%V9<y9%B}WO{{t5oTZZ(Sk`oV$HmGG(TLC(2oVnwmSvhez
zHwW2ED4E_H783UO_3;Y$IevkeRA~9kU?{aNEatNFwrQ$_r6ZUUT_N~?)WZHBeoWAh
zE=8iQ$Fec-K+2>wPGjc(b)XR4sxvKOn5vgyO|c8P+biCv9gtjF^4GXj@5SwL<to06
zwi`qB+N2l-2OYS7#iG8TnDv$_G}EP;5a%Ix5L1`q&Zv4-kPg2)Ukn;jhw5qnU|ikY
zaw_I3&%iCRW`b5Wqo^E)dCQnn>lZp{JfuscZZAcLDYDl#d^p{Q(vXlL%M+-@EpW@D
zc<A5KAG%U!%OjuL869wIz=}+iX5vF9_T3mv4INLWg`U=b!ZWIc&#CfseHnL0G^`uq
z7~!sppFEV4YWKrhx&>y|E=d>N2WIl_nN>UQ*dnV8)S|&e4Yy(iH!_M{lEnND!<L>G
zIr&a3@uSccY2ZI_I~wmWRhsU!pjahV?P+^du+jgSmO8$ct!2NP36egf<Pvl0)A9r>
z7uRTxq~8J=!B+yLQVt2+@kNgcA65grGiu0$G;Vp#9v2+6cR;yeC-#{>Pplxx)7$T%
z>0q)gC`p0%Z=^i$f<Ph?=c4+3!s!}2854DkxcF6Q8(ofw#{LQ0{*<&QkoX>h7&$=a
zlL5;sZB0AZq-lU%)apNQ3v#s=X1*iGDd}IC%uA-P<s~9j=h=7#>jhL&X(d*#+?#np
z?@p4c)&?bdqW7u@D9YA3bTHiytS)$tKN_v)ff^R20jiSGyBRc0ZvahFGs#>8Q3KuI
zbg6HvzuS2YNB^|mKGYhh{Wjgmg=LxK{Ds_{!6H}jg(n*4=L9mkpRkVGAL{W#%L%=#
z&!yOT=KLxb_mD;N?%l2be%?u$5+zKu^_I&Z^-NmI`LVTr_4z~uYAYWTWVV4TV^hmp
zKs({+JNO%B$pX(}1Gbd{V7*g^h*qRJjNUgH^<)^tSPQW2Y;YVet{dLe;bPoFfoq^d
zTul80r*@&s+(=MOfqgUu3%gk>oGMY9)C(_qI^Fme!kkH2Mx8B4ZodXZJH~-qmCX*T
znLs6^iv{=k#Kx~=AMmZMIeh=Y3!$8R=s%y^>ZlOuNHmL|x+4G9K_b8}g-NaVTplsu
zz)>sl=p0j6(NGYPeJhctvlX(A5TT2c@|TRjP~V|0tJR@nXG4#*0FE3Y&GWHB?pgU!
zNRsL*Q>u$~YX~lghy4Hrwl*DCd;`2<jhuKk4Mx@a1lZLl6>fOKSeAcqV(C^ZwJIxd
zpP`E5i~dhY`v1t>BQ!@dmODKit!^&K{6=tZeL6whj=vm6H;eAa_Qby(*!L~&1?>E_
zRQTNyI9G#3BHhm)TY9a1Zd*cXJ``A8==w1Y$Vw7@`>0G^2H)ez@43;t#KR#o57OE9
zC;T|Hk_k^p30ktVNX=MKVo=?2k^#(B6`Co-wQ;AcD6CXc$HAd~;Vjwmm{8$j9PZSY
zrojovrAGn^97-L<oo@09unDS<+8K{g=S!rv_KCT2TY{cK+RPQUlfPs!ZFAQ+93U4q
zq^@LQoZ`J$w48#LW$n+*za`YErGN3}cIrHs3q%~kZn(2N^=)v@85bfns|@8PG&t~Y
zJc7~YMdM(vU}w&bwZJ+KTd300pR|9Q0MCS|lfdqFG?kAzPtxZ(Mcrmz?~0yCe1Q|n
zQ^t1&$tf5G5!lP=E>9=N4O9fld8I$e5h+SAuxqs0LP{`MaqE*pex=T{yw@hFH(k;&
zijKalEf{8IpDoPhOZVpag&9dg+9x3k3GbNOK@8Xr`uY%a5;j(gHheN-9FrF)MT)j#
zPEYm|oOheerhv&!cb!zTf(qU7A|xhA%KC2Hci>(O)NzHcWTAt_fNHVx%&hhdX01kb
z2TmO}-;q95(wcDLoNr#e_9!NVg8(gVt4E{@@%*#80ea;#BXz2?hu0OfV+;i!5iGf)
zFcIbdxc!m{uBJT8d;LN6TJ;jr>P+W1M$WbOR$k_Mt=jel4h5@jiDT5`FVpjJq;aBa
zP<+zg!ryl?bB!xG{TcMKDXi9%)cz>5J!;f%37miY^$W%p+{U>yYE?N;sQjG)C=ZZl
zJ(apIIsl`0TzQp<{^<RipFrscTFO6XddE@x_dB8iX<KmToIqn|jpdr7axWLnDtb*`
zjOmBauT$>+=t&=$9E4?=<V-%>DXy>PP%jMH)e)J4*4v^N-ofPNBv&Mi!Di=GIGmi3
zHsaQlO^SFX17`$VZW33h8C#eh`IAnyR1pyot@(zYo?iA9%(f7@<Q`_V@56cC&=1|#
z4mOPMiwzb%;(V0ojyseeodYFey)~yiYfB0o+xdbG`H<elGG;upl2A55o^u|V;U6l1
z_Dsv$)(2(I|G?ep#`qdyRpp`T0|Nh(TJ?W;Nk+0NNVvuzw4c>joV0<>8NJpXi<LqX
z#YteOl>O=0$cKYXm?x^rdYf>}x1i4%%hDDtLV}CrE^3(7csScO#pmykgTO1q+-*;Y
zQ-1zkM?Q}s{l);Ra=4^G#XoR;ahC$*8g?;lQ;GzpuI;I&XX%8$Vx+}OZHtS1!<hf7
zax$tCxsZ@XST$4=fFv>&tkZ`|`*o0c<7x-aXDU|@CX8EU8OuLCr&!j`1W7dwGmo1j
zzCZ^WjK>9&@raeCxXOs?VZQT8>3wxlfSolcQ<Nm5{NIzVV}AloYEFGy36r8vx%VYU
z()7Ja85r0&q=;TLZnwCcLQX+g)At4*WH3I<`QRF}UKxMy{DdK--jUh6RbX2Zo$L`T
zc<xm#wR${^db-a-p7i{-FmF629cEmKg6$vH)8x<#_@iroTos{L$QO+5Wv5jbi<j12
zSDaLcV`|zrT#@FRg0BSjVabbY2TOjXMtt#=2AA%Tt&lhsaJ=x2?9^zVLn`|q`WWh%
zcF|Xyk>txUc^nrri`s)SHJ4ev`6?NLv>*G#-y6%-_HrS81aMP16<vV8F>?rL{<Ofn
zyaD(M%TX^gjI<6ouz*qzz2!t#h<S{-MW%1%CG|g4K@F2O9}V+bx2(p=Se9bLtW@1*
z*mEs>gWJj8{WZPQv-`n!loz(J8w-tk*x(Wj9NLcO!WE;*l>bFX`?)Me*EVS_V$!tm
zM6-FBN#Td!e0*D?KlyjfXbpQIKB0<ABp-ns@IY06C?!!*Np$x|wD>=$*P8NWOKP8{
zyh}2ej9Mz@pUUa!(ILxE6=#kqfyOiJ@GJdH8$Jv33RCLcZ8F!Zx7a*P%%m)tMR8I$
zAY<D<Bj1q&^L0Q7i>Iza8vXNGXCGoQUDcDL5I`NzJ{1)Xlq!r8ZBq3(&ha@djD$ET
zOp0L+XUgC<%v9kx&Ma-aD%$!9`StCz-J6b1n23i|{!LcCRpK&41=D>K2EixZuxCjG
z2)$1qVRG91Dc`bd)M*LFU$MMaZ0VpQyXhvQsJWO~aY5#TP?cXS8>)Jf=&M?&!#1bv
z{iiJ!JXV!SBtYTn@Yj08d<3;AEE@ll5{^#PHgg~tWrAa3b@6&%8Gb<<C_8`Qb0sy{
zaxEgd7zuXFh4&qL<-Y%EXz6sEq9qgsDF>lNUc-AMxYMcSs@^*;qh7vitkPmH!5K5T
z<cxU<{d3WJ`}u(xBqJE6Pdy}HZkuP;C_Pj_wtr;A>Li32-pmLOwV)uM>i#==!jplK
zhbr~|s$>5zcLueOeYpcxG=-)1%U5~ZbKNmz^%RfU^!^hPI?MtUhD1%No6_mU$;8Rx
z+b0i-LHYx}(yQ&Cw($ZXsACXgGJ?pIrj#7=^rtmUPq6l`wQWzQDw8zwSXs>Liuw?T
zfjzVZZ};OX4Wov9_Jw6+*nXn<x9KdMtb+IjO5G&3_YwA0_Ks}ruHOYU!~EOQw}s{1
z1)XYk+4KuCDzqr=*cZms2b0s_&a(k9@V@O!TBa;lq35y>^Q~fS(S<EB%K-`UQY4>9
za5pJOiAU(yJi!I2b~|%s4xkJM%=*l#NDs-HJtGmQAcx4c)=ZvH{JI?ayH_MnXsR%%
ztE=~vPa5Gec?3VP>-TNVKE~jdmDy==O?*n<Hd3*NB8F05sz}1L(qAlmE__*#y=ibV
zxB6@N3zrZDm%1_+=h>0~r?<$Oh+*9=_TuS^-#OZ%0Ap}`1{tPJYb+YF{^?4k-#E9h
ztvuT(mSkS!R$>w>i=9y7t{yC*aKrwsqLvh2A1geoP$Fy|YlWc?Y5iN(0H<2a`D@Iv
zWWfliDz3dQ)Vf8EH-#htLKm3(QHRzc7`-t2DP0DXiN&1k+`&Q3lrY$R!C8^2Px7h~
zKQ9=&AlfqIfqPt*t~8PI7&8)iZ>}{xC#}9OnF_!7Tq;ds>Yy3Td#BZr*02q6j|Rp^
zYVfr@C>Y!Q0~g)aXe%o(tT~i7fBl|0S<D5X`xCBGW}xy2Ld?m6;izU?xYtj=jg*4B
zOYjY9MmV2T6aXv4iO$Xo*!}axz1xe~l)so?u3ZzvNW~O(dSIP@*NjznyU$0PevQqv
zE<>nlDj%smQ#K9PVa|z=o)wQ3Y~z*vMeueRz#*l8G(fQ_OHsklYF%oWT+H6>{_{+@
zd~JeE7K)M6m0o#j7tQ1?k?w({ho3(0`B@UGr<*=hS$USTGH6eFCzAHV4usyPOY$~b
z$gb8dx^MlKl9C=?!@;pjxH-+EMyLT<r)gYpo}Ar1>>#W)7?nK}rdgeDIP2Z=*v4@(
z6G<fRqTC1D{7#U6;W{m*I@8d|CC#G3C@k|lZ^|XdIl4Er@Al2=>&VK-oByhv1E^ZK
z5K=y>`w33Yj!5RW(N4p|iK;L~hILt#eVx3^lf0@^#uaNEkbR%$AuhG(w7cad8%pOe
zJ2zb-)2xxfyXOgQDbw9gHd7UQCGze{>fL#{*5WRV-L8q<cPMxevn>!@ZDnuPqc1lr
zPlvU?S78ERz0m5t92VB2=ceC?Y(86`H>&j>upU-H@BR{t=f7{>=fhZ`+jak&xo`}%
z_%GPf|1d89_uo2CVpxO1;2h*IE7sId`f9PsH9py8aBEuq1IN-Sb(EmK)H>m01yI^k
zQ=zin0(DcL`HtMF0W+6E`)l}0LBe$ImoXGNedB&VBN2W$)BGV1bKrxCUT%r&%!<9J
z^qRCm(>>}-giTDzvr>m!FV7WkBGJD8z*Q4#FCFej-YI;#)^0Msl{9miQwLfgh&8$&
z`APB?ViA*+7VucjjMEwNSSqYqO=b*xB_^bqy1ynGn@dc&6~;KM=*wfNNUkn$lB0VM
zI50uPk1YhGQrbWx+DC;y&l!q2mo%wXe5H;&MyYl-B*>!OlE#bqCq6l1A0Y1*rp=Pw
zgaeX1kYEIMMQRAMl9n{1EJDA&L_^f8{Zj=hwS~&cAqvtozaBn4Wy_&;vAab)AQRAM
z)|OuyG$^2n6&+;wy&$!KSEsVy4C?Q#*jsc}CuUiXv!HDmxJ%ghYL~0{A!h(IeB;(B
zW?pQsu70@|zB>1W)}nn)I6*l&BoK$bEJ^n150dNV4Kv|$iHVOp6rK4Ma%_4q%kH_J
zbSYG|yJJ%9q^FeEJHt(I#p?7%m~YQpTAkczFQ4^jF9<hH&bhZ(WYOMyZ^NL8R?dhB
zL>&jt{*)yyo<YG?21JK<;Z?Q8j*0Eo*S2n~{_H8a++Mr!xHWKr_`D5fAFkc##<(fO
zaN%-Q60|_Y?>y~H_&yDuE-th3g-Wh!90;%(F8lyuy-B~(NJe|=dhGAkuW&{oGOnR8
z7Q!|ZOiOiTb>q-+_*pv?`1$;*>LEi}0*Pc<rS9m~3|0|gDt&|PC7JEHOCGVer*dQ#
zk2E^3_ybkwNv*|z=a=h!V#0s|pOz&2(J~^b-!iAOSp|+*96crzj747FQ@48Y&nbNU
z3I7K95cBg_m~`?p@Q&@pEn~ug1pOuX{5Rc%XSXW~0?&dyij!Brw!c0hKUC0R755&R
z6cobrHHxFtyf<`df^sAGj_@V-ejm&Mh=RX5m>L(QLD##4xzR<@^V(H6v9Om_M-ksQ
z$bFI#k48PC_<(^pc1Ut>WIAcHs?;H4t<^q0&1uI#kCx2eiI9Q9fDUj+p=w6|<))`I
zIw?PB&(dyThEcg6@6${s0uD8Wt!+qF<$-Y0!Z)*64mfHXUE6gP<#7J5$)X2Mle<6v
zc5yiyIkX0he{ttoD6~oM(y>sxoR{QncSMRF!miX|jXouc{%tRj?yjY_&D<Q5>wo^y
zhvjBh^8k3TM6}NdV}SVnCxF?%OPhKbiBw!?0SopgcJ*JrtXw~4$}A~{wlfbcSe_9-
zFI=QmG?O0029tMDhkT0#ou1qRP*Tpb>~uuov?({?%cgDAn04YR@D9Yc%9dT!s>6uc
z`Ga8?2xpOLQ1<6Fc+h^sXM=_WM$p%@eN^oSsQ>=^)#RD^-ObJSL*63W>0_(s4No==
zpDM=1X^8{LrVlr`kc}2*WWW8L6=-GgX<sVre`g{_;LQTy!%hk~^LA<N*Nw%7&M&r{
z5Y^AITO3Z4J}C7|v{n5H(7AIOP^9$btYo6=AiX1#8)lH`UNW#vN<Cr82BH6mv1u#c
z`RV>A7N6)dCb5<JVoh6NW00G~w&@-7Qo3m^U{rwMhT+&(rZv%rMHrIu?H-omO^~p>
z_!~5PtkM~m{bDdTzeby*Y34#eQh!`u20<#IpIJ*R4*bPp3|dH`JFK%YEun+$b^sB|
zQQ;*m)$7@^>cI4^NmxeS==!31(%hm5g;1uCgqIuR*Jbaq5wa`Op8lK}*=EpGXxjOW
z^_OVj4b*N&n;r+Ez=O^{ZwtC%yaK1yHV^AH;Ru#M8NYCn^dBL_I>OXId6SrfjM&2j
z-1#XEBru?<#nzQTEh#Nza7!vvfA{)*fkS#1a~frv*VX$qWo&bNv_wG*_o$owI@H$5
zfgP4mp0$<G#hZWNdh0lJZq)fzr6yh=n0as??QlQ*V#9$oMY}Z;e=^h0qHtc{{~M_a
z_AEP?;^@;gJ+9lUG&7Qh!=wPdqMRp3Hk6iH5qgiPI3G^Zse~ynt749dL`ZaWee3x;
z*Dvd2OUwm|orh=}^?hk@ViAaMix_~Ef$KyKw@_MpYTiaC8)CM3Gm|KW(7yJ12*A#T
z8l8}yTsT30gYx(HB=`fBOe<Eo0z}e2G0|_Q9g{exv_v7vBOVjH|G=qq8_uQVpG*xo
zc47MZWDW&&clEt$5yyiU8s<5F=}kHM_7(W4-5F~3_@?(c@vC6q^IBvbWEuRe5?KbS
z#Ld`RRa>K&S3EyEpR_I2>wdC2_b1d7C{jSeaViEg+Gb5?5B-t+j&z7{GGs~Q#UBkG
zUNZ>MH4}8x1IzQYwLCNJIKK~<u}z<=Y@l>c{<*=JgFQ1ER7#I}{9EdL;R3^GW{G=7
zZjtA`lnuJz82sqT9|nks728ob_84{5Yi;lK&oOZ#Z_WJ=-qJVdU%Wz$6F9CrTFg*1
z6Sv;8ON}t6+Hebs2e?N4>D=(f|7yQPPEPQe#Es$1%%@BSx#GYg@v3U6^xTx@N-lz~
zmj9}+KXQ$VL%}tI-|OK&ly|dk*4Rbyop()pG)T_}8tg?Dki)Ne;g@~5njD{LeI3Ht
zk9Q>+Os3l{b@IW)f-Z06I-#r9E`5Bq%d?2mf(DOqeyh!0pNY(PVn*FHt8J8711zBj
zHdSfroKgQj2}xCaqQYCUH{Weo@&D^@v_sIDnmoyZTV@zr=YaBW`Y`VuENCy@XgB#t
z%T9VhXfiE^Cmyq94>L(|l_isBHb5=ltP-!Uy76`G{ii)V(=-r$i%?Ad#G!x`;WBno
z#>g0d7#u#Q0KVi}vo|ZxaHjs{@-t$wvF}S4%z+j5b*^^B0BE4h0&gfI-uPAy;HjI;
z-p;FT%-f7hi_vQJ0e@6#yJSeeN-pXPKs=4NsrZosO-iyO7HItkP8iv1E}i}*J*X6Y
zL%nwtVhPiPqYu8e;P2^(?_enYw$63JB;|Tbs^yG|XIHVT!Ao5BGXJBr<2UMAi9LIb
zC^@ps!dGQIx(WPoSnIV|G^o#I9H>zJZcS{B*<yHv#GRMdmENnYAT2A;in$~E-I*Zl
zA-Sc6UdbqgH7CVepp%G`sSy#~7zal#m1b^60)T2>n{4_T8B4kY6KP>BwpV?X=Sj_4
z%mstN?_(a(___~g{CN5j*k&OyNBy+_auUg><G<Qkck~YRVWysiJ`XJpO{5wpr{)#5
zzBROBehnprT_??TDnor_fccc$2Di~#DWw`R$!AySJE@trMgu2}A?j=I3T0QVnMv-}
z;;JeiIU{qSY46%tbU)C7KFK#b40PwnJ&?KA#%Gb^_gs{9v%^aWGl|EZEDf)-%~31#
zb%^B?9RzzOgSvX3IEiocktbmeQ+VUfBFPInu`+%*{Q16l*96TGFu_Ve|4of9>x12A
z?7^rxUc<6ujd)$OUf^#;ZoNss`q0Z^O7EptEiidXT|ZeG9kJ~nIHRVkSC6*8X%{V1
zf9o%Ohzkh98(3l_NWyE#39I23ycMuk9=~K!tpjK^u{jBuxjU+SdY!=oA;xr!qIO1H
zQN((`MPX=)tEa0{+=eWQ)wNff#>q2isPuZ{`DFEysnRs;IBJ~k%LSPja2Sp7nd$eN
z#kbW>$$L$dWo=}*Sx!n>m&*R2Vg6(MN{VQFI7Z^W&M_X6Ft9{)EI!%|Kgl(Z+UE-f
z_vR*~g)k0H#2FOx#hM0KwoOuE!z|-zUy~ewHhc;znPsKVVR{Wqu`_&I?nJUdyP@QB
zNPIn4g)K3+tz=+>6Sjt<?=1<Hux-&2Ka0L};1(lyQ&>mdIu@7WI?<B3GXtMv>ws$t
zpkp3LiaVCE5%rkr)}->{XC}0y8+gbts@=}cQ_t5%Mo}uq#GWNi#qHcgx@5-Vkzet&
zfIt8zAqxLH22G^DkLIkvHV6JM)w}zBk<Re9h^SawDp0nl74bT8rw?h2lp?NKbkDd`
zo6I&|N@~$SM{nK)&OdNH9ZMKpmm_=A*ZUm+j)CvvGlIO%0P(ffoh6>6FmZe{N>tJR
z_JgK#+=nT1s_%{4{c}&=?7mLdg*n?96=5aY-RkeXyv~%n7sk3Rro@Q)T$y{(kO%2#
zRZ*RsNpz;Z2W|~|(uw{7xyHU{!5p`xivvU-I@}Q?JzhGXF#Nc7Q<oWS75)2|sbaoa
z5p419rTEYQ@W63>{P6-l3J%>_lGYQlYOut~zoTNl$mcqfwrakgm@Hv5(_c;l-p#hw
zYMnv>FYa1m5e}gv7P>)6KQ>U-&DUx2^6oNo3yGKGWmVxN^9!~qOTJgL8>&oP#~YLD
z11_DU0`FzE6<_^C8(6(Y_EkT{Arv*OOb|cAvT%?2km|chf3Gv7^pG%`Q@v?^*vYDY
zQ~z=!#%J5kLUO0EjRm5Kkjmg6x&^+PhZxFPLrCod{*M04meQCDq5^JnI#ESrsjX<C
z`ufMG^McSmiENdOi-ev5_}tX+)Kv$R9%RYgN~AfQG=D1Wa+7q$kp!Q)uIw?9aGvZ#
z&F!Nf@p|arQXmx<jhO><2hHScHH=m^m#aa@W|A?RTcu9>?_qF-`W#GM<VDPfVtuVS
zzpbh{_leOo#@)%80Hn+&KBOmq)F}Y{Jvle3J?#Mycje_p;HH0{N>jvRH9;=$MM7_p
zMEDG4w|!CP>|}pTkehNj$=J%NmhgS4-W)bFMNnn$$-bS*Ik&bQY9z+8!v;l_q9Fzc
zoHL8xo>i+VuxX^gyYjh+ns7l=Qi@T9Yjvv6lJ??8XO6R#ZsUcHoJyNZINWml;HYM|
zfv6}imde3L`mnNf>pgX7WLDC*$ZkRbrspOiJ@RgJMzgr~YXCy$2X08Ahq06OV^*%F
zyf25{o9VEGxGi#+yza$E?$cl2`PzP+H<Z2Q1d9l%MU@1-izY8KxLJv{C<y)_UPVwF
zr2YAGH`ciH$`9Vh%75VKFgtaGIIMj$JzCOF6$|;rk-n1&>Ax^XiF^RbAE%3ia#|nP
zpA_1wpE;2(qQinu-O5AN_6m?<iKwd$Ci%RomcV!oo*Q4|h957V?a6fi7Ch9v$=%JU
z3CkO76_~Bz&2)DUFB8wyz#Aa!EseeEX#kj`bn<lT;?Q9@MH4W-yCo5~E?Z*_VrvKt
zgQGX-A<$^QeD7^dyRyW+U7SC-N2(64h~fQ$&#sP!K}Zcho_~n2CzHR4{Be)?ekT!4
zL!Kjzrioz1NomNr_PEy8g=w7CHn&QKc&mCsbFHrx<FwXRm6?oY7T-fKOl>?QqL4T+
z|9$PEOMvCgm$gnp4zc;FW)!5v3pOdkj%K8wa&xaMb4Q9C)4v_p4v?mG(hX~{5EK)c
zUU0IX_=5vRn3KRCh<Q&PTSM=e(~4yy&&;?^8)l_QzOA30#~MfAlA!jjh9qaRxt7U8
zoG=;+O9w$Bk_-qVFqBe;p==^#V_n)HVss*!U+(Yhcv_2oPq&qy+4Xh3c2E|&^@fy1
zB*IUM2DVJ)4VvT#OTT`JQo0>W#C=wiR?uRz$DmiV86~=s@qc4^LH<e~#py6A0~)px
z@he&sbioGdoxv-bfZZDu!%JiaJ1w7e_v22p$<XEvonWFnnvLwKUzt08CF5(vLUOH{
zDTI1|%*rJb)C;ue=x6+yez7&PaIF-9q$Uveiyz+AWQ)1Q4=&o9UhfmGSWD9W;8os_
zE__X<k$`fY3szJVR`_7p!Z0q*V}j*--_1Z-jmE4C9-)~9gC#ULZ&YUfz+&0DPfC#R
zy20Kh?86Z!5x=^SFRvsw)FtFF@B3d>ge)NeeMxM7KvP#Xq{t!xTv~sKnOmjVPh*5~
zFrthdGLsDEH%ynDogfjYJR=%?j-@fT=nJTd4%jAaCu6Q{Dmt&bdfyzmV;dYF@BCPs
z?6NJHT#2C#k_Rktp2I8hJs@f8LXL>4Sv(G#_mc<pKG{!>nKXXMhnW#gLAc(W$ioAx
zjstp9Oiq0qcKaXt!e+EshyhGPIdsgjrR-hxK@tO*Sl}?zjPi8pR5AZo?xGAffwv;2
z$HLell8k+(4n7H>fn93)^%*s`uJ>i#bU^&VhX&X9u7tIo=gKsz0+4q!h94WxjZ8;O
z^okyn>cA|=3nTh^HnCQ>^1z42H#_LD5V&H(T~leJ&VTEMz#tpkFzsRJAw3p$4eYM7
zI!6WR)q3s!<q<gk*=Z{R{WNcKHT9t{LErR_95Pm(H)yr2aC`Ia1_P7)tJ@us@mKye
z%mMMStjDKU2cHgMUK`quvDi}0xros+cD3Fo{gEiT)6P6DOhV45lA;oyf(&@NsdOWm
z;or$$`heVU+VsLA_f32Mz$s%$pH{J|m<kw|INoIB!~qeP7r(9)$1lJ+Sq}^AzG;=X
zRtwti<`e4y4ib{`_uLL*sB#SHG!95Y1{A-ZTBncMNw__gbrOlfNx@3+7(dN;@Lt2Q
zD$53HXtvdRo|^LSJIy~KcS(lKZapx?T*sSIH8=xWk>}3nN*Jp-0=%j3`5Lq{fQD_>
zJ<X0UvAEOL`yHJ12rdFz?VNTbw)Dd*d+sqG9O2%dd|6YnY<<If@q^-jU=J@)J@9I~
zSLB)*>>lJ?$?v9jr(K+pjn`f~hC1F?@y{w1>c|pliE8T+=#x;wOBK4Is`x}l7fo`*
zOJ#yJrMI2X{JbNDCz}L5OU)^|kP)AI(-@+sdSC)pVXjZJs5t#9WGya*@0c&$g3W~m
z=9y^xRbvu(g>mS5p27Hv5ebD%O*aDfGK!qwKr=6obl+5s4T+*@7vd6=ypkwgDCY5*
z%BRG;o4I9+$*Ix3a%DpdDgRx+J&(h}XBqg~knCvn*1*(%;0lG%bSkgw3O&+)(CBGg
zOM@v8Ge!3ul4)Fy{v<ee2^w7y<LUj<W1#T!n%HNlqA{*uTSDR9(tHVWDmP2RY{R$j
z`<>Uic*2)t@Y9L~fJa(%(W43g>6_})@n?xnC{z5^t+1`Ekyw?UFq)tUDQpW(-cPCm
zs-I8bdPU<;M%QsLHfTS(PR7@P-6s4lcIy$>gg>V@2Z3gkIBZGkTc=&)YtuG17jIhi
z18)8j!FOLcCHAvDnOb=R4hCmxA2kc`Lt?hyfpg^*@prtgaBT%f#DP!VKtXXTu+vOh
zpY6G@QIfBsfK6Er`n}WiHN!YV3ak>cC!uaPDwr&tS#BWKJY@T;iK}91tORuBNxz?t
zFtV>YaFHnWA(gZ+T2T62q+<z+#EXDRag3^OzLZnt(i%+pUj-ip*KvQ!p?YN|WU!?p
zDr*F4X30!mu#l_Vs+A`IcXAqf@y^-#Wywtr+7tHE5x+I?3Z))^9+U>CIry$3(RACi
zlD)iJTaZ+Ui0%8#%}^-41m8iHfkdA=gOAH9C(h4ZO@_9G2n|f97NpXPvY^X58y;kY
zS{ee)ix?aBhqXJVnRYXfA3Q?m&fZXWg&HBbGk`S%G?@|P^uBp_oXJDAx@+sYvplh4
zzWs8VUX!(;)CYHWJ$7rs+I#r(K#oQ{W01iRye&y30&fV7?T7hhzm(>tFml&j#SvVR
zkzA%UGmN6qo1~C4qL|*-(WS`^V@)O(s|-%_SYq=0-qP^tmQ(kg<0fcRI<WQK6ubbh
zom@rD|CaFr+2m-AUi+LNc+3vfanDEtoH(_66ApbYS~3&N5&o1>*B*yZlS*&oFifkb
zO2{*x&Czu)yc16?ceD1#xe29LsMJ1Lfm@}5)sWVQbc<0hKJIBf<OXd5O=-btSWKNX
zPcA=WS@a(d+jdcM$)V{UD*MEya)9o=&dl~4kL;(V*mzw$NBr;MaLj;+He4b#BPHJ#
zfH;KR9qAX=%onHhQ@(8o#Lv6f8rnl#PsVLf!Ny}$`2jgi4<5+|3qNvpc)*<IEBr(#
zJL>cvGKVq}Gfh4%r@(b2%S%q{gK1lSmn*!>Mz)-NjJOzv;N6V8o0-&)4`-Cco0kF=
z42!a|?#aCEkD?^i+V9fKn1H_zOhQ{#_2?M@N=>Ju4op-8!tX5uM*6W@4EE3pM*0G`
zS(|L}od3AMB+mMdGh1=0gYXE_=XzU1`EF<pY&wz?NGxlgw<P<4V-7`T`fmCPE@P$Q
zp)gjW>Ld5M%YnZ>HO54eL&|lm#<z(x7rXc>7SKCGIR2;d5f}u#xEzR?r$=<^_IsYr
z+N5Sus>BR>^g_QXeVMt5C0We$F2WGu9YKP(_N_h~G8Y=ACZP)&js*FSpy9(bVx%DW
zN#>4)y7>`;tH2GTB8_Vv4#$3)1xsv?*V-FBdo{q0bIRfgK`RJ1&LX-m|69p9YBN3B
zOUT9#7PqAo`WWjCFYb|oeAUSQn`v4-O~!m=qOf@q{NC@#Jv!D)?aemjs+5vaxuAY~
zR_7Xo-D+kPwF{1p7tVx47j#QJ`)@P%Y;~LG4#<nrPxeM4J;E_4cQQo1S&!9@+<#u4
zD#LbMV=!z+`^p$h%i*v1as$x>SQS4oM<=6<-{>ajoKysU`Hkz+G=HNR@Dn{34(fbr
zBZ!OPx<8q=zO4O|?q^@b?~vBfL2`NJuusN3i9CW84&$90CHna4Np{Y|s6y{=wDGPN
zG&QC;#`eIIpjcd&2E8S<@s)x{#nX}#wK*3Fw2&zfECN0|yvw{+YC%mneCUe)oXB^K
zwPZ}}T1H)!y*N%8u3g!F__fGu)TXRv+_b?W*0kERc24EEX=2bjgIra-IJp=$j2=_+
z#E3cj)wQ^K_5Po{^Obgv<2w=6BaE?%eG)6(zWZB)1+NS10!wRonzmiOrhQJ4)}axe
z6y=BmCFAomYv9eqAD8(4@R$l&k_s8(pj!C>q&b2bIbAFqZ@79xbgGa_Q&FoK=lH{h
zVOu(H;%~tT$5|1w>xE!AECl4)@AaI3{0+H<r4+KVsLJp{c-t?%Cz2vsSap>*k+s#_
zbf)8_e0u?#KHtdmPad~-H~Hxdvm@glOyRte)T=+Ed~|D7rO)okyJf_0b||o@WH4Qo
zCj2N>PIH4sMT{+`Iio4e=YqS|(4MU8$X9!B9*e>3RErX^$Eb~BvIPFbInmLj-f>ZR
zo{UfXKK{#+u5KzYYH`yD@NvOKJM_7jGA&_{tk3CZM7qC#SP61-&qrAv`Y@8Un+36}
zdIWdXh$<9L^yJ?G=ql+BUrq3eY{`jiSC<fbdbhqa<aS*l)Mu_nOCxiPVke*%!uT|F
z`oF5;I*-(JJ&dr$+7Pk5%9az@5lpsFWj}CR3&e9c-5aq*U^W}iCRce-AHyH^7L+jL
z@<SZu;aUIS<YVu&O(>)Nb*v1bIfS^sXTfa}gOG;hNWy&{qPM-{qG|8oVh?V35K_OP
zw*K=N>j*J9wt3TBe_ylBn>$R*a)!b=-#?w~X3A|*0?E7X_)BL!qNvCH9JbO{y$f+O
zdeph0H!c0HX0z?a8(iBjFJrxI1)ZeQmW(>Tg=K`wri=DKe;zrZ)gbI~)>>DT(eCFP
zzKpiMQ~oZI!<2^dapzXQB+uP$4q@iW6DB8zgEt~5VEGyyomW8s@9}kCOI>c>oay{^
zfSJa%(ix{&cg&5rtdCgNi7#9B2RDDKX&er^ve)Y~^7nbQ`3aYY2a#1Spp!b9l$N%@
zc~VkdXt%bmq)ampF}{;6uDQbbxo+AwN7m>n0m$BkAQ!c?v15N_!)?RTrwv_3Q8;={
z0=Ey}HqOa(zYxE>^m?LGmm7#4ljV-TI$rT*FM^m(&_p(FtSu(Sd@y$2ghsE)3M5UH
zI53NIhg!WmHvd)@ExE*ShSP*kSr=4f>fxk{Wo<?EJ%3t!M^wz?TZP-q%Sg!EoHu7y
zM8uw2C8K?}zAH&2<bbclL&E$^Y;Uw=Znh1(hVW-Z`=1bYx#bKG$8HvBOaE(uAq^9a
z+Jyx&X2enh4+1moQ0gO_RkM*bBkDb?YlGlr1f?FYA@Bp=nrv&`B2y&2aY>NWx51i=
zL>(>~+Fx{@WXP5c18vM-=sx3Q6~7WJ>j%jln)y;)BtE41mFi^AOn+lo;S%tVd;Hy(
z?>P@R^9CZOJ7D2u$(%t^a6v<mT1HExlr?%2D|f3k4na3T@!Lv}!SsF{&<%+dJ$NBz
zRK}dLm@(leV#LC|;ire=)=?MlXy`V<R_&XxZDCi8(9QGhusA{Hf8INK?yK8E`zR1O
zED3~|9Ga3v>f`teFic6d&%_Y3e@XJ+E|KpMsrSyX-4JRuf9!={FjrByLKLMYc#ydU
z;;8@n2oUH4?@=|BiM~!U^9z7GSBt2HGAolZ@09o^D62?#Su%%MAnB<vd-Sj5U-9a_
z+sE!}V6lc#6SZ{@uu|rs?r|$$5ig68(T;1O$u6e#fer9S5&LfXx~ujv&ji~bA`xJL
z`Mk}*x;T=P;UJc=dfcW~A5(1}hbZdUe*G=UAx7Lm`vR<aK+{tTtj8C=A<cS~di({;
zu`Mqy1t%+XlaS*o<Cjy<jFC_qH;a6O4rFSXSW&L(*l5~e(JaYu(yh(T#?kh!X|6aA
z1x^>HriONsqUv;iv_l@XN#`?h2Bq%TM9aQE<_zi^%(&KLD3({?a%~cpR9wItvbOVE
zRZ}B%B9ay4Qt3z$kZ(NW0i43H7#kD&xO#1PbK%uz^Jj>bQ~;=<g@6c)BKHVz#`^`=
zZL9)#L{+M%4{r$^!0BQZ6;fN$8EDPYsAfs@$h04(FOQ@yw{^AjeES%iG)vOFuCv^f
zCT+4&RvzI{NG6SMX|iFcKJR)3$H9g>UMRnrn~*BjV$Edj41fbFhDWbNlZj~~%tvjc
zI&FdFPH)<1?kF7UbBiP3AMN07wlnJttkZut_~TB2=cC>t1=n})#3K$hQdAcj#KD=v
zk|TUTzQj48o*ltEk*~>h{MvWJ+yFhlnhJA09Odu@^DYk$G7R*&K6LsmJC#VTJS_=%
zQc?j^#E!Q0@sf821i;&nVry5kfI1BuYPw%gKUWW>(XrCTq$Ny8NZi7thY<KmKenTS
z*(A*x$x6IgpjH*jX}ejaMzsOgF8v{KRIj4|R{Ij$A=P8z(6YJ~Hs5;wfdoUYfL;LE
z3V!`$zcn5`$$d}Ra)Mr+>1sIm3Juu!0QAD2Z0$8SRCo#O>-%0-N4!1s3lp6=BYx%6
z0U5#xW?tG3UD$%{qM&zY4vx;^cb9C{!;I8F5HsE&CvbQR`pWQ{7cKFLmAm?a3ku9i
z!=u<JC5?{0M$8^PDp%#K{AtXTYEl!^tgJOF7LjWNVWqj4Hljj~dv2Ht`GEeA+rVj?
zwIc)d2(spj-Y_ijiz>eWqc=pL&Dx*chwA$71{k%jCHs#08t?@rV^Y^=v0a^ul{|KZ
z<1IL6nl?W!G{oD0w0J<<80TA0Tc#>kocqT$L#jqb^X*AStd9dn<HZr!v~dUrajr3c
zs*!an()S5uGe440Kr0}<<-5ICybz))HA|iw&U0MwUOH3m8mX905{}sg#^8xd?YyrA
z+D=(O!ne)C4VGE_$e|a?@VFZZs<zk*Nl@*!ke^cdGD{4BIjT4g!hd|Vm>f(!_-<j@
zeYx}YT#45K`jF_tiGJz}k1T&=*%a?BVPj6!M~Ow2%OdYiFuXn(qWgVgQnUV*N@DiV
z8x6S%N#8U@sXAdE87g%Et1HLW0DoI#AD_uR8=(rBq&hQkJ4a;{9V1DXvVUf&;{)n!
z-aFK^)M|(+*d5@Ok}$64l4{hTvt^sxaLA$aomp=~`nQIMcdZ)Jl-C$n#~Zx7l6>t<
z<fMbT^?ood=6SyC<;ms38l$7>NoyS?ed2$0sk)*kxdo$+qUx2z^{E2T02m1y7epYS
zW3_sv2CrF~DRtbmjBshC@OppL>YYNbl&WL?ScJkQ*N}7GjarO{)XDi=59eS(Hflpv
za#a5m9_3IPgT1FW2j`Kw_*#`a=jXDpxJ4+vAlwWl&5(K~`Jj!r?_xtT=y&|Ci)xI(
zvAfpf;ID@M^VZ+Ik$8mlI=L(ah%?T!4Q*Lo$npoyGp#h`pL^NQwb10(5?mZKy4UnU
zO}cUVPKlHjO&@Jnf8a9~tucKk)17B(z^2{P=6;{tx_d(s0&;)fTNwO#)1jR4vpvk~
zVrVX586DkNcvYjv6%>S3rb$!0YM-b1Z|?#+??P7)@MDsiG6xeaNOW_ZpvYt}YJp}6
zgWC~zg7&$T>Pn$!_CY&AZSqWhJlj&e*4i2xfD*5fymJM#c$ClC6>-!3%14(}E2iwh
zd*s0sTHn%Bi3GNT+wLI6;MBI`E25a(+GuP%Bq)?uY>u#Tc|tvJ;s^tzWcF;kxidYN
zA@^Z|_T9<<Q2%9Ce=4Q5^{#Bfn1s9%q^#HM>*-v3tUvn_6k03>tbe%jZ&pFO;H~`2
z-k!l=F^|mdP@d8&xM*3c8Z)5qB_6V_4LI1F8Bm8E`PNQW3!01Wdp(6HSix6%w$8d)
zBU-JQ@tqu&oFUj~+~`@ZF}0H@@_+I>prqMz`v_66h!d4`i~iqPvdc_MGA5gmfn}u*
zR$2BB8gm_sZ83$%sgx#7M6^;d473)P$U<C<H1i(%<4jM+K2np!pv}6CqKroPD);Z}
zDT<8Ey!dLo<=cr((l)}Q3@K{EONhw__L#@C?+Z5lpTPLgafLpXaS@H&A(R?kJIRGl
zthqUVD6^d{>YhJhw&SK{OvvMa=cG2^^dRvB7JvndV(jhNOVo9A(pihrgm~w=|3%eX
zMzz(2?YgvRp#+DP0L3ZV;!cs`#R={nTmuwJkpe}6ySoGr7J?M_;O_2Di<GwS$=T!V
z@9aHB*5CZgTr>A`Ki5_11mXBz`;{VJKnl)!?n@WL$guHKpV2WkfTT)*q5cCL;FF_p
zw;x16g;UC1TvOrRoW<learo2dA(>z6Lus^Z$Xy?&)!spV=D!%N>~jvV6y{M)mIMkx
z2Y#=F_SH>A?I`u2x%BLLC;phl9!^VVD5lWgX0%4*vJo5+Mi;bOQdAxU2lFIp;^GkF
zjZv#FP{R`cKcaEz;vasW-<XQlei>?(C2rdLKX;=kd|vYDs0>~l5KF1_(_cU2h35?G
zX)CdoQ_Zy^^?8+48RB+3hHO7<7HNl?q_Xlig=xHR7%Nvt{f9who?DFceeo2^Bg8J2
z21yd}=!*VraZQ+8tK$?tBg&O6N;_tUsd`qfDw;%+*=Dj%BT6n}*kvmiIXGjsGo{p=
z7XI#8@&MDtLOb%sVUJ3~c7nklBTin{7Ds!5JjMarIWdJH;>6`_t7q^@wU5WOD`jDW
z$4Qq1Y}4=PYN5NK$N{g~M0VOVJvyUOQ`SI*0#8EB{lB`U=|9GoIq|%l_QwOQ-#=E=
zyecG$&4td<%=B52X$f<w-5?QiD}aaTPud=$DApmlLVeulk+Me48~AW3C#@{2H@m_p
zsYZq`rM8dZWq1;L#n`Y(|KbFd^t5)_+G?ND`i&9Yrat;LQ~WZq4V7sa%8|thTZonm
zfe`R{V5~MV)ppi^poC6JO?9`6Lamhg)!Nr9m#{HOntPBLbET|cFsZPtu%051!(dhw
zO`j8S1+<MId$=UZajpMaHagp2w^3y-b|s2R>yyw6z#W}aZ3*J~FJ(iF3Yky;Nby%(
zfeLCv#a^OBeKO_FHnqV4y@TeR35>YPMH!ZAYqV6pywt1ovT5Iq7m5Cww^w)l;vSHW
zhtJsHa;%d>Q*qmOzC3fs(@wp__c-G-i)0Cx^I*Iz>4s@VmL_d5w<IY#Qk2ybEcQ(2
z8I^CsA2Bnz9nrnSpZgiZ-<}l<rzv)sGdPXmQSHIS$|XJ)b1YDc1YvU<Br<2G>X;c_
z9b}WhG9_nVCZ`@%<j{)fJDMDPGlNx{ZvqD7O?(+P0H6oWEQJnlOVT|Sc;2p+VvN($
zcH$4NV1DMTYUWC<GE=F)SC>g@V$1lgLCvTY?}MdTUuMe=1=kfey(jXNqD{|GX1laR
zY}s#J{<d}N(nnWx;9#$M*R#@FEAn1>RJRWkg6BR>==;2kCpEJraRkQB)AxGKkwOr&
zi|BnJaNG^x`ovIrlE0!mjHc)P)QMdWF<6tFm>ZSEo}Zq^8;Tb$!Z$*9&ZAf)8ahIG
zWERF|DEDU;RP^LLR+=1z^;qn>U0>|f>1m60HbA>+PzVG%1y5Nn|Nckl2K3s8ds2<l
zzo}Y@HnmYWEKABF{A5#UyySr1*tn$rB%}UF(el$QQ{-pG?BpkGD?NVp^5mYEaW`Q0
z@0BOu39x0Lv+p70Qw_&Bq=Ik!Y-#t=_^CQsyxb#T<51+n#1*7s+bvpJZq*o*PvW)X
zL1c+w%3yz3&oH>4boYUk$Nsb0s#ctR|49weLP4l`otP#w()V?9-r?P|Gc$$@zv?CL
zi0L`sVs!H~zTWJw_y4*<{9pTPxcNg&?tujlHWrDIRnB;i#s?j{IR?f|zF>seELFK6
zIT06ClGKx;q##|<wqK+D`?#17HEt0R9t;yg9taH`qFzariBhU^OHLzb%hVq(9;vcT
z*qW_wHrDzZ2-~fYs;+=ww>yV!vYGa5V~ZLu$D+gF@6wa)Nx8D~OKcZqo(hR941FLD
zEf0ovlM2p$cv#U{e0}{dZR+>NNtNe~FXk<qJzFO1^}-paOctGuhl=2k<?Ba|63H17
z!Dbqn0<t<5D>(oR5XKxakoDZ}+mp$npOTckiJ)%i#1BD32lqM7Jt~(+j$|^`v^zH%
z1UFXIYG&nk)GqiaIFKvFk<0&ENy=or)&^P&<r*p{KO&PgThzkji}NSl5kvBz2>{W>
zOg+EV(%3uD_r&5|&JL2$H*ucv$9g%N)`ipYtYV%_Wy#p9QXDIlR@E~69CF{TC}_NK
zOoLXTfj-?FdzB>fLr1On*B3(#!$5+(HAcq<0_)l)Gf!y*p2!Q;n9w2_AS^8_zL5!u
z{SVgvof!z7zn<*b6s$m*Aq!W87RQN_qS6zLVrxt>Qhqq>_`)yj>DUfnuSaqA-D3}t
z@~MQDkPZrzDCDET0?uP4J+b^09I;KM#W?B|X(K!FY!#N*`)n_Vq~Q~9aj@~zt5KZ6
zQ#isw2mX=Tb&4w`_c99QMTp?6DE66pu|%33Lkv_|^>OS>ZGuZQr1DZhS98qw8l1G!
zu8h`Y@SEG2T~fp2sj#i*bdY(UYUgO<1u5imQ%Jp^F(0oTZbo9%WOUizX$c@#m(2m>
zyVm^hcyv3^qf%E9jMuWJgYN|w$-?3$#JKE-h4pO8HX21lK<Si4Pxwt^SECNvB_7*j
zB{$fzObBKB%Br1WAo_wm8-b~mrkeA64uv*C>VU_}h}%zwDjM{pLj0X|d&M^8POJK#
zE`UVznbtLhI#g=)IR&9L&S5*Vup;j7nw3F%Ho$zi)p5r)!kAwJ7E=ts=_eVn4@E|#
z=0+rwg#IH{qLT-QXPWgsWVm|aIy5o*C9z5bN>j*#ZXmjRdCaztM-7%fJ5*auyp`No
z9{=pk(FZ_k%AkscyOT4G@7wVGuV4mW0Dg_p>9?tpuT%o;(Zm}5XxsvfJ=!=C#iadj
zlEiCp<xSC&3pw{D?=2@kMHtgJC=mFD2fv7{OU3cK<2FQpaLY)Mx5C_@u*&w!OA4(A
zTMM7M06M0rqb>zj=ueh9cYwp}tnJyCZ~b8fUodmHU1!AeWj~l_EecMy{l0UMrCj^J
za)Ya-()T6(Wl>!O2d+7QmY=KB0jURnD}tlwD=?Nqd;JI;r4IK>4HOcQ5riQuPMY_X
zC(I|*Qcir)y$73kfA#Vx4{`+0e)x4xw8D^Z%G!SdrkFqEb!~gjxz}hZetmiufJY@3
z4^Q#1rKCn2`!MKzzm+w2F?ssUqwcBmBa`xz>e_b!e`b!$3%IfSyPJ8fzG8A39*h&I
z)4~hycL}Y?F_XBe8ixH6V5lp6Mtjf<$F#Tb=jBTeW&<{y(^{%fxoKT3g=u@C72=YE
zG_kRiAN@>4RtmVS70dEEtHaY4x2G^YWjkC$TGxn?hpR_chX8XrorX3&^x2$FAf+jh
z1>?is2<T6oE8qGM!QJ<<r234-`=g&)9m*JM+-2pQ$M@rGs4{N<7oBIdNxbxn8GC7K
z4s|8TT$$<<Pu0!D?&CA0+CY+N=Me()is>=Nnh4PtrB-qstsk6q-BqPR;X_4w{C+E+
z**hn^v7uBROU!sGr#}jG;=s=cX)mHO>UVrn7mntBY7P-MzQQ%*fENi#H1b-yJW$Nw
ztr_x#Yt{>Kd?v2u0&le~J9uXM7gVRcH(6rY%V}3QqKGfe$X*kl*FLgwJ^R3-U9{L1
zu~n5Rt{yk_mx7==>IOLu_R!;VccmD&b5S1^m{X58eDif5$i|25t?$Bxs2LW6tpg)g
z!XW^`M-6#*cgO%&2@w{Y@mFsFog#?dwJ}&5H;XHVu^lPf8Iq8mY!?=g_u_OJW1XdE
z_oTeGvO`yQHjVaWNTfNBvci*SREOPr9HIlizf|p=t)^;pV(EA_<@FSo5kn3m|6+`U
zKD|!*T*>CfhV%FQD{LW&QhA5^7Ffz$8X)NA=e>?q3{7mAZW8d;%6v2~+b3yntLse<
zh*?tsX?+OxFP%m6BZ=mD8jMpYBRSUi93gtpR5xKE!@*{)9CtUA^!RN*5wp^G*_K1m
zGY<?`-GTXp`r#);60TsOmgZ7@RH+aOh=+B%^rg43hNPb0F{LI5e6&eGYoWw58^9US
zctk_9<KHZi+;<$q#ytVBEQ|R#l(Gc<TxrQ!Ka#q>TU4f)$;=}GTF@o2H&mIcJu9Ii
z7UgP!Rh#7wrAF_8LPZSt$WH14?F`nY`?*^3j=^h=Fz(9K<na+^%SQR&&c&C|1YbWM
z(YB&fWEm3}*OWw$7#f{O5V0_?Tgk%7NGi~Dwr%UhW*zCPNmyG|@nv_)k>oY&_jr4A
zP2-KY>cNY!w|||B&;B|c?Z*}IZ-zY9jMENn9<*9=Ro?j$7q#wS*tr=S{CTPxn^I&E
zw1n;|hCTyQSX!UIA063_b3iRK$z}P6@{liP-O2uFF8)F``I#&;|NKM4Q~0sI!M2^|
zHwNPW>8Ww$JM2z=OJ55DuI%3Z)q`tLgl)LPGQvl=n4k4S73b)01!_A8{nnbo3qP%;
zpy=!mTpO;2(r1Q0Fd!Er6r@-qa<iSdkcz7CwM)wY4h2RgVG@(8Hhp1jm64z%lHq02
zX7I^gRY2CCw%~T@y_zIp(Ks-8&d{R8w@=*Ga=u)>YPzKmJ_9)uqg?Zc#aUiOYIR6}
zS$b$G`3a6rX$hcx%2+{F)3f}IWzY^6*w|p@IWvfx#<TsWc2l+q9%A8%XZYemtNwQ>
z*i!JNSAZcCA${z(ph8g!k}JrK<dD_X<`fp*^w{#e7*($HMV_StnNPam>o~s+`R}48
z8PO%JiYKDi_<*N1go`2fr5u}IV;zut*wL!;n=)CWz+W*gmEr!M1E{%H%~+hkM&)N>
zB6f7vPro@yGX@G9m*1l+w1EqrKPeJlROU^H#|uU-eJHBf^OE9*4l(9L7uGQjPV8xa
z`4(w+-c?nUyQYK>ikAcSCq{ZHTQww;*}9$yNy&Q=C60Hv`SdL1fsbD?L&qT#lv-sU
z`OJu=S3i;}ch0frfcL%LG~XcD%+(hi*QG`|6Xp}w)3qLx3qqgaY}+aWGkoZ(>L(uJ
zvf}8gUOU#lmFH)rovkAoFiyF&wk<Pxep-Q$9}-m5#GZ&&a}Z17DkCrw0HsK-$6YtQ
zk+=R|?rBl%iP@rUe;M0!f~@s5+)U+(#bKUB<e$1iWwGCzJ}+GuY<rB3&KB>pe-X$h
z2`L;{BIHQD<XZ8|6%<ygTw`EX3GMKvCfeQu>DuCu#dT#b`U8FGdMy*qXd{LRC!nV@
znIb{;jA;Rl_P-}QDW)6H7<<Bv8%A<wn$IA*S`$(i{M^<1C_RX4`j1G|$*xVYukP@8
z+z~`eU(J-cw#^AQVf|%l-H|_erO8KO;j2+Yei~9SaV2LFFFkyR!L5A0(inC|=b3_M
z;?J{!Ox72IapkABbO)R2Z0-qcIT)#AHn}_R*yn?^(%Gr-txlN{h!cHoq~mAVjh~<6
zlr2iN-N135P*Y((^}VCtjh>$4J#rlz517iZ>WeWo%)>YqXA`S@Xp&}xJMd?l=Rv$p
zvL=cFs&D7)3za?OO{VQ0t6^mjkb28dhooNPpuy5VN{oNUMn?e(gIhc@4L9u1gAI#E
zxULg_`-hh<i(Jj3DNzh`I$u;`NDvHmdUGPfM-foqFC*UUmbEmH`9GM3K)AWWSFE2L
z$Jo2>M-|2YfRVaOE<^HVD)ORbtTJD4qMmz?3%@voU$=FV5(?vIE%k5`vT`eP;*Bvw
zV>hj6r2o1dbtQH2bITPLCXP!!n9Y2+pftCMQy3#-whuoC(8)WcOZ_eR#sCifKM)qU
zaiQ7k^cC@{cM}e+a&FVIz<bdnvQ*cOtmphnhs3^AALh9hR@^^iS}tB!;=OiO1eqgd
zgp^tCA-KS{2~00^&%IrhFg5A;)9s|Z)!THOvgB^l*AmcP^)$BbA-NShYt*?*+L`3h
z%7q12!KwzEtZc>ZVP4KboLs_{STOQTZo|@>|0BTCsWq~w{^PNX1DL)v7Uu=cqF?Cf
zK!$JBKN$zKdpYkTmx^N;g|dYZV0Iq-B6k{7q=w23Gp}c}<p;7KXN%&vu!3}u*6o9!
zbYZ!3oSy}A_R<+;!)x-h+=-4)%pQB`0dFF#v^smcX?j<V``@WLIi&W#9k6A0z-)4@
zmh@*2i3B!fZ*1F7jMpKSDz|4}yWd6nWv;p3=&6jKF~wt%PbWA5UsDl*vAzbWroMm0
zJa&~ET}HKE_x;A5z|QaEHD&GtoxD~$6-BAWJBRVwYa-Z$wJO~m!T>rC^{@_$*tRXH
zdYkk3GSMKpT^DR4)_*0J-TcUn)1lP8eNxEu>V}6$VJImBR^w4IEk9N7_)1EJD5v)i
zyj2}Q1FB9<@-rcl*BYdW!$uP4S@*5b2(hyXf7dBbX1d9Zp0mpIcJY;kdC{y7=F9>)
z*56VSg5;%_l|E#d%;Oz!C#JjcBGeU^M%Ts}`cPPI-lWxMnPVr&SJOS%V!5HUMmld1
zl)eHx#0y$Q8A0Y*r}UNK%Nf{@<~}9cUvznjwT3tDg|A;HJgysN5T@|NRF*NDXwrU}
z_my#XEm=0@bv!9eB}ukA^{<k_G69AgHq4-Pix`HppKQMjeRHNr)j5#NRuA*82Z%q{
z><@cH7cHB<;n{q6rsE>fx<mxhEWi>8MIJ;74M@CIhS(zj5PiNpkvo@3e%MRBS*3dy
z%ki?EkVI!5|J0JZHB()q*=~;Ti4p&N%M@1~uU9)R6NeU*0qqma*DCboG#V+(P!=yV
z^%!Rjf4aOTs#_rB^=~d%;>V-icLB|q(iF7Cbv@v@HxIrf({>UbD#cBnW_pogcMZF?
z;3<xYDsHMkeK1Dt?CgGGEt^(t^t`uAqZ>-zgi9eh`p4Gia0?-htiA`PzoUY9g}y!v
zz<3Qo@-ZV?Vk{HNQVedd0*}RQ_Llos(@rt2DgAT{AD5McaaP_|CKd>7qA_sm4>fM|
zdF7QhQ-@SyOUDED3t_A2?o1!a-`{sExTv9Yb8ZbC&MM<rGdJ1Mj^s#YeXzw@=EgOx
z%ZQmbHbMLq+E!USY^Y-<%Hrfp#cecmfj?36+SYoA7{)u|bwu}U?sCz%uKr0->(Xp|
zd*=F#diG#C<!}0M<-oVtEgIS1tqqTg@HuCvkdYjq`z1xK$&)Jso{`1>ToD-XWcFBs
zoE2c=o6Hlfm2CG~mEnWD0ydHLo9ZeF_c>Npcl%yzXWj1f|6%MqH1_I$STrA)n~$vs
zPj@G!B~Z_2@p1a*y>jjYHKa3O@H@eeIblu0X&#ucSOj?s1K4$d(qLDudTzBD-2w46
zJ8QX-&Co&1PqL>{Yx8rTWeR3(GmW^lKL@vK=vg<u@tg>hJqH6)<G~2-bsQggA-Dec
zfqt(~z5f<i+vA2%-tHi!e?z>`g0_`}@DHl*>{+5N+I>o%-;nC6vc`E}CQOSf>Tnib
zC~X}aNploWx3%7C60jq}<$V2oGxS=C6SwY-h~9s1n}P@uC5E-VZI5IFNc|`}(P>HO
z5J4mnE`(8!WYDbRL*MhNuOt;V4qoiW^*igu8ss#7q+2U`I)-=E#<zrAOE@TebC+1a
z7T;85kCSntseJ<@1hXc|W$g;5orFoGZ)`+Q6*Bub11rP{op$`jUHcG5HSX>JFhVS}
z-YmQCM3sio|AIE2F`}s~s!_q<Qf|a%1X!5Ryh74o4AGs_iCT8a5#rc!5)-R59D09J
z=b~z}Tq2$Xx)u{Q+!=uIgQ-6k_%yq+p?ij(p5q~eUsyd`GbO~1M7Yd`BEN%(2Iy1-
zW{~V**(aivAd`I$Fcqcl(60R8t_=X4l2EMmFsKSC+IU>#BFRr2t$fj4j_w`A^Z+1M
z+%%dkB)6kCEazRJrkAREp}gIq^0=W7mD0k6bCIijt!#DwyEYwtOc+rw_Z&<$20FrG
zyku?_q*|0F*E&x`qLLjIA+g9Xv4rhqNkVES!*rCCCdVAUCc+WbqWH|+<*59U^q*Ui
zY1x39=_j-0eI5*wx{tfe7zXjWIfUy&(`L1e5g}L(2<@!|SNx2uz8|fEKD<_DMOwtO
z`ko+F!!JxzXka&PG}5YEq!T?DWbrVOQ@_*X+SB6IY0=s$Wpj5b0$uXVS`;+QCn=0q
z`$C>*QxoTh=tnP3k!ML?!%a0l9y=edSN~4YA)1vZpNbZ05)i;3f9Y|BxG{7<xUAds
zezyQ4IFv-vD+2<mrNEKI3rP?H$%}XX9y{=vsVVH0k~F6=B6Z~mgop`a9klS;Rsw%=
z;MJEwO@*SNlO}p8`Zkc-r6!WM5Q5ffYH98D?7FmH(3V&Ji=xhWQi8TphaX83qMIGq
z!G=B_5HBF$v>C7Akb~vSl4rO6R%KQsBLW$kTYgprbA0B&<y1X|zJp~dliNhpKQ90!
zDc56<E+QggyTkoodpD<2;3^bV<eu61=WJmZJmh+-m3S44<^i%;_kBCs&T)~{(zgc<
zcJVDF18y`>mkv~_U4CA|tomTg{kG)~O)mY`JJJB1`I+QxFB^y3slTDOOYP!`s>AzI
zKOWQr-e_75Ez|8dtW74M2LmU~W0D#~MGSbxp8uyA-rvM5fBkwv1=rIu16+E?boK?L
zRxzS`loL?9T4+Q!BhHm#L`bvyAI5;CZr(qSo-wM`lAjBCfQ_8NbyXa<q*j6tR}*e*
zK~b?HXzKm8g_I+L@!m1(`<-i?TUtdGYqTh}T*hi*XS31|BKHO1u&FXfHi2K*Ny12J
z`f#2($%6VLKN!VJ_vsb7x2!AfdL2$aa^JC%ikJ^^TK0LAJ=%8aoQ%cgVxSRedM&KN
zcJaFGxH_3WPHK;^0<TI(_%MN=2t_N<bt}EU(wLsqxRCQx(Sf-Za__S!`Eo8XV6Ij5
zR$oXc6PURyBlLrr=97+!(OK(_PS6|vKvB~@=L&D_epiEo#Qtvs3ypMit0h(L2*(k>
z3spDbrN?lQ5(JSOh1Ve=MnqB=wTOM0ueCVj3gIkk*&z8uD4H5LD>*K<3JuNCe!&Ew
zgJGS3JqK3I_Gq<hFhWI)#%xglOYl+*S3>V1WnzVpmeDI0tvn{+<jzpxiD<cgj#p_>
zwR2C2xiN`T9OslGlU)@2{dz4Ge!r|9u7fmv$zBPQ!DOKZ!h~a<*hbwC>-eC~*~PB+
zFjEeYrj3mLb`5Euyk7IKZZQ`zeu19>SEm#5U4I)Il;t|zW)jeMk|3LfSTg0o^rXtK
z$fqBj-PoOeN2`1Fz$~=q^WsjUct%WbWdT{Xm8UAi1u9oIFrG(#JM2&}qM>z%)N3!G
zf20Nr#@d3)0T*f?eNTNRZ%KnlB~q3QjigtTwiAmzDc!o7E@<Kd;*-%Ln&hLdhW+zr
zIlfA160S2D=gX|2=zWDL-F4Sb;h@+{Vw{sxOoXYm(PAhDUPfCnr!)<fCgNTY+8&L}
zIL)D+IRs)PWmz+{p!TBZY=wF1x5z*GE}#F>*Y2lsttJ*ZJ9q=ygnSjMs@`c{pAXIb
zvr@8@{~DDd0u7)4Wd2encFxfkqymnN783dCpsUJNE95hzmd<Er?NzU@C4_F^&{;ar
zpnE8?!^K|1l+TatC&`1@;u&CiMNR5Gz;_m|$~&RMc{X<TuFA;VRDmIcBFJ-02@!$}
z`N}MDKj%`D;Hj~l<ad<Lg&S)3<<(Rnjr{Li>Y{XS=H?04!lHfc5jnLU_`)b3Wk}()
zm1GOE2R^4tn&$m+8<5S5k9WgM=0uO2t8;zWq2S@X3bI!;xLd`(+A;o9*zh4Y@Lgeg
zgNJuvNu#=u;Rz9yb)-CX><{~xY=LoMYD`<i6`*yFE81&GuXz(IcXrw_;T!WGg=9^e
zIrq`8w)v*UG_i!?{hOZh)y0O``(GmcM1GgxH8e=0L@tuYOLxMA_{kx&O{7F>LED0O
zO)@H64Lja5xzHtzjA@))Z_{S->fN;6aYuMPGEu`^SyL^WrrN7!m;}9$avl2^zHj$D
zOXd4|;|r<iTlM0zBbDt`v!`%vklBHQ!OiD{7iv6pBC^E6|N9e$dNRxqN`Tfr<tL2=
zS{XT?uf^2KpVLUz5+9muur=Sc{P_Sne4C$@{f;u5%iJ~Rx68IpLz5coem}voIWsiN
zuiGW2i7msR0d-MpUAKl6>5Wx>;z%fL%Wp&@cPCM;rN47+7nKBEaSn_wd-mCmE-FHA
zcISN;hNsFwHt%X)aaQfKG#t!AOb|!Gws$Nlf$pmQH`|(mwY4|Lw@UNW{c@{Zhqj}n
zsxOl7i9AOCt^nJ9nnbrXb6?POtPaSOjTkH%<bLMq@<X?oUSJv0_t|r%?NU&)3Cwjp
z4>Vo(qkFRna&Aak9Ne~&0UM?kDV5%TS1XA(f8S!P1z=HHK@j<2u-H?kYHqyNbv!b-
z2X=NYK7K>HuqG^jK@0lJ;`D8!)!e#idpC)kp+rt$SrGa)4wAr72{fM{BS3ET?t{%R
zwV~ZE_O$No`1-)V{6{sNdA`zgY7y5B6%Nn-nIU62n+}pLVH4s5+F3<SS*=<wVFE!*
z_=U=-CjrrWC0#*u{Zb`rku?4Q$sq#$(4hk)=*)^=w%=}+jEPm39C8$+XsNHVxOeR6
z_NDP6nq$;MT~LU2`-7+c&eZF^Y7%Qa%gDg3SDJN?ZYY~THZzZ?dP53@hH!=DymeD-
zVwJ|r$0@jRPQypBN}%InP|?zZ>_$p7te7&>r?*=1mGDakiL;`HkDf}d3!;mA6g5S;
zo7j=s&5PuEfx42J?ZaMe?)rO@6q6e#0EVJ{dEKj5JSvslM(4|<9qrmxSYbucNy)Fw
zK6~ld@NiEYBy6aR1#>+IG#3{2_`DM|aX(U9A7;snYO7<J7DVlP5}_EI`cguWF#O*y
zoN4{m|Da{vQ_dbDxB>!U{f^B{RHZzL)ppiLq;3hrr}@%N<Gk$<fr_UlwyigU9{Ejn
zJmq$AX(YaAP#@Mw#dpE;aiEJgu;@u|L3BgKl{UxK2X&4zgqM{rSh(?hH*Ze(T5*|m
z>Gtl>Gjyk-6Rye`=4JM$H&q^3V!u7Cc#~YH*Yn11ET3fEj53)nNTG|$HnFrEwk0G?
z5TvxsNr0{z=3(3ETDrQdtDpXd!JtK3>T~P!iEG%AR*jvsp)Z7TUXu0`--Fq^;Ug`R
zuitB%QPc?7#$UCRcQ72D5oW6GdI?Y^Q-!{qly%}ip1`?z6F7%)TH$WZ0uoi{QVuvE
z2MZ0PC5hq`F8;`!8S*KY?*79^f1dN=F}wPBby?*=B*d1ALh8K_HH8c%g5#D+kpfq;
zcBVfMpOYH}z%CVMv9^c`MKAeq<8s%WG#_0dEF??vqga1Kaf^!S3h$$}G<*CRseie>
zN&62&;FZqcG2f&UB=l}CG4J`gbYs`4pIjC+@tTnG*0A4E29Gl|0%q3=FHh`UA)a;1
z;y7Y0x44f@?7DX%2=Vv{{9KkDH9tM`sxX=J#jI-Dqo-l%M8K`+zy#}FvZt1@t{3Fz
zxyLmj{&mK9oZzoC-+q~&W=Rodqb2nZ=H+$R`={!ke;4=6{I~$+&1@1?JYj<_rG{r>
zl8#Ispub5Kr_j;rBpNVrQZ>Cp9^Ti+WJ7q1_2wVLmuEh4R7<kN-~Xp~0fW8qE6Jk8
zb?9Bqqax^;ksMDvqmf^n(vPT$S#OAJ<<VsEl0JewRsURkJ4}#Wc=Y+(ZZ@aGDpnYO
z#uc?<|0;#Lv4kg!Q*&m9+mJ02DCO;V*tG!g*S{!)YTqZffE?q-99N~2GWjNxT^|l4
zt^H;wR1P*gqN;u<e%mfBQHQLV=*l7c$$#Kxvs(qZ(Y1bw-(sJRVs>HkH1({=Cd^AR
z+Y3&tV3I#EyLcfs+^*C}MCS8TCLLR~$@z@S_n;-*q17h3E315c9}wWxXa)GeQZYc*
zlpaIaD+7h~af*L-C!lQ?A?c?$=ExeUH0IKycf{LkEQwVmaib$J7!&GJI!H|ZNFWzc
z138ySXFoYC6D>$+d4l%b;(y72*de~kYgiq$^K6~zQfu_nMt$G%mPu|(;tHs}0o{Sf
zFNucl68o{0VjF_%R}^x(e-U`*LFT$gjQbr$>6B`<^;!ySeX`kjf>f{^W!t6(Z#{dy
zTn@-d?}$`1P_CEV!&^eoo~K(Xki;?!aq^Kr=H=jmSar*S>Y~om059g?x)EY!DYtX=
zsMcosNAF#}E}CXD9qz4-<nwE~Acqy4*?YK!|J^<u(EZ-}o=tv1=|F6Ej)NBUZ0~K2
zkOW#TT!~jceEO%?r_L!mgO)_wM2l~5ePj9n<O=)twL(%*ORu05>doXlG|XXxR@P7I
zznvaRpjH-o_V)fzQiOSvb5A%RN?%6hetCkW=65RAjhG@%lSw&43CVr#hVK+7J)y-g
zc4!+3kQv5Ax?b&XuQk9ckoH>P4+yUzoAnL9k4v7IgZ8BLu26t#VDFj<y@)}uB8Vci
zI@;d?;!xs6B-><HS}vBh|6w%Umdiz0*f*=}b=jaj!Z|VObE|9?gd2D<-1L=Zjnerh
z+V6z}#@X{RaGUVDd9(c~uykO8r9a6pWnK8HQ}3mqr($tCYEMUzIuuX!b#=)Z1i!z=
zzbp=KY~S7Csah;YYev~`2~#0V=vdUzRQu0mvgqxyGz?|t#OgcbMqkCR<QotVtMt+3
zTkKpF-4y8OOA{Ly9QvZooueTA_1kfF;-`YZ&fQ&~j_Fn9|1fwr1wj(&uK~NZmTt^6
z{^#5)zUM72`f^4>4s<f|-ayuj-6jqWH!7;VDkKjp!Z2IYS^s&xb7NJMJTJl~iw-xd
zm~4iGZU4vpPd#G12Gtz^8(|Kul54o2`#x4E7j^E%as%d1gIlHJQt!C6)WBw{zGHgu
zlx**%L?K5JBC8;#xe_bxRPaNQZcVHd-DrkL-0d$Z6LLa|)njy>KS@tv#%zllHd5K2
z&$3Ffv=OMnL245XQ?ctH?WV#0MJR5*C#wSIsyoLS`YH&G)>D>?otY$V;~G8qXZa-!
zs>f>5yC7e<^B=|$jI+Y+k9ZqY+hUEq4<z_0H_~p#)Lm(-(o(wb9zZauD~PH}5m`$o
z3-X=+%xT8E*Kqx+eLUrBQx$2;m*52LfREHPo^$;N#Qt$tPj9k*7d_OHfG+&Pxi#?Y
zoZ>p()lGk?bW7(sOh8A!=;!}q5_f!UB5BL0o@kA#N$d*UEHvx!j|XQM8)J36q0>nG
zaZ+xUb-1jR(nMA-tWKj24ed2vO;(u<+0w4h(=#N57@Cr7DG~6(egf*E?a9bYTsj9*
zu<8P8>W>mj*5WM1dZ%!T_9?lvoClJc8r^+CoqI<D_}te-f;gvUbluwxvM3^VN`TP5
zw@EH)p12|&p3&rj0MVxI7xoTlAEX_DVrR)g5znoI>f03orl3L8a(5h-hhgP+!X-t<
zmR{|_Mdb|Idj-9g-cd(@ru_KWUU?*H352Ag+e5Y%YEw7sFbgLM3vc^<08t9flg3CL
z#kt_PC<-n+%PGloYcYk%M`o(>KLr0$7cp^657ZOQzA*$l=6E3G?BYSrx+SNqVM)#c
z0tN(F6nGf%>?}jDlK#HlkuexEC3=BXpZwLk##D{)v$>c!OMx;Wt+LN8Y&f*i+~T1W
zljTm$Zr-q5vP{Hm7DL#}cT{Jq*25g@iZ33NZaChLCG1O){ZwP@buF;G>g<~Y=~OV&
zQ3?E|3?+9+c|Sl`E1J7s@aYcvr$_TTb<YQ+%*jL*5UiyhDI6AwGI(5BFn>SpXKJZx
zatJ1F)j?`2*`;o!A@W>5x@H!)byWX&3JrmkV?JE}hp|B^_m*hzKMd(Q7XjXw{U16o
zPMK!S+>cPEB3daooV5in=x=}$7F0%4G~nV}ed;ds&pbuyd9*~D==xZ&jH&K=6VlJP
zKo>escQc{>$P*nwHna!hNs}SB9SVA8Pimqpp7K<gtGRV3H4c1+>=JV*zG^bhoHsz(
zE2?pIQ4)*hl9zK8T1+zKGAu)d=sL*+=g&&PPR_^bed*fu%!xN0ofkYFYpE3jU~T=5
zm=Em2J5xFvKWTTv^IWDa&<gk?Z;c`D_S)5~8QLVJoT2A5*v(y)pC!}^d-*fR#hTYC
z?cN!t=AFO36!9J25@oHod%;@99EkOXtAv$$Bic@C0@|I>^y=y^68pf`x*&JF4ZB=6
zukW<Pxy?p2!&gFAZ<<QW3y*5eO9w$u(qL*0M-ExR=X8m%4Jn1xq=<c7Ba=+Gpab94
zOgw^<3p$&1kX?Ba4JH?t@LB~AIv7XuYYZ;>n6N^8m3PZHHqOH@)i?OlXCr4u{hz}j
z`>Alk9KQV7Us^IGuMk}$L%PG;7M^i39Kt$aEp4A+No_1ssYJ-PZ?Be0p3Ps4`Vd-T
z_#ks^#OMJX6h5SP^L%s|OP?93Y{!YRDtrNPtdpEs;&+%Mb`u+;WeQgS_EFrt<-;f{
zU8^)(o&26|lDog;e?gvlLT|g>{O?wiY8{>oOlI4t{Y#)DKS-PA73ke##d)W{l;ft(
zZl#d^=>P4v7C0tjPF)+xx#@O~{VU(rF<h}Rg-LLehTA%l9y@Z{EnRB$?f+FS8M;d%
zVI{YHC=4(WIB-^6JZd4$C^q`TQyTYBOz(g7ds(G%bwqn$Wd^N-VfHrsrJI!1i|OJ{
z_<&s*-gJlE@=!~pamIOS{hE6FDw|7DMK-sMZb}W+swaKg{*E%0@+<jU-t}Bn4O{~9
z5-^f=bZWb}t@I{Ms^2jqd=cw&tz_GV3xa_`wngL?NXPMPx>egp+eHpDq=BPoVi?m!
z|0P53qTY+51cxmmQxZ6w#U3e9%Pm1(D3sV2f`+p#_pHr4!X?BOThU8rRpvHg!nOb)
znVb1pWmBX8<(Uuu3F}jLMc59LxI}MCxB*~6FJj3@YmV+CdzgE%*3!f`PUG4rNVW)h
zpRnOVLoc}y{vyE%3=;gvV&Iupj+najm`w8Qz9OK@T_Mhm2+Upd3mPe-=Aub;`z~Vi
zyULde?~_0x7Lax>8{VbVH)Q4*jK@s7VC173y2JCFv9){AWnGfwRe*TyoI8V3hr7z$
zL?FgvQHFOzWB*+|NT-SsXu2UoUov>$j?W%NV|V%7fQWmZF^zMr332Ozv>Iho)71qi
zWxG#_VN~$2EOHD9UJApvV>ngOQJ@T|G!;j>xNuTT$@ph?t;uPugtm;gT?)LV{V~`S
z_))7^{&BV904LfDuQhai&6mAg;Utq_lgovs(QNeSXp1`C{uk&qdhg~LTahcZ?|VCL
zmJMUJmBD($8VqlOT6b&J9BGHS<R0voMBwStccxMB9EeAP-40RTK~mkIY8?f8BZSXG
zN|kXhI~leX2dVSUTr)W|9nw}dK^#zUJb-QU^;%GWhNPQg(NqR954!1sKl6!GeVD5I
zqQg{+wsI^yDY+p_0Q@pIXLyw@CRzl7=L^PT?0>&Tk@9Fv=p4r@IN7yV<4jtaytv22
z8ADh%WTOzr^321ghWbIpH28hX8s+TLOz#X2;FQDf)4PV%5Ut{$&9CvSC%w=7*-YWX
zI9opI+H)p&d0$t)%10klll<WS9L^?KN9m3<tR3D80w?JCbQlr#R`yPC*7!ufLA;G-
zwrvJ-FmGiuKl5}JE4_)jIGXeZIt}RZ+#OoF2_RNY@dLZByWi+mPm9L2QDS3TnADzy
zAaqnj2p3!eJHKhS$MucZ01b{Bcs-b#pR)=ii1%M1qsJqy^2uHA^@mR*jkeggf6A0}
z?vV=7P)1Q<krc`&#>={B9pI_%pzG*P3MfjB;oOT~rso+->>QC)Nw;mn8gqZN*G;ey
zwJ4JtRRcc%i|SHWuv<6wN*1pKsu3P}wDX~JUcrZ4XO6E3u1H3(o)~=U{?4;=vcaGr
zhz%PL2UX(ks~@^K^(Jc|kjsTVLMWoSrcrv^CG}sw@VjQH#J0at-fZReFJ=aU;{VBL
zf(=EUOfQ_>**MKB=+Hiezy-KIS*&t|uE5%IcsIaW>rVT(;dz(>HM;?|%q&Rwz0%C0
zvz`FOyHHt!fO2;T+5uhQlD7W5-v`}aD#~Wxs!VX49j>AkXcVz)XqBge;_Xn_pafdn
z!R%$|=o#-o&x`sHfkTiolG7*d)p983UX+uC@$c5#cb(me){09fw1C8&heD?_ybZqG
zcLL+kpB39j?OUZ|iI_N7m;1n!4kpnrD~Vx4!IkUME@f(@y$-^WKz%@B`J<V=bVcQ*
z(4lc^i?TLqdDs#?88ON(s&J-g=$ynLv-U#S%`2wha;&&nl`_p(X+peS7>U<yqU<{#
zfk7Pa^+gk?{aqj8)>b~hRifJs0QcCn(neRti=vaBEuCp#c%;s2$}dRr0ScX6QM%Kn
z+b#4+j-!+k%$Yetg)2Ygn<c|KpyoszzL4NEEdZypiQ2Ohrqyvy8SXwCItWvFJ#IIo
z_cxiSB0TgWHEiCRw9>Du12i|-lu;@kD4M^=l`fK)x-*RvGI-A^Xf$nCFh?};3}>s5
ziM)&-)gkLL)1;VpPeV?UWrjlf#f@;I7MU}ss6=~D8b!8V+{!q1Q7%!@u`7)yiwD*K
zmj!6k)$tr>bT#ofE08-XMXuA!Mgheq)s@+Qg?^`$o)s32#e{DGz`mUmo32W%kHOQ(
zUn+AVZCSaa4LTn%ijD(#n&bQ%WjK~B_<*@Ulo&NN7j`H%Qz_)ary~_qTH_Gj?s}TN
znKZ>LKnkI*_NPNTJ|tA&lvTr<qf)A+)tGv%dx*o3mQp=_$!=E_^x=_F4uy9;;^_Tc
zmmp`dh<?9eocigPtjNZ8qYN`z@`7Bh4WRd?PDz8re<uP#$uBCfCz+84CwGlekKERr
zj-}QxldZe#kcOkozSvM}2_uM}hg8+1?y#{T1I@Xcd|k+--5gHdX*X8je4n{=gx#DD
zT<>iAE6Yd`nSzn;mOqz-RKt}(U)DJ5Rvxy)Yr6A|Ag5gKkOsud5(6l{WkN&mW3*xX
z=sARAZ9fiSP;=v7wrx!IkF4kI2xc>o!UCe>-nMeiFr{mo+AydZx3bK6S^cG79Si!K
zV`MUL@LpMafPb#b+Pc^eqY1p6gd<#5#UVtczCic6CfLX5W15di<{`cFI@yhcA~44f
zJMKOr^ggeoNIXMW+nL-{dwQEnsmn_M1r(rt-k@u6ocB-YMrqiMDOuUBeuO1rucC}y
z0wAfw{5Aq_g?c@-4Cy)uz1UIEIthE;{I^tf&n>)vS#vjwAH|z4Dc;t!#<D_?LoF=E
z5mRZL#(B+gR=V=cGczu=+5sS3zr=BRK%T-U*#c<MTg}w+Sdb8H#W~ru8HrgHa~KSU
zYX-tM?+nTLNz`5gjW)R{(_Ux}OSbfuNWBhF`m5?J)uNvdUVP}P{>A|LKQ`yLpP{(j
zu}G|lDCX!N2X%mJeeKHFqQIzFbnB5!4XRte7TMl}75Dk?g(NxqW=-6HC&UC$k=XfH
zq>}PRGly!Z99wgog1EUeSqZQ^4}nQs9{^j=;L-priZ4?14;uE8YwLCWK_~1LtRp|Z
z{iR5fkX!)<rzWBtE<{A$yr4<-xT}$z`T~+8^oQ=b@72cX@xg?tFlM+twJ+Kl7>A-^
zc6N4_?LI$^V)f2y&Kc=HvtTVcKo5<Nw8?+Ldn^EULE0t9A7@2Tl$en`oJyWbeY;*7
z#En@5v{p?F=^_p2f{3<4@F76{rO|Vji1Qm2%mV#EXBU)RGnpR%3|=b1;MGXEg->~!
z6-l5bgdO`locYqk*{|}897MQI*PdsEKdxFMw8|ZeC&qUne^bdP8)JxQll2YfzmzgP
zN%uaqw)?tWgxu$nQ+S|{d0u9_a}Irug0YRGYUC^Nl3H5gA)2efbde?OOm5vIsqKE@
zVC~A>c~Xc+s1YF8gJbD^+g`($VmDKbk>}?X?rYDpL*n!G8hU<YK*^>oe_k!^Ph7ap
zzu)akVl1min|9A4*%JytA3=f?MGOg!|6#ykuxh@u*n32tszi2n?i6oMyQV$`eS)_R
zDL@Rp$@%z}J;B5kR*^?-(5}4q(#=dt#j-Z-MwbM*FS_R>=iMMyP5mdx@RIf|uVM>Y
zk3Gt(a5FVEv+DvHSgdePbY5&!#|Y;-`-6H!+g{n)^%JIV*(0<+q6V$!KMDN$B4-HD
z-1ha{gPYu3gm~7+EeSYJ!;9{yIz!<sRS&G-tOdaQ>K_KHF=N*=g~MBpWgTA1bMyZ&
zJkW@Ev+x_yr}GhpsHitemf@w73HunHYt@T$k~KVmwP>arCx>IyDa$CqnuyR|%`nP!
z7R_F)Pt?&Kv6G_jRYMX4!J<5<MFB=eV2zg(K9MI4C{deCW_l5Vv@p0Ut1a4_Q!&QZ
zq6n|tUNKqo=l)@z{T~M2<2%p8+dcTTNbTULuxsQ9cq>6HE&oTru$S##Go#UF>^fL`
zG6&)+x!rJ(5J7wxOzZUXQ$TeMeRJ=wi#|_rxxj5o##3y05I&-BquXSaHu^$V5V=3w
z$_Zq!t|c)v0215ScU;#=BQO|GDvJRQ%+784{zus+My@k52W0h&oh_s<`!d$w9u3bq
zQd!3ifA-*juNHfIsoPrDS+?r_9w=|5p%%cFSkBuJzWu05oT2y%ECftFJgndsPgdwL
z{;rEGDqWneL1$Y{G4u=4*{V8mkCJ3~AuG>o$|K>nlix2Qg!;*lT_;6=b*r7^yJWnq
zfa*<@<AOT-mUrZr-~;^}=C=OqB%ilw)#VSNd&DaU0*8$oc$V;MqGvXJ!QT(5bDL#(
z3|{?J05g^2_VT}xLJv)9PePwD6JYPd?D*$Kc-II2<&Zn0$V=;OcJS?9cW#mtRDU?q
z9lYJoFlAC2>e2+(Q~4%2`i&I@0KP%V*Q&DLxXGG@7H?dgIOac2^J!#Y6HMK_`rl(G
z^xY<GEWlL5er8_4D{AQE11OxVb~UuKOj7OAKu}J;@jV3kL+JDl@ym?79sbop0&opb
z%-Y|Kz8uOks)j&95rOjMR%y|JSr;?40b#*j>d}rnp?x_^rutkw?g%jAC=1Y(8ESV=
z^`i1yC61=?koSxUV4`RZFcR)v|8|urWUHjzdBx~dD+V7)lT7(XJf2y06*TshAY(>i
z;PN-yH<|O7LEi}R3wn<ZuvZO&gUsQpSu&+%TPNhUqIv3zdK_iAtR9uFEeGT^AA9t}
zoXE=^2o%hiy!Xj>6f)MG&wq!frA4&;4pzws84AF*(P;D1AWV(nRtQXhxQ+s%33;H~
z3%6=>aSsx`1xLlIJy<5r<xKp&M8p+Qn=gK<DQ?Tef!9^pvvN!$hlqFQeAIZ)6GKqK
zxVFyK!#5(dvNf@U$?s<lwNTi7($8ador@+=>ECgE1cduT-M=$ZLJRZqVI9CylU2Hy
z;KT+v&PY9IU4JD%Mzh)}EFzp_9wgHQXlOW~fJGNO1ddh=C*{dh(Pnt=R5aGPxQz(v
z>#ityC1zfT8uYa1j`%>`W9@~5E+j#+y==KXI>dP)W>r~QWc;)b0LP-rlJ|TlpA87*
zvW3Pc4wiShH%k9u9EfxCnQ~rM<@j^3IvGnT(mhbQ(@0ElQecZK`PvA~nIyFUU)l!O
z+hRF9R})q_t#3^NyfP7*mu`X%Bs+Z|?*}SUDlCm}7wm}^j8|9Kcu6FC1z=FxG<I2A
zId90w^#8vmSn;Itmw?O#*EMAjF}_E`rLRXxd2ul`tG(m%Ssl9e!9`h2k#mB{AL)Ga
zO32#pF$JVXNvq+IvCz3eEVVBzF<u@uBe6sT8yNnb3H|s7;zr*TZ4q_hk-2wT+o6Mf
zaa8U5t<)y7ddktCTfw9vbw`{~S&V>V<)j=TrM!m_#t>BwpSToNHl;&`dPoXrLx&$J
zY8UMsBo<Tef&zOTzOn<})E#wl0ow8Q5WmhBGazU|aq$P@*>N7p(pqlua5?6)eWx~x
zLajFrYkmDvRcKFLuZ!5S%5s*>4vclcWZejV-?Zp^kvF_WDDGOwnAEZXNzB-2HvJz4
zI&cnFSkBS7rs1N@2Ea0I_iLk7MTie_qrsC+w(FFsASMpO+IXO-jrve8mIfu$2?>|=
zup8&(Ed{V}@PZ8ne@n~SE}Us(O{o)e0Cy=M5*#kJv3^Sj^Y<s8A2LRs?m4@R?^;x(
zSz@}P;l$Ya%oC}L{y+DsgjmekD@R?{+=%8`;10wx*jxw1e>(2;bzVwyjooUe8;l-J
zJsWY)4i&9lnTzdEah*tMqBURtyFfDk;d=*4C$Wo?;PbU=1kU5FJXnX1!_k<kRlFJU
zL;llzVsrVYZb#)Qp61Mg3JIfb#lJn)J7hNB6#%uHBMO~TvuCyzb$5zHId6jDi>sV5
zE<a__K^);R_gO3?&u&9sBqGs8`U8xr=(E3Arqe0|9_arMW~CX2G`qY^iHoYUlB5G7
zdUrj#|D;c+XWaEd<H{oHiTa(|`RB_HkAhC$FfZ5spfdFOeM_7!KrD{hMk(n^&=Q8$
z=B__++Qsh>#I-MFJDPrxW)Q|YcOMJz#I_BywyFUyoScfxq}VwyL9#2qh1qyPJYFDd
z#(Ty&OJlN(X!r@f%{t>`Ge>FLN?Z5QZcF%cs~lQADm!IuMSV|9!&%p7y$YKL0e^8z
z_z-wD_=9Lle!%@2hvto)96%IWNz+V$YI~VwIl2m%H5r7Tt183!?p(RIgl@F>#9n7|
z`n~}b{k9uviQ7ubBI*-j-3>8x6kyD)O;MU%7cXB-8&!RQhSZHE&Gj_^rfZ_@eOsL3
zDYDi+Xp0Bmu*>EonDM1BZm8geS$m%W#%Gc~O_Qvo<uOn=kB^T*d$k-RS`$=sXKmYe
zsXb^CwDA+BDg=&@_ype(aM;4M5f$BPOhLs(u#zyg{DhPI+7>RKbNZLSm&*e~kFvO{
z+&_I$+)=uU8fq)Ur|+G-!>$$IY!Bk<1FI!m{ZEWBX%59MgdA2*O3fpYpEO8(oQtLh
z)}bBGjKM}6kZCPAXH1AMoqaTO6{ga_BtN{m&ez+l|0jODSCa2x#y$<Tu%5P^J6}hV
zdf15l&O=+QSYAfXlbE_Gt}aP`!`q4#@X`57F3okV`3bxt%B#eKIoT;GSzYtN>~py0
zmQOPIC1HxE7<r{Tjc$N3Ed@2juj-;O@n-*N=)qUpeU{YQ(PL(xwOvmgP+j0J^}w=2
z%VBJ3Cq*n7Z1GZIG5&nPf<Zwjp+o%(Jqf|GgKmyZgTXVp-6=)^DjI3DECB;<ZpwSb
z|1Pf*TvCx5Ued7{TE+vbuz?>W_Av!={Z*-KMCzoy8bjt{d?W{oS^tNjq~2U(?L37+
z^L(y)3DwWy!!6QY$21Y_fU#5Q%yJH}5Mta0z5DYeApc*C0IgoXCvQqyzQqEXOZ$zB
z$tAb66&d^7@wi_A4WRX!K+!CUi+UJ!4|iMR?43=I|1v9zOQRO^AZJo%i;@_fh}%Zk
zi1@WD2i8)0N5-eqH!}tqO8it2T$rljr);m_q(!=WBS_p`DN`ldw!k~sY0S&34+*FJ
zjko?jYL@7mJ+RNz$x&vi73KfCPM>)F6GU`y$j8KWW-M8M@R^f>XOObP$uoCc#V-p!
z9pV{b?mkA|sb4AxJuc&6!=1fH$@HiI^j>dOyo{Fis6%7BPPdm?kYgBg_>G92r)(Wb
zUXg0s9i}uc3%*`@$MCsJ^J5L~dEk2i-#i(KWPRlyio^&yh5oV($cfD23kLp33U=lI
z3lGM{X*FJ4<(1LfzR*$>ZlUS-`%dyaks2qF3W3ll<HXFL%nS#;r*Luf|248tT=rkl
zr;kQdI;svMl6Xp43_Dk#%<x^G1+n&_X@BlWo0c9jPxWNgzd}lCBz)2jgCWA`tmexd
z7yX|f0q^*A*z-IUkjsVUk~Z^f>>kd6MjNV5%XRj=Ca$$Y+VU(cEdODUR=0FN8~&qc
znwt1d=hsgntE%IQ_rg7#Id~Z>y}xZ8{t|Zz0l#Tk>V7IMi$Scb=6Q(@MKND!wtMke
zqvq3A{PARG8U6=M%NDIoea83ME?e~c;xWwQPMzUhYC2Ds!JSlI(Igm)Had`B95c&H
zApE$Y`dO;~VX$pLhYM!>0j+<WRKR0|oR%DKXkmCkw&2>k(Nol-aQgq#+I0mr0d3nL
zq9__01Q3W)1OzV9LNx*+T|i3cpa=<s-XYRd5CkL;I-$2fLa(8UAYG)l0Fi2F5v2-J
ze0lHAy!-CQn|U8^=6sylpL@>C*?aA^*Q&`XvbI6-R#kyk8ps#$v;`WM*j$ZXu3Oa&
zD6pgB(kE}@&YdZT6q~O(6PDc^Z*>w3ugWVYvS_0bNiv3gPPGvXX3aVoj8Irodf$5?
z$qrkOpI2kWA`()>$W38!zM7)497VPN0J?U$nO4quRBO!q+KgZ-U4@J%-7Ax)_dVhl
z<nI$+9|G<^Of1PCr2U5EAePBs+{;9b$zG`XJ^9pf$y!t?0eQ@><gulwGW<&zj&43@
zUM*f0ZxD1Dr)C#4yXcz>wbE7jJS_@baM#EzttqqBifWUkB7BR~8n)LAg_+>qo(Z}9
zXGk2x@*B5q8p)CE6$u^zhWkl|=XQeM8NCX44H;3MxK2cw?OMC*E(NS)5r$nwFGmfh
z?S20pxop){tK_KKTw*4ihFgxm%H~O1LwMXE-ttyUPWf)_hOB_;0_81>s%rr*j=Z<6
zaF!kvUngbyRD3m_wI&~|sVKEFCJjRP<xr{|zk8Q@W%wKm7ZWrpI~1=@y!Z<cLu$*%
z6jC$8TC38D3NGJ{l4SEGTBKfOX|9_x$T_LKcEH;58w$s)w5{b#rZh;o>Ld_ha;3mw
z)7{I+$S<<C3WD|LIt!Vibq<BOIMT<32J`yY-wyas<Q#=D+W3Y`Pw#+W-?~hv$W~8H
z_`zc*GMM4Qf&wg*<ngtsOs#2|a0zfz=k=1|Q&dyE`QV;lQGQ^(*Vbf^)(9SNHwr0p
z(pKKSfwzoTW_Cr9^44(@C3BN4s%$l8t&N2$6-}EN)=SHcGD1ef*r;&zPnm%j@t}V&
zC-I+wJUmWW8uEDy3ejw}qCR~~F0@_Wa)1MXiLTN*ggpi7tK@B~v`?0*vh=)If1<V#
zb!6GAARTg3cWq5J$pTI#V-G0BSbX(U>tRc!$_0RVQu?j%8=N*V(;oWx0CqN@%#_;h
z{Zh%xo!kBBj&OQzFpom%3(Bhd8BKndI#rp-#tw(+5Vq-xlRh`IpDF*z3`|a|V5hED
zrgrn*A`q%ao*dgb=TLaFtikox<=H24dG=?xCRE6Y%avntz!M%Zd@K4BzEl<DcP&bj
z(``K<h&A(ofR^XfK}Qy-^ZD_X4eeQ<`p-MF&lq=){RQw@P>f&g&EHvRM?W2rDinI*
zRd8!;U2GVAjWg=IWUpxCY|P`9X3>_E<f$e-MpZ!!vFf~ox!*;Mp+|$xgux}QnVy2=
z@nD<d0w4ZKnH5|eN|M3M%~wbLkroUBc-@^Iisu&DKw5TKIM2loc-TgR8KKX*2AeYg
zb8Fcj7^iQ`-ou+t4M@HcIHo&_GEa!#`6YC2OPbE?89Q6OQ$o8j2|My)o`8%dvAGr*
z<QltNOSAkPzRh4FRhpDbylcHeG9oNO_fg|!YLdExK!G&F2VvADD9d=qj>9N3+m9Jv
zo-cKtJ)EfM_8pD_o3woiQoe}G+_q44*oXLB5}QbSbJRy6hXq!8$;QNXfKxlaW9P)x
zA{-KHpDrb1LwVK(i<g#Rm0h<>;=f}NYa)@HEU~JneImlC2?f>Pk9c(ZkE1b>Se#UL
z)k!^aC6nRgqeVsG3pPGee(>~bCjyubtK7N6b&=tt+>~NMMTyLX1E%vGD&RxtPEH73
zwxLb!$8V@f5de|{0Ne)1ist$apvs8<Mj`qqmxu+zTnQ7a_Q(EGjp=TKcwYApG{-)b
zsO?#bB(Ke(Johx@O~1REyk%|a6k8J)Ja0$=$pBr$ME(NKl5_giP(O#n+DIOo%gu}H
ztCY0wOS6ZP<_n=+5T6n=YLYgckJLb_TM~IHcpjd3h$})x`O3x1Jf0E_^0Fsdzgn$O
z!>^2S@0rALiYW0ChMb};8RrDB3zUefQD01rajECHz$pvOTDx&ov$Z%o_IxNrv-Nuc
z=rFnPWxFBv(#vAR4{7d4c1|<kG51CHL@HU5{vL`Q9cJ;QGDwZ{tiP!B60}cg7`0<!
z)-}OQ9yJ#oYgnPl0V`-c)${u=Vso)?MBdkmqF~?gv5X4W1rGjl+o0}cpC=fa^PCT*
z#$h{dQyoTDuqTp{^r@Cy%yoFF+QcWD9IclNMhC|h+A!wIK2j|;Gk3PdYWG1VkQ^W~
z#ZkoIC(<px>1$Mm$g@i{hQIE(P<c7-!L9J<<b;(R4@TvxYZr@QWYr%|T^YlMhOERJ
zZ;u;Z2_UOdZ&S<pLPuU|s=1`$K4bK+ioa&ur<7-#&n4#!o^+x^<MW(S-*Y`$*MJYq
z6}e;I^*|1Rm+(AmJU1kt-yrME)S_*4&}bcqQ=`>QHMY^EU$<p5nJ0@xs;RlKfTTV<
zrvhI?-+5IIJnn&0IkOdq)$ksyZc=EjfBjuy%)nFx1U90tKcgV5=N$x7o}#rh63*eP
zc1b!m8Pgn+DG<BzT3zT(2KFlWglX7cKv-}4#7v^q1I2Aoln}_A`KF3ikG630)<_Oh
zx)3tQM@NMlu_e8uyHq71H2AfQ?oAB+cevs86p(;MK7C0_c1g1OgvM$^yv}4=nCx#i
zuXeW=);)SA*8SLIqA<Yy{qAD=f$=?i{bP20>04KWEYa_3ntv_R8_YWB30J6u{slw~
zL)-T;Pz(_0hx(QQHEAirQB~)83lnw~BH|V*EHHx;%-%)~L6XSzyLMtkM5QTeUuf^2
zy3O0cB<<;`&ZSZ1Fn~+pmVbpqaY_E$rp#fZZoZhgYruSr!PnF&8PSi*vo{nS{Myb_
z(H9g#bInbER>MqD-g{|;`#$pi)ADHE;y)sSt5+lV!lZk&vzWe2NkixF7z|x|GG+C8
z{@v)$yS+L@m_#}6`Ji6``EbLHCE$1*u=`7TW4&{ui1@%Pl(^X`s3Ob<pI%U%$TzfO
z?$J6pXYK{$ocLKR0uK$jm2wZJV;bh`u|Y#WhkkISOWUSy!ybgnfq%2gZum8EafEjY
zR_BNI6q{JeT5{ye=5(K#SXObotzZCRN?E;LU*41!)Q?x|>{#V`v;mR*ATDv_<=Mva
z#_;_|)Fshb1o1^3f0Zj2R()L2s;~0$UjQl`&CQ|fw@p-(%DSUN<K_w$+Z78uriRtN
zqO#@{99-liRN>>}BMUZdGCvO^_boDJRs%2;0-*@c4*AJ(K_+&qRj=mo;T|S=bo6-e
z?in?fe?)m?==hD-Sk#`WdSz-bhcE(*B2ZjO)X7-o<BDh968sQMU8${VsJRHhBKyw%
z;7MCIh>1GiVBCDO9RIsTnM(Z}DpAe9W!~O~mk|zPwBj4mm7ett<G!5pKVY?gO$}*5
z?eXE!iN65wg@-ew_mkfOaM#0^d7dNIz?;On51zC}BcOo)AeexaKw9@lJ7IdbcQ|6J
z_j*lRyh6AH`o>QKDb6NjezA#By(^)<aV+j8quSh1oQeCj(JyO|h9FViOHt()w7#+4
zCel=ZlG9HV-;JfHzK3Emv1_64_ZyByp2r@pKSBn@Cv~c)y59}k?i2BK2ik^rIy`pF
zo+g<4&oQ{@d(1xL*dcDj#bwC)vOJMivt$ZXdBX*gr|hivc;!(r<228h=Dd^i<RdSp
z@J>@IO!B3hFXl>q8d>1yEwK~`sj;s6w|<fRdv)$%Z{bRqHr-Y_aVImel_FFRzbF!l
zXcWz>$8WyO>Nt9Sq=ncVbWAVme9nSBI}Xkjb87r#neYPSy??=EJzwoh&7dQI+TQnD
zJ3XeIG06$xKK~5I$p<AL-D_`h<hOJE$lHXI=TW>tjIV^0Ep9{;5DAN5g5#1zU*?Rn
zG_2<?P`uf;Zc3Dp@<!!Ks**2)18m96*SY-K?n*$0%u4eW((FqgCh;C|zHOB&njZ!N
zuQ&znYw1P8`qh!*?hA~!1)HQZYlYHy{b@6?K*=PB@<i9$M%{N8n=j@X6t<T*ItM)J
zi&#p~!)+o`NPkS7*E7~Ld)MaUoz1=?luhob?5NX!+tOh*9{;F@?)^|??|2Otty^7|
zSan<{sd9}ouf1);uDOMIq6_p8<H?-D`D?-_!{iw)!@KvN!NwFI<%E8gq;yUrT`30f
z6pTSs_^Wk`^EaSB1rYTIoRevlXY|@hXoC9$c@pIzlz~M1@^sg-$_;=3KEl%m0SZPu
zwv2Wn4giFV^qzUG_0Xungmk&`tdW#ig?pu29HmaKE~}ZMo_*j&k`a?AuLU)1Om5$q
zS3Ie(XMP$k);n{1<kS6J?*vYlS{ioqFHy$b)cLACQylU|9Yk~T2Uia`fBz0_ZMZQ0
z*ldDA4MZ1Rs%S@0g}HfTz$>A~36!_==`TfDC*e_Y%if;dBwD?)?H&ZWr&rBpw<Q`|
zUnCIb*3fpUbjk|;cxQQ{=Ois{Y}Hv5m%NZs6y>q++J}gi-3o!P3qjwf+^0I3?jG5F
zs10mageMtNapJm+a0N$t|1MtNzkuSmjq|Y;%S1&P*8LctVMCD)@yI)vR8^~=uDdGg
z1L^!}RATK-<d%Ndq~=WUl;Qf+wp(B4DS~XgF}*Ma9a3Fmrve3pBU&cMAT8RG^52q~
zjAKt8bu4l3$A2|m{M5`Ftn!>Nci8lC?$6O-Ru;o_XRNyu@3}t!U?EcfMJk0yQZ-y_
zG8>&sPW`hHME6`buVYP&GJ}q16BW^BqkClUnQkS}rD*x;F973KG;}}Yvl#)**Hxt}
z-=#In6w+|^Wz6QRXTj9n4X(@?dxw*}yCZ*1iTJEZ*UqDL_QxlBB>>>UYamncW7;5*
zktVMGe>n`7UZNca{xk7@PVd_H3?E;?#v&@C(o^)s(L7V{lP!j?gN)8PI~2z2yh7^j
z=K_1Et>(-v{o_CJ>$`-Lb9srZeYyv4@cwe?y9+hW2O(mADoWxQtHvKZh&~pXLSzH!
z%E`md*N#yrmz72z8Yhpd;izzXtT%$5*yr>4y?*h{uKN*{akPPtp?e`StXq;V5ps_E
zEGLqro>sk@H2-o2rG2%*Q#axwQ%o|Ps*+xfkdw%Ir!-6tp^6r!DVNjW_?#nI8A@Jh
zV52g<ck5QzT~@{ck)}6I_wVPGe@J<}HYZ2-GRe98YrI;rA_iokT#!!ZS;qWWZRUl<
z4$nINga2JD!FrHC1^h4qyT>f+Z1h@=d=w(SxKdFVbd}F4BV1PPC}Z>a;6~$ihR|J_
zcQoT7TiX;|*ubW_bWY{wb$Vt#cK_@zrv?!4aMf=+agFZGZyKUtl|O{V9Ei)1jy`is
zyR`f6rRcVf(~`(W8G%Tvo8Bghz|vTM&XCy((m!~gUzdqFYLJqe+oLl^BDdLi@Kj4`
zdEJ)pWo6R4_SVC)E4QXsjrup{V1-)(VmL%S&3)+O{GoML2pqqm<Rv(8{zTs_dDm^v
z;>%$V?eV^g+h9o?ADev2Qxv(=8w_Hqu+^ptGbsDO^#hgGdb=Wbg~tu_4WB*cDSU&G
zOi(+skD6EHI`!QAo-o#D6WrNKvg<7Dm!X-F{K=lBwEEm*fn0$miHJmIU}bh6!f38@
z60h7_EvWy7+Wt4M_W$p4jtzZHGg9ne<juWWOp|QzS;<!-Nq)rW<quoxh0(p8)xC{Y
zEXeKVv0HXRd7ye)3h4p}-Cu7UC(ZjfM312L9I?508&bn$O?4kzg;R$M506S7S?8}N
z7-;LdNExUH)ksAXp4x{-^ab5R80i~)P>adKawt5qA;owvHSTY(ZW0xxk7I$h38AFF
z0OaY!hn&trR|n*mu03uvcMwp>|3w@8ipP9l44rA|VcV?CY8z&E`^~Y&0eVn2AGvXH
z-bi73E;wXqN$Lmk+vvknk#m2}fmVCIuu?WY1`qw37-A=gyKc`(bDV0oJ)tTteq{R!
zFD*fx8BE4jS%1BJYO5IBRv~w>@{sS5;A)DtAH{FouKhso!bK_Xp~z+X9?AAQu=;nw
zHHX>3Z3Vm?_wzws1#uygZBG1Vnz{ppmDN9{ljmY#o;Nk2tmPF=*TaN*|F;U{{}2!T
GOZpE8(TG(5

literal 0
HcmV?d00001


From 48bd7cc0c73da80550675643b92117025b675e12 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 24 Aug 2023 10:26:13 +0200
Subject: [PATCH 0656/1398] fix deprecation warnings from Qt6

---
 GraphicsView/include/CGAL/Qt/qglviewer.h      | 24 +++----
 GraphicsView/include/CGAL/Qt/qglviewer_impl.h | 62 ++++++++-----------
 Polyhedron/demo/Polyhedron/MainWindow.cpp     |  8 +--
 Polyhedron/demo/Polyhedron/Viewer.cpp         |  4 +-
 4 files changed, 40 insertions(+), 58 deletions(-)

diff --git a/GraphicsView/include/CGAL/Qt/qglviewer.h b/GraphicsView/include/CGAL/Qt/qglviewer.h
index 2cf5b7faf342..a89a66a4b744 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer.h
@@ -32,7 +32,7 @@
 #include <QTimer>
 #include <QOpenGLWidget>
 #include <QMouseEvent>
-
+#include <QKeyCombination>
 
 class QTabWidget;
 class QImage;
@@ -839,33 +839,27 @@ compatible with raster mode): use \c glRasterPos3fv() instead. */
   /*! @name Keyboard customization */
   //@{
 public:
-  unsigned int shortcut(qglviewer::KeyboardAction action) const;
+  QKeyCombination shortcut(qglviewer::KeyboardAction action) const;
 
   ::Qt::Key pathKey(unsigned int index) const;
   ::Qt::KeyboardModifiers addKeyFrameKeyboardModifiers() const;
   ::Qt::KeyboardModifiers playPathKeyboardModifiers() const;
 
 public Q_SLOTS:
-  void setShortcut(qglviewer::KeyboardAction action, unsigned int key);
+  void setShortcut(qglviewer::KeyboardAction action, QKeyCombination key);
   void setShortcut(qglviewer::KeyboardAction action, ::Qt::Modifier modifier, ::Qt::Key key)
   {
-    setShortcut(action,
-                static_cast<unsigned int>(modifier)+
-                static_cast<unsigned int>(key));
+    setShortcut(action, QKeyCombination{modifier, key});
   }
 
-  void setKeyDescription(unsigned int key, QString description);
+  void setKeyDescription(QKeyCombination key, QString description);
   void setKeyDescription(::Qt::KeyboardModifier modifier, ::Qt::Key key, QString description)
   {
-    setKeyDescription(static_cast<unsigned int>(modifier) +
-                      static_cast<unsigned int>(key),
-                      description);
+    setKeyDescription(QKeyCombination{modifier, key}, description);
   }
   void setKeyDescription(::Qt::Modifier modifier, ::Qt::Key key, QString description)
   {
-    setKeyDescription(static_cast<unsigned int>(modifier) +
-                      static_cast<unsigned int>(key),
-                      description);
+    setKeyDescription(QKeyCombination{modifier, key}, description);
   }
   void clearShortcuts();
 
@@ -1075,8 +1069,8 @@ private Q_SLOTS:
   void setDefaultShortcuts();
   QString cameraPathKeysString() const;
   QMap<qglviewer::KeyboardAction, QString> keyboardActionDescription_;
-  QMap<qglviewer::KeyboardAction, unsigned int> keyboardBinding_;
-  QMap<unsigned int, QString> keyDescription_;
+  QMap<qglviewer::KeyboardAction, QKeyCombination> keyboardBinding_;
+  QHash<QKeyCombination, QString> keyDescription_;
 
   // K e y   F r a m e s   s h o r t c u t s
   QMap< ::Qt::Key, unsigned int> pathIndex_;
diff --git a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
index e89577b1d1ae..0611fcf92bac 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
@@ -1204,7 +1204,7 @@ CGAL_INLINE_FUNCTION
 void Viewer::mouseMoveEvent(QMouseEvent *e)
 {
 if (myMouseBehavior)
-  // Use e->x() and e->y() as you want...
+  // Use e->position().x() and e->position().y() as you want...
 else
   CGAL::QGLViewer::mouseMoveEvent(e);
 }
@@ -1221,7 +1221,7 @@ else
 CGAL_INLINE_FUNCTION
 void CGAL::QGLViewer::mouseMoveEvent(QMouseEvent *e) {
   if (mouseGrabber()) {
-    mouseGrabber()->checkIfGrabsMouse(e->x(), e->y(), camera());
+    mouseGrabber()->checkIfGrabsMouse(e->position().x(), e->position().y(), camera());
     if (mouseGrabber()->grabsMouse())
       if (mouseGrabberIsAManipulatedCameraFrame_)
         (dynamic_cast<qglviewer::ManipulatedFrame *>(mouseGrabber()))
@@ -1249,7 +1249,7 @@ void CGAL::QGLViewer::mouseMoveEvent(QMouseEvent *e) {
         manipulatedFrame()->mouseMoveEvent(e, camera());
     else if (hasMouseTracking()) {
       Q_FOREACH (qglviewer::MouseGrabber *mg, qglviewer::MouseGrabber::MouseGrabberPool()) {
-        mg->checkIfGrabsMouse(e->x(), e->y(), camera());
+        mg->checkIfGrabsMouse(e->position().x(), e->position().y(), camera());
         if (mg->grabsMouse()) {
           setMouseGrabber(mg);
           // Check that MouseGrabber is not disabled
@@ -1278,7 +1278,7 @@ void CGAL::QGLViewer::mouseReleaseEvent(QMouseEvent *e) {
           ->qglviewer::ManipulatedFrame::mouseReleaseEvent(e, camera());
     else
       mouseGrabber()->mouseReleaseEvent(e, camera());
-    mouseGrabber()->checkIfGrabsMouse(e->x(), e->y(), camera());
+    mouseGrabber()->checkIfGrabsMouse(e->position().x(), e->position().y(), camera());
     if (!(mouseGrabber()->grabsMouse()))
       setMouseGrabber(nullptr);
     // update();
@@ -1510,18 +1510,14 @@ QString CGAL::QGLViewer::clickActionString(CGAL::qglviewer::ClickAction ca) {
   return QString();
 }
 
-static QString keyString(unsigned int key) {
-#if QT_VERSION >= 0x040100
-  return QKeySequence(int(key)).toString(QKeySequence::NativeText);
-#else
-  return QString(QKeySequence(key));
-#endif
+static QString keyString(QKeyCombination key) {
+  return QKeySequence(key).toString(QKeySequence::NativeText);
 }
 
 CGAL_INLINE_FUNCTION
 QString CGAL::QGLViewer::formatClickActionPrivate(ClickBindingPrivate cbp) {
   bool buttonsBefore = cbp.buttonsBefore != ::Qt::NoButton;
-  QString keyModifierString = keyString(cbp.modifiers + cbp.key);
+  QString keyModifierString = keyString(QKeyCombination(cbp.modifiers, cbp.key));
   if (!keyModifierString.isEmpty()) {
 #ifdef Q_OS_MAC
     // modifiers never has a '+' sign. Add one space to clearly separate
@@ -1767,7 +1763,7 @@ QString CGAL::QGLViewer::mouseString() const {
 /*! Defines a custom keyboard shortcut description, that will be displayed in
 the help() window \c Keyboard tab.
 
-The \p key definition is given as an \c int using Qt enumerated values. Set an
+The \p key definition is given as an \c QKeyCombination using Qt enumerated values. Set an
 empty \p description to remove a shortcut description: \code
 setKeyDescription(::Qt::Key_W, "Toggles wireframe display");
 setKeyDescription(::Qt::CTRL+::Qt::Key_L, "Loads a new scene");
@@ -1779,7 +1775,7 @@ See the <a href="../examples/keyboardAndMouse.html">keyboardAndMouse example</a>
 for illustration and the <a href="../keyboard.html">keyboard page</a> for
 details. */
 CGAL_INLINE_FUNCTION
-void CGAL::QGLViewer::setKeyDescription(unsigned int key, QString description) {
+void CGAL::QGLViewer::setKeyDescription(QKeyCombination key, QString description) {
   if (description.isEmpty())
     keyDescription_.remove(key);
   else
@@ -1871,17 +1867,15 @@ QString CGAL::QGLViewer::keyboardString() const {
                   "Description",
                   "Description column header in help window mouse tab"));
 
-  QMap<unsigned int, QString> keyDescription;
+  QHash<QKeyCombination, QString> keyDescription;
 
   // 1 - User defined key descriptions
-  for (QMap<unsigned int, QString>::ConstIterator kd = keyDescription_.begin(),
-                                                  kdend = keyDescription_.end();
+  for (auto kd = keyDescription_.begin(), kdend = keyDescription_.end();
        kd != kdend; ++kd)
     keyDescription[kd.key()] = kd.value();
 
   // Add to text in sorted order
-  for (QMap<unsigned int, QString>::ConstIterator kb = keyDescription.begin(),
-                                                  endb = keyDescription.end();
+  for (auto kb = keyDescription.begin(), endb = keyDescription.end();
        kb != endb; ++kb)
     text += tableLine(keyString(kb.key()), kb.value());
 
@@ -1894,18 +1888,15 @@ QString CGAL::QGLViewer::keyboardString() const {
   }
 
   // 3 - KeyboardAction bindings description
-  for (QMap<qglviewer::KeyboardAction, unsigned int>::ConstIterator
-           it = keyboardBinding_.begin(),
-           end = keyboardBinding_.end();
+  for (auto it = keyboardBinding_.begin(), end = keyboardBinding_.end();
        it != end; ++it)
-    if ((it.value() != 0) &&
+    if ((it.value() != QKeyCombination{}) &&
         ((!cameraIsInRotateMode()) ||
          ((it.key() != qglviewer::INCREASE_FLYSPEED) && (it.key() != qglviewer::DECREASE_FLYSPEED))))
       keyDescription[it.value()] = keyboardActionDescription_[it.key()];
 
   // Add to text in sorted order
-  for (QMap<unsigned int, QString>::ConstIterator kb2 = keyDescription.begin(),
-                                                  endb2 = keyDescription.end();
+  for (auto kb2 = keyDescription.begin(), endb2 = keyDescription.end();
        kb2 != endb2; ++kb2)
     text += tableLine(keyString(kb2.key()), kb2.value());
 
@@ -1919,15 +1910,15 @@ QString CGAL::QGLViewer::keyboardString() const {
                 .arg(cpks) +
             "</td></tr>\n";
     text += tableLine(
-        keyString(playPathKeyboardModifiers()) + "<i>" +
+        keyString(QKeyCombination(playPathKeyboardModifiers())) + "<i>" +
             CGAL::QGLViewer::tr("Fx", "Generic function key (F1..F12)") + "</i>",
         CGAL::QGLViewer::tr("Plays path (or resets saved position)"));
     text += tableLine(
-        keyString(addKeyFrameKeyboardModifiers()) + "<i>" +
+        keyString(QKeyCombination(addKeyFrameKeyboardModifiers())) + "<i>" +
             CGAL::QGLViewer::tr("Fx", "Generic function key (F1..F12)") + "</i>",
         CGAL::QGLViewer::tr("Adds a key frame to path (or defines a position)"));
     text += tableLine(
-        keyString(addKeyFrameKeyboardModifiers()) + "<i>" +
+        keyString(QKeyCombination(addKeyFrameKeyboardModifiers())) + "<i>" +
             CGAL::QGLViewer::tr("Fx", "Generic function key (F1..F12)") + "</i>+<i>" +
             CGAL::QGLViewer::tr("Fx", "Generic function key (F1..F12)") + "</i>",
         CGAL::QGLViewer::tr("Deletes path (or saved position)"));
@@ -2071,11 +2062,8 @@ void CGAL::QGLViewer::keyPressEvent(QKeyEvent *e) {
     _first_tick = true;
   }
   const ::Qt::KeyboardModifiers modifiers = e->modifiers();
-  QMap<qglviewer::KeyboardAction, unsigned int>::ConstIterator it = keyboardBinding_
-                                                             .begin(),
-                                                    end =
-                                                        keyboardBinding_.end();
-  const unsigned int target = key | modifiers;
+  auto it = keyboardBinding_.begin(), end = keyboardBinding_.end();
+  const QKeyCombination target{modifiers, key};
   while ((it != end) && (it.value() != target))
     ++it;
 
@@ -2238,17 +2226,17 @@ Here are some examples:
 setShortcut(EXIT_VIEWER, ::Qt::Key_Q);
 
 // Alt+M toggles camera mode
-setShortcut(CAMERA_MODE, ::Qt::ALT + ::Qt::Key_M);
+setShortcut(CAMERA_MODE, ::Qt::ALT | ::Qt::Key_M);
 
 // The DISPLAY_FPS action is disabled
 setShortcut(DISPLAY_FPS, 0);
 \endcode
 
 Only one shortcut can be assigned to a given CGAL::QGLViewer::KeyboardAction (new
-bindings replace previous ones). If several KeyboardAction are binded to the
+bindings replace previous ones). If several KeyboardAction are bound to the
 same shortcut, only one of them is active. */
 CGAL_INLINE_FUNCTION
-void CGAL::QGLViewer::setShortcut(qglviewer::KeyboardAction action, unsigned int key) {
+void CGAL::QGLViewer::setShortcut(qglviewer::KeyboardAction action, QKeyCombination key) {
   keyboardBinding_[action] = key;
 }
 
@@ -2270,11 +2258,11 @@ See the <a href="../keyboard.html">keyboard page</a> for details and default
 values and the <a href="../examples/keyboardAndMouse.html">keyboardAndMouse</a>
 example for a practical illustration. */
 CGAL_INLINE_FUNCTION
-unsigned int CGAL::QGLViewer::shortcut(qglviewer::KeyboardAction action) const {
+QKeyCombination CGAL::QGLViewer::shortcut(qglviewer::KeyboardAction action) const {
   if (keyboardBinding_.contains(action))
     return keyboardBinding_[action];
   else
-    return 0;
+    return {};
 }
 
 
diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index c5b6a3c7abbe..bc57849f7a75 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -820,12 +820,12 @@ void MainWindow::addAction(QAction* action)
 
   action->setVisible(true);
   action->setEnabled(true);
-  Q_FOREACH(QWidget* widget, action->associatedWidgets())
+  for(auto object: action->associatedObjects())
   {
     //     qDebug() << QString("%1 (%2)\n")
     //       .arg(widget->objectName())
     //       .arg(widget->metaObject()->className());
-    QMenu* menu = qobject_cast<QMenu*>(widget);
+    QMenu* menu = qobject_cast<QMenu*>(object);
     if(menu)
     {
       addAction(menu->menuAction());
@@ -1030,7 +1030,7 @@ void MainWindow::reloadItem() {
 
        // Can use foreach:
     int mate_id = 0;
-    Q_FOREACH(const QVariant &v, iterable)
+    for(const QVariant &v: iterable)
     {
       Scene_item* mate = v.value<Scene_item*>();
       Scene_item* new_item = new_items[mate_id];
@@ -2770,7 +2770,7 @@ void MainWindow::exportStatistics()
   }
 
   QString str;
-  Q_FOREACH(Scene_item* sit, items)
+  for(Scene_item* sit: items)
   {
     CGAL::Three::Scene_item::Header_data data = sit->header();
     if(data.titles.size()>0)
diff --git a/Polyhedron/demo/Polyhedron/Viewer.cpp b/Polyhedron/demo/Polyhedron/Viewer.cpp
index 83182e00bf2e..53a6f3c86261 100644
--- a/Polyhedron/demo/Polyhedron/Viewer.cpp
+++ b/Polyhedron/demo/Polyhedron/Viewer.cpp
@@ -304,7 +304,7 @@ void Viewer::doBindings()
   connect( d->textRenderer, SIGNAL(sendMessage(QString,int)),
            this, SLOT(printMessage(QString,int)) );
   connect(&d->messageTimer, SIGNAL(timeout()), SLOT(hideMessage()));
-  setShortcut(CGAL::qglviewer::EXIT_VIEWER, 0);
+  setShortcut(CGAL::qglviewer::EXIT_VIEWER, QKeyCombination{});
   setKeyDescription(Qt::Key_T,
                     tr("Turn the camera by 180 degrees"));
   setKeyDescription(Qt::Key_M,
@@ -624,7 +624,7 @@ void Viewer::mousePressEvent(QMouseEvent* event)
      event->modifiers().testFlag(Qt::ShiftModifier))
   {
     select(event->pos());
-    requestContextMenu(event->globalPos());
+    requestContextMenu(event->globalPosition().toPoint());
     event->accept();
   }
   else if(!event->modifiers()

From 608d0c81c4ee7223f2997203602dbffc18aef956 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 24 Aug 2023 14:56:48 +0200
Subject: [PATCH 0657/1398] use a macro

---
 .../PackageDescription.txt                    |  2 +-
 .../PackageDescription.txt                    |  2 +-
 .../doc/resources/1.8.13/BaseDoxyfile.in      |  3 +-
 .../doc/resources/1.9.6/BaseDoxyfile.in       |  3 +-
 .../PackageDescription.txt                    |  4 +--
 Nef_3/doc/Nef_3/PackageDescription.txt        |  2 +-
 .../PackageDescription.txt                    |  2 +-
 .../doc/Point_set_3/PackageDescription.txt    |  2 +-
 Polygon/doc/Polygon/PackageDescription.txt    |  4 +--
 .../doc/Polyhedron/PackageDescription.txt     |  2 +-
 .../doc/Surface_mesh/PackageDescription.txt   |  2 +-
 .../PackageDescription.txt                    |  2 +-
 .../Triangulation_2/PackageDescription.txt    |  2 +-
 .../Triangulation_3/PackageDescription.txt    |  2 +-
 .../Voronoi_diagram_2/PackageDescription.txt  |  2 +-
 Weights/doc/Weights/PackageDescription.txt    | 36 +++++++++----------
 16 files changed, 37 insertions(+), 35 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
index a23221fc04fe..d74df4237fc9 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
@@ -47,7 +47,7 @@ namespace ArrTraits {}
 /// \ingroup PkgArrangementOnSurface2Ref
 
 /*!
-  `#include <CGAL/draw_arrangement_2.h>`
+\cgalInclude{CGAL/draw_arrangement_2.h}
 */
 /// \defgroup PkgArrangementOnSurface2Draw Drawing
 /// \ingroup PkgArrangementOnSurface2Ref
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/PackageDescription.txt b/Boolean_set_operations_2/doc/Boolean_set_operations_2/PackageDescription.txt
index 3050f0a5654e..f67e57f7e1a9 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/PackageDescription.txt
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/PackageDescription.txt
@@ -7,7 +7,7 @@
 namespace ArrDirectionalTraits {}
 
 /*!
-  `#include <CGAL/draw_polygon_set_2.h>`
+\cgalInclude{CGAL/draw_polygon_set_2.h}
 */
 /// \defgroup PkgDrawPolygonSet2 Draw a 2D Polygon Set
 /// \ingroup PkgBooleanSetOperations2Ref
diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index 15a863470a20..13e729df74f8 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -190,7 +190,8 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalParamSectionEnd=\cgalParamNEnd" \
                          "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>" \
                          "cgalBigO{1}=\f$O(\1)\f$" \
-                         "cgalBigOLarge{1}=\f$O\left(\1\right)\f$"
+                         "cgalBigOLarge{1}=\f$O\left(\1\right)\f$" \
+                         "cgalInclude{1}=\#`include<\1>`"
 
 # Doxygen selects the parser to use depending on the extension of the files it
 # parses. With this tag you can assign which parser to use for a given
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index 67b8fd643f34..5deea5dec058 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -199,7 +199,8 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalParamSectionEnd=\cgalParamNEnd" \
                          "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>" \
                          "cgalBigO{1}=\f$O(\1)\f$" \
-                         "cgalBigOLarge{1}=\f$O\left(\1\right)\f$"
+                         "cgalBigOLarge{1}=\f$O\left(\1\right)\f$" \
+                         "cgalInclude{1}=`#include<\1>`"
 
 # Doxygen selects the parser to use depending on the extension of the files it
 # parses. With this tag you can assign which parser to use for a given
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/PackageDescription.txt b/Linear_cell_complex/doc/Linear_cell_complex/PackageDescription.txt
index 03264451c0c0..ad0479d5128c 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/PackageDescription.txt
+++ b/Linear_cell_complex/doc/Linear_cell_complex/PackageDescription.txt
@@ -12,13 +12,13 @@
 /// \ingroup PkgLinearCellComplexRef
 
 /*! High-level operations.
-   `#include <CGAL/Linear_cell_complex_operations.h>`
+\cgalInclude{CGAL/Linear_cell_complex_operations.h}
 */
 /// \defgroup PkgLinearCellComplexOperations Operations for Linear Cell Complex
 /// \ingroup PkgLinearCellComplexRef
 
 /*!
-   `#include <CGAL/draw_linear_cell_complex.h>`
+\cgalInclude{CGAL/draw_linear_cell_complex.h}
 */
 /// \defgroup PkgDrawLinearCellComplex Draw a Linear Cell Complex
 /// \ingroup PkgLinearCellComplexRef
diff --git a/Nef_3/doc/Nef_3/PackageDescription.txt b/Nef_3/doc/Nef_3/PackageDescription.txt
index db62abd9bf7e..be928e299ee7 100644
--- a/Nef_3/doc/Nef_3/PackageDescription.txt
+++ b/Nef_3/doc/Nef_3/PackageDescription.txt
@@ -4,7 +4,7 @@
 /// \ingroup PkgNef3Ref
 
 /*! Draw.
-  `#include <CGAL/draw_nef_3.h>`
+\cgalInclude{CGAL/draw_nef_3.h}
 */
 /// \defgroup PkgDrawNef3 Draw a Nef Polyhedron
 /// \ingroup PkgNef3Ref
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt
index 767fc2b01e05..00c17ceec127 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/PackageDescription.txt
@@ -16,7 +16,7 @@
 /// \ingroup PkgPeriodic2Triangulation2Ref
 
 /*! Draw.
-   `#include <CGAL/draw_periodic_2_triangulation_2.h>`
+\cgalInclude{CGAL/draw_periodic_2_triangulation_2.h}
 */
 /// \defgroup PkgDrawPeriodic2Triangulation2 Draw a 2D Periodic Triangulation
 /// \ingroup PkgPeriodic2Triangulation2Ref
diff --git a/Point_set_3/doc/Point_set_3/PackageDescription.txt b/Point_set_3/doc/Point_set_3/PackageDescription.txt
index c6d433e20bfe..afa3d9882f26 100644
--- a/Point_set_3/doc/Point_set_3/PackageDescription.txt
+++ b/Point_set_3/doc/Point_set_3/PackageDescription.txt
@@ -1,7 +1,7 @@
 /// \defgroup PkgPointSet3Ref 3D Point Set Reference
 
 /*!
-   `#include <CGAL/draw_point_set_3.h>`
+\cgalInclude{CGAL/draw_point_set_3.h}
 */
 /// \defgroup PkgDrawPointSet3D Draw a 3D Point Set
 /// \ingroup PkgPointSet3Ref
diff --git a/Polygon/doc/Polygon/PackageDescription.txt b/Polygon/doc/Polygon/PackageDescription.txt
index fd7cd1f7e0cf..49c33a812281 100644
--- a/Polygon/doc/Polygon/PackageDescription.txt
+++ b/Polygon/doc/Polygon/PackageDescription.txt
@@ -7,13 +7,13 @@
 /// \ingroup PkgPolygon2Ref
 
 /*!
-   `#include <CGAL/draw_polygon_2.h>`
+\cgalInclude{CGAL/draw_polygon_2.h}
 */
 /// \defgroup PkgDrawPolygon2 Draw a 2D Polygon
 /// \ingroup PkgPolygon2Ref
 
 /*!
-  `#include <CGAL/draw_polygon_with_holes_2.h>`
+\cgalInclude{CGAL/draw_polygon_with_holes_2.h}
 */
 /// \defgroup PkgDrawPolygonWithHoles2 Draw a 2D Polygon with Holes
 /// \ingroup PkgPolygon2Ref
diff --git a/Polyhedron/doc/Polyhedron/PackageDescription.txt b/Polyhedron/doc/Polyhedron/PackageDescription.txt
index 12ee7940d944..780ed7344468 100644
--- a/Polyhedron/doc/Polyhedron/PackageDescription.txt
+++ b/Polyhedron/doc/Polyhedron/PackageDescription.txt
@@ -6,7 +6,7 @@
 /// \ingroup PkgPolyhedronRef
 
 /*!
-   `#include <CGAL/draw_polyhedron.h>`
+\cgalInclude{CGAL/draw_polyhedron.h}
 */
 /// \defgroup PkgDrawPolyhedron Draw a Polyhedron 3
 /// \ingroup PkgPolyhedronRef
diff --git a/Surface_mesh/doc/Surface_mesh/PackageDescription.txt b/Surface_mesh/doc/Surface_mesh/PackageDescription.txt
index 4278f42d86cc..84829acb9b40 100644
--- a/Surface_mesh/doc/Surface_mesh/PackageDescription.txt
+++ b/Surface_mesh/doc/Surface_mesh/PackageDescription.txt
@@ -1,7 +1,7 @@
 /// \defgroup PkgSurface_mesh Surface Mesh Reference
 
 /*!
-   `#include <CGAL/draw_surface_mesh.h>`
+\cgalInclude{CGAL/draw_surface_mesh.h}
 */
 /// \defgroup PkgDrawSurfaceMesh Draw a Surface Mesh
 /// \ingroup PkgSurface_mesh
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt b/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt
index 7087216cd1a9..b39b30e8f933 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/PackageDescription.txt
@@ -7,7 +7,7 @@
 /// \ingroup PkgSurfaceMeshTopologyRef
 
 /*!
-   `#include <CGAL/draw_face_graph_with_paths.h>`
+\cgalInclude{CGAL/draw_face_graph_with_paths.h}
 */
 /// \defgroup PkgDrawFaceGraphWithPaths Draw a Mesh with Paths
 /// \ingroup PkgSurfaceMeshTopologyRef
diff --git a/Triangulation_2/doc/Triangulation_2/PackageDescription.txt b/Triangulation_2/doc/Triangulation_2/PackageDescription.txt
index f9e1d3a2c047..2f10c201757a 100644
--- a/Triangulation_2/doc/Triangulation_2/PackageDescription.txt
+++ b/Triangulation_2/doc/Triangulation_2/PackageDescription.txt
@@ -14,7 +14,7 @@
 /// \ingroup PkgTriangulation2Ref
 
 /*!
-   `#include <CGAL/draw_triangulation_2.h>`
+\cgalInclude{CGAL/draw_triangulation_2.h}
 */
 /// \defgroup PkgDrawTriangulation2 Draw a Triangulation 2
 /// \ingroup PkgTriangulation2Ref
diff --git a/Triangulation_3/doc/Triangulation_3/PackageDescription.txt b/Triangulation_3/doc/Triangulation_3/PackageDescription.txt
index b1bbaf9f3aca..df07b9900161 100644
--- a/Triangulation_3/doc/Triangulation_3/PackageDescription.txt
+++ b/Triangulation_3/doc/Triangulation_3/PackageDescription.txt
@@ -13,7 +13,7 @@
 /// \ingroup PkgTriangulation3Ref
 
 /*!
-   `#include <CGAL/draw_triangulation_3.h>`
+\cgalInclude{CGAL/draw_triangulation_3.h}
 */
 /// \defgroup PkgDrawTriangulation3 Draw a Triangulation 3
 /// \ingroup PkgTriangulation3Ref
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/PackageDescription.txt b/Voronoi_diagram_2/doc/Voronoi_diagram_2/PackageDescription.txt
index dc6ca27d40ae..b109a0213d91 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/PackageDescription.txt
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/PackageDescription.txt
@@ -13,7 +13,7 @@
 /// \ingroup PkgVoronoiDiagram2Ref
 
 /*!
-  `#include <CGAL/draw_voronoi_diagram_2.h>`
+\cgalInclude{CGAL/draw_voronoi_diagram_2.h}
 */
 /// \defgroup PkgDrawVoronoiDiagram2 Draw a 2D Voronoi Diagram
 /// \ingroup PkgVoronoiDiagram2Ref
diff --git a/Weights/doc/Weights/PackageDescription.txt b/Weights/doc/Weights/PackageDescription.txt
index eb5f9bf451c6..038724d39ad5 100644
--- a/Weights/doc/Weights/PackageDescription.txt
+++ b/Weights/doc/Weights/PackageDescription.txt
@@ -19,7 +19,7 @@ Models and functions that can be used to compute weights which have a simple ana
 \defgroup PkgWeightsRefUniformWeights Uniform Weight
 \ingroup PkgWeightsRefAnalytic
 
-`#include <CGAL/Weights/uniform_weights.h>`
+\cgalInclude{CGAL/Weights/uniform_weights.h}
 
 This weight is always equal to 1.
 
@@ -33,7 +33,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefShepardWeights Shepard Weight
 \ingroup PkgWeightsRefAnalytic
 
-`#include <CGAL/Weights/shepard_weights.h>`
+\cgalInclude{CGAL/Weights/shepard_weights.h}
 
 This weight is computed as
 \f$w = \frac{1}{d^a}\f$
@@ -61,7 +61,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefInverseDistanceWeights Inverse Distance Weight
 \ingroup PkgWeightsRefAnalytic
 
-`#include <CGAL/Weights/inverse_distance_weights.h>`
+\cgalInclude{CGAL/Weights/inverse_distance_weights.h}
 
 This weight is computed as
 \f$w = \frac{1}{d}\f$
@@ -90,7 +90,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefThreePointFamilyWeights Three Point Family Weight
 \ingroup PkgWeightsRefAnalytic
 
-`#include <CGAL/Weights/three_point_family_weights.h>`
+\cgalInclude{CGAL/Weights/three_point_family_weights.h}
 
 This weight is computed as
 \f$w = \frac{d_2^a A_0 - d^a B + d_0^a A_2}{A_0 A_2}\f$
@@ -129,7 +129,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefWachspressWeights Wachspress Weight
 \ingroup PkgWeightsRefAnalytic
 
-`#include <CGAL/Weights/wachspress_weights.h>`
+\cgalInclude{CGAL/Weights/wachspress_weights.h}
 
 This weight is computed as
 \f$w = \frac{C}{A_0 A_2}\f$
@@ -160,7 +160,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefAuthalicWeights Authalic Weight
 \ingroup PkgWeightsRefAnalytic
 
-`#include <CGAL/Weights/authalic_weights.h>`
+\cgalInclude{CGAL/Weights/authalic_weights.h}
 
 This weight is computed as
 \f$w = 2 \frac{\cot\beta + \cot\gamma}{d^2}\f$
@@ -190,7 +190,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefMeanValueWeights Mean Value Weight
 \ingroup PkgWeightsRefAnalytic
 
-`#include <CGAL/Weights/mean_value_weights.h>`
+\cgalInclude{CGAL/Weights/mean_value_weights.h}
 
 This weight is computed as
 \f$w = \pm 2 \sqrt{\frac{2 (d_0 d_2 - D)}{(d d_0 + D_0)(d d_2 + D_2)}}\f$
@@ -227,7 +227,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefTangentWeights Tangent Weight
 \ingroup PkgWeightsRefAnalytic
 
-`#include <CGAL/Weights/tangent_weights.h>`
+\cgalInclude{CGAL/Weights/tangent_weights.h}
 
 This weight is computed as
 \f$w = 2 \frac{t_1 + t_2}{d}\f$, where
@@ -262,7 +262,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefDiscreteHarmonicWeights Discrete Harmonic Weight
 \ingroup PkgWeightsRefAnalytic
 
-`#include <CGAL/Weights/discrete_harmonic_weights.h>`
+\cgalInclude{CGAL/Weights/discrete_harmonic_weights.h}
 
 This weight is computed as
 \f$w = \frac{d_2^2 A_0 - d^2 B + d_0^2 A_2}{A_0 A_2}\f$
@@ -293,7 +293,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefCotangentWeights Cotangent Weight
 \ingroup PkgWeightsRefAnalytic
 
-`#include <CGAL/Weights/cotangent_weights.h>`
+\cgalInclude{CGAL/Weights/cotangent_weights.h}
 
 This weight is computed as
 \f$w = 2 (\cot\beta + \cot\gamma)\f$
@@ -328,7 +328,7 @@ to polygons. These weights are then normalized in order to obtain barycentric co
 \defgroup PkgWeightsRefBarycentricWachspressWeights Wachspress Weights
 \ingroup PkgWeightsRefBarycentric
 
-`#include <CGAL/Weights/wachspress_weights.h>`
+\cgalInclude{CGAL/Weights/wachspress_weights.h}
 
 Wachspress weights which can be computed for a query point with respect to the
 vertices of a strictly convex polygon.
@@ -339,7 +339,7 @@ vertices of a strictly convex polygon.
 \defgroup PkgWeightsRefBarycentricMeanValueWeights Mean Value Weights
 \ingroup PkgWeightsRefBarycentric
 
-`#include <CGAL/Weights/mean_value_weights.h>`
+\cgalInclude{CGAL/Weights/mean_value_weights.h}
 
 Mean value weights which can be computed for a query point with respect to the
 vertices of a simple polygon.
@@ -350,7 +350,7 @@ vertices of a simple polygon.
 \defgroup PkgWeightsRefBarycentricDiscreteHarmonicWeights Discrete Harmonic Weights
 \ingroup PkgWeightsRefBarycentric
 
-`#include <CGAL/Weights/discrete_harmonic_weights.h>`
+\cgalInclude{CGAL/Weights/discrete_harmonic_weights.h}
 
 Discrete Harmonic weights which can be computed for a query point with respect to the
 vertices of a strictly convex polygon.
@@ -368,7 +368,7 @@ used to balance other weights.
 \defgroup PkgWeightsRefUniformRegionWeights Uniform Region Weight
 \ingroup PkgWeightsRefRegions
 
-`#include <CGAL/Weights/uniform_region_weights.h>`
+\cgalInclude{CGAL/Weights/uniform_region_weights.h}
 
 This weight is always equal to 1.
 
@@ -382,7 +382,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefTriangularRegionWeights Triangular Region Weight
 \ingroup PkgWeightsRefRegions
 
-`#include <CGAL/Weights/triangular_region_weights.h>`
+\cgalInclude{CGAL/Weights/triangular_region_weights.h}
 
 This weight is the area of the shaded region in the figure below. The region is
 the triangle `[p, q, r]`.
@@ -401,7 +401,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefBarycentricRegionWeights Barycentric Region Weight
 \ingroup PkgWeightsRefRegions
 
-`#include <CGAL/Weights/barycentric_region_weights.h>`
+\cgalInclude{CGAL/Weights/barycentric_region_weights.h}
 
 This weight is the area of the shaded region in the figure below. The region
 is formed by the two midpoints of the edges incident to `q` and the barycenter of
@@ -421,7 +421,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefVoronoiRegionWeights Voronoi Region Weight
 \ingroup PkgWeightsRefRegions
 
-`#include <CGAL/Weights/voronoi_region_weights.h>`
+\cgalInclude{CGAL/Weights/voronoi_region_weights.h}
 
 This weight is the area of the shaded region in the figure below. The region
 is formed by the two midpoints of the edges incident to `q` and the circumcenter of
@@ -443,7 +443,7 @@ a model of `AnalyticWeightTraits_3` for 3D points
 \defgroup PkgWeightsRefMixedVoronoiRegionWeights Mixed Voronoi Region Weight
 \ingroup PkgWeightsRefRegions
 
-`#include <CGAL/Weights/mixed_voronoi_region_weights.h>`
+\cgalInclude{CGAL/Weights/mixed_voronoi_region_weights.h}
 
 This weight is the area of the shaded region in the figure below. The region
 is formed by the two midpoints of the edges incident to `q` and the circumcenter of

From 79a563bfbc682818e6964717dfe3977e08dc2d29 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 24 Aug 2023 15:17:17 +0200
Subject: [PATCH 0658/1398] fix more deprecation warnings

---
 .../Plugins/AABB_tree/Cut_plugin.cpp          |  2 +-
 .../AABB_tree/Do_trees_intersect_plugin.cpp   |  2 +-
 .../Plugins/IO/Polylines_io_plugin.cpp        |  4 ++--
 .../Scene_aff_transformed_surface_mesh_item.h |  4 ++--
 .../Plugins/PCA/Scene_edit_box_item.cpp       |  2 +-
 .../Scene_facegraph_item_k_ring_selection.h   |  2 +-
 .../demo/Polyhedron/Primitive_container.cpp   |  8 +++----
 .../Scene_item_rendering_helper.cpp           | 18 +++++++-------
 .../Scene_polyhedron_selection_item.cpp       | 24 +++++++++----------
 .../demo/Polyhedron/Scene_polylines_item.cpp  |  4 ++--
 .../demo/Polyhedron/include/id_printing.h     | 12 ++++------
 11 files changed, 40 insertions(+), 42 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp
index 5c14416d9291..f72ebe5a7bd1 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp
@@ -123,7 +123,7 @@ class FillGridSize {
         Simple_kernel::Vector_3 offset(v_offset.x, v_offset.y, v_offset.z);
         Point query = transfo( Point(x,y,z))-offset;
         FT min = DBL_MAX;
-        Q_FOREACH(SM_Tree *tree, sm_trees)
+        for(SM_Tree *tree: sm_trees)
         {
           FT dist = CGAL::sqrt( tree->squared_distance(query) );
           if(dist < min)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp
index 08a8ef803e43..5f9eeed58388 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp
@@ -131,7 +131,7 @@ private Q_SLOTS:
             this, &DoTreesIntersectplugin::update_trees);
     col_det = new CGAL::Rigid_triangle_mesh_collision_detection<SMesh>();
     col_det->reserve(items.size());
-    Q_FOREACH(Scene_movable_sm_item* item, items)
+    for(Scene_movable_sm_item* item: items)
     {
       col_det->add_mesh(*item->getFaceGraph());
     }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
index 0e4b1167f5a9..2f61bd32aa82 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
@@ -266,7 +266,7 @@ void Polyhedron_demo_polylines_io_plugin::split()
   scene->addItem(group);
   group->setColor(item->color());
   int i=0;
-  Q_FOREACH(Scene_polylines_item::Polyline polyline, item->polylines)
+  for(Scene_polylines_item::Polyline polyline: item->polylines)
   {
     Scene_polylines_item::Polylines_container container;
     container.push_back(polyline);
@@ -372,7 +372,7 @@ void Polyhedron_demo_polylines_io_plugin::join()
 
   Scene_polylines_item* new_polyline= new Scene_polylines_item();
   Scene_polylines_item::Polylines_container container;
-  Q_FOREACH(Scene_polylines_item* item, items)
+  for(Scene_polylines_item* item: items)
   {
     for(Scene_polylines_item::Polylines_container::iterator
         it = item->polylines.begin();
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_surface_mesh_item.h b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_surface_mesh_item.h
index 64d2cfe40a58..38ad5b0b124a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_surface_mesh_item.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_surface_mesh_item.h
@@ -59,8 +59,8 @@ struct Scene_aff_transformed_surface_mesh_item_priv
     positions_lines.resize(0);
     for(auto e : edges(*sm_ptr))
     {
-      const Point& a = get(vpm, target(halfedge(e, *sm_ptr), *sm_ptr));
-      const Point& b = get(vpm, target(opposite(halfedge(e, *sm_ptr), *sm_ptr), *sm_ptr));
+      const Point a = get(vpm, target(halfedge(e, *sm_ptr), *sm_ptr));
+      const Point b = get(vpm, target(opposite(halfedge(e, *sm_ptr), *sm_ptr), *sm_ptr));
 
       positions_lines.push_back(a.x() - center_.x);
       positions_lines.push_back(a.y() - center_.y);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
index 6dea656ae705..0d1130e70dd5 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
@@ -938,7 +938,7 @@ void Scene_edit_box_item_priv::remodel_box(const QVector3D &dir)
 {
   CGAL::qglviewer::AxisPlaneConstraint::Type prev_cons = constraint.translationConstraintType();
   constraint.setTranslationConstraintType(CGAL::qglviewer::AxisPlaneConstraint::FREE);
-  Q_FOREACH(Scene_edit_box_item::vertex*  selected_vertex, selected_vertices )
+  for(Scene_edit_box_item::vertex*  selected_vertex: selected_vertices )
   {
     int id = selected_vertex->id;
     CGAL_assume(id<8);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Scene_facegraph_item_k_ring_selection.h b/Polyhedron/demo/Polyhedron/Plugins/PMP/Scene_facegraph_item_k_ring_selection.h
index 8370faf5e352..46d4c02ac9d6 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Scene_facegraph_item_k_ring_selection.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Scene_facegraph_item_k_ring_selection.h
@@ -623,7 +623,7 @@ public Q_SLOTS:
       CGAL::QGLViewer* viewer = getViewerUnderCursor();
 
       is_ready_to_highlight = !cut_highlighting;
-      hl_pos = viewer->mapFromGlobal(mouse_event->globalPos());
+      hl_pos = viewer->mapFromGlobal(mouse_event->globalPosition()).toPoint();
       QTimer::singleShot(0, this, SLOT(highlight()));
     }//end MouseMove
     return false;
diff --git a/Polyhedron/demo/Polyhedron/Primitive_container.cpp b/Polyhedron/demo/Polyhedron/Primitive_container.cpp
index 6d7250f5763b..245d0059b9ca 100644
--- a/Polyhedron/demo/Polyhedron/Primitive_container.cpp
+++ b/Polyhedron/demo/Polyhedron/Primitive_container.cpp
@@ -43,10 +43,10 @@ Primitive_container::Primitive_container(int program, bool indexed)
 
 Primitive_container::~Primitive_container()
 {
-  Q_FOREACH(Vbo* vbo, d->VBOs)
+  for(Vbo* vbo: d->VBOs)
     if(vbo)
       delete vbo;
-  Q_FOREACH(CGAL::Three::Viewer_interface*viewer, d->VAOs.keys())
+  for(CGAL::Three::Viewer_interface*viewer: d->VAOs.keys())
   {
     removeViewer(viewer);
   }
@@ -72,7 +72,7 @@ void Primitive_container::initializeBuffers(CGAL::Three::Viewer_interface* viewe
     return;
   viewer->makeCurrent();
   d->VAOs[viewer]->bind();
-  Q_FOREACH(CGAL::Three::Vbo* vbo, d->VAOs[viewer]->vbos)
+  for(CGAL::Three::Vbo* vbo: d->VAOs[viewer]->vbos)
   {
     vbo->bind();
     if(vbo->dataSize !=0)
@@ -136,7 +136,7 @@ void Primitive_container::removeViewer(CGAL::Three::Viewer_interface* viewer)
 
 void Primitive_container::reset_vbos(Scene_item_rendering_helper::Gl_data_names name)
 {
-  Q_FOREACH(CGAL::Three::Vbo* vbo, d->VBOs)
+  for(CGAL::Three::Vbo* vbo: d->VBOs)
   {
     if(!vbo)
       continue;
diff --git a/Polyhedron/demo/Polyhedron/Scene_item_rendering_helper.cpp b/Polyhedron/demo/Polyhedron/Scene_item_rendering_helper.cpp
index 27bb13524126..0af18b2450ce 100644
--- a/Polyhedron/demo/Polyhedron/Scene_item_rendering_helper.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_item_rendering_helper.cpp
@@ -101,17 +101,17 @@ void Scene_item_rendering_helper::initGL(CGAL::Three::Viewer_interface* viewer)
     priv->alphaSlider->setValue(255);
   }
 
-  Q_FOREACH(Triangle_container* tc, priv->triangle_containers)
+  for(Triangle_container* tc: priv->triangle_containers)
   {
     if(!tc->isGLInit(viewer))
       tc->initGL(viewer);
   }
-  Q_FOREACH(Edge_container* ec, priv->edge_containers)
+  for(Edge_container* ec: priv->edge_containers)
   {
     if(!ec->isGLInit(viewer))
       ec->initGL(viewer);
   }
-  Q_FOREACH(Point_container* pc, priv->point_containers)
+  for(Point_container* pc: priv->point_containers)
   {
     if(!pc->isGLInit(viewer))
       pc->initGL(viewer);
@@ -255,15 +255,15 @@ void Scene_item_rendering_helper::setBuffersInit(Viewer_interface* viewer, bool
 
 void Scene_item_rendering_helper::removeViewer(Viewer_interface *viewer)
 {
-  Q_FOREACH(Triangle_container* tc, priv->triangle_containers)
+  for(Triangle_container* tc: priv->triangle_containers)
   {
     tc->removeViewer(viewer);
   }
-  Q_FOREACH(Edge_container* ec, priv->edge_containers)
+  for(Edge_container* ec: priv->edge_containers)
   {
     ec->removeViewer(viewer);
   }
-  Q_FOREACH(Point_container* pc, priv->point_containers)
+  for(Point_container* pc: priv->point_containers)
   {
     pc->removeViewer(viewer);
   }
@@ -272,17 +272,17 @@ void Scene_item_rendering_helper::removeViewer(Viewer_interface *viewer)
 void Scene_item_rendering_helper::newViewer(Viewer_interface *viewer)
 {
   viewer->makeCurrent();
-  Q_FOREACH(Triangle_container* tc, priv->triangle_containers)
+  for(Triangle_container* tc: priv->triangle_containers)
   {
     if(!tc->isGLInit(viewer))
       tc->initGL(viewer);
   }
-  Q_FOREACH(Edge_container* ec, priv->edge_containers)
+  for(Edge_container* ec: priv->edge_containers)
   {
     if(!ec->isGLInit(viewer))
       ec->initGL(viewer);
   }
-  Q_FOREACH(Point_container* pc, priv->point_containers)
+  for(Point_container* pc: priv->point_containers)
   {
     if(!pc->isGLInit(viewer))
       pc->initGL(viewer);
diff --git a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
index a6669cb35c18..b986582fa00c 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
@@ -345,7 +345,7 @@ void Scene_polyhedron_selection_item_priv::compute_any_elements(std::vector<floa
 
         for(fg_halfedge_descriptor he : halfedges_around_face(halfedge(f,*polyhedron()), *polyhedron()))
         {
-          const Point& p = get(vpm,target(he,*poly));
+          const Point p = get(vpm,target(he,*poly));
           p_facets.push_back(p.x()+offset.x);
           p_facets.push_back(p.y()+offset.y);
           p_facets.push_back(p.z()+offset.z);
@@ -357,9 +357,9 @@ void Scene_polyhedron_selection_item_priv::compute_any_elements(std::vector<floa
         Vector nf = get(nf_pmap, f);
         {
           //1st half-quad
-          const Point& p0 = get(vpm,target(halfedge(f,*poly),*poly));
-          const Point& p1 = get(vpm,target(next(halfedge(f,*poly),*poly),*poly));
-          const Point& p2 = get(vpm,target(next(next(halfedge(f,*poly),*poly),*poly),*poly));
+          const Point p0 = get(vpm,target(halfedge(f,*poly),*poly));
+          const Point p1 = get(vpm,target(next(halfedge(f,*poly),*poly),*poly));
+          const Point p2 = get(vpm,target(next(next(halfedge(f,*poly),*poly),*poly),*poly));
 
           push_back_xyz(p0+v_offset, p_facets);
           push_back_xyz(p1+v_offset, p_facets);
@@ -371,9 +371,9 @@ void Scene_polyhedron_selection_item_priv::compute_any_elements(std::vector<floa
         }
         {
           //2nd half-quad
-          const Point& p0 = get(vpm, target(next(next(halfedge(f,*poly),*poly),*poly),*poly));
-          const Point& p1 = get(vpm, target(prev(halfedge(f,*poly),*poly),*poly));
-          const Point& p2 = get(vpm, target(halfedge(f,*poly),*poly));
+          const Point p0 = get(vpm, target(next(next(halfedge(f,*poly),*poly),*poly),*poly));
+          const Point p1 = get(vpm, target(prev(halfedge(f,*poly),*poly),*poly));
+          const Point p2 = get(vpm, target(halfedge(f,*poly),*poly));
 
           push_back_xyz(p0+v_offset, p_facets);
           push_back_xyz(p1+v_offset, p_facets);
@@ -394,8 +394,8 @@ void Scene_polyhedron_selection_item_priv::compute_any_elements(std::vector<floa
     {
 
         for(Selection_set_edge::const_iterator it = p_sel_edges.begin(); it != p_sel_edges.end(); ++it) {
-          const Point& a = get(vpm, target(halfedge(*it,*poly),*poly));
-          const Point& b = get(vpm, target(opposite((halfedge(*it,*poly)),*poly),*poly));
+          const Point a = get(vpm, target(halfedge(*it,*poly),*poly));
+          const Point b = get(vpm, target(opposite((halfedge(*it,*poly)),*poly),*poly));
             p_lines.push_back(a.x()+offset.x);
             p_lines.push_back(a.y()+offset.y);
             p_lines.push_back(a.z()+offset.z);
@@ -668,7 +668,7 @@ void Scene_polyhedron_selection_item::inverse_selection()
   {
     Selection_set_vertex temp_select = selected_vertices;
     select_all();
-    Q_FOREACH(fg_vertex_descriptor vh, temp_select)
+    for(fg_vertex_descriptor vh: temp_select)
     {
       selected_vertices.erase(vh);
     }
@@ -678,7 +678,7 @@ void Scene_polyhedron_selection_item::inverse_selection()
   {
     Selection_set_edge temp_select = selected_edges;
     select_all();
-    Q_FOREACH(fg_edge_descriptor ed , temp_select)
+    for(fg_edge_descriptor ed: temp_select)
       selected_edges.erase(ed);
     break;
   }
@@ -686,7 +686,7 @@ void Scene_polyhedron_selection_item::inverse_selection()
   {
     Selection_set_facet temp_select = selected_facets;
     select_all();
-    Q_FOREACH(fg_face_descriptor fh, temp_select)
+    for(fg_face_descriptor fh: temp_select)
       selected_facets.erase(fh);
     break;
   }
diff --git a/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
index da241453b286..c931ba6da3e2 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
@@ -339,7 +339,7 @@ Scene_polylines_item::clone() const {
     Scene_polylines_item* item = new Scene_polylines_item;
     item->polylines = polylines;
     QVariant metadata_variant = property("polylines metadata");
-    if(metadata_variant.type() == QVariant::StringList)
+    if(metadata_variant.typeId() == QMetaType::QStringList)
     {
         item->setProperty("polylines metadata", metadata_variant);
     }
@@ -686,7 +686,7 @@ Scene_polylines_item::merge(Scene_polylines_item* other_item) {
               other_item->polylines.end(),
               std::back_inserter(polylines));
     QVariant other_metadata_variant = other_item->property("polylines metadata");
-    if(other_metadata_variant.type() == QVariant::StringList)
+    if(other_metadata_variant.typeId() == QMetaType::QStringList)
     {
         QStringList metadata = property("polylines metadata").toStringList();
         metadata.append(other_metadata_variant.toStringList());
diff --git a/Polyhedron/demo/Polyhedron/include/id_printing.h b/Polyhedron/demo/Polyhedron/include/id_printing.h
index 91be6e8f2246..2bf10a371c09 100644
--- a/Polyhedron/demo/Polyhedron/include/id_printing.h
+++ b/Polyhedron/demo/Polyhedron/include/id_printing.h
@@ -437,7 +437,6 @@ bool printVertexIds(const Mesh& mesh,
                     TextListItem* vitems)
 {
   using Ppmap = typename boost::property_map<Mesh, boost::vertex_point_t>::const_type;
-  using Point = typename boost::property_traits<Ppmap>::value_type;
   using IDmap = typename boost::property_map<Mesh, boost::vertex_index_t>::type;
 
   Ppmap ppmap = get(boost::vertex_point, mesh);
@@ -452,7 +451,7 @@ bool printVertexIds(const Mesh& mesh,
   // fills textItems
   for(typename boost::graph_traits<Mesh>::vertex_descriptor vh : vertices(mesh))
   {
-    const Point& p = get(ppmap, vh);
+    const auto p = get(ppmap, vh);
     vitems->append(new TextItem(float(p.x() + offset.x),
                                 float(p.y() + offset.y),
                                 float(p.z() + offset.z),
@@ -479,7 +478,6 @@ bool printEdgeIds(const Mesh& mesh,
                   TextListItem* eitems)
 {
   using Ppmap = typename boost::property_map<Mesh, boost::vertex_point_t>::const_type;
-  using Point = typename boost::property_traits<Ppmap>::value_type;
   using IDmap = typename boost::property_map<Mesh, boost::halfedge_index_t>::type;
 
   Ppmap ppmap = get(boost::vertex_point, mesh);
@@ -493,8 +491,8 @@ bool printEdgeIds(const Mesh& mesh,
 
   for(typename boost::graph_traits<Mesh>::edge_descriptor e : edges(mesh))
   {
-    const Point& p1 = get(ppmap, source(e, mesh));
-    const Point& p2 = get(ppmap, target(e, mesh));
+    const auto p1 = get(ppmap, source(e, mesh));
+    const auto p2 = get(ppmap, target(e, mesh));
     eitems->append(new TextItem(float((p1.x() + p2.x()) / 2 + offset.x),
                                 float((p1.y() + p2.y()) / 2 + offset.y),
                                 float((p1.z() + p2.z()) / 2 + offset.z),
@@ -631,8 +629,8 @@ int zoomToId(const Mesh& mesh,
       if(get(eidmap, halfedge(e, mesh))/2 == id)
       {
         typename boost::graph_traits<Mesh>::halfedge_descriptor hf = halfedge(e, mesh);
-        const Point& p1 = get(ppmap, source(e, mesh));
-        const Point& p2 = get(ppmap, target(e, mesh));
+        const auto p1 = get(ppmap, source(e, mesh));
+        const auto p2 = get(ppmap, target(e, mesh));
         p = Point((float)(p1.x() + p2.x()) / 2 + offset.x,
                   (float)(p1.y() + p2.y()) / 2 + offset.y,
                   (float)(p1.z() + p2.z()) / 2 + offset.z );

From da0b65d7c9acf0b3842501e47a5c6c988dbbbb45 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 24 Aug 2023 15:29:23 +0200
Subject: [PATCH 0659/1398] fix QSJ/C++ exceptions handling

The javascript testsuite passes.
---
 Polyhedron/demo/Polyhedron/MainWindow.cpp     | 88 +++++--------------
 Polyhedron/demo/Polyhedron/MainWindow.h       |  3 +
 .../demo/Polyhedron/Polyhedron_demo.cpp       |  4 +-
 Polyhedron/demo/Polyhedron/javascript/lib.js  |  8 +-
 .../bad/catch_and_retrow_cpp_exception.js     |  4 +-
 .../tests/good/catch_missing_file.js          |  2 +-
 .../caught_cpp_exception_in_an_include.js     |  4 +-
 .../javascript/tests/good/cpp_exception.js    |  4 +-
 .../good/cpp_exception_from_a_function.js     |  6 +-
 .../tests/good/cpp_exception_in_an_include.js |  4 +-
 Three/include/CGAL/Three/exceptions.h         | 59 +++++--------
 11 files changed, 59 insertions(+), 127 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index 02a6a8cf0791..5829ffb5e22c 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -85,30 +85,16 @@ void myScene_itemFromScriptValue(const QJSValue &object,
   out = qobject_cast<CGAL::Three::Scene_item*>(object.toQObject());
 }
 
-
-
-#if 0
-QJSValue myPrintFunction(QScriptContext *context, QJSEngine *engine)
+void MainWindow::print(QString message)
 {
-  MainWindow* mw = qobject_cast<MainWindow*>(engine->parent());
-  QString result;
-  for (int i = 0; i < context->argumentCount(); ++i) {
-    if (i > 0)
-      result.append(" ");
-    result.append(context->argument(i).toString());
-  }
-
-  if(mw) mw->message(QString("QtScript: ") + result, "");
-  QTextStream (stdout) << (QString("QtScript: ") + result) << "\n";
-
-  return engine->undefinedValue();
+  this->message(QString("Script message: ") + message, "");
+  QTextStream (stdout) << (QString("Script message: ") + message) << "\n";
 }
-#endif
 
 inline
 QKeySequence combine(Qt::Modifier m, Qt::Key k)
 {
-  return QKeySequence(static_cast<int>(m)+static_cast<int>(k));
+  return QKeySequence(QKeyCombination(m, k));
 }
 
 MainWindow::~MainWindow()
@@ -287,8 +273,8 @@ MainWindow::MainWindow(const QStringList &keywords, bool verbose, QWidget* paren
   // Reset the "Operation menu"
   clearMenu(ui->menuOperations);
 
-  std::cerr << "Enable scripts.\n";
   script_engine = new QJSEngine(this);
+  script_engine->installExtensions(QJSEngine::ConsoleExtension);
 
 #if 0
   qScriptRegisterMetaType<CGAL::Three::Scene_item*>(script_engine,
@@ -473,42 +459,25 @@ void MainWindow::filterOperations(bool)
 void MainWindow::evaluate_script(QString script,
                                  const QString& filename,
                                  const bool quiet) {
-#if 0
-  QScriptContext* context = script_engine->currentContext();
-  QJSValue object = context->activationObject();
+  QJSValue object = script_engine->globalObject();
   QJSValue former_current_filename = object.property("current_filename");;
   object.setProperty("current_filename", filename);
-#endif
-
-  QJSValue value = script_engine->evaluate(script, filename);
-  if (value.isError())
+  QStringList error_bt;
+  QJSValue value = script_engine->evaluate(script, filename, 1, &error_bt);
+  if (!error_bt.isEmpty()) {
     if(! quiet){
-      qDebug() << "Uncaught exception at line"
-               << value.property("lineNumber").toInt()
-               << ":" << value.toString();
-    }
-#if 0
-
-  if(script_engine->hasUncaughtException()) {
-    QJSValue js_exception = script_engine->uncaughtException();
-    QJSValue js_bt =js_exception.property("backtrace");
-    QStringList bt = script_engine->uncaughtExceptionBacktrace();
-    if(js_bt.isValid()) {
-      QStringList other_bt;
-      qJSValueToSequence(js_bt, other_bt);
-      if(!other_bt.isEmpty()) bt = other_bt;
-    }
-    if(!quiet) {
-      QTextStream err(stderr);
-      err << "Qt Script exception:\n"
-          << js_exception.toString()
+      QString err_str;
+      QTextStream err(&err_str);
+      err << tr("Qt Script exception at %1:%2").arg(value.property("fileName").toString())
+                                               .arg(value.property("lineNumber").toInt())
+          << ":" << value.toString()
           << "\nBacktrace:\n";
-      Q_FOREACH(QString line, bt) {
+      for(auto line: error_bt) {
         err << "  " << line << "\n";
       }
+      qWarning().noquote() << err_str;
     }
-    throw CGAL::Three::Script_exception
-        (script_engine->uncaughtException().toString(), bt);
+    throw CGAL::Three::Script_exception(value.toString(), error_bt);
   }
   else if(!quiet && !value.isNull() && !value.isUndefined()) {
     QTextStream(stderr) << "Qt Script evaluated to \""
@@ -516,7 +485,6 @@ void MainWindow::evaluate_script(QString script,
   }
 
   object.setProperty("current_filename", former_current_filename);
-#endif
 }
 
 void MainWindow::evaluate_script_quiet(QString script,
@@ -1193,7 +1161,6 @@ void MainWindow::open(QString filename)
 bool MainWindow::open(QString filename, QString loader_name) {
   QFileInfo fileinfo(filename);
   std::optional<bool> item_opt;
-#if 0 // AF
   try {
     item_opt = wrap_a_call_to_cpp
         ([this, fileinfo, loader_name]()
@@ -1210,11 +1177,7 @@ bool MainWindow::open(QString filename, QString loader_name) {
     std::cerr << e.what() << std::endl;
     return false;
   }
-#else
-  bool ok;
-  loadItem(fileinfo, findLoader(loader_name), ok);
-  return ok;
-#endif
+  return true;
 }
 
 
@@ -1818,20 +1781,14 @@ void MainWindow::closeEvent(QCloseEvent *event)
 }
 
 
-bool MainWindow::loadScript(QString filename)
-{
-#if 0
+bool MainWindow::loadScript(QString filename){
   QFileInfo fileinfo(filename);
   std::optional<bool> opt = wrap_a_call_to_cpp
       ([this, fileinfo] {
     return loadScript(fileinfo);
-  }, this, __FILE__, __LINE__, CGAL::Three::PARENT_CONTEXT);
+  }, this, __FILE__, __LINE__);
   if(!opt) return false;
   else return *opt;
-#else
-  QFileInfo fileinfo(filename);
-  return loadScript(fileinfo);
-#endif
 }
 
 bool MainWindow::loadScript(QFileInfo info)
@@ -1858,15 +1815,10 @@ bool MainWindow::loadScript(QFileInfo info)
 
 
 void MainWindow::throw_exception() {
-#if 0 // AF
   wrap_a_call_to_cpp([]() {
     throw std::runtime_error("Exception thrown in "
                              "MainWindow::throw_exception()");
   }, this, __FILE__, __LINE__);
-#else
-  throw std::runtime_error("Exception thrown in "
-                             "MainWindow::throw_exception()");
-#endif
 }
 
 void MainWindow::on_actionLoadScript_triggered()
diff --git a/Polyhedron/demo/Polyhedron/MainWindow.h b/Polyhedron/demo/Polyhedron/MainWindow.h
index b58fa02912fc..542cc40ea75d 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.h
+++ b/Polyhedron/demo/Polyhedron/MainWindow.h
@@ -256,6 +256,9 @@ public Q_SLOTS:
 
   void message(QString, QString, QString = QString("normal"));
 
+  //! Function `print` used by Javascript scripts.
+  void print(QString message);
+
     //!Returns true if the target plugin is present. If not, returns false.
   bool hasPlugin(const QString&) const;
 
diff --git a/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp b/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
index 6348c203eab8..7b6e5225dfe3 100644
--- a/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
+++ b/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
@@ -129,10 +129,10 @@ Polyhedron_demo::Polyhedron_demo(int& argc, char **argv,
   }
 #endif
 
-  // mainWindow.loadScript(":/cgal/Polyhedron_3/javascript/lib.js");
+  mainWindow.loadScript(":/cgal/Polyhedron_3/javascript/lib.js");
   QFileInfo autostart_js("autostart.js");
   if(!parser.isSet(no_autostart) && autostart_js.exists()) {
-    // mainWindow.loadScript(autostart_js);
+    mainWindow.loadScript(autostart_js);
   }
   Q_FOREACH(QString filename, parser.positionalArguments()) {
     mainWindow.open(filename);
diff --git a/Polyhedron/demo/Polyhedron/javascript/lib.js b/Polyhedron/demo/Polyhedron/javascript/lib.js
index bf3638484150..38b3fbba299f 100644
--- a/Polyhedron/demo/Polyhedron/javascript/lib.js
+++ b/Polyhedron/demo/Polyhedron/javascript/lib.js
@@ -12,11 +12,15 @@ print_backtrace = function(bt, prefix) {
 
 print_exception_and_bt = function(e) {
     print("Caught exception in " + current_filename + ": " + e)
-    print("Backtrace:")
-    print_backtrace(e.backtrace)
+    if(typeof e.backtrace !== 'undefined') {
+console.log("ICI")
+        print("Backtrace:")
+        print_backtrace(e.backtrace)
+    }
 }
 
 quit = main_window.quit
+print = main_window.print
 
 noop = function () {}
 
diff --git a/Polyhedron/demo/Polyhedron/javascript/tests/bad/catch_and_retrow_cpp_exception.js b/Polyhedron/demo/Polyhedron/javascript/tests/bad/catch_and_retrow_cpp_exception.js
index 6ae030b02204..7c745c672155 100644
--- a/Polyhedron/demo/Polyhedron/javascript/tests/bad/catch_and_retrow_cpp_exception.js
+++ b/Polyhedron/demo/Polyhedron/javascript/tests/bad/catch_and_retrow_cpp_exception.js
@@ -9,9 +9,7 @@ f = function() {
 try {
     f()
 } catch(e) {
-    print("Caught exception in catch_and_retrow_cpp_exception.js:\n  " + e)
-    print("Backtrace:")
-    print_backtrace(e.backtrace)
+    print_exception_and_bt(e)
     print("Rethrow the exception...")
     throw e
 }
diff --git a/Polyhedron/demo/Polyhedron/javascript/tests/good/catch_missing_file.js b/Polyhedron/demo/Polyhedron/javascript/tests/good/catch_missing_file.js
index 7d947404ea08..a24acf986753 100644
--- a/Polyhedron/demo/Polyhedron/javascript/tests/good/catch_missing_file.js
+++ b/Polyhedron/demo/Polyhedron/javascript/tests/good/catch_missing_file.js
@@ -8,5 +8,5 @@ try {
         throw "Wrong exception!"
     good = true
 }
-if(!good) throw "The exception was not caugth!"
+if(!good) throw "The exception was not caught!"
 print("OK in catch_missing_file")
diff --git a/Polyhedron/demo/Polyhedron/javascript/tests/good/caught_cpp_exception_in_an_include.js b/Polyhedron/demo/Polyhedron/javascript/tests/good/caught_cpp_exception_in_an_include.js
index 628a9d9ff31f..1cdc6b35d997 100644
--- a/Polyhedron/demo/Polyhedron/javascript/tests/good/caught_cpp_exception_in_an_include.js
+++ b/Polyhedron/demo/Polyhedron/javascript/tests/good/caught_cpp_exception_in_an_include.js
@@ -2,9 +2,7 @@ var good = false
 try {
     include("../bad/catch_and_retrow_cpp_exception.js")
 } catch(e) {
-    print("Caught exception in caught_cpp_exception_in_an_include.js:\n  " + e)
-    print("Backtrace:")
-    print_backtrace(e.backtrace)
+    print_exception_and_bt(e)
     if(!e.toString().match(/Exception thrown in MainWindow::throw_exception/))
         throw "Wrong exception!"
     good = true
diff --git a/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception.js b/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception.js
index df91fa781464..43204ff0e465 100644
--- a/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception.js
+++ b/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception.js
@@ -2,9 +2,7 @@ var good = false
 try {
     main_window.throw_exception()
 } catch(e) {
-    print("Exception caught in cpp_exception.js: " + e)
-    print("Backtrace:")
-    print_backtrace(e.backtrace)
+    print_exception_and_bt(e)
     if(!e.toString().match(/Exception thrown in MainWindow::throw_exception/))
         throw "Wrong exception!"
     good = true
diff --git a/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception_from_a_function.js b/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception_from_a_function.js
index 4b889937ef3c..cde7f159e84a 100644
--- a/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception_from_a_function.js
+++ b/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception_from_a_function.js
@@ -6,13 +6,11 @@ function throw_cpp_exception() {
 try {
     throw_cpp_exception()
 } catch(e) {
-    print("Exception caught in cpp_exception_from_a_function.js: " + e)
-    print("Backtrace:")
-    print_backtrace(e.backtrace)
+    print_exception_and_bt(e)
     if(!e.toString().match(/Exception thrown in MainWindow::throw_exception/))
         throw "Wrong exception!"
     good = true
 }
-if(!good) throw "The exception was not caugth!"
+if(!good) throw "The exception was not caught!"
 
 print("OK at the end of cpp_exception.js")
diff --git a/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception_in_an_include.js b/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception_in_an_include.js
index 3e61637989fd..507583abf0c0 100644
--- a/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception_in_an_include.js
+++ b/Polyhedron/demo/Polyhedron/javascript/tests/good/cpp_exception_in_an_include.js
@@ -2,9 +2,7 @@ var good = false
 try {
     include("../bad/uncaught_cpp_exception.js")
 } catch(e) {
-    print("Exception caught in cpp_exception_in_an_include.js: " + e)
-    print("Backtrace:")
-    print_backtrace(e.backtrace)
+    print_exception_and_bt(e)
     if(!e.toString().match(/Exception thrown in MainWindow::throw_exception/))
         throw "Wrong exception!"
     good = true
diff --git a/Three/include/CGAL/Three/exceptions.h b/Three/include/CGAL/Three/exceptions.h
index 6953e16885db..927489b4f203 100644
--- a/Three/include/CGAL/Three/exceptions.h
+++ b/Three/include/CGAL/Three/exceptions.h
@@ -58,9 +58,6 @@ struct Optional_or_bool<void> {
   static type invoke(Callable f) { f(); return true; }
 };
 
-enum Context { CURRENT_CONTEXT, PARENT_CONTEXT };
-
-#if 1 //  AF @todo scripting has changed
 /// This function template wraps a `Callable` that can be called without
 /// any argument (such as a lambda expression without arguments), and in
 /// case the function call is in a Qt Script context, wraps the call in a
@@ -70,40 +67,34 @@ enum Context { CURRENT_CONTEXT, PARENT_CONTEXT };
 template <typename Callable>
 typename Optional_or_bool<typename cpp11::result_of<Callable()>::type>::type
 wrap_a_call_to_cpp(Callable f,
-                   // QScriptable* qs = 0,
+                   QObject* object = 0,
                    const char* file = 0,
-                   int line = -1,
-                   Context c = CURRENT_CONTEXT) {
-  typedef typename cpp11::result_of<Callable()>::type Callable_RT;
+                   int line = -1) {
+  typedef decltype(f()) Callable_RT;
   typedef Optional_or_bool<Callable_RT> O_r_b;
-  typedef typename O_r_b::type Return_type;
-
+  QJSEngine* script_engine = qjsEngine(object);
   const bool no_try_catch = qApp->property("no-try-catch").toBool();
-  if(no_try_catch /*  || qs == 0 || !qs->context() */ ) return O_r_b::invoke(f);
+  if(no_try_catch || script_engine == 0) return O_r_b::invoke(f);
   else
     try {
       return O_r_b::invoke(f);
     }
     catch(const std::exception& e) {
-#if 0
       const Script_exception* se = dynamic_cast<const Script_exception*>(&e);
-      QScriptContext* context = qs->context();
-      QStringList qt_bt = context->backtrace();
-      if(se) qt_bt = se->backtrace();
-      std::cerr << "Backtrace:\n";
-      Q_FOREACH(QString s, qt_bt)
-      {
-        std::cerr << "  " << qPrintable(s) << std::endl;
+      QStringList qt_bt;
+      if(se) {
+        qt_bt = se->backtrace();
+        if(qt_bt.size() != 0) std::cerr << "Backtrace:\n";
       }
-      context = context->parentContext();
-      if(c == PARENT_CONTEXT) {
-        std::cerr << "> parent";
-        context = context->parentContext();
-      } else {
-        std::cerr << "> current";
+      QJSValue js_bt = script_engine->newArray(qt_bt.size());
+      if(qt_bt.size() != 0) {
+        quint32 i = 0;
+        for(auto s: qt_bt)
+        {
+          std::cerr << "  " << qPrintable(s) << std::endl;
+          js_bt.setProperty(i++, s);
+        }
       }
-      std::cerr << " context: "
-                << qPrintable(context->toString()) << std::endl;
       QString error;
       if(se) {
         error = se->what();
@@ -112,22 +103,14 @@ wrap_a_call_to_cpp(Callable f,
         QString context;
         if(file != 0) context += QObject::tr(" at file %1").arg(file);
         if(line != -1) context += QString(":%1").arg(line);
-        if(!context.isNull()) {
-          error += context;
-          qt_bt.push_front(QObject::tr("<cpp>") + context);
-        }
         error += QString(": %1").arg(e.what());
       }
-      QScriptValue v = context->throwError(error);
-      v.setProperty("backtrace",
-                    qScriptValueFromSequence(context->engine(), qt_bt));
-      std::cerr << "result after throwError: "
-                << qPrintable(v.toString()) << std::endl;
-#endif
-      return Return_type();
+      QJSValue error_value = script_engine->newErrorObject(QJSValue::GenericError, error);
+      error_value.setProperty("backtrace", js_bt);
+      script_engine->throwError(error_value);
+      return {};
     }
 }
-#endif
 
 } // end namespace Three
 } // end namespace CGAL

From a12a0fafa9a7d9f716874c0d910b74ab2aa2dd0c Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 24 Aug 2023 15:29:47 +0200
Subject: [PATCH 0660/1398] TBB is a SYSTEM library

---
 Installation/cmake/modules/CGAL_TBB_support.cmake | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Installation/cmake/modules/CGAL_TBB_support.cmake b/Installation/cmake/modules/CGAL_TBB_support.cmake
index 372f3208578a..8a99682f0fe7 100644
--- a/Installation/cmake/modules/CGAL_TBB_support.cmake
+++ b/Installation/cmake/modules/CGAL_TBB_support.cmake
@@ -7,4 +7,7 @@ if(TBB_FOUND AND NOT TARGET CGAL::TBB_support)
     INTERFACE_COMPILE_DEFINITIONS "CGAL_LINKED_WITH_TBB;NOMINMAX"
     INTERFACE_INCLUDE_DIRECTORIES "${TBB_INCLUDE_DIRS}"
     INTERFACE_LINK_LIBRARIES "TBB::tbb;TBB::tbbmalloc;Threads::Threads")
+    if(CMAKE_VERSION VERSION_GREATER_EQUAL 3.25)
+      set_target_properties(CGAL::TBB_support PROPERTIES SYSTEM TRUE)
+    endif()
 endif()

From 9f68b1a0bed10e502a281adb71dfd480f2972880 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 24 Aug 2023 15:29:47 +0200
Subject: [PATCH 0661/1398] TBB is a SYSTEM library, and CGAL::CGAL is not

---
 Installation/lib/cmake/CGAL/CGALConfig.cmake | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

diff --git a/Installation/lib/cmake/CGAL/CGALConfig.cmake b/Installation/lib/cmake/CGAL/CGALConfig.cmake
index 6bc023bdf65d..abd23a6e7fe0 100644
--- a/Installation/lib/cmake/CGAL/CGALConfig.cmake
+++ b/Installation/lib/cmake/CGAL/CGALConfig.cmake
@@ -124,7 +124,9 @@ include(${CGAL_MODULES_DIR}/CGAL_target_use_TBB.cmake)
 
 if( CGAL_DEV_MODE OR RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE )
   # Do not use -isystem for CGAL include paths
-  set(CMAKE_NO_SYSTEM_FROM_IMPORTED TRUE)
+  if(CMAKE_VERSION VERSION_LESS 3.25)
+    set(CMAKE_NO_SYSTEM_FROM_IMPORTED TRUE)
+  endif()
 endif()
 
 foreach(comp ${CGAL_FIND_COMPONENTS})
@@ -179,6 +181,12 @@ foreach(cgal_lib ${CGAL_LIBRARIES})
   set(WITH_${cgal_lib} TRUE)
   if(${cgal_lib}_FOUND AND NOT TARGET ${cgal_lib})
     add_library(${cgal_lib} INTERFACE IMPORTED GLOBAL)
+    if( CGAL_DEV_MODE OR RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE )
+      # Do not use -isystem for CGAL include paths
+      if(CMAKE_VERSION VERSION_GREATER_EQUAL 3.25)
+        set_target_properties(${cgal_lib} PROPERTIES SYSTEM FALSE)
+      endif()
+    endif()
     if(NOT TARGET CGAL::${cgal_lib})
       add_library(CGAL::${cgal_lib} ALIAS ${cgal_lib})
     endif()

From d8583c93d59b054c8dcc5278a183b88c1c102305 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 24 Aug 2023 16:47:12 +0200
Subject: [PATCH 0662/1398] replace deprecated QMatrix4x4*QVector3D by map

---
 .../Plugins/PCA/Affine_transform_plugin.cpp    | 18 +++++++++---------
 .../Polyhedron/Plugins/PMP/Extrude_plugin.cpp  |  2 +-
 2 files changed, 10 insertions(+), 10 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
index 1061b04536ba..d9fbc5a094b4 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
@@ -616,9 +616,9 @@ endPointSet(const QMatrix4x4& transform_matrix)
 
   for(Point_set::Index idx : *new_ps)
   {
-    QVector3D vec = transform_matrix * QVector3D(new_ps->point(idx).x() - c.x,
-                                                 new_ps->point(idx).y() - c.y,
-                                                 new_ps->point(idx).z() - c.z);
+    QVector3D vec = transform_matrix.map(QVector3D(new_ps->point(idx).x() - c.x,
+                                                   new_ps->point(idx).y() - c.y,
+                                                   new_ps->point(idx).z() - c.z));
     new_ps->point(idx) = Kernel::Point_3(vec.x(), vec.y(), vec.z());
   }
 
@@ -643,9 +643,9 @@ endPolygonSoup(const QMatrix4x4& transform_matrix)
 
   for(Point_3& p : new_points)
   {
-    QVector3D vec = transform_matrix * QVector3D(p.x() - c.x,
-                                                 p.y() - c.y,
-                                                 p.z() - c.z);
+    QVector3D vec = transform_matrix.map(QVector3D(p.x() - c.x,
+                                                   p.y() - c.y,
+                                                   p.z() - c.z));
     p = Kernel::Point_3(vec.x(), vec.y(), vec.z());
   }
 
@@ -670,9 +670,9 @@ endPolygonMesh(const QMatrix4x4& transform_matrix)
   const CGAL::qglviewer::Vec& c = aff_transformed_item->center();
   auto transformation = [&c, &transform_matrix](const Kernel::Point_3& p) -> Kernel::Point_3
   {
-    QVector3D vec = transform_matrix * QVector3D(p.x() - c.x,
-                                                 p.y() - c.y,
-                                                 p.z() - c.z);
+    QVector3D vec = transform_matrix.map(QVector3D(p.x() - c.x,
+                                                   p.y() - c.y,
+                                                   p.z() - c.z));
     return { vec.x(), vec.y(), vec.z() };
   };
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
index caea10065a9c..da2089147d30 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
@@ -447,7 +447,7 @@ private Q_SLOTS:
       transform_matrix.data()[i] = (float)matrix[i];
     rotate_matrix = transform_matrix;
     rotate_matrix.setColumn(3, QVector4D(0,0,0,1));
-    QVector3D dir = rotate_matrix * QVector3D(0,1,0);
+    QVector3D dir = rotate_matrix.map(QVector3D(0,1,0));
     dir.normalize();
     dir = length * dir;
 

From dc7f6af55d1c6840d2ae72384a3f5c9dc7a21336 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 24 Aug 2023 16:47:40 +0200
Subject: [PATCH 0663/1398] check that we have an exact match (whole string)

---
 Polyhedron/demo/Polyhedron/Scene_plane_item.cpp | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_plane_item.cpp b/Polyhedron/demo/Polyhedron/Scene_plane_item.cpp
index ba455ac0cc22..f2175e4271b0 100644
--- a/Polyhedron/demo/Polyhedron/Scene_plane_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_plane_item.cpp
@@ -329,13 +329,13 @@ void Scene_plane_item::setPlaneOrientation()
     if(!ok)
       return;
 
-    match = rx.match(eq); // AF: exact?
-    // does_match = rx.exactMatch(eq);
-    if(! match.hasMatch())
+    match = rx.match(eq);
+    does_match = match.hasMatch() && match.capturedLength(0) == eq.size();
+    if(!does_match)
     {
       QMessageBox::warning(CGAL::Three::Three::mainWindow(),"Error","The input must be of the form a*x+b*y+c*z+d=0");
     }
-  }while(! match.hasMatch());
+  }while(!does_match);
   double a(match.captured(1).toDouble()), b(match.captured(2).toDouble()), c(match.captured(3).toDouble()), d(match.captured(4).toDouble());
 
   Kernel_epic::Point_3 sure_point(0,0,0);

From f9c213735bb6e157a60442590cb263a7fbad397b Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 24 Aug 2023 17:53:32 +0200
Subject: [PATCH 0664/1398] last deprecation warning in a full build of
 demo/Polyhedron

---
 .../Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp
index 724ed194fc51..3e94a0adea31 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp
@@ -116,7 +116,7 @@ void Polyhedron_demo_edit_polyhedron_plugin::init(QMainWindow* mainWindow, CGAL:
   actionDeformation->setObjectName("actionDeformation");
   actionDeformation->setShortcutContext(Qt::ApplicationShortcut);
   autoConnectActions();
-  e_shortcut = new QShortcut(QKeySequence(Qt::CTRL + Qt::Key_E), mw);
+  e_shortcut = new QShortcut(QKeySequence(Qt::CTRL | Qt::Key_E), mw);
   connect(e_shortcut, &QShortcut::activated, this, &Polyhedron_demo_edit_polyhedron_plugin::dispatchAction);
   connect(e_shortcut, &QShortcut::activatedAmbiguously, this, &Polyhedron_demo_edit_polyhedron_plugin::dispatchAction);
 

From abb9080102af1f6d2cbbb642820bafda2aa98a7c Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 24 Aug 2023 18:19:53 +0200
Subject: [PATCH 0665/1398] cleanup demo/AABB_tree

---
 AABB_tree/demo/AABB_tree/CMakeLists.txt | 28 ++-----------------
 AABB_tree/demo/AABB_tree/MainWindow.cpp | 24 +---------------
 AABB_tree/demo/AABB_tree/MainWindow.h   | 37 -------------------------
 AABB_tree/demo/AABB_tree/Scene.h        |  2 --
 AABB_tree/demo/AABB_tree/Viewer.cpp     |  3 --
 AABB_tree/demo/AABB_tree/init.js        |  2 --
 6 files changed, 3 insertions(+), 93 deletions(-)
 delete mode 100644 AABB_tree/demo/AABB_tree/init.js

diff --git a/AABB_tree/demo/AABB_tree/CMakeLists.txt b/AABB_tree/demo/AABB_tree/CMakeLists.txt
index f455cae3f06a..b66e3f468771 100644
--- a/AABB_tree/demo/AABB_tree/CMakeLists.txt
+++ b/AABB_tree/demo/AABB_tree/CMakeLists.txt
@@ -8,52 +8,28 @@ set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
 # Instruct CMake to run moc automatically when needed.
 set(CMAKE_AUTOMOC ON)
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
-# Include this package's headers first
-include_directories(BEFORE ./ ./include)
 
 # Find CGAL and CGAL Qt6
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # Find Qt6 itself
-find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Widgets OpenGL Qml)
+find_package(Qt6 QUIET COMPONENTS Gui)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   qt6_wrap_ui(UI_FILES MainWindow.ui)
 
-  include(AddFileDependencies)
-
   qt6_generate_moc("MainWindow.h" "${CMAKE_CURRENT_BINARY_DIR}/MainWindow_moc.cpp")
-  add_file_dependencies(MainWindow_moc.cpp "${CMAKE_CURRENT_SOURCE_DIR}/MainWindow.h")
-
   qt6_generate_moc("Viewer.h" "${CMAKE_CURRENT_BINARY_DIR}/Viewer_moc.cpp")
-  add_file_dependencies(Viewer_moc.cpp "${CMAKE_CURRENT_SOURCE_DIR}/Viewer.h")
-
   qt6_generate_moc("Scene.h" "${CMAKE_CURRENT_BINARY_DIR}/Scene_moc.cpp")
-  add_file_dependencies(Scene_moc.cpp "${CMAKE_CURRENT_SOURCE_DIR}/Scene.h")
 
   qt6_add_resources(CGAL_Qt6_RESOURCE_FILES AABB_demo.qrc)
 
-  add_file_dependencies(
-    AABB_demo.cpp "${CMAKE_CURRENT_BINARY_DIR}/MainWindow_moc.cpp"
-    "${CMAKE_CURRENT_BINARY_DIR}/Viewer_moc.cpp"
-    "${CMAKE_CURRENT_BINARY_DIR}/Scene_moc.cpp")
-
   add_executable(
     AABB_demo AABB_demo.cpp ${UI_FILES} ${CGAL_Qt6_RESOURCE_FILES}
-    #${CGAL_Qt6_MOC_FILES}
   )
   # Link with Qt libraries
-  target_link_libraries(AABB_demo PRIVATE Qt6::OpenGLWidgets Qt6::Widgets Qt6::OpenGL Qt6::Qml
+  target_link_libraries(AABB_demo PRIVATE Qt6::Gui
                                           CGAL::CGAL CGAL::CGAL_Qt6)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS AABB_demo)
diff --git a/AABB_tree/demo/AABB_tree/MainWindow.cpp b/AABB_tree/demo/AABB_tree/MainWindow.cpp
index cd1444b9968c..63e4a0fe5965 100644
--- a/AABB_tree/demo/AABB_tree/MainWindow.cpp
+++ b/AABB_tree/demo/AABB_tree/MainWindow.cpp
@@ -13,10 +13,8 @@
 
 #include "ui_MainWindow.h"
 
-
-
 MainWindow::MainWindow(QWidget* parent)
-  : CGAL::Qt::DemosMainWindow(parent), myEngine(new QJSEngine(this))
+  : CGAL::Qt::DemosMainWindow(parent)
 {
   ui = new Ui::MainWindow;
   ui->setupUi(this);
@@ -40,25 +38,12 @@ MainWindow::MainWindow(QWidget* parent)
   connect(this, SIGNAL(openRecentFile(QString)),
     this, SLOT(open(QString)));
 
-  QJSValue mainWindow = myEngine->newQObject(this);
-  myEngine->globalObject().setProperty("main_window", mainWindow);
   readSettings();
-  std::ifstream script("init.js");
-  if(script.good()){
-    std::string line;
-    while(getline(script, line)){
-      myEngine->evaluate(line.c_str());
-    }
-  }
 }
 
 MainWindow::~MainWindow()
 {
   m_pViewer->makeCurrent();
-  // AF I thought this helps to avoid  the exception when the program
-  // terminates, but it does not
-  myEngine->globalObject().setProperty("main_window", QJSValue());
-  myEngine->collectGarbage();
   delete ui;
 }
 
@@ -80,13 +65,6 @@ void MainWindow::dropEvent(QDropEvent *event)
   event->acceptProposedAction();
 }
 
-
-void MainWindow::hello() const
-{
-  std::cout << "Hhello world" << std::endl;
-}
-
-
 void MainWindow::updateViewerBBox()
 {
   m_pScene->update_bbox();
diff --git a/AABB_tree/demo/AABB_tree/MainWindow.h b/AABB_tree/demo/AABB_tree/MainWindow.h
index 87f6de0c76c9..d220dec44003 100644
--- a/AABB_tree/demo/AABB_tree/MainWindow.h
+++ b/AABB_tree/demo/AABB_tree/MainWindow.h
@@ -1,8 +1,6 @@
 #ifndef MAINWINDOW_H
 #define MAINWINDOW_H
 
-#include <QOpenGLWidget>
-#include <QJSEngine>
 #include <CGAL/Qt/DemosMainWindow.h>
 
 class QDragEnterEvent;
@@ -13,38 +11,6 @@ namespace Ui {
   class MainWindow;
 }
 
-#if 0
-
-struct Foo : public QObject
-{
-
-  Q_OBJECT
-public:
-  QJSEngine* myEngine;
-
-  Foo()
-    : myEngine(new QJSEngine(this))
-  {
-      QJSValue baz = myEngine->newQObject(this);
-      myEngine->.globalObject().setProperty("baz", baz);
-  }
-
-  void bar()
-  {
-      std::cout << "bar()" << std::endl;
-      myEngine->evaluate("baz.hello()");
-  }
-
-public slots:
-  void hello() const // if not a slot it must be
-  {
-    std::cout << "called hello()" << std::endl;
-  }
-
-};
-#endif
-
-
 class MainWindow :
   public CGAL::Qt::DemosMainWindow
 {
@@ -54,8 +20,6 @@ class MainWindow :
   ~MainWindow();
 
   public slots:
-
-    void hello() const;
     void updateViewerBBox();
     void open(QString filename);
     void setAddKeyFrameKeyboardModifiers(Qt::KeyboardModifiers);
@@ -113,7 +77,6 @@ class MainWindow :
       void on_actionView_cutting_plane_triggered();
 
 private:
-  QJSEngine* myEngine;
   Scene* m_pScene;
   Viewer* m_pViewer;
   Ui::MainWindow* ui;
diff --git a/AABB_tree/demo/AABB_tree/Scene.h b/AABB_tree/demo/AABB_tree/Scene.h
index cc109a433fdf..74309b25ef35 100644
--- a/AABB_tree/demo/AABB_tree/Scene.h
+++ b/AABB_tree/demo/AABB_tree/Scene.h
@@ -1,7 +1,6 @@
 #ifndef SCENE_H
 #define SCENE_H
 
-#include <QOpenGLWidget>
 #include <iostream>
 #include <cmath>
 
@@ -77,7 +76,6 @@ class Scene : public QObject
     };
 
 public:
-    QOpenGLContext* context;
     void draw(CGAL::QGLViewer*);
     void update_bbox();
     Bbox bbox() { return m_bbox; }
diff --git a/AABB_tree/demo/AABB_tree/Viewer.cpp b/AABB_tree/demo/AABB_tree/Viewer.cpp
index 6f5eac006797..9e5cf22bdb74 100644
--- a/AABB_tree/demo/AABB_tree/Viewer.cpp
+++ b/AABB_tree/demo/AABB_tree/Viewer.cpp
@@ -1,9 +1,6 @@
 #include "Viewer.h"
 #include "Scene.h"
 #include <QMouseEvent>
-#include <QOpenGLFunctions>
-#include <CGAL/Qt/CreateOpenGLContext.h>
-
 Viewer::Viewer(QWidget* parent)
   : CGAL::QGLViewer(parent),
     m_pScene(nullptr),
diff --git a/AABB_tree/demo/AABB_tree/init.js b/AABB_tree/demo/AABB_tree/init.js
deleted file mode 100644
index e7f08e266c68..000000000000
--- a/AABB_tree/demo/AABB_tree/init.js
+++ /dev/null
@@ -1,2 +0,0 @@
-main_window.hello();
-main_window.hello();

From 3869a4a6c3a9b38431a8aabba1a49575fdb36c80 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 24 Aug 2023 18:41:03 +0200
Subject: [PATCH 0666/1398] cleanup Alpha_sphare_3 demo

---
 AABB_tree/demo/AABB_tree/CMakeLists.txt       |  8 ++------
 .../demo/Alpha_shapes_3/CMakeLists.txt        | 19 ++++---------------
 2 files changed, 6 insertions(+), 21 deletions(-)

diff --git a/AABB_tree/demo/AABB_tree/CMakeLists.txt b/AABB_tree/demo/AABB_tree/CMakeLists.txt
index b66e3f468771..7411a48f67e0 100644
--- a/AABB_tree/demo/AABB_tree/CMakeLists.txt
+++ b/AABB_tree/demo/AABB_tree/CMakeLists.txt
@@ -13,23 +13,19 @@ set(CMAKE_AUTOMOC ON)
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # Find Qt6 itself
-find_package(Qt6 QUIET COMPONENTS Gui)
+find_package(Qt6 QUIET COMPONENTS Gui OpenGL)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   qt6_wrap_ui(UI_FILES MainWindow.ui)
 
-  qt6_generate_moc("MainWindow.h" "${CMAKE_CURRENT_BINARY_DIR}/MainWindow_moc.cpp")
-  qt6_generate_moc("Viewer.h" "${CMAKE_CURRENT_BINARY_DIR}/Viewer_moc.cpp")
-  qt6_generate_moc("Scene.h" "${CMAKE_CURRENT_BINARY_DIR}/Scene_moc.cpp")
-
   qt6_add_resources(CGAL_Qt6_RESOURCE_FILES AABB_demo.qrc)
 
   add_executable(
     AABB_demo AABB_demo.cpp ${UI_FILES} ${CGAL_Qt6_RESOURCE_FILES}
   )
   # Link with Qt libraries
-  target_link_libraries(AABB_demo PRIVATE Qt6::Gui
+  target_link_libraries(AABB_demo PRIVATE Qt6::Gui Qt6::OpenGL
                                           CGAL::CGAL CGAL::CGAL_Qt6)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS AABB_demo)
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt b/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt
index 6f08193da63f..65b4e7febfea 100644
--- a/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt
@@ -9,38 +9,27 @@ set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
 # Instruct CMake to run moc automatically when needed.
 set(CMAKE_AUTOMOC ON)
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
 
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGL OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets OpenGL)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
 
-  # include(${QT_USE_FILE})
-  include_directories(BEFORE ./)
-
   # ui file, created with Qt Designer
   qt6_wrap_ui(uis MainWindow.ui)
 
   # qrc files (resources files, that contain icons, at least)
   qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Alpha_shape_3.qrc)
 
-  add_executable(
-    Alpha_shape_3 Alpha_shape_3.cpp MainWindow.cpp Viewer.cpp ${uis}
-                  ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  add_executable(Alpha_shape_3 Alpha_shape_3.cpp MainWindow.cpp Viewer.cpp ${uis})
+
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Alpha_shape_3)
 
   target_link_libraries(Alpha_shape_3 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
-  Qt6::Widgets Qt6::OpenGL Qt6::OpenGLWidgets)
+                                              Qt6::Widgets Qt6::OpenGL)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Alpha_shape_3)

From df06d29dd1efa1eb1c1aea1c6344541f20b7e608 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 25 Aug 2023 11:33:28 +0200
Subject: [PATCH 0667/1398] fix/cleanup AABB_tree and Alpha_shape_3 demos

---
 AABB_tree/demo/AABB_tree/AABB_demo.cpp        |     9 -
 AABB_tree/demo/AABB_tree/CMakeLists.txt       |    15 +-
 AABB_tree/demo/AABB_tree/MainWindow.cpp       |     4 +
 AABB_tree/demo/AABB_tree/MainWindow.h         |     4 +-
 AABB_tree/demo/AABB_tree/Scene.h              |     4 +-
 AABB_tree/demo/AABB_tree/benchmarks.cpp       |     1 +
 .../demo/Alpha_shapes_3/CMakeLists.txt        |    15 +-
 .../demo/Alpha_shapes_3/data/README           |    14 +
 .../demo/Alpha_shapes_3/data/bunny1000.pts    |  1001 +
 .../demo/Alpha_shapes_3/data/bunny5000.pts    | 35948 ++++++++++++++++
 .../demo/Alpha_shapes_3/data/bunny_ran.pts    | 35948 ++++++++++++++++
 .../demo/Alpha_shapes_3/data/cube_ran.pts     |   582 +
 Alpha_shapes_3/demo/Alpha_shapes_3/data/fin   |     8 +
 Alpha_shapes_3/demo/Alpha_shapes_3/data/fout  |    17 +
 .../demo/Alpha_shapes_3/data/head_ran.pts     |   857 +
 .../demo/Alpha_shapes_3/data/skull.pts        | 27088 ++++++++++++
 .../demo/Alpha_shapes_3/data/thom1249.pts     |  1249 +
 .../demo/Alpha_shapes_3/data/thom384.pts      |   384 +
 .../demo/Alpha_shapes_3/data/torus_ran.pts    |   500 +
 19 files changed, 103619 insertions(+), 29 deletions(-)
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/README
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny1000.pts
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny5000.pts
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny_ran.pts
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/cube_ran.pts
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/fin
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/fout
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/head_ran.pts
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/skull.pts
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/thom1249.pts
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/thom384.pts
 create mode 100644 Alpha_shapes_3/demo/Alpha_shapes_3/data/torus_ran.pts

diff --git a/AABB_tree/demo/AABB_tree/AABB_demo.cpp b/AABB_tree/demo/AABB_tree/AABB_demo.cpp
index 018e0f69c14d..9727327004f0 100644
--- a/AABB_tree/demo/AABB_tree/AABB_demo.cpp
+++ b/AABB_tree/demo/AABB_tree/AABB_demo.cpp
@@ -49,12 +49,3 @@ int main(int argc, char **argv)
 
   return app.exec();
 }
-
-#  include "Scene.cpp"
-#  include "Scene_moc.cpp"
-#  include "benchmarks.cpp"
-#  include "Viewer.cpp"
-#  include "Viewer_moc.cpp"
-#  include "MainWindow.cpp"
-#  include "MainWindow_moc.cpp"
-
diff --git a/AABB_tree/demo/AABB_tree/CMakeLists.txt b/AABB_tree/demo/AABB_tree/CMakeLists.txt
index 7411a48f67e0..46b13f3b1c66 100644
--- a/AABB_tree/demo/AABB_tree/CMakeLists.txt
+++ b/AABB_tree/demo/AABB_tree/CMakeLists.txt
@@ -6,9 +6,6 @@ project(AABB_tree_Demo)
 # Find includes in corresponding build directories
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
-# Instruct CMake to run moc automatically when needed.
-set(CMAKE_AUTOMOC ON)
-
 # Find CGAL and CGAL Qt6
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
@@ -17,12 +14,16 @@ find_package(Qt6 QUIET COMPONENTS Gui OpenGL)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
-  qt6_wrap_ui(UI_FILES MainWindow.ui)
+  add_definitions(-DQT_NO_KEYWORDS)
 
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES AABB_demo.qrc)
+  # Instruct CMake to run moc/ui/rcc automatically when needed.
+  set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  add_executable(
-    AABB_demo AABB_demo.cpp ${UI_FILES} ${CGAL_Qt6_RESOURCE_FILES}
+  qt_add_executable(
+    AABB_demo AABB_demo.cpp Scene.cpp benchmarks.cpp Viewer.cpp MainWindow.cpp
+    MainWindow.ui AABB_demo.qrc
   )
   # Link with Qt libraries
   target_link_libraries(AABB_demo PRIVATE Qt6::Gui Qt6::OpenGL
diff --git a/AABB_tree/demo/AABB_tree/MainWindow.cpp b/AABB_tree/demo/AABB_tree/MainWindow.cpp
index 63e4a0fe5965..1c68338bcf44 100644
--- a/AABB_tree/demo/AABB_tree/MainWindow.cpp
+++ b/AABB_tree/demo/AABB_tree/MainWindow.cpp
@@ -10,6 +10,7 @@
 #include <QSettings>
 #include <QHeaderView>
 #include <QClipboard>
+#include <QInputDialog>
 
 #include "ui_MainWindow.h"
 
@@ -19,6 +20,9 @@ MainWindow::MainWindow(QWidget* parent)
   ui = new Ui::MainWindow;
   ui->setupUi(this);
 
+  this->addAboutDemo(":/cgal/AABB_demo/about.html");
+  this->addAboutCGAL();
+
   // saves some pointers from ui, for latter use.
   m_pViewer = ui->viewer;
 
diff --git a/AABB_tree/demo/AABB_tree/MainWindow.h b/AABB_tree/demo/AABB_tree/MainWindow.h
index d220dec44003..3138efd4202a 100644
--- a/AABB_tree/demo/AABB_tree/MainWindow.h
+++ b/AABB_tree/demo/AABB_tree/MainWindow.h
@@ -19,12 +19,12 @@ class MainWindow :
   MainWindow(QWidget* parent = nullptr);
   ~MainWindow();
 
-  public slots:
+  public Q_SLOTS:
     void updateViewerBBox();
     void open(QString filename);
     void setAddKeyFrameKeyboardModifiers(Qt::KeyboardModifiers);
 
-    protected slots:
+    protected Q_SLOTS:
 
       // settings
       void quit();
diff --git a/AABB_tree/demo/AABB_tree/Scene.h b/AABB_tree/demo/AABB_tree/Scene.h
index 74309b25ef35..ae898f43daa4 100644
--- a/AABB_tree/demo/AABB_tree/Scene.h
+++ b/AABB_tree/demo/AABB_tree/Scene.h
@@ -171,7 +171,7 @@ class Scene : public QObject
     void attrib_buffers(CGAL::QGLViewer*);
     void compile_shaders();
     void compute_texture(int, int, Color_ramp, Color_ramp);
-private slots:
+private Q_SLOTS:
     void updateCutPlane();
 
 public:
@@ -253,7 +253,7 @@ private slots:
 
 
 
-public slots:
+public Q_SLOTS:
     // cutting plane
     void cutting_plane(bool override = false);
     void changed();
diff --git a/AABB_tree/demo/AABB_tree/benchmarks.cpp b/AABB_tree/demo/AABB_tree/benchmarks.cpp
index c337e43efe76..1b68d80bcde0 100644
--- a/AABB_tree/demo/AABB_tree/benchmarks.cpp
+++ b/AABB_tree/demo/AABB_tree/benchmarks.cpp
@@ -1,4 +1,5 @@
 #include "Scene.h"
+#include "Refiner.h"
 #include <QInputDialog>
 #include <CGAL/Memory_sizer.h>
 
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt b/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt
index 65b4e7febfea..7c3b54b8424b 100644
--- a/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/CMakeLists.txt
@@ -7,9 +7,6 @@ project(Alpha_shapes_3_Demo)
 # Find includes in corresponding build directories
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
-# Instruct CMake to run moc automatically when needed.
-set(CMAKE_AUTOMOC ON)
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 find_package(Qt6 QUIET COMPONENTS Widgets OpenGL)
@@ -18,13 +15,13 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
 
-  # ui file, created with Qt Designer
-  qt6_wrap_ui(uis MainWindow.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Alpha_shape_3.qrc)
+  # Instruct CMake to run moc/ui/rcc automatically when needed.
+  set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  add_executable(Alpha_shape_3 Alpha_shape_3.cpp MainWindow.cpp Viewer.cpp ${uis})
+  qt_add_executable(Alpha_shape_3 Alpha_shape_3.cpp MainWindow.cpp Viewer.cpp
+                    MainWindow.ui Alpha_shape_3.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Alpha_shape_3)
 
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/README b/Alpha_shapes_3/demo/Alpha_shapes_3/data/README
new file mode 100644
index 000000000000..74384edcd03d
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/README
@@ -0,0 +1,14 @@
+The purpose of this repository is to make some range data
+and detailed reconstructions available to the public. Currently, this repository only contains models that were scanned and reconstructed
+at the Stanford Computer Graphics Laboratory . In the future, we hope to include data sets and reconstructions from other sources. 
+
+The models in this repository were all scanned with a Cyberware 3030MS optical triangulation scanner.
+Please acknowledge ....
+
+http://www-graphics.stanford.edu/data/3Dscanrep/
+e-mail: 3Dscanrep@graphics.stanford.edu
+file://www-graphics.stanford.edu/pub/zippack/data/
+
+http://www.hs.washington.edu/locke/vislab/
+http://biocomp.arc.nasa.gov/3dreconstruction/data/
+medical data
\ No newline at end of file
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny1000.pts b/Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny1000.pts
new file mode 100644
index 000000000000..ff22c3612dd9
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny1000.pts
@@ -0,0 +1,1001 @@
+1000
+-0.0164722 0.0382453 0.0209318
+-0.0641407 0.171114 -0.0471776
+0.023086 0.119339 0.0317977
+0.00506037 0.0347021 0.0393176
+-0.066143 0.143958 0.0413147
+-0.0445017 0.163753 0.00542301
+-0.0689729 0.181022 -0.0546459
+-0.0931085 0.131006 0.0192314
+0.000506827 0.0489752 0.0512269
+-0.0615935 0.160001 -0.0315914
+-0.0245032 0.0960169 0.0442753
+-0.0258992 0.0891655 0.049535
+-0.000499367 0.0456802 0.0470389
+-0.0171808 0.0654583 0.0528522
+0.00116916 0.131228 0.00582139
+-0.0356565 0.122935 -0.00798984
+-0.0701892 0.156285 0.021569
+-0.0173569 0.038443 0.0259817
+-0.0716413 0.0763478 -0.0132577
+0.0528545 0.0568172 0.0288563
+-0.0325067 0.0732308 0.0407775
+-0.0760686 0.150008 -0.00987485
+-0.030561 0.0774145 0.0410957
+-0.0833901 0.0762729 0.00451303
+-0.000492618 0.0925258 0.0556594
+-0.0358778 0.159506 0.00240863
+0.0115111 0.114076 0.0384616
+-0.0877889 0.0887187 0.00347532
+-0.0261028 0.115949 -0.0147279
+-0.0682913 0.165205 -0.0539869
+-0.0225512 0.0933694 -0.0331106
+-0.0538783 0.0999149 -0.0214389
+0.0435587 0.0959151 0.0211557
+-0.0167991 0.0388632 -0.0107644
+-0.0569142 0.0548839 0.00364185
+0.00749229 0.091015 0.0542708
+-0.065316 0.0625169 -0.002419
+-0.00749647 0.119689 0.0375376
+-0.0772165 0.0934484 -0.0125951
+-0.029008 0.0478606 -0.0250513
+0.00934189 0.0553527 -0.0303034
+-0.0578677 0.104042 -0.0186102
+0.0405495 0.0999198 -0.00379356
+-0.0894314 0.137929 0.0371779
+0.00710731 0.126603 -0.00643182
+0.058913 0.070492 0.0108657
+-0.0922485 0.120133 0.0292903
+0.0395325 0.105566 0.0221621
+-0.0376065 0.0365426 0.0444186
+-0.0550158 0.128128 -0.00563226
+-0.0561672 0.0336533 0.0186553
+0.0123436 0.0351165 0.0296251
+-0.0899184 0.131005 0.0413145
+0.0065365 0.100373 0.0469448
+-0.0502879 0.133796 0.0278403
+-0.0716838 0.0351362 0.00880221
+0.0579126 0.0523842 0.0101848
+-0.0639212 0.154791 0.00385831
+-0.0654795 0.0384216 -0.00684663
+-0.0615513 0.0624603 0.0259481
+-0.0368013 0.0842007 -0.0223672
+0.0522757 0.0574291 -0.0035048
+-0.0764972 0.123179 0.0527664
+0.0302998 0.0694384 -0.019812
+-0.0334269 0.0486094 0.0413091
+-0.00450651 0.0689184 0.0565193
+0.0425976 0.0887597 -0.00680771
+-0.0707351 0.156208 0.0228366
+0.0548799 0.0492406 0.0202107
+-0.00962948 0.168316 -0.023669
+-0.0313363 0.11605 -0.0148117
+-0.0225249 0.125571 0.0012278
+0.0122871 0.124953 0.0313975
+-0.0343047 0.125361 0.0205265
+-0.038499 0.0747376 0.0420783
+0.0292349 0.0759579 -0.0220376
+-0.0255784 0.0477093 -0.0263526
+-0.0750958 0.151313 -0.0258791
+0.0057743 0.0347896 0.0375885
+-0.0926124 0.120126 0.0272917
+-0.0366664 0.175138 -0.00407486
+-0.00549337 0.088417 0.0570387
+-0.0711473 0.17507 -0.0540267
+-0.0776118 0.0739521 0.0284675
+0.0376746 0.104662 0.0282621
+-0.0634881 0.121359 0.0469409
+0.0233296 0.0564006 -0.0254415
+-0.0399361 0.123254 0.0259269
+-0.000577398 0.0341134 -0.0181551
+-0.000496894 0.0520342 0.0541515
+-0.0701023 0.177167 -0.0478719
+-0.0641167 0.143926 0.0389732
+-0.0679369 0.165269 -0.0197719
+-0.0681029 0.138305 0.0455026
+-0.00280426 0.0384802 0.0198949
+-0.0628273 0.0924874 -0.0189476
+0.0084946 0.0869435 0.0558386
+0.00910286 0.0348066 0.0183719
+-0.0195983 0.126231 0.0213862
+-0.0584949 0.143878 0.0330085
+-0.0218343 0.0553077 0.0451067
+-0.0645685 0.147457 -0.0230581
+0.0426227 0.0691122 -0.00279622
+-0.035813 0.0842739 -0.0225525
+-0.0819685 0.0791215 0.0284136
+0.0328852 0.113087 -0.00384394
+-0.0677123 0.168615 -0.0283035
+-0.0556635 0.140996 0.0299986
+-0.0764958 0.131682 0.0526442
+0.0421796 0.0832522 0.0293553
+-0.0848653 0.0855483 0.0264341
+-0.0329445 0.121338 0.0269922
+-0.0320197 0.058187 -0.0133973
+-0.0322785 0.0421631 -0.0296986
+0.0401757 0.067497 -0.00878165
+-0.0904989 0.148452 0.0245146
+-0.00947974 0.0561444 0.0530127
+-0.0310333 0.0383692 -0.000250742
+-0.0780713 0.150403 0.0367551
+-0.0872126 0.146051 0.00824907
+-0.0735722 0.148626 -0.0268487
+-0.00548676 0.116904 0.0394711
+-0.0599006 0.132533 0.037981
+-0.093479 0.129659 0.0212406
+-0.0639063 0.120904 -0.00875525
+-0.028606 0.0356961 0.0524615
+-0.0652024 0.153998 -0.041972
+-0.0262134 0.0765572 0.0473962
+-0.0774721 0.155387 0.0234212
+-0.0628707 0.0345025 0.0358026
+0.0434964 0.0555926 0.0322399
+-0.0618022 0.142496 0.0370478
+-0.0638273 0.0910291 -0.0188305
+-0.0636286 0.0672101 0.0337087
+-0.0842132 0.092522 0.0298256
+0.0185123 0.115397 0.0365584
+-0.0666269 0.131204 0.0458398
+-0.0653475 0.165775 -0.0260007
+-0.0182573 0.181629 -0.0177335
+-0.0142757 0.185348 -0.0257883
+0.0485082 0.0624718 0.0300814
+-0.0254927 0.0974122 0.0441083
+-0.0446561 0.0349999 0.0427486
+-0.0616719 0.0410515 0.0160296
+-0.0179307 0.0931593 -0.0348763
+-0.00828798 0.130102 0.00662088
+-0.0525878 0.149334 0.020403
+-0.0102534 0.128943 0.0232512
+0.0445378 0.0959706 0.0101622
+-0.0465291 0.0335268 -0.00814027
+0.00437534 0.131145 0.0198749
+-0.0394369 0.03436 0.0321562
+-0.0107155 0.127812 0.0260097
+-0.0273383 0.17123 -0.0098418
+-0.0037118 0.0655569 -0.0347446
+-0.0630689 0.150547 -0.0265942
+-0.0776846 0.16386 -0.0329461
+-0.0728796 0.151218 -0.0388899
+0.038172 0.0967289 0.0325586
+-0.058907 0.0983413 -0.0195805
+-0.00549542 0.0965711 0.0536823
+0.00650609 0.0503877 0.0517539
+-0.0847722 0.113367 0.0459387
+0.0309512 0.0822193 0.0430727
+-0.0159859 0.0984773 0.0464357
+0.0361586 0.0781359 0.0382445
+0.0417308 0.0422749 0.000248643
+-0.0631435 0.175042 -0.061564
+-0.0251041 0.0945178 -0.0276305
+0.018776 0.122594 -0.0061273
+0.0173125 0.0726566 0.0514253
+-0.0377229 0.0724783 -0.0174913
+0.0173872 0.0432828 -0.0228623
+0.0416262 0.0912615 0.0286616
+-0.050567 0.0474222 -0.00850865
+-0.0150865 0.162585 -0.00969001
+0.0143357 0.0566765 -0.0290221
+-0.0309078 0.065095 -0.0224325
+0.045522 0.0805737 0.00219452
+-0.0725374 0.138625 0.0483183
+-0.0476365 0.150675 0.00992423
+-0.0799103 0.125126 -0.00560703
+-0.051025 0.159915 -0.00453945
+0.00139766 0.0419298 -0.0244976
+-0.0664219 0.0352675 0.015055
+-0.00832508 0.130422 0.0138058
+-0.00366678 0.0481589 -0.0301707
+-0.0738566 0.161044 -0.0339379
+0.0319703 0.0475137 0.0318758
+0.0188215 0.126955 0.00377584
+-0.0309617 0.044825 -0.0281993
+0.0456484 0.0875951 0.00518134
+-0.0521074 0.0583062 0.0285239
+-0.0171825 0.0382402 0.011747
+-0.0692976 0.0615474 0.00912978
+-0.0232044 0.175652 -0.0207635
+-0.0406662 0.0592305 -0.0118049
+0.0572429 0.0508905 0.0121849
+-0.0488285 0.0416917 0.0446681
+0.0455301 0.0677752 0.0254231
+-0.0846369 0.110251 0.00429821
+-0.0754652 0.163196 -0.0162299
+-0.0247271 0.0564997 0.0408849
+-0.0639975 0.0601011 0.00610183
+-0.0741599 0.155538 0.00126713
+-0.0728899 0.122329 -0.00823917
+0.010861 0.0360066 0.0447493
+0.0150176 0.0355797 0.04239
+-0.0437155 0.0710509 -0.0175901
+0.0271589 0.093209 -0.0206672
+-0.00592646 0.12418 0.0336126
+-0.0810295 0.0895599 -0.00769505
+-0.0920663 0.121362 0.00826874
+-0.0862277 0.0832671 0.00749085
+-0.085371 0.127983 -0.0026626
+-0.081815 0.108922 0.02836
+-0.0491537 0.135503 0.0034228
+0.00885847 0.0887054 -0.0320419
+-0.0673146 0.0446682 0.00602001
+0.0152697 0.128852 0.0195703
+0.0231834 0.0422122 0.040252
+-0.0286261 0.0463451 -0.0269667
+0.0449154 0.0763231 0.00019353
+-0.0387296 0.0739178 -0.0177449
+0.0212191 0.0819428 -0.0266321
+-0.00126307 0.039726 0.0470556
+-0.0261021 0.0379463 0.0228342
+-0.0448562 0.101383 -0.0214692
+-0.0014827 0.0390261 -0.00225591
+-0.0648948 0.103911 -0.0165942
+-0.0624902 0.155293 -0.0145941
+0.000436968 0.130385 0.0227651
+-0.0219738 0.059501 0.0451263
+-0.0502789 0.129408 -0.00267456
+-0.0216757 0.065257 0.0474751
+-0.0621482 0.16155 -0.0395978
+0.0427418 0.0916392 0.0261768
+0.00967962 0.127274 0.0289934
+-0.0728707 0.168003 -0.0450202
+-0.0305611 0.179398 -0.00755573
+0.0341402 0.0902832 0.0407178
+-0.0491119 0.0361611 0.0459929
+0.0392087 0.0739776 0.0338431
+-0.0897017 0.151503 0.0171224
+0.0407967 0.105643 0.0101649
+-0.023633 0.0478399 -0.0272396
+-0.0504958 0.0862332 0.0455716
+-0.0451092 0.153606 0.00834539
+-0.0616087 0.146812 0.0373554
+0.0280342 0.0346822 0.009507
+0.0565861 0.0685555 0.00335277
+-0.027568 0.0674298 0.0392602
+-0.0926576 0.117463 0.0373027
+-0.0334278 0.124984 0.0208436
+-0.0602518 0.034678 0.0430709
+-0.0574989 0.107052 0.0398301
+-0.091226 0.128161 0.00727002
+0.0400022 0.0913669 0.0315547
+-0.0656743 0.138242 0.0419702
+-0.0852141 0.0805923 0.0204766
+-0.0444957 0.111173 0.0370595
+-0.044489 0.0803636 0.042222
+-0.00648998 0.122405 0.0354776
+0.00602348 0.111527 -0.0200414
+-0.0860119 0.132159 0.00027761
+0.0521231 0.0734583 0.0172399
+-0.0155403 0.0446621 0.0510487
+-0.0397503 0.0768521 -0.0186787
+-0.0682155 0.0787029 0.0404793
+-0.0813927 0.0758934 0.0225084
+-0.010188 0.0386565 4.14997e-05
+-0.00149609 0.0912323 -0.0347548
+-0.0294974 0.111128 0.0367729
+-0.0503924 0.0501648 0.0186468
+-0.0104698 0.070299 0.0557764
+0.0327323 0.0809002 0.0421262
+-0.0328911 0.122131 -0.00712262
+-0.0861948 0.1005 0.0258994
+-0.0319282 0.178722 -0.00808101
+-0.050675 0.140101 0.0024044
+-0.0346788 0.0636729 -0.0139354
+-0.00820144 0.0344928 -0.0181278
+-0.0830162 0.0939316 0.0314035
+0.0438286 0.0611702 -0.00330591
+-0.0162799 0.127645 0.0211086
+-0.0615233 0.0354132 0.043881
+-0.0755937 0.0809959 -0.0116148
+-0.0632393 0.166259 -0.0385929
+-0.0156738 0.0511142 -0.0317767
+0.000751147 0.0339678 -0.0215355
+-0.0534027 0.0336932 0.022744
+0.0102837 0.0348658 -0.0091814
+-0.0285082 0.0874866 -0.0336017
+-0.0849712 0.111906 0.0292041
+-0.0732162 0.169408 -0.0460252
+-0.00746424 0.110009 0.0430329
+-0.0587154 0.0723411 -0.016523
+-0.00333145 0.0968513 -0.0305901
+0.0385608 0.0713011 0.0346329
+-0.0463734 0.133247 0.0130756
+-0.0474986 0.104275 0.0408376
+-0.0714849 0.147284 -0.0260827
+-0.0404433 0.0461446 -0.0193164
+0.000709469 0.125628 -0.00726116
+0.028516 0.117882 -0.00302906
+-0.00249354 0.0746702 0.0587588
+0.0463101 0.0806468 0.00818141
+-0.0245515 0.114015 0.0358596
+-0.0396488 0.0563195 -0.0111963
+-0.0236961 0.0607746 0.0425604
+-0.0336359 0.0548461 -0.0105101
+-0.0585033 0.0337545 0.0163089
+0.0212208 0.126407 0.0160623
+-0.0729862 0.15207 0.0354642
+-0.085378 0.128494 0.0496125
+0.00429457 0.122356 -0.0118056
+0.0203517 0.0672611 0.0487139
+-0.0452845 0.0395903 -0.0182935
+-0.0211124 0.182965 -0.0210132
+-0.0295465 0.0819132 0.0441437
+-0.0777488 0.07493 0.029356
+0.00824435 0.0966482 -0.0263491
+-0.0588066 0.0854157 -0.0208208
+-0.0718999 0.113582 -0.00821597
+-0.0893735 0.0901981 0.0104595
+0.032603 0.0835706 0.0419526
+-0.0230608 0.0594124 0.0433799
+0.0284544 0.121423 0.0116324
+-0.0832785 0.12444 0.0504652
+-0.0396241 0.0520021 -0.0108773
+0.00721225 0.0837864 -0.0330068
+-0.046713 0.131987 0.00556897
+-0.0663702 0.157999 -0.00906779
+-0.067736 0.0779793 -0.0166569
+-0.0508692 0.102779 -0.0209206
+-0.0828958 0.151378 0.00422572
+-0.0346622 0.118788 -0.0116368
+-0.0726425 0.0716156 -0.00744076
+-0.059725 0.0469427 0.0326718
+-0.0468444 0.033579 -0.0045851
+-0.0384976 0.100064 0.0415702
+-0.050989 0.121022 -0.0119137
+-0.0624226 0.152205 -0.0125757
+-0.085741 0.151793 0.0266482
+-0.0826468 0.144713 0.0407672
+-0.0685649 0.0705046 -0.00966184
+-0.0734033 0.167233 -0.0217479
+-0.0455099 0.155064 0.0077969
+0.022652 0.0862116 0.0486888
+0.043364 0.0547822 -0.00644446
+-0.054457 0.14621 0.0274041
+-0.0639777 0.155958 0.0237716
+-0.0882347 0.0861347 0.011472
+0.00545294 0.1216 -0.0129959
+-0.0334673 0.174268 -0.00177832
+-0.00402179 0.129762 0.0240423
+-0.0185051 0.0711438 0.0540217
+-0.0872329 0.150111 0.00920897
+-0.090033 0.147105 0.0269347
+-0.0141936 0.0419832 0.0511586
+-0.0335873 0.154463 -0.00838872
+0.0441357 0.083266 -0.000805736
+-0.0528842 0.102762 -0.0205636
+-0.0125091 0.0815143 0.0575917
+0.0197435 0.125962 0.0226458
+-0.067993 0.0619274 0.01978
+-0.0216083 0.039391 -0.0287125
+-0.0767116 0.165247 -0.022942
+-0.0861936 0.111308 0.0401352
+-0.0238165 0.0854111 -0.0376407
+-0.0442161 0.123225 0.0243959
+-0.0175443 0.0460366 0.0510389
+-0.0272334 0.0902723 -0.0326005
+-0.0459359 0.168402 -0.00594095
+0.0355423 0.0512597 0.0315836
+0.0451079 0.0636949 -0.00183531
+-0.0368834 0.125578 -0.00482073
+0.0196258 0.0457587 -0.0217227
+-0.00773224 0.109619 -0.0221011
+-0.0514957 0.0876341 0.0455102
+-0.00269376 0.0613003 -0.0344696
+-0.0512049 0.147808 0.0143958
+0.0266901 0.106496 -0.0148024
+0.0383861 0.0476151 -0.00591592
+-0.0136895 0.0952904 -0.0330103
+0.0368491 0.0767795 0.0374896
+-0.029592 0.0522946 -0.0203629
+0.0482309 0.0500295 -0.00369862
+0.0381363 0.0794306 0.0358549
+-0.0677271 0.155796 -0.00229118
+0.026043 0.0392404 0.0305576
+0.0208388 0.126564 0.0173475
+0.0159735 0.0448127 0.0438765
+-0.0681757 0.118633 0.0523539
+-0.065068 0.136793 0.0410949
+-0.0454458 0.168254 0.00168996
+-0.0715222 0.142818 0.0455702
+-0.0604912 0.112522 0.03629
+-0.00074702 0.0712329 -0.0350931
+-0.0894331 0.150114 0.0121902
+-0.0185746 0.0381525 0.0151621
+0.0291213 0.0348096 0.00960912
+0.0404448 0.0985503 0.0271661
+0.0134712 0.0936014 0.0511282
+-0.021496 0.103017 0.0435858
+0.00918856 0.0342345 -0.00132638
+-0.0508332 0.0956285 -0.0221275
+-0.0613646 0.0394268 0.0439671
+0.0264379 0.0968548 0.0436578
+-0.0646669 0.0405364 0.0387423
+0.0125029 0.0475354 0.045933
+0.0412949 0.104257 0.00416372
+-0.00222052 0.117102 -0.0161156
+-0.00995662 0.169734 -0.0198047
+0.0200755 0.0399795 -0.0157069
+-0.0839165 0.110514 0.0395089
+-0.0546435 0.116042 -0.0146857
+0.0268767 0.0854059 -0.022529
+-0.0543926 0.0337363 0.0224962
+-0.049781 0.0841032 -0.0216622
+0.0431463 0.100109 0.00616795
+0.0393814 0.0780345 0.0341058
+-0.0162612 0.17862 -0.0260128
+-0.0335093 0.0676035 0.0406399
+-0.0176483 0.0352702 -0.0188352
+-0.031463 0.0519033 0.0373773
+-0.0803572 0.0803552 0.0319871
+-0.0320868 0.159267 -0.0129293
+0.0132853 0.0589897 0.0507165
+-0.0103631 0.180289 -0.0277342
+-0.0144925 0.0559441 0.0511232
+-0.0246444 0.0381166 0.0247786
+0.0170669 0.0871276 -0.028336
+0.00372554 0.105196 -0.0213905
+-0.0777857 0.156925 -0.0179137
+0.0578227 0.0710073 0.0178627
+-0.0582482 0.0336534 0.0128901
+-0.0520861 0.0545712 0.0266312
+0.0269849 0.113053 -0.00983991
+0.0429421 0.0467386 0.030224
+0.00548112 0.11414 0.0405028
+0.0607975 0.0637336 0.0101416
+-0.0895137 0.135181 0.0391853
+-0.0822803 0.139383 0.0462108
+0.00350363 0.0883757 0.0563643
+-0.0599112 0.109712 -0.0163845
+-0.0699244 0.107994 -0.0118147
+-0.073438 0.145781 -0.0138542
+-0.0702694 0.156361 0.0186365
+0.0365208 0.0713424 0.036933
+-0.0764811 0.141399 0.0471717
+-0.0338378 0.0943788 -0.02372
+-0.0185768 0.055451 0.0489119
+-0.0294962 0.107041 0.0398129
+0.0351663 0.0783387 -0.0157415
+-0.0823976 0.095314 0.0321564
+0.0458052 0.08902 0.00916777
+0.00466954 0.0341296 0.0180802
+0.012258 0.0751733 -0.0308354
+-0.0176564 0.0480544 -0.0295902
+-0.0487658 0.0811872 -0.020682
+-0.0375125 0.045091 0.0407522
+0.00960807 0.0375632 0.0322947
+0.0522688 0.0462249 0.00921199
+-0.0452834 0.0395877 -0.019291
+-0.0396931 0.126183 0.0200311
+-0.0903381 0.144712 0.0141544
+-0.0430213 0.0450576 -0.0153284
+-0.0539191 0.129665 -0.00510771
+-0.0384876 0.108386 0.0375357
+-0.0496388 0.0605583 -0.0113235
+-0.034501 0.115223 0.0328885
+-0.0540284 0.131061 -0.00500164
+-0.0147028 0.0389017 0.0333119
+-0.0207376 0.0641563 -0.0358205
+0.00590682 0.131658 0.0132863
+-0.0819436 0.154696 0.0145801
+0.0526661 0.0660937 -0.000184776
+-0.0526201 0.14007 0.0244025
+-0.0752504 0.177839 -0.0529463
+-0.0574955 0.0946379 0.0447737
+0.0456129 0.0904097 0.00518194
+-0.0282629 0.122524 0.022734
+-0.0680338 0.142566 0.0438693
+-0.0643033 0.0426016 0.0312522
+-0.0314971 0.102929 0.041974
+-0.00589664 0.0980966 0.0519993
+-0.0542782 0.132533 0.0338047
+-0.0911122 0.11473 0.0343167
+-0.0493972 0.140141 0.00739907
+-0.0577664 0.0485104 0.00767417
+-0.0629684 0.139576 0.0370615
+-0.0122087 0.128137 0.0240139
+0.00116984 0.129366 -0.00128907
+-0.039496 0.0634667 0.0415276
+-0.0427066 0.0696149 -0.0170299
+-0.0721201 0.149786 -0.0402916
+-0.0637423 0.168365 -0.0426884
+-0.0228169 0.0383283 0.0285633
+-0.0894925 0.143336 0.0131803
+-0.0408822 0.128708 0.0107294
+-0.043783 0.147719 0.00491206
+0.00912223 0.0833108 0.0554277
+-0.0543042 0.0335497 0.00301212
+-0.0544171 0.0333785 -0.00775516
+0.0295237 0.0727272 0.042682
+-0.0504982 0.112495 0.0358796
+-0.0240218 0.119915 -0.0108978
+-0.0535232 0.0556038 0.0117195
+-0.0480175 0.133707 0.00490199
+0.00583381 0.129313 0.0261699
+-0.0405566 0.149165 -0.00293165
+-0.0286765 0.0690744 -0.0314836
+0.0453693 0.0693828 0.00245115
+0.0581659 0.056561 0.00517446
+0.0192888 0.0651078 -0.0282476
+-0.0228892 0.0739252 0.0512281
+-0.0217183 0.113234 -0.017904
+0.0365187 0.0526805 0.0315096
+0.0490482 0.0539975 0.0303486
+0.0175085 0.114012 0.0373101
+-0.0328107 0.126843 0.0122027
+-0.0687814 0.0336983 0.00353162
+0.0220892 0.0906332 -0.0239505
+-0.0460528 0.122513 0.026245
+0.0381409 0.109688 0.00657231
+0.0368421 0.0742334 -0.0127504
+-0.0657975 0.0340784 0.0127357
+-0.0706216 0.146831 -0.0255714
+-0.0468292 0.091298 -0.0217206
+-0.0914681 0.144718 0.0171554
+-0.0624908 0.0343254 0.0238098
+0.0543739 0.0477987 0.0161989
+-0.0195403 0.1757 -0.0161256
+0.0224671 0.0343921 0.00678503
+-0.0654707 0.155271 0.00728456
+-0.0897135 0.12265 0.00431103
+-0.0501651 0.0361307 0.0461721
+-0.0901888 0.139114 0.0151891
+-0.0726107 0.156829 -0.0349095
+-0.0334964 0.0718545 0.0411869
+0.0106165 0.0644536 0.0539383
+0.0274263 0.0491525 0.0376576
+-0.0157908 0.169796 -0.0160148
+-0.0608326 0.17151 -0.0610901
+0.0136156 0.126814 -0.00267762
+0.0293325 0.0535401 0.0386956
+-0.0652579 0.153012 -0.0402459
+0.0264019 0.036087 0.0225582
+0.0101281 0.105858 -0.0202342
+-0.0674046 0.0833115 0.0429955
+-0.0312435 0.0538841 -0.0143722
+0.0424267 0.0441756 -0.00158684
+-0.0305089 0.0760274 0.0408429
+-0.0849899 0.127963 -0.0030064
+-0.0223249 0.0386602 -0.0135496
+0.0216012 0.112963 -0.0137495
+-0.0224297 0.0552774 0.0442986
+-0.093152 0.121537 0.0362834
+-0.0384463 0.166779 0.00239389
+0.0317419 0.0667553 -0.0187125
+-0.0127135 0.100022 -0.0239701
+0.0204112 0.0371925 -0.00568428
+0.0383001 0.0969495 -0.00880451
+-0.0500528 0.150184 -0.0037815
+-0.0578783 0.106898 -0.0179862
+0.0485378 0.0682762 0.00156381
+-0.0708965 0.0341323 0.00629169
+-0.0871174 0.110466 0.0103621
+-0.0235739 0.0944939 0.0470656
+-0.0164815 0.0515035 0.0485835
+0.0325428 0.0380502 1.57112e-05
+0.0385774 0.0888011 0.0348199
+-0.0628692 0.0445185 0.0382675
+-0.0572856 0.125533 0.0399888
+-0.0780066 0.0940671 0.0362827
+-0.0361012 0.160724 -0.0132118
+0.0200495 0.124902 -0.000599563
+0.0101263 0.107276 -0.0197522
+0.0224877 0.0961643 0.0466342
+-0.077715 0.0852782 -0.0115916
+-0.0164955 0.105778 0.0423459
+-0.0725318 0.101313 0.038599
+-0.0663565 0.0783826 0.0411592
+-0.0644378 0.17995 -0.0588828
+-0.0645973 0.171184 -0.0458828
+0.0111199 0.129735 0.0223368
+-0.018333 0.172741 -0.0161594
+-0.0864925 0.10492 0.00639597
+-0.0144943 0.0500942 0.0487331
+-0.0855601 0.095177 0.0282718
+1.67787e-05 0.0386604 0.0239291
+0.0109499 0.0344084 0.00259617
+-0.0270041 0.168274 -0.00938266
+-0.0378811 0.107099 -0.0200653
+0.060304 0.0664655 0.0101406
+-0.0478845 0.108472 -0.0188663
+0.0181085 0.0591163 0.0489014
+-0.0260899 0.0522789 0.0395517
+0.0049437 0.0984176 -0.0242128
+-0.0623314 0.0357831 0.0433788
+0.0110403 0.0725847 0.0546235
+-0.0864956 0.084691 0.0204775
+-0.00849993 0.0787667 0.0579153
+-0.0260008 0.0382709 0.000860974
+-0.06937 0.145758 -0.0234859
+-0.0314168 0.117929 -0.0127586
+-0.0261669 0.0378674 0.0174813
+-0.0832309 0.120353 0.049216
+-0.0617814 0.16156 -0.0355923
+-0.0779669 0.165862 -0.0278956
+-0.0698398 0.0922797 -0.0162924
+0.0483255 0.0503286 -0.00380134
+0.0451716 0.0889782 0.0181643
+0.0329815 0.112282 -0.00498623
+0.0279206 0.0916217 -0.0209795
+0.0155 0.11402 0.0377783
+-0.0105379 0.0431327 0.0497176
+0.0606167 0.0609422 0.00915424
+-0.0181983 0.18599 -0.0174024
+0.0189716 0.115037 -0.0139804
+-0.0590849 0.0644137 0.0318252
+-0.0819254 0.12582 0.0519232
+-0.0588398 0.0954803 -0.0203334
+-0.0674426 0.148384 -0.0326115
+0.0387628 0.10462 0.0262683
+0.00841723 0.129272 0.0256623
+-0.0196119 0.0364667 -0.0278852
+-0.0376923 0.162356 -0.000243841
+1.88808e-05 0.115368 -0.0182789
+0.0393962 0.0505525 -0.00668347
+-0.0116788 0.0555838 -0.0339192
+0.0363865 0.0713868 -0.0138007
+-0.0821651 0.110069 0.034903
+0.022728 0.117081 -0.0101857
+-0.0515389 0.0417461 -0.0105815
+0.0219588 0.123501 -0.00109075
+0.00735928 0.0960033 -0.0276522
+-0.00349428 0.119696 0.0379021
+-0.0470844 0.151656 -0.00519447
+-0.0242296 0.0941248 -0.0298734
+0.0152433 0.0658912 0.0518711
+-0.021804 0.0376594 -0.0181241
+-0.0133966 0.121962 -0.00916065
+0.0365536 0.108655 0.0265769
+-0.0668098 0.0880715 -0.0180091
+-0.0665181 0.171112 -0.0407548
+0.0493343 0.0532247 -0.0043679
+0.0423933 0.0901635 -0.00682346
+-0.0624126 0.150651 -0.0115734
+0.0373944 0.0505276 -0.00658166
+-0.0411461 0.162173 -0.0113613
+-0.065916 0.0662086 0.0305519
+-0.0289729 0.083488 0.0456837
+-0.000642523 0.0347913 0.0398677
+-0.0738147 0.065744 0.00631032
+0.00351431 0.0938625 0.0544725
+-0.0467733 0.12389 0.0269319
+0.0246632 0.123785 0.00595837
+-0.0715256 0.0958228 0.0413941
+0.00252922 0.0362636 0.0463395
+0.00948792 0.0963424 0.0500581
+0.0292035 0.0400739 0.0286474
+-0.0309481 0.0706991 -0.0284733
+-0.054091 0.152763 0.0215579
+0.0118527 0.105542 -0.0197545
+-0.0404793 0.0832528 0.0431634
+-0.0448438 0.0985036 -0.0215544
+-0.032014 0.0567822 -0.0123897
+0.00040853 0.0356817 0.00488121
+0.0447245 0.0861403 0.0231669
+-0.0426307 0.0338188 -0.00946517
+-0.0710495 0.141325 -0.00813095
+-0.0255896 0.182763 -0.0105092
+-0.0838169 0.107636 0.0253505
+-0.0796245 0.0859561 0.0353266
+0.0240034 0.0449703 0.0396985
+0.00450108 0.0716864 0.0560951
+-0.0676894 0.0750921 -0.0153176
+-0.0466572 0.0369109 -0.0172699
+-0.016529 0.0558872 0.0508401
+-0.087831 0.103641 0.0093887
+0.0272256 0.10745 0.0377741
+-0.0670064 0.0337953 0.0073865
+-0.0866888 0.0833263 0.0124872
+0.0152687 0.0779357 -0.0299953
+-0.0851819 0.152725 0.0105454
+0.000352424 0.0511166 -0.0306262
+0.0518495 0.0464359 0.0201911
+0.0554005 0.0553511 0.0254886
+-0.0886141 0.0928486 0.00844707
+0.0129712 0.130228 0.0115965
+-0.085549 0.104961 0.0233427
+0.0515991 0.0496316 0.0251833
+0.0131946 0.0878791 -0.0305989
+-0.0693376 0.131255 0.0489674
+-0.0660205 0.167997 -0.0305503
+-0.0666146 0.174697 -0.0480375
+-0.0293346 0.0347045 0.0427947
+-0.0553259 0.126836 -0.00601308
+-0.058583 0.0460291 0.0113967
+-0.0416277 0.0337441 -0.014735
+-0.0446642 0.0621749 -0.0132201
+0.0295862 0.120365 0.0134787
+-0.0697163 0.064282 0.022673
+-0.0805487 0.0789662 0.0306236
+-0.0787564 0.154933 0.00983696
+-0.0662707 0.14708 -0.0258685
+-0.0248167 0.0949702 -0.0267501
+-0.0407693 0.0826515 -0.0208197
+0.000514101 0.0346343 0.00952105
+-0.0533361 0.138123 0.0280776
+-0.0689277 0.115103 -0.00892086
+-0.0865224 0.0913375 0.0024428
+0.0232602 0.0790529 -0.0256674
+0.0296786 0.0679688 -0.0198342
+-0.0331127 0.123309 0.0239558
+0.0276403 0.118218 0.0284429
+0.00238303 0.0449286 -0.0261957
+-0.0928278 0.124236 0.0382657
+-0.0868685 0.11045 0.00936714
+-0.0254875 0.0959781 0.0438332
+0.0132252 0.0808221 -0.0308314
+0.035265 0.0591791 0.0368077
+-0.00944135 0.168135 -0.0197365
+0.0011864 0.12951 0.0259323
+-0.0139593 0.0967237 -0.0305143
+-0.00848922 0.0385737 0.0258802
+0.0562981 0.0619429 0.0011209
+0.0322546 0.0987343 -0.0145759
+-0.0268707 0.103016 -0.0234914
+-0.00655639 0.0384205 0.0209905
+-0.0296666 0.0774462 0.0418826
+-0.0626586 0.0676213 -0.0103966
+0.0374569 0.0904362 -0.0137042
+-0.0712181 0.161 -0.0439365
+0.0243668 0.0889213 0.0476805
+-0.0336134 0.0408899 -0.0298935
+-0.0404969 0.0916505 0.0425962
+0.0443454 0.0903358 0.0221636
+-0.0435232 0.163746 0.00524284
+-0.0649943 0.0623954 0.0235277
+-0.0613093 0.0593276 0.0181457
+-0.0717978 0.155398 -0.0409076
+-0.00868753 0.0584178 -0.0339256
+-0.0904383 0.119966 0.00529664
+-0.0601615 0.0333995 -0.00165181
+-0.0612252 0.0407891 0.0437895
+-0.0537348 0.0738508 -0.0172852
+-0.0709057 0.10512 -0.0125462
+-0.00333997 0.039253 0.0353398
+-0.0469903 0.145002 0.00194161
+-0.0250386 0.0659034 -0.0335362
+-0.023273 0.0382876 0.00502865
+0.0111228 0.0960826 -0.0257288
+0.0198113 0.0954368 -0.0230239
+0.038476 0.104075 -0.00282883
+-0.0843581 0.0883713 0.0286614
+-0.0930341 0.118841 0.0362969
+-0.0646767 0.146003 -0.0179612
+0.0284626 0.102127 0.0395666
+-0.0435018 0.113907 0.034675
+-0.0604863 0.0790224 0.042794
+-0.089042 0.112536 0.0205154
+-0.0524675 0.0344946 0.0345461
+-0.0848716 0.119101 -0.00207765
+-0.0120923 0.11442 -0.0172013
+-0.079929 0.151371 0.00121035
+-0.0920085 0.116136 0.0393096
+0.0361533 0.112569 0.0130564
+-0.0196629 0.125034 -0.00230889
+0.000499429 0.115573 0.0406664
+-0.0560183 0.147198 -0.00168648
+-0.0873616 0.110481 0.0113565
+-0.0416844 0.0636674 -0.0137203
+-0.0651889 0.153592 -0.00278678
+0.0471599 0.07398 0.0153485
+0.0404106 0.0873775 0.0321991
+-0.019434 0.184905 -0.0153275
+-0.0438294 0.0913555 -0.0224139
+-0.0527613 0.0797578 -0.020501
+-0.0314155 0.0651435 -0.021432
+0.00948509 0.0950229 0.0512669
+0.0346346 0.107297 -0.007625
+-0.0870053 0.0954387 0.00242783
+-0.0617312 0.142927 -0.00565867
+-0.0538929 0.14622 0.0244012
+0.0339044 0.115273 0.00366751
+0.049575 0.0693171 0.00251779
+-0.0861009 0.106274 0.00635995
+-0.00751182 0.075985 0.0578234
+-0.0761849 0.0933719 -0.0135017
+0.0266626 0.0672707 0.0437593
+-0.0314925 0.0932138 0.0444288
+0.0112937 0.0680868 -0.0307505
+-0.086045 0.141863 0.00720055
+0.000490707 0.111422 0.0424934
+-0.0516022 0.0502173 -0.00741774
+-0.0709386 0.131124 -0.00852217
+-0.0291841 0.125368 0.0164845
+-0.0012258 0.095852 -0.0315171
+-0.000697567 0.0641196 -0.0342689
+-0.0797379 0.0738711 0.0228323
+-0.0705682 0.0382102 0.00943236
+-0.0558807 0.102663 -0.0193944
+0.0262875 0.0835737 0.0468767
+-0.0206175 0.0364922 -0.0281092
+0.0306136 0.0779431 -0.0207534
+0.037492 0.0983062 -0.0097724
+-0.0861064 0.0806138 0.0174966
+-0.0488748 0.105594 -0.0196597
+-0.0499497 0.0724883 0.0409516
+-0.060435 0.131107 0.0389542
+-0.0197383 0.108898 -0.0213322
+-0.0328414 0.0943934 -0.0238538
+0.0071329 0.104451 -0.0211019
+-0.0904392 0.125398 0.00528343
+0.0579573 0.0676391 0.00414749
+-0.0890486 0.0915916 0.0214249
+0.0544885 0.0716156 0.00618127
+0.037936 0.0901639 0.0356574
+-0.0631289 0.155254 0.0269868
+0.0280038 0.120349 0.024295
+0.00325461 0.0697315 -0.0336623
+0.0198002 0.0768324 0.0515324
+0.0135718 0.0504901 0.0475195
+-0.0220331 0.041681 0.0538782
+-0.0322365 0.126297 0.00653811
+-0.020497 0.0855906 0.0563403
+0.0100844 0.123139 0.0340691
+-0.0917617 0.141982 0.0191718
+-0.00665267 0.0526646 -0.0325345
+0.0325469 0.0922927 -0.0176842
+-0.00490321 0.0383839 0.0141185
+0.0393963 0.049102 -0.00636122
+-0.0468295 0.0927337 -0.0216687
+0.0393484 0.0561243 -0.00568756
+0.0381042 0.0392738 0.00134927
+-0.02061 0.0653432 0.0492306
+-0.0644858 0.152894 -0.00250698
+0.0316363 0.118365 0.0113851
+-0.0625842 0.162383 -0.0563311
+-0.0126137 0.180121 -0.0236267
+-0.0562637 0.142432 0.0309288
+0.0389203 0.10838 0.0161659
+0.0468209 0.0708789 0.021127
+0.0153317 0.060873 -0.028643
+-0.067208 0.0447917 0.00368814
+-0.0638714 0.15469 -0.0385902
+-0.0624126 0.161536 -0.0416011
+-0.011049 0.124435 -0.00785173
+0.0143712 0.0493733 -0.0267066
+-0.0374862 0.0931566 0.0438456
+-0.0278525 0.0807805 0.0474761
+0.0573848 0.0670309 0.00292365
+-0.0304938 0.0960556 0.0449536
+0.0182602 0.127523 0.0192457
+0.0182204 0.080645 -0.0282763
+-0.00275795 0.0740872 -0.0359501
+-0.072697 0.155649 0.00759319
+-0.0857527 0.0792184 0.0135098
+-0.0604443 0.0456013 0.0296807
+-0.0528198 0.0927332 -0.0219739
+-0.0457202 0.0709417 -0.0164642
+-0.054497 0.0889964 0.0448823
+-0.0541353 0.147754 0.0254132
+0.05074 0.0503045 -0.00171178
+-0.0926993 0.124215 0.0352716
+0.00850767 0.0786 0.0556334
+-0.0141847 0.0405865 0.0511605
+-0.0500491 0.0345412 0.0367666
+-0.0744234 0.156022 0.0128056
+-0.0148381 0.0386367 -0.0157684
+-0.0896535 0.0916031 0.0184402
+-0.0279306 0.125506 0.00666413
+-0.0249827 0.0918474 0.0485489
+-0.0247746 0.0385687 -0.0102357
+-0.0718755 0.10648 -0.0114758
+0.0303733 0.115414 -0.00438737
+0.0390771 0.099844 -0.00681802
+-0.0601235 0.0447437 0.0425684
+0.0559507 0.0508031 0.00520531
+-0.087948 0.102288 0.00840013
+-0.0802939 0.0732789 0.00250413
+-0.00347452 0.114725 -0.0175669
+-0.0780015 0.155773 0.018849
+-0.0868392 0.0873072 0.00147849
+0.0114304 0.0346172 0.0371012
+-0.0154945 0.0925097 0.0555061
+0.0207547 0.10431 -0.0184628
+-0.0805113 0.153427 0.0283513
+-0.0133702 0.0343611 -0.0190243
+0.045363 0.0932019 0.00717004
+-0.0517619 0.079747 -0.0203928
+-0.011137 0.171308 -0.0197957
+-0.0797359 0.0706327 0.0105539
+-0.0435047 0.116629 0.0323741
+0.0461192 0.0786876 0.0190773
+0.0257679 0.0349257 0.0180133
+-0.0377436 0.127354 0.000111554
+0.0455391 0.0875946 0.0141649
+-0.0115776 0.0962625 -0.032007
+-0.0304054 0.0580102 -0.0194062
+-0.0519213 0.118323 0.0336042
+-0.0615165 0.15114 0.0355512
+-0.0268549 0.175688 -0.00910606
+0.0291872 0.0462618 0.034893
+-0.0828817 0.143196 0.00216401
+-0.0229243 0.0972075 0.044901
+-0.0420606 0.0344689 0.0332688
+0.00840712 0.0404044 -0.0234014
+-0.0584986 0.100161 0.0428821
+0.0267286 0.0521731 -0.0207566
+-0.0343564 0.043282 -0.028737
+0.035312 0.0840703 -0.0177861
+0.0167493 0.0874098 0.0506847
+-0.0706375 0.156126 0.0126907
+0.0395317 0.0596774 0.0306966
+0.0160357 0.0807986 0.0531419
+-0.0719071 0.105086 -0.0120336
+0.057752 0.0523416 0.0181873
+-0.0705862 0.166615 -0.0490027
+-0.069998 0.157611 -0.0031485
+-0.0629727 0.118457 0.044154
+-0.0098895 0.107351 -0.0224128
+-0.0668287 0.169972 -0.0351376
+-0.0538607 0.152062 0.0231076
+0.0286155 0.0795328 0.044942
+0.00747725 0.131195 0.0181386
+0.0525355 0.0678367 0.0261828
+-0.069983 0.033931 0.00665746
+-0.00449526 0.10588 0.044033
+-0.0647467 0.143415 -0.011401
+-0.0242451 0.0337053 -0.0224295
+0.0405945 0.102819 0.0221712
+-0.0253936 0.106122 -0.0223873
+-0.031866 0.126076 0.00521848
+-0.0903832 0.132413 0.0312232
+0.0270423 0.0648893 -0.0216756
+-0.0416036 0.125525 0.0208631
+-0.0642885 0.148287 -0.0250747
+0.043249 0.0705728 -0.00179391
+0.00750831 0.0772509 0.056126
+-0.0360471 0.125746 -0.0036679
+-0.0534999 0.0820142 0.0450601
+-0.0268076 0.0782799 -0.0366273
+-0.0630392 0.0336157 0.00836468
+0.00450283 0.0924607 0.0546761
+-0.0794816 0.0846149 0.0352279
+-0.0354976 0.116636 0.0319301
+0.0590094 0.0552651 0.0101755
+0.0177618 0.100614 -0.0224544
+0.0141872 0.0347155 0.0357788
+-0.0626395 0.0644043 -0.00619313
+-0.0472223 0.168222 -0.000777409
+-0.0688709 0.156258 0.0147705
+-0.00209707 0.130745 0.0203917
+0.0438165 0.0959355 0.0191615
+0.0272253 0.120021 -0.000250724
+-0.0623918 0.152158 -0.026581
+-0.0619803 0.153737 -0.02558
+-0.0110119 0.122536 -0.00980812
+-0.00845767 0.100229 0.0476033
+-0.053626 0.1255 0.0365054
+0.029243 0.0872327 -0.0208644
+-0.0561028 0.133503 -0.00512832
+-0.0536146 0.150855 0.0243962
+-0.0729449 0.0805494 0.0386997
+-0.0113093 0.0384672 0.00547553
+0.013929 0.0392001 0.0444158
+-0.0743245 0.179234 -0.0539852
+-0.0670834 0.168031 -0.0569976
+0.0269196 0.0418157 0.0333163
+-0.0261604 0.114813 -0.0155316
+0.054979 0.06227 -0.000302264
+0.0447631 0.0931576 0.00318223
+-0.028552 0.159576 0.000695282
+-0.0196334 0.0906851 0.0545345
+-0.0681661 0.173216 -0.0428508
+-0.0670035 0.166617 -0.0570134
+-0.00170857 0.0641356 -0.0344906
+-0.0302923 0.115032 -0.0157497
+-0.017789 0.0998203 0.0439009
+0.0575984 0.0711737 0.0088801
+-0.0559485 0.119826 0.0383628
+-0.0508832 0.106998 -0.0191626
+-0.0856518 0.096702 -0.000561949
+0.0433856 0.0475038 -0.0047769
+-0.0141839 0.177168 -0.0206609
+-0.0318261 0.0623615 -0.0184459
+-0.0694684 0.158126 -0.0509379
+-0.059088 0.0445923 -0.00517311
+-0.0680469 0.0887699 0.043444
+0.0413366 0.0588699 -0.00449648
+-0.0108613 0.16611 -0.0209706
+-0.0810695 0.111472 -0.000645954
+0.0236683 0.0535376 0.0428398
+-0.0525009 0.104252 0.0406803
+0.0178265 0.128119 0.0148069
+-0.0833287 0.0817012 -0.000498118
\ No newline at end of file
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny5000.pts b/Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny5000.pts
new file mode 100644
index 000000000000..b9c0cbdc12bd
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny5000.pts
@@ -0,0 +1,35948 @@
+1500
+-0.0164722 0.0382453 0.0209318
+-0.0641407 0.171114 -0.0471776
+0.023086 0.119339 0.0317977
+0.00506037 0.0347021 0.0393176
+-0.066143 0.143958 0.0413147
+-0.0445017 0.163753 0.00542301
+-0.0689729 0.181022 -0.0546459
+-0.0931085 0.131006 0.0192314
+0.000506827 0.0489752 0.0512269
+-0.0615935 0.160001 -0.0315914
+-0.0245032 0.0960169 0.0442753
+-0.0258992 0.0891655 0.049535
+-0.000499367 0.0456802 0.0470389
+-0.0171808 0.0654583 0.0528522
+0.00116916 0.131228 0.00582139
+-0.0356565 0.122935 -0.00798984
+-0.0701892 0.156285 0.021569
+-0.0173569 0.038443 0.0259817
+-0.0716413 0.0763478 -0.0132577
+0.0528545 0.0568172 0.0288563
+-0.0325067 0.0732308 0.0407775
+-0.0760686 0.150008 -0.00987485
+-0.030561 0.0774145 0.0410957
+-0.0833901 0.0762729 0.00451303
+-0.000492618 0.0925258 0.0556594
+-0.0358778 0.159506 0.00240863
+0.0115111 0.114076 0.0384616
+-0.0877889 0.0887187 0.00347532
+-0.0261028 0.115949 -0.0147279
+-0.0682913 0.165205 -0.0539869
+-0.0225512 0.0933694 -0.0331106
+-0.0538783 0.0999149 -0.0214389
+0.0435587 0.0959151 0.0211557
+-0.0167991 0.0388632 -0.0107644
+-0.0569142 0.0548839 0.00364185
+0.00749229 0.091015 0.0542708
+-0.065316 0.0625169 -0.002419
+-0.00749647 0.119689 0.0375376
+-0.0772165 0.0934484 -0.0125951
+-0.029008 0.0478606 -0.0250513
+0.00934189 0.0553527 -0.0303034
+-0.0578677 0.104042 -0.0186102
+0.0405495 0.0999198 -0.00379356
+-0.0894314 0.137929 0.0371779
+0.00710731 0.126603 -0.00643182
+0.058913 0.070492 0.0108657
+-0.0922485 0.120133 0.0292903
+0.0395325 0.105566 0.0221621
+-0.0376065 0.0365426 0.0444186
+-0.0550158 0.128128 -0.00563226
+-0.0561672 0.0336533 0.0186553
+0.0123436 0.0351165 0.0296251
+-0.0899184 0.131005 0.0413145
+0.0065365 0.100373 0.0469448
+-0.0502879 0.133796 0.0278403
+-0.0716838 0.0351362 0.00880221
+0.0579126 0.0523842 0.0101848
+-0.0639212 0.154791 0.00385831
+-0.0654795 0.0384216 -0.00684663
+-0.0615513 0.0624603 0.0259481
+-0.0368013 0.0842007 -0.0223672
+0.0522757 0.0574291 -0.0035048
+-0.0764972 0.123179 0.0527664
+0.0302998 0.0694384 -0.019812
+-0.0334269 0.0486094 0.0413091
+-0.00450651 0.0689184 0.0565193
+0.0425976 0.0887597 -0.00680771
+-0.0707351 0.156208 0.0228366
+0.0548799 0.0492406 0.0202107
+-0.00962948 0.168316 -0.023669
+-0.0313363 0.11605 -0.0148117
+-0.0225249 0.125571 0.0012278
+0.0122871 0.124953 0.0313975
+-0.0343047 0.125361 0.0205265
+-0.038499 0.0747376 0.0420783
+0.0292349 0.0759579 -0.0220376
+-0.0255784 0.0477093 -0.0263526
+-0.0750958 0.151313 -0.0258791
+0.0057743 0.0347896 0.0375885
+-0.0926124 0.120126 0.0272917
+-0.0366664 0.175138 -0.00407486
+-0.00549337 0.088417 0.0570387
+-0.0711473 0.17507 -0.0540267
+-0.0776118 0.0739521 0.0284675
+0.0376746 0.104662 0.0282621
+-0.0634881 0.121359 0.0469409
+0.0233296 0.0564006 -0.0254415
+-0.0399361 0.123254 0.0259269
+-0.000577398 0.0341134 -0.0181551
+-0.000496894 0.0520342 0.0541515
+-0.0701023 0.177167 -0.0478719
+-0.0641167 0.143926 0.0389732
+-0.0679369 0.165269 -0.0197719
+-0.0681029 0.138305 0.0455026
+-0.00280426 0.0384802 0.0198949
+-0.0628273 0.0924874 -0.0189476
+0.0084946 0.0869435 0.0558386
+0.00910286 0.0348066 0.0183719
+-0.0195983 0.126231 0.0213862
+-0.0584949 0.143878 0.0330085
+-0.0218343 0.0553077 0.0451067
+-0.0645685 0.147457 -0.0230581
+0.0426227 0.0691122 -0.00279622
+-0.035813 0.0842739 -0.0225525
+-0.0819685 0.0791215 0.0284136
+0.0328852 0.113087 -0.00384394
+-0.0677123 0.168615 -0.0283035
+-0.0556635 0.140996 0.0299986
+-0.0764958 0.131682 0.0526442
+0.0421796 0.0832522 0.0293553
+-0.0848653 0.0855483 0.0264341
+-0.0329445 0.121338 0.0269922
+-0.0320197 0.058187 -0.0133973
+-0.0322785 0.0421631 -0.0296986
+0.0401757 0.067497 -0.00878165
+-0.0904989 0.148452 0.0245146
+-0.00947974 0.0561444 0.0530127
+-0.0310333 0.0383692 -0.000250742
+-0.0780713 0.150403 0.0367551
+-0.0872126 0.146051 0.00824907
+-0.0735722 0.148626 -0.0268487
+-0.00548676 0.116904 0.0394711
+-0.0599006 0.132533 0.037981
+-0.093479 0.129659 0.0212406
+-0.0639063 0.120904 -0.00875525
+-0.028606 0.0356961 0.0524615
+-0.0652024 0.153998 -0.041972
+-0.0262134 0.0765572 0.0473962
+-0.0774721 0.155387 0.0234212
+-0.0628707 0.0345025 0.0358026
+0.0434964 0.0555926 0.0322399
+-0.0618022 0.142496 0.0370478
+-0.0638273 0.0910291 -0.0188305
+-0.0636286 0.0672101 0.0337087
+-0.0842132 0.092522 0.0298256
+0.0185123 0.115397 0.0365584
+-0.0666269 0.131204 0.0458398
+-0.0653475 0.165775 -0.0260007
+-0.0182573 0.181629 -0.0177335
+-0.0142757 0.185348 -0.0257883
+0.0485082 0.0624718 0.0300814
+-0.0254927 0.0974122 0.0441083
+-0.0446561 0.0349999 0.0427486
+-0.0616719 0.0410515 0.0160296
+-0.0179307 0.0931593 -0.0348763
+-0.00828798 0.130102 0.00662088
+-0.0525878 0.149334 0.020403
+-0.0102534 0.128943 0.0232512
+0.0445378 0.0959706 0.0101622
+-0.0465291 0.0335268 -0.00814027
+0.00437534 0.131145 0.0198749
+-0.0394369 0.03436 0.0321562
+-0.0107155 0.127812 0.0260097
+-0.0273383 0.17123 -0.0098418
+-0.0037118 0.0655569 -0.0347446
+-0.0630689 0.150547 -0.0265942
+-0.0776846 0.16386 -0.0329461
+-0.0728796 0.151218 -0.0388899
+0.038172 0.0967289 0.0325586
+-0.058907 0.0983413 -0.0195805
+-0.00549542 0.0965711 0.0536823
+0.00650609 0.0503877 0.0517539
+-0.0847722 0.113367 0.0459387
+0.0309512 0.0822193 0.0430727
+-0.0159859 0.0984773 0.0464357
+0.0361586 0.0781359 0.0382445
+0.0417308 0.0422749 0.000248643
+-0.0631435 0.175042 -0.061564
+-0.0251041 0.0945178 -0.0276305
+0.018776 0.122594 -0.0061273
+0.0173125 0.0726566 0.0514253
+-0.0377229 0.0724783 -0.0174913
+0.0173872 0.0432828 -0.0228623
+0.0416262 0.0912615 0.0286616
+-0.050567 0.0474222 -0.00850865
+-0.0150865 0.162585 -0.00969001
+0.0143357 0.0566765 -0.0290221
+-0.0309078 0.065095 -0.0224325
+0.045522 0.0805737 0.00219452
+-0.0725374 0.138625 0.0483183
+-0.0476365 0.150675 0.00992423
+-0.0799103 0.125126 -0.00560703
+-0.051025 0.159915 -0.00453945
+0.00139766 0.0419298 -0.0244976
+-0.0664219 0.0352675 0.015055
+-0.00832508 0.130422 0.0138058
+-0.00366678 0.0481589 -0.0301707
+-0.0738566 0.161044 -0.0339379
+0.0319703 0.0475137 0.0318758
+0.0188215 0.126955 0.00377584
+-0.0309617 0.044825 -0.0281993
+0.0456484 0.0875951 0.00518134
+-0.0521074 0.0583062 0.0285239
+-0.0171825 0.0382402 0.011747
+-0.0692976 0.0615474 0.00912978
+-0.0232044 0.175652 -0.0207635
+-0.0406662 0.0592305 -0.0118049
+0.0572429 0.0508905 0.0121849
+-0.0488285 0.0416917 0.0446681
+0.0455301 0.0677752 0.0254231
+-0.0846369 0.110251 0.00429821
+-0.0754652 0.163196 -0.0162299
+-0.0247271 0.0564997 0.0408849
+-0.0639975 0.0601011 0.00610183
+-0.0741599 0.155538 0.00126713
+-0.0728899 0.122329 -0.00823917
+0.010861 0.0360066 0.0447493
+0.0150176 0.0355797 0.04239
+-0.0437155 0.0710509 -0.0175901
+0.0271589 0.093209 -0.0206672
+-0.00592646 0.12418 0.0336126
+-0.0810295 0.0895599 -0.00769505
+-0.0920663 0.121362 0.00826874
+-0.0862277 0.0832671 0.00749085
+-0.085371 0.127983 -0.0026626
+-0.081815 0.108922 0.02836
+-0.0491537 0.135503 0.0034228
+0.00885847 0.0887054 -0.0320419
+-0.0673146 0.0446682 0.00602001
+0.0152697 0.128852 0.0195703
+0.0231834 0.0422122 0.040252
+-0.0286261 0.0463451 -0.0269667
+0.0449154 0.0763231 0.00019353
+-0.0387296 0.0739178 -0.0177449
+0.0212191 0.0819428 -0.0266321
+-0.00126307 0.039726 0.0470556
+-0.0261021 0.0379463 0.0228342
+-0.0448562 0.101383 -0.0214692
+-0.0014827 0.0390261 -0.00225591
+-0.0648948 0.103911 -0.0165942
+-0.0624902 0.155293 -0.0145941
+0.000436968 0.130385 0.0227651
+-0.0219738 0.059501 0.0451263
+-0.0502789 0.129408 -0.00267456
+-0.0216757 0.065257 0.0474751
+-0.0621482 0.16155 -0.0395978
+0.0427418 0.0916392 0.0261768
+0.00967962 0.127274 0.0289934
+-0.0728707 0.168003 -0.0450202
+-0.0305611 0.179398 -0.00755573
+0.0341402 0.0902832 0.0407178
+-0.0491119 0.0361611 0.0459929
+0.0392087 0.0739776 0.0338431
+-0.0897017 0.151503 0.0171224
+0.0407967 0.105643 0.0101649
+-0.023633 0.0478399 -0.0272396
+-0.0504958 0.0862332 0.0455716
+-0.0451092 0.153606 0.00834539
+-0.0616087 0.146812 0.0373554
+0.0280342 0.0346822 0.009507
+0.0565861 0.0685555 0.00335277
+-0.027568 0.0674298 0.0392602
+-0.0926576 0.117463 0.0373027
+-0.0334278 0.124984 0.0208436
+-0.0602518 0.034678 0.0430709
+-0.0574989 0.107052 0.0398301
+-0.091226 0.128161 0.00727002
+0.0400022 0.0913669 0.0315547
+-0.0656743 0.138242 0.0419702
+-0.0852141 0.0805923 0.0204766
+-0.0444957 0.111173 0.0370595
+-0.044489 0.0803636 0.042222
+-0.00648998 0.122405 0.0354776
+0.00602348 0.111527 -0.0200414
+-0.0860119 0.132159 0.00027761
+0.0521231 0.0734583 0.0172399
+-0.0155403 0.0446621 0.0510487
+-0.0397503 0.0768521 -0.0186787
+-0.0682155 0.0787029 0.0404793
+-0.0813927 0.0758934 0.0225084
+-0.010188 0.0386565 4.14997e-05
+-0.00149609 0.0912323 -0.0347548
+-0.0294974 0.111128 0.0367729
+-0.0503924 0.0501648 0.0186468
+-0.0104698 0.070299 0.0557764
+0.0327323 0.0809002 0.0421262
+-0.0328911 0.122131 -0.00712262
+-0.0861948 0.1005 0.0258994
+-0.0319282 0.178722 -0.00808101
+-0.050675 0.140101 0.0024044
+-0.0346788 0.0636729 -0.0139354
+-0.00820144 0.0344928 -0.0181278
+-0.0830162 0.0939316 0.0314035
+0.0438286 0.0611702 -0.00330591
+-0.0162799 0.127645 0.0211086
+-0.0615233 0.0354132 0.043881
+-0.0755937 0.0809959 -0.0116148
+-0.0632393 0.166259 -0.0385929
+-0.0156738 0.0511142 -0.0317767
+0.000751147 0.0339678 -0.0215355
+-0.0534027 0.0336932 0.022744
+0.0102837 0.0348658 -0.0091814
+-0.0285082 0.0874866 -0.0336017
+-0.0849712 0.111906 0.0292041
+-0.0732162 0.169408 -0.0460252
+-0.00746424 0.110009 0.0430329
+-0.0587154 0.0723411 -0.016523
+-0.00333145 0.0968513 -0.0305901
+0.0385608 0.0713011 0.0346329
+-0.0463734 0.133247 0.0130756
+-0.0474986 0.104275 0.0408376
+-0.0714849 0.147284 -0.0260827
+-0.0404433 0.0461446 -0.0193164
+0.000709469 0.125628 -0.00726116
+0.028516 0.117882 -0.00302906
+-0.00249354 0.0746702 0.0587588
+0.0463101 0.0806468 0.00818141
+-0.0245515 0.114015 0.0358596
+-0.0396488 0.0563195 -0.0111963
+-0.0236961 0.0607746 0.0425604
+-0.0336359 0.0548461 -0.0105101
+-0.0585033 0.0337545 0.0163089
+0.0212208 0.126407 0.0160623
+-0.0729862 0.15207 0.0354642
+-0.085378 0.128494 0.0496125
+0.00429457 0.122356 -0.0118056
+0.0203517 0.0672611 0.0487139
+-0.0452845 0.0395903 -0.0182935
+-0.0211124 0.182965 -0.0210132
+-0.0295465 0.0819132 0.0441437
+-0.0777488 0.07493 0.029356
+0.00824435 0.0966482 -0.0263491
+-0.0588066 0.0854157 -0.0208208
+-0.0718999 0.113582 -0.00821597
+-0.0893735 0.0901981 0.0104595
+0.032603 0.0835706 0.0419526
+-0.0230608 0.0594124 0.0433799
+0.0284544 0.121423 0.0116324
+-0.0832785 0.12444 0.0504652
+-0.0396241 0.0520021 -0.0108773
+0.00721225 0.0837864 -0.0330068
+-0.046713 0.131987 0.00556897
+-0.0663702 0.157999 -0.00906779
+-0.067736 0.0779793 -0.0166569
+-0.0508692 0.102779 -0.0209206
+-0.0828958 0.151378 0.00422572
+-0.0346622 0.118788 -0.0116368
+-0.0726425 0.0716156 -0.00744076
+-0.059725 0.0469427 0.0326718
+-0.0468444 0.033579 -0.0045851
+-0.0384976 0.100064 0.0415702
+-0.050989 0.121022 -0.0119137
+-0.0624226 0.152205 -0.0125757
+-0.085741 0.151793 0.0266482
+-0.0826468 0.144713 0.0407672
+-0.0685649 0.0705046 -0.00966184
+-0.0734033 0.167233 -0.0217479
+-0.0455099 0.155064 0.0077969
+0.022652 0.0862116 0.0486888
+0.043364 0.0547822 -0.00644446
+-0.054457 0.14621 0.0274041
+-0.0639777 0.155958 0.0237716
+-0.0882347 0.0861347 0.011472
+0.00545294 0.1216 -0.0129959
+-0.0334673 0.174268 -0.00177832
+-0.00402179 0.129762 0.0240423
+-0.0185051 0.0711438 0.0540217
+-0.0872329 0.150111 0.00920897
+-0.090033 0.147105 0.0269347
+-0.0141936 0.0419832 0.0511586
+-0.0335873 0.154463 -0.00838872
+0.0441357 0.083266 -0.000805736
+-0.0528842 0.102762 -0.0205636
+-0.0125091 0.0815143 0.0575917
+0.0197435 0.125962 0.0226458
+-0.067993 0.0619274 0.01978
+-0.0216083 0.039391 -0.0287125
+-0.0767116 0.165247 -0.022942
+-0.0861936 0.111308 0.0401352
+-0.0238165 0.0854111 -0.0376407
+-0.0442161 0.123225 0.0243959
+-0.0175443 0.0460366 0.0510389
+-0.0272334 0.0902723 -0.0326005
+-0.0459359 0.168402 -0.00594095
+0.0355423 0.0512597 0.0315836
+0.0451079 0.0636949 -0.00183531
+-0.0368834 0.125578 -0.00482073
+0.0196258 0.0457587 -0.0217227
+-0.00773224 0.109619 -0.0221011
+-0.0514957 0.0876341 0.0455102
+-0.00269376 0.0613003 -0.0344696
+-0.0512049 0.147808 0.0143958
+0.0266901 0.106496 -0.0148024
+0.0383861 0.0476151 -0.00591592
+-0.0136895 0.0952904 -0.0330103
+0.0368491 0.0767795 0.0374896
+-0.029592 0.0522946 -0.0203629
+0.0482309 0.0500295 -0.00369862
+0.0381363 0.0794306 0.0358549
+-0.0677271 0.155796 -0.00229118
+0.026043 0.0392404 0.0305576
+0.0208388 0.126564 0.0173475
+0.0159735 0.0448127 0.0438765
+-0.0681757 0.118633 0.0523539
+-0.065068 0.136793 0.0410949
+-0.0454458 0.168254 0.00168996
+-0.0715222 0.142818 0.0455702
+-0.0604912 0.112522 0.03629
+-0.00074702 0.0712329 -0.0350931
+-0.0894331 0.150114 0.0121902
+-0.0185746 0.0381525 0.0151621
+0.0291213 0.0348096 0.00960912
+0.0404448 0.0985503 0.0271661
+0.0134712 0.0936014 0.0511282
+-0.021496 0.103017 0.0435858
+0.00918856 0.0342345 -0.00132638
+-0.0508332 0.0956285 -0.0221275
+-0.0613646 0.0394268 0.0439671
+0.0264379 0.0968548 0.0436578
+-0.0646669 0.0405364 0.0387423
+0.0125029 0.0475354 0.045933
+0.0412949 0.104257 0.00416372
+-0.00222052 0.117102 -0.0161156
+-0.00995662 0.169734 -0.0198047
+0.0200755 0.0399795 -0.0157069
+-0.0839165 0.110514 0.0395089
+-0.0546435 0.116042 -0.0146857
+0.0268767 0.0854059 -0.022529
+-0.0543926 0.0337363 0.0224962
+-0.049781 0.0841032 -0.0216622
+0.0431463 0.100109 0.00616795
+0.0393814 0.0780345 0.0341058
+-0.0162612 0.17862 -0.0260128
+-0.0335093 0.0676035 0.0406399
+-0.0176483 0.0352702 -0.0188352
+-0.031463 0.0519033 0.0373773
+-0.0803572 0.0803552 0.0319871
+-0.0320868 0.159267 -0.0129293
+0.0132853 0.0589897 0.0507165
+-0.0103631 0.180289 -0.0277342
+-0.0144925 0.0559441 0.0511232
+-0.0246444 0.0381166 0.0247786
+0.0170669 0.0871276 -0.028336
+0.00372554 0.105196 -0.0213905
+-0.0777857 0.156925 -0.0179137
+0.0578227 0.0710073 0.0178627
+-0.0582482 0.0336534 0.0128901
+-0.0520861 0.0545712 0.0266312
+0.0269849 0.113053 -0.00983991
+0.0429421 0.0467386 0.030224
+0.00548112 0.11414 0.0405028
+0.0607975 0.0637336 0.0101416
+-0.0895137 0.135181 0.0391853
+-0.0822803 0.139383 0.0462108
+0.00350363 0.0883757 0.0563643
+-0.0599112 0.109712 -0.0163845
+-0.0699244 0.107994 -0.0118147
+-0.073438 0.145781 -0.0138542
+-0.0702694 0.156361 0.0186365
+0.0365208 0.0713424 0.036933
+-0.0764811 0.141399 0.0471717
+-0.0338378 0.0943788 -0.02372
+-0.0185768 0.055451 0.0489119
+-0.0294962 0.107041 0.0398129
+0.0351663 0.0783387 -0.0157415
+-0.0823976 0.095314 0.0321564
+0.0458052 0.08902 0.00916777
+0.00466954 0.0341296 0.0180802
+0.012258 0.0751733 -0.0308354
+-0.0176564 0.0480544 -0.0295902
+-0.0487658 0.0811872 -0.020682
+-0.0375125 0.045091 0.0407522
+0.00960807 0.0375632 0.0322947
+0.0522688 0.0462249 0.00921199
+-0.0452834 0.0395877 -0.019291
+-0.0396931 0.126183 0.0200311
+-0.0903381 0.144712 0.0141544
+-0.0430213 0.0450576 -0.0153284
+-0.0539191 0.129665 -0.00510771
+-0.0384876 0.108386 0.0375357
+-0.0496388 0.0605583 -0.0113235
+-0.034501 0.115223 0.0328885
+-0.0540284 0.131061 -0.00500164
+-0.0147028 0.0389017 0.0333119
+-0.0207376 0.0641563 -0.0358205
+0.00590682 0.131658 0.0132863
+-0.0819436 0.154696 0.0145801
+0.0526661 0.0660937 -0.000184776
+-0.0526201 0.14007 0.0244025
+-0.0752504 0.177839 -0.0529463
+-0.0574955 0.0946379 0.0447737
+0.0456129 0.0904097 0.00518194
+-0.0282629 0.122524 0.022734
+-0.0680338 0.142566 0.0438693
+-0.0643033 0.0426016 0.0312522
+-0.0314971 0.102929 0.041974
+-0.00589664 0.0980966 0.0519993
+-0.0542782 0.132533 0.0338047
+-0.0911122 0.11473 0.0343167
+-0.0493972 0.140141 0.00739907
+-0.0577664 0.0485104 0.00767417
+-0.0629684 0.139576 0.0370615
+-0.0122087 0.128137 0.0240139
+0.00116984 0.129366 -0.00128907
+-0.039496 0.0634667 0.0415276
+-0.0427066 0.0696149 -0.0170299
+-0.0721201 0.149786 -0.0402916
+-0.0637423 0.168365 -0.0426884
+-0.0228169 0.0383283 0.0285633
+-0.0894925 0.143336 0.0131803
+-0.0408822 0.128708 0.0107294
+-0.043783 0.147719 0.00491206
+0.00912223 0.0833108 0.0554277
+-0.0543042 0.0335497 0.00301212
+-0.0544171 0.0333785 -0.00775516
+0.0295237 0.0727272 0.042682
+-0.0504982 0.112495 0.0358796
+-0.0240218 0.119915 -0.0108978
+-0.0535232 0.0556038 0.0117195
+-0.0480175 0.133707 0.00490199
+0.00583381 0.129313 0.0261699
+-0.0405566 0.149165 -0.00293165
+-0.0286765 0.0690744 -0.0314836
+0.0453693 0.0693828 0.00245115
+0.0581659 0.056561 0.00517446
+0.0192888 0.0651078 -0.0282476
+-0.0228892 0.0739252 0.0512281
+-0.0217183 0.113234 -0.017904
+0.0365187 0.0526805 0.0315096
+0.0490482 0.0539975 0.0303486
+0.0175085 0.114012 0.0373101
+-0.0328107 0.126843 0.0122027
+-0.0687814 0.0336983 0.00353162
+0.0220892 0.0906332 -0.0239505
+-0.0460528 0.122513 0.026245
+0.0381409 0.109688 0.00657231
+0.0368421 0.0742334 -0.0127504
+-0.0657975 0.0340784 0.0127357
+-0.0706216 0.146831 -0.0255714
+-0.0468292 0.091298 -0.0217206
+-0.0914681 0.144718 0.0171554
+-0.0624908 0.0343254 0.0238098
+0.0543739 0.0477987 0.0161989
+-0.0195403 0.1757 -0.0161256
+0.0224671 0.0343921 0.00678503
+-0.0654707 0.155271 0.00728456
+-0.0897135 0.12265 0.00431103
+-0.0501651 0.0361307 0.0461721
+-0.0901888 0.139114 0.0151891
+-0.0726107 0.156829 -0.0349095
+-0.0334964 0.0718545 0.0411869
+0.0106165 0.0644536 0.0539383
+0.0274263 0.0491525 0.0376576
+-0.0157908 0.169796 -0.0160148
+-0.0608326 0.17151 -0.0610901
+0.0136156 0.126814 -0.00267762
+0.0293325 0.0535401 0.0386956
+-0.0652579 0.153012 -0.0402459
+0.0264019 0.036087 0.0225582
+0.0101281 0.105858 -0.0202342
+-0.0674046 0.0833115 0.0429955
+-0.0312435 0.0538841 -0.0143722
+0.0424267 0.0441756 -0.00158684
+-0.0305089 0.0760274 0.0408429
+-0.0849899 0.127963 -0.0030064
+-0.0223249 0.0386602 -0.0135496
+0.0216012 0.112963 -0.0137495
+-0.0224297 0.0552774 0.0442986
+-0.093152 0.121537 0.0362834
+-0.0384463 0.166779 0.00239389
+0.0317419 0.0667553 -0.0187125
+-0.0127135 0.100022 -0.0239701
+0.0204112 0.0371925 -0.00568428
+0.0383001 0.0969495 -0.00880451
+-0.0500528 0.150184 -0.0037815
+-0.0578783 0.106898 -0.0179862
+0.0485378 0.0682762 0.00156381
+-0.0708965 0.0341323 0.00629169
+-0.0871174 0.110466 0.0103621
+-0.0235739 0.0944939 0.0470656
+-0.0164815 0.0515035 0.0485835
+0.0325428 0.0380502 1.57112e-05
+0.0385774 0.0888011 0.0348199
+-0.0628692 0.0445185 0.0382675
+-0.0572856 0.125533 0.0399888
+-0.0780066 0.0940671 0.0362827
+-0.0361012 0.160724 -0.0132118
+0.0200495 0.124902 -0.000599563
+0.0101263 0.107276 -0.0197522
+0.0224877 0.0961643 0.0466342
+-0.077715 0.0852782 -0.0115916
+-0.0164955 0.105778 0.0423459
+-0.0725318 0.101313 0.038599
+-0.0663565 0.0783826 0.0411592
+-0.0644378 0.17995 -0.0588828
+-0.0645973 0.171184 -0.0458828
+0.0111199 0.129735 0.0223368
+-0.018333 0.172741 -0.0161594
+-0.0864925 0.10492 0.00639597
+-0.0144943 0.0500942 0.0487331
+-0.0855601 0.095177 0.0282718
+1.67787e-05 0.0386604 0.0239291
+0.0109499 0.0344084 0.00259617
+-0.0270041 0.168274 -0.00938266
+-0.0378811 0.107099 -0.0200653
+0.060304 0.0664655 0.0101406
+-0.0478845 0.108472 -0.0188663
+0.0181085 0.0591163 0.0489014
+-0.0260899 0.0522789 0.0395517
+0.0049437 0.0984176 -0.0242128
+-0.0623314 0.0357831 0.0433788
+0.0110403 0.0725847 0.0546235
+-0.0864956 0.084691 0.0204775
+-0.00849993 0.0787667 0.0579153
+-0.0260008 0.0382709 0.000860974
+-0.06937 0.145758 -0.0234859
+-0.0314168 0.117929 -0.0127586
+-0.0261669 0.0378674 0.0174813
+-0.0832309 0.120353 0.049216
+-0.0617814 0.16156 -0.0355923
+-0.0779669 0.165862 -0.0278956
+-0.0698398 0.0922797 -0.0162924
+0.0483255 0.0503286 -0.00380134
+0.0451716 0.0889782 0.0181643
+0.0329815 0.112282 -0.00498623
+0.0279206 0.0916217 -0.0209795
+0.0155 0.11402 0.0377783
+-0.0105379 0.0431327 0.0497176
+0.0606167 0.0609422 0.00915424
+-0.0181983 0.18599 -0.0174024
+0.0189716 0.115037 -0.0139804
+-0.0590849 0.0644137 0.0318252
+-0.0819254 0.12582 0.0519232
+-0.0588398 0.0954803 -0.0203334
+-0.0674426 0.148384 -0.0326115
+0.0387628 0.10462 0.0262683
+0.00841723 0.129272 0.0256623
+-0.0196119 0.0364667 -0.0278852
+-0.0376923 0.162356 -0.000243841
+1.88808e-05 0.115368 -0.0182789
+0.0393962 0.0505525 -0.00668347
+-0.0116788 0.0555838 -0.0339192
+0.0363865 0.0713868 -0.0138007
+-0.0821651 0.110069 0.034903
+0.022728 0.117081 -0.0101857
+-0.0515389 0.0417461 -0.0105815
+0.0219588 0.123501 -0.00109075
+0.00735928 0.0960033 -0.0276522
+-0.00349428 0.119696 0.0379021
+-0.0470844 0.151656 -0.00519447
+-0.0242296 0.0941248 -0.0298734
+0.0152433 0.0658912 0.0518711
+-0.021804 0.0376594 -0.0181241
+-0.0133966 0.121962 -0.00916065
+0.0365536 0.108655 0.0265769
+-0.0668098 0.0880715 -0.0180091
+-0.0665181 0.171112 -0.0407548
+0.0493343 0.0532247 -0.0043679
+0.0423933 0.0901635 -0.00682346
+-0.0624126 0.150651 -0.0115734
+0.0373944 0.0505276 -0.00658166
+-0.0411461 0.162173 -0.0113613
+-0.065916 0.0662086 0.0305519
+-0.0289729 0.083488 0.0456837
+-0.000642523 0.0347913 0.0398677
+-0.0738147 0.065744 0.00631032
+0.00351431 0.0938625 0.0544725
+-0.0467733 0.12389 0.0269319
+0.0246632 0.123785 0.00595837
+-0.0715256 0.0958228 0.0413941
+0.00252922 0.0362636 0.0463395
+0.00948792 0.0963424 0.0500581
+0.0292035 0.0400739 0.0286474
+-0.0309481 0.0706991 -0.0284733
+-0.054091 0.152763 0.0215579
+0.0118527 0.105542 -0.0197545
+-0.0404793 0.0832528 0.0431634
+-0.0448438 0.0985036 -0.0215544
+-0.032014 0.0567822 -0.0123897
+0.00040853 0.0356817 0.00488121
+0.0447245 0.0861403 0.0231669
+-0.0426307 0.0338188 -0.00946517
+-0.0710495 0.141325 -0.00813095
+-0.0255896 0.182763 -0.0105092
+-0.0838169 0.107636 0.0253505
+-0.0796245 0.0859561 0.0353266
+0.0240034 0.0449703 0.0396985
+0.00450108 0.0716864 0.0560951
+-0.0676894 0.0750921 -0.0153176
+-0.0466572 0.0369109 -0.0172699
+-0.016529 0.0558872 0.0508401
+-0.087831 0.103641 0.0093887
+0.0272256 0.10745 0.0377741
+-0.0670064 0.0337953 0.0073865
+-0.0866888 0.0833263 0.0124872
+0.0152687 0.0779357 -0.0299953
+-0.0851819 0.152725 0.0105454
+0.000352424 0.0511166 -0.0306262
+0.0518495 0.0464359 0.0201911
+0.0554005 0.0553511 0.0254886
+-0.0886141 0.0928486 0.00844707
+0.0129712 0.130228 0.0115965
+-0.085549 0.104961 0.0233427
+0.0515991 0.0496316 0.0251833
+0.0131946 0.0878791 -0.0305989
+-0.0693376 0.131255 0.0489674
+-0.0660205 0.167997 -0.0305503
+-0.0666146 0.174697 -0.0480375
+-0.0293346 0.0347045 0.0427947
+-0.0553259 0.126836 -0.00601308
+-0.058583 0.0460291 0.0113967
+-0.0416277 0.0337441 -0.014735
+-0.0446642 0.0621749 -0.0132201
+0.0295862 0.120365 0.0134787
+-0.0697163 0.064282 0.022673
+-0.0805487 0.0789662 0.0306236
+-0.0787564 0.154933 0.00983696
+-0.0662707 0.14708 -0.0258685
+-0.0248167 0.0949702 -0.0267501
+-0.0407693 0.0826515 -0.0208197
+0.000514101 0.0346343 0.00952105
+-0.0533361 0.138123 0.0280776
+-0.0689277 0.115103 -0.00892086
+-0.0865224 0.0913375 0.0024428
+0.0232602 0.0790529 -0.0256674
+0.0296786 0.0679688 -0.0198342
+-0.0331127 0.123309 0.0239558
+0.0276403 0.118218 0.0284429
+0.00238303 0.0449286 -0.0261957
+-0.0928278 0.124236 0.0382657
+-0.0868685 0.11045 0.00936714
+-0.0254875 0.0959781 0.0438332
+0.0132252 0.0808221 -0.0308314
+0.035265 0.0591791 0.0368077
+-0.00944135 0.168135 -0.0197365
+0.0011864 0.12951 0.0259323
+-0.0139593 0.0967237 -0.0305143
+-0.00848922 0.0385737 0.0258802
+0.0562981 0.0619429 0.0011209
+0.0322546 0.0987343 -0.0145759
+-0.0268707 0.103016 -0.0234914
+-0.00655639 0.0384205 0.0209905
+-0.0296666 0.0774462 0.0418826
+-0.0626586 0.0676213 -0.0103966
+0.0374569 0.0904362 -0.0137042
+-0.0712181 0.161 -0.0439365
+0.0243668 0.0889213 0.0476805
+-0.0336134 0.0408899 -0.0298935
+-0.0404969 0.0916505 0.0425962
+0.0443454 0.0903358 0.0221636
+-0.0435232 0.163746 0.00524284
+-0.0649943 0.0623954 0.0235277
+-0.0613093 0.0593276 0.0181457
+-0.0717978 0.155398 -0.0409076
+-0.00868753 0.0584178 -0.0339256
+-0.0904383 0.119966 0.00529664
+-0.0601615 0.0333995 -0.00165181
+-0.0612252 0.0407891 0.0437895
+-0.0537348 0.0738508 -0.0172852
+-0.0709057 0.10512 -0.0125462
+-0.00333997 0.039253 0.0353398
+-0.0469903 0.145002 0.00194161
+-0.0250386 0.0659034 -0.0335362
+-0.023273 0.0382876 0.00502865
+0.0111228 0.0960826 -0.0257288
+0.0198113 0.0954368 -0.0230239
+0.038476 0.104075 -0.00282883
+-0.0843581 0.0883713 0.0286614
+-0.0930341 0.118841 0.0362969
+-0.0646767 0.146003 -0.0179612
+0.0284626 0.102127 0.0395666
+-0.0435018 0.113907 0.034675
+-0.0604863 0.0790224 0.042794
+-0.089042 0.112536 0.0205154
+-0.0524675 0.0344946 0.0345461
+-0.0848716 0.119101 -0.00207765
+-0.0120923 0.11442 -0.0172013
+-0.079929 0.151371 0.00121035
+-0.0920085 0.116136 0.0393096
+0.0361533 0.112569 0.0130564
+-0.0196629 0.125034 -0.00230889
+0.000499429 0.115573 0.0406664
+-0.0560183 0.147198 -0.00168648
+-0.0873616 0.110481 0.0113565
+-0.0416844 0.0636674 -0.0137203
+-0.0651889 0.153592 -0.00278678
+0.0471599 0.07398 0.0153485
+0.0404106 0.0873775 0.0321991
+-0.019434 0.184905 -0.0153275
+-0.0438294 0.0913555 -0.0224139
+-0.0527613 0.0797578 -0.020501
+-0.0314155 0.0651435 -0.021432
+0.00948509 0.0950229 0.0512669
+0.0346346 0.107297 -0.007625
+-0.0870053 0.0954387 0.00242783
+-0.0617312 0.142927 -0.00565867
+-0.0538929 0.14622 0.0244012
+0.0339044 0.115273 0.00366751
+0.049575 0.0693171 0.00251779
+-0.0861009 0.106274 0.00635995
+-0.00751182 0.075985 0.0578234
+-0.0761849 0.0933719 -0.0135017
+0.0266626 0.0672707 0.0437593
+-0.0314925 0.0932138 0.0444288
+0.0112937 0.0680868 -0.0307505
+-0.086045 0.141863 0.00720055
+0.000490707 0.111422 0.0424934
+-0.0516022 0.0502173 -0.00741774
+-0.0709386 0.131124 -0.00852217
+-0.0291841 0.125368 0.0164845
+-0.0012258 0.095852 -0.0315171
+-0.000697567 0.0641196 -0.0342689
+-0.0797379 0.0738711 0.0228323
+-0.0705682 0.0382102 0.00943236
+-0.0558807 0.102663 -0.0193944
+0.0262875 0.0835737 0.0468767
+-0.0206175 0.0364922 -0.0281092
+0.0306136 0.0779431 -0.0207534
+0.037492 0.0983062 -0.0097724
+-0.0861064 0.0806138 0.0174966
+-0.0488748 0.105594 -0.0196597
+-0.0499497 0.0724883 0.0409516
+-0.060435 0.131107 0.0389542
+-0.0197383 0.108898 -0.0213322
+-0.0328414 0.0943934 -0.0238538
+0.0071329 0.104451 -0.0211019
+-0.0904392 0.125398 0.00528343
+0.0579573 0.0676391 0.00414749
+-0.0890486 0.0915916 0.0214249
+0.0544885 0.0716156 0.00618127
+0.037936 0.0901639 0.0356574
+-0.0631289 0.155254 0.0269868
+0.0280038 0.120349 0.024295
+0.00325461 0.0697315 -0.0336623
+0.0198002 0.0768324 0.0515324
+0.0135718 0.0504901 0.0475195
+-0.0220331 0.041681 0.0538782
+-0.0322365 0.126297 0.00653811
+-0.020497 0.0855906 0.0563403
+0.0100844 0.123139 0.0340691
+-0.0917617 0.141982 0.0191718
+-0.00665267 0.0526646 -0.0325345
+0.0325469 0.0922927 -0.0176842
+-0.00490321 0.0383839 0.0141185
+0.0393963 0.049102 -0.00636122
+-0.0468295 0.0927337 -0.0216687
+0.0393484 0.0561243 -0.00568756
+0.0381042 0.0392738 0.00134927
+-0.02061 0.0653432 0.0492306
+-0.0644858 0.152894 -0.00250698
+0.0316363 0.118365 0.0113851
+-0.0625842 0.162383 -0.0563311
+-0.0126137 0.180121 -0.0236267
+-0.0562637 0.142432 0.0309288
+0.0389203 0.10838 0.0161659
+0.0468209 0.0708789 0.021127
+0.0153317 0.060873 -0.028643
+-0.067208 0.0447917 0.00368814
+-0.0638714 0.15469 -0.0385902
+-0.0624126 0.161536 -0.0416011
+-0.011049 0.124435 -0.00785173
+0.0143712 0.0493733 -0.0267066
+-0.0374862 0.0931566 0.0438456
+-0.0278525 0.0807805 0.0474761
+0.0573848 0.0670309 0.00292365
+-0.0304938 0.0960556 0.0449536
+0.0182602 0.127523 0.0192457
+0.0182204 0.080645 -0.0282763
+-0.00275795 0.0740872 -0.0359501
+-0.072697 0.155649 0.00759319
+-0.0857527 0.0792184 0.0135098
+-0.0604443 0.0456013 0.0296807
+-0.0528198 0.0927332 -0.0219739
+-0.0457202 0.0709417 -0.0164642
+-0.054497 0.0889964 0.0448823
+-0.0541353 0.147754 0.0254132
+0.05074 0.0503045 -0.00171178
+-0.0926993 0.124215 0.0352716
+0.00850767 0.0786 0.0556334
+-0.0141847 0.0405865 0.0511605
+-0.0500491 0.0345412 0.0367666
+-0.0744234 0.156022 0.0128056
+-0.0148381 0.0386367 -0.0157684
+-0.0896535 0.0916031 0.0184402
+-0.0279306 0.125506 0.00666413
+-0.0249827 0.0918474 0.0485489
+-0.0247746 0.0385687 -0.0102357
+-0.0718755 0.10648 -0.0114758
+0.0303733 0.115414 -0.00438737
+0.0390771 0.099844 -0.00681802
+-0.0601235 0.0447437 0.0425684
+0.0559507 0.0508031 0.00520531
+-0.087948 0.102288 0.00840013
+-0.0802939 0.0732789 0.00250413
+-0.00347452 0.114725 -0.0175669
+-0.0780015 0.155773 0.018849
+-0.0868392 0.0873072 0.00147849
+0.0114304 0.0346172 0.0371012
+-0.0154945 0.0925097 0.0555061
+0.0207547 0.10431 -0.0184628
+-0.0805113 0.153427 0.0283513
+-0.0133702 0.0343611 -0.0190243
+0.045363 0.0932019 0.00717004
+-0.0517619 0.079747 -0.0203928
+-0.011137 0.171308 -0.0197957
+-0.0797359 0.0706327 0.0105539
+-0.0435047 0.116629 0.0323741
+0.0461192 0.0786876 0.0190773
+0.0257679 0.0349257 0.0180133
+-0.0377436 0.127354 0.000111554
+0.0455391 0.0875946 0.0141649
+-0.0115776 0.0962625 -0.032007
+-0.0304054 0.0580102 -0.0194062
+-0.0519213 0.118323 0.0336042
+-0.0615165 0.15114 0.0355512
+-0.0268549 0.175688 -0.00910606
+0.0291872 0.0462618 0.034893
+-0.0828817 0.143196 0.00216401
+-0.0229243 0.0972075 0.044901
+-0.0420606 0.0344689 0.0332688
+0.00840712 0.0404044 -0.0234014
+-0.0584986 0.100161 0.0428821
+0.0267286 0.0521731 -0.0207566
+-0.0343564 0.043282 -0.028737
+0.035312 0.0840703 -0.0177861
+0.0167493 0.0874098 0.0506847
+-0.0706375 0.156126 0.0126907
+0.0395317 0.0596774 0.0306966
+0.0160357 0.0807986 0.0531419
+-0.0719071 0.105086 -0.0120336
+0.057752 0.0523416 0.0181873
+-0.0705862 0.166615 -0.0490027
+-0.069998 0.157611 -0.0031485
+-0.0629727 0.118457 0.044154
+-0.0098895 0.107351 -0.0224128
+-0.0668287 0.169972 -0.0351376
+-0.0538607 0.152062 0.0231076
+0.0286155 0.0795328 0.044942
+0.00747725 0.131195 0.0181386
+0.0525355 0.0678367 0.0261828
+-0.069983 0.033931 0.00665746
+-0.00449526 0.10588 0.044033
+-0.0647467 0.143415 -0.011401
+-0.0242451 0.0337053 -0.0224295
+0.0405945 0.102819 0.0221712
+-0.0253936 0.106122 -0.0223873
+-0.031866 0.126076 0.00521848
+-0.0903832 0.132413 0.0312232
+0.0270423 0.0648893 -0.0216756
+-0.0416036 0.125525 0.0208631
+-0.0642885 0.148287 -0.0250747
+0.043249 0.0705728 -0.00179391
+0.00750831 0.0772509 0.056126
+-0.0360471 0.125746 -0.0036679
+-0.0534999 0.0820142 0.0450601
+-0.0268076 0.0782799 -0.0366273
+-0.0630392 0.0336157 0.00836468
+0.00450283 0.0924607 0.0546761
+-0.0794816 0.0846149 0.0352279
+-0.0354976 0.116636 0.0319301
+0.0590094 0.0552651 0.0101755
+0.0177618 0.100614 -0.0224544
+0.0141872 0.0347155 0.0357788
+-0.0626395 0.0644043 -0.00619313
+-0.0472223 0.168222 -0.000777409
+-0.0688709 0.156258 0.0147705
+-0.00209707 0.130745 0.0203917
+0.0438165 0.0959355 0.0191615
+0.0272253 0.120021 -0.000250724
+-0.0623918 0.152158 -0.026581
+-0.0619803 0.153737 -0.02558
+-0.0110119 0.122536 -0.00980812
+-0.00845767 0.100229 0.0476033
+-0.053626 0.1255 0.0365054
+0.029243 0.0872327 -0.0208644
+-0.0561028 0.133503 -0.00512832
+-0.0536146 0.150855 0.0243962
+-0.0729449 0.0805494 0.0386997
+-0.0113093 0.0384672 0.00547553
+0.013929 0.0392001 0.0444158
+-0.0743245 0.179234 -0.0539852
+-0.0670834 0.168031 -0.0569976
+0.0269196 0.0418157 0.0333163
+-0.0261604 0.114813 -0.0155316
+0.054979 0.06227 -0.000302264
+0.0447631 0.0931576 0.00318223
+-0.028552 0.159576 0.000695282
+-0.0196334 0.0906851 0.0545345
+-0.0681661 0.173216 -0.0428508
+-0.0670035 0.166617 -0.0570134
+-0.00170857 0.0641356 -0.0344906
+-0.0302923 0.115032 -0.0157497
+-0.017789 0.0998203 0.0439009
+0.0575984 0.0711737 0.0088801
+-0.0559485 0.119826 0.0383628
+-0.0508832 0.106998 -0.0191626
+-0.0856518 0.096702 -0.000561949
+0.0433856 0.0475038 -0.0047769
+-0.0141839 0.177168 -0.0206609
+-0.0318261 0.0623615 -0.0184459
+-0.0694684 0.158126 -0.0509379
+-0.059088 0.0445923 -0.00517311
+-0.0680469 0.0887699 0.043444
+0.0413366 0.0588699 -0.00449648
+-0.0108613 0.16611 -0.0209706
+-0.0810695 0.111472 -0.000645954
+0.0236683 0.0535376 0.0428398
+-0.0525009 0.104252 0.0406803
+0.0178265 0.128119 0.0148069
+-0.0833287 0.0817012 -0.000498118
+-0.0582078 0.148218 0.0334722
+0.0469627 0.0735494 0.00823046
+0.0348898 0.0889372 0.0400127
+0.0544139 0.0478718 0.0102055
+-0.0519767 0.0343446 0.0277664
+-0.0526872 0.144684 0.0193835
+-0.0654577 0.0403952 0.0367257
+-0.0632766 0.146612 -0.0147592
+-0.0756638 0.0968147 0.0380937
+-0.0121766 0.169774 -0.0245851
+-0.0313173 0.115081 -0.0157968
+0.00550009 0.105744 0.0419393
+0.0170456 0.0808203 0.0528345
+0.00997537 0.129323 0.0247881
+-0.000565033 0.0348667 0.0451983
+-0.0170398 0.124093 -0.00535053
+0.0359746 0.112738 0.007259
+-0.0264982 0.112519 0.0362632
+-0.0108141 0.0841239 -0.038537
+-0.0464922 0.097353 0.0431423
+0.0456344 0.0820067 0.0201819
+-0.00765915 0.0388225 0.0294318
+0.00952232 0.057476 0.0527668
+-0.0114724 0.180094 -0.0295969
+-0.0324762 0.0778813 -0.0295332
+-0.0515001 0.0465582 0.0417907
+-0.0716564 0.0639047 0.0190638
+-0.00648988 0.10728 0.0440126
+0.0517118 0.048146 0.0235716
+-0.00973422 0.0712867 -0.0371391
+-0.0311873 0.0499402 0.0418672
+-0.0652548 0.0380623 0.0267185
+-0.0353491 0.0346157 0.0221204
+-0.00455763 0.115688 -0.0165869
+-0.0158711 0.0941172 -0.0338261
+-0.0307264 0.0510087 -0.0163552
+-0.0674749 0.0861001 0.0436947
+-0.00549495 0.0456998 0.0471564
+-0.0127624 0.0742651 -0.0384156
+-0.0667813 0.0354951 0.0323861
+-0.0650934 0.040468 0.0377689
+0.00949782 0.11825 0.0371477
+0.042476 0.0986857 0.0211679
+0.0134353 0.0833572 0.0528968
+-0.006265 0.0381462 0.0486516
+0.019505 0.108463 0.0397034
+-0.0531501 0.13113 0.0336749
+-0.0169066 0.174228 -0.0176024
+-0.0877346 0.144562 0.0345528
+-0.0620052 0.131132 -0.00795604
+0.00350354 0.0967589 -0.0284524
+-0.0379926 0.15214 0.00278328
+-0.0250008 0.0678945 0.0436439
+0.013488 0.120719 -0.0120957
+-0.0546814 0.0342953 0.0289953
+-0.0493523 0.128134 -0.0033313
+-0.00536457 0.0387134 0.026395
+-0.0301008 0.162274 -0.0148279
+-0.0520761 0.153139 -0.00390728
+-0.0312974 0.120401 0.0276066
+-0.072708 0.173064 -0.0373345
+-0.0634981 0.0847405 0.0443851
+-0.00748204 0.123738 0.0339317
+0.0398166 0.0726016 0.0329349
+-0.0204571 0.159751 -0.0120682
+-0.0398664 0.104215 -0.0203975
+0.006345 0.0351555 0.0445736
+-0.0295025 0.0974144 0.0445077
+-0.00148646 0.0489421 0.0507365
+-0.0158009 0.0813621 -0.039398
+-0.0661715 0.0383371 0.0290301
+-0.0520592 0.0517918 0.0296489
+0.0132683 0.0765435 -0.0305058
+0.0357248 0.113154 0.00859849
+0.0452751 0.0847797 0.0211588
+0.0408906 0.0942563 -0.00676992
+-0.0621992 0.16466 -0.0525894
+-0.0704991 0.101365 0.0396906
+-0.0514936 0.0959907 0.0439844
+-0.0738976 0.0662178 0.00410027
+-0.0308753 0.104365 -0.0222089
+-0.0454852 0.0411575 0.0440424
+0.0264018 0.0591975 -0.0228202
+-0.0372554 0.154082 -0.00855912
+-0.0104302 0.175693 -0.0238578
+-0.0581296 0.0583212 0.0178996
+-0.0237002 0.0610797 -0.032726
+-0.0366248 0.127943 0.00786237
+-0.00749367 0.0605601 0.0556586
+-0.0317091 0.0749949 -0.0294856
+-0.0617882 0.138121 0.0352393
+-0.0764283 0.117143 0.0518912
+-0.0476607 0.120291 -0.0131944
+-0.0617261 0.158412 -0.0335949
+-0.0794782 0.106106 0.0317497
+-0.00127622 0.127442 0.029403
+-0.0850735 0.0819457 0.0214598
+-0.088151 0.137836 0.0407884
+-0.0622605 0.152178 -0.0225796
+-0.0896207 0.132365 0.0409732
+-0.0392773 0.153597 0.0044688
+-0.0477636 0.0797421 -0.0198355
+0.0475024 0.06248 0.0300852
+0.0137309 0.0344041 -0.00431645
+-0.0864106 0.136323 0.00223079
+-0.0622483 0.0470201 0.00467011
+-0.0218601 0.0893132 0.0539604
+-0.0404866 0.0390699 -0.027317
+-0.0563767 0.0650155 0.0336358
+-0.022785 0.0727991 -0.0382731
+0.00745846 0.0952014 -0.0287983
+-0.0728877 0.143976 -0.0119757
+-0.0485361 0.130681 1.6802e-05
+-0.08227 0.0830732 0.0310042
+-0.0458007 0.0884477 -0.0220772
+-0.0674901 0.102816 0.040307
+-0.0295082 0.0987895 0.0437091
+0.0266247 0.0591987 0.0436528
+-0.0166425 0.0970062 0.0498004
+-0.0754488 0.151352 -0.0128993
+-0.0561187 0.04231 0.0196965
+-0.0125561 0.107483 -0.0218463
+-0.0258638 0.0987461 -0.0241399
+-0.0150968 0.0965608 -0.0303463
+0.0403869 0.0505617 -0.00671315
+-0.0618596 0.135275 0.0369058
+-0.00853806 0.120181 -0.0133625
+0.0152242 0.123558 0.0310525
+-0.0669104 0.112326 -0.011534
+-0.00121369 0.0389243 -0.000247464
+0.0599261 0.0581121 0.0171753
+-0.0104999 0.0842933 0.0575891
+0.0236959 0.120687 0.0298434
+0.0407626 0.105627 0.00616707
+-0.0204813 0.10165 0.0438784
+-0.0497999 0.0884036 -0.0217208
+0.0455191 0.0847794 0.00419259
+-0.0113995 0.128605 0.00179072
+-0.0808762 0.0733317 0.00350919
+-0.0634956 0.0804499 0.0432131
+-0.0737877 0.170302 -0.0290826
+-0.00649113 0.0718493 0.0579775
+-0.0445186 0.0533636 0.0386768
+0.0320623 0.104555 -0.0127247
+-0.0491177 0.138604 0.00740359
+0.0459251 0.0848195 0.0121712
+0.0423718 0.0547731 -0.00653415
+-0.0505603 0.0417939 -0.0107632
+-0.0551112 0.0477166 -0.00539308
+-0.0492183 0.150688 0.0111503
+-0.0868019 0.0886457 0.00149241
+-0.0414982 0.166749 0.00369508
+-0.00533161 0.123249 -0.0106624
+0.00612795 0.107304 -0.0203065
+0.023391 0.0605296 0.0460187
+-0.0778945 0.102117 0.0345146
+-0.0177322 0.108689 -0.0211068
+-0.0341359 0.168185 -0.0152479
+-0.0364811 0.0931828 0.0441998
+-0.0645148 0.15586 0.0250316
+-0.0133496 0.124356 0.0309811
+-0.053528 0.131291 -0.0047694
+0.0236875 0.0373106 0.0299772
+0.00806894 0.0972917 -0.0250353
+0.0518069 0.0518147 -0.00170668
+-0.0580149 0.0675718 0.0363481
+-0.0916942 0.124053 0.00727726
+0.0143227 0.0344255 0.0215932
+-0.0828034 0.0762521 0.011522
+-0.0523769 0.119775 0.034728
+-0.0380638 0.174118 -0.00995608
+-0.0515288 0.0559219 0.0167726
+-0.0665225 0.10009 0.04154
+0.0449219 0.0497223 0.0313654
+-0.00374083 0.069852 -0.0355987
+-0.0448162 0.12956 0.0195798
+0.00318984 0.0852564 -0.0341139
+-0.0901249 0.125637 0.04453
+0.0248625 0.12099 -0.00239034
+-0.0357073 0.03405 0.0117511
+-0.0461509 0.05879 0.0381434
+0.0389649 0.108275 0.00542368
+-0.0857362 0.141867 0.00617644
+-0.0755097 0.135846 0.0506323
+0.0384382 0.0954258 0.0328906
+0.00385238 0.131766 0.0125385
+-0.0277181 0.0382234 0.00237012
+0.0554262 0.0714159 0.00640835
+-0.0707971 0.168292 -0.02371
+-0.0131917 0.169758 -0.0239616
+-0.0344904 0.0661905 0.0406967
+-0.00154364 0.130277 0.00186507
+-0.0647696 0.148087 -0.0261392
+-0.0577571 0.0334518 0.000595927
+-0.0334995 0.0618586 0.0392638
+-0.0657123 0.171986 -0.0448274
+-0.0254896 0.049863 0.0466034
+-0.0207287 0.058287 -0.0332963
+-0.040488 0.088839 0.0428058
+0.00826686 0.0681716 -0.0316571
+-0.0382076 0.0431174 -0.0263315
+-0.0192007 0.0392753 0.0392298
+0.0446778 0.0701888 0.00161208
+-0.0681688 0.0340999 0.0104427
+-0.0891956 0.099693 0.0183885
+0.00250408 0.0856622 0.0573274
+0.00673484 0.0364109 -0.0131882
+-0.0273112 0.0917698 0.0451953
+0.0360152 0.072737 0.038003
+-0.0174841 0.0910963 0.0554741
+-0.0882831 0.114383 0.0443189
+-0.0562701 0.0534697 0.00668599
+0.0184737 0.104403 0.0439338
+0.0591195 0.067343 0.0203999
+-0.0464971 0.107057 0.0400682
+0.0224712 0.125479 0.00796738
+-0.00281596 0.0896133 -0.0355773
+-0.0892259 0.113441 0.0323782
+-0.0532781 0.0476794 0.0246524
+0.00120832 0.0811183 -0.0353756
+-0.0820812 0.0748515 0.0115294
+-0.0344414 0.153644 0.000910386
+-0.0915313 0.147463 0.0171482
+-0.0778811 0.12224 -0.00662917
+0.00275904 0.130985 0.0207146
+0.0333375 0.115599 0.0220283
+-0.0925663 0.116874 0.0234322
+-0.0461657 0.168264 0.000998904
+-0.0608088 0.148246 0.0367611
+-0.0740333 0.13404 0.0510058
+0.046183 0.0806404 0.0141758
+-0.0177485 0.0700027 -0.0382786
+-0.05252 0.0490121 0.0379722
+-0.0142459 0.168321 -0.0155387
+-0.0894247 0.0996886 0.0153976
+-0.0654783 0.0861634 0.0444498
+0.0323217 0.116577 0.0230638
+-0.0676059 0.141897 -0.00935244
+-0.0514978 0.10289 0.0412322
+-0.00575874 0.0741425 -0.036638
+-0.0913439 0.11607 0.03131
+-0.0313824 0.0877015 -0.0265568
+0.0373688 0.102607 -0.00785264
+-0.0106393 0.169838 -0.0190633
+-0.0716387 0.0675256 0.0265031
+-0.0396636 0.0340515 0.0270767
+-0.0779219 0.0717107 0.00150831
+0.0451585 0.0670735 0.000845212
+-0.045692 0.126639 0.0237789
+-0.0914166 0.131046 0.0292353
+-0.0845601 0.0832447 0.0254813
+-0.00465613 0.0540645 -0.0324247
+-0.0573264 0.15429 0.0261567
+-0.0776607 0.0817583 -0.0102119
+-0.0614708 0.165833 -0.0590275
+-0.0866007 0.129822 0.0479412
+-0.0751026 0.155922 -0.00200459
+0.0292911 0.0364248 0.021021
+0.0168648 0.0958851 -0.0235234
+0.0566532 0.0608369 0.0255651
+-0.0447794 0.128887 0.00190497
+-0.024583 0.0635737 0.0419612
+-0.0534745 0.0360014 0.0464895
+-0.0488506 0.0999451 -0.0218934
+0.00224668 0.0740592 -0.0351433
+-0.0223056 0.126998 0.0101726
+-0.0907871 0.14608 0.0151486
+-0.0506704 0.0680761 0.0375114
+-0.0689054 0.113678 -0.00975253
+-0.032497 0.0917926 0.0443017
+0.0282492 0.102359 -0.0164093
+0.0375206 0.0540908 0.0314327
+-0.00566586 0.0555015 -0.0328252
+-0.0896969 0.139298 0.033185
+-0.0707473 0.127025 0.0521985
+-0.0455052 0.162274 0.00622301
+-0.0188243 0.0868874 -0.0382929
+0.00890069 0.0988547 -0.0226736
+0.0103725 0.130878 0.016344
+-0.0568151 0.142191 -0.00256359
+-0.0576833 0.0660478 -0.00944709
+-0.0394154 0.128541 0.00978788
+-0.0112757 0.0392934 0.0501019
+-0.0875442 0.11045 0.0133403
+0.0108543 0.128955 0.0251156
+-0.0306705 0.0692801 -0.0274547
+0.0193368 0.0460939 -0.0219388
+0.0280428 0.0928381 -0.0202889
+0.0101954 0.0879315 -0.0314901
+-0.0425303 0.153621 0.00682011
+0.046342 0.0671736 0.000660587
+0.0133755 0.0508647 -0.0275026
+-0.0815821 0.0803018 0.0303913
+-0.059075 0.137911 -0.00597298
+0.0419587 0.0958192 0.0261617
+0.0444321 0.0482656 0.0306384
+-0.0444939 0.0519693 0.038747
+0.0141421 0.107244 -0.018655
+-0.0258198 0.0880859 -0.0357275
+0.0511643 0.0525875 0.0281258
+-0.0838035 0.0884157 -0.00457068
+-0.0075843 0.111951 -0.0206051
+0.020155 0.0344845 0.00437508
+-0.0141697 0.038751 -0.00641336
+0.0160515 0.039741 -0.0214719
+-0.0627129 0.161593 -0.024579
+-0.0329051 0.0359381 0.0496011
+-0.0738068 0.0892836 -0.0151913
+0.0299737 0.0934986 -0.0189639
+-0.0618436 0.129703 0.0404325
+0.0117043 0.110341 -0.0188996
+0.013386 0.0576661 0.0508541
+-0.0636966 0.117092 0.044917
+-0.0634835 0.0890243 0.0452141
+-0.0874124 0.136542 0.0428952
+-0.0391888 0.168166 -0.0121398
+0.0376532 0.101954 -0.00791483
+-0.0708338 0.143978 -0.0149516
+-0.0135013 0.0687469 0.0541774
+-0.0671166 0.134015 0.0451603
+-0.0645196 0.148285 0.0383203
+-0.0216796 0.18469 -0.0188168
+-0.00148992 0.070365 0.0570874
+-0.0291401 0.0875323 -0.0325902
+0.0251009 0.122815 0.00327552
+-0.0111221 0.0980696 -0.0279124
+-0.0635024 0.0918143 0.0447779
+-0.0887995 0.0901451 0.00746775
+0.0164935 0.0962515 0.0477962
+0.046272 0.0806446 0.00718674
+0.038459 0.094268 -0.00974763
+0.0100793 0.0873522 0.0550703
+0.0183745 0.0874107 0.0495162
+-0.0547819 0.0840722 -0.0215429
+0.0249849 0.0576546 -0.0237943
+0.0262469 0.11849 0.0293617
+0.0187045 0.0462587 0.0425837
+-0.0433933 0.123406 -0.0104784
+-0.0615139 0.0385816 -0.00827445
+-0.0234882 0.104381 0.0428298
+0.0334188 0.115464 0.00204907
+-0.0251305 0.0810774 0.0532367
+-0.0661661 0.0431586 -0.00127362
+-0.0689806 0.138464 -0.0078252
+0.0324954 0.0484967 0.0321634
+-0.0650217 0.154743 0.00396393
+-0.0615004 0.0818818 0.0435978
+0.0289072 0.10744 0.0367037
+-0.0720417 0.156813 -0.0379146
+-0.0232564 0.171248 -0.0127378
+0.0211195 0.109025 -0.0155233
+-0.0668614 0.150018 -0.036632
+0.0204284 0.122662 -0.00423372
+-0.0628194 0.162004 -0.0576316
+-0.0641553 0.168532 -0.0413683
+0.0278158 0.0649933 -0.0208789
+-0.0788364 0.0742331 0.0262211
+0.0527925 0.0505032 0.000257908
+-0.0738772 0.107826 -0.00969763
+-0.0819791 0.08171 0.030761
+-0.0904343 0.136488 0.021207
+-0.0584473 0.145323 0.0330944
+0.00225674 0.0697235 -0.0336823
+-0.0228155 0.081267 -0.0385568
+0.0290261 0.106116 0.036871
+0.0121361 0.105839 -0.0196306
+-0.0365486 0.12125 -0.0102225
+-0.070219 0.146984 -0.026659
+0.00749947 0.122404 0.035106
+-0.0234912 0.107132 0.0414501
+0.0116034 0.0355849 -0.021581
+-0.0896067 0.0902304 0.0134498
+0.0274272 0.0781922 -0.0230908
+-0.0228318 0.114095 -0.016802
+-0.0510675 0.0598803 0.0316706
+0.0525281 0.0730706 0.0188626
+-0.0503624 0.128323 -0.00347306
+-0.0758088 0.0906346 -0.0139136
+0.0428831 0.0902351 0.0261862
+-0.00171604 0.131316 0.0104838
+-0.0845537 0.143232 0.00516668
+0.0183451 0.0551894 -0.0280076
+-0.0914715 0.128331 0.0382421
+-0.0654644 0.148292 0.0388168
+0.025254 0.122206 0.00192061
+0.0102154 0.0850922 -0.0315035
+-0.0913446 0.12833 0.0392393
+-0.0282035 0.125211 0.0168448
+0.0435793 0.0677809 0.0261624
+-0.014506 0.114132 0.0394731
+0.0146525 0.0927004 0.0511905
+-0.0777124 0.0900603 0.0375253
+0.0426104 0.0723991 0.0281081
+-0.0165087 0.10859 0.0417725
+-0.0293809 0.118905 0.0298455
+-0.0747355 0.161794 -0.0126957
+-0.0194977 0.103001 0.0433214
+-0.0774975 0.111156 0.045792
+-0.0235187 0.0551838 0.0425567
+0.00826699 0.0696219 -0.0321852
+-0.0671246 0.042281 0.0101216
+0.0443577 0.0547836 -0.00632411
+-0.0771697 0.152833 -0.00289126
+-0.0455143 0.0335109 0.00302189
+-0.0154906 0.0744572 0.0558178
+0.0390604 0.0575755 -0.00514174
+-0.0300453 0.0861604 -0.0315778
+0.0243112 0.0999667 -0.0198415
+0.0337476 0.0534432 0.0345417
+-0.0207506 0.0685447 -0.0377382
+-0.0883977 0.0983242 0.022387
+-0.043533 0.162269 0.00566221
+-0.0580451 0.047259 0.00941407
+-0.0435244 0.129538 0.0127129
+-0.0129572 0.163516 -0.016687
+-0.018238 0.0985224 -0.0244062
+-0.0468429 0.132502 0.00641278
+-0.012834 0.128656 0.00349339
+-0.00949586 0.0938956 0.0554931
+0.0405174 0.0829825 -0.0107762
+-0.0306755 0.0409906 0.0514223
+-0.0887381 0.139163 0.03848
+-0.0639163 0.105371 -0.0163736
+0.0319159 0.0876168 0.0427503
+-0.0165553 0.128252 0.0064647
+-0.0695817 0.168848 -0.0261289
+-0.0702082 0.141157 0.0460159
+0.0179624 0.0489942 0.0433049
+0.0363477 0.102053 0.0316389
+-0.029898 0.0385093 -0.0112051
+-0.0687619 0.169445 -0.0540038
+-0.0726588 0.143932 -0.0130219
+0.0162319 0.0849386 -0.0291053
+-0.0620358 0.136971 -0.00707833
+0.0166416 0.0740317 0.0522091
+0.0213347 0.0607071 -0.0262571
+-0.0576194 0.143675 -0.00218012
+-0.0913297 0.148826 0.016141
+-0.0751782 0.152724 -0.0149145
+-0.062838 0.153641 -0.0115615
+-0.0579073 0.152669 0.031812
+-0.0401847 0.173392 -0.00391542
+0.0166876 0.0475243 0.0432195
+-0.0393167 0.0432044 -0.0243027
+0.00658649 0.0945677 -0.0301242
+-0.00883076 0.130134 0.0179537
+-0.0248377 0.0867614 -0.0367865
+0.0135609 0.0343729 -0.0176058
+-0.0367327 0.0739624 -0.0182558
+-0.0891756 0.088886 0.0174542
+-0.0869535 0.131154 0.0468504
+0.00298644 0.131511 0.0079308
+-0.0116778 0.0541503 -0.0336719
+-0.00992638 0.128404 -5.81123e-05
+-0.0544374 0.131586 -0.00508481
+-0.0384968 0.104212 0.0394832
+-0.074384 0.0726496 -0.00763941
+-0.0530656 0.150158 -0.00286677
+-0.0166345 0.0465837 -0.0289175
+0.0567453 0.0707667 0.0204115
+0.0381172 0.0659142 -0.0117557
+0.00256341 0.131601 0.00920655
+0.0391019 0.106936 0.00217583
+-0.0480338 0.0685335 0.039429
+-0.0794876 0.0745597 -0.0035364
+-0.0248661 0.101609 -0.0237851
+-0.0647841 0.0448471 0.00913709
+-0.0446647 0.117939 -0.0147658
+-0.0152743 0.180101 -0.0270399
+-0.0859599 0.106341 0.0203569
+0.0111873 0.0893276 -0.0308633
+-0.0922566 0.126816 0.00926569
+-0.0618365 0.166237 -0.0545929
+0.0181719 0.0795251 0.0527143
+-0.0684871 0.120374 0.0527878
+-0.0476953 0.0723623 -0.0159721
+-0.0472614 0.125357 0.0280089
+-0.0494961 0.113894 0.0347794
+-0.0374992 0.0847101 0.0439351
+-0.0404923 0.0620428 0.0412639
+0.0609826 0.0637492 0.0111528
+-0.0849504 0.136625 0.0461206
+0.0337121 0.104741 0.0331059
+-0.00864132 0.0907031 -0.0362798
+0.00988706 0.0373676 0.0450724
+-0.024511 0.0782394 0.0527049
+-0.0716377 0.0368114 0.00909586
+-0.0832904 0.111663 0.0440643
+-0.0156647 0.109623 -0.0201068
+-0.0766606 0.163806 -0.0339802
+0.0165486 0.0631544 0.0502063
+-0.0753023 0.155004 0.00375308
+0.039051 0.0380783 0.00858362
+0.0420573 0.0943632 -0.00379153
+-0.0924935 0.124207 0.0332695
+-0.0745678 0.155931 0.022959
+-0.0348878 0.0336855 0.0122448
+-0.0755817 0.14859 -0.0148673
+-0.0712419 0.0628661 0.0147709
+-0.0722512 0.170824 -0.0490235
+-0.044945 0.146638 -0.00064718
+-0.0327132 0.0383899 -0.00426549
+-0.0656128 0.0626699 -0.00283823
+-0.0615924 0.156857 -0.0275883
+-0.0306139 0.051126 0.0398517
+-0.0552831 0.0478834 0.0286656
+-0.0825962 0.0869865 -0.00556699
+-0.0743429 0.0777095 0.0359578
+-0.00912413 0.125328 0.0309758
+-0.0877256 0.112462 0.0226926
+-0.0624682 0.148372 0.0373168
+-0.0772099 0.0954309 0.0368548
+-0.0657805 0.04031 0.0356744
+0.0390337 0.102562 -0.00454148
+-0.0218167 0.0770677 -0.0388569
+-0.013694 0.165443 -0.0129401
+-0.0242656 0.0588495 -0.0313753
+-0.0201769 0.16108 -0.00474531
+-0.0746468 0.151291 -0.0288803
+-0.0870878 0.147265 0.0324302
+-0.0667973 0.0823343 -0.0181512
+-0.0894818 0.137913 0.0311948
+0.0410937 0.100015 0.0241739
+0.0260496 0.0420955 0.0353242
+-0.0497977 0.134944 0.0250398
+-0.0824554 0.0748386 0.00652396
+-0.0420037 0.0449364 -0.0183222
+-0.00587956 0.107379 -0.0226761
+-0.0298783 0.0719759 -0.0315267
+-0.0649016 0.118019 -0.00923352
+-0.0461849 0.131841 0.0072241
+-0.0384968 0.066293 0.0418062
+-0.0375363 0.128085 0.0104763
+-0.0684218 0.173931 -0.0443685
+-0.0921191 0.131045 0.0262423
+-0.0269088 0.0720784 0.0425891
+-0.0318614 0.109962 -0.0183828
+-0.0576346 0.139576 0.0324737
+-0.0582272 0.151065 0.033498
+-0.0824187 0.0788859 0.0267668
+-0.0386191 0.0474546 -0.0163861
+0.0266281 0.0902434 0.0456585
+-0.00674435 0.0340208 -0.0192827
+0.0167681 0.0348096 -0.0116543
+0.00555478 0.102979 0.0445124
+0.0101351 0.0346886 0.0403762
+-0.0715049 0.147007 0.0421623
+0.0583177 0.0551766 0.00716644
+-0.0774854 0.142838 0.0458543
+-0.0630637 0.0343143 0.0307056
+-0.00979508 0.122843 -0.0101629
+-0.0497184 0.0723081 -0.0156401
+0.0463136 0.0660623 -0.000202599
+-0.0455839 0.0490621 -0.0101677
+-0.0746807 0.110131 0.0436879
+-0.0107636 0.0728162 -0.0377336
+-0.0155087 0.105817 0.0426846
+-0.0419504 0.0338103 -0.0111665
+0.0243299 0.0661738 -0.0239819
+0.0195943 0.041435 -0.0196763
+0.0590873 0.0566489 0.0191831
+-0.0828908 0.120639 -0.00384458
+0.0299951 0.111426 0.0329993
+-0.0685146 0.033856 -0.00470573
+-0.0492135 0.140151 0.00839688
+-0.0489146 0.121146 0.0309679
+-0.00870224 0.0627847 -0.0356447
+-0.086772 0.140601 0.0407491
+-0.0293203 0.0381642 0.0309659
+-0.0330003 0.0497903 -0.0153502
+-0.0425517 0.127843 -0.00110505
+0.0328934 0.0381571 -2.41096e-05
+-0.0525195 0.0426931 0.0456595
+0.021748 0.0349954 0.0225893
+0.00827474 0.123868 -0.00945393
+-0.029563 0.0377844 -0.01791
+-0.0370175 0.163827 -0.00102436
+-0.0664999 0.101466 0.0412188
+0.0064937 0.048929 0.05087
+0.0287604 0.121079 0.0103057
+0.0252285 0.11379 -0.0106368
+-0.0599544 0.0581084 0.014112
+-0.062196 0.154993 0.0273195
+-0.0901963 0.136492 0.0222062
+0.0243441 0.0535282 0.0420575
+-0.0779175 0.0954136 0.0361479
+0.0233436 0.112218 -0.0129499
+-0.0707139 0.0721775 0.0349299
+-0.0640765 0.0658063 0.0313225
+-0.012499 0.112778 0.04085
+0.00184795 0.0345666 0.017115
+-0.0706528 0.0621972 0.0100461
+-0.0885678 0.139164 0.0111992
+-0.0188224 0.0347384 0.0467634
+-0.0867734 0.103584 0.00638913
+0.0585617 0.0692487 0.0195963
+-0.0597919 0.0868174 -0.0202685
+0.00547344 0.0964656 -0.0281399
+0.0206378 0.123881 0.0271063
+-0.0699457 0.0641869 0.00125597
+-0.0625615 0.156051 0.017016
+-0.0417544 0.0339701 -0.0279962
+-0.0649712 0.129694 -0.00875388
+-0.0862104 0.107661 0.0103578
+-0.0932554 0.121405 0.0112928
+-0.0354965 0.0533413 0.0383699
+-0.0288938 0.0821008 0.0456772
+-0.0504899 0.115263 0.0337703
+0.0589314 0.0635744 0.022157
+-0.0186162 0.0391183 0.0377018
+-0.00206852 0.0346139 0.0433223
+-0.0274904 0.108416 0.0392888
+0.0114791 0.0353993 0.0291949
+0.0231094 0.1217 -0.00313916
+-0.0577454 0.0767844 -0.0191155
+-0.00909377 0.175718 -0.0267745
+0.0517415 0.0673755 0.000499527
+-0.0128851 0.164546 -0.0183954
+-0.0673534 0.170861 -0.0570311
+-0.0929853 0.13101 0.0212315
+0.0234643 0.0889079 0.0481435
+-0.088271 0.126713 0.00126975
+-0.0657845 0.0809163 -0.0181411
+-0.0623578 0.139562 0.0361839
+0.0537838 0.0608937 0.0284739
+-0.0417084 0.0681156 -0.0160245
+0.0391698 0.101249 -0.00580082
+0.0314319 0.059214 0.0400505
+-0.0609535 0.135292 0.0364528
+-0.000337321 0.0338454 -0.0216338
+-0.0194278 0.169807 -0.0142312
+-0.0348191 0.0886631 -0.024431
+0.0343015 0.0925788 -0.0159761
+-0.0484766 0.166987 4.90724e-06
+-0.0665297 0.149283 -0.0337543
+-0.0801184 0.0845811 0.0344552
+-0.0728936 0.109289 -0.00959602
+-0.0631344 0.177233 -0.0567528
+-0.0405211 0.16525 0.00379284
+-0.0231365 0.166757 -0.0180638
+0.00733914 0.0539337 -0.0304234
+-0.0448725 0.105637 -0.0203982
+-0.0120489 0.177175 -0.0228491
+-0.0935183 0.117402 0.0193034
+-0.0218743 0.178667 -0.0141782
+0.0371376 0.0728556 -0.0127896
+0.00251304 0.0828672 0.0572444
+-0.0659599 0.128235 -0.00885739
+0.0572369 0.0523165 0.0201815
+0.00234985 0.1177 -0.0168004
+0.0136405 0.0534411 0.0494225
+0.0440001 0.081852 -0.00180195
+-0.0352323 0.0337248 0.00491425
+-0.0852903 0.152844 0.0238067
+-0.0841107 0.0938743 -0.00455389
+-0.0327087 0.156604 0.00170747
+-0.0136478 0.0384232 0.0249573
+0.0203982 0.126887 0.0157559
+-0.0256832 0.0878506 0.050771
+-0.0859766 0.117044 0.000228439
+-0.0275277 0.0660102 0.0388181
+0.0386899 0.0941002 0.0332667
+-0.0072203 0.0994662 -0.0253456
+-0.0387089 0.068094 -0.0155018
+-0.0447414 0.149173 0.00704529
+-0.037003 0.126393 0.0195465
+-0.0691196 0.118603 0.052746
+0.0126876 0.0376693 0.0445214
+0.00235997 0.0496442 -0.0301148
+-0.0852421 0.0804972 0.00551565
+-0.0315104 0.105689 0.0403731
+0.045017 0.0410596 0.00889517
+-0.0645229 0.0335011 -0.00443342
+-0.0237309 0.092173 -0.0338912
+-0.0696939 0.158144 -0.0499358
+-0.00649106 0.116924 0.0392844
+0.0203532 0.0579488 -0.0270415
+0.0454669 0.0761165 0.0216249
+-0.0776599 0.103464 0.0342449
+-0.0732 0.113624 0.050147
+-0.0760799 0.147225 -0.00886324
+0.0300894 0.118197 0.0250757
+0.0134949 0.103141 0.0462202
+-0.0890108 0.142042 0.0341592
+-0.0804084 0.0719394 0.00662383
+-0.0695221 0.143851 -0.0150076
+-0.0608967 0.108264 -0.0166058
+0.024601 0.0954054 -0.0210454
+-0.022965 0.108799 -0.0212234
+-0.0611808 0.060116 0.0210055
+0.0302694 0.104198 -0.014346
+-0.0556068 0.119255 -0.0119973
+0.0521834 0.0709362 0.0231159
+-0.0314011 0.159502 0.00180977
+-0.0393243 0.172677 -0.00992732
+-0.0273795 0.0859709 -0.0356537
+-0.0158141 0.084157 -0.0391976
+-0.0748503 0.150353 0.0378605
+-0.0898842 0.145774 0.0282412
+-0.0830081 0.135296 -0.00152379
+0.00239673 0.0404932 -0.0244502
+0.0427154 0.0482477 0.0316879
+-0.0266384 0.166791 -0.00886205
+0.0140069 0.0433574 0.0445182
+-0.0554949 0.102938 0.0419937
+-0.0535677 0.121244 0.0365515
+-0.091536 0.147482 0.0221363
+-0.0926871 0.118696 0.0103064
+-0.0944412 0.121464 0.0182801
+-0.0562674 0.0521079 0.00770249
+0.0268173 0.0563551 0.0421393
+0.0126767 0.102031 -0.0220157
+-0.0753389 0.14722 -0.0108566
+-0.0856054 0.119006 0.0487694
+-0.0533885 0.122494 -0.00938247
+0.0431078 0.0438619 0.0262578
+-0.0605291 0.0337655 0.01588
+-0.0126252 0.045057 -0.0279244
+-0.045035 0.131096 0.00921538
+-0.0885624 0.127032 0.0457658
+0.040497 0.0569389 0.0314027
+0.0364907 0.111851 0.00455337
+-0.0834729 0.144593 0.00316535
+0.0433385 0.080395 -0.00378638
+-0.0318429 0.0944059 -0.023975
+-0.0484939 0.0747239 0.0424157
+-0.0110217 0.175722 -0.0231509
+0.000137104 0.104495 -0.0221519
+-0.0521218 0.0553341 0.025863
+0.0390662 0.103279 0.0267541
+-0.0365034 0.105591 0.0389607
+0.0135363 0.0347941 0.0319644
+-0.0857201 0.113489 0.0456231
+-0.0225205 0.114038 0.037332
+-0.0424861 0.107068 0.0398635
+-0.0498903 0.161248 0.00701432
+-0.0261589 0.0660162 -0.0325063
+-0.061193 0.167783 -0.0585846
+-0.0153476 0.186173 -0.0245951
+-0.0220085 0.0386415 -0.0116054
+-0.0746541 0.0660086 0.0112783
+-0.0857094 0.107615 0.00636703
+-0.000110081 0.106984 -0.0213197
+-0.0293764 0.039648 0.0531021
+0.028771 0.0495105 -0.0157345
+-0.0168713 0.184583 -0.0192109
+-0.0517714 0.14934 0.0163945
+-0.059475 0.0776368 0.0428908
+-0.0109445 0.0385116 0.00732721
+-0.0636281 0.177112 -0.0556446
+-0.074576 0.0901236 0.0400162
+0.0161292 0.0604031 0.0495734
+0.022982 0.114019 0.0351746
+0.0259399 0.098006 -0.0197455
+-0.0097165 0.0698878 -0.0366754
+-0.069561 0.132665 0.0486469
+-0.0530949 0.0350628 -0.012244
+-0.0680607 0.153823 -0.0498908
+-0.0135439 0.125168 0.0294386
+-0.00340282 0.12679 -0.00651364
+-0.0391911 0.149452 0.000405422
+-0.0764653 0.177807 -0.0519745
+-0.0287178 0.121983 -0.00700749
+-0.0619687 0.155933 0.0215789
+-0.0411389 0.0448599 -0.0213399
+-0.0553956 0.0560936 -0.00341211
+-0.0930152 0.116045 0.0163142
+-0.0538732 0.0634525 0.0320061
+-0.0265911 0.123944 0.0203778
+0.0521155 0.073659 0.0142686
+-0.0733241 0.158247 -0.0319134
+-0.0109096 0.167211 -0.0224966
+-0.0387656 0.0459335 -0.0222844
+-0.0438685 0.104239 -0.0209341
+-0.0404958 0.0464911 0.0408136
+-0.0546568 0.133929 0.033262
+-0.0875345 0.0914089 0.00446769
+0.0213976 0.0505253 -0.0237217
+0.00734362 0.0524803 -0.0298755
+0.0300864 0.0686462 0.0416997
+0.0343005 0.110021 0.028645
+0.0541591 0.0648613 0.0272743
+-0.0267629 0.124714 0.018819
+-0.084006 0.130916 -0.00261237
+-0.032464 0.126152 0.0167563
+0.0411083 0.0816433 -0.00876203
+0.0569799 0.0538694 0.0224893
+-0.0104937 0.0502816 0.0505289
+-0.0809192 0.0899278 0.0336764
+-0.0706578 0.10688 0.0373417
+-0.0634399 0.160562 -0.0195565
+-0.0491873 0.165537 -0.00392571
+-0.0506864 0.137014 0.00141591
+0.0414602 0.0985756 -0.00280597
+-0.0725308 0.161023 -0.0389355
+-0.0593508 0.0339548 0.0212701
+-0.0724089 0.155986 0.0106072
+0.0454654 0.0819915 0.0211715
+-0.0231673 0.169718 -0.0195033
+0.014393 0.129494 0.0163965
+-0.0185111 0.0499058 0.0467842
+-0.0180519 0.128104 0.0102643
+-0.0161793 0.169751 -0.0220442
+0.0178585 0.0957539 -0.0234025
+0.0277062 0.122023 0.0113437
+-0.0356288 0.0533886 -0.010251
+-0.00862621 0.0394649 0.0376552
+-0.0708134 0.0624523 0.0134268
+-0.0338786 0.104305 -0.0212068
+-0.0471517 0.160622 -0.00754132
+-0.0925898 0.124211 0.034269
+-0.0584616 0.0717087 0.039721
+-0.0146591 0.0511639 -0.0318396
+-0.0607891 0.0597911 0.00342454
+0.0222547 0.0819067 -0.0260667
+0.0230644 0.109683 -0.0142211
+-0.0844174 0.110829 0.0409213
+-0.0687289 0.0779401 -0.0161359
+-0.0752643 0.0941545 0.0391883
+-0.0876028 0.105024 0.0163629
+-0.077844 0.114867 -0.00473455
+-0.0325542 0.0341026 -0.0206973
+-0.0589604 0.0340153 0.0230639
+-0.00211759 0.125578 0.0320366
+0.0126989 0.0342761 -0.010037
+0.013184 0.0740073 0.0542309
+-0.0477691 0.130137 0.000614804
+-0.0718381 0.155405 -0.0399144
+-0.0622568 0.148888 -0.00391238
+-0.0159434 0.0385311 0.027994
+0.0373005 0.103362 0.0294506
+-0.02276 0.093942 -0.0316991
+-0.0520122 0.14159 0.0203687
+-0.082015 0.110886 0.0432009
+-0.0745865 0.0720219 0.0307608
+-0.00953059 0.096141 -0.0318625
+-0.0495789 0.046041 -0.00928879
+-0.00423381 0.0382248 0.0479393
+-0.0382126 0.169665 -0.0124129
+0.0318584 0.0981802 0.0392129
+-0.0314643 0.126198 0.0141678
+-0.0622546 0.152185 -0.0195775
+-0.0424907 0.0831788 0.0422885
+-0.0205087 0.18589 -0.0190712
+-0.00369262 0.0366899 0.0482034
+-0.0197122 0.0583602 -0.0339067
+-0.0106092 0.0434444 -0.026227
+0.0245832 0.0562081 -0.0237654
+-0.0891532 0.121635 0.0465292
+-0.0629277 0.161435 -0.0535909
+0.047295 0.0711844 0.0046334
+-0.0417522 0.0782987 -0.0193601
+-0.000496629 0.0828922 0.0574621
+-0.0320822 0.0335961 -0.0276233
+-0.0571072 0.154583 -0.000558004
+0.0584978 0.0634546 0.0229811
+-0.0581231 0.149655 0.0336366
+-0.0619701 0.160031 -0.0245798
+-0.0800787 0.0980611 0.0339873
+-0.0219645 0.0403079 0.0539432
+-0.0699065 0.110817 -0.0106385
+-0.0725366 0.154032 -0.0369032
+-0.0224974 0.0498852 0.046496
+0.00485548 0.0339942 -0.0207847
+-0.0614772 0.0338873 0.0155724
+0.00946392 0.0472926 0.0483305
+-0.019502 0.109944 0.0407387
+-0.0539465 0.0486826 0.012352
+-0.0355502 0.175589 -0.0109785
+-0.0784832 0.155333 0.0128492
+0.0266099 0.122879 0.0123678
+-0.0472066 0.134653 0.0142236
+-0.0078767 0.103255 -0.023393
+-0.0504989 0.101536 0.0421291
+-0.0266231 0.0450263 -0.028096
+-0.0916243 0.131038 0.0282288
+0.0125747 0.0445985 0.0442752
+-0.0196537 0.0480066 -0.0290701
+0.0172432 0.108764 -0.0171862
+-0.0295071 0.0635474 -0.0264265
+-0.0620034 0.040777 0.0431481
+-0.00243593 0.113721 -0.0185019
+-0.0630177 0.135513 -0.00745136
+0.0433285 0.0874073 -0.00479371
+-0.0154888 0.0688106 0.054717
+-0.0882956 0.116235 0.0458325
+-0.0494969 0.0946343 0.044743
+-0.0619637 0.147832 -0.00431835
+-0.092816 0.124239 0.0392636
+-0.0629366 0.147438 -0.0146052
+-0.0782928 0.163856 -0.0319501
+-0.064798 0.174285 -0.0502768
+-0.0112267 0.038611 -0.000125945
+-0.0820175 0.148708 0.00217249
+0.0401192 0.0979552 0.0282751
+-0.0877344 0.132461 0.0447656
+-0.050513 0.143196 0.0143929
+0.0136958 0.0672461 0.0531523
+-0.0608764 0.033777 0.0140174
+0.00552563 0.0813962 0.0561869
+-0.0768476 0.148423 0.040238
+-0.0306152 0.0552238 -0.0173804
+-0.0567885 0.123073 -0.00794084
+-0.0255089 0.119394 0.0308336
+0.0223261 0.116663 0.0342169
+-0.0475261 0.0335634 -0.00837623
+-0.0582936 0.157998 0.00361947
+0.0051303 0.105879 -0.0208781
+-0.00896496 0.0383664 0.01874
+-0.0444005 0.0336982 -0.00787213
+-0.00659427 0.0391448 -0.0257394
+-0.0414965 0.0424145 0.0425934
+-0.0846517 0.135301 0.0472783
+-0.0634992 0.0973124 0.0426152
+-0.0488679 0.135513 0.00441971
+0.037597 0.0883595 -0.0147642
+-0.00186878 0.0388962 0.0287527
+-0.028023 0.0380941 0.0277005
+-0.0474992 0.0718408 0.0410603
+-0.0899231 0.113261 0.00935255
+0.044663 0.094574 0.0141596
+-0.0613242 0.174126 -0.0596453
+0.0131192 0.0913894 0.0524895
+0.0569982 0.0642691 0.00177262
+0.029911 0.120086 0.0121698
+-0.0341992 0.124637 -0.00378015
+-0.0714932 0.121802 0.0535223
+-0.060211 0.120578 -0.00928669
+0.0514409 0.0718132 0.00596213
+-0.0055446 0.0384588 0.0102869
+0.0401137 0.0933035 -0.00871241
+-0.077868 0.12372 -0.00684832
+-0.0438994 0.148485 -0.00356582
+-0.0478093 0.0898718 -0.0219802
+-0.050356 0.0501549 0.0156949
+-0.044116 0.168361 -0.0078879
+0.0274031 0.12156 0.0212208
+-0.0198084 0.119865 -0.0108751
+-0.00808629 0.0392239 0.0361848
+-0.074679 0.177203 -0.0452121
+-0.0717079 0.162415 -0.0429474
+-0.0817249 0.153192 0.027965
+-0.0830361 0.0952877 0.0313817
+-0.0410879 0.12806 0.000341883
+-0.0268762 0.104433 -0.0231038
+-0.028867 0.0620809 -0.0264195
+0.0400441 0.0834026 0.0333734
+0.00148401 0.0427923 0.0460657
+-0.021597 0.124211 0.0236359
+-0.0493581 0.0389276 0.0456407
+-0.0251636 0.119759 -0.0107128
+-0.0305455 0.0776911 -0.0335901
+0.0434944 0.0719976 -0.00179535
+-0.0730641 0.148297 -0.027137
+-0.0403032 0.0335749 -0.0236075
+-0.0838696 0.117633 -0.00194246
+-0.0183958 0.0360837 -0.0274195
+0.0306925 0.119003 0.0181751
+-0.0287719 0.0876257 0.045371
+-0.0150862 0.116786 -0.0157023
+-0.0226105 0.0393974 -0.0288175
+-0.00549593 0.114185 0.0409403
+0.0172148 0.0820814 -0.0286624
+0.0204946 0.0878829 0.0490965
+0.0144377 0.119508 -0.0127985
+0.0084105 0.0389663 -0.0233493
+0.042717 0.0705281 -0.00378792
+-0.0721585 0.0349122 0.00711943
+-0.0700117 0.176166 -0.0463861
+-0.0559881 0.0594067 0.0225062
+-0.0934924 0.121416 0.0122906
+0.0386755 0.101225 -0.00680717
+-0.00386806 0.105937 -0.0224388
+-0.0104995 0.091174 0.0564817
+-0.0012394 0.131315 0.00922853
+-0.0497873 0.0855205 -0.0216876
+-0.0168713 0.104463 -0.0227606
+0.0101956 0.0865002 -0.0314726
+-0.0534959 0.108443 0.038977
+-0.0548951 0.0610993 0.0270145
+-0.0755046 0.137255 0.0498073
+-0.0485754 0.0489523 -0.00913959
+-0.0331264 0.163719 -0.0148995
+-0.00945074 0.100225 0.0471086
+-0.0342862 0.0340473 0.0246456
+-0.0294128 0.0335741 -0.023325
+-0.026685 0.0349864 0.0500364
+-0.061923 0.12237 -0.00883821
+0.0501668 0.0567787 0.0302284
+-0.011856 0.127622 0.0255897
+-0.0429498 0.0338754 -0.00590515
+-0.000398209 0.131157 0.00667235
+-0.0163397 0.112374 -0.0190184
+-0.0651151 0.138224 0.0409979
+0.0355326 0.0544702 -0.00765701
+0.0264528 0.0348348 0.00531809
+-0.0438555 0.101385 -0.0214526
+-0.0234974 0.0498976 0.0468652
+-0.0436816 0.0651561 -0.0146099
+-0.00750789 0.0386054 0.00429878
+-0.0494719 0.0643044 0.0356628
+-0.0857911 0.0847131 0.0234468
+0.0202388 0.0735294 -0.0276011
+-0.0826135 0.153724 0.024657
+0.0377117 0.0799594 -0.0137509
+-0.0629014 0.0384346 0.017326
+-0.0564952 0.112508 0.0359017
+-0.00450514 0.0647631 0.0563697
+0.0228849 0.0849076 0.049031
+-0.0136101 0.17129 -0.0181213
+-0.0659308 0.168025 -0.05906
+0.00616007 0.130231 0.0233995
+0.0200475 0.0355684 0.0326031
+0.0207235 0.0355731 0.0309275
+-0.0914203 0.133738 0.0192152
+-0.0894168 0.0942943 0.0184246
+-0.0486795 0.137079 0.00840446
+-0.0268516 0.0981872 -0.024073
+-0.0296061 0.0499557 0.0431146
+-0.0645444 0.136771 0.0400377
+0.00960463 0.0369501 0.029234
+-0.0077992 0.0826766 -0.0378216
+-0.0705096 0.145613 0.0431794
+0.038042 0.109981 0.0137429
+-0.0323904 0.0346717 0.0421656
+0.0166765 0.12456 0.0286792
+0.0496183 0.0673428 0.0005193
+-0.0256005 0.175695 -0.0107936
+-0.0178219 0.0896296 -0.0373512
+-0.010186 0.0339025 -0.0217341
+-0.047823 0.0912927 -0.0217091
+0.0214379 0.121585 -0.00505488
+-0.063535 0.0741856 0.0400495
+-0.0175015 0.119559 0.0348485
+0.0378045 0.0701003 -0.0128173
+-0.06064 0.140962 -0.00527103
+-0.0745647 0.162191 -0.0132518
+0.0175747 0.0931801 -0.024649
+-0.0413443 0.159411 0.00325579
+-0.0692325 0.161954 -0.0115912
+-0.0598828 0.104039 -0.0184233
+-0.0275135 0.111195 0.0372083
+0.017284 0.0435398 0.0440147
+-0.043478 0.0633766 0.0405033
+0.0234516 0.0389975 0.0363054
+-0.0705331 0.144185 0.0442754
+-0.00248752 0.0897873 0.0564419
+-0.0728742 0.149812 -0.0379734
+0.0462595 0.0834414 0.00917612
+0.00549045 0.0459551 0.048539
+0.038562 0.0568882 0.0311978
+-0.0404973 0.10005 0.041322
+-0.0633155 0.125546 0.0454063
+-0.0425091 0.0520201 0.0393163
+0.00748602 0.041302 0.0454759
+-0.0652746 0.0378654 0.0394026
+-0.0208078 0.081314 -0.039065
+0.00735987 0.131518 0.0123881
+-0.0507686 0.0812185 -0.0210302
+0.0289317 0.0369927 0.000264038
+-0.0895362 0.119938 0.00329723
+0.0339261 0.0564017 0.0366181
+0.0387571 0.0780554 0.0349576
+-0.00249465 0.111426 0.042426
+0.0312166 0.0814571 -0.0197537
+0.00710696 0.112707 -0.0194319
+0.0182552 0.0736117 -0.028651
+-0.0747384 0.149908 -0.0288721
+-0.0142729 0.16729 -0.0212151
+-0.0796554 0.0776931 0.0301108
+-0.0308995 0.0385461 -0.0114399
+-0.0135011 0.162185 -0.0138332
+-0.062358 0.172308 -0.0618736
+-0.0779551 0.131028 -0.00606492
+0.0053093 0.0610791 -0.0314051
+-0.0622044 0.163118 -0.0415929
+-0.0875561 0.0900472 0.00346813
+-0.0693763 0.0627096 0.00438827
+0.0577316 0.0594186 0.0235899
+-0.076964 0.0686471 0.0102516
+-0.068516 0.156454 -0.00263594
+-0.0116226 0.0389602 0.0338935
+-0.053617 0.0500325 0.0119809
+0.0600963 0.059514 0.00816569
+-0.0667396 0.168684 -0.03081
+0.0461456 0.0820314 0.0061875
+-0.0433217 0.0391871 0.0438385
+0.0426589 0.0598822 -0.00401987
+-0.0496436 0.132456 0.0281905
+0.0526393 0.0635217 0.0285801
+0.0276786 0.107363 -0.0137282
+0.0429561 0.100122 0.0141624
+0.0420203 0.102869 0.0111608
+0.0352633 0.113355 0.0198926
+-0.0527821 0.0840792 -0.0215781
+-0.0731314 0.179106 -0.0550054
+-0.0772542 0.116219 0.0507045
+-0.0448961 0.131042 0.0121815
+-0.0659423 0.149401 -0.0328697
+-0.00381497 0.0882175 -0.036071
+-0.00434542 0.130565 0.019581
+0.0267602 0.0365817 2.43485e-05
+0.0169695 0.107204 -0.0175448
+-0.062502 0.0625858 0.0256444
+-0.00350098 0.0815126 0.05747
+0.000251433 0.0712294 -0.0349609
+-0.0113059 0.174226 -0.0217772
+-0.0348319 0.0943645 -0.0236767
+-0.0786972 0.0940445 0.0355566
+0.0177903 0.112808 -0.0155711
+-0.0318198 0.0887354 -0.0251772
+-0.0198038 0.0827175 -0.0390158
+-0.0190696 0.126125 0.000571573
+-0.0793168 0.102079 0.0331119
+0.021502 0.109802 0.0384228
+-0.0927296 0.124224 0.0362665
+-0.0209485 0.0682779 0.0508919
+0.041224 0.101389 -0.000814438
+-0.0468126 0.0898791 -0.022022
+-0.0348994 0.124334 -0.00549397
+-0.0341879 0.127198 0.0131711
+-0.049291 0.131272 -0.000642386
+-0.0359021 0.0337218 0.00658675
+-0.0837824 0.091132 -0.00556609
+-0.0335134 0.101547 0.0420338
+0.0210931 0.0429808 -0.0187308
+0.0424902 0.0555855 0.0321183
+-0.0557185 0.0570014 0.011057
+-0.0194912 0.112675 0.0392933
+-0.025189 0.156576 -0.00769163
+0.0400265 0.10701 0.00816505
+-0.0540901 0.153118 -0.00271435
+-0.00486253 0.101638 -0.0232055
+-0.0436472 0.0338067 0.00674466
+-0.0211436 0.168262 -0.0193322
+-0.0763578 0.141673 -0.00573846
+0.0465682 0.041911 0.0139236
+-0.0534989 0.109802 0.0378386
+-0.0811057 0.0748245 0.0195385
+0.0366496 0.0848209 0.0372394
+0.0520606 0.0608742 0.0294954
+-0.0810176 0.109646 0.0372868
+0.0260062 0.121547 0.0249766
+-0.0134941 0.0773082 0.0569169
+-0.0759274 0.108411 0.0376421
+0.0131577 0.0548631 0.0504935
+-0.0556243 0.0335264 0.0117574
+-0.0445311 0.119183 -0.0140568
+-0.0651138 0.155569 0.0262833
+0.0254608 0.100767 0.0422505
+-0.0354939 0.101471 0.0414493
+-0.0526525 0.152155 0.0150192
+-0.0578899 0.111162 -0.0167182
+-0.050471 0.0571806 0.032579
+-0.0881725 0.103664 0.0113862
+-0.0124346 0.0985527 -0.0264295
+0.0459022 0.0876188 0.00817319
+-0.0598831 0.0337324 0.0142605
+0.0420206 0.092566 0.0274869
+-0.0622887 0.152203 -0.0145776
+-0.0483961 0.150684 0.0105827
+0.00023463 0.0985537 -0.0263753
+-0.0719091 0.107919 -0.010771
+0.0379248 0.0575872 0.0318029
+-0.0684803 0.169194 -0.0285889
+-0.0388617 0.099995 -0.0218283
+-0.0776097 0.0796169 0.0342011
+0.00633113 0.0553726 -0.0306713
+0.0163088 0.048977 0.0444188
+-0.0838449 0.0817176 0.00149669
+-0.0216263 0.0341828 -0.0204844
+-0.0187634 0.0728738 -0.0388715
+-0.0626025 0.0388129 0.0247151
+-0.0373475 0.0347779 0.0107604
+-0.00558664 0.0376733 -0.0253626
+0.0599615 0.0678313 0.0171716
+-0.0295401 0.0904607 -0.0275932
+0.0284451 0.114053 0.0325229
+0.0418253 0.0830818 -0.00779351
+0.00746772 0.0343056 0.0166757
+-0.0865698 0.0833108 0.0104907
+-0.0729271 0.151083 0.037025
+-0.0781924 0.155673 0.0158655
+-0.0788514 0.116332 -0.0048797
+0.00512317 0.107303 -0.0203142
+-0.0103272 0.0383585 0.0166568
+-0.0348025 0.040194 -0.0297923
+-0.000491404 0.0814979 0.0573536
+-0.0290382 0.16386 -0.00530596
+-0.0694805 0.121794 0.053195
+-0.0704544 0.150585 -0.0434585
+-0.0639717 0.0459278 0.00771742
+-0.03056 0.124009 -0.00164624
+0.0144021 0.0780973 0.054252
+-0.0808546 0.140749 0.0461596
+0.0103353 0.0581557 -0.0299403
+-0.00949578 0.084298 0.0576062
+-0.0249013 0.0382346 0.0282196
+-0.0316389 0.0409999 0.051064
+0.0387381 0.0381712 0.0065938
+-0.0580729 0.0345066 0.0402882
+-0.0663198 0.150167 -0.0356652
+-0.064292 0.168172 -0.0605879
+-0.0314424 0.0679449 -0.0244554
+0.0603913 0.0595429 0.0161691
+0.0102649 0.129908 0.00205228
+-0.0440813 0.0336392 -0.0114358
+0.0309277 0.0497348 -0.00874
+-0.0267697 0.0750695 0.0452054
+-0.0791015 0.170034 -0.0382691
+-0.0864283 0.0954013 0.00141653
+0.00852849 0.0646614 0.0551736
+0.0473561 0.0503594 -0.00438005
+0.039601 0.107391 0.00564087
+-0.0861267 0.0833147 0.0194823
+-0.0786738 0.10815 0.0335843
+0.043481 0.0832455 0.0271768
+0.0281352 0.0915776 0.0443357
+-0.0298099 0.0677811 -0.0284707
+-0.0229012 0.115018 -0.0157633
+-0.0270064 0.0808968 0.0494715
+0.0404227 0.0885874 -0.0107894
+-0.087216 0.0937177 0.0257149
+-0.0690509 0.0654544 -0.0025414
+-0.0695527 0.04187 0.00402445
+0.00429234 0.0668529 -0.0329804
+-0.046755 0.0336866 -0.0157033
+0.0576125 0.0580597 0.0234109
+-0.000994561 0.129288 -0.0011666
+0.0454245 0.0904044 0.0131633
+-0.0438081 0.0899046 -0.0222231
+0.0199328 0.127154 0.0141603
+0.0114882 0.0963254 0.0495798
+0.0218142 0.117368 -0.0105004
+-0.0438465 0.0359346 0.00839642
+-0.0714426 0.0632696 0.00712846
+-0.0759079 0.150006 -0.00888842
+-0.06794 0.126772 -0.00890268
+-0.0343726 0.127227 0.0072164
+0.0578211 0.0537494 0.00717652
+-0.0483087 0.135537 0.00740851
+-0.0568342 0.0666429 0.0356476
+0.0481112 0.0431114 0.00725444
+-0.0425043 0.117982 0.0312159
+0.0144699 0.0976455 0.0479677
+0.0563061 0.0508424 0.00620646
+-0.0300578 0.163895 -0.00500569
+0.0102245 0.0823018 -0.0318649
+0.0598453 0.0608733 0.0191849
+-0.0620027 0.172528 -0.0545971
+-0.0197571 0.0971344 0.046022
+-0.0611783 0.167226 -0.0592729
+-0.00613038 0.0999315 0.0488982
+0.0488619 0.047436 -0.000620948
+-0.0208111 0.118967 -0.0119295
+0.00352005 0.0786345 0.0561775
+-0.071061 0.15959 -0.0439233
+-0.0765957 0.161076 -0.0289322
+0.0259255 0.123359 0.0149571
+-0.0746094 0.14858 -0.0188631
+0.0569296 0.058069 0.024171
+-0.0338241 0.152569 -0.00489392
+-0.0455023 0.0615609 0.0388319
+-0.0654625 0.143948 0.0405383
+-0.0560519 0.0345032 0.0407254
+-0.0709341 0.162789 -0.0122264
+-0.078067 0.144487 -0.00381208
+-0.094099 0.121442 0.0152795
+-0.00327736 0.0410332 0.0476549
+-0.0500433 0.165539 -0.00195268
+-0.0774288 0.0712256 0.0238415
+-0.00725841 0.0408714 0.048906
+-0.0833667 0.142023 0.0429747
+-0.0692361 0.153199 0.0337122
+-0.0360543 0.0398378 -0.0294769
+-0.0403231 0.0344611 0.0371557
+-0.0207576 0.069984 -0.0381379
+0.0122374 0.0737871 -0.031159
+-0.0241603 0.0665253 0.044272
+0.0399369 0.0860773 0.0331939
+-0.0809073 0.123633 -0.00507492
+-0.00964827 0.166616 -0.0197629
+-0.00664529 0.1307 0.0129838
+-0.0209361 0.0381808 0.0128466
+-0.0538563 0.0970443 -0.0219059
+-0.0662078 0.0723697 0.0374848
+-0.0398566 0.099981 -0.0216989
+-0.0494761 0.0600183 0.034326
+-0.0157667 0.0742966 -0.0389627
+-0.0875711 0.0977385 0.0245274
+-0.0529166 0.0566407 0.0191372
+0.000745542 0.0955759 -0.0312149
+-0.0688619 0.10089 -0.0150284
+-0.0130273 0.178658 -0.0225027
+-0.00548585 0.118301 0.0387556
+-0.063934 0.169417 -0.04458
+0.00224686 0.131192 0.0191047
+-0.0526917 0.0662141 -0.0112413
+0.0316126 0.104759 0.0353509
+0.0222548 0.0776918 -0.0264111
+-0.0685061 0.105552 0.0384458
+-0.0576201 0.135609 -0.00546838
+-0.00760577 0.128788 -0.000526473
+-0.0262755 0.0383516 -0.00662702
+0.0096904 0.0344726 -0.0051827
+0.0183649 0.0355244 -0.0106716
+-0.0892922 0.0996701 0.0134013
+-0.0748707 0.116421 -0.00675171
+-0.054019 0.0333099 0.015848
+-0.0927402 0.125562 0.0292626
+-0.00859312 0.0384098 0.0205847
+-0.0574617 0.0399955 0.0466824
+-0.0890962 0.0996533 0.0114017
+-0.0393675 0.120945 -0.0119262
+-0.0498057 0.144755 0.010389
+-0.0800056 0.108388 0.0313605
+-0.0694061 0.153071 -0.0482738
+-0.0529002 0.0701503 0.0387731
+-0.00979568 0.178776 -0.0277733
+-0.0749384 0.177982 -0.0467773
+-0.080224 0.0913049 0.0343483
+0.0274404 0.0399547 -0.00370609
+0.0064659 0.11274 0.0407332
+-0.0218179 0.0350986 -0.0195001
+-0.0723907 0.151114 -0.0412874
+0.00590733 0.0340449 -0.020637
+0.0460177 0.0800284 0.0189631
+-0.0576496 0.0629466 -0.00612077
+-0.0519433 0.0503866 0.0326949
+0.0377573 0.0757194 -0.0117756
+0.0434133 0.0930689 -0.00182579
+-0.0445007 0.165214 0.00483168
+-0.0196553 0.063928 0.0497256
+-0.0766812 0.154876 -0.00631355
+-0.0344859 0.0335245 -0.0299041
+0.0132509 0.0349689 -0.0195966
+-0.0264467 0.0459901 0.0505652
+-0.00131456 0.122836 -0.0102349
+0.0122169 0.129551 0.00276868
+-0.0137494 0.0383366 0.00873382
+-0.0445005 0.116602 0.0322264
+-0.0346258 0.0408721 -0.0296689
+-0.0706305 0.0401508 0.00122659
+-0.0765009 0.0716493 0.0271716
+-0.0708234 0.155869 0.0257344
+-0.0311277 0.0566897 -0.0153882
+-0.0896944 0.133694 0.0395953
+0.000231967 0.0783204 -0.0356621
+0.0338144 0.115724 0.00791606
+-0.0300912 0.15662 0.000215848
+0.0464982 0.0677769 0.0257597
+-0.0214151 0.0595466 0.0459898
+-0.0572298 0.0696188 0.0382761
+0.0366123 0.064635 0.0370437
+-0.0264937 0.0973851 0.0437224
+0.0404949 0.0513767 0.0324659
+-0.0350844 0.107815 -0.0201106
+-0.0205025 0.0486482 0.0489372
+-0.0610181 0.13697 -0.00676267
+-0.0906044 0.135075 0.015212
+-0.0194066 0.174211 -0.0159442
+-0.0394983 0.0719214 0.0419294
+-0.0883414 0.120307 0.04718
+-0.00748928 0.0978336 0.0520944
+-0.0846404 0.107661 0.0233457
+-0.0214945 0.10716 0.0418366
+0.0181073 0.0398088 -0.0196993
+0.0190777 0.0384168 -0.0157069
+-0.0636502 0.159498 -0.051954
+0.0283128 0.0754542 0.0444772
+-0.054074 0.15164 -0.0027148
+-0.083614 0.154208 0.0184012
+-0.056485 0.0343785 0.0390076
+0.0337482 0.102096 0.0349353
+-0.0782584 0.1764 -0.0490322
+0.0136057 0.0460076 0.0440344
+-0.00550326 0.0801395 0.0576107
+0.0334132 0.0849144 0.041374
+-0.0113988 0.126257 0.0287047
+-0.0655972 0.169628 -0.0389928
+-0.0832568 0.154212 0.0141255
+-0.0820934 0.0898659 0.0320222
+-0.067283 0.17966 -0.0595334
+-0.062529 0.150617 -0.0195776
+-0.0299377 0.0847457 -0.0326018
+0.0607552 0.0664989 0.0131533
+-0.0228597 0.101618 -0.023963
+-0.0618668 0.165619 -0.0600772
+-0.081854 0.0937329 -0.00756112
+-0.0679516 0.170855 -0.0560296
+-0.0295118 0.108456 0.0388793
+0.0482509 0.0539799 0.0309574
+0.00823122 0.079605 -0.0335706
+-0.0526044 0.041455 0.0460966
+-0.0496802 0.165544 -0.00294037
+-0.0910152 0.129688 0.0372352
+-0.0404973 0.0972715 0.0419896
+0.00850648 0.0772375 0.0559821
+-0.0717922 0.153989 -0.0428988
+-0.0507334 0.147965 -0.00270623
+0.0127323 0.0860509 0.0536553
+0.0565626 0.0508082 0.0192018
+-0.047499 0.10845 0.0392246
+-0.00917487 0.0875708 -0.0370938
+-0.0783316 0.0788746 0.032897
+-0.0896787 0.135012 0.00721892
+0.00550113 0.0883518 0.0561015
+-0.0423419 0.0335706 -0.0240051
+0.0405574 0.104219 0.0191648
+0.00286437 0.130486 0.00148286
+-0.0643911 0.133918 0.0402655
+-0.0620868 0.139878 -0.00655442
+-0.0557051 0.12209 -0.00891575
+0.0589396 0.0566475 0.0201757
+0.0386112 0.0603508 -0.0077511
+-0.0806595 0.0855046 -0.00754297
+-0.0718229 0.0965348 -0.0152102
+0.0459498 0.0806271 0.0191734
+-0.0515557 0.141366 0.000880581
+-0.0859779 0.0910726 0.0273961
+-0.0194809 0.0757644 0.0547346
+-0.0526104 0.0335154 0.00699108
+-0.080479 0.155159 0.0180021
+-0.0500595 0.117739 -0.014504
+-0.0638596 0.0939187 -0.018635
+-0.0469776 0.034208 0.0289371
+0.0315208 0.0994913 0.038731
+0.0444927 0.0610909 0.0304355
+0.0212529 0.1262 0.0189269
+-0.0254692 0.0509386 0.0434079
+0.0476579 0.0715472 0.019969
+0.022698 0.118017 -0.00920048
+-0.0384222 0.125448 0.0219859
+-0.038314 0.170034 -0.0122167
+-0.0530543 0.14469 0.0223994
+-0.00492317 0.0389099 -0.00470281
+0.0373499 0.0533605 -0.00643641
+-0.0696712 0.171569 -0.0347594
+0.0436954 0.0959268 0.0201595
+0.0285253 0.065965 0.0429423
+-0.0466394 0.0345455 0.0392313
+0.0412883 0.0886287 0.0299331
+-0.0251747 0.0383636 -0.0175696
+-0.0674763 0.168038 -0.0560148
+-0.0634115 0.166723 -0.0396505
+-0.0443984 0.0671335 0.0404051
+-0.0524987 0.100127 0.0423619
+-0.0837023 0.110333 0.0361338
+-0.0757541 0.0819089 0.037226
+-0.0475033 0.0973719 0.0436212
+-0.0418104 0.0899475 -0.0227382
+-0.0308563 0.174216 -0.00433975
+-0.00771604 0.130016 0.0212618
+-0.0691125 0.156051 0.011784
+-0.049655 0.0664173 -0.0130805
+0.0212145 0.0401172 -0.0107008
+-0.0418108 0.128972 0.0103834
+-0.0623408 0.164683 -0.0455908
+-0.0776167 0.145877 -0.00384676
+0.0294578 0.079544 0.0444105
+-0.052057 0.15088 0.0153954
+0.0551015 0.0521065 0.00221795
+-0.0568769 0.116868 -0.0135067
+-0.0856284 0.151402 0.00824006
+-0.0512523 0.116429 -0.0151143
+-0.0568623 0.0941345 -0.0215512
+-0.0153943 0.099814 0.0443638
+0.0368805 0.101462 -0.00941022
+-0.0293998 0.0355494 -0.0195486
+-0.040872 0.105663 -0.0204372
+-0.0279821 0.0821961 0.0475971
+-0.0106963 0.176084 -0.0292514
+-0.00933224 0.038323 0.0168951
+-0.0792032 0.10313 -0.00756064
+-0.0540718 0.118333 0.0357708
+0.00450074 0.0938217 0.0540732
+-0.0746595 0.15617 0.0170913
+-0.0708414 0.0994113 -0.0147342
+-0.0516111 0.0530832 -0.00753985
+-0.0486234 0.0532712 -0.0094518
+-0.031704 0.172718 -0.00384226
+-0.00272576 0.130091 0.00149765
+-0.092388 0.120024 0.00928585
+-0.037643 0.153612 0.00331291
+0.0356049 0.0577583 0.0355158
+-0.0668801 0.103821 -0.0153002
+0.0379456 0.10977 0.0171703
+0.0191769 0.0959952 -0.0230407
+0.0391807 0.0658814 0.0336832
+-0.0690863 0.0666121 0.0278101
+-0.089106 0.114375 0.0298659
+-0.0216155 0.0436703 -0.028439
+-0.0266188 0.0490904 -0.0254391
+0.000108091 0.0340814 -0.0198793
+-0.0171613 0.159788 -0.00903074
+0.041574 0.0397142 0.0168995
+0.019656 0.0347604 0.000281692
+0.00764804 0.128583 -0.00254334
+-0.0553782 0.151032 0.0287496
+-0.0528315 0.0558373 -0.00742005
+0.0115037 0.109883 0.0397133
+0.03545 0.105907 -0.00815474
+-0.0629114 0.115341 -0.0117985
+-0.0234208 0.172725 -0.0129655
+-0.0890673 0.101028 0.0173829
+0.0236359 0.056409 0.0445932
+-0.0187325 0.0374026 0.0529482
+-0.0394792 0.105608 0.0388858
+0.0151319 0.0603601 0.0498992
+-0.080949 0.137599 -0.00280806
+-0.0546196 0.0345652 0.0426785
+-0.0465281 0.033544 -0.0026564
+0.0395657 0.0998694 -0.00580754
+0.0101223 0.108705 -0.0195083
+-0.0104988 0.09255 0.056119
+0.0330296 0.116688 0.0147767
+-0.0910722 0.141959 0.0151878
+-0.00849613 0.0703395 0.0565554
+-0.0574961 0.0904385 0.0452768
+-0.0530142 0.0490552 0.0256583
+-0.0294931 0.0717523 0.039896
+-0.0311676 0.0348856 0.0474529
+-0.00876366 0.0347363 0.0436201
+-0.0666703 0.0612745 0.0188657
+0.0173575 0.0940342 0.0480767
+0.0284806 0.111435 0.0343318
+-0.0468308 0.0941893 -0.021914
+-0.0265985 0.0562164 -0.027412
+-0.0871843 0.135176 0.0441499
+-0.063207 0.06374 0.0280276
+-0.0345021 0.0647803 0.0405279
+0.0597837 0.0567045 0.0121686
+-0.0474843 0.0818872 0.0439119
+-0.0589237 0.11399 -0.014753
+-0.0490056 0.122549 0.0307687
+0.0548584 0.0611516 -0.00113589
+-0.0458004 0.0353434 -0.021332
+0.00134052 0.0539375 -0.0306386
+-0.0278278 0.177181 -0.00696301
+-0.0427537 0.0783105 -0.0194623
+0.00651372 0.089712 0.0551929
+-0.0494951 0.0819134 0.044146
+0.0305588 0.055351 -0.0157687
+0.0297469 0.0929269 0.0431563
+0.0125099 0.0519837 0.0495237
+0.0459653 0.0806289 0.018177
+-0.053548 0.149321 0.0244145
+-0.0317948 0.0651814 -0.020436
+-0.019834 0.0868717 -0.0379507
+-0.0119886 0.038466 0.00715809
+-0.0770198 0.170132 -0.03325
+-0.0269539 0.17866 -0.00745161
+-0.0756616 0.0695139 0.0239361
+-0.0474944 0.116586 0.0319739
+-0.0671319 0.0355924 0.0145398
+-0.0783661 0.108548 -0.00557568
+-0.0284012 0.0860445 -0.0346283
+0.0257301 0.0379057 0.0280361
+0.00740689 0.0389878 -0.0235836
+-0.0629696 0.131105 0.0405653
+-0.0380606 0.157756 -0.011216
+-0.0361107 0.0459963 0.0412564
+-0.053455 0.0625326 0.0304805
+-0.0731839 0.178324 -0.0475338
+0.0137018 0.0888713 -0.0301465
+-0.0894038 0.140678 0.0331776
+-0.0114925 0.06602 0.0547394
+-0.0853984 0.0872002 -0.00151975
+-0.00957697 0.128995 0.00181181
+0.0571986 0.0536922 0.00517882
+0.0181761 0.0974249 -0.0228373
+0.0414526 0.0425673 -0.000513932
+-0.0423634 0.121318 -0.0123099
+-0.0854479 0.0898939 -0.00155092
+-0.0136017 0.0392183 -0.0267222
+-0.0353577 0.174409 -0.00212011
+-0.0930586 0.122743 0.0102788
+0.0208421 0.0882147 -0.0254487
+0.000267595 0.0697483 -0.0342392
+0.0443612 0.0458824 -0.00271937
+-0.0794062 0.147442 0.0402641
+0.0285362 0.120755 0.0202147
+-0.0354498 0.0346389 0.0415402
+0.0189212 0.0875932 -0.0268145
+-0.0326685 0.0478014 -0.0229356
+0.0213046 0.0374522 0.0382518
+0.0119628 0.111848 -0.018535
+-0.0754368 0.114522 0.050709
+-0.0575342 0.0415089 -0.00843308
+-0.0289002 0.0348381 0.0445217
+-0.0558188 0.0336396 0.0205147
+-0.0294901 0.0946648 0.0450535
+0.0140142 0.0519753 0.0481823
+-0.0499383 0.162625 -0.0047964
+-0.0285131 0.111188 0.0369648
+-0.0777024 0.176292 -0.0501047
+-0.0458377 0.0970756 -0.021885
+-0.0647866 0.167644 -0.0344082
+-0.08472 0.111015 0.033569
+-0.0624074 0.1491 -0.0095736
+0.0455563 0.078849 0.0217954
+0.0386173 0.0673644 -0.0117551
+-0.0516941 0.147804 0.0164166
+-0.0638593 0.0953482 -0.0183667
+-0.0887889 0.117194 0.003272
+-0.0667452 0.0342007 0.0124321
+-0.0921816 0.132336 0.0152245
+-0.0790475 0.168047 -0.0349702
+-0.0445079 0.0424992 0.043443
+-0.0914924 0.12135 0.00727423
+0.00205109 0.0347195 0.0440743
+-0.0757523 0.0687815 0.0210323
+0.0254197 0.0394349 0.0320923
+0.0445209 0.095967 0.011159
+0.00418461 0.0908826 -0.0329329
+-0.0447434 0.0753343 -0.0181391
+0.0465277 0.0497043 0.0301725
+-0.0231678 0.124994 -0.000333927
+-0.0261386 0.0359205 -0.0192491
+0.000314733 0.0597904 -0.0332055
+-0.0664067 0.0336797 0.00582425
+-0.0179785 0.068344 0.053543
+0.0128834 0.035495 0.00385056
+-0.064012 0.0432207 0.0306772
+0.0356112 0.0942094 0.0375896
+0.0433586 0.0589158 -0.00469925
+-0.0741431 0.153026 0.0335308
+-0.0366764 0.0421455 0.0447176
+-0.0616357 0.158429 -0.0245888
+-0.0777899 0.164478 -0.0251991
+-0.0774203 0.177255 -0.0472003
+-0.0723466 0.0663158 0.0221054
+-0.00945876 0.0366145 -0.0165831
+-0.00782909 0.0896438 -0.0364286
+-0.0483458 0.0338972 -0.0143683
+-0.0548931 0.111218 -0.0174922
+0.0263272 0.0545944 -0.0208638
+-0.078467 0.147461 0.0407301
+0.0472196 0.0430325 0.00527833
+0.0313294 0.118714 0.0127065
+-0.00880796 0.0868775 -0.037347
+-0.054028 0.0344996 0.0411656
+-0.00639115 0.121199 -0.012466
+0.0300864 0.0564003 0.0398351
+-0.0790124 0.0782686 0.0315155
+-0.0134683 0.0964232 0.0523159
+-0.0763221 0.159003 -0.0110053
+-0.0600876 0.0367271 0.0456071
+0.0364957 0.049851 0.0316154
+0.00849848 0.0402756 0.0453316
+0.0205837 0.0754832 0.0508919
+-0.071014 0.148895 -0.037822
+0.0170761 0.115474 -0.0144429
+-0.063767 0.0615586 0.0227478
+0.0437965 0.0987467 0.00816432
+-0.0513326 0.0542594 0.0137993
+-0.0414552 0.0341096 -0.00949275
+0.0395669 0.101281 -0.00480928
+-0.0918243 0.128307 0.0322434
+-0.0474749 0.0945717 0.0440635
+-0.0704486 0.16924 -0.0264473
+0.027192 0.101376 -0.017349
+-0.0895884 0.114751 0.0258504
+-0.0713206 0.156784 -0.042915
+0.0384501 0.0914717 0.0346309
+0.0214747 0.0996539 -0.0214946
+-0.0106582 0.0527176 -0.0332954
+0.00773558 0.128847 0.0268569
+0.0202904 0.0912514 -0.02462
+0.00332905 0.0553943 -0.0309954
+-0.0921247 0.116117 0.0353113
+-0.0146765 0.0526113 -0.0325234
+-0.0657759 0.0410192 0.0130518
+0.0587274 0.0538199 0.013179
+0.0291394 0.102042 -0.0160578
+-0.0701142 0.0625797 0.0062174
+0.0457389 0.0876049 0.0111625
+0.00224905 0.118538 -0.0156887
+0.0520156 0.0596733 -0.00368903
+-0.0891532 0.136419 0.0102028
+-0.0400348 0.0344619 0.0337052
+-0.0461887 0.0335082 0.00469546
+-0.0923435 0.115998 0.0113188
+-0.00713141 0.127357 0.0287426
+0.0252624 0.0747714 -0.0251152
+-0.0453044 0.0587827 0.038737
+0.03635 0.0368836 0.00917982
+-0.0527446 0.0753599 -0.0182797
+-0.0728584 0.132623 0.0509226
+-0.00672844 0.0698676 -0.0361675
+0.0413912 0.0459759 -0.00421898
+-0.0201655 0.0348026 0.0446658
+-0.0641545 0.0391804 0.0263583
+-0.00246627 0.111608 -0.0202454
+-0.0134033 0.110892 -0.0194483
+0.043074 0.0401669 0.0073914
+0.0192967 0.0693907 -0.0288221
+-0.0619039 0.16157 -0.0305885
+0.00333358 0.0341967 0.0104872
+0.0421258 0.100042 0.000179811
+-0.0386776 0.11516 -0.0158482
+-0.00807178 0.0386982 0.0276584
+-0.0756134 0.163772 -0.0350068
+-0.0672387 0.155112 0.00519073
+0.0276118 0.053509 0.0397341
+-0.0779406 0.158305 -0.0189233
+-0.00470743 0.0627772 -0.0352137
+0.0325643 0.0981766 0.0384761
+0.0296733 0.0481683 -0.00874324
+0.0113105 0.059545 -0.0296135
+-0.0653574 0.0733073 0.0386226
+-0.0120884 0.101067 0.0439606
+-0.0268179 0.0735627 0.0438663
+-0.0513902 0.0530791 0.0216216
+-0.0678614 0.042287 0.00944731
+-0.0899071 0.133806 0.0352156
+-0.0122404 0.0385117 0.0269697
+-0.0719375 0.16298 -0.0125698
+0.0473212 0.0533258 -0.00537345
+-0.030503 0.0588732 0.0373493
+-0.0905557 0.120241 0.0451196
+0.0219406 0.0388423 0.0393076
+-0.0672891 0.178209 -0.0595336
+0.0302182 0.0535528 0.0382346
+-0.0815406 0.110006 0.0333062
+-0.0477684 0.0811966 -0.0205178
+-0.048671 0.138621 0.0113976
+-0.0562999 0.0506286 -0.00237306
+-0.0854189 0.0791501 0.00750351
+0.000105856 0.117482 -0.0165473
+-0.0624071 0.149633 -0.00268499
+-0.0682914 0.172271 -0.0560251
+-0.0642448 0.0333797 -0.00245942
+0.0203456 0.053671 -0.0267089
+-0.0711203 0.163576 -0.0137477
+-0.0126641 0.0511309 -0.0317686
+-0.066211 0.180426 -0.0565833
+0.0266688 0.0892152 -0.0224539
+0.01736 0.128384 0.0132094
+-0.0541813 0.154195 0.0142529
+-0.0799749 0.0710714 0.0163832
+-0.0379044 0.0336424 -0.0213286
+-0.0747588 0.0669346 0.0175421
+-0.0221189 0.12668 0.005878
+-0.0623544 0.152149 -0.0255836
+0.0137867 0.0377633 0.0443361
+0.0469104 0.0589185 -0.00506663
+-0.0188119 0.0964492 -0.0282644
+-0.000384494 0.130522 0.00237337
+-0.0647338 0.0418755 0.0296857
+-0.0418518 0.0999485 -0.0214177
+-0.0135206 0.0432479 0.0507363
+0.0314548 0.113206 0.0298812
+0.0211096 0.0343656 0.00467028
+0.0493524 0.0516707 -0.00371978
+0.0324504 0.0916248 0.0417895
+-0.0405477 0.118695 -0.0135582
+-0.0421609 0.128746 0.00435225
+0.00852878 0.034888 0.0362651
+-0.0599768 0.12527 -0.00809043
+-0.0624255 0.16468 -0.0465913
+0.0305387 0.114047 0.0302625
+-0.0209297 0.158088 -0.00822134
+-0.00449554 0.0633716 0.0561592
+0.00751849 0.0440876 0.0454461
+-0.0617319 0.160008 -0.0275856
+-0.00111302 0.130629 0.0207594
+-0.000792652 0.0894877 -0.0349748
+-0.0534886 0.0862338 0.0454573
+0.0102426 0.0752832 -0.032327
+-0.0866178 0.151117 0.0269024
+0.00586712 0.0991316 -0.0229749
+-0.018487 0.0772258 0.0557066
+-0.0220963 0.0623062 0.0451655
+-0.0263156 0.124827 0.00142734
+0.00449781 0.0519669 0.0532713
+-0.0318681 0.105727 -0.021166
+-0.034171 0.0822565 -0.0245355
+-0.0160192 0.104518 -0.0227486
+-0.0336086 0.0394857 -0.0301589
+0.0179261 0.0900567 0.048881
+0.028994 0.0915879 0.0438177
+0.0419459 0.0625408 -0.0027477
+-0.0623435 0.161536 -0.0425937
+0.0521127 0.0595383 0.0295528
+0.00603967 0.0344425 -0.0152712
+-0.0200036 0.0384998 -0.0166705
+0.0335055 0.0549395 0.0359782
+0.0413899 0.0475369 -0.00516876
+0.0571049 0.0594437 0.0244408
+-0.0642323 0.124186 0.0475964
+-0.0104933 0.0952299 0.0545267
+0.0183283 0.0593891 -0.0275077
+0.0556724 0.0698728 0.00398853
+0.02895 0.086199 0.0437135
+-0.00575467 0.1008 0.0460186
+-0.0117555 0.0969094 -0.0306933
+-0.0570352 0.129621 -0.00626418
+-0.06396 0.034704 0.0249317
+-0.0269668 0.0674701 -0.0325423
+0.00372222 0.0941665 -0.0317421
+-0.0708312 0.0951391 -0.0158707
+0.0351494 0.0633173 0.038442
+0.0303372 0.119206 0.0194646
+-0.0174811 0.118153 0.0357243
+-0.0928105 0.116053 0.0203106
+-0.012498 0.078722 0.0572931
+0.0102589 0.100444 -0.0223447
+0.0311369 0.0982118 0.0399163
+-0.0870966 0.0995146 0.0044219
+0.0372771 0.100696 0.0312566
+-0.0464652 0.16842 -0.00496016
+-0.0340766 0.172586 -0.0145127
+-0.0632966 0.144361 -0.00960502
+-0.00396533 0.128634 -0.00247998
+-0.0810179 0.0964125 -0.00756981
+-0.0296304 0.159454 -0.0131553
+0.0323433 0.0592178 0.0396143
+0.0171685 0.0490344 0.0439112
+-0.0798847 0.0706373 0.0145533
+0.00550249 0.0758881 0.0564988
+-0.0285046 0.0588067 0.036767
+-0.054422 0.152991 0.0228754
+-0.0663081 0.150341 0.0377708
+-0.0409099 0.173193 -0.0056112
+-0.00259587 0.0391262 -0.0253465
+0.0394316 0.0807401 0.0342345
+0.048793 0.049707 0.0281736
+-0.0225905 0.0365035 -0.0286129
+-0.0185117 0.0387718 -0.0147573
+-0.0889514 0.121274 0.00229944
+0.0255827 0.034587 0.0128177
+-0.0258582 0.100162 -0.023852
+-0.0317095 0.0382098 0.0512104
+-0.0608875 0.104029 -0.0182853
+-0.0577034 0.0591273 0.0216745
+-0.0316861 0.0553325 -0.0133983
+-0.0579004 0.0336435 0.0147513
+-0.050636 0.0604891 -0.0105672
+-0.0484979 0.101507 0.0419588
+-0.0735846 0.159652 -0.032921
+-0.0596849 0.136693 0.0347693
+-0.0527883 0.0490273 0.0246529
+-0.00587038 0.038496 0.0083708
+0.0443161 0.095966 0.0141619
+-0.0355281 0.0832646 0.0432735
+-0.0552893 0.160933 0.00328411
+-0.0694051 0.177621 -0.0490523
+0.0553162 0.0608807 0.0271604
+-0.0115038 0.082913 0.0576973
+0.00149573 0.118307 0.0388892
+-0.0643923 0.178295 -0.0607754
+-0.0696234 0.0702067 -0.00731499
+-0.0684446 0.156174 0.0134711
+-0.0631402 0.158352 -0.0425984
+-0.028277 0.0807444 0.0465032
+-0.0851037 0.143224 0.00618561
+-0.0701909 0.171451 -0.0335218
+-0.0542038 0.149302 0.0263885
+-0.0230864 0.0416339 0.0540702
+-0.0848397 0.124371 0.0492354
+-0.0509437 0.0349503 0.0448676
+0.0147035 0.0490065 0.0456198
+-0.059742 0.156334 0.00641085
+-0.07522 0.0688188 0.0015368
+-0.0196569 0.0390707 0.0375255
+0.0459174 0.0834201 0.0141703
+-0.0785236 0.0894249 -0.0105705
+-0.0200463 0.0893341 0.0549931
+-0.0173075 0.11558 -0.0164072
+0.000516136 0.0760027 0.0580883
+0.042165 0.0859172 -0.00778247
+0.0203197 0.0664896 -0.0280597
+-0.0604906 0.0959808 0.043977
+-0.00180047 0.0840422 -0.0369301
+0.0106204 0.119324 -0.014581
+0.000242427 0.128645 -0.00250259
+-0.0544918 0.0876045 0.0451014
+-0.081252 0.0993542 0.0322994
+0.0225815 0.0632207 0.0466294
+-0.0528036 0.129718 0.0341858
+0.0388075 0.10554 0.0251669
+-0.071237 0.156366 0.0212013
+-0.0419921 0.0349859 0.0415962
+0.0319555 0.0413937 0.028007
+-0.0465003 0.112564 0.0357108
+0.00310161 0.111606 -0.0202814
+0.0306552 0.102095 0.0374778
+0.0158981 0.0576764 0.0492073
+-0.036508 0.127508 0.00348399
+0.0403284 0.0574912 -0.00511853
+-0.06805 0.157495 -0.00534926
+-0.0870566 0.0847034 0.0124776
+-0.0785035 0.127443 0.053282
+0.0093755 0.0479282 -0.0271091
+-0.00151782 0.111398 -0.0200294
+-0.0386619 0.0336282 0.00792475
+-0.0321818 0.0666221 -0.0204419
+-0.0516478 0.0334795 -0.00363494
+-0.0505323 0.0346392 0.0434961
+-0.0871097 0.129792 0.0470428
+-0.00115829 0.0378141 0.0044798
+0.00250327 0.0351261 0.00210209
+0.0232927 0.0720269 -0.0262872
+0.0386441 0.0772022 -0.0107761
+0.00730214 0.0624461 -0.0313742
+-0.0601285 0.0334799 -0.007174
+-0.0311809 0.165241 -0.0158459
+-0.0456556 0.126096 -0.00729728
+0.01482 0.0920349 -0.0274402
+-0.0578658 0.154169 0.0274197
+-0.0766831 0.148629 -0.00786722
+-0.0548976 0.0574275 -0.00541424
+-0.0213746 0.0936314 -0.0333712
+-0.0795038 0.127439 0.0531413
+-0.0719602 0.0381531 0.00797803
+0.0465231 0.0539629 0.0319545
+-0.0327551 0.126411 0.00489661
+-0.0907403 0.135093 0.0162106
+-0.0798437 0.119249 -0.00499812
+-0.0195891 0.186548 -0.0163318
+-0.0336818 0.0474202 0.0430149
+0.0387003 0.0847793 0.034951
+0.005123 0.108732 -0.0201833
+-0.0355723 0.127236 0.00383072
+-0.0593755 0.0706339 0.0387044
+-0.0701237 0.0337481 0.00141754
+-0.0596389 0.0645563 -0.0073211
+-0.0247044 0.0349045 0.050534
+-0.0698349 0.155896 0.010068
+-0.00664542 0.0496313 -0.030799
+-0.0560508 0.049202 -0.00336342
+-0.0846449 0.0777798 0.00851725
+0.0428444 0.0958802 0.0241636
+0.0226208 0.0505695 0.0412719
+-0.0421939 0.165153 -0.0106292
+-0.0530779 0.153128 -0.00337034
+-0.0183995 0.128105 0.0144964
+0.0110096 0.125946 -0.00574203
+0.0135498 0.109816 -0.0183273
+0.0246987 0.1167 0.0323736
+-0.0323986 0.169744 -0.00487272
+0.0414995 0.0513848 0.032599
+-0.0820948 0.0748388 0.0105311
+-0.0771842 0.102138 0.0352151
+-0.0627985 0.161541 -0.0235962
+0.0203907 0.0490438 0.0415331
+-0.0284862 0.120462 -0.00941436
+0.00850898 0.0990197 0.0481875
+0.0181919 0.0781799 0.0527467
+-0.0323958 0.0383608 -0.00233468
+-0.0198811 0.121697 -0.00881459
+-0.0289402 0.154865 -0.00285823
+-0.055522 0.0600566 -0.00554029
+-0.0446949 0.0680713 -0.0159309
+-0.0505296 0.0657745 0.0361047
+0.0251595 0.0995713 -0.0194056
+0.0456643 0.0876028 0.0121678
+-0.0533672 0.143136 0.0253913
+-0.05283 0.138085 0.0270749
+-0.0324865 0.0974182 0.0443398
+0.00543862 0.118556 -0.0157347
+-0.0704807 0.1602 -0.00768602
+0.00476485 0.0378127 -0.0129945
+0.0453303 0.0875809 0.0171699
+0.00844159 0.109753 0.0403226
+0.0199305 0.0645206 0.0480779
+-0.0865012 0.0967606 0.00143514
+0.0239407 0.0433254 -0.00969837
+-0.0464991 0.0818806 0.0436011
+-0.0365053 0.0832925 0.043701
+-0.0511539 0.144707 0.0143676
+-0.0354688 0.0973337 0.0432864
+0.0315086 0.0361416 0.0180806
+-0.0620392 0.152203 -0.0175795
+-0.00174908 0.0726707 -0.0356483
+0.0482658 0.0482112 0.0273759
+0.0205204 0.0686316 0.0489712
+0.0055446 0.129937 0.0246284
+-0.0509363 0.126898 0.0333376
+0.0503401 0.0525815 0.0286903
+-0.0663805 0.0356243 0.0152158
+-0.0631059 0.039729 0.0160762
+-0.0794629 0.0702542 0.0118898
+-0.0440204 0.0437247 -0.0153148
+-0.0258047 0.0811626 -0.0373791
+-0.0654527 0.156561 -0.05302
+-0.0801896 0.0926573 0.034266
+-0.0226625 0.0493576 -0.0281762
+-0.076512 0.15561 -0.00689633
+-0.0316228 0.0384779 -0.00967109
+0.0073096 0.0609801 -0.0307365
+-0.036779 0.0827886 -0.0223365
+-0.0454595 0.0846983 0.0440929
+-0.0310517 0.0636961 -0.0214339
+0.044971 0.0748214 0.0226935
+-0.0245671 0.182966 -0.016053
+-0.0343794 0.125292 -0.00246071
+0.0260218 0.0493062 -0.0196675
+0.00451349 0.0786214 0.0559314
+-0.0272596 0.0409813 0.0537728
+-0.0865558 0.105007 0.0203641
+-0.0427952 0.0347556 0.00787321
+-0.0294944 0.0889496 0.044252
+-0.0691615 0.0832998 0.0419252
+-0.077704 0.175863 -0.0450747
+-0.0595653 0.0407951 0.0449735
+-0.0118194 0.129824 0.0125318
+-0.0304269 0.169744 -0.0072967
+0.00750596 0.0674413 0.055134
+-0.0895098 0.0942825 0.014433
+0.0566953 0.0550372 0.00319006
+0.0358581 0.0995241 -0.0113664
+-0.0541815 0.15229 0.0244282
+-0.0924737 0.125588 0.0362608
+-0.0750911 0.110634 0.0449752
+-0.0272685 0.0368017 0.0538626
+-0.0614955 0.104283 0.0410789
+-0.0721148 0.067315 0.0248191
+0.034236 0.094243 0.0391072
+-0.0724407 0.178857 -0.0487083
+-0.06691 0.033448 -0.00125687
+-0.0660379 0.0349778 0.0329828
+-0.0701097 0.156012 0.00122102
+-0.0157478 0.0352634 0.050467
+-0.0465076 0.160794 0.0071118
+-0.0156218 0.0365183 -0.0177136
+-0.00687536 0.0389886 0.0330493
+0.0201949 0.0959886 -0.0227072
+0.00536718 0.125777 0.0317922
+-0.0689036 0.105186 -0.0135662
+-0.0576505 0.0508003 0.0036576
+-0.0372877 0.0353832 0.0246264
+-0.0766222 0.0824671 -0.0115781
+-0.0570813 0.0344654 0.0405363
+0.0284042 0.0431456 -0.00552671
+-0.078005 0.151454 -0.00188508
+0.00274784 0.0953419 -0.0309592
+-0.0764328 0.147234 -0.00786196
+-0.0187399 0.0656914 -0.0372373
+-0.0626784 0.0670893 0.0340154
+-0.066213 0.0377522 0.0375383
+0.00946024 0.0346841 0.0420404
+-0.00763703 0.046711 -0.0299661
+0.0217664 0.106013 0.0404033
+0.0159395 0.0900955 0.0512828
+-0.0714939 0.126019 0.0527835
+-0.035368 0.122868 0.0260927
+0.0397669 0.0885289 -0.0117744
+-0.0235296 0.159196 -0.00227474
+-0.0299919 0.0383903 -0.00556396
+0.00840449 0.0360838 -0.0229864
+-0.0688351 0.0951745 -0.0162656
+0.0188202 0.124811 0.0265908
+-0.0542034 0.0477679 0.0266683
+-0.00718512 0.0384992 0.0226001
+0.0191993 0.0352366 0.0345338
+-0.0486962 0.13553 0.00541025
+0.0065027 0.0533154 0.0528127
+-0.064997 0.0410349 0.013689
+0.0235192 0.107033 0.0392433
+-0.0526101 0.0632972 -0.0100113
+0.0288769 0.120252 0.0217702
+-0.00882418 0.0896578 -0.0365764
+-0.0563459 0.0335397 0.00260276
+0.0287652 0.114389 -0.00726895
+0.0564669 0.0577845 0.00118215
+-0.0623836 0.163016 -0.0556039
+-0.0235351 0.118111 0.0331575
+0.0443232 0.0889197 0.0231574
+0.0349753 0.114037 0.00545779
+0.0269837 0.108749 0.0374141
+-0.000496913 0.056284 0.0547664
+-0.0889882 0.115854 0.0042936
+-0.0688144 0.0851338 -0.0175228
+-0.0304795 0.0746468 0.0405648
+-0.0616784 0.0692367 -0.0132074
+-0.0554108 0.0334149 -0.00799207
+-0.0610813 0.0342293 0.0311986
+-0.0655517 0.155937 0.0246661
+-0.0767597 0.163153 -0.0191399
+-0.0140741 0.0388251 0.0317136
+-0.02858 0.0731702 0.040795
+-0.0480086 0.134685 0.0198054
+-0.00949027 0.107257 0.0434611
+-0.0224071 0.0510134 0.0440995
+0.0026516 0.0341771 0.00670019
+-0.00282121 0.086807 -0.0363939
+0.00461042 0.092806 -0.0323339
+0.0444404 0.0425371 0.0222477
+-0.0251232 0.0838362 0.0531591
+-0.0711154 0.155676 0.00670049
+-0.0144639 0.0977101 -0.0275565
+-0.0176152 0.0407641 -0.0279656
+-0.0273216 0.038344 -0.00129213
+-0.0781679 0.14865 -0.00288263
+-0.071113 0.171733 -0.033865
+-0.0362701 0.0365605 0.0458807
+-0.0245074 0.0384654 -0.0082311
+-0.0768529 0.106269 -0.00826114
+0.0173624 0.088714 0.0498122
+-0.0872512 0.106353 0.0133638
+-0.0647985 0.124215 0.0485
+0.0274255 0.0686124 0.0431235
+-0.0275944 0.0717748 -0.0345689
+-0.00449702 0.0590031 0.0543234
+-0.00869265 0.0598566 -0.0344628
+-0.0624896 0.106999 0.0393995
+0.00296819 0.0986498 -0.0244883
+-0.0716108 0.0701594 -0.00639514
+-0.0454969 0.0733342 0.042072
+0.0217583 0.0505253 0.0417779
+0.0599479 0.0692188 0.0141571
+0.0159709 0.0859869 -0.0291978
+0.0474137 0.0671743 0.000684928
+0.045537 0.0890033 0.0131643
+0.025235 0.0690602 -0.0242719
+-0.0140104 0.117853 -0.0148385
+-0.0417786 0.156522 0.00614116
+0.0529468 0.0608894 0.0290245
+-0.0623778 0.167137 -0.0608155
+-0.043781 0.0422821 -0.0183128
+0.0194047 0.0727279 0.0509389
+-0.025431 0.180214 -0.00870569
+0.00163035 0.0962275 -0.0299038
+-0.0609057 0.119508 -0.00974426
+-0.0265539 0.180361 -0.00771033
+-0.00586693 0.104511 -0.0229142
+-0.0446124 0.0534121 -0.0108089
+-0.0607974 0.125499 0.0419374
+-0.0676844 0.160922 -0.0559942
+-0.0718937 0.0376106 0.00231258
+-0.0769618 0.103489 0.0349575
+-0.0136243 0.0450811 -0.0280269
+-0.0656393 0.145367 0.0403005
+-0.067848 0.0994807 -0.015636
+-0.0674005 0.156127 0.0138467
+-0.0814089 0.141772 -0.000809353
+0.0343092 0.113032 0.0252402
+-0.0378129 0.0900392 -0.0237743
+0.0410972 0.0779427 0.031296
+-0.0594968 0.104294 0.0413247
+-0.045045 0.0657131 0.0396946
+0.0424943 0.0569701 0.0318321
+0.0380924 0.0618152 0.0338774
+-0.0181385 0.038277 0.0223668
+-0.0680503 0.114246 0.0489904
+-0.089636 0.0902445 0.0164491
+-0.0259323 0.124597 0.000115117
+-0.0341212 0.124555 0.022076
+-0.0117695 0.075665 -0.0382916
+-0.0666005 0.156329 0.0184798
+0.0143467 0.0580862 -0.0289605
+0.00620145 0.0832401 0.0564613
+-0.07299 0.158232 -0.0339184
+0.0179038 0.0866718 -0.0278625
+-0.0447879 0.085543 -0.0216723
+0.0240528 0.0347605 0.00303304
+0.0471472 0.0437632 0.0216364
+-0.0254743 0.105723 0.0415881
+-0.0914335 0.120003 0.00730918
+-0.0381624 0.035793 0.0434599
+-0.0470742 0.127422 -0.00463291
+0.000501079 0.0620074 0.0565701
+-0.0488714 0.104198 -0.020417
+-0.00949444 0.063336 0.0558203
+-0.0227837 0.0742285 -0.0385317
+-0.00949145 0.115547 0.0400498
+-0.0665386 0.0804536 0.042224
+0.00148883 0.121012 0.0365952
+-0.024281 0.069418 0.0457102
+0.019893 0.114777 -0.0136897
+-0.0904011 0.115144 0.0307537
+-0.00370938 0.0627709 -0.0350699
+-0.00367406 0.0555102 -0.0326331
+-0.0125077 0.0773203 0.0572074
+-0.0574951 0.093265 0.0451928
+-0.0942113 0.120123 0.0212925
+-0.0213358 0.165379 -0.00997448
+-0.0615068 0.0789665 0.042503
+0.00239149 0.0343213 0.0156312
+-0.0639126 0.11101 -0.0139478
+0.0381439 0.103967 -0.00387277
+-0.0816033 0.101897 -0.00556882
+-0.0582639 0.12123 0.0402958
+-0.0729322 0.156105 0.0220745
+-0.0514974 0.086244 0.0456131
+-0.0876158 0.137864 0.0416648
+0.0120082 0.0967361 -0.024421
+0.0147782 0.0929392 -0.0263979
+-0.0510555 0.150177 -0.00351578
+-0.0165661 0.163924 -0.0100865
+-0.00519498 0.0390091 -0.00671136
+-0.021716 0.0641363 -0.0354017
+-0.0523357 0.136679 0.027812
+0.0335961 0.0633113 0.0397473
+-0.0384865 0.0492045 0.0394845
+-0.0339969 0.152567 -0.000573454
+0.0175453 0.0645325 0.0499023
+-0.0895247 0.139293 0.0351741
+-0.0870044 0.115772 0.00228167
+-0.0852267 0.0792333 0.0184927
+-0.0927665 0.116031 0.013321
+-0.0240588 0.111793 -0.0183639
+0.0191819 0.123133 0.0296014
+0.0163312 0.0767998 0.0535416
+-0.0834123 0.0856961 -0.00454328
+-0.0614974 0.0904473 0.0454009
+-0.0648003 0.0370671 0.0164284
+-0.0102366 0.125327 0.0306172
+-0.0512935 0.0556822 0.0305914
+-0.0674962 0.0930678 0.0426016
+-0.0707247 0.156767 -0.045914
+-0.0611468 0.0584317 0.0117762
+0.0152753 0.0680849 -0.0302874
+-0.0638387 0.163409 -0.0592654
+0.030267 0.0496887 -0.0107252
+-0.0227695 0.0684387 -0.0367377
+0.0216497 0.065881 0.0470485
+-0.0849335 0.125015 -0.00321773
+-0.0364959 0.0562316 0.0392716
+-0.0132153 0.0406258 0.0508237
+0.00695506 0.0982177 -0.0239936
+0.00047843 0.12713 -0.00487855
+0.0354045 0.046148 -0.00604177
+-0.0913848 0.129679 0.0322355
+-0.0924762 0.124198 0.0322659
+-0.0057025 0.12744 -0.00517306
+0.032332 0.110047 0.0311032
+-0.0374975 0.0662835 0.0416878
+-0.0306651 0.155159 -0.000638202
+0.0161 0.12839 0.0198796
+-0.0392376 0.124806 0.0231803
+0.00131504 0.0597888 -0.0330641
+-0.0445007 0.0931064 0.043109
+-0.0174373 0.0336888 -0.022956
+-0.0536509 0.0343311 0.0291848
+0.0348249 0.110986 -0.0028353
+0.0280633 0.100998 -0.0169482
+0.0423903 0.0490515 -0.00589339
+0.0306614 0.119205 0.0153072
+-0.0604957 0.0876028 0.045161
+-0.0137303 0.0699989 -0.0380502
+-0.00750341 0.130405 0.00835201
+-0.0494799 0.116621 0.0323892
+-0.058737 0.075302 -0.0183386
+-0.0518764 0.0550741 0.0228473
+-0.0293899 0.118762 -0.0116358
+-0.0743199 0.158257 -0.0279194
+-0.0265758 0.0533991 -0.0263925
+-0.047508 0.0903548 0.0442194
+-0.0104972 0.0815462 0.0580111
+-0.0356136 0.0408304 -0.0293778
+-0.0622824 0.159968 -0.0396048
+-0.0727292 0.0730957 -0.00887693
+0.0252321 0.0889244 0.0471615
+0.0362811 0.0443655 0.0298564
+-0.0583717 0.138143 0.0331568
+0.0516174 0.0711387 0.00464104
+0.00649466 0.0427198 0.0454361
+-0.0187116 0.0598792 -0.0350421
+-0.0603468 0.0339987 0.0210215
+0.0310626 0.107429 0.0345663
+-0.0153967 0.0384283 -0.000805549
+0.0390675 0.0617702 -0.00778266
+-0.0718188 0.0907915 -0.0158595
+-0.0066784 0.0569449 -0.0331859
+0.00738229 0.0448872 -0.0251556
+0.0193881 0.0506007 -0.0247336
+-0.0171345 0.165288 -0.0183426
+0.0172728 0.0694422 -0.0295359
+0.0518225 0.072596 0.0200635
+-0.085483 0.140457 0.00319222
+-0.049383 0.140141 0.0133936
+-0.076884 0.155644 0.0221655
+-0.0584972 0.111135 0.0367864
+-0.0264895 0.102963 0.0427118
+-0.016526 0.0387631 -0.00875803
+-0.060493 0.107007 0.0395303
+-0.0133132 0.0385196 -0.000466347
+0.027107 0.0406036 0.0313674
+-0.0852773 0.137655 0.00128094
+-0.0776954 0.16804 -0.0399638
+-0.0465214 0.0505047 0.038174
+-0.0251912 0.178602 -0.0188241
+-0.0524991 0.101502 0.0417298
+-0.0142894 0.184628 -0.0268303
+0.00710791 0.110158 -0.019992
+-0.0766628 0.155608 -0.00789132
+-0.0814761 0.0734707 0.0145404
+-0.0644951 0.0789605 0.0422031
+0.0403539 0.105584 0.00317596
+-0.0633486 0.0371336 0.0178291
+-0.0808831 0.117721 -0.00384392
+-0.0265027 0.10847 0.0397156
+0.0236097 0.121674 0.028372
+-0.0623736 0.164689 -0.0415928
+-0.0495545 0.0404082 -0.0113965
+-0.0562131 0.054804 -0.00139993
+-0.0418518 0.098529 -0.0215916
+0.0133351 0.058103 -0.0291864
+-0.0594448 0.063179 0.0293052
+0.0113019 0.0652847 -0.0308368
+-0.0783582 0.0994351 0.0350546
+-0.0715439 0.0376425 0.00026118
+-0.0154996 0.112736 0.0400881
+0.0417289 0.0704356 -0.00679567
+-0.0406463 0.127804 0.0152535
+-0.0627661 0.170921 -0.0616075
+-0.0923057 0.12017 0.0426167
+-0.00727442 0.0422617 0.0488857
+0.0350851 0.0848737 -0.0178837
+-0.01578 0.128598 0.00819831
+-0.03217 0.0735917 -0.0275208
+-0.0673634 0.110954 0.0392365
+-0.0271001 0.0779439 0.0468281
+-0.0765081 0.156243 -0.00790412
+0.0277565 0.117474 -0.00457839
+-0.0113381 0.0986434 -0.0265191
+-0.0330823 0.0695155 -0.0204574
+-0.0652177 0.144322 -0.0140816
+-0.0094303 0.0379372 -0.0159242
+-0.0245144 0.0945317 -0.028309
+-0.05375 0.0560385 0.0116204
+-0.0679678 0.0383221 0.0123903
+0.00399334 0.0399971 0.0458959
+-0.0841715 0.0870272 0.0285556
+-0.0274573 0.0734015 0.0426855
+-0.0626773 0.153684 -0.0325991
+-0.0741408 0.105214 0.0369385
+-0.0134986 0.081495 0.0573009
+0.0463327 0.0421886 0.017365
+-0.0644937 0.108375 0.0384047
+-0.0653695 0.151233 0.0366147
+-0.018937 0.178659 -0.0169738
+-0.0820692 0.0748107 0.00351555
+-0.0841353 0.146019 0.0379782
+-0.0148578 0.163977 -0.0174595
+-0.0817263 0.0747702 0.00249857
+0.000235601 0.0740952 -0.0356038
+0.000940682 0.0357179 -0.0155776
+-0.0719363 0.129668 -0.0086833
+0.0301411 0.102934 -0.0150039
+-0.0651961 0.0334974 -0.00275965
+-0.0185844 0.16399 -0.00948536
+-0.0592125 0.042121 0.0445708
+7.57538e-05 0.0369473 0.00366537
+0.0152945 0.0666369 -0.0299356
+0.0410157 0.0739041 0.031202
+-0.0577153 0.0344512 0.0421091
+-0.0920793 0.129683 0.0282033
+-0.0497426 0.0753235 -0.0177986
+-0.0484934 0.047761 0.0395051
+-0.0809803 0.104706 0.0304576
+-0.0746935 0.111142 -0.00760178
+0.0204806 0.109788 0.0388648
+-0.0734977 0.128836 0.0522844
+-0.0426178 0.0520018 -0.0109441
+0.0112198 0.0932651 -0.0287439
+-0.0119274 0.182669 -0.0262872
+0.0145534 0.0347576 0.0376203
+-0.0810222 0.100509 -0.00657927
+-0.0033633 0.038102 0.0128662
+-0.0937861 0.128264 0.0182441
+0.0084061 0.0949783 -0.0285638
+-0.0695902 0.113495 0.0492959
+0.000169576 0.131258 0.0183392
+-0.0931626 0.117374 0.0143043
+-0.0195343 0.112367 -0.0190097
+-0.0524215 0.162453 0.00456363
+0.0184901 0.0879016 0.0492476
+-0.0685433 0.170852 -0.0550244
+-0.087182 0.130813 0.00128919
+0.00130454 0.0641388 -0.0343264
+-0.000757317 0.075519 -0.0359212
+0.0308776 0.0902792 0.0430757
+-0.00578939 0.0386518 0.00278679
+-0.076212 0.155059 0.00635026
+-0.0248315 0.0881388 -0.0362597
+-0.0222598 0.160103 -0.0129456
+-0.00877699 0.0770434 -0.0377883
+-0.06674 0.0383979 0.0141071
+-0.00350265 0.0689326 0.0566398
+-0.0295614 0.0861399 -0.0326125
+-0.0286647 0.125711 0.0122564
+-0.0699648 0.0791315 0.0398469
+0.0142764 0.128727 0.0220636
+-0.0638003 0.110914 0.037425
+-0.0719625 0.135504 -0.00769556
+-0.0527869 0.124083 0.0359567
+-0.0467161 0.0738381 -0.0169211
+-0.0117423 0.070003 -0.0378791
+-0.0517809 0.138537 0.023394
+-0.00482205 0.130969 0.0150835
+0.034711 0.0383001 0.0222555
+-0.00127486 0.120883 -0.0121504
+0.0112227 0.0850587 -0.0310098
+-0.0506063 0.0369029 -0.0119734
+0.0433147 0.0831895 0.0275132
+0.0112941 0.127457 0.0281604
+0.0151622 0.122267 0.032438
+0.0400834 0.082061 0.0334038
+-0.0745622 0.152707 -0.0248951
+-0.0528479 0.141625 0.0244146
+0.0245482 0.035172 0.0211866
+-0.0325075 0.11115 0.0364446
+0.0417109 0.0957641 -0.00380547
+-0.00538241 0.130597 0.0192035
+-0.0649174 0.0364897 0.025021
+-0.0770334 0.158982 -0.013085
+-0.0760388 0.148613 -0.0118618
+0.0283559 0.116347 0.030146
+-0.088594 0.121257 0.00130017
+-0.0268076 0.122539 -0.00562189
+-0.0346629 0.0607102 -0.0125376
+0.0413795 0.0505691 -0.00672382
+-0.0906746 0.1365 0.0201946
+0.00951942 0.100425 0.0477045
+-0.0642867 0.172466 -0.0611328
+-0.0242433 0.172722 -0.0123976
+0.00950564 0.0990636 0.0482467
+0.0101664 0.120462 0.0359466
+-0.0187755 0.107692 -0.0220397
+0.0335012 0.0795469 0.0414506
+-0.0834882 0.14321 0.00316117
+-0.0530161 0.141613 0.0254095
+-0.0395373 0.172163 -0.000837254
+0.0387477 0.0589461 -0.0057234
+-0.0647673 0.0795072 -0.0181104
+-0.00140393 0.0361018 0.00962515
+-0.00524162 0.0395598 0.0483202
+0.0236373 0.103743 -0.0178545
+-0.000477761 0.0760312 0.0584165
+-0.0210492 0.0348694 0.0496408
+-0.00244654 0.131114 0.00878185
+-0.033711 0.0384262 -0.00450177
+-0.0745333 0.152696 -0.0258905
+0.055409 0.0509629 0.0218922
+-0.0134774 0.127753 0.000758007
+-0.0120362 0.0388366 0.0321214
+-0.0278604 0.0487672 0.0470543
+0.0327952 0.0713854 0.0403707
+-0.0728362 0.0979301 -0.0143404
+-0.0367225 0.125751 0.02112
+0.0198232 0.0385183 -0.0126921
+-0.0377749 0.150712 0.00133662
+-0.0665966 0.180807 -0.0581921
+-0.0215095 0.114043 0.0376946
+-0.0620515 0.035927 0.0204607
+-0.0584945 0.150006 -0.0011129
+-0.0335992 0.1188 -0.0116562
+0.0196457 0.116633 0.0356159
+0.0248522 0.0685926 0.0446792
+-0.0164926 0.0544756 0.0504072
+-0.051136 0.140067 0.0203692
+-0.089139 0.139182 0.0122002
+0.0163249 0.0580554 -0.0285
+-0.0621816 0.0342254 0.0257179
+-0.0188821 0.0387745 -0.0111028
+-0.053388 0.034491 0.0395762
+-0.000472072 0.130948 0.0195451
+-0.0634988 0.173693 -0.0615446
+-0.054487 0.0452173 0.0438312
+-0.0202902 0.0906146 -0.0362948
+-0.0725702 0.17984 -0.0501722
+-0.0707759 0.162402 -0.0459559
+-0.0463694 0.113628 -0.0162147
+-0.0523573 0.0345285 0.0397607
+-0.0136632 0.0511316 -0.0317578
+-0.00948303 0.0703233 0.0561585
+-0.0852113 0.0869359 0.026743
+-0.0745333 0.0805197 0.0374668
+0.00349251 0.118288 0.0385113
+0.0493697 0.0693787 0.0250272
+0.029581 0.0736246 -0.0217333
+-0.0400646 0.156235 -0.00986121
+-0.0818113 0.136716 0.048659
+-0.0809364 0.129495 -0.00494346
+-0.0875459 0.110452 0.0143395
+0.0253164 0.112728 0.0350367
+-0.0852858 0.0845126 -0.000515374
+0.00212883 0.120316 -0.0135831
+-0.0192664 0.0381478 0.0114056
+0.0493315 0.0589269 -0.00474568
+-0.0183092 0.162495 -0.00732366
+-0.00730789 0.12834 -0.00208974
+-0.0286194 0.180015 -0.014033
+0.0255963 0.0648009 -0.0228004
+-0.00925832 0.177251 -0.027731
+-0.0485485 0.0432385 -0.0107358
+-0.0600861 0.14609 -0.00280453
+-0.026172 0.174158 -0.0190728
+-0.059111 0.0686528 0.0369372
+-0.0434854 0.0944868 0.0426487
+-0.0216341 0.038095 0.0200103
+-0.0670537 0.071446 0.0363402
+-0.0348255 0.0915164 -0.024068
+-0.0202598 0.174222 -0.0154191
+0.0344662 0.114921 0.00815778
+-0.0686919 0.0750175 -0.0147112
+0.026272 0.0789381 -0.0240124
+0.0202522 0.0805604 -0.0270674
+-0.0432329 0.156565 0.00586077
+-0.00650833 0.0787624 0.0577507
+-0.0335034 0.0774945 0.0414157
+-0.0606769 0.0676671 -0.0113119
+-0.0656284 0.162324 -0.0174746
+0.00729944 0.0639619 -0.0320669
+-0.00448657 0.0898027 0.0567005
+-0.0584972 0.0918588 0.045399
+0.00218731 0.0852799 -0.0344916
+-0.0417916 0.0869783 -0.0214259
+0.0463392 0.0489694 -0.00446687
+-0.0389761 0.128486 0.00847309
+0.00727028 0.11232 0.040519
+-0.0234564 0.0680424 0.0463484
+-0.0797185 0.0803984 0.0327643
+0.0232549 0.0645506 0.0458531
+0.0198821 0.0449543 0.0425235
+-0.0394974 0.0902763 0.0431118
+-0.0662858 0.172388 -0.0591199
+0.0259452 0.0364961 0.0239139
+-0.0714148 0.0386609 0.00057855
+-0.0638254 0.0924713 -0.0188016
+-0.0584874 0.112515 0.0360801
+-0.0623619 0.166253 -0.047591
+0.0452758 0.0875665 0.00218329
+-0.0244115 0.0379996 0.0159179
+0.0452209 0.0659646 -0.000116442
+-0.0707693 0.176767 -0.0466577
+-0.0650223 0.156803 -0.0519494
+0.0354173 0.0414682 -0.003097
+-0.0416808 0.0622091 -0.0130274
+0.0326595 0.114633 -0.00147403
+-0.0495274 0.14168 0.00739502
+0.0388579 0.0970015 -0.00784
+-0.00249575 0.0389742 0.0303561
+0.0070795 0.101453 -0.021277
+0.0291938 0.0754716 0.043989
+0.00502464 0.126695 -0.00649713
+-0.016158 0.0884114 -0.0380198
+0.0115883 0.102988 -0.0210311
+0.0576451 0.0661396 0.0235216
+0.0317192 0.118031 0.0171382
+-0.0116954 0.175688 -0.0223293
+0.00121183 0.0853285 -0.0350521
+-0.0158308 0.0883117 -0.038067
+-0.0686258 0.0846974 0.0427491
+0.00833511 0.0595736 -0.0302453
+0.0450509 0.0423962 0.0206492
+-0.027467 0.0793682 0.0471485
+-0.0679777 0.0716192 0.0360049
+-0.0718018 0.158195 -0.0399213
+-0.0114987 0.0856547 0.0572923
+0.0131441 0.0346685 0.0356066
+-0.0620328 0.156862 -0.0185851
+-0.0607717 0.113836 0.03657
+-0.0764751 0.146968 0.0421376
+-0.0207673 0.117009 -0.0138783
+0.0416942 0.0655359 -0.00371801
+-0.0306051 0.0524133 -0.0153638
+0.0107636 0.130209 0.0207729
+-0.0902734 0.133771 0.0282153
+-0.0235934 0.0383252 0.00311252
+-0.012672 0.0526484 -0.0327744
+-0.0309385 0.0622798 -0.0204312
+-0.0337803 0.122942 0.0251825
+-0.0598823 0.146825 0.0363335
+-0.0447526 0.0336781 0.00121434
+-0.0540428 0.0334293 -0.000440359
+0.0119421 0.123166 0.0332435
+0.0105328 0.103079 0.0462759
+-0.00696577 0.0389018 -0.00510709
+-0.033478 0.0632761 0.0395519
+-0.0386238 0.0519962 -0.0107523
+-0.0778526 0.159695 -0.0239243
+-0.0154805 0.109966 0.0416657
+-0.0688005 0.087996 -0.0171065
+-0.0428494 0.0999447 -0.0214282
+0.02441 0.101163 -0.0191142
+-0.0630974 0.160042 -0.0195595
+-0.0591899 0.154851 0.0254882
+-0.0694874 0.100005 0.0406788
+-0.063101 0.150495 -0.0266018
+-0.000774843 0.0783346 -0.0358957
+-0.0335129 0.112536 0.0351002
+0.00348618 0.11278 0.041408
+0.0454091 0.0918015 0.00517469
+-0.030521 0.0636541 -0.0224277
+-0.0564983 0.108415 0.0389345
+-0.0454982 0.045182 0.0420491
+0.0366564 0.089932 -0.0151793
+-0.00318743 0.0350129 0.0463208
+0.0397193 0.0787183 -0.00974279
+-0.0456155 0.165496 -0.00783315
+-0.0401614 0.110268 -0.0187071
+-0.0607836 0.171276 -0.0609166
+-0.0849643 0.0885105 -0.00254627
+0.000663768 0.131541 0.0142252
+-0.0773558 0.163115 -0.0213545
+-0.00442024 0.118937 -0.0140576
+0.029367 0.1045 -0.0146741
+-0.0767078 0.176155 -0.0445645
+-0.087862 0.117151 0.00226309
+-0.0674561 0.1652 -0.0559896
+0.0417828 0.101446 0.0181564
+-0.0504972 0.0465484 0.0414292
+0.0334855 0.0808915 0.0414362
+-0.0640951 0.0700461 0.0364211
+-0.0500004 0.121197 0.0329094
+-0.0640156 0.0344353 0.0303981
+0.0161688 0.0407187 0.0441528
+-0.0175288 0.165418 -0.0114925
+-0.0156111 0.0407209 -0.0274801
+-0.0136265 0.129395 0.0133241
+-0.060628 0.0588072 0.00794551
+0.0064803 0.0977098 0.0499318
+0.0439772 0.079046 -0.00278888
+0.0418428 0.0986036 -0.00180869
+-0.0225444 0.178667 -0.0133919
+-0.0606264 0.0336734 0.0105944
+-0.0434 0.0336807 -0.00215159
+-0.0886031 0.143176 0.0340326
+-0.0849284 0.107666 0.0223625
+0.0592303 0.0580467 0.0201933
+-0.0540206 0.147182 -0.0016614
+-0.00601913 0.126314 0.0306279
+-0.0686207 0.149674 -0.0393499
+-0.0919325 0.130933 0.0102425
+-0.0568299 0.143897 0.0319274
+-0.0354984 0.115235 0.0327878
+-0.0174958 0.0701523 0.0542792
+0.0270421 0.0862601 0.0462384
+-0.0488595 0.101383 -0.02158
+-0.0733679 0.152652 -0.0338969
+-0.0750934 0.159541 -0.00936327
+-0.0374543 0.155389 -0.00975319
+-0.0381729 0.166677 -0.0130206
+-0.087877 0.0990467 0.0233782
+-0.00160432 0.0405525 -0.0251988
+-0.0903048 0.139241 0.0221876
+-0.00139541 0.0385701 0.0219096
+-0.0221672 0.0839099 0.0558332
+-0.000827607 0.0389424 0.0289209
+-0.0177093 0.0385258 -0.00321073
+-0.0221552 0.169733 -0.0198584
+-0.0574718 0.156359 0.0101234
+0.0162407 0.0793143 -0.0294472
+0.0309621 0.0953572 -0.0169293
+-0.0167051 0.126576 2.44266e-05
+-0.0210968 0.161053 -0.00432438
+-0.0244887 0.100244 0.0443393
+-0.0637376 0.15365 0.0326508
+0.0154945 0.115387 0.0371086
+-0.0110238 0.098585 0.0502027
+-0.0466991 0.122484 0.0270727
+0.015569 0.110589 -0.0172093
+-0.0540772 0.146211 0.0253916
+0.0117081 0.0589891 0.0519593
+-0.0289244 0.033884 -0.0216457
+-0.08784 0.105023 0.0143674
+0.0262802 0.123151 0.0136687
+0.0122982 0.128768 0.0241985
+0.0428587 0.0803554 -0.00479839
+-0.0249679 0.0851951 0.0529639
+0.0259953 0.123127 0.0078705
+-0.000612836 0.0356605 0.0156316
+0.0462948 0.0820457 0.00817944
+-0.0179779 0.15947 -0.0103936
+-0.0237993 0.184341 -0.0145966
+-0.0300075 0.0337589 -0.0217484
+0.0233024 0.124378 0.00401489
+-0.0457643 0.0811616 -0.0200148
+-0.0786005 0.174957 -0.0470491
+0.00992987 0.0806149 0.0548353
+-0.036507 0.0464425 0.0402005
+-0.0229776 0.0681076 0.0472951
+0.0359077 0.111056 0.0244077
+-0.0691331 0.0612207 0.0112337
+-0.0653605 0.174136 -0.0490346
+-0.0246777 0.0366811 0.0541279
+0.00549638 0.115538 0.0397987
+-0.0512593 0.128575 -0.00377835
+-0.0227541 0.0889021 -0.0365754
+-0.052801 0.144689 0.0203903
+-0.0373724 0.0344314 0.0325332
+0.0302609 0.0461225 0.032895
+-0.0668934 0.119448 -0.00885989
+-0.0781478 0.107183 -0.00659237
+-0.0262448 0.109573 -0.0200299
+-0.0930011 0.116069 0.0193086
+0.0199447 0.104671 0.0430468
+-0.0902973 0.114585 0.00733567
+-0.0597131 0.0708022 -0.0154129
+0.011503 0.0909852 0.0534706
+-0.0601621 0.0433793 -0.00606772
+-0.0690356 0.068492 0.0314599
+-0.0662201 0.0390045 0.0360529
+0.0111444 0.104428 -0.02004
+-0.0620602 0.155611 0.00849054
+0.038029 0.105425 -0.00179734
+0.00952421 0.0346423 -0.0128865
+-0.0475328 0.0338333 0.0273813
+0.0275059 0.121239 0.00414409
+-0.0713739 0.162409 -0.0439557
+-0.0388285 0.0339925 0.000319116
+0.0209713 0.0966458 -0.0223043
+-0.0117867 0.0798822 -0.0383021
+-0.00231276 0.123919 -0.0094032
+-0.0623035 0.158393 -0.0375989
+-0.0498834 0.108435 -0.0190271
+-0.0450959 0.122461 0.0255697
+-0.086583 0.1077 0.0153543
+-0.0640141 0.128346 0.0443555
+-0.0910616 0.140621 0.0211716
+0.0222184 0.122028 -0.00352468
+-0.0197563 0.0685528 -0.0378978
+-0.0747315 0.0809443 -0.0125955
+0.0381487 0.056188 -0.00571384
+0.0310862 0.0808926 0.0432566
+-0.0418955 0.0336683 0.02694
+0.0454971 0.0861837 0.00419421
+-0.0515955 0.0575054 -0.00888629
+-0.0923422 0.120143 0.0302906
+-0.0388134 0.0900157 -0.0235053
+-0.0678286 0.139237 -0.00787376
+-0.0500776 0.136736 0.0219567
+-0.0524826 0.132311 -0.00383544
+-0.0725073 0.154019 -0.0378993
+-0.0164965 0.114086 0.0389356
+-0.0266334 0.0505574 -0.0257305
+0.0285947 0.0646316 0.0430307
+-0.050498 0.10288 0.0412159
+-0.0147348 0.0348101 0.0475803
+-0.0147627 0.0728806 -0.0387608
+-0.0425799 0.160887 0.00499665
+-0.0516371 0.0334814 0.00180973
+-0.0574972 0.0973516 0.04313
+-0.0294813 0.179959 -0.00726258
+-0.0696084 0.159782 -0.00738408
+-0.00175707 0.0783385 -0.0360812
+-0.0778906 0.0797955 -0.00863863
+0.0383322 0.0928141 0.0344469
+-0.0459579 0.0368224 -0.0202942
+0.0126438 0.130236 0.0157508
+0.0370668 0.109719 0.0231776
+-0.0650007 0.0600171 0.0167571
+-0.0294928 0.0931993 0.044345
+-0.0849548 0.0952071 0.0290738
+-0.0314917 0.0660582 0.0391556
+0.0283827 0.10475 0.0376855
+0.0125555 0.034405 -0.0178251
+0.0407099 0.0684593 0.0306869
+-0.0321086 0.163743 -0.0150961
+0.00529533 0.064011 -0.0326857
+0.0428516 0.0972538 0.000192155
+0.0475361 0.0451237 0.0241502
+-0.0188094 0.0382725 0.0240343
+-0.0242622 0.0650295 0.043001
+-0.0247852 0.0783802 -0.0377363
+0.0104929 0.0923225 0.0529394
+-0.0684671 0.140894 -0.00832284
+-0.013606 0.0435021 -0.0266802
+-0.0324058 0.05963 -0.0134049
+-0.0709313 0.156768 -0.044906
+-0.0794975 0.113845 0.0467655
+0.0215945 0.126233 0.0147739
+-0.0653369 0.0416124 0.0352199
+0.0546053 0.0733755 0.0137165
+-0.0893171 0.0996957 0.0173941
+-0.0835863 0.0817078 0.00050138
+0.029436 0.039931 -0.00313898
+-0.0614917 0.0661812 0.0332998
+-0.0923901 0.114734 0.0183133
+0.030053 0.0567138 -0.0167759
+-0.00342912 0.0915905 -0.0351346
+-0.0758824 0.100651 -0.0113429
+-0.0457293 0.0348843 0.042622
+0.00615023 0.0385922 -0.00780619
+-0.0547458 0.0768339 -0.0193157
+-0.0356142 0.0493225 -0.0125317
+0.024593 0.0345639 0.00705834
+-0.0892328 0.114145 0.0245988
+0.0348936 0.0586201 -0.0127038
+-0.0828513 0.138047 0.046826
+0.0569539 0.0508846 0.00918952
+-0.0797103 0.0711205 0.00752586
+-0.092065 0.118755 0.0273051
+-0.0103683 0.0388061 0.0306894
+-0.0431813 0.165147 -0.00997877
+-0.0813565 0.109598 0.0300528
+0.0477122 0.0511499 0.0301456
+-0.0678831 0.155252 0.000581516
+0.0349362 0.113582 0.0211925
+0.0280387 0.0549866 0.0403705
+-0.0615433 0.125505 0.042614
+0.0450739 0.0427888 0.00232236
+-0.0544975 0.121335 -0.0101688
+0.0117318 0.0833298 0.0539432
+-0.0144997 0.103011 0.0432504
+-0.0752992 0.149965 -0.0228671
+0.0196742 0.0686359 0.0495084
+-0.0394722 0.107013 0.0383007
+-0.0321381 0.0435397 -0.0289857
+0.0231687 0.0915577 0.0477207
+-0.0480905 0.156132 -0.00685995
+0.00882114 0.0589209 0.053036
+0.000540453 0.0731645 0.0574875
+-0.0842824 0.0818436 0.0235004
+-0.072066 0.0353469 0.00817017
+-0.0548518 0.122696 0.0382478
+-0.0283817 0.123518 -0.00261643
+-0.0178271 0.0855379 -0.0388455
+-0.00772146 0.0656018 -0.0354736
+0.0230836 0.12416 0.0238853
+-0.0125037 0.0730609 0.0559849
+0.0551355 0.0581678 0.0268835
+-0.0288448 0.124881 0.0180835
+-0.0566945 0.126945 0.0390945
+-0.0491155 0.0337431 -0.0125383
+-0.0100076 0.130157 0.0146359
+-0.0114787 0.0934019 -0.0350786
+-0.012503 0.0856552 0.057236
+-0.00822614 0.0384527 0.0224267
+-0.0288615 0.0353967 0.01735
+-0.035527 0.115134 -0.015836
+-0.085501 0.0791776 0.00851156
+0.0457594 0.0890174 0.0101642
+-0.0775133 0.126 0.0528602
+-0.0598229 0.0911123 -0.0198104
+0.0349018 0.0698502 -0.0158378
+-0.00371064 0.0641813 -0.0350983
+-0.0232497 0.0336668 -0.0221987
+-0.0337721 0.121485 -0.00843946
+0.0123855 0.0603174 0.0511841
+-0.0454994 0.0804154 0.0426755
+0.00893209 0.124393 0.0330753
+-0.00403191 0.0987119 0.0511654
+-0.0481285 0.0573264 0.0358964
+-0.0166099 0.0407431 -0.0277394
+-0.0440479 0.169839 -0.00695693
+0.0412738 0.0872408 -0.00977382
+-0.0604546 0.071762 0.0392488
+0.0529297 0.0581906 0.02898
+-0.0521631 0.138551 0.0244099
+-0.0366167 0.15106 0.000396988
+0.0417493 0.0611977 -0.0033567
+-0.070996 0.0683351 -0.00354604
+-0.0356709 0.0621736 -0.0130441
+-0.0170991 0.0383232 0.0225362
+-0.0487856 0.0573034 0.0351442
+0.022412 0.0372285 0.0333476
+-0.0249633 0.0931679 0.047071
+0.018008 0.0349409 0.0291289
+-0.0796085 0.154132 0.0271276
+-0.0406237 0.0336557 -0.0200198
+0.0169165 0.123099 -0.00667688
+0.0210051 0.0618768 0.0478546
+-0.0427644 0.0812202 -0.0203472
+-0.0672645 0.175508 -0.0482636
+-0.0639988 0.121381 0.0479339
+-0.0622266 0.158391 -0.0366041
+-0.0261802 0.161053 -0.0142499
+0.0186318 0.0821747 0.0516425
+-0.00531922 0.0961442 -0.0318294
+0.00250665 0.0341604 -0.0175888
+0.0167477 0.0563074 0.0486799
+-0.0106808 0.0555967 -0.0338825
+0.00925016 0.0724976 -0.0328208
+0.0123553 0.0552818 -0.0294499
+0.0212602 0.0735043 -0.0271352
+-0.0845249 0.129883 0.0501389
+-0.0764965 0.154899 -0.0050946
+-0.0621627 0.163132 -0.0395927
+-0.0144955 0.0701698 0.0547379
+-0.0084766 0.0489124 0.0500846
+-0.000135712 0.0381648 -0.0142912
+-0.0503963 0.1183 0.0322871
+-0.0761087 0.083292 0.0375324
+-0.0736943 0.094184 0.0404336
+-0.0691138 0.0763852 0.0387083
+-0.0290376 0.038297 0.000217512
+-0.0348553 0.0342935 0.020715
+-0.0220444 0.0384934 -0.0170721
+-0.0114987 0.0471911 0.0478612
+0.0375264 0.0714822 -0.0127977
+-0.0282394 0.087664 0.0462444
+-0.0757136 0.107486 0.0366393
+-0.0610115 0.134041 -0.00711168
+-0.0797372 0.0717415 0.00518109
+-0.0658978 0.147832 -0.0279808
+-0.00653882 0.110902 -0.0214831
+0.0296673 0.0591775 0.0410177
+-0.0217889 0.0696447 0.0502694
+0.0234089 0.0418644 -0.00766906
+-0.0364935 0.0888766 0.0431732
+0.0306541 0.0520995 0.0370911
+-0.060098 0.0687043 0.0366734
+0.0187338 0.0862153 -0.0273821
+-0.0839692 0.148747 0.00414299
+-0.0354821 0.0561791 0.038801
+-0.0481382 0.0376145 0.0455768
+-0.0676248 0.117206 0.0513943
+-0.0281854 0.174153 -0.0178233
+0.0359289 0.0386712 0.0221633
+-0.0256851 0.0824232 0.052338
+-0.0145953 0.0363242 -0.0264317
+-0.0303622 0.055196 -0.0183802
+-0.00165167 0.0525486 -0.0310164
+-0.0132125 0.168083 -0.022507
+-0.00949762 0.078776 0.0580091
+-0.0361357 0.127268 0.00216052
+0.048778 0.0525636 0.0299433
+-0.0256526 0.0520956 -0.0269974
+-0.0603733 0.0335628 0.0071663
+-0.0426157 0.035917 -0.0271302
+-0.0144999 0.162187 -0.0103051
+-0.0384864 0.0548303 0.0394681
+-0.0831442 0.107611 0.0263767
+-0.00111933 0.100971 -0.0229536
+-0.0548742 0.10693 -0.0184788
+-0.0218282 0.127027 0.00889322
+-0.0174982 0.111166 -0.0197324
+-0.0652616 0.0722487 0.0377992
+-0.0576238 0.145329 0.032529
+-0.0184507 0.117417 -0.0143314
+-0.081937 0.128034 -0.00496911
+0.0195332 0.12729 0.0154357
+-0.0293484 0.0705264 -0.0315108
+-0.00525979 0.0409541 0.0483014
+0.0555717 0.0706847 0.00515518
+-0.048428 0.0531039 0.036022
+-0.00279611 0.0826469 -0.0371795
+-0.0287124 0.0382592 0.00213562
+-0.0574984 0.0959784 0.0439666
+-0.091525 0.133725 0.0172151
+-0.016864 0.128415 0.0107007
+-0.0636978 0.164648 -0.0286005
+-0.0829735 0.127181 0.0515051
+-0.0488321 0.0956358 -0.0221459
+0.0400863 0.0899903 -0.0108207
+-0.0619683 0.12268 0.0437909
+0.0605435 0.0650981 0.0101416
+-0.0665542 0.169448 -0.0580509
+-0.0891009 0.0902275 0.0204481
+-0.0825815 0.112383 0.0454387
+0.0104883 0.0936688 0.0521003
+0.0142529 0.0765304 -0.0302113
+0.0165164 0.126586 0.0257514
+-0.0283423 0.118847 0.030216
+0.0142697 0.034212 -0.000289798
+-0.0478723 0.105599 -0.0198923
+-0.0739256 0.098177 0.0391323
+-0.049674 0.141672 0.0123895
+-0.0475977 0.15214 0.0100027
+-0.0424553 0.128377 0.00131486
+0.0224361 0.0645464 0.046427
+-0.0885609 0.087538 0.0184581
+0.0147132 0.0897404 -0.0290836
+-0.054132 0.143048 0.0274248
+0.00550441 0.0575487 0.0534334
+-0.0772682 0.155563 -0.0118971
+-0.0677628 0.079419 -0.0170759
+-0.0464924 0.159333 0.00779524
+0.0261579 0.0768253 0.0466356
+-0.0552963 0.0473377 0.0123212
+-0.0298441 0.0972531 -0.0235715
+-0.00563259 0.0974901 -0.0292726
+-0.0261993 0.095287 -0.0250572
+-0.0716941 0.0684125 -0.00254325
+0.00127365 0.0682996 -0.0335875
+0.0575871 0.0523587 0.0191771
+-0.00134429 0.0361889 0.0150058
+-0.0715096 0.1041 0.0379435
+-0.0921823 0.117455 0.0412015
+-0.0384872 0.0337149 -0.0296051
+-0.0287365 0.0475545 0.0479663
+-0.0257999 0.0422849 0.0537317
+-0.0230963 0.124618 -0.00175855
+-0.0924128 0.11471 0.0173177
+-0.00492025 0.0362041 0.048453
+-0.0186551 0.184576 -0.0164922
+-0.0802253 0.0772741 0.0285988
+0.0463015 0.0806481 0.0121762
+-0.0304105 0.0861968 -0.0305753
+-0.0346214 0.0348242 0.0450553
+-0.0652339 0.0355811 0.0395373
+-0.0788426 0.0825957 -0.0096075
+-0.0127163 0.038878 -0.00996632
+-0.0624916 0.166267 -0.0445898
+-0.0746075 0.156859 -0.0239292
+-0.0773753 0.161145 -0.0179242
+-0.0883931 0.1336 0.00326444
+-0.0661323 0.162373 -0.0581655
+-0.0510928 0.12386 -0.00885828
+-0.0384971 0.0705176 0.0419076
+-0.0723264 0.176481 -0.0540086
+-0.0271072 0.11707 -0.0138992
+-0.0591735 0.11954 -0.0102201
+0.0222809 0.11936 0.0323905
+-0.0302503 0.17123 -0.00702025
+-0.0809167 0.107332 -0.00361395
+-0.0627188 0.046051 0.00845692
+-0.00639449 0.0347093 0.0459249
+-0.0877048 0.0873692 0.00346654
+-0.0410427 0.15478 -0.00878846
+-0.069373 0.0655009 0.0252048
+-0.0270649 0.0689032 -0.0335294
+0.00976243 0.126251 0.030462
+-0.002483 0.114172 0.0414823
+-0.0532846 0.152692 0.0160461
+-0.0190668 0.12797 0.0127969
+-0.0645056 0.0818668 0.0436415
+-0.0144784 0.0645279 0.0535035
+-0.0598098 0.08825 -0.0201729
+-0.0614957 0.105649 0.0403113
+-0.0278003 0.174225 -0.00868668
+-0.0525152 0.0439969 0.0448982
+-0.00749319 0.0503553 0.0512463
+-0.0786706 0.0853441 -0.0105854
+-0.0447185 0.0709976 -0.0171011
+-0.0635722 0.0753573 0.0407707
+-0.0124985 0.0603974 0.0541523
+0.0344134 0.0655586 -0.0158419
+0.0196499 0.124334 0.0268969
+-0.0627763 0.0614875 0.0230054
+0.0416143 0.102832 0.00217563
+-0.0552881 0.147721 0.0283494
+-0.0143864 0.174216 -0.0192271
+0.0144149 0.0343798 -0.00603429
+-0.0101902 0.177186 -0.0254506
+0.0284808 0.120403 0.0230436
+-0.0149461 0.0384961 0.0282276
+-0.0778803 0.0710945 0.0220932
+-0.042083 0.168351 -0.00985967
+-0.056782 0.043535 0.0167171
+0.0143083 0.122234 -0.00973054
+-0.0266054 0.0916781 -0.031606
+-0.00249278 0.121064 0.0370013
+-0.0199096 0.0382242 0.00758286
+-0.0135056 0.0842656 0.0572305
+-0.0720125 0.148777 -0.0357596
+0.0251623 0.118606 -0.00580398
+-0.0618325 0.0334319 -0.000212632
+-0.0855476 0.136296 0.00125685
+-0.032605 0.0408975 -0.030074
+0.0426847 0.0986805 0.020158
+-0.00736899 0.0366982 -0.0162506
+0.00250252 0.0590979 0.0551087
+-0.0674921 0.106947 0.0382762
+-0.0289938 0.16114 -0.00164375
+-0.0509402 0.0584984 0.0315938
+-0.0350845 0.124972 -0.00417237
+-0.0686385 0.0435335 0.00569826
+0.0441509 0.0959467 0.0161545
+0.0131317 0.10725 -0.0189993
+0.0358259 0.0928903 0.0378885
+-0.0154981 0.060248 0.0524646
+0.0276762 0.118315 -0.00350857
+-0.0683312 0.0833327 0.042485
+0.033847 0.106899 -0.00922375
+0.048317 0.0466984 0.0256626
+-0.0570131 0.128126 -0.00643112
+-0.0788672 0.111379 -0.00271807
+0.0115311 0.122019 -0.0114981
+0.0275945 0.106191 -0.0144774
+-0.0591334 0.0584459 0.00677121
+-0.0780191 0.149419 0.0383262
+-0.0559631 0.0464314 -0.00541258
+-0.0192836 0.0894928 -0.0371367
+-0.033131 0.166707 -0.0157536
+-0.0495065 0.107045 0.0392662
+-0.073496 0.147014 0.0424214
+-0.0404833 0.111172 0.036485
+0.0284708 0.0565571 -0.0188308
+0.0511996 0.0711486 0.0227866
+-0.0681397 0.0738079 0.0376094
+-0.0905331 0.135117 0.0212107
+-0.0733037 0.155556 0.00591793
+0.0500217 0.0446984 0.00624267
+-0.00949805 0.0815484 0.0580308
+0.0211117 0.124199 0.0260136
+-0.0611133 0.149657 0.036321
+-0.0635959 0.153475 0.00125628
+0.0344187 0.0994578 0.0359067
+-0.0734442 0.163812 -0.0389777
+-0.0852938 0.0858468 -0.00152115
+-0.0559297 0.13815 0.0313829
+-0.0870302 0.13217 0.00132034
+0.0204036 0.0474506 -0.0212729
+-0.076548 0.0954614 0.0376104
+-0.0855527 0.153551 0.0192298
+-0.0729125 0.0928513 0.0411123
+-0.0404958 0.0478428 0.0400733
+-0.0121854 0.0980546 -0.0279084
+-0.0464966 0.108432 0.0393098
+-0.0177034 0.0569685 -0.0340386
+-0.0908687 0.135097 0.0172074
+-0.0862565 0.0846802 0.0214754
+-0.0297808 0.0348722 0.0494682
+-0.0764922 0.155931 0.0149956
+-0.0618119 0.115344 0.0386033
+-0.0487475 0.0767781 -0.0183253
+-0.0907804 0.150219 0.0191245
+-0.0524535 0.0335708 0.023045
+-0.0384946 0.0577019 0.0400515
+-0.074873 0.151297 -0.0278802
+0.00653661 0.120619 -0.0139577
+-0.0483957 0.0389613 0.0452757
+-0.0779524 0.165292 -0.0269536
+-0.0536531 0.0334694 0.00682116
+-0.0561549 0.118392 0.0380484
+-0.0201622 0.0337128 -0.0216346
+-0.0794073 0.0772395 -0.00557672
+-0.0135947 0.071631 0.0548042
+-0.0382622 0.0335792 -0.0232089
+-0.0183288 0.115615 -0.0164437
+-0.0507515 0.0768088 -0.0186854
+-0.0176367 0.181628 -0.0186063
+0.001434 0.0980064 0.0516014
+0.00449684 0.131467 0.00706378
+-0.0839655 0.111209 0.0317911
+-0.0769529 0.128149 -0.00749249
+0.0471199 0.0728094 0.00697834
+0.0460243 0.0737836 0.00392327
+-0.00149572 0.0505531 0.0529099
+-0.0431936 0.0363833 0.0440447
+-0.054345 0.151005 0.0266856
+0.00514071 0.12498 -0.00862525
+-0.0729614 0.112778 0.0490933
+0.0152498 0.0348445 0.0304622
+-0.0111539 0.0386404 0.0270766
+-0.0431779 0.113636 -0.0162215
+-0.0754447 0.164601 -0.0189193
+-0.0685657 0.0346013 0.0116976
+0.036686 0.110763 0.0218417
+-0.058015 0.128168 -0.00680186
+-0.0805084 0.121673 0.0499202
+-0.0750852 0.174913 -0.0410877
+-0.0394764 0.081876 0.0433844
+-0.01065 0.0383969 0.0147482
+-0.0236788 0.0551648 -0.029679
+-0.0207747 0.0728486 -0.0387932
+0.00733312 0.0553775 -0.0306811
+-0.0497252 0.137033 0.00342407
+-0.0650198 0.154365 0.0307072
+0.00051428 0.0383337 0.0225142
+-0.0625323 0.1568 -0.0366082
+-0.00383551 0.130671 0.00539431
+0.0310854 0.118732 0.00690653
+-0.0699388 0.131128 -0.00863643
+-0.023911 0.123885 -0.00309916
+-0.0495628 0.0402984 0.0453668
+-0.0639487 0.168098 -0.0606895
+-0.0706835 0.155594 0.0053992
+-0.0686442 0.156175 0.0235781
+-0.0572185 0.0575347 0.00867749
+-0.0788442 0.154658 0.0259054
+-0.0721793 0.15961 -0.0389315
+-0.0545051 0.119806 0.0369329
+-0.0254081 0.182912 -0.0140439
+-0.0729406 0.0676849 0.0243239
+-0.0353285 0.0851433 -0.0237512
+-0.0478735 0.104217 -0.0205651
+-0.0558395 0.0589131 -0.0044052
+0.0448613 0.0903726 0.0191701
+0.0576189 0.0719687 0.0133447
+-0.0511061 0.129858 -0.00316533
+-0.00880359 0.113633 -0.0183799
+-0.0618121 0.09105 -0.0190303
+0.0313027 0.114101 -0.00492854
+-0.042497 0.0874008 0.0424798
+-0.0508473 0.0970748 -0.0222124
+-0.0654906 0.102864 0.0410679
+-0.00458022 0.0347745 -0.0240516
+0.0553581 0.0524903 0.0236336
+0.00626754 0.071137 -0.0337471
+-0.0135115 0.118298 0.0374588
+-0.0604029 0.0342918 0.0295439
+0.0406411 0.0462159 0.0309092
+-0.0278584 0.0385169 -0.0108032
+0.0266728 0.0713177 0.0438181
+0.0101968 0.116422 0.0377394
+0.0446411 0.0959729 0.00816419
+-0.0597937 0.0334415 0.000190139
+-0.0210999 0.0811322 0.0562803
+-0.0474593 0.0559824 0.0367034
+0.0340242 0.115407 0.0165889
+0.0416569 0.0832977 0.0303966
+0.0340782 0.100772 0.035418
+-0.0604756 0.0747304 0.0414998
+0.0147905 0.128825 0.0208219
+-0.00109958 0.115152 -0.0180337
+-0.0237291 0.0650733 0.0438813
+-0.0261862 0.17712 -0.0185723
+-0.0381348 0.0338853 -0.0178771
+-0.0323789 0.115075 -0.0157884
+0.0168479 0.0856792 -0.0288312
+0.0383914 0.0390949 0.00219016
+0.0192558 0.0721931 -0.0285132
+-0.0837506 0.0776431 0.00349824
+0.00549734 0.0937843 0.053579
+0.0381875 0.10978 0.0131678
+-0.0707773 0.0822058 -0.016572
+-0.0623556 0.0337533 -0.00969501
+-0.0657944 0.0348418 0.0348835
+0.029813 0.0605585 0.0412449
+-0.067274 0.142559 0.0431983
+-0.00437946 0.039206 0.0351678
+-0.091267 0.130919 0.00823808
+0.056791 0.0717301 0.0086079
+-0.088725 0.0942104 0.00844208
+-0.0527517 0.076824 -0.0190661
+-0.075716 0.071204 0.0277224
+-0.0296574 0.175524 -0.0164728
+0.0201633 0.0535759 0.04656
+0.00320624 0.036422 0.0229702
+0.0192058 0.0834241 -0.02764
+-0.0918136 0.129556 0.00925121
+0.0276788 0.117119 0.0298812
+-0.0251464 0.0824617 0.0532115
+-0.0728771 0.154609 0.0294193
+0.00904539 0.03456 0.0402645
+-0.0534903 0.102908 0.0413848
+0.00940878 0.0389595 -0.0232113
+-0.0859627 0.109007 0.009354
+-0.0484951 0.0903851 0.0445307
+0.00263147 0.0345612 0.0425417
+-0.0770465 0.161776 -0.0174081
+0.0134975 0.104436 0.0449316
+-0.0388918 0.123217 0.0263098
+-0.0364947 0.112507 0.0349484
+-0.0629025 0.103986 -0.017642
+-0.0678178 0.0923118 -0.0167386
+-0.0689104 0.122371 -0.00889897
+-0.0255023 0.125351 0.00317915
+-0.000607228 0.0419595 -0.0248688
+0.0460131 0.0820178 0.0051921
+-0.0223034 0.0381733 0.0107634
+-0.0861005 0.10314 0.0243088
+-0.0674874 0.0958602 0.0421807
+-0.0538319 0.138205 -0.00152003
+-0.0199623 0.0624791 0.0486773
+-0.0187732 0.0946942 0.0521396
+0.0415957 0.0859827 0.0303559
+-0.0405006 0.0562797 0.0399754
+-0.0396087 0.0392284 -0.0278507
+-0.0203015 0.124709 0.0241059
+-0.0667178 0.127063 0.0492263
+-0.0727925 0.0893223 -0.0156729
+0.0370031 0.104683 0.029035
+0.0279524 0.103456 0.0388242
+-0.0186121 0.038597 0.0291868
+-0.0776508 0.152845 -0.000892884
+-0.0334818 0.0987718 0.0435747
+0.0329891 0.092935 0.0408139
+0.0391956 0.0712805 0.0337887
+-0.0631802 0.0590341 0.0144269
+-0.0537547 0.143134 0.0264016
+-0.0301924 0.153974 -0.00357072
+-0.0448379 0.0970765 -0.0217835
+0.00941817 0.0340541 0.000745803
+-0.0432126 0.168352 -0.00885275
+0.0554664 0.0549257 0.00120797
+-0.0225677 0.0932815 0.0503229
+-0.0524989 0.157892 0.00946562
+0.0390425 0.0953983 0.0320312
+0.04296 0.0817702 -0.00479044
+0.00635062 0.0510121 -0.0292209
+-0.0543105 0.149562 0.0267072
+0.0221931 0.100779 0.0445472
+0.0329366 0.0724958 -0.0177814
+0.0248886 0.114037 0.0344109
+-0.0550232 0.14424 -0.00134547
+0.0163915 0.04625 -0.0239163
+0.0177475 0.036867 -0.0166881
+-0.0617992 0.0867358 -0.0192812
+-0.0893599 0.133717 0.0406984
+-0.039718 0.0695625 -0.0162922
+-0.0089161 0.0389771 0.0326408
+-0.0245194 0.0879123 0.052427
+-0.0855508 0.0883229 0.0270467
+-0.0419398 0.0356984 0.00899705
+-0.0715816 0.0791203 0.0388191
+-0.0444898 0.0690526 0.0411578
+-0.070025 0.173518 -0.0406121
+-0.0628508 0.0981808 -0.0176907
+-0.0750322 0.144421 -0.00688246
+-0.0499825 0.0544896 0.033589
+-0.065333 0.177827 -0.0606985
+-0.0316114 0.123192 0.0229888
+-0.0760927 0.0805105 0.0361956
+-0.0370838 0.0486029 -0.013278
+-0.0785283 0.124553 0.0522615
+-0.0708435 0.0731956 0.0357937
+-0.0403104 0.0336344 -0.0180813
+-0.0609885 0.0628534 0.0274979
+-0.0323315 0.0624018 -0.0174393
+-0.0368547 0.100015 -0.0221726
+-0.0783796 0.172116 -0.0450441
+-0.0633655 0.139636 -0.00706655
+0.00173262 0.13137 0.0174841
+-0.0105091 0.0646847 0.0553841
+0.0266795 0.122765 0.0152477
+-0.0360635 0.034528 0.0238485
+-0.0541027 0.122637 0.0375656
+-0.0544908 0.0344999 0.0341095
+0.0176998 0.103348 0.0450658
+-0.0685644 0.145677 -0.0229009
+-0.0356468 0.0577276 -0.0110125
+-0.0696054 0.110911 0.0424293
+-0.0584669 0.0577494 0.0129387
+-0.0398029 0.0870085 -0.0218621
+-0.00967624 0.104885 -0.0231041
+0.00669982 0.0383228 -0.00932299
+-0.0609169 0.109692 -0.0160089
+-0.0646221 0.122809 0.0487379
+0.0174813 0.0865744 0.0503122
+-0.0067878 0.0386876 0.00254936
+-0.0628956 0.119461 -0.00917238
+-0.0404347 0.128451 0.0123721
+0.0304082 0.04464 -0.00596234
+0.00950687 0.0785812 0.0553914
+-0.0185636 0.161122 -0.00592394
+-0.0407009 0.066639 -0.0151117
+-0.0638844 0.0392942 0.0408356
+0.00208256 0.0392848 0.0328214
+-0.0891635 0.0901786 0.00945748
+-0.0714603 0.0390724 0.00325296
+0.0396909 0.105526 0.00119339
+-0.092918 0.118828 0.0342968
+-0.0809093 0.0912865 0.0336272
+0.0106278 0.12033 -0.0136749
+-0.079254 0.149169 0.0379325
+-0.0700516 0.177913 -0.0570165
+-0.0584973 0.0875674 0.0446281
+0.0363875 0.037641 0.0177175
+-0.0266625 0.178341 -0.0176816
+-0.0257516 0.0380733 0.00834253
+-0.0514727 0.147804 0.0154008
+-0.0475605 0.047528 -0.00960427
+0.0464078 0.0756596 0.0165703
+-0.0659757 0.132606 -0.00839654
+-0.0795255 0.0953936 0.0349279
+-0.0512091 0.118302 0.0328718
+-0.00441308 0.12096 -0.0123131
+-0.0322918 0.0358193 0.0288559
+-0.0907178 0.142015 0.0241681
+-0.0555193 0.152453 0.0283051
+-0.044345 0.152142 0.00768226
+0.0241695 0.0809229 0.0490966
+-0.0528659 0.0999263 -0.0216782
+-0.0669331 0.125307 -0.0088761
+-0.0303567 0.119073 0.029499
+0.025846 0.107916 -0.0143268
+-0.0617056 0.1325 0.0388812
+-0.0185965 0.0364224 -0.0275796
+-0.0207908 0.0384714 -0.00378381
+-0.0617181 0.0598008 0.019418
+-0.0474373 0.120726 0.0283448
+0.0366967 0.103968 -0.00783268
+0.0303183 0.0797251 -0.0205953
+-0.0317074 0.0436869 0.0496355
+-0.0623412 0.156794 -0.0356173
+-0.0765015 0.121776 0.0527715
+-0.0184879 0.122208 0.0309285
+0.0230909 0.103393 0.0423419
+0.0609018 0.0651278 0.0131549
+0.00916248 0.0355108 0.0268151
+0.0313289 0.0554154 -0.0147753
+-0.0025035 0.108652 0.0433127
+0.0546992 0.0478618 0.0141962
+-0.0620154 0.0689049 0.0360997
+-0.0388626 0.102809 -0.0208006
+-0.0555708 0.142434 0.0301615
+-0.0688026 0.146519 -0.0258522
+0.0194777 0.0878818 0.0491927
+-0.0228793 0.110931 -0.0194728
+-0.0324125 0.0849398 -0.0275574
+-0.0438855 0.03574 0.0440005
+-0.0917791 0.117463 0.0421754
+-0.0690116 0.129833 0.0494501
+-0.0743362 0.15411 -0.0219057
+-0.0638117 0.0867138 -0.0190744
+-0.045027 0.168395 -0.00690925
+0.0270479 0.080882 0.0462053
+-0.0114995 0.164138 -0.0150087
+-0.0325011 0.058955 0.0382451
+-0.0606931 0.0692955 -0.0138548
+-0.0566913 0.0572662 0.0137312
+-0.00649633 0.0488329 0.050181
+0.0223101 0.120965 0.030775
+-0.0805231 0.0993639 0.0329828
+-0.0644795 0.0959078 0.0429389
+-0.075154 0.17882 -0.048244
+0.00607351 0.0358936 0.0456569
+-0.035492 0.0648204 0.0410644
+-0.0576415 0.155076 0.0216791
+-0.0762945 0.152787 -0.0118902
+-0.00761327 0.0434711 -0.0261832
+-0.0814624 0.13163 0.0517276
+-0.0743185 0.067053 0.0192856
+-0.0842709 0.104792 0.000381661
+-0.0374161 0.12162 -0.0106267
+0.0282004 0.082909 -0.0218038
+-0.0538885 0.131144 0.0343613
+0.0268226 0.046511 -0.0137061
+-0.0500801 0.151654 -0.00422617
+-0.0843259 0.153929 0.0166903
+-0.0840259 0.124392 0.0498267
+-0.0906893 0.11752 0.0439252
+-0.0636773 0.162484 -0.0225185
+0.0362915 0.0534119 -0.00658438
+-0.0733102 0.0700068 0.0292571
+0.0432125 0.0858656 0.0273897
+0.0392299 0.108358 0.0101653
+-0.0357967 0.0383351 -0.00483874
+-0.0645865 0.0628123 -0.00359236
+-0.0838768 0.108986 0.0253683
+-0.0538875 0.139905 -0.00121756
+0.0463511 0.0764838 0.0150474
+0.0180384 0.119266 -0.0105437
+-0.0812898 0.0735018 0.0165324
+-0.0437426 0.076832 -0.018848
+-0.0489995 0.126854 0.0308899
+0.00913686 0.107291 -0.0199257
+0.0413467 0.0718054 -0.00779903
+-0.0407607 0.126285 -0.00553285
+-0.0564807 0.113914 0.0357075
+-0.0477527 0.149202 0.00972608
+-0.0737025 0.144377 -0.00986626
+-0.0237128 0.058121 -0.0313582
+-0.0884618 0.142054 0.0361609
+-0.00450592 0.0661541 0.056364
+-0.0448888 0.108464 -0.0189265
+-0.0531399 0.13506 -0.0028018
+0.0308728 0.114122 0.0296728
+-0.0120858 0.0382274 0.0182274
+0.045976 0.0820209 0.01617
+-0.0474955 0.0344671 0.0303636
+0.0116443 0.129846 0.0210966
+0.0429126 0.0775596 -0.00475805
+-0.0639176 0.122377 -0.00881224
+-0.0219078 0.0581082 0.0451165
+-0.0185957 0.118181 -0.0131167
+-0.0381658 0.165183 -0.0131497
+-0.0445045 0.0438483 0.042919
+-0.0464974 0.074738 0.042075
+-0.0819901 0.133862 -0.00285904
+-0.0633534 0.0445301 0.031682
+-0.0314905 0.0960436 0.0448087
+-0.0575997 0.0574661 0.0133658
+-0.0303698 0.154176 -0.00601441
+0.0133009 0.0666579 -0.0304883
+0.0108109 0.0819726 0.0543646
+-0.068057 0.178404 -0.0514469
+-0.0806807 0.0760273 -0.00253172
+0.0394926 0.0541437 0.0318453
+-0.00450121 0.0675415 0.056336
+-0.019491 0.0387907 0.0342254
+0.0147818 0.0631153 0.0511723
+-0.0291704 0.172664 -0.0174314
+0.0262968 0.070421 -0.0238548
+-0.0421212 0.159153 -0.0103433
+-0.0367588 0.172073 -0.0125043
+-0.0196292 0.117165 -0.0140584
+-0.042525 0.149193 0.00498605
+-0.0175612 0.186044 -0.0184493
+0.0221884 0.0973608 -0.0216774
+-0.0197019 0.0568866 -0.0331333
+-0.045504 0.0832988 0.0437099
+-0.0212803 0.0387041 -0.0133833
+-0.0770943 0.154164 -0.0118975
+-0.0484907 0.0833394 0.0445457
+-0.0238036 0.0798229 -0.0381557
+-0.0372926 0.0394674 -0.0291193
+-0.00273038 0.0683735 -0.0347173
+-0.0659296 0.14253 0.0416232
+0.0452769 0.0467388 0.0283148
+-0.0898014 0.11587 0.00528404
+0.0263587 0.0577877 0.0432503
+-0.0486968 0.067904 -0.0141574
+-0.0893812 0.113196 0.0217139
+-0.0841444 0.110242 0.00330414
+-0.0631329 0.17411 -0.0535854
+0.0348962 0.0387881 -4.46661e-05
+0.0431163 0.0888383 0.0261767
+-0.0444887 0.166716 0.00379579
+-0.0235591 0.0953745 -0.0271663
+0.0455985 0.0918132 0.00816712
+-0.0917403 0.12555 0.0418871
+-0.0890224 0.136404 0.0092064
+-0.0364114 0.175555 -0.00996795
+-0.0345906 0.0727451 -0.0199624
+0.0429111 0.040977 0.0196984
+0.00148534 0.0385845 0.0464325
+-0.0585016 0.0973698 0.0431908
+-0.0484982 0.0819185 0.0441136
+0.00821862 0.116409 0.0384227
+0.0456517 0.0413562 0.00923967
+-0.0769167 0.0873975 0.0382106
+-0.061867 0.101123 -0.0184855
+0.0202898 0.124676 0.0257091
+-0.0101432 0.130124 0.0117041
+-0.0138894 0.183111 -0.0237643
+-0.0707552 0.0792696 -0.0152786
+0.0465284 0.0761532 0.0136843
+-0.0888827 0.140531 0.0122011
+-0.0659605 0.110851 0.0377691
+-0.0638988 0.109582 -0.0144399
+0.0445103 0.0541956 0.0324876
+-0.0545376 0.0335773 0.0172858
+0.0156666 0.0726831 0.0525311
+-0.0224929 0.0448955 0.0530527
+0.00250097 0.0897336 0.0558646
+-0.0427601 0.128938 0.0129983
+-0.0749067 0.100837 0.0372176
+0.0100662 0.0792875 0.0550109
+0.031592 0.0738009 -0.0197207
+-0.0295595 0.111353 -0.0178807
+-0.0265381 0.155425 -0.00506198
+0.0110253 0.0793101 0.0546505
+0.0455932 0.0834007 0.019176
+-0.00963497 0.0389293 -0.00939263
+-0.0740278 0.157006 -0.00316778
+0.026879 0.121193 0.00250168
+-0.0840153 0.1376 0.000355984
+0.00144074 0.0344391 0.0153316
+-0.062494 0.0746373 0.0407954
+-0.0714338 0.100882 0.0394174
+-0.0511894 0.0558131 0.0154354
+0.0142545 0.0887312 0.0523539
+-0.0217647 0.0699552 -0.0378816
+0.042865 0.0958458 -0.000810373
+-0.0225278 0.18149 -0.0200273
+-0.0516224 0.0545433 -0.00792825
+-0.0894416 0.0943032 0.0194238
+-0.0450754 0.033637 -0.0171737
+-0.0189216 0.122512 -0.00768052
+-0.0278603 0.101566 -0.0234492
+0.0273313 0.094554 -0.020088
+-0.0568394 0.145329 0.0319256
+0.0299199 0.11779 -0.000781916
+0.0345811 0.0368089 0.0162808
+0.0130795 0.0927597 -0.0282037
+0.0239979 0.0768543 0.0488301
+-0.0560741 0.15232 0.0295584
+-0.0713082 0.165213 -0.0459899
+0.0214853 0.0948038 0.0473574
+-0.0124976 0.0472007 0.0479814
+0.0101747 0.096292 -0.0259611
+-0.0424942 0.0916602 0.0426604
+-0.000674255 0.10997 -0.0204918
+-0.0731036 0.0721584 0.0326952
+-0.0863191 0.0806349 0.0164939
+-0.0174959 0.0984963 0.0451272
+-0.0516134 0.0334804 0.007228
+0.0210892 0.0521114 0.044364
+-0.0767842 0.155599 0.0119802
+-0.0737106 0.0699801 -0.00251138
+0.0277999 0.0727164 0.0436883
+0.0605691 0.0637105 0.0171755
+-0.0720961 0.156364 0.000513559
+-0.0818934 0.154016 0.0102104
+-0.0184806 0.169783 -0.0146335
+-0.073631 0.173473 -0.03767
+-0.0385075 0.0888951 0.0435504
+-0.056184 0.0374619 -0.0105738
+-0.0164629 0.0616668 0.0525376
+-0.0214965 0.0525299 0.044709
+-0.0324599 0.0722556 -0.0254696
+-0.0781568 0.167257 -0.0305864
+-0.0633087 0.117017 0.0436447
+-0.084428 0.138004 0.0455627
+0.0287818 0.0480764 -0.0117305
+-0.0706135 0.175903 -0.0451833
+-0.0430742 0.0335089 -0.0222312
+0.0203664 0.0506236 -0.0244327
+-0.0807714 0.153393 0.00628177
+-0.0784635 0.138605 0.0489019
+-0.0754126 0.068174 0.019879
+-0.0105025 0.0773598 0.0576687
+-0.0399608 0.0418525 -0.0253044
+-0.0880973 0.137764 0.00820327
+-0.0862825 0.106347 0.0193454
+-0.0114851 0.123708 0.0326887
+-0.00700917 0.0348727 0.042072
+-0.0760973 0.0851761 -0.013541
+0.0421377 0.0912242 0.0276147
+0.0298218 0.119509 0.00500708
+-0.0550443 0.148674 -0.00204704
+-0.0107558 0.0386486 -0.0149703
+0.00849857 0.118254 0.0373924
+0.0373294 0.0848074 0.0364738
+0.0506886 0.0511228 0.0274131
+-0.0538924 0.106961 -0.0186698
+-0.0735555 0.105459 0.0371635
+-0.0532563 0.0343869 0.0309731
+-0.015483 0.0938222 0.0546278
+0.0454513 0.052559 0.0321398
+0.032601 0.100801 0.0367685
+-0.0688527 0.142579 0.0444582
+-0.0908832 0.150197 0.0161314
+-0.0811312 0.129963 0.0524484
+0.00846909 0.111301 0.0401143
+-0.0622744 0.0344133 0.0342699
+-0.0343155 0.0340522 0.0192395
+-0.0869096 0.111745 0.0223587
+0.0507656 0.0446256 0.0152142
+-0.0767707 0.151403 -0.00690852
+-0.00150011 0.103045 0.0440564
+-0.051019 0.147224 -0.00224048
+-0.025918 0.122982 0.0235755
+-0.0527617 0.0461943 0.0216742
+-0.0178184 0.0841429 -0.0390768
+-0.0345091 0.0461323 0.043875
+-0.0623881 0.149093 -0.0125752
+-0.0809179 0.0761444 0.0241516
+-0.00945917 0.175708 -0.0257473
+-0.0334992 0.0704401 0.0410454
+-0.0886682 0.141939 0.0121971
+-0.0120612 0.0383071 0.0127308
+-0.0853843 0.0980412 -0.000554198
+-0.0325205 0.0646875 0.0393461
+0.0503466 0.0615208 -0.00363326
+0.00449283 0.103624 -0.0217086
+-0.0698084 0.085099 -0.0171261
+0.0438316 0.0832073 0.0263179
+-0.0486418 0.0576652 -0.0108452
+0.0123248 0.0609207 -0.0293142
+0.0429772 0.0902337 -0.00478341
+-0.0619824 0.166238 -0.0535924
+0.0140441 0.0406072 0.0445814
+0.00249558 0.116934 0.0396534
+0.018473 0.0989902 0.0468145
+-0.0169827 0.0385945 -0.00497776
+0.0309161 0.0955754 0.0413413
+-0.0735982 0.110276 0.0438156
+-0.0903629 0.11521 0.0252935
+-0.0566835 0.124286 -0.00724626
+-0.0620082 0.134045 -0.00734981
+0.00521493 0.0852237 -0.0334342
+-0.0903999 0.124268 0.0448512
+0.0114719 0.1182 0.0365719
+0.0344326 0.0414166 -0.00330414
+-0.0403754 0.124077 -0.00919956
+0.0484547 0.0702338 0.00359645
+-0.0285016 0.113902 0.0349068
+-0.0526285 0.0596472 0.0276152
+-0.0325191 0.174119 -0.0148634
+-0.0204902 0.108532 0.041306
+0.010276 0.076623 0.0552854
+0.0133781 0.0537725 -0.0285433
+0.0402901 0.0698645 0.0318359
+0.0401742 0.0671588 0.0316675
+-0.0866887 0.120341 0.0484058
+0.0245253 0.0875975 0.0479106
+-0.050498 0.0890212 0.0452499
+-0.0598028 0.0853759 -0.0202992
+0.0354525 0.106753 -0.0069512
+0.0111874 0.0630268 0.0529412
+-0.0416003 0.12872 0.00602836
+0.0443487 0.0533892 -0.00643258
+-0.0229394 0.0985982 0.0448104
+-0.0678177 0.0894605 -0.0172539
+-0.0826703 0.0762102 0.00250991
+-0.0152189 0.172708 -0.0246075
+-0.0748382 0.0978559 -0.0133191
+0.0284295 0.0955564 0.0430179
+-0.04802 0.136068 0.0153684
+-0.0475691 0.0489734 -0.00936479
+-0.0813576 0.0734641 0.0155425
+-0.07594 0.14997 -0.0178724
+-0.0649871 0.152354 -0.0372683
+-0.0229947 0.122243 0.0275866
+-0.0108296 0.0855471 -0.0384547
+-0.0447583 0.0336472 -0.00973579
+-0.041838 0.0942787 -0.0228038
+-0.038857 0.101401 -0.0214118
+0.00839351 0.0342854 -0.0184828
+0.0436422 0.0748109 -0.00280304
+0.00409443 0.101828 -0.021842
+-0.0194474 0.054231 0.0477027
+0.0410346 0.0752467 0.03121
+0.0588047 0.0677091 0.00614939
+0.021598 0.10091 -0.0208238
+-0.0696323 0.156261 0.0232204
+-0.086966 0.0846591 0.00747852
+-0.0660124 0.176151 -0.0507054
+0.0425261 0.101486 0.00616657
+0.0305131 0.0418181 0.0291512
+-0.0554982 0.113948 0.0354054
+-0.0763852 0.108818 0.0389983
+-0.0785959 0.152697 0.00118419
+0.0184567 0.127794 0.00934393
+0.0105917 0.043143 0.0448676
+-0.0719858 0.0346482 0.00381826
+-0.0341243 0.0335931 -0.0280196
+-0.0564439 0.115317 0.036137
+-0.0928438 0.126838 0.0112559
+-0.0661071 0.164936 -0.0219713
+-0.0665376 0.142546 0.0425061
+-0.0167827 0.0388081 0.0329676
+-0.0614351 0.156032 0.020314
+0.0388231 0.106965 0.0221712
+0.0247856 0.0449735 0.0390757
+-0.0324984 0.0788891 0.0412743
+-0.068331 0.155325 0.0280685
+0.0267262 0.114038 0.0335472
+-0.0888783 0.111909 0.0103621
+-0.0772308 0.0920788 -0.012603
+0.0457689 0.0431024 0.0219801
+0.0474981 0.0737139 0.0139878
+-0.061487 0.0746791 0.0411579
+-0.0861526 0.148758 0.00721004
+0.0341879 0.0913684 -0.0166968
+-0.0200728 0.100101 -0.0240875
+-0.0286491 0.125506 0.0152069
+-0.0268606 0.0378639 0.0137313
+-0.0352216 0.0346633 0.0327857
+-0.0444613 0.12936 0.0182577
+0.0373383 0.0740435 0.0363986
+0.00751373 0.0869673 0.0561316
+-0.0888328 0.0942898 0.0224093
+0.00897858 0.127106 -0.00499333
+0.0363106 0.0994119 0.033375
+-0.0448194 0.0913346 -0.0221278
+0.000368669 0.0466323 -0.0286891
+-0.0606782 0.0639978 0.0300882
+-0.0735086 0.078138 -0.0125733
+-0.0358361 0.11045 -0.0189078
+0.0300578 0.0632721 0.0416198
+0.0173543 0.0349384 0.0362289
+-0.0104845 0.10863 0.0429333
+-0.0265155 0.115287 0.0336658
+0.0257868 0.0967214 -0.0203669
+0.0255714 0.119263 0.0291067
+-0.0404457 0.119913 -0.0128413
+-0.0596429 0.0622343 0.0265494
+-0.0522074 0.122732 -0.00965468
+0.00419216 0.0340885 -0.0190827
+-0.0614977 0.108395 0.0385563
+-0.0154933 0.0392591 0.0382209
+0.0568425 0.0592039 0.0011688
+0.033494 0.0619462 0.0395497
+0.0378948 0.0699732 0.0354084
+-0.0643687 0.155314 0.00767719
+-0.017163 0.124753 -0.00408239
+-0.0892062 0.128127 0.00426293
+-0.058497 0.101559 0.0426268
+-0.00170163 0.130406 0.0219933
+0.0258358 0.123453 0.0120756
+0.0200283 0.102079 0.0449293
+-0.0034976 0.0965806 0.0535793
+-0.0805988 0.090913 -0.0086158
+0.0307316 0.091606 0.0428217
+0.0293141 0.095566 0.0425395
+0.011103 0.0779768 0.0547588
+-0.0912353 0.14886 0.0211316
+0.0484812 0.0443317 0.021366
+-0.00581925 0.0868408 -0.0369183
+-0.0454559 0.0902978 0.0432333
+-0.0346794 0.119765 -0.0106544
+-0.00349323 0.113677 -0.0184484
+-0.0434907 0.101526 0.0420227
+-0.0385061 0.0986889 0.0419871
+-0.0599081 0.112539 -0.0152225
+-0.0242322 0.124794 -0.000701199
+0.0400813 0.104202 0.0221684
+-0.0828121 0.0830332 0.030132
+0.0159137 0.128436 0.00413586
+-0.0645186 0.0597262 0.00993302
+-0.0324512 0.0353306 -0.0309147
+-0.0484861 0.137101 0.00939484
+-0.0304745 0.0860755 0.0433189
+0.0188415 0.121733 -0.00718615
+-0.0643746 0.145275 -0.0151376
+0.0208541 0.11855 -0.00976629
+0.037465 0.0434297 0.0291248
+0.0517879 0.0461689 0.0072143
+-0.0837871 0.0829476 0.0282971
+-0.0917215 0.129668 0.0302355
+-0.0261628 0.0674202 -0.0335157
+-0.0631555 0.156855 -0.014582
+0.043463 0.077603 -0.00378219
+-0.0602407 0.058232 0.0121428
+-0.0458636 0.102811 -0.0213024
+-0.038884 0.108506 -0.019659
+-0.0705258 0.142815 0.0451961
+-0.0781039 0.070111 0.0193756
+-0.0758474 0.109198 0.0406016
+-0.0318501 0.0986369 -0.02282
+-0.038215 0.0471675 -0.018189
+-0.0134374 0.0516868 0.0502089
+0.0151412 0.0754034 0.0535569
+-0.043493 0.105703 0.0408668
+-0.0822959 0.0773319 0.0228488
+0.0452717 0.0903987 0.0151606
+0.0159567 0.120613 0.0338084
+-0.0623049 0.142641 -0.00633906
+0.000467241 0.105823 0.0432483
+-0.0177409 0.0671746 -0.0379913
+-0.0891252 0.0889064 0.0184472
+-0.0678748 0.125664 0.0510849
+-0.0337468 0.127104 0.0118588
+-0.0518684 0.102767 -0.0207881
+0.00221584 0.0364728 0.00081639
+-0.0296253 0.0759773 0.0411397
+0.00226876 0.0682822 -0.0333186
+-0.0542457 0.0574384 0.01981
+-0.0659991 0.136994 -0.00799651
+-0.00357593 0.127459 -0.0052112
+0.0103564 0.0538895 -0.0297771
+0.0272815 0.0718243 -0.0235929
+-0.0123281 0.0344052 -0.018857
+0.0416155 0.0404142 0.0199255
+-0.0106878 0.0598858 -0.0348312
+-0.0305006 0.116618 0.0322439
+0.0427332 0.084569 0.0284544
+-0.0712328 0.151001 -0.0437008
+0.0423623 0.0944394 0.0261744
+-0.000687654 0.0583509 -0.0327859
+-0.0779789 0.136876 -0.0051311
+-0.0657518 0.0780369 -0.0174491
+-0.0789069 0.155396 0.0141592
+-0.0701046 0.156748 -0.048906
+0.0281353 0.0593598 -0.0207767
+-0.066567 0.147777 -0.0287654
+-0.0167976 0.0383562 0.00264497
+-0.0708835 0.160996 -0.0449446
+0.0230988 0.111339 0.037076
+-0.0237033 0.091176 -0.0348871
+-0.0477118 0.073839 -0.0167643
+-0.0540526 0.0334248 -0.00589512
+-0.0535445 0.0389126 -0.0111352
+0.00251277 0.0675114 0.055914
+-0.0324736 0.0532348 0.0372028
+-0.0416459 0.056333 -0.0114534
+-0.0460476 0.0363198 0.0451262
+-0.0215027 0.163915 -0.00845889
+-0.0530817 0.139518 0.0266624
+-0.00971954 0.0656257 -0.0358484
+-0.0175293 0.038199 0.0153321
+-0.0388176 0.128112 0.00411022
+-0.0579212 0.120852 -0.00959233
+-0.0215953 0.03793 -0.0285032
+0.00849245 0.0473031 0.0488481
+-0.045123 0.157633 -0.00869072
+-0.0845016 0.0911794 -0.00456302
+-0.0130394 0.0384127 0.00153612
+-0.0054932 0.111405 0.0422861
+-0.00614297 0.0385457 0.0227705
+-0.0588822 0.108299 -0.017343
+-0.0647452 0.0766241 -0.0174472
+0.0333079 0.0768384 0.0411622
+-0.0345058 0.0704863 0.0415356
+-0.00385823 0.0988046 -0.0266644
+-0.0940576 0.125561 0.0242759
+-0.0406606 0.156554 0.00601794
+0.0458479 0.0724092 0.00333418
+-0.0536298 0.0345249 0.0429297
+0.0422446 0.0760949 -0.00580476
+0.0305908 0.106106 0.0356297
+-0.0744956 0.13026 0.0524093
+-0.060795 0.0853339 -0.0197774
+-0.0659276 0.123847 -0.00897257
+-0.0587952 0.0334058 0.000425547
+-0.0355002 0.111108 0.0360398
+0.0106562 0.0589179 0.0524466
+0.0220342 0.108737 -0.0152173
+0.0414017 0.104253 0.00516521
+-0.0487319 0.132909 0.0254731
+-0.073147 0.0648981 0.0178865
+-0.0655672 0.149686 0.0379738
+-0.0866855 0.14466 0.00818677
+-0.0690156 0.163795 -0.0519803
+0.0474899 0.0664975 0.0274045
+-0.0693729 0.175081 -0.056043
+-0.0811978 0.140383 -0.00182247
+-0.0609117 0.111106 -0.0154828
+-0.027448 0.125478 0.0053817
+-0.0601827 0.0460596 0.0101722
+-0.0116048 0.0377441 -0.0259987
+-0.0623577 0.147557 -0.00658086
+-0.0635933 0.167459 -0.0411888
+-0.0420303 0.153306 -0.00761985
+0.0045298 0.102977 0.0440255
+-0.0571296 0.124118 0.0402058
+-0.010491 0.0487865 0.0492904
+-0.00149595 0.0911539 0.0561263
+-0.0644925 0.0903995 0.0447493
+-0.0621097 0.156825 -0.0345957
+-0.0626845 0.0455625 -0.000282658
+-0.054778 0.0344845 0.0375447
+-0.0704967 0.156763 -0.0469167
+-0.0501084 0.0429877 0.0445637
+-0.074873 0.120838 -0.00772479
+0.0354301 0.112103 0.00127449
+-0.0218649 0.103029 -0.0235712
+-0.09096 0.148814 0.0141536
+-0.0645626 0.0459512 0.00669838
+0.0314584 0.111437 -0.00809824
+-0.022876 0.0362943 -0.0189473
+-0.0428901 0.0435976 -0.0193145
+-0.0746823 0.0663852 0.00625465
+-0.0476209 0.0547841 -0.0103184
+-0.0197585 0.171251 -0.0147167
+-0.0705035 0.0901829 0.0418541
+0.0494272 0.0628335 -0.00296645
+0.0266028 0.105322 -0.0155495
+0.0202061 0.126966 0.0100746
+0.013717 0.127103 0.0275992
+0.00956448 0.122301 -0.0117968
+-0.0846111 0.084433 -0.00253466
+-0.0889485 0.13651 0.0272017
+-0.000398103 0.0385343 0.0221462
+0.0428913 0.0402636 0.016655
+-0.0531156 0.156084 -0.00339606
+-0.0586999 0.141645 -0.00399496
+0.0175889 0.0549386 0.0481228
+0.0242735 0.0576737 -0.0247443
+-0.0435028 0.0548283 0.0392794
+-0.0509876 0.0343016 0.0280109
+-0.0371778 0.128019 0.00618657
+-0.067159 0.152634 -0.0476967
+-0.0524481 0.115128 -0.0157418
+-0.00787248 0.0390234 0.0328097
+-0.0368889 0.109941 -0.0191779
+0.0473251 0.0497353 0.0295737
+-0.0155015 0.10721 0.0425067
+-0.0607907 0.0609394 -0.0015406
+0.0214998 0.0358071 0.0181694
+-0.0152794 0.114388 -0.017154
+-0.0618553 0.153745 -0.0235803
+-0.00541506 0.100313 0.0476265
+0.0438051 0.0987511 0.0101628
+-0.0274965 0.0973724 0.0435854
+0.0448746 0.0601039 -0.00424277
+0.031559 0.0460718 0.0312637
+-0.0615188 0.0448284 0.0115308
+-0.0397761 0.115072 -0.015742
+-0.0918654 0.131039 0.0272344
+-0.0646035 0.156332 -0.00986181
+0.0383993 0.0413521 -0.00190432
+-0.026722 0.0386646 -0.0162927
+-0.0736148 0.0995067 0.0387799
+0.006499 0.119638 0.036869
+0.0405971 0.101404 0.0241737
+-0.0944613 0.121476 0.0212834
+-0.0105851 0.0337493 -0.0235512
+-0.0799934 0.136838 -0.00393652
+0.0529009 0.0462649 0.0122044
+-0.0539028 0.11125 -0.0176614
+0.00874316 0.130156 0.0228898
+0.0260633 0.114349 -0.00924148
+0.0113837 0.0449118 -0.0251572
+-0.0461015 0.150679 0.0086365
+0.00236523 0.128663 -0.00254763
+-0.0158845 0.0910066 -0.0366604
+0.0456174 0.0890068 0.0121612
+-0.0634393 0.144588 -0.0113838
+0.0175304 0.120577 0.0333463
+-0.0256229 0.0463679 -0.0270847
+-0.0606463 0.0343588 0.0329219
+-0.0622926 0.149098 -0.0115749
+-0.0266239 0.0463597 -0.0270834
+0.0142234 0.0864184 -0.0301272
+-0.0242795 0.0383175 -0.000652306
+-0.0599506 0.0340585 0.0228145
+-0.031899 0.0595768 -0.0154053
+0.0335035 0.0686838 0.0396083
+-0.00350655 0.105885 0.0441283
+-0.00849376 0.0576353 0.0542501
+-0.0596861 0.0693591 -0.0143393
+-0.0246408 0.0382637 -0.00251941
+0.0142384 0.0723592 -0.0308856
+0.0360996 0.112682 0.0101589
+0.00650478 0.0989998 0.0481043
+-0.0406764 0.0344836 0.0353061
+0.0208126 0.114503 -0.0133998
+-0.0664042 0.0385079 0.0306689
+-0.00851871 0.0471234 0.047663
+-0.0607941 0.143953 0.0367655
+-0.0469959 0.06153 0.0374819
+-0.0566078 0.0521283 0.00668717
+-0.0117953 0.0827249 -0.0387188
+-0.0651684 0.0346977 0.0334093
+0.0334291 0.0781951 0.0413414
+-0.00319773 0.0384234 0.00715593
+-0.0255204 0.115294 0.0339151
+-0.070852 0.100833 -0.0142398
+-0.0647775 0.0824087 -0.0188685
+0.0351918 0.0673501 0.0385292
+-0.0201767 0.0929008 -0.0346271
+-0.0292631 0.0351386 0.0510616
+-0.0487306 0.0345868 0.0335095
+-0.0909618 0.13376 0.0242167
+-0.0399614 0.0343338 -0.0130933
+0.0409886 0.0643095 0.0292691
+-0.0656099 0.0655077 0.0295065
+0.0113576 0.0509388 -0.0282254
+-0.0831709 0.101988 -0.00359129
+-0.0345055 0.113874 0.0339275
+0.0308648 0.0460986 0.0320207
+-0.023595 0.180085 -0.0196757
+0.056025 0.0493916 0.0151904
+-0.0805557 0.0977534 -0.00758611
+0.0084218 0.0346373 0.0418695
+-0.0774116 0.159696 -0.0249188
+0.0602932 0.0636878 0.00814035
+-0.0302474 0.125253 0.00290344
+-0.0741812 0.074527 0.0339368
+-0.0636646 0.15831 -0.045603
+-0.0332687 0.15271 -0.00392746
+0.0267163 0.0450608 -0.00869474
+0.0351226 0.0921155 -0.0154837
+-0.0278275 0.158128 -8.54892e-06
+-0.0771542 0.152814 -0.00588992
+0.00726262 0.0682112 -0.0321527
+-0.0590296 0.0424919 -0.00727859
+-0.0604873 0.0987275 0.0428004
+-0.0916073 0.128323 0.0352449
+0.0474407 0.0661575 -0.000283122
+0.03984 0.106962 0.00517391
+-0.0609078 0.155801 0.00889681
+-0.00849418 0.114178 0.0409373
+0.00894357 0.0819404 0.0551438
+-0.0767684 0.0756527 -0.0076025
+-0.0670227 0.0607355 0.00842954
+-0.0186908 0.0510113 -0.0307584
+-0.0706351 0.0733936 -0.01149
+-0.026674 0.0382695 0.00254021
+0.0585127 0.0649229 0.00410871
+0.0241246 0.0605253 0.0453245
+0.0172623 0.073643 -0.0290458
+-0.0564969 0.111123 0.0367634
+0.0543584 0.0674371 0.0258007
+-0.0511173 0.128308 0.0330935
+-0.075231 0.151315 -0.0248804
+-0.0492462 0.132382 0.000177088
+-0.0694944 0.11756 0.0525327
+-0.0721635 0.113702 0.0503204
+-0.0647819 0.0809531 -0.0185144
+0.00336694 0.130688 0.00234495
+0.0243671 0.0699418 0.0457082
+-0.000607851 0.0448652 -0.0263872
+-0.0506782 0.141637 0.0173818
+-0.0618089 0.0881716 -0.0191682
+-0.0886021 0.087516 0.0174642
+0.011433 0.034701 0.0261941
+-0.0405676 0.171048 0.000226569
+0.0111139 0.110132 -0.0191278
+0.0136046 0.121889 0.0339065
+-0.0107442 0.0742291 -0.0379783
+0.0438711 0.0959127 0.00218342
+-0.0299153 0.155169 -0.001314
+-0.0469317 0.0369443 -0.0162782
+-0.0887949 0.142048 0.03516
+-0.0459209 0.0346888 0.0375199
+-0.0022788 0.119988 -0.0131916
+0.00522675 0.0768423 -0.034472
+-0.0277078 0.0725313 -0.0348614
+-0.0679296 0.125304 -0.00887173
+-0.0528849 0.101359 -0.0212107
+0.0356786 0.076967 -0.014745
+-0.0567974 0.0854612 -0.0213212
+0.00206285 0.121236 -0.012553
+-0.0659186 0.159142 -0.0118027
+-0.0857862 0.0939971 -0.00056361
+-0.0318889 0.124978 0.0199371
+0.0110379 0.0712445 0.0546046
+-0.043282 0.147753 0.00390043
+0.0142589 0.0737441 -0.0304465
+-0.037534 0.168232 0.00175297
+0.0421124 0.0467315 0.0307997
+-0.0195242 0.0336044 -0.023287
+-0.0581683 0.0606896 -0.00283185
+-0.0892904 0.149814 0.024685
+-0.0328117 0.0335416 -0.0258378
+-0.0534094 0.150878 0.0234093
+0.0224588 0.120521 -0.00588511
+0.0297724 0.0549903 0.0393628
+-0.0689711 0.136995 -0.00816407
+0.0327608 0.11383 -0.00261931
+-0.0138771 0.164812 -0.0186885
+0.00401259 0.0341521 0.00329327
+-0.0776837 0.154812 0.0263001
+-0.0617213 0.0781294 -0.0185002
+0.0405341 0.105626 0.00416435
+-0.033143 0.157873 -0.0118064
+-0.0244152 0.0723023 0.0471532
+0.000983167 0.0373381 0.00163376
+-0.0227666 0.126779 0.0143916
+-0.0151278 0.128803 0.00988702
+0.000514565 0.0717586 0.0570729
+0.0202169 0.0591906 0.0484605
+-0.0591321 0.0334434 -0.0069378
+-0.0338188 0.0345795 0.040191
+-0.000499113 0.11695 0.0400287
+-0.0463678 0.13079 0.00400616
+0.0171482 0.0349466 -0.009792
+-0.064905 0.0607648 0.0196679
+-0.0624362 0.150651 -0.0105777
+-0.0354607 0.154847 -0.00919588
+-0.0211471 0.0377711 0.0538261
+-0.0691709 0.147293 -0.0286567
+-0.0360974 0.127648 0.0124754
+-0.0776508 0.151441 -0.00388634
+0.0365033 0.0512847 0.031619
+0.0193623 0.0370952 -0.00967348
+0.0153438 0.0522442 -0.0271619
+-0.0174947 0.0815257 0.0576296
+-0.0629203 0.122369 -0.00879811
+0.0168951 0.128644 0.0116162
+0.0397845 0.0699028 0.0328672
+0.00847616 0.0963576 0.0505263
+-0.0532837 0.0454354 0.0434394
+-0.0154326 0.0388218 -0.0141873
+0.058968 0.0691324 0.00813536
+-0.0155327 0.116851 0.0372458
+-0.0261049 0.0632214 -0.0314499
+-0.0580383 0.122682 0.0406302
+-0.0153478 0.0972963 0.0501876
+-0.0480268 0.116533 -0.0152488
+-0.0440293 0.0378087 0.0445145
+0.0122229 0.0822322 -0.030844
+-0.00477881 0.0390844 -0.0104359
+-0.0106511 0.0496684 -0.0311061
+-0.0197213 0.123533 0.0272668
+-0.000499702 0.119705 0.0381547
+-0.0497662 0.165331 0.00186024
+0.0034577 0.0989815 0.0493164
+-0.0623164 0.153672 -0.0306063
+-0.0676947 0.134039 0.046063
+-0.0536041 0.0588172 -0.00776341
+-0.0774688 0.144183 0.0446652
+-0.054123 0.064196 0.0330627
+-0.0515128 0.0452783 0.043411
+-0.0216106 0.0422609 -0.0287762
+-0.0721201 0.0655088 0.0210948
+-0.0214414 0.0682091 0.0499624
+0.0246691 0.103387 0.0411037
+-0.0584632 0.0480819 0.000648377
+-0.0193941 0.113623 -0.0183331
+-0.0642327 0.0431706 0.0367918
+-0.0673041 0.044774 0.00468689
+0.00124491 0.0726488 -0.0351082
+0.0293752 0.0646271 0.0424024
+0.0334188 0.0399387 -0.00226403
+-0.0648162 0.092445 -0.0185198
+-0.0588392 0.0371017 0.0463605
+-0.0464973 0.113852 0.0344899
+-0.0253214 0.158135 -0.00165461
+0.0565751 0.0564133 0.00219071
+-0.0628971 0.106793 -0.0162163
+-0.0672273 0.135447 0.0449702
+-0.0874127 0.118983 0.0477049
+0.0264339 0.0415833 -0.00518191
+-0.0649816 0.114139 0.0429675
+-0.087689 0.0861087 0.0184696
+-0.0759388 0.151364 -0.016882
+-0.00938485 0.0992897 -0.0251913
+-0.0906583 0.12815 0.00627512
+0.0420818 0.101483 0.016165
+-0.0366993 0.124957 -0.00615077
+0.0344101 0.0633165 0.0391255
+0.0312208 0.0578184 0.0397344
+-0.0245116 0.0679611 0.0445844
+-0.0494967 0.0932039 0.0445022
+-0.0762012 0.149986 -0.0138757
+-0.0469178 0.060141 0.0374462
+-0.0939221 0.128285 0.0202478
+-0.0488103 0.0898531 -0.0217755
+-0.013542 0.129298 0.0162538
+0.0557083 0.0616421 0.000366134
+0.0340796 0.0848941 0.0405554
+0.0303873 0.0525299 -0.0147333
+0.0173214 0.127268 0.00181685
+-0.0623602 0.164675 -0.0475927
+-0.0633366 0.0613129 -0.000511486
+-0.0663574 0.0370366 0.0151548
+-0.0567588 0.053509 0.00466959
+-0.082746 0.0802849 -0.00049163
+-0.00173892 0.0697883 -0.0347021
+-0.0444708 0.0888726 0.0431834
+-0.0676524 0.0720092 -0.0120172
+0.0578262 0.0552267 0.0219335
+-0.0418656 0.104235 -0.0206965
+0.0300166 0.0708304 -0.0207823
+-0.0533336 0.128311 0.0351755
+-0.0275965 0.0836272 0.048557
+-0.0894883 0.139285 0.0301857
+0.0461177 0.0511569 0.0313544
+0.0505588 0.0711508 0.00463977
+-0.0653079 0.154958 0.0291369
+-0.0185448 0.0460852 0.0515079
+-0.0843685 0.105877 0.0253348
+-0.0875722 0.151019 0.0254764
+-0.0711952 0.0805577 0.0397762
+0.0367726 0.100261 -0.0101361
+0.0280869 0.0432543 0.0332457
+0.000487446 0.041412 0.0465786
+-0.0266388 0.038336 -0.00299264
+-0.00342216 0.0391144 -0.00832149
+-0.0611289 0.0344725 0.039662
+-0.0517362 0.0738243 -0.0167692
+-0.0804236 0.104574 -0.00559216
+-0.0319013 0.0525534 -0.0124561
+-0.0616634 0.0612417 -0.00198952
+-0.0659473 0.151954 -0.0393992
+0.0336372 0.112962 -0.00230707
+-0.0699642 0.138462 -0.00776795
+0.00139789 0.0405023 -0.0245871
+-0.059508 0.0890036 0.0450344
+-0.0550222 0.141298 -0.00203484
+-0.0720681 0.0805547 0.0392361
+0.0126182 0.0846922 0.0534757
+0.0593665 0.0622129 0.00511321
+-0.0924363 0.118744 0.0263157
+-0.0166806 0.0510876 -0.0315182
+0.0119118 0.0342207 -0.00263798
+-0.0646486 0.156189 0.0162701
+-0.022872 0.104437 -0.0231879
+-0.0799264 0.129511 -0.00520384
+0.0394641 0.063132 0.032359
+-0.0114897 0.0951792 0.0542781
+-0.0474976 0.111158 0.0371638
+-0.0683525 0.155277 0.00186884
+-0.000867993 0.104495 -0.0223762
+-0.0462686 0.12794 -0.00315273
+-0.0306198 0.11135 -0.017885
+-0.0420238 0.0464078 -0.0143471
+-0.0115071 0.0801438 0.0578104
+-0.00552471 0.130134 0.0220582
+0.0553699 0.0651884 0.000788532
+0.000971023 0.0370418 -0.0149189
+-0.0695999 0.162389 -0.0499627
+-0.0593254 0.0447426 0.0431798
+-0.0163529 0.16023 -0.0109161
+-0.0074892 0.108662 0.0435531
+-1.59767e-05 0.130672 0.0211571
+-0.0414957 0.0762285 0.0430404
+-0.00181283 0.0854279 -0.036655
+-0.0573252 0.157131 0.000943525
+-0.0582662 0.0597287 0.0219286
+-0.0158083 0.0827626 -0.0393641
+-0.0636754 0.156752 -0.0416076
+-0.0399677 0.0461402 -0.0203282
+-0.025156 0.16972 -0.0189618
+-0.0527747 0.0826622 -0.0215537
+0.0251411 0.10209 0.0417928
+-0.043632 0.0462886 -0.0112814
+-0.0620154 0.164635 -0.0555847
+0.0104502 0.0343141 -0.0181143
+-0.0391566 0.162183 -0.0124024
+-0.0483573 0.129635 0.0282843
+0.00538744 0.0448871 -0.0255741
+-0.0054947 0.0533903 0.0535249
+-0.00732851 0.0942973 -0.033961
+-0.0241934 0.0388427 0.0350005
+-0.0181599 0.0393223 0.0394029
+0.0346554 0.10439 -0.0105413
+-0.0459466 0.0345121 -0.0200076
+-0.0409396 0.168342 -0.0108401
+0.0103005 0.0624571 -0.0307796
+-0.0681652 0.158429 -0.00684039
+-0.00243741 0.0385239 0.0217416
+0.060795 0.0623425 0.0151668
+-0.0927217 0.128206 0.0112525
+-0.0740576 0.168348 -0.0248615
+-0.0345432 0.114978 -0.015669
+-0.0591204 0.0334451 -0.00148219
+-0.0599836 0.043576 0.0142711
+-0.0568374 0.0898133 -0.021762
+-0.0727774 0.16869 -0.0244081
+-0.00877695 0.169647 -0.023748
+-0.0733702 0.171289 -0.0318245
+-0.0533609 0.033209 0.01963
+-0.012858 0.0386932 -0.00424091
+0.0446984 0.0804984 -0.000780025
+-0.0604981 0.105663 0.0403307
+-0.0437727 0.082626 -0.0206932
+-0.0251898 0.0388783 0.0347661
+-0.00550353 0.0561986 0.0539335
+-0.0649478 0.164181 -0.0229827
+-0.0145881 0.165422 -0.0124907
+-0.0415058 0.0577139 0.0401965
+0.0385298 0.0631329 -0.0097765
+-0.0643222 0.166215 -0.0313693
+-0.0769851 0.0690914 0.0187275
+-0.013127 0.120519 -0.0116431
+-0.0624813 0.156041 0.0199412
+-0.0475747 0.0390527 -0.0120963
+0.0154157 0.0433241 -0.0236953
+-0.00124361 0.130098 0.0236021
+-0.00149237 0.118319 0.0391398
+-0.0454304 0.130382 0.00608349
+0.0094151 0.117047 -0.0161127
+-0.0370213 0.0344129 0.0343812
+-0.0266349 0.121939 -0.00696588
+-0.0514954 0.0833657 0.0447762
+-0.0661547 0.1622 -0.0162285
+0.0354074 0.0446129 -0.00524037
+-0.0839561 0.144602 0.00415973
+-0.0114934 0.104435 0.0434539
+-0.0811445 0.153633 0.00754624
+0.0416181 0.0637615 0.0286411
+0.0336503 0.0646637 0.0398008
+0.00904657 0.129598 0.024451
+-0.075728 0.151337 -0.0208826
+-0.047856 0.132056 0.00259359
+-0.0635915 0.15525 -0.0109401
+-0.025528 0.0383109 0.0298198
+-0.0664625 0.145705 -0.0206681
+-0.0675712 0.139722 0.0445155
+-0.0630199 0.134039 -0.00765574
+-0.0859393 0.101835 0.0256124
+-0.0530219 0.147196 -0.00187885
+-0.00620458 0.038993 0.0313778
+0.0378425 0.10835 0.0231802
+-0.0877357 0.0860979 0.0084778
+0.0064767 0.115498 0.0396093
+-0.027105 0.162286 -0.015104
+-0.0801261 0.144525 -0.00183492
+-0.0858754 0.148602 0.0326009
+-0.060661 0.155018 0.0264156
+-0.0104794 0.0575747 0.0533869
+-0.0433 0.0336903 -0.024306
+-0.0668671 0.0980924 -0.0163226
+-0.0682097 0.171724 -0.0385204
+0.049328 0.0615911 -0.00371844
+-0.059497 0.0861573 0.0445009
+-0.0875265 0.087486 0.0224433
+-0.0660555 0.0600044 0.0111686
+-0.0578054 0.142438 0.0322424
+0.00123277 0.0783068 -0.0354173
+-0.0916354 0.132395 0.0252256
+-0.0117599 0.104933 -0.0231377
+-0.0346346 0.0548282 -0.01038
+-0.0222409 0.0383275 -0.000251248
+0.00824961 0.0725345 -0.0333305
+0.0313861 0.0740897 0.0418701
+0.0164934 0.100411 0.0468922
+-0.0719809 0.156292 0.0165776
+-0.0221908 0.175658 -0.0213821
+-0.00588737 0.108814 -0.0225516
+0.0336337 0.112484 -0.0031866
+-0.0393568 0.123991 -0.00912015
+-0.00841793 0.0387705 -0.00155909
+-0.0431088 0.0347881 0.0415217
+-0.0281377 0.171231 -0.00924208
+0.0317135 0.0955631 0.0407455
+0.0166807 0.124611 -0.00431903
+-0.0923991 0.132355 0.0192227
+0.0141807 0.0900592 0.0522594
+-0.0553478 0.054711 -0.00338754
+-0.0742948 0.147166 -0.0148659
+-0.0210322 0.0623911 0.0469253
+-0.0808524 0.0720445 0.00954101
+0.0185494 0.0379494 0.0423026
+-0.0841291 0.0817203 0.00248105
+0.0309459 0.0700081 0.0411857
+-0.0394974 0.0705046 0.0418138
+-0.0762918 0.169333 -0.0300921
+-0.0537237 0.0477139 0.0256667
+0.0448999 0.0861351 0.000186186
+-0.0313094 0.0384531 -0.00773361
+-0.0305219 0.0474445 0.0454913
+-0.0809514 0.0882189 -0.0076035
+0.0546575 0.0706779 0.0225865
+-0.0414965 0.0986758 0.0418571
+-0.0484435 0.0628471 0.0360579
+0.0594927 0.066407 0.020186
+-0.0627925 0.0838575 -0.0191674
+-0.0214511 0.184864 -0.013038
+-0.0935392 0.129637 0.0202382
+-0.0799546 0.100457 -0.00758867
+-0.0552688 0.126926 0.0376418
+0.0378584 0.0645918 0.0353403
+-0.0361046 0.0383233 -0.0122787
+-0.049226 0.14015 0.0123965
+-0.0164997 0.0938314 0.054193
+-0.0746007 0.0914774 0.0400082
+-0.0791205 0.0709783 0.00599758
+0.0253641 0.0347082 0.00521179
+-0.0594957 0.0918578 0.0453847
+0.0136708 0.0820393 0.0532361
+-0.0193315 0.182966 -0.0230088
+-0.000544127 0.127196 -0.00494172
+-0.030476 0.0664272 -0.0264734
+-0.0734051 0.0674458 0.022683
+-0.0136727 0.0337044 -0.0241151
+0.0214461 0.036336 0.0158614
+0.0583506 0.0662943 0.00413175
+-0.0639059 0.118033 -0.00945272
+-0.0454908 0.0987379 0.0426533
+-0.0318359 0.0344957 0.0406866
+-0.0657843 0.167288 -0.0290298
+0.0181885 0.053509 0.04724
+-0.0610973 0.169393 -0.058599
+-0.0167464 0.108538 -0.0209441
+-0.0826184 0.0802381 0.0286257
+-0.0731223 0.134062 0.0505767
+-0.0135829 0.03702 0.0510108
+0.0354665 0.0768048 0.0390018
+0.0499493 0.051169 0.0281186
+-0.00858939 0.0389741 -0.00922854
+-0.0482262 0.166987 -0.00394405
+0.000506781 0.0605965 0.0560209
+-0.0571262 0.0333733 -0.00101401
+-0.0527176 0.0611373 0.029069
+-0.0225206 0.0919822 0.0517607
+-0.0727584 0.158224 -0.0349231
+0.0221671 0.123584 -0.0006811
+-0.0697019 0.142554 0.0449861
+-0.0890361 0.146068 0.0101777
+0.0300144 0.0389449 0.0261617
+0.0457459 0.0834058 0.0171675
+-0.0828165 0.0790258 0.0245191
+-0.0216847 0.180158 -0.0138785
+-0.0260473 0.11708 -0.0139183
+-0.0263102 0.123352 0.021955
+-0.026277 0.0795343 0.0501986
+-0.04015 0.0473434 -0.014266
+-0.0911404 0.129685 0.035237
+-0.0376719 0.114063 -0.0167039
+-0.0138183 0.0855391 -0.0388001
+-0.0574963 0.111121 0.0367615
+-0.0459611 0.149058 -0.0040494
+-0.06359 0.153594 -0.035633
+0.0294595 0.116659 -0.00368699
+-0.0465112 0.0491437 0.0387964
+-0.0476612 0.135572 0.0133995
+-0.0122712 0.0385653 -0.000297189
+0.0438612 0.0930832 -0.000804157
+-0.00849948 0.0911907 0.056727
+-0.0554517 0.0444829 -0.0071986
+0.0112279 0.0808839 -0.0317275
+-0.0364414 0.0346808 0.041293
+-0.0768829 0.108524 0.037335
+-0.0212115 0.177139 -0.0220322
+-0.0498078 0.0898419 -0.0216876
+0.00832653 0.130915 0.00561741
+-0.0834391 0.153089 0.025871
+-0.0797915 0.0746069 -0.00248195
+0.0162926 0.0348913 0.030635
+-0.0720312 0.141354 -0.00781974
+-0.0640613 0.0606361 0.00380817
+-0.0616877 0.169385 -0.0545934
+-0.0180884 0.184586 -0.0174536
+-0.083714 0.0804887 0.0254979
+-0.0378459 0.0971527 -0.0224307
+-0.048763 0.120209 -0.0131018
+0.0257432 0.120365 -0.00224906
+0.0155215 0.0490175 0.0450471
+-0.0516538 0.162634 -0.00285466
+-0.00249513 0.0774404 0.0585569
+-0.0676995 0.0606833 0.0155957
+-0.0530523 0.0333885 -0.00566149
+0.00632209 0.0596079 -0.030662
+-0.075813 0.0681115 0.0180714
+0.0416741 0.0642804 0.0284921
+-0.04591 0.132311 0.0103278
+-0.0266282 0.0932643 0.045173
+-0.0409763 0.128303 0.0136557
+-0.0295455 0.0745738 0.040676
+-0.0236123 0.0408478 -0.0290846
+-0.062999 0.13114 -0.0082084
+-0.0282657 0.0357556 -0.0195136
+0.0383138 0.109087 0.0181423
+-0.0225227 0.0903335 -0.0360154
+-0.00581332 0.0840953 -0.0378871
+-0.0560848 0.155673 0.012015
+-0.0384894 0.0436513 0.0409963
+0.0250684 0.0912521 -0.0226015
+0.0327251 0.116757 0.0189485
+-0.00849679 0.081545 0.0579523
+0.00549376 0.116905 0.0389072
+-0.0684642 0.035536 0.0130279
+-0.0274333 0.0808284 0.0484505
+-0.0892338 0.0888828 0.0134587
+0.040773 0.0858024 -0.0107788
+-0.018787 0.0654231 0.0516453
+-0.057411 0.0334884 -0.00846165
+-0.0515646 0.0516091 -0.00736491
+-0.0341101 0.171131 -0.0149349
+0.0224908 0.0672402 0.0465227
+0.00748827 0.048894 0.0505047
+-0.0891497 0.139122 0.0375101
+-0.0324992 0.033739 0.00907408
+-0.00547868 0.112944 -0.019663
+-0.00364368 0.038223 0.0108877
+-0.00888297 0.175714 -0.027834
+-0.0616908 0.156845 -0.0305919
+-0.0454927 0.0747515 0.0421648
+-0.0628753 0.0333858 -0.000385113
+0.0200484 0.122759 0.029923
+-0.0624127 0.150637 -0.0175763
+-0.0772056 0.0717509 -0.00044869
+-0.070203 0.179305 -0.0507979
+-0.021805 0.0812974 -0.0389167
+0.00417139 0.0894659 -0.0333631
+-0.00354618 0.035584 0.0475305
+-0.0881296 0.100997 0.0213597
+-0.0344927 0.0803488 0.0420944
+-0.0142597 0.180104 -0.0279187
+-0.0772012 0.161073 -0.0279344
+0.0267764 0.0373043 0.025139
+-0.0764984 0.127442 0.0532158
+0.0305998 0.0741029 0.0424942
+-0.0429656 0.115061 -0.0157138
+-0.0569157 0.131148 0.0370227
+-0.087746 0.09368 0.0248353
+-0.0282695 0.0620042 -0.0284458
+-0.026741 0.0877745 0.0490115
+-0.0141005 0.0382966 0.0123251
+-0.040335 0.124745 0.0227896
+-0.0176742 0.109826 -0.020315
+0.0100598 0.0371564 0.0309489
+0.0330284 0.116174 0.0204895
+0.0194916 0.111179 0.0380087
+-0.0468321 0.144886 0.00412892
+0.00432629 0.0568097 -0.0310178
+0.0172994 0.0665713 -0.0290602
+-0.0776345 0.165887 -0.0268309
+-0.0754949 0.117024 0.0522099
+0.0129986 0.124708 -0.00640366
+-0.0551543 0.0561755 0.00960447
+0.0258384 0.0659192 0.0443144
+-0.0892157 0.0956404 0.0184193
+-0.062275 0.152174 -0.0245791
+-0.0712276 0.159591 -0.0429327
+-0.0468614 0.102797 -0.0212675
+-0.0888687 0.0942285 0.0104297
+0.00705483 0.113673 0.0402142
+-0.0846088 0.10754 0.00337493
+-0.0567766 0.0840541 -0.0213935
+0.0291103 0.0713139 0.0420683
+-0.0416245 0.172695 -0.00500345
+0.0467254 0.0741323 0.0166809
+0.0182946 0.123502 0.0292701
+-0.032545 0.0821172 -0.0295502
+0.0405942 0.0847142 0.0324234
+-0.063874 0.0967575 -0.0177619
+-0.0200635 0.0385408 -0.00554998
+-0.0617567 0.139364 -0.00656769
+-0.0151158 0.0388065 -0.0122456
+0.0258671 0.111418 0.0358303
+-0.0323169 0.126646 0.013854
+0.0128496 0.0432822 0.0446281
+0.0410596 0.104249 0.0151631
+0.0413114 0.0661977 -0.00477755
+-0.0524783 0.0442541 0.0446515
+-0.00534534 0.0423344 0.0481709
+-0.0154906 0.0587868 0.0517337
+-0.0768702 0.122267 -0.00710647
+0.018318 0.0607989 -0.0274966
+-0.0414689 0.101488 0.0411988
+-0.03948 0.109789 0.0371385
+-0.071689 0.171513 -0.0326505
+-0.0562412 0.0479891 0.0306662
+0.0198041 0.103539 -0.0196351
+-0.06089 0.146655 -0.00344226
+-0.0625194 0.150622 -0.0185752
+0.0162788 0.0421207 0.0443108
+-0.0926435 0.13098 0.0162303
+-0.0102744 0.0864318 -0.0379838
+0.0437196 0.0846401 -0.00379782
+-0.0575438 0.119835 0.0395668
+-0.0312754 0.118165 0.0306394
+-0.0384168 0.120732 -0.0116964
+-0.0133826 0.1039 0.0435877
+0.0232434 0.0804535 -0.0255191
+-0.0102585 0.0379591 0.0497745
+-0.0427371 0.0753968 -0.0185868
+0.0223381 0.0606785 -0.0258752
+-0.0124978 0.122374 0.0339942
+0.00450508 0.0688823 0.055725
+0.0471561 0.0614873 -0.00363177
+-0.0496676 0.0649029 -0.0122308
+-0.0360083 0.0485228 -0.0153235
+0.0255211 0.116701 0.0317994
+0.000516492 0.101662 0.0444028
+0.00434751 0.121547 -0.0129175
+-0.0374873 0.0959326 0.0432114
+0.0252705 0.0346338 0.0163557
+-0.0124579 0.0545987 0.0514221
+-0.0889602 0.131049 0.0432066
+-0.0372423 0.152141 0.00211029
+-0.0892956 0.0942653 0.013432
+-0.0518302 0.0344778 0.0329457
+-0.0187757 0.0756949 -0.0390019
+-0.0719603 0.0681626 0.0276375
+-0.0847959 0.147297 0.0357863
+-0.0683786 0.160357 -0.00982452
+-0.0326605 0.0863757 -0.0255732
+0.0456643 0.0848033 0.01617
+0.0560044 0.0608622 0.0263962
+0.0242808 0.034582 0.00510919
+-0.0255484 0.0414464 0.0539815
+0.0584482 0.0538047 0.0101717
+-0.0507323 0.0738128 -0.0166527
+-0.0145896 0.101524 -0.0235873
+0.00379349 0.0393361 0.0313217
+-0.060041 0.155524 0.0222725
+0.0330115 0.107346 -0.00970764
+-0.0356538 0.120932 -0.00987931
+0.0252334 0.114772 -0.00969056
+-0.0560291 0.051292 0.00869383
+0.039494 0.0484532 0.0321483
+0.0260206 0.095556 0.0448127
+-0.0144952 0.092498 0.0556089
+-0.0745303 0.0887706 0.0400356
+-0.0427423 0.0768225 -0.0188988
+-0.0254944 0.0348465 0.0469921
+0.0115755 0.104003 -0.020168
+0.0177398 0.128218 0.01192
+-0.0537709 0.0460941 0.0150722
+-0.0260174 0.0351047 -0.0290083
+0.0146321 0.0460649 0.043757
+-0.0725348 0.149777 -0.0387435
+-0.067793 0.0851703 -0.0179862
+-0.0345051 0.0491976 0.0390013
+-0.0575351 0.0727864 0.0407731
+-0.0902562 0.135043 0.0112131
+-0.0341019 0.0350895 0.0466468
+0.0354707 0.0862229 0.039086
+-0.0635111 0.15292 -0.0340962
+0.000752728 0.131478 0.01712
+0.0415962 0.101461 0.0191676
+0.0199544 0.117871 -0.0110405
+0.0125 0.0341066 0.00131673
+-0.0104877 0.105844 0.0434252
+0.000625364 0.130997 0.01994
+-0.00947876 0.108641 0.0432746
+0.0427329 0.0747306 -0.00479562
+0.0175177 0.121695 0.0318921
+-0.0724967 0.123205 0.0535111
+-0.0217998 0.0826894 -0.0387559
+-0.0474379 0.0384277 -0.0132876
+-0.0453217 0.127718 -0.00291517
+0.00149278 0.115548 0.0405079
+-0.00268673 0.0598311 -0.0338297
+-0.0282466 0.0410133 0.0533665
+-0.084979 0.0912122 -0.0035611
+-0.00188052 0.0377314 0.00623396
+-0.0719012 0.152408 -0.0434229
+0.0297667 0.100164 -0.016062
+-0.0446553 0.0615526 0.0394256
+-0.0935168 0.125484 0.0132627
+0.00892319 0.0349264 0.0435129
+-0.0906919 0.142015 0.0231619
+-0.0362968 0.126232 -0.00232089
+-0.0581074 0.0494572 0.00366497
+0.0584743 0.0538121 0.0171841
+0.0453685 0.090397 0.014157
+0.0451698 0.0903876 0.0161628
+-0.0648504 0.099576 -0.0170426
+-0.0336174 0.0385515 -0.0101375
+-0.0818746 0.144748 0.0414084
+-0.0921915 0.114676 0.0133297
+-0.0735116 0.140055 0.0477493
+-0.0625074 0.0334277 0.00145514
+0.0301634 0.0659717 0.0417895
+-0.0313891 0.0338671 0.0146006
+-0.0524964 0.0876231 0.0453765
+-0.0763164 0.155546 0.0238171
+0.0473804 0.0650284 -0.00116263
+-0.0203751 0.165368 -0.0103486
+-0.074953 0.131092 -0.00759533
+-0.0200723 0.0361973 0.0530852
+-0.0623326 0.164687 -0.0445921
+-0.0432796 0.127517 -0.00276726
+-0.0794589 0.155317 0.0154304
+0.0484584 0.0430177 0.0142199
+0.0516914 0.0635003 0.0289607
+0.0124992 0.111251 0.0392691
+-0.00916969 0.168123 -0.0207225
+-0.0624966 0.0987153 0.0424769
+0.0403564 0.0602895 0.0300713
+0.000529964 0.0745913 0.0578265
+-0.00430704 0.037991 -0.0149598
+-0.0458025 0.0336244 -0.00441422
+0.0244543 0.124393 0.0172632
+-0.0566778 0.0485827 0.00942267
+0.0118497 0.0354401 0.0310392
+-0.0460906 0.156154 -0.00788178
+0.0200436 0.125383 0.0241901
+-0.0110606 0.128229 0.000136123
+-0.0680155 0.149781 -0.0384715
+-0.0340535 0.158097 0.00328753
+-0.063246 0.0709836 0.037551
+0.00837353 0.0479453 -0.0272176
+-0.0704921 0.0944433 0.0420805
+0.0271048 0.0835778 0.0462962
+-0.0814225 0.0858535 0.0328878
+-0.0311244 0.126183 0.00987945
+0.00420219 0.0866314 -0.0335404
+-0.0160918 0.0359549 0.0514785
+-0.0387772 0.152061 -0.00669739
+-0.0394877 0.095879 0.0424449
+-0.0556734 0.0645255 -0.00818248
+-0.0721186 0.0637108 0.0173676
+-0.00866441 0.055565 -0.0335626
+0.034399 0.0476191 -0.006288
+0.0184894 0.03497 -0.0076507
+-0.0208903 0.0376209 0.05361
+-0.0721389 0.12842 0.0519775
+-0.0135421 0.093873 0.0547462
+-0.0114977 0.038716 -0.00213082
+-0.0444942 0.0761733 0.0424299
+-0.0162113 0.0387427 -0.00681752
+-0.0632795 0.162306 -0.0238202
+-0.0678999 0.11945 -0.00879052
+-0.0624555 0.163099 -0.0465902
+-0.0197676 0.0376635 -0.0177276
+-0.00982564 0.0339746 -0.0198462
+-0.0334993 0.115969 -0.0147052
+0.0241258 0.0914782 -0.0228484
+0.0393714 0.104176 0.025187
+-0.0877422 0.114422 0.00426669
+0.0169437 0.0346991 -0.00395051
+-0.0659364 0.0364202 0.0386491
+0.0236414 0.0741206 0.0482553
+0.0360643 0.108191 -0.003826
+-0.0498837 0.0340852 -0.0133065
+0.0109544 0.0459934 0.0454216
+0.0232194 0.06778 -0.026032
+0.0407755 0.0675587 -0.00776366
+0.0164452 0.127885 0.0214354
+0.0306214 0.073711 -0.0207585
+0.0310665 0.0768618 0.0431993
+-0.0326395 0.0549161 -0.0112709
+-0.0264479 0.0721314 0.0435447
+0.0185916 0.116689 0.0359263
+0.0210399 0.118016 0.0341276
+-0.0910253 0.115214 0.0323598
+0.000420695 0.0340758 -0.0179207
+0.011475 0.115421 0.0379758
+0.0558934 0.0728505 0.0127047
+-0.0168011 0.0813465 -0.0393174
+-0.0884013 0.103686 0.0143755
+0.00687166 0.100046 -0.0219438
+0.00938176 0.0463536 -0.0257255
+-0.0376115 0.11722 -0.0140038
+-0.0454999 0.102932 0.0417867
+-0.0638509 0.0597328 0.00826283
+-0.0626761 0.0691812 -0.0125769
+-0.0654105 0.124234 0.0493774
+-0.0585036 0.0790577 0.0434985
+0.025387 0.103408 0.0403826
+0.0322433 0.0896617 -0.0189276
+-0.0875821 0.0909427 0.0247332
+-0.0855607 0.103501 0.00239284
+-0.0436971 0.0419128 0.0432773
+-0.0946145 0.122826 0.0212791
+0.0282404 0.0858422 -0.0216043
+0.00524711 0.0726037 -0.0343433
+0.00348793 0.114165 0.0408953
+-0.0345349 0.108408 0.0380462
+-0.053757 0.152473 0.0202331
+-0.0684765 0.061182 0.0096252
+-0.0653795 0.17033 -0.0418012
+0.0335191 0.0398635 0.0260657
+0.00150101 0.0647986 0.0566673
+-0.0386685 0.0621637 -0.0127302
+0.0514753 0.0731205 0.0184716
+-0.0475108 0.159316 0.00812402
+-0.0418554 0.101378 -0.0213767
+0.059111 0.0580409 0.00617531
+-0.0235023 0.105779 0.0421282
+-0.0564932 0.0861648 0.0446121
+0.0463019 0.07925 0.0141776
+-0.037115 0.160706 -0.0129903
+-0.0454732 0.0917007 0.0431865
+-0.08762 0.143285 0.0101199
+0.0294825 0.0348729 0.0114843
+0.0351631 0.0941496 -0.0136388
+0.0169892 0.122251 -0.00777586
+-0.0286955 0.175698 -0.00647862
+-0.0586479 0.0629437 -0.00583333
+-0.0799097 0.0706493 0.0132254
+0.0440384 0.0959414 0.0171588
+0.00466861 0.0365644 -0.00250089
+-0.0368263 0.0929138 -0.0236695
+-0.0126068 0.0392015 -0.0264338
+0.014095 0.041997 0.0446638
+0.00757449 0.035092 0.025056
+-0.0564565 0.03337 -0.00815977
+-0.0774971 0.128861 0.0533302
+0.0348978 0.0613787 -0.0138096
+-0.0348784 0.10713 -0.0202183
+0.0074278 0.117326 -0.0164147
+-0.0416698 0.0345261 0.0350582
+-0.0711528 0.180791 -0.0525602
+-0.0633069 0.0343768 0.0340823
+-0.0795725 0.091329 0.0351135
+-0.00149388 0.0787876 0.0581499
+-0.0838841 0.12062 -0.00343109
+-0.0017512 0.0769296 -0.0360915
+0.00921045 0.0851252 -0.032
+0.0528986 0.056075 -0.00272531
+-0.088793 0.0888086 0.00747102
+0.0367516 0.061565 -0.0117718
+-0.00560731 0.0389273 -0.00299633
+-0.0145783 0.0348246 -0.0259715
+-0.0668255 0.162993 -0.016474
+0.0537671 0.0492093 0.00323447
+0.0164968 0.0990289 0.0471605
+0.0350254 0.0533499 0.0328505
+-0.0502577 0.127427 -0.00458948
+-0.0354996 0.0605317 0.0401535
+-0.0445094 0.0832466 0.0430632
+-0.061134 0.11687 0.0396165
+0.0288023 0.0594063 -0.0198054
+-0.0345743 0.120058 0.0294165
+-0.00577775 0.0812461 -0.0375203
+-0.0271582 0.125819 0.00840694
+-0.00487894 0.130442 0.0208375
+-0.0485449 0.165375 0.00344343
+0.00426734 0.0682596 -0.032922
+-0.0887148 0.12811 0.00328264
+-0.0688911 0.0610594 0.0132079
+-0.0845844 0.121705 0.0490448
+0.0086501 0.130656 0.00430717
+-0.0694892 0.109539 0.0380952
+-0.0883053 0.149858 0.0265188
+-0.0556122 0.136727 0.0318764
+0.00753471 0.0632773 0.055432
+-0.0675754 0.0334584 0.000400215
+0.0390555 0.064539 0.0335561
+0.00752021 0.073081 0.0562837
+-0.0898786 0.113438 0.0340422
+-0.0729585 0.134037 -0.00770509
+-0.0713317 0.151217 -0.0439201
+0.00350232 0.123774 0.0338316
+-0.0682244 0.142863 -0.0118107
+-0.0110454 0.113378 -0.0180964
+0.0539053 0.0478505 0.00821457
+-0.0614468 0.141404 -0.00570472
+-0.0113089 0.0383954 0.0218511
+-0.0281079 0.177558 -0.016771
+0.012409 0.0418787 -0.0238148
+-0.00282516 0.102957 -0.0229221
+0.0254031 0.123772 0.0104796
+-0.0305987 0.0803029 0.0419758
+-0.0750181 0.0761727 0.0341343
+-0.0144519 0.166922 -0.0140569
+0.00338055 0.0465728 -0.0280809
+-0.0162255 0.177147 -0.0257279
+0.0131167 0.108671 -0.0187213
+0.0272829 0.121723 0.00548626
+-0.0883907 0.115479 0.0451949
+-0.0879259 0.102339 0.0203636
+-0.0548201 0.128324 0.0365339
+-0.0820753 0.129944 0.0519532
+0.00724365 0.07823 -0.0340312
+-0.0819891 0.0923793 -0.00757573
+-0.0303556 0.168269 -0.0071929
+-0.00250456 0.0562401 0.0542942
+-0.0616678 0.143939 0.037247
+-0.0776245 0.151441 -0.00287924
+0.0374138 0.110303 0.0192381
+0.0348067 0.0902706 0.0399059
+-0.0127063 0.0671038 -0.0370425
+0.0160068 0.0347306 -0.00980024
+-0.0372246 0.0368821 -0.0130308
+0.0340234 0.0585319 -0.0137143
+0.0541559 0.0477549 0.017206
+-0.0405048 0.15944 0.00272423
+-0.0015963 0.0981039 -0.0279083
+-0.092935 0.117416 0.0233037
+-0.0832007 0.119017 0.0492012
+0.00140058 0.0348342 -0.0234319
+-0.0868724 0.106357 0.0173489
+-0.0166991 0.0570076 -0.034416
+-0.0907644 0.142021 0.0271708
+-0.0822477 0.106043 -0.00262262
+-0.0929753 0.11876 0.0253083
+-0.0263289 0.0434924 0.0526862
+-0.0374936 0.0733328 0.0420467
+-0.0355255 0.0818589 0.0431427
+-0.0650055 0.136996 -0.00788185
+-0.0705444 0.0712752 0.0339991
+-0.0549513 0.0339195 0.0239841
+-0.00779971 0.114512 -0.0173201
+0.0213851 0.0754916 0.050294
+0.0297243 0.0538559 -0.0167895
+-0.00746204 0.125196 -0.00874293
+-0.0385113 0.0973107 0.0424108
+0.0437641 0.0599949 -0.00412714
+0.00932784 0.0581716 -0.0301717
+-0.07404 0.148543 -0.0208687
+-0.067363 0.177688 -0.0512074
+-0.00213372 0.123188 0.0349488
+-0.0180211 0.168338 -0.0139614
+-0.0254657 0.0678395 0.0426887
+-0.0266217 0.0436536 -0.0288174
+-0.0498332 0.0956322 -0.0221283
+-0.0772795 0.155549 -0.0169029
+0.0369068 0.0799159 -0.0147176
+-0.0788489 0.119288 -0.00581129
+-0.0101059 0.171125 -0.0207965
+-0.0324932 0.0774699 0.0412179
+-0.0434937 0.0705308 0.0420517
+-0.0158265 0.0869335 -0.0385904
+-0.00548754 0.123746 0.0343085
+0.0610091 0.0623122 0.0111052
+-0.00962571 0.0451144 -0.0282927
+-0.0687445 0.160961 -0.0529537
+-0.00991099 0.115578 -0.0164445
+0.0199768 0.126969 0.0170274
+-0.0827793 0.0771313 0.0211566
+-0.0119077 0.0894805 -0.0370977
+0.0238643 0.100811 0.0434608
+-0.0130347 0.166801 -0.0212915
+-0.0934989 0.122762 0.0122811
+-0.0667245 0.0765676 -0.016644
+-0.0391998 0.0351247 -0.0118182
+-0.0445637 0.128075 -0.00132731
+-0.0258871 0.0377455 0.0194558
+-0.093776 0.124126 0.0142628
+-0.0698753 0.117966 -0.00835455
+-0.0515005 0.100157 0.0426446
+-0.0404873 0.112547 0.0355988
+-0.0674682 0.0382926 -0.00574154
+-0.0624974 0.0876076 0.0451456
+-0.0367451 0.0768715 -0.019149
+-0.00349748 0.0870382 0.0570453
+0.0243264 0.0591823 -0.0248233
+-0.0604582 0.154406 0.00215902
+-0.0742084 0.067281 0.00145303
+0.0461952 0.0834391 0.00817714
+-0.0246581 0.0664552 0.0433381
+0.0223219 0.0402539 -0.00770693
+-0.0269495 0.0511315 0.0418642
+-0.0426785 0.060742 -0.0126195
+-0.0470567 0.069722 0.0403886
+-0.057499 0.0889744 0.0446686
+-0.0925962 0.126825 0.0102659
+-0.0627541 0.166279 -0.0425846
+0.00227655 0.0655175 -0.0339267
+-0.0152717 0.181584 -0.0271612
+-0.0527991 0.0578707 0.0222512
+0.0181983 0.0768373 0.0527356
+-0.020287 0.0445184 0.0528933
+-0.0230546 0.0388523 0.0540611
+-0.0591948 0.0603156 -0.00052226
+-0.0356179 0.0505976 -0.0108834
+-0.0125985 0.0420542 -0.026434
+-0.0457346 0.0337173 0.00640665
+-0.0271239 0.117991 -0.0128729
+-0.0287901 0.105845 -0.0221143
+-0.0791947 0.116328 0.04948
+-0.037475 0.126933 -0.001254
+-0.0652274 0.172558 -0.0603808
+0.0249025 0.0659023 0.0447242
+0.0444853 0.062436 0.0294527
+-0.0584017 0.0411488 0.0207065
+-0.0637308 0.0380192 0.0421186
+-0.0224637 0.0768447 0.053535
+-0.0472049 0.132217 0.00449629
+-0.055985 0.033885 0.0237996
+-0.0637704 0.158563 -0.0153492
+-0.0889154 0.0875162 0.0124615
+-0.0630601 0.155204 -0.0366146
+-0.0858283 0.1008 0.00139713
+-0.00849876 0.0884233 0.057199
+-0.0464295 0.156494 0.00819518
+-0.0875333 0.0927687 0.0054156
+-0.0555067 0.053407 0.0086882
+-0.0319429 0.0346356 0.0246022
+-0.0532414 0.127751 -0.00500041
+-0.0324852 0.0946249 0.0445277
+-0.0652259 0.166727 -0.0597961
+0.0318258 0.090298 0.0426417
+0.0227624 0.0959793 -0.0216236
+0.0453464 0.0791637 0.00120688
+-0.00148178 0.0718081 0.0578063
+0.0484981 0.0664872 0.0276228
+-0.0638124 0.0339885 0.0132249
+0.0378702 0.100686 0.0303226
+0.0423416 0.0718943 -0.00578991
+0.0449549 0.0889654 0.0201657
+-0.0505604 0.0431885 -0.0101401
+0.0305345 0.113708 -0.00653825
+0.0175297 0.092684 0.048312
+-0.0405439 0.0338701 -0.0146326
+-0.0151193 0.0387785 0.0315419
+0.0425177 0.0660617 -0.00221978
+-0.0261619 0.0381432 0.054147
+-0.0435068 0.0576714 0.0396679
+-0.0531482 0.161241 0.00587596
+-0.0897425 0.0915834 0.0134432
+0.00549953 0.119637 0.0367537
+-0.00877042 0.130092 0.00788453
+-0.0417274 0.0725105 -0.0179617
+-0.0534984 0.0776159 0.0431279
+-0.0290767 0.121891 0.0239314
+0.0583737 0.0676977 0.00512132
+-0.0647358 0.157148 -0.0507072
+0.0435656 0.0945094 0.0231538
+-0.0220003 0.181634 -0.0125756
+-0.0298816 0.0621837 -0.0234188
+-0.0460097 0.127427 -0.00464706
+-0.0136152 0.0982979 -0.0261721
+-0.0662958 0.0637695 -0.0035905
+-0.0920915 0.118829 0.0424602
+-0.0157421 0.0686009 -0.0381423
+-0.063492 0.0819119 0.043822
+0.0519248 0.0461654 0.00821164
+-0.0528781 0.0490838 0.0346622
+-0.0896974 0.137929 0.0351902
+-0.0502406 0.140114 0.00340131
+-0.0460575 0.131197 0.00582383
+-0.0398248 0.0928735 -0.0232663
+-0.0287922 0.165339 -0.00670006
+-0.0017304 0.0712031 -0.0351875
+-0.0386191 0.118326 -0.013151
+0.0193849 0.126884 0.00540105
+0.0309645 0.0363887 0.0195722
+-0.0314998 0.155167 -8.72409e-05
+-0.000786782 0.0826169 -0.0366787
+-0.0771272 0.155133 0.00894547
+-0.00248977 0.112799 0.0419964
+-0.0279028 0.160261 -0.0136941
+-0.0431979 0.129461 0.00840104
+-0.0208217 0.0854768 -0.038298
+-0.01776 0.0714448 -0.0386564
+0.00624218 0.039472 0.0335072
+-0.0639011 0.119458 -0.00893676
+-0.0667029 0.176899 -0.0509708
+-0.0245413 0.0349941 -0.0287041
+-0.0487364 0.0753122 -0.0176891
+-0.0669945 0.169371 -0.0323347
+-0.00928822 0.0393788 0.0494849
+-0.0239808 0.0936155 -0.0313592
+0.0224894 0.0906371 0.0481279
+0.0242369 0.0748124 -0.0257049
+-0.0243462 0.1625 -0.00551798
+-0.0625942 0.153749 -0.0125838
+-0.0486891 0.137066 0.0163891
+-0.0679674 0.0350577 0.0131968
+-0.0626161 0.12969 0.0410793
+-0.0263812 0.120789 0.0279195
+-0.0802896 0.144766 0.0426469
+0.0132183 0.0794258 -0.0310561
+-0.0415045 0.0548576 0.0396938
+-0.00948994 0.0952069 0.0546127
+-0.0903261 0.135124 0.0222174
+-0.0574953 0.153709 0.0290191
+-0.0428742 0.10707 -0.020141
+0.057983 0.0674087 0.022273
+-0.0297438 0.0593588 -0.0214043
+-0.0562018 0.0589495 -0.00340637
+-0.0230647 0.0402418 0.0541248
+-0.062019 0.17397 -0.0618399
+-0.0412895 0.149153 -0.00363446
+-0.0485728 0.0503685 -0.00899002
+-0.00748812 0.10728 0.0439222
+-0.0336555 0.0709359 -0.0204834
+-0.0407158 0.171931 -0.00126808
+-0.0610791 0.151413 0.0351388
+-0.0221494 0.0384504 -0.005885
+0.00439305 0.11559 -0.018534
+-0.0241215 0.0944713 0.0461972
+-0.0547672 0.0812274 -0.0214088
+-0.0846583 0.0777659 0.00751712
+-0.0574282 0.0507609 0.000628334
+-0.00874511 0.0976201 -0.0294139
+-0.022979 0.0380859 0.023348
+0.043448 0.0916342 -0.00278755
+0.0145196 0.123096 0.0322223
+-0.0415646 0.125825 -0.00703356
+-0.0726695 0.171671 -0.0330178
+-0.010471 0.0378949 -0.0160892
+-0.0488368 0.0970812 -0.0221898
+-0.0586032 0.141 0.0328315
+-0.0117815 0.0347775 0.0429519
+0.0116378 0.0603198 0.0518663
+-0.0459594 0.0560107 0.0380589
+0.0399446 0.107028 0.0121641
+0.00710547 0.0893998 -0.032814
+0.0410678 0.10142 0.0221661
+-0.0244452 0.181836 -0.00961144
+-0.013259 0.121231 -0.0103976
+-0.0454789 0.123431 0.0251209
+0.0285377 0.0523356 -0.0187697
+0.0588289 0.0691072 0.0191593
+0.0125005 0.1007 -0.0226033
+-0.0595569 0.153648 0.0312116
+-0.00403867 0.0994311 -0.025339
+0.00148661 0.108625 0.0426664
+-0.0327389 0.0482896 -0.0213368
+-0.0380117 0.0344553 0.0341354
+-0.072467 0.0968801 0.0405541
+0.0151781 0.0847217 0.0519158
+-0.0425055 0.108838 -0.0192163
+-0.00749309 0.114174 0.0409291
+-0.0434968 0.119301 0.0295385
+0.0363932 0.0476439 -0.00624826
+-0.079546 0.0719865 0.0195582
+-0.0564882 0.042714 0.0457133
+-0.0113851 0.0383094 0.011049
+-0.0865431 0.106355 0.0183534
+-0.0313759 0.0553098 -0.0143786
+0.0515215 0.0651377 0.0281771
+0.0253513 0.0605347 -0.0238887
+-0.0627683 0.164709 -0.0355885
+-0.0520878 0.0489475 0.0226481
+-0.0371717 0.165191 -0.0136726
+0.0421423 0.0738117 0.0292393
+0.0499661 0.0451421 0.0208878
+-0.0394943 0.116662 0.0325452
+-0.085625 0.079203 0.01151
+-0.0716025 0.135501 0.0492566
+-0.00270958 0.0391757 0.033738
+-0.0911953 0.143381 0.0241598
+0.0418026 0.102869 0.0141608
+-0.0319458 0.0708051 -0.0254622
+-0.0626184 0.145978 -0.00858061
+0.0207857 0.0994851 0.0460447
+0.0275851 0.114088 0.0330397
+-0.040502 0.120714 0.028794
+-0.0853944 0.101863 0.0264831
+0.00328879 0.0668715 -0.0332298
+-0.0446453 0.0577855 -0.0118043
+0.0188777 0.03558 -0.00867348
+-0.064488 0.156133 0.0221359
+-0.00921165 0.172686 -0.0275682
+-0.0426232 0.0362716 0.0437883
+-0.0246131 0.0422659 -0.0289978
+-0.0766564 0.0773474 -0.00857073
+0.0281325 0.121698 0.0129367
+-0.00471394 0.0641886 -0.0352179
+-0.0274456 0.0382197 0.0539829
+-0.0417615 0.03357 0.00191851
+-0.0596536 0.0350995 0.0445384
+-0.0458215 0.091313 -0.0218951
+-0.00569643 0.0599053 -0.0346867
+-0.0728066 0.087878 -0.0157134
+0.00467021 0.0347458 0.0211501
+-0.0369631 0.0341718 -0.0179086
+-0.0700564 0.162427 -0.0118963
+-0.0938276 0.126933 0.0242666
+-0.0207424 0.110014 -0.0205123
+0.00150816 0.0911296 0.0556681
+-0.00874857 0.0727984 -0.0375275
+-0.0679476 0.156599 -0.00385029
+-0.076928 0.152806 -0.00788984
+-0.0860408 0.109124 0.0103593
+-0.0514909 0.0544833 0.0216233
+-0.0756545 0.151363 -0.0148873
+0.0423862 0.047532 -0.00502925
+-0.0895419 0.0916017 0.0194388
+-0.014074 0.128231 0.00303832
+-0.0747094 0.155646 0.00979649
+-0.0931712 0.117411 0.0223074
+-0.0548599 0.145302 0.0295141
+-0.058163 0.0467738 0.0296766
+0.00351191 0.0459363 0.0483003
+-0.091423 0.144753 0.0241539
+0.0174632 0.0948293 0.047857
+-0.0326373 0.119597 -0.0104942
+0.0206219 0.119357 0.0335278
+-0.0174992 0.0897364 0.0558751
+-0.00978193 0.0784455 -0.0377778
+0.0236993 0.12332 0.00130956
+-0.0792974 0.15265 0.00222093
+-0.0444956 0.102933 0.0417949
+0.0152822 0.129138 0.0167187
+0.0467013 0.0718392 0.0195936
+-0.0883363 0.112382 0.0405773
+-0.0515091 0.105631 0.0400498
+0.00121056 0.115576 -0.018509
+-0.0525671 0.0335472 0.0123651
+-0.0285962 0.0377287 0.0207135
+0.0043328 0.0341303 0.00522853
+-0.0914252 0.114627 0.0103302
+-0.0231203 0.163764 -0.0160465
+-0.0077447 0.0698983 -0.036343
+-0.0650951 0.162442 -0.0187197
+-0.0652725 0.0613084 0.02088
+0.0455972 0.0415054 0.0160287
+-0.0554928 0.148133 0.0286364
+-0.0709153 0.113624 -0.0087498
+-0.0390311 0.160893 0.00133569
+-0.0669712 0.156006 0.0125516
+-0.0607902 0.0334775 -4.36679e-05
+-0.0634989 0.108392 0.0384413
+-0.0239757 0.0768012 0.0522149
+-0.0671254 0.128435 0.0486555
+-0.0368355 0.153629 0.00272174
+-0.0280768 0.169745 -0.00916431
+0.00750786 0.0518308 0.0519822
+0.017486 0.112589 0.0378808
+-0.0694907 0.0930374 0.0422024
+-0.0457991 0.0336321 0.00104877
+0.0385285 0.0901386 0.0347352
+0.0154693 0.0976312 0.0477084
+-0.0134564 0.0347657 0.0443699
+0.0132374 0.123205 -0.00876652
+0.0204758 0.0975716 0.0468126
+-0.0702558 0.152263 -0.0463745
+-0.0361586 0.0382819 -0.0067057
+0.0546048 0.0478149 0.0122009
+-0.0455357 0.120317 -0.0132441
+-0.00750778 0.0828941 0.0575015
+-0.0338576 0.0347656 0.029445
+-0.0195033 0.118175 0.0352728
+0.0125203 0.0616669 0.0514026
+-0.0196496 0.0582641 0.0484904
+0.0383367 0.0910432 -0.012345
+-0.00538883 0.122125 -0.0114557
+-0.075455 0.0675485 0.016865
+-0.0362517 0.123246 0.0257763
+-0.0815948 0.123081 0.0504133
+-0.00479304 0.130806 0.0179661
+-0.0776418 0.158287 -0.0219264
+-0.0484803 0.117974 0.0310954
+-0.0386541 0.126132 0.0204051
+-0.0786087 0.102098 0.0338163
+0.0464344 0.0792618 0.0111808
+0.0289709 0.0848578 0.043728
+-0.0184969 0.10579 0.0426906
+-0.0245528 0.116739 0.0335827
+-0.0754858 0.146995 0.0422823
+-0.0528151 0.132539 0.0323863
+-0.00781365 0.086863 -0.0372016
+0.0145549 0.126574 -0.00243153
+-0.0834735 0.076324 0.00852235
+-0.0597355 0.0752692 -0.0179534
+-0.0853298 0.111023 0.0405559
+-0.0515948 0.137023 0.025408
+-0.0693375 0.168152 -0.0246084
+-0.0781507 0.115089 0.0495991
+-0.0468723 0.0587675 0.0374438
+0.0193537 0.0349459 0.0257791
+0.0243371 0.123621 0.0229269
+-0.0907106 0.133758 0.0262122
+-0.0542023 0.0435162 0.019691
+-0.036169 0.0335901 -0.0284162
+0.0196024 0.0858351 -0.0269873
+0.0084996 0.0488213 0.0500608
+-0.0308481 0.0664794 -0.025463
+0.0262324 0.0775308 -0.0242027
+0.0470911 0.0422949 0.0155431
+0.0315748 0.0605586 0.0402762
+-0.0722147 0.149455 -0.0385736
+-0.0695516 0.170347 -0.0304219
+-0.0404175 0.171209 -0.00987004
+0.0299365 0.0350356 0.00770058
+-0.0466417 0.133657 0.014443
+0.0130913 0.0937889 -0.0272955
+-0.0579449 0.059547 -0.000261977
+-0.0285818 0.121272 -0.00825717
+-0.0713326 0.0345571 0.00760774
+-0.0666503 0.135429 0.0440071
+-0.0303959 0.0762676 -0.0335676
+-0.00385838 0.101641 -0.0231016
+-0.0679568 0.13115 -0.00879393
+0.00350598 0.0870278 0.056972
+-0.0248582 0.0752289 0.048914
+-0.0588955 0.0336882 0.0145047
+-0.0563129 0.159837 0.00207063
+-0.064096 0.14766 -0.0219948
+-0.00992774 0.110288 -0.021044
+-0.0709029 0.110786 -0.0101311
+4.37647e-05 0.0392736 0.0324137
+0.0144567 0.0617415 0.0506755
+-0.0304982 0.117934 0.0308066
+-0.0124153 0.129138 0.0195683
+-0.0045458 0.042944 0.0478735
+-0.078629 0.155228 0.0230232
+-0.0793587 0.143462 0.044583
+-0.011946 0.163588 -0.0146751
+-0.0489654 0.138607 0.014392
+0.0130851 0.034266 -0.0137357
+0.0405023 0.0484755 0.0322215
+-0.0440255 0.0336276 -0.0225259
+-0.0185094 0.114097 0.0385959
+-0.0708508 0.173984 -0.0409178
+-0.0698895 0.170875 -0.0319754
+-0.0268752 0.105825 -0.0224483
+-0.0921157 0.118792 0.0303066
+-0.0715954 0.155396 -0.0419127
+0.0239203 0.108291 -0.0147313
+-0.0163998 0.119263 -0.0123023
+-0.0327198 0.0652554 -0.0184496
+0.0457714 0.0848094 0.0151676
+-0.062838 0.15526 0.00677387
+-0.0562712 0.146757 0.030967
+-0.00723161 0.0381024 0.0489495
+0.0208841 0.115302 0.0356376
+-0.0311112 0.162246 -0.0146263
+-0.0185025 0.0757876 0.0552584
+0.0369413 0.0993952 0.0325229
+-0.0597781 0.0668249 0.0348598
+-0.0676678 0.0697151 0.0342008
+-0.00507021 0.128586 -0.00238902
+0.035697 0.096801 0.0360155
+0.0179331 0.121039 -0.00844165
+0.00149286 0.100277 0.0469858
+0.0132581 0.0348304 0.0408908
+-0.0746487 0.0760382 -0.00984365
+-0.076866 0.0994719 0.0363813
+-0.00904748 0.0388121 -0.00544357
+-0.0378518 0.0985762 -0.0221892
+-0.0494929 0.0804959 0.044039
+0.0288964 0.120556 0.0189249
+0.0252898 0.0704815 -0.0246106
+-0.0831283 0.107448 0.000408412
+-0.0465019 0.129507 0.0239285
+-0.056621 0.0562362 0.00665228
+-0.00564116 0.0481924 -0.0303539
+-0.0944779 0.122838 0.0232837
+-0.0876178 0.105003 0.0113725
+0.0221833 0.125827 0.00929485
+-0.0376403 0.0562958 -0.0110081
+-0.027315 0.119916 0.0290701
+0.0347431 0.103404 0.0328426
+0.0317883 0.117354 0.00287906
+0.0203254 0.040014 -0.0146997
+-0.0780017 0.150056 -0.00287894
+-0.0106261 0.0451108 -0.0281505
+-0.0729498 0.156259 0.0191473
+0.0393029 0.10195 0.0270711
+0.0182702 0.0422045 0.0436952
+-0.0802626 0.147413 0.0397079
+-0.00132352 0.0966684 -0.0303753
+-0.015259 0.0984512 0.0471298
+0.0451952 0.0433405 0.023507
+-0.0438866 0.108471 -0.0191595
+-0.0159384 0.124168 -0.00545234
+-0.0654957 0.105611 0.0395613
+-0.0904683 0.135081 0.0142287
+0.025208 0.0874192 -0.0236148
+0.0366057 0.0954909 0.0355184
+-0.0887482 0.102363 0.0163794
+0.00249078 0.115545 0.0403845
+-0.0778809 0.0759658 0.0302027
+-0.045814 0.0898818 -0.0220292
+0.0125705 0.0658518 0.0532694
+-0.00597277 0.130385 0.0204408
+-0.0581881 0.125521 0.0404357
+-0.0307415 0.0374976 -0.017878
+-0.0742647 0.109022 0.03931
+0.0186443 0.123322 -0.00490878
+-0.0769902 0.154182 -0.00989517
+0.0130083 0.0956231 -0.0252421
+0.00953036 0.10442 0.0445691
+0.0186389 0.0520546 0.0461071
+-0.0463977 0.0397105 -0.0152844
+0.0444376 0.0959725 0.0121619
+-0.0216077 0.0350207 0.0511065
+0.0463433 0.054773 -0.00593764
+-0.0875696 0.115156 0.045661
+-0.00311195 0.130927 0.00709886
+-0.0627873 0.0335028 0.00493012
+-0.0894432 0.151569 0.0164701
+-0.0668923 0.109473 -0.0126504
+-0.053788 0.0854855 -0.0214384
+-0.00382944 0.108004 -0.0223654
+-0.0447162 0.0448943 -0.0112435
+0.0262334 0.121101 0.000829633
+0.0206734 0.0795401 0.0510479
+-0.0434655 0.127159 0.0186744
+-0.0273746 0.181651 -0.00921581
+-0.0045009 0.116806 -0.0157814
+-0.0529179 0.162663 -0.000927718
+0.0278575 0.109692 -0.0122334
+0.0114621 0.125412 0.0310862
+-0.055877 0.0984248 -0.0207921
+-0.0649536 0.0595166 0.0136311
+-0.0899789 0.116378 0.0441376
+-0.0344621 0.154617 -0.00886992
+-0.0641249 0.156393 -0.0431197
+0.0264267 0.0824949 -0.0235141
+-0.0699148 0.109401 -0.011164
+-0.0645122 0.0398643 -0.00676714
+-0.0927009 0.117475 0.0353038
+0.00812049 0.107282 -0.0201059
+0.0344124 0.0957227 -0.013333
+-0.0617126 0.170956 -0.0545977
+-0.0888439 0.150092 0.0112242
+-0.0600859 0.0421217 0.0440266
+-0.0535039 0.0805657 0.0446207
+0.00913683 0.0873343 0.0554698
+0.0318118 0.100781 0.0373962
+-0.0366211 0.124122 -0.00724685
+0.0255511 0.0463382 0.0384325
+-0.00473212 0.0386351 0.0247855
+-0.0857334 0.153425 0.016223
+3.04988e-05 0.11432 -0.019028
+-0.0622192 0.17721 -0.0606003
+-0.00533435 0.0930519 -0.0346806
+-0.0578363 0.0912193 -0.0212351
+-0.051575 0.132941 -0.0025104
+-0.0215094 0.0983521 -0.0242621
+-0.0663625 0.141125 0.0427387
+0.0411659 0.0952708 0.0280268
+-0.053497 0.0945663 0.0438533
+-0.0745177 0.171112 -0.0322615
+-0.0779361 0.129573 -0.00656407
+-0.0437814 0.0840812 -0.0212189
+0.00326914 0.0682665 -0.0330635
+-0.0739332 0.177709 -0.0464055
+0.0528574 0.0622185 0.0288955
+-0.0365021 0.101484 0.0413625
+-0.0445836 0.0476428 -0.0105653
+-0.0194973 0.101611 0.0435898
+-0.0137239 0.16215 -0.0118322
+-0.0287184 0.0806953 0.0455388
+-0.0933646 0.117392 0.0153085
+-0.0867701 0.113047 0.00428618
+-0.0052769 0.0941788 -0.0338289
+0.0134806 0.0976663 0.0482444
+-0.08743 0.111796 0.0214228
+0.00133097 0.0626915 -0.0339607
+0.0447988 0.0903457 0.000177034
+0.00183354 0.10009 0.0472603
+-0.0323685 0.0497273 -0.0163483
+-0.0848994 0.144621 0.00617242
+-0.0707871 0.0625817 0.00788057
+-0.0334706 0.0589721 0.0386927
+0.0458044 0.0834139 0.0161713
+-0.0638595 0.159101 -0.0532849
+-0.0169095 0.0379753 -0.0273392
+-0.0683614 0.15578 0.00913576
+-0.0841262 0.110345 0.0263651
+-0.0629048 0.1054 -0.0169977
+-0.00482937 0.038542 0.00854039
+0.00442082 0.039258 0.029719
+0.0287437 0.0416628 0.0306503
+-0.0480218 0.144366 0.00442748
+-0.0718881 0.109321 -0.0102252
+-0.0623027 0.153756 -0.0145815
+0.0312054 0.104936 -0.0131412
+-0.0502712 0.143189 0.0133798
+-0.0679015 0.120916 -0.00896008
+-0.0325574 0.126601 0.00788172
+0.00400981 0.0391328 0.0279405
+-0.0790033 0.16525 -0.0329555
+-0.0464892 0.117969 0.0304809
+-0.0171987 0.127433 0.00332106
+-0.0589607 0.145338 0.0340833
+-0.00576935 0.0346302 0.0443351
+-0.0894143 0.118584 0.00330542
+-0.0494955 0.0890237 0.0451636
+-0.0395958 0.118487 -0.0133369
+0.0256371 0.0346096 0.00722464
+0.0101261 0.0846794 0.0551401
+-0.000640169 0.0481947 -0.0300913
+0.00652044 0.0799801 0.0556018
+-0.0485004 0.157854 0.0090451
+-0.0674788 0.153589 0.0328337
+-0.0246191 0.0436702 -0.0286423
+-0.0380903 0.041957 -0.0274154
+-0.0592055 0.155872 0.0109493
+-0.0158317 0.0382446 0.00839116
+-0.0862834 0.141953 0.0402325
+-0.0178783 0.0381567 0.0189161
+-0.00165332 0.0511407 -0.0309868
+-0.0515122 0.0598238 0.030703
+0.0226361 0.118891 -0.00814073
+0.0433138 0.0902166 -0.00378785
+-0.0339799 0.0384942 -0.0120095
+-0.0424937 0.0748068 0.0427898
+-0.0640892 0.172567 -0.049571
+0.037431 0.0794424 0.0366005
+0.041759 0.0432404 0.0265421
+-0.0923571 0.121517 0.0426088
+0.0562687 0.0726263 0.0113628
+0.024692 0.100819 0.0429025
+-0.0729148 0.110726 -0.0089954
+-0.0295018 0.159581 0.00108834
+-0.0672997 0.0435653 0.00884843
+0.0172829 0.0651656 -0.0289948
+-0.0585687 0.0340745 0.0248573
+0.0320945 0.113613 -0.00441584
+-0.0726455 0.0655594 0.00286688
+0.0223162 0.0649555 -0.0263733
+-0.0636659 0.0691264 -0.011804
+-0.0495225 0.143222 0.00950726
+-0.0396922 0.156587 0.00568688
+0.00749975 0.089676 0.055015
+0.0495971 0.0465817 0.0239661
+-0.0390578 0.156263 -0.0100859
+-0.0708823 0.172457 -0.0366471
+0.0126883 0.0343606 -0.00448368
+-0.0454899 0.0690197 0.0407796
+-0.0413446 0.0335325 -0.0237744
+-0.0404379 0.124957 -0.00812413
+0.0440209 0.0945174 0.0011806
+-0.0627245 0.073729 -0.0165415
+-0.0286056 0.0475856 -0.0255224
+-0.0495036 0.153584 0.0107879
+-0.0896132 0.139307 0.0341845
+0.030074 0.119769 0.00796635
+-0.0517393 0.0517191 0.022632
+-0.023961 0.0723529 0.0481115
+-0.0309909 0.0384268 -0.00579914
+-0.00634516 0.0379873 -0.0153566
+-0.0547761 0.0333427 -0.00414144
+0.00202824 0.108029 -0.0204102
+0.0450661 0.0761937 0.0228711
+-0.084679 0.0869987 0.027663
+-0.0219636 0.0681726 0.0490783
+0.0226059 0.0375679 0.034289
+-0.0518654 0.101358 -0.0214215
+-0.0919525 0.126983 0.0392569
+-0.0663498 0.172859 -0.0450539
+0.00551307 0.0856288 0.0568655
+-0.0269831 0.0381412 0.0278748
+0.0430768 0.0411155 0.00329204
+0.0317014 0.117733 0.0199863
+-0.0326228 0.0506668 -0.0115219
+-0.0760639 0.155862 0.0136886
+-0.0581543 0.0337417 0.0181646
+0.0454926 0.0875897 0.015162
+-0.0197923 0.038435 -0.00354579
+-0.0461288 0.15913 -0.00829043
+-0.0235066 0.108523 0.0406075
+0.015525 0.127932 0.00115163
+0.00251501 0.0814623 0.0569927
+-0.0485603 0.131756 0.000870882
+-0.0909462 0.11476 0.0333322
+0.038369 0.0884214 -0.0137726
+0.0179084 0.127905 0.00771503
+0.0457915 0.0862101 0.0121678
+-0.0310416 0.0763051 -0.0325503
+-0.0584963 0.0946188 0.0448266
+-0.00142898 0.112626 -0.0193593
+0.0537506 0.0519895 0.000247391
+-0.00249736 0.0978288 0.0524276
+0.0474285 0.0692644 0.00256538
+-0.0157146 0.17719 -0.0193767
+-0.0688721 0.0369953 0.0119906
+0.0262296 0.0888085 -0.0227773
+-0.0876687 0.0981895 0.00443327
+-0.0435601 0.129686 0.00973169
+-0.0620348 0.146024 -0.00560988
+0.0228232 0.123119 -0.000681491
+0.0192101 0.0791931 -0.0277308
+-0.0285078 0.0348913 0.0463089
+-0.0295006 0.116619 0.032366
+0.00540344 0.040445 -0.0238712
+-0.0861937 0.0819823 0.0184808
+-0.0691313 0.170851 -0.0540166
+0.0232722 0.0691857 -0.0260989
+0.0346775 0.106404 -0.00868031
+-0.0626839 0.154165 0.00249175
+0.0203005 0.047637 0.041402
+0.0426083 0.0915862 -0.00481093
+-0.00121535 0.0394284 0.0356173
+-0.0290126 0.0606872 -0.0244213
+-0.0522249 0.152155 0.0138449
+0.0278367 0.0781921 0.0455692
+-0.0782715 0.168666 -0.0333616
+-0.0631194 0.0357147 0.0189543
+0.00237959 0.0976208 -0.0273765
+-0.0327796 0.0736593 -0.0265049
+-0.0590695 0.143884 0.0338908
+-0.0366032 0.0407784 -0.0289892
+-0.0564911 0.0400264 0.0468768
+-0.0891224 0.133627 0.00423095
+-0.00349883 0.095211 0.054715
+-0.0365564 0.0488017 -0.0133944
+-0.063603 0.0406323 0.0405017
+0.00388987 0.0987683 0.0495103
+-0.0341448 0.166698 -0.0152744
+0.0422984 0.0789118 -0.00576754
+-0.0821777 0.153468 0.0263012
+-0.0618022 0.0852922 -0.0192956
+-0.0825795 0.0937805 -0.00656944
+0.0526059 0.0476644 0.00422036
+-0.0617323 0.155315 -0.018581
+-0.0646798 0.158592 -0.0555006
+-0.0400438 0.127998 0.000725921
+-0.020826 0.0882193 -0.0372663
+-0.072774 0.083565 -0.0157894
+-0.0301375 0.0592681 -0.0204197
+0.053852 0.0700236 0.0237561
+-0.0192952 0.097132 0.0469462
+-0.0379042 0.0350553 0.0424096
+-0.0779467 0.170107 -0.0351609
+-0.0731753 0.162423 -0.0379582
+0.0293531 0.117442 -0.00254348
+0.00923639 0.0753581 -0.0333366
+-0.00523048 0.0381888 0.0482681
+0.0281109 0.0477624 0.0368744
+-0.00549683 0.095262 0.0547887
+0.016279 0.127286 0.0242335
+-0.000357095 0.0346671 0.0418309
+-0.0903031 0.113239 0.0103302
+-0.0435085 0.165227 0.00470373
+-0.000629686 0.0466337 -0.0288231
+-0.00267903 0.0583624 -0.0332032
+-0.0354553 0.163829 -0.00227816
+0.0329891 0.10525 -0.0114692
+-0.0511234 0.159083 -0.0045978
+-0.0738697 0.0672451 0.0209913
+-0.0513379 0.0345855 0.00988953
+0.0449495 0.041538 0.0177108
+0.0131716 0.128382 0.0245166
+-0.0119302 0.0975527 -0.0293786
+-0.0796395 0.11488 0.0476725
+-0.00554666 0.0429634 0.0481135
+0.0336755 0.115893 0.0150272
+-0.0865455 0.109036 0.0123603
+-0.0583287 0.0597422 0.0219213
+0.00142185 0.0361564 -0.0243567
+-0.0249379 0.182957 -0.0150514
+-0.00456935 0.0511652 -0.031379
+0.00983853 0.130485 0.0204326
+-0.020719 0.0739658 0.0533053
+-0.0922608 0.117447 0.0323019
+-0.0687753 0.15954 -0.0529632
+0.00943169 0.130854 0.0188531
+-0.0463671 0.133058 0.0160254
+0.0403868 0.0966272 0.0286723
+-0.0374342 0.125294 0.0223398
+-0.0254349 0.121225 -0.00822483
+-0.0287913 0.121291 0.025511
+-0.0275751 0.181449 -0.0130337
+-0.0292637 0.0364551 -0.0300736
+0.0333063 0.076755 -0.0177777
+-0.00838403 0.100228 -0.0241757
+-0.0917675 0.126924 0.040336
+0.0460105 0.0848241 0.0111686
+-0.0458316 0.03478 0.00723173
+0.0337176 0.0655129 -0.0167917
+-0.0900318 0.128311 0.0429434
+0.00340705 0.0404653 -0.0241388
+-0.0445167 0.0334752 0.00325528
+-0.0417025 0.170926 -0.000183345
+-0.0667272 0.0750614 -0.0156487
+-0.075008 0.0665773 0.0124915
+-0.0256788 0.0387085 -0.0161237
+0.0433708 0.0459415 -0.00338184
+-0.0333944 0.0420411 -0.0295771
+-0.0366574 0.173333 -0.0118804
+0.0279341 0.0376089 0.0251213
+-0.0591944 0.0589798 0.00447595
+-0.0117173 0.0642717 -0.0365887
+0.0284258 0.044601 -0.00619231
+0.0407559 0.0844033 -0.0107694
+-0.0149445 0.0386028 -0.00457425
+-0.0666364 0.150881 -0.0385507
+-0.0441588 0.156514 0.00623469
+-0.0338796 0.174703 -0.0134692
+-0.0700283 0.075334 0.0376711
+-0.0144851 0.120961 0.0347298
+-0.0394983 0.0690894 0.041721
+-0.0820593 0.0748753 0.013529
+-0.0262192 0.162456 -0.00472466
+-0.0573804 0.151726 0.0319973
+0.0238729 0.0463312 0.0395213
+-0.00887703 0.0985896 0.0509585
+-0.00180856 0.0881831 -0.0355551
+-0.0435257 0.128183 0.0171556
+-0.0137851 0.096091 -0.0318323
+-0.0776083 0.0770893 -0.00760024
+0.0515137 0.0637653 0.0289012
+0.0459041 0.087617 0.00917007
+-0.0946685 0.124165 0.0192665
+-0.0424078 0.0392874 -0.0253255
+0.0574465 0.0566575 0.0231489
+-0.0705315 0.0915903 0.0419348
+-0.062769 0.175495 -0.0615699
+-0.0614063 0.0419532 -0.0067475
+0.0222874 0.0635154 -0.025946
+-0.0325454 0.0624467 -0.016419
+0.0406665 0.105637 0.00516291
+0.00508145 0.125851 -0.00757191
+-0.0743566 0.148587 -0.0198592
+0.028537 0.0506236 0.0375191
+0.00550651 0.0897139 0.0554063
+-0.0165465 0.061194 0.0523676
+-0.0548344 0.113627 -0.016162
+-0.078421 0.120421 0.0514142
+0.0224472 0.0375897 0.0352799
+-0.0558038 0.116914 0.0367748
+0.0399293 0.104183 0.0231644
+0.00793957 0.0368635 -0.0077325
+-0.053287 0.119647 -0.012449
+0.0226022 0.1018 -0.0197774
+-0.0735157 0.102656 0.0375574
+-0.0544964 0.10974 0.0378742
+-0.0351154 0.127437 0.0128308
+-0.0759568 0.136911 -0.00615991
+-0.0228623 0.06956 0.0485197
+-0.00937118 0.0387712 0.0309279
+-0.0858362 0.103636 0.0243714
+-0.0777036 0.174395 -0.0426027
+0.0605358 0.0664822 0.0111446
+-0.0456637 0.0382067 -0.0202858
+-0.0494922 0.0833478 0.0446801
+-0.0717916 0.0893503 -0.0160567
+-0.0654224 0.156324 0.0217941
+0.0104303 0.128801 -0.000781749
+-0.0640931 0.122778 0.0478095
+0.012373 0.0343732 -0.00643255
+-0.00549358 0.0898053 0.0568842
+-0.0544984 0.0973596 0.0432594
+-0.0430782 0.154691 -0.00814248
+-0.058643 0.155634 0.0155202
+-0.0309118 0.10664 -0.0209245
+-0.0117675 0.0728437 -0.0380964
+-0.0685186 0.1456 0.0424246
+0.0168366 0.113017 -0.0157876
+-0.0567451 0.0768007 -0.0192338
+-0.0905785 0.121592 0.0451008
+-0.0564995 0.0889847 0.0448198
+-0.062649 0.164698 -0.0365908
+-0.0414211 0.0344456 0.0316667
+0.0235849 0.102638 -0.0186769
+0.0208761 0.115613 -0.0126037
+0.00135548 0.0496637 -0.030356
+0.0172645 0.0713208 0.051333
+0.0277553 0.0619298 0.0435605
+-0.0388696 0.105647 -0.0202518
+0.002402 0.041908 -0.0243037
+-0.00348806 0.11693 0.0398821
+-0.094215 0.120106 0.0172864
+-0.075338 0.161792 -0.0134783
+-0.0313944 0.0721215 -0.0285061
+-0.076236 0.178558 -0.0487103
+-0.0516597 0.0416063 0.0458402
+-0.0191702 0.169734 -0.0206461
+-0.0458479 0.0999438 -0.0215809
+-0.0608063 0.0939347 -0.0190005
+-0.0831639 0.108847 0.00132792
+0.0449523 0.0945963 0.00616781
+-0.089716 0.139255 0.0241831
+-0.0241715 0.165363 -0.00880477
+-0.0808978 0.121685 0.0496566
+-0.0776757 0.0873848 0.0375611
+-0.0575877 0.0343902 0.0335477
+0.0293569 0.0808765 0.0442663
+-0.0413959 0.1089 -0.0192706
+-0.0486555 0.0606014 -0.0118523
+-0.0263871 0.06465 -0.0314802
+-0.0479423 0.118344 0.0305757
+0.0368905 0.10997 0.023344
+0.00465961 0.0959425 -0.0295932
+-0.00250198 0.0647948 0.0567081
+0.0155008 0.0345049 -0.00593057
+-0.0414998 0.0944525 0.0421484
+-0.0425159 0.17187 -0.00332083
+-0.00662603 0.045146 -0.0285621
+-0.0728992 0.107873 -0.010241
+0.0162924 0.0680403 -0.0298148
+-0.058126 0.0494622 0.00265482
+-0.049929 0.0335244 -0.00515732
+-0.0592138 0.116352 -0.0129282
+-0.0876027 0.103683 0.0193632
+-0.0661658 0.170967 -0.0590604
+-0.00423283 0.0951855 -0.0328472
+-0.056711 0.153132 0.0293166
+0.0299135 0.0618945 0.0413957
+-0.0754312 0.179188 -0.0498593
+-0.0890756 0.0982905 0.00941744
+-0.0313333 0.114057 -0.0167329
+-0.0336201 0.0505969 -0.0107597
+0.0152428 0.0807565 -0.0298514
+0.000144172 0.129559 0.0255502
+-0.0166332 0.101644 -0.0236856
+0.0112856 0.0666869 -0.0306751
+-0.0719068 0.110755 -0.00961867
+-0.056773 0.082629 -0.0212703
+0.0224949 0.112674 0.0362232
+0.00494458 0.0356784 0.0456125
+-0.0401622 0.123949 0.0243503
+-0.0494029 0.0516267 0.0356191
+-0.000148869 0.0998138 -0.0237113
+-0.0494252 0.12902 -0.00225187
+-0.0351127 0.162221 -0.0139882
+-0.0801061 0.109977 -0.00253557
+-0.0583279 0.116979 0.0383609
+0.0214316 0.0768422 0.0503677
+-0.0637593 0.0357681 0.0182478
+-0.0679574 0.176267 -0.0485208
+-0.0466544 0.0636155 -0.0134601
+-0.018198 0.0896163 -0.0372798
+-0.0675078 0.167827 -0.0267933
+-0.0891218 0.136568 0.0391914
+-0.00634438 0.0961732 -0.0318818
+-0.0509131 0.144221 0.000402933
+0.020479 0.0822082 0.0508036
+0.0382522 0.0617095 -0.0097618
+0.0414447 0.0957847 0.0271584
+0.0495191 0.0624602 0.0299628
+-0.0525648 0.0515684 -0.00660684
+-0.0507038 0.0543653 0.0186143
+-0.0678764 0.117979 -0.00873338
+-0.0833731 0.0803286 0.00149951
+-0.0102345 0.169322 -0.0249254
+0.0161585 0.128774 0.0170439
+-0.0495011 0.0439447 0.0438293
+-0.0308936 0.0901442 -0.0248987
+-0.0380826 0.159224 -0.0120325
+-0.0684954 0.121776 0.0527683
+-0.0237994 0.178657 -0.0117033
+0.022476 0.125337 0.020807
+-0.0131867 0.0392232 0.050872
+-0.0828365 0.116201 -0.00217327
+-0.0792107 0.0760132 0.0281283
+-0.0418712 0.105657 -0.0205306
+-0.0265289 0.11806 0.03154
+-0.0485021 0.104259 0.0404773
+-0.0515007 0.164119 0.00202375
+-0.0628742 0.175671 -0.0555946
+-0.0385777 0.1595 0.00203018
+-0.0410438 0.162368 0.00371458
+-0.0683486 0.124257 0.0521552
+0.0311264 0.0469699 -0.00653546
+-0.0346775 0.127387 0.0115177
+0.0256926 0.105619 -0.0158649
+-0.0656817 0.0705232 -0.0118151
+-0.0889612 0.111861 0.0183359
+-0.027486 0.0646029 0.0384895
+0.0307322 0.108762 0.0340805
+-0.0647018 0.172123 -0.0473675
+-0.0914367 0.114681 0.021315
+-0.00481581 0.0882239 -0.0361964
+-0.0229882 0.0386094 0.0318708
+-0.0164825 0.0530314 0.0497852
+0.031763 0.0653471 -0.018741
+0.0313568 0.052068 0.0363454
+-0.0937998 0.118753 0.0153042
+-0.0460733 0.0336746 -0.01741
+0.00639772 0.0911374 -0.0325899
+-0.0665077 0.105605 0.0392145
+-0.037944 0.165312 0.00115508
+-0.0447719 0.0826286 -0.0206706
+0.015216 0.0849668 -0.0295884
+-0.00949197 0.121025 0.0361236
+-0.0728889 0.159628 -0.0359308
+-0.0212527 0.0696869 0.051144
+-0.0609844 0.0646638 0.031213
+-0.0787829 0.0926997 0.035689
+0.0098313 0.0644618 0.0545535
+-0.0435636 0.0476726 -0.0110362
+0.00292266 0.0383702 -0.00263564
+-0.0294982 0.0674485 0.03887
+-0.0594483 0.0590098 0.0188119
+-0.0331272 0.0335545 -0.0277881
+-0.0654135 0.17638 -0.0519366
+0.0381247 0.0827831 -0.0147803
+0.0274189 0.0834776 -0.02246
+-0.0754296 0.152593 -0.0138871
+-0.0626337 0.149615 -0.00617193
+0.0395378 0.100622 0.0273876
+-0.00317446 0.0951663 -0.0328247
+0.0284436 0.0721192 -0.0227379
+0.0256796 0.0353829 0.0212256
+-0.0100479 0.0388486 -0.00567581
+-0.0815042 0.149744 0.0353513
+0.0569923 0.0508892 0.0171854
+-0.0844404 0.100576 0.0283951
+-0.066663 0.0704664 -0.0109078
+0.011503 0.108488 0.0403225
+0.0346003 0.059954 -0.013776
+-0.00350072 0.0828956 0.0574459
+-0.0308908 0.0524482 -0.0143777
+0.0220365 0.0430228 -0.0147268
+-0.0499219 0.0558508 0.0334877
+-0.0315001 0.070354 0.040029
+0.0121741 0.0780107 0.0545179
+-0.040483 0.0423569 0.0419938
+-0.0438782 0.0343145 0.0294954
+-0.0243712 0.122748 0.0255975
+-0.013279 0.101966 -0.0239644
+-0.0635872 0.0445618 0.0346899
+-0.09116 0.146144 0.0251605
+0.0191385 0.125192 -0.000918824
+0.0439709 0.0776452 -0.00278508
+-0.034376 0.0448305 0.0451875
+-0.0292764 0.0508797 -0.0213979
+-0.0586802 0.148237 0.034554
+-0.0830867 0.0803012 0.027553
+0.0470243 0.0458757 -0.000608958
+-0.0124544 0.125711 -0.00519106
+-0.0316347 0.0511137 -0.0133654
+-0.0495769 0.126877 0.0317874
+0.0446953 0.0861142 -0.000824781
+-0.0164935 0.0744329 0.0555937
+-0.07397 0.135486 -0.00709777
+-0.0388049 0.0885478 -0.0231132
+-0.0738057 0.149865 -0.0338746
+-0.0612039 0.0347997 0.0427656
+-0.0248108 0.064983 0.0421327
+-0.0374965 0.120729 0.0294163
+-0.0773599 0.0940895 0.0370488
+-0.0221316 0.122996 0.0264112
+-0.0656835 0.180548 -0.0590311
+-0.0654403 0.114174 0.0440564
+-0.0576422 0.035457 -0.0105994
+0.0063341 0.0539359 -0.0303914
+-0.0624964 0.108382 0.0385383
+0.000507196 0.0474213 0.049671
+-0.0768403 0.0682209 0.0124564
+-0.0177152 0.0613627 -0.0358053
+-0.0708829 0.156323 0.0169624
+-0.0801272 0.0895173 -0.00861746
+-0.0681398 0.156014 0.0252192
+-0.0643944 0.0418449 0.0286723
+-0.0223108 0.122995 -0.00618559
+-0.0332179 0.0347336 0.0278325
+-0.0494838 0.129682 0.0301574
+-0.0874269 0.111566 0.0378689
+0.0078939 0.0373631 -0.01008
+-0.0556091 0.0372359 0.0469697
+-0.0495471 0.140136 0.00640196
+-0.0721891 0.0696552 -0.00460695
+-0.0645108 0.135348 0.0400634
+-0.00963836 0.0466527 -0.0295963
+-0.00450177 0.0856564 0.0572774
+-0.0726963 0.163825 -0.0409661
+-0.0831522 0.148677 0.0355101
+-0.0045943 0.109577 -0.0220661
+-0.0700292 0.14319 -0.0126949
+0.0170086 0.0672594 0.0509139
+-0.0184932 0.0842766 0.0574008
+0.0333985 0.0809938 -0.0187374
+-0.00658339 0.116828 -0.0157946
+-0.0830307 0.110356 0.0344756
+-0.0164574 0.11955 0.0353527
+-0.0437556 0.0335262 -0.0205177
+-0.0196754 0.180147 -0.0162801
+0.00748686 0.0427091 0.0452774
+0.047238 0.0525837 0.0312359
+-0.00150012 0.0842876 0.0575029
+-0.0647611 0.154265 0.00245101
+0.0385227 0.108358 0.00315989
+0.00616601 0.0343841 0.0199712
+0.0190967 0.127602 0.0138576
+0.0232916 0.104676 0.0408599
+-0.0209519 0.121676 -0.0087885
+-0.000475449 0.077417 0.0583222
+-0.0340577 0.0344858 -0.0194842
+-0.0449113 0.0342791 0.0293115
+-0.02963 0.125357 0.0045818
+-0.0442513 0.120873 0.0273959
+0.0233607 0.0713858 0.0478141
+0.0294074 0.0974659 -0.0171759
+-0.0251322 0.110719 -0.0192347
+-0.0168318 0.0883012 -0.0380546
+-0.0537516 0.078251 -0.0196488
+-0.0617185 0.155298 -0.026582
+0.0182327 0.0369462 -0.015679
+0.0204347 0.103384 0.043762
+-0.0271652 0.177189 -0.00775302
+-0.078183 0.161072 -0.0259393
+-0.000994284 0.0346324 -0.0168306
+-0.0369077 0.0407733 0.0449918
+-0.0117377 0.0685356 -0.0370961
+-0.0520176 0.136681 0.0271356
+-0.0244827 0.044849 0.0526821
+0.0122811 0.0490196 0.0473922
+-0.0310488 0.126128 0.0128475
+-0.0612252 0.0618413 0.0248018
+0.0110023 0.0872551 0.0546654
+0.0137177 0.0926941 0.0515916
+-0.050909 0.135812 0.0260882
+-0.0514988 0.090386 0.0447021
+-0.0776802 0.121779 0.0520726
+-0.0435045 0.0492094 0.0395536
+0.0427867 0.0445146 0.027427
+-0.0124587 0.0716774 0.0554083
+-0.0903482 0.115904 0.00630147
+-0.0676703 0.159658 -0.00956407
+-0.0534975 0.100135 0.0423919
+0.0299608 0.102103 0.0382304
+-0.0275896 0.0398384 -0.0294326
+-0.0354902 0.0576195 0.0391492
+-0.0365293 0.120277 -0.0112077
+0.000101878 0.111584 -0.0199068
+-0.0568115 0.11798 -0.012657
+-0.0134078 0.0383017 0.0160824
+-0.078485 0.131655 0.0526796
+-0.0630792 0.17626 -0.0613621
+0.00219436 0.0880897 -0.0340427
+-0.00664745 0.0511524 -0.0316637
+-0.0221856 0.122325 -0.00745001
+0.0517581 0.0684217 0.00143507
+-0.0206221 0.0450432 -0.0278804
+-0.0187788 0.181486 -0.0239544
+-0.0435029 0.119128 -0.0140097
+-0.0368374 0.0957548 -0.023046
+0.0360094 0.105316 -0.00780471
+-0.0310017 0.0339922 0.010953
+0.0468601 0.0467385 0.0270828
+-0.0800669 0.107282 -0.00460113
+0.0161405 0.0847501 0.0515574
+-0.0726437 0.152619 -0.0388965
+-0.030372 0.124909 0.019004
+-0.0532086 0.0387959 0.0470712
+-0.00947284 0.0717726 0.0568611
+-0.0417517 0.0449058 -0.0193246
+-0.0324319 0.159505 0.00208324
+-0.064273 0.0404086 0.0266782
+-0.0456914 0.0665681 -0.0150523
+-0.0317955 0.0901023 -0.0248195
+-0.0901544 0.148798 0.0121684
+-0.0448181 0.0898814 -0.0220536
+-0.00651 0.0385696 0.00453582
+-0.0505409 0.146308 0.012527
+-0.0736443 0.148637 -0.0247496
+0.0362923 0.0826461 -0.0167222
+-0.0582688 0.0380855 0.0465946
+0.0420736 0.0957824 -0.00279849
+0.059075 0.0677442 0.0201625
+-0.0118076 0.166362 -0.0213381
+-0.0293882 0.0593157 -0.02241
+-0.00750084 0.0688979 0.0559719
+-0.0834808 0.0763288 0.0055122
+0.0455463 0.0847945 0.0181695
+-0.0853379 0.139291 0.0436042
+-0.0127384 0.0714338 -0.0383051
+0.0288553 0.119043 0.000370228
+0.0382387 0.108322 0.00216703
+-0.0854254 0.147285 0.0350057
+-0.0290239 0.0918566 -0.0266024
+-0.089435 0.0996945 0.016394
+-0.0250572 0.0379934 0.0230062
+-0.0659224 0.108105 -0.0137141
+-0.0197383 0.064191 -0.0362126
+0.0332406 0.0828224 -0.0189128
+-0.050463 0.0627793 0.0338697
+-0.00332118 0.0928352 -0.0344367
+-0.0351624 0.0344214 0.0133327
+0.0337894 0.103744 -0.0118635
+-0.0685313 0.0435239 0.00368786
+-0.0915175 0.140609 0.0191776
+-0.0763247 0.0679089 0.0110614
+-0.0293662 0.0904135 -0.0285737
+-0.0268485 0.0931277 -0.028596
+-0.0493167 0.137038 0.00442458
+-0.0607789 0.121227 0.0419471
+-0.0167795 0.0984818 0.0458118
+-0.0218018 0.0947992 -0.0305488
+-0.0933659 0.118725 0.0133024
+-0.0263107 0.0780916 0.0488984
+-0.0689525 0.144454 -0.0174142
+-0.0698503 0.0980241 -0.015524
+0.0377251 0.0602627 -0.00973714
+-0.0616079 0.160003 -0.0285892
+-0.00362249 0.0451016 -0.0279234
+-0.0658161 0.0866791 -0.018673
+-0.0898976 0.132262 0.00523931
+-0.014426 0.0383347 0.0104075
+-0.0891789 0.14342 0.0311627
+-0.0516305 0.0633366 -0.0105425
+0.0421385 0.102872 0.00916356
+-0.073056 0.163825 -0.0399663
+0.0142799 0.0695538 -0.0310885
+-0.0191804 0.172724 -0.0156293
+-0.0111853 0.109046 -0.0214904
+-6.48961e-05 0.130222 0.00105503
+-0.037907 0.0368934 -0.0113278
+-0.0778791 0.116346 -0.00545689
+-0.0353032 0.042242 0.0460623
+-0.0732356 0.176411 -0.0530886
+0.0601048 0.0608967 0.00715985
+-0.052965 0.0595916 0.0265588
+-0.0564973 0.0762116 0.0428205
+-0.034872 0.104274 -0.0209307
+-0.058681 0.0336414 -0.0106847
+-0.082997 0.0883523 -0.00560613
+-0.0901456 0.140633 0.0231701
+0.059772 0.0594746 0.00715469
+0.0315129 0.0439606 0.0299133
+-0.0749354 0.108383 0.0378851
+-0.0718123 0.0950995 -0.0154446
+-0.017311 0.117579 -0.0145168
+-0.0492219 0.145089 -9.42983e-05
+-0.0492467 0.0335224 -0.00684693
+-0.077013 0.157587 -0.0116646
+-0.0395098 0.12077 0.029092
+-0.0676415 0.155906 0.0108585
+-0.0115046 0.0688083 0.054897
+0.00350877 0.068881 0.0557692
+-0.00832726 0.0349131 -0.024554
+0.00623924 0.0754282 -0.0343629
+-0.0601994 0.14968 0.0358889
+-0.0681006 0.0726203 0.0368546
+-0.0550659 0.154073 0.0197239
+0.0220423 0.0388246 -0.00567731
+-0.050633 0.0633988 -0.0111763
+0.0262673 0.0718723 -0.0242084
+0.00651709 0.084208 0.0565081
+-0.0508195 0.0927229 -0.0217389
+-0.0823617 0.110377 0.0328225
+-0.0443307 0.0345511 0.0362271
+-0.0664541 0.159015 -0.0105538
+-0.065725 0.180452 -0.0578644
+-0.00729397 0.0383333 0.0172997
+-0.083856 0.108875 0.00233606
+-0.0531754 0.160014 0.00733632
+-0.0617546 0.0335347 0.00511487
+-0.0436843 0.0666417 -0.0153695
+-0.0475053 0.16079 0.00736091
+0.0213151 0.0393899 0.0411211
+-0.0126085 0.0434839 -0.0264186
+-0.058072 0.135467 -0.00577889
+-0.0144744 0.0573903 0.0514423
+-0.0480757 0.15465 -0.00633475
+-0.0214326 0.158913 -0.0108411
+0.0317035 0.0927362 -0.0181479
+0.0258633 0.0505634 0.0389033
+-0.0916556 0.116096 0.0323166
+-0.0344737 0.0973629 0.0436701
+-0.0772898 0.158355 -0.013903
+0.00252455 0.078679 0.0567626
+-0.0768599 0.0852186 -0.0125783
+0.00638417 0.060281 0.0547831
+0.00351108 0.067509 0.0559028
+-0.0775506 0.172738 -0.0395384
+-0.0941076 0.120125 0.0222927
+0.0397169 0.0400457 0.0217023
+-0.00993012 0.125562 -0.00707028
+0.0207467 0.0387687 0.0412277
+-0.0770466 0.0947961 -0.0125384
+-0.0208658 0.163381 -0.0161046
+-0.0194871 0.0786419 0.0560662
+-0.00848562 0.0978428 0.0521021
+-0.00195749 0.0369571 0.00873581
+-0.0554658 0.14959 0.0286413
+-0.0613355 0.171315 -0.0617342
+-0.0405058 0.060576 0.0408455
+-0.019245 0.0381493 0.0168345
+0.0318352 0.0959581 -0.0155753
+-0.0894336 0.0956291 0.0144221
+-0.0562826 0.138192 -0.0042334
+-0.0587859 0.118384 0.0394982
+0.0557398 0.0577143 0.000186064
+0.021293 0.0347861 0.0208687
+-0.0521809 0.0564969 0.0230721
+-0.088994 0.140671 0.0361625
+-0.0626529 0.0336856 0.0101657
+-0.0346997 0.0808739 -0.0236048
+-0.0740754 0.0791322 0.0370556
+0.0424523 0.0958497 0.0251568
+0.0156501 0.129207 0.0125793
+-0.0758074 0.0766216 0.033593
+-0.053977 0.0335099 0.00491422
+-0.049617 0.115589 0.0334474
+-0.0151821 0.115592 -0.0164315
+0.0198002 0.113601 -0.0144182
+-0.0297803 0.0833036 -0.0335871
+-0.0888224 0.0929368 0.0224135
+-0.0255078 0.162179 -0.0150106
+-0.0468796 0.105628 -0.0200508
+0.0328144 0.0654355 -0.0177831
+0.0401246 0.0657991 0.0315825
+-0.0619246 0.161563 -0.0295917
+-0.0336612 0.0423072 0.0487868
+-0.0806782 0.140364 -0.00279029
+-0.0575747 0.034031 0.0251021
+-0.00250061 0.0856648 0.0572816
+-0.051497 0.0776631 0.0434639
+-0.0314085 0.177247 -0.00418119
+-0.0382796 0.035429 0.0243806
+-0.0273926 0.0381858 0.00428469
+-0.0590133 0.128179 -0.00718347
+-0.059761 0.058524 0.00837605
+-0.089717 0.142036 0.0301646
+-0.0708787 0.0634588 0.0196178
+0.017237 0.0368135 -0.0176915
+0.0283981 0.0848865 0.0446615
+0.042292 0.0669509 0.0276386
+-0.0400442 0.15362 -0.00816685
+-0.0666868 0.15458 -0.000433214
+0.00520355 0.0894816 -0.0332282
+-0.0438381 0.033833 0.0263899
+-0.0863798 0.100827 0.00341316
+-0.0560788 0.154579 -0.00133297
+-0.0130807 0.0387897 0.0319484
+0.0526374 0.0710929 0.00470311
+0.0114966 0.0923286 0.0527326
+-0.0637555 0.0336685 -0.00625178
+-0.0475689 0.0432884 -0.0109341
+-0.0725775 0.0367142 0.00725292
+-0.0374892 0.112529 0.0350998
+0.0350676 0.0395586 0.0248293
+-0.031508 0.0675059 0.0394967
+0.0422807 0.0831292 -0.00677447
+-0.0617624 0.0810326 -0.0192317
+-0.0601798 0.155861 0.0135147
+-0.0160151 0.185636 -0.0207096
+-0.0495589 0.141679 0.00640064
+0.0451001 0.0791381 0.000209359
+-0.00648871 0.115533 0.0401374
+-0.0179936 0.034905 0.0502652
+-0.0345243 0.0619374 0.0399691
+0.0253647 0.107408 0.0385761
+0.0241683 0.0795725 0.0490812
+-0.076883 0.154198 -0.00789596
+-0.022619 0.0436731 -0.0285417
+0.0302544 0.115002 0.0294335
+-0.0112354 0.0407042 0.0501624
+-0.0374964 0.118015 0.0312717
+-0.0264155 0.169752 -0.0102811
+-0.0325172 0.115309 0.0332233
+-0.0883434 0.0968836 0.00640652
+-0.0074894 0.104457 0.0437929
+-0.0122029 0.0391189 0.0354325
+0.0605626 0.0609358 0.0161739
+-0.0291057 0.0349617 0.0478282
+-0.00632683 0.0367419 -0.0160833
+0.0422139 0.06433 -0.00247442
+-0.0834639 0.0815548 0.0279962
+-0.091428 0.113787 0.018961
+-0.0164849 0.0911174 0.0558291
+-0.0521483 0.153554 0.0122178
+0.0344074 0.0446243 -0.00536213
+-0.09232 0.126938 0.0302595
+-0.0718881 0.12088 -0.00850233
+-0.0769692 0.155214 0.0250641
+-0.0847077 0.140411 0.00224002
+-0.0180254 0.171268 -0.0157212
+0.0102822 0.065327 -0.0312772
+-0.0271732 0.171194 -0.0185934
+-0.0475224 0.0587349 0.0366732
+-0.0815066 0.0980245 0.032594
+-0.0287322 0.0335484 -0.0250427
+0.000965074 0.0348235 0.00577003
+-0.0874433 0.114073 0.0447649
+-0.0745611 0.163685 -0.0159572
+-0.0504998 0.0931897 0.044287
+0.00144942 0.127679 0.0289378
+-0.0830551 0.128552 0.0515383
+-0.0537303 0.0473713 0.0135851
+-0.0226958 0.0380494 0.0144148
+-0.0698996 0.147518 -0.0298062
+-0.0374978 0.0833038 0.0438252
+0.0144108 0.118463 -0.013667
+-0.0810085 0.1097 0.0318734
+-0.0883068 0.151437 0.0121831
+0.0014962 0.114186 0.0411808
+-0.0457512 0.0782542 -0.0192962
+-0.0728503 0.107163 0.0374416
+-0.0546426 0.0335759 -0.00981752
+-0.0905935 0.133662 0.00922276
+-0.0777368 0.158322 -0.016916
+0.0333249 0.108715 0.0307644
+-0.0758319 0.0675199 0.00554661
+-0.0608714 0.0385134 0.0195368
+-0.0766234 0.167356 -0.0265012
+0.0324864 0.115764 0.0245556
+-0.051601 0.149349 0.0154046
+-0.0370133 0.1227 0.0269929
+-0.0556554 0.124247 -0.00722427
+-0.0272643 0.118767 -0.0116611
+-0.0284876 0.0660147 0.0384689
+-0.0890493 0.136506 0.0262024
+0.0455252 0.0918117 0.00617298
+-0.0739705 0.110854 0.0450522
+-0.054929 0.0378655 -0.0109689
+-0.0211646 0.0933284 0.0517404
+-0.00865087 0.0496719 -0.030975
+0.0599111 0.0692057 0.0151972
+0.0182222 0.0631608 0.0491228
+-0.0659867 0.134061 -0.00822741
+-0.0533518 0.117447 -0.0141574
+-0.0356207 0.0519761 -0.0103771
+-0.0674828 0.0383816 0.0133921
+-0.0179472 0.0391243 0.0360362
+-0.0353932 0.0352385 0.0143534
+-0.0381912 0.168168 -0.0127822
+0.0242439 0.0994852 0.044008
+-0.0331278 0.165217 -0.0153881
+0.0419441 0.102888 0.00516309
+-0.0744413 0.0833098 0.038687
+-0.0349807 0.177 -0.00919022
+0.00950876 0.0882899 0.055046
+0.0203114 0.0607424 -0.0267183
+-0.00473829 0.0684427 -0.0355801
+-0.0293549 0.0495451 -0.022456
+0.0213555 0.0521216 -0.0251867
+-0.0608025 0.132515 0.0384279
+-0.086306 0.0981081 0.00140707
+0.0124215 0.122685 -0.01021
+0.0534041 0.0547278 -0.00176167
+-0.0725172 0.105485 0.0374705
+-0.0925573 0.125589 0.0382552
+0.023685 0.124697 0.0198268
+0.0381226 0.0574698 -0.00591549
+-0.0358756 0.107103 -0.0202685
+-0.00445554 0.112864 -0.0195829
+-0.00333512 0.125963 -0.00760181
+0.0355639 0.058664 -0.0117324
+-0.0752743 0.171989 -0.0354168
+0.0264872 0.122262 0.00520712
+-0.0911855 0.114622 0.00933636
+-0.0888501 0.102361 0.0153809
+0.0303343 0.0358493 0.0181065
+0.0388945 0.108364 0.0171641
+0.0444906 0.0861036 -0.00180248
+-0.00457845 0.0388805 0.0300129
+-0.0689372 0.126774 -0.00892675
+0.0352594 0.113795 0.0141522
+0.0379749 0.0374097 0.0109015
+0.00640925 0.0404248 -0.023654
+-0.0569156 0.112617 -0.0162683
+-0.0161127 0.0388433 -0.0124778
+-0.0568734 0.0358081 0.0462717
+-0.0852004 0.111887 0.0434561
+-0.0393334 0.174116 -0.00798067
+-0.0335527 0.156609 0.00223348
+-0.06623 0.13826 0.0429445
+-0.029146 0.168214 -0.0173005
+0.0267233 0.0347365 0.00732658
+-0.0416725 0.0607151 -0.0124173
+-0.0304675 0.175749 -0.00423829
+-0.0888241 0.114444 0.00524771
+-0.00228102 0.038771 0.0269718
+-0.0353955 0.0337248 -0.0302701
+-0.0474965 0.0862056 0.045143
+-0.0615859 0.155307 -0.0235819
+0.0506383 0.0516722 -0.00273463
+0.0335552 0.036072 0.00748554
+-0.00436077 0.12603 -0.00766771
+-0.0239599 0.182991 -0.0170658
+-0.00549985 0.07185 0.0581365
+-0.0328429 0.0972178 -0.0231932
+-0.091474 0.148846 0.0181354
+0.0336134 0.0876336 0.0416906
+-0.0614982 0.101529 0.0422258
+-0.0495014 0.0464837 0.0411417
+-0.0551395 0.054088 0.00915623
+-0.0432223 0.147486 -0.00120685
+-0.0358825 0.108535 -0.0199213
+0.00990352 0.130871 0.0175976
+-0.00150184 0.0978367 0.052434
+-0.0334203 0.0667037 -0.0174892
+0.0289827 0.0467369 -0.00766304
+-0.0555362 0.0629843 -0.00681601
+-0.0758946 0.0992374 -0.0118631
+-0.0367472 0.127095 0.0166739
+-0.0571684 0.0576767 0.00966588
+-0.0823623 0.154598 0.0188308
+-0.0905142 0.129614 0.0405398
+-0.0677394 0.0764997 -0.0160371
+-0.0201192 0.163785 -0.0165508
+-0.0132881 0.113144 -0.01784
+0.0143956 0.046307 -0.0246969
+0.0117341 0.0390743 0.0447312
+-0.0746833 0.155701 -0.000366346
+-0.069527 0.156219 -3.70248e-05
+-0.0226679 0.0341396 -0.0206509
+-0.00924422 0.0344526 -0.0182921
+-0.0276907 0.0335904 -0.024878
+-0.00470812 0.0669686 -0.0349707
+-0.024291 0.106203 -0.0224613
+-0.0142085 0.0972199 -0.0290358
+-0.0465353 0.133196 0.0100953
+-0.0245088 0.108515 0.0403619
+-0.092997 0.116043 0.0153159
+-0.0517083 0.131123 0.0322407
+-0.0456135 0.053373 -0.0104441
+-0.0345226 0.0846315 0.0427551
+-0.00735617 0.0354566 -0.0169734
+-0.0865776 0.109066 0.0163469
+-0.0436408 0.0408205 -0.0223011
+-0.0526724 0.130856 -0.00431281
+-0.0516582 0.0647811 -0.0108241
+0.0182047 0.100313 -0.0224597
+0.0445886 0.0833307 0.0241696
+-0.0749819 0.151307 -0.0268775
+-0.0846364 0.0845811 0.0264985
+-0.0452001 0.165138 -0.00833108
+-0.0791947 0.168601 -0.0366432
+-0.0848581 0.120613 -0.00298955
+0.0319638 0.0780558 -0.0197042
+-0.0923737 0.128196 0.0102559
+0.0394261 0.0716433 -0.0107927
+0.0122035 0.115305 -0.0162457
+-0.0229162 0.0383263 0.00143492
+0.0428254 0.0986969 0.0191637
+0.0153612 0.0463061 -0.0243571
+-0.00764709 0.0511598 -0.0317878
+-0.0853621 0.135278 0.0465646
+-0.0829375 0.116994 0.0487646
+-0.085028 0.100559 0.0275605
+-0.0219183 0.0382906 0.00166561
+-0.0765591 0.0818865 0.0366215
+0.0417584 0.0971928 -0.00282344
+-0.064598 0.141073 0.0399979
+0.0464507 0.0764566 0.0101865
+-0.0788399 0.114858 -0.00418456
+-0.0825062 0.110166 0.000353593
+0.029005 0.0699505 0.0419019
+-0.0144969 0.0814706 0.0569355
+0.0278524 0.115393 0.0316598
+-0.0742949 0.17555 -0.0422185
+-0.0749686 0.158241 -0.0259415
+-0.0378653 0.102824 -0.0209313
+-0.0110297 0.11443 -0.0172182
+0.0092913 0.0739064 -0.0330363
+0.0274028 0.0416284 -0.00496361
+-0.0105374 0.130025 0.0158825
+-0.0530895 0.0530892 -0.00643833
+-0.0165413 0.0573347 0.0511714
+0.0165193 0.125294 -0.00303164
+-0.080526 0.109264 0.0359357
+-0.0639459 0.153257 -0.00670123
+0.0199666 0.126684 0.0198751
+0.0426813 0.101508 0.00916223
+0.0270307 0.0781852 0.0461538
+0.00819303 0.0342719 -0.00156322
+-0.0758021 0.154133 0.0299324
+0.0217183 0.114203 -0.013082
+-0.0761724 0.154401 0.00198863
+0.0253655 0.0814952 -0.0244829
+-0.0357817 0.0871994 -0.0240994
+-0.0181797 0.178658 -0.0176382
+-0.018211 0.0697307 0.0537615
+-0.0393811 0.154717 -0.00895732
+-0.014508 0.0659228 0.0537042
+-0.0294961 0.104302 0.0413374
+-0.0281692 0.171188 -0.018077
+-0.0564789 0.0833746 0.0446901
+-0.0817321 0.120346 0.0490739
+-0.0180945 0.124042 -0.00530863
+-0.0722448 0.0688588 0.0287217
+-0.064637 0.0404566 0.0276669
+-0.0642686 0.171043 -0.0609844
+-0.00150003 0.0520299 0.0541649
+0.0343966 0.0968432 0.0376227
+0.033587 0.0739599 -0.0167921
+-0.0916761 0.122705 0.00729331
+0.0435692 0.0691645 0.0259965
+-0.0583799 0.0342852 0.0299739
+0.0193411 0.0593649 -0.0271573
+-0.0630027 0.145885 -0.0118617
+-0.0492939 0.133961 0.00142725
+-0.0445641 0.0405033 0.0438121
+-0.0534909 0.101517 0.0419949
+-0.0137652 0.0728728 -0.0386088
+-0.000746952 0.0726633 -0.0355323
+-0.00426313 0.130924 0.016725
+-0.0833848 0.0776237 0.00250717
+0.0107457 0.127435 -0.00331768
+-0.0566099 0.136533 -0.00462162
+-0.0137664 0.0742812 -0.0386456
+-0.0253123 0.0865272 0.0518462
+0.0391332 0.0800655 -0.0117735
+-0.0595022 0.0987448 0.042776
+-0.031899 0.0792306 -0.0315346
+-0.074881 0.117904 -0.00727699
+-0.0755718 0.165165 -0.0201548
+0.0408155 0.0939721 0.0292858
+-0.0854938 0.096523 0.0281673
+-0.0644931 0.105621 0.039804
+-0.0196701 0.0554437 -0.0324495
+0.0139693 0.112639 -0.017366
+-0.00232624 0.124886 -0.00844394
+-0.0617679 0.0824635 -0.0193558
+-0.0599121 0.0588939 0.00621161
+-0.0826266 0.146034 0.0392943
+-0.0649084 0.165706 -0.0272764
+-0.0602113 0.0697286 0.0375341
+-0.00175042 0.0897209 -0.0353687
+-0.0275054 0.107176 -0.0215083
+-0.062122 0.0429616 0.0266943
+0.032428 0.0625798 -0.0177725
+-0.0663881 0.0677373 0.0326703
+-0.02076 0.0347198 -0.0277376
+-0.0519381 0.0597689 0.0297286
+-0.0595413 0.0582322 0.0158865
+-0.0445568 0.151229 -0.00569012
+-0.0210951 0.12531 -0.000542597
+-0.020213 0.178617 -0.0227863
+-0.00769265 0.0388371 -0.00333188
+-0.0344924 0.09037 0.0442186
+-0.0786032 0.107051 0.0327104
+-0.0434904 0.12843 0.000929671
+-0.058473 0.115363 0.0369711
+0.045085 0.0833373 0.00221176
+-0.0384977 0.0648621 0.0416261
+-0.0407478 0.0768336 -0.0187281
+-0.0578796 0.102621 -0.0187883
+-0.0846144 0.128516 0.0502768
+0.0170529 0.075444 0.0528157
+-0.018505 0.0786406 0.056357
+-0.0752579 0.0874199 0.0393733
+0.043967 0.0636126 -0.00172463
+-0.0914628 0.146095 0.0181484
+-0.0294715 0.117536 0.0312989
+-0.0581079 0.0480417 -0.000353036
+-0.0384621 0.172216 -0.000421117
+0.0412086 0.0684033 0.0296357
+-0.0332986 0.0384796 -0.0137148
+-0.0549774 0.0335456 0.00467992
+0.00953694 0.103082 0.0459273
+-0.048193 0.133027 0.0241926
+0.00364343 0.0960341 -0.0296841
+-0.0809226 0.0926448 0.0335946
+0.0316471 0.05126 -0.00972402
+-0.0622205 0.164668 -0.0515889
+0.0257137 0.0591918 0.0440938
+-0.0116637 0.0384284 0.00907266
+0.00758624 0.0341288 -0.016561
+-0.0732628 0.0731075 0.0335988
+0.0105031 0.0347322 0.0422156
+0.0273613 0.0592959 -0.0217662
+-0.0329323 0.126815 0.00921204
+-0.0462425 0.0615364 0.0381535
+0.00735972 0.130718 0.020957
+-0.0618449 0.152018 0.0348716
+-0.0311962 0.0475489 -0.0247586
+-0.0384898 0.113893 0.0344296
+-0.0268492 0.155368 -0.00477229
+0.0138974 0.0344287 -0.0156692
+-0.0374813 0.169748 0.00157136
+-0.0892091 0.137796 0.0122163
+-0.0705026 0.0958452 0.0418601
+-0.0862013 0.10903 0.0113533
+-0.0682521 0.15944 -0.00832765
+0.038441 0.100665 0.0293761
+-0.0639313 0.11526 -0.0113233
+-0.0664444 0.151761 -0.0404644
+0.0142088 0.034798 0.0302902
+-0.0244166 0.0931902 0.0479432
+-0.0714792 0.167875 -0.0225174
+-0.0161203 0.0383572 0.000963241
+0.0282773 0.0862159 0.0445154
+0.0375 0.107296 0.0262149
+-0.0891989 0.11586 0.044703
+0.00339178 0.0433892 -0.0247833
+-0.0790801 0.0704064 0.00826811
+-0.0237813 0.0756129 -0.0382516
+0.00190837 0.124868 -0.00847893
+0.0243137 0.119818 0.0300741
+-0.0758951 0.123764 -0.00763971
+0.052991 0.0735097 0.0116286
+-0.0175974 0.0393048 -0.0277532
+-0.013784 0.0799171 -0.0389774
+0.00451197 0.0619711 0.0562284
+-0.0331612 0.0342582 0.0246899
+0.0314823 0.114431 0.0284596
+-0.0530088 0.145722 -0.00115007
+-0.0684496 0.0369814 0.0129839
+-0.0203772 0.158233 -0.00725915
+0.0148967 0.0366228 -0.0205744
+-0.0250413 0.0925197 -0.0322644
+-0.0424949 0.168218 0.00285877
+-0.0414982 0.0719267 0.042103
+-0.0939163 0.120093 0.0142993
+-0.0164902 0.112704 0.0398029
+-0.000484486 0.0703477 0.056848
+0.060415 0.0678562 0.0151973
+-0.0550635 0.116914 0.036091
+0.0200483 0.0385661 -0.0116898
+-0.0250588 0.123734 -0.00291588
+0.0403936 0.0629925 0.0301493
+0.0379656 0.0874795 0.0356781
+-0.0548923 0.105518 -0.0186699
+-0.0311396 0.166714 -0.0162904
+0.0470624 0.0740285 0.0123586
+-0.0678676 0.100922 -0.0154166
+-0.0631629 0.124137 0.0456282
+-0.0731746 0.154066 -0.0319096
+-0.0307727 0.033545 -0.0254394
+-0.0890856 0.122978 0.0464209
+-0.0236634 0.123398 -0.00459221
+0.046259 0.0820395 0.0071847
+-0.000605347 0.130433 0.0223861
+0.0192013 0.0591556 0.0487522
+-0.0498987 0.124057 -0.00910218
+-0.0170638 0.168326 -0.0143421
+0.0265398 0.104204 -0.0163559
+-0.0938575 0.120136 0.0242923
+-0.0179474 0.100123 -0.0240926
+-0.058599 0.155538 0.0184341
+-0.0170777 0.0418831 0.0522589
+-0.0545484 0.0457621 -0.00683862
+0.00723985 0.076824 -0.0341303
+-0.0907031 0.148891 0.0231421
+-0.0174825 0.107148 0.0420092
+-0.0911131 0.129682 0.0362351
+-0.0499113 0.147776 0.0118822
+-0.0657818 0.152842 -0.0413063
+0.0528515 0.0592232 -0.00323634
+-0.0693828 0.0805427 0.0408087
+-0.060108 0.0423138 0.0158374
+0.0281616 0.0699505 0.0424355
+0.00679863 0.0347495 0.0432322
+-0.0458268 0.125298 0.0247658
+-0.0567225 0.043789 0.0226896
+-4.09913e-05 0.10064 0.0465907
+-0.0729374 0.129655 -0.00843737
+0.0415013 0.104244 0.010161
+0.0342459 0.0889575 0.0408509
+-0.0808289 0.138985 -0.00281163
+-0.0425095 0.171123 -0.00130836
+-0.0870569 0.137884 0.0425258
+0.00149552 0.116934 0.0397718
+-0.0158011 0.0388262 -0.0105326
+0.00549603 0.0413259 0.0457036
+-0.0325959 0.124521 0.0211556
+-0.058912 0.109738 -0.0167726
+-0.0772259 0.151416 -0.00590086
+-0.0077735 0.0770379 -0.0376668
+0.0385932 0.0436441 0.0291648
+-0.0778914 0.162484 -0.0299302
+-0.0641074 0.0639595 0.0276548
+0.0187103 0.0342934 0.0023932
+-0.0858293 0.151702 0.00893089
+0.0336067 0.0504819 0.0325279
+-0.0810076 0.10869 -0.00259876
+-0.0557401 0.0547516 -0.00240302
+-0.0335154 0.108413 0.0382413
+-0.00564795 0.049654 -0.0307584
+-0.0765497 0.0728479 -0.00560245
+-0.00214115 0.127727 0.0291435
+-0.0701217 0.159568 -0.0479252
+-0.0794787 0.104524 -0.00660043
+0.00849938 0.0366585 0.0454484
+-0.0305059 0.0889327 0.0438397
+-0.0638439 0.101082 -0.0177706
+-0.0045041 0.0801506 0.0577231
+0.013232 0.0835986 -0.0303791
+-0.0809796 0.0788834 0.0298322
+-0.0148841 0.0959887 -0.031739
+-0.0699437 0.0669048 0.0273786
+-0.0514117 0.134659 0.0288827
+0.0105257 0.123354 0.0336723
+0.0263222 0.107421 0.038207
+-0.0125183 0.095238 0.0536312
+-0.0634853 0.0904216 0.0451002
+0.0377424 0.110293 0.0150624
+-0.0700913 0.0419644 0.00613646
+-0.0565326 0.0401709 -0.00945456
+-0.0553504 0.0460785 0.0138247
+-0.0114916 0.0759418 0.0571389
+-0.0796666 0.0886389 0.0352895
+0.0338998 0.0888046 -0.0179815
+-0.0207237 0.0567772 0.0467736
+0.0293267 0.120376 0.00767428
+-0.0865466 0.137714 0.00320362
+-0.0815177 0.106 -0.00361682
+0.0360857 0.0784054 -0.0147648
+-0.0706254 0.129856 0.0506426
+0.0309103 0.088937 0.0430941
+0.0186908 0.127724 0.0151265
+0.0607002 0.0665033 0.01416
+-0.0347226 0.0711465 -0.0183854
+-0.0475247 0.0335798 -0.00289187
+0.00330662 0.0597508 -0.0323981
+0.0162777 0.117973 -0.0131407
+0.0260142 0.118212 -0.00538239
+-0.0524983 0.0477783 0.0397646
+0.00462528 0.109546 0.0419595
+-0.0848442 0.146005 0.0372765
+-0.0568876 0.0998079 -0.0197942
+-0.0478768 0.15504 0.00962757
+0.0236771 0.0956901 -0.0213272
+-0.0909699 0.113313 0.018324
+-0.0314956 0.0560344 0.0371147
+0.0419523 0.101425 0.00119033
+-0.0205212 0.118181 0.0347958
+0.00296971 0.0341513 0.00863676
+-0.0034922 0.0473569 0.0490622
+0.0168587 0.0347265 0.0236529
+-0.00422658 0.0396088 0.0480089
+0.0402871 0.104196 0.0211608
+-0.0211382 0.0985478 0.044502
+-0.0469324 0.0383628 -0.0152843
+0.0223386 0.0578809 -0.0262309
+-0.094679 0.122825 0.0202733
+-0.00649716 0.0619561 0.0561245
+-0.0530923 0.143138 0.0243879
+0.0586666 0.0690768 0.00715872
+-0.0632884 0.0444363 0.0372932
+-0.0584087 0.0421172 0.0451764
+0.0462769 0.0649494 -0.00109094
+-0.0892011 0.0983026 0.0104143
+-0.050311 0.033406 0.00395206
+-0.0171117 0.123425 0.0297114
+-0.0067867 0.0784694 -0.0378945
+-0.0413793 0.0448727 -0.0203291
+0.00613123 0.105885 -0.0208912
+-0.0209654 0.035527 0.0525237
+0.0515169 0.0664883 0.0274059
+-0.0186581 0.0985081 0.0446525
+0.00326552 0.127077 0.029619
+0.00950248 0.111292 0.0396928
+0.0420852 0.077848 0.0291974
+-0.0404715 0.0343242 0.0319689
+-0.0775002 0.156948 -0.0139048
+-0.0828255 0.0924347 -0.00656966
+-0.0256554 0.124701 0.019279
+0.00649798 0.107134 0.0414437
+-0.0067083 0.0613544 -0.0352012
+-0.0341277 0.165212 -0.0151261
+-0.0305288 0.0353431 -0.0195833
+0.00449494 0.105757 0.0421851
+-0.0313565 0.161046 -0.00157639
+0.00317447 0.0908801 -0.0331491
+-0.066706 0.0375681 0.0351923
+0.0146203 0.128223 0.0236197
+-0.0931816 0.121543 0.0372829
+-0.0390449 0.0344196 0.0339502
+0.0204938 0.0865196 0.0494812
+-0.0909512 0.147073 0.025026
+-0.0398753 0.149194 -0.00215183
+0.0371767 0.095465 0.0345819
+-0.0534525 0.116245 -0.0149003
+-0.00912597 0.168128 -0.0227626
+0.0103593 0.0509634 -0.0286117
+0.00839042 0.0434178 -0.024623
+0.012125 0.10869 -0.0190017
+-0.0749621 0.134014 -0.00721966
+-0.0789216 0.172194 -0.0440002
+-0.0258331 0.0561399 -0.0284181
+-0.0817922 0.143171 0.000171875
+0.0451306 0.0647669 -0.000900002
+-0.0514821 0.113924 -0.0164877
+0.00371763 0.0346901 0.0426483
+-0.0475701 0.0461114 -0.0100167
+0.0406981 0.104234 0.0181671
+-0.0453678 0.060156 0.0387657
+-0.0314314 0.0693522 -0.0254564
+-0.0154911 0.0702181 0.054969
+-0.0300755 0.123175 0.0220771
+-0.0216491 0.0479362 -0.0281524
+-0.0507589 0.144713 0.0133585
+-0.0670917 0.155954 0.0255845
+-0.0852375 0.1104 0.00532111
+-0.0573508 0.121267 0.0398601
+-0.0261065 0.0944666 -0.0262366
+-0.0897054 0.124293 0.0455762
+-0.000486036 0.047441 0.049521
+-0.0438029 0.167379 0.00334272
+0.0111963 0.0864748 -0.0310924
+0.0464517 0.0750534 0.00718936
+-0.036486 0.0619956 0.0409573
+-0.0314993 0.116609 0.0322344
+-0.0544997 0.117303 -0.0139925
+-0.0420673 0.0336103 0.00544111
+-0.0856626 0.0912736 -0.00055353
+-0.050495 0.0974075 0.0440057
+0.0309311 0.0355864 0.0055308
+0.0202177 0.109327 -0.0158556
+0.0249428 0.0968855 0.0450153
+-0.00751 0.070341 0.0568254
+-0.0604012 0.0335984 -0.00916237
+0.0245092 0.0406191 -0.00557292
+-0.0451779 0.152141 0.00822921
+-0.0607654 0.0668786 0.0346016
+-0.0593188 0.114075 -0.0145597
+-0.091214 0.143385 0.025163
+-0.0425978 0.0505652 -0.0109174
+-0.0423266 0.169779 -0.00887745
+-0.0224756 0.0348012 0.0476768
+0.0409735 0.0405135 0.0215425
+-0.0801239 0.110623 0.0438367
+-0.0138651 0.0987904 -0.0246748
+-0.043573 0.126043 -0.00725208
+-0.0208606 0.101617 -0.0238418
+-0.0425016 0.0605517 0.0404213
+-0.00249479 0.0590139 0.0541301
+0.0409984 0.102803 0.000176721
+0.0342014 0.0808856 0.0407312
+-0.0247835 0.166781 -0.00970724
+0.00931572 0.0725689 0.0556419
+-0.0642124 0.145356 0.038849
+-0.0716272 0.0748459 -0.0119866
+-0.012533 0.0458468 0.048979
+-0.0741728 0.15268 -0.0288898
+-0.0211868 0.174176 -0.0217698
+-0.054499 0.0761691 0.0426143
+-0.0851934 0.11068 0.0373035
+-0.00964195 0.120097 -0.0132573
+0.0149745 0.129329 0.00806984
+-0.0535552 0.0335918 0.0121227
+0.0387224 0.1084 0.018173
+-0.0858928 0.108988 0.00834067
+0.00426552 0.0697141 -0.0335935
+0.0304509 0.117992 0.000957505
+-0.0134723 0.0603845 0.0536243
+-0.0809665 0.133877 -0.00363658
+-0.0877284 0.0950339 0.0247524
+-0.0708769 0.155921 0.00969704
+-0.0388302 0.173903 -0.00342781
+0.0123125 0.0680946 -0.0309662
+-0.0540561 0.150161 -0.00256907
+-0.0662654 0.129803 0.0463681
+-0.0481341 0.0344887 0.0319692
+-0.0482356 0.137094 0.0133979
+-0.0638562 0.148524 -0.023921
+-0.0873971 0.140576 0.0399568
+-0.0920359 0.126943 0.0332532
+0.00766079 0.0616753 0.0549139
+-0.0820513 0.0882817 -0.00662822
+-0.0583711 0.0614813 0.0257087
+-0.046355 0.0345569 0.0357917
+0.0473411 0.0488863 -0.00367878
+0.0292435 0.0637114 -0.0199317
+-0.0250309 0.172718 -0.0117738
+0.0423872 0.0459654 -0.00393846
+-0.0484976 0.0805051 0.0439961
+-0.0497297 0.0737805 -0.0165746
+0.0463736 0.0682111 0.00160519
+-0.0334339 0.166782 -0.00461644
+-0.0772978 0.0685904 0.0138065
+-0.0645607 0.153661 0.00110457
+0.00849221 0.108496 0.0406568
+-0.0554287 0.1598 0.000101402
+-0.0412715 0.127285 -0.00254236
+-0.080968 0.0967089 0.0335048
+0.0225187 0.123964 0.0251042
+-0.0559057 0.0379831 0.047068
+-0.0594802 0.0716799 0.0395512
+-0.0618223 0.170491 -0.0617288
+-0.0564955 0.104323 0.0414899
+-0.0810442 0.152541 0.00426923
+-0.0435828 0.0345782 0.0398547
+0.0126008 0.128196 0.0257553
+-0.0526679 0.0579784 0.0235498
+0.0380115 0.110174 0.0108643
+0.0150842 0.114728 -0.0156323
+0.0148813 0.0348012 0.0286151
+-0.0479877 0.121051 0.028756
+-0.0883678 0.128089 0.00227451
+-0.0720422 0.15541 -0.0389078
+0.0112474 0.0724264 -0.0317987
+0.0267956 0.111385 0.0354031
+-0.0649586 0.160381 -0.0157887
+0.00550295 0.0702783 0.0558582
+-0.0238067 0.0899629 -0.0356649
+-0.090988 0.113988 0.0207121
+0.0194892 0.0934174 0.0476186
+-0.0655537 0.161293 -0.0160037
+-0.0625236 0.0609176 -2.19725e-05
+-0.0491589 0.162483 -0.00556124
+-0.042649 0.0378778 -0.0263104
+0.00374161 0.0952291 -0.0308324
+0.025598 0.0610493 -0.0236458
+0.00942462 0.0375116 -0.02327
+-0.00136682 0.125668 -0.00729488
+0.008486 0.0532759 0.0521458
+-0.00749086 0.0675042 0.0558082
+-0.092697 0.117351 0.0113077
+0.0251837 0.112665 -0.0114294
+-0.04997 0.140123 0.00440621
+-0.0534339 0.040168 0.0467985
+-0.0936376 0.124116 0.0132691
+-0.0222759 0.0382517 0.00526325
+0.0600635 0.0664445 0.00913698
+-0.0224559 0.092554 -0.0342812
+0.0582887 0.0538074 0.00917936
+0.046059 0.0834308 0.0121726
+-0.0619009 0.0678892 0.0352357
+-0.0566658 0.0473318 0.0108617
+-0.0457003 0.0694971 -0.0160523
+-0.0618544 0.174099 -0.0565963
+-0.0498016 0.128288 0.0314623
+-0.0225807 0.159177 -0.00302445
+-0.0623624 0.16436 -0.0595797
+0.0383958 0.0505315 -0.00659356
+-0.0332433 0.126938 0.0135159
+-0.0454819 0.0875316 0.0441596
+-0.0835389 0.110217 0.0023021
+0.0386074 0.0617702 0.0328492
+-0.0407686 0.0811968 -0.0203079
+-0.033827 0.0901076 -0.0243377
+0.0506567 0.0703381 0.00346635
+0.0228724 0.125195 0.0195238
+-0.0187529 0.0384803 -0.00337678
+0.0222732 0.12205 0.0293193
+-0.0294959 0.0645466 0.0380401
+-0.0689565 0.166538 -0.0215879
+-0.00506288 0.0387211 0.00101779
+-0.0647592 0.169439 -0.0415812
+0.00438439 0.037904 -0.00378653
+-0.0241621 0.125878 0.0168174
+0.0359934 0.0685324 -0.0147875
+-0.0182052 0.0381955 0.0170088
+-0.0753414 0.15612 0.015399
+0.0453867 0.0413474 0.00824507
+-0.00449218 0.123763 0.0343217
+0.0460213 0.0862262 0.00917159
+0.0346496 0.0972102 -0.0129196
+0.0196844 0.126554 0.00410284
+0.0202619 0.12651 0.00572713
+-0.00449958 0.0504123 0.0519892
+-0.0899789 0.133805 0.0362152
+0.00988218 0.0886651 0.0547874
+-0.00395268 0.131078 0.00966125
+0.00346471 0.0977538 0.051238
+-0.0236164 0.0422618 -0.0289626
+-0.0253603 0.124214 -0.00135534
+-0.00744498 0.124256 -0.00972454
+-0.0577765 0.0494102 0.000630355
+-0.0321623 0.172645 -0.015639
+-0.0661377 0.0669804 0.0316196
+-0.0240269 0.158277 -0.0107707
+-0.0762359 0.113613 0.0494664
+-0.0849952 0.141833 0.00418636
+-0.0569251 0.0366412 0.0466659
+-0.0283222 0.0749245 0.042497
+0.0216856 0.0878179 -0.0250022
+-0.0866951 0.0951098 0.0265657
+0.0296006 0.0982071 0.041203
+-0.0630317 0.060472 0.0203248
+-0.0304883 0.0574252 0.0370157
+-0.0638466 0.159519 -0.0168205
+-0.0544959 0.0848124 0.0452537
+0.0243406 0.113099 -0.011895
+-0.0900837 0.117534 0.0447346
+-0.00144097 0.0378708 0.018909
+-0.0699808 0.136988 -0.00795948
+-0.0823654 0.0815422 -0.00354068
+-0.00681555 0.0385421 0.0244437
+0.00431168 0.0611153 -0.0319161
+-0.0801269 0.10608 0.0309775
+0.0162329 0.0807169 -0.0293214
+-0.0158843 0.0377689 0.0515755
+-0.0829013 0.122118 -0.00412754
+0.0294673 0.106706 -0.01303
+-0.0534948 0.11254 0.0358256
+0.00150254 0.0605844 0.0560506
+-0.0234977 0.101642 0.0439992
+-0.0797566 0.074638 -0.000471413
+-0.00773143 0.0670178 -0.0355816
+-0.0705055 0.0342009 0.00809348
+0.0167377 0.0461846 0.0432665
+0.00646432 0.110948 0.0411124
+-0.0194753 0.160592 -0.0133076
+-0.00449865 0.115591 0.0404715
+0.0280707 0.046664 -0.00969251
+0.048051 0.0496945 0.0288529
+-0.0763852 0.114637 0.0504008
+-0.0886058 0.150235 0.0251076
+-0.0211531 0.0382979 0.0271326
+0.0408293 0.101363 -0.00180736
+-0.0203988 0.177179 -0.0155929
+-0.0718351 0.180364 -0.0513557
+0.00724322 0.0361893 0.0456372
+0.0124253 0.0374345 -0.0223624
+0.0378254 0.108706 0.0222481
+-0.0871672 0.127065 0.0471934
+-0.0686541 0.12565 0.0517171
+-0.0889642 0.136517 0.0281982
+-0.0304896 0.0559845 0.0366491
+-0.0839703 0.0843113 0.0284366
+-0.00895133 0.0384401 0.00779513
+-0.0942308 0.126903 0.0192529
+-0.0569855 0.0507747 0.00670607
+-0.063488 0.037094 -0.00797583
+0.0252887 0.122228 0.0247087
+-0.0433541 0.112279 -0.0167951
+-0.0255625 0.0532992 -0.0274025
+-0.00849647 0.0532799 0.0524507
+-0.0074932 0.0842694 0.0572981
+-0.0760467 0.0689134 0.00354542
+-0.0518697 0.144272 -0.000239851
+0.0302023 0.0808798 0.0437374
+-0.0276563 0.12199 -0.007026
+-0.0484978 0.100158 0.0428666
+-0.0654874 0.143443 -0.0120814
+-0.0308113 0.153953 -0.00248259
+0.0597604 0.0567164 0.0141707
+-0.0480122 0.0341726 0.0287503
+-0.0640462 0.0622661 0.0238361
+-0.0206969 0.0568414 -0.0326165
+0.0309722 0.116471 -0.00147933
+-0.0691516 0.0788347 0.0401452
+-0.058803 0.0883 -0.0207912
+0.00672447 0.0346721 0.0378883
+-0.0746893 0.154119 0.0302893
+-0.0529585 0.135327 0.0304274
+0.00863241 0.128438 -0.00238911
+-0.0478493 0.099947 -0.0217978
+-0.075086 0.0674684 0.00355063
+0.0326927 0.116394 0.0217802
+-0.0842229 0.144678 0.0395137
+-0.0166094 0.128602 0.0136868
+0.00411662 0.125005 -0.00865855
+-0.0754818 0.148362 0.0406222
+-0.065886 0.15405 -0.00011759
+-0.0425085 0.119367 0.0297171
+-0.0902093 0.131023 0.0402096
+0.0383601 0.0921445 -0.0115002
+-0.038495 0.0804525 0.0431634
+-0.0353039 0.0794833 -0.0226806
+0.0441637 0.0973591 0.0111613
+-0.0590115 0.153958 0.00054242
+0.0453728 0.0735622 0.00221503
+0.0569193 0.0710092 0.00714855
+-0.0114956 0.105842 0.0433599
+-0.0698279 0.181394 -0.0549266
+0.0375934 0.102015 0.0299178
+0.00590625 0.0356875 -0.00331654
+-0.0684622 0.16137 -0.0113077
+-0.0742229 0.109724 0.0423296
+-0.0202504 0.182971 -0.0220384
+-0.091455 0.148836 0.0171378
+0.0152238 0.0793568 -0.0300519
+-0.000512 0.107246 0.0433248
+-0.0428418 0.0971034 -0.0220359
+-0.0514947 0.0819216 0.0442721
+-0.00625132 0.0383797 0.0174726
+0.0252504 0.0789879 -0.0247523
+-0.0833347 0.0898073 0.030438
+-0.0509182 0.146274 0.0133981
+0.0202304 0.105998 0.0417108
+0.0571307 0.0508797 0.0151878
+-0.0330104 0.126012 0.0180287
+-0.0217816 0.0797281 0.0555871
+-0.00743438 0.120242 -0.0134406
+-0.0148225 0.086924 -0.0385597
+-0.0375897 0.174214 -0.00298303
+-0.00244861 0.0605864 0.0553645
+-0.00874133 0.128614 -0.000328304
+-0.00579055 0.0798611 -0.0376463
+-0.0096155 0.119132 -0.0142361
+0.000497149 0.0534577 0.0541163
+-0.0928025 0.131035 0.0222365
+0.0372258 0.108268 -0.000834485
+-0.0914674 0.129551 0.00825277
+-0.00149557 0.0675596 0.0566557
+0.0154848 0.0548588 0.0485877
+0.0396568 0.0815034 -0.0117853
+0.0174985 0.119533 0.0343583
+-0.0108678 0.0975625 -0.0293851
+0.0264007 0.116693 0.0313169
+0.005469 0.0964333 0.0520715
+-0.0455856 0.128182 -0.00140207
+-0.0175003 0.0499225 0.0470061
+-0.075934 0.0788992 0.0351468
+-0.0067913 0.0812637 -0.0377236
+-0.0769778 0.155918 0.0162848
+-0.0797877 0.0746142 -0.00147983
+-0.0599651 0.0469723 0.0336736
+0.0382386 0.084194 -0.0147697
+-0.0816947 0.113482 0.0465399
+0.00634478 0.0524665 -0.0299091
+-0.0112874 0.182441 -0.0284978
+-0.026226 0.178551 -0.0179991
+-0.0739945 0.1802 -0.0521965
+0.0105211 0.104445 0.0448284
+0.0580719 0.0523893 0.015182
+-0.0525108 0.0819776 0.0447141
+0.0148643 0.0961115 -0.0237665
+-0.00147854 0.0474532 0.049375
+0.00669444 0.0340637 0.00205518
+-0.0753884 0.151441 -0.0109145
+0.0413586 0.0394374 0.00625535
+-0.0196125 0.0381064 0.0149924
+-0.00986994 0.104508 -0.0232523
+-0.0720157 0.145244 -0.0182167
+0.0416371 0.0669849 0.0284796
+0.0284741 0.0381475 -0.00163189
+0.0474976 0.06778 0.0262203
+0.0259166 0.0434925 0.0371741
+0.0464333 0.0455453 -0.00066213
+-0.00640927 0.120163 -0.0133583
+-0.0236376 0.0387148 -0.0157231
+-0.092269 0.124069 0.00827163
+0.0144954 0.119572 0.0352389
+-0.0702988 0.15533 -0.0489684
+-0.0882036 0.143298 0.0111345
+-0.074863 0.0795889 -0.0115995
+-0.0174424 0.10313 -0.0232301
+-0.0686182 0.0628687 0.0026871
+-0.0620712 0.16624 -0.0525885
+0.058207 0.0538058 0.0191798
+-0.0333511 0.0463754 -0.0256604
+-0.0855025 0.0832965 0.0214753
+-0.0920057 0.11611 0.0343124
+-0.0227771 0.124071 -0.00329832
+-0.0610006 0.129721 0.0398956
+-0.0404973 0.0492165 0.0395965
+-0.0481836 0.0335793 0.00422402
+-0.0654948 0.160255 -0.0145439
+0.00736856 0.0479637 -0.0273222
+-0.0123571 0.12972 0.0137799
+0.0579783 0.0551346 0.00616127
+-0.0164763 0.064491 0.0530345
+-0.0608155 0.0896295 -0.0193008
+-0.0205289 0.0958269 0.048234
+-0.086716 0.132512 0.0465811
+-0.052836 0.095613 -0.0220115
+0.0406946 0.0647331 -0.00578164
+0.0121697 0.0950562 -0.0266386
+-0.00950093 0.0925586 0.0561384
+-0.0157375 0.0671877 -0.037968
+-0.0269293 0.0376983 0.0192799
+0.033595 0.0660055 0.039722
+-0.0481741 0.135565 0.0182752
+-0.0224128 0.163867 -0.00803238
+0.00810708 0.101446 -0.0211916
+-0.0458977 0.166944 -0.00688513
+-0.0238738 0.105835 -0.0226784
+0.0272653 0.121002 0.0240179
+-0.0701585 0.0623473 0.0172092
+0.0578867 0.0607943 0.0238444
+0.0565638 0.0695327 0.00435815
+0.012216 0.0753282 0.0545969
+-0.0583609 0.0339112 0.0215144
+-0.0664905 0.0861274 0.0441111
+-0.0514869 0.0987554 0.0433116
+0.0210708 0.0349944 0.0242708
+-0.0102986 0.126308 0.029096
+-0.0638201 0.089594 -0.0189434
+-0.0782747 0.174383 -0.0433933
+-0.0311143 0.16374 -0.0152454
+-0.0915885 0.128321 0.0362439
+-0.0379874 0.0336299 0.0062497
+-0.0854294 0.151325 0.0282936
+0.0124994 0.0909598 0.0531045
+-0.0434452 0.120253 -0.0131867
+0.0229768 0.0754886 0.0490742
+-0.0334786 0.100129 0.0429194
+-0.0741118 0.0819105 0.0384161
+0.0373216 0.0901862 0.036514
+-0.0565657 0.11693 0.0374284
+0.00334719 0.0481602 -0.0292882
+-0.0324526 0.0336078 -0.0239554
+0.0083446 0.116042 -0.0170347
+-0.00977658 0.0387467 -0.00366788
+-0.0206679 0.0509474 -0.0298149
+-0.0242736 0.181474 -0.0180054
+0.0160525 0.0350115 0.0395034
+-0.0543014 0.146215 0.0264084
+-0.00102573 0.0346607 0.0434939
+-0.0611888 0.155469 0.00589931
+-0.0406241 0.0520111 -0.0110025
+-0.0705109 0.148356 0.0407257
+0.0495286 0.0610841 0.0304744
+-0.019145 0.0893155 0.0554734
+0.00268229 0.12726 -0.0050686
+-0.0743228 0.155495 -0.0229079
+0.021268 0.0762952 -0.0266753
+-0.0239356 0.0374925 -0.0183912
+0.0262803 0.0660857 -0.0226574
+-0.0164998 0.0856439 0.0570811
+-0.0857415 0.120359 0.048887
+-0.0344903 0.0505305 0.0383369
+0.00230798 0.0346028 0.0406387
+-0.0929029 0.129672 0.0252445
+-0.0654938 0.0604629 0.00727621
+0.044722 0.0833037 0.0012072
+-0.0230106 0.0580182 0.0433839
+-0.0105663 0.0350401 0.0482738
+0.0582293 0.0690671 0.00613614
+-0.0600127 0.131125 -0.00733582
+-0.0321751 0.162395 -0.00280539
+-0.0555013 0.0623754 0.0293782
+-0.0252415 0.109687 -0.0201254
+-0.0560506 0.150155 -0.00188433
+-0.0600649 0.129705 0.039485
+0.0338293 0.0767952 -0.0167877
+0.01215 0.0919974 -0.0294248
+-0.0346452 0.0340944 0.0173387
+-0.050492 0.149246 0.012837
+-0.0550682 0.150156 -0.00218973
+-0.00881167 0.085499 -0.0379404
+-0.0780101 0.11134 -0.00369811
+-0.0795926 0.100727 0.0334268
+-0.0423449 0.122373 -0.0114097
+0.0248097 0.124191 0.0159771
+-0.0174692 0.0529782 0.0491698
+-0.0889728 0.101008 0.0133925
+0.00851959 0.0730626 0.056014
+-0.026729 0.159626 -0.000161004
+0.0222613 0.0720727 -0.026869
+0.0396492 0.0970274 -0.00677557
+-0.0301141 0.166809 -0.00684471
+-0.00834781 0.129635 0.0224773
+-0.0198097 0.0813191 -0.0390949
+-0.0489315 0.137078 0.0173942
+-0.0161123 0.0985355 -0.0244159
+0.0331161 0.0795687 -0.0187107
+-0.0365028 0.0761422 0.0420368
+-0.0315196 0.0834471 -0.0305496
+-0.0366299 0.0534085 -0.0105028
+-0.0844928 0.0979861 -0.00258986
+-0.049695 0.0693575 -0.0143663
+-0.0795053 0.148405 0.0389114
+-0.0143105 0.0338147 -0.022462
+-0.036834 0.0382539 -0.0105119
+-0.0528967 0.0476266 0.0236645
+-0.0431625 0.0436516 -0.0173214
+0.0442909 0.0959534 0.0041727
+-0.0499053 0.141681 0.0133989
+-0.084567 0.0897523 0.028848
+-0.035736 0.0740102 -0.0187661
+-0.0624191 0.163107 -0.0445959
+0.0553692 0.0711293 0.0213817
+-0.0384984 0.0634699 0.041507
+-0.0420929 0.156178 -0.00917116
+-0.0641565 0.166823 -0.0341745
+-0.0623968 0.162983 -0.056654
+0.0276466 0.0659543 0.0434322
+0.0454314 0.088986 0.0031764
+-0.0749519 0.164602 -0.018207
+-0.0345505 0.175605 -0.011982
+0.0363374 0.104678 0.0298648
+-0.00375231 0.128091 -0.0038931
+-0.0305006 0.100206 0.0434038
+-0.00849625 0.0547108 0.0528122
+-0.0485842 0.0517801 -0.00897412
+-0.00451507 0.0519264 0.0531932
+-0.0815948 0.0748474 0.0175368
+0.0572159 0.0648465 0.024658
+-0.0403921 0.162356 0.00287494
+-0.0749222 0.126715 -0.00818803
+-0.047238 0.0346371 0.0407654
+-0.0621416 0.141343 -0.00629843
+-0.0251564 0.113713 -0.0163747
+-0.00855727 0.119157 -0.0142712
+-0.074494 0.126019 0.0529923
+-0.0205102 0.0461853 0.0521703
+-0.084864 0.0789836 0.0191297
+-0.0187649 0.125661 -0.000995534
+-0.0218427 0.0567021 0.0450804
+-0.0622179 0.153696 -0.0295936
+-0.0364968 0.0576627 0.0395237
+-0.0368019 0.127806 0.00485952
+-0.0770975 0.0967852 0.0367
+-0.000433486 0.0366062 0.0184413
+0.0131024 0.123925 -0.00754958
+-0.0177683 0.0383192 0.0242073
+-0.0655356 0.0398001 0.0300899
+-0.0778591 0.161105 -0.0269202
+-0.0341012 0.162237 -0.0142117
+-0.017501 0.0842912 0.0575736
+-0.0280973 0.16079 -0.0140776
+-0.0421185 0.122004 0.0266511
+-0.0142563 0.178628 -0.0276625
+-0.0440063 0.0629698 0.0401358
+0.0128613 0.0347903 0.0336338
+-0.0248532 0.0348299 0.0453939
+-0.00152849 0.105863 0.0439958
+-0.0346038 0.123422 0.0248791
+-0.0346304 0.079471 -0.0235463
+-0.0639625 0.126764 -0.00871214
+0.0364026 0.0547846 -0.00674979
+-0.0064883 0.123768 0.0340789
+-0.0470974 0.168427 -0.00297818
+-0.0575443 0.0401418 -0.00909914
+0.0257874 0.0895854 -0.0228249
+0.0183006 0.0383341 -0.0177245
+-0.0524963 0.0848256 0.0453696
+0.0561175 0.0494119 0.0111925
+-0.0588172 0.123244 -0.00816875
+-0.00922198 0.0384881 0.0221926
+-0.0331235 0.126633 0.00621772
+-0.0119418 0.120727 -0.011899
+-0.0607049 0.145387 0.0368926
+-0.0306093 0.125854 0.0144859
+-0.0356146 0.127659 0.0111781
+-0.0776104 0.0802915 -0.00928059
+-0.0702074 0.0394853 -0.000301673
+0.0434891 0.0583702 0.0316051
+-0.0789513 0.128091 -0.00607242
+-0.042519 0.0534194 0.039352
+-0.00449744 0.0939058 0.0556112
+-0.0094927 0.0619497 0.0558121
+-0.0694824 0.0944579 0.0422945
+-0.0771177 0.0879695 -0.0126012
+0.014854 0.103191 -0.021265
+-0.043284 0.169832 -0.00794427
+-0.00983007 0.124748 -0.00821099
+0.048512 0.0692789 0.0025489
+-0.0620323 0.0343503 0.0308946
+-0.074493 0.145596 0.0437863
+-0.0375024 0.104216 0.0394845
+-0.047499 0.0451812 0.0421654
+-0.0836103 0.0769236 0.0176347
+-0.0636092 0.170093 -0.0469941
+-0.0483594 0.137097 0.0143972
+-0.087232 0.102325 0.0223672
+-0.035507 0.104243 0.0399833
+-0.0577119 0.0708497 -0.0156457
+-0.00436115 0.122059 -0.0113929
+0.0024069 0.037633 -0.0245625
+0.00251114 0.0911189 0.0554408
+-0.0357211 0.0710689 -0.0174927
+0.0183807 0.0432425 -0.0223469
+-0.0688327 0.09803 -0.0157395
+-0.0747491 0.155081 0.00248708
+0.0451476 0.0833704 0.0221542
+-0.0657925 0.14111 0.0417765
+-0.0365871 0.119162 -0.0120374
+0.0101976 0.131045 0.010577
+-0.0249388 0.183594 -0.0126758
+0.0330579 0.0598189 -0.0157593
+-0.0212823 0.0391811 0.0388836
+0.0144144 0.0403325 -0.0225056
+-0.0304932 0.104292 0.0413193
+0.0224755 0.0947811 0.0470955
+-0.0694247 0.0337382 0.00515427
+-0.00249301 0.118317 0.039019
+0.0288984 0.0924492 -0.0198656
+0.033052 0.0440867 0.029429
+-0.0616004 0.15843 -0.0275855
+-0.0438223 0.0615675 0.0400039
+-0.0452867 0.0410146 -0.0162976
+0.0314256 0.0991914 -0.015062
+-0.0524965 0.0833785 0.044899
+-0.0298946 0.0436977 0.0506861
+-0.076428 0.148619 -0.00986569
+-0.0761803 0.0914451 0.0387697
+-0.0730299 0.172199 -0.0345665
+-0.0274981 0.0960112 0.0443229
+0.0045023 0.13009 0.02428
+-0.0302254 0.162455 -0.00347789
+-0.0871035 0.11231 0.0319974
+0.00225053 0.0726262 -0.0348847
+-0.0748173 0.152727 -0.0208966
+-0.0354946 0.118017 0.0312708
+0.0436028 0.0973418 0.0171655
+-0.0754981 0.13448 0.0513067
+0.0513136 0.0574694 -0.00408483
+-0.0228193 0.0854366 -0.0379031
+-0.057217 0.0336859 0.0130711
+-0.0749012 0.110639 -0.0076926
+-0.00874782 0.125791 -0.00734235
+0.0343242 0.100732 -0.0126444
+-0.0155312 0.126827 -0.00025822
+0.0145856 0.0341976 0.00165401
+-0.0175043 0.114096 0.0387143
+0.0552517 0.0720728 0.0198735
+0.0406726 0.0731516 -0.00877611
+-0.0268119 0.082528 -0.0368734
+-0.0262156 0.0519422 -0.0264212
+-0.0464977 0.041126 -0.0122454
+-0.0711885 0.173044 -0.0381946
+0.0492058 0.0511603 0.0287949
+-0.00188013 0.105918 -0.0222309
+-0.046455 0.126722 0.0256927
+-0.0142526 0.181479 -0.0279552
+-0.0655009 0.0903733 0.0443899
+-0.0037337 0.131051 0.015481
+-0.0308026 0.0367564 0.0517774
+0.0277802 0.121908 0.0142262
+-0.0344815 0.0575696 0.0386716
+-0.0844149 0.0777754 0.0115138
+0.0294342 0.0383781 -0.00173395
+-0.0423644 0.120691 0.0280931
+-0.0350646 0.156323 -0.010574
+-0.0619093 0.0470515 0.00567882
+-0.00290933 0.0388493 0.0285794
+-0.059258 0.0467212 -0.00132733
+0.00450339 0.123789 0.033846
+-0.0229547 0.12614 0.0172488
+0.0410852 0.0394499 0.00526393
+0.0049695 0.0340349 0.00359293
+-0.0513689 0.0516822 0.0322144
+-0.0606335 0.122654 0.0421622
+-0.0645986 0.15064 0.0368964
+-0.0632078 0.143892 -0.00837073
+-0.0386435 0.0563025 -0.0111331
+-0.0658025 0.083802 -0.0186684
+-0.062835 0.128322 0.0425151
+-0.0715276 0.14003 0.0472238
+0.056383 0.0538774 0.0233551
+-0.0610939 0.0335153 0.00346695
+-0.00051118 0.0978394 0.0524335
+-0.0418663 0.0340021 -0.00580283
+-0.042485 0.0762268 0.0429934
+-0.0512844 0.138511 0.0223666
+0.0367682 0.0888721 0.037463
+0.00724928 0.0711363 -0.0334334
+-0.0505534 0.0543594 0.017626
+0.00614025 0.110185 -0.0202335
+-0.00850551 0.0561268 0.0532043
+-0.0295938 0.0789709 0.0427962
+-0.0287487 0.0349103 0.0496611
+-0.0584012 0.154047 0.0286827
+-0.0127037 0.064273 -0.0367671
+-0.0288624 0.0606727 -0.0254104
+-0.0376712 0.125956 0.0207679
+-0.0612726 0.0708854 0.0380779
+-0.0637251 0.155028 0.0282356
+0.0531328 0.0476715 0.00620176
+-0.00308571 0.124589 0.0331408
+-0.0186888 0.0352267 -0.0190015
+0.001497 0.119685 0.0377723
+-0.032734 0.120436 -0.00935257
+-0.054542 0.0631354 -0.00767633
+0.052054 0.0718585 0.0216053
+-0.00556188 0.116801 -0.0157696
+-0.0504949 0.138575 0.0203939
+-0.00542543 0.120041 -0.0132322
+0.0310541 0.0727142 0.0413756
+-0.0558801 0.045112 0.0236807
+-0.0167974 0.0382847 0.0190235
+0.0256741 0.0809122 0.047736
+-0.0199636 0.0668339 0.051351
+-0.0491191 0.159098 -0.00622225
+-0.0506725 0.0667938 0.036819
+-0.0492762 0.143079 0.00435473
+-0.0216794 0.0538141 -0.0303252
+0.0305352 0.10973 -0.0102674
+-0.0225945 0.157229 -0.0076361
+-0.0530851 0.151641 -0.00314317
+-0.0271151 0.122681 0.0231414
+-0.0134994 0.0884096 0.056966
+-0.0266886 0.0335519 -0.0246454
+-0.008499 0.12243 0.035017
+-0.0393069 0.033537 -0.0233717
+-0.033807 0.0461583 0.044586
+-0.0198183 0.158714 -0.00970491
+-0.0835554 0.0925405 0.0305699
+-0.0340008 0.0766042 -0.0254969
+0.00352334 0.12519 0.0325857
+-0.0424905 0.0424327 0.0427417
+0.0232877 0.123385 0.0253956
+0.0230237 0.100791 0.0439995
+0.0307365 0.117405 0.0253192
+-0.0772723 0.114862 0.0500033
+-0.0264336 0.0535943 0.0384453
+0.0177456 0.0350628 0.0325863
+-0.0121375 0.102128 -0.024127
+-0.000203909 0.130048 0.0239772
+0.00795806 0.127195 -0.00506697
+-0.0252695 0.156633 -0.00336931
+0.0179609 0.1201 -0.00942839
+-0.0769756 0.068555 0.0156381
+-0.0871021 0.111516 0.0397664
+-0.0544907 0.101557 0.0424048
+-0.0572843 0.0589766 -0.000464382
+-0.07902 0.0751794 0.0271309
+0.0102371 0.115602 -0.0165593
+-0.0105893 0.180273 -0.0272114
+-0.0528115 0.0913061 -0.0221889
+-0.064755 0.068231 0.0343382
+-0.0137258 0.125368 -0.00476898
+-0.0635922 0.178326 -0.0570781
+-0.0239683 0.126504 0.0139537
+-0.0600264 0.132579 -0.00719549
+0.044826 0.0791184 -0.000782084
+-0.00541885 0.0969111 -0.0306599
+-0.0301034 0.0537602 -0.0193727
+0.0409333 0.0900371 -0.0097907
+0.024446 0.115337 -0.010308
+-0.0283175 0.0963396 -0.0241496
+0.0299711 0.119398 0.020753
+-0.0265916 0.172718 -0.0105089
+-0.0586682 0.128313 0.0397417
+-0.0818638 0.147313 0.00119815
+-0.0254305 0.0357675 -0.0290845
+-0.038039 0.126372 -0.00365101
+-0.00149717 0.0815096 0.0574492
+-0.00738223 0.0931774 -0.0348179
+0.0558223 0.0493444 0.0161931
+0.0577347 0.0705061 0.0074689
+-0.0778727 0.096767 0.0360596
+0.0144985 0.11402 0.0378951
+0.00389123 0.0355229 -0.0148126
+0.0242948 0.124607 0.0114976
+0.0565412 0.0674698 0.002463
+-0.0308889 0.108768 -0.0191524
+0.011955 0.0349898 0.0332703
+-0.0129143 0.104805 -0.023047
+-0.0938592 0.11877 0.0212975
+0.0106595 0.0357626 0.0286983
+-0.0652684 0.163853 -0.0591668
+-0.0359879 0.0421738 0.0454409
+-0.0685089 0.100042 0.0409867
+0.03476 0.113033 0.0239837
+-0.0346506 0.126197 -0.000232823
+-0.0386758 0.0462873 -0.0214583
+0.0257808 0.10679 -0.0151172
+-0.0618601 0.153758 -0.0185818
+0.03067 0.0917687 -0.019137
+0.0275533 0.0672844 0.0433037
+-0.0414978 0.0748079 0.0427759
+-0.0218204 0.0840783 -0.0384285
+0.037815 0.0630498 -0.0108066
+-0.0602789 0.0617061 0.0251086
+-0.0768171 0.154199 -0.00689913
+0.00550054 0.0990386 0.0482677
+-0.0391759 0.16667 -0.0123913
+-0.0616525 0.116813 -0.0113459
+-0.0227683 0.0699063 -0.0373697
+-0.0825008 0.107588 0.0273509
+0.0253381 0.0418727 -0.00588506
+-0.014565 0.035318 -0.01827
+-0.00278761 0.0390101 -0.00997081
+-0.0895837 0.137934 0.0361877
+-0.0855599 0.112052 0.0307632
+-0.027858 0.0343176 -0.0296609
+-0.0325025 0.0675467 0.0400218
+0.0183334 0.0348857 0.00364336
+-0.0469365 0.0404762 -0.0121149
+-0.0777262 0.0825344 -0.0106004
+-0.00467074 0.0569349 -0.0330586
+-0.0194597 0.165415 -0.0107679
+-0.0210403 0.122456 -0.00761783
+-0.0388087 0.0446425 -0.0234233
+-0.0696543 0.0614896 0.0127042
+0.0440466 0.0931306 0.0221521
+-0.0647046 0.0352193 0.0243246
+-0.0166096 0.0435748 -0.0274243
+0.0441838 0.0712847 0.000450163
+-0.0285281 0.0522637 0.0377683
+-0.0599387 0.147394 -0.00221747
+-0.0440942 0.156163 -0.00853601
+0.0388076 0.0807597 0.0350812
+-0.0141543 0.161827 -0.01362
+-0.0210631 0.0385773 -0.00578617
+-0.0237266 0.161004 -0.00287357
+-0.0863431 0.0896619 0.0263909
+-0.0829431 0.0790271 0.0235207
+0.0268259 0.0605622 0.0439609
+-0.0224026 0.0384511 0.0303351
+-0.0635581 0.170962 -0.0485923
+-0.0456965 0.147701 -0.00292724
+-0.0532705 0.0373829 0.0469289
+0.0231843 0.0658868 0.0457612
+-0.0887459 0.132238 0.00325707
+0.00920248 0.0914355 -0.0308607
+-0.0298874 0.063588 -0.0244234
+0.00157852 0.12719 -0.00497022
+-0.0814436 0.153873 0.00890807
+-0.0624959 0.0607929 0.0219134
+-0.0680579 0.149988 0.0386907
+0.0166077 0.128469 0.0186355
+0.00550411 0.0731036 0.0564845
+-0.00249995 0.0661849 0.0567093
+-0.0735022 0.155469 -0.0279133
+-0.0851803 0.0899483 -0.00256663
+0.0394434 0.0585828 -0.00486619
+-0.0739433 0.134018 -0.00754124
+-0.038066 0.156257 -0.0102365
+0.00335185 0.118611 -0.0157819
+-0.00660848 0.0420213 -0.0257519
+-0.0639921 0.0605727 0.020032
+0.0252819 0.100786 -0.0187149
+-0.0820788 0.0765181 0.0218286
+-0.0167051 0.0584876 -0.0351851
+-0.023274 0.106158 -0.0224283
+-0.0878269 0.087472 0.021463
+-0.0786369 0.113551 0.047197
+0.0360644 0.0861926 0.0381664
+-0.082909 0.123594 -0.00426589
+-0.029497 0.177966 -0.015166
+-0.0170948 0.127006 0.022289
+0.0524062 0.0491022 0.00128138
+-0.0198015 0.10169 -0.0238258
+-0.0221328 0.166772 -0.0183109
+-0.00252234 0.038424 0.00547409
+-0.0255028 0.0606627 0.0401195
+-0.0385432 0.0337417 -0.0196892
+-0.0644389 0.0627719 0.0250864
+-0.0879688 0.113092 0.00628888
+0.000951329 0.10045 0.046938
+0.0386471 0.086118 0.0348681
+-0.0374734 0.0346441 0.0411075
+0.0233517 0.120203 -0.00555174
+0.0462175 0.0761811 0.0179689
+-0.0376403 0.0336717 0.00266115
+-0.0341867 0.172054 -0.0145892
+-0.0623617 0.0420762 0.0420515
+-0.0114712 0.0379322 -0.0163227
+-0.0177227 0.119786 -0.0108098
+-0.0801398 0.154387 0.00935749
+0.00187492 0.0398874 0.0463369
+-0.0730243 0.159629 -0.0349322
+0.0473276 0.0547587 -0.00564531
+-0.0376789 0.0636715 -0.0137557
+-0.0727421 0.180568 -0.051639
+-0.0616232 0.148175 -0.003118
+-0.0248231 0.0839948 -0.0375331
+-0.0652787 0.173897 -0.0604957
+-0.0740506 0.152673 -0.0298916
+-0.0571547 0.150227 -0.00146353
+-0.0903203 0.146073 0.0131505
+-0.0779569 0.132491 -0.00592536
+-0.0290048 0.0550494 -0.0223991
+-0.00849727 0.0898107 0.0570624
+-0.0324948 0.112838 -0.0174448
+-0.0523188 0.0518 0.026645
+0.0302802 0.0506319 0.0365295
+-0.0838507 0.103422 -0.00164978
+-0.0788492 0.100759 0.0340965
+-0.0874564 0.141909 0.0385732
+-0.0155155 0.115507 0.0382335
+-0.0777311 0.0887218 0.0375819
+-0.0730146 0.15545 -0.0319082
+-0.0523124 0.0360662 0.0464431
+-0.06188 0.164622 -0.0566003
+0.0367263 0.0794489 0.0373046
+-0.0734863 0.173577 -0.0500848
+0.00600107 0.0390612 0.028408
+-0.0278792 0.0339265 -0.0214795
+-0.000753868 0.0390895 -0.00403098
+-0.0578284 0.0450681 -0.00544742
+-0.0829344 0.129921 0.0513858
+-0.0111161 0.125335 -0.00680126
+-0.0679477 0.0860672 0.0434473
+-0.0705079 0.105505 0.0376955
+-0.0109443 0.0389825 -0.0115729
+-0.0399106 0.033865 0.000215963
+0.00351496 0.0924905 0.0549546
+-0.0424851 0.033913 -0.0262188
+-0.0792564 0.155246 0.0213567
+-0.0215304 0.127346 0.0119061
+-0.091259 0.117481 0.0430647
+-0.0404902 0.0790417 0.0431478
+-0.0945826 0.122834 0.0222802
+-0.0518346 0.0517811 0.0306554
+-0.0767129 0.161805 -0.0163426
+-0.0867595 0.107707 0.0143554
+-0.0693236 0.142228 -0.0102995
+-0.0204959 0.105781 0.0424626
+0.0438044 0.0987496 0.00916312
+-0.00281997 0.0854457 -0.0370162
+-0.00280088 0.0840687 -0.037315
+0.0293196 0.0632732 0.0423131
+0.00625559 0.0725849 -0.0341185
+0.0203077 0.0621778 -0.0269805
+0.0563556 0.0723446 0.0173318
+-0.0230123 0.107366 -0.0218426
+-0.00742046 0.035877 -0.0249268
+0.0374488 0.0402522 0.0247009
+0.0292061 0.055224 -0.0177993
+-0.0184858 0.127732 0.0173962
+-0.0921542 0.132321 0.0142287
+-0.0583136 0.145422 -0.00203607
+-0.0688478 0.0994593 -0.0152611
+-0.0615047 0.167821 -0.0555677
+-0.0915903 0.125424 0.00726612
+0.0199591 0.0564127 0.0480725
+0.0378679 0.0713179 0.0353865
+-0.000605671 0.129033 0.0267429
+0.0298673 0.0740916 0.0431977
+0.00443138 0.126024 0.0314422
+0.0239815 0.12134 -0.00278507
+-0.0246606 0.0521655 -0.0277657
+0.0146913 0.0820798 0.0529703
+0.0259518 0.075434 0.0462884
+-0.0332069 0.0609523 -0.0145937
+-0.0191994 0.0907344 -0.0364225
+0.0589179 0.0607855 0.00414854
+0.0361999 0.103252 -0.0093129
+-0.0498767 0.0529199 0.0166388
+-0.0681894 0.0774836 0.0397476
+-0.021626 0.038176 0.00908889
+-0.0723232 0.163826 -0.0419605
+0.0104934 0.109851 0.0397458
+-0.0177283 0.0627822 -0.0360863
+-0.0628376 0.161493 -0.0485893
+0.00323101 0.120377 -0.0136716
+0.0551973 0.0674594 0.0252672
+-0.0349319 0.127285 0.00554823
+0.0194228 0.125079 0.025397
+-0.00805064 0.130356 0.00959263
+-0.0314936 0.097435 0.044487
+-0.0557138 0.0342594 0.0288064
+0.0212843 0.0490624 0.0410711
+-0.0898642 0.114175 0.0316644
+-0.0868422 0.134936 0.00226938
+-0.0758819 0.156006 0.016671
+-0.00997005 0.175779 -0.0292074
+-0.0603522 0.0407823 0.0443369
+0.0416146 0.0598915 -0.00407392
+0.0165523 0.0922417 -0.0256623
+-0.0245975 0.0365494 -0.0290831
+-0.0381375 0.160902 0.00087141
+-0.0719085 0.064649 0.0201308
+0.0144227 0.0477589 -0.0252693
+0.0603421 0.0650847 0.0181826
+-0.0146479 0.0481463 -0.0303376
+0.00721829 0.131495 0.00948452
+0.0394741 0.102755 0.0261825
+-0.0127182 0.0685587 -0.0376659
+0.0338414 0.0392101 0.0249005
+-0.0639127 0.160548 -0.0182872
+-0.0885745 0.0901142 0.00646846
+-0.0497297 0.0416675 0.0451167
+-0.0695102 0.148387 0.0405048
+0.0369413 0.0618853 0.0357448
+-0.0614969 0.0987359 0.0427353
+0.0264406 0.0434552 0.0361928
+0.0457541 0.0497206 0.0308161
+-0.0184963 0.0486167 0.0482304
+-0.086692 0.140502 0.00718566
+-0.0116045 0.0420472 -0.0262702
+-0.0708693 0.149702 0.0392474
+-0.061676 0.0343224 0.032737
+-0.00749303 0.115552 0.0402888
+0.0603302 0.0678632 0.0121432
+-0.070517 0.146976 0.0420031
+0.0360463 0.0953891 -0.0118379
+0.0368862 0.0601656 -0.0107732
+0.0239184 0.116674 0.0330029
+-0.0804601 0.148683 0.000173633
+-0.0604926 0.0344653 0.0380756
+-0.0152525 0.177145 -0.0265204
+-0.0773226 0.108517 -0.00660544
+-0.0176381 0.0465514 -0.0286775
+0.0313677 0.11674 -0.000181085
+-0.0465999 0.111104 -0.0175509
+-0.0408947 0.172668 -0.00780492
+0.0241275 0.120631 -0.00401437
+-0.055903 0.111216 -0.0172629
+-0.0781607 0.0935055 -0.0115755
+0.0158369 0.105055 -0.0192576
+-0.0130717 0.0973914 -0.0292103
+0.00114663 0.103071 -0.022297
+-0.0545436 0.0443717 -0.00770843
+0.0381644 0.0887078 -0.0138852
+-0.0638458 0.0366675 0.0422565
+-0.0245954 0.122675 -0.00581505
+-0.0199502 0.0553853 0.0474489
+-0.0454976 0.13168 0.014882
+-0.0808086 0.113339 -0.00208766
+-0.0658194 0.154782 -0.0493821
+-0.0138747 0.104484 -0.023001
+-0.0293428 0.112771 -0.0173776
+0.0139014 0.0962996 -0.0239693
+-0.0834257 0.145967 0.00318768
+-0.0299391 0.175699 -0.00474628
+-0.00851553 0.0759427 0.057359
+-0.0679104 0.122376 -0.00896749
+-0.0104955 0.0731168 0.0565579
+-0.0480021 0.126873 0.0289133
+-0.052022 0.0561083 0.0186673
+-0.0627916 0.150662 -0.00757045
+-0.0667057 0.14638 -0.0236565
+-0.0714698 0.161004 -0.0429413
+-0.0459114 0.0657109 0.0391289
+-0.0127989 0.0827406 -0.0389623
+0.0240686 0.0436305 0.0398361
+0.00979486 0.0360464 0.02827
+-0.0144862 0.0715775 0.0549247
+-0.0798641 0.145899 -0.00181913
+-0.0607177 0.0335659 0.00529637
+-0.0635063 0.156747 -0.0406118
+-0.0171212 0.0383927 0.000728518
+0.02686 0.0646091 0.0440244
+0.0291243 0.117712 -0.00241857
+0.0411571 0.0846831 0.0314273
+0.0246298 0.0347052 0.0125163
+0.0376787 0.105425 -0.00281358
+-0.0520342 0.116871 0.0334143
+-0.0526315 0.0335173 0.00157493
+0.0103692 0.116852 -0.0159048
+-0.0299989 0.178534 -0.0140055
+0.0199608 0.126186 0.00277612
+-0.0226771 0.0567339 -0.0313199
+-0.0693087 0.165593 -0.0188405
+0.0435095 0.0527832 0.0325495
+-0.0292487 0.115981 -0.0147474
+0.0390778 0.105565 0.0241719
+-0.0449049 0.167415 0.00301648
+-0.0575339 0.0493779 -0.000368538
+-0.0396388 0.0548721 -0.0111311
+0.0314293 0.102107 0.036834
+0.000480507 0.104429 0.0436509
+-0.0299338 0.0468967 -0.0261593
+-0.0712424 0.155684 0.00373917
+0.0197271 0.0808668 0.051456
+-0.0761145 0.157637 -0.00836344
+-0.0144941 0.122325 0.033097
+-0.0597928 0.095429 -0.0195264
+0.0309421 0.0646254 0.0411415
+-0.0275054 0.104339 0.0416271
+-0.000516741 0.108636 0.04302
+-0.0777092 0.07194 0.024923
+0.0102045 0.0795083 -0.0323062
+-0.0379505 0.150881 -0.00456722
+-0.013105 0.0382607 0.0125563
+-0.0182317 0.187056 -0.0182936
+-0.0182699 0.166848 -0.0125771
+-0.0264587 0.0902029 -0.033595
+-0.0668807 0.112599 0.0436137
+-0.0537473 0.076818 -0.0192258
+-0.0306082 0.165302 -0.00581873
+-0.0796939 0.0873057 0.0353613
+0.0347714 0.100763 0.034674
+-0.035752 0.0415598 -0.0291214
+0.0289767 0.117846 0.0275093
+-0.000706682 0.0655468 -0.0343894
+-0.0610628 0.138403 -0.00654794
+-0.0625935 0.12412 0.0446596
+-0.0648295 0.14966 -0.0309451
+-0.0234815 0.0974495 0.044821
+-0.026575 0.0476865 -0.0258778
+-0.0528683 0.0367334 -0.0118941
+-0.0116753 0.0526919 -0.0331734
+-0.0615062 0.158429 -0.0265894
+0.0320656 0.117538 0.0186978
+-0.00988755 0.103466 -0.0236142
+0.0484958 0.0691068 0.025078
+0.0156548 0.128965 0.0154331
+-0.0665046 0.10698 0.0385746
+-0.0267998 0.0522633 0.0388472
+-0.058755 0.0782067 -0.0192512
+0.0211493 0.0672779 0.0481082
+-0.0288355 0.125617 0.00924976
+-0.0124826 0.0701993 0.05486
+0.0522007 0.0476683 0.00324556
+-0.0443004 0.130334 0.00946299
+-0.00241533 0.0389975 -0.0136337
+-0.0437474 0.0783133 -0.0194351
+-0.0629007 0.115475 0.040648
+-0.0311605 0.169689 -0.016551
+-0.0263193 0.0386673 0.0347214
+0.0366921 0.0807912 0.0372758
+-0.0395001 0.100068 0.0413695
+-0.0681116 0.112409 0.0451263
+0.0386091 0.0686148 0.0346703
+-0.0759482 0.152671 -0.0129066
+0.0145806 0.0953173 0.0493246
+-0.0385004 0.150676 0.00203305
+-0.0935499 0.129634 0.0192397
+-0.0619642 0.126755 -0.00826981
+-0.0537213 0.0709084 -0.0154466
+-0.0314688 0.175764 -0.00340966
+-0.046761 0.126023 -0.00719597
+0.0128678 0.128966 0.0229731
+-0.0721444 0.145534 -0.0189034
+-0.014649 0.0384586 0.0247211
+-0.0782079 0.165287 -0.027954
+-0.0738874 0.0695898 0.0277412
+-0.0880483 0.145895 0.0319999
+-0.00950131 0.0870429 0.0572309
+-0.082872 0.154403 0.0201091
+-0.0574419 0.0424556 0.0216968
+0.0432211 0.097315 0.0201647
+0.0484167 0.0567471 0.0312254
+-0.0899902 0.146067 0.012148
+-0.0384869 0.0860997 0.0437907
+-0.0677801 0.0837503 -0.017964
+-0.0304968 0.071744 0.0399232
+-0.0267649 0.0754486 -0.0363172
+0.0555795 0.068697 0.0240751
+-0.00326172 0.0994383 0.0499516
+-0.0539364 0.153495 0.0157968
+-0.0264808 0.0509031 0.0429156
+0.0477223 0.0435274 0.0201079
+-0.027646 0.071755 0.0409574
+-0.025483 0.0988427 0.0444451
+0.00433576 0.055339 -0.0305463
+-0.0809392 0.0721012 0.0145438
+-0.0859359 0.0980836 0.000413824
+-0.0660122 0.153896 -0.0475582
+-0.0275574 0.156658 -0.00139783
+-0.0134137 0.0581871 0.0521911
+-0.0774938 0.134462 0.0515018
+0.0104958 0.0560929 0.0526786
+-0.00951583 0.0848597 -0.0382215
+-0.0298676 0.0916468 -0.0252289
+-0.0751451 0.15577 0.0110973
+-0.0887521 0.0969152 0.00742291
+-0.00642846 0.119149 -0.0142793
+-0.0351305 0.127632 0.00987733
+-0.079479 0.1087 0.0330138
+-0.00387451 0.0384228 0.00884205
+-0.0794858 0.0940336 0.0349322
+-0.0809833 0.080323 0.0311985
+-0.0874477 0.148578 0.0299355
+0.015852 0.106086 -0.0183494
+-0.0799154 0.12806 -0.00573177
+-0.0810332 0.092317 -0.00857663
+-0.0428426 0.0956907 -0.0224311
+-0.0843197 0.0830919 -0.00150258
+0.0270369 0.0347621 0.0147774
+-0.0114905 0.108632 0.0428314
+-0.0298836 0.04486 -0.0282273
+-0.0675863 0.0915604 0.0429945
+-0.0858462 0.0806083 0.01849
+-0.0377888 0.0855996 -0.0220857
+-0.080296 0.0886098 0.0345053
+-0.0631283 0.163827 -0.0595262
+-0.0200798 0.0653829 0.0501099
+0.0101376 0.104418 -0.0202461
+0.00311717 0.113125 -0.0199945
+0.00740202 0.0404296 -0.0235788
+-0.0233436 0.179984 -0.0199453
+-0.0849416 0.153745 0.0179582
+-0.00950506 0.0660833 0.0554985
+-0.0149561 0.0997734 -0.0237179
+-0.0625045 0.160053 -0.0215634
+0.0134925 0.114016 0.0379994
+-0.0484084 0.144974 0.000471547
+-0.0765927 0.0770726 0.0330453
+-0.0522524 0.0566167 0.0245415
+-0.0446531 0.0607308 -0.0127894
+-0.077361 0.0729429 -0.00456158
+-0.0164852 0.0870004 0.0567616
+0.00917846 0.101539 -0.0214106
+-0.0114976 0.0883765 0.0564607
+-0.0365032 0.109752 0.0369592
+-0.0622101 0.169551 -0.0614764
+0.0134275 0.117615 -0.0147491
+-0.0194201 0.1246 -0.00382324
+0.000402662 0.121936 0.0359399
+0.0308218 0.101142 -0.0151148
+0.044544 0.0748845 0.0238506
+-0.0190349 0.0930706 -0.0347914
+-0.0284257 0.15795 -0.0115973
+-0.0835152 0.150011 0.0330149
+-0.0723608 0.0363259 0.00395733
+0.049239 0.0437392 0.0164633
+-0.0281399 0.0917982 -0.0286003
+-0.0894337 0.132252 0.00424863
+-0.0478863 0.033513 -0.0102384
+-0.0480003 0.126688 -0.00585567
+-0.0147076 0.0933085 -0.0349989
+-0.0344513 0.172765 -0.000813008
+-0.012881 0.107288 -0.0218461
+-0.0494996 0.111168 0.0370596
+0.0195435 0.100771 0.0459866
+0.0383256 0.0387198 0.0189634
+-0.0490718 0.151664 -0.00461846
+-0.0413062 0.123313 -0.010402
+-0.0764561 0.106685 0.0353026
+-0.0506178 0.0590261 -0.0100428
+-0.0085531 0.0385596 0.00412906
+-0.0510743 0.153146 -0.0044532
+-0.0168415 0.122494 -0.0076608
+-0.0724396 0.129821 0.051541
+-0.0447123 0.0336927 -0.0153017
+-0.0128672 0.038589 0.0285719
+-0.0769694 0.136896 -0.00565009
+-0.0204809 0.0526524 0.0459576
+-0.0190093 0.100114 -0.02409
+0.0491876 0.0602673 -0.00438234
+2.68966e-05 0.0991578 -0.0250032
+-0.0146066 0.0355634 0.0504427
+0.0437747 0.084485 0.0264379
+-0.0613665 0.0430534 -0.00574325
+0.0102029 0.0779579 0.0551886
+-0.0584973 0.109766 0.0377913
+0.0405117 0.0657145 0.0303349
+0.0123622 0.0523525 -0.0283928
+-0.0865442 0.107736 0.017365
+-0.0273471 0.0735222 0.0429845
+-0.076628 0.169808 -0.0316679
+-0.00310182 0.130332 0.00278812
+0.0456485 0.0904179 0.0101632
+0.0367704 0.109675 0.000243105
+-0.0088954 0.108786 -0.0222808
+-0.0722528 0.156819 -0.0369077
+-0.0343294 0.175491 -0.0032043
+-0.0612579 0.167808 -0.0576007
+-0.0225051 0.10854 0.0408657
+-0.0396128 0.0492137 -0.0115104
+-0.0528856 0.104156 -0.0198053
+-0.0114785 0.0965129 0.0526113
+-0.0493499 0.141685 0.00939558
+-0.053326 0.162717 0.00204741
+0.0382413 0.108427 0.0210592
+0.0250594 0.122946 0.0231962
+0.0436593 0.058746 -0.00488132
+-0.052188 0.0559056 0.0136207
+-0.0337241 0.163848 -0.00328844
+-0.0671575 0.17049 -0.0366968
+-0.0780353 0.0880327 -0.0115615
+-0.00752216 0.122122 -0.0114318
+-0.0578223 0.12834 0.0392194
+-0.0624397 0.16285 -0.0548313
+-0.00720215 0.0344571 -0.0178933
+0.0219696 0.0347867 0.0191885
+0.0134971 0.112635 0.0387508
+-0.0188778 0.168283 -0.0134663
+0.0418633 0.0718502 -0.00680416
+0.00188261 0.129936 0.0247306
+-0.0143909 0.0388658 -0.0140202
+-0.0866821 0.0819953 0.0154888
+0.0511122 0.059915 -0.00400422
+-0.0637796 0.0419038 0.0392448
+-0.0334673 0.0532523 0.0375728
+-0.0640539 0.142491 0.0390245
+-0.0197273 0.118003 -0.0129221
+-0.0739294 0.0686501 -0.000515794
+0.022253 0.0430673 -0.0137151
+0.0169102 0.120624 0.0334304
+-0.0533452 0.118341 0.0350731
+-0.0407313 0.0710722 -0.0172567
+-0.0444934 0.108473 0.0392485
+-0.0406946 0.0340162 0.0268873
+-0.0428689 0.104235 -0.0209095
+0.000289503 0.0391337 -0.00386275
+0.0202669 0.0819781 -0.0271085
+0.0339966 0.0363512 0.0147468
+-0.0623699 0.0366895 0.0436353
+0.0112859 0.0638878 -0.0308862
+0.044262 0.0945325 0.00218274
+0.0178069 0.0349979 -0.00592782
+0.00766772 0.130773 0.00395877
+-0.0518373 0.0337424 -0.0112411
+0.05138 0.0464792 0.0212617
+-0.054495 0.0932121 0.0445367
+0.0154864 0.0380581 -0.0207587
+0.0322412 0.0368006 0.00286913
+0.0226382 0.0714084 0.0485432
+-0.0474967 0.0761987 0.0428659
+-0.0433556 0.0337438 -0.00770024
+-0.0507933 0.0869468 -0.0215939
+-0.0428743 0.166323 -0.00997516
+0.0420989 0.0930078 0.0271705
+-0.0133438 0.11201 -0.0186315
+-0.0682581 0.156305 0.0164417
+-0.0709159 0.125294 -0.00875352
+-0.0758095 0.0920857 -0.0139153
+0.00691185 0.038861 0.0287775
+-0.0755745 0.0702081 -0.000465226
+0.0560342 0.0622175 0.0264602
+0.00750328 0.0532576 0.0522142
+-0.0557017 0.0693735 -0.0143448
+-0.0400399 0.0367774 -0.0284153
+0.0452718 0.0917995 0.0131601
+0.0113635 0.0534706 0.0514016
+-0.056641 0.0429978 -0.00777539
+-0.0163006 0.182966 -0.0260091
+-0.0724038 0.116078 0.0519992
+-0.0223961 0.161302 -0.0143028
+-0.016322 0.128515 0.00945034
+-0.0761998 0.14998 -0.0148766
+-0.084898 0.11701 -0.000772283
+0.0215009 0.111167 0.037529
+-0.0116746 0.164119 -0.0176003
+-0.0386977 0.0666031 -0.0147476
+-0.0475127 0.0411749 0.0444313
+-0.0741496 0.147181 -0.0158602
+0.0423699 0.0412112 0.0211935
+-0.0112343 0.126014 -0.00554296
+-0.0627796 0.16313 -0.0285907
+0.0598501 0.0664357 0.0191799
+0.0444747 0.0438727 0.000520461
+-0.0449903 0.16693 -0.00785376
+-0.0241862 0.125789 0.00366503
+0.0303543 0.0942493 0.0422823
+0.0385368 0.0800568 -0.0127167
+-0.0329258 0.120263 0.0285346
+-0.0277494 0.0764615 0.044728
+0.0072822 0.0344718 -0.00192729
+0.0164745 0.103092 0.0456772
+-0.000370674 0.0391495 0.0306363
+-0.0444932 0.109842 0.0382343
+-0.0228558 0.113062 -0.0177116
+-0.0323055 0.0384897 -0.00796454
+0.0330143 0.106332 -0.0106209
+-0.0905664 0.150208 0.0151282
+-0.0473203 0.122487 0.0279328
+-0.079976 0.076532 0.0275303
+-0.0185178 0.0383092 0.00415679
+-0.0400541 0.128036 0.0139949
+-0.0725037 0.079155 0.0383043
+-0.00705924 0.127865 -0.00358478
+-0.0474808 0.0518309 0.037336
+0.0281857 0.0888902 0.0443935
+-0.0325014 0.102916 0.0416129
+-0.0636379 0.131123 0.0413473
+-0.0194422 0.0952996 -0.0310527
+0.0343622 0.0673468 0.0390872
+0.00248248 0.0385592 0.0461627
+-0.0207428 0.0656176 -0.0364653
+-0.0354216 0.17545 -0.00362892
+-0.0186888 0.127303 0.00423263
+-0.0697675 0.129835 0.0501143
+-0.0645483 0.168715 -0.0400434
+0.0176026 0.0520233 0.0463575
+-0.0165066 0.11684 0.0369313
+-0.0539292 0.0475998 -0.00643542
+0.0206619 0.125677 0.022985
+0.0131 0.034428 -0.00821794
+-0.0884031 0.101017 0.0203758
+-0.089294 0.136502 0.0252035
+-0.0633961 0.0610267 0.0215327
+-0.0181382 0.0625693 0.0510808
+-0.0363013 0.0408102 0.0457892
+-0.0348891 0.0341588 0.0262022
+0.0321818 0.0994934 0.0379171
+-0.0650996 0.115729 0.046366
+-0.0446047 0.0505366 -0.0105481
+-0.0170833 0.0896859 -0.0373218
+-0.0135156 0.162506 -0.0153049
+-0.0264962 0.119343 0.030427
+0.053783 0.0561466 -0.00178141
+-0.0659739 0.131145 -0.00872206
+-0.022585 0.185119 -0.0131839
+-0.0902473 0.132271 0.00623314
+-0.0343818 0.038354 -0.0138166
+-0.087117 0.119846 -0.000719646
+-0.0514997 0.047729 0.0396118
+-0.0837154 0.0804764 0.0234959
+0.0452487 0.0681916 0.00167659
+0.0443433 0.0762807 -0.00178421
+0.0393871 0.0828883 -0.0127786
+0.0133395 0.0475307 0.0453837
+0.0393635 0.0445531 -0.00413158
+0.0464068 0.0778555 0.00918735
+0.0498828 0.0474685 0.000307011
+-0.0205115 0.114066 0.0379617
+-0.0795322 0.0826724 -0.00859002
+0.0277802 0.0692504 -0.0226951
+-0.0640511 0.139618 0.0390194
+-0.0622733 0.144309 -0.00616114
+-0.0598164 0.122657 0.0415831
+-0.039222 0.0363262 0.0107899
+-0.0476756 0.0694312 -0.0151035
+-0.0114975 0.12239 0.0342495
+-0.0759886 0.0701373 0.025079
+0.0247695 0.1047 0.0394768
+-0.0424955 0.0464529 0.0406301
+-0.0209812 0.0389557 0.0535988
+-0.0434801 0.0917165 0.0428888
+-0.0936604 0.128255 0.0172452
+-0.0319662 0.163855 -0.00423083
+-0.0864626 0.107749 0.0163884
+0.00261599 0.0960798 -0.0297441
+0.0192696 0.124452 -0.00213625
+-0.0635019 0.0945759 0.0438874
+-0.0434804 0.108484 0.0391565
+-0.0767016 0.15969 -0.0259195
+-0.0207953 0.0784993 -0.0390618
+-0.0168597 0.0382017 0.0136589
+-0.0128908 0.129601 0.0150315
+-0.063562 0.136724 0.0379539
+-0.0592557 0.146819 0.0355066
+-0.0102821 0.0421361 0.0498123
+0.00411674 0.108725 -0.0201726
+-0.0471696 0.16597 0.00363215
+-0.0324882 0.0560654 0.0375153
+0.016314 0.061771 0.0498607
+-0.0633808 0.154539 0.0298218
+0.0319993 0.108737 0.0323781
+0.0224822 0.0578106 0.0464363
+-0.0731478 0.0644323 0.00940567
+-0.0136846 0.0555659 -0.0339274
+-0.0485565 0.0335372 0.00238031
+-0.0485794 0.128753 -0.00187037
+-0.0761205 0.0927947 0.038671
+-0.00890397 0.114438 -0.0172305
+-0.0881957 0.146062 0.0092207
+-0.067835 0.0951999 -0.016639
+-0.0826594 0.0993103 0.0308836
+0.0194806 0.107063 0.040905
+-0.0755472 0.15139 -0.00989046
+-0.0619095 0.118087 -0.0102757
+-0.0770237 0.0716688 -0.00146855
+-0.0090472 0.129209 0.0236827
+0.0166896 0.0645037 0.050425
+-0.044493 0.0860963 0.0437549
+-0.0851043 0.10321 0.0261425
+-0.0929793 0.125561 0.0282631
+-0.0792446 0.0699823 0.0139682
+-0.0541984 0.150844 0.02639
+-0.0544369 0.147753 0.0264091
+0.029273 0.103313 -0.0154093
+-0.0661878 0.156038 -0.00610123
+0.0513324 0.0613858 -0.00348738
+-0.00765334 0.0905691 -0.0361471
+-0.0036313 0.046681 -0.0294588
+-0.0793953 0.154018 0.0066962
+0.0126509 0.103032 -0.0211055
+-0.0534982 0.0344579 0.0343548
+0.0254331 0.0400654 -0.00462996
+-0.0474929 0.163748 0.00542805
+-0.0174765 0.0514437 0.047967
+-0.023601 0.0379574 -0.0288347
+0.0380126 0.0687088 -0.0127776
+0.0454875 0.0624627 0.0298224
+-0.0929393 0.122846 0.0403052
+-0.0619477 0.0629617 0.0272004
+-0.0632548 0.171035 -0.0614506
+-0.062927 0.150005 -0.0233391
+-0.0539078 0.109837 -0.0181931
+-0.0143481 0.129147 0.0116153
+-0.00460956 0.130321 0.00366937
+0.00735598 0.0509889 -0.0291303
+-0.0480744 0.151666 -0.00489643
+-0.0220459 0.166878 -0.0109827
+-0.0178225 0.0869056 -0.0385387
+0.000268234 0.0669357 -0.034172
+-0.0454819 0.0861255 0.0441555
+-0.0606958 0.0340151 0.0191666
+0.0293305 0.049536 -0.0137505
+-0.0661283 0.153073 -0.0457545
+0.0127964 0.0685744 0.0536204
+-0.0806268 0.150792 0.0343829
+0.0338754 0.0626989 -0.015804
+-0.0415032 0.116675 0.0325492
+-0.00995367 0.16681 -0.0217203
+0.059153 0.0704954 0.0131546
+-0.084323 0.0804069 0.00350409
+-0.0217865 0.0742531 -0.0388026
+0.0333307 0.040756 0.0270424
+-0.00920453 0.175559 -0.0287981
+-0.0565093 0.148178 0.0306333
+-0.0476849 0.146264 0.00805502
+-0.0896679 0.144435 0.0294634
+0.028326 0.0882981 -0.0214817
+-0.0129215 0.129318 0.0179306
+-0.0275354 0.0822426 0.0485604
+-0.0727818 0.154043 -0.034905
+0.0264706 0.0430524 -0.00597567
+-0.0461097 0.129234 0.00159921
+0.00227538 0.0668963 -0.0335609
+-0.0869081 0.0847086 0.0134765
+-0.071509 0.105494 0.0375699
+-0.0564975 0.105681 0.0408231
+-0.0709683 0.136976 -0.00769814
+-0.0238604 0.0347884 0.0456435
+-0.0248096 0.123255 -0.00440954
+-0.0504992 0.0917781 0.0442368
+-0.0672114 0.120049 0.0520179
+-0.067142 0.163768 -0.057034
+-0.0628433 0.16149 -0.0495873
+-0.0851762 0.106326 0.0223754
+0.0111461 0.101633 -0.021979
+0.0319374 0.0568888 -0.0147656
+0.0282794 0.120663 0.00443205
+-0.0912918 0.116401 0.0420373
+-0.00467238 0.0555139 -0.0327809
+-0.0267099 0.0794912 0.0492298
+-0.0226371 0.0622591 0.0442913
+0.0496058 0.0730794 0.0103455
+0.0134712 0.0347114 0.0266012
+-0.027103 0.0633188 -0.0304321
+-0.00446177 0.12682 -0.00651375
+-0.0184963 0.10441 0.0431068
+0.0322846 0.110983 -0.00760517
+0.043549 0.0987325 0.00516762
+-0.0442869 0.166804 -0.00853834
+0.0150912 0.0940152 0.0500689
+-0.07081 0.110507 0.0424798
+-0.0141183 0.115602 -0.0164489
+-0.0567507 0.13816 0.0319811
+-0.0047515 0.0726952 -0.0359954
+-0.0647331 0.0606321 0.00547671
+0.0292295 0.102131 0.038919
+-0.0328692 0.104316 -0.0215625
+-0.0105189 0.165484 -0.0170149
+-0.062488 0.161561 -0.0255895
+-0.083006 0.110313 0.0398706
+0.00202549 0.0390793 -0.0109499
+0.0598509 0.0692231 0.0121425
+-0.0486599 0.0649886 -0.0131055
+0.0193632 0.0475344 -0.0219845
+-0.0505005 0.109789 0.0379415
+0.0227584 0.0942129 0.0471436
+-0.054587 0.123231 -0.00812744
+0.0595925 0.0636093 0.00613697
+-0.0304354 0.159526 0.00145329
+-0.0771836 0.152278 0.0340017
+-0.0641378 0.146153 -0.0169913
+-0.012496 0.0828987 0.0575341
+-0.062259 0.0636125 0.0283336
+-0.0543842 0.064934 0.034129
+-0.0580097 0.136726 0.0336791
+0.0431148 0.0723568 0.0271232
+-0.0719688 0.147362 0.0419058
+0.0324265 0.0414912 -0.00365574
+-0.0504972 0.083371 0.044762
+-0.0277551 0.121254 0.0258902
+0.0248126 0.0672364 0.0446067
+-0.0748658 0.148574 -0.0178655
+0.0199833 0.0422265 0.0426566
+0.00936651 0.0494737 -0.0282538
+-0.0209427 0.127053 0.0165011
+0.014824 0.0950266 -0.0246047
+0.0416966 0.0899224 0.0287651
+-0.0417723 0.0826397 -0.0208385
+-0.0228105 0.123961 0.023212
+-0.0701997 0.155611 0.00411308
+-0.0246949 0.0550734 -0.0288078
+-0.0220519 0.163768 -0.0162501
+-0.0324478 0.069454 -0.0224572
+-0.0827552 0.07629 0.0125227
+-0.0606527 0.151084 0.0352378
+-0.0798891 0.0706304 0.0135503
+0.0476495 0.073201 0.00955169
+-0.00859398 0.0391639 -0.0259828
+0.0142802 0.0873929 0.0523851
+-0.00841973 0.128157 0.0268439
+-0.0665531 0.160013 -0.0120422
+-0.029443 0.0834063 0.0447309
+-0.0564979 0.0776594 0.043476
+-0.0483279 0.119696 0.0300033
+0.0232683 0.0857035 -0.0248261
+0.0321971 0.112814 -0.0055615
+0.0190831 0.0713469 0.0504539
+-0.054494 0.0465534 0.0422647
+-0.0121699 0.165481 -0.0142428
+0.000511137 0.0814953 0.0573473
+-0.0115028 0.0730832 0.0562182
+-0.0401042 0.037954 0.0427598
+-0.0114161 0.0382303 0.016554
+0.0328182 0.0967204 -0.0144274
+-0.00449908 0.0732747 0.0586205
+0.00733671 0.115147 -0.0180672
+-0.0476206 0.111206 -0.0176722
+-0.0624082 0.147544 -0.00957064
+-0.0615795 0.156866 -0.0245858
+0.0175138 0.12671 0.0232635
+-0.0697118 0.0764164 -0.0147262
+-0.0543713 0.158326 -0.00178875
+0.00713327 0.105885 -0.0207766
+-0.033517 0.115303 0.0329858
+-0.0114926 0.0897634 0.0564161
+-0.0375058 0.171208 0.000818011
+0.00542741 0.0336773 0.0131964
+0.0379386 0.07401 0.0354837
+-0.0860277 0.0967286 0.000430639
+-0.0311614 0.0791685 -0.0325602
+-0.0541101 0.0531993 -0.0053725
+-0.0592659 0.0599215 0.0215991
+0.0586637 0.0709935 0.0122726
+-0.0792595 0.0894709 -0.0095871
+-0.026159 0.0918036 0.0468933
+-0.0249745 0.12528 0.0180213
+-0.0519836 0.0517496 0.0236325
+-0.0275449 0.178709 -0.00674077
+-0.0715237 0.165101 -0.0167379
+0.0256965 0.123446 0.00917645
+0.0235224 0.0727618 0.0480692
+-0.0144773 0.0603048 0.0528052
+0.0408807 0.0948081 -0.00628698
+-0.0515819 0.0344024 0.0295565
+0.0311435 0.0885162 -0.0196004
+-0.087234 0.0981695 0.00341761
+-0.0165631 0.165424 -0.0118502
+-0.0497796 0.0518319 0.0348836
+0.0296893 0.110128 -0.0107004
+-0.0212542 0.126244 0.0193308
+-0.0315215 0.0732244 0.0404306
+0.0265706 0.0535806 -0.0207269
+-0.0944184 0.12146 0.0172829
+-0.0780287 0.14129 -0.00491664
+-0.0653187 0.152492 0.0351215
+0.0369332 0.102635 -0.00864905
+-0.0100919 0.126182 -0.00573829
+-0.0589643 0.15508 0.0013052
+-0.00782857 0.0386419 0.00238313
+-0.0893654 0.145802 0.0291185
+-0.077209 0.110378 0.0446936
+-0.0127752 0.0770687 -0.0383028
+-0.060466 0.143311 -0.00379205
+-0.0907002 0.137837 0.017198
+-0.0553853 0.15628 0.0108911
+-0.0609254 0.0454597 -0.00231147
+0.041351 0.0574751 -0.0052144
+-0.0111235 0.0346639 0.0467191
+-0.0520649 0.148658 -0.00262972
+-0.0438434 0.0985095 -0.0215595
+-0.0678163 0.0866062 -0.0177767
+0.0287562 0.053781 -0.0187512
+0.0338991 0.057119 -0.0127141
+-0.0189243 0.181629 -0.0169471
+-0.0888863 0.113493 0.0234001
+-0.0456524 0.0621788 -0.0131898
+-0.0205797 0.0906821 0.0540574
+-0.0285047 0.059221 -0.0254142
+-0.0310985 0.154152 -0.00673494
+0.0362687 0.0941823 0.0368117
+0.0223945 0.0860763 -0.025219
+0.0228611 0.0741302 0.0488936
+-0.0274872 0.094655 0.0450969
+-0.0238248 0.0826344 -0.0380614
+-0.044527 0.0601701 0.0393419
+0.0160126 0.0658829 0.0512178
+-0.0663487 0.06206 0.00207137
+0.000401309 0.0390966 -0.0249339
+-0.027107 0.082291 0.0495314
+-0.0617626 0.0415173 0.0247032
+-0.093011 0.118839 0.0352993
+-0.0662787 0.168684 -0.0320741
+-0.000498287 0.0535066 0.0547347
+0.0431795 0.0737197 0.0272167
+-0.0565118 0.0454033 -0.00602573
+-0.0668006 0.086643 -0.0182518
+-0.0652487 0.163342 -0.0202167
+0.0392901 0.0766734 0.0339466
+-0.0619246 0.106845 -0.0166571
+-0.0611633 0.0334354 -0.00188959
+-0.0722746 0.15542 -0.0369062
+-0.0690618 0.110676 0.0409548
+0.0432493 0.100107 0.00716752
+0.0317499 0.0535218 0.0369319
+-0.0492036 0.131059 0.0288275
+-0.0693592 0.176521 -0.047588
+-0.0072207 0.0356289 0.0484876
+-0.0818563 0.150046 0.00220642
+-0.0435006 0.0534118 0.0391466
+-0.0714969 0.156283 0.0152923
+-0.0883581 0.0875191 0.0194553
+-0.0774993 0.127442 0.0532862
+0.0288434 0.0591735 0.0415864
+-0.053835 0.0329874 0.0179508
+-0.0855039 0.140637 0.0423198
+-0.0597327 0.156046 0.0093301
+-0.052462 0.0642313 0.0336351
+0.000500084 0.12107 0.0367737
+-0.0692573 0.169753 -0.0288779
+-0.0156709 0.0385345 -0.00280448
+-0.00949582 0.118295 0.0381649
+0.0330035 0.116489 0.00476188
+0.0153369 0.0552331 -0.0286287
+-0.0105333 0.0457993 0.0483516
+0.00652975 0.0380351 0.0455331
+-0.0714995 0.101334 0.0391804
+0.0236022 0.115739 -0.0107408
+-0.0580129 0.118724 -0.0113962
+-0.0543247 0.0500125 0.0112758
+0.0587422 0.0635506 0.00411936
+-0.0589036 0.112559 -0.0155981
+-0.0640258 0.15968 -0.0562568
+-0.00990982 0.175697 -0.0247542
+0.00695815 0.0340953 -0.0204902
+-0.0591465 0.152697 -5.16463e-05
+-0.00975768 0.167025 -0.0223761
+-0.0383481 0.0417109 -0.0273458
+0.0463963 0.0778578 0.0141787
+-0.0720541 0.0777606 0.0379027
+0.0259403 0.1091 -0.0135959
+-0.0758056 0.0891863 -0.013912
+0.0429603 0.0873797 -0.00580114
+-0.0676348 0.0704852 -0.0103532
+-0.066267 0.176761 -0.0601056
+-0.013866 0.129156 0.0103484
+-0.067642 0.150503 -0.040589
+-0.0180327 0.0404537 0.0526147
+0.0183116 0.0636834 -0.0282837
+-0.078386 0.154762 0.00850622
+0.030569 0.0491561 0.035175
+-0.0622212 0.169401 -0.0515858
+-0.0565139 0.0548538 0.00566103
+0.00623573 0.0382417 0.0273828
+-0.038479 0.0945169 0.0431902
+-0.00987706 0.108745 -0.0220853
+-0.0621803 0.161575 -0.027587
+-0.0176337 0.125847 -0.00119502
+0.0328914 0.0578172 0.038629
+-0.0414935 0.0776367 0.0431734
+0.0432388 0.0804742 0.027354
+-0.0137772 0.0770735 -0.0384143
+0.0572117 0.0509068 0.011186
+-0.0689532 0.132595 -0.00851473
+-0.0655849 0.0622273 0.00026904
+-0.0535585 0.062801 0.0308747
+-0.0779359 0.154614 0.00720975
+0.00448513 0.0964789 0.0523472
+-0.060329 0.11723 -0.0118118
+0.029915 0.0430998 0.0305942
+-0.0275027 0.115261 0.0337596
+-0.0635137 0.0412627 -0.00639269
+-0.0164929 0.11134 0.0406952
+0.0292409 0.0951488 -0.0187111
+0.0324104 0.0430965 -0.00468251
+0.0317605 0.08491 0.0425067
+0.0289099 0.0929198 0.0437028
+-0.0707001 0.15817 -0.0449161
+0.0551137 0.0732038 0.0153863
+-0.0823243 0.154364 0.0217732
+-0.0715111 0.145604 0.0434169
+-0.0325077 0.0632413 0.0389915
+-0.0696524 0.0680017 0.0300044
+0.0102276 0.0809104 -0.0321098
+-0.0244999 0.049902 0.0466266
+-0.0554111 0.0574706 -0.0044262
+-0.0628667 0.101101 -0.0182166
+-0.00650089 0.0661332 0.0560881
+-0.0330903 0.15925 -0.0128209
+0.042117 0.0792074 0.0292753
+-0.085793 0.0818712 0.00648437
+-0.0594817 0.0426754 0.0236965
+-0.0539359 0.0541543 0.0107637
+-0.00998113 0.12997 0.0175362
+-0.0633398 0.0410523 0.0148679
+0.0595186 0.0696512 0.0111197
+-0.0628106 0.0420167 0.0410925
+-0.0280399 0.038261 0.000453129
+-0.0314842 0.0386701 -0.0153847
+-0.0183396 0.183004 -0.0240946
+-0.0414917 0.0662628 0.0414077
+-0.0512875 0.0335238 -0.00177633
+-0.009723 0.0684621 -0.0362531
+-0.0736747 0.166615 -0.0419946
+-0.0678387 0.0966346 -0.0163917
+-0.0609822 0.170956 -0.0597011
+-0.0778143 0.0696403 0.00741827
+-0.00249339 0.0619776 0.0560364
+-0.0574944 0.0732758 0.0411576
+0.0174045 0.0834609 0.0516215
+0.0222999 0.0360441 0.0108303
+-0.0134047 0.0981882 0.0494032
+-0.0437579 0.0335748 -0.0150071
+0.0210813 0.123852 -0.00148905
+-0.0530498 0.14867 -0.00246875
+-0.00549096 0.105886 0.0440438
+0.0181231 0.0349865 -0.00397885
+0.011218 0.0822648 -0.0313395
+-0.0785671 0.172906 -0.0416992
+-0.0304948 0.094646 0.0448519
+-0.0315011 0.101567 0.0426346
+-0.0867319 0.116264 0.0471164
+-0.0745642 0.0928269 0.03994
+-0.0287411 0.0366033 0.0533099
+-0.0733382 0.158682 -0.00576511
+-0.011641 0.172783 -0.0205328
+-0.0261276 0.166758 -0.01752
+0.0323797 0.117481 0.0145242
+-0.073083 0.166616 -0.0429976
+0.00318323 0.0894801 -0.0335291
+-0.0592544 0.0696245 0.0378273
+0.00902499 0.0346466 0.0239397
+-0.0614627 0.0334736 0.00162861
+-0.081048 0.154699 0.0221975
+-0.0337735 0.0765809 -0.0265027
+-0.0440788 0.0336672 -0.00594116
+-0.0501186 0.0375352 0.0462556
+0.0383972 0.0931984 -0.0106151
+-0.0507798 0.0488052 0.0196439
+0.0480167 0.0525694 0.0306027
+-0.0715181 0.0657302 0.000515199
+-0.0584278 0.0383351 -0.00941724
+-0.0484961 0.0987927 0.0435149
+-0.00449408 0.088412 0.0569078
+0.00197552 0.0378956 -0.000532016
+-0.0538466 0.0665391 0.0363755
+-0.0736039 0.148578 -0.0278556
+-0.0406505 0.117474 -0.0142631
+-0.0354963 0.0690808 0.0415601
+-0.063566 0.148289 0.0378536
+0.0187266 0.0350257 0.0273865
+0.00460237 0.0388981 -0.00652166
+-0.0775459 0.0688051 0.0117853
+-0.0880987 0.13916 0.0101984
+-0.0871517 0.106348 0.0123653
+-0.0867616 0.0833332 0.0134846
+-0.053009 0.0343093 0.0275811
+-0.0793348 0.0980896 0.0346601
+-0.0751339 0.0669087 0.0157231
+0.0158163 0.0344928 -0.00398192
+-0.0754309 0.0981509 0.0378194
+-0.0695415 0.15615 0.0130838
+0.00196735 0.0370051 -0.0146847
+-0.0711264 0.142566 -0.0097279
+-0.0202009 0.17418 -0.0222934
+-0.0315791 0.125791 0.0170798
+-0.0460989 0.157633 -0.00826241
+-0.0164967 0.0701922 0.0547571
+0.0456793 0.0890097 0.00617442
+-0.0263303 0.0336202 -0.0227625
+0.0458885 0.0778077 0.00419775
+-0.0613708 0.044683 0.0409908
+0.00384566 0.0341227 -0.0209701
+-0.0771455 0.156966 -0.0119003
+0.0355806 0.113279 0.0157103
+-0.036902 0.0362143 0.0131672
+-0.0532397 0.146242 0.0224016
+-0.0474989 0.107059 0.0399589
+-0.0857477 0.109049 0.020349
+-0.0892569 0.122633 0.00330914
+0.054626 0.0562289 -0.00078591
+-0.0161012 0.16832 -0.0147108
+-0.0788763 0.0949177 -0.010577
+0.026592 0.0578126 -0.0217526
+-0.061825 0.164563 -0.0576805
+-0.0210306 0.180146 -0.0147237
+-0.0474984 0.0833402 0.0443799
+-0.0884317 0.131079 0.0440854
+-0.0591643 0.0341749 0.0263998
+0.0381002 0.078079 0.0357853
+-0.0515897 0.146262 0.0154112
+0.0121111 0.116449 0.0370148
+-0.0414388 0.033531 0.00382893
+-0.0200653 0.172726 -0.0151523
+-0.0170332 0.164657 -0.0177746
+-0.0212056 0.0336704 -0.0218021
+-0.0696662 0.0710058 0.0344116
+-0.0516682 0.152149 0.0128837
+-0.0125103 0.0687513 0.0543288
+0.0366353 0.0982561 -0.0107953
+-0.0789343 0.0700266 0.0104198
+-0.0897898 0.136552 0.0342
+-0.0127086 0.0383825 0.00890404
+-0.0624498 0.166273 -0.0455815
+0.0326592 0.0619445 0.0401066
+-0.0457467 0.132003 0.0161756
+-0.0886572 0.111878 0.019323
+-0.0532618 0.0335957 0.00317772
+-0.0164951 0.109966 0.0413377
+0.0543768 0.0731861 0.0106539
+-0.0174802 0.127364 0.0206736
+0.0567172 0.0621967 0.0256596
+0.0464307 0.0792576 0.0101822
+-0.0292965 0.0818454 -0.0346209
+0.0426284 0.0719164 -0.00480026
+0.0578503 0.0648244 0.0238145
+0.0430174 0.0637781 -0.0018983
+-0.0794408 0.0768726 0.0291038
+0.0545285 0.0622324 0.0277996
+0.0441819 0.0945484 0.0191589
+-0.0284244 0.119569 -0.0104891
+-0.0778403 0.10982 0.0432074
+0.0160506 0.0754058 0.0531341
+-0.0523159 0.0517943 0.0256431
+-0.0181754 0.17123 -0.0220272
+-0.049306 0.147765 0.0110054
+-0.0405044 0.166738 0.00354035
+0.0214342 0.0934308 -0.0229317
+0.0452295 0.0931909 0.0101587
+-0.0352058 0.126987 0.0025067
+-0.0177396 0.0642294 -0.0366219
+-0.0251728 0.1712 -0.0194857
+0.0122607 0.0538397 -0.0290819
+-0.0902417 0.133644 0.00722857
+-0.0815914 0.0767239 0.0235201
+-0.0534472 0.146228 0.0234079
+0.0235949 0.0875751 0.0483132
+-0.0647237 0.158466 -0.0128094
+-0.0260145 0.0688342 -0.034504
+-0.0770801 0.15139 0.0355785
+-0.0630768 0.0336712 -0.00794186
+-0.0574971 0.10156 0.0427298
+0.0435266 0.0664036 0.0265247
+-0.0500812 0.146304 0.0115954
+-0.0568525 0.0521385 0.00567837
+-0.0436626 0.0607395 -0.0127771
+-0.0426472 0.117732 -0.0145554
+-0.0805782 0.112389 0.0458728
+-0.0161125 0.127667 0.00290411
+-0.00749701 0.0576432 0.054379
+-0.0454968 0.0775542 0.0422104
+-0.0694956 0.0958583 0.0420894
+-0.0369639 0.0346855 -0.0305537
+-0.0640756 0.151735 -0.033508
+-0.00249095 0.0718247 0.0580407
+-0.0583644 0.065095 0.0331446
+-0.0748917 0.16378 -0.0359985
+-0.0710199 0.0662278 0.0242287
+0.035425 0.0754528 0.0389267
+-0.0547392 0.075379 -0.0185175
+0.0462455 0.0784487 0.0155769
+-0.0310503 0.155166 -0.00836756
+-0.0879532 0.117604 0.0468721
+-0.0630191 0.169374 -0.0476038
+-0.0445267 0.0423569 -0.0163056
+-0.0624997 0.0818785 0.0437679
+-0.0842794 0.115636 -0.000747849
+-0.0700345 0.0631474 0.0200567
+0.0125104 0.105746 0.0436503
+-0.0795696 0.0976882 -0.00856087
+-0.0495247 0.141678 0.0113921
+0.0166382 0.123302 0.0301317
+-0.0367737 0.0813353 -0.0218258
+0.0465043 0.0597504 0.0314309
+-0.0777677 0.0975799 -0.010556
+-0.0460219 0.166062 0.00401182
+0.0609087 0.0623561 0.0101482
+-0.0403969 0.033577 0.00400031
+0.0286533 0.0578113 0.0412965
+0.0447855 0.0917675 0.0181585
+-0.0238167 0.0929782 -0.0327062
+-0.0714891 0.129823 0.0511416
+-0.0235755 0.157761 -0.0033973
+-0.0525761 0.136549 0.0284096
+-0.0177757 0.0756957 -0.0389571
+-0.0184004 0.0383962 0.0258071
+-0.0162165 0.175672 -0.0252165
+-0.0326786 0.0835446 -0.0285522
+-0.0897198 0.135201 0.0382086
+0.0138704 0.12508 0.0305218
+-0.0334383 0.0383149 -0.00250434
+0.0173372 0.059408 -0.0277846
+0.02739 0.119413 -0.00163712
+-0.055795 0.129741 0.0368819
+-0.0124902 0.0560062 0.0517339
+0.00742257 0.034128 0.000278711
+0.0312441 0.0828649 -0.019558
+-0.0804968 0.149757 0.0362335
+0.0224909 0.107012 0.0395338
+-0.0282283 0.117946 -0.012805
+-0.0726553 0.180933 -0.0546755
+-0.0683563 0.134056 0.04686
+-0.0197453 0.163025 -0.0159769
+-0.0591933 0.155725 0.01387
+-0.0522733 0.13577 -0.00153662
+0.0413723 0.0971667 -0.00382246
+-0.0920493 0.125439 0.00826634
+-0.0522301 0.0388364 0.0467813
+0.0151427 0.107227 -0.0182666
+-0.0397192 0.03358 0.00232461
+0.0373971 0.049112 -0.00639066
+-0.0698932 0.120907 -0.00884856
+-0.0667865 0.156181 0.0155153
+-0.0865635 0.0819919 0.0164862
+-0.0276111 0.0476412 -0.0256716
+-0.050104 0.0515366 0.0156131
+-0.0466794 0.0620985 -0.0127944
+-0.0784369 0.170061 -0.0360578
+-0.0714268 0.173765 -0.0397048
+-0.0313808 0.0567165 -0.0143886
+-0.0309651 0.0347631 0.0441412
+0.0067865 0.130497 0.0221788
+-0.0524448 0.149335 0.0194038
+-0.0414976 0.0860064 0.0425981
+-0.0709701 0.155369 -0.0459101
+0.00322675 0.0810659 -0.0345434
+-0.0294909 0.0917678 0.0440939
+-0.0734658 0.151245 -0.0358847
+-0.079509 0.130274 0.0528999
+-0.00249263 0.0534855 0.0544759
+-0.070992 0.0395652 0.00837515
+-0.0868944 0.122556 -0.00173403
+-0.0574179 0.0608499 0.024689
+-0.0424855 0.09447 0.0423231
+-0.00342977 0.0386245 0.00511046
+-0.018769 0.037629 -0.017491
+-0.0527937 0.0869491 -0.0216809
+-0.0846182 0.106299 0.024344
+0.0443742 0.0818795 -0.000800454
+-0.0894613 0.148789 0.0111841
+-0.0867708 0.110409 0.0193573
+-0.0310025 0.176085 -0.0150686
+0.00863383 0.115058 0.0390007
+-0.0408994 0.163853 0.00394115
+-0.057289 0.0707546 0.0390509
+-0.0646832 0.0432745 0.0336962
+0.0205013 0.0892461 0.0486645
+-0.0625318 0.0662874 0.0329584
+-0.0608083 0.147764 -0.00265379
+0.00615212 0.112907 -0.0196236
+-0.0299927 0.0436118 -0.0290457
+-0.0158151 0.162561 -0.00896512
+0.00597686 0.130404 0.00157669
+0.0284244 0.0822003 0.0446831
+0.0211099 0.0605491 0.0480139
+-0.0234016 0.184697 -0.0149423
+0.00333349 0.0390305 -0.00876711
+-0.0635183 0.159851 -0.052592
+-0.0770983 0.150031 -0.00589737
+0.0214723 0.0878669 0.0490265
+-0.0679264 0.131258 0.0474463
+0.00194863 0.100763 -0.0227079
+0.00777681 0.0385776 0.0292039
+-0.022633 0.08929 0.0533197
+-0.00603192 0.127393 0.0291246
+-0.0911594 0.120221 0.0443019
+-0.0894985 0.121276 0.00330358
+-0.0368227 0.0914861 -0.023804
+-0.0530502 0.151987 0.0175947
+-0.0672887 0.121448 0.0519139
+-0.0568311 0.0912579 -0.0217399
+-0.0697681 0.0822532 -0.0170635
+-0.0874076 0.0990828 0.0243308
+-0.0355048 0.108366 0.0378272
+0.0287346 0.10342 0.0381993
+-0.0860991 0.0964962 0.0273389
+0.0321886 0.108821 -0.00928902
+-0.0781375 0.103077 -0.00856917
+-0.0630075 0.0458305 0.00872119
+-0.0737672 0.068042 0.0238437
+-0.0863239 0.111846 0.0325401
+-0.00949559 0.10164 0.0439977
+-0.0902184 0.117255 0.00530427
+-0.075404 0.0914629 0.0394057
+-0.0453927 0.0336614 -0.0191153
+-0.0827835 0.0790493 0.0255103
+-0.0912019 0.132413 0.0272298
+-0.0564798 0.081975 0.044689
+-0.072928 0.148723 -0.0327819
+-0.00163455 0.0466691 -0.0289171
+-0.0665675 0.0355377 -0.00701232
+-0.000953404 0.100702 0.0462281
+-0.00881786 0.169637 -0.0227487
+-0.0201288 0.165284 -0.0176913
+-0.0859703 0.127103 0.0488324
+0.0255102 0.106068 0.0387825
+0.0570523 0.0522954 0.00619533
+-0.0407044 0.0491484 -0.0113833
+-0.0394747 0.168236 0.00277528
+-0.0690053 0.160967 -0.0519594
+0.0161135 0.0534638 0.0477167
+0.0284604 0.079188 -0.0220838
+0.0113708 0.0523816 -0.0287924
+0.0393128 0.0955964 -0.00780286
+-0.020906 0.0387029 0.0322136
+-0.00871553 0.0642094 -0.0357226
+-0.0547883 0.08548 -0.0214211
+-0.0725291 0.0901409 0.0413911
+-0.0566631 0.0629472 -0.00640536
+0.00234532 0.0524899 -0.0301138
+-0.0938956 0.118755 0.0202995
+-0.0414996 0.0846033 0.0426094
+0.00904636 0.090083 -0.0314826
+0.00730102 0.131 0.00524198
+-0.0637681 0.0809918 -0.0188675
+-0.0414945 0.041025 0.0428519
+-0.087002 0.140499 0.00821758
+-0.0709364 0.151841 0.036169
+-0.0634902 0.106988 0.0392647
+-0.0628225 0.0910404 -0.0189489
+-0.0105509 0.165091 -0.0177492
+-0.00157082 0.0341515 -0.0183868
+-0.0378749 0.105661 -0.0201869
+-0.0689412 0.079144 0.0404114
+-0.0239658 0.0335277 -0.0259671
+-0.0732183 0.172207 -0.0490431
+-0.0205007 0.0971766 0.0453281
+-0.0778797 0.109167 0.0401678
+0.000488577 0.0965409 0.0535304
+-0.0172908 0.177187 -0.018141
+0.00409629 0.128905 0.0269756
+0.0212668 0.080528 -0.0265872
+-0.0484872 0.0931824 0.0442201
+-0.0703872 0.161044 -0.0469664
+-0.0556945 0.0334591 0.00641451
+0.043113 0.0972735 0.00118522
+-0.0465526 0.147719 0.00793526
+-0.0620051 0.0336477 0.00854436
+-0.0789484 0.130998 -0.00538086
+-0.0329884 0.0347673 0.0437059
+-0.011676 0.0389222 -0.00979553
+-0.0102112 0.168384 -0.01842
+-0.058489 0.0747585 0.0420339
+0.0115041 0.129313 0.00109395
+-0.0186879 0.0554617 -0.0328673
+-0.0198225 0.168315 -0.0130587
+-0.013087 0.0382629 0.0179922
+0.0130281 0.0916311 -0.029044
+0.0271142 0.0463333 0.0371793
+-0.0618303 0.167813 -0.0535931
+0.0164903 0.113991 0.0376096
+-0.0592845 0.0336203 0.0127024
+-0.0728419 0.0642516 0.016748
+-0.0527116 0.12267 0.0360612
+-0.091424 0.144749 0.0231531
+0.0225812 0.0946281 -0.0221802
+-0.073319 0.153662 0.0322986
+-0.0384844 0.109782 0.036904
+-0.0551177 0.156069 -0.00176933
+-0.0195075 0.0512747 0.046374
+0.0374508 0.109679 0.00217662
+-0.0624744 0.163093 -0.0485882
+-0.0482041 0.0335795 -0.00119996
+0.0115865 0.127977 -0.0019288
+0.00494704 0.131338 0.0186496
+0.00228726 0.131702 0.0133903
+-0.0890002 0.134996 0.00522535
+0.0114372 0.12283 -0.0103617
+-0.0719092 0.180772 -0.055937
+-0.0144633 0.051615 0.0495133
+0.0147782 0.034634 0.0233109
+-0.0647828 0.177875 -0.0546137
+-0.0882908 0.103675 0.012381
+-0.0631313 0.0343469 0.025414
+-0.0255881 0.169753 -0.0108444
+0.0323006 0.0361518 0.00522301
+-0.0682938 0.06404 -0.00150269
+-0.0705485 0.167591 -0.022181
+0.0271973 0.0508207 -0.0197147
+-0.01565 0.10151 -0.0235687
+-0.0233444 0.0380443 0.0215084
+-3.10615e-05 0.0346258 0.0437307
+-0.0391691 0.162354 0.00112683
+-0.0657552 0.0422954 0.0115704
+-0.0745006 0.142795 0.0461595
+0.0473913 0.0422357 0.0119475
+0.0144595 0.121944 0.0333941
+-0.00358089 0.036197 -0.0248262
+0.0394746 0.0459091 0.0309432
+-0.0744487 0.141666 -0.00675172
+-0.0615813 0.0380878 0.0442214
+-0.0393467 0.0392853 0.042122
+-0.0229052 0.0945537 0.0478017
+-0.0281182 0.0563778 -0.0244009
+-0.0325146 0.112544 0.0353443
+0.0114695 0.0949418 0.0507264
+-0.027899 0.0377311 0.0244577
+-0.0247344 0.0668597 -0.034525
+-0.0623338 0.163141 -0.0335899
+0.0341266 0.0993109 -0.0131459
+-0.0130965 0.169821 -0.0173751
+0.0250182 0.11137 0.036342
+-0.0513993 0.14316 0.0173798
+-0.0521465 0.121207 0.0350569
+0.0134264 0.0403382 -0.0227982
+-0.0919004 0.143349 0.0181646
+0.0256492 0.0831048 -0.024123
+-0.0614955 0.0973435 0.04311
+0.0110632 0.0360404 -0.022358
+-0.0702704 0.159573 -0.0469358
+-0.0135146 0.181607 -0.0231689
+0.0462675 0.0778418 0.00718957
+-0.057322 0.0452663 0.0256799
+-0.0473932 0.0337786 -0.0140697
+0.0180643 0.0577618 0.0488361
+-0.0840242 0.151932 0.0065796
+-0.0547337 0.0738545 -0.0174125
+-0.0647273 0.156687 -0.0474505
+-0.0184955 0.0513594 0.0472431
+0.0314014 0.0491212 -0.0073371
+-0.0336406 0.0339783 -0.0207966
+0.0302861 0.0722616 -0.0207987
+-0.0707237 0.135491 0.0487549
+0.0373244 0.0861524 0.0364715
+-0.0839874 0.129456 -0.00327263
+-0.0579656 0.0599816 -0.000771046
+-0.0374903 0.0917378 0.0437278
+-0.0421167 0.157651 -0.00983865
+-0.0774831 0.151439 -0.0048996
+-0.0664918 0.167987 -0.0292876
+-0.0348246 0.12664 0.0173665
+0.0288107 0.113482 -0.00830654
+-0.0939345 0.122834 0.0252963
+-0.0236453 0.0906062 0.0514725
+-0.0623453 0.151603 -0.000787959
+-0.0394885 0.0520168 0.0393574
+-0.0228668 0.103033 -0.0236969
+-0.0205005 0.115412 0.03703
+-0.0206187 0.158806 -0.0102834
+-0.00380864 0.0840797 -0.0375505
+-0.0846424 0.139002 0.00130344
+-0.0244403 0.0384399 0.0299279
+-0.0256136 0.0707601 0.0441795
+0.0431065 0.0733659 -0.00379081
+-0.0334964 0.0575473 0.0382542
+-0.0732341 0.100848 0.0383652
+-0.0417523 0.0392031 -0.0263092
+-0.0600247 0.0335577 0.00903367
+0.0319454 0.0782138 0.0427262
+-0.0478947 0.122501 0.0288841
+-0.0215102 0.0435311 0.0534788
+-0.0175036 0.0357848 -0.0270478
+-0.0659221 0.115196 -0.0104247
+-0.0452512 0.0574076 0.0387158
+-0.0318518 0.100063 -0.022678
+-0.062214 0.131105 0.0398962
+-0.0570307 0.151068 0.0316808
+-0.0390807 0.159219 -0.0117734
+-0.0575439 0.0421232 0.0457366
+-0.0434958 0.166715 0.00391556
+0.0435215 0.0973118 0.0181533
+0.0364745 0.0384289 0.0206775
+0.00783805 0.034796 0.0434029
+0.00550647 0.0519309 0.0530702
+-0.0452904 0.125307 0.0239255
+0.0384949 0.0469555 0.0314897
+-0.0344994 0.0860255 0.0426749
+-0.0604675 0.0334377 0.00185915
+0.00564306 0.109569 0.0416563
+-0.0341393 0.169665 -0.0151103
+0.0252174 0.115733 -0.00872379
+-0.0432318 0.0365168 -0.0263599
+-0.0648058 0.0881399 -0.0188881
+-0.0113055 0.0420913 0.0500945
+-0.0768733 0.0742923 -0.00658087
+-0.0718355 0.0757492 0.0369191
+-0.00552934 0.126815 -0.00649473
+-0.015298 0.113338 -0.0180384
+-0.0658513 0.168603 -0.0333515
+-0.0769239 0.160393 -0.0146649
+-0.0789031 0.0913518 0.0358575
+-0.0622512 0.175627 -0.0566298
+0.0427075 0.100107 0.0161639
+-0.0122664 0.0420539 0.0504523
+-0.0593768 0.116855 0.0386274
+-0.0207916 0.117992 -0.012906
+-0.0209967 0.0893299 0.0545201
+-0.0293388 0.0522666 -0.0213646
+0.042 0.102859 0.00616839
+-0.0915744 0.128321 0.0372423
+-0.0745556 0.104899 0.0367465
+-0.0874341 0.0860792 0.0144694
+-0.0893403 0.0983511 0.0184032
+0.0265834 0.0915781 0.0456097
+0.0111147 0.0359709 0.0304167
+-0.0251149 0.163764 -0.0159045
+0.0379525 0.0888235 0.0356698
+-0.0308593 0.102934 -0.0225503
+-0.0849458 0.0817985 0.00448942
+0.016843 0.101962 -0.021958
+-0.0602648 0.153206 0.0324327
+-0.00109974 0.118227 -0.0153259
+-0.0277867 0.0904111 0.0457123
+-0.0632329 0.149656 -0.0246848
+-0.0378318 0.0943285 -0.0232947
+0.00942926 0.0360304 0.00452751
+0.00308943 0.0346383 -0.0160359
+-0.0629538 0.164686 -0.0335942
+-0.0707579 0.0639499 0.00302292
+-0.0806378 0.0734203 0.0185511
+-0.0114878 0.0502762 0.0503958
+-0.051624 0.0589527 -0.00929309
+-0.0724662 0.156284 0.0178613
+-0.0755506 0.0791122 0.0357048
+-0.0599662 0.0605914 -0.00103222
+-0.0407972 0.128426 0.00338476
+-0.0685036 0.0972643 0.0418698
+0.0384545 0.081427 -0.0137424
+-0.0869304 0.137738 0.00419643
+-0.0915894 0.118845 0.0433559
+-0.0375104 0.0344317 -0.0164034
+0.0132714 0.0779991 -0.0309033
+-0.000460653 0.0717499 0.0573883
+-0.0689415 0.128234 -0.0091158
+-0.00449889 0.0389099 -0.0139692
+-0.00687105 0.104506 -0.0230032
+-0.0625734 0.0333471 -0.00389969
+-0.0466818 0.0680053 -0.0151447
+0.0325669 0.0564098 0.0381516
+-0.00676687 0.0770295 -0.0375725
+0.031043 0.0535582 0.0376713
+-0.0252324 0.0383969 -0.00646059
+-0.0781312 0.100777 0.0347873
+-0.0351912 0.0448435 0.0445858
+-0.0618482 0.0460583 0.00900481
+-0.0510378 0.148698 -0.00295565
+-0.0758068 0.170822 -0.0449998
+0.0228822 0.0407495 0.0397886
+-0.0556881 0.123137 -0.00801327
+0.041209 0.10285 0.0181659
+-0.057716 0.154704 0.0245626
+-0.0356589 0.0394362 0.046602
+-0.018436 0.0384553 -0.00144245
+-0.0725091 0.147853 -0.0287195
+0.0195403 0.0672509 0.0492981
+-0.00949487 0.11143 0.0422271
+0.0387128 0.0407096 0.0245464
+0.0274937 0.0354669 0.00307886
+0.0251817 0.0344441 0.0110044
+-0.0734653 0.11597 0.0519419
+-0.0517405 0.0367791 -0.0118947
+-0.0313584 0.0347088 0.042355
+-0.0271594 0.0577744 0.0376032
+0.0289959 0.083514 0.0437755
+-0.0609886 0.0421383 0.0435161
+-0.0642758 0.0379734 0.0412454
+-0.0669901 0.171097 -0.0394962
+0.00201718 0.0342688 0.0083365
+-0.0376227 0.0519888 -0.0106273
+-0.0604976 0.0761414 0.0420756
+0.0231651 0.0624431 -0.0251426
+-0.0444966 0.100126 0.0423688
+-0.0434704 0.0888362 0.0427012
+-0.0739012 0.112096 -0.00769672
+0.0113285 0.0381477 0.0446991
+0.0606492 0.0595518 0.0111602
+-0.0344028 0.0453249 -0.0266763
+-0.0238559 0.100178 -0.023968
+0.0124979 0.0363631 -0.0219171
+-0.0386629 0.0606634 -0.011982
+-0.0845122 0.0778323 0.0175087
+-0.0447652 0.0811738 -0.019998
+-0.0325802 0.0708663 -0.0234636
+-0.0428489 0.09852 -0.021578
+0.0343638 0.0491351 -0.00656846
+-0.00173319 0.108975 -0.0214067
+-0.0513914 0.0516798 0.0216239
+0.00608628 0.101527 -0.0214717
+-0.0746196 0.147202 -0.0138555
+-0.0464944 0.0733156 0.0418074
+0.0275533 0.0550749 -0.019815
+-0.0617588 0.0455326 -0.00130544
+-0.0627435 0.14749 -0.0135844
+0.0114636 0.0347788 0.020691
+0.0413154 0.0451948 0.0296022
+-0.0855482 0.149965 0.0308161
+0.045359 0.04899 -0.00489955
+0.000884291 0.038993 0.0274224
+-0.086804 0.0846773 0.00948205
+0.00217921 0.090906 -0.033534
+-0.0074916 0.0518487 0.0520774
+-0.000472995 0.0746288 0.0583091
+0.00707409 0.0348007 0.0234037
+0.0191098 0.127253 0.00673134
+-0.00312412 0.123427 0.0346626
+-0.0251492 0.0379137 0.0122303
+-0.030188 0.124116 0.0205603
+-0.0326284 0.178159 -0.00692862
+-0.0371849 0.0430027 -0.0273252
+0.000516139 0.0703294 0.0566091
+-0.061834 0.155291 -0.0275862
+0.0144787 0.103102 0.0461637
+-0.0601666 0.138122 0.0340792
+0.0447845 0.0903596 0.0201575
+-0.0175794 0.128153 0.00899134
+-0.0654784 0.133956 0.0422213
+-0.078379 0.0698242 0.00895098
+-0.0544145 0.0561001 0.0105768
+-0.0166845 0.0625881 0.0524778
+0.0283147 0.0712973 0.0426773
+0.00750546 0.105745 0.0420743
+-0.0365184 0.126747 -0.000928274
+-0.0297912 0.154227 -0.00467156
+0.0242356 0.0804257 -0.0251216
+-0.0507602 0.0797387 -0.0202693
+-0.0399713 0.112687 -0.0172474
+0.0170749 0.128355 0.00741174
+-0.0399375 0.150681 0.00347523
+-0.0608612 0.0435863 0.0137318
+-0.0365883 0.0485443 -0.0138981
+-0.0910601 0.132402 0.0282222
+-0.0795844 0.0759236 -0.00451678
+-0.0809274 0.12805 -0.00535084
+-0.0711513 0.132664 0.0498849
+0.0150413 0.120568 0.0342385
+0.00849911 0.119651 0.036768
+-0.0569109 0.033599 0.014995
+-0.0689033 0.0887623 0.0428815
+-0.020138 0.166773 -0.018707
+-0.0815894 0.0926183 0.0328436
+0.00319943 0.0866473 -0.0337836
+-0.0528475 0.140082 0.0254195
+0.0217844 0.118301 -0.00950952
+-0.0305318 0.0734349 -0.0315361
+-0.0355385 0.040818 0.0464546
+-0.0446309 0.0563208 -0.0114385
+-0.0779756 0.13395 -0.00568102
+-0.0924453 0.114684 0.0163206
+-0.0427865 0.0855262 -0.0214717
+-0.030041 0.0819074 -0.0335886
+-0.0350329 0.037518 0.0477355
+-0.0574727 0.0791252 0.0438951
+-0.0347822 0.124221 0.0233214
+0.0396853 0.0674479 -0.00978879
+-0.0280887 0.123076 -0.00418723
+-0.0357494 0.0383801 -0.010405
+-0.0896534 0.0983503 0.0154045
+-0.0393744 0.174134 -0.00504658
+-0.00548988 0.121033 0.0366102
+-0.0493281 0.143211 0.0074004
+-0.0618749 0.161566 -0.0365945
+-0.00486561 0.103096 -0.0233724
+-0.0158939 0.0387206 -0.00487532
+-0.0136298 0.0943834 -0.0340901
+-0.0708677 0.158014 -0.00345716
+-0.0679292 0.0674285 0.0308631
+-0.0698001 0.0894083 -0.0167108
+-0.0708742 0.117963 -0.00822963
+0.0544559 0.0679536 0.0254119
+0.0505447 0.0640078 -0.00213219
+-0.0328813 0.11004 -0.0184872
+-0.0329481 0.169751 -0.00390259
+-0.0730465 0.158091 -0.00419381
+-0.0642284 0.165303 -0.0599757
+-0.0393381 0.149359 -0.00118821
+0.027659 0.115893 0.031317
+0.00307915 0.03925 0.0330573
+-0.0268824 0.0338882 -0.0212482
+-0.076206 0.0892711 -0.0135327
+0.036558 0.0887304 -0.0159156
+-0.045503 0.0478046 0.0396725
+-0.00457894 0.0383459 0.0160278
+-0.014359 0.102532 0.0433738
+-0.0263218 0.038308 -0.00105771
+-0.0252694 0.0564528 0.0400125
+-0.0745038 0.137269 0.049596
+-0.0478639 0.102799 -0.0211716
+-0.0698236 0.144589 -0.0179026
+-0.00449355 0.112805 0.041803
+0.0395793 0.107012 0.0171684
+0.0320331 0.117177 0.0215305
+0.0319133 0.103439 0.0357737
+-0.0232571 0.160328 -0.0132723
+-0.0368559 0.101427 -0.0217814
+-0.0779001 0.105799 -0.00757653
+-0.0719733 0.155857 0.00930845
+-0.0667659 0.0664754 0.0301739
+-0.0116086 0.0384341 0.0253641
+-0.0828253 0.0815398 -0.00255091
+-0.00864403 0.0481881 -0.0304747
+-0.0695881 0.0687436 -0.00572614
+-0.053703 0.069339 -0.0141095
+-0.0875622 0.147255 0.0314849
+-0.060703 0.146825 0.0369155
+0.0559661 0.0563559 0.00119345
+-0.0899141 0.140577 0.0142032
+0.0290556 0.0480892 -0.0107335
+-0.0444676 0.0959215 0.0428438
+-0.0126944 0.0614008 -0.0362648
+-0.00712049 0.126279 0.0302479
+0.00717458 0.125139 0.032446
+0.0130051 0.123122 0.0330958
+-0.0658939 0.119442 -0.00885604
+-0.0535827 0.0550746 0.0114399
+0.00820634 0.0865719 -0.0325157
+-0.0358588 0.100033 -0.0223224
+-0.0816885 0.110103 -0.000571623
+-0.0517049 0.0693137 -0.014154
+-0.0304078 0.0499703 0.0425042
+0.0090211 0.0602846 0.0533569
+-0.0102692 0.126825 -0.00441849
+-0.0412575 0.123881 0.0239565
+-0.0304041 0.179805 -0.0103906
+-0.0119972 0.115638 -0.0165051
+0.0413233 0.102851 0.0171643
+-0.032272 0.0343596 0.0389523
+-0.0854712 0.0791996 0.00951147
+-0.0138083 0.082755 -0.0391488
+-0.0256473 0.0335939 -0.0244827
+0.0452831 0.0511563 0.0319003
+-0.0829803 0.153189 0.00837374
+-0.0435404 0.0351992 0.0428237
+0.0114184 0.0389206 -0.0228692
+0.0440394 0.0405103 0.0110966
+-0.0218345 0.0725147 0.0516294
+0.0173744 0.124995 0.027504
+-0.0771042 0.163136 -0.0202013
+0.0282746 0.0494546 -0.0167442
+-0.0703245 0.0805604 0.0403227
+-0.0558701 0.154311 0.0223113
+-0.0790495 0.0785612 -0.00658771
+0.0023439 0.122378 0.0350184
+-0.0220309 0.0609111 0.0451603
+-0.0853195 0.117662 0.0484974
+-0.0580048 0.0366442 0.0464062
+-0.00844255 0.0358982 -0.0250895
+0.0243113 0.119024 -0.0062727
+-0.0558892 0.141955 -0.00229647
+-0.0642262 0.115635 0.0441038
+-0.0719279 0.153998 -0.0419035
+0.0423481 0.0732982 -0.00579253
+0.0103113 0.0595614 -0.0298764
+-0.0818376 0.116236 -0.00283916
+0.0590795 0.0663557 0.00613696
+-0.039497 0.0436994 0.0413132
+-0.0702982 0.0846763 0.0415948
+-0.0167436 0.068615 -0.0382083
+-0.0690033 0.127063 0.0512206
+-0.0485018 0.102883 0.0409949
+-0.0541716 0.144673 0.0274046
+0.0243198 0.0564051 0.0438207
+-0.0308589 0.0382072 0.0517831
+-0.00548321 0.119649 0.0378412
+-0.0606463 0.0434636 0.0431332
+-0.008712 0.171156 -0.0257232
+-0.0444845 0.0846726 0.04342
+-0.0897848 0.135174 0.0342114
+-0.00690926 0.0349718 0.0473534
+-0.0808786 0.122166 -0.00503067
+-0.0779103 0.070378 0.00551561
+0.0134856 0.129689 0.00607818
+-0.0225837 0.0666453 0.0469216
+-0.0525012 0.046573 0.0420391
+-0.0444858 0.091688 0.0430295
+-0.0394965 0.0662956 0.0417788
+0.00897384 0.0364118 0.0277765
+-0.0782046 0.166684 -0.029962
+0.0192461 0.0777761 -0.0276631
+-0.0483417 0.137106 0.010396
+0.0258883 0.12226 0.00355652
+0.0398565 0.0384519 0.0122163
+-0.0408758 0.107069 -0.0201235
+-0.0315055 0.0689302 0.0397623
+-0.068912 0.148468 -0.034342
+-0.0496681 0.0705507 0.0391462
+0.00414266 0.131018 0.00407154
+0.0204354 0.100784 0.0455262
+-0.0587133 0.0708136 -0.0155469
+-0.00369415 0.0386815 0.0249596
+-0.0546088 0.0601814 -0.0071333
+0.0277597 0.0984362 -0.0181936
+0.00136992 0.128685 0.0274437
+-0.0166951 0.0555255 -0.0336624
+0.0054852 0.109984 0.0416767
+-0.079955 0.130987 -0.00485489
+-0.00265109 0.0497012 -0.030809
+-0.0697849 0.145343 0.0431021
+-0.0903934 0.12698 0.0433203
+-0.0409656 0.122163 0.0270528
+-0.056363 0.13673 0.0325483
+-0.00422605 0.0355815 -0.0164762
+-0.0158888 0.123338 -0.00654807
+0.0233356 0.0389315 -0.00470356
+-0.0377622 0.0797629 -0.0199128
+-0.0274204 0.12046 -0.00942796
+-0.0745042 0.0669844 0.00328572
+-0.0544992 0.0400332 0.0469658
+-0.022854 0.100181 -0.0240549
+-0.0748342 0.156367 -0.00257451
+0.00532997 0.0389553 -0.00830106
+-0.0591545 0.129731 0.0390508
+-0.0365933 0.117132 -0.0139142
+0.00710349 0.126169 0.0309735
+0.00420316 0.0838546 -0.0341295
+0.0424932 0.0541962 0.0323753
+-0.0447782 0.039524 -0.0212903
+0.0130456 0.0946785 -0.0262358
+0.0515873 0.047616 0.00226708
+-0.0226971 0.059684 -0.0328522
+-0.0489531 0.117804 -0.0145786
+-0.00521852 0.130779 0.0091953
+-0.0745798 0.155493 -0.021916
+-0.0211637 0.171222 -0.0207379
+-0.0681899 0.15036 -0.0415571
+-0.0645431 0.0356401 -0.00785526
+0.0444401 0.0776895 -0.00177282
+0.0191352 0.0356125 -0.00767677
+-0.0879901 0.0928029 0.00642738
+-0.0274823 0.0617236 0.037721
+0.0406194 0.104193 0.00117617
+-0.0205806 0.0342261 -0.0203167
+0.052283 0.0559902 -0.003254
+-0.0826845 0.0884898 0.0312484
+-0.0354914 0.0719062 0.0418497
+0.00222867 0.0810902 -0.0349213
+-0.0247631 0.123128 0.0239793
+0.00210157 0.111597 -0.0202587
+-0.029962 0.122606 -0.0056563
+-0.0642809 0.173904 -0.0612545
+0.0164873 0.128764 0.0128859
+-0.0290915 0.0334798 -0.0269263
+0.0563251 0.0686891 0.0234174
+0.0388229 0.0428364 0.0281231
+-0.0364553 0.171237 0.000642707
+-0.0695352 0.0422413 0.00168563
+0.0115865 0.119151 -0.014401
+-0.0445078 0.128204 0.0197407
+-0.0735439 0.101276 0.0379813
+-0.0842997 0.131249 0.0498733
+-0.0456134 0.0424471 -0.0132755
+0.00124079 0.0740793 -0.0353703
+-0.0590284 0.155612 0.0197248
+0.00626131 0.0696979 -0.0331897
+-0.0465413 0.123419 -0.0104793
+-0.0145087 0.0587885 0.0518852
+-0.0412993 0.127471 0.0164976
+-0.0621264 0.0457845 0.0326787
+0.00861617 0.0348422 -0.0132521
+-0.0699384 0.129684 -0.00901632
+-0.0174184 0.0961382 -0.0299203
+-0.0408477 0.0999502 -0.0215042
+-0.0629342 0.109643 -0.0151294
+-0.0588992 0.0593658 0.0203903
+-0.0622614 0.0594461 0.0178467
+0.0503092 0.0575099 -0.00459296
+0.0328071 0.0781213 -0.0187889
+0.0297936 0.0354746 0.0165125
+-0.0592597 0.0343664 0.034953
+-0.0736653 0.0761112 -0.0107553
+0.0358581 0.0686798 0.0377462
+-0.0814983 0.102013 0.0310531
+0.0072631 0.0968089 -0.0265119
+-0.0107695 0.0756601 -0.0381615
+-0.0665448 0.142647 -0.010737
+-0.0861837 0.0868588 0.0248974
+-0.0323987 0.114036 -0.016697
+-0.0526124 0.143167 0.0204083
+-0.00749979 0.118315 0.0383098
+-0.0366574 0.0591917 -0.011518
+-0.0854765 0.145991 0.0364919
+-0.0590102 0.131118 -0.0069845
+0.0099878 0.0342067 -0.0142754
+0.0406313 0.0833746 0.032449
+-0.0377389 0.0753784 -0.0182557
+-0.0265179 0.111211 0.0374625
+-0.0457781 0.109842 -0.0182449
+0.0106021 0.12463 0.0322012
+-0.0714609 0.172223 -0.0354286
+-0.0918002 0.143353 0.0191654
+0.009256 0.0681484 -0.0312392
+0.00426025 0.0352382 0.0224392
+-0.0497576 0.0782604 -0.019072
+-0.0628575 0.0953598 -0.0185102
+0.0594691 0.0677866 0.0081304
+0.0120479 0.124912 -0.00663019
+-0.0896003 0.111903 0.0133388
+-0.000572916 0.131478 0.0109076
+-0.0856485 0.103181 0.0252723
+-0.0825849 0.0762413 0.018536
+0.0357614 0.089262 -0.0164786
+-0.0853874 0.0978708 0.0280062
+-0.0250231 0.0373676 -0.0184933
+-0.0224668 0.0384735 -0.00782567
+-0.0215612 0.127036 0.0148264
+0.0375018 0.0527008 0.0316063
+0.0132903 0.0644915 0.0525417
+0.021025 0.0444507 -0.0197096
+-0.0230202 0.0380885 0.0125034
+-0.0190143 0.123258 -0.00649836
+-0.0634892 0.101502 0.0420523
+-0.0022961 0.120938 -0.0122094
+-0.0682754 0.155222 0.00480981
+-0.0105391 0.0444694 0.0492224
+-0.0314884 0.0988001 0.0440684
+-0.0162822 0.113495 -0.0182068
+0.0427502 0.0832247 0.0284671
+-0.0317184 0.124145 0.0214762
+-0.0228243 0.0868132 -0.0375213
+0.0112412 0.122679 0.0339481
+-0.0624726 0.093208 0.0448109
+-0.0195149 0.0474114 0.0506124
+-0.0305029 0.105682 0.0404793
+0.0297926 0.0510441 -0.0147439
+-0.0660587 0.0336733 0.00769062
+0.01375 0.126078 -0.00389468
+0.00623348 0.0768314 -0.0342539
+0.00723812 0.0725784 -0.0338132
+-0.0345032 0.0747169 0.0417978
+-0.0533429 0.0572662 -0.00744815
+-0.0588626 0.0344147 0.0367317
+-0.0597544 0.151092 0.0347772
+-0.066041 0.156288 0.0201296
+-0.0519452 0.0542248 0.0130044
+-0.0536545 0.154299 0.0129697
+-0.0553709 0.131821 -0.00535733
+-0.0165812 0.0355875 -0.0267111
+-0.0671293 0.149176 -0.0346332
+0.0364911 0.112064 0.0146153
+-0.0678122 0.0908837 -0.0169858
+-0.0433492 0.123979 0.0232099
+0.0233446 0.0489622 -0.0213372
+-0.0401353 0.162183 -0.0119788
+-0.0436993 0.0680874 -0.0160622
+-0.0575 0.0589785 0.0215704
+0.002504 0.0605716 0.0560843
+-0.0230753 0.078299 0.0540943
+-0.0532839 0.150877 0.0224035
+-0.0536299 0.144677 0.0243972
+0.0138044 0.129402 0.00474998
+0.0390959 0.0382591 0.0140545
+-0.0935248 0.128245 0.016248
+-0.017174 0.169749 -0.0215263
+-0.00210217 0.035143 0.0464295
+0.00913637 0.105871 -0.0204027
+-0.0861865 0.0926674 0.00242789
+-0.0615271 0.0344278 0.0378839
+0.0506397 0.0652197 -0.00133714
+-0.0859779 0.129848 0.0487451
+-0.0269007 0.0388242 0.0362546
+0.0349035 0.0987755 -0.0125611
+-0.0895593 0.13929 0.0311867
+0.0210026 0.126515 0.0102791
+0.0155029 0.119565 0.0348769
+-0.0660877 0.178333 -0.0536421
+-0.0134986 0.0911752 0.0564813
+-0.0462738 0.0671086 0.039469
+-0.0691002 0.0421453 0.000699576
+0.0106377 0.0658124 0.0539651
+-0.0372457 0.0381548 -0.00680953
+-0.0415057 0.0396254 0.0430594
+-0.0658022 0.0335619 0.00426403
+-0.0549779 0.135599 -0.00339213
+-0.0654711 0.157635 -0.0545345
+-0.0699145 0.135483 0.0481625
+-0.0647392 0.157599 -0.0538703
+-0.0405119 0.125571 0.0212459
+-0.0408461 0.0957242 -0.0225993
+-0.0211708 0.123144 -0.00636628
+0.0528302 0.048039 0.0216552
+0.0292509 0.119574 0.0033793
+0.0456488 0.0861985 0.00518381
+-0.0697746 0.169428 -0.052035
+-0.0583932 0.146765 0.0331817
+-0.0748301 0.174171 -0.0395847
+0.0397534 0.0685495 0.0327941
+0.0603506 0.0581587 0.0121666
+-0.0615125 0.0729203 0.0397926
+0.0320567 0.106099 0.0342281
+0.0259569 0.0632491 0.0444844
+-0.017781 0.12071 -0.00976707
+-0.00292868 0.129815 0.0244395
+0.042563 0.0650705 0.0275619
+0.051394 0.0726569 0.00804397
+-0.0147356 0.124887 0.0290085
+0.0124993 0.116805 0.0367613
+-0.0095857 0.128017 -0.00170998
+-0.0353912 0.0475494 -0.0206462
+-0.0197639 0.0714243 -0.0385337
+-0.0646745 0.0721957 -0.0143162
+-0.0418918 0.129001 0.00740866
+-0.0217734 0.0713925 -0.0382795
+-0.0493632 0.1301 -0.00139208
+0.0232238 0.0822541 0.0494986
+0.0449291 0.081953 0.02316
+0.0595997 0.0567108 0.0101713
+-0.0496185 0.140151 0.0144011
+-0.0524988 0.102874 0.0411998
+0.0342709 0.0876121 0.0408726
+-0.0295799 0.174217 -0.00600797
+-0.0251232 0.165382 -0.00841584
+0.0176002 0.124344 -0.00401113
+0.054323 0.064171 -0.000208879
+-0.0129906 0.0568055 0.0517595
+-0.0751884 0.153035 0.033144
+0.0124885 0.114028 0.0382457
+0.0104651 0.0444795 0.0447526
+-0.033472 0.124985 -0.00213286
+-0.0519318 0.0352921 -0.0124585
+-0.0621937 0.156854 -0.0175927
+-0.0755066 0.11755 0.0524265
+-0.0660809 0.135405 0.0431027
+0.0020291 0.0342762 0.0137843
+0.0320171 0.111398 0.0306261
+-0.0685791 0.147786 -0.0311476
+0.0139278 0.129741 0.0148027
+-0.075709 0.170829 -0.032719
+-0.0241819 0.175647 -0.0202251
+-0.0729646 0.147133 -0.0208616
+-0.0588824 0.0997395 -0.0190365
+-0.0396703 0.036174 -0.00733977
+-0.0195581 0.181635 -0.0160858
+-0.0449923 0.0381195 -0.0222607
+-0.0298707 0.101527 -0.0228594
+-0.0447239 0.169659 -0.000473292
+-0.0547075 0.153861 0.0184094
+-0.00344803 0.111769 -0.0204187
+-0.048864 0.162635 -0.0057974
+-0.0837218 0.154141 0.0154269
+-0.0709606 0.172226 -0.0520527
+-0.000498029 0.0505184 0.0529377
+-0.0916834 0.116094 0.0407438
+0.029535 0.0987313 -0.0165204
+-0.0649388 0.16711 -0.0315896
+-0.00669968 0.0599043 -0.0346663
+-0.0086066 0.042026 -0.0258639
+0.0380982 0.0589726 0.0320786
+0.0284966 0.0768217 0.0447581
+-0.0365356 0.155076 0.00317988
+0.0173692 0.0476632 -0.0235115
+0.0152466 0.0765161 -0.0298116
+-0.061679 0.175513 -0.061381
+-0.03626 0.0434916 0.0442696
+0.0033481 0.0346494 0.040814
+-0.0708559 0.177779 -0.0481346
+-0.0522853 0.153955 0.0120432
+-0.00577511 0.0770351 -0.037534
+-0.0279795 0.0577645 -0.0254
+-0.0474968 0.101477 0.0417865
+0.0418115 0.0872841 -0.00879032
+-0.0272728 0.0383881 -0.00686007
+-0.0828517 0.110648 0.028886
+-0.0677301 0.181168 -0.057983
+-0.0339959 0.0752105 -0.0234884
+0.0227878 0.0350417 0.0227582
+-0.0132511 0.177151 -0.0280569
+-0.0662758 0.159515 -0.0565111
+-0.0759663 0.179251 -0.0520449
+0.0494532 0.0710682 0.00472592
+-0.0158055 0.0931896 -0.0348885
+0.0506418 0.0475027 0.0012667
+-0.0220809 0.0348313 0.0494485
+-0.0681005 0.179488 -0.0529195
+-0.0457387 0.0767861 -0.0183415
+-0.0849611 0.0883696 0.0278927
+0.0410895 0.0670315 0.0294468
+0.0123862 0.0342845 -0.0119874
+-0.0861176 0.152173 0.0250218
+0.00146529 0.0341167 -0.0177588
+-0.0847663 0.132585 0.0488829
+0.041918 0.0732584 -0.00676718
+-0.0704834 0.174975 -0.0436743
+0.0101806 0.114501 -0.0173735
+-0.0274005 0.0647434 -0.0304718
+0.00306398 0.0374048 0.023868
+-0.0908043 0.122683 0.00627651
+-0.0126271 0.0337462 -0.0239473
+0.0294467 0.0623083 -0.0198501
+-0.031353 0.158667 -0.0125849
+-0.0600161 0.129661 -0.00742185
+0.0141451 0.0740257 0.0538731
+0.0348792 0.0378052 0.00236551
+-0.0223477 0.16248 -0.006155
+0.0184989 0.11258 0.037522
+-0.0107925 0.18028 -0.0267448
+0.0112772 0.0752122 -0.0313695
+-0.0481785 0.0341964 0.00728185
+-0.0564997 0.107064 0.0398466
+-0.0510086 0.119975 -0.0128249
+-0.0142596 0.175663 -0.0267921
+-0.028881 0.124884 0.00195054
+-0.0744184 0.069256 0.0261761
+-0.0527672 0.0812315 -0.0212685
+0.0424296 0.0696684 0.0278335
+-0.0272214 0.163934 -0.00616346
+0.0566888 0.0635446 0.0256358
+0.0446243 0.0959671 0.00617079
+-0.0160443 0.174209 -0.0181164
+-0.0310058 0.156198 -0.0100049
+-0.039513 0.166742 0.00312951
+-0.0651923 0.176525 -0.0608469
+-0.0649089 0.110873 0.0375872
+-0.0545067 0.0904158 0.0449797
+0.0328041 0.0682575 -0.0177764
+0.0296649 0.110072 0.0343033
+-0.00848516 0.121007 0.0363393
+-0.0284943 0.0674472 0.03888
+0.0207654 0.126697 0.0144664
+-0.0231479 0.0919482 0.0509374
+-0.0105985 0.0406145 -0.0262787
+0.0525369 0.0651172 0.0279377
+-0.0709498 0.165209 -0.0469921
+0.0101258 0.125306 -0.00703851
+-0.0198334 0.107697 -0.0220521
+0.0228667 0.107306 -0.0156684
+0.0410305 0.0422896 -0.000687891
+-0.0687631 0.080836 -0.0170666
+-0.0685062 0.142066 -0.00982847
+-0.0288706 0.171229 -0.00855169
+-0.0870246 0.129415 0.000309032
+-0.0367401 0.0754253 -0.0187666
+-0.0231137 0.159172 -0.011899
+-0.0445 0.113887 0.0346508
+-0.0617979 0.154608 0.0289232
+0.0322191 0.117688 0.00875184
+0.00258681 0.125467 0.0322572
+-0.0668846 0.117985 -0.00889164
+-0.0560239 0.144237 -0.00161522
+-0.0939473 0.122782 0.0142819
+-0.057663 0.155278 0.0187721
+-0.0653495 0.0459059 0.00467835
+-0.0838817 0.150077 0.00420446
+-0.0574972 0.100168 0.0430053
+0.0447715 0.070791 0.0233171
+0.0114258 0.129163 0.0238841
+-0.0415072 0.0605699 0.0406995
+-0.0495023 0.0862453 0.0455995
+-0.0309567 0.166794 -0.00630909
+-0.0310964 0.125815 0.0157855
+0.0577493 0.0579199 0.00320063
+-0.00748502 0.105882 0.0440003
+-0.0594987 0.0932573 0.0451741
+-0.0584823 0.080492 0.0436889
+0.0565518 0.0722252 0.0100192
+-0.0154726 0.123613 0.0307813
+-0.017794 0.0799068 -0.038901
+-0.0670193 0.0901061 0.04379
+-0.0506534 0.0619401 -0.0109597
+-0.0284985 0.0631152 0.0376198
+0.0405765 0.0793262 0.0323176
+0.0350622 0.0909926 -0.0162992
+-0.0679473 0.136882 0.0457212
+-0.0626008 0.160001 -0.0205855
+0.0143086 0.0623633 -0.0295361
+0.00349883 0.0605728 0.0559342
+0.0235231 0.0943993 -0.0219282
+0.0425314 0.0623712 0.0287546
+-0.0352518 0.156597 0.00331287
+-0.0807586 0.0950245 -0.00854945
+-0.085825 0.114595 0.0464925
+0.0420636 0.0915328 -0.00679501
+-0.0369296 0.0455099 -0.0248207
+-0.0610521 0.0460525 0.00962048
+-0.0476199 0.057734 -0.011287
+-0.0595357 0.0400627 -0.00844467
+-0.0604419 0.114971 -0.0134731
+-0.016194 0.128088 0.0051496
+-0.0365847 0.122192 -0.00920846
+-0.0464591 0.0345029 0.0305523
+-0.0644598 0.0432795 0.035714
+-0.0241405 0.168248 -0.0186857
+-0.0743787 0.145821 -0.0108474
+0.0173308 0.0566344 -0.0283721
+-0.0548894 0.136747 0.0311423
+-0.0579822 0.0343384 0.0317603
+-0.0262958 0.0634474 0.0394208
+-0.0183558 0.127798 0.00725695
+-0.0750251 0.152273 0.0347437
+-0.0648702 0.0334576 -0.000853911
+-0.0610584 0.138406 -0.00654552
+0.0224766 0.0920198 0.0478397
+0.044722 0.0945895 0.0131657
+-0.0873336 0.126682 -0.000726608
+-0.0880434 0.125329 0.00027907
+-0.0364509 0.174337 -0.00256774
+-0.053938 0.138144 0.0289679
+-0.00559979 0.114688 -0.0175182
+-0.00635915 0.0931082 -0.0347376
+-0.0861558 0.100815 0.00240792
+0.0184724 0.0934238 0.0476306
+-0.000245612 0.0350857 0.0144067
+-0.0547132 0.153591 0.0213081
+0.0445999 0.0931357 0.00219092
+-0.0649995 0.134056 -0.00807462
+-0.0360819 0.0351453 0.0214963
+0.0444988 0.0569914 0.0320977
+-0.0597101 0.0723346 -0.0163812
+-0.0468406 0.0985145 -0.021833
+-0.0397006 0.0666136 -0.0148744
+-0.0847301 0.0966436 -0.00257686
+-0.00176079 0.0741065 -0.0358743
+-0.0671962 0.0736816 0.0379285
+-0.0347085 0.169768 -0.00115359
+-0.0213445 0.0916844 -0.035421
+-0.0625559 0.150623 -0.0205762
+0.055585 0.0535517 0.00220948
+-0.0136228 0.128915 0.00609854
+-0.0654189 0.16417 -0.0217177
+-0.0613445 0.0434338 0.042412
+-0.0144732 0.096429 0.0522087
+-0.0707666 0.171245 -0.0323024
+-0.0713393 0.134067 0.0496215
+-0.0458732 0.104238 -0.0208285
+-0.0551833 0.07213 0.0401196
+0.0364832 0.0422343 0.0281778
+-0.0336503 0.0577563 -0.0112696
+-0.0810791 0.117571 0.0486733
+0.044724 0.0588042 -0.00496063
+-0.0568258 0.120959 -0.0097287
+-0.0257724 0.0797722 -0.0374309
+-0.0800654 0.121688 0.0502425
+-0.0569634 0.0335771 0.00964709
+-0.00939357 0.0354504 -0.0173725
+0.046214 0.0637709 -0.0019104
+0.00900714 0.0383394 0.0314785
+0.0457806 0.0890199 0.00717609
+-0.0524951 0.0747684 0.0423102
+0.0334058 0.0446363 -0.00548551
+-0.063072 0.0346346 0.0391063
+0.0073001 0.0907939 -0.0322622
+0.026147 0.0875952 0.0467145
+0.0130004 0.0419341 0.0448362
+0.0263999 0.0348437 0.0163952
+-0.0056357 0.0466988 -0.0297075
+-0.000747471 0.0987058 -0.0265343
+-0.0688283 0.0966095 -0.0161149
+0.00300687 0.0991424 0.049182
+-0.0154864 0.0814755 0.0571167
+-0.074497 0.120396 0.0533632
+-0.0748436 0.114924 -0.0060803
+-0.0168418 0.107354 -0.0217003
+-0.0459377 0.145792 0.000601046
+-0.0487849 0.0715634 0.0402545
+-0.0581679 0.154986 0.022946
+0.044397 0.0945546 0.0171571
+-0.0810292 0.0940061 0.0336494
+0.032953 0.0994589 0.0373001
+-0.0181454 0.0347978 0.0451006
+-0.0487902 0.0855221 -0.0217064
+-0.0776336 0.147268 -0.0038625
+-0.0891133 0.14743 0.0101992
+0.0134061 0.0767276 0.0545687
+-0.0451757 0.14769 0.00639824
+0.0340849 0.114614 0.00225198
+-0.0494981 0.105619 0.0396922
+-0.0291786 0.175627 -0.0167894
+0.0516271 0.0736236 0.0155669
+-0.0333156 0.0365169 -0.0174853
+-0.00225297 0.0388793 -0.00041461
+-0.0884617 0.14585 0.0310303
+-0.087958 0.12395 0.000268768
+-0.0637456 0.154158 0.00252195
+-0.0680618 0.0606588 0.013756
+0.00946449 0.0616923 0.0540126
+-0.00707285 0.12974 0.0027455
+-0.0190315 0.0389958 0.035931
+-0.00971778 0.0670387 -0.0360005
+0.0406669 0.102735 -0.000789188
+-0.085128 0.0845897 0.0244984
+0.00248558 0.111415 0.0422707
+0.00320889 0.0824712 -0.0345101
+-0.0467495 0.117966 -0.0147678
+0.0250223 0.110364 -0.0129553
+-0.044347 0.146755 0.000226372
+-0.0616655 0.144455 -0.00523057
+0.000474346 0.0977989 0.0522897
+0.0207702 0.036271 0.0339301
+0.0400498 0.0387801 0.0063192
+-0.0199993 0.185902 -0.0200623
+0.018427 0.0917703 -0.0251723
+-0.0354635 0.0860418 0.0431394
+-0.0475855 0.0518372 -0.00929506
+0.0429858 0.0691484 -0.00178958
+-0.0244489 0.052187 0.0413714
+-0.0500639 0.141673 0.0143962
+0.0144323 0.129298 0.0192627
+-0.0561449 0.04824 0.0383427
+0.0358665 0.0404526 0.0260172
+-0.0213253 0.0444675 0.0531428
+-0.0609289 0.112535 -0.0147528
+-0.0699845 0.139935 -0.00772138
+-0.0748631 0.106362 -0.00967707
+-0.0346028 0.0344648 0.0366099
+-0.0425153 0.118993 -0.0138741
+0.0153464 0.0537553 -0.0279934
+-0.0719831 0.170733 -0.0298702
+0.0460203 0.0848226 0.00718276
+-0.0760167 0.15688 -0.0219252
+-0.010059 0.109235 -0.0217082
+0.0010095 0.0346721 0.0439005
+-0.0198215 0.0841085 -0.0387066
+-0.020574 0.115387 -0.0161841
+-0.00203672 0.0345877 -0.0169988
+-0.0424883 0.0846004 0.0426298
+-0.0313435 0.0707327 -0.0274782
+-0.0490828 0.13552 0.0213898
+-0.0481015 0.157608 -0.00698963
+-0.0579692 0.0408152 0.0462221
+-0.0682257 0.127075 0.0505767
+-0.0434944 0.0733818 0.0425428
+-0.0905017 0.114314 0.0223543
+0.0242723 0.0647548 -0.0237835
+0.050682 0.0731977 0.010749
+0.0604945 0.0595549 0.015166
+-0.0490636 0.126668 -0.00583208
+0.00647697 0.0459611 0.0484012
+0.0279051 0.0395203 0.0288639
+-0.0314585 0.0335695 -0.0237257
+-0.0485262 0.0344313 0.0301756
+-0.0386172 0.0505956 -0.0110053
+-0.000657388 0.0511382 -0.0308268
+-0.0630072 0.0689485 0.0358468
+0.0316541 0.0351286 0.0116939
+-0.0517065 0.163863 0.00241874
+-0.0634695 0.0445577 0.0356919
+-0.0832566 0.147367 0.0370632
+0.02323 0.0762417 -0.0259573
+-0.0735922 0.0833012 0.0392631
+-0.00431736 0.130694 0.00665461
+-0.021599 0.0382532 0.00358087
+0.0465019 0.0778624 0.0111839
+0.0604451 0.0678689 0.0141533
+0.0213931 0.0489728 -0.0223035
+-0.0630692 0.153725 -0.0105955
+-0.0236572 0.0507797 -0.028024
+0.00430293 0.0625774 -0.0325544
+0.0421362 0.0845969 0.0293292
+0.010951 0.0562864 0.05258
+0.0369412 0.107321 0.0271722
+0.0502975 0.0560957 -0.00457555
+0.0410804 0.10284 0.0191681
+0.0102664 0.0739304 0.0552835
+-0.0397448 0.172952 -0.00234724
+-0.0829232 0.125068 -0.00442148
+-0.0284893 0.0903534 -0.0305816
+-0.0616586 0.172539 -0.056588
+0.0182369 0.0749953 -0.0283712
+-0.0168303 0.0382802 0.00815469
+0.0453551 0.0805854 0.0221747
+-0.0718567 0.0701514 0.0311867
+-0.0814119 0.152728 0.0295837
+0.0555021 0.0730293 0.0140468
+0.00650419 0.123782 0.0339598
+0.0422452 0.0986357 -0.000817871
+-0.072904 0.112135 -0.00834183
+-0.00786498 0.13001 0.00533674
+-0.0614753 0.15686 -0.0265876
+-0.0234913 0.103006 0.0434545
+-0.0093342 0.174192 -0.0247468
+0.048187 0.0717514 0.00605259
+-0.0554773 0.0820103 0.045038
+-0.091005 0.124034 0.00628346
+-0.0147917 0.0951887 -0.0329173
+-0.00125147 0.122854 0.0353
+-0.017497 0.0485942 0.047882
+0.0194854 0.0989751 0.0466096
+-0.0889579 0.0901579 0.00845534
+-0.065396 0.0605193 0.0180241
+-0.0469507 0.168415 -0.00396135
+0.0205156 0.111203 0.0377036
+-0.0928924 0.122885 0.0362699
+0.0213879 0.0686569 0.0484685
+0.0214143 0.0463213 0.0412437
+0.00882931 0.0373958 0.0286749
+0.0465562 0.0764652 0.0121829
+-0.0618529 0.153757 -0.0195806
+-0.0262234 0.119963 0.0294562
+-0.0354913 0.0889091 0.0432238
+0.037993 0.109314 0.0194453
+-0.0377299 0.0739307 -0.0178742
+-0.0184902 0.0815159 0.0575038
+-0.0314396 0.0637247 -0.0204391
+-0.0825513 0.110697 0.0307352
+-0.0728404 0.156111 0.0119063
+-0.0663982 0.164105 -0.0192035
+0.0062922 0.0654161 -0.0325779
+-0.0624759 0.0959475 0.043683
+-0.033686 0.0637452 -0.0146972
+0.0353693 0.102677 -0.0107148
+-0.0710479 0.166372 -0.0194754
+-0.059243 0.0367531 0.0461369
+-0.0908243 0.114994 0.023547
+-0.0650258 0.156351 -0.0487028
+-0.034444 0.159452 0.00265373
+0.0357616 0.0967769 -0.0118087
+0.044965 0.0903773 0.0181662
+0.0498767 0.0734333 0.0134213
+-0.031608 0.0496402 -0.0193495
+0.0404724 0.0408436 0.0229665
+-0.0473115 0.134637 0.0112388
+0.00743122 0.0352845 0.0446812
+-0.0297131 0.0509006 -0.0193584
+-0.0241845 0.177125 -0.0200954
+-0.0632603 0.157387 -0.0151607
+-0.0598965 0.0343774 0.0365453
+-0.0242309 0.0382399 0.0265535
+0.0433792 0.0972945 0.00218055
+-0.00691412 0.124317 0.0332409
+0.00451269 0.0561377 0.0533474
+-0.00250438 0.0842991 0.0575402
+-0.0903673 0.145762 0.0273033
+-0.0523714 0.143148 0.0193902
+0.0362345 0.0967824 0.0350211
+0.0264539 0.106068 0.0383874
+-0.0729303 0.131104 -0.00814819
+0.0116228 0.130194 0.0054038
+-0.0409771 0.113795 -0.0164017
+-0.0828306 0.150071 0.00319212
+-0.0676468 0.0338307 -0.00583252
+-0.0857374 0.0792227 0.0125087
+-0.0651015 0.0410328 0.0295625
+-0.0136795 0.0987823 0.0477955
+0.0258821 0.0794179 -0.0243188
+0.0449394 0.0734628 0.0226146
+-0.0694849 0.173671 -0.0550315
+0.0142482 0.127965 9.03059e-05
+0.0564285 0.0727253 0.0143999
+-0.0172735 0.180097 -0.0253788
+-0.0699136 0.162391 -0.0489495
+-0.09118 0.143373 0.022161
+-0.0644984 0.100116 0.0422372
+-0.0564709 0.0847764 0.0446514
+-0.043754 0.152254 -0.00662286
+-0.0547181 0.0708998 -0.0155975
+-0.0401471 0.163848 0.00326215
+-0.0814342 0.154656 0.0132857
+-0.0513196 0.0514695 0.0138904
+0.00680734 0.129132 0.0265205
+-0.0614938 0.0959769 0.0438595
+-0.0091676 0.171172 -0.0227371
+-0.0769695 0.154154 -0.0139015
+-0.0502302 0.126885 0.0326315
+0.00555777 0.034446 -0.000384949
+-0.0206136 0.0379294 -0.0283016
+0.00719386 0.0810104 -0.0336874
+0.0390033 0.0387188 0.0172773
+-0.0737727 0.0928414 0.040556
+-0.0829975 0.0763193 0.0155222
+0.0461381 0.0792322 0.00519228
+0.0313444 0.106098 0.0349666
+-0.0157326 0.0383302 0.0246146
+-0.0739329 0.072514 0.0322154
+-0.0287063 0.168278 -0.00832187
+-0.02709 0.0386639 -0.0126398
+-0.0689895 0.156345 -0.00130196
+-0.0622523 0.152181 -0.0215758
+-0.0408691 0.158042 0.00401656
+-0.0324935 0.0903869 0.0442776
+0.0156162 0.0904755 -0.0278196
+0.00543406 0.120555 -0.0138758
+-0.0874054 0.110457 0.012344
+-0.0534973 0.0903982 0.0447559
+-0.0007305 0.0683317 -0.0340878
+-0.0847135 0.152577 0.00925173
+0.0453586 0.0547792 -0.00610681
+-0.0513173 0.146268 0.0144074
+0.0146587 0.125796 -0.00358107
+-0.0790281 0.166651 -0.0329632
+-0.0519257 0.0563169 0.0201359
+-0.0206011 0.0382174 0.00381729
+-0.0499923 0.0342577 0.028256
+0.0222487 0.0365239 0.0303911
+-0.0762222 0.0981393 0.0371985
+-0.0381245 0.162196 -0.0129852
+-0.0462852 0.149202 0.00834502
+0.039774 0.0618507 -0.00575724
+0.0461841 0.0778325 0.00618859
+-0.0770439 0.154813 -0.0101321
+-0.0615001 0.152383 0.000341367
+-0.0665808 0.0334125 0.000644743
+-0.0212653 0.0381372 0.0218515
+-0.071123 0.111741 0.0467572
+-0.0265438 0.177186 -0.00862049
+-0.0523481 0.125498 -0.00654313
+-0.0522635 0.0343446 0.0312176
+0.0191745 0.060499 0.0487078
+-0.0855607 0.111744 0.0263451
+-0.0360977 0.156596 0.00383263
+-0.0479431 0.0356599 -0.0132734
+0.0366613 0.0821332 0.0372523
+-0.0478798 0.107016 -0.0192852
+-0.0356524 0.0460406 0.0421919
+0.00919662 0.0865327 -0.0319845
+-0.0808705 0.11922 -0.0043482
+-0.0335583 0.116878 -0.0136466
+-0.0112898 0.0395292 0.0388441
+-0.0194927 0.0814879 0.0571676
+0.0239403 0.124821 0.0127882
+-0.0444942 0.105717 0.0408954
+-0.0484929 0.162245 0.00645185
+-0.00849807 0.0801615 0.0580203
+-0.0487025 0.121311 -0.0122547
+0.00400584 0.0386131 0.0458842
+-0.00449485 0.0488681 0.0504112
+-0.0507263 0.122615 0.0336033
+-0.0801811 0.108648 -0.00360377
+0.029758 0.0352966 0.00556049
+-0.0236293 0.0665652 0.045154
+0.0470549 0.0602552 -0.00440662
+-0.059554 0.155543 0.0209921
+-0.00550703 0.0787847 0.0579843
+-0.0451509 0.0424209 -0.0143059
+-0.0674032 0.144345 -0.0161484
+-0.0621766 0.125515 0.0434733
+-0.0885651 0.0963045 0.0227197
+-0.0623911 0.154382 0.0301734
+-0.078298 0.0745267 0.0278337
+0.00377395 0.13125 0.00536065
+-0.0351573 0.0361738 0.0471926
+-0.0517432 0.0487299 0.0143843
+-0.0578034 0.0854472 -0.0211977
+0.0151488 0.10026 -0.0226403
+0.0225321 0.104677 0.0415312
+-0.0605798 0.155686 0.00466574
+-0.0891628 0.0942977 0.0214104
+0.0393896 0.106975 0.00316583
+0.00351619 0.0800296 0.056385
+0.0405703 0.105644 0.0131657
+-0.0507419 0.0753249 -0.0179378
+0.0269605 0.111014 -0.0116501
+0.0303852 0.098223 0.0405823
+0.0431361 0.0419917 0.0224684
+-0.0738026 0.1492 0.0397758
+-0.0725455 0.148857 -0.0337299
+-0.072371 0.0860632 0.0407672
+0.0158441 0.0475203 0.043749
+0.0104341 0.0346525 0.0368683
+0.0344146 0.0399125 -0.00185272
+-0.0764595 0.111219 0.0459768
+0.042138 0.101461 0.00217211
+-0.0213522 0.127058 0.00761225
+-0.0556879 0.0677603 -0.0123408
+0.00811587 0.129858 0.0241077
+-0.0637641 0.044271 -0.0022694
+-0.0104962 0.0897854 0.05669
+-0.0147283 0.0657495 -0.0376113
+-0.0881508 0.144556 0.0335371
+-0.0807759 0.0773963 -0.00349851
+-0.0388999 0.0345526 0.0391301
+0.0239365 0.0972468 -0.020928
+-0.0559996 0.126683 -0.00642409
+0.015329 0.118191 -0.013375
+-0.0894904 0.112329 0.0187618
+-0.0771865 0.153815 0.000183792
+0.00297917 0.0389607 -0.010651
+-0.0571826 0.122684 0.0401181
+0.0453844 0.091806 0.0121583
+-0.0908751 0.135104 0.0182068
+0.0216273 0.125269 0.00337714
+0.0572674 0.0722428 0.0147076
+-0.0417782 0.0473939 -0.012205
+-0.0658407 0.0938498 -0.0179236
+0.0102801 0.12364 -0.00922404
+0.00517588 0.113065 -0.0197995
+0.0139965 0.0343089 -0.00230394
+-0.0757024 0.160453 -0.0116926
+-0.0694905 0.10551 0.0380162
+0.0123252 0.0595168 -0.0292981
+0.00242842 0.0916453 -0.033159
+0.0363451 0.0519755 -0.00662669
+-0.0899083 0.121615 0.0458595
+-0.0569713 0.125238 -0.00711806
+-0.0616474 0.0458147 0.0384356
+-0.0816857 0.104685 0.0297488
+0.0417455 0.0760505 -0.00673474
+-0.0249373 0.175681 -0.0116247
+0.0233583 0.0592365 -0.0255115
+0.0296356 0.107455 0.0360045
+-0.0171544 0.0383178 0.00624466
+-0.0338857 0.12324 -0.00632922
+-0.0295434 0.168268 -0.00777595
+0.0237606 0.105983 -0.0162548
+-0.0636907 0.124164 0.0466174
+0.0299589 0.119939 0.0150519
+0.0387947 0.101959 0.0281808
+0.0346979 0.108688 0.0292348
+-0.00481267 0.108148 -0.0225124
+-0.0921162 0.126957 0.038246
+-0.0708767 0.0346286 -0.00100073
+-0.0434981 0.0803632 0.0422528
+-0.00776303 0.0742012 -0.03739
+-0.0164203 0.103082 -0.0232082
+-0.0368601 0.0336856 -0.0211611
+-0.0794788 0.13585 0.0504167
+-0.0622192 0.166249 -0.0495907
+-0.0632785 0.0347611 0.0232648
+-0.0678048 0.17421 -0.0455841
+-0.0292876 0.113893 -0.0165575
+-0.0116236 0.0451107 -0.0281433
+-0.0853661 0.0910995 0.0281927
+0.0152572 0.124805 0.0295869
+-0.0730257 0.141351 -0.00730576
+-0.0694123 0.111827 0.045291
+-0.048008 0.0642705 0.0370013
+-0.000600787 0.0405329 -0.0249772
+-0.0932444 0.124186 0.027283
+-0.050904 0.119772 0.0333476
+-0.00274076 0.0726647 -0.0356738
+-0.0635974 0.151927 -0.0324488
+0.025021 0.085012 -0.0240764
+-0.0749218 0.0661459 0.00857247
+0.0115292 0.119123 0.0361473
+0.0363972 0.0461521 -0.00588406
+0.0385505 0.0378908 0.0124577
+-0.0599745 0.14101 0.03437
+0.00637279 0.049483 -0.0283693
+-0.0896361 0.0969931 0.0144152
+0.0291455 0.0491758 0.0366259
+-0.013551 0.0588296 0.0525443
+-0.0381244 0.127641 0.0146907
+-0.00888364 0.107351 -0.0226177
+-0.0497129 0.165582 0.00102101
+0.0449595 0.0889486 0.000172046
+-0.0339085 0.177047 -0.0109944
+-0.0278445 0.0535534 0.0370258
+-0.0334735 0.0337737 0.0142583
+-0.0926366 0.121498 0.0312794
+-0.0298476 0.105726 -0.0219826
+-0.0771466 0.113816 0.049094
+0.0166749 0.0347919 -0.00596505
+-0.0767718 0.0716181 -0.00247133
+-0.0788159 0.0818529 0.0346403
+-0.0751616 0.0715622 0.0292788
+-0.0629391 0.12384 -0.00881569
+0.0155707 0.100538 -0.0224673
+0.0252284 0.116758 -0.00782512
+0.00112155 0.035712 0.0195623
+-0.0623204 0.0448503 0.0109236
+0.0577561 0.0565381 0.00419435
+-0.000697034 0.0626894 -0.03411
+-0.0739419 0.129646 -0.00820737
+-0.0552142 0.155428 0.0123927
+-0.0749344 0.128178 -0.00819506
+0.0183304 0.0579992 -0.0277502
+-0.0259227 0.123138 -0.0042558
+0.0130981 0.124462 0.0316831
+-0.0723893 0.172498 -0.0357772
+-0.015947 0.124632 0.0285893
+-0.0583387 0.0706756 0.0389009
+-0.0347052 0.0384254 -0.0102399
+-0.0149752 0.125602 0.0274605
+-0.0153278 0.0389782 0.0349161
+-0.0482032 0.131003 0.0267578
+0.0538412 0.0539826 0.0267309
+-0.0845696 0.12714 0.0502672
+0.0343613 0.111866 -0.00251995
+-0.0679623 0.16261 -0.0140168
+0.0251056 0.0902557 0.0469821
+-0.0373144 0.033633 0.00457247
+0.00149673 0.110036 0.0425823
+-0.0886162 0.100967 0.00940891
+-0.0734724 0.155984 0.0233451
+0.00740252 0.0402134 0.0455033
+0.0454345 0.0918112 0.0111626
+0.0252284 0.0420597 0.0372934
+0.026048 0.117275 -0.00637096
+-0.0768401 0.178514 -0.0509284
+-0.0719676 0.138437 -0.00730592
+0.00750673 0.0758763 0.0563548
+-0.0485658 0.0404434 -0.0115683
+-0.0402074 0.168164 -0.0113973
+-0.044494 0.0987314 0.042632
+-0.0530679 0.140053 0.026392
+0.0521064 0.0510719 0.0259326
+-0.0545309 0.0352136 0.0455493
+-0.0717133 0.0715245 -0.00752229
+-0.0899797 0.128138 0.00527223
+0.0045004 0.121001 0.0358516
+-0.0641393 0.143504 -0.0105249
+-0.0769685 0.156212 -0.0102521
+-0.0645952 0.155196 -0.0084031
+0.0323835 0.0460752 0.0307026
+-0.023205 0.178608 -0.0204967
+-0.042033 0.113762 -0.0163433
+-0.0512269 0.150712 0.0135153
+0.00120164 0.0839391 -0.0353946
+0.0300054 0.104778 0.0365239
+-0.00649214 0.0965537 0.0536631
+-0.0289152 0.0846603 -0.0346291
+0.0207024 0.0373647 0.039246
+-0.0386568 0.0577511 -0.0111914
+-0.0605191 0.153857 0.0308432
+0.0410047 0.0395957 0.0043142
+-0.0837262 0.151367 0.00522149
+-0.0378805 0.108506 -0.019759
+-0.0169176 0.183111 -0.0193016
+-0.0614849 0.0946016 0.0445824
+0.0332816 0.116574 0.0106008
+-0.0378618 0.101418 -0.0215553
+0.0383745 0.038179 0.01581
+0.010493 0.111264 0.0393941
+0.0353685 0.0600237 -0.0127796
+-0.0203175 0.0933679 0.052311
+-0.0434938 0.0619471 0.0402773
+-0.0393599 0.0418158 -0.0263353
+-0.0588856 0.105471 -0.0181522
+-0.0278953 0.124828 0.00229374
+-0.0894349 0.136561 0.0381888
+-0.0455406 0.124353 -0.00945534
+-0.0850289 0.111596 0.00326083
+0.01399 0.106595 -0.01887
+-0.0765357 0.0692333 0.0204809
+-0.0741239 0.165568 -0.0191297
+-0.056116 0.131133 0.036427
+-0.0715838 0.158191 -0.0409255
+-0.077037 0.111295 -0.0046823
+-0.0135016 0.0573891 0.0517499
+0.0374899 0.0469458 0.0313688
+-0.0297919 0.108873 -0.0192723
+-0.0616758 0.113831 0.0370124
+-0.0157188 0.0628375 -0.0366012
+-0.0879795 0.148554 0.029057
+-0.0890892 0.0955882 0.00942496
+-0.0709327 0.178806 -0.0496057
+0.0454967 0.0611109 0.0306935
+0.0193158 0.0835035 0.0508805
+0.000580692 0.131584 0.0113306
+-0.0615895 0.155312 -0.0215829
+-0.0134922 0.122339 0.0335983
+0.0458248 0.0806172 0.0201703
+-0.0225646 0.0983245 -0.0242201
+-0.0682478 0.066271 0.0282875
+0.0302092 0.117283 0.0265434
+-0.0829482 0.128017 -0.00457928
+-0.0715343 0.141411 0.0464325
+-0.0800761 0.0936246 -0.00957758
+-0.0851808 0.153525 0.0149377
+-0.0865771 0.124349 0.048115
+-0.0221188 0.100222 -0.0241961
+0.0224909 0.111137 0.037371
+0.00736705 0.0494733 -0.028237
+0.0432386 0.0750761 0.0273062
+-0.0564476 0.153922 0.0264803
+-0.0288608 0.0448354 -0.0281934
+-0.0776003 0.156937 -0.0149108
+-0.0784376 0.171472 -0.0389273
+-0.0178474 0.12806 0.016159
+-0.0284556 0.0472262 0.0488083
+-0.0677451 0.0629578 0.0224748
+-0.0567391 0.0576068 -0.000420382
+-0.0769537 0.132513 -0.00657383
+-0.0837476 0.0952109 -0.00455405
+-0.0427254 0.0358312 -0.0275925
+0.00623069 0.0782309 -0.0341321
+-0.0758642 0.117897 -0.00698249
+-0.0903736 0.13787 0.0221843
+-0.027962 0.155009 -0.00579987
+-0.0193391 0.0386082 -0.00732295
+-0.0237931 0.0698259 -0.0366341
+-0.015124 0.037267 -0.0266656
+0.0113671 0.0479427 -0.0268055
+0.0141489 0.0347135 0.0249225
+-0.0669549 0.160975 -0.0568649
+0.0208979 0.0359371 0.0087849
+-0.0570669 0.0493259 -0.00137722
+-0.0186112 0.0386738 -0.00909396
+-0.0055195 0.0443362 0.047543
+-0.0714237 0.153981 -0.0448933
+0.0119572 0.125728 -0.00550935
+-0.0310683 0.0679104 -0.0254551
+0.0514754 0.0531199 -0.00283685
+0.0135274 0.12988 0.0160733
+-0.0728856 0.148047 -0.0249504
+-0.0233454 0.122752 0.0259903
+-0.0578948 0.0983776 -0.0200563
+-0.0203263 0.0825295 0.0568715
+-0.0643532 0.142586 -0.00864957
+-0.0793976 0.151048 0.0347829
+0.0356609 0.104701 0.030636
+0.0063888 0.115364 -0.0182909
+-0.0289964 0.0383539 -0.00532847
+-0.0834239 0.0965619 -0.00458039
+0.019508 0.109842 0.0390589
+-0.0767379 0.10491 0.0348158
+-0.0825915 0.143398 0.0421649
+0.0182147 0.0834619 -0.0281698
+-0.0633435 0.060722 0.00207171
+0.0428335 0.076148 -0.00478426
+-0.0724349 0.0644357 0.0131399
+-0.0114637 0.165492 -0.0149909
+-0.0493961 0.033823 0.00737414
+0.0502518 0.0446339 0.0182039
+-0.0439305 0.0432632 0.0429545
+-0.0713305 0.0628284 0.00935991
+-0.0276378 0.158958 -0.0125395
+0.0600492 0.0581198 0.0161748
+0.00134506 0.0511101 -0.0304682
+-0.0692332 0.158118 -0.0519432
+-0.0133594 0.127978 0.0236019
+0.0292021 0.0619142 0.0421314
+-0.0667582 0.180263 -0.0553199
+-0.0197539 0.0671131 -0.0375162
+-0.0704746 0.040884 0.00781861
+-0.049499 0.112564 0.0357174
+-0.0322502 0.0367926 -0.0305484
+-0.00789583 0.129197 0.00105287
+-0.016169 0.117727 -0.0146898
+0.0295964 0.0580473 -0.0178274
+-0.0883598 0.0874311 0.00547496
+-0.0274913 0.101587 0.0432231
+-0.0768992 0.155831 0.0192356
+-0.0364902 0.0634253 0.0412069
+-0.0388025 0.125966 -0.00521606
+0.0196905 0.0550135 0.047657
+0.0571135 0.071717 0.0176058
+-0.0064991 0.0952675 0.0547927
+0.0174901 0.0346463 0.0220409
+-0.0024963 0.10305 0.0439671
+-0.0184804 0.0543192 0.0487134
+-0.0334418 0.0335662 -0.0297364
+-0.0620472 0.176838 -0.0608311
+-0.0308715 0.0522855 0.0371048
+-0.0367079 0.0695483 -0.0163464
+0.0158791 0.123986 0.0298499
+-0.0320536 0.0356449 0.0500425
+-0.0493943 0.14168 0.0103932
+-0.0558858 0.106922 -0.0182628
+0.059454 0.0647075 0.0208869
+0.0152596 0.125955 0.0281714
+0.038478 0.0980354 0.0312187
+-0.0744916 0.146991 0.0423999
+-0.0846211 0.0992422 0.0286106
+-0.0661191 0.156294 0.0171964
+-0.0794888 0.111206 0.0453002
+0.00519891 0.0880579 -0.0334439
+0.0153315 0.0346194 -0.0136599
+0.0395267 0.0632302 -0.00776648
+-0.0463407 0.0629206 0.0382092
+-0.0514201 0.121192 0.0343754
+-0.0528867 0.0334295 0.0213081
+-0.062446 0.163101 -0.0455941
+-0.0770308 0.167319 -0.027484
+-0.041999 0.126936 -0.00419358
+0.0289857 0.090239 0.0438092
+-0.0634397 0.158343 -0.0445972
+0.00692319 0.0630369 0.0555875
+-0.0294344 0.0381755 0.00387704
+0.0228628 0.0351973 0.0171792
+-0.0738758 0.0993275 -0.0132564
+-0.0668982 0.151542 -0.0415298
+-0.0629724 0.133897 0.038809
+-0.0928035 0.121507 0.0322842
+0.0305387 0.0609912 -0.0187852
+0.0385799 0.0739884 0.0346445
+-0.0814052 0.08555 -0.00656718
+-0.0621323 0.0602572 0.0206983
+-0.0294013 0.0804353 -0.034602
+0.0164763 0.0348375 -0.0136598
+-0.0659203 0.122383 -0.00896938
+-0.0328324 0.0929676 -0.0240794
+0.000521824 0.0801146 0.0573693
+0.0221547 0.0979182 -0.0216266
+-0.0649149 0.0392337 0.0390271
+0.0351689 0.0928995 0.0387113
+-0.0125327 0.0502379 0.050201
+-0.05553 0.12546 -0.00656458
+0.0330446 0.111446 -0.00610948
+0.0255618 0.120425 0.027665
+-0.0243325 0.126263 0.00798048
+-0.0654853 0.0944999 0.0429585
+-0.0478356 0.0970782 -0.0220591
+-0.0332116 0.0851655 -0.0254848
+0.00641089 0.036109 -0.0234066
+-0.0192798 0.0610993 0.0494354
+0.0363164 0.11089 0.0231265
+-0.0705311 0.0972485 0.0414142
+-0.0514267 0.135712 0.0273837
+-0.0564984 0.0918565 0.0453856
+-0.042499 0.113906 0.034677
+-0.0717955 0.156396 0.0195489
+-0.0215446 0.0942792 -0.0320343
+-0.0246821 0.177174 -0.0112336
+0.0177118 0.0944604 -0.0240064
+-0.0881735 0.15196 0.0139234
+-0.000296991 0.0392472 -0.00781836
+-0.00248723 0.115552 0.0407434
+-0.0147779 0.0756914 -0.0387415
+0.0503819 0.0717878 0.00597587
+-0.0396993 0.117276 -0.0140617
+-0.0628784 0.16149 -0.0515871
+-0.0769868 0.0713943 0.0255408
+-0.01852 0.115493 0.0376203
+-0.0632135 0.155458 0.00808821
+-0.0244921 0.103004 0.0433541
+-0.0392444 0.0481623 -0.0129943
+0.0317796 0.0647744 0.0406274
+-0.00516147 0.100957 0.0442706
+-0.0196118 0.040807 -0.0284935
+-0.0288146 0.0436325 0.0510094
+-0.0690473 0.0727409 0.0365464
+-0.0478629 0.125952 -0.00709772
+-0.0456346 0.123874 0.0250844
+-0.0214969 0.0498836 0.0466158
+0.0515378 0.0461489 0.00621743
+0.0472621 0.0627303 -0.00287883
+-0.0738666 0.0846755 0.0394915
+0.0247439 0.0490967 0.0390469
+0.0150281 0.097439 -0.0231662
+0.0456884 0.0904192 0.00716979
+0.0173787 0.046209 -0.0233857
+-0.00349533 0.123738 0.0342998
+-0.0905223 0.128294 0.0420009
+-0.0733752 0.0741466 0.034437
+-0.0106209 0.130105 0.0129711
+-0.0754549 0.158227 -0.0249553
+-0.0125993 0.0922824 -0.0359459
+-0.064348 0.0611447 0.0212332
+-0.0246221 0.0450443 -0.0281165
+-0.0383306 0.0379343 0.0437226
+-0.0423655 0.110099 -0.0185262
+-0.0750214 0.166563 -0.0400315
+-0.0338231 0.0915286 -0.0241849
+-0.0857793 0.088721 -0.000547834
+-0.00485752 0.103786 0.0439754
+-0.0334914 0.0960174 0.044365
+-0.040497 0.0705056 0.0418211
+0.0309495 0.065969 0.041175
+-0.0649024 0.119454 -0.00881631
+-0.0326689 0.0382268 0.0507498
+0.0366581 0.0727136 0.0371657
+0.0102886 0.13098 0.0134608
+0.0549839 0.0534895 0.00121219
+0.0229081 0.0608908 -0.0255785
+-0.0578484 0.0576892 0.00460939
+-0.0380707 0.123893 0.0251235
+0.0425051 0.049941 0.0324381
+-0.0208164 0.0797246 0.0560382
+-0.0600611 0.155861 0.0164593
+0.0128031 0.126304 -0.00413421
+0.0254584 0.0383883 -0.00303811
+-0.0782251 0.104799 0.0333593
+-0.011635 0.0466548 -0.0295721
+-0.0227746 0.0968676 -0.024693
+0.00330234 0.0626197 -0.0330565
+-0.00750217 0.0787518 0.0577101
+-0.043485 0.109867 0.0381531
+0.000280959 0.0655552 -0.0344559
+0.0303619 0.0982175 -0.0159971
+-0.0671228 0.150867 0.0375155
+-0.0251523 0.0635221 0.0411049
+-0.0732036 0.147141 -0.0198634
+-0.0403541 0.121097 -0.0120881
+0.0144177 0.0388354 -0.0218485
+-0.0912331 0.114706 0.0382141
+0.0261502 0.120654 0.0264581
+-0.0131682 0.0974746 0.0509922
+-0.0718669 0.115007 -0.00776782
+0.0425779 0.0929869 -0.00379718
+-0.0228308 0.0881946 -0.0369029
+-0.00860718 0.0361712 0.0494902
+-0.0685057 0.159542 -0.0539539
+-0.0864902 0.103559 0.00540359
+-0.0697818 0.16064 -0.00887941
+-0.05157 0.0657725 0.0357523
+0.036411 0.0430004 -0.00393346
+-0.0617308 0.0752409 -0.0175405
+-0.0384866 0.112537 0.0353486
+0.0446565 0.076299 -0.00080692
+-0.0444716 0.165339 -0.00887164
+0.0234256 0.0994865 0.0445818
+0.0411691 0.0899632 0.029736
+-0.0188353 0.12777 0.00853266
+-0.079023 0.172207 -0.0429929
+-0.0509196 0.141445 0.00173554
+-0.013506 0.0486161 0.0481837
+0.0193259 0.0665212 -0.0284749
+-0.0472913 0.128011 -0.00322004
+-0.0626481 0.167836 -0.0465871
+-0.0304696 0.0875178 0.0438182
+-0.0917743 0.120197 0.0434965
+-0.0648107 0.0617811 0.00082735
+0.000497836 0.114196 0.0414191
+0.0574118 0.0647963 0.00219725
+-0.0558676 0.0941545 -0.0217392
+-0.0336084 0.073768 -0.0234794
+0.00599322 0.131555 0.0161709
+0.00890036 0.0630937 0.0549611
+-0.062689 0.110949 0.0372761
+0.000505603 0.092515 0.0555251
+0.0223468 0.121292 -0.00473526
+-0.0486224 0.0562169 -0.0104362
+-0.00349838 0.0938964 0.0554871
+-0.0444734 0.111133 -0.0175908
+-0.0110869 0.111309 -0.0199045
+-0.0706182 0.161097 -0.00919138
+-0.0852334 0.0992128 0.0278144
+-0.0739196 0.15466 0.0290556
+0.0296062 0.0693912 -0.0207509
+-0.0310679 0.0435994 -0.0290446
+-0.0381696 0.0351458 0.0102677
+0.0601731 0.0664558 0.0181654
+-0.0779755 0.159708 -0.0199256
+-0.0656034 0.0619186 0.0220381
+-0.0875197 0.139142 0.00819442
+0.057949 0.0523838 0.0161799
+-0.0789979 0.165257 -0.0319521
+-0.0651299 0.139658 0.0409855
+-0.021445 0.0539977 0.0453008
+-0.0896519 0.136557 0.0371913
+-0.0534965 0.0890047 0.0449968
+-0.0534319 0.15708 0.0101259
+-0.0328837 0.0835575 -0.0275315
+-0.0164672 0.0659336 0.0534892
+-0.0354329 0.0383545 -0.00847377
+-0.0708675 0.102264 -0.0137609
+-0.023563 0.126621 0.00971624
+0.0103735 0.0460953 0.0463477
+-0.0660593 0.179544 -0.0550745
+-0.0527874 0.0854974 -0.0215293
+-0.0859388 0.0819759 0.019473
+0.0105508 0.12954 0.0235608
+-0.0103855 0.174149 -0.0227989
+-0.0669072 0.0448192 0.00702222
+-0.0284871 0.0932302 -0.0255941
+-0.0674877 0.041922 -0.00126982
+-0.0650925 0.142629 -0.00933509
+0.0420248 0.0845075 -0.00777453
+-0.0790747 0.0713835 0.0198308
+-0.0261077 0.0372445 -0.0185929
+-0.0370217 0.0410946 -0.0286549
+-0.0635554 0.166233 -0.0355972
+-0.0218769 0.105849 -0.0224625
+-0.0880158 0.125695 0.0466833
+-0.0621699 0.128298 0.0417254
+-0.0849635 0.115612 0.0476218
+-0.0132844 0.180127 -0.0228495
+-0.0282267 0.181005 -0.00798034
+-0.0312929 0.0665317 -0.0234435
+0.0182349 0.0355117 -0.0116753
+0.0151438 0.128336 0.0223847
+-0.0440686 0.0364096 0.0444754
+0.00518099 0.090879 -0.0329112
+-0.00712692 0.130239 0.0200248
+-0.00350074 0.0760658 0.0587997
+0.0285239 0.105924 -0.0141978
+-0.0560757 0.0486306 0.0102324
+-0.0647346 0.0751547 -0.0168067
+-0.0681413 0.163425 -0.0155251
+-0.0632877 0.151202 -0.0295741
+-0.0467953 0.0573798 0.0374139
+-0.0434795 0.10013 0.0422114
+0.0285718 0.0898068 -0.0210622
+0.0330592 0.116487 0.0176444
+-0.0241054 0.0348343 0.0490127
+-0.0124791 0.0354015 -0.0179384
+0.0405961 0.0624185 0.0297312
+-0.081387 0.11145 0.0446717
+0.00150869 0.0675259 0.0561223
+0.00629906 0.0381702 -0.0111411
+-0.0201579 0.171232 -0.0211109
+-0.0418025 0.1163 -0.0150397
+0.00651017 0.0786147 0.0558016
+-0.0940189 0.11877 0.0172997
+-0.0685972 0.0635876 0.000162346
+-0.0328398 0.0722904 -0.0244709
+-0.0455312 0.131052 0.00748081
+-0.023441 0.181825 -0.0105699
+0.0108694 0.130662 0.0179509
+0.0123886 0.0463398 -0.0252064
+-0.0652697 0.118619 0.0495916
+0.00206776 0.0348089 0.0386094
+-0.0298407 0.0705727 -0.0304857
+-0.0632339 0.164684 -0.0315914
+0.0353918 0.0491057 -0.00653987
+-0.0392946 0.123101 -0.0101877
+-0.0885378 0.137788 0.0102157
+-0.0234958 0.100256 0.0443804
+0.04037 0.0460545 -0.00454494
+-0.016752 0.0336597 -0.0246752
+0.0413281 0.0697537 0.029756
+-0.077268 0.161738 -0.0185704
+0.00995573 0.0897855 -0.0311748
+-0.0494127 0.0345257 0.0351696
+-0.00258654 0.0376582 -0.0251248
+-0.0538672 0.149311 0.025406
+0.0281029 0.0968693 0.0425418
+-0.0296256 0.0384042 -0.00919904
+-0.0659714 0.070335 0.0357803
+-0.0792849 0.109686 0.041215
+-0.0609581 0.142927 -0.00458074
+-0.064489 0.16418 -0.0242498
+-0.0585553 0.060477 0.023496
+-0.0851998 0.104954 0.024348
+0.0164098 0.126062 -0.00187701
+0.0235925 0.125057 0.0140956
+-0.00865281 0.123002 -0.0103525
+-0.0132305 0.174198 -0.0268981
+-0.0453894 0.130637 0.0193744
+0.0162761 0.0694793 -0.03005
+-0.0894525 0.128349 0.0437622
+-0.0562473 0.0708294 0.0392023
+0.0180456 0.044911 0.0433906
+-0.0626788 0.119898 0.0446407
+-0.0206698 0.116197 -0.0150314
+0.051506 0.0461707 0.0202521
+-0.0541367 0.13422 -0.00388726
+0.0303748 0.106409 -0.0127112
+0.0453408 0.0805541 0.00120995
+-0.00350137 0.0788045 0.0582113
+-0.052917 0.144693 0.0213981
+-0.0810085 0.136808 -0.00286908
+0.0435987 0.0482711 0.0311843
+-0.00549934 0.085642 0.0570911
+-0.0414264 0.125093 -0.00826982
+-0.0534716 0.0490986 0.0276613
+-0.0833044 0.10329 0.0285866
+-0.0394866 0.111153 0.0363447
+0.00954728 0.0389439 0.0451085
+-0.035694 0.0666325 -0.0153314
+-0.0301817 0.12316 -0.0042413
+-0.0383432 0.127011 0.0175779
+-0.0603252 0.0707596 0.0383929
+-0.0249438 0.0380891 0.0543244
+0.0144999 0.10985 0.0401157
+-0.0387789 0.0392857 0.0427431
+-0.0390181 0.126516 -0.0038056
+-0.0628844 0.116571 -0.0108779
+-0.0718222 0.0666154 0.0237319
+-0.0176233 0.0640054 0.0519373
+-0.0878362 0.112676 0.0422322
+-0.0661452 0.115702 0.0482687
+-0.0464951 0.116619 0.0318843
+-0.0501411 0.130626 -0.00198394
+-0.0497482 0.0767922 -0.0184367
+-0.0234881 0.0462034 0.0522022
+-0.0739006 0.162422 -0.0359639
+-0.0262017 0.0878115 0.0498853
+-0.0133444 0.0389099 -0.0138542
+0.040243 0.0970923 -0.00582991
+-0.011153 0.129981 0.0142184
+0.0309714 0.035145 0.0133989
+-0.0426252 0.0534503 -0.0112074
+-0.0538286 0.0338166 -0.0117099
+-0.0622047 0.0394245 0.0433885
+-0.0746849 0.14995 -0.0294029
+-0.0611865 0.0441212 -0.00432669
+-0.0182092 0.177147 -0.0243125
+0.0435018 0.0542009 0.0324922
+0.0364352 0.0371002 0.0145635
+-0.0321091 0.03378 0.0163326
+-0.0627516 0.145959 -0.00957815
+-0.0054968 0.061946 0.0559894
+-0.0738575 0.159643 -0.0319319
+-0.0640268 0.154208 0.0310565
+-0.0679826 0.0819454 0.0421862
+-0.0571357 0.158766 0.00595884
+0.0416081 0.101418 0.000182195
+-0.0235633 0.0565791 0.042552
+-0.0707052 0.0656331 -0.000502385
+0.0151645 0.126939 0.0266898
+0.0319146 0.0808971 0.042698
+0.0591439 0.0594194 0.00516163
+-0.0517306 0.164095 4.31123e-05
+-0.0802487 0.109228 0.032428
+-0.0124889 0.0964872 0.0522501
+0.0122905 0.06666 -0.0305971
+-0.00890819 0.0389895 -0.0111716
+-0.0414812 0.0634467 0.0412468
+0.0440882 0.090317 0.0231627
+-0.048759 0.14421 0.00252118
+-0.0240109 0.113853 -0.0165323
+-0.0863077 0.083293 0.0084931
+-0.0848578 0.117602 -0.00112226
+-0.0758939 0.107753 -0.00831552
+-0.0240922 0.0551393 0.0417051
+-0.048723 0.134043 0.0239744
+-0.075211 0.159631 -0.0279486
+-0.0458972 0.108476 -0.0187253
+-0.0827664 0.0789303 0.000509537
+-0.0413647 0.150284 -0.00509832
+0.00543597 0.131652 0.0145423
+-0.0567655 0.0797174 -0.020408
+-0.0314842 0.0875139 0.0436743
+-0.0272508 0.169746 -0.00972716
+-0.055503 0.0918468 0.0452512
+-0.0250407 0.11597 -0.0147569
+-0.0757456 0.155966 0.0196325
+0.0124869 0.0936385 0.0515089
+-0.0205861 0.122762 0.0284276
+-0.0807235 0.116228 0.0481624
+0.0260285 0.0450625 -0.0106845
+-0.0593728 0.0579489 0.0125735
+-0.049763 0.132774 0.0280532
+-0.0486523 0.128248 0.029602
+-0.0786364 0.0880738 -0.010561
+-0.0292743 0.157003 -0.0105584
+-0.0728269 0.0950692 -0.0149677
+-0.0571361 0.0333705 -0.00647115
+0.00471531 0.10507 -0.02128
+-0.0617504 0.158434 -0.0225881
+-0.044324 0.0573856 0.0392571
+-0.0231291 0.0608213 0.0434196
+-0.0736852 0.109489 0.0408578
+-0.0434867 0.102921 0.0416521
+-0.0745585 0.102629 0.0369846
+-0.00580621 0.0826794 -0.0377615
+-0.0293232 0.155967 -0.00892475
+-0.0785045 0.111148 0.0455755
+-0.0789041 0.126621 -0.00628203
+0.0387126 0.0984064 -0.00782785
+-0.00546749 0.0386155 0.00470576
+-0.00150095 0.0925253 0.0558525
+-0.0200678 0.0384268 0.0272406
+-0.0900294 0.114549 0.0240977
+-0.0775366 0.070359 0.00451989
+-0.0719896 0.139908 -0.00735583
+-0.0574975 0.0987515 0.0429871
+-0.0321271 0.107425 -0.0197503
+0.0188647 0.126347 0.0223312
+0.00641604 0.0962346 -0.0278978
+0.00311817 0.108714 -0.0201476
+-0.0160251 0.0375717 -0.0270066
+-0.0497158 0.140127 0.00540861
+-0.0603383 0.155998 0.00765284
+-0.0315045 0.100214 0.0434156
+-0.0865647 0.0978132 0.0263535
+0.030619 0.119354 0.0124235
+-0.0618449 0.153748 -0.0225793
+0.0357348 0.111877 0.0229152
+-0.0825172 0.108952 0.0273498
+-0.06497 0.156112 0.0234152
+-0.0141713 0.0391912 0.0511685
+0.0418096 0.0482673 0.0320498
+0.0293522 0.0768437 0.0442363
+-0.00664275 0.113752 -0.0185066
+-0.0339572 0.173519 -0.0141904
+-0.0868865 0.136539 0.0438118
+-0.0358508 0.0350331 0.0126434
+-0.0538363 0.0491492 0.0306601
+-0.0555251 0.040203 -0.0098178
+0.00654381 0.0340863 -0.0167284
+0.00392426 0.0984839 -0.0242888
+-0.0798351 0.078638 0.0310296
+-0.0520723 0.122646 0.0352105
+-0.0550812 0.153793 0.0226168
+0.014566 0.128157 0.000776346
+-0.0875094 0.103632 0.00838188
+0.0565843 0.0508466 0.00719292
+-0.0301736 0.0353405 0.0506988
+-0.054126 0.0491389 0.0369634
+-0.0213227 0.0927441 -0.0344661
+-0.0512299 0.133896 0.029412
+-0.0175551 0.0668893 0.0531861
+-0.0306537 0.125522 0.0174226
+0.00435638 0.0524337 -0.0297062
+-0.030037 0.0383331 -1.37538e-05
+-0.0748829 0.104948 -0.0102086
+0.0281452 0.12091 0.0214948
+-0.00129242 0.0339647 -0.0219341
+-0.0193753 0.114664 -0.0174341
+-0.0226586 0.185005 -0.0161016
+0.0333802 0.116202 0.0163348
+-0.0182505 0.0920203 0.0545129
+0.0291993 0.0821983 0.0440432
+0.040955 0.104188 0.00218636
+-0.0221399 0.16826 -0.0191908
+-0.0160775 0.128732 0.0124337
+-0.0494959 0.115246 0.0337414
+-0.0623926 0.155248 -0.0336012
+-0.0504873 0.0646576 0.0351978
+-0.0738463 0.114952 -0.00659368
+-0.0195012 0.0351765 0.0514244
+-0.0448823 0.107056 -0.0197924
+-0.0768765 0.119334 -0.00688293
+0.0107885 0.0345143 -0.0106366
+0.024237 0.0727429 0.0473317
+-0.00865103 0.0511695 -0.0319029
+-0.0877012 0.0963902 0.0247068
+-0.0518399 0.0559545 0.028629
+-0.00150749 0.0442279 0.0463824
+-0.066685 0.0361231 0.0351414
+-0.0298413 0.0511486 0.0404908
+-0.0104881 0.125079 0.0309157
+-0.0478366 0.0336224 0.000642732
+-0.0567073 0.152073 0.0307854
+-0.0772744 0.177812 -0.051035
+-0.0147745 0.0770701 -0.0384436
+-0.0929915 0.122891 0.0372721
+-0.0104786 0.116885 0.0389916
+0.0382147 0.0603208 -0.00873991
+-0.0754893 0.145614 0.0436847
+-0.0484504 0.134772 0.0211152
+0.013378 0.056283 0.0508299
+-0.00197361 0.0339973 -0.0202101
+0.0414332 0.100023 0.0231582
+0.0306311 0.076191 -0.0209647
+-0.0663516 0.155012 0.0287678
+-0.0710496 0.158811 -0.00499394
+-0.0554619 0.115432 0.0354757
+-0.0357408 0.0754574 -0.0191515
+0.000523827 0.0787529 0.057707
+-0.0189564 0.187079 -0.0195498
+-0.0849859 0.149949 0.0316738
+-0.0578691 0.0427244 -0.00751381
+-0.0739068 0.123785 -0.00803832
+-0.0355104 0.105608 0.0391036
+-0.0437169 0.0336921 -0.00956971
+0.0503986 0.0446075 0.0172106
+0.028338 0.0371627 0.023798
+-0.0835031 0.123045 0.0493423
+-0.051023 0.051637 0.0206282
+0.00799809 0.131294 0.0169006
+-0.0154642 0.0617228 0.0531313
+-0.0548148 0.0898539 -0.0222515
+0.0183688 0.0727072 0.0511848
+-0.0528816 0.143158 0.0234068
+0.0423208 0.0885482 0.027912
+-0.0489879 0.148715 -0.00337283
+0.0536516 0.0710277 0.00477709
+-0.0558317 0.154614 0.0193814
+-0.078074 0.0921324 -0.0116061
+-0.0138482 0.126055 -0.00351425
+-0.0484951 0.107035 0.0396855
+-0.0617568 0.113454 -0.0138737
+-0.0539631 0.0449066 0.021682
+-0.0323187 0.0763806 -0.0295323
+0.0441984 0.0917353 0.0221589
+-0.0830674 0.136771 -0.000769185
+-0.0741071 0.154101 -0.0239055
+-0.0686886 0.176906 -0.0487674
+-0.0561408 0.0460708 0.0131999
+-0.0685022 0.101419 0.0404594
+-0.0739688 0.0653923 0.0119616
+0.001175 0.0909253 -0.0339059
+0.0263146 0.0782009 0.0468843
+0.00192116 0.123969 -0.00948312
+-0.0587405 0.0737726 -0.0173801
+-0.0627949 0.167828 -0.0455908
+-0.0508006 0.0883889 -0.0215985
+-0.0481052 0.0559539 0.0359192
+0.0442623 0.0959503 0.0151546
+-0.0608758 0.0968112 -0.0186271
+-0.0345924 0.0485568 0.0396695
+-0.0618805 0.102572 -0.018381
+0.024797 0.0615121 -0.0241542
+0.0398079 0.0440192 0.0290809
+-0.0138249 0.0869198 -0.0385386
+-0.00950254 0.0801627 0.0580817
+-0.0893667 0.135016 0.00621309
+-0.0210328 0.0946153 0.0501685
+0.0124741 0.0347469 0.026362
+-0.0837947 0.100615 0.0291484
+-0.0677074 0.147127 -0.0273126
+-0.080936 0.0720826 0.0105433
+-0.0486367 0.0591511 -0.0114572
+-0.0856634 0.1104 0.0223511
+-0.0321401 0.16671 -0.0160336
+-0.0724955 0.174948 -0.0415233
+-0.0260317 0.0348457 -0.0200988
+-0.0274922 0.0497667 0.0454723
+-0.0394917 0.0534182 0.0393765
+0.0515114 0.0691441 0.0252354
+-0.0257438 0.12256 -0.00564443
+0.0437634 0.0832354 -0.00281017
+-0.0247629 0.0727034 -0.0370836
+-0.0655551 0.156269 0.0188465
+-0.0629848 0.136718 0.0370028
+0.0602499 0.0678328 0.0161531
+-0.0168173 0.0841632 -0.0392397
+-0.0683543 0.152019 -0.0462463
+-0.0567286 0.155485 0.0133042
+-0.0124895 0.119639 0.0367572
+-0.0620219 0.161552 -0.0385959
+-0.0485081 0.0504118 0.037253
+-0.0681426 0.159579 -0.055037
+-0.0339899 0.0738027 -0.0224777
+0.0187727 0.038419 -0.0166964
+-0.00951396 0.0647096 0.055646
+0.0373151 0.0659642 0.0362985
+-0.0697681 0.156742 -0.0499137
+-0.07512 0.161006 -0.0309706
+0.0445653 0.094573 0.0151616
+-0.0642545 0.154418 -0.039754
+0.0245051 0.108393 0.0385583
+-0.0423597 0.0337264 -0.0019814
+0.0111186 0.130773 0.0109156
+-0.0366056 0.0484481 -0.0142844
+-0.00762999 0.0387797 -0.0144679
+-0.0695561 0.0340783 0.00839793
+-0.0566909 0.0334951 0.00618234
+-0.0565711 0.159859 0.00306588
+0.000399482 0.0419381 -0.024642
+-0.0505546 0.0490872 0.0373101
+-0.0513639 0.0402537 0.0462611
+-0.0256858 0.0575487 -0.0293997
+-0.0524956 0.0890116 0.0451123
+0.044036 0.0973464 0.00517085
+-0.0774531 0.156901 -0.0199195
+0.0267966 0.0534918 0.0403155
+-0.0887231 0.0888754 0.0204484
+0.014348 0.0534071 0.0486823
+-0.0495075 0.0490436 0.0377607
+-0.0321324 0.154142 -0.000565596
+-0.0856354 0.143297 0.0395519
+-0.0344784 0.0932112 0.0445123
+-0.0688653 0.0860793 0.0429202
+-0.068567 0.167578 -0.0243154
+-0.0155024 0.084237 0.0568519
+-0.0768438 0.0975378 -0.0115852
+-0.054418 0.142404 0.0282888
+-0.00749562 0.091199 0.0567536
+0.0202715 0.077733 -0.0270961
+-0.0748613 0.102114 -0.0115761
+-0.0102609 0.0389601 -0.0132864
+-0.060805 0.0953608 -0.018741
+-0.0557308 0.0738305 -0.0174435
+-0.0789903 0.0900056 0.0359819
+0.0427074 0.0831548 -0.00579292
+-0.00549246 0.097843 0.0523265
+0.046038 0.0679968 0.0252834
+-0.0235521 0.116765 0.0343279
+0.0302394 0.0759037 -0.0212804
+-0.0212883 0.0638258 0.0471454
+0.0285217 0.0480557 -0.0127278
+-0.0326422 0.080708 -0.0295257
+-0.0545922 0.126915 0.0368606
+-0.07894 0.12954 -0.00577029
+-0.0871517 0.0874756 0.0234341
+0.0457525 0.0862068 0.0131643
+-0.0636848 0.163906 -0.0268361
+-0.01113 0.175691 -0.0290055
+-0.0644352 0.0424097 0.0302481
+0.00751322 0.0883379 0.0556646
+0.0450791 0.0411084 0.0144119
+-0.0801842 0.0990978 -0.00757647
+0.00942317 0.0752723 0.0558271
+-0.0720162 0.169175 -0.0255925
+-0.0706469 0.0749114 -0.0128891
+-0.0231537 0.124452 0.0216177
+-0.0354775 0.0932002 0.0444179
+-0.0467494 0.0782878 -0.0191673
+0.0402616 0.088708 0.0319407
+-0.0668021 0.0909191 -0.0174744
+-0.0798777 0.0922401 -0.00961163
+-0.00990791 0.168128 -0.0187599
+-0.0538472 0.144686 0.025416
+-0.0506923 0.0693793 -0.0143111
+-0.0628457 0.158366 -0.0406006
+-0.0472527 0.147738 0.00869118
+-0.0798492 0.140347 -0.0037915
+-0.0633595 0.155022 0.00583483
+0.0194938 0.0948135 0.0473832
+-0.0235952 0.03653 -0.0288249
+-0.0625329 0.155555 0.0257427
+-0.0293056 0.125075 0.00323421
+-0.0848075 0.100731 -0.000569426
+0.0362036 0.112389 0.0159326
+0.0148576 0.0726711 0.0531263
+-0.0648898 0.0353536 0.0257632
+-0.0225355 0.115413 0.0360839
+0.0344395 0.062733 -0.0148459
+-0.0404982 0.0548597 0.0396645
+0.0241838 0.0363666 0.0254891
+0.0185331 0.065881 0.0495848
+0.0124938 0.0589954 0.0513278
+0.00977817 0.131153 0.0118468
+0.0100829 0.0519948 0.0512903
+-0.0361503 0.127316 0.0154104
+-0.0482545 0.05323 0.0361705
+-0.0940988 0.124142 0.016266
+-0.0100812 0.168118 -0.0236136
+-0.00900002 0.1303 0.0121232
+0.044368 0.0832642 0.000211132
+-0.0417803 0.126317 0.0192991
+-0.0875576 0.0954908 0.0044419
+-0.0679508 0.168029 -0.055011
+-0.0131452 0.0346678 0.0462791
+0.00685606 0.0990064 -0.0228407
+0.0328304 0.0354201 0.0116657
+0.0278048 0.121695 0.017093
+0.0445188 0.0721805 0.0237826
+-0.0754994 0.115715 0.0515239
+-0.0115085 0.0815323 0.0578355
+-0.0530625 0.0625594 0.0307632
+-0.0510483 0.053037 0.0206135
+-0.0505791 0.0488657 -0.00826795
+-0.0426076 0.0338549 0.0069173
+0.0392521 0.0940728 0.0323259
+-0.0394892 0.0846821 0.0435801
+-0.0451321 0.0560164 0.0386443
+-0.00431394 0.0929621 -0.0345661
+-0.0559672 0.149602 0.0296453
+-0.0635672 0.159894 -0.0552656
+-0.0854828 0.0924603 0.0282645
+-0.000403311 0.102922 0.0441774
+-0.0728513 0.077742 0.0372898
+-0.0264927 0.0850795 0.0502634
+0.00748229 0.118415 -0.0155852
+-0.0301257 0.165235 -0.016018
+-0.00266679 0.0554838 -0.0324138
+0.0588141 0.0660698 0.0217199
+-0.0227042 0.0651451 0.0456598
+-0.0254758 0.0447668 0.0519525
+-0.0221249 0.165275 -0.017299
+-0.0673863 0.146352 -0.0244353
+0.0358297 0.112651 0.00431137
+-0.0600953 0.0345101 0.0398512
+-0.0315135 0.112545 0.0354646
+-0.0495533 0.0335732 0.00214603
+0.00748118 0.122397 -0.0118721
+-0.017033 0.0949215 -0.0326512
+-0.0465027 0.162256 0.00645028
+-0.0377072 0.0695284 -0.0160926
+0.0515389 0.0638758 -0.00198972
+-0.0406583 0.0577787 -0.0115563
+-0.078333 0.108337 0.035368
+-0.00970184 0.120973 -0.0121849
+0.0223756 0.0822421 0.0500191
+-0.0598969 0.0982824 -0.0189251
+-0.000418527 0.128183 0.0282442
+0.0398162 0.107019 0.0141667
+-0.0275139 0.118013 0.031246
+-0.0270215 0.0563432 0.0375362
+0.0105198 0.130786 0.00926843
+0.00339772 0.0418993 -0.0241367
+-0.0275013 0.113896 0.0350206
+0.0202412 0.0763232 -0.0271232
+-0.0919625 0.126955 0.0342506
+-0.0433008 0.0345877 0.0364134
+0.0433553 0.0860087 -0.00480358
+0.0208045 0.119446 -0.00872458
+-0.0930264 0.120177 0.0342925
+-0.0379377 0.157973 0.00463177
+-0.0253167 0.177183 -0.0103739
+-0.0366224 0.0519804 -0.0105023
+-0.0707047 0.079127 0.0393559
+-0.0260772 0.0606359 0.0392914
+-0.0238556 0.126292 0.00669874
+0.00550694 0.0561304 0.0532033
+-0.0537237 0.147766 0.0244131
+-0.0691531 0.167331 -0.0231015
+-0.0596786 0.0738084 0.0412039
+0.0326792 0.103442 0.0351236
+-0.0614661 0.174127 -0.0585981
+-0.0717687 0.0836085 -0.0162896
+-0.0457927 0.0869975 -0.0219586
+0.0105224 0.0990052 0.0483243
+-0.0829648 0.129479 -0.00406234
+-0.0356761 0.0343506 0.0364799
+-0.0884531 0.0888833 0.0214341
+-0.0627252 0.0416196 0.0257026
+-0.0564562 0.159872 0.00406757
+-0.0891671 0.0942549 0.0124334
+0.00850148 0.0561026 0.0528172
+-0.0897269 0.113038 0.0361809
+0.0510319 0.0481609 0.0243415
+-0.0355318 0.0341909 0.0278174
+0.0439268 0.0945301 0.0211547
+-0.0579061 0.0357757 0.046064
+-0.0154366 0.0383652 0.00473292
+-0.0175221 0.187321 -0.0198494
+-0.00549946 0.0842482 0.0569765
+0.0601999 0.0678503 0.0111396
+0.0144807 0.0658974 0.0525165
+0.0293268 0.0963357 -0.0179631
+-0.0397817 0.126122 -0.00537397
+0.0345713 0.109241 -0.00571538
+0.0142478 0.0846938 0.0523116
+-0.00151223 0.107257 0.0435513
+-0.0568094 0.0336832 0.0202688
+-0.00449913 0.108643 0.0435023
+0.0366018 0.0989128 -0.0107075
+-0.0520805 0.0552272 0.0244826
+-0.0564227 0.125779 -0.00685719
+-0.045508 0.0519257 0.0382686
+0.0321211 0.116144 0.000111339
+-0.0560271 0.142758 -0.00201441
+-0.0204991 0.12085 0.0318342
+-0.0572069 0.155002 0.0203881
+-0.0683862 0.0434928 0.00469407
+-0.0749362 0.167415 -0.0237916
+0.00950453 0.0758273 0.0557308
+0.0134626 0.0962698 0.0490469
+-0.0352581 0.0336435 0.0104036
+0.0033475 0.0524625 -0.0299019
+-0.0200406 0.0417644 0.0532372
+-0.020634 0.03806 0.0202475
+-0.0354822 0.0590569 0.0395591
+-0.0633421 0.145588 -0.0131138
+0.0560276 0.0714782 0.0201554
+-0.034079 0.157748 -0.0116645
+0.0430592 0.0871926 0.0271788
+-0.067061 0.0617728 0.0200983
+0.0054202 0.0385344 -0.0060218
+-0.0562382 0.115455 0.0360976
+0.0318915 0.0727133 0.0408308
+0.00701986 0.131464 0.0165435
+-0.00758439 0.038449 0.00988421
+-0.0401838 0.128459 0.00507702
+0.0467715 0.0482711 0.0287479
+-0.0918049 0.126804 0.00826817
+-0.0821184 0.0782385 0.0256306
+-0.0812562 0.103354 0.0307723
+-0.0639536 0.144435 -0.0123561
+-0.0108662 0.129871 0.00999779
+0.0155048 0.112635 0.0385412
+0.0182534 0.0792348 -0.0283217
+-0.0893331 0.0983151 0.0114073
+-0.00325216 0.0396403 0.0476826
+-0.0241255 0.089259 0.0519927
+-0.0858632 0.106258 0.00536057
+0.00408474 0.0346021 -0.0158016
+-0.0407936 0.0869784 -0.0214607
+-0.0166484 0.0480949 -0.029815
+-0.0157153 0.0613848 -0.0360938
+-0.0566239 0.0482507 0.0375737
+-0.0424946 0.0619914 0.040787
+-0.0676789 0.0735575 -0.0139417
+-0.00550026 0.0815011 0.0573318
+-0.0466697 0.166955 -0.00590454
+0.050335 0.0531616 -0.00370253
+-0.075448 0.162419 -0.0329687
+-0.0614914 0.089051 0.0454546
+-0.0467107 0.0709021 -0.0159388
+0.0485116 0.0611011 0.0306918
+0.0308141 0.0862286 0.0429136
+0.041033 0.0788113 -0.0077656
+-0.0332536 0.0434286 -0.0288825
+-0.0599631 0.0455474 0.028679
+-0.0106693 0.0383927 0.00930564
+0.00450171 0.04895 0.0512539
+-0.0567297 0.0738308 -0.0175741
+-0.0395016 0.128216 0.0127148
+-0.0236465 0.18441 -0.0150532
+-0.0541007 0.0517729 -0.00535724
+-0.00963566 0.0383633 0.0204127
+-0.072501 0.11898 0.053434
+-0.072483 0.0356257 0.00284128
+-0.0164962 0.0815146 0.0575151
+0.0321311 0.10568 -0.0119259
+-0.0628015 0.0867155 -0.0190743
+-0.0747157 0.155426 0.0258403
+-0.0655092 0.0986926 0.0420188
+-0.0621042 0.153787 0.0317461
+0.0075074 0.0702645 0.0557506
+-0.0873725 0.140519 0.00919988
+-0.0816979 0.073476 0.0105355
+-0.0251078 0.125921 0.00624226
+0.0143125 0.129601 0.0135477
+0.0537172 0.0701657 0.00367339
+-0.0658178 0.165764 -0.0247368
+-0.0706171 0.164859 -0.0164358
+-0.0268181 0.0385613 -0.0106363
+-0.0308492 0.121938 -0.00695618
+-0.0240991 0.0708914 0.0469009
+0.00836584 0.0509624 -0.0290525
+0.0146552 0.0361528 0.0436042
+-0.0759244 0.155422 0.00936737
+0.00291872 0.0383891 0.0247663
+-0.0483005 0.12541 0.0300666
+0.00749081 0.093253 -0.0307631
+-0.0441374 0.160646 -0.00957119
+-0.0454954 0.0945383 0.0433792
+0.0153865 0.0350801 0.00287497
+-0.0507565 0.078263 -0.0192091
+-0.014682 0.0540945 -0.0332776
+-0.0697195 0.0625059 0.018914
+-0.0850789 0.151288 0.0289026
+0.000998881 0.131517 0.0100563
+-0.0866192 0.111201 0.0383037
+-0.0257526 0.069725 -0.0351721
+-0.0832913 0.0938266 -0.00556456
+-0.00149798 0.121047 0.037107
+-0.0164922 0.103019 0.043564
+-0.00175716 0.0797524 -0.0362245
+-0.065193 0.165273 -0.0595568
+-0.00746087 0.0391472 0.0345828
+-0.0384976 0.0790115 0.0428361
+-0.00149834 0.095227 0.054625
+-0.00277478 0.078376 -0.0365291
+-0.0780329 0.155476 0.0217657
+-0.0632159 0.147647 -0.016402
+-0.0801569 0.0817921 0.0331577
+-0.0500022 0.16408 -0.00389251
+-0.0747874 0.0892505 -0.0147771
+-0.00949475 0.122405 0.0348735
+-0.0322196 0.0423712 0.0501883
+-0.00876131 0.174216 -0.0276966
+-0.0545091 0.161256 6.9518e-05
+0.0181832 0.102054 0.0457705
+-0.0604933 0.102915 0.04183
+0.0437773 0.0804492 0.0262342
+0.0388648 0.0842467 -0.0137667
+-0.00550336 0.0647558 0.0562438
+-0.0929299 0.122874 0.0352771
+-0.043447 0.0338958 0.0281851
+-0.0649274 0.155826 -0.0455264
+-0.00117719 0.0381217 -0.0144579
+-0.0146742 0.180146 -0.0213737
+-0.0911602 0.113316 0.0133388
+0.0114933 0.0990667 0.0482243
+-0.030492 0.093206 0.0443051
+-0.00885946 0.13031 0.0150517
+-0.073851 0.0979023 -0.0138506
+0.00349864 0.0505127 0.0525247
+0.0579498 0.0621469 0.0239372
+-0.0266127 0.121438 0.026306
+-0.0640364 0.138454 -0.00746704
+-0.0881537 0.0875035 0.020457
+-0.0693202 0.16097 -0.0509443
+-0.0258632 0.0384431 -0.0103374
+-0.0445084 0.162276 0.00597583
+0.002127 0.0994865 0.0488443
+-0.00523434 0.128086 0.0279795
+0.0441694 0.0706598 0.0245614
+0.00913312 0.10443 -0.020596
+-0.00849151 0.104452 0.0437135
+-0.0709552 0.134052 -0.00817596
+0.040546 0.0860518 0.0323351
+0.026933 0.109961 -0.012516
+0.0171797 0.119654 -0.0109592
+-0.0154871 0.10859 0.0421893
+-0.0544999 0.0945829 0.0441089
+-0.0942376 0.122836 0.024283
+0.0145822 0.10067 -0.0225932
+0.0416553 0.0900846 -0.00877196
+-0.0627089 0.0722313 -0.0153832
+-0.0265055 0.0946665 0.044662
+-0.0241067 0.108647 -0.0210644
+-0.0475093 0.0504634 0.0377677
+-0.0271626 0.0836755 0.0495254
+-0.0707023 0.155807 0.00247134
+0.0113316 0.0343299 -0.00659923
+0.0271512 0.0740976 0.0445232
+-0.00214312 0.101026 -0.0230018
+-0.0518271 0.094161 -0.0217872
+-0.0685768 0.0699128 0.0338326
+-0.0538957 0.0344051 0.0325721
+-0.0280624 0.17271 -0.00913079
+-0.0710555 0.148357 -0.0346175
+-0.0392482 0.165334 0.00281642
+-0.0494961 0.159354 0.00844009
+-0.0887346 0.0956375 0.0224045
+-0.0856504 0.126624 -0.00269798
+-0.0486707 0.147744 0.0101492
+-0.0735613 0.16372 -0.0149978
+0.0180716 0.0350245 0.0344937
+-0.0307362 0.053835 -0.015374
+-0.0887393 0.0928617 0.00944255
+-0.016725 0.0627999 -0.0362248
+-0.0190611 0.063953 0.0505398
+-0.0441816 0.0346721 0.0413945
+-0.0593157 0.126918 0.0405689
+-0.0111259 0.174182 -0.0282833
+-0.0436679 0.0621935 -0.0131864
+0.0275209 0.088828 -0.0220264
+-0.0297851 0.0890261 -0.0295849
+-0.0303849 0.154168 -0.00247422
+-0.0425281 0.128954 0.00568377
+0.0162787 0.126801 -0.0006607
+-0.0727179 0.0806647 -0.0147187
+-0.0753424 0.0928083 0.039305
+-0.0798316 0.111318 -0.00180655
+0.0192462 0.0346832 0.00400718
+-0.088108 0.129743 0.0452172
+-0.0103013 0.038437 0.0111565
+-0.0466082 0.166842 0.00289141
+-0.0459915 0.152139 0.00880917
+-0.02765 0.0504128 -0.0240838
+-0.00316977 0.101093 -0.0230747
+-0.081903 0.123614 -0.00465545
+0.0308134 0.104771 0.0359398
+-0.0649698 0.0444252 -0.000282601
+-0.0411724 0.128614 0.0047134
+-0.0566724 0.0661356 -0.00992741
+-0.0768027 0.1218 0.0526081
+0.0286707 0.0432432 0.0323583
+-0.0776442 0.112189 0.0467134
+-0.0599288 0.0595089 0.00385673
+-0.0751102 0.148577 -0.0168689
+-0.0422557 0.0435263 -0.021317
+-0.0109825 0.18157 -0.0273657
+0.0160657 0.128852 0.0141586
+0.0353395 0.113619 0.00703904
+-0.0746273 0.149901 -0.0298709
+-0.0108803 0.105927 -0.0227775
+-0.0134961 0.0472092 0.0480936
+0.0366578 0.0576635 0.0335112
+-0.019761 0.0984382 0.0445534
+-0.0662568 0.117183 0.0498756
+-0.0659606 0.17389 -0.0478108
+-0.0116079 0.0434695 -0.0263093
+-0.0926722 0.117507 0.0393006
+-0.0764843 0.145607 0.0435529
+-0.0467321 0.0337537 0.00617309
+-0.0558876 0.104087 -0.0189213
+-0.0920931 0.126941 0.031257
+-0.0204778 0.086949 0.0559493
+0.0205756 0.0550317 0.0471809
+0.0164894 0.10985 0.0397676
+-0.0639427 0.125311 -0.00880074
+-0.0233699 0.0380458 0.0160874
+0.00571651 0.037694 -0.0126956
+-0.0305064 0.059434 -0.0194047
+-0.0286182 0.0422955 -0.0294891
+-0.074262 0.155148 0.0274653
+-0.0780672 0.161102 -0.0219327
+-0.0710541 0.174778 -0.0424234
+-0.0641619 0.126957 0.0459503
+-0.0724375 0.0643068 0.0185598
+-0.0568864 0.106915 -0.0181412
+0.0293195 0.0995163 0.0407971
+-0.0644558 0.155894 0.01199
+0.00534877 0.131711 0.0116581
+-0.070964 0.169422 -0.0500317
+0.0101411 0.103018 -0.0207697
+0.0413802 0.0547717 -0.00646982
+-0.0385096 0.0776202 0.0427509
+-0.0239792 0.115969 -0.0147616
+-0.0225483 0.119525 0.0321637
+-0.060198 0.152175 0.0339452
+-0.0535114 0.0452153 0.0437642
+-0.0037319 0.0346421 0.0447442
+0.0102653 0.0944766 -0.0280245
+0.0270364 0.0347184 0.00926922
+-0.0660514 0.11246 0.0412419
+-0.0427238 0.072521 -0.0180673
+-0.057924 0.0453324 0.0266819
+0.0321473 0.0354374 0.0133726
+-0.0750002 0.0776536 0.0352037
+-0.0404922 0.11531 0.0337051
+-0.0201478 0.16826 -0.0196016
+-0.0263171 0.178663 -0.00829314
+0.0232364 0.0706221 -0.0263108
+-0.0228968 0.117028 -0.0138782
+-0.0477554 0.130992 0.0255865
+-0.05149 0.104281 0.0405196
+-0.00121687 0.120006 -0.0132177
+-0.0299396 0.0649723 -0.0274594
+-0.0187899 0.0784905 -0.0388371
+-0.0498267 0.109983 -0.0185775
+0.00334971 0.0510613 -0.029847
+0.0259096 0.0534724 0.0407837
+-0.0455367 0.111121 -0.0175743
+-0.0124237 0.0348026 0.0445556
+-0.0887181 0.123977 0.00228597
+-0.088156 0.151596 0.0228856
+-0.0530084 0.149326 0.0224058
+0.0191744 0.125775 0.0238749
+-0.0735068 0.118971 0.0531919
+-0.0585002 0.0987496 0.0428962
+-0.0310887 0.159271 -0.0130615
+0.000886159 0.12297 -0.0104051
+-0.0872227 0.0941086 0.00335062
+-0.0273424 0.0931435 -0.0275899
+0.0213306 0.126248 0.00896939
+0.0549036 0.0506667 0.00319831
+-0.0245658 0.115393 0.0346209
+-0.0908157 0.133668 0.01022
+0.011387 0.126452 0.0296316
+0.0342091 0.0430428 0.0288022
+-0.0759039 0.154928 -0.00089291
+-0.0834635 0.136224 -0.000676656
+-0.0242249 0.124407 -0.00155437
+-0.00949715 0.103034 0.0436292
+-0.0448632 0.102817 -0.0213129
+-0.0762912 0.162417 -0.0319674
+-0.087261 0.137734 0.00520439
+0.0359972 0.0915666 0.0381116
+0.0515419 0.0610093 0.0297195
+-0.0759846 0.168851 -0.0284951
+0.0192535 0.076364 -0.0276613
+0.00153258 0.130437 0.0231622
+-0.0552695 0.058846 -0.00542677
+-0.0478299 0.094184 -0.0219241
+0.0413096 0.0957202 -0.00478826
+0.00646546 0.131591 0.014917
+-0.0921802 0.132348 0.0172238
+-0.00096127 0.131397 0.0150615
+0.0373767 0.0519575 -0.00666499
+0.000499624 0.0661631 0.0564081
+-0.0624427 0.149095 -0.00857615
+-0.0158277 0.127263 0.00131837
+-0.0534778 0.0544994 -0.00645482
+-0.0393097 0.122071 -0.0111029
+-0.0552136 0.0346314 0.0441945
+-0.062546 0.0614527 -0.00215685
+0.0190515 0.0781917 0.0522129
+-0.00645816 0.122156 -0.0114796
+0.0547648 0.068691 0.024634
+-0.0165146 0.104417 0.0427511
+-0.0914381 0.133727 0.0162105
+-0.0621573 0.163143 -0.0375929
+-0.0927674 0.130992 0.0172311
+0.00308348 0.0981539 0.0507387
+0.0223728 0.0658814 0.0463438
+-0.039497 0.060614 0.0410267
+-0.0547684 0.0513541 0.0102674
+0.00252507 0.0561606 0.0537161
+-0.0427018 0.0681213 -0.0161497
+0.0102881 0.063916 -0.0312717
+-0.0443833 0.12939 0.00495951
+-0.0186027 0.160444 -0.0128213
+0.0371116 0.111176 0.0148387
+0.0282213 0.0875505 0.0444323
+-0.0274771 0.120676 0.0274866
+-0.0584936 0.0439589 0.0439647
+0.0240603 0.0822578 0.0489414
+0.0351443 0.071382 0.0384881
+-0.0164918 0.0897515 0.056205
+-0.0781864 0.161095 -0.0229348
+-0.0701455 0.111146 0.0439061
+-0.00742751 0.0346718 0.0457358
+-0.0757375 0.106056 0.0359296
+-0.0735163 0.138649 0.0485985
+-0.0786866 0.073183 -0.00146774
+-0.0425028 0.11664 0.0325093
+-0.0294965 0.105676 0.0405837
+-0.0253323 0.089221 0.0503626
+-0.00687638 0.105938 -0.022783
+-0.0680331 0.17369 -0.0570223
+-0.0709606 0.152484 -0.0460812
+-0.0145326 0.0386197 0.0300043
+-0.0284453 0.0903864 0.0448476
+-0.0688215 0.145351 0.0427408
+-0.0488146 0.109958 -0.0184987
+-0.0764868 0.144228 0.0448323
+-0.0204228 0.0384821 -0.0074254
+-0.050433 0.0505709 0.0355945
+0.00517866 0.131021 0.00445011
+-0.0697426 0.08081 -0.0166425
+-0.084857 0.0924919 0.0290512
+-0.00149439 0.0870302 0.0569025
+-0.072621 0.142849 -0.00891964
+0.0127783 0.105278 -0.0195273
+0.00375967 0.0343287 0.0177156
+-0.0724944 0.126022 0.052902
+-0.0520295 0.0429585 0.0453289
+-0.0373786 0.0478297 -0.016773
+-0.0165095 0.0446732 0.0513338
+0.0115347 0.118055 -0.0152175
+-0.0461946 0.0601644 0.0381445
+-0.0730192 0.156843 -0.0319176
+-0.0665818 0.173704 -0.0590137
+-0.0904622 0.133649 0.00822658
+-0.0661919 0.0387353 0.0332699
+0.0285711 0.0632767 0.0429905
+-0.0191373 0.0348399 0.0448528
+-0.0144945 0.115487 0.0386767
+-0.0885619 0.129493 0.00323888
+-0.00509715 0.039098 -0.012386
+0.00551873 0.0842341 0.0568816
+-0.0784525 0.0962411 -0.0105211
+-0.0126763 0.05824 0.052838
+-0.00571704 0.0642049 -0.0354496
+-0.0659809 0.169803 -0.037696
+0.00534315 0.0567731 -0.0307134
+-0.0104849 0.101611 0.0440429
+-0.0320291 0.108616 -0.01899
+0.0442879 0.0415947 0.0193873
+0.0261947 0.0449183 0.0375802
+-0.0626054 0.158425 -0.0185846
+-0.0321937 0.0694259 -0.0234551
+-0.0597828 0.0810723 -0.0197911
+-0.0274915 0.0602914 0.037483
+0.0278788 0.120142 0.00144262
+-0.00359535 0.0391334 -0.025473
+-0.0104902 0.0619157 0.0554492
+-0.0851123 0.133936 0.0477712
+0.0133897 0.0389058 -0.0222843
+-0.0778477 0.159718 -0.0189229
+-0.0817169 0.081448 -0.00456785
+0.00880568 0.131337 0.0114907
+-0.0885025 0.144515 0.032494
+0.00248318 0.0413744 0.0461608
+0.0393065 0.105567 0.023165
+0.0485408 0.0662379 -0.000364329
+-0.074114 0.159638 -0.0309374
+-0.0656277 0.0636798 0.0258038
+0.0326128 0.0934199 -0.0168733
+-0.0691845 0.152183 -0.0467119
+-0.0356328 0.0347409 0.0201566
+-0.067463 0.166618 -0.0559977
+0.0410852 0.0860175 0.0313838
+-0.0465484 0.0404249 0.0444582
+-0.0884823 0.147207 0.0295866
+-0.047064 0.168385 -0.0010022
+0.0204505 0.044377 -0.0207645
+-0.0460107 0.0426896 -0.0115747
+-0.0892694 0.136527 0.0301984
+-0.00170296 0.0612915 -0.034176
+0.016206 0.0927227 0.0499244
+-0.0816886 0.154881 0.0175845
+-0.0434863 0.0776041 0.0427475
+-0.0883068 0.098239 0.00641854
+-0.045625 0.056311 -0.011298
+-0.0524843 0.150872 0.017395
+-0.0641668 0.0334738 0.00287677
+0.0361211 0.0586877 -0.0107678
+0.0141254 0.0589894 0.0501816
+-0.0864962 0.112872 0.0280752
+-0.0863885 0.112851 0.0441987
+-0.0524922 0.0384865 -0.0115467
+-0.0776496 0.163935 -0.0239336
+-0.0554697 0.0345193 -0.0117205
+0.0176795 0.0740469 0.0519763
+-0.0728932 0.0642808 0.0113714
+0.0261658 0.0809584 -0.0239333
+0.058376 0.0713467 0.0136326
+0.0257313 0.0968616 0.0444005
+0.00516452 0.0344202 0.0197338
+-0.0686185 0.0687175 -0.00655491
+-0.0803464 0.147298 -0.000827063
+0.000190276 0.131527 0.0154789
+-0.0687909 0.0354139 0.0127136
+-0.05562 0.146743 0.0301728
+0.0240878 0.0645552 0.0452968
+0.0313304 0.0475675 0.0327114
+-0.0107396 0.0713653 -0.0375278
+-0.0444884 0.0733739 0.0424053
+-0.0892862 0.137904 0.0301929
+0.0430064 0.0930319 -0.00281527
+0.00152278 0.0688979 0.0560686
+0.02743 0.0663837 -0.0217206
+-0.0610765 0.167736 -0.0598039
+0.0469057 0.0738955 0.00933063
+0.010569 0.0630758 0.0538717
+-0.0636657 0.175908 -0.0542108
+-0.00887643 0.105922 -0.0227472
+0.0366768 0.0861722 0.0373065
+-0.00750518 0.0661146 0.0558703
+-0.0311481 0.174122 -0.0158676
+0.0165049 0.115408 0.0369209
+-0.0599957 0.135288 0.0360766
+0.023446 0.0385037 -0.00396461
+-0.0512658 0.0335234 0.00365116
+-0.0640041 0.0417908 0.0276702
+0.0505407 0.062451 0.0297568
+0.0381071 0.0767371 0.0357901
+0.0348186 0.114435 0.00971518
+-0.0808584 0.15153 0.0328055
+-0.0292731 0.0691492 -0.0304581
+-0.0482843 0.133992 0.00441773
+-0.0151264 0.0382524 0.0175843
+0.0457402 0.0749932 0.00321166
+-0.0514912 0.0529568 0.0308804
+-0.0841758 0.0777074 0.00551439
+-0.0724891 0.168081 -0.0228518
+-0.0578499 0.140998 0.0321632
+-0.0824678 0.0844329 0.0311552
+-0.035201 0.0380831 0.0475916
+-0.0225654 0.0336394 -0.0239171
+0.0463796 0.0792543 0.0131749
+0.0210505 0.125312 0.00175976
+-0.0835133 0.0843594 0.0293933
+-0.00767881 0.0555674 -0.03337
+-0.052489 0.159007 -0.00340529
+-0.0244459 0.156552 -0.00701262
+-0.0598434 0.0384999 0.0207227
+-0.0725078 0.160609 -0.0083559
+0.0429565 0.0986678 0.00218951
+-0.00967767 0.118026 -0.0150602
+0.038419 0.105512 0.0261645
+-0.00651495 0.0746355 0.058305
+0.0450144 0.0945871 0.00816469
+-0.0454802 0.123445 -0.0105099
+-0.00122028 0.0938312 -0.0334376
+-0.067038 0.143551 -0.013347
+0.043578 0.0888313 -0.0037919
+-0.0238161 0.078256 0.0534268
+-0.0455234 0.131922 0.0119481
+-0.0735087 0.137262 0.0493527
+-0.0183224 0.184952 -0.0232094
+-0.0148238 0.091051 -0.0367095
+-0.000496937 0.0620135 0.0565388
+-0.0217336 0.0611778 -0.0340471
+-0.0922703 0.125567 0.0322584
+0.0255559 0.0952317 -0.0208124
+-0.0748894 0.152721 -0.0218881
+-0.0770206 0.0981288 0.0365817
+-0.0262775 0.073604 0.0447421
+0.00842909 0.131472 0.01278
+-0.0815194 0.125984 0.0522053
+-0.0768497 0.156895 -0.0209209
+-0.0774933 0.0717304 0.000534742
+-0.0610597 0.172553 -0.0606091
+-0.00957846 0.178815 -0.0287373
+-0.062208 0.167823 -0.0505845
+-0.0225076 0.125867 0.0188793
+-0.0580565 0.0334897 0.00410791
+-0.00649004 0.112763 0.0415025
+-0.00176067 0.0755229 -0.0360316
+0.0456774 0.0904203 0.00916591
+0.0441351 0.0749462 0.0250125
+-0.0810675 0.11076 0.0435122
+0.00990869 0.048971 0.0492516
+-0.0728744 0.10362 -0.0122376
+0.0374772 0.106859 -0.00183322
+0.0151574 0.0988592 -0.0229537
+-0.016863 0.0640072 0.0526042
+-0.0418006 0.0462579 -0.0152948
+-0.0768234 0.0927696 0.0379671
+-0.0661935 0.155092 0.00556387
+-0.0810703 0.0752023 0.0214152
+-0.0235527 0.156826 -0.00518035
+-0.0194871 0.0883195 0.0557235
+-0.0716986 0.077793 -0.0140498
+-0.010631 0.0389663 -0.00962591
+-0.0570892 0.0602319 -0.00257411
+-0.0419839 0.128576 0.0133734
+-0.0151399 0.0382506 0.0121533
+-0.0759996 0.139851 -0.00609906
+-0.0506105 0.0694238 0.0381651
+-0.0658919 0.11864 0.0504465
+-0.0528899 0.106976 -0.018917
+-0.0521172 0.0545658 0.0256302
+-0.005498 0.103045 0.0437796
+-0.0524893 0.156469 0.0106374
+-0.0439563 0.147482 -0.0018962
+0.00349012 0.116915 0.0395094
+-0.0116538 0.0496371 -0.0310034
+-0.0360677 0.156277 -0.0104898
+0.0262747 0.0376552 0.0265482
+0.00369465 0.0390982 -0.00688719
+0.037401 0.0414131 -0.00242752
+-0.010004 0.0383201 0.0185669
+-0.0807853 0.0817556 0.0323751
+-0.00609738 0.037339 0.0487481
+-0.0254987 0.0945485 0.0446378
+-0.0446176 0.0345408 0.0396657
+-0.0522913 0.124591 -0.00759738
+-0.0244524 0.16187 -0.0148048
+-0.0144465 0.128429 0.00434765
+-0.0238211 0.0384511 -0.00993154
+0.0184111 0.122524 0.0307587
+-0.0815439 0.112456 0.0456165
+0.0549908 0.0567623 0.0266396
+0.0309112 0.0754873 0.0429619
+-0.0278697 0.103003 -0.0233536
+-0.0640545 0.149152 -0.0269946
+-0.0594536 0.133932 0.0368692
+0.0130152 0.130057 0.0144613
+0.0491953 0.0732159 0.0116573
+-0.0364993 0.0733348 0.0420574
+-0.0859116 0.107692 0.0193681
+0.0386236 0.109277 0.0110826
+0.00584547 0.0353648 -0.01428
+0.0198737 0.0358544 0.0359282
+-0.0174269 0.182963 -0.0250022
+0.0258436 0.0563286 -0.0217568
+0.0362122 0.112176 0.0188059
+-0.0564979 0.0805451 0.0445004
+0.0450117 0.0805305 0.000199058
+-0.043786 0.126623 -0.00583839
+0.0366462 0.100736 0.0320541
+-0.0198519 0.0357263 0.0525976
+-0.0872471 0.125707 0.0473263
+-0.0180735 0.0611876 0.0510587
+-0.0608049 0.0596005 0.019786
+0.0269735 0.121605 0.0224835
+0.033449 0.0380742 0.000639692
+-0.0174889 0.0856455 0.0572522
+-0.0298765 0.0607745 -0.022409
+-0.0371209 0.127449 0.0017956
+-0.0397839 0.0471068 -0.0160895
+-0.0245336 0.118082 0.0325274
+-0.0715136 0.0887445 0.0416191
+0.00419323 0.0880606 -0.0335488
+0.0353118 0.0520079 -0.00674902
+-0.00049849 0.101653 0.0443576
+-0.0570055 0.133804 -0.00545801
+-0.0215772 0.158162 -0.00503193
+-0.0640639 0.0351963 0.0227232
+-0.00287353 0.108795 -0.0218002
+0.0462936 0.0792458 0.00718673
+-0.00951316 0.0575536 0.0537045
+-0.0477812 0.0840973 -0.0215817
+-0.0526608 0.0504363 0.0276515
+-0.0340312 0.123966 -0.00509105
+0.00648697 0.11688 0.0387497
+0.0343069 0.0578226 0.0371782
+-0.0220745 0.169763 -0.0127977
+-0.0106374 0.0466553 -0.0295813
+0.0335656 0.114779 0.000629741
+-0.0269131 0.180109 -0.00739997
+0.0390081 0.105539 0.000161276
+-0.00175381 0.0993639 -0.0251444
+0.040909 0.0985658 0.0261474
+-0.0617277 0.159994 -0.0345941
+-0.0434138 0.111151 -0.0176174
+0.0319241 0.0700307 0.0408624
+-0.0349471 0.109117 -0.019515
+-0.0733885 0.111282 0.0466166
+0.0354121 0.0430461 -0.00417186
+-0.093028 0.117371 0.013308
+-0.0756832 0.149968 -0.01987
+0.0201512 0.0605237 0.0483852
+-0.0639979 0.158311 -0.048587
+0.0410638 0.0928718 -0.0077952
+-0.0845757 0.151155 0.0298105
+-0.0752762 0.167899 -0.0253615
+0.0587584 0.0580034 0.00517536
+-0.070971 0.166609 -0.0480118
+-0.0488701 0.10281 -0.0210946
+-0.0609926 0.128204 -0.00783795
+-0.0772884 0.155547 -0.0128979
+0.0120566 0.130535 0.0112565
+-0.0655484 0.039711 0.0142785
+-0.0465128 0.0438401 0.043121
+-0.0215234 0.0739469 0.0526909
+0.0238579 0.0490757 0.0395236
+-0.00446924 0.111373 0.0424038
+-0.0646993 0.150616 -0.0327557
+-0.0547216 0.118372 0.0366122
+0.055991 0.067441 0.024671
+-0.0164973 0.0485745 0.0476342
+-0.0243246 0.0415463 0.0540712
+-0.0679818 0.0653371 -0.00356488
+-0.0887934 0.125677 0.0460403
+-0.0672794 0.176766 -0.0591515
+-0.0201696 0.169725 -0.0202727
+0.0232197 0.0818757 -0.0256198
+-0.0521106 0.0503642 0.0236349
+-0.00378569 0.0826645 -0.03749
+0.0103848 0.03606 -0.0224393
+0.0144027 0.129384 0.00642559
+0.0154718 0.101771 0.0468044
+-0.0222044 0.174173 -0.0211642
+0.0605561 0.0664891 0.0161665
+-0.0110072 0.128401 0.0244439
+0.00979123 0.127622 -0.00353983
+-0.0586426 0.0335837 0.0110854
+-0.0324964 0.0518418 0.0373712
+0.0339681 0.114736 0.0222644
+-0.0278327 0.179989 -0.0150111
+0.0505141 0.0610459 0.0301699
+-0.084345 0.0818627 0.0244959
+-0.0780694 0.106243 0.0333548
+-0.0400434 0.149481 0.00241998
+0.0415851 0.0779004 0.0302476
+-0.0934884 0.117419 0.0203018
+0.0145324 0.0686382 0.0526166
+0.0105088 0.0546576 0.0523588
+-0.0166719 0.128014 0.0194984
+0.0111864 0.115382 -0.0163281
+0.0433489 0.0761902 -0.00378764
+0.00361131 0.0929227 -0.0324448
+0.0374765 0.0967619 0.0332563
+0.0118435 0.0418607 0.0449613
+0.00151372 0.070315 0.0563646
+-0.089555 0.092956 0.0194329
+-0.0309867 0.0458642 -0.0271867
+-0.0127025 0.0628523 -0.0366298
+-0.0211402 0.175693 -0.0149194
+-0.0410644 0.0466663 -0.0156422
+0.0229642 0.0564103 0.0453711
+-0.0689131 0.06155 0.0163724
+-0.0351956 0.0394954 0.0475468
+0.0545544 0.0478595 0.011201
+0.0307617 0.0848812 0.0428147
+-0.0854234 0.100771 0.000422318
+-0.00263926 0.0481807 -0.0301073
+0.0341204 0.0781827 0.0405841
+-0.0753485 0.151324 -0.0238793
+-0.040104 0.0359968 0.0427867
+0.00880995 0.127795 -0.00370552
+-0.0546717 0.0587861 -0.00643621
+-0.0527782 0.0338002 0.0103069
+-0.0644915 0.087588 0.0448694
+-0.0649403 0.125308 -0.00887181
+-0.0623267 0.035582 -0.00867786
+-0.0178682 0.127784 0.00598386
+-0.0477624 0.119115 -0.0139706
+-0.0272958 0.178509 -0.0169626
+-0.036773 0.0446897 0.0419462
+-0.0643144 0.0445281 -0.000908113
+0.0310215 0.117934 0.00259488
+-0.0657027 0.155342 0.0275329
+0.00812544 0.105869 -0.0206053
+-0.0845132 0.150109 0.0051703
+0.0147267 0.0343671 -0.00408399
+-0.0738652 0.150214 0.0382196
+-0.0396346 0.151103 -0.0056598
+-0.0548476 0.0665624 0.0361422
+-0.053656 0.116868 0.0345992
+0.0407085 0.0956949 -0.00580768
+-0.0407505 0.126266 0.0196745
+0.0327193 0.0632979 0.0402054
+-0.0423878 0.124291 -0.00941969
+0.0148847 0.0378033 0.0441286
+-0.0385893 0.036902 -0.00962928
+-0.0735502 0.095526 0.040254
+-0.0625469 0.169393 -0.0495927
+-0.0666556 0.0360676 0.0353877
+0.00702297 0.127188 0.0294846
+0.0123661 0.0479119 -0.026429
+0.00707963 0.0365612 -0.00575515
+0.00660499 0.0617786 0.0553203
+-0.056364 0.156406 0.0105108
+-0.02141 0.0511007 0.0448554
+-0.0417892 0.0855226 -0.0213401
+-0.0454873 0.0789625 0.0423892
+0.0541155 0.0731329 0.017974
+0.0124978 0.092313 0.0523832
+-0.0184886 0.0801089 0.0571361
+-0.0426749 0.0622014 -0.0131851
+-0.0711139 0.162407 -0.0449498
+-0.0234912 0.0474961 0.0510145
+-0.0722633 0.0367738 0.0082856
+-0.0207862 0.0638606 0.0480406
+-0.0570496 0.0562866 0.00362097
+0.023226 0.077646 -0.0258357
+0.00592655 0.0339685 0.0148513
+0.0327331 0.0942636 0.0404449
+0.0170625 0.0448711 0.043693
+0.0335588 0.0862851 0.0416032
+-0.0588111 0.0334057 -0.00501142
+-0.0718597 0.148728 0.0404251
+-0.0700765 0.0619608 0.0139832
+-0.0302069 0.174221 -0.00514504
+-0.088803 0.151599 0.0211964
+0.0155832 0.0893609 -0.0286847
+0.0270636 0.120631 0.00113345
+0.033576 0.0781814 -0.0177928
+-0.0894235 0.0942851 0.0164251
+-0.0386513 0.0344774 0.0357393
+-0.0348698 0.176878 -0.00628812
+-0.0102548 0.179004 -0.0295955
+-0.0708792 0.115031 -0.00817569
+0.0203316 0.0551325 -0.0272049
+-0.0942207 0.120117 0.0202902
+-0.0704743 0.121802 0.053345
+0.0441954 0.0847004 0.0251589
+-0.0662148 0.171945 -0.0435535
+-0.0579078 0.0494657 0.0056917
+-0.0364996 0.0789928 0.0425809
+0.00849936 0.0744764 0.056192
+-0.0263916 0.0563779 0.0383176
+-0.0556017 0.0336949 -0.0101219
+-0.0593537 0.140997 0.0335026
+-0.0941834 0.120103 0.0162919
+0.0184196 0.0442138 -0.0226321
+-0.0628603 0.033866 0.0135258
+-0.0229828 0.0566251 0.0433992
+-0.0295276 0.0383617 0.0343291
+-0.0439439 0.166904 -0.00881722
+-0.00750585 0.0633646 0.0562436
+-0.0553809 0.0486564 0.0109541
+0.0106398 0.0390088 0.044914
+0.0440071 0.0846602 -0.00280808
+-0.0184891 0.0743773 0.0548673
+0.0214529 0.0415824 -0.013701
+-0.0137336 0.0383402 0.0141683
+-0.0895155 0.0983259 0.0124123
+0.0129339 0.063079 0.0520141
+-0.0749499 0.112554 -0.00662315
+-0.0128237 0.0855345 -0.0387685
+-0.0175101 0.0381991 0.0207599
+-0.065046 0.0423247 0.012291
+-0.0570589 0.0507155 -0.000374425
+-0.0630045 0.132588 -0.00795426
+-0.0415001 0.0972709 0.0420669
+0.0313679 0.117954 0.0212794
+-0.00373539 0.0684024 -0.0350771
+-0.0896129 0.139294 0.0321884
+-0.0239769 0.0381215 0.0231095
+0.0347467 0.0670098 -0.0158076
+0.0178644 0.101883 -0.0218675
+-0.064813 0.0428917 0.034688
+-0.0618962 0.0443648 0.0286813
+0.0425837 0.100055 0.002186
+-0.056712 0.0708617 -0.0156392
+-0.066713 0.154086 0.0315791
+-0.0348246 0.0872331 -0.0245609
+-0.0155018 0.080076 0.0569734
+-0.0431381 0.128903 0.00398376
+0.0456202 0.0421608 0.019117
+-0.0637474 0.0766435 -0.0177206
+-0.070335 0.0339385 0.00479187
+-0.0452276 0.131073 0.0164666
+0.0175902 0.128186 0.00902123
+-0.0332219 0.0344808 0.0386469
+-0.000130337 0.0395577 0.0357254
+-0.0384117 0.12376 -0.00887525
+-0.0384745 0.0533908 0.0391471
+-0.0105486 0.0921685 -0.035821
+-0.0292627 0.125707 0.0105611
+-0.0740612 0.16798 -0.0430295
+-0.0794475 0.0732175 0.0216948
+-0.0525459 0.0430871 -0.00935537
+-0.0275149 0.0591111 -0.027433
+-0.0608279 0.0910686 -0.0191968
+0.0214831 0.0388585 0.0402401
+-0.0185078 0.0382343 0.0205228
+-0.0193476 0.0973552 -0.0251961
+-0.014626 0.03858 -0.00263697
+0.0364765 0.110061 0.0246179
+0.0394879 0.0499122 0.0322705
+-0.0738314 0.151256 -0.033887
+-0.0276072 0.0488225 -0.0246209
+0.0254616 0.0727112 0.0456024
+-0.054118 0.157553 -0.00229988
+-0.0100751 0.129607 0.0204184
+-0.0507271 0.115538 0.0335799
+-0.064203 0.176904 -0.0544031
+-0.0327997 0.0624741 -0.0154176
+-0.050486 0.0585567 0.0325562
+-0.0115057 0.0716604 0.0558672
+-0.041271 0.0338554 -0.00188008
+0.00149737 0.0969588 -0.0286791
+0.0222207 0.0833264 -0.0261432
+-0.0379669 0.0433397 0.0417712
+0.0433566 0.094461 -0.000803958
+-0.0485055 0.0490796 0.0381424
+-0.0398915 0.109923 -0.0189257
+-0.00650042 0.0533369 0.0530605
+-0.0902689 0.112791 0.0182006
+-0.0256204 0.0436547 -0.0287136
+-0.0432877 0.171276 -0.00598005
+0.00651867 0.0674599 0.0552944
+0.00755739 0.101711 0.046537
+0.0201484 0.0899648 -0.02526
+0.00621941 0.0351341 0.00654928
+-0.0641258 0.0611318 0.00140431
+-0.0841699 0.0979316 0.0296062
+-0.0893171 0.151601 0.0194969
+-0.0509112 0.0517382 0.0331779
+-0.0345095 0.0761212 0.0417709
+-0.0210879 0.0852798 0.0561484
+-0.0647084 0.033787 -0.00655215
+0.0485032 0.0638048 0.0293893
+0.0553414 0.0563023 0.000211666
+0.031191 0.0977616 -0.015509
+-0.0271419 0.168228 -0.0179326
+-0.0594934 0.0832968 0.0436941
+0.00712427 0.107292 -0.0202517
+-0.0670075 0.139964 -0.00790796
+-0.072631 0.169409 -0.0470274
+-0.0668128 0.0894987 -0.0177562
+-0.0638648 0.166212 -0.0336016
+-0.0305285 0.0348948 0.0458677
+-0.07494 0.0707543 0.0282709
+0.0217204 0.105135 -0.0173432
+0.0129112 0.111627 -0.0182976
+-0.0346615 0.0395406 0.0484261
+-0.0244963 0.105758 0.0419767
+-0.0275166 0.057436 0.037149
+-0.071563 0.151347 -0.0436244
+-0.00477478 0.0812297 -0.0373809
+-0.0544968 0.108447 0.0390956
+0.0191276 0.0370481 -0.0116797
+-0.0477678 0.125154 -0.0082648
+0.00907863 0.112423 -0.0191367
+-0.0148223 0.129108 0.012888
+-0.0685095 0.148391 0.0402581
+0.0438124 0.093116 0.0231537
+-0.0295173 0.175738 -0.0052542
+-0.0580932 0.155356 0.0200663
+-0.0140302 0.116852 -0.0157862
+-0.00427283 0.034883 0.0462122
+-0.0365117 0.0860935 0.0436284
+0.0428337 0.0789534 -0.0047828
+0.0143759 0.121374 -0.0108038
+-0.0478629 0.0335429 0.00613354
+0.0399096 0.0632641 -0.00677014
+0.0382182 0.0855917 -0.0147556
+-0.0586226 0.156199 0.00971481
+-0.0768739 0.0698402 0.0216311
+0.0359859 0.0660034 0.0379002
+-0.0517494 0.0782459 -0.0193853
+-0.0836382 0.0870656 -0.00453769
+0.0314216 0.0415146 -0.00377022
+-0.0633942 0.159878 -0.0495887
+-0.0762229 0.149992 -0.0128764
+0.0360298 0.0573371 -0.00970954
+-0.0378631 0.100009 -0.0219618
+-0.0631703 0.172516 -0.0516045
+-0.0893681 0.0902559 0.0194368
+0.0559048 0.0631077 0.000905369
+0.00350533 0.0758855 0.0563752
+0.0327662 0.0475454 0.0312717
+-0.0144964 0.104421 0.0432413
+-0.0925078 0.121485 0.0292837
+-0.0225266 0.123574 -0.00478676
+0.027859 0.114683 -0.0075901
+0.0336358 0.0725575 -0.0168317
+0.0133955 0.0900754 0.0528858
+-0.0320964 0.160758 -0.0138294
+-0.0665218 0.173689 -0.0465659
+-0.0314315 0.062325 -0.0194293
+0.0355057 0.0498307 0.031489
+0.0409937 0.0830284 -0.00976566
+-0.0484259 0.152144 0.0105657
+-0.0760489 0.0702549 0.00053996
+-0.0939567 0.121435 0.0142863
+0.0458128 0.0848143 0.0141708
+-0.088753 0.130866 0.00325856
+-0.0762076 0.0680671 0.0162505
+0.0295583 0.0594698 -0.0188239
+-0.0470685 0.0362699 0.0454096
+0.0515085 0.0678015 0.0264788
+0.0229945 0.0535474 0.0436214
+0.0102584 0.0738736 -0.0323425
+-0.0208293 0.0841002 -0.0385977
+0.013479 0.118711 -0.0139326
+-0.0577142 0.0723919 -0.0167433
+0.0343469 0.0740244 -0.0157906
+-0.0384895 0.050603 0.0393394
+-0.0411819 0.166655 -0.0111213
+-0.0314187 0.0525029 -0.0133876
+-0.0530781 0.119794 0.0354828
+0.0402398 0.0815675 -0.0107641
+-0.0334936 0.0817447 0.0419617
+-0.0284374 0.0381394 0.00411543
+-0.0669412 0.126769 -0.00883964
+-0.089797 0.129515 0.00524651
+-0.0607661 0.0796035 -0.0191344
+-0.0878523 0.0860961 0.00747941
+-0.00447426 0.0385132 0.0213354
+0.0222429 0.0463236 0.0406841
+-0.0167958 0.0799195 -0.0388883
+-0.0714505 0.16941 -0.0490283
+-0.00251639 0.0442645 0.0466529
+-0.0648891 0.0981501 -0.0170112
+0.00754987 0.100371 0.0472771
+-0.0694963 0.16803 -0.0520069
+-0.0920162 0.126943 0.0352547
+0.0233968 0.0355618 0.0133136
+-0.0660161 0.169448 -0.0590294
+-0.0555411 0.128344 0.0372391
+-0.0488244 0.0927169 -0.0215945
+0.0343104 0.114465 0.0209626
+-0.0501985 0.140132 0.0173988
+-0.0658096 0.0445087 0.000718728
+-0.0512856 0.136981 0.000438627
+-0.0269157 0.0703179 -0.0345192
+-0.0636699 0.112355 0.0376208
+-0.0754912 0.144221 0.0449451
+-0.062524 0.167829 -0.0475902
+0.030542 0.0511254 -0.0127382
+-0.0237052 0.0596068 -0.0321069
+-0.0547922 0.153188 0.0241866
+-0.0414961 0.0902351 0.0425692
+-0.0494981 0.0477699 0.0395132
+0.0289271 0.110086 0.0349831
+-0.0402206 0.0433137 -0.0233156
+-0.0246897 0.0560336 -0.0294195
+0.00733033 0.058195 -0.0305865
+-0.0633574 0.155908 0.0123853
+-0.0679376 0.162368 -0.0549778
+-0.0588165 0.0667309 0.0351477
+-0.0598716 0.0453976 -0.00333599
+-0.0238165 0.0812337 -0.0381734
+-0.047565 0.0370224 -0.0142792
+-0.010699 0.104948 -0.0231645
+0.0375184 0.0915609 -0.0128884
+-0.056974 0.0573893 0.011763
+-0.00401542 0.033994 -0.0206047
+0.0133173 0.0638081 -0.0300932
+-0.0402517 0.127178 -0.0024642
+0.00549546 0.0489597 0.051102
+-0.0755445 0.0668624 0.00857418
+-0.0465015 0.0643139 0.0383309
+0.00586085 0.130491 0.00185259
+-0.00908444 0.0392597 0.0359512
+-0.0724815 0.0696506 0.0297377
+-0.0588318 0.146817 0.0344225
+-0.0460118 0.126697 0.0245216
+-0.044079 0.0336811 -0.000461832
+-0.0565021 0.0946206 0.04473
+-0.0615844 0.155311 -0.0225818
+-0.0650869 0.155169 -0.00713868
+-0.089472 0.092961 0.0204149
+-0.0824758 0.0764829 0.0200121
+0.0429803 0.0916104 -0.003806
+-0.0914285 0.144743 0.0221537
+0.00329581 0.06408 -0.0335736
+-0.0554437 0.158541 0.0079523
+-0.0624977 0.0789785 0.042462
+0.00538842 0.0383711 -0.011506
+-0.0682947 0.162375 -0.0539731
+-0.0809901 0.135346 -0.00326263
+-0.0418435 0.0928469 -0.022966
+-0.0664939 0.0917254 0.0436166
+-0.0741328 0.170753 -0.0306566
+0.00842498 0.094018 -0.0295425
+-0.00912603 0.126983 -0.00460672
+-0.0144839 0.0911543 0.0563071
+-0.0247385 0.124904 0.000549003
+-0.064327 0.034541 0.0284972
+-0.0668589 0.156842 -0.00635476
+-0.0565065 0.0629707 0.0300974
+0.0567694 0.0522665 0.0211855
+0.0120332 0.0793354 0.0543348
+0.00749695 0.108523 0.0409368
+-0.0385157 0.0761871 0.0423388
+-0.0861163 0.11208 0.0430934
+-0.0554974 0.0776601 0.0434775
+-0.0519782 0.0531903 0.0286494
+0.00382899 0.0387567 -0.00467455
+-0.0437453 0.0348723 0.00757323
+-0.0876033 0.102265 0.00739801
+-0.0538689 0.152421 0.0214004
+0.0305964 0.0407785 0.0282841
+0.0465387 0.0750529 0.00819241
+-0.0664147 0.112558 0.0425241
+-0.0212669 0.123736 0.0252343
+-0.0144966 0.0485988 0.0478804
+-0.0270125 0.0891105 0.0478066
+-0.0328048 0.0886955 -0.0250147
+-0.0387676 0.0812185 -0.0204237
+-0.0179622 0.106228 -0.0225141
+-0.0121468 0.17267 -0.0267827
+-0.0155019 0.119619 0.0357771
+-0.0763961 0.0968047 0.0374195
+-0.00349611 0.0897823 0.0565938
+-0.0378917 0.0335733 -0.0268663
+-0.0464981 0.0451704 0.0419279
+0.0287219 0.115289 -0.00622497
+-0.0639806 0.135327 0.039077
+-0.045498 0.105695 0.0408472
+0.0546227 0.0668075 0.00110467
+-0.0690913 0.143 -0.0123014
+0.0356753 0.0619319 0.0374332
+-0.0141081 0.128922 0.00736661
+-0.0561495 0.0341243 0.0270787
+-0.038546 0.128369 0.00715642
+-0.0876142 0.116272 0.0465171
+-0.0722303 0.134063 0.0500963
+-0.0156039 0.0392636 -0.0272219
+-0.0361326 0.034299 0.0293707
+0.0285657 0.120967 0.00738594
+0.0111022 0.114226 -0.0170859
+-0.0218549 0.118022 -0.0129203
+0.0460721 0.0848306 0.00817735
+-0.0800935 0.138964 -0.00379173
+-0.0574953 0.0747475 0.0420563
+-0.00684325 0.130599 0.0100344
+0.020602 0.0768409 0.0509288
+0.0342103 0.0795441 0.0407378
+-0.0387822 0.0841715 -0.021953
+0.00854197 0.104373 0.044167
+0.0284181 0.0835438 0.0446794
+-0.0809789 0.0720684 0.0125422
+-0.0870329 0.152942 0.0187545
+0.0227098 0.105005 -0.0172062
+-0.0259693 0.156664 -0.00260696
+0.00630512 0.0970077 -0.026738
+-0.0293004 0.175699 -0.00559167
+-0.00764633 0.048167 -0.0303862
+-0.045682 0.0680577 -0.0156409
+-0.0545225 0.0645764 -0.00897215
+-0.0511988 0.137011 0.0243968
+-0.00714364 0.101607 -0.0236448
+0.00975279 0.123922 0.0333795
+-0.069363 0.163799 -0.0509746
+-0.000145407 0.0355938 -0.0156782
+0.0251101 0.0562501 -0.0227775
+0.047185 0.0692848 0.0242283
+-0.0610844 0.0335982 -0.00747508
+-0.0215973 0.0387212 -0.015323
+0.00621551 0.0824281 -0.0337654
+-0.0768656 0.120803 -0.0071099
+-0.072234 0.147352 -0.0242316
+-0.0251276 0.16525 -0.016804
+-0.00350994 0.110634 -0.0212045
+-0.051883 0.143128 0.0183637
+0.0388034 0.0687739 -0.0117998
+0.0522529 0.049588 0.0243549
+-0.0484974 0.0974063 0.0440017
+0.0292296 0.08295 -0.0208022
+0.0215976 0.121636 0.0305088
+-0.0576661 0.143885 0.0324483
+-0.062789 0.152113 -0.0295989
+-0.0686144 0.0632303 0.0220506
+-0.0812769 0.136213 -0.00276757
+-0.0898521 0.112924 0.020019
+0.0399617 0.0984844 -0.00581339
+-0.0197337 0.0627381 -0.0357065
+-0.0715197 0.0915892 0.0417662
+-0.0176796 0.037751 -0.0173923
+-0.0034931 0.0519852 0.0535284
+-0.0477302 0.0753108 -0.0175447
+-0.0720239 0.158203 -0.0389152
+0.012618 0.0562866 0.0514947
+-0.00341476 0.129699 0.000449344
+0.00761699 0.0345564 0.0219225
+0.0197796 0.101487 -0.0214363
+-0.0718751 0.150885 -0.0428436
+0.0226049 0.0994887 0.0451477
+-0.0275114 0.0379423 0.00991362
+0.0449899 0.0861501 0.00118902
+-0.0724942 0.0928706 0.0413391
+-0.0668563 0.151928 -0.044894
+-0.00758529 0.0395118 0.037828
+-0.0717266 0.143977 -0.0139286
+-0.0485566 0.0446478 -0.0101195
+-0.0498454 0.098516 -0.0220736
+-0.0687032 0.155739 0.000270534
+0.0305837 0.118921 0.00529549
+0.0181431 0.0408036 0.0434958
+-0.0644897 0.161538 -0.0184978
+-0.082117 0.127195 0.0520765
+0.0194801 0.0975854 0.0469408
+-0.0593004 0.0460479 0.0107053
+-0.051494 0.097382 0.0437255
+-0.0629042 0.151488 -0.0283316
+-0.0520794 0.132523 0.0317044
+-0.0086348 0.124041 -0.00947049
+-0.0408505 0.0971293 -0.022095
+-0.0501242 0.144161 0.00100252
+-0.0374501 0.127748 0.0031441
+-0.0242006 0.107431 -0.0217757
+-0.0185705 0.0597254 0.0501838
+0.0506634 0.0663167 -0.000433246
+-0.0778197 0.0981202 0.035968
+-0.0344836 0.0604651 0.0395531
+0.0141481 0.100268 -0.0227789
+-0.0201048 0.0920391 0.0535514
+0.0405223 0.0582848 0.0307512
+-0.0234669 0.126337 0.0156088
+-0.0879353 0.140547 0.0390784
+0.0495003 0.0691238 0.025332
+-0.0550177 0.034541 0.0409139
+-0.0558687 0.156831 -0.000812957
+-0.033113 0.162236 -0.0143657
+-0.0040053 0.127195 0.0298616
+0.00247063 0.0977635 0.0514765
+-0.0372934 0.126961 0.0179492
+0.00433485 0.120467 -0.0137766
+0.00930976 0.0595795 -0.0301167
+0.0437257 0.0902921 0.0241674
+-0.0363397 0.0344675 0.0327184
+0.000637516 0.0346318 0.0420689
+0.0283669 0.0563832 0.0408635
+-0.0890554 0.136524 0.0291987
+-0.0526322 0.0603614 -0.00917272
+-0.0555168 0.0610654 0.0262173
+-0.0398616 0.102806 -0.020798
+-0.0554959 0.0959795 0.0436611
+-0.0625279 0.0435825 0.012569
+-0.012539 0.0432081 0.0504383
+-0.0295399 0.0777526 0.042206
+0.0250153 0.0699448 0.0449142
+0.0418505 0.0929433 -0.00581175
+0.00749052 0.0923616 0.0534281
+-0.0508873 0.105589 -0.0194525
+-0.0577516 0.0752955 -0.0185275
+-0.0341251 0.166782 -0.00385534
+0.0204867 0.0961927 0.0470968
+-0.0860696 0.110951 0.0368762
+-0.0623929 0.0445563 0.039213
+0.0212831 0.0679005 -0.027755
+-0.0459741 0.03576 0.00812075
+-0.0128757 0.105895 -0.0226089
+-0.0713104 0.164383 -0.0152637
+-0.00570768 0.129479 0.0248833
+-0.0759611 0.0715461 -0.00349282
+-0.0154987 0.0485755 0.0476399
+-0.0271627 0.125166 0.0172175
+-0.052909 0.0559665 0.0126205
+0.0445771 0.0875296 0.0231612
+-0.0679602 0.132601 -0.00851511
+-0.0735016 0.14861 -0.0288774
+0.0321816 0.0968615 0.0396789
+-0.0617331 0.156868 -0.0205842
+-0.0310423 0.0467686 -0.0260418
+-0.0285615 0.0382432 0.0537594
+-0.0934477 0.121479 0.0262963
+-0.0220941 0.0710555 0.0505203
+-0.0299308 0.0348009 0.0443343
+-0.0161025 0.0382877 0.022773
+-0.0328698 0.101492 -0.0223548
+0.0454742 0.0412367 0.0106737
+-0.028101 0.0890412 0.0460663
+-0.0440047 0.127209 -0.00443148
+0.0593281 0.0649895 0.00613553
+0.0127896 0.130142 0.00867876
+0.0391468 0.0887707 0.0338836
+0.0223265 0.0535979 0.0444334
+-0.0897234 0.125377 0.0042981
+0.0287018 0.0447465 0.0341399
+-0.0924969 0.121493 0.0302824
+-0.0717492 0.0821807 -0.0161321
+-0.0756445 0.156326 -0.00458549
+0.00148921 0.104407 0.0433078
+-0.0361895 0.0355992 0.0192692
+-0.0662775 0.0734947 0.0382764
+-0.0730867 0.169281 -0.0259539
+-0.00640617 0.0386668 0.0262232
+-0.053287 0.0610602 0.0282137
+-0.0820828 0.0871799 0.032118
+-0.0474969 0.0477925 0.0396528
+0.0505278 0.0445977 0.0162148
+0.0314571 0.0378867 -6.50808e-05
+0.0244076 0.117212 -0.0083203
+0.0193833 0.052146 -0.0261511
+0.0213663 0.0593118 -0.0264401
+-0.0223265 0.0696009 0.0493961
+-0.0803036 0.100707 0.0327244
+0.0516025 0.0650498 -0.00116678
+-0.0572939 0.0597447 0.0223608
+0.0272121 0.088765 -0.0222319
+-0.0760712 0.152304 0.0343668
+0.0287584 0.0359201 0.00291435
+-0.00327774 0.125061 -0.00864173
+-0.0492123 0.134029 0.0252722
+-0.0157732 0.0799164 -0.0389165
+0.0137184 0.0699424 0.0531931
+0.0181521 0.124421 0.0277923
+0.0195548 0.127052 0.0182976
+-0.0788582 0.171448 -0.0399026
+-0.0820398 0.150272 0.03397
+0.0134064 0.0478115 -0.0258783
+-0.0637307 0.0344451 0.0269565
+0.00741391 0.0920665 -0.0315473
+0.0394368 0.0688303 -0.0107955
+-0.064416 0.154996 0.00586526
+-0.066663 0.144317 -0.015468
+0.0353499 0.042038 0.028119
+-0.00141558 0.03896 -0.0133998
+-0.0338581 0.0334994 -0.0260028
+0.0142608 0.0359816 -0.0203372
+-0.0776263 0.175005 -0.043567
+-0.0525965 0.0345626 0.0431188
+0.0335361 0.0372674 0.00265432
+0.0308902 0.0632769 0.0410591
+-0.0895335 0.144692 0.0121557
+-0.0612693 0.0337096 0.0122134
+-0.00661675 0.0976221 -0.0294208
+-0.0504448 0.128295 0.0323161
+-0.0571803 0.062383 0.0287138
+-0.0529076 0.136719 0.0287121
+-0.0247725 0.0390001 0.0365321
+-0.00277907 0.0769693 -0.0364873
+-0.0894255 0.0956236 0.0134235
+0.0183336 0.0566072 -0.0279953
+-0.0945117 0.124183 0.0222757
+-0.0670539 0.154574 0.0299913
+0.0377471 0.104052 -0.00484079
+-0.0277489 0.0877005 0.0471838
+-0.0465602 0.122394 -0.0114017
+0.0512982 0.0545874 -0.00353058
+-0.0255237 0.116678 0.0329121
+-0.0558854 0.0479468 0.0296668
+-0.0384602 0.127124 -0.00162988
+0.00941217 0.040392 -0.0233006
+-0.0788042 0.109939 0.0428886
+-0.00952807 0.0385271 0.0257083
+-0.0151514 0.041952 0.0515406
+-0.0896796 0.114349 0.0422656
+-0.0130415 0.0639857 0.0543784
+-0.0709434 0.168021 -0.0490096
+-0.042508 0.0562794 0.0398023
+-0.0723361 0.155599 0.00334302
+-0.0804662 0.0800422 -0.00555374
+-0.0320486 0.122707 -0.00572396
+0.0215589 0.120837 -0.00625561
+0.0181166 0.118416 -0.011621
+-0.0473179 0.0397941 -0.0120624
+-0.0797756 0.0706254 0.0155549
+0.00931098 0.130351 0.0216675
+-0.0082877 0.0388999 0.0310374
+-0.0475138 0.156385 0.00914965
+-0.000599084 0.0391028 -0.0250468
+-0.0114889 0.103024 0.0436761
+-0.0176179 0.0378672 -0.0275216
+-0.0423688 0.123346 -0.0104204
+-0.0387324 0.156611 0.00532643
+0.0047217 0.0940547 -0.0316305
+-0.0728512 0.152626 -0.0378881
+-0.00186255 0.103074 -0.0227526
+0.0529842 0.0692584 0.0249064
+-0.0792715 0.107765 0.0320009
+0.0324709 0.0353558 0.0097886
+-0.083008 0.154405 0.0171359
+0.0123335 0.0581189 -0.0294366
+-0.0570144 0.0335354 0.00427397
+-0.0520347 0.0349067 0.0446489
+0.0239781 0.084017 -0.0250643
+0.0450177 0.0875447 0.000184881
+-0.00260981 0.0434451 -0.0255195
+-0.00349422 0.0718336 0.0581766
+-0.0470698 0.154668 -0.0068409
+-0.0764224 0.152995 0.0327283
+-0.0382612 0.0345343 0.0375294
+-0.00240135 0.128537 0.0275513
+-0.0924704 0.117461 0.033305
+-0.0714888 0.127424 0.0521873
+-0.0439578 0.12961 0.0140149
+-0.0725837 0.0763091 -0.0123208
+-0.0595593 0.0341176 0.0246105
+-0.00343172 0.0385593 0.0215021
+0.0311358 0.0782102 0.04331
+-0.0494476 0.122586 0.0319364
+-0.0665119 0.0621274 0.0216726
+0.0544596 0.058178 0.0276568
+-0.0495972 0.118308 0.0316941
+-0.0314789 0.174225 -0.0034609
+-0.0728795 0.116451 -0.00740226
+0.00249754 0.108619 0.0424686
+0.0280724 0.0678498 -0.0217391
+-0.0278862 0.165359 -0.00713919
+-0.0117661 0.182389 -0.0287496
+-2.83383e-05 0.0370817 -0.0151505
+-0.0721646 0.155417 -0.0379087
+0.0297368 0.100819 0.0396604
+0.0224793 0.124852 0.00370943
+-0.0278708 0.104417 -0.0229648
+-0.0388092 0.0372561 -0.0289196
+0.0393949 0.0519685 -0.00680892
+-0.0114113 0.0387598 0.0305221
+-0.0668989 0.0372019 0.0312012
+-0.0634206 0.167809 -0.0425955
+-0.0738654 0.102167 -0.0123482
+0.000515293 0.09714 -0.0288497
+0.00321341 0.034575 0.0192003
+-0.0313524 0.158102 0.00192058
+-0.0879015 0.148743 0.00925863
+-0.0552908 0.158294 -0.000771282
+0.00144018 0.127924 -0.00374837
+-0.0374859 0.0491992 0.0393813
+0.0225251 0.100664 -0.0205487
+-0.0149527 0.0339242 -0.0208085
+0.00432828 0.0582523 -0.0314184
+0.0463488 0.0792498 0.00918224
+-0.0375014 0.105589 0.0387333
+-0.062506 0.149124 -0.0145611
+0.00329475 0.129383 -0.00133175
+-0.00689488 0.0384553 0.0136435
+-0.0384034 0.0343958 0.0323426
+-0.062465 0.163086 -0.0495893
+-0.0639661 0.0690471 0.0355624
+-0.0131121 0.0626059 0.0545133
+-0.0449324 0.0358062 0.00829108
+0.0406445 0.0871881 -0.0107716
+-0.0230795 0.0932192 0.0494322
+-0.0186385 0.0465274 -0.0284289
+-0.0571213 0.0576422 0.00058007
+-0.0705055 0.0343308 -0.00278598
+-0.0578994 0.112578 -0.0159728
+-0.0106785 0.0383169 0.0202432
+-0.0593417 0.119814 0.0404797
+-0.0505461 0.0403717 -0.011217
+-0.0453989 0.0342539 -0.0215146
+-0.011074 0.178648 -0.0249266
+-0.0523515 0.0582314 0.0273813
+-0.0254941 0.0486931 0.0489695
+0.0374187 0.0855245 -0.0157145
+0.0453002 0.0932088 0.00816687
+-0.0612769 0.133878 0.0377403
+0.00152786 0.0745369 0.0570999
+0.0245032 0.122816 0.00162459
+-0.00938967 0.130192 0.0162996
+-0.0703883 0.0339052 -0.000577152
+-0.0733601 0.156855 -0.0299134
+-0.0171472 0.166778 -0.0196136
+0.0116998 0.0819851 0.0538895
+-0.0502854 0.11522 -0.0158495
+0.050316 0.0546413 -0.00421167
+-0.0667548 0.115724 0.0491405
+-0.0609102 0.120922 -0.00906619
+-0.0866023 0.111811 0.0414218
+-0.0669546 0.128237 -0.00895731
+-0.0654028 0.177571 -0.0533847
+-0.0437352 0.0753785 -0.0184868
+-0.0329958 0.0793378 -0.0275102
+-0.00469334 0.101051 0.0441761
+-0.0137252 0.0671481 -0.0375067
+-0.0531289 0.138241 -0.000765665
+-0.0361236 0.163705 -0.0141169
+-0.0249029 0.0722756 0.0462509
+-0.0119797 0.0383916 0.0235247
+-0.0246067 0.157782 -0.00250374
+-0.0748771 0.109206 -0.00842538
+-0.0314894 0.0845774 0.0421902
+-0.0849159 0.123546 -0.00333555
+0.052731 0.0672551 0.000627241
+0.0453449 0.0710055 0.0220458
+-0.0665131 0.0419133 -0.00333369
+0.0194908 0.113962 0.0368661
+-0.0674148 0.142782 -0.0112266
+-0.0931203 0.121503 0.0403997
+-0.0084076 0.0932235 -0.0348708
+0.0125532 0.0900642 0.0534187
+0.0432399 0.0747788 -0.00379578
+0.00477967 0.130785 0.0214562
+0.0461172 0.0759623 0.0190037
+-0.0870553 0.118453 0.000244653
+0.00651257 0.056103 0.0529931
+-0.0623783 0.167824 -0.0485899
+-0.0258496 0.0864897 0.0509722
+0.0602482 0.0581464 0.0141691
+-0.0923082 0.120116 0.0282975
+0.00750533 0.0660627 0.0552439
+0.060666 0.0609482 0.0151682
+-0.0674289 0.114212 0.0481237
+-0.0514122 0.146842 -0.00193867
+-0.0768562 0.117877 -0.00659127
+-0.0825551 0.152911 0.00706582
+-0.0839745 0.0804809 0.0225006
+0.041166 0.0819934 0.0314416
+-0.0655442 0.155124 -0.0481259
+-0.0384965 0.0620329 0.0413169
+-0.0627141 0.159943 -0.0425974
+-0.0767176 0.159013 -0.0120318
+-0.0856607 0.0832001 0.00448541
+-0.0278526 0.181478 -0.0120494
+0.0114013 0.0419017 -0.0239008
+0.0243085 0.123343 0.00295625
+-0.0474528 0.119349 0.0293599
+-0.0304487 0.0334492 -0.0290445
+-0.0696417 0.0422524 0.0026904
+-0.0644028 0.146849 -0.019975
+0.0503218 0.0589081 -0.00447436
+0.0476236 0.0467222 0.0264254
+-0.0303554 0.117939 -0.0127791
+0.0338995 0.0591949 0.0383404
+-0.0746238 0.166812 -0.0222329
+-0.0186858 0.118957 -0.0119398
+0.0507854 0.0445928 0.0142166
+-0.0844285 0.0832425 0.0264792
+0.0593532 0.0636103 0.0211835
+-0.073524 0.16243 -0.0369561
+-0.0525841 0.0574366 -0.00812203
+0.0221795 0.040783 0.0405434
+0.0281375 0.0902298 0.0443276
+0.0214874 0.0892516 0.0486681
+-0.0702718 0.110271 0.0410027
+0.0386345 0.0753534 0.0347776
+-0.0646561 0.0344494 0.0319916
+-0.00663677 0.109707 -0.0221975
+-0.029185 0.0634891 -0.02746
+-0.0671416 0.145678 -0.0214457
+-0.0135214 0.0353632 -0.0181023
+-0.0376703 0.125135 -0.00632213
+0.0114179 0.0489704 0.047894
+-0.0923638 0.118682 0.00930083
+0.0483264 0.0430255 0.0152188
+0.00550628 0.0441375 0.0457857
+-0.0652333 0.0338884 0.0112389
+0.0482587 0.0460086 0.000382582
+0.0586626 0.0538435 0.0111779
+-0.000982862 0.0386959 0.0236934
+-0.0245147 0.119422 0.0312229
+-0.0155858 0.183111 -0.0209193
+-0.0867126 0.0819778 0.0134931
+-0.0785905 0.0980977 0.0353146
+-0.0907184 0.115992 0.0263684
+-0.0614986 0.158424 -0.0305881
+-0.090971 0.141997 0.0221703
+0.049023 0.0722611 0.00748575
+-0.0495658 0.0446328 -0.00989725
+0.000576288 0.0353387 0.0179719
+-0.00263978 0.131127 0.015882
+0.0260716 0.115341 -0.00830033
+-0.0571034 0.0535249 0.00264062
+-0.0471993 0.162132 -0.00733312
+-0.0750917 0.0664543 0.00723246
+-0.0617686 0.159987 -0.035592
+-0.0267825 0.079725 -0.0369434
+-0.061465 0.0438948 -0.0044823
+0.0457823 0.0862054 0.00618349
+-0.065804 0.0609905 0.0192925
+0.0197913 0.0781802 0.0515303
+0.0377275 0.0928421 0.0353087
+-0.0179367 0.12631 0.000372783
+0.0437374 0.0902563 -0.00280325
+-0.00792408 0.0384127 0.0189094
+0.0556221 0.0493651 0.00819776
+0.00641397 0.0375702 -0.0238447
+-0.0274537 0.0485303 0.0479606
+-0.0610187 0.152669 0.0336579
+-0.078775 0.170042 -0.0371202
+0.0527843 0.0462443 0.0112063
+0.0173793 0.0631583 0.049653
+-0.0359664 0.162375 -0.00125909
+-0.0559722 0.134715 -0.00446003
+-0.0484961 0.113915 0.0346796
+-0.00776872 0.0756191 -0.0375185
+-0.085947 0.104892 0.00437979
+-0.0866438 0.152376 0.0233632
+-0.0520552 0.0559741 0.0276222
+0.060777 0.0637293 0.0161648
+-0.0634196 0.15027 -0.0277557
+-0.0514307 0.12406 0.0344067
+-0.00747581 0.101243 0.0443796
+-0.0489909 0.133982 0.00241474
+-0.0174145 0.118412 -0.0133815
+0.0106556 0.0345311 0.0225637
+0.0207029 0.0950845 -0.0226908
+-0.000596635 0.0433605 -0.0249736
+-0.0628762 0.0967673 -0.0179048
+0.0102648 0.0752773 0.0552991
+-0.0281556 0.17562 -0.0175208
+-0.00541266 0.130784 0.0163058
+-0.0708319 0.0345819 -0.00103676
+-0.0204551 0.0879984 0.0554627
+-0.0640233 0.0347562 0.0388023
+-0.0255632 0.0589456 -0.0304089
+-0.0856596 0.0858717 -0.000523015
+0.000533962 0.0773889 0.0579724
+-0.0911932 0.147489 0.0241289
+-0.0536699 0.0338623 0.0207675
+-0.0330023 0.0807475 -0.0275162
+-0.0598207 0.148547 -0.00150215
+-0.0292722 0.116973 -0.0137779
+0.0389134 0.0603588 -0.00677348
+0.00149281 0.111426 0.0424095
+-0.0567184 0.0723883 -0.016755
+-0.0557727 0.0333786 -0.00437552
+-0.0514926 0.0503999 0.033682
+-0.00426203 0.129106 -0.000929037
+0.0209419 0.0535563 0.0459234
+-0.0665114 0.0931036 0.0430214
+-0.0313926 0.112895 -0.0174931
+-0.0358232 0.127618 0.00522677
+-0.0126066 0.128516 0.0224096
+0.0435838 0.0705579 0.0258591
+-0.00308793 0.0379842 0.0148477
+-0.0348769 0.105695 -0.0204457
+-0.0787914 0.0724652 0.0224838
+0.022277 0.0678419 -0.0269851
+0.021809 0.1242 0.000142479
+0.00528322 0.0682375 -0.0327226
+-0.0813944 0.0817284 0.031574
+0.0109283 0.0616839 0.0526314
+-0.0233033 0.0429927 0.0537933
+0.0135067 0.1196 0.0353985
+-0.0856435 0.0805169 0.00650219
+-0.0555634 0.0386377 0.0471443
+-0.0925953 0.129683 0.0262582
+-0.0908852 0.150208 0.0181276
+0.0274474 0.0591653 0.0430806
+-0.0143101 0.113201 -0.0178955
+-0.0695125 0.145609 0.0428052
+0.002489 0.103843 -0.0219556
+0.034067 0.0981569 0.0371457
+-0.0663951 0.140334 -0.00790584
+-0.0462961 0.162745 -0.00789878
+0.0286561 0.108194 -0.012625
+-0.0852651 0.14863 0.0333956
+-0.0290693 0.0677067 -0.0294879
+0.0414097 0.104256 0.00616512
+-0.0693963 0.0393871 -0.00132267
+0.0255358 0.0435625 -0.00763706
+0.0562825 0.0508178 0.0201866
+-0.0867977 0.144597 0.036443
+-0.0252829 0.0751884 0.0479421
+-0.0224834 0.0681349 0.0481925
+0.0575606 0.0537805 0.0213286
+0.00845802 0.129083 -0.00108013
+0.0113649 0.0538487 -0.0294289
+-0.0501252 0.138572 0.00341268
+-0.074971 0.152728 -0.0179063
+-0.0312043 0.0422041 -0.0297469
+-0.0846068 0.0791109 0.00453817
+-0.0536323 0.0602894 -0.00841331
+-0.0171387 0.171259 -0.0162017
+0.0409378 0.0397959 0.0185201
+-0.0781974 0.153502 0.00273811
+-0.0824089 0.107319 0.0275588
+-0.0723216 0.169832 -0.0271166
+-0.0716176 0.109058 0.0379622
+0.000146179 0.101649 -0.0227639
+-0.0522094 0.0517797 0.0246371
+0.0118426 0.0562933 0.0521284
+-0.0625131 0.11843 0.0430565
+0.00861514 0.0345206 0.0221572
+0.0244049 0.0741131 0.0475942
+0.00453562 0.128718 -0.00265628
+0.0138565 0.129875 0.0119166
+-0.070378 0.149076 -0.0386493
+0.0445575 0.0847276 0.0241575
+-0.0157056 0.0599572 -0.0358177
+-0.0558806 0.154815 0.016521
+0.000379078 0.127909 -0.00372478
+0.0266539 0.122169 0.0209401
+-0.0679962 0.167786 -0.0255431
+-0.0920426 0.126958 0.0362532
+-0.0594207 0.0398239 0.0196241
+0.0364837 0.0469104 0.0311466
+-0.0568261 0.139571 0.0318926
+-0.053019 0.141421 -0.000504477
+0.0435234 0.0433666 0.0249665
+-0.0277895 0.06758 -0.0314768
+0.0362342 0.0398741 0.0247937
+-0.0212837 0.0381384 0.0164325
+0.0257555 0.0994695 0.0426751
+0.0399676 0.101315 -0.00381805
+-0.0152962 0.0433291 0.0513434
+0.0573469 0.0674291 0.0231143
+-0.0520755 0.0475411 0.0216528
+0.0328365 0.0876935 -0.0188869
+0.0143568 0.0522918 -0.0274834
+-0.0725069 0.145589 0.0436497
+0.00651279 0.0647152 0.0557475
+0.00953758 0.128186 0.0275085
+-0.052193 0.119749 -0.012566
+-0.0686715 0.165205 -0.0529941
+-0.0896326 0.092928 0.0134378
+0.0289756 0.116666 0.0289439
+-0.0642519 0.118577 0.0476092
+-0.0257723 0.182903 -0.0115399
+-0.0844232 0.100698 -0.00156743
+-0.0206629 0.0479548 -0.0285983
+-0.0532393 0.0448331 0.0206817
+0.00230145 0.0612209 -0.0331693
+0.020878 0.117607 -0.0107498
+-0.0818428 0.103274 -0.0045788
+-0.0184976 0.101625 0.0435583
+-0.0305 0.0674574 0.0390127
+-0.0485029 0.0452121 0.0424266
+-0.0929791 0.124188 0.0282747
+-0.0302252 0.0523701 -0.0173649
+0.00350969 0.0897377 0.0556751
+-0.0219245 0.161037 -0.00376903
+-0.0619129 0.0458194 0.037691
+-0.00376935 0.0769928 -0.0369082
+0.0411698 0.0806497 0.0314486
+-0.0115592 0.100495 0.0448823
+-0.063251 0.15135 -0.00497603
+-0.0271171 0.059077 -0.028426
+0.0053978 0.0390279 -0.0240405
+-0.0676491 0.065582 -0.00407795
+-0.063925 0.0448804 0.0097039
+-0.00969446 0.0598719 -0.0345693
+-0.0860777 0.110355 0.00735249
+-0.0152136 0.174214 -0.0186712
+0.00434041 0.0596672 -0.031584
+0.0213842 0.125707 0.00472943
+-0.0835093 0.13127 0.0505027
+0.0165672 0.128654 0.015768
+0.0285444 0.0459645 -0.0070843
+-0.0721129 0.15894 -0.00533295
+-0.0525858 0.147787 0.0204037
+-0.0465092 0.0776139 0.042786
+-0.00623267 0.10133 -0.0233757
+0.0572046 0.0564633 0.00317356
+-0.0122436 0.112093 -0.0187249
+0.00624351 0.0810351 -0.0338384
+0.0462734 0.0764388 0.00619417
+-0.0168246 0.0855538 -0.0389836
+-0.0869607 0.111738 0.00633151
+-0.0370469 0.152854 -0.00726744
+0.0405338 0.105622 0.0141627
+-0.0164738 0.10119 0.0439603
+-0.0854876 0.0791977 0.0105097
+0.0272664 0.0760665 -0.0234764
+-0.0438604 0.102816 -0.0213031
+0.00350403 0.0533854 0.0535456
+0.0169167 0.127898 0.0201801
+0.0184941 0.0838333 0.0510457
+-0.00847869 0.123725 0.0338017
+0.0387498 0.0659721 -0.0107606
+-0.0437917 0.0422818 -0.0193111
+-0.0126098 0.0384695 0.0251301
+0.0135799 0.0887495 0.0531421
+0.00935699 0.131232 0.0131197
+0.0135065 0.109861 0.0400106
+-0.0850182 0.0831804 0.00149618
+-0.0740846 0.0657329 0.0152043
+-0.0265661 0.0706408 0.0422848
+-0.0847398 0.106178 0.00238203
+-0.0345218 0.0818067 0.0425242
+-0.0428232 0.12861 0.00263817
+0.0121427 0.100268 -0.0226753
+0.0447259 0.0749152 0.000215102
+0.0232974 0.0648673 -0.0252072
+-0.0822784 0.0951136 -0.0065238
+-0.0614844 0.158425 -0.031588
+-0.0521163 0.12407 0.0351298
+-0.0424777 0.104302 0.0409096
+-0.00407779 0.0345848 -0.0173958
+-0.0284243 0.0487716 0.0462084
+-0.0184625 0.0729785 0.0545802
+-0.015609 0.128774 0.0111587
+-0.0694586 0.153877 0.0321166
+-0.0484639 0.149215 0.0104667
+-0.0526002 0.146245 0.0194042
+-0.0263327 0.111444 -0.0179843
+-0.0331847 0.0445939 -0.0279862
+-0.0538972 0.104145 -0.0195691
+-0.0294956 0.124519 0.0193203
+0.0346714 0.0916012 0.0397133
+-0.0247788 0.0379568 0.0140716
+-0.0643494 0.153359 -0.00540282
+-0.00557634 0.0347311 -0.0241073
+-0.0258097 0.0766327 0.0484243
+-0.00867178 0.0387364 -0.0146344
+-0.0783855 0.0873596 0.0368663
+-0.0346878 0.0651683 -0.0148251
+0.0404983 0.0499404 0.0324741
+-0.0738591 0.0964804 -0.0142486
+0.0267717 0.107644 -0.0140409
+-0.0404701 0.104257 0.0399236
+-0.0381489 0.0448685 -0.0242105
+-0.0095211 0.045789 0.0480158
+-0.0311715 0.171175 -0.0164295
+-0.0695038 0.173637 -0.0418473
+-0.0823392 0.111551 0.0443764
+-0.0227424 0.0655154 -0.0353045
+-0.0508568 0.0999518 -0.0219402
+-0.0589296 0.1241 0.041105
+0.000488727 0.108629 0.0427903
+-0.0412638 0.110187 -0.018624
+-0.0147098 0.0613984 -0.0362354
+0.0459347 0.0413813 0.0124396
+0.00323976 0.128177 0.0281353
+-0.0743879 0.143042 -0.00684484
+-0.0264004 0.0577755 0.0382862
+-0.00692431 0.038377 0.0191445
+-0.0864209 0.080641 0.0154973
+-0.077237 0.0721326 0.0266059
+-0.0686311 0.136892 0.0464956
+-0.0792347 0.153789 0.0287725
+-0.0537819 0.0840761 -0.0215562
+-0.0117053 0.0909225 -0.0365538
+0.0365178 0.0541167 0.0317039
+-0.0616584 0.114654 -0.0131207
+0.0390548 0.0884875 -0.0128108
+-0.0887111 0.101017 0.0193703
+0.0162822 0.0666125 -0.0295206
+-0.064714 0.0600149 0.00783247
+-0.0175786 0.180143 -0.0185198
+-0.0408442 0.152602 -0.00723164
+0.0352097 0.0379704 0.0208298
+-0.0618294 0.0342021 0.0275686
+0.0185142 0.0412688 -0.0207398
+-0.0195264 0.159643 -0.00556617
+0.0318624 0.0768516 0.0425881
+0.0347681 0.0641816 -0.0148052
+-0.0479777 0.147732 0.00938552
+-0.0126851 0.0570335 -0.0344182
+0.00495057 0.130435 0.00152594
+-0.0486835 0.0664435 -0.0136416
+-0.0356438 0.0562686 -0.010631
+-0.084499 0.088474 -0.00355332
+-0.0503848 0.141583 0.00270968
+-0.0858587 0.125737 0.0487678
+-0.0426772 0.14763 -0.000244299
+-0.0378831 0.156583 0.00477982
+0.00350659 0.0388434 0.0262887
+-0.0887855 0.102363 0.0143842
+-0.0646755 0.142507 0.0398915
+-0.0909161 0.13091 0.00724248
+-0.055962 0.0343325 0.0321978
+-0.0723047 0.162425 -0.0409479
+-0.0696851 0.11012 0.0394623
+-0.083003 0.0803028 0.000504056
+0.0247589 0.0435818 0.039017
+-0.0218764 0.182954 -0.0200262
+0.0236525 0.124901 0.0169603
+0.0463445 0.0561751 -0.00589814
+-0.0218308 0.117001 -0.0138605
+-0.0747558 0.067415 0.00253432
+-0.0625552 0.176839 -0.0611671
+-0.0660641 0.0384249 0.0148213
+-0.000107958 0.12991 0.000141982
+-0.054081 0.071101 0.0394438
+-0.00558231 0.0361988 -0.024956
+-0.0684451 0.117201 0.0519481
+0.0333957 0.0461492 -0.00598528
+-0.0146115 0.03779 -0.0266447
+0.00133195 0.0385877 -0.00128958
+-0.0348901 0.0738831 -0.020486
+0.0373363 0.105992 0.0277645
+0.0084546 0.131034 0.0184964
+-0.0324996 0.0498708 0.0403614
+-0.0444999 0.0719382 0.0422118
+0.0369643 0.0405549 -0.00158789
+-0.0354954 0.0733233 0.0419636
+-0.0457735 0.0826328 -0.0207974
+0.00732527 0.0595899 -0.0304419
+-0.0874242 0.111776 0.00733879
+-0.0592783 0.115234 -0.0137669
+-0.0928043 0.11882 0.0332998
+-0.0116325 0.0385039 0.00355749
+-0.0398903 0.0344806 0.00870734
+-0.0722375 0.138308 0.048356
+0.0262204 0.0344897 0.0111735
+-0.0200589 0.0348282 0.0498878
+-0.0246346 0.0382795 0.00294393
+-0.0889887 0.147168 0.0287003
+-0.0574968 0.1584 0.00209189
+-0.0329778 0.0448862 0.0466174
+-0.0605914 0.0623502 0.0262507
+-0.0785506 0.0699758 0.0176232
+-0.0362833 0.17342 -0.00108904
+-0.0627087 0.161508 -0.0465953
+-0.0397898 0.0855606 -0.0217035
+-0.0064056 0.10047 0.0472751
+-0.0646908 0.166411 -0.0300665
+-0.0508247 0.0941547 -0.0216781
+0.00716942 0.125754 -0.00749941
+0.000702847 0.0392103 -0.00758345
+-0.0407154 0.0462046 -0.018322
+-0.0401921 0.166668 -0.0117758
+0.0124864 0.11785 -0.0149995
+-0.0887986 0.114294 0.0264066
+-0.0614886 0.156862 -0.0235899
+0.0301602 0.0673157 0.0417954
+-0.0697061 0.156309 0.0202886
+0.0512708 0.0700979 0.0242688
+-0.00208274 0.0390983 0.0321346
+-0.091649 0.146116 0.0221478
+-0.0423664 0.0392174 0.0434612
+-0.0288487 0.0944704 -0.0247187
+-0.0724483 0.148649 -0.034807
+0.0270658 0.12207 0.0196667
+-0.0370838 0.159234 -0.0122889
+-0.00750248 0.0619634 0.0561006
+-0.0533112 0.162693 5.53048e-05
+-0.00276518 0.0755391 -0.036261
+-0.0186814 0.0539839 -0.0321072
+-0.0875792 0.134961 0.00324767
+0.0120758 0.0363869 0.044646
+-0.0753955 0.0901087 0.0394375
+0.0338247 0.108829 -0.00728203
+-0.0444976 0.0789577 0.0421738
+0.0235632 0.0862591 0.0483322
+0.0465947 0.0750442 0.0151558
+-0.0733825 0.135448 0.0501828
+-0.0150618 0.0383341 0.0229424
+-0.00891681 0.0351082 0.0414685
+0.0315143 0.0525771 -0.0117816
+0.045527 0.0791773 0.00219591
+-0.0464963 0.076159 0.0423522
+-0.0708979 0.122353 -0.00862039
+-0.08595 0.110378 0.0213654
+-0.0783775 0.103446 0.0335489
+-0.0758029 0.111217 -0.00664466
+-0.0554837 0.0805968 0.0447827
+-0.0353516 0.166776 -0.00214363
+0.0562979 0.0633024 0.00123284
+0.0465716 0.0440008 0.0231655
+-0.0476369 0.0591928 -0.0118235
+-0.0288774 0.169748 -0.00856256
+0.0153133 0.121135 -0.0105519
+-0.0397313 0.072486 -0.017441
+-0.016397 0.0337307 -0.02279
+0.0603039 0.0650788 0.0091381
+-0.0878637 0.152463 0.0169978
+-0.0754938 0.127441 0.0530403
+-0.067202 0.162346 -0.0569974
+-0.0865386 0.147279 0.0332936
+-0.0535025 0.0440354 0.0449405
+-0.0735938 0.149845 -0.0348818
+-0.0728566 0.162156 -0.0114327
+0.0495045 0.0651553 0.0285253
+0.012555 0.130318 0.0128667
+0.0220735 0.113988 0.0356074
+0.0224569 0.125562 0.0179459
+-0.0810243 0.0936828 -0.00856919
+-0.0756675 0.155622 -0.00260296
+-0.0431622 0.0422126 -0.0213185
+-0.000694781 0.0597985 -0.0333207
+0.0271246 0.0849281 0.0463473
+0.0173609 0.0897252 -0.0270298
+-0.0358944 0.0334964 -0.0263993
+-0.0576531 0.0612704 -0.00372094
+-0.00707611 0.0386628 0.0278929
+-0.0560526 0.151627 -0.00172465
+-0.030326 0.045 0.0496314
+-0.00103499 0.117326 -0.0163697
+-0.0252491 0.162472 -0.00507229
+0.00208806 0.113117 -0.0199282
+-0.0939 0.124133 0.015262
+-0.0129795 0.0384272 0.0232864
+0.00120237 0.0867098 -0.0346725
+0.0353317 0.112044 0.0241962
+0.00450167 0.0459455 0.0484199
+-0.0863511 0.0872693 0.000483167
+-0.0164554 0.0963571 0.0512639
+0.0121283 0.11013 -0.0187853
+-0.0778795 0.103388 -0.00866618
+0.0245137 0.102392 -0.0184072
+0.0201875 0.0974057 -0.022456
+-0.0168907 0.0921233 -0.0358082
+-0.0691832 0.153837 -0.0495596
+0.0155185 0.129225 0.0096832
+-0.00814574 0.0386661 0.000442505
+-0.0927289 0.125458 0.0102641
+-0.0846445 0.0832051 0.023501
+-0.0527541 0.0782706 -0.0196088
+-0.0206459 0.171255 -0.0142383
+0.0273486 0.110085 0.0362063
+-0.0144833 0.105825 0.0431811
+-0.0295885 0.120405 -0.00932945
+-0.0914492 0.117418 0.0293041
+-0.0259115 0.159753 -0.0130913
+-0.0498456 0.123179 -0.0101809
+0.0474532 0.047084 -0.00164907
+0.0201466 0.0658754 0.0483972
+-0.0546819 0.0486825 0.0116705
+0.0366139 0.0573407 -0.00875458
+0.016382 0.0888799 -0.0281622
+-0.0128318 0.0653357 0.0541739
+-0.0495043 0.073253 0.0416255
+0.0380257 0.084795 0.0357219
+-0.055962 0.148162 0.0296522
+-0.00335679 0.11693 -0.0159223
+-0.0164885 0.0382449 0.0155037
+-0.0943085 0.12145 0.0162821
+-0.0604949 0.104288 0.0411949
+-0.0485787 0.153602 0.0103738
+0.0214629 0.119376 0.0329783
+-0.00921964 0.0390042 -0.0131222
+0.046038 0.044353 0.0245911
+0.00963825 0.115048 0.0386641
+-0.077742 0.161125 -0.0199262
+-0.0274983 0.0932247 0.0447643
+-0.0237144 0.062529 -0.0332478
+0.0256802 0.0685786 0.0440967
+-0.000627469 0.039269 0.0340794
+0.0387649 0.0834441 0.0350467
+-0.0144799 0.123658 0.0314246
+-0.0415001 0.0733705 0.042415
+0.0543119 0.0722872 0.00750454
+-0.0799536 0.133905 -0.00443135
+-0.0728995 0.10646 -0.0108772
+0.0465866 0.0714909 0.00427537
+-0.0734754 0.158245 -0.0309204
+-0.0217961 0.0784868 -0.0389208
+0.0328256 0.0611992 -0.0167775
+-0.00849082 0.119665 0.0373867
+-0.0345047 0.106995 0.0387065
+-0.0624367 0.153758 -0.0135798
+0.0343704 0.104711 0.0323207
+-0.0583832 0.0335298 0.00219999
+0.0202943 0.113982 0.0365633
+0.0149493 0.0344805 -0.015521
+0.0238985 0.104719 0.0399907
+-0.0270163 0.155641 -0.00359794
+-0.0207265 0.111071 -0.0196229
+0.00439792 0.0404664 -0.024069
+-0.0314988 0.165308 -0.00534483
+-0.0506374 0.0334455 0.00204379
+-0.0518913 0.130385 -0.00375074
+0.00347876 0.039945 0.0459765
+-0.0174912 0.108558 0.0415716
+-0.0618685 0.158412 -0.0345942
+-0.0509699 0.122064 -0.0109984
+-0.0801245 0.0746668 0.000525034
+0.0485976 0.0429932 0.0132228
+0.0202555 0.0707617 -0.0282449
+-0.086473 0.130788 0.000288786
+-0.0859798 0.13928 0.042828
+-0.0419021 0.157999 0.00424081
+0.0301266 0.0646197 0.0417292
+-0.0241332 0.0349697 0.043675
+-0.0554996 0.0466308 0.0421953
+0.0244135 0.114257 -0.0111426
+-0.0687634 0.168362 -0.025835
+-0.0212185 0.178615 -0.022031
+0.0451425 0.0775553 0.0229667
+0.0084768 0.116844 0.0380952
+-0.0619218 0.112503 -0.0143567
+0.0015045 0.0661578 0.0563313
+-0.0473123 0.0369901 -0.0152765
+0.0576745 0.0551294 0.00518333
+-0.0736262 0.148585 -0.0238576
+0.055706 0.0507437 0.0211984
+0.0038008 0.130941 0.0210967
+-0.0360463 0.0347343 0.0430826
+-0.0865396 0.139093 0.00420465
+-0.000664914 0.0539666 -0.0309917
+-0.0785368 0.0694183 0.0145853
+-0.0521695 0.144678 0.0173655
+0.0205519 0.0414936 -0.0177079
+-0.0764027 0.109871 -0.00664525
+-0.0455151 0.0533187 0.0381544
+-0.010362 0.0388675 -0.00761727
+-0.0465826 0.121367 -0.0123258
+0.060067 0.0636708 0.0191758
+-0.0214848 0.0347602 0.0479269
+0.0295458 0.115836 -0.00482165
+0.0188031 0.106638 -0.0169667
+-0.00873489 0.068452 -0.036144
+-0.0504955 0.0733248 0.0417999
+0.00250961 0.101617 0.0444387
+-0.0134598 0.0645734 0.0539775
+-0.0304851 0.038633 -0.015152
+-0.00443456 0.111901 -0.0205597
+-0.038606 0.0392918 -0.0284798
+-0.022624 0.0450535 -0.0281102
+0.0262273 0.117277 0.0307934
+0.0282585 0.063629 -0.0207965
+-0.0649158 0.115218 -0.010913
+-0.0197994 0.0799106 -0.0390737
+-0.042508 0.0930307 0.0424902
+-0.0683794 0.0434664 0.00169373
+-0.0648724 0.131147 0.0430922
+-0.00487539 0.105927 -0.0225105
+-0.0678583 0.112732 0.0457592
+0.00821621 0.124741 -0.00840458
+-0.0564446 0.0520481 -0.00138381
+-0.020896 0.107686 -0.0220438
+-0.0919111 0.120015 0.00829626
+-0.0188214 0.0841215 -0.0388306
+-0.00848834 0.10866 0.0434392
+-0.0674721 0.0639504 -0.00252382
+-0.0321962 0.0487152 0.0429222
+0.0422051 0.0972089 -0.00180239
+-0.0312857 0.125233 0.0186818
+0.0348151 0.0605689 0.0379285
+-0.07566 0.1555 -0.0199215
+-0.0582195 0.03947 0.0465299
+-0.0144966 0.0687907 0.0546395
+-0.0630713 0.173863 -0.0616798
+0.0398379 0.0874103 0.0331324
+0.0167269 0.0821369 0.052401
+0.0403742 0.101353 -0.00282827
+-0.0622911 0.150653 -0.0125749
+-0.0707931 0.0879477 -0.0165704
+0.048521 0.043083 0.00923259
+0.0132697 0.0603324 0.0507028
+-0.0230427 0.038006 0.0179945
+0.0585617 0.0538351 0.0161785
+-0.0548868 0.108372 -0.0183778
+-0.0712698 0.156094 0.0241098
+-0.0053845 0.126096 -0.00772897
+-0.076026 0.151346 0.0359505
+0.00881068 0.127643 0.0286728
+-0.0229191 0.119996 -0.0109969
+-0.0702091 0.156071 0.0113882
+-0.0285896 0.0704574 -0.0325207
+-0.0373694 0.173381 -0.00150317
+0.043508 0.0438731 -6.08517e-05
+-0.0434927 0.0747943 0.0426652
+-0.0817644 0.0758778 0.0206878
+-0.00439411 0.0968663 -0.0305974
+0.00748123 0.0937253 0.0527164
+0.0101565 0.0860282 0.0551829
+-0.0132478 0.039072 0.0352601
+-0.0786774 0.168631 -0.0343418
+-0.0500333 0.148713 -0.00320857
+0.00694939 0.128215 0.0280149
+0.0132662 0.0737717 -0.03084
+-0.089989 0.142041 0.0291697
+-0.0298412 0.0944347 -0.0243277
+-0.0866185 0.103641 0.022352
+0.0179014 0.114016 -0.0148856
+0.0537258 0.0735615 0.0163564
+-0.0413654 0.128702 0.0120304
+-0.0855876 0.0939777 -0.00157288
+-0.0828574 0.0764021 0.018249
+-0.0454932 0.0491469 0.0390026
+-0.0317045 0.0693753 -0.0244624
+-0.0587034 0.0579543 0.010904
+-0.0269178 0.034755 0.0450156
+-0.0520173 0.146257 0.0174096
+-0.0759561 0.112612 -0.00567952
+-0.0164906 0.0786958 0.056769
+-0.0778425 0.108614 0.0370385
+0.0422463 0.0403355 0.0183005
+-0.0845698 0.0831877 0.0245094
+0.00429984 0.0654625 -0.0332399
+-0.0572715 0.0482006 0.0365817
+0.0290027 0.0741128 0.0436952
+-0.0600502 0.143934 0.0360579
+0.0366467 0.0673305 0.0371158
+-0.0199983 0.126616 0.0197793
+-0.0728415 0.165906 -0.0186805
+-0.0634251 0.128316 0.0434644
+-0.0437757 0.12944 0.0066621
+0.000274533 0.0683164 -0.033854
+0.00152244 0.03707 0.0220484
+-0.0349517 0.151884 -0.00344832
+-0.0271199 0.0347243 -0.0201972
+0.0433938 0.0426486 0.00136855
+0.000501319 0.0576739 0.0545888
+-0.0636327 0.155181 -0.0386163
+-0.0884108 0.0928321 0.00744302
+-0.0495652 0.0614019 0.0343808
+-0.0434939 0.0930777 0.0427388
+-0.0662865 0.178231 -0.0601734
+-0.054498 0.111159 0.0367038
+-0.0460532 0.057401 0.0380948
+-0.0820259 0.0858257 0.0320864
+-0.0277337 0.0521019 -0.0243965
+-0.00442413 0.130145 0.0224484
+-0.00149759 0.0549023 0.0548542
+-0.035558 0.0430076 -0.0284728
+0.0593498 0.066038 0.0207029
+0.0515344 0.0624078 0.0294591
+-0.0197872 0.118912 -0.0118682
+-0.0168075 0.0827608 -0.0394117
+-0.0487872 0.0545643 0.0352206
+-0.0311424 0.174761 -0.015609
+-0.0326324 0.0534241 -0.0105104
+0.00577065 0.131636 0.0103849
+-0.0185368 0.123815 0.0276913
+-0.0454963 0.0818291 0.0431013
+-0.0634376 0.179008 -0.0598746
+-0.00652958 0.0443624 0.0478753
+-0.0308041 0.0566412 -0.01742
+0.0448472 0.0735234 0.00122364
+-0.00349567 0.0504603 0.052334
+-0.0298753 0.0537337 -0.0203803
+-0.00256734 0.0388997 -0.00235847
+-0.0502892 0.0334774 -0.00701976
+-0.00481396 0.0840888 -0.0377627
+0.0387801 0.058953 0.031306
+-0.0243507 0.0852386 0.0537426
+-0.077502 0.0785105 0.0333799
+-0.0695501 0.0378481 -0.00149869
+-0.0313945 0.0862693 -0.0285563
+-0.0759552 0.133992 -0.00682355
+-0.0783042 0.161088 -0.0239376
+0.0512217 0.0595245 0.030012
+0.0455105 0.0777762 0.00219892
+-0.0860997 0.0805682 0.0085045
+-0.0347118 0.121713 -0.00868145
+-0.0621446 0.0384632 0.0179813
+-0.0124987 0.115524 0.0391996
+-0.0407326 0.0341812 -0.0112599
+-0.0762949 0.0689313 0.00454567
+-0.0900211 0.137875 0.0231818
+0.0335661 0.0612752 -0.015761
+-0.0620569 0.121268 0.0436785
+0.0389827 0.104151 0.026189
+-0.0724692 0.135469 0.0497506
+0.0222613 0.0692548 -0.0269722
+-0.0614967 0.0876222 0.0452319
+-0.0694862 0.120387 0.0531587
+0.0384699 0.0786144 -0.011749
+-0.0225096 0.10992 0.040117
+0.0140839 0.123776 -0.0073928
+0.0455444 0.0774866 0.0217209
+0.0421217 0.0751567 0.0292241
+-0.0637125 0.165316 -0.0311513
+0.00714876 0.108764 -0.0200496
+-0.0613421 0.118288 0.041013
+0.0150763 0.0900809 0.0517899
+0.0392297 0.0926988 -0.0100859
+-0.0707648 0.0836514 -0.0167885
+0.0199669 0.107838 -0.0162613
+-0.0573264 0.0521522 0.00163442
+0.03817 0.0983612 -0.0088053
+-2.43522e-05 0.0348774 0.0110061
+-0.0647928 0.0346609 0.0159953
+-0.0765127 0.164562 -0.0208538
+-0.0398786 0.107079 -0.0200332
+-0.0315509 0.053914 -0.013393
+-0.0689152 0.109432 -0.0116742
+-0.0426992 0.0344898 0.0348747
+-0.0113643 0.182132 -0.0288209
+-0.0251052 0.162299 -0.0151004
+-0.0745879 0.156108 0.0200327
+-0.0686632 0.162379 -0.0529737
+-0.0867316 0.100467 0.0250232
+0.0335218 0.0499029 0.0322045
+0.0110844 0.0345718 0.0406762
+0.047975 0.0710438 0.0215578
+-0.0471313 0.132491 0.00541336
+0.0385464 0.0954957 -0.00890109
+-0.055495 0.154378 0.0181054
+-0.0486202 0.0403225 0.04496
+-0.0918049 0.121541 0.0434848
+-0.0427276 0.129253 0.0100405
+-0.0641572 0.150753 -0.03179
+0.0203307 0.08353 0.050588
+-0.0025157 0.127417 -0.00520554
+-0.0664375 0.153657 -0.0486366
+0.00823253 0.112336 0.0401545
+-0.0239671 0.075324 0.0508435
+-0.0519769 0.0340995 -0.0134375
+-0.0444607 0.0902688 0.0428496
+-0.043053 0.153237 -0.00732462
+-0.0520076 0.145723 -0.00116844
+-0.0587286 0.0620484 0.0269094
+-0.0876727 0.111787 0.0358475
+-0.0843489 0.0925325 -0.00454911
+-0.00849886 0.0856701 0.0574538
+-0.0681283 0.146379 -0.0251159
+-0.0800217 0.102057 0.0324029
+-0.0662458 0.167287 -0.027765
+0.0214869 0.0865002 0.0492244
+-0.0485551 0.129676 -0.000935313
+-0.021529 0.17126 -0.0137526
+0.0263623 0.0808978 0.0469671
+-0.00180556 0.0384438 0.0201303
+0.0199827 0.116932 -0.0120267
+0.000700235 0.0374335 0.0215506
+-0.0849215 0.130733 -0.00170191
+-0.0566837 0.0492811 -0.00237706
+0.013902 0.054865 0.0498147
+-0.0487235 0.0738176 -0.0166605
+-0.0588289 0.089737 -0.0207103
+-0.00415565 0.0996194 0.0496007
+0.00922789 0.0860105 0.0556146
+-0.052373 0.126911 0.0347775
+-0.0647638 0.0397203 0.0149016
+-0.0375028 0.102851 0.0403695
+0.012678 0.130036 0.0186174
+0.01582 0.0346802 0.0234839
+-0.0834012 0.146003 0.0386574
+-0.0855432 0.111388 0.0330811
+-0.0905559 0.1297 0.0402277
+0.0225 0.108418 0.039052
+-0.034538 0.033729 0.00866796
+0.0580527 0.0523859 0.0111812
+0.0489522 0.045877 0.023734
+-0.0741385 0.0703655 0.0287707
+-0.0261092 0.0409213 0.0540071
+-0.0124916 0.0801274 0.0575032
+-0.0480938 0.0362157 0.0456887
+0.0295798 0.047722 0.0354768
+-0.051366 0.129708 0.032749
+-0.0258406 0.0339312 -0.0210821
+-0.0627466 0.0751872 -0.0173542
+-0.0208698 0.104444 -0.0228641
+0.0391583 0.108387 0.0121653
+-0.0217873 0.0728206 -0.0385569
+-0.00162182 0.0363065 0.0130228
+-0.0125908 0.182249 -0.0250896
+-0.0463216 0.125305 0.0258345
+0.00739775 0.110951 0.0406753
+-0.0698286 0.0965949 -0.0159812
+0.0495953 0.0662964 -0.000416722
+0.0214 0.116687 0.0346491
+0.0355013 0.0605581 0.0371681
+0.0347485 0.0981702 0.0363481
+-0.0784998 0.130283 0.0530344
+-0.0139533 0.0338864 -0.0205741
+-0.0185901 0.128007 0.0115203
+-0.0538047 0.0884108 -0.022116
+0.0213383 0.0635548 -0.0266585
+-0.0194915 0.120861 0.0324568
+-0.0347476 0.127441 0.00854521
+-0.0126238 0.0952928 -0.0330113
+-0.00102634 0.107271 -0.0216101
+0.0225395 0.0352111 0.00978173
+0.0193228 0.0679612 -0.0287395
+0.00111873 0.0344764 0.0134191
+0.0375161 0.110639 0.00638069
+0.0222494 0.0762728 -0.0263867
+-0.0729386 0.0646873 0.0146181
+-0.0397368 0.0739371 -0.0178005
+-0.0543178 0.0387289 0.0471882
+0.016338 0.0566541 -0.0286494
+0.0299119 0.0491593 0.0359714
+0.0525507 0.0462401 0.0172033
+0.0138891 0.0942573 -0.0257865
+-0.00745761 0.0338748 -0.0230567
+-0.073507 0.121801 0.0535653
+-0.0771635 0.0705018 0.0227664
+0.014215 0.083589 -0.0300782
+0.0187635 0.105558 -0.0177865
+-0.0943455 0.121485 0.0232874
+-0.0190471 0.0582949 0.0492947
+-0.0482842 0.164088 -0.00583628
+0.00750123 0.074495 0.0564449
+0.0114903 0.0896115 0.0540357
+0.0111129 0.0739356 0.0547693
+-0.0243199 0.0387345 -0.0140132
+0.0343886 0.107359 0.0305696
+0.0280618 0.0416802 0.0314173
+0.01142 0.0374719 -0.022733
+0.0330999 0.114889 0.024788
+-0.0199406 0.122541 -0.00772092
+-0.0662581 0.15274 0.0347724
+0.00215199 0.101646 -0.0224127
+0.0164932 0.112605 0.0382483
+-0.06512 0.166493 -0.0287867
+-0.0848366 0.0898781 -0.00356125
+-0.0321536 0.0380399 -0.0168
+-0.000666067 0.037425 0.0194672
+-0.0009793 0.0356154 0.0137824
+-0.0338572 0.100054 -0.0225702
+-0.0466969 0.0694537 -0.0155404
+-0.0236112 0.0386852 0.0334692
+0.0506847 0.044695 0.00922239
+0.0143403 0.11733 -0.0144441
+0.0447757 0.0875223 -0.000814326
+0.0359341 0.0727624 -0.0138488
+-0.0526285 0.0588799 -0.00854194
+-0.090746 0.114598 0.00833305
+0.0454568 0.0819591 0.00221362
+-0.0191965 0.175667 -0.0232885
+-0.062765 0.0780997 -0.0182585
+0.0414338 0.0676164 -0.00577635
+-0.053491 0.113891 0.0350292
+0.0043588 0.0510132 -0.0293749
+-0.00874604 0.0713519 -0.0371122
+0.0193852 0.0915557 -0.024942
+-0.0944514 0.122808 0.0172688
+-0.00774122 0.115628 -0.0165086
+-0.0406319 0.0534345 -0.0110028
+0.0230588 0.0463265 0.0401038
+-0.0769246 0.0689689 0.00654258
+0.0278197 0.108769 0.0368873
+-0.078478 0.142827 0.0455967
+0.0339472 0.0368914 0.0179028
+0.0140143 0.0357038 0.00388789
+-0.0699623 0.155307 -0.0499609
+-0.0144161 0.0343188 -0.0191903
+-0.044261 0.122001 0.0258917
+-0.064466 0.170264 -0.0443864
+-0.0614851 0.112533 0.0365644
+-0.0649074 0.120907 -0.00883756
+0.0114806 0.097647 0.0487825
+0.00178793 0.0344587 0.00626566
+0.0404914 0.098527 -0.00482713
+-0.0714142 0.166619 -0.0469903
+0.0553639 0.0729653 0.0110394
+-0.00645384 0.126073 -0.0076982
+-0.042494 0.0676556 0.0412962
+-0.0328931 0.0486572 0.0421875
+-0.0218312 0.0882119 -0.0370399
+0.0433826 0.0987102 0.00417641
+-0.034498 0.0533048 0.037996
+-0.0749535 0.0823401 -0.0135889
+-0.0755022 0.131669 0.0524935
+-0.0118269 0.118985 -0.0140536
+-0.0698809 0.100876 -0.0145572
+-0.0920212 0.128183 0.00926455
+-0.0277533 0.155598 -0.00253083
+-0.0155991 0.0421323 -0.0272897
+0.0125549 0.119968 -0.0132874
+-0.0862929 0.15121 0.027304
+-0.0726068 0.147127 -0.0218633
+-0.0713282 0.0982044 0.0407618
+-0.023785 0.0621839 0.0426152
+-0.0294793 0.0446083 0.0503994
+0.050676 0.0693821 0.00244948
+-0.0520559 0.142894 8.38275e-05
+-0.085494 0.083212 0.00349969
+0.0219046 0.0892697 -0.0245066
+-0.0923861 0.125586 0.0352607
+-0.0578149 0.12313 -0.00798101
+-0.0630458 0.0345815 0.0177326
+-0.0890554 0.0888307 0.00946144
+-0.066735 0.167252 -0.0265095
+0.0143257 0.0594816 -0.0287805
+0.00349695 0.0519735 0.0532512
+-0.0658642 0.141582 -0.00840157
+0.014169 0.0603418 0.050255
+-0.0638047 0.152122 -0.00224548
+0.0332402 0.0814034 -0.0189012
+-0.0246071 0.0408479 -0.0291354
+-0.0320867 0.0651952 -0.0194497
+-0.0719291 0.0394019 0.00652921
+-0.0297834 0.0409697 0.0520218
+-0.035582 0.0336826 0.00849877
+-0.088744 0.0996845 0.0203875
+0.0516874 0.0662489 -0.000355134
+-0.0802571 0.096729 0.0342047
+-0.0669809 0.135535 -0.00827796
+-0.069479 0.0337046 -0.000209101
+-0.0675145 0.148386 0.0398761
+-0.0805311 0.123088 0.0509172
+-0.0084955 0.0503277 0.0510127
+0.00205693 0.129985 1.8398e-05
+-0.0172313 0.12808 0.0178394
+0.00170313 0.0343139 0.0118694
+-0.0773727 0.156953 -0.0129034
+-0.0717154 0.0632455 0.0160979
+0.00858548 0.0340902 -0.01633
+0.0124197 0.0403679 -0.0230567
+-0.0511271 0.116882 0.0329705
+-0.0728598 0.0355014 0.00645302
+-0.0791962 0.16801 -0.0379842
+-0.00268972 0.128069 -0.00389854
+0.0597918 0.0567046 0.013171
+0.0154995 0.111258 0.0392925
+-0.019299 0.0668878 0.052102
+-0.0233826 0.0866124 0.0541509
+0.0432138 0.091668 0.0251628
+-0.0396808 0.0636721 -0.0135815
+0.00652038 0.0518639 0.0525018
+0.0124104 0.0389053 -0.0225983
+-0.0119403 0.171322 -0.0192115
+-0.069435 0.0972593 0.0417284
+-0.0942583 0.125557 0.0232684
+0.030238 0.0814876 -0.0201701
+0.0449279 0.0945923 0.00916323
+-0.0553588 0.131132 0.0357618
+0.00929414 0.0653548 -0.0316941
+-0.0357484 0.0768864 -0.0192776
+-0.062693 0.156802 -0.0376031
+-0.0460193 0.128067 0.0236255
+0.0133301 0.0609017 -0.0290805
+0.00152141 0.0773467 0.0574533
+-0.0636035 0.156128 0.0166435
+-0.0361137 0.162217 -0.0137308
+-0.0595062 0.0386574 -0.00901889
+-0.0620309 0.153757 -0.0155846
+-0.0533723 0.122605 0.0368904
+-0.0264702 0.0676761 0.0408217
+-0.0147452 0.123455 -0.00671201
+-0.0703548 0.0643588 0.00158224
+-0.0814272 0.0752484 0.0195365
+0.0402499 0.0787503 -0.00875238
+-0.00644119 0.0828529 0.0570838
+0.0242228 0.0902502 0.0474811
+0.0336268 0.0557054 -0.0117007
+-0.0623153 0.13671 0.0362243
+0.0149059 0.124307 -0.00595517
+-0.0401601 0.165169 -0.0119868
+-0.077431 0.108115 0.0357399
+0.0402513 0.0940026 0.0302416
+0.0370616 0.0382621 0.0191175
+0.0225195 0.106011 0.0397482
+-0.0255993 0.037974 -0.029094
+-0.0759547 0.129619 -0.00760722
+-0.0360191 0.153642 0.00214438
+0.0596848 0.0566967 0.0151763
+-0.0264473 0.181471 -0.0150302
+-0.0346676 0.0359024 -0.017193
+0.0391135 0.0904981 -0.0117677
+0.00550174 0.0745058 0.0566062
+-0.0615874 0.117934 -0.0105067
+-0.0897323 0.115129 0.0291209
+0.0371127 0.037099 0.0128773
+0.000643571 0.127035 0.0301068
+0.04471 0.0789677 0.024116
+-0.0294983 0.0588236 0.0368769
+0.0243457 0.102123 0.0424029
+-0.0890326 0.125361 0.00330134
+-0.0671124 0.0618759 0.00376788
+0.0207378 0.105279 -0.0174962
+-0.0640597 0.156709 -0.043612
+-0.053836 0.112592 -0.0169505
+-0.0738585 0.0762694 0.0355202
+-0.00709045 0.130506 0.0171336
+-0.0735939 0.077695 0.036626
+-0.0453238 0.169855 -0.00399069
+-0.0609112 0.060145 0.00105228
+-0.0602298 0.119796 0.0409592
+-0.037803 0.0885803 -0.0235006
+0.0220645 0.0375334 0.0362702
+-5.6077e-05 0.112952 -0.0196345
+-0.0156034 0.097548 -0.0273897
+0.0330435 0.104766 0.033885
+0.0234619 0.0343557 0.00702041
+0.0309186 0.094253 -0.0177648
+-0.0406484 0.0563266 -0.0113192
+0.0305338 0.0929359 0.042541
+-0.0713282 0.155382 -0.0439108
+-0.0246656 0.0492403 -0.0269082
+-0.0344954 0.118007 0.0312549
+0.03264 0.0822319 0.0419892
+0.0393737 0.0381589 0.0105128
+0.00986741 0.131059 0.0147331
+-0.0521114 0.156091 -0.00406652
+0.0125143 0.121868 -0.0113432
+-0.019839 0.0610753 0.0486026
+-0.0714347 0.109953 0.0409933
+-0.0435006 0.115257 0.0335166
+-0.0700918 0.147968 0.0410511
+-0.0628279 0.151059 0.0360546
+-0.0269995 0.0383068 0.000625566
+-0.0459023 0.0546326 0.0380387
+-0.0705411 0.0860609 0.0417748
+-0.0360717 0.157766 -0.0114869
+0.018169 0.108481 -0.0169141
+-0.0656915 0.0720893 -0.0135891
+-0.0604976 0.0847283 0.0441029
+0.00648432 0.0413231 0.0455852
+-0.0757282 0.0754387 0.0328339
+0.00417753 0.0922823 -0.0325433
+-0.0272993 0.0381948 -0.0178418
+-0.0315044 0.0860003 0.0426216
+-0.00681874 0.0868473 -0.0370495
+0.0396972 0.0744788 -0.00980523
+0.0376515 0.0947835 -0.010301
+-0.078491 0.121738 0.0515581
+-0.0274838 0.105666 0.0409158
+-0.0202559 0.0365056 -0.0280118
+0.0201693 0.125674 0.00144037
+-0.0587501 0.0482189 0.00571238
+-0.013346 0.168342 -0.0159797
+-0.0683811 0.149044 -0.0363633
+-0.0558475 0.0343686 0.0374162
+-0.0590903 0.0626036 0.0281123
+-0.0331372 0.0336314 -0.0222436
+-0.0678611 0.0980605 -0.0159397
+-0.0472308 0.0334623 0.00452598
+-0.0167567 0.0714512 -0.0386579
+-0.0184671 0.10319 -0.0232847
+-0.0675365 0.0805511 0.0417814
+-0.0666009 0.15275 -0.0468174
+-0.00387787 0.10737 -0.022403
+-0.0300213 0.0579734 -0.0204069
+-0.00579466 0.103184 -0.0232761
+-0.0775304 0.143071 -0.00473432
+-0.00757151 0.0346922 -0.0244599
+-0.0355091 0.0676694 0.0413832
+-0.0185092 0.127137 0.00354165
+0.0289004 0.0650837 -0.0199869
+-0.0224914 0.04868 0.0491885
+-0.0194885 0.0856172 0.056795
+-0.0625301 0.147537 -0.0105732
+0.00324634 0.0726279 -0.0347233
+-0.0117444 0.129778 0.0154481
+0.0381223 0.106958 0.0251953
+0.0134297 0.0343278 -0.0118215
+0.00450615 0.0772491 0.0561317
+0.00914326 0.112364 0.0397506
+0.0165994 0.0933382 -0.024824
+-0.0530349 0.0448324 0.0176964
+-0.0861503 0.0818963 0.00748815
+-0.07574 0.144451 -0.00587632
+-0.0796195 0.104749 0.0319273
+0.0404835 0.052774 0.0322642
+0.0420568 0.0986443 0.0231563
+-0.0887511 0.102351 0.0133854
+0.0132668 0.0723896 -0.0312102
+-0.0507233 0.0723393 -0.0157137
+-0.00754786 0.039018 -0.00905888
+-0.0488259 0.138613 0.00940263
+0.0057745 0.128094 -0.00399317
+-0.0523396 0.147791 0.0193952
+-0.048265 0.136372 0.0159973
+-0.0604426 0.0470258 0.0346715
+0.0367367 0.0902141 0.03744
+-0.0895793 0.136441 0.0122186
+0.0376089 0.108292 0.000165208
+0.0353713 0.0915869 0.0389643
+-0.0211976 0.0347654 0.0444796
+0.00223085 0.129379 -0.00131325
+-0.0737831 0.0864021 -0.0154104
+-0.0127393 0.0700008 -0.0380391
+-0.0657273 0.0751276 -0.0164058
+0.00937487 0.0377648 0.0302588
+-0.035816 0.0448118 0.0437923
+-0.0549046 0.102722 -0.0198351
+0.0460481 0.046714 0.0276632
+0.00759173 0.131318 0.00819364
+-0.0721931 0.161015 -0.0399435
+0.0102622 0.0710503 -0.0323195
+0.0194745 0.0851519 0.050256
+-0.0399319 0.0345158 0.0389424
+-0.0616692 0.167812 -0.0545903
+-0.0056922 0.0584499 -0.034018
+-0.0203692 0.094546 -0.032294
+-0.070351 0.158156 -0.0469171
+-0.023866 0.103031 -0.0237009
+0.0528846 0.0533107 -0.0017243
+-0.0319516 0.077812 -0.0315646
+0.00951738 0.0660057 0.0546772
+0.0137336 0.122464 0.0333928
+-0.0199595 0.125484 -0.000738697
+0.00049871 0.116947 0.0399069
+-0.0359892 0.0344491 0.0345711
+-0.0443682 0.129764 0.015339
+0.0452819 0.0932028 0.00617084
+-0.00813465 0.0391286 -0.0130168
+0.0394097 0.0618135 -0.00677045
+-0.0701845 0.158483 -0.00465374
+0.0322675 0.102123 0.0362847
+-0.0374987 0.0819015 0.0436538
+0.0396969 0.0616754 0.0309066
+-0.0455673 0.0475992 -0.010259
+-0.0527627 0.115451 0.034109
+0.0208176 0.0631975 0.0476002
+-0.0618301 0.0924936 -0.0189652
+-0.053883 0.150856 0.0253998
+0.0245243 0.105615 0.0392344
+0.00385761 0.129628 0.0254511
+-0.00549072 0.0488848 0.0502608
+-0.0300389 0.036799 0.0524219
+-0.0580426 0.153536 0.0303048
+0.0220166 0.125337 0.0220596
+0.0312265 0.0393227 0.0260732
+-0.0171047 0.17569 -0.0178772
+0.016571 0.0940211 0.0486896
+-0.0505514 0.0338848 0.0267025
+-0.0625417 0.0410514 0.0154849
+0.0355348 0.112677 0.0214127
+0.00150774 0.0897546 0.056027
+-0.0190957 0.0968508 -0.0266962
+0.0511508 0.0608575 0.0299274
+0.0163905 0.0491901 -0.024833
+0.0345652 0.114846 0.0110543
+0.0581139 0.0523629 0.0131822
+-0.0417396 0.0754091 -0.018561
+-0.0814751 0.118981 0.0489466
+0.00013405 0.105909 -0.0216496
+-0.0908345 0.139239 0.02018
+-0.0424766 0.101515 0.0416909
+-0.0260624 0.0837492 0.0512652
+-0.0500875 0.0531258 0.0337221
+-0.0706477 0.0874116 0.0418374
+-0.0366978 0.0363155 -0.0300943
+0.00451245 0.064772 0.0563635
+-0.0753069 0.109577 0.0422017
+-0.0284025 0.119846 0.0286714
+0.033406 0.0822268 0.04133
+0.0595932 0.0608555 0.0201843
+-0.00204808 0.0983649 0.051847
+-0.0574847 0.0623327 0.0283417
+-0.0229389 0.126187 0.00412352
+0.0390327 0.0744186 -0.0107818
+-0.0855097 0.129367 -0.00169404
+-0.0647036 0.0653044 0.0298737
+-0.0064934 0.10867 0.043581
+-0.0685164 0.0669975 0.0293604
+-0.0705096 0.1624 -0.046948
+0.0125251 0.129483 0.0214195
+-0.0221845 0.172691 -0.0208918
+0.0153262 0.0767707 0.0538598
+-0.0905235 0.137837 0.0161933
+-0.0545439 0.0402656 -0.0102441
+-0.0688509 0.171089 -0.0344529
+-0.0884641 0.0887716 0.00547605
+-0.0903526 0.116014 0.0283099
+-0.0623807 0.147545 -0.00857398
+-0.061927 0.109672 -0.0156348
+-0.0579856 0.116646 -0.0132522
+0.0395731 0.0448559 0.0300931
+0.00658391 0.130753 0.00354793
+-0.0647804 0.153444 -0.00410741
+0.00522677 0.078235 -0.0342467
+-0.0495662 0.0335706 -0.0032948
+0.00181081 0.131692 0.0146438
+-0.0635975 0.15411 -0.00948093
+-0.0855227 0.133522 0.000289437
+-0.025262 0.107417 -0.0217613
+-0.0340021 0.0409714 0.0491624
+-0.0146057 0.0406867 -0.0271172
+-0.0174894 0.0687336 0.053904
+-0.01522 0.183001 -0.0269465
+-0.0500642 0.142991 0.00242772
+-0.0679313 0.0622594 0.0032802
+-0.0551811 0.133216 -0.00483226
+-0.0284216 0.0792864 0.045297
+0.00824429 0.0809884 -0.0331618
+0.00929618 0.123787 -0.00937811
+0.0228212 0.0889774 -0.0242065
+-0.0185099 0.0883573 0.0560195
+0.0282298 0.0717826 -0.0228933
+-0.0251238 0.125152 0.00185767
+0.019545 0.103378 0.0442321
+-0.0673703 0.122848 0.0518073
+0.0357587 0.067099 -0.014806
+0.00197653 0.0987575 -0.0246237
+-0.0655762 0.155146 -0.00586759
+0.012488 0.119576 0.0355898
+-0.0514967 0.101534 0.0419051
+-0.0095351 0.0444416 0.0488648
+-0.00470695 0.0982478 -0.0280611
+-0.05601 0.0575293 -0.00241387
+-0.0602761 0.139548 0.0339321
+-0.0517453 0.0753545 -0.0181561
+-0.038969 0.042042 0.0415955
+-0.0636896 0.064322 -0.00564195
+-0.0398457 0.0985451 -0.0219087
+-0.0191826 0.127252 0.0185952
+-0.0873123 0.0886781 0.00248146
+-0.0488082 0.0884112 -0.0217819
+-0.0498768 0.104205 -0.0203216
+-0.0409029 0.149467 0.00342301
+-0.069185 0.156032 0.0248455
+-0.0506717 0.0501974 0.0196351
+-0.0301161 0.0396403 0.0523893
+-0.000520242 0.104454 0.0440018
+-0.0290025 0.0578755 -0.022406
+-0.0610145 0.0336026 0.00878975
+-0.0917872 0.143341 0.0171661
+-0.0279974 0.0383174 -0.0050935
+-0.0913132 0.113305 0.0163255
+0.0313508 0.109263 -0.00976359
+-0.00332487 0.0387243 0.0268007
+0.0222104 0.125239 0.00503339
+-0.04503 0.129294 0.00327025
+-0.0176724 0.0933571 0.0538975
+-0.0234883 0.0487024 0.0493089
+0.0421092 0.0724515 0.0291612
+-0.0653912 0.159256 -0.0130566
+-0.00402317 0.0387663 0.0011878
+-0.0338313 0.0929547 -0.0239607
+0.00379004 0.0367184 0.046186
+-0.0186801 0.0525094 -0.0314832
+-0.0351354 0.165203 -0.0147634
+-0.0705038 0.108294 0.0372772
+0.0246817 0.0360382 0.0240669
+-0.0204805 0.0828473 0.0567838
+0.0326609 0.0673309 0.0401471
+-0.0296335 0.0635627 -0.0254272
+-0.0548571 0.0546624 -0.0043828
+0.00968485 0.0342244 -0.0162577
+-0.0810826 0.144759 0.0420272
+0.00767659 0.0346834 0.0054103
+-0.0830301 0.110196 0.00131843
+-0.00544058 0.119032 -0.0141551
+-0.0255852 0.0930492 -0.0306058
+-0.0714911 0.116102 0.0521112
+0.0318609 0.0710037 -0.0187224
+0.0280264 0.121739 0.0100361
+-0.0514799 0.0384723 -0.0115832
+-0.0764395 0.0988661 -0.011539
+-0.0186212 0.04503 -0.027692
+0.0334766 0.0519565 -0.00767966
+-0.0541438 0.151337 0.0259237
+-0.00148294 0.0606073 0.0558577
+0.0148272 0.0344434 -0.00977208
+-0.0391932 0.171233 -0.0109027
+-0.035755 0.0783248 -0.0195335
+0.0355134 0.0795005 0.0390801
+0.0603494 0.0609121 0.0171857
+0.0394635 0.075864 -0.00982057
+-0.0470363 0.0359078 0.0451061
+-0.0608634 0.154346 0.0292597
+-0.0748097 0.109257 0.0407877
+-0.0262745 0.0692227 0.0420449
+0.0243768 0.0533073 -0.022554
+-0.0530668 0.0348658 0.0444554
+0.0259946 0.0347155 0.014606
+-0.0591124 0.121234 0.0408265
+-0.0144894 0.112737 0.0404341
+-0.0838486 0.0803675 0.00250235
+-0.0582446 0.13534 0.0351018
+-0.0214986 0.100246 0.0444424
+-0.0713881 0.068562 0.0291565
+-0.0155474 0.160527 -0.0107791
+0.0215063 0.107058 0.0398344
+-0.0331542 0.158077 0.00281987
+-0.0863235 0.110381 0.0203696
+-0.0312005 0.162424 -0.00314295
+0.0384543 0.0395883 0.0218564
+0.0385307 0.0554981 0.0313684
+-0.0114896 0.0560578 0.0523304
+0.0593092 0.0622231 0.0211664
+-0.0648434 0.0339553 0.0130374
+0.0180082 0.0355585 0.00482766
+0.0399371 0.077993 0.0331058
+0.00160174 0.0351275 0.0454175
+-0.032718 0.0396362 0.0507617
+-0.0524899 0.0973506 0.0433264
+-0.032502 0.104286 0.0408563
+-0.00468764 0.0584239 -0.0337898
+-0.0672529 0.0760725 0.0393761
+0.0584714 0.0552095 0.0201836
+-0.0416396 0.0548863 -0.0113812
+0.014767 0.129313 0.0151085
+0.0271615 0.0578042 0.0426556
+-0.0133509 0.0384568 0.00507202
+-0.0770775 0.0703016 0.00351307
+-0.0514866 0.0748352 0.0426181
+-0.0882111 0.0936365 0.0238814
+-0.0906238 0.143032 0.0276653
+0.0233319 0.059176 0.0459237
+-0.036826 0.0446589 -0.0260242
+0.0332346 0.0955533 0.0394336
+-0.000484271 0.038989 -0.00201961
+0.0427221 0.101476 0.00816485
+0.0419002 0.102864 0.0131587
+-0.0208004 0.181643 -0.0143459
+0.0352424 0.0726953 -0.0147969
+-0.0234839 0.0509996 0.0435588
+0.0352381 0.0443124 0.029693
+0.000403091 0.0348316 -0.0232847
+-0.0684959 0.10279 0.039811
+0.019265 0.0708008 -0.0287723
+-0.0516068 0.0345225 0.0433683
+0.0391514 0.0617239 0.0318804
+0.0135008 0.111258 0.0394003
+0.0304359 0.108504 -0.0109544
+-0.038743 0.0768256 -0.018638
+-0.0223183 0.094515 0.0486399
+-0.0435018 0.0478421 0.040059
+-0.0727332 0.173623 -0.0510446
+-0.00349112 0.118315 0.0390164
+-0.0884421 0.133772 0.0426038
+-0.0454967 0.109818 0.0383281
+-0.0145 0.0392233 0.0384538
+-0.00466385 0.129429 0.0252614
+-0.00582274 0.088227 -0.0364178
+-0.0454902 0.0352033 -0.0224188
+-0.0348607 0.100046 -0.0224582
+-0.0792519 0.17071 -0.0410714
+-0.0376133 0.0393512 -0.0290006
+-0.0640598 0.170094 -0.0457055
+0.0303225 0.119467 0.0166127
+-0.0902791 0.116199 0.0435835
+0.0222032 0.0352055 0.0243097
+-0.073336 0.0968702 0.0400088
+-0.0376144 0.0393494 0.044329
+-0.0105011 0.0870252 0.0569814
+-0.0507332 0.161533 -0.00440491
+-0.0779412 0.162504 -0.0229403
+-0.0754919 0.128859 0.0530266
+-0.0541372 0.0344723 0.0359505
+0.0113242 0.0581457 -0.0297724
+-0.0442953 0.0391467 0.0441537
+0.0242713 0.035754 0.000294462
+-0.0615051 0.159991 -0.0325895
+-0.00166807 0.0568963 -0.03242
+-0.0119937 0.164096 -0.013967
+0.0166698 0.0900802 0.0505874
+0.0232051 0.0672264 0.0457926
+-0.0547028 0.0693497 -0.0142348
+-0.0645039 0.15312 0.03389
+-0.0344884 0.0918084 0.0445658
+0.0553932 0.0493283 0.0071983
+-0.047221 0.115086 -0.0157836
+-0.0737507 0.0835282 -0.0152437
+-0.00700363 0.0992954 0.0501023
+-0.0124605 0.0646213 0.0545516
+-0.0529942 0.0345374 0.0413527
+-0.0926054 0.122844 0.0302746
+-0.0652377 0.0419529 0.0337045
+0.0450967 0.0889619 0.00117113
+-0.0632063 0.0448721 0.0103941
+-0.0177692 0.074285 -0.0389303
+-0.0226723 0.0582322 -0.0321918
+-0.0233871 0.0380454 0.010662
+0.0144228 0.120472 -0.0118376
+-0.00758227 0.0362053 -0.0250795
+-0.0394882 0.0804267 0.0429074
+0.0505096 0.0651476 0.0284061
+0.0412879 0.0914659 -0.00877665
+-0.0613587 0.0343255 -0.00949544
+-0.0739143 0.148544 -0.0218644
+-0.0607701 0.0447346 0.0418038
+-0.0300938 0.0476999 -0.0248901
+-0.0666558 0.0720875 -0.0129051
+-0.0732714 0.156195 0.0132096
+-0.0340151 0.0498932 -0.013349
+-0.0484988 0.0762375 0.0432182
+-0.0614924 0.0384787 0.0187446
+-0.0572292 0.155416 0.0145778
+-0.0105966 0.0391805 -0.0262222
+0.00120442 0.117582 -0.0166604
+-0.070211 0.165211 -0.0489867
+0.0483875 0.0444574 0.00325794
+-0.0764978 0.13308 0.0521415
+-0.035201 0.0345651 0.0381519
+-0.00449959 0.107273 0.0439086
+-0.0266181 0.042276 -0.0292233
+-0.0364985 0.120712 0.0292752
+-0.0735593 0.15583 0.0102013
+-0.0554797 0.0848037 0.0450617
+-0.0845128 0.0817443 0.00347449
+-0.0169788 0.106067 -0.0223329
+-0.0699464 0.151677 0.0365135
+-0.0160243 0.0897174 -0.0373532
+-0.035698 0.0857595 -0.0237144
+-0.0308696 0.105755 -0.0215547
+-0.0475005 0.084795 0.044997
+0.00720445 0.088027 -0.0329216
+0.0388792 0.085648 -0.0137779
+-0.0451911 0.163637 -0.00858913
+-0.0752855 0.176467 -0.0519633
+-0.0568165 0.155074 0.0161832
+0.0369538 0.108295 0.0261877
+-0.0788782 0.172865 -0.0427748
+-0.0439777 0.0345259 0.038072
+0.0238242 0.0981836 0.0451545
+-0.0394936 0.0548399 0.0395943
+0.0242629 0.0790161 -0.0251629
+-0.0665084 0.0903473 0.0440273
+0.0291366 0.0495584 -0.0147305
+0.0191581 0.0357679 0.0376614
+-0.0278785 0.0535209 -0.0244081
+-0.00947834 0.12371 0.0334225
+-0.0570388 0.149629 0.0316784
+0.0117574 0.130329 0.0182774
+-0.00158005 0.131357 0.0134024
+-0.0657222 0.0431534 -0.00229362
+0.0404535 0.0689201 -0.00879299
+-0.0195496 0.161752 -0.0147401
+0.0435566 0.0695959 0.0259839
+-0.0893231 0.14203 0.0321578
+-0.0832597 0.10897 0.0263609
+0.00296745 0.0390391 -0.00510833
+0.0160439 0.0505074 0.0458237
+-0.0213985 0.181639 -0.0134576
+0.000249699 0.0347599 0.0129869
+-0.0138688 0.163706 -0.0171714
+-0.0787597 0.163865 -0.0299483
+-0.0321103 0.178539 -0.0110044
+-0.0062818 0.102371 0.0437669
+-0.0504236 0.113946 -0.0165184
+-0.0808373 0.0858965 0.0337281
+-0.0833697 0.0790868 0.0225099
+0.0174757 0.101745 0.0462033
+0.0562413 0.0521934 0.00418603
+-0.0386753 0.127489 0.0159666
+-0.0714887 0.0860678 0.0412957
+0.00930465 0.0639279 -0.0315779
+-0.038992 0.126654 0.0188148
+-0.0617292 0.0435742 0.0131822
+-0.0807044 0.109603 0.0338418
+0.01567 0.0343236 0.00175615
+-0.0151083 0.184586 -0.0219884
+-0.0792845 0.0704649 0.0170607
+-0.0611161 0.170955 -0.0586033
+-0.0656715 0.0684169 0.0339875
+-0.0346163 0.0505906 -0.0107587
+0.0292004 0.0566287 -0.0178044
+0.0402348 0.101386 0.0251818
+-0.0356488 0.118923 -0.0117804
+-0.00759062 0.117967 -0.0150103
+-0.0344873 0.0959942 0.0440904
+-0.0675456 0.035487 -0.00647
+-0.0177849 0.0784811 -0.0386843
+-0.0357813 0.0828042 -0.0224653
+-0.0217893 0.122494 0.0280004
+-0.040789 0.084093 -0.0212481
+-0.0448136 0.0629573 0.0395248
+-0.0851812 0.137956 0.0449006
+-0.0879612 0.103656 0.0103875
+-0.0558857 0.0998486 -0.020419
+0.017256 0.079507 0.0531399
+-0.0315382 0.178553 -0.0120253
+-0.06991 0.11224 -0.0100103
+-0.0512969 0.0556828 0.0150377
+0.0224682 0.0520683 0.0428376
+0.0143831 0.0448677 -0.0245168
+-0.0794364 0.144805 0.0432098
+-0.0638846 0.103946 -0.0172176
+-0.0284346 0.0849121 0.0465284
+0.0144928 0.11263 0.0387455
+-0.0860797 0.0882889 0.0261675
+-0.00931865 0.0862591 -0.0377315
+-0.0226749 0.0380487 0.0198364
+-0.0875543 0.0861148 0.0194651
+-0.0578317 0.0344516 0.0369209
+-0.0410907 0.157679 -0.0102957
+-0.0680436 0.0337635 0.00720288
+-0.0778811 0.104813 -0.00803583
+0.0518058 0.0553999 0.0290848
+-0.0504997 0.160817 0.00728082
+0.0241356 0.0632152 0.0453534
+-0.0268604 0.100151 -0.0237263
+0.0127955 0.0874066 0.0537621
+-0.0616261 0.155549 0.00719382
+-0.0593595 0.0336431 -0.00899455
+-0.065903 0.0643977 0.026882
+0.0278843 0.0536982 -0.0197695
+-0.0335041 0.0789099 0.0415331
+0.0414488 0.0873044 0.0301508
+-0.0627531 0.161513 -0.0475897
+0.0292606 0.0447502 0.0332372
+0.0105493 0.122164 -0.0116505
+-0.0908004 0.115922 0.00730178
+0.0306755 0.0581744 -0.0167704
+-0.0745653 0.158254 -0.0269305
+0.0417869 0.088692 -0.00877741
+-0.0765465 0.107865 0.0361429
+0.0291715 0.104768 0.0370747
+-0.0435198 0.0436724 -0.0163157
+-0.0639905 0.155091 0.00636862
+-0.0676976 0.156296 0.0180917
+0.0361371 0.0605355 0.0363255
+-0.0831336 0.135327 0.0485953
+-0.0205283 0.125395 0.0225414
+0.0218584 0.126105 0.0106
+-0.0573551 0.0335045 0.00783858
+-0.0766685 0.144473 -0.00485242
+0.0215827 0.0449804 0.0414892
+-0.0623027 0.152202 -0.0135791
+-0.0124889 0.118271 0.037774
+-0.058999 0.129653 -0.00698695
+0.0212269 0.035264 0.00760182
+-0.0558448 0.0533792 -0.00239414
+-0.042206 0.147853 0.000366775
+-0.0732213 0.156852 -0.0309091
+0.00482377 0.0349755 -0.00101746
+0.00553205 0.131427 0.00744951
+-0.0606157 0.0459479 0.0402046
+0.00228793 0.0626666 -0.0335374
+-0.00869718 0.172706 -0.0257786
+0.0265924 0.0466157 -0.0146569
+0.0293044 0.0481199 -0.00974071
+-0.0278981 0.0863323 0.047373
+0.029421 0.0461183 -0.00671048
+-0.058539 0.0588103 0.0191792
+-0.0577583 0.0479183 0.03595
+0.0299489 0.069977 0.0415097
+-0.0877683 0.149882 0.0273982
+-0.0403006 0.122206 -0.0112466
+-0.0731823 0.109139 0.039466
+0.00748061 0.115492 0.0392535
+-0.0323193 0.0339823 0.0197127
+-0.00249248 0.0911617 0.056251
+-0.0410706 0.0335739 0.0056728
+-0.0167629 0.120643 -0.00969861
+0.0170314 0.126681 0.0245104
+-0.0933703 0.118789 0.0242915
+-0.0167466 0.161131 -0.0135692
+-0.037714 0.0710075 -0.016855
+-0.0748306 0.094995 -0.0139518
+-0.0653015 0.169027 -0.0374543
+-0.0171592 0.0387994 -0.0126424
+-0.0649264 0.112407 -0.0127033
+0.0089357 0.131311 0.0143899
+-0.0695053 0.106913 0.0375568
+-0.0679519 0.129695 -0.00900682
+0.0196594 0.10025 -0.0221259
+0.0187375 0.0672729 0.0498973
+-0.0634922 0.0626336 0.0253957
+-0.0640428 0.0593154 0.0139941
+-0.0365043 0.0691064 0.0417512
+-0.0509946 0.0547172 0.0191515
+-0.0684996 0.106934 0.0379267
+-0.0391114 0.149509 -0.00165293
+0.00150153 0.0534013 0.0535077
+-0.0610153 0.131125 -0.0076807
+-0.015856 0.0980295 -0.0258983
+0.0549279 0.0723085 0.00788581
+0.0296197 0.117006 0.0277632
+0.00535242 0.130989 0.0202309
+-0.000691446 0.0612541 -0.0338404
+0.00150093 0.0441835 0.0459725
+-0.0611099 0.11531 0.0378549
+-0.0695161 0.108303 0.0373324
+-0.0543547 0.158623 0.00837339
+-0.0945603 0.124158 0.0182654
+-0.0535009 0.111177 0.0367213
+-0.0119534 0.0385403 0.00164014
+-0.0370531 0.166795 0.000693639
+0.0161005 0.115637 -0.0146217
+-0.0669681 0.132599 -0.00847972
+-0.0192376 0.0362049 0.0528295
+-0.0510947 0.138549 0.00140254
+0.0199501 0.126815 0.00703133
+-0.0280876 0.0511424 0.0415727
+0.0021184 0.108719 -0.0202691
+-0.0455158 0.0889126 0.0438293
+0.00898082 0.0376394 0.0339008
+-0.0913279 0.147458 0.016148
+-0.00573884 0.0712887 -0.036141
+0.0184912 0.0906471 0.0481735
+-0.0240484 0.159369 -0.0122932
+-0.00386335 0.103093 -0.0232514
+-0.0903131 0.126767 0.00528424
+-0.00141239 0.101018 0.0444401
+-0.0265472 0.0384572 -0.00862977
+-0.0461338 0.160629 -0.00828859
+0.0434078 0.0958974 0.0221477
+-0.0323682 0.0778417 -0.0305703
+-0.0104869 0.166942 -0.0170857
+0.0335642 0.11614 0.00925074
+-0.0679156 0.112303 -0.0110315
+0.0448529 0.0917799 0.0171662
+-0.0902457 0.140661 0.0271695
+0.0361358 0.102075 -0.0100705
+-0.0774559 0.158948 -0.0154272
+-0.0718839 0.142969 -0.00986002
+0.0254315 0.0862638 0.0474376
+0.0233509 0.0549381 -0.0249484
+0.0445042 0.0650854 0.0275412
+0.0472882 0.0731371 0.0168777
+0.0310703 0.0352449 0.00774073
+-0.0540072 0.144242 -0.000990452
+-0.0901845 0.132425 0.0322244
+-0.0305014 0.066031 0.0387492
+-0.0636396 0.163113 -0.0245909
+0.0265757 0.0754454 0.0454823
+0.0560761 0.0692634 0.0230866
+0.0323242 0.117657 0.0116569
+-0.0744896 0.128852 0.0526631
+-0.092535 0.126933 0.0292581
+-0.021881 0.107267 -0.0220871
+0.0216673 0.125834 0.0205048
+-0.0892808 0.140568 0.013241
+-0.0188177 0.0683045 0.0530002
+0.0181426 0.117476 -0.0126083
+-0.0562843 0.049932 0.00898241
+0.0271917 0.0858851 -0.0222975
+-0.0354636 0.172718 -0.000342918
+-0.0113055 0.0991708 0.0485876
+-0.0512476 0.149342 0.0143776
+0.0112062 0.129253 0.000760937
+-0.027273 0.123571 -0.00271305
+-0.0942867 0.122796 0.0162787
+-0.0731111 0.152638 -0.0358925
+-0.0630631 0.0351206 0.0420909
+-0.0638567 0.0981567 -0.0173229
+-0.0886136 0.0969805 0.0223931
+0.0376971 0.0381803 0.0174952
+-0.0389196 0.163835 0.00150184
+0.0470726 0.048551 -0.0036464
+-0.0195067 0.119545 0.0340058
+-0.0154952 0.101637 0.0439764
+-0.0615198 0.167807 -0.0565879
+0.000487515 0.110024 0.0426254
+0.0218587 0.0714183 0.0491823
+-0.0891206 0.0888853 0.014456
+0.00728906 0.0602827 0.0543511
+0.0159015 0.122788 0.0313235
+0.0287151 0.0982016 0.0416756
+-0.0515592 0.162515 0.00512403
+-0.0562626 0.0437454 0.0167126
+-0.0181312 0.0948304 -0.0325641
+-0.0375002 0.0337858 -0.019518
+-0.0283411 0.0368095 0.0535577
+0.0138368 0.126165 0.029064
+-0.0698832 0.115052 -0.00855978
+-0.0166197 0.126668 0.0238945
+-0.062914 0.11807 -0.00990368
+-0.0489018 0.129654 0.0292632
+-0.0524468 0.0489914 0.023647
+-0.0590382 0.132561 -0.00680716
+-0.0429798 0.150656 0.00610371
+-0.0708619 0.0368523 0.00979504
+0.0198172 0.102563 -0.0205962
+0.0416527 0.0846461 0.030449
+-0.0215106 0.119492 0.0328652
+-0.0144877 0.185446 -0.0257702
+0.0475192 0.0568404 0.0316921
+-0.0913388 0.115949 0.00831473
+0.0281313 0.0591962 0.0423168
+-0.035495 0.171374 -0.0137494
+-0.0736292 0.156748 -0.0014693
+-0.00249426 0.0505094 0.0526827
+-0.0909607 0.144377 0.0265412
+-0.0410851 0.123071 0.0255089
+-0.0226414 0.0961417 -0.0259441
+0.0264078 0.120534 -0.000510633
+-0.0193661 0.126578 0.00214409
+0.0465619 0.0568462 0.0320779
+0.0207007 0.040829 0.0419301
+-0.0564899 0.0440403 0.0448345
+0.000863008 0.0381264 -0.0140589
+-0.0418598 0.102811 -0.0210501
+-0.00158954 0.0376715 -0.025054
+-0.0723294 0.177884 -0.0550149
+-0.0544961 0.0732542 0.0409056
+-0.00649673 0.121064 0.0364033
+0.0504194 0.0446982 0.00822878
+-0.0153541 0.0337728 -0.0226273
+-0.0303696 0.0486908 0.0439216
+-0.0334968 0.033775 0.00883944
+-0.0685163 0.108328 0.0375372
+-0.0304988 0.0603029 0.0376116
+-0.0662971 0.0363734 0.0376513
+0.0311541 0.072342 -0.0197804
+0.016819 0.0860765 0.050782
+-0.067492 0.0944588 0.0423306
+-0.0187655 0.0714126 -0.0384549
+-0.0605051 0.128314 0.040613
+0.00838174 0.0449018 -0.0251393
+-0.0164768 0.122235 0.0319313
+0.0227625 0.125142 0.00666699
+-0.0528343 0.0337802 -0.0114802
+0.0451301 0.0903696 0.00218472
+-0.0576106 0.148673 -0.00161022
+0.00250457 0.100333 0.0462614
+-0.0262513 0.0350951 0.0517484
+-0.054684 0.067848 -0.0128124
+-0.0441291 0.159145 -0.00944971
+-0.0440467 0.0380432 -0.0230799
+-0.0447681 0.146394 0.00358641
+-0.0894274 0.0915536 0.0114438
+-0.0751139 0.0954949 0.0389973
+0.0383178 0.106879 0.000185785
+-0.0732998 0.0654414 0.00491231
+-0.00228741 0.13015 0.0232201
+-0.0372213 0.150899 -0.00386632
+-0.0261116 0.0809919 0.0513952
+0.0322341 0.112712 0.0291688
+-0.0690565 0.0338884 -0.00389811
+0.0101437 0.101615 -0.0217271
+0.0425651 0.10009 0.017161
+-0.0355201 0.16973 -0.000114667
+0.00176571 0.0954911 -0.0311224
+0.0373922 0.0461028 -0.00552229
+-0.0261166 0.163762 -0.0159025
+-0.0651006 0.0458549 0.00368955
+0.0212923 0.0982999 -0.0220426
+0.026467 0.0383015 -0.00253304
+-0.0231343 0.0383693 -0.0171708
+0.00758009 0.121578 -0.0129987
+-0.0491724 0.116402 -0.0151155
+-0.0174383 0.038419 -0.00120725
+-0.0368548 0.0985914 -0.0223265
+-0.0599288 0.145383 0.0362513
+0.00646924 0.0964123 0.0516046
+-0.0630484 0.138442 -0.00719818
+-0.0266978 0.0917701 0.0460149
+-0.0534968 0.0790911 0.0438637
+-0.0203653 0.0682964 0.0517114
+0.0203853 0.049027 -0.0227929
+-0.0539349 0.0527611 0.0108042
+0.0460422 0.0848268 0.0101717
+-0.0728228 0.148718 -0.0323717
+0.0337238 0.11401 0.0250189
+-0.0718098 0.0864713 -0.016231
+-0.000525817 0.0352062 0.0124275
+0.0044963 0.0605551 0.0556784
+0.0278498 0.045613 -0.00720046
+0.0242032 0.0987613 -0.0205495
+0.0133536 0.0359529 -0.0210721
+-0.00614443 0.0386147 0.00639011
+-0.091603 0.144731 0.0191577
+-0.00870302 0.0387758 0.0292604
+0.00137957 0.0343513 0.00995357
+0.0580311 0.0716366 0.0149943
+0.029585 0.0495591 -0.0127459
+-0.0873232 0.0873446 0.00247822
+-0.0562907 0.154938 0.0178178
+0.0227189 0.116065 -0.0110894
+-0.089541 0.143417 0.0301691
+-0.0295204 0.0607307 -0.0234192
+-0.072166 0.0982206 0.0402281
+0.0461397 0.0764263 0.0052018
+-0.0650238 0.0405393 0.0286621
+-0.0357662 0.0798799 -0.0213145
+-0.0210545 0.100222 -0.024166
+-0.051798 0.0884029 -0.0218862
+-0.0585235 0.0425717 0.0226979
+-0.0581184 0.132538 0.0370402
+-0.0500652 0.125773 -0.00688378
+-0.0570027 0.145725 -0.00171879
+-0.000114754 0.120081 -0.0133088
+-0.0558569 0.135328 0.0332838
+-0.071744 0.162192 -0.0110365
+-0.0533559 0.0609747 0.0280244
+-0.0678966 0.110866 -0.0116376
+-0.0708871 0.119431 -0.00850422
+-0.0743754 0.0995209 0.0381506
+-0.0827936 0.110133 0.0365
+0.0274001 0.0354299 0.0197116
+-0.0700593 0.152584 0.0349486
+-0.0594807 0.0398598 0.0207095
+-0.0506478 0.0648447 -0.0114426
+-0.0548507 0.0955893 -0.0216695
+-0.0735032 0.144216 0.0449341
+-0.0746874 0.169403 -0.0279937
+-0.041349 0.172669 -0.00697494
+-0.0879813 0.0968653 0.0054141
+-0.0639066 0.158701 -0.0499459
+-0.0295413 0.0348538 0.0461198
+0.0425062 0.0610428 0.0297234
+-0.0761006 0.0693618 0.0222283
+0.0350916 0.102085 0.0333486
+-0.0434936 0.107078 0.040105
+-0.0210995 0.166843 -0.0113898
+-0.0599936 0.0459773 0.0409964
+0.0260763 0.0726986 0.044735
+0.0368852 0.111459 0.00613554
+-0.00301536 0.127034 0.030217
+-0.0313536 0.0384061 -0.00216621
+0.0173795 0.0350198 0.030737
+-0.072846 0.165216 -0.0419869
+-0.0344415 0.176449 -0.00471515
+0.00170995 0.0392427 0.0309786
+-0.04085 0.0985381 -0.021696
+-0.0479764 0.135553 0.00940627
+-0.0332667 0.0835875 -0.0265323
+0.0206498 0.0781917 0.0510092
+0.0122103 0.0893249 -0.030653
+-0.0464803 0.0335784 -0.0137021
+-0.0367962 0.0383714 -0.00507539
+-0.00449141 0.0911839 0.0565229
+0.0243337 0.0605883 -0.0247185
+-0.0826166 0.123078 0.0498508
+0.0540378 0.0525213 0.0252382
+-0.0675101 0.0369158 -0.0062949
+-0.0205096 0.124449 -0.00369667
+0.0285796 0.107031 -0.0133812
+0.0320794 0.0526694 -0.0107538
+-0.0203373 0.0610131 0.0476733
+-0.0674469 0.0396367 -0.00494886
+-0.0599339 0.120955 -0.00911512
+0.0168017 0.105866 -0.0181237
+-0.0787857 0.0744548 -0.00455566
+0.0193044 0.127372 0.00964815
+-0.038368 0.0457007 -0.0229731
+-0.025877 0.125557 0.00449924
+-0.0609237 0.0414243 0.0237035
+-0.0433646 0.153626 0.00736711
+-0.0513808 0.0500433 0.0347314
+-0.0212772 0.0382158 0.00549847
+0.0220013 0.0348195 0.00816409
+-0.0519377 0.0335199 0.00532131
+0.00789859 0.0999878 -0.0218807
+0.0337096 0.115696 0.0178949
+-0.0404258 0.0418709 -0.0242648
+-0.0188763 0.105884 -0.0226282
+-0.0648153 0.175482 -0.051724
+-0.070065 0.148313 -0.0344143
+-0.0584005 0.0439707 0.0246877
+0.0215152 0.0795452 0.0505127
+-0.000765864 0.0811873 -0.0364626
+-0.0633527 0.0454486 0.000289555
+-0.0455004 0.113892 0.0345333
+-0.0205229 0.0336428 -0.0235211
+-0.0658189 0.0895406 -0.0182783
+0.00772286 0.0346363 0.0381279
+0.044441 0.093115 0.00120191
+-0.0859796 0.119771 -0.00178632
+0.00662772 0.0374926 -0.0123303
+-0.0495602 0.0418248 -0.0110192
+-0.0863354 0.129395 -0.000699295
+-0.00570279 0.0613633 -0.0351663
+-0.0195101 0.114089 0.03835
+-0.0679008 0.1038 -0.0147014
+0.045275 0.0917907 0.0041773
+0.0258455 0.110181 -0.0127425
+-0.00858661 0.0376839 -0.0256139
+-0.0494924 0.160775 0.00747898
+-0.0186783 0.101771 -0.0238107
+-0.0870678 0.11107 0.0203515
+-0.0692028 0.135485 0.0474165
+-0.0665472 0.0446244 0.00170489
+-0.0679768 0.0791427 0.0408622
+0.0184726 0.0851741 0.0505075
+-0.0203373 0.158355 -0.00674555
+-0.0364979 0.119358 0.0304421
+-0.0395021 0.0450562 0.0411081
+-0.00309828 0.0379762 0.00940157
+-0.054497 0.10568 0.0405938
+-0.0354869 0.0903478 0.043788
+-0.0882673 0.102346 0.019362
+-0.0518479 0.128319 0.033784
+0.0163666 0.0522247 -0.0268816
+-0.0216233 0.0450569 -0.0280185
+-0.0332919 0.124337 -0.00345787
+-0.0603705 0.118249 -0.0108601
+-0.0883316 0.128385 0.0454834
+-0.0681462 0.033688 -0.00353141
+0.0232453 0.12098 -0.00440593
+-0.0294449 0.038677 -0.0149866
+0.0110249 0.0988999 -0.0227192
+-0.0218748 0.174208 -0.0142339
+0.0205417 0.0741225 0.0508294
+-0.0627477 0.148893 -0.0169766
+-0.0398023 0.0338119 -0.0274661
+-0.0319551 0.0348046 0.0438977
+0.0104998 0.108437 0.040345
+-0.0139772 0.164028 -0.0115888
+-0.0247602 0.0379556 0.0194943
+-0.000934383 0.0340393 -0.0200439
+0.0476809 0.0472678 -0.00164326
+-0.0400291 0.0354632 0.00960076
+-0.0671756 0.0610764 0.00625684
+-0.0852257 0.114326 0.001271
+-0.0754019 0.151364 -0.0118956
+-0.0437605 0.146927 0.00133694
+-0.0619528 0.15527 -0.030594
+0.0363929 0.0490985 -0.00642376
+-0.0100186 0.0981603 -0.0280043
+-0.0119452 0.129197 0.00527137
+-0.0346207 0.0519685 -0.0102527
+0.0527588 0.0510331 0.0250995
+-0.0635082 0.148832 -0.022668
+-0.0147336 0.0671673 -0.0377424
+-0.0704174 0.170744 -0.0307374
+0.0105902 0.125785 0.0307704
+-0.0258145 0.0894344 -0.0348302
+-0.0177853 0.0383982 0.00785589
+-0.0875073 0.0954698 0.00341799
+-0.0424838 0.105689 0.0405023
+0.049326 0.0581361 0.0307698
+-0.0426568 0.0578158 -0.011891
+-0.0506189 0.0517055 -0.00806622
+-0.0751298 0.155996 0.0213056
+-0.0740765 0.0662649 0.0182774
+-0.055953 0.151039 0.0297159
+0.00149895 0.0519342 0.0529111
+-0.0476623 0.135572 0.0124001
+0.00259703 0.093007 -0.0325523
+-0.021995 0.185609 -0.0143485
+0.0421516 0.0805501 0.0292856
+-0.014868 0.104453 -0.022832
+-0.0398868 0.108509 -0.0195593
+0.0259209 0.122835 0.0206655
+-0.0616544 0.15599 0.0144357
+-0.0733101 0.14716 -0.0188577
+-0.0262613 0.119664 -0.0106051
+0.0355444 0.109985 0.0269213
+0.04069 0.0703475 -0.0087868
+-0.0658232 0.100991 -0.0166158
+0.0443888 0.0846966 -0.000809941
+-0.0235014 0.109891 0.0398372
+0.0275195 0.0713136 0.0432798
+0.0364601 0.111481 0.0203251
+-0.0766191 0.168746 -0.0293719
+0.041872 0.069712 0.028792
+-0.0188551 0.177186 -0.0168879
+-0.0430291 0.148351 -0.00306372
+0.0241638 0.0853333 -0.0244737
+0.017675 0.127712 0.00477874
+-0.0888835 0.0983415 0.0204012
+-0.0202474 0.0582316 0.0476806
+-0.0719293 0.126758 -0.00881076
+-0.0294958 0.0960659 0.0449891
+-0.0491744 0.14016 0.00939463
+-0.0284952 0.105677 0.0407009
+0.0215711 0.035903 0.0289947
+0.0112282 0.0780681 -0.031821
+0.0343153 0.115038 0.0152609
+0.0213375 0.0536353 -0.0261911
+-0.0754641 0.149954 -0.0208706
+0.0174704 0.1044 0.0442882
+0.00640724 0.0390095 -0.0238414
+-0.0396234 0.150027 -0.00409811
+-0.0900489 0.137821 0.0141988
+0.0252808 0.0733562 -0.0251315
+-0.0492373 0.132883 0.0267635
+-0.0430533 0.034543 -0.0263375
+0.0217093 0.0520814 0.0434982
+-0.0333828 0.0807789 -0.0265175
+-0.0761052 0.14997 -0.0158781
+-0.0707786 0.0690222 0.0306409
+0.0401031 0.0589615 -0.00453029
+-0.0260252 0.0904818 0.0482145
+-0.0895062 0.0902087 0.0114561
+-0.0526923 0.0334338 -0.00380212
+-0.0114811 0.0646532 0.0550744
+-0.0370678 0.157759 -0.0113588
+0.00952731 0.105746 0.0431674
+-0.0410118 0.126885 0.0180931
+0.0197485 0.105413 -0.017636
+-0.0629292 0.155832 0.0110869
+-0.0581695 0.15592 0.011334
+-0.00650086 0.0561902 0.0537938
+-0.0338729 0.15688 -0.0110666
+0.0405297 0.0779725 0.0322363
+-0.0642469 0.0423257 0.0129047
+0.0237846 0.0476926 0.0394013
+-0.0217726 0.172729 -0.0141007
+-0.0416287 0.0534443 -0.0111279
+-0.077087 0.154176 -0.0108977
+0.0304203 0.0366341 0.0210583
+-0.0306156 0.0552316 -0.0163811
+-0.0584355 0.0482117 0.00674018
+-0.0284904 0.0917855 0.0443788
+-0.0347085 0.0681808 -0.0168555
+0.0286267 0.117101 -0.00417221
+0.000831008 0.0996342 -0.0235195
+0.00330328 0.0611715 -0.0325304
+-0.0739165 0.113504 -0.00683708
+-0.0898235 0.126994 0.0441831
+-0.0889746 0.0942393 0.0114303
+-0.0279086 0.0704216 -0.0334901
+-0.041504 0.0562873 0.0399374
+0.0394095 0.0793879 0.0341721
+-0.0669825 0.112069 0.0420748
+-0.0847653 0.103459 0.000382003
+-0.00649785 0.0801379 0.0576218
+-0.0226054 0.126675 0.00715587
+-0.000755212 0.130746 0.00366553
+-0.0328403 0.0348519 -0.0195836
+0.0396279 0.0857065 -0.0127726
+-0.0805255 0.14991 0.0359696
+0.0353489 0.0955322 0.0372114
+0.0102384 0.0781052 -0.0323493
+-0.0296143 0.0551126 -0.0213868
+-0.0699315 0.126779 -0.00900092
+-0.0795103 0.126002 0.0528073
+-0.000474921 0.0732072 0.0579427
+0.00749418 0.095088 0.0520151
+-0.0841797 0.101927 0.0280813
+0.0424909 0.101472 0.00517268
+0.00951997 0.0673959 0.0546877
+-0.0472854 0.0671503 0.0390298
+0.0376148 0.100847 -0.00874384
+-0.0374929 0.116616 0.0320198
+0.029259 0.120361 0.0176317
+-0.0737149 0.158251 -0.0299203
+-0.0114976 0.116917 0.038689
+0.0413371 0.0444728 -0.00290745
+-0.0627029 0.150609 -0.0235776
+-0.0302691 0.080511 -0.0335682
+0.0300872 0.0497043 -0.0117138
+0.0222773 0.0620859 -0.0257917
+-0.0570144 0.147201 -0.00173114
+-0.0760781 0.173825 -0.0400503
+-0.00149572 0.101631 0.0441885
+-0.0261888 0.17564 -0.0188354
+0.0231825 0.0577956 0.0456852
+-0.0924811 0.125593 0.0372603
+0.00115082 0.131147 0.0187057
+-0.0841614 0.142011 0.042356
+0.042729 0.0901813 -0.0058099
+0.0213045 0.0372836 -0.00268556
+-0.0160362 0.0338015 -0.0209075
+0.0394869 0.10531 0.000602508
+-0.0239168 0.0383626 0.00119722
+-0.0164538 0.0343139 -0.019589
+-0.0592802 0.154415 0.0283608
+-0.0609269 0.155849 0.0219449
+-0.0250081 0.0361291 -0.0192131
+-0.0853634 0.14876 0.00617316
+-0.0253618 0.0386908 -0.0141849
+-0.0881693 0.0922771 0.0238938
+-0.0728038 0.0921924 -0.0153063
+-0.0708783 0.150832 0.0377201
+0.00548074 0.111376 0.0414038
+-0.0524967 0.0945727 0.0438723
+0.0115063 0.0343546 -0.0179688
+0.00151312 0.081484 0.0572224
+-0.0149936 0.0395459 0.0398583
+0.0120392 0.129427 0.0226627
+0.0591195 0.05666 0.00817454
+0.0328155 0.102974 -0.0130264
+-0.0371359 0.123595 0.025439
+0.0450698 0.0805625 0.0231647
+-0.028064 0.0385407 0.0362565
+-0.00648913 0.0732625 0.0583326
+-0.0374981 0.0719295 0.0420686
+-0.0736872 0.176894 -0.0449171
+-0.0672224 0.0339784 0.0107486
+-0.0758756 0.104904 -0.00955908
+0.0439403 0.083251 -0.00181959
+-0.0614723 0.15843 -0.0295877
+0.0442849 0.0945485 0.0181566
+-0.065503 0.044849 0.00843715
+0.00357616 0.0395385 0.0347033
+-0.028754 0.0634689 -0.0284339
+0.0315757 0.0914687 -0.0188156
+0.00716348 0.0343484 0.0202029
+-0.0216788 0.0493937 -0.0287126
+-0.0716516 0.139715 0.0474384
+-0.043721 0.033715 -0.00407894
+-0.0817894 0.0909919 -0.00761357
+0.0425053 0.0513815 0.0326154
+-0.0638693 0.170945 -0.0476012
+0.0316414 0.11271 0.0301021
+-0.0306212 0.159741 -0.0134031
+-0.0214041 0.0879871 0.0549671
+-0.0670934 0.0625692 0.00143601
+-0.0365003 0.087456 0.0430956
+0.00150165 0.0919153 -0.0334107
+-0.024293 0.124271 0.0211991
+-0.0604952 0.0932426 0.0451145
+0.00516194 0.0978455 -0.0256065
+-0.00249882 0.081515 0.0574957
+-0.0636907 0.146369 -0.0159165
+-0.0129939 0.103563 -0.0236849
+0.00282967 0.131401 0.0178813
+0.00250691 0.0883899 0.0564027
+0.0220994 0.0476682 0.0404859
+-0.0466625 0.12523 -0.00836412
+0.00382851 0.0992997 -0.0231609
+-0.0879384 0.126705 0.000268669
+-0.0725213 0.0636798 0.0102197
+-0.00645782 0.0338359 -0.0228235
+-0.0523786 0.138216 -8.53499e-05
+-0.041943 0.114992 -0.0156494
+0.0435142 0.0513638 0.0325031
+0.0432433 0.0958712 0.000187851
+-0.0729725 0.170894 -0.0302341
+-0.0303619 0.0381166 0.0307902
+-0.0942177 0.125518 0.0172578
+0.0446543 0.0959754 0.00716634
+-0.0263933 0.0864552 0.0500994
+0.0352313 0.064664 0.0385641
+-0.0913521 0.14609 0.0171489
+-0.00798473 0.0348553 0.0472244
+-0.00181216 0.086792 -0.0360393
+-0.0153678 0.09644 0.0517723
+0.0268857 0.117842 -0.00498093
+-0.0354986 0.0747267 0.0419454
+-0.0573263 0.0481094 0.0336642
+-0.0386241 0.125328 -0.00654651
+-0.020119 0.0431531 0.0531418
+-0.0226834 0.174208 -0.0136486
+-0.0554979 0.0889982 0.0448936
+-0.0321193 0.0366883 0.0508235
+0.013731 0.104072 -0.0202068
+0.0407967 0.0661529 -0.00677209
+-0.0792933 0.16941 -0.0399858
+-0.0250378 0.174204 -0.0117666
+-0.0718111 0.0631642 0.010775
+-0.0710553 0.181198 -0.0554882
+-0.058796 0.0868581 -0.0207882
+-0.0136362 0.0466649 -0.0295427
+-0.0924917 0.124196 0.0312677
+-0.0331602 0.171158 -0.0153905
+-0.0724259 0.0727975 0.0340482
+-0.0566618 0.0645338 -0.00803085
+-0.0705221 0.098629 0.0408842
+0.0118568 0.126524 -0.00436904
+-0.0784161 0.116342 0.0501163
+-0.0677948 0.160582 -0.0110564
+-0.0456903 0.11799 -0.0148012
+0.0526315 0.0462656 0.0102089
+0.0453672 0.0456539 0.0269438
+-0.00726729 0.129761 0.0228793
+-0.0659232 0.105312 -0.014993
+-0.087769 0.118492 0.00124641
+-0.00149512 0.0562755 0.0546084
+-0.089164 0.0928946 0.0114433
+-0.0841907 0.078353 0.0198111
+-0.0679412 0.0656184 0.0271584
+0.0224551 0.0368363 -0.00219983
+-0.0356854 0.0435567 0.045098
+-0.0457595 0.0797224 -0.0196258
+-0.0405031 0.0762353 0.0429954
+-0.0640239 0.14106 0.0390925
+-0.0797368 0.119028 0.049952
+-0.0864815 0.0846104 0.00248575
+-0.0774908 0.137247 0.0499166
+-0.0586931 0.0693474 -0.0143558
+-0.0340813 0.159269 -0.0127772
+-0.0889533 0.124321 0.0462453
+-0.0611638 0.0468972 0.00167818
+-0.0925249 0.130961 0.0132346
+-0.0707251 0.033867 0.00298473
+0.0514024 0.0510939 0.0266785
+-0.000225629 0.097747 0.0525183
+0.0260546 0.112325 -0.0110571
+-0.0429452 0.0345628 0.0382617
+-0.0174331 0.0625913 0.0517909
+0.0422611 0.0397457 0.00959333
+-0.0374974 0.0705158 0.0419336
+-0.0368535 0.0362973 -0.0142764
+-0.0132005 0.128825 0.00480743
+-0.0808442 0.110042 -0.00155764
+-0.0890966 0.114815 0.0438036
+-0.0195037 0.11681 0.0364149
+-0.0653439 0.127011 0.0477296
+-0.0749324 0.152731 -0.0198994
+-0.0131083 0.128689 0.020774
+-0.0761869 0.149999 -0.0118749
+-0.0657951 0.0852369 -0.0187501
+-0.0515872 0.0558557 0.0146208
+0.0414903 0.0541829 0.0322405
+-0.0094881 0.112787 0.0415502
+-0.0473098 0.0390167 0.04506
+-0.076903 0.112654 -0.00467049
+-0.0792829 0.109073 0.0381388
+0.0277273 0.0646184 0.0435417
+-0.0923959 0.132359 0.0202239
+-0.0505803 0.0502828 -0.00813802
+0.00549299 0.117639 -0.0167508
+-0.0166687 0.038571 -0.00303984
+-0.0728836 0.119408 -0.00813229
+-0.00373228 0.0669631 -0.0346735
+0.0373953 0.0445589 -0.00471693
+0.00577997 0.0365296 -0.0134893
+0.0065091 0.0772612 0.0561769
+-0.0785581 0.153669 0.00407716
+-0.0631137 0.14437 -0.00863045
+0.0335076 0.0453895 0.0300756
+-0.00148382 0.131063 0.00627096
+-0.0117022 0.0613984 -0.0359464
+-0.0390182 0.0473551 -0.0162983
+0.0174871 0.10577 0.0429453
+0.0173606 0.128011 0.00608341
+-0.0587951 0.0337712 0.0197789
+-0.0554323 0.145321 0.0304155
+-0.021174 0.184521 -0.0131308
+-0.0546552 0.0656851 0.0351815
+-0.00872132 0.0656071 -0.0355909
+0.00329381 0.0654903 -0.0335962
+-0.0874212 0.0861211 0.0204627
+0.0341358 0.0641297 -0.0158137
+-0.063479 0.0384929 -0.0076832
+0.0174063 0.0417452 -0.0219906
+-0.069028 0.0409064 0.00923732
+0.0577041 0.0703778 0.00716237
+-0.0506338 0.0663851 -0.0124105
+-0.04882 0.119077 -0.0139102
+-0.0660878 0.161167 -0.014759
+0.060054 0.0678303 0.0101401
+-0.063913 0.169258 -0.0441943
+-0.053845 0.0463107 0.0236764
+-0.0784828 0.175619 -0.0475153
+-0.0313957 0.12387 -0.00298136
+0.0154947 0.107116 0.0420405
+-0.036876 0.0434502 0.0434666
+-0.06715 0.145376 0.0416405
+-0.0155327 0.181625 -0.0208343
+-0.0715781 0.0968766 0.0410625
+0.0306462 0.0968954 0.0409575
+0.00964614 0.0589005 0.0527021
+0.0527245 0.0736707 0.0159788
+-0.0861826 0.104908 0.00538017
+-0.0812551 0.138069 0.0480599
+0.0475108 0.0597433 0.0313293
+-0.0156256 0.0450397 -0.0279587
+-0.0221316 0.125526 0.0205056
+-0.0322922 0.122832 0.0242564
+-0.0132407 0.164048 -0.012311
+-0.0415061 0.0620057 0.0410722
+-0.0657901 0.128396 0.0470862
+0.0282252 0.0760107 -0.0227881
+-0.0701785 0.136914 0.0477863
+0.03413 0.0822192 0.0406334
+0.0609039 0.0609671 0.0121585
+-0.0515277 0.136697 0.0258426
+-0.00994091 0.089177 -0.0367642
+0.0451266 0.0727442 0.0219703
+0.0336533 0.110026 0.0294894
+-0.0721725 0.156265 0.0135984
+0.0312336 0.051167 -0.0107736
+-0.0023355 0.0926921 -0.0342848
+-0.0524965 0.0790864 0.0437156
+-0.0095237 0.0431051 0.0494016
+0.000300907 0.0626948 -0.0340909
+-0.0905968 0.140629 0.0221693
+-0.00800869 0.0388567 -0.00527149
+-0.0584939 0.0847167 0.0439692
+-0.0635243 0.0334646 -0.00419693
+-0.090351 0.14066 0.0261698
+-0.0588327 0.0911696 -0.0205864
+-0.020414 0.0541289 0.0465389
+-0.056688 0.067746 -0.0120827
+-0.0344045 0.152028 -0.00248634
+-0.0154988 0.114109 0.0392017
+-0.0384878 0.168246 0.00236894
+-0.0115711 0.100192 -0.0241483
+-0.0167308 0.0657547 -0.0377116
+-0.0466962 0.147986 -0.00319779
+-0.0926613 0.122825 0.0414622
+0.0312237 0.0871647 -0.0198177
+-0.0257476 0.0682496 -0.0344079
+-0.0524537 0.0504524 0.0306643
+-0.0768211 0.0804727 0.0355147
+-0.00449363 0.0456798 0.0470573
+0.0418422 0.0690449 -0.00578965
+-0.0262667 0.110544 -0.0190457
+-0.00251293 0.105882 0.0441369
+-0.0707082 0.0395895 0.000643319
+0.0128917 0.127573 0.0272919
+-0.0354687 0.054727 0.0384538
+0.00920102 0.0837298 -0.0322138
+0.0094791 0.0347704 0.0365664
+-0.0435038 0.0438236 0.0424673
+-0.0551839 0.140262 -0.00246039
+0.00523902 0.0341335 -0.0189244
+0.0273731 0.0578707 -0.0207586
+0.0119495 0.129938 0.00409466
+-0.0494983 0.102885 0.0411106
+-0.0370447 0.0379826 0.045213
+0.0150108 0.0349639 0.0393317
+0.0345233 0.0498189 0.0314944
+-0.0153828 0.128676 0.0170423
+-0.0618725 0.160013 -0.0255862
+-0.0525544 0.0504168 0.0256484
+-0.073344 0.0672327 0.000494062
+0.0393875 0.0460438 -0.00485579
+-0.0152754 0.103231 -0.0233341
+-0.0753549 0.104884 0.0361423
+0.0108274 0.0362708 -0.0225637
+0.0342152 0.0862629 0.0407864
+-0.088758 0.143311 0.0121502
+-0.0572353 0.0465198 -0.0043437
+0.0198267 0.035157 0.00555798
+0.0261922 0.0507168 -0.0207207
+0.0268986 0.0357578 0.0211357
+-0.0349846 0.0837189 -0.0236297
+-0.0222119 0.158173 -0.00418672
+0.024391 0.115338 0.0336864
+-0.0200061 0.124102 0.0256765
+-0.069632 0.0719472 -0.0104624
+-0.0322859 0.0792627 -0.0305329
+-0.0506516 0.033429 -0.00887801
+-0.0358626 0.101452 -0.0219425
+0.0293657 0.0447288 -0.00609588
+-0.0662305 0.0339335 0.0109932
+-0.00786973 0.104508 -0.0230207
+-0.0712429 0.177886 -0.0560058
+-0.00159432 0.129182 0.0263815
+-0.0283933 0.0831937 -0.0356194
+0.0443268 0.0511334 0.0322609
+-0.0318469 0.0958266 -0.0236233
+0.0205346 0.0937418 -0.0232686
+-0.012793 0.0813325 -0.0389447
+-0.0235889 0.0983837 -0.0242804
+-0.062496 0.105649 0.040196
+-0.0194646 0.0347564 0.0483645
+-0.0124518 0.038713 0.0303489
+-0.0444408 0.0335855 -0.0133031
+-0.00148369 0.0732377 0.0582942
+-0.0837769 0.153466 0.0110188
+-0.0898767 0.135147 0.0252168
+0.0369605 0.105409 -0.00483089
+-0.0255274 0.113962 0.0353265
+-0.0539587 0.0338764 0.0242313
+-0.0789197 0.104773 0.0326412
+0.0105421 0.118176 -0.0153416
+-0.0256953 0.0385914 0.0331228
+-0.0336328 0.126783 0.00457249
+-0.0470116 0.0710509 0.0409961
+-0.0930389 0.129675 0.0242521
+-0.0464764 0.0861628 0.0446798
+-0.0561893 0.159558 0.00559608
+-0.0091854 0.130144 0.00917512
+-0.0798951 0.0840617 -0.00859358
+-0.0336645 0.0339705 0.0230467
+0.00935764 0.0539048 -0.0300706
+-0.0831098 0.0777207 0.0215128
+-0.0470469 0.155045 0.00906939
+-0.0135887 0.169514 -0.0234669
+0.0418337 0.0395215 0.00781447
+-0.0276517 0.15535 -0.00385533
+-0.0201931 0.18164 -0.0152257
+-0.0335046 0.177862 -0.00863199
+0.0345014 0.0513521 0.0321623
+-0.0804527 0.143139 -0.00181198
+-0.0816965 0.144555 0.000152955
+0.0607459 0.0623413 0.0091502
+-0.0779458 0.175786 -0.0452228
+-0.0577187 0.146758 0.0323537
+-0.0403111 0.127303 0.0168527
+0.0204871 0.0934146 0.0476927
+0.00588424 0.100173 -0.0220733
+-0.00768539 0.0584014 -0.0338334
+-0.0447099 0.069553 -0.0165571
+-0.0287391 0.0620637 -0.0274208
+0.0157473 0.0947545 -0.0243195
+-0.063441 0.156071 0.0225051
+0.00824182 0.0753956 -0.0338579
+0.00561249 0.0927088 -0.0322048
+-0.0475077 0.0732702 0.0416223
+0.0145005 0.11127 0.0394252
+0.00450182 0.0413372 0.0458645
+0.00631667 0.061015 -0.0309472
+-0.0794763 0.0926775 0.0349659
+-0.0718543 0.111061 0.0453722
+-0.0891984 0.129697 0.0434765
+0.0151955 0.129241 0.0138359
+0.0236821 0.0824052 -0.0254011
+-0.0015019 0.110031 0.0427805
+-0.0215043 0.109928 0.0403615
+-0.0939826 0.118759 0.0192971
+-0.0624131 0.11535 0.0394932
+-0.0833865 0.140392 0.00124854
+-0.0465624 0.124393 -0.00950278
+-0.0146513 0.0496822 -0.0311895
+-0.0641648 0.15616 0.0149932
+-0.0729217 0.126742 -0.00866826
+-0.0253625 0.126177 0.010523
+0.0277777 0.108556 -0.0130095
+-0.0788017 0.0846357 0.0359502
+-0.0247742 0.180145 -0.00956802
+0.0188129 0.101666 -0.0216414
+0.00516264 0.131576 0.00874185
+-0.0633822 0.164679 -0.0305938
+-0.0375944 0.116238 -0.0149818
+0.0194959 0.111012 -0.0156283
+-0.0342918 0.0780403 -0.0245107
+-0.0861846 0.083225 0.00647736
+-0.0161451 0.166792 -0.0199866
+-0.0872007 0.147399 0.00826035
+0.0567195 0.0508531 0.00818949
+-0.0594966 0.100149 0.0427407
+-0.0584967 0.0761953 0.0427061
+-0.0218317 0.124906 0.0220793
+-0.00826101 0.0384472 0.0115633
+-0.0383343 0.121902 -0.0109317
+-0.0521665 0.136903 -0.000627156
+-0.0215605 0.0383186 -0.00194746
+0.0481264 0.060275 -0.00442661
+0.0154998 0.108504 0.0406925
+-0.0729927 0.08468 0.0400334
+0.0156625 0.0631375 0.0506866
+-0.0244911 0.101622 0.043846
+-0.0464946 0.131544 0.00524728
+-0.0496757 0.0678792 -0.0135965
+0.0429479 0.0845778 -0.00579145
+-0.0889655 0.0969901 0.0204055
+-0.0641121 0.152654 -0.0038572
+0.0409571 0.0971716 0.0271682
+-0.0171621 0.0382418 0.0171791
+0.00646008 0.118492 -0.0156628
+0.0328247 0.054955 0.0367483
+-0.0843958 0.13208 -0.00165487
+-0.0521768 0.0517998 0.0286453
+0.0415397 0.0690275 -0.00677
+-0.00193982 0.12966 0.0247961
+-0.0686037 0.157344 -0.00409918
+-0.0332546 0.12417 0.0223928
+-0.0762473 0.0920177 -0.013581
+0.0392491 0.0672477 0.0338308
+-0.0841314 0.0776758 0.00449933
+-0.0638136 0.0680952 0.0346563
+-0.00579523 0.10109 0.0444886
+-0.0717812 0.166615 -0.0459981
+-0.0474379 0.0355948 -0.0152688
+0.0581028 0.0523658 0.0121806
+-0.0787218 0.0967552 0.0354897
+-0.0561139 0.139571 -0.00370722
+-0.0605064 0.0394509 -0.00845033
+-0.0890965 0.111935 0.0113594
+-0.0579064 0.158452 0.00407429
+0.0204977 0.0920241 0.0479175
+-0.0224928 0.0988548 0.044702
+-0.0289733 0.124361 0.000543811
+-0.00750575 0.0457415 0.0474579
+0.043354 0.053395 -0.00666154
+0.0230359 0.124766 0.00534006
+-0.0773785 0.174262 -0.0420678
+-0.0273153 0.0387018 0.0344821
+-2.85469e-05 0.0391507 -0.00580542
+-0.0653748 0.149517 -0.0319115
+-0.0386792 0.0336259 0.00249375
+-0.0655034 0.106997 0.0388261
+0.0203192 0.0679349 -0.0283363
+0.0395784 0.104495 -0.000545476
+-0.0239953 0.114912 -0.0156465
+-0.0660228 0.160133 -0.0132914
+0.0397718 0.0940445 0.031303
+-0.0719497 0.132579 -0.00806719
+-0.0634812 0.0760895 0.041143
+-0.0484925 0.14723 -0.00252533
+0.054748 0.0690996 0.0027667
+-0.0723713 0.156038 0.0237254
+0.034267 0.0613198 -0.014809
+-0.0483876 0.0348751 0.0437589
+-0.05979 0.0839541 -0.0202843
+0.0501248 0.0723145 0.00745971
+0.0347025 0.105449 -0.00966587
+-0.0352566 0.0382472 -0.0299775
+0.0470963 0.045623 0.0254581
+-0.0855435 0.108961 0.00733555
+-0.0206804 0.112216 -0.0188434
+0.00523056 0.0796312 -0.0340387
+-0.0465619 0.047561 -0.00986957
+-0.033587 0.0348608 0.0452447
+-0.0202523 0.125914 0.000840735
+-0.0501104 0.138566 0.0193811
+-0.0264363 0.125919 0.0130719
+-0.0691022 0.159548 -0.0519447
+-0.0245412 0.057448 -0.0303989
+-0.046121 0.0336712 -0.000864342
+-0.0742841 0.155582 0.00848891
+-0.0298186 0.154044 -0.00457012
+0.0302323 0.0969553 -0.0166472
+0.0266877 0.104744 0.0387392
+-0.0843417 0.109004 0.0243603
+-0.0496377 0.143234 0.0104059
+0.0174929 0.0962345 0.0475335
+0.0450677 0.0917906 0.015163
+0.0374841 0.076757 0.0366434
+-0.0215406 0.0711033 0.0513847
+-0.0282153 0.125116 0.00364014
+-0.0284773 0.177212 -0.00607735
+-0.0204956 0.109916 0.0405701
+-0.0784664 0.0703272 0.00666705
+-0.0031698 0.0384355 0.0180459
+-0.0655548 0.153788 -0.00146085
+-0.0229763 0.0945367 -0.0302901
+-0.0192339 0.166857 -0.012207
+-0.0866345 0.094046 0.00237751
+-0.0759405 0.177963 -0.0471435
+0.0442559 0.0973532 0.00916034
+-0.071904 0.103673 -0.0126696
+-0.00666902 0.0541115 -0.0328784
+0.0144947 0.105783 0.0434399
+-0.029312 0.0383797 -0.00726542
+0.0562076 0.0536042 0.00319408
+-0.0829319 0.114342 0.0473556
+-0.069928 0.113662 -0.00916203
+-0.080837 0.120705 -0.00484118
+-0.0680148 0.177312 -0.0499759
+-0.077886 0.0811556 -0.0096326
+0.0350121 0.104701 0.0314746
+-0.0571796 0.0582032 0.0181974
+-0.0932449 0.120197 0.0372886
+-0.0536204 0.0647024 -0.00963527
+0.00250481 0.0870342 0.0569864
+-0.0802055 0.0754813 0.024867
+-0.062996 0.0444935 0.0306768
+-0.00402267 0.0975528 0.0526596
+-0.0883984 0.103684 0.0133796
+-0.0637361 0.133925 0.0394224
+-0.00469624 0.0613427 -0.0349676
+-0.0570417 0.148685 -0.00168484
+-0.062221 0.119852 0.0434664
+-0.0361997 0.0483313 -0.0162949
+0.00950265 0.0517655 0.0513753
+0.00822226 0.0366869 -0.011267
+-0.0383571 0.0360437 0.0112202
+-0.0890914 0.0956431 0.0204208
+-0.0256081 0.0408536 -0.0292407
+0.0374062 0.0397236 -0.000139169
+-0.094388 0.124185 0.0232804
+-0.0615536 0.151288 -0.000477545
+-0.0674057 0.140585 -0.00814985
+-0.0913588 0.113353 0.0143394
+-0.0162447 0.115598 -0.0164334
+-0.00395415 0.0388026 0.0284096
+0.0272466 0.0774691 -0.0233342
+0.0337889 0.112917 0.0264745
+-0.0342171 0.0808501 -0.0245506
+0.0395831 0.0953666 0.0310696
+0.0424402 0.100042 0.00119598
+0.0588348 0.0704992 0.0161593
+0.0129551 0.034265 -0.00247291
+-0.0884357 0.140552 0.0112052
+-0.0545209 0.0388646 -0.0108239
+-0.00760223 0.0406064 -0.0259713
+-0.0671149 0.0634665 0.0239226
+-0.0571873 0.13241 -0.00599886
+-0.0652367 0.0347413 0.0281307
+-0.0733817 0.154066 -0.0309045
+-0.00253313 0.0428829 0.047136
+-0.0768102 0.145866 -0.00487051
+-0.0675702 0.166262 -0.0225175
+-0.0425031 0.0662262 0.0410651
+-0.0579829 0.147131 -0.0018633
+0.0230336 0.049071 0.0400904
+-0.0829949 0.0843947 0.0302754
+-0.0147977 0.0813547 -0.0393324
+-0.015272 0.0385359 0.0263224
+-0.0764401 0.163184 -0.0180705
+-0.00855639 0.121127 -0.0123669
+-0.018702 0.0459339 0.0516744
+-0.0274925 0.0577126 -0.0264141
+-0.0571934 0.155255 0.0174937
+-0.0620081 0.0469936 0.00367346
+-0.010275 0.170544 -0.0261793
+0.0537831 0.0477401 0.0192041
+0.0402375 0.104169 0.000177419
+0.0289937 0.118368 -0.00105099
+-0.039498 0.118035 0.0314
+0.0367284 0.0875226 0.0373878
+0.0431893 0.0764104 0.0272109
+0.0404723 0.0752779 0.0321515
+-0.071418 0.176406 -0.0454588
+-0.0570823 0.138706 -0.0047975
+-0.0666306 0.0689692 -0.00898899
+-0.0691773 0.0628504 0.020491
+0.0144923 0.104443 0.0448169
+-0.0227823 0.0798633 -0.0386035
+0.0278587 0.0463325 0.0365003
+-0.00850193 0.0391005 0.0344133
+-0.0677578 0.16996 -0.0326164
+-0.0367265 0.0725274 -0.0180009
+-0.0681226 0.115765 0.0506532
+-0.0824105 0.154634 0.0158747
+-0.0197211 0.109971 -0.0204733
+-0.0626214 0.149057 -0.0155813
+-0.0414792 0.111213 0.0366505
+0.0570161 0.0508675 0.0161892
+-0.0934473 0.129632 0.0182372
+-0.0463999 0.150559 -0.00488163
+-0.0823822 0.144566 0.00117046
+-0.0310391 0.0892178 -0.0256627
+-0.065854 0.172894 -0.0463248
+-0.069909 0.0416997 0.00317022
+0.0312116 0.11742 0.0240751
+-0.0118175 0.0387383 -0.00407256
+0.01303 0.126665 0.0287751
+-0.0440446 0.129866 0.0080667
+-0.0797747 0.106127 0.0313842
+0.00451933 0.0800063 0.0560543
+0.00739517 0.116252 -0.017256
+0.0277812 0.063284 0.0436054
+-0.0569949 0.126695 -0.00683103
+-0.00960244 0.0420101 -0.025949
+0.0084074 0.123136 -0.0106652
+-0.0428042 0.0338676 0.0265755
+-0.0325056 0.0760815 0.0412743
+-0.0386562 0.0591953 -0.0114762
+-0.0405007 0.0690879 0.0417151
+0.0419622 0.102841 0.00417469
+-0.047644 0.121343 -0.0122933
+-0.0729009 0.105047 -0.011511
+-0.0927931 0.126937 0.0282668
+-0.0656106 0.156261 -0.00734027
+-0.0802248 0.0719997 0.00554401
+-0.00476651 0.0755803 -0.0368945
+-0.0779912 0.139819 -0.00526751
+-0.0864372 0.14049 0.00618869
+-0.0427881 0.157985 0.00470835
+-0.0697618 0.112838 0.0482345
+-0.0800017 0.0786467 -0.00556567
+-0.00794001 0.0994214 0.049751
+0.00252738 0.0716721 0.0561852
+0.0244581 0.0366925 -0.000851561
+-0.0618581 0.153131 0.03333
+-0.0730605 0.177343 -0.046073
+-0.0670133 0.0791411 0.0413099
+-0.00657967 0.0361819 -0.0249969
+0.0332241 0.115988 0.0034015
+-0.0314758 0.118803 -0.0116777
+-0.0714107 0.144356 -0.0151846
+-0.0414986 0.120686 0.028403
+0.0126257 0.034994 0.0315996
+-0.0344792 0.0382691 -0.00267158
+-0.0696814 0.0354769 0.0114289
+-0.0454423 0.0336713 -0.00255197
+-0.0611633 0.0698433 0.0372322
+-0.0520495 0.147795 0.0183962
+0.0467993 0.0745196 0.0137565
+-0.00850445 0.0619527 0.0559735
+-0.0157643 0.0353272 -0.0263783
+-0.0915821 0.144732 0.0201581
+-0.0274038 0.123285 0.0215594
+-0.0667152 0.0419014 -0.00231002
+-0.0408646 0.104225 -0.0205494
+-0.092402 0.129661 0.0272343
+-0.0876501 0.0954829 0.0054069
+-0.063731 0.0751942 -0.0171769
+-0.016949 0.0909918 -0.0366612
+0.0216857 0.0374896 0.0372608
+-0.0733019 0.081934 0.0390113
+-0.033579 0.117839 -0.0126505
+0.00291054 0.0385481 0.0460492
+-0.0648688 0.0938916 -0.0183701
+-0.0931568 0.120191 0.0362904
+-0.0105693 0.129741 0.0187791
+-0.0330922 0.108613 -0.0189923
+-0.0867528 0.121192 -0.00171893
+-0.0398856 0.0351398 0.0419144
+-0.0500753 0.0599861 0.0335137
+-0.0362769 0.163827 -0.00170672
+-0.0161498 0.040504 0.0518582
+0.0390213 0.100628 0.0284944
+-0.0525203 0.0581461 0.0261597
+-0.06389 0.0397139 0.0154457
+-0.0114781 0.0589986 0.0537512
+-0.00335674 0.0424141 0.0475525
+-0.0200738 0.0389483 0.0357554
+0.0112326 0.0738116 -0.0315294
+0.0128141 0.0504969 0.0481838
+-0.0548971 0.104115 -0.019193
+-0.0887169 0.125354 0.00227396
+-0.0712974 0.0669397 0.02531
+-0.0542529 0.0545999 -0.00539104
+-0.0538048 0.159768 -0.00183632
+0.0171004 0.120495 -0.00987579
+0.00927611 0.0667424 -0.0314011
+-0.0928802 0.118867 0.0402859
+-0.0167191 0.0613704 -0.0359554
+-0.0515886 0.0460739 0.0176829
+-0.0182635 0.180096 -0.0244849
+-0.0014996 0.0938866 0.0553603
+-0.0518826 0.071407 0.0396894
+-0.0529375 0.0335557 0.00508499
+-0.0597956 0.0925385 -0.0196216
+-0.0869937 0.104951 0.00838372
+0.0481666 0.0731681 0.01124
+-0.00827202 0.0394277 0.049182
+-0.0607911 0.0810335 -0.0194373
+0.000667625 0.0985049 0.0513232
+0.00310867 0.129093 0.0266332
+0.0296013 0.119582 0.02204
+-0.0285282 0.0378067 0.0260568
+-0.0367133 0.0353138 0.0122122
+-0.0468392 0.132859 0.0202702
+-0.0139293 0.126622 0.0263262
+-0.0191687 0.171226 -0.0215143
+0.0205957 0.0394417 0.0417168
+-0.0692562 0.143958 0.0438704
+-0.037992 0.128312 0.00883318
+-0.0237829 0.0770195 -0.0382449
+-0.0940603 0.120098 0.0152926
+-0.0545976 0.139948 -0.00193829
+-0.0869674 0.103645 0.0213508
+-0.0689616 0.177928 -0.0580053
+-0.079103 0.0731629 0.0235749
+-0.0563149 0.0534289 -0.00138708
+-0.00430179 0.125159 -0.00873129
+-0.0217957 0.119089 -0.0120655
+0.047344 0.0721054 0.0183678
+-0.0206715 0.0524183 -0.0304469
+-0.0292161 0.178518 -0.014988
+-0.0567221 0.0575063 0.0096837
+0.00796175 0.131494 0.0140347
+-0.0163209 0.175704 -0.0185048
+0.0207575 0.0645289 0.0475184
+-0.0365005 0.0676756 0.0415398
+-0.0504985 0.079101 0.0439987
+0.0338763 0.0978118 -0.0135516
+-0.00887371 0.0385959 0.0022117
+-0.0644851 0.0755505 0.0404189
+-0.0877008 0.0923103 0.0248018
+-0.082219 0.074838 0.0095308
+-0.0554964 0.111163 0.0367062
+0.0260064 0.0465031 -0.0156607
+-0.0633419 0.155193 -0.0376165
+-0.0732519 0.0648877 0.00719031
+-0.0769992 0.155545 -0.0179052
+0.0377103 0.0955073 -0.00984226
+0.0174667 0.122816 0.0304302
+-0.0366198 0.0505806 -0.010756
+-0.0144968 0.0472352 0.0484474
+0.00848126 0.0936832 0.0524446
+0.0197906 0.106497 -0.0168156
+-0.0930778 0.121531 0.0352811
+-0.0613674 0.169388 -0.0565896
+-0.0301276 0.038694 -0.0132786
+-0.0662928 0.044787 0.00771957
+-0.0195138 0.0448322 0.0525308
+-0.0886025 0.0887878 0.00646717
+0.0380432 0.109702 0.0166041
+-0.024753 0.0755695 -0.0376923
+-0.089639 0.0983559 0.0164014
+0.0373474 0.083464 0.036489
+0.0200866 0.0429332 -0.0206714
+-0.0362408 0.12776 0.00652715
+-0.0114267 0.182822 -0.0276369
+0.033977 0.115595 0.0137221
+0.016644 0.0381609 -0.019755
+-0.0160134 0.0959893 0.0521651
+-0.0194344 0.115555 -0.0163687
+0.00996296 0.0988804 -0.0226985
+0.0207021 0.0348049 0.000449352
+-0.0655859 0.0333717 0.000880867
+-0.0387964 0.0870429 -0.0222174
+-0.0365713 0.0483594 -0.015218
+0.0310154 0.110075 0.0327245
+-0.0376939 0.0665912 -0.0149459
+0.0401046 0.0466866 0.0313873
+-0.0110827 0.102149 -0.0241692
+0.00841559 0.0375405 -0.0234702
+0.0448731 0.0945767 0.0111579
+0.0145335 0.034759 0.0322003
+-0.059392 0.149673 0.0353015
+0.000291607 0.0641338 -0.034343
+0.00429568 0.0640516 -0.0331969
+0.0450422 0.0931924 0.0131619
+-0.00448954 0.122402 0.0358368
+-0.0326251 0.166779 -0.00520273
+-0.0566266 0.157159 0.00899778
+-0.0131915 0.184654 -0.0268832
+0.0372616 0.0915229 0.0364203
+0.0164447 0.0548852 0.0482217
+-0.0124867 0.11689 0.0385307
+0.00769138 0.039029 0.0323953
+-0.0150057 0.127967 0.0215456
+-0.0860589 0.113009 0.00328149
+-0.0718647 0.175275 -0.0427173
+0.000497507 0.112823 0.0420607
+-0.0832204 0.140695 0.0442806
+-0.0316065 0.039499 -0.0303181
+-0.0689448 0.129685 -0.00899835
+-0.020775 0.0742803 -0.0390259
+-0.0727533 0.0995199 0.0393322
+0.0032483 0.071196 -0.0343078
+-0.0400491 0.154783 -0.00892819
+-0.0345081 0.0832025 0.0425625
+-0.0522702 0.141391 0.00017327
+0.0278273 0.0795375 0.0455649
+0.0269552 0.122658 0.0110745
+0.0348501 0.112087 -0.000408122
+-0.0694924 0.0846972 0.0421957
+-0.0861949 0.139089 0.00320204
+-0.0823568 0.0802033 -0.00152209
+0.00894636 0.0644445 0.055029
+0.0266313 0.0563972 -0.0207832
+0.023933 0.0390696 0.0352942
+-0.0656041 0.136814 0.0420793
+0.0407616 0.105622 0.0111617
+0.058143 0.0551653 0.0211996
+-0.0138904 0.0897489 -0.0373664
+0.0117209 0.130528 0.015412
+-0.0181782 0.126773 0.00187925
+0.039239 0.0589589 -0.00512401
+0.0118091 0.0576645 0.0520801
+0.0101538 0.113447 -0.018237
+0.00107085 0.0391982 -0.0112505
+-0.0726176 0.0747594 -0.0108396
+-0.0504976 0.104261 0.040368
+-0.06047 0.0776106 0.0424994
+-0.0726162 0.166612 -0.0440006
+-0.0345099 0.109779 0.0372255
+0.0371511 0.110987 0.0177157
+-0.0594963 0.1084 0.0386802
+-0.0218558 0.120004 -0.0110164
+-0.0726436 0.159626 -0.0369279
+0.0162217 0.120841 -0.0102336
+0.0462172 0.0729792 0.0194263
+0.0503974 0.0595708 0.0303584
+-0.069034 0.139725 0.045939
+0.0222487 0.0359069 0.0273161
+-0.083623 0.0857135 0.0294569
+-0.0427492 0.0421438 -0.0223063
+-0.0635342 0.161573 -0.0210278
+-0.0632778 0.158345 -0.0436013
+0.049468 0.0445737 0.00523787
+-0.00949755 0.0856659 0.0574293
+0.0137231 0.129888 0.00901711
+-0.0849311 0.0980032 -0.00158096
+0.0094116 0.0360543 -0.0227822
+0.029005 0.115546 0.0303821
+-0.0136476 0.0481469 -0.0303471
+0.0203578 0.0985304 -0.0223097
+0.0386883 0.0767039 0.0348633
+0.0505119 0.0665023 0.0275359
+-0.0236064 0.038163 0.0249493
+-0.0662075 0.060375 0.00901189
+-0.0309847 0.0381919 0.0323901
+-0.0577888 0.0439091 -0.00660137
+0.0319539 0.0795563 0.0427459
+-0.0888256 0.100978 0.0104077
+-0.0149675 0.0986909 -0.0245721
+0.0080932 0.126458 -0.00628099
+-0.0629819 0.128219 -0.0083429
+0.00592947 0.0982847 -0.0240623
+-0.0791963 0.120405 0.0507691
+0.0385114 0.0583288 0.0314228
+0.0327231 0.116168 0.00178038
+-0.0838537 0.110728 0.0339922
+-0.0559583 0.0478125 -0.00439058
+-0.0864154 0.152983 0.0204471
+-0.0846489 0.0778245 0.0165124
+-0.0244888 0.120706 0.0294035
+-0.0565129 0.051223 0.00779351
+-0.00649552 0.111418 0.0421995
+-0.0400289 0.0336199 0.00584373
+0.00964377 0.120482 -0.0138306
+-0.0819198 0.126566 -0.00507678
+-0.023502 0.180157 -0.0112302
+-0.033578 0.0448331 0.0458046
+-0.0771053 0.177652 -0.0476237
+-0.0244946 0.0357757 0.0532784
+0.044574 0.0903504 0.0211613
+0.0317623 0.0938577 -0.0173357
+-0.0767292 0.0860417 0.0380634
+-0.0291365 0.165225 -0.016186
+-0.0558064 0.0562012 0.00862658
+-0.0197239 0.0612902 -0.0351879
+-0.0624763 0.163084 -0.0515885
+-0.00157869 0.0347285 -0.0237137
+0.0250862 0.0741055 0.0468243
+-0.00657564 0.0346831 -0.0243352
+-0.0927326 0.12419 0.0292678
+-0.0642565 0.0418897 0.0384072
+0.0074848 0.0976824 0.0494394
+-0.0324803 0.0436623 0.0489836
+0.0309993 0.0686673 0.04128
+-0.00959045 0.0337105 -0.0233226
+-0.0692347 0.176505 -0.0570351
+-0.0524975 0.111152 0.036921
+0.0434926 0.056984 0.0319757
+-0.0448698 0.104232 -0.0209188
+-0.0689139 0.148999 -0.0367601
+-0.0366298 0.0344715 0.0361774
+-0.0772403 0.0846603 0.0372078
+-0.0866727 0.139248 0.0421058
+-0.0692038 0.156713 -0.0519425
+-0.0286406 0.154979 -0.0065778
+-0.0516452 0.119776 0.0340339
+-0.0604002 0.0591276 0.0185111
+-0.0789005 0.172846 -0.0440952
+-0.0733588 0.0659821 0.00263497
+-0.0644533 0.0351399 0.0400818
+0.0349985 0.0619413 0.0382049
+-0.0116935 0.0584778 -0.0346471
+0.0397873 0.104095 -0.000789682
+0.0261507 0.0923065 -0.0217116
+-0.0643301 0.156694 -0.0446094
+0.0312874 0.108108 -0.0105276
+-0.0718754 0.119424 -0.00835095
+-0.0897483 0.0929448 0.0154361
+-0.0322408 0.125589 0.00213325
+0.0193474 0.0551603 -0.0276297
+-0.0355381 0.0335618 -0.0245193
+-0.0323633 0.175433 -0.0143069
+0.0591153 0.0705615 0.014025
+-0.0685156 0.168032 -0.0539935
+-0.0408127 0.127672 -0.0010356
+-0.070932 0.129672 -0.00889239
+-0.0315034 0.0717826 0.0402663
+0.0139874 0.0924572 -0.0278842
+-0.00310937 0.0390986 -0.00637767
+-0.0315484 0.0749387 -0.030532
+-0.0658202 0.0597996 0.0132017
+-0.074125 0.079542 -0.012586
+-0.042758 0.0336059 0.00168497
+-0.0376274 0.0534153 -0.0106276
+-0.0609006 0.106856 -0.0171292
+-0.0465015 0.112315 -0.0168133
+-0.00832405 0.129364 0.00227931
+0.000993844 0.0989182 -0.0247915
+-0.092775 0.128304 0.0272531
+-0.0024916 0.073257 0.0585379
+-0.0354714 0.0959602 0.0437897
+-0.0798628 0.122191 -0.00554615
+-0.0379836 0.153062 -0.00765575
+-0.0574689 0.0413481 0.0461934
+-0.0681352 0.166058 -0.0212868
+-0.0655788 0.037063 0.0157921
+-0.0104996 0.03868 -0.00189881
+0.00192546 0.0390395 0.0275923
+-0.0598545 0.0467827 -0.000327155
+-0.0510269 0.136724 0.0245519
+-0.0626706 0.0343644 0.032487
+0.0368248 0.11128 0.0190303
+0.047871 0.0733255 0.0156276
+-0.0291332 0.059286 -0.0234112
+-0.0554108 0.0344947 0.0391385
+-0.0892997 0.0956389 0.0174174
+-0.0880049 0.11182 0.00834875
+0.0309816 0.102484 -0.0145328
+0.0183118 0.0665429 -0.0287115
+0.00448658 0.111391 0.0416751
+-0.0902127 0.122664 0.0052855
+-0.0900898 0.119956 0.00430245
+-0.026505 0.174198 -0.0103819
+-0.0214492 0.0963545 -0.0261739
+0.0574071 0.0691343 0.00477569
+-0.0755392 0.154957 0.000803149
+-0.0205078 0.049871 0.046386
+-0.0302748 0.116055 -0.0148216
+0.0522643 0.0732287 0.00987093
+-0.0353184 0.153664 -0.00782609
+-0.0468563 0.101377 -0.0215448
+0.0252483 0.0713214 0.0452679
+-0.01624 0.0963836 -0.0301721
+-0.0374901 0.0505918 0.0391881
+-0.000727236 0.069749 -0.034387
+-0.0295801 0.0368886 0.052851
+0.0174262 0.0350846 0.00327627
+-0.0408044 0.0884947 -0.0224789
+-0.0540496 0.0546601 0.0106814
+-0.0841802 0.136658 0.046769
+0.0265654 0.0388814 0.0291555
+-0.0365515 0.115187 -0.0158874
+-0.0746646 0.0981736 0.0384691
+-0.0461647 0.162128 -0.00806097
+-0.0838755 0.106118 0.000396239
+-0.0634664 0.0345901 0.0373297
+-0.0487026 0.0708482 -0.0151225
+-0.0490488 0.150196 -0.0040443
+-0.0454995 0.107082 0.0401134
+0.015502 0.109895 0.0399577
+0.0339767 0.0796167 -0.0178174
+-0.064903 0.110966 -0.0133006
+-0.0884279 0.0874564 0.00647862
+0.0303366 0.0352283 0.0150252
+-0.0476647 0.15359 0.00991943
+0.0491492 0.0460297 0.00132033
+0.0571336 0.0721807 0.0116675
+0.0423629 0.0398964 0.0150374
+-0.0075036 0.12108 0.0363047
+-0.0304017 0.0791045 -0.033577
+-0.0707511 0.0654954 0.0231537
+-0.0344941 0.171246 -0.000779029
+-0.0516393 0.0618882 -0.0103104
+0.0364959 0.064355 -0.0127735
+0.0258636 0.0344283 0.00929921
+-0.06094 0.0410414 0.0167056
+0.0388283 0.102661 -0.00481845
+0.00951185 0.0560842 0.0527429
+0.0250009 0.0629104 -0.0235842
+-0.0883814 0.100948 0.00841627
+-0.0896675 0.150196 0.0231327
+-0.0502775 0.0487457 0.0176637
+-0.0574379 0.0576833 0.0026039
+-0.0889127 0.145822 0.0300758
+0.00105802 0.0387062 0.0241019
+0.0432951 0.0987146 0.0161577
+-0.00981592 0.123797 -0.00918874
+-0.0235467 0.119499 0.0316537
+-0.0203743 0.127028 0.00506457
+-0.0546314 0.138445 -0.00241154
+0.0144977 0.11819 0.0360011
+-0.0468871 0.150669 0.00925072
+0.00310943 0.110155 -0.0202398
+-0.0315082 0.0817114 0.0416031
+-0.0361907 0.169669 -0.0137878
+-0.0266475 0.0904555 0.0474235
+0.00393808 0.131671 0.0154244
+-0.0594984 0.109765 0.0377884
+-0.0632488 0.167828 -0.0435907
+0.02054 0.116646 0.0351499
+0.046015 0.0862238 0.00817489
+-0.0472066 0.033531 -0.00644781
+-0.0382901 0.126893 -0.00216373
+0.0358746 0.0755562 -0.0137901
+-0.00915886 0.0385694 0.027547
+-0.083022 0.132397 -0.0026267
+-0.0665414 0.155108 -0.00331096
+-0.0344162 0.168264 -0.00253059
+-0.0891077 0.101031 0.0163881
+-0.0165765 0.119912 -0.0109781
+0.00442197 0.11861 -0.0157775
+-0.0234514 0.0892984 0.0527307
+0.0565327 0.0523952 0.0217798
+-0.0515006 0.111173 0.0369493
+-0.0218128 0.183092 -0.0122978
+0.0044132 0.0376001 -0.0242202
+-0.0654801 0.0675388 0.0330326
+-0.010497 0.0717087 0.0563199
+-0.065424 0.0399796 0.0326661
+-0.0228869 0.180156 -0.0121058
+0.0203379 0.125091 8.19329e-05
+-0.0802772 0.089954 0.0344521
+-0.0772906 0.165906 -0.0257637
+-0.012412 0.0382658 0.0163183
+0.0102284 0.0616887 0.0533551
+-0.00987882 0.105925 -0.0227673
+-0.00348977 0.122389 0.0359468
+-0.0759061 0.0675035 0.00967604
+-0.0414986 0.0874028 0.042497
+-0.0605969 0.06056 0.0225173
+0.0395569 0.0702481 -0.0107925
+-0.0329324 0.0638892 -0.016427
+-0.000943594 0.0381622 0.0205587
+-0.0338755 0.107095 -0.0200162
+-0.0125023 0.0486789 0.0487656
+0.0274856 0.0400248 0.0301572
+-0.0008153 0.10869 -0.0211159
+0.0343096 0.0419726 0.0279684
+-0.0247603 0.0865587 0.0527086
+-0.00553736 0.113796 -0.0185731
+-0.021633 0.035044 -0.0280533
+0.00828872 0.130472 0.0213052
+-0.0242184 0.0593353 0.0417104
+0.0288386 0.111536 -0.010211
+-0.0581339 0.0334069 -0.00670381
+0.037704 0.0574555 -0.00668675
+-0.0710158 0.13691 0.0483444
+-0.0305078 0.112529 0.0355647
+0.0343502 0.114842 0.0181324
+-0.0485971 0.0359097 0.00925535
+-0.0288479 0.0578621 -0.0233922
+-0.051497 0.0890197 0.045238
+0.0121456 0.0347039 0.0353715
+-0.0716902 0.155937 0.00211062
+-0.0790692 0.0804499 0.033529
+0.0545445 0.0589886 -0.00181806
+0.0529955 0.0716182 0.0219676
+-0.056511 0.121265 0.0393235
+0.032607 0.0527076 -0.00976892
+-0.0376644 0.0335909 0.0081569
+-0.0936994 0.128298 0.0232525
+-0.0809806 0.0720629 0.0115411
+-0.0239408 0.0886576 -0.0363455
+-0.0859344 0.107632 0.00736881
+-0.0277915 0.0782183 -0.0359607
+-0.0571511 0.0394305 0.0468685
+-0.0839381 0.0791399 0.0214982
+-0.0234217 0.0359155 0.0533704
+-0.0739011 0.106421 -0.010241
+-0.0567145 0.0334976 0.000765085
+-0.0241329 0.157302 -0.00905689
+-0.0128819 0.126866 -0.00238505
+-0.0250553 0.0707727 0.0450037
+-0.0444963 0.119293 0.0294103
+-0.0463222 0.0411097 -0.0132713
+-0.0451547 0.0437693 -0.0122411
+0.0475648 0.0553802 0.031711
+-0.0494965 0.11266 -0.0171746
+0.00314926 0.122256 -0.0116623
+-0.089161 0.137877 0.0251937
+-0.0171561 0.0387671 0.0311342
+-0.0659181 0.10388 -0.0158661
+-0.062107 0.163118 -0.0365927
+0.0444569 0.0444867 0.0259758
+-0.0206484 0.0464719 -0.0278809
+-0.0668387 0.144945 -0.0185544
+-0.0574928 0.102919 0.0421703
+-0.0655518 0.166572 -0.0275081
+-0.0339393 0.126307 0.017694
+-0.0176989 0.0554882 -0.03328
+0.012239 0.0794574 -0.0314827
+-0.0344963 0.094609 0.0443801
+0.0228685 0.123786 0.00100726
+-0.0920259 0.132307 0.0132318
+-0.0713267 0.169665 -0.0267525
+-0.081588 0.0788215 -0.00249997
+-0.0755712 0.102178 0.0364401
+-0.0482055 0.0335674 -0.00667883
+-0.0295069 0.109802 0.0378356
+-0.0819634 0.103331 0.0300688
+-0.0766364 0.0788383 -0.00918256
+-0.0472353 0.12392 0.0280317
+-0.0424858 0.064826 0.0410217
+-0.00749383 0.112788 0.0415528
+-0.0321607 0.174124 -0.015122
+-0.0148084 0.124344 -0.00565133
+-0.0630295 0.126909 0.044075
+-0.0122771 0.129643 0.0167063
+-0.0137469 0.0714346 -0.0382786
+0.0253964 0.0981715 0.0439168
+-0.0105339 0.100499 0.0452584
+-0.0909546 0.139232 0.0191849
+-0.0239226 0.16684 -0.0101968
+-0.00433796 0.0387886 -0.000752538
+0.00920046 0.0879669 -0.0320124
+-0.0404937 0.0662835 0.0416604
+-0.0569887 0.118401 0.0385929
+-0.0715396 0.0362187 -0.000138838
+0.0226226 0.0591926 0.0466634
+-0.0544937 0.112536 0.0358256
+-0.0843481 0.145997 0.00513587
+-0.022811 0.0756351 -0.0385829
+-0.0666897 0.0735998 -0.0145924
+-0.0404977 0.116683 0.0325662
+0.0032744 0.114489 -0.0193505
+0.00148054 0.0413996 0.0463959
+-0.0245078 0.0767611 0.0513331
+-0.0308625 0.101511 -0.0227041
+0.00533966 0.0345787 0.0412861
+-0.0774755 0.170095 -0.0341987
+-0.0650593 0.125632 0.048098
+0.0112751 0.0505364 0.0494832
+-0.0786212 0.0976351 -0.0095679
+-0.0726748 0.0647223 0.00565049
+-0.0350102 0.158094 0.00367693
+0.0175012 0.11539 0.036772
+-0.0205761 0.0350586 0.0512942
+-0.0408828 0.108487 -0.0195205
+-0.0324978 0.0661054 0.0396515
+-0.0860138 0.0845642 0.00148082
+0.00924462 0.0710839 -0.0326657
+-0.0573888 0.0342428 0.0302238
+-0.0809405 0.141759 -0.00181375
+0.0351408 0.0931106 -0.0145377
+0.0391769 0.106978 0.0201683
+-0.0378047 0.0342916 0.0307956
+-0.0614885 0.0932285 0.0449784
+-0.00750736 0.0561433 0.0534652
+0.0317881 0.0564278 0.038783
+-0.0258626 0.0378286 0.0139698
+-0.0515546 0.0445278 -0.00899667
+-0.010869 0.165486 -0.0158779
+-0.0297303 0.109983 -0.0184292
+-0.0469177 0.0346518 0.0071269
+-0.0286016 0.109083 -0.0194963
+-0.0109096 0.172768 -0.0212178
+0.00821291 0.0711477 -0.0331375
+0.00315167 0.10307 -0.0219554
+-0.0472567 0.132959 0.0215876
+-0.0825276 0.142074 0.0435561
+-0.0136058 0.093388 -0.035076
+-0.0179202 0.0385865 -0.0163394
+-0.0641268 0.0405801 0.0396199
+0.0124469 0.129111 0.00141235
+-0.0637038 0.0343279 0.0323025
+0.0354218 0.100763 0.0338403
+0.0121385 0.130422 0.0141392
+0.00281822 0.126541 -0.00629609
+0.000901863 0.122026 -0.0113896
+-0.0702669 0.176516 -0.0559875
+-0.0576072 0.0336162 0.0112663
+0.0129045 0.125515 -0.00527553
+-0.021518 0.115416 0.036565
+-0.01542 0.16691 -0.0137031
+-0.0365035 0.168234 0.000585726
+0.00464616 0.034105 0.00716872
+-0.0319348 0.125225 0.000800634
+-0.0169495 0.0390889 0.0362738
+-0.024481 0.104364 0.0426891
+0.0161036 0.0393372 0.0440174
+-0.0397156 0.127552 0.0155957
+-0.0063009 0.09425 -0.0339062
+-0.00549064 0.104476 0.0440202
+-0.0455034 0.104326 0.041412
+-0.0625466 0.16468 -0.0375945
+-0.0334032 0.0765382 -0.0275106
+-0.0118225 0.0855318 -0.0386599
+0.0100166 0.0833203 0.0549696
+-0.0685481 0.156429 0.0206858
+-0.0705717 0.158164 -0.0459142
+-0.0185161 0.125172 -0.00248935
+-0.0185539 0.095955 -0.0297446
+0.0191428 0.127427 0.0167214
+-0.0145095 0.171282 -0.0176637
+0.0352621 0.0826509 -0.01774
+-0.0526579 0.0504274 0.026653
+0.00237351 0.0465882 -0.0283321
+-0.0854761 0.132564 0.04817
+-0.0868299 0.0846427 0.00348465
+-0.0105903 0.0377043 -0.0258398
+0.00953188 0.0455622 0.0461832
+-0.0662037 0.154495 -0.0505507
+-0.0856221 0.107687 0.0203552
+-0.0858054 0.102155 0.00239755
+-0.0248162 0.126254 0.00926143
+-0.0398081 0.128271 0.00374611
+-0.00949649 0.0546877 0.0525704
+-0.0474662 0.0960033 0.0439936
+-0.0787761 0.1431 -0.00379727
+0.0264606 0.0663192 -0.0226274
+-0.0294891 0.119549 -0.0104626
+-0.0285179 0.0948797 -0.0246293
+-0.0561001 0.14389 0.0312058
+-0.0930288 0.116051 0.018311
+-0.00894653 0.174179 -0.0257648
+-0.0524908 0.113899 0.0349209
+0.0158504 0.0959717 -0.0236278
+-0.0694879 0.0368888 0.0112092
+-0.0802884 0.146109 0.0411929
+-0.0498232 0.0349806 0.0446412
+0.0342731 0.115225 0.0123899
+0.0283978 0.0955434 -0.019149
+-0.0515486 0.141607 0.0193759
+-0.0458573 0.147704 0.00717141
+-0.0735436 0.175947 -0.0433626
+-0.0758292 0.0935231 -0.0136873
+-0.0554898 0.041398 0.0465154
+0.0604856 0.0623173 0.00815473
+0.0135991 0.100782 -0.0226731
+-0.021666 0.16235 -0.015178
+-0.0474866 0.0573572 0.0366835
+-0.0645248 0.154173 -0.00692339
+0.0454055 0.0747572 0.0215389
+-0.0497578 0.0797288 -0.020162
+-0.0463447 0.129406 0.0234768
+0.0153317 0.0580768 -0.0287753
+0.0124861 0.100431 0.0478938
+-0.0288456 0.0986889 -0.0235542
+-0.00949656 0.0471698 0.047803
+-0.0644726 0.165628 -0.0285568
+0.0564615 0.0703554 0.0055259
+-0.0477419 0.0345444 0.0337565
+-0.0415114 0.0520187 0.0393909
+-0.0165872 0.128419 0.0166112
+-0.0649318 0.168832 -0.0387572
+-0.0230309 0.0906523 0.0522978
+-0.0289316 0.0889882 -0.0316153
+-0.0522528 0.0567257 0.0259279
+-0.0113061 0.169739 -0.0249506
+0.0329977 0.0514306 -0.00763543
+-0.0104801 0.120983 0.0360777
+-0.0848294 0.111312 0.0422165
+0.0597675 0.0609389 0.00613027
+-0.0264774 0.0473675 0.0499125
+-0.00223749 0.0939165 -0.0335391
+-0.0188762 0.171241 -0.0152046
+0.0460317 0.0820288 0.0151733
+-0.00015619 0.0389464 0.0272511
+-0.0490964 0.156122 -0.00621407
+0.0240569 0.111353 0.0367066
+-0.0427705 0.0826571 -0.0207663
+-0.0844768 0.0856095 0.0274708
+-0.0120306 0.174239 -0.0210892
+-0.00550834 0.0689154 0.0563731
+0.0289606 0.0679277 -0.0207366
+-0.0308933 0.12367 0.0217821
+-0.00650569 0.0675101 0.0559953
+-0.0789661 0.0859916 0.0360799
+-0.0291346 0.177171 -0.00534178
+-0.0560039 0.140764 -0.00299974
+-0.0584999 0.107052 0.0397144
+0.00834583 0.0539265 -0.0302958
+-0.0169173 0.16018 -0.0117745
+-0.0698587 0.0680767 -0.00467294
+0.00525002 0.0740223 -0.0345195
+0.0110199 0.0860342 0.0546992
+0.0173361 0.0608154 -0.0277985
+0.0111302 0.107269 -0.019511
+-0.021494 0.10578 0.0424616
+0.0436775 0.0859385 0.0262014
+-0.0587477 0.0767588 -0.0188591
+0.0107799 0.0548821 0.052327
+0.0185294 0.0358466 0.0392699
+-0.0859998 0.135257 0.0457789
+-0.0767885 0.154209 -0.0148974
+-0.0613392 0.0587193 0.00967832
+-0.0712669 0.0381904 0.00872646
+0.00351715 0.0561463 0.0534882
+-0.0427983 0.0884442 -0.0218161
+-0.0898373 0.133802 0.0342135
+-0.0414226 0.150668 0.00483874
+0.0173651 0.049165 -0.0241471
+-0.0213294 0.0783028 0.0551779
+0.0143433 0.0537792 -0.0282321
+-0.0784743 0.140032 0.0478552
+-0.0334891 0.0889549 0.0439078
+0.0190476 0.0795376 0.0522219
+0.0286264 0.0638437 -0.020406
+-0.054069 0.139552 0.0288194
+-0.0132381 0.0385471 0.0267309
+0.0118566 0.0887261 0.0541581
+0.0316481 0.100683 -0.014625
+-0.093138 0.120057 0.0112982
+0.0244505 0.0384021 -0.00302114
+0.0122037 0.0864617 -0.0308592
+-0.0121165 0.0973987 0.0513433
+0.0371269 0.09285 0.0362758
+0.00753839 0.119505 -0.0147629
+-0.0698326 0.0937229 -0.0162704
+-0.046496 0.105677 0.0407002
+-0.00449814 0.0870358 0.0571267
+-0.00560579 0.042007 -0.0256504
+-0.0748416 0.154048 -0.0189002
+0.0138852 0.0348367 0.0283807
+-0.0890009 0.118943 0.0464523
+-0.0703858 0.16802 -0.0500308
+-0.0208115 0.124915 -0.0021319
+-0.0399669 0.0343914 -0.00210399
+-0.0188044 0.120762 -0.00982397
+-0.0825182 0.0816676 0.0298907
+-0.0625957 0.0588736 0.0128867
+-0.0908844 0.150204 0.0171288
+-0.073715 0.17176 -0.0333959
+0.0304194 0.0446109 0.0313507
+-0.0364972 0.0605644 0.0405385
+-0.0684905 0.158118 -0.0539401
+0.011386 0.0343226 -0.0122219
+-0.0375464 0.119352 -0.0122401
+-0.036497 0.102841 0.0405772
+0.0373988 0.0430101 -0.00376662
+-0.00864037 0.0526884 -0.0330777
+-0.0505191 0.112725 -0.0172384
+0.000747713 0.131321 0.00709666
+-0.0821064 0.110205 0.0294137
+-0.0338319 0.0498039 0.0388148
+-0.0399647 0.128635 0.00811119
+0.0262642 0.0479348 -0.017662
+-0.093142 0.118716 0.0123041
+-0.0234219 0.0537493 0.0424994
+0.0109672 0.0977693 -0.023517
+-1.32571e-05 0.13145 0.0125463
+0.0200527 0.0618555 0.0482337
+-0.0119089 0.128954 0.021205
+-0.0524994 0.0903873 0.0447034
+-0.0334979 0.0845774 0.0421828
+0.0190672 0.117213 -0.0123322
+-0.0263135 0.0381467 0.0262093
+0.034589 0.108233 -0.00663102
+0.0435886 0.091694 0.0241609
+-0.00849618 0.0939016 0.0554996
+-0.0579701 0.125253 -0.00738272
+-0.016138 0.0382862 0.0119165
+-0.0709351 0.0742605 0.0366097
+-0.0125367 0.128434 0.00198737
+-0.0244307 0.0379986 0.0104913
+-0.0681277 0.152206 0.0356633
+-0.0279464 0.0689892 -0.032513
+0.0398535 0.0752995 0.0330037
+-0.0636875 0.0722354 -0.0149801
+0.00569987 0.0949071 -0.0304911
+0.0217235 0.120687 0.0315848
+0.0306109 0.0549842 0.038821
+-0.0719231 0.155792 0.0253493
+-0.0350091 0.168257 -0.00164334
+-0.0919787 0.13239 0.0232249
+-0.0781961 0.0730005 -0.00359699
+0.0587114 0.0663183 0.00513779
+-0.0669656 0.147091 -0.0266318
+-0.0880403 0.150094 0.0102212
+-0.0137235 0.0657235 -0.0372342
+-0.0884987 0.102354 0.0183681
+-0.0219433 0.0386564 0.0320445
+-0.0629896 0.0341974 0.0167609
+0.0436977 0.0404602 0.0147575
+-0.0413787 0.124797 0.0224172
+-0.0255118 0.0931431 0.0461963
+-0.0122206 0.175683 -0.0283056
+-0.0580888 0.115436 0.0369297
+-0.0783607 0.150068 -0.00187639
+0.0561422 0.049398 0.0141897
+-0.0334907 0.0932064 0.044455
+-0.0784392 0.144133 0.0443751
+0.0134754 0.0990564 0.0479483
+-0.0673994 0.0396352 0.0118227
+-0.0719379 0.131113 -0.00828186
+-0.0675058 0.060447 0.0122781
+-0.0276134 0.0408758 -0.0294796
+0.0326756 0.117173 0.0132168
+-0.0741715 0.151271 -0.0318825
+0.0191559 0.0577995 0.0486799
+-0.0624968 0.102902 0.0415908
+-0.0467288 0.054632 0.0374442
+0.0400692 0.0773178 -0.00879643
+-0.0293794 0.119962 0.0282913
+0.026315 0.0849274 0.0469361
+0.00747158 0.0458651 0.0478111
+-0.0644149 0.0731789 0.038947
+0.0243686 0.118145 -0.00732959
+0.0357612 0.0614637 -0.0127934
+-0.00578852 0.0784633 -0.0377499
+-0.0177178 0.125534 0.0250034
+-0.0264348 0.0891318 0.0486594
+0.000504451 0.0842848 0.0575158
+0.00240772 0.0390703 -0.0246208
+-0.0401081 0.172699 -0.00896014
+-0.0494967 0.101524 0.042218
+-0.0255895 0.0365546 -0.0292581
+0.0458597 0.0428246 0.0032848
+-0.0627733 0.141026 0.037362
+-0.0278525 0.100136 -0.023576
+0.03144 0.0681325 -0.0188162
+0.0112459 0.129755 0.00240428
+-0.0872718 0.144583 0.0355002
+-0.0552077 0.119827 0.0376818
+-0.0324974 0.0859857 0.0423469
+-0.0872251 0.0950749 0.0256867
+-0.0468678 0.104213 -0.0207743
+-0.0445775 0.0462028 -0.0108205
+-0.0612826 0.0343712 0.0345145
+-0.0144859 0.0951551 0.0535558
+-0.0770239 0.141306 -0.00545257
+-0.0572927 0.0447946 0.0143752
+0.0334156 0.0430777 -0.00456693
+-0.073856 0.154091 -0.0259028
+0.0392277 0.108354 0.00916622
+-0.0254312 0.0379511 0.0211651
+-0.0579761 0.145744 -0.00191597
+0.016043 0.107446 -0.0178315
+0.0243862 0.0955601 0.0459654
+-0.0527854 0.146248 0.0203946
+-0.0908456 0.137855 0.0191944
+-0.0688648 0.111591 0.0438135
+0.00950305 0.108494 0.0403312
+-0.0846701 0.133487 -0.000689201
+-0.0146178 0.161254 -0.0115208
+-0.0517406 0.0704199 0.0388209
+-0.00483682 0.0910121 -0.035647
+-0.0455024 0.0438631 0.0430524
+-0.0269915 0.165366 -0.00760144
+-0.000429299 0.131494 0.0138246
+-0.0108252 0.0340132 -0.0200775
+-0.053792 0.141582 0.0273817
+-0.0807416 0.0720213 0.00853917
+-0.0886543 0.102345 0.0123871
+0.00450201 0.0745047 0.0565768
+-0.0651106 0.120024 0.049809
+-0.0816493 0.14593 0.000178819
+-0.0317919 0.0396266 0.0512352
+-0.0868829 0.105004 0.0193534
+-0.0587854 0.0839965 -0.0207846
+-0.0568787 0.10406 -0.0186489
+0.0234195 0.0349614 0.0211471
+-0.0247363 0.0683356 -0.0352871
+-0.0124919 0.105832 0.0432095
+0.040945 0.0957511 0.0281635
+-0.0357042 0.0681118 -0.016092
+0.0393973 0.0899152 -0.0117774
+-0.00550412 0.0547964 0.0538028
+0.0275305 0.105074 -0.0152759
+0.0436438 0.0973161 0.0031761
+-0.0642775 0.0356785 0.0173446
+-0.0578787 0.118384 0.0390612
+-0.0235304 0.111308 0.039012
+-0.0248685 0.10443 -0.0231858
+0.0332298 0.0870923 -0.0186827
+-0.050788 0.13247 -0.00197537
+0.0485095 0.0723104 0.0188157
+0.0122831 0.123395 -0.0089862
+0.0075079 0.0786108 0.055765
+0.00110358 0.114412 -0.0192684
+-0.0434472 0.0344528 0.0312293
+0.0149724 0.0740286 0.0533099
+-0.0773286 0.0696655 0.0199272
+-0.000294503 0.124716 -0.00828566
+0.0391665 0.0916193 -0.0109453
+-0.0671371 0.169442 -0.0570354
+-0.0101504 0.0993437 0.0489973
+-0.0383111 0.172675 -0.0109203
+-0.048519 0.137086 0.0153953
+0.0537553 0.0686728 0.0251859
+-0.0642372 0.158555 -0.0140759
+-0.0177679 0.0959988 0.0511065
+-0.071022 0.0408196 0.00705143
+-0.0272272 0.0562777 -0.0264072
+-0.0594982 0.10293 0.0419773
+-0.0516777 0.0668198 0.0365892
+-0.00645905 0.128953 0.0260767
+0.0161504 0.121694 -0.0091598
+0.0437177 0.0457281 0.0283091
+-0.092911 0.118706 0.0113064
+0.0110654 0.0346569 0.0243461
+-0.0131306 0.0351789 0.049391
+0.0159998 0.123366 -0.00698095
+-0.0668407 0.0952437 -0.0171577
+-0.071815 0.0936645 -0.0155813
+-0.0350082 0.162373 -0.00163299
+-0.00952557 0.169814 -0.0256004
+-0.0483792 0.0345623 0.0353569
+0.042732 0.0733313 -0.00479409
+-0.0838195 0.113254 0.0462465
+-0.0700699 0.0415411 0.00206928
+-0.0834164 0.110194 0.0380909
+0.0395682 0.0582726 0.0307001
+-0.0527297 0.0738092 -0.0169322
+-0.0800112 0.0826849 -0.00756298
+0.0378591 0.102628 -0.00683982
+-0.010049 0.165099 -0.0207588
+-0.0214981 0.0486638 0.0490621
+-0.0429934 0.0337652 -0.0113325
+-0.000805756 0.0881637 -0.035184
+-0.0796191 0.0899783 0.0351979
+-0.0774871 0.138654 0.0489668
+-0.0910383 0.131037 0.0312282
+-0.0353528 0.121762 0.0276148
+-0.0692517 0.16944 -0.0530112
+-0.0314965 0.0760483 0.040909
+0.0238425 0.124265 0.00565298
+0.00628938 0.0341841 -0.018778
+-0.0581165 0.0576994 0.00562055
+0.0291881 0.120758 0.0119009
+-0.0722612 0.0718535 0.0331389
+0.00962203 0.129808 0.0232185
+-0.0350797 0.159271 -0.0126349
+-0.0536324 0.0335534 0.00133593
+-0.0104359 0.0944019 -0.0340934
+-0.00347107 0.112728 -0.01944
+0.0492065 0.0445737 0.00425603
+-0.014689 0.0555534 -0.0339367
+-0.0729302 0.110914 0.0452396
+0.0128104 0.0891816 -0.030491
+0.0173644 0.052219 -0.0267492
+-0.0755038 0.138646 0.0489499
+-0.0664863 0.0657678 0.0290911
+0.014321 0.0608889 -0.0289153
+-0.0109854 0.0891937 -0.0368255
+-0.0714642 0.155388 -0.0429121
+-0.0674015 0.178779 -0.0526749
+-0.0136021 0.0406665 -0.0268707
+-0.0656159 0.148667 -0.029991
+-0.0795217 0.0705829 0.00954625
+-0.0757838 0.06757 0.0150388
+-0.0619636 0.125289 -0.00856668
+-0.0639176 0.153606 -0.0366205
+-0.0839617 0.114292 0.0471508
+-0.0125655 0.164041 -0.0130929
+-0.0519903 0.161388 0.00628165
+0.0020129 0.0391581 -0.00540617
+-0.0585951 0.0582039 0.0052961
+0.034843 0.0862437 0.0399362
+-0.0416697 0.0377451 -0.0272469
+0.0488349 0.0718069 0.020409
+0.0223863 0.0449715 0.0408911
+-0.0822334 0.107404 -0.00162196
+-0.0602698 0.154572 0.0280125
+0.0297856 0.120093 0.00926746
+-0.0669649 0.131148 -0.00876196
+-0.0800697 0.154441 0.0255089
+-0.0849288 0.12649 -0.00334252
+-0.000500036 0.0952296 0.0545194
+0.0151613 0.0863718 -0.029541
+0.0388132 0.0794166 0.0350891
+-0.0171133 0.0390763 0.0521827
+-0.0784063 0.0886978 0.0368492
+-0.0643001 0.179479 -0.0601392
+-0.0766538 0.11399 -0.00481419
+-0.016912 0.0931258 -0.0348233
+0.0379841 0.0406211 -0.00115448
+-0.0331507 0.0821697 -0.0275285
+0.0162383 0.0953367 0.0482094
+-0.0326141 0.0638332 -0.0174509
+-0.0725041 0.146981 0.0423864
+-0.0910261 0.12541 0.00626868
+-0.0833424 0.104748 -0.00163012
+0.0153058 0.128412 0.00248962
+0.0403512 0.038719 0.00830945
+-0.0325027 0.0603855 0.0384943
+-0.0195554 0.0387278 -0.0149268
+-0.0839725 0.0897798 0.0296574
+-0.00149888 0.0634085 0.0566876
+0.0387554 0.108357 0.00416438
+-0.0444079 0.0409084 -0.0203048
+-0.0868827 0.0896245 0.0255163
+0.0430409 0.10011 0.0131585
+0.0194835 0.105739 0.0423148
+0.032957 0.115724 0.0233075
+-0.0114871 0.063283 0.055206
+-0.0528865 0.15117 0.0191272
+0.0045048 0.104341 0.0428855
+0.00104791 0.0346359 -0.0164332
+-0.0674529 0.180926 -0.0583799
+-0.0344427 0.15352 -0.00733684
+0.0397392 0.0658643 0.0327972
+-0.0465986 0.120315 -0.0132329
+0.015269 0.034844 0.035887
+-0.0554963 0.0791301 0.0442202
+-0.0342911 0.0473692 0.0421968
+-0.0842876 0.108899 0.00336188
+-0.0262668 0.179961 -0.0169689
+-0.0836964 0.0763445 0.00752427
+-0.0696635 0.159559 -0.0499324
+-0.0661058 0.151041 -0.0375744
+-0.0455019 0.122005 0.0261109
+-0.0890685 0.0969888 0.0194042
+-0.0946116 0.124177 0.0212718
+0.00351301 0.0828608 0.0571024
+-0.0555168 0.154658 0.0152234
+0.00450223 0.0730917 0.0563795
+-0.0125112 0.037888 -0.0164908
+-0.0595378 0.0337212 0.0161226
+-0.0645332 0.120008 0.0489179
+-0.0396568 0.0577566 -0.0113194
+-0.052454 0.13854 0.0254099
+-0.0106577 0.165418 -0.0198106
+-0.0477868 0.0855382 -0.0218048
+-0.07021 0.168534 -0.0249229
+0.0345025 0.0454126 0.0301845
+-0.0261438 0.168232 -0.0181898
+-0.0685956 0.0422314 0.00876662
+0.00130397 0.128647 -0.00252095
+-0.0558871 0.108356 -0.0181276
+-0.0163928 0.0384645 -0.00103951
+-0.0364756 0.0917702 0.0440382
+0.0409317 0.0971197 -0.00479362
+-0.015772 0.160715 -0.00958045
+-0.0428613 0.102811 -0.0212634
+-0.0285136 0.112565 0.0358423
+0.0484971 0.0678077 0.0264809
+-0.0319101 0.121969 -0.00695975
+-0.0200308 0.127492 0.00809368
+-0.0860481 0.114371 0.00228673
+-0.0597203 0.0638916 0.0303834
+0.00627327 0.0682324 -0.0325665
+0.0114155 0.128646 -0.000626619
+-0.0516778 0.140064 0.0213757
+-0.0218071 0.110009 -0.0205036
+-0.0218161 0.0798852 -0.0388524
+-0.02847 0.045966 0.0500228
+0.0429765 0.0987175 0.0181666
+-0.0795395 0.117686 0.0497856
+0.0342026 0.113899 0.000840527
+0.0067112 0.0353739 0.0246266
+0.0402464 0.0618954 -0.00472398
+-0.049455 0.118007 0.0316443
+-0.0442176 0.170815 -0.00391429
+0.00731658 0.0846292 0.0563131
+-0.0542668 0.0504201 -0.00539584
+-0.00648076 0.0969085 -0.030657
+0.0597202 0.067814 0.0181758
+-0.0267919 0.0380272 0.00817341
+-0.0702433 0.163232 -0.0134117
+0.0368364 0.0754262 0.037436
+-0.077497 0.168713 -0.0313178
+0.00996165 0.130854 0.00764162
+0.0133618 0.0523173 -0.0278769
+-0.0337147 0.120592 -0.00951232
+-0.0398766 0.113891 -0.0165093
+-0.089592 0.111931 0.0163329
+-0.0841359 0.0832101 0.027497
+-0.0848856 0.0792043 0.0194951
+-0.0291817 0.0832547 -0.0346104
+0.013224 0.0341678 -0.000459678
+-0.00759782 0.103673 0.0436498
+-0.0514921 0.0804912 0.0440592
+-0.0929632 0.124088 0.0102675
+-0.0586925 0.0677294 -0.0118268
+0.0392263 0.0874331 0.033936
+-0.052704 0.143169 0.0214165
+-0.0286941 0.0380883 0.0293671
+0.0183138 0.0348993 0.0256062
+-0.0644855 0.101502 0.0419335
+-0.0547363 0.159762 -0.000811248
+0.0123244 0.0567269 -0.0296218
+0.0294314 0.0509988 -0.0157519
+0.0386176 0.0874608 0.0348475
+-0.0759101 0.148612 -0.0128604
+0.0152406 0.0723235 -0.0303843
+-0.0475913 0.133999 0.00741747
+-0.0109726 0.115573 -0.0164387
+-0.040716 0.0681271 -0.0158645
+-0.000345107 0.127203 0.0297544
+-0.0856388 0.100529 0.0267624
+0.0372748 0.0576283 0.0326444
+0.0454709 0.0664599 0.0266758
+-0.040383 0.152127 0.00460721
+-0.0503264 0.131112 0.0307063
+-0.061863 0.0953699 -0.0186332
+-0.0356336 0.11996 -0.0108661
+-0.000498349 0.118323 0.0391474
+-0.00744633 0.0386202 0.0260498
+-0.0702648 0.156758 -0.047919
+-0.0607772 0.146055 -0.00361746
+-0.0557733 0.0797194 -0.0205764
+-0.0286229 0.0450027 -0.0280846
+-0.0400285 0.0339876 -0.0295458
+-0.0244818 0.0974513 0.0444604
+-0.0736592 0.0887741 0.0405778
+-0.0626256 0.150596 -0.021578
+-0.0455006 0.117978 0.0306048
+-0.0153159 0.119411 -0.012435
+0.00132313 0.0358703 0.0464707
+-0.0231138 0.0666037 0.0460408
+-0.0487946 0.0869761 -0.0218357
+0.0312031 0.0842875 -0.0196213
+-0.0866673 0.109085 0.0143521
+-0.0716243 0.157487 -0.00225608
+0.0404941 0.0555582 0.0318463
+-0.0624591 0.155071 0.0054624
+-0.043713 0.0695592 -0.0168487
+0.00662363 0.128671 -0.00261559
+0.0292045 0.0356392 0.0180684
+0.0152063 0.0878077 -0.0294658
+0.0560899 0.059136 0.000193317
+0.0162996 0.0623114 -0.0287447
+0.00333411 0.0539266 -0.0303683
+-0.0212016 0.0383732 -7.87452e-05
+-0.0683674 0.147186 -0.0280671
+-0.0614001 0.124084 0.0428232
+-0.0273522 0.0939518 -0.0257303
+-0.0526652 0.0647199 -0.0102
+-0.032486 0.0449059 0.0475402
+-0.0090473 0.168146 -0.0217175
+-0.069891 0.119438 -0.0086356
+-0.0744393 0.114503 0.0509494
+-0.0648928 0.0350374 0.038379
+-0.00019365 0.125094 0.0326823
+-0.039166 0.0355671 -0.0293815
+-0.0258209 0.0692735 0.0430043
+-0.0620187 0.175667 -0.057604
+-0.0903815 0.130904 0.00623191
+-0.00457753 0.11466 -0.0174869
+-0.0733982 0.114573 0.051125
+0.00137655 0.0380516 0.0229424
+-0.0197661 0.0728664 -0.0388949
+-0.0370853 0.162227 -0.0135318
+-0.0166846 0.109701 -0.0201927
+-0.0564987 0.0932477 0.0451284
+-0.086761 0.084678 0.016478
+-0.0201321 0.0568083 0.0475876
+-0.0893331 0.111939 0.012355
+-0.0291964 0.162421 -0.00376774
+-0.0840799 0.143223 0.00416483
+-0.0550692 0.121281 0.0379498
+-0.0258999 0.0382697 0.0279803
+-0.0881372 0.150234 0.0261027
+-0.0189632 0.0385431 -0.0165058
+0.0252198 0.0478964 -0.0186081
+-0.0250024 0.118057 -0.0129436
+-0.0341053 0.162392 -0.00207929
+-0.0455587 0.0461599 -0.0105245
+-0.0673284 0.11863 0.0518333
+-0.0767393 0.157602 -0.0105393
+-0.0460199 0.0377083 0.0451098
+0.00937824 0.0346871 0.0203526
+-0.0232543 0.181611 -0.01087
+-0.0185423 0.0342292 -0.0199208
+0.0094823 0.034855 0.0256576
+-0.00349094 0.060529 0.0547186
+-0.0536823 0.0678463 -0.0129474
+0.0573543 0.0687146 0.022093
+0.0297466 0.036015 0.0196643
+0.0183828 0.0447123 -0.0227438
+-0.00451438 0.1296 0.000561158
+-0.0575172 0.037335 -0.0101901
+-0.0273178 0.113609 -0.0162558
+-0.0127855 0.0392769 0.0369668
+0.0359154 0.0915824 -0.0149202
+-0.0321871 0.0680263 -0.0214501
+0.0373115 0.0673123 0.0362946
+-0.0482709 0.0345995 0.0405757
+-0.0586992 0.142676 -0.00307276
+-0.0720231 0.149543 -0.0391183
+-0.0926193 0.122848 0.0312739
+-0.00649959 0.103045 0.0436802
+-0.0172605 0.128293 0.0149127
+0.0500544 0.0553974 0.0300563
+-0.0459009 0.131661 0.0191601
+-0.0355139 0.176726 -0.00796363
+-0.0132739 0.162396 -0.014817
+-0.0205091 0.112696 0.0389743
+0.0400974 0.0943736 -0.00783899
+0.0445099 0.0945603 0.0161557
+-0.00940844 0.100291 -0.0242411
+-0.0880121 0.147225 0.0305337
+-0.0134729 0.17718 -0.0214028
+0.0289055 0.0408264 0.0297172
+-0.0386238 0.0335154 -0.0250853
+-0.0474847 0.0931518 0.0438057
+0.0385195 0.109282 0.00815775
+-0.0094889 0.119647 0.0372435
+-0.0558334 0.0358523 0.0464479
+0.0391497 0.108397 0.00837586
+-0.0166742 0.0668915 0.0537111
+-0.0514343 0.0647808 0.0348885
+-0.0506054 0.0575708 -0.00965819
+0.0186225 0.0355557 -0.00967449
+-0.0507888 0.0855066 -0.0215873
+-0.0563207 0.0562341 0.00763908
+0.00416104 0.0393786 0.0331643
+0.00410872 0.110162 -0.02034
+-0.0326921 0.152804 -0.00294992
+-0.0105902 0.0385498 0.00372703
+-0.0450772 0.0337168 -0.000691764
+0.00110427 0.111585 -0.0201254
+-0.086661 0.123026 0.0482846
+-0.00349688 0.0633763 0.0563118
+0.0181674 0.0959966 -0.023265
+0.0171824 0.126495 -0.000336309
+0.0349695 0.0577828 0.0363582
+-0.0893883 0.0956403 0.0164184
+-0.0132244 0.172771 -0.0193112
+-0.0115098 0.0702302 0.0553956
+0.0292762 0.0431552 0.0314362
+0.0355897 0.0411906 0.0271165
+-0.0396848 0.0344413 0.0355548
+-0.0488762 0.0335766 0.000473902
+-0.0845392 0.0778023 0.0145171
+-0.0600467 0.0342661 0.0313871
+-0.0484946 0.156406 0.00957752
+-0.0435279 0.0506014 0.0392212
+-0.0581322 0.0624985 0.0284102
+-0.0319273 0.126498 0.0125244
+-0.0692254 0.124258 0.0526584
+0.0346263 0.114673 0.0139267
+-0.0707453 0.113137 0.049314
+0.0440515 0.0722274 0.0248494
+-0.0190238 0.0384735 0.0274147
+0.0318733 0.11664 0.0243218
+-0.00980958 0.166665 -0.0207735
+-0.075878 0.0954761 0.0383509
+0.04237 0.0533961 -0.00679891
+-0.00515103 0.127241 0.0295045
+-0.0386117 0.0406767 0.0425487
+0.0591522 0.0552732 0.011174
+0.0399613 0.0806226 0.0334139
+-0.0892353 0.14446 0.0304266
+-0.0104754 0.127368 -0.00300647
+-0.0635158 0.162004 -0.0583208
+-0.0801984 0.0868229 -0.00856132
+-0.0600399 0.13696 -0.00647222
+-0.0777335 0.153443 0.0307864
+-0.046469 0.119345 0.0289808
+-0.0313084 0.126018 0.00688499
+-0.0190244 0.0385858 -0.00538325
+-0.0698329 0.112058 0.0465849
+-0.0761752 0.110468 0.0448594
+0.0607736 0.0651167 0.0161629
+-0.0738077 0.102191 0.0374953
+-0.0406116 0.0337811 0.00738645
+-0.0152574 0.166467 -0.0199789
+0.0135127 0.0860479 0.0530247
+-0.072308 0.159721 -0.00687103
+0.00549414 0.130728 0.00313392
+-0.00649655 0.0870315 0.0570873
+-0.0353742 0.125928 -0.00196324
+0.00551011 0.0870055 0.0566199
+0.00569172 0.093878 -0.0314287
+0.0453353 0.0533808 -0.00616451
+-0.0788788 0.16526 -0.0309581
+0.0122616 0.0765812 -0.0308581
+-0.0471876 0.131943 0.0231102
+0.0442177 0.0860807 -0.00279659
+-0.0735334 0.165176 -0.017728
+-0.0896904 0.116203 0.0443945
+-0.0887705 0.0969872 0.0214096
+-0.0201887 0.0754016 0.0541402
+0.0203245 0.0636 -0.0272806
+-0.0513256 0.0345659 0.0399502
+-0.0461113 0.034482 0.0324006
+-0.0773794 0.109459 0.0418273
+0.0262228 0.0747294 -0.0245497
+-0.0281178 0.0845911 -0.0356125
+-0.029049 0.0511502 0.0411139
+-0.0685509 0.065132 0.0256966
+-0.0660181 0.127026 0.048508
+-0.0475948 0.0403553 0.044655
+-0.0711998 0.15079 -0.0434624
+0.0346942 0.0401467 0.0260507
+-0.0803051 0.0719229 0.0175051
+0.0266708 0.121701 0.00384182
+-0.0637803 0.118542 0.0465326
+0.0257185 0.0699313 0.0441746
+-0.0865836 0.11378 0.0451954
+-0.0543656 0.153368 0.0199938
+-0.0147843 0.0981951 -0.0260468
+-0.0480746 0.134034 0.00539884
+-0.0172971 0.0386165 -0.00691824
+0.024363 0.0867852 -0.0239669
+0.000502788 0.056275 0.0546165
+0.0460119 0.0750141 0.00420589
+-0.0813458 0.154098 0.0250842
+-0.0504992 0.111154 0.0370407
+0.0480441 0.0725423 0.0171549
+0.0177377 0.0821568 0.0520978
+-0.0634907 0.0833477 0.0441845
+-0.0287709 0.04365 -0.0290051
+0.0412886 0.0858436 -0.00978207
+-0.0434867 0.0959016 0.0426578
+-0.0685902 0.112767 0.0465657
+0.0446015 0.0889424 0.0221651
+0.0387218 0.0993392 0.0297824
+-0.0569101 0.0984236 -0.0203516
+0.0460228 0.0834207 0.0061859
+-0.0608711 0.101136 -0.0186334
+0.0198592 0.123572 0.0284223
+-0.0670185 0.155095 -0.00202392
+0.00194178 0.0353485 0.0200578
+-0.0202225 0.0381837 0.0220241
+0.0372544 0.111046 0.00772111
+-0.0226761 0.0552382 -0.0304344
+-0.0500773 0.15315 -0.00486218
+0.0361622 0.075448 0.0382492
+0.00638813 0.0448624 -0.0253374
+0.0240783 0.123806 0.00430528
+-0.0874625 0.123933 -0.000723767
+0.0191746 0.064523 0.0487473
+-0.0528554 0.116872 0.0339893
+0.0012658 0.0697321 -0.0339789
+0.0363552 0.112269 0.0088181
+-0.0336364 0.0836212 -0.0255231
+0.0394621 0.0820907 0.0342997
+-0.0759857 0.112794 0.0483899
+0.042364 0.0505846 -0.00668018
+-0.0878291 0.0895228 0.0236162
+-0.0717396 0.156144 0.0122972
+-0.0118777 0.107304 -0.0220947
+-0.0518036 0.0898543 -0.0220029
+-0.0605307 0.142151 -0.00455603
+-0.00730388 0.0394625 0.048838
+-0.0695099 0.151355 -0.0447129
+0.0461391 0.0820336 0.0131698
+-0.0680095 0.151244 0.0371953
+-0.0696447 0.155522 0.00577511
+0.0106458 0.0343542 -0.00488721
+-0.0717447 0.165221 -0.0449739
+0.00872274 0.0346011 0.0383625
+-0.0601559 0.0472008 0.00728305
+-0.072526 0.149972 -0.0424686
+-0.0921507 0.129567 0.0102504
+-0.0195451 0.0382679 0.00943
+0.017351 0.0351839 -0.014686
+0.026638 0.0619848 -0.0226053
+-0.0779425 0.0757661 -0.00656744
+0.0456648 0.0834028 0.0181693
+-0.00238392 0.0391586 -0.00815532
+-0.0760947 0.171183 -0.0343205
+-0.037685 0.127343 0.0163262
+0.0200653 0.084847 0.0502217
+-0.0576821 0.0438911 0.0236882
+-0.00181158 0.0365903 0.0109133
+-0.0227414 0.0640418 -0.0345473
+-0.0607804 0.0397294 0.0180031
+0.00451899 0.0966593 -0.0283637
+-0.00904759 0.0994069 0.0493883
+0.036694 0.0368281 0.0111245
+-0.0476151 0.0378648 -0.0125385
+-0.0374934 0.0620193 0.0412021
+-0.0678369 0.0706443 0.0351197
+0.0262359 0.122255 0.0222063
+-0.0258834 0.0347926 0.045205
+-0.0730191 0.0808411 -0.0145801
+0.0272041 0.0968528 0.0430049
+-0.0387216 0.0710357 -0.0169218
+-0.0802983 0.0953773 0.0342868
+-0.0928216 0.122866 0.0342742
+0.0288283 0.120572 0.00606361
+-0.0872644 0.139206 0.0412952
+-0.0528885 0.108408 -0.0187758
+-0.0614742 0.149784 0.0364078
+-0.0888928 0.113895 0.0428033
+0.0133289 0.0681229 -0.0310343
+-0.000536732 0.10034 0.0474846
+0.0582707 0.0579579 0.00417743
+-0.0896629 0.124003 0.00427429
+-0.0333755 0.0483636 -0.0203394
+-0.0335104 0.169764 -0.00293532
+-0.0488446 0.119728 0.0310062
+0.0426741 0.0972641 0.0231497
+-0.0441044 0.0451364 -0.0122986
+-0.059855 0.0594826 0.0200848
+0.0270691 0.0942437 0.0445649
+-0.0896385 0.0969877 0.0134181
+-0.0456599 0.0636306 -0.0135866
+0.0575548 0.053733 0.00618309
+-0.054499 0.0776179 0.0432703
+0.0434163 0.0464179 0.0294988
+-0.0134899 0.0951663 0.0534531
+0.0324423 0.0754774 0.0416539
+-0.0117218 0.0382705 0.0200729
+-0.0308456 0.0396262 0.0517145
+0.0564645 0.0594668 0.0252844
+-0.0475135 0.0491287 0.0385522
+-0.0396908 0.0651397 -0.0142325
+0.0201781 0.0351992 0.0293411
+-0.0219159 0.175693 -0.0142737
+-0.0688718 0.063973 0.0231175
+0.0174279 0.12392 0.0289777
+-0.0699032 0.0687756 0.0310328
+-0.0528961 0.143026 -0.000455911
+-0.0475121 0.0438565 0.0432608
+-0.0275879 0.0384125 -0.00879832
+0.0421339 0.102871 0.00816377
+0.0276939 0.085014 -0.0220629
+-0.0593718 0.0422854 0.0165091
+0.0245725 0.122909 0.0244414
+0.00141552 0.0990584 0.0500955
+-0.0208664 0.103024 -0.023442
+-0.04595 0.0351008 -0.0224117
+0.0425933 0.066459 0.0273252
+-0.085327 0.0926016 -0.00256332
+-0.0496528 0.0345916 0.0385506
+-0.023191 0.178657 -0.0125853
+-0.0179257 0.0971306 -0.0269629
+0.0383787 0.0575308 -0.00558257
+-0.0190955 0.0939751 -0.033709
+-0.0659978 0.135528 -0.00820667
+-0.0379695 0.0348544 -0.0150276
+0.0231948 0.0344554 0.00500709
+-0.0577114 0.148197 0.0324041
+0.0473189 0.0638822 -0.00202275
+-0.091122 0.115466 0.0410527
+-0.0499316 0.141822 0.00385784
+-0.0663647 0.0360087 0.0372253
+-0.0453211 0.0345932 0.035979
+-0.00367712 0.0569332 -0.0329252
+-0.0883137 0.103697 0.0153744
+0.0333218 0.0981688 0.0378146
+0.0206459 0.0429683 -0.0197059
+-0.0718069 0.0887788 0.0415418
+-0.050581 0.0445938 -0.00942218
+-0.0589701 0.121961 -0.00876657
+-0.0786152 0.163841 -0.0309629
+-0.0919702 0.114664 0.0123319
+-0.0387263 0.127561 -0.000266265
+0.0573405 0.0635192 0.0248021
+-0.0778913 0.126656 -0.00702073
+-0.0685283 0.0434892 0.00727271
+-0.0779351 0.161108 -0.0209335
+-0.0892037 0.0956419 0.0194144
+-0.091675 0.147474 0.0191435
+0.00817319 0.0832888 0.0558122
+-0.051142 0.0627417 0.0330975
+0.00546913 0.116627 -0.0176566
+-0.0278605 0.124718 0.0184442
+-0.0689992 0.150311 0.0384044
+-0.0690062 0.162382 -0.0519693
+-0.00661995 0.130084 0.0216557
+0.0403849 0.0533789 -0.00673496
+0.0156377 0.0348863 0.0377268
+0.0577131 0.0523367 0.00917793
+-0.00120988 0.105335 0.044053
+-0.00579434 0.0351694 0.0474261
+0.0411666 0.0833385 0.031438
+-0.0325019 0.0988116 0.0438807
+0.00307304 0.124054 -0.00961404
+-0.0350636 0.0383682 -0.0121121
+-0.073931 0.128192 -0.0084465
+0.015055 0.123588 -0.00721903
+0.0455542 0.0875891 0.00417683
+-0.006733 0.0684593 -0.0359965
+0.00394905 0.100531 -0.0224465
+-0.0399008 0.128531 0.0110866
+-0.0778707 0.177255 -0.0480374
+-0.0310993 0.177108 -0.0141677
+-0.0307989 0.0833965 -0.031578
+0.00828982 0.0846467 0.0559983
+-0.0926147 0.121379 0.00928006
+-0.0309131 0.0848198 -0.0305724
+-0.0610919 0.155915 0.0160896
+0.0269409 0.117743 0.0296345
+-0.029909 0.0904807 -0.0265953
+0.0341142 0.0605859 0.0386759
+0.04958 0.0652138 -0.00133913
+-0.0406916 0.0651596 -0.014333
+-0.0186192 0.0393436 -0.0280481
+-0.0321414 0.16968 -0.0161315
+-0.0303394 0.0344325 -0.0205625
+-0.0749113 0.125246 -0.00804661
+0.0179783 0.035483 -0.0126728
+-0.0572916 0.0479655 -0.00237378
+-0.030388 0.0876244 -0.0295653
+-0.00273996 0.130454 0.0216129
+-0.0785777 0.0907895 -0.0106208
+-0.0237519 0.0683934 -0.0360687
+0.0305158 0.11943 0.00953878
+0.0436886 0.0777182 0.0262206
+-0.00223658 0.0383059 0.0473338
+-0.0174973 0.104415 0.0431217
+0.045327 0.0519476 -0.00589943
+-0.022701 0.0611501 -0.0334866
+-0.0334865 0.126881 0.00753677
+0.0458812 0.084809 0.00618736
+-0.0775185 0.147451 0.0411778
+-0.00849166 0.110041 0.0429425
+-0.00827497 0.0389568 -0.00728452
+-0.0154767 0.0545272 0.0507241
+0.0455115 0.0861913 0.0171661
+-0.0286176 0.124173 0.0196508
+-0.0903937 0.142028 0.0281621
+-0.00750142 0.0590729 0.0550185
+-0.0691508 0.152358 -0.047074
+-0.00484252 0.0384695 0.0194856
+-0.00149467 0.116953 0.0400314
+-0.0148242 0.128616 0.018702
+-0.00749757 0.0939067 0.0556187
+0.031866 0.115189 -0.00211013
+-0.0515259 0.0439564 0.0445165
+-0.0773104 0.159761 -0.0159076
+0.0205013 0.108449 0.0395681
+-0.0648774 0.159303 -0.0143091
+0.0267364 0.0606633 -0.022785
+0.00150878 0.0883997 0.0564367
+-0.0659091 0.06022 0.0163937
+-0.0625921 0.1213 0.0447428
+-0.0789765 0.135392 -0.00472816
+-0.0709567 0.0767623 0.0380194
+-0.0506142 0.0560954 -0.00917258
+-0.0707687 0.155356 -0.0469258
+-0.0675837 0.112197 0.043642
+-0.0159686 0.128428 0.0182857
+-0.0564715 0.132545 0.0359114
+-0.044247 0.157947 0.00609665
+-0.011089 0.038804 -0.005846
+-0.0380666 0.0385186 -0.00730796
+0.0253529 0.0520143 0.0399629
+0.00465347 0.0341223 0.0126365
+-0.0905147 0.136459 0.016202
+-0.0184793 0.0336465 -0.023124
+0.0165026 0.118175 0.0355154
+0.0109305 0.0685438 0.0544088
+-0.00849797 0.0952525 0.0545557
+-0.050269 0.11691 0.032477
+-0.0301947 0.125922 0.0102205
+-0.0914405 0.117414 0.0273008
+-0.0231534 0.0352107 0.0523184
+-0.0922901 0.125582 0.0342578
+-0.0703512 0.170836 -0.0520339
+-0.0881528 0.129472 0.0022725
+-0.0125497 0.0445369 0.0499253
+0.0104221 0.127848 0.0278469
+-0.0114754 0.0546403 0.0519269
+-0.0665146 0.16661 -0.0580261
+-0.0384984 0.169734 0.00180247
+0.0290438 0.0509642 -0.0167532
+0.0292682 0.0673021 0.0422638
+-0.0643695 0.149877 -0.0298747
+-0.0741326 0.180484 -0.0536706
+-0.0484658 0.144752 0.00741107
+0.02369 0.10485 -0.01704
+0.0383652 0.101327 -0.00724085
+-0.0516205 0.0604369 -0.00991236
+-0.0080847 0.125292 0.0313586
+-0.0117515 0.0714338 -0.0381291
+-0.0358096 0.12684 0.0170169
+-0.0620073 0.155313 -0.0175819
+-0.0861256 0.0937891 0.0274526
+-0.0627193 0.152197 -0.01058
+0.0557633 0.0538969 0.024211
+-0.0501537 0.152144 0.0115744
+-0.0504041 0.0345678 0.0349233
+-0.0622094 0.0655019 0.0319825
+-0.0630381 0.154049 0.0314099
+-0.0864944 0.112209 0.0250023
+-0.0765838 0.178662 -0.0494737
+-0.0880478 0.0908955 0.0237752
+-0.0540202 0.0513732 0.0109294
+0.0220807 0.125732 0.0192313
+0.000503516 0.0856702 0.0573793
+-0.0624013 0.116928 0.041368
+-0.0687693 0.0793684 -0.0165822
+0.0312024 0.114939 -0.00384217
+0.0394926 0.052754 0.032086
+-0.076502 0.12459 0.0526576
+0.0461265 0.0736153 0.00421619
+0.0493794 0.0453908 0.0224152
+0.0422961 0.0655994 0.0276352
+0.0444235 0.0917457 0.0211574
+-0.04812 0.128214 0.028687
+-0.0256026 0.0837946 0.0522209
+-0.00959872 0.0391743 -0.0260833
+0.0242446 0.0762105 -0.0254816
+-0.050147 0.145259 -0.000515581
+-0.0729617 0.136954 -0.00717713
+-0.0321019 0.119786 0.0288381
+-0.0723819 0.152607 -0.0408904
+0.0595077 0.0567056 0.0171693
+-0.0647247 0.16489 -0.0257757
+0.0214018 0.0473917 -0.0206345
+-0.0652965 0.147932 -0.0271042
+0.0404164 0.0647148 -0.00677085
+-0.0440757 0.0335994 -0.0169421
+-0.0658186 0.154852 0.00425231
+-0.0457713 0.156483 0.00739285
+-0.0550494 0.0577849 0.0202145
+-0.0233757 0.163881 -0.00766181
+-0.0658954 0.166616 -0.0590008
+0.0309109 0.0511672 -0.0117352
+0.0380176 0.101228 -0.00786632
+0.0272437 0.0732614 -0.0238068
+-0.0161865 0.0377383 0.0516902
+-0.051271 0.0356477 0.0458842
+-0.0184884 0.107161 0.042158
+0.0143121 0.0753991 0.0540935
+0.012486 0.0990688 0.0481132
+-0.069936 0.13258 -0.0084535
+-0.0324718 0.0546382 0.0373194
+-0.0637186 0.179242 -0.0585917
+-0.0560047 0.159776 0.00109778
+-0.0940215 0.120122 0.0233001
+-0.0734929 0.154069 -0.0299022
+0.0334431 0.0930091 -0.0164312
+-0.0568079 0.0869026 -0.0213473
+0.0600207 0.0595165 0.0181686
+-0.0282716 0.0376885 0.0226211
+-0.0608814 0.102587 -0.0185388
+-0.0689777 0.172299 -0.0388012
+-0.0333033 0.176609 -0.00426163
+-0.0726003 0.145757 -0.0168539
+-0.0351155 0.0460859 0.0430647
+-0.0668221 0.16563 -0.0222317
+0.0223344 0.0535713 -0.0254238
+-0.0555068 0.0341015 0.0254741
+0.0591828 0.0594427 0.0211715
+-0.076476 0.07597 0.0322323
+-0.0548438 0.043635 0.0177242
+-0.0545598 0.0616597 -0.0074577
+-0.0717138 0.073474 0.0353741
+-0.0123858 0.0383448 0.0108168
+-0.0878417 0.140531 0.0102059
+-0.0338438 0.0337316 0.012415
+-0.0362549 0.153841 -0.0082413
+-0.066147 0.0353356 0.0361254
+-0.0149468 0.125073 -0.0044168
+-0.0517378 0.0545135 0.0226244
+-0.0791517 0.0792478 0.0324066
+-0.0311673 0.0386498 -0.0134468
+-0.00138514 0.0391216 -0.00791905
+0.0249209 0.0782259 0.0483953
+-0.0288805 0.079237 0.0443379
+-0.0499299 0.0335056 -0.0106454
+0.000248169 0.0726618 -0.0353693
+-0.00679601 0.100851 0.0456503
+0.00749727 0.121002 0.0360768
+0.0281364 0.0448054 0.035097
+-0.0616338 0.0739295 0.0406212
+-0.0184922 0.11816 0.035496
+-0.0231843 0.0348489 0.0439808
+0.0524989 0.0718135 0.00595977
+-0.0114982 0.0943996 -0.0340943
+-0.0574587 0.045976 0.042703
+0.0272754 0.0703879 -0.0233186
+-0.0208041 0.127131 0.0063587
+-0.0449931 0.152736 -0.00651735
+-0.0154877 0.167822 -0.0210841
+-0.0738833 0.122317 -0.0079807
+0.0163998 0.0834424 0.0519345
+-0.0615988 0.156867 -0.0225865
+-0.0504372 0.0529682 0.0186225
+-0.0607622 0.0781498 -0.0187637
+-0.0208042 0.125974 0.0209606
+-0.0245306 0.112636 0.0373469
+-0.030708 0.121227 -0.00820323
+-0.0511359 0.0502476 0.0206335
+-0.0384993 0.0733372 0.0420402
+-0.0588719 0.102608 -0.018764
+-0.0774969 0.130279 0.0531227
+-0.0375712 0.124334 -0.00748059
+-0.0119956 0.0882297 -0.0377812
+0.0547499 0.0492946 0.00521444
+0.017211 0.088423 -0.0276786
+0.0381646 0.0644978 -0.0107883
+-0.04783 0.0927226 -0.0216222
+-0.0132756 0.0597275 0.0533794
+-0.00158335 0.0361983 -0.0246741
+-0.0612049 0.174131 -0.0607222
+-0.0655175 0.0356165 -0.00754656
+-0.0874441 0.0860134 0.00347726
+-0.00749507 0.10164 0.0441128
+-0.0175041 0.0382782 0.00983265
+0.00351386 0.100332 0.0462561
+0.0252498 0.0645397 -0.0230446
+-0.0717344 0.131221 0.0507858
+0.0525721 0.0648669 -0.000960413
+-0.0901978 0.11358 0.0212183
+-0.0560194 0.129616 -0.00591188
+0.0441279 0.0748554 -0.00179683
+-0.0307721 0.0349136 0.04922
+-0.0554801 0.0452738 0.0437595
+0.000511374 0.0503823 0.0524384
+0.0295573 0.0375392 0.0237122
+-0.00766545 0.0541253 -0.0331554
+-0.0226026 0.0379508 -0.0287016
+-0.0187506 0.162746 -0.0157051
+0.0546767 0.0732977 0.0167178
+0.042064 0.10006 0.0201605
+-0.0889838 0.099691 0.0193911
+-0.0644638 0.129733 0.0437115
+-0.043484 0.0987241 0.0424341
+-0.0252565 0.120536 -0.00953586
+-0.0159529 0.0390542 0.0365141
+-0.0915486 0.143335 0.0161726
+-0.0405267 0.169768 0.0017705
+-0.0726712 0.0651053 0.0195713
+-0.0132255 0.182074 -0.023933
+-0.0456018 0.0629458 0.0388902
+0.0287985 0.0385521 0.0262584
+0.0314095 0.0695437 -0.0187779
+-0.0625738 0.156865 -0.0165766
+0.0106756 0.0489592 0.0485841
+-0.0781956 0.163891 -0.0259488
+0.0262919 0.101687 -0.017683
+-0.0681573 0.180556 -0.0543707
+-0.0464942 0.100125 0.0422537
+-0.0294775 0.17726 -0.00505881
+0.00976325 0.0346476 0.0385339
+0.0351088 0.100136 -0.012024
+0.0398312 0.0992984 0.027798
+-0.0544975 0.080589 0.0448325
+-0.0251898 0.177123 -0.0193397
+-0.00463984 0.12746 -0.00519523
+0.0365694 0.109049 0.0260841
+-0.062967 0.159919 -0.044604
+0.0156331 0.0915267 -0.0269033
+-0.0577811 0.0472143 0.0403119
+-0.086179 0.107645 0.0083646
+-0.00357674 0.0347286 -0.0239915
+-0.0205507 0.066817 0.0505282
+-0.0590047 0.132542 0.0375172
+0.00657766 0.034511 0.0217547
+-0.0730595 0.110042 0.0423406
+-0.0725117 0.163674 -0.014076
+-0.0130193 0.115677 -0.016537
+0.0190348 0.0768352 0.0521916
+0.00221518 0.114462 -0.0193126
+-0.0142885 0.0390252 0.0350884
+-0.0492809 0.152135 0.0110836
+0.0378754 0.0980648 0.0320906
+-0.0377624 0.0420706 0.0430123
+0.00890997 0.125517 0.0316176
+0.00478616 0.0342999 0.00145343
+-0.0220536 0.0952953 -0.0290683
+-0.0883767 0.125344 0.00127971
+-0.055499 0.0761852 0.0427309
+-0.0505039 0.0487703 0.0186583
+0.0374548 0.0781001 0.0366194
+0.00520505 0.129939 3.61829e-05
+-0.0464525 0.146291 0.00643191
+-0.0545162 0.049049 -0.0054035
+-0.0209524 0.0920017 0.0529687
+-0.0534945 0.105667 0.0403502
+-0.0355002 0.174151 -0.00180627
+-0.0654804 0.146553 -0.0219125
+-0.0577458 0.131139 0.0375772
+0.0440584 0.0860884 0.0251529
+0.0484396 0.0486951 -0.00266239
+-0.0510317 0.0544187 0.0196187
+-0.0305049 0.0720397 -0.0305133
+-0.0513349 0.057067 0.0306313
+-0.0444577 0.123407 -0.0104693
+-0.0404418 0.0351129 -0.0289386
+-0.0611441 0.169381 -0.0576009
+-0.0704838 0.120388 0.0533274
+0.00150053 0.0591133 0.0550768
+-0.0504978 0.159322 0.00851944
+-0.0127755 0.126776 0.0267341
+0.00508634 0.0345614 -0.0155701
+-0.0433649 0.150829 -0.00565896
+-0.0276025 0.0888516 -0.0335952
+-0.0536948 0.0661603 -0.0107375
+0.0453129 0.0698237 0.023466
+-0.0407211 0.150643 0.00408479
+0.0111265 0.120476 0.0355761
+0.000791005 0.0398223 0.046536
+0.0460187 0.0482649 0.029417
+-0.0748889 0.119375 -0.00765967
+0.0240318 0.0591603 0.0451764
+0.0102193 0.129407 0.000604352
+-0.0662744 0.179701 -0.0600508
+-0.0165098 0.0772307 0.0561424
+0.0294369 0.0781918 0.0443709
+-0.0510278 0.0474301 0.0166894
+-0.0808293 0.0720933 0.0155437
+0.0139163 0.0953242 -0.0249235
+-0.0756827 0.0823892 -0.0125945
+0.00119778 0.0825383 -0.0355009
+-0.0614832 0.0775692 0.0421583
+-0.0816839 0.0830971 0.0318157
+-0.0257584 0.0736396 0.0456283
+0.0071927 0.124822 -0.00847934
+-0.0749667 0.0683767 0.0215337
+-0.0415307 0.127763 -0.00103989
+0.0217652 0.0862022 0.0491664
+-0.0758742 0.102063 -0.0106997
+0.00933423 0.0567711 -0.0303022
+-0.010684 0.0584354 -0.034314
+-0.0126507 0.0350556 0.0425263
+0.0424994 0.0597124 0.0306347
+-0.0147222 0.0643235 -0.037347
+0.0579415 0.0716454 0.0119821
+-0.000418875 0.0389219 -0.0131688
+-0.0480228 0.144604 0.00545108
+-0.0124881 0.120998 0.0354929
+-0.0941295 0.121483 0.024294
+0.0533093 0.0573451 -0.00263239
+-0.0426699 0.0336999 -0.0149012
+-0.0466248 0.0577591 -0.0115398
+-0.0628785 0.0393963 0.0426563
+-0.072166 0.063706 0.0120556
+-0.0912059 0.14882 0.0151457
+-0.033491 0.0904012 0.0444067
+0.0152459 0.0821521 -0.0296185
+-0.0608506 0.0333964 -0.00541551
+0.0483298 0.0694277 0.0246416
+-0.0144087 0.0383376 0.0158464
+-0.00316996 0.131012 0.0171239
+0.0247594 0.0929114 0.046503
+-0.0615203 0.153356 0.00130737
+-0.0618578 0.099667 -0.0183374
+0.0303629 0.0483136 -0.00765132
+0.00253507 0.0394917 0.0345311
+-0.0713444 0.144531 -0.0156116
+-0.0188175 0.159674 -0.00630165
+-0.0174928 0.111329 0.0404434
+-0.0425002 0.0437706 0.0420539
+0.038489 0.0484512 0.0319961
+-0.011814 0.163592 -0.0157611
+-0.0526941 0.0334208 -0.00928256
+-0.0613494 0.131082 0.0393909
+-0.0276253 0.0450182 -0.0280952
+-0.0449077 0.159414 0.00690868
+0.00747686 0.0474111 0.0493962
+-0.0535025 0.0917839 0.0444757
+0.0372578 0.0658262 -0.0127785
+-0.0616099 0.158421 -0.0325909
+-0.0443417 0.035118 -0.0243716
+0.0228959 0.0358901 0.0147404
+-0.0312846 0.119331 0.0291556
+-0.0748251 0.0906869 -0.0145799
+-0.0607901 0.0839118 -0.0197808
+-0.060035 0.0645406 0.0315175
+-0.0506187 0.0531538 -0.00831388
+0.0189959 0.104672 0.0434338
+-0.0328687 0.10291 -0.0220775
+0.0293781 0.0721886 -0.0217847
+0.0490097 0.0482239 0.0267018
+-0.00202044 0.0386496 0.0235231
+0.00793635 0.0980328 -0.0238123
+-0.0353308 0.0347033 0.016646
+0.00129902 0.039118 0.0292011
+0.0433693 0.0561672 -0.00598915
+0.0455002 0.059749 0.0314265
+-0.0891212 0.0888935 0.0154552
+-0.00853579 0.044404 0.0484956
+0.0227707 0.10612 -0.0163977
+-0.0830074 0.117688 0.0489709
+-0.0652397 0.150467 -0.0337229
+-0.0787271 0.0954037 0.0355432
+0.0320582 0.11345 0.0286813
+-0.0641355 0.160881 -0.0576174
+0.0459242 0.0806108 0.00418728
+0.0093871 0.0434015 -0.0246765
+-0.0501776 0.124028 0.032677
+-0.0486159 0.0547593 -0.0100622
+0.000494108 0.118289 0.0391022
+-0.0267825 0.0768545 -0.0363352
+0.039504 0.0914002 0.0327084
+0.0495572 0.0525985 0.0293193
+-0.0221892 0.177131 -0.0213718
+0.00724524 0.0369774 0.0269173
+0.0174748 0.0934539 0.0481542
+-0.021119 0.180019 -0.0220004
+-0.0938873 0.12827 0.0192438
+-0.0558806 0.138039 -0.00386657
+-0.0754975 0.123189 0.0531282
+-0.0682563 0.169911 -0.0313673
+0.00486454 0.131282 0.0057704
+-0.0544491 0.156028 0.0112408
+0.0259161 0.0713197 0.0444841
+-0.0205993 0.0408181 -0.0286892
+0.0326751 0.0902947 0.0421046
+0.0303546 0.107428 0.0353018
+-0.043641 0.0451148 -0.0133235
+0.0453399 0.0504735 -0.00539794
+-0.0640884 0.160897 -0.0576117
+-0.015926 0.178652 -0.0196554
+0.0285634 0.0463012 0.0357516
+-0.00467538 0.0353718 0.0474871
+0.00649755 0.131366 0.0177838
+-0.0721007 0.175064 -0.0530188
+-0.0454824 0.0959409 0.0431744
+-0.0892808 0.0888643 0.0124572
+0.00219675 0.0376886 0.0234384
+-0.0084105 0.095275 -0.0329664
+-0.0384962 0.11803 0.0312871
+-0.0451864 0.146266 0.00463419
+-0.0870838 0.0846865 0.0114769
+-0.0855325 0.107606 0.0053458
+-0.0457969 0.126831 -0.00605616
+-0.0164306 0.0384009 0.00449856
+-0.0355073 0.0662414 0.0411418
+0.0174851 0.0852069 0.0507856
+0.0160687 0.122524 -0.00804645
+-0.0586545 0.152137 0.0330321
+-0.0294308 0.0847062 -0.0336139
+-0.0725432 0.15415 0.0310449
+0.0567814 0.0724634 0.0130365
+0.0378457 0.0726607 0.0353699
+0.00540963 0.0375924 -0.0240752
+-0.0555707 0.033544 0.017104
+0.0295902 0.119982 0.0063504
+0.0197767 0.104476 -0.0186365
+-0.0484985 0.160789 0.00748776
+-0.0928176 0.120043 0.0102955
+-0.0427809 0.0464775 -0.012357
+-0.0285046 0.0645461 0.0380462
+0.00349921 0.126284 0.0311054
+-0.0670064 0.156281 0.0226936
+-0.0656496 0.0339611 -0.00733584
+-0.00649844 0.0814993 0.0573243
+0.0421622 0.0427592 0.0252421
+-0.0873651 0.0927561 0.00443631
+-0.00151033 0.108645 0.043169
+-0.0908157 0.116185 0.0427025
+0.0200734 0.0372985 0.0402199
+-0.062954 0.125297 -0.00870732
+-0.0633546 0.0720236 0.0383997
+-0.0691914 0.171601 -0.0360136
+-0.0688255 0.0937312 -0.0163709
+-0.0485029 0.112572 0.035725
+-0.00574267 0.0339825 -0.0190499
+-0.0604857 0.094604 0.0446906
+-0.0257335 0.166803 -0.00931015
+-0.0159771 0.186924 -0.0221541
+0.0463322 0.0743214 0.0180018
+0.0030519 0.130996 0.00365966
+-0.0421665 0.16366 -0.0107342
+-0.0225871 0.168294 -0.0117855
+-0.0484917 0.0718083 0.0405326
+0.0122698 0.0710113 -0.031719
+-0.0857101 0.0869161 0.0258492
+-0.0715046 0.0901731 0.0417302
+-0.0699133 0.123828 -0.00875488
+0.0279019 0.110786 -0.0114065
+-0.0354864 0.12379 0.0245568
+0.0305321 0.081181 -0.0200863
+0.0102651 0.128706 0.0263309
+0.0148603 0.0562539 0.0494599
+-0.0366932 0.0665933 -0.0149481
+0.041469 0.0711384 0.0300167
+-0.0554857 0.0834027 0.0450839
+-0.0113051 0.0389162 -0.0134542
+-0.0701665 0.143936 0.0443089
+0.0424986 0.0527982 0.0326152
+0.0132 0.115178 -0.01612
+-0.0566151 0.0335713 0.0115144
+-0.0746759 0.158036 -0.00628607
+-0.0710897 0.0678996 0.0280309
+-0.0684162 0.160948 -0.0539628
+-0.0788405 0.11444 0.0481937
+0.0425653 0.0859482 -0.00679004
+0.00508264 0.128731 0.0273249
+-0.0460392 0.132757 0.0146796
+-0.0644245 0.0335892 0.00631261
+-0.0779562 0.0727271 0.0259414
+-0.0320811 0.1577 -0.0118106
+-0.08561 0.123026 0.0486561
+-0.0183468 0.0445922 0.0521871
+-0.0646788 0.0378404 0.0247428
+-0.09254 0.118824 0.0413658
+0.0439353 0.0973509 0.0141605
+-0.0925657 0.116008 0.0123183
+-0.00476329 0.0770151 -0.03731
+-0.0647922 0.176686 -0.0531637
+-0.0267774 0.122204 0.0247423
+-0.0331437 0.169673 -0.0156322
+-0.0663865 0.0388997 0.0348294
+0.0255945 0.0477251 0.0385093
+0.0336609 0.0968599 0.0382997
+-0.0916539 0.147467 0.0181472
+-0.0336992 0.0435791 0.0473765
+-0.0785063 0.162438 -0.0279579
+-0.0756712 0.0759423 -0.00884701
+-0.0623186 0.155306 -0.0155862
+-0.0754942 0.124603 0.052984
+-0.0710841 0.0626658 0.0113319
+-0.0214966 0.101664 0.0441706
+0.0325091 0.0454335 0.0302933
+0.023348 0.0930459 -0.0224955
+-0.0477168 0.123954 0.0291105
+0.026559 0.119879 -0.0019388
+-0.0671262 0.150692 -0.0396095
+-0.054551 0.0416447 -0.00949548
+-0.0689 0.115705 0.0512836
+0.0420833 0.0409609 0.00227771
+0.021477 0.0961774 0.0469631
+-0.0517663 0.0812234 -0.0211522
+0.0324154 0.0541402 -0.0117355
+-0.0283184 0.0383801 -0.00152859
+-0.0454995 0.122409 -0.0114255
+-0.0786209 0.174303 -0.0444916
+-0.0570614 0.151623 -0.00120922
+0.0242791 0.118022 0.0317589
+-0.0639993 0.0370815 0.0170442
+-0.0395018 0.0733502 0.0421461
+-0.0174724 0.0388154 -0.0145918
+-0.0829949 0.115554 0.048125
+-0.0155328 0.0386551 0.0297691
+-0.00449743 0.110031 0.0429169
+-0.062341 0.164692 -0.0435908
+-0.016985 0.0384848 0.0278228
+0.0153998 0.109294 -0.0177665
+-0.0121134 0.0347053 0.046472
+0.0238752 0.0421864 0.0394869
+-0.0510476 0.139892 0.00172061
+-0.073661 0.147179 -0.0178577
+-0.0673436 0.155169 0.0284164
+-0.0375089 0.0790164 0.0426336
+-0.0881282 0.0888644 0.0224361
+-0.0165385 0.0459978 0.0505746
+0.0187298 0.0489829 0.0426596
+0.00514365 0.0400743 0.045751
+-0.0405081 0.080404 0.0427771
+-0.0559081 0.112628 -0.0165116
+-0.0414824 0.100082 0.0415393
+0.0326734 0.101648 -0.0136311
+0.0591059 0.0677548 0.00712748
+-0.00525238 0.0350087 0.0405181
+0.0272291 0.0788716 -0.0231926
+0.0526679 0.0554283 0.0285725
+-0.074839 0.15964 -0.0289433
+-0.0475589 0.0335011 0.00261705
+0.0224079 0.0809035 0.0500644
+-0.0774544 0.072993 0.0275707
+-0.0817516 0.140386 -0.000790241
+-0.0203273 0.127615 0.0123404
+-0.0570931 0.0535244 0.00162534
+-0.0775213 0.124569 0.0523637
+-0.0267733 0.15662 -0.0020223
+-0.0341168 0.0383136 -0.000825234
+-0.0926373 0.122856 0.0322729
+0.00549857 0.09243 0.054294
+0.0202616 0.0749268 -0.0272874
+0.0133552 0.13008 0.0103074
+0.0423653 0.0519948 -0.00681796
+-0.0627003 0.150649 -0.00857321
+0.0200754 0.0713524 0.0501382
+-0.0182235 0.123174 0.0292543
+-0.0130686 0.183424 -0.0252779
+-0.0128628 0.0896836 -0.0372956
+-0.0301706 0.0421547 -0.0296993
+0.0403707 0.0444834 -0.00362771
+-0.0253772 0.0722169 0.0453002
+-0.0241328 0.0565311 0.0416958
+-0.0657729 0.0378142 0.038507
+-0.0475733 0.0504004 -0.00924022
+0.0347756 0.0548514 0.0342768
+-0.01273 0.098974 -0.0248693
+-0.0749897 0.139866 -0.00647617
+0.0541381 0.0477755 0.0182012
+0.026052 0.121668 0.00219807
+-0.0178133 0.0827451 -0.0392154
+-0.00506384 0.129812 0.0236663
+-0.0022335 0.116052 -0.016996
+0.0194826 0.0892535 0.0485994
+-0.00549695 0.108658 0.0435455
+0.0411799 0.0844321 -0.00979241
+-0.0546525 0.154186 0.0155249
+0.0209039 0.0386887 -0.00868617
+-0.0522987 0.0504261 0.0316576
+-0.00860205 0.0406149 -0.0260948
+-0.0064872 0.119657 0.0377321
+-0.0794636 0.141716 -0.00376694
+-0.0494618 0.0347575 0.043629
+-0.0282938 0.176171 -0.0172378
+-0.0337476 0.119587 0.029726
+-0.0548148 0.0883935 -0.0220325
+-0.0759162 0.179384 -0.0516058
+-0.0444968 0.0747696 0.0424527
+0.0361181 0.111694 0.0216233
+-0.0677747 0.0370061 0.0137537
+-0.0497774 0.0826759 -0.0213753
+0.0238372 0.12269 -3.58731e-05
+-0.0478227 0.148347 -0.00331487
+-0.00860618 0.0968801 -0.0306409
+-0.0545965 0.0575496 0.0196126
+-0.06512 0.0430832 -0.00329452
+-0.0719312 0.128266 -0.00893149
+-0.0409612 0.0344092 -0.00782476
+0.0534457 0.0510274 0.0243391
+0.0276856 0.0494518 -0.0176966
+-0.0336693 0.0607336 -0.0127906
+-0.0284587 0.0446173 0.0507119
+-0.0255118 0.0936195 -0.0293755
+-0.0717668 0.172238 -0.0510285
+-0.047089 0.156143 -0.00736831
+-0.0756553 0.0837701 -0.0135751
+-0.013224 0.172718 -0.0260103
+-0.0301691 0.174141 -0.0165339
+-0.00226303 0.0382357 0.0184109
+0.0412731 0.0417215 0.0241695
+-0.0559192 0.0335546 0.0152404
+0.0277966 0.12141 0.0199376
+-0.0649916 0.0659907 0.0309635
+-0.0512719 0.127504 -0.00467957
+0.0313718 0.118521 0.0155758
+-0.0621134 0.0350003 0.0423988
+0.00602626 0.127371 -0.00517179
+-0.0500909 0.0358963 0.0459805
+-0.0852266 0.0854944 0.0253873
+-0.0209874 0.04034 0.0536055
+-0.0719403 0.179282 -0.0559874
+-0.0521219 0.120842 -0.0117106
+0.0579437 0.0700837 0.0193768
+-0.0786649 0.0764169 0.0296559
+-0.0724896 0.12743 0.0524304
+0.0400371 0.107017 0.0091647
+-0.0677955 0.0355805 0.0137906
+-0.0212083 0.0825271 0.0563448
+0.0305816 0.112813 -0.00758269
+0.0546919 0.0524816 0.0244106
+0.000503407 0.0647904 0.0566018
+-0.0211614 0.183089 -0.0130948
+-0.0364897 0.0648519 0.0414613
+0.00739557 0.0347435 -0.0216037
+-0.091466 0.14613 0.0241501
+-0.0496442 0.0620141 -0.0117058
+-0.0844141 0.083121 -0.000497419
+0.00924009 0.0846665 0.0556174
+-0.00137013 0.0367929 0.00718583
+0.0499211 0.0443554 0.0178724
+-0.0257693 0.158564 -0.0117505
+-0.08951 0.140665 0.0311774
+0.0074706 0.129229 -0.00123166
+0.0318377 0.0822312 0.0425933
+0.0347555 0.0768972 -0.0157225
+-0.0103619 0.179472 -0.0295714
+0.0350602 0.0968439 0.0368099
+0.0192972 0.063662 -0.0278633
+-0.0758841 0.106327 -0.00893896
+0.0225495 0.119713 -0.00701355
+0.0522449 0.0480372 0.0225432
+-0.0142613 0.0350279 0.0492532
+0.0588535 0.0566417 0.00718098
+-0.0834209 0.0911774 0.0304851
+-0.0354827 0.0945899 0.0441989
+0.0491837 0.0442045 0.019604
+-0.0441515 0.0335185 0.00510187
+-0.0605024 0.111127 0.0368734
+-0.0368482 0.0336146 -0.0266993
+0.0043237 0.131753 0.0112849
+-0.0519904 0.135575 0.0286552
+-0.0628904 0.102548 -0.0180123
+-0.0194395 0.062521 0.0495605
+0.0173831 0.0447578 -0.0232543
+-0.0925995 0.118805 0.0322947
+0.00218481 0.0838969 -0.0348518
+0.0331279 0.0428909 0.0287274
+-0.0528013 0.0884055 -0.0219839
+0.0151848 0.115917 -0.0149184
+0.0567976 0.0508328 0.0181941
+-0.0621222 0.0345142 0.0394173
+-0.0642021 0.071089 0.0372614
+-0.0701839 0.0658802 0.0247105
+0.0178908 0.0563588 0.0485803
+0.0392199 0.073038 -0.0108301
+0.0263921 0.0549677 -0.020802
+-0.0858835 0.0833066 0.0204824
+-0.0812999 0.0747823 0.0185535
+0.0025057 0.0688921 0.0558596
+-0.0804035 0.0745659 0.0220984
+-0.0604943 0.0804378 0.0430854
+0.0220864 0.122759 -0.00230579
+0.0416849 0.100037 0.02216
+-0.0387577 0.150948 -0.00516845
+0.0420841 0.090131 -0.00780186
+0.0270265 0.12251 0.0139387
+-0.0715501 0.0763344 0.0374538
+-0.0885696 0.137819 0.0397738
+0.00156461 0.124373 0.0333352
+-0.00526883 0.0355403 -0.0166416
+-0.0769711 0.133968 -0.00621304
+-0.0750334 0.0851031 -0.01456
+-0.00549741 0.0675328 0.0561955
+0.00134414 0.0524973 -0.030237
+-0.0573916 0.0718042 0.0398933
+0.0283911 0.0672932 0.0427559
+-0.0910025 0.133774 0.0232232
+-0.0354998 0.17123 0.000174393
+0.0458285 0.0801218 0.0204223
+-0.0574741 0.0819362 0.0441691
+0.0510603 0.0729911 0.0094016
+-0.0363492 0.0338444 -0.0305686
+-0.024023 0.17718 -0.0120308
+-0.0625429 0.143922 0.0377415
+0.0323895 0.0490788 -0.00667281
+0.00525838 0.123196 -0.010701
+-0.0294162 0.0890096 -0.030595
+0.0479414 0.0588591 -0.00500215
+0.0158474 0.128954 0.00837281
+0.0170299 0.0590745 0.0491032
+0.0534095 0.0553934 0.0278769
+-0.0600285 0.134031 -0.00683616
+-0.0595027 0.0876292 0.04502
+-0.0323351 0.172733 -0.00297212
+-0.0374903 0.172653 -0.000576721
+0.00749482 0.0546914 0.0525351
+0.0383894 0.0519545 -0.00670373
+-0.0331162 0.0436399 0.0481995
+0.0444193 0.0734774 0.000193217
+-0.0392699 0.127033 -0.00231305
+-0.0377966 0.0870844 -0.0227292
+0.0398005 0.0712586 0.0329247
+0.0227875 0.0348957 0.00078699
+-0.0825515 0.0748682 0.00752949
+-0.0162407 0.125507 -0.00287714
+-0.0654856 0.0398574 0.0313799
+-0.0623389 0.163139 -0.0325913
+-0.0686122 0.0432054 0.00454593
+-0.0379623 0.174733 -0.00453553
+-0.0563002 0.154681 0.0207165
+-0.0455391 0.0396225 -0.0172907
+0.033177 0.0592197 0.0390624
+-0.030845 0.0944191 -0.0240931
+0.0149304 0.0913967 0.05159
+-0.0283564 0.125587 0.00796681
+-0.0364861 0.0547872 0.0389196
+-0.0284285 0.0821494 0.0466355
+-0.0626767 0.0346583 0.0408688
+0.0226817 0.0618915 0.0467691
+-0.00273397 0.0346073 0.0449802
+-0.0747362 0.0663817 0.0145125
+-0.0135041 0.11966 0.0364252
+-0.0466771 0.0355018 -0.0172702
+-0.0711048 0.153963 -0.0459144
+-0.0910141 0.11449 0.034742
+-0.0801763 0.0854684 -0.0085384
+-0.0199842 0.183117 -0.0149159
+-0.0705018 0.155741 0.00837641
+-0.0229946 0.0381678 0.00700416
+-0.0428236 0.0913841 -0.0227682
+-0.0679787 0.154919 -0.0513588
+-0.0787367 0.168047 -0.0389551
+-0.0308479 0.0972408 -0.0233409
+-0.0127769 0.0784711 -0.0383296
+-0.0528408 0.0970645 -0.0221327
+0.0578361 0.0662412 0.00314493
+0.0132266 0.0822053 -0.0304726
+-0.058487 0.113928 0.0361856
+-0.0609416 0.0341022 0.0225725
+0.0498583 0.0540108 0.0297623
+-0.00985903 0.128582 0.0248602
+0.0180859 0.068641 0.0507282
+-0.0275932 0.0779206 0.0459339
+-0.0474983 0.11254 0.0358059
+-0.00306313 0.0346488 0.0430839
+-0.0494839 0.141682 0.00839735
+-0.0444006 0.0337168 -0.00238543
+0.0222885 0.0564166 0.0461469
+0.00464996 0.0378242 0.0256263
+0.00823548 0.113838 -0.0186606
+-0.0404969 0.0634536 0.0414219
+0.0464934 0.0638096 0.0291729
+-0.0275092 0.181505 -0.00874152
+-0.0850366 0.134888 0.000298852
+-0.053967 0.0687802 0.0379578
+0.0458863 0.0820184 0.0171704
+-0.0630174 0.113067 -0.0134471
+0.0163641 0.0348027 -0.00791773
+-0.0668226 0.0923514 -0.017257
+-0.073517 0.104058 0.0373151
+-0.0520334 0.0346252 0.0362685
+0.00147793 0.131501 0.00880182
+-0.0874177 0.131128 0.0459004
+-0.0124954 0.103038 0.0437348
+-0.0148129 0.0841518 -0.0390669
+-0.061937 0.111099 -0.0150221
+0.0286115 0.078186 0.0449305
+-0.0884601 0.0976543 0.0226015
+-0.0196643 0.111086 -0.0196461
+-0.0196772 0.178663 -0.0162873
+-0.0220478 0.0811409 0.0558034
+0.00850296 0.118331 -0.0155001
+-0.0404972 0.0506061 0.0393715
+-0.0833705 0.0767799 0.0142875
+-0.085765 0.112351 0.0286477
+0.0363022 0.0619082 0.0365841
+-0.000508059 0.0576316 0.0544767
+-0.089275 0.0969971 0.0184044
+-0.0708142 0.0694524 -0.00574088
+-0.0186131 0.0378854 -0.0277917
+0.0283679 0.103615 -0.0157324
+-0.0354292 0.0472715 0.0405203
+-0.0748611 0.163212 -0.0154286
+-0.0862421 0.14327 0.00816028
+0.0357067 0.0981492 -0.0118335
+0.0223181 0.0592817 -0.0260832
+-0.0625553 0.041701 -0.00649092
+-0.0824187 0.100645 0.0306028
+-0.0598691 0.101152 -0.0187591
+-0.0309758 0.0383278 -0.0168292
+0.0239145 0.0835849 0.0487444
+-0.00271812 0.0380275 0.0166967
+-0.00631097 0.0354995 -0.0168068
+-0.0435801 0.0491173 -0.010788
+-0.0586891 0.065984 -0.0090861
+-0.072851 0.148958 0.0401319
+0.0442902 0.0875035 0.0241471
+-0.0155441 0.165408 -0.0121335
+-0.084276 0.107651 0.0243439
+-0.0705376 0.04043 0.00377428
+-0.0107227 0.165105 -0.0188107
+-0.0550975 0.13533 0.0326236
+-0.0735773 0.0648576 0.0107478
+-0.0227215 0.0797443 0.0551012
+-0.0404988 0.043751 0.0418177
+-0.0507215 0.132501 0.0301542
+-0.0728912 0.11354 -0.00756484
+0.00242535 0.0343652 0.00462872
+-0.0556704 0.0335434 0.000932366
+0.00528142 0.0509933 -0.0292119
+0.0213389 0.0621093 -0.0262711
+-0.0275166 0.0348502 0.0465557
+-0.0826299 0.110259 0.0284001
+-0.00850001 0.125156 0.0314578
+-0.0707102 0.149836 -0.0414255
+0.0204972 0.107072 0.0404393
+-0.0215031 0.108553 0.041118
+-0.0404837 0.0818282 0.0429123
+-0.0586314 0.0580318 0.0162523
+-0.0648762 0.109524 -0.0137682
+-0.0687139 0.0394283 -0.00171366
+0.00150188 0.0938741 0.0550191
+0.027072 0.122359 0.0168201
+-0.0275307 0.0918372 0.0449329
+-0.00320104 0.131164 0.014241
+0.00886384 0.130684 0.0200808
+0.0402562 0.0857576 -0.0117696
+-0.0823675 0.147331 0.00217458
+-0.082659 0.0776741 0.0225196
+-0.0388763 0.107081 -0.0200218
+0.0151073 0.108635 -0.0180644
+0.0460054 0.0746307 0.0193568
+-0.0735009 0.117559 0.0527975
+-0.0337749 0.0338108 0.0177666
+0.032372 0.116958 0.0202394
+-0.0763319 0.15494 -0.00387485
+-0.0687774 0.0837142 -0.0175822
+-0.010498 0.0517545 0.0512545
+0.0210632 0.038679 -0.00769573
+0.0140028 0.091392 0.0520062
+-0.0842337 0.150005 0.032317
+0.0332536 0.0916169 0.0411931
+-0.0394897 0.0874644 0.0433271
+0.0207921 0.106393 -0.0166835
+-0.0368012 0.111669 -0.0181954
+-0.0495137 0.0503617 0.0366255
+-0.0314035 0.121359 0.0260922
+-0.0745094 0.140045 0.0479791
+-0.020484 0.0842242 0.0566713
+-0.00549585 0.0911858 0.0567127
+-0.0870672 0.0882048 0.024333
+-0.0377523 0.0783086 -0.0194038
+0.0407806 0.0717592 -0.0087638
+0.00365619 0.131646 0.00960837
+-0.0157548 0.0714554 -0.0386719
+0.0597099 0.0650292 0.0201784
+-0.0675187 0.0874976 0.0437834
+0.0405833 0.0670896 0.0305002
+-0.0180479 0.0418467 0.0526068
+-0.0427079 0.151894 -0.00649313
+-0.0220141 0.0388944 0.0538623
+0.00616925 0.0895403 -0.0330971
+-0.0064158 0.0391939 0.0347568
+0.0557201 0.0581302 0.0259556
+0.0563341 0.0711373 0.00671617
+-0.0727258 0.157431 -0.00265266
+0.0125423 0.120941 -0.012332
+0.00414764 0.103055 -0.021794
+-0.029166 0.0762862 0.0418904
+-0.0268469 0.0423164 0.0533212
+-0.0621198 0.0344764 0.0202314
+-0.0618524 0.169383 -0.0535961
+0.0250825 0.10872 0.0381638
+-0.0908254 0.142021 0.0251655
+-0.046283 0.129949 0.00285861
+0.0179105 0.0350278 -0.0116533
+-0.0397746 0.0826803 -0.0210594
+-0.0651763 0.16954 -0.0402745
+-0.0621336 0.16002 -0.0235787
+-0.0355709 0.168274 -0.000671324
+-0.037536 0.159586 0.00182669
+-0.0681305 0.148403 -0.0333773
+-0.0364875 0.100095 0.0421869
+0.0545857 0.0608947 0.0278753
+0.0195769 0.0347391 0.0223805
+-0.0765172 0.154938 0.0266851
+0.0329357 0.0710876 -0.0177809
+-0.0434945 0.111176 0.0370674
+-0.0144911 0.124164 0.030554
+-0.0644813 0.157544 -0.049277
+0.0162463 0.0722881 -0.029887
+0.0292794 0.111414 0.0337321
+-0.0730559 0.14548 -0.015959
+-0.032702 0.0694797 -0.021456
+-0.0682487 0.153053 0.0340661
+-0.0810659 0.143393 0.0434586
+-0.0508913 0.0474088 0.0186488
+-0.041491 0.0832013 0.0425516
+-0.0689521 0.151509 0.0368557
+0.00620362 0.0387395 0.045605
+-0.0437238 0.0739429 -0.018203
+-0.0589977 0.125247 -0.00779139
+0.0113495 0.0553023 -0.0296776
+-0.0665061 0.0972756 0.0420058
+0.00151221 0.0828796 0.0573767
+-0.000819486 0.131234 0.00795191
+0.0463579 0.0575632 -0.00556359
+-0.0223022 0.165377 -0.00961273
+0.0177451 0.0379283 0.0429098
+-0.0914397 0.143364 0.0211639
+-0.0366139 0.0493085 -0.0123994
+-0.0374871 0.0576725 0.0398228
+-0.0252778 0.0383536 -0.00088571
+-0.0593549 0.0410534 0.0179552
+-0.0667502 0.0337781 -0.00695475
+-0.0206534 0.0391059 0.0372895
+-0.0144184 0.0997913 0.0448499
+-0.0451841 0.16983 -0.00497124
+-0.017913 0.184413 -0.0239895
+-0.0265191 0.0388768 0.0380618
+-0.0908997 0.126938 0.0424248
+-0.000826517 0.0853922 -0.0362438
+-0.0534467 0.125409 -0.00644153
+-0.0368662 0.104233 -0.0205194
+-0.02728 0.181917 -0.0121056
+-0.0487731 0.0349958 0.0444688
+-0.0894993 0.135155 0.0302067
+0.0152294 0.0345961 -0.00794828
+-0.0135581 0.166929 -0.0145181
+-0.00316211 0.129199 -0.00103699
+0.0125106 0.108449 0.040622
+0.0494051 0.0734301 0.0147277
+-0.0427147 0.0710705 -0.0176966
+-0.0505553 0.136728 0.0232523
+-0.055076 0.154226 0.0167194
+-0.0598887 0.10828 -0.0169771
+-0.00348603 0.0489394 0.050606
+-0.0325038 0.107028 0.0393329
+-0.0558273 0.114722 -0.0152839
+-0.024429 0.062147 0.0418364
+0.0610039 0.0637491 0.0121545
+-0.0307981 0.0381678 0.00179566
+-0.0224893 0.0462052 0.0523041
+-0.0626699 0.13529 0.0374908
+-0.0871093 0.106357 0.0153576
+0.018535 0.0346925 0.0222104
+-0.0633642 0.142485 0.0383017
+0.0395752 0.0602985 0.0307005
+0.0196495 0.0356664 -0.00567711
+-0.00666974 0.0555272 -0.0330407
+-0.0554731 0.154191 0.0210182
+-0.00998984 0.177238 -0.0295136
+0.0366228 0.111865 0.00747742
+-0.00322809 0.0999661 -0.0238789
+0.00852647 0.0349744 0.0253569
+0.0337455 0.11169 -0.0043358
+-0.033869 0.10148 -0.022225
+0.0215013 0.108432 0.0393095
+0.027565 0.119234 0.026993
+-0.0477832 0.129154 -0.000397631
+-0.057288 0.0521607 0.00365094
+0.0119513 0.0873992 0.0542929
+0.0510679 0.0720267 0.021243
+-0.0525522 0.0487323 -0.0069784
+0.0419877 0.102851 0.0121565
+-0.0154922 0.126886 0.0243264
+-0.010476 0.0965182 0.0531854
+-0.0107078 0.0628117 -0.0359649
+-0.0848416 0.0858026 -0.00253503
+-0.0300028 0.125562 0.00590559
+-0.0137234 0.0643092 -0.0370705
+0.025242 0.0761745 -0.0249679
+-0.0268088 0.0852978 -0.0363495
+0.028746 0.0693043 -0.0217828
+-0.0525052 0.112524 0.0359139
+0.0608734 0.0637391 0.0151617
+-0.0820606 0.151973 0.00432386
+-0.065153 0.0712063 0.036955
+-0.0590564 0.0335255 0.00387291
+-0.0726667 0.0777379 -0.0132872
+-0.0639501 0.166025 -0.0326719
+0.033089 0.0892132 -0.0184699
+-0.0410037 0.148494 -0.000715623
+0.0152676 0.11708 -0.0141694
+-0.0405102 0.127658 -0.000961794
+0.0135046 0.108467 0.0407674
+-0.0598038 0.0341949 0.0280011
+-0.025416 0.0905129 0.0490114
+-0.0383992 0.0420226 0.0422608
+-0.0414999 0.0478558 0.040117
+-0.0525584 0.0501546 -0.00685551
+-0.0394783 0.0832832 0.0435432
+-0.0409872 0.0335947 -0.0218947
+-0.0234596 0.184384 -0.0119315
+-0.00549722 0.0633676 0.0561862
+-0.0249111 0.0958255 0.0441185
+-0.0794946 0.12171 0.0507273
+0.0218787 0.0430332 -0.0157248
+-0.0284679 0.0718578 -0.0335433
+-0.0287174 0.0344722 -0.0298467
+-0.0375646 0.0407082 -0.0285349
+-0.0684694 0.153743 0.0324784
+0.0275012 0.1187 -0.00304813
+-0.0654981 0.100096 0.041968
+-0.0728966 0.155445 -0.0329107
+-0.024103 0.171237 -0.0122056
+-0.0213641 0.0384977 0.0305062
+-0.00878734 0.0798675 -0.0379507
+-0.0034971 0.0703995 0.0574239
+-0.0628591 0.0679841 0.0349557
+-0.0205114 0.0512056 0.0456176
+-0.0215925 0.0364837 -0.0283556
+0.0308475 0.0751439 -0.0207339
+0.0345069 0.0483661 0.0310725
+0.00650269 0.044152 0.0457422
+-0.0404948 0.0733395 0.0422389
+0.00152573 0.0717149 0.0566366
+-0.00449638 0.110771 -0.0213478
+-0.0786622 0.0733343 0.0252726
+-0.00997021 0.129828 0.00744342
+-0.0368781 0.107107 -0.0201846
+0.0114979 0.112659 0.03891
+-0.0516419 0.126901 0.0340875
+-0.05391 0.13392 0.032587
+-0.0537085 0.0491368 0.0316573
+-0.086972 0.143283 0.00915353
+-0.0889751 0.0969295 0.00842099
+-0.0378902 0.121927 0.0281694
+-0.0870357 0.141902 0.00919077
+-0.056635 0.0350546 0.0452244
+-0.019816 0.0347801 0.0465131
+0.0392931 0.086096 0.0340337
+-0.0869334 0.0861006 0.0224549
+-0.0643967 0.0646443 0.0287462
+-0.0398612 0.101404 -0.0212384
+-0.0536876 0.0334698 -0.00403732
+-0.0785163 0.162478 -0.0269418
+-0.0638695 0.16329 -0.0240265
+-0.087202 0.10043 0.0240701
+-0.0736795 0.145791 -0.0128538
+0.0436314 0.0736519 0.026072
+-0.0326308 0.0352345 0.0485487
+-0.0158901 0.160985 -0.0130889
+0.0154243 0.0781303 0.053988
+0.00317805 0.0980649 -0.0258881
+-0.00360287 0.0419944 -0.0253901
+-0.0681856 0.169443 -0.0550153
+-0.0937199 0.12277 0.0132819
+-0.0335083 0.11115 0.0363293
+-0.0897769 0.0915868 0.0144438
+-0.00790609 0.0389527 -0.0109414
+-0.0512486 0.0474505 0.019655
+0.0299943 0.101654 -0.0156302
+-0.0688114 0.086573 -0.0173858
+-0.0425222 0.0435673 -0.0203211
+-0.0411345 0.037889 -0.0275181
+-0.0451234 0.0336213 -0.00611106
+-0.0513475 0.115214 -0.0158415
+-0.0135796 0.18457 -0.0255034
+0.0514482 0.0490026 0.000289284
+-0.0154766 0.160714 -0.011803
+-0.0871595 0.128427 0.0471391
+0.0253818 0.0487646 -0.0196147
+-0.0226623 0.0866242 0.0548392
+-0.00567144 0.0569411 -0.0332111
+0.046481 0.0764536 0.00918999
+0.0579995 0.0690441 0.020859
+-0.0371 0.126156 -0.00341777
+-0.073756 0.0716254 0.0312714
+-0.0320938 0.0457263 -0.0270587
+-0.0109396 0.165104 -0.0156606
+-0.088578 0.151544 0.0220955
+0.00637955 0.131641 0.0120332
+-0.00648723 0.114138 0.040862
+-0.058347 0.0335497 0.00759386
+0.00578775 0.0392649 0.0317966
+-0.0571091 0.140994 0.0314586
+-0.00487882 0.107372 -0.0225382
+-0.0806197 0.114932 0.047462
+-0.0334955 0.0874648 0.043047
+-0.0460993 0.132381 0.0175967
+-0.0638759 0.0334217 -0.000619218
+-0.0121322 0.038759 -0.00601251
+-0.0743637 0.153685 0.0319267
+-0.0445292 0.0547767 0.038815
+0.0265401 0.0686018 0.0436052
+0.0300756 0.0946988 -0.0182345
+-0.00649809 0.0703887 0.0571625
+-0.0574852 0.0861616 0.0444185
+-0.0204789 0.081458 0.0566556
+-0.045663 0.0367902 -0.0212772
+-0.0660163 0.156182 0.0230465
+0.0105014 0.112682 0.0391847
+-0.0863368 0.153207 0.0174967
+-0.0314199 0.0595176 -0.0174145
+-0.0903295 0.150229 0.0211233
+-0.0394972 0.0648803 0.0416583
+-0.0107858 0.0386823 0.0289151
+-0.0567014 0.0534733 -0.0003903
+-0.00348704 0.121028 0.0369539
+0.0367923 0.0967547 0.0340658
+-0.0206904 0.0538665 -0.0309758
+0.0171483 0.0535046 0.047456
+-0.052342 0.035529 0.0457534
+-0.0350351 0.0408695 0.0473482
+-0.0364795 0.0519621 0.0386972
+0.0339284 0.0669478 -0.0167571
+-0.0277715 0.0852268 -0.0356683
+0.00655622 0.121628 -0.0130526
+-0.0586532 0.0645395 -0.00761311
+-0.0582249 0.0344034 0.0351394
+-0.00633129 0.0388612 -0.00122239
+-0.0669198 0.113752 -0.0107887
+-0.0667337 0.0374088 0.0337222
+-0.00249774 0.0520145 0.0539036
+-0.0450377 0.0345968 0.0325315
+0.0242293 0.119847 -0.00515511
+-0.0932424 0.12021 0.0392849
+-0.0535442 0.129727 0.0348674
+-0.00517846 0.0367339 0.04845
+-0.0734548 0.0752713 0.0352251
+-0.0687371 0.155896 0.0104629
+-0.0471614 0.0336254 -0.00103179
+-0.00441737 0.117961 -0.0150091
+-0.0238639 0.0825121 0.0547585
+-0.0132802 0.102485 0.0435875
+-0.0649278 0.105334 -0.0156241
+0.0286778 0.116188 -0.00517917
+-0.0236663 0.0381653 0.00868472
+-0.0645999 0.0432992 0.0347148
+-0.0856886 0.0926246 -0.00156242
+-0.0835056 0.0777286 0.0204901
+0.0321567 0.107734 -0.010124
+-0.0895151 0.151559 0.0181181
+0.0110134 0.130158 0.00376449
+-0.0202842 0.16977 -0.0137262
+-0.00591514 0.12799 -0.00376372
+0.0143906 0.0373653 -0.0212799
+-0.0719296 0.11219 -0.00889601
+-0.0157228 0.0642918 -0.0372774
+0.0269219 0.115924 -0.00692402
+-0.0665225 0.0435914 0.00948645
+-0.0747288 0.102175 0.0369848
+0.0207343 0.120306 -0.00765281
+-0.0240392 0.0380418 0.0177619
+-0.0806691 0.107746 0.0299304
+0.0541727 0.0734662 0.0150335
+-0.0828869 0.0763004 0.0145215
+-0.0490771 0.154645 -0.00592496
+0.0211784 0.0973838 -0.0221644
+-0.0576844 0.0467193 0.0286753
+0.00985328 0.0602892 0.0527986
+0.0232608 0.0748451 -0.0261321
+-0.0524982 0.0862336 0.045539
+-0.0783198 0.147274 -0.0028373
+0.0082875 0.114937 -0.017843
+0.018445 0.0456517 -0.0226728
+-0.0239275 0.1816 -0.0100979
+-0.040758 0.0797297 -0.0196637
+-0.0485257 0.121087 0.0297472
+-0.0345208 0.0633716 0.0403553
+-0.00118398 0.0362533 0.0473478
+0.000189104 0.0867348 -0.0351526
+0.0231695 0.0520348 0.0420858
+-0.0324783 0.0337381 0.0144953
+-0.0597681 0.0334439 0.00560092
+0.0177557 0.0344112 0.00209212
+0.0159863 0.0860656 0.0513294
+-0.0393291 0.127134 0.01721
+-0.0628998 0.1209 -0.00884208
+0.04086 0.101423 0.0231764
+-0.0146702 0.122522 -0.00773793
+-0.0292113 0.156649 -0.000270817
+-0.0415254 0.172553 -0.00373349
+-0.0365135 0.084703 0.0437856
+-0.0208969 0.0381794 0.0236923
+0.011579 0.120136 -0.0134617
+-0.0347516 0.0383809 -0.00467189
+-0.0166266 0.172732 -0.0172138
+-0.0531086 0.126902 0.0355005
+-0.0154789 0.0347707 0.0439361
+-0.0110657 0.112343 -0.0190003
+0.0286979 0.0806527 -0.0216026
+-0.00681305 0.0345833 0.0441587
+-0.0245442 0.0708437 0.0459353
+-0.0613991 0.0718897 0.0389316
+-0.0682443 0.179461 -0.0589214
+-0.00573885 0.0698843 -0.0361103
+-0.0875967 0.100907 0.00640641
+0.0169866 0.0348952 0.0343866
+0.0228667 0.0444458 -0.0147763
+-0.0536029 0.162357 0.00297376
+-0.0723862 0.156822 -0.0359122
+0.000140075 0.103071 -0.0225088
+-0.0543692 0.0334679 -0.00234676
+-0.0771859 0.109877 -0.00559641
+-0.0922148 0.11614 0.0373108
+0.00616718 0.124896 -0.00854967
+-0.00125449 0.12189 -0.0112382
+0.0349132 0.114353 0.0126105
+-0.0534959 0.107052 0.0398334
+0.0553645 0.0492819 0.0192078
+0.0496613 0.0501912 -0.00270335
+-0.0917143 0.128313 0.0332436
+0.00552678 0.0619607 0.0559576
+-0.0252475 0.0736694 0.0465167
+-0.0656879 0.156227 0.015899
+0.0167178 0.128574 0.00869666
+-0.0616277 0.154191 0.00244865
+-0.0845352 0.136246 0.000324782
+-0.0835033 0.0804619 0.0265017
+-0.0380583 0.154792 -0.00920218
+-0.0683549 0.0382578 0.0114352
+-0.0713665 0.156324 0.018248
+0.0326986 0.0781958 0.0420379
+-0.0267044 0.158758 -0.0121466
+0.0274612 0.0417732 0.0323464
+-0.00748374 0.116886 0.0393445
+-0.0618946 0.0333508 -0.00558837
+-0.022958 0.166842 -0.0105567
+0.000373363 0.0349968 0.00734292
+-0.0437553 0.033642 0.00144997
+0.0267259 0.120866 0.0252428
+-0.0859248 0.0832079 0.00547822
+-0.00269975 0.109146 -0.0216168
+0.055733 0.052157 0.00319809
+-0.0704697 0.181218 -0.0537747
+0.00698645 0.0818884 0.0558396
+0.0424628 0.0943961 -0.00280162
+-0.0560128 0.0334549 0.00994988
+-0.000497737 0.11557 0.0407823
+0.0115122 0.104463 0.0449641
+0.0113328 0.124014 0.0325236
+-0.0257103 0.0983522 -0.0242349
+0.0385114 0.038461 0.00447642
+0.0274866 0.0994982 0.0416519
+-0.0205044 0.11679 0.0360351
+-0.0287307 0.0748955 0.0414817
+0.021677 0.0354914 0.00935068
+-0.0604978 0.109778 0.0376942
+0.0349482 0.114159 0.0154869
+-0.0891171 0.11284 0.0400327
+-0.0525174 0.133925 0.0310668
+-0.0467675 0.0811826 -0.0202513
+0.0148515 0.129255 0.0180171
+0.0134018 0.0418881 -0.0236384
+-0.0196836 0.0524593 -0.0309769
+-0.0907522 0.136478 0.0191999
+-0.0282073 0.178522 -0.0159874
+-0.0456817 0.146626 -0.00135754
+-0.0234782 0.174205 -0.0130294
+0.0157394 0.128861 0.0183169
+-0.049553 0.0432181 -0.0104928
+-0.0364431 0.0379518 -0.0296736
+-0.0342528 0.161016 -0.000502552
+-0.0106993 0.061373 -0.0355475
+0.0155546 0.034804 0.0269401
+0.0445305 0.0664178 0.0264316
+-0.0692603 0.166617 -0.0519986
+0.00900275 0.0343116 -0.0200681
+-0.0789639 0.13393 -0.00512141
+0.0183835 0.0490953 -0.0235496
+-0.0211568 0.177178 -0.0149257
+-0.0459855 0.0341655 0.0291843
+0.0234635 0.12256 0.0268857
+-0.0437241 0.0724973 -0.0179849
+-0.0492665 0.143175 0.00640774
+0.0310235 0.0363382 0.00298341
+-0.0703389 0.0353326 0.0107638
+-0.0505002 0.0762293 0.0432414
+-0.0641035 0.141307 -0.00745692
+-0.0474934 0.115292 0.0331905
+-0.050108 0.144746 0.0113816
+0.0325029 0.117364 0.00744623
+-0.0183192 0.124686 -0.00393431
+-0.00150748 0.059016 0.0544507
+-0.0104895 0.115533 0.0397944
+-0.023487 0.0435372 0.0536017
+-0.0655471 0.154522 0.00288522
+-0.0675989 0.156142 0.0239498
+-0.03165 0.0339865 0.0180432
+-0.0447604 0.0336698 -0.00424497
+-0.0348481 0.110331 -0.0188
+-0.0114927 0.0938853 0.0554733
+-0.0700706 0.155642 0.00707306
+0.0444883 0.05975 0.0312137
+-0.0788477 0.0773102 0.0306071
+-0.0712203 0.0706743 0.0326242
+0.00153616 0.078717 0.0572683
+-0.0243177 0.0607418 0.04177
+0.0445696 0.0677675 0.0254424
+0.0516179 0.0503639 -0.000756444
+-0.0610049 0.129668 -0.00770337
+-0.0731244 0.174613 -0.0403365
+-0.021137 0.166765 -0.0184531
+-0.068723 0.163208 -0.0142948
+-0.0415011 0.0676725 0.0415782
+-0.0829782 0.147345 0.00316952
+-0.056007 0.145723 -0.001571
+-0.023276 0.0768174 0.0529315
+-0.0303597 0.158405 -0.0122944
+-0.0594923 0.107014 0.0396564
+-0.0680504 0.156343 0.0223236
+-0.050518 0.054445 0.0327051
+-0.0324286 0.126663 0.0108668
+-0.0629263 0.108221 -0.0156274
+-0.0283572 0.0862879 0.0464179
+0.0304249 0.0399897 -0.00292852
+-0.0820851 0.106006 0.028693
+-0.081432 0.0776141 0.0263044
+0.0121657 0.0990535 -0.0228743
+-0.0148931 0.161809 -0.0143393
+0.0322568 0.0814321 -0.0193234
+-0.0249634 0.0631201 -0.0324542
+-0.0844782 0.152284 0.0269844
+-0.0284889 0.100156 0.0431683
+0.0335187 0.113275 -0.00203325
+0.0243141 0.0347256 0.0105738
+-0.0189924 0.127884 0.0157415
+-0.0555 0.0488797 0.0362241
+-0.0675079 0.104205 0.0395869
+-0.0181173 0.0384288 0.000495732
+-0.0138101 0.0841459 -0.0389466
+-0.0343542 0.0367977 0.0484644
+0.0170352 0.0393356 0.0436644
+-0.0255828 0.0620727 0.0401653
+0.0012257 0.0797035 -0.0352779
+-0.0033226 0.122983 -0.0103909
+0.0377895 0.0954381 0.0337234
+-0.0779478 0.107702 0.034147
+0.0309974 0.0673207 0.0412553
+0.0125192 0.0833344 0.053329
+-0.0569108 0.0471914 0.0407265
+-0.0765896 0.172837 -0.038783
+-0.0243798 0.168291 -0.0108587
+-0.0849208 0.114388 0.046865
+0.0270076 0.100021 -0.0178938
+-0.00936568 0.0388306 -0.00738531
+0.0124903 0.101789 0.047403
+0.0153634 0.050802 -0.0265798
+-0.051492 0.107057 0.0393982
+0.00022872 0.0769217 -0.0357549
+-0.073138 0.156184 0.0161734
+-0.0171943 0.171219 -0.0224352
+0.0282636 0.073195 -0.0229429
+-0.0554943 0.112513 0.0359102
+0.0268698 0.0448976 0.0368034
+-0.0567448 0.0548796 0.00465654
+0.00393342 0.0340406 0.014385
+-0.0269434 0.0864227 0.0492292
+-0.050859 0.0487888 0.015667
+-0.0524919 0.0762203 0.042799
+-0.025733 0.0751362 0.0469781
+-0.0870453 0.0846718 0.00449266
+-0.0765303 0.0961207 -0.0124976
+0.0303449 0.112749 0.0317399
+-0.070531 0.151779 -0.0453729
+0.0534729 0.0645627 -0.000631784
+0.0104112 0.0375138 -0.0230668
+0.0592863 0.0552837 0.0131736
+0.00525297 0.069736 -0.0335357
+0.0167263 0.0350159 0.0378322
+-0.0679113 0.0395796 0.0109828
+0.013918 0.129208 0.0205036
+-0.079478 0.142827 0.0451049
+-0.0708238 0.0631793 0.00551684
+-0.0687786 0.16979 -0.0301319
+-0.0187811 0.119777 -0.0107944
+0.021663 0.053586 0.0452157
+0.015783 0.0914175 0.0510677
+0.0258521 0.119872 -0.00319504
+-0.0172292 0.104564 -0.022745
+-0.0618136 0.0453397 -0.00172473
+0.0207685 0.0449736 0.0420523
+-0.0231964 0.0651165 0.0447582
+-0.0305175 0.0847809 -0.0315638
+-0.0658758 0.122838 0.0504663
+-0.0148324 0.107132 -0.0214612
+0.0460436 0.0778241 0.00519064
+0.00396334 0.0346642 0.000955872
+-0.000496537 0.0675633 0.0565514
+0.0342214 0.0813611 -0.0182381
+-0.0464961 0.0464761 0.0407845
+0.0547176 0.0680176 0.00187225
+-0.0580682 0.132534 -0.0063879
+0.0331199 0.0754691 0.0408773
+0.0401875 0.102783 0.0241636
+-0.0783656 0.151459 -0.000884796
+0.0238113 0.0754906 0.0485213
+0.0164183 0.0726599 0.0518741
+-0.0674097 0.173701 -0.0580011
+-0.0179511 0.175707 -0.0173471
+-0.0334973 0.0859864 0.0423406
+-0.0416172 0.17268 -0.00599082
+-0.0883846 0.119913 0.00130167
+-0.0154061 0.185475 -0.025609
+0.0464852 0.0429053 0.00427528
+0.0545912 0.0717149 0.021096
+-0.0661916 0.0334877 0.00245273
+-0.0495852 0.124005 0.0317323
+-0.0537144 0.0491343 0.0296614
+-0.0818927 0.122139 -0.0045131
+-0.0718108 0.0955414 0.0413269
+0.0221671 0.0444704 -0.016762
+-0.0798314 0.0733447 0.0205614
+0.0166594 0.125691 0.027245
+-0.0892473 0.0888575 0.0104669
+0.00551166 0.0504095 0.0521406
+-0.0627982 0.16724 -0.0607839
+-0.0646154 0.0457888 0.00269728
+-0.0485702 0.047508 -0.00937813
+0.026502 0.121591 0.0237374
+-0.0353601 0.152626 -0.00619729
+0.0403422 0.10564 0.0161674
+-0.0615416 0.034204 0.0241166
+0.0380593 0.0869714 -0.0147288
+0.0319925 0.114417 -0.00326976
+-0.0267368 0.0385445 0.0329521
+-0.0618964 0.108239 -0.0162152
+-0.063845 0.150027 0.0371387
+-0.0739579 0.155489 -0.0249104
+-0.0709691 0.153934 -0.0469289
+0.0249948 0.0405751 0.0353079
+-0.0304784 0.0381297 0.00370653
+-0.0247632 0.0741431 -0.0374571
+-0.0216593 0.0509046 -0.0292926
+-0.0446505 0.0592548 -0.0123035
+-0.0410267 0.172571 -0.00282243
+-0.060985 0.168641 -0.0594898
+0.0260213 0.111246 -0.0119
+-0.0224982 0.103036 0.0436276
+-0.0720537 0.0640001 0.00639175
+-0.08755 0.12805 0.000278104
+-0.0790371 0.0873264 0.0361062
+-0.055031 0.152471 0.0270238
+0.0537262 0.0622241 0.0283948
+0.0248385 0.107021 -0.0153684
+-0.0817292 0.154617 0.0205129
+-0.0776054 0.0804635 0.0348861
+-0.0644463 0.0769092 0.0410862
+-0.0737119 0.082093 -0.0148287
+-0.0782342 0.0694181 0.011104
+-0.0678631 0.0335656 -0.00155997
+-0.0771555 0.15282 -0.00488816
+0.028309 0.049176 0.0371723
+0.0122273 0.0342048 -0.000691958
+-0.0643947 0.15704 -0.046105
+-0.0276636 0.0522618 0.0383069
+-0.0587411 0.154535 0.0270999
+0.0275645 0.122014 0.00844231
+-0.0465457 0.0337901 0.0276252
+-0.0853906 0.110991 0.0352247
+-0.0338206 0.0367327 0.0490996
+-0.0145535 0.06115 0.0532234
+0.0367927 0.111755 0.0132988
+0.0458177 0.0820138 0.0181729
+-0.0444555 0.121377 -0.0123561
+0.0224202 0.0430392 -0.0127301
+0.0158478 0.102035 -0.022
+-0.0100884 0.0347013 0.0469069
+0.0374928 0.0498822 0.031843
+0.0351777 0.0559301 -0.00964394
+-0.00946358 0.169654 -0.0207426
+-0.0656264 0.15567 -0.0512009
+-0.0254805 0.0434932 0.0531599
+-0.0270955 0.0576776 -0.0274029
+-0.0228583 0.0350556 -0.0196661
+-0.0139903 0.169817 -0.0169155
+0.0176377 0.0348968 0.0272836
+-0.0144859 0.107222 0.0429439
+-0.0291189 0.15522 -0.00190906
+-0.0411739 0.165162 -0.0113688
+-0.0123514 0.0384213 0.00530714
+-0.0527141 0.141625 0.0234145
+-0.0612038 0.154834 0.027675
+-0.0338487 0.098628 -0.022813
+-0.000859642 0.105926 -0.0219248
+-0.0203431 0.186558 -0.0166005
+-0.01883 0.0882728 -0.037792
+-0.0635094 0.0987058 0.0422669
+-0.000483407 0.0787781 0.0579546
+-0.0700187 0.074071 0.0369567
+-0.0201986 0.186115 -0.0151371
+0.00141145 0.0376391 -0.024717
+0.0439647 0.0888964 0.0241631
+-0.0774025 0.100791 0.0354679
+-0.078513 0.145668 0.0427459
+0.0241305 0.0618675 0.0453428
+0.0109129 0.0833325 0.0545132
+-0.0798758 0.117757 -0.00451351
+0.0302928 0.119677 0.0137476
+0.0354021 0.0399255 -0.00156043
+-0.0489211 0.0687544 0.0390214
+-0.0493842 0.0558982 0.0343669
+-0.0524939 0.0776533 0.0431774
+-0.00761105 0.112944 -0.01965
+-0.0631004 0.038056 0.0429096
+-0.078061 0.117721 0.0511362
+-0.0228935 0.0375359 -0.0182249
+0.0168546 0.104974 -0.0191686
+-0.062493 0.0385506 -0.00796777
+-0.0814183 0.138999 -0.00180871
+-0.0585811 0.0344322 0.0332983
+-0.0299241 0.172727 -0.00652243
+0.0112861 0.130316 0.0195341
+-0.0325036 0.10978 0.0375732
+-0.0826224 0.141799 0.00118353
+-0.0805022 0.0831735 0.0334637
+0.0122352 0.0808526 -0.0312408
+-0.0771876 0.0907032 -0.0125611
+-0.0140608 0.038299 0.0231793
+-0.0386607 0.116212 -0.0149511
+-0.0276455 0.0376114 0.0210157
+-0.0832306 0.0871025 0.0304136
+-0.0334887 0.0471143 -0.0243565
+-0.0400971 0.153595 0.0050429
+-0.0647302 0.154215 -0.0408208
+-0.0194396 0.0527865 0.0471813
+-0.0665534 0.156088 0.0243177
+0.00850109 0.107119 0.0411949
+-0.0740753 0.174982 -0.0510829
+-0.0131928 0.11434 -0.0171133
+-0.00874908 0.0742103 -0.037697
+0.00967799 0.130572 0.00468392
+0.0318663 0.0862689 0.0426688
+0.0197994 0.0399634 -0.0167042
+0.0141672 0.0347073 0.00296826
+-0.0334912 0.0604137 0.038899
+-0.010802 0.0812949 -0.0382665
+-0.0626127 0.0339199 -0.00909656
+-0.0225179 0.0594554 0.0442529
+-0.0744235 0.152695 -0.0268913
+-0.0148262 0.181632 -0.021586
+-0.0501691 0.0348773 0.00986405
+0.0104481 0.102845 -0.020901
+-0.0127527 0.177163 -0.0221029
+0.008145 0.103004 -0.0207662
+-0.0548867 0.101301 -0.0205491
+-0.0772028 0.162464 -0.0309387
+0.0379552 0.0588939 -0.00773658
+-0.0134957 0.0925258 0.0558596
+0.0248886 0.0970269 -0.0206985
+-0.0393214 0.0342416 -0.0147308
+-0.0458838 0.129671 0.00293555
+-0.0574217 0.135337 0.0345321
+-0.0820284 0.13533 -0.00235647
+0.038582 0.0659177 0.034606
+-0.0494896 0.157875 0.00921755
+-0.0225598 0.125982 0.00280455
+0.0216881 0.102085 -0.0200779
+-0.0136509 0.0496769 -0.0312069
+-0.0615955 0.15529 0.0260796
+-0.0115193 0.0773584 0.0574493
+0.0404486 0.0745397 -0.00879543
+-0.057886 0.0969698 -0.0206731
+-0.0109392 0.038438 0.0236915
+-0.0148475 0.162865 -0.0159421
+-0.0183748 0.0353493 0.0515278
+0.029169 0.114081 0.0318014
+0.0232083 0.0449556 0.0403488
+-0.0234883 0.122057 0.0276339
+0.0359605 0.0936242 -0.0130764
+-0.0175335 0.0392471 0.0378093
+-0.0308588 0.171231 -0.00613945
+0.0247031 0.0463341 0.0389677
+-0.0925247 0.128292 0.0282327
+-0.0665656 0.122847 0.0512252
+0.0584586 0.0607609 0.022909
+-0.00884754 0.115581 -0.0164541
+-0.00309453 0.0984522 0.0515066
+0.0115015 0.119616 0.0358941
+-0.0494977 0.0903933 0.0446494
+-0.0126691 0.0348865 0.0479592
+-0.0149576 0.0897382 -0.0373658
+-0.0152002 0.174208 -0.0254562
+-0.0756281 0.167353 -0.024657
+-0.0627225 0.0402195 0.0247088
+-0.058955 0.151077 0.0341866
+-0.00932165 0.17502 -0.028678
+-0.0123491 0.183911 -0.0264322
+-0.0896074 0.135171 0.0322127
+-0.0426789 0.168728 0.0023488
+-0.0748775 0.0739125 0.0325733
+0.03891 0.10882 0.00971935
+-0.0633729 0.0431313 0.0286681
+-0.0551792 0.0336096 0.018904
+0.0268834 0.0875842 0.0460207
+-0.0168782 0.0351038 0.0503404
+-0.00549453 0.0590678 0.0548923
+-0.0286315 0.0383676 -0.00896928
+-0.0332631 0.177035 -0.011981
+-0.0748045 0.167943 -0.0420608
+-0.0851109 0.0939488 -0.00257672
+0.00096833 0.121103 -0.0124156
+-0.0558825 0.0465312 0.026676
+0.00712802 0.0975509 -0.0252935
+-0.00450103 0.0746726 0.0587526
+-0.0754962 0.141423 0.0471972
+-0.0514204 0.0548853 0.0209522
+-0.0107189 0.0642451 -0.0362023
+0.0428473 0.0944698 0.0251639
+0.0161732 0.12869 0.00706423
+0.0172673 0.128465 0.0103258
+-0.0624218 0.113827 0.0376933
+-0.0694289 0.039567 0.00968578
+-0.00956353 0.172645 -0.0227849
+-0.036529 0.0344176 0.0112583
+0.00747563 0.0378784 -0.00876072
+-0.0105064 0.0884021 0.0567868
+-0.0306153 0.0495713 -0.0203608
+-0.0832173 0.13898 0.000315163
+-0.00610064 0.0339097 -0.0209348
+-0.0081869 0.0386049 0.00598379
+0.0213573 0.057915 -0.0266602
+0.0391712 0.0402919 0.0231925
+-0.0346283 0.0533938 -0.0102529
+-0.00324688 0.0367886 -0.0155194
+-0.0734226 0.0711647 -0.00664488
+-0.0628413 0.144409 -0.0076345
+-0.0258745 0.104437 -0.023108
+-0.0100477 0.178214 -0.0295899
+-0.0839857 0.132609 0.0495198
+-0.0498484 0.121182 -0.0121
+0.0108333 0.130856 0.0150885
+-0.0104958 0.0939039 0.0555039
+-0.0863431 0.112514 0.0302243
+0.0475429 0.0429463 0.00623912
+-0.0334893 0.050539 0.0382432
+-0.0209099 0.158178 -0.00579641
+0.011514 0.10312 0.0464311
+0.0350456 0.0627954 -0.0138277
+-0.0161876 0.171234 -0.0230543
+-0.0268555 0.0987274 -0.0239779
+0.0118541 0.0404814 0.0449158
+-0.0104973 0.0856567 0.0572952
+0.0271955 0.0520724 0.0391174
+0.00248489 0.105788 0.0426651
+-0.0037871 0.0812341 -0.0371832
+-0.0231675 0.184436 -0.0160624
+-0.0612844 0.044277 0.027687
+0.0239731 0.061977 -0.0246362
+-0.00946933 0.0932363 -0.0348935
+-0.0178949 0.0971863 0.0483787
+-0.00196639 0.0392296 -0.0118812
+-0.0067485 0.0755804 -0.0372256
+-0.00967937 0.0555867 -0.0337759
+0.000980617 0.120181 -0.0134191
+-0.0806495 0.10968 0.039129
+0.0358807 0.0812282 -0.0166923
+0.0146499 0.0699433 0.0528108
+-0.034478 0.0590226 0.0391844
+0.0203856 0.0348183 -0.00149748
+0.0142674 0.0709686 -0.0310685
+-0.0334971 0.119329 0.0299275
+-0.0341948 0.0435484 0.0464376
+-0.00450247 0.056202 0.0539356
+-0.0721189 0.15515 0.0282101
+-0.000346509 0.12561 -0.00723663
+-0.0756644 0.0774182 -0.00947264
+0.014908 0.106309 -0.0185911
+0.0267515 0.102116 0.0406018
+-0.0626019 0.174089 -0.0546038
+-0.0574874 0.0805202 0.0440851
+-0.0609158 0.169795 -0.0608698
+0.0438296 0.0973504 0.015162
+-0.072512 0.104082 0.0376881
+0.0359801 0.0821479 0.0380155
+-0.0573808 0.129734 0.0381066
+-0.0236825 0.0566574 -0.0305632
+-0.0351787 0.0336265 -0.0226404
+-0.0257826 0.0783385 -0.0372231
+-0.0733446 0.159645 -0.0339252
+-0.024717 0.169741 -0.0113487
+-0.0597904 0.0825229 -0.0201763
+-0.0638365 0.0996097 -0.0175199
+-0.0897172 0.118919 0.0457459
+0.00851027 0.105753 0.0425683
+-0.0857293 0.121702 0.0488414
+-0.00654714 0.043 0.0484741
+-0.0524991 0.109798 0.0378325
+0.0089719 0.130372 0.00300057
+-0.0912936 0.114724 0.0218532
+-0.0758153 0.155373 0.0254598
+0.0443256 0.0931523 0.0201621
+-0.00159763 0.0391157 -0.0252097
+0.0358716 0.112393 0.0201061
+-0.0582724 0.0345955 0.0435663
+0.0444341 0.0861163 0.024155
+-0.0798668 0.12036 0.0500614
+-0.0486801 0.12235 -0.0113455
+0.044671 0.0931702 0.0171607
+-0.0867731 0.0820034 0.0144903
+-0.0444986 0.0465011 0.0409291
+-0.0132439 0.178631 -0.0284206
+-0.0014976 0.0856652 0.0573264
+-0.0555627 0.0351736 0.0453577
+-0.0757755 0.0948358 -0.0134771
+0.0116939 0.0459283 0.0447695
+-0.0334941 0.0690232 0.0409338
+-0.0717098 0.161007 -0.0419418
+-0.0620707 0.163126 -0.0385937
+0.0188526 0.103753 -0.0198618
+-0.0699102 0.14965 -0.0409667
+-0.0405063 0.0902417 0.0426463
+-0.071716 0.148756 -0.0367532
+-0.0218007 0.0637891 0.0462553
+0.0567259 0.0536428 0.00417778
+-0.0893948 0.09291 0.012442
+-0.0603715 0.133894 0.0372893
+0.0314991 0.054058 -0.0137198
+0.0203015 0.126964 0.0128708
+-0.0845068 0.120355 0.0490624
+-0.0624258 0.0342984 0.0291094
+-0.0395093 0.0930879 0.0428865
+-0.0277909 0.0380629 0.00793761
+0.0321502 0.106752 -0.0110706
+0.0298444 0.106115 0.0363002
+-0.054857 0.0970227 -0.0215362
+-0.0397671 0.127634 -0.000654541
+-0.0249592 0.0767123 0.050372
+-0.0265277 0.10717 0.0404632
+-0.0283702 0.0535742 -0.0233936
+0.00450189 0.050474 0.0524519
+0.00174762 0.0944417 -0.0320379
+-0.0810711 0.076096 -0.000474637
+0.0169426 0.11422 -0.015094
+-0.0380634 0.127686 0.00145512
+-0.0320932 0.0877303 -0.0254981
+-0.0569735 0.056267 0.00463231
+-0.0692551 0.175557 -0.0461164
+-0.0461819 0.130936 0.0220239
+0.0424151 0.101486 0.0141591
+-0.0816004 0.110405 0.0418977
+-0.0486814 0.0634873 -0.0123857
+-0.0354984 0.0491504 0.038916
+0.0232288 0.125257 0.0153837
+0.0251982 0.123641 0.0075622
+-0.0357278 0.07254 -0.0181295
+0.0451439 0.0802684 0.0230283
+-0.00649644 0.0605343 0.0557379
+-0.0697973 0.159564 -0.0489352
+-0.037469 0.120514 -0.011464
+-0.0869577 0.133848 0.0453706
+0.0185257 0.0352322 0.0362088
+-0.0206549 0.0768238 0.0545752
+0.0458945 0.0764062 0.00420006
+-0.0137194 0.091107 -0.0367438
+-0.0375014 0.106979 0.038117
+-0.0446156 0.0437685 -0.0132939
+-0.064545 0.156137 -0.0442784
+0.0275233 0.0621538 -0.0218174
+-0.0642285 0.0429095 -0.00424321
+-0.00460043 0.0434181 -0.0258683
+-0.0778454 0.158312 -0.0179205
+0.00252706 0.0800582 0.0567791
+0.0174798 0.0919971 -0.0254067
+-0.08982 0.133788 0.032216
+0.0343452 0.114918 0.0052408
+-0.0630651 0.167844 -0.0445874
+0.0164152 0.127597 0.00146207
+-0.0755176 0.120378 0.0530566
+-0.00615627 0.0994928 -0.025355
+-0.0501125 0.157587 -0.00554245
+-0.0332242 0.152554 -0.00262082
+0.0104732 0.0962984 0.0498872
+-0.0184975 0.111326 0.0402128
+-0.0228147 0.0826618 -0.0384205
+0.025553 0.0822419 0.0475803
+-0.0841632 0.11158 0.00227497
+-0.0198477 0.126879 0.00378288
+-0.069852 0.0951674 -0.0161643
+-0.0306901 0.0678681 -0.026462
+0.0155988 0.0699697 0.0524229
+-0.0167333 0.0642714 -0.0369951
+-0.0167796 0.121583 -0.00869919
+-0.0594953 0.0747194 0.0418121
+-0.0630515 0.152177 -0.00858675
+-0.0111714 0.129564 0.00700207
+-0.0890821 0.101017 0.0143926
+-0.0145147 0.116898 0.0378441
+-0.0462973 0.0368721 -0.0182757
+0.0251418 0.056415 0.0432482
+-0.0114906 0.0532044 0.051601
+-0.0514985 0.0931716 0.0440238
+-0.0536498 0.152894 0.0173581
+-0.0226294 0.157855 -0.00422736
+-0.0723402 0.0380689 0.00697334
+-0.0100211 0.0383173 0.0131334
+-0.0469913 0.0345734 0.0373898
+0.0117235 0.127254 -0.00315056
+0.0163555 0.0343012 4.3653e-05
+-0.000810177 0.084021 -0.0366442
+-0.0417008 0.153622 0.00625938
+-0.0695833 0.156717 -0.0509483
+-0.00967078 0.0541668 -0.0336446
+-0.0862734 0.13657 0.044609
+0.0363518 0.0562159 0.0330449
+-0.0528028 0.0666303 0.0365007
+0.0263615 0.0352587 0.00303932
+0.00111992 0.10872 -0.0203906
+0.00958242 0.0350342 0.0036093
+-0.0639107 0.108163 -0.0148371
+-0.00462988 0.0451748 -0.0282624
+0.00356053 0.130245 0.0239041
+-0.0428482 0.128274 0.00047704
+-0.0896015 0.136498 0.0242003
+-0.011119 0.163582 -0.018751
+-0.0521911 0.0531856 0.0256383
+0.02777 0.0808734 0.0454779
+0.0197898 0.0754906 0.0515075
+-0.0405912 0.0404909 -0.0262976
+-0.0184208 0.185917 -0.0222223
+-0.0738815 0.117926 -0.00764413
+0.0124741 0.0346639 0.0372734
+-0.057552 0.0336321 0.0166122
+0.0220421 0.0848959 0.0495666
+0.0184956 0.0962193 0.0472822
+-0.0577255 0.0578321 0.0166151
+0.00647696 0.11413 0.0402504
+-0.073854 0.100736 -0.0128364
+-0.0528758 0.0985097 -0.0219976
+0.0185485 0.111232 -0.0158588
+0.0257216 0.0672521 0.0441644
+-0.000523566 0.0428273 0.0465064
+-0.0354915 0.050532 0.0385401
+-0.0294972 0.0602632 0.0372614
+0.00410653 0.111609 -0.0202712
+0.0583904 0.0706508 0.00920486
+-0.0644959 0.084745 0.0443622
+-0.0182219 0.0954777 -0.0312615
+0.0163111 0.0608546 -0.0282401
+-0.0725001 0.120391 0.0535845
+-0.0164977 0.0828905 0.0574138
+0.0130474 0.0490028 0.046739
+-0.072956 0.173805 -0.0388399
+-0.0264766 0.0576077 -0.0284232
+-0.0644961 0.0602892 0.0183972
+0.0357477 0.074144 -0.0137952
+-0.0655596 0.171143 -0.0433207
+-0.0784904 0.133065 0.0521095
+-0.0651287 0.156206 0.0175513
+-0.0205565 0.183109 -0.0139659
+-0.0680156 0.156066 0.0121787
+0.0233417 0.0549864 0.0441504
+-0.0745084 0.134461 0.0510337
+-0.0489659 0.12587 -0.00699728
+-0.0422261 0.0339521 -0.0076663
+0.00337017 0.091416 -0.0329064
+0.040054 0.0998936 -0.00479776
+-0.0939204 0.128289 0.0212475
+-0.0301543 0.157156 -0.0110394
+-0.0456539 0.0606919 -0.0125779
+-0.0534986 0.0833862 0.0450488
+-0.047648 0.0614917 0.0367154
+-0.0486267 0.13356 0.00299082
+-0.0895466 0.0969995 0.0164128
+-0.0339552 0.0695264 -0.0185169
+-0.0176031 0.0711548 0.0545194
+0.0454033 0.0457238 -0.00184235
+-0.0546836 0.0478194 0.0276676
+-0.0875304 0.0861027 0.015468
+0.00919687 0.124582 -0.00824181
+0.0404579 0.0971405 0.0281735
+0.0219677 0.0346711 0.00269802
+-0.0114833 0.0618754 0.0549615
+-0.0209254 0.127401 0.0135903
+-0.0681737 0.074979 0.0383298
+-0.0357386 0.176065 -0.00515676
+0.0340797 0.115381 0.00660331
+-0.0207606 0.0670735 -0.0371287
+-0.075369 0.155134 0.0270903
+0.000773445 0.126081 0.0315854
+0.0414985 0.058326 0.0311197
+-0.03873 0.0340634 -0.0163036
+-0.0929281 0.121393 0.0102886
+-0.0680681 0.061235 0.0168081
+-0.0756991 0.0688679 0.00254149
+-0.0138611 0.0386244 0.0283378
+-0.0806333 0.120347 0.049427
+-0.0534714 0.115278 0.0343029
+-0.0365049 0.169731 0.000981263
+-0.0624922 0.100117 0.0423224
+0.00907886 0.126317 -0.00613291
+-0.0935493 0.125561 0.0262639
+0.022475 0.0933993 0.047467
+-0.015827 0.0921385 -0.0358122
+-0.0210449 0.0384562 -0.0168371
+-0.0207268 0.0612423 -0.0346723
+-0.0134967 0.109686 -0.0201653
+0.0456137 0.0708816 0.00289794
+-0.0090863 0.16966 -0.0247514
+-0.0889386 0.0888873 0.0194501
+-0.0532128 0.133944 -0.00360453
+0.0195053 0.0351963 0.0310168
+-0.0255119 0.104394 0.0424048
+-0.0174974 0.103031 0.0436129
+-0.0299173 0.0383162 -0.0299848
+0.00451386 0.0856474 0.057126
+0.0147725 0.0939169 -0.0254338
+0.0242867 0.0719771 -0.0256393
+0.0172719 0.0348529 0.0254373
+0.0558147 0.064873 0.0261542
+-0.0364911 0.0662596 0.041455
+-0.0758603 0.151341 -0.0198831
+-0.0616679 0.0643653 -0.00651734
+0.0383551 0.0603737 0.0324667
+-0.0477542 0.0782681 -0.0190718
+-0.0550269 0.0560444 -0.00440953
+-0.0395059 0.0972892 0.042147
+-0.0777926 0.167262 -0.0295303
+0.0604641 0.0623144 0.017179
+-0.0777137 0.177848 -0.0500546
+-0.0521757 0.0461175 0.0166821
+-0.0754874 0.130275 0.0528009
+0.0116887 0.0343979 -0.00472037
+-0.0617898 0.16156 -0.0335933
+0.0442649 0.0973538 0.00716867
+-0.0616258 0.0641254 0.029779
+0.00550935 0.0688576 0.0555484
+-0.053845 0.0955972 -0.0217935
+0.00741716 0.0375454 -0.0236134
+-0.0596132 0.113903 0.0363038
+-0.0508811 0.108424 -0.0190099
+-0.0437584 0.079737 -0.0197567
+-0.0733029 0.15632 0.000130521
+-0.003234 0.0960652 -0.0317479
+-0.0575581 0.0507849 0.00163524
+0.00435827 0.129372 -0.0013469
+-0.025212 0.123605 0.0223303
+-0.0669175 0.115159 -0.00990572
+-0.0722654 0.153589 0.032663
+-0.0147591 0.033582 -0.024214
+-0.00115893 0.11911 -0.0142672
+0.019441 0.0384709 -0.0146972
+-0.0772499 0.172214 -0.0459981
+-0.069531 0.14702 0.0417131
+-0.0343373 0.0443897 -0.0277936
+-0.0705699 0.152776 -0.0468148
+-0.0918951 0.117319 0.00831437
+0.0103421 0.0567446 -0.0299462
+-0.0336919 0.119642 -0.0105178
+-0.0629712 0.145905 -0.0115915
+0.00646739 0.0342464 -2.28584e-05
+0.00713618 0.103008 -0.0210892
+-0.018026 0.0384381 0.0276504
+0.0433583 0.0505545 -0.0063311
+-0.0882504 0.0900881 0.0054683
+0.00248872 0.118285 0.0387448
+-0.0227774 0.0713561 -0.0378898
+-0.0154972 0.122303 0.0324651
+-0.0322294 0.0708154 -0.0244722
+-0.025189 0.174162 -0.0196112
+-0.0871031 0.0846537 0.0064784
+0.00836869 0.0928852 -0.0303774
+-0.0424793 0.0958739 0.0423242
+-0.0640607 0.152536 -0.00179872
+0.00949301 0.118213 -0.015379
+0.0461867 0.0806341 0.00618373
+-0.0408599 0.102809 -0.0209257
+-0.0431187 0.159159 -0.0099383
+-0.0154785 0.0828416 0.0569929
+-0.0775215 0.161144 -0.0189221
+0.0358655 0.112954 0.0143927
+-0.0759551 0.131077 -0.00722143
+0.0465282 0.0726943 0.00507292
+-0.0784776 0.134439 0.0514602
+-0.0718916 0.0995338 0.0398851
+0.0174027 0.127944 0.018931
+-0.0494895 0.143125 0.00338457
+0.0333197 0.0357288 0.0133458
+0.0132595 0.0751478 -0.0304595
+-0.0324893 0.100164 0.0432113
+0.0343769 0.112004 0.0266888
+-0.0108703 0.180136 -0.0264173
+-0.0872312 0.1132 0.0437313
+0.0353616 0.106017 0.0302164
+-0.0282335 0.0382933 0.0310718
+-0.0646654 0.132541 0.0415985
+-0.0416682 0.0336125 -0.0201879
+-0.0690362 0.134069 0.0476421
+0.023852 0.057789 0.0449027
+0.0440963 0.0735854 0.0249308
+-0.0624573 0.163073 -0.0525854
+-0.0341025 0.169759 -0.00204136
+0.0589446 0.0649523 0.0051412
+-0.0602752 0.0336649 0.0124615
+-0.0628859 0.1495 -0.0200671
+-0.0722644 0.0671374 -0.000515551
+0.0135851 0.0658847 0.0529797
+-0.00198691 0.0368792 0.0142478
+0.0367682 0.0700097 -0.0138015
+-0.0296169 0.0408892 -0.0298249
+-0.0376612 0.0606745 -0.0122764
+0.00800811 0.0345328 -0.00370443
+0.0105539 0.104067 -0.0202515
+-0.0488192 0.0586801 0.0351334
+-0.0557857 0.0840569 -0.0214422
+0.0308153 0.0525508 -0.0137522
+0.0423969 0.0451283 0.0286278
+-0.0332147 0.036763 0.0499127
+-0.0736682 0.0730938 -0.00832442
+-0.0175484 0.124749 0.0265509
+-0.063425 0.163107 -0.0254606
+-0.0727351 0.0832969 0.03983
+0.0319929 0.088146 -0.0193446
+-0.0444371 0.122416 -0.011439
+-0.0858505 0.116285 0.047652
+-0.00444148 0.0916785 -0.0352643
+0.022957 0.0981907 0.0456622
+-0.053144 0.0595659 0.0253997
+-0.0788525 0.107465 0.0324362
+-0.0457478 0.130844 0.0207105
+-0.0684896 0.172346 -0.0400602
+-0.034733 0.0498868 -0.0123113
+0.0415062 0.0499285 0.0325086
+-0.0665679 0.0404538 -0.00528616
+-0.00650346 0.112991 -0.0197156
+-0.0448474 0.0999398 -0.0215303
+-0.0816586 0.137613 -0.00180043
+-0.0585618 0.124728 -0.00774237
+-0.0466281 0.0592297 -0.0120314
+-0.0670784 0.0653289 0.0275882
+-0.0835882 0.125784 0.0507488
+-0.0164643 0.0842755 0.0572298
+-0.0904705 0.135055 0.0132171
+-0.022546 0.116788 0.03495
+-0.0334891 0.091814 0.044517
+-0.0719917 0.151909 0.0358108
+-0.0151953 0.168341 -0.0151527
+-0.0590718 0.156479 0.0080978
+-0.0154402 0.120098 -0.0111735
+-0.036496 0.17271 -0.000384966
+0.0392898 0.0993144 0.028831
+0.024983 0.0795787 0.048494
+0.0483695 0.0734096 0.0143189
+0.0196959 0.0394038 0.04222
+-0.00886334 0.103392 -0.0235214
+-0.0118005 0.0841384 -0.0387163
+0.0252205 0.0888413 -0.0232794
+0.0298168 0.052105 0.0376191
+-0.0776927 0.169444 -0.0419634
+-0.0314915 0.057461 0.0373842
+-0.0504539 0.0558071 0.0326022
+0.0138422 0.0901622 -0.0294996
+-0.0510104 0.149266 0.0138316
+-0.0341485 0.0337694 0.0159272
+-0.085608 0.144617 0.0380805
+-0.0475132 0.0875996 0.0450977
+-0.091127 0.143391 0.0261688
+-0.0781968 0.0778917 0.0320122
+0.0284509 0.104793 -0.0149826
+-0.0223025 0.0957816 -0.0275832
+-0.0179573 0.123303 -0.00653742
+0.0369901 0.111103 0.00416682
+-0.0643667 0.159406 -0.0155654
+-0.0701684 0.165994 -0.0191552
+-0.0863906 0.0819518 0.00951177
+-0.0224965 0.100254 0.0443771
+-0.0757302 0.147214 -0.00986768
+0.0357939 0.0699287 -0.0148404
+-0.0376499 0.0577418 -0.0112619
+0.019292 0.0988007 -0.0225555
+-0.00992376 0.097544 0.0521376
+-0.0493712 0.0572598 0.0342952
+0.0255474 0.054922 0.0420386
+-0.0494259 0.144129 0.00171058
+-0.0624989 0.104282 0.0409609
+-0.0430319 0.0336432 -0.0167728
+0.0179185 0.121996 -0.0074786
+-0.0190623 0.127503 0.00554509
+-0.0474205 0.145822 -0.000777163
+0.0526083 0.0475984 0.0212218
+0.00022388 0.0797271 -0.0356555
+-0.0301525 0.168207 -0.0169318
+-0.00151732 0.0576213 0.0542293
+-0.00248496 0.0548872 0.0545581
+-0.0502022 0.12654 -0.00566411
+-0.0529063 0.0676787 0.0373317
+0.00249985 0.107203 0.0424791
+0.0029144 0.125773 -0.00745627
+0.00334453 0.0496343 -0.0297987
+0.00449641 0.11692 0.039168
+0.0399282 0.041091 0.0244564
+0.0178192 0.126124 0.0248053
+-0.0799402 0.132433 -0.00455304
+-0.0649027 0.179945 -0.0575726
+0.0404255 0.0914089 -0.00978781
+-0.065797 0.132562 0.0435297
+-0.0372368 0.172627 -0.0118528
+-0.0554974 0.10569 0.0407246
+-0.076892 0.165957 -0.0247772
+-0.0587093 0.0344925 0.0418625
+0.00823978 0.0768076 -0.0338586
+-0.0626545 0.150596 -0.0225786
+-0.0384668 0.0931237 0.0434147
+0.0141618 0.0576523 0.0502255
+-0.0683767 0.176522 -0.0580176
+-0.0129882 0.119781 -0.0128781
+0.00848559 0.0950467 0.0516302
+-0.0429797 0.127137 -0.00436425
+-0.0497252 0.141657 0.00538484
+-0.0179056 0.127636 0.0191062
+-0.0520277 0.0563658 0.0215194
+-0.02384 0.0968692 -0.0247025
+-0.0561697 0.0684762 0.0377129
+0.0120601 0.0343849 -0.00838478
+0.0299331 0.0362092 0.00288494
+-0.0763652 0.1528 -0.0108857
+-0.0736067 0.154075 -0.0289008
+0.00533532 0.0538992 -0.0301758
+-0.0599208 0.0394628 0.0453423
+-0.0184879 0.0856371 0.0571362
+-0.0208094 0.0376226 -0.0178912
+-0.0137231 0.183161 -0.0241068
+-0.0648137 0.0346657 0.0352478
+-0.0271872 0.0379033 0.0118238
+0.0264669 0.0477487 0.0380114
+-0.0723733 0.0352474 0.00704331
+-0.0322701 0.0835031 -0.0295487
+0.0272688 0.122366 0.00977001
+-0.0603093 0.0652594 0.0325934
+-0.00180254 0.0385071 0.00372255
+-0.0522762 0.123638 -0.00859751
+-0.0776201 0.171284 -0.03689
+-0.0802965 0.0872747 0.0345612
+-0.0889001 0.136394 0.00820864
+0.000412609 0.0393166 0.0342543
+-0.0642567 0.0344972 0.033776
+-0.0921303 0.11612 0.0363104
+-0.0679654 0.134068 -0.0084026
+-0.0839818 0.115583 0.0478751
+-0.00536465 0.129031 -0.000823415
+0.00514522 0.103044 -0.0216473
+-0.0496209 0.0517545 -0.00857532
+-0.0757023 0.177226 -0.0456228
+-0.0298766 0.05514 -0.0203901
+-0.0861039 0.0846923 0.0224682
+-0.0238144 0.0879301 0.05313
+-0.0611505 0.153585 0.0321143
+-0.0917527 0.113836 0.0170127
+-0.0374964 0.0591338 0.0402834
+-0.0187977 0.0799028 -0.0389405
+-0.0680553 0.17056 -0.0341587
+-0.0658521 0.0361993 0.0388506
+0.0111435 0.100252 -0.0225401
+-0.0425873 0.125894 -0.0070983
+-0.0265027 0.0498541 0.0461184
+0.00111147 0.110147 -0.0201294
+-0.00249391 0.119678 0.0379989
+-0.0117585 0.0742488 -0.0381827
+-0.0586841 0.0466878 -0.00234651
+0.0295244 0.0750328 -0.0218147
+-0.0218606 0.101624 -0.0238704
+0.0287102 0.0942447 0.0434182
+-0.0709345 0.0627948 0.0166551
+-0.0225064 0.10717 0.041634
+-0.0335027 0.074683 0.04142
+-0.092242 0.128315 0.0292604
+-0.0374976 0.0888821 0.0433743
+0.0303768 0.0578247 0.0402716
+-0.00891857 0.0338467 -0.0251248
+-0.0533378 0.162724 0.0010506
+-0.0869041 0.141929 0.0394374
+-0.047972 0.135544 0.0173874
+0.0485157 0.0597129 0.0310438
+-0.00667005 0.0904165 -0.0359686
+-0.0759966 0.0994807 0.0369297
+-0.0625222 0.149113 -0.00558111
+-0.0718118 0.14996 0.0389054
+-0.0844416 0.147376 0.00515339
+-0.0165344 0.0392124 0.0380479
+-0.079893 0.0949635 -0.0095262
+0.0236407 0.0347514 0.0177381
+-0.0196654 0.0683158 0.0524244
+0.0245994 0.0981921 0.0445203
+-0.0849795 0.0952966 -0.00257745
+-0.0528207 0.121242 0.0358805
+-0.0236049 0.0394052 -0.0289635
+-0.0332166 0.165305 -0.0043102
+-0.0251865 0.160795 -0.0139572
+-0.0865509 0.152927 0.0144746
+-0.0693964 0.157876 -0.00437702
+-0.0628145 0.169399 -0.0485883
+-0.0643644 0.153473 -0.0380226
+-0.081904 0.115723 0.0482136
+0.0101277 0.0911581 -0.0305812
+-0.0405043 0.0944618 0.0422679
+0.021919 0.118008 0.0336347
+-0.0203338 0.123782 -0.00500918
+0.0111252 0.108699 -0.019265
+-0.0574976 0.0776487 0.0433498
+-0.0354848 0.0987251 0.0428224
+-0.0651932 0.141087 0.0409428
+-0.0240513 0.0386342 -0.0120079
+0.039324 0.106993 0.0191699
+-0.0754947 0.142836 0.0460912
+-0.0122699 0.0338184 -0.0220638
+-0.0246982 0.0551057 0.0409028
+-0.0578691 0.105465 -0.0183362
+-0.0264983 0.10435 0.041876
+-0.07915 0.166638 -0.0349654
+-0.0578202 0.140285 -0.0045343
+0.0220783 0.0686046 0.0476717
+-0.0770892 0.107143 -0.00760422
+-0.0902136 0.13513 0.0232187
+-0.0723372 0.156305 0.0208189
+-0.0650055 0.135525 -0.0079735
+-0.0549293 0.154823 0.0139773
+0.0292317 0.0773621 -0.0219141
+-0.0817276 0.0964548 -0.00656413
+-0.018203 0.175668 -0.0239316
+-0.0553377 0.0457536 -0.00639551
+-0.0161975 0.0432999 0.0517769
+0.0304284 0.0383851 -0.001443
+-0.0345483 0.152531 -0.00560476
+-0.0629676 0.160574 -0.0208244
+-0.0935783 0.124186 0.0262856
+-0.0311645 0.0580869 -0.017406
+-0.0317989 0.0382037 0.00155838
+0.0576172 0.0686777 0.0217698
+-0.00505811 0.0339518 -0.0207718
+-0.0696447 0.166615 -0.0510113
+-0.0629867 0.155807 0.0241223
+-0.0340215 0.0794269 -0.0255119
+-0.0867747 0.0981404 0.0024092
+-0.0880604 0.13085 0.0022566
+0.0184887 0.0948214 0.0475148
+-0.021497 0.0988475 0.0444941
+-0.0416678 0.0592681 -0.0121392
+-0.0567258 0.0480405 0.0316684
+-0.0423133 0.129133 0.00872164
+-0.000508444 0.105851 0.0435843
+-0.0592465 0.046889 0.0316721
+0.0461219 0.0806353 0.0161697
+-0.0281528 0.0348412 0.0481365
+-0.0702797 0.180333 -0.0522624
+-0.0478122 0.134031 0.00640478
+-0.0077489 0.0713239 -0.0366154
+-0.0122439 0.168894 -0.023749
+0.0212552 0.0777078 -0.0266851
+-0.0917522 0.132325 0.0122241
+-0.0361034 0.165201 -0.01444
+-0.052501 0.0805516 0.0443114
+-0.0654153 0.0336345 0.00606909
+-0.0623235 0.139333 -0.00679766
+-0.0616576 0.170967 -0.0555865
+0.00174509 0.0392548 -0.00741822
+-0.0260001 0.0677977 0.0418131
+-0.0684331 0.0336931 0.00540027
+-0.0448348 0.0942101 -0.0220316
+-0.0731091 0.158237 -0.0329184
+0.0078778 0.0989406 -0.0227671
+0.0314417 0.115539 0.0270138
+-0.00906667 0.129748 0.004892
+0.00649868 0.108551 0.0413323
+-0.0382124 0.150071 -0.00262103
+0.0332799 0.0564373 0.0374441
+-0.00349826 0.0647878 0.0565544
+-0.0487816 0.084091 -0.021606
+-0.0568391 0.118972 -0.0116757
+-0.0644875 0.156696 -0.0456027
+-0.0411616 0.152146 0.00524032
+-0.0636742 0.142603 -0.0078783
+-0.0711318 0.0777267 0.0384114
+0.00321355 0.0796602 -0.0346071
+0.00447281 0.110003 0.0420134
+-0.0174998 0.0772311 0.0559767
+-0.0263139 0.182659 -0.010558
+-0.0322455 0.15809 0.00238998
+0.045843 0.0760483 0.0203743
+-0.0548028 0.0464121 0.0246755
+-0.0376206 0.0376543 -0.029358
+-0.0523414 0.0402098 0.0465679
+-0.0432186 0.121963 0.0262727
+-0.0321664 0.125608 0.018357
+-0.0857232 0.0792432 0.0155047
+-0.0782439 0.151233 0.0351897
+-0.0187146 0.058392 -0.0343021
+0.0452185 0.0847535 0.00320441
+-0.0640415 0.167322 -0.0369994
+-0.0823499 0.132665 0.0507367
+-0.0301219 0.0493909 -0.0214267
+-0.0843946 0.0818335 0.0225112
+-0.0246526 0.0386383 0.0332956
+0.0563147 0.0580894 0.0250386
+0.00021169 0.0389894 0.029096
+-0.00241379 0.126666 -0.00637642
+-0.0301429 0.0551656 -0.0193914
+0.0331811 0.0417541 0.0279348
+-0.0861938 0.104994 0.0213645
+-0.0824118 0.0788951 -0.000494108
+-0.0743937 0.157452 -0.00470821
+0.0187225 0.127515 0.0179893
+-0.0829047 0.0763015 0.0175246
+-0.0650238 0.0641454 0.0272956
+0.0355567 0.0878311 -0.0169845
+-0.0887171 0.117597 0.0462102
+-0.0760085 0.141318 -0.005968
+-0.0127703 0.0756733 -0.0384193
+-0.0158456 0.122449 -0.00760827
+-0.0842393 0.107513 0.00238784
+-0.0674898 0.0986608 0.0416951
+-0.0554949 0.0427291 0.0458455
+-0.0201912 0.0383436 0.00560257
+-0.0372682 0.0344921 0.0377782
+-0.0357437 0.0380351 0.0467216
+-0.0450103 0.054631 0.0385549
+-0.0369768 0.047531 -0.0185543
+0.0520769 0.0581909 0.0294992
+-0.0329038 0.153455 -0.00604291
+-0.0725184 0.128806 0.0519752
+-0.0270556 0.0706113 0.0413767
+-0.0285061 0.116641 0.0323888
+-0.0144886 0.109993 0.0419529
+-0.0285168 0.0803552 -0.0356291
+0.00952067 0.0702149 0.0551678
+-0.0355616 0.151785 -0.00432824
+-0.0826529 0.0796856 0.0277856
+-0.0365963 0.127614 0.0137714
+-0.0657008 0.139678 0.041893
+-0.0758694 0.0777615 0.0343673
+-0.00737907 0.0367231 0.0491533
+-0.0704775 0.114632 0.0510417
+-0.059558 0.128315 0.0402204
+-0.0538405 0.0941624 -0.0218364
+-0.0274601 0.124651 0.00100866
+-0.0637125 0.0705931 -0.0131267
+-0.0644549 0.043254 0.0326925
+-0.0746657 0.154121 -0.0198989
+-0.0348879 0.043516 0.0457289
+-0.0234602 0.17569 -0.0129988
+-0.0720698 0.176015 -0.0442709
+-0.043544 0.157959 0.00535766
+-0.0407405 0.0739506 -0.0180651
+-0.0696125 0.150354 -0.0430103
+0.0418343 0.0943991 0.0271656
+-0.0932461 0.129666 0.0232459
+-0.0398464 0.0957237 -0.0225845
+-0.0764914 0.171559 -0.0359139
+0.0408836 0.0614281 -0.00367417
+-0.0356978 0.0346221 -0.0180732
+-0.0895729 0.151493 0.0191084
+0.0263253 0.122966 0.0165355
+0.0113407 0.0567362 -0.0298085
+-0.0736511 0.180693 -0.0540178
+-0.042544 0.16227 0.00511409
+-0.0522198 0.0374253 0.0467614
+-0.0777691 0.0689598 0.0151422
+0.0463347 0.0428813 0.020444
+0.0509435 0.0554131 0.029582
+0.0233146 0.125046 0.00829766
+0.00834665 0.0958673 -0.0275066
+-0.00680856 0.127356 -0.00506622
+-0.0554704 0.157309 0.00940753
+-0.0754721 0.103526 0.0362863
+0.044978 0.086159 0.0221711
+-0.0716236 0.170198 -0.0283222
+-0.0196387 0.0464931 -0.0280998
+0.0569791 0.0686933 0.0226042
+-0.0233118 0.182976 -0.0180572
+0.0290367 0.060539 0.0418753
+-0.0708458 0.0980019 -0.0152545
+-0.044501 0.0562098 0.0390177
+-0.00787685 0.105931 -0.0227718
+-0.0774743 0.140015 0.0480697
+0.0275361 0.10477 0.0382193
+0.00254476 0.127971 -0.00383507
+0.0235041 0.108407 0.0388101
+-0.055098 0.146723 0.029184
+-0.0257112 0.0634738 0.0402437
+0.0222133 0.103397 0.0428172
+0.0239484 0.0901184 -0.0234122
+-0.0265532 0.080945 0.0504296
+-0.0801014 0.0881671 -0.00858727
+-0.0467634 0.0560036 0.0374321
+0.0562967 0.0661688 0.0251012
+-0.0323569 0.124066 -0.00320487
+-0.00891511 0.126415 -0.00600997
+0.0343206 0.094597 -0.0141158
+-0.0876587 0.151372 0.0112162
+-0.0723621 0.114661 0.051285
+-0.033385 0.126374 0.00317306
+-0.0465636 0.146777 -0.00183655
+-0.0086601 0.174145 -0.0268323
+0.0224333 0.0422246 0.0409441
+-0.0723219 0.171178 -0.0314543
+-0.0633454 0.159973 -0.0185957
+-0.0741825 0.156237 0.0158024
+0.0283215 0.117455 0.0287048
+-0.0518625 0.050332 0.0226347
+-0.0345112 0.112532 0.034973
+0.0102504 0.0766955 -0.0323547
+-0.0628937 0.146875 -0.0135938
+-0.0913593 0.126907 0.0414668
+-0.0755221 0.11896 0.0528247
+-0.0186351 0.0933648 0.0534492
+-0.00679579 0.0826768 -0.0377354
+0.00822704 0.0782053 -0.033734
+-0.0942744 0.126919 0.0202522
+-0.0462848 0.131856 0.0204922
+-0.05065 0.0706021 0.0388719
+-0.00522459 0.0384215 0.0122026
+-0.0524927 0.0987339 0.0429361
+-0.0388306 0.112851 -0.0174267
+-0.0268641 0.101582 -0.02361
+-0.0846396 0.153647 0.0136585
+0.0166715 0.0353808 -0.0156588
+-0.0553627 0.139574 0.0304759
+-0.0257886 0.0768981 -0.036857
+-0.0402218 0.0342366 0.0285657
+-0.045101 0.156152 -0.00816042
+-0.0348248 0.0473223 0.0413292
+0.0145592 0.0672414 0.0526521
+-0.0436275 0.0548777 -0.0111987
+-0.0248971 0.163359 -0.0156802
+-0.0449755 0.115277 -0.0159431
+-0.0492995 0.0345621 0.0403913
+-0.0257365 0.0348667 0.0503471
+-0.0754593 0.159053 -0.00907047
+-0.0632614 0.0601538 0.00426714
+-0.0265686 0.0382637 0.0296453
+-0.0355718 0.165308 -0.0024565
+-0.0727498 0.180616 -0.0549771
+-0.0381364 0.171203 -0.0118442
+0.0153228 0.0362397 0.00366285
+-0.0383106 0.0336688 0.00433881
+-0.0125102 0.0897843 0.0566766
+-0.0484982 0.0890084 0.0450201
+-0.0889791 0.0915153 0.00944503
+-0.0511466 0.124736 -0.0077758
+-0.00758688 0.0376797 -0.0254717
+-0.0509981 0.147813 0.0138388
+-0.0147745 0.0382944 0.014
+-0.0305049 0.0617476 0.0379767
+-0.0109155 0.0356188 0.0494667
+-0.0703667 0.142544 -0.0104932
+-0.0424925 0.0902452 0.0426486
+0.0099296 0.113714 0.0390911
+0.0145599 0.088488 -0.0297413
+-0.00249512 0.122376 0.0359373
+-0.0216559 0.0972103 0.0449705
+-0.0717874 0.0850294 -0.0163139
+0.0281202 0.0348895 0.0148787
+-0.0582075 0.154657 0.0258383
+0.0103893 0.0434318 -0.0247637
+0.0283214 0.115107 0.0315696
+-0.0408808 0.115001 -0.0156637
+-0.0569818 0.0548922 0.00263009
+-0.0347008 0.0666358 -0.0153327
+-0.0518449 0.146252 0.0164181
+-0.0388328 0.0943088 -0.0230504
+-0.0315145 0.0788556 0.0411289
+0.0268942 0.0988154 -0.0185978
+-0.0875561 0.0968363 0.00343541
+0.0426825 0.0805137 0.0283126
+-0.0683872 0.0690317 0.0328821
+-0.0609319 0.0343399 0.0363539
+-0.0258016 0.0867079 -0.0364604
+-0.0891389 0.120288 0.0465529
+-0.062692 0.155999 0.0140721
+0.0223974 0.0473356 -0.0199928
+-0.0616833 0.0676348 -0.0109359
+-0.0752375 0.0864841 -0.0145142
+0.014283 0.0681091 -0.0306905
+-0.0603219 0.0470192 0.0356706
+-0.015495 0.104397 0.0428489
+-0.0698499 0.0994423 -0.0150141
+-0.0293842 0.08757 0.0444817
+-0.00548831 0.112771 0.0416249
+-0.0120723 0.0353434 0.0494553
+0.0118631 0.0894057 -0.0307263
+0.0362901 0.0769906 -0.0138255
+-0.0372663 0.033541 -0.0229762
+0.0110129 0.0846936 0.0546683
+-0.0563673 0.0575771 -0.00141956
+0.0162242 0.0835192 -0.0290783
+-0.0466776 0.13337 0.0173732
+0.0116668 0.0548951 0.0518589
+-0.0175019 0.0758159 0.0556202
+-0.0865692 0.133541 0.00131146
+-0.0366797 0.0636525 -0.0138021
+-0.074087 0.0734714 0.0331119
+-0.0762512 0.156264 -0.00677505
+-0.0414995 0.168206 0.00296291
+0.0023065 0.128418 0.0277808
+-0.0141822 0.0378114 0.0510973
+-0.0674332 0.127053 0.0499702
+-0.0482072 0.0335431 -0.012174
+-0.072499 0.117558 0.0529308
+-0.0281279 0.03862 -0.0128123
+-0.0616129 0.149191 -0.00221638
+0.0436181 0.0416961 0.0210317
+-0.0758657 0.097813 -0.01246
+-0.0818672 0.120683 -0.00433302
+0.00940058 0.0342529 -0.0182643
+-0.018805 0.0625267 0.0503254
+-0.053876 0.126919 0.0361236
+-0.0884983 0.0941957 0.00744581
+-0.0165005 0.120964 0.0336371
+0.0433486 0.0519969 -0.00665823
+-0.0624811 0.149792 0.0367836
+-0.0615025 0.16984 -0.0615386
+-0.0364388 0.0352264 0.0443258
+0.0340769 0.0556934 -0.0107486
+-0.00261634 0.0450445 -0.0274328
+-0.0328486 0.0986298 -0.0228073
+0.0198481 0.0795335 0.0516115
+-0.0599778 0.148254 0.0362061
+-0.00849422 0.0674811 0.0555845
+-0.0530196 0.144246 -0.000696127
+-0.0836424 0.0924862 -0.00555232
+-0.0691184 0.165207 -0.0519806
+-0.0305063 0.111166 0.0367005
+-0.0447319 0.125394 0.0226968
+-0.0165708 0.056922 0.0510974
+-0.0568794 0.0548721 0.000601057
+-0.0355126 0.10012 0.0421792
+-0.00149054 0.131258 0.0163007
+-0.0814469 0.0761204 0.000521161
+-0.0700369 0.0765697 0.0383694
+-0.0791449 0.166643 -0.0339646
+0.0151117 0.0434234 0.0444141
+-0.0568399 0.0344097 0.0371692
+-0.0180623 0.177182 -0.017491
+0.0492456 0.0728121 0.0176064
+-0.0178752 0.105871 -0.0225888
+0.00334696 0.0342028 0.0159318
+0.0153617 0.0344714 0.021761
+-0.0945397 0.121475 0.0202819
+-0.073516 0.18065 -0.0535934
+-0.0934071 0.117385 0.0163015
+-0.0631359 0.0699525 0.0366992
+-0.0252161 0.0550594 0.0400126
+-0.00605897 0.125119 0.0321155
+-0.0360017 0.17408 -0.0118959
+-0.00638198 0.124385 -0.00985914
+-0.0145975 0.0378025 -0.0168233
+0.00417447 0.127894 0.028461
+-0.0410286 0.0345047 0.0334549
+0.0292997 0.0538256 -0.0177694
+0.0372061 0.0980869 0.0328651
+-0.0745356 0.104026 0.0368301
+-0.00436707 0.0386778 0.0266309
+0.0189949 0.0449386 0.0430002
+0.00529011 0.0668325 -0.0327227
+0.00166319 0.130955 0.0203219
+-0.0905947 0.115833 0.0426569
+0.00338984 0.116722 -0.0177517
+0.0203176 0.126182 0.0214303
+-0.0598293 0.139488 -0.00569497
+0.0142784 0.11622 -0.015243
+0.0231289 0.0835821 0.0493611
+0.0515475 0.0540038 0.0286923
+-0.0317664 0.058161 -0.0143983
+-0.0397537 0.0782783 -0.0191449
+0.012627 0.12184 0.0342326
+-0.0823735 0.148711 0.0361489
+-0.012301 0.110982 -0.0195491
+-0.0883046 0.122998 0.0470686
+-0.0315077 0.113893 0.0345441
+-0.0888952 0.137894 0.0271916
+-0.0610259 0.126912 0.0416133
+-0.0475344 0.05323 0.0369443
+-0.00961348 0.0434416 -0.0262361
+-0.0541404 0.124102 0.0375109
+0.0509994 0.044648 0.0132154
+0.0303038 0.118886 0.0223059
+-0.0596345 0.0336285 0.0108415
+-0.0196267 0.0450293 -0.0277098
+-0.0247099 0.0381195 0.00851258
+-0.0774982 0.133088 0.0521596
+0.0276359 0.0629152 -0.0215123
+0.0535119 0.0717543 0.00602975
+-0.0334971 0.0831472 0.0419572
+-0.0596476 0.14187 -0.00422882
+-0.0924522 0.125595 0.0392516
+-0.068714 0.143769 -0.0144235
+-0.0468988 0.126761 -0.00595632
+-0.0303571 0.0537911 -0.0173707
+-0.0709316 0.147597 -0.0300096
+-0.0514754 0.115278 0.0338114
+0.0190263 0.120653 0.0329746
+-0.0340031 0.1089 -0.0192874
+-0.0335001 0.116617 0.0321346
+-0.0671562 0.0724925 0.0371747
+-0.0746759 0.152711 -0.0238933
+-0.0590669 0.120714 -0.00943474
+0.00548706 0.108567 0.0416722
+-0.0114996 0.101652 0.0440245
+-0.0649779 0.141437 -0.00794337
+0.0112608 0.130411 0.00668952
+0.0436616 0.0987354 0.0121603
+-0.0558948 0.101262 -0.0199275
+-0.0309036 0.0436875 0.0502489
+0.0142962 0.0652331 -0.0300484
+0.000574283 0.0347216 0.0149023
+-0.00623443 0.0389648 -0.00688285
+-0.0810472 0.147398 0.0390836
+-0.0491606 0.0375682 0.0458781
+-0.055978 0.0534457 0.00767233
+-0.0685375 0.17487 -0.0458569
+0.0289287 0.100617 -0.0165368
+-0.0709835 0.0353942 0.00988845
+0.0337836 0.0754424 0.0400679
+0.041497 0.0527902 0.0324777
+-0.0204109 0.178661 -0.0155986
+-0.0623894 0.149097 -0.0105741
+-0.0644192 0.16051 -0.0170316
+-0.0350535 0.0346922 0.0433273
+-0.0740398 0.145796 -0.011857
+0.0214237 0.0444841 -0.0187153
+-0.0570526 0.113331 -0.0158151
+0.0134717 0.127798 0.0260714
+0.0324011 0.0446474 -0.00561054
+0.00231866 0.0568936 -0.0320023
+-0.0273763 0.112504 -0.0170987
+-0.0224223 0.072452 0.0507888
+-0.0614531 0.154118 0.0305097
+-0.0222065 0.179998 -0.0209469
+0.00315207 0.102056 -0.0221009
+0.0413778 0.0561233 -0.00592276
+0.037882 0.105959 0.026802
+-0.0607248 0.0722644 -0.016058
+0.00061382 0.126415 -0.00611002
+0.0592992 0.0566775 0.0181738
+0.0474969 0.0638142 0.0292952
+-0.0321069 0.162239 -0.0144989
+-0.0520198 0.147215 -0.00210798
+-0.0819286 0.0748755 0.0145293
+-0.0333602 0.0339348 0.0195439
+-0.0555018 0.0987713 0.0432834
+-0.0630837 0.164691 -0.0325918
+-0.0473982 0.0343754 -0.0164682
+-0.0807821 0.0980376 0.0332837
+-0.0645109 0.0370591 -0.00764757
+-0.085403 0.141865 0.00516647
+0.0420715 0.0859357 0.0292923
+0.0391529 0.107674 0.00402907
+0.024552 0.110059 0.0374287
+-0.0631521 0.0360725 0.0429133
+-0.0619885 0.156033 0.0186659
+-0.024223 0.17569 -0.0123366
+-0.0138299 0.0392302 0.0367944
+-0.0306217 0.126038 0.0115365
+-0.0714938 0.120397 0.053531
+-0.0869305 0.151358 0.010227
+-0.0788893 0.125151 -0.00625598
+-0.0447778 0.0409599 -0.0173005
+-0.09234 0.131039 0.0252374
+0.0321511 0.0724311 -0.0187615
+-0.0735819 0.0777026 -0.0122023
+-0.0678037 0.166983 -0.024036
+-0.0897153 0.135171 0.0332079
+-0.0447805 0.0840976 -0.0212945
+0.0371007 0.10968 0.00116733
+0.0112368 0.0836448 -0.0310335
+-0.036484 0.0505609 0.038833
+-0.0118972 0.116803 -0.015741
+-0.0346708 0.0621866 -0.0131726
+-0.0397664 0.0812015 -0.0202928
+-0.069532 0.172114 -0.0375728
+0.00626682 0.131047 0.00486423
+-0.0590022 0.0579904 0.014414
+-0.00972298 0.0642282 -0.0359259
+-0.0269413 0.181454 -0.0140289
+0.033222 0.0842418 -0.0188996
+0.00639168 0.0433788 -0.024537
+0.00926262 0.129557 0.000393265
+-0.00751646 0.0732149 0.0579299
+-0.0513203 0.142869 0.00077197
+-0.0288553 0.0385536 -0.0110371
+0.0555265 0.0728462 0.0170262
+-0.085954 0.146023 0.00719275
+-0.0371011 0.0461641 -0.0234326
+0.0579592 0.0537863 0.0201793
+0.0104003 0.0418913 -0.0239147
+-0.0396188 0.0505923 -0.0110041
+0.0326207 0.0944486 -0.0159568
+-0.0170933 0.0554767 0.0502631
+-0.0891859 0.139294 0.0371595
+-0.0637097 0.166224 -0.0345967
+0.00422867 0.0824562 -0.0341922
+-0.0594261 0.151258 -0.000475846
+-0.0552814 0.0464664 0.0256754
+-0.0424851 0.0776249 0.0430145
+0.0184693 0.111176 0.038468
+-0.0294978 0.0574079 0.0367222
+-0.0435452 0.0405422 0.0435069
+-0.0600989 0.0598417 0.00157193
+0.0526979 0.0525681 0.0268245
+-0.0625031 0.0602955 0.00246046
+-0.0675133 0.108346 0.0377589
+-0.00349512 0.111424 0.0424267
+-0.00549779 0.110034 0.0429298
+0.0164758 0.0713296 0.0519403
+0.0458506 0.0876137 0.00718075
+0.0244747 0.0400424 -0.00510986
+0.00547063 0.131454 0.017409
+-0.0728779 0.117943 -0.00788041
+-0.0142717 0.17714 -0.027303
+-0.0257193 0.0617764 -0.0314442
+-0.050991 0.0504175 0.03464
+0.00152343 0.0759482 0.0573355
+-0.0304944 0.064586 0.038393
+0.016253 0.0794879 0.0534651
+-0.00764651 0.0496471 -0.0308946
+-0.077844 0.0743656 -0.00558198
+-0.0326464 0.0563525 -0.0113988
+-0.061813 0.175696 -0.0586065
+-0.0681691 0.0682156 0.031879
+-0.0493845 0.0657885 0.0368321
+-0.019309 0.0362824 -0.0277788
+-0.063712 0.167032 -0.0383216
+-0.0379003 0.123041 0.0266516
+-0.000679533 0.0554388 -0.0315999
+-0.0886752 0.135106 0.0413889
+0.011146 0.128332 0.0266558
+-0.0740639 0.178692 -0.0478641
+-0.0809318 0.142082 0.0447817
+-0.00975763 0.0742329 -0.0379217
+-0.0600964 0.0334795 0.00370066
+-0.0566436 0.0657735 0.0346839
+-0.0767139 0.070678 0.0244626
+-0.0810351 0.0787684 -0.0035164
+0.0405001 0.076619 0.0321646
+-0.0283979 0.155793 -0.00852382
+-0.0535904 0.0617699 -0.00886774
+-0.0149347 0.127911 0.00262222
+-0.0197362 0.181499 -0.0230211
+-0.0781409 0.0718256 0.0231698
+-0.0337588 0.121858 0.0267132
+-0.0741051 0.0686193 0.025039
+0.0417534 0.0788713 -0.00674491
+-0.0515024 0.0340065 0.0263967
+-0.0763933 0.111249 -0.00565203
+-0.0538034 0.0898608 -0.0222645
+-0.000575856 0.0980296 -0.0278345
+0.0581094 0.0704417 0.00814168
+-0.0891434 0.137902 0.0291936
+0.00340212 0.0390598 -0.024445
+-0.0620333 0.153738 -0.0275809
+-0.0177087 0.0584461 -0.0348025
+-0.0823897 0.104663 0.0290404
+-0.0194981 0.10024 0.044034
+0.0242883 0.0705502 -0.0254969
+-0.0899225 0.133822 0.0382154
+-0.0195055 0.108574 0.0413935
+-0.0446392 0.0548635 -0.0110876
+0.00035867 0.048192 -0.0299591
+0.0364284 0.0413843 -0.00274773
+0.0187875 0.0351105 0.0327558
+-0.0568852 0.111179 -0.0170834
+0.0118445 0.0806629 0.0540991
+-0.0687285 0.155709 0.0264626
+0.00655625 0.109588 0.0412446
+0.00917706 0.113608 -0.0184169
+-0.0613933 0.155777 0.0101812
+-0.0314952 0.0903684 0.0441958
+0.0124021 0.0448701 -0.0249804
+-0.0241038 0.0865955 0.0534593
+-0.0631641 0.149054 -0.0215452
+-0.0401934 0.0365351 0.0429119
+-0.0898981 0.135185 0.0362087
+-0.0526397 0.0618282 -0.00966488
+-0.0844214 0.0777776 0.012517
+0.0222568 0.0748707 -0.0265095
+-0.0150366 0.0384845 0.00106724
+0.0180702 0.0879847 -0.0272411
+-0.0142291 0.127243 0.024765
+0.0382486 0.104643 0.0273123
+-0.0748494 0.0964384 -0.0137204
+-0.0808743 0.136754 0.0491531
+-0.0568962 0.0970004 -0.0209687
+-0.0803034 0.072641 0.00422068
+-0.0584156 0.0459799 0.0422363
+-0.0579142 0.114001 -0.0151155
+-0.0561079 0.0571065 0.0121919
+0.00037651 0.0978532 -0.0276151
+-0.0336642 0.082217 -0.0255373
+0.0457702 0.0735931 0.00320764
+-0.056498 0.07472 0.0419593
+0.00305684 0.124987 -0.00863513
+-0.0272404 0.0877435 0.0480762
+-0.040496 0.0577326 0.0402811
+-0.0202415 0.0392282 0.0390567
+-0.020926 0.0334921 -0.0253378
+-0.0690953 0.0751628 0.0379926
+-0.0520047 0.0344961 0.0416004
+-0.0141843 0.128965 0.0174774
+0.0288353 0.0368345 0.0223773
+-0.0444076 0.0394861 -0.0222996
+-0.0838483 0.119157 -0.00284212
+-0.0034971 0.0732704 0.0586485
+-0.03681 0.0886191 -0.0239226
+-0.0669297 0.105269 -0.0144963
+-0.07603 0.0941366 0.0385416
+-0.0716625 0.145448 -0.0198949
+-0.0165056 0.0382425 0.0100681
+-0.0909349 0.113307 0.0123445
+-0.0192269 0.0381483 0.0222601
+0.026296 0.0862676 0.0469202
+-0.0118259 0.0386358 0.028745
+-0.0513331 0.0334323 -0.00718543
+-0.0685946 0.0353745 -0.00558788
+-0.0370306 0.151785 -0.00571407
+-0.0891386 0.129503 0.00423129
+-0.0447856 0.0348265 0.00740272
+0.040097 0.105566 0.00218117
+0.00862183 0.120558 -0.0139068
+-0.0679053 0.171131 -0.036968
+0.0164071 0.0345184 0.0219352
+-0.0501179 0.137029 0.00241503
+0.0125996 0.0459414 0.0443461
+-0.0654928 0.0818627 0.0433416
+-0.0215596 0.0891328 -0.036783
+-0.0685096 0.147001 0.0412847
+0.0400896 0.0702922 -0.00980716
+-0.0291528 0.0378835 0.0276599
+-0.0624944 0.145991 -0.00758108
+-0.029375 0.0621337 -0.0244169
+-0.0655919 0.151202 -0.0366034
+-0.064581 0.128354 0.0453237
+-0.0626195 0.153328 0.0013944
+-0.0863817 0.148632 0.0316852
+-0.0153553 0.112218 -0.0188504
+-0.0602045 0.0441634 0.0266895
+-0.0204995 0.111306 0.0398343
+-0.0454802 0.112265 -0.0167776
+0.0212764 0.0693138 -0.0277613
+-0.0458225 0.146281 0.00549558
+-0.065521 0.0335373 -0.00466605
+-0.00710114 0.0339482 -0.0211688
+0.0551094 0.0539301 0.0250409
+-0.0781434 0.0927222 0.0364655
+0.0291436 0.0707502 -0.0218013
+-0.091117 0.143373 0.0231646
+-0.0575628 0.0576989 0.003607
+-0.0745558 0.0684435 0.0233437
+0.000679346 0.0933957 -0.0329817
+0.0136703 0.0446634 0.0441067
+0.0425933 0.0791563 0.0282081
+-0.0098481 0.112657 -0.0193422
+-0.0678577 0.102354 -0.0152646
+-0.0245236 0.0838729 0.0539551
+-0.0522319 0.125489 0.0349878
+-0.0331359 0.168192 -0.0157544
+0.0437182 0.0944809 0.000197915
+-0.0271741 0.161328 -0.0145155
+-0.0635247 0.139599 0.0380296
+-0.0105236 0.0787711 0.0579243
+0.0221704 0.109999 -0.014573
+-0.0626188 0.166275 -0.0435849
+-0.0162218 0.186444 -0.0207352
+-0.00481374 0.128076 -0.00386981
+-0.0761439 0.154623 0.0283179
+-0.00628506 0.0952929 -0.0329709
+-0.0244623 0.0348843 0.0471798
+-0.0764469 0.175411 -0.0430646
+-0.0374817 0.0903202 0.0435434
+0.0448755 0.0917539 0.00218552
+-0.0464937 0.0411703 0.0442462
+0.00738566 0.0463583 -0.0259834
+-0.0269838 0.158131 -0.000540227
+-0.0195125 0.0800523 0.0567242
+0.0535386 0.0505579 0.00123438
+-0.0704829 0.066568 0.025804
+-0.0478545 0.117892 -0.0146818
+-0.0645863 0.144373 -0.0132186
+-0.0619148 0.161553 -0.037594
+-0.0328555 0.100056 -0.0225692
+-0.0605435 0.0660534 0.0336067
+-0.00290962 0.037693 0.0115129
+-0.0101883 0.0876449 -0.0371912
+-0.0625754 0.042738 -0.00542472
+0.00650044 0.0910463 0.0545358
+-0.0756811 0.154032 -0.0169094
+-0.0034723 0.130516 0.00409153
+0.00232953 0.116694 -0.0177181
+-0.0378274 0.0929022 -0.0235348
+-0.02161 0.158057 -0.00899889
+0.0304133 0.0415863 -0.00412062
+-0.0728954 0.176495 -0.0445729
+-0.0420309 0.0335517 -0.0220625
+-0.0187514 0.0906841 0.0550582
+-0.0855548 0.125248 -0.00272359
+-0.0137086 0.0614344 -0.0364468
+-0.020723 0.0597726 -0.0340423
+-0.0708646 0.0384387 0.000437312
+0.0310181 0.112726 0.0309619
+0.0131047 0.129972 0.0173477
+-0.0216432 0.124246 -0.00349177
+-0.0626999 0.0706798 -0.0138683
+-0.0865991 0.0833319 0.0164838
+-0.0644302 0.0384213 0.0160253
+-0.0187164 0.0611476 0.0502898
+-0.0791607 0.170809 -0.0419883
+0.00181256 0.0994772 -0.0233519
+0.0199074 0.11877 -0.0100039
+-0.0361903 0.151017 -0.000604378
+-0.084275 0.0897993 -0.00457099
+-0.0554832 0.0861944 0.0449632
+-0.0623633 0.0458155 0.0336786
+0.034658 0.114539 0.0168181
+-0.0736982 0.167846 -0.0232955
+-0.0181465 0.166773 -0.0192359
+0.0113761 0.0494361 -0.0277541
+-0.0440746 0.154693 -0.007872
+0.0606816 0.0664976 0.015162
+0.044367 0.0575454 -0.00546316
+0.0134639 0.0616949 0.0510096
+0.0400149 0.0829397 -0.0117765
+0.0423451 0.0690926 -0.00378897
+-0.0691689 0.0336248 0.00172074
+0.0582234 0.0593447 0.00320204
+-0.0900566 0.133779 0.0292173
+-0.0381652 0.0336678 -0.0288809
+0.0397017 0.104178 0.024171
+-0.0755036 0.121787 0.0531411
+-0.025634 0.122393 0.025161
+0.058528 0.0565928 0.00617045
+-0.0801768 0.155046 0.0137223
+0.0277963 0.0835666 0.045536
+-0.0628566 0.145948 -0.0105775
+-0.0133824 0.0383808 0.0105781
+-0.049358 0.146268 -0.00147688
+-0.0484712 0.0517504 0.0365675
+-0.0467968 0.0869913 -0.021986
+0.0553821 0.0590684 -0.000816519
+-0.0179551 0.0921164 -0.0358084
+-0.0789524 0.0921836 -0.0106406
+0.0374058 0.0893177 -0.0145297
+-0.032345 0.0473443 -0.0245628
+0.0173629 0.0537245 -0.0278081
+-0.0616059 0.160004 -0.0295877
+-0.0123225 0.124091 -0.00743567
+-0.0401607 0.163674 -0.0120006
+-0.06497 0.154244 -0.00563561
+-0.0510279 0.0336678 0.0250302
+-0.0771941 0.0893363 -0.0125642
+0.0224953 0.109772 0.0381484
+-0.0545656 0.13815 0.0298405
+-0.00171216 0.066944 -0.0344014
+-0.00330066 0.124033 -0.00952648
+-0.0724141 0.159616 -0.0379306
+-0.0128309 0.0869146 -0.0385108
+0.0379635 0.103337 0.0286718
+0.00150556 0.0870476 0.0569313
+0.0339501 0.0683557 -0.0167775
+-0.0296157 0.053701 -0.0213818
+-0.0239053 0.0350134 -0.0198326
+0.00348633 0.110018 0.042298
+-0.00459976 0.0405792 -0.0256485
+0.0313837 0.0352278 0.00968341
+-0.0524893 0.105673 0.0402508
+-0.0334757 0.072353 -0.0224701
+-0.00165204 0.0347369 0.0450897
+-0.0251253 0.179165 -0.0186166
+0.0418909 0.0939077 0.0272858
+-0.0417165 0.069628 -0.0168617
+-0.0751265 0.0670609 0.00488552
+-0.0702901 0.063891 0.0211244
+-0.0777094 0.170825 -0.0439812
+-0.0735195 0.135848 0.0500526
+-0.0690768 0.0739443 0.0372765
+0.0123912 0.116671 -0.0157278
+-0.0504991 0.105636 0.0396146
+0.0194996 0.0489742 0.0420155
+-0.0652338 0.145869 -0.0189253
+0.0183651 0.124757 -0.00246117
+-0.067493 0.105571 0.0389191
+0.00451331 0.0814276 0.0565046
+-0.0126391 0.0466477 -0.0295757
+-0.043534 0.0422491 -0.0203181
+-0.0576807 0.133928 0.0359191
+-0.0847679 0.10454 0.0257763
+-0.0763966 0.0748983 0.0314167
+-0.0163248 0.0390132 0.0346782
+0.0455396 0.083395 0.0201668
+-0.0404951 0.0747761 0.0426102
+0.0326457 0.113685 0.0274718
+-0.0533008 0.118582 -0.0133417
+-0.0548347 0.0518559 -0.00436961
+-0.0444358 0.0344955 0.0309851
+0.0022525 0.0986072 0.0504164
+0.0280941 0.107442 0.0372758
+0.0311382 0.100809 0.0381724
+-0.0608693 0.0982413 -0.018491
+-0.0808258 0.116274 -0.00349703
+-0.00493749 0.124022 0.0339675
+-0.0202041 0.0383371 0.000156328
+0.000176932 0.0881362 -0.0348875
+-0.0122454 0.128019 0.000407111
+-0.0750529 0.0860661 0.0392001
+-0.0200226 0.0403705 0.0532551
+-0.0196618 0.127752 0.0140421
+-0.0544977 0.0747139 0.0418232
+-0.0850765 0.107567 0.00438106
+-0.0759578 0.071995 0.0287387
+-0.0434567 0.155083 0.00724724
+-0.090134 0.132434 0.0362229
+0.022282 0.0706591 -0.0268891
+-0.090924 0.128274 0.0409748
+-0.0889908 0.13778 0.0388031
+-0.0788715 0.122217 -0.0060966
+-0.00443014 0.100204 0.0479984
+0.0327247 0.0646521 0.0402099
+-0.066223 0.15556 -0.0520809
+0.0118954 0.0685639 0.0540604
+-0.0805181 0.12599 0.0525745
+0.0465562 0.0753029 0.0092212
+-0.0743025 0.151276 -0.0308835
+-0.0905476 0.146077 0.0141502
+-0.0715441 0.112225 0.0480665
+-0.0679786 0.137002 -0.008171
+-0.0672001 0.044789 0.00569382
+-0.0714328 0.168025 -0.0480185
+-0.0584837 0.088969 0.0446761
+-0.0444852 0.0411138 0.0436529
+0.0142229 0.0821798 -0.0300828
+0.0137354 0.10206 -0.0220537
+-0.0532836 0.0335112 0.0086601
+-0.046743 0.0767653 -0.0182293
+-0.0653246 0.173014 -0.0475844
+-0.0105123 0.0633015 0.0555068
+-0.0652467 0.122825 0.0496059
+-0.0587837 0.0940397 -0.0203993
+-0.061496 0.107016 0.0394252
+0.032159 0.0404592 0.0270704
+-0.0550412 0.129739 0.0362139
+0.0187645 0.036357 0.00611202
+-0.051625 0.0474378 0.0157122
+-0.0945263 0.121474 0.0192827
+-0.0874631 0.104981 0.0103802
+-0.0444225 0.0587761 0.0392912
+0.00550135 0.107149 0.041587
+-0.0023107 0.0375379 0.0154093
+0.0365396 0.111887 0.0174946
+-0.0667677 0.0809002 -0.0178421
+0.0212994 0.0550028 0.0464604
+-0.00474995 0.0391641 0.0333259
+0.0385436 0.103322 0.0277283
+-0.0350927 0.168167 -0.014918
+-0.0381943 0.124735 0.0235454
+-0.0436117 0.125739 0.0201433
+-0.0122465 0.124398 0.0313659
+-0.018196 0.038272 0.00607299
+-0.0454731 0.0675709 0.040115
+0.0397094 0.0887389 0.0329441
+-0.0612601 0.0653881 0.0322823
+0.0358388 0.063303 0.0376893
+-0.0894207 0.0969969 0.0174102
+0.0247051 0.054807 -0.022754
+-0.0362363 0.0345287 0.0379647
+-0.0134852 0.104433 0.0435318
+-0.0390753 0.0353444 0.00990175
+-0.032893 0.0386199 -0.0119052
+-0.066881 0.172737 -0.0437921
+-0.0844296 0.0777425 0.00651672
+0.0102401 0.13009 0.0220074
+-0.0184847 0.091067 0.0550019
+-0.048793 0.155022 0.0100543
+-0.042488 0.1112 0.0368617
+-0.00484603 0.0989761 -0.0268273
+-0.0667655 0.079447 -0.0174677
+-0.0520123 0.033434 -0.00549431
+-0.0309502 0.0376665 0.0292806
+0.0125353 0.118934 -0.0141702
+0.0393762 0.0393721 0.0023232
+-0.0154839 0.0388074 -0.00858919
+-0.027433 0.108265 -0.0206521
+-0.0335566 0.11282 -0.0174155
+-0.0428158 0.126503 0.0190139
+0.0359007 0.0374161 0.00496434
+0.030827 0.118499 0.003976
+0.0482689 0.0616107 -0.00376704
+0.0172995 0.0637271 -0.0287659
+0.0352999 0.0727523 0.0387329
+0.0325099 0.0439072 0.0294151
+0.0434928 0.0597185 0.030951
+-0.0849411 0.14333 0.0402714
+-0.0419573 0.15213 0.00584722
+-0.0478585 0.101383 -0.0215741
+0.0158763 0.121559 0.0327664
+0.0196134 0.0505877 0.0439573
+-0.0408143 0.0899706 -0.0230035
+0.0179499 0.0360095 0.0408071
+-0.0491945 0.137084 0.0184007
+0.0422067 0.0898824 0.0277847
+-0.0568073 0.122 -0.00880521
+-0.0535468 0.0500774 -0.00609453
+-0.0791017 0.171279 -0.0410322
+-0.0812381 0.0774347 -0.00249764
+0.00451011 0.08973 0.0555486
+0.0360129 0.0947297 -0.0122566
+-0.0267986 0.0839175 -0.0367186
+-0.0336466 0.125738 0.0192922
+-0.0645061 0.0384674 -0.00726163
+-0.069197 0.145134 -0.0204031
+-0.0453102 0.150665 0.00801555
+-0.016121 0.0347931 0.0455365
+0.0372267 0.0827114 -0.0157704
+-0.0586519 0.047167 0.0396282
+-0.0723413 0.0352299 0.00501169
+-0.00850771 0.0457646 0.047699
+-0.0361402 0.0481769 -0.0171107
+-0.0694918 0.0986232 0.041191
+-0.0145821 0.0365575 -0.0175497
+-0.0152331 0.178626 -0.0269991
+-0.0375015 0.0761535 0.0421853
+0.0230994 0.0700125 0.0474321
+-0.0769031 0.149462 0.0386995
+-0.0160344 0.0394989 0.0396851
+-0.077278 0.155614 0.0132673
+-0.0461472 0.0695191 0.0407559
+0.013766 0.105146 -0.0193832
+-0.00180961 0.102694 -0.0227875
+-0.0404787 0.102851 0.0403978
+-0.0256602 0.0491814 -0.0262646
+-0.0640267 0.155773 0.0106957
+-0.0188798 0.0381919 0.018679
+0.0251044 0.111527 -0.0122017
+-0.00771141 0.130468 0.0154714
+-0.0143198 0.128437 0.0203415
+0.000556364 0.0427979 0.0462128
+-0.0107039 0.129221 0.0216334
+-0.0755898 0.0796389 -0.010614
+-0.0618567 0.156837 -0.0325918
+-0.0516893 0.0678068 -0.0129959
+-0.0631142 0.178334 -0.0583576
+-0.0386855 0.0651385 -0.0142461
+-0.0594798 0.0790546 0.0431577
+-0.029726 0.121561 0.0251755
+-0.0328596 0.153633 -0.000344229
+0.0339626 0.0356317 0.0117064
+-0.0718527 0.158151 -0.00382487
+-0.0194857 0.0486564 0.0485018
+0.0319575 0.0889685 0.042819
+0.00933955 0.0624337 -0.0310444
+-0.0172265 0.113695 -0.0184196
+-0.0866231 0.0846922 0.0194779
+-0.0663134 0.0608279 0.00678018
+-0.0718125 0.0922256 -0.0157107
+0.0550352 0.064867 0.0267865
+-0.0446824 0.0651214 -0.0145177
+-0.066499 0.0958724 0.0422345
+-0.0484771 0.135525 0.0064169
+0.0419641 0.0872658 0.0291034
+-0.0144336 0.120974 -0.0101151
+0.00537913 0.115468 -0.0184153
+-0.0169313 0.0940904 -0.0338108
+-0.0311219 0.087675 -0.0275557
+-0.0733475 0.129801 0.0519745
+-0.0628563 0.0432731 0.0396846
+-0.0181419 0.159077 -0.00932452
+-0.0244219 0.0752703 0.0498831
+0.0278638 0.0367181 0.000104301
+0.0464062 0.0525822 0.0317783
+-0.0352134 0.127051 0.0157486
+-0.037493 0.0605801 0.0408152
+0.0435542 0.0709351 0.0259153
+-0.061811 0.0896079 -0.0190442
+-0.0487502 0.167013 -0.00197199
+-0.011981 0.180127 -0.0244833
+-0.0273118 0.0346998 0.0432305
+0.0260624 0.113339 -0.0101501
+0.00139388 0.0977439 -0.0275242
+0.0217437 0.0348491 0.000619009
+-0.0598385 0.0385019 0.0199857
+-0.0742583 0.12978 0.0523998
+0.0125017 0.103142 0.0463418
+0.0222613 0.0768462 0.049813
+0.0226846 0.125635 0.0109073
+-0.0664848 0.153437 0.0331838
+-0.0635064 0.100118 0.0422551
+-0.0884181 0.136485 0.0410708
+-0.0821317 0.151156 0.0323844
+-0.035019 0.035354 0.0462574
+-0.0445836 0.049099 -0.0105442
+-0.0913513 0.126793 0.00727091
+-0.00465552 0.0526099 -0.031899
+-0.0536395 0.0361733 0.0466553
+-0.0624928 0.0775409 0.0419345
+-0.0454844 0.1652 0.00481603
+-0.0176555 0.10171 -0.0237622
+-0.0517386 0.139928 0.000994108
+-0.0894422 0.0969694 0.0114146
+0.0282036 0.106111 0.0374341
+-0.0930784 0.128223 0.0132485
+-0.0710378 0.113905 0.0504272
+-0.0589666 0.06768 0.0360494
+0.0249541 0.12014 0.0288767
+-0.0467094 0.0345808 0.0339444
+-0.0627411 0.0766785 -0.0179436
+-0.00548466 0.051944 0.0528973
+-0.0355056 0.0705073 0.0417804
+0.00377856 0.127353 -0.00517835
+-0.0595895 0.0659394 0.0339087
+-0.0639025 0.0344657 0.0356117
+-0.0549717 0.132532 0.0345672
+-0.0762259 0.0790445 0.0349679
+-0.0259103 0.0721759 0.0444214
+0.0315716 0.117859 0.00423829
+-0.0696582 0.0642657 0.000568637
+-0.0882731 0.143189 0.0351319
+-0.031681 0.0679763 -0.0234472
+-0.0699144 0.1253 -0.00883057
+0.0435982 0.0888699 0.0251665
+-0.0914617 0.144737 0.0211556
+-0.0205009 0.126788 0.0181341
+0.0311284 0.103423 0.0364018
+-0.0196184 0.043638 -0.0281382
+-0.0192518 0.185941 -0.0210687
+0.0556563 0.0725898 0.00964459
+-0.0899954 0.135014 0.00922069
+-0.0658394 0.170333 -0.0405107
+-0.0487066 0.064243 0.0362896
+0.0115006 0.100446 0.0479384
+-0.0479295 0.132887 0.00374503
+0.0216229 0.0700379 0.048827
+0.0151599 0.050478 0.0463014
+0.00510611 0.0386758 0.0457599
+-0.0284578 0.0789297 -0.0355663
+-0.081069 0.152209 0.0312004
+-0.0814521 0.13302 0.0511119
+-0.0115065 0.0517326 0.051159
+0.0190773 0.108184 -0.0165978
+-0.0879813 0.0860844 0.0054873
+-0.0565924 0.0442297 -0.00693458
+-0.0358918 0.166781 -0.00116722
+0.0263229 0.122689 0.0193841
+-0.0305096 0.0608404 -0.0204127
+-0.0790435 0.0718734 0.00353541
+-0.0264818 0.101588 0.0434387
+0.0224815 0.0892515 0.0484736
+-0.07435 0.0711851 0.0297739
+-0.0366402 0.0563002 -0.0110085
+-0.0858069 0.133905 0.0470456
+-0.0347686 0.16678 -0.00304399
+-0.0318926 0.0385829 -0.0116716
+0.0173027 0.0680054 -0.0293377
+-0.084368 0.114299 0.000284663
+-0.0761089 0.149998 -0.0108814
+0.0437289 0.0987183 0.00617361
+0.0134057 0.0374127 -0.0219366
+0.000807934 0.124791 -0.00838237
+-0.0406768 0.0621783 -0.0128097
+-0.0926608 0.121474 0.0282925
+-0.0595443 0.155728 0.018094
+-0.0646509 0.168222 -0.0372156
+-0.0197896 0.127727 0.0110836
+0.0112619 0.069597 -0.0315203
+-0.0784667 0.141403 0.0468168
+-0.0881381 0.0996585 0.0223676
+-0.0495985 0.048927 -0.00879829
+-0.0567267 0.15478 0.0220083
+-0.0273659 0.119585 -0.010507
+0.0191093 0.0375318 0.0414884
+-0.054786 0.147744 0.027387
+0.0185111 0.114004 0.0370685
+-0.0106027 0.171925 -0.0271985
+-0.0795217 0.0748572 0.0255446
+0.0527001 0.0462105 0.0152086
+0.0191089 0.0889764 -0.0262512
+-0.0917278 0.114662 0.0113396
+-0.0311696 0.0749025 -0.031542
+0.0103976 0.0505032 0.04997
+0.00150167 0.0504398 0.0522275
+-0.00913054 0.0987984 -0.026694
+-0.0607072 0.0707896 -0.0151427
+-0.0314435 0.033488 -0.0292746
+0.0322402 0.0842577 -0.0191914
+-0.0617587 0.160001 -0.0265888
+0.0366758 0.0659888 0.0371374
+-0.0410386 0.153314 -0.00775366
+-0.0916156 0.146104 0.0201482
+-0.008275 0.130081 0.0196055
+-0.0716229 0.0395313 0.00756641
+-0.0555501 0.0448059 0.0154665
+-0.0519883 0.0545681 0.0276385
+-0.063796 0.145383 -0.0141799
+-0.0204903 0.107154 0.041938
+-0.00950118 0.06052 0.0554819
+-0.0297859 0.073336 -0.0325546
+0.0225502 0.0873848 -0.0245875
+-0.0658345 0.0367656 0.0273328
+-0.0335698 0.0354174 0.0482024
+-0.0826039 0.0829175 -0.00455606
+0.0133284 0.055284 -0.0292269
+-0.000932932 0.0363158 0.0167895
+0.0190541 0.116198 -0.0132311
+-0.000494259 0.0911454 0.0560111
+0.0112951 0.130595 0.0166808
+-0.0164761 0.0673645 0.0539812
+-0.0180225 0.0385494 -0.00514634
+-0.0610891 0.0339525 0.017372
+-0.0707478 0.147309 -0.0278341
+-0.0189873 0.180146 -0.0170482
+0.0237757 0.0343382 0.00896337
+-0.00265737 0.0899953 -0.0354905
+-0.0718661 0.100809 -0.0137558
+-0.00649817 0.0939276 0.0556503
+-0.0246455 0.126418 0.012252
+-0.0157508 0.070024 -0.0384074
+0.0256059 0.12104 -0.000826914
+0.00250363 0.0489881 0.0513443
+-0.029644 0.125848 0.0118936
+-0.024804 0.0737635 0.0475256
+-0.0672658 0.131206 0.0466969
+-0.0817178 0.0953366 0.0328835
+-0.0286351 0.0918211 -0.0275955
+0.0414472 0.0971985 0.0261597
+-0.0680972 0.121444 0.0525081
+-0.0683202 0.166619 -0.0540065
+-0.0375072 0.0775843 0.0424046
+-0.0143913 0.0384112 0.00490303
+-0.0518947 0.109852 -0.0185479
+0.0338477 0.0711662 -0.016803
+-0.0450894 0.154663 -0.00752455
+-0.0564919 0.0875695 0.0445907
+0.0391967 0.0726247 0.033788
+0.0574073 0.0717824 0.0103168
+-0.0237163 0.0380022 0.0196686
+0.0120538 0.0907862 -0.0301745
+-0.0669793 0.134061 -0.00834965
+-0.00947746 0.116894 0.0392479
+-0.0328734 0.0680853 -0.0194707
+0.030263 0.116206 0.0279976
+-0.0348513 0.0345425 0.0400019
+-0.0532018 0.0733522 0.0412342
+-0.0577592 0.033805 0.0199655
+-0.00439966 0.119978 -0.0131705
+0.0162591 0.0434903 0.0442636
+-0.0567225 0.0423764 0.0206991
+0.00325132 0.12142 -0.0127844
+0.0145581 0.125506 0.0293407
+0.00448398 0.0989824 0.0487111
+-0.0896848 0.0929338 0.0144339
+-0.04491 0.13036 0.00775303
+-0.048947 0.138616 0.00839947
+-0.0307428 0.0552453 -0.0153798
+-0.0826044 0.1367 0.0480323
+-0.0749507 0.0661289 0.00944516
+-0.00473325 0.069866 -0.0358872
+-0.0167995 0.0347343 0.0471976
+-0.0426342 0.12559 0.0204963
+-0.0444709 0.120321 -0.0132547
+0.010477 0.116818 0.0374755
+-0.0744965 0.123196 0.0533572
+-0.047302 0.16443 0.00497116
+-0.0859996 0.118394 -0.000793117
+-0.0326967 0.0849828 -0.026556
+-0.0843669 0.106153 0.00138874
+0.0167493 0.127305 0.0229819
+0.0223908 0.0489358 -0.0217863
+-0.0762839 0.155844 0.0209052
+-0.0839499 0.0979633 -0.0036111
+-0.0216926 0.126501 0.0176944
+0.0378596 0.0914955 0.035553
+0.0420895 0.102851 0.00717012
+0.0366464 0.103365 0.0302885
+-0.0696779 0.086056 0.0423345
+-0.0340311 0.0339294 0.0212063
+0.0162763 0.0361212 0.00396256
+-0.0426327 0.0338426 -0.00397459
+-0.027617 0.125471 0.0155889
+-0.0937433 0.118772 0.0222988
+-0.0518432 0.133909 0.0302884
+-0.0413643 0.124214 -0.00934406
+-0.0413386 0.121239 -0.0122322
+-0.0396582 0.0336638 0.00768797
+-0.0853564 0.091162 -0.00253932
+0.0179914 0.120614 0.0332262
+-0.0717184 0.0792466 -0.0147262
+0.0215785 0.11262 0.0367657
+0.0236405 0.0366106 0.026972
+-0.07448 0.0662148 0.0164657
+-0.00149557 0.0973426 -0.0290749
+0.0342448 0.0842103 -0.0184253
+0.0045204 0.0661365 0.0560558
+-0.0072649 0.0384115 0.0117959
+0.0362267 0.104294 -0.00842134
+0.0232091 0.0782074 0.0494446
+-0.0204762 0.0786229 0.0556935
+0.0189956 0.125897 0.000310264
+0.0582502 0.0661055 0.0226582
+-0.0884672 0.113635 0.0306037
+-0.0595891 0.155231 0.0238846
+-0.0540479 0.142765 -0.001179
+0.0139994 0.0807368 0.0537041
+-0.0660333 0.155202 -0.00458552
+-0.0371914 0.175481 -0.00856986
+-0.0114786 0.114128 0.0403922
+0.00280587 0.10648 -0.0207933
+-0.061629 0.148291 0.0370712
+-0.0305056 0.115271 0.0335326
+-0.0847456 0.0911272 0.0289858
+0.0294623 0.103445 0.0374919
+-0.0884887 0.122612 0.00129126
+-0.0869453 0.0846809 0.01048
+0.04631 0.0778469 0.00818385
+-0.077491 0.135849 0.0507593
+0.00650523 0.0745046 0.0565842
+-0.0193751 0.0711448 0.0534686
+-0.03164 0.0581442 -0.0153958
+0.00337821 0.0392113 0.0295452
+0.026954 0.116596 0.0310646
+-0.0623115 0.16311 -0.0435951
+0.0154275 0.0350916 0.0411096
+-0.0724818 0.165221 -0.0429802
+-0.0359956 0.151076 -0.00202594
+0.0162209 0.0779008 -0.0293961
+-0.0478366 0.133877 0.0213554
+0.0569921 0.0661536 0.0243514
+-0.0318346 0.0915622 -0.0244444
+-0.0864107 0.0819973 0.0174801
+-0.0497993 0.0677848 0.0379447
+-0.0671663 0.164687 -0.0194859
+-0.00868026 0.111843 -0.0204858
+-0.0195177 0.0933631 0.0529187
+-0.0535918 0.114983 -0.0155816
+-0.068804 0.18096 -0.0579804
+-0.0846698 0.148755 0.00515607
+-0.0808035 0.0868637 -0.00756861
+-0.0309282 0.156627 0.000764301
+-0.0561456 0.0642166 0.0326189
+-0.0864523 0.0899653 0.00147962
+-0.0802598 0.0734072 0.0195467
+-0.025101 0.114847 -0.0155729
+-0.0348703 0.102876 -0.0215726
+0.00151752 0.0547965 0.0538164
+-0.0216758 0.0969718 -0.024798
+0.0367496 0.0931371 -0.012555
+0.00330684 0.0583228 -0.0321215
+-0.0697412 0.154452 0.0305168
+-0.0618525 0.0343021 0.022204
+-0.00886294 0.171168 -0.0237423
+-0.0216854 0.168305 -0.0122385
+-0.0435207 0.0562403 0.0394546
+-0.0620233 0.159983 -0.0376027
+-0.0751309 0.154085 -0.0179327
+-0.0480694 0.153165 -0.00566954
+0.0283556 0.0605487 0.0426528
+0.0115864 0.0348612 0.0423222
+-0.064559 0.11407 0.0417666
+0.0210547 0.0358177 -0.00168489
+-0.042575 0.0491291 -0.011035
+-0.0742409 0.113562 0.0499634
+-0.0659446 0.146784 0.0398667
+-0.0670071 0.172276 -0.0580562
+0.0251821 0.0357118 0.0226481
+-0.0129957 0.0883892 -0.0379783
+0.01814 0.0713245 0.0508426
+0.0161851 0.0347246 0.0253316
+-0.0234485 0.122824 -0.00599554
+0.00849456 0.0412846 0.0453159
+-0.0253871 0.124202 0.0208009
+0.00860136 0.121512 -0.0129363
+-0.0764996 0.128859 0.0532215
+-0.0637886 0.083851 -0.0191517
+-0.073438 0.175304 -0.0418354
+-0.0464485 0.132668 0.0189406
+-0.018505 0.112714 0.0394706
+-0.0579749 0.117711 -0.0123561
+-0.0241311 0.0384069 -0.0174035
+0.0286891 0.119649 0.00175522
+0.0135044 0.118213 0.0361594
+0.00748569 0.0942514 -0.0297902
+0.0223281 0.111319 -0.0139783
+0.00796203 0.131149 0.00690102
+-0.0888712 0.101031 0.0183836
+0.0208523 0.0352023 0.0276656
+-0.0939805 0.118754 0.0182968
+-0.0886426 0.129716 0.0443401
+-0.0562403 0.128346 0.0379943
+-0.0946719 0.122818 0.0192736
+-0.0844496 0.151409 0.0062115
+-0.0488054 0.124161 -0.00921799
+-0.0495787 0.0503337 -0.00863311
+-0.0642728 0.174473 -0.0515364
+-0.0355869 0.116022 -0.0147547
+0.0353133 0.0362497 0.0114171
+-0.0570854 0.136926 -0.00500822
+-0.033504 0.079379 -0.0265108
+-0.062469 0.033932 0.0153305
+-0.000579953 0.0361804 -0.0245898
+-0.0314067 0.0423682 0.0507901
+-0.0112759 0.125368 0.030237
+-0.00950387 0.075936 0.0571919
+-0.0424487 0.125177 -0.00834623
+-0.0077039 0.113721 -0.0184781
+-0.00342161 0.0338005 -0.0221963
+-0.0140717 0.118746 -0.0137718
+-0.0231943 0.0388081 0.0352395
+-0.0639512 0.156212 0.0208686
+-0.0624954 0.0890364 0.0453804
+-0.0303734 0.125779 0.00722581
+0.003605 0.0340592 0.00699628
+-0.0765794 0.15423 -0.00189723
+-0.0759273 0.08606 0.0386654
+0.0508473 0.0446622 0.0112162
+0.00609443 0.127443 0.0291456
+-0.0428742 0.105667 -0.0205602
+-0.0188968 0.0381911 0.0132528
+-0.086324 0.106283 0.0073644
+-0.0320928 0.0336737 -0.0220791
+-0.0466544 0.119173 -0.0140371
+-0.0710688 0.156192 0.0139947
+-0.055712 0.155088 0.0136896
+-0.0525045 0.159361 0.00819169
+-0.0543637 0.116891 0.0353365
+0.0318466 0.0424663 0.0288342
+-0.051547 0.125478 0.0342157
+-0.00249266 0.0760635 0.0587913
+-0.00575365 0.0727093 -0.0362416
+-0.00680153 0.129324 0.00093339
+0.0495021 0.0664943 0.0276338
+-0.0282448 0.11486 -0.0155715
+0.031224 0.0786608 -0.0202592
+-0.0148026 0.0827563 -0.0392327
+-0.071855 0.0993885 -0.014251
+0.0177513 0.0462342 0.0429632
+-0.0242082 0.121982 0.0271598
+-0.0922854 0.116039 0.0223382
+0.0434814 0.0832239 -0.00379707
+-0.0384996 0.171162 0.000767348
+-0.0712408 0.114861 0.0513991
+-0.0157632 0.12799 0.00385748
+0.019082 0.126548 0.00245443
+-0.00388013 0.0394939 0.0368098
+-0.0204678 0.122105 0.0297617
+-0.0285693 0.0399846 -0.0296196
+-0.0831878 0.0764607 0.0163622
+0.0190867 0.0428243 -0.0216805
+0.0483631 0.0628304 -0.00297175
+-0.0927311 0.120157 0.0322864
+-0.0241838 0.0579409 0.0417219
+-0.0517297 0.0723507 -0.015831
+-0.0217729 0.0684817 -0.0372671
+-0.00949546 0.0829261 0.0578441
+0.0172524 0.0778474 -0.0286871
+-0.0441607 0.162142 -0.00945516
+-0.00587725 0.105934 -0.0226578
+0.0253567 0.0518232 -0.0216362
+-0.0494861 0.156424 0.00985611
+-0.0174771 0.0924389 0.0547456
+-0.0151406 0.126373 0.0259068
+-0.0852968 0.0818288 0.005494
+-0.0244818 0.0988555 0.0446892
+-0.0930791 0.118839 0.037294
+-0.0662836 0.114247 0.046332
+0.0127465 0.0672208 0.05354
+-0.0414757 0.109827 0.0377618
+-0.0435203 0.0519967 0.0390799
+-0.0417672 0.0812092 -0.0204027
+-0.0786424 0.0732312 0.000545367
+-0.0358502 0.0986071 -0.0225695
+0.0443653 0.0561662 -0.00597205
+0.0226111 0.0458717 -0.017849
+-0.0108336 0.116804 -0.0157483
+-0.0865451 0.110395 0.00835385
+0.031421 0.0399741 -0.00264961
+0.0363991 0.039859 -0.00104313
+-0.0468008 0.0347657 0.0424884
+-0.0398282 0.0914347 -0.0233046
+-0.025008 0.0334859 -0.0261337
+-0.0465231 0.0804789 0.0433941
+-0.0689665 0.135529 -0.00828838
+-0.0264689 0.0379883 0.0100865
+-0.0345116 0.111154 0.0360997
+-0.0225694 0.0387321 0.0336407
+0.0372794 0.0574491 -0.00767997
+-0.0707981 0.0672067 0.0269443
+-0.0150683 0.0384098 0.0065829
+-0.0592389 0.0452743 -0.00430196
+-0.0334924 0.102881 0.0413291
+-0.079025 0.153836 0.00536375
+-0.0229321 0.055215 0.043371
+-0.0601957 0.0341396 0.0262143
+-0.0688541 0.147497 -0.029579
+-0.0613597 0.172535 -0.0585911
+-0.0748166 0.0921259 -0.0144369
+-0.0632016 0.165278 -0.0601981
+0.0402098 0.04091 0.000378677
+-0.047469 0.117985 0.0306301
+0.0368134 0.0781201 0.03746
+0.000515748 0.0349973 0.0453092
+-0.0534255 0.124412 -0.00739059
+-0.000488424 0.0801341 0.0575904
+-0.0706455 0.0701231 -0.00669595
+-0.0477034 0.0649971 -0.0135628
+-0.0348898 0.0767003 -0.020496
+-0.00451076 0.0788064 0.0581316
+-0.0693915 0.117164 0.0523368
+-0.0200653 0.164398 -0.0170398
+-0.073544 0.177863 -0.0540307
+0.0427163 0.0399244 0.0113768
+0.0240483 0.0713748 0.0470522
+-0.0154968 0.0659374 0.0537935
+-0.0686329 0.175846 -0.0473222
+-0.0628372 0.172536 -0.0525874
+-0.0796429 0.148681 -0.00084361
+-0.0663392 0.0600723 0.0146241
+-0.00400483 0.123769 0.0343163
+0.0322222 0.0597861 -0.0166881
+-0.0640918 0.158696 -0.0546245
+-0.00248901 0.0456504 0.0469622
+-0.072774 0.10871 0.0380686
+-0.0810086 0.154578 0.0119766
+-0.0695005 0.091616 0.0421021
+-0.0665162 0.155345 0.00690315
+-0.030539 0.0748507 -0.0325674
+-0.0672648 0.0680031 0.0322561
+-0.0660205 0.131186 0.0449542
+-0.0246171 0.125897 0.00496292
+-0.077893 0.12518 -0.00689701
+-0.0883724 0.121658 0.047175
+-0.0773948 0.167309 -0.02854
+-0.0604 0.0470132 0.0371523
+-0.027746 0.0753954 -0.0356568
+-0.0748509 0.0782361 -0.0105914
+-0.0571323 0.14819 0.0314465
+-0.0415029 0.0803953 0.042616
+-0.0628829 0.0649103 0.0305991
+-0.00169833 0.0598396 -0.033652
+0.0151569 0.107807 -0.0181851
+0.0566945 0.0674374 0.0239376
+-0.0717279 0.155642 0.00502354
+-0.00382186 0.102465 0.0438439
+-0.0587089 0.155741 0.0125904
+0.0572801 0.0608152 0.0247108
+0.017703 0.0913635 0.0485583
+0.0260543 0.116303 -0.00733098
+-0.0345036 0.0690703 0.0414109
+-0.0292922 0.117943 -0.0127907
+0.0213023 0.0835644 0.0502546
+0.0464907 0.0664648 0.0271426
+-0.0564929 0.14962 0.0306387
+0.0282135 0.118937 -0.00132982
+-0.000391601 0.123621 0.0341495
+-0.00114981 0.12653 0.03091
+0.0304544 0.114562 -0.00546317
+-0.0547437 0.0337519 0.0206417
+-0.0468823 0.107031 -0.0193009
+-0.0631801 0.0406886 0.0415101
+-0.0910325 0.133669 0.0112223
+-0.0592476 0.145654 -0.00231326
+-0.0125718 0.100502 0.0445971
+-0.0298246 0.0378766 0.0293214
+-0.0839351 0.123564 -0.00377373
+-0.0621407 0.163665 -0.0567978
+-0.0389566 0.155104 0.00497717
+-0.0878144 0.105004 0.012374
+-0.0794305 0.0908376 -0.00963692
+-0.0246551 0.0507167 -0.0273858
+-0.0796103 0.0799856 -0.0065507
+0.0330411 0.10941 -0.00791346
+-0.00231596 0.121888 -0.0112268
+-0.0597326 0.154693 0.0267485
+0.0339669 0.0697663 -0.0167955
+0.0205734 0.0999616 -0.0218299
+-0.0354929 0.0917868 0.0443508
+0.00339585 0.0355203 0.0220096
+-0.0315414 0.125778 0.00387502
+-0.0478194 0.135564 0.0104014
+-0.00879058 0.0812731 -0.0379859
+-0.0037488 0.0386615 0.00318783
+-0.0464486 0.0959731 0.0434949
+-0.0306087 0.0394849 -0.0300968
+-0.00234671 0.0967246 -0.0304442
+-0.0312616 0.0735186 -0.0295121
+-0.0423301 0.0340883 0.0282541
+0.0355908 0.113068 0.0185826
+0.000833787 0.106762 -0.0210825
+-0.021676 0.184465 -0.0190713
+-0.0305406 0.0566147 -0.0184018
+-0.0876394 0.113262 0.0257017
+-0.0851868 0.0966727 -0.00156833
+-0.0465061 0.0425232 0.0438042
+0.0106037 0.121274 -0.0126925
+0.0290611 0.0523826 -0.0177704
+-0.000764451 0.0769261 -0.0359174
+-0.0416101 0.0338187 0.00715256
+-0.0893298 0.0969555 0.0104169
+-0.0345694 0.163827 -0.00275159
+-0.0888276 0.090232 0.0214359
+0.0208395 0.034464 0.00266226
+0.0428658 0.0623821 -0.00251673
+-0.00588102 0.130577 0.00751387
+-0.0133142 0.0337765 -0.0222266
+-0.0435242 0.0590876 0.0398271
+0.0545899 0.0478435 0.0151974
+-0.0107349 0.0699421 -0.0371274
+0.027906 0.0578072 0.0419759
+-0.0416225 0.0520166 -0.011127
+-0.0207276 0.168298 -0.0126147
+0.0256959 0.0491338 0.0386649
+-0.0550795 0.153114 -0.00215772
+-0.0380808 0.0483205 -0.0131774
+-0.0276317 0.056316 -0.0254148
+-0.00815144 0.127733 -0.00346398
+-0.0627849 0.0852772 -0.0191174
+-0.0619877 0.169385 -0.052596
+0.0234401 0.112665 0.0358138
+-0.0659073 0.110934 -0.0126703
+0.0280721 0.0360499 0.0211097
+0.0105243 0.0687767 0.0545753
+-0.00679638 0.0982761 -0.0281107
+-0.0309109 0.0462432 0.0473418
+-0.0196031 0.0393462 -0.028238
+-0.0871129 0.152836 0.0157593
+-0.0911632 0.133688 0.01322
+-0.0464961 0.102903 0.0415914
+-0.0206991 0.0553418 -0.0317435
+-0.00949277 0.073156 0.0570282
+-0.0864179 0.083353 0.0184733
+-0.0841891 0.111446 0.02976
+-0.0940387 0.126929 0.0232615
+0.0406221 0.0899944 0.0307666
+0.0208423 0.104696 0.0425993
+0.0445354 0.0407636 0.0127885
+-0.0623396 0.172509 -0.0536126
+0.0342346 0.0852576 -0.0183147
+-0.0866427 0.151554 0.0100877
+-0.0470988 0.0345244 0.0321531
+-0.080576 0.154494 0.0106641
+-0.0137759 0.0756859 -0.0386228
+0.0216235 0.0430155 -0.0167288
+0.0376424 0.109732 0.0031582
+0.0589875 0.0607291 0.021951
+-0.0923003 0.132372 0.0212228
+0.0311691 0.0942449 0.0417029
+-0.0174159 0.162512 -0.00777918
+-0.0156178 0.12076 -0.00985742
+-0.0507328 0.121196 0.0335979
+0.028716 0.119662 0.0245591
+-0.0738138 0.0950345 -0.0145557
+0.0204425 0.0350747 0.0258809
+-0.0207737 0.0351435 -0.019333
+0.0223353 0.12586 0.0121947
+-0.0155009 0.0951913 0.0533641
+-0.0143883 0.038338 0.0212719
+0.00741103 0.0391504 0.030425
+0.0433932 0.0691823 -0.000799598
+-0.0760543 0.149976 -0.0168736
+-0.0701178 0.170154 -0.0291958
+-0.0483555 0.146018 -0.00117385
+0.0336441 0.0578174 0.0379601
+-0.0913716 0.140622 0.0201693
+-0.0308539 0.0958394 -0.0237431
+-0.0766992 0.0702795 0.00252119
+-0.0544948 0.107078 0.0398767
+-0.0587729 0.0796565 -0.019784
+-0.013621 0.128874 0.0191382
+-0.0634727 0.156127 0.0195874
+-0.0880436 0.0977019 0.0235765
+-0.0606626 0.0738612 0.0409255
+0.0348653 0.0795228 0.0399156
+0.0387467 0.0828368 -0.0137708
+-0.0573402 0.0424553 0.0177175
+-0.0784976 0.148406 0.0395361
+-0.0917148 0.117385 0.0263102
+-0.0330041 0.122377 0.0254817
+0.0172403 0.0768113 0.0531129
+0.0595736 0.0691817 0.0101411
+0.0306903 0.0708797 -0.0198199
+-0.0845462 0.119028 0.0490922
+-0.0501127 0.0337803 -0.0127711
+-0.0670049 0.0372923 0.032499
+-0.0915067 0.129676 0.0312386
+-0.0550517 0.0504886 -0.00434688
+-0.0484873 0.0790818 0.0439275
+-0.0635173 0.159862 -0.0515858
+-0.0706155 0.173275 -0.0394062
+0.0352172 0.0952034 -0.0127755
+0.0251052 0.0382735 0.0297226
+-0.0668809 0.106639 -0.013906
+-0.0678418 0.143634 -0.0139334
+-0.0235762 0.184403 -0.0123621
+-0.0257601 0.0726356 -0.0363191
+-0.0573375 0.0472769 0.0101218
+-0.085611 0.106332 0.02136
+-0.0265671 0.0617846 0.0387137
+-0.0126044 0.12951 0.0108053
+0.0214416 0.0362735 0.0322576
+-0.0354711 0.126342 0.0186171
+-0.0594976 0.0904384 0.0451853
+0.00310705 0.0348555 0.0387811
+0.0254813 0.0942452 0.0457882
+-0.0308576 0.10008 -0.0228293
+-0.0176768 0.0510699 -0.0312435
+-0.0162281 0.181624 -0.0200739
+-0.0195138 0.038345 0.00392275
+-0.0645154 0.121409 0.0489254
+-0.0248162 0.0593033 0.0409035
+-0.0571389 0.136712 0.0331888
+-0.0435213 0.0379732 -0.0242868
+-0.0606582 0.12408 0.0421371
+0.0346832 0.0519191 0.0323364
+-0.0913706 0.116528 0.0258009
+-0.0426868 0.0651551 -0.0146214
+-0.0215064 0.116765 0.0355266
+-0.0581012 0.158247 0.00415445
+0.00842312 0.0385006 0.0330183
+-0.0523141 0.162661 -0.0019165
+0.0606845 0.0623337 0.0161711
+-0.0495055 0.0848369 0.0453213
+0.0333786 0.06058 0.0393695
+-0.0689469 0.131135 -0.00874709
+-0.078943 0.132461 -0.00522567
+-0.0196521 0.0386292 -0.00926197
+-0.0594457 0.0334843 -0.00338966
+-0.054161 0.0337073 0.0136843
+-0.0384829 0.0959056 0.0428235
+-0.0869182 0.148604 0.0308154
+-0.0323987 0.116048 -0.0147978
+0.0359194 0.0798211 -0.0157295
+-0.0328255 0.12127 -0.00820532
+0.0414852 0.0569681 0.0316528
+-0.0270871 0.0520359 -0.0253933
+0.0508347 0.0727393 0.0196905
+-0.0198767 0.105865 -0.0225965
+0.0206869 0.0400703 -0.0126929
+-0.0285033 0.0616825 0.0373869
+-0.0714181 0.143109 -0.0104276
+-0.0804568 0.138622 0.0481167
+-0.0458049 0.0532278 0.0379952
+-0.0509023 0.125469 0.0333647
+-0.0871853 0.145927 0.0339699
+0.0558536 0.0594884 0.0261475
+-0.0889169 0.126733 0.0032966
+0.0110737 0.125093 -0.00680678
+-0.0358405 0.094357 -0.023472
+0.0259145 0.102099 0.0411479
+0.0426389 0.0764517 0.0281735
+0.00597565 0.131268 0.0190237
+-0.0475211 0.165506 -0.00586183
+0.0138473 0.035286 0.0424107
+-0.0544751 0.0987674 0.042954
+0.0329063 0.0668566 -0.0177475
+-0.0715523 0.0819441 0.0400873
+-0.0483263 0.149906 -0.00403153
+0.0417112 0.0986332 0.0241669
+-0.0591403 0.039472 0.0459797
+-0.0649985 0.156251 0.0205012
+-0.0389795 0.034282 0.00907489
+-0.0627215 0.0592404 0.0161384
+-0.0367435 0.0437017 -0.0271198
+-0.0164726 0.0387782 -0.0143554
+0.0302495 0.0773125 -0.0211724
+0.0378723 0.109729 0.00416584
+-0.0033562 0.120959 -0.0122202
+-0.0465665 0.0433151 -0.011194
+-0.0597431 0.093988 -0.019461
+-0.0756514 0.0743685 0.0320217
+0.0461779 0.083439 0.010174
+-0.0757827 0.151399 -0.00889222
+-0.0417451 0.0768346 -0.0188724
+-0.0617437 0.0421117 0.0428503
+0.00176163 0.130465 0.00157228
+0.0429689 0.0696277 0.0268653
+-0.0432762 0.0450842 -0.0143236
+-0.0525312 0.0475838 0.0226634
+-0.0153636 0.128543 0.00690549
+-0.0685053 0.109678 0.0379594
+0.0174805 0.103096 0.0453391
+0.0217176 0.0632088 0.0471364
+0.0359993 0.0955223 0.036379
+-0.0451488 0.0335546 0.00486717
+-0.0681193 0.15804 -0.05439
+-0.0661021 0.155727 0.025928
+-0.00573558 0.0684573 -0.035843
+-0.0181282 0.187252 -0.018852
+-0.0445141 0.050571 0.038927
+-0.00049716 0.0856626 0.0573342
+0.016507 0.0913965 0.0503683
+-0.0333397 0.0410057 0.0499212
+-0.0351946 0.125334 -0.00338173
+-0.0616183 0.16622 -0.0565931
+-0.0624979 0.0760891 0.0414437
+0.0350466 0.107363 0.0297386
+-0.0720199 0.063399 0.00874547
+-0.0877434 0.135138 0.0431967
+0.0458379 0.0588925 -0.00503856
+-0.0385014 0.119389 0.0303589
+-0.0647267 0.0417808 0.0373932
+-0.0226655 0.0537608 -0.0296706
+-0.0584982 0.105689 0.0406051
+-0.0137228 0.0685659 -0.0377913
+-0.0817302 0.142079 0.0441697
+-0.0426358 0.0548841 -0.0113796
+-0.0135008 0.082884 0.0573146
+-0.00338001 0.130095 0.0228247
+0.0172769 0.0708593 -0.0295557
+-0.0246932 0.065394 -0.0335995
+-0.0314011 0.178523 -0.00645128
+-0.0575589 0.154615 -0.000238768
+-0.0407441 0.0753914 -0.0183192
+-0.084936 0.144668 0.0388142
+-0.0365092 0.108385 0.0376381
+-0.0851088 0.102115 0.000391121
+-0.0646522 0.0642554 -0.00503339
+-0.0754983 0.145823 -0.00786764
+-0.0474148 0.133778 0.0200381
+0.012958 0.0904818 -0.0298536
+-0.0425054 0.0705013 0.0420152
+0.0369946 0.0686204 -0.0137746
+0.0462743 0.0775122 0.0165366
+-0.0417874 0.128546 0.00302224
+0.00250208 0.0547919 0.0536548
+-0.0543206 0.140979 0.0284164
+-0.0492132 0.138613 0.0153977
+-0.0204064 0.162527 -0.00684616
+-0.0194926 0.111309 0.040066
+-0.00849594 0.0829198 0.0577964
+-0.0467773 0.0826601 -0.021013
+-0.0535197 0.0472233 -0.00680686
+-0.0092432 0.169141 -0.0244221
+-0.0594862 0.0804633 0.0433033
+-0.0764447 0.154164 -0.0158984
+0.0585888 0.0538213 0.0151823
+-0.0588396 0.0925945 -0.0203375
+-0.0761105 0.167387 -0.0256061
+0.0432176 0.0401728 0.0130684
+-0.0395679 0.152136 0.0040279
+-0.0685344 0.180035 -0.058648
+-0.0404998 0.0930589 0.0424923
+0.0428754 0.100088 0.00417324
+-0.0320271 0.0553591 -0.0124271
+0.0199862 0.0348656 0.0241629
+-0.069479 0.123198 0.0530616
+-0.0239594 0.117024 -0.0138685
+-0.013157 0.175712 -0.0209577
+0.00451102 0.0674972 0.0557889
+0.0304128 0.0431004 -0.0051324
+-0.0887794 0.151473 0.0131594
+0.0317917 0.0949031 -0.0164462
+0.0342895 0.112223 -0.00202032
+-0.0728652 0.170808 -0.0480355
+0.0253565 0.075473 0.0472224
+-0.0754952 0.15561 -0.00190651
+0.060278 0.0581371 0.013168
+0.00444274 0.131539 0.0170385
+0.00950273 0.0546854 0.0525766
+-0.028415 0.178753 -0.00594863
+-0.011518 0.0431769 0.0500228
+-0.0504724 0.141671 0.0164028
+-0.0424936 0.045133 0.0413379
+0.0207994 0.125738 0.00307388
+-0.0689469 0.0433261 0.00632212
+0.0111753 0.0766426 0.0548499
+0.0297504 0.0462054 0.0339396
+-0.0674791 0.0622216 0.0214031
+0.0131787 0.0793804 0.0542326
+-0.0630395 0.136976 -0.00741235
+-0.0026931 0.0386465 0.0251959
+-0.0862725 0.103636 0.0233541
+-0.072832 0.162419 -0.0389636
+-0.0670825 0.156321 0.0197603
+-0.0572305 0.057508 0.0152056
+-0.0876158 0.136354 0.00421533
+-0.0214752 0.0609386 0.0459919
+-0.007347 0.0952877 -0.0329727
+-0.0613578 0.0586321 0.0151557
+0.00350505 0.0590839 0.0549927
+-0.0372275 0.160948 0.000450465
+-0.0457572 0.0336839 -0.00997088
+0.0106658 0.0351593 0.00371028
+-0.0714997 0.16363 -0.0138384
+0.00840839 0.117161 -0.0162388
+-0.0493716 0.143224 0.00839291
+0.0251748 0.123444 0.0203849
+0.0329112 0.096871 0.0389677
+0.044554 0.0917551 0.0201604
+-0.0384935 0.0562767 0.0397971
+-0.0785284 0.123123 0.0516319
+0.0426769 0.101505 0.0101616
+0.00833271 0.0567886 -0.0305627
+-0.0876135 0.100396 0.0230423
+-0.0327059 0.0779055 -0.0285245
+0.0119151 0.0860485 0.0542349
+-0.0675927 0.17056 -0.0354212
+-0.0807265 0.0770568 0.0269252
+-0.0384859 0.0520062 0.0392089
+0.0452145 0.0482364 0.0300085
+0.0204736 0.0851385 0.0500118
+-0.0600179 0.155783 0.0193707
+0.0164701 0.0976264 0.0474551
+-0.0456663 0.0410589 -0.0152981
+-0.0821974 0.128571 0.0521036
+-0.0304964 0.0974331 0.0445755
+-0.0540878 0.128312 0.0358453
+0.0390858 0.0407779 -0.000614316
+-0.0725241 0.13724 0.0489632
+-0.0620129 0.0587144 0.0113478
+0.0455822 0.0848004 0.0171734
+-0.0839185 0.112898 0.00127069
+-0.0728197 0.155564 0.00463235
+0.0277412 0.121021 0.0227689
+0.0301995 0.0768447 0.0437008
+-0.0106344 0.174261 -0.0225996
+-0.0617342 0.0737271 -0.0167014
+-0.0414956 0.0464933 0.0408152
+0.03243 0.0535036 0.0361605
+-0.0377322 0.150234 -0.00179971
+-0.0847627 0.109032 0.02334
+-0.0642974 0.167953 -0.0385345
+-0.0221614 0.0825281 0.0558751
+-0.0504951 0.0960175 0.0443724
+-0.0508177 0.0501221 0.014822
+-0.0436492 0.0577877 -0.0118151
+-0.0189776 0.0390241 0.0529956
+-0.0623698 0.169401 -0.0505859
+-0.0105368 0.0850533 -0.0384463
+-0.0181795 0.183113 -0.0176247
+0.0314401 0.110365 -0.00894711
+-0.0127075 0.065682 -0.0367743
+-0.0273345 0.172717 -0.009826
+-0.0666857 0.141706 -0.00893584
+0.0408833 0.10285 0.0201769
+-0.0876525 0.145908 0.0330215
+-0.0436328 0.056346 -0.0115255
+-0.0611631 0.0428583 0.0256966
+-0.0330915 0.16076 -0.0136886
+-0.085208 0.150101 0.00618898
+-0.0615069 0.172523 -0.0575905
+0.0555907 0.0604655 -0.000426808
+-0.0850315 0.151395 0.00719993
+-0.0728007 0.0864364 -0.0158265
+-0.003188 0.127967 0.0287063
+0.0455462 0.0861954 0.016167
+-0.0217098 0.115215 -0.0159934
+-0.0414975 0.0916447 0.0424797
+0.0487043 0.0430197 0.0122221
+-0.0869351 0.106366 0.0163624
+-0.0156753 0.0541059 -0.0332392
+-0.06162 0.150156 -0.00124665
+-0.00577101 0.098213 -0.0280417
+0.0223236 0.0550419 -0.0260567
+-0.00429403 0.131101 0.0138416
+-0.0636168 0.143654 -0.00954122
+-0.0855598 0.0912595 -0.00155473
+-0.0404413 0.10705 0.0387043
+0.0547917 0.0553704 0.0263503
+-0.0822116 0.101996 0.0303518
+-0.0437463 0.128889 0.0155826
+-0.0664819 0.0397537 -0.00588584
+-0.067283 0.161835 -0.0137578
+-0.061699 0.0599431 0.00295203
+-0.0715633 0.170815 -0.0500445
+-0.0861137 0.0805676 0.00950062
+-0.0502228 0.125461 0.0326401
+0.0589666 0.0552427 0.017183
+-0.0327176 0.125444 0.0196276
+-0.0632934 0.151996 -0.00122225
+-0.0512927 0.135429 -0.000552487
+-0.0184842 0.0897075 0.0555921
+-0.0260646 0.11803 -0.0129143
+0.0198889 0.0631747 0.0480195
+-0.0465912 0.145038 0.00283923
+0.0534733 0.0728245 0.019221
+-0.0352804 0.0341155 -0.0193879
+-0.0829241 0.126549 -0.00467577
+0.0279852 0.0352646 0.0181572
+-0.0531741 0.150869 0.0213978
+0.0202497 0.0347399 0.020698
+-0.062763 0.149042 -0.0175788
+0.00226918 0.115596 -0.0185376
+0.0250704 0.12404 0.011788
+-0.045498 0.101529 0.0420301
+-0.058497 0.0426323 0.0447374
+0.0455164 0.0904085 0.0121603
+0.0215692 0.0352857 0.025924
+-0.0274987 0.0631476 0.0380009
+-0.0140602 0.172758 -0.0187663
+0.0587826 0.0538552 0.0121765
+-0.0628795 0.15219 -0.00958093
+-0.0468135 0.1536 0.00939603
+-0.0928405 0.121514 0.033281
+-0.0622964 0.150648 -0.0145762
+0.0475064 0.0611159 0.0308231
+0.00412571 0.107297 -0.0203039
+-0.0703978 0.156305 0.0156818
+-0.053643 0.135335 0.0311995
+0.0067064 0.0341407 0.0184863
+-0.0466442 0.0397388 -0.0142756
+0.0119051 0.0711889 0.0540767
+-0.0447375 0.0357143 0.0441717
+-0.0228183 0.0840509 -0.0381648
+-0.023326 0.122164 -0.00726067
+0.0441999 0.0790177 0.0251667
+-0.0276246 0.160982 -0.00149388
+-0.0399791 0.126816 0.018458
+0.0222264 0.09191 -0.0233017
+-0.0627692 0.156841 -0.0155919
+0.044508 0.0412168 0.00624902
+-0.0731279 0.155455 -0.0309078
+0.0183024 0.0347298 -0.00182982
+-0.01652 0.0715906 0.0550352
+-0.091634 0.141989 0.0201675
+0.0440337 0.0734407 -0.000804833
+-0.0524198 0.0648658 0.0346087
+0.0572481 0.0508905 0.0141872
+-0.0164766 0.111102 -0.0196668
+-0.0418874 0.108498 -0.0194287
+0.0321354 0.0549697 0.0375085
+-0.0644897 0.102874 0.0413067
+0.0465079 0.0583728 0.0318256
+-0.0334582 0.0518969 0.0377238
+-0.0729908 0.139888 -0.00698816
+-0.0534544 0.124093 0.0367404
+0.0173165 0.0622663 -0.028279
+-0.0554104 0.0513256 0.00948897
+-0.014903 0.172738 -0.0182312
+-0.0502115 0.141667 0.015397
+0.0229958 0.0375848 0.0332895
+-0.0749615 0.135451 -0.00681495
+-0.0855353 0.0938173 0.0282665
+-0.069508 0.102769 0.0393316
+-0.0205392 0.0971418 -0.0249761
+-0.0312923 0.0362769 0.0513145
+0.0260175 0.0991397 -0.0189626
+-0.00594641 0.0989148 -0.0267499
+-0.0708605 0.0347825 0.00928864
+-0.0845393 0.103233 0.0269979
+0.0406232 0.0953057 0.0289912
+-0.0456818 0.0650665 -0.0140257
+-0.0326318 0.168236 -0.00522072
+-0.0765723 0.0689281 0.00553415
+-0.0176728 0.049548 -0.0303695
+0.00113463 0.130461 0.00151005
+-0.08699 0.0859713 0.00247197
+-0.0338357 0.095789 -0.0234311
+-0.0304987 0.10293 0.0419798
+0.0336335 0.0713894 0.0398251
+-0.0224957 0.101642 0.0440993
+0.0309373 0.119109 0.0111337
+-0.0734894 0.156164 0.020416
+-0.000755237 0.0740961 -0.035785
+0.0354988 0.0469226 0.030944
+-0.00617179 0.128513 -0.00228639
+-0.00460988 0.0388908 -0.00276124
+-0.0678289 0.135464 0.0458614
+0.0345596 0.114411 0.00388032
+-0.0884532 0.112251 0.0353052
+-0.0709934 0.170517 -0.0295248
+0.0284454 0.0995183 0.0412905
+0.0402167 0.0685122 0.0317439
+-0.0665769 0.0362823 0.0365183
+-0.0765583 0.148625 -0.00886956
+0.0576507 0.0606695 0.00219201
+0.060413 0.0664733 0.017165
+0.022246 0.0835763 0.0498509
+-0.0821459 0.0912329 0.0320422
+-0.0746727 0.145787 -0.00986958
+0.0345089 0.111329 0.0271807
+0.0594367 0.0663847 0.00713811
+0.0282217 0.0664463 -0.0207545
+-0.0619747 0.170963 -0.0535908
+-0.0394944 0.0492076 0.0395541
+-0.0787666 0.165266 -0.0299591
+-0.0749441 0.129634 -0.00796551
+-0.00112962 0.125371 0.0323555
+-0.0154803 0.0500282 0.047966
+0.0153592 0.0953434 0.0487033
+-0.085237 0.147388 0.00618456
+-0.0128008 0.0841443 -0.0388521
+0.024383 0.0518665 -0.0223004
+-0.0342551 0.0766309 -0.0244955
+-0.0670839 0.173532 -0.0453192
+-0.0772544 0.0764799 0.0316515
+-0.0270646 0.053566 0.0376661
+-0.0225205 0.112681 0.0384786
+-0.0884304 0.0874699 0.00847782
+-0.0737584 0.0914853 0.0405847
+-0.064968 0.128232 -0.00872903
+0.000512384 0.127929 0.028588
+-0.0599553 0.0610872 0.0239566
+-0.0384792 0.116679 0.0322191
+-0.0485119 0.112536 -0.0170517
+-0.0304781 0.0523954 -0.0163632
+0.0387588 0.108855 0.00681782
+-0.0406156 0.155109 0.0060988
+-0.0471466 0.149481 -0.0040486
+0.0179495 0.127337 0.00345096
+-0.0395837 0.0336987 -0.0198537
+-0.0633751 0.0344193 0.0288044
+-0.0424853 0.128365 0.0145816
+-0.0364913 0.113889 0.0338295
+0.0353283 0.112832 0.00268414
+-0.0653226 0.0343003 0.0144151
+0.0435313 0.065065 0.0273105
+-0.0795726 0.0867837 -0.00954059
+-0.0104381 0.171321 -0.0205524
+-0.0737003 0.156269 0.0145144
+-0.0733818 0.155466 -0.0289107
+-0.0198527 0.0382258 0.0238627
+-0.0188257 0.0725897 0.0542693
+-0.0778777 0.117832 -0.00599287
+-0.0365049 0.10423 0.0397359
+-0.00948278 0.0978353 0.051868
+-0.0103201 0.0393296 0.0497389
+-0.0876274 0.137747 0.00620032
+0.0416732 0.0819555 0.0304093
+0.0608524 0.0609661 0.0101561
+-0.0767143 0.154218 -0.0048969
+0.0174945 0.0838575 0.0514031
+-0.066433 0.0337378 -0.00503676
+-0.0232113 0.177135 -0.0206374
+0.0100949 0.034771 0.018605
+0.042675 0.0751161 0.0282624
+-0.0866662 0.0833296 0.0114916
+-0.0504965 0.157865 0.00943584
+0.0433406 0.0973216 0.0191637
+-0.0888303 0.0915034 0.00845607
+-0.0555242 0.0415797 -0.00918326
+-0.0337405 0.075174 -0.025488
+-0.0906275 0.137865 0.0211926
+-0.0123027 0.0389534 -0.0136872
+-0.045835 0.0941966 -0.0219229
+-0.0238433 0.163025 -0.0155105
+-0.0522937 0.12758 -0.00475935
+0.0308793 0.0356029 0.0166157
+0.0423563 0.0588819 -0.00453174
+-0.00663392 0.0466819 -0.0297341
+-0.0484493 0.0656843 0.0374132
+-0.0270407 0.125883 0.0113821
+-0.0910269 0.129538 0.0072515
+-0.0455907 0.0447683 -0.0109766
+0.00905498 0.0971664 -0.0248901
+0.00396755 0.0341147 0.00886829
+0.00550365 0.123767 0.0339438
+0.0400787 0.0432895 0.0279756
+-0.00815712 0.126302 0.0298556
+-0.0609217 0.118124 -0.010668
+-0.0141549 0.129252 0.0145753
+0.0274448 0.120188 0.0255104
+-0.0485004 0.111187 0.0370789
+0.0451596 0.0789195 0.0230398
+-0.0138991 0.162654 -0.0155462
+-0.0528814 0.0447887 0.0196824
+0.0277468 0.0465681 -0.0107176
+-0.0580291 0.124109 0.0406616
+-0.0404897 0.0874362 0.0429424
+0.0316544 0.117354 0.0228159
+0.0277648 0.098182 0.0420578
+-0.0391765 0.165177 -0.0125287
+-0.0691207 0.112747 0.0474107
+-0.0614963 0.102908 0.0417081
+0.0393676 0.0927337 0.0325144
+0.0214921 0.125223 0.0232941
+-0.0167077 0.059948 -0.0356741
+-0.0619704 0.118373 0.041992
+-0.0359339 0.109235 -0.0196158
+-0.0150259 0.185694 -0.0231645
+0.0245929 0.0577938 0.0442192
+-0.00233157 0.122878 -0.010278
+-0.0434949 0.0817618 0.042266
+0.0298844 0.0350171 0.0132987
+-0.00424346 0.0409986 0.0479883
+-0.0776115 0.15005 -0.0049035
+-0.0124244 0.108763 -0.0212047
+-0.0798966 0.083235 0.0342815
+-0.0813623 0.104616 -0.00457868
+-0.0167402 0.0671791 -0.0380101
+0.0259555 0.123153 0.0178233
+0.0406613 0.0638232 0.0297482
+-0.0129458 0.117871 -0.0148632
+-0.0708515 0.0937008 -0.0159297
+-0.0688238 0.1383 0.0462399
+-0.0886846 0.136388 0.00720801
+0.0460186 0.0714912 0.0208033
+0.0465334 0.07646 0.0111853
+0.000795729 0.0345137 0.0115011
+0.0318042 0.0661523 0.0406683
+-0.0277917 0.0810724 -0.036339
+-0.012329 0.0361667 0.050366
+-0.0672863 0.151256 -0.0426939
+0.0328851 0.0556122 -0.0127142
+-0.0444939 0.107088 0.0401229
+-0.088037 0.113814 0.026966
+-0.0228073 0.184465 -0.0170667
+-0.00369909 0.0598617 -0.0340393
+-0.0698551 0.16523 -0.017589
+-0.0464984 0.047794 0.0396541
+-0.0756919 0.143067 -0.00582827
+-0.0208788 0.0383361 0.00183886
+-0.0768287 0.154208 -0.00589938
+-0.0147866 0.0799249 -0.0391233
+-0.0699384 0.150598 0.0380766
+-0.0866088 0.126656 -0.00171455
+-0.0792409 0.168033 -0.0359701
+-0.0650871 0.0417056 0.03635
+0.0353256 0.109535 -0.00390394
+0.00651309 0.0828012 0.0562471
+-0.0512535 0.0528689 0.0137817
+-0.0635072 0.0590749 0.0125217
+-0.0892074 0.127019 0.0449806
+0.0451896 0.0875706 0.0191665
+-0.0576689 0.0350157 0.0450337
+-0.0441239 0.129077 0.0169132
+0.00351519 0.0634007 0.0566286
+-0.0456618 0.0741031 -0.0174455
+-0.045802 0.0382259 -0.0192856
+-0.0774749 0.141413 0.0470689
+0.019092 0.0350694 0.0292369
+-0.0721908 0.176974 -0.0457483
+-0.0228049 0.0784515 -0.0385457
+-0.0196863 0.0539295 -0.0316066
+0.0370985 0.0632585 0.0359995
+-0.0097823 0.0613531 -0.0352263
+-0.0518485 0.147799 0.0174109
+-0.0424957 0.11253 0.0356818
+-0.00161218 0.0387745 0.0252993
+0.0432025 0.0777701 0.0272794
+0.0158912 0.0644868 0.0510299
+-0.0624956 0.0861834 0.0447184
+0.0226823 0.0605452 0.0467602
+-0.0345153 0.0780634 -0.0235017
+-0.0693572 0.156301 0.0160519
+-0.0848272 0.110715 0.0391424
+0.00397477 0.0389229 -0.0104191
+-0.0107444 0.0685007 -0.0365794
+0.0105122 0.0673666 0.0542979
+-0.0493982 0.113885 -0.0164603
+0.0292359 0.120576 0.0147663
+0.0143954 0.0433708 -0.024029
+-0.0548811 0.099887 -0.0210509
+-0.0345638 0.113971 -0.0166195
+-0.00945158 0.0346766 0.0453022
+-0.0114995 0.0486859 0.0490069
+0.047721 0.0729559 0.00883547
+0.00782583 0.131487 0.0111342
+0.018385 0.126365 0.000765748
+-0.0801977 0.117632 0.0490824
+0.0508224 0.0446928 0.0102182
+-0.0792484 0.154932 0.0111245
+-0.0616259 0.175734 -0.0596865
+-0.0554957 0.10156 0.042627
+-0.0693451 0.162383 -0.0509602
+0.0464905 0.0624784 0.0299685
+-0.0626979 0.149033 -0.0165859
+-0.027787 0.0838632 -0.0360686
+-0.068908 0.112267 -0.0105177
+-0.0464636 0.157957 0.00818306
+-0.0656199 0.0690554 -0.0100807
+-0.0594903 0.081873 0.0434438
+-0.042501 0.0803745 0.0423542
+-0.0715599 0.0733863 -0.0105456
+-0.00392373 0.129832 0.00104637
+0.0231411 0.0844685 -0.0255261
+-0.0582906 0.0411368 0.01871
+-0.0231503 0.121506 -0.00857745
+0.0353371 0.0534224 -0.00701071
+-0.028498 0.108421 0.0390601
+-0.0161996 0.0386499 0.0314325
+0.0417053 0.0943445 -0.00480688
+-0.037505 0.0874848 0.0436782
+-0.0859867 0.140484 0.00417932
+-0.0394569 0.124785 -0.00795634
+-0.0629125 0.111049 -0.0145904
+-0.0697706 0.0337438 0.00328799
+0.0353216 0.0863185 -0.0174167
+-0.0529232 0.125495 0.0357533
+-0.0145001 0.0870236 0.0569643
+-0.00422597 0.10111 -0.0231367
+0.026954 0.114984 -0.00791167
+0.0123614 0.0509077 -0.0278502
+-0.0705953 0.157132 -0.0018785
+-0.0270301 0.0604609 -0.0294673
+-0.0252429 0.163867 -0.00684922
+0.0164575 0.0900289 -0.0273543
+0.0182356 0.126981 0.00216332
+-0.0276261 0.15573 -0.00786612
+-0.0687195 0.165823 -0.0200644
+-0.0237576 0.0713185 -0.0373359
+-0.0350727 0.157773 -0.0116201
+-0.0115095 0.129073 0.00398865
+-0.000506085 0.0442149 0.046198
+0.0372544 0.109701 0.0220387
+-0.0154921 0.0382096 0.0157388
+-0.0500202 0.131989 -0.0014354
+-0.025472 0.0851651 0.0520429
+-0.0328435 0.125555 0.000439943
+-0.0773991 0.152954 0.0323974
+-0.0504161 0.144734 0.0123765
+-0.0576549 0.124438 -0.00742698
+0.0532901 0.0621073 -0.00218568
+-0.0298754 0.0748068 -0.0335581
+-0.0642433 0.0338438 0.0114826
+-0.0316113 0.0409091 -0.0301005
+0.00142887 0.0392678 -0.00936829
+0.0274179 0.122108 0.0155174
+-0.0144987 0.0884006 0.0568363
+-0.0184962 0.109943 0.0409607
+0.0379028 0.0997575 -0.00879746
+-0.0244855 0.0461464 0.0516096
+0.03717 0.0713299 0.0361376
+0.0442521 0.0804694 -0.00179963
+-0.0693598 0.153979 -0.049866
+-0.045049 0.0367204 -0.0222184
+0.0226853 0.115014 -0.0119595
+0.0308676 0.0713453 0.0410867
+-0.0253533 0.0381958 0.00468802
+0.0115087 0.101793 0.0474223
+0.0122157 0.0346138 -0.0197432
+-0.078807 0.10613 0.032485
+0.0412927 0.101424 0.0211601
+0.0449984 0.0413097 0.00725015
+-0.0614983 0.0861808 0.0447299
+0.0201601 0.0357218 -0.00467829
+-0.0270641 0.0376545 -0.0293745
+-0.0491197 0.137061 0.00540677
+-0.00249881 0.0829011 0.0575494
+0.021052 0.0358187 -0.0026817
+-0.0154895 0.0559453 0.0511175
+-0.0718433 0.0833097 0.0403454
+-0.087976 0.141871 0.0376917
+-0.0787586 0.163869 -0.0289482
+-0.0485008 0.0732772 0.0415918
+-0.0366615 0.0606699 -0.0121541
+0.0262206 0.0435744 -0.00668237
+0.000219502 0.0370979 0.0467851
+-0.00149685 0.0456811 0.047029
+-0.0545635 0.122251 -0.00910565
+-0.0186556 0.0480312 -0.0293255
+0.0387854 0.0701818 -0.0117862
+-0.0654945 0.0398115 -0.0063825
+-0.0437744 0.116579 -0.0153348
+-0.0344901 0.0987486 0.043091
+0.0610023 0.062364 0.012157
+0.0141007 0.120583 0.0346592
+-0.0823269 0.108767 -0.000607289
+0.0214843 0.092023 0.0479434
+-0.070667 0.0763937 -0.014042
+0.021114 0.0592021 0.0480036
+0.0252499 0.0775815 -0.0248688
+-0.0601377 0.0338299 0.0176745
+-0.0579501 0.0592474 0.0206872
+-0.0769058 0.154074 0.0295482
+0.0198639 0.11968 -0.0089705
+0.0022305 0.0754937 -0.0353597
+-0.00780413 0.0840976 -0.0379648
+-0.0611789 0.172541 -0.0596341
+-0.0447417 0.0768063 -0.0185987
+-0.017374 0.0569064 0.0504968
+0.00450466 0.087016 0.0568401
+-0.0709391 0.109631 0.0395791
+-0.0674006 0.0406253 -0.00334064
+-0.0311093 0.169745 -0.00652433
+0.0242906 0.0676576 -0.0247124
+-0.0326084 0.171239 -0.00339173
+-0.0325897 0.0666513 -0.0194517
+0.0319052 0.0437397 0.0295375
+-0.0450254 0.127281 -0.00449582
+-0.0226309 0.0478785 -0.0276417
+-0.0583127 0.0580812 0.00726379
+-0.037778 0.0827556 -0.0219531
+-0.0518874 0.106988 -0.0190452
+0.0163996 0.044784 -0.0236657
+0.0103374 0.0553349 -0.0300221
+0.0206753 0.126786 0.0115854
+-0.0850979 0.131233 0.0492505
+-0.0192324 0.177141 -0.0234526
+-0.0199616 0.0697296 0.0526775
+-0.0561055 0.158254 0.000206899
+-0.055732 0.115927 -0.0145408
+-0.0417663 0.162365 0.00442786
+-0.0305905 0.119479 -0.0103702
+0.0234999 0.0955508 0.0464417
+-0.0498856 0.149233 0.0119087
+-0.0154824 0.185702 -0.0219175
+0.00917376 0.125511 -0.00726227
+-0.0913426 0.147495 0.0231401
+-0.00381375 0.0896299 -0.0357356
+-0.0686943 0.154419 0.0308917
+-0.02552 0.111233 0.0379672
+-0.0705473 0.1414 0.0460484
+-0.00201946 0.100869 0.0458524
+-0.0876244 0.129442 0.00130199
+-0.00449535 0.0965559 0.0536663
+-0.0271292 0.0850573 0.0494379
+-0.0914908 0.1337 0.0152201
+0.00523694 0.126704 0.0302977
+-0.0470651 0.153179 -0.00606436
+-0.0672153 0.156284 0.0168104
+-0.0427934 0.0869807 -0.0215837
+0.0423379 0.0683118 0.0277209
+-0.0295859 0.0790353 -0.0345348
+-0.0477964 0.062891 0.036824
+-0.00968443 0.0570101 -0.0338896
+0.0451851 0.0861731 0.0211635
+0.00951284 0.0532319 0.0521285
+0.0302906 0.0787129 -0.0208549
+-0.0738862 0.104992 -0.0108534
+0.0453646 0.0575572 -0.00557548
+-0.0663103 0.0759418 0.0397029
+0.0143833 0.128699 0.00214848
+0.00580886 0.130668 0.0218239
+-0.0131274 0.0387957 -0.00624825
+-0.00997898 0.172997 -0.0279186
+-0.0620827 0.174072 -0.0556227
+-0.0546337 0.0334816 0.0119976
+0.0208676 0.121124 0.0316774
+0.0220436 0.125932 0.0163676
+0.0377227 0.0561747 0.0314909
+-0.0721609 0.147032 -0.0238695
+-0.0738111 0.0907253 -0.0150698
+-0.0362217 0.0335837 -0.0228111
+0.0387097 0.105846 2.20656e-05
+-0.0556277 0.0365615 0.0468082
+-0.0836005 0.0763298 0.006515
+0.0280677 0.100848 0.0407486
+-0.0831241 0.100626 0.0298981
+-0.0305493 0.0479587 -0.0242789
+0.0165747 0.0519808 0.0466207
+0.0447673 0.0847221 0.00118921
+-0.0146056 0.0435263 -0.0269315
+0.0273074 0.0346174 0.0112772
+-0.0683005 0.139737 0.0452157
+-0.0485925 0.132707 0.00186362
+0.00897502 0.113705 0.0394792
+0.010104 0.0343592 -0.0200136
+-0.0769339 0.126684 -0.00758482
+0.00350625 0.0547769 0.0535608
+-0.0850528 0.0993835 -0.000573805
+0.00144009 0.0350568 0.0184024
+-0.0301745 0.17266 -0.0167996
+-0.0732751 0.148715 -0.0303812
+-0.0837086 0.0952625 0.0306499
+-0.0742711 0.149885 -0.0318724
+-0.00654578 0.0384949 0.010053
+-0.0248989 0.0968475 -0.0246804
+-0.0633856 0.148243 -0.0195768
+-0.0647288 0.126998 0.0468559
+-0.058406 0.0598457 0.000248469
+0.0425358 0.0710418 0.0280089
+-0.0915343 0.140602 0.0181819
+-0.0407824 0.116214 -0.0149415
+-0.0445073 0.0491885 0.039305
+0.0294698 0.0801098 -0.0210213
+-0.0277559 0.0348695 0.0499059
+-0.0137302 0.107232 -0.0215702
+-0.0482685 0.037339 -0.0123839
+-0.0673815 0.0659915 0.0287149
+-0.0567046 0.11983 0.0390246
+0.0211901 0.113994 0.0360983
+0.0319596 0.11565 0.0257836
+-0.050462 0.0402796 0.0458238
+-0.0364752 0.09732 0.0430461
+0.00119043 0.0895238 -0.0341779
+-0.0699807 0.149351 0.039589
+0.0439472 0.0917185 0.0231564
+-0.0559199 0.113507 -0.0160179
+-0.0853556 0.095327 -0.00158429
+-0.0662723 0.154476 -0.00173975
+-0.0186027 0.111108 -0.0196906
+-0.0563562 0.140993 0.0307629
+-0.00358231 0.0383094 0.0162632
+-0.0568935 0.0562594 0.000567085
+-0.00649422 0.0590504 0.0549316
+-0.0245507 0.183147 -0.010424
+-0.032468 0.175717 -0.00291757
+-0.0132616 0.175663 -0.0275653
+0.00407218 0.0361395 0.0234015
+-0.00250245 0.104479 0.0441797
+0.00787676 0.127927 0.0283381
+-0.0760841 0.164579 -0.0198769
+-0.0814657 0.130234 0.0522094
+0.0322493 0.109934 -0.00848346
+-0.0747758 0.152715 -0.0228916
+-0.0360726 0.1261 0.0198793
+0.00651921 0.0869957 0.0564058
+-0.0863282 0.151358 0.00923307
+-0.00766666 0.0527037 -0.0328501
+0.0329828 0.110047 0.0302661
+-0.0819069 0.0844754 0.0320139
+0.020413 0.0521197 0.0451417
+-0.043267 0.149185 0.00566881
+0.03267 0.0767015 -0.0187757
+-0.0861456 0.140625 0.0415389
+-0.0665323 0.154667 0.00252946
+-0.0231566 0.158136 -0.0102789
+-0.0217907 0.0957944 0.0466571
+-0.0638349 0.156748 -0.0426051
+-0.0346441 0.117803 -0.0126135
+0.00980894 0.0658051 0.0545289
+-0.080258 0.0859229 0.0345477
+-0.0117542 0.0386862 -0.015202
+-0.080536 0.135397 0.0502642
+-0.0325368 0.0792892 -0.0295289
+-0.0784828 0.0717889 0.00251767
+-0.00149343 0.0883979 0.0566431
+-0.0137942 0.0386802 -0.0156021
+-0.0444896 0.101534 0.0420576
+-0.00192307 0.107424 -0.021877
+-0.0440699 0.153194 -0.00699527
+0.00318991 0.0880718 -0.0337792
+-0.0344943 0.0718865 0.0415833
+-0.030416 0.0692532 -0.0284548
+-0.0622359 0.167822 -0.0495929
+-0.0344858 0.100109 0.0424402
+0.00649387 0.0590149 0.0539921
+0.0360791 0.111295 0.00152105
+-0.0587368 0.0434475 0.0440841
+-0.0417025 0.0666657 -0.0153449
+-0.0533816 0.0513995 0.0117052
+-0.0285002 0.097396 0.0440561
+-0.0690491 0.153118 -0.0485047
+-0.0144923 0.093841 0.0546527
+-0.0633747 0.036885 -0.0080479
+-0.0706693 0.165215 -0.0479768
+0.0127157 0.0350729 0.0423657
+0.00853944 0.100396 0.0475311
+0.0211162 0.126093 0.00605375
+-0.0514924 0.113914 0.0348157
+0.0172187 0.117738 -0.0128881
+-0.01069 0.0969192 -0.0307004
+0.0121568 0.0930338 -0.0284961
+-0.0772387 0.158974 -0.0142914
+-0.0667905 0.0852019 -0.0183581
+0.0154254 0.0834009 0.0522607
+-0.0487147 0.0723044 -0.01565
+-0.0464696 0.0675313 0.0396048
+-0.0110203 0.0383532 0.0129011
+-0.0205151 0.114503 -0.0172551
+-0.0556769 0.0499718 0.00979142
+-0.0503626 0.0642656 0.0349674
+-0.00189958 0.130575 0.00323807
+-0.00749418 0.0533074 0.0526841
+-0.0781504 0.0736081 0.0268981
+-0.00216638 0.09997 -0.023881
+-0.0374964 0.119384 0.0304732
+-0.0237883 0.0932085 0.0487292
+-0.0846322 0.139314 0.044315
+0.00579995 0.0355749 0.0242599
+-0.0498385 0.0970763 -0.0221981
+0.0311277 0.0795524 0.0433085
+-0.080771 0.105947 -0.00458985
+-0.0541694 0.136721 0.0304424
+-0.0158788 0.038593 -0.0159367
+0.0375503 0.0588742 -0.00872526
+-0.0278572 0.0972984 -0.0239915
+-0.0609119 0.0678343 0.0355003
+0.0406749 0.0801882 -0.00878559
+-0.0891047 0.101026 0.0153901
+0.0370023 0.11146 0.00905905
+-0.00649525 0.0576581 0.0543368
+0.0215982 0.0645366 0.046975
+-0.0290293 0.160675 -0.0139931
+0.00903586 0.100133 -0.0220275
+-0.0584961 0.104303 0.041452
+-0.0664115 0.162305 -0.0579417
+0.0239006 0.0520481 0.0413924
+-0.0216874 0.126575 0.00458035
+-0.0485184 0.0438796 0.0435224
+-0.0231474 0.0384868 -0.00611954
+-0.00826521 0.0380456 0.0491273
+-0.0528526 0.147782 0.0214111
+-0.0907516 0.137857 0.0201957
+-0.0758557 0.103473 -0.0101675
+-0.0397582 0.079747 -0.0196231
+-0.0147733 0.078434 -0.0385776
+0.00381296 0.0379313 -0.0132938
+-0.0694673 0.0635361 0.0216095
+-0.0528954 0.105563 -0.0191967
+0.0343906 0.0529675 -0.00763383
+-0.0293172 0.172724 -0.00740528
+0.00850711 0.0688384 0.055257
+-0.016261 0.181575 -0.0262548
+0.0213104 0.0415776 -0.0147
+-0.0780733 0.100357 -0.00962255
+-0.0846334 0.108922 0.00436756
+-0.0186964 0.0569405 -0.033635
+-0.037924 0.175153 -0.00739726
+-0.049768 0.081217 -0.020889
+0.0335081 0.0942386 0.0398247
+-0.0729901 0.154042 -0.0338982
+-0.0233975 0.156883 -0.00572928
+-0.0873262 0.103661 0.0203534
+-0.0501055 0.129693 0.0310292
+0.029581 0.0907082 -0.0200166
+0.043329 0.066441 -0.000599376
+-0.00664168 0.0482162 -0.0304375
+0.021889 0.0963552 -0.0220144
+-0.0265893 0.161003 -0.00174275
+0.044803 0.0945847 0.0121616
+-0.0725608 0.109721 0.0409258
+-0.0372497 0.126436 -0.00264816
+0.005339 0.0971934 -0.026912
+-0.0241177 0.120704 -0.00972559
+-0.0462757 0.0390662 0.0448146
+-0.00565778 0.12946 0.000751082
+0.0213227 0.122349 -0.00385694
+-0.0414913 0.0790271 0.0430475
+0.0190905 0.127062 0.0195525
+-0.0805286 0.124537 0.0519983
+-0.0782836 0.0860139 0.0367982
+0.0219644 0.126042 0.013483
+-0.0325696 0.0410226 0.0505793
+0.0295979 0.039453 0.0274445
+-0.0475678 0.0446906 -0.0104074
+-0.0654918 0.0917539 0.043991
+-0.0307813 0.122738 0.0233033
+-0.0854845 0.112639 0.0445732
+0.0231366 0.0404268 -0.00664294
+-0.00398687 0.126095 0.0313534
+-0.0641503 0.0436305 0.0113748
+-0.0314872 0.0646167 0.0387865
+-0.0776274 0.0692865 0.00957677
+-0.0195579 0.0946763 0.0515134
+0.014517 0.0344542 -0.0117299
+-0.0376663 0.0621956 -0.0129723
+0.00459507 0.101613 0.0450146
+-0.0281642 0.0346776 -0.0203658
+0.0147654 0.125019 -0.0047274
+-0.0344283 0.0338921 0.0139586
+-0.0364985 0.117968 0.0313259
+-0.0456444 0.0592254 -0.0120696
+-0.0260288 0.0381935 0.00636573
+-0.088169 0.124336 0.0468831
+-0.0540681 0.135339 -0.00310003
+-0.0291607 0.171183 -0.0175503
+0.0104455 0.0488162 0.0487077
+-0.0881632 0.0861128 0.0124706
+-0.0258758 0.0578187 0.0391737
+0.00450037 0.0427385 0.0456181
+-0.0537204 0.0491564 0.0326591
+0.0388727 0.0645792 -0.00975725
+-0.0500679 0.0501277 0.0166633
+-0.0669104 0.120913 -0.00889891
+-0.036233 0.0469115 -0.0220883
+-0.0118859 0.163867 -0.0168515
+-0.0619905 0.129678 -0.00799355
+-0.0652279 0.0397522 0.0288372
+-0.0508809 0.104197 -0.0202021
+-0.00186382 0.104504 -0.0225214
+-0.0619023 0.120903 -0.00899386
+0.00323955 0.0754773 -0.0351385
+-0.0384934 0.105604 0.0386511
+-0.0905225 0.118622 0.0053153
+-0.0284893 0.0835322 0.0466293
+0.00823162 0.0387858 0.0309201
+-0.0616053 0.156855 -0.0285887
+-0.0508615 0.101367 -0.0215394
+-0.0318582 0.102916 -0.0222908
+0.00526525 0.0350275 0.0444668
+-0.0646344 0.0337755 0.00968147
+-0.0640121 0.136992 -0.00763419
+-0.0456074 0.0345826 0.0394197
+-0.0864043 0.111678 0.00530063
+-0.0207807 0.0581858 0.0468036
+-0.0608886 0.105445 -0.0177606
+0.0417928 0.0746499 -0.00676608
+0.0195225 0.0821843 0.0511684
+-0.0464961 0.0833304 0.0442498
+0.0164933 0.119532 0.0345952
+-0.0626731 0.158367 -0.0396045
+0.00725591 0.129807 0.000165614
+-0.0909094 0.114612 0.0400043
+-0.0496217 0.0532216 -0.00894483
+-0.0204558 0.0772045 0.0549311
+-0.0225647 0.184728 -0.0122995
+-0.0389284 0.111648 -0.0181691
+-0.0312712 0.125373 0.00251041
+-0.0157734 0.075693 -0.0388238
+0.0245364 0.0862451 0.0478999
+-0.0296756 0.125596 0.0148252
+-0.0446861 0.130064 0.0166863
+-0.0225936 0.0382891 0.00334965
+-0.0787949 0.0758277 -0.00557109
+-0.0665305 0.155586 -0.0523326
+-0.0631388 0.0620641 0.0242
+0.0275571 0.0875682 0.0452466
+-0.0838788 0.153353 0.0242347
+-0.0365497 0.124951 0.0226726
+0.0318595 0.0673315 0.0407335
+0.00950257 0.0896505 0.0545501
+-0.0597218 0.118329 0.0399103
+-0.0840037 0.0992695 0.0294026
+-0.0777723 0.0832737 0.0363717
+0.0427594 0.0986702 0.00117933
+-0.0422677 0.111306 -0.0177858
+-0.0762231 0.16043 -0.0125715
+-0.0634008 0.115527 0.0417242
+-0.036507 0.106984 0.0382357
+-0.0384749 0.0351927 -0.0135871
+-0.0744578 0.144386 -0.00789461
+0.0593202 0.0701868 0.012517
+-0.0226744 0.0522819 -0.0290541
+-0.0875766 0.122583 -0.000713178
+-0.0170034 0.127025 0.0015954
+-0.0705369 0.155342 -0.0479286
+-0.0709342 0.128224 -0.00904999
+0.00705252 0.0346309 0.0397936
+-0.0585604 0.133937 0.0364008
+-0.0863384 0.102179 0.00442425
+0.0107631 0.0671702 0.0541647
+-0.0695537 0.163673 -0.0146023
+-0.0452915 0.1298 0.0046882
+0.00836647 0.0494746 -0.0282442
+-0.0691053 0.0641529 -0.000471523
+-0.0065051 0.0518538 0.05236
+-0.0557789 0.0811944 -0.0212002
+-0.0801928 0.109885 0.0408487
+-0.0136098 0.0997657 0.0454373
+0.0375013 0.045461 0.0306904
+-0.0857877 0.152992 0.0221351
+-0.00139702 0.0346206 0.0416594
+-0.0501963 0.061364 0.033592
+0.0161097 0.0974052 -0.0230873
+-0.0194917 0.0568426 0.0483686
+0.0492985 0.0561391 -0.00508332
+0.0184753 0.100361 0.0464541
+-0.0504953 0.154968 0.0107183
+0.0147875 0.105075 -0.0193
+0.023524 0.11536 0.0341991
+0.0310013 0.118944 0.0140014
+-0.0172406 0.178621 -0.0252251
+-0.0367055 0.112873 -0.0174612
+-0.026888 0.0344315 -0.0290471
+-0.052616 0.0542078 0.012269
+-0.0374932 0.0478153 0.0397186
+-0.0727381 0.151148 -0.0398146
+0.0042421 0.0740405 -0.0347398
+-0.0170835 0.187214 -0.0216216
+-0.0744375 0.0658205 0.00791081
+-0.0225303 0.159751 -0.00283877
+-0.015413 0.0343578 -0.0194213
+0.0138178 0.034673 0.033937
+-0.0756035 0.0846721 0.0383975
+-0.0823671 0.0939609 0.0321712
+-0.0597053 0.0675469 -0.0111319
+-0.0911321 0.146088 0.0161475
+0.0350128 0.0797448 -0.0167143
+-0.0835371 0.151134 0.0310567
+-0.0125098 0.0759113 0.0569785
+-0.014877 0.12853 0.00563728
+-0.067594 0.162379 -0.0559888
+-0.0299722 0.0523401 -0.0183637
+-0.0175125 0.109971 0.0410978
+-0.0602175 0.0443014 -0.00489461
+0.047415 0.0539813 0.0314992
+-0.0695317 0.0366687 -0.00405392
+-0.0710533 0.04057 0.0057746
+-0.0594926 0.112518 0.0361699
+-0.0870454 0.128039 -0.000695727
+-0.0548606 0.0532734 -0.00439052
+0.0197584 0.121448 -0.00690816
+-0.0217284 0.0919768 0.0523353
+-0.0331407 0.073693 -0.0254949
+-0.0165233 0.0472885 0.0494939
+0.0430185 0.100102 0.00517011
+-0.0941673 0.124186 0.0242853
+0.0398988 0.106999 0.0131638
+-0.0388567 0.0985732 -0.0220835
+-0.013744 0.0347692 0.0478272
+0.0525444 0.0728335 0.00848027
+0.0340202 0.108707 0.0300072
+0.0135389 0.0341511 0.00148413
+-0.0255703 0.121939 -0.00698176
+-0.0627659 0.0795658 -0.0187488
+0.0159163 0.0366121 0.0434543
+-0.0677812 0.0823162 -0.0178553
+-0.00231448 0.129778 0.000344647
+-0.0224096 0.15809 -0.00961754
+-0.0369427 0.15804 0.00437449
+-0.0557441 0.0768187 -0.0193441
+-0.0661875 0.165349 -0.0586121
+-0.0764308 0.11585 0.051182
+0.00923994 0.0795457 -0.0327494
+-0.0141356 0.103403 -0.0235224
+-0.0725643 0.165173 -0.0170441
+-0.0708131 0.0922561 -0.0160967
+-0.052837 0.143168 0.022419
+-0.0289488 0.0487095 0.0453204
+-0.033511 0.104273 0.0404948
+0.0173468 0.0552065 -0.0282783
+-0.0643722 0.0392301 0.0399397
+0.0154605 0.100515 0.0471558
+-0.0389991 0.0361252 0.0429011
+-0.0912831 0.133698 0.0142161
+-0.042206 0.166657 -0.0103803
+-0.0829702 0.111001 0.0428895
+-0.0244677 0.122018 -0.00707965
+-0.00847955 0.107265 0.0437628
+-0.0410173 0.12678 -0.00403845
+-0.00247117 0.091392 -0.0349524
+-0.0733228 0.17276 -0.036126
+-0.0584972 0.102936 0.0420973
+-0.0275816 0.0549129 -0.0253866
+-0.0567567 0.0416998 -0.00856929
+0.00796329 0.0376774 0.0282412
+-0.0764966 0.130271 0.0529935
+-0.0385029 0.0346069 0.040918
+-0.0178242 0.0882801 -0.0380186
+-0.0592916 0.0381211 0.04617
+-0.0507734 0.0826521 -0.0214824
+-0.011501 0.0787467 0.0576654
+0.0135076 0.115425 0.0371825
+-0.0649944 0.132589 -0.00831046
+0.00449953 0.0474774 0.0501288
+-0.0183564 0.0639745 0.0512546
+-0.0454992 0.0425256 0.0437126
+0.00186325 0.0380873 -0.0138264
+0.0213321 0.100802 0.0450693
+-0.0855641 0.121149 -0.00272592
+-0.0898794 0.136494 0.0232114
+-0.0498262 0.0941747 -0.0218116
+0.0413792 0.0533854 -0.00680998
+-0.0912918 0.11477 0.0353243
+0.0585317 0.0565811 0.0212119
+0.000449556 0.130948 0.00412356
+-0.0343831 0.0766477 -0.0234928
+-0.0394659 0.108422 0.0377073
+-0.0477552 0.161949 -0.00697323
+-0.0278288 0.122593 -0.00568164
+-0.0563034 0.124125 0.0396482
+-0.0656415 0.129793 0.0454963
+0.0484031 0.0553841 0.03118
+-0.0455014 0.116621 0.0320048
+-0.0728613 0.102198 -0.0128504
+-0.0867252 0.0994863 0.00342747
+-0.00226785 0.0370021 0.0122687
+-0.0557143 0.0709328 -0.0156898
+-0.0610115 0.132585 -0.00747053
+0.00217526 0.0894962 -0.0338845
+-0.012585 0.0933765 -0.0350613
+-0.0553875 0.143884 0.0305002
+-0.0920989 0.117453 0.031314
+-0.0616144 0.155309 -0.0245851
+0.0502575 0.0602229 -0.00418894
+-0.0735402 0.0708078 0.0302704
+0.00614005 0.103026 -0.0213684
+-0.00271026 0.0669475 -0.0345168
+-0.049518 0.0344739 0.029929
+-0.0525731 0.128311 0.0345149
+-0.0605331 0.151186 -0.000375192
+-0.0866695 0.135213 0.0450386
+-0.0515626 0.0460585 0.0186779
+-0.00891802 0.0982381 -0.0280905
+-0.0170028 0.0977503 -0.0256286
+-0.0541413 0.128093 -0.005327
+-0.0234618 0.0385102 -0.00806272
+-0.0234875 0.125296 0.0010065
+0.0238248 0.0404881 0.03829
+-0.0564079 0.0334582 -0.0027528
+-0.0667678 0.0695012 0.0345692
+-0.00845839 0.0346349 0.045549
+-0.0748544 0.15611 0.0141114
+-0.0718277 0.141507 -0.00801564
+-0.0263582 0.120444 -0.00943021
+-0.0384861 0.0847024 0.0437961
+0.0154742 0.126309 -0.00212525
+-0.0329093 0.0461288 0.0451027
+-0.00179731 0.0390446 -0.00419837
+-0.0830843 0.0843065 -0.0045636
+-0.00849798 0.051815 0.0518583
+0.0211703 0.0458979 -0.0197309
+0.0250466 0.0534973 0.0413033
+-0.00301309 0.0994095 -0.0252863
+-0.0286636 0.0662687 -0.0294695
+-0.0275164 0.0588544 0.0372755
+0.021248 0.0707121 -0.0275992
+0.0118973 0.0699023 0.0540919
+-0.0850671 0.0831487 0.00248224
+0.0112963 0.123527 -0.00913288
+-0.0471043 0.0355495 0.00808039
+-0.0305886 0.0341169 0.0127308
+0.0232695 0.0795597 0.0495474
+-0.0781795 0.165241 -0.0349583
+-0.00548333 0.122374 0.0356916
+0.02636 0.0531741 -0.0208871
+-0.0117787 0.0784571 -0.0380559
+-0.0374622 0.0945463 0.043653
+0.0298506 0.0915959 0.0433109
+-0.063716 0.150986 -0.0306408
+-0.0915859 0.128175 0.00825933
+0.0456498 0.0806034 0.02116
+-0.0483119 0.0614742 0.035964
+0.0375235 0.0968947 -0.00979522
+-0.0923144 0.132364 0.0182222
+0.0175115 0.118187 0.0352964
+-0.027798 0.0824702 -0.0362167
+-0.0679219 0.123838 -0.00890383
+-0.0136906 0.0585033 -0.0353384
+-0.0560167 0.0334996 0.00451355
+-0.00170896 0.0655406 -0.0343993
+-0.0134843 0.053101 0.0504987
+-0.0675811 0.143978 0.0427672
+-0.0395371 0.165252 0.00310729
+-0.00177026 0.0987839 -0.0266092
+0.0449905 0.0917771 0.0161555
+-0.0142754 0.0385008 0.0265607
+-0.024936 0.0546494 -0.0284077
+-0.0737754 0.0849525 -0.0153987
+-0.00225491 0.0393816 0.0354457
+0.00953649 0.101759 0.0470503
+-0.030493 0.0731979 0.0402297
+0.0418277 0.0395362 0.0134182
+-0.0622707 0.058834 0.014793
+-0.0042883 0.0999626 -0.0238822
+-0.0511241 0.157581 -0.00475152
+-0.0110467 0.0382737 0.0183997
+-0.0111844 0.110115 -0.0206413
+-0.0906536 0.150215 0.0201223
+-0.0636975 0.0593607 0.0104272
+-0.00965605 0.0527028 -0.0331963
+0.011809 0.0846857 0.0540696
+-0.0439904 0.115156 -0.0158426
+0.00534103 0.0581999 -0.0308279
+-0.00449084 0.119679 0.0378771
+0.00251006 0.102973 0.0437486
+-0.0256326 0.0383152 0.00270994
+0.0101829 0.0893384 -0.0312282
+0.0359735 0.108741 0.0274101
+0.000505152 0.0675448 0.0563482
+-0.0431097 0.0335646 0.0052718
+-0.0748156 0.16245 -0.0339456
+-0.0890383 0.09964 0.0104144
+0.0425362 0.0972508 -0.000830625
+-0.0136711 0.162609 -0.0156561
+0.0241599 0.0418198 -0.00678118
+-0.0181519 0.16827 -0.0202389
+-0.0404977 0.0986657 0.0417206
+-0.0809707 0.15134 0.0022444
+0.0151979 0.0420601 0.0445385
+-0.00221102 0.0959857 -0.0316631
+-0.0329609 0.0709036 -0.0224656
+-0.079699 0.101798 -0.00757602
+-0.0725189 0.144585 -0.0159026
+-0.0466234 0.165492 -0.0068396
+0.0185106 0.12405 -0.00369129
+-0.014344 0.183095 -0.0226028
+-0.0788576 0.105851 -0.00657974
+-0.0240104 0.109837 -0.0203148
+0.00980942 0.110782 -0.0193656
+0.0108601 0.117776 0.0369396
+0.0193075 0.0536075 0.0470681
+-0.0925525 0.131032 0.0242364
+0.00749212 0.131495 0.0152913
+0.00495998 0.131626 0.0157979
+-0.00415159 0.0385426 0.00685716
+-0.0241881 0.038442 -0.0062907
+-0.0114972 0.0870124 0.0568248
+0.0383205 0.0589284 -0.00670105
+-0.050793 0.124044 0.0335488
+0.0216558 0.0436146 0.0415846
+-0.0488766 0.0663121 0.037594
+-0.0460367 0.115268 -0.015925
+0.0354061 0.0981387 0.0355669
+-0.0414966 0.064844 0.0412967
+-0.0492702 0.0334521 0.00412227
+-0.0788564 0.173596 -0.0449928
+-0.0720001 0.0374977 0.00101403
+-0.0745188 0.135846 0.0503978
+-0.0705133 0.0930254 0.0420143
+0.0544062 0.0520207 0.00120422
+-0.016347 0.159993 -0.0102438
+0.00949781 0.0440631 0.0448456
+-0.0123976 0.0991026 0.0482068
+-0.00535711 0.0347531 0.0461025
+0.026456 0.0929171 0.0454329
+0.0245089 0.042142 0.038636
+0.043716 0.0750115 0.0261739
+-0.0839359 0.102045 -0.00261805
+-0.0806754 0.155074 0.0150117
+-0.0689 0.172262 -0.0550342
+-0.0523543 0.073291 0.0414729
+-0.0301406 0.0636155 -0.0234264
+0.0407753 0.0452541 0.0299878
+0.00638455 0.0464233 -0.0264515
+-0.0755977 0.151334 -0.0218791
+-0.00594273 0.0383379 0.0139478
+-0.0600908 0.115373 0.0375616
+-0.0424965 0.0733822 0.0425454
+-0.00260003 0.0405608 -0.0253579
+0.00350637 0.0702767 0.0558823
+-0.0897267 0.135137 0.0262095
+-0.0591547 0.117476 -0.0120923
+-0.024542 0.0428919 0.0537128
+-0.0054972 0.0576157 0.054162
+-0.0397846 0.0841362 -0.0215764
+0.0415613 0.0751972 0.0301802
+-0.0631728 0.0596464 0.0174802
+0.0423363 0.101455 0.00317956
+-0.0533301 0.1416 0.0264013
+-0.0464855 0.0931347 0.0435353
+-0.0629725 0.150532 -0.00369044
+-0.0853889 0.108959 0.00634578
+-0.0909761 0.118636 0.00631645
+-0.0384966 0.101445 0.0410637
+0.0194941 0.107309 0.0406484
+0.0396169 0.0843072 -0.0127653
+-0.0223745 0.0566587 0.0441983
+0.0607493 0.059571 0.0121639
+-0.0844811 0.123027 0.0489478
+-0.0570341 0.144219 -0.00185162
+-0.0723674 0.177806 -0.0472523
+-0.0466801 0.130916 0.0233152
+-0.02246 0.183226 -0.0115124
+-0.0707386 0.165621 -0.0179174
+-0.0739884 0.1541 -0.0249038
+0.00161401 0.13159 0.0117114
+0.0295344 0.0524338 -0.0167463
+0.00137166 0.0465972 -0.0284573
+-0.0349979 0.152158 8.20736e-05
+-0.0459591 0.0424584 -0.0122548
+0.032247 0.0800194 -0.0194064
+-0.0215329 0.0768164 0.0540336
+0.0182351 0.12763 0.00640475
+0.0169629 0.0348939 0.0289563
+0.0193977 0.0490363 -0.0230642
+-0.0596322 0.0604401 0.0228281
+0.0145003 0.108488 0.0407955
+-0.0720741 0.0646161 0.00403373
+-0.0712116 0.15818 -0.0429219
+-0.0175993 0.15966 -0.00802789
+-0.0759222 0.159085 -0.0100036
+-0.0384682 0.15361 0.00387723
+-0.0725333 0.0379686 0.00575754
+0.0455601 0.0904134 0.011166
+0.0375907 0.0937201 -0.0111657
+0.00483671 0.039382 0.0314929
+-0.026559 0.0377408 0.0211248
+0.0385027 0.0454964 0.0307784
+-0.0564952 0.047766 0.0395183
+-0.0198831 0.107284 -0.0222237
+-0.0779551 0.163899 -0.0249456
+-0.0563521 0.0342791 0.0304121
+-0.00751948 0.0746046 0.0579524
+-0.0827498 0.154172 0.0128373
+-0.00710449 0.125174 0.0317411
+-0.0367613 0.0798086 -0.0204262
+-0.036915 0.175546 -0.00898243
+-0.0705043 0.0887655 0.0418556
+-0.0522651 0.0335597 0.0034159
+-0.0677174 0.0409231 -0.00173026
+-0.0113677 0.180126 -0.0253581
+-0.0161521 0.03911 0.0518105
+-0.0690092 0.122845 0.052951
+0.00570986 0.0341754 0.0182505
+0.0184933 0.0865452 0.0498488
+6.3531e-05 0.129314 -0.00119744
+-0.0804587 0.135827 0.0500319
+-0.0754196 0.111293 0.0461553
+0.0424555 0.0902012 0.0271644
+-0.0928081 0.120209 0.0412843
+-0.0634884 0.0789934 0.0424288
+-0.0615251 0.0457206 0.0316818
+-0.0115387 0.0458293 0.048671
+-0.066289 0.0747237 0.0389788
+-0.0173046 0.166847 -0.0129407
+0.0331853 0.116604 0.00769666
+0.0445518 0.069148 0.0246508
+-0.091691 0.12831 0.0342454
+0.0434619 0.0930961 0.0241585
+-0.0678925 0.0435809 0.00801004
+0.0234224 0.0519071 -0.0231048
+-0.0208141 0.0595795 0.0467936
+-0.087519 0.112 0.0410625
+-0.0213082 0.126358 0.00326486
+-0.0606822 0.0362429 0.0450162
+-0.0576914 0.0693962 -0.0144511
+-0.0769716 0.13837 -0.00578148
+-0.0653565 0.1551 0.00564588
+0.0264433 0.0485879 -0.0182655
+0.039746 0.101828 -0.00373788
+-0.0610724 0.144529 -0.00434459
+-0.0662237 0.145026 -0.0176812
+-0.0283728 0.156641 -0.000811787
+-0.00971651 0.0348541 0.0433186
+-0.00481466 0.0868424 -0.0368113
+-0.031088 0.0335574 -0.0273919
+-0.0544366 0.120435 -0.011246
+0.00248882 0.121002 0.0363406
+-0.00349433 0.0911707 0.0563818
+-0.0931447 0.118854 0.0382959
+0.0254683 0.121415 0.0262007
+-0.0467966 0.0336683 0.000813328
+0.0319522 0.103353 -0.0134365
+-0.0633409 0.155276 -0.011594
+-0.0720139 0.180999 -0.0528377
+-0.0164541 0.0630817 0.0527623
+0.016475 0.0352036 0.002978
+-0.00226088 0.124171 0.0334893
+0.0391263 0.0631992 -0.00875738
+-0.0818614 0.114723 -0.0022038
+-0.0930555 0.120208 0.0402916
+-0.0904236 0.116034 0.0273085
+-0.0705028 0.159578 -0.0459334
+-0.0862816 0.117641 0.0480424
+0.0531688 0.0733724 0.0176223
+-0.0578751 0.134121 -0.00585274
+0.0423147 0.091604 0.0271557
+0.0101515 0.071231 0.055077
+-0.0435318 0.087421 0.0430041
+-0.0560394 0.131064 -0.00575471
+0.00125071 0.0712122 -0.0347068
+-0.0348542 0.165303 -0.00316457
+-0.0860328 0.0912972 0.00145067
+-0.00116523 0.0371346 0.0178171
+-0.0637756 0.0795327 -0.0183843
+0.00482779 0.0366504 -0.0137865
+0.0435599 0.0987371 0.0131605
+0.00150087 0.101618 0.0443156
+0.0314312 0.0625198 -0.0186445
+-0.0672777 0.169987 -0.0338702
+-0.0903951 0.118903 0.0450094
+-0.0501563 0.11976 0.0326732
+-0.0750921 0.156856 -0.022942
+-0.0275197 0.109846 0.0382427
+-0.0535612 0.0416919 -0.00977582
+0.0556505 0.0677792 0.00213147
+-0.0685182 0.0368214 -0.0053939
+-0.0780099 0.114072 0.0486721
+-0.0248787 0.0796614 0.0530244
+-0.0638477 0.164736 -0.0283363
+0.0142201 0.0793919 -0.0305544
+0.00713749 0.130032 0.0237524
+-0.0187348 0.175696 -0.0167204
+-0.00682337 0.088234 -0.0365489
+-0.0217663 0.11209 -0.0186927
+-0.0171714 0.0432613 0.0521182
+0.00513012 0.0373402 0.0458408
+0.0461568 0.0626078 -0.00274862
+-0.0412659 0.160879 0.0033623
+-0.0853172 0.110382 0.0233555
+-0.0158006 0.108342 -0.0207487
+0.00813236 0.110171 -0.0197068
+0.0265802 0.0345508 0.0130494
+-0.0660018 0.133981 0.0432166
+0.041807 0.0885902 0.0288907
+-0.024509 0.109889 0.0396002
+0.0354948 0.10491 -0.00909103
+-0.00850916 0.0688709 0.0557558
+-0.054442 0.0373135 0.0469328
+-0.010539 0.0390893 0.0340058
+-0.0858022 0.150106 0.00719342
+-0.0451719 0.0347129 0.0411467
+-0.00510128 0.0385919 0.0229448
+-0.0521978 0.0336397 0.008764
+-0.0162925 0.180099 -0.0261659
+-0.0902934 0.147439 0.0121579
+-0.0793826 0.0705862 0.00854889
+0.0209269 0.0658956 0.0477693
+-0.0116051 0.171103 -0.0260001
+-0.0635102 0.151152 0.0361873
+-0.0865918 0.127084 0.0480364
+-0.0756208 0.166729 -0.0233779
+-0.0507818 0.0840955 -0.0217037
+-0.0623945 0.164686 -0.0405941
+0.0109143 0.034258 -0.00287102
+-0.0326136 0.0384639 -0.0154224
+-0.0883155 0.139178 0.0394996
+-0.0317158 0.0383538 -0.00403424
+-0.00682874 0.0896331 -0.0361816
+-0.060744 0.0766988 -0.0182193
+-0.00743574 0.129906 0.00405669
+-0.0792494 0.0723341 0.0207326
+-0.036173 0.152719 -0.00677506
+-0.0305128 0.10708 0.0396423
+-0.0435905 0.0505542 -0.0107756
+-0.0204554 0.0347978 0.0481157
+-0.0591045 0.0344689 0.0400978
+-0.0840365 0.147342 0.0364323
+0.00340018 0.0348289 -0.0229504
+-0.0693319 0.141141 0.045512
+-0.0561609 0.0344771 0.0355158
+0.00119588 0.0881146 -0.0344258
+0.0583564 0.0538008 0.0181861
+0.0342539 0.0387023 0.0236157
+-0.0264982 0.125984 0.010106
+-0.0611832 0.146298 -0.00395593
+-0.0910251 0.124245 0.0440568
+-0.089862 0.115281 0.0432597
+0.0247433 0.124313 0.0130924
+-0.000820873 0.128641 -0.00248283
+-0.0554557 0.0533368 -0.00338183
+-0.0464641 0.122081 0.0270508
+-0.0451868 0.126658 0.0224837
+0.00145793 0.0977369 0.0519067
+0.0405445 0.0610221 0.0298369
+-0.0744952 0.0941746 0.0398302
+-0.0351234 0.033632 -0.0282515
+-0.0839267 0.145982 0.00417548
+-0.0224934 0.0435545 0.0535652
+0.0159352 0.127804 0.0226817
+-0.0572144 0.154757 0.0232881
+-0.0498753 0.0336124 0.000239655
+-0.0191672 0.0596981 0.049368
+-0.0242921 0.0918773 0.0492675
+-0.0523718 0.133555 -0.00317026
+-0.0557218 0.0723836 -0.0166307
+-0.00457986 0.0361758 -0.0248798
+-0.0737533 0.0901294 0.040627
+-0.00549531 0.10728 0.0439307
+-0.0181568 0.165005 -0.0179156
+-0.0554997 0.108443 0.0389722
+-0.0144882 0.101623 0.0437286
+0.0215585 0.0387445 -0.00669407
+-0.0752039 0.0696978 0.0256249
+-0.0569183 0.115707 -0.0143002
+-0.0731283 0.155734 0.00889607
+0.0347498 0.081125 -0.0176886
+0.00113903 0.131571 0.0129682
+-0.0279379 0.155215 -0.0039665
+0.0438288 0.0860483 -0.00379124
+-0.0202818 0.0386671 -0.01315
+-0.0639713 0.0651159 0.0301523
+-0.0729034 0.123797 -0.00826534
+-0.00948854 0.0965445 0.0534324
+-0.0616146 0.158432 -0.0255892
+0.0348698 0.112104 0.0254475
+0.0462561 0.0792459 0.0151754
+0.0132092 0.0348336 0.0300558
+-0.0650018 0.0435996 0.0108034
+-0.0629926 0.156114 0.0183129
+0.0432806 0.100121 0.0101615
+-0.0634166 0.118511 0.0453283
+-0.0718747 0.151003 0.0373736
+-0.0693203 0.155248 -0.0509683
+-0.058528 0.0400924 -0.008802
+0.0150592 0.0590177 0.0497649
+-0.0136861 0.0570325 -0.0345667
+-0.02332 0.0391695 0.0384733
+0.0410592 0.0985428 -0.00379645
+-0.042915 0.0436274 -0.0183221
+-0.0324875 0.068969 0.0402984
+-0.0927384 0.122733 0.00927055
+-0.0697859 0.156365 0.01735
+-0.0525617 0.0403541 -0.0109145
+-0.0163792 0.186908 -0.0208435
+0.00555045 0.034504 0.00513967
+0.0259201 0.0406241 0.0333279
+0.0340795 0.103399 0.0336714
+-0.0295185 0.0579228 -0.0214101
+0.0443631 0.0475049 -0.00446946
+0.00261537 0.0341134 0.0122343
+-0.0104909 0.104437 0.0435533
+0.0240885 0.124582 0.018553
+-0.084606 0.0993653 -0.00159598
+0.0315994 0.0505647 0.0349136
+-0.0887091 0.0983318 0.0213821
+-0.0109917 0.177231 -0.0295208
+-0.00927372 0.0384768 0.00588152
+-0.0731505 0.0794744 -0.0135813
+0.0377774 0.0672774 -0.012792
+-0.0257539 0.157476 -0.0102144
+-0.0524923 0.0340498 0.0261507
+0.0359032 0.0905437 -0.0158269
+-0.0358241 0.0900699 -0.0240653
+-0.0507764 0.0715485 0.0397729
+-0.0857724 0.0872268 -0.000524277
+0.0122145 0.0850407 -0.0307351
+-0.0818191 0.154205 0.0234297
+0.0239009 0.12202 -0.0014718
+0.0509663 0.0446851 0.0122122
+0.0405026 0.0469928 0.0315524
+0.00123226 0.0769082 -0.0355253
+0.0395203 0.0569025 0.0311403
+-0.0861982 0.144641 0.0372484
+-0.0218898 0.0382146 0.0234539
+0.0278568 0.0643129 -0.0209613
+-0.06664 0.0601639 0.0127094
+-0.0682452 0.17678 -0.058273
+-0.0326534 0.0578275 -0.0120318
+0.0449519 0.0847263 0.00223902
+-0.0243874 0.0379977 0.0213348
+-0.0375049 0.0648832 0.0416292
+-0.049486 0.0531643 0.034537
+-0.00680823 0.0840973 -0.0379387
+-0.00662043 0.0383357 0.0156226
+0.0246827 0.0347978 0.0179097
+0.052528 0.0664738 0.0271694
+-0.017323 0.112508 -0.01916
+-0.0589359 0.0481542 0.00467247
+0.0560814 0.0704234 0.0216351
+0.0445162 0.087501 -0.00181141
+0.0204668 0.0400207 -0.013702
+-0.0828557 0.0979824 0.0311146
+0.0393677 0.0547517 -0.00623241
+-0.0301563 0.0382285 0.0524978
+-0.0740972 0.155492 -0.0239137
+-0.0266047 0.0397022 -0.0293069
+0.0044664 0.0344032 0.010526
+-0.0644057 0.16752 -0.0356951
+-0.085796 0.123875 -0.00272102
+-0.0251727 0.175641 -0.0195733
+-0.0147266 0.0922559 -0.0359307
+0.0166529 0.120978 0.0330533
+-0.0652865 0.1555 -0.0467797
+-0.0622893 0.15065 -0.0135783
+-0.0173344 0.128368 0.0119773
+-0.044366 0.0366412 -0.0232589
+-0.0913152 0.114759 0.0363194
+-0.0647364 0.118589 0.0486106
+0.011956 0.0976358 -0.0233787
+-0.0378922 0.04725 -0.0183117
+-0.079848 0.116269 0.0487575
+0.0431642 0.0987038 0.0171581
+-0.0334777 0.0546734 0.0376709
+-0.0677151 0.171772 -0.0397619
+-0.0124935 0.123722 0.0323282
+-0.00945147 0.0352364 0.0483453
+-0.0729035 0.125275 -0.00849683
+-0.0837744 0.107497 0.00138169
+-0.0529962 0.0461208 0.0157076
+-0.0677529 0.141137 0.0442717
+-0.0840303 0.151908 0.0287412
+-0.0636039 0.0445634 0.0326846
+0.0192911 0.109605 -0.016128
+-0.0838969 0.104764 -0.000610535
+-0.0887185 0.143427 0.0331607
+-0.0929968 0.130998 0.0182299
+-0.0543463 0.160987 0.00512087
+-0.0909281 0.132287 0.0082314
+-0.0354987 0.113848 0.0338946
+-0.0465077 0.088954 0.0443573
+0.0301352 0.0955658 0.0419698
+-0.0199202 0.0381456 0.0185107
+-0.0186134 0.161522 -0.0143726
+-0.0646921 0.0617226 0.0224003
+0.0222832 0.066418 -0.0268569
+-0.0661617 0.0353568 0.0288449
+0.0192795 0.122165 0.0310901
+-0.00560235 0.0406015 -0.0258376
+-0.0404738 0.108409 0.038128
+0.0420248 0.0710795 0.0289899
+0.0450277 0.0945898 0.0071675
+-0.0490784 0.153156 -0.00527602
+-0.00149713 0.0689596 0.0566805
+-0.0709057 0.106531 -0.0119068
+-0.0626824 0.0436041 -0.00418427
+-0.066536 0.166455 -0.0250024
+-0.0218698 0.104438 -0.0229686
+-0.0731886 0.149857 -0.036868
+-0.0122347 0.0392642 0.0504717
+-0.0935435 0.118764 0.0233045
+-0.0797382 0.10948 0.0394939
+-0.0892801 0.091541 0.0104497
+-0.0547119 0.146209 0.0284156
+-0.00241231 0.037367 0.0100902
+0.000818555 0.130756 0.00282721
+0.04586 0.0820013 0.00419826
+-0.0250963 0.0348756 0.0487637
+-0.0673565 0.112647 0.0446949
+-0.0634506 0.15272 2.24523e-05
+-0.0706828 0.180611 -0.0569213
+-0.0205931 0.163965 -0.00888333
+0.0115331 0.101889 -0.0218781
+-0.0664983 0.102849 0.0407048
+0.0185027 0.118159 0.035136
+0.0458454 0.0834099 0.00517797
+-0.00887527 0.109466 -0.0219533
+-0.0858669 0.119072 -0.00140229
+-0.0102872 0.0344076 -0.0184603
+-0.0211482 0.169745 -0.0200914
+-0.00849115 0.111421 0.0423213
+-0.0613599 0.128292 0.04114
+-0.0076798 0.0569676 -0.0334142
+-0.0710297 0.16381 -0.0459687
+-0.0454992 0.112558 0.0357052
+-0.0343115 0.126654 0.00282732
+0.0360267 0.110062 0.0258818
+0.0368044 0.0942002 -0.0116901
+-0.0421812 0.123012 0.0251172
+-0.066012 0.139954 -0.00779963
+0.00198723 0.123051 -0.0105036
+0.0172553 0.072257 -0.0294021
+-0.013113 0.184484 -0.0260544
+-0.072893 0.152634 -0.0368963
+-0.0938278 0.128299 0.0222532
+-0.0675171 0.0409229 0.0105489
+-0.0735479 0.162209 -0.012171
+-0.0517008 0.0626767 0.0322349
+-0.0433082 0.037957 -0.0253239
+-0.0516781 0.0345962 0.0381142
+-0.0046354 0.0467251 -0.0296701
+-0.0777504 0.112676 -0.00382147
+-0.0281162 0.181397 -0.0109687
+-0.047699 0.144615 0.00435323
+-0.0663959 0.148276 0.0393784
+-0.0249816 0.15956 -0.0126947
+-0.00758477 0.0968518 -0.0305822
+-0.019536 0.116371 -0.0152209
+-0.0298632 0.102958 -0.0228236
+-0.0224181 0.05387 0.0440179
+-0.0625128 0.145366 0.0377954
+-0.0843383 0.133967 0.0484219
+-0.00452146 0.0443187 0.0472734
+0.000177098 0.0839833 -0.0361114
+0.0207016 0.113271 -0.0140876
+-0.065484 0.0847424 0.0442074
+-0.0201913 0.175663 -0.0226485
+-0.0364476 0.166788 -0.00019754
+-0.0206091 0.162049 -0.0149623
+0.0350254 0.0700182 0.0383083
+-0.0455491 0.131451 0.0178282
+0.00819795 0.130005 0.00128654
+-0.0353536 0.12061 0.029103
+-0.0271732 0.169704 -0.0183584
+-0.0657382 0.0436129 0.0101245
+-0.0722291 0.166627 -0.044985
+0.0309191 0.0539829 -0.0147501
+-0.0308747 0.056662 -0.0163864
+-0.0867734 0.123909 -0.00174219
+-0.0279078 0.0347965 0.0447705
+0.0191594 0.100268 -0.0222959
+-0.0154293 0.0382918 0.0211029
+-0.0578159 0.0636603 0.0309898
+-0.024177 0.172689 -0.0201134
+-0.0669849 0.0359436 0.0326963
+-0.0879792 0.086094 0.00648058
+-0.0181742 0.169737 -0.0210312
+-0.0170499 0.122405 0.0312344
+0.00906582 0.123154 0.0343752
+-0.034503 0.0874637 0.0428605
+0.0391693 0.108394 0.0111647
+-0.0917004 0.143358 0.0201656
+0.027747 0.0902677 -0.021551
+0.0430843 0.0496743 0.0322331
+-0.0791989 0.150078 -0.000876106
+-0.0259631 0.177171 -0.00957335
+-0.0395279 0.079033 0.0429651
+0.0302372 0.118499 0.00231637
+0.0449793 0.061326 -0.0034541
+-0.0376334 0.0548474 -0.0107543
+-0.0274342 0.111364 -0.0178958
+-0.0315627 0.048073 -0.0232988
+-0.018823 0.121694 -0.0088173
+0.00895989 0.0979651 -0.0237371
+-0.0254423 0.0473682 0.0503166
+-0.046654 0.0606571 -0.0123502
+0.0606526 0.0595573 0.0131644
+-0.0873547 0.094105 0.00537923
+-0.0202891 0.184471 -0.0210772
+-0.093713 0.126863 0.0152623
+0.00938205 0.0449001 -0.0251557
+-0.0903092 0.140666 0.025165
+-0.0676501 0.0667159 0.0297862
+-0.0164899 0.0602176 0.0520938
+0.019355 0.0565693 -0.0275356
+0.0104604 0.0340987 0.00091581
+-0.0785409 0.166665 -0.0309637
+-0.018017 0.0390618 0.0526069
+0.0189962 0.123953 0.0281041
+-0.0814357 0.0734392 0.00553468
+-0.0223732 0.03801 0.0163235
+0.0110271 0.112101 -0.0187639
+0.0456518 0.0904151 0.00617296
+-0.0789509 0.170805 -0.0389931
+-0.0312407 0.0510927 0.0390643
+0.0359235 0.106756 -0.00582268
+-0.0815808 0.0950721 -0.00753639
+-0.0849546 0.0871617 -0.00253673
+-0.0265403 0.0592021 0.0383808
+0.0398305 0.0739567 0.0329917
+-0.00085919 0.0358547 0.00813469
+-0.0747624 0.0700921 -0.00148683
+0.0313786 0.113275 -0.00606229
+-0.0902327 0.124018 0.00527185
+0.0268091 0.0506065 0.038521
+-0.0727909 0.0685075 0.0271607
+-0.0578274 0.0666818 0.0354001
+-0.0738208 0.0921589 -0.0148323
+-0.0390631 0.127858 0.0143467
+-0.00922314 0.174168 -0.0285672
+-0.0035205 0.039017 -0.00265492
+0.0435098 0.098719 0.0141568
+-0.0493916 0.144765 0.00938332
+0.0189816 0.0563976 0.0484166
+-0.0731928 0.064943 0.0125198
+0.0453289 0.0833826 0.0211694
+-0.0211162 0.1638 -0.0163957
+-0.0306102 0.125527 0.00421635
+-0.0262987 0.113585 -0.0162365
+0.0252163 0.1238 0.0175509
+-0.0237403 0.0669252 -0.0352956
+-0.00549562 0.0472961 0.0485942
+0.0045023 0.122399 0.0348631
+-0.0701614 0.178224 -0.0493215
+-0.0173769 0.125333 -0.00267782
+-0.0470115 0.129603 0.00120357
+-0.0317094 0.0374952 0.0310681
+-0.0297217 0.0382812 -0.0035606
+-0.0415986 0.169934 0.00129157
+-0.064505 0.152553 -0.0362048
+-0.0667255 0.178008 -0.0524224
+-0.0236086 0.0335974 -0.0240827
+-0.0156885 0.0555599 -0.0339026
+0.0182783 0.0708328 -0.0291795
+0.0541184 0.0510309 0.0235647
+-0.0765193 0.119025 0.0524244
+-0.0118673 0.0339713 -0.0202424
+0.00548892 0.118228 0.0378342
+-0.067477 0.0336926 -0.00520632
+0.0168316 0.0926978 0.0490711
+0.0255432 0.0768418 0.0475089
+-0.0617634 0.0795901 -0.0189973
+-0.0156786 0.0526029 -0.032522
+0.000420458 0.036172 -0.0244623
+-0.0256593 0.0810401 0.0523557
+0.026836 0.0634537 -0.0220606
+-0.0621975 0.166246 -0.0505873
+0.0578529 0.0523616 0.0171842
+-0.0217254 0.126122 0.00269746
+0.0235742 0.124212 0.0226421
+-0.0578055 0.0883401 -0.0213124
+-0.0798409 0.103395 0.0321858
+-0.0123464 0.178658 -0.023274
+0.0212154 0.0476501 0.0409677
+-0.0342487 0.0752311 -0.0224883
+-0.0230529 0.0839079 0.0553134
+-0.0214993 0.112665 0.0388138
+-0.0327955 0.0873016 -0.0254019
+0.0258836 0.0605349 0.0443599
+-0.0096598 0.0907753 -0.0363722
+0.0450284 0.0875565 0.0211548
+0.0334239 0.0414863 -0.00351395
+-0.0488087 0.138617 0.0133952
+-0.0658054 0.0924099 -0.017991
+0.0104979 0.0896334 0.054299
+-0.0043048 0.123153 -0.010566
+-0.0174665 0.17272 -0.016673
+-0.0344763 0.0561322 0.0383021
+-0.0857072 0.152777 0.0118249
+-0.0575671 0.0494422 0.00671449
+-0.0430533 0.0345113 0.0330204
+-0.065164 0.147357 -0.0239331
+-0.0326268 0.0520227 -0.0107626
+-0.067905 0.106631 -0.013438
+-0.0258738 0.125824 0.0147443
+0.0544233 0.0635568 0.0276516
+-0.0872747 0.139127 0.00719289
+-0.0315055 0.109789 0.0377033
+-0.0763386 0.161799 -0.0152953
+0.0232414 0.0663429 -0.0257954
+0.0174948 0.109841 0.0394103
+-0.0507289 0.129704 0.0318965
+-0.0425042 0.0577064 0.0400486
+0.022545 0.0955327 0.0468247
+0.0403951 0.0475373 -0.00531603
+0.0183271 0.0475932 -0.02269
+-0.0572639 0.0601869 -0.00219809
+-0.0852337 0.104506 0.0248257
+-0.0933098 0.126856 0.0132534
+0.0352918 0.108619 -0.00504659
+-0.0628349 0.0939281 -0.0188357
+0.00277101 0.099815 0.0475918
+-0.0637196 0.147938 -0.020833
+-0.0636347 0.156368 -0.0124044
+-0.0882602 0.111934 0.0373837
+0.0451564 0.0931924 0.00517592
+-0.0883906 0.0874807 0.0144622
+-0.0179879 0.0654395 0.0522544
+-0.0334338 0.0382234 0.0500909
+-0.00283875 0.0389996 -0.00436591
+-0.0295052 0.11528 0.03366
+-0.00151332 0.104469 0.0441334
+0.0194927 0.0906432 0.0481529
+-0.0877693 0.113692 0.0289151
+-0.0661933 0.0335338 -0.00299624
+-0.0273899 0.0499801 0.045145
+-0.0338474 0.0972112 -0.023083
+-0.075849 0.149415 0.0390624
+0.0325609 0.114759 0.0260072
+-0.0821806 0.0776422 0.0235195
+-0.0759474 0.151351 -0.0188826
+0.013384 0.043414 -0.024368
+-0.0077421 0.0340597 -0.0195129
+-0.00965525 0.0511768 -0.0320162
+-0.0677487 0.111258 0.0407689
+-0.0214969 0.0461967 0.0522939
+-0.0466073 0.0518764 -0.00969859
+0.0357625 0.0364791 0.0131618
+-0.0124847 0.111379 0.041672
+-0.079194 0.0832222 0.0349745
+-0.0926331 0.130966 0.0142325
+0.00419789 0.123154 -0.0106599
+0.00969178 0.121836 0.0352946
+-0.0295306 0.123946 -0.00125424
+-0.0711733 0.128436 0.0516087
+-0.0585141 0.0386878 -0.00928985
+-0.0739244 0.0668664 0.00165643
+-0.0424856 0.0410553 0.0431368
+-0.0176939 0.162435 -0.0154936
+-0.00215916 0.0369163 -0.0154166
+0.0205271 0.126116 0.00440152
+0.000359464 0.0907103 -0.0342066
+0.038908 0.0631632 0.033303
+0.0223132 0.124739 0.023599
+-0.070737 0.159582 -0.0449318
+-0.0281334 0.155101 -0.00344078
+0.0323761 0.107397 0.032947
+0.0390072 0.0393837 0.00207442
+0.0420748 0.0457918 0.0297783
+-0.0187683 0.0699858 -0.0381989
+0.0176298 0.0382941 -0.0187111
+-0.0688111 0.0922897 -0.0164711
+0.0419266 0.101462 0.0171593
+0.00341059 0.0376223 -0.0244648
+0.0461634 0.0792418 0.0171768
+-0.0637535 0.0431846 0.0296789
+-0.0273632 0.0534705 -0.0254085
+-0.0394955 0.0562825 0.0399491
+0.00548498 0.0590856 0.0545593
+-0.0934182 0.124107 0.0122673
+0.0324897 0.100233 -0.014155
+-0.00952254 0.0688375 0.0554289
+0.0191204 0.042209 0.0431814
+0.0195848 0.035993 0.00660837
+-0.0748916 0.10354 -0.0108565
+-0.0685642 0.0406581 -0.00126009
+-0.0225344 0.118142 0.03379
+-0.013583 0.0386256 -0.002471
+-0.0898618 0.113382 0.0394321
+0.0601893 0.0595178 0.0171788
+-0.0630097 0.121328 0.0458592
+-0.0196415 0.0725672 0.0536854
+-0.0211896 0.172692 -0.021286
+0.024653 0.104647 -0.0168345
+-0.0795268 0.096746 0.0348816
+0.0485163 0.0672488 0.000612911
+0.0400064 0.0422019 -0.00166327
+-0.0197891 0.0785016 -0.0390423
+-0.0260568 0.0375908 -0.0291887
+-0.00717802 0.130589 0.0142265
+0.0156678 0.0346738 -0.0117297
+0.0424576 0.0845381 -0.00679736
+-0.0302701 0.0365155 -0.0302567
+-0.0274598 0.0863801 0.0483431
+-0.0831854 0.11075 0.0323354
+-0.0514986 0.109783 0.0378241
+-0.0183396 0.126605 0.021835
+-0.0497522 0.0716181 0.0399477
+0.0165016 0.116787 0.0362663
+-0.0670324 0.0672056 0.0312385
+0.0201473 0.0414664 -0.0187017
+0.0364932 0.0484054 0.0314672
+-0.0501327 0.159092 -0.00542351
+-0.0752763 0.0667216 0.0105318
+-0.0341695 0.0337715 0.0105094
+0.0137891 0.103175 -0.021246
+-0.073587 0.148629 -0.0261691
+-0.0169441 0.184483 -0.0249355
+-0.0097273 0.130072 0.0104159
+-0.00405402 0.0391419 -0.01222
+-0.0887371 0.0955614 0.00743378
+-0.0864769 0.0806081 0.0125015
+0.040053 0.107027 0.0101639
+-0.042812 0.14778 0.00347562
+0.0248383 0.0835695 -0.0246296
+0.0277899 0.116538 -0.00556904
+-0.0291577 0.0380555 0.005854
+-0.0525571 0.150877 0.0178
+-0.0639921 0.134062 -0.00777265
+-0.0838901 0.110998 0.0281595
+-0.0134922 0.107228 0.0429665
+-0.0586918 0.149676 0.0345486
+-0.0616651 0.119834 0.0424717
+0.0456475 0.0890064 0.00517807
+-0.0089791 0.0383636 0.0133044
+-0.0903646 0.135051 0.0122148
+0.0317594 0.0835691 0.0424885
+-0.0240368 0.11082 -0.0193477
+0.0271768 0.112761 0.0342135
+-0.0356473 0.116902 -0.0136714
+-0.0739197 0.151223 0.0366634
+0.0410535 0.0759945 -0.00777525
+-0.0734182 0.169757 -0.0275332
+-0.00232938 0.0359607 0.0474459
+-0.085737 0.110915 0.0387737
+-0.0775985 0.123137 0.0521223
+-0.0748309 0.100681 -0.0121692
+-0.0866976 0.109058 0.0133472
+-0.0701875 0.0395708 0.00901355
+-0.0306891 0.120328 -0.00923215
+-0.045477 0.1214 -0.012376
+-0.033489 0.172734 -0.00156283
+-0.0565822 0.0339881 0.0253464
+-0.0404955 0.0451407 0.0414639
+-0.0555537 0.0420256 -0.00889368
+-0.0598777 0.102599 -0.0186645
+0.0592051 0.0552531 0.0121703
+-0.0758111 0.0741872 -0.00760517
+-0.038197 0.0342285 0.0289964
+-0.00312706 0.0390512 0.0319597
+0.0476183 0.0426691 0.0171605
+-0.0306281 0.0831438 0.0423752
+-0.049274 0.1386 0.00640083
+-0.0210747 0.0753924 0.0536136
+-0.093596 0.126936 0.0252692
+-0.0629825 0.129686 -0.00825839
+0.00470729 0.128083 -0.0039713
+-0.0335515 0.0373466 -0.0164398
+0.0425502 0.0637218 0.0280932
+-0.0707401 0.13973 0.0469958
+-0.0644842 0.0804582 0.0430441
+-0.0618671 0.112377 0.0367302
+-0.0698247 0.169548 -0.0276555
+-0.0863191 0.0806082 0.0115067
+-0.0216814 0.0523409 -0.0297011
+0.0377238 0.110496 0.0121805
+-0.0689171 0.158096 -0.0529848
+-0.067181 0.156627 -0.0534662
+-0.0268045 0.0811284 -0.0369845
+-0.0546722 0.139567 0.0297056
+-0.0554146 0.0649279 0.0339175
+-0.0193967 0.186852 -0.0171886
+-0.0357817 0.0351096 0.0179926
+-0.0718839 0.173642 -0.0520314
+-0.0409497 0.0337305 -0.016439
+0.0396966 0.105593 0.0211678
+-0.0789279 0.0699144 0.0158521
+-0.0414163 0.0476371 -0.0122303
+-0.00671791 0.0642099 -0.0355692
+0.0547677 0.0509942 0.0227339
+-0.0686614 0.0735088 -0.0131618
+-0.0738123 0.0655371 0.0172042
+-0.0904479 0.129526 0.00625875
+0.0197334 0.044328 -0.0216983
+-0.0896348 0.140659 0.0301806
+-0.00748945 0.0870384 0.0571349
+0.0217161 0.119158 -0.00841047
+-0.0545346 0.125365 -0.00640975
+0.0368294 0.108237 -0.00182731
+-0.0672538 0.152901 0.0344187
+-0.0807043 0.0827741 -0.00656651
+-0.0305099 0.113915 0.0346878
+-0.0721764 0.154012 -0.0399025
+-0.045061 0.130334 0.0180279
+-0.00652053 0.0688834 0.0561767
+-0.0444953 0.0817848 0.0424707
+-0.0874489 0.105009 0.0173545
+-0.0175711 0.0387182 -0.00892429
+0.000506539 0.0883906 0.0565122
+-0.0265193 0.12549 0.0159805
+-0.0464789 0.0917181 0.0434263
+0.0455125 0.0918121 0.0101608
+-0.0834627 0.110719 0.0412267
+-0.057205 0.0480928 0.032667
+0.00517049 0.0350387 0.0228068
+0.0457999 0.0820138 0.0191697
+-0.0420324 0.171559 -0.00171063
+-0.0475118 0.128596 -0.00180437
+0.0204841 0.0948066 0.0474378
+-0.0719895 0.163815 -0.0429694
+-0.0644943 0.0861671 0.0446171
+0.00851416 0.06604 0.0550264
+-0.0670308 0.141141 0.0435296
+-0.0848818 0.142006 0.0416598
+-0.0384808 0.106985 0.038039
+0.0180116 0.0754634 0.0524537
+-0.0725251 0.155433 -0.0349062
+0.0182337 0.128007 0.0135344
+-0.0233093 0.162498 -0.00577898
+-0.0850563 0.112998 0.00231897
+-0.0823398 0.145942 0.00119384
+-0.0852211 0.103481 0.00138673
+-0.071875 0.136886 0.0488574
+-0.0794627 0.138625 0.0485832
+-0.0435009 0.117967 0.030956
+-0.038588 0.0341641 0.0271976
+-0.0408255 0.0914222 -0.0231618
+-0.0551021 0.154591 -0.0020359
+-0.0748456 0.159073 -0.00827714
+-0.0621666 0.152205 -0.0155784
+-0.0494972 0.0776899 0.0438666
+0.00751862 0.0799738 0.0554444
+0.00532494 0.0625045 -0.0319907
+0.00237701 0.131635 0.0162813
+-0.0546261 0.151324 0.0271982
+-0.0236176 0.123316 0.0244011
+0.00251869 0.05336 0.0534808
+0.0225511 0.0888829 0.0485585
+-0.0370273 0.174099 -0.0109221
+-0.090997 0.129691 0.0382289
+-0.0732672 0.148476 -0.0292583
+-0.053498 0.0465766 0.0420409
+-0.0330184 0.0474571 0.0438647
+-0.0246064 0.033636 -0.0243161
+-0.0234471 0.125053 0.0200484
+-0.0830784 0.138234 -0.000100609
+0.0406549 0.0820323 0.0324674
+-0.0842996 0.0965857 0.0297797
+-0.0527544 0.03448 0.0379838
+-0.0799451 0.15529 0.0167266
+-0.057093 0.0521243 0.00061739
+0.0154036 0.0477404 -0.0246897
+-0.060782 0.082481 -0.019648
+-0.0700267 0.166609 -0.0500213
+0.0451823 0.091796 0.014161
+0.0346837 0.106039 0.030986
+-0.0396713 0.0621627 -0.012718
+-0.05111 0.0375368 0.0465746
+-0.0688918 0.119449 -0.00874323
+0.000197079 0.035652 0.0464555
+-0.00149822 0.0661867 0.0567241
+0.00350858 0.074484 0.056374
+-0.0284992 0.0703316 0.0397848
+-0.0555164 0.0482866 0.0387265
+-0.0908309 0.136473 0.0182032
+-0.0634905 0.0861851 0.0447067
+-0.00918339 0.033864 -0.0215021
+-0.0748916 0.123775 -0.00787892
+-0.0270496 0.033483 -0.0265278
+0.00488911 0.035483 -0.0145807
+-0.0442085 0.165146 -0.00911238
+-0.0322103 0.0386054 -0.0136114
+0.0190336 0.11528 0.0364777
+-0.000494586 0.0897644 0.0562541
+-0.0350004 0.157209 -0.0112204
+-0.0635638 0.147341 -0.0176577
+-0.0902987 0.121315 0.00530766
+-0.0705068 0.102745 0.0389474
+-0.0662636 0.175335 -0.0598585
+-0.0239792 0.0680021 0.045464
+0.0413142 0.0637288 -0.00386959
+-0.051889 0.108419 -0.0189045
+-0.0477652 0.131125 0.00158524
+-0.0400469 0.169775 -0.0108504
+-0.0755266 0.109807 -0.00760163
+0.00107791 0.130709 0.0215491
+-0.0655994 0.0349763 0.0155159
+-0.0628742 0.161547 -0.05443
+0.0359645 0.0981106 0.0346243
+0.00934693 0.129002 0.0260013
+-0.0768843 0.109139 0.0404116
+-0.010503 0.0674297 0.0550101
+-0.028646 0.0535523 0.0364431
+-0.072824 0.0936306 -0.0150907
+0.028615 0.035804 0.0196241
+0.0282076 0.0706829 -0.0227535
+0.0596824 0.0622541 0.020173
+-0.0025152 0.0575969 0.0540026
+0.000110958 0.036978 0.020027
+-0.0273656 0.0360131 -0.0296152
+-0.0624735 0.0344952 0.0183787
+-0.0360892 0.159232 -0.0124312
+0.0418577 0.100066 0.0211691
+-0.063571 0.122754 0.0468224
+0.0523857 0.0624129 -0.0025136
+0.0383109 0.0632029 0.0342252
+-0.0144971 0.0786767 0.0566892
+-0.0928565 0.129591 0.0132418
+-0.0681034 0.152856 -0.0481556
+-0.0746787 0.169356 -0.0440586
+-0.0335137 0.107031 0.0389932
+0.0424926 0.0583469 0.0313486
+-0.0223256 0.0637459 0.0453694
+-0.0648797 0.106687 -0.0146649
+0.0250125 0.0632249 0.0448766
+-0.0624284 0.159959 -0.0405984
+0.00349445 0.12099 0.0360851
+0.022067 0.0981797 0.0461337
+-0.0734899 0.123206 0.0535424
+-0.0321688 0.171168 -0.015915
+-0.0848969 0.106313 0.0233612
+-0.067172 0.174543 -0.0467986
+0.0246727 0.0884534 -0.0236513
+-0.0504949 0.0477308 0.0397221
+-0.064202 0.155431 -0.0413859
+0.00347944 0.095162 0.0537659
+0.0105108 0.100431 0.0479236
+0.021311 0.123415 0.0275211
+0.0415141 0.104253 0.009162
+-0.0617635 0.0387159 0.0237173
+-0.0044982 0.0952431 0.0547633
+0.0398123 0.066053 -0.00878746
+-0.00271622 0.0627636 -0.0349069
+-0.00914442 0.0387021 0.000210725
+-0.0814422 0.106028 0.0294684
+-0.0136643 0.0922643 -0.0359313
+0.0420557 0.0676716 -0.00377172
+-0.0364793 0.0945677 0.0439429
+-0.05033 0.0517928 0.0340061
+-0.0470088 0.130577 0.00217989
+-0.0286777 0.158132 0.000508817
+0.0185266 0.0345532 0.000246197
+-0.0147199 0.184604 -0.0232088
+-0.0384921 0.111131 0.0361977
+-0.0384978 0.102835 0.0403416
+-0.0215751 0.0667511 0.0487462
+-0.0887264 0.0996152 0.00841821
+-0.060662 0.0644224 -0.00688354
+0.0397235 0.080129 -0.010751
+-0.0136601 0.0389486 0.0334846
+-0.0106876 0.129553 0.00573838
+0.00810435 0.0348429 0.0181346
+0.0256081 0.104449 -0.0166247
+-0.0682325 0.168499 -0.0270627
+-0.0474794 0.0917467 0.0438194
+0.00950115 0.119644 0.0365249
+0.0437324 0.0790794 0.0263023
+-0.0905234 0.132421 0.0302253
+-0.0748541 0.107208 0.0370405
+-0.0943565 0.12553 0.0182582
+-0.0131926 0.0378477 0.0507876
+-0.0570855 0.0480965 0.0356642
+-0.04493 0.0346468 0.0377647
+-0.0665925 0.064199 -0.00375071
+-0.0829976 0.133839 -0.00205551
+-0.0406365 0.0548831 -0.0112562
+-0.00950098 0.0884225 0.0571104
+0.0335068 0.0468989 0.0306812
+4.31947e-06 0.034593 -0.0165995
+-0.0725884 0.155473 0.0265843
+-0.0755167 0.0714511 -0.00453448
+-0.0669139 0.0704667 0.0354638
+-0.069981 0.180634 -0.0574865
+-0.0116389 0.034923 0.0481436
+-0.0307766 0.0720324 -0.0295197
+-0.0178239 0.107521 -0.0218927
+0.020822 0.043607 0.0421342
+-0.025466 0.0460651 0.0509844
+0.0349766 0.11396 0.0183585
+-0.0599273 0.122373 -0.00867944
+0.0365334 0.0980835 0.033685
+-0.0621481 0.159972 -0.0385982
+-0.0915531 0.115336 0.039285
+-0.0888763 0.0982745 0.00841224
+-0.00324635 0.130613 0.0199814
+-0.0668526 0.0914559 0.0435065
+0.0175786 0.0475536 0.0427473
+0.0318002 0.118052 0.00717688
+-0.0414667 0.104283 0.0404247
+0.0562407 0.0648113 0.00118357
+-0.0753758 0.170369 -0.0311391
+-0.0620405 0.138434 -0.00686017
+-0.00249822 0.0870283 0.0569791
+-0.0542914 0.129735 0.0355428
+-0.0274963 0.100194 0.0434874
+-0.00951883 0.17115 -0.0217635
+-0.0305995 0.121953 0.0248664
+-0.0770757 0.068957 0.00853894
+0.0135031 0.119752 -0.013055
+0.0413777 0.0491221 -0.00619394
+-0.0669027 0.0396709 0.012801
+-0.0249365 0.0607087 0.0409751
+-0.0124795 0.0517352 0.0508543
+-0.0304 0.0650386 -0.0254348
+-0.0267061 0.0765373 0.0464972
+0.0196875 0.0385058 -0.013693
+0.0518591 0.0461434 0.019211
+-0.0447475 0.146272 0.00240034
+-0.0336457 0.0562895 -0.0107616
+0.0237552 0.0887468 -0.0239425
+-0.000502572 0.0965565 0.053664
+-0.0664522 0.0376478 0.0363332
+-0.041205 0.169789 -0.00987939
+-0.0630084 0.142674 -0.00705706
+-0.0305333 0.178655 -0.00565353
+-0.0137626 0.0784616 -0.0384771
+-0.0616465 0.0397266 0.0174413
+0.00939844 0.0418898 -0.0239164
+0.0403895 0.0519763 -0.00684208
+0.00239172 0.0434053 -0.0248906
+-0.0663598 0.15609 0.0142173
+-0.0667166 0.136853 0.0439657
+-0.0132042 0.171245 -0.025107
+-0.0511148 0.117699 -0.0144446
+-0.0686887 0.0620968 0.00507892
+-0.066502 0.0889512 0.0442634
+-0.0531749 0.0487012 0.0129919
+-0.0464945 0.0532702 0.037612
+-0.0763048 0.0702707 0.00153293
+0.00237024 0.0481449 -0.0294793
+-0.0669085 0.108072 -0.0133167
+-0.0614834 0.166203 -0.0576271
+0.028089 0.0929174 0.0442737
+-0.0239187 0.036252 -0.0191133
+-0.0394562 0.0347283 0.0406132
+-0.0679286 0.17514 -0.0470724
+-0.0737519 0.14858 -0.0228576
+-0.0335079 0.105635 0.0395993
+-0.0780357 0.0769322 0.031104
+0.047273 0.0720618 0.00573289
+-0.0566027 0.0562228 -0.000407584
+-0.0336617 0.0592604 -0.0121578
+0.0390714 0.108406 0.0131668
+-0.067572 0.158668 -0.00806913
+-0.0668441 0.0995074 -0.0160123
+-0.0155786 0.0348181 -0.0259692
+0.0524799 0.0636428 -0.00173686
+-0.0666208 0.161046 -0.0135117
+0.012487 0.118181 0.036207
+0.00850767 0.067431 0.0550095
+-0.0568164 0.0333332 -0.00454462
+-0.00056724 0.0909565 -0.0345037
+0.0122553 0.0695892 -0.0315106
+-0.0747099 0.0713354 -0.00558545
+-0.0151964 0.178666 -0.0203777
+-0.0707468 0.161979 -0.010709
+-0.00364517 0.0496603 -0.0307711
+0.0292759 0.0787271 -0.0215887
+-0.0606931 0.0659255 -0.00858452
+-0.055281 0.0594285 0.0232183
+0.0168274 0.0658911 0.0506364
+-0.0286315 0.159193 -0.0128611
+-0.0753259 0.0689002 0.0227894
+-0.0278046 0.0364789 0.0536304
+-0.020238 0.0938075 -0.0335417
+-0.0787919 0.108745 0.0367247
+-0.0627356 0.150882 -0.0252578
+-0.0374903 0.111156 0.0359971
+0.0123741 0.0494269 -0.0274814
+-0.0550935 0.0685958 0.0378502
+0.0152655 0.0695272 -0.0306629
+0.0304209 0.0460912 -0.00653037
+-0.0896888 0.137919 0.0321971
+-0.076768 0.156222 -0.00903892
+-0.0177411 0.17422 -0.017052
+-0.0582856 0.0695544 0.0380966
+-0.0710157 0.179813 -0.0510815
+-0.0283604 0.112635 -0.0172343
+-0.0441537 0.0408799 -0.0213021
+0.0104769 0.0949778 0.0509942
+-0.00239285 0.100006 0.0487279
+0.0421962 0.0929549 -0.00479827
+0.0401191 0.0900359 0.0318057
+0.0226855 0.103953 -0.0180758
+-0.0705692 0.037778 -0.000833243
+0.0213756 0.0429924 -0.0177346
+0.0141656 0.0475343 0.0448184
+0.02539 0.0849287 0.0474039
+-0.0485578 0.0361757 -0.0124661
+0.0237226 0.0699627 0.0465409
+-0.062494 0.155703 0.00979223
+-0.0499478 0.135176 0.00116888
+-0.0731261 0.154051 -0.0329012
+-0.0565591 0.0344267 0.0337344
+-0.0757231 0.155771 0.0225635
+-0.081733 0.0783168 0.0273929
+-0.0465781 0.0504461 -0.00966731
+0.0370638 0.0376395 0.0160314
+0.0401736 0.0801429 -0.00978947
+-0.0295615 0.171229 -0.00778742
+-0.0625363 0.158377 -0.0386027
+-0.0482692 0.133969 0.0226705
+0.00454759 0.0341639 -0.0171912
+-0.0620171 0.153759 -0.016582
+-0.0878261 0.11219 0.0337097
+-0.05597 0.0519966 -0.00239063
+0.0400386 0.0871415 -0.0117889
+0.0205921 0.0807207 0.0509473
+-0.0296224 0.0352251 0.019146
+-0.0381589 0.163687 -0.0131595
+-0.0675595 0.163657 -0.0167503
+-0.0522361 0.15086 0.0163848
+0.0360023 0.103374 0.0311349
+0.0272712 0.0929162 0.0448522
+-0.0277389 0.0423333 0.0528015
+-0.0824451 0.140729 0.0449221
+-0.0329396 0.0386558 -0.0303928
+0.0296623 0.114075 -0.00693776
+-0.0221975 0.0652175 0.046591
+0.045212 0.0819736 0.0221688
+-0.0258761 0.0796032 0.0512286
+0.0272389 0.0873294 -0.0222582
+0.00242016 0.0361514 -0.024222
+-0.0615581 0.145382 0.0374116
+-0.0695688 0.160974 -0.049948
+-0.0858053 0.0953564 -0.000572964
+-0.0464927 0.165223 0.0045927
+-0.0624159 0.15064 -0.016574
+0.0473464 0.0561746 -0.0057008
+0.0237088 0.0942271 0.0467477
+-0.0494979 0.0762481 0.043343
+-0.078769 0.165248 -0.0339573
+-0.00950205 0.12806 0.0264334
+0.05377 0.0682444 0.00163269
+-0.0679209 0.163786 -0.054975
+0.0290078 0.087549 0.0438096
+-0.0840398 0.132376 -0.0018283
+-0.0306543 0.0650659 -0.0244333
+0.0322458 0.0355363 0.00770856
+0.00335212 0.131364 0.00663122
+-0.0154115 0.128891 0.0141212
+-0.0372876 0.0421099 0.0439093
+0.0308492 0.0931255 -0.0185705
+-0.029871 0.0459583 -0.0272702
+0.0300675 0.0822073 0.0435477
+0.000382137 0.128869 0.0270967
+-0.0174793 0.0730127 0.0550809
+-0.0387497 0.0782817 -0.0191475
+-0.0433943 0.0335852 -0.0186462
+0.0391881 0.0673984 -0.0107969
+-0.0280713 0.175691 -0.00734553
+0.0316149 0.0916151 0.0423373
+-0.0762132 0.0879097 -0.0135406
+-0.0316751 0.0665766 -0.0214412
+-0.00307655 0.0345443 -0.0171652
+-0.0426807 0.0636637 -0.0138633
+-0.0921228 0.126953 0.0372491
+-0.0235086 0.0347636 0.0474886
+-0.0506072 0.0546369 -0.00878713
+-0.0685971 0.162283 -0.0128033
+-0.0637348 0.156074 0.0136991
+0.0233928 0.0475951 -0.0196868
+-0.0519018 0.105587 -0.0193502
+-0.00551889 0.0746529 0.0585785
+0.000500504 0.0519731 0.0534094
+-0.0412672 0.0338015 -0.0128657
+-0.0819225 0.125087 -0.0048212
+0.00722702 0.0796252 -0.0338785
+-0.0893296 0.0956153 0.0124232
+-0.00167125 0.0554598 -0.0320096
+0.0267785 0.0402768 0.0313512
+-0.0867821 0.10632 0.010369
+-0.0451957 0.131364 0.0135329
+0.018149 0.0699846 0.0508404
+-0.0878008 0.119885 0.00028492
+-0.0612546 0.0341987 0.0206565
+0.0115009 0.111256 0.0392728
+0.0152633 0.0751002 -0.0297036
+-0.0351444 0.0865581 -0.0244792
+0.000649673 0.0963928 -0.0300705
+-0.0345272 0.121283 0.0279162
+0.0296818 0.0815643 -0.0205093
+-0.03348 0.115008 -0.0157024
+-0.0728312 0.136891 0.0492499
+-0.00265601 0.0540246 -0.0319128
+-0.0422272 0.127744 0.0161624
+-0.0494399 0.119744 0.0319359
+-0.0574019 0.116942 0.0379675
+-0.0468361 0.0970763 -0.0219471
+-0.0616292 0.146031 -0.00460349
+-0.0933662 0.126937 0.0262691
+-0.0228186 0.161021 -0.00330981
+-0.0635624 0.152855 0.034229
+-0.0625195 0.144437 -0.00658249
+-0.0839827 0.0830482 -0.0025149
+0.0144965 0.116791 0.0366152
+-0.0766305 0.155099 0.0076657
+-0.0365494 0.127902 0.0108341
+0.02042 0.126659 0.0186188
+-0.0470606 0.0628926 0.0375096
+-0.00665705 0.114661 -0.0174859
+0.0409886 0.104212 0.016155
+0.0264254 0.054947 0.041554
+-0.064618 0.0659249 -0.00682147
+0.0143052 0.127349 0.0263844
+-0.0254714 0.0379526 0.0103195
+0.0213669 0.0851498 -0.0262488
+-0.0469792 0.133264 0.00837709
+-0.0845615 0.0777561 0.014943
+0.0384886 0.0513309 0.0319844
+-0.0128833 0.165453 -0.0135102
+-0.0811951 0.147316 0.000164965
+-0.0523892 0.141597 0.0213852
+-0.045982 0.130505 0.00444274
+0.0279356 0.0520839 0.0384098
+-0.0931866 0.124098 0.0112689
+-0.0316005 0.0707575 -0.0264789
+0.00339515 0.0448431 -0.0258796
+-0.019688 0.0352649 -0.0192337
+-0.0492398 0.164062 -0.00484765
+-0.00759694 0.039172 -0.0259394
+-0.0456148 0.043386 -0.0114089
+-0.0706825 0.163806 -0.0469738
+-0.0111277 0.166928 -0.0162357
+0.0150914 0.0873948 0.0517971
+-0.0488841 0.0335499 -0.0104742
+0.0191832 0.0974256 -0.0227258
+-0.068761 0.17368 -0.0560297
+0.0347852 0.0821986 0.0398055
+-0.0656191 0.164967 -0.0232289
+0.0488884 0.0431235 0.0112233
+-0.0204394 0.0725535 0.0530664
+0.0198178 0.127196 0.0112616
+-0.0870347 0.13912 0.00619253
+-0.0619782 0.15683 -0.0335967
+0.0192552 0.0735767 -0.0281447
+-0.0582892 0.0589697 0.00149643
+-0.0794885 0.131664 0.0524764
+-0.0625817 0.159955 -0.0415973
+-0.0344319 0.0350721 -0.0182387
+0.0339652 0.0955609 0.0387182
+-0.0350568 0.0344135 0.0294961
+-0.00649976 0.0842428 0.0569087
+-0.0606247 0.0394421 0.0446315
+-0.066026 0.146409 -0.0228827
+0.0265887 0.0491527 0.0382012
+-0.0447519 0.078285 -0.0193632
+0.0442188 0.0833029 0.0251703
+-0.025021 0.178659 -0.00994683
+0.0382789 0.10977 0.00952257
+-0.0756137 0.176488 -0.0441876
+-0.0706968 0.169922 -0.0279808
+-0.0514769 0.0344526 0.0347935
+0.00449209 0.108585 0.0419458
+0.0591616 0.0552765 0.0151753
+0.0295012 0.0578054 0.0407589
+0.0323993 0.0505614 -0.00746951
+-0.0570338 0.131087 -0.00617819
+-0.0304972 0.101559 0.0427282
+-0.00116978 0.0991573 0.0506694
+-0.0238077 0.0811303 0.0547388
+-0.00701023 0.0988653 -0.0267279
+-0.0156999 0.0584946 -0.0353551
+0.00922562 0.0809438 -0.0326125
+0.0453737 0.0474164 -0.00383546
+0.0044338 0.117686 -0.0167913
+0.0239341 0.0561524 -0.0247597
+0.0591083 0.0705376 0.015147
+-0.0594646 0.151494 0.0342364
+-0.0657091 0.157202 -0.00882727
+-0.0250337 0.0381576 0.00660247
+0.0420581 0.102887 0.0101643
+0.0436509 0.0403831 0.00924323
+-0.00449056 0.130995 0.0108991
+0.0044777 0.112767 0.0412512
+0.00553763 0.100304 0.04669
+-0.0942962 0.120123 0.0192891
+-0.0620801 0.0339964 0.0171254
+-0.0160023 0.128658 0.015367
+-0.0432963 0.128843 0.0142751
+-0.0634932 0.104261 0.0408123
+-0.0746115 0.103538 0.0368408
+-0.0222463 0.0739152 0.0519932
+-0.0544743 0.034136 0.0256577
+-0.0252277 0.12616 0.0135052
+-0.0320296 0.171249 -0.00429305
+-0.0132393 0.1837 -0.0278845
+-0.0324962 0.0718107 0.0406773
+-0.0765269 0.165965 -0.0237196
+-0.0833313 0.0829966 0.0292517
+0.0259015 0.0902483 0.0463733
+0.0095961 0.0354723 -0.00987583
+0.0511798 0.0581784 0.029952
+-0.0848476 0.0845966 0.0254873
+-0.0509379 0.131197 -0.00260501
+0.00252027 0.0730778 0.0562797
+-0.0135504 0.122737 -0.00796322
+-0.00761024 0.0420402 -0.0258045
+-0.0508461 0.134795 0.0276114
+-0.0804072 0.155064 0.0209566
+0.00350727 0.103765 -0.0218529
+-0.0106066 0.0420419 -0.0261259
+-0.0713436 0.0632651 0.0179295
+-0.067959 0.169303 -0.0298283
+-0.0236585 0.049302 -0.027521
+-0.069473 0.158882 -0.00587612
+-0.0766843 0.15421 -0.00390102
+-0.0220401 0.0852804 0.0556778
+0.0275877 0.0465825 -0.0117097
+-0.00852427 0.130326 0.0108566
+0.0130382 0.0344991 0.00293188
+0.0559458 0.0605187 0.000117677
+-0.0348266 0.0900917 -0.0242073
+-0.0890869 0.135136 0.0402764
+-0.0897624 0.136545 0.033205
+0.00547548 0.112757 0.0410095
+-0.0712367 0.159654 -0.00650092
+-0.0121993 0.177175 -0.0288808
+-0.0823069 0.0748418 0.00552391
+-0.054558 0.0460859 0.0144477
+-0.070487 0.0669606 -0.00253268
+-0.0556924 0.159448 0.00648476
+-0.00649361 0.105887 0.04408
+-0.0602281 0.059992 0.0213112
+-0.0580325 0.0579587 0.00923969
+-0.0338627 0.110196 -0.0186635
+0.0546876 0.0597691 -0.00173886
+-0.0625369 0.149102 -0.00757295
+0.0542703 0.0575789 -0.00178727
+-0.0088618 0.129865 0.0208462
+-0.0801514 0.109359 0.0377151
+-0.00679227 0.0798757 -0.0378854
+-0.0424904 0.0860159 0.0426903
+0.0479819 0.0723794 0.00739708
+-0.0560722 0.13957 0.0312222
+-0.0365138 0.0804626 0.0431357
+0.00167631 0.105337 -0.0215515
+-0.0775111 0.0860271 0.0374369
+0.0259521 0.11908 -0.00433188
+-0.0558236 0.0526652 0.00846948
+-0.0846054 0.11036 0.02536
+-0.0765518 0.15421 -0.000899711
+0.0127846 0.0699169 0.0536174
+0.0208082 0.1264 0.00735797
+-0.0504584 0.0502644 0.0363006
+0.0174244 0.125027 -0.00283112
+-0.0308709 0.178515 -0.0130008
+-0.00718543 0.0385691 0.00621806
+0.0407891 0.0886694 0.0309807
+-0.0357951 0.124657 -0.0058294
+-0.0554873 0.0400326 0.0469712
+-0.057026 0.0675163 0.0366088
+-0.0497286 0.133927 0.0265636
+-0.00790814 0.0384861 0.0079669
+-0.0811308 0.0841829 -0.00653469
+-0.010479 0.0991873 -0.02508
+0.00856046 0.0354979 0.0447263
+-0.0634822 0.166302 -0.0366942
+-0.0223475 0.0360366 0.0535038
+-0.0795325 0.124539 0.0521412
+-0.00951606 0.0745243 0.0569833
+-0.0130122 0.127478 0.0251829
+-0.0936226 0.120076 0.0132919
+-0.0540996 0.154592 -0.00271527
+-0.0879876 0.132208 0.00230713
+-0.034669 0.15585 -0.0101443
+-0.0197012 0.0598498 -0.0346368
+-0.0276791 0.155231 -0.00339809
+-0.0842452 0.0818537 0.025498
+-0.054537 0.0560032 -0.00541843
+-0.0497623 0.0665865 0.0371903
+-0.0891577 0.092949 0.0214162
+-0.0577737 0.0782037 -0.0194332
+-0.064492 0.104249 0.0405622
+-0.0336047 0.0695556 -0.0194645
+-0.0558611 0.0955845 -0.021564
+-0.0184974 0.0869962 0.0565805
+0.00637923 0.0372606 0.0264872
+-0.0665048 0.104229 0.0399675
+0.0566718 0.0553009 0.0238011
+-0.0283123 0.0383433 -0.00703005
+-0.0114184 0.169868 -0.0184586
+0.0211822 0.0909362 -0.0242734
+0.0406295 0.0806796 0.0323988
+0.0123659 0.128443 -0.000397752
+-0.0384845 0.0833049 0.0437838
+-0.01051 0.0531978 0.0517663
+0.00250545 0.0842781 0.0574483
+-0.0674995 0.0972695 0.0419768
+-0.0618921 0.119466 -0.00942759
+-0.00594439 0.13066 0.0175514
+-0.0188708 0.0382701 0.00775373
+-0.0605698 0.0727907 0.0401099
+-0.0115041 0.115551 0.0394745
+0.0300401 0.11902 0.00366373
+-0.0812551 0.10738 0.02923
+-0.0704758 0.123201 0.0533571
+-0.0711231 0.141136 0.0464522
+-0.0222312 0.125137 -0.000350139
+0.0436968 0.0818627 -0.00278544
+-0.00557531 0.0383818 0.0157938
+-0.0175218 0.187118 -0.0194148
+0.000510392 0.0689287 0.0563645
+0.0339979 0.0519394 0.0331121
+0.00286804 0.129802 0.0250965
+-0.0290472 0.0777737 0.0431405
+0.0209137 0.102084 0.0444516
+-0.00628355 0.0409075 0.0485853
+0.0605521 0.0595441 0.0141714
+0.0386236 0.0898511 -0.0127692
+0.0302987 0.0539206 -0.0157566
+-0.0421651 0.149301 -0.00412295
+-0.0126067 0.040646 -0.0265976
+-0.0788091 0.168052 -0.033971
+0.0359211 0.112779 0.0172688
+-0.0394762 0.17111 0.000601324
+-0.0330305 0.0384181 -0.00620006
+-0.0859939 0.0940196 0.000445293
+-0.0359122 0.158048 0.00410154
+-0.0745011 0.151286 -0.0298782
+0.0531496 0.0491587 0.00225551
+-0.0243767 0.179986 -0.0189674
+-0.0891975 0.0996627 0.0124046
+-0.0742533 0.17954 -0.0493425
+-0.0510836 0.145457 -0.000907293
+0.0483282 0.0561556 -0.00540695
+-0.0224848 0.0474635 0.0510926
+-0.0647533 0.163375 -0.0214725
+-0.0127683 0.163589 -0.0126806
+0.0112702 0.0766287 -0.031501
+-0.0460801 0.153165 -0.0063697
+-0.0396673 0.0606846 -0.0120669
+0.0304753 0.100799 0.0389817
+0.0504441 0.0731136 0.0180651
+0.0195371 0.122997 -0.00457304
+-0.0455152 0.0505363 0.0385492
+-0.0525396 0.0458696 -0.00783738
+-0.0679101 0.109459 -0.0121777
+0.0257715 0.122252 0.0234619
+-0.0641925 0.158337 -0.0512857
+-0.0679573 0.0636968 0.0236258
+0.0336501 0.0872305 -0.0183746
+-0.081408 0.0801232 -0.00353296
+-0.068364 0.143961 0.043402
+-0.060807 0.170968 -0.0607383
+-0.0530022 0.0712206 0.0395879
+-0.0629233 0.149038 -0.01858
+-0.0911763 0.131044 0.0302322
+-0.0866097 0.0859466 0.00148078
+-0.0213048 0.0567472 0.0459531
+-0.0884724 0.111842 0.0093465
+-0.0232358 0.0382045 0.0267906
+-0.0687325 0.178002 -0.0502345
+0.0171734 0.0960138 -0.0234178
+-0.0336295 0.0533957 -0.0102549
+0.0404048 0.0661215 -0.00776758
+0.0352114 0.113974 0.0112756
+-0.0509894 0.131098 0.0315417
+-0.0825925 0.0857998 0.0312629
+0.0165569 0.0367823 -0.018664
+-0.0158447 0.163118 -0.0162484
+0.0463618 0.0504062 -0.00492067
+-0.0256024 0.0918183 0.0477571
+0.0401119 0.105635 0.0181717
+-0.075865 0.120825 -0.00747435
+-0.0515138 0.0502892 0.0216268
+-0.0597307 0.0737738 -0.017073
+0.0327302 0.0795508 0.0421017
+0.0561478 0.0493933 0.0131905
+-0.0491927 0.149222 0.0111539
+-0.0505664 0.0459962 -0.00889176
+-0.0346044 0.0381371 0.0484275
+-0.0571418 0.0341673 0.0268338
+-0.0508978 0.0335658 0.00549258
+0.0499018 0.0460625 0.00228276
+0.000648366 0.101032 0.0453587
+-0.064515 0.0945534 0.0434117
+-0.00933623 0.127529 -0.00319765
+-0.0931674 0.126844 0.0122586
+-0.0775055 0.120428 0.0519362
+-0.00412302 0.0390868 0.0317249
+-0.0444953 0.12065 0.0276432
+-0.0808257 0.114785 -0.00282613
+0.00848893 0.0976878 0.0492062
+-0.0204952 0.119495 0.0334766
+-0.0744171 0.1312 0.052182
+-0.0354802 0.0365931 -0.0303176
+-0.0158225 0.127346 0.0227279
+-0.0622273 0.163125 -0.0345932
+-0.0308039 0.0345326 0.0408762
+-0.0684942 0.0944611 0.0423345
+-0.0282259 0.115945 -0.0147131
+-0.00496131 0.0393649 0.0367022
+0.000507606 0.089764 0.0561546
+0.0184391 0.121423 0.0322194
+-0.0293563 0.0761839 -0.0345604
+-0.0798193 0.0993879 0.0336913
+-0.0260706 0.125207 0.0176138
+-0.0466789 0.0383303 -0.0162856
+-0.0551627 0.0709645 0.0393255
+-0.0708102 0.086505 -0.0166182
+-0.0534691 0.0491595 0.0373719
+-0.0176627 0.0365106 -0.0181139
+0.00950436 0.0910078 0.0538342
+-0.0895706 0.136541 0.0322035
+0.0538065 0.0721186 0.0208488
+-0.00549555 0.115561 0.0401898
+0.00964519 0.0349724 -0.00752839
+-0.0134864 0.112741 0.0406725
+-0.00206815 0.039143 -0.00620903
+0.0130247 0.112857 -0.017601
+-0.0790398 0.119048 0.050662
+-0.0808858 0.0872378 0.0337267
+-0.0123796 0.124965 -0.00637162
+-0.0213885 0.125739 0.00103732
+-0.089509 0.125659 0.045333
+-0.05553 0.137483 -0.00349047
+0.0417216 0.100008 -0.000812454
+-0.0294372 0.045874 0.0494957
+0.0458807 0.0774123 0.0204549
+-0.010796 0.120869 -0.0120713
+-0.0650859 0.171096 -0.0446086
+-0.0309091 0.0594671 -0.0184147
+0.0318276 0.102039 -0.0140664
+-0.050474 0.137043 0.0223997
+-0.0892111 0.0956026 0.0114219
+-0.0551272 0.0478339 0.0400497
+-0.0376142 0.115213 -0.0159111
+-0.0262205 0.0604134 -0.0304432
+-0.0395514 0.159448 0.00235113
+-0.0548296 0.0912974 -0.0221769
+0.0140209 0.113717 -0.0165571
+-0.0376838 0.0651596 -0.0143574
+-0.0357596 0.0367769 0.0465803
+0.0218833 0.124858 0.00205716
+-0.0515413 0.0403485 -0.0110842
+0.0196453 0.0521206 0.045827
+-0.0274751 0.109286 -0.019717
+-0.054346 0.125513 0.0372066
+-0.061806 0.172532 -0.0555873
+0.0193853 0.0367967 0.0404
+0.00315064 0.0340463 -0.0192491
+-0.0419902 0.127061 0.0177443
+-0.0753578 0.0671035 0.0137678
+-0.017747 0.0685932 -0.0381265
+0.0502404 0.0581527 0.030355
+-0.01349 0.11138 0.0414506
+-0.088473 0.0908539 0.022804
+-0.0623246 0.0380624 0.0435494
+-0.0315191 0.0831203 0.0417649
+-0.0908528 0.131057 0.0322319
+-0.0524868 0.0959601 0.0436811
+0.0383485 0.10917 0.00520513
+0.0405643 0.0599899 -0.00408877
+-0.00769877 0.0598808 -0.0345717
+0.0253549 0.0875981 0.0473346
+-0.0126907 0.166905 -0.0150111
+0.0384994 0.0541178 0.0316123
+-0.034906 0.0367338 -0.0161439
+-0.057208 0.048538 0.00854022
+-0.0255159 0.108511 0.0401259
+0.0305676 0.0350004 0.0115893
+-0.0520943 0.0559627 0.0266271
+-0.0610057 0.155949 0.0190169
+-0.067333 0.1766 -0.0497355
+0.0258363 0.0844839 -0.0235493
+-0.0689178 0.164003 -0.0158096
+-0.00849374 0.116931 0.0393004
+-0.0752784 0.113511 0.0497641
+-0.0888148 0.144497 0.0313918
+-0.0453871 0.145929 0.00156561
+-0.0599561 0.0677317 0.0357891
+-0.0125434 0.0386707 -0.00229897
+-0.000271447 0.0356914 0.00658166
+-0.0415825 0.0366566 0.0434527
+-0.0297036 0.165315 -0.00626903
+-0.0467885 0.0855251 -0.0217462
+-0.0827882 0.125806 0.051363
+-0.0176693 0.0966335 -0.0284397
+-0.0464991 0.115243 0.033257
+-0.0569748 0.146758 0.0317266
+-0.0430879 0.156177 -0.00890493
+-0.00350236 0.0774419 0.0585703
+-0.0699027 0.158151 -0.0489236
+0.0362459 0.112339 0.00591924
+0.0367118 0.0920329 -0.0133924
+-0.0539202 0.0610131 0.0274265
+-0.0093317 0.127279 0.0279745
+-0.0726772 0.112018 0.047983
+-0.0451365 0.160644 -0.00892562
+-0.0209165 0.172715 -0.0146234
+-0.0477839 0.125387 0.0290716
+-0.0734873 0.156859 -0.0289164
+0.00860516 0.061703 0.0545256
+-0.0246606 0.0422329 0.0539554
+-0.0315436 0.153515 -0.00448892
+0.0345459 0.0571781 -0.011728
+-0.0791321 0.170818 -0.0399882
+0.0254504 0.0415949 -0.00563526
+0.0230318 0.0355156 0.0114574
+-0.0554984 0.107053 0.0399469
+-0.0296361 0.0522471 0.0373693
+-0.0438179 0.0928034 -0.0224841
+-0.0199243 0.0387302 -0.0112686
+0.0212455 0.0791286 -0.0267859
+-0.0532861 0.0527919 0.0115704
+0.00450017 0.0441843 0.0459802
+-0.0329932 0.0339759 0.0213799
+0.0553011 0.0604636 -0.000842819
+0.00165238 0.0932332 -0.0327923
+-0.0552284 0.0527023 0.00927604
+-0.0783599 0.0708413 0.0204513
+-0.0767777 0.176413 -0.0510191
+-0.0394918 0.104211 0.0396007
+0.0327921 0.0889736 0.0422708
+-0.00991923 0.0986226 0.0505787
+-0.0806729 0.108958 0.0307202
+-0.0822864 0.135367 0.0491747
+-0.0649369 0.0609076 0.00327394
+0.0386477 0.0715748 -0.0117783
+-0.0240415 0.126597 0.0109996
+-0.0781422 0.141688 -0.0047364
+-0.0427782 0.0841106 -0.0212812
+-0.0641686 0.178174 -0.0558405
+0.0252976 0.0661311 -0.0233121
+0.0189895 0.0631559 0.0484766
+0.0182463 0.0722224 -0.0290012
+-0.0777504 0.161717 -0.020949
+-0.051966 0.138521 0.000416067
+-0.0605353 0.155832 0.0177371
+0.0437866 0.098742 0.00716534
+-0.0494703 0.0370271 -0.0120635
+0.0464078 0.0806576 0.0101793
+0.0218218 0.116393 -0.0114503
+-0.0533273 0.132699 -0.00427378
+-0.0681775 0.0762505 0.039044
+-0.0250035 0.0896 -0.0352857
+0.000769534 0.0946028 -0.0322154
+-0.0158082 0.0346932 0.0474464
+-0.076979 0.148604 -0.00699397
+0.0467055 0.0730498 0.0181295
+-0.0496483 0.0634464 -0.0118311
+-0.0197535 0.0700012 -0.0382558
+0.0232727 0.0989983 -0.0208236
+-0.0777 0.16251 -0.0219398
+-0.0908755 0.147455 0.0141474
+-0.0334742 0.0638502 -0.015538
+0.00219672 0.0825025 -0.0349885
+-0.0814773 0.128835 0.0524787
+-0.0784807 0.13724 0.0497912
+0.0361312 0.11046 8.71157e-05
+-0.0454849 0.0931252 0.0434035
+-0.0635463 0.153079 -0.00800928
+-0.0529285 0.0339107 0.0244154
+-0.00862356 0.0451919 -0.0286362
+0.0192377 0.117984 0.0350388
+-0.000496915 0.0883839 0.0565827
+0.0316988 0.118246 0.0142694
+-0.0398347 0.169198 -0.01127
+0.0219416 0.125622 0.00635903
+-0.092876 0.129604 0.0142376
+-0.023566 0.0579721 0.0425175
+-0.0447621 0.126552 0.0211574
+-0.0390659 0.157734 -0.0109824
+-0.0038734 0.104505 -0.022849
+-0.0810823 0.146103 0.0405774
+-0.00499552 0.038756 0.0282379
+0.00659654 0.102942 0.0449664
+-0.0528078 0.0898592 -0.0221628
+-0.0415043 0.0340515 -0.0039392
+-0.0118724 0.166916 -0.0155725
+0.00801932 0.113693 0.0398597
+-0.0873717 0.0895698 0.0245766
+0.0235801 0.11767 -0.00881398
+-0.0592051 0.0411249 -0.00803844
+-0.0631955 0.174736 -0.0540401
+-0.00904474 0.102005 -0.0240096
+-0.0893459 0.0888735 0.0114634
+-0.0847817 0.111591 0.0313073
+-0.0318636 0.155275 -0.00893878
+0.020119 0.0578214 0.0483165
+-0.0884363 0.140505 0.0381916
+0.0268748 0.0768062 0.0459093
+0.00650425 0.06886 0.0554952
+-0.0600274 0.155812 0.00342033
+0.00439509 0.0433687 -0.0246925
+-0.0644393 0.157952 -0.0526177
+-0.0626717 0.152516 0.0345768
+-0.0686641 0.0435432 0.00268116
+-0.0668913 0.155545 0.00822429
+-0.0513204 0.0545255 0.0306253
+-0.0216946 0.055283 -0.031103
+0.0201038 0.121698 0.0313961
+-0.0435092 0.0973014 0.0425845
+-0.0598342 0.124083 0.0415696
+-0.0290584 0.0385824 0.0360072
+-0.0211666 0.0959679 -0.0277597
+0.0393164 0.0948581 -0.00836399
+-0.0465497 0.0354834 -0.0182685
+-0.0577953 0.0577539 0.0112722
+0.0343862 0.0533953 0.033694
+-0.0356597 0.12459 0.0229985
+-0.0703962 0.0382223 -0.000484462
+0.0394034 0.0772645 -0.00977482
+0.0374516 0.110677 0.0163977
+0.022681 0.0549804 0.0449373
+-0.00661876 0.0388692 0.029605
+-0.0298463 0.0958488 -0.0239617
+-0.0500656 0.165567 2.77718e-05
+-0.0624265 0.163056 -0.0535855
+0.0182459 0.035082 -0.00972071
+-0.0535426 0.139527 0.0278286
+0.0535157 0.0664189 0.0268642
+-0.0618871 0.044625 0.0401036
+0.0279315 0.0813321 -0.0222629
+-0.0364738 0.0959436 0.0435424
+-0.0648009 0.0867059 -0.0190299
+-0.0910478 0.113254 0.017639
+0.0328625 0.115479 0.000361714
+-5.55454e-05 0.1192 -0.0143689
+0.00440015 0.0419024 -0.0241382
+-0.0356548 0.0459643 -0.0252685
+-0.00874142 0.0699019 -0.0364843
+-0.0786816 0.173602 -0.0460003
+-0.0750442 0.11265 0.048722
+0.0132032 0.0850348 -0.0305799
+-0.0275703 0.070462 0.0404211
+-0.0333885 0.082189 -0.0265241
+-0.0498121 0.0912811 -0.0216901
+-0.0121305 0.129539 0.00953518
+-0.0888371 0.0942243 0.00943852
+-0.0733262 0.151241 -0.0368807
+0.0159012 0.0347663 0.0342789
+-0.0464698 0.0336288 0.00272222
+-0.0219797 0.0381347 0.0126751
+-0.0434985 0.112577 0.0357301
+0.0374146 0.0807844 0.0365828
+-0.0150623 0.160937 -0.0114195
+0.00882514 0.0347544 -0.00561715
+-0.0793646 0.150083 0.036366
+0.0444807 0.0526489 0.0324592
+-0.0140843 0.0382987 0.0177555
+0.0371109 0.0630101 -0.0117592
+-0.0795655 0.0711751 0.0181423
+0.0314182 0.0968966 0.040312
+0.0553211 0.0622297 0.0271921
+-0.0344916 0.0789231 0.04184
+-0.0708134 0.0893817 -0.0163657
+-0.0786856 0.174223 -0.045863
+-0.0497628 0.0345507 0.0333201
+-0.026557 0.0646504 0.0393284
+0.0499455 0.0733656 0.0164225
+0.0233132 0.0902311 0.0479207
+-0.0441494 0.163638 -0.00943446
+-0.048497 0.0464891 0.040915
+-0.0638143 0.15519 -0.0396115
+0.0296208 0.115866 0.0291818
+-0.0505003 0.100168 0.042883
+0.00450871 0.0910904 0.0550512
+0.0223914 0.093257 -0.0227104
+-0.0346391 0.0469045 -0.0241611
+0.0600903 0.0608951 0.0181821
+0.0174829 0.0976104 0.0472234
+0.0245219 0.0382712 0.0311236
+0.0373902 0.0561474 -0.00613784
+-0.0725233 0.143597 -0.0104167
+-0.0755086 0.133058 0.0519758
+-0.0469091 0.134066 0.0158053
+-0.0365004 0.0719314 0.0420432
+0.0599383 0.0692126 0.0131498
+-0.0228512 0.126901 0.0114323
+0.0370832 0.0408236 0.0259314
+0.0430366 0.0709859 0.0269587
+0.0442558 0.0917077 -0.00080891
+0.0366443 0.0915417 0.0373244
+0.0149217 0.127634 0.0251635
+-0.0260773 0.0547586 -0.0274003
+0.0223322 0.0348324 0.0210401
+-0.0674741 0.169344 -0.0310786
+-0.0943935 0.125559 0.0222675
+0.000334373 0.0554042 -0.031412
+-0.023822 0.0694685 0.046666
+0.024828 0.0768588 0.0482443
+-0.0593221 0.0615947 0.0254084
+-0.0274704 0.0506795 -0.0243965
+-0.0172176 0.177147 -0.0249576
+0.0433823 0.0490357 -0.00560381
+0.0244317 0.116294 -0.00934411
+0.0184177 0.0350663 0.0309125
+0.0404265 0.102791 0.0231613
+-0.0243375 0.1639 -0.00728245
+-0.0675442 0.151908 -0.0456642
+-0.0311974 0.0474073 0.0447828
+-0.0726957 0.175719 -0.0430358
+-0.0165027 0.0499584 0.0473896
+0.0323852 0.0461686 -0.00610484
+0.0214495 0.0822346 0.0504578
+0.016822 0.123899 -0.00554312
+-0.0694694 0.178653 -0.050518
+-0.0741019 0.156119 0.0187476
+0.0510202 0.0736047 0.0138558
+-0.0739033 0.14718 -0.0168588
+-0.0165785 0.162548 -0.00831661
+-0.0414778 0.0347327 0.0401772
+0.0319294 0.118052 0.0100791
+-0.0502835 0.146495 -0.00183305
+-0.0758664 0.116415 -0.00636144
+-0.0824071 0.136209 -0.001703
+-0.0519598 0.0335208 -0.000101812
+-0.0819554 0.0993316 0.0315904
+0.0213579 0.055075 -0.0266156
+-0.0422106 0.112435 -0.0169649
+0.0150002 0.128745 0.00378903
+-0.0430993 0.157658 -0.00954173
+-0.0816795 0.117485 0.0486704
+-0.00999143 0.0383941 0.00762464
+0.0248936 0.12332 0.00461274
+-0.0644877 0.0972949 0.0424471
+-0.032514 0.105674 0.0400124
+-0.0517751 0.0826668 -0.0215624
+0.00214252 0.103065 -0.0221511
+-0.0609083 0.169363 -0.0596932
+0.0270498 0.0919981 -0.0213752
+0.00735643 0.038818 0.0454516
+0.0115845 0.121127 -0.0125402
+0.0591992 0.0552614 0.014176
+-0.0901723 0.112303 0.0149799
+-0.0627834 0.035148 0.0195098
+-0.074757 0.111898 0.0475989
+0.0570719 0.0578424 0.00217676
+-0.0528487 0.0500508 0.0126245
+-0.00477608 0.0784365 -0.0374195
+-0.0645432 0.0673992 0.033354
+-0.0540085 0.145723 -0.00127177
+-0.010995 0.0388834 0.0322933
+0.00247314 0.0964836 0.053027
+-0.0624566 0.177245 -0.0586155
+0.0368789 0.0941727 0.035906
+-0.0219544 0.120804 -0.00985027
+0.0570851 0.0508934 0.0101876
+0.0102738 0.0724526 -0.032232
+0.0544954 0.0655564 0.000403771
+0.0210681 0.0415437 -0.0156999
+-0.0692317 0.155651 0.00154206
+0.0527009 0.0518645 -0.000768796
+0.0334294 0.116181 0.00636312
+0.0448957 0.0945828 0.0101613
+0.00249575 0.0952068 0.0540463
+-0.0124032 0.0388598 -0.00801871
+0.045282 0.0889737 0.0021781
+-0.00350234 0.0388725 -0.0137373
+-0.0678317 0.0335757 0.00383638
+0.00921578 0.0767579 -0.0331902
+-0.0534996 0.0987387 0.0427565
+-0.0124888 0.126191 0.0283067
+0.0103285 0.130654 0.00635323
+0.0314005 0.0446447 -0.00577901
+-0.0295471 0.0804664 0.0436378
+0.00584239 0.0374362 -0.00493399
+0.0435663 0.0408867 0.018056
+-0.0206234 0.0950485 -0.0308006
+-0.0216102 0.0408331 -0.028871
+-0.0256808 0.0663835 0.041558
+0.0103698 0.0351865 0.034574
+0.0249548 0.0809223 0.0484627
+-0.0551501 0.0641879 0.0328568
+-0.0633147 0.132484 0.0400888
+-0.062948 0.163113 -0.0275941
+-0.0620302 0.141028 0.0366839
+-0.0484797 0.126826 0.0298997
+0.00950548 0.107102 0.041296
+0.0390056 0.0914413 0.0336848
+0.0300323 0.108764 0.0348296
+-0.0198832 0.0335337 -0.0251748
+0.0128315 0.0391361 0.0445812
+-0.0263531 0.11244 -0.0170322
+0.0359611 0.109622 -0.00183337
+-0.0572001 0.0380562 0.0469117
+0.00550248 0.121034 0.0357708
+-0.0667821 0.14845 -0.031825
+-0.016957 0.186039 -0.0193264
+-0.0878947 0.131105 0.044958
+0.0363312 0.107346 0.0280412
+-0.0614985 0.0833224 0.0439406
+0.0542552 0.0478973 0.00920996
+-0.0787615 0.0867217 -0.0105634
+0.0226207 0.0360088 0.0127544
+0.00886878 0.0343168 0.00225753
+-0.0266191 0.0618553 -0.0304537
+-0.00302574 0.0387303 0.00142158
+-0.019905 0.038668 0.0324503
+0.0527798 0.0683653 0.00150186
+0.021964 0.0402022 -0.00870612
+-0.0126432 0.0481635 -0.0303259
+-0.0124951 0.0925417 0.056096
+-0.0373842 0.0433946 0.0425967
+0.0243858 0.124139 0.00725423
+-0.0540808 0.0434992 0.0186914
+-0.0590026 0.0609591 0.0242669
+-0.0846496 0.129332 -0.00265191
+0.0108129 0.0887938 0.0544498
+-0.0599027 0.106882 -0.0174092
+0.0235199 0.123889 0.00267512
+-0.0364958 0.116629 0.0319219
+-0.0274016 0.0386836 -0.0145853
+0.0575354 0.0620414 0.00218896
+-0.0617076 0.156842 -0.0315932
+-0.0566848 0.0344893 0.0422998
+-0.0515556 0.0459336 -0.00836292
+0.034036 0.037677 0.020853
+0.0440634 0.064827 -0.000963389
+-0.0783551 0.090033 0.0367591
+-0.0451437 0.162134 -0.00879907
+-0.0870992 0.0913786 0.00345195
+-0.0896332 0.0983435 0.0144056
+0.00267954 0.131212 0.00494959
+-0.0521038 0.0531706 0.024633
+0.033292 0.0856433 -0.0187503
+-0.0284873 0.0606333 -0.0264114
+-0.0366237 0.123115 -0.00817194
+-0.0417568 0.0797359 -0.0197866
+-0.0466787 0.0650533 -0.0138917
+0.0360448 0.0392022 -6.35907e-05
+-0.0192403 0.0387115 -0.0129795
+0.0431391 0.098698 0.00317491
+-0.0224767 0.091498 -0.0352097
+0.0093588 0.0524416 -0.0295377
+-0.0833358 0.105954 0.0271122
+-0.0146006 0.127548 0.000963555
+0.0122907 0.0652688 -0.0305463
+-0.0515682 0.0488001 -0.00762593
+0.0214986 0.122612 0.0290301
+-0.0271235 0.11599 -0.0147668
+0.0381316 0.109734 0.0151646
+-0.00681664 0.0854791 -0.0376549
+-0.0147515 0.07145 -0.0385454
+-0.0659657 0.129697 -0.00887578
+0.0359834 0.11203 0.00292702
+-0.0631298 0.144906 -0.0101196
+0.00903132 0.0343268 -0.014573
+-0.0348704 0.101474 -0.022105
+-0.0693077 0.0614952 0.0145437
+0.0349262 0.0896582 -0.0169179
+-0.037886 0.109925 -0.0191545
+-0.0372775 0.0472266 -0.0193178
+0.0112393 0.0349033 0.0350041
+0.0430009 0.0705508 -0.00279727
+0.0400623 0.0956447 -0.00679711
+-0.0676126 0.155322 0.00651001
+0.0598737 0.0581052 0.00916393
+-0.061495 0.100138 0.0425963
+-0.0575075 0.0435504 0.0160321
+0.0228298 0.0827896 -0.0258286
+-0.0115004 0.0925527 0.0561224
+-0.0223058 0.184466 -0.0180708
+-0.0624348 0.161527 -0.0435948
+-0.0143997 0.0383922 -0.000568703
+-0.0793362 0.0881239 -0.0095476
+-0.0548971 0.10981 -0.018029
+-0.0707512 0.156365 0.0199172
+0.0244407 0.0405616 0.0372831
+-0.0545055 0.113958 0.0351234
+-0.00749363 0.0547355 0.05304
+0.044284 0.0819099 0.0251484
+0.0117499 0.0519912 0.0501875
+-0.0706809 0.109318 0.0378585
+-0.0640006 0.161566 -0.01976
+-0.0122192 0.0378665 0.050479
+-0.0715061 0.148353 0.0408514
+-0.0652549 0.0667307 0.0320259
+0.0162842 0.118981 -0.0122323
+-0.0584978 0.0959813 0.0440843
+-0.0261553 0.169713 -0.0187023
+0.0163086 0.108997 -0.0174538
+0.019812 0.035154 0.0274956
+0.0403843 0.0547484 -0.00641578
+-0.0370524 0.128064 0.00917633
+-0.0181528 0.0388364 -0.0128782
+-0.0703699 0.144073 -0.0154773
+-0.0821317 0.15265 0.0057634
+-0.0121975 0.182647 -0.0286755
+-0.0179487 0.126229 0.0234428
+-0.0713342 0.065071 0.0216423
+-0.0135059 0.0357879 0.0504712
+-0.0551243 0.0482803 0.0389113
+-0.043841 0.0970933 -0.0219235
+0.0307935 0.0619124 0.0409121
+-0.0872404 0.149912 0.0282765
+-0.0777833 0.0694772 0.0182331
+-0.0479563 0.0699321 0.0400053
+-0.0325179 0.0704032 0.0404934
+-0.04199 0.0336868 -0.0166047
+0.00497409 0.0340864 0.0145521
+-0.0449304 0.0643377 0.0396087
+-0.0778694 0.106226 -0.00738941
+-0.0126221 0.0389953 0.033657
+-0.0632121 0.172304 -0.0615699
+-0.0276205 0.0874255 -0.0346253
+-0.0625254 0.138119 0.0359126
+0.00425284 0.0711834 -0.0342035
+-0.0788838 0.153282 0.0303949
+0.00652169 0.0362747 0.0255863
+-0.0662316 0.0345008 0.0140489
+-0.02106 0.174206 -0.0148174
+0.0185004 0.109841 0.0391791
+-0.0646081 0.0450546 0.000685835
+-0.0136021 0.0363077 -0.0261392
+-9.29522e-05 0.131467 0.0096514
+-0.0451771 0.128971 0.00184527
+0.00750493 0.0561002 0.0528313
+0.0361319 0.074097 0.0381795
+0.022807 0.125614 0.0138049
+-0.0196774 0.0509888 -0.0303435
+-0.0930693 0.120128 0.0262942
+-0.0230193 0.120798 -0.0098328
+-0.0271496 0.0384219 0.0311819
+-0.0748224 0.0935599 -0.014192
+-0.0354943 0.119369 0.0303337
+0.060906 0.0609648 0.0111554
+0.0112135 0.130703 0.0137986
+-0.0266186 0.0589226 0.0382515
+0.0218458 0.0672628 0.0473581
+0.00922858 0.116392 0.0380826
+-0.0579872 0.0576809 0.00662705
+-0.0151861 0.168246 -0.0215615
+0.0431809 0.0791159 0.0272636
+-0.0755673 0.0727762 -0.00660131
+0.0242315 0.0818412 -0.0251267
+-0.0250124 0.0782139 0.0518051
+-0.0338224 0.0338142 0.00692539
+-0.00946746 0.0362215 -0.025425
+-0.0416936 0.0652006 -0.0145392
+-0.0546754 0.0335075 0.00116676
+-0.0233106 0.15969 -0.00223977
+-0.0842752 0.141807 0.00320102
+-0.0818378 0.131303 0.0516681
+-0.0234556 0.161598 -0.0145283
+-0.0499699 0.150693 0.011804
+-0.010495 0.0471724 0.0477907
+0.0380379 0.075373 0.0356471
+-0.0450739 0.0363473 0.0448052
+-0.0737333 0.15548 -0.0259091
+-0.0716137 0.178389 -0.0484
+-0.0384987 0.0691035 0.0417776
+0.00141943 0.122927 0.0347542
+-0.057332 0.137224 -0.00518105
+-0.0557698 0.136063 -0.00393718
+0.0558337 0.0494217 0.00919997
+-0.0580135 0.04944 0.00163802
+-0.0357372 0.111668 -0.0181975
+-0.0550044 0.145721 -0.00143834
+0.00110225 0.0344701 0.00796988
+-0.0157589 0.038402 0.00281447
+-0.0521458 0.121812 -0.0107191
+-0.00850406 0.11834 0.0382239
+-0.0498654 0.102788 -0.0210486
+-0.0630574 0.15313 -0.033029
+-0.0734528 0.143001 -0.00787011
+-0.0577717 0.0334512 -0.00484461
+-0.0926703 0.124234 0.0402542
+-0.0236253 0.0450591 -0.0281331
+0.0444641 0.0686626 0.00115575
+-0.0394989 0.0620307 0.0413298
+-0.0489043 0.0531988 0.0353928
+-0.0549375 0.140991 0.0293007
+0.0134789 0.100443 0.0476777
+0.0344381 0.102088 0.0341795
+-0.0629237 0.112473 -0.0138486
+0.0456048 0.0918125 0.0071715
+-0.0679688 0.135528 -0.00836676
+-0.0561131 0.145329 0.0311927
+0.0222077 0.0403059 0.0403109
+-0.0930104 0.131018 0.0202297
+-0.073597 0.161047 -0.0349306
+-0.073142 0.0762988 0.0362199
+-0.0868887 0.102318 0.0233696
+-0.074876 0.107788 -0.00905848
+-0.061968 0.159998 -0.0366167
+0.0234524 0.0505688 0.0407158
+-0.0374809 0.113893 0.0340704
+-0.052457 0.144675 0.0183665
+0.000496502 0.103028 0.0440499
+-0.0107515 0.039289 0.0373765
+0.0177346 0.123618 -0.0052308
+-0.0278908 0.0903405 -0.0316075
+0.0555538 0.0665692 0.0013688
+-0.0679616 0.181138 -0.0572245
+-0.0246921 0.156571 -0.00408158
+-0.0295045 0.112518 0.0356692
+-0.0523224 0.146252 0.0184018
+-0.0831779 0.111548 0.00129095
+0.0381693 0.109765 0.0141664
+-0.0465876 0.132486 0.00741919
+0.0351546 0.112861 0.0227039
+0.00752051 0.0855871 0.0562726
+-0.0236256 0.0464233 -0.0274769
+-0.0820555 0.138062 0.0474469
+-0.0332203 0.171246 -0.00251328
+-0.0471051 0.157621 -0.00763511
+-0.0883909 0.0874867 0.0154625
+-0.0769362 0.0914256 0.0381174
+-0.075265 0.148568 -0.0158698
+0.015355 0.119233 -0.0124997
+-0.0073165 0.13056 0.0112981
+-0.0167502 0.070002 -0.0383082
+-0.0672167 0.147775 -0.0296135
+0.00424945 0.126892 0.0299609
+0.0188897 0.120837 -0.00821554
+-0.0628446 0.0334683 -0.00588606
+0.0333858 0.103442 0.0343819
+-0.0748011 0.0878022 -0.0147955
+0.00250445 0.0519435 0.0530423
+-0.0565994 0.0548437 -0.000400453
+-0.0657591 0.0794867 -0.0178324
+-0.0893947 0.113204 0.00833335
+0.00550466 0.122397 0.0349805
+-0.0593516 0.0471429 0.038917
+-0.0691412 0.109612 0.0381472
+0.012166 0.127075 0.0284779
+0.00215147 0.0340847 -0.0194818
+-0.0357383 0.152143 0.000762654
+-0.0225608 0.0608496 0.0442445
+-0.00675345 0.0727271 -0.0364938
+-0.0504985 0.0776737 0.0437561
+0.012653 0.128571 8.59956e-05
+-0.0775017 0.148428 0.039927
+0.0194833 0.0961991 0.0471957
+-0.00134544 0.0999407 0.0490888
+-0.00745251 0.100521 0.0469096
+0.0293349 0.108769 0.0355782
+-0.0628076 0.0881622 -0.0190458
+0.0438908 0.0973298 0.0041758
+-0.0618594 0.154827 0.00385225
+0.0224603 0.0878572 0.0487762
+-0.0684419 0.0805248 0.0412962
+-0.0414824 0.0817867 0.0423837
+-0.0394972 0.0591632 0.0405173
+-0.0699138 0.0616664 0.0106715
+-0.0256486 0.050648 -0.0266189
+-0.0189668 0.125144 0.0245507
+-0.0548939 0.161294 0.00305835
+0.0593671 0.0566851 0.00917266
+-0.0619624 0.0371632 0.0192279
+-0.0458599 0.129594 0.0221735
+-0.078334 0.175787 -0.0461739
+-0.00822607 0.100046 0.0481626
+-0.0580744 0.136937 -0.00566118
+-0.0915979 0.115467 0.0229868
+0.0255167 0.123738 0.0133816
+-0.0331932 0.0348891 0.047012
+-0.076964 0.129602 -0.00711544
+-0.0598599 0.0358888 0.0454954
+0.0450831 0.0463904 0.0280485
+-0.0315243 0.0802674 0.0412906
+-0.0239631 0.11903 -0.0119726
+-0.0346068 0.0483825 -0.0183276
+-0.0825971 0.103328 -0.00360734
+-0.0887132 0.118572 0.00232339
+-0.0188128 0.082729 -0.0390748
+-0.0866936 0.0833424 0.0154842
+0.00371617 0.0348648 0.0208524
+0.0267042 0.122545 0.0181085
+-0.0738109 0.0935956 -0.0146814
+0.0287557 0.0348074 0.0132587
+-0.0344434 0.174206 -0.0015497
+-0.053794 0.086942 -0.0216962
+-0.0584166 0.126929 0.0401124
+-0.0837712 0.127162 0.0508887
+-0.0249431 0.0907384 -0.0344432
+-0.0817429 0.0748341 0.0165378
+-0.0709721 0.148372 0.0407622
+0.0453179 0.0861686 0.00320477
+-0.052904 0.159748 -0.00276649
+-0.0630387 0.15529 -0.0125891
+-0.0628558 0.170957 -0.0505963
+0.0198342 0.0408002 0.0424386
+0.0114164 0.0403794 -0.0231815
+-0.0270194 0.12568 0.0143315
+-0.0340325 0.126267 0.001455
+-0.0096483 0.171546 -0.0270746
+0.0461889 0.0792428 0.016179
+-0.0314795 0.0774889 0.0410863
+0.00441886 0.0361314 -0.0238164
+0.0140504 0.0379362 -0.0217239
+-0.0064667 0.128955 -0.000718006
+-0.00729042 0.0388645 0.0312728
+-0.0537922 0.14151 -0.001138
+-0.0843649 0.125772 0.0501053
+-0.0489003 0.033496 0.00596365
+-0.00972794 0.166651 -0.0186764
+-0.0537672 0.0812389 -0.0213883
+-0.0327797 0.0337757 0.0180041
+-0.0738907 0.107101 0.0373066
+0.0441357 0.0659575 -7.19207e-05
+-0.0929503 0.128215 0.0122521
+-0.0898716 0.133794 0.0302191
+-0.0643705 0.154697 0.0294695
+0.023375 0.0504685 -0.0225374
+-0.052801 0.0690675 0.0379843
+-0.0823518 0.0966615 0.0320686
+0.00650836 0.0813916 0.0558754
+0.0249135 0.0390596 0.0323329
+0.0422621 0.0746939 -0.00581448
+-0.0239734 0.0636045 0.0427616
+-0.0648684 0.0967433 -0.0176098
+-0.0661842 0.163921 -0.0584969
+-0.0338218 0.0886934 -0.0246941
+-0.0545067 0.102902 0.0418134
+-0.0298032 0.034287 0.0163531
+0.00993007 0.126906 -0.00476687
+-0.0376745 0.0379475 0.0444361
+-0.0658844 0.114191 0.045149
+0.0205436 0.121905 -0.00538746
+-0.0134808 0.108609 0.0426611
+-0.0484883 0.0960313 0.0444485
+-0.0326323 0.125019 -0.000941466
+-0.0254216 0.0999543 -0.0239282
+-0.0410688 0.11258 -0.017122
+-0.0434945 0.0676224 0.0409141
+0.0153651 0.0493118 -0.0259325
+0.00422707 0.0782528 -0.0345112
+0.0285181 0.0968051 -0.0184722
+-0.0597676 0.0796261 -0.0193897
+-0.0714963 0.118989 0.0533881
+-0.0566004 0.0335105 0.0169198
+-0.0880799 0.113511 0.0432934
+-0.0208348 0.0956185 -0.0294009
+-0.010501 0.0759377 0.0571751
+-0.0797391 0.110092 0.0425713
+0.0423965 0.0704871 -0.00480867
+-0.071352 0.110742 0.0439553
+-0.0617103 0.0604885 0.000571471
+-0.000492298 0.0605899 0.0560413
+-0.0819087 0.121685 0.0492514
+0.0133657 0.116504 -0.0155461
+-0.0035043 0.0589584 0.0540181
+-0.0700245 0.0833021 0.0413654
+0.0410401 0.0656705 0.029359
+-0.0623583 0.164673 -0.0485921
+0.027252 0.0549488 0.0409918
+-0.0568093 0.0883611 -0.0215879
+0.0409151 0.0390283 0.00994476
+0.0189976 0.0408013 0.0429893
+0.038497 0.0527286 0.031838
+-0.0436566 0.0592613 -0.0123074
+-0.0456035 0.0504974 -0.010193
+-0.0427107 0.0335694 -0.0203532
+-0.0107484 0.0348144 0.0431359
+0.0366972 0.106807 -0.00382741
+-0.0475 0.109814 0.0383224
+-0.0581584 0.0685383 0.037238
+-0.0888985 0.128369 0.0446279
+-0.0618211 0.164489 -0.0586698
+-0.0622151 0.166391 -0.0605094
+0.000668194 0.039196 0.03081
+-0.0494963 0.0974185 0.0440407
+-0.0327214 0.154341 -0.00788327
+0.00831584 0.0624371 -0.0312473
+-0.0441024 0.124581 0.0229348
+-0.00474585 0.0712867 -0.0359934
+-0.0211964 0.0725528 0.0524066
+0.0440002 0.0888695 -0.00280666
+0.0083541 0.0524293 -0.0297113
+0.0104364 0.0472441 0.0475563
+0.0130443 0.113867 -0.0167218
+0.035717 0.0533288 0.0320909
+-0.0439793 0.169659 0.00035763
+-0.0261771 0.0395393 0.0541115
+0.0142627 0.0751304 -0.0300927
+0.0172008 0.0849074 -0.0286671
+-0.0301348 0.156065 -0.00950629
+0.0153602 0.0672491 0.0520407
+0.038354 0.0547461 -0.00609927
+0.0326073 0.112448 0.0288842
+-0.0230436 0.0879523 0.0537722
+-0.0507107 0.0708743 -0.0151986
+0.00170937 0.0361659 0.0210822
+-0.0106905 0.18126 -0.0286694
+-0.0543257 0.121248 0.0372193
+-0.086895 0.143263 0.0379805
+-0.0300853 0.179019 -0.00589649
+-0.0624495 0.15591 0.022857
+-0.0597659 0.0448149 0.0126042
+0.00226448 0.0346925 0.0189009
+0.00270214 0.10527 -0.0214784
+-0.0843731 0.110309 0.0377873
+-0.0603328 0.153535 0.00105643
+-0.00601124 0.0348376 0.0423067
+-0.0419337 0.160883 0.00416203
+0.025639 0.0740461 0.0458389
+-0.0724467 0.0361675 0.00255211
+-0.0515329 0.0431219 -0.00982617
+-0.0668209 0.036036 0.0339126
+0.0328708 0.0740673 0.0404957
+0.0429413 0.0682748 0.0268013
+-0.0687158 0.171626 -0.0372714
+0.0231488 0.116662 0.0336476
+0.0322304 0.0505255 0.0340589
+-0.0869233 0.112018 0.0232463
+-0.078057 0.0907599 -0.0115869
+-0.0538087 0.119788 0.0361741
+0.00650273 0.121045 0.0359095
+-0.00425882 0.128035 0.0283342
+-0.0558184 0.158024 -0.000144968
+-0.0699106 0.10657 -0.0124287
+0.0101685 0.124401 -0.00806495
+-0.0774125 0.06897 0.0169693
+-0.0204069 0.09844 -0.0243451
+-0.0678094 0.180556 -0.0587896
+-0.0490427 0.0341369 0.0285626
+-0.0112286 0.0338605 -0.0218986
+0.0300773 0.0754873 0.0435133
+0.00030024 0.0612559 -0.033673
+0.000950727 0.129943 0.000110463
+-0.083524 0.154076 0.0213615
+-0.0688604 0.0819375 0.0416515
+-0.0674926 0.0889102 0.043735
+-0.000658033 0.0525337 -0.0307361
+-0.0805064 0.103384 0.0314383
+-0.0596514 0.142474 0.0348633
+-0.00849673 0.105867 0.0437425
+-0.0317522 0.0735748 -0.0285005
+0.0171692 0.0345228 -0.00186568
+-0.0229141 0.111944 -0.0185359
+-0.00375332 0.07411 -0.0361467
+-0.00849121 0.103027 0.0437022
+-0.0323725 0.16532 -0.00484492
+0.0250885 0.119458 -0.00473925
+0.00228893 0.0341509 0.0103163
+0.03989 0.0630598 0.0312004
+-0.0146968 0.175692 -0.019662
+-0.00218576 0.0355897 -0.0160761
+0.0318792 0.0686784 0.0407831
+-0.0783091 0.16249 -0.0249404
+-0.0807007 0.0752735 0.0231846
+-0.00686818 0.0385321 0.0081342
+-0.0114932 0.036278 -0.0256312
+-0.076524 0.178854 -0.050295
+-0.093475 0.1283 0.0242551
+-0.063929 0.0354009 0.0416662
+-0.064733 0.15377 0.0322824
+0.0293628 0.105677 -0.0139766
+-0.0544684 0.119419 -0.0121872
+-0.0878486 0.143233 0.0360974
+-0.0866257 0.081991 0.0115028
+0.0324736 0.0490215 0.0326282
+-0.0472578 0.121113 0.0280085
+0.0275416 0.0349624 0.00541796
+-0.0827616 0.091206 0.0312465
+-0.0627318 0.159944 -0.0435973
+0.0444941 0.0637658 0.0284543
+0.0512305 0.0723962 0.00737259
+-0.0374845 0.100078 0.0419234
+0.00446502 0.0977292 0.050995
+-0.090055 0.132436 0.0352224
+-0.0771832 0.107237 0.0346968
+0.0132863 0.0695708 -0.0313558
+-0.0833513 0.099287 0.0301656
+-0.050588 0.0599426 0.0326193
+-0.0116999 0.0599414 -0.0352829
+-0.0629554 0.156782 -0.0386059
+0.0452979 0.0875774 0.0181674
+0.0367705 0.074074 0.0373409
+-0.0378297 0.12794 0.00447467
+0.000472166 0.0388678 0.0256446
+0.00293826 0.0356401 -0.0151121
+0.0194959 0.11257 0.0373879
+0.0178674 0.103889 -0.0200126
+-0.0197782 0.075693 -0.0390468
+-0.0162539 0.171251 -0.016682
+-0.0719027 0.156807 -0.0389123
+-0.0816716 0.0734987 0.0125379
+0.00248698 0.0399628 0.0461692
+-0.0118767 0.105907 -0.0227385
+-0.0633264 0.159631 -0.0180726
+-0.0147126 0.0384481 0.00298688
+-0.0598094 0.0896854 -0.0200419
+-0.0586861 0.0603162 0.0231261
+-0.0518133 0.0531756 0.0296409
+-0.0201151 0.123178 -0.00639815
+-0.0197736 0.0998405 0.0442778
+-0.00649912 0.118331 0.038456
+-0.0868133 0.0846987 0.0154763
+-0.0052065 0.0389581 0.0316148
+-0.0886495 0.113065 0.0417436
+0.0045077 0.107168 0.0418669
+-0.0635616 0.174109 -0.0525858
+-0.0657828 0.082373 -0.0185031
+0.00281465 0.0379685 -0.0135285
+-0.0863919 0.099468 0.00241821
+0.0544797 0.0539552 0.0258897
+-0.0865727 0.08823 0.0252282
+-0.0778042 0.156927 -0.0169128
+-0.00349196 0.114194 0.0413026
+-0.0523232 0.13528 0.029621
+0.0359531 0.0673443 0.0378699
+0.0103588 0.130588 0.0191927
+0.0383356 0.10264 -0.0058258
+-0.0906686 0.139207 0.0161786
+-0.0534974 0.0876167 0.045276
+-0.0609918 0.138116 0.0346365
+-0.010493 0.114167 0.0405696
+-0.0260866 0.0349169 0.0485155
+-0.0519529 0.0531525 0.0236322
+-0.0670544 0.153567 -0.0495044
+-0.000486159 0.0689333 0.056515
+-0.034827 0.0929417 -0.0239227
+0.0157074 0.0821031 0.0526782
+-0.0185046 0.116829 0.0366774
+-0.0357116 0.0358916 0.0155029
+-0.0711005 0.148774 -0.0369587
+-0.0146296 0.185817 -0.0244743
+-0.0871678 0.11039 0.0183619
+-0.0897192 0.129664 0.0425949
+-0.0278047 0.074956 0.0433932
+-0.0408028 0.033851 -0.0276993
+-0.0260362 0.165356 -0.00798775
+-0.022832 0.0348259 0.0458328
+-0.0327846 0.0346162 0.0403814
+0.0292084 0.0350186 0.0149853
+-0.0908558 0.14471 0.0151666
+-0.0389013 0.0336802 -0.0215651
+-0.00950572 0.0590791 0.0548422
+-0.0252687 0.0931263 -0.0308668
+0.00727173 0.0667978 -0.0321541
+-0.0478216 0.109884 -0.018362
+0.00164525 0.0348132 0.00406568
+0.0377191 0.0632143 0.0350986
+-0.0468821 0.108426 -0.0186436
+0.0252001 0.0818001 -0.0245703
+0.00238035 0.127411 0.0292755
+0.0255053 0.103245 -0.0173339
+0.011492 0.0445292 0.0444785
+0.0458991 0.0414061 0.011234
+-0.0302302 0.0537755 -0.0183734
+-0.0870355 0.111737 0.0342553
+0.0298569 0.0835122 0.0432289
+0.0344154 0.0409101 0.0271225
+0.00697892 0.131225 0.0065571
+0.0443985 0.0748779 -0.000803542
+-0.0703751 0.112557 0.0480687
+0.0398576 0.101362 0.0261824
+-0.0146217 0.0450296 -0.0279689
+0.0305372 0.0592022 0.0405121
+-0.0427308 0.169809 0.000879537
+-0.00260639 0.0419888 -0.0252454
+0.000821596 0.0412233 0.0465397
+0.0447686 0.0889311 -0.000811854
+-0.00992934 0.166943 -0.0180552
+-0.0743075 0.170773 -0.046055
+-0.0564797 0.0356812 -0.0108166
+0.0302902 0.078207 0.0438447
+-0.0601407 0.0410386 0.0173224
+-0.0404944 0.0478337 -0.0126145
+-0.00989846 0.0384846 0.0238656
+-0.0338875 0.0780022 -0.0265044
+-0.0309197 0.0805646 -0.0325792
+-0.0788495 0.1177 0.0505094
+0.00204515 0.0345955 -0.0162029
+-0.0115453 0.0445033 0.0495732
+-0.048476 0.116631 0.0320328
+-0.0121876 0.113225 -0.0179296
+-0.0193167 0.0754023 0.0546877
+-0.0653246 0.0648097 0.0284194
+-0.0417336 0.0739469 -0.0182277
+0.0129121 0.0806948 0.0538726
+-0.087913 0.0900756 0.00446758
+-0.0459794 0.167363 0.00259136
+-0.00407632 0.124795 0.032822
+0.00214512 0.131665 0.0104804
+-0.0242177 0.0387671 0.0542484
+-0.0864391 0.131188 0.0477462
+0.0208043 0.12624 0.020186
+-0.0682771 0.163789 -0.0539724
+-0.0225729 0.172715 -0.0135004
+-0.0434823 0.12913 0.00531313
+-0.0465355 0.0790498 0.0431447
+0.0415243 0.0623608 0.0290336
+0.0206713 0.0868458 -0.0260413
+-0.0616015 0.0614498 -0.00273471
+-0.0698033 0.087974 -0.016854
+0.00908719 0.0358267 -0.00842564
+-0.0333922 0.068118 -0.0184774
+-0.0820819 0.150001 0.0344048
+0.0348029 0.113058 0.00110003
+-0.00477205 0.0345951 0.0445699
+-0.0740526 0.172196 -0.0480444
+-0.0192069 0.125855 0.0229991
+-0.0404977 0.0520197 0.0394004
+-0.0367886 0.156481 -0.0105439
+-0.0531367 0.0490718 0.026657
+0.015473 0.0962531 0.0481291
+-0.0492612 0.115146 -0.0157671
+0.0536465 0.0728799 0.00890065
+-0.0263571 0.0549776 0.0383278
+0.0333229 0.0997779 -0.013667
+-0.0551968 0.138069 -0.00309725
+-0.0563111 0.122698 0.0396267
+-0.02088 0.107273 -0.0222055
+0.000924532 0.100829 -0.0227814
+-0.0907853 0.117276 0.00630342
+-0.0134985 0.11551 0.0389419
+-0.0921826 0.114725 0.0193089
+-0.0218136 0.116051 -0.0148581
+-0.0915139 0.140599 0.0171878
+-0.0723659 0.100858 0.0389128
+-0.0227439 0.0669905 -0.0360641
+0.0133914 0.0448806 -0.0247967
+-0.0334245 0.0346344 0.0419763
+-0.083931 0.103265 0.0277985
+-0.0172469 0.116672 -0.0155678
+0.0141307 0.108667 -0.0183815
+-0.0676215 0.0688155 -0.00772966
+-0.049646 0.138599 0.0173958
+-0.0836562 0.0966099 0.0305537
+-0.0662913 0.165749 -0.0234747
+0.0434836 0.0734019 -0.00279222
+-0.0672802 0.0405919 -0.00423161
+-0.0468922 0.0334761 -0.010008
+-0.00688399 0.107372 -0.022762
+-0.0471129 0.13404 0.0104021
+-0.0613177 0.0470312 0.00669678
+-0.0857102 0.0912822 0.000468321
+-0.0564836 0.0589584 -0.00242578
+-0.0544716 0.0607811 0.0269495
+0.0392359 0.0685928 0.0338195
+-0.0907738 0.125596 0.0437739
+-0.0123469 0.0383491 0.0216787
+-0.00750765 0.123161 -0.01054
+0.0441233 0.0959295 0.00318315
+0.0262791 0.0675449 -0.0231801
+-0.0432671 0.0465873 -0.0113888
+0.00633058 0.0567988 -0.0308016
+-0.0135852 0.123715 -0.00700086
+-0.00140945 0.12836 0.0278943
+-0.0283882 0.0380697 -0.0179434
+0.0478387 0.0734572 0.0126134
+0.0038745 0.0367677 -0.0140867
+-0.05057 0.0335281 0.00739754
+0.036728 0.111857 0.010401
+-0.00844614 0.128164 -0.00189615
+-0.0247501 0.0578943 0.0408638
+-0.0467618 0.0657183 0.0385512
+0.038544 0.0726461 0.034619
+-0.00748755 0.111393 0.0423782
+-0.0658988 0.116581 -0.00961273
+-0.0415297 0.118854 -0.0137293
+-0.062219 0.164671 -0.0505894
+-0.00870995 0.128748 0.0252759
+-0.0315128 0.115295 0.0334421
+0.0503991 0.0466746 0.0233055
+-0.0753594 0.113961 -0.00568407
+-0.0866603 0.10494 0.00737931
+-0.0457163 0.0345386 0.0341935
+-0.0466235 0.0548092 -0.0105711
+-0.0516722 0.0693248 0.037985
+-0.0826957 0.0898386 0.0312187
+-0.0154881 0.0758696 0.0561745
+-0.0518084 0.0913012 -0.0220555
+-0.0751346 0.145812 -0.00886348
+-0.0732189 0.155097 0.0278276
+-0.0127272 0.0348945 -0.0256797
+-0.0698308 0.071946 0.0353261
+-0.0657288 0.163321 -0.0189522
+-0.0464914 0.08757 0.0446532
+0.0296359 0.112746 0.0324848
+0.0275411 0.044881 0.0360262
+-0.0187772 0.186086 -0.0166294
+-0.0884282 0.0874635 0.00747939
+0.0325508 0.115423 -0.000329209
+-0.0410423 0.0336551 0.000178151
+-0.0638018 0.0632948 0.0265284
+-0.0224569 0.0524128 0.0435307
+0.057327 0.0700157 0.00587175
+0.0345611 0.0740948 0.0394254
+-0.0409173 0.0351021 0.0417247
+-0.0742127 0.154103 -0.0229066
+-0.0824094 0.151775 0.0307901
+-0.0803828 0.11899 0.049226
+-0.010458 0.0953808 -0.0330949
+-0.0630414 0.149018 -0.0195802
+-0.0293211 0.123712 0.0208659
+-0.0231795 0.0622145 0.0434152
+-0.0287301 0.172704 -0.00834509
+0.00364827 0.128043 -0.00393793
+-0.0642706 0.166732 -0.060237
+-0.0108397 0.175678 -0.0290324
+0.0244048 0.112688 0.0354614
+-0.047561 0.0361661 -0.0123414
+-0.0534987 0.0427392 0.045857
+-0.0231257 0.165273 -0.0171671
+0.0388181 0.104067 -0.00210374
+-0.0356652 0.156121 -0.0104266
+-0.072524 0.106883 0.0374001
+-0.0331471 0.172636 -0.0149853
+0.040265 0.0391745 0.017119
+-0.0342456 0.0708723 -0.0195447
+-0.0687416 0.11428 0.0497375
+-0.0559525 0.0473442 0.0115659
+-0.0244817 0.107102 0.0411704
+-0.00571075 0.0627939 -0.0354611
+0.00805559 0.124767 0.0327601
+-0.0144892 0.0800879 0.0568709
+-0.0444848 0.0775765 0.0423436
+-0.063261 0.129725 0.0418859
+0.0349031 0.111324 -0.00180439
+0.00654043 0.0954774 -0.0291051
+-0.0290961 0.0410008 0.0527549
+-0.0234218 0.0738847 0.0503501
+-0.0567453 0.0342237 0.02862
+0.0376516 0.0425419 0.0281451
+0.0336732 0.115326 0.0207292
+-0.0174938 0.122238 0.0311921
+-0.073145 0.152886 0.0338966
+0.0392908 0.0660103 -0.00977956
+-0.0671096 0.125666 0.0504247
+-0.0815589 0.10988 0.0387619
+-0.00472043 0.0655745 -0.0349603
+-0.0584923 0.0818911 0.043717
+0.0395145 0.0415874 0.025748
+-0.0134628 0.0989564 0.047529
+-0.086226 0.143316 0.0387173
+-0.0675131 0.145595 0.0418048
+-0.0142233 0.174199 -0.0261217
+-0.0564238 0.0718073 0.0399857
+-0.0748487 0.0664559 0.00653551
+0.0254329 0.0835701 0.0474102
+-0.0735012 0.145587 0.0437725
+-0.0684894 0.104161 0.0391613
+0.046334 0.0533506 -0.00578803
+0.0111342 0.034487 -0.019828
+-0.0362745 0.033679 0.00474125
+-0.0580289 0.129633 -0.0066561
+-0.0674348 0.171149 -0.0382253
+0.0172278 0.0353072 0.0394845
+0.0290523 0.120756 0.00899975
+-0.0788357 0.148682 -0.00186858
+-0.0257486 0.0365571 0.0540093
+-0.076603 0.120411 0.0526033
+-0.0107827 0.0784509 -0.0379132
+-0.0283013 0.0648191 -0.0294785
+-0.0318386 0.0929851 -0.0242124
+-0.0504991 0.156412 0.0101915
+0.0435836 0.0722927 0.0259867
+0.0187342 0.112585 -0.0153321
+-0.0434831 0.0762058 0.0427502
+-0.00415334 0.0367895 0.0481682
+-0.0469304 0.116649 -0.0154073
+-0.0434764 0.0335212 0.0034233
+-0.0527322 0.0723715 -0.0160877
+-0.0593593 0.0651443 0.0328932
+-0.05784 0.0926528 -0.0211082
+-0.07134 0.156839 -0.0007386
+-0.000856246 0.103081 -0.0226647
+-0.000582144 0.0347482 -0.0236897
+-0.0384944 0.0464446 0.0402202
+0.0567142 0.0522491 0.00518691
+-0.0616825 0.0346164 0.0411183
+0.00851655 0.0758606 0.0561295
+0.0196258 0.127091 0.0083394
+-0.0719446 0.159605 -0.0399328
+-0.0356475 0.0379034 -0.0136529
+0.0172444 0.125917 0.0260258
+0.0094903 0.116849 0.0377607
+0.0232634 0.124781 0.0210949
+-0.0349607 0.125018 0.0217662
+0.0185443 0.12732 0.00510228
+0.0118903 0.0349087 0.0279111
+-0.00450764 0.0842735 0.0572857
+-0.0148777 0.0364156 0.0513074
+-0.0861402 0.0859086 0.000475654
+-0.0472303 0.164057 -0.00679428
+0.010042 0.0970288 -0.0247384
+0.0134328 0.0846923 0.0528905
+0.0456558 0.0449086 0.0258493
+-0.00349992 0.0746709 0.0587938
+-0.0719223 0.112846 0.049279
+-0.0117304 0.0670858 -0.0365895
+-0.0107336 0.0670714 -0.0363227
+0.0281295 0.110111 0.0355841
+0.00524969 0.0395071 0.0332712
+-0.030417 0.0360576 0.0517185
+-0.0191865 0.172705 -0.0222871
+0.032634 0.0954843 -0.0150589
+-0.0901468 0.129651 0.0415795
+0.015143 0.0346779 0.0251566
+-0.0926446 0.122835 0.02928
+-0.0735699 0.131215 0.0516643
+-0.0342826 0.126777 0.01609
+0.00752119 0.0813632 0.0555605
+-0.0325031 0.116645 0.0321616
+0.0237641 0.0349876 0.0120857
+-0.0592101 0.142401 0.0336275
+0.0449966 0.0931749 0.00418165
+0.0373285 0.0874946 0.0364747
+0.0175277 0.0348888 -0.0135142
+0.0451983 0.0889806 0.0171667
+0.0123957 0.0434077 -0.0245497
+-0.0759299 0.126701 -0.00794305
+-0.0895421 0.090213 0.0124508
+0.0392717 0.0938049 -0.00924672
+-0.087269 0.112677 0.0244432
+0.0369017 0.0770479 -0.0128074
+-0.019615 0.127443 0.00679651
+-0.058632 0.131139 0.0380532
+-0.0759599 0.0675387 0.00855626
+-0.0867924 0.139107 0.00519652
+-0.051888 0.0528335 0.0130005
+-0.0604943 0.108372 0.0386396
+-0.0620497 0.155563 0.0244621
+-0.0414999 0.0690877 0.0417125
+-0.000194321 0.121911 -0.011267
+0.0260147 0.0563895 0.0427437
+-0.00627779 0.0395112 0.048561
+0.0073902 0.0433817 -0.0245369
+0.00650458 0.105723 0.0419107
+-0.0890324 0.144705 0.01118
+0.0241216 0.0968854 0.045587
+-0.0284948 0.111359 -0.0178892
+-0.0842319 0.104575 0.0266516
+-0.0575865 0.0586919 0.0194779
+-0.0281815 0.125725 0.0109634
+-0.0638193 0.158306 -0.0465978
+-0.0355455 0.11407 -0.0167228
+-0.0683421 0.111385 0.0423299
+-0.0144529 0.178665 -0.0210547
+-0.00977952 0.0372711 0.0498001
+-0.0625714 0.164724 -0.0395894
+-0.088699 0.0915828 0.0224195
+-0.0594754 0.144099 -0.00268098
+-0.0925679 0.116061 0.0213084
+-0.0317212 0.0350332 0.0489115
+-0.0106525 0.165176 -0.016643
+0.00734712 0.12316 -0.0106668
+-0.0554936 0.104327 0.041387
+0.00250176 0.0620246 0.0566613
+-0.00947595 0.130265 0.0133884
+0.0276842 0.0768145 0.0453329
+0.00629218 0.0639808 -0.0323017
+0.00798329 0.130466 0.00265255
+0.0573764 0.0621793 0.0248727
+-0.0628961 0.158419 -0.0175871
+-0.0639761 0.129691 -0.00851425
+-0.0630898 0.161515 -0.0224551
+-0.0838815 0.111187 0.0425305
+0.0464938 0.0778639 0.0121785
+-0.0265128 0.116639 0.0325108
+-0.0545075 0.047347 0.012948
+-0.0677458 0.149084 -0.0355035
+-0.0687437 0.173038 -0.0415702
+-0.0258142 0.0389536 0.0363636
+0.0354622 0.0808406 0.0390375
+-0.028407 0.156859 -0.0100656
+-0.0728523 0.100773 -0.0133449
+-0.000973441 0.0353569 0.0464761
+0.0217031 0.104101 -0.0182402
+-0.0900893 0.135135 0.0242145
+-0.0209098 0.0382599 0.00734769
+-0.0384975 0.0676842 0.0417259
+0.0505086 0.0461176 0.0032623
+-0.0324927 0.0932098 0.0444316
+-0.029469 0.17882 -0.00554327
+-0.0770271 0.0743283 0.0300122
+0.0313581 0.116535 0.0255569
+-0.0772285 0.173502 -0.0405421
+0.0114915 0.130592 0.00962923
+-0.0739058 0.125263 -0.00826143
+-0.0709356 0.0780686 0.0386829
+-0.0450603 0.156487 0.00667449
+-0.00258285 0.0361873 -0.0247048
+-0.00135222 0.101336 0.0444015
+-0.0894746 0.139279 0.0281819
+-0.00967152 0.0968708 -0.0306358
+-0.0704928 0.117562 0.0527864
+-0.0678494 0.155094 0.00351036
+-0.0752747 0.175704 -0.0425921
+-0.032145 0.0863362 -0.0265533
+-0.0345086 0.0775176 0.0416541
+0.0409071 0.0711839 0.0309718
+0.0182107 0.084868 -0.0280483
+0.037986 0.0861315 0.0356473
+-0.0158582 0.107196 -0.0215252
+-0.0536497 0.0382495 -0.0113033
+0.0400088 0.107038 0.00721094
+-0.0111671 0.0867859 -0.0382994
+-0.0758579 0.0963896 -0.0129621
+0.00275941 0.0343655 0.0174794
+-0.0528912 0.109829 -0.018387
+0.0352142 0.037348 0.0177424
+-0.0770086 0.090082 0.0382275
+-0.0537852 0.0344427 0.037794
+-0.0317722 0.0335835 -0.0256749
+-0.0533077 0.12062 -0.0114531
+-0.0670377 0.155239 -0.0519345
+0.0248201 0.0343822 0.00913252
+-0.077345 0.0838842 -0.0115833
+0.0143045 0.0638067 -0.0299257
+-0.00129201 0.123843 -0.0093277
+0.0380905 0.0941294 0.0341306
+-0.0932985 0.125478 0.0122618
+-0.034118 0.163722 -0.0147399
+0.0298704 0.114081 0.0310466
+0.0255132 0.110081 0.0370706
+-0.0476672 0.0405803 -0.0117113
+-0.0472716 0.130968 0.0245047
+-0.0619845 0.128209 -0.0080954
+-0.0644855 0.0917771 0.0443552
+0.00846054 0.0341727 0.000449307
+0.000942621 0.0347668 0.0167534
+-0.0160225 0.0958165 -0.0315688
+-0.0534556 0.0353304 0.0456783
+0.0142349 0.129723 0.0106274
+-0.0726014 0.0365856 0.00586956
+0.033081 0.038417 0.0236373
+-0.0678588 0.128454 0.0493479
+0.0276968 0.0797349 -0.0226793
+0.0317217 0.0639399 -0.0186866
+-0.00482566 0.0896201 -0.0359284
+-0.0704978 0.124601 0.053003
+-0.00149487 0.115594 0.0408235
+-0.0360812 0.0358497 0.0136623
+-0.00514848 0.0385788 0.00662082
+-0.0791696 0.110508 0.0441428
+-0.0215028 0.0448835 0.0530162
+0.0173223 0.0699836 0.0514025
+0.0379734 0.0672941 0.0355158
+-0.0858805 0.0926571 0.00145452
+0.00396412 0.0977772 0.0510597
+-0.0656399 0.11715 0.0490043
+-0.0771179 0.165222 -0.035974
+-0.0198829 0.0383003 0.00206982
+-0.0187849 0.159551 -0.0109781
+-0.0655235 0.0347285 0.0315692
+0.0298088 0.0848631 0.0431899
+-0.0202144 0.186446 -0.0187314
+-0.0737921 0.165213 -0.0399888
+-0.0287531 0.0767493 -0.0350292
+-0.0108764 0.178532 -0.0297831
+0.00248459 0.114158 0.0410016
+0.0523216 0.0588453 -0.00357691
+-0.0424144 0.147803 0.00244515
+-0.0387777 0.0827042 -0.0213153
+-0.0338762 0.105703 -0.0205658
+-0.087924 0.1365 0.0420055
+-0.0747046 0.0837005 -0.0145969
+-0.0657521 0.033742 -0.00672308
+-0.045381 0.0381676 -0.0212668
+-0.0868004 0.0846768 0.00848321
+0.0294149 0.118962 0.0248216
+-0.034174 0.107559 -0.0198979
+0.0280502 0.0740858 0.0440821
+-0.0776167 0.0914005 0.037394
+0.0235133 0.0407023 0.0389233
+-0.0568656 0.102623 -0.018982
+-0.0678684 0.063022 0.000880975
+0.0360361 0.100737 0.0329764
+-0.0922724 0.125575 0.0332589
+-0.0929242 0.120168 0.0332909
+-0.018498 0.108568 0.0416031
+0.0174435 0.128281 0.0160914
+-0.0242219 0.178615 -0.0196227
+-0.0704096 0.163806 -0.0479588
+-0.0810819 0.0814326 -0.00557353
+-0.0595808 0.0380953 -0.00917151
+-0.00023307 0.0988811 0.0510016
+0.00703854 0.0344034 -0.0150394
+-0.092972 0.125468 0.0112596
+-0.00348845 0.115565 0.0406522
+-0.000499736 0.11143 0.0424297
+-0.00349598 0.0562185 0.05401
+0.0274875 0.0380349 0.0264602
+-0.0191507 0.168261 -0.0198644
+-0.0708777 0.131245 0.0502751
+-0.0591241 0.1154 0.0371963
+0.015252 0.122005 -0.00948865
+-0.0238533 0.0958019 -0.0255967
+-0.0225065 0.111294 0.03935
+0.0394335 0.0834241 0.0342316
+-0.0599597 0.121237 0.0413621
+-0.0151227 0.160977 -0.0122661
+-0.0856126 0.0792275 0.0145081
+-0.0304111 0.0336116 -0.02356
+-0.0300276 0.0875944 -0.030572
+-0.0387164 0.0695709 -0.0161311
+-0.0658849 0.153363 -0.0443952
+-0.0108819 0.168382 -0.0176467
+0.0450682 0.090383 0.0171641
+-0.0624967 0.149081 -0.013576
+-0.0222042 0.178612 -0.0212581
+0.0294982 0.120461 0.0105965
+-0.0414977 0.115265 0.0337662
+-0.0499421 0.135837 0.0234945
+-0.0843142 0.152356 0.00793113
+-0.0410616 0.156231 -0.0095971
+-0.0238697 0.104438 -0.0232028
+-0.0067213 0.065597 -0.0353344
+-0.0108037 0.0827117 -0.0384206
+0.0138699 0.049008 0.0461763
+0.016266 0.0750624 -0.0291952
+-0.0813824 0.099165 -0.00657823
+-0.0355882 0.126454 -0.000576513
+-0.0627783 0.0343233 0.0272634
+-0.0864194 0.133874 0.0462429
+-0.0424946 0.0972875 0.0422451
+-0.00875136 0.116762 -0.015718
+-0.00610573 0.035829 0.0485597
+-0.0634859 0.146784 0.0381458
+0.00949393 0.109876 0.0399119
+-0.0286135 0.0817842 -0.0355888
+-0.0785092 0.126003 0.0529555
+-0.0564526 0.0602802 -0.00348733
+-0.0632263 0.153648 -0.0346156
+-0.0212315 0.0839098 0.0563274
+-0.0185478 0.0382321 0.00966598
+-0.0629734 0.126755 -0.00855487
+-0.0607657 0.139716 -0.00595313
+-0.0192289 0.178619 -0.0235673
+-0.0154933 0.0730227 0.0553537
+0.0208153 0.0564412 0.0475406
+-0.0390833 0.0486663 -0.0122287
+-0.065493 0.153273 0.0335324
+0.0608914 0.0637395 0.0141606
+-0.0153829 0.18014 -0.0206255
+-0.0822314 0.0842513 -0.00555381
+-0.0678037 0.0880304 -0.0174902
+0.0361089 0.0577094 0.0344737
+-0.0464121 0.035458 -0.0187253
+-0.0666201 0.0338653 0.00919115
+-0.0674808 0.0688292 0.0332504
+-0.0659293 0.156005 0.0129201
+-0.0294246 0.0861745 0.0444819
+-0.0581309 0.155502 0.017154
+-0.0726537 0.15621 0.0148854
+-0.0168438 0.180138 -0.0192059
+-0.0656741 0.0356447 0.0159226
+0.0163545 0.0507599 -0.025927
+-0.0293383 0.123554 -0.00265044
+0.00679991 0.131589 0.0107583
+-0.0398245 0.0942915 -0.0229995
+-0.0945717 0.122812 0.0182725
+0.00440363 0.0390362 -0.0241943
+-0.0798195 0.105901 -0.00558882
+-0.0117856 0.0813065 -0.0386038
+0.00749342 0.0372096 -0.0118978
+-0.0744971 0.176396 -0.0436946
+-0.00968478 0.0584187 -0.0340646
+0.0312312 0.117425 0.00123717
+0.0184875 0.0976002 0.0470854
+-0.0716235 0.0693585 0.0301698
+0.039816 0.0393083 0.00327619
+-0.0835287 0.11032 0.027366
+-0.0245014 0.043543 0.0534366
+0.0370893 0.106835 -0.00283087
+-0.0567623 0.154944 0.0190948
+-0.0275761 0.125766 0.0126577
+-0.00827698 0.0408222 0.049207
+0.0553826 0.0699889 0.0228528
+0.012476 0.0976634 0.0485624
+0.0597169 0.0580863 0.0181825
+-0.0261346 0.168251 -0.00989215
+-0.0319337 0.0680008 -0.0224492
+-0.0367004 0.0680804 -0.0157124
+-0.0192371 0.0959207 0.0497533
+-0.0482812 0.115062 -0.0157267
+-0.0625405 0.132491 0.039434
+-0.0464975 0.163768 0.00545168
+-0.0809296 0.0885877 0.0337432
+-0.0341216 0.0395911 0.0493113
+0.0322123 0.0856789 -0.0192748
+-0.0822934 0.0775365 0.000511811
+0.00709964 0.0342068 0.00386204
+-0.086438 0.0832915 0.00949498
+-0.0244616 0.0474336 0.050725
+0.00565547 0.0365592 0.0251573
+-0.0274618 0.045988 0.0503593
+0.010522 0.119127 0.036469
+-0.0736141 0.151246 -0.0348888
+-0.024687 0.0892375 0.0511394
+0.00296667 0.0390863 0.0277676
+-0.0494919 0.154959 0.0103413
+-0.058864 0.139321 -0.00549203
+-0.0327877 0.082138 -0.0285334
+-0.0423065 0.150496 -0.00548521
+-0.0631749 0.149 -0.0205832
+-0.0218319 0.0363367 -0.0187811
+-0.0723757 0.0638786 0.0154336
+-0.0358563 0.126885 0.000788129
+0.0192111 0.080597 -0.0276192
+-0.0620809 0.0336347 -0.00771095
+-0.0313625 0.0510794 -0.0143586
+-0.063822 0.115596 0.0429106
+-0.0645614 0.138204 0.0400205
+-0.0824235 0.124446 0.0510342
+0.0555936 0.0567472 0.0257684
+-0.0293723 0.0422984 0.0515712
+0.0526995 0.0702438 0.0035897
+-0.0647148 0.06349 0.0261636
+0.00450679 0.0702611 0.0557926
+-0.0421206 0.171253 -0.0079388
+-0.00823225 0.127328 0.0283641
+0.0085198 0.0716538 0.0557746
+-0.0603515 0.116839 0.0389782
+-0.0758447 0.151365 -0.0158827
+-0.0913489 0.117296 0.00730629
+-0.0787438 0.101744 -0.00857364
+-0.0758718 0.109158 -0.00765228
+0.0141976 0.0850086 -0.0301852
+0.0110282 0.0968851 -0.0245853
+-0.0821235 0.0802564 0.0295192
+-0.0500787 0.154631 -0.00525635
+-0.0278864 0.105837 -0.0222471
+-0.0355149 0.0804148 0.0426568
+0.0156112 0.0519525 0.0469795
+-0.0758417 0.114903 -0.00554375
+-0.00130995 0.124776 -0.00834251
+-0.0285122 0.180211 -0.00692909
+0.0124807 0.0949598 0.0504131
+-0.0679136 0.113718 -0.0102762
+-0.0871543 0.105024 0.0183639
+0.0375648 0.0926236 -0.0120119
+-0.0297787 0.125132 0.0177406
+-0.0253546 0.121816 0.0267508
+0.0463872 0.0806547 0.00917972
+-0.0386145 0.0492284 -0.011639
+-0.0604969 0.0918487 0.0452694
+-0.0754744 0.151328 -0.022882
+0.0184783 0.101734 0.0458501
+-0.0250671 0.0385158 0.031526
+-0.0384759 0.091717 0.0434324
+-0.0394992 0.0916803 0.0429883
+-0.0668335 0.143964 0.0420823
+-0.0653424 0.0629827 0.0247148
+-0.0644392 0.112372 0.0382632
+0.0242087 0.039076 0.0343007
+-0.0535427 0.0402957 -0.0106063
+-0.082326 0.0748249 0.00451639
+-0.0544972 0.0959632 0.0436086
+-0.020823 0.0868434 -0.0377816
+-0.0636947 0.167813 -0.0415938
+-0.0448731 0.128505 0.000263047
+-0.0608825 0.0996865 -0.0185327
+0.0079329 0.0630739 0.055296
+0.00434495 0.0973121 -0.027058
+-0.091323 0.113292 0.0153266
+-0.0074977 0.0801462 0.0578122
+-0.0899881 0.118599 0.00429898
+-0.072593 0.155911 0.00171291
+0.00944326 0.128939 -0.000930002
+-0.0669203 0.110822 0.0381745
+-0.0378406 0.0957387 -0.0228102
+-0.00994641 0.0339021 -0.0251924
+-0.0261195 0.0706905 0.0432458
+0.0285346 0.121033 0.017364
+-0.0702811 0.17421 -0.0421289
+-0.00949024 0.104446 0.0436658
+-0.0877186 0.105023 0.0153645
+0.0487537 0.043125 0.0102298
+-0.0709615 0.148056 -0.0324394
+-0.0785455 0.146115 0.0422588
+-0.0777749 0.150053 -0.00387978
+-0.0747481 0.158885 -0.00783629
+0.022966 0.0347513 0.0194226
+-0.000497806 0.0842866 0.0575088
+0.0329127 0.116986 0.00902312
+0.0303386 0.119339 0.00661655
+0.0335365 0.0483507 0.0312493
+-0.0506321 0.0530807 0.0328365
+-0.0283907 0.123379 0.0211752
+0.043167 0.0831963 -0.0047762
+-0.00976599 0.121876 -0.011136
+-0.0836817 0.0786288 0.0214472
+-0.0584699 0.0344613 0.0385122
+-0.031399 0.116965 -0.0137545
+-0.0679334 0.145349 0.0422649
+0.0355447 0.11347 0.012835
+-0.0343438 0.0384811 -0.00836679
+-0.0303159 0.0678299 -0.0274662
+0.030827 0.0835413 0.0428747
+-0.0367713 0.0871639 -0.0235593
+-0.0249824 0.117062 -0.0139085
+-0.0633873 0.169402 -0.0465883
+-0.0567938 0.0498747 0.00808849
+-0.0719281 0.148635 -0.0350398
+-0.0764024 0.150045 -0.00692327
+-0.085242 0.115675 0.000251725
+0.0352163 0.0367258 0.0146563
+-0.0476332 0.0345872 0.0389835
+-0.0306482 0.0819602 -0.032565
+-0.0258283 0.172717 -0.011167
+-0.0745076 0.115686 0.0517763
+-0.0625234 0.0413191 -0.00677899
+-0.02745 0.110307 -0.0187882
+-0.0444951 0.104328 0.0415155
+-0.0774643 0.155549 -0.0139037
+0.0154943 0.105779 0.0433144
+-0.00688511 0.0982482 0.0516445
+-0.0476227 0.122378 -0.0113753
+-0.0830725 0.139367 0.045586
+-0.0431901 0.039319 -0.0232745
+0.00551778 0.0828244 0.0566316
+-0.0364708 0.152123 0.0014574
+-0.00749897 0.0815283 0.0577578
+-0.0165021 0.118207 0.0361456
+0.013481 0.0358562 0.0436245
+0.0102178 0.0836927 -0.0316174
+0.0514697 0.0462224 0.00523719
+0.0399822 0.0910991 -0.010396
+-0.0510223 0.0339346 0.00874224
+-0.0327803 0.0793117 -0.0285199
+0.0549936 0.0732019 0.0123756
+0.0461994 0.0750316 0.00518987
+0.0371924 0.0391306 0.0220088
+-0.0737191 0.152664 -0.0318934
+-0.0548531 0.149577 0.0276913
+-0.00305215 0.125834 0.0316944
+-0.021742 0.0389771 0.0371835
+0.0252695 0.0532659 -0.021679
+-0.0633235 0.0388939 0.025715
+-0.053898 0.105542 -0.0189379
+-0.0718855 0.122345 -0.00846405
+-0.0334848 0.0561021 0.0379001
+-0.0635384 0.061476 -0.00191873
+0.0137785 0.0346695 0.0230735
+0.0204936 0.1267 0.00866396
+-0.0258672 0.156547 -0.00846874
+-0.089402 0.0996815 0.0144017
+-0.010288 0.172711 -0.0218803
+0.00772266 0.115023 0.0394097
+-0.0363729 0.176071 -0.00683571
+-0.0525546 0.0444744 -0.00849373
+-0.0577063 0.155408 0.0158579
+-0.0512663 0.12652 -0.00563382
+-0.0277699 0.0661915 -0.0304661
+-0.0394907 0.0422995 0.0416287
+-0.0592646 0.0346371 0.0433189
+-0.0917594 0.117442 0.030311
+0.0188028 0.0349604 -0.00569856
+-0.0184644 0.0528818 0.0482087
+-0.0649365 0.1467 -0.0209465
+-0.0397769 0.152293 -0.00702124
+0.056742 0.0696177 0.0218717
+0.0435205 0.0637429 0.0281056
+0.0514429 0.0626408 -0.00275857
+-0.0668197 0.100942 -0.0159632
+-0.078886 0.0812827 -0.00855752
+0.0483563 0.0710513 0.00477309
+-0.0415729 0.151549 -0.00635576
+-0.0122139 0.169818 -0.0178463
+-0.0454996 0.163749 0.00555272
+-0.0779251 0.168693 -0.0322923
+-0.0455017 0.0973341 0.0429686
+-0.0932761 0.122751 0.0112823
+-0.00193792 0.0388572 0.00152241
+0.0379602 0.108292 0.00117706
+0.0447742 0.0777119 -0.00080388
+-0.0365645 0.0341557 0.0276322
+-0.077566 0.155252 0.0102497
+-0.00781043 0.0346187 0.0439246
+0.0218954 0.061892 0.0473866
+0.0229726 0.108506 -0.0149598
+0.0350891 0.111006 -0.00183676
+0.00866181 0.128565 0.0271896
+0.00435977 0.0481043 -0.0288152
+-0.00551112 0.0390255 -0.00865823
+-0.0205328 0.113457 -0.0181494
+-0.0851368 0.0832799 0.0224738
+0.00348766 0.115539 0.0402625
+-0.0174898 0.105786 0.0424611
+-0.087451 0.133828 0.0444349
+0.00492538 0.111581 -0.020193
+0.0318279 0.0713659 0.0407221
+-0.0121811 0.0984293 0.0498089
+-0.0747959 0.149331 0.0394056
+-0.0571923 0.0344404 0.0353306
+0.0154304 0.0417921 -0.0229429
+-0.0481114 0.159106 -0.00699154
+-0.0285 0.0960446 0.0448096
+0.0354946 0.0642547 -0.0137843
+-0.0204882 0.0388257 0.0339872
+0.0353716 0.0741014 0.0388421
+-0.0157653 0.161968 -0.0148041
+0.00551566 0.0799926 0.0558154
+0.0181043 0.128017 0.0106305
+-0.0644854 0.0986987 0.0423063
+-0.0415014 0.0492193 0.0396812
+-0.0900528 0.132428 0.0342227
+-0.0126494 0.0496668 -0.0310907
+-0.0321289 0.0337822 0.0109163
+-0.0625403 0.149101 -0.00657536
+-0.0124899 0.104431 0.0434394
+-0.0728072 0.15012 0.0385587
+-0.0275374 0.156717 -0.00957418
+-0.0627683 0.04307 0.0276693
+0.00651507 0.0344231 0.0163793
+-0.0631947 0.163133 -0.0265887
+-0.0264832 0.105687 0.0411729
+0.0072963 0.0341516 -0.018557
+-0.018657 0.109944 -0.0204332
+-0.0843505 0.0842533 0.0274024
+-0.0531944 0.139931 -0.000456373
+-0.0741436 0.100877 0.037779
+-0.0658548 0.0952898 -0.0176963
+-0.0504071 0.163936 0.00393123
+-0.00384396 0.0384339 0.019723
+-0.0889438 0.137894 0.0261932
+-0.017832 0.0346972 0.047013
+0.0156145 0.128768 0.00543431
+-0.0517309 0.0489114 0.0216412
+-0.0358204 0.046598 -0.0238768
+-0.059344 0.139552 0.0335155
+0.0510761 0.0567889 0.0297952
+-0.0787812 0.166656 -0.0319662
+0.030718 0.111397 0.0323042
+0.0535299 0.049514 0.0226619
+-0.0446433 0.0346533 0.0343218
+-0.0169852 0.186593 -0.0230311
+-0.0743965 0.149892 -0.0310959
+-0.0373231 0.0354917 0.0439186
+-0.000691629 0.100255 0.0478272
+-0.0818959 0.141783 0.000186922
+-0.0304023 0.0382885 -0.00186367
+-0.00349386 0.0925503 0.0560196
+-0.088924 0.151541 0.0211005
+-0.0824519 0.0856305 -0.00554258
+0.0469336 0.0511672 0.030779
+-0.0852791 0.132127 -0.000702015
+-0.0891862 0.112803 0.0347042
+0.0229651 0.0928857 0.047441
+-0.0442655 0.127665 -0.00291939
+-0.0917744 0.132406 0.0242297
+0.00738689 0.0359942 0.0260187
+0.0456627 0.0890114 0.0111648
+-0.0860966 0.11232 0.0268196
+-0.0556879 0.117086 -0.0137514
+0.0093902 0.0739182 0.0557875
+-0.0794167 0.137236 0.0495785
+-0.0893497 0.130881 0.0042394
+-0.0656682 0.0337431 0.00949839
+-0.0263524 0.059005 -0.029433
+0.0104643 0.0346107 -0.00703394
+-0.0631576 0.119928 0.0457283
+0.0423355 0.0972587 0.0241615
+0.0603447 0.0595379 0.00916361
+0.0495034 0.0488243 -0.00166079
+-0.0740753 0.155198 0.0041876
+-0.0656926 0.125639 0.0489587
+-0.00648958 0.0503786 0.0513549
+0.0381951 0.102007 0.0289909
+-0.0592102 0.0595951 0.00211544
+0.0285202 0.0622348 -0.0207982
+-0.0876555 0.144675 0.00917716
+0.0519851 0.0567984 0.0293579
+-0.0300707 0.124739 0.00148409
+-0.0725865 0.0874189 0.0409577
+-0.00281209 0.0882041 -0.0358187
+-0.0637344 0.0736795 -0.0161836
+0.0142616 0.0794232 0.0540604
+0.0458875 0.0787805 0.0205292
+0.0245051 0.0849065 0.0478503
+-0.0617895 0.083881 -0.0194032
+0.0333636 0.0364347 0.0163708
+0.0165102 0.111269 0.0389693
+0.033894 0.111352 0.0280456
+-0.00616098 0.0344967 -0.0177303
+-0.0662325 0.14347 -0.0127636
+-0.0199914 0.0962147 -0.0280142
+-0.0259005 0.126064 0.0117956
+-0.0929641 0.121523 0.0342815
+0.00656148 0.101677 0.0461619
+-0.0600389 0.0627348 0.027804
+0.0335486 0.0889696 0.0416029
+-0.0688127 0.0908552 -0.0166124
+-0.0856608 0.0854539 0.0244177
+-0.0759458 0.0974591 -0.0125133
+-0.0667171 0.171901 -0.0422833
+-0.0191016 0.0431933 0.0528315
+-0.0589426 0.0357407 0.0458703
+0.013481 0.127543 -0.00145794
+-0.0239185 0.0383353 -0.00428996
+-0.0627701 0.0824471 -0.0192325
+-0.0614696 0.136692 0.0357094
+-0.0810116 0.0734375 0.0175497
+-0.0759173 0.12523 -0.00781198
+-0.00824401 0.0384507 0.0170014
+-0.0641628 0.157463 -0.0125984
+-0.0178575 0.122517 -0.00769635
+-0.0596856 0.0659756 -0.00895149
+-0.0807952 0.106052 0.0302403
+0.0156574 0.0925729 -0.0260099
+-0.081817 0.0734713 0.00853447
+-0.052947 0.1293 -0.00466978
+0.0313864 0.0929268 0.0420114
+-0.0242749 0.174204 -0.0124276
+-0.0678958 0.0610238 0.00808464
+-0.0477867 0.135371 0.0169352
+-0.0514248 0.0500855 0.0140283
+0.0463863 0.075041 0.00619921
+-0.0120829 0.121468 -0.0106691
+0.0474936 0.0651497 0.0284001
+-0.0370341 0.127886 0.0121304
+-0.0240288 0.0385625 0.0316972
+0.0484803 0.0651161 -0.0012457
+-0.0516556 0.0569841 0.0295138
+-0.0639861 0.131146 -0.00837414
+-0.0504965 0.087636 0.0455301
+0.03603 0.0808066 0.0380541
+-0.0869174 0.117103 0.00125292
+-0.0617229 0.155313 -0.01958
+-0.0631289 0.15403 -0.0107687
+0.00528045 0.114267 -0.0191116
+-0.0639453 0.167747 -0.0398404
+0.0288613 0.0520696 0.0379853
+-0.0623548 0.166257 -0.0465894
+0.000543528 0.123331 0.0344653
+0.0375704 0.0618629 0.0348997
+-0.0391935 0.128299 0.00543562
+-0.0593991 0.0472653 0.0079341
+-0.0244003 0.0390404 0.0383653
+-0.0676508 0.0338326 0.0090061
+-0.0292136 0.07193 -0.032514
+-0.0374976 0.0861098 0.0439188
+0.0247244 0.0549721 0.0426251
+-0.0892169 0.151457 0.0141575
+-0.02429 0.121354 -0.00839434
+-0.0618416 0.098205 -0.0180486
+-0.0320742 0.0383234 -0.000421092
+-0.0488761 0.107007 -0.0192731
+-0.0476462 0.123357 -0.010393
+0.0220922 0.12286 0.0278182
+-0.00150357 0.0647954 0.0567431
+0.000502823 0.0870298 0.0569751
+-0.0581295 0.0643065 0.0321224
+-0.0188005 0.0568615 0.0490899
+-0.0794271 0.0732336 0.00151817
+0.019219 0.0848258 -0.027423
+-0.0344972 0.116614 0.0320154
+0.000192029 0.0811649 -0.0359709
+-0.0741702 0.0968478 0.0394202
+0.00621596 0.083814 -0.033411
+-0.0671177 0.159814 -0.0107973
+-0.0187526 0.0641914 -0.0363857
+0.0556876 0.0493473 0.0181935
+-0.0364983 0.059104 0.0398977
+-0.071802 0.181053 -0.0556554
+-0.0116602 0.168404 -0.0170453
+-0.0478952 0.0713156 0.0406183
+0.0354015 0.0476244 -0.00628637
+-0.0262003 0.0750789 0.0460261
+-0.0550327 0.0674609 0.0370807
+-0.0565425 0.0415574 -0.00871771
+-0.0546448 0.115434 0.0349037
+-0.0682182 0.15577 -0.00101225
+-0.066899 0.132617 0.0454244
+-0.0743656 0.172848 -0.0365047
+-0.0734703 0.155395 0.00293075
+-0.0125152 0.0589286 0.0534547
+0.00233104 0.0554199 -0.0313859
+-0.0805618 0.101855 -0.00659893
+-0.0537592 0.0797599 -0.020636
+-0.0237797 0.125538 0.0184413
+-0.0508814 0.161419 0.0066624
+-0.0742588 0.0655235 0.0100016
+0.0457502 0.0805926 0.00319942
+-0.0764848 0.142819 0.0460732
+-0.0442438 0.113637 -0.0162318
+-0.00550074 0.0870334 0.0571343
+-0.059876 0.0997119 -0.0187764
+-0.069062 0.149033 -0.0371338
+-0.0598711 0.154188 0.0296083
+-0.044481 0.0973337 0.0428134
+0.0255359 0.118038 0.0305151
+-0.000498881 0.112805 0.0421187
+-0.073083 0.0981963 0.0397086
+-0.0766217 0.068534 0.0175211
+-0.038773 0.11398 -0.0166127
+0.0194763 0.0837958 0.0507486
+-0.0809353 0.145916 -0.000819165
+0.0301953 0.0476864 0.0346108
+-0.0284906 0.0932063 0.0444855
+-0.071967 0.162417 -0.0419522
+-0.0647895 0.0838376 -0.0190209
+-0.00994817 0.0389455 -0.0113423
+0.00268547 0.035256 0.0455248
+-0.0587181 0.0481161 0.00163754
+-0.0537032 0.140954 0.0276054
+-0.0166811 0.0377146 -0.0171581
+-0.0896263 0.0969991 0.0154111
+-0.0475653 0.166962 -0.00492463
+-0.0684985 0.0986495 0.0414678
+0.0399619 0.0730961 -0.00981181
+-0.0433911 0.121364 -0.0123522
+-0.0619851 0.167813 -0.0525933
+-0.0768904 0.0733563 0.0291265
+-0.058879 0.104045 -0.0185386
+-0.0154965 0.0573571 0.0513792
+-0.0115598 0.09531 -0.0330219
+-0.0335104 0.125389 -0.00127044
+0.0292004 0.119729 0.0233163
+-0.0141909 0.171251 -0.024451
+0.00225805 0.0711729 -0.0343766
+0.000838494 0.130009 0.0243594
+-0.0186635 0.0360947 0.0525267
+0.0441946 0.0874765 -0.00278813
+-0.0347028 0.122731 -0.00776716
+-0.0478246 0.129609 0.027299
+-0.0784918 0.144814 0.0436628
+0.020477 0.0989516 0.0463466
+-0.0870404 0.113136 0.0295379
+0.012093 0.120504 0.0352323
+0.00825492 0.0739666 -0.0336091
+0.00112807 0.104475 -0.0219821
+-0.0142621 0.120334 -0.0114431
+-0.0507965 0.0345143 0.033135
+0.0311896 0.0857114 -0.0197343
+-0.0894234 0.0956355 0.01542
+-0.0775093 0.0961888 -0.0115304
+-0.0358262 0.0929298 -0.0238031
+-0.0774962 0.131676 0.0527303
+-0.0421326 0.160667 -0.0107094
+-0.0276983 0.125752 0.00966815
+-0.045336 0.129618 0.020889
+-0.00368188 0.0613041 -0.0346439
+-0.0748644 0.171601 -0.033829
+-0.0207882 0.0770942 -0.0390427
+-0.044533 0.160785 0.0064482
+-0.0789135 0.0799145 -0.00757704
+-0.0700794 0.154941 0.0289273
+-0.0313268 0.0609036 -0.0184352
+-0.0853384 0.107683 0.0213404
+-0.0624789 0.152144 -0.0275875
+-0.0427656 0.0797392 -0.0197597
+0.00722196 0.0865913 -0.0328221
+-0.0720619 0.109399 0.0395074
+-0.0911632 0.132299 0.00922827
+-0.00610552 0.129863 0.0232869
+0.02524 0.115374 0.03316
+0.00541955 0.0912903 -0.0327619
+0.00896308 0.0344141 -0.00340754
+-0.0356782 0.0636593 -0.0138055
+-0.0555057 0.153886 0.023914
+0.0207355 0.0349558 0.0059225
+0.0360179 0.0848402 0.038086
+-0.0488433 0.098515 -0.0220378
+-0.0633934 0.178218 -0.0607118
+-0.0846638 0.0778105 0.0155166
+0.0437393 0.0720229 -0.000789276
+-0.0288953 0.122588 -0.00566495
+-0.025973 0.0851197 0.051146
+-0.0782416 0.0913778 0.0366028
+-0.0494978 0.0960237 0.0444817
+-0.0785831 0.0731535 -0.00247436
+-0.0698391 0.165209 -0.0499791
+-0.0586839 0.0335669 0.00570948
+-0.0610591 0.155387 0.024814
+-0.0642828 0.163385 -0.0227384
+-0.0658667 0.0334936 -0.00108817
+0.037341 0.0888457 0.0365275
+0.02301 0.0347163 0.00286296
+-0.0590207 0.126708 -0.0075139
+0.0463679 0.0792556 0.0081871
+-0.00960203 0.0406207 -0.0262166
+-0.0771598 0.160359 -0.0157997
+-0.0425011 0.163766 0.00491011
+-0.00971544 0.177216 -0.0294611
+0.021747 0.102101 0.0439088
+-0.087802 0.139216 0.0403868
+-0.0694557 0.0421945 0.00370163
+0.0173244 0.0580274 -0.0281164
+-0.011686 0.178646 -0.0240587
+-0.0245154 0.158144 -0.00224812
+0.021637 0.0948486 -0.0224193
+0.00951901 0.0504027 0.0504431
+-0.0252093 0.112572 -0.0171753
+-0.0736758 0.108402 0.0380105
+-0.0551152 0.0341599 0.0272668
+-0.0462814 0.155049 0.00841735
+-0.0164865 0.0730277 0.0553332
+-0.0853981 0.109039 0.0213496
+-0.0817879 0.0734817 0.0075372
+-0.0543644 0.15733 0.00977334
+-0.0391365 0.0406682 0.0418102
+0.00445432 0.130749 0.00275136
+0.0247455 0.105845 -0.0161092
+-0.0554962 0.0904299 0.0451691
+-0.00849692 0.0731924 0.0575239
+-0.0665361 0.11864 0.0512424
+-0.0771905 0.152834 -0.00389169
+-0.0684956 0.0958684 0.0422138
+-0.086559 0.0806364 0.0135028
+-0.065258 0.156162 0.0146042
+-0.0134788 0.105828 0.0432751
+-0.00273284 0.0712345 -0.035418
+0.0276777 0.0972525 -0.0189451
+-0.0768441 0.113421 -0.00459179
+-0.0291819 0.174148 -0.0171874
+-0.0392913 0.0344977 0.0373408
+-0.00249868 0.0965524 0.0536599
+-0.026518 0.10985 0.0386071
+-0.0272212 0.114809 -0.0155223
+-0.0617195 0.0669875 0.0343055
+-0.0824261 0.101938 -0.00456304
+-0.0889571 0.0955775 0.00843273
+-0.0288529 0.100117 -0.0233232
+-0.0899265 0.130893 0.00523191
+-0.0346189 0.112824 -0.0174204
+-0.0154754 0.111334 0.0410203
+-0.053649 0.0335392 -0.00958395
+-0.000215874 0.126274 0.0312521
+0.00810763 0.0366956 0.0273459
+-0.0915032 0.133721 0.0182157
+0.0193574 0.0537071 -0.027254
+-0.0617049 0.070743 -0.0146345
+-0.0745149 0.121791 0.0533186
+-0.070524 0.0682803 0.0295828
+-0.0206697 0.0697068 0.051972
+-0.0918785 0.141976 0.0181723
+-0.0408421 0.0345979 0.00840679
+-0.0738542 0.15551 0.00718209
+0.0055205 0.0427186 0.0455303
+-0.065431 0.168513 -0.0346313
+0.0194077 0.0659 0.0490938
+-0.0485039 0.0876217 0.0453743
+-0.0622817 0.0458517 0.0346831
+0.0349983 0.0362655 0.0094693
+-0.0912374 0.140583 0.0161703
+-0.0884146 0.113764 0.0250911
+0.0142472 0.0860448 0.0523279
+-0.0131413 0.127389 -0.000900164
+0.0289187 0.0580129 -0.0187889
+0.00423189 0.0768627 -0.0347545
+0.0204663 0.0385832 -0.00969847
+-0.0217971 0.0348633 0.0460203
+-0.0864575 0.101794 0.0247295
+0.00132582 0.0568889 -0.0321653
+-0.0697484 0.0793376 -0.0160307
+-0.0845391 0.102087 -0.000621587
+-0.0733924 0.0656461 0.018954
+-0.0391909 0.0342717 0.0287528
+-0.065551 0.112475 0.040245
+-0.0628947 0.161497 -0.0505862
+-0.0455612 0.125305 -0.00846085
+0.0204165 0.110729 -0.0153427
+-0.0119941 0.16759 -0.0225943
+-0.0778434 0.153328 0.00140062
+-0.0743032 0.152688 -0.027892
+-0.0719627 0.134048 -0.00796724
+-0.0322554 0.0722092 -0.0264952
+-0.0689145 0.123836 -0.00886831
+-0.0292201 0.0564848 -0.022383
+-0.0336564 0.0343441 0.0369141
+0.0587559 0.0579922 0.0215357
+0.0331644 0.1138 0.0262385
+0.0155789 0.125536 -0.0032763
+-0.0511913 0.034459 0.0313456
+0.0336899 0.0357287 0.00969367
+0.0540437 0.0734433 0.0120297
+-0.0588961 0.106893 -0.0176578
+-0.0158316 0.18484 -0.0207268
+0.0120317 0.0342138 -0.0138856
+0.0335354 0.0380053 0.0222769
+-0.0118847 0.117889 -0.0148923
+0.00991822 0.0342953 -0.00310719
+0.00806259 0.0342288 -0.0204182
+-0.00962665 0.0384388 0.00947704
+-0.00349166 0.0534503 0.0541192
+0.0248931 0.108132 -0.0145556
+-0.0355172 0.106999 0.038376
+0.0298839 0.118971 0.0235707
+-0.0896201 0.0969823 0.0124196
+0.00795856 0.126912 0.0298215
+-0.0734288 0.149863 -0.0358672
+-0.0513643 0.132495 0.031006
+-0.056967 0.0535025 0.000612409
+-0.0226813 0.0349023 0.0509736
+0.0573538 0.0634191 0.00214341
+-0.0178849 0.0387376 -0.0108688
+-0.0690262 0.170476 -0.0316587
+-0.0162544 0.183109 -0.0200888
+-0.0569078 0.052097 -0.000371255
+-0.0845703 0.11062 0.0357089
+0.035496 0.0454077 0.0303438
+-0.00267498 0.100539 0.0471075
+-0.080721 0.0845507 0.0336553
+-0.0900133 0.150126 0.0131697
+-0.0628916 0.0631016 0.0268901
+-0.0739067 0.163816 -0.0379732
+-0.0313311 0.0487062 0.0434625
+-0.036476 0.0533606 0.0387027
+-0.0636484 0.15559 0.00937973
+0.0135801 0.0874029 0.0531363
+-0.0259964 0.0967524 -0.0245741
+-0.0665286 0.168031 -0.0580342
+-0.0794099 0.141428 0.0463829
+-0.0496093 0.0334738 -0.00871292
+0.0373859 0.082128 0.0365587
+-0.00650329 0.0547609 0.0534371
+0.0253836 0.0503366 -0.0210264
+-0.00332845 0.128773 0.0271941
+0.0363318 0.0601344 -0.0117401
+-0.0258635 0.103016 -0.0235702
+-0.0251408 0.168241 -0.0184358
+0.018845 0.0956057 -0.0232473
+-0.0712372 0.167165 -0.0209901
+-0.0759412 0.151358 -0.0178788
+-0.0784019 0.152013 0.0336008
+0.000968412 0.0391138 -0.00557511
+-0.0865136 0.106289 0.0083757
+-0.0623969 0.0335761 0.00673913
+-0.0769787 0.135423 -0.00568624
+0.021851 0.0591836 0.0473037
+-0.0524335 0.115217 0.0341034
+-0.0884925 0.144689 0.01017
+-0.0774954 0.147028 0.0416906
+0.00429953 0.0340852 0.0162355
+-0.0489061 0.0346101 0.0421693
+-0.0377668 0.0812615 -0.0209367
+-0.0321125 0.0496937 -0.0183514
+-0.00333701 0.121977 -0.0113118
+-0.063853 0.129717 0.0428324
+0.0122687 0.0724051 -0.0314733
+-0.0295052 0.113904 0.0347936
+0.0428284 0.0676747 -0.00179274
+-0.0665096 0.0944832 0.0425185
+-0.0324964 0.117987 0.0309791
+-0.0240568 0.0972281 0.0446316
+-0.0729302 0.128204 -0.00868672
+-0.0930613 0.118852 0.0392987
+-0.0179932 0.0940702 -0.0337993
+-0.0276364 0.0917699 -0.0296042
+0.0270825 0.114018 -0.00875387
+-0.0701334 0.160982 -0.047936
+0.0160414 0.0343167 -0.00190332
+-0.0407181 0.0336157 0.00208844
+0.0537368 0.0581963 0.0283843
+0.0459393 0.0792136 0.00418579
+0.00219887 0.0866713 -0.0341557
+-0.0874475 0.125307 -0.000719081
+0.0171658 0.0974165 -0.0229214
+-0.0555243 0.0344634 0.0339194
+0.00337546 0.131746 0.0137901
+-0.037361 0.155079 0.00374727
+-0.00966712 0.0394179 0.0374824
+0.0401633 0.102703 -0.00178896
+-0.0792807 0.167978 -0.037009
+0.0137845 0.0344 -0.00993851
+-0.0224906 0.034851 -0.0281799
+-0.0815485 0.124491 0.0516101
+0.0440694 0.0973609 0.0121636
+-0.0361101 0.0351289 -0.0167641
+-0.0672139 0.168667 -0.0295504
+0.00726635 0.0696573 -0.0326992
+-0.0474987 0.0987688 0.0431343
+-0.0879643 0.115809 0.00328051
+0.0212116 0.083355 -0.0266295
+-0.0413155 0.0345032 0.0369079
+-0.0830031 0.148729 0.00315098
+-0.0365029 0.0818729 0.0434567
+-0.0265303 0.0632322 0.0390504
+0.0560084 0.0549549 0.0021707
+-0.00162661 0.100486 0.0474782
+-0.00782745 0.0882395 -0.0367822
+-0.0874416 0.113109 0.00532366
+-0.0755108 0.126011 0.0529241
+0.0317406 0.107408 0.0337947
+-0.0280888 0.121741 0.0242898
+-0.0114519 0.126605 -0.00415103
+-0.00942316 0.129915 0.019193
+0.0305901 0.117314 -0.000462026
+-0.00449008 0.116939 0.0397737
+-0.0174829 0.0365879 0.0522725
+-0.0480399 0.136313 0.0145941
+0.0078895 0.0386539 0.0453509
+-0.059976 0.125502 0.0413668
+0.00922467 0.131237 0.0102208
+-0.0164537 0.0924837 0.0552632
+-0.0397063 0.0680709 -0.01554
+0.0144891 0.0990552 0.047648
+-0.0194892 0.0771957 0.0553527
+0.00314961 0.0344334 0.00286196
+0.0322227 0.0828447 -0.0192606
+-0.086166 0.115735 0.00128445
+-0.0628659 0.161473 -0.0525859
+-0.0897633 0.133813 0.0392039
+-0.0931113 0.126933 0.0272608
+0.0442448 0.0902943 -0.00180307
+0.0383075 0.041189 0.0258499
+-0.038679 0.0636652 -0.0136088
+-0.0640888 0.165507 -0.029848
+0.00695321 0.13108 0.0193768
+-0.0281007 0.162292 -0.0150733
+0.0192374 0.0749637 -0.0278698
+0.0244608 0.0941673 -0.021671
+0.0131476 0.100265 -0.0227775
+-0.0301385 0.166718 -0.0165418
+-0.0651412 0.159482 -0.0565006
+0.0342867 0.0700233 0.0389954
+-0.0695171 0.141232 -0.00845814
+-0.0904292 0.148866 0.0241237
+-0.0253439 0.0693349 0.0439513
+-0.0623474 0.166249 -0.0485903
+-0.0193027 0.0445534 0.0525624
+-0.0258791 0.105846 -0.022482
+-0.0331634 0.0381954 -0.000525199
+-0.0640739 0.0617863 -0.0011495
+0.0413993 0.0942972 -0.00577735
+-0.030183 0.155051 -0.00785968
+-0.0209835 0.159643 -0.00415092
+0.0227131 0.118044 0.0330191
+-0.0268485 0.124528 0.000469072
+-0.0241773 0.17417 -0.0202285
+-0.012912 0.0339283 -0.0204101
+0.0235417 0.109895 0.0378397
+-0.0800641 0.107437 0.0308747
+-0.0374695 0.0383458 -0.0088734
+0.0372523 0.0646113 0.0362056
+-0.0324907 0.0817336 0.0416408
+0.0138217 0.125251 -0.00497301
+-0.0427639 0.126553 -0.0057736
+-0.0467249 0.0753156 -0.0175399
+-0.0861037 0.109061 0.0193453
+0.0206619 0.0348672 0.0224824
+-0.0804996 0.127434 0.052885
+0.00919876 0.0964636 -0.0261302
+-0.0321423 0.0806683 -0.0305334
+0.0242996 0.120934 0.0286395
+-0.0429021 0.171269 -0.00696466
+0.0145253 0.126603 0.0278836
+-0.0657391 0.142564 -0.0101503
+-0.0125598 0.0943837 -0.0340846
+-0.0809608 0.0720856 0.0135459
+-0.0230054 0.0386784 -0.0118395
+-0.0234022 0.157317 -0.0083471
+-0.0700956 0.06197 0.00856658
+0.0361469 0.0875521 0.038321
+-0.00703497 0.101085 0.0445106
+-0.0217097 0.181473 -0.0209735
+-0.0310875 0.179405 -0.00921261
+0.00340822 0.117733 -0.0168392
+-0.0306641 0.062253 -0.0214244
+-0.00851812 0.0604987 0.0555487
+-0.0105044 0.0745085 0.0567054
+-0.00265316 0.0511482 -0.0311061
+-0.0764634 0.157616 -0.00941011
+-0.0224335 0.0371726 0.0541058
+-0.0432016 0.171084 -0.00202068
+-0.0523174 0.057382 0.0266177
+0.0595665 0.0566863 0.0161765
+0.00171621 0.126464 -0.00619605
+-0.0635036 0.095949 0.0432601
+-0.00748541 0.0856517 0.0572176
+-0.0142172 0.114376 -0.0171381
+-0.0106623 0.0511436 -0.032067
+-0.0292482 0.0345559 -0.0204636
+-0.0369573 0.0340894 0.0258321
+-0.0544756 0.0413314 0.0465715
+-0.0940023 0.125512 0.016258
+-0.0685195 0.0916417 0.0424016
+-0.076491 0.140037 0.0480957
+-0.021763 0.159801 -0.0034487
+0.0107652 0.110575 -0.0191667
+-0.0296434 0.0486725 0.0446006
+0.0205709 0.0463131 0.0417824
+0.0371829 0.0726727 0.036151
+0.00170794 0.1258 0.0319097
+0.00812607 0.108726 -0.0199063
+-0.088847 0.0874807 0.0104655
+-0.0614823 0.0761372 0.0417782
+-0.077632 0.077285 -0.00766199
+-0.0914347 0.132413 0.0262297
+-0.0380759 0.16073 -0.01276
+-0.0580841 0.132712 -0.00634758
+-0.00546375 0.117984 -0.0150376
+-0.0825526 0.110518 0.0415894
+-0.0567945 0.0589511 -0.00142935
+-0.00849356 0.0842936 0.0575382
+-0.0464941 0.0987388 0.0427545
+0.0199235 0.0365522 0.038924
+-0.0181358 0.159669 -0.00704365
+0.0214919 0.0906421 0.0482356
+-0.0308996 0.107699 -0.0200324
+0.0310327 0.118783 0.0168832
+-0.049761 0.069112 0.038562
+-0.0388211 0.091456 -0.0235256
+-0.0139638 0.180133 -0.0220777
+0.0153381 0.127037 -0.000904662
+-0.0219975 0.107603 -0.0219593
+-0.0448317 0.0927682 -0.0220335
+-0.0127292 0.0909963 -0.036642
+0.0174939 0.0350076 -0.00788091
+-0.016176 0.165587 -0.0188354
+0.0276821 0.0862408 0.0453967
+-0.00121407 0.102594 0.0440764
+-0.0167645 0.162218 -0.0151135
+-0.0446938 0.0665983 -0.0153032
+-0.0709583 0.135514 -0.00804855
+0.0152869 0.0794603 0.0538116
+-0.028039 0.0849631 0.0475609
+-0.0252122 0.108563 -0.020971
+-0.0501485 0.141642 0.00337658
+-0.0802229 0.143442 0.044034
+-0.0728736 0.0659781 0.0205309
+-0.083982 0.134868 -0.000717316
+-0.070349 0.172644 -0.037875
+-0.015485 0.0673895 0.0543529
+-0.0374989 0.108379 0.0375203
+0.0194281 0.0399108 -0.0177171
+-0.0508059 0.0898498 -0.0218327
+-0.0916067 0.130926 0.00923792
+-0.0657827 0.158229 -0.0103034
+0.00352818 0.0386899 -0.0121702
+-0.0147383 0.10835 -0.0207588
+-0.0496313 0.111407 -0.0178803
+-0.0413837 0.128875 0.00906534
+-0.0523163 0.134709 -0.00240246
+0.00961512 0.122501 0.0348066
+-0.0755017 0.140041 0.0481
+-0.0678883 0.145704 -0.022127
+-0.0230319 0.0374462 0.0541561
+-0.00425848 0.0961384 -0.0318255
+-0.0895594 0.135155 0.0312102
+-0.0623104 0.0594537 0.00702264
+0.00422975 0.0796448 -0.0342885
+-0.0618471 0.153751 -0.0215773
+-0.00905798 0.034739 0.0470958
+-0.0575286 0.126935 0.0396404
+-0.0298496 0.180049 -0.0116061
+-0.0317613 0.0567558 -0.0133876
+-0.0839019 0.105911 0.0262878
+-0.0715304 0.102729 0.03849
+0.0144241 0.127312 -0.00121761
+-0.0787914 0.14589 -0.00282549
+-0.00925999 0.0421824 0.0495336
+-0.0284001 0.0385729 0.034376
+-0.0690967 0.148938 0.0398784
+-0.0561651 0.153258 0.0280528
+0.0408211 0.10424 0.0171662
+0.0569661 0.0701435 0.00568959
+-0.0318479 0.09723 -0.023215
+0.00233723 0.0391647 0.0293747
+-0.0839319 0.117006 0.0485566
+-0.0310508 0.0693178 -0.0264576
+-0.0270974 0.0794315 0.0481933
+-0.00975454 0.0728065 -0.0376393
+-0.0907216 0.131054 0.0332303
+-0.00149823 0.0535022 0.0547476
+-0.0920442 0.126938 0.0322524
+-0.049095 0.140149 0.0113941
+-0.0605441 0.113772 -0.0142303
+-0.00976932 0.0756525 -0.0380331
+-0.0878532 0.127045 0.0464651
+-0.010533 0.178644 -0.025906
+0.0593699 0.0691831 0.0171767
+-0.024781 0.0769658 -0.0376048
+0.0423711 0.0575006 -0.00528711
+0.0460928 0.061454 -0.00359733
+-0.0408554 0.101386 -0.0212924
+-0.0446853 0.169846 -0.00596698
+-0.0499657 0.0572278 0.0334797
+-0.0145604 0.127706 0.0231688
+-0.0624931 0.153672 -0.0316068
+0.0559752 0.0635544 0.0263749
+-0.0741944 0.0678888 0.022137
+0.0128784 0.0534523 0.0500797
+-0.014497 0.082865 0.0570346
+0.0100519 0.0351376 0.0435561
+-0.0764979 0.135856 0.0507679
+-0.0505672 0.0545537 0.0173366
+-0.073291 0.0682485 0.025526
+0.0168973 0.0504721 0.0453108
+0.0597511 0.0567143 0.0111681
+0.00962081 0.119433 -0.0146957
+-0.0261763 0.0931476 0.0454624
+-0.0034975 0.0661744 0.0565538
+-0.0174573 0.0601724 0.0514531
+0.0587589 0.059387 0.00417226
+-0.0388249 0.122181 0.0278208
+-0.0685252 0.175096 -0.0570393
+-0.0628061 0.0896011 -0.0190246
+0.0306772 0.118704 0.0210209
+-0.0655003 0.083298 0.0438708
+0.0560223 0.0713695 0.00682475
+-0.0298518 0.100096 -0.0230635
+-0.0422245 0.148296 -0.00246029
+-0.00149333 0.112805 0.0421166
+-0.0829153 0.0925695 0.0313446
+-0.0394018 0.0468721 -0.0179145
+-0.0784825 0.135851 0.0506454
+-0.0734876 0.127439 0.0525898
+-0.0280931 0.033441 -0.0266965
+0.0607571 0.0609589 0.0141669
+-0.0692316 0.172989 -0.0403442
+-0.0397906 0.162354 0.00198884
+-0.0505067 0.0805184 0.044061
+-0.0716519 0.156794 -0.0409079
+0.0407885 0.10564 0.00816522
+-0.00717727 0.0999816 0.0485274
+-0.0646289 0.156694 -0.0465976
+-0.089623 0.0983355 0.0134109
+0.00279805 0.0339767 -0.0211497
+-0.0142152 0.17272 -0.0253585
+-0.0396036 0.174135 -0.00601981
+-0.0669938 0.0358141 0.0313063
+-0.0497731 0.0627792 0.0345527
+0.0229897 0.121378 0.0295865
+-0.0457551 0.0336493 -0.0154708
+-0.0539285 0.152376 0.0223916
+-0.0664975 0.108359 0.0380432
+0.0293811 0.04325 -0.00550019
+-0.0166832 0.0525719 -0.0322771
+0.0164877 0.105762 0.0431793
+-0.0171637 0.0956465 -0.0313986
+-0.0314959 0.111117 0.0366419
+-0.0788622 0.169438 -0.0409605
+-0.0673163 0.13687 0.0448543
+-0.00450662 0.0828853 0.0572758
+-0.086732 0.125284 -0.00171301
+-0.0339024 0.123839 0.0236394
+-0.0665906 0.0686018 0.0336345
+-0.0647932 0.143933 0.0397518
+0.0283692 0.0466516 -0.00870467
+0.0329293 0.104175 -0.0123189
+-0.0761401 0.0728821 0.0296904
+-0.0142042 0.169737 -0.0232161
+-0.068634 0.151185 -0.044245
+-0.0135754 0.0347863 -0.0255909
+0.019989 0.0436019 0.0426848
+-0.015693 0.057044 -0.0346551
+-0.00164401 0.0482043 -0.0300627
+-0.0311183 0.172722 -0.00474304
+-0.0250193 0.118984 -0.0119284
+-0.0325683 0.124672 -0.00180773
+-0.0781672 0.0694403 0.0164131
+0.0335232 0.0673414 0.0396281
+-0.0927165 0.117489 0.0383035
+0.0402856 0.10561 0.017163
+-0.0284035 0.166813 -0.0078902
+-0.00473635 0.13076 0.00793547
+-0.0216948 0.0386212 -0.00966204
+-0.0436382 0.11786 -0.014681
+0.0533192 0.0587911 -0.00291354
+-0.0153516 0.0970497 -0.0288687
+-0.0434963 0.0661943 0.0406667
+-0.0466152 0.145766 -0.000178732
+-0.0206008 0.0386838 -0.0150911
+-0.0509261 0.0335608 -0.00538789
+-0.0896998 0.137926 0.0341919
+-0.0278811 0.0378156 0.0189805
+0.0364086 0.0854455 -0.0167057
+0.0349072 0.0875927 0.04003
+-0.0243811 0.0738035 0.0484997
+-0.0470246 0.133586 0.0187098
+0.00950521 0.0772084 0.0556135
+-0.0192998 0.0985099 -0.0244
+0.0447739 0.0438422 0.0248039
+-0.0504965 0.0819144 0.0441383
+-0.0346492 0.0577427 -0.0111408
+-0.048101 0.135891 0.0168055
+0.00147386 0.103921 -0.02207
+0.0494979 0.0678406 0.0265165
+0.00621357 0.0880484 -0.0332214
+-0.0763594 0.158279 -0.023921
+0.0359549 0.0646627 0.0378653
+-0.0462327 0.128102 0.0242709
+-0.0570384 0.142741 -0.0023851
+-0.0156536 0.0496375 -0.0309655
+-0.0157015 0.164 -0.0105798
+0.0160661 0.0349193 -0.0155613
+-0.0555615 0.0615422 -0.00607893
+-0.0506452 0.142899 0.00154993
+0.0227041 0.124378 0.0023667
+-0.0690811 0.0343024 0.0100819
+0.0296092 0.114943 -0.00583865
+0.0252655 0.0864752 -0.0236184
+-0.0579352 0.153021 -0.000467328
+-0.0699851 0.168026 -0.0510102
+-0.0649515 0.126767 -0.00875296
+-0.0310902 0.124844 0.00108587
+-0.07951 0.149797 0.0367578
+-0.0514931 0.156432 0.0104716
+-0.0854224 0.0885478 -0.00153705
+-0.0622051 0.0333895 -0.00205752
+-0.00958914 0.0376967 -0.0257201
+0.0438525 0.0874765 0.0251696
+-0.00448652 0.114189 0.0411781
+-0.0741351 0.0860483 0.039718
+-0.0162681 0.118552 -0.0135478
+-0.00571384 0.0655793 -0.035147
+-0.051609 0.164108 -0.000948719
+-0.0346229 0.116833 -0.0136016
+0.0105065 0.107115 0.0414414
+-0.0484736 0.0917654 0.0440291
+9.10767e-05 0.108392 -0.0207972
+0.0522547 0.0611036 -0.00320855
+0.00856462 0.11946 -0.0147195
+0.0326237 0.0768475 0.0419257
+0.0282302 0.0872832 -0.0216049
+-0.0693757 0.155378 0.0277002
+-0.0182673 0.180142 -0.0177524
+-0.0285043 0.0545632 0.0363758
+-0.0218074 0.0756618 -0.0388536
+-0.0633749 0.1608 -0.057006
+-0.0892506 0.151522 0.0201032
+-0.0472272 0.0642822 0.0376403
+-0.0699509 0.134055 -0.00826728
+-0.0820286 0.074884 0.0125291
+-0.0576046 0.151067 0.0326375
+-0.0425494 0.0346163 0.040046
+-0.0619058 0.105434 -0.0174028
+-0.0753497 0.108878 0.0391875
+-0.0594974 0.0946317 0.0447571
+0.013384 0.078066 0.0545225
+-0.0431375 0.160652 -0.0100842
+-0.0258359 0.0945143 -0.0266147
+-0.0245117 0.0536384 0.0409132
+-0.0664072 0.169883 -0.0364165
+-0.0726615 0.0640995 0.00799778
+-0.0451579 0.0395668 -0.0202936
+-0.00773777 0.0727528 -0.0370634
+0.0135086 0.116829 0.0366875
+-0.0836964 0.106272 0.0263573
+-0.0303071 0.0339954 0.0147064
+-0.000759903 0.102685 -0.0227147
+0.0258263 0.0624492 -0.0231007
+-0.0674047 0.179923 -0.0541082
+-0.0857367 0.111526 0.0418488
+-0.0560454 0.148678 -0.00182226
+-0.0476918 0.0635243 -0.0129244
+-0.0642806 0.164881 -0.0270495
+-0.0574962 0.108397 0.0389105
+0.00241269 0.0347278 -0.0230504
+-0.00449379 0.0548276 0.0540049
+-0.0627171 0.147502 -0.0125815
+-0.0213288 0.0581411 0.0459349
+-0.0608837 0.0367165 0.0449842
+0.0211328 0.126504 0.0131782
+0.00740015 0.0418656 -0.0238182
+-0.0737971 0.148055 0.0412991
+-0.00374732 0.0726737 -0.0357771
+-0.0204954 0.103009 0.0433484
+-0.0210495 0.127369 0.0106273
+0.0306407 0.0431175 0.0298982
+0.0109957 0.0698921 0.0545336
+-0.0439898 0.0350927 -0.0256307
+-0.0670986 0.0347786 0.0136227
+0.0215717 0.0401714 -0.00970048
+0.0214864 0.0934187 0.0477129
+-0.0174765 0.0715932 0.0547125
+-0.0246025 0.0824997 0.0540808
+-0.0774249 0.155543 -0.015906
+-0.00557868 0.109705 -0.0221876
+-0.00234233 0.10113 0.044176
+0.0314145 0.0384146 -0.00113672
+-0.0708385 0.0965734 -0.0156262
+-0.0358426 0.0345846 0.0397566
+0.0166934 0.111749 -0.0164123
+-0.0461447 0.0396778 -0.0162811
+0.0460542 0.0820303 0.0141751
+0.024254 0.0776067 -0.0252579
+-0.0585858 0.14384 -0.00236725
+-0.0590542 0.155341 0.0226214
+-0.0425019 0.049221 0.0396798
+-0.0737231 0.156865 -0.0279142
+-0.0640946 0.155219 -0.00966954
+-0.0136075 0.0420889 -0.0267571
+-0.0149109 0.0391012 0.0366853
+-0.0768619 0.116386 -0.00596474
+0.0464851 0.0651547 0.0281822
+-0.0672589 0.077344 0.0400985
+-0.0768893 0.176966 -0.046083
+-0.0870251 0.136346 0.00321516
+-0.046566 0.128368 -0.00156221
+-0.0881324 0.103677 0.0173573
+-0.0358716 0.10426 -0.0206916
+-0.00158589 0.110252 -0.0207823
+-0.0645869 0.117148 0.0471018
+-0.0493593 0.121175 0.032055
+0.00351232 0.0575709 0.0538233
+-0.0114209 0.107659 -0.022044
+-0.0134464 0.0388153 -0.00818864
+-0.0485053 0.108444 0.0391022
+-0.0783276 0.0839475 -0.0105972
+-0.0422429 0.129048 0.0117038
+0.0230175 0.0903576 -0.0236845
+-0.0840147 0.0993167 -0.00358504
+-0.0538991 0.108397 -0.0185513
+-0.00168424 0.0583535 -0.0329231
+0.00135578 0.0347199 0.040341
+-0.0858041 0.131212 0.0485351
+0.0546169 0.0694261 0.0240301
+0.0349752 0.0684447 -0.0157877
+0.0095201 0.0716259 0.0554078
+-0.00749453 0.0952341 0.0547544
+-0.019553 0.163976 -0.00913576
+-0.0640343 0.0457636 0.00169557
+-0.017901 0.0381554 0.0134869
+0.0133255 0.0594987 -0.0290386
+0.00648582 0.047441 0.0497645
+-0.0239518 0.123773 0.0227902
+-0.0318252 0.0609455 -0.0174329
+-0.0928746 0.122834 0.0282828
+0.00226062 0.131309 0.0062251
+-0.0414935 0.112526 0.0356807
+0.0202561 0.0791555 -0.0271913
+-0.0331056 0.0338156 0.0161014
+0.0297787 0.0446629 0.032196
+-0.0792621 0.084024 -0.00957002
+-0.0697175 0.155623 0.0028257
+-0.0391149 0.0337868 -0.0291782
+-0.0893977 0.135151 0.0292068
+0.04371 0.0987542 0.0111628
+-0.0281559 0.0380199 0.00608926
+0.0552084 0.0493743 0.00621284
+-0.0861539 0.149931 0.0300167
+0.042296 0.0775058 -0.00576261
+0.0415736 0.0765545 0.0302447
+-0.0532046 0.133931 0.0318349
+-0.0939252 0.118758 0.016301
+-0.027019 0.123094 -0.00421217
+-0.0471842 0.0355635 -0.0162689
+0.0137449 0.12859 0.0232984
+-0.0388402 0.0957243 -0.0226737
+0.0393482 0.0966985 0.0306886
+0.0405486 0.0596459 0.0301455
+-0.083332 0.0992842 -0.00460735
+0.0403123 0.0491555 -0.00629774
+-0.0135559 0.0378433 -0.0166597
+-0.0655014 0.0958911 0.0424957
+-0.00976126 0.0358952 0.049479
+-0.0624412 0.150596 -0.00171821
+-0.064981 0.131148 -0.00860586
+-0.0763864 0.109432 0.0420745
+-0.00149437 0.0801423 0.0576885
+-0.0163316 0.166866 -0.0132843
+-0.0862104 0.140486 0.00518463
+-0.0484837 0.159357 0.00832828
+-0.063685 0.169395 -0.0455915
+-0.0676574 0.0344024 0.0120657
+-0.0324957 0.0889348 0.0439847
+-0.0285919 0.0494861 -0.0235098
+-0.0925344 0.124191 0.0302708
+-0.0898664 0.135182 0.0372006
+-0.0675175 0.146991 0.0409028
+-0.0643109 0.0721294 0.0381075
+0.0336777 0.107392 0.0312726
+0.0416487 0.0806113 0.0304012
+0.0108925 0.130607 0.00797847
+0.00350574 0.071674 0.0559901
+-0.0687556 0.0680025 -0.00564855
+-0.0668955 0.116554 -0.00922261
+-0.0147132 0.0599449 -0.0358879
+-0.023059 0.0825255 0.0553698
+-0.0305016 0.108423 0.0388291
+-0.0575086 0.0507939 0.00466306
+-0.0811465 0.155009 0.0163089
+-0.0281138 0.125637 0.0139342
+0.00450187 0.0575756 0.0536585
+-0.0124992 0.0745024 0.0565746
+0.030795 0.119096 0.00823469
+0.0112449 0.0943173 -0.0278535
+-0.00350029 0.0856691 0.0572933
+-0.0135749 0.18083 -0.0284353
+-0.0387321 0.0724952 -0.0174162
+-0.0366243 0.151025 -0.00298791
+0.0282135 0.0579727 -0.0197309
+-0.0828916 0.0775885 0.00151125
+-0.00164877 0.0496874 -0.0307148
+0.0386307 0.106935 0.00116239
+-0.0871923 0.0861012 0.021463
+-0.0760841 0.104861 0.0354581
+-0.0244788 0.0486839 0.0492934
+-0.0883766 0.141855 0.0366703
+-0.0509887 0.143164 0.0163768
+-0.0496168 0.0561697 -0.00993077
+-0.00378208 0.0390472 -0.0102032
+-0.0843646 0.087116 -0.00354087
+0.00990951 0.0819581 0.0548044
+-0.0425006 0.0888114 0.0424593
+-0.0728637 0.099356 -0.013752
+-0.0206243 0.0436469 -0.0283402
+-0.0828496 0.117685 -0.00271563
+-0.0715585 0.181081 -0.0541999
+-0.0338561 0.0475081 -0.0226504
+0.00224005 0.0768974 -0.0352993
+-0.0935755 0.117419 0.0183042
+-0.0754318 0.155396 0.00808247
+-0.0674328 0.172594 -0.0425404
+0.027377 0.122298 0.0126488
+0.0174898 0.0874014 0.0499964
+0.0109848 0.123169 0.033628
+-0.0367194 0.0710436 -0.0172369
+-0.0285781 0.0423048 0.0521933
+0.033068 0.0984004 -0.0141329
+-0.0475947 0.0601221 0.0367025
+-0.0635768 0.155628 0.0253794
+0.0262764 0.100811 0.0416679
+0.0147323 0.129513 0.0122405
+0.0321413 0.0366814 0.019545
+-0.00794631 0.127212 -0.00487976
+0.0374618 0.0376657 0.00680115
+-0.0450017 0.0355455 0.0439167
+-0.0613089 0.0634913 0.028639
+-0.0275028 0.0988006 0.0435593
+0.051337 0.0560222 -0.00385605
+-0.0701879 0.175082 -0.0550269
+-0.0424973 0.155091 0.0068798
+-0.0156018 0.0435495 -0.027203
+-0.0387577 0.0797624 -0.0199123
+0.036687 0.0909845 -0.0142871
+-0.0621605 0.170953 -0.0526019
+-0.0503178 0.0515583 0.0186309
+0.0183954 0.0645286 0.0493775
+-0.0816036 0.0774754 -0.00149976
+-0.0167638 0.0728801 -0.0389011
+-0.0612458 0.141043 0.0360828
+-0.0650382 0.153613 0.000196596
+-0.0506214 0.0416531 0.0455899
+-0.0218256 0.086832 -0.0376579
+-0.0368977 0.110447 -0.0189068
+-0.0390704 0.124042 0.0247581
+-0.0145052 0.0544906 0.0506759
+0.0346875 0.0955379 0.0380285
+-0.0427281 0.0478381 -0.0112773
+-0.0589463 0.0436711 -0.00636451
+0.044641 0.0945606 0.00417916
+0.0417801 0.041383 0.0227466
+-0.066757 0.170863 -0.0580345
+-0.0104152 0.0998773 0.0473736
+-0.0467325 0.133652 0.0114554
+-0.0376877 0.163829 -0.000238726
+-0.0725153 0.142823 0.0458217
+0.0207674 0.103342 -0.0194283
+-0.00540678 0.121074 -0.0123374
+-0.0424989 0.102887 0.0413486
+-0.0462349 0.0354247 -0.01929
+0.0180016 0.125305 0.0262968
+-0.0162469 0.184587 -0.0200786
+-0.079084 0.0994215 0.0343706
+-0.0557053 0.132552 0.0352577
+-0.0512629 0.0388692 0.0464256
+-0.0515065 0.160835 0.00704803
+-0.0826893 0.152358 0.0291683
+-0.0584964 0.0932599 0.0452695
+0.024564 0.103479 -0.0175815
+-0.0846694 0.0831371 0.000497005
+-0.0865668 0.118992 0.0483015
+-0.0192412 0.184576 -0.0155995
+-0.00659114 0.03769 -0.0254352
+-0.0245806 0.124862 0.0196194
+-0.0368731 0.105664 -0.0202847
+-0.0621883 0.177235 -0.0596222
+-0.0672213 0.1608 -0.0122924
+-0.0303274 0.0375897 0.0276802
+-0.0234293 0.0522884 0.0423691
+0.0538492 0.0711959 0.0223128
+0.00550075 0.0772523 0.0562045
+0.0438483 0.076237 -0.00278527
+0.00633738 0.0581963 -0.0307089
+-0.0646256 0.0674757 -0.0084666
+-0.0310521 0.0450006 0.0489427
+0.0109104 0.126748 -0.00460652
+-0.0409513 0.128783 0.00774742
+-0.000502218 0.0938722 0.0552243
+-0.0166066 0.035315 -0.0186674
+-0.02118 0.169768 -0.013264
+-0.048723 0.166988 -0.000980568
+0.0301667 0.116977 -0.00204442
+-0.0129037 0.181603 -0.0240442
+-0.0461681 0.033576 -0.00628041
+0.0377831 0.0813859 -0.0147095
+-0.050774 0.143198 0.0153986
+-0.0591392 0.118534 -0.0111826
+0.0601642 0.0622865 0.0071402
+0.0055201 0.0674746 0.0556049
+0.0539548 0.0603844 -0.00239402
+0.0345037 0.0468848 0.0307194
+-0.0226112 0.04084 -0.0289768
+-0.088041 0.0995721 0.00642464
+0.0313753 0.111403 0.0314731
+-0.0818093 0.0776109 0.0245029
+0.0196586 0.112307 -0.0150514
+-0.0547371 0.114833 -0.0154193
+-0.00335753 0.11894 -0.0140663
+-0.0675878 0.0614559 0.0185068
+-0.0374891 0.0973119 0.0427062
+-0.0618754 0.0967815 -0.0181397
+-0.0177948 0.161129 -0.00657359
+-0.0762411 0.0901005 0.0388673
+-0.00749994 0.0647419 0.0560829
+-0.0872439 0.132483 0.0457019
+-0.0207923 0.0756874 -0.0390657
+0.00773677 0.0341095 0.00222437
+-0.00405506 0.101077 0.0451334
+-0.0537766 0.0826585 -0.0215583
+-0.0484986 0.0425777 0.0442245
+0.0370248 0.10907 0.0248298
+0.0550045 0.0727719 0.0183019
+-0.0531047 0.0345095 0.0361399
+0.0240424 0.122784 0.0256717
+-0.0321586 0.0349269 0.0472031
+-0.0487458 0.123267 -0.0102852
+0.0164927 0.107123 0.0418084
+-0.0518639 0.0999443 -0.0218198
+-0.0259535 0.0592275 0.0392168
+-0.0169683 0.186741 -0.0196674
+0.012157 0.123544 0.032833
+-0.0236685 0.0919017 0.0500491
+0.0048864 0.127407 -0.00526463
+-0.00324909 0.0389153 -0.000648163
+0.0108689 0.0576426 0.0524778
+0.0396737 0.107002 0.0161655
+-0.0816849 0.073475 0.00953613
+-0.0743109 0.165184 -0.0390136
+-0.0728909 0.120866 -0.00826881
+0.040969 0.0926354 0.0294955
+-0.00410534 0.0385566 0.0231802
+-0.0167703 0.0742961 -0.0390024
+0.0376363 0.109584 0.0207569
+0.00538144 0.0464854 -0.0270709
+-0.0503176 0.0388958 0.046006
+-0.0793777 0.154922 0.0242883
+-0.0476898 0.0679558 -0.0146484
+-0.0108886 0.108738 -0.0217426
+-0.0532571 0.151368 0.0204421
+-0.068651 0.163792 -0.0529788
+-0.0441151 0.0643553 0.040206
+-0.0275094 0.107088 0.0401149
+-0.0275566 0.0890776 0.0469337
+-0.0274957 0.102963 0.0425886
+-0.0266136 0.0837142 0.0504396
+0.015157 0.122808 -0.00836184
+-0.0234279 0.0636514 0.0436342
+-0.00941329 0.0943623 -0.0340451
+-0.0174189 0.178658 -0.0183022
+-0.0187779 0.183117 -0.0166827
+0.0130462 0.129592 0.0201813
+-0.0751825 0.149958 -0.0238676
+0.00897367 0.131122 0.0172577
+0.0483469 0.0589383 -0.00490848
+0.0422406 0.0986762 0.0221715
+-0.0921564 0.130934 0.011242
+-0.0327106 0.0764924 -0.028531
+0.0102149 0.0725802 0.055192
+-0.0636711 0.0593571 0.0158341
+-0.0123306 0.0394822 0.0386711
+-0.0718333 0.156164 0.022455
+-0.0864971 0.150096 0.00821548
+-0.0110742 0.123419 -0.00875247
+-0.080097 0.11274 -0.00201289
+-0.00271881 0.0655507 -0.0345764
+0.00140103 0.0390882 -0.0248121
+-0.0618299 0.0939366 -0.0189413
+-0.0716693 0.147461 -0.0281971
+-0.0231858 0.17269 -0.0205136
+-0.0637876 0.155678 -0.0402328
+-0.0228589 0.0637031 0.0444908
+-0.0238626 0.169762 -0.0118641
+-0.0752191 0.155599 0.0242023
+-0.0345019 0.0461718 -0.0254652
+-0.01605 0.0946681 0.0536372
+0.0246905 0.0477085 0.0389599
+0.0101881 0.0341976 -0.00109267
+-0.0293326 0.154386 -0.00360575
+0.00276097 0.131717 0.0121378
+-0.0859012 0.0899317 0.000454719
+-0.0297834 0.121969 -0.0069874
+-0.0297126 0.0508986 -0.0203549
+-0.0888501 0.151809 0.0151852
+-0.0824868 0.0965084 -0.00559576
+-0.0279025 0.124426 0.000511349
+-0.0111071 0.0879305 -0.0374747
+-0.0895782 0.133632 0.00522749
+-0.0325779 0.0341004 0.0231549
+-0.087069 0.100891 0.00537711
+-0.0182966 0.038653 -0.00715499
+-0.0181652 0.097581 -0.0254283
+0.00716304 0.0378885 -0.010707
+-0.0117789 0.0582633 0.0533407
+-0.0679898 0.154859 0.0296647
+0.0270346 0.0384464 0.0278157
+-0.0446977 0.147484 -0.0025954
+-0.0797208 0.0757926 0.0264575
+-0.0827795 0.113314 0.0464356
+-0.0405007 0.118003 0.0314814
+0.00913581 0.103011 -0.0206427
+-0.0712761 0.153449 0.0330143
+0.0296113 0.108994 -0.0114792
+0.0120747 0.0958655 -0.0254962
+-0.0357119 0.0695868 -0.0167299
+-0.0777217 0.159728 -0.0179219
+-0.0619192 0.0343817 0.0361087
+-0.0839142 0.0843714 -0.00355138
+0.0295472 0.11806 0.0262972
+-0.0344935 0.0733008 0.0417052
+0.0305902 0.0996469 -0.0155371
+-0.0731059 0.151228 -0.0378853
+-0.0740388 0.151266 -0.032878
+-0.0419789 0.152954 -0.00736227
+-0.00349089 0.112806 0.0419152
+0.00607582 0.0348373 0.023168
+-0.000568628 0.0388214 0.0254737
+0.0445611 0.0931651 0.0181595
+-0.0469298 0.126751 0.026776
+-0.0318643 0.104333 -0.0219242
+0.0119312 0.0725978 0.0541603
+-0.0435985 0.108724 -0.0190759
+-0.0274517 0.043312 0.0519115
+-0.00149233 0.077429 0.0585147
+-0.0618993 0.0433992 0.0415482
+0.0131559 0.129936 0.00738875
+0.00749621 0.107111 0.0412811
+0.0354668 0.0573224 -0.0106723
+-0.0211412 0.0652998 0.0483526
+-0.00680045 0.129424 0.0244883
+-0.0187344 0.126979 0.0202236
+0.00853139 0.0813381 0.0552215
+-0.0254455 0.0389929 0.0381911
+-0.0507728 0.111366 -0.017973
+-0.027716 0.0387019 -0.0165247
+-0.000266462 0.0936214 -0.0332218
+-0.0855847 0.0806062 0.0194802
+0.0100369 0.130324 0.00340984
+-0.0449017 0.148739 -0.00386394
+-0.0321132 0.0482449 -0.0223421
+-0.0893696 0.140675 0.0341739
+0.0448261 0.0875458 0.0221634
+-0.0454912 0.0719252 0.0419203
+-0.0718306 0.148291 -0.0327712
+-0.0812513 0.108802 0.0293202
+0.0429574 0.0859786 -0.00579554
+-0.0338336 0.0380945 -0.0153271
+-0.060738 0.148827 -0.00180261
+-0.0568701 0.141076 -0.0033696
+-0.0358396 0.125396 0.0214464
+-0.0789386 0.168616 -0.0354931
+-0.0315115 0.108439 0.0386203
+-0.0842691 0.117693 0.0488129
+-0.032501 0.101545 0.0423652
+-0.0289779 0.174216 -0.00689295
+-0.0622726 0.163207 -0.0582148
+-0.00885889 0.172674 -0.0247544
+-0.0519291 0.13698 0.0263868
+-0.0829532 0.112769 0.000219247
+-0.0237394 0.038003 0.0142418
+0.0321413 0.0513188 -0.0087021
+-0.0473947 0.0359569 0.0452833
+-0.0488828 0.108449 -0.0190525
+0.0415402 0.0928967 -0.0067838
+-0.0800241 0.0745873 0.0239149
+0.005197 0.0866258 -0.0333998
+0.00148166 0.107215 0.0427825
+-0.0694376 0.159556 -0.0509365
+-0.0306541 0.0650706 -0.0234343
+-0.0653365 0.167223 -0.0303028
+-0.0262324 0.15581 -0.00635861
+-0.0362329 0.165306 -0.00162934
+-0.00330758 0.0379537 -0.0147265
+-0.0267799 0.0893467 -0.0340353
+-0.0591073 0.155657 0.0168017
+-0.0331866 0.15511 0.000984746
+-0.0671323 0.152011 0.0359968
+0.0112495 0.0710359 -0.0320326
+-0.0289103 0.0508426 -0.0224168
+-0.0582351 0.043574 0.0153571
+-0.0770169 0.112922 0.0479771
+-0.0146932 0.0570315 -0.0346956
+-0.0735209 0.134443 0.0506533
+-0.0445794 0.130477 0.0137726
+-0.0744939 0.127436 0.052791
+-0.0376156 0.0492564 -0.0118933
+-0.0462534 0.123907 0.0259058
+-0.0434909 0.104315 0.0413728
+-0.0779429 0.0893818 -0.0115854
+-0.067492 0.10005 0.0413205
+-0.0882017 0.0949941 0.0238463
+0.0438775 0.06952 0.000229591
+-0.0171444 0.168289 -0.0207283
+-0.0236004 0.0383091 -0.00235181
+-0.0697889 0.172796 -0.0390999
+-0.0291426 0.042089 -0.0296009
+-0.0446441 0.0338442 0.00651202
+-0.000500925 0.121055 0.0369996
+0.022042 0.12426 0.000701449
+0.00803725 0.125889 0.0313
+-0.0517799 0.0840941 -0.0216716
+-0.0145005 0.0842486 0.056982
+-0.0886066 0.113065 0.00725433
+0.0156656 0.0713152 0.0525386
+-0.0164665 0.068805 0.0544258
+0.0182285 0.0820502 -0.0281776
+-0.00610364 0.0386755 0.000846714
+-0.0599938 0.126727 -0.00781868
+-0.0155017 0.100285 0.044225
+-0.0638562 0.0423917 -0.00506847
+-0.0444796 0.0338614 0.0280014
+-0.000499767 0.100727 0.0463954
+-0.0162094 0.172709 -0.0239586
+-0.0690346 0.0338087 0.00696066
+-0.062316 0.158431 -0.019584
+0.00644358 0.129282 -0.00129108
+0.0188124 0.0393785 0.042705
+-0.0847946 0.140657 0.0430258
+-0.0835274 0.0979539 0.0303801
+-0.0241902 0.160559 -0.0136368
+-0.06502 0.161419 -0.0172527
+-0.0772789 0.154395 0.0279022
+-0.0681261 0.15638 0.0193912
+-0.0337268 0.111492 -0.0180397
+-0.0323736 0.176483 -0.0134412
+-0.0291608 0.0806486 0.0445728
+-0.0846331 0.0781756 0.0181083
+-0.0498753 0.106996 -0.0192538
+0.00350083 0.0730867 0.0562031
+-0.0231171 0.0347933 0.0492623
+-0.0616059 0.0342155 0.0188015
+-0.0516 0.0545447 0.0296397
+-0.0763817 0.169448 -0.0429673
+-0.069513 0.17974 -0.0519891
+-0.0588484 0.13671 0.0342246
+-0.0780833 0.1597 -0.0209281
+0.00109253 0.113026 -0.0199046
+-0.0227366 0.157094 -0.00651614
+0.0344933 0.0929192 0.0394802
+-0.000408544 0.126448 -0.00615558
+-0.0805024 0.128853 0.052889
+-0.00020637 0.0947598 -0.0324026
+-0.089811 0.143072 0.0296513
+0.0321792 0.0929416 0.0413986
+-0.0145721 0.168692 -0.0222333
+0.0595491 0.0594739 0.0201736
+-0.0810451 0.0800939 -0.00453207
+-0.0267843 0.0880044 -0.0350453
+-0.040033 0.126629 -0.00388698
+-0.0208083 0.0348218 0.0462671
+-0.082826 0.11472 -0.00162443
+-0.0301654 0.12556 0.01613
+-0.0485613 0.0418518 -0.011173
+-0.0784181 0.163881 -0.0269512
+0.0387541 0.0617571 -0.00875906
+0.0464006 0.0792571 0.0121793
+-0.00359562 0.043415 -0.0257386
+-0.0333921 0.126443 0.0164188
+-0.00106292 0.130975 0.00499363
+-0.0668008 0.060458 0.0159676
+-0.0254977 0.107106 0.0408331
+-0.0682758 0.06442 0.0246162
+-0.0298175 0.125729 0.00888885
+-0.088267 0.147416 0.00925394
+0.0542609 0.050631 0.00222604
+0.0422118 0.100079 0.0191646
+-0.081175 0.14869 0.00117764
+-0.0344163 0.0346761 0.0417292
+-0.0623017 0.163119 -0.0425932
+-0.0298952 0.0565521 -0.0204023
+-0.076686 0.0781369 0.0338733
+-0.0338704 0.102893 -0.0218261
+-0.0355104 0.0775398 0.0419002
+-0.0584924 0.0630612 0.0296076
+0.0454221 0.0889974 0.0141646
+-0.0417964 0.0347181 0.00810808
+0.0363875 0.0505227 -0.00658574
+-0.053281 0.144674 0.0233765
+0.0262687 0.0352193 0.019674
+-0.0168964 0.123328 -0.00656517
+-0.0606083 0.118309 0.0403758
+0.00639612 0.0418759 -0.0239341
+0.0231261 0.0431609 -0.0107258
+-0.00718079 0.0390105 -0.0127195
+-0.00364386 0.0901332 -0.0356262
+-0.00854262 0.033753 -0.0231542
+-0.0124761 0.0531764 0.0512005
+-0.0231395 0.168252 -0.0189417
+0.0233331 0.0354178 0.02435
+-0.000241537 0.0397743 0.0467748
+-0.0723661 0.147118 -0.0228625
+-0.0517688 0.0612265 0.030932
+-0.063068 0.161146 -0.0557557
+-0.0279123 0.0793217 0.046185
+-0.0627986 0.0441541 -0.00325511
+-0.0165065 0.100263 0.0439632
+-0.0217072 0.0582569 -0.0327502
+0.0254642 0.12325 0.0062381
+-0.086501 0.0833246 0.0174861
+-0.074502 0.11613 0.052068
+0.032458 0.0910982 -0.0184345
+-0.0729629 0.155811 0.0249814
+-0.0506733 0.162525 0.00564316
+-0.0697867 0.034416 -0.00452426
+0.0189467 0.0754919 0.0520404
+-0.0165401 0.0997826 0.0440769
+-0.086829 0.0847067 0.0174745
+-0.0474936 0.146975 -0.00223523
+-0.065417 0.154594 -0.0449582
+-0.0614906 0.0590888 0.0075192
+-0.0686207 0.128453 0.0500102
+-0.023162 0.0958328 0.0451924
+-0.0258056 0.0550238 0.0391969
+-0.0102599 0.0407381 0.0498453
+-0.0664749 0.0875478 0.0443297
+0.0581415 0.0538012 0.00818348
+-0.0384918 0.0903063 0.0434643
+-0.0457684 0.132352 0.0133121
+-0.0728932 0.0941961 0.0410307
+-0.0809085 0.111715 -0.000772193
+-0.0833393 0.0979244 -0.00460929
+-0.0671961 0.15591 -0.00355939
+-0.0455114 0.0338265 0.027816
+0.01975 0.0343373 0.00255688
+-0.0875501 0.120326 0.0478169
+0.0353576 0.0505704 -0.00670224
+0.00356645 0.0339958 0.0125338
+0.0590653 0.0552605 0.0161784
+-0.084435 0.0791603 0.0205035
+-0.0255122 0.0349295 -0.0287387
+-0.0724789 0.110508 0.0438845
+0.00447986 0.0385716 -0.0118677
+-0.066989 0.136993 -0.00809827
+0.0384287 0.064558 0.0344028
+-0.0516036 0.0560273 -0.00839821
+-0.00350028 0.110017 0.0429859
+-0.0111634 0.0391658 0.035606
+0.0183426 0.0906063 -0.0259275
+-0.031909 0.154239 -0.00732019
+-0.0800971 0.0773092 -0.00453369
+-0.0190564 0.0920061 -0.0357108
+0.0133608 0.0494245 -0.0271921
+-0.0787339 0.140316 -0.00472414
+-0.0275167 0.116662 0.0324113
+0.00652621 0.104352 0.0432895
+0.0358497 0.0713653 0.0377445
+-0.0918605 0.116299 0.0240619
+-0.0522199 0.061167 0.0299696
+-0.0201447 0.166816 -0.0117812
+-0.0433732 0.122414 -0.0114499
+-0.0645963 0.0430073 0.0358234
+-0.0779043 0.1583 -0.0209193
+0.0367132 0.0547551 0.0317845
+-0.0351109 0.16372 -0.0144674
+-0.0434603 0.109995 -0.0184047
+-0.0576869 0.0677197 -0.0118328
+0.00623854 0.074018 -0.0343382
+0.0443987 0.0959613 0.0131589
+-0.089865 0.120262 0.0458544
+0.0103837 0.0449023 -0.0251665
+-0.0770006 0.139838 -0.00569476
+-0.072687 0.0955359 0.0408041
+-0.0569361 0.046073 0.0125834
+-0.0604913 0.0818799 0.0434166
+-0.0460645 0.151688 -0.00554828
+-0.015331 0.0349099 0.0491212
+-0.0229594 0.0811266 0.055321
+0.0274663 0.0754645 0.0450048
+-0.00267666 0.0374926 0.0135597
+-0.011518 0.0673875 0.054571
+0.013368 0.122467 -0.00997636
+-0.0722821 0.143895 -0.0129091
+0.0454962 0.0443878 0.000424365
+-0.0127602 0.0382241 0.0199007
+-0.091546 0.146121 0.023146
+0.00392744 0.0371222 0.0242968
+-0.0385489 0.119476 -0.0123722
+0.0114833 0.0936471 0.0518498
+-0.0643328 0.146767 0.0386771
+-0.0624894 0.163088 -0.0505885
+-0.0375004 0.0464372 0.040096
+0.0460037 0.0834239 0.0131685
+0.033027 0.108336 -0.00876159
+0.013228 0.0990749 -0.0229052
+0.034148 0.0442132 0.0295363
+-0.0907186 0.113289 0.0113419
+0.0210633 0.106016 0.0411627
+-0.0454948 0.119311 0.0290591
+-0.0676975 0.0607342 0.0101856
+-0.0195364 0.0461211 0.0518679
+0.0161339 0.0672434 0.0514025
+-0.0693216 0.0620201 0.0176481
+0.0429729 0.0944315 -0.00180352
+-0.0494828 0.135763 0.0221907
+-0.060805 0.0867676 -0.0196616
+-0.0247298 0.125997 0.0151584
+0.059297 0.0608379 0.0211666
+-0.080116 0.153024 0.0299773
+0.0574282 0.0681585 0.00377242
+-0.0535498 0.0486673 -0.00635158
+-0.0304741 0.177281 -0.004356
+-0.0855011 0.0792275 0.0175034
+-0.0804698 0.130248 0.0526854
+0.000343862 0.0539275 -0.0306641
+-0.0900062 0.133811 0.0372136
+0.0104354 0.0347372 0.0259595
+-0.0574962 0.0440189 0.0444763
+-0.0573422 0.0335757 0.00237022
+0.0404449 0.0739232 0.0320846
+-0.00464724 0.0496642 -0.0307417
+-0.0311133 0.0510509 -0.015361
+0.0169782 0.128539 0.0144983
+-0.0872732 0.151714 0.0113029
+-0.0345546 0.0409268 0.0482929
+-0.0745628 0.173554 -0.0490908
+-0.0213027 0.0381376 0.0110019
+0.0223647 0.0782061 0.0499784
+0.0111959 0.0879068 -0.0311136
+0.0141654 0.115006 -0.0159235
+-0.0175094 0.116845 0.0368185
+0.0185047 0.0369619 -0.0146835
+-0.0924063 0.129578 0.0112381
+-0.00949945 0.0517772 0.0514996
+-0.0666563 0.0656524 -0.0048951
+-0.0494962 0.100168 0.0429965
+0.00776642 0.130336 0.022539
+-0.0564976 0.0904367 0.0452654
+-0.0648339 0.153263 -0.0390895
+0.0140569 0.12802 0.0248446
+-0.00977705 0.174183 -0.0237537
+-0.0154865 0.0530505 0.0500296
+-0.0627622 0.0810191 -0.0190992
+-0.0385594 0.173184 -0.00190958
+-0.00314149 0.0972112 0.0530078
+-0.0418773 0.107078 -0.0201516
+0.0363342 0.109637 -0.000829727
+0.021507 0.126326 0.01189
+-0.030496 0.0988081 0.0439786
+-0.0769628 0.150462 0.0371334
+-0.0941104 0.126894 0.0182531
+-0.0255083 0.112568 0.0366767
+-0.0746801 0.157704 -0.00556618
+-0.0418449 0.0971142 -0.0220611
+-0.0359493 0.125342 -0.00457539
+-0.0258164 0.0853463 -0.0368715
+0.0497106 0.0482066 0.0259506
+-0.0716942 0.1568 -0.0399156
+-0.0618117 0.0590403 0.0165038
+-0.0714498 0.15679 -0.0419165
+-0.0701989 0.0368637 0.0105096
+0.0597267 0.0636404 0.0201833
+-0.0915748 0.124221 0.0431828
+-0.0690929 0.156328 0.0219534
+-0.0302767 0.0622182 -0.0224251
+-0.00771091 0.0627931 -0.0356131
+0.0394872 0.0513548 0.03224
+-0.0229845 0.0724431 0.0499564
+-0.0290201 0.125445 0.00626167
+-0.0729777 0.138423 -0.00695981
+-0.00991212 0.111561 -0.0201766
+0.000200297 0.0825801 -0.036136
+0.0364442 0.0590953 0.0349595
+0.0364996 0.0928818 0.0370772
+-0.0181329 0.0432293 0.0524811
+0.00280759 0.0350639 0.0204847
+-0.0626379 0.152126 -0.0285986
+-0.0704211 0.15543 0.027334
+0.000301963 0.100099 0.0481787
+-0.049492 0.0917757 0.044207
+-0.015502 0.0897786 0.0564851
+-0.0318792 0.156356 -0.0104816
+0.0416778 0.102863 0.015161
+0.0504722 0.048918 -0.000684915
+-0.0611415 0.0359024 -0.0090437
+-0.0264937 0.098817 0.0439871
+-0.000436317 0.122463 0.0356275
+-0.0875676 0.129767 0.0460862
+-0.0312863 0.0777611 -0.0325602
+-0.0303664 0.112853 -0.0174686
+-0.00773829 0.0684701 -0.0360951
+-0.0647534 0.156678 -0.0475943
+-0.0891175 0.0983455 0.0194044
+0.00833741 0.055373 -0.0305597
+-0.0550257 0.131065 -0.00539027
+-0.0305029 0.0689001 0.0393777
+-0.0596554 0.0343168 0.0331724
+0.0436089 0.0680569 -0.000247417
+-0.0786395 0.163873 -0.0279533
+-0.0574243 0.0613459 0.0260206
+-0.0338728 0.0483909 -0.0193366
+-0.0287306 0.074519 0.0412207
+0.016916 0.0577101 0.0489225
+-0.0184307 0.0347944 0.0485523
+-0.0655112 0.0803784 0.0426229
+-0.0332327 0.160967 -0.000804209
+-0.0533105 0.0541891 0.0115512
+-0.0356689 0.117866 -0.0126779
+-0.0699903 0.034504 0.00971713
+-0.0588141 0.0341524 0.0282501
+-0.0177813 0.0770869 -0.0388032
+0.0445157 0.0467554 0.0289718
+0.00964716 0.128306 -0.00229994
+-0.0666126 0.148623 0.0392621
+-0.0325544 0.0348985 0.0454309
+-0.0623108 0.039732 0.0166963
+-0.0917483 0.122888 0.0433845
+0.0271866 0.0819517 -0.0229154
+-0.00863658 0.0467032 -0.0298179
+-0.0620847 0.166243 -0.0515916
+-0.0912832 0.125583 0.0428488
+-0.0588072 0.0481223 0.00266039
+-0.0913122 0.133748 0.0212171
+0.0482658 0.0433313 0.0185611
+0.00774922 0.0351262 -0.0136823
+0.0357585 0.0562848 0.0339755
+-0.029123 0.166739 -0.016877
+-0.0338028 0.122413 -0.00742547
+0.0216799 0.0415358 -0.0117265
+-0.0257594 0.171231 -0.0110774
+-0.0641199 0.162494 -0.0212451
+-0.0535748 0.155622 0.0115317
+0.0531674 0.0736169 0.0146631
+0.0135129 0.0347107 0.0374491
+0.0227019 0.123147 0.0266031
+0.025252 0.0719314 -0.0249494
+0.0309797 0.118122 0.0225615
+0.0415492 0.0724945 0.03012
+0.000493498 0.119652 0.0380928
+0.0229975 0.123119 -0.000380287
+0.0234322 0.100371 -0.0202365
+-0.0620057 0.153738 -0.0265835
+-0.0398723 0.105663 -0.0203219
+-0.0632416 0.0445478 0.0366988
+-0.0310386 0.154131 -0.00157547
+-0.0042992 0.0348909 0.0408189
+-0.00181562 0.0826307 -0.0368615
+0.0388816 0.0927717 0.0335536
+-0.0335058 0.0760991 0.0415371
+-0.0314963 0.0917789 0.0442247
+-0.0512549 0.0612644 0.0318233
+-0.00281159 0.131227 0.0100802
+-0.0531145 0.157563 -0.00324336
+-0.0635867 0.03486 0.0405057
+-0.0627936 0.15522 -0.0356106
+0.0166245 0.122097 0.0315907
+-0.0106759 0.119083 -0.0141801
+-0.0465015 0.0689677 0.0402969
+-0.0626599 0.0423324 0.0141491
+-0.0515376 0.053149 0.0306286
+0.00413437 0.124074 -0.00964261
+-0.0105331 0.127013 0.0275477
+-0.042312 0.0337552 -0.0130352
+0.0472026 0.0681414 0.0256953
+0.0213439 0.0741385 0.0502206
+0.0156241 0.128368 0.0211329
+0.0358549 0.0843357 -0.0172902
+-0.0533892 0.064921 0.0343521
+0.0273368 0.091573 0.0449418
+-0.0440333 0.0423079 -0.0173091
+-0.0764978 0.13864 0.0490601
+0.00750117 0.0716903 0.0560753
+0.0454321 0.0861887 0.0181684
+-0.0812985 0.084505 0.0328118
+-0.0605375 0.155317 0.003221
+-0.0065332 0.130449 0.0187888
+0.0247646 0.122114 0.0259409
+-0.0711064 0.152637 0.0345827
+-0.0155013 0.0716083 0.0551341
+0.0277791 0.0822205 0.0455159
+-0.0445183 0.0675631 0.0404632
+-0.0772746 0.147261 -0.00486297
+-0.0868795 0.0927253 0.00342064
+-0.0458425 0.0985138 -0.0217256
+-0.0906083 0.131058 0.0342318
+-0.091547 0.146101 0.0191506
+-0.00249086 0.116945 0.0398999
+0.0385734 0.0699568 0.0346425
+-0.0129648 0.116833 -0.0157687
+0.0215791 0.120444 0.0319368
+-0.0899229 0.115405 0.0270455
+-0.0697992 0.0836733 -0.0171139
+-0.0415794 0.128056 0.0149128
+-0.0734779 0.180121 -0.0504836
+-0.0466973 0.0665278 -0.0146823
+-0.0673893 0.156703 -0.00509746
+0.00108438 0.119342 -0.0145393
+-0.019494 0.0842608 0.0571688
+0.0285713 0.0551672 -0.0188053
+0.00650695 0.0731027 0.0564796
+-0.0557862 0.0854763 -0.0214113
+-0.0743851 0.163815 -0.0369793
+-0.0286768 0.123948 -0.00103929
+-0.0301123 0.163751 -0.0154896
+0.0410386 0.099944 -0.00278716
+0.00848446 0.0518256 0.0516867
+-0.051108 0.0530218 0.0319282
+-0.0905758 0.113954 0.0388293
+-0.00470317 0.038779 0.00289117
+-0.0247258 0.0638997 -0.032873
+-0.04111 0.159177 -0.0108205
+-0.0892399 0.140676 0.0351725
+-0.075004 0.141334 -0.0064915
+-0.0463338 0.132474 0.00863126
+-0.0541416 0.034749 0.0443256
+-0.0781873 0.168068 -0.0319708
+0.0328915 0.0696754 -0.0177356
+0.0346158 0.0369318 0.00517598
+-0.0694908 0.124597 0.0526574
+0.0581844 0.0711857 0.0106064
+-0.0378081 0.0841771 -0.022143
+-0.0281622 0.169703 -0.0179592
+0.0305485 0.118199 0.0238252
+-0.0289649 0.0747374 -0.0345478
+-0.0272221 0.0904382 0.0465675
+-0.0514982 0.0848246 0.0453901
+-0.051623 0.0531083 0.0226238
+-0.0398125 0.0899922 -0.0232612
+-0.0236559 0.0709438 0.0478646
+-0.053816 0.0559281 -0.00642904
+0.0603322 0.0636924 0.0181801
+-0.0884616 0.136381 0.00620417
+-0.0394936 0.046476 0.0404962
+-0.0530638 0.0723343 0.0404003
+0.0102711 0.0695708 -0.0315811
+0.0339253 0.115718 0.0108315
+-0.0295473 0.0358282 0.0521362
+0.0116453 0.090034 0.0538428
+0.0450904 0.0875663 0.0201674
+0.0326336 0.0519746 0.0346532
+0.03367 0.072742 0.0398859
+0.024638 0.124378 0.010214
+0.0415181 0.0484385 0.0321463
+-0.044143 0.159411 0.00624881
+-0.0495653 0.047469 -0.00900107
+-0.0894571 0.131034 0.0422704
+-0.075804 0.161028 -0.0299559
+-0.0164919 0.0968814 -0.0286925
+0.0229929 0.0371968 0.0317242
+0.0352506 0.101471 -0.011425
+-0.049558 0.0389942 -0.0116749
+-0.0223649 0.171249 -0.0132085
+-0.0667327 0.078026 -0.0171522
+0.0442166 0.0846846 -0.00180459
+-0.0518774 0.104165 -0.0200373
+-0.0393536 0.0336231 0.00416845
+0.00720473 0.0823989 -0.0333538
+-0.0288578 0.101545 -0.0231915
+0.0245524 0.106048 0.0391612
+-0.0851811 0.0897279 0.0280525
+-0.00334607 0.0347739 0.0411187
+-0.0430221 0.128224 0.015861
+0.0243931 0.0503998 -0.0217952
+-0.0394902 0.0506047 0.0393469
+0.0293799 0.0892796 -0.0205263
+-0.0574934 0.0875623 0.0444505
+-0.0644211 0.0347126 0.0370276
+-0.0169241 0.181626 -0.0193127
+-0.0564978 0.0732565 0.0410435
+-0.0544221 0.144671 0.0284168
+0.0203184 0.0650483 -0.0276666
+-0.0648645 0.041891 0.032665
+-0.0451284 0.159142 -0.00893675
+0.0451235 0.093189 0.0121575
+-0.0577489 0.0479998 -0.00135721
+-0.0606371 0.0448145 0.012064
+0.0495086 0.0638139 0.0293036
+0.0458685 0.0862133 0.0111669
+-0.0531099 0.136165 -0.00197183
+0.0285441 0.0509095 -0.0177614
+-0.013074 0.0383381 0.00704947
+-0.0223231 0.0391341 0.0387105
+0.0393846 0.0429207 -0.00283799
+0.0202147 0.0847891 -0.0269071
+0.00923869 0.035402 -0.0117616
+-0.060367 0.11933 -0.00999174
+-0.0772797 0.157576 -0.0127941
+-0.0732669 0.179344 -0.0490063
+-0.0683896 0.0420777 -0.000309277
+-0.0539058 0.102757 -0.0202213
+-0.0453256 0.169857 -0.00299568
+-0.0616838 0.0659304 -0.00830259
+0.00414244 0.129952 4.9397e-05
+-0.0404915 0.113924 0.0347061
+-0.0942425 0.120105 0.0182851
+-0.0324906 0.080327 0.0414535
+0.0529677 0.0595446 0.0290441
+-0.0904857 0.114242 0.0332623
+-0.0703591 0.181312 -0.0565189
+-0.0475241 0.112407 -0.0169253
+0.0109831 0.0341684 -0.0140433
+-0.089612 0.139257 0.0251846
+-0.0373738 0.0365422 0.044687
+0.0564401 0.0662549 0.00171258
+-0.0581251 0.0334091 -0.00125013
+-0.0407273 0.0696207 -0.0166002
+-0.0669961 0.165196 -0.05701
+0.0131268 0.120538 0.0349816
+0.0367009 0.0812747 -0.0157528
+-0.0077824 0.0784642 -0.0379203
+-0.0647128 0.155185 0.0278857
+0.00549498 0.0951378 0.0528545
+-0.0108057 0.0342947 -0.0255969
+-0.0911579 0.129687 0.0342384
+-0.080608 0.0720682 0.0165498
+-0.073439 0.148627 -0.0298053
+-0.0271937 0.174158 -0.0183459
+-0.0244966 0.0509689 0.0431921
+-0.00162246 0.0450436 -0.027024
+-0.0775221 0.104823 0.0340694
+0.0154861 0.0927165 0.0506449
+-0.0599536 0.123822 -0.00839074
+-0.079866 0.0706372 0.0115498
+-0.0815235 0.0899003 0.0328752
+0.0313378 0.118325 0.00558524
+0.0248331 0.123944 0.0188283
+-0.0898787 0.112224 0.0169361
+-0.0662043 0.065068 0.0280019
+0.0246717 0.0434401 -0.00867806
+-0.0469681 0.134154 0.0128397
+-0.0291377 0.0860908 -0.0335904
+0.0147704 0.0519654 0.0475176
+-0.0296475 0.169744 -0.0079151
+-0.0211888 0.175661 -0.0220113
+-0.0347689 0.0780934 -0.0215038
+-0.013019 0.129549 0.0120959
+0.0421932 0.0662609 -0.00283376
+0.0111358 0.0352671 0.0436641
+-0.0705399 0.100871 0.0399167
+-0.0604975 0.0832903 0.0437356
+-0.0659485 0.126772 -0.00885106
+-0.0702518 0.06756 0.0285092
+-0.00688661 0.108791 -0.0226031
+-0.0786437 0.112204 0.0464731
+0.00637271 0.130879 0.0205945
+-0.066894 0.110895 -0.0121462
+0.0123118 0.0623753 -0.0299343
+-0.0285044 0.109801 0.0380702
+0.00650421 0.0883449 0.0558788
+-0.0545694 0.124267 -0.00721739
+-0.0626588 0.161511 -0.0455953
+-0.0861214 0.132549 0.0473951
+-0.0627776 0.125519 0.0444184
+-0.0177321 0.160293 -0.0123373
+-0.0490182 0.0345781 0.0369526
+-0.0297799 0.106834 -0.0211406
+-0.079558 0.151858 0.0332132
+-0.0404921 0.0648693 0.0415314
+-0.0530069 0.153493 0.0132253
+-0.0339683 0.0485791 0.0404406
+-0.0421354 0.0449426 -0.0173193
+-0.0517467 0.076797 -0.0188523
+-0.060863 0.0583083 0.0137477
+0.0112347 0.0794806 -0.0318525
+0.00351036 0.0856577 0.0572413
+-0.0648576 0.101039 -0.0173044
+-0.0601123 0.0381131 0.0455939
+-0.015494 0.0515277 0.0489706
+-0.0275254 0.1668 -0.00838328
+-0.0365126 0.077567 0.0421306
+-0.0195832 0.1596 -0.0115811
+0.00251466 0.0744821 0.0563666
+0.0589788 0.062133 0.0220601
+-0.066902 0.117219 0.0507079
+-0.0396194 0.0335538 -0.0253204
+-0.0297618 0.107877 -0.0202294
+-0.00601771 0.0990415 0.0504631
+-0.084398 0.0778007 0.013518
+0.0271613 0.0368693 0.0238228
+-0.0589877 0.0335902 0.00921609
+0.029871 0.0968887 0.0415927
+0.00949394 0.0426698 0.0450285
+-0.0697739 0.0382195 0.0100596
+0.0231426 0.0768603 0.0493195
+-0.00501253 0.125042 0.0324689
+-0.00710159 0.0387114 0.00061319
+-0.0177128 0.0599179 -0.0354327
+-0.045698 0.157938 0.00750606
+0.00190257 0.130874 0.00322319
+-0.0444648 0.0945053 0.0429498
+-0.0772757 0.148645 -0.0058688
+-0.069822 0.156776 -0.00162593
+-0.0445001 0.117958 0.0308281
+-0.0409685 0.0462375 -0.0173222
+-0.0305996 0.0509893 -0.0173575
+0.00196704 0.0385066 0.0244659
+-0.00668986 0.0584241 -0.0339312
+-0.0587805 0.0811174 -0.0202922
+-0.0492044 0.143127 0.00539863
+-0.0686509 0.155409 0.00612964
+-0.0404209 0.150087 -0.00469474
+-0.00449521 0.0925603 0.0561444
+-0.000397233 0.131333 0.0167016
+-0.0552402 0.138165 0.0306253
+0.0215752 0.056436 0.0468827
+-0.0248564 0.100174 -0.0239639
+-0.0165731 0.0386082 0.0295958
+0.0232801 0.125085 0.0182493
+0.0228318 0.0357435 0.0257706
+-0.0492021 0.127407 -0.00458885
+-0.0878029 0.112934 0.0313303
+0.0465727 0.0554592 0.0320923
+-0.0288967 0.0499669 0.0438168
+-0.000173892 0.120963 -0.0122496
+-0.0704499 0.154022 0.0317661
+-0.0151711 0.0346724 0.0458457
+-0.0640566 0.138182 0.0390191
+0.0398408 0.105612 0.0201716
+0.0444976 0.0583814 0.0318302
+0.031639 0.0370094 0.0209702
+-0.0104878 0.112778 0.0413082
+-0.0672962 0.0785128 0.0408262
+-0.0760729 0.0675487 0.00755458
+-0.0571409 0.0642584 0.0323718
+0.0261418 0.0859362 -0.0230192
+-0.015502 0.0856307 0.0568812
+0.0189265 0.119915 -0.00924366
+-0.0119328 0.103575 -0.0236984
+-0.00622128 0.0384574 0.0119659
+-0.0779451 0.128117 -0.00684087
+-0.0657248 0.120041 0.0506761
+-0.0623817 0.147548 -0.00757469
+-0.0875561 0.121673 0.0477803
+0.0222529 0.0365833 0.0139797
+-0.00142937 0.126525 -0.00622577
+-0.0226373 0.0386776 -0.0154938
+-0.0648114 0.0335165 0.00450366
+0.0210136 0.0713836 0.0497227
+-0.0348346 0.0347214 0.0345782
+-0.027609 0.0850124 0.048532
+-0.0856119 0.0819492 0.0204815
+-0.0601038 0.0347331 -0.00989443
+0.00929494 0.0956507 -0.0272714
+-0.0915391 0.118654 0.00731945
+-0.00449819 0.0604864 0.0551163
+0.0204818 0.0854612 -0.0266087
+-0.0429251 0.129071 0.00699388
+-0.0789967 0.138332 -0.00474353
+0.0343592 0.0519767 -0.00689954
+-0.0921408 0.125525 0.040859
+0.0516782 0.0702939 0.00352664
+-0.022659 0.0508417 -0.0286643
+-0.00138527 0.0424799 0.0468649
+0.0452912 0.0903849 0.0031762
+0.0401652 0.0717052 -0.00977551
+-0.0905185 0.148805 0.0131551
+-0.0470106 0.149195 0.00904699
+-0.0201874 0.0711262 0.0528634
+-0.0555353 0.0388223 -0.0103544
+-0.0714965 0.154091 0.0314059
+0.0232354 0.0968772 0.0460698
+-0.020264 0.0381835 0.0111715
+-0.0267635 0.177003 -0.0181719
+-0.0755105 0.151351 -0.0138965
+-0.00749931 0.0925693 0.0562701
+-0.063994 0.152679 -0.0352218
+0.0453927 0.0833662 0.00319518
+-0.0137973 0.081348 -0.0391911
+-0.0433806 0.120699 0.0278302
+0.0462048 0.0792353 0.00618416
+-0.0498122 0.141672 0.00439987
+-0.0592291 0.156682 0.00368263
+-0.0525972 0.055954 -0.00763978
+-0.0796979 0.108952 0.0363543
+-0.0334959 0.0335656 -0.024125
+0.0047441 0.131688 0.0100125
+-0.0530342 0.15087 0.0203968
+-0.0794975 0.133078 0.0519067
+0.0231582 0.125381 0.0124998
+-0.0898343 0.122953 0.0457467
+0.0336909 0.115719 0.00499933
+-0.0364989 0.0705154 0.0419282
+-0.0641133 0.155183 -0.0406054
+-0.0303694 0.034667 0.0426012
+-0.0474034 0.126784 0.0277907
+0.0312862 0.107094 -0.0114403
+-0.0399374 0.122179 0.0274746
+-0.0715157 0.106884 0.0372861
+0.0432452 0.100105 0.0111579
+-0.0264035 0.0386467 -0.0143525
+-0.053047 0.162457 0.00378602
+-0.0573985 0.155942 0.000257732
+-0.0104925 0.119661 0.037142
+-0.0107108 0.0656519 -0.03625
+0.0153129 0.0637748 -0.0295702
+-0.047649 0.128193 0.0275289
+-0.0395091 0.0986823 0.0417741
+0.0582857 0.0709436 0.0165587
+0.0144142 0.0418406 -0.0232939
+-0.0406818 0.0636695 -0.0135779
+-0.0700194 0.0408862 0.000674154
+-0.0898984 0.139201 0.0142132
+-0.0368759 0.102855 -0.0211016
+-0.031161 0.177923 -0.0048433
+-0.0216559 0.0380957 0.0145856
+-0.00121026 0.129846 0.000241032
+-0.0176504 0.0583335 0.0507279
+0.0492902 0.0704301 0.0235452
+0.008888 0.126629 0.0301427
+-0.0897638 0.136555 0.0361946
+-0.0903944 0.113745 0.0354564
+0.0327067 0.0659933 0.0401778
+-0.0167299 0.0383654 0.0243772
+0.0403616 0.0561214 -0.00579676
+-0.0891677 0.150225 0.0241083
+-0.0128992 0.165641 -0.0199242
+-0.0596113 0.0581543 0.0105384
+0.0326521 0.108705 0.0315863
+-0.0448105 0.126695 -0.00590468
+0.0440256 0.0973461 0.0131583
+-0.0694635 0.0618968 0.00696654
+-0.0667991 0.06462 0.0265045
+0.0388894 0.060327 0.0314833
+0.0120611 0.11304 -0.0178164
+-0.0635386 0.151731 -0.00361755
+-0.00656125 0.130634 0.0158888
+0.0344174 0.0430387 -0.00433126
+-0.00549778 0.129792 0.00189197
+-0.0499313 0.134148 0.000258943
+-0.0563569 0.155043 0.0148967
+-0.00737522 0.0388161 -0.00139235
+0.0283929 0.0347449 0.011384
+-0.010683 0.0908469 -0.0364652
+-0.048501 0.109818 0.0382143
+-0.0690431 0.169001 -0.0273587
+0.0102657 0.0954683 -0.0270889
+0.0126468 0.0820043 0.0535026
+-0.0507783 0.0613366 0.0327704
+0.00559724 0.128727 -0.00267638
+-0.044734 0.0724552 -0.0176324
+-0.0283736 0.0336157 -0.0231629
+-0.0679859 0.155562 0.00782161
+-0.0939853 0.126886 0.0172543
+-0.0238126 0.0840242 -0.0378907
+-0.0152029 0.16973 -0.0225848
+0.0303318 0.0382842 0.0249985
+-0.0463034 0.0382871 -0.0172845
+-0.012857 0.0968183 -0.0306036
+0.0139515 0.0933972 -0.0268828
+-0.0598089 0.0334419 -0.0052474
+-0.0682308 0.180685 -0.0584278
+-0.0564615 0.0452367 0.0437224
+0.0122525 0.036039 -0.0217262
+-0.0324956 0.119317 0.0295507
+-0.050852 0.0985174 -0.022094
+0.0359226 0.0926166 -0.0140085
+0.0475195 0.0583521 0.0315949
+0.00440154 0.12483 0.0329119
+-0.0725064 0.152612 -0.0398907
+-0.00124079 0.0388178 0.0271443
+-0.0855936 0.143251 0.00719107
+-0.0618131 0.161554 -0.0315928
+-0.0315498 0.0848744 -0.0295692
+-0.0167783 0.0770825 -0.0387039
+-0.024832 0.0930098 -0.0316179
+-0.0356976 0.121856 -0.0088333
+0.0456324 0.0875991 0.0131626
+0.0344601 0.0660136 0.0392214
+0.008313 0.0639391 -0.0318667
+0.0352496 0.0656442 -0.0147977
+-0.0468498 0.0999476 -0.0216953
+-0.0215077 0.111305 0.0395987
+-0.0345319 0.122423 0.0264163
+0.0333657 0.0835669 0.0412915
+-0.0594982 0.143919 0.0350801
+-0.0210079 0.184692 -0.0198306
+-0.09225 0.125605 0.0402535
+-0.0764966 0.117544 0.0520468
+0.0261457 0.100404 -0.0183041
+0.0314049 0.0431209 -0.00494122
+-0.000675964 0.056864 -0.0322097
+-0.0759667 0.135448 -0.00632576
+0.0194608 0.0865014 0.0497298
+0.0480114 0.0447211 0.0227621
+0.0382636 0.109749 0.0121659
+-0.0191397 0.0920316 0.0539979
+0.0148906 0.112386 -0.0170744
+-0.0156084 0.0378086 -0.0269252
+0.0166879 0.0355485 0.0409566
+-0.0719103 0.125286 -0.00863314
+0.0390766 0.0901064 0.0338413
+0.0238446 0.123573 0.0241681
+0.0180905 0.1262 -1.26099e-05
+-0.0241861 0.0351713 0.0521271
+-0.0864494 0.107673 0.0113573
+0.00554907 0.0341243 -0.0169616
+-0.0740319 0.152138 0.0351116
+-0.00773495 0.12664 -0.00628182
+-0.0408221 0.0343419 0.0301151
+0.0589083 0.0700926 0.0167877
+-0.0321537 0.168198 -0.0161712
+-0.0504087 0.0385253 -0.0116443
+-0.0719982 0.132651 0.0504199
+-0.0314938 0.0946271 0.0446065
+0.0415387 0.0610238 0.0295203
+0.0439094 0.0623682 -0.0025277
+-0.0745832 0.173457 -0.038075
+-0.0135013 0.163627 -0.011822
+0.00544999 0.097676 0.0507202
+-0.0233157 0.0695067 0.0475588
+0.0280693 0.112767 0.0337398
+0.0217645 0.057833 0.0471676
+-0.0875176 0.123015 0.0477063
+-0.0696847 0.0339658 -0.0022881
+-0.0251326 0.166747 -0.01768
+-0.0196064 0.177176 -0.0161969
+-0.0704588 0.109521 0.0380634
+-0.068398 0.171087 -0.0357069
+0.0111209 0.0908234 -0.0303895
+-0.0634854 0.149796 0.0371525
+0.00199826 0.122137 -0.0115071
+-0.0620402 0.161574 -0.0285866
+0.0543448 0.0567886 0.0274783
+0.00150309 0.0619973 0.0566118
+-0.0476286 0.0532889 -0.00972253
+0.0589424 0.064749 0.0219118
+0.00619535 0.0866083 -0.0331365
+0.00933928 0.0947261 -0.0283032
+0.0354634 0.113562 0.00993821
+-0.0622597 0.0337543 0.0119702
+-0.0286126 0.0778208 0.0441079
+-0.0291848 0.0649007 -0.0284708
+0.00716146 0.130043 0.000903466
+0.00854238 0.122369 -0.0118647
+0.0207709 0.0422154 0.0420468
+-0.0728566 0.114991 -0.00711315
+-0.062327 0.161572 -0.0265871
+-0.029645 0.121258 -0.00823608
+-0.0358448 0.0971832 -0.0228124
+-0.0241278 0.166765 -0.0179136
+-0.0833762 0.111067 0.0302504
+-0.0714085 0.0715566 0.0335759
+-0.0285052 0.11799 0.0309781
+-0.0436341 0.171062 -0.00299049
+-0.0254563 0.120601 0.0288472
+0.029856 0.0552774 -0.0168073
+-0.0277474 0.076815 -0.0357774
+-0.0305568 0.0845973 0.042796
+-0.0927119 0.117479 0.0363033
+0.00128405 0.131584 0.0158806
+-0.0853072 0.129862 0.0494994
+-0.0379579 0.11044 -0.0188969
+-0.0647113 0.0736859 -0.0158833
+-0.055064 0.0698751 0.038539
+-0.049499 0.0747526 0.0426395
+-0.0315694 0.0461612 0.0465874
+-0.0452548 0.169651 -0.00135352
+-0.0891941 0.0888738 0.0164555
+-0.0424866 0.0396651 0.043393
+-0.0870945 0.0846532 0.00548002
+-0.0530436 0.142764 -0.000526483
+-0.0664988 0.146992 0.0401715
+-0.0606301 0.0613516 -0.00265703
+-0.0321846 0.121876 0.025771
+0.0462743 0.0806463 0.0131736
+0.0355309 0.0527205 0.03199
+-0.0515418 0.0389441 -0.0114685
+0.0203586 0.0565379 -0.0271575
+-0.065976 0.0624665 0.0232686
+-0.0399438 0.0336374 -0.0217314
+-0.0584862 0.0833066 0.0438144
+-0.0449507 0.157934 0.00683281
+-0.0161733 0.168253 -0.0210405
+-0.0807961 0.0747709 0.0205502
+-0.0450711 0.153185 -0.00674331
+0.0122509 0.0766796 0.0546284
+-0.0165839 0.159908 -0.00982549
+-0.000693426 0.0367942 0.0054988
+-0.051438 0.0643214 0.0343604
+0.0173166 0.0411975 -0.0216758
+-0.0350925 0.0344983 0.0186791
+-0.0263041 0.10845 -0.0208491
+-0.0233997 0.0384863 0.0301002
+0.0336304 0.116029 0.0121428
+-0.084184 0.106292 0.0253661
+-0.0668605 0.102389 -0.0157781
+-0.0617744 0.0585089 0.0133805
+-0.037501 0.0634549 0.0414009
+0.0430852 0.0973049 0.0211625
+-0.0895621 0.0902365 0.017449
+0.0358939 0.0591552 0.0359628
+0.00041272 0.0994106 0.0497851
+0.0297429 0.112241 -0.00897067
+-0.0614607 0.155749 0.0232098
+-0.0190678 0.0347878 0.0501361
+0.0278403 0.121636 0.00711658
+-0.0293538 0.0475081 0.0471486
+-0.0878748 0.0861246 0.0134664
+-0.065267 0.132559 0.042478
+-0.0557536 0.0782586 -0.0197587
+0.0163546 0.0537375 -0.0279072
+-0.0768389 0.102007 -0.0101454
+-0.0762457 0.0708701 0.0261488
+-0.0434929 0.0410777 0.0433607
+-0.0820951 0.100566 -0.0055776
+-0.0124865 0.114128 0.0400495
+0.0495003 0.0496818 0.0274333
+0.0157351 0.0562704 0.0489701
+-0.0269138 0.0660937 -0.0314934
+-0.0205217 0.0448565 0.0528623
+-0.0147659 0.0742889 -0.0388052
+0.0292558 0.120076 0.0204837
+-0.0416192 0.0505822 -0.0110011
+0.00560187 0.0957087 -0.0293479
+-0.00449169 0.0575673 0.0538908
+0.0302324 0.0374168 2.32521e-05
+0.0404422 0.105635 0.0151656
+-0.0407521 0.0782965 -0.0192261
+-0.0321404 0.106348 -0.0206098
+0.0240312 0.1242 0.0213823
+0.0163901 0.0476981 -0.0240512
+-0.0540847 0.0341953 0.0274512
+0.0565883 0.0716209 0.0188851
+-0.063971 0.0343652 0.0164556
+0.0222263 0.0790988 -0.0263649
+-0.0480529 0.15019 -0.0042011
+-0.0364615 0.155102 -0.00949574
+-0.0107913 0.165034 -0.0192459
+-0.0720629 0.166594 -0.0198059
+0.0596228 0.0581166 0.00817617
+0.0193916 0.12656 0.0211758
+-0.029103 0.162278 -0.0149633
+-0.0114929 0.118282 0.0379089
+-0.0766495 0.0810868 -0.0106019
+-0.00184307 0.128669 -0.00252946
+-0.0100488 0.177211 -0.0257537
+-0.0544738 0.0624824 0.0299832
+-0.0840733 0.0966087 -0.0036103
+-0.0707265 0.080778 -0.0161096
+-0.0214771 0.122102 0.0291424
+-0.0428932 0.0358165 0.00869673
+0.0135568 0.129672 0.01894
+-0.00280854 0.081222 -0.0368531
+0.00517895 0.130408 0.0230466
+-0.067269 0.167119 -0.0252721
+-0.00747948 0.0919417 -0.035549
+-0.0365036 0.0478079 0.0395886
+-0.0569665 0.0548885 0.00161507
+-0.0744851 0.0663284 0.00571192
+0.0455621 0.0889987 0.00417598
+-0.0292503 0.036802 0.0530596
+-0.0435044 0.0605182 0.0400424
+-0.0915766 0.14196 0.0161629
+-0.0696706 0.14899 -0.0379959
+-0.0770107 0.152809 -0.00688788
+-0.0705529 0.0628294 0.0184736
+-0.044794 0.0870021 -0.0219374
+-0.0107414 0.120001 -0.0131465
+-0.000720709 0.0669492 -0.0343521
+-0.0214315 0.0906458 0.0534872
+-0.0354995 0.0619703 0.0405316
+-0.0628269 0.1502 -0.00476792
+-0.0640626 0.136748 0.0389546
+-0.0474986 0.102884 0.0412273
+-0.0116527 0.129557 0.00826831
+-0.0347732 0.0337732 -0.0208295
+-0.0214023 0.161048 -0.0139992
+-0.0752954 0.15636 -0.00353298
+-0.0688076 0.150274 -0.0424283
+-0.0238582 0.0382811 0.0283891
+-0.0935937 0.118737 0.0143019
+0.0184606 0.0475775 0.0422564
+0.00850874 0.0575011 0.0529664
+-0.0532082 0.149319 0.0233918
+-0.0320154 0.082069 -0.0305372
+-0.0190294 0.0739916 0.05444
+-0.00216392 0.0992947 0.0503069
+-0.0162644 0.11453 -0.017303
+0.0278981 0.113772 -0.00862034
+0.0459848 0.0602104 -0.00435135
+-0.0564936 0.0465915 0.0420515
+0.0169002 0.103075 -0.0211457
+-0.00731691 0.128182 0.0272242
+0.0205916 0.112587 0.0371117
+-0.0176105 0.0435992 -0.0276633
+-0.0274971 0.0619365 -0.0294418
+0.000272434 0.109746 -0.0202486
+0.0416377 0.084481 -0.00877138
+-0.0784224 0.0725404 0.0242536
+-0.00880164 0.0826803 -0.0379328
+-0.0147316 0.0685868 -0.0380387
+0.0333786 0.0476367 -0.00619535
+0.00348805 0.0413645 0.0460201
+-0.0227229 0.0625945 -0.0340193
+-0.0669932 0.138471 -0.00790807
+-0.037224 0.169679 -0.0130647
+0.0535575 0.0477942 0.0072134
+-0.0575878 0.158069 0.0020235
+0.0345395 0.0727588 0.0393885
+-0.0699466 0.072981 0.0361776
+0.020686 0.0367224 0.0371237
+-0.0728722 0.0355547 0.00103582
+0.00487825 0.131703 0.0129125
+0.0580945 0.0523756 0.014183
+-0.0866528 0.145956 0.0348405
+-0.00749813 0.125151 0.0317009
+0.0403042 0.0398794 0.0201445
+0.0355341 0.0875716 0.0391778
+-0.0249398 0.157384 -0.00964166
+0.00350274 0.0489558 0.0513808
+-0.00381736 0.131135 0.0125816
+-0.00837752 0.0353543 0.048476
+0.0140849 0.129676 0.00773008
+-0.010101 0.102023 -0.0240718
+0.0446756 0.091763 0.0191604
+-0.0637279 0.173384 -0.0513558
+-0.031495 0.061765 0.0382603
+0.0366571 0.0968397 -0.0108144
+-0.0285085 0.115306 0.0336868
+-0.00497421 0.126254 0.0309961
+0.00248615 0.104372 0.0430232
+0.00642086 0.116423 -0.0174422
+-0.0636795 0.0658475 -0.00727738
+-0.0891519 0.0956005 0.0104313
+-0.0860649 0.0994533 0.00140442
+-0.0735831 0.152654 -0.0328925
+0.00651157 0.066084 0.0555109
+0.0344822 0.102017 -0.0120204
+-0.0637552 0.15245 -0.00517189
+-0.077532 0.159745 -0.0169143
+0.00251128 0.0661582 0.0562906
+0.0151093 0.0887421 0.0518346
+-0.00945842 0.0387253 -0.00172767
+-0.0471724 0.133935 0.00981498
+-0.0188178 0.158773 -0.00942574
+-0.0194961 0.0654004 0.0509321
+-0.0774489 0.163906 -0.0229523
+-0.0267283 0.156621 -0.00899742
+-0.0465008 0.111213 0.0371008
+-0.00249784 0.0939038 0.0553992
+-0.0715513 0.0342218 0.00249626
+0.0107439 0.130936 0.0122066
+0.0266603 0.0421651 0.0343135
+0.011996 0.0344545 0.00276628
+-0.0653727 0.074532 0.0393295
+-0.0417745 0.172541 -0.00446528
+-0.0368752 0.0345479 0.0395694
+0.00440907 0.131695 0.0141669
+0.0189748 0.0699869 0.0502663
+-0.0690298 0.155601 0.00744971
+-0.0265663 0.0356908 0.0529027
+-0.0621593 0.13389 0.0382274
+-0.0375341 0.0356789 0.0117182
+-0.00861273 0.0434199 -0.0261503
+0.0317849 0.0490447 0.0333888
+-0.0637123 0.0445754 0.0336875
+0.0376665 0.0374378 0.0089364
+-0.058497 0.0904388 0.0452323
+-0.0442728 0.0437529 -0.0143172
+0.0204519 0.0357096 0.00704168
+0.0282191 0.0941913 -0.0197138
+-0.0688839 0.117973 -0.00851105
+0.0338372 0.104851 -0.0110391
+0.024912 0.0505255 0.0392969
+0.0125119 0.107097 0.0421465
+-0.00117532 0.0998676 -0.0237773
+0.0246952 0.0420222 0.0382704
+-0.0398433 0.0971287 -0.022179
+0.0268619 0.108823 -0.0133055
+-0.0799271 0.140795 0.0466609
+0.0180138 0.0808533 0.0524986
+-0.0868879 0.111328 0.0363925
+0.000567537 0.0921561 -0.0336854
+-0.0892038 0.0969467 0.00941895
+0.00816432 0.0904541 -0.0318561
+-0.064746 0.155508 0.00899366
+-0.0911853 0.113324 0.0173235
+-0.00120622 0.113981 -0.0187843
+-0.00924245 0.0407867 0.049553
+-0.00349897 0.0575855 0.053786
+-0.0375091 0.0407357 0.0441865
+-0.0584982 0.108398 0.0387966
+0.0391307 0.0786589 -0.0107679
+-0.0474967 0.100136 0.0424923
+0.0275962 0.102142 0.0400686
+0.0233313 0.0578274 -0.025582
+-0.0510235 0.0723937 0.0407728
+0.0280639 0.121158 0.0057742
+-0.0318235 0.0637622 -0.0194381
+-0.038893 0.0378836 0.042947
+-0.0455156 0.14919 0.00769333
+-0.0724664 0.0678961 0.0260135
+-0.0614699 0.156861 -0.0255852
+0.0511802 0.0687267 0.0256724
+-0.0639329 0.153712 -0.0368711
+-0.055548 0.0628794 0.0303893
+0.0228246 0.0344564 0.00866393
+0.0333583 0.0505553 -0.00686804
+-0.0436286 0.0534388 -0.0110764
+0.0170321 0.128388 0.0173658
+-0.0484634 0.122511 0.0297787
+-0.0908772 0.119982 0.00630567
+-0.0251882 0.121015 0.0283088
+-0.0621056 0.167818 -0.0515918
+-0.0434918 0.0451945 0.0416496
+-0.0261859 0.172679 -0.0191085
+0.0581533 0.0685799 0.00535861
+-0.0308235 0.12443 -0.00028071
+-0.088653 0.0982606 0.00741366
+0.000114549 0.110154 -0.0201623
+0.032895 0.11463 -0.00105927
+0.0393368 0.0984458 -0.00682083
+0.0171551 0.0988258 -0.0226279
+0.0605804 0.0651016 0.017176
+-0.0528261 0.149337 0.0214103
+-0.0213292 0.159914 -0.0125433
+0.000685965 0.124734 0.0330095
+0.0425127 0.0872289 0.028142
+-0.0754377 0.172239 -0.0469918
+-0.00949675 0.039136 0.0341772
+-0.0750736 0.0773173 0.0349007
+-0.0204972 0.104391 0.0429524
+0.044682 0.0804275 0.0241291
+0.0288766 0.0477511 0.0362254
+-0.0590849 0.0584397 0.0175987
+-0.0187468 0.0685918 -0.0381091
+-0.0908268 0.137853 0.0181986
+-0.0934137 0.128236 0.0152484
+-0.0722094 0.155629 0.00630789
+-0.0701241 0.109501 0.0382316
+-0.0833629 0.0829469 -0.00357326
+-0.0219158 0.177176 -0.0142605
+-0.0038834 0.0389548 -0.00453366
+-0.0468309 0.0956366 -0.0220125
+0.0589161 0.0621713 0.00415053
+-0.0518659 0.144686 0.0163701
+-0.0589723 0.0448133 0.0132235
+0.05973 0.0664208 0.00812497
+-0.0911185 0.128332 0.0402364
+0.0082766 0.0667723 -0.0317926
+-0.0557755 0.0826404 -0.0214196
+-0.0254275 0.181837 -0.00892324
+-0.0899879 0.140645 0.0281829
+-0.0725199 0.141421 0.0466976
+0.0173961 0.0343459 0.000212982
+-0.0435004 0.0424369 0.0431009
+-0.0397849 0.155107 0.00553982
+0.0474231 0.0702463 0.00356979
+0.00935197 0.130836 0.00599246
+-0.0466333 0.0562665 -0.0109539
+-0.0134154 0.0393527 0.0385623
+0.0202221 0.0721388 -0.0279345
+-0.0855696 0.139064 0.00222203
+-0.0690425 0.0382325 0.0107396
+-0.0147406 0.129011 0.0158201
+-0.0436768 0.0636379 -0.0137577
+0.058107 0.0694858 0.00643586
+-0.0523916 0.160438 -0.00307609
+-0.0208502 0.120881 -0.00994613
+-0.0144972 0.0772805 0.0565653
+0.0146633 0.0548535 0.0491553
+-0.0872189 0.103599 0.00739967
+-0.013497 0.0701643 0.0543951
+-0.0727808 0.161025 -0.0379399
+0.0541744 0.0495318 0.0218692
+-0.0180637 0.122407 0.0308158
+-0.0437406 0.150663 0.00676805
+-0.0471693 0.128157 0.0265222
+0.000324051 0.0583269 -0.0327186
+0.0183373 0.109817 -0.016338
+-0.0826495 0.137607 -0.000712655
+0.0256839 0.122773 0.00490001
+0.0354824 0.111268 -0.000157004
+-0.0457208 0.0643263 0.038969
+0.0547017 0.0700348 0.00381661
+-0.00761606 0.128811 0.0256727
+-0.0687402 0.156349 0.0177202
+-0.085121 0.108927 0.00536277
+-0.0739548 0.136937 -0.00691386
+-0.00649589 0.0884166 0.05709
+-0.068322 0.144999 -0.0199128
+-0.0891584 0.142048 0.0331685
+-0.0282821 0.0889315 -0.0326167
+-0.0270715 0.0381475 0.00619785
+0.0226739 0.0430625 -0.011732
+-0.0895091 0.147137 0.0278175
+-0.0396286 0.0534411 -0.011004
+-0.0570587 0.0521462 0.00466373
+-0.0421407 0.162162 -0.0108328
+-0.0831356 0.0816494 -0.00150376
+-0.0274399 0.180304 -0.00715734
+-0.055838 0.0927189 -0.0219026
+-0.0624754 0.163097 -0.0475912
+-0.064973 0.0365283 0.0405192
+-0.0434783 0.0690982 0.041489
+0.0407433 0.102836 0.021176
+-0.0588838 0.0468495 0.0306747
+0.00493781 0.100395 -0.0223096
+0.00122691 0.116615 -0.0176232
+-0.035551 0.0451135 -0.0264751
+-0.025842 0.091626 -0.0326108
+0.0509675 0.0463703 0.0218015
+-0.077144 0.164539 -0.0230622
+-0.0613807 0.122656 0.0428396
+0.0364941 0.0454217 0.0304675
+-0.0655017 0.0931357 0.0435076
+-0.0869021 0.114398 0.00327085
+-0.0624965 0.109755 0.0377659
+-0.0219613 0.124807 -0.00195706
+-0.0564977 0.109762 0.0379025
+-0.0489044 0.0413839 -0.0112514
+-0.0464999 0.104301 0.0412272
+-0.0689362 0.173831 -0.0430963
+-0.0274521 0.175685 -0.00821886
+-0.00850113 0.0633575 0.0560799
+-0.0350673 0.0752529 -0.020583
+-0.0702674 0.128451 0.0511564
+-0.0318141 0.156607 0.00124178
+0.0187844 0.127527 0.00803838
+-0.0133229 0.0978873 -0.0277326
+0.00349851 0.0356817 -6.66678e-05
+-0.0714787 0.0630924 0.012741
+-0.0723877 0.16801 -0.0460141
+-0.0314985 0.12639 0.0112101
+0.0103131 0.0935662 -0.0290602
+0.0162881 0.0708862 -0.0299631
+-0.0486922 0.0693814 -0.0146213
+-0.00965082 0.0496857 -0.0310806
+-0.0472721 0.035073 0.043832
+-0.0505797 0.0528906 0.0145102
+-0.00843296 0.037899 -0.0156923
+-0.0276376 0.0383723 -0.00322479
+-0.0394609 0.174124 -0.00699657
+-0.0444987 0.125316 -0.00848377
+0.0413134 0.0732089 -0.00778125
+-0.0654437 0.17819 -0.0606312
+-0.0194942 0.0498847 0.046612
+-0.0470957 0.0376632 0.0453493
+-0.0435029 0.0832144 0.0426759
+-0.0134871 0.123689 0.0319378
+-0.0174978 0.0744121 0.0553624
+0.0333782 0.11597 0.0192002
+-0.0203318 0.0946383 0.0508766
+-0.0412055 0.0419705 -0.0232873
+-0.0815038 0.0885533 0.0328994
+-0.0703591 0.0620888 0.0120183
+-0.0334658 0.0396217 0.0500837
+-0.036771 0.0343273 0.0309808
+-0.0165061 0.126041 -0.00139683
+0.0369819 0.102039 0.0307859
+-0.0207502 0.0626823 -0.0352205
+0.0061481 0.104478 -0.0212191
+0.0323926 0.117262 0.0173907
+-0.0357746 0.08137 -0.0222094
+-0.0375579 0.0341991 0.0273875
+-0.0503289 0.0543622 0.0156654
+-0.0287388 0.076371 0.0428795
+-0.0631791 0.0597373 0.0065938
+-0.00649181 0.104468 0.0439265
+0.00653601 0.0924318 -0.0319265
+-0.0371937 0.168177 -0.0134205
+-0.0375614 0.128197 0.00751871
+-0.0898903 0.135179 0.0352087
+0.037196 0.0699864 0.036159
+0.0276189 0.0564968 -0.0197599
+0.0447325 0.0931835 0.0161662
+0.0398803 0.0927067 0.0314285
+-0.0468272 0.125328 0.0268353
+-0.0715318 0.0347543 -0.000134182
+-0.0859938 0.0978404 0.0272064
+-0.0460065 0.0410789 -0.0142843
+-0.0499829 0.0586014 0.0334591
+-0.0614235 0.172219 -0.0618413
+0.00350193 0.0474397 0.0500395
+0.0226438 0.0875613 0.0487078
+0.0374992 0.0644481 -0.0117672
+-0.00648083 0.111994 -0.0206545
+-0.0934649 0.120072 0.0123034
+0.00542168 0.12935 -0.00135496
+-0.0765071 0.126009 0.0528667
+-0.0308338 0.109919 -0.0183719
+0.018594 0.125548 0.0250901
+-0.0205082 0.0474421 0.0508554
+-0.0252811 0.168282 -0.0104061
+-0.051716 0.150726 0.0145842
+-0.0317716 0.0863018 -0.027557
+-0.0793223 0.151473 0.000118749
+-0.0823192 0.154091 0.0115231
+0.0432611 0.071972 -0.00279979
+-0.0761461 0.154973 -0.00265921
+-0.032878 0.156591 -0.0107994
+0.0360211 0.0628935 -0.0127986
+-0.0321679 0.120788 0.027294
+-0.00521106 0.038426 0.0176436
+0.0377365 0.0388851 0.0205214
+0.0183131 0.127887 0.0164149
+-0.0580398 0.0608775 0.0245548
+-0.0791963 0.108632 0.0349508
+-0.00201716 0.131125 0.0175388
+0.0407504 0.0633497 -0.00473671
+0.0447287 0.0917385 0.00119217
+-0.0534928 0.0848236 0.0453456
+0.00605741 0.0346665 0.039556
+-0.0276244 0.0436594 -0.0289391
+-0.00868086 0.056987 -0.0336771
+-0.058573 0.0613666 -0.00334192
+0.00741372 0.0360842 -0.0231635
+0.00514996 0.0337963 0.0112147
+-0.064123 0.113942 -0.0123233
+0.0527625 0.0723674 0.0204268
+-0.0354974 0.0634085 0.0409173
+0.0287147 0.0352518 0.00538775
+-0.0522813 0.0461425 0.0206748
+0.0547864 0.0548406 0.00018303
+0.00557978 0.101599 0.0456072
+0.00472897 0.0950887 -0.030676
+0.0355131 0.0781566 0.0390786
+0.0402454 0.0843611 -0.0117637
+-0.0605819 0.0468615 0.000669297
+-0.0394923 0.074754 0.042367
+-0.0331798 0.0779303 -0.0275261
+-0.0683095 0.178205 -0.0587107
+-0.00995429 0.0389301 0.0324647
+-0.0495001 0.108413 0.0388185
+-0.0659124 0.113781 -0.0114133
+-0.0404538 0.105662 0.0393313
+-0.0654729 0.17978 -0.0563035
+-0.0614888 0.0918402 0.045217
+0.0333657 0.0640658 -0.0168115
+-0.0809488 0.144539 -0.000825536
+-0.0545043 0.0918174 0.0448821
+-0.0504943 0.147794 0.0128405
+-0.0745085 0.118967 0.0529255
+-0.0596424 0.0629313 -0.00554826
+0.0600133 0.0636587 0.00714888
+0.0272456 0.0746657 -0.023693
+0.0433693 0.0575272 -0.00543691
+-0.0084928 0.0591086 0.0550857
+0.0327041 0.0686805 0.0402125
+-0.0371896 0.166685 -0.0135589
+0.0115191 0.107071 0.0419973
+0.0398757 0.096658 0.0297176
+-0.0882102 0.118977 0.047099
+-0.0794917 0.134473 0.0511764
+-0.0147562 0.0388704 -0.0103641
+-0.0729608 0.135493 -0.0074448
+-0.0829718 0.144576 0.00217748
+0.0121355 0.107265 -0.0192728
+0.00249537 0.0427747 0.0458993
+-0.0590743 0.136941 -0.00615344
+-0.0740187 0.0822617 -0.01463
+0.0274881 0.0349726 0.0165028
+0.0249311 0.118938 0.0303034
+-0.0860712 0.137702 0.0022107
+-0.00546373 0.0337972 -0.022595
+-0.0425018 0.0506116 0.0394181
+0.0044907 0.119648 0.0370088
+-0.066886 0.129814 0.0472408
+-0.033949 0.0667384 -0.0165589
+0.0265464 0.0699406 0.043619
+-0.0486667 0.134012 0.00340208
+0.0201914 0.117982 0.0346477
+-0.033458 0.0353739 -0.0310204
+-0.0251991 0.0536651 0.0400375
+-0.0689113 0.147966 -0.0319204
+-0.0650665 0.151369 -0.0356223
+-0.065894 0.118002 -0.00906639
+-0.00150449 0.0350731 0.0394353
+0.00648653 0.0951017 0.0524749
+0.0322641 0.11194 -0.00663069
+0.0356067 0.113152 0.00567562
+-0.0317604 0.120314 -0.00921321
+-0.0666072 0.0846933 0.0437683
+-0.0745085 0.13306 0.0516401
+-0.0914301 0.133749 0.0202171
+-0.0271327 0.0917299 -0.030613
+0.0356733 0.107346 0.028881
+0.021724 0.104691 0.0421173
+-0.0214953 0.0474568 0.0509792
+0.0189666 0.119003 -0.0102495
+0.0330783 0.0534528 0.0353209
+-0.0796959 0.154266 0.00805358
+-0.0370933 0.175555 -0.00565624
+-0.0324183 0.116998 -0.0137964
+-0.015069 0.117815 -0.0147928
+-0.0541455 0.0482522 0.0392578
+-0.017538 0.18639 -0.0186026
+-0.0486882 0.138613 0.0123943
+-0.0134995 0.0786948 0.0569449
+-0.0792474 0.0803083 0.033239
+-0.0523607 0.12647 -0.00557636
+-0.0261456 0.180134 -0.00803266
+-0.0654933 0.0875673 0.0446215
+0.0410795 0.0647663 -0.00478377
+0.038759 0.104954 -0.0010414
+0.0213206 0.103387 0.0432887
+0.00249002 0.112797 0.0416669
+-0.02662 0.157614 -0.0107103
+-0.0524373 0.0487028 0.0136696
+0.0367672 0.0605146 0.0354804
+-0.0769184 0.0832691 0.0369336
+-0.0650248 0.0337055 0.00787315
+-0.0515046 0.159378 0.00834015
+-0.0547588 0.079768 -0.0207581
+-0.0799475 0.0796892 0.0318714
+-0.0819371 0.129486 -0.00455242
+0.0162371 0.0359566 0.0423025
+-0.052497 0.108432 0.038849
+-0.0330169 0.0750953 -0.0275046
+-0.0367909 0.0856326 -0.0224706
+-0.0909792 0.143017 0.0266346
+-0.0790213 0.169435 -0.0369802
+-0.0224887 0.120777 0.0306794
+-0.0714154 0.063966 0.00470687
+-0.0833338 0.121705 0.0492392
+-0.00224884 0.0410819 0.0473849
+-0.0064961 0.0647536 0.0562043
+-0.0154675 0.0382885 0.0102401
+0.0316901 0.0754766 0.0423249
+-0.0682663 0.0409329 0.00988698
+-0.0397472 0.0753921 -0.0181662
+-0.0404974 0.0534278 0.0394751
+-0.027235 0.0964545 -0.0242996
+0.01346 0.094917 0.0501359
+-0.0101655 0.178729 -0.0267529
+-0.0368558 0.0971787 -0.022608
+-0.0618627 0.061311 0.023361
+-0.00785703 0.0384956 0.0242725
+-0.00828946 0.0422134 0.0491908
+-0.0626761 0.177191 -0.057627
+-0.0197826 0.0770974 -0.0390157
+-0.0283747 0.0368322 -0.0186629
+-0.0678325 0.165206 -0.0549947
+-0.0762767 0.179149 -0.050884
+-0.0126939 0.0585083 -0.0350263
+0.0259904 0.108758 0.0377477
+0.042201 0.0819186 0.0294354
+0.0164623 0.11028 -0.0168584
+-0.000216315 0.0411702 0.046762
+-0.0166283 0.0393036 -0.0275139
+-0.0660426 0.171124 -0.0420386
+0.0456785 0.0862046 0.0141695
+0.00138117 0.044939 -0.0263139
+0.0461205 0.0704224 0.0223322
+-0.0776245 0.0703136 0.0210685
+-0.0756983 0.148597 -0.0138657
+-0.00849865 0.0773628 0.0576515
+-0.0145231 0.0446315 0.0506096
+-0.0683418 0.0625091 0.0209713
+0.0172542 0.0764235 -0.0285503
+0.00803706 0.0343648 -0.0148062
+0.02126 0.0748992 -0.0268979
+-0.0630463 0.113863 0.0385547
+-0.0145507 0.0980154 0.0489953
+-0.0546077 0.131128 0.0350935
+-0.012492 0.061843 0.0546212
+-0.028497 0.0550003 -0.0233987
+0.0217846 0.11532 -0.0122874
+-0.0931885 0.121553 0.0392843
+-0.0522878 0.055669 0.0133058
+-0.0592645 0.138135 0.0336221
+-0.0895773 0.139272 0.0261794
+-0.0653179 0.156011 -0.0499494
+0.0382996 0.103126 -0.00513692
+-0.00322923 0.0355467 -0.0162422
+0.0141613 0.0988714 -0.0229756
+-0.0404979 0.0776396 0.043177
+-0.000517251 0.0386237 0.0468325
+-0.0745039 0.117561 0.0526615
+-0.0404908 0.101464 0.0408992
+0.00150976 0.0562224 0.0541662
+-0.0302058 0.0649962 -0.0264588
+-0.0427465 0.0393017 -0.0242897
+-0.0680504 0.12005 0.0525411
+0.0105239 0.101777 0.0472989
+-0.051788 0.0855011 -0.0215694
+0.0121427 0.124109 -0.00776299
+-0.0714952 0.123214 0.0534125
+-0.0377025 0.0444987 -0.0253388
+-0.0285008 0.0573948 0.0366096
+-0.0557355 0.0753549 -0.0185519
+-0.0136024 0.0377623 -0.0264268
+-0.055443 0.13396 0.033868
+-0.0329956 0.122915 -0.00595413
+-0.0659107 0.120913 -0.00886784
+-0.00952503 0.0920885 -0.0357277
+-0.0437604 0.036567 -0.0252782
+-0.020729 0.181491 -0.0220031
+0.00793492 0.130935 0.0197362
+-0.00287417 0.10736 -0.0221559
+-0.0531678 0.0503031 -0.00638771
+-0.0649059 0.116607 -0.0100071
+0.0311853 0.0491232 0.0343139
+-0.0464498 0.034849 -0.0185661
+-0.0448976 0.168579 0.00154181
+0.0324248 0.0752705 -0.0187807
+0.00488488 0.0387234 -0.0100497
+-0.0607447 0.0752603 -0.0176616
+-0.0575406 0.0387439 -0.00960491
+-0.0874426 0.110454 0.0173412
+-0.0517698 0.0516016 0.0312301
+-0.0727656 0.156832 -0.0339136
+0.0123073 0.0638424 -0.0304488
+-0.00866157 0.0541436 -0.0334268
+0.00183737 0.0373069 0.04638
+-0.0298138 0.0344903 0.0411187
+-0.0674167 0.149888 -0.0375972
+-0.0770317 0.088754 0.0382806
+-0.0857815 0.0897033 0.0272482
+-0.0125983 0.037741 -0.0261872
+0.0182378 0.0893522 -0.0266421
+-0.0766704 0.154203 -0.00290271
+-0.0684648 0.0617211 0.0180797
+0.0505111 0.0637895 0.0291551
+-0.0497918 0.143216 0.0113941
+-0.0616227 0.156855 -0.0295846
+0.0290304 0.0968725 0.0421292
+-0.0756542 0.0679921 0.00394259
+-0.0526765 0.0514226 0.0124143
+-0.0625972 0.0348156 0.0215996
+-0.0544966 0.0791235 0.0440855
+-0.0544133 0.159808 0.00694146
+2.76528e-05 0.0391548 -0.0114154
+-0.00549746 0.0503818 0.0516227
+-0.0646199 0.0359342 0.0410351
+0.0410489 0.0445052 0.0289111
+-0.0356376 0.0548341 -0.0105043
+0.0272051 0.0465425 -0.0127095
+-0.0513967 0.161204 -0.00381805
+-0.0424671 0.124776 0.022048
+-0.0300883 0.0335187 -0.027157
+-0.0362553 0.0336801 0.0101688
+0.0513156 0.0588831 -0.00408417
+0.0399488 0.0688733 -0.0097971
+-0.0617146 0.155302 -0.0255819
+-0.0112103 0.129394 0.0199977
+-0.0552256 0.153277 0.0254807
+-0.0697772 0.0409122 0.00855159
+-0.0257631 0.0755055 -0.0369491
+-0.0601959 0.0422699 -0.00706205
+-0.0475933 0.134581 0.0184866
+0.0267481 0.0659374 0.0438828
+-0.0790343 0.0886679 0.0360671
+0.0606094 0.0637127 0.00915317
+-0.0823359 0.140394 0.000222625
+-0.0792589 0.1445 -0.00280742
+0.0288607 0.118772 0.0260462
+-0.000258207 0.0388058 4.93079e-05
+0.0142249 0.0779815 -0.0305449
+0.0279207 0.111816 -0.0105079
+-0.0649061 0.108122 -0.0141961
+0.0372666 0.0547889 -0.00619261
+-0.0258342 0.159627 -0.000620301
+-0.0761165 0.0874143 0.0388159
+0.0425599 0.101502 0.0121632
+0.0533305 0.0723883 0.0073663
+-0.0814882 0.139397 0.0468344
+-0.0119496 0.127575 -0.00116297
+0.0308488 0.116432 0.0267923
+-0.0342458 0.127284 0.0102001
+0.0488271 0.0733963 0.0130056
+-0.017912 0.059765 0.0509406
+0.0133103 0.0753629 0.0544488
+-0.0896061 0.126751 0.00429509
+0.034401 0.0461473 -0.00601616
+-0.0485411 0.166778 0.000587101
+0.0342862 0.0782566 -0.0167489
+-0.00549615 0.0925657 0.0562617
+-0.0700277 0.153659 -0.0489787
+0.00562336 0.034628 0.021452
+-0.0825014 0.0978733 -0.00561152
+-0.0665019 0.0818141 0.0428543
+-0.0628077 0.166262 -0.0415912
+0.0329576 0.0753133 -0.0177979
+0.0159612 0.0887478 0.0513106
+-0.0348521 0.0972102 -0.0229902
+0.00689753 0.13043 0.00224143
+0.0163113 0.0637479 -0.0291811
+-0.0681449 0.144372 -0.0168262
+-0.0709402 0.170831 -0.0510269
+-0.0618586 0.161576 -0.034591
+-0.05709 0.0562779 0.00261705
+-0.0511762 0.163872 0.00329038
+-0.0295002 0.0688631 0.0391758
+-0.0548706 0.0634738 0.0317723
+0.00519565 0.0838361 -0.0338494
+0.0412244 0.0703917 -0.00779979
+-0.0485608 0.164 0.00493162
+0.0405319 0.0913292 0.030651
+-0.0364055 0.0394201 0.0459276
+-0.0885895 0.126718 0.00227148
+-0.00135158 0.0925397 -0.0341169
+-0.0155034 0.0472755 0.0490261
+-0.0533709 0.0334238 -0.0075905
+-0.0135602 0.174221 -0.0197865
+0.0151695 0.0534137 0.0481113
+0.00249824 0.119676 0.0375233
+-0.0574904 0.0847348 0.0442092
+-0.0706266 0.111419 0.0453421
+-0.0498404 0.122243 -0.0112035
+-0.0580787 0.133988 -0.00600022
+-0.0856455 0.0845341 0.000486997
+-0.0677324 0.0847093 0.0432514
+-0.0516192 0.112658 -0.0171697
+-0.0294883 0.101537 0.0426799
+-0.0562967 0.0548357 0.00668262
+-0.0870689 0.0968011 0.00243877
+-0.0809104 0.126584 -0.00546143
+0.0226682 0.115322 0.0347114
+-0.0702279 0.156078 0.0244771
+0.00613975 0.0976727 -0.0254362
+-0.0654107 0.0782591 0.0414837
+0.0154936 0.104462 0.0445958
+-0.0557216 0.125528 0.0387388
+-0.0708946 0.1037 -0.0131771
+0.0207514 0.10232 -0.0203322
+0.040798 0.105646 0.00916422
+-0.0789759 0.136856 -0.00458832
+0.00163159 0.126824 0.0304308
+0.0217692 0.0444645 -0.0177596
+0.00149843 0.0965502 0.0531993
+0.00416774 0.034456 0.0194982
+-0.022279 0.185099 -0.0171819
+-0.0144819 0.0759021 0.0565083
+-0.062395 0.163038 -0.0545883
+0.0386856 0.0757975 -0.0108084
+0.0230618 0.0389706 0.0372995
+-0.0661823 0.154393 0.00121795
+-0.0751879 0.179229 -0.0530087
+-0.000499764 0.0590718 0.0548831
+-0.0616117 0.16 -0.0305904
+-0.0254372 0.0796492 0.0521904
+-0.087722 0.128407 0.0462822
+-0.0361331 0.122312 0.027301
+-0.0259579 0.0383264 -0.00469023
+-0.0615278 0.0399873 -0.00779984
+-0.0911978 0.147452 0.0151543
+-0.0776353 0.15693 -0.0189052
+-0.048662 0.0345502 0.0387985
+0.00500615 0.0390969 0.0281732
+-0.0664605 0.152204 -0.0437352
+-0.0514963 0.157854 0.00954267
+-0.0893902 0.139278 0.0291842
+-0.092072 0.128303 0.0302461
+-0.0166194 0.0421642 -0.027592
+-0.0880283 0.128084 0.00127828
+-0.06275 0.178179 -0.0598124
+-0.0242491 0.0796961 0.0538111
+-0.0575802 0.14965 0.0326026
+-0.0598499 0.0364094 -0.00954648
+0.0260337 0.0639191 -0.0225668
+-0.0215138 0.185205 -0.0184453
+0.00733204 0.0567933 -0.0307054
+-0.0394107 0.125604 0.021627
+-0.0805747 0.154604 0.0238516
+0.0319556 0.0942571 0.0410831
+-0.0503335 0.0345244 0.0401985
+-0.0521615 0.159088 -0.00368491
+-0.0816591 0.0828436 -0.00556986
+0.0120628 0.0346214 0.0245844
+0.00946799 0.112678 0.0395888
+-0.00501719 0.0348021 0.0425449
+-0.080434 0.0763484 0.0258387
+0.0419394 0.0802864 -0.00678235
+-0.0270715 0.179993 -0.0160072
+-0.00929516 0.17029 -0.0258484
+0.028889 0.0549767 0.0398373
+-0.0324184 0.123701 0.0227019
+-0.00768132 0.0976452 -0.0294292
+-0.0534956 0.0478266 0.0400304
+-0.0637998 0.0852745 -0.0191701
+0.0175395 0.0364962 0.0420884
+0.0289699 0.100814 0.0402993
+-0.0384924 0.0478181 0.0398313
+-0.00649796 0.0457161 0.0472731
+0.00861625 0.13122 0.00857267
+-0.0424707 0.0634258 0.0409808
+-0.0147714 0.163994 -0.0109737
+0.0514504 0.0735674 0.0125302
+0.0157166 0.0461353 0.0435597
+-0.0886232 0.152074 0.0182297
+-0.0732612 0.155462 -0.02991
+0.0560042 0.0728404 0.0157211
+-0.0465551 0.0447198 -0.0107805
+-0.020486 0.18455 -0.0138786
+0.00948927 0.0976692 0.0490505
+0.0112322 0.0342419 -0.000927635
+0.0153695 0.0617406 0.0502582
+-0.0137598 0.0382596 0.0196658
+0.0302365 0.0828976 -0.0200496
+-0.00484087 0.0994589 -0.0252596
+-0.0335771 0.177292 -0.00581839
+-0.0706171 0.160991 -0.0459386
+-0.0381352 0.155099 0.00439417
+0.0262713 0.112733 0.0346521
+-0.0288992 0.0377652 0.0242203
+-0.0741081 0.174769 -0.0407073
+0.0312687 0.106096 -0.0123707
+-0.0467828 0.168244 0.000200438
+-0.0544952 0.0440117 0.0450302
+0.00623037 0.129867 0.000104943
+-0.043169 0.163647 -0.0101027
+-0.0034944 0.103046 0.0439357
+-0.0265042 0.106069 -0.02235
+-0.0577843 0.0811473 -0.0206854
+-0.0358177 0.0886369 -0.024178
+-0.0726405 0.148337 -0.0310398
+-0.0454975 0.111194 0.0370842
+-0.0671848 0.0335335 0.00220964
+-0.0117936 0.0667192 0.0544625
+-0.0609674 0.125285 -0.00834926
+-0.080841 0.0760714 -0.00147772
+-0.0522091 0.118697 -0.0134778
+-0.074349 0.162439 -0.0349528
+-0.0740415 0.112641 0.0489542
+-0.0294567 0.0847909 0.044594
+-0.0204364 0.038385 0.0254029
+-0.0497015 0.070866 -0.0150622
+-0.0525829 0.113848 -0.0164008
+-0.0415348 0.163761 0.00444738
+-0.0644934 0.106993 0.039043
+0.0437981 0.0734503 -0.00176783
+-0.0284962 0.0946634 0.0451029
+0.0309795 0.0506032 0.0357766
+-0.0395331 0.128532 0.0067941
+-0.0424235 0.12018 -0.013117
+-0.0197167 0.103079 -0.0233045
+-0.0430994 0.12944 0.0113807
+-0.0913339 0.117411 0.0283055
+0.026348 0.0463448 0.037827
+-0.0406738 0.0606904 -0.0121867
+-0.071511 0.0930107 0.0417462
+-0.0866623 0.0964635 0.0264805
+0.00386952 0.131337 0.0182591
+0.0282305 0.08443 -0.0217055
+0.0128412 0.0347905 0.0282102
+0.00434097 0.053874 -0.0300717
+-0.0754795 0.0704499 0.0266608
+-0.0699695 0.135529 -0.00821968
+-0.0305143 0.0348089 0.0211376
+0.00750189 0.118272 0.0376599
+-0.0504996 0.108397 0.0385655
+-0.0779682 0.135412 -0.00525448
+-0.0273965 0.0380183 0.0261038
+-0.0520915 0.129726 0.0334448
+-0.0221568 0.157426 -0.00647102
+-0.0562219 0.0560519 -0.00142054
+-0.0817829 0.110167 0.0313299
+-0.0502435 0.0335698 -0.00160666
+0.0331444 0.0584441 -0.0147212
+-0.00651273 0.0760152 0.058184
+-0.0285619 0.108073 -0.0204718
+-0.0157027 0.123907 0.0301351
+-0.0175006 0.10024 0.0438179
+-0.0297515 0.154263 -0.00514597
+-0.0475033 0.113884 0.0346438
+-0.0154952 0.087016 0.0568367
+0.0435889 0.0706095 -0.000776861
+-0.0930208 0.116049 0.0173125
+-0.0783399 0.174997 -0.0480125
+-0.0650728 0.117149 0.0481049
+0.0600369 0.0650499 0.00814341
+-0.0678832 0.147765 -0.0303891
+-0.0802136 0.0813857 -0.00655277
+-0.0356852 0.127701 0.00820492
+0.0154871 0.0990335 0.0473819
+-0.019377 0.127678 0.00978651
+-0.0208657 0.123339 0.0268408
+-0.0553906 0.073233 0.0409139
+0.0560337 0.0553031 0.0245952
+-0.0306612 0.0816984 0.0420491
+0.04335 0.0902653 0.0251673
+-0.0137008 0.0599733 -0.0359611
+-0.0535493 0.045819 -0.00734382
+0.0152704 0.07093 -0.0305648
+-0.0706849 0.0819434 0.0406373
+0.0104915 0.114065 0.0387753
+-0.052073 0.150157 -0.00315276
+0.00150908 0.0458287 0.0477014
+-0.00149907 0.122451 0.0357652
+0.0346578 0.114254 0.0196698
+-0.0263079 0.125672 0.00579971
+-0.0662371 0.173912 -0.0594768
+-0.0111949 0.178453 -0.0296295
+-0.039457 0.0403768 -0.0273046
+-0.0321606 0.153429 -0.00535973
+0.0505072 0.0678423 0.0265215
+0.0377143 0.106919 0.0261871
+-0.0717609 0.172825 -0.0369735
+-0.034656 0.0592094 -0.011649
+-0.0237103 0.0348634 0.0507821
+-0.0409865 0.0355803 0.00929737
+0.0240747 0.0915746 0.0472686
+-0.0576816 0.0336048 -0.0104516
+0.034582 0.0563647 0.0357928
+-0.0304985 0.0631621 0.0381216
+-0.0145978 0.0392398 -0.0269855
+-0.0446029 0.130656 0.0108143
+0.0240159 0.124704 0.0156714
+0.00222038 0.0796794 -0.0348837
+-0.029229 0.179986 -0.0130226
+-0.0371614 0.0338798 0.00980443
+-0.0654857 0.101487 0.0416824
+-0.0386286 0.0534191 -0.0107521
+-0.0743388 0.0659419 0.0131754
+-0.0775178 0.172972 -0.0399134
+-0.0704983 0.0999903 0.0403231
+-0.0754673 0.153642 0.0315487
+-0.0567915 0.158113 0.00751453
+-0.0733158 0.165215 -0.0409863
+-0.0878452 0.096803 0.00445868
+0.02849 0.120167 0.00308975
+-0.0866911 0.107697 0.0133542
+-0.0422556 0.127428 -0.00269381
+-0.0684868 0.135467 0.0467048
+-0.0187173 0.108826 -0.0212527
+-0.0109134 0.038586 0.0018115
+-0.0689089 0.106601 -0.012938
+0.00232768 0.0597693 -0.0328325
+-0.0759088 0.150426 0.0375079
+-0.0642836 0.175364 -0.0612207
+-0.0626162 0.142488 0.0376248
+-0.0388973 0.150052 -0.00339157
+0.0187974 0.0398349 -0.0187285
+0.0404333 0.0725805 0.0320798
+-0.0863763 0.0991625 0.0261078
+0.0544186 0.0725633 0.0195702
+-0.076294 0.155585 0.0106948
+-0.0611522 0.045903 0.0393286
+-0.0167746 0.0756989 -0.0389455
+-0.0578115 0.0619893 0.0271205
+-0.0127071 0.179586 -0.0289228
+-0.0568431 0.0926948 -0.0216401
+-0.0900812 0.150215 0.0221142
+0.0222403 0.0416489 -0.00972259
+-0.0504069 0.135839 0.0247969
+-0.0304966 0.0545819 0.0366047
+-0.0103146 0.180354 -0.0288775
+0.0320122 0.117952 0.0129635
+0.0440424 0.0496996 0.0318585
+0.0393181 0.0603877 -0.00577734
+-0.071953 0.16101 -0.0409434
+-0.0437665 0.168716 0.00196199
+-0.0498819 0.105595 -0.0195612
+0.0217639 0.0458254 -0.0188683
+-0.0921421 0.116123 0.0383102
+-0.0636791 0.157483 -0.0138656
+0.0266706 0.04428 -0.00700704
+0.0433132 0.0818321 0.0274518
+-0.0580456 0.0494852 0.00468232
+-0.0735836 0.159386 -0.00731186
+-0.0544231 0.0344532 0.039385
+-0.00150237 0.089761 0.0564112
+0.015933 0.126357 0.0269718
+-0.0425015 0.0719333 0.0422422
+-0.0589488 0.147198 -0.00200697
+-0.087209 0.0941073 0.00444199
+-0.0120214 0.178126 -0.0292101
+-0.0835465 0.101952 0.0288636
+0.041496 0.0555737 0.0320634
+-0.0025007 0.0675576 0.0566246
+-0.0756877 0.15767 -0.00739081
+-0.0105023 0.0829243 0.0578427
+-0.00627368 0.128136 0.0276028
+-0.0404708 0.109814 0.0374017
+-0.00378356 0.130498 0.0212315
+0.0580765 0.0566038 0.0222343
+-0.0853725 0.111782 0.0273822
+0.0428559 0.0972978 0.0221679
+0.00122739 0.121444 0.0362285
+-0.0274798 0.0446461 0.0507675
+-0.0304832 0.12104 0.0263992
+-0.0371379 0.127502 0.0150528
+-0.0778671 0.177131 -0.0494084
+-0.0775564 0.166657 -0.0379504
+-0.0605167 0.0386224 -0.00865968
+-0.0171147 0.161213 -0.00734926
+-0.0726687 0.161352 -0.00991102
+0.032766 0.0700345 0.0403232
+-0.0458559 0.10138 -0.0215412
+0.017353 0.0374009 0.0430484
+0.000357196 0.0347559 0.0401008
+-0.0604421 0.0427792 0.0246961
+-0.0440271 0.128143 0.0184429
+0.0423724 0.056151 -0.00596664
+0.00534844 0.0596161 -0.0309806
+0.0320447 0.061134 -0.0177676
+-0.00279591 0.0988433 -0.0266823
+0.0289846 0.0664902 -0.0199255
+0.000300027 0.0360761 0.019065
+-0.0250833 0.0379957 0.0175874
+0.0345167 0.0754586 -0.0157294
+0.0153241 0.0623295 -0.0291944
+-0.0609083 0.0612023 0.0236586
+-0.0698972 0.0655268 -0.00153079
+0.00337067 0.115645 -0.0185908
+-0.0315398 0.0589058 0.0377684
+-0.00748372 0.0488969 0.0502433
+-0.0877886 0.0861226 0.0174689
+0.0414464 0.101443 0.020163
+0.0252372 0.0926012 -0.0220221
+-0.0572172 0.0498044 0.00711465
+-0.0384957 0.0719179 0.0419735
+0.0143485 0.0552312 -0.0288146
+-0.0512659 0.0360808 0.0462964
+-0.0880011 0.0941555 0.00641769
+-0.0508873 0.109845 -0.0186279
+-0.0514991 0.112527 0.0359192
+-0.0338144 0.0342727 0.0263277
+-0.0615036 0.0804118 0.0430159
+-0.0663263 0.0606754 0.0176657
+-0.0909825 0.11607 0.0303184
+0.0184707 0.107054 0.0413783
+-0.0243398 0.183957 -0.0138554
+-0.0158705 0.161111 -0.00904539
+-0.0335094 0.0647262 0.0398847
+-0.0782927 0.098997 -0.00960155
+0.0486963 0.0730972 0.0159514
+-0.0478872 0.0335336 -0.00475407
+-0.0154917 0.0883884 0.056678
+-0.077344 0.119067 0.051823
+-0.0560293 0.0674866 0.0368481
+-0.0635813 0.138158 0.0379352
+-0.0217661 0.0670215 -0.0366181
+0.0483442 0.0575601 -0.00531363
+-0.0237817 0.0727523 -0.0377511
+0.0443603 0.0490341 -0.0052894
+-0.0604973 0.0904382 0.0452731
+-0.0627563 0.152415 -0.0301468
+-0.0714195 0.067071 -0.00151156
+-0.0861662 0.147397 0.00721409
+0.011631 0.0474937 0.0464252
+0.0254946 0.0406248 0.0343049
+0.035443 0.111045 0.0256623
+-0.000588677 0.037658 -0.0249499
+-0.0388448 0.0971399 -0.0223049
+-0.0660244 0.166553 -0.0262486
+-0.048499 0.0848032 0.0451307
+0.0371019 0.111384 0.0119604
+-0.00927598 0.177254 -0.0287785
+-0.0389846 0.1533 -0.00797514
+-0.0351198 0.0484277 -0.0173281
+-0.00353807 0.0389271 0.0301841
+0.0132013 0.0864568 -0.0307211
+-0.0390625 0.110364 -0.0188163
+0.033372 0.106071 0.0326127
+-0.0831505 0.0857608 0.0304017
+0.0552187 0.0635647 0.027041
+0.0399168 0.0999289 0.0271558
+-0.0579697 0.0339719 0.0233097
+-0.0137397 0.178677 -0.0217984
+-0.0203244 0.0385446 0.0306811
+0.00122549 0.0359125 0.00298025
+0.0117447 0.0343946 -0.0103375
+-0.0913959 0.132306 0.0102259
+-0.0429194 0.0898997 -0.0223492
+-0.0511515 0.0337361 -0.0129379
+-0.0750027 0.155319 0.00677634
+-0.0771027 0.0689891 0.00817725
+-0.0353224 0.0340121 0.0244595
+-0.0291276 0.0386567 -0.0130433
+0.0303577 0.105377 -0.0136057
+0.0235082 0.12516 0.0112114
+-0.00249775 0.0787967 0.0582683
+0.0533686 0.0732758 0.0102917
+-0.0586915 0.0472669 0.00864036
+0.0328626 0.0738919 -0.0178203
+-0.017795 0.038392 0.00241319
+-0.044502 0.0478297 0.0399289
+-0.0747378 0.0687745 0.000531905
+0.0172248 0.12732 0.0217261
+0.0428517 0.0885116 0.026874
+-0.078089 0.159705 -0.0229182
+-0.00858725 0.0362397 -0.025275
+-0.0867205 0.102198 0.00542391
+-0.0926774 0.131034 0.0232376
+0.0167938 0.128074 0.00445644
+0.0541315 0.0553714 0.0271399
+-0.000925431 0.131188 0.0179397
+0.0288719 0.121048 0.0132077
+-0.00849451 0.0965679 0.0534544
+0.0226575 0.102902 -0.0189538
+-0.0787984 0.113337 -0.0032043
+-0.0099585 0.1135 -0.0182227
+-0.0282274 0.162443 -0.0041123
+-0.082525 0.0896742 -0.00660526
+-0.0477053 0.0708612 -0.0154107
+-0.0435026 0.0465062 0.0407289
+0.00126756 0.0669175 -0.0339113
+-0.0341799 0.0335887 -0.0224091
+-0.0623664 0.0443972 0.0296888
+-0.0374964 0.0676867 0.0416821
+0.00859545 0.0382141 0.0296981
+0.0458872 0.0834155 0.0151706
+-0.0908205 0.132399 0.0292201
+-0.0191683 0.0336751 -0.0214022
+-0.0140554 0.126614 -0.00210251
+-0.0260065 0.0335246 -0.026366
+0.0324259 0.0399358 -0.00240332
+-0.0296544 0.0346993 -0.0301222
+-0.0669615 0.129698 -0.00899609
+-0.0471845 0.0383965 -0.0142868
+-0.0572808 0.0345537 0.0438127
+-0.0627957 0.153425 0.0330074
+-0.0515105 0.13416 -0.00180112
+-0.0434907 0.171345 -0.00503558
+-0.0677742 0.0808646 -0.0174732
+0.00350312 0.0441648 0.0458711
+0.0291321 0.0686302 0.0420784
+0.0132792 0.0343795 0.0214237
+-0.0866978 0.12169 0.0483599
+-0.00350013 0.0801522 0.057807
+0.0371657 0.0997172 -0.00981258
+-0.0447383 0.0738987 -0.0178782
+-0.0605228 0.155495 0.0235493
+-0.0362392 0.151744 -0.00510561
+0.0454797 0.0637982 0.0288243
+-0.0672083 0.0609402 0.0172424
+0.0241031 0.0782197 0.0489777
+0.0442629 0.0672699 0.000591455
+-0.0289948 0.0522303 -0.0223864
+-0.0645013 0.0774777 0.0413253
+0.0444938 0.0959562 0.00517859
+-0.00459579 0.039143 -0.025596
+0.0184671 0.0913654 0.0479185
+0.0146407 0.129582 0.00935921
+-0.0505573 0.0439128 0.0441317
+-0.0141262 0.119616 -0.0126879
+-0.0849191 0.117035 0.0482987
+0.0280536 0.119554 5.13011e-05
+-0.0247655 0.0712486 -0.0365856
+0.0034971 0.091096 0.055256
+-0.0641848 0.0432086 0.0316934
+-0.0881185 0.151555 0.0230923
+-0.0680885 0.16093 -0.05501
+0.0474345 0.0682488 0.00159582
+0.0111403 0.105858 -0.0199086
+-0.0369545 0.0349347 0.0427177
+-0.0604782 0.144516 -0.00363507
+-0.0394712 0.08608 0.0435352
+-0.0548214 0.143869 0.0295389
+-0.028506 0.107069 0.0398546
+0.0281659 0.121502 0.0158045
+-0.0797197 0.143117 -0.0027917
+-0.0616803 0.166235 -0.0555923
+-0.0204271 0.0893191 -0.0369723
+0.0361287 0.085855 -0.0169039
+-0.00251199 0.107268 0.0437857
+-0.0114962 0.0842854 0.0575311
+-0.0738001 0.0651206 0.00865838
+-0.0114808 0.0353662 -0.0177045
+0.0391473 0.0421646 0.0269754
+-0.0565891 0.129759 0.0374849
+-0.0720408 0.171996 -0.0342175
+-0.0139288 0.0883705 -0.0380287
+-0.0562656 0.0335637 0.0133743
+-0.0196985 0.0957936 -0.0295783
+-0.00486881 0.104509 -0.0228932
+-0.0550525 0.129598 -0.0055846
+-0.0584858 0.0776493 0.0431837
+-0.0898534 0.121302 0.00430136
+-0.0191218 0.165312 -0.0179178
+-0.0249563 0.0383168 0.00102848
+-0.0199274 0.0958752 0.0490354
+-0.0574825 0.113918 0.0359516
+-0.00850157 0.101663 0.0440465
+-0.0873724 0.124348 0.0475064
+0.00764213 0.03621 -0.0128239
+-0.0264494 0.0648769 0.0395324
+0.0541546 0.0547912 -0.000791322
+-0.0434926 0.0789866 0.0425224
+0.0241906 0.121901 0.0271611
+-0.0866809 0.0819772 0.0124969
+-0.0717212 0.0344863 0.00580157
+0.0302841 0.11623 -0.00325108
+-0.0737112 0.155478 -0.0269075
+-0.0424683 0.108486 0.0389261
+0.0176716 0.0658898 0.0500991
+0.0494857 0.064014 -0.00214923
+-0.0514961 0.0945888 0.044111
+0.0340749 0.0901032 -0.0173771
+-0.0719584 0.0942006 0.0415089
+-0.0544894 0.0594391 0.0238452
+-0.0877192 0.101 0.0223776
+-0.0758319 0.173116 -0.0385323
+-0.0114857 0.119632 0.0369891
+-0.0313874 0.0581183 -0.0163942
+-0.0157652 0.0728861 -0.0388826
+0.0167046 0.0945555 -0.0241181
+-0.000498244 0.0647983 0.0567029
+0.0256473 0.0420743 0.0363142
+-0.0630437 0.12273 0.0457647
+-0.0540131 0.144678 0.0264098
+0.0135054 0.10711 0.0421551
+-0.00428335 0.124198 -0.00969837
+0.0415325 0.0816649 -0.00777347
+-0.0392229 0.0337594 -0.0179786
+0.0593141 0.0691549 0.00914325
+-0.0219522 0.0382139 0.00717586
+0.0288925 0.112764 0.0331675
+-0.0524014 0.152599 0.0134601
+-0.0628726 0.147915 -0.0152353
+-0.030456 0.158107 0.0014598
+0.0308953 0.0400111 0.0272142
+-0.0757616 0.109947 0.0435791
+0.0253341 0.0591059 -0.0237971
+-0.0261555 0.155801 -0.00568703
+-0.0679463 0.128236 -0.00906158
+-0.0156387 0.0377596 -0.0169892
+-0.0757064 0.112028 0.0472849
+-0.0155135 0.0631057 0.0533345
+-0.0512066 0.125627 -0.00670494
+-0.0896222 0.111892 0.015334
+-0.0493777 0.160927 -0.00574679
+-0.0630274 0.166296 -0.040584
+0.058244 0.0580344 0.0225642
+0.0413547 0.102812 0.0011821
+-0.0162922 0.125122 0.0270033
+0.02338 0.0632213 0.0460213
+0.0609114 0.0623534 0.0131596
+-0.0691061 0.164802 -0.0173282
+-0.0870447 0.0977755 0.0254107
+-0.00849378 0.112803 0.0415796
+0.0145027 0.115416 0.0371643
+-0.0184257 0.066889 0.0526426
+-0.0448982 0.123992 0.0241166
+-0.050497 0.0903958 0.0446608
+-0.0315626 0.0348573 0.0456798
+-0.0684915 0.0902546 0.0428415
+-0.0180785 0.0337977 -0.021304
+0.0043349 0.0389929 -0.00853324
+-0.0830349 0.153941 0.0230111
+-0.0800798 0.103192 -0.0065999
+0.0437731 0.0973301 0.016155
+0.00944321 0.131132 0.0160037
+-0.0514165 0.0627417 0.0327301
+-0.0528926 0.154865 0.0118243
+0.0187407 0.0740964 0.0517477
+-0.0721682 0.0657282 0.00147121
+0.00959045 0.131031 0.00893055
+-0.0694847 0.181423 -0.0563964
+-0.0569551 0.11454 -0.0150747
+-0.0821005 0.0885236 0.0320901
+-0.0174725 0.0383553 0.00432532
+-0.00258809 0.0348892 -0.0237423
+0.0413648 0.0939401 0.0283252
+-0.00375638 0.13079 0.0183493
+-0.0686466 0.0719376 -0.0111307
+-0.0688202 0.180176 -0.0531787
+-0.0397209 0.0710215 -0.0169451
+0.0184831 0.105752 0.0426872
+0.00809551 0.112572 -0.0192987
+0.0206432 0.121117 -0.00652883
+-0.0718516 0.0979698 -0.0147575
+-0.0662716 0.170413 -0.0392349
+0.0237477 0.0605032 -0.0251433
+-0.0340875 0.177472 -0.00744261
+-0.0167857 0.0784752 -0.0385587
+-0.0565291 0.0373798 -0.0104777
+0.00297843 0.0341587 0.014086
+-0.0667756 0.124253 0.0509201
+-0.026364 0.0359692 -0.029405
+-0.0550408 0.0334649 -0.000671931
+-0.0697701 0.0874139 0.0423816
+0.0246944 0.0835826 0.0481083
+0.0199488 0.115322 0.0360728
+0.0383916 0.042968 -0.00337479
+-0.0365829 0.0335193 -0.0246869
+-0.0355007 0.112502 0.0349387
+-0.0689238 0.125301 -0.00884615
+0.0395927 0.0385536 0.0157178
+-0.0889313 0.0875027 0.0114635
+0.0448665 0.0945715 0.00517989
+-0.0477042 0.0664777 -0.0141832
+-0.0434727 0.125255 -0.0084227
+-0.0166904 0.169787 -0.0155577
+-0.0134983 0.0501789 0.0495792
+-0.0624968 0.0833205 0.0441176
+-0.0342132 0.0345231 0.0384015
+0.043295 0.084533 0.027498
+-0.0819819 0.112797 -0.000848269
+0.0121624 0.129948 0.0198557
+-0.0674677 0.10143 0.0408399
+-0.0626754 0.059895 0.0191264
+-0.0367892 0.0459324 0.0404864
+-0.027194 0.0764697 0.0455544
+-0.0824053 0.0748814 0.00852871
+-0.0656294 0.0642362 -0.0044412
+0.032725 0.116988 0.0160848
+-0.0764226 0.102162 0.0358668
+0.00148048 0.0952613 0.0542408
+0.0228866 0.122341 0.0280976
+-0.0584486 0.139576 0.0330542
+-0.0402835 0.123242 -0.0103332
+-0.012241 0.0406566 0.0504983
+-0.0489426 0.0614374 0.0351759
+-0.0844851 0.0778045 0.00951927
+-0.0369817 0.156591 0.00432745
+-0.0882804 0.103688 0.0163664
+-0.0258065 0.0825691 -0.0373737
+-0.0355052 0.102861 0.0407303
+-0.0524183 0.131115 0.0329855
+-0.0227031 0.175691 -0.0136597
+0.050697 0.0684106 0.00144017
+0.000504835 0.0911354 0.0558722
+0.00231832 0.0583343 -0.0324165
+-0.0148886 0.169807 -0.0164639
+-0.0722033 0.152534 -0.0417656
+-0.0134817 0.073078 0.0557755
+-0.0255231 0.109882 0.0391184
+-0.0655581 0.135384 0.0421104
+-0.024745 0.0698061 -0.0360534
+0.0559546 0.0524347 0.0227151
+-0.0283257 0.118773 -0.011655
+-0.0335185 0.0974234 0.0440535
+-0.0817699 0.0748179 0.0155353
+-0.027189 0.162441 -0.00437298
+-0.0267454 0.0711222 -0.0350441
+-0.03015 0.171175 -0.0170282
+-0.026605 0.06607 0.0397555
+-0.074698 0.179765 -0.0510072
+0.0143367 0.0504741 0.0468665
+-0.0594975 0.111137 0.0367915
+-0.0346758 0.127158 0.0144691
+-0.0465015 0.0847604 0.0446321
+0.00381747 0.0354686 0.0455691
+0.0172732 0.0792708 -0.0288683
+0.0323738 0.104756 0.0346971
+-0.0794458 0.0813481 -0.00752304
+-0.0312226 0.0367355 -0.0304453
+-0.0110616 0.168437 -0.0238044
+-0.0579369 0.119806 -0.0105246
+-0.0337394 0.0355643 0.0323212
+0.0312129 0.0525777 -0.012761
+-0.0346988 0.120729 -0.0096591
+-0.0388776 0.0364147 0.043017
+-0.0271127 0.16377 -0.0158754
+-0.0114338 0.0347606 0.0448027
+-0.0897559 0.114544 0.00631807
+0.0408171 0.04213 0.0255289
+-0.0648854 0.102482 -0.0170908
+-0.0137359 0.061178 0.0537969
+-0.00359581 0.130946 0.00835725
+0.0439346 0.0959403 0.0181595
+-0.0194977 0.104404 0.0429832
+-0.0691323 0.0776098 0.0394254
+-0.00248627 0.097432 -0.0292057
+0.00445885 0.0387258 0.0265895
+0.0492859 0.0567642 0.0307116
+-0.077476 0.164468 -0.0240677
+-0.0666867 0.175728 -0.049503
+-0.0251661 0.0664206 0.0424455
+-0.027701 0.0549269 0.0368456
+-0.018943 0.164042 -0.0169159
+-0.0435133 0.0846552 0.0431729
+-0.0888345 0.136443 0.0400961
+0.00149473 0.112812 0.0419217
+-0.0298299 0.09304 -0.0247313
+-0.0836967 0.0790161 0.00252063
+-0.000924151 0.039273 -0.0117161
+-0.0567677 0.0811908 -0.0210238
+-0.0934681 0.120116 0.0253121
+-0.0429479 0.170625 -0.000616016
+-0.075975 0.156283 -0.00563956
+-0.00861288 0.0384077 0.0151551
+-0.00160584 0.0434015 -0.0251635
+-0.00451637 0.113738 -0.0185133
+-0.0780673 0.0690482 0.0132523
+-0.0237986 0.0784163 -0.0381462
+0.0404558 0.0643575 0.0302495
+0.00150103 0.0576486 0.0543674
+-0.0314973 0.0746234 0.0406619
+-0.0430409 0.0337266 -0.000289053
+-0.0303409 0.0462461 0.0481864
+0.0215433 0.04083 0.0414017
+-0.0328294 0.0901297 -0.0245803
+-0.0654933 0.0370192 -0.00733845
+-0.0128512 0.129269 0.0078276
+-0.0102634 0.129467 0.00444971
+-0.0525768 0.0530264 -0.00686565
+0.0152424 0.0737083 -0.0300265
+-0.0523202 0.0474101 0.0149978
+-0.03228 0.059616 -0.0144015
+0.0262796 0.0733084 -0.0244949
+-0.091934 0.128302 0.0312437
+-0.0556539 0.153362 0.0267778
+0.00449629 0.118272 0.0381357
+-0.00902947 0.129018 0.00125187
+-0.00169837 0.0391357 -0.00987107
+0.0277845 0.0849076 0.045525
+-0.0241779 0.1712 -0.0197595
+0.0450874 0.0847681 0.0221666
+-0.0251342 0.0878826 0.0516343
+0.00641806 0.0347537 -0.00236123
+-0.0411191 0.111396 -0.0179091
+0.027653 0.0506012 0.0379885
+0.0219297 0.123716 0.0263137
+-0.0688294 0.148429 -0.0341374
+-0.0315292 0.124197 -0.00202254
+0.00150698 0.0801002 0.0571866
+-0.0615835 0.0366556 0.0444374
+-0.0481389 0.160609 -0.00688834
+-0.0254054 0.0766649 0.0494071
+-0.0774728 0.155537 -0.0149084
+-0.0401214 0.159176 -0.0112287
+0.0596647 0.0691741 0.016158
+-0.011487 0.110004 0.0424075
+-0.0381186 0.128235 0.00584498
+0.048576 0.0464424 0.0249843
+-0.0923754 0.118793 0.0312942
+-0.0639323 0.123848 -0.00887264
+-0.0798905 0.126603 -0.00582167
+-0.0413231 0.0462396 -0.0163116
+-0.0908165 0.145736 0.0263481
+0.0446156 0.0959646 0.00916087
+-0.0821218 0.075868 0.0188618
+0.05068 0.0673838 0.000483718
+-0.0501479 0.0515412 0.017644
+-0.00617289 0.130741 0.0117189
+-0.051836 0.0956238 -0.0221428
+-0.074878 0.122304 -0.00772392
+-0.00159817 0.0419657 -0.0250292
+-0.0474982 0.162268 0.00647513
+-0.0331161 0.0498057 0.0395103
+0.00234342 0.0510926 -0.0302041
+-0.0851404 0.125756 0.0494653
+-0.0699016 0.160977 -0.0489386
+-0.0798846 0.0706301 0.0125498
+-0.0697873 0.0819627 0.0411407
+-0.0547576 0.161266 0.00105716
+-0.0895055 0.0902528 0.0184453
+-0.0261075 0.162258 -0.0150297
+0.046501 0.0611194 0.0308227
+0.0238707 0.0929061 0.0469915
+-0.0533713 0.0334322 -0.00211203
+0.0417012 0.085878 -0.00880084
+0.0288139 0.110493 -0.0110929
+-0.083716 0.087071 0.0295098
+-0.0798758 0.155212 0.019678
+0.0049172 0.0339971 0.00916661
+0.0160048 0.0590435 0.0493667
+0.0573849 0.0699459 0.0206376
+0.0345802 0.103262 -0.0113359
+-0.0797481 0.0789376 0.0314228
+-0.0346581 0.0340056 0.0228095
+-0.0631272 0.0656833 0.0316274
+-0.0145321 0.0459268 0.0498594
+-0.0364091 0.0339112 -0.0194195
+0.0181222 0.116444 -0.0134944
+0.0341932 0.113962 0.0237708
+-0.0761778 0.148614 -0.0108668
+-0.0044937 0.0473352 0.0489501
+-0.0328741 0.0807299 -0.0285171
+-0.0724981 0.121807 0.0536688
+-0.0657234 0.153927 0.0319321
+-0.0548973 0.112625 -0.01673
+0.0464212 0.0764513 0.00819032
+0.0272261 0.0451183 -0.00768323
+-0.0629092 0.156144 0.021238
+-0.0631603 0.151216 -0.00238889
+-0.0347632 0.076687 -0.0214942
+-0.0906385 0.147509 0.0131579
+-0.0122779 0.122169 -0.00937841
+-0.0588974 0.156171 0.00210438
+-0.0123378 0.123047 -0.00831897
+-0.0496312 0.0590927 -0.0108209
+-0.0409256 0.153594 0.00561766
+-0.0405007 0.0860467 0.0431081
+0.0445131 0.0735224 0.0237705
+-0.0213844 0.123724 -0.0049697
+-0.0633941 0.159891 -0.0485891
+0.0364077 0.044553 -0.00488844
+-0.0739928 0.155924 0.011504
+-0.0111043 0.0366055 0.0502176
+0.03375 0.0929319 0.0401542
+-0.00645978 0.0918654 -0.0354548
+-0.0827096 0.131285 0.0511192
+-0.0835459 0.133987 0.0490485
+-0.0294951 0.0617035 0.0376524
+-0.0493817 0.138599 0.0163919
+-0.055623 0.120216 -0.0109924
+-0.00449347 0.121049 0.0367461
+-0.048904 0.144756 0.0084067
+0.00645901 0.0392685 0.0301228
+-0.0913214 0.114759 0.0373166
+-0.0265805 0.0377426 0.0157053
+-0.00572231 0.0669806 -0.0352658
+-0.0525421 0.050441 0.0296546
+0.0313831 0.11825 0.0184294
+-0.0288441 0.0958675 -0.0242091
+-0.0149484 0.177196 -0.0200335
+0.0230906 0.0973761 -0.0211755
+-0.0134888 0.11412 0.0398002
+-0.0652337 0.169622 -0.0599681
+-0.069106 0.161031 -0.0101008
+-0.0147444 0.0700214 -0.0382575
+0.000412578 0.0376462 -0.0248548
+-0.0694764 0.165214 -0.0509787
+-0.0817245 0.100671 0.0313188
+-0.0464909 0.0704463 0.0410366
+-0.0604958 0.0890419 0.0453253
+-0.0356646 0.155102 0.0026804
+0.0313895 0.0549645 0.0381834
+-0.0390844 0.149487 -0.000628748
+-0.0799141 0.109193 0.0343277
+-0.033406 0.159477 0.0024166
+0.0461298 0.0806288 0.00519237
+-0.00455042 0.0384226 0.0105194
+0.054633 0.0708998 0.00492223
+0.0466692 0.0754291 0.0122452
+-0.0510158 0.118895 -0.0136999
+0.0442088 0.0931449 0.0211603
+-0.026052 0.036748 0.0540507
+-0.0121151 0.0568039 0.0522997
+-0.0605217 0.0372227 -0.00906293
+-0.0505374 0.138563 0.00240881
+-0.0499851 0.135487 0.00142097
+0.0375229 0.0590309 0.0330268
+0.00350924 0.0842701 0.0573364
+0.0132839 0.0652538 -0.0302637
+-0.0742776 0.161639 -0.0118948
+-0.0507685 0.164108 -0.00292996
+-0.0198709 0.104468 -0.0228058
+0.0376047 0.0616532 -0.0107499
+-0.0773811 0.108845 0.0387481
+0.0226208 0.102094 0.0434114
+-0.0882171 0.135133 0.0423395
+-0.0506614 0.0515945 0.0196285
+-0.0603044 0.155837 0.0105687
+-0.0124866 0.11001 0.0423152
+0.02167 0.125998 0.00768374
+0.0323984 0.0396183 0.0260504
+-0.0709343 0.126767 -0.00893718
+-0.0135132 0.116917 0.0382221
+-0.0116656 0.051126 -0.0319435
+-0.0309822 0.125744 0.00553845
+0.0459345 0.0862193 0.0101703
+0.00749696 0.119642 0.0368719
+-0.00350244 0.107276 0.0438161
+-0.0521339 0.128852 -0.00413976
+-0.0786185 0.152695 0.0319953
+0.0163345 0.0781449 0.0535802
+0.0377538 0.0771288 -0.0117747
+-0.0215296 0.0387791 0.0338148
+-0.0350693 0.0384092 -0.00660408
+-0.0919891 0.124178 0.0422069
+-0.0444587 0.11222 -0.0167423
+-0.0171725 0.0985232 -0.0244048
+-0.057494 0.112512 0.0360215
+0.0396241 0.0900718 0.0328369
+-0.0621913 0.163125 -0.0405922
+-0.0255449 0.0384207 -0.00839698
+0.0162606 0.0736784 -0.0295549
+-0.0663455 0.040996 0.0121932
+-0.0292314 0.114996 -0.0157151
+0.0252254 0.095572 0.0454222
+0.00388853 0.130454 0.00153712
+-0.0454814 0.0335414 -0.0134702
+-0.08387 0.148679 0.0348187
+-0.0174749 0.184587 -0.0183292
+0.0188962 0.0370007 -0.0126843
+-0.0625159 0.163122 -0.0305925
+-0.0433987 0.03363 -0.0131325
+0.0291629 0.037982 0.025034
+0.0129127 0.129715 0.00445998
+0.0182606 0.0778122 -0.0281935
+-0.0476906 0.0356242 -0.0142735
+-0.0190478 0.0404047 0.0529202
+-0.00364871 0.0982082 -0.0280452
+-0.0195235 0.184467 -0.0220738
+0.00382729 0.106411 -0.0207174
+0.00350781 0.064793 0.0565955
+-0.0205171 0.0383642 -0.00178242
+0.0122268 0.0836141 -0.0306261
+-0.0444606 0.147723 0.0056898
+-0.0869664 0.148754 0.00824898
+-0.0689807 0.155012 0.0293114
+0.0302795 0.0795477 0.0438394
+-0.0660235 0.174935 -0.0492702
+-0.0804891 0.133061 0.0515278
+-0.0447252 0.109884 -0.0183457
+-0.0902839 0.137831 0.0151959
+-0.0702292 0.153353 0.0333614
+-0.0915979 0.146114 0.0211525
+-0.0905232 0.122929 0.0450175
+0.00448177 0.0951431 0.0532987
+-0.0234909 0.120747 0.0300444
+0.0274801 0.0445395 -0.0065618
+-0.091814 0.116108 0.0403567
+-0.0537253 0.151161 0.0246275
+-0.0205455 0.126353 0.00242085
+-0.00205946 0.129266 -0.00113907
+0.00252933 0.0758769 0.0564116
+0.00824452 0.129671 0.000311795
+-0.000397685 0.0923281 -0.0338988
+-0.0559448 0.126938 0.0384169
+-0.0428369 0.0942645 -0.0226678
+-0.0598806 0.105454 -0.017999
+-0.0837054 0.10067 -0.00361944
+-0.0545817 0.152467 0.0257328
+0.0103827 0.0365006 0.0297934
+-0.0898089 0.133793 0.0332137
+-0.0618767 0.15376 -0.0175826
+-0.0665983 0.155819 0.0112334
+-0.0454977 0.108441 0.0393231
+0.000688563 0.105475 -0.0216898
+0.0156183 0.0348875 0.0323047
+0.0598096 0.0622539 0.00613597
+0.0222628 0.0359732 0.0163557
+-0.0492522 0.165358 0.00274428
+-0.018422 0.0583296 0.0500808
+-0.0233794 0.126748 0.0127038
+-0.0635915 0.172518 -0.0506017
+0.000120368 0.0351316 0.0162576
+-0.0286059 0.0564269 -0.0233938
+0.0373643 0.110979 0.0106211
+-0.0143444 0.162546 -0.0104323
+0.0174821 0.10039 0.0467276
+0.00834248 0.0609508 -0.0305126
+-0.0650557 0.129761 0.0446036
+0.0584157 0.0647883 0.022872
+0.0450662 0.0889731 0.0191643
+-0.0554099 0.0334223 -0.00251784
+-0.00144558 0.106667 0.0437112
+-0.0626402 0.0627915 -0.00434322
+-0.0406608 0.0335117 -0.0254825
+-0.0621215 0.15372 -0.0285871
+-0.0304827 0.0538056 -0.016375
+0.0276877 0.0607373 -0.0218456
+-0.0332153 0.107417 -0.0197253
+-0.0709666 0.138448 -0.00754922
+-0.0554983 0.0973521 0.0432389
+0.0051585 0.127708 0.0288034
+-0.0497318 0.0354763 -0.0126201
+-0.0713898 0.160567 -0.00801414
+-0.0135985 0.108507 -0.0209218
+-0.0701499 0.0695315 0.0320822
+-0.0618453 0.155287 -0.0285878
+-0.0774937 0.145636 0.0432119
+-0.0499442 0.140127 0.0163925
+-0.0622517 0.147555 -0.00557481
+0.0112895 0.0624411 -0.0303571
+-0.054281 0.0573695 -0.00641449
+-0.0468263 0.128888 -6.3255e-05
+0.0167125 0.0343686 0.00192575
+0.025374 0.0938744 -0.0213667
+0.0374202 0.110869 0.0135214
+-0.0202897 0.0381028 0.016664
+0.0122214 0.13032 0.0170232
+-0.0424979 0.0817557 0.0420871
+0.0247834 0.123596 0.021665
+0.0458295 0.0890233 0.00817039
+-0.0246722 0.05361 -0.0281576
+-0.0368219 0.0900544 -0.0239252
+-0.0331266 0.0338175 0.0106794
+-0.0863242 0.111849 0.0243217
+-0.0881544 0.121251 0.000301062
+-0.0639205 0.112438 -0.0133308
+0.00114374 0.101639 -0.0226194
+0.0117494 0.0671858 0.0538619
+-0.0177987 0.0336176 -0.0248428
+0.0384483 0.10837 0.0201721
+-0.0895436 0.0902218 0.014448
+-0.0441053 0.129054 0.00361434
+-0.0447524 0.033564 -0.0207541
+-0.040486 0.0346908 0.0404235
+0.0158804 0.124131 -0.00578699
+-0.0301445 0.169695 -0.0171502
+-0.0906194 0.139243 0.0211829
+-0.0653253 0.142516 0.0407395
+-0.0320761 0.0447291 -0.0281131
+-0.0764158 0.0699842 0.0233785
+-0.0254497 0.052221 0.0403383
+0.0262523 0.076131 -0.0243472
+-0.0174971 0.101623 0.0437353
+0.00533357 0.055349 -0.0305496
+-0.0493266 0.134948 0.0237381
+0.0053984 0.122421 -0.0118951
+0.038604 0.108395 0.0191762
+-0.0638345 0.0431637 0.0378429
+-0.0748055 0.0863518 -0.0148055
+0.0157558 0.127182 0.025475
+0.0337414 0.0384723 -6.48206e-05
+-0.0564853 0.0791423 0.0441771
+0.0234983 0.102092 0.0429315
+-0.00524932 0.101176 -0.023207
+-0.0804177 0.153092 0.00488677
+-0.0764988 0.13725 0.0499203
+-0.0550791 0.134447 -0.00412579
+0.0139517 0.124505 -0.00617757
+-0.0839821 0.127994 -0.00381712
+-0.0571198 0.115445 0.0365816
+-0.0622396 0.155257 -0.0325976
+-0.0454972 0.0761548 0.042184
+0.0313815 0.0461664 -0.00629419
+-0.0438412 0.0942345 -0.0223045
+-0.0236613 0.0852675 0.0544729
+-0.0616609 0.147135 -0.00399772
+-0.0600825 0.0413306 0.0227014
+-0.0105535 0.180959 -0.0288535
+-0.0676833 0.155656 0.026832
+0.0282931 0.118599 0.0272385
+-0.0871972 0.102223 0.00642609
+0.0103624 0.0494805 -0.028102
+0.0154246 0.0685991 0.0521564
+-0.0416312 0.117641 -0.0144485
+-0.0276264 0.046347 -0.026964
+-0.0916136 0.132311 0.0112256
+0.0178346 0.0505132 0.0449253
+-0.0444935 0.155066 0.00750552
+-0.037487 0.115255 0.0329307
+-0.0185008 0.119534 0.0344711
+-0.052516 0.0452355 0.0436109
+-0.00977222 0.11683 -0.0157853
+-0.0558279 0.0635792 0.0314789
+-0.0607324 0.0592584 0.00571875
+-0.0621725 0.160005 -0.022587
+-0.0603904 0.152423 0.000272984
+-0.0697355 0.134074 0.048407
+-0.0688943 0.103764 -0.0141878
+-0.0871513 0.117629 0.0474896
+0.0463722 0.0764454 0.00719365
+0.0582269 0.0686747 0.0208601
+0.0410646 0.07659 0.0312229
+-0.0298717 0.104385 -0.0225787
+-0.0346365 0.0766699 -0.022492
+-0.0639324 0.147049 -0.0189093
+0.0414492 0.10286 0.0161642
+0.041276 0.104245 0.0131611
+-0.0550666 0.151635 -0.00215779
+-0.0723648 0.0763024 0.0368597
+-0.0166996 0.0540293 -0.0329391
+-0.0108856 0.107334 -0.0222671
+-0.0609787 0.126745 -0.00811044
+-0.0495024 0.109811 0.0380885
+-0.0814376 0.0978185 -0.00662583
+-0.0771326 0.163938 -0.0219397
+-0.0690818 0.18144 -0.0564572
+0.031034 0.0964814 -0.0161287
+0.0445032 0.0555996 0.0323503
+-0.0335401 0.0732865 0.0413362
+0.0315592 0.035603 0.0149292
+-0.0625155 0.0344693 0.0376364
+0.0223706 0.0505198 -0.0231651
+-0.051638 0.0663266 -0.0117848
+0.0132667 0.0519749 0.0488584
+-0.0568732 0.108333 -0.017952
+0.0448639 0.0833492 0.023175
+-0.0316705 0.0806285 -0.0315587
+-0.0714676 0.155482 0.0269686
+0.0118001 0.034659 0.0389456
+-0.0860496 0.128472 0.048867
+-0.0155071 0.175699 -0.0190868
+-0.058019 0.131103 -0.00658932
+0.0113955 0.0434069 -0.0246972
+0.0568205 0.0566796 0.0240006
+-0.0267763 0.0365192 0.0538225
+-0.0564971 0.0987696 0.0431638
+0.0353453 0.0835128 0.0388598
+-0.0602464 0.144668 -0.00329576
+-0.00749863 0.0884246 0.0571361
+-0.0816964 0.0734472 0.00653139
+0.0399806 0.105624 0.0191716
+-0.0676913 0.172275 -0.0570278
+-0.0358314 0.0356542 0.0457978
+0.0503129 0.0516868 -0.00299828
+-0.0414959 0.0705202 0.0419075
+0.0246022 0.0942401 0.0462765
+-0.0735775 0.170801 -0.0470392
+0.0373196 0.105416 -0.00382358
+0.0463401 0.0518943 -0.00540594
+0.0400167 0.0646852 -0.00776271
+-0.0597593 0.07671 -0.0185219
+-0.0237194 0.0639841 -0.033754
+-0.0473867 0.0345201 0.0356021
+0.00159304 0.131118 0.00454966
+-0.073925 0.126728 -0.0084362
+-0.0243269 0.0616478 -0.0324508
+0.0457562 0.0904226 0.00816981
+-0.0688748 0.159133 -0.00709894
+-0.0394914 0.0944889 0.0427101
+-0.0687998 0.0822684 -0.0173873
+-0.0455924 0.119193 -0.014062
+-0.0369476 0.033676 0.00641963
+-0.09079 0.1297 0.0392322
+-0.0389556 0.0350986 0.042208
+-0.0414578 0.107073 0.0393054
+-0.00265934 0.098112 -0.0279111
+-0.0331649 0.0652734 -0.0174782
+-0.0343312 0.0836736 -0.0246034
+0.0134882 0.101805 0.0472084
+-0.0594997 0.0846925 0.0439263
+-0.0423306 0.040657 -0.0232664
+0.0092124 0.114671 -0.0175632
+0.0538026 0.0595499 0.0284925
+-0.0256867 0.0380701 0.0246091
+-0.0693658 0.16286 -0.0130912
+0.0333604 0.037057 0.0194583
+0.00949693 0.121023 0.0358683
+0.0321446 0.0360609 0.0164637
+0.0341544 0.0548861 0.0351403
+-0.000334987 0.0965293 -0.0302242
+0.0585628 0.0673807 0.0213416
+-0.053406 0.12345 -0.00838645
+-0.0749578 0.132548 -0.00734349
+0.0282219 0.0816125 -0.0219304
+-0.0351889 0.171161 -0.0140358
+0.00949153 0.0936876 0.0522363
+-0.0157849 0.172748 -0.017746
+-0.0175848 0.169785 -0.0150947
+-0.0835905 0.112379 0.0452164
+-0.0404862 0.0846544 0.0431896
+0.0231358 0.0404562 0.0392455
+-0.00366205 0.0540631 -0.0322696
+0.00959837 0.0403395 0.0451906
+-0.0692421 0.0422187 0.00798097
+-0.0285258 0.0717501 0.0402231
+-0.00789542 0.108803 -0.0224197
+0.0159009 0.113257 -0.0160529
+-0.00149436 0.0620061 0.056412
+-0.0420891 0.0363826 -0.0272583
+-0.00449341 0.104477 0.0440393
+-0.0683512 0.0607717 0.0117847
+-0.0927055 0.120137 0.0415853
+-0.0484911 0.115278 0.0334198
+0.02514 0.0350088 0.0196342
+-0.065935 0.125307 -0.00885715
+-0.0621483 0.0699034 0.036962
+-0.0178695 0.104461 -0.0227631
+0.0351768 0.0563002 0.0348659
+0.0105044 0.115477 0.0381888
+-0.0938558 0.126876 0.0162567
+-0.0632514 0.033799 0.0117273
+-0.0736013 0.0654333 0.0137843
+-0.0577792 0.0341881 0.0284371
+-0.0763952 0.0838159 -0.0125906
+-0.0296632 0.180174 -0.00867233
+0.00819029 0.0851531 -0.0324575
+-0.071633 0.174549 -0.0412084
+-0.0538265 0.0927341 -0.0220469
+-0.0471905 0.156504 0.00887867
+-0.0661815 0.0615106 0.0205126
+0.0144985 0.107111 0.0421568
+-0.0721929 0.152802 0.0342528
+0.0142765 0.0666697 -0.0302658
+0.0349485 0.0942163 0.0384062
+-0.0664891 0.0369705 -0.00688594
+-0.077495 0.158339 -0.0149115
+-0.0739383 0.160975 -0.0103701
+-0.00971429 0.0386927 -0.0148008
+-0.0618555 0.155289 -0.0295874
+-0.0621574 0.152203 -0.016578
+-0.032494 0.096035 0.0446186
+0.044345 0.0519693 -0.00630996
+0.0319954 0.0520213 0.0354999
+-0.0300925 0.0509394 -0.0183595
+-0.018449 0.0388382 0.0343981
+-0.0670639 0.154762 0.000889218
+0.0361767 0.0888967 0.0383392
+0.0262873 0.0942382 0.0451936
+0.0186534 0.103359 0.0446898
+-0.0523328 0.0334686 -0.00741897
+0.0507066 0.0540083 0.0292331
+0.0529037 0.0462692 0.0142047
+-0.0888522 0.0996312 0.00941041
+0.0275656 0.0563642 0.0414619
+-0.0371627 0.0336289 -0.0286501
+-0.0198294 0.0882519 -0.0375379
+-0.0907603 0.140585 0.0151783
+-0.00458896 0.0376652 -0.0252351
+-0.093041 0.12831 0.0262642
+-0.0743429 0.0955133 0.0396401
+-0.089704 0.111925 0.0143387
+0.0453684 0.0889907 0.0151607
+0.0456444 0.086201 0.0151659
+-0.0635175 0.0399079 -0.00714576
+-0.0294925 0.0903536 0.0441109
+-0.0888771 0.100994 0.011394
+-0.0121064 0.0869584 -0.0384624
+0.0373352 0.108319 0.0251875
+-0.0882187 0.112165 0.0210064
+0.0349174 0.110993 0.0268865
+-0.0849268 0.122064 -0.00322109
+0.0124968 0.112648 0.0387734
+-0.0662562 0.163203 -0.0177078
+-0.0640701 0.113939 0.0406208
+-0.0654246 0.0794919 0.0421931
+-0.0519669 0.0569186 0.0284516
+-0.0519207 0.0493094 0.0353906
+0.00333114 0.0341656 0.00499397
+-0.056914 0.133942 0.035273
+-0.0780215 0.158305 -0.0199209
+0.0276406 0.111416 0.0348725
+-0.0172565 0.181572 -0.0253576
+0.0372544 0.0379189 0.00466817
+-0.0211197 0.1653 -0.017528
+-0.0557637 0.121264 0.0386516
+0.0274329 0.121878 0.0183804
+-0.0623369 0.16467 -0.04959
+0.00450432 0.0883672 0.0562441
+-0.0649333 0.145142 -0.016034
+-0.0918355 0.118761 0.0292947
+0.0503561 0.073461 0.0121181
+-0.0732571 0.0860546 0.040246
+-0.0543933 0.14384 0.0284354
+0.0235922 0.124679 0.00697037
+0.049638 0.0724241 0.0192263
+-0.0691135 0.0647604 0.0241382
+-0.0277318 0.0385796 0.0327127
+0.0249679 0.0605263 0.0447882
+0.0220764 0.0741142 0.049509
+-0.012493 0.16839 -0.0164935
+0.0220311 0.0550166 0.0457656
+-0.0197467 0.0364265 -0.0184459
+0.000577278 0.0388845 -0.0129362
+-0.0178004 0.121647 -0.00876548
+-0.0516521 0.0334655 -0.0091126
+0.0221612 0.0754835 0.0496518
+-0.0384539 0.162349 0.000413916
+-0.0711225 0.0388168 0.00193457
+0.0334725 0.0950337 -0.0145821
+-0.00505247 0.102417 0.0438081
+0.0159216 0.0348476 0.0287894
+0.0277666 0.0347822 0.00749516
+-0.0675802 0.144972 -0.0192338
+-0.0477088 0.132967 0.0228963
+-0.0134912 0.0386664 0.0301779
+-0.0590273 0.134027 -0.00648451
+0.0244484 0.124114 0.020115
+0.0218798 0.0374214 -0.00364164
+-0.0658775 0.102439 -0.0164403
+-0.0743971 0.166132 -0.0206985
+-0.0634619 0.0339766 0.015084
+-0.0497324 0.138579 0.00441928
+-0.00151689 0.0428507 0.0468014
+0.00660528 0.0935786 -0.0311099
+-0.0862444 0.0819176 0.00849345
+-0.0634827 0.0876134 0.0450541
+0.0182388 0.0763952 -0.028136
+-0.0765343 0.0681368 0.0143622
+-0.092883 0.116038 0.0143172
+0.000494981 0.0442085 0.0460563
+-0.0518518 0.0970732 -0.0222063
+-0.0248173 0.0693751 0.0448313
+-0.089421 0.135156 0.0282104
+-0.0566159 0.0573558 0.0107416
+0.0312695 0.0800594 -0.0199503
+-0.03437 0.0738393 -0.0214808
+0.0226051 0.113885 -0.0127298
+-0.0658838 0.16421 -0.0204509
+-0.0417953 0.0435116 -0.0223513
+-0.0710782 0.156778 -0.0439119
+0.00348525 0.108604 0.0422849
+-0.0239399 0.118058 -0.0129545
+-0.0498545 0.0999668 -0.0218887
+0.0176793 0.0852191 -0.0283526
+-0.0426623 0.0592741 -0.0122692
+-0.0642751 0.044386 -0.00129652
+-0.0456062 0.127883 0.0223049
+-0.0818286 0.147374 0.0384552
+0.0125066 0.10443 0.0450477
+-0.0763281 0.174543 -0.0415648
+-0.0144887 0.0387707 -0.00835843
+-0.00853122 0.0430617 0.0490142
+-0.0783677 0.176339 -0.0480853
+-0.0408918 0.109911 -0.0187996
+-0.0634329 0.159891 -0.0505847
+-0.0278615 0.0987172 -0.0237448
+0.0172353 0.0806842 -0.0288156
+-0.0768582 0.104852 -0.0089026
+0.0310274 0.118497 0.0197321
+0.0262422 0.122687 0.00652555
+-0.000524008 0.041433 0.0467891
+0.0292827 0.060879 -0.0197951
+0.00853553 0.0366751 -0.00931803
+-0.092315 0.125571 0.0312621
+-0.000472926 0.0972534 -0.0289903
+-0.0604964 0.0861621 0.0446513
+0.0117525 0.0432202 0.0447834
+-0.0738828 0.103582 -0.0116089
+-0.00249719 0.0488761 0.0505372
+-0.0307845 0.0580469 -0.0184096
+-0.00234994 0.125819 -0.00745455
+-0.0301636 0.153871 -0.00371356
+-0.0815418 0.0912589 0.0328461
+-0.0901131 0.132441 0.0382173
+0.037389 0.0476423 -0.00613109
+-0.0646684 0.155196 -0.0425404
+-0.0928057 0.124227 0.0372672
+-0.0297999 0.12434 0.000117203
+-0.032492 0.0746402 0.0409516
+-0.0555716 0.122697 0.0389476
+-0.0717789 0.154685 0.0298089
+-0.0930714 0.12018 0.0352857
+0.0144798 0.109585 -0.0180587
+0.00343169 0.0361267 -0.0240106
+-0.0288758 0.046967 -0.0262149
+-0.0616418 0.158426 -0.0235923
+0.0103202 0.0609665 -0.0299301
+-0.0910325 0.14477 0.0261671
+-0.083926 0.0775674 0.0187821
+-0.0575363 0.138153 0.0326058
+-0.0295 0.0703058 0.0395502
+-0.0217308 0.0626511 -0.0346671
+-0.0640717 0.164086 -0.0255357
+-0.063271 0.158522 -0.0165888
+0.0210264 0.0895934 -0.0248804
+-0.0731992 0.145774 -0.0148545
+-0.0334943 0.0803079 0.0415842
+-0.0862122 0.111364 0.0347412
+0.0338239 0.11087 -0.00547119
+-0.0135288 0.0458914 0.0493586
+-0.0643715 0.139866 -0.00735458
+-0.0568939 0.158351 0.00118769
+-0.0405106 0.151258 -0.00613685
+-0.00551608 0.110856 -0.0214408
+-0.0787639 0.0696569 0.0125705
+0.00378339 0.0381062 0.0251953
+-0.0650446 0.154908 -0.0437098
+-0.089228 0.114813 0.0276717
+-0.00277394 0.0797805 -0.0365537
+-0.0661523 0.136835 0.0429956
+-0.0434818 0.0902492 0.04268
+-0.0184702 0.0959697 0.0503933
+-0.0801387 0.142096 0.0454029
+-0.00485582 0.0989472 0.0508482
+-0.0336234 0.153659 0.000337049
+0.00250661 0.0924946 0.055168
+-0.0729484 0.132565 -0.00781242
+0.0194715 0.127423 0.0125674
+0.00484292 0.129473 0.025811
+-0.0576054 0.0658547 0.0344063
+-0.0502601 0.0543084 0.0166402
+-0.027407 0.0396009 0.0539527
+-0.0105297 0.0560622 0.0527517
+-0.0456126 0.0519231 -0.010201
+0.000501847 0.0590908 0.0549783
+-0.0569845 0.0535242 0.00365398
+-0.0671097 0.0432428 -0.000257978
+0.0214666 0.0975514 0.0465681
+-0.08997 0.132328 0.0399309
+-0.0761969 0.167972 -0.0410261
+0.0170202 0.121328 -0.0087569
+-0.0138948 0.17568 -0.0202542
+-0.0281655 0.17267 -0.018055
+-0.0638531 0.04136 -0.00615806
+-0.0348821 0.0342989 0.0153052
+-0.000342105 0.0380462 0.00257941
+-0.00749789 0.0898138 0.0570783
+0.028524 0.0808687 0.0448153
+-0.0331206 0.0356024 -0.0184705
+0.0043586 0.119499 -0.0147306
+0.0467625 0.0462832 0.0266316
+0.0368364 0.111573 0.0161776
+0.00851174 0.0799624 0.0552814
+-0.00244825 0.112634 -0.0193375
+-0.0235385 0.11268 0.0379979
+-0.0115345 0.0922826 -0.0359317
+-0.09304 0.122895 0.0392709
+-0.0271645 0.17563 -0.018169
+-0.0772929 0.117422 0.0514809
+0.0179164 0.102978 -0.02104
+-0.0709646 0.0754682 0.0373385
+0.0216627 0.126095 0.0176515
+-0.0640284 0.119984 0.047923
+-0.0444795 0.0874935 0.0436599
+-0.0893861 0.0943037 0.0204146
+-0.0720651 0.173384 -0.0385311
+-0.0894927 0.14204 0.0311659
+-0.0454987 0.120637 0.0275066
+-0.0250745 0.0954862 -0.0252675
+-0.0895496 0.13918 0.0132126
+0.0192289 0.0820148 -0.027672
+-0.0154803 0.0645289 0.0535158
+0.0164872 0.108442 0.0405002
+-0.00663864 0.115688 -0.0165748
+-0.0494985 0.104247 0.040228
+-0.0673252 0.149334 0.0390086
+0.0300883 0.0872505 -0.0203879
+-0.0278877 0.0633808 -0.0294488
+0.0182732 0.069417 -0.0291542
+0.0171905 0.116688 -0.0137466
+0.0502632 0.0713497 0.022405
+0.0350985 0.114043 0.00837763
+-0.0505103 0.0452467 0.0429196
+0.0302544 0.113856 0.0308506
+-0.0605348 0.0333568 -0.0034971
+-0.00390558 0.0383472 0.0143493
+0.0270583 0.122199 0.00683201
+-0.0241505 0.0378782 0.0124647
+-0.0606031 0.0352186 0.0442288
+-0.0906667 0.113308 0.0195238
+-0.00876475 0.075634 -0.0378123
+-0.0531345 0.0641573 0.0333061
+-0.0262078 0.123609 -0.00273748
+-0.0629032 0.154793 0.00389792
+0.00322165 0.0782734 -0.0348651
+-0.0232226 0.0950277 -0.0288098
+-0.0497962 0.0869626 -0.02172
+0.0239811 0.109404 -0.0139261
+-0.00287196 0.105931 -0.0223953
+0.00350624 0.0619975 0.0564502
+0.0152965 0.129062 0.00674245
+-0.0198254 0.120831 -0.00989132
+-0.0672111 0.0749069 0.0386416
+-0.0199192 0.0375867 0.0533971
+-0.0507132 0.054338 0.0146004
+0.0338375 0.109906 -0.00644408
+-0.052068 0.0531865 0.02764
+-0.0665349 0.0638845 0.0254353
+-0.0340904 0.160759 -0.0135462
+-0.0456409 0.0577841 -0.0117617
+0.0425336 0.0678584 0.0273676
+-0.0549188 0.148123 0.0275408
+0.0178543 0.0352284 0.0378786
+-0.0254848 0.100235 0.0442056
+-0.014497 0.0856418 0.0570702
+0.0151023 0.0860518 0.0518047
+-0.0616341 0.0628646 -0.00472902
+0.02366 0.0848996 0.0483924
+-0.0496187 0.054694 -0.00943972
+-0.0328776 0.105721 -0.0208169
+-0.0144506 0.103914 0.0432646
+-0.0248813 0.105869 -0.0225199
+0.024788 0.0591582 0.0445118
+-0.0159391 0.0999021 -0.023843
+-0.0539979 0.153168 0.0186815
+-0.0738816 0.120852 -0.00799698
+0.0296461 0.118491 0.000643936
+-0.0540045 0.13652 -0.00234857
+-0.0593798 0.0335176 0.00740926
+0.0366379 0.08347 0.0371909
+-0.0520867 0.151648 -0.00355308
+-0.0188227 0.0387965 0.0325596
+0.00898388 0.131012 0.0072855
+-0.0682589 0.154325 -0.0506473
+-0.0521805 0.0531921 0.0266366
+-0.0617514 0.175333 -0.0614739
+-0.0169338 0.185679 -0.0240586
+0.015477 0.103104 0.045929
+-0.0729148 0.0713134 0.0317175
+-0.0172476 0.114664 -0.0174436
+-0.0126734 0.0384579 0.00339052
+-0.0832791 0.0884633 0.0304387
+-0.0858155 0.103519 0.00339021
+-0.0146369 0.0466344 -0.0294365
+-0.0773163 0.098935 -0.0105842
+-0.0145015 0.0631456 0.0536787
+-0.0689178 0.0717538 0.0356819
+-0.0255986 0.0394109 -0.0291464
+-0.0623671 0.0719748 0.0386642
+-0.0301518 0.0360809 0.0236741
+-0.030565 0.0383245 0.0341404
+-0.0574984 0.0918591 0.045399
+-0.0861528 0.0951452 0.0274373
+-0.0644941 0.0412041 -0.00599039
+-0.0363521 0.126723 0.0183002
+0.00755707 0.10303 0.0452955
+-0.0396625 0.0399023 -0.0274567
+-0.0838382 0.11616 -0.00137187
+0.0166591 0.0349342 0.0324763
+-0.0647933 0.15319 -0.00116291
+0.00911841 0.110151 -0.0195223
+-0.0697747 0.155761 0.0260978
+0.045415 0.0763654 0.00219579
+-0.0127734 0.171309 -0.0186592
+0.00748545 0.0964088 0.0510363
+0.0125027 0.109886 0.0398286
+-0.0779306 0.0866645 -0.0115691
+-0.0830177 0.0951656 -0.00554205
+-0.0184064 0.186879 -0.0179354
+-0.0866419 0.0923952 0.0266005
+0.026251 0.103389 0.0398709
+0.0333357 0.116389 0.013468
+-0.0452756 0.131436 0.0105618
+-0.035474 0.0519266 0.0383228
+-0.0536233 0.0657097 0.0353836
+0.0013977 0.0433563 -0.0248502
+0.0269244 0.118903 0.0281816
+0.0395 0.055533 0.0316092
+-0.0723024 0.111428 0.0467445
+-0.0364387 0.0357946 -0.0155844
+-0.0276413 0.159598 0.000270855
+-0.00596208 0.0394 0.0364646
+-0.00479094 0.0798443 -0.0373862
+-0.00779065 0.130523 0.0125627
+-0.0464848 0.12067 0.0277891
+-0.0645002 0.0889975 0.0448988
+-0.0896121 0.0902414 0.0154476
+0.0130231 0.0965172 -0.0241956
+-0.0452605 0.0391077 0.0445023
+0.0587398 0.0709245 0.0152557
+-0.0596114 0.0726835 0.0404064
+0.0240499 0.0348797 0.0195293
+-0.0682817 0.156606 -0.0532672
+0.0178388 0.104825 -0.0190099
+-0.0288938 0.180785 -0.00982491
+0.0323759 0.0738626 -0.0187418
+0.0314474 0.112439 -0.00717966
+-0.074091 0.144362 -0.00888576
+0.0510178 0.0461394 0.00424124
+0.00750963 0.0646928 0.0554932
+-0.0643093 0.0665984 0.0323388
+0.0133515 0.0566849 -0.029233
+-0.0243216 0.10004 -0.0240037
+-0.00749239 0.096543 0.0535421
+-0.00533786 0.0388247 -0.000985585
+-0.0884258 0.0996766 0.0213895
+-0.0320326 0.0609937 -0.0164107
+0.0535495 0.0533436 -0.000784809
+0.0393899 0.0533602 -0.00667374
+-0.0717205 0.168577 -0.0240459
+-0.0704919 0.126012 0.052539
+-0.0388888 0.109926 -0.019043
+-0.0507025 0.140081 0.0193694
+-0.0263231 0.034658 0.0434735
+0.0398861 0.0766416 0.0330246
+-0.0941682 0.126929 0.0222624
+-0.0117712 0.0770642 -0.0382004
+-0.0417668 0.040639 -0.0243092
+-0.0517327 0.164109 0.00103678
+-0.0721705 0.158208 -0.0379206
+-0.0356893 0.0651361 -0.0144415
+-0.065143 0.156205 -0.00860924
+0.00354988 0.0342019 -0.0174252
+0.00312416 0.107287 -0.0203844
+-0.0340011 0.127005 0.00589371
+-0.0418419 0.09571 -0.0225712
+-0.0333161 0.126997 0.0105451
+-0.0717391 0.165925 -0.0182956
+0.0559734 0.0494153 0.0101945
+0.0174969 0.108466 0.0401752
+-0.0507291 0.133637 -0.00121966
+0.0083246 0.0581885 -0.03043
+-0.0711713 0.176467 -0.0550529
+0.0165931 0.100464 -0.0223776
+-0.0544905 0.0862124 0.0452239
+-0.0574075 0.0649991 0.0334306
+0.0195092 0.092819 -0.0242669
+-0.0856512 0.0899172 -0.000541045
+0.0081342 0.104445 -0.020865
+-0.0752567 0.160324 -0.0108988
+-0.0376087 0.118212 -0.0130418
+-0.055019 0.14719 -0.00165707
+-0.04909 0.0628007 0.0352845
+-0.018783 0.0770899 -0.0389016
+-0.0336421 0.175583 -0.0129563
+-0.082659 0.0871422 0.0312687
+-0.0621779 0.061949 0.0245023
+-0.0782836 0.162467 -0.0289415
+0.0339055 0.0599168 -0.014725
+-0.0414124 0.128336 0.00169512
+-0.0398827 0.035133 -0.0101165
+-0.00781609 0.0854881 -0.0377912
+0.0082433 0.13138 0.00986533
+-0.0358714 0.105673 -0.0204021
+0.00749975 0.0589567 0.0535286
+-0.072631 0.0670284 0.0231935
+0.0525192 0.0691267 0.0251103
+-0.0688901 0.0621533 0.0194032
+-0.0824666 0.11008 0.0383967
+-0.0438038 0.0884337 -0.0219011
+-0.00534725 0.0379464 -0.0151277
+-0.0425045 0.0478596 0.0401075
+0.0214753 0.11175 -0.0144217
+-0.000497779 0.0489051 0.0509033
+0.0236032 0.116718 -0.00979024
+-0.0648062 0.0852609 -0.0190538
+-0.0395435 0.101505 0.0409276
+0.0209425 0.124573 -0.000263497
+-0.0286807 0.0383267 -0.00339493
+-0.0585081 0.0422988 0.0170665
+-0.0316383 0.0367739 0.0511824
+-0.085482 0.104867 0.00337403
+-0.00926648 0.100073 0.0477845
+-0.00448593 0.118295 0.0389891
+-0.0377467 0.0768482 -0.0188928
+-0.0640837 0.156142 0.0179222
+-0.0515285 0.144709 0.0153879
+-0.0267903 0.0866521 -0.0358137
+-0.0626407 0.163129 -0.0295903
+-0.00752629 0.0443832 0.0481509
+-0.0750304 0.169881 -0.0295693
+-0.0907748 0.12133 0.00629364
+0.0164129 0.0417834 -0.0225068
+-0.0317772 0.169741 -0.00573949
+-0.0546238 0.0527377 0.0100793
+0.0453589 0.0561811 -0.00597324
+-0.0651505 0.0366918 0.0402161
+-0.032507 0.108409 0.0384637
+0.0185107 0.108486 0.0398481
+0.0450172 0.0749324 0.00120229
+0.00251449 0.0702821 0.0560425
+-0.0434424 0.160833 0.00573037
+0.056541 0.064854 0.0254614
+-0.0648306 0.156078 0.013307
+-0.00545884 0.111961 -0.020621
+-0.0222505 0.0336283 -0.0219672
+-0.0319114 0.16826 -0.00591385
+0.0045246 0.0828376 0.0569094
+-0.0849678 0.0844642 -0.00152644
+0.0277057 0.120723 0.00280565
+-0.0133613 0.182397 -0.0284169
+-0.0569294 0.13993 -0.00415472
+-0.0104844 0.118266 0.038122
+-0.0725121 0.144203 0.0447958
+-0.0661037 0.0713259 0.0366501
+-0.050851 0.138527 0.021367
+-0.0580927 0.0577897 0.0147789
+-0.0157117 0.033701 -0.0245127
+-0.00261732 0.0341102 -0.0185505
+-0.0614975 0.10975 0.0377559
+0.00661243 0.131425 0.00784474
+-0.0602206 0.142504 0.0358229
+0.0126673 0.104052 -0.020179
+-0.0624955 0.0904382 0.0452713
+0.0164839 0.0699861 0.0519409
+-0.0334933 0.0946149 0.0444857
+-0.0904058 0.114907 0.0416618
+-0.0182558 0.178619 -0.0243596
+-0.0436529 0.0346111 0.0345638
+-0.00297107 0.0340356 -0.0204416
+-0.0246065 0.0394112 -0.0290873
+-0.0257404 0.0712076 -0.0359148
+-0.0285156 0.0433359 0.0513164
+0.0262381 0.119658 0.0279158
+-0.0734823 0.0649094 0.0160661
+0.0249492 0.109234 -0.0137375
+-0.0651326 0.157423 -0.0100634
+-0.0578906 0.0600472 -0.00173427
+-0.0868853 0.0847213 0.0144753
+-0.0610173 0.135506 -0.00686914
+0.0547011 0.0728313 0.00929699
+0.00513733 0.104474 -0.0214038
+-0.0199542 0.180019 -0.0229778
+0.022195 0.0344915 0.00477409
+-0.0509846 0.123023 -0.00999375
+0.0173702 0.0506958 -0.0254566
+0.0327797 0.0727287 0.040356
+-0.0376189 0.0505906 -0.0108802
+-0.057408 0.0521648 0.00264452
+-0.0845698 0.111358 0.0279354
+0.045113 0.0861573 0.00219478
+-0.0694333 0.0348816 0.0112742
+-0.0621334 0.15599 0.0157191
+0.0379075 0.0398433 0.0233434
+-0.0695824 0.180796 -0.0534457
+0.00287682 0.0368053 -0.01432
+0.0592296 0.0635939 0.00512091
+-0.0326951 0.0680731 -0.0204474
+-0.017619 0.161286 -0.0140538
+-0.00121244 0.0358159 0.011737
+-0.0485025 0.167013 -0.00296472
+0.0139694 0.0974449 -0.0231882
+0.0336763 0.102539 -0.0125747
+-0.0769165 0.147253 -0.00586064
+-0.0894763 0.140666 0.0321759
+-0.079441 0.139988 0.0475582
+-0.019773 0.0742847 -0.0390372
+-0.066871 0.0626922 0.0228964
+-0.0473301 0.134807 0.0120125
+0.0244991 0.106997 0.0390493
+0.0296386 0.114736 0.0306143
+0.0275719 0.0433403 0.0342886
+-0.0524918 0.107066 0.0397432
+-0.0544973 0.0427375 0.0458563
+-0.0837407 0.129905 0.0507752
+0.0390362 0.108381 0.0141662
+0.0136873 0.0685864 0.0531495
+-0.0780988 0.162499 -0.0239377
+-0.0804325 0.078146 0.029561
+-0.0720693 0.0709772 0.0321852
+-0.036497 0.0903135 0.0436162
+-0.0157593 0.121529 -0.00864145
+-0.0640118 0.135519 -0.00771971
+-0.0096474 0.0481504 -0.030386
+-0.0889991 0.11248 0.0367803
+-0.0718704 0.117956 -0.00810673
+-0.00253303 0.110473 -0.0210263
+-0.0151271 0.118705 -0.0137294
+-0.0533766 0.126536 -0.00565695
+-0.050165 0.0501393 0.0176523
+-0.0617795 0.126914 0.0422805
+-0.0077906 0.079881 -0.0380243
+-0.0181903 0.172708 -0.0227977
+0.0362974 0.0657667 -0.0137187
+-0.0193672 0.122992 0.0288371
+0.0118921 0.127946 0.0270512
+-0.0528594 0.0344415 0.0327571
+-0.0440834 0.0344755 0.0328349
+0.00820576 0.0343954 0.0203732
+-0.0384853 0.0819001 0.0436414
+0.0279153 0.112797 -0.00956049
+-0.0233818 0.177171 -0.0128784
+0.00211138 0.110155 -0.0201605
+-0.0214231 0.0385184 -0.00765668
+-0.0590379 0.13549 -0.00623086
+-0.0654804 0.152163 -0.03833
+-0.0328363 0.0957996 -0.0235469
+-0.0574937 0.0333307 -0.00285911
+-0.0723124 0.154022 -0.038905
+-0.00125765 0.0383424 0.0470318
+0.022422 0.125761 0.0150782
+-0.0285891 0.0935252 -0.0252241
+-0.0395009 0.16971 0.00189803
+-0.0211973 0.0363196 0.0534993
+-0.0671438 0.037039 0.0145094
+-0.0455015 0.115241 0.0333765
+-0.0416597 0.057808 -0.0117566
+-0.0597745 0.0434652 0.0436848
+-0.0594246 0.0334838 0.00203125
+-0.0609255 0.122379 -0.00879585
+-0.0633414 0.0357702 0.0187502
+-0.0629834 0.0594485 0.00869517
+-0.0240199 0.0537379 0.0416895
+-0.0382462 0.044597 -0.024375
+-0.00732189 0.100225 -0.0241674
+-0.0425982 0.0463965 -0.0133084
+-0.0889045 0.133745 0.0416542
+0.00049898 0.0385943 0.0466363
+-0.0295864 0.0462965 0.0488628
+0.00439164 0.0448792 -0.025855
+-0.0608362 0.0341593 0.0278122
+-0.0547243 0.0723714 -0.0165135
+-0.0274694 0.155208 -0.00473974
+0.0246484 0.0713321 0.0461382
+0.0124372 0.0548875 0.0512192
+-0.00549842 0.0828666 0.0570203
+-0.0616148 0.0337181 0.0103501
+-0.0346312 0.0752701 -0.0214845
+-0.0629229 0.058915 0.0109817
+-0.0424386 0.147805 0.00141712
+-0.0363751 0.12414 0.0242241
+0.0176113 0.111464 -0.0161155
+-0.0314976 0.0603384 0.0380002
+-0.0138112 0.128252 0.0219818
+-0.0603076 0.0409502 -0.0078507
+-0.0735166 0.141431 0.0469479
+0.0326456 0.111384 0.0297678
+-0.0635438 0.0341847 -0.00786744
+0.02297 0.122414 -0.00191144
+0.0401375 0.0953636 -0.00688813
+-0.0141538 0.0965092 0.052175
+-0.00422659 0.0383846 0.0124357
+-0.0311024 0.0343581 0.019624
+-0.0780471 0.153854 0.029137
+-0.0581213 0.151582 -0.000807379
+-0.0267449 0.0725846 -0.0356647
+-0.0191918 0.174184 -0.0227992
+-0.00378536 0.0798194 -0.0370348
+-0.0249464 0.0349691 -0.0199992
+-0.0564664 0.0423189 0.0186897
+0.0266976 0.119444 -0.00271582
+-0.023525 0.0349287 -0.0283944
+-0.0800951 0.15261 0.00324045
+0.0268493 0.119915 0.0267269
+0.0354747 0.0390827 0.0235255
+-0.0127812 0.17424 -0.0204206
+-0.0338617 0.168258 -0.00349456
+-0.0144845 0.0744882 0.056153
+0.0261935 0.0402752 0.032238
+0.0102706 0.0681153 -0.0309054
+-0.00974239 0.0387292 0.0290909
+-0.0644512 0.125591 0.047275
+0.010367 0.0479585 -0.0270631
+-0.0246099 0.0984431 -0.024327
+-0.0476227 0.0370311 -0.0128189
+-0.0780422 0.0846436 0.0366002
+-0.0566171 0.135321 0.0339425
+-0.0556004 0.0505584 -0.00338763
+-0.0907186 0.136468 0.0172046
+-0.0245124 0.180278 -0.0098524
+0.00742535 0.0346722 0.0416328
+-0.0699342 0.0651273 0.0236486
+-0.0124071 0.172769 -0.0198823
+-0.041856 0.149196 0.00419837
+-0.0809107 0.103235 -0.00559799
+-0.0631328 0.0335051 0.0030611
+-0.00851461 0.0647289 0.0558918
+0.0154483 0.127759 0.0239281
+0.0255922 0.123349 0.0191129
+0.0138934 0.0631004 0.0516475
+0.00118569 0.0983354 -0.0261952
+-0.0325387 0.118791 -0.011658
+-0.000757843 0.0354065 0.0103826
+-0.0248998 0.158417 -0.0112592
+-0.035233 0.0374002 -0.014964
+-0.0541243 0.156074 -0.00260128
+-0.0584646 0.0588965 0.0024905
+-0.0615294 0.0333928 -0.00373148
+-0.0602915 0.0343294 0.0347628
+0.0265767 0.0994658 0.0420977
+0.0347214 0.0712416 -0.0157876
+-0.040399 0.128703 0.00942739
+0.00251855 0.096887 -0.0286022
+-0.076485 0.148385 0.0403892
+-0.0606115 0.155938 0.0148123
+0.010878 0.0806434 0.0544608
+0.0384784 0.105492 -0.00082855
+0.0438672 0.0916755 -0.00180444
+-0.0513529 0.0733082 0.0416893
+0.0451032 0.0777437 0.000209071
+-0.0817242 0.148679 0.0369003
+0.0461375 0.0834298 0.00718398
+-0.0514739 0.135214 -0.000924577
+-0.00531173 0.100039 -0.0239686
+-0.0176147 0.042187 -0.0278695
+0.00727636 0.114035 -0.0188609
+0.0268989 0.0632714 0.044083
+0.0102735 0.0924657 -0.0299319
+0.010651 0.121836 0.0349107
+0.00895558 0.0361581 -0.0106394
+-0.0905601 0.144393 0.0275534
+0.043756 0.0467626 0.0296361
+-0.0417806 0.126404 -0.00562318
+-0.0358424 0.095771 -0.0231986
+-0.0809037 0.153834 0.0267225
+-0.0777263 0.156926 -0.0159116
+0.00417967 0.034897 0.044357
+-0.0351879 0.125718 0.0201989
+-0.0284012 0.038721 -0.0148192
+-0.0351226 0.169652 -0.0145814
+-0.0203438 0.180146 -0.0154935
+0.0345359 0.11019 -0.00473263
+-0.0932568 0.121548 0.0382795
+-0.0334767 0.152548 -0.00159465
+-0.0271731 0.174192 -0.00959576
+0.0159989 0.11444 -0.0153318
+-0.054238 0.13299 -0.00459005
+0.0366798 0.105376 -0.00582172
+0.0386277 0.0672715 0.0346845
+-0.0227209 0.162682 -0.0153632
+-0.0760409 0.0677685 0.0130189
+0.00250507 0.0772798 0.0565792
+-0.0345053 0.101515 0.0417518
+-0.0546003 0.0541349 0.0100271
+-0.000643212 0.127926 -0.00376413
+0.00284904 0.131659 0.0150261
+-0.0184884 0.186846 -0.021092
+0.0335193 0.114014 -0.000843968
+0.00632048 0.123167 -0.0106939
+-0.0564752 0.0624455 0.0290854
+-0.0138322 0.105995 -0.0224296
+0.00423384 0.0754618 -0.0348642
+-0.0281096 0.0778495 0.0450018
+-0.0776289 0.158329 -0.0159141
+0.0148253 0.0447411 0.0439981
+-0.0859023 0.122521 -0.0027014
+-0.0578481 0.0940916 -0.0211113
+0.00150378 0.0842858 0.0575429
+0.0326379 0.0849202 0.042017
+-0.0549752 0.0499938 0.0105067
+-0.0568824 0.10976 -0.0175883
+-0.00970298 0.0627929 -0.0357349
+-0.0178968 0.163686 -0.0167578
+-0.074969 0.105672 0.0364824
+0.00650677 0.0702743 0.0558788
+0.00487604 0.0992462 -0.0230983
+0.042474 0.101514 0.0131646
+-0.0643723 0.0593574 0.0120942
+0.0593748 0.0580631 0.00716733
+-0.00149842 0.111423 0.0424113
+-0.00749339 0.119159 -0.0142858
+-0.0771313 0.0754374 0.0308061
+-0.0477996 0.0869772 -0.0218762
+0.014411 0.0833733 0.0525453
+-0.0202678 0.159643 -0.00488449
+-0.0159305 0.0950186 -0.0327431
+-0.0279294 0.0931359 -0.0265478
+-0.0855021 0.102147 0.00137916
+-0.0938092 0.125562 0.0252741
+-0.058744 0.140559 -0.00481674
+-0.031677 0.126244 0.00820251
+-0.0264922 0.0447022 0.0511549
+-0.0205862 0.0382221 0.00925741
+-0.053491 0.104292 0.0408761
+-0.0370674 0.156264 -0.0103696
+-0.0634966 0.109514 0.0378318
+-0.0867621 0.084687 0.0184803
+-0.0830364 0.104646 0.028271
+0.0442212 0.0804374 0.0252067
+-0.0448473 0.0339909 -0.0230279
+-0.0037539 0.0755488 -0.0365646
+-0.0661663 0.158028 -0.0551775
+-0.0238007 0.0741774 -0.0380398
+-0.018731 0.0627665 -0.0359648
+0.0446574 0.0720977 0.0012022
+-0.0927955 0.121487 0.0416389
+-0.0620012 0.1241 0.0437622
+0.0300963 0.0995295 0.0401727
+-0.0719316 0.149607 -0.0394232
+0.0355637 0.0889227 0.0392444
+0.0493081 0.0547033 -0.00484617
+-0.0668328 0.0604514 0.0106116
+0.00304719 0.123088 -0.0105402
+-0.0255191 0.118043 0.0319974
+-0.0394865 0.115305 0.0335817
+-0.0326614 0.0592947 -0.0125392
+0.0575508 0.0523393 0.00818574
+-0.0893959 0.0942918 0.0174254
+-0.0269084 0.160002 -0.0134029
+-0.0506856 0.0345547 0.0383582
+-0.0800885 0.0739226 0.0209531
+-0.0277305 0.073972 -0.0353872
+-0.0320496 0.0849187 -0.0285721
+-0.0217999 0.0866355 0.0553929
+-0.0322022 0.0465812 -0.0258568
+-0.0442317 0.12547 0.021384
+0.0214935 0.0781932 0.0504764
+-0.0444883 0.150664 0.00744383
+-0.0303843 0.0566029 -0.0193937
+-0.0723854 0.155427 -0.0359059
+-0.0245149 0.0811097 0.0540325
+0.0189031 0.068639 0.0501604
+-0.0650109 0.041163 0.0307556
+-0.0194954 0.107168 0.0420699
+-0.0325124 0.113906 0.0343195
+-0.0544418 0.118427 -0.0131672
+-0.0536811 0.113759 -0.0162997
+-0.0559476 0.153959 0.0252069
+-0.0675391 0.124252 0.0515729
+0.0440796 0.0450784 0.0271934
+-0.0594971 0.101543 0.0424741
+-0.0184988 0.100234 0.0438197
+0.0434554 0.0790039 -0.00377815
+0.0140981 0.0343905 -0.0079847
+-0.0615105 0.0406302 -0.00752326
+0.0320683 0.0578123 0.0392046
+0.0144666 0.0962642 0.0485999
+-0.0315047 0.0631978 0.0384961
+-0.0306251 0.038441 -0.00943325
+-0.0847861 0.0804507 0.00450965
+-0.0549519 0.160962 0.00433648
+-0.0470839 0.131413 0.00333034
+-0.00104546 0.0391448 0.0323048
+-0.0526926 0.151783 0.016281
+-0.0223808 0.0958588 0.045836
+-0.0841478 0.15365 0.0123539
+0.0536189 0.0735747 0.0133449
+-0.00350831 0.0975151 -0.0292875
+-0.0571277 0.155869 0.0117051
+0.00341369 0.131576 0.0166618
+-0.0237378 0.0654511 -0.0345337
+-0.0858145 0.0991904 0.0269676
+-0.0759199 0.0783227 -0.00959072
+0.032684 0.0640121 -0.0177767
+-0.056282 0.132113 -0.00567386
+0.00328959 0.131137 0.0194851
+0.00882643 0.110931 -0.0195298
+-0.00876485 0.1716 -0.0262973
+-0.0151483 0.0405525 0.0515137
+-0.0498071 0.0343093 0.00865348
+-0.0569766 0.0339283 0.0235563
+-0.0226683 0.0381298 0.00891697
+-0.0855438 0.106245 0.00446783
+0.0454924 0.0651146 0.027904
+0.0150017 0.0576648 0.0496654
+0.00644791 0.119491 -0.0147367
+-0.0156486 0.0481142 -0.0300898
+-0.0650134 0.13537 0.0410634
+0.0113952 0.116794 -0.0158535
+0.0173388 0.0781757 0.0532571
+0.0536226 0.0587546 -0.00269037
+-0.0709897 0.0340252 0.000991695
+0.038384 0.106978 0.0241932
+-0.0385431 0.038993 -0.0286239
+-0.0451337 0.127804 0.0210049
+-0.0690676 0.152436 0.0353067
+-0.0883368 0.137775 0.00920322
+-0.0714828 0.0362083 0.00943052
+-0.0717062 0.159603 -0.040933
+-0.0255949 0.125933 0.00752005
+-0.047874 0.0346487 0.0423594
+0.0367516 0.111162 0.00316661
+-0.00949217 0.110042 0.0428369
+-0.0572015 0.0336196 0.0184714
+0.0150246 0.0392642 0.0442415
+-0.00832489 0.0993422 -0.0252442
+-0.0304761 0.0342807 0.0180201
+-0.026997 0.0382812 -0.00486026
+-0.0916784 0.144722 0.0181573
+-0.0703317 0.172249 -0.0530308
+-0.0159101 0.1643 -0.0176565
+-0.0850976 0.106195 0.00337687
+-0.035284 0.173981 -0.0126295
+-0.032733 0.155408 -0.00943888
+0.00217615 0.12934 0.0262849
+0.00123579 0.075497 -0.0355058
+-0.0332024 0.0455956 -0.0269373
+-0.0155006 0.103015 0.0432792
+0.0396392 0.106988 0.00416547
+-0.021523 0.118151 0.0342827
+-0.0184974 0.103009 0.0434402
+-0.047784 0.038449 -0.0122332
+-0.0104903 0.0604984 0.0550813
+0.0293518 0.0659692 0.0423806
+0.0185572 0.0930309 -0.0244868
+0.0173756 0.109987 -0.0165543
+-0.0865489 0.109072 0.0153468
+0.0363255 0.10537 -0.00683316
+-0.0394998 0.076195 0.0426907
+-0.0603651 0.0470889 0.0366883
+-0.0144951 0.119623 0.0361429
+0.0406661 0.105634 0.0121644
+0.0383891 0.0460848 -0.00524865
+0.0295409 0.0942529 0.0428642
+0.0373159 0.0880544 -0.0152271
+-0.0784316 0.0799342 0.0337318
+-0.0548348 0.124111 0.0382711
+0.0178682 0.0672532 0.0504022
+-0.0788979 0.123682 -0.00614143
+-0.0298552 0.0986755 -0.0232224
+-0.0771653 0.156191 -0.0114635
+-0.0923833 0.130942 0.0122392
+-0.0651094 0.121429 0.0498115
+-0.042493 0.0690949 0.0416622
+0.0416337 0.0792551 0.0303335
+0.0189066 0.0808659 0.0520326
+-0.029145 0.125694 0.0135548
+-0.0619967 0.14761 -0.00462246
+0.0255017 0.0449453 0.0383425
+-0.0925798 0.11747 0.0343056
+-0.00233027 0.0339229 -0.0220991
+0.00799401 0.0819204 0.0555296
+-0.0699548 0.147947 -0.0321477
+0.0415131 0.0394077 0.00724875
+-0.0712173 0.0846981 0.0410753
+-0.0880447 0.0874003 0.00446864
+0.00798497 0.0890814 -0.0324293
+-0.0117258 0.0656807 -0.0365783
+-0.0114796 0.112753 0.0411508
+-0.0817304 0.107364 -0.00260486
+-0.0293156 0.0820403 0.0446588
+-0.0495645 0.0375773 -0.0119604
+-0.043838 0.0956679 -0.0221641
+-0.00869681 0.129559 0.00358698
+-0.0933816 0.129671 0.0222434
+-0.0700603 0.163804 -0.0489659
+-0.00755399 0.0384559 0.0207545
+0.0159604 0.125249 0.0284184
+-0.0514974 0.0791051 0.0438079
+-0.0840796 0.0818676 0.0264914
+0.037525 0.0785071 -0.0127982
+0.0299804 0.119686 0.0179058
+-0.0638039 0.0881523 -0.0190251
+-0.0272788 0.0350567 0.0515587
+-0.00562089 0.115673 -0.0165634
+-0.0104428 0.0347186 0.0450504
+-0.0427898 0.116428 -0.015168
+0.0165768 0.126998 0.000104849
+-0.0238911 0.0738255 0.0493988
+-0.0485539 0.0376116 -0.0123218
+-0.0396922 0.0460798 -0.021311
+-0.0485652 0.0335345 -0.00306359
+0.0414749 0.104231 0.00716597
+-0.0445241 0.0409237 -0.0192998
+-0.0220397 0.0354083 0.0523916
+-0.0380711 0.0340829 0.00944176
+0.0139247 0.0348347 0.0392218
+-0.0297288 0.0335868 -0.0252735
+-0.00107263 0.0385746 0.00195199
+0.0117524 0.0352863 0.00381322
+0.0170772 0.0847646 0.051153
+-0.0656775 0.067321 -0.00750664
+-0.00543271 0.0918052 -0.0353894
+0.0133691 0.0343357 -0.00620151
+0.0451372 0.0875619 0.0011816
+0.0503362 0.0703636 0.0239238
+-0.0474927 0.0804818 0.0437565
+-0.00542063 0.0391587 0.0349931
+0.00193935 0.03568 -0.0153447
+-0.0774115 0.160346 -0.0169397
+0.049877 0.0727457 0.00893584
+-0.0640788 0.0598458 0.0171155
+-0.00650105 0.0472142 0.0482843
+-0.0241121 0.163789 -0.0160029
+-0.0173263 0.0611887 0.051725
+0.0171559 0.100271 -0.022436
+-0.0604932 0.155795 0.0206537
+-0.0609595 0.142497 0.0365005
+-0.0668489 0.0966702 -0.0167929
+-0.0149394 0.183104 -0.021718
+-0.0321779 0.0750041 -0.0285287
+-0.0226305 0.0710127 0.0496427
+0.0463117 0.0820487 0.00917902
+-0.0795939 0.112319 0.0461682
+-0.0658419 0.0995396 -0.0165139
+-0.0810165 0.134048 0.0507919
+-0.0486855 0.131027 0.0278379
+-0.0788429 0.112725 -0.00283498
+-0.0784933 0.0832425 0.0356821
+-0.0258381 0.0781035 0.0498012
+0.0426426 0.0858997 0.0283401
+-0.0677549 0.154168 0.0312275
+-0.0306743 0.0383989 -0.00386137
+-0.0857757 0.0926386 -0.000557841
+-0.0210104 0.0417331 0.053591
+0.0161529 0.100264 -0.0224296
+0.0387814 0.0821002 0.0350599
+0.0484193 0.0639761 -0.00211304
+-0.0858985 0.111778 0.0253403
+-0.0389634 0.128304 0.0114309
+-0.0634823 0.0352819 -0.00824664
+0.0395163 0.0646366 -0.0087647
+-0.0591064 0.0435686 0.0148077
+0.00621882 0.12419 0.0335647
+-0.0171539 0.0347559 0.0453522
+-0.0314811 0.0546225 0.0370229
+-0.0182701 0.114743 -0.017523
+-0.0605388 0.141029 0.0353291
+-0.063605 0.126943 0.0449774
+-0.03749 0.0533987 0.0390423
+-0.0573191 0.0507885 0.00568774
+-0.0424884 0.109818 0.0380938
+-0.082569 0.0790202 0.0265184
+-0.0653913 0.0757553 0.0400472
+-0.0105137 0.0589924 0.0541839
+0.0198393 0.0700116 0.0497622
+-0.0814721 0.135361 0.0497671
+0.00809889 0.111578 -0.0196036
+-0.0276072 0.038217 0.0294729
+-0.0647783 0.173212 -0.0488362
+-0.0760415 0.0675654 0.00655947
+-0.0322855 0.0610195 -0.0154117
+-0.00948933 0.0674612 0.0553354
+-0.0922478 0.11733 0.00930597
+0.0325339 0.116751 0.00316678
+-0.0788837 0.117794 -0.00533035
+0.0177807 0.10571 -0.0179484
+-0.0648315 0.0895741 -0.0187043
+-0.0303114 0.0384164 -0.0075003
+-0.0728418 0.0685704 -0.00149472
+0.0396278 0.103602 -0.00160767
+-0.0575003 0.109781 0.0378101
+-0.0359224 0.034124 0.026018
+-0.0230844 0.126658 0.00843513
+-0.0904612 0.131068 0.0382266
+-0.0782718 0.165861 -0.029036
+0.0284552 0.0607955 -0.0208488
+-0.0495337 0.163976 0.00447865
+-0.0665318 0.134006 0.0442059
+-0.0622043 0.0590015 0.0092504
+0.0124693 0.0962821 0.0494059
+0.0199668 0.115907 -0.0129188
+-0.0101559 0.0386047 0.027311
+-0.0224495 0.0580629 0.0442448
+-0.0768471 0.09916 -0.0110394
+-0.0438495 0.0999429 -0.0214407
+-0.0642587 0.173261 -0.0500973
+-0.0291541 0.123106 -0.00418201
+-0.0785185 0.16527 -0.0289621
+-0.0773807 0.0774654 0.0325309
+0.0184997 0.0892768 0.0486726
+-0.0147168 0.0628748 -0.03682
+0.0133075 0.062355 -0.0296823
+0.0174899 0.111215 0.038757
+-0.0829923 0.130939 -0.00341376
+-0.0749763 0.152739 -0.0169005
+-0.00979029 0.0798633 -0.0379189
+-0.0243904 0.183518 -0.0110527
+0.0382626 0.0899111 -0.0131489
+0.0353274 0.107617 -0.00596632
+-0.0649093 0.06918 0.0352438
+0.0545625 0.0595427 0.0278248
+-0.0664402 0.128427 0.0478848
+0.0302544 0.035019 0.00964843
+-0.0212084 0.186026 -0.0155815
+-0.00559653 0.0391515 -0.0257085
+-0.00382316 0.0854518 -0.0372434
+0.0556932 0.0688929 0.00299188
+0.0435925 0.0958855 0.00119521
+-0.061875 0.156868 -0.0195857
+-0.0283944 0.174224 -0.00779385
+0.000326986 0.131385 0.00837406
+0.0583787 0.0621209 0.00318289
+0.0262357 0.0740751 0.0449841
+-0.0747322 0.0729443 0.0316828
+-0.0650821 0.148822 -0.0290175
+-0.0436469 0.0601588 0.0398932
+0.0443703 0.0410834 0.0161644
+-0.0674507 0.155183 -0.000720573
+-0.0165017 0.177176 -0.0187481
+0.0352588 0.0755049 -0.0148105
+0.00551455 0.110936 0.0415028
+0.0248664 0.0898261 -0.023121
+0.00550646 0.078617 0.0558754
+-0.0698407 0.127049 0.051763
+-0.0375072 0.123454 -0.00854988
+-0.052616 0.0657163 0.0355847
+-0.0748963 0.0690517 0.0244939
+0.023431 0.11936 -0.00662051
+-0.0185076 0.120924 0.0327413
+0.0394332 0.101324 0.027167
+-0.00864992 0.124983 -0.00848236
+-0.0872247 0.152479 0.0216964
+-0.0215688 0.0623472 0.0460467
+-0.0475797 0.035695 0.0449374
+-0.0510737 0.151654 -0.00393732
+-0.0415 0.0930514 0.0423592
+-0.0544965 0.100156 0.0427594
+0.049267 0.0717276 0.00605578
+0.0292141 0.0815364 -0.0209002
+-0.0052585 0.095242 -0.0329133
+0.0151527 0.129419 0.0109697
+-0.0294996 0.100187 0.0432585
+0.0363367 0.0432226 0.0290731
+0.0327757 0.035977 0.0148418
+0.00349523 0.0427434 0.0456833
+0.046121 0.0848311 0.00917504
+-0.067462 0.157723 -0.00658264
+-0.0876012 0.0995367 0.00546504
+-0.0356487 0.0352259 -0.0310792
+-0.0585981 0.0658974 0.0341563
+-0.0639239 0.116652 -0.0103062
+-0.0525394 0.0472909 -0.00733632
+-0.0398304 0.034299 0.0303636
+0.0252131 0.0803965 -0.024704
+-0.0721022 0.165224 -0.0439746
+-0.058758 0.148538 -0.00150368
+-0.0625812 0.150647 -0.00957658
+-0.0878641 0.137757 0.00720039
+0.0109534 0.0475021 0.0472035
+-0.0699012 0.105141 -0.0130553
+0.0318353 0.0540522 -0.0127622
+-0.0866591 0.107689 0.0123597
+0.0552547 0.0595292 0.0270628
+0.0320484 0.11465 0.0272407
+0.0433462 0.0818009 -0.00379375
+-0.0294668 0.176906 -0.0160057
+-0.0169961 0.094658 0.0531741
+-0.0202578 0.0596247 0.0476545
+-0.0798939 0.123658 -0.00558813
+0.0482025 0.0703533 0.0231278
+-0.0206189 0.186125 -0.0151754
+0.0100127 0.0349584 -0.0111996
+-0.0661914 0.152591 -0.0424622
+-0.0478408 0.098515 -0.0219326
+0.026913 0.0619271 0.0440949
+-0.0328507 0.126562 0.0151396
+-0.0689146 0.108019 -0.0123122
+-0.00583756 0.0390351 0.0332216
+-0.0125377 0.0365668 -0.017148
+-0.0373858 0.0446552 0.0411638
+-0.0759006 0.161818 -0.014334
+0.0304033 0.107421 -0.0117891
+-0.0654084 0.175187 -0.050486
+-0.0633716 0.143922 0.0382956
+0.0194957 0.0920261 0.0477827
+-0.0288404 0.0972702 -0.0238091
+-0.00475508 0.0741241 -0.036385
+-0.0104985 0.0362063 -0.0254961
+-0.0625516 0.147537 -0.0115723
+-0.0816708 0.0869142 -0.00660013
+-0.00823999 0.130343 0.0167173
+-0.0809733 0.130966 -0.00434035
+-0.0437659 0.0811743 -0.0201658
+0.00743904 0.129465 0.0253135
+-0.00451238 0.0760575 0.0586977
+0.0302883 0.103408 0.0369471
+-0.0379006 0.151906 -0.00621808
+-0.00550346 0.076042 0.0585145
+-0.0217032 0.0597401 -0.0334972
+-0.0868755 0.112781 0.0262639
+-0.0336701 0.155604 -0.00983793
+-0.0126927 0.0599517 -0.0357172
+-0.0638978 0.150075 -0.0288161
+-0.0144059 0.112046 -0.0186792
+-0.00421023 0.0383902 0.0178766
+-0.0453052 0.113634 -0.0162273
+0.0147972 0.102084 -0.0220848
+-0.0484999 0.105649 0.0400819
+0.0216294 0.0875507 0.0490393
+-0.0124184 0.175705 -0.0216387
+-0.0328373 0.163842 -0.00376818
+-0.0666614 0.0672261 -0.0064803
+-0.0395052 0.119385 0.0302298
+-0.0489243 0.0675117 0.0383488
+-0.0552807 0.0343936 0.0305403
+0.00553119 0.0603997 0.0554086
+-0.0914264 0.14884 0.0201323
+0.0231929 0.110938 -0.0135659
+-0.065154 0.164972 -0.0244937
+-0.050496 0.074792 0.0427038
+-0.0657515 0.154274 -0.0462128
+-0.0343486 0.0367995 -0.0305331
+-0.0826303 0.103323 0.0293175
+-0.0597443 0.0338929 0.0194732
+-0.0425056 0.0591222 0.0401769
+-0.0743438 0.156862 -0.0249223
+-0.00222977 0.0396912 0.0474006
+-0.00562206 0.0388337 0.0298422
+-0.0338556 0.0723894 -0.0214737
+-0.0635465 0.0333817 0.00128463
+-0.0330138 0.0356955 0.0305887
+-0.0730865 0.16659 -0.0202232
+-0.0570856 0.153101 -0.000954757
+0.0275543 0.0960379 -0.019637
+-0.0229677 0.169763 -0.0123298
+0.0217819 0.106251 -0.0165369
+-0.0575003 0.0630187 0.0298519
+-0.00864981 0.171144 -0.0247734
+-0.053919 0.0587242 -0.00741756
+-0.0595 0.105675 0.0404663
+0.0351077 0.0740897 -0.0147891
+-0.0620479 0.155306 -0.016587
+0.0278721 0.0522836 -0.0197543
+0.0325208 0.0469245 0.0310812
+-0.06629 0.139698 0.0427919
+-0.078132 0.172939 -0.0407193
+-0.0294988 0.0559628 0.0364214
+-0.0374897 0.0562507 0.0395531
+-0.0662219 0.155662 0.00991681
+-0.0408786 0.0346362 0.0386374
+-0.0208999 0.185581 -0.0139755
+-0.0330517 0.0624982 -0.0144201
+-0.0767419 0.164619 -0.0220172
+-0.0697905 0.0865423 -0.0170841
+-0.0784816 0.0755217 0.0287043
+0.0172033 0.118701 -0.0119316
+-0.0185134 0.0473863 0.05026
+0.00729554 0.0653986 -0.0323322
+-0.0415011 0.0506114 0.0394281
+-0.0541424 0.033642 0.0190888
+-0.0921005 0.132392 0.0222257
+-0.0136741 0.0384938 0.00315386
+-0.0383322 0.163825 0.00056966
+-0.0762889 0.0738479 0.0305832
+-0.0875285 0.133568 0.00229932
+-0.0736181 0.0688668 0.0266732
+0.02687 0.0981666 0.0425225
+-0.051308 0.153569 0.0116824
+4.86222e-05 0.11836 -0.0154829
+-0.0517937 0.0583908 0.0296448
+0.0605105 0.0595417 0.010156
+-0.0573945 0.0371513 -0.0102727
+0.00965733 0.0345667 0.0223294
+0.0463647 0.0703187 0.00350637
+-0.0625718 0.1468 0.0377209
+-0.089178 0.137924 0.0381661
+-0.0134956 0.0759117 0.0568004
+-0.00574286 0.0755721 -0.037104
+0.0261865 0.123233 0.0107875
+-0.0580499 0.11553 -0.0140963
+-0.00762589 0.0451743 -0.028662
+0.0535357 0.0635428 0.028124
+-0.0718987 0.123811 -0.00847645
+-0.0635357 0.119961 0.0469254
+0.00211859 0.130671 0.0219319
+0.00252859 0.0358017 0.021576
+0.0527591 0.0693467 0.00250314
+-0.0451218 0.0335948 -0.0116042
+-0.0769111 0.100434 -0.0105662
+0.0223237 0.0564658 -0.026195
+0.0394644 0.107011 0.0181712
+-0.0776021 0.0994637 0.0357144
+-0.0632381 0.170981 -0.0495819
+-0.00862433 0.122038 -0.0113292
+-0.0548269 0.0450002 0.0157095
+-0.0506815 0.134691 -0.000340536
+-0.0495888 0.146296 0.0105853
+-0.00908464 0.173025 -0.027717
+-0.00410488 0.0346022 0.0429088
+-0.0260906 0.0386266 -0.0124061
+0.0283176 0.118208 -0.00273298
+-0.0318098 0.121167 -0.00811427
+-0.0737276 0.154081 -0.027902
+0.0162665 0.119939 -0.0112703
+-0.0270805 0.0349584 0.0482667
+-0.0284917 0.101554 0.0428228
+-0.0249764 0.159657 -0.0011434
+-0.0585904 0.142433 0.0328417
+-0.0486888 0.138617 0.0104009
+-0.0234979 0.0724108 0.049066
+-0.019247 0.158526 -0.00845424
+-0.0716194 0.0382939 0.000706648
+-0.0412769 0.0356814 0.042879
+0.0483353 0.0532726 -0.00489034
+0.0606695 0.0664968 0.0121468
+-0.069489 0.104131 0.0386578
+0.00750734 0.0990008 0.0480837
+-0.0624532 0.126929 0.0430601
+-0.0629568 0.15367 -0.0336031
+-0.0374985 0.0747273 0.041938
+0.0426086 0.0930422 0.0261716
+-0.0849422 0.153595 0.0209155
+-0.0543959 0.12661 -0.00573734
+-0.0742502 0.161028 -0.0329547
+-0.0627767 0.112367 0.0371562
+-0.0532977 0.158553 0.00873827
+-0.0769168 0.123731 -0.00719316
+0.0393533 0.0847596 0.0341247
+-0.0692244 0.15634 0.0190049
+0.0343018 0.0936044 -0.01506
+-0.0165008 0.0800909 0.0572191
+-0.014166 0.184338 -0.0242563
+-0.0631574 0.159924 -0.0465929
+-0.0374857 0.0519831 0.0389557
+0.03646 0.112262 0.0117392
+-0.0411413 0.0364371 -0.0278037
+0.0185712 0.126949 0.0207922
+-0.0603223 0.0385556 0.0217181
+-0.0769591 0.131054 -0.00672048
+-0.0295123 0.0565107 -0.0214026
+0.0430875 0.0930739 0.0251589
+-0.00582403 0.0390405 -0.0106025
+-0.0553855 0.0337802 0.0222515
+0.014479 0.100435 0.047468
+-0.0548752 0.0984577 -0.0213117
+-0.0501571 0.0529434 0.0176286
+0.0183573 0.0461568 -0.0227219
+-0.0554809 0.0440191 0.0450323
+-0.0877934 0.0860475 0.0044818
+0.00321463 0.130705 0.0223233
+-0.0505315 0.0389504 -0.011562
+-0.0819835 0.132406 -0.00340088
+-0.0758067 0.0877331 -0.0139103
+-0.091338 0.14476 0.0251578
+-0.0649682 0.034557 0.0300942
+-0.0283013 0.113756 -0.016413
+0.0259713 0.0619044 0.0444933
+-0.0535159 0.0640852 0.0330775
+-0.0046427 0.0482096 -0.0303136
+-0.0584956 0.0861498 0.0443498
+-0.0655423 0.145055 -0.0169033
+-0.0423586 0.123855 0.0235885
+-0.0864234 0.0806346 0.0145003
+-0.033107 0.125984 0.00180258
+0.000400525 0.0433705 -0.0249688
+-0.0337351 0.126905 0.0148106
+0.0594437 0.0677773 0.0191638
+-0.0433018 0.0342732 -0.0267127
+-0.0668634 0.040937 0.011312
+-0.0651408 0.146773 0.0392721
+0.0142259 0.080787 -0.0303234
+-0.0564981 0.0973554 0.0431547
+0.0234826 0.113521 -0.012343
+-0.022737 0.0385766 -0.00982941
+-0.0695434 0.0352232 -0.00418951
+0.060768 0.0651161 0.0111484
+-0.00338536 0.100168 0.0483773
+-0.0154942 0.0772732 0.0564359
+-0.0581438 0.114319 -0.0148345
+-0.0758612 0.165153 -0.0370257
+-0.0666041 0.164889 -0.0207192
+-0.0401309 0.160681 -0.0117333
+-0.00727995 0.0389199 -0.00704692
+-0.0726288 0.07489 0.035733
+0.0572537 0.0657957 0.00220085
+-0.0564793 0.151056 0.0307055
+-0.0459743 0.153608 0.00885524
+-0.046245 0.034596 0.0410145
+-0.0611658 0.168359 -0.0606871
+-0.0242347 0.0401682 0.0541848
+0.0432765 0.10012 0.00816425
+0.0330202 0.102118 0.0356213
+-0.00368236 0.0583856 -0.0334327
+-0.016783 0.0973001 -0.0271368
+0.018711 0.100467 -0.0223545
+-0.0500289 0.122604 0.03284
+-0.063243 0.0333437 -0.00222576
+-0.0187202 0.0613304 -0.0355606
+-0.0268504 0.0548324 -0.0264063
+0.0215374 0.086463 -0.0256391
+-0.0138967 0.099791 -0.0237429
+-0.00550708 0.0774167 0.0583085
+0.055466 0.0507517 0.00421414
+0.00822806 0.0344179 0.00390084
+0.028423 0.0535254 0.0391477
+-0.00689074 0.103109 -0.0232386
+-0.0320031 0.0370471 -0.0177181
+-0.0255422 0.0377889 0.0158759
+-0.0476682 0.165409 0.0039929
+-0.0673807 0.115762 0.049991
+0.00348136 0.111402 0.0420175
+-0.081586 0.0734778 0.0135382
+0.0427229 0.10007 0.00318201
+-0.0456223 0.0548403 -0.0108081
+-0.0226179 0.0464363 -0.0275647
+-0.0201905 0.172698 -0.0217858
+0.0374948 0.0941477 0.0350502
+0.0227469 0.0686119 0.0468992
+-0.012216 0.174205 -0.0276647
+-0.0906322 0.112714 0.0163744
+-0.0599044 0.111127 -0.0158584
+0.00535116 0.0480874 -0.0284111
+-0.0295604 0.158116 0.000994125
+0.0104513 0.122961 -0.0105071
+-0.0619452 0.123832 -0.00870252
+0.00605345 0.0341614 0.00369541
+-0.0696099 0.138316 0.0468524
+0.00349102 0.11963 0.0373483
+-0.0495577 0.0338416 0.0269497
+-0.0500211 0.0529295 0.0155558
+-0.0534917 0.0491191 0.0286591
+0.0546976 0.0478581 0.0131951
+-0.0803392 0.0841108 -0.00756769
+-0.0693719 0.180628 -0.057909
+-0.0247145 0.161052 -0.00252569
+0.0299408 0.0713176 0.0415086
+-0.0779905 0.173544 -0.0470087
+-0.0168218 0.086916 -0.0386596
+-0.0658968 0.109505 -0.0131657
+0.0326969 0.10609 0.0333845
+0.0191388 0.0356129 -0.00667825
+-0.0168818 0.100112 -0.0240537
+-0.0620293 0.135502 -0.00717407
+0.0377405 0.110012 0.0179226
+0.0360001 0.0381146 0.00239588
+-0.0151683 0.160834 -0.010917
+-0.0894324 0.117571 0.0455052
+0.0402874 0.063301 -0.00576463
+0.000231956 0.0755133 -0.0357459
+-0.0663652 0.0422587 0.0107808
+-0.0908359 0.114163 0.0368153
+0.0456753 0.0833922 0.00418733
+-0.0426429 0.0563425 -0.0115708
+-0.0472127 0.168412 -0.001987
+0.0163989 0.0433061 -0.0232691
+-0.0181224 0.165314 -0.018178
+0.014203 0.08785 -0.0301032
+0.00716038 0.0832586 0.0561062
+0.0547452 0.0661481 0.0263648
+0.0207672 0.0700064 0.0493524
+-0.0820552 0.1102 0.0401793
+0.0336664 0.0753805 -0.0167583
+-0.0827158 0.108829 0.000295564
+0.0250546 0.0420912 0.0376641
+-0.0866523 0.0868042 0.0239447
+-0.082018 0.151309 0.00327526
+0.0209029 0.107601 -0.0159886
+-0.0134952 0.0659366 0.0537869
+-0.0902062 0.143054 0.0286714
+0.0484774 0.0431365 0.00824398
+0.00679595 0.0352467 -0.0139815
+0.0154 0.0448131 -0.0240573
+-0.0715189 0.0972122 0.0409969
+0.0152962 0.0652155 -0.0297912
+0.0106046 0.128135 -0.0020835
+0.0273536 0.106086 0.0379553
+-0.0176729 0.0540415 -0.0325983
+-0.00110521 0.131378 0.0121444
+-0.0724827 0.124619 0.0532114
+-0.0738593 0.174047 -0.0391959
+-0.0646169 0.109762 0.0377795
+0.00521659 0.0824462 -0.0340286
+-0.0280135 0.0591603 -0.0264206
+-0.0676617 0.0433934 0.000689977
+0.0407264 0.0999947 0.0251764
+-0.0322885 0.177691 -0.00536129
+-0.0547546 0.035972 0.0465789
+-0.0425002 0.115266 0.0336474
+-0.0687451 0.0708436 0.0347552
+-0.0375019 0.0804666 0.0432825
+-0.0182946 0.181579 -0.0243778
+-0.0789826 0.115456 0.0491224
+-0.0415063 0.0534301 0.0394734
+-0.0708913 0.0403263 0.00282802
+-0.0548298 0.0927311 -0.0220321
+-0.0745142 0.138634 0.0488155
+-0.0807745 0.102028 0.0317433
+-0.0249646 0.181509 -0.0170525
+-0.0727415 0.154031 -0.0358995
+-0.0698172 0.0908437 -0.0164973
+-0.0366476 0.0577363 -0.0111372
+-0.0192308 0.0947234 -0.0324688
+-0.0118669 0.165326 -0.0197278
+-0.0804375 0.137229 0.0490949
+0.0134351 0.129972 0.01319
+0.0457654 0.0791979 0.00319646
+-0.0469166 0.129554 0.0250362
+-0.0581769 0.137607 -0.00562722
+0.04256 0.0817421 -0.00578018
+-0.0478101 0.0884245 -0.0219224
+-0.0424147 0.0344885 0.0314161
+-0.0645764 0.139638 0.0400104
+0.00451352 0.10035 0.0463879
+0.0423459 0.0915624 -0.00580854
+-0.0833163 0.106091 -0.000625527
+-0.0510681 0.0429687 0.0449412
+-0.0258019 0.0564099 0.0391373
+-0.0908661 0.142018 0.0261694
+-0.0222707 0.180155 -0.0129798
+-0.0375032 0.0987213 0.042382
+-0.0135516 0.0445689 0.0502862
+-0.0749157 0.0818909 0.0378096
+-0.042351 0.0336287 -0.0184783
+-0.0104895 0.0660607 0.0552117
+-0.0713722 0.163817 -0.0449613
+-0.0170629 0.040485 0.0522671
+-0.0629502 0.151043 -0.0063137
+-0.0420636 0.159404 0.00394669
+-0.0438717 0.105649 -0.0205239
+0.00352724 0.10161 0.0446753
+-0.00861199 0.118019 -0.01506
+-0.0658335 0.0881117 -0.0184537
+0.00251222 0.126485 0.0307749
+-0.0485567 0.0390246 -0.0119389
+-0.0600846 0.0399274 0.0217122
+0.0128427 0.034706 0.0391137
+-0.0306178 0.0409006 -0.0300462
+-0.0635449 0.0356868 -0.00823988
+-0.0063607 0.125295 -0.00886018
+-0.025376 0.059259 0.0400414
+0.0015066 0.0490028 0.0513272
+-0.0107915 0.0798668 -0.0380291
+0.0455381 0.0540654 0.0323771
+-0.0645999 0.0347243 0.0265296
+-0.074389 0.0874223 0.0399149
+0.0147945 0.0909396 -0.0283095
+-0.0256418 0.0382997 -0.00275652
+-0.0249427 0.17123 -0.0116584
+-0.0860007 0.147303 0.0341634
+-0.00989368 0.129282 0.00314288
+-0.056803 0.119986 -0.0107265
+0.0131837 0.129339 0.0031365
+0.0204173 0.0925165 -0.0239466
+-0.0881399 0.122604 0.000302573
+-0.0687931 0.166618 -0.053004
+-0.0116307 0.0337076 -0.023716
+-0.0395047 0.0776369 0.0429957
+-0.0435015 0.086056 0.04322
+0.0313221 0.0899509 -0.0192278
+-0.0512591 0.0544504 0.0206222
+0.0450165 0.0718833 0.00186291
+-0.0240342 0.0381218 0.00683415
+-0.0643335 0.153058 -0.000307605
+-0.0553413 0.0491317 -0.00437815
+0.0461434 0.0834347 0.0111711
+0.0469552 0.0427274 0.0188429
+0.0403147 0.061632 0.0300225
+-0.0345217 0.127119 0.00425139
+-0.0560415 0.0335011 -0.000906542
+0.0458803 0.0848141 0.013166
+0.0355169 0.0713149 -0.0148173
+-0.00649249 0.0978569 0.0522238
+-0.0720202 0.152598 -0.0428872
+0.00936768 0.0509673 -0.0289075
+-0.017803 0.0813337 -0.0391893
+-0.0164921 0.101629 0.0439544
+-0.0749763 0.136928 -0.00646616
+-0.018438 0.165372 -0.011068
+-0.0749694 0.0749712 0.0333987
+-0.0344916 0.0547205 0.0381399
+-0.0252176 0.0351344 0.0519405
+-0.0785113 0.10447 -0.00758869
+-0.0837382 0.0804711 0.0245022
+0.0352492 0.043109 0.0289456
+-0.0657408 0.0353871 0.0379044
+-0.0633722 0.04322 0.0387983
+0.0187703 0.0504962 0.0444745
+0.0134519 0.128957 0.00181284
+0.00181742 0.106617 -0.0209271
+-0.069971 0.156225 0.0143836
+-0.0793623 0.0739499 0.024599
+0.0192573 0.0903239 -0.0256184
+-0.0785673 0.0716608 0.0214639
+0.0207235 0.123161 0.0287274
+-0.0694864 0.116115 0.0518347
+-0.022007 0.0754165 0.0531212
+0.00541958 0.0361021 -0.0235849
+0.0126937 0.0345417 0.0229719
+-0.0272554 0.0377383 0.0173779
+0.0183414 0.126234 0.023568
+-0.0782171 0.159705 -0.021925
+0.0319954 0.11684 0.00152318
+-0.0364949 0.0747255 0.0419725
+-0.00631217 0.0422986 0.0485312
+-0.0696892 0.0733745 -0.0120577
+-0.0574743 0.0452883 0.0435332
+0.0270163 0.115378 0.0322111
+0.0100342 0.126121 -0.00591235
+-0.0765631 0.160404 -0.0136187
+0.0104935 0.0976882 0.0488434
+-0.088546 0.102334 0.0113879
+-0.0488628 0.0600536 0.0351294
+-0.0102645 0.038442 0.0220215
+-0.0471272 0.159118 -0.00765489
+0.0282711 0.0480264 -0.0137299
+0.0106928 0.0341923 -0.0160349
+-0.0413207 0.122297 -0.0113384
+-0.0112299 0.173502 -0.0278641
+-0.0702692 0.146349 -0.0238997
+-0.0311686 0.0820079 -0.0315681
+-0.058698 0.0349789 0.0448461
+0.0225489 0.0444802 -0.0157666
+0.00650352 0.0547197 0.0529464
+0.0375985 0.10834 0.0241868
+0.026474 0.110098 0.0367031
+0.0104332 0.0344417 -0.0125223
+-0.00834994 0.0943471 -0.0340215
+-0.0726673 0.155437 -0.0339106
+-0.0830075 0.0762889 0.0105229
+-0.0846192 0.0805533 0.0214764
+-0.0805239 0.148418 0.0381727
+-0.087237 0.106355 0.0143591
+-0.0447805 0.0423866 -0.0153071
+-0.0837301 0.147364 0.00414541
+-0.0832136 0.0770175 0.0194025
+-0.0259181 0.0649186 0.0404266
+0.0449079 0.0931824 0.0151569
+0.0348585 0.0808647 0.0399076
+-0.000497657 0.066177 0.0565989
+-0.081976 0.138997 -0.000769762
+-0.0164973 0.088378 0.056467
+-0.0655061 0.041163 -0.00538315
+0.0250139 0.0449606 -0.012685
+-0.0684343 0.0667749 -0.00454154
+0.0313723 0.0597573 -0.0175925
+-0.073748 0.0805288 0.0380979
+-0.0431166 0.0378307 0.0441123
+-0.0704863 0.169511 -0.0510127
+-0.0418064 0.0884466 -0.0220226
+-0.0725566 0.0737794 0.034925
+-0.0432285 0.12305 0.0247373
+0.0537086 0.0670896 0.000808459
+-0.0318715 0.0510682 0.0382665
+0.00533718 0.124533 0.0332195
+-0.0234982 0.0988724 0.0447778
+-0.0873895 0.143261 0.0370491
+0.0450408 0.0625178 -0.00265494
+-0.0618764 0.138649 -0.0067701
+-0.0637266 0.174609 -0.0527846
+-0.0739864 0.158247 -0.0289285
+-0.0616651 0.174109 -0.0575903
+-0.0346424 0.0780819 -0.0225024
+-0.0310543 0.0337173 -0.0219116
+-0.0769455 0.154831 -0.00883158
+-0.0339952 0.0752026 -0.0244888
+0.0354333 0.111001 -0.000827134
+-0.0790203 0.0935614 -0.0105962
+-0.0879913 0.136375 0.00520661
+-0.0582272 0.048399 0.00675942
+-0.00714757 0.130278 0.00704353
+0.0114556 0.0340617 0.001148
+0.0458421 0.0876102 0.0101629
+0.00312017 0.129984 5.00643e-07
+-0.0376568 0.0591992 -0.0116433
+0.00923557 0.129984 0.00166977
+-0.0579608 0.139021 -0.00516612
+-0.0909934 0.148856 0.0221303
+-0.0611919 0.0341824 0.0259657
+-0.0917869 0.115969 0.00931507
+0.00445187 0.116712 -0.0177471
+0.00711096 0.111601 -0.019782
+-0.00341693 0.115827 -0.0167447
+0.0411288 0.0792971 0.0313687
+-0.0358185 0.0337288 -0.0209957
+-0.0304972 0.0703216 0.0396594
+-0.076218 0.0887607 0.0388797
+-0.0701244 0.0632147 0.00385793
+0.0432229 0.0888059 -0.00480108
+-0.0321931 0.123411 -0.0044713
+0.0221624 0.0959197 -0.0219723
+0.0234605 0.0367801 -0.00165856
+-0.0234711 0.183379 -0.010712
+-0.0461137 0.0368295 -0.0192985
+0.023814 0.119372 0.031074
+-0.0617151 0.0722545 -0.0157777
+-0.0697425 0.164473 -0.0161193
+-0.0700395 0.077854 0.0390736
+-0.0793237 0.108591 -0.00458021
+-0.0622625 0.155951 0.0127725
+-0.0579896 0.126711 -0.00710506
+-0.0819874 0.0788394 -0.00151395
+-0.051802 0.111349 -0.0178923
+-0.0548009 0.0547174 0.00969263
+0.0456361 0.0819814 0.00319705
+-0.0362696 0.0447516 0.0428152
+-0.0678285 0.156225 0.0151421
+-0.0441012 0.15765 -0.00916962
+-0.0698712 0.102299 -0.0142744
+-0.0434973 0.0719505 0.0423325
+-0.0385101 0.124563 -0.00772445
+-0.0720478 0.154003 -0.0409023
+-0.0415192 0.155101 0.00654483
+0.030443 0.0496674 -0.00974777
+0.0100263 0.0352289 0.0272451
+-0.0657931 0.0349145 0.0296068
+-0.00453349 0.0975685 -0.029357
+-0.0575464 0.0576229 0.00774375
+-0.0675655 0.156308 0.0210392
+-0.0625478 0.177823 -0.0603383
+-0.0164994 0.107189 0.0421238
+-0.0628199 0.164682 -0.0345962
+-0.0725695 0.162422 -0.0399552
+-0.0295698 0.0377598 0.0258888
+-0.0285577 0.048864 -0.0238529
+-0.051128 0.0487627 0.0151791
+0.0297172 0.11319 -0.0079908
+-0.0129858 0.0389757 -0.0119758
+-0.0519687 0.0514416 0.0131188
+0.00659366 0.0345497 0.005308
+0.0431201 0.0959054 0.0231686
+0.0426395 0.101487 0.00716583
+-0.0326038 0.039499 -0.0302708
+-0.022273 0.0879769 0.0544159
+-0.0501719 0.132485 0.029178
+-0.0104724 0.123683 0.0330383
+0.0158783 0.103153 -0.0212298
+-0.0380583 0.0406922 0.0433465
+-0.05672 0.0341106 -0.0113244
+0.00284082 0.0994342 -0.0233056
+-0.00189869 0.037664 0.017192
+0.00849573 0.122392 0.0350922
+-0.0911887 0.13375 0.0222165
+0.0145889 0.124413 0.0307966
+0.0365837 0.0686678 0.0370221
+0.00534141 0.0341316 0.016402
+-0.0652159 0.16242 -0.0585196
+-0.0708983 0.120893 -0.00865195
+-0.0790974 0.103427 0.0328545
+-0.0233223 0.0386973 -0.0137829
+-0.0870669 0.0909973 0.0256595
+-0.0237781 0.0389651 0.0367703
+-0.0314981 0.107032 0.0395669
+-0.0488684 0.125064 -0.00815774
+0.0188255 0.104686 -0.0188612
+-0.0214383 0.162534 -0.00657802
+-0.0923673 0.124202 0.041188
+-0.0116952 0.0383509 0.0145738
+-0.0933085 0.117399 0.0213072
+0.00147085 0.0388322 0.0258794
+0.041327 0.0986069 0.0251647
+-0.063339 0.160302 -0.0538579
+0.0235731 0.114695 -0.0116124
+-0.0828981 0.101969 0.02963
+-0.0616452 0.139553 0.0354433
+-0.0343725 0.0357923 0.047703
+-0.0451209 0.0377458 0.0446873
+-0.0920088 0.118668 0.00830639
+-0.0495672 0.135498 0.00241956
+-0.0603606 0.0633645 0.0289482
+-0.067238 0.175347 -0.0588701
+0.053058 0.0705565 0.0234346
+0.0380671 0.0821074 0.0357563
+-0.0797544 0.0720045 0.0191472
+-0.0844521 0.153452 0.0225801
+-0.0749035 0.113464 -0.00617122
+-0.0384926 0.0605846 0.0409778
+-0.075255 0.0832856 0.0380964
+-0.0198342 0.0855003 -0.0383524
+-0.0649244 0.113824 -0.0119395
+0.0421 0.0690665 -0.00478535
+-0.0615968 0.0595411 0.0052883
+0.0357976 0.0378059 0.0192762
+-0.0314223 0.0343059 -0.0206653
+-0.0805979 0.0786983 -0.00455339
+-0.0516467 0.0481272 0.0388737
+-0.0325014 0.0618008 0.0386259
+0.0188656 0.11384 -0.0146811
+0.0360105 0.106014 0.0293761
+-0.0489136 0.125469 0.0310273
+-0.0702125 0.173659 -0.0540385
+0.0100557 0.112263 -0.0189498
+-0.0643724 0.0341771 0.0147182
+-0.023212 0.165344 -0.00918469
+0.059734 0.0692161 0.0111359
+0.0164747 0.104398 0.044527
+-0.0870127 0.10633 0.011369
+0.030786 0.0765476 -0.0208061
+-0.0657333 0.121445 0.0506733
+-0.00450341 0.0703715 0.0573471
+-0.0525943 0.0544911 -0.00726112
+-0.0226202 0.181624 -0.0117104
+0.00179227 0.0340095 -0.0213712
+-0.0768516 0.103431 -0.00952853
+-0.0773369 0.105608 0.0341784
+-0.0364954 0.0987325 0.0427313
+-0.0532526 0.161216 -0.00188451
+-0.0658747 0.0981197 -0.0167177
+-0.00202406 0.126832 0.0305449
+0.0396296 0.0392572 0.0187428
+0.0114981 0.0658063 0.0534716
+-0.0660116 0.154522 0.0303582
+0.0322049 0.0871235 -0.0192744
+-0.0161934 0.116736 -0.0156361
+-0.00805531 0.101876 -0.0238922
+-0.0425065 0.0548487 0.0395533
+-0.0623557 0.152158 -0.0235797
+-0.0550956 0.0333795 -0.00606735
+0.0194036 0.123725 -0.00335403
+0.0149002 0.0348014 0.0340409
+-0.0174953 0.112701 0.0395679
+-0.0824727 0.0992304 -0.00559052
+-0.0428553 0.101381 -0.0214106
+-0.0291214 0.0621103 -0.0254198
+-0.0530392 0.146248 0.021397
+-0.0658806 0.040185 0.0344505
+0.0298766 0.0889056 0.0433386
+0.0206783 0.0361727 0.0176735
+-0.029331 0.0791866 0.0433726
+-0.0474654 0.135069 0.0155888
+-0.0798447 0.116298 -0.00419638
+0.0278259 0.115624 -0.00659973
+-0.0400692 0.157713 -0.010751
+-0.087695 0.0860952 0.016472
+0.0119148 0.0630446 0.0522963
+-0.0586388 0.0367329 -0.00984378
+-0.0545581 0.0628278 0.0306388
+-0.0904983 0.133768 0.0272133
+0.0424823 0.0958192 -0.00180898
+-0.085893 0.115781 0.0473131
+-0.0827739 0.0762807 0.0135216
+-0.0783317 0.109572 0.0415234
+-0.0535658 0.132546 0.0330634
+-0.0901834 0.114057 0.0406088
+0.0134074 0.0463149 -0.0249889
+0.0112253 0.0952809 -0.0268838
+0.0150227 0.080777 0.0534508
+-0.0278391 0.168266 -0.00883037
+-0.0698489 0.175309 -0.0448893
+-0.0895811 0.137877 0.0241855
+-0.0790004 0.100402 -0.00859092
+-0.062851 0.116991 0.0425454
+0.0239206 0.0352552 0.0228022
+-0.000501715 0.0634055 0.0567322
+0.046037 0.0806318 0.0171753
+-0.0766672 0.154399 0.00327135
+-0.0117177 0.129576 0.0183624
+-0.0885031 0.148521 0.0281728
+-0.0728479 0.14776 0.0416103
+-0.015205 0.175685 -0.0260892
+-0.082938 0.100617 -0.00458659
+0.0398543 0.102779 0.025179
+-0.0336965 0.120802 0.028215
+-0.0625742 0.17727 -0.0581696
+-0.00806953 0.0988363 -0.0267114
+-0.0560752 0.0602595 -0.0044615
+0.0597447 0.0594744 0.0191904
+-0.0106444 0.0481591 -0.0303544
+0.00351281 0.081445 0.056735
+-0.0672464 0.173921 -0.0582812
+0.00251634 0.0459065 0.0480561
+0.000471055 0.038278 0.000679374
+-0.0002129 0.122901 -0.0103152
+-0.0382613 0.0393263 0.043596
+0.00848754 0.0426921 0.0451471
+-0.0482154 0.137103 0.0123981
+-0.015727 0.0657542 -0.0377517
+-0.0282054 0.0676114 -0.0305119
+-0.0306807 0.0363386 -0.0186663
+-0.0476849 0.119711 0.0291692
+-0.0663764 0.12565 0.049733
+-0.0488788 0.134867 0.0224297
+-0.0877229 0.0888584 0.0234132
+-0.0756171 0.172473 -0.0369846
+-0.033348 0.0384446 -0.00813352
+-0.0442894 0.126542 0.0198398
+0.0235131 0.101506 -0.0194672
+0.0538716 0.0661448 0.0268494
+-0.073604 0.148628 -0.0255988
+-0.0671901 0.0335697 -0.00322908
+-0.0886344 0.0949473 0.0228281
+-0.0761608 0.175035 -0.0499961
+0.0306065 0.111866 -0.00856301
+-0.0317456 0.124703 -0.000629789
+-0.0904268 0.150188 0.0141369
+-0.0639022 0.10675 -0.0154602
+-0.0541798 0.157923 -0.00210942
+-0.00323215 0.0940338 -0.0336602
+-0.0164901 0.115444 0.0380258
+0.053298 0.0648217 0.0277585
+-0.0843615 0.0993477 -0.00259153
+-0.00674006 0.0712942 -0.0362643
+-0.0653258 0.140047 -0.00770568
+-0.00635478 0.123294 -0.010702
+-0.055158 0.0361639 -0.0112393
+0.00412979 0.113096 -0.0199676
+-0.064574 0.0418551 0.0316967
+0.0525746 0.0462075 0.0162071
+-0.0234833 0.0448815 0.0530288
+-0.071322 0.138326 0.0479203
+0.0425401 0.0986672 0.000167984
+0.0273648 0.102724 -0.0167839
+0.0332874 0.111381 0.0289227
+-0.0537039 0.0594504 0.0244709
+-0.0227345 0.0390118 0.0369431
+-0.00354236 0.0429091 0.0474905
+-0.0724136 0.156792 -0.00114359
+-0.00249623 0.0689511 0.056733
+-0.0482461 0.131793 0.0256765
+-0.0515081 0.0490357 0.0376444
+-0.0944953 0.125552 0.0212653
+0.00638447 0.0346255 0.0414585
+0.0141724 0.0940368 0.0505038
+-0.0688973 0.120914 -0.00896239
+-0.0520364 0.14934 0.0173988
+0.00422853 0.0810435 -0.0341743
+-0.0515685 0.0473635 -0.00788512
+-0.0237608 0.156715 -0.0053038
+-0.0356104 0.127425 0.0141251
+0.035299 0.113666 0.0170439
+0.0334236 0.0903004 0.0414245
+-0.0251823 0.172681 -0.0196186
+-0.08807 0.113074 0.0239452
+0.0189601 0.036126 0.0191857
+0.00788239 0.0363273 0.00580236
+-0.0173959 0.0348327 0.0487444
+-0.0878896 0.111968 0.039224
+-0.064655 0.115706 0.0452756
+0.0311169 0.0445787 0.030603
+0.0441778 0.076309 0.025099
+-0.0896358 0.0915718 0.0124456
+-0.065807 0.090969 -0.0181206
+-0.0709064 0.123821 -0.00862928
+0.00649864 0.0924086 0.053834
+-0.0704989 0.134077 0.0490714
+-0.0596081 0.0614162 -0.00289701
+0.0242732 0.0346695 0.0161217
+-0.0464984 0.101529 0.041912
+-0.0498635 0.101385 -0.021584
+0.00433106 0.0496013 -0.0292546
+0.0107427 0.041795 0.045086
+-0.0739382 0.132552 -0.00766265
+-0.0162071 0.174195 -0.0247085
+-0.0886736 0.132413 0.0428724
+0.0320792 0.05838 -0.0156698
+-0.0192343 0.038226 0.00590432
+-0.0445033 0.11527 0.0334071
+-0.0847891 0.15265 0.0254465
+-0.0933214 0.129622 0.0172404
+-0.0346417 0.056288 -0.0107606
+-0.072488 0.172225 -0.0500329
+0.0233375 0.0606402 -0.0253621
+0.0366723 0.106016 0.0285439
+-0.0276074 0.0356491 0.0527176
+-0.053407 0.152198 0.0189083
+-0.0742721 0.166608 -0.0409997
+-0.0457331 0.0753099 -0.0177194
+-0.00672552 0.0670096 -0.035497
+-0.00219357 0.131295 0.0117423
+-0.0261647 0.0620468 0.0393395
+-0.0553241 0.0335005 0.00825618
+-0.0228582 0.119091 -0.0120569
+0.0213076 0.110412 -0.0149847
+-0.0314817 0.0889488 0.0439042
+0.0313336 0.0477022 -0.006755
+-0.0386183 0.174771 -0.00621679
+0.040988 0.0392554 0.0153655
+0.0608733 0.0623548 0.014161
+-0.00841473 0.0366574 -0.0164161
+-0.0191613 0.038383 0.000326194
+-0.00880856 0.0882704 -0.0368626
+-0.0596465 0.149865 -0.00094307
+0.00994371 0.0978413 -0.0235989
+0.0455086 0.055594 0.0323303
+-0.0860233 0.102167 0.0034068
+-0.0281256 0.165243 -0.0164075
+0.00425042 0.072607 -0.0344972
+0.0235113 0.118015 0.0324132
+-0.000261091 0.0350803 0.00896105
+-0.0532978 0.147774 0.0234078
+-0.0554295 0.0433 -0.00807812
+-0.0771312 0.155572 -0.0108986
+-0.0841536 0.0790628 0.0035277
+-0.0900384 0.135039 0.0102136
+-0.0727986 0.0849862 -0.0158247
+0.0336101 0.0962478 -0.0138935
+-0.0284441 0.0732827 -0.0345293
+0.00969167 0.0357093 0.0447693
+-0.0267255 0.0380235 0.0244373
+-0.0572883 0.132547 0.0364836
+-0.0528311 0.0941603 -0.0218064
+0.0400501 0.0644468 0.0314841
+-0.036531 0.116238 -0.0149852
+-0.00649604 0.0912014 0.0567618
+0.0144842 0.101799 0.0469727
+0.00323629 0.131729 0.0108817
+-0.0308992 0.0734931 -0.0305082
+0.0172066 0.068625 0.0512164
+-0.0657497 0.0765846 -0.017077
+-0.0737602 0.111876 0.0478461
+-0.0694356 0.066827 -0.00357005
+-0.0585001 0.119809 0.0399342
+0.0441644 0.0931187 0.000177172
+-0.0843417 0.0952366 0.029868
+-0.054753 0.0782755 -0.0197234
+-0.00738705 0.0379427 -0.0155249
+-0.0910658 0.143334 0.0151805
+-0.00249685 0.08015 0.0577289
+0.0340507 0.0835544 0.0405264
+-0.0523382 0.161184 -0.00281855
+-0.0812419 0.109765 0.0353982
+-0.0582589 0.129739 0.0385905
+0.0543559 0.049285 0.0042337
+0.015086 0.0406501 0.0443863
+-0.0280294 0.0835807 0.0475884
+-0.0393811 0.128131 0.00244283
+0.0208178 0.0415166 -0.0167046
+-0.0881465 0.111869 0.0203319
+0.0179003 0.0347727 0.0238228
+-0.0656433 0.0657616 -0.0058195
+-0.0840769 0.0911454 0.0297191
+0.00624923 0.0796338 -0.0339546
+0.0328487 0.0876389 0.0423414
+0.0276661 0.034679 0.0131567
+-0.00286572 0.104506 -0.0226523
+-0.0862889 0.10771 0.0183439
+0.0408829 0.0937805 -0.00720194
+0.000164408 0.0895345 -0.0346177
+-0.0843436 0.144613 0.00514953
+-0.0675701 0.180805 -0.0555973
+0.0220024 0.0727679 0.0493999
+-0.0156461 0.186781 -0.0233704
+-0.0187078 0.0364661 -0.0182818
+-0.0254003 0.0649585 0.0413183
+0.0122459 0.0780339 -0.0313519
+-0.0555013 0.0547806 0.00866941
+-0.0521449 0.157571 -0.00396744
+-0.073564 0.156227 0.0174776
+-0.00865052 0.104822 -0.0230347
+-0.0529425 0.0516633 -0.00638853
+-0.0652396 0.0384193 0.0154218
+0.0233172 0.0809188 0.0496338
+-0.0494012 0.054529 0.0344155
+0.0222475 0.0847573 -0.0259093
+0.0413844 0.0438265 0.0277643
+-0.0818597 0.146076 0.0399402
+0.0111047 0.0345035 -0.00868495
+-0.006336 0.10011 -0.0240468
+0.0245413 0.0819542 -0.0249712
+-0.00496439 0.130958 0.0121612
+-0.00978935 0.0841125 -0.0382567
+0.00551162 0.104351 0.0429177
+-0.0384918 0.0874952 0.0437107
+0.00946556 0.123094 -0.0106511
+-0.0897739 0.137922 0.033196
+-0.0653284 0.0349129 0.0366619
+0.00350126 0.104382 0.0428343
+-0.0368171 0.04253 -0.0279956
+-0.0634962 0.0775171 0.0416907
+-0.0558399 0.0666 0.0358943
+-0.033501 0.113967 -0.0166209
+-0.0105678 0.0384807 0.0255376
+-0.0875349 0.110472 0.0163392
+-0.0221423 0.0430524 0.0536615
+-0.0485662 0.0337988 0.0271958
+-0.0681764 0.0335792 0.00196619
+-0.00165753 0.05399 -0.0314052
+0.0457818 0.0746903 0.0202853
+-0.0845781 0.148672 0.0341151
+0.0452897 0.0861791 0.0201631
+0.00831626 0.0356874 -0.00657792
+-0.0196215 0.042233 -0.0284571
+-0.0649431 0.145366 0.0395451
+-0.0704953 0.104114 0.0382884
+-0.0414996 0.117985 0.0314618
+-0.0712521 0.17555 -0.0439596
+0.0452514 0.0931962 0.00916141
+0.00133085 0.058325 -0.0325937
+-0.0620033 0.158406 -0.0355965
+0.030344 0.1101 0.0335023
+0.0463602 0.0692197 0.00260588
+0.0444762 0.0945372 0.00319063
+-0.0491293 0.0430398 0.0442413
+-0.0789669 0.172206 -0.0419919
+0.0106503 0.130383 0.00504386
+-0.0484141 0.113756 -0.016334
+0.00450584 0.0547654 0.053433
+0.0441531 0.0720542 0.000197496
+-0.0134923 0.120989 0.0351213
+-0.0907438 0.135107 0.0202099
+-0.0590287 0.0481317 0.00366474
+0.0364319 0.108205 -0.00282023
+0.0178615 0.122874 -0.00643626
+-0.0356427 0.112876 -0.017464
+-0.0668607 0.154942 0.00387089
+-0.0486527 0.162759 0.00599863
+-0.00949915 0.105857 0.0435217
+-0.0615042 0.121243 0.0426924
+-0.0784762 0.0731416 -0.000473316
+-0.0740322 0.156054 0.0216877
+-0.0847959 0.101901 0.0272869
+-0.0596957 0.14074 -0.00502874
+-0.050497 0.0987878 0.0435099
+-0.071801 0.0745407 0.0361884
+-0.0549619 0.14242 0.0292765
+-0.0427321 0.0739589 -0.0183224
+-0.0508117 0.0354248 -0.0125858
+-0.0642011 0.0410429 0.0143098
+-0.0132685 0.101107 0.0437078
+-0.0475187 0.0790945 0.0436556
+0.0209941 0.0373175 -0.00464913
+-0.0204991 0.100239 0.044421
+-0.0684679 0.110537 0.0393979
+0.0243777 0.124503 0.0143821
+-0.0830368 0.0762381 0.00350806
+-0.073622 0.0747015 -0.00970199
+-0.0461368 0.13275 0.0116924
+0.0104091 0.0389479 -0.0231008
+0.0155004 0.116786 0.0363781
+0.0387891 0.096727 0.0316453
+0.0196906 0.074125 0.0513576
+-0.0225582 0.0383546 -0.00218286
+0.0487458 0.0724992 0.00846572
+-0.0668418 0.138273 0.0438208
+-0.0309771 0.0339917 0.0163773
+0.0411176 0.0661976 -0.00575682
+-0.0229076 0.0852723 0.0551257
+0.000828067 0.123861 -0.00936286
+-0.0250326 0.0621165 0.0410328
+-0.0651714 0.128382 0.0462127
+-0.0434333 0.15941 0.00551467
+-0.0264854 0.0348879 0.0467436
+-0.0628107 0.150584 -0.0245802
+-0.0123081 0.181626 -0.0249909
+-0.00919366 0.172678 -0.0237455
+0.0126063 0.0576596 0.0514859
+-0.0332159 0.0709306 -0.0214641
+0.0240158 0.0658883 0.0452055
+-0.0660765 0.124251 0.0501642
+-0.0588552 0.0351368 -0.0102919
+0.0124134 0.0346609 0.020994
+0.0122384 0.0644368 0.0527864
+0.0452304 0.0763569 0.00121116
+0.0242611 0.0448626 -0.0136813
+-0.0304238 0.12007 0.0279522
+0.0145126 0.0347575 0.026768
+-0.0217663 0.065545 -0.0358558
+0.00816067 0.125635 -0.0073679
+0.0183075 0.0679765 -0.028974
+-0.0180555 0.0909221 -0.0366017
+0.00824317 0.0602927 0.0539848
+-0.0687967 0.0894213 -0.0168337
+-0.0450098 0.146255 0.00342574
+-0.0335022 0.0661629 0.0402747
+-0.0781465 0.155117 0.0246877
+0.00450914 0.0758818 0.0564153
+-0.0135396 0.0366033 -0.0173816
+0.045728 0.077798 0.00320493
+-0.0913745 0.142001 0.0211607
+-0.0284862 0.102933 0.0423265
+-0.0302445 0.16108 -0.00171322
+0.0327554 0.116907 0.00609585
+0.0201031 0.0379621 0.0410367
+-0.090178 0.113449 0.0375353
+0.0422255 0.0887323 -0.00780894
+-0.0632995 0.045657 0.000708444
+-0.0344955 0.0889014 0.0434521
+-0.0735138 0.0874308 0.0404487
+-0.081144 0.11 0.0405445
+-0.046701 0.144949 0.00345496
+0.0239825 0.114006 0.0348506
+0.00951792 0.0799496 0.0550675
+-0.0589753 0.0343808 0.0315144
+-0.0715764 0.0724969 0.0344898
+-0.0763465 0.151411 -0.00788806
+0.0476241 0.0444058 0.00228058
+-0.0865319 0.0910336 0.0265354
+-0.0761893 0.0686573 0.0192806
+-0.0738377 0.169377 -0.0450494
+-0.013497 0.089796 0.0568243
+-0.003677 0.129286 0.0256231
+0.00334505 0.0372684 -0.00154693
+0.0285394 0.0735396 -0.0227021
+-0.067513 0.132633 0.0463034
+0.0459145 0.0862168 0.00717824
+-0.0631406 0.152896 -0.00931447
+-0.0777879 0.113218 0.0476364
+-0.023707 0.0340979 -0.0208155
+-0.0144671 0.110884 -0.0194361
+0.0102739 0.0667155 -0.0310192
+-0.00350236 0.0842813 0.0574606
+-0.0664798 0.0832826 0.043443
+-0.0635622 0.0403137 0.0257086
+-0.0426942 0.0666296 -0.0154091
+-0.017221 0.187225 -0.0211553
+-0.0336762 0.062222 -0.0135529
+-0.0673972 0.0641749 0.025006
+-0.0740248 0.149858 -0.0328754
+-0.0467235 0.128128 0.0253508
+-0.0262045 0.163884 -0.00647025
+-0.0271883 0.118982 0.0306038
+0.033772 0.0543003 -0.00971113
+-0.0758953 0.12228 -0.00740649
+0.00448236 0.11415 0.0407558
+-0.0698932 0.103728 -0.0136756
+-0.0567617 0.0782351 -0.019665
+0.0543638 0.0534389 0.000229046
+-0.081811 0.11456 0.047449
+-0.0565132 0.053486 0.0056729
+-0.057003 0.128342 0.0386502
+-0.0664962 0.0370022 0.0293944
+-0.0624918 0.101519 0.0421076
+-0.0687869 0.155336 0.00316719
+-0.0685122 0.141137 0.0449382
+-0.0527211 0.0709092 -0.0154358
+-0.00549985 0.0703921 0.057296
+-0.0709113 0.107952 -0.0112859
+0.00912605 0.108716 -0.0196568
+0.0361188 0.0794771 0.0382118
+-0.0588731 0.101172 -0.0189069
+-0.068257 0.129831 0.0487832
+0.0374605 0.0754022 0.0365814
+-0.032324 0.161031 -0.00122654
+0.0285746 0.0351013 0.0166057
+0.0394117 0.0870933 -0.0127933
+0.0113423 0.0644371 0.0532354
+-0.0583019 0.0447396 0.0435847
+-0.00749863 0.0773617 0.0576592
+-0.050194 0.116459 -0.0151638
+-0.0481437 0.0545922 0.0360102
+-0.0104704 0.100279 -0.0242341
+-0.0347529 0.111555 -0.0180951
+-0.0155011 0.120965 0.0341268
+-0.0784442 0.154274 0.027518
+0.0120599 0.0739551 0.0543847
+-0.0633352 0.0436031 0.0119653
+0.0217763 0.115313 0.0351727
+-0.0415089 0.165252 0.00421093
+0.0335736 0.0700381 0.039723
+0.00251112 0.0647983 0.0566425
+-0.0654261 0.0391693 0.0381077
+-0.0695564 0.114278 0.0502908
+-0.00162211 0.0369274 0.0160989
+-0.058966 0.123797 -0.00809452
+-0.0942641 0.126921 0.0212556
+-0.0335104 0.175675 -0.00315318
+-0.0368415 0.0943464 -0.0233446
+0.0133357 0.128238 -0.000223601
+0.00322397 0.0768846 -0.0351052
+0.00583724 0.038604 -0.0097514
+0.0244991 0.0390622 0.0333159
+0.039204 0.0699354 0.0337973
+-0.00749309 0.122405 0.0352331
+-0.0204932 0.0624346 0.0477982
+-0.0366651 0.0353042 0.023032
+0.0167127 0.0887461 0.050636
+-0.0697357 0.167099 -0.0218834
+0.0364696 0.0632797 0.0368445
+-0.0745038 0.141441 0.0470955
+-0.0621205 0.0458041 0.0366793
+-0.0544906 0.0820201 0.0451936
+-0.0645123 0.172574 -0.0485643
+-0.0421309 0.128083 -3.62159e-05
+0.0281636 0.121218 0.0186511
+-0.0121987 0.171236 -0.0257581
+-0.0281113 0.0605968 -0.0274147
+-0.0631879 0.0449558 -0.00115255
+-0.056884 0.0955743 -0.0213395
+-0.0516987 0.131736 -0.00321408
+0.00826283 0.110977 0.0402103
+-0.0738401 0.154086 -0.0269016
+0.00525204 0.071179 -0.0340737
+-0.0710521 0.173649 -0.0530415
+-0.0508226 0.162642 -0.00385759
+-0.0802179 0.141741 -0.00280512
+-0.0104908 0.12238 0.0346088
+-0.082839 0.145958 0.00218243
+-0.0764995 0.134472 0.0515165
+0.0572674 0.0552579 0.0228777
+-0.0459192 0.038241 -0.0182827
+0.0212995 0.0664627 -0.0275106
+-0.00266999 0.131274 0.0130017
+-0.0615996 0.159996 -0.0335919
+-0.0172476 0.12413 0.0281151
+0.0257469 0.104744 0.0391433
+0.033213 0.112692 0.0276861
+0.0156033 0.0352036 -0.0174539
+-0.030256 0.0608147 -0.0214135
+-0.0554996 0.0746996 0.0418498
+0.0250243 0.0618819 0.0448807
+0.0333333 0.0528011 -0.00875184
+0.0462789 0.0820452 0.011174
+0.0413782 0.0519867 -0.00685663
+-0.0228771 0.11806 -0.0129657
+-0.0608849 0.0381036 0.0449409
+-0.0255027 0.103002 0.0430099
+-0.0102615 0.128766 0.00159795
+-0.0140304 0.0389318 -0.0121434
+0.0242826 0.0691154 -0.0252241
+-0.0262141 0.0383199 -0.0177378
+0.000134491 0.116503 -0.0174981
+-0.0556551 0.0575 -0.00342108
+-0.0641179 0.115013 -0.0114251
+-0.0523454 0.059725 0.0287459
+-0.039493 0.0888698 0.0432118
+-0.0635876 0.0600882 0.0187607
+-0.0527647 0.138519 0.0263974
+-0.0421778 0.150669 0.00550662
+-0.0898169 0.147438 0.0111767
+-0.0440117 0.149183 0.00634807
+-0.0124981 0.0842783 0.057419
+-0.041501 0.0888244 0.0425932
+0.0390954 0.0814754 -0.0127535
+-0.00978632 0.0812687 -0.0379822
+-0.0143122 0.127128 -0.000614565
+0.043146 0.0650339 -0.00117659
+0.0508787 0.0465582 0.0223162
+-0.0187679 0.0341854 -0.027695
+0.0104088 0.0403968 -0.0232872
+-0.0615714 0.111062 0.0370307
+-0.0574772 0.0344195 0.038759
+-0.029988 0.0381577 0.0326274
+-0.0293835 0.0775974 -0.0345936
+-0.0174998 0.115454 0.0379182
+-0.0492034 0.0336154 -0.00143623
+-0.0160718 0.124871 -0.00420428
+0.0153397 0.120197 -0.0115352
+-0.0588103 0.157344 0.00530008
+-0.0448304 0.0956436 -0.0219722
+0.0199962 0.120682 0.0326204
+0.050389 0.0482108 0.0251806
+0.0208954 0.116644 -0.0117151
+-0.079388 0.147286 -0.00182539
+-0.0747645 0.0849032 -0.0147477
+-0.0505016 0.107064 0.0390734
+-0.0174992 0.03427 -0.0197565
+-0.01005 0.166619 -0.017705
+-0.0581312 0.0342101 0.0265873
+-0.0613803 0.17096 -0.0575947
+-0.0304965 0.0917653 0.0441169
+-0.0458806 0.10564 -0.0201801
+0.0202101 0.0833915 -0.0271395
+0.0323169 0.0376319 0.0223694
+-0.0223063 0.0380908 0.0216787
+0.035616 0.10962 -0.00284805
+0.0484836 0.0582148 0.031165
+-0.0809138 0.125107 -0.00520991
+-0.00566591 0.0540919 -0.0326394
+-0.00149662 0.114206 0.0415504
+-0.0263202 0.0930635 -0.029586
+-0.0680426 0.110046 0.0381289
+0.0249883 0.12025 -0.003603
+-0.0736149 0.155479 0.0262237
+-0.0299566 0.122268 0.0236125
+0.0238471 0.107154 -0.0155051
+-0.0566015 0.0451895 0.0246815
+-0.028491 0.0987621 0.0434122
+-0.0338535 0.0870951 -0.024854
+-0.0478322 0.0956344 -0.0220665
+-0.0226614 0.177177 -0.0135831
+-0.0810787 0.154935 0.0192662
+0.0439336 0.0428821 0.0236685
+-0.0114115 0.128814 0.0228458
+-0.0417827 0.0840916 -0.0212196
+0.0249862 0.118037 0.0310154
+-0.0641215 0.0336259 -0.00810847
+-0.0795112 0.081834 0.0339273
+-0.041505 0.119362 0.0299569
+-0.0033398 0.119986 -0.0131833
+0.0411805 0.0745986 -0.0077775
+-0.0446675 0.0636475 -0.0137193
+0.00937092 0.0937948 -0.0292997
+0.0415042 0.104246 0.00816492
+-0.0792333 0.169423 -0.0379787
+-0.0414888 0.0437926 0.0421195
+-0.00148881 0.0760516 0.0586512
+-0.0126769 0.0541386 -0.0335166
+-0.00577674 0.0385885 0.0246132
+-0.0394947 0.0676998 0.0417669
+0.0147262 0.129115 0.00511474
+-0.0045144 0.0774415 0.0584948
+0.0334512 0.0365216 0.00521608
+-0.0662857 0.0625946 -0.00141881
+-0.0659868 0.0418098 -0.00430732
+-0.0485691 0.0460686 -0.00963735
+0.0269239 0.0493817 -0.018692
+-0.0652895 0.175332 -0.0607504
+0.0558431 0.0722822 0.0186151
+0.0389971 0.039341 0.0203664
+-0.0252734 0.05785 0.0399799
+-0.0537245 0.0723552 -0.016258
+-0.0214963 0.104399 0.0429755
+-0.0649507 0.13395 0.041174
+-0.0641915 0.179229 -0.0572988
+-0.00649249 0.110023 0.0430195
+-0.0925801 0.120153 0.0312943
+0.0364682 0.111067 0.00216795
+-0.0487462 0.118344 0.031163
+0.0272987 0.047751 0.0374572
+-0.0235246 0.079724 0.0545007
+0.044563 0.0819287 0.0241608
+0.018083 0.0887399 0.0491141
+0.0180337 0.115273 -0.0142355
+-0.0838753 0.135332 0.0479212
+-0.0707318 0.154624 0.0301689
+-0.0897339 0.0916034 0.0174376
+-0.0487526 0.0782553 -0.019094
+-0.021696 0.0567795 -0.0319795
+-0.0524624 0.139899 0.000243693
+-0.016317 0.0384896 0.0261516
+-0.0172081 0.172701 -0.0233314
+-0.0664965 0.109745 0.0377695
+-0.0117557 0.0345134 -0.025836
+-0.000654571 0.0391799 -0.00969942
+0.00820345 0.083757 -0.0326005
+-0.0458982 0.107069 -0.0194756
+-0.0567459 0.15948 0.00480369
+0.00650779 0.0575337 0.0533257
+0.037787 0.0377202 0.0142753
+0.00846774 0.13132 0.015646
+-0.0475009 0.0425468 0.0439593
+-0.0766415 0.100814 0.0361238
+-0.028614 0.0408765 -0.0296027
+0.00929873 0.115842 -0.01682
+-0.0828745 0.119161 -0.00328383
+-0.0769895 0.0790529 0.034321
+-0.0878006 0.151251 0.0245374
+0.0208653 0.122279 0.030221
+-0.00768551 0.130297 0.0183702
+-0.0545511 0.0430136 -0.00860983
+0.030217 0.0843227 -0.0201565
+-0.0467665 0.152145 0.00944802
+-0.0631219 0.156103 0.0153645
+-0.0681832 0.155264 -0.0517309
+0.0142805 0.0345676 -0.0138073
+-0.0664934 0.0624679 -0.000297249
+-0.0641994 0.16384 -0.059407
+0.0464327 0.0769932 0.014129
+-0.041507 0.0591281 0.0403212
+0.0223695 0.0993436 -0.0211483
+-0.088603 0.087513 0.0164636
+0.00038562 0.0392239 -0.00953586
+0.0270604 0.0795391 0.0462139
+-0.0684865 0.0611195 0.0150424
+0.0105195 0.053345 0.0519069
+-0.0620106 0.15528 -0.0315878
+-0.00991465 0.0385501 0.00204441
+-0.0151984 0.171233 -0.0237028
+-0.026193 0.171192 -0.0190186
+0.0404914 0.0541681 0.032094
+-0.0115119 0.181449 -0.0261319
+-0.027122 0.166756 -0.0173778
+0.0338583 0.105892 -0.0101458
+-0.0671444 0.0628365 -0.000338348
+-0.0788571 0.120751 -0.0060883
+-0.0525645 0.0417313 -0.0101531
+0.0278652 0.0996344 -0.0174729
+-0.0681363 0.122845 0.0524474
+-0.0228108 0.0770465 -0.0385748
+-0.0135961 0.12464 -0.00600832
+-0.00365126 0.0525899 -0.0316543
+-0.068996 0.139931 -0.00789046
+-0.0310262 0.153728 -0.00354608
+-0.0497211 0.131062 0.0298847
+-0.00109314 0.103948 0.0441727
+-0.0204702 0.16083 -0.0136222
+-0.0865394 0.109089 0.0183378
+0.0400949 0.095337 0.0300286
+-0.0693797 0.128452 0.0506772
+-0.0438868 0.107083 -0.0199439
+-0.0470477 0.150201 -0.00445632
+-0.0370064 0.121579 0.0285082
+0.0198288 0.120602 -0.00797301
+-0.0549804 0.0334872 0.0101333
+0.00782186 0.127915 -0.00384433
+-0.0495314 0.12548 0.031876
+-0.0926082 0.117405 0.0243082
+-0.0215209 0.0382567 0.0252967
+0.00181128 0.125691 -0.00735123
+-0.0771897 0.117737 0.0516815
+-0.0554751 0.0519418 -0.00338574
+-0.0771699 0.154422 0.00455736
+-0.00649896 0.092559 0.0563419
+-0.0704303 0.164039 -0.0149268
+-0.036643 0.118048 -0.0128637
+-0.0535056 0.136701 0.0296589
+-0.0594928 0.0761776 0.0424443
+-0.00649656 0.0856337 0.0569558
+-0.0586618 0.0637687 0.0307411
+-0.0650964 0.155112 0.00596226
+-0.0626129 0.0371673 0.0184653
+0.0330114 0.107386 0.0320976
+0.0333812 0.0490928 -0.00645546
+-0.069711 0.1744 -0.043385
+-0.00744712 0.0961017 -0.0318028
+0.0413373 0.0392631 0.0117259
+-0.0487556 0.137056 0.00741027
+-0.0845701 0.112449 0.0449336
+0.0531449 0.0608429 -0.00288049
+-0.0358592 0.10284 -0.0213952
+-0.0778493 0.11932 -0.00645768
+0.0172333 0.0750251 -0.0287502
+-0.0195083 0.11546 0.0373373
+-0.0542618 0.0348321 -0.0120282
+-0.0344386 0.125663 -0.00162003
+-0.0690003 0.160066 -0.00858817
+0.0285895 0.0979793 -0.017709
+0.015268 0.0341755 -6.02454e-05
+-0.012432 0.12921 0.00653602
+-0.0222335 0.171216 -0.0204735
+-0.0656059 0.0615317 0.0026003
+-0.0324965 0.174231 -0.00238999
+-0.0398336 0.0384391 -0.0280596
+-0.0513902 0.122634 0.0344378
+-0.0735123 0.142806 0.0460464
+-0.0703661 0.16678 -0.0206717
+0.0128439 0.0343776 -0.0158182
+-0.074941 0.152735 -0.0189
+-0.0785348 0.0771858 -0.00655705
+0.0347176 0.114447 0.00679736
+-0.0192836 0.0385916 0.0308544
+-0.00226925 0.130756 0.00454173
+-0.0622845 0.161545 -0.0405978
+-0.0687671 0.0900946 0.0427048
+-0.028252 0.050761 -0.0234049
+-0.0818245 0.107456 0.0283887
+0.0216927 0.103078 -0.0191449
+-0.0539655 0.0364915 -0.0115887
+-0.0577688 0.142406 -0.00278963
+0.0347443 0.08354 0.0397721
+0.041088 0.0912985 0.0296287
+0.0209984 0.0578395 0.0478214
+-0.0607897 0.155834 0.0118473
+-0.0427999 0.167662 -0.00952768
+-0.0135045 0.0870342 0.0571061
+0.0551275 0.0637038 0.000299703
+-0.0500088 0.124901 -0.00796654
+0.040891 0.0917758 -0.00909975
+-0.057302 0.152908 0.030569
+-0.0490908 0.140152 0.0103957
+-0.062514 0.0399436 -0.00751704
+-0.0901142 0.14065 0.0241685
+-0.0614977 0.0847334 0.0442553
+0.00401707 0.125848 -0.00755459
+-0.0295217 0.0402041 -0.0298306
+-0.0770884 0.0866038 -0.0125752
+0.00250242 0.0441898 0.0459568
+-0.0884166 0.13498 0.0042424
+-0.0144984 0.11138 0.0412273
+-0.0543527 0.155034 0.0127444
+-0.0485461 0.135607 0.0194861
+-0.0763654 0.155962 0.0179624
+0.0194741 0.0351845 0.0201392
+0.0604235 0.0678625 0.0131519
+-0.0147437 0.0383723 0.00849375
+0.0123077 0.035562 0.0436453
+-0.0878555 0.0861109 0.00948006
+0.0461918 0.0820393 0.0121748
+-0.0376617 0.0344352 0.0359896
+-0.0640313 0.13251 0.040793
+0.00650251 0.122426 0.0350167
+0.046473 0.0747304 0.00699979
+-0.090578 0.13228 0.00723516
+-0.0665138 0.0986787 0.0417758
+-0.0753611 0.0724331 0.0302407
+-0.0737585 0.160179 -0.00884095
+-0.0875779 0.102333 0.0213648
+-0.0213902 0.0905176 -0.0361974
+-0.0663379 0.132604 0.0444522
+0.0420458 0.0817019 -0.00677657
+-0.0739471 0.131099 -0.00783391
+-0.00249367 0.0925505 0.0559214
+-0.0748382 0.149925 -0.0278668
+-0.0734967 0.126028 0.0530224
+-0.0386362 0.117281 -0.0140679
+0.00347668 0.0964809 0.0526894
+0.0453833 0.074968 0.00220665
+0.012072 0.11405 -0.0168987
+-0.0774663 0.168085 -0.0299733
+-0.0534988 0.0761753 0.0426023
+-0.0233682 0.126286 0.00541909
+-0.00704598 0.0392708 0.0363567
+-0.0791658 0.0990564 -0.00863296
+-0.0464518 0.0945568 0.0436355
+-0.0404194 0.128239 0.00205017
+0.0393898 0.107905 0.00701069
+-0.0398611 0.0338561 -0.0163385
+-0.0665222 0.156255 0.0214077
+-0.0672076 0.171872 -0.0410051
+-0.0708261 0.144835 -0.0182015
+-0.0650483 0.0701635 0.0361166
+-0.00764186 0.11082 -0.0214014
+-0.0836837 0.151385 0.0303528
+-0.0496912 0.162854 0.00564102
+-0.0114821 0.125053 0.0306553
+-0.0713615 0.158186 -0.0419305
+-0.0348112 0.0336186 -0.0263013
+-0.0652015 0.0334423 0.00269659
+-0.00682217 0.0390777 -0.0108403
+-0.0745121 0.155307 0.0054919
+0.00849016 0.0441134 0.0451901
+-0.041821 0.0914074 -0.0230213
+0.0243874 0.048835 -0.0205112
+-0.0578612 0.158406 0.00308521
+-0.0781467 0.116431 0.0503206
+0.0429791 0.071952 -0.00379352
+-0.00196689 0.131088 0.00752604
+-0.0728984 0.156837 -0.0329194
+0.00543206 0.119469 -0.0147017
+-0.00442631 0.0386612 0.00487339
+-0.089531 0.0983552 0.0174009
+0.00679264 0.0379024 -0.00704418
+-0.0255688 0.0356598 0.0531386
+-0.0343151 0.0794495 -0.0245241
+-0.0124944 0.0870249 0.0570339
+-0.0710693 0.155098 0.0285743
+-0.0663511 0.0350877 0.0310837
+0.00349789 0.122445 0.0347995
+-0.0414975 0.045132 0.0414403
+0.0348194 0.0365264 0.00732462
+-0.0740113 0.141343 -0.00688783
+-0.0303332 0.0706347 -0.0294852
+0.0503042 0.0691243 0.0253774
+-0.0701319 0.158154 -0.0479233
+-0.0358242 0.0915039 -0.0239402
+-0.0645394 0.0596403 0.015406
+0.0213135 0.0650138 -0.0271409
+0.0262112 0.0873747 -0.0229809
+-0.052671 0.112615 -0.017101
+-0.0592898 0.045994 0.0417021
+-0.0717164 0.163822 -0.0439567
+0.0178664 0.127935 0.017674
+-0.0655034 0.108381 0.0382088
+0.0278762 0.0942373 0.043974
+-0.0457869 0.0855328 -0.0217062
+-0.0643109 0.169365 -0.0428818
+0.0100266 0.0346111 0.0241784
+-0.00361434 0.0341476 -0.0187856
+-0.0389438 0.047744 -0.0146455
+-0.0676963 0.0648397 0.0261272
+-0.0374998 0.0691046 0.0417769
+-0.0568378 0.0613597 0.0260949
+-0.0369296 0.036554 0.0451414
+-0.0284901 0.0688983 0.0393825
+-0.0534824 0.0340932 0.0259063
+-0.0631168 0.15992 -0.0455978
+-0.0444353 0.0335419 -0.0188134
+-0.0168224 0.0960286 0.0515795
+-0.076233 0.145832 -0.00587217
+-0.0231748 0.0709692 0.0487695
+-0.0104382 0.0354056 -0.0175403
+-0.0897878 0.136555 0.0351995
+-0.0717761 0.0344583 0.000444464
+0.0353682 0.103387 0.0319873
+-0.00977607 0.0770524 -0.0379416
+0.00551406 0.0375423 0.0260562
+-0.00350144 0.0675505 0.0564719
+-0.0564947 0.102955 0.042036
+-0.061361 0.0336079 0.00692461
+0.00850062 0.121038 0.0360118
+0.0202826 0.0693621 -0.0284085
+-0.00908512 0.169637 -0.0217386
+0.0255848 0.123614 0.0162626
+0.0234098 0.0871372 -0.0242525
+0.0269727 0.112042 -0.0107557
+0.0262833 0.0935743 -0.0210485
+-0.059 0.0412164 0.021703
+0.0345357 0.0373492 0.0194302
+0.0530102 0.0462982 0.0132036
+-0.00365111 0.0511553 -0.0312289
+-0.0591025 0.0338635 0.0178635
+-0.0144888 0.0673806 0.0542261
+-0.0416194 0.0336308 -0.0257822
+-0.0186097 0.0407857 -0.0282477
+-0.0298888 0.0474725 0.0462905
+-0.00306646 0.0386027 0.0233477
+0.0330707 0.110451 -0.00703014
+0.0146846 0.037467 0.0442233
+-0.0390505 0.154795 -0.00905663
+-0.0306702 0.0891071 -0.0265975
+-0.090498 0.131069 0.0362301
+-0.0189866 0.10628 -0.022556
+-0.0125142 0.181139 -0.0289621
+-0.0236648 0.0522261 -0.0284113
+-0.0564969 0.100177 0.0431307
+-0.0314961 0.10429 0.0412052
+-0.0509168 0.0335668 6.7085e-05
+-0.0773495 0.081875 0.035997
+-0.0834254 0.141805 0.00220396
+0.00104126 0.108173 -0.0205653
+0.0181741 0.0988563 -0.0226017
+-0.0797776 0.115912 0.0485816
+-0.0816869 0.0734846 0.011537
+0.00150486 0.0856703 0.0573817
+-0.00849476 0.0745791 0.0575173
+-0.00549893 0.0939194 0.0556385
+0.0221626 0.0490425 0.0405889
+0.0363661 0.0873006 -0.0164353
+0.0491174 0.0712134 0.0219878
+-0.079214 0.155524 0.0184351
+-0.0654627 0.0598015 0.0150426
+0.0330982 0.0626311 -0.0167961
+-0.0839336 0.126519 -0.00402298
+-0.00950667 0.125161 0.0310898
+0.0292092 0.0563773 0.0403225
+-0.0273861 0.0720614 0.0416635
+-0.0647467 0.0379255 0.0402853
+-0.0521847 0.140082 0.0224024
+-0.0276164 0.0422898 -0.0293674
+0.0360108 0.100867 -0.0107814
+-0.0946899 0.124172 0.0202666
+0.0446233 0.0903218 -0.000806954
+-0.00230838 0.0348204 0.04129
+0.00391726 0.126651 -0.0064175
+-0.0633881 0.0336212 0.00649796
+0.00838362 0.046349 -0.0258656
+-0.0577252 0.156918 0.00853143
+-0.0693669 0.17099 -0.0332104
+0.0249955 0.0347512 0.0143719
+0.00961895 0.12141 -0.0128393
+0.021665 0.0416371 -0.0126942
+-0.0521438 0.0568294 0.0272279
+-0.0628733 0.0996403 -0.0179913
+0.0218834 0.0415901 -0.0107198
+-0.0546838 0.0435714 0.0206922
+-0.0176301 0.183064 -0.0184359
+-0.00750517 0.0471136 0.0478292
+-0.0520933 0.154615 -0.00405641
+-0.0865732 0.0860822 0.023453
+-0.0665787 0.163768 -0.0579853
+0.00636801 0.0479975 -0.0276935
+0.0368613 0.0587703 -0.00975684
+-0.0879266 0.10368 0.0183585
+-0.016623 0.0450359 -0.0278307
+-0.0895401 0.135156 0.0272131
+0.000356348 0.0496808 -0.0306188
+-0.0836962 0.138005 0.0462469
+0.0441945 0.077668 0.0251701
+-0.0685147 0.0930476 0.0422841
+-0.0232574 0.100051 -0.0240138
+-0.03748 0.0548048 0.0392179
+-0.0293599 0.15815 -0.0119938
+-0.021522 0.0336815 -0.0237529
+0.00128503 0.0655494 -0.0343406
+-0.0861178 0.0953813 0.000442214
+0.0350885 0.099465 0.0350983
+-0.0779853 0.13835 -0.00526914
+-0.0857179 0.124363 0.0486993
+-0.0309707 0.163858 -0.00458082
+-0.0722468 0.174258 -0.0400013
+-0.0149026 0.105901 -0.0222117
+-0.0673665 0.165482 -0.0209987
+-0.0876017 0.152029 0.0126504
+-0.0220763 0.0666765 0.0478151
+-0.0624814 0.094591 0.0443423
+-0.0196147 0.0379102 -0.0280301
+-0.0346582 0.0422066 0.0469558
+-0.0199036 0.0739897 0.0538964
+-0.00877818 0.0387104 -0.00343461
+0.000535895 0.0548656 0.0545076
+-0.0454881 0.10014 0.0423159
+-0.0404927 0.0958661 0.0421915
+-5.87354e-05 0.100974 -0.0229378
+-0.0283024 0.0362399 -0.0299084
+0.026308 0.0822369 0.0469135
+-0.06337 0.156813 -0.0136043
+-0.0624231 0.0357528 0.0196573
+-0.0709978 0.0698591 0.0316215
+-0.00550273 0.0661441 0.0562254
+0.00539692 0.0418924 -0.0240197
+-0.0711187 0.0642492 0.0206358
+-0.0614458 0.0606683 0.0222701
+0.0189142 0.0353585 0.00519133
+0.0315596 0.0497964 -0.00774264
+-0.0548596 0.0462919 -0.006395
+0.0010398 0.0392387 0.0326514
+0.0448141 0.0889533 0.0211601
+-0.0898897 0.136442 0.013225
+0.0409408 0.0873455 0.0311847
+-0.0866496 0.106304 0.00937201
+0.0315171 0.118424 0.0085036
+-0.091229 0.14471 0.0161551
+-0.00263717 0.12924 0.026005
+0.0142425 0.0645148 0.0521595
+-0.0509259 0.0571242 0.0316152
+-0.0585706 0.155353 0.0213449
+0.0242207 0.111888 -0.0125803
+-0.0305755 0.0788685 0.0415824
+-0.0664528 0.145477 0.0410093
+-0.00432524 0.0423738 0.047881
+-0.0434528 0.12491 0.0216806
+-0.0610445 0.045667 0.0306816
+-0.0148175 0.0855384 -0.0388203
+0.0594886 0.0594575 0.00616841
+-0.0740871 0.156873 -0.0259173
+-0.0414785 0.105663 0.0400022
+-0.0376995 0.0680509 -0.0154542
+-0.0698935 0.122364 -0.00881274
+-0.00848477 0.0718045 0.0573713
+-0.0394932 0.127549 -0.000886358
+-0.0856022 0.136615 0.0453504
+-0.0889467 0.143422 0.0321606
+-0.0738723 0.109242 -0.00905672
+-0.0222267 0.0906414 0.0528718
+0.00551724 0.0661119 0.0558057
+-0.0588983 0.0582416 0.00880815
+0.0225876 0.0388978 0.0383164
+0.0022443 0.0974458 0.0519249
+-0.056455 0.12554 0.0394323
+-0.00949777 0.091187 0.0566315
+0.00149085 0.103013 0.043912
+-0.00374904 0.0712712 -0.0357267
+-0.0394946 0.119701 -0.0126173
+-0.0631669 0.152168 -0.0312981
+-0.0139477 0.0625843 0.0539847
+-0.0604937 0.100137 0.0425915
+-0.0749718 0.138395 -0.00644263
+0.00624486 0.0401371 0.0456279
+0.0193551 0.0475975 0.0417872
+-0.0303971 0.0890708 -0.0275789
+0.0196022 0.0462781 0.0421275
+0.0317544 0.0632771 0.0405733
+-0.0662966 0.156977 -0.00759157
+0.0183734 0.0506657 -0.0252113
+0.0404388 0.0427247 -0.00185446
+0.0115151 0.105777 0.0436811
+-0.0301364 0.0349235 0.0476426
+0.0254917 0.0369057 0.0252691
+-0.0850483 0.109026 0.0223524
+0.0157867 0.112048 -0.0167369
+0.0360751 0.0370336 0.00715793
+-0.0781026 0.0818813 0.0353359
+-0.00650962 0.0773868 0.0579538
+-0.0494324 0.0586474 0.0343285
+0.0112135 0.116429 0.0374582
+-0.0555782 0.159581 0.0063787
+-0.0454954 0.160804 0.00677344
+-0.0709975 0.139911 -0.00751202
+-0.0547852 0.0339346 -0.0120065
+-0.079504 0.128859 0.053141
+-0.0155349 0.0459646 0.0502157
+-0.0704857 0.116111 0.0520944
+-0.0454716 0.0404727 0.0442216
+-0.0890267 0.148493 0.027289
+0.0192952 0.126057 0.00111502
+0.00542039 0.0392223 0.0299552
+-0.0509634 0.152153 0.0121451
+0.0432798 0.100122 0.00916351
+-0.0722295 0.16736 -0.0213426
+-0.0311459 0.0354418 0.0504241
+-0.0834736 0.114211 -0.000781836
+-0.0258217 0.181482 -0.0160394
+-0.0517798 0.115481 0.0337859
+-0.0763629 0.108471 -0.00759882
+-0.0757916 0.155001 0.00503825
+-0.0893649 0.111932 0.017326
+-0.0619999 0.132592 -0.00773229
+-0.033844 0.171255 -0.00164046
+-0.0352015 0.153653 0.00157065
+-0.0722895 0.147809 -0.0265569
+-0.0217088 0.114301 -0.017023
+0.026785 0.0955535 0.0441601
+-0.0481378 0.0672057 0.0386531
+-0.026667 0.0823364 0.0504973
+0.00619086 0.131536 0.009113
+-0.0526119 0.0580506 0.0248562
+0.00250286 0.0576093 0.0540213
+-0.0810169 0.0953587 0.0335948
+0.029848 0.0875415 0.0432926
+0.0464379 0.0778615 0.0131806
+-0.0134997 0.0856507 0.057198
+0.0263535 0.0795425 0.0469281
+-0.0265857 0.0603669 0.0385952
+-0.0334943 0.11802 0.0311453
+-0.00337868 0.117905 -0.0149619
+-0.0660268 0.177263 -0.0521591
+-0.0238887 0.156697 -0.00604726
+-0.00760592 0.125948 -0.00752899
+-0.0221488 0.0383333 0.0268965
+-0.0293863 0.155004 -0.00725783
+0.0105543 0.126889 0.0293082
+0.0501729 0.0446765 0.00723117
+0.0310879 0.115727 -0.00269046
+-0.0191314 0.122285 0.0303949
+-0.0777065 0.155692 0.0145746
+-0.0797904 0.152563 0.0316147
+-0.0710154 0.0391332 0.00421404
+-0.0889531 0.100999 0.0124002
+-0.0147295 0.0942902 -0.0339999
+-0.0812191 0.0785924 0.0290188
+-0.0766463 0.0803349 -0.0100768
+-0.0435275 0.152141 0.00710463
+-0.0608313 0.092512 -0.0191943
+0.0227948 0.124775 0.0223512
+-0.0831943 0.132626 0.0501472
+-0.0317593 0.0449779 0.048226
+0.00552401 0.0633596 0.0561453
+-0.0492065 0.128269 0.0305743
+-0.0634388 0.152153 -0.00650488
+-0.0568117 0.135044 -0.00489316
+0.0252231 0.117755 -0.00691168
+-0.0716366 0.0874136 0.0414306
+-0.0725279 0.091561 0.0413901
+-0.0764449 0.084677 0.0378167
+-0.00880306 0.0841017 -0.0380883
+-0.0688616 0.033602 -0.00179476
+0.0161578 0.0988387 -0.0226848
+-0.0829912 0.0966357 0.0312921
+0.00854504 0.101743 0.0468013
+-0.0161113 0.0419173 0.0519008
+-0.0115772 0.0991016 -0.0249869
+0.026625 0.0839457 -0.0229857
+0.0451532 0.0931968 0.0111604
+-0.0264982 0.113889 0.035131
+-0.00351628 0.0442826 0.04692
+-0.0202282 0.0639107 0.048901
+0.0154069 0.0403121 -0.0220991
+-0.0725345 0.140015 0.0475615
+-0.0340447 0.1653 -0.00374721
+0.00850451 0.0883096 0.055394
+-0.0516913 0.0680528 0.0372779
+-0.070167 0.162396 -0.0479528
+-0.0174382 0.127681 0.00469302
+0.0354105 0.0965418 -0.0122281
+-0.0427202 0.152139 0.00651185
+-0.00023381 0.123831 -0.00932637
+-0.073929 0.152666 -0.0308896
+0.0244967 0.0375596 0.0281073
+-0.038496 0.0450464 0.0406484
+0.0424477 0.0803262 -0.00578172
+-0.017618 0.163994 -0.00984759
+0.042638 0.101488 0.0111603
+-0.0114747 0.111375 0.0418865
+-0.0878262 0.152428 0.0199936
+-0.0605498 0.0341606 0.0243603
+-0.0474966 0.088987 0.0447599
+0.0139221 0.0913152 -0.0287052
+-0.0182228 0.038194 0.0115761
+-0.0697006 0.0619862 0.0158161
+0.0317346 0.0619381 0.0405155
+0.0470668 0.0701831 0.0226957
+-0.0222639 0.0783263 0.0546841
+-0.0624118 0.148891 -0.00459657
+-0.0245152 0.111258 0.0385919
+-0.0623581 0.164692 -0.0425931
+0.0189449 0.0348191 0.0239933
+-0.0489525 0.123989 0.0308621
+-0.0294789 0.0732089 0.0403736
+-0.0912678 0.12968 0.0332366
+0.0188735 0.102787 -0.0208351
+-0.0542898 0.0343509 0.030786
+0.0541934 0.0628656 -0.00090927
+-0.024607 0.037979 -0.0290368
+-0.0461075 0.164061 -0.00779976
+-0.00480748 0.0854817 -0.0373491
+-0.0398973 0.160894 0.00183362
+0.0122013 0.0878954 -0.0308742
+-0.0609826 0.13955 0.0346529
+0.01801 0.126774 0.0220214
+-0.0720383 0.149669 -0.0395937
+0.0268545 0.0350543 0.018119
+-0.00249757 0.0952299 0.0546317
+-0.0177632 0.0728777 -0.0388934
+-0.00835092 0.0354934 -0.0172056
+-0.0123646 0.109877 -0.0203825
+-0.0385 0.120755 0.0293207
+-0.0614467 0.0335533 -0.00933279
+-0.0144984 0.108621 0.0424908
+-0.071459 0.151188 -0.0433221
+-0.0227544 0.0753712 0.0524561
+-0.0581897 0.157381 0.00697939
+-0.0588054 0.0825509 -0.0205914
+-0.0254269 0.0781373 0.050782
+-0.0176233 0.0450417 -0.02779
+-0.0345002 0.10287 0.040969
+0.0398172 0.0390737 0.00420564
+-0.0642915 0.169488 -0.0607786
+-0.0391909 0.150688 0.00279786
+-0.0817139 0.108721 -0.00159489
+-0.0691226 0.174646 -0.044619
+0.0542982 0.0579702 -0.00188368
+-0.0903603 0.143336 0.0142018
+-0.0554977 0.109766 0.0379077
+-0.0646073 0.15754 -0.0113176
+-0.0857257 0.0994313 0.000394941
+-0.0634657 0.0730594 0.0392535
+-0.0114926 0.0604332 0.0544994
+0.00136064 0.0481752 -0.0296995
+-0.0476605 0.124307 -0.00939578
+0.00152589 0.0731231 0.0568629
+0.0454513 0.0412382 0.0102351
+-0.0555526 0.124119 0.0389742
+0.0111749 0.035437 0.032711
+-0.0631468 0.156791 -0.0395997
+-0.0364943 0.115224 0.0327734
+-0.0687764 0.180487 -0.0583042
+-0.0558353 0.0912839 -0.0220329
+-0.0487756 0.0826651 -0.0212781
+0.0222353 0.0804964 -0.0261413
+-0.0698715 0.11424 0.0504282
+-0.0534972 0.0732542 0.0410474
+-0.0354707 0.0874527 0.0429689
+-0.0522647 0.117566 -0.0142997
+-0.0687471 0.158212 -0.0056007
+0.0254863 0.0578069 0.043747
+-0.0625026 0.0973365 0.0428841
+-0.00849427 0.0925522 0.0562249
+-0.076914 0.17371 -0.0479126
+0.0285085 0.121244 0.0144975
+-0.0649629 0.0620542 -0.00149187
+-0.0487919 0.135536 0.0203921
+-0.0406031 0.160882 0.00257136
+-0.0717214 0.0807275 -0.0154713
+-0.0759462 0.128163 -0.00785989
+0.0065117 0.129736 0.0249737
+-0.00106791 0.0391062 -0.00597311
+-0.0539473 0.03352 0.0103166
+0.0264479 0.103016 -0.017087
+0.0368588 0.0672041 -0.0137655
+-0.0209608 0.0380992 0.0183358
+-0.0922682 0.12272 0.00827864
+-0.0758891 0.119352 -0.00728174
+-0.0619808 0.0469192 0.00268857
+0.0286963 0.0991802 -0.016993
+0.0173223 0.125777 -0.00156033
+-0.071812 0.0879125 -0.0161091
+-0.0634945 0.102894 0.0414572
+-0.0534816 0.0491363 0.0336594
+-0.0677428 0.164471 -0.018256
+0.0418243 0.102828 0.00318021
+-0.0345003 0.0347932 0.0310568
+-0.0508009 0.0912872 -0.0218676
+0.0344847 0.0868408 -0.0179179
+0.0193386 0.0579734 -0.027391
+-0.0621388 0.0334692 0.00329381
+-0.017215 0.175671 -0.0245809
+-0.0538714 0.0449084 0.0167075
+0.0201621 0.124133 -0.00175315
+0.00612185 0.108732 -0.0201634
+0.0101112 0.110138 -0.0193681
+0.0407992 0.0698146 0.0307925
+-0.0186672 0.0495328 -0.0300927
+-0.0804551 0.134426 0.050865
+-0.0719585 0.0377493 0.00378419
+0.00950065 0.0688226 0.0549942
+0.0451024 0.091769 0.003186
+0.0116064 0.121838 0.0345253
+-0.07744 0.155698 0.0205089
+0.0154982 0.118174 0.0357451
+0.0455409 0.0918154 0.00916522
+-0.0825371 0.14737 0.037761
+0.00019241 0.0853625 -0.035651
+-0.0413557 0.0405762 -0.0252979
+-0.00795135 0.129264 0.0240771
+-0.00779714 0.0812765 -0.0379169
+0.0279176 0.0508447 -0.0187774
+-0.0851867 0.0791254 0.00650076
+-0.071556 0.161392 -0.00951947
+0.0302201 0.119789 0.0108648
+-0.0664004 0.120055 0.0514481
+-0.0652563 0.0459546 0.00568144
+-0.0484523 0.0349311 0.00836568
+0.050668 0.0451751 0.0191374
+0.0235092 0.118527 -0.00774096
+-0.0799897 0.135372 -0.00407226
+0.0454193 0.0875784 0.00318139
+0.0218862 0.107458 -0.0158341
+0.0519418 0.0525693 0.0274887
+-0.0174883 0.044685 0.0517611
+-0.0503006 0.134918 0.0263293
+-0.0797918 0.11331 -0.00252121
+0.0170867 0.039703 -0.0206999
+-0.00603107 0.130744 0.0146461
+-0.0614566 0.0372076 0.0201515
+-0.0634342 0.039353 0.0417984
+-0.0520389 0.0545474 0.0246248
+-0.0700192 0.172057 -0.036324
+0.0425828 0.0778099 0.0282065
+-0.0943409 0.12415 0.0172628
+-0.03739 0.165304 0.000185179
+0.0380556 0.0834519 0.0357476
+-0.0140374 0.0384483 0.0012996
+-0.0834291 0.14469 0.0401339
+-0.055347 0.0335038 0.00284205
+-0.0577441 0.0590406 0.000553128
+-0.0586534 0.154964 0.024223
+-0.0627416 0.148221 0.0374769
+-0.0597552 0.0781833 -0.0189903
+-0.0882134 0.141936 0.0111996
+0.0441966 0.0973694 0.0101636
+0.00324014 0.0740573 -0.0349749
+-0.0320743 0.0763998 -0.0305477
+0.0424682 0.0642865 0.0278791
+0.00647808 0.111357 0.041027
+0.0241747 0.0351145 0.0138772
+-0.0842625 0.100702 -0.00260902
+-0.0538049 0.0486373 0.0382673
+0.0033632 0.097467 -0.0272178
+-0.0526204 0.141613 0.022402
+0.0331357 0.0570437 -0.0137102
+0.00753436 0.104363 0.0436686
+-0.029494 0.0631194 0.0377814
+0.0357221 0.0994501 0.0342567
+0.0398205 0.0604422 -0.00479028
+-0.0134826 0.109991 0.0421694
+-0.0618817 0.161578 -0.0325898
+-0.00560304 0.0434101 -0.0260312
+-0.0274608 0.0473022 0.0495228
+-0.065855 0.0967089 -0.0173163
+-0.00276158 0.0698244 -0.0351738
+-0.00250067 0.110029 0.0428965
+0.0142116 0.123033 -0.00860213
+-0.0633963 0.145356 0.0382744
+-0.033621 0.0519746 -0.0102559
+0.0385319 0.0997972 -0.00779458
+0.0312326 0.118751 0.0098088
+-0.011143 0.128894 0.00267925
+-0.0574832 0.0833327 0.0441985
+-0.0668542 0.114225 0.0472279
+0.0369848 0.0561762 0.0322
+-0.0688663 0.102328 -0.014772
+-0.0246521 0.0478035 -0.0267776
+-0.0806498 0.110292 0.0422048
+-0.0475911 0.163428 -0.00670042
+-0.00358669 0.0376696 -0.025221
+-0.0499193 0.118992 -0.0138138
+-0.0766944 0.171427 -0.0358927
+0.0174979 0.126711 0.000451693
+-0.0107378 0.177152 -0.0244143
+0.0397983 0.0672171 0.0328832
+0.00289976 0.039936 0.0460731
+0.030847 0.0875798 0.0429743
+-0.0394926 0.102848 0.0402648
+0.00332264 0.0568618 -0.0316357
+-0.0367537 0.0783235 -0.0195335
+-0.038823 0.0928858 -0.0233898
+-0.0644838 0.0931562 0.0439721
+-0.0298466 0.0385336 -0.0167929
+-0.0548009 0.0449973 0.0226803
+0.0118375 0.0344099 -0.0160341
+-0.0683506 0.181259 -0.055895
+-0.0107728 0.0387832 -0.00390135
+-0.0300375 0.0890464 -0.0285748
+-0.0710857 0.168903 -0.0252489
+-0.0757782 0.149978 -0.0188682
+0.030839 0.0995119 0.0394948
+-0.0329249 0.0369927 0.0503412
+-0.0732448 0.144163 -0.0109449
+-0.0897565 0.140652 0.029182
+-0.0735905 0.154201 0.0306806
+0.00579855 0.0347845 0.042995
+-0.0519166 0.0545256 0.0236155
+-0.01212 0.102458 0.0438351
+-0.0211595 0.178661 -0.0149212
+-0.014608 0.0421127 -0.0270124
+-0.0885789 0.0922253 0.0228661
+-0.0145885 0.128899 0.00863716
+0.010498 0.0909888 0.0536897
+-0.0066489 0.0388823 -0.00316153
+-0.0258212 0.0839605 -0.0371412
+-0.0797525 0.15498 0.0124103
+-0.0414563 0.108465 0.0385585
+-0.0525315 0.149847 0.0192949
+-0.0156627 0.184575 -0.0209705
+0.0428837 0.0887839 -0.00581701
+0.0242564 0.0734016 -0.0257301
+0.0192994 0.062217 -0.0274738
+-0.0310269 0.122601 -0.0056394
+-0.0569847 0.153801 0.0277423
+-0.0526515 0.0504392 0.0286525
+0.00150192 0.0634213 0.0567922
+-0.0838556 0.139345 0.0449552
+-0.0476133 0.0562658 -0.0107838
+-0.0527007 0.0693372 -0.0141095
+-0.0311494 0.157393 -0.0113544
+0.00313658 0.0348497 0.0441849
+-0.0311581 0.17265 -0.0162683
+0.0453494 0.0847845 0.0201731
+0.0285114 0.0619268 0.0428923
+0.000499004 0.0634057 0.0567297
+0.00751117 0.0575089 0.0530994
+-0.000499443 0.114191 0.0415203
+-0.0794921 0.146102 0.0417961
+-0.0252738 0.0381933 0.0263814
+-0.0376796 0.16681 0.00156763
+0.0387661 0.0870401 -0.0137857
+0.0296088 0.12015 0.0163431
+-0.0938694 0.121489 0.0252875
+-0.0396002 0.125498 -0.0067103
+0.0370837 0.103994 -0.00683208
+-0.0465559 0.0461276 -0.0102455
+0.0404351 0.0389029 0.0137659
+-0.0424925 0.100104 0.042001
+-0.0285717 0.12063 0.0270994
+-0.0800863 0.148726 0.0380799
+0.00214563 0.119376 -0.0145717
+-0.0288792 0.104408 -0.0227314
+-0.0312735 0.034639 0.0229335
+-0.0669165 0.12238 -0.00897156
+-0.0890273 0.0956446 0.021399
+-0.0897683 0.091592 0.0154417
+-0.0739499 0.156872 -0.0269145
+0.00919729 0.039194 0.0451612
+-0.0374937 0.109757 0.0368609
+0.0523694 0.0545712 -0.00274385
+-0.0339801 0.0348087 0.0434578
+-0.00541562 0.128879 0.0264449
+-0.0636022 0.151642 0.0357576
+-0.0693902 0.0672718 0.0289371
+-0.0220481 0.121595 -0.00868192
+-0.0390536 0.127857 0.00108873
+-0.090122 0.144414 0.0285066
+-0.0629168 0.114269 -0.0126902
+-0.0930993 0.129616 0.0162363
+-0.0325132 0.0575193 0.0378292
+-0.0193156 0.162502 -0.00702982
+0.00550789 0.0910775 0.054811
+-0.0234801 0.168298 -0.011313
+0.0473422 0.0575607 -0.00551801
+0.0214637 0.0989203 0.04607
+-0.0827604 0.106087 -0.00164696
+-7.52397e-05 0.037877 0.020989
+-0.0345343 0.126083 0.0189612
+-0.0512338 0.164096 -0.00192926
+-0.0477776 0.0826677 -0.0211258
+-0.0368214 0.16531 -0.000729186
+-0.0673944 0.162815 -0.015253
+-0.0186701 0.0971551 0.0477534
+-0.0366241 0.0360289 0.0452882
+-0.0195815 0.0341867 -0.0200865
+0.0298019 0.0862025 0.0431971
+-0.0932655 0.120203 0.038289
+-0.000505415 0.110024 0.0426421
+-0.0191383 0.16678 -0.0189611
+0.0173062 0.0421724 0.0440438
+0.0105403 0.105742 0.0436489
+-0.0345641 0.11594 -0.0146748
+-0.0944618 0.125537 0.019259
+-0.0679091 0.108046 -0.0128123
+0.0268137 0.118694 -0.00391821
+-0.0577288 0.0738232 -0.0175832
+-0.0494959 0.0988033 0.0435442
+0.0425948 0.0873487 -0.0068057
+-0.0366079 0.114094 -0.0167422
+-0.0064886 0.118022 -0.0150746
+-0.0694599 0.155751 0.00874428
+-0.0727804 0.0887809 0.0411113
+-0.0921325 0.117269 0.0252198
+-0.0769942 0.154149 -0.012901
+0.00413641 0.0979047 -0.0256761
+-0.0504737 0.113932 0.0347324
+-0.00655213 0.0389811 -0.00882376
+-0.021105 0.0431099 0.0534593
+-0.0732611 0.161033 -0.0359392
+-0.0668535 0.0938084 -0.0173106
+0.0523234 0.0724358 0.00729932
+-0.02575 0.0536249 0.0391706
+-0.0529014 0.114056 -0.0162353
+-0.0887923 0.1378 0.0112057
+-0.0604332 0.0585193 0.0100455
+-0.0105014 0.0546468 0.0522278
+0.0475389 0.0482604 0.0280949
+0.00247406 0.123881 0.0337357
+0.0282809 0.0389301 0.0276504
+-0.0903128 0.141958 0.0142327
+-0.0457178 0.0724199 -0.0170809
+-0.0393802 0.149525 0.00137589
+-0.0384762 0.128323 0.0101316
+-0.0387951 0.0343342 0.0305488
+-0.0627886 0.154765 0.0285735
+-0.044804 0.0884409 -0.0220028
+0.00621048 0.0851628 -0.0331463
+-0.0124997 0.0938947 0.0551641
+-0.0760018 0.163203 -0.0170986
+-0.0568081 0.154369 0.0248865
+0.0141304 0.056278 0.0501629
+-0.000201542 0.0357861 0.0174114
+-0.0687337 0.0764635 -0.0155195
+-0.0465141 0.0518831 0.0377757
+0.0306859 0.0377485 0.0237503
+-0.0887758 0.149859 0.0255696
+-0.0468066 0.088437 -0.0220186
+-0.0104567 0.111397 0.0420636
+0.00949238 0.0487693 0.0494463
+-0.0344171 0.0343826 0.0278837
+-0.0747225 0.161031 -0.0319529
+-0.00127097 0.123959 0.0338052
+0.0484686 0.0511467 0.0294828
+0.0216142 0.042218 0.0415059
+0.0159587 0.0874032 0.0512942
+-0.0579584 0.0336225 0.00939861
+0.0262865 0.0689766 -0.0234385
+-0.0457839 0.11676 -0.0154906
+-0.0431023 0.149502 -0.00451393
+0.0575358 0.0592738 0.00218909
+-0.0907151 0.116093 0.0293225
+-0.0626986 0.0658458 -0.00782349
+-0.0680529 0.0874243 0.0435129
+-0.0323521 0.0336874 -0.0296376
+-0.0208013 0.108893 -0.0213287
+0.00800637 0.0345135 0.0400968
+0.0600686 0.0650603 0.0191749
+-0.0881094 0.0861284 0.0104766
+-0.0292466 0.166794 -0.00735295
+-0.0455037 0.159315 0.00726546
+-0.0361152 0.127822 0.0095198
+-0.00430156 0.130062 0.00233767
+-0.032509 0.0506603 0.0384213
+-0.0316129 0.119551 -0.0104429
+0.0414143 0.104258 0.0111621
+-0.075527 0.0733333 0.0311756
+-0.0549715 0.161246 0.00205939
+-0.0503915 0.140104 0.0183826
+0.0152276 0.0835585 -0.0295949
+-0.0464862 0.0718998 0.0415251
+-0.00551998 0.0732424 0.0584734
+-0.0900165 0.133639 0.00622839
+-0.069719 0.0887582 0.0422978
+0.00474777 0.0367585 0.0247919
+-0.027126 0.165248 -0.0165316
+-0.0283135 0.0350192 0.0513697
+-0.0318897 0.0721821 -0.0275085
+0.0437433 0.0945326 0.0221692
+-0.0126802 0.0961728 -0.031918
+-0.0567215 0.04662 0.0276747
+-0.00532834 0.0367049 -0.0158504
+-0.0529595 0.0335568 -0.000338033
+-0.0240311 0.112816 -0.0174462
+0.01097 0.0520216 0.0508135
+-0.0328411 0.0915526 -0.0242438
+-0.0552728 0.0335199 0.0136226
+-0.0820994 0.104661 -0.00359906
+0.035799 0.0558975 -0.00871505
+-0.0868952 0.0991223 0.0252196
+-0.0296012 0.120713 0.0267425
+-0.0695324 0.125657 0.0522171
+-0.0424937 0.0790081 0.0428161
+-0.0632658 0.0419596 0.040132
+-0.0699149 0.161541 -0.0103834
+-0.0345105 0.0676457 0.041143
+-0.00514301 0.0997589 0.0492461
+-0.0697588 0.147131 -0.0275571
+0.0580762 0.0648724 0.00314588
+0.0241035 0.1245 0.0085821
+0.0377445 0.110141 0.00501649
+0.0413546 0.0999884 -0.00181466
+0.0180964 0.0604579 0.0488964
+-0.0341434 0.0780256 -0.025502
+0.0365014 0.0756142 -0.0127863
+0.0485013 0.0651587 0.0285278
+-0.0331365 0.162399 -0.0024379
+-0.0578171 0.08688 -0.0211007
+-0.0591308 0.125513 0.0408421
+-0.0248084 0.0826031 -0.0377611
+-0.00847175 0.0920515 -0.0356471
+-0.0281451 0.166722 -0.0170726
+0.0321478 0.0740867 0.0412125
+-0.0318598 0.0496767 -0.0173511
+-0.0683644 0.0381281 -0.00463362
+-0.0293612 0.0383343 -0.00169706
+-0.0546971 0.0334232 0.00665025
+-0.0604511 0.0584329 0.0155226
+0.0356702 0.108162 -0.00482135
+-0.087994 0.0981671 0.00544953
+0.042672 0.0737568 0.0282004
+-0.0414969 0.095865 0.0421344
+0.0227593 0.0727654 0.0487302
+0.0247922 0.121532 -0.00113746
+0.0282353 0.0775351 -0.0225519
+-0.0487687 0.0559317 0.0351683
+-0.0192566 0.180095 -0.0235875
+-0.0250606 0.0603159 -0.031412
+-0.0310964 0.160762 -0.0139612
+0.0143682 0.0767494 0.0542274
+-0.0714649 0.159596 -0.0419316
+0.0454023 0.0875829 0.0161653
+-0.0354973 0.0470472 -0.0223112
+-0.0465703 0.0490167 -0.00974944
+0.025334 0.0435501 0.0381106
+-0.0785372 0.168054 -0.0329755
+-0.0148858 0.0985034 0.047376
+-0.0302927 0.117007 -0.0138211
+-0.0802651 0.0963563 -0.00854135
+-0.030624 0.0348272 -0.0303515
+-0.000406928 0.0996624 0.04942
+-0.0576871 0.0335309 0.00594357
+-0.0923088 0.114683 0.0143254
+0.00732004 0.0351406 -0.00439972
+-0.00948171 0.174183 -0.0285537
+-0.0320503 0.12646 0.00953655
+0.0270529 0.0822264 0.0462092
+-0.0900419 0.139254 0.023178
+-0.0498185 0.0927102 -0.0215416
+-0.00751389 0.102333 0.0437439
+-0.0775302 0.161724 -0.0197184
+-0.044496 0.0451943 0.0419603
+-0.0362032 0.160944 0.000172036
+-0.0314741 0.053189 0.0369367
+-0.072385 0.158213 -0.0369175
+-0.0860963 0.145967 0.0357039
+-0.0554937 0.100184 0.0430705
+-0.0523102 0.116406 -0.0150785
+-0.0518166 0.09273 -0.0219218
+-0.024907 0.0916549 -0.0335476
+-0.0634479 0.141036 0.0381413
+0.0152366 0.121915 0.0327966
+-0.0631227 0.0445391 0.0377156
+-0.0865336 0.141884 0.00820248
+0.00748358 0.11412 0.0398951
+-0.071965 0.136965 -0.0074383
+-0.0608999 0.058839 0.0168686
+-0.0886398 0.102364 0.0173768
+-0.0688031 0.0659098 0.026726
+0.02824 0.0686155 0.0425458
+-0.0196877 0.127428 0.0169554
+0.0332508 0.0906175 -0.0178979
+0.019654 0.122236 -0.00577023
+-0.0457281 0.151677 -0.00565337
+-0.0685681 0.156629 -0.0529972
+0.0455148 0.0801982 0.0216904
+0.0232513 0.0734458 -0.026356
+-0.0856264 0.110331 0.00634317
+0.032415 0.0383305 -0.000488607
+-0.0697489 0.17084 -0.0530327
+0.0127518 0.0887452 0.0537008
+-0.0650469 0.168333 -0.0359323
+-0.0312058 0.066507 -0.0244549
+-0.0481456 0.14427 0.00342034
+-0.0250932 0.0385898 -0.0121739
+-0.0268796 0.181867 -0.0133655
+-0.0624905 0.0804598 0.0431805
+-0.0664501 0.0353918 0.0342807
+-0.0287674 0.078167 -0.0351681
+0.0384815 0.0729589 -0.0117402
+-0.0325668 0.0347124 0.0262002
+0.0258782 0.0645831 0.0443789
+-0.0486546 0.0620591 -0.0122264
+-0.086684 0.149909 0.029141
+0.0138472 0.123867 0.0319554
+-0.0513866 0.0584422 0.0306256
+-0.00251219 0.0378133 0.00785027
+-0.00926128 0.126278 0.029483
+0.0147315 0.0347337 -0.0176578
+0.0417187 0.066227 -0.00378154
+-0.0149615 0.0883672 -0.0380383
+-0.0678931 0.0900993 0.043242
+0.0149683 0.113515 -0.0163113
+-0.0719356 0.110274 0.042413
+-0.0333618 0.0751438 -0.0264858
+0.0116984 0.034577 0.0227351
+-0.0670519 0.166375 -0.0237602
+-0.0454276 0.0345386 0.0307405
+-0.00249621 0.0883993 0.0567366
+-0.0235661 0.115415 0.0353667
+-0.0944357 0.121484 0.0222838
+0.0334736 0.0940135 -0.0155006
+-0.0436018 0.0519969 -0.0109067
+-0.0781065 0.0948585 -0.0115273
+0.0456581 0.0729488 0.0206934
+-0.0274951 0.157765 -0.0111917
+-0.00306441 0.100922 0.0454807
+-0.0618021 0.116863 0.0404147
+-0.0344937 0.041903 -0.0294247
+-0.0427476 0.159417 0.00474491
+0.0374917 0.0484328 0.0317174
+-0.00814387 0.0339061 -0.0213361
+-0.0737927 0.132633 0.0513524
+-0.0397231 0.116184 -0.0149076
+-0.00950395 0.0773592 0.0576807
+-0.0505908 0.03436 0.0298011
+0.0187381 0.119283 0.0342968
+0.00523462 0.075444 -0.0346019
+-0.0321194 0.165225 -0.0156285
+-0.0276791 0.1239 0.019992
+0.0190254 0.061825 0.0484929
+-0.0821717 0.11152 0.00033013
+0.0241621 0.0505303 0.0399762
+0.0378012 0.0604211 0.0334272
+-0.0182252 0.159192 -0.00975232
+0.0423754 0.100105 0.0181719
+-0.0546942 0.0661242 -0.0103565
+-0.0685912 0.131247 0.0482807
+0.000498438 0.0938703 0.0551155
+-0.0281544 0.168213 -0.0175818
+-0.0417796 0.0485307 -0.0113147
+0.0287445 0.109341 -0.0118595
+-0.00260812 0.130913 0.0187596
+-0.0454889 0.0660999 0.0395126
+-0.0655106 0.0972881 0.0421527
+-0.0194848 0.0869694 0.0563134
+-0.0264967 0.121204 -0.00819998
+0.00829502 0.0653838 -0.032076
+-0.0287456 0.0753309 -0.0348961
+-0.0727338 0.0821447 -0.0156124
+-0.0470607 0.146242 0.00718592
+-0.0209665 0.0386858 -0.0114366
+-0.0600079 0.128191 -0.00754937
+-0.0653109 0.180421 -0.0593142
+-0.0559148 0.0548054 0.00768529
+-0.0524976 0.0917711 0.0441581
+0.0212182 0.0847586 -0.026404
+-0.0579878 0.0414274 -0.0083271
+-0.0726954 0.0791971 -0.0139413
+-0.0307256 0.0915724 -0.0247467
+-0.0556334 0.11822 -0.0129265
+-0.0457806 0.0841121 -0.0213757
+0.00438413 0.0465246 -0.0275852
+-0.010477 0.110005 0.0426237
+-0.0896333 0.0929554 0.018431
+0.0397783 0.106996 0.0151622
+-0.0127593 0.0728576 -0.0383837
+0.0319543 0.0766492 -0.0197037
+0.00131984 0.0612266 -0.0334746
+-0.0834451 0.136657 0.0474496
+-0.0558128 0.0869147 -0.0214989
+0.00250708 0.0474439 0.0499052
+0.0125018 0.115423 0.0374065
+-0.00563766 0.13083 0.0104776
+-0.0658527 0.144237 -0.0148815
+-0.089646 0.0929438 0.0164332
+0.0436072 0.041137 0.00426675
+0.0444767 0.0889055 -0.00179899
+-0.057137 0.0562876 0.0015684
+0.00522768 0.0810328 -0.0339223
+-0.0137183 0.0628763 -0.0368336
+0.00133514 0.0554198 -0.0315391
+-0.0188851 0.0334951 -0.0249427
+0.052927 0.0495927 0.0235839
+0.0522184 0.0461787 0.0182078
+0.0165976 0.0348504 0.0271124
+-0.0589342 0.12267 0.0410891
+-0.0669714 0.163891 -0.0179699
+-0.0703202 0.132668 0.0493213
+-0.0776493 0.0787462 -0.00818258
+-0.0881736 0.132451 0.0437642
+-0.0632228 0.141176 -0.0069873
+-0.0713401 0.171022 -0.0310853
+-0.047409 0.166836 0.00227952
+-0.0141433 0.181604 -0.0223083
+-0.0619045 0.104018 -0.0180451
+-0.0483068 0.13712 0.0113971
+0.0136813 0.0952834 0.0497668
+0.035272 0.0660164 0.0386352
+0.0461881 0.0785676 0.017326
+-0.0532105 0.0335853 0.013987
+-0.0171786 0.0971676 0.04907
+-0.0725346 0.145512 -0.0179133
+-0.0333802 0.0498304 -0.01435
+0.0509184 0.0496314 0.0259504
+-0.0572784 0.0576838 0.00160501
+-0.0619689 0.153737 -0.0245819
+-0.0544985 0.104295 0.0412117
+-0.0500704 0.137041 0.0213927
+-0.0191411 0.0697535 0.053261
+0.0582061 0.0634965 0.00313887
+-0.0204853 0.0800483 0.0563065
+-0.0472097 0.0335059 -0.0119372
+-0.0749299 0.155492 -0.0209193
+-0.0698715 0.116492 -0.00825865
+0.0375436 0.055493 0.03143
+-0.0538462 0.137744 -0.0016929
+-0.0607335 0.034496 0.0414254
+0.0295159 0.107768 -0.0121736
+-0.0689178 0.168027 -0.0530164
+-0.0779935 0.171503 -0.0379488
+-0.0881443 0.0887489 0.00447233
+-0.00442605 0.128738 0.0268092
+0.00451348 0.0633892 0.056472
+-0.0818952 0.134036 0.0502533
+-0.0372574 0.124492 0.0238955
+0.0138426 0.11139 -0.0180298
+-0.0818741 0.119187 -0.00382424
+-0.0756587 0.0744591 -0.00795246
+-0.026115 0.158145 -0.00104516
+0.037495 0.0513025 0.031739
+0.0589255 0.0580383 0.0211692
+0.0434376 0.0874432 0.0261531
+-0.0260776 0.125932 0.00880255
+-0.0740662 0.155757 0.0246008
+-0.0178239 0.0387614 0.0327968
+0.0417114 0.091515 -0.00780409
+-0.0241449 0.0905492 0.0505682
+-0.074497 0.124608 0.0532356
+-0.0458334 0.0927472 -0.0217986
+-0.0804383 0.111326 0.0449881
+-0.00529252 0.125273 -0.00885488
+-0.0889223 0.0888194 0.00846703
+-0.00624295 0.130196 0.00449841
+-0.0669483 0.0447271 0.0026821
+-0.0548497 0.0941617 -0.0218342
+-0.0534962 0.0931826 0.0441514
+-0.0347147 0.0696617 -0.0176192
+-0.0440132 0.0366004 -0.0242792
+-0.0474979 0.0464882 0.040801
+-0.0653409 0.0600919 0.00943789
+-0.0231718 0.171204 -0.0201308
+-0.00587295 0.130011 0.00319127
+-0.0664676 0.0383698 -0.00648508
+-0.0886456 0.0935942 0.0229142
+-0.0447618 0.116708 -0.0154556
+0.0194756 0.100345 0.0462123
+-0.0154951 0.0911415 0.0560918
+-0.0371641 0.0342638 0.0291868
+0.0162971 0.0651874 -0.0294171
+-0.0291548 0.169699 -0.0175574
+-0.0704877 0.0623972 0.0153213
+-0.0774944 0.092744 0.0372295
+-0.00984328 0.0975178 -0.0293224
+-0.0784995 0.162482 -0.0259435
+-0.0145068 0.0730096 0.0554058
+0.0203473 0.0727595 0.0505294
+-0.0616196 0.156864 -0.0215888
+-0.0832232 0.0789707 0.00151853
+0.0163786 0.0403059 -0.0216745
+0.000325641 0.0568761 -0.0321896
+-0.0192766 0.0554309 0.0481999
+-0.00592104 0.0389465 -0.0049376
+-0.0499986 0.143197 0.012378
+-0.0355049 0.076131 0.0419036
+0.053394 0.0525543 0.0260735
+0.00630024 0.125509 0.0321214
+-0.0349082 0.033686 0.00682403
+-0.0714928 0.117552 0.0529474
+-0.0589919 0.15382 0.0299308
+0.0585035 0.0621132 0.0229868
+0.00569406 0.0341002 0.00181761
+-0.0155184 0.118264 0.0365807
+-0.0424989 0.16674 0.00381643
+-0.0863225 0.128011 -0.00168174
+-0.0553953 0.118382 0.0373919
+0.0469197 0.0444607 0.00136465
+-0.056091 0.0334157 -0.00629765
+-0.0361548 0.166687 -0.0142688
+-0.0127937 0.0386426 -0.0153707
+-0.0118501 0.11995 -0.013068
+-0.00670797 0.0627873 -0.0354975
+-0.079327 0.169353 -0.0390258
+-0.0437872 0.0855322 -0.0215732
+-0.0280896 0.0549613 -0.0243859
+-0.0584052 0.033525 -0.00869675
+-0.0482395 0.144672 0.00644062
+-0.0554929 0.0932384 0.0449182
+-0.0347045 0.0851136 -0.0245778
+-0.0494996 0.0791204 0.0440794
+0.0372047 0.0385834 0.00228863
+0.0193241 0.0607694 -0.0271316
+0.00852018 0.0702413 0.0555324
+-0.0778099 0.148638 -0.00388521
+-0.06539 0.178765 -0.0548301
+-0.04996 0.133052 -0.000571002
+-0.0847199 0.0939171 -0.00356265
+-0.0326229 0.0385148 -0.00990233
+0.032773 0.036599 0.0179277
+0.0427869 0.0611675 -0.0033403
+-0.0366336 0.0548529 -0.010755
+-0.0870489 0.0900041 0.00248653
+0.0416085 0.0656213 0.0284032
+0.00293844 0.100629 -0.0225769
+-0.0728162 0.0907583 -0.0154663
+-0.0718707 0.116473 -0.00776413
+-0.0937263 0.121427 0.0132848
+0.00471758 0.0346554 0.0428856
+-0.0704897 0.0719829 -0.0097429
+-0.050201 0.0344166 0.0315946
+-0.0796522 0.0704439 0.0152371
+-0.0425023 0.0986936 0.0421906
+0.0383887 0.0445417 -0.00444706
+0.0311086 0.103751 -0.0138751
+-0.0667119 0.155932 -0.00484005
+-0.0912006 0.121567 0.0443209
+-0.019019 0.0418114 0.0529435
+-0.0892823 0.141954 0.0132429
+-0.0221125 0.0389367 0.0353489
+-0.0563218 0.0335364 0.00802021
+-0.0896372 0.0929496 0.0174335
+0.0130767 0.125591 0.0302496
+0.0537776 0.0692651 0.00258827
+0.0106605 0.0363802 0.031763
+-0.0297187 0.0523119 -0.0193651
+-0.0140732 0.0383739 0.00681638
+0.0269054 0.0726895 0.0441444
+0.0246103 0.075474 0.0479027
+-0.00359864 0.0405713 -0.0254999
+0.0269298 0.0804165 -0.0233375
+-0.0488158 0.0912881 -0.0217052
+-0.00415439 0.0390536 -0.00654274
+0.000507304 0.0828912 0.0574668
+-0.0158173 0.038248 0.0138275
+-0.0624172 0.0599054 0.00479638
+0.0162074 0.0821136 -0.0291532
+-0.0419982 0.0337727 -0.000124238
+0.0250957 0.0348061 0.00319961
+-0.0309108 0.0608665 -0.0194213
+-0.0387236 0.174145 -0.00898261
+0.0464355 0.0778581 0.0101835
+-0.0639936 0.132595 -0.00811291
+-0.0340062 0.0381682 0.049242
+-0.0477004 0.131837 0.0244001
+-0.00268932 0.130846 0.00581897
+0.0302059 0.0857499 -0.020278
+0.0384903 0.0499056 0.0320993
+0.010384 0.0463357 -0.0254801
+-0.00660048 0.0405957 -0.0258634
+-0.0114989 0.0366056 -0.0169842
+0.0105059 0.0348976 0.020389
+-0.0487973 0.070279 0.0395574
+-0.0394971 0.057712 0.040203
+-0.0253679 0.125634 0.0163937
+0.0361389 0.0902387 0.0383091
+-0.0654905 0.0889779 0.0446185
+-0.0197462 0.0656505 -0.036857
+0.0320676 0.117774 0.0158308
+0.00351414 0.0661565 0.0562774
+-0.0226137 0.0422636 -0.0288734
+-0.019191 0.123923 -0.00519119
+-0.0532423 0.046246 0.0226735
+-0.021638 0.0464604 -0.0276852
+0.0272834 0.0689403 -0.022937
+0.0211914 0.124678 0.000362022
+0.04653 0.0760573 0.0105389
+-0.0338201 0.127158 0.00888963
+-0.077651 0.154407 0.00585132
+-0.0417202 0.0710768 -0.017536
+-0.0887218 0.0874968 0.0134639
+0.0165095 0.0354073 -0.0166384
+-0.0454406 0.0336534 -0.00804117
+-0.0504088 0.153575 0.0112235
+-0.0286428 0.107004 -0.0213195
+-0.0218765 0.0933131 0.0510401
+0.0329715 0.116865 0.0119087
+-0.0914625 0.148845 0.019136
+-0.0596259 0.155781 0.0151651
+0.0375784 0.099381 0.0316743
+-0.0157845 0.0784788 -0.0385671
+-0.0795217 0.123111 0.0512585
+-0.0418108 0.0343847 0.029868
+0.0389991 0.108356 0.0151637
+-0.0709225 0.109376 -0.0106672
+0.0579353 0.0634887 0.0239229
+-0.058577 0.0727277 0.0406017
+-0.062479 0.152546 0.000181648
+-0.0544934 0.0834141 0.0452404
+0.0357112 0.102065 0.0324889
+-0.0715263 0.0944187 0.0416527
+-0.0651404 0.112408 0.0390225
+-0.0545541 0.160714 0.00540511
+-0.0144079 0.183333 -0.0275579
+-0.0621531 0.152198 -0.0185797
+-0.0657166 0.14722 -0.0249021
+-0.0460756 0.154674 -0.00723534
+0.01519 0.127729 0.000331934
+-0.0489579 0.137072 0.00640402
+-0.0485683 0.0335187 -0.00854361
+-0.0885037 0.114225 0.0283481
+-0.0540375 0.141288 -0.0013423
+-0.0472373 0.134368 0.0171539
+-0.0272298 0.037736 0.022792
+-0.0518585 0.0985114 -0.0220738
+-0.0110867 0.180248 -0.025982
+-0.0236236 0.0593674 0.0425181
+-0.0408247 0.092859 -0.0231395
+0.0561988 0.0567015 0.0248562
+-0.0086058 0.172644 -0.0268228
+0.0163504 0.0552051 -0.0284322
+-0.0344945 0.0336038 -0.0243554
+-0.0556539 0.0345276 0.0424927
+-0.0348371 0.155104 0.00211833
+0.0276605 0.0605608 0.0434107
+-0.0623508 0.146001 -0.00658982
+-0.0248115 0.081196 -0.037776
+0.0240847 0.110594 -0.013209
+-0.0895075 0.148492 0.0263454
+-0.0926235 0.124077 0.00926903
+0.0292051 0.0843756 -0.0209031
+-0.0353048 0.127501 0.00687019
+-0.0859011 0.134922 0.00126737
+-0.0742444 0.0756609 0.0347079
+-0.0752605 0.157705 -0.0064221
+-0.0337955 0.0808164 -0.0255276
+-0.0288635 0.154571 -0.00355817
+0.0360371 0.0547702 0.0325687
+-0.0101249 0.0392126 0.0357767
+0.0288986 0.120838 0.016073
+-0.0106831 0.0570151 -0.0340192
+-0.0628045 0.144114 -0.00718004
+-0.0895701 0.151478 0.0161361
+-0.0176156 0.0385615 0.0294218
+-0.0211148 0.0389017 0.0355855
+0.0329392 0.0541774 -0.0107445
+-0.00428899 0.0367463 -0.0156853
+-0.0458368 0.0956376 -0.0219211
+0.0381262 0.080772 0.035847
+0.0268148 0.0976356 -0.019356
+-0.0625367 0.161521 -0.0446005
+-0.0517979 0.0869425 -0.0216307
+0.0344672 0.111064 -0.00366583
+-0.0911264 0.115738 0.024682
+-0.0753098 0.0805155 0.0368289
+-0.0133248 0.129244 0.00909724
+-0.0272428 0.0370384 -0.018628
+-0.0384762 0.0423266 0.0418914
+0.0203738 0.0521374 -0.0257342
+0.0585485 0.0552063 0.00817117
+0.0134367 0.121611 -0.0110511
+-0.089438 0.113514 0.0412091
+0.0444691 0.0790854 -0.00178456
+-0.000786355 0.0797462 -0.0360298
+-0.0269011 0.155694 -0.0071882
+-0.08839 0.0995952 0.00742201
+-0.0662162 0.0396687 0.0135434
+-0.0355277 0.0846755 0.0433772
+-0.0858238 0.104979 0.0223569
+-0.0778773 0.120773 -0.00663343
+-0.0263675 0.107348 -0.0216948
+-0.0927086 0.12286 0.0332776
+-0.0661966 0.15171 0.0363078
+-0.0202018 0.177138 -0.0227808
+-0.0855834 0.141979 0.0409477
+-0.0504886 0.0946205 0.0445363
+-0.0604928 0.101522 0.0423039
+0.0379519 0.0659398 0.0354557
+-0.0840048 0.140674 0.0436515
+-0.0558989 0.109796 -0.0177742
+0.00991096 0.0343624 0.00242681
+-0.0506409 0.0514954 0.0146147
+-0.0324809 0.117911 -0.0127388
+-0.0621631 0.164652 -0.0535815
+0.0025214 0.130289 0.0235241
+-0.0506513 0.150706 0.0125676
+-0.0175006 0.0829087 0.0576844
+-0.00809599 0.0347439 0.04196
+-0.0340295 0.0384544 -0.00643688
+-0.0694928 0.101384 0.0400561
+0.0446992 0.0776181 0.0241159
+-0.0935142 0.126862 0.0142561
+0.0248702 0.121138 0.0274186
+0.00114443 0.118463 -0.015597
+-0.053795 0.115431 0.0343764
+-0.0905823 0.131055 0.0352302
+-0.00177837 0.0811944 -0.0365591
+0.0316669 0.110076 0.0318865
+0.0355137 0.0902592 0.0391607
+-0.0911524 0.122908 0.0442317
+-0.0909787 0.118866 0.0441649
+-0.0647368 0.0350417 0.0261211
+-0.0694997 0.166373 -0.0203616
+-0.0256221 0.0450194 -0.0280788
+-0.0652445 0.171051 -0.0600934
+-0.0773393 0.152802 -0.0018868
+-0.00223434 0.118045 -0.0151238
+-0.0662482 0.063188 0.0243484
+0.0400602 0.0922366 -0.00959201
+-0.00562712 0.0451708 -0.0285409
+0.000501495 0.0457296 0.0472541
+-0.0123701 0.125297 0.0298351
+-0.0778681 0.101964 -0.00928868
+-0.0609537 0.123826 -0.00859412
+0.0224677 0.112582 -0.013341
+0.00921575 0.0781468 -0.0329463
+-0.0349236 0.126603 0.0011375
+-0.00878487 0.0784493 -0.0377777
+0.00650569 0.075888 0.056486
+0.0412418 0.0802411 -0.00774788
+-0.093262 0.128309 0.02526
+-0.0314363 0.171254 -0.00518552
+-0.0520579 0.0336325 0.0248414
+-0.0815026 0.127419 0.0524098
+-0.0894637 0.136534 0.031204
+-0.084288 0.111698 0.0438155
+0.0333653 0.0918289 -0.0171871
+-0.0324333 0.126109 0.00355422
+-0.00141447 0.0391026 0.0304627
+0.00110904 0.0340429 -0.0196452
+-0.0650297 0.138462 -0.00769967
+-0.015954 0.105864 -0.0221228
+-0.0523859 0.0626167 0.0314055
+0.026783 0.122575 0.00815739
+-0.0385209 0.128019 0.0130694
+-0.029395 0.125597 0.00758806
+-0.0328882 0.0666632 -0.0184721
+-0.0494036 0.13704 0.0193807
+-0.0782331 0.109897 -0.00456592
+0.0157741 0.036715 -0.0196413
+-0.0294956 0.0660091 0.0384906
+-0.0679029 0.105215 -0.0140793
+-0.0620463 0.158428 -0.0205873
+-0.0703503 0.159267 -0.00619145
+-0.0378682 0.104226 -0.0203027
+-0.0918252 0.118761 0.028299
+-0.0411447 0.163664 -0.0114686
+-0.0574975 0.0426993 0.0453715
+-0.0747471 0.147201 -0.0128585
+-0.0134963 0.0744967 0.0564394
+-0.054142 0.0722337 0.0402304
+-0.0642908 0.169609 -0.0607929
+-0.0154978 0.0977476 0.0489325
+-0.0800099 0.07203 0.0185532
+-0.0921132 0.115989 0.0103178
+0.00725505 0.0754138 -0.0341479
+0.0536301 0.0568087 0.0282148
+-0.0479854 0.0346149 0.0371396
+-0.00149257 0.0746611 0.0586297
+0.0203189 0.05934 -0.026848
+-0.0115998 0.0391898 -0.02633
+-0.0295596 0.0663471 -0.0284716
+0.00348965 0.105764 0.0424132
+-0.0703543 0.0703917 0.033048
+-0.0606347 0.0629111 -0.00512698
+-0.01408 0.166026 -0.0199736
+-0.061044 0.0400333 0.0227114
+-0.0810735 0.143155 -0.000828212
+-0.0617474 0.0766736 -0.0179709
+0.0217467 0.124535 0.0248197
+0.00507814 0.101571 -0.0215886
+0.0346034 0.0592134 0.0376264
+-0.0712039 0.0342165 0.00436442
+-0.0288195 0.0384506 0.0326078
+-0.053518 0.1534 0.0145047
+-0.0556759 0.0661408 -0.010195
+-0.0677895 0.175109 -0.0580246
+-0.0699291 0.0421822 0.0072491
+-0.0067422 0.0741543 -0.0369448
+0.0199779 0.0885978 -0.0258535
+-0.0488263 0.0941792 -0.0218889
+0.0343607 0.0505331 -0.00657713
+-0.0725404 0.162229 -0.0113532
+-0.00793663 0.0384098 0.0134736
+-0.0556415 0.043673 0.0216881
+-0.0145298 0.100345 0.0444168
+-0.0815281 0.1484 0.0374104
+-0.0387388 0.0753845 -0.0180569
+-0.0116442 0.0481633 -0.0303354
+0.0363562 0.0559126 -0.00774494
+-0.0652193 0.1682 -0.0598394
+-0.0776736 0.10169 -0.00957801
+-0.0196644 0.0494984 -0.0297043
+-0.0282432 0.0763981 0.0437868
+-0.0328471 0.033696 0.0126517
+0.00347146 0.128699 -0.00262952
+0.0461484 0.0806375 0.015174
+0.0337656 0.111689 0.027893
+-0.0271752 0.172675 -0.0185845
+-0.0693701 0.141497 -0.00893397
+0.0317719 0.115994 -0.000976469
+0.0347163 0.0544411 -0.00865089
+-0.0651886 0.172101 -0.0460875
+-0.0678768 0.1616 -0.0125361
+-0.0634522 0.0423282 0.0135276
+0.0601313 0.0581272 0.0101639
+-0.0107388 0.117999 -0.0150205
+0.0339646 0.0916099 0.0404552
+-0.0498374 0.138571 0.0183794
+-0.0934962 0.117401 0.0173034
+0.0383972 0.0491164 -0.00642484
+-0.0280195 0.0378733 -0.0295429
+-0.0146147 0.12166 -0.00880985
+0.0372641 0.0686531 0.0362559
+0.0239959 0.0549509 0.0433236
+0.00994394 0.0362916 0.0335003
+-0.0208017 0.0799082 -0.0390716
+0.0233991 0.0534151 -0.0239637
+0.00722024 0.0851796 -0.0327872
+-0.0639758 0.128226 -0.00858393
+0.0238189 0.124864 0.00990899
+0.00150975 0.0474485 0.049901
+-0.0361905 0.168183 -0.0140562
+-0.0174884 0.0801344 0.0573382
+-0.0918829 0.116106 0.0333156
+0.00614351 0.12581 -0.00755937
+0.0340287 0.115127 0.0194375
+-0.0908622 0.135106 0.0192089
+-0.000650637 0.0496936 -0.0307015
+-0.0856199 0.144636 0.00717286
+0.0438423 0.0804362 -0.00278861
+-0.00949487 0.0503088 0.0507661
+0.0271211 0.103444 0.039376
+-0.0386188 0.04066 -0.0277325
+-0.0654456 0.154232 -0.00436037
+-0.0264896 0.100224 0.0439794
+-0.0715324 0.144165 0.0446205
+-0.0694829 0.118967 0.0529378
+0.0378869 0.110163 0.00793964
+0.0353212 0.108669 0.0283742
+0.0601522 0.0581329 0.0151721
+-0.0542607 0.057796 0.0208407
+0.00222051 0.130562 0.00190808
+-0.0641033 0.156361 -0.011127
+0.0432299 0.0944972 0.0241641
+-0.0229686 0.033489 -0.025736
+-0.0221215 0.127119 0.0131583
+-0.0671797 0.0604061 0.0141816
+-0.0288776 0.0903901 -0.0295833
+0.0603694 0.0609168 0.00815448
+-0.0494359 0.138587 0.00541192
+-0.0023893 0.0424447 0.047211
+-0.0543474 0.135324 0.0319505
+0.0228597 0.125444 0.016672
+-0.0334812 0.0737514 -0.024477
+0.0348071 0.0781711 0.0398247
+0.0054972 0.0547598 0.0532635
+0.00645879 0.122419 -0.0119062
+-0.0438011 0.128754 0.0022734
+-0.0849152 0.0791131 0.00550947
+-0.0506838 0.0678366 -0.0132392
+0.0126337 0.110109 -0.0186257
+-0.0497701 0.140145 0.0153991
+-0.0724387 0.0819305 0.0395669
+0.0576036 0.0717386 0.0163116
+0.00802743 0.0346823 0.0237027
+0.00218868 0.098191 -0.0260404
+-0.0368205 0.162344 -0.00074381
+-0.070799 0.0908224 -0.0163205
+-0.0539828 0.0700164 0.038652
+0.0135945 0.128354 0.000408423
+-0.0264981 0.0959784 0.0437675
+0.0190214 0.118116 -0.0113006
+-0.0618485 0.153752 -0.0205795
+-0.0552085 0.151192 0.0284379
+-0.0266144 0.0408668 -0.0293519
+0.00698354 0.131641 0.013682
+-0.0316463 0.0595496 -0.0164023
+-0.0758985 0.159659 -0.0269354
+-0.0491601 0.160603 -0.00598464
+-0.00858383 0.0384847 0.0096485
+-0.0717673 0.146065 -0.0213605
+-0.0899696 0.15095 0.0147905
+-0.00955085 0.0385956 0.00389466
+-0.0607249 0.0737695 -0.0169262
+-0.0751542 0.0995011 0.0375123
+-0.0707959 0.0850638 -0.0167146
+-0.0312047 0.123257 -0.00431908
+-0.053995 0.0675039 0.0372692
+-0.0419532 0.0345214 0.0385087
+-0.0289695 0.0380956 -0.0297496
+-0.0121936 0.163667 -0.0136225
+0.021294 0.0721108 -0.027322
+0.0597965 0.0678036 0.00914167
+-0.0657015 0.0736405 -0.0152375
+0.00697022 0.12731 -0.00520393
+0.033357 0.100796 0.0361067
+0.0587791 0.0686289 0.0199155
+0.00149398 0.0394449 0.0343588
+-0.0875531 0.12123 -0.000692815
+-0.0744527 0.154114 -0.0209063
+-0.0172261 0.0356447 0.0515267
+-0.0200013 0.0389743 0.053287
+-0.0569508 0.0343746 0.0319473
+-0.0184875 0.0829081 0.0576141
+-0.019368 0.183116 -0.0157888
+-0.0626506 0.153382 -0.0318715
+-0.00943219 0.095325 -0.0330289
+0.0431395 0.100108 0.0121576
+-0.0608162 0.0881975 -0.019441
+0.0357777 0.070014 0.0376374
+0.0505254 0.0735568 0.0151501
+0.0307633 0.0476275 0.0336614
+0.0294554 0.0416168 0.02991
+-0.0611913 0.173613 -0.0615062
+-0.0146115 0.109635 -0.0201085
+0.0379445 0.0686366 0.0354907
+-0.076675 0.154077 0.000107436
+-0.0315189 0.0351239 -0.0306591
+-0.0768434 0.109781 0.0434593
+-0.0522791 0.0490314 0.0356585
+-0.0380005 0.12652 0.0191796
+-0.0861323 0.103534 0.00440203
+-0.0659084 0.106679 -0.0142087
+0.000468869 0.0388702 -0.00172096
+-0.0623487 0.141045 -0.00649873
+-0.0484952 0.0862244 0.0454118
+-0.0685451 0.170527 -0.0328985
+-0.037499 0.101465 0.0412127
+0.0274201 0.0431121 -0.00573463
+-0.0197554 0.158352 -0.00754965
+-0.0567366 0.0753362 -0.0185878
+0.0533817 0.063336 -0.00140725
+0.0135006 0.105771 0.0435499
+-0.0631905 0.166285 -0.0395881
+-0.0932173 0.122834 0.0272862
+-0.0284888 0.0396421 0.053637
+-0.0134794 0.0559661 0.0512091
+-0.04424 0.130203 0.0124253
+0.0196407 0.0940896 -0.0236062
+-0.0625219 0.151129 0.0359075
+-0.0585008 0.0732388 0.0410714
+0.0608111 0.0651191 0.0151635
+-0.0275116 0.0560234 0.0370088
+-0.0127931 0.0799092 -0.038653
+-0.0544725 0.0478754 0.0402183
+-0.0905041 0.147099 0.0259896
+0.0291224 0.0877617 -0.0209279
+0.0381679 0.0993665 0.0307411
+0.00549435 0.0474709 0.0500045
+-0.0842531 0.102059 -0.0016008
+0.0164869 0.128389 0.00575868
+-0.043156 0.162156 -0.0100947
+0.0445553 0.0846952 0.000180444
+0.0409145 0.07739 -0.0077683
+0.0297353 0.111221 -0.00987421
+-0.0220481 0.0379707 0.0182323
+-0.0636401 0.0337302 0.00992182
+-0.0277909 0.0796672 -0.0363416
+-0.0247513 0.0944605 0.0453863
+-0.0291577 0.0733109 -0.0335988
+-0.0264744 0.0486202 0.0485825
+-0.0654948 0.104238 0.0403184
+-0.054309 0.153692 0.0171048
+0.000886988 0.0365316 0.0205866
+0.025787 0.114054 0.0339562
+-0.0624998 0.091833 0.0450322
+-0.0825753 0.107428 -0.000626511
+-0.0879726 0.100935 0.0073995
+-0.0849555 0.110375 0.0243559
+-0.00450509 0.0815118 0.0573962
+0.0411647 0.0886413 -0.00977915
+0.00923376 0.0823418 -0.0323881
+0.0250818 0.0983923 -0.0201688
+-0.0460388 0.0353834 -0.0203139
+-0.0563344 0.154371 0.0236088
+-0.0786725 0.15564 0.0171569
+-0.0174933 0.120917 0.0332266
+-0.0405771 0.0447491 -0.0223069
+-0.0706839 0.0363372 -0.00115986
+-0.0827485 0.134001 0.0496722
+-0.0566419 0.0336495 -0.0102846
+-0.0932956 0.12823 0.014251
+-0.0183957 0.116542 -0.0154107
+0.03698 0.0590759 0.0339965
+-0.0709427 0.132583 -0.00826816
+-0.0697213 0.0778913 -0.0154943
+-0.0222445 0.159024 -0.0114139
+-0.0571999 0.0684533 0.0375014
+-0.04663 0.0533425 -0.0102323
+0.00628325 0.0668147 -0.0324472
+-0.0477443 0.0767654 -0.0182192
+0.000336625 0.0525175 -0.0304496
+-0.0562455 0.0345922 0.0440034
+-0.00249349 0.0474079 0.0491587
+-0.00849662 0.115566 0.0401952
+-0.0346349 0.176996 -0.009991
+-0.0315471 0.0665587 -0.0224416
+-0.0114919 0.121016 0.0357517
+-0.00348929 0.0884115 0.0568027
+-0.0275554 0.0689002 0.0398598
+0.0463861 0.080656 0.0111753
+-0.0335046 0.109774 0.0374515
+-0.0104184 0.179993 -0.0295246
+0.0299649 0.0370453 0.0224182
+-0.0229027 0.109901 -0.0203838
+0.0326144 0.117295 0.0103313
+0.0369028 0.0954111 -0.0108822
+-0.0564742 0.041367 0.0464242
+-0.0770729 0.168746 -0.0303374
+-0.0310065 0.124592 0.0202545
+-0.06762 0.17339 -0.0440641
+-0.0124743 0.0632507 0.0548154
+-0.06879 0.067714 0.0304363
+-0.0188136 0.124392 0.0261122
+-0.0775236 0.155819 0.0175602
+-0.0744868 0.14835 0.0408614
+-0.0798509 0.120721 -0.00541034
+-0.0474977 0.0747299 0.0422594
+-0.0819076 0.08016 -0.00254028
+-0.0104535 0.0366522 -0.0168147
+0.0107598 0.0346122 0.0387698
+-0.0618853 0.158437 -0.0215849
+-0.0248668 0.103031 -0.023615
+0.0521945 0.0697716 0.0245573
+0.0156704 0.0936059 -0.0251021
+0.0371318 0.111041 0.00479819
+-0.0835634 0.0897492 -0.00557879
+0.00648846 0.118239 0.0378444
+-0.0454996 0.0464888 0.0408011
+0.00251072 0.0388788 0.0260522
+-0.0757603 0.10082 0.036651
+-0.072674 0.131225 0.051196
+-0.0107806 0.0770662 -0.0381287
+-0.0336363 0.153436 -0.00674709
+-0.0843022 0.0938821 0.0298739
+-0.00957953 0.177197 -0.0268263
+-0.06621 0.148552 -0.030869
+-0.0367939 0.127143 0.000444502
+0.0450752 0.0819431 0.00117926
+0.00252922 0.0387278 -0.0124032
+0.0124259 0.130345 0.00996559
+-0.039483 0.112566 0.0355031
+-0.0896451 0.11724 0.00430849
+-0.0307561 0.0876495 -0.0285591
+-0.0336555 0.0363317 0.0490618
+0.00481949 0.0349074 0.0372909
+0.0324749 0.095557 0.0400886
+-0.0601974 0.126918 0.041055
+0.0561271 0.0494063 0.0121912
+-0.0663732 0.0796127 0.0418746
+-0.0634873 0.105626 0.040045
+-0.0348887 0.174114 -0.0129217
+-0.0331172 0.123673 -0.00477506
+-0.0158191 0.0855498 -0.0389623
+-0.0630684 0.138136 0.036884
+0.00839558 0.0418967 -0.0238735
+-0.000234213 0.0957245 -0.0313684
+-0.00270805 0.0387067 0.00335713
+-0.0066107 0.0434378 -0.0261152
+0.0267348 0.0889072 0.0458132
+-0.057498 0.0762057 0.0428357
+-0.0559977 0.128155 -0.00607843
+-0.0652856 0.176792 -0.0608019
+-0.0847322 0.10481 0.00139005
+0.0045205 0.0842507 0.0571459
+-0.0540417 0.148675 -0.00217424
+0.00157845 0.0388465 -0.0127005
+-0.0649294 0.123847 -0.00887936
+0.0268943 0.0906576 -0.0219805
+-0.0692389 0.149629 -0.0402111
+0.0424058 0.101483 0.00416631
+-0.069135 0.0354547 0.0122501
+-0.0311414 0.168206 -0.0166543
+0.0247254 0.0405634 0.0363023
+-0.035656 0.0591967 -0.0115208
+-0.0492298 0.13342 0.00108021
+0.0186953 0.0943115 -0.0238444
+-0.0632815 0.159908 -0.0475928
+-0.0744952 0.144184 0.0450216
+-0.0273351 0.0750142 0.0443436
+0.0129485 0.0726239 0.0538836
+-0.0256504 0.178665 -0.00908499
+-0.0152817 0.126335 -0.00175389
+0.0171854 0.035921 0.00432788
+0.00536983 0.0385261 0.026955
+-0.069701 0.0749104 -0.0135814
+-0.0936513 0.125496 0.0142597
+-0.0218218 0.0854612 -0.0381675
+-0.0670338 0.0819342 0.0426575
+-0.0637771 0.0824308 -0.0191299
+-0.0579197 0.0410941 0.0197057
+0.004329 0.114453 -0.0192954
+-0.0743852 0.111313 0.0463698
+0.0153242 0.0566704 -0.0288596
+0.0201589 0.0349933 -0.00358051
+-0.0674387 0.0336478 0.00564073
+0.0380425 0.109755 0.0161689
+0.0214264 0.0348625 -0.00133145
+0.0129483 0.0405423 0.0447572
+-0.00171529 0.0627358 -0.0345403
+-0.0206569 0.0494682 -0.0293042
+0.0369479 0.0784891 -0.0137448
+-0.0877279 0.139146 0.00920485
+-0.0228745 0.0383806 -0.00412065
+0.0407791 0.105635 0.00716484
+-0.0164884 0.161116 -0.0081783
+0.0261701 0.115347 0.0327443
+-0.0171143 0.0393698 0.0395766
+0.0364251 0.0840505 -0.0167267
+-0.0413094 0.0336719 -0.0183114
+-0.00449481 0.0619627 0.0557718
+0.0354002 0.054813 0.0334165
+0.0257124 0.0795754 0.0477924
+-0.0900689 0.132434 0.0392074
+0.0111597 0.124256 -0.00791398
+0.023574 0.105697 0.0395934
+0.0172046 0.061784 0.0493931
+-0.0738846 0.110669 -0.00843945
+0.00601824 0.128477 0.0276707
+-0.0581623 0.155642 0.0142378
+-0.046474 0.0903329 0.04369
+-0.0204963 0.0988407 0.0444811
+0.0448392 0.0847511 0.0231667
+-0.0246346 0.0464142 -0.0272665
+-0.0164056 0.0347921 0.0489909
+-0.048358 0.146267 0.00883601
+-0.0626778 0.0407451 0.0424121
+-0.06586 0.154377 -0.00304604
+0.0375072 0.103901 -0.00584413
+-0.00221994 0.0380783 -0.0146251
+0.00247871 0.110023 0.0425049
+0.0588331 0.0552392 0.0181818
+-0.0156079 0.0352742 -0.0184368
+-0.0112854 0.0344473 -0.0186905
+-0.0170355 0.0338392 -0.0211402
+-0.0137571 0.128142 0.00234571
+0.0353694 0.082169 0.0388786
+-0.065182 0.160968 -0.0576695
+-0.0324895 0.0874934 0.0434306
+-0.0637445 0.0781022 -0.0180675
+-0.0882379 0.0914593 0.00646904
+0.0256941 0.120543 -0.00190068
+-0.0750751 0.149943 -0.025867
+-0.0477253 0.135673 0.0140062
+-0.0678845 0.116524 -0.00880656
+-0.0627671 0.15529 -0.013592
+-0.0588282 0.0408079 0.0456406
+-0.056691 0.0506774 -0.00137882
+-0.0828622 0.0910525 -0.0066104
+-0.0499126 0.0515141 0.0166499
+-0.0490107 0.146266 0.00962371
+0.0122318 0.130219 0.0070475
+-0.0116803 0.0570084 -0.0342026
+-0.0651676 0.167884 -0.0330971
+-0.0730453 0.0699885 -0.00346826
+0.0174821 0.0990004 0.0469682
+-0.0908453 0.133761 0.025216
+-0.0657306 0.150277 -0.0347821
+-0.0671422 0.159475 -0.0561779
+-0.00377564 0.078412 -0.0370359
+-0.0617811 0.042326 0.0146867
+-0.0252077 0.0348536 0.0435448
+-0.028493 0.0602587 0.0370952
+-0.08903 0.119932 0.00232561
+-0.0345174 0.105629 0.0392495
+-0.0234134 0.181486 -0.0190275
+-0.0664685 0.0611724 0.00451786
+0.0367619 0.0414833 0.0270934
+-0.0275613 0.121213 -0.00819283
+0.0347392 0.0848817 0.0397697
+-0.0655835 0.0626949 -0.00273961
+-0.0187525 0.0671388 -0.037784
+-0.0904123 0.13106 0.0392156
+0.0183728 0.0521803 -0.0265242
+-0.0394837 0.113931 0.0345962
+-0.050497 0.0848226 0.0453947
+-0.026736 0.125755 0.00710307
+-0.0284884 0.0890334 0.0453918
+-0.0441667 0.0657175 0.0402548
+0.0109368 0.035027 0.0276086
+-0.0219243 0.0335307 -0.0255712
+-0.0865855 0.100865 0.00437928
+-0.0114057 0.038823 -0.00778731
+-0.0606205 0.136712 0.0351771
+-0.0938957 0.124187 0.0252761
+-0.0877217 0.151511 0.024071
+0.0027861 0.0392982 -0.00725238
+-0.0435747 0.127942 -0.00117905
+0.00626863 0.114136 -0.0189815
+-0.0182416 0.0386382 0.0310248
+-0.065785 0.145733 -0.0198954
+-0.0867571 0.0833567 0.0144816
+0.0263294 0.0517767 -0.02097
+0.0205436 0.0357642 -0.00368285
+-0.0174561 0.0544373 0.0497557
+0.0051136 0.11017 -0.0202785
+0.0320036 0.0972394 -0.014969
+0.018368 0.0537078 -0.0275601
+0.00449367 0.115547 0.0400425
+0.030957 0.0564285 0.0393343
+-0.0480871 0.166778 0.00155196
+-0.0374511 0.122567 -0.00961353
+-0.067466 0.154933 0.00219081
+-0.0645473 0.0334176 0.0010517
+-0.0507826 0.0530079 0.0196214
+-0.0269873 0.0549465 0.0375414
+-0.0318114 0.0361324 -0.0187
+0.0211923 0.12581 0.0217553
+-0.0485738 0.111377 -0.0178292
+-0.0790938 0.10996 -0.003593
+0.0410408 0.0408917 0.00130956
+-0.0171973 0.174198 -0.0240623
+-0.0136738 0.0526181 -0.0325173
+-0.0194987 0.0828823 0.05729
+-0.00149547 0.119691 0.0381347
+0.0125362 0.127772 -0.00169738
+0.00352032 0.0772514 0.0561756
+-0.0037108 0.0392109 0.0335024
+-0.0682887 0.164315 -0.0170259
+-0.0861823 0.107654 0.00936346
+0.0116633 0.0616767 0.0519085
+-0.0828359 0.104706 -0.00261356
+-0.0473623 0.129578 0.0262098
+0.0143608 0.0508459 -0.0270896
+-0.0265586 0.171236 -0.0104749
+0.0203688 0.0459169 -0.020834
+-0.0404996 0.0591463 0.0404229
+-0.0164937 0.0758406 0.0558352
+-0.00649647 0.0898144 0.056995
+-0.070489 0.118975 0.0531649
+-0.0665486 0.169315 -0.0336077
+-0.0869443 0.101766 0.0237835
+0.0413201 0.104267 0.012164
+-0.0705201 0.0646959 0.0221381
+-0.0345088 0.104256 0.0402356
+0.0590657 0.0691634 0.0182335
+0.0274527 0.103904 -0.0160338
+-0.0321732 0.0461161 0.0457813
+-0.0446011 0.0519723 -0.0106716
+-0.0932418 0.125562 0.0272746
+-0.0458642 0.128671 0.00011454
+-0.0885465 0.0902329 0.022415
+-0.0693724 0.136902 0.0471868
+0.0383558 0.102292 -0.0062663
+-0.0638617 0.125566 0.0463833
+-0.017504 0.0870094 0.0567302
+-0.0370734 0.0393951 0.0451959
+0.00329134 0.119473 -0.0147093
+-0.0543235 0.0334648 0.00849253
+0.0274945 0.0381011 -0.00197122
+-0.0703836 0.151592 -0.0450749
+0.0441667 0.0973563 0.00616912
+0.0240844 0.0547426 -0.0237664
+-0.015779 0.0770791 -0.0385675
+-0.0731035 0.0667848 0.0215468
+0.0455074 0.0569933 0.0321208
+-0.0438752 0.128361 0.000408951
+-0.0622566 0.0709345 0.0378148
+-0.0713089 0.156055 0.0109968
+0.0323876 0.047596 -0.00623106
+-0.0610541 0.068813 0.0363796
+-0.0175437 0.119111 -0.0121224
+-0.0136792 0.0541002 -0.0332811
+-0.0477406 0.135604 0.0113959
+-0.0709176 0.112214 -0.00951227
+0.0301974 0.0887542 -0.0200097
+-0.0734581 0.168 -0.0440151
+-0.0685258 0.165031 -0.0185494
+-0.0264962 0.0690788 0.0415599
+-0.0249134 0.0383716 -0.00452352
+-0.086697 0.114875 0.0460769
+-0.0752073 0.156095 0.0183637
+-0.0189411 0.0376177 0.0530488
+-0.0634886 0.064446 0.0291098
+-0.0261594 0.066324 0.0406106
+-0.0142604 0.0974009 0.0506069
+-0.0316679 0.0763713 -0.0315414
+-0.040787 0.0855384 -0.021437
+0.0590343 0.06983 0.00945078
+-0.07763 0.165322 -0.0259443
+-0.0631195 0.176032 -0.0554618
+-0.0918958 0.129686 0.0292517
+-0.029505 0.0545565 0.0362962
+-0.0356809 0.123888 -0.0070042
+0.0421291 0.070468 -0.00580336
+0.0297749 0.0920783 -0.0194766
+-0.0415439 0.148326 -0.00168489
+-0.090059 0.136447 0.0142016
+-0.0555057 0.0946 0.044463
+-0.0945025 0.125547 0.0202583
+-0.0304869 0.0532061 0.0367531
+0.00830607 0.0917456 -0.031199
+0.0182274 0.125477 -0.00123802
+0.0138055 0.0712841 0.0533593
+0.0294478 0.0506302 0.0370841
+-0.0802909 0.104732 0.0311813
+0.0308738 0.115323 0.0282321
+-0.0889738 0.137888 0.0281941
+-0.0750897 0.149941 -0.0248696
+0.0395014 0.0469731 0.0315971
+-0.0599935 0.0586398 0.0172334
+-0.0790056 0.166641 -0.0359617
+-0.00233373 0.114874 -0.0177321
+-0.0241436 0.180147 -0.0104229
+-0.0746876 0.0700138 0.0272066
+-0.00503592 0.13043 0.00494647
+-0.069435 0.179317 -0.0579979
+-0.0896062 0.137812 0.0131974
+-0.0625358 0.155244 -0.0346054
+-0.071543 0.155755 0.00800576
+-0.0746181 0.165272 -0.019163
+-0.0386347 0.0548667 -0.0110053
+0.00350742 0.103001 0.0436938
+-0.0629079 0.15056 -0.0255866
+0.0200283 0.0371524 -0.00668325
+-0.0375331 0.127856 0.0134298
+-0.075576 0.155851 0.0124034
+-0.0145239 0.118305 0.0371093
+-0.0528711 0.15259 0.0147483
+-0.0639569 0.158297 -0.0475943
+-0.0437953 0.0869983 -0.0218056
+0.0183 0.0651194 -0.0285252
+0.0410434 0.0689808 -0.00777311
+-0.0391241 0.157933 0.00465789
+-0.0617079 0.155317 -0.0205813
+0.049194 0.055373 0.030576
+-0.0577821 0.0826022 -0.0210434
+0.00750154 0.123796 0.0339733
+-0.0844011 0.0777797 0.0105147
+-0.0508742 0.137048 0.0234112
+-0.0487311 0.13178 0.0269763
+-0.0224768 0.123487 0.0248086
+0.0572102 0.0550739 0.00417234
+0.0523558 0.0647992 0.0281407
+-0.0804668 0.131637 0.0521945
+0.0276827 0.0480336 -0.0156964
+-0.0121824 0.178673 -0.0292354
+-0.0228778 0.10587 -0.0225138
+-0.0644637 0.0743344 0.0396953
+-0.0655821 0.153706 -0.0431373
+-0.0176845 0.0525387 -0.0318817
+0.0256228 0.0363687 8.49366e-07
+-0.0208533 0.0866413 0.055877
+-0.0490886 0.157599 -0.00632625
+0.00958152 0.0417197 0.0451866
+-0.0135001 0.0800899 0.0570677
+-0.0885594 0.112819 0.0222051
+0.0440561 0.0945388 0.0201582
+0.00630898 0.0624816 -0.0315869
+-0.0560997 0.155362 -0.00113519
+-0.0238123 0.0867774 -0.0372362
+-0.0711896 0.155374 -0.0449035
+0.018728 0.0549999 0.0480114
+-0.0696134 0.172257 -0.054028
+-0.00359831 0.101107 0.0440537
+-0.033095 0.0723179 -0.02347
+0.0338305 0.107861 -0.00824999
+-0.0354812 0.0383051 -0.00290933
+-0.0238593 0.0838986 0.0547079
+0.0239371 0.103424 0.0418106
+-0.076687 0.14724 -0.00686649
+-0.0113442 0.129847 0.0112634
+-0.0595215 0.131137 0.0385262
+-0.00250336 0.0633801 0.0564795
+-0.0765967 0.152807 -0.00988734
+0.00617007 0.126444 0.0306412
+0.0264293 0.0400385 -0.00421056
+-0.0261224 0.165258 -0.0166522
+-0.00669164 0.129496 0.00145082
+-0.0531001 0.154605 -0.00338641
+0.0347186 0.113797 0.00249877
+-0.0746345 0.0660496 0.0075612
+-0.0897609 0.0915993 0.0164407
+-0.0848984 0.0965537 0.0289739
+-0.0217829 0.111029 -0.0195757
+-0.0890662 0.123985 0.0032876
+0.0609254 0.0637423 0.0131584
+-0.0495476 0.147557 -0.00269468
+-0.00609162 0.0391352 -0.0126175
+-0.047607 0.144918 0.0010701
+-0.0484709 0.165547 -0.00491912
+0.0489576 0.0466396 0.0248167
+-0.0391315 0.160685 -0.012118
+-0.0530423 0.14778 0.0224018
+-0.0471085 0.0683456 0.0397676
+-0.0785029 0.128864 0.0532728
+0.0368255 0.109713 0.0241821
+0.0163171 0.0686116 0.0516854
+-0.0729482 0.0914984 0.0411605
+-0.0805357 0.113778 0.0465863
+0.0302378 0.0727042 0.0419554
+-0.0625354 0.122703 0.0447625
+-0.0615083 0.170965 -0.0565878
+-0.0124852 0.0659775 0.0542376
+0.0219313 0.0605513 0.0474343
+-0.048186 0.135579 0.00839494
+-0.014696 0.0585192 -0.0354314
+-0.0818834 0.109932 0.0368633
+-0.0564976 0.101562 0.0427397
+-0.0692156 0.0343564 -0.00463486
+-0.0924819 0.125444 0.00927262
+-0.0116015 0.0406252 -0.0263738
+0.000388646 0.0448955 -0.0263577
+-0.0474886 0.05462 0.0367747
+-0.0150651 0.12575 -0.00315467
+-0.0225002 0.104414 0.0430095
+-0.016108 0.038364 0.00641286
+-0.0474972 0.105664 0.0404447
+0.053572 0.0650953 0.0274823
+-0.068963 0.0874301 0.0429809
+-0.0206158 0.0422474 -0.0286271
+-0.0745126 0.131657 0.0521168
+0.0246516 0.122175 0.000230276
+-0.00982514 0.16696 -0.0220459
+-0.00885716 0.0385311 0.024037
+-0.0568241 0.063612 0.0312362
+-0.0787856 0.109366 0.039802
+0.0392221 0.075321 0.0338531
+-0.0725057 0.102685 0.0380563
+0.0318729 0.0380045 0.0237472
+-0.0704322 0.13832 0.0474328
+-0.0325018 0.177105 -0.00443384
+-0.0226059 0.0381278 0.0251854
+-0.00949201 0.129843 0.00617837
+-0.00878563 0.110674 -0.0212403
+0.0347324 0.0882263 -0.0174421
+-0.046782 0.0841151 -0.0215173
+-0.0692662 0.0692944 0.0324707
+0.00925419 0.0696192 -0.0318888
+-0.0303184 0.0423041 0.0510935
+-0.0780856 0.0784826 -0.00760345
+0.0256389 0.0929167 0.0460121
+0.00457646 0.108164 0.0418882
+-0.0519222 0.0461016 0.019678
+0.00234204 0.0367065 0.0225428
+0.0457266 0.0847913 0.00519644
+0.0292205 0.0857953 -0.020938
+-0.0196964 0.0384682 0.0290787
+0.0127826 0.0926962 0.0520031
+0.0390362 0.0980073 0.030266
+0.0186124 0.127837 0.0122439
+-0.0535608 0.0430661 -0.00900679
+-0.0509276 0.0346131 0.0417321
+0.0233086 0.0634336 -0.024957
+0.00850697 0.0546686 0.0524774
+-0.0275662 0.123979 -0.00112939
+-0.0688326 0.13265 0.047942
+0.0112159 0.0922395 -0.029689
+0.00233442 0.0539469 -0.0306143
+-0.0446508 0.040942 -0.0182992
+-0.00948977 0.114167 0.0408028
+0.0254079 0.10205 -0.0180571
+-0.0850056 0.146006 0.00617966
+-0.00850241 0.0870443 0.0572609
+0.0097783 0.1251 0.0319006
+-0.0222638 0.126605 0.016039
+-0.0722117 0.0348867 0.00176609
+-0.0327045 0.111423 -0.0179721
+-0.057835 0.0897878 -0.0213715
+-0.076573 0.153595 0.0311713
+0.0595629 0.058084 0.0191786
+-0.0323163 0.155148 0.000487548
+0.0120506 0.0505153 0.0488388
+-0.0524497 0.140085 0.0234103
+-0.0325359 0.172727 -0.00270207
+-0.0711683 0.149278 -0.039104
+-0.0641214 0.155412 0.0266328
+0.0288394 0.112544 -0.00929606
+-0.0217358 0.0384567 0.028668
+-0.0719124 0.168014 -0.0470137
+-0.0448486 0.0351369 -0.0234128
+0.0159855 0.12897 0.0112743
+0.0311432 0.0373381 0.0223917
+-0.000793766 0.0867716 -0.0355698
+-0.0900654 0.132428 0.033223
+-0.0935895 0.122834 0.0262964
+-0.0520638 0.0723523 0.0405753
+-0.0111299 0.129809 0.0171219
+-0.0491641 0.0344528 0.0317811
+-0.0849325 0.0938555 0.0290926
+-0.0809703 0.132422 -0.00393108
+-0.0887798 0.140493 0.0370948
+-0.0577868 0.0840301 -0.0211707
+-0.0814849 0.0872077 0.0329213
+0.0191348 0.102061 0.0453843
+0.0573171 0.0523102 0.00718519
+0.039991 0.0847392 0.0332858
+-0.0668403 0.0335301 0.004077
+-0.0117893 0.0392416 0.0372019
+0.0216437 0.120011 -0.00733339
+-0.0125093 0.0883992 0.0567932
+-0.0378236 0.125803 -0.00505851
+-0.0750347 0.154671 0.0286993
+-0.0887093 0.112351 0.0387402
+-0.0638899 0.102518 -0.0176142
+-0.0600535 0.138395 -0.00620678
+-0.0103882 0.129888 0.00873113
+-0.0610188 0.119808 0.0416066
+0.0158574 0.104091 -0.0202309
+-0.0839121 0.122095 -0.00374203
+-0.0841686 0.143365 0.0409129
+-0.00166671 0.12799 -0.00382866
+-0.0434723 0.0647942 0.0406198
+0.0406639 0.0815903 -0.00978474
+-0.0652464 0.154114 0.00157024
+-0.0257535 0.0740897 -0.0368116
+-0.0739579 0.13841 -0.00677972
+-0.0288788 0.0592582 -0.0244095
+0.0093177 0.0926652 -0.0301396
+-0.0452267 0.150119 -0.00491516
+-0.0319894 0.0384633 -0.00603174
+-0.0794952 0.0854073 -0.00956797
+-0.0675492 0.129835 0.0480321
+-0.0523266 0.033478 -0.00194369
+-0.00450192 0.0718383 0.058171
+-0.0535372 0.0578641 0.0215172
+-0.0140108 0.0596764 0.0527295
+-0.000532268 0.111266 -0.0199168
+0.0523683 0.0540101 0.0281247
+0.0211966 0.123092 -0.002693
+-0.00468835 0.0598784 -0.0344633
+-0.0718785 0.102239 -0.0132694
+-0.0678239 0.15109 -0.0436673
+0.0350895 0.0686836 0.0383949
+0.0422361 0.101506 0.0151693
+0.0317521 0.0794454 -0.0197442
+-0.0577724 0.0796775 -0.0200459
+-0.0461631 0.0335506 -0.0117706
+-0.0827169 0.105982 0.0279083
+-0.0922534 0.122854 0.0424865
+0.0128317 0.0712714 0.0536973
+-0.0126798 0.126321 -0.00380105
+-0.00116162 0.0980337 0.0521962
+-0.0814909 0.0788596 0.028943
+-0.0501013 0.15611 -0.00554414
+0.00939521 0.0609325 -0.0302492
+-0.030101 0.160758 -0.0141091
+-0.031497 0.117989 0.0308563
+0.0231755 0.0916964 -0.0230758
+0.0434109 0.0987186 0.0151565
+-0.0514982 0.108428 0.0386132
+-0.0644896 0.0833289 0.0440861
+-0.0238622 0.101613 -0.0238665
+0.04258 0.0422624 0.0239479
+0.0354547 0.103863 -0.00997386
+0.0217345 0.0994968 0.0456553
+-0.0743457 0.168929 -0.0264214
+0.01504 0.0343531 -0.00213727
+0.00148487 0.0399885 0.0464307
+0.0273636 0.0699427 0.0430425
+-0.0548013 0.086928 -0.0216118
+-0.0729344 0.0901459 0.0411907
+0.0305961 0.110839 -0.00946183
+-0.0721093 0.0846859 0.0405598
+-0.067036 0.180898 -0.0568882
+0.0496382 0.068363 0.00147832
+-0.0149904 0.165173 -0.0188028
+-0.0928971 0.117368 0.0123132
+-0.000378579 0.101174 0.0451223
+-0.00167056 0.0392225 0.0339103
+0.0308479 0.0567691 -0.0158074
+0.00821609 0.0823703 -0.0328688
+0.0179771 0.0393777 0.0432522
+-0.0917891 0.141969 0.0171701
+0.0284614 0.0398271 -0.00325429
+-0.0273719 0.0335777 -0.022929
+-0.0799767 0.138308 -0.00390962
+0.0224205 0.0519815 -0.0241272
+-0.0206006 0.0393656 -0.0285093
+-0.075081 0.147222 -0.0118498
+-0.0748806 0.0992858 -0.0126164
+0.0126717 0.127043 -0.00291981
+-0.0321779 0.0474216 0.0442941
+0.0248435 0.0822524 0.0483141
+-0.087169 0.0964235 0.0255876
+-0.00114332 0.0356309 -0.0159104
+-0.0674627 0.138295 0.0446438
+-0.0656974 0.169193 -0.0361564
+-0.065794 0.155512 0.00862557
+0.0346025 0.0754478 0.0394941
+-0.0145323 0.043279 0.0510718
+-0.0739879 0.139879 -0.00672352
+-0.0921938 0.132347 0.0162256
+-0.077508 0.174998 -0.0490226
+-0.0161182 0.180144 -0.0199393
+0.0442692 0.0973579 0.00816486
+-0.0885535 0.112746 0.0331115
+-0.0527601 0.0447727 0.0186838
+-0.0301237 0.12585 0.013192
+-0.0359512 0.151053 -0.00163407
+-0.0579079 0.121934 -0.00872095
+-0.0709562 0.158172 -0.0439179
+-0.00996463 0.114432 -0.0172214
+-0.0308542 0.0986541 -0.0229751
+-0.0199407 0.0381449 0.0130842
+-0.0439068 0.129921 0.011069
+0.0290675 0.120111 0.00471365
+-0.0203588 0.175699 -0.0155519
+0.0542673 0.0491964 0.0212031
+-0.0348545 0.0986254 -0.0227182
+0.0413986 0.0830578 -0.00877387
+-0.0554939 0.0477978 0.0398952
+-0.0760774 0.166574 -0.0390172
+0.0438486 0.0846749 0.0261721
+0.0021495 0.0388151 -0.00319944
+0.04114 0.104231 0.00317036
+0.0165359 0.0912212 -0.0265781
+-0.0518469 0.0545626 0.0286406
+-0.0568589 0.0562507 0.00563881
+-0.0383911 0.127983 0.00280515
+-0.0857603 0.130763 -0.000714461
+-0.0173678 0.0389666 0.0345056
+-0.0266954 0.125077 0.00273937
+0.0143393 0.0349605 0.0410018
+0.0132369 0.0709965 -0.0314873
+-0.0317622 0.0338243 0.0127586
+-0.0767072 0.0724697 0.0281768
+-0.0694593 0.040787 -0.000292884
+0.013984 0.129601 0.0176686
+-0.00527436 0.124342 -0.0098488
+-0.0749724 0.149924 -0.0268701
+-0.0188238 0.0855077 -0.0385626
+-0.0577531 0.141417 -0.00374252
+-0.0506075 0.0335251 -0.00346549
+-0.0105008 0.103039 0.0436514
+-0.062498 0.0847471 0.0443617
+-0.0166725 0.0495705 -0.0306349
+-0.0368813 0.108512 -0.0198737
+0.0510305 0.0733741 0.0168194
+-0.0275083 0.112548 0.0360564
+-0.0636421 0.0627085 -0.00368166
+0.0411669 0.104244 0.0141607
+-0.00149973 0.0965741 0.0536819
+-0.0288186 0.0862428 0.0454609
+-0.0526183 0.0343668 0.0293685
+-0.0601235 0.15512 0.0251504
+-0.0378644 0.111663 -0.0181901
+0.0344602 0.0726275 -0.0157808
+-0.0144826 0.0530653 0.0501401
+-0.0700881 0.131265 0.0496481
+-0.0878883 0.0914318 0.00546674
+-0.0415923 0.0491549 -0.0111971
+0.0234288 0.0618809 0.0460892
+-0.0630663 0.151874 -0.00782908
+-0.0866506 0.128453 0.0480393
+-0.0781275 0.152854 0.000107941
+-0.0106285 0.174518 -0.0286758
+-0.0596993 0.0345337 0.0416145
+-0.0579832 0.0466328 -0.00336399
+-0.0265008 0.124041 -0.00116405
+-0.0254725 0.0400777 0.0541415
+-0.0178664 0.12824 0.013233
+-0.0206926 0.0385034 0.0288434
+-0.0534934 0.0747559 0.0420439
+-0.0652623 0.158339 -0.0115587
+-0.0767656 0.152802 -0.00889022
+0.0245199 0.0520168 0.0405174
+0.0264125 0.0450979 -0.0096842
+-0.012488 0.107228 0.0430572
+-0.078668 0.170753 -0.0430283
+-0.0625286 0.164689 -0.038593
+-0.0241791 0.159685 -0.00173809
+0.00849261 0.092349 0.0531984
+-0.0759472 0.132533 -0.00707033
+-0.0806057 0.0720192 0.00754007
+0.00646347 0.117501 -0.0166002
+-0.0178266 0.0947205 0.0526193
+0.000481761 0.10723 0.0430499
+-0.013526 0.162053 -0.0127433
+-0.0186103 0.042208 -0.0281438
+-0.0252891 0.0336623 -0.0225985
+0.00751041 0.0688465 0.0554032
+0.0252903 0.0675893 -0.0238235
+-0.065902 0.112354 -0.012152
+-0.0476622 0.0620749 -0.0123691
+-0.0940806 0.122789 0.0152778
+-0.0229201 0.115998 -0.0147881
+-0.0344826 0.0519106 0.0380623
+-0.0890068 0.11621 0.0451247
+0.0107555 0.0404168 0.045078
+-0.0894686 0.136415 0.011209
+-0.0757697 0.145819 -0.00688494
+-0.071833 0.152571 -0.043913
+0.0235861 0.0352777 0.0154316
+-0.0926495 0.129588 0.0122381
+-0.0647445 0.0780775 -0.0178137
+-0.00582898 0.0896214 -0.0360418
+0.0559073 0.0721087 0.0082759
+-0.0261702 0.0823861 0.0514348
+-0.0558857 0.0970202 -0.0212239
+-0.0630553 0.148575 -0.0182369
+0.00714931 0.123902 0.0338795
+0.0304322 0.0902625 -0.0195701
+-0.0137593 0.0388335 -0.0101314
+0.0427673 0.0818692 0.0284169
+-0.0651233 0.155698 0.0103085
+-0.0897032 0.113874 0.0229056
+-0.0447211 0.129823 0.00637961
+-0.0575 0.0588269 0.0212602
+0.0104936 0.11823 0.0368787
+0.0202805 0.12337 -0.00295598
+-0.0340138 0.155107 0.00155033
+0.0602047 0.0622908 0.0181797
+-0.0859874 0.153017 0.0132012
+0.0433237 0.0846089 -0.00479162
+-0.0678527 0.0937535 -0.0166708
+0.0608755 0.0651235 0.0141559
+-0.0737739 0.0878479 -0.0153893
+0.0296171 0.11988 0.0191943
+-0.00324005 0.038276 0.0477168
+-0.0806315 0.139432 0.0474021
+0.0455013 0.0583861 0.0319381
+-0.0740734 0.172255 -0.0349568
+0.0224678 0.0975265 0.046211
+-0.0525514 0.0389481 -0.0113995
+0.0281531 0.119463 0.0257844
+-0.0765864 0.155527 -0.0189073
+-0.0289503 0.0931616 -0.025199
+-0.0573663 0.0338673 0.0217593
+0.0396386 0.064502 0.0326274
+0.00539495 0.0433546 -0.0245866
+0.0256558 0.0782254 0.0477034
+0.0162437 0.0764684 -0.0291666
+0.0272037 0.100805 0.0412523
+-0.0316694 0.0357391 0.0272619
+-0.0623836 0.163119 -0.0315939
+0.0275463 0.095549 0.0435012
+0.0393856 0.0475887 -0.00567863
+-0.0394934 0.163848 0.00245451
+0.0242993 0.0928305 -0.0222726
+-0.0271788 0.0358787 -0.0194139
+-0.0734977 0.124615 0.0532793
+-0.0883817 0.123968 0.00128346
+-0.0257849 0.174205 -0.0110873
+-0.0281104 0.163768 -0.0157424
+-0.0662143 0.0386042 0.0318887
+-0.0109132 0.103533 -0.0236899
+-0.0616548 0.140062 -0.00630976
+-0.060057 0.135486 -0.00665791
+0.0434691 0.0624283 0.0290897
+-0.0236196 0.0436733 -0.0286374
+0.043495 0.0610671 0.0301862
+-0.0910584 0.133686 0.0122173
+0.0291029 0.0938741 -0.0193597
+-0.0261534 0.0383869 0.0314189
+0.00850666 0.0896726 0.0548038
+-0.0247527 0.0340557 -0.0209813
+-0.0186132 0.0436215 -0.0279143
+-0.0124858 0.0911558 0.0565265
+0.0053433 0.0524636 -0.0297405
+0.0403239 0.0999619 0.0261672
+-0.0522155 0.149331 0.0183918
+-0.0534968 0.0973516 0.0432358
+-0.0284959 0.10431 0.0415782
+-0.0908913 0.139194 0.0171389
+0.0264487 0.0948748 -0.0204583
+-0.0834511 0.149763 0.0335021
+-0.00425208 0.0941246 -0.0337645
+-0.0337113 0.0652961 -0.0165207
+-0.0405229 0.128682 0.00643622
+0.025364 0.0547555 -0.0216571
+0.0209176 0.124997 0.0245115
+0.0147936 0.104084 -0.0202238
+-0.0510936 0.156101 -0.00485677
+-0.00104637 0.116277 -0.0172455
+-0.0564804 0.0613799 -0.00459099
+-0.0261657 0.11885 -0.0117616
+-0.0612216 0.155927 0.0131437
+-0.0264503 0.181668 -0.00853376
+0.0163083 0.0594423 -0.028212
+-0.0188061 0.081321 -0.0390856
+-0.0660982 0.156586 -0.0534726
+-0.0596936 0.155857 0.0122367
+-0.0656404 0.0608118 0.00501538
+0.00550383 0.0716948 0.0562222
+-0.0473457 0.134062 0.00939848
+0.0233312 0.0436331 0.0404882
+0.0342215 0.0827959 -0.0185003
+0.00407718 0.131556 0.00833758
+-0.0524976 0.0931679 0.0439324
+-0.0206125 0.0553712 0.0467047
+-0.0499367 0.0345722 0.0419808
+-0.0720303 0.169416 -0.0480254
+0.0463102 0.0820482 0.0101764
+0.0239273 0.0383233 0.0327312
+-0.0556472 0.0657358 0.0349277
+0.0082124 0.0879974 -0.0324239
+-0.0483251 0.123967 0.0299918
+-0.00979541 0.0826872 -0.0380854
+-0.0104818 0.0688481 0.0551963
+-0.0738713 0.116445 -0.00712552
+-0.0783268 0.0804305 0.0341941
+-0.0318616 0.0386777 -0.0303614
+-0.0685663 0.0335043 0.000153325
+0.0419445 0.0972272 0.0251571
+-0.0324967 0.0831278 0.0417023
+-0.0385753 0.165326 0.00202421
+-0.0574991 0.105703 0.0407441
+-0.0735089 0.120392 0.0535609
+-0.0194999 0.105809 0.042534
+-0.0918084 0.11461 0.0202058
+0.0373089 0.0604869 0.0345236
+-0.0397982 0.0885212 -0.0227204
+-0.0838603 0.0771078 0.0156983
+-0.0683511 0.16683 -0.0228013
+0.00825384 0.0357096 0.0264477
+-0.0487592 0.0797294 -0.0200154
+-0.067984 0.13847 -0.00792156
+-0.0205709 0.127392 0.00935219
+0.0158596 0.0940217 0.0494261
+-0.00476401 0.100643 0.0463697
+-0.0144795 0.0617481 0.0535104
+-0.0635003 0.0931972 0.0443921
+-0.06148 0.0371866 -0.00855801
+-0.0235696 0.0368882 0.0541538
+-0.00084278 0.129714 0.0251926
+-0.0857238 0.0792489 0.0165033
+-0.00382707 0.0868147 -0.0366286
+-0.0623716 0.0433162 0.04063
+-0.0481783 0.127343 -0.00452632
+0.0258208 0.0577421 -0.0227411
+-0.0464997 0.109825 0.0383354
+-0.0632202 0.150553 -0.0275915
+0.0594014 0.060828 0.00515272
+-0.0379322 0.0359407 -0.029738
+-0.0628566 0.163115 -0.0590591
+0.032875 0.0504741 0.0332188
+-0.0798256 0.114817 -0.00349908
+0.00979876 0.0631089 0.0545118
+-0.00479883 0.0826783 -0.0376925
+-0.0586564 0.152453 0.0326111
+-0.0847868 0.0979024 0.0288114
+-0.0248237 0.0853842 -0.0372699
+-0.00156343 0.13088 0.0191419
+-0.0624949 0.0729745 0.0395167
+-0.0208752 0.105853 -0.0224653
+0.0381305 0.0743398 -0.0117665
+0.00679871 0.128004 -0.00391746
+-0.0769289 0.125211 -0.00745968
+-0.0251918 0.111615 -0.0181703
+-0.0538836 0.0984784 -0.021806
+-0.0535445 0.0444164 -0.0080927
+0.0449223 0.0903552 0.00117592
+0.00748556 0.116867 0.0384917
+0.0479919 0.0426572 0.0134999
+0.0269115 0.116892 -0.00595645
+0.0287509 0.0911639 -0.0204971
+-0.00583539 0.0910195 -0.0356702
+0.0122548 0.126063 0.0299441
+-0.0732964 0.0791377 0.0376894
+-0.0578898 0.108324 -0.0176181
+-0.0316803 0.111369 -0.0179291
+-0.00248889 0.101618 0.0440339
+0.0583601 0.0593964 0.0227402
+-0.0568793 0.105485 -0.0183902
+0.0313941 0.108732 0.0332945
+-0.0104953 0.0801622 0.0580036
+-0.0799858 0.150056 0.000166757
+-0.0448968 0.146123 0.00263093
+-0.0595037 0.0344238 0.0383245
+-0.0836036 0.133464 -0.00169527
+-0.0115063 0.0575113 0.0530742
+-0.0112578 0.037897 0.0501369
+-0.0404967 0.071918 0.0419528
+-0.024201 0.0373653 0.0542269
+-0.063129 0.0366622 0.0429743
+0.0461067 0.069238 0.0238359
+-0.0217169 0.0945664 0.0494448
+0.0519577 0.0621966 0.0293389
+0.0286828 0.072686 0.0432253
+0.0389262 0.103315 -0.00332456
+-0.0908979 0.126784 0.00627265
+-0.0604951 0.097348 0.0432235
+0.00320361 0.0838721 -0.0343861
+-0.0615214 0.155998 0.0173864
+0.0174482 0.090927 -0.0262636
+-0.0428815 0.108469 -0.0193857
+0.0528827 0.0476533 0.00520477
+-0.0692155 0.155426 0.0044718
+-0.0116319 0.126956 0.0271535
+0.0555832 0.0661715 0.0258304
+-0.0669079 0.139705 0.0437201
+0.0208911 0.120687 0.0321527
+-0.0692559 0.157013 -0.00287665
+-0.0642658 0.131126 0.0422113
+-0.00350345 0.108655 0.04343
+0.00595359 0.131311 0.0061803
+-0.0652676 0.179645 -0.0602668
+0.0113097 0.0609536 -0.0296395
+0.0202287 0.0385462 -0.010699
+-0.0528896 0.0556157 0.0124842
+-0.0830831 0.152763 0.0275295
+-0.0929926 0.121477 0.0272936
+-0.0679169 0.115123 -0.00939662
+-0.0715189 0.150138 -0.0417489
+0.0502478 0.0496891 0.0267596
+-0.088826 0.122625 0.00229599
+0.045739 0.0876044 0.00618298
+0.0276204 0.0364605 0.0224657
+0.0550864 0.0576626 -0.000774412
+-0.0601415 0.0397484 0.0187938
+-0.0467117 0.131872 0.0218067
+-0.00211002 0.131247 0.0146415
+0.0400335 0.107013 0.011165
+-0.0875275 0.141918 0.0101858
+-0.0321386 0.0511687 -0.0124242
+-0.05996 0.047085 0.0381143
+-0.0771576 0.158311 -0.0229061
+-0.0910473 0.139231 0.0181913
+0.0586943 0.0552354 0.0191792
+0.0541025 0.0616928 -0.00172111
+0.0193458 0.0347743 -0.00166328
+-0.0785503 0.175004 -0.046006
+0.0361753 0.0767902 0.0382584
+-0.00218115 0.0950603 -0.0327048
+-0.00446475 0.03907 -0.00848801
+-0.0509412 0.0543847 0.0317288
+-0.031974 0.126184 0.0154629
+-0.0517139 0.047497 0.0206563
+0.0390432 0.106963 0.0211652
+-0.0661031 0.169296 -0.0348743
+-0.0461189 0.0353483 0.0438447
+-0.0618314 0.155872 0.0114752
+-0.0414861 0.169687 0.00162271
+-0.0640913 0.154089 -0.00821335
+-0.0474977 0.0776489 0.0433419
+-0.000495324 0.0870356 0.0569136
+0.0572432 0.0508915 0.0131865
+0.0162675 0.0348087 0.0361219
+-0.0561497 0.0697401 0.0384165
+-0.0632023 0.166731 -0.0605917
+-0.0297129 0.0382953 0.00190139
+-0.00511763 0.0345398 -0.0175639
+-0.0614326 0.0342559 0.0293559
+-0.0526737 0.0678526 -0.0129346
+0.0213104 0.092205 -0.0236008
+0.0197097 0.119321 0.0339587
+-0.0214979 0.120818 0.0311972
+0.0121652 0.0940439 -0.0275601
+0.0264769 0.122884 0.00946172
+-0.0236707 0.0536853 -0.0289139
+-0.0413464 0.0470648 -0.0139804
+0.0254796 0.122858 0.0219249
+-0.0924012 0.125564 0.030262
+-0.0879683 0.133795 0.0435491
+-0.0521211 0.0500618 0.0133132
+-0.0655655 0.115703 0.0473772
+-0.0739163 0.0808829 -0.0136046
+-0.0678507 0.166619 -0.0550103
+-0.0116556 0.127143 -0.00273206
+-0.0318682 0.101497 -0.022474
+-0.0710899 0.143489 -0.012899
+-0.0174739 0.0587291 0.0509898
+-0.0238083 0.125586 0.00234805
+-0.0296624 0.0691842 -0.029462
+0.00123889 0.0998292 0.0485145
+-0.0648099 0.0910089 -0.0186372
+-0.0624633 0.170945 -0.051605
+-0.0911968 0.145718 0.0253129
+-0.0208075 0.0827095 -0.0389174
+-0.0156288 0.184043 -0.0262877
+0.0422094 0.0873179 -0.00779978
+0.00273738 0.0943137 -0.0318997
+-0.082233 0.0925905 0.0320729
+-0.0782161 0.110396 0.044452
+-0.0842181 0.153993 0.0196689
+-0.00949468 0.0532459 0.0520833
+-0.0867806 0.115997 0.0469199
+-0.0547757 0.0826557 -0.0215494
+-0.0382309 0.0365042 0.0436563
+0.021227 0.0727783 0.05004
+-0.00441949 0.0338393 -0.022426
+-0.0712771 0.0648585 0.00216525
+-0.0364976 0.111093 0.0360234
+-0.0669244 0.123843 -0.00898539
+-0.0178669 0.0554748 0.0496143
+0.020489 0.0906324 0.0482147
+-0.00549595 0.0605287 0.0555985
+-0.0289733 0.0536405 -0.0223788
+0.0191474 0.0435971 0.0432171
+0.00434602 0.0346139 0.0410512
+-0.0400219 0.111533 -0.0180322
+0.012127 0.0534588 0.0507501
+0.0284176 0.0415874 -0.00471776
+-0.0270737 0.125279 0.00405866
+-0.0221888 0.0348068 0.0442295
+-0.0447592 0.0797381 -0.0197229
+-0.0304968 0.172715 -0.00561384
+-0.0762362 0.0865455 -0.0135615
+0.0197685 0.0371215 -0.00768223
+0.0379293 0.0417908 0.0270611
+-0.0809612 0.0747382 0.0015261
+0.00168043 0.0346784 0.042239
+0.0257721 0.0915784 0.0461947
+-0.0898405 0.133789 0.0312158
+-0.0355388 0.0441134 -0.0275262
+0.00710192 0.0379595 0.027814
+-0.0620019 0.0401372 0.0237075
+0.0429025 0.100097 0.0151567
+-0.00267325 0.0569172 -0.0326724
+-0.0285904 0.110146 -0.0186081
+-0.0762074 0.0906406 -0.013533
+0.0535161 0.0677623 0.0259787
+-0.00262958 0.0466399 -0.0290845
+-0.0839307 0.125043 -0.00388859
+-0.0340047 0.0386047 -0.0302796
+0.0184751 0.082463 0.0515958
+-0.0574796 0.115365 0.0367006
+-0.0420623 0.154724 -0.00848194
+-0.0860758 0.0924352 0.0274562
+-0.0930739 0.122895 0.0382751
+0.051883 0.0734548 0.0112114
+-0.0811474 0.0769537 0.0251701
+-0.0618709 0.0338217 0.0137712
+0.0195119 0.0370935 -0.00868114
+0.00449835 0.0590783 0.0547231
+-0.0645467 0.148975 -0.0280488
+0.0404587 0.0426892 0.0267677
+-0.0712073 0.146616 -0.0240304
+-0.0512571 0.0488673 0.0206327
+-0.00789661 0.098211 -0.0280331
+-0.0821992 0.0980013 0.0318751
+0.0249936 0.037232 0.0266864
+-0.00349731 0.0456721 0.0469862
+0.0464132 0.0472054 -0.00271728
+-0.0659208 0.0390922 0.037189
+-0.0655814 0.167928 -0.031824
+-0.0726143 0.1704 -0.0286759
+-0.032982 0.0423452 0.0495212
+-0.0442602 0.153622 0.00782588
+0.0320708 0.117667 0.00585111
+0.0181014 0.0354956 -0.0136744
+-0.0756189 0.168382 -0.0269354
+-0.0302725 0.114038 -0.0167089
+-0.06455 0.166996 -0.0328772
+-0.0136948 0.125921 0.0278767
+-0.0594946 0.0973472 0.0432255
+-0.0660053 0.138467 -0.00776776
+-0.0538886 0.161243 -0.000916627
+-0.0521229 0.0491646 0.0356345
+-0.0669695 0.167967 -0.0280306
+-0.0692702 0.0635509 0.00193084
+-0.057893 0.109749 -0.0172343
+0.0162169 0.116863 -0.0139359
+-0.0837452 0.0818387 0.0274964
+-0.0188705 0.104448 -0.0228566
+0.017085 0.0604224 0.0492086
+-0.0636469 0.11387 0.0394431
+0.0060852 0.126695 -0.00651247
+-0.0563559 0.0448266 0.0148606
+-0.0534962 0.0959644 0.0436141
+0.0587007 0.0538335 0.0141792
+0.00148321 0.105804 0.0429258
+-0.0696571 0.0662079 0.0262916
+0.0292497 0.0745452 -0.0220465
+-0.0363535 0.0380033 0.0459253
+-0.0388642 0.104209 -0.02036
+0.0363189 0.106784 -0.00482843
+-0.0506381 0.0473796 0.0176699
+0.0415736 0.0738523 0.0301911
+0.00841968 0.0357631 -0.0122614
+-0.0449132 0.130768 0.0151196
+-0.0348253 0.0822923 -0.0236386
+-0.0756565 0.0672218 0.011813
+-0.0840475 0.0856522 0.0284432
+0.0358352 0.11315 0.0115155
+0.0378536 0.10688 -0.000832307
+0.0327708 0.0862789 0.0422215
+-0.0510409 0.034583 0.0365198
+0.0285939 0.108783 0.0362583
+-0.0291219 0.163733 -0.0155493
+-0.0075062 0.071811 0.0576623
+-0.0285902 0.125327 0.00496117
+0.022493 0.120697 0.0309281
+-0.081164 0.0734408 0.004547
+-0.011709 0.0628424 -0.0363307
+-0.0258651 0.101595 -0.0237434
+0.0205831 0.11206 -0.0147671
+0.0444356 0.0931566 0.0191609
+-0.04739 0.113671 -0.0162364
+-0.0489307 0.0334882 -0.00491951
+-0.0129236 0.118879 -0.0139348
+-0.0161652 0.0382063 0.017415
+-0.00495697 0.0978375 0.052341
+-0.0277397 0.0605536 -0.0284245
+-0.00547292 0.0385489 0.021098
+-0.00115741 0.0949656 -0.0326157
+-0.0444374 0.124419 -0.00954541
+-0.0821611 0.0761834 0.00152312
+-0.0144467 0.0348076 0.0441223
+-0.0715687 0.153984 -0.0439053
+-0.00636015 0.130593 0.00877385
+-0.0127796 0.0382227 0.0144711
+0.0370519 0.110502 0.0205344
+-0.0322265 0.0637977 -0.0184499
+-0.0106706 0.054151 -0.0336931
+-0.0455975 0.169625 -0.00241942
+0.0182033 0.0435661 0.0436183
+-0.0718144 0.147892 -0.0304457
+-0.0577521 0.050802 0.00265023
+-0.0586963 0.0588331 0.00348495
+-0.0866227 0.109058 0.0173532
+-0.0383512 0.122877 -0.00994551
+-0.070675 0.0778663 -0.0147995
+-0.0181879 0.174194 -0.0234207
+-0.0587357 0.153161 0.0315118
+-0.0350971 0.16074 -0.013448
+0.00536912 0.049521 -0.0287338
+-0.0474407 0.134003 0.00841493
+-0.0624554 0.1522 -0.0115838
+-0.0760236 0.150016 -0.00789124
+-0.0261434 0.0379494 0.0119939
+-0.068707 0.0613453 0.00749837
+0.0495547 0.0702574 0.0035522
+0.0608929 0.0651253 0.0121512
+0.0417276 0.0683416 0.0285931
+-0.0322652 0.177059 -0.0129859
+-0.027328 0.0951114 -0.0248637
+-0.0207784 0.0714012 -0.0384405
+-0.0483231 0.128062 -0.00327126
+-0.0424968 0.0449805 -0.0163196
+-0.0550216 0.142767 -0.00162505
+-0.0444981 0.112567 0.0357183
+0.039909 0.107011 0.00616363
+0.0103602 0.0524141 -0.0291489
+-0.0621527 0.0372105 -0.00831557
+0.0052003 0.124064 -0.00964829
+0.0584567 0.0701808 0.018095
+0.0154065 0.0880419 -0.0292971
+-0.0675878 0.0672405 -0.0057657
+0.0141143 0.129082 0.00347211
+-0.0769907 0.154191 -0.00889586
+-0.0351753 0.160922 -0.000113952
+-0.0865124 0.0819745 0.0105022
+-0.0802058 0.0759672 -0.0035211
+0.0412042 0.046738 0.0312341
+0.0531089 0.0539671 0.0274209
+-0.0202736 0.0966137 -0.0264451
+-0.021864 0.108885 -0.0213157
+0.0172909 0.0900542 0.0497289
+0.0151151 0.0645034 0.0516546
+-0.00371721 0.100591 0.046739
+-0.0281684 0.117044 -0.0138686
+0.044615 0.0762444 0.0239446
+0.00250222 0.0504849 0.0522926
+-0.0407291 0.0724971 -0.0177035
+-0.076873 0.114866 -0.00505023
+-0.0509699 0.0334609 -0.0108109
+-0.0307494 0.125973 0.00854668
+-0.0842046 0.10344 -0.000635192
+-0.0637785 0.0335481 0.00468656
+0.0573103 0.0709688 0.0191461
+-0.0548852 0.0344475 0.0323271
+-0.0566985 0.0694351 -0.0145553
+0.0116873 0.128578 0.0254498
+-0.0635208 0.0384034 0.0165311
+-0.0193913 0.161115 -0.00536021
+-0.0517184 0.0708739 -0.0153462
+-0.0355107 0.0789772 0.0422885
+-0.0308674 0.0359912 0.0254031
+-0.0496962 0.137023 0.0203775
+-0.000496498 0.0549075 0.0548747
+0.0203519 0.0506032 0.0432764
+-0.00603714 0.0387093 0.0280658
+-0.0424971 0.165251 0.00449932
+-0.088747 0.148763 0.0102254
+0.0140119 0.072675 0.0536492
+-0.0355033 0.109745 0.0370663
+-0.0495176 0.0451863 0.0426306
+0.0161864 0.128058 0.00281004
+-0.0689044 0.110844 -0.0111483
+-0.0648164 0.0412793 0.0318749
+-0.0594946 0.0959853 0.0440949
+-0.0201946 0.0918367 -0.0355405
+-0.00451061 0.0534011 0.0538125
+-0.0256167 0.0422692 -0.0291044
+-0.0366019 0.0472824 -0.0203909
+-0.0714721 0.152551 -0.0449162
+-0.0686495 0.0395764 0.0103048
+-0.0916814 0.147477 0.020141
+0.0344933 0.0646793 0.0392567
+0.0354037 0.0848596 0.0389463
+0.0335837 0.114911 0.0235455
+-0.00948608 0.0488348 0.0496357
+0.0162564 0.0875946 -0.0288434
+-0.0495004 0.0876335 0.045502
+-0.00788756 0.107371 -0.0226705
+0.0279061 0.0479696 -0.0147397
+-0.0593675 0.145365 0.0352791
+-0.0297371 0.179987 -0.0120259
+-0.00152895 0.1273 -0.00507098
+-0.053021 0.0473885 0.0142865
+-0.031661 0.0351392 -0.0196159
+-0.0428508 0.127424 0.0174253
+0.00853656 0.103079 0.0455737
+-0.0428329 0.0928281 -0.0227901
+-0.0533229 0.121583 -0.0104498
+-0.0281276 0.163902 -0.00573037
+0.00550696 0.0647473 0.0560963
+-0.0786632 0.155487 0.0200952
+0.0373574 0.0841251 -0.0157743
+0.00845531 0.04577 0.0469205
+-0.0816426 0.140732 0.045535
+-0.0198636 0.184564 -0.0147357
+-0.0441 0.149758 -0.00480897
+-0.0394895 0.0478295 0.0398724
+-0.0902912 0.136455 0.0152001
+-0.0912584 0.116106 0.0417079
+-0.078373 0.161039 -0.0249642
+-0.0823003 0.143183 0.00115625
+-0.0366712 0.0621691 -0.0130418
+0.0483193 0.0518215 -0.00445791
+-0.0647832 0.179003 -0.0560548
+-0.066692 0.1555 0.0271809
+0.0251524 0.123931 0.0146708
+-0.0729716 0.175028 -0.0520538
+0.0249807 0.0645674 0.0448324
+0.0189844 0.127654 0.0109555
+-0.023546 0.114036 0.0366055
+-0.0166929 0.178668 -0.0190282
+-0.0838411 0.0884243 0.0295799
+0.0340178 0.106064 0.0317678
+0.0172301 0.0834905 -0.0285819
+-0.0836745 0.0939124 0.0306595
+0.00650612 0.0856084 0.0565927
+-0.00650337 0.0633626 0.0562557
+0.00724714 0.123914 -0.00950504
+-0.04049 0.0677003 0.0417506
+-0.083014 0.0816043 0.0289568
+-0.0791181 0.10724 -0.00560787
+-0.0643983 0.155173 -0.0416037
+-0.0194853 0.0382676 0.0257029
+0.017193 0.0407686 0.0438767
+-0.0578741 0.0997697 -0.0193936
+-0.00470039 0.0340249 -0.0188849
+0.009491 0.0923319 0.053062
+-0.0679779 0.0615132 0.00568001
+-0.00851004 0.0960786 -0.0317903
+0.0222567 0.0734747 -0.02675
+0.0396829 0.102719 -0.00275708
+0.0333394 0.0519958 0.0339463
+-0.0317958 0.166782 -0.0057687
+-0.0851069 0.104842 0.00238218
+0.040355 0.0712163 0.0319238
+-0.0796414 0.0719293 0.00453596
+-0.00871509 0.0670095 -0.035665
+-0.04676 0.0797358 -0.0197068
+0.00759602 0.120603 -0.0139518
+-0.00757253 0.0384534 0.015324
+0.027396 0.0902329 0.0450202
+-0.0837001 0.104608 0.0275279
+-0.0648437 0.159826 -0.0567739
+-0.0182921 0.113707 -0.0184295
+-0.0318101 0.0499111 0.0410759
+0.0042017 0.130577 0.0226921
+-0.0882785 0.102304 0.00940329
+-0.0669196 0.157864 -0.00782765
+-0.0574974 0.104327 0.0414929
+-0.028183 0.0499752 0.0445203
+0.0437475 0.087439 -0.00380588
+0.047365 0.0735855 0.0109418
+-0.0355275 0.04785 0.0396404
+-0.00564979 0.0511569 -0.0315211
+-0.0622081 0.163133 -0.0355907
+-0.0126796 0.0555759 -0.033924
+-0.0434133 0.12436 -0.00948612
+0.0325363 0.0605817 0.0399114
+0.00828387 0.0859903 0.0560092
+-0.0377619 0.0480619 -0.0149351
+-0.0152064 0.0377587 0.0513804
+0.0337034 0.0740969 0.0399489
+0.0386678 0.106943 0.0231645
+-0.0568902 0.10122 -0.0192994
+-0.0629975 0.158364 -0.0415982
+0.0174963 0.116768 0.0361173
+-0.018574 0.174216 -0.0164984
+-0.0916005 0.147489 0.0211447
+0.0351839 0.113522 0.00409669
+-0.0642224 0.175708 -0.0529566
+-0.0646189 0.0691309 -0.0109873
+-0.0744709 0.159641 -0.0299365
+-0.0810037 0.0777776 0.0280061
+-0.0468539 0.0397424 -0.0132276
+-0.0387576 0.152152 0.00343994
+-0.0355301 0.0350253 0.0446914
+-0.0252945 0.179999 -0.0179968
+-0.0594833 0.0440844 0.0256893
+-0.0262483 0.175689 -0.00998917
+-0.0357 0.0344414 0.0311095
+-0.0348452 0.0957896 -0.0233484
+-0.0694619 0.0701676 0.0334316
+-0.0704025 0.156596 -0.000355665
+0.0197946 0.0872171 -0.0264236
+-0.00225576 0.119004 -0.0141489
+0.0447595 0.0819096 0.000199099
+-0.0414725 0.16704 -0.0108149
+0.0383695 0.0533606 -0.00654853
+0.0436976 0.0763605 0.0261605
+-0.059412 0.0342492 0.0297869
+-0.0105538 0.0962042 -0.0319333
+0.0354985 0.0483762 0.03122
+-0.0232213 0.183101 -0.0108227
+-0.0454832 0.0704956 0.0415155
+-0.0818632 0.143391 0.0428465
+-0.00588211 0.0384235 0.0193174
+-0.0715611 0.065876 0.0226562
+-0.0557658 0.0561367 -0.00241411
+-0.007704 0.0613485 -0.0352024
+-0.050582 0.13546 0.000440434
+-0.0239591 0.0958294 0.044594
+-0.0344217 0.156595 0.00275895
+-0.0721769 0.146332 -0.0246714
+-0.00172768 0.0683482 -0.0343533
+0.0465137 0.0736858 0.00606841
+-0.0379081 0.0345108 0.0393807
+-0.0536272 0.0632225 -0.00927695
+0.0216001 0.0346735 0.00635285
+-0.00546011 0.130518 0.00622904
+0.025022 0.0994981 0.0433749
+-0.059626 0.14292 -0.00334389
+-0.0662647 0.160967 -0.0574681
+-0.086688 0.0937529 0.026595
+-0.0292509 0.122699 0.0223824
+-0.020881 0.0609703 0.0467992
+-0.0727056 0.0704556 0.030746
+-0.0670342 0.154632 -0.0510962
+-0.0818617 0.117704 -0.00327392
+-0.00930377 0.0384012 0.0113924
+-0.0294534 0.0382504 0.0532249
+-0.0428028 0.034428 0.0296237
+0.034591 0.113857 0.0224952
+0.0260945 0.0981604 0.0431638
+0.0157288 0.0740195 0.0526622
+0.00528348 0.0654438 -0.0329345
+0.0342272 0.113045 -0.000582475
+0.0177023 0.127344 0.0204737
+-0.00349601 0.0619414 0.0556852
+-0.0633856 0.13531 0.0381918
+-0.0187732 0.0742782 -0.038946
+-0.0714922 0.124606 0.0531293
+-0.0387588 0.0432047 -0.0253505
+-0.0377685 0.112865 -0.0174473
+-0.0811078 0.0831466 0.0326628
+0.0121734 0.0347014 0.0407838
+-0.0423463 0.0344667 0.0367209
+-0.0247884 0.0905387 0.0498003
+-0.0589097 0.111154 -0.0162513
+-0.0119878 0.0389387 -0.0117395
+-0.0746688 0.0730125 -0.00771761
+-0.0636783 0.0344406 0.016873
+-0.0718387 0.063614 0.0140147
+-0.0537353 0.0753205 -0.0183524
+0.0399868 0.0793585 0.0332409
+0.0342696 0.0686799 0.038964
+0.0283038 0.121367 0.00870899
+0.020694 0.101208 -0.0211426
+-0.0607079 0.149875 -0.000940868
+-0.0663226 0.0771733 0.0404118
+-0.0856352 0.151298 0.0280417
+0.00450086 0.0533884 0.0535142
+0.0193556 0.0370965 -0.0106758
+-0.073245 0.152646 -0.0348949
+-0.0311279 0.168264 -0.00654632
+-0.0314769 0.122323 0.024544
+-0.00965298 0.0383614 0.0149817
+0.0322912 0.117174 0.00450048
+-0.0303956 0.0833549 -0.0325649
+-0.0305081 0.109824 0.0377476
+0.060267 0.0581373 0.011162
+-0.0782363 0.119072 0.0512696
+-0.0819743 0.130956 -0.00393996
+0.0125568 0.129953 0.0057397
+-0.0750314 0.165158 -0.038026
+-0.0842614 0.0857549 -0.00354776
+-0.0194949 0.122198 0.0303074
+-0.0885869 0.0914877 0.00746285
+0.0183032 0.0622432 -0.0278633
+-0.0188389 0.0383463 0.00224079
+0.0169223 0.0354899 -0.0154522
+-0.0510859 0.154625 -0.00472421
+-0.04134 0.171235 -0.00891614
+-0.00271064 0.0641639 -0.0348647
+-0.0404957 0.119327 0.0301663
+0.0161104 0.038261 0.0437952
+-0.0788559 0.0706244 0.0187647
+-0.0565382 0.0387829 -0.00997998
+0.00406092 0.0347375 0.0390843
+-0.052431 0.0503969 0.0246465
+-0.0548238 0.136818 -0.00273484
+-0.0168361 0.163394 -0.0165332
+0.0085002 0.0589241 0.0531764
+-0.00349833 0.104479 0.0440938
+0.041165 0.0675922 -0.00677134
+-0.0766837 0.0941158 0.0377884
+-0.0715005 0.108276 0.0374406
+-0.0514917 0.154976 0.0111
+-0.0766573 0.0758638 -0.0078194
+-0.0708734 0.116483 -0.00801313
+-0.0584915 0.0333664 -0.00308936
+-0.0132404 0.0420117 0.0507817
+0.0504568 0.0627892 -0.00292241
+0.0181009 0.0617863 0.0489038
+-0.0686053 0.155434 -0.0518073
+-0.0866142 0.111799 0.023338
+-0.0087012 0.0613261 -0.0351009
+-0.0667075 0.179209 -0.0538653
+0.0133269 0.036855 0.044466
+-0.0308424 0.0930072 -0.0244625
+-0.0526579 0.118327 0.034303
+-0.0802651 0.0940224 0.034298
+-0.0895241 0.094286 0.0154262
+-0.0580951 0.0448084 0.0137644
+0.0187472 0.0369987 -0.01368
+-0.0174935 0.0786826 0.056671
+-0.026682 0.0779832 0.0478067
+0.0449566 0.0931917 0.0141646
+-0.0598355 0.0968573 -0.0194316
+-0.015743 0.0388551 0.0331436
+0.045657 0.07639 0.00319799
+0.00221136 0.0782941 -0.0352071
+-0.0725589 0.0360747 0.00146649
+-0.0641358 0.117113 0.0460384
+-0.0709488 0.0833216 0.0408543
+0.0230126 0.0366914 0.0285839
+0.0164832 0.101772 0.0464774
+-0.0114886 0.10724 0.0431864
+-0.0748949 0.0968349 0.0387401
+-0.0428468 0.0368545 0.044028
+-0.0121243 0.183164 -0.0282842
+-0.0110799 0.0973863 0.0517395
+-0.0283441 0.0346627 0.0430398
+-0.0591236 0.0454581 0.0276809
+0.0359903 0.0834983 0.0380665
+-0.0894731 0.112826 0.0381953
+-0.0633619 0.165109 -0.0324564
+-0.0893245 0.139298 0.0361742
+-0.0113718 0.177173 -0.0236196
+0.0314957 0.0386039 0.0249642
+-0.0153586 0.171251 -0.0171482
+-0.0501632 0.165541 -0.000963216
+-0.0125979 0.0362885 -0.0258846
+-0.0109041 0.121705 -0.010941
+-0.01134 0.181374 -0.0292688
+-0.0636417 0.067527 -0.00924444
+-0.0645561 0.151545 -0.0345673
+0.0234128 0.0685823 0.0460905
+-0.0204536 0.184888 -0.0139868
+-0.0362035 0.16829 0.000195359
+-0.0423655 0.0354607 0.0428683
+0.029434 0.0414849 -0.00426139
+-0.0548859 0.0335879 0.0154264
+0.0301337 0.0958138 -0.0174156
+-0.0231819 0.174173 -0.0207431
+0.0495183 0.0596792 0.0306871
+-0.0615314 0.169388 -0.0555899
+-0.0645149 0.156191 0.0192193
+-0.0808163 0.150056 0.00117383
+-0.0203106 0.127423 0.0152774
+-0.048501 0.0946267 0.0446158
+-0.0621404 0.0458224 0.0356845
+0.014817 0.0713159 0.0530708
+-0.0482359 0.0600875 0.0359237
+0.0583839 0.0607371 0.00317993
+0.0532979 0.0476993 0.0202039
+-0.00334167 0.13115 0.0113211
+-0.0451105 0.146112 0.00345863
+-0.0728436 0.0965116 -0.0147387
+-0.00290701 0.128667 -0.00250924
+-0.0175351 0.0472943 0.0498404
+-0.0710465 0.156278 0.000878407
+0.0130461 0.106823 -0.0191157
+-0.0241467 0.169732 -0.0193183
+0.0184844 0.092024 0.0477707
+-0.0849646 0.0925759 -0.00355765
+-0.0135115 0.0617879 0.0541775
+0.0358003 0.0371828 0.0161878
+-0.0563756 0.0338236 0.0220041
+-0.0344987 0.119335 0.0301753
+-0.0207895 0.0363821 -0.0186131
+0.0366896 0.0394563 0.0234361
+0.0454465 0.0903989 0.00417224
+-0.0686026 0.0339552 0.0087048
+-0.0248008 0.0797877 -0.0377608
+-0.0253831 0.0645504 -0.0324979
+-0.0924079 0.114699 0.0153245
+0.0404169 0.104204 0.0201615
+-0.0864551 0.137921 0.0433346
+0.0453383 0.0861836 0.0191712
+-0.0550359 0.12552 0.0379729
+0.0499773 0.0719552 0.0208312
+-0.0878453 0.10502 0.0133698
+0.0226563 0.0416586 -0.00875234
+0.00847112 0.0503629 0.0509458
+0.0193029 0.12103 0.032512
+-0.0288694 0.102979 -0.023086
+-0.0655006 0.155906 0.0116223
+-0.0865291 0.125714 0.0480303
+-0.0762092 0.103511 0.0356214
+0.027039 0.0433782 0.0352623
+-0.00878391 0.0340179 -0.0196776
+0.01688 0.104029 -0.0201606
+-0.0779922 0.155321 0.011561
+0.012978 0.0975651 -0.0232996
+-0.0570356 0.142438 0.0315884
+0.00678439 0.0392286 0.0320303
+-0.0187316 0.184448 -0.0230478
+-0.05583 0.0898375 -0.0220234
+-0.0624118 0.168239 -0.0611966
+-0.019552 0.0381879 0.0203532
+-0.0619388 0.0647772 0.0309092
+-0.0929984 0.129612 0.0152364
+0.0241882 0.0633761 -0.0240832
+-0.0154901 0.11097 -0.019533
+0.0335254 0.101204 -0.0131717
+0.0440036 0.0411539 0.00525252
+0.0443474 0.05051 -0.00579969
+-0.00564997 0.0526431 -0.0322774
+0.024909 0.124002 0.00889289
+-0.0551719 0.0344352 0.0357625
+-0.00149801 0.0828985 0.0574954
+-0.0649207 0.122383 -0.00889091
+-0.0371067 0.163706 -0.0138205
+-0.013511 0.0673225 0.0538556
+-0.0664425 0.121454 0.0513831
+-0.0749127 0.151363 0.0363064
+-0.0786131 0.166659 -0.0369473
+0.0259941 0.0889184 0.046498
+-0.0508607 0.133588 0.0291236
+-0.0624206 0.150641 -0.0155752
+-0.0345377 0.0353482 -0.0311793
+-0.0926334 0.130971 0.0152338
+0.00420379 0.0852404 -0.0337772
+0.0493319 0.0575419 -0.00502247
+0.0210858 0.0848756 0.0499424
+-0.0209282 0.0711316 0.0521839
+-0.0556334 0.121157 -0.00996616
+-0.0578782 0.0955404 -0.0210377
+-0.0636177 0.149382 -0.0259273
+-0.023437 0.0753613 0.0517266
+-0.0424368 0.033567 0.00359466
+-0.0366861 0.0651313 -0.0144389
+0.00275029 0.0392893 0.0311503
+-0.0858603 0.137915 0.0441653
+0.00249981 0.0938632 0.054785
+-0.0405815 0.125646 -0.00686289
+0.00652265 0.0633208 0.0557678
+-0.0736187 0.0665006 0.01992
+0.0178849 0.106917 -0.0172488
+-0.0404999 0.16823 0.00286674
+-0.0578818 0.101192 -0.0190391
+0.0415111 0.0596706 0.0303495
+0.0445386 0.0917351 0.000179816
+0.0404099 0.0926692 0.0304567
+-0.0715386 0.177351 -0.0469381
+-0.00955325 0.129382 0.0220461
+-0.0304508 0.11875 -0.0116176
+-0.0553453 0.138992 -0.00307013
+0.0373215 0.0444316 0.0300039
+-0.0439866 0.0342955 -0.0250034
+0.0438502 0.081834 0.0262681
+0.0105117 0.057471 0.0526043
+-0.0609073 0.0423237 0.0152297
+-0.0566933 0.0478983 -0.00338525
+-0.0882052 0.0955366 0.00643448
+-0.0697305 0.146842 -0.0262196
+-0.0654573 0.131176 0.0439868
+-0.0332792 0.168261 -0.00439757
+0.0262829 0.0520004 0.03955
+-0.0246803 0.0386712 -0.0158919
+-0.0243119 0.0382419 0.00485642
+-0.0650689 0.0416148 -0.00522845
+-0.0224969 0.105778 0.0423492
+-0.0675666 0.163787 -0.0559757
+-0.0625249 0.0642497 0.029495
+-0.066705 0.170483 -0.0379595
+-0.0387912 0.0855771 -0.0218281
+-0.0362227 0.121033 0.0288309
+-0.0351413 0.166693 -0.0148789
+0.0484731 0.0728694 0.00986875
+-0.0715958 0.035386 0.00909438
+-0.0654475 0.0414866 0.0340095
+-0.0897915 0.135018 0.00821888
+-0.0256856 0.161028 -0.00218154
+-0.0294591 0.0367076 -0.0187628
+-0.0318602 0.0341892 0.0214236
+-0.0741619 0.0781636 -0.0115723
+-0.0759684 0.138187 -0.00615578
+-0.0746432 0.067744 0.0203901
+-0.0481968 0.058714 0.0359259
+-0.0809888 0.100705 0.031995
+0.0223647 0.0795488 0.0499944
+-0.0164996 0.0587643 0.0515064
+-0.0843239 0.0775269 0.0169616
+-0.0474174 0.157905 0.00867917
+0.0256365 0.0450396 -0.0116814
+-0.0560862 0.153109 -0.0014946
+-0.0364777 0.0491722 0.0391199
+-0.0353775 0.172711 -0.013245
+0.0345426 0.0361041 0.0132537
+-0.0476575 0.0606291 -0.0121142
+0.0517359 0.0693876 0.00244776
+-0.0895642 0.139283 0.0271809
+-0.0554895 0.087587 0.0448409
+-0.00460242 0.0419996 -0.0255341
+-0.0747436 0.0846695 0.0389578
+-0.0522959 0.0518057 0.0276471
+0.0344259 0.0713949 0.0392126
+-0.0858246 0.111645 0.00429163
+7.90085e-05 0.131159 0.00541676
+-0.0876151 0.1105 0.015342
+-0.0308705 0.0385373 -0.0301935
+-0.0174841 0.088353 0.056296
+-0.0717036 0.179379 -0.0498901
+-0.0872579 0.113355 0.0275168
+-0.0132522 0.180136 -0.0286131
+0.0147067 0.111012 -0.0176211
+0.0100468 0.0698695 0.0549195
+-0.00549411 0.130838 0.0134037
+-0.0444864 0.070528 0.0418968
+-0.0694946 0.0902043 0.0422251
+-0.0125029 0.0673483 0.0540527
+-0.0889341 0.0928773 0.0104474
+-0.049902 0.0335302 0.00572664
+0.0224871 0.0436168 0.0410219
+-0.0391731 0.163682 -0.0125377
+-0.0389872 0.0336658 0.00601497
+0.0423783 0.0676875 -0.00279832
+-0.0314483 0.177007 -0.0139273
+0.0365023 0.0700019 0.0369139
+-0.0817843 0.113273 -0.0014411
+-0.0155011 0.0786732 0.0567092
+-0.0616004 0.115786 -0.012288
+0.0336937 0.0994802 0.0365924
+-0.0819199 0.0775142 -0.000486403
+-0.0620032 0.154899 0.00420466
+-0.0689571 0.134062 -0.00839151
+0.0341993 0.115326 0.00949444
+-0.0853268 0.127125 0.0496018
+-0.0075399 0.0430305 0.0487452
+-0.000964681 0.0992981 -0.0251507
+-0.0896495 0.146064 0.0111487
+0.0457169 0.0792126 0.021174
+-0.0677903 0.180834 -0.0585489
+-0.0525855 0.0528134 0.0122839
+0.045458 0.0847917 0.019171
+-0.0620511 0.164652 -0.0545872
+-0.0012817 0.0411143 0.047028
+-0.0620444 0.166711 -0.0606187
+0.0416044 0.0774454 -0.0068035
+-0.0180891 0.0568831 0.0497969
+0.0289502 0.0888845 0.043761
+-0.0361509 0.0471597 -0.0213258
+0.0209931 0.0505428 0.042434
+-0.081698 0.0939818 0.0329068
+-0.0701548 0.148741 -0.0366493
+-0.0726057 0.158224 -0.0359121
+0.0452801 0.0777562 0.00119407
+0.0034868 0.107186 0.0422902
+-0.0603898 0.116109 -0.0126519
+-0.0799294 0.154987 0.0226092
+-0.0412543 0.0342017 0.0283816
+-0.073067 0.0692219 0.0282366
+-0.0232836 0.0382816 -0.000419572
+-0.0843726 0.0952582 -0.00357113
+-0.0871856 0.0923586 0.0257303
+0.0415318 0.09261 0.0284783
+-0.0528539 0.1113 -0.0177773
+-0.0653767 0.0770838 0.0407622
+0.0608603 0.0609709 0.0131614
+0.0163938 0.128844 0.0100049
+-0.028759 0.0386585 -0.0166912
+-0.0688752 0.11651 -0.00852528
+-0.00266028 0.0525834 -0.0313625
+0.0395925 0.0979794 0.0293107
+-0.063517 0.0417383 0.0266777
+-0.0206145 0.038142 0.0147556
+-0.0746919 0.0745094 -0.0088781
+-0.0730235 0.16103 -0.0369405
+-0.0511023 0.141628 0.018382
+0.026686 0.0963684 -0.0200186
+0.00049039 0.0952019 0.0544773
+-0.0374215 0.0466159 -0.0218044
+-0.0396639 0.0592228 -0.0116772
+0.0589085 0.0593684 0.0217913
+-0.069935 0.128232 -0.00913858
+-0.0154583 0.128246 0.0199229
+-0.082956 0.0762572 0.0165263
+-0.0698527 0.139727 0.0465118
+-0.0793995 0.0962934 -0.0095136
+0.029447 0.119051 0.00204245
+-0.0406195 0.0505975 -0.0111291
+-0.0337259 0.125903 0.000119567
+-0.00361865 0.109419 -0.0218821
+-0.0324923 0.0845615 0.0419149
+-0.0304819 0.0903593 0.0440392
+-0.0289421 0.0848695 0.0456392
+-0.067993 0.172429 -0.0412978
+-0.0699656 0.167828 -0.0233999
+-0.0633908 0.0664235 0.0326881
+-0.0328103 0.178226 -0.00982944
+-0.0144938 0.0897854 0.0566872
+-0.00301248 0.0391855 -0.0120497
+-0.0467348 0.10982 -0.0182008
+-0.0347751 0.123588 -0.00668109
+-0.081672 0.0966878 0.0327979
+0.0208066 0.08618 0.0495337
+-0.0294922 0.102919 0.0420695
+-0.0514977 0.0917694 0.0441515
+-0.0561584 0.13394 0.0346041
+0.0587961 0.055231 0.00916964
+0.0239769 0.0672243 0.0451455
+-0.0590987 0.135299 0.0356206
+-0.0833215 0.153324 0.00972396
+-0.0775565 0.148654 -0.00488618
+0.0134356 0.129163 0.0217505
+0.00242681 0.0392303 -0.00913048
+-0.00111738 0.0369593 -0.0152505
+-0.0884159 0.102321 0.0103913
+0.0452046 0.0684536 0.0248447
+-0.0107692 0.1278 -0.0014358
+-0.067702 0.169446 -0.0560134
+-0.0645991 0.162478 -0.0199783
+-0.0384905 0.0591295 0.0404813
+-0.0133897 0.0383025 0.0215062
+-0.0335039 0.113859 0.0341437
+0.00725148 0.0739904 -0.0339985
+-0.0197912 0.0347004 -0.0276305
+-0.0364291 0.0383909 -0.00870817
+-0.0382525 0.154358 -0.00883541
+-0.0576615 0.0645392 -0.00788705
+0.0271486 0.0677873 -0.0226945
+-0.0484929 0.0776741 0.0437591
+-0.0538207 0.0913026 -0.0221948
+-0.0414756 0.102877 0.0407886
+-0.0194769 0.0384097 -0.0016118
+0.0409764 0.0725373 0.0310711
+-0.046711 0.0723683 -0.0164352
+-0.0169229 0.0385492 -0.0161043
+0.0274461 0.0888981 0.0450769
+0.0384486 0.0446185 0.0300797
+-0.0498739 0.120141 -0.01301
+-0.0147995 0.0382136 0.0194957
+-0.034222 0.0422724 0.0479221
+-0.00554376 0.0388664 -0.0141367
+-0.00771915 0.0642161 -0.0356843
+0.0380609 0.108343 0.0221716
+-0.0496329 0.05762 -0.010324
+-0.0640324 0.0336604 0.00811729
+0.0288939 0.0349903 0.0075309
+-0.0369254 0.170672 -0.0129456
+0.0567415 0.0605855 0.00115011
+-0.026353 0.0382316 0.0044532
+-0.088166 0.0963498 0.023753
+-0.0332851 0.0368458 -0.0306141
+-0.0138558 0.0387296 -0.0044727
+0.0597512 0.0650182 0.00715554
+-0.0267551 0.0740245 -0.0360482
+0.0214915 0.0369736 0.0352586
+-0.0515738 0.0559395 0.0296214
+0.00622241 0.123988 -0.00957575
+0.0558148 0.0493476 0.0171957
+-0.0766567 0.112144 0.0469767
+0.0408877 0.0928069 -0.00817715
+-0.0862272 0.0886081 0.000477626
+-0.0341682 0.0723955 -0.0204945
+0.0468003 0.0745424 0.0107517
+-0.00983206 0.0896484 -0.0366649
+-0.00782261 0.0985178 0.051315
+-0.070543 0.17193 -0.0350862
+0.0371254 0.0869172 -0.0157926
+-0.059432 0.152725 0.0327387
+-0.0644942 0.149793 0.0375095
+-0.02966 0.0875784 -0.0315907
+0.0234483 0.0350084 0.0101439
+-0.0672661 0.155709 0.00954294
+0.0249549 0.0915796 0.0467751
+-0.0750729 0.0675817 0.0186826
+-0.065557 0.158804 -0.0559152
+-0.0869809 0.112371 0.0426661
+-0.0388924 0.0336117 -0.0270987
+-0.0925871 0.117342 0.0103086
+-0.0285134 0.0559644 0.0364164
+-0.0592485 0.148248 0.0355123
+-0.0386245 0.0472623 -0.0172994
+0.0417415 0.0676611 -0.00475281
+0.017067 0.127696 0.00312982
+-0.00768714 0.116771 -0.0157299
+-0.0210692 0.0667823 0.0496379
+0.0306718 0.0605569 0.0407187
+-0.086202 0.0805924 0.0105044
+0.0248868 0.0727438 0.0465386
+-0.0226479 0.182963 -0.0190305
+-0.064868 0.0953298 -0.0181139
+-0.0212331 0.0553385 0.0459146
+-0.0900228 0.148451 0.0254546
+-0.0659345 0.109414 0.0377967
+-0.0156357 0.0466082 -0.0291798
+-0.0783295 0.108958 0.0384425
+-0.0353519 0.169773 -0.000327923
+-0.0576724 0.155657 0.012957
+0.0299243 0.0902598 0.0434097
+-0.0938789 0.125503 0.0152603
+0.00849738 0.0910108 0.0540495
+-0.0924729 0.117499 0.0403021
+-0.0538856 0.101336 -0.0209374
+0.0230068 0.125355 0.00960117
+-0.0753773 0.0887668 0.039456
+-0.0164714 0.0348128 0.0436847
+-0.0124833 0.108618 0.0427908
+0.00650022 0.0937602 0.0531051
+-0.0254901 0.101602 0.0435889
+-0.0681644 0.132655 0.0471068
+0.0116725 0.130674 0.0125466
+-0.0658455 0.0693268 0.0349111
+0.0131057 0.0346676 0.0247536
+0.0111453 0.0752893 0.0548169
+-0.0414315 0.120058 -0.0129928
+-0.0667828 0.0837809 -0.018353
+-0.0558768 0.105489 -0.0184971
+-0.0646849 0.0705888 -0.0125799
+0.00250861 0.0634123 0.0567384
+-0.0102337 0.0987343 -0.0266102
+-0.0475686 0.0376232 -0.0123457
+0.0326729 0.0388984 0.0249367
+-0.0754158 0.14997 -0.0218646
+0.0149498 0.0475024 0.0442108
+-0.0897923 0.144692 0.013139
+-0.065193 0.0597221 0.0116014
+-0.0777759 0.113375 -0.00398806
+-0.0457101 0.131722 0.0089192
+-0.0575663 0.0481384 0.0346641
+-0.0838122 0.128533 0.0508937
+-0.0104939 0.0933018 -0.0349679
+0.0252085 0.0464911 -0.0166174
+-0.0789879 0.13894 -0.00474105
+-0.0475728 0.0656919 0.0379498
+0.0110822 0.113195 -0.0179885
+-0.0649225 0.170267 -0.0430968
+-0.00871405 0.112847 -0.0195489
+0.0452857 0.0889846 0.0161633
+-0.0171038 0.128182 0.00771491
+-0.0114919 0.0911558 0.0564108
+-0.0672347 0.158081 -0.05503
+-0.0375789 0.0335576 -0.0249215
+-0.028354 0.0521667 -0.0233844
+-0.0687469 0.179151 -0.0517127
+-0.0635972 0.164728 -0.0295802
+-0.00849416 0.0661021 0.0557034
+0.0018938 0.131459 0.00752669
+-0.0104875 0.10724 0.0431922
+0.0420847 0.0764929 0.0291356
+-0.0164676 0.125926 0.0254562
+-0.0666931 0.162075 -0.0149837
+0.000392133 0.0405199 -0.0247969
+-0.062597 0.0740287 0.040345
+-0.038486 0.115285 0.0333239
+-0.0134767 0.0545379 0.0508338
+-0.0379773 0.128134 0.0117903
+0.0282176 0.0746072 -0.022898
+-0.00949856 0.0898059 0.0569552
+-0.0633588 0.166271 -0.0375898
+-0.088608 0.0874693 0.0094764
+-0.00658802 0.126776 -0.00645935
+0.00550371 0.0533623 0.0533002
+0.0568364 0.0723477 0.016027
+-0.0746813 0.077485 -0.0103851
+0.0599778 0.0622697 0.0191849
+-0.0834343 0.143353 0.0415913
+0.0461466 0.0773319 0.0190905
+-0.0643928 0.0366139 0.0414145
+0.017105 0.0913787 0.0494605
+0.0113838 0.0463423 -0.025328
+0.00150906 0.0925101 0.0553138
+-0.0905552 0.131061 0.0372264
+0.0271939 0.0479684 -0.0167032
+0.0118641 0.130407 0.00833975
+-0.0534963 0.0413918 0.0463882
+-0.00348783 0.0548509 0.0542207
+-0.0241218 0.165279 -0.0170232
+0.0526044 0.0736805 0.0129696
+0.00493694 0.0358587 0.023833
+-0.0308996 0.0862326 -0.0295626
+-0.0749566 0.152744 -0.0158977
+0.022407 0.0700249 0.0481925
+-0.0644326 0.152123 0.0354487
+-0.083145 0.0762813 0.00952219
+-0.0066641 0.130277 0.00578337
+-0.0503124 0.0487527 0.0166746
+-0.0857975 0.0926505 0.000473688
+0.0319954 0.0554568 -0.0137989
+-0.0325248 0.0371997 0.032926
+-0.0378236 0.0914714 -0.0236656
+0.0107752 0.0603237 0.0523688
+-0.0709378 0.0995366 0.0403447
+0.00229927 0.0641027 -0.0339638
+0.0301658 0.0510827 -0.0137422
+-0.0152122 0.0387061 -0.0065833
+0.0328168 0.0373031 0.0209449
+-0.0564976 0.0959787 0.0438593
+-0.0530296 0.137293 -0.00118635
+-0.0114929 0.0745162 0.0566704
+0.0339687 0.0768049 0.0403387
+0.0229251 0.0476731 0.039919
+0.0153286 0.0594649 -0.0285327
+-0.0650165 0.0356472 0.0166692
+-0.0872319 0.104968 0.0093836
+0.0317565 0.0752189 -0.019756
+0.0174897 0.107108 0.0415537
+0.00650555 0.0716952 0.056225
+0.0214733 0.0808843 0.0504673
+-0.0157973 0.0382489 0.019257
+-0.073889 0.119392 -0.00790358
+-0.0588895 0.0969269 -0.0201624
+-0.0614701 0.166956 -0.0604533
+-0.0411287 0.160673 -0.0112161
+-0.0558134 0.0883826 -0.0218608
+-0.0206962 0.0385843 -0.00942784
+0.0401892 0.0759203 -0.00879733
+0.0191194 0.0349494 -0.00374623
+-0.0414976 0.113906 0.0346806
+-0.00581815 0.0854694 -0.0375201
+-0.0859756 0.0805547 0.00750576
+-0.0833395 0.103378 -0.00262342
+-0.0446335 0.126046 -0.00723965
+0.0260088 0.0910229 -0.0223512
+0.034944 0.10998 0.0278542
+-0.00248857 0.0703789 0.0573235
+-0.0102702 0.0385128 0.00564525
+-0.0283572 0.0578046 -0.0244014
+-0.0210295 0.0958616 0.0473023
+-0.0141375 0.0347096 0.0460356
+-0.0244241 0.178665 -0.0108375
+0.00749812 0.109597 0.0408218
+-0.0356643 0.0606925 -0.0124069
+-0.0638002 0.166551 -0.0354938
+-0.0862312 0.0940245 0.00140199
+-0.0365789 0.0337187 0.00826156
+0.0240933 0.0685753 0.045325
+-0.0891661 0.132396 0.0419315
+-0.0177346 0.065722 -0.0374816
+-0.0224613 0.12203 0.0284859
+-0.0509119 0.055753 0.0316394
+-0.0340805 0.0680941 -0.0175876
+-0.0166639 0.0364717 -0.017882
+0.0347021 0.0768104 0.0396564
+0.0213412 0.0565052 -0.0267347
+-0.0707159 0.179287 -0.0569572
+-0.0748092 0.0790936 0.0363823
+-0.0577944 0.0460393 0.0120187
+-0.0302932 0.123607 -0.00301843
+0.00749105 0.050377 0.0513506
+-0.0641553 0.162388 -0.0586672
+-0.0197076 0.059653 0.0484949
+0.0376477 0.110588 0.00928033
+-0.0151896 0.0391404 0.0514631
+0.020848 0.0400652 -0.0117024
+-0.0208303 0.119929 -0.0109428
+0.0157129 0.124796 -0.00448994
+-0.00658665 0.0388228 -0.0143041
+0.0254417 0.121647 0.000551492
+0.0535789 0.0658041 0.000119664
+0.0473148 0.0518659 -0.00495567
+0.0299175 0.0524736 -0.0157475
+-0.0183959 0.112492 -0.0191613
+-0.0893828 0.0916068 0.0204288
+-0.0614858 0.175719 -0.0606762
+-0.0901396 0.13244 0.0372222
+-0.0238257 0.0881589 -0.0366228
+-0.0218791 0.0383442 -0.00388387
+0.00124143 0.0390154 -0.00356473
+-0.0669805 0.1589 -0.00929727
+0.0483233 0.0547304 -0.00526262
+-0.0444857 0.0661533 0.0401374
+-0.0514919 0.076238 0.0430598
+-0.0301912 0.0664057 -0.0274649
+-0.0408343 0.0942887 -0.0229156
+-0.00749956 0.121159 -0.0124082
+-0.061476 0.158429 -0.028587
+-0.0675029 0.109729 0.0377486
+-0.0697083 0.1638 -0.0499695
+-0.062151 0.152195 -0.0205783
+0.0342924 0.0619556 0.0389482
\ No newline at end of file
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny_ran.pts b/Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny_ran.pts
new file mode 100644
index 000000000000..91de67a41378
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/bunny_ran.pts
@@ -0,0 +1,35948 @@
+150
+-0.0164722 0.0382453 0.0209318
+-0.0641407 0.171114 -0.0471776
+0.023086 0.119339 0.0317977
+0.00506037 0.0347021 0.0393176
+-0.066143 0.143958 0.0413147
+-0.0445017 0.163753 0.00542301
+-0.0689729 0.181022 -0.0546459
+-0.0931085 0.131006 0.0192314
+0.000506827 0.0489752 0.0512269
+-0.0615935 0.160001 -0.0315914
+-0.0245032 0.0960169 0.0442753
+-0.0258992 0.0891655 0.049535
+-0.000499367 0.0456802 0.0470389
+-0.0171808 0.0654583 0.0528522
+0.00116916 0.131228 0.00582139
+-0.0356565 0.122935 -0.00798984
+-0.0701892 0.156285 0.021569
+-0.0173569 0.038443 0.0259817
+-0.0716413 0.0763478 -0.0132577
+0.0528545 0.0568172 0.0288563
+-0.0325067 0.0732308 0.0407775
+-0.0760686 0.150008 -0.00987485
+-0.030561 0.0774145 0.0410957
+-0.0833901 0.0762729 0.00451303
+-0.000492618 0.0925258 0.0556594
+-0.0358778 0.159506 0.00240863
+0.0115111 0.114076 0.0384616
+-0.0877889 0.0887187 0.00347532
+-0.0261028 0.115949 -0.0147279
+-0.0682913 0.165205 -0.0539869
+-0.0225512 0.0933694 -0.0331106
+-0.0538783 0.0999149 -0.0214389
+0.0435587 0.0959151 0.0211557
+-0.0167991 0.0388632 -0.0107644
+-0.0569142 0.0548839 0.00364185
+0.00749229 0.091015 0.0542708
+-0.065316 0.0625169 -0.002419
+-0.00749647 0.119689 0.0375376
+-0.0772165 0.0934484 -0.0125951
+-0.029008 0.0478606 -0.0250513
+0.00934189 0.0553527 -0.0303034
+-0.0578677 0.104042 -0.0186102
+0.0405495 0.0999198 -0.00379356
+-0.0894314 0.137929 0.0371779
+0.00710731 0.126603 -0.00643182
+0.058913 0.070492 0.0108657
+-0.0922485 0.120133 0.0292903
+0.0395325 0.105566 0.0221621
+-0.0376065 0.0365426 0.0444186
+-0.0550158 0.128128 -0.00563226
+-0.0561672 0.0336533 0.0186553
+0.0123436 0.0351165 0.0296251
+-0.0899184 0.131005 0.0413145
+0.0065365 0.100373 0.0469448
+-0.0502879 0.133796 0.0278403
+-0.0716838 0.0351362 0.00880221
+0.0579126 0.0523842 0.0101848
+-0.0639212 0.154791 0.00385831
+-0.0654795 0.0384216 -0.00684663
+-0.0615513 0.0624603 0.0259481
+-0.0368013 0.0842007 -0.0223672
+0.0522757 0.0574291 -0.0035048
+-0.0764972 0.123179 0.0527664
+0.0302998 0.0694384 -0.019812
+-0.0334269 0.0486094 0.0413091
+-0.00450651 0.0689184 0.0565193
+0.0425976 0.0887597 -0.00680771
+-0.0707351 0.156208 0.0228366
+0.0548799 0.0492406 0.0202107
+-0.00962948 0.168316 -0.023669
+-0.0313363 0.11605 -0.0148117
+-0.0225249 0.125571 0.0012278
+0.0122871 0.124953 0.0313975
+-0.0343047 0.125361 0.0205265
+-0.038499 0.0747376 0.0420783
+0.0292349 0.0759579 -0.0220376
+-0.0255784 0.0477093 -0.0263526
+-0.0750958 0.151313 -0.0258791
+0.0057743 0.0347896 0.0375885
+-0.0926124 0.120126 0.0272917
+-0.0366664 0.175138 -0.00407486
+-0.00549337 0.088417 0.0570387
+-0.0711473 0.17507 -0.0540267
+-0.0776118 0.0739521 0.0284675
+0.0376746 0.104662 0.0282621
+-0.0634881 0.121359 0.0469409
+0.0233296 0.0564006 -0.0254415
+-0.0399361 0.123254 0.0259269
+-0.000577398 0.0341134 -0.0181551
+-0.000496894 0.0520342 0.0541515
+-0.0701023 0.177167 -0.0478719
+-0.0641167 0.143926 0.0389732
+-0.0679369 0.165269 -0.0197719
+-0.0681029 0.138305 0.0455026
+-0.00280426 0.0384802 0.0198949
+-0.0628273 0.0924874 -0.0189476
+0.0084946 0.0869435 0.0558386
+0.00910286 0.0348066 0.0183719
+-0.0195983 0.126231 0.0213862
+-0.0584949 0.143878 0.0330085
+-0.0218343 0.0553077 0.0451067
+-0.0645685 0.147457 -0.0230581
+0.0426227 0.0691122 -0.00279622
+-0.035813 0.0842739 -0.0225525
+-0.0819685 0.0791215 0.0284136
+0.0328852 0.113087 -0.00384394
+-0.0677123 0.168615 -0.0283035
+-0.0556635 0.140996 0.0299986
+-0.0764958 0.131682 0.0526442
+0.0421796 0.0832522 0.0293553
+-0.0848653 0.0855483 0.0264341
+-0.0329445 0.121338 0.0269922
+-0.0320197 0.058187 -0.0133973
+-0.0322785 0.0421631 -0.0296986
+0.0401757 0.067497 -0.00878165
+-0.0904989 0.148452 0.0245146
+-0.00947974 0.0561444 0.0530127
+-0.0310333 0.0383692 -0.000250742
+-0.0780713 0.150403 0.0367551
+-0.0872126 0.146051 0.00824907
+-0.0735722 0.148626 -0.0268487
+-0.00548676 0.116904 0.0394711
+-0.0599006 0.132533 0.037981
+-0.093479 0.129659 0.0212406
+-0.0639063 0.120904 -0.00875525
+-0.028606 0.0356961 0.0524615
+-0.0652024 0.153998 -0.041972
+-0.0262134 0.0765572 0.0473962
+-0.0774721 0.155387 0.0234212
+-0.0628707 0.0345025 0.0358026
+0.0434964 0.0555926 0.0322399
+-0.0618022 0.142496 0.0370478
+-0.0638273 0.0910291 -0.0188305
+-0.0636286 0.0672101 0.0337087
+-0.0842132 0.092522 0.0298256
+0.0185123 0.115397 0.0365584
+-0.0666269 0.131204 0.0458398
+-0.0653475 0.165775 -0.0260007
+-0.0182573 0.181629 -0.0177335
+-0.0142757 0.185348 -0.0257883
+0.0485082 0.0624718 0.0300814
+-0.0254927 0.0974122 0.0441083
+-0.0446561 0.0349999 0.0427486
+-0.0616719 0.0410515 0.0160296
+-0.0179307 0.0931593 -0.0348763
+-0.00828798 0.130102 0.00662088
+-0.0525878 0.149334 0.020403
+-0.0102534 0.128943 0.0232512
+0.0445378 0.0959706 0.0101622
+-0.0465291 0.0335268 -0.00814027
+0.00437534 0.131145 0.0198749
+-0.0394369 0.03436 0.0321562
+-0.0107155 0.127812 0.0260097
+-0.0273383 0.17123 -0.0098418
+-0.0037118 0.0655569 -0.0347446
+-0.0630689 0.150547 -0.0265942
+-0.0776846 0.16386 -0.0329461
+-0.0728796 0.151218 -0.0388899
+0.038172 0.0967289 0.0325586
+-0.058907 0.0983413 -0.0195805
+-0.00549542 0.0965711 0.0536823
+0.00650609 0.0503877 0.0517539
+-0.0847722 0.113367 0.0459387
+0.0309512 0.0822193 0.0430727
+-0.0159859 0.0984773 0.0464357
+0.0361586 0.0781359 0.0382445
+0.0417308 0.0422749 0.000248643
+-0.0631435 0.175042 -0.061564
+-0.0251041 0.0945178 -0.0276305
+0.018776 0.122594 -0.0061273
+0.0173125 0.0726566 0.0514253
+-0.0377229 0.0724783 -0.0174913
+0.0173872 0.0432828 -0.0228623
+0.0416262 0.0912615 0.0286616
+-0.050567 0.0474222 -0.00850865
+-0.0150865 0.162585 -0.00969001
+0.0143357 0.0566765 -0.0290221
+-0.0309078 0.065095 -0.0224325
+0.045522 0.0805737 0.00219452
+-0.0725374 0.138625 0.0483183
+-0.0476365 0.150675 0.00992423
+-0.0799103 0.125126 -0.00560703
+-0.051025 0.159915 -0.00453945
+0.00139766 0.0419298 -0.0244976
+-0.0664219 0.0352675 0.015055
+-0.00832508 0.130422 0.0138058
+-0.00366678 0.0481589 -0.0301707
+-0.0738566 0.161044 -0.0339379
+0.0319703 0.0475137 0.0318758
+0.0188215 0.126955 0.00377584
+-0.0309617 0.044825 -0.0281993
+0.0456484 0.0875951 0.00518134
+-0.0521074 0.0583062 0.0285239
+-0.0171825 0.0382402 0.011747
+-0.0692976 0.0615474 0.00912978
+-0.0232044 0.175652 -0.0207635
+-0.0406662 0.0592305 -0.0118049
+0.0572429 0.0508905 0.0121849
+-0.0488285 0.0416917 0.0446681
+0.0455301 0.0677752 0.0254231
+-0.0846369 0.110251 0.00429821
+-0.0754652 0.163196 -0.0162299
+-0.0247271 0.0564997 0.0408849
+-0.0639975 0.0601011 0.00610183
+-0.0741599 0.155538 0.00126713
+-0.0728899 0.122329 -0.00823917
+0.010861 0.0360066 0.0447493
+0.0150176 0.0355797 0.04239
+-0.0437155 0.0710509 -0.0175901
+0.0271589 0.093209 -0.0206672
+-0.00592646 0.12418 0.0336126
+-0.0810295 0.0895599 -0.00769505
+-0.0920663 0.121362 0.00826874
+-0.0862277 0.0832671 0.00749085
+-0.085371 0.127983 -0.0026626
+-0.081815 0.108922 0.02836
+-0.0491537 0.135503 0.0034228
+0.00885847 0.0887054 -0.0320419
+-0.0673146 0.0446682 0.00602001
+0.0152697 0.128852 0.0195703
+0.0231834 0.0422122 0.040252
+-0.0286261 0.0463451 -0.0269667
+0.0449154 0.0763231 0.00019353
+-0.0387296 0.0739178 -0.0177449
+0.0212191 0.0819428 -0.0266321
+-0.00126307 0.039726 0.0470556
+-0.0261021 0.0379463 0.0228342
+-0.0448562 0.101383 -0.0214692
+-0.0014827 0.0390261 -0.00225591
+-0.0648948 0.103911 -0.0165942
+-0.0624902 0.155293 -0.0145941
+0.000436968 0.130385 0.0227651
+-0.0219738 0.059501 0.0451263
+-0.0502789 0.129408 -0.00267456
+-0.0216757 0.065257 0.0474751
+-0.0621482 0.16155 -0.0395978
+0.0427418 0.0916392 0.0261768
+0.00967962 0.127274 0.0289934
+-0.0728707 0.168003 -0.0450202
+-0.0305611 0.179398 -0.00755573
+0.0341402 0.0902832 0.0407178
+-0.0491119 0.0361611 0.0459929
+0.0392087 0.0739776 0.0338431
+-0.0897017 0.151503 0.0171224
+0.0407967 0.105643 0.0101649
+-0.023633 0.0478399 -0.0272396
+-0.0504958 0.0862332 0.0455716
+-0.0451092 0.153606 0.00834539
+-0.0616087 0.146812 0.0373554
+0.0280342 0.0346822 0.009507
+0.0565861 0.0685555 0.00335277
+-0.027568 0.0674298 0.0392602
+-0.0926576 0.117463 0.0373027
+-0.0334278 0.124984 0.0208436
+-0.0602518 0.034678 0.0430709
+-0.0574989 0.107052 0.0398301
+-0.091226 0.128161 0.00727002
+0.0400022 0.0913669 0.0315547
+-0.0656743 0.138242 0.0419702
+-0.0852141 0.0805923 0.0204766
+-0.0444957 0.111173 0.0370595
+-0.044489 0.0803636 0.042222
+-0.00648998 0.122405 0.0354776
+0.00602348 0.111527 -0.0200414
+-0.0860119 0.132159 0.00027761
+0.0521231 0.0734583 0.0172399
+-0.0155403 0.0446621 0.0510487
+-0.0397503 0.0768521 -0.0186787
+-0.0682155 0.0787029 0.0404793
+-0.0813927 0.0758934 0.0225084
+-0.010188 0.0386565 4.14997e-05
+-0.00149609 0.0912323 -0.0347548
+-0.0294974 0.111128 0.0367729
+-0.0503924 0.0501648 0.0186468
+-0.0104698 0.070299 0.0557764
+0.0327323 0.0809002 0.0421262
+-0.0328911 0.122131 -0.00712262
+-0.0861948 0.1005 0.0258994
+-0.0319282 0.178722 -0.00808101
+-0.050675 0.140101 0.0024044
+-0.0346788 0.0636729 -0.0139354
+-0.00820144 0.0344928 -0.0181278
+-0.0830162 0.0939316 0.0314035
+0.0438286 0.0611702 -0.00330591
+-0.0162799 0.127645 0.0211086
+-0.0615233 0.0354132 0.043881
+-0.0755937 0.0809959 -0.0116148
+-0.0632393 0.166259 -0.0385929
+-0.0156738 0.0511142 -0.0317767
+0.000751147 0.0339678 -0.0215355
+-0.0534027 0.0336932 0.022744
+0.0102837 0.0348658 -0.0091814
+-0.0285082 0.0874866 -0.0336017
+-0.0849712 0.111906 0.0292041
+-0.0732162 0.169408 -0.0460252
+-0.00746424 0.110009 0.0430329
+-0.0587154 0.0723411 -0.016523
+-0.00333145 0.0968513 -0.0305901
+0.0385608 0.0713011 0.0346329
+-0.0463734 0.133247 0.0130756
+-0.0474986 0.104275 0.0408376
+-0.0714849 0.147284 -0.0260827
+-0.0404433 0.0461446 -0.0193164
+0.000709469 0.125628 -0.00726116
+0.028516 0.117882 -0.00302906
+-0.00249354 0.0746702 0.0587588
+0.0463101 0.0806468 0.00818141
+-0.0245515 0.114015 0.0358596
+-0.0396488 0.0563195 -0.0111963
+-0.0236961 0.0607746 0.0425604
+-0.0336359 0.0548461 -0.0105101
+-0.0585033 0.0337545 0.0163089
+0.0212208 0.126407 0.0160623
+-0.0729862 0.15207 0.0354642
+-0.085378 0.128494 0.0496125
+0.00429457 0.122356 -0.0118056
+0.0203517 0.0672611 0.0487139
+-0.0452845 0.0395903 -0.0182935
+-0.0211124 0.182965 -0.0210132
+-0.0295465 0.0819132 0.0441437
+-0.0777488 0.07493 0.029356
+0.00824435 0.0966482 -0.0263491
+-0.0588066 0.0854157 -0.0208208
+-0.0718999 0.113582 -0.00821597
+-0.0893735 0.0901981 0.0104595
+0.032603 0.0835706 0.0419526
+-0.0230608 0.0594124 0.0433799
+0.0284544 0.121423 0.0116324
+-0.0832785 0.12444 0.0504652
+-0.0396241 0.0520021 -0.0108773
+0.00721225 0.0837864 -0.0330068
+-0.046713 0.131987 0.00556897
+-0.0663702 0.157999 -0.00906779
+-0.067736 0.0779793 -0.0166569
+-0.0508692 0.102779 -0.0209206
+-0.0828958 0.151378 0.00422572
+-0.0346622 0.118788 -0.0116368
+-0.0726425 0.0716156 -0.00744076
+-0.059725 0.0469427 0.0326718
+-0.0468444 0.033579 -0.0045851
+-0.0384976 0.100064 0.0415702
+-0.050989 0.121022 -0.0119137
+-0.0624226 0.152205 -0.0125757
+-0.085741 0.151793 0.0266482
+-0.0826468 0.144713 0.0407672
+-0.0685649 0.0705046 -0.00966184
+-0.0734033 0.167233 -0.0217479
+-0.0455099 0.155064 0.0077969
+0.022652 0.0862116 0.0486888
+0.043364 0.0547822 -0.00644446
+-0.054457 0.14621 0.0274041
+-0.0639777 0.155958 0.0237716
+-0.0882347 0.0861347 0.011472
+0.00545294 0.1216 -0.0129959
+-0.0334673 0.174268 -0.00177832
+-0.00402179 0.129762 0.0240423
+-0.0185051 0.0711438 0.0540217
+-0.0872329 0.150111 0.00920897
+-0.090033 0.147105 0.0269347
+-0.0141936 0.0419832 0.0511586
+-0.0335873 0.154463 -0.00838872
+0.0441357 0.083266 -0.000805736
+-0.0528842 0.102762 -0.0205636
+-0.0125091 0.0815143 0.0575917
+0.0197435 0.125962 0.0226458
+-0.067993 0.0619274 0.01978
+-0.0216083 0.039391 -0.0287125
+-0.0767116 0.165247 -0.022942
+-0.0861936 0.111308 0.0401352
+-0.0238165 0.0854111 -0.0376407
+-0.0442161 0.123225 0.0243959
+-0.0175443 0.0460366 0.0510389
+-0.0272334 0.0902723 -0.0326005
+-0.0459359 0.168402 -0.00594095
+0.0355423 0.0512597 0.0315836
+0.0451079 0.0636949 -0.00183531
+-0.0368834 0.125578 -0.00482073
+0.0196258 0.0457587 -0.0217227
+-0.00773224 0.109619 -0.0221011
+-0.0514957 0.0876341 0.0455102
+-0.00269376 0.0613003 -0.0344696
+-0.0512049 0.147808 0.0143958
+0.0266901 0.106496 -0.0148024
+0.0383861 0.0476151 -0.00591592
+-0.0136895 0.0952904 -0.0330103
+0.0368491 0.0767795 0.0374896
+-0.029592 0.0522946 -0.0203629
+0.0482309 0.0500295 -0.00369862
+0.0381363 0.0794306 0.0358549
+-0.0677271 0.155796 -0.00229118
+0.026043 0.0392404 0.0305576
+0.0208388 0.126564 0.0173475
+0.0159735 0.0448127 0.0438765
+-0.0681757 0.118633 0.0523539
+-0.065068 0.136793 0.0410949
+-0.0454458 0.168254 0.00168996
+-0.0715222 0.142818 0.0455702
+-0.0604912 0.112522 0.03629
+-0.00074702 0.0712329 -0.0350931
+-0.0894331 0.150114 0.0121902
+-0.0185746 0.0381525 0.0151621
+0.0291213 0.0348096 0.00960912
+0.0404448 0.0985503 0.0271661
+0.0134712 0.0936014 0.0511282
+-0.021496 0.103017 0.0435858
+0.00918856 0.0342345 -0.00132638
+-0.0508332 0.0956285 -0.0221275
+-0.0613646 0.0394268 0.0439671
+0.0264379 0.0968548 0.0436578
+-0.0646669 0.0405364 0.0387423
+0.0125029 0.0475354 0.045933
+0.0412949 0.104257 0.00416372
+-0.00222052 0.117102 -0.0161156
+-0.00995662 0.169734 -0.0198047
+0.0200755 0.0399795 -0.0157069
+-0.0839165 0.110514 0.0395089
+-0.0546435 0.116042 -0.0146857
+0.0268767 0.0854059 -0.022529
+-0.0543926 0.0337363 0.0224962
+-0.049781 0.0841032 -0.0216622
+0.0431463 0.100109 0.00616795
+0.0393814 0.0780345 0.0341058
+-0.0162612 0.17862 -0.0260128
+-0.0335093 0.0676035 0.0406399
+-0.0176483 0.0352702 -0.0188352
+-0.031463 0.0519033 0.0373773
+-0.0803572 0.0803552 0.0319871
+-0.0320868 0.159267 -0.0129293
+0.0132853 0.0589897 0.0507165
+-0.0103631 0.180289 -0.0277342
+-0.0144925 0.0559441 0.0511232
+-0.0246444 0.0381166 0.0247786
+0.0170669 0.0871276 -0.028336
+0.00372554 0.105196 -0.0213905
+-0.0777857 0.156925 -0.0179137
+0.0578227 0.0710073 0.0178627
+-0.0582482 0.0336534 0.0128901
+-0.0520861 0.0545712 0.0266312
+0.0269849 0.113053 -0.00983991
+0.0429421 0.0467386 0.030224
+0.00548112 0.11414 0.0405028
+0.0607975 0.0637336 0.0101416
+-0.0895137 0.135181 0.0391853
+-0.0822803 0.139383 0.0462108
+0.00350363 0.0883757 0.0563643
+-0.0599112 0.109712 -0.0163845
+-0.0699244 0.107994 -0.0118147
+-0.073438 0.145781 -0.0138542
+-0.0702694 0.156361 0.0186365
+0.0365208 0.0713424 0.036933
+-0.0764811 0.141399 0.0471717
+-0.0338378 0.0943788 -0.02372
+-0.0185768 0.055451 0.0489119
+-0.0294962 0.107041 0.0398129
+0.0351663 0.0783387 -0.0157415
+-0.0823976 0.095314 0.0321564
+0.0458052 0.08902 0.00916777
+0.00466954 0.0341296 0.0180802
+0.012258 0.0751733 -0.0308354
+-0.0176564 0.0480544 -0.0295902
+-0.0487658 0.0811872 -0.020682
+-0.0375125 0.045091 0.0407522
+0.00960807 0.0375632 0.0322947
+0.0522688 0.0462249 0.00921199
+-0.0452834 0.0395877 -0.019291
+-0.0396931 0.126183 0.0200311
+-0.0903381 0.144712 0.0141544
+-0.0430213 0.0450576 -0.0153284
+-0.0539191 0.129665 -0.00510771
+-0.0384876 0.108386 0.0375357
+-0.0496388 0.0605583 -0.0113235
+-0.034501 0.115223 0.0328885
+-0.0540284 0.131061 -0.00500164
+-0.0147028 0.0389017 0.0333119
+-0.0207376 0.0641563 -0.0358205
+0.00590682 0.131658 0.0132863
+-0.0819436 0.154696 0.0145801
+0.0526661 0.0660937 -0.000184776
+-0.0526201 0.14007 0.0244025
+-0.0752504 0.177839 -0.0529463
+-0.0574955 0.0946379 0.0447737
+0.0456129 0.0904097 0.00518194
+-0.0282629 0.122524 0.022734
+-0.0680338 0.142566 0.0438693
+-0.0643033 0.0426016 0.0312522
+-0.0314971 0.102929 0.041974
+-0.00589664 0.0980966 0.0519993
+-0.0542782 0.132533 0.0338047
+-0.0911122 0.11473 0.0343167
+-0.0493972 0.140141 0.00739907
+-0.0577664 0.0485104 0.00767417
+-0.0629684 0.139576 0.0370615
+-0.0122087 0.128137 0.0240139
+0.00116984 0.129366 -0.00128907
+-0.039496 0.0634667 0.0415276
+-0.0427066 0.0696149 -0.0170299
+-0.0721201 0.149786 -0.0402916
+-0.0637423 0.168365 -0.0426884
+-0.0228169 0.0383283 0.0285633
+-0.0894925 0.143336 0.0131803
+-0.0408822 0.128708 0.0107294
+-0.043783 0.147719 0.00491206
+0.00912223 0.0833108 0.0554277
+-0.0543042 0.0335497 0.00301212
+-0.0544171 0.0333785 -0.00775516
+0.0295237 0.0727272 0.042682
+-0.0504982 0.112495 0.0358796
+-0.0240218 0.119915 -0.0108978
+-0.0535232 0.0556038 0.0117195
+-0.0480175 0.133707 0.00490199
+0.00583381 0.129313 0.0261699
+-0.0405566 0.149165 -0.00293165
+-0.0286765 0.0690744 -0.0314836
+0.0453693 0.0693828 0.00245115
+0.0581659 0.056561 0.00517446
+0.0192888 0.0651078 -0.0282476
+-0.0228892 0.0739252 0.0512281
+-0.0217183 0.113234 -0.017904
+0.0365187 0.0526805 0.0315096
+0.0490482 0.0539975 0.0303486
+0.0175085 0.114012 0.0373101
+-0.0328107 0.126843 0.0122027
+-0.0687814 0.0336983 0.00353162
+0.0220892 0.0906332 -0.0239505
+-0.0460528 0.122513 0.026245
+0.0381409 0.109688 0.00657231
+0.0368421 0.0742334 -0.0127504
+-0.0657975 0.0340784 0.0127357
+-0.0706216 0.146831 -0.0255714
+-0.0468292 0.091298 -0.0217206
+-0.0914681 0.144718 0.0171554
+-0.0624908 0.0343254 0.0238098
+0.0543739 0.0477987 0.0161989
+-0.0195403 0.1757 -0.0161256
+0.0224671 0.0343921 0.00678503
+-0.0654707 0.155271 0.00728456
+-0.0897135 0.12265 0.00431103
+-0.0501651 0.0361307 0.0461721
+-0.0901888 0.139114 0.0151891
+-0.0726107 0.156829 -0.0349095
+-0.0334964 0.0718545 0.0411869
+0.0106165 0.0644536 0.0539383
+0.0274263 0.0491525 0.0376576
+-0.0157908 0.169796 -0.0160148
+-0.0608326 0.17151 -0.0610901
+0.0136156 0.126814 -0.00267762
+0.0293325 0.0535401 0.0386956
+-0.0652579 0.153012 -0.0402459
+0.0264019 0.036087 0.0225582
+0.0101281 0.105858 -0.0202342
+-0.0674046 0.0833115 0.0429955
+-0.0312435 0.0538841 -0.0143722
+0.0424267 0.0441756 -0.00158684
+-0.0305089 0.0760274 0.0408429
+-0.0849899 0.127963 -0.0030064
+-0.0223249 0.0386602 -0.0135496
+0.0216012 0.112963 -0.0137495
+-0.0224297 0.0552774 0.0442986
+-0.093152 0.121537 0.0362834
+-0.0384463 0.166779 0.00239389
+0.0317419 0.0667553 -0.0187125
+-0.0127135 0.100022 -0.0239701
+0.0204112 0.0371925 -0.00568428
+0.0383001 0.0969495 -0.00880451
+-0.0500528 0.150184 -0.0037815
+-0.0578783 0.106898 -0.0179862
+0.0485378 0.0682762 0.00156381
+-0.0708965 0.0341323 0.00629169
+-0.0871174 0.110466 0.0103621
+-0.0235739 0.0944939 0.0470656
+-0.0164815 0.0515035 0.0485835
+0.0325428 0.0380502 1.57112e-05
+0.0385774 0.0888011 0.0348199
+-0.0628692 0.0445185 0.0382675
+-0.0572856 0.125533 0.0399888
+-0.0780066 0.0940671 0.0362827
+-0.0361012 0.160724 -0.0132118
+0.0200495 0.124902 -0.000599563
+0.0101263 0.107276 -0.0197522
+0.0224877 0.0961643 0.0466342
+-0.077715 0.0852782 -0.0115916
+-0.0164955 0.105778 0.0423459
+-0.0725318 0.101313 0.038599
+-0.0663565 0.0783826 0.0411592
+-0.0644378 0.17995 -0.0588828
+-0.0645973 0.171184 -0.0458828
+0.0111199 0.129735 0.0223368
+-0.018333 0.172741 -0.0161594
+-0.0864925 0.10492 0.00639597
+-0.0144943 0.0500942 0.0487331
+-0.0855601 0.095177 0.0282718
+1.67787e-05 0.0386604 0.0239291
+0.0109499 0.0344084 0.00259617
+-0.0270041 0.168274 -0.00938266
+-0.0378811 0.107099 -0.0200653
+0.060304 0.0664655 0.0101406
+-0.0478845 0.108472 -0.0188663
+0.0181085 0.0591163 0.0489014
+-0.0260899 0.0522789 0.0395517
+0.0049437 0.0984176 -0.0242128
+-0.0623314 0.0357831 0.0433788
+0.0110403 0.0725847 0.0546235
+-0.0864956 0.084691 0.0204775
+-0.00849993 0.0787667 0.0579153
+-0.0260008 0.0382709 0.000860974
+-0.06937 0.145758 -0.0234859
+-0.0314168 0.117929 -0.0127586
+-0.0261669 0.0378674 0.0174813
+-0.0832309 0.120353 0.049216
+-0.0617814 0.16156 -0.0355923
+-0.0779669 0.165862 -0.0278956
+-0.0698398 0.0922797 -0.0162924
+0.0483255 0.0503286 -0.00380134
+0.0451716 0.0889782 0.0181643
+0.0329815 0.112282 -0.00498623
+0.0279206 0.0916217 -0.0209795
+0.0155 0.11402 0.0377783
+-0.0105379 0.0431327 0.0497176
+0.0606167 0.0609422 0.00915424
+-0.0181983 0.18599 -0.0174024
+0.0189716 0.115037 -0.0139804
+-0.0590849 0.0644137 0.0318252
+-0.0819254 0.12582 0.0519232
+-0.0588398 0.0954803 -0.0203334
+-0.0674426 0.148384 -0.0326115
+0.0387628 0.10462 0.0262683
+0.00841723 0.129272 0.0256623
+-0.0196119 0.0364667 -0.0278852
+-0.0376923 0.162356 -0.000243841
+1.88808e-05 0.115368 -0.0182789
+0.0393962 0.0505525 -0.00668347
+-0.0116788 0.0555838 -0.0339192
+0.0363865 0.0713868 -0.0138007
+-0.0821651 0.110069 0.034903
+0.022728 0.117081 -0.0101857
+-0.0515389 0.0417461 -0.0105815
+0.0219588 0.123501 -0.00109075
+0.00735928 0.0960033 -0.0276522
+-0.00349428 0.119696 0.0379021
+-0.0470844 0.151656 -0.00519447
+-0.0242296 0.0941248 -0.0298734
+0.0152433 0.0658912 0.0518711
+-0.021804 0.0376594 -0.0181241
+-0.0133966 0.121962 -0.00916065
+0.0365536 0.108655 0.0265769
+-0.0668098 0.0880715 -0.0180091
+-0.0665181 0.171112 -0.0407548
+0.0493343 0.0532247 -0.0043679
+0.0423933 0.0901635 -0.00682346
+-0.0624126 0.150651 -0.0115734
+0.0373944 0.0505276 -0.00658166
+-0.0411461 0.162173 -0.0113613
+-0.065916 0.0662086 0.0305519
+-0.0289729 0.083488 0.0456837
+-0.000642523 0.0347913 0.0398677
+-0.0738147 0.065744 0.00631032
+0.00351431 0.0938625 0.0544725
+-0.0467733 0.12389 0.0269319
+0.0246632 0.123785 0.00595837
+-0.0715256 0.0958228 0.0413941
+0.00252922 0.0362636 0.0463395
+0.00948792 0.0963424 0.0500581
+0.0292035 0.0400739 0.0286474
+-0.0309481 0.0706991 -0.0284733
+-0.054091 0.152763 0.0215579
+0.0118527 0.105542 -0.0197545
+-0.0404793 0.0832528 0.0431634
+-0.0448438 0.0985036 -0.0215544
+-0.032014 0.0567822 -0.0123897
+0.00040853 0.0356817 0.00488121
+0.0447245 0.0861403 0.0231669
+-0.0426307 0.0338188 -0.00946517
+-0.0710495 0.141325 -0.00813095
+-0.0255896 0.182763 -0.0105092
+-0.0838169 0.107636 0.0253505
+-0.0796245 0.0859561 0.0353266
+0.0240034 0.0449703 0.0396985
+0.00450108 0.0716864 0.0560951
+-0.0676894 0.0750921 -0.0153176
+-0.0466572 0.0369109 -0.0172699
+-0.016529 0.0558872 0.0508401
+-0.087831 0.103641 0.0093887
+0.0272256 0.10745 0.0377741
+-0.0670064 0.0337953 0.0073865
+-0.0866888 0.0833263 0.0124872
+0.0152687 0.0779357 -0.0299953
+-0.0851819 0.152725 0.0105454
+0.000352424 0.0511166 -0.0306262
+0.0518495 0.0464359 0.0201911
+0.0554005 0.0553511 0.0254886
+-0.0886141 0.0928486 0.00844707
+0.0129712 0.130228 0.0115965
+-0.085549 0.104961 0.0233427
+0.0515991 0.0496316 0.0251833
+0.0131946 0.0878791 -0.0305989
+-0.0693376 0.131255 0.0489674
+-0.0660205 0.167997 -0.0305503
+-0.0666146 0.174697 -0.0480375
+-0.0293346 0.0347045 0.0427947
+-0.0553259 0.126836 -0.00601308
+-0.058583 0.0460291 0.0113967
+-0.0416277 0.0337441 -0.014735
+-0.0446642 0.0621749 -0.0132201
+0.0295862 0.120365 0.0134787
+-0.0697163 0.064282 0.022673
+-0.0805487 0.0789662 0.0306236
+-0.0787564 0.154933 0.00983696
+-0.0662707 0.14708 -0.0258685
+-0.0248167 0.0949702 -0.0267501
+-0.0407693 0.0826515 -0.0208197
+0.000514101 0.0346343 0.00952105
+-0.0533361 0.138123 0.0280776
+-0.0689277 0.115103 -0.00892086
+-0.0865224 0.0913375 0.0024428
+0.0232602 0.0790529 -0.0256674
+0.0296786 0.0679688 -0.0198342
+-0.0331127 0.123309 0.0239558
+0.0276403 0.118218 0.0284429
+0.00238303 0.0449286 -0.0261957
+-0.0928278 0.124236 0.0382657
+-0.0868685 0.11045 0.00936714
+-0.0254875 0.0959781 0.0438332
+0.0132252 0.0808221 -0.0308314
+0.035265 0.0591791 0.0368077
+-0.00944135 0.168135 -0.0197365
+0.0011864 0.12951 0.0259323
+-0.0139593 0.0967237 -0.0305143
+-0.00848922 0.0385737 0.0258802
+0.0562981 0.0619429 0.0011209
+0.0322546 0.0987343 -0.0145759
+-0.0268707 0.103016 -0.0234914
+-0.00655639 0.0384205 0.0209905
+-0.0296666 0.0774462 0.0418826
+-0.0626586 0.0676213 -0.0103966
+0.0374569 0.0904362 -0.0137042
+-0.0712181 0.161 -0.0439365
+0.0243668 0.0889213 0.0476805
+-0.0336134 0.0408899 -0.0298935
+-0.0404969 0.0916505 0.0425962
+0.0443454 0.0903358 0.0221636
+-0.0435232 0.163746 0.00524284
+-0.0649943 0.0623954 0.0235277
+-0.0613093 0.0593276 0.0181457
+-0.0717978 0.155398 -0.0409076
+-0.00868753 0.0584178 -0.0339256
+-0.0904383 0.119966 0.00529664
+-0.0601615 0.0333995 -0.00165181
+-0.0612252 0.0407891 0.0437895
+-0.0537348 0.0738508 -0.0172852
+-0.0709057 0.10512 -0.0125462
+-0.00333997 0.039253 0.0353398
+-0.0469903 0.145002 0.00194161
+-0.0250386 0.0659034 -0.0335362
+-0.023273 0.0382876 0.00502865
+0.0111228 0.0960826 -0.0257288
+0.0198113 0.0954368 -0.0230239
+0.038476 0.104075 -0.00282883
+-0.0843581 0.0883713 0.0286614
+-0.0930341 0.118841 0.0362969
+-0.0646767 0.146003 -0.0179612
+0.0284626 0.102127 0.0395666
+-0.0435018 0.113907 0.034675
+-0.0604863 0.0790224 0.042794
+-0.089042 0.112536 0.0205154
+-0.0524675 0.0344946 0.0345461
+-0.0848716 0.119101 -0.00207765
+-0.0120923 0.11442 -0.0172013
+-0.079929 0.151371 0.00121035
+-0.0920085 0.116136 0.0393096
+0.0361533 0.112569 0.0130564
+-0.0196629 0.125034 -0.00230889
+0.000499429 0.115573 0.0406664
+-0.0560183 0.147198 -0.00168648
+-0.0873616 0.110481 0.0113565
+-0.0416844 0.0636674 -0.0137203
+-0.0651889 0.153592 -0.00278678
+0.0471599 0.07398 0.0153485
+0.0404106 0.0873775 0.0321991
+-0.019434 0.184905 -0.0153275
+-0.0438294 0.0913555 -0.0224139
+-0.0527613 0.0797578 -0.020501
+-0.0314155 0.0651435 -0.021432
+0.00948509 0.0950229 0.0512669
+0.0346346 0.107297 -0.007625
+-0.0870053 0.0954387 0.00242783
+-0.0617312 0.142927 -0.00565867
+-0.0538929 0.14622 0.0244012
+0.0339044 0.115273 0.00366751
+0.049575 0.0693171 0.00251779
+-0.0861009 0.106274 0.00635995
+-0.00751182 0.075985 0.0578234
+-0.0761849 0.0933719 -0.0135017
+0.0266626 0.0672707 0.0437593
+-0.0314925 0.0932138 0.0444288
+0.0112937 0.0680868 -0.0307505
+-0.086045 0.141863 0.00720055
+0.000490707 0.111422 0.0424934
+-0.0516022 0.0502173 -0.00741774
+-0.0709386 0.131124 -0.00852217
+-0.0291841 0.125368 0.0164845
+-0.0012258 0.095852 -0.0315171
+-0.000697567 0.0641196 -0.0342689
+-0.0797379 0.0738711 0.0228323
+-0.0705682 0.0382102 0.00943236
+-0.0558807 0.102663 -0.0193944
+0.0262875 0.0835737 0.0468767
+-0.0206175 0.0364922 -0.0281092
+0.0306136 0.0779431 -0.0207534
+0.037492 0.0983062 -0.0097724
+-0.0861064 0.0806138 0.0174966
+-0.0488748 0.105594 -0.0196597
+-0.0499497 0.0724883 0.0409516
+-0.060435 0.131107 0.0389542
+-0.0197383 0.108898 -0.0213322
+-0.0328414 0.0943934 -0.0238538
+0.0071329 0.104451 -0.0211019
+-0.0904392 0.125398 0.00528343
+0.0579573 0.0676391 0.00414749
+-0.0890486 0.0915916 0.0214249
+0.0544885 0.0716156 0.00618127
+0.037936 0.0901639 0.0356574
+-0.0631289 0.155254 0.0269868
+0.0280038 0.120349 0.024295
+0.00325461 0.0697315 -0.0336623
+0.0198002 0.0768324 0.0515324
+0.0135718 0.0504901 0.0475195
+-0.0220331 0.041681 0.0538782
+-0.0322365 0.126297 0.00653811
+-0.020497 0.0855906 0.0563403
+0.0100844 0.123139 0.0340691
+-0.0917617 0.141982 0.0191718
+-0.00665267 0.0526646 -0.0325345
+0.0325469 0.0922927 -0.0176842
+-0.00490321 0.0383839 0.0141185
+0.0393963 0.049102 -0.00636122
+-0.0468295 0.0927337 -0.0216687
+0.0393484 0.0561243 -0.00568756
+0.0381042 0.0392738 0.00134927
+-0.02061 0.0653432 0.0492306
+-0.0644858 0.152894 -0.00250698
+0.0316363 0.118365 0.0113851
+-0.0625842 0.162383 -0.0563311
+-0.0126137 0.180121 -0.0236267
+-0.0562637 0.142432 0.0309288
+0.0389203 0.10838 0.0161659
+0.0468209 0.0708789 0.021127
+0.0153317 0.060873 -0.028643
+-0.067208 0.0447917 0.00368814
+-0.0638714 0.15469 -0.0385902
+-0.0624126 0.161536 -0.0416011
+-0.011049 0.124435 -0.00785173
+0.0143712 0.0493733 -0.0267066
+-0.0374862 0.0931566 0.0438456
+-0.0278525 0.0807805 0.0474761
+0.0573848 0.0670309 0.00292365
+-0.0304938 0.0960556 0.0449536
+0.0182602 0.127523 0.0192457
+0.0182204 0.080645 -0.0282763
+-0.00275795 0.0740872 -0.0359501
+-0.072697 0.155649 0.00759319
+-0.0857527 0.0792184 0.0135098
+-0.0604443 0.0456013 0.0296807
+-0.0528198 0.0927332 -0.0219739
+-0.0457202 0.0709417 -0.0164642
+-0.054497 0.0889964 0.0448823
+-0.0541353 0.147754 0.0254132
+0.05074 0.0503045 -0.00171178
+-0.0926993 0.124215 0.0352716
+0.00850767 0.0786 0.0556334
+-0.0141847 0.0405865 0.0511605
+-0.0500491 0.0345412 0.0367666
+-0.0744234 0.156022 0.0128056
+-0.0148381 0.0386367 -0.0157684
+-0.0896535 0.0916031 0.0184402
+-0.0279306 0.125506 0.00666413
+-0.0249827 0.0918474 0.0485489
+-0.0247746 0.0385687 -0.0102357
+-0.0718755 0.10648 -0.0114758
+0.0303733 0.115414 -0.00438737
+0.0390771 0.099844 -0.00681802
+-0.0601235 0.0447437 0.0425684
+0.0559507 0.0508031 0.00520531
+-0.087948 0.102288 0.00840013
+-0.0802939 0.0732789 0.00250413
+-0.00347452 0.114725 -0.0175669
+-0.0780015 0.155773 0.018849
+-0.0868392 0.0873072 0.00147849
+0.0114304 0.0346172 0.0371012
+-0.0154945 0.0925097 0.0555061
+0.0207547 0.10431 -0.0184628
+-0.0805113 0.153427 0.0283513
+-0.0133702 0.0343611 -0.0190243
+0.045363 0.0932019 0.00717004
+-0.0517619 0.079747 -0.0203928
+-0.011137 0.171308 -0.0197957
+-0.0797359 0.0706327 0.0105539
+-0.0435047 0.116629 0.0323741
+0.0461192 0.0786876 0.0190773
+0.0257679 0.0349257 0.0180133
+-0.0377436 0.127354 0.000111554
+0.0455391 0.0875946 0.0141649
+-0.0115776 0.0962625 -0.032007
+-0.0304054 0.0580102 -0.0194062
+-0.0519213 0.118323 0.0336042
+-0.0615165 0.15114 0.0355512
+-0.0268549 0.175688 -0.00910606
+0.0291872 0.0462618 0.034893
+-0.0828817 0.143196 0.00216401
+-0.0229243 0.0972075 0.044901
+-0.0420606 0.0344689 0.0332688
+0.00840712 0.0404044 -0.0234014
+-0.0584986 0.100161 0.0428821
+0.0267286 0.0521731 -0.0207566
+-0.0343564 0.043282 -0.028737
+0.035312 0.0840703 -0.0177861
+0.0167493 0.0874098 0.0506847
+-0.0706375 0.156126 0.0126907
+0.0395317 0.0596774 0.0306966
+0.0160357 0.0807986 0.0531419
+-0.0719071 0.105086 -0.0120336
+0.057752 0.0523416 0.0181873
+-0.0705862 0.166615 -0.0490027
+-0.069998 0.157611 -0.0031485
+-0.0629727 0.118457 0.044154
+-0.0098895 0.107351 -0.0224128
+-0.0668287 0.169972 -0.0351376
+-0.0538607 0.152062 0.0231076
+0.0286155 0.0795328 0.044942
+0.00747725 0.131195 0.0181386
+0.0525355 0.0678367 0.0261828
+-0.069983 0.033931 0.00665746
+-0.00449526 0.10588 0.044033
+-0.0647467 0.143415 -0.011401
+-0.0242451 0.0337053 -0.0224295
+0.0405945 0.102819 0.0221712
+-0.0253936 0.106122 -0.0223873
+-0.031866 0.126076 0.00521848
+-0.0903832 0.132413 0.0312232
+0.0270423 0.0648893 -0.0216756
+-0.0416036 0.125525 0.0208631
+-0.0642885 0.148287 -0.0250747
+0.043249 0.0705728 -0.00179391
+0.00750831 0.0772509 0.056126
+-0.0360471 0.125746 -0.0036679
+-0.0534999 0.0820142 0.0450601
+-0.0268076 0.0782799 -0.0366273
+-0.0630392 0.0336157 0.00836468
+0.00450283 0.0924607 0.0546761
+-0.0794816 0.0846149 0.0352279
+-0.0354976 0.116636 0.0319301
+0.0590094 0.0552651 0.0101755
+0.0177618 0.100614 -0.0224544
+0.0141872 0.0347155 0.0357788
+-0.0626395 0.0644043 -0.00619313
+-0.0472223 0.168222 -0.000777409
+-0.0688709 0.156258 0.0147705
+-0.00209707 0.130745 0.0203917
+0.0438165 0.0959355 0.0191615
+0.0272253 0.120021 -0.000250724
+-0.0623918 0.152158 -0.026581
+-0.0619803 0.153737 -0.02558
+-0.0110119 0.122536 -0.00980812
+-0.00845767 0.100229 0.0476033
+-0.053626 0.1255 0.0365054
+0.029243 0.0872327 -0.0208644
+-0.0561028 0.133503 -0.00512832
+-0.0536146 0.150855 0.0243962
+-0.0729449 0.0805494 0.0386997
+-0.0113093 0.0384672 0.00547553
+0.013929 0.0392001 0.0444158
+-0.0743245 0.179234 -0.0539852
+-0.0670834 0.168031 -0.0569976
+0.0269196 0.0418157 0.0333163
+-0.0261604 0.114813 -0.0155316
+0.054979 0.06227 -0.000302264
+0.0447631 0.0931576 0.00318223
+-0.028552 0.159576 0.000695282
+-0.0196334 0.0906851 0.0545345
+-0.0681661 0.173216 -0.0428508
+-0.0670035 0.166617 -0.0570134
+-0.00170857 0.0641356 -0.0344906
+-0.0302923 0.115032 -0.0157497
+-0.017789 0.0998203 0.0439009
+0.0575984 0.0711737 0.0088801
+-0.0559485 0.119826 0.0383628
+-0.0508832 0.106998 -0.0191626
+-0.0856518 0.096702 -0.000561949
+0.0433856 0.0475038 -0.0047769
+-0.0141839 0.177168 -0.0206609
+-0.0318261 0.0623615 -0.0184459
+-0.0694684 0.158126 -0.0509379
+-0.059088 0.0445923 -0.00517311
+-0.0680469 0.0887699 0.043444
+0.0413366 0.0588699 -0.00449648
+-0.0108613 0.16611 -0.0209706
+-0.0810695 0.111472 -0.000645954
+0.0236683 0.0535376 0.0428398
+-0.0525009 0.104252 0.0406803
+0.0178265 0.128119 0.0148069
+-0.0833287 0.0817012 -0.000498118
+-0.0582078 0.148218 0.0334722
+0.0469627 0.0735494 0.00823046
+0.0348898 0.0889372 0.0400127
+0.0544139 0.0478718 0.0102055
+-0.0519767 0.0343446 0.0277664
+-0.0526872 0.144684 0.0193835
+-0.0654577 0.0403952 0.0367257
+-0.0632766 0.146612 -0.0147592
+-0.0756638 0.0968147 0.0380937
+-0.0121766 0.169774 -0.0245851
+-0.0313173 0.115081 -0.0157968
+0.00550009 0.105744 0.0419393
+0.0170456 0.0808203 0.0528345
+0.00997537 0.129323 0.0247881
+-0.000565033 0.0348667 0.0451983
+-0.0170398 0.124093 -0.00535053
+0.0359746 0.112738 0.007259
+-0.0264982 0.112519 0.0362632
+-0.0108141 0.0841239 -0.038537
+-0.0464922 0.097353 0.0431423
+0.0456344 0.0820067 0.0201819
+-0.00765915 0.0388225 0.0294318
+0.00952232 0.057476 0.0527668
+-0.0114724 0.180094 -0.0295969
+-0.0324762 0.0778813 -0.0295332
+-0.0515001 0.0465582 0.0417907
+-0.0716564 0.0639047 0.0190638
+-0.00648988 0.10728 0.0440126
+0.0517118 0.048146 0.0235716
+-0.00973422 0.0712867 -0.0371391
+-0.0311873 0.0499402 0.0418672
+-0.0652548 0.0380623 0.0267185
+-0.0353491 0.0346157 0.0221204
+-0.00455763 0.115688 -0.0165869
+-0.0158711 0.0941172 -0.0338261
+-0.0307264 0.0510087 -0.0163552
+-0.0674749 0.0861001 0.0436947
+-0.00549495 0.0456998 0.0471564
+-0.0127624 0.0742651 -0.0384156
+-0.0667813 0.0354951 0.0323861
+-0.0650934 0.040468 0.0377689
+0.00949782 0.11825 0.0371477
+0.042476 0.0986857 0.0211679
+0.0134353 0.0833572 0.0528968
+-0.006265 0.0381462 0.0486516
+0.019505 0.108463 0.0397034
+-0.0531501 0.13113 0.0336749
+-0.0169066 0.174228 -0.0176024
+-0.0877346 0.144562 0.0345528
+-0.0620052 0.131132 -0.00795604
+0.00350354 0.0967589 -0.0284524
+-0.0379926 0.15214 0.00278328
+-0.0250008 0.0678945 0.0436439
+0.013488 0.120719 -0.0120957
+-0.0546814 0.0342953 0.0289953
+-0.0493523 0.128134 -0.0033313
+-0.00536457 0.0387134 0.026395
+-0.0301008 0.162274 -0.0148279
+-0.0520761 0.153139 -0.00390728
+-0.0312974 0.120401 0.0276066
+-0.072708 0.173064 -0.0373345
+-0.0634981 0.0847405 0.0443851
+-0.00748204 0.123738 0.0339317
+0.0398166 0.0726016 0.0329349
+-0.0204571 0.159751 -0.0120682
+-0.0398664 0.104215 -0.0203975
+0.006345 0.0351555 0.0445736
+-0.0295025 0.0974144 0.0445077
+-0.00148646 0.0489421 0.0507365
+-0.0158009 0.0813621 -0.039398
+-0.0661715 0.0383371 0.0290301
+-0.0520592 0.0517918 0.0296489
+0.0132683 0.0765435 -0.0305058
+0.0357248 0.113154 0.00859849
+0.0452751 0.0847797 0.0211588
+0.0408906 0.0942563 -0.00676992
+-0.0621992 0.16466 -0.0525894
+-0.0704991 0.101365 0.0396906
+-0.0514936 0.0959907 0.0439844
+-0.0738976 0.0662178 0.00410027
+-0.0308753 0.104365 -0.0222089
+-0.0454852 0.0411575 0.0440424
+0.0264018 0.0591975 -0.0228202
+-0.0372554 0.154082 -0.00855912
+-0.0104302 0.175693 -0.0238578
+-0.0581296 0.0583212 0.0178996
+-0.0237002 0.0610797 -0.032726
+-0.0366248 0.127943 0.00786237
+-0.00749367 0.0605601 0.0556586
+-0.0317091 0.0749949 -0.0294856
+-0.0617882 0.138121 0.0352393
+-0.0764283 0.117143 0.0518912
+-0.0476607 0.120291 -0.0131944
+-0.0617261 0.158412 -0.0335949
+-0.0794782 0.106106 0.0317497
+-0.00127622 0.127442 0.029403
+-0.0850735 0.0819457 0.0214598
+-0.088151 0.137836 0.0407884
+-0.0622605 0.152178 -0.0225796
+-0.0896207 0.132365 0.0409732
+-0.0392773 0.153597 0.0044688
+-0.0477636 0.0797421 -0.0198355
+0.0475024 0.06248 0.0300852
+0.0137309 0.0344041 -0.00431645
+-0.0864106 0.136323 0.00223079
+-0.0622483 0.0470201 0.00467011
+-0.0218601 0.0893132 0.0539604
+-0.0404866 0.0390699 -0.027317
+-0.0563767 0.0650155 0.0336358
+-0.022785 0.0727991 -0.0382731
+0.00745846 0.0952014 -0.0287983
+-0.0728877 0.143976 -0.0119757
+-0.0485361 0.130681 1.6802e-05
+-0.08227 0.0830732 0.0310042
+-0.0458007 0.0884477 -0.0220772
+-0.0674901 0.102816 0.040307
+-0.0295082 0.0987895 0.0437091
+0.0266247 0.0591987 0.0436528
+-0.0166425 0.0970062 0.0498004
+-0.0754488 0.151352 -0.0128993
+-0.0561187 0.04231 0.0196965
+-0.0125561 0.107483 -0.0218463
+-0.0258638 0.0987461 -0.0241399
+-0.0150968 0.0965608 -0.0303463
+0.0403869 0.0505617 -0.00671315
+-0.0618596 0.135275 0.0369058
+-0.00853806 0.120181 -0.0133625
+0.0152242 0.123558 0.0310525
+-0.0669104 0.112326 -0.011534
+-0.00121369 0.0389243 -0.000247464
+0.0599261 0.0581121 0.0171753
+-0.0104999 0.0842933 0.0575891
+0.0236959 0.120687 0.0298434
+0.0407626 0.105627 0.00616707
+-0.0204813 0.10165 0.0438784
+-0.0497999 0.0884036 -0.0217208
+0.0455191 0.0847794 0.00419259
+-0.0113995 0.128605 0.00179072
+-0.0808762 0.0733317 0.00350919
+-0.0634956 0.0804499 0.0432131
+-0.0737877 0.170302 -0.0290826
+-0.00649113 0.0718493 0.0579775
+-0.0445186 0.0533636 0.0386768
+0.0320623 0.104555 -0.0127247
+-0.0491177 0.138604 0.00740359
+0.0459251 0.0848195 0.0121712
+0.0423718 0.0547731 -0.00653415
+-0.0505603 0.0417939 -0.0107632
+-0.0551112 0.0477166 -0.00539308
+-0.0492183 0.150688 0.0111503
+-0.0868019 0.0886457 0.00149241
+-0.0414982 0.166749 0.00369508
+-0.00533161 0.123249 -0.0106624
+0.00612795 0.107304 -0.0203065
+0.023391 0.0605296 0.0460187
+-0.0778945 0.102117 0.0345146
+-0.0177322 0.108689 -0.0211068
+-0.0341359 0.168185 -0.0152479
+-0.0364811 0.0931828 0.0441998
+-0.0645148 0.15586 0.0250316
+-0.0133496 0.124356 0.0309811
+-0.053528 0.131291 -0.0047694
+0.0236875 0.0373106 0.0299772
+0.00806894 0.0972917 -0.0250353
+0.0518069 0.0518147 -0.00170668
+-0.0580149 0.0675718 0.0363481
+-0.0916942 0.124053 0.00727726
+0.0143227 0.0344255 0.0215932
+-0.0828034 0.0762521 0.011522
+-0.0523769 0.119775 0.034728
+-0.0380638 0.174118 -0.00995608
+-0.0515288 0.0559219 0.0167726
+-0.0665225 0.10009 0.04154
+0.0449219 0.0497223 0.0313654
+-0.00374083 0.069852 -0.0355987
+-0.0448162 0.12956 0.0195798
+0.00318984 0.0852564 -0.0341139
+-0.0901249 0.125637 0.04453
+0.0248625 0.12099 -0.00239034
+-0.0357073 0.03405 0.0117511
+-0.0461509 0.05879 0.0381434
+0.0389649 0.108275 0.00542368
+-0.0857362 0.141867 0.00617644
+-0.0755097 0.135846 0.0506323
+0.0384382 0.0954258 0.0328906
+0.00385238 0.131766 0.0125385
+-0.0277181 0.0382234 0.00237012
+0.0554262 0.0714159 0.00640835
+-0.0707971 0.168292 -0.02371
+-0.0131917 0.169758 -0.0239616
+-0.0344904 0.0661905 0.0406967
+-0.00154364 0.130277 0.00186507
+-0.0647696 0.148087 -0.0261392
+-0.0577571 0.0334518 0.000595927
+-0.0334995 0.0618586 0.0392638
+-0.0657123 0.171986 -0.0448274
+-0.0254896 0.049863 0.0466034
+-0.0207287 0.058287 -0.0332963
+-0.040488 0.088839 0.0428058
+0.00826686 0.0681716 -0.0316571
+-0.0382076 0.0431174 -0.0263315
+-0.0192007 0.0392753 0.0392298
+0.0446778 0.0701888 0.00161208
+-0.0681688 0.0340999 0.0104427
+-0.0891956 0.099693 0.0183885
+0.00250408 0.0856622 0.0573274
+0.00673484 0.0364109 -0.0131882
+-0.0273112 0.0917698 0.0451953
+0.0360152 0.072737 0.038003
+-0.0174841 0.0910963 0.0554741
+-0.0882831 0.114383 0.0443189
+-0.0562701 0.0534697 0.00668599
+0.0184737 0.104403 0.0439338
+0.0591195 0.067343 0.0203999
+-0.0464971 0.107057 0.0400682
+0.0224712 0.125479 0.00796738
+-0.00281596 0.0896133 -0.0355773
+-0.0892259 0.113441 0.0323782
+-0.0532781 0.0476794 0.0246524
+0.00120832 0.0811183 -0.0353756
+-0.0820812 0.0748515 0.0115294
+-0.0344414 0.153644 0.000910386
+-0.0915313 0.147463 0.0171482
+-0.0778811 0.12224 -0.00662917
+0.00275904 0.130985 0.0207146
+0.0333375 0.115599 0.0220283
+-0.0925663 0.116874 0.0234322
+-0.0461657 0.168264 0.000998904
+-0.0608088 0.148246 0.0367611
+-0.0740333 0.13404 0.0510058
+0.046183 0.0806404 0.0141758
+-0.0177485 0.0700027 -0.0382786
+-0.05252 0.0490121 0.0379722
+-0.0142459 0.168321 -0.0155387
+-0.0894247 0.0996886 0.0153976
+-0.0654783 0.0861634 0.0444498
+0.0323217 0.116577 0.0230638
+-0.0676059 0.141897 -0.00935244
+-0.0514978 0.10289 0.0412322
+-0.00575874 0.0741425 -0.036638
+-0.0913439 0.11607 0.03131
+-0.0313824 0.0877015 -0.0265568
+0.0373688 0.102607 -0.00785264
+-0.0106393 0.169838 -0.0190633
+-0.0716387 0.0675256 0.0265031
+-0.0396636 0.0340515 0.0270767
+-0.0779219 0.0717107 0.00150831
+0.0451585 0.0670735 0.000845212
+-0.045692 0.126639 0.0237789
+-0.0914166 0.131046 0.0292353
+-0.0845601 0.0832447 0.0254813
+-0.00465613 0.0540645 -0.0324247
+-0.0573264 0.15429 0.0261567
+-0.0776607 0.0817583 -0.0102119
+-0.0614708 0.165833 -0.0590275
+-0.0866007 0.129822 0.0479412
+-0.0751026 0.155922 -0.00200459
+0.0292911 0.0364248 0.021021
+0.0168648 0.0958851 -0.0235234
+0.0566532 0.0608369 0.0255651
+-0.0447794 0.128887 0.00190497
+-0.024583 0.0635737 0.0419612
+-0.0534745 0.0360014 0.0464895
+-0.0488506 0.0999451 -0.0218934
+0.00224668 0.0740592 -0.0351433
+-0.0223056 0.126998 0.0101726
+-0.0907871 0.14608 0.0151486
+-0.0506704 0.0680761 0.0375114
+-0.0689054 0.113678 -0.00975253
+-0.032497 0.0917926 0.0443017
+0.0282492 0.102359 -0.0164093
+0.0375206 0.0540908 0.0314327
+-0.00566586 0.0555015 -0.0328252
+-0.0896969 0.139298 0.033185
+-0.0707473 0.127025 0.0521985
+-0.0455052 0.162274 0.00622301
+-0.0188243 0.0868874 -0.0382929
+0.00890069 0.0988547 -0.0226736
+0.0103725 0.130878 0.016344
+-0.0568151 0.142191 -0.00256359
+-0.0576833 0.0660478 -0.00944709
+-0.0394154 0.128541 0.00978788
+-0.0112757 0.0392934 0.0501019
+-0.0875442 0.11045 0.0133403
+0.0108543 0.128955 0.0251156
+-0.0306705 0.0692801 -0.0274547
+0.0193368 0.0460939 -0.0219388
+0.0280428 0.0928381 -0.0202889
+0.0101954 0.0879315 -0.0314901
+-0.0425303 0.153621 0.00682011
+0.046342 0.0671736 0.000660587
+0.0133755 0.0508647 -0.0275026
+-0.0815821 0.0803018 0.0303913
+-0.059075 0.137911 -0.00597298
+0.0419587 0.0958192 0.0261617
+0.0444321 0.0482656 0.0306384
+-0.0444939 0.0519693 0.038747
+0.0141421 0.107244 -0.018655
+-0.0258198 0.0880859 -0.0357275
+0.0511643 0.0525875 0.0281258
+-0.0838035 0.0884157 -0.00457068
+-0.0075843 0.111951 -0.0206051
+0.020155 0.0344845 0.00437508
+-0.0141697 0.038751 -0.00641336
+0.0160515 0.039741 -0.0214719
+-0.0627129 0.161593 -0.024579
+-0.0329051 0.0359381 0.0496011
+-0.0738068 0.0892836 -0.0151913
+0.0299737 0.0934986 -0.0189639
+-0.0618436 0.129703 0.0404325
+0.0117043 0.110341 -0.0188996
+0.013386 0.0576661 0.0508541
+-0.0636966 0.117092 0.044917
+-0.0634835 0.0890243 0.0452141
+-0.0874124 0.136542 0.0428952
+-0.0391888 0.168166 -0.0121398
+0.0376532 0.101954 -0.00791483
+-0.0708338 0.143978 -0.0149516
+-0.0135013 0.0687469 0.0541774
+-0.0671166 0.134015 0.0451603
+-0.0645196 0.148285 0.0383203
+-0.0216796 0.18469 -0.0188168
+-0.00148992 0.070365 0.0570874
+-0.0291401 0.0875323 -0.0325902
+0.0251009 0.122815 0.00327552
+-0.0111221 0.0980696 -0.0279124
+-0.0635024 0.0918143 0.0447779
+-0.0887995 0.0901451 0.00746775
+0.0164935 0.0962515 0.0477962
+0.046272 0.0806446 0.00718674
+0.038459 0.094268 -0.00974763
+0.0100793 0.0873522 0.0550703
+0.0183745 0.0874107 0.0495162
+-0.0547819 0.0840722 -0.0215429
+0.0249849 0.0576546 -0.0237943
+0.0262469 0.11849 0.0293617
+0.0187045 0.0462587 0.0425837
+-0.0433933 0.123406 -0.0104784
+-0.0615139 0.0385816 -0.00827445
+-0.0234882 0.104381 0.0428298
+0.0334188 0.115464 0.00204907
+-0.0251305 0.0810774 0.0532367
+-0.0661661 0.0431586 -0.00127362
+-0.0689806 0.138464 -0.0078252
+0.0324954 0.0484967 0.0321634
+-0.0650217 0.154743 0.00396393
+-0.0615004 0.0818818 0.0435978
+0.0289072 0.10744 0.0367037
+-0.0720417 0.156813 -0.0379146
+-0.0232564 0.171248 -0.0127378
+0.0211195 0.109025 -0.0155233
+-0.0668614 0.150018 -0.036632
+0.0204284 0.122662 -0.00423372
+-0.0628194 0.162004 -0.0576316
+-0.0641553 0.168532 -0.0413683
+0.0278158 0.0649933 -0.0208789
+-0.0788364 0.0742331 0.0262211
+0.0527925 0.0505032 0.000257908
+-0.0738772 0.107826 -0.00969763
+-0.0819791 0.08171 0.030761
+-0.0904343 0.136488 0.021207
+-0.0584473 0.145323 0.0330944
+0.00225674 0.0697235 -0.0336823
+-0.0228155 0.081267 -0.0385568
+0.0290261 0.106116 0.036871
+0.0121361 0.105839 -0.0196306
+-0.0365486 0.12125 -0.0102225
+-0.070219 0.146984 -0.026659
+0.00749947 0.122404 0.035106
+-0.0234912 0.107132 0.0414501
+0.0116034 0.0355849 -0.021581
+-0.0896067 0.0902304 0.0134498
+0.0274272 0.0781922 -0.0230908
+-0.0228318 0.114095 -0.016802
+-0.0510675 0.0598803 0.0316706
+0.0525281 0.0730706 0.0188626
+-0.0503624 0.128323 -0.00347306
+-0.0758088 0.0906346 -0.0139136
+0.0428831 0.0902351 0.0261862
+-0.00171604 0.131316 0.0104838
+-0.0845537 0.143232 0.00516668
+0.0183451 0.0551894 -0.0280076
+-0.0914715 0.128331 0.0382421
+-0.0654644 0.148292 0.0388168
+0.025254 0.122206 0.00192061
+0.0102154 0.0850922 -0.0315035
+-0.0913446 0.12833 0.0392393
+-0.0282035 0.125211 0.0168448
+0.0435793 0.0677809 0.0261624
+-0.014506 0.114132 0.0394731
+0.0146525 0.0927004 0.0511905
+-0.0777124 0.0900603 0.0375253
+0.0426104 0.0723991 0.0281081
+-0.0165087 0.10859 0.0417725
+-0.0293809 0.118905 0.0298455
+-0.0747355 0.161794 -0.0126957
+-0.0194977 0.103001 0.0433214
+-0.0774975 0.111156 0.045792
+-0.0235187 0.0551838 0.0425567
+0.00826699 0.0696219 -0.0321852
+-0.0671246 0.042281 0.0101216
+0.0443577 0.0547836 -0.00632411
+-0.0771697 0.152833 -0.00289126
+-0.0455143 0.0335109 0.00302189
+-0.0154906 0.0744572 0.0558178
+0.0390604 0.0575755 -0.00514174
+-0.0300453 0.0861604 -0.0315778
+0.0243112 0.0999667 -0.0198415
+0.0337476 0.0534432 0.0345417
+-0.0207506 0.0685447 -0.0377382
+-0.0883977 0.0983242 0.022387
+-0.043533 0.162269 0.00566221
+-0.0580451 0.047259 0.00941407
+-0.0435244 0.129538 0.0127129
+-0.0129572 0.163516 -0.016687
+-0.018238 0.0985224 -0.0244062
+-0.0468429 0.132502 0.00641278
+-0.012834 0.128656 0.00349339
+-0.00949586 0.0938956 0.0554931
+0.0405174 0.0829825 -0.0107762
+-0.0306755 0.0409906 0.0514223
+-0.0887381 0.139163 0.03848
+-0.0639163 0.105371 -0.0163736
+0.0319159 0.0876168 0.0427503
+-0.0165553 0.128252 0.0064647
+-0.0695817 0.168848 -0.0261289
+-0.0702082 0.141157 0.0460159
+0.0179624 0.0489942 0.0433049
+0.0363477 0.102053 0.0316389
+-0.029898 0.0385093 -0.0112051
+-0.0687619 0.169445 -0.0540038
+-0.0726588 0.143932 -0.0130219
+0.0162319 0.0849386 -0.0291053
+-0.0620358 0.136971 -0.00707833
+0.0166416 0.0740317 0.0522091
+0.0213347 0.0607071 -0.0262571
+-0.0576194 0.143675 -0.00218012
+-0.0913297 0.148826 0.016141
+-0.0751782 0.152724 -0.0149145
+-0.062838 0.153641 -0.0115615
+-0.0579073 0.152669 0.031812
+-0.0401847 0.173392 -0.00391542
+0.0166876 0.0475243 0.0432195
+-0.0393167 0.0432044 -0.0243027
+0.00658649 0.0945677 -0.0301242
+-0.00883076 0.130134 0.0179537
+-0.0248377 0.0867614 -0.0367865
+0.0135609 0.0343729 -0.0176058
+-0.0367327 0.0739624 -0.0182558
+-0.0891756 0.088886 0.0174542
+-0.0869535 0.131154 0.0468504
+0.00298644 0.131511 0.0079308
+-0.0116778 0.0541503 -0.0336719
+-0.00992638 0.128404 -5.81123e-05
+-0.0544374 0.131586 -0.00508481
+-0.0384968 0.104212 0.0394832
+-0.074384 0.0726496 -0.00763941
+-0.0530656 0.150158 -0.00286677
+-0.0166345 0.0465837 -0.0289175
+0.0567453 0.0707667 0.0204115
+0.0381172 0.0659142 -0.0117557
+0.00256341 0.131601 0.00920655
+0.0391019 0.106936 0.00217583
+-0.0480338 0.0685335 0.039429
+-0.0794876 0.0745597 -0.0035364
+-0.0248661 0.101609 -0.0237851
+-0.0647841 0.0448471 0.00913709
+-0.0446647 0.117939 -0.0147658
+-0.0152743 0.180101 -0.0270399
+-0.0859599 0.106341 0.0203569
+0.0111873 0.0893276 -0.0308633
+-0.0922566 0.126816 0.00926569
+-0.0618365 0.166237 -0.0545929
+0.0181719 0.0795251 0.0527143
+-0.0684871 0.120374 0.0527878
+-0.0476953 0.0723623 -0.0159721
+-0.0472614 0.125357 0.0280089
+-0.0494961 0.113894 0.0347794
+-0.0374992 0.0847101 0.0439351
+-0.0404923 0.0620428 0.0412639
+0.0609826 0.0637492 0.0111528
+-0.0849504 0.136625 0.0461206
+0.0337121 0.104741 0.0331059
+-0.00864132 0.0907031 -0.0362798
+0.00988706 0.0373676 0.0450724
+-0.024511 0.0782394 0.0527049
+-0.0716377 0.0368114 0.00909586
+-0.0832904 0.111663 0.0440643
+-0.0156647 0.109623 -0.0201068
+-0.0766606 0.163806 -0.0339802
+0.0165486 0.0631544 0.0502063
+-0.0753023 0.155004 0.00375308
+0.039051 0.0380783 0.00858362
+0.0420573 0.0943632 -0.00379153
+-0.0924935 0.124207 0.0332695
+-0.0745678 0.155931 0.022959
+-0.0348878 0.0336855 0.0122448
+-0.0755817 0.14859 -0.0148673
+-0.0712419 0.0628661 0.0147709
+-0.0722512 0.170824 -0.0490235
+-0.044945 0.146638 -0.00064718
+-0.0327132 0.0383899 -0.00426549
+-0.0656128 0.0626699 -0.00283823
+-0.0615924 0.156857 -0.0275883
+-0.0306139 0.051126 0.0398517
+-0.0552831 0.0478834 0.0286656
+-0.0825962 0.0869865 -0.00556699
+-0.0743429 0.0777095 0.0359578
+-0.00912413 0.125328 0.0309758
+-0.0877256 0.112462 0.0226926
+-0.0624682 0.148372 0.0373168
+-0.0772099 0.0954309 0.0368548
+-0.0657805 0.04031 0.0356744
+0.0390337 0.102562 -0.00454148
+-0.0218167 0.0770677 -0.0388569
+-0.013694 0.165443 -0.0129401
+-0.0242656 0.0588495 -0.0313753
+-0.0201769 0.16108 -0.00474531
+-0.0746468 0.151291 -0.0288803
+-0.0870878 0.147265 0.0324302
+-0.0667973 0.0823343 -0.0181512
+-0.0894818 0.137913 0.0311948
+0.0410937 0.100015 0.0241739
+0.0260496 0.0420955 0.0353242
+-0.0497977 0.134944 0.0250398
+-0.0824554 0.0748386 0.00652396
+-0.0420037 0.0449364 -0.0183222
+-0.00587956 0.107379 -0.0226761
+-0.0298783 0.0719759 -0.0315267
+-0.0649016 0.118019 -0.00923352
+-0.0461849 0.131841 0.0072241
+-0.0384968 0.066293 0.0418062
+-0.0375363 0.128085 0.0104763
+-0.0684218 0.173931 -0.0443685
+-0.0921191 0.131045 0.0262423
+-0.0269088 0.0720784 0.0425891
+-0.0318614 0.109962 -0.0183828
+-0.0576346 0.139576 0.0324737
+-0.0582272 0.151065 0.033498
+-0.0824187 0.0788859 0.0267668
+-0.0386191 0.0474546 -0.0163861
+0.0266281 0.0902434 0.0456585
+-0.00674435 0.0340208 -0.0192827
+0.0167681 0.0348096 -0.0116543
+0.00555478 0.102979 0.0445124
+0.0101351 0.0346886 0.0403762
+-0.0715049 0.147007 0.0421623
+0.0583177 0.0551766 0.00716644
+-0.0774854 0.142838 0.0458543
+-0.0630637 0.0343143 0.0307056
+-0.00979508 0.122843 -0.0101629
+-0.0497184 0.0723081 -0.0156401
+0.0463136 0.0660623 -0.000202599
+-0.0455839 0.0490621 -0.0101677
+-0.0746807 0.110131 0.0436879
+-0.0107636 0.0728162 -0.0377336
+-0.0155087 0.105817 0.0426846
+-0.0419504 0.0338103 -0.0111665
+0.0243299 0.0661738 -0.0239819
+0.0195943 0.041435 -0.0196763
+0.0590873 0.0566489 0.0191831
+-0.0828908 0.120639 -0.00384458
+0.0299951 0.111426 0.0329993
+-0.0685146 0.033856 -0.00470573
+-0.0492135 0.140151 0.00839688
+-0.0489146 0.121146 0.0309679
+-0.00870224 0.0627847 -0.0356447
+-0.086772 0.140601 0.0407491
+-0.0293203 0.0381642 0.0309659
+-0.0330003 0.0497903 -0.0153502
+-0.0425517 0.127843 -0.00110505
+0.0328934 0.0381571 -2.41096e-05
+-0.0525195 0.0426931 0.0456595
+0.021748 0.0349954 0.0225893
+0.00827474 0.123868 -0.00945393
+-0.029563 0.0377844 -0.01791
+-0.0370175 0.163827 -0.00102436
+-0.0664999 0.101466 0.0412188
+0.0064937 0.048929 0.05087
+0.0287604 0.121079 0.0103057
+0.0252285 0.11379 -0.0106368
+-0.0599544 0.0581084 0.014112
+-0.062196 0.154993 0.0273195
+-0.0901963 0.136492 0.0222062
+0.0243441 0.0535282 0.0420575
+-0.0779175 0.0954136 0.0361479
+0.0233436 0.112218 -0.0129499
+-0.0707139 0.0721775 0.0349299
+-0.0640765 0.0658063 0.0313225
+-0.012499 0.112778 0.04085
+0.00184795 0.0345666 0.017115
+-0.0706528 0.0621972 0.0100461
+-0.0885678 0.139164 0.0111992
+-0.0188224 0.0347384 0.0467634
+-0.0867734 0.103584 0.00638913
+0.0585617 0.0692487 0.0195963
+-0.0597919 0.0868174 -0.0202685
+0.00547344 0.0964656 -0.0281399
+0.0206378 0.123881 0.0271063
+-0.0699457 0.0641869 0.00125597
+-0.0625615 0.156051 0.017016
+-0.0417544 0.0339701 -0.0279962
+-0.0649712 0.129694 -0.00875388
+-0.0862104 0.107661 0.0103578
+-0.0932554 0.121405 0.0112928
+-0.0354965 0.0533413 0.0383699
+-0.0288938 0.0821008 0.0456772
+-0.0504899 0.115263 0.0337703
+0.0589314 0.0635744 0.022157
+-0.0186162 0.0391183 0.0377018
+-0.00206852 0.0346139 0.0433223
+-0.0274904 0.108416 0.0392888
+0.0114791 0.0353993 0.0291949
+0.0231094 0.1217 -0.00313916
+-0.0577454 0.0767844 -0.0191155
+-0.00909377 0.175718 -0.0267745
+0.0517415 0.0673755 0.000499527
+-0.0128851 0.164546 -0.0183954
+-0.0673534 0.170861 -0.0570311
+-0.0929853 0.13101 0.0212315
+0.0234643 0.0889079 0.0481435
+-0.088271 0.126713 0.00126975
+-0.0657845 0.0809163 -0.0181411
+-0.0623578 0.139562 0.0361839
+0.0537838 0.0608937 0.0284739
+-0.0417084 0.0681156 -0.0160245
+0.0391698 0.101249 -0.00580082
+0.0314319 0.059214 0.0400505
+-0.0609535 0.135292 0.0364528
+-0.000337321 0.0338454 -0.0216338
+-0.0194278 0.169807 -0.0142312
+-0.0348191 0.0886631 -0.024431
+0.0343015 0.0925788 -0.0159761
+-0.0484766 0.166987 4.90724e-06
+-0.0665297 0.149283 -0.0337543
+-0.0801184 0.0845811 0.0344552
+-0.0728936 0.109289 -0.00959602
+-0.0631344 0.177233 -0.0567528
+-0.0405211 0.16525 0.00379284
+-0.0231365 0.166757 -0.0180638
+0.00733914 0.0539337 -0.0304234
+-0.0448725 0.105637 -0.0203982
+-0.0120489 0.177175 -0.0228491
+-0.0935183 0.117402 0.0193034
+-0.0218743 0.178667 -0.0141782
+0.0371376 0.0728556 -0.0127896
+0.00251304 0.0828672 0.0572444
+-0.0659599 0.128235 -0.00885739
+0.0572369 0.0523165 0.0201815
+0.00234985 0.1177 -0.0168004
+0.0136405 0.0534411 0.0494225
+0.0440001 0.081852 -0.00180195
+-0.0352323 0.0337248 0.00491425
+-0.0852903 0.152844 0.0238067
+-0.0841107 0.0938743 -0.00455389
+-0.0327087 0.156604 0.00170747
+-0.0136478 0.0384232 0.0249573
+0.0203982 0.126887 0.0157559
+-0.0256832 0.0878506 0.050771
+-0.0859766 0.117044 0.000228439
+-0.0275277 0.0660102 0.0388181
+0.0386899 0.0941002 0.0332667
+-0.0072203 0.0994662 -0.0253456
+-0.0387089 0.068094 -0.0155018
+-0.0447414 0.149173 0.00704529
+-0.037003 0.126393 0.0195465
+-0.0691196 0.118603 0.052746
+0.0126876 0.0376693 0.0445214
+0.00235997 0.0496442 -0.0301148
+-0.0852421 0.0804972 0.00551565
+-0.0315104 0.105689 0.0403731
+0.045017 0.0410596 0.00889517
+-0.0645229 0.0335011 -0.00443342
+-0.0237309 0.092173 -0.0338912
+-0.0696939 0.158144 -0.0499358
+-0.00649106 0.116924 0.0392844
+0.0203532 0.0579488 -0.0270415
+0.0454669 0.0761165 0.0216249
+-0.0776599 0.103464 0.0342449
+-0.0732 0.113624 0.050147
+-0.0760799 0.147225 -0.00886324
+0.0300894 0.118197 0.0250757
+0.0134949 0.103141 0.0462202
+-0.0890108 0.142042 0.0341592
+-0.0804084 0.0719394 0.00662383
+-0.0695221 0.143851 -0.0150076
+-0.0608967 0.108264 -0.0166058
+0.024601 0.0954054 -0.0210454
+-0.022965 0.108799 -0.0212234
+-0.0611808 0.060116 0.0210055
+0.0302694 0.104198 -0.014346
+-0.0556068 0.119255 -0.0119973
+0.0521834 0.0709362 0.0231159
+-0.0314011 0.159502 0.00180977
+-0.0393243 0.172677 -0.00992732
+-0.0273795 0.0859709 -0.0356537
+-0.0158141 0.084157 -0.0391976
+-0.0748503 0.150353 0.0378605
+-0.0898842 0.145774 0.0282412
+-0.0830081 0.135296 -0.00152379
+0.00239673 0.0404932 -0.0244502
+0.0427154 0.0482477 0.0316879
+-0.0266384 0.166791 -0.00886205
+0.0140069 0.0433574 0.0445182
+-0.0554949 0.102938 0.0419937
+-0.0535677 0.121244 0.0365515
+-0.091536 0.147482 0.0221363
+-0.0926871 0.118696 0.0103064
+-0.0944412 0.121464 0.0182801
+-0.0562674 0.0521079 0.00770249
+0.0268173 0.0563551 0.0421393
+0.0126767 0.102031 -0.0220157
+-0.0753389 0.14722 -0.0108566
+-0.0856054 0.119006 0.0487694
+-0.0533885 0.122494 -0.00938247
+0.0431078 0.0438619 0.0262578
+-0.0605291 0.0337655 0.01588
+-0.0126252 0.045057 -0.0279244
+-0.045035 0.131096 0.00921538
+-0.0885624 0.127032 0.0457658
+0.040497 0.0569389 0.0314027
+0.0364907 0.111851 0.00455337
+-0.0834729 0.144593 0.00316535
+0.0433385 0.080395 -0.00378638
+-0.0318429 0.0944059 -0.023975
+-0.0484939 0.0747239 0.0424157
+-0.0110217 0.175722 -0.0231509
+0.000137104 0.104495 -0.0221519
+-0.0521218 0.0553341 0.025863
+0.0390662 0.103279 0.0267541
+-0.0365034 0.105591 0.0389607
+0.0135363 0.0347941 0.0319644
+-0.0857201 0.113489 0.0456231
+-0.0225205 0.114038 0.037332
+-0.0424861 0.107068 0.0398635
+-0.0498903 0.161248 0.00701432
+-0.0261589 0.0660162 -0.0325063
+-0.061193 0.167783 -0.0585846
+-0.0153476 0.186173 -0.0245951
+-0.0220085 0.0386415 -0.0116054
+-0.0746541 0.0660086 0.0112783
+-0.0857094 0.107615 0.00636703
+-0.000110081 0.106984 -0.0213197
+-0.0293764 0.039648 0.0531021
+0.028771 0.0495105 -0.0157345
+-0.0168713 0.184583 -0.0192109
+-0.0517714 0.14934 0.0163945
+-0.059475 0.0776368 0.0428908
+-0.0109445 0.0385116 0.00732721
+-0.0636281 0.177112 -0.0556446
+-0.074576 0.0901236 0.0400162
+0.0161292 0.0604031 0.0495734
+0.022982 0.114019 0.0351746
+0.0259399 0.098006 -0.0197455
+-0.0097165 0.0698878 -0.0366754
+-0.069561 0.132665 0.0486469
+-0.0530949 0.0350628 -0.012244
+-0.0680607 0.153823 -0.0498908
+-0.0135439 0.125168 0.0294386
+-0.00340282 0.12679 -0.00651364
+-0.0391911 0.149452 0.000405422
+-0.0764653 0.177807 -0.0519745
+-0.0287178 0.121983 -0.00700749
+-0.0619687 0.155933 0.0215789
+-0.0411389 0.0448599 -0.0213399
+-0.0553956 0.0560936 -0.00341211
+-0.0930152 0.116045 0.0163142
+-0.0538732 0.0634525 0.0320061
+-0.0265911 0.123944 0.0203778
+0.0521155 0.073659 0.0142686
+-0.0733241 0.158247 -0.0319134
+-0.0109096 0.167211 -0.0224966
+-0.0387656 0.0459335 -0.0222844
+-0.0438685 0.104239 -0.0209341
+-0.0404958 0.0464911 0.0408136
+-0.0546568 0.133929 0.033262
+-0.0875345 0.0914089 0.00446769
+0.0213976 0.0505253 -0.0237217
+0.00734362 0.0524803 -0.0298755
+0.0300864 0.0686462 0.0416997
+0.0343005 0.110021 0.028645
+0.0541591 0.0648613 0.0272743
+-0.0267629 0.124714 0.018819
+-0.084006 0.130916 -0.00261237
+-0.032464 0.126152 0.0167563
+0.0411083 0.0816433 -0.00876203
+0.0569799 0.0538694 0.0224893
+-0.0104937 0.0502816 0.0505289
+-0.0809192 0.0899278 0.0336764
+-0.0706578 0.10688 0.0373417
+-0.0634399 0.160562 -0.0195565
+-0.0491873 0.165537 -0.00392571
+-0.0506864 0.137014 0.00141591
+0.0414602 0.0985756 -0.00280597
+-0.0725308 0.161023 -0.0389355
+-0.0593508 0.0339548 0.0212701
+-0.0724089 0.155986 0.0106072
+0.0454654 0.0819915 0.0211715
+-0.0231673 0.169718 -0.0195033
+0.014393 0.129494 0.0163965
+-0.0185111 0.0499058 0.0467842
+-0.0180519 0.128104 0.0102643
+-0.0161793 0.169751 -0.0220442
+0.0178585 0.0957539 -0.0234025
+0.0277062 0.122023 0.0113437
+-0.0356288 0.0533886 -0.010251
+-0.00862621 0.0394649 0.0376552
+-0.0708134 0.0624523 0.0134268
+-0.0338786 0.104305 -0.0212068
+-0.0471517 0.160622 -0.00754132
+-0.0925898 0.124211 0.034269
+-0.0584616 0.0717087 0.039721
+-0.0146591 0.0511639 -0.0318396
+-0.0607891 0.0597911 0.00342454
+0.0222547 0.0819067 -0.0260667
+0.0230644 0.109683 -0.0142211
+-0.0844174 0.110829 0.0409213
+-0.0687289 0.0779401 -0.0161359
+-0.0752643 0.0941545 0.0391883
+-0.0876028 0.105024 0.0163629
+-0.077844 0.114867 -0.00473455
+-0.0325542 0.0341026 -0.0206973
+-0.0589604 0.0340153 0.0230639
+-0.00211759 0.125578 0.0320366
+0.0126989 0.0342761 -0.010037
+0.013184 0.0740073 0.0542309
+-0.0477691 0.130137 0.000614804
+-0.0718381 0.155405 -0.0399144
+-0.0622568 0.148888 -0.00391238
+-0.0159434 0.0385311 0.027994
+0.0373005 0.103362 0.0294506
+-0.02276 0.093942 -0.0316991
+-0.0520122 0.14159 0.0203687
+-0.082015 0.110886 0.0432009
+-0.0745865 0.0720219 0.0307608
+-0.00953059 0.096141 -0.0318625
+-0.0495789 0.046041 -0.00928879
+-0.00423381 0.0382248 0.0479393
+-0.0382126 0.169665 -0.0124129
+0.0318584 0.0981802 0.0392129
+-0.0314643 0.126198 0.0141678
+-0.0622546 0.152185 -0.0195775
+-0.0424907 0.0831788 0.0422885
+-0.0205087 0.18589 -0.0190712
+-0.00369262 0.0366899 0.0482034
+-0.0197122 0.0583602 -0.0339067
+-0.0106092 0.0434444 -0.026227
+0.0245832 0.0562081 -0.0237654
+-0.0891532 0.121635 0.0465292
+-0.0629277 0.161435 -0.0535909
+0.047295 0.0711844 0.0046334
+-0.0417522 0.0782987 -0.0193601
+-0.000496629 0.0828922 0.0574621
+-0.0320822 0.0335961 -0.0276233
+-0.0571072 0.154583 -0.000558004
+0.0584978 0.0634546 0.0229811
+-0.0581231 0.149655 0.0336366
+-0.0619701 0.160031 -0.0245798
+-0.0800787 0.0980611 0.0339873
+-0.0219645 0.0403079 0.0539432
+-0.0699065 0.110817 -0.0106385
+-0.0725366 0.154032 -0.0369032
+-0.0224974 0.0498852 0.046496
+0.00485548 0.0339942 -0.0207847
+-0.0614772 0.0338873 0.0155724
+0.00946392 0.0472926 0.0483305
+-0.019502 0.109944 0.0407387
+-0.0539465 0.0486826 0.012352
+-0.0355502 0.175589 -0.0109785
+-0.0784832 0.155333 0.0128492
+0.0266099 0.122879 0.0123678
+-0.0472066 0.134653 0.0142236
+-0.0078767 0.103255 -0.023393
+-0.0504989 0.101536 0.0421291
+-0.0266231 0.0450263 -0.028096
+-0.0916243 0.131038 0.0282288
+0.0125747 0.0445985 0.0442752
+-0.0196537 0.0480066 -0.0290701
+0.0172432 0.108764 -0.0171862
+-0.0295071 0.0635474 -0.0264265
+-0.0620034 0.040777 0.0431481
+-0.00243593 0.113721 -0.0185019
+-0.0630177 0.135513 -0.00745136
+0.0433285 0.0874073 -0.00479371
+-0.0154888 0.0688106 0.054717
+-0.0882956 0.116235 0.0458325
+-0.0494969 0.0946343 0.044743
+-0.0619637 0.147832 -0.00431835
+-0.092816 0.124239 0.0392636
+-0.0629366 0.147438 -0.0146052
+-0.0782928 0.163856 -0.0319501
+-0.064798 0.174285 -0.0502768
+-0.0112267 0.038611 -0.000125945
+-0.0820175 0.148708 0.00217249
+0.0401192 0.0979552 0.0282751
+-0.0877344 0.132461 0.0447656
+-0.050513 0.143196 0.0143929
+0.0136958 0.0672461 0.0531523
+-0.0608764 0.033777 0.0140174
+0.00552563 0.0813962 0.0561869
+-0.0768476 0.148423 0.040238
+-0.0306152 0.0552238 -0.0173804
+-0.0567885 0.123073 -0.00794084
+-0.0255089 0.119394 0.0308336
+0.0223261 0.116663 0.0342169
+-0.0475261 0.0335634 -0.00837623
+-0.0582936 0.157998 0.00361947
+0.0051303 0.105879 -0.0208781
+-0.00896496 0.0383664 0.01874
+-0.0444005 0.0336982 -0.00787213
+-0.00659427 0.0391448 -0.0257394
+-0.0414965 0.0424145 0.0425934
+-0.0846517 0.135301 0.0472783
+-0.0634992 0.0973124 0.0426152
+-0.0488679 0.135513 0.00441971
+0.037597 0.0883595 -0.0147642
+-0.00186878 0.0388962 0.0287527
+-0.028023 0.0380941 0.0277005
+-0.0474992 0.0718408 0.0410603
+-0.0899231 0.113261 0.00935255
+0.044663 0.094574 0.0141596
+-0.0613242 0.174126 -0.0596453
+0.0131192 0.0913894 0.0524895
+0.0569982 0.0642691 0.00177262
+0.029911 0.120086 0.0121698
+-0.0341992 0.124637 -0.00378015
+-0.0714932 0.121802 0.0535223
+-0.060211 0.120578 -0.00928669
+0.0514409 0.0718132 0.00596213
+-0.0055446 0.0384588 0.0102869
+0.0401137 0.0933035 -0.00871241
+-0.077868 0.12372 -0.00684832
+-0.0438994 0.148485 -0.00356582
+-0.0478093 0.0898718 -0.0219802
+-0.050356 0.0501549 0.0156949
+-0.044116 0.168361 -0.0078879
+0.0274031 0.12156 0.0212208
+-0.0198084 0.119865 -0.0108751
+-0.00808629 0.0392239 0.0361848
+-0.074679 0.177203 -0.0452121
+-0.0717079 0.162415 -0.0429474
+-0.0817249 0.153192 0.027965
+-0.0830361 0.0952877 0.0313817
+-0.0410879 0.12806 0.000341883
+-0.0268762 0.104433 -0.0231038
+-0.028867 0.0620809 -0.0264195
+0.0400441 0.0834026 0.0333734
+0.00148401 0.0427923 0.0460657
+-0.021597 0.124211 0.0236359
+-0.0493581 0.0389276 0.0456407
+-0.0251636 0.119759 -0.0107128
+-0.0305455 0.0776911 -0.0335901
+0.0434944 0.0719976 -0.00179535
+-0.0730641 0.148297 -0.027137
+-0.0403032 0.0335749 -0.0236075
+-0.0838696 0.117633 -0.00194246
+-0.0183958 0.0360837 -0.0274195
+0.0306925 0.119003 0.0181751
+-0.0287719 0.0876257 0.045371
+-0.0150862 0.116786 -0.0157023
+-0.0226105 0.0393974 -0.0288175
+-0.00549593 0.114185 0.0409403
+0.0172148 0.0820814 -0.0286624
+0.0204946 0.0878829 0.0490965
+0.0144377 0.119508 -0.0127985
+0.0084105 0.0389663 -0.0233493
+0.042717 0.0705281 -0.00378792
+-0.0721585 0.0349122 0.00711943
+-0.0700117 0.176166 -0.0463861
+-0.0559881 0.0594067 0.0225062
+-0.0934924 0.121416 0.0122906
+0.0386755 0.101225 -0.00680717
+-0.00386806 0.105937 -0.0224388
+-0.0104995 0.091174 0.0564817
+-0.0012394 0.131315 0.00922853
+-0.0497873 0.0855205 -0.0216876
+-0.0168713 0.104463 -0.0227606
+0.0101956 0.0865002 -0.0314726
+-0.0534959 0.108443 0.038977
+-0.0548951 0.0610993 0.0270145
+-0.0755046 0.137255 0.0498073
+-0.0485754 0.0489523 -0.00913959
+-0.0331264 0.163719 -0.0148995
+-0.00945074 0.100225 0.0471086
+-0.0342862 0.0340473 0.0246456
+-0.0294128 0.0335741 -0.023325
+-0.026685 0.0349864 0.0500364
+-0.061923 0.12237 -0.00883821
+0.0501668 0.0567787 0.0302284
+-0.011856 0.127622 0.0255897
+-0.0429498 0.0338754 -0.00590515
+-0.000398209 0.131157 0.00667235
+-0.0163397 0.112374 -0.0190184
+-0.0651151 0.138224 0.0409979
+0.0355326 0.0544702 -0.00765701
+0.0264528 0.0348348 0.00531809
+-0.0438555 0.101385 -0.0214526
+-0.0234974 0.0498976 0.0468652
+-0.0436816 0.0651561 -0.0146099
+-0.00750789 0.0386054 0.00429878
+-0.0494719 0.0643044 0.0356628
+-0.0857911 0.0847131 0.0234468
+0.0202388 0.0735294 -0.0276011
+-0.0826135 0.153724 0.024657
+0.0377117 0.0799594 -0.0137509
+-0.0629014 0.0384346 0.017326
+-0.0564952 0.112508 0.0359017
+-0.00450514 0.0647631 0.0563697
+0.0228849 0.0849076 0.049031
+-0.0136101 0.17129 -0.0181213
+-0.0659308 0.168025 -0.05906
+0.00616007 0.130231 0.0233995
+0.0200475 0.0355684 0.0326031
+0.0207235 0.0355731 0.0309275
+-0.0914203 0.133738 0.0192152
+-0.0894168 0.0942943 0.0184246
+-0.0486795 0.137079 0.00840446
+-0.0268516 0.0981872 -0.024073
+-0.0296061 0.0499557 0.0431146
+-0.0645444 0.136771 0.0400377
+0.00960463 0.0369501 0.029234
+-0.0077992 0.0826766 -0.0378216
+-0.0705096 0.145613 0.0431794
+0.038042 0.109981 0.0137429
+-0.0323904 0.0346717 0.0421656
+0.0166765 0.12456 0.0286792
+0.0496183 0.0673428 0.0005193
+-0.0256005 0.175695 -0.0107936
+-0.0178219 0.0896296 -0.0373512
+-0.010186 0.0339025 -0.0217341
+-0.047823 0.0912927 -0.0217091
+0.0214379 0.121585 -0.00505488
+-0.063535 0.0741856 0.0400495
+-0.0175015 0.119559 0.0348485
+0.0378045 0.0701003 -0.0128173
+-0.06064 0.140962 -0.00527103
+-0.0745647 0.162191 -0.0132518
+0.0175747 0.0931801 -0.024649
+-0.0413443 0.159411 0.00325579
+-0.0692325 0.161954 -0.0115912
+-0.0598828 0.104039 -0.0184233
+-0.0275135 0.111195 0.0372083
+0.017284 0.0435398 0.0440147
+-0.043478 0.0633766 0.0405033
+0.0234516 0.0389975 0.0363054
+-0.0705331 0.144185 0.0442754
+-0.00248752 0.0897873 0.0564419
+-0.0728742 0.149812 -0.0379734
+0.0462595 0.0834414 0.00917612
+0.00549045 0.0459551 0.048539
+0.038562 0.0568882 0.0311978
+-0.0404973 0.10005 0.041322
+-0.0633155 0.125546 0.0454063
+-0.0425091 0.0520201 0.0393163
+0.00748602 0.041302 0.0454759
+-0.0652746 0.0378654 0.0394026
+-0.0208078 0.081314 -0.039065
+0.00735987 0.131518 0.0123881
+-0.0507686 0.0812185 -0.0210302
+0.0289317 0.0369927 0.000264038
+-0.0895362 0.119938 0.00329723
+0.0339261 0.0564017 0.0366181
+0.0387571 0.0780554 0.0349576
+-0.00249465 0.111426 0.042426
+0.0312166 0.0814571 -0.0197537
+0.00710696 0.112707 -0.0194319
+0.0182552 0.0736117 -0.028651
+-0.0747384 0.149908 -0.0288721
+-0.0142729 0.16729 -0.0212151
+-0.0796554 0.0776931 0.0301108
+-0.0308995 0.0385461 -0.0114399
+-0.0135011 0.162185 -0.0138332
+-0.062358 0.172308 -0.0618736
+-0.0779551 0.131028 -0.00606492
+0.0053093 0.0610791 -0.0314051
+-0.0622044 0.163118 -0.0415929
+-0.0875561 0.0900472 0.00346813
+-0.0693763 0.0627096 0.00438827
+0.0577316 0.0594186 0.0235899
+-0.076964 0.0686471 0.0102516
+-0.068516 0.156454 -0.00263594
+-0.0116226 0.0389602 0.0338935
+-0.053617 0.0500325 0.0119809
+0.0600963 0.059514 0.00816569
+-0.0667396 0.168684 -0.03081
+0.0461456 0.0820314 0.0061875
+-0.0433217 0.0391871 0.0438385
+0.0426589 0.0598822 -0.00401987
+-0.0496436 0.132456 0.0281905
+0.0526393 0.0635217 0.0285801
+0.0276786 0.107363 -0.0137282
+0.0429561 0.100122 0.0141624
+0.0420203 0.102869 0.0111608
+0.0352633 0.113355 0.0198926
+-0.0527821 0.0840792 -0.0215781
+-0.0731314 0.179106 -0.0550054
+-0.0772542 0.116219 0.0507045
+-0.0448961 0.131042 0.0121815
+-0.0659423 0.149401 -0.0328697
+-0.00381497 0.0882175 -0.036071
+-0.00434542 0.130565 0.019581
+0.0267602 0.0365817 2.43485e-05
+0.0169695 0.107204 -0.0175448
+-0.062502 0.0625858 0.0256444
+-0.00350098 0.0815126 0.05747
+0.000251433 0.0712294 -0.0349609
+-0.0113059 0.174226 -0.0217772
+-0.0348319 0.0943645 -0.0236767
+-0.0786972 0.0940445 0.0355566
+0.0177903 0.112808 -0.0155711
+-0.0318198 0.0887354 -0.0251772
+-0.0198038 0.0827175 -0.0390158
+-0.0190696 0.126125 0.000571573
+-0.0793168 0.102079 0.0331119
+0.021502 0.109802 0.0384228
+-0.0927296 0.124224 0.0362665
+-0.0209485 0.0682779 0.0508919
+0.041224 0.101389 -0.000814438
+-0.0468126 0.0898791 -0.022022
+-0.0348994 0.124334 -0.00549397
+-0.0341879 0.127198 0.0131711
+-0.049291 0.131272 -0.000642386
+-0.0359021 0.0337218 0.00658675
+-0.0837824 0.091132 -0.00556609
+-0.0335134 0.101547 0.0420338
+0.0210931 0.0429808 -0.0187308
+0.0424902 0.0555855 0.0321183
+-0.0557185 0.0570014 0.011057
+-0.0194912 0.112675 0.0392933
+-0.025189 0.156576 -0.00769163
+0.0400265 0.10701 0.00816505
+-0.0540901 0.153118 -0.00271435
+-0.00486253 0.101638 -0.0232055
+-0.0436472 0.0338067 0.00674466
+-0.0211436 0.168262 -0.0193322
+-0.0763578 0.141673 -0.00573846
+0.0465682 0.041911 0.0139236
+-0.0534989 0.109802 0.0378386
+-0.0811057 0.0748245 0.0195385
+0.0366496 0.0848209 0.0372394
+0.0520606 0.0608742 0.0294954
+-0.0810176 0.109646 0.0372868
+0.0260062 0.121547 0.0249766
+-0.0134941 0.0773082 0.0569169
+-0.0759274 0.108411 0.0376421
+0.0131577 0.0548631 0.0504935
+-0.0556243 0.0335264 0.0117574
+-0.0445311 0.119183 -0.0140568
+-0.0651138 0.155569 0.0262833
+0.0254608 0.100767 0.0422505
+-0.0354939 0.101471 0.0414493
+-0.0526525 0.152155 0.0150192
+-0.0578899 0.111162 -0.0167182
+-0.050471 0.0571806 0.032579
+-0.0881725 0.103664 0.0113862
+-0.0124346 0.0985527 -0.0264295
+0.0459022 0.0876188 0.00817319
+-0.0598831 0.0337324 0.0142605
+0.0420206 0.092566 0.0274869
+-0.0622887 0.152203 -0.0145776
+-0.0483961 0.150684 0.0105827
+0.00023463 0.0985537 -0.0263753
+-0.0719091 0.107919 -0.010771
+0.0379248 0.0575872 0.0318029
+-0.0684803 0.169194 -0.0285889
+-0.0388617 0.099995 -0.0218283
+-0.0776097 0.0796169 0.0342011
+0.00633113 0.0553726 -0.0306713
+0.0163088 0.048977 0.0444188
+-0.0838449 0.0817176 0.00149669
+-0.0216263 0.0341828 -0.0204844
+-0.0187634 0.0728738 -0.0388715
+-0.0626025 0.0388129 0.0247151
+-0.0373475 0.0347779 0.0107604
+-0.00558664 0.0376733 -0.0253626
+0.0599615 0.0678313 0.0171716
+-0.0295401 0.0904607 -0.0275932
+0.0284451 0.114053 0.0325229
+0.0418253 0.0830818 -0.00779351
+0.00746772 0.0343056 0.0166757
+-0.0865698 0.0833108 0.0104907
+-0.0729271 0.151083 0.037025
+-0.0781924 0.155673 0.0158655
+-0.0788514 0.116332 -0.0048797
+0.00512317 0.107303 -0.0203142
+-0.0103272 0.0383585 0.0166568
+-0.0348025 0.040194 -0.0297923
+-0.000491404 0.0814979 0.0573536
+-0.0290382 0.16386 -0.00530596
+-0.0694805 0.121794 0.053195
+-0.0704544 0.150585 -0.0434585
+-0.0639717 0.0459278 0.00771742
+-0.03056 0.124009 -0.00164624
+0.0144021 0.0780973 0.054252
+-0.0808546 0.140749 0.0461596
+0.0103353 0.0581557 -0.0299403
+-0.00949578 0.084298 0.0576062
+-0.0249013 0.0382346 0.0282196
+-0.0316389 0.0409999 0.051064
+0.0387381 0.0381712 0.0065938
+-0.0580729 0.0345066 0.0402882
+-0.0663198 0.150167 -0.0356652
+-0.064292 0.168172 -0.0605879
+-0.0314424 0.0679449 -0.0244554
+0.0603913 0.0595429 0.0161691
+0.0102649 0.129908 0.00205228
+-0.0440813 0.0336392 -0.0114358
+0.0309277 0.0497348 -0.00874
+-0.0267697 0.0750695 0.0452054
+-0.0791015 0.170034 -0.0382691
+-0.0864283 0.0954013 0.00141653
+0.00852849 0.0646614 0.0551736
+0.0473561 0.0503594 -0.00438005
+0.039601 0.107391 0.00564087
+-0.0861267 0.0833147 0.0194823
+-0.0786738 0.10815 0.0335843
+0.043481 0.0832455 0.0271768
+0.0281352 0.0915776 0.0443357
+-0.0298099 0.0677811 -0.0284707
+-0.0229012 0.115018 -0.0157633
+-0.0270064 0.0808968 0.0494715
+0.0404227 0.0885874 -0.0107894
+-0.087216 0.0937177 0.0257149
+-0.0690509 0.0654544 -0.0025414
+-0.0695527 0.04187 0.00402445
+0.00429234 0.0668529 -0.0329804
+-0.046755 0.0336866 -0.0157033
+0.0576125 0.0580597 0.0234109
+-0.000994561 0.129288 -0.0011666
+0.0454245 0.0904044 0.0131633
+-0.0438081 0.0899046 -0.0222231
+0.0199328 0.127154 0.0141603
+0.0114882 0.0963254 0.0495798
+0.0218142 0.117368 -0.0105004
+-0.0438465 0.0359346 0.00839642
+-0.0714426 0.0632696 0.00712846
+-0.0759079 0.150006 -0.00888842
+-0.06794 0.126772 -0.00890268
+-0.0343726 0.127227 0.0072164
+0.0578211 0.0537494 0.00717652
+-0.0483087 0.135537 0.00740851
+-0.0568342 0.0666429 0.0356476
+0.0481112 0.0431114 0.00725444
+-0.0425043 0.117982 0.0312159
+0.0144699 0.0976455 0.0479677
+0.0563061 0.0508424 0.00620646
+-0.0300578 0.163895 -0.00500569
+0.0102245 0.0823018 -0.0318649
+0.0598453 0.0608733 0.0191849
+-0.0620027 0.172528 -0.0545971
+-0.0197571 0.0971344 0.046022
+-0.0611783 0.167226 -0.0592729
+-0.00613038 0.0999315 0.0488982
+0.0488619 0.047436 -0.000620948
+-0.0208111 0.118967 -0.0119295
+0.00352005 0.0786345 0.0561775
+-0.071061 0.15959 -0.0439233
+-0.0765957 0.161076 -0.0289322
+0.0259255 0.123359 0.0149571
+-0.0746094 0.14858 -0.0188631
+0.0569296 0.058069 0.024171
+-0.0338241 0.152569 -0.00489392
+-0.0455023 0.0615609 0.0388319
+-0.0654625 0.143948 0.0405383
+-0.0560519 0.0345032 0.0407254
+-0.0709341 0.162789 -0.0122264
+-0.078067 0.144487 -0.00381208
+-0.094099 0.121442 0.0152795
+-0.00327736 0.0410332 0.0476549
+-0.0500433 0.165539 -0.00195268
+-0.0774288 0.0712256 0.0238415
+-0.00725841 0.0408714 0.048906
+-0.0833667 0.142023 0.0429747
+-0.0692361 0.153199 0.0337122
+-0.0360543 0.0398378 -0.0294769
+-0.0403231 0.0344611 0.0371557
+-0.0207576 0.069984 -0.0381379
+0.0122374 0.0737871 -0.031159
+-0.0241603 0.0665253 0.044272
+0.0399369 0.0860773 0.0331939
+-0.0809073 0.123633 -0.00507492
+-0.00964827 0.166616 -0.0197629
+-0.00664529 0.1307 0.0129838
+-0.0209361 0.0381808 0.0128466
+-0.0538563 0.0970443 -0.0219059
+-0.0662078 0.0723697 0.0374848
+-0.0398566 0.099981 -0.0216989
+-0.0494761 0.0600183 0.034326
+-0.0157667 0.0742966 -0.0389627
+-0.0875711 0.0977385 0.0245274
+-0.0529166 0.0566407 0.0191372
+0.000745542 0.0955759 -0.0312149
+-0.0688619 0.10089 -0.0150284
+-0.0130273 0.178658 -0.0225027
+-0.00548585 0.118301 0.0387556
+-0.063934 0.169417 -0.04458
+0.00224686 0.131192 0.0191047
+-0.0526917 0.0662141 -0.0112413
+0.0316126 0.104759 0.0353509
+0.0222548 0.0776918 -0.0264111
+-0.0685061 0.105552 0.0384458
+-0.0576201 0.135609 -0.00546838
+-0.00760577 0.128788 -0.000526473
+-0.0262755 0.0383516 -0.00662702
+0.0096904 0.0344726 -0.0051827
+0.0183649 0.0355244 -0.0106716
+-0.0892922 0.0996701 0.0134013
+-0.0748707 0.116421 -0.00675171
+-0.054019 0.0333099 0.015848
+-0.0927402 0.125562 0.0292626
+-0.00859312 0.0384098 0.0205847
+-0.0574617 0.0399955 0.0466824
+-0.0890962 0.0996533 0.0114017
+-0.0393675 0.120945 -0.0119262
+-0.0498057 0.144755 0.010389
+-0.0800056 0.108388 0.0313605
+-0.0694061 0.153071 -0.0482738
+-0.0529002 0.0701503 0.0387731
+-0.00979568 0.178776 -0.0277733
+-0.0749384 0.177982 -0.0467773
+-0.080224 0.0913049 0.0343483
+0.0274404 0.0399547 -0.00370609
+0.0064659 0.11274 0.0407332
+-0.0218179 0.0350986 -0.0195001
+-0.0723907 0.151114 -0.0412874
+0.00590733 0.0340449 -0.020637
+0.0460177 0.0800284 0.0189631
+-0.0576496 0.0629466 -0.00612077
+-0.0519433 0.0503866 0.0326949
+0.0377573 0.0757194 -0.0117756
+0.0434133 0.0930689 -0.00182579
+-0.0445007 0.165214 0.00483168
+-0.0196553 0.063928 0.0497256
+-0.0766812 0.154876 -0.00631355
+-0.0344859 0.0335245 -0.0299041
+0.0132509 0.0349689 -0.0195966
+-0.0264467 0.0459901 0.0505652
+-0.00131456 0.122836 -0.0102349
+0.0122169 0.129551 0.00276868
+-0.0137494 0.0383366 0.00873382
+-0.0445005 0.116602 0.0322264
+-0.0346258 0.0408721 -0.0296689
+-0.0706305 0.0401508 0.00122659
+-0.0765009 0.0716493 0.0271716
+-0.0708234 0.155869 0.0257344
+-0.0311277 0.0566897 -0.0153882
+-0.0896944 0.133694 0.0395953
+0.000231967 0.0783204 -0.0356621
+0.0338144 0.115724 0.00791606
+-0.0300912 0.15662 0.000215848
+0.0464982 0.0677769 0.0257597
+-0.0214151 0.0595466 0.0459898
+-0.0572298 0.0696188 0.0382761
+0.0366123 0.064635 0.0370437
+-0.0264937 0.0973851 0.0437224
+0.0404949 0.0513767 0.0324659
+-0.0350844 0.107815 -0.0201106
+-0.0205025 0.0486482 0.0489372
+-0.0610181 0.13697 -0.00676267
+-0.0906044 0.135075 0.015212
+-0.0194066 0.174211 -0.0159442
+-0.0394983 0.0719214 0.0419294
+-0.0883414 0.120307 0.04718
+-0.00748928 0.0978336 0.0520944
+-0.0846404 0.107661 0.0233457
+-0.0214945 0.10716 0.0418366
+0.0181073 0.0398088 -0.0196993
+0.0190777 0.0384168 -0.0157069
+-0.0636502 0.159498 -0.051954
+0.0283128 0.0754542 0.0444772
+-0.054074 0.15164 -0.0027148
+-0.083614 0.154208 0.0184012
+-0.056485 0.0343785 0.0390076
+0.0337482 0.102096 0.0349353
+-0.0782584 0.1764 -0.0490322
+0.0136057 0.0460076 0.0440344
+-0.00550326 0.0801395 0.0576107
+0.0334132 0.0849144 0.041374
+-0.0113988 0.126257 0.0287047
+-0.0655972 0.169628 -0.0389928
+-0.0832568 0.154212 0.0141255
+-0.0820934 0.0898659 0.0320222
+-0.067283 0.17966 -0.0595334
+-0.062529 0.150617 -0.0195776
+-0.0299377 0.0847457 -0.0326018
+0.0607552 0.0664989 0.0131533
+-0.0228597 0.101618 -0.023963
+-0.0618668 0.165619 -0.0600772
+-0.081854 0.0937329 -0.00756112
+-0.0679516 0.170855 -0.0560296
+-0.0295118 0.108456 0.0388793
+0.0482509 0.0539799 0.0309574
+0.00823122 0.079605 -0.0335706
+-0.0526044 0.041455 0.0460966
+-0.0496802 0.165544 -0.00294037
+-0.0910152 0.129688 0.0372352
+-0.0404973 0.0972715 0.0419896
+0.00850648 0.0772375 0.0559821
+-0.0717922 0.153989 -0.0428988
+-0.0507334 0.147965 -0.00270623
+0.0127323 0.0860509 0.0536553
+0.0565626 0.0508082 0.0192018
+-0.047499 0.10845 0.0392246
+-0.00917487 0.0875708 -0.0370938
+-0.0783316 0.0788746 0.032897
+-0.0896787 0.135012 0.00721892
+0.00550113 0.0883518 0.0561015
+-0.0423419 0.0335706 -0.0240051
+0.0405574 0.104219 0.0191648
+0.00286437 0.130486 0.00148286
+-0.0643911 0.133918 0.0402655
+-0.0620868 0.139878 -0.00655442
+-0.0557051 0.12209 -0.00891575
+0.0589396 0.0566475 0.0201757
+0.0386112 0.0603508 -0.0077511
+-0.0806595 0.0855046 -0.00754297
+-0.0718229 0.0965348 -0.0152102
+0.0459498 0.0806271 0.0191734
+-0.0515557 0.141366 0.000880581
+-0.0859779 0.0910726 0.0273961
+-0.0194809 0.0757644 0.0547346
+-0.0526104 0.0335154 0.00699108
+-0.080479 0.155159 0.0180021
+-0.0500595 0.117739 -0.014504
+-0.0638596 0.0939187 -0.018635
+-0.0469776 0.034208 0.0289371
+0.0315208 0.0994913 0.038731
+0.0444927 0.0610909 0.0304355
+0.0212529 0.1262 0.0189269
+-0.0254692 0.0509386 0.0434079
+0.0476579 0.0715472 0.019969
+0.022698 0.118017 -0.00920048
+-0.0384222 0.125448 0.0219859
+-0.038314 0.170034 -0.0122167
+-0.0530543 0.14469 0.0223994
+-0.00492317 0.0389099 -0.00470281
+0.0373499 0.0533605 -0.00643641
+-0.0696712 0.171569 -0.0347594
+0.0436954 0.0959268 0.0201595
+0.0285253 0.065965 0.0429423
+-0.0466394 0.0345455 0.0392313
+0.0412883 0.0886287 0.0299331
+-0.0251747 0.0383636 -0.0175696
+-0.0674763 0.168038 -0.0560148
+-0.0634115 0.166723 -0.0396505
+-0.0443984 0.0671335 0.0404051
+-0.0524987 0.100127 0.0423619
+-0.0837023 0.110333 0.0361338
+-0.0757541 0.0819089 0.037226
+-0.0475033 0.0973719 0.0436212
+-0.0418104 0.0899475 -0.0227382
+-0.0308563 0.174216 -0.00433975
+-0.00771604 0.130016 0.0212618
+-0.0691125 0.156051 0.011784
+-0.049655 0.0664173 -0.0130805
+0.0212145 0.0401172 -0.0107008
+-0.0418108 0.128972 0.0103834
+-0.0623408 0.164683 -0.0455908
+-0.0776167 0.145877 -0.00384676
+0.0294578 0.079544 0.0444105
+-0.052057 0.15088 0.0153954
+0.0551015 0.0521065 0.00221795
+-0.0568769 0.116868 -0.0135067
+-0.0856284 0.151402 0.00824006
+-0.0512523 0.116429 -0.0151143
+-0.0568623 0.0941345 -0.0215512
+-0.0153943 0.099814 0.0443638
+0.0368805 0.101462 -0.00941022
+-0.0293998 0.0355494 -0.0195486
+-0.040872 0.105663 -0.0204372
+-0.0279821 0.0821961 0.0475971
+-0.0106963 0.176084 -0.0292514
+-0.00933224 0.038323 0.0168951
+-0.0792032 0.10313 -0.00756064
+-0.0540718 0.118333 0.0357708
+0.00450074 0.0938217 0.0540732
+-0.0746595 0.15617 0.0170913
+-0.0708414 0.0994113 -0.0147342
+-0.0516111 0.0530832 -0.00753985
+-0.0486234 0.0532712 -0.0094518
+-0.031704 0.172718 -0.00384226
+-0.00272576 0.130091 0.00149765
+-0.092388 0.120024 0.00928585
+-0.037643 0.153612 0.00331291
+0.0356049 0.0577583 0.0355158
+-0.0668801 0.103821 -0.0153002
+0.0379456 0.10977 0.0171703
+0.0191769 0.0959952 -0.0230407
+0.0391807 0.0658814 0.0336832
+-0.0690863 0.0666121 0.0278101
+-0.089106 0.114375 0.0298659
+-0.0216155 0.0436703 -0.028439
+-0.0266188 0.0490904 -0.0254391
+0.000108091 0.0340814 -0.0198793
+-0.0171613 0.159788 -0.00903074
+0.041574 0.0397142 0.0168995
+0.019656 0.0347604 0.000281692
+0.00764804 0.128583 -0.00254334
+-0.0553782 0.151032 0.0287496
+-0.0528315 0.0558373 -0.00742005
+0.0115037 0.109883 0.0397133
+0.03545 0.105907 -0.00815474
+-0.0629114 0.115341 -0.0117985
+-0.0234208 0.172725 -0.0129655
+-0.0890673 0.101028 0.0173829
+0.0236359 0.056409 0.0445932
+-0.0187325 0.0374026 0.0529482
+-0.0394792 0.105608 0.0388858
+0.0151319 0.0603601 0.0498992
+-0.080949 0.137599 -0.00280806
+-0.0546196 0.0345652 0.0426785
+-0.0465281 0.033544 -0.0026564
+0.0395657 0.0998694 -0.00580754
+0.0101223 0.108705 -0.0195083
+-0.0104988 0.09255 0.056119
+0.0330296 0.116688 0.0147767
+-0.0910722 0.141959 0.0151878
+-0.00849613 0.0703395 0.0565554
+-0.0574961 0.0904385 0.0452768
+-0.0530142 0.0490552 0.0256583
+-0.0294931 0.0717523 0.039896
+-0.0311676 0.0348856 0.0474529
+-0.00876366 0.0347363 0.0436201
+-0.0666703 0.0612745 0.0188657
+0.0173575 0.0940342 0.0480767
+0.0284806 0.111435 0.0343318
+-0.0468308 0.0941893 -0.021914
+-0.0265985 0.0562164 -0.027412
+-0.0871843 0.135176 0.0441499
+-0.063207 0.06374 0.0280276
+-0.0345021 0.0647803 0.0405279
+0.0597837 0.0567045 0.0121686
+-0.0474843 0.0818872 0.0439119
+-0.0589237 0.11399 -0.014753
+-0.0490056 0.122549 0.0307687
+0.0548584 0.0611516 -0.00113589
+-0.0458004 0.0353434 -0.021332
+0.00134052 0.0539375 -0.0306386
+-0.0278278 0.177181 -0.00696301
+-0.0427537 0.0783105 -0.0194623
+0.00651372 0.089712 0.0551929
+-0.0494951 0.0819134 0.044146
+0.0305588 0.055351 -0.0157687
+0.0297469 0.0929269 0.0431563
+0.0125099 0.0519837 0.0495237
+0.0459653 0.0806289 0.018177
+-0.053548 0.149321 0.0244145
+-0.0317948 0.0651814 -0.020436
+-0.019834 0.0868717 -0.0379507
+-0.0119886 0.038466 0.00715809
+-0.0770198 0.170132 -0.03325
+-0.0269539 0.17866 -0.00745161
+-0.0756616 0.0695139 0.0239361
+-0.0474944 0.116586 0.0319739
+-0.0671319 0.0355924 0.0145398
+-0.0783661 0.108548 -0.00557568
+-0.0284012 0.0860445 -0.0346283
+0.0257301 0.0379057 0.0280361
+0.00740689 0.0389878 -0.0235836
+-0.0629696 0.131105 0.0405653
+-0.0380606 0.157756 -0.011216
+-0.0361107 0.0459963 0.0412564
+-0.053455 0.0625326 0.0304805
+-0.0731839 0.178324 -0.0475338
+0.0137018 0.0888713 -0.0301465
+-0.0894038 0.140678 0.0331776
+-0.0114925 0.06602 0.0547394
+-0.0853984 0.0872002 -0.00151975
+-0.00957697 0.128995 0.00181181
+0.0571986 0.0536922 0.00517882
+0.0181761 0.0974249 -0.0228373
+0.0414526 0.0425673 -0.000513932
+-0.0423634 0.121318 -0.0123099
+-0.0854479 0.0898939 -0.00155092
+-0.0136017 0.0392183 -0.0267222
+-0.0353577 0.174409 -0.00212011
+-0.0930586 0.122743 0.0102788
+0.0208421 0.0882147 -0.0254487
+0.000267595 0.0697483 -0.0342392
+0.0443612 0.0458824 -0.00271937
+-0.0794062 0.147442 0.0402641
+0.0285362 0.120755 0.0202147
+-0.0354498 0.0346389 0.0415402
+0.0189212 0.0875932 -0.0268145
+-0.0326685 0.0478014 -0.0229356
+0.0213046 0.0374522 0.0382518
+0.0119628 0.111848 -0.018535
+-0.0754368 0.114522 0.050709
+-0.0575342 0.0415089 -0.00843308
+-0.0289002 0.0348381 0.0445217
+-0.0558188 0.0336396 0.0205147
+-0.0294901 0.0946648 0.0450535
+0.0140142 0.0519753 0.0481823
+-0.0499383 0.162625 -0.0047964
+-0.0285131 0.111188 0.0369648
+-0.0777024 0.176292 -0.0501047
+-0.0458377 0.0970756 -0.021885
+-0.0647866 0.167644 -0.0344082
+-0.08472 0.111015 0.033569
+-0.0624074 0.1491 -0.0095736
+0.0455563 0.078849 0.0217954
+0.0386173 0.0673644 -0.0117551
+-0.0516941 0.147804 0.0164166
+-0.0638593 0.0953482 -0.0183667
+-0.0887889 0.117194 0.003272
+-0.0667452 0.0342007 0.0124321
+-0.0921816 0.132336 0.0152245
+-0.0790475 0.168047 -0.0349702
+-0.0445079 0.0424992 0.043443
+-0.0914924 0.12135 0.00727423
+0.00205109 0.0347195 0.0440743
+-0.0757523 0.0687815 0.0210323
+0.0254197 0.0394349 0.0320923
+0.0445209 0.095967 0.011159
+0.00418461 0.0908826 -0.0329329
+-0.0447434 0.0753343 -0.0181391
+0.0465277 0.0497043 0.0301725
+-0.0231678 0.124994 -0.000333927
+-0.0261386 0.0359205 -0.0192491
+0.000314733 0.0597904 -0.0332055
+-0.0664067 0.0336797 0.00582425
+-0.0179785 0.068344 0.053543
+0.0128834 0.035495 0.00385056
+-0.064012 0.0432207 0.0306772
+0.0356112 0.0942094 0.0375896
+0.0433586 0.0589158 -0.00469925
+-0.0741431 0.153026 0.0335308
+-0.0366764 0.0421455 0.0447176
+-0.0616357 0.158429 -0.0245888
+-0.0777899 0.164478 -0.0251991
+-0.0774203 0.177255 -0.0472003
+-0.0723466 0.0663158 0.0221054
+-0.00945876 0.0366145 -0.0165831
+-0.00782909 0.0896438 -0.0364286
+-0.0483458 0.0338972 -0.0143683
+-0.0548931 0.111218 -0.0174922
+0.0263272 0.0545944 -0.0208638
+-0.078467 0.147461 0.0407301
+0.0472196 0.0430325 0.00527833
+0.0313294 0.118714 0.0127065
+-0.00880796 0.0868775 -0.037347
+-0.054028 0.0344996 0.0411656
+-0.00639115 0.121199 -0.012466
+0.0300864 0.0564003 0.0398351
+-0.0790124 0.0782686 0.0315155
+-0.0134683 0.0964232 0.0523159
+-0.0763221 0.159003 -0.0110053
+-0.0600876 0.0367271 0.0456071
+0.0364957 0.049851 0.0316154
+0.00849848 0.0402756 0.0453316
+0.0205837 0.0754832 0.0508919
+-0.071014 0.148895 -0.037822
+0.0170761 0.115474 -0.0144429
+-0.063767 0.0615586 0.0227478
+0.0437965 0.0987467 0.00816432
+-0.0513326 0.0542594 0.0137993
+-0.0414552 0.0341096 -0.00949275
+0.0395669 0.101281 -0.00480928
+-0.0918243 0.128307 0.0322434
+-0.0474749 0.0945717 0.0440635
+-0.0704486 0.16924 -0.0264473
+0.027192 0.101376 -0.017349
+-0.0895884 0.114751 0.0258504
+-0.0713206 0.156784 -0.042915
+0.0384501 0.0914717 0.0346309
+0.0214747 0.0996539 -0.0214946
+-0.0106582 0.0527176 -0.0332954
+0.00773558 0.128847 0.0268569
+0.0202904 0.0912514 -0.02462
+0.00332905 0.0553943 -0.0309954
+-0.0921247 0.116117 0.0353113
+-0.0146765 0.0526113 -0.0325234
+-0.0657759 0.0410192 0.0130518
+0.0587274 0.0538199 0.013179
+0.0291394 0.102042 -0.0160578
+-0.0701142 0.0625797 0.0062174
+0.0457389 0.0876049 0.0111625
+0.00224905 0.118538 -0.0156887
+0.0520156 0.0596733 -0.00368903
+-0.0891532 0.136419 0.0102028
+-0.0400348 0.0344619 0.0337052
+-0.0461887 0.0335082 0.00469546
+-0.0923435 0.115998 0.0113188
+-0.00713141 0.127357 0.0287426
+0.0252624 0.0747714 -0.0251152
+-0.0453044 0.0587827 0.038737
+0.03635 0.0368836 0.00917982
+-0.0527446 0.0753599 -0.0182797
+-0.0728584 0.132623 0.0509226
+-0.00672844 0.0698676 -0.0361675
+0.0413912 0.0459759 -0.00421898
+-0.0201655 0.0348026 0.0446658
+-0.0641545 0.0391804 0.0263583
+-0.00246627 0.111608 -0.0202454
+-0.0134033 0.110892 -0.0194483
+0.043074 0.0401669 0.0073914
+0.0192967 0.0693907 -0.0288221
+-0.0619039 0.16157 -0.0305885
+0.00333358 0.0341967 0.0104872
+0.0421258 0.100042 0.000179811
+-0.0386776 0.11516 -0.0158482
+-0.00807178 0.0386982 0.0276584
+-0.0756134 0.163772 -0.0350068
+-0.0672387 0.155112 0.00519073
+0.0276118 0.053509 0.0397341
+-0.0779406 0.158305 -0.0189233
+-0.00470743 0.0627772 -0.0352137
+0.0325643 0.0981766 0.0384761
+0.0296733 0.0481683 -0.00874324
+0.0113105 0.059545 -0.0296135
+-0.0653574 0.0733073 0.0386226
+-0.0120884 0.101067 0.0439606
+-0.0268179 0.0735627 0.0438663
+-0.0513902 0.0530791 0.0216216
+-0.0678614 0.042287 0.00944731
+-0.0899071 0.133806 0.0352156
+-0.0122404 0.0385117 0.0269697
+-0.0719375 0.16298 -0.0125698
+0.0473212 0.0533258 -0.00537345
+-0.030503 0.0588732 0.0373493
+-0.0905557 0.120241 0.0451196
+0.0219406 0.0388423 0.0393076
+-0.0672891 0.178209 -0.0595336
+0.0302182 0.0535528 0.0382346
+-0.0815406 0.110006 0.0333062
+-0.0477684 0.0811966 -0.0205178
+-0.048671 0.138621 0.0113976
+-0.0562999 0.0506286 -0.00237306
+-0.0854189 0.0791501 0.00750351
+0.000105856 0.117482 -0.0165473
+-0.0624071 0.149633 -0.00268499
+-0.0682914 0.172271 -0.0560251
+-0.0642448 0.0333797 -0.00245942
+0.0203456 0.053671 -0.0267089
+-0.0711203 0.163576 -0.0137477
+-0.0126641 0.0511309 -0.0317686
+-0.066211 0.180426 -0.0565833
+0.0266688 0.0892152 -0.0224539
+0.01736 0.128384 0.0132094
+-0.0541813 0.154195 0.0142529
+-0.0799749 0.0710714 0.0163832
+-0.0379044 0.0336424 -0.0213286
+-0.0747588 0.0669346 0.0175421
+-0.0221189 0.12668 0.005878
+-0.0623544 0.152149 -0.0255836
+0.0137867 0.0377633 0.0443361
+0.0469104 0.0589185 -0.00506663
+-0.0188119 0.0964492 -0.0282644
+-0.000384494 0.130522 0.00237337
+-0.0647338 0.0418755 0.0296857
+-0.0418518 0.0999485 -0.0214177
+-0.0135206 0.0432479 0.0507363
+0.0314548 0.113206 0.0298812
+0.0211096 0.0343656 0.00467028
+0.0493524 0.0516707 -0.00371978
+0.0324504 0.0916248 0.0417895
+-0.0405477 0.118695 -0.0135582
+-0.0421609 0.128746 0.00435225
+0.00852878 0.034888 0.0362651
+-0.0599768 0.12527 -0.00809043
+-0.0624255 0.16468 -0.0465913
+0.0305387 0.114047 0.0302625
+-0.0209297 0.158088 -0.00822134
+-0.00449554 0.0633716 0.0561592
+0.00751849 0.0440876 0.0454461
+-0.0617319 0.160008 -0.0275856
+-0.00111302 0.130629 0.0207594
+-0.000792652 0.0894877 -0.0349748
+-0.0534886 0.0862338 0.0454573
+0.0102426 0.0752832 -0.032327
+-0.0866178 0.151117 0.0269024
+0.00586712 0.0991316 -0.0229749
+-0.018487 0.0772258 0.0557066
+-0.0220963 0.0623062 0.0451655
+-0.0263156 0.124827 0.00142734
+0.00449781 0.0519669 0.0532713
+-0.0318681 0.105727 -0.021166
+-0.034171 0.0822565 -0.0245355
+-0.0160192 0.104518 -0.0227486
+-0.0336086 0.0394857 -0.0301589
+0.0179261 0.0900567 0.048881
+0.028994 0.0915879 0.0438177
+0.0419459 0.0625408 -0.0027477
+-0.0623435 0.161536 -0.0425937
+0.0521127 0.0595383 0.0295528
+0.00603967 0.0344425 -0.0152712
+-0.0200036 0.0384998 -0.0166705
+0.0335055 0.0549395 0.0359782
+0.0413899 0.0475369 -0.00516876
+0.0571049 0.0594437 0.0244408
+-0.0642323 0.124186 0.0475964
+-0.0104933 0.0952299 0.0545267
+0.0183283 0.0593891 -0.0275077
+0.0556724 0.0698728 0.00398853
+0.02895 0.086199 0.0437135
+-0.00575467 0.1008 0.0460186
+-0.0117555 0.0969094 -0.0306933
+-0.0570352 0.129621 -0.00626418
+-0.06396 0.034704 0.0249317
+-0.0269668 0.0674701 -0.0325423
+0.00372222 0.0941665 -0.0317421
+-0.0708312 0.0951391 -0.0158707
+0.0351494 0.0633173 0.038442
+0.0303372 0.119206 0.0194646
+-0.0174811 0.118153 0.0357243
+-0.0928105 0.116053 0.0203106
+-0.012498 0.078722 0.0572931
+0.0102589 0.100444 -0.0223447
+0.0311369 0.0982118 0.0399163
+-0.0870966 0.0995146 0.0044219
+0.0372771 0.100696 0.0312566
+-0.0464652 0.16842 -0.00496016
+-0.0340766 0.172586 -0.0145127
+-0.0632966 0.144361 -0.00960502
+-0.00396533 0.128634 -0.00247998
+-0.0810179 0.0964125 -0.00756981
+-0.0296304 0.159454 -0.0131553
+0.0323433 0.0592178 0.0396143
+0.0171685 0.0490344 0.0439112
+-0.0798847 0.0706373 0.0145533
+0.00550249 0.0758881 0.0564988
+-0.0285046 0.0588067 0.036767
+-0.054422 0.152991 0.0228754
+-0.0663081 0.150341 0.0377708
+-0.0409099 0.173193 -0.0056112
+-0.00259587 0.0391262 -0.0253465
+0.0394316 0.0807401 0.0342345
+0.048793 0.049707 0.0281736
+-0.0225905 0.0365035 -0.0286129
+-0.0185117 0.0387718 -0.0147573
+-0.0889514 0.121274 0.00229944
+0.0255827 0.034587 0.0128177
+-0.0258582 0.100162 -0.023852
+-0.0317095 0.0382098 0.0512104
+-0.0608875 0.104029 -0.0182853
+-0.0577034 0.0591273 0.0216745
+-0.0316861 0.0553325 -0.0133983
+-0.0579004 0.0336435 0.0147513
+-0.050636 0.0604891 -0.0105672
+-0.0484979 0.101507 0.0419588
+-0.0735846 0.159652 -0.032921
+-0.0596849 0.136693 0.0347693
+-0.0527883 0.0490273 0.0246529
+-0.00587038 0.038496 0.0083708
+0.0443161 0.095966 0.0141619
+-0.0355281 0.0832646 0.0432735
+-0.0552893 0.160933 0.00328411
+-0.0694051 0.177621 -0.0490523
+0.0553162 0.0608807 0.0271604
+-0.0115038 0.082913 0.0576973
+0.00149573 0.118307 0.0388892
+-0.0643923 0.178295 -0.0607754
+-0.0696234 0.0702067 -0.00731499
+-0.0684446 0.156174 0.0134711
+-0.0631402 0.158352 -0.0425984
+-0.028277 0.0807444 0.0465032
+-0.0851037 0.143224 0.00618561
+-0.0701909 0.171451 -0.0335218
+-0.0542038 0.149302 0.0263885
+-0.0230864 0.0416339 0.0540702
+-0.0848397 0.124371 0.0492354
+-0.0509437 0.0349503 0.0448676
+0.0147035 0.0490065 0.0456198
+-0.059742 0.156334 0.00641085
+-0.07522 0.0688188 0.0015368
+-0.0196569 0.0390707 0.0375255
+0.0459174 0.0834201 0.0141703
+-0.0785236 0.0894249 -0.0105705
+-0.0200463 0.0893341 0.0549931
+-0.0173075 0.11558 -0.0164072
+0.000516136 0.0760027 0.0580883
+0.042165 0.0859172 -0.00778247
+0.0203197 0.0664896 -0.0280597
+-0.0604906 0.0959808 0.043977
+-0.00180047 0.0840422 -0.0369301
+0.0106204 0.119324 -0.014581
+0.000242427 0.128645 -0.00250259
+-0.0544918 0.0876045 0.0451014
+-0.081252 0.0993542 0.0322994
+0.0225815 0.0632207 0.0466294
+-0.0528036 0.129718 0.0341858
+0.0388075 0.10554 0.0251669
+-0.071237 0.156366 0.0212013
+-0.0419921 0.0349859 0.0415962
+0.0319555 0.0413937 0.028007
+-0.0465003 0.112564 0.0357108
+0.00310161 0.111606 -0.0202814
+0.0306552 0.102095 0.0374778
+0.0158981 0.0576764 0.0492073
+-0.036508 0.127508 0.00348399
+0.0403284 0.0574912 -0.00511853
+-0.06805 0.157495 -0.00534926
+-0.0870566 0.0847034 0.0124776
+-0.0785035 0.127443 0.053282
+0.0093755 0.0479282 -0.0271091
+-0.00151782 0.111398 -0.0200294
+-0.0386619 0.0336282 0.00792475
+-0.0321818 0.0666221 -0.0204419
+-0.0516478 0.0334795 -0.00363494
+-0.0505323 0.0346392 0.0434961
+-0.0871097 0.129792 0.0470428
+-0.00115829 0.0378141 0.0044798
+0.00250327 0.0351261 0.00210209
+0.0232927 0.0720269 -0.0262872
+0.0386441 0.0772022 -0.0107761
+0.00730214 0.0624461 -0.0313742
+-0.0601285 0.0334799 -0.007174
+-0.0311809 0.165241 -0.0158459
+-0.0456556 0.126096 -0.00729728
+0.01482 0.0920349 -0.0274402
+-0.0578658 0.154169 0.0274197
+-0.0766831 0.148629 -0.00786722
+-0.0548976 0.0574275 -0.00541424
+-0.0213746 0.0936314 -0.0333712
+-0.0795038 0.127439 0.0531413
+-0.0719602 0.0381531 0.00797803
+0.0465231 0.0539629 0.0319545
+-0.0327551 0.126411 0.00489661
+-0.0907403 0.135093 0.0162106
+-0.0798437 0.119249 -0.00499812
+-0.0195891 0.186548 -0.0163318
+-0.0336818 0.0474202 0.0430149
+0.0387003 0.0847793 0.034951
+0.005123 0.108732 -0.0201833
+-0.0355723 0.127236 0.00383072
+-0.0593755 0.0706339 0.0387044
+-0.0701237 0.0337481 0.00141754
+-0.0596389 0.0645563 -0.0073211
+-0.0247044 0.0349045 0.050534
+-0.0698349 0.155896 0.010068
+-0.00664542 0.0496313 -0.030799
+-0.0560508 0.049202 -0.00336342
+-0.0846449 0.0777798 0.00851725
+0.0428444 0.0958802 0.0241636
+0.0226208 0.0505695 0.0412719
+-0.0421939 0.165153 -0.0106292
+-0.0530779 0.153128 -0.00337034
+-0.0183995 0.128105 0.0144964
+0.0110096 0.125946 -0.00574203
+0.0135498 0.109816 -0.0183273
+0.0246987 0.1167 0.0323736
+-0.0323986 0.169744 -0.00487272
+0.0414995 0.0513848 0.032599
+-0.0820948 0.0748388 0.0105311
+-0.0771842 0.102138 0.0352151
+-0.0627985 0.161541 -0.0235962
+0.0203907 0.0490438 0.0415331
+-0.0284862 0.120462 -0.00941436
+0.00850898 0.0990197 0.0481875
+0.0181919 0.0781799 0.0527467
+-0.0323958 0.0383608 -0.00233468
+-0.0198811 0.121697 -0.00881459
+-0.0289402 0.154865 -0.00285823
+-0.055522 0.0600566 -0.00554029
+-0.0446949 0.0680713 -0.0159309
+-0.0505296 0.0657745 0.0361047
+0.0251595 0.0995713 -0.0194056
+0.0456643 0.0876028 0.0121678
+-0.0533672 0.143136 0.0253913
+-0.05283 0.138085 0.0270749
+-0.0324865 0.0974182 0.0443398
+0.00543862 0.118556 -0.0157347
+-0.0704807 0.1602 -0.00768602
+0.00476485 0.0378127 -0.0129945
+0.0453303 0.0875809 0.0171699
+0.00844159 0.109753 0.0403226
+0.0199305 0.0645206 0.0480779
+-0.0865012 0.0967606 0.00143514
+0.0239407 0.0433254 -0.00969837
+-0.0464991 0.0818806 0.0436011
+-0.0365053 0.0832925 0.043701
+-0.0511539 0.144707 0.0143676
+-0.0354688 0.0973337 0.0432864
+0.0315086 0.0361416 0.0180806
+-0.0620392 0.152203 -0.0175795
+-0.00174908 0.0726707 -0.0356483
+0.0482658 0.0482112 0.0273759
+0.0205204 0.0686316 0.0489712
+0.0055446 0.129937 0.0246284
+-0.0509363 0.126898 0.0333376
+0.0503401 0.0525815 0.0286903
+-0.0663805 0.0356243 0.0152158
+-0.0631059 0.039729 0.0160762
+-0.0794629 0.0702542 0.0118898
+-0.0440204 0.0437247 -0.0153148
+-0.0258047 0.0811626 -0.0373791
+-0.0654527 0.156561 -0.05302
+-0.0801896 0.0926573 0.034266
+-0.0226625 0.0493576 -0.0281762
+-0.076512 0.15561 -0.00689633
+-0.0316228 0.0384779 -0.00967109
+0.0073096 0.0609801 -0.0307365
+-0.036779 0.0827886 -0.0223365
+-0.0454595 0.0846983 0.0440929
+-0.0310517 0.0636961 -0.0214339
+0.044971 0.0748214 0.0226935
+-0.0245671 0.182966 -0.016053
+-0.0343794 0.125292 -0.00246071
+0.0260218 0.0493062 -0.0196675
+0.00451349 0.0786214 0.0559314
+-0.0272596 0.0409813 0.0537728
+-0.0865558 0.105007 0.0203641
+-0.0427952 0.0347556 0.00787321
+-0.0294944 0.0889496 0.044252
+-0.0691615 0.0832998 0.0419252
+-0.077704 0.175863 -0.0450747
+-0.0595653 0.0407951 0.0449735
+-0.0118194 0.129824 0.0125318
+-0.0304269 0.169744 -0.0072967
+0.00750596 0.0674413 0.055134
+-0.0895098 0.0942825 0.014433
+0.0566953 0.0550372 0.00319006
+0.0358581 0.0995241 -0.0113664
+-0.0541815 0.15229 0.0244282
+-0.0924737 0.125588 0.0362608
+-0.0750911 0.110634 0.0449752
+-0.0272685 0.0368017 0.0538626
+-0.0614955 0.104283 0.0410789
+-0.0721148 0.067315 0.0248191
+0.034236 0.094243 0.0391072
+-0.0724407 0.178857 -0.0487083
+-0.06691 0.033448 -0.00125687
+-0.0660379 0.0349778 0.0329828
+-0.0701097 0.156012 0.00122102
+-0.0157478 0.0352634 0.050467
+-0.0465076 0.160794 0.0071118
+-0.0156218 0.0365183 -0.0177136
+-0.00687536 0.0389886 0.0330493
+0.0201949 0.0959886 -0.0227072
+0.00536718 0.125777 0.0317922
+-0.0689036 0.105186 -0.0135662
+-0.0576505 0.0508003 0.0036576
+-0.0372877 0.0353832 0.0246264
+-0.0766222 0.0824671 -0.0115781
+-0.0570813 0.0344654 0.0405363
+0.0284042 0.0431456 -0.00552671
+-0.078005 0.151454 -0.00188508
+0.00274784 0.0953419 -0.0309592
+-0.0764328 0.147234 -0.00786196
+-0.0187399 0.0656914 -0.0372373
+-0.0626784 0.0670893 0.0340154
+-0.066213 0.0377522 0.0375383
+0.00946024 0.0346841 0.0420404
+-0.00763703 0.046711 -0.0299661
+0.0217664 0.106013 0.0404033
+0.0159395 0.0900955 0.0512828
+-0.0714939 0.126019 0.0527835
+-0.035368 0.122868 0.0260927
+0.0397669 0.0885289 -0.0117744
+-0.0235296 0.159196 -0.00227474
+-0.0299919 0.0383903 -0.00556396
+0.00840449 0.0360838 -0.0229864
+-0.0688351 0.0951745 -0.0162656
+0.0188202 0.124811 0.0265908
+-0.0542034 0.0477679 0.0266683
+-0.00718512 0.0384992 0.0226001
+0.0191993 0.0352366 0.0345338
+-0.0486962 0.13553 0.00541025
+0.0065027 0.0533154 0.0528127
+-0.064997 0.0410349 0.013689
+0.0235192 0.107033 0.0392433
+-0.0526101 0.0632972 -0.0100113
+0.0288769 0.120252 0.0217702
+-0.00882418 0.0896578 -0.0365764
+-0.0563459 0.0335397 0.00260276
+0.0287652 0.114389 -0.00726895
+0.0564669 0.0577845 0.00118215
+-0.0623836 0.163016 -0.0556039
+-0.0235351 0.118111 0.0331575
+0.0443232 0.0889197 0.0231574
+0.0349753 0.114037 0.00545779
+0.0269837 0.108749 0.0374141
+-0.000496913 0.056284 0.0547664
+-0.0889882 0.115854 0.0042936
+-0.0688144 0.0851338 -0.0175228
+-0.0304795 0.0746468 0.0405648
+-0.0616784 0.0692367 -0.0132074
+-0.0554108 0.0334149 -0.00799207
+-0.0610813 0.0342293 0.0311986
+-0.0655517 0.155937 0.0246661
+-0.0767597 0.163153 -0.0191399
+-0.0140741 0.0388251 0.0317136
+-0.02858 0.0731702 0.040795
+-0.0480086 0.134685 0.0198054
+-0.00949027 0.107257 0.0434611
+-0.0224071 0.0510134 0.0440995
+0.0026516 0.0341771 0.00670019
+-0.00282121 0.086807 -0.0363939
+0.00461042 0.092806 -0.0323339
+0.0444404 0.0425371 0.0222477
+-0.0251232 0.0838362 0.0531591
+-0.0711154 0.155676 0.00670049
+-0.0144639 0.0977101 -0.0275565
+-0.0176152 0.0407641 -0.0279656
+-0.0273216 0.038344 -0.00129213
+-0.0781679 0.14865 -0.00288263
+-0.071113 0.171733 -0.033865
+-0.0362701 0.0365605 0.0458807
+-0.0245074 0.0384654 -0.0082311
+-0.0768529 0.106269 -0.00826114
+0.0173624 0.088714 0.0498122
+-0.0872512 0.106353 0.0133638
+-0.0647985 0.124215 0.0485
+0.0274255 0.0686124 0.0431235
+-0.0275944 0.0717748 -0.0345689
+-0.00449702 0.0590031 0.0543234
+-0.00869265 0.0598566 -0.0344628
+-0.0624896 0.106999 0.0393995
+0.00296819 0.0986498 -0.0244883
+-0.0716108 0.0701594 -0.00639514
+-0.0454969 0.0733342 0.042072
+0.0217583 0.0505253 0.0417779
+0.0599479 0.0692188 0.0141571
+0.0159709 0.0859869 -0.0291978
+0.0474137 0.0671743 0.000684928
+0.045537 0.0890033 0.0131643
+0.025235 0.0690602 -0.0242719
+-0.0140104 0.117853 -0.0148385
+-0.0417786 0.156522 0.00614116
+0.0529468 0.0608894 0.0290245
+-0.0623778 0.167137 -0.0608155
+-0.043781 0.0422821 -0.0183128
+0.0194047 0.0727279 0.0509389
+-0.025431 0.180214 -0.00870569
+0.00163035 0.0962275 -0.0299038
+-0.0609057 0.119508 -0.00974426
+-0.0265539 0.180361 -0.00771033
+-0.00586693 0.104511 -0.0229142
+-0.0446124 0.0534121 -0.0108089
+-0.0607974 0.125499 0.0419374
+-0.0676844 0.160922 -0.0559942
+-0.0718937 0.0376106 0.00231258
+-0.0769618 0.103489 0.0349575
+-0.0136243 0.0450811 -0.0280269
+-0.0656393 0.145367 0.0403005
+-0.067848 0.0994807 -0.015636
+-0.0674005 0.156127 0.0138467
+-0.0814089 0.141772 -0.000809353
+0.0343092 0.113032 0.0252402
+-0.0378129 0.0900392 -0.0237743
+0.0410972 0.0779427 0.031296
+-0.0594968 0.104294 0.0413247
+-0.045045 0.0657131 0.0396946
+0.0424943 0.0569701 0.0318321
+0.0380924 0.0618152 0.0338774
+-0.0181385 0.038277 0.0223668
+-0.0680503 0.114246 0.0489904
+-0.089636 0.0902445 0.0164491
+-0.0259323 0.124597 0.000115117
+-0.0341212 0.124555 0.022076
+-0.0117695 0.075665 -0.0382916
+-0.0666005 0.156329 0.0184798
+0.0143467 0.0580862 -0.0289605
+0.00620145 0.0832401 0.0564613
+-0.07299 0.158232 -0.0339184
+0.0179038 0.0866718 -0.0278625
+-0.0447879 0.085543 -0.0216723
+0.0240528 0.0347605 0.00303304
+0.0471472 0.0437632 0.0216364
+-0.0254743 0.105723 0.0415881
+-0.0914335 0.120003 0.00730918
+-0.0381624 0.035793 0.0434599
+-0.0470742 0.127422 -0.00463291
+0.000501079 0.0620074 0.0565701
+-0.0488714 0.104198 -0.020417
+-0.00949444 0.063336 0.0558203
+-0.0227837 0.0742285 -0.0385317
+-0.00949145 0.115547 0.0400498
+-0.0665386 0.0804536 0.042224
+0.00148883 0.121012 0.0365952
+-0.024281 0.069418 0.0457102
+0.019893 0.114777 -0.0136897
+-0.0904011 0.115144 0.0307537
+-0.00370938 0.0627709 -0.0350699
+-0.00367406 0.0555102 -0.0326331
+-0.0125077 0.0773203 0.0572074
+-0.0574951 0.093265 0.0451928
+-0.0942113 0.120123 0.0212925
+-0.0213358 0.165379 -0.00997448
+-0.0615068 0.0789665 0.042503
+0.00239149 0.0343213 0.0156312
+-0.0639126 0.11101 -0.0139478
+0.0381439 0.103967 -0.00387277
+-0.0816033 0.101897 -0.00556882
+-0.0582639 0.12123 0.0402958
+-0.0729322 0.156105 0.0220745
+-0.0514974 0.086244 0.0456131
+-0.0876158 0.137864 0.0416648
+0.0120082 0.0967361 -0.024421
+0.0147782 0.0929392 -0.0263979
+-0.0510555 0.150177 -0.00351578
+-0.0165661 0.163924 -0.0100865
+-0.00519498 0.0390091 -0.00671136
+-0.021716 0.0641363 -0.0354017
+-0.0523357 0.136679 0.027812
+0.0335961 0.0633113 0.0397473
+-0.0384865 0.0492045 0.0394845
+-0.0339969 0.152567 -0.000573454
+0.0175453 0.0645325 0.0499023
+-0.0895247 0.139293 0.0351741
+-0.0870044 0.115772 0.00228167
+-0.0852267 0.0792333 0.0184927
+-0.0927665 0.116031 0.013321
+-0.0240588 0.111793 -0.0183639
+0.0191819 0.123133 0.0296014
+0.0163312 0.0767998 0.0535416
+-0.0834123 0.0856961 -0.00454328
+-0.0614974 0.0904473 0.0454009
+-0.0648003 0.0370671 0.0164284
+-0.0102366 0.125327 0.0306172
+-0.0512935 0.0556822 0.0305914
+-0.0674962 0.0930678 0.0426016
+-0.0707247 0.156767 -0.045914
+-0.0611468 0.0584317 0.0117762
+0.0152753 0.0680849 -0.0302874
+-0.0638387 0.163409 -0.0592654
+0.030267 0.0496887 -0.0107252
+-0.0227695 0.0684387 -0.0367377
+0.0216497 0.065881 0.0470485
+-0.0849335 0.125015 -0.00321773
+-0.0364959 0.0562316 0.0392716
+-0.0132153 0.0406258 0.0508237
+0.00695506 0.0982177 -0.0239936
+0.00047843 0.12713 -0.00487855
+0.0354045 0.046148 -0.00604177
+-0.0913848 0.129679 0.0322355
+-0.0924762 0.124198 0.0322659
+-0.0057025 0.12744 -0.00517306
+0.032332 0.110047 0.0311032
+-0.0374975 0.0662835 0.0416878
+-0.0306651 0.155159 -0.000638202
+0.0161 0.12839 0.0198796
+-0.0392376 0.124806 0.0231803
+0.00131504 0.0597888 -0.0330641
+-0.0445007 0.0931064 0.043109
+-0.0174373 0.0336888 -0.022956
+-0.0536509 0.0343311 0.0291848
+0.0348249 0.110986 -0.0028353
+0.0280633 0.100998 -0.0169482
+0.0423903 0.0490515 -0.00589339
+0.0306614 0.119205 0.0153072
+-0.0604957 0.0876028 0.045161
+-0.0137303 0.0699989 -0.0380502
+-0.00750341 0.130405 0.00835201
+-0.0494799 0.116621 0.0323892
+-0.058737 0.075302 -0.0183386
+-0.0518764 0.0550741 0.0228473
+-0.0293899 0.118762 -0.0116358
+-0.0743199 0.158257 -0.0279194
+-0.0265758 0.0533991 -0.0263925
+-0.047508 0.0903548 0.0442194
+-0.0104972 0.0815462 0.0580111
+-0.0356136 0.0408304 -0.0293778
+-0.0622824 0.159968 -0.0396048
+-0.0727292 0.0730957 -0.00887693
+0.0252321 0.0889244 0.0471615
+0.0362811 0.0443655 0.0298564
+-0.0583717 0.138143 0.0331568
+0.0516174 0.0711387 0.00464104
+0.00649466 0.0427198 0.0454361
+-0.0187116 0.0598792 -0.0350421
+-0.0603468 0.0339987 0.0210215
+0.0310626 0.107429 0.0345663
+-0.0153967 0.0384283 -0.000805549
+0.0390675 0.0617702 -0.00778266
+-0.0718188 0.0907915 -0.0158595
+-0.0066784 0.0569449 -0.0331859
+0.00738229 0.0448872 -0.0251556
+0.0193881 0.0506007 -0.0247336
+-0.0171345 0.165288 -0.0183426
+0.0172728 0.0694422 -0.0295359
+0.0518225 0.072596 0.0200635
+-0.085483 0.140457 0.00319222
+-0.049383 0.140141 0.0133936
+-0.076884 0.155644 0.0221655
+-0.0584972 0.111135 0.0367864
+-0.0264895 0.102963 0.0427118
+-0.016526 0.0387631 -0.00875803
+-0.060493 0.107007 0.0395303
+-0.0133132 0.0385196 -0.000466347
+0.027107 0.0406036 0.0313674
+-0.0852773 0.137655 0.00128094
+-0.0776954 0.16804 -0.0399638
+-0.0465214 0.0505047 0.038174
+-0.0251912 0.178602 -0.0188241
+-0.0524991 0.101502 0.0417298
+-0.0142894 0.184628 -0.0268303
+0.00710791 0.110158 -0.019992
+-0.0766628 0.155608 -0.00789132
+-0.0814761 0.0734707 0.0145404
+-0.0644951 0.0789605 0.0422031
+0.0403539 0.105584 0.00317596
+-0.0633486 0.0371336 0.0178291
+-0.0808831 0.117721 -0.00384392
+-0.0265027 0.10847 0.0397156
+0.0236097 0.121674 0.028372
+-0.0623736 0.164689 -0.0415928
+-0.0495545 0.0404082 -0.0113965
+-0.0562131 0.054804 -0.00139993
+-0.0418518 0.098529 -0.0215916
+0.0133351 0.058103 -0.0291864
+-0.0594448 0.063179 0.0293052
+0.0113019 0.0652847 -0.0308368
+-0.0783582 0.0994351 0.0350546
+-0.0715439 0.0376425 0.00026118
+-0.0154996 0.112736 0.0400881
+0.0417289 0.0704356 -0.00679567
+-0.0406463 0.127804 0.0152535
+-0.0627661 0.170921 -0.0616075
+-0.0923057 0.12017 0.0426167
+-0.00727442 0.0422617 0.0488857
+0.0350851 0.0848737 -0.0178837
+-0.01578 0.128598 0.00819831
+-0.03217 0.0735917 -0.0275208
+-0.0673634 0.110954 0.0392365
+-0.0271001 0.0779439 0.0468281
+-0.0765081 0.156243 -0.00790412
+0.0277565 0.117474 -0.00457839
+-0.0113381 0.0986434 -0.0265191
+-0.0330823 0.0695155 -0.0204574
+-0.0652177 0.144322 -0.0140816
+-0.0094303 0.0379372 -0.0159242
+-0.0245144 0.0945317 -0.028309
+-0.05375 0.0560385 0.0116204
+-0.0679678 0.0383221 0.0123903
+0.00399334 0.0399971 0.0458959
+-0.0841715 0.0870272 0.0285556
+-0.0274573 0.0734015 0.0426855
+-0.0626773 0.153684 -0.0325991
+-0.0741408 0.105214 0.0369385
+-0.0134986 0.081495 0.0573009
+0.0463327 0.0421886 0.017365
+-0.0644937 0.108375 0.0384047
+-0.0653695 0.151233 0.0366147
+-0.018937 0.178659 -0.0169738
+-0.0820692 0.0748107 0.00351555
+-0.0841353 0.146019 0.0379782
+-0.0148578 0.163977 -0.0174595
+-0.0817263 0.0747702 0.00249857
+0.000235601 0.0740952 -0.0356038
+0.000940682 0.0357179 -0.0155776
+-0.0719363 0.129668 -0.0086833
+0.0301411 0.102934 -0.0150039
+-0.0651961 0.0334974 -0.00275965
+-0.0185844 0.16399 -0.00948536
+-0.0592125 0.042121 0.0445708
+7.57538e-05 0.0369473 0.00366537
+0.0152945 0.0666369 -0.0299356
+0.0410157 0.0739041 0.031202
+-0.0577153 0.0344512 0.0421091
+-0.0920793 0.129683 0.0282033
+-0.0497426 0.0753235 -0.0177986
+-0.0484934 0.047761 0.0395051
+-0.0809803 0.104706 0.0304576
+-0.0746935 0.111142 -0.00760178
+0.0204806 0.109788 0.0388648
+-0.0734977 0.128836 0.0522844
+-0.0426178 0.0520018 -0.0109441
+0.0112198 0.0932651 -0.0287439
+-0.0119274 0.182669 -0.0262872
+0.0145534 0.0347576 0.0376203
+-0.0810222 0.100509 -0.00657927
+-0.0033633 0.038102 0.0128662
+-0.0937861 0.128264 0.0182441
+0.0084061 0.0949783 -0.0285638
+-0.0695902 0.113495 0.0492959
+0.000169576 0.131258 0.0183392
+-0.0931626 0.117374 0.0143043
+-0.0195343 0.112367 -0.0190097
+-0.0524215 0.162453 0.00456363
+0.0184901 0.0879016 0.0492476
+-0.0685433 0.170852 -0.0550244
+-0.087182 0.130813 0.00128919
+0.00130454 0.0641388 -0.0343264
+-0.000757317 0.075519 -0.0359212
+0.0308776 0.0902792 0.0430757
+-0.00578939 0.0386518 0.00278679
+-0.076212 0.155059 0.00635026
+-0.0248315 0.0881388 -0.0362597
+-0.0222598 0.160103 -0.0129456
+-0.00877699 0.0770434 -0.0377883
+-0.06674 0.0383979 0.0141071
+-0.00350265 0.0689326 0.0566398
+-0.0295614 0.0861399 -0.0326125
+-0.0286647 0.125711 0.0122564
+-0.0699648 0.0791315 0.0398469
+0.0142764 0.128727 0.0220636
+-0.0638003 0.110914 0.037425
+-0.0719625 0.135504 -0.00769556
+-0.0527869 0.124083 0.0359567
+-0.0467161 0.0738381 -0.0169211
+-0.0117423 0.070003 -0.0378791
+-0.0517809 0.138537 0.023394
+-0.00482205 0.130969 0.0150835
+0.034711 0.0383001 0.0222555
+-0.00127486 0.120883 -0.0121504
+0.0112227 0.0850587 -0.0310098
+-0.0506063 0.0369029 -0.0119734
+0.0433147 0.0831895 0.0275132
+0.0112941 0.127457 0.0281604
+0.0151622 0.122267 0.032438
+0.0400834 0.082061 0.0334038
+-0.0745622 0.152707 -0.0248951
+-0.0528479 0.141625 0.0244146
+0.0245482 0.035172 0.0211866
+-0.0325075 0.11115 0.0364446
+0.0417109 0.0957641 -0.00380547
+-0.00538241 0.130597 0.0192035
+-0.0649174 0.0364897 0.025021
+-0.0770334 0.158982 -0.013085
+-0.0760388 0.148613 -0.0118618
+0.0283559 0.116347 0.030146
+-0.088594 0.121257 0.00130017
+-0.0268076 0.122539 -0.00562189
+-0.0346629 0.0607102 -0.0125376
+0.0413795 0.0505691 -0.00672382
+-0.0906746 0.1365 0.0201946
+0.00951942 0.100425 0.0477045
+-0.0642867 0.172466 -0.0611328
+-0.0242433 0.172722 -0.0123976
+0.00950564 0.0990636 0.0482467
+0.0101664 0.120462 0.0359466
+-0.0187755 0.107692 -0.0220397
+0.0335012 0.0795469 0.0414506
+-0.0834882 0.14321 0.00316117
+-0.0530161 0.141613 0.0254095
+-0.0395373 0.172163 -0.000837254
+0.0387477 0.0589461 -0.0057234
+-0.0647673 0.0795072 -0.0181104
+-0.00140393 0.0361018 0.00962515
+-0.00524162 0.0395598 0.0483202
+0.0236373 0.103743 -0.0178545
+-0.000477761 0.0760312 0.0584165
+-0.0210492 0.0348694 0.0496408
+-0.00244654 0.131114 0.00878185
+-0.033711 0.0384262 -0.00450177
+-0.0745333 0.152696 -0.0258905
+0.055409 0.0509629 0.0218922
+-0.0134774 0.127753 0.000758007
+-0.0120362 0.0388366 0.0321214
+-0.0278604 0.0487672 0.0470543
+0.0327952 0.0713854 0.0403707
+-0.0728362 0.0979301 -0.0143404
+-0.0367225 0.125751 0.02112
+0.0198232 0.0385183 -0.0126921
+-0.0377749 0.150712 0.00133662
+-0.0665966 0.180807 -0.0581921
+-0.0215095 0.114043 0.0376946
+-0.0620515 0.035927 0.0204607
+-0.0584945 0.150006 -0.0011129
+-0.0335992 0.1188 -0.0116562
+0.0196457 0.116633 0.0356159
+0.0248522 0.0685926 0.0446792
+-0.0164926 0.0544756 0.0504072
+-0.051136 0.140067 0.0203692
+-0.089139 0.139182 0.0122002
+0.0163249 0.0580554 -0.0285
+-0.0621816 0.0342254 0.0257179
+-0.0188821 0.0387745 -0.0111028
+-0.053388 0.034491 0.0395762
+-0.000472072 0.130948 0.0195451
+-0.0634988 0.173693 -0.0615446
+-0.054487 0.0452173 0.0438312
+-0.0202902 0.0906146 -0.0362948
+-0.0725702 0.17984 -0.0501722
+-0.0707759 0.162402 -0.0459559
+-0.0463694 0.113628 -0.0162147
+-0.0523573 0.0345285 0.0397607
+-0.0136632 0.0511316 -0.0317578
+-0.00948303 0.0703233 0.0561585
+-0.0852113 0.0869359 0.026743
+-0.0745333 0.0805197 0.0374668
+0.00349251 0.118288 0.0385113
+0.0493697 0.0693787 0.0250272
+0.029581 0.0736246 -0.0217333
+-0.0400646 0.156235 -0.00986121
+-0.0818113 0.136716 0.048659
+-0.0809364 0.129495 -0.00494346
+-0.0875459 0.110452 0.0143395
+0.0253164 0.112728 0.0350367
+-0.0852858 0.0845126 -0.000515374
+0.00212883 0.120316 -0.0135831
+-0.0192664 0.0381478 0.0114056
+0.0493315 0.0589269 -0.00474568
+-0.0183092 0.162495 -0.00732366
+-0.00730789 0.12834 -0.00208974
+-0.0286194 0.180015 -0.014033
+0.0255963 0.0648009 -0.0228004
+-0.00925832 0.177251 -0.027731
+-0.0485485 0.0432385 -0.0107358
+-0.0600861 0.14609 -0.00280453
+-0.026172 0.174158 -0.0190728
+-0.059111 0.0686528 0.0369372
+-0.0434854 0.0944868 0.0426487
+-0.0216341 0.038095 0.0200103
+-0.0670537 0.071446 0.0363402
+-0.0348255 0.0915164 -0.024068
+-0.0202598 0.174222 -0.0154191
+0.0344662 0.114921 0.00815778
+-0.0686919 0.0750175 -0.0147112
+0.026272 0.0789381 -0.0240124
+0.0202522 0.0805604 -0.0270674
+-0.0432329 0.156565 0.00586077
+-0.00650833 0.0787624 0.0577507
+-0.0335034 0.0774945 0.0414157
+-0.0606769 0.0676671 -0.0113119
+-0.0656284 0.162324 -0.0174746
+0.00729944 0.0639619 -0.0320669
+-0.00448657 0.0898027 0.0567005
+-0.0584972 0.0918588 0.045399
+0.00218731 0.0852799 -0.0344916
+-0.0417916 0.0869783 -0.0214259
+0.0463392 0.0489694 -0.00446687
+-0.0389761 0.128486 0.00847309
+0.00727028 0.11232 0.040519
+-0.0234564 0.0680424 0.0463484
+-0.0797185 0.0803984 0.0327643
+0.0232549 0.0645506 0.0458531
+0.0198821 0.0449543 0.0425235
+-0.0394974 0.0902763 0.0431118
+-0.0662858 0.172388 -0.0591199
+0.0259452 0.0364961 0.0239139
+-0.0714148 0.0386609 0.00057855
+-0.0638254 0.0924713 -0.0188016
+-0.0584874 0.112515 0.0360801
+-0.0623619 0.166253 -0.047591
+0.0452758 0.0875665 0.00218329
+-0.0244115 0.0379996 0.0159179
+0.0452209 0.0659646 -0.000116442
+-0.0707693 0.176767 -0.0466577
+-0.0650223 0.156803 -0.0519494
+0.0354173 0.0414682 -0.003097
+-0.0416808 0.0622091 -0.0130274
+0.0326595 0.114633 -0.00147403
+-0.0495274 0.14168 0.00739502
+0.0388579 0.0970015 -0.00784
+-0.00249575 0.0389742 0.0303561
+0.0070795 0.101453 -0.021277
+0.0291938 0.0754716 0.043989
+0.00502464 0.126695 -0.00649713
+-0.016158 0.0884114 -0.0380198
+0.0115883 0.102988 -0.0210311
+0.0576451 0.0661396 0.0235216
+0.0317192 0.118031 0.0171382
+-0.0116954 0.175688 -0.0223293
+0.00121183 0.0853285 -0.0350521
+-0.0158308 0.0883117 -0.038067
+-0.0686258 0.0846974 0.0427491
+0.00833511 0.0595736 -0.0302453
+0.0450509 0.0423962 0.0206492
+-0.027467 0.0793682 0.0471485
+-0.0679777 0.0716192 0.0360049
+-0.0718018 0.158195 -0.0399213
+-0.0114987 0.0856547 0.0572923
+0.0131441 0.0346685 0.0356066
+-0.0620328 0.156862 -0.0185851
+-0.0607717 0.113836 0.03657
+-0.0764751 0.146968 0.0421376
+-0.0207673 0.117009 -0.0138783
+0.0416942 0.0655359 -0.00371801
+-0.0306051 0.0524133 -0.0153638
+0.0107636 0.130209 0.0207729
+-0.0902734 0.133771 0.0282153
+-0.0235934 0.0383252 0.00311252
+-0.012672 0.0526484 -0.0327744
+-0.0309385 0.0622798 -0.0204312
+-0.0337803 0.122942 0.0251825
+-0.0598823 0.146825 0.0363335
+-0.0447526 0.0336781 0.00121434
+-0.0540428 0.0334293 -0.000440359
+0.0119421 0.123166 0.0332435
+0.0105328 0.103079 0.0462759
+-0.00696577 0.0389018 -0.00510709
+-0.033478 0.0632761 0.0395519
+-0.0386238 0.0519962 -0.0107523
+-0.0778526 0.159695 -0.0239243
+-0.0154805 0.109966 0.0416657
+-0.0688005 0.087996 -0.0171065
+-0.0428494 0.0999447 -0.0214282
+0.02441 0.101163 -0.0191142
+-0.0630974 0.160042 -0.0195595
+-0.0591899 0.154851 0.0254882
+-0.0694874 0.100005 0.0406788
+-0.063101 0.150495 -0.0266018
+-0.000774843 0.0783346 -0.0358957
+-0.0335129 0.112536 0.0351002
+0.00348618 0.11278 0.041408
+0.0454091 0.0918015 0.00517469
+-0.030521 0.0636541 -0.0224277
+-0.0564983 0.108415 0.0389345
+-0.0454982 0.045182 0.0420491
+0.0366564 0.089932 -0.0151793
+-0.00318743 0.0350129 0.0463208
+0.0397193 0.0787183 -0.00974279
+-0.0456155 0.165496 -0.00783315
+-0.0401614 0.110268 -0.0187071
+-0.0607836 0.171276 -0.0609166
+-0.0849643 0.0885105 -0.00254627
+0.000663768 0.131541 0.0142252
+-0.0773558 0.163115 -0.0213545
+-0.00442024 0.118937 -0.0140576
+0.029367 0.1045 -0.0146741
+-0.0767078 0.176155 -0.0445645
+-0.087862 0.117151 0.00226309
+-0.0674561 0.1652 -0.0559896
+0.0417828 0.101446 0.0181564
+-0.0504972 0.0465484 0.0414292
+0.0334855 0.0808915 0.0414362
+-0.0640951 0.0700461 0.0364211
+-0.0500004 0.121197 0.0329094
+-0.0640156 0.0344353 0.0303981
+0.0161688 0.0407187 0.0441528
+-0.0175288 0.165418 -0.0114925
+-0.0156111 0.0407209 -0.0274801
+-0.0136265 0.129395 0.0133241
+-0.060628 0.0588072 0.00794551
+0.0064803 0.0977098 0.0499318
+0.0439772 0.079046 -0.00278888
+0.0418428 0.0986036 -0.00180869
+-0.0225444 0.178667 -0.0133919
+-0.0606264 0.0336734 0.0105944
+-0.0434 0.0336807 -0.00215159
+-0.0886031 0.143176 0.0340326
+-0.0849284 0.107666 0.0223625
+0.0592303 0.0580467 0.0201933
+-0.0540206 0.147182 -0.0016614
+-0.00601913 0.126314 0.0306279
+-0.0686207 0.149674 -0.0393499
+-0.0919325 0.130933 0.0102425
+-0.0568299 0.143897 0.0319274
+-0.0354984 0.115235 0.0327878
+-0.0174958 0.0701523 0.0542792
+0.0270421 0.0862601 0.0462384
+-0.0488595 0.101383 -0.02158
+-0.0733679 0.152652 -0.0338969
+-0.0750934 0.159541 -0.00936327
+-0.0374543 0.155389 -0.00975319
+-0.0381729 0.166677 -0.0130206
+-0.087877 0.0990467 0.0233782
+-0.00160432 0.0405525 -0.0251988
+-0.0903048 0.139241 0.0221876
+-0.00139541 0.0385701 0.0219096
+-0.0221672 0.0839099 0.0558332
+-0.000827607 0.0389424 0.0289209
+-0.0177093 0.0385258 -0.00321073
+-0.0221552 0.169733 -0.0198584
+-0.0574718 0.156359 0.0101234
+0.0162407 0.0793143 -0.0294472
+0.0309621 0.0953572 -0.0169293
+-0.0167051 0.126576 2.44266e-05
+-0.0210968 0.161053 -0.00432438
+-0.0244887 0.100244 0.0443393
+-0.0637376 0.15365 0.0326508
+0.0154945 0.115387 0.0371086
+-0.0110238 0.098585 0.0502027
+-0.0466991 0.122484 0.0270727
+0.015569 0.110589 -0.0172093
+-0.0540772 0.146211 0.0253916
+0.0117081 0.0589891 0.0519593
+-0.0289244 0.033884 -0.0216457
+-0.08784 0.105023 0.0143674
+0.0262802 0.123151 0.0136687
+0.0122982 0.128768 0.0241985
+0.0428587 0.0803554 -0.00479839
+-0.0249679 0.0851951 0.0529639
+0.0259953 0.123127 0.0078705
+-0.000612836 0.0356605 0.0156316
+0.0462948 0.0820457 0.00817944
+-0.0179779 0.15947 -0.0103936
+-0.0237993 0.184341 -0.0145966
+-0.0300075 0.0337589 -0.0217484
+0.0233024 0.124378 0.00401489
+-0.0457643 0.0811616 -0.0200148
+-0.0786005 0.174957 -0.0470491
+0.00992987 0.0806149 0.0548353
+-0.036507 0.0464425 0.0402005
+-0.0229776 0.0681076 0.0472951
+0.0359077 0.111056 0.0244077
+-0.0691331 0.0612207 0.0112337
+-0.0653605 0.174136 -0.0490346
+-0.0246777 0.0366811 0.0541279
+0.00549638 0.115538 0.0397987
+-0.0512593 0.128575 -0.00377835
+-0.0227541 0.0889021 -0.0365754
+-0.052801 0.144689 0.0203903
+-0.0373724 0.0344314 0.0325332
+0.0302609 0.0461225 0.032895
+-0.0668934 0.119448 -0.00885989
+-0.0781478 0.107183 -0.00659237
+-0.0262448 0.109573 -0.0200299
+-0.0930011 0.116069 0.0193086
+0.0199447 0.104671 0.0430468
+-0.0902973 0.114585 0.00733567
+-0.0597131 0.0708022 -0.0154129
+0.011503 0.0909852 0.0534706
+-0.0601621 0.0433793 -0.00606772
+-0.0690356 0.068492 0.0314599
+-0.0662201 0.0390045 0.0360529
+0.0111444 0.104428 -0.02004
+-0.0620602 0.155611 0.00849054
+0.038029 0.105425 -0.00179734
+0.00952421 0.0346423 -0.0128865
+-0.0475328 0.0338333 0.0273813
+0.0275059 0.121239 0.00414409
+-0.0713739 0.162409 -0.0439557
+-0.0388285 0.0339925 0.000319116
+0.0209713 0.0966458 -0.0223043
+-0.0117867 0.0798822 -0.0383021
+-0.00231276 0.123919 -0.0094032
+-0.0623035 0.158393 -0.0375989
+-0.0498834 0.108435 -0.0190271
+-0.0450959 0.122461 0.0255697
+-0.086583 0.1077 0.0153543
+-0.0640141 0.128346 0.0443555
+-0.0910616 0.140621 0.0211716
+0.0222184 0.122028 -0.00352468
+-0.0197563 0.0685528 -0.0378978
+-0.0747315 0.0809443 -0.0125955
+0.0381487 0.056188 -0.00571384
+0.0310862 0.0808926 0.0432566
+-0.0418955 0.0336683 0.02694
+0.0454971 0.0861837 0.00419421
+-0.0515955 0.0575054 -0.00888629
+-0.0923422 0.120143 0.0302906
+-0.0388134 0.0900157 -0.0235053
+-0.0678286 0.139237 -0.00787376
+-0.0500776 0.136736 0.0219567
+-0.0524826 0.132311 -0.00383544
+-0.0725073 0.154019 -0.0378993
+-0.0164965 0.114086 0.0389356
+-0.0266334 0.0505574 -0.0257305
+0.0285947 0.0646316 0.0430307
+-0.050498 0.10288 0.0412159
+-0.0147348 0.0348101 0.0475803
+-0.0147627 0.0728806 -0.0387608
+-0.0425799 0.160887 0.00499665
+-0.0516371 0.0334814 0.00180973
+-0.0574972 0.0973516 0.04313
+-0.0294813 0.179959 -0.00726258
+-0.0696084 0.159782 -0.00738408
+-0.00175707 0.0783385 -0.0360812
+-0.0778906 0.0797955 -0.00863863
+0.0383322 0.0928141 0.0344469
+-0.0459579 0.0368224 -0.0202942
+0.0126438 0.130236 0.0157508
+0.0370668 0.109719 0.0231776
+-0.0650007 0.0600171 0.0167571
+-0.0294928 0.0931993 0.044345
+-0.0849548 0.0952071 0.0290738
+-0.0314917 0.0660582 0.0391556
+0.0283827 0.10475 0.0376855
+0.0125555 0.034405 -0.0178251
+0.0407099 0.0684593 0.0306869
+-0.0321086 0.163743 -0.0150961
+0.00529533 0.064011 -0.0326857
+0.0428516 0.0972538 0.000192155
+0.0475361 0.0451237 0.0241502
+-0.0188094 0.0382725 0.0240343
+-0.0242622 0.0650295 0.043001
+-0.0247852 0.0783802 -0.0377363
+0.0104929 0.0923225 0.0529394
+-0.0684671 0.140894 -0.00832284
+-0.013606 0.0435021 -0.0266802
+-0.0324058 0.05963 -0.0134049
+-0.0709313 0.156768 -0.044906
+-0.0794975 0.113845 0.0467655
+0.0215945 0.126233 0.0147739
+-0.0653369 0.0416124 0.0352199
+0.0546053 0.0733755 0.0137165
+-0.0893171 0.0996957 0.0173941
+-0.0835863 0.0817078 0.00050138
+0.029436 0.039931 -0.00313898
+-0.0614917 0.0661812 0.0332998
+-0.0923901 0.114734 0.0183133
+0.030053 0.0567138 -0.0167759
+-0.00342912 0.0915905 -0.0351346
+-0.0758824 0.100651 -0.0113429
+-0.0457293 0.0348843 0.042622
+0.00615023 0.0385922 -0.00780619
+-0.0547458 0.0768339 -0.0193157
+-0.0356142 0.0493225 -0.0125317
+0.024593 0.0345639 0.00705834
+-0.0892328 0.114145 0.0245988
+0.0348936 0.0586201 -0.0127038
+-0.0828513 0.138047 0.046826
+0.0569539 0.0508846 0.00918952
+-0.0797103 0.0711205 0.00752586
+-0.092065 0.118755 0.0273051
+-0.0103683 0.0388061 0.0306894
+-0.0431813 0.165147 -0.00997877
+-0.0813565 0.109598 0.0300528
+0.0477122 0.0511499 0.0301456
+-0.0678831 0.155252 0.000581516
+0.0349362 0.113582 0.0211925
+0.0280387 0.0549866 0.0403705
+-0.0615433 0.125505 0.042614
+0.0450739 0.0427888 0.00232236
+-0.0544975 0.121335 -0.0101688
+0.0117318 0.0833298 0.0539432
+-0.0144997 0.103011 0.0432504
+-0.0752992 0.149965 -0.0228671
+0.0196742 0.0686359 0.0495084
+-0.0394722 0.107013 0.0383007
+-0.0321381 0.0435397 -0.0289857
+0.0231687 0.0915577 0.0477207
+-0.0480905 0.156132 -0.00685995
+0.00882114 0.0589209 0.053036
+0.000540453 0.0731645 0.0574875
+-0.0842824 0.0818436 0.0235004
+-0.072066 0.0353469 0.00817017
+-0.0548518 0.122696 0.0382478
+-0.0283817 0.123518 -0.00261643
+-0.0178271 0.0855379 -0.0388455
+-0.00772146 0.0656018 -0.0354736
+0.0230836 0.12416 0.0238853
+-0.0125037 0.0730609 0.0559849
+0.0551355 0.0581678 0.0268835
+-0.0288448 0.124881 0.0180835
+-0.0566945 0.126945 0.0390945
+-0.0491155 0.0337431 -0.0125383
+-0.0100076 0.130157 0.0146359
+-0.0114787 0.0934019 -0.0350786
+-0.012503 0.0856552 0.057236
+-0.00822614 0.0384527 0.0224267
+-0.0288615 0.0353967 0.01735
+-0.035527 0.115134 -0.015836
+-0.085501 0.0791776 0.00851156
+0.0457594 0.0890174 0.0101642
+-0.0775133 0.126 0.0528602
+-0.0598229 0.0911123 -0.0198104
+0.0349018 0.0698502 -0.0158378
+-0.00371064 0.0641813 -0.0350983
+-0.0232497 0.0336668 -0.0221987
+-0.0337721 0.121485 -0.00843946
+0.0123855 0.0603174 0.0511841
+-0.0454994 0.0804154 0.0426755
+0.00893209 0.124393 0.0330753
+-0.00403191 0.0987119 0.0511654
+-0.0481285 0.0573264 0.0358964
+-0.0166099 0.0407431 -0.0277394
+-0.0440479 0.169839 -0.00695693
+0.0412738 0.0872408 -0.00977382
+-0.0604546 0.071762 0.0392488
+0.0529297 0.0581906 0.02898
+-0.0521631 0.138551 0.0244099
+-0.0366167 0.15106 0.000396988
+0.0417493 0.0611977 -0.0033567
+-0.070996 0.0683351 -0.00354604
+-0.0356709 0.0621736 -0.0130441
+-0.0170991 0.0383232 0.0225362
+-0.0487856 0.0573034 0.0351442
+0.022412 0.0372285 0.0333476
+-0.0249633 0.0931679 0.047071
+0.018008 0.0349409 0.0291289
+-0.0796085 0.154132 0.0271276
+-0.0406237 0.0336557 -0.0200198
+0.0169165 0.123099 -0.00667688
+0.0210051 0.0618768 0.0478546
+-0.0427644 0.0812202 -0.0203472
+-0.0672645 0.175508 -0.0482636
+-0.0639988 0.121381 0.0479339
+-0.0622266 0.158391 -0.0366041
+-0.0261802 0.161053 -0.0142499
+0.0186318 0.0821747 0.0516425
+-0.00531922 0.0961442 -0.0318294
+0.00250665 0.0341604 -0.0175888
+0.0167477 0.0563074 0.0486799
+-0.0106808 0.0555967 -0.0338825
+0.00925016 0.0724976 -0.0328208
+0.0123553 0.0552818 -0.0294499
+0.0212602 0.0735043 -0.0271352
+-0.0845249 0.129883 0.0501389
+-0.0764965 0.154899 -0.0050946
+-0.0621627 0.163132 -0.0395927
+-0.0144955 0.0701698 0.0547379
+-0.0084766 0.0489124 0.0500846
+-0.000135712 0.0381648 -0.0142912
+-0.0503963 0.1183 0.0322871
+-0.0761087 0.083292 0.0375324
+-0.0736943 0.094184 0.0404336
+-0.0691138 0.0763852 0.0387083
+-0.0290376 0.038297 0.000217512
+-0.0348553 0.0342935 0.020715
+-0.0220444 0.0384934 -0.0170721
+-0.0114987 0.0471911 0.0478612
+0.0375264 0.0714822 -0.0127977
+-0.0282394 0.087664 0.0462444
+-0.0757136 0.107486 0.0366393
+-0.0610115 0.134041 -0.00711168
+-0.0797372 0.0717415 0.00518109
+-0.0658978 0.147832 -0.0279808
+-0.00653882 0.110902 -0.0214831
+0.0296673 0.0591775 0.0410177
+-0.0217889 0.0696447 0.0502694
+0.0234089 0.0418644 -0.00766906
+-0.0364935 0.0888766 0.0431732
+0.0306541 0.0520995 0.0370911
+-0.060098 0.0687043 0.0366734
+0.0187338 0.0862153 -0.0273821
+-0.0839692 0.148747 0.00414299
+-0.0354821 0.0561791 0.038801
+-0.0481382 0.0376145 0.0455768
+-0.0676248 0.117206 0.0513943
+-0.0281854 0.174153 -0.0178233
+0.0359289 0.0386712 0.0221633
+-0.0256851 0.0824232 0.052338
+-0.0145953 0.0363242 -0.0264317
+-0.0303622 0.055196 -0.0183802
+-0.00165167 0.0525486 -0.0310164
+-0.0132125 0.168083 -0.022507
+-0.00949762 0.078776 0.0580091
+-0.0361357 0.127268 0.00216052
+0.048778 0.0525636 0.0299433
+-0.0256526 0.0520956 -0.0269974
+-0.0603733 0.0335628 0.0071663
+-0.0426157 0.035917 -0.0271302
+-0.0144999 0.162187 -0.0103051
+-0.0384864 0.0548303 0.0394681
+-0.0831442 0.107611 0.0263767
+-0.00111933 0.100971 -0.0229536
+-0.0548742 0.10693 -0.0184788
+-0.0218282 0.127027 0.00889322
+-0.0174982 0.111166 -0.0197324
+-0.0652616 0.0722487 0.0377992
+-0.0576238 0.145329 0.032529
+-0.0184507 0.117417 -0.0143314
+-0.081937 0.128034 -0.00496911
+0.0195332 0.12729 0.0154357
+-0.0293484 0.0705264 -0.0315108
+-0.00525979 0.0409541 0.0483014
+0.0555717 0.0706847 0.00515518
+-0.048428 0.0531039 0.036022
+-0.00279611 0.0826469 -0.0371795
+-0.0287124 0.0382592 0.00213562
+-0.0574984 0.0959784 0.0439666
+-0.091525 0.133725 0.0172151
+-0.016864 0.128415 0.0107007
+-0.0636978 0.164648 -0.0286005
+-0.0829735 0.127181 0.0515051
+-0.0488321 0.0956358 -0.0221459
+0.0400863 0.0899903 -0.0108207
+-0.0619683 0.12268 0.0437909
+0.0605435 0.0650981 0.0101416
+-0.0665542 0.169448 -0.0580509
+-0.0891009 0.0902275 0.0204481
+-0.0825815 0.112383 0.0454387
+0.0104883 0.0936688 0.0521003
+0.0142529 0.0765304 -0.0302113
+0.0165164 0.126586 0.0257514
+-0.0283423 0.118847 0.030216
+0.0142697 0.034212 -0.000289798
+-0.0478723 0.105599 -0.0198923
+-0.0739256 0.098177 0.0391323
+-0.049674 0.141672 0.0123895
+-0.0475977 0.15214 0.0100027
+-0.0424553 0.128377 0.00131486
+0.0224361 0.0645464 0.046427
+-0.0885609 0.087538 0.0184581
+0.0147132 0.0897404 -0.0290836
+-0.054132 0.143048 0.0274248
+0.00550441 0.0575487 0.0534334
+-0.0772682 0.155563 -0.0118971
+-0.0677628 0.079419 -0.0170759
+-0.0464924 0.159333 0.00779524
+0.0261579 0.0768253 0.0466356
+-0.0552963 0.0473377 0.0123212
+-0.0298441 0.0972531 -0.0235715
+-0.00563259 0.0974901 -0.0292726
+-0.0261993 0.095287 -0.0250572
+-0.0716941 0.0684125 -0.00254325
+0.00127365 0.0682996 -0.0335875
+0.0575871 0.0523587 0.0191771
+-0.00134429 0.0361889 0.0150058
+-0.0715096 0.1041 0.0379435
+-0.0921823 0.117455 0.0412015
+-0.0384872 0.0337149 -0.0296051
+-0.0287365 0.0475545 0.0479663
+-0.0257999 0.0422849 0.0537317
+-0.0230963 0.124618 -0.00175855
+-0.0924128 0.11471 0.0173177
+-0.00492025 0.0362041 0.048453
+-0.0186551 0.184576 -0.0164922
+-0.0802253 0.0772741 0.0285988
+0.0463015 0.0806481 0.0121762
+-0.0304105 0.0861968 -0.0305753
+-0.0346214 0.0348242 0.0450553
+-0.0652339 0.0355811 0.0395373
+-0.0788426 0.0825957 -0.0096075
+-0.0127163 0.038878 -0.00996632
+-0.0624916 0.166267 -0.0445898
+-0.0746075 0.156859 -0.0239292
+-0.0773753 0.161145 -0.0179242
+-0.0883931 0.1336 0.00326444
+-0.0661323 0.162373 -0.0581655
+-0.0510928 0.12386 -0.00885828
+-0.0384971 0.0705176 0.0419076
+-0.0723264 0.176481 -0.0540086
+-0.0271072 0.11707 -0.0138992
+-0.0591735 0.11954 -0.0102201
+0.0222809 0.11936 0.0323905
+-0.0302503 0.17123 -0.00702025
+-0.0809167 0.107332 -0.00361395
+-0.0627188 0.046051 0.00845692
+-0.00639449 0.0347093 0.0459249
+-0.0877048 0.0873692 0.00346654
+-0.0410427 0.15478 -0.00878846
+-0.069373 0.0655009 0.0252048
+-0.0270649 0.0689032 -0.0335294
+0.00976243 0.126251 0.030462
+-0.002483 0.114172 0.0414823
+-0.0532846 0.152692 0.0160461
+-0.0190668 0.12797 0.0127969
+-0.0645056 0.0818668 0.0436415
+-0.0144784 0.0645279 0.0535035
+-0.0598098 0.08825 -0.0201729
+-0.0614957 0.105649 0.0403113
+-0.0278003 0.174225 -0.00868668
+-0.0525152 0.0439969 0.0448982
+-0.00749319 0.0503553 0.0512463
+-0.0786706 0.0853441 -0.0105854
+-0.0447185 0.0709976 -0.0171011
+-0.0635722 0.0753573 0.0407707
+-0.0124985 0.0603974 0.0541523
+0.0344134 0.0655586 -0.0158419
+0.0196499 0.124334 0.0268969
+-0.0627763 0.0614875 0.0230054
+0.0416143 0.102832 0.00217563
+-0.0552881 0.147721 0.0283494
+-0.0143864 0.174216 -0.0192271
+0.0144149 0.0343798 -0.00603429
+-0.0101902 0.177186 -0.0254506
+0.0284808 0.120403 0.0230436
+-0.0149461 0.0384961 0.0282276
+-0.0778803 0.0710945 0.0220932
+-0.042083 0.168351 -0.00985967
+-0.056782 0.043535 0.0167171
+0.0143083 0.122234 -0.00973054
+-0.0266054 0.0916781 -0.031606
+-0.00249278 0.121064 0.0370013
+-0.0199096 0.0382242 0.00758286
+-0.0135056 0.0842656 0.0572305
+-0.0720125 0.148777 -0.0357596
+0.0251623 0.118606 -0.00580398
+-0.0618325 0.0334319 -0.000212632
+-0.0855476 0.136296 0.00125685
+-0.032605 0.0408975 -0.030074
+0.0426847 0.0986805 0.020158
+-0.00736899 0.0366982 -0.0162506
+0.00250252 0.0590979 0.0551087
+-0.0674921 0.106947 0.0382762
+-0.0289938 0.16114 -0.00164375
+-0.0509402 0.0584984 0.0315938
+-0.0350845 0.124972 -0.00417237
+-0.0686385 0.0435335 0.00569826
+0.0441509 0.0959467 0.0161545
+0.0131317 0.10725 -0.0189993
+0.0358259 0.0928903 0.0378885
+-0.0154981 0.060248 0.0524646
+0.0276762 0.118315 -0.00350857
+-0.0683312 0.0833327 0.042485
+0.033847 0.106899 -0.00922375
+0.048317 0.0466984 0.0256626
+-0.0570131 0.128126 -0.00643112
+-0.0788672 0.111379 -0.00271807
+0.0115311 0.122019 -0.0114981
+0.0275945 0.106191 -0.0144774
+-0.0591334 0.0584459 0.00677121
+-0.0780191 0.149419 0.0383262
+-0.0559631 0.0464314 -0.00541258
+-0.0192836 0.0894928 -0.0371367
+-0.033131 0.166707 -0.0157536
+-0.0495065 0.107045 0.0392662
+-0.073496 0.147014 0.0424214
+-0.0404833 0.111172 0.036485
+0.0284708 0.0565571 -0.0188308
+0.0511996 0.0711486 0.0227866
+-0.0681397 0.0738079 0.0376094
+-0.0905331 0.135117 0.0212107
+-0.0733037 0.155556 0.00591793
+0.0500217 0.0446984 0.00624267
+-0.00949805 0.0815484 0.0580308
+0.0211117 0.124199 0.0260136
+-0.0611133 0.149657 0.036321
+-0.0635959 0.153475 0.00125628
+0.0344187 0.0994578 0.0359067
+-0.0734442 0.163812 -0.0389777
+-0.0852938 0.0858468 -0.00152115
+-0.0559297 0.13815 0.0313829
+-0.0870302 0.13217 0.00132034
+0.0204036 0.0474506 -0.0212729
+-0.076548 0.0954614 0.0376104
+-0.0855527 0.153551 0.0192298
+-0.0729125 0.0928513 0.0411123
+-0.0404958 0.0478428 0.0400733
+-0.0121854 0.0980546 -0.0279084
+-0.0464966 0.108432 0.0393098
+-0.0177034 0.0569685 -0.0340386
+-0.0908687 0.135097 0.0172074
+-0.0862565 0.0846802 0.0214754
+-0.0297808 0.0348722 0.0494682
+-0.0764922 0.155931 0.0149956
+-0.0618119 0.115344 0.0386033
+-0.0487475 0.0767781 -0.0183253
+-0.0907804 0.150219 0.0191245
+-0.0524535 0.0335708 0.023045
+-0.0384946 0.0577019 0.0400515
+-0.074873 0.151297 -0.0278802
+0.00653661 0.120619 -0.0139577
+-0.0483957 0.0389613 0.0452757
+-0.0779524 0.165292 -0.0269536
+-0.0536531 0.0334694 0.00682116
+-0.0561549 0.118392 0.0380484
+-0.0201622 0.0337128 -0.0216346
+-0.0794073 0.0772395 -0.00557672
+-0.0135947 0.071631 0.0548042
+-0.0382622 0.0335792 -0.0232089
+-0.0183288 0.115615 -0.0164437
+-0.0507515 0.0768088 -0.0186854
+-0.0176367 0.181628 -0.0186063
+0.001434 0.0980064 0.0516014
+0.00449684 0.131467 0.00706378
+-0.0839655 0.111209 0.0317911
+-0.0769529 0.128149 -0.00749249
+0.0471199 0.0728094 0.00697834
+0.0460243 0.0737836 0.00392327
+-0.00149572 0.0505531 0.0529099
+-0.0431936 0.0363833 0.0440447
+-0.054345 0.151005 0.0266856
+0.00514071 0.12498 -0.00862525
+-0.0729614 0.112778 0.0490933
+0.0152498 0.0348445 0.0304622
+-0.0111539 0.0386404 0.0270766
+-0.0431779 0.113636 -0.0162215
+-0.0754447 0.164601 -0.0189193
+-0.0685657 0.0346013 0.0116976
+0.036686 0.110763 0.0218417
+-0.058015 0.128168 -0.00680186
+-0.0805084 0.121673 0.0499202
+-0.0750852 0.174913 -0.0410877
+-0.0394764 0.081876 0.0433844
+-0.01065 0.0383969 0.0147482
+-0.0236788 0.0551648 -0.029679
+-0.0207747 0.0728486 -0.0387932
+0.00733312 0.0553775 -0.0306811
+-0.0497252 0.137033 0.00342407
+-0.0650198 0.154365 0.0307072
+0.00051428 0.0383337 0.0225142
+-0.0625323 0.1568 -0.0366082
+-0.00383551 0.130671 0.00539431
+0.0310854 0.118732 0.00690653
+-0.0699388 0.131128 -0.00863643
+-0.023911 0.123885 -0.00309916
+-0.0495628 0.0402984 0.0453668
+-0.0639487 0.168098 -0.0606895
+-0.0706835 0.155594 0.0053992
+-0.0686442 0.156175 0.0235781
+-0.0572185 0.0575347 0.00867749
+-0.0788442 0.154658 0.0259054
+-0.0721793 0.15961 -0.0389315
+-0.0545051 0.119806 0.0369329
+-0.0254081 0.182912 -0.0140439
+-0.0729406 0.0676849 0.0243239
+-0.0353285 0.0851433 -0.0237512
+-0.0478735 0.104217 -0.0205651
+-0.0558395 0.0589131 -0.0044052
+0.0448613 0.0903726 0.0191701
+0.0576189 0.0719687 0.0133447
+-0.0511061 0.129858 -0.00316533
+-0.00880359 0.113633 -0.0183799
+-0.0618121 0.09105 -0.0190303
+0.0313027 0.114101 -0.00492854
+-0.042497 0.0874008 0.0424798
+-0.0508473 0.0970748 -0.0222124
+-0.0654906 0.102864 0.0410679
+-0.00458022 0.0347745 -0.0240516
+0.0553581 0.0524903 0.0236336
+0.00626754 0.071137 -0.0337471
+-0.0135115 0.118298 0.0374588
+-0.0604029 0.0342918 0.0295439
+0.0406411 0.0462159 0.0309092
+-0.0278584 0.0385169 -0.0108032
+0.0266728 0.0713177 0.0438181
+0.0101968 0.116422 0.0377394
+0.0446411 0.0959729 0.00816419
+-0.0597937 0.0334415 0.000190139
+-0.0210999 0.0811322 0.0562803
+-0.0474593 0.0559824 0.0367034
+0.0340242 0.115407 0.0165889
+0.0416569 0.0832977 0.0303966
+0.0340782 0.100772 0.035418
+-0.0604756 0.0747304 0.0414998
+0.0147905 0.128825 0.0208219
+-0.00109958 0.115152 -0.0180337
+-0.0237291 0.0650733 0.0438813
+-0.0261862 0.17712 -0.0185723
+-0.0381348 0.0338853 -0.0178771
+-0.0323789 0.115075 -0.0157884
+0.0168479 0.0856792 -0.0288312
+0.0383914 0.0390949 0.00219016
+0.0192558 0.0721931 -0.0285132
+-0.0837506 0.0776431 0.00349824
+0.00549734 0.0937843 0.053579
+0.0381875 0.10978 0.0131678
+-0.0707773 0.0822058 -0.016572
+-0.0623556 0.0337533 -0.00969501
+-0.0657944 0.0348418 0.0348835
+0.029813 0.0605585 0.0412449
+-0.067274 0.142559 0.0431983
+-0.00437946 0.039206 0.0351678
+-0.091267 0.130919 0.00823808
+0.056791 0.0717301 0.0086079
+-0.088725 0.0942104 0.00844208
+-0.0527517 0.076824 -0.0190661
+-0.075716 0.071204 0.0277224
+-0.0296574 0.175524 -0.0164728
+0.0201633 0.0535759 0.04656
+0.00320624 0.036422 0.0229702
+0.0192058 0.0834241 -0.02764
+-0.0918136 0.129556 0.00925121
+0.0276788 0.117119 0.0298812
+-0.0251464 0.0824617 0.0532115
+-0.0728771 0.154609 0.0294193
+0.00904539 0.03456 0.0402645
+-0.0534903 0.102908 0.0413848
+0.00940878 0.0389595 -0.0232113
+-0.0859627 0.109007 0.009354
+-0.0484951 0.0903851 0.0445307
+0.00263147 0.0345612 0.0425417
+-0.0770465 0.161776 -0.0174081
+0.0134975 0.104436 0.0449316
+-0.0388918 0.123217 0.0263098
+-0.0364947 0.112507 0.0349484
+-0.0629025 0.103986 -0.017642
+-0.0678178 0.0923118 -0.0167386
+-0.0689104 0.122371 -0.00889897
+-0.0255023 0.125351 0.00317915
+-0.000607228 0.0419595 -0.0248688
+0.0460131 0.0820178 0.0051921
+-0.0223034 0.0381733 0.0107634
+-0.0861005 0.10314 0.0243088
+-0.0674874 0.0958602 0.0421807
+-0.0538319 0.138205 -0.00152003
+-0.0199623 0.0624791 0.0486773
+-0.0187732 0.0946942 0.0521396
+0.0415957 0.0859827 0.0303559
+-0.0405006 0.0562797 0.0399754
+-0.0396087 0.0392284 -0.0278507
+-0.0203015 0.124709 0.0241059
+-0.0667178 0.127063 0.0492263
+-0.0727925 0.0893223 -0.0156729
+0.0370031 0.104683 0.029035
+0.0279524 0.103456 0.0388242
+-0.0186121 0.038597 0.0291868
+-0.0776508 0.152845 -0.000892884
+-0.0334818 0.0987718 0.0435747
+0.0329891 0.092935 0.0408139
+0.0391956 0.0712805 0.0337887
+-0.0631802 0.0590341 0.0144269
+-0.0537547 0.143134 0.0264016
+-0.0301924 0.153974 -0.00357072
+-0.0448379 0.0970765 -0.0217835
+0.00941817 0.0340541 0.000745803
+-0.0432126 0.168352 -0.00885275
+0.0554664 0.0549257 0.00120797
+-0.0225677 0.0932815 0.0503229
+-0.0524989 0.157892 0.00946562
+0.0390425 0.0953983 0.0320312
+0.04296 0.0817702 -0.00479044
+0.00635062 0.0510121 -0.0292209
+-0.0543105 0.149562 0.0267072
+0.0221931 0.100779 0.0445472
+0.0329366 0.0724958 -0.0177814
+0.0248886 0.114037 0.0344109
+-0.0550232 0.14424 -0.00134547
+0.0163915 0.04625 -0.0239163
+0.0177475 0.036867 -0.0166881
+-0.0617992 0.0867358 -0.0192812
+-0.0893599 0.133717 0.0406984
+-0.039718 0.0695625 -0.0162922
+-0.0089161 0.0389771 0.0326408
+-0.0245194 0.0879123 0.052427
+-0.0855508 0.0883229 0.0270467
+-0.0419398 0.0356984 0.00899705
+-0.0715816 0.0791203 0.0388191
+-0.0444898 0.0690526 0.0411578
+-0.070025 0.173518 -0.0406121
+-0.0628508 0.0981808 -0.0176907
+-0.0750322 0.144421 -0.00688246
+-0.0499825 0.0544896 0.033589
+-0.065333 0.177827 -0.0606985
+-0.0316114 0.123192 0.0229888
+-0.0760927 0.0805105 0.0361956
+-0.0370838 0.0486029 -0.013278
+-0.0785283 0.124553 0.0522615
+-0.0708435 0.0731956 0.0357937
+-0.0403104 0.0336344 -0.0180813
+-0.0609885 0.0628534 0.0274979
+-0.0323315 0.0624018 -0.0174393
+-0.0368547 0.100015 -0.0221726
+-0.0783796 0.172116 -0.0450441
+-0.0633655 0.139636 -0.00706655
+0.00173262 0.13137 0.0174841
+-0.0105091 0.0646847 0.0553841
+0.0266795 0.122765 0.0152477
+-0.0360635 0.034528 0.0238485
+-0.0541027 0.122637 0.0375656
+-0.0544908 0.0344999 0.0341095
+0.0176998 0.103348 0.0450658
+-0.0685644 0.145677 -0.0229009
+-0.0356468 0.0577276 -0.0110125
+-0.0696054 0.110911 0.0424293
+-0.0584669 0.0577494 0.0129387
+-0.0398029 0.0870085 -0.0218621
+-0.00967624 0.104885 -0.0231041
+0.00669982 0.0383228 -0.00932299
+-0.0609169 0.109692 -0.0160089
+-0.0646221 0.122809 0.0487379
+0.0174813 0.0865744 0.0503122
+-0.0067878 0.0386876 0.00254936
+-0.0628956 0.119461 -0.00917238
+-0.0404347 0.128451 0.0123721
+0.0304082 0.04464 -0.00596234
+0.00950687 0.0785812 0.0553914
+-0.0185636 0.161122 -0.00592394
+-0.0407009 0.066639 -0.0151117
+-0.0638844 0.0392942 0.0408356
+0.00208256 0.0392848 0.0328214
+-0.0891635 0.0901786 0.00945748
+-0.0714603 0.0390724 0.00325296
+0.0396909 0.105526 0.00119339
+-0.092918 0.118828 0.0342968
+-0.0809093 0.0912865 0.0336272
+0.0106278 0.12033 -0.0136749
+-0.079254 0.149169 0.0379325
+-0.0700516 0.177913 -0.0570165
+-0.0584973 0.0875674 0.0446281
+0.0363875 0.037641 0.0177175
+-0.0266625 0.178341 -0.0176816
+-0.0257516 0.0380733 0.00834253
+-0.0514727 0.147804 0.0154008
+-0.0475605 0.047528 -0.00960427
+0.0464078 0.0756596 0.0165703
+-0.0659757 0.132606 -0.00839654
+-0.0795255 0.0953936 0.0349279
+-0.0512091 0.118302 0.0328718
+-0.00441308 0.12096 -0.0123131
+-0.0322918 0.0358193 0.0288559
+-0.0907178 0.142015 0.0241681
+-0.0555193 0.152453 0.0283051
+-0.044345 0.152142 0.00768226
+0.0241695 0.0809229 0.0490966
+-0.0528659 0.0999263 -0.0216782
+-0.0669331 0.125307 -0.0088761
+-0.0303567 0.119073 0.029499
+0.025846 0.107916 -0.0143268
+-0.0617056 0.1325 0.0388812
+-0.0185965 0.0364224 -0.0275796
+-0.0207908 0.0384714 -0.00378381
+-0.0617181 0.0598008 0.019418
+-0.0474373 0.120726 0.0283448
+0.0366967 0.103968 -0.00783268
+0.0303183 0.0797251 -0.0205953
+-0.0317074 0.0436869 0.0496355
+-0.0623412 0.156794 -0.0356173
+-0.0765015 0.121776 0.0527715
+-0.0184879 0.122208 0.0309285
+0.0230909 0.103393 0.0423419
+0.0609018 0.0651278 0.0131549
+0.00916248 0.0355108 0.0268151
+0.0313289 0.0554154 -0.0147753
+-0.0025035 0.108652 0.0433127
+0.0546992 0.0478618 0.0141962
+-0.0620154 0.0689049 0.0360997
+-0.0388626 0.102809 -0.0208006
+-0.0555708 0.142434 0.0301615
+-0.0688026 0.146519 -0.0258522
+0.0194777 0.0878818 0.0491927
+-0.0228793 0.110931 -0.0194728
+-0.0324125 0.0849398 -0.0275574
+-0.0438855 0.03574 0.0440005
+-0.0917791 0.117463 0.0421754
+-0.0690116 0.129833 0.0494501
+-0.0743362 0.15411 -0.0219057
+-0.0638117 0.0867138 -0.0190744
+-0.045027 0.168395 -0.00690925
+0.0270479 0.080882 0.0462053
+-0.0114995 0.164138 -0.0150087
+-0.0325011 0.058955 0.0382451
+-0.0606931 0.0692955 -0.0138548
+-0.0566913 0.0572662 0.0137312
+-0.00649633 0.0488329 0.050181
+0.0223101 0.120965 0.030775
+-0.0805231 0.0993639 0.0329828
+-0.0644795 0.0959078 0.0429389
+-0.075154 0.17882 -0.048244
+0.00607351 0.0358936 0.0456569
+-0.035492 0.0648204 0.0410644
+-0.0576415 0.155076 0.0216791
+-0.0762945 0.152787 -0.0118902
+-0.00761327 0.0434711 -0.0261832
+-0.0814624 0.13163 0.0517276
+-0.0743185 0.067053 0.0192856
+-0.0842709 0.104792 0.000381661
+-0.0374161 0.12162 -0.0106267
+0.0282004 0.082909 -0.0218038
+-0.0538885 0.131144 0.0343613
+0.0268226 0.046511 -0.0137061
+-0.0500801 0.151654 -0.00422617
+-0.0843259 0.153929 0.0166903
+-0.0840259 0.124392 0.0498267
+-0.0906893 0.11752 0.0439252
+-0.0636773 0.162484 -0.0225185
+0.0362915 0.0534119 -0.00658438
+-0.0733102 0.0700068 0.0292571
+0.0432125 0.0858656 0.0273897
+0.0392299 0.108358 0.0101653
+-0.0357967 0.0383351 -0.00483874
+-0.0645865 0.0628123 -0.00359236
+-0.0838768 0.108986 0.0253683
+-0.0538875 0.139905 -0.00121756
+0.0463511 0.0764838 0.0150474
+0.0180384 0.119266 -0.0105437
+-0.0812898 0.0735018 0.0165324
+-0.0437426 0.076832 -0.018848
+-0.0489995 0.126854 0.0308899
+0.00913686 0.107291 -0.0199257
+0.0413467 0.0718054 -0.00779903
+-0.0407607 0.126285 -0.00553285
+-0.0564807 0.113914 0.0357075
+-0.0477527 0.149202 0.00972608
+-0.0737025 0.144377 -0.00986626
+-0.0237128 0.058121 -0.0313582
+-0.0884618 0.142054 0.0361609
+-0.00450592 0.0661541 0.056364
+-0.0448888 0.108464 -0.0189265
+-0.0531399 0.13506 -0.0028018
+0.0308728 0.114122 0.0296728
+-0.0120858 0.0382274 0.0182274
+0.045976 0.0820209 0.01617
+-0.0474955 0.0344671 0.0303636
+0.0116443 0.129846 0.0210966
+0.0429126 0.0775596 -0.00475805
+-0.0639176 0.122377 -0.00881224
+-0.0219078 0.0581082 0.0451165
+-0.0185957 0.118181 -0.0131167
+-0.0381658 0.165183 -0.0131497
+-0.0445045 0.0438483 0.042919
+-0.0464974 0.074738 0.042075
+-0.0819901 0.133862 -0.00285904
+-0.0633534 0.0445301 0.031682
+-0.0314905 0.0960436 0.0448087
+-0.0575997 0.0574661 0.0133658
+-0.0303698 0.154176 -0.00601441
+0.0133009 0.0666579 -0.0304883
+0.0108109 0.0819726 0.0543646
+-0.068057 0.178404 -0.0514469
+-0.0806807 0.0760273 -0.00253172
+0.0394926 0.0541437 0.0318453
+-0.00450121 0.0675415 0.056336
+-0.019491 0.0387907 0.0342254
+0.0147818 0.0631153 0.0511723
+-0.0291704 0.172664 -0.0174314
+0.0262968 0.070421 -0.0238548
+-0.0421212 0.159153 -0.0103433
+-0.0367588 0.172073 -0.0125043
+-0.0196292 0.117165 -0.0140584
+-0.042525 0.149193 0.00498605
+-0.0175612 0.186044 -0.0184493
+0.0221884 0.0973608 -0.0216774
+-0.0197019 0.0568866 -0.0331333
+-0.045504 0.0832988 0.0437099
+-0.0212803 0.0387041 -0.0133833
+-0.0770943 0.154164 -0.0118975
+-0.0484907 0.0833394 0.0445457
+-0.0238036 0.0798229 -0.0381557
+-0.0372926 0.0394674 -0.0291193
+-0.00273038 0.0683735 -0.0347173
+-0.0659296 0.14253 0.0416232
+0.0452769 0.0467388 0.0283148
+-0.0898014 0.11587 0.00528404
+0.0263587 0.0577877 0.0432503
+-0.0486968 0.067904 -0.0141574
+-0.0893812 0.113196 0.0217139
+-0.0841444 0.110242 0.00330414
+-0.0631329 0.17411 -0.0535854
+0.0348962 0.0387881 -4.46661e-05
+0.0431163 0.0888383 0.0261767
+-0.0444887 0.166716 0.00379579
+-0.0235591 0.0953745 -0.0271663
+0.0455985 0.0918132 0.00816712
+-0.0917403 0.12555 0.0418871
+-0.0890224 0.136404 0.0092064
+-0.0364114 0.175555 -0.00996795
+-0.0345906 0.0727451 -0.0199624
+0.0429111 0.040977 0.0196984
+0.00148534 0.0385845 0.0464325
+-0.0585016 0.0973698 0.0431908
+-0.0484982 0.0819185 0.0441136
+0.00821862 0.116409 0.0384227
+0.0456517 0.0413562 0.00923967
+-0.0769167 0.0873975 0.0382106
+-0.061867 0.101123 -0.0184855
+0.0202898 0.124676 0.0257091
+-0.0101432 0.130124 0.0117041
+-0.0138894 0.183111 -0.0237643
+-0.0707552 0.0792696 -0.0152786
+0.0465284 0.0761532 0.0136843
+-0.0888827 0.140531 0.0122011
+-0.0659605 0.110851 0.0377691
+-0.0638988 0.109582 -0.0144399
+0.0445103 0.0541956 0.0324876
+-0.0545376 0.0335773 0.0172858
+0.0156666 0.0726831 0.0525311
+-0.0224929 0.0448955 0.0530527
+0.00250097 0.0897336 0.0558646
+-0.0427601 0.128938 0.0129983
+-0.0749067 0.100837 0.0372176
+0.0100662 0.0792875 0.0550109
+0.031592 0.0738009 -0.0197207
+-0.0295595 0.111353 -0.0178807
+-0.0265381 0.155425 -0.00506198
+0.0110253 0.0793101 0.0546505
+0.0455932 0.0834007 0.019176
+-0.00963497 0.0389293 -0.00939263
+-0.0740278 0.157006 -0.00316778
+0.026879 0.121193 0.00250168
+-0.0840153 0.1376 0.000355984
+0.00144074 0.0344391 0.0153316
+-0.062494 0.0746373 0.0407954
+-0.0714338 0.100882 0.0394174
+-0.0511894 0.0558131 0.0154354
+0.0142545 0.0887312 0.0523539
+-0.0217647 0.0699552 -0.0378816
+0.042865 0.0958458 -0.000810373
+-0.0225278 0.18149 -0.0200273
+-0.0516224 0.0545433 -0.00792825
+-0.0894416 0.0943032 0.0194238
+-0.0450754 0.033637 -0.0171737
+-0.0189216 0.122512 -0.00768052
+-0.0278603 0.101566 -0.0234492
+0.0273313 0.094554 -0.020088
+-0.0568394 0.145329 0.0319256
+0.0299199 0.11779 -0.000781916
+0.0345811 0.0368089 0.0162808
+0.0130795 0.0927597 -0.0282037
+0.0239979 0.0768543 0.0488301
+-0.0560741 0.15232 0.0295584
+-0.0713082 0.165213 -0.0459899
+0.0214853 0.0948038 0.0473574
+-0.0124976 0.0472007 0.0479814
+0.0101747 0.096292 -0.0259611
+-0.0424942 0.0916602 0.0426604
+-0.000674255 0.10997 -0.0204918
+-0.0731036 0.0721584 0.0326952
+-0.0863191 0.0806349 0.0164939
+-0.0174959 0.0984963 0.0451272
+-0.0516134 0.0334804 0.007228
+0.0210892 0.0521114 0.044364
+-0.0767842 0.155599 0.0119802
+-0.0737106 0.0699801 -0.00251138
+0.0277999 0.0727164 0.0436883
+0.0605691 0.0637105 0.0171755
+-0.0720961 0.156364 0.000513559
+-0.0818934 0.154016 0.0102104
+-0.0184806 0.169783 -0.0146335
+-0.073631 0.173473 -0.03767
+-0.0385075 0.0888951 0.0435504
+-0.056184 0.0374619 -0.0105738
+-0.0164629 0.0616668 0.0525376
+-0.0214965 0.0525299 0.044709
+-0.0324599 0.0722556 -0.0254696
+-0.0781568 0.167257 -0.0305864
+-0.0633087 0.117017 0.0436447
+-0.084428 0.138004 0.0455627
+0.0287818 0.0480764 -0.0117305
+-0.0706135 0.175903 -0.0451833
+-0.0430742 0.0335089 -0.0222312
+0.0203664 0.0506236 -0.0244327
+-0.0807714 0.153393 0.00628177
+-0.0784635 0.138605 0.0489019
+-0.0754126 0.068174 0.019879
+-0.0105025 0.0773598 0.0576687
+-0.0399608 0.0418525 -0.0253044
+-0.0880973 0.137764 0.00820327
+-0.0862825 0.106347 0.0193454
+-0.0114851 0.123708 0.0326887
+-0.00700917 0.0348727 0.042072
+-0.0760973 0.0851761 -0.013541
+0.0421377 0.0912242 0.0276147
+0.0298218 0.119509 0.00500708
+-0.0550443 0.148674 -0.00204704
+-0.0107558 0.0386486 -0.0149703
+0.00849857 0.118254 0.0373924
+0.0373294 0.0848074 0.0364738
+0.0506886 0.0511228 0.0274131
+-0.0538924 0.106961 -0.0186698
+-0.0735555 0.105459 0.0371635
+-0.0532563 0.0343869 0.0309731
+-0.015483 0.0938222 0.0546278
+0.0454513 0.052559 0.0321398
+0.032601 0.100801 0.0367685
+-0.0688527 0.142579 0.0444582
+-0.0908832 0.150197 0.0161314
+-0.0811312 0.129963 0.0524484
+0.00846909 0.111301 0.0401143
+-0.0622744 0.0344133 0.0342699
+-0.0343155 0.0340522 0.0192395
+-0.0869096 0.111745 0.0223587
+0.0507656 0.0446256 0.0152142
+-0.0767707 0.151403 -0.00690852
+-0.00150011 0.103045 0.0440564
+-0.051019 0.147224 -0.00224048
+-0.025918 0.122982 0.0235755
+-0.0527617 0.0461943 0.0216742
+-0.0178184 0.0841429 -0.0390768
+-0.0345091 0.0461323 0.043875
+-0.0623881 0.149093 -0.0125752
+-0.0809179 0.0761444 0.0241516
+-0.00945917 0.175708 -0.0257473
+-0.0334992 0.0704401 0.0410454
+-0.0886682 0.141939 0.0121971
+-0.0120612 0.0383071 0.0127308
+-0.0853843 0.0980412 -0.000554198
+-0.0325205 0.0646875 0.0393461
+0.0503466 0.0615208 -0.00363326
+0.00449283 0.103624 -0.0217086
+-0.0698084 0.085099 -0.0171261
+0.0438316 0.0832073 0.0263179
+-0.0486418 0.0576652 -0.0108452
+0.0123248 0.0609207 -0.0293142
+0.0429772 0.0902337 -0.00478341
+-0.0619824 0.166238 -0.0535924
+0.0140441 0.0406072 0.0445814
+0.00249558 0.116934 0.0396534
+0.018473 0.0989902 0.0468145
+-0.0169827 0.0385945 -0.00497776
+0.0309161 0.0955754 0.0413413
+-0.0735982 0.110276 0.0438156
+-0.0903629 0.11521 0.0252935
+-0.0566835 0.124286 -0.00724626
+-0.0620082 0.134045 -0.00734981
+0.00521493 0.0852237 -0.0334342
+-0.0903999 0.124268 0.0448512
+0.0114719 0.1182 0.0365719
+0.0344326 0.0414166 -0.00330414
+-0.0403754 0.124077 -0.00919956
+0.0484547 0.0702338 0.00359645
+-0.0285016 0.113902 0.0349068
+-0.0526285 0.0596472 0.0276152
+-0.0325191 0.174119 -0.0148634
+-0.0204902 0.108532 0.041306
+0.010276 0.076623 0.0552854
+0.0133781 0.0537725 -0.0285433
+0.0402901 0.0698645 0.0318359
+0.0401742 0.0671588 0.0316675
+-0.0866887 0.120341 0.0484058
+0.0245253 0.0875975 0.0479106
+-0.050498 0.0890212 0.0452499
+-0.0598028 0.0853759 -0.0202992
+0.0354525 0.106753 -0.0069512
+0.0111874 0.0630268 0.0529412
+-0.0416003 0.12872 0.00602836
+0.0443487 0.0533892 -0.00643258
+-0.0229394 0.0985982 0.0448104
+-0.0678177 0.0894605 -0.0172539
+-0.0826703 0.0762102 0.00250991
+-0.0152189 0.172708 -0.0246075
+-0.0748382 0.0978559 -0.0133191
+0.0284295 0.0955564 0.0430179
+-0.04802 0.136068 0.0153684
+-0.0475691 0.0489734 -0.00936479
+-0.0813576 0.0734641 0.0155425
+-0.07594 0.14997 -0.0178724
+-0.0649871 0.152354 -0.0372683
+-0.0229947 0.122243 0.0275866
+-0.0108296 0.0855471 -0.0384547
+-0.0447583 0.0336472 -0.00973579
+-0.041838 0.0942787 -0.0228038
+-0.038857 0.101401 -0.0214118
+0.00839351 0.0342854 -0.0184828
+0.0436422 0.0748109 -0.00280304
+0.00409443 0.101828 -0.021842
+-0.0194474 0.054231 0.0477027
+0.0410346 0.0752467 0.03121
+0.0588047 0.0677091 0.00614939
+0.021598 0.10091 -0.0208238
+-0.0696323 0.156261 0.0232204
+-0.086966 0.0846591 0.00747852
+-0.0660124 0.176151 -0.0507054
+0.0425261 0.101486 0.00616657
+0.0305131 0.0418181 0.0291512
+-0.0554982 0.113948 0.0354054
+-0.0763852 0.108818 0.0389983
+-0.0785959 0.152697 0.00118419
+0.0184567 0.127794 0.00934393
+0.0105917 0.043143 0.0448676
+-0.0719858 0.0346482 0.00381826
+-0.0341243 0.0335931 -0.0280196
+-0.0564439 0.115317 0.036137
+-0.0928438 0.126838 0.0112559
+-0.0661071 0.164936 -0.0219713
+-0.0665376 0.142546 0.0425061
+-0.0167827 0.0388081 0.0329676
+-0.0614351 0.156032 0.020314
+0.0388231 0.106965 0.0221712
+0.0247856 0.0449735 0.0390757
+-0.0324984 0.0788891 0.0412743
+-0.068331 0.155325 0.0280685
+0.0267262 0.114038 0.0335472
+-0.0888783 0.111909 0.0103621
+-0.0772308 0.0920788 -0.012603
+0.0457689 0.0431024 0.0219801
+0.0474981 0.0737139 0.0139878
+-0.061487 0.0746791 0.0411579
+-0.0861526 0.148758 0.00721004
+0.0341879 0.0913684 -0.0166968
+-0.0200728 0.100101 -0.0240875
+-0.0286491 0.125506 0.0152069
+-0.0268606 0.0378639 0.0137313
+-0.0352216 0.0346633 0.0327857
+-0.0444613 0.12936 0.0182577
+0.0373383 0.0740435 0.0363986
+0.00751373 0.0869673 0.0561316
+-0.0888328 0.0942898 0.0224093
+0.00897858 0.127106 -0.00499333
+0.0363106 0.0994119 0.033375
+-0.0448194 0.0913346 -0.0221278
+0.000368669 0.0466323 -0.0286891
+-0.0606782 0.0639978 0.0300882
+-0.0735086 0.078138 -0.0125733
+-0.0358361 0.11045 -0.0189078
+0.0300578 0.0632721 0.0416198
+0.0173543 0.0349384 0.0362289
+-0.0104845 0.10863 0.0429333
+-0.0265155 0.115287 0.0336658
+0.0257868 0.0967214 -0.0203669
+0.0255714 0.119263 0.0291067
+-0.0404457 0.119913 -0.0128413
+-0.0596429 0.0622343 0.0265494
+-0.0522074 0.122732 -0.00965468
+0.00419216 0.0340885 -0.0190827
+-0.0614977 0.108395 0.0385563
+-0.0154933 0.0392591 0.0382209
+0.0568425 0.0592039 0.0011688
+0.033494 0.0619462 0.0395497
+0.0378948 0.0699732 0.0354084
+-0.0643687 0.155314 0.00767719
+-0.017163 0.124753 -0.00408239
+-0.0892062 0.128127 0.00426293
+-0.058497 0.101559 0.0426268
+-0.00170163 0.130406 0.0219933
+0.0258358 0.123453 0.0120756
+0.0200283 0.102079 0.0449293
+-0.0034976 0.0965806 0.0535793
+-0.0805988 0.090913 -0.0086158
+0.0307316 0.091606 0.0428217
+0.0293141 0.095566 0.0425395
+0.011103 0.0779768 0.0547588
+-0.0912353 0.14886 0.0211316
+0.0484812 0.0443317 0.021366
+-0.00581925 0.0868408 -0.0369183
+-0.0454559 0.0902978 0.0432333
+-0.0346794 0.119765 -0.0106544
+-0.00349323 0.113677 -0.0184484
+-0.0434907 0.101526 0.0420227
+-0.0385061 0.0986889 0.0419871
+-0.0599081 0.112539 -0.0152225
+-0.0242322 0.124794 -0.000701199
+0.0400813 0.104202 0.0221684
+-0.0828121 0.0830332 0.030132
+0.0159137 0.128436 0.00413586
+-0.0645186 0.0597262 0.00993302
+-0.0324512 0.0353306 -0.0309147
+-0.0484861 0.137101 0.00939484
+-0.0304745 0.0860755 0.0433189
+0.0188415 0.121733 -0.00718615
+-0.0643746 0.145275 -0.0151376
+0.0208541 0.11855 -0.00976629
+0.037465 0.0434297 0.0291248
+0.0517879 0.0461689 0.0072143
+-0.0837871 0.0829476 0.0282971
+-0.0917215 0.129668 0.0302355
+-0.0261628 0.0674202 -0.0335157
+-0.0631555 0.156855 -0.014582
+0.043463 0.077603 -0.00378219
+-0.0602407 0.058232 0.0121428
+-0.0458636 0.102811 -0.0213024
+-0.038884 0.108506 -0.019659
+-0.0705258 0.142815 0.0451961
+-0.0781039 0.070111 0.0193756
+-0.0758474 0.109198 0.0406016
+-0.0318501 0.0986369 -0.02282
+-0.038215 0.0471675 -0.018189
+-0.0134374 0.0516868 0.0502089
+0.0151412 0.0754034 0.0535569
+-0.043493 0.105703 0.0408668
+-0.0822959 0.0773319 0.0228488
+0.0452717 0.0903987 0.0151606
+0.0159567 0.120613 0.0338084
+-0.0623049 0.142641 -0.00633906
+0.000467241 0.105823 0.0432483
+-0.0177409 0.0671746 -0.0379913
+-0.0891252 0.0889064 0.0184472
+-0.0678748 0.125664 0.0510849
+-0.0337468 0.127104 0.0118588
+-0.0518684 0.102767 -0.0207881
+0.00221584 0.0364728 0.00081639
+-0.0296253 0.0759773 0.0411397
+0.00226876 0.0682822 -0.0333186
+-0.0542457 0.0574384 0.01981
+-0.0659991 0.136994 -0.00799651
+-0.00357593 0.127459 -0.0052112
+0.0103564 0.0538895 -0.0297771
+0.0272815 0.0718243 -0.0235929
+-0.0123281 0.0344052 -0.018857
+0.0416155 0.0404142 0.0199255
+-0.0106878 0.0598858 -0.0348312
+-0.0305006 0.116618 0.0322439
+0.0427332 0.084569 0.0284544
+-0.0712328 0.151001 -0.0437008
+0.0423623 0.0944394 0.0261744
+-0.000687654 0.0583509 -0.0327859
+-0.0779789 0.136876 -0.0051311
+-0.0657518 0.0780369 -0.0174491
+-0.0789069 0.155396 0.0141592
+-0.0701046 0.156748 -0.048906
+0.0281353 0.0593598 -0.0207767
+-0.066567 0.147777 -0.0287654
+-0.0167976 0.0383562 0.00264497
+-0.0708835 0.160996 -0.0449446
+0.0230988 0.111339 0.037076
+-0.0237033 0.091176 -0.0348871
+-0.0477118 0.073839 -0.0167643
+-0.0540526 0.0334248 -0.00589512
+-0.0535445 0.0389126 -0.0111352
+0.00251277 0.0675114 0.055914
+-0.0324736 0.0532348 0.0372028
+-0.0416459 0.056333 -0.0114534
+-0.0460476 0.0363198 0.0451262
+-0.0215027 0.163915 -0.00845889
+-0.0530817 0.139518 0.0266624
+-0.00971954 0.0656257 -0.0358484
+-0.0175293 0.038199 0.0153321
+-0.0388176 0.128112 0.00411022
+-0.0579212 0.120852 -0.00959233
+-0.0215953 0.03793 -0.0285032
+0.00849245 0.0473031 0.0488481
+-0.045123 0.157633 -0.00869072
+-0.0845016 0.0911794 -0.00456302
+-0.0130394 0.0384127 0.00153612
+-0.0054932 0.111405 0.0422861
+-0.00614297 0.0385457 0.0227705
+-0.0588822 0.108299 -0.017343
+-0.0647452 0.0766241 -0.0174472
+0.0333079 0.0768384 0.0411622
+-0.0345058 0.0704863 0.0415356
+-0.00385823 0.0988046 -0.0266644
+-0.0940576 0.125561 0.0242759
+-0.0406606 0.156554 0.00601794
+0.0458479 0.0724092 0.00333418
+-0.0536298 0.0345249 0.0429297
+0.0422446 0.0760949 -0.00580476
+0.0305908 0.106106 0.0356297
+-0.0744956 0.13026 0.0524093
+-0.060795 0.0853339 -0.0197774
+-0.0659276 0.123847 -0.00897257
+-0.0587952 0.0334058 0.000425547
+-0.0355002 0.111108 0.0360398
+0.0106562 0.0589179 0.0524466
+0.0220342 0.108737 -0.0152173
+0.0414017 0.104253 0.00516521
+-0.0487319 0.132909 0.0254731
+-0.073147 0.0648981 0.0178865
+-0.0655672 0.149686 0.0379738
+-0.0866855 0.14466 0.00818677
+-0.0690156 0.163795 -0.0519803
+0.0474899 0.0664975 0.0274045
+-0.0693729 0.175081 -0.056043
+-0.0811978 0.140383 -0.00182247
+-0.0609117 0.111106 -0.0154828
+-0.027448 0.125478 0.0053817
+-0.0601827 0.0460596 0.0101722
+-0.0116048 0.0377441 -0.0259987
+-0.0623577 0.147557 -0.00658086
+-0.0635933 0.167459 -0.0411888
+-0.0420303 0.153306 -0.00761985
+0.0045298 0.102977 0.0440255
+-0.0571296 0.124118 0.0402058
+-0.010491 0.0487865 0.0492904
+-0.00149595 0.0911539 0.0561263
+-0.0644925 0.0903995 0.0447493
+-0.0621097 0.156825 -0.0345957
+-0.0626845 0.0455625 -0.000282658
+-0.054778 0.0344845 0.0375447
+-0.0704967 0.156763 -0.0469167
+-0.0501084 0.0429877 0.0445637
+-0.074873 0.120838 -0.00772479
+0.0354301 0.112103 0.00127449
+-0.0218649 0.103029 -0.0235712
+-0.09096 0.148814 0.0141536
+-0.0645626 0.0459512 0.00669838
+0.0314584 0.111437 -0.00809824
+-0.022876 0.0362943 -0.0189473
+-0.0428901 0.0435976 -0.0193145
+-0.0746823 0.0663852 0.00625465
+-0.0476209 0.0547841 -0.0103184
+-0.0197585 0.171251 -0.0147167
+-0.0705035 0.0901829 0.0418541
+0.0494272 0.0628335 -0.00296645
+0.0266028 0.105322 -0.0155495
+0.0202061 0.126966 0.0100746
+0.013717 0.127103 0.0275992
+0.00956448 0.122301 -0.0117968
+-0.0846111 0.084433 -0.00253466
+-0.0889485 0.13651 0.0272017
+-0.000398103 0.0385343 0.0221462
+0.0428913 0.0402636 0.016655
+-0.0531156 0.156084 -0.00339606
+-0.0586999 0.141645 -0.00399496
+0.0175889 0.0549386 0.0481228
+0.0242735 0.0576737 -0.0247443
+-0.0435028 0.0548283 0.0392794
+-0.0509876 0.0343016 0.0280109
+-0.0371778 0.128019 0.00618657
+-0.067159 0.152634 -0.0476967
+-0.0524481 0.115128 -0.0157418
+-0.00787248 0.0390234 0.0328097
+-0.0368889 0.109941 -0.0191779
+0.0473251 0.0497353 0.0295737
+-0.0155015 0.10721 0.0425067
+-0.0607907 0.0609394 -0.0015406
+0.0214998 0.0358071 0.0181694
+-0.0152794 0.114388 -0.017154
+-0.0618553 0.153745 -0.0235803
+-0.00541506 0.100313 0.0476265
+0.0438051 0.0987511 0.0101628
+-0.0274965 0.0973724 0.0435854
+0.0448746 0.0601039 -0.00424277
+0.031559 0.0460718 0.0312637
+-0.0615188 0.0448284 0.0115308
+-0.0397761 0.115072 -0.015742
+-0.0918654 0.131039 0.0272344
+-0.0646035 0.156332 -0.00986181
+0.0383993 0.0413521 -0.00190432
+-0.026722 0.0386646 -0.0162927
+-0.0736148 0.0995067 0.0387799
+0.006499 0.119638 0.036869
+0.0405971 0.101404 0.0241737
+-0.0944613 0.121476 0.0212834
+-0.0105851 0.0337493 -0.0235512
+-0.0799934 0.136838 -0.00393652
+0.0529009 0.0462649 0.0122044
+-0.0539028 0.11125 -0.0176614
+0.00874316 0.130156 0.0228898
+0.0260633 0.114349 -0.00924148
+0.0113837 0.0449118 -0.0251572
+-0.0461015 0.150679 0.0086365
+0.00236523 0.128663 -0.00254763
+-0.0158845 0.0910066 -0.0366604
+0.0456174 0.0890068 0.0121612
+-0.0634393 0.144588 -0.0113838
+0.0175304 0.120577 0.0333463
+-0.0256229 0.0463679 -0.0270847
+-0.0606463 0.0343588 0.0329219
+-0.0622926 0.149098 -0.0115749
+-0.0266239 0.0463597 -0.0270834
+0.0142234 0.0864184 -0.0301272
+-0.0242795 0.0383175 -0.000652306
+-0.0599506 0.0340585 0.0228145
+-0.031899 0.0595768 -0.0154053
+0.0335035 0.0686838 0.0396083
+-0.00350655 0.105885 0.0441283
+-0.00849376 0.0576353 0.0542501
+-0.0596861 0.0693591 -0.0143393
+-0.0246408 0.0382637 -0.00251941
+0.0142384 0.0723592 -0.0308856
+0.0360996 0.112682 0.0101589
+0.00650478 0.0989998 0.0481043
+-0.0406764 0.0344836 0.0353061
+0.0208126 0.114503 -0.0133998
+-0.0664042 0.0385079 0.0306689
+-0.00851871 0.0471234 0.047663
+-0.0607941 0.143953 0.0367655
+-0.0469959 0.06153 0.0374819
+-0.0566078 0.0521283 0.00668717
+-0.0117953 0.0827249 -0.0387188
+-0.0651684 0.0346977 0.0334093
+0.0334291 0.0781951 0.0413414
+-0.00319773 0.0384234 0.00715593
+-0.0255204 0.115294 0.0339151
+-0.070852 0.100833 -0.0142398
+-0.0647775 0.0824087 -0.0188685
+0.0351918 0.0673501 0.0385292
+-0.0201767 0.0929008 -0.0346271
+-0.0292631 0.0351386 0.0510616
+-0.0487306 0.0345868 0.0335095
+-0.0909618 0.13376 0.0242167
+-0.0399614 0.0343338 -0.0130933
+0.0409886 0.0643095 0.0292691
+-0.0656099 0.0655077 0.0295065
+0.0113576 0.0509388 -0.0282254
+-0.0831709 0.101988 -0.00359129
+-0.0345055 0.113874 0.0339275
+0.0308648 0.0460986 0.0320207
+-0.023595 0.180085 -0.0196757
+0.056025 0.0493916 0.0151904
+-0.0805557 0.0977534 -0.00758611
+0.0084218 0.0346373 0.0418695
+-0.0774116 0.159696 -0.0249188
+0.0602932 0.0636878 0.00814035
+-0.0302474 0.125253 0.00290344
+-0.0741812 0.074527 0.0339368
+-0.0636646 0.15831 -0.045603
+-0.0332687 0.15271 -0.00392746
+0.0267163 0.0450608 -0.00869474
+0.0351226 0.0921155 -0.0154837
+-0.0278275 0.158128 -8.54892e-06
+-0.0771542 0.152814 -0.00588992
+0.00726262 0.0682112 -0.0321527
+-0.0590296 0.0424919 -0.00727859
+-0.0604873 0.0987275 0.0428004
+-0.0916073 0.128323 0.0352449
+0.0474407 0.0661575 -0.000283122
+0.03984 0.106962 0.00517391
+-0.0609078 0.155801 0.00889681
+-0.00849418 0.114178 0.0409373
+0.00894357 0.0819404 0.0551438
+-0.0767684 0.0756527 -0.0076025
+-0.0670227 0.0607355 0.00842954
+-0.0186908 0.0510113 -0.0307584
+-0.0706351 0.0733936 -0.01149
+-0.026674 0.0382695 0.00254021
+0.0585127 0.0649229 0.00410871
+0.0241246 0.0605253 0.0453245
+0.0172623 0.073643 -0.0290458
+-0.0564969 0.111123 0.0367634
+0.0543584 0.0674371 0.0258007
+-0.0511173 0.128308 0.0330935
+-0.075231 0.151315 -0.0248804
+-0.0492462 0.132382 0.000177088
+-0.0694944 0.11756 0.0525327
+-0.0721635 0.113702 0.0503204
+-0.0647819 0.0809531 -0.0185144
+0.00336694 0.130688 0.00234495
+0.0243671 0.0699418 0.0457082
+-0.000607851 0.0448652 -0.0263872
+-0.0506782 0.141637 0.0173818
+-0.0618089 0.0881716 -0.0191682
+-0.0886021 0.087516 0.0174642
+0.011433 0.034701 0.0261941
+-0.0405676 0.171048 0.000226569
+0.0111139 0.110132 -0.0191278
+0.0136046 0.121889 0.0339065
+-0.0107442 0.0742291 -0.0379783
+0.0438711 0.0959127 0.00218342
+-0.0299153 0.155169 -0.001314
+-0.0469317 0.0369443 -0.0162782
+-0.0887949 0.142048 0.03516
+-0.0459209 0.0346888 0.0375199
+-0.0022788 0.119988 -0.0131916
+0.00522675 0.0768423 -0.034472
+-0.0277078 0.0725313 -0.0348614
+-0.0679296 0.125304 -0.00887173
+-0.0528849 0.101359 -0.0212107
+0.0356786 0.076967 -0.014745
+-0.0567974 0.0854612 -0.0213212
+0.00206285 0.121236 -0.012553
+-0.0659186 0.159142 -0.0118027
+-0.0857862 0.0939971 -0.00056361
+-0.0318889 0.124978 0.0199371
+0.0110379 0.0712445 0.0546046
+-0.043282 0.147753 0.00390043
+0.0142589 0.0737441 -0.0304465
+-0.037534 0.168232 0.00175297
+0.0421124 0.0467315 0.0307997
+-0.0195242 0.0336044 -0.023287
+-0.0581683 0.0606896 -0.00283185
+-0.0892904 0.149814 0.024685
+-0.0328117 0.0335416 -0.0258378
+-0.0534094 0.150878 0.0234093
+0.0224588 0.120521 -0.00588511
+0.0297724 0.0549903 0.0393628
+-0.0689711 0.136995 -0.00816407
+0.0327608 0.11383 -0.00261931
+-0.0138771 0.164812 -0.0186885
+0.00401259 0.0341521 0.00329327
+-0.0776837 0.154812 0.0263001
+-0.0617213 0.0781294 -0.0185002
+0.0405341 0.105626 0.00416435
+-0.033143 0.157873 -0.0118064
+-0.0244152 0.0723023 0.0471532
+0.000983167 0.0373381 0.00163376
+-0.0227666 0.126779 0.0143916
+-0.0151278 0.128803 0.00988702
+0.000514565 0.0717586 0.0570729
+0.0202169 0.0591906 0.0484605
+-0.0591321 0.0334434 -0.0069378
+-0.0338188 0.0345795 0.040191
+-0.000499113 0.11695 0.0400287
+-0.0463678 0.13079 0.00400616
+0.0171482 0.0349466 -0.009792
+-0.064905 0.0607648 0.0196679
+-0.0624362 0.150651 -0.0105777
+-0.0354607 0.154847 -0.00919588
+-0.0211471 0.0377711 0.0538261
+-0.0691709 0.147293 -0.0286567
+-0.0360974 0.127648 0.0124754
+-0.0776508 0.151441 -0.00388634
+0.0365033 0.0512847 0.031619
+0.0193623 0.0370952 -0.00967348
+0.0153438 0.0522442 -0.0271619
+-0.0174947 0.0815257 0.0576296
+-0.0629203 0.122369 -0.00879811
+0.0168951 0.128644 0.0116162
+0.0397845 0.0699028 0.0328672
+0.00847616 0.0963576 0.0505263
+-0.0532837 0.0454354 0.0434394
+-0.0154326 0.0388218 -0.0141873
+0.058968 0.0691324 0.00813536
+-0.0155327 0.116851 0.0372458
+-0.0261049 0.0632214 -0.0314499
+-0.0580383 0.122682 0.0406302
+-0.0153478 0.0972963 0.0501876
+-0.0480268 0.116533 -0.0152488
+-0.0440293 0.0378087 0.0445145
+0.0122229 0.0822322 -0.030844
+-0.00477881 0.0390844 -0.0104359
+-0.0106511 0.0496684 -0.0311061
+-0.0197213 0.123533 0.0272668
+-0.000499702 0.119705 0.0381547
+-0.0497662 0.165331 0.00186024
+0.0034577 0.0989815 0.0493164
+-0.0623164 0.153672 -0.0306063
+-0.0676947 0.134039 0.046063
+-0.0536041 0.0588172 -0.00776341
+-0.0774688 0.144183 0.0446652
+-0.054123 0.064196 0.0330627
+-0.0515128 0.0452783 0.043411
+-0.0216106 0.0422609 -0.0287762
+-0.0721201 0.0655088 0.0210948
+-0.0214414 0.0682091 0.0499624
+0.0246691 0.103387 0.0411037
+-0.0584632 0.0480819 0.000648377
+-0.0193941 0.113623 -0.0183331
+-0.0642327 0.0431706 0.0367918
+-0.0673041 0.044774 0.00468689
+0.00124491 0.0726488 -0.0351082
+0.0293752 0.0646271 0.0424024
+0.0334188 0.0399387 -0.00226403
+-0.0648162 0.092445 -0.0185198
+-0.0588392 0.0371017 0.0463605
+-0.0464973 0.113852 0.0344899
+-0.0253214 0.158135 -0.00165461
+0.0565751 0.0564133 0.00219071
+-0.0628971 0.106793 -0.0162163
+-0.0672273 0.135447 0.0449702
+-0.0874127 0.118983 0.0477049
+0.0264339 0.0415833 -0.00518191
+-0.0649816 0.114139 0.0429675
+-0.087689 0.0861087 0.0184696
+-0.0759388 0.151364 -0.016882
+-0.00938485 0.0992897 -0.0251913
+-0.0906583 0.12815 0.00627512
+0.0420818 0.101483 0.016165
+-0.0366993 0.124957 -0.00615077
+0.0344101 0.0633165 0.0391255
+0.0312208 0.0578184 0.0397344
+-0.0245116 0.0679611 0.0445844
+-0.0494967 0.0932039 0.0445022
+-0.0762012 0.149986 -0.0138757
+-0.0469178 0.060141 0.0374462
+-0.0939221 0.128285 0.0202478
+-0.0488103 0.0898531 -0.0217755
+-0.013542 0.129298 0.0162538
+0.0557083 0.0616421 0.000366134
+0.0340796 0.0848941 0.0405554
+0.0303873 0.0525299 -0.0147333
+0.0173214 0.127268 0.00181685
+-0.0623602 0.164675 -0.0475927
+-0.0633366 0.0613129 -0.000511486
+-0.0663574 0.0370366 0.0151548
+-0.0567588 0.053509 0.00466959
+-0.082746 0.0802849 -0.00049163
+-0.00173892 0.0697883 -0.0347021
+-0.0444708 0.0888726 0.0431834
+-0.0676524 0.0720092 -0.0120172
+0.0578262 0.0552267 0.0219335
+-0.0418656 0.104235 -0.0206965
+0.0300166 0.0708304 -0.0207823
+-0.0533336 0.128311 0.0351755
+-0.0275965 0.0836272 0.048557
+-0.0894883 0.139285 0.0301857
+0.0461177 0.0511569 0.0313544
+0.0505588 0.0711508 0.00463977
+-0.0653079 0.154958 0.0291369
+-0.0185448 0.0460852 0.0515079
+-0.0843685 0.105877 0.0253348
+-0.0875722 0.151019 0.0254764
+-0.0711952 0.0805577 0.0397762
+0.0367726 0.100261 -0.0101361
+0.0280869 0.0432543 0.0332457
+0.000487446 0.041412 0.0465786
+-0.0266388 0.038336 -0.00299264
+-0.00342216 0.0391144 -0.00832149
+-0.0611289 0.0344725 0.039662
+-0.0517362 0.0738243 -0.0167692
+-0.0804236 0.104574 -0.00559216
+-0.0319013 0.0525534 -0.0124561
+-0.0616634 0.0612417 -0.00198952
+-0.0659473 0.151954 -0.0393992
+0.0336372 0.112962 -0.00230707
+-0.0699642 0.138462 -0.00776795
+0.00139789 0.0405023 -0.0245871
+-0.059508 0.0890036 0.0450344
+-0.0550222 0.141298 -0.00203484
+-0.0720681 0.0805547 0.0392361
+0.0126182 0.0846922 0.0534757
+0.0593665 0.0622129 0.00511321
+-0.0924363 0.118744 0.0263157
+-0.0166806 0.0510876 -0.0315182
+0.0119118 0.0342207 -0.00263798
+-0.0646486 0.156189 0.0162701
+-0.022872 0.104437 -0.0231879
+-0.0799264 0.129511 -0.00520384
+0.0394641 0.063132 0.032359
+-0.0114897 0.0951792 0.0542781
+-0.0474976 0.111158 0.0371638
+-0.0683525 0.155277 0.00186884
+-0.000867993 0.104495 -0.0223762
+-0.0462686 0.12794 -0.00315273
+-0.0306198 0.11135 -0.017885
+-0.0420238 0.0464078 -0.0143471
+-0.0115071 0.0801438 0.0578104
+-0.00552471 0.130134 0.0220582
+0.0553699 0.0651884 0.000788532
+0.000971023 0.0370418 -0.0149189
+-0.0695999 0.162389 -0.0499627
+-0.0593254 0.0447426 0.0431798
+-0.0163529 0.16023 -0.0109161
+-0.0074892 0.108662 0.0435531
+-1.59767e-05 0.130672 0.0211571
+-0.0414957 0.0762285 0.0430404
+-0.00181283 0.0854279 -0.036655
+-0.0573252 0.157131 0.000943525
+-0.0582662 0.0597287 0.0219286
+-0.0158083 0.0827626 -0.0393641
+-0.0636754 0.156752 -0.0416076
+-0.0399677 0.0461402 -0.0203282
+-0.025156 0.16972 -0.0189618
+-0.0527747 0.0826622 -0.0215537
+0.0251411 0.10209 0.0417928
+-0.043632 0.0462886 -0.0112814
+-0.0620154 0.164635 -0.0555847
+0.0104502 0.0343141 -0.0181143
+-0.0391566 0.162183 -0.0124024
+-0.0483573 0.129635 0.0282843
+0.00538744 0.0448871 -0.0255741
+-0.0054947 0.0533903 0.0535249
+-0.00732851 0.0942973 -0.033961
+-0.0241934 0.0388427 0.0350005
+-0.0181599 0.0393223 0.0394029
+0.0346554 0.10439 -0.0105413
+-0.0459466 0.0345121 -0.0200076
+-0.0409396 0.168342 -0.0108401
+0.0103005 0.0624571 -0.0307796
+-0.0681652 0.158429 -0.00684039
+-0.00243741 0.0385239 0.0217416
+0.060795 0.0623425 0.0151668
+-0.0927217 0.128206 0.0112525
+-0.0740576 0.168348 -0.0248615
+-0.0345432 0.114978 -0.015669
+-0.0591204 0.0334451 -0.00148219
+-0.0599836 0.043576 0.0142711
+-0.0568374 0.0898133 -0.021762
+-0.0727774 0.16869 -0.0244081
+-0.00877695 0.169647 -0.023748
+-0.0733702 0.171289 -0.0318245
+-0.0533609 0.033209 0.01963
+-0.012858 0.0386932 -0.00424091
+0.0446984 0.0804984 -0.000780025
+-0.0604981 0.105663 0.0403307
+-0.0437727 0.082626 -0.0206932
+-0.0251898 0.0388783 0.0347661
+-0.00550353 0.0561986 0.0539335
+-0.0649478 0.164181 -0.0229827
+-0.0145881 0.165422 -0.0124907
+-0.0415058 0.0577139 0.0401965
+0.0385298 0.0631329 -0.0097765
+-0.0643222 0.166215 -0.0313693
+-0.0769851 0.0690914 0.0187275
+-0.013127 0.120519 -0.0116431
+-0.0624813 0.156041 0.0199412
+-0.0475747 0.0390527 -0.0120963
+0.0154157 0.0433241 -0.0236953
+-0.00124361 0.130098 0.0236021
+-0.00149237 0.118319 0.0391398
+-0.0454304 0.130382 0.00608349
+0.0094151 0.117047 -0.0161127
+-0.0370213 0.0344129 0.0343812
+-0.0266349 0.121939 -0.00696588
+-0.0514954 0.0833657 0.0447762
+-0.0661547 0.1622 -0.0162285
+0.0354074 0.0446129 -0.00524037
+-0.0839561 0.144602 0.00415973
+-0.0114934 0.104435 0.0434539
+-0.0811445 0.153633 0.00754624
+0.0416181 0.0637615 0.0286411
+0.0336503 0.0646637 0.0398008
+0.00904657 0.129598 0.024451
+-0.075728 0.151337 -0.0208826
+-0.047856 0.132056 0.00259359
+-0.0635915 0.15525 -0.0109401
+-0.025528 0.0383109 0.0298198
+-0.0664625 0.145705 -0.0206681
+-0.0675712 0.139722 0.0445155
+-0.0630199 0.134039 -0.00765574
+-0.0859393 0.101835 0.0256124
+-0.0530219 0.147196 -0.00187885
+-0.00620458 0.038993 0.0313778
+0.0378425 0.10835 0.0231802
+-0.0877357 0.0860979 0.0084778
+0.0064767 0.115498 0.0396093
+-0.027105 0.162286 -0.015104
+-0.0801261 0.144525 -0.00183492
+-0.0858754 0.148602 0.0326009
+-0.060661 0.155018 0.0264156
+-0.0104794 0.0575747 0.0533869
+-0.0433 0.0336903 -0.024306
+-0.0668671 0.0980924 -0.0163226
+-0.0682097 0.171724 -0.0385204
+0.049328 0.0615911 -0.00371844
+-0.059497 0.0861573 0.0445009
+-0.0875265 0.087486 0.0224433
+-0.0660555 0.0600044 0.0111686
+-0.0578054 0.142438 0.0322424
+0.00123277 0.0783068 -0.0354173
+-0.0916354 0.132395 0.0252256
+-0.0117599 0.104933 -0.0231377
+-0.0346346 0.0548282 -0.01038
+-0.0222409 0.0383275 -0.000251248
+0.00824961 0.0725345 -0.0333305
+0.0313861 0.0740897 0.0418701
+0.0164934 0.100411 0.0468922
+-0.0719809 0.156292 0.0165776
+-0.0221908 0.175658 -0.0213821
+-0.00588737 0.108814 -0.0225516
+0.0336337 0.112484 -0.0031866
+-0.0393568 0.123991 -0.00912015
+-0.00841793 0.0387705 -0.00155909
+-0.0431088 0.0347881 0.0415217
+-0.0281377 0.171231 -0.00924208
+0.0317135 0.0955631 0.0407455
+0.0166807 0.124611 -0.00431903
+-0.0923991 0.132355 0.0192227
+0.0141807 0.0900592 0.0522594
+-0.0553478 0.054711 -0.00338754
+-0.0742948 0.147166 -0.0148659
+-0.0210322 0.0623911 0.0469253
+-0.0808524 0.0720445 0.00954101
+0.0185494 0.0379494 0.0423026
+-0.0841291 0.0817203 0.00248105
+0.0309459 0.0700081 0.0411857
+-0.0394974 0.0705046 0.0418138
+-0.0762918 0.169333 -0.0300921
+-0.0537237 0.0477139 0.0256667
+0.0448999 0.0861351 0.000186186
+-0.0313094 0.0384531 -0.00773361
+-0.0305219 0.0474445 0.0454913
+-0.0809514 0.0882189 -0.0076035
+0.0546575 0.0706779 0.0225865
+-0.0414965 0.0986758 0.0418571
+-0.0484435 0.0628471 0.0360579
+0.0594927 0.066407 0.020186
+-0.0627925 0.0838575 -0.0191674
+-0.0214511 0.184864 -0.013038
+-0.0935392 0.129637 0.0202382
+-0.0799546 0.100457 -0.00758867
+-0.0552688 0.126926 0.0376418
+0.0378584 0.0645918 0.0353403
+-0.0361046 0.0383233 -0.0122787
+-0.049226 0.14015 0.0123965
+-0.0164997 0.0938314 0.054193
+-0.0746007 0.0914774 0.0400082
+-0.0791205 0.0709783 0.00599758
+0.0253641 0.0347082 0.00521179
+-0.0594957 0.0918578 0.0453847
+0.0136708 0.0820393 0.0532361
+-0.0193315 0.182966 -0.0230088
+-0.000544127 0.127196 -0.00494172
+-0.030476 0.0664272 -0.0264734
+-0.0734051 0.0674458 0.022683
+-0.0136727 0.0337044 -0.0241151
+0.0214461 0.036336 0.0158614
+0.0583506 0.0662943 0.00413175
+-0.0639059 0.118033 -0.00945272
+-0.0454908 0.0987379 0.0426533
+-0.0318359 0.0344957 0.0406866
+-0.0657843 0.167288 -0.0290298
+0.0181885 0.053509 0.04724
+-0.0610973 0.169393 -0.058599
+-0.0167464 0.108538 -0.0209441
+-0.0826184 0.0802381 0.0286257
+-0.0731223 0.134062 0.0505767
+-0.0135829 0.03702 0.0510108
+0.0354665 0.0768048 0.0390018
+0.0499493 0.051169 0.0281186
+-0.00858939 0.0389741 -0.00922854
+-0.0482262 0.166987 -0.00394405
+0.000506781 0.0605965 0.0560209
+-0.0571262 0.0333733 -0.00101401
+-0.0527176 0.0611373 0.029069
+-0.0225206 0.0919822 0.0517607
+-0.0727584 0.158224 -0.0349231
+0.0221671 0.123584 -0.0006811
+-0.0697019 0.142554 0.0449861
+-0.0890361 0.146068 0.0101777
+0.0300144 0.0389449 0.0261617
+0.0457459 0.0834058 0.0171675
+-0.0828165 0.0790258 0.0245191
+-0.0216847 0.180158 -0.0138785
+-0.0260473 0.11708 -0.0139183
+-0.0263102 0.123352 0.021955
+-0.026277 0.0795343 0.0501986
+-0.04015 0.0473434 -0.014266
+-0.0911404 0.129685 0.035237
+-0.0376719 0.114063 -0.0167039
+-0.0138183 0.0855391 -0.0388001
+-0.0574963 0.111121 0.0367615
+-0.0459611 0.149058 -0.0040494
+-0.06359 0.153594 -0.035633
+0.0294595 0.116659 -0.00368699
+-0.0465112 0.0491437 0.0387964
+-0.0476612 0.135572 0.0133995
+-0.0122712 0.0385653 -0.000297189
+0.0438612 0.0930832 -0.000804157
+-0.00849948 0.0911907 0.056727
+-0.0554517 0.0444829 -0.0071986
+0.0112279 0.0808839 -0.0317275
+-0.0364414 0.0346808 0.041293
+-0.0768829 0.108524 0.037335
+-0.0212115 0.177139 -0.0220322
+-0.0498078 0.0898419 -0.0216876
+0.00832653 0.130915 0.00561741
+-0.0834391 0.153089 0.025871
+-0.0797915 0.0746069 -0.00248195
+0.0162926 0.0348913 0.030635
+-0.0720312 0.141354 -0.00781974
+-0.0640613 0.0606361 0.00380817
+-0.0616877 0.169385 -0.0545934
+-0.0180884 0.184586 -0.0174536
+-0.083714 0.0804887 0.0254979
+-0.0378459 0.0971527 -0.0224307
+-0.048763 0.120209 -0.0131018
+0.0257432 0.120365 -0.00224906
+0.0155215 0.0490175 0.0450471
+-0.0516538 0.162634 -0.00285466
+-0.00249513 0.0774404 0.0585569
+-0.0676995 0.0606833 0.0155957
+-0.0530523 0.0333885 -0.00566149
+0.00632209 0.0596079 -0.030662
+-0.075813 0.0681115 0.0180714
+0.0416741 0.0642804 0.0284921
+-0.04591 0.132311 0.0103278
+-0.0266282 0.0932643 0.045173
+-0.0409763 0.128303 0.0136557
+-0.0295455 0.0745738 0.040676
+-0.0236123 0.0408478 -0.0290846
+-0.062999 0.13114 -0.0082084
+-0.0282657 0.0357556 -0.0195136
+0.0383138 0.109087 0.0181423
+-0.0225227 0.0903335 -0.0360154
+-0.00581332 0.0840953 -0.0378871
+-0.0560848 0.155673 0.012015
+-0.0384894 0.0436513 0.0409963
+0.0250684 0.0912521 -0.0226015
+0.0327251 0.116757 0.0189485
+-0.00849679 0.081545 0.0579523
+0.00549376 0.116905 0.0389072
+-0.0684642 0.035536 0.0130279
+-0.0274333 0.0808284 0.0484505
+-0.0892338 0.0888828 0.0134587
+0.040773 0.0858024 -0.0107788
+-0.018787 0.0654231 0.0516453
+-0.057411 0.0334884 -0.00846165
+-0.0515646 0.0516091 -0.00736491
+-0.0341101 0.171131 -0.0149349
+0.0224908 0.0672402 0.0465227
+0.00748827 0.048894 0.0505047
+-0.0891497 0.139122 0.0375101
+-0.0324992 0.033739 0.00907408
+-0.00547868 0.112944 -0.019663
+-0.00364368 0.038223 0.0108877
+-0.00888297 0.175714 -0.027834
+-0.0616908 0.156845 -0.0305919
+-0.0454927 0.0747515 0.0421648
+-0.0628753 0.0333858 -0.000385113
+0.0200484 0.122759 0.029923
+-0.0624127 0.150637 -0.0175763
+-0.0772056 0.0717509 -0.00044869
+-0.070203 0.179305 -0.0507979
+-0.021805 0.0812974 -0.0389167
+0.00417139 0.0894659 -0.0333631
+-0.00354618 0.035584 0.0475305
+-0.0881296 0.100997 0.0213597
+-0.0344927 0.0803488 0.0420944
+-0.0142597 0.180104 -0.0279187
+-0.0772012 0.161073 -0.0279344
+0.0267764 0.0373043 0.025139
+-0.0764984 0.127442 0.0532158
+0.0305998 0.0741029 0.0424942
+-0.0429656 0.115061 -0.0157138
+-0.0569157 0.131148 0.0370227
+-0.087746 0.09368 0.0248353
+-0.0282695 0.0620042 -0.0284458
+-0.026741 0.0877745 0.0490115
+-0.0141005 0.0382966 0.0123251
+-0.040335 0.124745 0.0227896
+-0.0176742 0.109826 -0.020315
+0.0100598 0.0371564 0.0309489
+0.0330284 0.116174 0.0204895
+0.0194916 0.111179 0.0380087
+-0.0468321 0.144886 0.00412892
+0.00432629 0.0568097 -0.0310178
+0.0172994 0.0665713 -0.0290602
+-0.0776345 0.165887 -0.0268309
+-0.0754949 0.117024 0.0522099
+0.0129986 0.124708 -0.00640366
+-0.0551543 0.0561755 0.00960447
+0.0258384 0.0659192 0.0443144
+-0.0892157 0.0956404 0.0184193
+-0.062275 0.152174 -0.0245791
+-0.0712276 0.159591 -0.0429327
+-0.0468614 0.102797 -0.0212675
+-0.0888687 0.0942285 0.0104297
+0.00705483 0.113673 0.0402142
+-0.0846088 0.10754 0.00337493
+-0.0567766 0.0840541 -0.0213935
+0.0291103 0.0713139 0.0420683
+-0.0416245 0.172695 -0.00500345
+0.0467254 0.0741323 0.0166809
+0.0182946 0.123502 0.0292701
+-0.032545 0.0821172 -0.0295502
+0.0405942 0.0847142 0.0324234
+-0.063874 0.0967575 -0.0177619
+-0.0200635 0.0385408 -0.00554998
+-0.0617567 0.139364 -0.00656769
+-0.0151158 0.0388065 -0.0122456
+0.0258671 0.111418 0.0358303
+-0.0323169 0.126646 0.013854
+0.0128496 0.0432822 0.0446281
+0.0410596 0.104249 0.0151631
+0.0413114 0.0661977 -0.00477755
+-0.0524783 0.0442541 0.0446515
+-0.00534534 0.0423344 0.0481709
+-0.0154906 0.0587868 0.0517337
+-0.0768702 0.122267 -0.00710647
+0.018318 0.0607989 -0.0274966
+-0.0414689 0.101488 0.0411988
+-0.03948 0.109789 0.0371385
+-0.071689 0.171513 -0.0326505
+-0.0562412 0.0479891 0.0306662
+0.0198041 0.103539 -0.0196351
+-0.06089 0.146655 -0.00344226
+-0.0625194 0.150622 -0.0185752
+0.0162788 0.0421207 0.0443108
+-0.0926435 0.13098 0.0162303
+-0.0102744 0.0864318 -0.0379838
+0.0437196 0.0846401 -0.00379782
+-0.0575438 0.119835 0.0395668
+-0.0312754 0.118165 0.0306394
+-0.0384168 0.120732 -0.0116964
+-0.0133826 0.1039 0.0435877
+0.0232434 0.0804535 -0.0255191
+-0.0102585 0.0379591 0.0497745
+-0.0427371 0.0753968 -0.0185868
+0.0223381 0.0606785 -0.0258752
+-0.0124978 0.122374 0.0339942
+0.00450508 0.0688823 0.055725
+0.0471561 0.0614873 -0.00363177
+-0.0496676 0.0649029 -0.0122308
+-0.0360083 0.0485228 -0.0153235
+0.0255211 0.116701 0.0317994
+0.000516492 0.101662 0.0444028
+0.00434751 0.121547 -0.0129175
+-0.0374873 0.0959326 0.0432114
+0.0252705 0.0346338 0.0163557
+-0.0124579 0.0545987 0.0514221
+-0.0889602 0.131049 0.0432066
+-0.0372423 0.152141 0.00211029
+-0.0892956 0.0942653 0.013432
+-0.0518302 0.0344778 0.0329457
+-0.0187757 0.0756949 -0.0390019
+-0.0719603 0.0681626 0.0276375
+-0.0847959 0.147297 0.0357863
+-0.0683786 0.160357 -0.00982452
+-0.0326605 0.0863757 -0.0255732
+0.0456643 0.0848033 0.01617
+0.0560044 0.0608622 0.0263962
+0.0242808 0.034582 0.00510919
+-0.0255484 0.0414464 0.0539815
+0.0584482 0.0538047 0.0101717
+-0.0507323 0.0738128 -0.0166527
+-0.0145896 0.101524 -0.0235873
+0.00379349 0.0393361 0.0313217
+-0.060041 0.155524 0.0222725
+0.0330115 0.107346 -0.00970764
+-0.0356538 0.120932 -0.00987931
+0.0252334 0.114772 -0.00969056
+-0.0560291 0.051292 0.00869383
+0.039494 0.0484532 0.0321483
+0.0260206 0.095556 0.0448127
+-0.0144952 0.092498 0.0556089
+-0.0745303 0.0887706 0.0400356
+-0.0427423 0.0768225 -0.0188988
+-0.0254944 0.0348465 0.0469921
+0.0115755 0.104003 -0.020168
+0.0177398 0.128218 0.01192
+-0.0537709 0.0460941 0.0150722
+-0.0260174 0.0351047 -0.0290083
+0.0146321 0.0460649 0.043757
+-0.0725348 0.149777 -0.0387435
+-0.067793 0.0851703 -0.0179862
+-0.0345051 0.0491976 0.0390013
+-0.0575351 0.0727864 0.0407731
+-0.0902562 0.135043 0.0112131
+-0.0341019 0.0350895 0.0466468
+0.0354707 0.0862229 0.039086
+-0.0635111 0.15292 -0.0340962
+0.000752728 0.131478 0.01712
+0.0415962 0.101461 0.0191676
+0.0199544 0.117871 -0.0110405
+0.0125 0.0341066 0.00131673
+-0.0104877 0.105844 0.0434252
+0.000625364 0.130997 0.01994
+-0.00947876 0.108641 0.0432746
+0.0427329 0.0747306 -0.00479562
+0.0175177 0.121695 0.0318921
+-0.0724967 0.123205 0.0535111
+-0.0217998 0.0826894 -0.0387559
+-0.0474379 0.0384277 -0.0132876
+-0.0453217 0.127718 -0.00291517
+0.00149278 0.115548 0.0405079
+-0.00268673 0.0598311 -0.0338297
+-0.0282466 0.0410133 0.0533665
+-0.084979 0.0912122 -0.0035611
+-0.00188052 0.0377314 0.00623396
+-0.0719012 0.152408 -0.0434229
+0.0297667 0.100164 -0.016062
+-0.0446553 0.0615526 0.0394256
+-0.0935168 0.125484 0.0132627
+0.00892319 0.0349264 0.0435129
+-0.0906919 0.142015 0.0231619
+-0.0362968 0.126232 -0.00232089
+-0.0581074 0.0494572 0.00366497
+0.0584743 0.0538121 0.0171841
+0.0453685 0.090397 0.014157
+0.0451698 0.0903876 0.0161628
+-0.0648504 0.099576 -0.0170426
+-0.0336174 0.0385515 -0.0101375
+-0.0818746 0.144748 0.0414084
+-0.0921915 0.114676 0.0133297
+-0.0735116 0.140055 0.0477493
+-0.0625074 0.0334277 0.00145514
+0.0301634 0.0659717 0.0417895
+-0.0313891 0.0338671 0.0146006
+-0.0524964 0.0876231 0.0453765
+-0.0763164 0.155546 0.0238171
+0.0473804 0.0650284 -0.00116263
+-0.0203751 0.165368 -0.0103486
+-0.074953 0.131092 -0.00759533
+-0.0200723 0.0361973 0.0530852
+-0.0623326 0.164687 -0.0445921
+-0.0432796 0.127517 -0.00276726
+-0.0794589 0.155317 0.0154304
+0.0484584 0.0430177 0.0142199
+0.0516914 0.0635003 0.0289607
+0.0124992 0.111251 0.0392691
+-0.00916969 0.168123 -0.0207225
+-0.0624966 0.0987153 0.0424769
+0.0403564 0.0602895 0.0300713
+0.000529964 0.0745913 0.0578265
+-0.00430704 0.037991 -0.0149598
+-0.0458025 0.0336244 -0.00441422
+0.0244543 0.124393 0.0172632
+-0.0566778 0.0485827 0.00942267
+0.0118497 0.0354401 0.0310392
+-0.0460906 0.156154 -0.00788178
+0.0200436 0.125383 0.0241901
+-0.0110606 0.128229 0.000136123
+-0.0680155 0.149781 -0.0384715
+-0.0340535 0.158097 0.00328753
+-0.063246 0.0709836 0.037551
+0.00837353 0.0479453 -0.0272176
+-0.0704921 0.0944433 0.0420805
+0.0271048 0.0835778 0.0462962
+-0.0814225 0.0858535 0.0328878
+-0.0311244 0.126183 0.00987945
+0.00420219 0.0866314 -0.0335404
+-0.0160918 0.0359549 0.0514785
+-0.0387772 0.152061 -0.00669739
+-0.0394877 0.095879 0.0424449
+-0.0556734 0.0645255 -0.00818248
+-0.0721186 0.0637108 0.0173676
+-0.00866441 0.055565 -0.0335626
+0.034399 0.0476191 -0.006288
+0.0184894 0.03497 -0.0076507
+-0.0208903 0.0376209 0.05361
+-0.0721389 0.12842 0.0519775
+-0.0135421 0.093873 0.0547462
+-0.0114977 0.038716 -0.00213082
+-0.0444942 0.0761733 0.0424299
+-0.0162113 0.0387427 -0.00681752
+-0.0632795 0.162306 -0.0238202
+-0.0678999 0.11945 -0.00879052
+-0.0624555 0.163099 -0.0465902
+-0.0197676 0.0376635 -0.0177276
+-0.00982564 0.0339746 -0.0198462
+-0.0334993 0.115969 -0.0147052
+0.0241258 0.0914782 -0.0228484
+0.0393714 0.104176 0.025187
+-0.0877422 0.114422 0.00426669
+0.0169437 0.0346991 -0.00395051
+-0.0659364 0.0364202 0.0386491
+0.0236414 0.0741206 0.0482553
+0.0360643 0.108191 -0.003826
+-0.0498837 0.0340852 -0.0133065
+0.0109544 0.0459934 0.0454216
+0.0232194 0.06778 -0.026032
+0.0407755 0.0675587 -0.00776366
+0.0164452 0.127885 0.0214354
+0.0306214 0.073711 -0.0207585
+0.0310665 0.0768618 0.0431993
+-0.0326395 0.0549161 -0.0112709
+-0.0264479 0.0721314 0.0435447
+0.0185916 0.116689 0.0359263
+0.0210399 0.118016 0.0341276
+-0.0910253 0.115214 0.0323598
+0.000420695 0.0340758 -0.0179207
+0.011475 0.115421 0.0379758
+0.0558934 0.0728505 0.0127047
+-0.0168011 0.0813465 -0.0393174
+-0.0884013 0.103686 0.0143755
+0.00687166 0.100046 -0.0219438
+0.00938176 0.0463536 -0.0257255
+-0.0376115 0.11722 -0.0140038
+-0.0454999 0.102932 0.0417867
+-0.0638509 0.0597328 0.00826283
+-0.0626761 0.0691812 -0.0125769
+-0.0654105 0.124234 0.0493774
+-0.0585036 0.0790577 0.0434985
+0.025387 0.103408 0.0403826
+0.0322433 0.0896617 -0.0189276
+-0.0875821 0.0909427 0.0247332
+-0.0855607 0.103501 0.00239284
+-0.0436971 0.0419128 0.0432773
+-0.0946145 0.122826 0.0212791
+0.0282404 0.0858422 -0.0216043
+0.00524711 0.0726037 -0.0343433
+0.00348793 0.114165 0.0408953
+-0.0345349 0.108408 0.0380462
+-0.053757 0.152473 0.0202331
+-0.0684765 0.061182 0.0096252
+-0.0653795 0.17033 -0.0418012
+0.0335191 0.0398635 0.0260657
+0.00150101 0.0647986 0.0566673
+-0.0386685 0.0621637 -0.0127302
+0.0514753 0.0731205 0.0184716
+-0.0475108 0.159316 0.00812402
+-0.0418554 0.101378 -0.0213767
+0.059111 0.0580409 0.00617531
+-0.0235023 0.105779 0.0421282
+-0.0564932 0.0861648 0.0446121
+0.0463019 0.07925 0.0141776
+-0.037115 0.160706 -0.0129903
+-0.0454732 0.0917007 0.0431865
+-0.08762 0.143285 0.0101199
+0.0294825 0.0348729 0.0114843
+0.0351631 0.0941496 -0.0136388
+0.0169892 0.122251 -0.00777586
+-0.0286955 0.175698 -0.00647862
+-0.0586479 0.0629437 -0.00583333
+-0.0799097 0.0706493 0.0132254
+0.0440384 0.0959414 0.0171588
+0.00466861 0.0365644 -0.00250089
+-0.0368263 0.0929138 -0.0236695
+-0.0126068 0.0392015 -0.0264338
+0.014095 0.041997 0.0446638
+0.00757449 0.035092 0.025056
+-0.0564565 0.03337 -0.00815977
+-0.0774971 0.128861 0.0533302
+0.0348978 0.0613787 -0.0138096
+-0.0348784 0.10713 -0.0202183
+0.0074278 0.117326 -0.0164147
+-0.0416698 0.0345261 0.0350582
+-0.0711528 0.180791 -0.0525602
+-0.0633069 0.0343768 0.0340823
+-0.0795725 0.091329 0.0351135
+-0.00149388 0.0787876 0.0581499
+-0.0838841 0.12062 -0.00343109
+-0.0017512 0.0769296 -0.0360915
+0.00921045 0.0851252 -0.032
+0.0528986 0.056075 -0.00272531
+-0.088793 0.0888086 0.00747102
+0.0367516 0.061565 -0.0117718
+-0.00560731 0.0389273 -0.00299633
+-0.0145783 0.0348246 -0.0259715
+-0.0668255 0.162993 -0.016474
+0.0537671 0.0492093 0.00323447
+0.0164968 0.0990289 0.0471605
+0.0350254 0.0533499 0.0328505
+-0.0502577 0.127427 -0.00458948
+-0.0354996 0.0605317 0.0401535
+-0.0445094 0.0832466 0.0430632
+-0.061134 0.11687 0.0396165
+0.0288023 0.0594063 -0.0198054
+-0.0345743 0.120058 0.0294165
+-0.00577775 0.0812461 -0.0375203
+-0.0271582 0.125819 0.00840694
+-0.00487894 0.130442 0.0208375
+-0.0485449 0.165375 0.00344343
+0.00426734 0.0682596 -0.032922
+-0.0887148 0.12811 0.00328264
+-0.0688911 0.0610594 0.0132079
+-0.0845844 0.121705 0.0490448
+0.0086501 0.130656 0.00430717
+-0.0694892 0.109539 0.0380952
+-0.0883053 0.149858 0.0265188
+-0.0556122 0.136727 0.0318764
+0.00753471 0.0632773 0.055432
+-0.0675754 0.0334584 0.000400215
+0.0390555 0.064539 0.0335561
+0.00752021 0.073081 0.0562837
+-0.0898786 0.113438 0.0340422
+-0.0729585 0.134037 -0.00770509
+-0.0713317 0.151217 -0.0439201
+0.00350232 0.123774 0.0338316
+-0.0682244 0.142863 -0.0118107
+-0.0110454 0.113378 -0.0180964
+0.0539053 0.0478505 0.00821457
+-0.0614468 0.141404 -0.00570472
+-0.0113089 0.0383954 0.0218511
+-0.0281079 0.177558 -0.016771
+0.012409 0.0418787 -0.0238148
+-0.00282516 0.102957 -0.0229221
+0.0254031 0.123772 0.0104796
+-0.0305987 0.0803029 0.0419758
+-0.0750181 0.0761727 0.0341343
+-0.0144519 0.166922 -0.0140569
+0.00338055 0.0465728 -0.0280809
+-0.0162255 0.177147 -0.0257279
+0.0131167 0.108671 -0.0187213
+0.0272829 0.121723 0.00548626
+-0.0883907 0.115479 0.0451949
+-0.0879259 0.102339 0.0203636
+-0.0548201 0.128324 0.0365339
+-0.0820753 0.129944 0.0519532
+0.00724365 0.07823 -0.0340312
+-0.0819891 0.0923793 -0.00757573
+-0.0303556 0.168269 -0.0071929
+-0.00250456 0.0562401 0.0542942
+-0.0616678 0.143939 0.037247
+-0.0776245 0.151441 -0.00287924
+0.0374138 0.110303 0.0192381
+0.0348067 0.0902706 0.0399059
+-0.0127063 0.0671038 -0.0370425
+0.0160068 0.0347306 -0.00980024
+-0.0372246 0.0368821 -0.0130308
+0.0340234 0.0585319 -0.0137143
+0.0541559 0.0477549 0.017206
+-0.0405048 0.15944 0.00272423
+-0.0015963 0.0981039 -0.0279083
+-0.092935 0.117416 0.0233037
+-0.0832007 0.119017 0.0492012
+0.00140058 0.0348342 -0.0234319
+-0.0868724 0.106357 0.0173489
+-0.0166991 0.0570076 -0.034416
+-0.0907644 0.142021 0.0271708
+-0.0822477 0.106043 -0.00262262
+-0.0929753 0.11876 0.0253083
+-0.0263289 0.0434924 0.0526862
+-0.0374936 0.0733328 0.0420467
+-0.0355255 0.0818589 0.0431427
+-0.0650055 0.136996 -0.00788185
+-0.0705444 0.0712752 0.0339991
+-0.0549513 0.0339195 0.0239841
+-0.00779971 0.114512 -0.0173201
+0.0213851 0.0754916 0.050294
+0.0297243 0.0538559 -0.0167895
+-0.00746204 0.125196 -0.00874293
+-0.0385113 0.0973107 0.0424108
+0.0437641 0.0599949 -0.00412714
+0.00932784 0.0581716 -0.0301717
+-0.07404 0.148543 -0.0208687
+-0.067363 0.177688 -0.0512074
+-0.00213372 0.123188 0.0349488
+-0.0180211 0.168338 -0.0139614
+-0.0254657 0.0678395 0.0426887
+-0.0266217 0.0436536 -0.0288174
+-0.0498332 0.0956322 -0.0221283
+-0.0772795 0.155549 -0.0169029
+0.0369068 0.0799159 -0.0147176
+-0.0788489 0.119288 -0.00581129
+-0.0101059 0.171125 -0.0207965
+-0.0324932 0.0774699 0.0412179
+-0.0434937 0.0705308 0.0420517
+-0.0158265 0.0869335 -0.0385904
+-0.00548754 0.123746 0.0343085
+0.0610091 0.0623122 0.0111052
+-0.00962571 0.0451144 -0.0282927
+-0.0687445 0.160961 -0.0529537
+-0.00991099 0.115578 -0.0164445
+0.0199768 0.126969 0.0170274
+-0.0827793 0.0771313 0.0211566
+-0.0119077 0.0894805 -0.0370977
+0.0238643 0.100811 0.0434608
+-0.0130347 0.166801 -0.0212915
+-0.0934989 0.122762 0.0122811
+-0.0667245 0.0765676 -0.016644
+-0.0391998 0.0351247 -0.0118182
+-0.0445637 0.128075 -0.00132731
+-0.0258871 0.0377455 0.0194558
+-0.093776 0.124126 0.0142628
+-0.0698753 0.117966 -0.00835455
+-0.0515005 0.100157 0.0426446
+-0.0404873 0.112547 0.0355988
+-0.0674682 0.0382926 -0.00574154
+-0.0624974 0.0876076 0.0451456
+-0.0367451 0.0768715 -0.019149
+-0.00349748 0.0870382 0.0570453
+0.0243264 0.0591823 -0.0248233
+-0.0604582 0.154406 0.00215902
+-0.0742084 0.067281 0.00145303
+0.0461952 0.0834391 0.00817714
+-0.0246581 0.0664552 0.0433381
+0.0223219 0.0402539 -0.00770693
+-0.0269495 0.0511315 0.0418642
+-0.0426785 0.060742 -0.0126195
+-0.0470567 0.069722 0.0403886
+-0.057499 0.0889744 0.0446686
+-0.0925962 0.126825 0.0102659
+-0.0627541 0.166279 -0.0425846
+0.00227655 0.0655175 -0.0339267
+-0.0152717 0.181584 -0.0271612
+-0.0527991 0.0578707 0.0222512
+0.0181983 0.0768373 0.0527356
+-0.020287 0.0445184 0.0528933
+-0.0230546 0.0388523 0.0540611
+-0.0591948 0.0603156 -0.00052226
+-0.0356179 0.0505976 -0.0108834
+-0.0125985 0.0420542 -0.026434
+-0.0457346 0.0337173 0.00640665
+-0.0271239 0.117991 -0.0128729
+-0.0287901 0.105845 -0.0221143
+-0.0791947 0.116328 0.04948
+-0.037475 0.126933 -0.001254
+-0.0652274 0.172558 -0.0603808
+0.0249025 0.0659023 0.0447242
+0.0444853 0.062436 0.0294527
+-0.0584017 0.0411488 0.0207065
+-0.0637308 0.0380192 0.0421186
+-0.0224637 0.0768447 0.053535
+-0.0472049 0.132217 0.00449629
+-0.055985 0.033885 0.0237996
+-0.0637704 0.158563 -0.0153492
+-0.0889154 0.0875162 0.0124615
+-0.0630601 0.155204 -0.0366146
+-0.0858283 0.1008 0.00139713
+-0.00849876 0.0884233 0.057199
+-0.0464295 0.156494 0.00819518
+-0.0875333 0.0927687 0.0054156
+-0.0555067 0.053407 0.0086882
+-0.0319429 0.0346356 0.0246022
+-0.0532414 0.127751 -0.00500041
+-0.0324852 0.0946249 0.0445277
+-0.0652259 0.166727 -0.0597961
+0.0318258 0.090298 0.0426417
+0.0227624 0.0959793 -0.0216236
+0.0453464 0.0791637 0.00120688
+-0.00148178 0.0718081 0.0578063
+0.0484981 0.0664872 0.0276228
+-0.0638124 0.0339885 0.0132249
+0.0378702 0.100686 0.0303226
+0.0423416 0.0718943 -0.00578991
+0.0449549 0.0889654 0.0201657
+-0.0505604 0.0431885 -0.0101401
+0.0305345 0.113708 -0.00653825
+0.0175297 0.092684 0.048312
+-0.0405439 0.0338701 -0.0146326
+-0.0151193 0.0387785 0.0315419
+0.0425177 0.0660617 -0.00221978
+-0.0261619 0.0381432 0.054147
+-0.0435068 0.0576714 0.0396679
+-0.0531482 0.161241 0.00587596
+-0.0897425 0.0915834 0.0134432
+0.00549953 0.119637 0.0367537
+-0.00877042 0.130092 0.00788453
+-0.0417274 0.0725105 -0.0179617
+-0.0534984 0.0776159 0.0431279
+-0.0290767 0.121891 0.0239314
+0.0583737 0.0676977 0.00512132
+-0.0647358 0.157148 -0.0507072
+0.0435656 0.0945094 0.0231538
+-0.0220003 0.181634 -0.0125756
+-0.0298816 0.0621837 -0.0234188
+-0.0460097 0.127427 -0.00464706
+-0.0136152 0.0982979 -0.0261721
+-0.0662958 0.0637695 -0.0035905
+-0.0920915 0.118829 0.0424602
+-0.0157421 0.0686009 -0.0381423
+-0.063492 0.0819119 0.043822
+0.0519248 0.0461654 0.00821164
+-0.0528781 0.0490838 0.0346622
+-0.0896974 0.137929 0.0351902
+-0.0502406 0.140114 0.00340131
+-0.0460575 0.131197 0.00582383
+-0.0398248 0.0928735 -0.0232663
+-0.0287922 0.165339 -0.00670006
+-0.0017304 0.0712031 -0.0351875
+-0.0386191 0.118326 -0.013151
+0.0193849 0.126884 0.00540105
+0.0309645 0.0363887 0.0195722
+-0.0314998 0.155167 -8.72409e-05
+-0.000786782 0.0826169 -0.0366787
+-0.0771272 0.155133 0.00894547
+-0.00248977 0.112799 0.0419964
+-0.0279028 0.160261 -0.0136941
+-0.0431979 0.129461 0.00840104
+-0.0208217 0.0854768 -0.038298
+-0.01776 0.0714448 -0.0386564
+0.00624218 0.039472 0.0335072
+-0.0639011 0.119458 -0.00893676
+-0.0667029 0.176899 -0.0509708
+-0.0245413 0.0349941 -0.0287041
+-0.0487364 0.0753122 -0.0176891
+-0.0669945 0.169371 -0.0323347
+-0.00928822 0.0393788 0.0494849
+-0.0239808 0.0936155 -0.0313592
+0.0224894 0.0906371 0.0481279
+0.0242369 0.0748124 -0.0257049
+-0.0243462 0.1625 -0.00551798
+-0.0625942 0.153749 -0.0125838
+-0.0486891 0.137066 0.0163891
+-0.0679674 0.0350577 0.0131968
+-0.0626161 0.12969 0.0410793
+-0.0263812 0.120789 0.0279195
+-0.0802896 0.144766 0.0426469
+0.0132183 0.0794258 -0.0310561
+-0.0415045 0.0548576 0.0396938
+-0.00948994 0.0952069 0.0546127
+-0.0903261 0.135124 0.0222174
+-0.0574953 0.153709 0.0290191
+-0.0428742 0.10707 -0.020141
+0.057983 0.0674087 0.022273
+-0.0297438 0.0593588 -0.0214043
+-0.0562018 0.0589495 -0.00340637
+-0.0230647 0.0402418 0.0541248
+-0.062019 0.17397 -0.0618399
+-0.0412895 0.149153 -0.00363446
+-0.0485728 0.0503685 -0.00899002
+-0.00748812 0.10728 0.0439222
+-0.0336555 0.0709359 -0.0204834
+-0.0407158 0.171931 -0.00126808
+-0.0610791 0.151413 0.0351388
+-0.0221494 0.0384504 -0.005885
+0.00439305 0.11559 -0.018534
+-0.0241215 0.0944713 0.0461972
+-0.0547672 0.0812274 -0.0214088
+-0.0846583 0.0777659 0.00751712
+-0.0574282 0.0507609 0.000628334
+-0.00874511 0.0976201 -0.0294139
+-0.022979 0.0380859 0.023348
+0.043448 0.0916342 -0.00278755
+0.0145196 0.123096 0.0322223
+-0.0415646 0.125825 -0.00703356
+-0.0726695 0.171671 -0.0330178
+-0.010471 0.0378949 -0.0160892
+-0.0488368 0.0970812 -0.0221898
+-0.0586032 0.141 0.0328315
+-0.0117815 0.0347775 0.0429519
+0.0116378 0.0603198 0.0518663
+-0.0459594 0.0560107 0.0380589
+0.0399446 0.107028 0.0121641
+0.00710547 0.0893998 -0.032814
+0.0410678 0.10142 0.0221661
+-0.0244452 0.181836 -0.00961144
+-0.013259 0.121231 -0.0103976
+-0.0454789 0.123431 0.0251209
+0.0285377 0.0523356 -0.0187697
+0.0588289 0.0691072 0.0191593
+0.0125005 0.1007 -0.0226033
+-0.0595569 0.153648 0.0312116
+-0.00403867 0.0994311 -0.025339
+0.00148661 0.108625 0.0426664
+-0.0327389 0.0482896 -0.0213368
+-0.0380117 0.0344553 0.0341354
+-0.072467 0.0968801 0.0405541
+0.0151781 0.0847217 0.0519158
+-0.0425055 0.108838 -0.0192163
+-0.00749309 0.114174 0.0409291
+-0.0434968 0.119301 0.0295385
+0.0363932 0.0476439 -0.00624826
+-0.079546 0.0719865 0.0195582
+-0.0564882 0.042714 0.0457133
+-0.0113851 0.0383094 0.011049
+-0.0865431 0.106355 0.0183534
+-0.0313759 0.0553098 -0.0143786
+0.0515215 0.0651377 0.0281771
+0.0253513 0.0605347 -0.0238887
+-0.0627683 0.164709 -0.0355885
+-0.0520878 0.0489475 0.0226481
+-0.0371717 0.165191 -0.0136726
+0.0421423 0.0738117 0.0292393
+0.0499661 0.0451421 0.0208878
+-0.0394943 0.116662 0.0325452
+-0.085625 0.079203 0.01151
+-0.0716025 0.135501 0.0492566
+-0.00270958 0.0391757 0.033738
+-0.0911953 0.143381 0.0241598
+0.0418026 0.102869 0.0141608
+-0.0319458 0.0708051 -0.0254622
+-0.0626184 0.145978 -0.00858061
+0.0207857 0.0994851 0.0460447
+0.0275851 0.114088 0.0330397
+-0.040502 0.120714 0.028794
+-0.0853944 0.101863 0.0264831
+0.00328879 0.0668715 -0.0332298
+-0.0446453 0.0577855 -0.0118043
+0.0188777 0.03558 -0.00867348
+-0.064488 0.156133 0.0221359
+-0.00921165 0.172686 -0.0275682
+-0.0426232 0.0362716 0.0437883
+-0.0246131 0.0422659 -0.0289978
+-0.0766564 0.0773474 -0.00857073
+0.0281325 0.121698 0.0129367
+-0.00471394 0.0641886 -0.0352179
+-0.0274456 0.0382197 0.0539829
+-0.0417615 0.03357 0.00191851
+-0.0596536 0.0350995 0.0445384
+-0.0458215 0.091313 -0.0218951
+-0.00569643 0.0599053 -0.0346867
+-0.0728066 0.087878 -0.0157134
+0.00467021 0.0347458 0.0211501
+-0.0369631 0.0341718 -0.0179086
+-0.0700564 0.162427 -0.0118963
+-0.0938276 0.126933 0.0242666
+-0.0207424 0.110014 -0.0205123
+0.00150816 0.0911296 0.0556681
+-0.00874857 0.0727984 -0.0375275
+-0.0679476 0.156599 -0.00385029
+-0.076928 0.152806 -0.00788984
+-0.0860408 0.109124 0.0103593
+-0.0514909 0.0544833 0.0216233
+-0.0756545 0.151363 -0.0148873
+0.0423862 0.047532 -0.00502925
+-0.0895419 0.0916017 0.0194388
+-0.014074 0.128231 0.00303832
+-0.0747094 0.155646 0.00979649
+-0.0931712 0.117411 0.0223074
+-0.0548599 0.145302 0.0295141
+-0.058163 0.0467738 0.0296766
+0.00351191 0.0459363 0.0483003
+-0.091423 0.144753 0.0241539
+0.0174632 0.0948293 0.047857
+-0.0326373 0.119597 -0.0104942
+0.0206219 0.119357 0.0335278
+-0.0174992 0.0897364 0.0558751
+-0.00978193 0.0784455 -0.0377778
+0.0236993 0.12332 0.00130956
+-0.0792974 0.15265 0.00222093
+-0.0444956 0.102933 0.0417949
+0.0152822 0.129138 0.0167187
+0.0467013 0.0718392 0.0195936
+-0.0883363 0.112382 0.0405773
+-0.0515091 0.105631 0.0400498
+0.00121056 0.115576 -0.018509
+-0.0525671 0.0335472 0.0123651
+-0.0285962 0.0377287 0.0207135
+0.0043328 0.0341303 0.00522853
+-0.0914252 0.114627 0.0103302
+-0.0231203 0.163764 -0.0160465
+-0.0077447 0.0698983 -0.036343
+-0.0650951 0.162442 -0.0187197
+-0.0652725 0.0613084 0.02088
+0.0455972 0.0415054 0.0160287
+-0.0554928 0.148133 0.0286364
+-0.0709153 0.113624 -0.0087498
+-0.0390311 0.160893 0.00133569
+-0.0669712 0.156006 0.0125516
+-0.0607902 0.0334775 -4.36679e-05
+-0.0634989 0.108392 0.0384413
+-0.0239757 0.0768012 0.0522149
+-0.0671254 0.128435 0.0486555
+-0.0368355 0.153629 0.00272174
+-0.0280768 0.169745 -0.00916431
+0.00750786 0.0518308 0.0519822
+0.017486 0.112589 0.0378808
+-0.0694907 0.0930374 0.0422024
+-0.0457991 0.0336321 0.00104877
+0.0385285 0.0901386 0.0347352
+0.0154693 0.0976312 0.0477084
+-0.0134564 0.0347657 0.0443699
+0.0132374 0.123205 -0.00876652
+0.0204758 0.0975716 0.0468126
+-0.0702558 0.152263 -0.0463745
+-0.0361586 0.0382819 -0.0067057
+0.0546048 0.0478149 0.0122009
+-0.0455357 0.120317 -0.0132441
+-0.00750778 0.0828941 0.0575015
+-0.0338576 0.0347656 0.029445
+-0.0195033 0.118175 0.0352728
+0.0125203 0.0616669 0.0514026
+-0.0196496 0.0582641 0.0484904
+0.0383367 0.0910432 -0.012345
+-0.00538883 0.122125 -0.0114557
+-0.075455 0.0675485 0.016865
+-0.0362517 0.123246 0.0257763
+-0.0815948 0.123081 0.0504133
+-0.00479304 0.130806 0.0179661
+-0.0776418 0.158287 -0.0219264
+-0.0484803 0.117974 0.0310954
+-0.0386541 0.126132 0.0204051
+-0.0786087 0.102098 0.0338163
+0.0464344 0.0792618 0.0111808
+0.0289709 0.0848578 0.043728
+-0.0184969 0.10579 0.0426906
+-0.0245528 0.116739 0.0335827
+-0.0754858 0.146995 0.0422823
+-0.0528151 0.132539 0.0323863
+-0.00781365 0.086863 -0.0372016
+0.0145549 0.126574 -0.00243153
+-0.0834735 0.076324 0.00852235
+-0.0597355 0.0752692 -0.0179534
+-0.0853298 0.111023 0.0405559
+-0.0515948 0.137023 0.025408
+-0.0693375 0.168152 -0.0246084
+-0.0781507 0.115089 0.0495991
+-0.0468723 0.0587675 0.0374438
+0.0193537 0.0349459 0.0257791
+0.0243371 0.123621 0.0229269
+-0.0907106 0.133758 0.0262122
+-0.0542023 0.0435162 0.019691
+-0.036169 0.0335901 -0.0284162
+0.0196024 0.0858351 -0.0269873
+0.0084996 0.0488213 0.0500608
+-0.0308481 0.0664794 -0.025463
+0.0262324 0.0775308 -0.0242027
+0.0470911 0.0422949 0.0155431
+0.0315748 0.0605586 0.0402762
+-0.0722147 0.149455 -0.0385736
+-0.0695516 0.170347 -0.0304219
+-0.0404175 0.171209 -0.00987004
+0.0299365 0.0350356 0.00770058
+-0.0466417 0.133657 0.014443
+0.0130913 0.0937889 -0.0272955
+-0.0579449 0.059547 -0.000261977
+-0.0285818 0.121272 -0.00825717
+-0.0713326 0.0345571 0.00760774
+-0.0666503 0.135429 0.0440071
+-0.0303959 0.0762676 -0.0335676
+-0.00385838 0.101641 -0.0231016
+-0.0679568 0.13115 -0.00879393
+0.00350598 0.0870278 0.056972
+-0.0248582 0.0752289 0.048914
+-0.0588955 0.0336882 0.0145047
+-0.0563129 0.159837 0.00207063
+-0.064096 0.14766 -0.0219948
+-0.00992774 0.110288 -0.021044
+-0.0709029 0.110786 -0.0101311
+4.37647e-05 0.0392736 0.0324137
+0.0144567 0.0617415 0.0506755
+-0.0304982 0.117934 0.0308066
+-0.0124153 0.129138 0.0195683
+-0.0045458 0.042944 0.0478735
+-0.078629 0.155228 0.0230232
+-0.0793587 0.143462 0.044583
+-0.011946 0.163588 -0.0146751
+-0.0489654 0.138607 0.014392
+0.0130851 0.034266 -0.0137357
+0.0405023 0.0484755 0.0322215
+-0.0440255 0.0336276 -0.0225259
+-0.0185094 0.114097 0.0385959
+-0.0708508 0.173984 -0.0409178
+-0.0698895 0.170875 -0.0319754
+-0.0268752 0.105825 -0.0224483
+-0.0921157 0.118792 0.0303066
+-0.0715954 0.155396 -0.0419127
+0.0239203 0.108291 -0.0147313
+-0.0163998 0.119263 -0.0123023
+-0.0327198 0.0652554 -0.0184496
+0.0457714 0.0848094 0.0151676
+-0.062838 0.15526 0.00677387
+-0.0562712 0.146757 0.030967
+-0.00723161 0.0381024 0.0489495
+0.0208841 0.115302 0.0356376
+-0.0311112 0.162246 -0.0146263
+-0.0185025 0.0757876 0.0552584
+0.0369413 0.0993952 0.0325229
+-0.0597781 0.0668249 0.0348598
+-0.0676678 0.0697151 0.0342008
+-0.00507021 0.128586 -0.00238902
+0.035697 0.096801 0.0360155
+0.0179331 0.121039 -0.00844165
+0.00149286 0.100277 0.0469858
+0.0132581 0.0348304 0.0408908
+-0.0746487 0.0760382 -0.00984365
+-0.076866 0.0994719 0.0363813
+-0.00904748 0.0388121 -0.00544357
+-0.0378518 0.0985762 -0.0221892
+-0.0494929 0.0804959 0.044039
+0.0288964 0.120556 0.0189249
+0.0252898 0.0704815 -0.0246106
+-0.0831283 0.107448 0.000408412
+-0.0465019 0.129507 0.0239285
+-0.056621 0.0562362 0.00665228
+-0.00564116 0.0481924 -0.0303539
+-0.0944779 0.122838 0.0232837
+-0.0876178 0.105003 0.0113725
+0.0221833 0.125827 0.00929485
+-0.0376403 0.0562958 -0.0110081
+-0.027315 0.119916 0.0290701
+0.0347431 0.103404 0.0328426
+0.0317883 0.117354 0.00287906
+0.0203254 0.040014 -0.0146997
+-0.0780017 0.150056 -0.00287894
+-0.0106261 0.0451108 -0.0281505
+-0.0729498 0.156259 0.0191473
+0.0393029 0.10195 0.0270711
+0.0182702 0.0422045 0.0436952
+-0.0802626 0.147413 0.0397079
+-0.00132352 0.0966684 -0.0303753
+-0.015259 0.0984512 0.0471298
+0.0451952 0.0433405 0.023507
+-0.0438866 0.108471 -0.0191595
+-0.0159384 0.124168 -0.00545234
+-0.0654957 0.105611 0.0395613
+-0.0904683 0.135081 0.0142287
+0.025208 0.0874192 -0.0236148
+0.0366057 0.0954909 0.0355184
+-0.0887482 0.102363 0.0163794
+0.00249078 0.115545 0.0403845
+-0.0778809 0.0759658 0.0302027
+-0.045814 0.0898818 -0.0220292
+0.0125705 0.0658518 0.0532694
+-0.00597277 0.130385 0.0204408
+-0.0581881 0.125521 0.0404357
+-0.0307415 0.0374976 -0.017878
+-0.0742647 0.109022 0.03931
+0.0186443 0.123322 -0.00490878
+-0.0769902 0.154182 -0.00989517
+0.0130083 0.0956231 -0.0252421
+0.00953036 0.10442 0.0445691
+0.0186389 0.0520546 0.0461071
+-0.0463977 0.0397105 -0.0152844
+0.0444376 0.0959725 0.0121619
+-0.0216077 0.0350207 0.0511065
+0.0463433 0.054773 -0.00593764
+-0.0875696 0.115156 0.045661
+-0.00311195 0.130927 0.00709886
+-0.0627873 0.0335028 0.00493012
+-0.0894432 0.151569 0.0164701
+-0.0668923 0.109473 -0.0126504
+-0.053788 0.0854855 -0.0214384
+-0.00382944 0.108004 -0.0223654
+-0.0447162 0.0448943 -0.0112435
+0.0262334 0.121101 0.000829633
+0.0206734 0.0795401 0.0510479
+-0.0434655 0.127159 0.0186744
+-0.0273746 0.181651 -0.00921581
+-0.0045009 0.116806 -0.0157814
+-0.0529179 0.162663 -0.000927718
+0.0278575 0.109692 -0.0122334
+0.0114621 0.125412 0.0310862
+-0.055877 0.0984248 -0.0207921
+-0.0649536 0.0595166 0.0136311
+-0.0899789 0.116378 0.0441376
+-0.0344621 0.154617 -0.00886992
+-0.0641249 0.156393 -0.0431197
+0.0264267 0.0824949 -0.0235141
+-0.0699148 0.109401 -0.011164
+-0.0645122 0.0398643 -0.00676714
+-0.0927009 0.117475 0.0353038
+0.00812049 0.107282 -0.0201059
+0.0344124 0.0957227 -0.013333
+-0.0617126 0.170956 -0.0545977
+-0.0888439 0.150092 0.0112242
+-0.0600859 0.0421217 0.0440266
+-0.0535039 0.0805657 0.0446207
+0.00913683 0.0873343 0.0554698
+0.0318118 0.100781 0.0373962
+-0.0366211 0.124122 -0.00724685
+0.0255511 0.0463382 0.0384325
+-0.00473212 0.0386351 0.0247855
+-0.0857334 0.153425 0.016223
+3.04988e-05 0.11432 -0.019028
+-0.0622192 0.17721 -0.0606003
+-0.00533435 0.0930519 -0.0346806
+-0.0578363 0.0912193 -0.0212351
+-0.051575 0.132941 -0.0025104
+-0.0215094 0.0983521 -0.0242621
+-0.0663625 0.141125 0.0427387
+0.0411659 0.0952708 0.0280268
+-0.053497 0.0945663 0.0438533
+-0.0745177 0.171112 -0.0322615
+-0.0779361 0.129573 -0.00656407
+-0.0437814 0.0840812 -0.0212189
+0.00326914 0.0682665 -0.0330635
+-0.0739332 0.177709 -0.0464055
+0.0528574 0.0622185 0.0288955
+-0.0365021 0.101484 0.0413625
+-0.0445836 0.0476428 -0.0105653
+-0.0194973 0.101611 0.0435898
+-0.0137239 0.16215 -0.0118322
+-0.0287184 0.0806953 0.0455388
+-0.0933646 0.117392 0.0153085
+-0.0867701 0.113047 0.00428618
+-0.0052769 0.0941788 -0.0338289
+0.0134806 0.0976663 0.0482444
+-0.08743 0.111796 0.0214228
+0.00133097 0.0626915 -0.0339607
+0.0447988 0.0903457 0.000177034
+0.00183354 0.10009 0.0472603
+-0.0323685 0.0497273 -0.0163483
+-0.0848994 0.144621 0.00617242
+-0.0707871 0.0625817 0.00788057
+-0.0334706 0.0589721 0.0386927
+0.0458044 0.0834139 0.0161713
+-0.0638595 0.159101 -0.0532849
+-0.0169095 0.0379753 -0.0273392
+-0.0683614 0.15578 0.00913576
+-0.0841262 0.110345 0.0263651
+-0.0629048 0.1054 -0.0169977
+-0.00482937 0.038542 0.00854039
+0.00442082 0.039258 0.029719
+0.0287437 0.0416628 0.0306503
+-0.0480218 0.144366 0.00442748
+-0.0718881 0.109321 -0.0102252
+-0.0623027 0.153756 -0.0145815
+0.0312054 0.104936 -0.0131412
+-0.0502712 0.143189 0.0133798
+-0.0679015 0.120916 -0.00896008
+-0.0325574 0.126601 0.00788172
+0.00400981 0.0391328 0.0279405
+-0.0790033 0.16525 -0.0329555
+-0.0464892 0.117969 0.0304809
+-0.0171987 0.127433 0.00332106
+-0.0589607 0.145338 0.0340833
+-0.00576935 0.0346302 0.0443351
+-0.0894143 0.118584 0.00330542
+-0.0494955 0.0890237 0.0451636
+-0.0395958 0.118487 -0.0133369
+0.0256371 0.0346096 0.00722464
+0.0101261 0.0846794 0.0551401
+-0.000640169 0.0481947 -0.0300913
+0.00652044 0.0799801 0.0556018
+-0.0485004 0.157854 0.0090451
+-0.0674788 0.153589 0.0328337
+-0.0246191 0.0436702 -0.0286423
+-0.0380903 0.041957 -0.0274154
+-0.0592055 0.155872 0.0109493
+-0.0158317 0.0382446 0.00839116
+-0.0862834 0.141953 0.0402325
+-0.0178783 0.0381567 0.0189161
+-0.00165332 0.0511407 -0.0309868
+-0.0515122 0.0598238 0.030703
+0.0226361 0.118891 -0.00814073
+0.0433138 0.0902166 -0.00378785
+-0.0339799 0.0384942 -0.0120095
+-0.0424937 0.0748068 0.0427898
+-0.0640892 0.172567 -0.049571
+0.037431 0.0794424 0.0366005
+0.041759 0.0432404 0.0265421
+-0.0923571 0.121517 0.0426088
+0.0562687 0.0726263 0.0113628
+0.024692 0.100819 0.0429025
+-0.0729148 0.110726 -0.0089954
+-0.0295018 0.159581 0.00108834
+-0.0672997 0.0435653 0.00884843
+0.0172829 0.0651656 -0.0289948
+-0.0585687 0.0340745 0.0248573
+0.0320945 0.113613 -0.00441584
+-0.0726455 0.0655594 0.00286688
+0.0223162 0.0649555 -0.0263733
+-0.0636659 0.0691264 -0.011804
+-0.0495225 0.143222 0.00950726
+-0.0396922 0.156587 0.00568688
+0.00749975 0.089676 0.055015
+0.0495971 0.0465817 0.0239661
+-0.0390578 0.156263 -0.0100859
+-0.0708823 0.172457 -0.0366471
+0.0126883 0.0343606 -0.00448368
+-0.0454899 0.0690197 0.0407796
+-0.0413446 0.0335325 -0.0237744
+-0.0404379 0.124957 -0.00812413
+0.0440209 0.0945174 0.0011806
+-0.0627245 0.073729 -0.0165415
+-0.0286056 0.0475856 -0.0255224
+-0.0495036 0.153584 0.0107879
+-0.0896132 0.139307 0.0341845
+0.030074 0.119769 0.00796635
+-0.0517393 0.0517191 0.022632
+-0.023961 0.0723529 0.0481115
+-0.0309909 0.0384268 -0.00579914
+-0.00634516 0.0379873 -0.0153566
+-0.0547761 0.0333427 -0.00414144
+0.00202824 0.108029 -0.0204102
+0.0450661 0.0761937 0.0228711
+-0.084679 0.0869987 0.027663
+-0.0219636 0.0681726 0.0490783
+0.0226059 0.0375679 0.034289
+-0.0518654 0.101358 -0.0214215
+-0.0919525 0.126983 0.0392569
+-0.0663498 0.172859 -0.0450539
+0.00551307 0.0856288 0.0568655
+-0.0269831 0.0381412 0.0278748
+0.0430768 0.0411155 0.00329204
+0.0317014 0.117733 0.0199863
+-0.0326228 0.0506668 -0.0115219
+-0.0760639 0.155862 0.0136886
+-0.0581543 0.0337417 0.0181646
+0.0454926 0.0875897 0.015162
+-0.0197923 0.038435 -0.00354579
+-0.0461288 0.15913 -0.00829043
+-0.0235066 0.108523 0.0406075
+0.015525 0.127932 0.00115163
+0.00251501 0.0814623 0.0569927
+-0.0485603 0.131756 0.000870882
+-0.0909462 0.11476 0.0333322
+0.038369 0.0884214 -0.0137726
+0.0179084 0.127905 0.00771503
+0.0457915 0.0862101 0.0121678
+-0.0310416 0.0763051 -0.0325503
+-0.0584963 0.0946188 0.0448266
+-0.00142898 0.112626 -0.0193593
+0.0537506 0.0519895 0.000247391
+-0.00249736 0.0978288 0.0524276
+0.0474285 0.0692644 0.00256538
+-0.0157146 0.17719 -0.0193767
+-0.0688721 0.0369953 0.0119906
+0.0262296 0.0888085 -0.0227773
+-0.0876687 0.0981895 0.00443327
+-0.0435601 0.129686 0.00973169
+-0.0620348 0.146024 -0.00560988
+0.0228232 0.123119 -0.000681491
+0.0192101 0.0791931 -0.0277308
+-0.0285078 0.0348913 0.0463089
+-0.0295006 0.116619 0.032366
+0.00540344 0.040445 -0.0238712
+-0.0861937 0.0819823 0.0184808
+-0.0691313 0.170851 -0.0540166
+0.0232722 0.0691857 -0.0260989
+0.0346775 0.106404 -0.00868031
+-0.0626839 0.154165 0.00249175
+0.0203005 0.047637 0.041402
+0.0426083 0.0915862 -0.00481093
+-0.00121535 0.0394284 0.0356173
+-0.0290126 0.0606872 -0.0244213
+-0.0522249 0.152155 0.0138449
+0.0278367 0.0781921 0.0455692
+-0.0782715 0.168666 -0.0333616
+-0.0631194 0.0357147 0.0189543
+0.00237959 0.0976208 -0.0273765
+-0.0327796 0.0736593 -0.0265049
+-0.0590695 0.143884 0.0338908
+-0.0366032 0.0407784 -0.0289892
+-0.0564911 0.0400264 0.0468768
+-0.0891224 0.133627 0.00423095
+-0.00349883 0.095211 0.054715
+-0.0365564 0.0488017 -0.0133944
+-0.063603 0.0406323 0.0405017
+0.00388987 0.0987683 0.0495103
+-0.0341448 0.166698 -0.0152744
+0.0422984 0.0789118 -0.00576754
+-0.0821777 0.153468 0.0263012
+-0.0618022 0.0852922 -0.0192956
+-0.0825795 0.0937805 -0.00656944
+0.0526059 0.0476644 0.00422036
+-0.0617323 0.155315 -0.018581
+-0.0646798 0.158592 -0.0555006
+-0.0400438 0.127998 0.000725921
+-0.020826 0.0882193 -0.0372663
+-0.072774 0.083565 -0.0157894
+-0.0301375 0.0592681 -0.0204197
+0.053852 0.0700236 0.0237561
+-0.0192952 0.097132 0.0469462
+-0.0379042 0.0350553 0.0424096
+-0.0779467 0.170107 -0.0351609
+-0.0731753 0.162423 -0.0379582
+0.0293531 0.117442 -0.00254348
+0.00923639 0.0753581 -0.0333366
+-0.00523048 0.0381888 0.0482681
+0.0281109 0.0477624 0.0368744
+-0.00549683 0.095262 0.0547887
+0.016279 0.127286 0.0242335
+-0.000357095 0.0346671 0.0418309
+-0.0903031 0.113239 0.0103302
+-0.0435085 0.165227 0.00470373
+-0.000629686 0.0466337 -0.0288231
+-0.00267903 0.0583624 -0.0332032
+-0.0354553 0.163829 -0.00227816
+0.0329891 0.10525 -0.0114692
+-0.0511234 0.159083 -0.0045978
+-0.0738697 0.0672451 0.0209913
+-0.0513379 0.0345855 0.00988953
+0.0449495 0.041538 0.0177108
+0.0131716 0.128382 0.0245166
+-0.0119302 0.0975527 -0.0293786
+-0.0796395 0.11488 0.0476725
+-0.00554666 0.0429634 0.0481135
+0.0336755 0.115893 0.0150272
+-0.0865455 0.109036 0.0123603
+-0.0583287 0.0597422 0.0219213
+0.00142185 0.0361564 -0.0243567
+-0.0249379 0.182957 -0.0150514
+-0.00456935 0.0511652 -0.031379
+0.00983853 0.130485 0.0204326
+-0.020719 0.0739658 0.0533053
+-0.0922608 0.117447 0.0323019
+-0.0687753 0.15954 -0.0529632
+0.00943169 0.130854 0.0188531
+-0.0463671 0.133058 0.0160254
+0.0403868 0.0966272 0.0286723
+-0.0374342 0.125294 0.0223398
+-0.0254349 0.121225 -0.00822483
+-0.0287913 0.121291 0.025511
+-0.0275751 0.181449 -0.0130337
+-0.0292637 0.0364551 -0.0300736
+0.0333063 0.076755 -0.0177777
+-0.00838403 0.100228 -0.0241757
+-0.0917675 0.126924 0.040336
+0.0460105 0.0848241 0.0111686
+-0.0458316 0.03478 0.00723173
+0.0337176 0.0655129 -0.0167917
+-0.0900318 0.128311 0.0429434
+0.00340705 0.0404653 -0.0241388
+-0.0445167 0.0334752 0.00325528
+-0.0417025 0.170926 -0.000183345
+-0.0667272 0.0750614 -0.0156487
+-0.075008 0.0665773 0.0124915
+-0.0256788 0.0387085 -0.0161237
+0.0433708 0.0459415 -0.00338184
+-0.0333944 0.0420411 -0.0295771
+-0.0366574 0.173333 -0.0118804
+0.0279341 0.0376089 0.0251213
+-0.0591944 0.0589798 0.00447595
+-0.0117173 0.0642717 -0.0365887
+0.0284258 0.044601 -0.00619231
+0.0407559 0.0844033 -0.0107694
+-0.0149445 0.0386028 -0.00457425
+-0.0666364 0.150881 -0.0385507
+-0.0441588 0.156514 0.00623469
+-0.0338796 0.174703 -0.0134692
+-0.0700283 0.075334 0.0376711
+-0.0144851 0.120961 0.0347298
+-0.0394983 0.0690894 0.041721
+-0.0820593 0.0748753 0.013529
+-0.0262192 0.162456 -0.00472466
+-0.0573804 0.151726 0.0319973
+0.0238729 0.0463312 0.0395213
+-0.00887703 0.0985896 0.0509585
+-0.00180856 0.0881831 -0.0355551
+-0.0435257 0.128183 0.0171556
+-0.0137851 0.096091 -0.0318323
+-0.0776083 0.0770893 -0.00760024
+0.0515137 0.0637653 0.0289012
+0.0459041 0.087617 0.00917007
+-0.0946685 0.124165 0.0192665
+-0.0424078 0.0392874 -0.0253255
+0.0574465 0.0566575 0.0231489
+-0.0705315 0.0915903 0.0419348
+-0.062769 0.175495 -0.0615699
+-0.0614063 0.0419532 -0.0067475
+0.0222874 0.0635154 -0.025946
+-0.0325454 0.0624467 -0.016419
+0.0406665 0.105637 0.00516291
+0.00508145 0.125851 -0.00757191
+-0.0743566 0.148587 -0.0198592
+0.028537 0.0506236 0.0375191
+0.00550651 0.0897139 0.0554063
+-0.0165465 0.061194 0.0523676
+-0.0548344 0.113627 -0.016162
+-0.078421 0.120421 0.0514142
+0.0224472 0.0375897 0.0352799
+-0.0558038 0.116914 0.0367748
+0.0399293 0.104183 0.0231644
+0.00793957 0.0368635 -0.0077325
+-0.053287 0.119647 -0.012449
+0.0226022 0.1018 -0.0197774
+-0.0735157 0.102656 0.0375574
+-0.0544964 0.10974 0.0378742
+-0.0351154 0.127437 0.0128308
+-0.0759568 0.136911 -0.00615991
+-0.0228623 0.06956 0.0485197
+-0.00937118 0.0387712 0.0309279
+-0.0858362 0.103636 0.0243714
+-0.0777036 0.174395 -0.0426027
+0.0605358 0.0664822 0.0111446
+-0.0456637 0.0382067 -0.0202858
+-0.0494922 0.0833478 0.0446801
+-0.0717916 0.0893503 -0.0160567
+-0.0654224 0.156324 0.0217941
+0.0104303 0.128801 -0.000781749
+-0.0640931 0.122778 0.0478095
+0.012373 0.0343732 -0.00643255
+-0.00549358 0.0898053 0.0568842
+-0.0544984 0.0973596 0.0432594
+-0.0430782 0.154691 -0.00814248
+-0.058643 0.155634 0.0155202
+-0.0309118 0.10664 -0.0209245
+-0.0117675 0.0728437 -0.0380964
+-0.0685186 0.1456 0.0424246
+0.0168366 0.113017 -0.0157876
+-0.0567451 0.0768007 -0.0192338
+-0.0905785 0.121592 0.0451008
+-0.0564995 0.0889847 0.0448198
+-0.062649 0.164698 -0.0365908
+-0.0414211 0.0344456 0.0316667
+0.0235849 0.102638 -0.0186769
+0.0208761 0.115613 -0.0126037
+0.00135548 0.0496637 -0.030356
+0.0172645 0.0713208 0.051333
+0.0277553 0.0619298 0.0435605
+-0.0388696 0.105647 -0.0202518
+0.002402 0.041908 -0.0243037
+-0.00348806 0.11693 0.0398821
+-0.094215 0.120106 0.0172864
+-0.075338 0.161792 -0.0134783
+-0.0313944 0.0721215 -0.0285061
+-0.076236 0.178558 -0.0487103
+-0.0516597 0.0416063 0.0458402
+-0.0191702 0.169734 -0.0206461
+-0.0458479 0.0999438 -0.0215809
+-0.0608063 0.0939347 -0.0190005
+-0.0831639 0.108847 0.00132792
+0.0449523 0.0945963 0.00616781
+-0.089716 0.139255 0.0241831
+-0.0241715 0.165363 -0.00880477
+-0.0808978 0.121685 0.0496566
+-0.0776757 0.0873848 0.0375611
+-0.0575877 0.0343902 0.0335477
+0.0293569 0.0808765 0.0442663
+-0.0413959 0.1089 -0.0192706
+-0.0486555 0.0606014 -0.0118523
+-0.0263871 0.06465 -0.0314802
+-0.0479423 0.118344 0.0305757
+0.0368905 0.10997 0.023344
+0.00465961 0.0959425 -0.0295932
+-0.00250198 0.0647948 0.0567081
+0.0155008 0.0345049 -0.00593057
+-0.0414998 0.0944525 0.0421484
+-0.0425159 0.17187 -0.00332083
+-0.00662603 0.045146 -0.0285621
+-0.0728992 0.107873 -0.010241
+0.0162924 0.0680403 -0.0298148
+-0.058126 0.0494622 0.00265482
+-0.049929 0.0335244 -0.00515732
+-0.0592138 0.116352 -0.0129282
+-0.0876027 0.103683 0.0193632
+-0.0661658 0.170967 -0.0590604
+-0.00423283 0.0951855 -0.0328472
+-0.056711 0.153132 0.0293166
+0.0299135 0.0618945 0.0413957
+-0.0754312 0.179188 -0.0498593
+-0.0890756 0.0982905 0.00941744
+-0.0313333 0.114057 -0.0167329
+-0.0336201 0.0505969 -0.0107597
+0.0152428 0.0807565 -0.0298514
+0.000144172 0.129559 0.0255502
+-0.0166332 0.101644 -0.0236856
+0.0112856 0.0666869 -0.0306751
+-0.0719068 0.110755 -0.00961867
+-0.056773 0.082629 -0.0212703
+0.0224949 0.112674 0.0362232
+0.00494458 0.0356784 0.0456125
+-0.0401622 0.123949 0.0243503
+-0.0494029 0.0516267 0.0356191
+-0.000148869 0.0998138 -0.0237113
+-0.0494252 0.12902 -0.00225187
+-0.0351127 0.162221 -0.0139882
+-0.0801061 0.109977 -0.00253557
+-0.0583279 0.116979 0.0383609
+0.0214316 0.0768422 0.0503677
+-0.0637593 0.0357681 0.0182478
+-0.0679574 0.176267 -0.0485208
+-0.0466544 0.0636155 -0.0134601
+-0.018198 0.0896163 -0.0372798
+-0.0675078 0.167827 -0.0267933
+-0.0891218 0.136568 0.0391914
+-0.00634438 0.0961732 -0.0318818
+-0.0509131 0.144221 0.000402933
+0.020479 0.0822082 0.0508036
+0.0382522 0.0617095 -0.0097618
+0.0414447 0.0957847 0.0271584
+0.0495191 0.0624602 0.0299628
+-0.0525648 0.0515684 -0.00660684
+-0.0507038 0.0543653 0.0186143
+-0.0678764 0.117979 -0.00873338
+-0.0833731 0.0803286 0.00149951
+-0.0102345 0.169322 -0.0249254
+0.0161585 0.128774 0.0170439
+-0.0495011 0.0439447 0.0438293
+-0.0308936 0.0901442 -0.0248987
+-0.0380826 0.159224 -0.0120325
+-0.0684954 0.121776 0.0527683
+-0.0237994 0.178657 -0.0117033
+0.022476 0.125337 0.020807
+-0.0131867 0.0392232 0.050872
+-0.0828365 0.116201 -0.00217327
+-0.0792107 0.0760132 0.0281283
+-0.0418712 0.105657 -0.0205306
+-0.0265289 0.11806 0.03154
+-0.0485021 0.104259 0.0404773
+-0.0515007 0.164119 0.00202375
+-0.0628742 0.175671 -0.0555946
+-0.0385777 0.1595 0.00203018
+-0.0410438 0.162368 0.00371458
+-0.0683486 0.124257 0.0521552
+0.0311264 0.0469699 -0.00653546
+-0.0346775 0.127387 0.0115177
+0.0256926 0.105619 -0.0158649
+-0.0656817 0.0705232 -0.0118151
+-0.0889612 0.111861 0.0183359
+-0.027486 0.0646029 0.0384895
+0.0307322 0.108762 0.0340805
+-0.0647018 0.172123 -0.0473675
+-0.0914367 0.114681 0.021315
+-0.00481581 0.0882239 -0.0361964
+-0.0229882 0.0386094 0.0318708
+-0.0164825 0.0530314 0.0497852
+0.031763 0.0653471 -0.018741
+0.0313568 0.052068 0.0363454
+-0.0937998 0.118753 0.0153042
+-0.0460733 0.0336746 -0.01741
+0.00639772 0.0911374 -0.0325899
+-0.0665077 0.105605 0.0392145
+-0.037944 0.165312 0.00115508
+-0.0447719 0.0826286 -0.0206706
+0.015216 0.0849668 -0.0295884
+-0.00949197 0.121025 0.0361236
+-0.0728889 0.159628 -0.0359308
+-0.0212527 0.0696869 0.051144
+-0.0609844 0.0646638 0.031213
+-0.0787829 0.0926997 0.035689
+0.0098313 0.0644618 0.0545535
+-0.0435636 0.0476726 -0.0110362
+0.00292266 0.0383702 -0.00263564
+-0.0294982 0.0674485 0.03887
+-0.0594483 0.0590098 0.0188119
+-0.0331272 0.0335545 -0.0277881
+-0.0654135 0.17638 -0.0519366
+0.0381247 0.0827831 -0.0147803
+0.0274189 0.0834776 -0.02246
+-0.0754296 0.152593 -0.0138871
+-0.0626337 0.149615 -0.00617193
+0.0395378 0.100622 0.0273876
+-0.00317446 0.0951663 -0.0328247
+0.0284436 0.0721192 -0.0227379
+0.0256796 0.0353829 0.0212256
+-0.0100479 0.0388486 -0.00567581
+-0.0815042 0.149744 0.0353513
+0.0569923 0.0508892 0.0171854
+-0.0844404 0.100576 0.0283951
+-0.066663 0.0704664 -0.0109078
+0.011503 0.108488 0.0403225
+0.0346003 0.059954 -0.013776
+-0.00350072 0.0828956 0.0574459
+-0.0308908 0.0524482 -0.0143777
+0.0220365 0.0430228 -0.0147268
+-0.0499219 0.0558508 0.0334877
+-0.0315001 0.070354 0.040029
+0.0121741 0.0780107 0.0545179
+-0.040483 0.0423569 0.0419938
+-0.0438782 0.0343145 0.0294954
+-0.0243712 0.122748 0.0255975
+-0.013279 0.101966 -0.0239644
+-0.0635872 0.0445618 0.0346899
+-0.09116 0.146144 0.0251605
+0.0191385 0.125192 -0.000918824
+0.0439709 0.0776452 -0.00278508
+-0.034376 0.0448305 0.0451875
+-0.0292764 0.0508797 -0.0213979
+-0.0586802 0.148237 0.034554
+-0.0830867 0.0803012 0.027553
+0.0470243 0.0458757 -0.000608958
+-0.0124544 0.125711 -0.00519106
+-0.0316347 0.0511137 -0.0133654
+-0.0495769 0.126877 0.0317874
+0.0446953 0.0861142 -0.000824781
+-0.0164935 0.0744329 0.0555937
+-0.07397 0.135486 -0.00709777
+-0.0388049 0.0885478 -0.0231132
+-0.0738057 0.149865 -0.0338746
+-0.0612039 0.0347997 0.0427656
+-0.0248108 0.064983 0.0421327
+-0.0374965 0.120729 0.0294163
+-0.0773599 0.0940895 0.0370488
+-0.0221316 0.122996 0.0264112
+-0.0656835 0.180548 -0.0590311
+-0.0654403 0.114174 0.0440564
+-0.0576422 0.035457 -0.0105994
+0.0063341 0.0539359 -0.0303914
+-0.0624964 0.108382 0.0385383
+0.000507196 0.0474213 0.049671
+-0.0768403 0.0682209 0.0124564
+-0.0177152 0.0613627 -0.0358053
+-0.0708829 0.156323 0.0169624
+-0.0801272 0.0895173 -0.00861746
+-0.0681398 0.156014 0.0252192
+-0.0643944 0.0418449 0.0286723
+-0.0223108 0.122995 -0.00618559
+-0.0332179 0.0347336 0.0278325
+-0.0494838 0.129682 0.0301574
+-0.0874269 0.111566 0.0378689
+0.0078939 0.0373631 -0.01008
+-0.0556091 0.0372359 0.0469697
+-0.0495471 0.140136 0.00640196
+-0.0721891 0.0696552 -0.00460695
+-0.0645108 0.135348 0.0400634
+-0.00963836 0.0466527 -0.0295963
+-0.00450177 0.0856564 0.0572774
+-0.0726963 0.163825 -0.0409661
+-0.0831522 0.148677 0.0355101
+-0.0045943 0.109577 -0.0220661
+-0.0700292 0.14319 -0.0126949
+0.0170086 0.0672594 0.0509139
+-0.0184932 0.0842766 0.0574008
+0.0333985 0.0809938 -0.0187374
+-0.00658339 0.116828 -0.0157946
+-0.0830307 0.110356 0.0344756
+-0.0164574 0.11955 0.0353527
+-0.0437556 0.0335262 -0.0205177
+-0.0196754 0.180147 -0.0162801
+0.00748686 0.0427091 0.0452774
+0.047238 0.0525837 0.0312359
+-0.00150012 0.0842876 0.0575029
+-0.0647611 0.154265 0.00245101
+0.0385227 0.108358 0.00315989
+0.00616601 0.0343841 0.0199712
+0.0190967 0.127602 0.0138576
+0.0232916 0.104676 0.0408599
+-0.0209519 0.121676 -0.0087885
+-0.000475449 0.077417 0.0583222
+-0.0340577 0.0344858 -0.0194842
+-0.0449113 0.0342791 0.0293115
+-0.02963 0.125357 0.0045818
+-0.0442513 0.120873 0.0273959
+0.0233607 0.0713858 0.0478141
+0.0294074 0.0974659 -0.0171759
+-0.0251322 0.110719 -0.0192347
+-0.0168318 0.0883012 -0.0380546
+-0.0537516 0.078251 -0.0196488
+-0.0617185 0.155298 -0.026582
+0.0182327 0.0369462 -0.015679
+0.0204347 0.103384 0.043762
+-0.0271652 0.177189 -0.00775302
+-0.078183 0.161072 -0.0259393
+-0.000994284 0.0346324 -0.0168306
+-0.0369077 0.0407733 0.0449918
+-0.0117377 0.0685356 -0.0370961
+-0.0520176 0.136681 0.0271356
+-0.0244827 0.044849 0.0526821
+0.0122811 0.0490196 0.0473922
+-0.0310488 0.126128 0.0128475
+-0.0612252 0.0618413 0.0248018
+0.0110023 0.0872551 0.0546654
+0.0137177 0.0926941 0.0515916
+-0.050909 0.135812 0.0260882
+-0.0514988 0.090386 0.0447021
+-0.0776802 0.121779 0.0520726
+-0.0435045 0.0492094 0.0395536
+0.0427867 0.0445146 0.027427
+-0.0124587 0.0716774 0.0554083
+-0.0903482 0.115904 0.00630147
+-0.0676703 0.159658 -0.00956407
+-0.0534975 0.100135 0.0423919
+0.0299608 0.102103 0.0382304
+-0.0275896 0.0398384 -0.0294326
+-0.0354902 0.0576195 0.0391492
+-0.0365293 0.120277 -0.0112077
+0.000101878 0.111584 -0.0199068
+-0.0568115 0.11798 -0.012657
+-0.0134078 0.0383017 0.0160824
+-0.078485 0.131655 0.0526796
+-0.0630792 0.17626 -0.0613621
+0.00219436 0.0880897 -0.0340427
+-0.00664745 0.0511524 -0.0316637
+-0.0221856 0.122325 -0.00745001
+0.0517581 0.0684217 0.00143507
+-0.0206221 0.0450432 -0.0278804
+-0.0187788 0.181486 -0.0239544
+-0.0435029 0.119128 -0.0140097
+-0.0368374 0.0957548 -0.023046
+0.0360094 0.105316 -0.00780471
+-0.0310017 0.0339922 0.010953
+0.0468601 0.0467385 0.0270828
+-0.0800669 0.107282 -0.00460113
+0.0161405 0.0847501 0.0515574
+-0.0726437 0.152619 -0.0388965
+-0.030372 0.124909 0.019004
+-0.0532086 0.0387959 0.0470712
+-0.00947284 0.0717726 0.0568611
+-0.0417517 0.0449058 -0.0193246
+-0.0324319 0.159505 0.00208324
+-0.064273 0.0404086 0.0266782
+-0.0456914 0.0665681 -0.0150523
+-0.0317955 0.0901023 -0.0248195
+-0.0901544 0.148798 0.0121684
+-0.0448181 0.0898814 -0.0220536
+-0.00651 0.0385696 0.00453582
+-0.0505409 0.146308 0.012527
+-0.0736443 0.148637 -0.0247496
+0.0362923 0.0826461 -0.0167222
+-0.0582688 0.0380855 0.0465946
+0.0420736 0.0957824 -0.00279849
+0.059075 0.0677442 0.0201625
+-0.0118076 0.166362 -0.0213381
+-0.0293882 0.0593157 -0.02241
+-0.00750084 0.0688979 0.0559719
+-0.0834808 0.0763288 0.0055122
+0.0455463 0.0847945 0.0181695
+-0.0853379 0.139291 0.0436042
+-0.0127384 0.0714338 -0.0383051
+0.0288553 0.119043 0.000370228
+0.0382387 0.108322 0.00216703
+-0.0854254 0.147285 0.0350057
+-0.0290239 0.0918566 -0.0266024
+-0.089435 0.0996945 0.016394
+-0.0250572 0.0379934 0.0230062
+-0.0659224 0.108105 -0.0137141
+-0.0197383 0.064191 -0.0362126
+0.0332406 0.0828224 -0.0189128
+-0.050463 0.0627793 0.0338697
+-0.00332118 0.0928352 -0.0344367
+-0.0351624 0.0344214 0.0133327
+0.0337894 0.103744 -0.0118635
+-0.0685313 0.0435239 0.00368786
+-0.0915175 0.140609 0.0191776
+-0.0763247 0.0679089 0.0110614
+-0.0293662 0.0904135 -0.0285737
+-0.0268485 0.0931277 -0.028596
+-0.0493167 0.137038 0.00442458
+-0.0607789 0.121227 0.0419471
+-0.0167795 0.0984818 0.0458118
+-0.0218018 0.0947992 -0.0305488
+-0.0933659 0.118725 0.0133024
+-0.0263107 0.0780916 0.0488984
+-0.0689525 0.144454 -0.0174142
+-0.0698503 0.0980241 -0.015524
+0.0377251 0.0602627 -0.00973714
+-0.0616079 0.160003 -0.0285892
+-0.00362249 0.0451016 -0.0279234
+-0.0658161 0.0866791 -0.018673
+-0.0898976 0.132262 0.00523931
+-0.014426 0.0383347 0.0104075
+-0.0891789 0.14342 0.0311627
+-0.0516305 0.0633366 -0.0105425
+0.0421385 0.102872 0.00916356
+-0.073056 0.163825 -0.0399663
+0.0142799 0.0695538 -0.0310885
+-0.0191804 0.172724 -0.0156293
+-0.0111853 0.109046 -0.0214904
+-6.48961e-05 0.130222 0.00105503
+-0.037907 0.0368934 -0.0113278
+-0.0778791 0.116346 -0.00545689
+-0.0353032 0.042242 0.0460623
+-0.0732356 0.176411 -0.0530886
+0.0601048 0.0608967 0.00715985
+-0.052965 0.0595916 0.0265588
+-0.0564973 0.0762116 0.0428205
+-0.034872 0.104274 -0.0209307
+-0.058681 0.0336414 -0.0106847
+-0.082997 0.0883523 -0.00560613
+-0.0901456 0.140633 0.0231701
+0.059772 0.0594746 0.00715469
+0.0315129 0.0439606 0.0299133
+-0.0749354 0.108383 0.0378851
+-0.0718123 0.0950995 -0.0154446
+-0.017311 0.117579 -0.0145168
+-0.0492219 0.145089 -9.42983e-05
+-0.0492467 0.0335224 -0.00684693
+-0.077013 0.157587 -0.0116646
+-0.0395098 0.12077 0.029092
+-0.0676415 0.155906 0.0108585
+-0.0115046 0.0688083 0.054897
+0.00350877 0.068881 0.0557692
+-0.00832726 0.0349131 -0.024554
+0.00623924 0.0754282 -0.0343629
+-0.0601994 0.14968 0.0358889
+-0.0681006 0.0726203 0.0368546
+-0.0550659 0.154073 0.0197239
+0.0220423 0.0388246 -0.00567731
+-0.050633 0.0633988 -0.0111763
+0.0262673 0.0718723 -0.0242084
+0.00651709 0.084208 0.0565081
+-0.0508195 0.0927229 -0.0217389
+-0.0823617 0.110377 0.0328225
+-0.0443307 0.0345511 0.0362271
+-0.0664541 0.159015 -0.0105538
+-0.065725 0.180452 -0.0578644
+-0.00729397 0.0383333 0.0172997
+-0.083856 0.108875 0.00233606
+-0.0531754 0.160014 0.00733632
+-0.0617546 0.0335347 0.00511487
+-0.0436843 0.0666417 -0.0153695
+-0.0475053 0.16079 0.00736091
+0.0213151 0.0393899 0.0411211
+-0.0126085 0.0434839 -0.0264186
+-0.058072 0.135467 -0.00577889
+-0.0144744 0.0573903 0.0514423
+-0.0480757 0.15465 -0.00633475
+-0.0214326 0.158913 -0.0108411
+0.0317035 0.0927362 -0.0181479
+0.0258633 0.0505634 0.0389033
+-0.0916556 0.116096 0.0323166
+-0.0344737 0.0973629 0.0436701
+-0.0772898 0.158355 -0.013903
+0.00252455 0.078679 0.0567626
+-0.0768599 0.0852186 -0.0125783
+0.00638417 0.060281 0.0547831
+0.00351108 0.067509 0.0559028
+-0.0775506 0.172738 -0.0395384
+-0.0941076 0.120125 0.0222927
+0.0397169 0.0400457 0.0217023
+-0.00993012 0.125562 -0.00707028
+0.0207467 0.0387687 0.0412277
+-0.0770466 0.0947961 -0.0125384
+-0.0208658 0.163381 -0.0161046
+-0.0194871 0.0786419 0.0560662
+-0.00848562 0.0978428 0.0521021
+-0.00195749 0.0369571 0.00873581
+-0.0554658 0.14959 0.0286413
+-0.0613355 0.171315 -0.0617342
+-0.0405058 0.060576 0.0408455
+-0.019245 0.0381493 0.0168345
+0.0318352 0.0959581 -0.0155753
+-0.0894336 0.0956291 0.0144221
+-0.0562826 0.138192 -0.0042334
+-0.0587859 0.118384 0.0394982
+0.0557398 0.0577143 0.000186064
+0.021293 0.0347861 0.0208687
+-0.0521809 0.0564969 0.0230721
+-0.088994 0.140671 0.0361625
+-0.0626529 0.0336856 0.0101657
+-0.0346997 0.0808739 -0.0236048
+-0.0740754 0.0791322 0.0370556
+0.0424523 0.0958497 0.0251568
+0.0156501 0.129207 0.0125793
+-0.0758074 0.0766216 0.033593
+-0.053977 0.0335099 0.00491422
+-0.049617 0.115589 0.0334474
+-0.0151821 0.115592 -0.0164315
+0.0198002 0.113601 -0.0144182
+-0.0297803 0.0833036 -0.0335871
+-0.0888224 0.0929368 0.0224135
+-0.0255078 0.162179 -0.0150106
+-0.0468796 0.105628 -0.0200508
+0.0328144 0.0654355 -0.0177831
+0.0401246 0.0657991 0.0315825
+-0.0619246 0.161563 -0.0295917
+-0.0336612 0.0423072 0.0487868
+-0.0806782 0.140364 -0.00279029
+-0.0575747 0.034031 0.0251021
+-0.00250061 0.0856648 0.0572816
+-0.051497 0.0776631 0.0434639
+-0.0314085 0.177247 -0.00418119
+-0.0382796 0.035429 0.0243806
+-0.0273926 0.0381858 0.00428469
+-0.0590133 0.128179 -0.00718347
+-0.059761 0.058524 0.00837605
+-0.089717 0.142036 0.0301646
+-0.0708787 0.0634588 0.0196178
+0.017237 0.0368135 -0.0176915
+0.0283981 0.0848865 0.0446615
+0.042292 0.0669509 0.0276386
+-0.0400442 0.15362 -0.00816685
+-0.0666868 0.15458 -0.000433214
+0.00520355 0.0894816 -0.0332282
+-0.0438381 0.033833 0.0263899
+-0.0863798 0.100827 0.00341316
+-0.0560788 0.154579 -0.00133297
+-0.0130807 0.0387897 0.0319484
+0.0526374 0.0710929 0.00470311
+0.0114966 0.0923286 0.0527326
+-0.0637555 0.0336685 -0.00625178
+-0.0475689 0.0432884 -0.0109341
+-0.0725775 0.0367142 0.00725292
+-0.0374892 0.112529 0.0350998
+0.0350676 0.0395586 0.0248293
+-0.031508 0.0675059 0.0394967
+0.0422807 0.0831292 -0.00677447
+-0.0617624 0.0810326 -0.0192317
+-0.0601798 0.155861 0.0135147
+-0.0160151 0.185636 -0.0207096
+-0.0495589 0.141679 0.00640064
+0.0451001 0.0791381 0.000209359
+-0.00648871 0.115533 0.0401374
+-0.0179936 0.034905 0.0502652
+-0.0345243 0.0619374 0.0399691
+0.0253647 0.107408 0.0385761
+0.0241683 0.0795725 0.0490812
+-0.076883 0.154198 -0.00789596
+-0.022619 0.0436731 -0.0285417
+0.0302544 0.115002 0.0294335
+-0.0112354 0.0407042 0.0501624
+-0.0374964 0.118015 0.0312717
+-0.0264155 0.169752 -0.0102811
+-0.0325172 0.115309 0.0332233
+-0.0883434 0.0968836 0.00640652
+-0.0074894 0.104457 0.0437929
+-0.0122029 0.0391189 0.0354325
+0.0605626 0.0609358 0.0161739
+-0.0291057 0.0349617 0.0478282
+-0.00632683 0.0367419 -0.0160833
+0.0422139 0.06433 -0.00247442
+-0.0834639 0.0815548 0.0279962
+-0.091428 0.113787 0.018961
+-0.0164849 0.0911174 0.0558291
+-0.0521483 0.153554 0.0122178
+0.0344074 0.0446243 -0.00536213
+-0.09232 0.126938 0.0302595
+-0.0718881 0.12088 -0.00850233
+-0.0769692 0.155214 0.0250641
+-0.0847077 0.140411 0.00224002
+-0.0180254 0.171268 -0.0157212
+0.0102822 0.065327 -0.0312772
+-0.0271732 0.171194 -0.0185934
+-0.0475224 0.0587349 0.0366732
+-0.0815066 0.0980245 0.032594
+-0.0287322 0.0335484 -0.0250427
+0.000965074 0.0348235 0.00577003
+-0.0874433 0.114073 0.0447649
+-0.0745611 0.163685 -0.0159572
+-0.0504998 0.0931897 0.044287
+0.00144942 0.127679 0.0289378
+-0.0830551 0.128552 0.0515383
+-0.0537303 0.0473713 0.0135851
+-0.0226958 0.0380494 0.0144148
+-0.0698996 0.147518 -0.0298062
+-0.0374978 0.0833038 0.0438252
+0.0144108 0.118463 -0.013667
+-0.0810085 0.1097 0.0318734
+-0.0883068 0.151437 0.0121831
+0.0014962 0.114186 0.0411808
+-0.0457512 0.0782542 -0.0192962
+-0.0728503 0.107163 0.0374416
+-0.0546426 0.0335759 -0.00981752
+-0.0905935 0.133662 0.00922276
+-0.0777368 0.158322 -0.016916
+0.0333249 0.108715 0.0307644
+-0.0758319 0.0675199 0.00554661
+-0.0608714 0.0385134 0.0195368
+-0.0766234 0.167356 -0.0265012
+0.0324864 0.115764 0.0245556
+-0.051601 0.149349 0.0154046
+-0.0370133 0.1227 0.0269929
+-0.0556554 0.124247 -0.00722427
+-0.0272643 0.118767 -0.0116611
+-0.0284876 0.0660147 0.0384689
+-0.0890493 0.136506 0.0262024
+0.0455252 0.0918117 0.00617298
+-0.0739705 0.110854 0.0450522
+-0.054929 0.0378655 -0.0109689
+-0.0211646 0.0933284 0.0517404
+-0.00865087 0.0496719 -0.030975
+0.0599111 0.0692057 0.0151972
+0.0182222 0.0631608 0.0491228
+-0.0659867 0.134061 -0.00822741
+-0.0533518 0.117447 -0.0141574
+-0.0356207 0.0519761 -0.0103771
+-0.0674828 0.0383816 0.0133921
+-0.0179472 0.0391243 0.0360362
+-0.0353932 0.0352385 0.0143534
+-0.0381912 0.168168 -0.0127822
+0.0242439 0.0994852 0.044008
+-0.0331278 0.165217 -0.0153881
+0.0419441 0.102888 0.00516309
+-0.0744413 0.0833098 0.038687
+-0.0349807 0.177 -0.00919022
+0.00950876 0.0882899 0.055046
+0.0203114 0.0607424 -0.0267183
+-0.00473829 0.0684427 -0.0355801
+-0.0293549 0.0495451 -0.022456
+0.0213555 0.0521216 -0.0251867
+-0.0608025 0.132515 0.0384279
+-0.086306 0.0981081 0.00140707
+0.0124215 0.122685 -0.01021
+0.0534041 0.0547278 -0.00176167
+-0.0725172 0.105485 0.0374705
+-0.0925573 0.125589 0.0382552
+0.023685 0.124697 0.0198268
+0.0381226 0.0574698 -0.00591549
+-0.0358756 0.107103 -0.0202685
+-0.00445554 0.112864 -0.0195829
+-0.00333512 0.125963 -0.00760181
+0.0355639 0.058664 -0.0117324
+-0.0752743 0.171989 -0.0354168
+0.0264872 0.122262 0.00520712
+-0.0911855 0.114622 0.00933636
+-0.0888501 0.102361 0.0153809
+0.0303343 0.0358493 0.0181065
+0.0388945 0.108364 0.0171641
+0.0444906 0.0861036 -0.00180248
+-0.00457845 0.0388805 0.0300129
+-0.0689372 0.126774 -0.00892675
+0.0352594 0.113795 0.0141522
+0.0379749 0.0374097 0.0109015
+0.00640925 0.0404248 -0.023654
+-0.0569156 0.112617 -0.0162683
+-0.0161127 0.0388433 -0.0124778
+-0.0568734 0.0358081 0.0462717
+-0.0852004 0.111887 0.0434561
+-0.0393334 0.174116 -0.00798067
+-0.0335527 0.156609 0.00223348
+-0.06623 0.13826 0.0429445
+-0.029146 0.168214 -0.0173005
+0.0267233 0.0347365 0.00732658
+-0.0416725 0.0607151 -0.0124173
+-0.0304675 0.175749 -0.00423829
+-0.0888241 0.114444 0.00524771
+-0.00228102 0.038771 0.0269718
+-0.0353955 0.0337248 -0.0302701
+-0.0474965 0.0862056 0.045143
+-0.0615859 0.155307 -0.0235819
+0.0506383 0.0516722 -0.00273463
+0.0335552 0.036072 0.00748554
+-0.00436077 0.12603 -0.00766771
+-0.0239599 0.182991 -0.0170658
+-0.00549985 0.07185 0.0581365
+-0.0328429 0.0972178 -0.0231932
+-0.091474 0.148846 0.0181354
+0.0336134 0.0876336 0.0416906
+-0.0614982 0.101529 0.0422258
+-0.0495014 0.0464837 0.0411417
+-0.0551395 0.054088 0.00915623
+-0.0432223 0.147486 -0.00120685
+-0.0358825 0.108535 -0.0199213
+0.00990352 0.130871 0.0175976
+-0.00150184 0.0978367 0.052434
+-0.0334203 0.0667037 -0.0174892
+0.0289827 0.0467369 -0.00766304
+-0.0555362 0.0629843 -0.00681601
+-0.0758946 0.0992374 -0.0118631
+-0.0367472 0.127095 0.0166739
+-0.0571684 0.0576767 0.00966588
+-0.0823623 0.154598 0.0188308
+-0.0905142 0.129614 0.0405398
+-0.0677394 0.0764997 -0.0160371
+-0.0201192 0.163785 -0.0165508
+-0.0132881 0.113144 -0.01784
+0.0143956 0.046307 -0.0246969
+0.0117341 0.0390743 0.0447312
+-0.0746833 0.155701 -0.000366346
+-0.069527 0.156219 -3.70248e-05
+-0.0226679 0.0341396 -0.0206509
+-0.00924422 0.0344526 -0.0182921
+-0.0276907 0.0335904 -0.024878
+-0.00470812 0.0669686 -0.0349707
+-0.024291 0.106203 -0.0224613
+-0.0142085 0.0972199 -0.0290358
+-0.0465353 0.133196 0.0100953
+-0.0245088 0.108515 0.0403619
+-0.092997 0.116043 0.0153159
+-0.0517083 0.131123 0.0322407
+-0.0456135 0.053373 -0.0104441
+-0.0345226 0.0846315 0.0427551
+-0.00735617 0.0354566 -0.0169734
+-0.0865776 0.109066 0.0163469
+-0.0436408 0.0408205 -0.0223011
+-0.0526724 0.130856 -0.00431281
+-0.0516582 0.0647811 -0.0108241
+0.0182047 0.100313 -0.0224597
+0.0445886 0.0833307 0.0241696
+-0.0749819 0.151307 -0.0268775
+-0.0846364 0.0845811 0.0264985
+-0.0452001 0.165138 -0.00833108
+-0.0791947 0.168601 -0.0366432
+-0.0848581 0.120613 -0.00298955
+0.0319638 0.0780558 -0.0197042
+-0.0923737 0.128196 0.0102559
+0.0394261 0.0716433 -0.0107927
+0.0122035 0.115305 -0.0162457
+-0.0229162 0.0383263 0.00143492
+0.0428254 0.0986969 0.0191637
+0.0153612 0.0463061 -0.0243571
+-0.00764709 0.0511598 -0.0317878
+-0.0853621 0.135278 0.0465646
+-0.0829375 0.116994 0.0487646
+-0.085028 0.100559 0.0275605
+-0.0219183 0.0382906 0.00166561
+-0.0765591 0.0818865 0.0366215
+0.0417584 0.0971928 -0.00282344
+-0.064598 0.141073 0.0399979
+0.0464507 0.0764566 0.0101865
+-0.0788399 0.114858 -0.00418456
+-0.0825062 0.110166 0.000353593
+0.029005 0.0699505 0.0419019
+-0.0144969 0.0814706 0.0569355
+0.0278524 0.115393 0.0316598
+-0.0742949 0.17555 -0.0422185
+-0.0749686 0.158241 -0.0259415
+-0.0378653 0.102824 -0.0209313
+-0.0110297 0.11443 -0.0172182
+0.0092913 0.0739064 -0.0330363
+0.0274028 0.0416284 -0.00496361
+-0.0105374 0.130025 0.0158825
+-0.0530895 0.0530892 -0.00643833
+-0.0165413 0.0573347 0.0511714
+0.0165193 0.125294 -0.00303164
+-0.080526 0.109264 0.0359357
+-0.0639459 0.153257 -0.00670123
+0.0199666 0.126684 0.0198751
+0.0426813 0.101508 0.00916223
+0.0270307 0.0781852 0.0461538
+0.00819303 0.0342719 -0.00156322
+-0.0758021 0.154133 0.0299324
+0.0217183 0.114203 -0.013082
+-0.0761724 0.154401 0.00198863
+0.0253655 0.0814952 -0.0244829
+-0.0357817 0.0871994 -0.0240994
+-0.0181797 0.178658 -0.0176382
+-0.018211 0.0697307 0.0537615
+-0.0393811 0.154717 -0.00895732
+-0.014508 0.0659228 0.0537042
+-0.0294961 0.104302 0.0413374
+-0.0281692 0.171188 -0.018077
+-0.0564789 0.0833746 0.0446901
+-0.0817321 0.120346 0.0490739
+-0.0180945 0.124042 -0.00530863
+-0.0722448 0.0688588 0.0287217
+-0.064637 0.0404566 0.0276669
+-0.0642686 0.171043 -0.0609844
+-0.00150003 0.0520299 0.0541649
+0.0343966 0.0968432 0.0376227
+0.033587 0.0739599 -0.0167921
+-0.0916761 0.122705 0.00729331
+0.0435692 0.0691645 0.0259965
+-0.0583799 0.0342852 0.0299739
+0.0193411 0.0593649 -0.0271573
+-0.0630027 0.145885 -0.0118617
+-0.0492939 0.133961 0.00142725
+-0.0445641 0.0405033 0.0438121
+-0.0534909 0.101517 0.0419949
+-0.0137652 0.0728728 -0.0386088
+-0.000746952 0.0726633 -0.0355323
+-0.00426313 0.130924 0.016725
+-0.0833848 0.0776237 0.00250717
+0.0107457 0.127435 -0.00331768
+-0.0566099 0.136533 -0.00462162
+-0.0137664 0.0742812 -0.0386456
+-0.0253123 0.0865272 0.0518462
+0.0391332 0.0800655 -0.0117735
+-0.0595022 0.0987448 0.042776
+-0.031899 0.0792306 -0.0315346
+-0.074881 0.117904 -0.00727699
+-0.0755718 0.165165 -0.0201548
+0.0408155 0.0939721 0.0292858
+-0.0854938 0.096523 0.0281673
+-0.0644931 0.105621 0.039804
+-0.0196701 0.0554437 -0.0324495
+0.0139693 0.112639 -0.017366
+-0.00232624 0.124886 -0.00844394
+-0.0617679 0.0824635 -0.0193558
+-0.0599121 0.0588939 0.00621161
+-0.0826266 0.146034 0.0392943
+-0.0649084 0.165706 -0.0272764
+-0.0602113 0.0697286 0.0375341
+-0.00175042 0.0897209 -0.0353687
+-0.0275054 0.107176 -0.0215083
+-0.062122 0.0429616 0.0266943
+0.032428 0.0625798 -0.0177725
+-0.0663881 0.0677373 0.0326703
+-0.02076 0.0347198 -0.0277376
+-0.0519381 0.0597689 0.0297286
+-0.0595413 0.0582322 0.0158865
+-0.0445568 0.151229 -0.00569012
+-0.0210951 0.12531 -0.000542597
+-0.020213 0.178617 -0.0227863
+-0.00769265 0.0388371 -0.00333188
+-0.0344924 0.09037 0.0442186
+-0.0786032 0.107051 0.0327104
+-0.0434904 0.12843 0.000929671
+-0.058473 0.115363 0.0369711
+0.045085 0.0833373 0.00221176
+-0.0384977 0.0648621 0.0416261
+-0.0407478 0.0768336 -0.0187281
+-0.0578796 0.102621 -0.0187883
+-0.0846144 0.128516 0.0502768
+0.0170529 0.075444 0.0528157
+-0.018505 0.0786406 0.056357
+-0.0752579 0.0874199 0.0393733
+0.043967 0.0636126 -0.00172463
+-0.0914628 0.146095 0.0181484
+-0.0294715 0.117536 0.0312989
+-0.0581079 0.0480417 -0.000353036
+-0.0384621 0.172216 -0.000421117
+0.0412086 0.0684033 0.0296357
+-0.0332986 0.0384796 -0.0137148
+-0.0549774 0.0335456 0.00467992
+0.00953694 0.103082 0.0459273
+-0.048193 0.133027 0.0241926
+0.00364343 0.0960341 -0.0296841
+-0.0809226 0.0926448 0.0335946
+0.0316471 0.05126 -0.00972402
+-0.0622205 0.164668 -0.0515889
+0.0257137 0.0591918 0.0440938
+-0.0116637 0.0384284 0.00907266
+0.00758624 0.0341288 -0.016561
+-0.0732628 0.0731075 0.0335988
+0.0105031 0.0347322 0.0422156
+0.0273613 0.0592959 -0.0217662
+-0.0329323 0.126815 0.00921204
+-0.0462425 0.0615364 0.0381535
+0.00735972 0.130718 0.020957
+-0.0618449 0.152018 0.0348716
+-0.0311962 0.0475489 -0.0247586
+-0.0384898 0.113893 0.0344296
+-0.0268492 0.155368 -0.00477229
+0.0138974 0.0344287 -0.0156692
+-0.0374813 0.169748 0.00157136
+-0.0892091 0.137796 0.0122163
+-0.0705026 0.0958452 0.0418601
+-0.0862013 0.10903 0.0113533
+-0.0682521 0.15944 -0.00832765
+0.038441 0.100665 0.0293761
+-0.0639313 0.11526 -0.0113233
+-0.0664444 0.151761 -0.0404644
+0.0142088 0.034798 0.0302902
+-0.0244166 0.0931902 0.0479432
+-0.0714792 0.167875 -0.0225174
+-0.0161203 0.0383572 0.000963241
+0.0282773 0.0862159 0.0445154
+0.0375 0.107296 0.0262149
+-0.0891989 0.11586 0.044703
+0.00339178 0.0433892 -0.0247833
+-0.0790801 0.0704064 0.00826811
+-0.0237813 0.0756129 -0.0382516
+0.00190837 0.124868 -0.00847893
+0.0243137 0.119818 0.0300741
+-0.0758951 0.123764 -0.00763971
+0.052991 0.0735097 0.0116286
+-0.0175974 0.0393048 -0.0277532
+-0.013784 0.0799171 -0.0389774
+0.00451197 0.0619711 0.0562284
+-0.0331612 0.0342582 0.0246899
+0.0314823 0.114431 0.0284596
+-0.0530088 0.145722 -0.00115007
+-0.0684496 0.0369814 0.0129839
+-0.0203772 0.158233 -0.00725915
+0.0148967 0.0366228 -0.0205744
+-0.0250413 0.0925197 -0.0322644
+-0.0424949 0.168218 0.00285877
+-0.0414982 0.0719267 0.042103
+-0.0939163 0.120093 0.0142993
+-0.0164902 0.112704 0.0398029
+-0.000484486 0.0703477 0.056848
+0.060415 0.0678562 0.0151973
+-0.0550635 0.116914 0.036091
+0.0200483 0.0385661 -0.0116898
+-0.0250588 0.123734 -0.00291588
+0.0403936 0.0629925 0.0301493
+0.0379656 0.0874795 0.0356781
+-0.0548923 0.105518 -0.0186699
+-0.0311396 0.166714 -0.0162904
+0.0470624 0.0740285 0.0123586
+-0.0678676 0.100922 -0.0154166
+-0.0631629 0.124137 0.0456282
+-0.0731746 0.154066 -0.0319096
+-0.0307727 0.033545 -0.0254394
+-0.0890856 0.122978 0.0464209
+-0.0236634 0.123398 -0.00459221
+0.046259 0.0820395 0.0071847
+-0.000605347 0.130433 0.0223861
+0.0192013 0.0591556 0.0487522
+-0.0498987 0.124057 -0.00910218
+-0.0170638 0.168326 -0.0143421
+0.0265398 0.104204 -0.0163559
+-0.0938575 0.120136 0.0242923
+-0.0179474 0.100123 -0.0240926
+-0.058599 0.155538 0.0184341
+-0.0170777 0.0418831 0.0522589
+-0.0545484 0.0457621 -0.00683862
+0.00723985 0.076824 -0.0341303
+-0.0907031 0.148891 0.0231421
+-0.0174825 0.107148 0.0420092
+-0.0911131 0.129682 0.0362351
+-0.0499113 0.147776 0.0118822
+-0.0657818 0.152842 -0.0413063
+0.0528515 0.0592232 -0.00323634
+-0.0693828 0.0805427 0.0408087
+-0.060108 0.0423138 0.0158374
+0.0281616 0.0699505 0.0424355
+0.00679863 0.0347495 0.0432322
+-0.0458268 0.125298 0.0247658
+-0.0567225 0.043789 0.0226896
+-4.09913e-05 0.10064 0.0465907
+-0.0729374 0.129655 -0.00843737
+0.0415013 0.104244 0.010161
+0.0342459 0.0889575 0.0408509
+-0.0808289 0.138985 -0.00281163
+-0.0425095 0.171123 -0.00130836
+-0.0870569 0.137884 0.0425258
+0.00149552 0.116934 0.0397718
+-0.0158011 0.0388262 -0.0105326
+0.00549603 0.0413259 0.0457036
+-0.0325959 0.124521 0.0211556
+-0.058912 0.109738 -0.0167726
+-0.0772259 0.151416 -0.00590086
+-0.0077735 0.0770379 -0.0376668
+0.0385932 0.0436441 0.0291648
+-0.0778914 0.162484 -0.0299302
+-0.0641074 0.0639595 0.0276548
+0.0187103 0.0342934 0.0023932
+-0.0858293 0.151702 0.00893089
+0.0336067 0.0504819 0.0325279
+-0.0810076 0.10869 -0.00259876
+-0.0557401 0.0547516 -0.00240302
+-0.0335154 0.108413 0.0382413
+-0.00564795 0.049654 -0.0307584
+-0.0765497 0.0728479 -0.00560245
+-0.00214115 0.127727 0.0291435
+-0.0701217 0.159568 -0.0479252
+-0.0794787 0.104524 -0.00660043
+0.00849938 0.0366585 0.0454484
+-0.0305059 0.0889327 0.0438397
+-0.0638439 0.101082 -0.0177706
+-0.0045041 0.0801506 0.0577231
+0.013232 0.0835986 -0.0303791
+-0.0809796 0.0788834 0.0298322
+-0.0148841 0.0959887 -0.031739
+-0.0699437 0.0669048 0.0273786
+-0.0514117 0.134659 0.0288827
+0.0105257 0.123354 0.0336723
+0.0263222 0.107421 0.038207
+-0.0125183 0.095238 0.0536312
+-0.0634853 0.0904216 0.0451002
+0.0377424 0.110293 0.0150624
+-0.0700913 0.0419644 0.00613646
+-0.0565326 0.0401709 -0.00945456
+-0.0553504 0.0460785 0.0138247
+-0.0114916 0.0759418 0.0571389
+-0.0796666 0.0886389 0.0352895
+0.0338998 0.0888046 -0.0179815
+-0.0207237 0.0567772 0.0467736
+0.0293267 0.120376 0.00767428
+-0.0865466 0.137714 0.00320362
+-0.0815177 0.106 -0.00361682
+0.0360857 0.0784054 -0.0147648
+-0.0706254 0.129856 0.0506426
+0.0309103 0.088937 0.0430941
+0.0186908 0.127724 0.0151265
+0.0607002 0.0665033 0.01416
+-0.0347226 0.0711465 -0.0183854
+-0.0475247 0.0335798 -0.00289187
+0.00330662 0.0597508 -0.0323981
+0.0162777 0.117973 -0.0131407
+0.0260142 0.118212 -0.00538239
+-0.0524983 0.0477783 0.0397646
+0.00462528 0.109546 0.0419595
+-0.0848442 0.146005 0.0372765
+-0.0568876 0.0998079 -0.0197942
+-0.0478768 0.15504 0.00962757
+0.0236771 0.0956901 -0.0213272
+-0.0909699 0.113313 0.018324
+-0.0314956 0.0560344 0.0371147
+0.0419523 0.101425 0.00119033
+-0.0205212 0.118181 0.0347958
+0.00296971 0.0341513 0.00863676
+-0.0034922 0.0473569 0.0490622
+0.0168587 0.0347265 0.0236529
+-0.00422658 0.0396088 0.0480089
+0.0402871 0.104196 0.0211608
+-0.0211382 0.0985478 0.044502
+-0.0469324 0.0383628 -0.0152843
+0.0223386 0.0578809 -0.0262309
+-0.094679 0.122825 0.0202733
+-0.00649716 0.0619561 0.0561245
+-0.0530923 0.143138 0.0243879
+0.0586666 0.0690768 0.00715872
+-0.0632884 0.0444363 0.0372932
+-0.0584087 0.0421172 0.0451764
+0.0462769 0.0649494 -0.00109094
+-0.0892011 0.0983026 0.0104143
+-0.050311 0.033406 0.00395206
+-0.0171117 0.123425 0.0297114
+-0.0067867 0.0784694 -0.0378945
+-0.0413793 0.0448727 -0.0203291
+0.00613123 0.105885 -0.0208912
+-0.0209654 0.035527 0.0525237
+0.0515169 0.0664883 0.0274059
+-0.0186581 0.0985081 0.0446525
+0.00326552 0.127077 0.029619
+0.00950248 0.111292 0.0396928
+0.0420852 0.077848 0.0291974
+-0.0404715 0.0343242 0.0319689
+-0.0775002 0.156948 -0.0139048
+-0.0828255 0.0924347 -0.00656966
+-0.0256554 0.124701 0.019279
+0.00649798 0.107134 0.0414437
+-0.0067083 0.0613544 -0.0352012
+-0.0341277 0.165212 -0.0151261
+-0.0305288 0.0353431 -0.0195833
+0.00449494 0.105757 0.0421851
+-0.0313565 0.161046 -0.00157639
+0.00317447 0.0908801 -0.0331491
+-0.066706 0.0375681 0.0351923
+0.0146203 0.128223 0.0236197
+-0.0931816 0.121543 0.0372829
+-0.0390449 0.0344196 0.0339502
+0.0204938 0.0865196 0.0494812
+-0.0909512 0.147073 0.025026
+-0.0398753 0.149194 -0.00215183
+0.0371767 0.095465 0.0345819
+-0.0534525 0.116245 -0.0149003
+-0.00912597 0.168128 -0.0227626
+0.0103593 0.0509634 -0.0286117
+0.00839042 0.0434178 -0.024623
+0.012125 0.10869 -0.0190017
+-0.0749621 0.134014 -0.00721966
+-0.0789216 0.172194 -0.0440002
+-0.0258331 0.0561399 -0.0284181
+-0.0817922 0.143171 0.000171875
+0.0451306 0.0647669 -0.000900002
+-0.0514821 0.113924 -0.0164877
+0.00371763 0.0346901 0.0426483
+-0.0475701 0.0461114 -0.0100167
+0.0406981 0.104234 0.0181671
+-0.0453678 0.060156 0.0387657
+-0.0314314 0.0693522 -0.0254564
+-0.0154911 0.0702181 0.054969
+-0.0300755 0.123175 0.0220771
+-0.0216491 0.0479362 -0.0281524
+-0.0507589 0.144713 0.0133585
+-0.0670917 0.155954 0.0255845
+-0.0852375 0.1104 0.00532111
+-0.0573508 0.121267 0.0398601
+-0.0261065 0.0944666 -0.0262366
+-0.0897054 0.124293 0.0455762
+-0.000486036 0.047441 0.049521
+-0.0438029 0.167379 0.00334272
+0.0111963 0.0864748 -0.0310924
+0.0464517 0.0750534 0.00718936
+-0.036486 0.0619956 0.0409573
+-0.0314993 0.116609 0.0322344
+-0.0544997 0.117303 -0.0139925
+-0.0420673 0.0336103 0.00544111
+-0.0856626 0.0912736 -0.00055353
+-0.050495 0.0974075 0.0440057
+0.0309311 0.0355864 0.0055308
+0.0202177 0.109327 -0.0158556
+0.0249428 0.0968855 0.0450153
+-0.00751 0.070341 0.0568254
+-0.0604012 0.0335984 -0.00916237
+0.0245092 0.0406191 -0.00557292
+-0.0451779 0.152141 0.00822921
+-0.0607654 0.0668786 0.0346016
+-0.0593188 0.114075 -0.0145597
+-0.091214 0.143385 0.025163
+-0.0425978 0.0505652 -0.0109174
+-0.0423266 0.169779 -0.00887745
+-0.0224756 0.0348012 0.0476768
+0.0409735 0.0405135 0.0215425
+-0.0801239 0.110623 0.0438367
+-0.0138651 0.0987904 -0.0246748
+-0.043573 0.126043 -0.00725208
+-0.0208606 0.101617 -0.0238418
+-0.0425016 0.0605517 0.0404213
+-0.00249479 0.0590139 0.0541301
+0.0409984 0.102803 0.000176721
+0.0342014 0.0808856 0.0407312
+-0.0247835 0.166781 -0.00970724
+0.00931572 0.0725689 0.0556419
+-0.0642124 0.145356 0.038849
+-0.0716272 0.0748459 -0.0119866
+-0.012533 0.0458468 0.048979
+-0.0741728 0.15268 -0.0288898
+-0.0211868 0.174176 -0.0217698
+-0.054499 0.0761691 0.0426143
+-0.0851934 0.11068 0.0373035
+-0.00964195 0.120097 -0.0132573
+0.0149745 0.129329 0.00806984
+-0.0535552 0.0335918 0.0121227
+0.0387224 0.1084 0.018173
+-0.0858928 0.108988 0.00834067
+0.00426552 0.0697141 -0.0335935
+0.0304509 0.117992 0.000957505
+-0.0134723 0.0603845 0.0536243
+-0.0809665 0.133877 -0.00363658
+-0.0877284 0.0950339 0.0247524
+-0.0708769 0.155921 0.00969704
+-0.0388302 0.173903 -0.00342781
+0.0123125 0.0680946 -0.0309662
+-0.0540561 0.150161 -0.00256907
+-0.0662654 0.129803 0.0463681
+-0.0481341 0.0344887 0.0319692
+-0.0482356 0.137094 0.0133979
+-0.0638562 0.148524 -0.023921
+-0.0873971 0.140576 0.0399568
+-0.0920359 0.126943 0.0332532
+0.00766079 0.0616753 0.0549139
+-0.0820513 0.0882817 -0.00662822
+-0.0583711 0.0614813 0.0257087
+-0.046355 0.0345569 0.0357917
+0.0473411 0.0488863 -0.00367878
+0.0292435 0.0637114 -0.0199317
+-0.0250309 0.172718 -0.0117738
+0.0423872 0.0459654 -0.00393846
+-0.0484976 0.0805051 0.0439961
+-0.0497297 0.0737805 -0.0165746
+0.0463736 0.0682111 0.00160519
+-0.0334339 0.166782 -0.00461644
+-0.0772978 0.0685904 0.0138065
+-0.0645607 0.153661 0.00110457
+0.00849221 0.108496 0.0406568
+-0.0554287 0.1598 0.000101402
+-0.0412715 0.127285 -0.00254236
+-0.080968 0.0967089 0.0335048
+0.0225187 0.123964 0.0251042
+-0.0559057 0.0379831 0.047068
+-0.0594802 0.0716799 0.0395512
+-0.0618223 0.170491 -0.0617288
+-0.0564955 0.104323 0.0414899
+-0.0810442 0.152541 0.00426923
+-0.0435828 0.0345782 0.0398547
+0.0126008 0.128196 0.0257553
+-0.0526679 0.0579784 0.0235498
+0.0380115 0.110174 0.0108643
+0.0150842 0.114728 -0.0156323
+0.0148813 0.0348012 0.0286151
+-0.0479877 0.121051 0.028756
+-0.0883678 0.128089 0.00227451
+-0.0720422 0.15541 -0.0389078
+0.0112474 0.0724264 -0.0317987
+0.0267956 0.111385 0.0354031
+-0.0649586 0.160381 -0.0157887
+0.00550295 0.0702783 0.0558582
+-0.0238067 0.0899629 -0.0356649
+-0.090988 0.113988 0.0207121
+0.0194892 0.0934174 0.0476186
+-0.0655537 0.161293 -0.0160037
+-0.0625236 0.0609176 -2.19725e-05
+-0.0491589 0.162483 -0.00556124
+-0.042649 0.0378778 -0.0263104
+0.00374161 0.0952291 -0.0308324
+0.025598 0.0610493 -0.0236458
+0.00942462 0.0375116 -0.02327
+-0.00136682 0.125668 -0.00729488
+0.008486 0.0532759 0.0521458
+-0.00749086 0.0675042 0.0558082
+-0.092697 0.117351 0.0113077
+0.0251837 0.112665 -0.0114294
+-0.04997 0.140123 0.00440621
+-0.0534339 0.040168 0.0467985
+-0.0936376 0.124116 0.0132691
+-0.0222759 0.0382517 0.00526325
+0.0600635 0.0664445 0.00913698
+-0.0224559 0.092554 -0.0342812
+0.0582887 0.0538074 0.00917936
+0.046059 0.0834308 0.0121726
+-0.0619009 0.0678892 0.0352357
+-0.0566658 0.0473318 0.0108617
+-0.0457003 0.0694971 -0.0160523
+-0.0618544 0.174099 -0.0565963
+-0.0498016 0.128288 0.0314623
+-0.0225807 0.159177 -0.00302445
+-0.0623624 0.16436 -0.0595797
+0.0383958 0.0505315 -0.00659356
+-0.0332433 0.126938 0.0135159
+-0.0454819 0.0875316 0.0441596
+-0.0835389 0.110217 0.0023021
+0.0386074 0.0617702 0.0328492
+-0.0407686 0.0811968 -0.0203079
+-0.033827 0.0901076 -0.0243377
+0.0506567 0.0703381 0.00346635
+0.0228724 0.125195 0.0195238
+-0.0187529 0.0384803 -0.00337678
+0.0222732 0.12205 0.0293193
+-0.0294959 0.0645466 0.0380401
+-0.0689565 0.166538 -0.0215879
+-0.00506288 0.0387211 0.00101779
+-0.0647592 0.169439 -0.0415812
+0.00438439 0.037904 -0.00378653
+-0.0241621 0.125878 0.0168174
+0.0359934 0.0685324 -0.0147875
+-0.0182052 0.0381955 0.0170088
+-0.0753414 0.15612 0.015399
+0.0453867 0.0413474 0.00824507
+-0.00449218 0.123763 0.0343217
+0.0460213 0.0862262 0.00917159
+0.0346496 0.0972102 -0.0129196
+0.0196844 0.126554 0.00410284
+0.0202619 0.12651 0.00572713
+-0.00449958 0.0504123 0.0519892
+-0.0899789 0.133805 0.0362152
+0.00988218 0.0886651 0.0547874
+-0.00395268 0.131078 0.00966125
+0.00346471 0.0977538 0.051238
+-0.0236164 0.0422618 -0.0289626
+-0.0253603 0.124214 -0.00135534
+-0.00744498 0.124256 -0.00972454
+-0.0577765 0.0494102 0.000630355
+-0.0321623 0.172645 -0.015639
+-0.0661377 0.0669804 0.0316196
+-0.0240269 0.158277 -0.0107707
+-0.0762359 0.113613 0.0494664
+-0.0849952 0.141833 0.00418636
+-0.0569251 0.0366412 0.0466659
+-0.0283222 0.0749245 0.042497
+0.0216856 0.0878179 -0.0250022
+-0.0866951 0.0951098 0.0265657
+0.0296006 0.0982071 0.041203
+-0.0630317 0.060472 0.0203248
+-0.0304883 0.0574252 0.0370157
+-0.0638466 0.159519 -0.0168205
+-0.0544959 0.0848124 0.0452537
+0.0243406 0.113099 -0.011895
+-0.0900837 0.117534 0.0447346
+-0.00144097 0.0378708 0.018909
+-0.0699808 0.136988 -0.00795948
+-0.0823654 0.0815422 -0.00354068
+-0.00681555 0.0385421 0.0244437
+0.00431168 0.0611153 -0.0319161
+-0.0801269 0.10608 0.0309775
+0.0162329 0.0807169 -0.0293214
+-0.0158843 0.0377689 0.0515755
+-0.0829013 0.122118 -0.00412754
+0.0294673 0.106706 -0.01303
+-0.0534948 0.11254 0.0358256
+0.00150254 0.0605844 0.0560506
+-0.0234977 0.101642 0.0439992
+-0.0797566 0.074638 -0.000471413
+-0.00773143 0.0670178 -0.0355816
+-0.0705055 0.0342009 0.00809348
+0.0167377 0.0461846 0.0432665
+0.00646432 0.110948 0.0411124
+-0.0194753 0.160592 -0.0133076
+-0.00449865 0.115591 0.0404715
+0.0280707 0.046664 -0.00969251
+0.048051 0.0496945 0.0288529
+-0.0763852 0.114637 0.0504008
+-0.0886058 0.150235 0.0251076
+-0.0211531 0.0382979 0.0271326
+0.0408293 0.101363 -0.00180736
+-0.0203988 0.177179 -0.0155929
+-0.0718351 0.180364 -0.0513557
+0.00724322 0.0361893 0.0456372
+0.0124253 0.0374345 -0.0223624
+0.0378254 0.108706 0.0222481
+-0.0871672 0.127065 0.0471934
+-0.0686541 0.12565 0.0517171
+-0.0889642 0.136517 0.0281982
+-0.0304896 0.0559845 0.0366491
+-0.0839703 0.0843113 0.0284366
+-0.00895133 0.0384401 0.00779513
+-0.0942308 0.126903 0.0192529
+-0.0569855 0.0507747 0.00670607
+-0.063488 0.037094 -0.00797583
+0.0252887 0.122228 0.0247087
+-0.0433541 0.112279 -0.0167951
+-0.0255625 0.0532992 -0.0274025
+-0.00849647 0.0532799 0.0524507
+-0.0074932 0.0842694 0.0572981
+-0.0760467 0.0689134 0.00354542
+-0.0518697 0.144272 -0.000239851
+0.0302023 0.0808798 0.0437374
+-0.0276563 0.12199 -0.007026
+-0.0484978 0.100158 0.0428666
+-0.0654874 0.143443 -0.0120814
+-0.0308113 0.153953 -0.00248259
+0.0597604 0.0567164 0.0141707
+-0.0480122 0.0341726 0.0287503
+-0.0640462 0.0622661 0.0238361
+-0.0206969 0.0568414 -0.0326165
+0.0309722 0.116471 -0.00147933
+-0.0691516 0.0788347 0.0401452
+-0.058803 0.0883 -0.0207912
+0.00672447 0.0346721 0.0378883
+-0.0746893 0.154119 0.0302893
+-0.0529585 0.135327 0.0304274
+0.00863241 0.128438 -0.00238911
+-0.0478493 0.099947 -0.0217978
+-0.075086 0.0674684 0.00355063
+0.0326927 0.116394 0.0217802
+-0.0842229 0.144678 0.0395137
+-0.0166094 0.128602 0.0136868
+0.00411662 0.125005 -0.00865855
+-0.0754818 0.148362 0.0406222
+-0.065886 0.15405 -0.00011759
+-0.0425085 0.119367 0.0297171
+-0.0902093 0.131023 0.0402096
+0.0383601 0.0921445 -0.0115002
+-0.038495 0.0804525 0.0431634
+-0.0353039 0.0794833 -0.0226806
+0.0441637 0.0973591 0.0111613
+-0.0590115 0.153958 0.00054242
+0.0453728 0.0735622 0.00221503
+0.0569193 0.0710092 0.00714855
+-0.0114956 0.105842 0.0433599
+-0.0698279 0.181394 -0.0549266
+0.0375934 0.102015 0.0299178
+0.00590625 0.0356875 -0.00331654
+-0.0684622 0.16137 -0.0113077
+-0.0742229 0.109724 0.0423296
+-0.0202504 0.182971 -0.0220384
+-0.091455 0.148836 0.0171378
+0.0152238 0.0793568 -0.0300519
+-0.000512 0.107246 0.0433248
+-0.0428418 0.0971034 -0.0220359
+-0.0514947 0.0819216 0.0442721
+-0.00625132 0.0383797 0.0174726
+0.0252504 0.0789879 -0.0247523
+-0.0833347 0.0898073 0.030438
+-0.0509182 0.146274 0.0133981
+0.0202304 0.105998 0.0417108
+0.0571307 0.0508797 0.0151878
+-0.0330104 0.126012 0.0180287
+-0.0217816 0.0797281 0.0555871
+-0.00743438 0.120242 -0.0134406
+-0.0148225 0.086924 -0.0385597
+-0.0375897 0.174214 -0.00298303
+-0.00244861 0.0605864 0.0553645
+-0.00874133 0.128614 -0.000328304
+-0.00579055 0.0798611 -0.0376463
+-0.0096155 0.119132 -0.0142361
+0.000497149 0.0534577 0.0541163
+-0.0928025 0.131035 0.0222365
+0.0372258 0.108268 -0.000834485
+-0.0914674 0.129551 0.00825277
+-0.00149557 0.0675596 0.0566557
+0.0154848 0.0548588 0.0485877
+0.0396568 0.0815034 -0.0117853
+0.0174985 0.119533 0.0343583
+-0.0108678 0.0975625 -0.0293851
+0.0264007 0.116693 0.0313169
+0.005469 0.0964333 0.0520715
+-0.0455856 0.128182 -0.00140207
+-0.0175003 0.0499225 0.0470061
+-0.075934 0.0788992 0.0351468
+-0.0067913 0.0812637 -0.0377236
+-0.0769778 0.155918 0.0162848
+-0.0797877 0.0746142 -0.00147983
+-0.0599651 0.0469723 0.0336736
+0.0382386 0.084194 -0.0147697
+-0.0816947 0.113482 0.0465399
+0.00634478 0.0524665 -0.0299091
+-0.0112874 0.182441 -0.0284978
+-0.026226 0.178551 -0.0179991
+-0.0739945 0.1802 -0.0521965
+0.0105211 0.104445 0.0448284
+0.0580719 0.0523893 0.015182
+-0.0525108 0.0819776 0.0447141
+0.0148643 0.0961115 -0.0237665
+-0.00147854 0.0474532 0.049375
+0.00669444 0.0340637 0.00205518
+-0.0753884 0.151441 -0.0109145
+0.0413586 0.0394374 0.00625535
+-0.0196125 0.0381064 0.0149924
+-0.00986994 0.104508 -0.0232523
+-0.0720157 0.145244 -0.0182167
+0.0416371 0.0669849 0.0284796
+0.0284741 0.0381475 -0.00163189
+0.0474976 0.06778 0.0262203
+0.0259166 0.0434925 0.0371741
+0.0464333 0.0455453 -0.00066213
+-0.00640927 0.120163 -0.0133583
+-0.0236376 0.0387148 -0.0157231
+-0.092269 0.124069 0.00827163
+0.0144954 0.119572 0.0352389
+-0.0702988 0.15533 -0.0489684
+-0.0882036 0.143298 0.0111345
+-0.074863 0.0795889 -0.0115995
+-0.0174424 0.10313 -0.0232301
+-0.0686182 0.0628687 0.0026871
+-0.0620712 0.16624 -0.0525885
+0.058207 0.0538058 0.0191798
+-0.0333511 0.0463754 -0.0256604
+-0.0855025 0.0832965 0.0214753
+-0.0920057 0.11611 0.0343124
+-0.0227771 0.124071 -0.00329832
+-0.0610006 0.129721 0.0398956
+-0.0404973 0.0492165 0.0395965
+-0.0481836 0.0335793 0.00422402
+-0.0654948 0.160255 -0.0145439
+0.00736856 0.0479637 -0.0273222
+-0.0123571 0.12972 0.0137799
+0.0579783 0.0551346 0.00616127
+-0.0164763 0.064491 0.0530345
+-0.0608155 0.0896295 -0.0193008
+-0.0205289 0.0958269 0.048234
+-0.086716 0.132512 0.0465811
+-0.052836 0.095613 -0.0220115
+0.0406946 0.0647331 -0.00578164
+0.0121697 0.0950562 -0.0266386
+-0.00950093 0.0925586 0.0561384
+-0.0157375 0.0671877 -0.037968
+-0.0269293 0.0376983 0.0192799
+0.033595 0.0660055 0.039722
+-0.0481741 0.135565 0.0182752
+-0.0224128 0.163867 -0.00803238
+0.00810708 0.101446 -0.0211916
+-0.0458977 0.166944 -0.00688513
+-0.0238738 0.105835 -0.0226784
+0.0272653 0.121002 0.0240179
+-0.0701585 0.0623473 0.0172092
+0.0578867 0.0607943 0.0238444
+0.0565638 0.0695327 0.00435815
+0.012216 0.0753282 0.0545969
+-0.0583609 0.0339112 0.0215144
+-0.0664905 0.0861274 0.0441111
+-0.0514869 0.0987554 0.0433116
+0.0210708 0.0349944 0.0242708
+-0.0102986 0.126308 0.029096
+-0.0638201 0.089594 -0.0189434
+-0.0782747 0.174383 -0.0433933
+-0.0311143 0.16374 -0.0152454
+-0.0915885 0.128321 0.0362439
+-0.0379874 0.0336299 0.0062497
+-0.0854294 0.151325 0.0282936
+0.0124994 0.0909598 0.0531045
+-0.0434452 0.120253 -0.0131867
+0.0229768 0.0754886 0.0490742
+-0.0334786 0.100129 0.0429194
+-0.0741118 0.0819105 0.0384161
+0.0373216 0.0901862 0.036514
+-0.0565657 0.11693 0.0374284
+0.00334719 0.0481602 -0.0292882
+-0.0324526 0.0336078 -0.0239554
+0.0083446 0.116042 -0.0170347
+-0.00977658 0.0387467 -0.00366788
+-0.0206679 0.0509474 -0.0298149
+-0.0242736 0.181474 -0.0180054
+0.0160525 0.0350115 0.0395034
+-0.0543014 0.146215 0.0264084
+-0.00102573 0.0346607 0.0434939
+-0.0611888 0.155469 0.00589931
+-0.0406241 0.0520111 -0.0110025
+-0.0705109 0.148356 0.0407257
+0.0495286 0.0610841 0.0304744
+-0.019145 0.0893155 0.0554734
+0.00268229 0.12726 -0.0050686
+-0.0743228 0.155495 -0.0229079
+0.021268 0.0762952 -0.0266753
+-0.0239356 0.0374925 -0.0183912
+0.0262803 0.0660857 -0.0226574
+-0.0164998 0.0856439 0.0570811
+-0.0857415 0.120359 0.048887
+-0.0344903 0.0505305 0.0383369
+0.00230798 0.0346028 0.0406387
+-0.0929029 0.129672 0.0252445
+-0.0654938 0.0604629 0.00727621
+0.044722 0.0833037 0.0012072
+-0.0230106 0.0580182 0.0433839
+-0.0105663 0.0350401 0.0482738
+0.0582293 0.0690671 0.00613614
+-0.0600127 0.131125 -0.00733582
+-0.0321751 0.162395 -0.00280539
+-0.0555013 0.0623754 0.0293782
+-0.0252415 0.109687 -0.0201254
+-0.0560506 0.150155 -0.00188433
+-0.0600649 0.129705 0.039485
+0.0338293 0.0767952 -0.0167877
+0.01215 0.0919974 -0.0294248
+-0.0346452 0.0340944 0.0173387
+-0.050492 0.149246 0.012837
+-0.0550682 0.150156 -0.00218973
+-0.00881167 0.085499 -0.0379404
+-0.0780101 0.11134 -0.00369811
+-0.0795926 0.100727 0.0334268
+-0.0423449 0.122373 -0.0114097
+0.0248097 0.124191 0.0159771
+-0.0174692 0.0529782 0.0491698
+-0.0889728 0.101008 0.0133925
+0.00851959 0.0730626 0.056014
+-0.026729 0.159626 -0.000161004
+0.0222613 0.0720727 -0.026869
+0.0396492 0.0970274 -0.00677557
+-0.0301141 0.166809 -0.00684471
+-0.00834781 0.129635 0.0224773
+-0.0198097 0.0813191 -0.0390949
+-0.0489315 0.137078 0.0173942
+-0.0161123 0.0985355 -0.0244159
+0.0331161 0.0795687 -0.0187107
+-0.0365028 0.0761422 0.0420368
+-0.0315196 0.0834471 -0.0305496
+-0.0366299 0.0534085 -0.0105028
+-0.0844928 0.0979861 -0.00258986
+-0.049695 0.0693575 -0.0143663
+-0.0795053 0.148405 0.0389114
+-0.0143105 0.0338147 -0.022462
+-0.036834 0.0382539 -0.0105119
+-0.0528967 0.0476266 0.0236645
+-0.0431625 0.0436516 -0.0173214
+0.0442909 0.0959534 0.0041727
+-0.0499053 0.141681 0.0133989
+-0.084567 0.0897523 0.028848
+-0.035736 0.0740102 -0.0187661
+-0.0624191 0.163107 -0.0445959
+0.0553692 0.0711293 0.0213817
+-0.0384984 0.0634699 0.041507
+-0.0420929 0.156178 -0.00917116
+-0.0641565 0.166823 -0.0341745
+-0.0623968 0.162983 -0.056654
+0.0276466 0.0659543 0.0434322
+0.0454314 0.088986 0.0031764
+-0.0749519 0.164602 -0.018207
+-0.0345505 0.175605 -0.011982
+0.0363374 0.104678 0.0298648
+-0.00375231 0.128091 -0.0038931
+-0.0305006 0.100206 0.0434038
+-0.00849625 0.0547108 0.0528122
+-0.0485842 0.0517801 -0.00897412
+-0.00451507 0.0519264 0.0531932
+-0.0815948 0.0748474 0.0175368
+0.0572159 0.0648465 0.024658
+-0.0403921 0.162356 0.00287494
+-0.0749222 0.126715 -0.00818803
+-0.047238 0.0346371 0.0407654
+-0.0621416 0.141343 -0.00629843
+-0.0251564 0.113713 -0.0163747
+-0.00855727 0.119157 -0.0142712
+-0.074494 0.126019 0.0529923
+-0.0205102 0.0461853 0.0521703
+-0.084864 0.0789836 0.0191297
+-0.0187649 0.125661 -0.000995534
+-0.0218427 0.0567021 0.0450804
+-0.0622179 0.153696 -0.0295936
+-0.0364968 0.0576627 0.0395237
+-0.0368019 0.127806 0.00485952
+-0.0770975 0.0967852 0.0367
+-0.000433486 0.0366062 0.0184413
+0.0131024 0.123925 -0.00754958
+-0.0177683 0.0383192 0.0242073
+-0.0655356 0.0398001 0.0300899
+-0.0778591 0.161105 -0.0269202
+-0.0341012 0.162237 -0.0142117
+-0.017501 0.0842912 0.0575736
+-0.0280973 0.16079 -0.0140776
+-0.0421185 0.122004 0.0266511
+-0.0142563 0.178628 -0.0276625
+-0.0440063 0.0629698 0.0401358
+0.0128613 0.0347903 0.0336338
+-0.0248532 0.0348299 0.0453939
+-0.00152849 0.105863 0.0439958
+-0.0346038 0.123422 0.0248791
+-0.0346304 0.079471 -0.0235463
+-0.0639625 0.126764 -0.00871214
+0.0364026 0.0547846 -0.00674979
+-0.0064883 0.123768 0.0340789
+-0.0470974 0.168427 -0.00297818
+-0.0575443 0.0401418 -0.00909914
+0.0257874 0.0895854 -0.0228249
+0.0183006 0.0383341 -0.0177245
+-0.0524963 0.0848256 0.0453696
+0.0561175 0.0494119 0.0111925
+-0.0588172 0.123244 -0.00816875
+-0.00922198 0.0384881 0.0221926
+-0.0331235 0.126633 0.00621772
+-0.0119418 0.120727 -0.011899
+-0.0607049 0.145387 0.0368926
+-0.0306093 0.125854 0.0144859
+-0.0356146 0.127659 0.0111781
+-0.0776104 0.0802915 -0.00928059
+-0.0702074 0.0394853 -0.000301673
+0.0434891 0.0583702 0.0316051
+-0.0789513 0.128091 -0.00607242
+-0.042519 0.0534194 0.039352
+-0.00449744 0.0939058 0.0556112
+-0.0094927 0.0619497 0.0558121
+-0.0694824 0.0944579 0.0422945
+-0.0771177 0.0879695 -0.0126012
+0.014854 0.103191 -0.021265
+-0.043284 0.169832 -0.00794427
+-0.00983007 0.124748 -0.00821099
+0.048512 0.0692789 0.0025489
+-0.0620323 0.0343503 0.0308946
+-0.074493 0.145596 0.0437863
+-0.0375024 0.104216 0.0394845
+-0.047499 0.0451812 0.0421654
+-0.0836103 0.0769236 0.0176347
+-0.0636092 0.170093 -0.0469941
+-0.0483594 0.137097 0.0143972
+-0.087232 0.102325 0.0223672
+-0.035507 0.104243 0.0399833
+-0.0577119 0.0708497 -0.0156457
+-0.00436115 0.122059 -0.0113929
+0.0024069 0.037633 -0.0245625
+0.00251114 0.0911189 0.0554408
+-0.0357211 0.0710689 -0.0174927
+0.0183807 0.0432425 -0.0223469
+-0.0688327 0.09803 -0.0157395
+-0.0747491 0.155081 0.00248708
+0.0451476 0.0833704 0.0221542
+-0.0657925 0.14111 0.0417765
+-0.0365871 0.119162 -0.0120374
+0.0101976 0.131045 0.010577
+-0.0249388 0.183594 -0.0126758
+0.0330579 0.0598189 -0.0157593
+-0.0212823 0.0391811 0.0388836
+0.0144144 0.0403325 -0.0225056
+-0.0304932 0.104292 0.0413193
+0.0224755 0.0947811 0.0470955
+-0.0694247 0.0337382 0.00515427
+-0.00249301 0.118317 0.039019
+0.0288984 0.0924492 -0.0198656
+0.033052 0.0440867 0.029429
+-0.0616004 0.15843 -0.0275855
+-0.0438223 0.0615675 0.0400039
+-0.0452867 0.0410146 -0.0162976
+0.0314256 0.0991914 -0.015062
+-0.0524965 0.0833785 0.044899
+-0.0298946 0.0436977 0.0506861
+-0.076428 0.148619 -0.00986569
+-0.0761803 0.0914451 0.0387697
+-0.0730299 0.172199 -0.0345665
+-0.0274981 0.0960112 0.0443229
+0.0045023 0.13009 0.02428
+-0.0302254 0.162455 -0.00347789
+-0.0871035 0.11231 0.0319974
+0.00225053 0.0726262 -0.0348847
+-0.0748173 0.152727 -0.0208966
+-0.0354946 0.118017 0.0312708
+0.0436028 0.0973418 0.0171655
+-0.0754981 0.13448 0.0513067
+0.0513136 0.0574694 -0.00408483
+-0.0228193 0.0854366 -0.0379031
+-0.057217 0.0336859 0.0130711
+-0.0749012 0.110639 -0.0076926
+-0.00874782 0.125791 -0.00734235
+0.0343242 0.100732 -0.0126444
+-0.0155312 0.126827 -0.00025822
+0.0145856 0.0341976 0.00165401
+-0.0175043 0.114096 0.0387143
+0.0552517 0.0720728 0.0198735
+0.0406726 0.0731516 -0.00877611
+-0.0268119 0.082528 -0.0368734
+-0.0262156 0.0519422 -0.0264212
+-0.0464977 0.041126 -0.0122454
+-0.0711885 0.173044 -0.0381946
+0.0492058 0.0511603 0.0287949
+-0.00188013 0.105918 -0.0222309
+-0.046455 0.126722 0.0256927
+-0.0142526 0.181479 -0.0279552
+-0.0655009 0.0903733 0.0443899
+-0.0037337 0.131051 0.015481
+-0.0308026 0.0367564 0.0517774
+0.0277802 0.121908 0.0142262
+-0.0344815 0.0575696 0.0386716
+-0.0844149 0.0777754 0.0115138
+0.0294342 0.0383781 -0.00173395
+-0.0423644 0.120691 0.0280931
+-0.0350646 0.156323 -0.010574
+-0.0619093 0.0470515 0.00567882
+-0.00290933 0.0388493 0.0285794
+-0.059258 0.0467212 -0.00132733
+0.00450339 0.123789 0.033846
+-0.0229547 0.12614 0.0172488
+0.0410852 0.0394499 0.00526393
+0.0049695 0.0340349 0.00359293
+-0.0513689 0.0516822 0.0322144
+-0.0606335 0.122654 0.0421622
+-0.0645986 0.15064 0.0368964
+-0.0632078 0.143892 -0.00837073
+-0.0386435 0.0563025 -0.0111331
+-0.0658025 0.083802 -0.0186684
+-0.062835 0.128322 0.0425151
+-0.0715276 0.14003 0.0472238
+0.056383 0.0538774 0.0233551
+-0.0610939 0.0335153 0.00346695
+-0.00051118 0.0978394 0.0524335
+-0.0418663 0.0340021 -0.00580283
+-0.042485 0.0762268 0.0429934
+-0.0512844 0.138511 0.0223666
+0.0367682 0.0888721 0.037463
+0.00724928 0.0711363 -0.0334334
+-0.0505534 0.0543594 0.017626
+0.00614025 0.110185 -0.0202335
+-0.00850551 0.0561268 0.0532043
+-0.0295938 0.0789709 0.0427962
+-0.0287487 0.0349103 0.0496611
+-0.0584012 0.154047 0.0286827
+-0.0127037 0.064273 -0.0367671
+-0.0288624 0.0606727 -0.0254104
+-0.0376712 0.125956 0.0207679
+-0.0612726 0.0708854 0.0380779
+-0.0637251 0.155028 0.0282356
+0.0531328 0.0476715 0.00620176
+-0.00308571 0.124589 0.0331408
+-0.0186888 0.0352267 -0.0190015
+0.001497 0.119685 0.0377723
+-0.032734 0.120436 -0.00935257
+-0.054542 0.0631354 -0.00767633
+0.052054 0.0718585 0.0216053
+-0.00556188 0.116801 -0.0157696
+-0.0504949 0.138575 0.0203939
+-0.00542543 0.120041 -0.0132322
+0.0310541 0.0727142 0.0413756
+-0.0558801 0.045112 0.0236807
+-0.0167974 0.0382847 0.0190235
+0.0256741 0.0809122 0.047736
+-0.0199636 0.0668339 0.051351
+-0.0491191 0.159098 -0.00622225
+-0.0506725 0.0667938 0.036819
+-0.0492762 0.143079 0.00435473
+-0.0216794 0.0538141 -0.0303252
+0.0305352 0.10973 -0.0102674
+-0.0225945 0.157229 -0.0076361
+-0.0530851 0.151641 -0.00314317
+-0.0271151 0.122681 0.0231414
+-0.0134994 0.0884096 0.056966
+-0.0266886 0.0335519 -0.0246454
+-0.008499 0.12243 0.035017
+-0.0393069 0.033537 -0.0233717
+-0.033807 0.0461583 0.044586
+-0.0198183 0.158714 -0.00970491
+-0.0835554 0.0925405 0.0305699
+-0.0340008 0.0766042 -0.0254969
+0.00352334 0.12519 0.0325857
+-0.0424905 0.0424327 0.0427417
+0.0232877 0.123385 0.0253956
+0.0230237 0.100791 0.0439995
+0.0307365 0.117405 0.0253192
+-0.0772723 0.114862 0.0500033
+-0.0264336 0.0535943 0.0384453
+0.0177456 0.0350628 0.0325863
+-0.0121375 0.102128 -0.024127
+-0.000203909 0.130048 0.0239772
+0.00795806 0.127195 -0.00506697
+-0.0252695 0.156633 -0.00336931
+0.0179609 0.1201 -0.00942839
+-0.0769756 0.068555 0.0156381
+-0.0871021 0.111516 0.0397664
+-0.0544907 0.101557 0.0424048
+-0.0572843 0.0589766 -0.000464382
+-0.07902 0.0751794 0.0271309
+0.0102371 0.115602 -0.0165593
+-0.0105893 0.180273 -0.0272114
+-0.0528115 0.0913061 -0.0221889
+-0.064755 0.068231 0.0343382
+-0.0137258 0.125368 -0.00476898
+-0.0635922 0.178326 -0.0570781
+-0.0239683 0.126504 0.0139537
+-0.0600264 0.132579 -0.00719549
+0.044826 0.0791184 -0.000782084
+-0.00541885 0.0969111 -0.0306599
+-0.0301034 0.0537602 -0.0193727
+0.0409333 0.0900371 -0.0097907
+0.024446 0.115337 -0.010308
+-0.0283175 0.0963396 -0.0241496
+0.0299711 0.119398 0.020753
+-0.0265916 0.172718 -0.0105089
+-0.0586682 0.128313 0.0397417
+-0.0818638 0.147313 0.00119815
+-0.0254305 0.0357675 -0.0290845
+-0.038039 0.126372 -0.00365101
+-0.00149717 0.0815096 0.0574492
+-0.00738223 0.0931774 -0.0348179
+0.0558223 0.0493444 0.0161931
+0.0577347 0.0705061 0.0074689
+-0.0778727 0.096767 0.0360596
+0.0144985 0.11402 0.0378951
+0.00389123 0.0355229 -0.0148126
+0.0242948 0.124607 0.0114976
+0.0565412 0.0674698 0.002463
+-0.0308889 0.108768 -0.0191524
+0.011955 0.0349898 0.0332703
+-0.0129143 0.104805 -0.023047
+-0.0938592 0.11877 0.0212975
+0.0106595 0.0357626 0.0286983
+-0.0652684 0.163853 -0.0591668
+-0.0359879 0.0421738 0.0454409
+-0.0685089 0.100042 0.0409867
+0.03476 0.113033 0.0239837
+-0.0346506 0.126197 -0.000232823
+-0.0386758 0.0462873 -0.0214583
+0.0257808 0.10679 -0.0151172
+-0.0618601 0.153758 -0.0185818
+0.03067 0.0917687 -0.019137
+0.0275533 0.0672844 0.0433037
+-0.0414978 0.0748079 0.0427759
+-0.0218204 0.0840783 -0.0384285
+0.037815 0.0630498 -0.0108066
+-0.0602789 0.0617061 0.0251086
+-0.0768171 0.154199 -0.00689913
+0.00550054 0.0990386 0.0482677
+-0.0391759 0.16667 -0.0123913
+-0.0616525 0.116813 -0.0113459
+-0.0227683 0.0699063 -0.0373697
+-0.0825008 0.107588 0.0273509
+0.0253381 0.0418727 -0.00588506
+-0.014565 0.035318 -0.01827
+-0.00278761 0.0390101 -0.00997081
+-0.0895837 0.137934 0.0361877
+-0.0855599 0.112052 0.0307632
+-0.027858 0.0343176 -0.0296609
+-0.0325025 0.0675467 0.0400218
+0.0183334 0.0348857 0.00364336
+-0.0469365 0.0404762 -0.0121149
+-0.0777262 0.0825344 -0.0106004
+-0.00467074 0.0569349 -0.0330586
+-0.0194597 0.165415 -0.0107679
+-0.0210403 0.122456 -0.00761783
+-0.0388087 0.0446425 -0.0234233
+-0.0696543 0.0614896 0.0127042
+0.0440466 0.0931306 0.0221521
+-0.0647046 0.0352193 0.0243246
+-0.0166096 0.0435748 -0.0274243
+0.0441838 0.0712847 0.000450163
+-0.0285281 0.0522637 0.0377683
+-0.0599387 0.147394 -0.00221747
+-0.0440942 0.156163 -0.00853601
+0.0388076 0.0807597 0.0350812
+-0.0141543 0.161827 -0.01362
+-0.0210631 0.0385773 -0.00578617
+-0.0237266 0.161004 -0.00287357
+-0.0863431 0.0896619 0.0263909
+-0.0829431 0.0790271 0.0235207
+0.0268259 0.0605622 0.0439609
+-0.0224026 0.0384511 0.0303351
+-0.0635581 0.170962 -0.0485923
+-0.0456965 0.147701 -0.00292724
+-0.0532705 0.0373829 0.0469289
+0.0231843 0.0658868 0.0457612
+-0.0887459 0.132238 0.00325707
+0.00920248 0.0914355 -0.0308607
+-0.0298874 0.063588 -0.0244234
+0.00157852 0.12719 -0.00497022
+-0.0814436 0.153873 0.00890807
+-0.0624959 0.0607929 0.0219134
+-0.0680579 0.149988 0.0386907
+0.0166077 0.128469 0.0186355
+0.00550411 0.0731036 0.0564845
+-0.00249995 0.0661849 0.0567093
+-0.0735022 0.155469 -0.0279133
+-0.0851803 0.0899483 -0.00256663
+0.0394434 0.0585828 -0.00486619
+-0.0739433 0.134018 -0.00754124
+-0.038066 0.156257 -0.0102365
+0.00335185 0.118611 -0.0157819
+-0.00660848 0.0420213 -0.0257519
+-0.0639921 0.0605727 0.020032
+0.0252819 0.100786 -0.0187149
+-0.0820788 0.0765181 0.0218286
+-0.0167051 0.0584876 -0.0351851
+-0.023274 0.106158 -0.0224283
+-0.0878269 0.087472 0.021463
+-0.0786369 0.113551 0.047197
+0.0360644 0.0861926 0.0381664
+-0.082909 0.123594 -0.00426589
+-0.029497 0.177966 -0.015166
+-0.0170948 0.127006 0.022289
+0.0524062 0.0491022 0.00128138
+-0.0198015 0.10169 -0.0238258
+-0.0221328 0.166772 -0.0183109
+-0.00252234 0.038424 0.00547409
+-0.0255028 0.0606627 0.0401195
+-0.0385432 0.0337417 -0.0196892
+-0.0644389 0.0627719 0.0250864
+-0.0879688 0.113092 0.00628888
+0.000951329 0.10045 0.046938
+0.0386471 0.086118 0.0348681
+-0.0374734 0.0346441 0.0411075
+0.0233517 0.120203 -0.00555174
+0.0462175 0.0761811 0.0179689
+-0.0376403 0.0336717 0.00266115
+-0.0341867 0.172054 -0.0145892
+-0.0623617 0.0420762 0.0420515
+-0.0114712 0.0379322 -0.0163227
+-0.0177227 0.119786 -0.0108098
+-0.0801398 0.154387 0.00935749
+0.00187492 0.0398874 0.0463369
+-0.0730243 0.159629 -0.0349322
+0.0473276 0.0547587 -0.00564531
+-0.0376789 0.0636715 -0.0137557
+-0.0727421 0.180568 -0.051639
+-0.0616232 0.148175 -0.003118
+-0.0248231 0.0839948 -0.0375331
+-0.0652787 0.173897 -0.0604957
+-0.0740506 0.152673 -0.0298916
+-0.0571547 0.150227 -0.00146353
+-0.0903203 0.146073 0.0131505
+-0.0779569 0.132491 -0.00592536
+-0.0290048 0.0550494 -0.0223991
+-0.00849727 0.0898107 0.0570624
+-0.0324948 0.112838 -0.0174448
+-0.0523188 0.0518 0.026645
+0.0302802 0.0506319 0.0365295
+-0.0838507 0.103422 -0.00164978
+-0.0788492 0.100759 0.0340965
+-0.0874564 0.141909 0.0385732
+-0.0155155 0.115507 0.0382335
+-0.0777311 0.0887218 0.0375819
+-0.0730146 0.15545 -0.0319082
+-0.0523124 0.0360662 0.0464431
+-0.06188 0.164622 -0.0566003
+0.0367263 0.0794489 0.0373046
+-0.0734863 0.173577 -0.0500848
+0.00600107 0.0390612 0.028408
+-0.0278792 0.0339265 -0.0214795
+-0.000753868 0.0390895 -0.00403098
+-0.0578284 0.0450681 -0.00544742
+-0.0829344 0.129921 0.0513858
+-0.0111161 0.125335 -0.00680126
+-0.0679477 0.0860672 0.0434473
+-0.0705079 0.105505 0.0376955
+-0.0109443 0.0389825 -0.0115729
+-0.0399106 0.033865 0.000215963
+0.00351496 0.0924905 0.0549546
+-0.0424851 0.033913 -0.0262188
+-0.0792564 0.155246 0.0213567
+-0.0215304 0.127346 0.0119061
+-0.091259 0.117481 0.0430647
+-0.0404902 0.0790417 0.0431478
+-0.0945826 0.122834 0.0222802
+-0.0518346 0.0517811 0.0306554
+-0.0767129 0.161805 -0.0163426
+-0.0867595 0.107707 0.0143554
+-0.0693236 0.142228 -0.0102995
+-0.0204959 0.105781 0.0424626
+0.0438044 0.0987496 0.00916312
+-0.00281997 0.0854457 -0.0370162
+-0.00280088 0.0840687 -0.037315
+0.0293196 0.0632732 0.0423131
+0.00625559 0.0725849 -0.0341185
+0.0203077 0.0621778 -0.0269805
+0.0563556 0.0723446 0.0173318
+-0.0230123 0.107366 -0.0218426
+-0.00742046 0.035877 -0.0249268
+0.0374488 0.0402522 0.0247009
+0.0292061 0.055224 -0.0177993
+-0.0184858 0.127732 0.0173962
+-0.0921542 0.132321 0.0142287
+-0.0583136 0.145422 -0.00203607
+-0.0688478 0.0994593 -0.0152611
+-0.0615047 0.167821 -0.0555677
+-0.0915903 0.125424 0.00726612
+0.0199591 0.0564127 0.0480725
+0.0378679 0.0713179 0.0353865
+-0.000605671 0.129033 0.0267429
+0.0298673 0.0740916 0.0431977
+0.00443138 0.126024 0.0314422
+0.0239815 0.12134 -0.00278507
+-0.0246606 0.0521655 -0.0277657
+0.0146913 0.0820798 0.0529703
+0.0259518 0.075434 0.0462884
+-0.0332069 0.0609523 -0.0145937
+-0.0191994 0.0907344 -0.0364225
+0.0589179 0.0607855 0.00414854
+0.0361999 0.103252 -0.0093129
+-0.0498767 0.0529199 0.0166388
+-0.0681894 0.0774836 0.0397476
+-0.021626 0.038176 0.00908889
+-0.0723232 0.163826 -0.0419605
+0.0104934 0.109851 0.0397458
+-0.0177283 0.0627822 -0.0360863
+-0.0628376 0.161493 -0.0485893
+0.00323101 0.120377 -0.0136716
+0.0551973 0.0674594 0.0252672
+-0.0349319 0.127285 0.00554823
+0.0194228 0.125079 0.025397
+-0.00805064 0.130356 0.00959263
+-0.0314936 0.097435 0.044487
+-0.0557138 0.0342594 0.0288064
+0.0212843 0.0490624 0.0410711
+-0.0898642 0.114175 0.0316644
+-0.0868422 0.134936 0.00226938
+-0.0758819 0.156006 0.016671
+-0.00997005 0.175779 -0.0292074
+-0.0603522 0.0407823 0.0443369
+0.0416146 0.0598915 -0.00407392
+0.0165523 0.0922417 -0.0256623
+-0.0245975 0.0365494 -0.0290831
+-0.0381375 0.160902 0.00087141
+-0.0719085 0.064649 0.0201308
+0.0144227 0.0477589 -0.0252693
+0.0603421 0.0650847 0.0181826
+-0.0146479 0.0481463 -0.0303376
+0.00721829 0.131495 0.00948452
+0.0394741 0.102755 0.0261825
+-0.0127182 0.0685587 -0.0376659
+0.0338414 0.0392101 0.0249005
+-0.0639127 0.160548 -0.0182872
+-0.0885745 0.0901142 0.00646846
+-0.0497297 0.0416675 0.0451167
+-0.0695102 0.148387 0.0405048
+0.0369413 0.0618853 0.0357448
+-0.0614969 0.0987359 0.0427353
+0.0264406 0.0434552 0.0361928
+0.0457541 0.0497206 0.0308161
+-0.0184963 0.0486167 0.0482304
+-0.086692 0.140502 0.00718566
+-0.0116045 0.0420472 -0.0262702
+-0.0708693 0.149702 0.0392474
+-0.061676 0.0343224 0.032737
+-0.00749303 0.115552 0.0402888
+0.0603302 0.0678632 0.0121432
+-0.070517 0.146976 0.0420031
+0.0360463 0.0953891 -0.0118379
+0.0368862 0.0601656 -0.0107732
+0.0239184 0.116674 0.0330029
+-0.0804601 0.148683 0.000173633
+-0.0604926 0.0344653 0.0380756
+-0.0152525 0.177145 -0.0265204
+-0.0773226 0.108517 -0.00660544
+-0.0176381 0.0465514 -0.0286775
+0.0313677 0.11674 -0.000181085
+-0.0465999 0.111104 -0.0175509
+-0.0408947 0.172668 -0.00780492
+0.0241275 0.120631 -0.00401437
+-0.055903 0.111216 -0.0172629
+-0.0781607 0.0935055 -0.0115755
+0.0158369 0.105055 -0.0192576
+-0.0130717 0.0973914 -0.0292103
+0.00114663 0.103071 -0.022297
+-0.0545436 0.0443717 -0.00770843
+0.0381644 0.0887078 -0.0138852
+-0.0638458 0.0366675 0.0422565
+-0.0245954 0.122675 -0.00581505
+-0.0199502 0.0553853 0.0474489
+-0.0454976 0.13168 0.014882
+-0.0808086 0.113339 -0.00208766
+-0.0658194 0.154782 -0.0493821
+-0.0138747 0.104484 -0.023001
+-0.0293428 0.112771 -0.0173776
+0.0139014 0.0962996 -0.0239693
+-0.0834257 0.145967 0.00318768
+-0.0299391 0.175699 -0.00474628
+-0.00851553 0.0759427 0.057359
+-0.0679104 0.122376 -0.00896749
+-0.0104955 0.0731168 0.0565579
+-0.0480021 0.126873 0.0289133
+-0.052022 0.0561083 0.0186673
+-0.0627916 0.150662 -0.00757045
+-0.0667057 0.14638 -0.0236565
+-0.0714698 0.161004 -0.0429413
+-0.0459114 0.0657109 0.0391289
+-0.0127989 0.0827406 -0.0389623
+0.0240686 0.0436305 0.0398361
+0.00979486 0.0360464 0.02827
+-0.0144862 0.0715775 0.0549247
+-0.0798641 0.145899 -0.00181913
+-0.0607177 0.0335659 0.00529637
+-0.0635063 0.156747 -0.0406118
+-0.0171212 0.0383927 0.000728518
+0.02686 0.0646091 0.0440244
+0.0291243 0.117712 -0.00241857
+0.0411571 0.0846831 0.0314273
+0.0246298 0.0347052 0.0125163
+0.0376787 0.105425 -0.00281358
+-0.0520342 0.116871 0.0334143
+-0.0526315 0.0335173 0.00157493
+0.0103692 0.116852 -0.0159048
+-0.0299989 0.178534 -0.0140055
+0.0199608 0.126186 0.00277612
+-0.0226771 0.0567339 -0.0313199
+-0.0693087 0.165593 -0.0188405
+0.0435095 0.0527832 0.0325495
+-0.0292487 0.115981 -0.0147474
+0.0390778 0.105565 0.0241719
+-0.0449049 0.167415 0.00301648
+-0.0575339 0.0493779 -0.000368538
+-0.0396388 0.0548721 -0.0111311
+0.0314293 0.102107 0.036834
+0.000480507 0.104429 0.0436509
+-0.0299338 0.0468967 -0.0261593
+-0.0712424 0.155684 0.00373917
+0.0197271 0.0808668 0.051456
+-0.0761145 0.157637 -0.00836344
+-0.0144941 0.122325 0.033097
+-0.0597928 0.095429 -0.0195264
+0.0309421 0.0646254 0.0411415
+-0.0275054 0.104339 0.0416271
+-0.000516741 0.108636 0.04302
+-0.0777092 0.07194 0.024923
+0.0102045 0.0795083 -0.0323062
+-0.0379505 0.150881 -0.00456722
+-0.013105 0.0382607 0.0125563
+-0.0182317 0.187056 -0.0182936
+-0.0182699 0.166848 -0.0125771
+-0.0264587 0.0902029 -0.033595
+-0.0668807 0.112599 0.0436137
+-0.0537473 0.076818 -0.0192258
+-0.0306082 0.165302 -0.00581873
+-0.0796939 0.0873057 0.0353613
+0.0347714 0.100763 0.034674
+-0.035752 0.0415598 -0.0291214
+0.0289767 0.117846 0.0275093
+-0.000706682 0.0655468 -0.0343894
+-0.0610628 0.138403 -0.00654794
+-0.0625935 0.12412 0.0446596
+-0.0648295 0.14966 -0.0309451
+-0.0234815 0.0974495 0.044821
+-0.026575 0.0476865 -0.0258778
+-0.0528683 0.0367334 -0.0118941
+-0.0116753 0.0526919 -0.0331734
+-0.0615062 0.158429 -0.0265894
+0.0320656 0.117538 0.0186978
+-0.00988755 0.103466 -0.0236142
+0.0484958 0.0691068 0.025078
+0.0156548 0.128965 0.0154331
+-0.0665046 0.10698 0.0385746
+-0.0267998 0.0522633 0.0388472
+-0.058755 0.0782067 -0.0192512
+0.0211493 0.0672779 0.0481082
+-0.0288355 0.125617 0.00924976
+-0.0124826 0.0701993 0.05486
+0.0522007 0.0476683 0.00324556
+-0.0443004 0.130334 0.00946299
+-0.00241533 0.0389975 -0.0136337
+-0.0437474 0.0783133 -0.0194351
+-0.0629007 0.115475 0.040648
+-0.0311605 0.169689 -0.016551
+-0.0263193 0.0386673 0.0347214
+0.0366921 0.0807912 0.0372758
+-0.0395001 0.100068 0.0413695
+-0.0681116 0.112409 0.0451263
+0.0386091 0.0686148 0.0346703
+-0.0759482 0.152671 -0.0129066
+0.0145806 0.0953173 0.0493246
+-0.0385004 0.150676 0.00203305
+-0.0935499 0.129634 0.0192397
+-0.0619642 0.126755 -0.00826981
+-0.0537213 0.0709084 -0.0154466
+-0.0314688 0.175764 -0.00340966
+-0.046761 0.126023 -0.00719597
+0.0128678 0.128966 0.0229731
+-0.0721444 0.145534 -0.0189034
+-0.014649 0.0384586 0.0247211
+-0.0782079 0.165287 -0.027954
+-0.0738874 0.0695898 0.0277412
+-0.0880483 0.145895 0.0319999
+-0.00950131 0.0870429 0.0572309
+-0.082872 0.154403 0.0201091
+-0.0574419 0.0424556 0.0216968
+0.0432211 0.097315 0.0201647
+0.0484167 0.0567471 0.0312254
+-0.0899902 0.146067 0.012148
+-0.0384869 0.0860997 0.0437907
+-0.0677801 0.0837503 -0.017964
+-0.0304968 0.071744 0.0399232
+-0.0267649 0.0754486 -0.0363172
+0.0555795 0.068697 0.0240751
+-0.00326172 0.0994383 0.0499516
+-0.0539364 0.153495 0.0157968
+-0.0264808 0.0509031 0.0429156
+0.0477223 0.0435274 0.0201079
+-0.027646 0.071755 0.0409574
+-0.025483 0.0988427 0.0444451
+0.00433576 0.055339 -0.0305463
+-0.0809392 0.0721012 0.0145438
+-0.0859359 0.0980836 0.000413824
+-0.0660122 0.153896 -0.0475582
+-0.0275574 0.156658 -0.00139783
+-0.0134137 0.0581871 0.0521911
+-0.0774938 0.134462 0.0515018
+0.0104958 0.0560929 0.0526786
+-0.00951583 0.0848597 -0.0382215
+-0.0298676 0.0916468 -0.0252289
+-0.0751451 0.15577 0.0110973
+-0.0887521 0.0969152 0.00742291
+-0.00642846 0.119149 -0.0142793
+-0.0351305 0.127632 0.00987733
+-0.079479 0.1087 0.0330138
+-0.00387451 0.0384228 0.00884205
+-0.0794858 0.0940336 0.0349322
+-0.0809833 0.080323 0.0311985
+-0.0874477 0.148578 0.0299355
+0.015852 0.106086 -0.0183494
+-0.0799154 0.12806 -0.00573177
+-0.0810332 0.092317 -0.00857663
+-0.0428426 0.0956907 -0.0224311
+-0.0843197 0.0830919 -0.00150258
+0.0270369 0.0347621 0.0147774
+-0.0114905 0.108632 0.0428314
+-0.0298836 0.04486 -0.0282273
+-0.0675863 0.0915604 0.0429945
+-0.0858462 0.0806083 0.01849
+-0.0377888 0.0855996 -0.0220857
+-0.080296 0.0886098 0.0345053
+-0.0631283 0.163827 -0.0595262
+-0.0200798 0.0653829 0.0501099
+0.0101376 0.104418 -0.0202461
+0.00311717 0.113125 -0.0199945
+0.00740202 0.0404296 -0.0235788
+-0.0233436 0.179984 -0.0199453
+-0.0849416 0.153745 0.0179582
+-0.00950506 0.0660833 0.0554985
+-0.0149561 0.0997734 -0.0237179
+-0.0625045 0.160053 -0.0215634
+0.0134925 0.114016 0.0379994
+-0.0484084 0.144974 0.000471547
+-0.0765927 0.0770726 0.0330453
+-0.0522524 0.0566167 0.0245415
+-0.0446531 0.0607308 -0.0127894
+-0.077361 0.0729429 -0.00456158
+-0.0164852 0.0870004 0.0567616
+0.00917846 0.101539 -0.0214106
+-0.0114976 0.0883765 0.0564607
+-0.0365032 0.109752 0.0369592
+-0.0622101 0.169551 -0.0614764
+0.0134275 0.117615 -0.0147491
+-0.0194201 0.1246 -0.00382324
+0.000402662 0.121936 0.0359399
+0.0308218 0.101142 -0.0151148
+0.044544 0.0748845 0.0238506
+-0.0190349 0.0930706 -0.0347914
+-0.0284257 0.15795 -0.0115973
+-0.0835152 0.150011 0.0330149
+-0.0723608 0.0363259 0.00395733
+0.049239 0.0437392 0.0164633
+-0.0281399 0.0917982 -0.0286003
+-0.0894337 0.132252 0.00424863
+-0.0478863 0.033513 -0.0102384
+-0.0480003 0.126688 -0.00585567
+-0.0147076 0.0933085 -0.0349989
+-0.0344513 0.172765 -0.000813008
+-0.012881 0.107288 -0.0218461
+-0.0494996 0.111168 0.0370596
+0.0195435 0.100771 0.0459866
+0.0383256 0.0387198 0.0189634
+-0.0490718 0.151664 -0.00461846
+-0.0413062 0.123313 -0.010402
+-0.0764561 0.106685 0.0353026
+-0.0506178 0.0590261 -0.0100428
+-0.0085531 0.0385596 0.00412906
+-0.0510743 0.153146 -0.0044532
+-0.0168415 0.122494 -0.0076608
+-0.0724396 0.129821 0.051541
+-0.0447123 0.0336927 -0.0153017
+-0.0128672 0.038589 0.0285719
+-0.0769694 0.136896 -0.00565009
+-0.0204809 0.0526524 0.0459576
+-0.0190093 0.100114 -0.02409
+0.0491876 0.0602673 -0.00438234
+2.68966e-05 0.0991578 -0.0250032
+-0.0146066 0.0355634 0.0504427
+0.0437747 0.084485 0.0264379
+-0.0613665 0.0430534 -0.00574325
+0.0102029 0.0779579 0.0551886
+-0.0584973 0.109766 0.0377913
+0.0405117 0.0657145 0.0303349
+0.0123622 0.0523525 -0.0283928
+-0.0865442 0.107736 0.017365
+-0.0273471 0.0735222 0.0429845
+-0.076628 0.169808 -0.0316679
+-0.00310182 0.130332 0.00278812
+0.0456485 0.0904179 0.0101632
+0.0367704 0.109675 0.000243105
+-0.0088954 0.108786 -0.0222808
+-0.0722528 0.156819 -0.0369077
+-0.0343294 0.175491 -0.0032043
+-0.0612579 0.167808 -0.0576007
+-0.0225051 0.10854 0.0408657
+-0.0396128 0.0492137 -0.0115104
+-0.0528856 0.104156 -0.0198053
+-0.0114785 0.0965129 0.0526113
+-0.0493499 0.141685 0.00939558
+-0.053326 0.162717 0.00204741
+0.0382413 0.108427 0.0210592
+0.0250594 0.122946 0.0231962
+0.0436593 0.058746 -0.00488132
+-0.052188 0.0559056 0.0136207
+-0.0337241 0.163848 -0.00328844
+-0.0671575 0.17049 -0.0366968
+-0.0780353 0.0880327 -0.0115615
+-0.00752216 0.122122 -0.0114318
+-0.0578223 0.12834 0.0392194
+-0.0624397 0.16285 -0.0548313
+-0.00720215 0.0344571 -0.0178933
+0.0219696 0.0347867 0.0191885
+0.0134971 0.112635 0.0387508
+-0.0188778 0.168283 -0.0134663
+0.0418633 0.0718502 -0.00680416
+0.00188261 0.129936 0.0247306
+-0.0143909 0.0388658 -0.0140202
+-0.0866821 0.0819953 0.0154888
+0.0511122 0.059915 -0.00400422
+-0.0637796 0.0419038 0.0392448
+-0.0334673 0.0532523 0.0375728
+-0.0640539 0.142491 0.0390245
+-0.0197273 0.118003 -0.0129221
+-0.0739294 0.0686501 -0.000515794
+0.022253 0.0430673 -0.0137151
+0.0169102 0.120624 0.0334304
+-0.0533452 0.118341 0.0350731
+-0.0407313 0.0710722 -0.0172567
+-0.0444934 0.108473 0.0392485
+-0.0406946 0.0340162 0.0268873
+-0.0428689 0.104235 -0.0209095
+0.000289503 0.0391337 -0.00386275
+0.0202669 0.0819781 -0.0271085
+0.0339966 0.0363512 0.0147468
+-0.0623699 0.0366895 0.0436353
+0.0112859 0.0638878 -0.0308862
+0.044262 0.0945325 0.00218274
+0.0178069 0.0349979 -0.00592782
+0.00766772 0.130773 0.00395877
+-0.0518373 0.0337424 -0.0112411
+0.05138 0.0464792 0.0212617
+-0.054495 0.0932121 0.0445367
+0.0154864 0.0380581 -0.0207587
+0.0322412 0.0368006 0.00286913
+0.0226382 0.0714084 0.0485432
+-0.0474967 0.0761987 0.0428659
+-0.0433556 0.0337438 -0.00770024
+-0.0507933 0.0869468 -0.0215939
+-0.0428743 0.166323 -0.00997516
+0.0420989 0.0930078 0.0271705
+-0.0133438 0.11201 -0.0186315
+-0.0682581 0.156305 0.0164417
+-0.0709159 0.125294 -0.00875352
+-0.0758095 0.0920857 -0.0139153
+0.00691185 0.038861 0.0287775
+-0.0755745 0.0702081 -0.000465226
+0.0560342 0.0622175 0.0264602
+0.00750328 0.0532576 0.0522142
+-0.0557017 0.0693735 -0.0143448
+-0.0400399 0.0367774 -0.0284153
+0.0452718 0.0917995 0.0131601
+0.0113635 0.0534706 0.0514016
+-0.056641 0.0429978 -0.00777539
+-0.0163006 0.182966 -0.0260091
+-0.0724038 0.116078 0.0519992
+-0.0223961 0.161302 -0.0143028
+-0.016322 0.128515 0.00945034
+-0.0761998 0.14998 -0.0148766
+-0.084898 0.11701 -0.000772283
+0.0215009 0.111167 0.037529
+-0.0116746 0.164119 -0.0176003
+-0.0386977 0.0666031 -0.0147476
+-0.0475127 0.0411749 0.0444313
+-0.0741496 0.147181 -0.0158602
+0.0423699 0.0412112 0.0211935
+-0.0112343 0.126014 -0.00554296
+-0.0627796 0.16313 -0.0285907
+0.0598501 0.0664357 0.0191799
+0.0444747 0.0438727 0.000520461
+-0.0449903 0.16693 -0.00785376
+-0.0241862 0.125789 0.00366503
+0.0303543 0.0942493 0.0422823
+0.0385368 0.0800568 -0.0127167
+-0.0329258 0.120263 0.0285346
+-0.0277494 0.0764615 0.044728
+0.0072822 0.0344718 -0.00192729
+0.0164745 0.103092 0.0456772
+-0.000370674 0.0391495 0.0306363
+-0.0444932 0.109842 0.0382343
+-0.0228558 0.113062 -0.0177116
+-0.0323055 0.0384897 -0.00796454
+0.0330143 0.106332 -0.0106209
+-0.0905664 0.150208 0.0151282
+-0.0473203 0.122487 0.0279328
+-0.079976 0.076532 0.0275303
+-0.0185178 0.0383092 0.00415679
+-0.0400541 0.128036 0.0139949
+-0.0725037 0.079155 0.0383043
+-0.00705924 0.127865 -0.00358478
+-0.0474808 0.0518309 0.037336
+0.0281857 0.0888902 0.0443935
+-0.0325014 0.102916 0.0416129
+-0.0636379 0.131123 0.0413473
+-0.0194422 0.0952996 -0.0310527
+0.0343622 0.0673468 0.0390872
+0.00248248 0.0385592 0.0461627
+-0.0207428 0.0656176 -0.0364653
+-0.0354216 0.17545 -0.00362892
+-0.0186888 0.127303 0.00423263
+-0.0697675 0.129835 0.0501143
+-0.0645483 0.168715 -0.0400434
+0.0176026 0.0520233 0.0463575
+-0.0165066 0.11684 0.0369313
+-0.0539292 0.0475998 -0.00643542
+0.0206619 0.125677 0.022985
+0.0131 0.034428 -0.00821794
+-0.0884031 0.101017 0.0203758
+-0.089294 0.136502 0.0252035
+-0.0633961 0.0610267 0.0215327
+-0.0181382 0.0625693 0.0510808
+-0.0363013 0.0408102 0.0457892
+-0.0348891 0.0341588 0.0262022
+0.0321818 0.0994934 0.0379171
+-0.0650996 0.115729 0.046366
+-0.0446047 0.0505366 -0.0105481
+-0.0170833 0.0896859 -0.0373218
+-0.0135156 0.162506 -0.0153049
+-0.0264962 0.119343 0.030427
+0.053783 0.0561466 -0.00178141
+-0.0659739 0.131145 -0.00872206
+-0.022585 0.185119 -0.0131839
+-0.0902473 0.132271 0.00623314
+-0.0343818 0.038354 -0.0138166
+-0.087117 0.119846 -0.000719646
+-0.0514997 0.047729 0.0396118
+-0.0837154 0.0804764 0.0234959
+0.0452487 0.0681916 0.00167659
+0.0443433 0.0762807 -0.00178421
+0.0393871 0.0828883 -0.0127786
+0.0133395 0.0475307 0.0453837
+0.0393635 0.0445531 -0.00413158
+0.0464068 0.0778555 0.00918735
+0.0498828 0.0474685 0.000307011
+-0.0205115 0.114066 0.0379617
+-0.0795322 0.0826724 -0.00859002
+0.0277802 0.0692504 -0.0226951
+-0.0640511 0.139618 0.0390194
+-0.0622733 0.144309 -0.00616114
+-0.0598164 0.122657 0.0415831
+-0.039222 0.0363262 0.0107899
+-0.0476756 0.0694312 -0.0151035
+-0.0114975 0.12239 0.0342495
+-0.0759886 0.0701373 0.025079
+0.0247695 0.1047 0.0394768
+-0.0424955 0.0464529 0.0406301
+-0.0209812 0.0389557 0.0535988
+-0.0434801 0.0917165 0.0428888
+-0.0936604 0.128255 0.0172452
+-0.0319662 0.163855 -0.00423083
+-0.0864626 0.107749 0.0163884
+0.00261599 0.0960798 -0.0297441
+0.0192696 0.124452 -0.00213625
+-0.0635019 0.0945759 0.0438874
+-0.0434804 0.108484 0.0391565
+-0.0767016 0.15969 -0.0259195
+-0.0207953 0.0784993 -0.0390618
+-0.0168597 0.0382017 0.0136589
+-0.0128908 0.129601 0.0150315
+-0.063562 0.136724 0.0379539
+-0.0592557 0.146819 0.0355066
+-0.0102821 0.0421361 0.0498123
+0.00411674 0.108725 -0.0201726
+-0.0471696 0.16597 0.00363215
+-0.0324882 0.0560654 0.0375153
+0.016314 0.061771 0.0498607
+-0.0633808 0.154539 0.0298218
+0.0319993 0.108737 0.0323781
+0.0224822 0.0578106 0.0464363
+-0.0731478 0.0644323 0.00940567
+-0.0136846 0.0555659 -0.0339274
+-0.0485565 0.0335372 0.00238031
+-0.0485794 0.128753 -0.00187037
+-0.0761205 0.0927947 0.038671
+-0.00890397 0.114438 -0.0172305
+-0.0881957 0.146062 0.0092207
+-0.067835 0.0951999 -0.016639
+-0.0826594 0.0993103 0.0308836
+0.0194806 0.107063 0.040905
+-0.0755472 0.15139 -0.00989046
+-0.0619095 0.118087 -0.0102757
+-0.0770237 0.0716688 -0.00146855
+-0.0090472 0.129209 0.0236827
+0.0166896 0.0645037 0.050425
+-0.044493 0.0860963 0.0437549
+-0.0851043 0.10321 0.0261425
+-0.0929793 0.125561 0.0282631
+-0.0792446 0.0699823 0.0139682
+-0.0541984 0.150844 0.02639
+-0.0544369 0.147753 0.0264091
+0.029273 0.103313 -0.0154093
+-0.0661878 0.156038 -0.00610123
+0.0513324 0.0613858 -0.00348738
+-0.00765334 0.0905691 -0.0361471
+-0.0036313 0.046681 -0.0294588
+-0.0793953 0.154018 0.0066962
+0.0126509 0.103032 -0.0211055
+-0.0534982 0.0344579 0.0343548
+0.0254331 0.0400654 -0.00462996
+-0.0474929 0.163748 0.00542805
+-0.0174765 0.0514437 0.047967
+-0.023601 0.0379574 -0.0288347
+0.0380126 0.0687088 -0.0127776
+0.0454875 0.0624627 0.0298224
+-0.0929393 0.122846 0.0403052
+-0.0619477 0.0629617 0.0272004
+-0.0632548 0.171035 -0.0614506
+-0.062927 0.150005 -0.0233391
+-0.0539078 0.109837 -0.0181931
+-0.0143481 0.129147 0.0116153
+-0.00460956 0.130321 0.00366937
+0.00735598 0.0509889 -0.0291303
+-0.0480744 0.151666 -0.00489643
+-0.0220459 0.166878 -0.0109827
+-0.0178225 0.0869056 -0.0385387
+0.000268234 0.0669357 -0.034172
+-0.0454819 0.0861255 0.0441555
+-0.0606958 0.0340151 0.0191666
+0.0293305 0.049536 -0.0137505
+-0.0661283 0.153073 -0.0457545
+0.0127964 0.0685744 0.0536204
+-0.0806268 0.150792 0.0343829
+0.0338754 0.0626989 -0.015804
+-0.0415032 0.116675 0.0325492
+-0.00995367 0.16681 -0.0217203
+0.059153 0.0704954 0.0131546
+-0.084323 0.0804069 0.00350409
+-0.0217865 0.0742531 -0.0388026
+0.0333307 0.040756 0.0270424
+-0.00920453 0.175559 -0.0287981
+-0.0565093 0.148178 0.0306333
+-0.0476849 0.146264 0.00805502
+-0.0896679 0.144435 0.0294634
+0.028326 0.0882981 -0.0214817
+-0.0129215 0.129318 0.0179306
+-0.0275354 0.0822426 0.0485604
+-0.0727818 0.154043 -0.034905
+0.0264706 0.0430524 -0.00597567
+-0.0461097 0.129234 0.00159921
+0.00227538 0.0668963 -0.0335609
+-0.0869081 0.0847086 0.0134765
+-0.071509 0.105494 0.0375699
+-0.0564975 0.105681 0.0408231
+-0.0709683 0.136976 -0.00769814
+-0.0238604 0.0347884 0.0456435
+-0.0248096 0.123255 -0.00440954
+-0.0504992 0.0917781 0.0442368
+-0.0672114 0.120049 0.0520179
+-0.067142 0.163768 -0.057034
+-0.0628433 0.16149 -0.0495873
+-0.0851762 0.106326 0.0223754
+0.0111461 0.101633 -0.021979
+0.0319374 0.0568888 -0.0147656
+0.0282794 0.120663 0.00443205
+-0.0912918 0.116401 0.0420373
+-0.00467238 0.0555139 -0.0327809
+-0.0267099 0.0794912 0.0492298
+-0.0226371 0.0622591 0.0442913
+0.0496058 0.0730794 0.0103455
+0.0134712 0.0347114 0.0266012
+-0.027103 0.0633188 -0.0304321
+-0.00446177 0.12682 -0.00651375
+-0.0184963 0.10441 0.0431068
+0.0322846 0.110983 -0.00760517
+0.043549 0.0987325 0.00516762
+-0.0442869 0.166804 -0.00853834
+0.0150912 0.0940152 0.0500689
+-0.07081 0.110507 0.0424798
+-0.0141183 0.115602 -0.0164489
+-0.0567507 0.13816 0.0319811
+-0.0047515 0.0726952 -0.0359954
+-0.0647331 0.0606321 0.00547671
+0.0292295 0.102131 0.038919
+-0.0328692 0.104316 -0.0215625
+-0.0105189 0.165484 -0.0170149
+-0.062488 0.161561 -0.0255895
+-0.083006 0.110313 0.0398706
+0.00202549 0.0390793 -0.0109499
+0.0598509 0.0692231 0.0121425
+-0.0486599 0.0649886 -0.0131055
+0.0193632 0.0475344 -0.0219845
+-0.0505005 0.109789 0.0379415
+0.0227584 0.0942129 0.0471436
+-0.054587 0.123231 -0.00812744
+0.0595925 0.0636093 0.00613697
+-0.0304354 0.159526 0.00145329
+-0.0771836 0.152278 0.0340017
+-0.0641378 0.146153 -0.0169913
+-0.012496 0.0828987 0.0575341
+-0.062259 0.0636125 0.0283336
+-0.0543842 0.064934 0.034129
+-0.0580097 0.136726 0.0336791
+0.0431148 0.0723568 0.0271232
+-0.0719688 0.147362 0.0419058
+0.0324265 0.0414912 -0.00365574
+-0.0504972 0.083371 0.044762
+-0.0277551 0.121254 0.0258902
+0.0248126 0.0672364 0.0446067
+-0.0748658 0.148574 -0.0178655
+0.0199833 0.0422265 0.0426566
+0.00936651 0.0494737 -0.0282538
+-0.0209427 0.127053 0.0165011
+0.014824 0.0950266 -0.0246047
+0.0416966 0.0899224 0.0287651
+-0.0417723 0.0826397 -0.0208385
+-0.0228105 0.123961 0.023212
+-0.0701997 0.155611 0.00411308
+-0.0246949 0.0550734 -0.0288078
+-0.0220519 0.163768 -0.0162501
+-0.0324478 0.069454 -0.0224572
+-0.0827552 0.07629 0.0125227
+-0.0606527 0.151084 0.0352378
+-0.0798891 0.0706304 0.0135503
+0.0476495 0.073201 0.00955169
+-0.00859398 0.0391639 -0.0259828
+0.0142802 0.0873929 0.0523851
+-0.00841973 0.128157 0.0268439
+-0.0665531 0.160013 -0.0120422
+-0.029443 0.0834063 0.0447309
+-0.0564979 0.0776594 0.043476
+-0.0483279 0.119696 0.0300033
+0.0232683 0.0857035 -0.0248261
+0.0321971 0.112814 -0.0055615
+0.0190831 0.0713469 0.0504539
+-0.054494 0.0465534 0.0422647
+-0.0121699 0.165481 -0.0142428
+0.000511137 0.0814953 0.0573473
+-0.0115028 0.0730832 0.0562182
+-0.0401042 0.037954 0.0427598
+-0.0114161 0.0382303 0.016554
+0.0328182 0.0967204 -0.0144274
+-0.00449908 0.0732747 0.0586205
+0.00733671 0.115147 -0.0180672
+-0.0476206 0.111206 -0.0176722
+-0.0624082 0.147544 -0.00957064
+-0.0615795 0.156866 -0.0245858
+0.0175138 0.12671 0.0232635
+-0.0697118 0.0764164 -0.0147262
+-0.0543713 0.158326 -0.00178875
+0.00713327 0.105885 -0.0207766
+-0.033517 0.115303 0.0329858
+-0.0114926 0.0897634 0.0564161
+-0.0375058 0.171208 0.000818011
+0.00542741 0.0336773 0.0131964
+0.0379386 0.07401 0.0354837
+-0.0860277 0.0967286 0.000430639
+-0.0311614 0.0791685 -0.0325602
+-0.0541101 0.0531993 -0.0053725
+-0.0592659 0.0599215 0.0215991
+0.0586637 0.0709935 0.0122726
+-0.0792595 0.0894709 -0.0095871
+-0.026159 0.0918036 0.0468933
+-0.0249745 0.12528 0.0180213
+-0.0519836 0.0517496 0.0236325
+-0.0275449 0.178709 -0.00674077
+-0.0715237 0.165101 -0.0167379
+0.0256965 0.123446 0.00917645
+0.0235224 0.0727618 0.0480692
+-0.0144773 0.0603048 0.0528052
+0.0408807 0.0948081 -0.00628698
+-0.0515819 0.0344024 0.0295565
+0.0311435 0.0885162 -0.0196004
+-0.087234 0.0981695 0.00341761
+-0.0165631 0.165424 -0.0118502
+-0.0497796 0.0518319 0.0348836
+0.0296893 0.110128 -0.0107004
+-0.0212542 0.126244 0.0193308
+-0.0315215 0.0732244 0.0404306
+0.0265706 0.0535806 -0.0207269
+-0.0944184 0.12146 0.0172829
+-0.0780287 0.14129 -0.00491664
+-0.0653187 0.152492 0.0351215
+0.0369332 0.102635 -0.00864905
+-0.0100919 0.126182 -0.00573829
+-0.0589643 0.15508 0.0013052
+-0.00782857 0.0386419 0.00238313
+-0.0893654 0.145802 0.0291185
+-0.077209 0.110378 0.0446936
+-0.0127752 0.0770687 -0.0383028
+-0.060466 0.143311 -0.00379205
+-0.0907002 0.137837 0.017198
+-0.0553853 0.15628 0.0108911
+-0.0609254 0.0454597 -0.00231147
+0.041351 0.0574751 -0.0052144
+-0.0111235 0.0346639 0.0467191
+-0.0520649 0.148658 -0.00262972
+-0.0438434 0.0985095 -0.0215595
+-0.0678163 0.0866062 -0.0177767
+0.0287562 0.053781 -0.0187512
+0.0338991 0.057119 -0.0127141
+-0.0189243 0.181629 -0.0169471
+-0.0888863 0.113493 0.0234001
+-0.0456524 0.0621788 -0.0131898
+-0.0205797 0.0906821 0.0540574
+-0.0285047 0.059221 -0.0254142
+-0.0310985 0.154152 -0.00673494
+0.0362687 0.0941823 0.0368117
+0.0223945 0.0860763 -0.025219
+0.0228611 0.0741302 0.0488936
+-0.0274872 0.094655 0.0450969
+-0.0238248 0.0826344 -0.0380614
+-0.044527 0.0601701 0.0393419
+0.0160126 0.0658829 0.0512178
+-0.0663487 0.06206 0.00207137
+0.000401309 0.0390966 -0.0249339
+-0.027107 0.082291 0.0495314
+-0.0617626 0.0415173 0.0247032
+-0.093011 0.118839 0.0352993
+-0.0662787 0.168684 -0.0320741
+-0.000498287 0.0535066 0.0547347
+0.0431795 0.0737197 0.0272167
+-0.0565118 0.0454033 -0.00602573
+-0.0668006 0.086643 -0.0182518
+-0.0652487 0.163342 -0.0202167
+0.0392901 0.0766734 0.0339466
+-0.0619246 0.106845 -0.0166571
+-0.0611633 0.0334354 -0.00188959
+-0.0722746 0.15542 -0.0369062
+-0.0690618 0.110676 0.0409548
+0.0432493 0.100107 0.00716752
+0.0317499 0.0535218 0.0369319
+-0.0492036 0.131059 0.0288275
+-0.0693592 0.176521 -0.047588
+-0.0072207 0.0356289 0.0484876
+-0.0818563 0.150046 0.00220642
+-0.0435006 0.0534118 0.0391466
+-0.0714969 0.156283 0.0152923
+-0.0883581 0.0875191 0.0194553
+-0.0774993 0.127442 0.0532862
+0.0288434 0.0591735 0.0415864
+-0.053835 0.0329874 0.0179508
+-0.0855039 0.140637 0.0423198
+-0.0597327 0.156046 0.0093301
+-0.052462 0.0642313 0.0336351
+0.000500084 0.12107 0.0367737
+-0.0692573 0.169753 -0.0288779
+-0.0156709 0.0385345 -0.00280448
+-0.00949582 0.118295 0.0381649
+0.0330035 0.116489 0.00476188
+0.0153369 0.0552331 -0.0286287
+-0.0105333 0.0457993 0.0483516
+0.00652975 0.0380351 0.0455331
+-0.0714995 0.101334 0.0391804
+0.0236022 0.115739 -0.0107408
+-0.0580129 0.118724 -0.0113962
+-0.0543247 0.0500125 0.0112758
+0.0587422 0.0635506 0.00411936
+-0.0589036 0.112559 -0.0155981
+-0.0640258 0.15968 -0.0562568
+-0.00990982 0.175697 -0.0247542
+0.00695815 0.0340953 -0.0204902
+-0.0591465 0.152697 -5.16463e-05
+-0.00975768 0.167025 -0.0223761
+-0.0383481 0.0417109 -0.0273458
+0.0463963 0.0778578 0.0141787
+-0.0720541 0.0777606 0.0379027
+0.0259403 0.1091 -0.0135959
+-0.0758056 0.0891863 -0.013912
+0.0429603 0.0873797 -0.00580114
+-0.0676348 0.0704852 -0.0103532
+-0.066267 0.176761 -0.0601056
+-0.013866 0.129156 0.0103484
+-0.067642 0.150503 -0.040589
+-0.0180327 0.0404537 0.0526147
+0.0183116 0.0636834 -0.0282837
+-0.078386 0.154762 0.00850622
+0.030569 0.0491561 0.035175
+-0.0622212 0.169401 -0.0515858
+-0.0565139 0.0548538 0.00566103
+0.00623573 0.0382417 0.0273828
+-0.038479 0.0945169 0.0431902
+-0.00987706 0.108745 -0.0220853
+-0.0621803 0.161575 -0.027587
+-0.0176337 0.125847 -0.00119502
+0.0328914 0.0578172 0.038629
+-0.0414935 0.0776367 0.0431734
+0.0432388 0.0804742 0.027354
+-0.0137772 0.0770735 -0.0384143
+0.0572117 0.0509068 0.011186
+-0.0689532 0.132595 -0.00851473
+-0.0655849 0.0622273 0.00026904
+-0.0535585 0.062801 0.0308747
+-0.0779359 0.154614 0.00720975
+0.00448513 0.0964789 0.0523472
+-0.060329 0.11723 -0.0118118
+0.029915 0.0430998 0.0305942
+-0.0275027 0.115261 0.0337596
+-0.0635137 0.0412627 -0.00639269
+-0.0164929 0.11134 0.0406952
+0.0292409 0.0951488 -0.0187111
+0.0324104 0.0430965 -0.00468251
+0.0317605 0.08491 0.0425067
+0.0289099 0.0929198 0.0437028
+-0.0707001 0.15817 -0.0449161
+0.0551137 0.0732038 0.0153863
+-0.0823243 0.154364 0.0217732
+-0.0715111 0.145604 0.0434169
+-0.0325077 0.0632413 0.0389915
+-0.0696524 0.0680017 0.0300044
+0.0102276 0.0809104 -0.0321098
+-0.0244999 0.049902 0.0466266
+-0.0554111 0.0574706 -0.0044262
+-0.0628667 0.101101 -0.0182166
+-0.00650089 0.0661332 0.0560881
+-0.0330903 0.15925 -0.0128209
+0.042117 0.0792074 0.0292753
+-0.085793 0.0818712 0.00648437
+-0.0594817 0.0426754 0.0236965
+-0.0539359 0.0541543 0.0107637
+-0.00998113 0.12997 0.0175362
+-0.0633398 0.0410523 0.0148679
+0.0595186 0.0696512 0.0111197
+-0.0628106 0.0420167 0.0410925
+-0.0280399 0.038261 0.000453129
+-0.0314842 0.0386701 -0.0153847
+-0.0183396 0.183004 -0.0240946
+-0.0414917 0.0662628 0.0414077
+-0.0512875 0.0335238 -0.00177633
+-0.009723 0.0684621 -0.0362531
+-0.0736747 0.166615 -0.0419946
+-0.0678387 0.0966346 -0.0163917
+-0.0609822 0.170956 -0.0597011
+-0.0778143 0.0696403 0.00741827
+-0.00249339 0.0619776 0.0560364
+-0.0574944 0.0732758 0.0411576
+0.0174045 0.0834609 0.0516215
+0.0222999 0.0360441 0.0108303
+-0.0134047 0.0981882 0.0494032
+-0.0437579 0.0335748 -0.0150071
+0.0210813 0.123852 -0.00148905
+-0.0530498 0.14867 -0.00246875
+-0.00549096 0.105886 0.0440438
+0.0181231 0.0349865 -0.00397885
+0.011218 0.0822648 -0.0313395
+-0.0785671 0.172906 -0.0416992
+-0.0304948 0.094646 0.0448519
+-0.0315011 0.101567 0.0426346
+-0.0867319 0.116264 0.0471164
+-0.0745642 0.0928269 0.03994
+-0.0287411 0.0366033 0.0533099
+-0.0733382 0.158682 -0.00576511
+-0.011641 0.172783 -0.0205328
+-0.0261276 0.166758 -0.01752
+0.0323797 0.117481 0.0145242
+-0.073083 0.166616 -0.0429976
+0.00318323 0.0894801 -0.0335291
+-0.0592544 0.0696245 0.0378273
+0.00902499 0.0346466 0.0239397
+-0.0614627 0.0334736 0.00162861
+-0.081048 0.154699 0.0221975
+-0.0337735 0.0765809 -0.0265027
+-0.0440788 0.0336672 -0.00594116
+-0.0501186 0.0375352 0.0462556
+0.0383972 0.0931984 -0.0106151
+-0.0507798 0.0488052 0.0196439
+0.0480167 0.0525694 0.0306027
+-0.0715181 0.0657302 0.000515199
+-0.0584278 0.0383351 -0.00941724
+-0.0484961 0.0987927 0.0435149
+-0.00449408 0.088412 0.0569078
+0.00197552 0.0378956 -0.000532016
+-0.0538466 0.0665391 0.0363755
+-0.0736039 0.148578 -0.0278556
+-0.0406505 0.117474 -0.0142631
+-0.0354963 0.0690808 0.0415601
+-0.063566 0.148289 0.0378536
+0.0187266 0.0350257 0.0273865
+0.00460237 0.0388981 -0.00652166
+-0.0775459 0.0688051 0.0117853
+-0.0880987 0.13916 0.0101984
+-0.0871517 0.106348 0.0123653
+-0.0867616 0.0833332 0.0134846
+-0.053009 0.0343093 0.0275811
+-0.0793348 0.0980896 0.0346601
+-0.0751339 0.0669087 0.0157231
+0.0158163 0.0344928 -0.00398192
+-0.0754309 0.0981509 0.0378194
+-0.0695415 0.15615 0.0130838
+0.00196735 0.0370051 -0.0146847
+-0.0711264 0.142566 -0.0097279
+-0.0202009 0.17418 -0.0222934
+-0.0315791 0.125791 0.0170798
+-0.0460989 0.157633 -0.00826241
+-0.0164967 0.0701922 0.0547571
+0.0456793 0.0890097 0.00617442
+-0.0263303 0.0336202 -0.0227625
+0.0458885 0.0778077 0.00419775
+-0.0613708 0.044683 0.0409908
+0.00384566 0.0341227 -0.0209701
+-0.0771455 0.156966 -0.0119003
+0.0355806 0.113279 0.0157103
+-0.036902 0.0362143 0.0131672
+-0.0532397 0.146242 0.0224016
+-0.0474989 0.107059 0.0399589
+-0.0857477 0.109049 0.020349
+-0.0892569 0.122633 0.00330914
+0.054626 0.0562289 -0.00078591
+-0.0161012 0.16832 -0.0147108
+-0.0788763 0.0949177 -0.010577
+0.026592 0.0578126 -0.0217526
+-0.061825 0.164563 -0.0576805
+-0.0210306 0.180146 -0.0147237
+-0.0474984 0.0833402 0.0443799
+-0.0884317 0.131079 0.0440854
+-0.0591643 0.0341749 0.0263998
+0.0381002 0.078079 0.0357853
+-0.0515897 0.146262 0.0154112
+0.0121111 0.116449 0.0370148
+-0.0414388 0.033531 0.00382893
+-0.0200653 0.172726 -0.0151523
+-0.0170332 0.164657 -0.0177746
+-0.0212056 0.0336704 -0.0218021
+-0.0696662 0.0710058 0.0344116
+-0.0516682 0.152149 0.0128837
+-0.0125103 0.0687513 0.0543288
+0.0366353 0.0982561 -0.0107953
+-0.0789343 0.0700266 0.0104198
+-0.0897898 0.136552 0.0342
+-0.0127086 0.0383825 0.00890404
+-0.0624498 0.166273 -0.0455815
+0.0326592 0.0619445 0.0401066
+-0.0457467 0.132003 0.0161756
+-0.0886572 0.111878 0.019323
+-0.0532618 0.0335957 0.00317772
+-0.0164951 0.109966 0.0413377
+0.0543768 0.0731861 0.0106539
+-0.0174802 0.127364 0.0206736
+0.0567172 0.0621967 0.0256596
+0.0464307 0.0792576 0.0101822
+-0.0292965 0.0818454 -0.0346209
+0.0426284 0.0719164 -0.00480026
+0.0578503 0.0648244 0.0238145
+0.0430174 0.0637781 -0.0018983
+-0.0794408 0.0768726 0.0291038
+0.0545285 0.0622324 0.0277996
+0.0441819 0.0945484 0.0191589
+-0.0284244 0.119569 -0.0104891
+-0.0778403 0.10982 0.0432074
+0.0160506 0.0754058 0.0531341
+-0.0523159 0.0517943 0.0256431
+-0.0181754 0.17123 -0.0220272
+-0.049306 0.147765 0.0110054
+-0.0405044 0.166738 0.00354035
+0.0214342 0.0934308 -0.0229317
+0.0452295 0.0931909 0.0101587
+-0.0352058 0.126987 0.0025067
+-0.0177396 0.0642294 -0.0366219
+-0.0251728 0.1712 -0.0194857
+0.0122607 0.0538397 -0.0290819
+-0.0902417 0.133644 0.00722857
+-0.0815914 0.0767239 0.0235201
+-0.0534472 0.146228 0.0234079
+0.0235949 0.0875751 0.0483132
+-0.0647237 0.158466 -0.0128094
+-0.0260145 0.0688342 -0.034504
+-0.0770801 0.15139 0.0355785
+-0.0630768 0.0336712 -0.00794186
+-0.0574971 0.10156 0.0427298
+0.0435266 0.0664036 0.0265247
+-0.0500812 0.146304 0.0115954
+-0.0568525 0.0521385 0.00567837
+-0.0436626 0.0607395 -0.0127771
+-0.0426472 0.117732 -0.0145554
+-0.0805782 0.112389 0.0458728
+-0.0161125 0.127667 0.00290411
+-0.00749701 0.0576432 0.054379
+-0.0454968 0.0775542 0.0422104
+-0.0694956 0.0958583 0.0420894
+-0.0369639 0.0346855 -0.0305537
+-0.0640756 0.151735 -0.033508
+-0.00249095 0.0718247 0.0580407
+-0.0583644 0.065095 0.0331446
+-0.0748917 0.16378 -0.0359985
+-0.0710199 0.0662278 0.0242287
+0.035425 0.0754528 0.0389267
+-0.0547392 0.075379 -0.0185175
+0.0462455 0.0784487 0.0155769
+-0.0310503 0.155166 -0.00836756
+-0.0879532 0.117604 0.0468721
+-0.0630191 0.169374 -0.0476038
+-0.0445267 0.0423569 -0.0163056
+-0.0624997 0.0818785 0.0437679
+-0.0842794 0.115636 -0.000747849
+-0.0700345 0.0631474 0.0200567
+0.0125104 0.105746 0.0436503
+-0.0795696 0.0976882 -0.00856087
+-0.0495247 0.141678 0.0113921
+0.0166382 0.123302 0.0301317
+-0.0367737 0.0813353 -0.0218258
+0.0465043 0.0597504 0.0314309
+-0.0777677 0.0975799 -0.010556
+-0.0460219 0.166062 0.00401182
+0.0609087 0.0623561 0.0101482
+-0.0403969 0.033577 0.00400031
+0.0286533 0.0578113 0.0412965
+0.0447855 0.0917675 0.0181585
+-0.0238167 0.0929782 -0.0327062
+-0.0714891 0.129823 0.0511416
+-0.0235755 0.157761 -0.0033973
+-0.0525761 0.136549 0.0284096
+-0.0177757 0.0756957 -0.0389571
+-0.0184004 0.0383962 0.0258071
+-0.0162165 0.175672 -0.0252165
+-0.0326786 0.0835446 -0.0285522
+-0.0897198 0.135201 0.0382086
+0.0138704 0.12508 0.0305218
+-0.0334383 0.0383149 -0.00250434
+0.0173372 0.059408 -0.0277846
+0.02739 0.119413 -0.00163712
+-0.055795 0.129741 0.0368819
+-0.0124902 0.0560062 0.0517339
+0.00742257 0.034128 0.000278711
+0.0312441 0.0828649 -0.019558
+-0.0804968 0.149757 0.0362335
+0.0224909 0.107012 0.0395338
+-0.0282283 0.117946 -0.012805
+-0.0726553 0.180933 -0.0546755
+-0.0683563 0.134056 0.04686
+-0.0197453 0.163025 -0.0159769
+-0.0591933 0.155725 0.01387
+-0.0522733 0.13577 -0.00153662
+0.0413723 0.0971667 -0.00382246
+-0.0920493 0.125439 0.00826634
+-0.0522301 0.0388364 0.0467813
+0.0151427 0.107227 -0.0182666
+-0.0397192 0.03358 0.00232461
+0.0373971 0.049112 -0.00639066
+-0.0698932 0.120907 -0.00884856
+-0.0667865 0.156181 0.0155153
+-0.0865635 0.0819919 0.0164862
+-0.0276111 0.0476412 -0.0256716
+-0.050104 0.0515366 0.0156131
+-0.0466794 0.0620985 -0.0127944
+-0.0784369 0.170061 -0.0360578
+-0.0714268 0.173765 -0.0397048
+-0.0313808 0.0567165 -0.0143886
+-0.0309651 0.0347631 0.0441412
+0.0067865 0.130497 0.0221788
+-0.0524448 0.149335 0.0194038
+-0.0414976 0.0860064 0.0425981
+-0.0709701 0.155369 -0.0459101
+0.00322675 0.0810659 -0.0345434
+-0.0294909 0.0917678 0.0440939
+-0.0734658 0.151245 -0.0358847
+-0.079509 0.130274 0.0528999
+-0.00249263 0.0534855 0.0544759
+-0.070992 0.0395652 0.00837515
+-0.0868944 0.122556 -0.00173403
+-0.0574179 0.0608499 0.024689
+-0.0424855 0.09447 0.0423231
+-0.00342977 0.0386245 0.00511046
+-0.018769 0.037629 -0.017491
+-0.0527937 0.0869491 -0.0216809
+-0.0846182 0.106299 0.024344
+0.0443742 0.0818795 -0.000800454
+-0.0894613 0.148789 0.0111841
+-0.0867708 0.110409 0.0193573
+-0.0310025 0.176085 -0.0150686
+0.00863383 0.115058 0.0390007
+-0.0408994 0.163853 0.00394115
+-0.057289 0.0707546 0.0390509
+-0.0646832 0.0432745 0.0336962
+0.0205013 0.0892461 0.0486645
+-0.0625318 0.0662874 0.0329584
+-0.0608083 0.147764 -0.00265379
+0.00615212 0.112907 -0.0196236
+-0.0299927 0.0436118 -0.0290457
+-0.0158151 0.162561 -0.00896512
+0.00597686 0.130404 0.00157669
+0.0284244 0.0822003 0.0446831
+0.0211099 0.0605491 0.0480139
+-0.0234016 0.184697 -0.0149423
+0.00333349 0.0390305 -0.00876711
+-0.0635183 0.159851 -0.052592
+-0.0770983 0.150031 -0.00589737
+0.0214723 0.0878669 0.0490265
+-0.0679264 0.131258 0.0474463
+0.00194863 0.100763 -0.0227079
+0.00777681 0.0385776 0.0292039
+-0.022633 0.08929 0.0533197
+-0.00603192 0.127393 0.0291246
+-0.0911594 0.120221 0.0443019
+-0.0894985 0.121276 0.00330358
+-0.0368227 0.0914861 -0.023804
+-0.0530502 0.151987 0.0175947
+-0.0672887 0.121448 0.0519139
+-0.0568311 0.0912579 -0.0217399
+-0.0697681 0.0822532 -0.0170635
+-0.0874076 0.0990828 0.0243308
+-0.0355048 0.108366 0.0378272
+0.0287346 0.10342 0.0381993
+-0.0860991 0.0964962 0.0273389
+0.0321886 0.108821 -0.00928902
+-0.0781375 0.103077 -0.00856917
+-0.0630075 0.0458305 0.00872119
+-0.0737672 0.068042 0.0238437
+-0.0863239 0.111846 0.0325401
+-0.00949559 0.10164 0.0439977
+-0.0902184 0.117255 0.00530427
+-0.075404 0.0914629 0.0394057
+-0.0453927 0.0336614 -0.0191153
+-0.0827835 0.0790493 0.0255103
+-0.0912019 0.132413 0.0272298
+-0.0564798 0.081975 0.044689
+-0.072928 0.148723 -0.0327819
+-0.00163455 0.0466691 -0.0289171
+-0.0665675 0.0355377 -0.00701232
+-0.000953404 0.100702 0.0462281
+-0.00881786 0.169637 -0.0227487
+-0.0201288 0.165284 -0.0176913
+-0.0859703 0.127103 0.0488324
+0.0255102 0.106068 0.0387825
+0.0570523 0.0522954 0.00619533
+-0.0407044 0.0491484 -0.0113833
+-0.0394747 0.168236 0.00277528
+-0.0690053 0.160967 -0.0519594
+0.0161135 0.0534638 0.0477167
+0.0284604 0.079188 -0.0220838
+0.0113708 0.0523816 -0.0287924
+0.0393128 0.0955964 -0.00780286
+-0.020906 0.0387029 0.0322136
+-0.00871553 0.0642094 -0.0357226
+-0.0547883 0.08548 -0.0214211
+-0.0725291 0.0901409 0.0413911
+-0.0566631 0.0629472 -0.00640536
+0.00234532 0.0524899 -0.0301138
+-0.0938956 0.118755 0.0202995
+-0.0414996 0.0846033 0.0426094
+0.00904636 0.090083 -0.0314826
+0.00730102 0.131 0.00524198
+-0.0637681 0.0809918 -0.0188675
+-0.0414945 0.041025 0.0428519
+-0.087002 0.140499 0.00821758
+-0.0709364 0.151841 0.036169
+-0.0634902 0.106988 0.0392647
+-0.0628225 0.0910404 -0.0189489
+-0.0105509 0.165091 -0.0177492
+-0.00157082 0.0341515 -0.0183868
+-0.0378749 0.105661 -0.0201869
+-0.0689412 0.079144 0.0404114
+-0.0239658 0.0335277 -0.0259671
+-0.0732183 0.172207 -0.0490431
+-0.0205007 0.0971766 0.0453281
+-0.0778797 0.109167 0.0401678
+0.000488577 0.0965409 0.0535304
+-0.0172908 0.177187 -0.018141
+0.00409629 0.128905 0.0269756
+0.0212668 0.080528 -0.0265872
+-0.0484872 0.0931824 0.0442201
+-0.0703872 0.161044 -0.0469664
+-0.0556945 0.0334591 0.00641451
+0.043113 0.0972735 0.00118522
+-0.0465526 0.147719 0.00793526
+-0.0620051 0.0336477 0.00854436
+-0.0789484 0.130998 -0.00538086
+-0.0329884 0.0347673 0.0437059
+-0.011676 0.0389222 -0.00979553
+-0.0102112 0.168384 -0.01842
+-0.058489 0.0747585 0.0420339
+0.0115041 0.129313 0.00109395
+-0.0186879 0.0554617 -0.0328673
+-0.0198225 0.168315 -0.0130587
+-0.013087 0.0382629 0.0179922
+0.0130281 0.0916311 -0.029044
+0.0271142 0.0463333 0.0371793
+-0.0618303 0.167813 -0.0535931
+0.0164903 0.113991 0.0376096
+-0.0592845 0.0336203 0.0127024
+-0.0728419 0.0642516 0.016748
+-0.0527116 0.12267 0.0360612
+-0.091424 0.144749 0.0231531
+0.0225812 0.0946281 -0.0221802
+-0.073319 0.153662 0.0322986
+-0.0384844 0.109782 0.036904
+-0.0551177 0.156069 -0.00176933
+-0.0195075 0.0512747 0.046374
+0.0374508 0.109679 0.00217662
+-0.0624744 0.163093 -0.0485882
+-0.0482041 0.0335795 -0.00119996
+0.0115865 0.127977 -0.0019288
+0.00494704 0.131338 0.0186496
+0.00228726 0.131702 0.0133903
+-0.0890002 0.134996 0.00522535
+0.0114372 0.12283 -0.0103617
+-0.0719092 0.180772 -0.055937
+-0.0144633 0.051615 0.0495133
+0.0147782 0.034634 0.0233109
+-0.0647828 0.177875 -0.0546137
+-0.0882908 0.103675 0.012381
+-0.0631313 0.0343469 0.025414
+-0.0255881 0.169753 -0.0108444
+0.0323006 0.0361518 0.00522301
+-0.0682938 0.06404 -0.00150269
+-0.0705485 0.167591 -0.022181
+0.0271973 0.0508207 -0.0197147
+-0.01565 0.10151 -0.0235687
+-0.0233444 0.0380443 0.0215084
+-3.10615e-05 0.0346258 0.0437307
+-0.0391691 0.162354 0.00112683
+-0.0657552 0.0422954 0.0115704
+-0.0745006 0.142795 0.0461595
+0.0473913 0.0422357 0.0119475
+0.0144595 0.121944 0.0333941
+-0.00358089 0.036197 -0.0248262
+0.0394746 0.0459091 0.0309432
+-0.0744487 0.141666 -0.00675172
+-0.0615813 0.0380878 0.0442214
+-0.0393467 0.0392853 0.042122
+-0.0229052 0.0945537 0.0478017
+-0.0281182 0.0563778 -0.0244009
+-0.0325146 0.112544 0.0353443
+0.0114695 0.0949418 0.0507264
+-0.027899 0.0377311 0.0244577
+-0.0247344 0.0668597 -0.034525
+-0.0623338 0.163141 -0.0335899
+0.0341266 0.0993109 -0.0131459
+-0.0130965 0.169821 -0.0173751
+0.0250182 0.11137 0.036342
+-0.0513993 0.14316 0.0173798
+-0.0521465 0.121207 0.0350569
+0.0134264 0.0403382 -0.0227982
+-0.0919004 0.143349 0.0181646
+0.0256492 0.0831048 -0.024123
+-0.0614955 0.0973435 0.04311
+0.0110632 0.0360404 -0.022358
+-0.0702704 0.159573 -0.0469358
+-0.0135146 0.181607 -0.0231689
+0.0462675 0.0778418 0.00718957
+-0.057322 0.0452663 0.0256799
+-0.0473932 0.0337786 -0.0140697
+0.0180643 0.0577618 0.0488361
+-0.0840242 0.151932 0.0065796
+-0.0547337 0.0738545 -0.0174125
+-0.0647273 0.156687 -0.0474505
+-0.0184955 0.0513594 0.0472431
+0.0314014 0.0491212 -0.0073371
+-0.0336406 0.0339783 -0.0207966
+0.0302861 0.0722616 -0.0207987
+-0.0707237 0.135491 0.0487549
+0.0373244 0.0861524 0.0364715
+-0.0839874 0.129456 -0.00327263
+-0.0579656 0.0599816 -0.000771046
+-0.0374903 0.0917378 0.0437278
+-0.0421167 0.157651 -0.00983865
+-0.0774831 0.151439 -0.0048996
+-0.0664918 0.167987 -0.0292876
+-0.0348246 0.12664 0.0173665
+0.0288107 0.113482 -0.00830654
+-0.0939345 0.122834 0.0252963
+-0.0236453 0.0906062 0.0514725
+-0.0623453 0.151603 -0.000787959
+-0.0394885 0.0520168 0.0393574
+-0.0228668 0.103033 -0.0236969
+-0.0205005 0.115412 0.03703
+-0.0206187 0.158806 -0.0102834
+-0.00380864 0.0840797 -0.0375505
+-0.0846424 0.139002 0.00130344
+-0.0244403 0.0384399 0.0299279
+-0.0256136 0.0707601 0.0441795
+0.0431065 0.0733659 -0.00379081
+-0.0334964 0.0575473 0.0382542
+-0.0732341 0.100848 0.0383652
+-0.0417523 0.0392031 -0.0263092
+-0.0600247 0.0335577 0.00903367
+0.0319454 0.0782138 0.0427262
+-0.0478947 0.122501 0.0288841
+-0.0215102 0.0435311 0.0534788
+-0.0175036 0.0357848 -0.0270478
+-0.0659221 0.115196 -0.0104247
+-0.0452512 0.0574076 0.0387158
+-0.0318518 0.100063 -0.022678
+-0.062214 0.131105 0.0398962
+-0.0570307 0.151068 0.0316808
+-0.0390807 0.159219 -0.0117734
+-0.0575439 0.0421232 0.0457366
+-0.0434958 0.166715 0.00391556
+0.0435215 0.0973118 0.0181533
+0.0364745 0.0384289 0.0206775
+0.00783805 0.034796 0.0434029
+0.00550647 0.0519309 0.0530702
+-0.0452904 0.125307 0.0239255
+0.0384949 0.0469555 0.0314897
+-0.0344994 0.0860255 0.0426749
+-0.0604675 0.0334377 0.00185915
+0.00564306 0.109569 0.0416563
+-0.0341393 0.169665 -0.0151103
+0.0252174 0.115733 -0.00872379
+-0.0432318 0.0365168 -0.0263599
+-0.0648058 0.0881399 -0.0188881
+-0.0113055 0.0420913 0.0500945
+-0.0768733 0.0742923 -0.00658087
+-0.0718355 0.0757492 0.0369191
+-0.00552934 0.126815 -0.00649473
+-0.015298 0.113338 -0.0180384
+-0.0658513 0.168603 -0.0333515
+-0.0769239 0.160393 -0.0146649
+-0.0789031 0.0913518 0.0358575
+-0.0622512 0.175627 -0.0566298
+0.0427075 0.100107 0.0161639
+-0.0122664 0.0420539 0.0504523
+-0.0593768 0.116855 0.0386274
+-0.0207916 0.117992 -0.012906
+-0.0209967 0.0893299 0.0545201
+-0.0293388 0.0522666 -0.0213646
+0.042 0.102859 0.00616839
+-0.0915744 0.128321 0.0372423
+-0.0745556 0.104899 0.0367465
+-0.0874341 0.0860792 0.0144694
+-0.0893403 0.0983511 0.0184032
+0.0265834 0.0915781 0.0456097
+0.0111147 0.0359709 0.0304167
+-0.0251149 0.163764 -0.0159045
+0.0379525 0.0888235 0.0356698
+-0.0308593 0.102934 -0.0225503
+-0.0849458 0.0817985 0.00448942
+0.016843 0.101962 -0.021958
+-0.0602648 0.153206 0.0324327
+-0.00109974 0.118227 -0.0153259
+-0.0277867 0.0904111 0.0457123
+-0.0632329 0.149656 -0.0246848
+-0.0378318 0.0943285 -0.0232947
+0.00942926 0.0360304 0.00452751
+0.00308943 0.0346383 -0.0160359
+-0.0629538 0.164686 -0.0335942
+-0.0707579 0.0639499 0.00302292
+-0.0806378 0.0734203 0.0185511
+-0.0114878 0.0502762 0.0503958
+-0.051624 0.0589527 -0.00929309
+-0.0724662 0.156284 0.0178613
+-0.0755506 0.0791122 0.0357048
+-0.0599662 0.0605914 -0.00103222
+-0.0407972 0.128426 0.00338476
+-0.0685036 0.0972643 0.0418698
+0.0384545 0.081427 -0.0137424
+-0.0869304 0.137738 0.00419643
+-0.0915894 0.118845 0.0433559
+-0.0375104 0.0344317 -0.0164034
+0.0132714 0.0779991 -0.0309033
+-0.000460653 0.0717499 0.0573883
+-0.0689415 0.128234 -0.0091158
+-0.00449889 0.0389099 -0.0139692
+-0.00687105 0.104506 -0.0230032
+-0.0625734 0.0333471 -0.00389969
+-0.0466818 0.0680053 -0.0151447
+0.0325669 0.0564098 0.0381516
+-0.00676687 0.0770295 -0.0375725
+0.031043 0.0535582 0.0376713
+-0.0252324 0.0383969 -0.00646059
+-0.0781312 0.100777 0.0347873
+-0.0351912 0.0448435 0.0445858
+-0.0618482 0.0460583 0.00900481
+-0.0510378 0.148698 -0.00295565
+-0.0758068 0.170822 -0.0449998
+0.0228822 0.0407495 0.0397886
+-0.0556881 0.123137 -0.00801327
+0.041209 0.10285 0.0181659
+-0.057716 0.154704 0.0245626
+-0.0356589 0.0394362 0.046602
+-0.018436 0.0384553 -0.00144245
+-0.0725091 0.147853 -0.0287195
+0.0195403 0.0672509 0.0492981
+-0.00949487 0.11143 0.0422271
+0.0387128 0.0407096 0.0245464
+0.0274937 0.0354669 0.00307886
+0.0251817 0.0344441 0.0110044
+-0.0734653 0.11597 0.0519419
+-0.0517405 0.0367791 -0.0118947
+-0.0313584 0.0347088 0.042355
+-0.0271594 0.0577744 0.0376032
+0.0289959 0.083514 0.0437755
+-0.0609886 0.0421383 0.0435161
+-0.0642758 0.0379734 0.0412454
+-0.0669901 0.171097 -0.0394962
+0.00201718 0.0342688 0.0083365
+-0.0376227 0.0519888 -0.0106273
+-0.0604976 0.0761414 0.0420756
+0.0231651 0.0624431 -0.0251426
+-0.0444966 0.100126 0.0423688
+-0.0434704 0.0888362 0.0427012
+-0.0739012 0.112096 -0.00769672
+0.0113285 0.0381477 0.0446991
+0.0606492 0.0595518 0.0111602
+-0.0344028 0.0453249 -0.0266763
+-0.0238559 0.100178 -0.023968
+0.0124979 0.0363631 -0.0219171
+-0.0386629 0.0606634 -0.011982
+-0.0845122 0.0778323 0.0175087
+-0.0447652 0.0811738 -0.019998
+-0.0325802 0.0708663 -0.0234636
+-0.0428489 0.09852 -0.021578
+0.0343638 0.0491351 -0.00656846
+-0.00173319 0.108975 -0.0214067
+-0.0513914 0.0516798 0.0216239
+0.00608628 0.101527 -0.0214717
+-0.0746196 0.147202 -0.0138555
+-0.0464944 0.0733156 0.0418074
+0.0275533 0.0550749 -0.019815
+-0.0617588 0.0455326 -0.00130544
+-0.0627435 0.14749 -0.0135844
+0.0114636 0.0347788 0.020691
+0.0413154 0.0451948 0.0296022
+-0.0855482 0.149965 0.0308161
+0.045359 0.04899 -0.00489955
+0.000884291 0.038993 0.0274224
+-0.086804 0.0846773 0.00948205
+0.00217921 0.090906 -0.033534
+-0.0074916 0.0518487 0.0520774
+-0.000472995 0.0746288 0.0583091
+0.00707409 0.0348007 0.0234037
+0.0191098 0.127253 0.00673134
+-0.00312412 0.123427 0.0346626
+-0.0251492 0.0379137 0.0122303
+-0.030188 0.124116 0.0205603
+-0.0326284 0.178159 -0.00692862
+-0.0371849 0.0430027 -0.0273252
+0.000516139 0.0703294 0.0566091
+-0.061834 0.155291 -0.0275862
+0.0144787 0.103102 0.0461637
+-0.0601666 0.138122 0.0340792
+0.0447845 0.0903596 0.0201575
+-0.0175794 0.128153 0.00899134
+-0.0654784 0.133956 0.0422213
+-0.078379 0.0698242 0.00895098
+-0.0544145 0.0561001 0.0105768
+-0.0166845 0.0625881 0.0524778
+0.0283147 0.0712973 0.0426773
+0.00750546 0.105745 0.0420743
+-0.0365184 0.126747 -0.000928274
+-0.0297912 0.154227 -0.00467156
+0.0242356 0.0804257 -0.0251216
+-0.0507602 0.0797387 -0.0202693
+-0.0399713 0.112687 -0.0172474
+0.0170749 0.128355 0.00741174
+-0.0399375 0.150681 0.00347523
+-0.0608612 0.0435863 0.0137318
+-0.0365883 0.0485443 -0.0138981
+-0.0910601 0.132402 0.0282222
+-0.0795844 0.0759236 -0.00451678
+-0.0809274 0.12805 -0.00535084
+-0.0711513 0.132664 0.0498849
+0.0150413 0.120568 0.0342385
+0.00849911 0.119651 0.036768
+-0.0569109 0.033599 0.014995
+-0.0689033 0.0887623 0.0428815
+-0.020138 0.166773 -0.018707
+-0.0815894 0.0926183 0.0328436
+0.00319943 0.0866473 -0.0337836
+-0.0528475 0.140082 0.0254195
+0.0217844 0.118301 -0.00950952
+-0.0305318 0.0734349 -0.0315361
+-0.0355385 0.040818 0.0464546
+-0.0446309 0.0563208 -0.0114385
+-0.0779756 0.13395 -0.00568102
+-0.0924453 0.114684 0.0163206
+-0.0427865 0.0855262 -0.0214717
+-0.030041 0.0819074 -0.0335886
+-0.0350329 0.037518 0.0477355
+-0.0574727 0.0791252 0.0438951
+-0.0347822 0.124221 0.0233214
+0.0396853 0.0674479 -0.00978879
+-0.0280887 0.123076 -0.00418723
+-0.0357494 0.0383801 -0.010405
+-0.0896534 0.0983503 0.0154045
+-0.0393744 0.174134 -0.00504658
+-0.00548988 0.121033 0.0366102
+-0.0493281 0.143211 0.0074004
+-0.0618749 0.161566 -0.0365945
+-0.00486561 0.103096 -0.0233724
+-0.0158939 0.0387206 -0.00487532
+-0.0136298 0.0943834 -0.0340901
+-0.0708677 0.158014 -0.00345716
+-0.0679292 0.0674285 0.0308631
+-0.0698001 0.0894083 -0.0167108
+-0.0708742 0.117963 -0.00822963
+0.0544559 0.0679536 0.0254119
+0.0505447 0.0640078 -0.00213219
+-0.0328813 0.11004 -0.0184872
+-0.0329481 0.169751 -0.00390259
+-0.0730465 0.158091 -0.00419381
+-0.0642284 0.165303 -0.0599757
+-0.0393381 0.149359 -0.00118821
+0.027659 0.115893 0.031317
+0.00307915 0.03925 0.0330573
+-0.0268824 0.0338882 -0.0212482
+-0.076206 0.0892711 -0.0135327
+0.036558 0.0887304 -0.0159156
+-0.045503 0.0478046 0.0396725
+-0.00457894 0.0383459 0.0160278
+-0.014359 0.102532 0.0433738
+-0.0263218 0.038308 -0.00105771
+-0.0252694 0.0564528 0.0400125
+-0.0745038 0.137269 0.049596
+-0.0478639 0.102799 -0.0211716
+-0.0698236 0.144589 -0.0179026
+-0.00449355 0.112805 0.041803
+0.0395793 0.107012 0.0171684
+0.0320331 0.117177 0.0215305
+0.0319133 0.103439 0.0357737
+-0.0232571 0.160328 -0.0132723
+-0.0368559 0.101427 -0.0217814
+-0.0779001 0.105799 -0.00757653
+-0.0719733 0.155857 0.00930845
+-0.0667659 0.0664754 0.0301739
+-0.0116086 0.0384341 0.0253641
+-0.0828253 0.0815398 -0.00255091
+-0.00864403 0.0481881 -0.0304747
+-0.0695881 0.0687436 -0.00572614
+-0.053703 0.069339 -0.0141095
+-0.0875622 0.147255 0.0314849
+-0.060703 0.146825 0.0369155
+0.0559661 0.0563559 0.00119345
+-0.0899141 0.140577 0.0142032
+0.0290556 0.0480892 -0.0107335
+-0.0444676 0.0959215 0.0428438
+-0.0126944 0.0614008 -0.0362648
+-0.00712049 0.126279 0.0302479
+0.00717458 0.125139 0.032446
+0.0130051 0.123122 0.0330958
+-0.0658939 0.119442 -0.00885604
+-0.0535827 0.0550746 0.0114399
+0.00820634 0.0865719 -0.0325157
+-0.0358588 0.100033 -0.0223224
+-0.0816885 0.110103 -0.000571623
+-0.0517049 0.0693137 -0.014154
+-0.0304078 0.0499703 0.0425042
+0.0090211 0.0602846 0.0533569
+-0.0102692 0.126825 -0.00441849
+-0.0412575 0.123881 0.0239565
+-0.0304041 0.179805 -0.0103906
+-0.0119972 0.115638 -0.0165051
+0.0413233 0.102851 0.0171643
+-0.032272 0.0343596 0.0389523
+-0.0854712 0.0791996 0.00951147
+-0.0138083 0.082755 -0.0391488
+-0.0256473 0.0335939 -0.0244827
+0.0452831 0.0511563 0.0319003
+-0.0829803 0.153189 0.00837374
+-0.0435404 0.0351992 0.0428237
+0.0114184 0.0389206 -0.0228692
+0.0440394 0.0405103 0.0110966
+-0.0218345 0.0725147 0.0516294
+0.0173744 0.124995 0.027504
+-0.0771042 0.163136 -0.0202013
+0.0282746 0.0494546 -0.0167442
+-0.0703245 0.0805604 0.0403227
+-0.0558701 0.154311 0.0223113
+-0.0790495 0.0785612 -0.00658771
+0.0023439 0.122378 0.0350184
+-0.0220309 0.0609111 0.0451603
+-0.0853195 0.117662 0.0484974
+-0.0580048 0.0366442 0.0464062
+-0.00844255 0.0358982 -0.0250895
+0.0243113 0.119024 -0.0062727
+-0.0558892 0.141955 -0.00229647
+-0.0642262 0.115635 0.0441038
+-0.0719279 0.153998 -0.0419035
+0.0423481 0.0732982 -0.00579253
+0.0103113 0.0595614 -0.0298764
+-0.0818376 0.116236 -0.00283916
+0.0590795 0.0663557 0.00613696
+-0.039497 0.0436994 0.0413132
+-0.0702982 0.0846763 0.0415948
+-0.0167436 0.068615 -0.0382083
+-0.0690033 0.127063 0.0512206
+-0.0485018 0.102883 0.0409949
+-0.0541716 0.144673 0.0274046
+0.0243198 0.0564051 0.0438207
+-0.0308589 0.0382072 0.0517831
+-0.00548321 0.119649 0.0378412
+-0.0606463 0.0434636 0.0431332
+-0.008712 0.171156 -0.0257232
+-0.0444845 0.0846726 0.04342
+-0.0897848 0.135174 0.0342114
+-0.00690926 0.0349718 0.0473534
+-0.0808786 0.122166 -0.00503067
+-0.0779103 0.070378 0.00551561
+0.0134856 0.129689 0.00607818
+-0.0225837 0.0666453 0.0469216
+-0.0525012 0.046573 0.0420391
+-0.0444858 0.091688 0.0430295
+-0.0394965 0.0662956 0.0417788
+0.00897384 0.0364118 0.0277765
+-0.0782046 0.166684 -0.029962
+0.0192461 0.0777761 -0.0276631
+-0.0483417 0.137106 0.010396
+0.0258883 0.12226 0.00355652
+0.0398565 0.0384519 0.0122163
+-0.0408758 0.107069 -0.0201235
+-0.0315055 0.0689302 0.0397623
+-0.068912 0.148468 -0.034342
+-0.0496681 0.0705507 0.0391462
+0.00414266 0.131018 0.00407154
+0.0204354 0.100784 0.0455262
+-0.0587133 0.0708136 -0.0155469
+-0.00369415 0.0386815 0.0249596
+-0.0546088 0.0601814 -0.0071333
+0.0277597 0.0984362 -0.0181936
+0.00136992 0.128685 0.0274437
+-0.0166951 0.0555255 -0.0336624
+0.0054852 0.109984 0.0416767
+-0.079955 0.130987 -0.00485489
+-0.00265109 0.0497012 -0.030809
+-0.0697849 0.145343 0.0431021
+-0.0903934 0.12698 0.0433203
+-0.0409656 0.122163 0.0270528
+-0.056363 0.13673 0.0325483
+-0.00422605 0.0355815 -0.0164762
+-0.0158888 0.123338 -0.00654807
+0.0233356 0.0389315 -0.00470356
+-0.0377622 0.0797629 -0.0199128
+-0.0274204 0.12046 -0.00942796
+-0.0745042 0.0669844 0.00328572
+-0.0544992 0.0400332 0.0469658
+-0.022854 0.100181 -0.0240549
+-0.0748342 0.156367 -0.00257451
+0.00532997 0.0389553 -0.00830106
+-0.0591545 0.129731 0.0390508
+-0.0365933 0.117132 -0.0139142
+0.00710349 0.126169 0.0309735
+0.00420316 0.0838546 -0.0341295
+0.0424932 0.0541962 0.0323753
+-0.0447782 0.039524 -0.0212903
+0.0130456 0.0946785 -0.0262358
+0.0515873 0.047616 0.00226708
+-0.0226971 0.059684 -0.0328522
+-0.0489531 0.117804 -0.0145786
+-0.00521852 0.130779 0.0091953
+-0.0745798 0.155493 -0.021916
+-0.0211637 0.171222 -0.0207379
+-0.0681899 0.15036 -0.0415571
+-0.0645431 0.0356401 -0.00785526
+0.0444401 0.0776895 -0.00177282
+0.0191352 0.0356125 -0.00767677
+-0.0879901 0.0928029 0.00642738
+-0.0274823 0.0617236 0.037721
+0.0406194 0.104193 0.00117617
+-0.0205806 0.0342261 -0.0203167
+0.052283 0.0559902 -0.003254
+-0.0826845 0.0884898 0.0312484
+-0.0354914 0.0719062 0.0418497
+0.00222867 0.0810902 -0.0349213
+-0.0247631 0.123128 0.0239793
+0.00210157 0.111597 -0.0202587
+-0.029962 0.122606 -0.0056563
+-0.0642809 0.173904 -0.0612545
+0.0164873 0.128764 0.0128859
+-0.0290915 0.0334798 -0.0269263
+0.0563251 0.0686891 0.0234174
+0.0388229 0.0428364 0.0281231
+-0.0364553 0.171237 0.000642707
+-0.0695352 0.0422413 0.00168563
+0.0115865 0.119151 -0.014401
+-0.0445078 0.128204 0.0197407
+-0.0735439 0.101276 0.0379813
+-0.0842997 0.131249 0.0498733
+-0.0456134 0.0424471 -0.0132755
+0.00124079 0.0740793 -0.0353703
+-0.0590284 0.155612 0.0197248
+0.00626131 0.0696979 -0.0331897
+-0.0465413 0.123419 -0.0104793
+-0.0145087 0.0587885 0.0518852
+-0.0412993 0.127471 0.0164976
+-0.0621264 0.0457845 0.0326787
+0.00861617 0.0348422 -0.0132521
+-0.0699384 0.129684 -0.00901632
+-0.0174184 0.0961382 -0.0299203
+-0.0408477 0.0999502 -0.0215042
+-0.0629342 0.109643 -0.0151294
+-0.0588992 0.0593658 0.0203903
+-0.0622614 0.0594461 0.0178467
+0.0503092 0.0575099 -0.00459296
+0.0328071 0.0781213 -0.0187889
+0.0297936 0.0354746 0.0165125
+-0.0592597 0.0343664 0.034953
+-0.0736653 0.0761112 -0.0107553
+0.0358581 0.0686798 0.0377462
+-0.0814983 0.102013 0.0310531
+0.0072631 0.0968089 -0.0265119
+-0.0107695 0.0756601 -0.0381615
+-0.0665448 0.142647 -0.010737
+-0.0861837 0.0868588 0.0248974
+-0.0323987 0.114036 -0.016697
+-0.0526124 0.143167 0.0204083
+-0.00749979 0.118315 0.0383098
+-0.0366574 0.0591917 -0.011518
+-0.0854765 0.145991 0.0364919
+-0.0590102 0.131118 -0.0069845
+0.0099878 0.0342067 -0.0142754
+0.0406313 0.0833746 0.032449
+-0.0377389 0.0753784 -0.0182557
+-0.0265179 0.111211 0.0374625
+-0.0457781 0.109842 -0.0182449
+0.0106021 0.12463 0.0322012
+-0.0714609 0.172223 -0.0354286
+-0.0918002 0.143353 0.0191654
+0.009256 0.0681484 -0.0312392
+0.00426025 0.0352382 0.0224392
+-0.0497576 0.0782604 -0.019072
+-0.0628575 0.0953598 -0.0185102
+0.0594691 0.0677866 0.0081304
+0.0120479 0.124912 -0.00663019
+-0.0896003 0.111903 0.0133388
+-0.000572916 0.131478 0.0109076
+-0.0856485 0.103181 0.0252723
+-0.0825849 0.0762413 0.018536
+0.0357614 0.089262 -0.0164786
+-0.0853874 0.0978708 0.0280062
+-0.0250231 0.0373676 -0.0184933
+-0.0224668 0.0384735 -0.00782567
+-0.0215612 0.127036 0.0148264
+0.0375018 0.0527008 0.0316063
+0.0132903 0.0644915 0.0525417
+0.021025 0.0444507 -0.0197096
+-0.0230202 0.0380885 0.0125034
+-0.0190143 0.123258 -0.00649836
+-0.0634892 0.101502 0.0420523
+-0.0022961 0.120938 -0.0122094
+-0.0682754 0.155222 0.00480981
+-0.0105391 0.0444694 0.0492224
+-0.0314884 0.0988001 0.0440684
+-0.0162822 0.113495 -0.0182068
+0.0427502 0.0832247 0.0284671
+-0.0317184 0.124145 0.0214762
+-0.0228243 0.0868132 -0.0375213
+0.0112412 0.122679 0.0339481
+-0.0624726 0.093208 0.0448109
+-0.0195149 0.0474114 0.0506124
+-0.0305029 0.105682 0.0404793
+0.0297926 0.0510441 -0.0147439
+-0.0660587 0.0336733 0.00769062
+0.01375 0.126078 -0.00389468
+0.00623348 0.0768314 -0.0342539
+0.00723812 0.0725784 -0.0338132
+-0.0345032 0.0747169 0.0417978
+-0.0533429 0.0572662 -0.00744815
+-0.0588626 0.0344147 0.0367317
+-0.0597544 0.151092 0.0347772
+-0.066041 0.156288 0.0201296
+-0.0519452 0.0542248 0.0130044
+-0.0536545 0.154299 0.0129697
+-0.0553709 0.131821 -0.00535733
+-0.0165812 0.0355875 -0.0267111
+-0.0671293 0.149176 -0.0346332
+0.0364911 0.112064 0.0146153
+-0.0678122 0.0908837 -0.0169858
+-0.0433492 0.123979 0.0232099
+0.0233446 0.0489622 -0.0213372
+-0.0401353 0.162183 -0.0119788
+-0.0436993 0.0680874 -0.0160622
+-0.0575 0.0589785 0.0215704
+0.002504 0.0605716 0.0560843
+-0.0230753 0.078299 0.0540943
+-0.0532839 0.150877 0.0224035
+-0.0536299 0.144677 0.0243972
+0.0138044 0.129402 0.00474998
+0.0390959 0.0382591 0.0140545
+-0.0935248 0.128245 0.016248
+-0.017174 0.169749 -0.0215263
+-0.00210217 0.035143 0.0464295
+0.00913637 0.105871 -0.0204027
+-0.0861865 0.0926674 0.00242789
+-0.0615271 0.0344278 0.0378839
+0.0506397 0.0652197 -0.00133714
+-0.0859779 0.129848 0.0487451
+-0.0269007 0.0388242 0.0362546
+0.0349035 0.0987755 -0.0125611
+-0.0895593 0.13929 0.0311867
+0.0210026 0.126515 0.0102791
+0.0155029 0.119565 0.0348769
+-0.0660877 0.178333 -0.0536421
+-0.0134986 0.0911752 0.0564813
+-0.0462738 0.0671086 0.039469
+-0.0691002 0.0421453 0.000699576
+0.0106377 0.0658124 0.0539651
+-0.0372457 0.0381548 -0.00680953
+-0.0415057 0.0396254 0.0430594
+-0.0658022 0.0335619 0.00426403
+-0.0549779 0.135599 -0.00339213
+-0.0654711 0.157635 -0.0545345
+-0.0699145 0.135483 0.0481625
+-0.0647392 0.157599 -0.0538703
+-0.0405119 0.125571 0.0212459
+-0.0408461 0.0957242 -0.0225993
+-0.0211708 0.123144 -0.00636628
+0.0528302 0.048039 0.0216552
+0.0292509 0.119574 0.0033793
+0.0456488 0.0861985 0.00518381
+-0.0697746 0.169428 -0.052035
+-0.0583932 0.146765 0.0331817
+-0.0748301 0.174171 -0.0395847
+0.0397534 0.0685495 0.0327941
+0.0603506 0.0581587 0.0121666
+-0.0615125 0.0729203 0.0397926
+0.0320567 0.106099 0.0342281
+0.0259569 0.0632491 0.0444844
+-0.017781 0.12071 -0.00976707
+-0.00292868 0.129815 0.0244395
+0.042563 0.0650705 0.0275619
+0.051394 0.0726569 0.00804397
+-0.0147356 0.124887 0.0290085
+0.0124993 0.116805 0.0367613
+-0.0095857 0.128017 -0.00170998
+-0.0353912 0.0475494 -0.0206462
+-0.0197639 0.0714243 -0.0385337
+-0.0646745 0.0721957 -0.0143162
+-0.0418918 0.129001 0.00740866
+-0.0217734 0.0713925 -0.0382795
+-0.0493632 0.1301 -0.00139208
+0.0232238 0.0822541 0.0494986
+0.0449291 0.081953 0.02316
+0.0595997 0.0567108 0.0101713
+-0.0496185 0.140151 0.0144011
+-0.0524988 0.102874 0.0411998
+0.0342709 0.0876121 0.0408726
+-0.0295799 0.174217 -0.00600797
+-0.0251232 0.165382 -0.00841584
+0.0176002 0.124344 -0.00401113
+0.054323 0.064171 -0.000208879
+-0.0129906 0.0568055 0.0517595
+-0.0751884 0.153035 0.033144
+0.0124885 0.114028 0.0382457
+0.0104651 0.0444795 0.0447526
+-0.033472 0.124985 -0.00213286
+-0.0519318 0.0352921 -0.0124585
+-0.0621937 0.156854 -0.0175927
+-0.0755066 0.11755 0.0524265
+-0.0660809 0.135405 0.0431027
+0.0020291 0.0342762 0.0137843
+0.0320171 0.111398 0.0306261
+-0.0685791 0.147786 -0.0311476
+0.0139278 0.129741 0.0148027
+-0.075709 0.170829 -0.032719
+-0.0241819 0.175647 -0.0202251
+-0.0729646 0.147133 -0.0208616
+-0.0588824 0.0997395 -0.0190365
+-0.0396703 0.036174 -0.00733977
+-0.0195581 0.181635 -0.0160858
+-0.0449923 0.0381195 -0.0222607
+-0.0298707 0.101527 -0.0228594
+-0.0447239 0.169659 -0.000473292
+-0.0547075 0.153861 0.0184094
+-0.00344803 0.111769 -0.0204187
+-0.048864 0.162635 -0.0057974
+-0.0837218 0.154141 0.0154269
+-0.0709606 0.172226 -0.0520527
+-0.000498029 0.0505184 0.0529377
+-0.0916834 0.116094 0.0407438
+0.029535 0.0987313 -0.0165204
+-0.0649388 0.16711 -0.0315896
+-0.00669968 0.0599043 -0.0346663
+-0.0086066 0.042026 -0.0258639
+0.0380982 0.0589726 0.0320786
+0.0284966 0.0768217 0.0447581
+-0.0365356 0.155076 0.00317988
+0.0173692 0.0476632 -0.0235115
+0.0152466 0.0765161 -0.0298116
+-0.061679 0.175513 -0.061381
+-0.03626 0.0434916 0.0442696
+0.0033481 0.0346494 0.040814
+-0.0708559 0.177779 -0.0481346
+-0.0522853 0.153955 0.0120432
+-0.00577511 0.0770351 -0.037534
+-0.0279795 0.0577645 -0.0254
+-0.0474968 0.101477 0.0417865
+0.0418115 0.0872841 -0.00879032
+-0.0272728 0.0383881 -0.00686007
+-0.0828517 0.110648 0.028886
+-0.0677301 0.181168 -0.057983
+-0.0339959 0.0752105 -0.0234884
+0.0227878 0.0350417 0.0227582
+-0.0132511 0.177151 -0.0280569
+-0.0662758 0.159515 -0.0565111
+-0.0759663 0.179251 -0.0520449
+0.0494532 0.0710682 0.00472592
+-0.0158055 0.0931896 -0.0348885
+0.0506418 0.0475027 0.0012667
+-0.0220809 0.0348313 0.0494485
+-0.0681005 0.179488 -0.0529195
+-0.0457387 0.0767861 -0.0183415
+-0.0849611 0.0883696 0.0278927
+0.0410895 0.0670315 0.0294468
+0.0123862 0.0342845 -0.0119874
+-0.0861176 0.152173 0.0250218
+0.00146529 0.0341167 -0.0177588
+-0.0847663 0.132585 0.0488829
+0.041918 0.0732584 -0.00676718
+-0.0704834 0.174975 -0.0436743
+0.0101806 0.114501 -0.0173735
+-0.0274005 0.0647434 -0.0304718
+0.00306398 0.0374048 0.023868
+-0.0908043 0.122683 0.00627651
+-0.0126271 0.0337462 -0.0239473
+0.0294467 0.0623083 -0.0198501
+-0.031353 0.158667 -0.0125849
+-0.0600161 0.129661 -0.00742185
+0.0141451 0.0740257 0.0538731
+0.0348792 0.0378052 0.00236551
+-0.0223477 0.16248 -0.006155
+0.0184989 0.11258 0.037522
+-0.0107925 0.18028 -0.0267448
+0.0112772 0.0752122 -0.0313695
+-0.0481785 0.0341964 0.00728185
+-0.0564997 0.107064 0.0398466
+-0.0510086 0.119975 -0.0128249
+-0.0142596 0.175663 -0.0267921
+-0.028881 0.124884 0.00195054
+-0.0744184 0.069256 0.0261761
+-0.0527672 0.0812315 -0.0212685
+0.0424296 0.0696684 0.0278335
+-0.0272214 0.163934 -0.00616346
+0.0566888 0.0635446 0.0256358
+0.0446243 0.0959671 0.00617079
+-0.0160443 0.174209 -0.0181164
+-0.0310058 0.156198 -0.0100049
+-0.039513 0.166742 0.00312951
+-0.0651923 0.176525 -0.0608469
+-0.0649089 0.110873 0.0375872
+-0.0545067 0.0904158 0.0449797
+0.0328041 0.0682575 -0.0177764
+0.0296649 0.110072 0.0343033
+-0.00848516 0.121007 0.0363393
+-0.0284943 0.0674472 0.03888
+0.0207654 0.126697 0.0144664
+-0.0231479 0.0919482 0.0509374
+-0.0105985 0.0406145 -0.0262787
+0.0525369 0.0651172 0.0279377
+-0.0709498 0.165209 -0.0469921
+0.0101258 0.125306 -0.00703851
+-0.0198334 0.107697 -0.0220521
+0.0228667 0.107306 -0.0156684
+0.0410305 0.0422896 -0.000687891
+-0.0687631 0.080836 -0.0170666
+-0.0685062 0.142066 -0.00982847
+-0.0288706 0.171229 -0.00855169
+-0.0870246 0.129415 0.000309032
+-0.0367401 0.0754253 -0.0187666
+-0.0231137 0.159172 -0.011899
+-0.0445 0.113887 0.0346508
+-0.0617979 0.154608 0.0289232
+0.0322191 0.117688 0.00875184
+0.00258681 0.125467 0.0322572
+-0.0668846 0.117985 -0.00889164
+-0.0560239 0.144237 -0.00161522
+-0.0939473 0.122782 0.0142819
+-0.057663 0.155278 0.0187721
+-0.0653495 0.0459059 0.00467835
+-0.0838817 0.150077 0.00420446
+-0.0574972 0.100168 0.0430053
+0.0447715 0.070791 0.0233171
+0.0114258 0.129163 0.0238841
+-0.0415072 0.0605699 0.0406995
+-0.0495023 0.0862453 0.0455995
+-0.0309567 0.166794 -0.00630909
+-0.0310964 0.125815 0.0157855
+0.0577493 0.0579199 0.00320063
+-0.00748502 0.105882 0.0440003
+-0.0594987 0.0932573 0.0451741
+-0.0584823 0.080492 0.0436889
+0.0565518 0.0722252 0.0100192
+-0.0154726 0.123613 0.0307813
+-0.017794 0.0799068 -0.038901
+-0.0670193 0.0901061 0.04379
+-0.0506534 0.0619401 -0.0109597
+-0.0284985 0.0631152 0.0376198
+0.0405765 0.0793262 0.0323176
+0.0350622 0.0909926 -0.0162992
+-0.0679473 0.136882 0.0457212
+-0.0626008 0.160001 -0.0205855
+0.0143086 0.0623633 -0.0295361
+0.00349883 0.0605728 0.0559342
+0.0235231 0.0943993 -0.0219282
+0.0425314 0.0623712 0.0287546
+-0.0352518 0.156597 0.00331287
+-0.0807586 0.0950245 -0.00854945
+-0.085825 0.114595 0.0464925
+0.0420636 0.0915328 -0.00679501
+-0.0369296 0.0455099 -0.0248207
+-0.0610521 0.0460525 0.00962048
+-0.0476199 0.057734 -0.011287
+-0.0595357 0.0400627 -0.00844467
+-0.0604419 0.114971 -0.0134731
+-0.016194 0.128088 0.0051496
+-0.0365847 0.122192 -0.00920846
+-0.0464591 0.0345029 0.0305523
+-0.0644598 0.0432795 0.035714
+-0.0241405 0.168248 -0.0186857
+-0.0743787 0.145821 -0.0108474
+0.0173308 0.0566344 -0.0283721
+-0.0548894 0.136747 0.0311423
+-0.0579822 0.0343384 0.0317603
+-0.0262958 0.0634474 0.0394208
+-0.0183558 0.127798 0.00725695
+-0.0750251 0.152273 0.0347437
+-0.0648702 0.0334576 -0.000853911
+-0.0610584 0.138406 -0.00654552
+0.0224766 0.0920198 0.0478397
+0.044722 0.0945895 0.0131657
+-0.0873336 0.126682 -0.000726608
+-0.0880434 0.125329 0.00027907
+-0.0364509 0.174337 -0.00256774
+-0.053938 0.138144 0.0289679
+-0.00559979 0.114688 -0.0175182
+-0.00635915 0.0931082 -0.0347376
+-0.0861558 0.100815 0.00240792
+0.0184724 0.0934238 0.0476306
+-0.000245612 0.0350857 0.0144067
+-0.0547132 0.153591 0.0213081
+0.0445999 0.0931357 0.00219092
+-0.0649995 0.134056 -0.00807462
+-0.0360819 0.0351453 0.0214963
+0.0444988 0.0569914 0.0320977
+-0.0597101 0.0723346 -0.0163812
+-0.0468406 0.0985145 -0.021833
+-0.0397006 0.0666136 -0.0148744
+-0.0847301 0.0966436 -0.00257686
+-0.00176079 0.0741065 -0.0358743
+-0.0671962 0.0736816 0.0379285
+-0.0347085 0.169768 -0.00115359
+-0.0213445 0.0916844 -0.035421
+-0.0625559 0.150623 -0.0205762
+0.055585 0.0535517 0.00220948
+-0.0136228 0.128915 0.00609854
+-0.0654189 0.16417 -0.0217177
+-0.0613445 0.0434338 0.042412
+-0.0144732 0.096429 0.0522087
+-0.0707666 0.171245 -0.0323024
+-0.0713393 0.134067 0.0496215
+-0.0458732 0.104238 -0.0208285
+-0.0551833 0.07213 0.0401196
+0.0364832 0.0422343 0.0281778
+-0.0336503 0.0577563 -0.0112696
+-0.0810791 0.117571 0.0486733
+0.044724 0.0588042 -0.00496063
+-0.0568258 0.120959 -0.0097287
+-0.0257724 0.0797722 -0.0374309
+-0.0800654 0.121688 0.0502425
+-0.0569634 0.0335771 0.00964709
+-0.00939357 0.0354504 -0.0173725
+0.046214 0.0637709 -0.0019104
+0.00900714 0.0383394 0.0314785
+0.0457806 0.0890199 0.00717609
+-0.0524951 0.0747684 0.0423102
+0.0334058 0.0446363 -0.00548551
+-0.063072 0.0346346 0.0391063
+0.0073001 0.0907939 -0.0322622
+0.026147 0.0875952 0.0467145
+0.0130004 0.0419341 0.0448362
+0.0263999 0.0348437 0.0163952
+-0.0056357 0.0466988 -0.0297075
+-0.000747471 0.0987058 -0.0265343
+-0.0688283 0.0966095 -0.0161149
+0.00300687 0.0991424 0.049182
+-0.0154864 0.0814755 0.0571167
+-0.074497 0.120396 0.0533632
+-0.0748436 0.114924 -0.0060803
+-0.0168418 0.107354 -0.0217003
+-0.0459377 0.145792 0.000601046
+-0.0487849 0.0715634 0.0402545
+-0.0581679 0.154986 0.022946
+0.044397 0.0945546 0.0171571
+-0.0810292 0.0940061 0.0336494
+0.032953 0.0994589 0.0373001
+-0.0181454 0.0347978 0.0451006
+-0.0487902 0.0855221 -0.0217064
+-0.0776336 0.147268 -0.0038625
+-0.0891133 0.14743 0.0101992
+0.0134061 0.0767276 0.0545687
+-0.0451757 0.14769 0.00639824
+0.0340849 0.114614 0.00225198
+-0.0494981 0.105619 0.0396922
+-0.0291786 0.175627 -0.0167894
+0.0516271 0.0736236 0.0155669
+-0.0333156 0.0365169 -0.0174853
+-0.00225297 0.0388793 -0.00041461
+-0.0884617 0.14585 0.0310303
+-0.087958 0.12395 0.000268768
+-0.0637456 0.154158 0.00252195
+-0.0680618 0.0606588 0.013756
+0.00946449 0.0616923 0.0540126
+-0.00707285 0.12974 0.0027455
+-0.0190315 0.0389958 0.035931
+-0.00971778 0.0670387 -0.0360005
+0.0406669 0.102735 -0.000789188
+-0.085128 0.0845897 0.0244984
+0.00248558 0.111415 0.0422707
+0.00320889 0.0824712 -0.0345101
+-0.0467495 0.117966 -0.0147678
+0.0250223 0.110364 -0.0129553
+-0.044347 0.146755 0.000226372
+-0.0616655 0.144455 -0.00523057
+0.000474346 0.0977989 0.0522897
+0.0207702 0.036271 0.0339301
+0.0400498 0.0387801 0.0063192
+-0.0199993 0.185902 -0.0200623
+0.018427 0.0917703 -0.0251723
+-0.0354635 0.0860418 0.0431394
+-0.0475855 0.0518372 -0.00929506
+0.0429858 0.0691484 -0.00178958
+-0.0244489 0.052187 0.0413714
+-0.0500639 0.141673 0.0143962
+0.0144323 0.129298 0.0192627
+-0.0561449 0.04824 0.0383427
+0.0358665 0.0404526 0.0260172
+-0.0213253 0.0444675 0.0531428
+-0.0609289 0.112535 -0.0147528
+-0.0699845 0.139935 -0.00772138
+-0.0748631 0.106362 -0.00967707
+-0.0346028 0.0344648 0.0366099
+-0.0425153 0.118993 -0.0138741
+0.0153464 0.0537553 -0.0279934
+-0.0719831 0.170733 -0.0298702
+0.0460203 0.0848226 0.00718276
+-0.0760167 0.15688 -0.0219252
+-0.010059 0.109235 -0.0217082
+0.0010095 0.0346721 0.0439005
+-0.0198215 0.0841085 -0.0387066
+-0.020574 0.115387 -0.0161841
+-0.00203672 0.0345877 -0.0169988
+-0.0424883 0.0846004 0.0426298
+-0.0313435 0.0707327 -0.0274782
+-0.0490828 0.13552 0.0213898
+-0.0481015 0.157608 -0.00698963
+-0.0579692 0.0408152 0.0462221
+-0.0682257 0.127075 0.0505767
+-0.0434944 0.0733818 0.0425428
+-0.0905017 0.114314 0.0223543
+0.0242723 0.0647548 -0.0237835
+0.050682 0.0731977 0.010749
+0.0604945 0.0595549 0.015166
+-0.0490636 0.126668 -0.00583208
+0.00647697 0.0459611 0.0484012
+0.0279051 0.0395203 0.0288639
+-0.0314585 0.0335695 -0.0237257
+-0.0485262 0.0344313 0.0301756
+-0.0386172 0.0505956 -0.0110053
+-0.000657388 0.0511382 -0.0308268
+-0.0630072 0.0689485 0.0358468
+0.0316541 0.0351286 0.0116939
+-0.0517065 0.163863 0.00241874
+-0.0634695 0.0445577 0.0356919
+-0.0832566 0.147367 0.0370632
+0.02323 0.0762417 -0.0259573
+-0.0735922 0.0833012 0.0392631
+-0.00431736 0.130694 0.00665461
+-0.021599 0.0382532 0.00358087
+0.0465019 0.0778624 0.0111839
+0.0604451 0.0678689 0.0141533
+0.0213931 0.0489728 -0.0223035
+-0.0630692 0.153725 -0.0105955
+-0.0236572 0.0507797 -0.028024
+0.00430293 0.0625774 -0.0325544
+0.0421362 0.0845969 0.0293292
+0.010951 0.0562864 0.05258
+0.0369412 0.107321 0.0271722
+0.0502975 0.0560957 -0.00457555
+0.0410804 0.10284 0.0191681
+0.0102664 0.0739304 0.0552835
+-0.0397448 0.172952 -0.00234724
+-0.0829232 0.125068 -0.00442148
+-0.0284893 0.0903534 -0.0305816
+-0.0616586 0.172539 -0.056588
+0.0182369 0.0749953 -0.0283712
+-0.0168303 0.0382802 0.00815469
+0.0453551 0.0805854 0.0221747
+-0.0718567 0.0701514 0.0311867
+-0.0814119 0.152728 0.0295837
+0.0555021 0.0730293 0.0140468
+0.00650419 0.123782 0.0339598
+0.0422452 0.0986357 -0.000817871
+-0.072904 0.112135 -0.00834183
+-0.00786498 0.13001 0.00533674
+-0.0614753 0.15686 -0.0265876
+-0.0234913 0.103006 0.0434545
+-0.0093342 0.174192 -0.0247468
+0.048187 0.0717514 0.00605259
+-0.0554773 0.0820103 0.045038
+-0.091005 0.124034 0.00628346
+-0.0147917 0.0951887 -0.0329173
+-0.00125147 0.122854 0.0353
+-0.017497 0.0485942 0.047882
+0.0194854 0.0989751 0.0466096
+-0.0889579 0.0901579 0.00845534
+-0.065396 0.0605193 0.0180241
+-0.0469507 0.168415 -0.00396135
+0.0205156 0.111203 0.0377036
+-0.0928924 0.122885 0.0362699
+0.0213879 0.0686569 0.0484685
+0.0214143 0.0463213 0.0412437
+0.00882931 0.0373958 0.0286749
+0.0465562 0.0764652 0.0121829
+-0.0618529 0.153757 -0.0195806
+-0.0262234 0.119963 0.0294562
+-0.0354913 0.0889091 0.0432238
+0.037993 0.109314 0.0194453
+-0.0377299 0.0739307 -0.0178742
+-0.0184902 0.0815159 0.0575038
+-0.0314396 0.0637247 -0.0204391
+-0.0825513 0.110697 0.0307352
+-0.0728404 0.156111 0.0119063
+-0.0663982 0.164105 -0.0192035
+0.0062922 0.0654161 -0.0325779
+-0.0624759 0.0959475 0.043683
+-0.033686 0.0637452 -0.0146972
+0.0353693 0.102677 -0.0107148
+-0.0710479 0.166372 -0.0194754
+-0.059243 0.0367531 0.0461369
+-0.0908243 0.114994 0.023547
+-0.0650258 0.156351 -0.0487028
+-0.034444 0.159452 0.00265373
+0.0357616 0.0967769 -0.0118087
+0.044965 0.0903773 0.0181662
+0.0498767 0.0734333 0.0134213
+-0.031608 0.0496402 -0.0193495
+0.0404724 0.0408436 0.0229665
+-0.0473115 0.134637 0.0112388
+0.00743122 0.0352845 0.0446812
+-0.0297131 0.0509006 -0.0193584
+-0.0241845 0.177125 -0.0200954
+-0.0632603 0.157387 -0.0151607
+-0.0598965 0.0343774 0.0365453
+-0.0242309 0.0382399 0.0265535
+0.0433792 0.0972945 0.00218055
+-0.00691412 0.124317 0.0332409
+0.00451269 0.0561377 0.0533474
+-0.00250438 0.0842991 0.0575402
+-0.0903673 0.145762 0.0273033
+-0.0523714 0.143148 0.0193902
+0.0362345 0.0967824 0.0350211
+0.0264539 0.106068 0.0383874
+-0.0729303 0.131104 -0.00814819
+0.0116228 0.130194 0.0054038
+-0.0409771 0.113795 -0.0164017
+-0.0828306 0.150071 0.00319212
+-0.0676468 0.0338307 -0.00583252
+-0.0857374 0.0792227 0.0125087
+-0.0651015 0.0410328 0.0295625
+-0.0136795 0.0987823 0.0477955
+0.0258821 0.0794179 -0.0243188
+0.0449394 0.0734628 0.0226146
+-0.0694849 0.173671 -0.0550315
+0.0142482 0.127965 9.03059e-05
+0.0564285 0.0727253 0.0143999
+-0.0172735 0.180097 -0.0253788
+-0.0699136 0.162391 -0.0489495
+-0.09118 0.143373 0.022161
+-0.0644984 0.100116 0.0422372
+-0.0564709 0.0847764 0.0446514
+-0.043754 0.152254 -0.00662286
+-0.0547181 0.0708998 -0.0155975
+-0.0401471 0.163848 0.00326215
+-0.0814342 0.154656 0.0132857
+-0.0513196 0.0514695 0.0138904
+0.00680734 0.129132 0.0265205
+-0.0614938 0.0959769 0.0438595
+-0.0091676 0.171172 -0.0227371
+-0.0769695 0.154154 -0.0139015
+-0.0502302 0.126885 0.0326315
+0.00555777 0.034446 -0.000384949
+-0.0206136 0.0379294 -0.0283016
+0.00719386 0.0810104 -0.0336874
+0.0390033 0.0387188 0.0172773
+-0.0737727 0.0928414 0.040556
+-0.0829975 0.0763193 0.0155222
+0.0461381 0.0792322 0.00519228
+0.0313444 0.106098 0.0349666
+-0.0157326 0.0383302 0.0246146
+-0.0739329 0.072514 0.0322154
+-0.0287063 0.168278 -0.00832187
+-0.02709 0.0386639 -0.0126398
+-0.0689895 0.156345 -0.00130196
+-0.0622523 0.152181 -0.0215758
+-0.0408691 0.158042 0.00401656
+-0.0324935 0.0903869 0.0442776
+0.0156162 0.0904755 -0.0278196
+0.00543406 0.120555 -0.0138758
+-0.0874054 0.110457 0.012344
+-0.0534973 0.0903982 0.0447559
+-0.0007305 0.0683317 -0.0340878
+-0.0847135 0.152577 0.00925173
+0.0453586 0.0547792 -0.00610681
+-0.0513173 0.146268 0.0144074
+0.0146587 0.125796 -0.00358107
+-0.0790281 0.166651 -0.0329632
+-0.0519257 0.0563169 0.0201359
+-0.0206011 0.0382174 0.00381729
+-0.0499923 0.0342577 0.028256
+0.0222487 0.0365239 0.0303911
+-0.0762222 0.0981393 0.0371985
+-0.0381245 0.162196 -0.0129852
+-0.0462852 0.149202 0.00834502
+0.039774 0.0618507 -0.00575724
+0.0461841 0.0778325 0.00618859
+-0.0770439 0.154813 -0.0101321
+-0.0615001 0.152383 0.000341367
+-0.0665808 0.0334125 0.000644743
+-0.0212653 0.0381372 0.0218515
+-0.071123 0.111741 0.0467572
+-0.0265438 0.177186 -0.00862049
+-0.0523481 0.125498 -0.00654313
+-0.0522635 0.0343446 0.0312176
+0.0191745 0.060499 0.0487078
+-0.0855607 0.111744 0.0263451
+-0.0360977 0.156596 0.00383263
+-0.0479431 0.0356599 -0.0132734
+0.0366613 0.0821332 0.0372523
+-0.0478798 0.107016 -0.0192852
+-0.0356524 0.0460406 0.0421919
+0.00919662 0.0865327 -0.0319845
+-0.0808705 0.11922 -0.0043482
+-0.0335583 0.116878 -0.0136466
+-0.0112898 0.0395292 0.0388441
+-0.0194927 0.0814879 0.0571676
+0.0239403 0.124821 0.0127882
+-0.0444942 0.105717 0.0408954
+-0.0484929 0.162245 0.00645185
+-0.00849807 0.0801615 0.0580203
+-0.0487025 0.121311 -0.0122547
+0.00400584 0.0386131 0.0458842
+-0.00449485 0.0488681 0.0504112
+-0.0507263 0.122615 0.0336033
+-0.0801811 0.108648 -0.00360377
+0.029758 0.0352966 0.00556049
+-0.0236293 0.0665652 0.045154
+0.0470549 0.0602552 -0.00440662
+-0.059554 0.155543 0.0209921
+-0.00550703 0.0787847 0.0579843
+-0.0451509 0.0424209 -0.0143059
+-0.0674032 0.144345 -0.0161484
+-0.0621766 0.125515 0.0434733
+-0.0885651 0.0963045 0.0227197
+-0.0623911 0.154382 0.0301734
+-0.078298 0.0745267 0.0278337
+0.00377395 0.13125 0.00536065
+-0.0351573 0.0361738 0.0471926
+-0.0517432 0.0487299 0.0143843
+-0.0578034 0.0854472 -0.0211977
+0.0151488 0.10026 -0.0226403
+0.0225321 0.104677 0.0415312
+-0.0605798 0.155686 0.00466574
+-0.0891628 0.0942977 0.0214104
+0.0393896 0.106975 0.00316583
+0.00351619 0.0800296 0.056385
+0.0405703 0.105644 0.0131657
+-0.0507419 0.0753249 -0.0179378
+0.0269605 0.111014 -0.0116501
+0.0303852 0.098223 0.0405823
+0.0431361 0.0419917 0.0224684
+-0.0738026 0.1492 0.0397758
+-0.0725455 0.148857 -0.0337299
+-0.072371 0.0860632 0.0407672
+0.0158441 0.0475203 0.043749
+0.0104341 0.0346525 0.0368683
+0.0344146 0.0399125 -0.00185272
+-0.0764595 0.111219 0.0459768
+0.042138 0.101461 0.00217211
+-0.0213522 0.127058 0.00761225
+-0.0556879 0.0677603 -0.0123408
+0.00811587 0.129858 0.0241077
+-0.0637641 0.044271 -0.0022694
+-0.0104962 0.0897854 0.05669
+-0.0147283 0.0657495 -0.0376113
+-0.0881508 0.144556 0.0335371
+-0.0807759 0.0773963 -0.00349851
+-0.0388999 0.0345526 0.0391301
+0.0239365 0.0972468 -0.020928
+-0.0559996 0.126683 -0.00642409
+0.015329 0.118191 -0.013375
+-0.0894904 0.112329 0.0187618
+-0.0771865 0.153815 0.000183792
+0.00297917 0.0389607 -0.010651
+-0.0571826 0.122684 0.0401181
+0.0453844 0.091806 0.0121583
+-0.0908751 0.135104 0.0182068
+0.0216273 0.125269 0.00337714
+0.0572674 0.0722428 0.0147076
+-0.0417782 0.0473939 -0.012205
+-0.0658407 0.0938498 -0.0179236
+0.0102801 0.12364 -0.00922404
+0.00517588 0.113065 -0.0197995
+0.0139965 0.0343089 -0.00230394
+-0.0757024 0.160453 -0.0116926
+-0.0694905 0.10551 0.0380162
+0.0123252 0.0595168 -0.0292981
+0.00242842 0.0916453 -0.033159
+0.0363451 0.0519755 -0.00662669
+-0.0899083 0.121615 0.0458595
+-0.0569713 0.125238 -0.00711806
+-0.0616474 0.0458147 0.0384356
+-0.0816857 0.104685 0.0297488
+0.0417455 0.0760505 -0.00673474
+-0.0249373 0.175681 -0.0116247
+0.0233583 0.0592365 -0.0255115
+0.0296356 0.107455 0.0360045
+-0.0171544 0.0383178 0.00624466
+-0.0338857 0.12324 -0.00632922
+-0.0295434 0.168268 -0.00777595
+0.0237606 0.105983 -0.0162548
+-0.0636907 0.124164 0.0466174
+0.0299589 0.119939 0.0150519
+0.0387947 0.101959 0.0281808
+0.0346979 0.108688 0.0292348
+-0.00481267 0.108148 -0.0225124
+-0.0921162 0.126957 0.038246
+-0.0708767 0.0346286 -0.00100073
+-0.0434981 0.0803632 0.0422528
+-0.00776303 0.0742012 -0.03739
+-0.0164203 0.103082 -0.0232082
+-0.0368601 0.0336856 -0.0211611
+-0.0794788 0.13585 0.0504167
+-0.0622192 0.166249 -0.0495907
+-0.0632785 0.0347611 0.0232648
+-0.0678048 0.17421 -0.0455841
+-0.0292876 0.113893 -0.0165575
+-0.0116236 0.0451107 -0.0281433
+-0.0853661 0.0910995 0.0281927
+0.0152572 0.124805 0.0295869
+-0.0730257 0.141351 -0.00730576
+-0.0694123 0.111827 0.045291
+-0.048008 0.0642705 0.0370013
+-0.000600787 0.0405329 -0.0249772
+-0.0932444 0.124186 0.027283
+-0.050904 0.119772 0.0333476
+-0.00274076 0.0726647 -0.0356738
+-0.0635974 0.151927 -0.0324488
+0.025021 0.085012 -0.0240764
+-0.0749218 0.0661459 0.00857247
+0.0115292 0.119123 0.0361473
+0.0363972 0.0461521 -0.00588406
+0.0385505 0.0378908 0.0124577
+-0.0599745 0.14101 0.03437
+0.00637279 0.049483 -0.0283693
+-0.0896361 0.0969931 0.0144152
+0.0291455 0.0491758 0.0366259
+-0.013551 0.0588296 0.0525443
+-0.0381244 0.127641 0.0146907
+-0.00888364 0.107351 -0.0226177
+-0.0497129 0.165582 0.00102101
+0.0449595 0.0889486 0.000172046
+-0.0339085 0.177047 -0.0109944
+-0.0278445 0.0535534 0.0370258
+-0.0334735 0.0337737 0.0142583
+-0.0926366 0.121498 0.0312794
+-0.0298476 0.105726 -0.0219826
+-0.0771466 0.113816 0.049094
+0.0166749 0.0347919 -0.00596505
+-0.0767718 0.0716181 -0.00247133
+-0.0788159 0.0818529 0.0346403
+-0.0751616 0.0715622 0.0292788
+-0.0629391 0.12384 -0.00881569
+0.0155707 0.100538 -0.0224673
+0.0252284 0.116758 -0.00782512
+0.00112155 0.035712 0.0195623
+-0.0623204 0.0448503 0.0109236
+0.0577561 0.0565381 0.00419435
+-0.000697034 0.0626894 -0.03411
+-0.0739419 0.129646 -0.00820737
+-0.0552142 0.155428 0.0123927
+-0.0749344 0.128178 -0.00819506
+0.0183304 0.0579992 -0.0277502
+-0.0259227 0.123138 -0.0042558
+0.0130981 0.124462 0.0316831
+-0.0723893 0.172498 -0.0357772
+-0.015947 0.124632 0.0285893
+-0.0583387 0.0706756 0.0389009
+-0.0347052 0.0384254 -0.0102399
+-0.0149752 0.125602 0.0274605
+-0.0153278 0.0389782 0.0349161
+-0.0482032 0.131003 0.0267578
+0.0538412 0.0539826 0.0267309
+-0.0845696 0.12714 0.0502672
+0.0343613 0.111866 -0.00251995
+-0.0679623 0.16261 -0.0140168
+0.0251056 0.0902557 0.0469821
+-0.0373144 0.033633 0.00457247
+0.00149673 0.110036 0.0425823
+-0.0886162 0.100967 0.00940891
+-0.0734724 0.155984 0.0233451
+0.00740252 0.0402134 0.0455033
+0.0454345 0.0918112 0.0111626
+0.0252284 0.0420597 0.0372934
+0.026048 0.117275 -0.00637096
+-0.0768401 0.178514 -0.0509284
+-0.0719676 0.138437 -0.00730592
+0.00750673 0.0758763 0.0563548
+-0.0485658 0.0404434 -0.0115683
+-0.0402074 0.168164 -0.0113973
+-0.044494 0.0987314 0.042632
+-0.0530679 0.140053 0.026392
+0.0521064 0.0510719 0.0259326
+-0.0545309 0.0352136 0.0455493
+-0.0717133 0.0715245 -0.00752229
+-0.0899797 0.128138 0.00527223
+0.0045004 0.121001 0.0358516
+-0.0641393 0.143504 -0.0105249
+-0.0769685 0.156212 -0.0102521
+-0.0645952 0.155196 -0.0084031
+0.0323835 0.0460752 0.0307026
+-0.023205 0.178608 -0.0204967
+-0.042033 0.113762 -0.0163433
+-0.0512269 0.150712 0.0135153
+0.00120164 0.0839391 -0.0353946
+0.0300054 0.104778 0.0365239
+-0.00649214 0.0965537 0.0536631
+-0.0289152 0.0846603 -0.0346291
+0.0207024 0.0373647 0.039246
+-0.0386568 0.0577511 -0.0111914
+-0.0605191 0.153857 0.0308432
+0.0410047 0.0395957 0.0043142
+-0.0837262 0.151367 0.00522149
+-0.0378805 0.108506 -0.019759
+-0.0169176 0.183111 -0.0193016
+-0.0614849 0.0946016 0.0445824
+0.0332816 0.116574 0.0106008
+-0.0378618 0.101418 -0.0215553
+0.0383745 0.038179 0.01581
+0.010493 0.111264 0.0393941
+0.0353685 0.0600237 -0.0127796
+-0.0203175 0.0933679 0.052311
+-0.0434938 0.0619471 0.0402773
+-0.0393599 0.0418158 -0.0263353
+-0.0588856 0.105471 -0.0181522
+-0.0278953 0.124828 0.00229374
+-0.0894349 0.136561 0.0381888
+-0.0455406 0.124353 -0.00945534
+-0.0850289 0.111596 0.00326083
+0.01399 0.106595 -0.01887
+-0.0765357 0.0692333 0.0204809
+-0.0741239 0.165568 -0.0191297
+-0.056116 0.131133 0.036427
+-0.0715838 0.158191 -0.0409255
+-0.077037 0.111295 -0.0046823
+-0.0135016 0.0573891 0.0517499
+0.0374899 0.0469458 0.0313688
+-0.0297919 0.108873 -0.0192723
+-0.0616758 0.113831 0.0370124
+-0.0157188 0.0628375 -0.0366012
+-0.0879795 0.148554 0.029057
+-0.0890892 0.0955882 0.00942496
+-0.0709327 0.178806 -0.0496057
+0.0454967 0.0611109 0.0306935
+0.0193158 0.0835035 0.0508805
+0.000580692 0.131584 0.0113306
+-0.0615895 0.155312 -0.0215829
+-0.0134922 0.122339 0.0335983
+0.0458248 0.0806172 0.0201703
+-0.0225646 0.0983245 -0.0242201
+-0.0682478 0.066271 0.0282875
+0.0302092 0.117283 0.0265434
+-0.0829482 0.128017 -0.00457928
+-0.0715343 0.141411 0.0464325
+-0.0800761 0.0936246 -0.00957758
+-0.0851808 0.153525 0.0149377
+-0.0865771 0.124349 0.048115
+-0.0221188 0.100222 -0.0241961
+0.0224909 0.111137 0.037371
+0.00736705 0.0494733 -0.028237
+0.0432386 0.0750761 0.0273062
+-0.0564476 0.153922 0.0264803
+-0.0288608 0.0448354 -0.0281934
+-0.0776003 0.156937 -0.0149108
+-0.0784376 0.171472 -0.0389273
+-0.0178474 0.12806 0.016159
+-0.0284556 0.0472262 0.0488083
+-0.0677451 0.0629578 0.0224748
+-0.0567391 0.0576068 -0.000420382
+-0.0769537 0.132513 -0.00657383
+-0.0837476 0.0952109 -0.00455405
+-0.0427254 0.0358312 -0.0275925
+0.00623069 0.0782309 -0.0341321
+-0.0758642 0.117897 -0.00698249
+-0.0903736 0.13787 0.0221843
+-0.027962 0.155009 -0.00579987
+-0.0193391 0.0386082 -0.00732295
+-0.0237931 0.0698259 -0.0366341
+-0.015124 0.037267 -0.0266656
+0.0113671 0.0479427 -0.0268055
+0.0141489 0.0347135 0.0249225
+-0.0669549 0.160975 -0.0568649
+0.0208979 0.0359371 0.0087849
+-0.0570669 0.0493259 -0.00137722
+-0.0186112 0.0386738 -0.00909396
+-0.0055195 0.0443362 0.047543
+-0.0714237 0.153981 -0.0448933
+0.0119572 0.125728 -0.00550935
+-0.0310683 0.0679104 -0.0254551
+0.0514754 0.0531199 -0.00283685
+0.0135274 0.12988 0.0160733
+-0.0728856 0.148047 -0.0249504
+-0.0233454 0.122752 0.0259903
+-0.0578948 0.0983776 -0.0200563
+-0.0203263 0.0825295 0.0568715
+-0.0643532 0.142586 -0.00864957
+-0.0793976 0.151048 0.0347829
+0.0356609 0.104701 0.030636
+0.0063888 0.115364 -0.0182909
+-0.0289964 0.0383539 -0.00532847
+-0.0834239 0.0965619 -0.00458039
+0.019508 0.109842 0.0390589
+-0.0767379 0.10491 0.0348158
+-0.0825915 0.143398 0.0421649
+0.0182147 0.0834619 -0.0281698
+-0.0633435 0.060722 0.00207171
+0.0428335 0.076148 -0.00478426
+-0.0724349 0.0644357 0.0131399
+-0.0114637 0.165492 -0.0149909
+-0.0493961 0.033823 0.00737414
+0.0502518 0.0446339 0.0182039
+-0.0439305 0.0432632 0.0429545
+-0.0713305 0.0628284 0.00935991
+-0.0276378 0.158958 -0.0125395
+0.0600492 0.0581198 0.0161748
+0.00134506 0.0511101 -0.0304682
+-0.0692332 0.158118 -0.0519432
+-0.0133594 0.127978 0.0236019
+0.0292021 0.0619142 0.0421314
+-0.0667582 0.180263 -0.0553199
+-0.0197539 0.0671131 -0.0375162
+-0.0704746 0.040884 0.00781861
+-0.049499 0.112564 0.0357174
+-0.0322502 0.0367926 -0.0305484
+-0.00789583 0.129197 0.00105287
+-0.016169 0.117727 -0.0146898
+0.0295964 0.0580473 -0.0178274
+-0.0883598 0.0874311 0.00547496
+-0.0274913 0.101587 0.0432231
+-0.0768992 0.155831 0.0192356
+-0.0364902 0.0634253 0.0412069
+-0.0388025 0.125966 -0.00521606
+0.0196905 0.0550135 0.047657
+0.0571135 0.071717 0.0176058
+-0.0064991 0.0952675 0.0547927
+0.0174901 0.0346463 0.0220409
+-0.0024963 0.10305 0.0439671
+-0.0184804 0.0543192 0.0487134
+-0.0334418 0.0335662 -0.0297364
+-0.0620472 0.176838 -0.0608311
+-0.0308715 0.0522855 0.0371048
+-0.0367079 0.0695483 -0.0163464
+0.0158791 0.123986 0.0298499
+-0.0320536 0.0356449 0.0500425
+-0.0493943 0.14168 0.0103932
+-0.0558858 0.106922 -0.0182628
+0.059454 0.0647075 0.0208869
+0.0152596 0.125955 0.0281714
+0.038478 0.0980354 0.0312187
+-0.0744916 0.146991 0.0423999
+-0.0846211 0.0992422 0.0286106
+-0.0661191 0.156294 0.0171964
+-0.0794888 0.111206 0.0453002
+0.00519891 0.0880579 -0.0334439
+0.0153315 0.0346194 -0.0136599
+0.0395267 0.0632302 -0.00776648
+-0.0463407 0.0629206 0.0382092
+-0.0514201 0.121192 0.0343754
+-0.0528867 0.0334295 0.0213081
+-0.062446 0.163101 -0.0455941
+-0.0770308 0.167319 -0.027484
+-0.041999 0.126936 -0.00419358
+0.0289857 0.090239 0.0438092
+-0.0634397 0.158343 -0.0445972
+0.00692319 0.0630369 0.0555875
+-0.0294344 0.0381755 0.00387704
+0.0228628 0.0351973 0.0171792
+-0.0738758 0.0993275 -0.0132564
+-0.0668982 0.151542 -0.0415298
+-0.0629724 0.133897 0.038809
+-0.0928035 0.121507 0.0322842
+0.0305387 0.0609912 -0.0187852
+0.0385799 0.0739884 0.0346445
+-0.0814052 0.08555 -0.00656718
+-0.0621323 0.0602572 0.0206983
+-0.0294013 0.0804353 -0.034602
+0.0164763 0.0348375 -0.0136598
+-0.0659203 0.122383 -0.00896938
+-0.0328324 0.0929676 -0.0240794
+0.000521824 0.0801146 0.0573693
+0.0221547 0.0979182 -0.0216266
+-0.0649149 0.0392337 0.0390271
+0.0351689 0.0928995 0.0387113
+-0.0125327 0.0502379 0.050201
+-0.05553 0.12546 -0.00656458
+0.0330446 0.111446 -0.00610948
+0.0255618 0.120425 0.027665
+-0.0243325 0.126263 0.00798048
+-0.0654853 0.0944999 0.0429585
+-0.0478356 0.0970782 -0.0220591
+-0.0332116 0.0851655 -0.0254848
+0.00641089 0.036109 -0.0234066
+-0.0192798 0.0610993 0.0494354
+0.0363164 0.11089 0.0231265
+-0.0705311 0.0972485 0.0414142
+-0.0514267 0.135712 0.0273837
+-0.0564984 0.0918565 0.0453856
+-0.042499 0.113906 0.034677
+-0.0717955 0.156396 0.0195489
+-0.0215446 0.0942792 -0.0320343
+-0.0246821 0.177174 -0.0112336
+0.0177118 0.0944604 -0.0240064
+-0.0881735 0.15196 0.0139234
+-0.000296991 0.0392472 -0.00781836
+-0.00248723 0.115552 0.0407434
+-0.0147779 0.0756914 -0.0387415
+0.0503819 0.0717878 0.00597587
+-0.0396993 0.117276 -0.0140617
+-0.0628784 0.16149 -0.0515871
+-0.0769868 0.0713943 0.0255408
+-0.01852 0.115493 0.0376203
+-0.0632135 0.155458 0.00808821
+-0.0244921 0.103004 0.0433541
+-0.0392444 0.0481623 -0.0129943
+0.0317796 0.0647744 0.0406274
+-0.00516147 0.100957 0.0442706
+-0.0196118 0.040807 -0.0284935
+-0.0288146 0.0436325 0.0510094
+-0.0690473 0.0727409 0.0365464
+-0.0478629 0.125952 -0.00709772
+-0.0456346 0.123874 0.0250844
+-0.0214969 0.0498836 0.0466158
+0.0515378 0.0461489 0.00621743
+0.0472621 0.0627303 -0.00287883
+-0.0738666 0.0846755 0.0394915
+0.0247439 0.0490967 0.0390469
+0.0150281 0.097439 -0.0231662
+0.0456884 0.0904192 0.00716979
+0.0173787 0.046209 -0.0233857
+-0.00349533 0.123738 0.0342998
+-0.0905223 0.128294 0.0420009
+-0.0733752 0.0741466 0.034437
+-0.0106209 0.130105 0.0129711
+-0.0754549 0.158227 -0.0249553
+-0.0125993 0.0922824 -0.0359459
+-0.064348 0.0611447 0.0212332
+-0.0246221 0.0450443 -0.0281165
+-0.0383306 0.0379343 0.0437226
+-0.0423655 0.110099 -0.0185262
+-0.0750214 0.166563 -0.0400315
+-0.0338231 0.0915286 -0.0241849
+-0.0857793 0.088721 -0.000547834
+-0.00485752 0.103786 0.0439754
+-0.0334914 0.0960174 0.044365
+-0.040497 0.0705056 0.0418211
+0.0309495 0.065969 0.041175
+-0.0649024 0.119454 -0.00881631
+-0.0326689 0.0382268 0.0507498
+0.0366581 0.0727136 0.0371657
+0.0102886 0.13098 0.0134608
+0.0549839 0.0534895 0.00121219
+0.0229081 0.0608908 -0.0255785
+-0.0578484 0.0576892 0.00460939
+-0.0380707 0.123893 0.0251235
+0.0425051 0.049941 0.0324381
+-0.0208164 0.0797246 0.0560382
+-0.0600611 0.155861 0.0164593
+0.0128031 0.126304 -0.00413421
+0.0254584 0.0383883 -0.00303811
+-0.0782251 0.104799 0.0333593
+-0.011635 0.0466548 -0.0295721
+-0.0227746 0.0968676 -0.024693
+0.00330234 0.0626197 -0.0330565
+-0.00750217 0.0787518 0.0577101
+-0.043485 0.109867 0.0381531
+0.000280959 0.0655552 -0.0344559
+0.0303619 0.0982175 -0.0159971
+-0.0671228 0.150867 0.0375155
+-0.0251523 0.0635221 0.0411049
+-0.0732036 0.147141 -0.0198634
+-0.0403541 0.121097 -0.0120881
+0.0144177 0.0388354 -0.0218485
+-0.0912331 0.114706 0.0382141
+0.0261502 0.120654 0.0264581
+-0.0131682 0.0974746 0.0509922
+-0.0718669 0.115007 -0.00776782
+0.0425779 0.0929869 -0.00379718
+-0.0228308 0.0881946 -0.0369029
+-0.00860718 0.0361712 0.0494902
+-0.0685057 0.159542 -0.0539539
+-0.0864902 0.103559 0.00540359
+-0.0697818 0.16064 -0.00887941
+-0.05157 0.0657725 0.0357523
+0.036411 0.0430004 -0.00393346
+-0.0617308 0.0752409 -0.0175405
+-0.0384866 0.112537 0.0353486
+0.0446565 0.076299 -0.00080692
+-0.0444716 0.165339 -0.00887164
+0.0234256 0.0994865 0.0445818
+0.0411691 0.0899632 0.029736
+-0.0188353 0.12777 0.00853266
+-0.079023 0.172207 -0.0429929
+-0.0509196 0.141445 0.00173554
+-0.013506 0.0486161 0.0481837
+0.0193259 0.0665212 -0.0284749
+-0.0472913 0.128011 -0.00322004
+-0.0626481 0.167836 -0.0465871
+-0.0304696 0.0875178 0.0438182
+-0.0917743 0.120197 0.0434965
+-0.0648107 0.0617811 0.00082735
+0.000497836 0.114196 0.0414191
+0.0574118 0.0647963 0.00219725
+-0.0558676 0.0941545 -0.0217392
+-0.0336084 0.073768 -0.0234794
+0.00599322 0.131555 0.0161709
+0.00890036 0.0630937 0.0549611
+-0.062689 0.110949 0.0372761
+0.000505603 0.092515 0.0555251
+0.0223468 0.121292 -0.00473526
+-0.0486224 0.0562169 -0.0104362
+-0.00349838 0.0938964 0.0554871
+-0.0444734 0.111133 -0.0175908
+-0.0110869 0.111309 -0.0199045
+-0.0706182 0.161097 -0.00919138
+-0.0852334 0.0992128 0.0278144
+-0.0739196 0.15466 0.0290556
+0.0296062 0.0693912 -0.0207509
+-0.0310679 0.0435994 -0.0290446
+-0.0381696 0.0351458 0.0102677
+0.0601731 0.0664558 0.0181654
+-0.0779755 0.159708 -0.0199256
+-0.0656034 0.0619186 0.0220381
+-0.0875197 0.139142 0.00819442
+0.057949 0.0523838 0.0161799
+-0.0789979 0.165257 -0.0319521
+-0.0651299 0.139658 0.0409855
+-0.021445 0.0539977 0.0453008
+-0.0896519 0.136557 0.0371913
+-0.0534965 0.0890047 0.0449968
+-0.0534319 0.15708 0.0101259
+-0.0328837 0.0835575 -0.0275315
+-0.0164672 0.0659336 0.0534892
+-0.0354329 0.0383545 -0.00847377
+-0.0708675 0.102264 -0.0137609
+-0.023563 0.126621 0.00971624
+0.0103735 0.0460953 0.0463477
+-0.0660593 0.179544 -0.0550745
+-0.0527874 0.0854974 -0.0215293
+-0.0859388 0.0819759 0.019473
+0.0105508 0.12954 0.0235608
+-0.0103855 0.174149 -0.0227989
+-0.0669072 0.0448192 0.00702222
+-0.0284871 0.0932302 -0.0255941
+-0.0674877 0.041922 -0.00126982
+-0.0650925 0.142629 -0.00933509
+0.0420248 0.0845075 -0.00777453
+-0.0790747 0.0713835 0.0198308
+-0.0261077 0.0372445 -0.0185929
+-0.0370217 0.0410946 -0.0286549
+-0.0635554 0.166233 -0.0355972
+-0.0218769 0.105849 -0.0224625
+-0.0880158 0.125695 0.0466833
+-0.0621699 0.128298 0.0417254
+-0.0849635 0.115612 0.0476218
+-0.0132844 0.180127 -0.0228495
+-0.0282267 0.181005 -0.00798034
+-0.0312929 0.0665317 -0.0234435
+0.0182349 0.0355117 -0.0116753
+0.0151438 0.128336 0.0223847
+-0.0440686 0.0364096 0.0444754
+0.00518099 0.090879 -0.0329112
+-0.00712692 0.130239 0.0200248
+-0.00350074 0.0760658 0.0587997
+0.0285239 0.105924 -0.0141978
+-0.0560757 0.0486306 0.0102324
+-0.0647346 0.0751547 -0.0168067
+-0.0681413 0.163425 -0.0155251
+-0.0632877 0.151202 -0.0295741
+-0.0467953 0.0573798 0.0374139
+-0.0434795 0.10013 0.0422114
+0.0285718 0.0898068 -0.0210622
+0.0330592 0.116487 0.0176444
+-0.0241054 0.0348343 0.0490127
+-0.0124791 0.0354015 -0.0179384
+0.0405961 0.0624185 0.0297312
+-0.081387 0.11145 0.0446717
+0.00150869 0.0675259 0.0561223
+0.00629906 0.0381702 -0.0111411
+-0.0201579 0.171232 -0.0211109
+-0.0418025 0.1163 -0.0150397
+0.00651017 0.0786147 0.0558016
+-0.0940189 0.11877 0.0172997
+-0.0685972 0.0635876 0.000162346
+-0.0328398 0.0722904 -0.0244709
+-0.0455312 0.131052 0.00748081
+-0.023441 0.181825 -0.0105699
+0.0108694 0.130662 0.0179509
+0.0123886 0.0463398 -0.0252064
+-0.0652697 0.118619 0.0495916
+0.00206776 0.0348089 0.0386094
+-0.0298407 0.0705727 -0.0304857
+-0.0632339 0.164684 -0.0315914
+0.0353918 0.0491057 -0.00653987
+-0.0392946 0.123101 -0.0101877
+-0.0885378 0.137788 0.0102157
+-0.0234958 0.100256 0.0443804
+0.04037 0.0460545 -0.00454494
+-0.016752 0.0336597 -0.0246752
+0.0413281 0.0697537 0.029756
+-0.077268 0.161738 -0.0185704
+0.00995573 0.0897855 -0.0311748
+-0.0494127 0.0345257 0.0351696
+-0.00258654 0.0376582 -0.0251248
+-0.0538672 0.149311 0.025406
+0.0281029 0.0968693 0.0425418
+-0.0296256 0.0384042 -0.00919904
+-0.0659714 0.070335 0.0357803
+-0.0792849 0.109686 0.041215
+-0.0609581 0.142927 -0.00458074
+-0.064489 0.16418 -0.0242498
+-0.0585553 0.060477 0.023496
+-0.0851998 0.104954 0.024348
+0.0164098 0.126062 -0.00187701
+0.0235925 0.125057 0.0140956
+-0.00865281 0.123002 -0.0103525
+-0.0132305 0.174198 -0.0268981
+-0.0453894 0.130637 0.0193744
+0.0162761 0.0694793 -0.03005
+-0.0894525 0.128349 0.0437622
+-0.0562473 0.0708294 0.0392023
+0.0180456 0.044911 0.0433906
+-0.0626788 0.119898 0.0446407
+-0.0206698 0.116197 -0.0150314
+0.051506 0.0461707 0.0202521
+-0.0541367 0.13422 -0.00388726
+0.0303748 0.106409 -0.0127112
+0.0453408 0.0805541 0.00120995
+-0.00350137 0.0788045 0.0582113
+-0.052917 0.144693 0.0213981
+-0.0810085 0.136808 -0.00286908
+0.0435987 0.0482711 0.0311843
+-0.00549934 0.085642 0.0570911
+-0.0414264 0.125093 -0.00826982
+-0.0534716 0.0490986 0.0276613
+-0.0833044 0.10329 0.0285866
+-0.0394866 0.111153 0.0363447
+0.00954728 0.0389439 0.0451085
+-0.035694 0.0666325 -0.0153314
+-0.0301817 0.12316 -0.0042413
+-0.0383432 0.127011 0.0175779
+-0.0603252 0.0707596 0.0383929
+-0.0249438 0.0380891 0.0543244
+0.0144999 0.10985 0.0401157
+-0.0387789 0.0392857 0.0427431
+-0.0390181 0.126516 -0.0038056
+-0.0628844 0.116571 -0.0108779
+-0.0718222 0.0666154 0.0237319
+-0.0176233 0.0640054 0.0519373
+-0.0878362 0.112676 0.0422322
+-0.0661452 0.115702 0.0482687
+-0.0464951 0.116619 0.0318843
+-0.0501411 0.130626 -0.00198394
+-0.0497482 0.0767922 -0.0184367
+-0.0234881 0.0462034 0.0522022
+-0.0739006 0.162422 -0.0359639
+-0.0262017 0.0878115 0.0498853
+-0.0133444 0.0389099 -0.0138542
+0.040243 0.0970923 -0.00582991
+-0.011153 0.129981 0.0142184
+0.0309714 0.035145 0.0133989
+-0.0426252 0.0534503 -0.0112074
+-0.0538286 0.0338166 -0.0117099
+-0.0622047 0.0394245 0.0433885
+-0.0746849 0.14995 -0.0294029
+-0.0611865 0.0441212 -0.00432669
+-0.0182092 0.177147 -0.0243125
+0.0435018 0.0542009 0.0324922
+0.0364352 0.0371002 0.0145635
+-0.0321091 0.03378 0.0163326
+-0.0627516 0.145959 -0.00957815
+-0.0054968 0.061946 0.0559894
+-0.0738575 0.159643 -0.0319319
+-0.0640268 0.154208 0.0310565
+-0.0679826 0.0819454 0.0421862
+-0.0571357 0.158766 0.00595884
+0.0416081 0.101418 0.000182195
+-0.0235633 0.0565791 0.042552
+-0.0707052 0.0656331 -0.000502385
+0.0151645 0.126939 0.0266898
+0.0319146 0.0808971 0.042698
+0.0591439 0.0594194 0.00516163
+-0.0517306 0.164095 4.31123e-05
+-0.0802487 0.109228 0.032428
+-0.0124889 0.0964872 0.0522501
+0.0122905 0.06666 -0.0305971
+-0.00890819 0.0389895 -0.0111716
+-0.0414812 0.0634467 0.0412468
+0.0440882 0.090317 0.0231627
+-0.048759 0.14421 0.00252118
+-0.0240109 0.113853 -0.0165323
+-0.0863077 0.083293 0.0084931
+-0.0848578 0.117602 -0.00112226
+-0.0758939 0.107753 -0.00831552
+-0.0240922 0.0551393 0.0417051
+-0.048723 0.134043 0.0239744
+-0.075211 0.159631 -0.0279486
+-0.0458972 0.108476 -0.0187253
+-0.0827664 0.0789303 0.000509537
+-0.0413647 0.150284 -0.00509832
+0.00543597 0.131652 0.0145423
+-0.0567655 0.0797174 -0.020408
+-0.0314842 0.0875139 0.0436743
+-0.0272508 0.169746 -0.00972716
+-0.055503 0.0918468 0.0452512
+-0.0250407 0.11597 -0.0147569
+-0.0757456 0.155966 0.0196325
+0.0124869 0.0936385 0.0515089
+-0.0205861 0.122762 0.0284276
+-0.0807235 0.116228 0.0481624
+0.0260285 0.0450625 -0.0106845
+-0.0593728 0.0579489 0.0125735
+-0.049763 0.132774 0.0280532
+-0.0486523 0.128248 0.029602
+-0.0786364 0.0880738 -0.010561
+-0.0292743 0.157003 -0.0105584
+-0.0728269 0.0950692 -0.0149677
+-0.0571361 0.0333705 -0.00647115
+0.00471531 0.10507 -0.02128
+-0.0617504 0.158434 -0.0225881
+-0.044324 0.0573856 0.0392571
+-0.0231291 0.0608213 0.0434196
+-0.0736852 0.109489 0.0408578
+-0.0434867 0.102921 0.0416521
+-0.0745585 0.102629 0.0369846
+-0.00580621 0.0826794 -0.0377615
+-0.0293232 0.155967 -0.00892475
+-0.0785045 0.111148 0.0455755
+-0.0789041 0.126621 -0.00628203
+0.0387126 0.0984064 -0.00782785
+-0.00546749 0.0386155 0.00470576
+-0.00150095 0.0925253 0.0558525
+-0.0200678 0.0384268 0.0272406
+-0.0900294 0.114549 0.0240977
+-0.0775366 0.070359 0.00451989
+-0.0719896 0.139908 -0.00735583
+-0.0574975 0.0987515 0.0429871
+-0.0321271 0.107425 -0.0197503
+0.0188647 0.126347 0.0223312
+0.00641604 0.0962346 -0.0278978
+0.00311817 0.108714 -0.0201476
+-0.0160251 0.0375717 -0.0270066
+-0.0497158 0.140127 0.00540861
+-0.0603383 0.155998 0.00765284
+-0.0315045 0.100214 0.0434156
+-0.0865647 0.0978132 0.0263535
+0.030619 0.119354 0.0124235
+-0.0618449 0.153748 -0.0225793
+0.0357348 0.111877 0.0229152
+-0.0825172 0.108952 0.0273498
+-0.06497 0.156112 0.0234152
+-0.0141713 0.0391912 0.0511685
+0.0418096 0.0482673 0.0320498
+0.0293522 0.0768437 0.0442363
+-0.00664275 0.113752 -0.0185066
+-0.0339572 0.173519 -0.0141904
+-0.0868865 0.136539 0.0438118
+-0.0358508 0.0350331 0.0126434
+-0.0538363 0.0491492 0.0306601
+-0.0555251 0.040203 -0.0098178
+0.00654381 0.0340863 -0.0167284
+0.00392426 0.0984839 -0.0242888
+-0.0798351 0.078638 0.0310296
+-0.0520723 0.122646 0.0352105
+-0.0550812 0.153793 0.0226168
+0.014566 0.128157 0.000776346
+-0.0875094 0.103632 0.00838188
+0.0565843 0.0508466 0.00719292
+-0.0301736 0.0353405 0.0506988
+-0.054126 0.0491389 0.0369634
+-0.0213227 0.0927441 -0.0344661
+-0.0512299 0.133896 0.029412
+-0.0175551 0.0668893 0.0531861
+-0.0306537 0.125522 0.0174226
+0.00435638 0.0524337 -0.0297062
+-0.030037 0.0383331 -1.37538e-05
+-0.0748829 0.104948 -0.0102086
+0.0281452 0.12091 0.0214948
+-0.00129242 0.0339647 -0.0219341
+-0.0193753 0.114664 -0.0174341
+-0.0226586 0.185005 -0.0161016
+0.0333802 0.116202 0.0163348
+-0.0182505 0.0920203 0.0545129
+0.0291993 0.0821983 0.0440432
+0.040955 0.104188 0.00218636
+-0.0221399 0.16826 -0.0191908
+-0.0160775 0.128732 0.0124337
+-0.0494959 0.115246 0.0337414
+-0.0623926 0.155248 -0.0336012
+-0.0504873 0.0646576 0.0351978
+-0.0738463 0.114952 -0.00659368
+-0.0195012 0.0351765 0.0514244
+-0.0448823 0.107056 -0.0197924
+-0.0768765 0.119334 -0.00688293
+0.0107885 0.0345143 -0.0106366
+0.024237 0.0727429 0.0473317
+-0.00865103 0.0511695 -0.0319029
+-0.0877012 0.0963902 0.0247068
+-0.0518399 0.0559545 0.028629
+-0.00150749 0.0442279 0.0463824
+-0.066685 0.0361231 0.0351414
+-0.0298413 0.0511486 0.0404908
+-0.0104881 0.125079 0.0309157
+-0.0478366 0.0336224 0.000642732
+-0.0567073 0.152073 0.0307854
+-0.0772744 0.177812 -0.051035
+-0.0147745 0.0770701 -0.0384436
+-0.0929915 0.122891 0.0372721
+-0.0104786 0.116885 0.0389916
+0.0382147 0.0603208 -0.00873991
+-0.0754893 0.145614 0.0436847
+-0.0484504 0.134772 0.0211152
+0.013378 0.056283 0.0508299
+-0.00197361 0.0339973 -0.0202101
+0.0414332 0.100023 0.0231582
+0.0306311 0.076191 -0.0209647
+-0.0663516 0.155012 0.0287678
+-0.0710496 0.158811 -0.00499394
+-0.0554619 0.115432 0.0354757
+-0.0357408 0.0754574 -0.0191515
+0.000523827 0.0787529 0.057707
+-0.0189564 0.187079 -0.0195498
+-0.0849859 0.149949 0.0316738
+-0.0578691 0.0427244 -0.00751381
+-0.0739068 0.123785 -0.00803832
+-0.0355104 0.105608 0.0391036
+-0.0437169 0.0336921 -0.00956971
+0.0503986 0.0446075 0.0172106
+0.028338 0.0371627 0.023798
+-0.0835031 0.123045 0.0493423
+-0.051023 0.051637 0.0206282
+0.00799809 0.131294 0.0169006
+-0.0154642 0.0617228 0.0531313
+-0.0548148 0.0898539 -0.0222515
+0.0183688 0.0727072 0.0511848
+-0.0528816 0.143158 0.0234068
+0.0423208 0.0885482 0.027912
+-0.0489879 0.148715 -0.00337283
+0.0536516 0.0710277 0.00477709
+-0.0558317 0.154614 0.0193814
+-0.078074 0.0921324 -0.0116061
+-0.0138482 0.126055 -0.00351425
+-0.0484951 0.107035 0.0396855
+-0.0617568 0.113454 -0.0138737
+-0.0539631 0.0449066 0.021682
+-0.0323187 0.0763806 -0.0295323
+0.0441984 0.0917353 0.0221589
+-0.0830674 0.136771 -0.000769185
+-0.0741071 0.154101 -0.0239055
+-0.0686886 0.176906 -0.0487674
+-0.0561408 0.0460708 0.0131999
+-0.0685022 0.101419 0.0404594
+-0.0739688 0.0653923 0.0119616
+0.001175 0.0909253 -0.0339059
+0.0263146 0.0782009 0.0468843
+0.00192116 0.123969 -0.00948312
+-0.0587405 0.0737726 -0.0173801
+-0.0627949 0.167828 -0.0455908
+-0.0508006 0.0883889 -0.0215985
+-0.0481052 0.0559539 0.0359192
+0.0442623 0.0959503 0.0151546
+-0.0608758 0.0968112 -0.0186271
+-0.0345924 0.0485568 0.0396695
+-0.0618805 0.102572 -0.018381
+0.024797 0.0615121 -0.0241542
+0.0398079 0.0440192 0.0290809
+-0.0138249 0.0869198 -0.0385386
+-0.00950254 0.0801627 0.0580817
+-0.0893667 0.135016 0.00621309
+-0.0210328 0.0946153 0.0501685
+0.0124741 0.0347469 0.026362
+-0.0837947 0.100615 0.0291484
+-0.0677074 0.147127 -0.0273126
+-0.080936 0.0720826 0.0105433
+-0.0486367 0.0591511 -0.0114572
+-0.0856634 0.1104 0.0223511
+-0.0321401 0.16671 -0.0160336
+-0.0724955 0.174948 -0.0415233
+-0.0260317 0.0348457 -0.0200988
+-0.0274922 0.0497667 0.0454723
+-0.0394917 0.0534182 0.0393765
+0.0515114 0.0691441 0.0252354
+-0.0257438 0.12256 -0.00564443
+0.0437634 0.0832354 -0.00281017
+-0.0247629 0.0727034 -0.0370836
+-0.0655551 0.156269 0.0188465
+-0.0629848 0.136718 0.0370028
+0.0602499 0.0678328 0.0161531
+-0.0168173 0.0841632 -0.0392397
+-0.0683543 0.152019 -0.0462463
+-0.0567286 0.155485 0.0133042
+-0.0124895 0.119639 0.0367572
+-0.0620219 0.161552 -0.0385959
+-0.0485081 0.0504118 0.037253
+-0.0681426 0.159579 -0.055037
+-0.0339899 0.0738027 -0.0224777
+0.0187727 0.038419 -0.0166964
+-0.00951396 0.0647096 0.055646
+0.0373151 0.0659642 0.0362985
+-0.0697681 0.156742 -0.0499137
+-0.07512 0.161006 -0.0309706
+0.0445653 0.094573 0.0151616
+-0.0642545 0.154418 -0.039754
+0.0245051 0.108393 0.0385583
+-0.0423597 0.0337264 -0.0019814
+0.0111186 0.130773 0.0109156
+-0.0366056 0.0484481 -0.0142844
+-0.00762999 0.0387797 -0.0144679
+-0.0695561 0.0340783 0.00839793
+-0.0566909 0.0334951 0.00618234
+-0.0565711 0.159859 0.00306588
+0.000399482 0.0419381 -0.024642
+-0.0505546 0.0490872 0.0373101
+-0.0513639 0.0402537 0.0462611
+-0.0256858 0.0575487 -0.0293997
+-0.0524956 0.0890116 0.0451123
+0.044036 0.0973464 0.00517085
+-0.0774531 0.156901 -0.0199195
+0.0267966 0.0534918 0.0403155
+-0.0887231 0.0888754 0.0204484
+0.014348 0.0534071 0.0486823
+-0.0495075 0.0490436 0.0377607
+-0.0321324 0.154142 -0.000565596
+-0.0856354 0.143297 0.0395519
+-0.0344784 0.0932112 0.0445123
+-0.0688653 0.0860793 0.0429202
+-0.068567 0.167578 -0.0243154
+-0.0155024 0.084237 0.0568519
+-0.0768438 0.0975378 -0.0115852
+-0.054418 0.142404 0.0282888
+-0.00749562 0.091199 0.0567536
+0.0202715 0.077733 -0.0270961
+-0.0748613 0.102114 -0.0115761
+-0.0102609 0.0389601 -0.0132864
+-0.060805 0.0953608 -0.018741
+-0.0557308 0.0738305 -0.0174435
+-0.0789903 0.0900056 0.0359819
+0.0427074 0.0831548 -0.00579292
+-0.00549246 0.097843 0.0523265
+0.046038 0.0679968 0.0252834
+-0.0235521 0.116765 0.0343279
+0.0302394 0.0759037 -0.0212804
+-0.0212883 0.0638258 0.0471454
+0.0285217 0.0480557 -0.0127278
+-0.0326422 0.080708 -0.0295257
+-0.0545922 0.126915 0.0368606
+-0.07894 0.12954 -0.00577029
+-0.0871517 0.0874756 0.0234341
+0.0457525 0.0862068 0.0131643
+-0.0636848 0.163906 -0.0268361
+-0.01113 0.175691 -0.0290055
+-0.0644352 0.0424097 0.0302481
+0.00751322 0.0883379 0.0556646
+0.0450791 0.0411084 0.0144119
+-0.0801842 0.0990978 -0.00757647
+0.00942317 0.0752723 0.0558271
+-0.0720162 0.169175 -0.0255925
+-0.0706469 0.0749114 -0.0128891
+-0.0231537 0.124452 0.0216177
+-0.0354775 0.0932002 0.0444179
+-0.0467494 0.0782878 -0.0191673
+0.0402616 0.088708 0.0319407
+-0.0668021 0.0909191 -0.0174744
+-0.0798777 0.0922401 -0.00961163
+-0.00990791 0.168128 -0.0187599
+-0.0538472 0.144686 0.025416
+-0.0506923 0.0693793 -0.0143111
+-0.0628457 0.158366 -0.0406006
+-0.0472527 0.147738 0.00869118
+-0.0798492 0.140347 -0.0037915
+-0.0633595 0.155022 0.00583483
+0.0194938 0.0948135 0.0473832
+-0.0235952 0.03653 -0.0288249
+-0.0625329 0.155555 0.0257427
+-0.0293056 0.125075 0.00323421
+-0.0848075 0.100731 -0.000569426
+0.0362036 0.112389 0.0159326
+0.0148576 0.0726711 0.0531263
+-0.0648898 0.0353536 0.0257632
+-0.0225355 0.115413 0.0360839
+0.0344395 0.062733 -0.0148459
+-0.0404982 0.0548597 0.0396645
+0.0241838 0.0363666 0.0254891
+0.0185331 0.065881 0.0495848
+0.0124938 0.0589954 0.0513278
+0.00977817 0.131153 0.0118468
+0.0100829 0.0519948 0.0512903
+-0.0361503 0.127316 0.0154104
+-0.0482545 0.05323 0.0361705
+-0.0940988 0.124142 0.016266
+-0.0100812 0.168118 -0.0236136
+-0.00900002 0.1303 0.0121232
+0.044368 0.0832642 0.000211132
+-0.0417803 0.126317 0.0192991
+-0.0875576 0.0954908 0.0044419
+-0.0679508 0.168029 -0.055011
+-0.0131452 0.0346678 0.0462791
+0.00685606 0.0990064 -0.0228407
+0.0328304 0.0354201 0.0116657
+0.0278048 0.121695 0.017093
+0.0445188 0.0721805 0.0237826
+-0.0754994 0.115715 0.0515239
+-0.0115085 0.0815323 0.0578355
+-0.0530625 0.0625594 0.0307632
+-0.0510483 0.053037 0.0206135
+-0.0505791 0.0488657 -0.00826795
+-0.0426076 0.0338549 0.0069173
+0.0392521 0.0940728 0.0323259
+-0.0394892 0.0846821 0.0435801
+-0.0451321 0.0560164 0.0386443
+-0.00431394 0.0929621 -0.0345661
+-0.0559672 0.149602 0.0296453
+-0.0635672 0.159894 -0.0552656
+-0.0854828 0.0924603 0.0282645
+-0.000403311 0.102922 0.0441774
+-0.0728513 0.077742 0.0372898
+-0.0264927 0.0850795 0.0502634
+0.00748229 0.118415 -0.0155852
+-0.0301257 0.165235 -0.016018
+-0.00266679 0.0554838 -0.0324138
+0.0588141 0.0660698 0.0217199
+-0.0227042 0.0651451 0.0456598
+-0.0254758 0.0447668 0.0519525
+-0.0221249 0.165275 -0.017299
+-0.0673863 0.146352 -0.0244353
+0.0358297 0.112651 0.00431137
+-0.0600953 0.0345101 0.0398512
+-0.0315135 0.112545 0.0354646
+-0.0495533 0.0335732 0.00214603
+0.00748118 0.122397 -0.0118721
+-0.017033 0.0949215 -0.0326512
+-0.0465027 0.162256 0.00645028
+-0.0377072 0.0695284 -0.0160926
+0.0515389 0.0638758 -0.00198972
+-0.0406583 0.0577787 -0.0115563
+-0.078333 0.108337 0.035368
+-0.00970184 0.120973 -0.0121849
+0.0223756 0.0822421 0.0500191
+-0.0598969 0.0982824 -0.0189251
+-0.000418527 0.128183 0.0282442
+0.0398162 0.107019 0.0141667
+-0.0275139 0.118013 0.031246
+-0.0270215 0.0563432 0.0375362
+0.0105198 0.130786 0.00926843
+0.00339772 0.0418993 -0.0241367
+-0.0275013 0.113896 0.0350206
+0.0202412 0.0763232 -0.0271232
+-0.0919625 0.126955 0.0342506
+-0.0433008 0.0345877 0.0364134
+0.0433553 0.0860087 -0.00480358
+0.0208045 0.119446 -0.00872458
+-0.0930264 0.120177 0.0342925
+-0.0379377 0.157973 0.00463177
+-0.0253167 0.177183 -0.0103739
+-0.0366224 0.0519804 -0.0105023
+-0.0707047 0.079127 0.0393559
+-0.0260772 0.0606359 0.0392914
+-0.0238556 0.126292 0.00669874
+0.00550694 0.0561304 0.0532033
+-0.0537237 0.147766 0.0244131
+-0.0691531 0.167331 -0.0231015
+-0.0596786 0.0738084 0.0412039
+0.0326792 0.103442 0.0351236
+-0.0614661 0.174127 -0.0585981
+-0.0717687 0.0836085 -0.0162896
+-0.0457927 0.0869975 -0.0219586
+0.0105224 0.0990052 0.0483243
+-0.0829648 0.129479 -0.00406234
+-0.0356761 0.0343506 0.0364799
+-0.0884531 0.0888833 0.0214341
+-0.0627252 0.0416196 0.0257026
+-0.0564562 0.159872 0.00406757
+-0.0891671 0.0942549 0.0124334
+0.00850148 0.0561026 0.0528172
+-0.0897269 0.113038 0.0361809
+0.0510319 0.0481609 0.0243415
+-0.0355318 0.0341909 0.0278174
+0.0439268 0.0945301 0.0211547
+-0.0579061 0.0357757 0.046064
+-0.0154366 0.0383652 0.00473292
+-0.0175221 0.187321 -0.0198494
+-0.00549946 0.0842482 0.0569765
+0.0601999 0.0678503 0.0111396
+0.0144807 0.0658974 0.0525165
+0.0293268 0.0963357 -0.0179631
+-0.0397817 0.126122 -0.00537397
+0.0345713 0.109241 -0.00571538
+0.0142478 0.0846938 0.0523116
+-0.00151223 0.107257 0.0435513
+-0.0568094 0.0336832 0.0202688
+-0.00449913 0.108643 0.0435023
+0.0366018 0.0989128 -0.0107075
+-0.0520805 0.0552272 0.0244826
+-0.0564227 0.125779 -0.00685719
+-0.045508 0.0519257 0.0382686
+0.0321211 0.116144 0.000111339
+-0.0560271 0.142758 -0.00201441
+-0.0204991 0.12085 0.0318342
+-0.0572069 0.155002 0.0203881
+-0.0683862 0.0434928 0.00469407
+-0.0749362 0.167415 -0.0237916
+0.00950453 0.0758273 0.0557308
+0.0134626 0.0962698 0.0490469
+-0.0352581 0.0336435 0.0104036
+0.0033475 0.0524625 -0.0299019
+-0.0200406 0.0417644 0.0532372
+-0.020634 0.03806 0.0202475
+-0.0354822 0.0590569 0.0395591
+-0.0633421 0.145588 -0.0131138
+0.0560276 0.0714782 0.0201554
+-0.034079 0.157748 -0.0116645
+0.0430592 0.0871926 0.0271788
+-0.067061 0.0617728 0.0200983
+0.0054202 0.0385344 -0.0060218
+-0.0562382 0.115455 0.0360976
+0.0318915 0.0727133 0.0408308
+0.00701986 0.131464 0.0165435
+-0.00758439 0.038449 0.00988421
+-0.0401838 0.128459 0.00507702
+0.0467715 0.0482711 0.0287479
+-0.0918049 0.126804 0.00826817
+-0.0821184 0.0782385 0.0256306
+-0.0812562 0.103354 0.0307723
+-0.0639536 0.144435 -0.0123561
+-0.0108662 0.129871 0.00999779
+0.0155048 0.112635 0.0385412
+0.0182534 0.0792348 -0.0283217
+-0.0893331 0.0983151 0.0114073
+-0.00325216 0.0396403 0.0476826
+-0.0241255 0.089259 0.0519927
+-0.0858632 0.106258 0.00536057
+0.00408474 0.0346021 -0.0158016
+-0.0407936 0.0869784 -0.0214607
+-0.0166484 0.0480949 -0.029815
+-0.0157153 0.0613848 -0.0360938
+-0.0566239 0.0482507 0.0375737
+-0.0424946 0.0619914 0.040787
+-0.0676789 0.0735575 -0.0139417
+-0.00550026 0.0815011 0.0573318
+-0.0466697 0.166955 -0.00590454
+0.050335 0.0531616 -0.00370253
+-0.075448 0.162419 -0.0329687
+-0.0614914 0.089051 0.0454546
+-0.0467107 0.0709021 -0.0159388
+0.0485116 0.0611011 0.0306918
+0.0308141 0.0862286 0.0429136
+0.041033 0.0788113 -0.0077656
+-0.0332536 0.0434286 -0.0288825
+-0.0599631 0.0455474 0.028679
+-0.0106693 0.0383927 0.00930564
+0.00450171 0.04895 0.0512539
+-0.0567297 0.0738308 -0.0175741
+-0.0395016 0.128216 0.0127148
+-0.0236465 0.18441 -0.0150532
+-0.0541007 0.0517729 -0.00535724
+-0.00963566 0.0383633 0.0204127
+-0.072501 0.11898 0.053434
+-0.072483 0.0356257 0.00284128
+-0.0164962 0.0815146 0.0575151
+0.0321311 0.10568 -0.0119259
+-0.0628015 0.0867155 -0.0190743
+-0.0747157 0.155426 0.0258403
+-0.0655092 0.0986926 0.0420188
+-0.0621042 0.153787 0.0317461
+0.0075074 0.0702645 0.0557506
+-0.0873725 0.140519 0.00919988
+-0.0816979 0.073476 0.0105355
+-0.0251078 0.125921 0.00624226
+0.0143125 0.129601 0.0135477
+0.0537172 0.0701657 0.00367339
+-0.0658178 0.165764 -0.0247368
+-0.0706171 0.164859 -0.0164358
+-0.0268181 0.0385613 -0.0106363
+-0.0308492 0.121938 -0.00695618
+-0.0240991 0.0708914 0.0469009
+0.00836584 0.0509624 -0.0290525
+0.0146552 0.0361528 0.0436042
+-0.0759244 0.155422 0.00936737
+0.00291872 0.0383891 0.0247663
+-0.0483005 0.12541 0.0300666
+0.00749081 0.093253 -0.0307631
+-0.0441374 0.160646 -0.00957119
+-0.0454954 0.0945383 0.0433792
+0.0153865 0.0350801 0.00287497
+-0.0507565 0.078263 -0.0192091
+-0.014682 0.0540945 -0.0332776
+-0.0697195 0.0625059 0.018914
+-0.0850789 0.151288 0.0289026
+0.000998881 0.131517 0.0100563
+-0.0866192 0.111201 0.0383037
+-0.0257526 0.069725 -0.0351721
+-0.0832913 0.0938266 -0.00556456
+-0.00149798 0.121047 0.037107
+-0.0164922 0.103019 0.043564
+-0.00175716 0.0797524 -0.0362245
+-0.065193 0.165273 -0.0595568
+-0.00746087 0.0391472 0.0345828
+-0.0384976 0.0790115 0.0428361
+-0.00149834 0.095227 0.054625
+-0.00277478 0.078376 -0.0365291
+-0.0780329 0.155476 0.0217657
+-0.0632159 0.147647 -0.016402
+-0.0801569 0.0817921 0.0331577
+-0.0500022 0.16408 -0.00389251
+-0.0747874 0.0892505 -0.0147771
+-0.00949475 0.122405 0.0348735
+-0.0322196 0.0423712 0.0501883
+-0.00876131 0.174216 -0.0276966
+-0.0545091 0.161256 6.9518e-05
+0.0181832 0.102054 0.0457705
+-0.0604933 0.102915 0.04183
+0.0437773 0.0804492 0.0262342
+0.0388648 0.0842467 -0.0137667
+-0.00550336 0.0647558 0.0562438
+-0.0929299 0.122874 0.0352771
+-0.043447 0.0338958 0.0281851
+-0.0649274 0.155826 -0.0455264
+-0.00117719 0.0381217 -0.0144579
+-0.0146742 0.180146 -0.0213737
+-0.0911602 0.113316 0.0133388
+0.0114933 0.0990667 0.0482243
+-0.030492 0.093206 0.0443051
+-0.00885946 0.13031 0.0150517
+-0.073851 0.0979023 -0.0138506
+0.00349864 0.0505127 0.0525247
+0.0579498 0.0621469 0.0239372
+-0.0266127 0.121438 0.026306
+-0.0640364 0.138454 -0.00746704
+-0.0881537 0.0875035 0.020457
+-0.0693202 0.16097 -0.0509443
+-0.0258632 0.0384431 -0.0103374
+-0.0445084 0.162276 0.00597583
+0.002127 0.0994865 0.0488443
+-0.00523434 0.128086 0.0279795
+0.0441694 0.0706598 0.0245614
+0.00913312 0.10443 -0.020596
+-0.00849151 0.104452 0.0437135
+-0.0709552 0.134052 -0.00817596
+0.040546 0.0860518 0.0323351
+0.026933 0.109961 -0.012516
+0.0171797 0.119654 -0.0109592
+-0.0154871 0.10859 0.0421893
+-0.0544999 0.0945829 0.0441089
+-0.0942376 0.122836 0.024283
+0.0145822 0.10067 -0.0225932
+0.0416553 0.0900846 -0.00877196
+-0.0627089 0.0722313 -0.0153832
+-0.0265055 0.0946665 0.044662
+-0.0241067 0.108647 -0.0210644
+-0.0475093 0.0504634 0.0377677
+-0.0271626 0.0836755 0.0495254
+-0.0707023 0.155807 0.00247134
+0.0113316 0.0343299 -0.00659923
+0.0271512 0.0740976 0.0445232
+-0.00214312 0.101026 -0.0230018
+-0.0518271 0.094161 -0.0217872
+-0.0685768 0.0699128 0.0338326
+-0.0538957 0.0344051 0.0325721
+-0.0280624 0.17271 -0.00913079
+-0.0710555 0.148357 -0.0346175
+-0.0392482 0.165334 0.00281642
+-0.0494961 0.159354 0.00844009
+-0.0887346 0.0956375 0.0224045
+-0.0856504 0.126624 -0.00269798
+-0.0486707 0.147744 0.0101492
+-0.0735613 0.16372 -0.0149978
+0.0180716 0.0350245 0.0344937
+-0.0307362 0.053835 -0.015374
+-0.0887393 0.0928617 0.00944255
+-0.016725 0.0627999 -0.0362248
+-0.0190611 0.063953 0.0505398
+-0.0441816 0.0346721 0.0413945
+-0.0593157 0.126918 0.0405689
+-0.0111259 0.174182 -0.0282833
+-0.0436679 0.0621935 -0.0131864
+0.0275209 0.088828 -0.0220264
+-0.0297851 0.0890261 -0.0295849
+-0.0303849 0.154168 -0.00247422
+-0.0425281 0.128954 0.00568377
+0.0162787 0.126801 -0.0006607
+-0.0727179 0.0806647 -0.0147187
+-0.0753424 0.0928083 0.039305
+-0.0798316 0.111318 -0.00180655
+0.0192462 0.0346832 0.00400718
+-0.088108 0.129743 0.0452172
+-0.0103013 0.038437 0.0111565
+-0.0466082 0.166842 0.00289141
+-0.0459915 0.152139 0.00880917
+-0.02765 0.0504128 -0.0240838
+-0.00316977 0.101093 -0.0230747
+-0.081903 0.123614 -0.00465545
+0.0308134 0.104771 0.0359398
+-0.0649698 0.0444252 -0.000282601
+-0.0411724 0.128614 0.0047134
+-0.0566724 0.0661356 -0.00992741
+-0.0768027 0.1218 0.0526081
+0.0286707 0.0432432 0.0323583
+-0.0776442 0.112189 0.0467134
+-0.0599288 0.0595089 0.00385673
+-0.0751102 0.148577 -0.0168689
+-0.0422557 0.0435263 -0.021317
+-0.0109825 0.18157 -0.0273657
+0.0160657 0.128852 0.0141586
+0.0353395 0.113619 0.00703904
+-0.0746273 0.149901 -0.0298709
+-0.0108803 0.105927 -0.0227775
+-0.0134961 0.0472092 0.0480936
+0.0366578 0.0576635 0.0335112
+-0.019761 0.0984382 0.0445534
+-0.0662568 0.117183 0.0498756
+-0.0659606 0.17389 -0.0478108
+-0.0116079 0.0434695 -0.0263093
+-0.0926722 0.117507 0.0393006
+-0.0764843 0.145607 0.0435529
+-0.0467321 0.0337537 0.00617309
+-0.0558876 0.104087 -0.0189213
+-0.0920931 0.126941 0.031257
+-0.0204778 0.086949 0.0559493
+0.0205756 0.0550317 0.0471809
+0.0164894 0.10985 0.0397676
+-0.0639427 0.125311 -0.00880074
+-0.0233699 0.0380458 0.0160874
+0.00571651 0.037694 -0.0126956
+-0.0305064 0.059434 -0.0194047
+-0.0286182 0.0422955 -0.0294891
+-0.074262 0.155148 0.0274653
+-0.0780672 0.161102 -0.0219327
+-0.0710541 0.174778 -0.0424234
+-0.0641619 0.126957 0.0459503
+-0.0724375 0.0643068 0.0185598
+-0.0568864 0.106915 -0.0181412
+0.0293195 0.0995163 0.0407971
+-0.0644558 0.155894 0.01199
+0.00534877 0.131711 0.0116581
+-0.070964 0.169422 -0.0500317
+0.0101411 0.103018 -0.0207697
+0.0413802 0.0547717 -0.00646982
+-0.0385096 0.0776202 0.0427509
+-0.0239792 0.115969 -0.0147616
+-0.0225483 0.119525 0.0321637
+-0.060198 0.152175 0.0339452
+-0.0535114 0.0452153 0.0437642
+-0.0037319 0.0346421 0.0447442
+0.0102653 0.0944766 -0.0280245
+0.0270364 0.0347184 0.00926922
+-0.0660514 0.11246 0.0412419
+-0.0427238 0.072521 -0.0180673
+-0.057924 0.0453324 0.0266819
+0.0321473 0.0354374 0.0133726
+-0.0750002 0.0776536 0.0352037
+-0.0404922 0.11531 0.0337051
+-0.0201478 0.16826 -0.0196016
+-0.0263171 0.178663 -0.00829314
+0.0232364 0.0706221 -0.0263108
+-0.0228968 0.117028 -0.0138782
+-0.0477554 0.130992 0.0255865
+-0.05149 0.104281 0.0405196
+-0.00121687 0.120006 -0.0132177
+-0.0299396 0.0649723 -0.0274594
+-0.0187899 0.0784905 -0.0388371
+-0.0498267 0.109983 -0.0185775
+0.00334971 0.0510613 -0.029847
+0.0259096 0.0534724 0.0407837
+-0.0455367 0.111121 -0.0175743
+-0.0124237 0.0348026 0.0445556
+-0.0887181 0.123977 0.00228597
+-0.088156 0.151596 0.0228856
+-0.0530084 0.149326 0.0224058
+0.0191744 0.125775 0.0238749
+-0.0735068 0.118971 0.0531919
+-0.0585002 0.0987496 0.0428962
+-0.0310887 0.159271 -0.0130615
+0.000886159 0.12297 -0.0104051
+-0.0872227 0.0941086 0.00335062
+-0.0273424 0.0931435 -0.0275899
+0.0213306 0.126248 0.00896939
+0.0549036 0.0506667 0.00319831
+-0.0245658 0.115393 0.0346209
+-0.0908157 0.133668 0.01022
+0.011387 0.126452 0.0296316
+0.0342091 0.0430428 0.0288022
+-0.0759039 0.154928 -0.00089291
+-0.0834635 0.136224 -0.000676656
+-0.0242249 0.124407 -0.00155437
+-0.00949715 0.103034 0.0436292
+-0.0448632 0.102817 -0.0213129
+-0.0762912 0.162417 -0.0319674
+-0.087261 0.137734 0.00520439
+0.0359972 0.0915666 0.0381116
+0.0515419 0.0610093 0.0297195
+-0.0759846 0.168851 -0.0284951
+0.0192535 0.076364 -0.0276613
+0.00153258 0.130437 0.0231622
+-0.0552695 0.058846 -0.00542677
+-0.0478299 0.094184 -0.0219241
+0.0413096 0.0957202 -0.00478826
+0.00646546 0.131591 0.014917
+-0.0921802 0.132348 0.0172238
+-0.00096127 0.131397 0.0150615
+0.0373767 0.0519575 -0.00666499
+0.000499624 0.0661631 0.0564081
+-0.0624427 0.149095 -0.00857615
+-0.0158277 0.127263 0.00131837
+-0.0534778 0.0544994 -0.00645482
+-0.0393097 0.122071 -0.0111029
+-0.0552136 0.0346314 0.0441945
+-0.062546 0.0614527 -0.00215685
+0.0190515 0.0781917 0.0522129
+-0.00645816 0.122156 -0.0114796
+0.0547648 0.068691 0.024634
+-0.0165146 0.104417 0.0427511
+-0.0914381 0.133727 0.0162105
+-0.0621573 0.163143 -0.0375929
+-0.0927674 0.130992 0.0172311
+0.00308348 0.0981539 0.0507387
+0.0223728 0.0658814 0.0463438
+-0.039497 0.060614 0.0410267
+-0.0547684 0.0513541 0.0102674
+0.00252507 0.0561606 0.0537161
+-0.0427018 0.0681213 -0.0161497
+0.0102881 0.063916 -0.0312717
+-0.0443833 0.12939 0.00495951
+-0.0186027 0.160444 -0.0128213
+0.0371116 0.111176 0.0148387
+0.0282213 0.0875505 0.0444323
+-0.0274771 0.120676 0.0274866
+-0.0584936 0.0439589 0.0439647
+0.0240603 0.0822578 0.0489414
+0.0351443 0.071382 0.0384881
+-0.0164918 0.0897515 0.056205
+-0.0781864 0.161095 -0.0229348
+-0.0701455 0.111146 0.0439061
+-0.00742751 0.0346718 0.0457358
+-0.0757375 0.106056 0.0359296
+-0.0735163 0.138649 0.0485985
+-0.0786866 0.073183 -0.00146774
+-0.0425028 0.11664 0.0325093
+-0.0294965 0.105676 0.0405837
+-0.0253323 0.089221 0.0503626
+-0.00687638 0.105938 -0.022783
+-0.0680331 0.17369 -0.0570223
+-0.0709606 0.152484 -0.0460812
+-0.0145326 0.0386197 0.0300043
+-0.0284453 0.0903864 0.0448476
+-0.0688215 0.145351 0.0427408
+-0.0488146 0.109958 -0.0184987
+-0.0764868 0.144228 0.0448323
+-0.0204228 0.0384821 -0.0074254
+-0.050433 0.0505709 0.0355945
+0.00517866 0.131021 0.00445011
+-0.0697426 0.08081 -0.0166425
+-0.084857 0.0924919 0.0290512
+-0.00149439 0.0870302 0.0569025
+-0.072621 0.142849 -0.00891964
+0.0127783 0.105278 -0.0195273
+0.00375967 0.0343287 0.0177156
+-0.0724944 0.126022 0.052902
+-0.0520295 0.0429585 0.0453289
+-0.0373786 0.0478297 -0.016773
+-0.0165095 0.0446732 0.0513338
+0.0115347 0.118055 -0.0152175
+-0.0461946 0.0601644 0.0381445
+-0.0730192 0.156843 -0.0319176
+-0.0665818 0.173704 -0.0590137
+-0.0904622 0.133649 0.00822658
+-0.0661919 0.0387353 0.0332699
+0.0285711 0.0632767 0.0429905
+-0.0191373 0.0348399 0.0448528
+-0.0144945 0.115487 0.0386767
+-0.0885619 0.129493 0.00323888
+-0.00509715 0.039098 -0.012386
+0.00551873 0.0842341 0.0568816
+-0.0784525 0.0962411 -0.0105211
+-0.0126763 0.05824 0.052838
+-0.00571704 0.0642049 -0.0354496
+-0.0659809 0.169803 -0.037696
+0.00534315 0.0567731 -0.0307134
+-0.0104849 0.101611 0.0440429
+-0.0320291 0.108616 -0.01899
+0.0442879 0.0415947 0.0193873
+0.0261947 0.0449183 0.0375802
+-0.0626054 0.158425 -0.0185846
+-0.0321937 0.0694259 -0.0234551
+-0.0597828 0.0810723 -0.0197911
+-0.0274915 0.0602914 0.037483
+0.0278788 0.120142 0.00144262
+-0.00359535 0.0391334 -0.025473
+-0.0104902 0.0619157 0.0554492
+-0.0851123 0.133936 0.0477712
+0.0133897 0.0389058 -0.0222843
+-0.0778477 0.159718 -0.0189229
+-0.0817169 0.081448 -0.00456785
+0.00880568 0.131337 0.0114907
+-0.0885025 0.144515 0.032494
+0.00248318 0.0413744 0.0461608
+0.0393065 0.105567 0.023165
+0.0485408 0.0662379 -0.000364329
+-0.074114 0.159638 -0.0309374
+-0.0656277 0.0636798 0.0258038
+0.0326128 0.0934199 -0.0168733
+-0.0691845 0.152183 -0.0467119
+-0.0356328 0.0347409 0.0201566
+-0.067463 0.166618 -0.0559977
+0.0410852 0.0860175 0.0313838
+-0.0465484 0.0404249 0.0444582
+-0.0884823 0.147207 0.0295866
+-0.047064 0.168385 -0.0010022
+0.0204505 0.044377 -0.0207645
+-0.0460107 0.0426896 -0.0115747
+-0.0892694 0.136527 0.0301984
+-0.00170296 0.0612915 -0.034176
+0.016206 0.0927227 0.0499244
+-0.0816886 0.154881 0.0175845
+-0.0434863 0.0776041 0.0427475
+-0.0883068 0.098239 0.00641854
+-0.045625 0.056311 -0.011298
+-0.0524843 0.150872 0.017395
+-0.0641668 0.0334738 0.00287677
+0.0361211 0.0586877 -0.0107678
+0.0141254 0.0589894 0.0501816
+-0.0864962 0.112872 0.0280752
+-0.0863885 0.112851 0.0441987
+-0.0524922 0.0384865 -0.0115467
+-0.0776496 0.163935 -0.0239336
+-0.0554697 0.0345193 -0.0117205
+0.0176795 0.0740469 0.0519763
+-0.0728932 0.0642808 0.0113714
+0.0261658 0.0809584 -0.0239333
+0.058376 0.0713467 0.0136326
+0.0257313 0.0968616 0.0444005
+0.00516452 0.0344202 0.0197338
+-0.0686185 0.0687175 -0.00655491
+-0.0803464 0.147298 -0.000827063
+0.000190276 0.131527 0.0154789
+-0.0687909 0.0354139 0.0127136
+-0.05562 0.146743 0.0301728
+0.0240878 0.0645552 0.0452968
+0.0313304 0.0475675 0.0327114
+-0.0107396 0.0713653 -0.0375278
+-0.0444884 0.0733739 0.0424053
+-0.0892862 0.137904 0.0301929
+0.0430064 0.0930319 -0.00281527
+0.00152278 0.0688979 0.0560686
+0.02743 0.0663837 -0.0217206
+-0.0610765 0.167736 -0.0598039
+0.0469057 0.0738955 0.00933063
+0.010569 0.0630758 0.0538717
+-0.0636657 0.175908 -0.0542108
+-0.00887643 0.105922 -0.0227472
+0.0366768 0.0861722 0.0373065
+-0.00750518 0.0661146 0.0558703
+-0.0311481 0.174122 -0.0158676
+0.0165049 0.115408 0.0369209
+-0.0599957 0.135288 0.0360766
+0.023446 0.0385037 -0.00396461
+-0.0512658 0.0335234 0.00365116
+-0.0640041 0.0417908 0.0276702
+0.0505407 0.062451 0.0297568
+0.0381071 0.0767371 0.0357901
+0.0348186 0.114435 0.00971518
+-0.0808584 0.15153 0.0328055
+-0.0292731 0.0691492 -0.0304581
+-0.0482843 0.133992 0.00441773
+-0.0151264 0.0382524 0.0175843
+0.0457402 0.0749932 0.00321166
+-0.0514912 0.0529568 0.0308804
+-0.0841758 0.0777074 0.00551439
+-0.0724891 0.168081 -0.0228518
+-0.0578499 0.140998 0.0321632
+-0.0824678 0.0844329 0.0311552
+-0.035201 0.0380831 0.0475916
+-0.0225654 0.0336394 -0.0239171
+0.0463796 0.0792543 0.0131749
+0.0210505 0.125312 0.00175976
+-0.0835133 0.0843594 0.0293933
+-0.00767881 0.0555674 -0.03337
+-0.052489 0.159007 -0.00340529
+-0.0244459 0.156552 -0.00701262
+-0.0598434 0.0384999 0.0207227
+-0.0725078 0.160609 -0.0083559
+0.0429565 0.0986678 0.00218951
+-0.00967767 0.118026 -0.0150602
+0.038419 0.105512 0.0261645
+-0.00651495 0.0746355 0.058305
+0.0450144 0.0945871 0.00816469
+-0.0454802 0.123445 -0.0105099
+-0.00122028 0.0938312 -0.0334376
+-0.067038 0.143551 -0.013347
+0.043578 0.0888313 -0.0037919
+-0.0238161 0.078256 0.0534268
+-0.0455234 0.131922 0.0119481
+-0.0735087 0.137262 0.0493527
+-0.0183224 0.184952 -0.0232094
+-0.0148238 0.091051 -0.0367095
+-0.000496937 0.0620135 0.0565388
+-0.0217336 0.0611778 -0.0340471
+-0.0922703 0.125567 0.0322584
+0.0255559 0.0952317 -0.0208124
+-0.0748894 0.152721 -0.0218881
+-0.0770206 0.0981288 0.0365817
+-0.0262775 0.073604 0.0447421
+0.00842909 0.131472 0.01278
+-0.0815194 0.125984 0.0522053
+-0.0768497 0.156895 -0.0209209
+-0.0774933 0.0717304 0.000534742
+-0.0610597 0.172553 -0.0606091
+-0.00957846 0.178815 -0.0287373
+-0.062208 0.167823 -0.0505845
+-0.0225076 0.125867 0.0188793
+-0.0580565 0.0334897 0.00410791
+-0.00649004 0.112763 0.0415025
+-0.00176067 0.0755229 -0.0360316
+0.0456774 0.0904203 0.00916591
+0.0441351 0.0749462 0.0250125
+-0.0810675 0.11076 0.0435122
+0.00990869 0.048971 0.0492516
+-0.0728744 0.10362 -0.0122376
+0.0374772 0.106859 -0.00183322
+0.0151574 0.0988592 -0.0229537
+-0.016863 0.0640072 0.0526042
+-0.0418006 0.0462579 -0.0152948
+-0.0768234 0.0927696 0.0379671
+-0.0661935 0.155092 0.00556387
+-0.0810703 0.0752023 0.0214152
+-0.0235527 0.156826 -0.00518035
+-0.0194871 0.0883195 0.0557235
+-0.0716986 0.077793 -0.0140498
+-0.010631 0.0389663 -0.00962591
+-0.0570892 0.0602319 -0.00257411
+-0.0419839 0.128576 0.0133734
+-0.0151399 0.0382506 0.0121533
+-0.0759996 0.139851 -0.00609906
+-0.0506105 0.0694238 0.0381651
+-0.0658919 0.11864 0.0504465
+-0.0528899 0.106976 -0.018917
+-0.0521172 0.0545658 0.0256302
+-0.005498 0.103045 0.0437796
+-0.0524893 0.156469 0.0106374
+-0.0439563 0.147482 -0.0018962
+0.00349012 0.116915 0.0395094
+-0.0116538 0.0496371 -0.0310034
+-0.0360677 0.156277 -0.0104898
+0.0262747 0.0376552 0.0265482
+0.00369465 0.0390982 -0.00688719
+0.037401 0.0414131 -0.00242752
+-0.010004 0.0383201 0.0185669
+-0.0807853 0.0817556 0.0323751
+-0.00609738 0.037339 0.0487481
+-0.0254987 0.0945485 0.0446378
+-0.0446176 0.0345408 0.0396657
+-0.0522913 0.124591 -0.00759738
+-0.0244524 0.16187 -0.0148048
+-0.0144465 0.128429 0.00434765
+-0.0238211 0.0384511 -0.00993154
+0.0184111 0.122524 0.0307587
+-0.0815439 0.112456 0.0456165
+0.0549908 0.0567623 0.0266396
+0.0309112 0.0754873 0.0429619
+-0.0278697 0.103003 -0.0233536
+-0.0640545 0.149152 -0.0269946
+-0.0594536 0.133932 0.0368692
+0.0130152 0.130057 0.0144613
+0.0491953 0.0732159 0.0116573
+-0.0364993 0.0733348 0.0420574
+-0.0859116 0.107692 0.0193681
+0.0386236 0.109277 0.0110826
+0.00584547 0.0353648 -0.01428
+0.0198737 0.0358544 0.0359282
+-0.0174269 0.182963 -0.0250022
+0.0258436 0.0563286 -0.0217568
+0.0362122 0.112176 0.0188059
+-0.0564979 0.0805451 0.0445004
+0.0450117 0.0805305 0.000199058
+-0.043786 0.126623 -0.00583839
+0.0366462 0.100736 0.0320541
+-0.0198519 0.0357263 0.0525976
+-0.0872471 0.125707 0.0473263
+-0.0180735 0.0611876 0.0510587
+-0.0608049 0.0596005 0.019786
+0.0269735 0.121605 0.0224835
+0.033449 0.0380742 0.000639692
+-0.0174889 0.0856455 0.0572522
+-0.0298765 0.0607745 -0.022409
+-0.0371209 0.127449 0.0017956
+-0.0397839 0.0471068 -0.0160895
+-0.0245336 0.118082 0.0325274
+-0.0715136 0.0887445 0.0416191
+0.00419323 0.0880606 -0.0335488
+0.0353118 0.0520079 -0.00674902
+-0.00049849 0.101653 0.0443576
+-0.0570055 0.133804 -0.00545801
+-0.0215772 0.158162 -0.00503193
+-0.0640639 0.0351963 0.0227232
+-0.00287353 0.108795 -0.0218002
+0.0462936 0.0792458 0.00718673
+-0.00951316 0.0575536 0.0537045
+-0.0477812 0.0840973 -0.0215817
+-0.0526608 0.0504363 0.0276515
+-0.0340312 0.123966 -0.00509105
+0.00648697 0.11688 0.0387497
+0.0343069 0.0578226 0.0371782
+-0.0220745 0.169763 -0.0127977
+-0.0106374 0.0466553 -0.0295813
+0.0335656 0.114779 0.000629741
+-0.0269131 0.180109 -0.00739997
+0.0390081 0.105539 0.000161276
+-0.00175381 0.0993639 -0.0251444
+0.040909 0.0985658 0.0261474
+-0.0617277 0.159994 -0.0345941
+-0.0434138 0.111151 -0.0176174
+0.0319241 0.0700307 0.0408624
+-0.0349471 0.109117 -0.019515
+-0.0733885 0.111282 0.0466166
+0.0354121 0.0430461 -0.00417186
+-0.093028 0.117371 0.013308
+-0.0756832 0.149968 -0.01987
+0.0201512 0.0605237 0.0483852
+-0.0639979 0.158311 -0.048587
+0.0410638 0.0928718 -0.0077952
+-0.0845757 0.151155 0.0298105
+-0.0752762 0.167899 -0.0253615
+0.0587584 0.0580034 0.00517536
+-0.070971 0.166609 -0.0480118
+-0.0488701 0.10281 -0.0210946
+-0.0609926 0.128204 -0.00783795
+-0.0772884 0.155547 -0.0128979
+0.0120566 0.130535 0.0112565
+-0.0655484 0.039711 0.0142785
+-0.0465128 0.0438401 0.043121
+-0.0215234 0.0739469 0.0526909
+0.0238579 0.0490757 0.0395236
+-0.00446924 0.111373 0.0424038
+-0.0646993 0.150616 -0.0327557
+-0.0547216 0.118372 0.0366122
+0.055991 0.067441 0.024671
+-0.0164973 0.0485745 0.0476342
+-0.0243246 0.0415463 0.0540712
+-0.0679818 0.0653371 -0.00356488
+-0.0887934 0.125677 0.0460403
+-0.0672794 0.176766 -0.0591515
+-0.0201696 0.169725 -0.0202727
+0.0232197 0.0818757 -0.0256198
+-0.0521106 0.0503642 0.0236349
+-0.00378569 0.0826645 -0.03749
+0.0103848 0.03606 -0.0224393
+0.0144027 0.129384 0.00642559
+0.0154718 0.101771 0.0468044
+-0.0222044 0.174173 -0.0211642
+0.0605561 0.0664891 0.0161665
+-0.0110072 0.128401 0.0244439
+0.00979123 0.127622 -0.00353983
+-0.0586426 0.0335837 0.0110854
+-0.0324964 0.0518418 0.0373712
+0.0339681 0.114736 0.0222644
+-0.0278327 0.179989 -0.0150111
+0.0505141 0.0610459 0.0301699
+-0.084345 0.0818627 0.0244959
+-0.0780694 0.106243 0.0333548
+-0.0400434 0.149481 0.00241998
+0.0415851 0.0779004 0.0302476
+-0.0934884 0.117419 0.0203018
+0.0145324 0.0686382 0.0526166
+0.0105088 0.0546576 0.0523588
+-0.0166719 0.128014 0.0194984
+0.0111864 0.115382 -0.0163281
+0.0433489 0.0761902 -0.00378764
+0.00361131 0.0929227 -0.0324448
+0.0374765 0.0967619 0.0332563
+0.0118435 0.0418607 0.0449613
+0.00151372 0.070315 0.0563646
+-0.089555 0.092956 0.0194329
+-0.0309867 0.0458642 -0.0271867
+-0.0127025 0.0628523 -0.0366298
+-0.0211402 0.175693 -0.0149194
+-0.0410644 0.0466663 -0.0156422
+0.0229642 0.0564103 0.0453711
+-0.0689131 0.06155 0.0163724
+-0.0351956 0.0394954 0.0475468
+0.0545544 0.0478595 0.011201
+0.0307617 0.0848812 0.0428147
+-0.0854234 0.100771 0.000422318
+-0.00263926 0.0481807 -0.0301073
+0.0341204 0.0781827 0.0405841
+-0.0753485 0.151324 -0.0238793
+-0.040104 0.0359968 0.0427867
+0.00880995 0.127795 -0.00370552
+-0.0546717 0.0587861 -0.00643621
+-0.0527782 0.0338002 0.0103069
+-0.0644915 0.087588 0.0448694
+-0.0649403 0.125308 -0.00887181
+-0.0623267 0.035582 -0.00867786
+-0.0178682 0.127784 0.00598386
+-0.0477624 0.119115 -0.0139706
+-0.0272958 0.178509 -0.0169626
+-0.036773 0.0446897 0.0419462
+-0.0643144 0.0445281 -0.000908113
+0.0310215 0.117934 0.00259488
+-0.0657027 0.155342 0.0275329
+0.00812544 0.105869 -0.0206053
+-0.0845132 0.150109 0.0051703
+0.0147267 0.0343671 -0.00408399
+-0.0738652 0.150214 0.0382196
+-0.0396346 0.151103 -0.0056598
+-0.0548476 0.0665624 0.0361422
+-0.053656 0.116868 0.0345992
+0.0407085 0.0956949 -0.00580768
+-0.0407505 0.126266 0.0196745
+0.0327193 0.0632979 0.0402054
+-0.0423878 0.124291 -0.00941969
+0.0148847 0.0378033 0.0441286
+-0.0385893 0.036902 -0.00962928
+-0.0735502 0.095526 0.040254
+-0.0625469 0.169393 -0.0495927
+-0.0666556 0.0360676 0.0353877
+0.00702297 0.127188 0.0294846
+0.0123661 0.0479119 -0.026429
+0.00707963 0.0365612 -0.00575515
+0.00660499 0.0617786 0.0553203
+-0.056364 0.156406 0.0105108
+-0.02141 0.0511007 0.0448554
+-0.0417892 0.0855226 -0.0213401
+-0.0454873 0.0789625 0.0423892
+0.0541155 0.0731329 0.017974
+0.0124978 0.092313 0.0523832
+-0.0184886 0.0801089 0.0571361
+-0.0426749 0.0622014 -0.0131851
+-0.0711139 0.162407 -0.0449498
+-0.0234912 0.0474961 0.0510145
+-0.0722633 0.0367738 0.0082856
+-0.0207862 0.0638606 0.0480406
+-0.0570496 0.0562866 0.00362097
+0.023226 0.077646 -0.0258357
+0.00592655 0.0339685 0.0148513
+0.0327331 0.0942636 0.0404449
+0.0170625 0.0448711 0.043693
+0.0335588 0.0862851 0.0416032
+-0.0588111 0.0334057 -0.00501142
+-0.0718597 0.148728 0.0404251
+-0.0700765 0.0619608 0.0139832
+-0.0302069 0.174221 -0.00514504
+-0.088803 0.151599 0.0211964
+0.0155832 0.0893609 -0.0286847
+0.0270636 0.120631 0.00113345
+0.033576 0.0781814 -0.0177928
+-0.0894235 0.0942851 0.0164251
+-0.0386513 0.0344774 0.0357393
+-0.0348698 0.176878 -0.00628812
+-0.0102548 0.179004 -0.0295955
+-0.0708792 0.115031 -0.00817569
+0.0203316 0.0551325 -0.0272049
+-0.0942207 0.120117 0.0202902
+-0.0704743 0.121802 0.053345
+0.0441954 0.0847004 0.0251589
+-0.0662148 0.171945 -0.0435535
+-0.0579078 0.0494657 0.0056917
+-0.0364996 0.0789928 0.0425809
+0.00849936 0.0744764 0.056192
+-0.0263916 0.0563779 0.0383176
+-0.0556017 0.0336949 -0.0101219
+-0.0593537 0.140997 0.0335026
+-0.0941834 0.120103 0.0162919
+0.0184196 0.0442138 -0.0226321
+-0.0628603 0.033866 0.0135258
+-0.0229828 0.0566251 0.0433992
+-0.0295276 0.0383617 0.0343291
+-0.0439439 0.166904 -0.00881722
+-0.00750585 0.0633646 0.0562436
+-0.0553809 0.0486564 0.0109541
+0.0106398 0.0390088 0.044914
+0.0440071 0.0846602 -0.00280808
+-0.0184891 0.0743773 0.0548673
+0.0214529 0.0415824 -0.013701
+-0.0137336 0.0383402 0.0141683
+-0.0895155 0.0983259 0.0124123
+0.0129339 0.063079 0.0520141
+-0.0749499 0.112554 -0.00662315
+-0.0128237 0.0855345 -0.0387685
+-0.0175101 0.0381991 0.0207599
+-0.065046 0.0423247 0.012291
+-0.0570589 0.0507155 -0.000374425
+-0.0630045 0.132588 -0.00795426
+-0.0415001 0.0972709 0.0420669
+0.0313679 0.117954 0.0212794
+-0.00373539 0.0684024 -0.0350771
+-0.0896129 0.139294 0.0321884
+-0.0239769 0.0381215 0.0231095
+0.0347467 0.0670098 -0.0158076
+0.0178644 0.101883 -0.0218675
+-0.064813 0.0428917 0.034688
+-0.0618962 0.0443648 0.0286813
+0.0425837 0.100055 0.002186
+-0.056712 0.0708617 -0.0156392
+-0.066713 0.154086 0.0315791
+-0.0348246 0.0872331 -0.0245609
+-0.0155018 0.080076 0.0569734
+-0.0431381 0.128903 0.00398376
+0.0456202 0.0421608 0.019117
+-0.0637474 0.0766435 -0.0177206
+-0.070335 0.0339385 0.00479187
+-0.0452276 0.131073 0.0164666
+0.0175902 0.128186 0.00902123
+-0.0332219 0.0344808 0.0386469
+-0.000130337 0.0395577 0.0357254
+-0.0384117 0.12376 -0.00887525
+-0.0384745 0.0533908 0.0391471
+-0.0105486 0.0921685 -0.035821
+-0.0292627 0.125707 0.0105611
+-0.0740612 0.16798 -0.0430295
+-0.0794475 0.0732175 0.0216948
+-0.0525459 0.0430871 -0.00935537
+-0.0275149 0.0591111 -0.027433
+-0.0608279 0.0910686 -0.0191968
+0.0214831 0.0388585 0.0402401
+-0.0185078 0.0382343 0.0205228
+-0.0193476 0.0973552 -0.0251961
+-0.014626 0.03858 -0.00263697
+0.0364765 0.110061 0.0246179
+0.0394879 0.0499122 0.0322705
+-0.0738314 0.151256 -0.033887
+-0.0276072 0.0488225 -0.0246209
+0.0254616 0.0727112 0.0456024
+-0.054118 0.157553 -0.00229988
+-0.0100751 0.129607 0.0204184
+-0.0507271 0.115538 0.0335799
+-0.064203 0.176904 -0.0544031
+-0.0327997 0.0624741 -0.0154176
+-0.050486 0.0585567 0.0325562
+-0.0115057 0.0716604 0.0558672
+-0.041271 0.0338554 -0.00188008
+0.00149737 0.0969588 -0.0286791
+0.0222207 0.0833264 -0.0261432
+-0.0379669 0.0433397 0.0417712
+0.0433566 0.094461 -0.000803958
+-0.0485055 0.0490796 0.0381424
+-0.0398915 0.109923 -0.0189257
+-0.00650042 0.0533369 0.0530605
+-0.0902689 0.112791 0.0182006
+-0.0256204 0.0436547 -0.0287136
+-0.0432877 0.171276 -0.00598005
+0.00651867 0.0674599 0.0552944
+0.00755739 0.101711 0.046537
+0.0201484 0.0899648 -0.02526
+0.00621941 0.0351341 0.00654928
+-0.0641258 0.0611318 0.00140431
+-0.0841699 0.0979316 0.0296062
+-0.0893171 0.151601 0.0194969
+-0.0509112 0.0517382 0.0331779
+-0.0345095 0.0761212 0.0417709
+-0.0210879 0.0852798 0.0561484
+-0.0647084 0.033787 -0.00655215
+0.0485032 0.0638048 0.0293893
+0.0553414 0.0563023 0.000211666
+0.031191 0.0977616 -0.015509
+-0.0271419 0.168228 -0.0179326
+-0.0594934 0.0832968 0.0436941
+0.00712427 0.107292 -0.0202517
+-0.0670075 0.139964 -0.00790796
+-0.072631 0.169409 -0.0470274
+-0.0668128 0.0894987 -0.0177562
+-0.0638648 0.166212 -0.0336016
+-0.0305285 0.0348948 0.0458677
+-0.07494 0.0707543 0.0282709
+0.0217204 0.105135 -0.0173432
+0.0129112 0.111627 -0.0182976
+-0.0346615 0.0395406 0.0484261
+-0.0244963 0.105758 0.0419767
+-0.0275166 0.057436 0.037149
+-0.071563 0.151347 -0.0436244
+-0.00477478 0.0812297 -0.0373809
+-0.0544968 0.108447 0.0390956
+0.0191276 0.0370481 -0.0116797
+-0.0477678 0.125154 -0.0082648
+0.00907863 0.112423 -0.0191367
+-0.0148223 0.129108 0.012888
+-0.0685095 0.148391 0.0402581
+0.0438124 0.093116 0.0231537
+-0.0295173 0.175738 -0.0052542
+-0.0580932 0.155356 0.0200663
+-0.0140302 0.116852 -0.0157862
+-0.00427283 0.034883 0.0462122
+-0.0365117 0.0860935 0.0436284
+0.0428337 0.0789534 -0.0047828
+0.0143759 0.121374 -0.0108038
+-0.0478629 0.0335429 0.00613354
+0.0399096 0.0632641 -0.00677014
+0.0382182 0.0855917 -0.0147556
+-0.0586226 0.156199 0.00971481
+-0.0768739 0.0698402 0.0216311
+0.0359859 0.0660034 0.0379002
+-0.0517494 0.0782459 -0.0193853
+-0.0836382 0.0870656 -0.00453769
+0.0314216 0.0415146 -0.00377022
+-0.0633942 0.159878 -0.0495887
+-0.0762229 0.149992 -0.0128764
+0.0360298 0.0573371 -0.00970954
+-0.0378631 0.100009 -0.0219618
+-0.0631703 0.172516 -0.0516045
+-0.0893681 0.0902559 0.0194368
+0.0559048 0.0631077 0.000905369
+0.00350533 0.0758855 0.0563752
+0.0327662 0.0475454 0.0312717
+-0.0144964 0.104421 0.0432413
+-0.0925078 0.121485 0.0292837
+-0.0225266 0.123574 -0.00478676
+0.027859 0.114683 -0.0075901
+0.0336358 0.0725575 -0.0168317
+0.0133955 0.0900754 0.0528858
+-0.0320964 0.160758 -0.0138294
+-0.0665218 0.173689 -0.0465659
+-0.0314315 0.062325 -0.0194293
+0.0355057 0.0498307 0.031489
+0.0409937 0.0830284 -0.00976566
+-0.0484259 0.152144 0.0105657
+-0.0760489 0.0702549 0.00053996
+-0.0939567 0.121435 0.0142863
+0.0458128 0.0848143 0.0141708
+-0.088753 0.130866 0.00325856
+-0.0762076 0.0680671 0.0162505
+0.0295583 0.0594698 -0.0188239
+-0.0470685 0.0362699 0.0454096
+0.0515085 0.0678015 0.0264788
+0.0229945 0.0535474 0.0436214
+0.0102584 0.0738736 -0.0323425
+-0.0208293 0.0841002 -0.0385977
+0.013479 0.118711 -0.0139326
+-0.0577142 0.0723919 -0.0167433
+0.0343469 0.0740244 -0.0157906
+-0.0384895 0.050603 0.0393394
+-0.0411819 0.166655 -0.0111213
+-0.0314187 0.0525029 -0.0133876
+-0.0530781 0.119794 0.0354828
+0.0402398 0.0815675 -0.0107641
+-0.0334936 0.0817447 0.0419617
+-0.0284374 0.0381394 0.00411543
+-0.0669412 0.126769 -0.00883964
+-0.089797 0.129515 0.00524651
+-0.0607661 0.0796035 -0.0191344
+-0.0878523 0.0860961 0.00747941
+-0.00447426 0.0385132 0.0213354
+0.0222429 0.0463236 0.0406841
+-0.0167958 0.0799195 -0.0388883
+-0.0714505 0.16941 -0.0490283
+-0.00251639 0.0442645 0.0466529
+-0.0648891 0.0981501 -0.0170112
+0.00754987 0.100371 0.0472771
+-0.0694963 0.16803 -0.0520069
+-0.0920162 0.126943 0.0352547
+0.0233968 0.0355618 0.0133136
+-0.0660161 0.169448 -0.0590294
+-0.0555411 0.128344 0.0372391
+-0.0488244 0.0927169 -0.0215945
+0.0343104 0.114465 0.0209626
+-0.0501985 0.140132 0.0173988
+-0.0658096 0.0445087 0.000718728
+-0.0512856 0.136981 0.000438627
+-0.0269157 0.0703179 -0.0345192
+-0.0636699 0.112355 0.0376208
+-0.0754912 0.144221 0.0449451
+-0.062524 0.167829 -0.0475902
+0.030542 0.0511254 -0.0127382
+-0.0237052 0.0596068 -0.0321069
+-0.0547922 0.153188 0.0241866
+-0.0414961 0.0902351 0.0425692
+-0.0494981 0.0477699 0.0395132
+0.0289271 0.110086 0.0349831
+-0.0402206 0.0433137 -0.0233156
+-0.0246897 0.0560336 -0.0294195
+0.00733033 0.058195 -0.0305865
+-0.0633574 0.155908 0.0123853
+-0.0679376 0.162368 -0.0549778
+-0.0588165 0.0667309 0.0351477
+-0.0598716 0.0453976 -0.00333599
+-0.0238165 0.0812337 -0.0381734
+-0.047565 0.0370224 -0.0142792
+-0.010699 0.104948 -0.0231645
+0.0375184 0.0915609 -0.0128884
+-0.056974 0.0573893 0.011763
+-0.00401542 0.033994 -0.0206047
+0.0133173 0.0638081 -0.0300932
+-0.0402517 0.127178 -0.0024642
+0.00549546 0.0489597 0.051102
+-0.0755445 0.0668624 0.00857418
+-0.0465015 0.0643139 0.0383309
+0.00586085 0.130491 0.00185259
+-0.00908444 0.0392597 0.0359512
+-0.0724815 0.0696506 0.0297377
+-0.0588318 0.146817 0.0344225
+-0.0460118 0.126697 0.0245216
+-0.044079 0.0336811 -0.000461832
+-0.0565021 0.0946206 0.04473
+-0.0615844 0.155311 -0.0225818
+-0.0650869 0.155169 -0.00713868
+-0.089472 0.092961 0.0204149
+-0.0824758 0.0764829 0.0200121
+0.0429803 0.0916104 -0.003806
+-0.0914285 0.144743 0.0221537
+0.00329581 0.06408 -0.0335736
+-0.0554437 0.158541 0.0079523
+-0.0624977 0.0789785 0.042462
+0.00538842 0.0383711 -0.011506
+-0.0682947 0.162375 -0.0539731
+-0.0809901 0.135346 -0.00326263
+-0.0418435 0.0928469 -0.022966
+-0.0664939 0.0917254 0.0436166
+-0.0741328 0.170753 -0.0306566
+0.00842498 0.094018 -0.0295425
+-0.00912603 0.126983 -0.00460672
+-0.0144839 0.0911543 0.0563071
+-0.0247385 0.124904 0.000549003
+-0.064327 0.034541 0.0284972
+-0.0668589 0.156842 -0.00635476
+-0.0565065 0.0629707 0.0300974
+0.0567694 0.0522665 0.0211855
+0.0120332 0.0793354 0.0543348
+0.00749695 0.108523 0.0409368
+-0.0385157 0.0761871 0.0423388
+-0.0861163 0.11208 0.0430934
+-0.0554974 0.0776601 0.0434775
+-0.0519782 0.0531903 0.0286494
+0.00382899 0.0387567 -0.00467455
+-0.0437453 0.0348723 0.00757323
+-0.0876033 0.102265 0.00739801
+-0.0538689 0.152421 0.0214004
+0.0305964 0.0407785 0.0282841
+0.0465387 0.0750529 0.00819241
+-0.0664147 0.112558 0.0425241
+-0.0212669 0.123736 0.0252343
+-0.0144966 0.0485988 0.0478804
+-0.0270125 0.0891105 0.0478066
+-0.0328048 0.0886955 -0.0250147
+-0.0387676 0.0812185 -0.0204237
+-0.0179622 0.106228 -0.0225141
+-0.0121468 0.17267 -0.0267827
+-0.0155019 0.119619 0.0357771
+-0.0763961 0.0968047 0.0374195
+-0.00349611 0.0897823 0.0565938
+-0.0378917 0.0335733 -0.0268663
+-0.0464981 0.0451704 0.0419279
+0.0287219 0.115289 -0.00622497
+-0.0639806 0.135327 0.039077
+-0.045498 0.105695 0.0408472
+0.0546227 0.0668075 0.00110467
+-0.0690913 0.143 -0.0123014
+0.0356753 0.0619319 0.0374332
+-0.0141081 0.128922 0.00736661
+-0.0561495 0.0341243 0.0270787
+-0.038546 0.128369 0.00715642
+-0.0876142 0.116272 0.0465171
+-0.0722303 0.134063 0.0500963
+-0.0156039 0.0392636 -0.0272219
+-0.0361326 0.034299 0.0293707
+0.0285657 0.120967 0.00738594
+0.0111022 0.114226 -0.0170859
+-0.0218549 0.118022 -0.0129203
+0.0460721 0.0848306 0.00817735
+-0.0800935 0.138964 -0.00379173
+-0.0574953 0.0747475 0.0420563
+-0.00684325 0.130599 0.0100344
+0.020602 0.0768409 0.0509288
+0.0342103 0.0795441 0.0407378
+-0.0387822 0.0841715 -0.021953
+0.00854197 0.104373 0.044167
+0.0284181 0.0835438 0.0446794
+-0.0809789 0.0720684 0.0125422
+-0.0870329 0.152942 0.0187545
+0.0227098 0.105005 -0.0172062
+-0.0259693 0.156664 -0.00260696
+0.00630512 0.0970077 -0.026738
+-0.0293004 0.175699 -0.00559167
+-0.00764633 0.048167 -0.0303862
+-0.045682 0.0680577 -0.0156409
+-0.0545225 0.0645764 -0.00897215
+-0.0511988 0.137011 0.0243968
+-0.00714364 0.101607 -0.0236448
+0.00975279 0.123922 0.0333795
+-0.069363 0.163799 -0.0509746
+-0.000145407 0.0355938 -0.0156782
+0.0251101 0.0562501 -0.0227775
+0.047185 0.0692848 0.0242283
+-0.0610844 0.0335982 -0.00747508
+-0.0215973 0.0387212 -0.015323
+0.00621551 0.0824281 -0.0337654
+-0.0768656 0.120803 -0.0071099
+-0.072234 0.147352 -0.0242316
+-0.0251276 0.16525 -0.016804
+-0.00350994 0.110634 -0.0212045
+-0.051883 0.143128 0.0183637
+0.0388034 0.0687739 -0.0117998
+0.0522529 0.049588 0.0243549
+-0.0484974 0.0974063 0.0440017
+0.0292296 0.08295 -0.0208022
+0.0215976 0.121636 0.0305088
+-0.0576661 0.143885 0.0324483
+-0.062789 0.152113 -0.0295989
+-0.0686144 0.0632303 0.0220506
+-0.0812769 0.136213 -0.00276757
+-0.0898521 0.112924 0.020019
+0.0399617 0.0984844 -0.00581339
+-0.0197337 0.0627381 -0.0357065
+-0.0715197 0.0915892 0.0417662
+-0.0176796 0.037751 -0.0173923
+-0.0034931 0.0519852 0.0535284
+-0.0477302 0.0753108 -0.0175447
+-0.0720239 0.158203 -0.0389152
+0.012618 0.0562866 0.0514947
+-0.00341476 0.129699 0.000449344
+0.00761699 0.0345564 0.0219225
+0.0197796 0.101487 -0.0214363
+-0.0718751 0.150885 -0.0428436
+0.0226049 0.0994887 0.0451477
+-0.0275114 0.0379423 0.00991362
+0.0449899 0.0861501 0.00118902
+-0.0724942 0.0928706 0.0413391
+-0.0668563 0.151928 -0.044894
+-0.00758529 0.0395118 0.037828
+-0.0717266 0.143977 -0.0139286
+-0.0485566 0.0446478 -0.0101195
+-0.0498454 0.098516 -0.0220736
+-0.0687032 0.155739 0.000270534
+0.0305837 0.118921 0.00529549
+0.0181431 0.0408036 0.0434958
+-0.0644897 0.161538 -0.0184978
+-0.082117 0.127195 0.0520765
+0.0194801 0.0975854 0.0469408
+-0.0593004 0.0460479 0.0107053
+-0.051494 0.097382 0.0437255
+-0.0629042 0.151488 -0.0283316
+-0.0520794 0.132523 0.0317044
+-0.0086348 0.124041 -0.00947049
+-0.0408505 0.0971293 -0.022095
+-0.0501242 0.144161 0.00100252
+-0.0374501 0.127748 0.0031441
+-0.0242006 0.107431 -0.0217757
+-0.0185705 0.0597254 0.0501838
+0.0506634 0.0663167 -0.000433246
+-0.0778197 0.0981202 0.035968
+-0.0344836 0.0604651 0.0395531
+0.0141481 0.100268 -0.0227789
+-0.0201048 0.0920391 0.0535514
+0.0405223 0.0582848 0.0307512
+-0.0234669 0.126337 0.0156088
+-0.0879353 0.140547 0.0390784
+0.0495003 0.0691238 0.025332
+-0.0550177 0.034541 0.0409139
+-0.0558687 0.156831 -0.000812957
+-0.033113 0.162236 -0.0143657
+-0.0040053 0.127195 0.0298616
+0.00247063 0.0977635 0.0514765
+-0.0372934 0.126961 0.0179492
+0.00433485 0.120467 -0.0137766
+0.00930976 0.0595795 -0.0301167
+0.0437257 0.0902921 0.0241674
+-0.0363397 0.0344675 0.0327184
+0.000637516 0.0346318 0.0420689
+0.0283669 0.0563832 0.0408635
+-0.0890554 0.136524 0.0291987
+-0.0526322 0.0603614 -0.00917272
+-0.0555168 0.0610654 0.0262173
+-0.0398616 0.102806 -0.020798
+-0.0554959 0.0959795 0.0436611
+-0.0625279 0.0435825 0.012569
+-0.012539 0.0432081 0.0504383
+-0.0295399 0.0777526 0.042206
+0.0250153 0.0699448 0.0449142
+0.0418505 0.0929433 -0.00581175
+0.00749052 0.0923616 0.0534281
+-0.0508873 0.105589 -0.0194525
+-0.0577516 0.0752955 -0.0185275
+-0.0341251 0.166782 -0.00385534
+0.0204867 0.0961927 0.0470968
+-0.0860696 0.110951 0.0368762
+-0.0623929 0.0445563 0.039213
+0.0212831 0.0679005 -0.027755
+-0.0459741 0.03576 0.00812075
+-0.0128757 0.105895 -0.0226089
+-0.0713104 0.164383 -0.0152637
+-0.00570768 0.129479 0.0248833
+-0.0759611 0.0715461 -0.00349282
+-0.0154987 0.0485755 0.0476399
+-0.0271627 0.125166 0.0172175
+-0.052909 0.0559665 0.0126205
+0.0445771 0.0875296 0.0231612
+-0.0679602 0.132601 -0.00851511
+-0.0735016 0.14861 -0.0288774
+0.0321816 0.0968615 0.0396789
+-0.0617331 0.156868 -0.0205842
+-0.0310423 0.0467686 -0.0260418
+-0.0285615 0.0382432 0.0537594
+-0.0934477 0.121479 0.0262963
+-0.0220941 0.0710555 0.0505203
+-0.0299308 0.0348009 0.0443343
+-0.0161025 0.0382877 0.022773
+-0.0328698 0.101492 -0.0223548
+0.0454742 0.0412367 0.0106737
+-0.028101 0.0890412 0.0460663
+-0.0440047 0.127209 -0.00443148
+0.0593281 0.0649895 0.00613553
+0.0127896 0.130142 0.00867876
+0.0391468 0.0887707 0.0338836
+0.0223265 0.0535979 0.0444334
+-0.0897234 0.125377 0.0042981
+0.0287018 0.0447465 0.0341399
+-0.0924969 0.121493 0.0302824
+-0.0717492 0.0821807 -0.0161321
+-0.0756445 0.156326 -0.00458549
+0.00148921 0.104407 0.0433078
+-0.0361895 0.0355992 0.0192692
+-0.0662775 0.0734947 0.0382764
+-0.0730867 0.169281 -0.0259539
+-0.00640617 0.0386668 0.0262232
+-0.053287 0.0610602 0.0282137
+-0.0820828 0.0871799 0.032118
+-0.0474969 0.0477925 0.0396528
+0.0505278 0.0445977 0.0162148
+0.0314571 0.0378867 -6.50808e-05
+0.0244076 0.117212 -0.0083203
+0.0193833 0.052146 -0.0261511
+0.0213663 0.0593118 -0.0264401
+-0.0223265 0.0696009 0.0493961
+-0.0803036 0.100707 0.0327244
+0.0516025 0.0650498 -0.00116678
+-0.0572939 0.0597447 0.0223608
+0.0272121 0.088765 -0.0222319
+-0.0760712 0.152304 0.0343668
+0.0287584 0.0359201 0.00291435
+-0.00327774 0.125061 -0.00864173
+-0.0492123 0.134029 0.0252722
+-0.0157732 0.0799164 -0.0389165
+0.0137184 0.0699424 0.0531931
+0.0181521 0.124421 0.0277923
+0.0195548 0.127052 0.0182976
+-0.0788582 0.171448 -0.0399026
+-0.0820398 0.150272 0.03397
+0.0134064 0.0478115 -0.0258783
+-0.0637307 0.0344451 0.0269565
+0.00741391 0.0920665 -0.0315473
+0.0394368 0.0688303 -0.0107955
+-0.064416 0.154996 0.00586526
+-0.066663 0.144317 -0.015468
+0.0353499 0.042038 0.028119
+-0.00141558 0.03896 -0.0133998
+-0.0338581 0.0334994 -0.0260028
+0.0142608 0.0359816 -0.0203372
+-0.0776263 0.175005 -0.043567
+-0.0525965 0.0345626 0.0431188
+0.0335361 0.0372674 0.00265432
+0.0308902 0.0632769 0.0410591
+-0.0895335 0.144692 0.0121557
+-0.0612693 0.0337096 0.0122134
+-0.00661675 0.0976221 -0.0294208
+-0.0504448 0.128295 0.0323161
+-0.0571803 0.062383 0.0287138
+-0.0529076 0.136719 0.0287121
+-0.0247725 0.0390001 0.0365321
+-0.00277907 0.0769693 -0.0364873
+-0.0894255 0.0956236 0.0134235
+0.0183336 0.0566072 -0.0279953
+-0.0945117 0.124183 0.0222757
+-0.0670539 0.154574 0.0299913
+0.0377471 0.104052 -0.00484079
+-0.0277489 0.0877005 0.0471838
+-0.0465602 0.122394 -0.0114017
+0.0512982 0.0545874 -0.00353058
+-0.0255237 0.116678 0.0329121
+-0.0558854 0.0479468 0.0296668
+-0.0384602 0.127124 -0.00162988
+0.00941217 0.040392 -0.0233006
+-0.0788042 0.109939 0.0428886
+-0.00952807 0.0385271 0.0257083
+-0.0151514 0.041952 0.0515406
+-0.0896796 0.114349 0.0422656
+-0.0130415 0.0639857 0.0543784
+-0.0709434 0.168021 -0.0490096
+-0.042508 0.0562794 0.0398023
+-0.0723361 0.155599 0.00334302
+-0.0804662 0.0800422 -0.00555374
+-0.0320486 0.122707 -0.00572396
+0.0215589 0.120837 -0.00625561
+0.0181166 0.118416 -0.011621
+-0.0473179 0.0397941 -0.0120624
+-0.0797756 0.0706254 0.0155549
+0.00931098 0.130351 0.0216675
+-0.0082877 0.0388999 0.0310374
+-0.0475138 0.156385 0.00914965
+-0.000599084 0.0391028 -0.0250468
+-0.0114889 0.103024 0.0436761
+-0.0176179 0.0378672 -0.0275216
+-0.0423688 0.123346 -0.0104204
+-0.0387324 0.156611 0.00532643
+0.0047217 0.0940547 -0.0316305
+-0.0728512 0.152626 -0.0378881
+-0.00186255 0.103074 -0.0227526
+0.0529842 0.0692584 0.0249064
+-0.0792715 0.107765 0.0320009
+0.0324709 0.0353558 0.0097886
+-0.083008 0.154405 0.0171359
+0.0123335 0.0581189 -0.0294366
+-0.0570144 0.0335354 0.00427397
+-0.0520347 0.0349067 0.0446489
+0.0239781 0.084017 -0.0250643
+0.0450177 0.0875447 0.000184881
+-0.00260981 0.0434451 -0.0255195
+-0.00349422 0.0718336 0.0581766
+-0.0470698 0.154668 -0.0068409
+-0.0764224 0.152995 0.0327283
+-0.0382612 0.0345343 0.0375294
+-0.00240135 0.128537 0.0275513
+-0.0924704 0.117461 0.033305
+-0.0714888 0.127424 0.0521873
+-0.0439578 0.12961 0.0140149
+-0.0725837 0.0763091 -0.0123208
+-0.0595593 0.0341176 0.0246105
+-0.00343172 0.0385593 0.0215021
+0.0311358 0.0782102 0.04331
+-0.0494476 0.122586 0.0319364
+-0.0665119 0.0621274 0.0216726
+0.0544596 0.058178 0.0276568
+-0.0495972 0.118308 0.0316941
+-0.0314789 0.174225 -0.0034609
+-0.0728795 0.116451 -0.00740226
+0.00249754 0.108619 0.0424686
+0.0280724 0.0678498 -0.0217391
+-0.0278862 0.165359 -0.00713919
+-0.0117661 0.182389 -0.0287496
+-2.83383e-05 0.0370817 -0.0151505
+-0.0721646 0.155417 -0.0379087
+0.0297368 0.100819 0.0396604
+0.0224793 0.124852 0.00370943
+-0.0278708 0.104417 -0.0229648
+-0.0388092 0.0372561 -0.0289196
+0.0393949 0.0519685 -0.00680892
+-0.0114113 0.0387598 0.0305221
+-0.0668989 0.0372019 0.0312012
+-0.0634206 0.167809 -0.0425955
+-0.0738654 0.102167 -0.0123482
+0.000515293 0.09714 -0.0288497
+0.00321341 0.034575 0.0192003
+-0.0313524 0.158102 0.00192058
+-0.0879015 0.148743 0.00925863
+-0.0552908 0.158294 -0.000771282
+0.00144018 0.127924 -0.00374837
+-0.0374859 0.0491992 0.0393813
+0.0225251 0.100664 -0.0205487
+-0.0149527 0.0339242 -0.0208085
+0.00432828 0.0582523 -0.0314184
+0.0463488 0.0792498 0.00918224
+-0.0375014 0.105589 0.0387333
+-0.062506 0.149124 -0.0145611
+0.00329475 0.129383 -0.00133175
+-0.00689488 0.0384553 0.0136435
+-0.0384034 0.0343958 0.0323426
+-0.062465 0.163086 -0.0495893
+-0.0639661 0.0690471 0.0355624
+-0.0131121 0.0626059 0.0545133
+-0.0449324 0.0358062 0.00829108
+0.0406445 0.0871881 -0.0107716
+-0.0230795 0.0932192 0.0494322
+-0.0186385 0.0465274 -0.0284289
+-0.0571213 0.0576422 0.00058007
+-0.0705055 0.0343308 -0.00278598
+-0.0578994 0.112578 -0.0159728
+-0.0106785 0.0383169 0.0202432
+-0.0593417 0.119814 0.0404797
+-0.0505461 0.0403717 -0.011217
+-0.0453989 0.0342539 -0.0215146
+-0.011074 0.178648 -0.0249266
+-0.0523515 0.0582314 0.0273813
+-0.0254941 0.0486931 0.0489695
+0.0374187 0.0855245 -0.0157145
+0.0453002 0.0932088 0.00816687
+-0.0612769 0.133878 0.0377403
+0.00152786 0.0745369 0.0570999
+0.0245032 0.122816 0.00162459
+-0.00938967 0.130192 0.0162996
+-0.0703883 0.0339052 -0.000577152
+-0.0733601 0.156855 -0.0299134
+-0.0171472 0.166778 -0.0196136
+0.0116998 0.0819851 0.0538895
+-0.0502854 0.11522 -0.0158495
+0.050316 0.0546413 -0.00421167
+-0.0667548 0.115724 0.0491405
+-0.0609102 0.120922 -0.00906619
+-0.0866023 0.111811 0.0414218
+-0.0669546 0.128237 -0.00895731
+-0.0654028 0.177571 -0.0533847
+-0.0437352 0.0753785 -0.0184868
+-0.0329958 0.0793378 -0.0275102
+-0.00469334 0.101051 0.0441761
+-0.0137252 0.0671481 -0.0375067
+-0.0531289 0.138241 -0.000765665
+-0.0361236 0.163705 -0.0141169
+-0.0249029 0.0722756 0.0462509
+-0.0119797 0.0383916 0.0235247
+-0.0246067 0.157782 -0.00250374
+-0.0748771 0.109206 -0.00842538
+-0.0314894 0.0845774 0.0421902
+-0.0849159 0.123546 -0.00333555
+0.052731 0.0672551 0.000627241
+0.0453449 0.0710055 0.0220458
+-0.0665131 0.0419133 -0.00333369
+0.0194908 0.113962 0.0368661
+-0.0674148 0.142782 -0.0112266
+-0.0931203 0.121503 0.0403997
+-0.0084076 0.0932235 -0.0348708
+0.0125532 0.0900642 0.0534187
+0.0432399 0.0747788 -0.00379578
+0.00477967 0.130785 0.0214562
+0.0461172 0.0759623 0.0190037
+-0.0870553 0.118453 0.000244653
+0.00651257 0.056103 0.0529931
+-0.0623783 0.167824 -0.0485899
+-0.0258496 0.0864897 0.0509722
+0.0602482 0.0581464 0.0141691
+-0.0923082 0.120116 0.0282975
+0.00750533 0.0660627 0.0552439
+0.060666 0.0609482 0.0151682
+-0.0674289 0.114212 0.0481237
+-0.0514122 0.146842 -0.00193867
+-0.0768562 0.117877 -0.00659127
+-0.0825551 0.152911 0.00706582
+-0.0839745 0.0804809 0.0225006
+0.041166 0.0819934 0.0314416
+-0.0655442 0.155124 -0.0481259
+-0.0384965 0.0620329 0.0413169
+-0.0627141 0.159943 -0.0425974
+-0.0767176 0.159013 -0.0120318
+-0.0856607 0.0832001 0.00448541
+-0.0278526 0.181478 -0.0120494
+0.0114013 0.0419017 -0.0239008
+0.0243085 0.123343 0.00295625
+-0.0474528 0.119349 0.0293599
+-0.0304487 0.0334492 -0.0290445
+-0.0696417 0.0422524 0.0026904
+-0.0644028 0.146849 -0.019975
+0.0503218 0.0589081 -0.00447436
+0.0476236 0.0467222 0.0264254
+-0.0303554 0.117939 -0.0127791
+0.0338995 0.0591949 0.0383404
+-0.0746238 0.166812 -0.0222329
+-0.0186858 0.118957 -0.0119398
+0.0507854 0.0445928 0.0142166
+-0.0844285 0.0832425 0.0264792
+0.0593532 0.0636103 0.0211835
+-0.073524 0.16243 -0.0369561
+-0.0525841 0.0574366 -0.00812203
+0.0221795 0.040783 0.0405434
+0.0281375 0.0902298 0.0443276
+0.0214874 0.0892516 0.0486681
+-0.0702718 0.110271 0.0410027
+0.0386345 0.0753534 0.0347776
+-0.0646561 0.0344494 0.0319916
+-0.00663677 0.109707 -0.0221975
+-0.029185 0.0634891 -0.02746
+-0.0671416 0.145678 -0.0214457
+-0.0135214 0.0353632 -0.0181023
+-0.0376703 0.125135 -0.00632213
+0.0114179 0.0489704 0.047894
+-0.0923638 0.118682 0.00930083
+0.0483264 0.0430255 0.0152188
+0.00550628 0.0441375 0.0457857
+-0.0652333 0.0338884 0.0112389
+0.0482587 0.0460086 0.000382582
+0.0586626 0.0538435 0.0111779
+-0.000982862 0.0386959 0.0236934
+-0.0245147 0.119422 0.0312229
+-0.0155858 0.183111 -0.0209193
+-0.0867126 0.0819778 0.0134931
+-0.0785905 0.0980977 0.0353146
+-0.0907184 0.115992 0.0263684
+-0.0614986 0.158424 -0.0305881
+-0.090971 0.141997 0.0221703
+0.049023 0.0722611 0.00748575
+-0.0495658 0.0446328 -0.00989725
+0.000576288 0.0353387 0.0179719
+-0.00263978 0.131127 0.015882
+0.0260716 0.115341 -0.00830033
+-0.0571034 0.0535249 0.00264062
+-0.0471993 0.162132 -0.00733312
+-0.0750917 0.0664543 0.00723246
+-0.0617686 0.159987 -0.035592
+-0.0267825 0.079725 -0.0369434
+-0.061465 0.0438948 -0.0044823
+0.0457823 0.0862054 0.00618349
+-0.065804 0.0609905 0.0192925
+0.0197913 0.0781802 0.0515303
+0.0377275 0.0928421 0.0353087
+-0.0179367 0.12631 0.000372783
+0.0437374 0.0902563 -0.00280325
+-0.00792408 0.0384127 0.0189094
+0.0556221 0.0493651 0.00819776
+0.00641397 0.0375702 -0.0238447
+-0.0274537 0.0485303 0.0479606
+-0.0610187 0.152669 0.0336579
+-0.078775 0.170042 -0.0371202
+0.0527843 0.0462443 0.0112063
+0.0173793 0.0631583 0.049653
+-0.0359664 0.162375 -0.00125909
+-0.0559722 0.134715 -0.00446003
+-0.0484961 0.113915 0.0346796
+-0.00776872 0.0756191 -0.0375185
+-0.085947 0.104892 0.00437979
+-0.0866438 0.152376 0.0233632
+-0.0520552 0.0559741 0.0276222
+0.060777 0.0637293 0.0161648
+-0.0634196 0.15027 -0.0277557
+-0.0514307 0.12406 0.0344067
+-0.00747581 0.101243 0.0443796
+-0.0489909 0.133982 0.00241474
+-0.0174145 0.118412 -0.0133815
+0.0106556 0.0345311 0.0225637
+0.0207029 0.0950845 -0.0226908
+-0.000596635 0.0433605 -0.0249736
+-0.0628762 0.0967673 -0.0179048
+0.0102648 0.0752773 0.0552991
+-0.0281556 0.17562 -0.0175208
+-0.00541266 0.130784 0.0163058
+-0.0708319 0.0345819 -0.00103676
+-0.0204551 0.0879984 0.0554627
+-0.0640233 0.0347562 0.0388023
+-0.0255632 0.0589456 -0.0304089
+-0.0856596 0.0858717 -0.000523015
+0.000533962 0.0773889 0.0579724
+-0.0911932 0.147489 0.0241289
+-0.0536699 0.0338623 0.0207675
+-0.0330023 0.0807475 -0.0275162
+-0.0598207 0.148547 -0.00150215
+-0.0292722 0.116973 -0.0137779
+0.0389134 0.0603588 -0.00677348
+0.00149281 0.111426 0.0424095
+-0.0567184 0.0723883 -0.016755
+-0.0557727 0.0333786 -0.00437552
+-0.0514926 0.0503999 0.033682
+-0.00426203 0.129106 -0.000929037
+0.0209419 0.0535563 0.0459234
+-0.0665114 0.0931036 0.0430214
+-0.0313926 0.112895 -0.0174931
+-0.0358232 0.127618 0.00522677
+-0.0126066 0.128516 0.0224096
+0.0435838 0.0705579 0.0258591
+-0.00308793 0.0379842 0.0148477
+-0.0348769 0.105695 -0.0204457
+-0.0787914 0.0724652 0.0224838
+0.022277 0.0678419 -0.0269851
+0.021809 0.1242 0.000142479
+0.00528322 0.0682375 -0.0327226
+-0.0813944 0.0817284 0.031574
+0.0109283 0.0616839 0.0526314
+-0.0233033 0.0429927 0.0537933
+0.0135067 0.1196 0.0353985
+-0.0856435 0.0805169 0.00650219
+-0.0555634 0.0386377 0.0471443
+-0.0925953 0.129683 0.0262582
+-0.0908852 0.150208 0.0181276
+0.0274474 0.0591653 0.0430806
+-0.0143101 0.113201 -0.0178955
+-0.0695125 0.145609 0.0428052
+0.002489 0.103843 -0.0219556
+0.034067 0.0981569 0.0371457
+-0.0663951 0.140334 -0.00790584
+-0.0462961 0.162745 -0.00789878
+0.0286561 0.108194 -0.012625
+-0.0852651 0.14863 0.0333956
+-0.0290693 0.0677067 -0.0294879
+0.0414097 0.104256 0.00616512
+-0.0693963 0.0393871 -0.00132267
+0.0255358 0.0435625 -0.00763706
+0.0562825 0.0508178 0.0201866
+-0.0867977 0.144597 0.036443
+-0.0252829 0.0751884 0.0479421
+-0.0224834 0.0681349 0.0481925
+0.0575606 0.0537805 0.0213286
+0.00845802 0.129083 -0.00108013
+0.0113649 0.0538487 -0.0294289
+-0.0501252 0.138572 0.00341268
+-0.074971 0.152728 -0.0179063
+-0.0312043 0.0422041 -0.0297469
+-0.0846068 0.0791109 0.00453817
+-0.0536323 0.0602894 -0.00841331
+-0.0171387 0.171259 -0.0162017
+0.0409378 0.0397959 0.0185201
+-0.0781974 0.153502 0.00273811
+-0.0824089 0.107319 0.0275588
+-0.0723216 0.169832 -0.0271166
+-0.0716176 0.109058 0.0379622
+0.000146179 0.101649 -0.0227639
+-0.0522094 0.0517797 0.0246371
+0.0118426 0.0562933 0.0521284
+-0.0625131 0.11843 0.0430565
+0.00861514 0.0345206 0.0221572
+0.0244049 0.0741131 0.0475942
+0.00453562 0.128718 -0.00265628
+0.0138565 0.129875 0.0119166
+-0.070378 0.149076 -0.0386493
+0.0445575 0.0847276 0.0241575
+-0.0157056 0.0599572 -0.0358177
+-0.0558806 0.154815 0.016521
+0.000379078 0.127909 -0.00372478
+0.0266539 0.122169 0.0209401
+-0.0679962 0.167786 -0.0255431
+-0.0920426 0.126958 0.0362532
+-0.0594207 0.0398239 0.0196241
+0.0364837 0.0469104 0.0311466
+-0.0568261 0.139571 0.0318926
+-0.053019 0.141421 -0.000504477
+0.0435234 0.0433666 0.0249665
+-0.0277895 0.06758 -0.0314768
+0.0362342 0.0398741 0.0247937
+-0.0212837 0.0381384 0.0164325
+0.0257555 0.0994695 0.0426751
+0.0399676 0.101315 -0.00381805
+-0.0152962 0.0433291 0.0513434
+0.0573469 0.0674291 0.0231143
+-0.0520755 0.0475411 0.0216528
+0.0328365 0.0876935 -0.0188869
+0.0143568 0.0522918 -0.0274834
+-0.0725069 0.145589 0.0436497
+0.00651279 0.0647152 0.0557475
+0.00953758 0.128186 0.0275085
+-0.052193 0.119749 -0.012566
+-0.0686715 0.165205 -0.0529941
+-0.0896326 0.092928 0.0134378
+0.0289756 0.116666 0.0289439
+-0.0642519 0.118577 0.0476092
+-0.0257723 0.182903 -0.0115399
+-0.0844232 0.100698 -0.00156743
+-0.0206629 0.0479548 -0.0285983
+-0.0532393 0.0448331 0.0206817
+0.00230145 0.0612209 -0.0331693
+0.020878 0.117607 -0.0107498
+-0.0818428 0.103274 -0.0045788
+-0.0184976 0.101625 0.0435583
+-0.0305 0.0674574 0.0390127
+-0.0485029 0.0452121 0.0424266
+-0.0929791 0.124188 0.0282747
+-0.0302252 0.0523701 -0.0173649
+0.00350969 0.0897377 0.0556751
+-0.0219245 0.161037 -0.00376903
+-0.0619129 0.0458194 0.037691
+-0.00376935 0.0769928 -0.0369082
+0.0411698 0.0806497 0.0314486
+-0.0115592 0.100495 0.0448823
+-0.063251 0.15135 -0.00497603
+-0.0271171 0.059077 -0.028426
+0.0053978 0.0390279 -0.0240405
+-0.0676491 0.065582 -0.00407795
+-0.063925 0.0448804 0.0097039
+-0.00969446 0.0598719 -0.0345693
+-0.0860777 0.110355 0.00735249
+-0.0152136 0.174214 -0.0186712
+0.00434041 0.0596672 -0.031584
+0.0213842 0.125707 0.00472943
+-0.0835093 0.13127 0.0505027
+0.0165672 0.128654 0.015768
+0.0285444 0.0459645 -0.0070843
+-0.0721129 0.15894 -0.00533295
+-0.0525858 0.147787 0.0204037
+-0.0465092 0.0776139 0.042786
+-0.00623267 0.10133 -0.0233757
+0.0572046 0.0564633 0.00317356
+-0.0122436 0.112093 -0.0187249
+0.00624351 0.0810351 -0.0338384
+0.0462734 0.0764388 0.00619417
+-0.0168246 0.0855538 -0.0389836
+-0.0869607 0.111738 0.00633151
+-0.0370469 0.152854 -0.00726744
+0.0405338 0.105622 0.0141627
+-0.0164738 0.10119 0.0439603
+-0.0854876 0.0791977 0.0105097
+0.0272664 0.0760665 -0.0234764
+-0.0438604 0.102816 -0.0213031
+0.00350403 0.0533854 0.0535456
+0.0169167 0.127898 0.0201801
+0.0184941 0.0838333 0.0510457
+-0.00847869 0.123725 0.0338017
+0.0387498 0.0659721 -0.0107606
+-0.0437917 0.0422818 -0.0193111
+-0.0126098 0.0384695 0.0251301
+0.0135799 0.0887495 0.0531421
+0.00935699 0.131232 0.0131197
+0.0135065 0.109861 0.0400106
+-0.0850182 0.0831804 0.00149618
+-0.0740846 0.0657329 0.0152043
+-0.0265661 0.0706408 0.0422848
+-0.0847398 0.106178 0.00238203
+-0.0345218 0.0818067 0.0425242
+-0.0428232 0.12861 0.00263817
+0.0121427 0.100268 -0.0226753
+0.0447259 0.0749152 0.000215102
+0.0232974 0.0648673 -0.0252072
+-0.0822784 0.0951136 -0.0065238
+-0.0614844 0.158425 -0.031588
+-0.0521163 0.12407 0.0351298
+-0.0424777 0.104302 0.0409096
+-0.00407779 0.0345848 -0.0173958
+-0.0284243 0.0487716 0.0462084
+-0.0184625 0.0729785 0.0545802
+-0.015609 0.128774 0.0111587
+-0.0694586 0.153877 0.0321166
+-0.0484639 0.149215 0.0104667
+-0.0526002 0.146245 0.0194042
+-0.0263327 0.111444 -0.0179843
+-0.0331847 0.0445939 -0.0279862
+-0.0538972 0.104145 -0.0195691
+-0.0294956 0.124519 0.0193203
+0.0346714 0.0916012 0.0397133
+-0.0247788 0.0379568 0.0140716
+-0.0643494 0.153359 -0.00540282
+-0.00557634 0.0347311 -0.0241073
+-0.0258097 0.0766327 0.0484243
+-0.00867178 0.0387364 -0.0146344
+-0.0783855 0.0873596 0.0368663
+-0.0346878 0.0651683 -0.0148251
+0.0404983 0.0499404 0.0324741
+-0.0738591 0.0964804 -0.0142486
+0.0267717 0.107644 -0.0140409
+-0.0404701 0.104257 0.0399236
+-0.0381489 0.0448685 -0.0242105
+-0.0095211 0.045789 0.0480158
+-0.0311715 0.171175 -0.0164295
+-0.0695038 0.173637 -0.0418473
+-0.0823392 0.111551 0.0443764
+-0.0227424 0.0655154 -0.0353045
+-0.0508568 0.0999518 -0.0219402
+-0.0589296 0.1241 0.041105
+0.000488727 0.108629 0.0427903
+-0.0412638 0.110187 -0.018624
+-0.0147098 0.0613984 -0.0362354
+0.0459347 0.0413813 0.0124396
+0.00323976 0.128177 0.0281353
+-0.0743879 0.143042 -0.00684484
+-0.0264004 0.0577755 0.0382862
+-0.00692431 0.038377 0.0191445
+-0.0864209 0.080641 0.0154973
+-0.077237 0.0721326 0.0266059
+-0.0686311 0.136892 0.0464956
+-0.0792347 0.153789 0.0287725
+-0.0537819 0.0840761 -0.0215562
+-0.0117053 0.0909225 -0.0365538
+0.0365178 0.0541167 0.0317039
+-0.0616584 0.114654 -0.0131207
+0.0390548 0.0884875 -0.0128108
+-0.0887111 0.101017 0.0193703
+0.0162822 0.0666125 -0.0295206
+-0.064714 0.0600149 0.00783247
+-0.0175786 0.180143 -0.0185198
+-0.0408442 0.152602 -0.00723164
+0.0352097 0.0379704 0.0208298
+-0.0618294 0.0342021 0.0275686
+0.0185142 0.0412688 -0.0207398
+-0.0195264 0.159643 -0.00556617
+0.0318624 0.0768516 0.0425881
+0.0347681 0.0641816 -0.0148052
+-0.0479777 0.147732 0.00938552
+-0.0126851 0.0570335 -0.0344182
+0.00495057 0.130435 0.00152594
+-0.0486835 0.0664435 -0.0136416
+-0.0356438 0.0562686 -0.010631
+-0.084499 0.088474 -0.00355332
+-0.0503848 0.141583 0.00270968
+-0.0858587 0.125737 0.0487678
+-0.0426772 0.14763 -0.000244299
+-0.0378831 0.156583 0.00477982
+0.00350659 0.0388434 0.0262887
+-0.0887855 0.102363 0.0143842
+-0.0646755 0.142507 0.0398915
+-0.0909161 0.13091 0.00724248
+-0.055962 0.0343325 0.0321978
+-0.0723047 0.162425 -0.0409479
+-0.0696851 0.11012 0.0394623
+-0.083003 0.0803028 0.000504056
+0.0247589 0.0435818 0.039017
+-0.0218764 0.182954 -0.0200262
+0.0236525 0.124901 0.0169603
+0.0463445 0.0561751 -0.00589814
+-0.0218308 0.117001 -0.0138605
+-0.0747558 0.067415 0.00253432
+-0.0625552 0.176839 -0.0611671
+-0.0660641 0.0384249 0.0148213
+-0.000107958 0.12991 0.000141982
+-0.054081 0.071101 0.0394438
+-0.00558231 0.0361988 -0.024956
+-0.0684451 0.117201 0.0519481
+0.0333957 0.0461492 -0.00598528
+-0.0146115 0.03779 -0.0266447
+0.00133195 0.0385877 -0.00128958
+-0.0348901 0.0738831 -0.020486
+0.0373363 0.105992 0.0277645
+0.0084546 0.131034 0.0184964
+-0.0324996 0.0498708 0.0403614
+-0.0444999 0.0719382 0.0422118
+0.0369643 0.0405549 -0.00158789
+-0.0354954 0.0733233 0.0419636
+-0.0457735 0.0826328 -0.0207974
+0.00732527 0.0595899 -0.0304419
+-0.0874242 0.111776 0.00733879
+-0.0592783 0.115234 -0.0137669
+-0.0928043 0.11882 0.0332998
+-0.0116325 0.0385039 0.00355749
+-0.0398903 0.0344806 0.00870734
+-0.0722375 0.138308 0.048356
+0.0262204 0.0344897 0.0111735
+-0.0200589 0.0348282 0.0498878
+-0.0246346 0.0382795 0.00294393
+-0.0889887 0.147168 0.0287003
+-0.0574968 0.1584 0.00209189
+-0.0329778 0.0448862 0.0466174
+-0.0605914 0.0623502 0.0262507
+-0.0785506 0.0699758 0.0176232
+-0.0362833 0.17342 -0.00108904
+-0.0627087 0.161508 -0.0465953
+-0.0397898 0.0855606 -0.0217035
+-0.0064056 0.10047 0.0472751
+-0.0646908 0.166411 -0.0300665
+-0.0508247 0.0941547 -0.0216781
+0.00716942 0.125754 -0.00749941
+0.000702847 0.0392103 -0.00758345
+-0.0407154 0.0462046 -0.018322
+-0.0401921 0.166668 -0.0117758
+0.0124864 0.11785 -0.0149995
+-0.0887986 0.114294 0.0264066
+-0.0614886 0.156862 -0.0235899
+0.0301602 0.0673157 0.0417954
+-0.0697061 0.156309 0.0202886
+0.0512708 0.0700979 0.0242688
+-0.00208274 0.0390983 0.0321346
+-0.091649 0.146116 0.0221478
+-0.0423664 0.0392174 0.0434612
+-0.0288487 0.0944704 -0.0247187
+-0.0724483 0.148649 -0.034807
+0.0270658 0.12207 0.0196667
+-0.0370838 0.159234 -0.0122889
+-0.00750248 0.0619634 0.0561006
+-0.0533112 0.162693 5.53048e-05
+-0.00276518 0.0755391 -0.036261
+-0.0186814 0.0539839 -0.0321072
+-0.0875792 0.134961 0.00324767
+0.0120758 0.0363869 0.044646
+-0.0753955 0.0901087 0.0394375
+0.0338247 0.108829 -0.00728203
+-0.0444976 0.0789577 0.0421738
+0.0235632 0.0862591 0.0483322
+0.0465947 0.0750442 0.0151558
+-0.0733825 0.135448 0.0501828
+-0.0150618 0.0383341 0.0229424
+-0.00891681 0.0351082 0.0414685
+0.0315143 0.0525771 -0.0117816
+0.045527 0.0791773 0.00219591
+-0.0464963 0.076159 0.0423522
+-0.0708979 0.122353 -0.00862039
+-0.08595 0.110378 0.0213654
+-0.0783775 0.103446 0.0335489
+-0.0758029 0.111217 -0.00664466
+-0.0554837 0.0805968 0.0447827
+-0.0353516 0.166776 -0.00214363
+0.0562979 0.0633024 0.00123284
+0.0465716 0.0440008 0.0231655
+-0.0476369 0.0591928 -0.0118235
+-0.0288774 0.169748 -0.00856256
+0.0153133 0.121135 -0.0105519
+-0.0397313 0.072486 -0.017441
+-0.016397 0.0337307 -0.02279
+0.0603039 0.0650788 0.0091381
+-0.0878637 0.152463 0.0169978
+-0.0754938 0.127441 0.0530403
+-0.067202 0.162346 -0.0569974
+-0.0865386 0.147279 0.0332936
+-0.0535025 0.0440354 0.0449405
+-0.0735938 0.149845 -0.0348818
+-0.0728566 0.162156 -0.0114327
+0.0495045 0.0651553 0.0285253
+0.012555 0.130318 0.0128667
+0.0220735 0.113988 0.0356074
+0.0224569 0.125562 0.0179459
+-0.0810243 0.0936828 -0.00856919
+-0.0756675 0.155622 -0.00260296
+-0.0431622 0.0422126 -0.0213185
+-0.000694781 0.0597985 -0.0333207
+0.0271246 0.0849281 0.0463473
+0.0173609 0.0897252 -0.0270298
+-0.0358944 0.0334964 -0.0263993
+-0.0576531 0.0612704 -0.00372094
+-0.00707611 0.0386628 0.0278929
+-0.0560526 0.151627 -0.00172465
+-0.030326 0.045 0.0496314
+-0.00103499 0.117326 -0.0163697
+-0.0252491 0.162472 -0.00507229
+0.00208806 0.113117 -0.0199282
+-0.0939 0.124133 0.015262
+-0.0129795 0.0384272 0.0232864
+0.00120237 0.0867098 -0.0346725
+0.0353317 0.112044 0.0241962
+0.00450167 0.0459455 0.0484199
+-0.0863511 0.0872693 0.000483167
+-0.0164554 0.0963571 0.0512639
+0.0121283 0.11013 -0.0187853
+-0.0778795 0.103388 -0.00866618
+0.0245137 0.102392 -0.0184072
+0.0201875 0.0974057 -0.022456
+-0.0168907 0.0921233 -0.0358082
+-0.0691832 0.153837 -0.0495596
+0.0155185 0.129225 0.0096832
+-0.00814574 0.0386661 0.000442505
+-0.0927289 0.125458 0.0102641
+-0.0846445 0.0832051 0.023501
+-0.0527541 0.0782706 -0.0196088
+-0.0206459 0.171255 -0.0142383
+0.0273486 0.110085 0.0362063
+-0.0144833 0.105825 0.0431811
+-0.0295885 0.120405 -0.00932945
+-0.0914492 0.117418 0.0293041
+-0.0259115 0.159753 -0.0130913
+-0.0498456 0.123179 -0.0101809
+0.0474532 0.047084 -0.00164907
+0.0201466 0.0658754 0.0483972
+-0.0546819 0.0486825 0.0116705
+0.0366139 0.0573407 -0.00875458
+0.016382 0.0888799 -0.0281622
+-0.0128318 0.0653357 0.0541739
+-0.0495043 0.073253 0.0416255
+0.0380257 0.084795 0.0357219
+-0.055962 0.148162 0.0296522
+-0.00335679 0.11693 -0.0159223
+-0.0164885 0.0382449 0.0155037
+-0.0943085 0.12145 0.0162821
+-0.0604949 0.104288 0.0411949
+-0.0485787 0.153602 0.0103738
+0.0214629 0.119376 0.0329783
+-0.00921964 0.0390042 -0.0131222
+0.046038 0.044353 0.0245911
+0.00963825 0.115048 0.0386641
+-0.077742 0.161125 -0.0199262
+-0.0274983 0.0932247 0.0447643
+-0.0237144 0.062529 -0.0332478
+0.0256802 0.0685786 0.0440967
+-0.000627469 0.039269 0.0340794
+0.0387649 0.0834441 0.0350467
+-0.0144799 0.123658 0.0314246
+-0.0415001 0.0733705 0.042415
+0.0543119 0.0722872 0.00750454
+-0.0799536 0.133905 -0.00443135
+-0.0728995 0.10646 -0.0108772
+0.0465866 0.0714909 0.00427537
+-0.0734754 0.158245 -0.0309204
+-0.0217961 0.0784868 -0.0389208
+0.0328256 0.0611992 -0.0167775
+-0.00849082 0.119665 0.0373867
+-0.0345047 0.106995 0.0387065
+-0.0624367 0.153758 -0.0135798
+0.0343704 0.104711 0.0323207
+-0.0583832 0.0335298 0.00219999
+0.0202943 0.113982 0.0365633
+0.0149493 0.0344805 -0.015521
+0.0238985 0.104719 0.0399907
+-0.0270163 0.155641 -0.00359794
+-0.0207265 0.111071 -0.0196229
+0.00439792 0.0404664 -0.024069
+-0.0314988 0.165308 -0.00534483
+-0.0506374 0.0334455 0.00204379
+-0.0518913 0.130385 -0.00375074
+0.00347876 0.039945 0.0459765
+-0.0174912 0.108558 0.0415716
+-0.0618685 0.158412 -0.0345942
+-0.0509699 0.122064 -0.0109984
+-0.0801245 0.0746668 0.000525034
+0.0485976 0.0429932 0.0132228
+0.0202555 0.0707617 -0.0282449
+-0.086473 0.130788 0.000288786
+-0.0859798 0.13928 0.042828
+-0.0419021 0.157999 0.00424081
+0.0301266 0.0646197 0.0417292
+-0.0241332 0.0349697 0.043675
+-0.0554996 0.0466308 0.0421953
+0.0244135 0.114257 -0.0111426
+-0.0687634 0.168362 -0.025835
+-0.0212185 0.178615 -0.022031
+0.0451425 0.0775553 0.0229667
+0.0084768 0.116844 0.0380952
+-0.0619218 0.112503 -0.0143567
+0.0015045 0.0661578 0.0563313
+-0.0473123 0.0369901 -0.0152765
+0.0576745 0.0551294 0.00518333
+-0.0736262 0.148585 -0.0238576
+0.055706 0.0507437 0.0211984
+0.0038008 0.130941 0.0210967
+-0.0360463 0.0347343 0.0430826
+-0.0865396 0.139093 0.00420465
+-0.000664914 0.0539666 -0.0309917
+-0.0785368 0.0694183 0.0145853
+-0.0521695 0.144678 0.0173655
+0.0205519 0.0414936 -0.0177079
+-0.0764027 0.109871 -0.00664525
+-0.0455151 0.0533187 0.0381544
+-0.010362 0.0388675 -0.00761727
+-0.0465826 0.121367 -0.0123258
+0.060067 0.0636708 0.0191758
+-0.0214848 0.0347602 0.0479269
+0.0295458 0.115836 -0.00482165
+0.0188031 0.106638 -0.0169667
+-0.00873489 0.068452 -0.036144
+-0.0504955 0.0733248 0.0417999
+0.00250961 0.101617 0.0444387
+-0.0134598 0.0645734 0.0539775
+-0.0304851 0.038633 -0.015152
+-0.00443456 0.111901 -0.0205597
+-0.038606 0.0392918 -0.0284798
+-0.022624 0.0450535 -0.0281102
+0.0262273 0.117277 0.0307934
+0.0282585 0.063629 -0.0207965
+-0.0649158 0.115218 -0.010913
+-0.0197994 0.0799106 -0.0390737
+-0.042508 0.0930307 0.0424902
+-0.0683794 0.0434664 0.00169373
+-0.0648724 0.131147 0.0430922
+-0.00487539 0.105927 -0.0225105
+-0.0678583 0.112732 0.0457592
+0.00821621 0.124741 -0.00840458
+-0.0564446 0.0520481 -0.00138381
+-0.020896 0.107686 -0.0220438
+-0.0919111 0.120015 0.00829626
+-0.0188214 0.0841215 -0.0388306
+-0.00848834 0.10866 0.0434392
+-0.0674721 0.0639504 -0.00252382
+-0.0321962 0.0487152 0.0429222
+0.0422051 0.0972089 -0.00180239
+-0.0312857 0.125233 0.0186818
+0.0348151 0.0605689 0.0379285
+-0.07566 0.1555 -0.0199215
+-0.0582195 0.03947 0.0465299
+-0.0144966 0.0687907 0.0546395
+-0.0630713 0.173863 -0.0616798
+0.0398379 0.0874103 0.0331324
+0.0167269 0.0821369 0.052401
+0.0403742 0.101353 -0.00282827
+-0.0622911 0.150653 -0.0125749
+-0.0707931 0.0879477 -0.0165704
+0.048521 0.043083 0.00923259
+0.0132697 0.0603324 0.0507028
+-0.0230427 0.038006 0.0179945
+0.0585617 0.0538351 0.0161785
+-0.0548868 0.108372 -0.0183778
+-0.0712698 0.156094 0.0241098
+-0.0053845 0.126096 -0.00772897
+-0.076026 0.151346 0.0359505
+0.00881068 0.127643 0.0286728
+-0.0229191 0.119996 -0.0109969
+-0.0702091 0.156071 0.0113882
+-0.0285896 0.0704574 -0.0325207
+-0.0373694 0.173381 -0.00150317
+0.043508 0.0438731 -6.08517e-05
+-0.0434927 0.0747943 0.0426652
+-0.0817644 0.0758778 0.0206878
+-0.00439411 0.0968663 -0.0305974
+0.00748123 0.0937253 0.0527164
+0.0101565 0.0860282 0.0551829
+-0.0132478 0.039072 0.0352601
+-0.0786774 0.168631 -0.0343418
+-0.0500333 0.148713 -0.00320857
+0.00694939 0.128215 0.0280149
+0.0132662 0.0737717 -0.03084
+-0.089989 0.142041 0.0291697
+-0.0298412 0.0944347 -0.0243277
+-0.0866185 0.103641 0.022352
+0.0179014 0.114016 -0.0148856
+0.0537258 0.0735615 0.0163564
+-0.0413654 0.128702 0.0120304
+-0.0855876 0.0939777 -0.00157288
+-0.0828574 0.0764021 0.018249
+-0.0454932 0.0491469 0.0390026
+-0.0317045 0.0693753 -0.0244624
+-0.0587034 0.0579543 0.010904
+-0.0269178 0.034755 0.0450156
+-0.0520173 0.146257 0.0174096
+-0.0759561 0.112612 -0.00567952
+-0.0164906 0.0786958 0.056769
+-0.0778425 0.108614 0.0370385
+0.0422463 0.0403355 0.0183005
+-0.0845698 0.0831877 0.0245094
+0.00429984 0.0654625 -0.0332399
+-0.0572715 0.0482006 0.0365817
+0.0290027 0.0741128 0.0436952
+-0.0600502 0.143934 0.0360579
+0.0366467 0.0673305 0.0371158
+-0.0199983 0.126616 0.0197793
+-0.0728415 0.165906 -0.0186805
+-0.0634251 0.128316 0.0434644
+-0.0437757 0.12944 0.0066621
+0.000274533 0.0683164 -0.033854
+0.00152244 0.03707 0.0220484
+-0.0349517 0.151884 -0.00344832
+-0.0271199 0.0347243 -0.0201972
+0.0433938 0.0426486 0.00136855
+0.000501319 0.0576739 0.0545888
+-0.0636327 0.155181 -0.0386163
+-0.0884108 0.0928321 0.00744302
+-0.0495652 0.0614019 0.0343808
+-0.0434939 0.0930777 0.0427388
+-0.0662865 0.178231 -0.0601734
+-0.054498 0.111159 0.0367038
+-0.0460532 0.057401 0.0380948
+-0.0820259 0.0858257 0.0320864
+-0.0277337 0.0521019 -0.0243965
+-0.00442413 0.130145 0.0224484
+-0.00149759 0.0549023 0.0548542
+-0.035558 0.0430076 -0.0284728
+0.0593498 0.066038 0.0207029
+0.0515344 0.0624078 0.0294591
+-0.0197872 0.118912 -0.0118682
+-0.0168075 0.0827608 -0.0394117
+-0.0487872 0.0545643 0.0352206
+-0.0311424 0.174761 -0.015609
+-0.0326324 0.0534241 -0.0105104
+0.00577065 0.131636 0.0103849
+-0.0185368 0.123815 0.0276913
+-0.0454963 0.0818291 0.0431013
+-0.0634376 0.179008 -0.0598746
+-0.00652958 0.0443624 0.0478753
+-0.0308041 0.0566412 -0.01742
+0.0448472 0.0735234 0.00122364
+-0.00349567 0.0504603 0.052334
+-0.0298753 0.0537337 -0.0203803
+-0.00256734 0.0388997 -0.00235847
+-0.0502892 0.0334774 -0.00701976
+-0.00481396 0.0840888 -0.0377627
+0.0387801 0.058953 0.031306
+-0.0243507 0.0852386 0.0537426
+-0.077502 0.0785105 0.0333799
+-0.0695501 0.0378481 -0.00149869
+-0.0313945 0.0862693 -0.0285563
+-0.0759552 0.133992 -0.00682355
+-0.0783042 0.161088 -0.0239376
+0.0512217 0.0595245 0.030012
+0.0455105 0.0777762 0.00219892
+-0.0860997 0.0805682 0.0085045
+-0.0347118 0.121713 -0.00868145
+-0.0621446 0.0384632 0.0179813
+-0.0124987 0.115524 0.0391996
+-0.0407326 0.0341812 -0.0112599
+-0.0762949 0.0689313 0.00454567
+-0.0900211 0.137875 0.0231818
+0.0335661 0.0612752 -0.015761
+-0.0620569 0.121268 0.0436785
+0.0389827 0.104151 0.026189
+-0.0724692 0.135469 0.0497506
+0.0222613 0.0692548 -0.0269722
+-0.0614967 0.0876222 0.0452319
+-0.0694862 0.120387 0.0531587
+0.0384699 0.0786144 -0.011749
+-0.0225096 0.10992 0.040117
+0.0140839 0.123776 -0.0073928
+0.0455444 0.0774866 0.0217209
+0.0421217 0.0751567 0.0292241
+-0.0637125 0.165316 -0.0311513
+0.00714876 0.108764 -0.0200496
+-0.0613421 0.118288 0.041013
+0.0150763 0.0900809 0.0517899
+0.0392297 0.0926988 -0.0100859
+-0.0707648 0.0836514 -0.0167885
+0.0199669 0.107838 -0.0162613
+-0.0573264 0.0521522 0.00163442
+0.03817 0.0983612 -0.0088053
+-2.43522e-05 0.0348774 0.0110061
+-0.0647928 0.0346609 0.0159953
+-0.0765127 0.164562 -0.0208538
+-0.0398786 0.107079 -0.0200332
+-0.0315509 0.053914 -0.013393
+-0.0689152 0.109432 -0.0116742
+-0.0426992 0.0344898 0.0348747
+-0.0113643 0.182132 -0.0288209
+-0.0251052 0.162299 -0.0151004
+-0.0745879 0.156108 0.0200327
+-0.0686632 0.162379 -0.0529737
+-0.0867316 0.100467 0.0250232
+0.0335218 0.0499029 0.0322045
+0.0110844 0.0345718 0.0406762
+0.047975 0.0710438 0.0215578
+-0.0471313 0.132491 0.00541336
+0.0385464 0.0954957 -0.00890109
+-0.055495 0.154378 0.0181054
+-0.0486202 0.0403225 0.04496
+-0.0918049 0.121541 0.0434848
+-0.0427276 0.129253 0.0100405
+-0.0641572 0.150753 -0.03179
+0.0203307 0.08353 0.050588
+-0.0025157 0.127417 -0.00520554
+-0.0664375 0.153657 -0.0486366
+0.00823253 0.112336 0.0401545
+-0.0239671 0.075324 0.0508435
+-0.0519769 0.0340995 -0.0134375
+-0.0444607 0.0902688 0.0428496
+-0.043053 0.153237 -0.00732462
+-0.0520076 0.145723 -0.00116844
+-0.0587286 0.0620484 0.0269094
+-0.0876727 0.111787 0.0358475
+-0.0843489 0.0925325 -0.00454911
+-0.00849886 0.0856701 0.0574538
+-0.0681283 0.146379 -0.0251159
+-0.0800217 0.102057 0.0324029
+-0.0662458 0.167287 -0.027765
+0.0214869 0.0865002 0.0492244
+-0.0485551 0.129676 -0.000935313
+-0.021529 0.17126 -0.0137526
+0.0263623 0.0808978 0.0469671
+-0.00180556 0.0384438 0.0201303
+0.0199827 0.116932 -0.0120267
+0.000700235 0.0374335 0.0215506
+-0.0849215 0.130733 -0.00170191
+-0.0566837 0.0492811 -0.00237706
+0.013902 0.054865 0.0498147
+-0.0487235 0.0738176 -0.0166605
+-0.0588289 0.089737 -0.0207103
+-0.00415565 0.0996194 0.0496007
+0.00922789 0.0860105 0.0556146
+-0.052373 0.126911 0.0347775
+-0.0647638 0.0397203 0.0149016
+-0.0375028 0.102851 0.0403695
+0.012678 0.130036 0.0186174
+0.01582 0.0346802 0.0234839
+-0.0834012 0.146003 0.0386574
+-0.0855432 0.111388 0.0330811
+-0.0905559 0.1297 0.0402277
+0.0225 0.108418 0.039052
+-0.034538 0.033729 0.00866796
+0.0580527 0.0523859 0.0111812
+0.0489522 0.045877 0.023734
+-0.0741385 0.0703655 0.0287707
+-0.0261092 0.0409213 0.0540071
+-0.0124916 0.0801274 0.0575032
+-0.0480938 0.0362157 0.0456887
+0.0295798 0.047722 0.0354768
+-0.051366 0.129708 0.032749
+-0.0258406 0.0339312 -0.0210821
+-0.0627466 0.0751872 -0.0173542
+-0.0208698 0.104444 -0.0228641
+0.0391583 0.108387 0.0121653
+-0.0217873 0.0728206 -0.0385569
+-0.00162182 0.0363065 0.0130228
+-0.0125908 0.182249 -0.0250896
+-0.0463216 0.125305 0.0258345
+0.00739775 0.110951 0.0406753
+-0.0698286 0.0965949 -0.0159812
+0.0495953 0.0662964 -0.000416722
+0.0214 0.116687 0.0346491
+0.0355013 0.0605581 0.0371681
+0.0347485 0.0981702 0.0363481
+-0.0784998 0.130283 0.0530344
+-0.0139533 0.0338864 -0.0205741
+-0.0185901 0.128007 0.0115203
+-0.0538047 0.0884108 -0.022116
+0.0213383 0.0635548 -0.0266585
+-0.0194915 0.120861 0.0324568
+-0.0347476 0.127441 0.00854521
+-0.0126238 0.0952928 -0.0330113
+-0.00102634 0.107271 -0.0216101
+0.0225395 0.0352111 0.00978173
+0.0193228 0.0679612 -0.0287395
+0.00111873 0.0344764 0.0134191
+0.0375161 0.110639 0.00638069
+0.0222494 0.0762728 -0.0263867
+-0.0729386 0.0646873 0.0146181
+-0.0397368 0.0739371 -0.0178005
+-0.0543178 0.0387289 0.0471882
+0.016338 0.0566541 -0.0286494
+0.0299119 0.0491593 0.0359714
+0.0525507 0.0462401 0.0172033
+0.0138891 0.0942573 -0.0257865
+-0.00745761 0.0338748 -0.0230567
+-0.073507 0.121801 0.0535653
+-0.0771635 0.0705018 0.0227664
+0.014215 0.083589 -0.0300782
+0.0187635 0.105558 -0.0177865
+-0.0943455 0.121485 0.0232874
+-0.0190471 0.0582949 0.0492947
+-0.0482842 0.164088 -0.00583628
+0.00750123 0.074495 0.0564449
+0.0114903 0.0896115 0.0540357
+0.0111129 0.0739356 0.0547693
+-0.0243199 0.0387345 -0.0140132
+0.0343886 0.107359 0.0305696
+0.0280618 0.0416802 0.0314173
+0.01142 0.0374719 -0.022733
+0.0330999 0.114889 0.024788
+-0.0199406 0.122541 -0.00772092
+-0.0662581 0.15274 0.0347724
+0.00215199 0.101646 -0.0224127
+0.0164932 0.112605 0.0382483
+-0.06512 0.166493 -0.0287867
+-0.0848366 0.0898781 -0.00356125
+-0.0321536 0.0380399 -0.0168
+-0.000666067 0.037425 0.0194672
+-0.0009793 0.0356154 0.0137824
+-0.0338572 0.100054 -0.0225702
+-0.0466969 0.0694537 -0.0155404
+-0.0236112 0.0386852 0.0334692
+0.0506847 0.044695 0.00922239
+0.0143403 0.11733 -0.0144441
+0.0447757 0.0875223 -0.000814326
+0.0359341 0.0727624 -0.0138488
+-0.0526285 0.0588799 -0.00854194
+-0.090746 0.114598 0.00833305
+0.0454568 0.0819591 0.00221362
+-0.0191965 0.175667 -0.0232885
+-0.062765 0.0780997 -0.0182585
+0.0414338 0.0676164 -0.00577635
+-0.053491 0.113891 0.0350292
+0.0043588 0.0510132 -0.0293749
+-0.00874604 0.0713519 -0.0371122
+0.0193852 0.0915557 -0.024942
+-0.0944514 0.122808 0.0172688
+-0.00774122 0.115628 -0.0165086
+-0.0406319 0.0534345 -0.0110028
+0.0230588 0.0463265 0.0401038
+-0.0769246 0.0689689 0.00654258
+0.0278197 0.108769 0.0368873
+-0.078478 0.142827 0.0455967
+0.0339472 0.0368914 0.0179028
+0.0140143 0.0357038 0.00388789
+-0.0699623 0.155307 -0.0499609
+-0.0144161 0.0343188 -0.0191903
+-0.044261 0.122001 0.0258917
+-0.064466 0.170264 -0.0443864
+-0.0614851 0.112533 0.0365644
+-0.0649074 0.120907 -0.00883756
+0.0114806 0.097647 0.0487825
+0.00178793 0.0344587 0.00626566
+0.0404914 0.098527 -0.00482713
+-0.0714142 0.166619 -0.0469903
+0.0553639 0.0729653 0.0110394
+-0.00645384 0.126073 -0.0076982
+-0.042494 0.0676556 0.0412962
+-0.0328931 0.0486572 0.0421875
+-0.0218312 0.0882119 -0.0370399
+0.0433826 0.0987102 0.00417641
+-0.034498 0.0533048 0.037996
+-0.0749535 0.0823401 -0.0135889
+-0.0755022 0.131669 0.0524935
+-0.0118269 0.118985 -0.0140536
+-0.0698809 0.100876 -0.0145572
+-0.0920212 0.128183 0.00926455
+-0.0277533 0.155598 -0.00253083
+-0.0155991 0.0421323 -0.0272897
+0.0125549 0.119968 -0.0132874
+-0.0862929 0.15121 0.027304
+-0.0726068 0.147127 -0.0218633
+-0.0713282 0.0982044 0.0407618
+-0.023785 0.0621839 0.0426152
+-0.0294793 0.0446083 0.0503994
+0.050676 0.0693821 0.00244948
+-0.0520559 0.142894 8.38275e-05
+-0.085494 0.083212 0.00349969
+0.0219046 0.0892697 -0.0245066
+-0.0923861 0.125586 0.0352607
+-0.0578149 0.12313 -0.00798101
+-0.0630458 0.0345815 0.0177326
+-0.0890554 0.0888307 0.00946144
+-0.066735 0.167252 -0.0265095
+0.0143257 0.0594816 -0.0287805
+0.00349695 0.0519735 0.0532512
+-0.0658642 0.141582 -0.00840157
+0.014169 0.0603418 0.050255
+-0.0638047 0.152122 -0.00224548
+0.0332402 0.0814034 -0.0189012
+-0.0246071 0.0408479 -0.0291354
+-0.0320867 0.0651952 -0.0194497
+-0.0719291 0.0394019 0.00652921
+-0.0297834 0.0409697 0.0520218
+-0.035582 0.0336826 0.00849877
+-0.088744 0.0996845 0.0203875
+0.0516874 0.0662489 -0.000355134
+-0.0802571 0.096729 0.0342047
+-0.0669809 0.135535 -0.00827796
+-0.069479 0.0337046 -0.000209101
+-0.0675145 0.148386 0.0398761
+-0.0805311 0.123088 0.0509172
+-0.0084955 0.0503277 0.0510127
+0.00205693 0.129985 1.8398e-05
+-0.0172313 0.12808 0.0178394
+0.00170313 0.0343139 0.0118694
+-0.0773727 0.156953 -0.0129034
+-0.0717154 0.0632455 0.0160979
+0.00858548 0.0340902 -0.01633
+0.0124197 0.0403679 -0.0230567
+-0.0511271 0.116882 0.0329705
+-0.0728598 0.0355014 0.00645302
+-0.0791962 0.16801 -0.0379842
+-0.00268972 0.128069 -0.00389854
+0.0597918 0.0567046 0.013171
+0.0154995 0.111258 0.0392925
+-0.019299 0.0668878 0.052102
+-0.0233826 0.0866124 0.0541509
+0.0432138 0.091668 0.0251628
+-0.0396808 0.0636721 -0.0135815
+0.00652038 0.0518639 0.0525018
+0.0124104 0.0389053 -0.0225983
+-0.0119403 0.171322 -0.0192115
+-0.069435 0.0972593 0.0417284
+-0.0942583 0.125557 0.0232684
+0.030238 0.0814876 -0.0201701
+0.0449279 0.0945923 0.00916323
+-0.0553588 0.131132 0.0357618
+0.00929414 0.0653548 -0.0316941
+-0.0357484 0.0768864 -0.0192776
+-0.062693 0.156802 -0.0376031
+-0.0460193 0.128067 0.0236255
+0.0133301 0.0609017 -0.0290805
+0.00152141 0.0773467 0.0574533
+-0.0636035 0.156128 0.0166435
+-0.0361137 0.162217 -0.0137308
+-0.0595062 0.0386574 -0.00901889
+-0.0620309 0.153757 -0.0155846
+-0.0533723 0.122605 0.0368904
+-0.0264702 0.0676761 0.0408217
+-0.0147452 0.123455 -0.00671201
+-0.0703548 0.0643588 0.00158224
+-0.0814272 0.0752484 0.0195365
+0.0402499 0.0787503 -0.00875238
+-0.00644119 0.0828529 0.0570838
+0.0242228 0.0902502 0.0474811
+0.0336268 0.0557054 -0.0117007
+-0.0623153 0.13671 0.0362243
+0.0149059 0.124307 -0.00595517
+-0.0401601 0.165169 -0.0119868
+-0.077431 0.108115 0.0357399
+0.0402513 0.0940026 0.0302416
+0.0370616 0.0382621 0.0191175
+0.0225195 0.106011 0.0397482
+-0.0255993 0.037974 -0.029094
+-0.0759547 0.129619 -0.00760722
+-0.0360191 0.153642 0.00214438
+0.0596848 0.0566967 0.0151763
+-0.0264473 0.181471 -0.0150302
+-0.0346676 0.0359024 -0.017193
+0.0391135 0.0904981 -0.0117677
+0.00550174 0.0745058 0.0566062
+-0.0615874 0.117934 -0.0105067
+-0.0897323 0.115129 0.0291209
+0.0371127 0.037099 0.0128773
+0.000643571 0.127035 0.0301068
+0.04471 0.0789677 0.024116
+-0.0294983 0.0588236 0.0368769
+0.0243457 0.102123 0.0424029
+-0.0890326 0.125361 0.00330134
+-0.0671124 0.0618759 0.00376788
+0.0207378 0.105279 -0.0174962
+-0.0640597 0.156709 -0.043612
+-0.053836 0.112592 -0.0169505
+-0.0738585 0.0762694 0.0355202
+-0.00709045 0.130506 0.0171336
+-0.0735939 0.077695 0.036626
+-0.0453238 0.169855 -0.00399069
+-0.0609112 0.060145 0.00105228
+-0.0602298 0.119796 0.0409592
+-0.037803 0.0885803 -0.0235006
+0.0220645 0.0375334 0.0362702
+-5.6077e-05 0.112952 -0.0196345
+-0.0156034 0.097548 -0.0273897
+0.0330435 0.104766 0.033885
+0.0234619 0.0343557 0.00702041
+0.0309186 0.094253 -0.0177648
+-0.0406484 0.0563266 -0.0113192
+0.0305338 0.0929359 0.042541
+-0.0713282 0.155382 -0.0439108
+-0.0246656 0.0492403 -0.0269082
+-0.0344954 0.118007 0.0312549
+0.03264 0.0822319 0.0419892
+0.0393737 0.0381589 0.0105128
+0.00986741 0.131059 0.0147331
+-0.0521114 0.156091 -0.00406652
+0.0125143 0.121868 -0.0113432
+-0.019839 0.0610753 0.0486026
+-0.0714347 0.109953 0.0409933
+-0.0435006 0.115257 0.0335166
+-0.0700918 0.147968 0.0410511
+-0.0628279 0.151059 0.0360546
+-0.0269995 0.0383068 0.000625566
+-0.0459023 0.0546326 0.0380387
+-0.0705411 0.0860609 0.0417748
+-0.0360717 0.157766 -0.0114869
+0.018169 0.108481 -0.0169141
+-0.0656915 0.0720893 -0.0135891
+-0.0604976 0.0847283 0.0441029
+0.00648432 0.0413231 0.0455852
+-0.0757282 0.0754387 0.0328339
+0.00417753 0.0922823 -0.0325433
+-0.0272993 0.0381948 -0.0178418
+-0.0315044 0.0860003 0.0426216
+-0.00681874 0.0868473 -0.0370495
+0.0396972 0.0744788 -0.00980523
+0.0376515 0.0947835 -0.010301
+-0.078491 0.121738 0.0515581
+-0.0274838 0.105666 0.0409158
+-0.0202559 0.0365056 -0.0280118
+0.0201693 0.125674 0.00144037
+-0.0587501 0.0482189 0.00571238
+-0.013346 0.168342 -0.0159797
+-0.0683811 0.149044 -0.0363633
+-0.0558475 0.0343686 0.0374162
+-0.0590903 0.0626036 0.0281123
+-0.0331372 0.0336314 -0.0222436
+-0.0678611 0.0980605 -0.0159397
+-0.0472308 0.0334623 0.00452598
+-0.0167567 0.0714512 -0.0386579
+-0.0184671 0.10319 -0.0232847
+-0.0675365 0.0805511 0.0417814
+-0.0666009 0.15275 -0.0468174
+-0.00387787 0.10737 -0.022403
+-0.0300213 0.0579734 -0.0204069
+-0.00579466 0.103184 -0.0232761
+-0.0775304 0.143071 -0.00473432
+-0.00757151 0.0346922 -0.0244599
+-0.0355091 0.0676694 0.0413832
+-0.0185092 0.127137 0.00354165
+0.0289004 0.0650837 -0.0199869
+-0.0224914 0.04868 0.0491885
+-0.0194885 0.0856172 0.056795
+-0.0625301 0.147537 -0.0105732
+0.00324634 0.0726279 -0.0347233
+-0.0117444 0.129778 0.0154481
+0.0381223 0.106958 0.0251953
+0.0134297 0.0343278 -0.0118215
+0.00450615 0.0772491 0.0561317
+0.00914326 0.112364 0.0397506
+0.0165994 0.0933382 -0.024824
+-0.0530349 0.0448324 0.0176964
+-0.0861503 0.0818963 0.00748815
+-0.07574 0.144451 -0.00587632
+-0.0796195 0.104749 0.0319273
+0.0404835 0.052774 0.0322642
+0.0420568 0.0986443 0.0231563
+-0.0887511 0.102351 0.0133854
+0.0132668 0.0723896 -0.0312102
+-0.0507233 0.0723393 -0.0157137
+-0.00754786 0.039018 -0.00905888
+-0.0488259 0.138613 0.00940263
+0.0057745 0.128094 -0.00399317
+-0.0523396 0.147791 0.0193952
+-0.048265 0.136372 0.0159973
+-0.0604426 0.0470258 0.0346715
+0.0367367 0.0902141 0.03744
+-0.0895793 0.136441 0.0122186
+0.0376089 0.108292 0.000165208
+0.0353713 0.0915869 0.0389643
+-0.0211976 0.0347654 0.0444796
+0.00223085 0.129379 -0.00131325
+-0.0737831 0.0864021 -0.0154104
+-0.0127393 0.0700008 -0.0380391
+-0.0657273 0.0751276 -0.0164058
+0.00937487 0.0377648 0.0302588
+-0.035816 0.0448118 0.0437923
+-0.0549046 0.102722 -0.0198351
+0.0460481 0.046714 0.0276632
+0.00759173 0.131318 0.00819364
+-0.0721931 0.161015 -0.0399435
+0.0102622 0.0710503 -0.0323195
+0.0194745 0.0851519 0.050256
+-0.0399319 0.0345158 0.0389424
+-0.0616692 0.167812 -0.0545903
+-0.0056922 0.0584499 -0.034018
+-0.0203692 0.094546 -0.032294
+-0.070351 0.158156 -0.0469171
+-0.023866 0.103031 -0.0237009
+0.0528846 0.0533107 -0.0017243
+-0.0319516 0.077812 -0.0315646
+0.00951738 0.0660057 0.0546772
+0.0137336 0.122464 0.0333928
+-0.0199595 0.125484 -0.000738697
+0.00049871 0.116947 0.0399069
+-0.0359892 0.0344491 0.0345711
+-0.0443682 0.129764 0.015339
+0.0452819 0.0932028 0.00617084
+-0.00813465 0.0391286 -0.0130168
+0.0394097 0.0618135 -0.00677045
+-0.0701845 0.158483 -0.00465374
+0.0322675 0.102123 0.0362847
+-0.0374987 0.0819015 0.0436538
+0.0396969 0.0616754 0.0309066
+-0.0455673 0.0475992 -0.010259
+-0.0527627 0.115451 0.034109
+0.0208176 0.0631975 0.0476002
+-0.0618301 0.0924936 -0.0189652
+-0.053883 0.150856 0.0253998
+0.0245243 0.105615 0.0392344
+0.00385761 0.129628 0.0254511
+-0.00549072 0.0488848 0.0502608
+-0.0300389 0.036799 0.0524219
+-0.0580426 0.153536 0.0303048
+0.0220166 0.125337 0.0220596
+0.0312265 0.0393227 0.0260732
+-0.0171047 0.17569 -0.0178772
+0.016571 0.0940211 0.0486896
+-0.0505514 0.0338848 0.0267025
+-0.0625417 0.0410514 0.0154849
+0.0355348 0.112677 0.0214127
+0.00150774 0.0897546 0.056027
+-0.0190957 0.0968508 -0.0266962
+0.0511508 0.0608575 0.0299274
+0.0163905 0.0491901 -0.024833
+0.0345652 0.114846 0.0110543
+0.0581139 0.0523629 0.0131822
+-0.0417396 0.0754091 -0.018561
+-0.0814751 0.118981 0.0489466
+0.00013405 0.105909 -0.0216496
+-0.0908345 0.139239 0.02018
+-0.0424766 0.101515 0.0416909
+-0.0260624 0.0837492 0.0512652
+-0.0500875 0.0531258 0.0337221
+-0.0706477 0.0874116 0.0418374
+-0.0366978 0.0363155 -0.0300943
+0.00451245 0.064772 0.0563635
+-0.0753069 0.109577 0.0422017
+-0.0284025 0.119846 0.0286714
+0.033406 0.0822268 0.04133
+0.0595932 0.0608555 0.0201843
+-0.00204808 0.0983649 0.051847
+-0.0574847 0.0623327 0.0283417
+-0.0229389 0.126187 0.00412352
+0.0390327 0.0744186 -0.0107818
+-0.0855097 0.129367 -0.00169404
+-0.0647036 0.0653044 0.0298737
+-0.0064934 0.10867 0.043581
+-0.0685164 0.0669975 0.0293604
+-0.0705096 0.1624 -0.046948
+0.0125251 0.129483 0.0214195
+-0.0221845 0.172691 -0.0208918
+0.0153262 0.0767707 0.0538598
+-0.0905235 0.137837 0.0161933
+-0.0545439 0.0402656 -0.0102441
+-0.0688509 0.171089 -0.0344529
+-0.0884641 0.0887716 0.00547605
+-0.0903526 0.116014 0.0283099
+-0.0623807 0.147545 -0.00857398
+-0.061927 0.109672 -0.0156348
+-0.0579856 0.116646 -0.0132522
+0.0395731 0.0448559 0.0300931
+0.00658391 0.130753 0.00354793
+-0.0647804 0.153444 -0.00410741
+0.00522677 0.078235 -0.0342467
+-0.0495662 0.0335706 -0.0032948
+0.00181081 0.131692 0.0146438
+-0.0635975 0.15411 -0.00948093
+-0.0855227 0.133522 0.000289437
+-0.025262 0.107417 -0.0217613
+-0.0340021 0.0409714 0.0491624
+-0.0146057 0.0406867 -0.0271172
+-0.0174894 0.0687336 0.053904
+-0.01522 0.183001 -0.0269465
+-0.0500642 0.142991 0.00242772
+-0.0679313 0.0622594 0.0032802
+-0.0551811 0.133216 -0.00483226
+-0.0284216 0.0792864 0.045297
+0.00824429 0.0809884 -0.0331618
+0.00929618 0.123787 -0.00937811
+0.0228212 0.0889774 -0.0242065
+-0.0185099 0.0883573 0.0560195
+0.0282298 0.0717826 -0.0228933
+-0.0251238 0.125152 0.00185767
+0.019545 0.103378 0.0442321
+-0.0673703 0.122848 0.0518073
+0.0357587 0.067099 -0.014806
+0.00197653 0.0987575 -0.0246237
+-0.0655762 0.155146 -0.00586759
+0.012488 0.119576 0.0355898
+-0.0514967 0.101534 0.0419051
+-0.0095351 0.0444416 0.0488648
+-0.00470695 0.0982478 -0.0280611
+-0.05601 0.0575293 -0.00241387
+-0.0602761 0.139548 0.0339321
+-0.0517453 0.0753545 -0.0181561
+-0.038969 0.042042 0.0415955
+-0.0636896 0.064322 -0.00564195
+-0.0398457 0.0985451 -0.0219087
+-0.0191826 0.127252 0.0185952
+-0.0873123 0.0886781 0.00248146
+-0.0488082 0.0884112 -0.0217819
+-0.0498768 0.104205 -0.0203216
+-0.0409029 0.149467 0.00342301
+-0.069185 0.156032 0.0248455
+-0.0506717 0.0501974 0.0196351
+-0.0301161 0.0396403 0.0523893
+-0.000520242 0.104454 0.0440018
+-0.0290025 0.0578755 -0.022406
+-0.0610145 0.0336026 0.00878975
+-0.0917872 0.143341 0.0171661
+-0.0279974 0.0383174 -0.0050935
+-0.0913132 0.113305 0.0163255
+0.0313508 0.109263 -0.00976359
+-0.00332487 0.0387243 0.0268007
+0.0222104 0.125239 0.00503339
+-0.04503 0.129294 0.00327025
+-0.0176724 0.0933571 0.0538975
+-0.0234883 0.0487024 0.0493089
+0.0421092 0.0724515 0.0291612
+-0.0653912 0.159256 -0.0130566
+-0.00402317 0.0387663 0.0011878
+-0.0338313 0.0929547 -0.0239607
+0.00379004 0.0367184 0.046186
+-0.0186801 0.0525094 -0.0314832
+-0.0351354 0.165203 -0.0147634
+-0.0705038 0.108294 0.0372772
+0.0246817 0.0360382 0.0240669
+-0.0204805 0.0828473 0.0567838
+0.0326609 0.0673309 0.0401471
+-0.0296335 0.0635627 -0.0254272
+-0.0548571 0.0546624 -0.0043828
+0.00968485 0.0342244 -0.0162577
+-0.0810826 0.144759 0.0420272
+0.00767659 0.0346834 0.0054103
+-0.0830301 0.110196 0.00131843
+-0.00544058 0.119032 -0.0141551
+-0.0255852 0.0930492 -0.0306058
+-0.0714911 0.116102 0.0521112
+0.0318609 0.0710037 -0.0187224
+0.0280264 0.121739 0.0100361
+-0.0514799 0.0384723 -0.0115832
+-0.0764395 0.0988661 -0.011539
+-0.0186212 0.04503 -0.027692
+0.0334766 0.0519565 -0.00767966
+-0.0541438 0.151337 0.0259237
+-0.00148294 0.0606073 0.0558577
+0.0148272 0.0344434 -0.00977208
+-0.0391932 0.171233 -0.0109027
+-0.035755 0.0783248 -0.0195335
+0.0355134 0.0795005 0.0390801
+0.0603494 0.0609121 0.0171857
+0.0394635 0.075864 -0.00982057
+-0.0470363 0.0359078 0.0451061
+-0.0608634 0.154346 0.0292597
+-0.0748097 0.109257 0.0407877
+-0.0262745 0.0692227 0.0420449
+0.0243768 0.0533073 -0.022554
+-0.0530668 0.0348658 0.0444554
+0.0259946 0.0347155 0.014606
+-0.0591124 0.121234 0.0408265
+-0.0144894 0.112737 0.0404341
+-0.0838486 0.0803675 0.00250235
+-0.0582446 0.13534 0.0351018
+-0.0214986 0.100246 0.0444424
+-0.0713881 0.068562 0.0291565
+-0.0155474 0.160527 -0.0107791
+0.0215063 0.107058 0.0398344
+-0.0331542 0.158077 0.00281987
+-0.0863235 0.110381 0.0203696
+-0.0312005 0.162424 -0.00314295
+0.0384543 0.0395883 0.0218564
+0.0385307 0.0554981 0.0313684
+-0.0114896 0.0560578 0.0523304
+0.0593092 0.0622231 0.0211664
+-0.0648434 0.0339553 0.0130374
+0.0180082 0.0355585 0.00482766
+0.0399371 0.077993 0.0331058
+0.00160174 0.0351275 0.0454175
+-0.032718 0.0396362 0.0507617
+-0.0524899 0.0973506 0.0433264
+-0.032502 0.104286 0.0408563
+-0.00468764 0.0584239 -0.0337898
+-0.0672529 0.0760725 0.0393761
+0.0584714 0.0552095 0.0201836
+-0.0416396 0.0548863 -0.0113812
+0.014767 0.129313 0.0151085
+0.0271615 0.0578042 0.0426556
+-0.0133509 0.0384568 0.00507202
+-0.0770775 0.0703016 0.00351307
+-0.0514866 0.0748352 0.0426181
+-0.0882111 0.0936365 0.0238814
+-0.0906238 0.143032 0.0276653
+0.0233319 0.059176 0.0459237
+-0.036826 0.0446589 -0.0260242
+0.0332346 0.0955533 0.0394336
+-0.000484271 0.038989 -0.00201961
+0.0427221 0.101476 0.00816485
+0.0419002 0.102864 0.0131587
+-0.0208004 0.181643 -0.0143459
+0.0352424 0.0726953 -0.0147969
+-0.0234839 0.0509996 0.0435588
+0.0352381 0.0443124 0.029693
+0.000403091 0.0348316 -0.0232847
+-0.0684959 0.10279 0.039811
+0.019265 0.0708008 -0.0287723
+-0.0516068 0.0345225 0.0433683
+0.0391514 0.0617239 0.0318804
+0.0135008 0.111258 0.0394003
+0.0304359 0.108504 -0.0109544
+-0.038743 0.0768256 -0.018638
+-0.0223183 0.094515 0.0486399
+-0.0435018 0.0478421 0.040059
+-0.0727332 0.173623 -0.0510446
+-0.00349112 0.118315 0.0390164
+-0.0884421 0.133772 0.0426038
+-0.0454967 0.109818 0.0383281
+-0.0145 0.0392233 0.0384538
+-0.00466385 0.129429 0.0252614
+-0.00582274 0.088227 -0.0364178
+-0.0454902 0.0352033 -0.0224188
+-0.0348607 0.100046 -0.0224582
+-0.0792519 0.17071 -0.0410714
+-0.0376133 0.0393512 -0.0290006
+-0.0640598 0.170094 -0.0457055
+0.0303225 0.119467 0.0166127
+-0.0902791 0.116199 0.0435835
+0.0222032 0.0352055 0.0243097
+-0.073336 0.0968702 0.0400088
+-0.0376144 0.0393494 0.044329
+-0.0105011 0.0870252 0.0569814
+-0.0507332 0.161533 -0.00440491
+-0.0779412 0.162504 -0.0229403
+-0.0754919 0.128859 0.0530266
+-0.0541372 0.0344723 0.0359505
+0.0113242 0.0581457 -0.0297724
+-0.0442953 0.0391467 0.0441537
+0.0242713 0.035754 0.000294462
+-0.0615051 0.159991 -0.0325895
+-0.00166807 0.0568963 -0.03242
+-0.0119937 0.164096 -0.013967
+0.0166698 0.0900802 0.0505874
+0.0232051 0.0672264 0.0457926
+-0.0547028 0.0693497 -0.0142348
+-0.0645039 0.15312 0.03389
+-0.0344884 0.0918084 0.0445658
+0.0553932 0.0493283 0.0071983
+-0.047221 0.115086 -0.0157836
+-0.0737507 0.0835282 -0.0152437
+-0.00700363 0.0992954 0.0501023
+-0.0124605 0.0646213 0.0545516
+-0.0529942 0.0345374 0.0413527
+-0.0926054 0.122844 0.0302746
+-0.0652377 0.0419529 0.0337045
+0.0450967 0.0889619 0.00117113
+-0.0632063 0.0448721 0.0103941
+-0.0177692 0.074285 -0.0389303
+-0.0226723 0.0582322 -0.0321918
+-0.0233871 0.0380454 0.010662
+0.0144228 0.120472 -0.0118376
+-0.00758227 0.0362053 -0.0250795
+-0.0394882 0.0804267 0.0429074
+0.0505096 0.0651476 0.0284061
+0.0412879 0.0914659 -0.00877665
+-0.0613587 0.0343255 -0.00949544
+-0.0739143 0.148544 -0.0218644
+-0.0607701 0.0447346 0.0418038
+-0.0300938 0.0476999 -0.0248901
+-0.0666558 0.0720875 -0.0129051
+-0.0732714 0.156195 0.0132096
+-0.0340151 0.0498932 -0.013349
+-0.0484988 0.0762375 0.0432182
+-0.0614924 0.0384787 0.0187446
+-0.0572292 0.155416 0.0145778
+-0.0105966 0.0391805 -0.0262222
+0.00120442 0.117582 -0.0166604
+-0.070211 0.165211 -0.0489867
+0.0483875 0.0444574 0.00325794
+-0.0764978 0.13308 0.0521415
+-0.035201 0.0345651 0.0381519
+-0.00449959 0.107273 0.0439086
+-0.0266181 0.042276 -0.0292233
+-0.0364985 0.120712 0.0292752
+-0.0735593 0.15583 0.0102013
+-0.0554797 0.0848037 0.0450617
+-0.0845128 0.0817443 0.00347449
+-0.0169788 0.106067 -0.0223329
+-0.0699464 0.151677 0.0365135
+-0.0160243 0.0897174 -0.0373532
+-0.035698 0.0857595 -0.0237144
+-0.0308696 0.105755 -0.0215547
+-0.0475005 0.084795 0.044997
+0.00720445 0.088027 -0.0329216
+0.0388792 0.085648 -0.0137779
+-0.0451911 0.163637 -0.00858913
+-0.0752855 0.176467 -0.0519633
+-0.0568165 0.155074 0.0161832
+0.0369538 0.108295 0.0261877
+-0.0788782 0.172865 -0.0427748
+-0.0439777 0.0345259 0.038072
+0.0238242 0.0981836 0.0451545
+-0.0394936 0.0548399 0.0395943
+0.0242629 0.0790161 -0.0251629
+-0.0665084 0.0903473 0.0440273
+0.0291366 0.0495584 -0.0147305
+0.0191581 0.0357679 0.0376614
+-0.0278785 0.0535209 -0.0244081
+-0.00947834 0.12371 0.0334225
+-0.0570388 0.149629 0.0316784
+0.0117574 0.130329 0.0182774
+-0.00158005 0.131357 0.0134024
+-0.0657222 0.0431534 -0.00229362
+0.0404535 0.0689201 -0.00879299
+-0.0195496 0.161752 -0.0147401
+0.0435566 0.0695959 0.0259839
+-0.0893231 0.14203 0.0321578
+-0.0832597 0.10897 0.0263609
+0.00296745 0.0390391 -0.00510833
+0.0160439 0.0505074 0.0458237
+-0.0213985 0.181639 -0.0134576
+0.000249699 0.0347599 0.0129869
+-0.0138688 0.163706 -0.0171714
+-0.0787597 0.163865 -0.0299483
+-0.0321103 0.178539 -0.0110044
+-0.0062818 0.102371 0.0437669
+-0.0504236 0.113946 -0.0165184
+-0.0808373 0.0858965 0.0337281
+-0.0833697 0.0790868 0.0225099
+0.0174757 0.101745 0.0462033
+0.0562413 0.0521934 0.00418603
+-0.0386753 0.127489 0.0159666
+-0.0714887 0.0860678 0.0412957
+0.00930465 0.0639279 -0.0315779
+-0.038992 0.126654 0.0188148
+-0.0617292 0.0435742 0.0131822
+-0.0807044 0.109603 0.0338418
+0.01567 0.0343236 0.00175615
+-0.0151083 0.184586 -0.0219884
+-0.0792845 0.0704649 0.0170607
+-0.0611161 0.170955 -0.0586033
+-0.0656715 0.0684169 0.0339875
+-0.0346163 0.0505906 -0.0107587
+0.0292004 0.0566287 -0.0178044
+0.0402348 0.101386 0.0251818
+-0.0356488 0.118923 -0.0117804
+-0.00759062 0.117967 -0.0150103
+-0.0344873 0.0959942 0.0440904
+-0.0675456 0.035487 -0.00647
+-0.0177849 0.0784811 -0.0386843
+-0.0357813 0.0828042 -0.0224653
+-0.0217893 0.122494 0.0280004
+-0.040789 0.084093 -0.0212481
+-0.0448136 0.0629573 0.0395248
+-0.0851812 0.137956 0.0449006
+-0.0879612 0.103656 0.0103875
+-0.0558857 0.0998486 -0.020419
+0.017256 0.079507 0.0531399
+-0.0315382 0.178553 -0.0120253
+-0.06991 0.11224 -0.0100103
+-0.0512969 0.0556828 0.0150377
+0.0224682 0.0520683 0.0428376
+0.0143831 0.0448677 -0.0245168
+-0.0794364 0.144805 0.0432098
+-0.0638846 0.103946 -0.0172176
+-0.0284346 0.0849121 0.0465284
+0.0144928 0.11263 0.0387455
+-0.0860797 0.0882889 0.0261675
+-0.00931865 0.0862591 -0.0377315
+-0.0226749 0.0380487 0.0198364
+-0.0875543 0.0861148 0.0194651
+-0.0578317 0.0344516 0.0369209
+-0.0410907 0.157679 -0.0102957
+-0.0680436 0.0337635 0.00720288
+-0.0778811 0.104813 -0.00803583
+0.0518058 0.0553999 0.0290848
+-0.0504997 0.160817 0.00728082
+0.0241356 0.0632152 0.0453534
+-0.0268604 0.100151 -0.0237263
+0.0127955 0.0874066 0.0537621
+-0.0616261 0.155549 0.00719382
+-0.0593595 0.0336431 -0.00899455
+-0.065903 0.0643977 0.026882
+0.0278843 0.0536982 -0.0197695
+-0.0335041 0.0789099 0.0415331
+0.0414488 0.0873044 0.0301508
+-0.0627531 0.161513 -0.0475897
+0.0292606 0.0447502 0.0332372
+0.0105493 0.122164 -0.0116505
+-0.0908004 0.115922 0.00730178
+0.0306755 0.0581744 -0.0167704
+-0.0745653 0.158254 -0.0269305
+0.0417869 0.088692 -0.00877741
+-0.0765465 0.107865 0.0361429
+0.0291715 0.104768 0.0370747
+-0.0435198 0.0436724 -0.0163157
+-0.0639905 0.155091 0.00636862
+-0.0676976 0.156296 0.0180917
+0.0361371 0.0605355 0.0363255
+-0.0831336 0.135327 0.0485953
+-0.0205283 0.125395 0.0225414
+0.0218584 0.126105 0.0106
+-0.0573551 0.0335045 0.00783858
+-0.0766685 0.144473 -0.00485242
+0.0215827 0.0449804 0.0414892
+-0.0623027 0.152202 -0.0135791
+-0.0124889 0.118271 0.037774
+-0.058999 0.129653 -0.00698695
+0.0212269 0.035264 0.00760182
+-0.0558448 0.0533792 -0.00239414
+-0.042206 0.147853 0.000366775
+-0.0732213 0.156852 -0.0309091
+0.00482377 0.0349755 -0.00101746
+0.00553205 0.131427 0.00744951
+-0.0606157 0.0459479 0.0402046
+0.00228793 0.0626666 -0.0335374
+-0.00869718 0.172706 -0.0257786
+0.0265924 0.0466157 -0.0146569
+0.0293044 0.0481199 -0.00974071
+-0.0278981 0.0863323 0.047373
+0.029421 0.0461183 -0.00671048
+-0.058539 0.0588103 0.0191792
+-0.0577583 0.0479183 0.03595
+0.0299489 0.069977 0.0415097
+-0.0877683 0.149882 0.0273982
+-0.0403006 0.122206 -0.0112466
+-0.0731823 0.109139 0.039466
+0.00748061 0.115492 0.0392535
+-0.0323193 0.0339823 0.0197127
+-0.00249248 0.0911617 0.056251
+-0.0410706 0.0335739 0.0056728
+-0.0167629 0.120643 -0.00969861
+0.0170314 0.126681 0.0245104
+-0.0933703 0.118789 0.0242915
+-0.0167466 0.161131 -0.0135692
+-0.037714 0.0710075 -0.016855
+-0.0748306 0.094995 -0.0139518
+-0.0653015 0.169027 -0.0374543
+-0.0171592 0.0387994 -0.0126424
+-0.0649264 0.112407 -0.0127033
+0.0089357 0.131311 0.0143899
+-0.0695053 0.106913 0.0375568
+-0.0679519 0.129695 -0.00900682
+0.0196594 0.10025 -0.0221259
+0.0187375 0.0672729 0.0498973
+-0.0634922 0.0626336 0.0253957
+-0.0640428 0.0593154 0.0139941
+-0.0365043 0.0691064 0.0417512
+-0.0509946 0.0547172 0.0191515
+-0.0684996 0.106934 0.0379267
+-0.0391114 0.149509 -0.00165293
+0.00150153 0.0534013 0.0535077
+-0.0610153 0.131125 -0.0076807
+-0.015856 0.0980295 -0.0258983
+0.0549279 0.0723085 0.00788581
+0.0296197 0.117006 0.0277632
+0.00535242 0.130989 0.0202309
+-0.000691446 0.0612541 -0.0338404
+0.00150093 0.0441835 0.0459725
+-0.0611099 0.11531 0.0378549
+-0.0695161 0.108303 0.0373324
+-0.0543547 0.158623 0.00837339
+-0.0945603 0.124158 0.0182654
+-0.0535009 0.111177 0.0367213
+-0.0119534 0.0385403 0.00164014
+-0.0370531 0.166795 0.000693639
+0.0161005 0.115637 -0.0146217
+-0.0669681 0.132599 -0.00847972
+-0.0192376 0.0362049 0.0528295
+-0.0510947 0.138549 0.00140254
+0.0199501 0.126815 0.00703133
+-0.0280876 0.0511424 0.0415727
+0.0021184 0.108719 -0.0202691
+-0.0455158 0.0889126 0.0438293
+0.00898082 0.0376394 0.0339008
+-0.0913279 0.147458 0.016148
+-0.00573884 0.0712887 -0.036141
+0.0184912 0.0906471 0.0481735
+-0.0240484 0.159369 -0.0122932
+-0.00386335 0.103093 -0.0232514
+-0.0903131 0.126767 0.00528424
+-0.00141239 0.101018 0.0444401
+-0.0265472 0.0384572 -0.00862977
+-0.0461338 0.160629 -0.00828859
+0.0434078 0.0958974 0.0221477
+-0.0323682 0.0778417 -0.0305703
+-0.0104869 0.166942 -0.0170857
+0.0335642 0.11614 0.00925074
+-0.0679156 0.112303 -0.0110315
+0.0448529 0.0917799 0.0171662
+-0.0902457 0.140661 0.0271695
+0.0361358 0.102075 -0.0100705
+-0.0774559 0.158948 -0.0154272
+-0.0718839 0.142969 -0.00986002
+0.0254315 0.0862638 0.0474376
+0.0233509 0.0549381 -0.0249484
+0.0445042 0.0650854 0.0275412
+0.0472882 0.0731371 0.0168777
+0.0310703 0.0352449 0.00774073
+-0.0540072 0.144242 -0.000990452
+-0.0901845 0.132425 0.0322244
+-0.0305014 0.066031 0.0387492
+-0.0636396 0.163113 -0.0245909
+0.0265757 0.0754454 0.0454823
+0.0560761 0.0692634 0.0230866
+0.0323242 0.117657 0.0116569
+-0.0744896 0.128852 0.0526631
+-0.092535 0.126933 0.0292581
+-0.021881 0.107267 -0.0220871
+0.0216673 0.125834 0.0205048
+-0.0892808 0.140568 0.013241
+-0.0188177 0.0683045 0.0530002
+0.0181426 0.117476 -0.0126083
+-0.0562843 0.049932 0.00898241
+0.0271917 0.0858851 -0.0222975
+-0.0354636 0.172718 -0.000342918
+-0.0113055 0.0991708 0.0485876
+-0.0512476 0.149342 0.0143776
+0.0112062 0.129253 0.000760937
+-0.027273 0.123571 -0.00271305
+-0.0942867 0.122796 0.0162787
+-0.0731111 0.152638 -0.0358925
+-0.0630631 0.0351206 0.0420909
+-0.0638567 0.0981567 -0.0173229
+-0.0886136 0.0969805 0.0223931
+0.0376971 0.0381803 0.0174952
+-0.0389196 0.163835 0.00150184
+0.0470726 0.048551 -0.0036464
+-0.0195067 0.119545 0.0340058
+-0.0154952 0.101637 0.0439764
+-0.0615198 0.167807 -0.0565879
+0.000487515 0.110024 0.0426254
+0.0218587 0.0714183 0.0491823
+-0.0891206 0.0888853 0.014456
+0.00728906 0.0602827 0.0543511
+0.0159015 0.122788 0.0313235
+0.0287151 0.0982016 0.0416756
+-0.0515592 0.162515 0.00512403
+-0.0562626 0.0437454 0.0167126
+-0.0181312 0.0948304 -0.0325641
+-0.0375002 0.0337858 -0.019518
+-0.0283411 0.0368095 0.0535577
+0.0138368 0.126165 0.029064
+-0.0698832 0.115052 -0.00855978
+-0.0166197 0.126668 0.0238945
+-0.062914 0.11807 -0.00990368
+-0.0489018 0.129654 0.0292632
+-0.0524468 0.0489914 0.023647
+-0.0590382 0.132561 -0.00680716
+-0.0429798 0.150656 0.00610371
+-0.0708619 0.0368523 0.00979504
+0.0198172 0.102563 -0.0205962
+0.0416527 0.0846461 0.030449
+-0.0215106 0.119492 0.0328652
+-0.0144877 0.185446 -0.0257702
+0.0475192 0.0568404 0.0316921
+-0.0913388 0.115949 0.00831473
+0.0281313 0.0591962 0.0423168
+-0.035495 0.171374 -0.0137494
+-0.0736292 0.156748 -0.0014693
+-0.00249426 0.0505094 0.0526827
+-0.0909607 0.144377 0.0265412
+-0.0410851 0.123071 0.0255089
+-0.0226414 0.0961417 -0.0259441
+0.0264078 0.120534 -0.000510633
+-0.0193661 0.126578 0.00214409
+0.0465619 0.0568462 0.0320779
+0.0207007 0.040829 0.0419301
+-0.0564899 0.0440403 0.0448345
+0.000863008 0.0381264 -0.0140589
+-0.0418598 0.102811 -0.0210501
+-0.00158954 0.0376715 -0.025054
+-0.0723294 0.177884 -0.0550149
+-0.0544961 0.0732542 0.0409056
+-0.00649673 0.121064 0.0364033
+0.0504194 0.0446982 0.00822878
+-0.0153541 0.0337728 -0.0226273
+-0.0303696 0.0486908 0.0439216
+-0.0334968 0.033775 0.00883944
+-0.0685163 0.108328 0.0375372
+-0.0304988 0.0603029 0.0376116
+-0.0662971 0.0363734 0.0376513
+0.0311541 0.072342 -0.0197804
+0.016819 0.0860765 0.050782
+-0.067492 0.0944588 0.0423306
+-0.0187655 0.0714126 -0.0384549
+-0.0605051 0.128314 0.040613
+0.00838174 0.0449018 -0.0251393
+-0.0164768 0.122235 0.0319313
+0.0227625 0.125142 0.00666699
+-0.0528343 0.0337802 -0.0114802
+0.0451301 0.0903696 0.00218472
+-0.0576106 0.148673 -0.00161022
+0.00250457 0.100333 0.0462614
+-0.0262513 0.0350951 0.0517484
+-0.054684 0.067848 -0.0128124
+-0.0441291 0.159145 -0.00944971
+-0.0440467 0.0380432 -0.0230799
+-0.0447681 0.146394 0.00358641
+-0.0894274 0.0915536 0.0114438
+-0.0751139 0.0954949 0.0389973
+0.0383178 0.106879 0.000185785
+-0.0732998 0.0654414 0.00491231
+-0.00228741 0.13015 0.0232201
+-0.0372213 0.150899 -0.00386632
+-0.0261116 0.0809919 0.0513952
+0.0322341 0.112712 0.0291688
+-0.0690565 0.0338884 -0.00389811
+0.0101437 0.101615 -0.0217271
+0.0425651 0.10009 0.017161
+-0.0355201 0.16973 -0.000114667
+0.00176571 0.0954911 -0.0311224
+0.0373922 0.0461028 -0.00552229
+-0.0261166 0.163762 -0.0159025
+-0.0651006 0.0458549 0.00368955
+0.0212923 0.0982999 -0.0220426
+0.026467 0.0383015 -0.00253304
+-0.0231343 0.0383693 -0.0171708
+0.00758009 0.121578 -0.0129987
+-0.0491724 0.116402 -0.0151155
+-0.0174383 0.038419 -0.00120725
+-0.0368548 0.0985914 -0.0223265
+-0.0599288 0.145383 0.0362513
+0.00646924 0.0964123 0.0516046
+-0.0630484 0.138442 -0.00719818
+-0.0266978 0.0917701 0.0460149
+-0.0534968 0.0790911 0.0438637
+-0.0203653 0.0682964 0.0517114
+0.0203853 0.049027 -0.0227929
+-0.0539349 0.0527611 0.0108042
+0.0460422 0.0848268 0.0101717
+-0.0728228 0.148718 -0.0323717
+0.0337238 0.11401 0.0250189
+-0.0718098 0.0864713 -0.016231
+-0.000525817 0.0352062 0.0124275
+0.0044963 0.0605551 0.0556784
+0.0278498 0.045613 -0.00720046
+0.0242032 0.0987613 -0.0205495
+0.0133536 0.0359529 -0.0210721
+-0.00614443 0.0386147 0.00639011
+-0.091603 0.144731 0.0191577
+-0.00870302 0.0387758 0.0292604
+0.00137957 0.0343513 0.00995357
+0.0580311 0.0716366 0.0149943
+0.029585 0.0495591 -0.0127459
+-0.0873232 0.0873446 0.00247822
+-0.0562907 0.154938 0.0178178
+0.0227189 0.116065 -0.0110894
+-0.089541 0.143417 0.0301691
+-0.0295204 0.0607307 -0.0234192
+-0.072166 0.0982206 0.0402281
+0.0461397 0.0764263 0.0052018
+-0.0650238 0.0405393 0.0286621
+-0.0357662 0.0798799 -0.0213145
+-0.0210545 0.100222 -0.024166
+-0.051798 0.0884029 -0.0218862
+-0.0585235 0.0425717 0.0226979
+-0.0581184 0.132538 0.0370402
+-0.0500652 0.125773 -0.00688378
+-0.0570027 0.145725 -0.00171879
+-0.000114754 0.120081 -0.0133088
+-0.0558569 0.135328 0.0332838
+-0.071744 0.162192 -0.0110365
+-0.0533559 0.0609747 0.0280244
+-0.0678966 0.110866 -0.0116376
+-0.0708871 0.119431 -0.00850422
+-0.0743754 0.0995209 0.0381506
+-0.0827936 0.110133 0.0365
+0.0274001 0.0354299 0.0197116
+-0.0700593 0.152584 0.0349486
+-0.0594807 0.0398598 0.0207095
+-0.0506478 0.0648447 -0.0114426
+-0.0548507 0.0955893 -0.0216695
+-0.0735032 0.144216 0.0449341
+-0.0746874 0.169403 -0.0279937
+-0.041349 0.172669 -0.00697494
+-0.0879813 0.0968653 0.0054141
+-0.0639066 0.158701 -0.0499459
+-0.0295413 0.0348538 0.0461198
+0.0425062 0.0610428 0.0297234
+-0.0761006 0.0693618 0.0222283
+0.0350916 0.102085 0.0333486
+-0.0434936 0.107078 0.040105
+-0.0210995 0.166843 -0.0113898
+-0.0599936 0.0459773 0.0409964
+0.0260763 0.0726986 0.044735
+0.0368852 0.111459 0.00613554
+-0.00301536 0.127034 0.030217
+-0.0313536 0.0384061 -0.00216621
+0.0173795 0.0350198 0.030737
+-0.072846 0.165216 -0.0419869
+-0.0344415 0.176449 -0.00471515
+0.00170995 0.0392427 0.0309786
+-0.04085 0.0985381 -0.021696
+-0.0479764 0.135553 0.00940627
+-0.0332667 0.0835875 -0.0265323
+0.0206498 0.0781917 0.0510092
+0.0122103 0.0893249 -0.030653
+-0.0464803 0.0335784 -0.0137021
+-0.0367962 0.0383714 -0.00507539
+-0.00449141 0.0911839 0.0565229
+0.0243337 0.0605883 -0.0247185
+-0.0826166 0.123078 0.0498508
+0.0540378 0.0525213 0.0252382
+-0.0675101 0.0369158 -0.0062949
+-0.0205096 0.124449 -0.00369667
+0.0285796 0.107031 -0.0133812
+0.0320794 0.0526694 -0.0107538
+-0.0203373 0.0610131 0.0476733
+-0.0674469 0.0396367 -0.00494886
+-0.0599339 0.120955 -0.00911512
+0.0168017 0.105866 -0.0181237
+-0.0787857 0.0744548 -0.00455566
+0.0193044 0.127372 0.00964815
+-0.038368 0.0457007 -0.0229731
+-0.025877 0.125557 0.00449924
+-0.0609237 0.0414243 0.0237035
+-0.0433646 0.153626 0.00736711
+-0.0513808 0.0500433 0.0347314
+-0.0212772 0.0382158 0.00549847
+0.0220013 0.0348195 0.00816409
+-0.0519377 0.0335199 0.00532131
+0.00789859 0.0999878 -0.0218807
+0.0337096 0.115696 0.0178949
+-0.0404258 0.0418709 -0.0242648
+-0.0188763 0.105884 -0.0226282
+-0.0648153 0.175482 -0.051724
+-0.070065 0.148313 -0.0344143
+-0.0584005 0.0439707 0.0246877
+0.0215152 0.0795452 0.0505127
+-0.000765864 0.0811873 -0.0364626
+-0.0633527 0.0454486 0.000289555
+-0.0455004 0.113892 0.0345333
+-0.0205229 0.0336428 -0.0235211
+-0.0658189 0.0895406 -0.0182783
+0.00772286 0.0346363 0.0381279
+0.044441 0.093115 0.00120191
+-0.0859796 0.119771 -0.00178632
+0.00662772 0.0374926 -0.0123303
+-0.0495602 0.0418248 -0.0110192
+-0.0863354 0.129395 -0.000699295
+-0.00570279 0.0613633 -0.0351663
+-0.0195101 0.114089 0.03835
+-0.0679008 0.1038 -0.0147014
+0.045275 0.0917907 0.0041773
+0.0258455 0.110181 -0.0127425
+-0.00858661 0.0376839 -0.0256139
+-0.0494924 0.160775 0.00747898
+-0.0186783 0.101771 -0.0238107
+-0.0870678 0.11107 0.0203515
+-0.0692028 0.135485 0.0474165
+-0.0665472 0.0446244 0.00170489
+-0.0679768 0.0791427 0.0408622
+0.0184726 0.0851741 0.0505075
+-0.0203373 0.158355 -0.00674555
+-0.0364979 0.119358 0.0304421
+-0.0395021 0.0450562 0.0411081
+-0.00309828 0.0379762 0.00940157
+-0.054497 0.10568 0.0405938
+-0.0354869 0.0903478 0.043788
+-0.0882673 0.102346 0.019362
+-0.0518479 0.128319 0.033784
+0.0163666 0.0522247 -0.0268816
+-0.0216233 0.0450569 -0.0280185
+-0.0332919 0.124337 -0.00345787
+-0.0603705 0.118249 -0.0108601
+-0.0883316 0.128385 0.0454834
+-0.0681462 0.033688 -0.00353141
+0.0232453 0.12098 -0.00440593
+-0.0294449 0.038677 -0.0149866
+0.0110249 0.0988999 -0.0227192
+-0.0218748 0.174208 -0.0142339
+0.0205417 0.0741225 0.0508294
+-0.0627477 0.148893 -0.0169766
+-0.0398023 0.0338119 -0.0274661
+-0.0319551 0.0348046 0.0438977
+0.0104998 0.108437 0.040345
+-0.0139772 0.164028 -0.0115888
+-0.0247602 0.0379556 0.0194943
+-0.000934383 0.0340393 -0.0200439
+0.0476809 0.0472678 -0.00164326
+-0.0400291 0.0354632 0.00960076
+-0.0671756 0.0610764 0.00625684
+-0.0852257 0.114326 0.001271
+-0.0754019 0.151364 -0.0118956
+-0.0437605 0.146927 0.00133694
+-0.0619528 0.15527 -0.030594
+0.0363929 0.0490985 -0.00642376
+-0.0100186 0.0981603 -0.0280043
+-0.0119452 0.129197 0.00527137
+-0.0346207 0.0519685 -0.0102527
+0.0527588 0.0510331 0.0250995
+-0.0635082 0.148832 -0.022668
+-0.0147336 0.0671673 -0.0377424
+-0.0704174 0.170744 -0.0307374
+0.0105902 0.125785 0.0307704
+-0.0258145 0.0894344 -0.0348302
+-0.0177853 0.0383982 0.00785589
+-0.0875073 0.0954698 0.00341799
+-0.0424838 0.105689 0.0405023
+0.049326 0.0581361 0.0307698
+-0.0426568 0.0578158 -0.011891
+-0.0506189 0.0517055 -0.00806622
+-0.0751298 0.155996 0.0213056
+-0.0740765 0.0662649 0.0182774
+-0.055953 0.151039 0.0297159
+0.00149895 0.0519342 0.0529111
+-0.0476623 0.135572 0.0124001
+0.00259703 0.093007 -0.0325523
+-0.021995 0.185609 -0.0143485
+0.0421516 0.0805501 0.0292856
+-0.014868 0.104453 -0.022832
+-0.0398868 0.108509 -0.0195593
+0.0259209 0.122835 0.0206655
+-0.0616544 0.15599 0.0144357
+-0.0733101 0.14716 -0.0188577
+-0.0262613 0.119664 -0.0106051
+0.0355444 0.109985 0.0269213
+0.04069 0.0703475 -0.0087868
+-0.0658232 0.100991 -0.0166158
+0.0443888 0.0846966 -0.000809941
+-0.0235014 0.109891 0.0398372
+0.0275195 0.0713136 0.0432798
+0.0364601 0.111481 0.0203251
+-0.0766191 0.168746 -0.0293719
+0.041872 0.069712 0.028792
+-0.0188551 0.177186 -0.0168879
+-0.0430291 0.148351 -0.00306372
+0.0241638 0.0853333 -0.0244737
+0.017675 0.127712 0.00477874
+-0.0888835 0.0983415 0.0204012
+-0.0202474 0.0582316 0.0476806
+-0.0719293 0.126758 -0.00881076
+-0.0294958 0.0960659 0.0449891
+-0.0491744 0.14016 0.00939463
+-0.0284952 0.105677 0.0407009
+0.0215711 0.035903 0.0289947
+0.0112282 0.0780681 -0.031821
+0.0343153 0.115038 0.0152609
+0.0213375 0.0536353 -0.0261911
+-0.0754641 0.149954 -0.0208706
+0.0174704 0.1044 0.0442882
+0.00640724 0.0390095 -0.0238414
+-0.0396234 0.150027 -0.00409811
+-0.0900489 0.137821 0.0141988
+0.0252808 0.0733562 -0.0251315
+-0.0492373 0.132883 0.0267635
+-0.0430533 0.034543 -0.0263375
+0.0217093 0.0520814 0.0434982
+-0.0333828 0.0807789 -0.0265175
+-0.0761052 0.14997 -0.0158781
+-0.0707786 0.0690222 0.0306409
+0.0401031 0.0589615 -0.00453029
+-0.0260252 0.0904818 0.0482145
+-0.0895062 0.0902087 0.0114561
+-0.0526923 0.0334338 -0.00380212
+-0.0114811 0.0646532 0.0550744
+-0.0370678 0.157759 -0.0113588
+0.00952731 0.105746 0.0431674
+-0.0410118 0.126885 0.0180931
+0.0197485 0.105413 -0.017636
+-0.0629292 0.155832 0.0110869
+-0.0581695 0.15592 0.011334
+-0.00650086 0.0561902 0.0537938
+-0.0338729 0.15688 -0.0110666
+0.0405297 0.0779725 0.0322363
+-0.0642469 0.0423257 0.0129047
+0.0237846 0.0476926 0.0394013
+-0.0217726 0.172729 -0.0141007
+-0.0416287 0.0534443 -0.0111279
+-0.077087 0.154176 -0.0108977
+0.0304203 0.0366341 0.0210583
+-0.0306156 0.0552316 -0.0163811
+-0.0584355 0.0482117 0.00674018
+-0.0284904 0.0917855 0.0443788
+-0.0347085 0.0681808 -0.0168555
+0.0286267 0.117101 -0.00417221
+0.000831008 0.0996342 -0.0235195
+0.00330328 0.0611715 -0.0325304
+-0.0739165 0.113504 -0.00683708
+-0.0898235 0.126994 0.0441831
+-0.0889746 0.0942393 0.0114303
+-0.0279086 0.0704216 -0.0334901
+-0.041504 0.0562873 0.0399374
+0.0394095 0.0793879 0.0341721
+-0.0669825 0.112069 0.0420748
+-0.0847653 0.103459 0.000382003
+-0.00649785 0.0801379 0.0576218
+-0.0226054 0.126675 0.00715587
+-0.000755212 0.130746 0.00366553
+-0.0328403 0.0348519 -0.0195836
+0.0396279 0.0857065 -0.0127726
+-0.0805255 0.14991 0.0359696
+0.0353489 0.0955322 0.0372114
+0.0102384 0.0781052 -0.0323493
+-0.0296143 0.0551126 -0.0213868
+-0.0699315 0.126779 -0.00900092
+-0.0795103 0.126002 0.0528073
+-0.000474921 0.0732072 0.0579427
+0.00749418 0.095088 0.0520151
+-0.0841797 0.101927 0.0280813
+0.0424909 0.101472 0.00517268
+0.00951997 0.0673959 0.0546877
+-0.0472854 0.0671503 0.0390298
+0.0376148 0.100847 -0.00874384
+-0.0374929 0.116616 0.0320198
+0.029259 0.120361 0.0176317
+-0.0737149 0.158251 -0.0299203
+-0.0114976 0.116917 0.038689
+0.0413371 0.0444728 -0.00290745
+-0.0627029 0.150609 -0.0235776
+-0.0302691 0.080511 -0.0335682
+0.0300872 0.0497043 -0.0117138
+0.0222773 0.0620859 -0.0257917
+-0.0570144 0.147201 -0.00173114
+-0.0760781 0.173825 -0.0400503
+-0.00149572 0.101631 0.0441885
+-0.0261888 0.17564 -0.0188354
+0.0231825 0.0577956 0.0456852
+-0.0924811 0.125593 0.0372603
+0.00115082 0.131147 0.0187057
+-0.0841614 0.142011 0.042356
+0.042729 0.0901813 -0.0058099
+0.0213045 0.0372836 -0.00268556
+-0.0160362 0.0338015 -0.0209075
+0.0394869 0.10531 0.000602508
+-0.0239168 0.0383626 0.00119722
+-0.0164538 0.0343139 -0.019589
+-0.0592802 0.154415 0.0283608
+-0.0609269 0.155849 0.0219449
+-0.0250081 0.0361291 -0.0192131
+-0.0853634 0.14876 0.00617316
+-0.0253618 0.0386908 -0.0141849
+-0.0881693 0.0922771 0.0238938
+-0.0728038 0.0921924 -0.0153063
+-0.0708783 0.150832 0.0377201
+0.00548074 0.111376 0.0414038
+-0.0524967 0.0945727 0.0438723
+0.0115063 0.0343546 -0.0179688
+0.00151312 0.081484 0.0572224
+-0.0149936 0.0395459 0.0398583
+0.0120392 0.129427 0.0226627
+0.0591195 0.05666 0.00817454
+0.0328155 0.102974 -0.0130264
+-0.0371359 0.123595 0.025439
+0.0450698 0.0805625 0.0231647
+-0.028064 0.0385407 0.0362565
+-0.00648913 0.0732625 0.0583326
+-0.0374981 0.0719295 0.0420686
+-0.0736872 0.176894 -0.0449171
+-0.0672224 0.0339784 0.0107486
+-0.0758756 0.104904 -0.00955908
+0.0439403 0.083251 -0.00181959
+-0.0614723 0.15843 -0.0295877
+0.0442849 0.0945485 0.0181566
+-0.065503 0.044849 0.00843715
+0.00357616 0.0395385 0.0347033
+-0.028754 0.0634689 -0.0284339
+0.0315757 0.0914687 -0.0188156
+0.00716348 0.0343484 0.0202029
+-0.0216788 0.0493937 -0.0287126
+-0.0716516 0.139715 0.0474384
+-0.043721 0.033715 -0.00407894
+-0.0817894 0.0909919 -0.00761357
+0.0425053 0.0513815 0.0326154
+-0.0638693 0.170945 -0.0476012
+0.0316414 0.11271 0.0301021
+-0.0306212 0.159741 -0.0134031
+-0.0214041 0.0879871 0.0549671
+-0.0670934 0.0625692 0.00143601
+-0.0365003 0.087456 0.0430956
+0.00150165 0.0919153 -0.0334107
+-0.024293 0.124271 0.0211991
+-0.0604952 0.0932426 0.0451145
+0.00516194 0.0978455 -0.0256065
+-0.00249882 0.081515 0.0574957
+-0.0636907 0.146369 -0.0159165
+-0.0129939 0.103563 -0.0236849
+0.00282967 0.131401 0.0178813
+0.00250691 0.0883899 0.0564027
+0.0220994 0.0476682 0.0404859
+-0.0466625 0.12523 -0.00836412
+0.00382851 0.0992997 -0.0231609
+-0.0879384 0.126705 0.000268669
+-0.0725213 0.0636798 0.0102197
+-0.00645782 0.0338359 -0.0228235
+-0.0523786 0.138216 -8.53499e-05
+-0.041943 0.114992 -0.0156494
+0.0435142 0.0513638 0.0325031
+0.0432433 0.0958712 0.000187851
+-0.0729725 0.170894 -0.0302341
+-0.0303619 0.0381166 0.0307902
+-0.0942177 0.125518 0.0172578
+0.0446543 0.0959754 0.00716634
+-0.0263933 0.0864552 0.0500994
+0.0352313 0.064664 0.0385641
+-0.0913521 0.14609 0.0171489
+-0.00798473 0.0348553 0.0472244
+-0.00181216 0.086792 -0.0360393
+-0.0153678 0.09644 0.0517723
+0.0268857 0.117842 -0.00498093
+-0.0354986 0.0747267 0.0419454
+-0.0573263 0.0481094 0.0336642
+-0.0386241 0.125328 -0.00654651
+-0.020119 0.0431531 0.0531418
+-0.0226834 0.174208 -0.0136486
+-0.0554979 0.0889982 0.0448936
+-0.0321193 0.0366883 0.0508235
+0.013731 0.104072 -0.0202068
+0.0407967 0.0661529 -0.00677209
+-0.0792933 0.16941 -0.0399858
+-0.0250378 0.174204 -0.0117666
+-0.0718111 0.0631642 0.010775
+-0.0710553 0.181198 -0.0554882
+-0.058796 0.0868581 -0.0207882
+-0.0136362 0.0466649 -0.0295427
+-0.0924917 0.124196 0.0312677
+-0.0331602 0.171158 -0.0153905
+-0.0724259 0.0727975 0.0340482
+-0.0566618 0.0645338 -0.00803085
+-0.0705221 0.098629 0.0408842
+0.0118568 0.126524 -0.00436904
+-0.0784161 0.116342 0.0501163
+-0.0677948 0.160582 -0.0110564
+-0.0456903 0.11799 -0.0148012
+0.0526315 0.0462656 0.0102089
+0.0453672 0.0456539 0.0269438
+-0.00726729 0.129761 0.0228793
+-0.0659232 0.105312 -0.014993
+-0.087769 0.118492 0.00124641
+-0.00149512 0.0562755 0.0546084
+-0.089164 0.0928946 0.0114433
+-0.0841907 0.078353 0.0198111
+-0.0679412 0.0656184 0.0271584
+0.0224551 0.0368363 -0.00219983
+-0.0356854 0.0435567 0.045098
+-0.0457595 0.0797224 -0.0196258
+-0.0405031 0.0762353 0.0429954
+-0.0640239 0.14106 0.0390925
+-0.0797368 0.119028 0.049952
+-0.0864815 0.0846104 0.00248575
+-0.0774908 0.137247 0.0499166
+-0.0586931 0.0693474 -0.0143558
+-0.0340813 0.159269 -0.0127772
+-0.0889533 0.124321 0.0462453
+-0.0611638 0.0468972 0.00167818
+-0.0925249 0.130961 0.0132346
+-0.0707251 0.033867 0.00298473
+0.0514024 0.0510939 0.0266785
+-0.000225629 0.097747 0.0525183
+0.0260546 0.112325 -0.0110571
+-0.0429452 0.0345628 0.0382617
+-0.0174331 0.0625913 0.0517909
+0.0422611 0.0397457 0.00959333
+-0.0374974 0.0705158 0.0419336
+-0.0368535 0.0362973 -0.0142764
+-0.0132005 0.128825 0.00480743
+-0.0808442 0.110042 -0.00155764
+-0.0890966 0.114815 0.0438036
+-0.0195037 0.11681 0.0364149
+-0.0653439 0.127011 0.0477296
+-0.0749324 0.152731 -0.0198994
+-0.0131083 0.128689 0.020774
+-0.0761869 0.149999 -0.0118749
+-0.0657951 0.0852369 -0.0187501
+-0.0515872 0.0558557 0.0146208
+0.0414903 0.0541829 0.0322405
+-0.0094881 0.112787 0.0415502
+-0.0473098 0.0390167 0.04506
+-0.076903 0.112654 -0.00467049
+-0.0792829 0.109073 0.0381388
+0.0277273 0.0646184 0.0435417
+-0.0923959 0.132359 0.0202239
+-0.0505803 0.0502828 -0.00813802
+0.00549299 0.117639 -0.0167508
+-0.0166687 0.038571 -0.00303984
+-0.0728836 0.119408 -0.00813229
+-0.00373228 0.0669631 -0.0346735
+0.0373953 0.0445589 -0.00471693
+0.00577997 0.0365296 -0.0134893
+0.0065091 0.0772612 0.0561769
+-0.0785581 0.153669 0.00407716
+-0.0631137 0.14437 -0.00863045
+0.0335076 0.0453895 0.0300756
+-0.00148382 0.131063 0.00627096
+-0.0117022 0.0613984 -0.0359464
+-0.0390182 0.0473551 -0.0162983
+0.0174871 0.10577 0.0429453
+0.0173606 0.128011 0.00608341
+-0.0587951 0.0337712 0.0197789
+-0.0554323 0.145321 0.0304155
+-0.021174 0.184521 -0.0131308
+-0.0546552 0.0656851 0.0351815
+-0.00872132 0.0656071 -0.0355909
+0.00329381 0.0654903 -0.0335962
+-0.0874212 0.0861211 0.0204627
+0.0341358 0.0641297 -0.0158137
+-0.063479 0.0384929 -0.0076832
+0.0174063 0.0417452 -0.0219906
+-0.069028 0.0409064 0.00923732
+0.0577041 0.0703778 0.00716237
+-0.0506338 0.0663851 -0.0124105
+-0.04882 0.119077 -0.0139102
+-0.0660878 0.161167 -0.014759
+0.060054 0.0678303 0.0101401
+-0.063913 0.169258 -0.0441943
+-0.053845 0.0463107 0.0236764
+-0.0784828 0.175619 -0.0475153
+-0.0313957 0.12387 -0.00298136
+0.0154947 0.107116 0.0420405
+-0.036876 0.0434502 0.0434666
+-0.06715 0.145376 0.0416405
+-0.0155327 0.181625 -0.0208343
+-0.0715781 0.0968766 0.0410625
+0.0306462 0.0968954 0.0409575
+0.00964614 0.0589005 0.0527021
+0.0527245 0.0736707 0.0159788
+-0.0861826 0.104908 0.00538017
+-0.0812551 0.138069 0.0480599
+0.0475108 0.0597433 0.0313293
+-0.0156256 0.0450397 -0.0279587
+-0.0221316 0.125526 0.0205056
+-0.0322922 0.122832 0.0242564
+-0.0132407 0.164048 -0.012311
+-0.0415061 0.0620057 0.0410722
+-0.0657901 0.128396 0.0470862
+0.0282252 0.0760107 -0.0227881
+-0.0701785 0.136914 0.0477863
+0.03413 0.0822192 0.0406334
+0.0609039 0.0609671 0.0121585
+-0.0515277 0.136697 0.0258426
+-0.00994091 0.089177 -0.0367642
+0.0451266 0.0727442 0.0219703
+0.0336533 0.110026 0.0294894
+-0.0721725 0.156265 0.0135984
+0.0312336 0.051167 -0.0107736
+-0.0023355 0.0926921 -0.0342848
+-0.0524965 0.0790864 0.0437156
+-0.0095237 0.0431051 0.0494016
+0.000300907 0.0626948 -0.0340909
+-0.0905968 0.140629 0.0221693
+-0.00800869 0.0388567 -0.00527149
+-0.0584939 0.0847167 0.0439692
+-0.0635243 0.0334646 -0.00419693
+-0.090351 0.14066 0.0261698
+-0.0588327 0.0911696 -0.0205864
+-0.020414 0.0541289 0.0465389
+-0.056688 0.067746 -0.0120827
+-0.0344045 0.152028 -0.00248634
+-0.0154988 0.114109 0.0392017
+-0.0384878 0.168246 0.00236894
+-0.0115711 0.100192 -0.0241483
+-0.0167308 0.0657547 -0.0377116
+-0.0466962 0.147986 -0.00319779
+-0.0926613 0.122825 0.0414622
+0.0312237 0.0871647 -0.0198177
+-0.0257476 0.0682496 -0.0344079
+-0.0524537 0.0504524 0.0306643
+-0.0768211 0.0804727 0.0355147
+-0.00449363 0.0456798 0.0470573
+0.0418422 0.0690449 -0.00578965
+-0.0262667 0.110544 -0.0190457
+-0.00251293 0.105882 0.0441369
+-0.0707082 0.0395895 0.000643319
+0.0128917 0.127573 0.0272919
+-0.0354687 0.054727 0.0384538
+0.00920102 0.0837298 -0.0322138
+0.0094791 0.0347704 0.0365664
+-0.0435038 0.0438236 0.0424673
+-0.0551839 0.140262 -0.00246039
+0.00523902 0.0341335 -0.0189244
+0.0273731 0.0578707 -0.0207586
+0.0119495 0.129938 0.00409466
+-0.0494983 0.102885 0.0411106
+-0.0370447 0.0379826 0.045213
+0.0150108 0.0349639 0.0393317
+0.0345233 0.0498189 0.0314944
+-0.0153828 0.128676 0.0170423
+-0.0618725 0.160013 -0.0255862
+-0.0525544 0.0504168 0.0256484
+-0.073344 0.0672327 0.000494062
+0.0393875 0.0460438 -0.00485579
+-0.0152754 0.103231 -0.0233341
+-0.0753549 0.104884 0.0361423
+0.0108274 0.0362708 -0.0225637
+0.0342152 0.0862629 0.0407864
+-0.088758 0.143311 0.0121502
+-0.0572353 0.0465198 -0.0043437
+0.0198267 0.035157 0.00555798
+0.0261922 0.0507168 -0.0207207
+0.0268986 0.0357578 0.0211357
+-0.0349846 0.0837189 -0.0236297
+-0.0222119 0.158173 -0.00418672
+0.024391 0.115338 0.0336864
+-0.0200061 0.124102 0.0256765
+-0.069632 0.0719472 -0.0104624
+-0.0322859 0.0792627 -0.0305329
+-0.0506516 0.033429 -0.00887801
+-0.0358626 0.101452 -0.0219425
+0.0293657 0.0447288 -0.00609588
+-0.0662305 0.0339335 0.0109932
+-0.00786973 0.104508 -0.0230207
+-0.0712429 0.177886 -0.0560058
+-0.00159432 0.129182 0.0263815
+-0.0283933 0.0831937 -0.0356194
+0.0443268 0.0511334 0.0322609
+-0.0318469 0.0958266 -0.0236233
+0.0205346 0.0937418 -0.0232686
+-0.012793 0.0813325 -0.0389447
+-0.0235889 0.0983837 -0.0242804
+-0.062496 0.105649 0.040196
+-0.0194646 0.0347564 0.0483645
+-0.0124518 0.038713 0.0303489
+-0.0444408 0.0335855 -0.0133031
+-0.00148369 0.0732377 0.0582942
+-0.0837769 0.153466 0.0110188
+-0.0898767 0.135147 0.0252168
+0.0369605 0.105409 -0.00483089
+-0.0255274 0.113962 0.0353265
+-0.0539587 0.0338764 0.0242313
+-0.0789197 0.104773 0.0326412
+0.0105421 0.118176 -0.0153416
+-0.0256953 0.0385914 0.0331228
+-0.0336328 0.126783 0.00457249
+-0.0470116 0.0710509 0.0409961
+-0.0930389 0.129675 0.0242521
+-0.0464764 0.0861628 0.0446798
+-0.0561893 0.159558 0.00559608
+-0.0091854 0.130144 0.00917512
+-0.0798951 0.0840617 -0.00859358
+-0.0336645 0.0339705 0.0230467
+0.00935764 0.0539048 -0.0300706
+-0.0831098 0.0777207 0.0215128
+-0.0470469 0.155045 0.00906939
+-0.0135887 0.169514 -0.0234669
+0.0418337 0.0395215 0.00781447
+-0.0276517 0.15535 -0.00385533
+-0.0201931 0.18164 -0.0152257
+-0.0335046 0.177862 -0.00863199
+0.0345014 0.0513521 0.0321623
+-0.0804527 0.143139 -0.00181198
+-0.0816965 0.144555 0.000152955
+0.0607459 0.0623413 0.0091502
+-0.0779458 0.175786 -0.0452228
+-0.0577187 0.146758 0.0323537
+-0.0403111 0.127303 0.0168527
+0.0204871 0.0934146 0.0476927
+0.00588424 0.100173 -0.0220733
+-0.00768539 0.0584014 -0.0338334
+-0.0447099 0.069553 -0.0165571
+-0.0287391 0.0620637 -0.0274208
+0.0157473 0.0947545 -0.0243195
+-0.063441 0.156071 0.0225051
+0.00824182 0.0753956 -0.0338579
+0.00561249 0.0927088 -0.0322048
+-0.0475077 0.0732702 0.0416223
+0.0145005 0.11127 0.0394252
+0.00450182 0.0413372 0.0458645
+0.00631667 0.061015 -0.0309472
+-0.0794763 0.0926775 0.0349659
+-0.0718543 0.111061 0.0453722
+-0.0891984 0.129697 0.0434765
+0.0151955 0.129241 0.0138359
+0.0236821 0.0824052 -0.0254011
+-0.0015019 0.110031 0.0427805
+-0.0215043 0.109928 0.0403615
+-0.0939826 0.118759 0.0192971
+-0.0624131 0.11535 0.0394932
+-0.0833865 0.140392 0.00124854
+-0.0465624 0.124393 -0.00950278
+-0.0146513 0.0496822 -0.0311895
+-0.0641648 0.15616 0.0149932
+-0.0729217 0.126742 -0.00866826
+-0.0253625 0.126177 0.010523
+0.0277777 0.108556 -0.0130095
+-0.0788017 0.0846357 0.0359502
+-0.0247742 0.180145 -0.00956802
+0.0188129 0.101666 -0.0216414
+0.00516264 0.131576 0.00874185
+-0.0633822 0.164679 -0.0305938
+-0.0375944 0.116238 -0.0149818
+0.0194959 0.111012 -0.0156283
+-0.0342918 0.0780403 -0.0245107
+-0.0861846 0.083225 0.00647736
+-0.0161451 0.166792 -0.0199866
+-0.0872007 0.147399 0.00826035
+0.0567195 0.0508531 0.00818949
+-0.0594966 0.100149 0.0427407
+-0.0584967 0.0761953 0.0427061
+-0.0218317 0.124906 0.0220793
+-0.00826101 0.0384472 0.0115633
+-0.0383343 0.121902 -0.0109317
+-0.0521665 0.136903 -0.000627156
+-0.0215605 0.0383186 -0.00194746
+0.0481264 0.060275 -0.00442661
+0.0154998 0.108504 0.0406925
+-0.0729927 0.08468 0.0400334
+0.0156625 0.0631375 0.0506866
+-0.0244911 0.101622 0.043846
+-0.0464946 0.131544 0.00524728
+-0.0496757 0.0678792 -0.0135965
+0.0429479 0.0845778 -0.00579145
+-0.0889655 0.0969901 0.0204055
+-0.0641121 0.152654 -0.0038572
+0.0409571 0.0971716 0.0271682
+-0.0171621 0.0382418 0.0171791
+0.00646008 0.118492 -0.0156628
+0.0328247 0.054955 0.0367483
+-0.0843958 0.13208 -0.00165487
+-0.0521768 0.0517998 0.0286453
+0.0415397 0.0690275 -0.00677
+-0.00193982 0.12966 0.0247961
+-0.0686037 0.157344 -0.00409918
+-0.0332546 0.12417 0.0223928
+-0.0762473 0.0920177 -0.013581
+0.0392491 0.0672477 0.0338308
+-0.0841314 0.0776758 0.00449933
+-0.0638136 0.0680952 0.0346563
+-0.00579523 0.10109 0.0444886
+-0.0717812 0.166615 -0.0459981
+-0.0474379 0.0355948 -0.0152688
+0.0581028 0.0523658 0.0121806
+-0.0787218 0.0967552 0.0354897
+-0.0561139 0.139571 -0.00370722
+-0.0605064 0.0394509 -0.00845033
+-0.0890965 0.111935 0.0113594
+-0.0579064 0.158452 0.00407429
+0.0204977 0.0920241 0.0479175
+-0.0224928 0.0988548 0.044702
+-0.0289733 0.124361 0.000543811
+-0.00750575 0.0457415 0.0474579
+0.043354 0.053395 -0.00666154
+0.0230359 0.124766 0.00534006
+-0.0773785 0.174262 -0.0420678
+-0.0273153 0.0387018 0.0344821
+-2.85469e-05 0.0391507 -0.00580542
+-0.0653748 0.149517 -0.0319115
+-0.0386792 0.0336259 0.00249375
+-0.0655034 0.106997 0.0388261
+0.0203192 0.0679349 -0.0283363
+0.0395784 0.104495 -0.000545476
+-0.0239953 0.114912 -0.0156465
+-0.0660228 0.160133 -0.0132914
+0.0397718 0.0940445 0.031303
+-0.0719497 0.132579 -0.00806719
+-0.0634812 0.0760895 0.041143
+-0.0484925 0.14723 -0.00252533
+0.054748 0.0690996 0.0027667
+-0.0723713 0.156038 0.0237254
+0.034267 0.0613198 -0.014809
+-0.0483876 0.0348751 0.0437589
+-0.05979 0.0839541 -0.0202843
+0.0501248 0.0723145 0.00745971
+0.0347025 0.105449 -0.00966587
+-0.0352566 0.0382472 -0.0299775
+0.0470963 0.045623 0.0254581
+-0.0855435 0.108961 0.00733555
+-0.0206804 0.112216 -0.0188434
+0.00523056 0.0796312 -0.0340387
+-0.0465619 0.047561 -0.00986957
+-0.033587 0.0348608 0.0452447
+-0.0202523 0.125914 0.000840735
+-0.0501104 0.138566 0.0193811
+-0.0264363 0.125919 0.0130719
+-0.0691022 0.159548 -0.0519447
+-0.0245412 0.057448 -0.0303989
+-0.046121 0.0336712 -0.000864342
+-0.0742841 0.155582 0.00848891
+-0.0298186 0.154044 -0.00457012
+0.0302323 0.0969553 -0.0166472
+0.0266877 0.104744 0.0387392
+-0.0843417 0.109004 0.0243603
+-0.0496377 0.143234 0.0104059
+0.0174929 0.0962345 0.0475335
+0.0450677 0.0917906 0.015163
+0.0374841 0.076757 0.0366434
+-0.0215406 0.0711033 0.0513847
+-0.0282153 0.125116 0.00364014
+-0.0284773 0.177212 -0.00607735
+-0.0204956 0.109916 0.0405701
+-0.0784664 0.0703272 0.00666705
+-0.0031698 0.0384355 0.0180459
+-0.0655548 0.153788 -0.00146085
+-0.0229763 0.0945367 -0.0302901
+-0.0192339 0.166857 -0.012207
+-0.0866345 0.094046 0.00237751
+-0.0759405 0.177963 -0.0471435
+0.0442559 0.0973532 0.00916034
+-0.071904 0.103673 -0.0126696
+-0.00666902 0.0541115 -0.0328784
+0.0144947 0.105783 0.0434399
+-0.029312 0.0383797 -0.00726542
+0.0562076 0.0536042 0.00319408
+-0.0829319 0.114342 0.0473556
+-0.069928 0.113662 -0.00916203
+-0.080837 0.120705 -0.00484118
+-0.0680148 0.177312 -0.0499759
+-0.077886 0.0811556 -0.0096326
+0.0350121 0.104701 0.0314746
+-0.0571796 0.0582032 0.0181974
+-0.0932449 0.120197 0.0372886
+-0.0536204 0.0647024 -0.00963527
+0.00250481 0.0870342 0.0569864
+-0.0802055 0.0754813 0.024867
+-0.062996 0.0444935 0.0306768
+-0.00402267 0.0975528 0.0526596
+-0.0883984 0.103684 0.0133796
+-0.0637361 0.133925 0.0394224
+-0.00469624 0.0613427 -0.0349676
+-0.0570417 0.148685 -0.00168484
+-0.062221 0.119852 0.0434664
+-0.0361997 0.0483313 -0.0162949
+0.00950265 0.0517655 0.0513753
+0.00822226 0.0366869 -0.011267
+-0.0383571 0.0360437 0.0112202
+-0.0890914 0.0956431 0.0204208
+-0.0256081 0.0408536 -0.0292407
+0.0374062 0.0397236 -0.000139169
+-0.094388 0.124185 0.0232804
+-0.0615536 0.151288 -0.000477545
+-0.0674057 0.140585 -0.00814985
+-0.0913588 0.113353 0.0143394
+-0.0162447 0.115598 -0.0164334
+-0.00395415 0.0388026 0.0284096
+0.0272466 0.0774691 -0.0233342
+0.0337889 0.112917 0.0264745
+-0.0342171 0.0808501 -0.0245506
+0.0395831 0.0953666 0.0310696
+0.0424402 0.100042 0.00119598
+0.0588348 0.0704992 0.0161593
+0.0129551 0.034265 -0.00247291
+-0.0884357 0.140552 0.0112052
+-0.0545209 0.0388646 -0.0108239
+-0.00760223 0.0406064 -0.0259713
+-0.0671149 0.0634665 0.0239226
+-0.0571873 0.13241 -0.00599886
+-0.0652367 0.0347413 0.0281307
+-0.0733817 0.154066 -0.0309045
+-0.00253313 0.0428829 0.047136
+-0.0768102 0.145866 -0.00487051
+-0.0675702 0.166262 -0.0225175
+-0.0425031 0.0662262 0.0410651
+-0.0579829 0.147131 -0.0018633
+0.0230336 0.049071 0.0400904
+-0.0829949 0.0843947 0.0302754
+-0.0147977 0.0813547 -0.0393324
+-0.015272 0.0385359 0.0263224
+-0.0764401 0.163184 -0.0180705
+-0.00855639 0.121127 -0.0123669
+-0.018702 0.0459339 0.0516744
+-0.0274925 0.0577126 -0.0264141
+-0.0571934 0.155255 0.0174937
+-0.0620081 0.0469936 0.00367346
+-0.010275 0.170544 -0.0261793
+0.0537831 0.0477401 0.0192041
+0.0402375 0.104169 0.000177419
+0.0289937 0.118368 -0.00105099
+-0.039498 0.118035 0.0314
+0.0367284 0.0875226 0.0373878
+0.0431893 0.0764104 0.0272109
+0.0404723 0.0752779 0.0321515
+-0.071418 0.176406 -0.0454588
+-0.0570823 0.138706 -0.0047975
+-0.0666306 0.0689692 -0.00898899
+-0.0691773 0.0628504 0.020491
+0.0144923 0.104443 0.0448169
+-0.0227823 0.0798633 -0.0386035
+0.0278587 0.0463325 0.0365003
+-0.00850193 0.0391005 0.0344133
+-0.0677578 0.16996 -0.0326164
+-0.0367265 0.0725274 -0.0180009
+-0.0681226 0.115765 0.0506532
+-0.0824105 0.154634 0.0158747
+-0.0197211 0.109971 -0.0204733
+-0.0626214 0.149057 -0.0155813
+-0.0414792 0.111213 0.0366505
+0.0570161 0.0508675 0.0161892
+-0.0934473 0.129632 0.0182372
+-0.0463999 0.150559 -0.00488163
+-0.0823822 0.144566 0.00117046
+-0.0310391 0.0892178 -0.0256627
+-0.065854 0.172894 -0.0463248
+-0.069909 0.0416997 0.00317022
+0.0312116 0.11742 0.0240751
+-0.0118175 0.0387383 -0.00407256
+0.01303 0.126665 0.0287751
+-0.0440446 0.129866 0.0080667
+-0.0797747 0.106127 0.0313842
+0.00451933 0.0800063 0.0560543
+0.00739517 0.116252 -0.017256
+0.0277812 0.063284 0.0436054
+-0.0569949 0.126695 -0.00683103
+-0.00960244 0.0420101 -0.025949
+0.0084074 0.123136 -0.0106652
+-0.0428042 0.0338676 0.0265755
+-0.0325056 0.0760815 0.0412743
+-0.0386562 0.0591953 -0.0114762
+-0.0405007 0.0690879 0.0417151
+0.0419622 0.102841 0.00417469
+-0.047644 0.121343 -0.0122933
+-0.0729009 0.105047 -0.011511
+-0.0927931 0.126937 0.0282668
+-0.0656106 0.156261 -0.00734027
+-0.0802248 0.0719997 0.00554401
+-0.00476651 0.0755803 -0.0368945
+-0.0779912 0.139819 -0.00526751
+-0.0864372 0.14049 0.00618869
+-0.0427881 0.157985 0.00470835
+-0.0697618 0.112838 0.0482345
+-0.0800017 0.0786467 -0.00556567
+-0.00794001 0.0994214 0.049751
+0.00252738 0.0716721 0.0561852
+0.0244581 0.0366925 -0.000851561
+-0.0618581 0.153131 0.03333
+-0.0730605 0.177343 -0.046073
+-0.0670133 0.0791411 0.0413099
+-0.00657967 0.0361819 -0.0249969
+0.0332241 0.115988 0.0034015
+-0.0314758 0.118803 -0.0116777
+-0.0714107 0.144356 -0.0151846
+-0.0414986 0.120686 0.028403
+0.0126257 0.034994 0.0315996
+-0.0344792 0.0382691 -0.00267158
+-0.0696814 0.0354769 0.0114289
+-0.0454423 0.0336713 -0.00255197
+-0.0611633 0.0698433 0.0372322
+-0.0520495 0.147795 0.0183962
+0.0467993 0.0745196 0.0137565
+-0.00850445 0.0619527 0.0559735
+-0.0157643 0.0353272 -0.0263783
+-0.0915821 0.144732 0.0201581
+-0.0274038 0.123285 0.0215594
+-0.0667152 0.0419014 -0.00231002
+-0.0408646 0.104225 -0.0205494
+-0.092402 0.129661 0.0272343
+-0.0876501 0.0954829 0.0054069
+-0.063731 0.0751942 -0.0171769
+-0.016949 0.0909918 -0.0366612
+0.0216857 0.0374896 0.0372608
+-0.0733019 0.081934 0.0390113
+-0.033579 0.117839 -0.0126505
+0.00291054 0.0385481 0.0460492
+-0.0648688 0.0938916 -0.0183701
+-0.0931568 0.120191 0.0362904
+-0.0105693 0.129741 0.0187791
+-0.0330922 0.108613 -0.0189923
+-0.0867528 0.121192 -0.00171893
+-0.0398856 0.0351398 0.0419144
+-0.0500753 0.0599861 0.0335137
+-0.0362769 0.163827 -0.00170672
+-0.0161498 0.040504 0.0518582
+0.0390213 0.100628 0.0284944
+-0.0525203 0.0581461 0.0261597
+-0.06389 0.0397139 0.0154457
+-0.0114781 0.0589986 0.0537512
+-0.00335674 0.0424141 0.0475525
+-0.0200738 0.0389483 0.0357554
+0.0112326 0.0738116 -0.0315294
+0.0128141 0.0504969 0.0481838
+-0.0548971 0.104115 -0.019193
+-0.0887169 0.125354 0.00227396
+-0.0712974 0.0669397 0.02531
+-0.0542529 0.0545999 -0.00539104
+-0.0538048 0.159768 -0.00183632
+0.0171004 0.120495 -0.00987579
+0.00927611 0.0667424 -0.0314011
+-0.0928802 0.118867 0.0402859
+-0.0167191 0.0613704 -0.0359554
+-0.0515886 0.0460739 0.0176829
+-0.0182635 0.180096 -0.0244849
+-0.0014996 0.0938866 0.0553603
+-0.0518826 0.071407 0.0396894
+-0.0529375 0.0335557 0.00508499
+-0.0597956 0.0925385 -0.0196216
+-0.0869937 0.104951 0.00838372
+0.0481666 0.0731681 0.01124
+-0.00827202 0.0394277 0.049182
+-0.0607911 0.0810335 -0.0194373
+0.000667625 0.0985049 0.0513232
+0.00310867 0.129093 0.0266332
+0.0296013 0.119582 0.02204
+-0.0285282 0.0378067 0.0260568
+-0.0367133 0.0353138 0.0122122
+-0.0468392 0.132859 0.0202702
+-0.0139293 0.126622 0.0263262
+-0.0191687 0.171226 -0.0215143
+0.0205957 0.0394417 0.0417168
+-0.0692562 0.143958 0.0438704
+-0.037992 0.128312 0.00883318
+-0.0237829 0.0770195 -0.0382449
+-0.0940603 0.120098 0.0152926
+-0.0545976 0.139948 -0.00193829
+-0.0869674 0.103645 0.0213508
+-0.0689616 0.177928 -0.0580053
+-0.079103 0.0731629 0.0235749
+-0.0563149 0.0534289 -0.00138708
+-0.00430179 0.125159 -0.00873129
+-0.0217957 0.119089 -0.0120655
+0.047344 0.0721054 0.0183678
+-0.0206715 0.0524183 -0.0304469
+-0.0292161 0.178518 -0.014988
+-0.0567221 0.0575063 0.0096837
+0.00796175 0.131494 0.0140347
+-0.0163209 0.175704 -0.0185048
+0.0207575 0.0645289 0.0475184
+-0.0365005 0.0676756 0.0415398
+-0.0504985 0.079101 0.0439987
+0.0338763 0.0978118 -0.0135516
+-0.00887371 0.0385959 0.0022117
+-0.0644851 0.0755505 0.0404189
+-0.0877008 0.0923103 0.0248018
+-0.082219 0.074838 0.0095308
+-0.0554964 0.111163 0.0367062
+0.0260064 0.0465031 -0.0156607
+-0.0633419 0.155193 -0.0376165
+-0.0732519 0.0648877 0.00719031
+-0.0769992 0.155545 -0.0179052
+0.0377103 0.0955073 -0.00984226
+0.0174667 0.122816 0.0304302
+-0.0366198 0.0505806 -0.010756
+-0.0144968 0.0472352 0.0484474
+0.00848126 0.0936832 0.0524446
+0.0197906 0.106497 -0.0168156
+-0.0930778 0.121531 0.0352811
+-0.0613674 0.169388 -0.0565896
+-0.0301276 0.038694 -0.0132786
+-0.0662928 0.044787 0.00771957
+-0.0195138 0.0448322 0.0525308
+-0.0886025 0.0887878 0.00646717
+0.0380432 0.109702 0.0166041
+-0.024753 0.0755695 -0.0376923
+-0.089639 0.0983559 0.0164014
+0.0373474 0.083464 0.036489
+0.0200866 0.0429332 -0.0206714
+-0.0362408 0.12776 0.00652715
+-0.0114267 0.182822 -0.0276369
+0.033977 0.115595 0.0137221
+0.016644 0.0381609 -0.019755
+-0.0160134 0.0959893 0.0521651
+-0.0194344 0.115555 -0.0163687
+0.00996296 0.0988804 -0.0226985
+0.0207021 0.0348049 0.000449352
+-0.0655859 0.0333717 0.000880867
+-0.0387964 0.0870429 -0.0222174
+-0.0365713 0.0483594 -0.015218
+0.0310154 0.110075 0.0327245
+-0.0376939 0.0665912 -0.0149459
+0.0401046 0.0466866 0.0313873
+-0.0110827 0.102149 -0.0241692
+0.00841559 0.0375405 -0.0234702
+0.0448731 0.0945767 0.0111579
+0.0145335 0.034759 0.0322003
+-0.059392 0.149673 0.0353015
+0.000291607 0.0641338 -0.034343
+0.00429568 0.0640516 -0.0331969
+0.0450422 0.0931924 0.0131619
+-0.00448954 0.122402 0.0358368
+-0.0326251 0.166779 -0.00520273
+-0.0566266 0.157159 0.00899778
+-0.0131915 0.184654 -0.0268832
+0.0372616 0.0915229 0.0364203
+0.0164447 0.0548852 0.0482217
+-0.0124867 0.11689 0.0385307
+0.00769138 0.039029 0.0323953
+-0.0150057 0.127967 0.0215456
+-0.0860589 0.113009 0.00328149
+-0.0718647 0.175275 -0.0427173
+0.000497507 0.112823 0.0420607
+-0.0832204 0.140695 0.0442806
+-0.0316065 0.039499 -0.0303181
+-0.0689448 0.129685 -0.00899835
+-0.020775 0.0742803 -0.0390259
+-0.0727533 0.0995199 0.0393322
+0.0032483 0.071196 -0.0343078
+-0.0400491 0.154783 -0.00892819
+-0.0345081 0.0832025 0.0425625
+-0.0522702 0.141391 0.00017327
+0.0278273 0.0795375 0.0455649
+0.0269552 0.122658 0.0110745
+0.0348501 0.112087 -0.000408122
+-0.0694924 0.0846972 0.0421957
+-0.0861949 0.139089 0.00320204
+-0.0823568 0.0802033 -0.00152209
+0.00894636 0.0644445 0.055029
+0.0266313 0.0563972 -0.0207832
+0.023933 0.0390696 0.0352942
+-0.0656041 0.136814 0.0420793
+0.0407616 0.105622 0.0111617
+0.058143 0.0551653 0.0211996
+-0.0138904 0.0897489 -0.0373664
+0.0117209 0.130528 0.015412
+-0.0181782 0.126773 0.00187925
+0.039239 0.0589589 -0.00512401
+0.0118091 0.0576645 0.0520801
+0.0101538 0.113447 -0.018237
+0.00107085 0.0391982 -0.0112505
+-0.0726176 0.0747594 -0.0108396
+-0.0504976 0.104261 0.040368
+-0.06047 0.0776106 0.0424994
+-0.0726162 0.166612 -0.0440006
+-0.0345099 0.109779 0.0372255
+0.0371511 0.110987 0.0177157
+-0.0594963 0.1084 0.0386802
+-0.0218558 0.120004 -0.0110164
+-0.0726436 0.159626 -0.0369279
+0.0162217 0.120841 -0.0102336
+0.0462172 0.0729792 0.0194263
+0.0503974 0.0595708 0.0303584
+-0.069034 0.139725 0.045939
+0.0222487 0.0359069 0.0273161
+-0.083623 0.0857135 0.0294569
+-0.0427492 0.0421438 -0.0223063
+-0.0635342 0.161573 -0.0210278
+-0.0632778 0.158345 -0.0436013
+0.049468 0.0445737 0.00523787
+-0.00949755 0.0856659 0.0574293
+0.0137231 0.129888 0.00901711
+-0.0849311 0.0980032 -0.00158096
+0.0094116 0.0360543 -0.0227822
+0.029005 0.115546 0.0303821
+-0.0136476 0.0481469 -0.0303471
+0.0203578 0.0985304 -0.0223097
+0.0386883 0.0767039 0.0348633
+0.0505119 0.0665023 0.0275359
+-0.0236064 0.038163 0.0249493
+-0.0662075 0.060375 0.00901189
+-0.0309847 0.0381919 0.0323901
+-0.0577888 0.0439091 -0.00660137
+0.0319539 0.0795563 0.0427459
+-0.0888256 0.100978 0.0104077
+-0.0149675 0.0986909 -0.0245721
+0.0080932 0.126458 -0.00628099
+-0.0629819 0.128219 -0.0083429
+0.00592947 0.0982847 -0.0240623
+-0.0791963 0.120405 0.0507691
+0.0385114 0.0583288 0.0314228
+0.0327231 0.116168 0.00178038
+-0.0838537 0.110728 0.0339922
+-0.0559583 0.0478125 -0.00439058
+-0.0864154 0.152983 0.0204471
+-0.0846489 0.0778245 0.0165124
+-0.0244888 0.120706 0.0294035
+-0.0565129 0.051223 0.00779351
+-0.00649552 0.111418 0.0421995
+-0.0400289 0.0336199 0.00584373
+0.00964377 0.120482 -0.0138306
+-0.0819198 0.126566 -0.00507678
+-0.023502 0.180157 -0.0112302
+-0.033578 0.0448331 0.0458046
+-0.0771053 0.177652 -0.0476237
+-0.0244946 0.0357757 0.0532784
+0.044574 0.0903504 0.0211613
+0.0317623 0.0938577 -0.0173357
+-0.0767292 0.0860417 0.0380634
+-0.0291365 0.165225 -0.016186
+-0.0558064 0.0562012 0.00862658
+-0.0197239 0.0612902 -0.0351879
+-0.0624763 0.163084 -0.0515885
+-0.00157869 0.0347285 -0.0237137
+0.0250862 0.0741055 0.0468243
+-0.00657564 0.0346831 -0.0243352
+-0.0927326 0.12419 0.0292678
+-0.0642565 0.0418897 0.0384072
+0.0074848 0.0976824 0.0494394
+-0.0324803 0.0436623 0.0489836
+0.0309993 0.0686673 0.04128
+-0.00959045 0.0337105 -0.0233226
+-0.0692347 0.176505 -0.0570351
+-0.0524975 0.111152 0.036921
+0.0434926 0.056984 0.0319757
+-0.0448698 0.104232 -0.0209188
+-0.0689139 0.148999 -0.0367601
+-0.0366298 0.0344715 0.0361774
+-0.0772403 0.0846603 0.0372078
+-0.0866727 0.139248 0.0421058
+-0.0692038 0.156713 -0.0519425
+-0.0286406 0.154979 -0.0065778
+-0.0516452 0.119776 0.0340339
+-0.0604002 0.0591276 0.0185111
+-0.0789005 0.172846 -0.0440952
+-0.0733588 0.0659821 0.00263497
+-0.0644533 0.0351399 0.0400818
+0.0349985 0.0619413 0.0382049
+-0.0116935 0.0584778 -0.0346471
+0.0397873 0.104095 -0.000789682
+0.0261507 0.0923065 -0.0217116
+-0.0643301 0.156694 -0.0446094
+0.0312874 0.108108 -0.0105276
+-0.0718754 0.119424 -0.00835095
+-0.0897483 0.0929448 0.0154361
+-0.0322408 0.125589 0.00213325
+0.0193474 0.0551603 -0.0276297
+-0.0355381 0.0335618 -0.0245193
+-0.0323633 0.175433 -0.0143069
+0.0591153 0.0705615 0.014025
+-0.0685156 0.168032 -0.0539935
+-0.0408127 0.127672 -0.0010356
+-0.070932 0.129672 -0.00889239
+-0.0315034 0.0717826 0.0402663
+0.0139874 0.0924572 -0.0278842
+-0.00310937 0.0390986 -0.00637767
+-0.0315484 0.0749387 -0.030532
+-0.0658202 0.0597996 0.0132017
+-0.074125 0.079542 -0.012586
+-0.042758 0.0336059 0.00168497
+-0.0376274 0.0534153 -0.0106276
+-0.0609006 0.106856 -0.0171292
+-0.0465015 0.112315 -0.0168133
+-0.00832405 0.129364 0.00227931
+0.000993844 0.0989182 -0.0247915
+-0.092775 0.128304 0.0272531
+-0.0024916 0.073257 0.0585379
+-0.0354714 0.0959602 0.0437897
+-0.0798628 0.122191 -0.00554615
+-0.0379836 0.153062 -0.00765575
+-0.0574689 0.0413481 0.0461934
+-0.0681352 0.166058 -0.0212868
+-0.0655788 0.037063 0.0157921
+-0.0104996 0.03868 -0.00189881
+0.00192546 0.0390395 0.0275923
+-0.0598545 0.0467827 -0.000327155
+-0.0510269 0.136724 0.0245519
+-0.0626706 0.0343644 0.032487
+0.0368248 0.11128 0.0190303
+0.047871 0.0733255 0.0156276
+-0.0291332 0.059286 -0.0234112
+-0.0554108 0.0344947 0.0391385
+-0.0892997 0.0956389 0.0174174
+-0.0880049 0.11182 0.00834875
+0.0309816 0.102484 -0.0145328
+0.0183118 0.0665429 -0.0287115
+0.00448658 0.111391 0.0416751
+-0.0902127 0.122664 0.0052855
+-0.0900898 0.119956 0.00430245
+-0.026505 0.174198 -0.0103819
+-0.0214492 0.0963545 -0.0261739
+0.0574071 0.0691343 0.00477569
+-0.0755392 0.154957 0.000803149
+-0.0205078 0.049871 0.046386
+-0.0302748 0.116055 -0.0148216
+0.0522643 0.0732287 0.00987093
+-0.0353184 0.153664 -0.00782609
+-0.0468563 0.101377 -0.0215448
+0.0252483 0.0713214 0.0452679
+-0.01624 0.0963836 -0.0301721
+-0.0374901 0.0505918 0.0391881
+-0.000727236 0.069749 -0.034387
+-0.0295801 0.0368886 0.052851
+0.0174262 0.0350846 0.00327627
+-0.0408044 0.0884947 -0.0224789
+-0.0540496 0.0546601 0.0106814
+-0.0841802 0.136658 0.046769
+0.0265654 0.0388814 0.0291555
+-0.0365515 0.115187 -0.0158874
+-0.0746646 0.0981736 0.0384691
+-0.0461647 0.162128 -0.00806097
+-0.0838755 0.106118 0.000396239
+-0.0634664 0.0345901 0.0373297
+-0.0487026 0.0708482 -0.0151225
+-0.0490488 0.150196 -0.0040443
+-0.0454995 0.107082 0.0401134
+0.015502 0.109895 0.0399577
+0.0339767 0.0796167 -0.0178174
+-0.064903 0.110966 -0.0133006
+-0.0884279 0.0874564 0.00647862
+0.0303366 0.0352283 0.0150252
+-0.0476647 0.15359 0.00991943
+0.0491492 0.0460297 0.00132033
+0.0571336 0.0721807 0.0116675
+0.0423629 0.0398964 0.0150374
+-0.0075036 0.12108 0.0363047
+-0.0304017 0.0791045 -0.033577
+-0.0707511 0.0654954 0.0231537
+-0.0344941 0.171246 -0.000779029
+-0.0516393 0.0618882 -0.0103104
+0.0364959 0.064355 -0.0127735
+0.0258636 0.0344283 0.00929921
+-0.06094 0.0410414 0.0167056
+0.0388283 0.102661 -0.00481845
+0.00951185 0.0560842 0.0527429
+0.0250009 0.0629104 -0.0235842
+-0.0883814 0.100948 0.00841627
+-0.0896675 0.150196 0.0231327
+-0.0502775 0.0487457 0.0176637
+-0.0574379 0.0576833 0.0026039
+-0.0889127 0.145822 0.0300758
+0.00105802 0.0387062 0.0241019
+0.0432951 0.0987146 0.0161577
+-0.00981592 0.123797 -0.00918874
+-0.0235467 0.119499 0.0316537
+-0.0203743 0.127028 0.00506457
+-0.0546314 0.138445 -0.00241154
+0.0144977 0.11819 0.0360011
+-0.0468871 0.150669 0.00925072
+0.00310943 0.110155 -0.0202398
+-0.0315082 0.0817114 0.0416031
+-0.0361907 0.169669 -0.0137878
+-0.0266475 0.0904555 0.0474235
+0.00393808 0.131671 0.0154244
+-0.0594984 0.109765 0.0377884
+-0.0632488 0.167828 -0.0435907
+0.02054 0.116646 0.0351499
+0.046015 0.0862238 0.00817489
+-0.0472066 0.033531 -0.00644781
+-0.0382901 0.126893 -0.00216373
+0.0358746 0.0755562 -0.0137901
+-0.00915886 0.0385694 0.027547
+-0.083022 0.132397 -0.0026267
+-0.0665414 0.155108 -0.00331096
+-0.0344162 0.168264 -0.00253059
+-0.0891077 0.101031 0.0163881
+-0.0165765 0.119912 -0.0109781
+0.00442197 0.11861 -0.0157775
+-0.0234514 0.0892984 0.0527307
+0.0565327 0.0523952 0.0217798
+-0.0515006 0.111173 0.0369493
+-0.0218128 0.183092 -0.0122978
+0.0044132 0.0376001 -0.0242202
+-0.0654801 0.0675388 0.0330326
+-0.010497 0.0717087 0.0563199
+-0.065424 0.0399796 0.0326661
+-0.0228869 0.180156 -0.0121058
+0.0203379 0.125091 8.19329e-05
+-0.0802772 0.089954 0.0344521
+-0.0772906 0.165906 -0.0257637
+-0.012412 0.0382658 0.0163183
+0.0102284 0.0616887 0.0533551
+-0.00987882 0.105925 -0.0227673
+-0.00348977 0.122389 0.0359468
+-0.0759061 0.0675035 0.00967604
+-0.0414986 0.0874028 0.042497
+-0.0605969 0.06056 0.0225173
+0.0395569 0.0702481 -0.0107925
+-0.0329324 0.0638892 -0.016427
+-0.000943594 0.0381622 0.0205587
+-0.0338755 0.107095 -0.0200162
+-0.0125023 0.0486789 0.0487656
+0.0274856 0.0400248 0.0301572
+-0.0008153 0.10869 -0.0211159
+0.0343096 0.0419726 0.0279684
+-0.0247603 0.0865587 0.0527086
+-0.00553736 0.113796 -0.0185731
+-0.021633 0.035044 -0.0280533
+0.00828872 0.130472 0.0213052
+-0.0242184 0.0593353 0.0417104
+0.0288386 0.111536 -0.010211
+-0.0581339 0.0334069 -0.00670381
+0.037704 0.0574555 -0.00668675
+-0.0710158 0.13691 0.0483444
+-0.0305078 0.112529 0.0355647
+0.0343502 0.114842 0.0181324
+-0.0485971 0.0359097 0.00925535
+-0.0288479 0.0578621 -0.0233922
+-0.051497 0.0890197 0.045238
+0.0121456 0.0347039 0.0353715
+-0.0716902 0.155937 0.00211062
+-0.0790692 0.0804499 0.033529
+0.0545445 0.0589886 -0.00181806
+0.0529955 0.0716182 0.0219676
+-0.056511 0.121265 0.0393235
+0.032607 0.0527076 -0.00976892
+-0.0376644 0.0335909 0.0081569
+-0.0936994 0.128298 0.0232525
+-0.0809806 0.0720629 0.0115411
+-0.0239408 0.0886576 -0.0363455
+-0.0859344 0.107632 0.00736881
+-0.0277915 0.0782183 -0.0359607
+-0.0571511 0.0394305 0.0468685
+-0.0839381 0.0791399 0.0214982
+-0.0234217 0.0359155 0.0533704
+-0.0739011 0.106421 -0.010241
+-0.0567145 0.0334976 0.000765085
+-0.0241329 0.157302 -0.00905689
+-0.0128819 0.126866 -0.00238505
+-0.0250553 0.0707727 0.0450037
+-0.0444963 0.119293 0.0294103
+-0.0463222 0.0411097 -0.0132713
+-0.0451547 0.0437693 -0.0122411
+0.0475648 0.0553802 0.031711
+-0.0494965 0.11266 -0.0171746
+0.00314926 0.122256 -0.0116623
+-0.089161 0.137877 0.0251937
+-0.0171561 0.0387671 0.0311342
+-0.0659181 0.10388 -0.0158661
+-0.062107 0.163118 -0.0365927
+0.0444569 0.0444867 0.0259758
+-0.0206484 0.0464719 -0.0278809
+-0.0668387 0.144945 -0.0185544
+-0.0574928 0.102919 0.0421703
+-0.0655518 0.166572 -0.0275081
+-0.0339393 0.126307 0.017694
+-0.0176989 0.0554882 -0.03328
+0.012239 0.0794574 -0.0314827
+-0.0344963 0.094609 0.0443801
+0.0228685 0.123786 0.00100726
+-0.0920259 0.132307 0.0132318
+-0.0713267 0.169665 -0.0267525
+-0.081588 0.0788215 -0.00249997
+-0.0755712 0.102178 0.0364401
+-0.0482055 0.0335674 -0.00667883
+-0.0295069 0.109802 0.0378356
+-0.0819634 0.103331 0.0300688
+-0.0766364 0.0788383 -0.00918256
+-0.0472353 0.12392 0.0280317
+-0.0424858 0.064826 0.0410217
+-0.00749383 0.112788 0.0415528
+-0.0321607 0.174124 -0.015122
+-0.0148084 0.124344 -0.00565133
+-0.0630295 0.126909 0.044075
+-0.0122771 0.129643 0.0167063
+-0.0137469 0.0714346 -0.0382786
+0.0253964 0.0981715 0.0439168
+-0.0105339 0.100499 0.0452584
+-0.0909546 0.139232 0.0191849
+-0.0239226 0.16684 -0.0101968
+-0.00433796 0.0387886 -0.000752538
+0.00920046 0.0879669 -0.0320124
+-0.0404937 0.0662835 0.0416604
+-0.0569887 0.118401 0.0385929
+-0.0715396 0.0362187 -0.000138838
+0.0226226 0.0591926 0.0466634
+-0.0544937 0.112536 0.0358256
+-0.0843481 0.145997 0.00513587
+-0.022811 0.0756351 -0.0385829
+-0.0666897 0.0735998 -0.0145924
+-0.0404977 0.116683 0.0325662
+0.0032744 0.114489 -0.0193505
+0.00148054 0.0413996 0.0463959
+-0.0245078 0.0767611 0.0513331
+-0.0308625 0.101511 -0.0227041
+0.00533966 0.0345787 0.0412861
+-0.0774755 0.170095 -0.0341987
+-0.0650593 0.125632 0.048098
+0.0112751 0.0505364 0.0494832
+-0.0786212 0.0976351 -0.0095679
+-0.0726748 0.0647223 0.00565049
+-0.0350102 0.158094 0.00367693
+0.0175012 0.11539 0.036772
+-0.0205761 0.0350586 0.0512942
+-0.0408828 0.108487 -0.0195205
+-0.0324978 0.0661054 0.0396515
+-0.0860138 0.0845642 0.00148082
+0.00924462 0.0710839 -0.0326657
+-0.0573888 0.0342428 0.0302238
+-0.0809405 0.141759 -0.00181375
+0.0351408 0.0931106 -0.0145377
+0.0391769 0.106978 0.0201683
+-0.0378047 0.0342916 0.0307956
+-0.0614885 0.0932285 0.0449784
+-0.00750736 0.0561433 0.0534652
+0.0317881 0.0564278 0.038783
+-0.0258626 0.0378286 0.0139698
+-0.0515546 0.0445278 -0.00899667
+-0.010869 0.165486 -0.0158779
+-0.0297303 0.109983 -0.0184292
+-0.0469177 0.0346518 0.0071269
+-0.0286016 0.109083 -0.0194963
+-0.0109096 0.172768 -0.0212178
+0.00821291 0.0711477 -0.0331375
+0.00315167 0.10307 -0.0219554
+-0.0472567 0.132959 0.0215876
+-0.0825276 0.142074 0.0435561
+-0.0136058 0.093388 -0.035076
+-0.0179202 0.0385865 -0.0163394
+-0.0641268 0.0405801 0.0396199
+0.0124469 0.129111 0.00141235
+-0.0637038 0.0343279 0.0323025
+0.0354218 0.100763 0.0338403
+0.0121385 0.130422 0.0141392
+0.00281822 0.126541 -0.00629609
+0.000901863 0.122026 -0.0113896
+-0.0702669 0.176516 -0.0559875
+-0.0576072 0.0336162 0.0112663
+0.0129045 0.125515 -0.00527553
+-0.021518 0.115416 0.036565
+-0.01542 0.16691 -0.0137031
+-0.0365035 0.168234 0.000585726
+0.00464616 0.034105 0.00716872
+-0.0319348 0.125225 0.000800634
+-0.0169495 0.0390889 0.0362738
+-0.024481 0.104364 0.0426891
+0.0161036 0.0393372 0.0440174
+-0.0397156 0.127552 0.0155957
+-0.0063009 0.09425 -0.0339062
+-0.00549064 0.104476 0.0440202
+-0.0455034 0.104326 0.041412
+-0.0625466 0.16468 -0.0375945
+-0.0334032 0.0765382 -0.0275106
+-0.0118225 0.0855318 -0.0386599
+0.0100166 0.0833203 0.0549696
+-0.0685481 0.156429 0.0206858
+-0.0705717 0.158164 -0.0459142
+-0.0185161 0.125172 -0.00248935
+-0.0185539 0.095955 -0.0297446
+0.0191428 0.127427 0.0167214
+-0.0145095 0.171282 -0.0176637
+0.0352621 0.0826509 -0.01774
+-0.0526579 0.0504274 0.026653
+0.00237351 0.0465882 -0.0283321
+-0.0854761 0.132564 0.04817
+-0.0868299 0.0846427 0.00348465
+-0.0105903 0.0377043 -0.0258398
+0.00953188 0.0455622 0.0461832
+-0.0662037 0.154495 -0.0505507
+-0.0856221 0.107687 0.0203552
+-0.0858054 0.102155 0.00239755
+-0.0248162 0.126254 0.00926143
+-0.0398081 0.128271 0.00374611
+-0.00949649 0.0546877 0.0525704
+-0.0474662 0.0960033 0.0439936
+-0.0787761 0.1431 -0.00379727
+0.0264606 0.0663192 -0.0226274
+-0.0294891 0.119549 -0.0104626
+-0.0285179 0.0948797 -0.0246293
+-0.0561001 0.14389 0.0312058
+-0.0930288 0.116051 0.018311
+-0.00894653 0.174179 -0.0257648
+-0.0524908 0.113899 0.0349209
+0.0158504 0.0959717 -0.0236278
+-0.0694879 0.0368888 0.0112092
+-0.0802884 0.146109 0.0411929
+-0.0498232 0.0349806 0.0446412
+0.0342731 0.115225 0.0123899
+0.0283978 0.0955434 -0.019149
+-0.0515486 0.141607 0.0193759
+-0.0458573 0.147704 0.00717141
+-0.0735436 0.175947 -0.0433626
+-0.0758292 0.0935231 -0.0136873
+-0.0554898 0.041398 0.0465154
+0.0604856 0.0623173 0.00815473
+0.0135991 0.100782 -0.0226731
+-0.021666 0.16235 -0.015178
+-0.0474866 0.0573572 0.0366835
+-0.0645248 0.154173 -0.00692339
+0.0454055 0.0747572 0.0215389
+-0.0497578 0.0797288 -0.020162
+-0.0463447 0.129406 0.0234768
+0.0153317 0.0580768 -0.0287753
+0.0124861 0.100431 0.0478938
+-0.0288456 0.0986889 -0.0235542
+-0.00949656 0.0471698 0.047803
+-0.0644726 0.165628 -0.0285568
+0.0564615 0.0703554 0.0055259
+-0.0477419 0.0345444 0.0337565
+-0.0415114 0.0520187 0.0393909
+-0.0165872 0.128419 0.0166112
+-0.0649318 0.168832 -0.0387572
+-0.0230309 0.0906523 0.0522978
+-0.0289316 0.0889882 -0.0316153
+-0.0522528 0.0567257 0.0259279
+-0.0113061 0.169739 -0.0249506
+0.0329977 0.0514306 -0.00763543
+-0.0104801 0.120983 0.0360777
+-0.0848294 0.111312 0.0422165
+0.0597675 0.0609389 0.00613027
+-0.0264774 0.0473675 0.0499125
+-0.00223749 0.0939165 -0.0335391
+-0.0188762 0.171241 -0.0152046
+0.0460317 0.0820288 0.0151733
+-0.00015619 0.0389464 0.0272511
+-0.0490964 0.156122 -0.00621407
+0.0240569 0.111353 0.0367066
+-0.0427705 0.0826571 -0.0207663
+-0.0844768 0.0856095 0.0274708
+-0.0120306 0.174239 -0.0210892
+-0.00550834 0.0689154 0.0563731
+0.0289606 0.0679277 -0.0207366
+-0.0308933 0.12367 0.0217821
+-0.00650569 0.0675101 0.0559953
+-0.0789661 0.0859916 0.0360799
+-0.0291346 0.177171 -0.00534178
+-0.0560039 0.140764 -0.00299974
+-0.0584999 0.107052 0.0397144
+0.00834583 0.0539265 -0.0302958
+-0.0169173 0.16018 -0.0117745
+-0.0698587 0.0680767 -0.00467294
+0.00525002 0.0740223 -0.0345195
+0.0110199 0.0860342 0.0546992
+0.0173361 0.0608154 -0.0277985
+0.0111302 0.107269 -0.019511
+-0.021494 0.10578 0.0424616
+0.0436775 0.0859385 0.0262014
+-0.0587477 0.0767588 -0.0188591
+0.0107799 0.0548821 0.052327
+0.0185294 0.0358466 0.0392699
+-0.0859998 0.135257 0.0457789
+-0.0767885 0.154209 -0.0148974
+-0.0613392 0.0587193 0.00967832
+-0.0712669 0.0381904 0.00872646
+0.00351715 0.0561463 0.0534882
+-0.0427983 0.0884442 -0.0218161
+-0.0898373 0.133802 0.0342135
+-0.0414226 0.150668 0.00483874
+0.0173651 0.049165 -0.0241471
+-0.0213294 0.0783028 0.0551779
+0.0143433 0.0537792 -0.0282321
+-0.0784743 0.140032 0.0478552
+-0.0334891 0.0889549 0.0439078
+0.0190476 0.0795376 0.0522219
+0.0286264 0.0638437 -0.020406
+-0.054069 0.139552 0.0288194
+-0.0132381 0.0385471 0.0267309
+0.0118566 0.0887261 0.0541581
+0.0316481 0.100683 -0.014625
+-0.093138 0.120057 0.0112982
+0.0244505 0.0384021 -0.00302114
+0.0122037 0.0864617 -0.0308592
+-0.0121165 0.0973987 0.0513433
+0.0371269 0.09285 0.0362758
+0.00753839 0.119505 -0.0147629
+-0.0698326 0.0937229 -0.0162704
+-0.046496 0.105677 0.0407002
+-0.00449814 0.0870358 0.0571267
+-0.00560579 0.042007 -0.0256504
+-0.0748416 0.154048 -0.0189002
+0.0138852 0.0348367 0.0283807
+-0.0890009 0.118943 0.0464523
+-0.0703858 0.16802 -0.0500308
+-0.0208115 0.124915 -0.0021319
+-0.0399669 0.0343914 -0.00210399
+-0.0188044 0.120762 -0.00982397
+-0.0825182 0.0816676 0.0298907
+-0.0625957 0.0588736 0.0128867
+-0.0908844 0.150204 0.0171288
+-0.073715 0.17176 -0.0333959
+0.0304194 0.0446109 0.0313507
+-0.0364972 0.0605644 0.0405385
+-0.0684905 0.158118 -0.0539401
+0.011386 0.0343226 -0.0122219
+-0.0375464 0.119352 -0.0122401
+-0.036497 0.102841 0.0405772
+0.0373988 0.0430101 -0.00376662
+-0.00864037 0.0526884 -0.0330777
+-0.0505191 0.112725 -0.0172384
+0.000747713 0.131321 0.00709666
+-0.0821064 0.110205 0.0294137
+-0.0338319 0.0498039 0.0388148
+-0.0399647 0.128635 0.00811119
+0.0262642 0.0479348 -0.017662
+-0.093142 0.118716 0.0123041
+-0.0234219 0.0537493 0.0424994
+0.0109672 0.0977693 -0.023517
+-1.32571e-05 0.13145 0.0125463
+0.0200527 0.0618555 0.0482337
+-0.0119089 0.128954 0.021205
+-0.0524994 0.0903873 0.0447034
+-0.0334979 0.0845774 0.0421828
+0.0190672 0.117213 -0.0123322
+-0.0263135 0.0381467 0.0262093
+0.034589 0.108233 -0.00663102
+0.0435886 0.091694 0.0241609
+-0.00849618 0.0939016 0.0554996
+-0.0579701 0.125253 -0.00738272
+-0.016138 0.0382862 0.0119165
+-0.0709351 0.0742605 0.0366097
+-0.0125367 0.128434 0.00198737
+-0.0244307 0.0379986 0.0104913
+-0.0681277 0.152206 0.0356633
+-0.0279464 0.0689892 -0.032513
+0.0398535 0.0752995 0.0330037
+-0.0636875 0.0722354 -0.0149801
+0.00569987 0.0949071 -0.0304911
+0.0217235 0.120687 0.0315848
+0.0306109 0.0549842 0.038821
+-0.0719231 0.155792 0.0253493
+-0.0350091 0.168257 -0.00164334
+-0.0919787 0.13239 0.0232249
+-0.0781961 0.0730005 -0.00359699
+0.0587114 0.0663183 0.00513779
+-0.0669656 0.147091 -0.0266318
+-0.0880403 0.150094 0.0102212
+-0.0137235 0.0657235 -0.0372342
+-0.0884987 0.102354 0.0183681
+-0.0219433 0.0386564 0.0320445
+-0.0629896 0.0341974 0.0167609
+0.0436977 0.0404602 0.0147575
+-0.0413787 0.124797 0.0224172
+-0.0255118 0.0931431 0.0461963
+-0.0122206 0.175683 -0.0283056
+-0.0580888 0.115436 0.0369297
+-0.0783607 0.150068 -0.00187639
+0.0561422 0.049398 0.0141897
+-0.0334907 0.0932064 0.044455
+-0.0784392 0.144133 0.0443751
+0.0134754 0.0990564 0.0479483
+-0.0673994 0.0396352 0.0118227
+-0.0719379 0.131113 -0.00828186
+-0.0675058 0.060447 0.0122781
+-0.0276134 0.0408758 -0.0294796
+0.0326756 0.117173 0.0132168
+-0.0741715 0.151271 -0.0318825
+0.0191559 0.0577995 0.0486799
+-0.0624968 0.102902 0.0415908
+-0.0467288 0.054632 0.0374442
+0.0400692 0.0773178 -0.00879643
+-0.0293794 0.119962 0.0282913
+0.026315 0.0849274 0.0469361
+0.00747158 0.0458651 0.0478111
+-0.0644149 0.0731789 0.038947
+0.0243686 0.118145 -0.00732959
+0.0357612 0.0614637 -0.0127934
+-0.00578852 0.0784633 -0.0377499
+-0.0177178 0.125534 0.0250034
+-0.0264348 0.0891318 0.0486594
+0.000504451 0.0842848 0.0575158
+0.00240772 0.0390703 -0.0246208
+-0.0401081 0.172699 -0.00896014
+-0.0494967 0.101524 0.042218
+-0.0255895 0.0365546 -0.0292581
+0.0458597 0.0428246 0.0032848
+-0.0627733 0.141026 0.037362
+-0.0278525 0.100136 -0.023576
+0.03144 0.0681325 -0.0188162
+0.0112459 0.129755 0.00240428
+-0.0872718 0.144583 0.0355002
+-0.0552077 0.119827 0.0376818
+-0.0324974 0.0859857 0.0423469
+-0.0872251 0.0950749 0.0256867
+-0.0468678 0.104213 -0.0207743
+-0.0445775 0.0462028 -0.0108205
+-0.0612826 0.0343712 0.0345145
+-0.0144859 0.0951551 0.0535558
+-0.0770239 0.141306 -0.00545257
+-0.0572927 0.0447946 0.0143752
+0.0334156 0.0430777 -0.00456693
+-0.073856 0.154091 -0.0259028
+0.0392277 0.108354 0.00916622
+-0.0254312 0.0379511 0.0211651
+-0.0579761 0.145744 -0.00191597
+0.016043 0.107446 -0.0178315
+0.0243862 0.0955601 0.0459654
+-0.0527854 0.146248 0.0203946
+-0.0908456 0.137855 0.0191944
+-0.0688648 0.111591 0.0438135
+0.00950305 0.108494 0.0403312
+-0.0846701 0.133487 -0.000689201
+-0.0146178 0.161254 -0.0115208
+-0.0517406 0.0704199 0.0388209
+-0.00483682 0.0910121 -0.035647
+-0.0455024 0.0438631 0.0430524
+-0.0269915 0.165366 -0.00760144
+-0.000429299 0.131494 0.0138246
+-0.0108252 0.0340132 -0.0200775
+-0.053792 0.141582 0.0273817
+-0.0807416 0.0720213 0.00853917
+-0.0886543 0.102345 0.0123871
+0.00450201 0.0745047 0.0565768
+-0.0651106 0.120024 0.049809
+-0.0816493 0.14593 0.000178819
+-0.0317919 0.0396266 0.0512352
+-0.0868829 0.105004 0.0193534
+-0.0587854 0.0839965 -0.0207846
+-0.0568787 0.10406 -0.0186489
+0.0234195 0.0349614 0.0211471
+-0.0247363 0.0683356 -0.0352871
+-0.0124919 0.105832 0.0432095
+0.040945 0.0957511 0.0281635
+-0.0357042 0.0681118 -0.016092
+0.0393973 0.0899152 -0.0117774
+-0.00550412 0.0547964 0.0538028
+0.0275305 0.105074 -0.0152759
+0.0436438 0.0973161 0.0031761
+-0.0642775 0.0356785 0.0173446
+-0.0578787 0.118384 0.0390612
+-0.0235304 0.111308 0.039012
+-0.0248685 0.10443 -0.0231858
+0.0332298 0.0870923 -0.0186827
+-0.050788 0.13247 -0.00197537
+0.0485095 0.0723104 0.0188157
+0.0122831 0.123395 -0.0089862
+0.0075079 0.0786108 0.055765
+0.00110358 0.114412 -0.0192684
+-0.0434472 0.0344528 0.0312293
+0.0149724 0.0740286 0.0533099
+-0.0773286 0.0696655 0.0199272
+-0.000294503 0.124716 -0.00828566
+0.0391665 0.0916193 -0.0109453
+-0.0671371 0.169442 -0.0570354
+-0.0101504 0.0993437 0.0489973
+-0.0383111 0.172675 -0.0109203
+-0.048519 0.137086 0.0153953
+0.0537553 0.0686728 0.0251859
+-0.0642372 0.158555 -0.0140759
+-0.0177679 0.0959988 0.0511065
+-0.071022 0.0408196 0.00705143
+-0.0272272 0.0562777 -0.0264072
+-0.0594982 0.10293 0.0419773
+-0.0516777 0.0668198 0.0365892
+-0.00645905 0.128953 0.0260767
+0.0161504 0.121694 -0.0091598
+0.0437177 0.0457281 0.0283091
+-0.092911 0.118706 0.0113064
+0.0110654 0.0346569 0.0243461
+-0.0131306 0.0351789 0.049391
+0.0159998 0.123366 -0.00698095
+-0.0668407 0.0952437 -0.0171577
+-0.071815 0.0936645 -0.0155813
+-0.0350082 0.162373 -0.00163299
+-0.00952557 0.169814 -0.0256004
+-0.0483792 0.0345623 0.0353569
+0.042732 0.0733313 -0.00479409
+-0.0838195 0.113254 0.0462465
+-0.0700699 0.0415411 0.00206928
+-0.0834164 0.110194 0.0380909
+0.0395682 0.0582726 0.0307001
+-0.0527297 0.0738092 -0.0169322
+-0.0800112 0.0826849 -0.00756298
+0.0378591 0.102628 -0.00683982
+-0.010049 0.165099 -0.0207588
+-0.0214981 0.0486638 0.0490621
+-0.0429934 0.0337652 -0.0113325
+-0.000805756 0.0881637 -0.035184
+-0.0796191 0.0899783 0.0351979
+-0.0774871 0.138654 0.0489668
+-0.0910383 0.131037 0.0312282
+-0.0353528 0.121762 0.0276148
+-0.0692517 0.16944 -0.0530112
+-0.0314965 0.0760483 0.040909
+0.0238425 0.124265 0.00565298
+0.00628938 0.0341841 -0.018778
+-0.0581165 0.0576994 0.00562055
+0.0291881 0.120758 0.0119009
+-0.0722612 0.0718535 0.0331389
+0.00962203 0.129808 0.0232185
+-0.0350797 0.159271 -0.0126349
+-0.0536324 0.0335534 0.00133593
+-0.0104359 0.0944019 -0.0340934
+-0.00347107 0.112728 -0.01944
+0.0492065 0.0445737 0.00425603
+-0.014689 0.0555534 -0.0339367
+-0.0729302 0.110914 0.0452396
+0.0128104 0.0891816 -0.030491
+0.0173644 0.052219 -0.0267492
+-0.0755038 0.138646 0.0489499
+-0.0664863 0.0657678 0.0290911
+0.014321 0.0608889 -0.0289153
+-0.0109854 0.0891937 -0.0368255
+-0.0714642 0.155388 -0.0429121
+-0.0674015 0.178779 -0.0526749
+-0.0136021 0.0406665 -0.0268707
+-0.0656159 0.148667 -0.029991
+-0.0795217 0.0705829 0.00954625
+-0.0757838 0.06757 0.0150388
+-0.0619636 0.125289 -0.00856668
+-0.0639176 0.153606 -0.0366205
+-0.0839617 0.114292 0.0471508
+-0.0125655 0.164041 -0.0130929
+-0.0519903 0.161388 0.00628165
+0.0020129 0.0391581 -0.00540617
+-0.0585951 0.0582039 0.0052961
+0.034843 0.0862437 0.0399362
+-0.0416697 0.0377451 -0.0272469
+0.0488349 0.0718069 0.020409
+0.0223863 0.0449715 0.0408911
+-0.0822334 0.107404 -0.00162196
+-0.0602698 0.154572 0.0280125
+0.0297856 0.120093 0.00926746
+-0.0669649 0.131148 -0.00876196
+-0.0800697 0.154441 0.0255089
+-0.0849288 0.12649 -0.00334252
+-0.000500036 0.0952296 0.0545194
+0.0151613 0.0863718 -0.029541
+0.0388132 0.0794166 0.0350891
+-0.0171133 0.0390763 0.0521827
+-0.0784063 0.0886978 0.0368492
+-0.0643001 0.179479 -0.0601392
+-0.0766538 0.11399 -0.00481419
+-0.016912 0.0931258 -0.0348233
+0.0379841 0.0406211 -0.00115448
+-0.0331507 0.0821697 -0.0275285
+0.0162383 0.0953367 0.0482094
+-0.0326141 0.0638332 -0.0174509
+-0.0725041 0.146981 0.0423864
+-0.0910261 0.12541 0.00626868
+-0.0833424 0.104748 -0.00163012
+0.0153058 0.128412 0.00248962
+0.0403512 0.038719 0.00830945
+-0.0325027 0.0603855 0.0384943
+-0.0195554 0.0387278 -0.0149268
+-0.0839725 0.0897798 0.0296574
+-0.00149888 0.0634085 0.0566876
+0.0387554 0.108357 0.00416438
+-0.0444079 0.0409084 -0.0203048
+-0.0868827 0.0896245 0.0255163
+0.0430409 0.10011 0.0131585
+0.0194835 0.105739 0.0423148
+0.032957 0.115724 0.0233075
+-0.0114871 0.063283 0.055206
+-0.0528865 0.15117 0.0191272
+0.0045048 0.104341 0.0428855
+0.00104791 0.0346359 -0.0164332
+-0.0674529 0.180926 -0.0583799
+-0.0344427 0.15352 -0.00733684
+0.0397392 0.0658643 0.0327972
+-0.0465986 0.120315 -0.0132329
+0.015269 0.034844 0.035887
+-0.0554963 0.0791301 0.0442202
+-0.0342911 0.0473692 0.0421968
+-0.0842876 0.108899 0.00336188
+-0.0262668 0.179961 -0.0169689
+-0.0836964 0.0763445 0.00752427
+-0.0696635 0.159559 -0.0499324
+-0.0661058 0.151041 -0.0375744
+-0.0455019 0.122005 0.0261109
+-0.0890685 0.0969888 0.0194042
+-0.0946116 0.124177 0.0212718
+0.00351301 0.0828608 0.0571024
+-0.0555168 0.154658 0.0152234
+0.00450223 0.0730917 0.0563795
+-0.0125112 0.037888 -0.0164908
+-0.0595378 0.0337212 0.0161226
+-0.0645332 0.120008 0.0489179
+-0.0396568 0.0577566 -0.0113194
+-0.052454 0.13854 0.0254099
+-0.0106577 0.165418 -0.0198106
+-0.0477868 0.0855382 -0.0218048
+-0.07021 0.168534 -0.0249229
+0.0345025 0.0454126 0.0301845
+-0.0261438 0.168232 -0.0181898
+-0.0685956 0.0422314 0.00876662
+0.00130397 0.128647 -0.00252095
+-0.0558871 0.108356 -0.0181276
+-0.0163928 0.0384645 -0.00103951
+-0.0364756 0.0917702 0.0440382
+0.0409317 0.0971197 -0.00479362
+-0.015772 0.160715 -0.00958045
+-0.0428613 0.102811 -0.0212634
+-0.0285136 0.112565 0.0358423
+0.0484971 0.0678077 0.0264809
+-0.0319101 0.121969 -0.00695975
+-0.0200308 0.127492 0.00809368
+-0.0860481 0.114371 0.00228673
+-0.0597203 0.0638916 0.0303834
+0.00627327 0.0682324 -0.0325665
+0.0114155 0.128646 -0.000626619
+-0.0516778 0.140064 0.0213757
+-0.0218071 0.110009 -0.0205036
+-0.0218161 0.0798852 -0.0388524
+-0.02847 0.045966 0.0500228
+0.0429765 0.0987175 0.0181666
+-0.0795395 0.117686 0.0497856
+0.0342026 0.113899 0.000840527
+0.0067112 0.0353739 0.0246266
+0.0402464 0.0618954 -0.00472398
+-0.049455 0.118007 0.0316443
+-0.0442176 0.170815 -0.00391429
+0.00731658 0.0846292 0.0563131
+-0.0542668 0.0504201 -0.00539584
+-0.00648076 0.0969085 -0.030657
+0.0597202 0.067814 0.0181758
+-0.0267919 0.0380272 0.00817341
+-0.0702433 0.163232 -0.0134117
+0.0368364 0.0754262 0.037436
+-0.077497 0.168713 -0.0313178
+0.00996165 0.130854 0.00764162
+0.0133618 0.0523173 -0.0278769
+-0.0337147 0.120592 -0.00951232
+-0.0398766 0.113891 -0.0165093
+-0.089592 0.111931 0.0163329
+-0.0841359 0.0832101 0.027497
+-0.0848856 0.0792043 0.0194951
+-0.0291817 0.0832547 -0.0346104
+0.013224 0.0341678 -0.000459678
+-0.00759782 0.103673 0.0436498
+-0.0514921 0.0804912 0.0440592
+-0.0929632 0.124088 0.0102675
+-0.0586925 0.0677294 -0.0118268
+0.0392263 0.0874331 0.033936
+-0.052704 0.143169 0.0214165
+-0.0286941 0.0380883 0.0293671
+0.0183138 0.0348993 0.0256062
+-0.0644855 0.101502 0.0419335
+-0.0547363 0.159762 -0.000811248
+0.0123244 0.0567269 -0.0296218
+0.0294314 0.0509988 -0.0157519
+0.0386176 0.0874608 0.0348475
+-0.0759101 0.148612 -0.0128604
+0.0152406 0.0723235 -0.0303843
+-0.0475913 0.133999 0.00741747
+-0.0109726 0.115573 -0.0164387
+-0.040716 0.0681271 -0.0158645
+-0.000345107 0.127203 0.0297544
+-0.0856388 0.100529 0.0267624
+0.0372748 0.0576283 0.0326444
+0.0454709 0.0664599 0.0266758
+-0.040383 0.152127 0.00460721
+-0.0503264 0.131112 0.0307063
+-0.061863 0.0953699 -0.0186332
+-0.0356336 0.11996 -0.0108661
+-0.000498349 0.118323 0.0391474
+-0.00744633 0.0386202 0.0260498
+-0.0702648 0.156758 -0.047919
+-0.0607772 0.146055 -0.00361746
+-0.0557733 0.0797194 -0.0205764
+-0.0286229 0.0450027 -0.0280846
+-0.0400285 0.0339876 -0.0295458
+-0.0244818 0.0974513 0.0444604
+-0.0736592 0.0887741 0.0405778
+-0.0626256 0.150596 -0.021578
+-0.0455006 0.117978 0.0306048
+-0.0153159 0.119411 -0.012435
+0.00132313 0.0358703 0.0464707
+-0.0231138 0.0666037 0.0460408
+-0.0487946 0.0869761 -0.0218357
+0.0312031 0.0842875 -0.0196213
+-0.0866673 0.109085 0.0143521
+-0.0716243 0.157487 -0.00225608
+0.0404941 0.0555582 0.0318463
+-0.0624591 0.155071 0.0054624
+-0.043713 0.0695592 -0.0168487
+0.00662363 0.128671 -0.00261559
+0.0292045 0.0356392 0.0180684
+0.0152063 0.0878077 -0.0294658
+0.0560899 0.059136 0.000193317
+0.0162996 0.0623114 -0.0287447
+0.00333411 0.0539266 -0.0303683
+-0.0212016 0.0383732 -7.87452e-05
+-0.0683674 0.147186 -0.0280671
+-0.0614001 0.124084 0.0428232
+-0.0273522 0.0939518 -0.0257303
+-0.0526652 0.0647199 -0.0102
+-0.032486 0.0449059 0.0475402
+-0.0090473 0.168146 -0.0217175
+-0.069891 0.119438 -0.0086356
+-0.0744393 0.114503 0.0509494
+-0.0648928 0.0350374 0.038379
+-0.00019365 0.125094 0.0326823
+-0.039166 0.0355671 -0.0293815
+-0.0258209 0.0692735 0.0430043
+-0.0620187 0.175667 -0.057604
+-0.0903815 0.130904 0.00623191
+-0.00457753 0.11466 -0.0174869
+-0.0733982 0.114573 0.051125
+0.00137655 0.0380516 0.0229424
+-0.0197661 0.0728664 -0.0388949
+-0.0370853 0.162227 -0.0135318
+-0.0166846 0.109701 -0.0201927
+-0.0564987 0.0932477 0.0451284
+-0.086761 0.084678 0.016478
+-0.0201321 0.0568083 0.0475876
+-0.0893331 0.111939 0.012355
+-0.0291964 0.162421 -0.00376774
+-0.0840799 0.143223 0.00416483
+-0.0550692 0.121281 0.0379498
+-0.0258999 0.0382697 0.0279803
+-0.0881372 0.150234 0.0261027
+-0.0189632 0.0385431 -0.0165058
+0.0252198 0.0478964 -0.0186081
+-0.0250024 0.118057 -0.0129436
+-0.0341053 0.162392 -0.00207929
+-0.0455587 0.0461599 -0.0105245
+-0.0673284 0.11863 0.0518333
+-0.0767393 0.157602 -0.0105393
+-0.0460199 0.0377083 0.0451098
+0.00937824 0.0346871 0.0203526
+-0.0232543 0.181611 -0.01087
+-0.0185423 0.0342292 -0.0199208
+0.0094823 0.034855 0.0256576
+-0.00349094 0.060529 0.0547186
+-0.0536823 0.0678463 -0.0129474
+0.0573543 0.0687146 0.022093
+0.0297466 0.036015 0.0196643
+0.0183828 0.0447123 -0.0227438
+-0.00451438 0.1296 0.000561158
+-0.0575172 0.037335 -0.0101901
+-0.0273178 0.113609 -0.0162558
+-0.0127855 0.0392769 0.0369668
+0.0359154 0.0915824 -0.0149202
+-0.0321871 0.0680263 -0.0214501
+0.0373115 0.0673123 0.0362946
+-0.0482709 0.0345995 0.0405757
+-0.0586992 0.142676 -0.00307276
+-0.0720231 0.149543 -0.0391183
+-0.0926193 0.122848 0.0312739
+-0.00649959 0.103045 0.0436802
+-0.0172605 0.128293 0.0149127
+0.0500544 0.0553974 0.0300563
+-0.0459009 0.131661 0.0191601
+-0.0355139 0.176726 -0.00796363
+-0.0132739 0.162396 -0.014817
+-0.0205091 0.112696 0.0389743
+0.0400974 0.0943736 -0.00783899
+0.0445099 0.0945603 0.0161557
+-0.00940844 0.100291 -0.0242411
+-0.0880121 0.147225 0.0305337
+-0.0134729 0.17718 -0.0214028
+0.0289055 0.0408264 0.0297172
+-0.0386238 0.0335154 -0.0250853
+-0.0474847 0.0931518 0.0438057
+0.0385195 0.109282 0.00815775
+-0.0094889 0.119647 0.0372435
+-0.0558334 0.0358523 0.0464479
+0.0391497 0.108397 0.00837586
+-0.0166742 0.0668915 0.0537111
+-0.0514343 0.0647808 0.0348885
+-0.0506054 0.0575708 -0.00965819
+0.0186225 0.0355557 -0.00967449
+-0.0507888 0.0855066 -0.0215873
+-0.0563207 0.0562341 0.00763908
+0.00416104 0.0393786 0.0331643
+0.00410872 0.110162 -0.02034
+-0.0326921 0.152804 -0.00294992
+-0.0105902 0.0385498 0.00372703
+-0.0450772 0.0337168 -0.000691764
+0.00110427 0.111585 -0.0201254
+-0.086661 0.123026 0.0482846
+-0.00349688 0.0633763 0.0563118
+0.0181674 0.0959966 -0.023265
+0.0171824 0.126495 -0.000336309
+0.0349695 0.0577828 0.0363582
+-0.0893883 0.0956403 0.0164184
+-0.0132244 0.172771 -0.0193112
+-0.0115098 0.0702302 0.0553956
+0.0292762 0.0431552 0.0314362
+0.0355897 0.0411906 0.0271165
+-0.0396848 0.0344413 0.0355548
+-0.0488762 0.0335766 0.000473902
+-0.0845392 0.0778023 0.0145171
+-0.0600467 0.0342661 0.0313871
+-0.0484946 0.156406 0.00957752
+-0.0435279 0.0506014 0.0392212
+-0.0581322 0.0624985 0.0284102
+-0.0319273 0.126498 0.0125244
+-0.0692254 0.124258 0.0526584
+0.0346263 0.114673 0.0139267
+-0.0707453 0.113137 0.049314
+0.0440515 0.0722274 0.0248494
+-0.0190238 0.0384735 0.0274147
+0.0318733 0.11664 0.0243218
+-0.00980958 0.166665 -0.0207735
+-0.075878 0.0954761 0.0383509
+0.04237 0.0533961 -0.00679891
+-0.00515103 0.127241 0.0295045
+-0.0386117 0.0406767 0.0425487
+0.0591522 0.0552732 0.011174
+0.0399613 0.0806226 0.0334139
+-0.0892353 0.14446 0.0304266
+-0.0104754 0.127368 -0.00300647
+-0.0635158 0.162004 -0.0583208
+-0.0801984 0.0868229 -0.00856132
+-0.0600399 0.13696 -0.00647222
+-0.0777335 0.153443 0.0307864
+-0.046469 0.119345 0.0289808
+-0.0313084 0.126018 0.00688499
+-0.0190244 0.0385858 -0.00538325
+-0.0698329 0.112058 0.0465849
+-0.0761752 0.110468 0.0448594
+0.0607736 0.0651167 0.0161629
+-0.0738077 0.102191 0.0374953
+-0.0406116 0.0337811 0.00738645
+-0.0152574 0.166467 -0.0199789
+0.0135127 0.0860479 0.0530247
+-0.072308 0.159721 -0.00687103
+0.00549414 0.130728 0.00313392
+-0.00649655 0.0870315 0.0570873
+-0.0353742 0.125928 -0.00196324
+0.00551011 0.0870055 0.0566199
+0.00569172 0.093878 -0.0314287
+0.0453353 0.0533808 -0.00616451
+-0.0788788 0.16526 -0.0309581
+0.0122616 0.0765812 -0.0308581
+-0.0471876 0.131943 0.0231102
+0.0442177 0.0860807 -0.00279659
+-0.0735334 0.165176 -0.017728
+-0.0896904 0.116203 0.0443945
+-0.0887705 0.0969872 0.0214096
+-0.0201887 0.0754016 0.0541402
+0.0203245 0.0636 -0.0272806
+-0.0513256 0.0345659 0.0399502
+-0.0461113 0.034482 0.0324006
+-0.0773794 0.109459 0.0418273
+0.0262228 0.0747294 -0.0245497
+-0.0281178 0.0845911 -0.0356125
+-0.029049 0.0511502 0.0411139
+-0.0685509 0.065132 0.0256966
+-0.0660181 0.127026 0.048508
+-0.0475948 0.0403553 0.044655
+-0.0711998 0.15079 -0.0434624
+0.0346942 0.0401467 0.0260507
+-0.0803051 0.0719229 0.0175051
+0.0266708 0.121701 0.00384182
+-0.0637803 0.118542 0.0465326
+0.0257185 0.0699313 0.0441746
+-0.0865836 0.11378 0.0451954
+-0.0543656 0.153368 0.0199938
+-0.0147843 0.0981951 -0.0260468
+-0.0480746 0.134034 0.00539884
+-0.0172971 0.0386165 -0.00691824
+0.024363 0.0867852 -0.0239669
+0.000502788 0.056275 0.0546165
+0.0460119 0.0750141 0.00420589
+-0.0813458 0.154098 0.0250842
+-0.0504992 0.111154 0.0370407
+0.0480441 0.0725423 0.0171549
+0.0177377 0.0821568 0.0520978
+-0.0634907 0.0833477 0.0441845
+-0.0287709 0.04365 -0.0290051
+0.0412886 0.0858436 -0.00978207
+-0.0434867 0.0959016 0.0426578
+-0.0685902 0.112767 0.0465657
+0.0446015 0.0889424 0.0221651
+0.0387218 0.0993392 0.0297824
+-0.0569101 0.0984236 -0.0203516
+0.0460228 0.0834207 0.0061859
+-0.0608711 0.101136 -0.0186334
+0.0198592 0.123572 0.0284223
+-0.0670185 0.155095 -0.00202392
+0.00194178 0.0353485 0.0200578
+-0.0202225 0.0381837 0.0220241
+0.0372544 0.111046 0.00772111
+-0.0226761 0.0552382 -0.0304344
+-0.0500773 0.15315 -0.00486218
+0.0361622 0.075448 0.0382492
+0.00638813 0.0448624 -0.0253374
+0.0240783 0.123806 0.00430528
+-0.0874625 0.123933 -0.000723767
+0.0191746 0.064523 0.0487473
+-0.0528554 0.116872 0.0339893
+0.0012658 0.0697321 -0.0339789
+0.0363552 0.112269 0.0088181
+-0.0336364 0.0836212 -0.0255231
+0.0394621 0.0820907 0.0342997
+-0.0759857 0.112794 0.0483899
+0.042364 0.0505846 -0.00668018
+-0.0878291 0.0895228 0.0236162
+-0.0717396 0.156144 0.0122972
+-0.0118777 0.107304 -0.0220947
+-0.0518036 0.0898543 -0.0220029
+-0.0605307 0.142151 -0.00455603
+-0.00730388 0.0394625 0.048838
+-0.0695099 0.151355 -0.0447129
+0.0461391 0.0820336 0.0131698
+-0.0680095 0.151244 0.0371953
+-0.0696447 0.155522 0.00577511
+0.0106458 0.0343542 -0.00488721
+-0.0717447 0.165221 -0.0449739
+0.00872274 0.0346011 0.0383625
+-0.0601559 0.0472008 0.00728305
+-0.072526 0.149972 -0.0424686
+-0.0921507 0.129567 0.0102504
+-0.0195451 0.0382679 0.00943
+0.017351 0.0351839 -0.014686
+0.026638 0.0619848 -0.0226053
+-0.0779425 0.0757661 -0.00656744
+0.0456648 0.0834028 0.0181693
+-0.00238392 0.0391586 -0.00815532
+-0.0760947 0.171183 -0.0343205
+-0.037685 0.127343 0.0163262
+0.0200653 0.084847 0.0502217
+-0.0576821 0.0438911 0.0236882
+-0.00181158 0.0365903 0.0109133
+-0.0227414 0.0640418 -0.0345473
+-0.0607804 0.0397294 0.0180031
+0.00451899 0.0966593 -0.0283637
+-0.00904759 0.0994069 0.0493883
+0.036694 0.0368281 0.0111245
+-0.0476151 0.0378648 -0.0125385
+-0.0374934 0.0620193 0.0412021
+-0.0678369 0.0706443 0.0351197
+0.0262359 0.122255 0.0222063
+-0.0258834 0.0347926 0.045205
+-0.0730191 0.0808411 -0.0145801
+0.0272041 0.0968528 0.0430049
+-0.0387216 0.0710357 -0.0169218
+-0.0802983 0.0953773 0.0342868
+-0.0928216 0.122866 0.0342742
+0.0288283 0.120572 0.00606361
+-0.0872644 0.139206 0.0412952
+-0.0528885 0.108408 -0.0187758
+-0.0614742 0.149784 0.0364078
+-0.0888928 0.113895 0.0428033
+0.0133289 0.0681229 -0.0310343
+-0.000536732 0.10034 0.0474846
+0.0582707 0.0579579 0.00417743
+-0.0896629 0.124003 0.00427429
+-0.0333755 0.0483636 -0.0203394
+-0.0335104 0.169764 -0.00293532
+-0.0488446 0.119728 0.0310062
+0.0426741 0.0972641 0.0231497
+-0.0441044 0.0451364 -0.0122986
+-0.059855 0.0594826 0.0200848
+0.0270691 0.0942437 0.0445649
+-0.0896385 0.0969877 0.0134181
+-0.0456599 0.0636306 -0.0135866
+0.0575548 0.053733 0.00618309
+-0.054499 0.0776179 0.0432703
+0.0434163 0.0464179 0.0294988
+-0.0134899 0.0951663 0.0534531
+0.0324423 0.0754774 0.0416539
+-0.0117218 0.0382705 0.0200729
+-0.0308456 0.0396262 0.0517145
+0.0564645 0.0594668 0.0252844
+-0.0475135 0.0491287 0.0385522
+-0.0396908 0.0651397 -0.0142325
+0.0201781 0.0351992 0.0293411
+-0.0219159 0.175693 -0.0142737
+-0.0688718 0.063973 0.0231175
+0.0174279 0.12392 0.0289777
+-0.0699032 0.0687756 0.0310328
+-0.0528961 0.143026 -0.000455911
+-0.0475121 0.0438565 0.0432608
+-0.0275879 0.0384125 -0.00879832
+0.0421339 0.102871 0.00816377
+0.0276939 0.085014 -0.0220629
+-0.0593718 0.0422854 0.0165091
+0.0245725 0.122909 0.0244414
+0.00141552 0.0990584 0.0500955
+-0.0208664 0.103024 -0.023442
+-0.04595 0.0351008 -0.0224117
+0.0425933 0.066459 0.0273252
+-0.085327 0.0926016 -0.00256332
+-0.0496528 0.0345916 0.0385506
+-0.023191 0.178657 -0.0125853
+-0.0179257 0.0971306 -0.0269629
+0.0383787 0.0575308 -0.00558257
+-0.0190955 0.0939751 -0.033709
+-0.0659978 0.135528 -0.00820667
+-0.0379695 0.0348544 -0.0150276
+0.0231948 0.0344554 0.00500709
+-0.0577114 0.148197 0.0324041
+0.0473189 0.0638822 -0.00202275
+-0.091122 0.115466 0.0410527
+-0.0499316 0.141822 0.00385784
+-0.0663647 0.0360087 0.0372253
+-0.0453211 0.0345932 0.035979
+-0.00367712 0.0569332 -0.0329252
+-0.0883137 0.103697 0.0153744
+0.0333218 0.0981688 0.0378146
+0.0206459 0.0429683 -0.0197059
+-0.0718069 0.0887788 0.0415418
+-0.050581 0.0445938 -0.00942218
+-0.0589701 0.121961 -0.00876657
+-0.0786152 0.163841 -0.0309629
+-0.0919702 0.114664 0.0123319
+-0.0387263 0.127561 -0.000266265
+0.0573405 0.0635192 0.0248021
+-0.0778913 0.126656 -0.00702073
+-0.0685283 0.0434892 0.00727271
+-0.0779351 0.161108 -0.0209335
+-0.0892037 0.0956419 0.0194144
+-0.091675 0.147474 0.0191435
+0.00817319 0.0832888 0.0558122
+-0.051142 0.0627417 0.0330975
+0.00546913 0.116627 -0.0176566
+-0.0278605 0.124718 0.0184442
+-0.0689992 0.150311 0.0384044
+-0.0690062 0.162382 -0.0519693
+-0.00661995 0.130084 0.0216557
+0.0403849 0.0533789 -0.00673496
+0.0156377 0.0348863 0.0377268
+0.0577131 0.0523367 0.00917793
+-0.00120988 0.105335 0.044053
+-0.00579434 0.0351694 0.0474261
+0.0411666 0.0833385 0.031438
+-0.0325019 0.0988116 0.0438807
+0.00307304 0.124054 -0.00961404
+-0.0350636 0.0383682 -0.0121121
+-0.073931 0.128192 -0.0084465
+0.015055 0.123588 -0.00721903
+0.0455542 0.0875891 0.00417683
+-0.006733 0.0684593 -0.0359965
+0.00394905 0.100531 -0.0224465
+-0.0399008 0.128531 0.0110866
+-0.0778707 0.177255 -0.0480374
+-0.0310993 0.177108 -0.0141677
+-0.0307989 0.0833965 -0.031578
+0.00828982 0.0846467 0.0559983
+-0.0926147 0.121379 0.00928006
+-0.0309131 0.0848198 -0.0305724
+-0.0610919 0.155915 0.0160896
+0.0269409 0.117743 0.0296345
+-0.029909 0.0904807 -0.0265953
+0.0341142 0.0605859 0.0386759
+0.04958 0.0652138 -0.00133913
+-0.0406916 0.0651596 -0.014333
+-0.0186192 0.0393436 -0.0280481
+-0.0321414 0.16968 -0.0161315
+-0.0303394 0.0344325 -0.0205625
+-0.0749113 0.125246 -0.00804661
+0.0179783 0.035483 -0.0126728
+-0.0572916 0.0479655 -0.00237378
+-0.030388 0.0876244 -0.0295653
+-0.00273996 0.130454 0.0216129
+-0.0785777 0.0907895 -0.0106208
+-0.0237519 0.0683934 -0.0360687
+0.0305158 0.11943 0.00953878
+0.0436886 0.0777182 0.0262206
+-0.00223658 0.0383059 0.0473338
+-0.0174973 0.104415 0.0431217
+0.045327 0.0519476 -0.00589943
+-0.022701 0.0611501 -0.0334866
+-0.0334865 0.126881 0.00753677
+0.0458812 0.084809 0.00618736
+-0.0775185 0.147451 0.0411778
+-0.00849166 0.110041 0.0429425
+-0.00827497 0.0389568 -0.00728452
+-0.0154767 0.0545272 0.0507241
+0.0455115 0.0861913 0.0171661
+-0.0286176 0.124173 0.0196508
+-0.0903937 0.142028 0.0281621
+-0.00750142 0.0590729 0.0550185
+-0.0691508 0.152358 -0.047074
+-0.00484252 0.0384695 0.0194856
+-0.00149467 0.116953 0.0400314
+-0.0148242 0.128616 0.018702
+-0.00749757 0.0939067 0.0556187
+0.031866 0.115189 -0.00211013
+-0.0515259 0.0439564 0.0445165
+-0.0773104 0.159761 -0.0159076
+0.0205013 0.108449 0.0395681
+-0.0648774 0.159303 -0.0143091
+0.0267364 0.0606633 -0.022785
+0.00150878 0.0883997 0.0564367
+-0.0659091 0.06022 0.0163937
+-0.0625921 0.1213 0.0447428
+-0.0789765 0.135392 -0.00472816
+-0.0709567 0.0767623 0.0380194
+-0.0506142 0.0560954 -0.00917258
+-0.0707687 0.155356 -0.0469258
+-0.0675837 0.112197 0.043642
+-0.0159686 0.128428 0.0182857
+-0.0564715 0.132545 0.0359114
+-0.044247 0.157947 0.00609665
+-0.011089 0.038804 -0.005846
+-0.0380666 0.0385186 -0.00730796
+0.0253529 0.0520143 0.0399629
+0.00465347 0.0341223 0.0126365
+-0.0905147 0.136459 0.016202
+-0.0184793 0.0336465 -0.023124
+0.0165026 0.118175 0.0355154
+0.0109305 0.0685438 0.0544088
+-0.00849797 0.0952525 0.0545557
+-0.050269 0.11691 0.032477
+-0.0301947 0.125922 0.0102205
+-0.0914405 0.117414 0.0273008
+-0.0231534 0.0352107 0.0523184
+-0.0922901 0.125582 0.0342578
+-0.0703512 0.170836 -0.0520339
+-0.0881528 0.129472 0.0022725
+-0.0125497 0.0445369 0.0499253
+0.0104221 0.127848 0.0278469
+-0.0114754 0.0546403 0.0519269
+-0.0665146 0.16661 -0.0580261
+-0.0384984 0.169734 0.00180247
+0.0290438 0.0509642 -0.0167532
+0.0292682 0.0673021 0.0422638
+-0.0643695 0.149877 -0.0298747
+-0.0741326 0.180484 -0.0536706
+-0.0484658 0.144752 0.00741107
+0.02369 0.10485 -0.01704
+0.0383652 0.101327 -0.00724085
+-0.0516205 0.0604369 -0.00991236
+-0.0080847 0.125292 0.0313586
+-0.0117515 0.0714338 -0.0381291
+-0.0358096 0.12684 0.0170169
+-0.0620073 0.155313 -0.0175819
+-0.0861256 0.0937891 0.0274526
+-0.0627193 0.152197 -0.01058
+0.0557633 0.0538969 0.024211
+-0.0501537 0.152144 0.0115744
+-0.0504041 0.0345678 0.0349233
+-0.0622094 0.0655019 0.0319825
+-0.0630381 0.154049 0.0314099
+-0.0864944 0.112209 0.0250023
+-0.0765838 0.178662 -0.0494737
+-0.0880478 0.0908955 0.0237752
+-0.0540202 0.0513732 0.0109294
+0.0220807 0.125732 0.0192313
+0.000503516 0.0856702 0.0573793
+-0.0624013 0.116928 0.041368
+-0.0687693 0.0793684 -0.0165822
+0.0312024 0.114939 -0.00384217
+0.0394926 0.052754 0.032086
+-0.076502 0.12459 0.0526576
+0.0461265 0.0736153 0.00421619
+0.0493794 0.0453908 0.0224152
+0.0422961 0.0655994 0.0276352
+0.0444235 0.0917457 0.0211574
+-0.04812 0.128214 0.028687
+-0.0256026 0.0837946 0.0522209
+-0.00959872 0.0391743 -0.0260833
+0.0242446 0.0762105 -0.0254816
+-0.050147 0.145259 -0.000515581
+-0.0729617 0.136954 -0.00717713
+-0.0321019 0.119786 0.0288381
+-0.0723819 0.152607 -0.0408904
+0.0595077 0.0567056 0.0171693
+-0.0647247 0.16489 -0.0257757
+0.0214018 0.0473917 -0.0206345
+-0.0652965 0.147932 -0.0271042
+0.0404164 0.0647148 -0.00677085
+-0.0440757 0.0335994 -0.0169421
+-0.0658186 0.154852 0.00425231
+-0.0457713 0.156483 0.00739285
+-0.0550494 0.0577849 0.0202145
+-0.0233757 0.163881 -0.00766181
+-0.0658954 0.166616 -0.0590008
+0.0309109 0.0511672 -0.0117352
+0.0380176 0.101228 -0.00786632
+0.0272437 0.0732614 -0.0238068
+-0.0161865 0.0377383 0.0516902
+-0.051271 0.0356477 0.0458842
+-0.0184884 0.107161 0.042158
+0.0143121 0.0753991 0.0540935
+0.012486 0.0990688 0.0481132
+-0.069936 0.13258 -0.0084535
+-0.0324718 0.0546382 0.0373194
+-0.0637186 0.179242 -0.0585917
+-0.0560047 0.159776 0.00109778
+-0.0940215 0.120122 0.0233001
+-0.0734929 0.154069 -0.0299022
+0.0334431 0.0930091 -0.0164312
+-0.0568079 0.0869026 -0.0213473
+0.0600207 0.0595165 0.0181686
+-0.0282716 0.0376885 0.0226211
+-0.0608814 0.102587 -0.0185388
+-0.0689777 0.172299 -0.0388012
+-0.0333033 0.176609 -0.00426163
+-0.0726003 0.145757 -0.0168539
+-0.0351155 0.0460859 0.0430647
+-0.0668221 0.16563 -0.0222317
+0.0223344 0.0535713 -0.0254238
+-0.0555068 0.0341015 0.0254741
+0.0591828 0.0594427 0.0211715
+-0.076476 0.07597 0.0322323
+-0.0548438 0.043635 0.0177242
+-0.0545598 0.0616597 -0.0074577
+-0.0717138 0.073474 0.0353741
+-0.0123858 0.0383448 0.0108168
+-0.0878417 0.140531 0.0102059
+-0.0338438 0.0337316 0.012415
+-0.0362549 0.153841 -0.0082413
+-0.066147 0.0353356 0.0361254
+-0.0149468 0.125073 -0.0044168
+-0.0517378 0.0545135 0.0226244
+-0.0791517 0.0792478 0.0324066
+-0.0311673 0.0386498 -0.0134468
+-0.00138514 0.0391216 -0.00791905
+0.0249209 0.0782259 0.0483953
+-0.0288805 0.079237 0.0443379
+-0.0499299 0.0335056 -0.0106454
+0.000248169 0.0726618 -0.0353693
+-0.00679601 0.100851 0.0456503
+0.00749727 0.121002 0.0360768
+0.0281364 0.0448054 0.035097
+-0.0616338 0.0739295 0.0406212
+-0.0184922 0.11816 0.035496
+-0.0231843 0.0348489 0.0439808
+0.0524989 0.0718135 0.00595977
+-0.0114982 0.0943996 -0.0340943
+-0.0574587 0.045976 0.042703
+0.0272754 0.0703879 -0.0233186
+-0.0208041 0.127131 0.0063587
+-0.0449931 0.152736 -0.00651735
+-0.0154877 0.167822 -0.0210841
+-0.0738833 0.122317 -0.0079807
+0.0163998 0.0834424 0.0519345
+-0.0615988 0.156867 -0.0225865
+-0.0504372 0.0529682 0.0186225
+-0.0607622 0.0781498 -0.0187637
+-0.0208042 0.125974 0.0209606
+-0.0245306 0.112636 0.0373469
+-0.030708 0.121227 -0.00820323
+-0.0511359 0.0502476 0.0206335
+-0.0384993 0.0733372 0.0420402
+-0.0588719 0.102608 -0.018764
+-0.0774969 0.130279 0.0531227
+-0.0375712 0.124334 -0.00748059
+-0.0119956 0.0882297 -0.0377812
+0.0547499 0.0492946 0.00521444
+0.017211 0.088423 -0.0276786
+0.0381646 0.0644978 -0.0107883
+-0.04783 0.0927226 -0.0216222
+-0.0132756 0.0597275 0.0533794
+-0.00158335 0.0361983 -0.0246741
+-0.0612049 0.174131 -0.0607222
+-0.0655175 0.0356165 -0.00754656
+-0.0874441 0.0860134 0.00347726
+-0.00749507 0.10164 0.0441128
+-0.0175041 0.0382782 0.00983265
+0.00351386 0.100332 0.0462561
+0.0252498 0.0645397 -0.0230446
+-0.0717344 0.131221 0.0507858
+0.0525721 0.0648669 -0.000960413
+-0.0901978 0.11358 0.0212183
+-0.0560194 0.129616 -0.00591188
+0.0441279 0.0748554 -0.00179683
+-0.0307721 0.0349136 0.04922
+-0.0554801 0.0452738 0.0437595
+0.000511374 0.0503823 0.0524384
+0.0295573 0.0375392 0.0237122
+-0.00766545 0.0541253 -0.0331554
+-0.0226026 0.0379508 -0.0287016
+-0.0187506 0.162746 -0.0157051
+0.0546767 0.0732977 0.0167178
+0.042064 0.10006 0.0201605
+-0.0889838 0.099691 0.0193911
+-0.0644638 0.129733 0.0437115
+-0.043484 0.0987241 0.0424341
+-0.0252565 0.120536 -0.00953586
+-0.0159529 0.0390542 0.0365141
+-0.0915486 0.143335 0.0161726
+-0.0405267 0.169768 0.0017705
+-0.0726712 0.0651053 0.0195713
+-0.0132255 0.182074 -0.023933
+-0.0456018 0.0629458 0.0388902
+0.0287985 0.0385521 0.0262584
+0.0314095 0.0695437 -0.0187779
+-0.0625738 0.156865 -0.0165766
+0.0106756 0.0489592 0.0485841
+-0.0781956 0.163891 -0.0259488
+0.0262919 0.101687 -0.017683
+-0.0681573 0.180556 -0.0543707
+-0.0464942 0.100125 0.0422537
+-0.0294775 0.17726 -0.00505881
+0.00976325 0.0346476 0.0385339
+0.0351088 0.100136 -0.012024
+0.0398312 0.0992984 0.027798
+-0.0544975 0.080589 0.0448325
+-0.0251898 0.177123 -0.0193397
+-0.00463984 0.12746 -0.00519523
+0.0365694 0.109049 0.0260841
+-0.062967 0.159919 -0.044604
+0.0156331 0.0915267 -0.0269033
+-0.0577811 0.0472143 0.0403119
+-0.086179 0.107645 0.0083646
+-0.00357674 0.0347286 -0.0239915
+-0.0205507 0.066817 0.0505282
+-0.0590047 0.132542 0.0375172
+0.00657766 0.034511 0.0217547
+-0.0730595 0.110042 0.0423406
+-0.0725117 0.163674 -0.014076
+-0.0130193 0.115677 -0.016537
+0.0190348 0.0768352 0.0521916
+0.00221518 0.114462 -0.0193126
+-0.0142885 0.0390252 0.0350884
+-0.0492809 0.152135 0.0110836
+0.0378754 0.0980648 0.0320906
+-0.0377624 0.0420706 0.0430123
+0.00890997 0.125517 0.0316176
+0.00478616 0.0342999 0.00145343
+-0.0220536 0.0952953 -0.0290683
+-0.0883767 0.125344 0.00127971
+-0.055499 0.0761852 0.0427309
+-0.0505039 0.0487703 0.0186583
+0.0374548 0.0781001 0.0366194
+0.00520505 0.129939 3.61829e-05
+-0.0464525 0.146291 0.00643191
+-0.0545162 0.049049 -0.0054035
+-0.0209524 0.0920017 0.0529687
+-0.0534945 0.105667 0.0403502
+-0.0355002 0.174151 -0.00180627
+-0.0654804 0.146553 -0.0219125
+-0.0577458 0.131139 0.0375772
+0.0440584 0.0860884 0.0251529
+0.0484396 0.0486951 -0.00266239
+-0.0510317 0.0544187 0.0196187
+-0.0305049 0.0720397 -0.0305133
+-0.0513349 0.057067 0.0306313
+-0.0444577 0.123407 -0.0104693
+-0.0404418 0.0351129 -0.0289386
+-0.0611441 0.169381 -0.0576009
+-0.0704838 0.120388 0.0533274
+0.00150053 0.0591133 0.0550768
+-0.0504978 0.159322 0.00851944
+-0.0127755 0.126776 0.0267341
+0.00508634 0.0345614 -0.0155701
+-0.0433649 0.150829 -0.00565896
+-0.0276025 0.0888516 -0.0335952
+-0.0536948 0.0661603 -0.0107375
+0.0453129 0.0698237 0.023466
+-0.0407211 0.150643 0.00408479
+0.0111265 0.120476 0.0355761
+0.000791005 0.0398223 0.046536
+0.0460187 0.0482649 0.029417
+-0.0748889 0.119375 -0.00765967
+0.0240318 0.0591603 0.0451764
+0.0102193 0.129407 0.000604352
+-0.0662744 0.179701 -0.0600508
+-0.0165098 0.0772307 0.0561424
+0.0294369 0.0781918 0.0443709
+-0.0510278 0.0474301 0.0166894
+-0.0808293 0.0720933 0.0155437
+0.0139163 0.0953242 -0.0249235
+-0.0756827 0.0823892 -0.0125945
+0.00119778 0.0825383 -0.0355009
+-0.0614832 0.0775692 0.0421583
+-0.0816839 0.0830971 0.0318157
+-0.0257584 0.0736396 0.0456283
+0.0071927 0.124822 -0.00847934
+-0.0749667 0.0683767 0.0215337
+-0.0415307 0.127763 -0.00103989
+0.0217652 0.0862022 0.0491664
+-0.0758742 0.102063 -0.0106997
+0.00933423 0.0567711 -0.0303022
+-0.010684 0.0584354 -0.034314
+-0.0126507 0.0350556 0.0425263
+0.0424994 0.0597124 0.0306347
+-0.0147222 0.0643235 -0.037347
+0.0579415 0.0716454 0.0119821
+-0.000418875 0.0389219 -0.0131688
+-0.0480228 0.144604 0.00545108
+-0.0124881 0.120998 0.0354929
+-0.0941295 0.121483 0.024294
+0.0533093 0.0573451 -0.00263239
+-0.0426699 0.0336999 -0.0149012
+-0.0466248 0.0577591 -0.0115398
+-0.0628785 0.0393963 0.0426563
+-0.072166 0.063706 0.0120556
+-0.0912059 0.14882 0.0151457
+-0.033491 0.0904012 0.0444067
+0.0152459 0.0821521 -0.0296185
+-0.0608506 0.0333964 -0.00541551
+0.0483298 0.0694277 0.0246416
+-0.0144087 0.0383376 0.0158464
+-0.00316996 0.131012 0.0171239
+0.0247594 0.0929114 0.046503
+-0.0615203 0.153356 0.00130737
+-0.0618578 0.099667 -0.0183374
+0.0303629 0.0483136 -0.00765132
+0.00253507 0.0394917 0.0345311
+-0.0713444 0.144531 -0.0156116
+-0.0188175 0.159674 -0.00630165
+-0.0174928 0.111329 0.0404434
+-0.0425002 0.0437706 0.0420539
+0.038489 0.0484512 0.0319961
+-0.011814 0.163592 -0.0157611
+-0.0526941 0.0334208 -0.00928256
+-0.0613494 0.131082 0.0393909
+-0.0276253 0.0450182 -0.0280952
+-0.0449077 0.159414 0.00690868
+0.00747686 0.0474111 0.0493962
+-0.0535025 0.0917839 0.0444757
+0.0372578 0.0658262 -0.0127785
+-0.0616099 0.158421 -0.0325909
+-0.0443417 0.035118 -0.0243716
+0.0228959 0.0358901 0.0147404
+-0.0312846 0.119331 0.0291556
+-0.0748251 0.0906869 -0.0145799
+-0.0607901 0.0839118 -0.0197808
+-0.060035 0.0645406 0.0315175
+-0.0506187 0.0531538 -0.00831388
+0.0189959 0.104672 0.0434338
+-0.0328687 0.10291 -0.0220775
+0.0293781 0.0721886 -0.0217847
+0.0490097 0.0482239 0.0267018
+-0.00202044 0.0386496 0.0235231
+0.00793635 0.0980328 -0.0238123
+-0.0353308 0.0347033 0.016646
+0.00129902 0.039118 0.0292011
+0.0433693 0.0561672 -0.00598915
+0.0455002 0.059749 0.0314265
+-0.0891212 0.0888935 0.0154552
+-0.00853579 0.044404 0.0484956
+0.0227707 0.10612 -0.0163977
+-0.0830074 0.117688 0.0489709
+-0.0652397 0.150467 -0.0337229
+-0.0787271 0.0954037 0.0355432
+0.0320582 0.11345 0.0286813
+-0.0641355 0.160881 -0.0576174
+0.0459242 0.0806108 0.00418728
+0.0093871 0.0434015 -0.0246765
+-0.0501776 0.124028 0.032677
+-0.0486159 0.0547593 -0.0100622
+0.000494108 0.118289 0.0391022
+-0.0267825 0.0768545 -0.0363352
+0.039504 0.0914002 0.0327084
+0.0495572 0.0525985 0.0293193
+-0.0221892 0.177131 -0.0213718
+0.00724524 0.0369774 0.0269173
+0.0174748 0.0934539 0.0481542
+-0.021119 0.180019 -0.0220004
+-0.0938873 0.12827 0.0192438
+-0.0558806 0.138039 -0.00386657
+-0.0754975 0.123189 0.0531282
+-0.0682563 0.169911 -0.0313673
+0.00486454 0.131282 0.0057704
+-0.0544491 0.156028 0.0112408
+0.0259161 0.0713197 0.0444841
+-0.0205993 0.0408181 -0.0286892
+0.0326751 0.0902947 0.0421046
+0.0303546 0.107428 0.0353018
+-0.043641 0.0451148 -0.0133235
+0.0453399 0.0504735 -0.00539794
+-0.0640884 0.160897 -0.0576117
+-0.015926 0.178652 -0.0196554
+0.0285634 0.0463012 0.0357516
+-0.00467538 0.0353718 0.0474871
+0.00649755 0.131366 0.0177838
+-0.0721007 0.175064 -0.0530188
+-0.0454824 0.0959409 0.0431744
+-0.0892808 0.0888643 0.0124572
+0.00219675 0.0376886 0.0234384
+-0.0084105 0.095275 -0.0329664
+-0.0384962 0.11803 0.0312871
+-0.0451864 0.146266 0.00463419
+-0.0870838 0.0846865 0.0114769
+-0.0855325 0.107606 0.0053458
+-0.0457969 0.126831 -0.00605616
+-0.0164306 0.0384009 0.00449856
+-0.0355073 0.0662414 0.0411418
+0.0174851 0.0852069 0.0507856
+0.0160687 0.122524 -0.00804645
+-0.0586545 0.152137 0.0330321
+-0.0294308 0.0847062 -0.0336139
+-0.0725432 0.15415 0.0310449
+0.0567814 0.0724634 0.0130365
+0.0378457 0.0726607 0.0353699
+0.00540963 0.0375924 -0.0240752
+-0.0555707 0.033544 0.017104
+0.0295902 0.119982 0.0063504
+0.0197767 0.104476 -0.0186365
+-0.0484985 0.160789 0.00748776
+-0.0928176 0.120043 0.0102955
+-0.0427809 0.0464775 -0.012357
+-0.0285046 0.0645461 0.0380462
+0.00349921 0.126284 0.0311054
+-0.0670064 0.156281 0.0226936
+-0.0656496 0.0339611 -0.00733584
+-0.00649844 0.0814993 0.0573243
+0.0421622 0.0427592 0.0252421
+-0.0873651 0.0927561 0.00443631
+-0.00151033 0.108645 0.043169
+-0.0908157 0.116185 0.0427025
+0.0200734 0.0372985 0.0402199
+-0.062954 0.125297 -0.00870732
+-0.0633546 0.0720236 0.0383997
+-0.0691914 0.171601 -0.0360136
+-0.0688255 0.0937312 -0.0163709
+-0.0485029 0.112572 0.035725
+-0.00574267 0.0339825 -0.0190499
+-0.0604857 0.094604 0.0446906
+-0.0257335 0.166803 -0.00931015
+-0.0159771 0.186924 -0.0221541
+0.0463322 0.0743214 0.0180018
+0.0030519 0.130996 0.00365966
+-0.0421665 0.16366 -0.0107342
+-0.0225871 0.168294 -0.0117855
+-0.0484917 0.0718083 0.0405326
+0.0122698 0.0710113 -0.031719
+-0.0857101 0.0869161 0.0258492
+-0.0715046 0.0901731 0.0417302
+-0.0699133 0.123828 -0.00875488
+0.0279019 0.110786 -0.0114065
+-0.0354864 0.12379 0.0245568
+0.0305321 0.081181 -0.0200863
+0.0102651 0.128706 0.0263309
+0.0148603 0.0562539 0.0494599
+-0.0366932 0.0665933 -0.0149481
+0.041469 0.0711384 0.0300167
+-0.0554857 0.0834027 0.0450839
+-0.0113051 0.0389162 -0.0134542
+-0.0701665 0.143936 0.0443089
+0.0424986 0.0527982 0.0326152
+0.0132 0.115178 -0.01612
+-0.0566151 0.0335713 0.0115144
+-0.0746759 0.158036 -0.00628607
+-0.0710897 0.0678996 0.0280309
+-0.0684162 0.160948 -0.0539628
+-0.0788405 0.11444 0.0481937
+0.0425653 0.0859482 -0.00679004
+0.00508264 0.128731 0.0273249
+-0.0460392 0.132757 0.0146796
+-0.0644245 0.0335892 0.00631261
+-0.0779562 0.0727271 0.0259414
+-0.0320811 0.1577 -0.0118106
+-0.08561 0.123026 0.0486561
+-0.0183468 0.0445922 0.0521871
+-0.0646788 0.0378404 0.0247428
+-0.09254 0.118824 0.0413658
+0.0439353 0.0973509 0.0141605
+-0.0925657 0.116008 0.0123183
+-0.00476329 0.0770151 -0.03731
+-0.0647922 0.176686 -0.0531637
+-0.0267774 0.122204 0.0247423
+-0.0331437 0.169673 -0.0156322
+-0.0663865 0.0388997 0.0348294
+0.0255945 0.0477251 0.0385093
+0.0336609 0.0968599 0.0382997
+-0.0916539 0.147467 0.0181472
+-0.0336992 0.0435791 0.0473765
+-0.0785063 0.162438 -0.0279579
+-0.0756712 0.0759423 -0.00884701
+-0.0623186 0.155306 -0.0155862
+-0.0754942 0.124603 0.052984
+-0.0710841 0.0626658 0.0113319
+-0.0214966 0.101664 0.0441706
+0.0325091 0.0454335 0.0302933
+0.023348 0.0930459 -0.0224955
+-0.0477168 0.123954 0.0291105
+0.026559 0.119879 -0.0019388
+-0.0671262 0.150692 -0.0396095
+-0.054551 0.0416447 -0.00949548
+-0.0689 0.115705 0.0512836
+0.0420833 0.0409609 0.00227771
+0.021477 0.0961774 0.0469631
+-0.0517663 0.0812234 -0.0211522
+0.0324154 0.0541402 -0.0117355
+-0.0283184 0.0383801 -0.00152859
+-0.0454995 0.122409 -0.0114255
+-0.0786209 0.174303 -0.0444916
+-0.0570614 0.151623 -0.00120922
+0.0242791 0.118022 0.0317589
+-0.0639993 0.0370815 0.0170442
+-0.0395018 0.0733502 0.0421461
+-0.0174724 0.0388154 -0.0145918
+-0.0829949 0.115554 0.048125
+-0.0155328 0.0386551 0.0297691
+-0.00449743 0.110031 0.0429169
+-0.062341 0.164692 -0.0435908
+-0.016985 0.0384848 0.0278228
+0.0153998 0.109294 -0.0177665
+-0.0121134 0.0347053 0.046472
+0.0238752 0.0421864 0.0394869
+-0.0510476 0.139892 0.00172061
+-0.073661 0.147179 -0.0178577
+-0.0673436 0.155169 0.0284164
+-0.0375089 0.0790164 0.0426336
+-0.0881282 0.0888644 0.0224361
+-0.0165385 0.0459978 0.0505746
+0.0187298 0.0489829 0.0426596
+0.00514365 0.0400743 0.045751
+-0.0405081 0.080404 0.0427771
+-0.0559081 0.112628 -0.0165116
+-0.0414824 0.100082 0.0415393
+0.0326734 0.101648 -0.0136311
+0.0591059 0.0677548 0.00712748
+-0.00525238 0.0350087 0.0405181
+0.0272291 0.0788716 -0.0231926
+0.0526679 0.0554283 0.0285725
+-0.074839 0.15964 -0.0289433
+-0.0475589 0.0335011 0.00261705
+0.0224079 0.0809035 0.0500644
+-0.0774544 0.072993 0.0275707
+-0.0817516 0.140386 -0.000790241
+-0.0203273 0.127615 0.0123404
+-0.0570931 0.0535244 0.00162534
+-0.0775213 0.124569 0.0523637
+-0.0267733 0.15662 -0.0020223
+-0.0341168 0.0383136 -0.000825234
+-0.0926373 0.122856 0.0322729
+0.00549857 0.09243 0.054294
+0.0202616 0.0749268 -0.0272874
+0.0133552 0.13008 0.0103074
+0.0423653 0.0519948 -0.00681796
+-0.0627003 0.150649 -0.00857321
+0.0200754 0.0713524 0.0501382
+-0.0182235 0.123174 0.0292543
+-0.0130686 0.183424 -0.0252779
+-0.0128628 0.0896836 -0.0372956
+-0.0301706 0.0421547 -0.0296993
+0.0403707 0.0444834 -0.00362771
+-0.0253772 0.0722169 0.0453002
+-0.0241328 0.0565311 0.0416958
+-0.0657729 0.0378142 0.038507
+-0.0475733 0.0504004 -0.00924022
+0.0347756 0.0548514 0.0342768
+-0.01273 0.098974 -0.0248693
+-0.0749897 0.139866 -0.00647617
+0.0541381 0.0477755 0.0182012
+0.026052 0.121668 0.00219807
+-0.0178133 0.0827451 -0.0392154
+-0.00506384 0.129812 0.0236663
+-0.0022335 0.116052 -0.016996
+0.0194826 0.0892535 0.0485994
+-0.00549695 0.108658 0.0435455
+0.0411799 0.0844321 -0.00979241
+-0.0546525 0.154186 0.0155249
+0.0209039 0.0386887 -0.00868617
+-0.0522987 0.0504261 0.0316576
+-0.00860205 0.0406149 -0.0260948
+-0.0064872 0.119657 0.0377321
+-0.0794636 0.141716 -0.00376694
+-0.0494618 0.0347575 0.043629
+-0.0282938 0.176171 -0.0172378
+-0.0337476 0.119587 0.029726
+-0.0548148 0.0883935 -0.0220325
+-0.0759162 0.179384 -0.0516058
+-0.0444968 0.0747696 0.0424527
+0.0361181 0.111694 0.0216233
+-0.0677747 0.0370061 0.0137537
+-0.0497774 0.0826759 -0.0213753
+0.0238372 0.12269 -3.58731e-05
+-0.0478227 0.148347 -0.00331487
+-0.00860618 0.0968801 -0.0306409
+-0.0545965 0.0575496 0.0196126
+-0.06512 0.0430832 -0.00329452
+-0.0719312 0.128266 -0.00893149
+-0.0409612 0.0344092 -0.00782476
+0.0534457 0.0510274 0.0243391
+0.0276856 0.0494518 -0.0176966
+-0.0336693 0.0607336 -0.0127906
+-0.0284587 0.0446173 0.0507119
+-0.0255118 0.0936195 -0.0293755
+-0.0717668 0.172238 -0.0510285
+-0.047089 0.156143 -0.00736831
+-0.0756553 0.0837701 -0.0135751
+-0.013224 0.172718 -0.0260103
+-0.0301691 0.174141 -0.0165339
+-0.00226303 0.0382357 0.0184109
+0.0412731 0.0417215 0.0241695
+-0.0559192 0.0335546 0.0152404
+0.0277966 0.12141 0.0199376
+-0.0649916 0.0659907 0.0309635
+-0.0512719 0.127504 -0.00467957
+0.0313718 0.118521 0.0155758
+-0.0621134 0.0350003 0.0423988
+0.00602626 0.127371 -0.00517179
+-0.0500909 0.0358963 0.0459805
+-0.0852266 0.0854944 0.0253873
+-0.0209874 0.04034 0.0536055
+-0.0719403 0.179282 -0.0559874
+-0.0521219 0.120842 -0.0117106
+0.0579437 0.0700837 0.0193768
+-0.0786649 0.0764169 0.0296559
+-0.0724896 0.12743 0.0524304
+0.0400371 0.107017 0.0091647
+-0.0677955 0.0355805 0.0137906
+-0.0212083 0.0825271 0.0563448
+0.0305816 0.112813 -0.00758269
+0.0546919 0.0524816 0.0244106
+0.000503407 0.0647904 0.0566018
+-0.0211614 0.183089 -0.0130948
+-0.0364897 0.0648519 0.0414613
+0.00739557 0.0347435 -0.0216037
+-0.091466 0.14613 0.0241501
+-0.0496442 0.0620141 -0.0117058
+-0.0844141 0.083121 -0.000497419
+0.00924009 0.0846665 0.0556174
+-0.00137013 0.0367929 0.00718583
+0.0499211 0.0443554 0.0178724
+-0.0257693 0.158564 -0.0117505
+-0.08951 0.140665 0.0311774
+0.0074706 0.129229 -0.00123166
+0.0318377 0.0822312 0.0425933
+0.0347555 0.0768972 -0.0157225
+-0.0103619 0.179472 -0.0295714
+0.0350602 0.0968439 0.0368099
+0.0192972 0.063662 -0.0278633
+-0.0758841 0.106327 -0.00893896
+0.0225495 0.119713 -0.00701355
+0.0522449 0.0480372 0.0225432
+-0.0142613 0.0350279 0.0492532
+0.0588535 0.0566417 0.00718098
+-0.0834209 0.0911774 0.0304851
+-0.0354827 0.0945899 0.0441989
+0.0491837 0.0442045 0.019604
+-0.0441515 0.0335185 0.00510187
+-0.0605024 0.111127 0.0368734
+-0.0368482 0.0336146 -0.0266993
+0.0043237 0.131753 0.0112849
+-0.0519904 0.135575 0.0286552
+-0.0628904 0.102548 -0.0180123
+-0.0194395 0.062521 0.0495605
+0.0173831 0.0447578 -0.0232543
+-0.0925995 0.118805 0.0322947
+0.00218481 0.0838969 -0.0348518
+0.0331279 0.0428909 0.0287274
+-0.0528013 0.0884055 -0.0219839
+0.0151848 0.115917 -0.0149184
+0.0567976 0.0508328 0.0181941
+-0.0621222 0.0345142 0.0394173
+-0.0642021 0.071089 0.0372614
+-0.0701839 0.0658802 0.0247105
+0.0178908 0.0563588 0.0485803
+0.0392199 0.073038 -0.0108301
+0.0263921 0.0549677 -0.020802
+-0.0858835 0.0833066 0.0204824
+-0.0812999 0.0747823 0.0185535
+0.0025057 0.0688921 0.0558596
+-0.0804035 0.0745659 0.0220984
+-0.0604943 0.0804378 0.0430854
+0.0220864 0.122759 -0.00230579
+0.0416849 0.100037 0.02216
+-0.0387577 0.150948 -0.00516845
+0.0420841 0.090131 -0.00780186
+0.0270265 0.12251 0.0139387
+-0.0715501 0.0763344 0.0374538
+-0.0885696 0.137819 0.0397738
+0.00156461 0.124373 0.0333352
+-0.00526883 0.0355403 -0.0166416
+-0.0769711 0.133968 -0.00621304
+-0.0750334 0.0851031 -0.01456
+-0.00549741 0.0675328 0.0561955
+0.00134414 0.0524973 -0.030237
+-0.0573916 0.0718042 0.0398933
+0.0283911 0.0672932 0.0427559
+-0.0910025 0.133774 0.0232232
+-0.0354998 0.17123 0.000174393
+0.0458285 0.0801218 0.0204223
+-0.0574741 0.0819362 0.0441691
+0.0510603 0.0729911 0.0094016
+-0.0363492 0.0338444 -0.0305686
+-0.024023 0.17718 -0.0120308
+-0.0625429 0.143922 0.0377415
+0.0323895 0.0490788 -0.00667281
+0.00525838 0.123196 -0.010701
+-0.0294162 0.0890096 -0.030595
+0.0479414 0.0588591 -0.00500215
+0.0158474 0.128954 0.00837281
+0.0170299 0.0590745 0.0491032
+0.0534095 0.0553934 0.0278769
+-0.0600285 0.134031 -0.00683616
+-0.0595027 0.0876292 0.04502
+-0.0323351 0.172733 -0.00297212
+-0.0374903 0.172653 -0.000576721
+0.00749482 0.0546914 0.0525351
+0.0383894 0.0519545 -0.00670373
+-0.0331162 0.0436399 0.0481995
+0.0444193 0.0734774 0.000193217
+-0.0392699 0.127033 -0.00231305
+-0.0377966 0.0870844 -0.0227292
+0.0398005 0.0712586 0.0329247
+0.0227875 0.0348957 0.00078699
+-0.0825515 0.0748682 0.00752949
+-0.0162407 0.125507 -0.00287714
+-0.0654856 0.0398574 0.0313799
+-0.0623389 0.163139 -0.0325913
+-0.0686122 0.0432054 0.00454593
+-0.0379623 0.174733 -0.00453553
+-0.0563002 0.154681 0.0207165
+-0.0455391 0.0396225 -0.0172907
+0.033177 0.0592197 0.0390624
+-0.030845 0.0944191 -0.0240931
+0.0149304 0.0913967 0.05159
+-0.0283564 0.125587 0.00796681
+-0.0364861 0.0547872 0.0389196
+-0.0284285 0.0821494 0.0466355
+-0.0626767 0.0346583 0.0408688
+0.0226817 0.0618915 0.0467691
+-0.00273397 0.0346073 0.0449802
+-0.0747362 0.0663817 0.0145125
+-0.0135041 0.11966 0.0364252
+-0.0466771 0.0355018 -0.0172702
+-0.0711048 0.153963 -0.0459144
+-0.0910141 0.11449 0.034742
+-0.0801763 0.0854684 -0.0085384
+-0.0199842 0.183117 -0.0149159
+-0.0705018 0.155741 0.00837641
+-0.0229946 0.0381678 0.00700416
+-0.0428236 0.0913841 -0.0227682
+-0.0679787 0.154919 -0.0513588
+-0.0787367 0.168047 -0.0389551
+-0.0308479 0.0972408 -0.0233409
+-0.0127769 0.0784711 -0.0383296
+-0.0528408 0.0970645 -0.0221327
+0.0578361 0.0662412 0.00314493
+0.0132266 0.0822053 -0.0304726
+-0.058487 0.113928 0.0361856
+-0.0609416 0.0341022 0.0225725
+0.0498583 0.0540108 0.0297623
+-0.00985903 0.128582 0.0248602
+0.0180859 0.068641 0.0507282
+-0.0275932 0.0779206 0.0459339
+-0.0474983 0.11254 0.0358059
+-0.00306313 0.0346488 0.0430839
+-0.0494839 0.141682 0.00839735
+-0.0444006 0.0337168 -0.00238543
+0.0222885 0.0564166 0.0461469
+0.00464996 0.0378242 0.0256263
+0.00823548 0.113838 -0.0186606
+-0.0404969 0.0634536 0.0414219
+0.0464934 0.0638096 0.0291729
+-0.0275092 0.181505 -0.00874152
+-0.0850366 0.134888 0.000298852
+-0.053967 0.0687802 0.0379578
+0.0458863 0.0820184 0.0171704
+-0.0630174 0.113067 -0.0134471
+0.0163641 0.0348027 -0.00791773
+-0.0668226 0.0923514 -0.017257
+-0.073517 0.104058 0.0373151
+-0.0520334 0.0346252 0.0362685
+0.00147793 0.131501 0.00880182
+-0.0874177 0.131128 0.0459004
+-0.0124954 0.103038 0.0437348
+-0.0148129 0.0841518 -0.0390669
+-0.061937 0.111099 -0.0150221
+0.0286115 0.078186 0.0449305
+-0.0884601 0.0976543 0.0226015
+-0.0196643 0.111086 -0.0196461
+-0.0196772 0.178663 -0.0162873
+-0.0220478 0.0811409 0.0558034
+0.00850296 0.118331 -0.0155001
+-0.0404972 0.0506061 0.0393715
+-0.0833705 0.0767799 0.0142875
+-0.085765 0.112351 0.0286477
+0.0363022 0.0619082 0.0365841
+-0.000508059 0.0576316 0.0544767
+-0.089275 0.0969971 0.0184044
+-0.0708142 0.0694524 -0.00574088
+-0.0186131 0.0378854 -0.0277917
+0.0283679 0.103615 -0.0157324
+-0.0354292 0.0472715 0.0405203
+-0.0748611 0.163212 -0.0154286
+-0.0862421 0.14327 0.00816028
+0.0357067 0.0981492 -0.0118335
+0.0223181 0.0592817 -0.0260832
+-0.0625553 0.041701 -0.00649092
+-0.0824187 0.100645 0.0306028
+-0.0598691 0.101152 -0.0187591
+-0.0309758 0.0383278 -0.0168292
+0.0239145 0.0835849 0.0487444
+-0.00271812 0.0380275 0.0166967
+-0.00631097 0.0354995 -0.0168068
+-0.0435801 0.0491173 -0.010788
+-0.0586891 0.065984 -0.0090861
+-0.072851 0.148958 0.0401319
+0.0442902 0.0875035 0.0241471
+-0.0155441 0.165408 -0.0121335
+-0.084276 0.107651 0.0243439
+-0.0705376 0.04043 0.00377428
+-0.0107227 0.165105 -0.0188107
+-0.0550975 0.13533 0.0326236
+-0.0735773 0.0648576 0.0107478
+-0.0227215 0.0797443 0.0551012
+-0.0404988 0.043751 0.0418177
+-0.0507215 0.132501 0.0301542
+-0.0728912 0.11354 -0.00756484
+0.00242535 0.0343652 0.00462872
+-0.0556704 0.0335434 0.000932366
+0.00528142 0.0509933 -0.0292119
+0.0213389 0.0621093 -0.0262711
+-0.0275166 0.0348502 0.0465557
+-0.0826299 0.110259 0.0284001
+-0.00850001 0.125156 0.0314578
+-0.0707102 0.149836 -0.0414255
+0.0204972 0.107072 0.0404393
+-0.0215031 0.108553 0.041118
+-0.0404837 0.0818282 0.0429123
+-0.0586314 0.0580318 0.0162523
+-0.0648762 0.109524 -0.0137682
+-0.0687139 0.0394283 -0.00171366
+0.00150188 0.0938741 0.0550191
+0.027072 0.122359 0.0168201
+-0.0275307 0.0918372 0.0449329
+-0.00320104 0.131164 0.014241
+0.00886384 0.130684 0.0200808
+0.0402562 0.0857576 -0.0117696
+-0.0823675 0.147331 0.00217458
+-0.082659 0.0776741 0.0225196
+-0.0388763 0.107081 -0.0200218
+0.0151073 0.108635 -0.0180644
+0.0460054 0.0746307 0.0193568
+-0.0735009 0.117559 0.0527975
+-0.0337749 0.0338108 0.0177666
+0.032372 0.116958 0.0202394
+-0.0763319 0.15494 -0.00387485
+-0.0687774 0.0837142 -0.0175822
+-0.010498 0.0517545 0.0512545
+0.0210632 0.038679 -0.00769573
+0.0140028 0.091392 0.0520062
+-0.0842337 0.150005 0.032317
+0.0332536 0.0916169 0.0411931
+-0.0394897 0.0874644 0.0433271
+0.0207921 0.106393 -0.0166835
+-0.0368012 0.111669 -0.0181954
+-0.0495137 0.0503617 0.0366255
+-0.0314035 0.121359 0.0260922
+-0.0745094 0.140045 0.0479791
+-0.020484 0.0842242 0.0566713
+-0.00549585 0.0911858 0.0567127
+-0.0870672 0.0882048 0.024333
+-0.0377523 0.0783086 -0.0194038
+0.0407806 0.0717592 -0.0087638
+0.00365619 0.131646 0.00960837
+-0.0157548 0.0714554 -0.0386719
+0.0597099 0.0650292 0.0201784
+-0.0675187 0.0874976 0.0437834
+0.0405833 0.0670896 0.0305002
+-0.0180479 0.0418467 0.0526068
+-0.0427079 0.151894 -0.00649313
+-0.0220141 0.0388944 0.0538623
+0.00616925 0.0895403 -0.0330971
+-0.0064158 0.0391939 0.0347568
+0.0557201 0.0581302 0.0259556
+0.0563341 0.0711373 0.00671617
+-0.0727258 0.157431 -0.00265266
+0.0125423 0.120941 -0.012332
+0.00414764 0.103055 -0.021794
+-0.029166 0.0762862 0.0418904
+-0.0268469 0.0423164 0.0533212
+-0.0621198 0.0344764 0.0202314
+-0.0618524 0.169383 -0.0535961
+0.0250825 0.10872 0.0381638
+-0.0908254 0.142021 0.0251655
+-0.046283 0.129949 0.00285861
+0.0179105 0.0350278 -0.0116533
+-0.0397746 0.0826803 -0.0210594
+-0.0651763 0.16954 -0.0402745
+-0.0621336 0.16002 -0.0235787
+-0.0355709 0.168274 -0.000671324
+-0.037536 0.159586 0.00182669
+-0.0681305 0.148403 -0.0333773
+-0.0364875 0.100095 0.0421869
+0.0545857 0.0608947 0.0278753
+0.0195769 0.0347391 0.0223805
+-0.0765172 0.154938 0.0266851
+0.0329357 0.0710876 -0.0177809
+-0.0434945 0.111176 0.0370674
+-0.0144911 0.124164 0.030554
+-0.0644813 0.157544 -0.049277
+0.0162463 0.0722881 -0.029887
+0.0292794 0.111414 0.0337321
+-0.0730559 0.14548 -0.015959
+-0.032702 0.0694797 -0.021456
+-0.0682487 0.153053 0.0340661
+-0.0810659 0.143393 0.0434586
+-0.0508913 0.0474088 0.0186488
+-0.041491 0.0832013 0.0425516
+-0.0689521 0.151509 0.0368557
+0.00620362 0.0387395 0.045605
+-0.0437238 0.0739429 -0.018203
+-0.0589977 0.125247 -0.00779139
+0.0113495 0.0553023 -0.0296776
+-0.0665061 0.0972756 0.0420058
+0.00151221 0.0828796 0.0573767
+-0.000819486 0.131234 0.00795191
+0.0463579 0.0575632 -0.00556359
+-0.0223022 0.165377 -0.00961273
+0.0177451 0.0379283 0.0429098
+-0.0914397 0.143364 0.0211639
+-0.0366139 0.0493085 -0.0123994
+-0.0374871 0.0576725 0.0398228
+-0.0252778 0.0383536 -0.00088571
+-0.0593549 0.0410534 0.0179552
+-0.0667502 0.0337781 -0.00695475
+-0.0206534 0.0391059 0.0372895
+-0.0144184 0.0997913 0.0448499
+-0.0451841 0.16983 -0.00497124
+-0.017913 0.184413 -0.0239895
+-0.0265191 0.0388768 0.0380618
+-0.0908997 0.126938 0.0424248
+-0.000826517 0.0853922 -0.0362438
+-0.0534467 0.125409 -0.00644153
+-0.0368662 0.104233 -0.0205194
+-0.02728 0.181917 -0.0121056
+-0.0487731 0.0349958 0.0444688
+-0.0894993 0.135155 0.0302067
+0.0152294 0.0345961 -0.00794828
+-0.0135581 0.166929 -0.0145181
+-0.00316211 0.129199 -0.00103699
+0.0125106 0.108449 0.040622
+0.0494051 0.0734301 0.0147277
+-0.0427147 0.0710705 -0.0176966
+-0.0505553 0.136728 0.0232523
+-0.055076 0.154226 0.0167194
+-0.0598887 0.10828 -0.0169771
+-0.00348603 0.0489394 0.050606
+-0.0325038 0.107028 0.0393329
+-0.0558273 0.114722 -0.0152839
+-0.024429 0.062147 0.0418364
+0.0610039 0.0637491 0.0121545
+-0.0307981 0.0381678 0.00179566
+-0.0224893 0.0462052 0.0523041
+-0.0626699 0.13529 0.0374908
+-0.0871093 0.106357 0.0153576
+0.018535 0.0346925 0.0222104
+-0.0633642 0.142485 0.0383017
+0.0395752 0.0602985 0.0307005
+0.0196495 0.0356664 -0.00567711
+-0.00666974 0.0555272 -0.0330407
+-0.0554731 0.154191 0.0210182
+-0.00998984 0.177238 -0.0295136
+0.0366228 0.111865 0.00747742
+-0.00322809 0.0999661 -0.0238789
+0.00852647 0.0349744 0.0253569
+0.0337455 0.11169 -0.0043358
+-0.033869 0.10148 -0.022225
+0.0215013 0.108432 0.0393095
+0.027565 0.119234 0.026993
+-0.0477832 0.129154 -0.000397631
+-0.057288 0.0521607 0.00365094
+0.0119513 0.0873992 0.0542929
+0.0510679 0.0720267 0.021243
+-0.0525522 0.0487323 -0.0069784
+0.0419877 0.102851 0.0121565
+-0.0154922 0.126886 0.0243264
+-0.010476 0.0965182 0.0531854
+-0.0107078 0.0628117 -0.0359649
+-0.0848416 0.0858026 -0.00253503
+-0.0300028 0.125562 0.00590559
+-0.0137234 0.0643092 -0.0370705
+0.025242 0.0761745 -0.0249679
+-0.0268088 0.0852978 -0.0363495
+0.028746 0.0693043 -0.0217828
+-0.0525052 0.112524 0.0359139
+0.0608734 0.0637391 0.0151617
+-0.0820606 0.151973 0.00432386
+-0.065153 0.0712063 0.036955
+-0.0590564 0.0335255 0.00387291
+-0.0726667 0.0777379 -0.0132872
+-0.0639501 0.166025 -0.0326719
+0.033089 0.0892132 -0.0184699
+-0.0410037 0.148494 -0.000715623
+0.0152676 0.11708 -0.0141694
+-0.0405102 0.127658 -0.000961794
+0.0135046 0.108467 0.0407674
+-0.0598038 0.0341949 0.0280011
+-0.025416 0.0905129 0.0490114
+-0.0383992 0.0420226 0.0422608
+-0.0414999 0.0478558 0.040117
+-0.0525584 0.0501546 -0.00685551
+-0.0394783 0.0832832 0.0435432
+-0.0409872 0.0335947 -0.0218947
+-0.0234596 0.184384 -0.0119315
+-0.00549722 0.0633676 0.0561862
+-0.0249111 0.0958255 0.0441185
+-0.0794946 0.12171 0.0507273
+0.0218787 0.0430332 -0.0157248
+-0.0284679 0.0718578 -0.0335433
+-0.0287174 0.0344722 -0.0298467
+-0.0375646 0.0407082 -0.0285349
+-0.0684694 0.153743 0.0324784
+0.0275012 0.1187 -0.00304813
+-0.0654981 0.100096 0.041968
+-0.0728966 0.155445 -0.0329107
+-0.024103 0.171237 -0.0122056
+-0.0213641 0.0384977 0.0305062
+-0.00878734 0.0798675 -0.0379507
+-0.0034971 0.0703995 0.0574239
+-0.0628591 0.0679841 0.0349557
+-0.0205114 0.0512056 0.0456176
+-0.0215925 0.0364837 -0.0283556
+0.0308475 0.0751439 -0.0207339
+0.0345069 0.0483661 0.0310725
+0.00650269 0.044152 0.0457422
+-0.0404948 0.0733395 0.0422389
+0.00152573 0.0717149 0.0566366
+-0.00449638 0.110771 -0.0213478
+-0.0786622 0.0733343 0.0252726
+-0.00997021 0.129828 0.00744342
+-0.0368781 0.107107 -0.0201846
+0.0114979 0.112659 0.03891
+-0.0516419 0.126901 0.0340875
+-0.05391 0.13392 0.032587
+-0.0537085 0.0491368 0.0316573
+-0.086972 0.143283 0.00915353
+-0.0889751 0.0969295 0.00842099
+-0.0378902 0.121927 0.0281694
+-0.0870357 0.141902 0.00919077
+-0.056635 0.0350546 0.0452244
+-0.019816 0.0347801 0.0465131
+0.0392931 0.086096 0.0340337
+-0.0869334 0.0861006 0.0224549
+-0.0643967 0.0646443 0.0287462
+-0.0398612 0.101404 -0.0212384
+-0.0536876 0.0334698 -0.00403732
+-0.0785163 0.162478 -0.0269418
+-0.0638695 0.16329 -0.0240265
+-0.087202 0.10043 0.0240701
+-0.0736795 0.145791 -0.0128538
+0.0436314 0.0736519 0.026072
+-0.0326308 0.0352345 0.0485487
+-0.0158901 0.160985 -0.0130889
+0.0154243 0.0781303 0.053988
+0.00317805 0.0980649 -0.0258881
+-0.00360287 0.0419944 -0.0253901
+-0.0681856 0.169443 -0.0550153
+-0.0937199 0.12277 0.0132819
+-0.0335083 0.11115 0.0363293
+-0.0897769 0.0915868 0.0144438
+-0.00790609 0.0389527 -0.0109414
+-0.0512486 0.0474505 0.019655
+0.0299943 0.101654 -0.0156302
+-0.0688114 0.086573 -0.0173858
+-0.0425222 0.0435673 -0.0203211
+-0.0411345 0.037889 -0.0275181
+-0.0451234 0.0336213 -0.00611106
+-0.0513475 0.115214 -0.0158415
+-0.0135796 0.18457 -0.0255034
+0.0514482 0.0490026 0.000289284
+-0.0154766 0.160714 -0.011803
+-0.0871595 0.128427 0.0471391
+0.0253818 0.0487646 -0.0196147
+-0.0226623 0.0866242 0.0548392
+-0.00567144 0.0569411 -0.0332111
+0.046481 0.0764536 0.00918999
+0.0579995 0.0690441 0.020859
+-0.0371 0.126156 -0.00341777
+-0.073756 0.0716254 0.0312714
+-0.0320938 0.0457263 -0.0270587
+-0.0109396 0.165104 -0.0156606
+-0.088578 0.151544 0.0220955
+0.00637955 0.131641 0.0120332
+-0.00648723 0.114138 0.040862
+-0.058347 0.0335497 0.00759386
+0.00578775 0.0392649 0.0317966
+-0.0571091 0.140994 0.0314586
+-0.00487882 0.107372 -0.0225382
+-0.0806197 0.114932 0.047462
+-0.0334955 0.0874648 0.043047
+-0.0460993 0.132381 0.0175967
+-0.0638759 0.0334217 -0.000619218
+-0.0121322 0.038759 -0.00601251
+-0.0743637 0.153685 0.0319267
+-0.0445292 0.0547767 0.038815
+0.0265401 0.0686018 0.0436052
+0.0300756 0.0946988 -0.0182345
+-0.00649809 0.0703887 0.0571625
+-0.0574852 0.0861616 0.0444185
+-0.0204789 0.081458 0.0566556
+-0.045663 0.0367902 -0.0212772
+-0.0660163 0.156182 0.0230465
+0.0105014 0.112682 0.0391847
+-0.0863368 0.153207 0.0174967
+-0.0314199 0.0595176 -0.0174145
+-0.0903295 0.150229 0.0211233
+-0.0394972 0.0648803 0.0416583
+-0.0107858 0.0386823 0.0289151
+-0.0567014 0.0534733 -0.0003903
+-0.00348704 0.121028 0.0369539
+0.0367923 0.0967547 0.0340658
+-0.0206904 0.0538665 -0.0309758
+0.0171483 0.0535046 0.047456
+-0.052342 0.035529 0.0457534
+-0.0350351 0.0408695 0.0473482
+-0.0364795 0.0519621 0.0386972
+0.0339284 0.0669478 -0.0167571
+-0.0277715 0.0852268 -0.0356683
+0.00655622 0.121628 -0.0130526
+-0.0586532 0.0645395 -0.00761311
+-0.0582249 0.0344034 0.0351394
+-0.00633129 0.0388612 -0.00122239
+-0.0669198 0.113752 -0.0107887
+-0.0667337 0.0374088 0.0337222
+-0.00249774 0.0520145 0.0539036
+-0.0450377 0.0345968 0.0325315
+0.0242293 0.119847 -0.00515511
+-0.0932424 0.12021 0.0392849
+-0.0535442 0.129727 0.0348674
+-0.00517846 0.0367339 0.04845
+-0.0734548 0.0752713 0.0352251
+-0.0687371 0.155896 0.0104629
+-0.0471614 0.0336254 -0.00103179
+-0.00441737 0.117961 -0.0150091
+-0.0238639 0.0825121 0.0547585
+-0.0132802 0.102485 0.0435875
+-0.0649278 0.105334 -0.0156241
+0.0286778 0.116188 -0.00517917
+-0.0236663 0.0381653 0.00868472
+-0.0645999 0.0432992 0.0347148
+-0.0856886 0.0926246 -0.00156242
+-0.0835056 0.0777286 0.0204901
+0.0321567 0.107734 -0.010124
+-0.0895151 0.151559 0.0181181
+0.0110134 0.130158 0.00376449
+-0.0202842 0.16977 -0.0137262
+-0.00591514 0.12799 -0.00376372
+0.0143906 0.0373653 -0.0212799
+-0.0719296 0.11219 -0.00889601
+-0.0157228 0.0642918 -0.0372774
+0.0269219 0.115924 -0.00692402
+-0.0665225 0.0435914 0.00948645
+-0.0747288 0.102175 0.0369848
+0.0207343 0.120306 -0.00765281
+-0.0240392 0.0380418 0.0177619
+-0.0806691 0.107746 0.0299304
+0.0541727 0.0734662 0.0150335
+-0.0828869 0.0763004 0.0145215
+-0.0490771 0.154645 -0.00592496
+0.0211784 0.0973838 -0.0221644
+-0.0576844 0.0467193 0.0286753
+0.00985328 0.0602892 0.0527986
+0.0232608 0.0748451 -0.0261321
+-0.0524982 0.0862336 0.045539
+-0.0783198 0.147274 -0.0028373
+0.0082875 0.114937 -0.017843
+0.018445 0.0456517 -0.0226728
+-0.0239275 0.1816 -0.0100979
+-0.040758 0.0797297 -0.0196637
+-0.0485257 0.121087 0.0297472
+-0.0345208 0.0633716 0.0403553
+-0.00118398 0.0362533 0.0473478
+0.000189104 0.0867348 -0.0351526
+0.0231695 0.0520348 0.0420858
+-0.0324783 0.0337381 0.0144953
+-0.0597681 0.0334439 0.00560092
+0.0177557 0.0344112 0.00209212
+0.0159863 0.0860656 0.0513294
+-0.0393291 0.127134 0.01721
+-0.0628998 0.1209 -0.00884208
+0.04086 0.101423 0.0231764
+-0.0146702 0.122522 -0.00773793
+-0.0292113 0.156649 -0.000270817
+-0.0415254 0.172553 -0.00373349
+-0.0365135 0.084703 0.0437856
+-0.0208969 0.0381794 0.0236923
+0.011579 0.120136 -0.0134617
+-0.0347516 0.0383809 -0.00467189
+-0.0166266 0.172732 -0.0172138
+-0.0531086 0.126902 0.0355005
+-0.0154789 0.0347707 0.0439361
+-0.0110657 0.112343 -0.0190003
+0.0286979 0.0806527 -0.0216026
+-0.00681305 0.0345833 0.0441587
+-0.0245442 0.0708437 0.0459353
+-0.0613991 0.0718897 0.0389316
+-0.0682443 0.179461 -0.0589214
+-0.00573885 0.0698843 -0.0361103
+-0.0875967 0.100907 0.00640641
+0.0169866 0.0348952 0.0343866
+0.0228667 0.0444458 -0.0147763
+-0.0536029 0.162357 0.00297376
+-0.0723862 0.156822 -0.0359122
+0.000140075 0.103071 -0.0225088
+-0.0543692 0.0334679 -0.00234676
+-0.0771859 0.109877 -0.00559641
+-0.0922148 0.11614 0.0373108
+0.00616718 0.124896 -0.00854967
+-0.00125449 0.12189 -0.0112382
+0.0349132 0.114353 0.0126105
+-0.0534959 0.107052 0.0398334
+0.0553645 0.0492819 0.0192078
+0.0496613 0.0501912 -0.00270335
+-0.0917143 0.128313 0.0332436
+0.00552678 0.0619607 0.0559576
+-0.0252475 0.0736694 0.0465167
+-0.0656879 0.156227 0.015899
+0.0167178 0.128574 0.00869666
+-0.0616277 0.154191 0.00244865
+-0.0845352 0.136246 0.000324782
+-0.0835033 0.0804619 0.0265017
+-0.0380583 0.154792 -0.00920218
+-0.0683549 0.0382578 0.0114352
+-0.0713665 0.156324 0.018248
+0.0326986 0.0781958 0.0420379
+-0.0267044 0.158758 -0.0121466
+0.0274612 0.0417732 0.0323464
+-0.00748374 0.116886 0.0393445
+-0.0618946 0.0333508 -0.00558837
+-0.022958 0.166842 -0.0105567
+0.000373363 0.0349968 0.00734292
+-0.0437553 0.033642 0.00144997
+0.0267259 0.120866 0.0252428
+-0.0859248 0.0832079 0.00547822
+-0.00269975 0.109146 -0.0216168
+0.055733 0.052157 0.00319809
+-0.0704697 0.181218 -0.0537747
+0.00698645 0.0818884 0.0558396
+0.0424628 0.0943961 -0.00280162
+-0.0560128 0.0334549 0.00994988
+-0.000497737 0.11557 0.0407823
+0.0115122 0.104463 0.0449641
+0.0113328 0.124014 0.0325236
+-0.0257103 0.0983522 -0.0242349
+0.0385114 0.038461 0.00447642
+0.0274866 0.0994982 0.0416519
+-0.0205044 0.11679 0.0360351
+-0.0287307 0.0748955 0.0414817
+0.021677 0.0354914 0.00935068
+-0.0604978 0.109778 0.0376942
+0.0349482 0.114159 0.0154869
+-0.0891171 0.11284 0.0400327
+-0.0525174 0.133925 0.0310668
+-0.0467675 0.0811826 -0.0202513
+0.0148515 0.129255 0.0180171
+0.0134018 0.0418881 -0.0236384
+-0.0196836 0.0524593 -0.0309769
+-0.0907522 0.136478 0.0191999
+-0.0282073 0.178522 -0.0159874
+-0.0456817 0.146626 -0.00135754
+-0.0234782 0.174205 -0.0130294
+0.0157394 0.128861 0.0183169
+-0.049553 0.0432181 -0.0104928
+-0.0364431 0.0379518 -0.0296736
+-0.0342528 0.161016 -0.000502552
+-0.0106993 0.061373 -0.0355475
+0.0155546 0.034804 0.0269401
+0.0445305 0.0664178 0.0264316
+-0.0692603 0.166617 -0.0519986
+0.00900275 0.0343116 -0.0200681
+-0.0789639 0.13393 -0.00512141
+0.0183835 0.0490953 -0.0235496
+-0.0211568 0.177178 -0.0149257
+-0.0459855 0.0341655 0.0291843
+0.0234635 0.12256 0.0268857
+-0.0437241 0.0724973 -0.0179849
+-0.0492665 0.143175 0.00640774
+0.0310235 0.0363382 0.00298341
+-0.0703389 0.0353326 0.0107638
+-0.0505002 0.0762293 0.0432414
+-0.0641035 0.141307 -0.00745692
+-0.0474934 0.115292 0.0331905
+-0.050108 0.144746 0.0113816
+0.0325029 0.117364 0.00744623
+-0.0183192 0.124686 -0.00393431
+-0.00150748 0.059016 0.0544507
+-0.0104895 0.115533 0.0397944
+-0.023487 0.0435372 0.0536017
+-0.0655471 0.154522 0.00288522
+-0.0675989 0.156142 0.0239498
+-0.03165 0.0339865 0.0180432
+-0.0447604 0.0336698 -0.00424497
+-0.0348481 0.110331 -0.0188
+-0.0114927 0.0938853 0.0554733
+-0.0700706 0.155642 0.00707306
+0.0444883 0.05975 0.0312137
+-0.0788477 0.0773102 0.0306071
+-0.0712203 0.0706743 0.0326242
+0.00153616 0.078717 0.0572683
+-0.0243177 0.0607418 0.04177
+0.0445696 0.0677675 0.0254424
+0.0516179 0.0503639 -0.000756444
+-0.0610049 0.129668 -0.00770337
+-0.0731244 0.174613 -0.0403365
+-0.021137 0.166765 -0.0184531
+-0.068723 0.163208 -0.0142948
+-0.0415011 0.0676725 0.0415782
+-0.0829782 0.147345 0.00316952
+-0.056007 0.145723 -0.001571
+-0.023276 0.0768174 0.0529315
+-0.0303597 0.158405 -0.0122944
+-0.0594923 0.107014 0.0396564
+-0.0680504 0.156343 0.0223236
+-0.050518 0.054445 0.0327051
+-0.0324286 0.126663 0.0108668
+-0.0629263 0.108221 -0.0156274
+-0.0283572 0.0862879 0.0464179
+0.0304249 0.0399897 -0.00292852
+-0.0820851 0.106006 0.028693
+-0.081432 0.0776141 0.0263044
+0.0121657 0.0990535 -0.0228743
+-0.0148931 0.161809 -0.0143393
+0.0322568 0.0814321 -0.0193234
+-0.0249634 0.0631201 -0.0324542
+-0.0844782 0.152284 0.0269844
+-0.0284889 0.100156 0.0431683
+0.0335187 0.113275 -0.00203325
+0.0243141 0.0347256 0.0105738
+-0.0189924 0.127884 0.0157415
+-0.0555 0.0488797 0.0362241
+-0.0675079 0.104205 0.0395869
+-0.0181173 0.0384288 0.000495732
+-0.0138101 0.0841459 -0.0389466
+-0.0343542 0.0367977 0.0484644
+0.0170352 0.0393356 0.0436644
+-0.0255828 0.0620727 0.0401653
+0.0012257 0.0797035 -0.0352779
+-0.0033226 0.122983 -0.0103909
+0.0377895 0.0954381 0.0337234
+-0.0779478 0.107702 0.034147
+0.0309974 0.0673207 0.0412553
+0.0125192 0.0833344 0.053329
+-0.0569108 0.0471914 0.0407265
+-0.0765896 0.172837 -0.038783
+-0.0243798 0.168291 -0.0108587
+-0.0849208 0.114388 0.046865
+0.0270076 0.100021 -0.0178938
+-0.00936568 0.0388306 -0.00738531
+0.0124903 0.101789 0.047403
+0.0153634 0.050802 -0.0265798
+-0.051492 0.107057 0.0393982
+0.00022872 0.0769217 -0.0357549
+-0.073138 0.156184 0.0161734
+-0.0171943 0.171219 -0.0224352
+0.0282636 0.073195 -0.0229429
+-0.0554943 0.112513 0.0359102
+0.0268698 0.0448976 0.0368034
+-0.0567448 0.0548796 0.00465654
+0.00393342 0.0340406 0.014385
+-0.0269434 0.0864227 0.0492292
+-0.050859 0.0487888 0.015667
+-0.0524919 0.0762203 0.042799
+-0.025733 0.0751362 0.0469781
+-0.0870453 0.0846718 0.00449266
+-0.0765303 0.0961207 -0.0124976
+0.0303449 0.112749 0.0317399
+-0.070531 0.151779 -0.0453729
+0.0534729 0.0645627 -0.000631784
+0.0104112 0.0375138 -0.0230668
+0.0592863 0.0552837 0.0131736
+0.00525297 0.069736 -0.0335357
+0.0167263 0.0350159 0.0378322
+-0.0679113 0.0395796 0.0109828
+0.013918 0.129208 0.0205036
+-0.079478 0.142827 0.0451049
+-0.0708238 0.0631793 0.00551684
+-0.0687786 0.16979 -0.0301319
+-0.0187811 0.119777 -0.0107944
+0.021663 0.053586 0.0452157
+0.015783 0.0914175 0.0510677
+0.0258521 0.119872 -0.00319504
+-0.0172292 0.104564 -0.022745
+-0.0618136 0.0453397 -0.00172473
+0.0207685 0.0449736 0.0420523
+-0.0231964 0.0651165 0.0447582
+-0.0305175 0.0847809 -0.0315638
+-0.0658758 0.122838 0.0504663
+-0.0148324 0.107132 -0.0214612
+0.0460436 0.0778241 0.00519064
+0.00396334 0.0346642 0.000955872
+-0.000496537 0.0675633 0.0565514
+0.0342214 0.0813611 -0.0182381
+-0.0464961 0.0464761 0.0407845
+0.0547176 0.0680176 0.00187225
+-0.0580682 0.132534 -0.0063879
+0.0331199 0.0754691 0.0408773
+0.0401875 0.102783 0.0241636
+-0.0783656 0.151459 -0.000884796
+0.0238113 0.0754906 0.0485213
+0.0164183 0.0726599 0.0518741
+-0.0674097 0.173701 -0.0580011
+-0.0179511 0.175707 -0.0173471
+-0.0334973 0.0859864 0.0423406
+-0.0416172 0.17268 -0.00599082
+-0.0883846 0.119913 0.00130167
+-0.0154061 0.185475 -0.025609
+0.0464852 0.0429053 0.00427528
+0.0545912 0.0717149 0.021096
+-0.0661916 0.0334877 0.00245273
+-0.0495852 0.124005 0.0317323
+-0.0537144 0.0491343 0.0296614
+-0.0818927 0.122139 -0.0045131
+-0.0718108 0.0955414 0.0413269
+0.0221671 0.0444704 -0.016762
+-0.0798314 0.0733447 0.0205614
+0.0166594 0.125691 0.027245
+-0.0892473 0.0888575 0.0104669
+0.00551166 0.0504095 0.0521406
+-0.0627982 0.16724 -0.0607839
+-0.0646154 0.0457888 0.00269728
+-0.0485702 0.047508 -0.00937813
+0.026502 0.121591 0.0237374
+-0.0353601 0.152626 -0.00619729
+0.0403422 0.10564 0.0161674
+-0.0615416 0.034204 0.0241166
+0.0380593 0.0869714 -0.0147288
+0.0319925 0.114417 -0.00326976
+-0.0267368 0.0385445 0.0329521
+-0.0618964 0.108239 -0.0162152
+-0.063845 0.150027 0.0371387
+-0.0739579 0.155489 -0.0249104
+-0.0709691 0.153934 -0.0469289
+0.0249948 0.0405751 0.0353079
+-0.0304784 0.0381297 0.00370653
+-0.0247632 0.0741431 -0.0374571
+-0.0216593 0.0509046 -0.0292926
+-0.0446505 0.0592548 -0.0123035
+-0.0410267 0.172571 -0.00282243
+-0.060985 0.168641 -0.0594898
+0.0260213 0.111246 -0.0119
+-0.0224982 0.103036 0.0436276
+-0.0720537 0.0640001 0.00639175
+-0.08755 0.12805 0.000278104
+-0.0790371 0.0873264 0.0361062
+-0.055031 0.152471 0.0270238
+0.0537262 0.0622241 0.0283948
+0.0248385 0.107021 -0.0153684
+-0.0817292 0.154617 0.0205129
+-0.0776054 0.0804635 0.0348861
+-0.0644463 0.0769092 0.0410862
+-0.0737119 0.082093 -0.0148287
+-0.0782342 0.0694181 0.011104
+-0.0678631 0.0335656 -0.00155997
+-0.0771555 0.15282 -0.00488816
+0.028309 0.049176 0.0371723
+0.0122273 0.0342048 -0.000691958
+-0.0643947 0.15704 -0.046105
+-0.0276636 0.0522618 0.0383069
+-0.0587411 0.154535 0.0270999
+0.0275645 0.122014 0.00844231
+-0.0465457 0.0337901 0.0276252
+-0.0853906 0.110991 0.0352247
+-0.0338206 0.0367327 0.0490996
+-0.0145535 0.06115 0.0532234
+0.0367927 0.111755 0.0132988
+0.0458177 0.0820138 0.0181729
+-0.0444555 0.121377 -0.0123561
+0.0224202 0.0430392 -0.0127301
+0.0158478 0.102035 -0.022
+-0.0100884 0.0347013 0.0469069
+0.0374928 0.0498822 0.031843
+0.0351777 0.0559301 -0.00964394
+-0.00946358 0.169654 -0.0207426
+-0.0656264 0.15567 -0.0512009
+-0.0254805 0.0434932 0.0531599
+-0.0270955 0.0576776 -0.0274029
+-0.0228583 0.0350556 -0.0196661
+-0.0139903 0.169817 -0.0169155
+0.0176377 0.0348968 0.0272836
+-0.0144859 0.107222 0.0429439
+-0.0291189 0.15522 -0.00190906
+-0.0411739 0.165162 -0.0113688
+-0.0123514 0.0384213 0.00530714
+-0.0527141 0.141625 0.0234145
+-0.0612038 0.154834 0.027675
+-0.0338487 0.098628 -0.022813
+-0.000859642 0.105926 -0.0219248
+-0.0203431 0.186558 -0.0166005
+-0.01883 0.0882728 -0.037792
+-0.0635094 0.0987058 0.0422669
+-0.000483407 0.0787781 0.0579546
+-0.0700187 0.074071 0.0369567
+-0.0201986 0.186115 -0.0151371
+0.00141145 0.0376391 -0.024717
+0.0439647 0.0888964 0.0241631
+-0.0774025 0.100791 0.0354679
+-0.078513 0.145668 0.0427459
+0.0241305 0.0618675 0.0453428
+0.0109129 0.0833325 0.0545132
+-0.0798758 0.117757 -0.00451351
+0.0302928 0.119677 0.0137476
+0.0354021 0.0399255 -0.00156043
+-0.0489211 0.0687544 0.0390214
+-0.0493842 0.0558982 0.0343669
+-0.0524939 0.0776533 0.0431774
+-0.00761105 0.112944 -0.01965
+-0.0631004 0.038056 0.0429096
+-0.078061 0.117721 0.0511362
+-0.0228935 0.0375359 -0.0182249
+0.0168546 0.104974 -0.0191686
+-0.062493 0.0385506 -0.00796777
+-0.0814183 0.138999 -0.00180871
+-0.0585811 0.0344322 0.0332983
+-0.0299241 0.172727 -0.00652243
+0.0112861 0.130316 0.0195341
+-0.0325036 0.10978 0.0375732
+-0.0826224 0.141799 0.00118353
+-0.0805022 0.0831735 0.0334637
+0.0122352 0.0808526 -0.0312408
+-0.0771876 0.0907032 -0.0125611
+-0.0140608 0.038299 0.0231793
+-0.0386607 0.116212 -0.0149511
+-0.0276455 0.0376114 0.0210157
+-0.0832306 0.0871025 0.0304136
+-0.0334887 0.0471143 -0.0243565
+-0.0400971 0.153595 0.0050429
+-0.0647302 0.154215 -0.0408208
+-0.0194396 0.0527865 0.0471813
+-0.0665534 0.156088 0.0243177
+0.00850109 0.107119 0.0411949
+-0.0740753 0.174982 -0.0510829
+-0.0131928 0.11434 -0.0171133
+-0.00874908 0.0742103 -0.037697
+0.00967799 0.130572 0.00468392
+0.0318663 0.0862689 0.0426688
+0.0197994 0.0399634 -0.0167042
+0.0141672 0.0347073 0.00296826
+-0.0334912 0.0604137 0.038899
+-0.010802 0.0812949 -0.0382665
+-0.0626127 0.0339199 -0.00909656
+-0.0225179 0.0594554 0.0442529
+-0.0744235 0.152695 -0.0268913
+-0.0148262 0.181632 -0.021586
+-0.0501691 0.0348773 0.00986405
+0.0104481 0.102845 -0.020901
+-0.0127527 0.177163 -0.0221029
+0.008145 0.103004 -0.0207662
+-0.0548867 0.101301 -0.0205491
+-0.0772028 0.162464 -0.0309387
+0.0379552 0.0588939 -0.00773658
+-0.0134957 0.0925258 0.0558596
+0.0248886 0.0970269 -0.0206985
+-0.0393214 0.0342416 -0.0147308
+-0.0458838 0.129671 0.00293555
+-0.0574217 0.135337 0.0345321
+-0.0820284 0.13533 -0.00235647
+0.038582 0.0659177 0.034606
+-0.0494896 0.157875 0.00921755
+-0.0225598 0.125982 0.00280455
+0.0216881 0.102085 -0.0200779
+-0.0136509 0.0496769 -0.0312069
+-0.0615955 0.15529 0.0260796
+-0.0115193 0.0773584 0.0574493
+0.0404486 0.0745397 -0.00879543
+-0.057886 0.0969698 -0.0206731
+-0.0109392 0.038438 0.0236915
+-0.0148475 0.162865 -0.0159421
+-0.0183748 0.0353493 0.0515278
+0.029169 0.114081 0.0318014
+0.0232083 0.0449556 0.0403488
+-0.0234883 0.122057 0.0276339
+0.0359605 0.0936242 -0.0130764
+-0.0175335 0.0392471 0.0378093
+-0.0308588 0.171231 -0.00613945
+0.0247031 0.0463341 0.0389677
+-0.0925247 0.128292 0.0282327
+-0.0665656 0.122847 0.0512252
+0.0584586 0.0607609 0.022909
+-0.00884754 0.115581 -0.0164541
+-0.00309453 0.0984522 0.0515066
+0.0115015 0.119616 0.0358941
+-0.0494977 0.0903933 0.0446494
+-0.0126691 0.0348865 0.0479592
+-0.0149576 0.0897382 -0.0373658
+-0.0152002 0.174208 -0.0254562
+-0.0756281 0.167353 -0.024657
+-0.0627225 0.0402195 0.0247088
+-0.058955 0.151077 0.0341866
+-0.00932165 0.17502 -0.028678
+-0.0123491 0.183911 -0.0264322
+-0.0896074 0.135171 0.0322127
+-0.0426789 0.168728 0.0023488
+-0.0748775 0.0739125 0.0325733
+0.03891 0.10882 0.00971935
+-0.0633729 0.0431313 0.0286681
+-0.0551792 0.0336096 0.018904
+0.0268834 0.0875842 0.0460207
+-0.0168782 0.0351038 0.0503404
+-0.00549453 0.0590678 0.0548923
+-0.0286315 0.0383676 -0.00896928
+-0.0332631 0.177035 -0.011981
+-0.0748045 0.167943 -0.0420608
+-0.0851109 0.0939488 -0.00257672
+0.00096833 0.121103 -0.0124156
+-0.0558825 0.0465312 0.026676
+0.00712802 0.0975509 -0.0252935
+-0.00450103 0.0746726 0.0587526
+-0.0754962 0.141423 0.0471972
+-0.0514204 0.0548853 0.0209522
+-0.0107189 0.0642451 -0.0362023
+0.0428473 0.0944698 0.0251639
+0.0161732 0.12869 0.00706423
+0.0172673 0.128465 0.0103258
+-0.0624218 0.113827 0.0376933
+-0.0694289 0.039567 0.00968578
+-0.00956353 0.172645 -0.0227849
+-0.036529 0.0344176 0.0112583
+0.00747563 0.0378784 -0.00876072
+-0.0105064 0.0884021 0.0567868
+-0.0306153 0.0495713 -0.0203608
+-0.0832173 0.13898 0.000315163
+-0.00610064 0.0339097 -0.0209348
+-0.0081869 0.0386049 0.00598379
+0.0213573 0.057915 -0.0266602
+0.0391712 0.0402919 0.0231925
+-0.0346283 0.0533938 -0.0102529
+-0.00324688 0.0367886 -0.0155194
+-0.0734226 0.0711647 -0.00664488
+-0.0628413 0.144409 -0.0076345
+-0.0258745 0.104437 -0.023108
+-0.0100477 0.178214 -0.0295899
+-0.0839857 0.132609 0.0495198
+-0.0498484 0.121182 -0.0121
+0.0108333 0.130856 0.0150885
+-0.0104958 0.0939039 0.0555039
+-0.0863431 0.112514 0.0302243
+0.0475429 0.0429463 0.00623912
+-0.0334893 0.050539 0.0382432
+-0.0209099 0.158178 -0.00579641
+0.011514 0.10312 0.0464311
+0.0350456 0.0627954 -0.0138277
+-0.0161876 0.171234 -0.0230543
+-0.0268555 0.0987274 -0.0239779
+0.0118541 0.0404814 0.0449158
+-0.0104973 0.0856567 0.0572952
+0.0271955 0.0520724 0.0391174
+0.00248489 0.105788 0.0426651
+-0.0037871 0.0812341 -0.0371832
+-0.0231675 0.184436 -0.0160624
+-0.0612844 0.044277 0.027687
+0.0239731 0.061977 -0.0246362
+-0.00946933 0.0932363 -0.0348935
+-0.0178949 0.0971863 0.0483787
+-0.00196639 0.0392296 -0.0118812
+-0.0067485 0.0755804 -0.0372256
+-0.00967937 0.0555867 -0.0337759
+0.000980617 0.120181 -0.0134191
+-0.0806495 0.10968 0.039129
+0.0358807 0.0812282 -0.0166923
+0.0146499 0.0699433 0.0528108
+-0.034478 0.0590226 0.0391844
+0.0203856 0.0348183 -0.00149748
+0.0142674 0.0709686 -0.0310685
+-0.0334971 0.119329 0.0299275
+-0.0341948 0.0435484 0.0464376
+-0.00450247 0.056202 0.0539356
+-0.0721189 0.15515 0.0282101
+-0.000346509 0.12561 -0.00723663
+-0.0756644 0.0774182 -0.00947264
+0.014908 0.106309 -0.0185911
+0.0267515 0.102116 0.0406018
+-0.0626019 0.174089 -0.0546038
+-0.0574874 0.0805202 0.0440851
+-0.0609158 0.169795 -0.0608698
+0.0438296 0.0973504 0.015162
+-0.072512 0.104082 0.0376881
+0.0359801 0.0821479 0.0380155
+-0.0573808 0.129734 0.0381066
+-0.0236825 0.0566574 -0.0305632
+-0.0351787 0.0336265 -0.0226404
+-0.0257826 0.0783385 -0.0372231
+-0.0733446 0.159645 -0.0339252
+-0.024717 0.169741 -0.0113487
+-0.0597904 0.0825229 -0.0201763
+-0.0638365 0.0996097 -0.0175199
+-0.0897172 0.118919 0.0457459
+0.00851027 0.105753 0.0425683
+-0.0857293 0.121702 0.0488414
+-0.00654714 0.043 0.0484741
+-0.0524991 0.109798 0.0378325
+0.0089719 0.130372 0.00300057
+-0.0912936 0.114724 0.0218532
+-0.0758153 0.155373 0.0254598
+0.0443256 0.0931523 0.0201621
+-0.00159763 0.0391157 -0.0252097
+0.0358716 0.112393 0.0201061
+-0.0582724 0.0345955 0.0435663
+0.0444341 0.0861163 0.024155
+-0.0798668 0.12036 0.0500614
+-0.0486801 0.12235 -0.0113455
+0.044671 0.0931702 0.0171607
+-0.0867731 0.0820034 0.0144903
+-0.0444986 0.0465011 0.0409291
+-0.0132439 0.178631 -0.0284206
+-0.0014976 0.0856652 0.0573264
+-0.0555627 0.0351736 0.0453577
+-0.0757755 0.0948358 -0.0134771
+0.0116939 0.0459283 0.0447695
+-0.0334941 0.0690232 0.0409338
+-0.0717098 0.161007 -0.0419418
+-0.0620707 0.163126 -0.0385937
+0.0188526 0.103753 -0.0198618
+-0.0699102 0.14965 -0.0409667
+-0.0405063 0.0902417 0.0426463
+-0.071716 0.148756 -0.0367532
+-0.0218007 0.0637891 0.0462553
+0.0567259 0.0536428 0.00417778
+-0.0893948 0.09291 0.012442
+-0.0603715 0.133894 0.0372893
+0.0314991 0.054058 -0.0137198
+0.0203015 0.126964 0.0128708
+-0.0845068 0.120355 0.0490624
+-0.0624258 0.0342984 0.0291094
+-0.0395093 0.0930879 0.0428865
+-0.0277909 0.0380629 0.00793761
+0.0321502 0.106752 -0.0110706
+0.0298444 0.106115 0.0363002
+-0.054857 0.0970227 -0.0215362
+-0.0397671 0.127634 -0.000654541
+-0.0249592 0.0767123 0.050372
+-0.0265277 0.10717 0.0404632
+-0.0283702 0.0535742 -0.0233936
+0.00450189 0.050474 0.0524519
+0.00174762 0.0944417 -0.0320379
+-0.0810711 0.076096 -0.000474637
+0.0169426 0.11422 -0.015094
+-0.0380634 0.127686 0.00145512
+-0.0320932 0.0877303 -0.0254981
+-0.0569735 0.056267 0.00463231
+-0.0692551 0.175557 -0.0461164
+-0.0461819 0.130936 0.0220239
+0.0424151 0.101486 0.0141591
+-0.0816004 0.110405 0.0418977
+-0.0486814 0.0634873 -0.0123857
+-0.0354984 0.0491504 0.038916
+0.0232288 0.125257 0.0153837
+0.0251982 0.123641 0.0075622
+-0.0357278 0.07254 -0.0181295
+0.0451439 0.0802684 0.0230283
+-0.00649644 0.0605343 0.0557379
+-0.0697973 0.159564 -0.0489352
+-0.037469 0.120514 -0.011464
+-0.0869577 0.133848 0.0453706
+0.0185257 0.0352322 0.0362088
+-0.0206549 0.0768238 0.0545752
+0.0458945 0.0764062 0.00420006
+-0.0137194 0.091107 -0.0367438
+-0.0375014 0.106979 0.038117
+-0.0446156 0.0437685 -0.0132939
+-0.064545 0.156137 -0.0442784
+0.0275233 0.0621538 -0.0218174
+-0.0642285 0.0429095 -0.00424321
+-0.00460043 0.0434181 -0.0258683
+-0.0778454 0.158312 -0.0179205
+0.00252706 0.0800582 0.0567791
+0.0174798 0.0919971 -0.0254067
+-0.08982 0.133788 0.032216
+0.0343452 0.114918 0.0052408
+-0.0630651 0.167844 -0.0445874
+0.0164152 0.127597 0.00146207
+-0.0755176 0.120378 0.0530566
+-0.00615627 0.0994928 -0.025355
+-0.0501125 0.157587 -0.00554245
+-0.0332242 0.152554 -0.00262082
+0.0104732 0.0962984 0.0498872
+-0.0184975 0.111326 0.0402128
+-0.0228147 0.0826618 -0.0384205
+0.025553 0.0822419 0.0475803
+-0.0841632 0.11158 0.00227497
+-0.0198477 0.126879 0.00378288
+-0.069852 0.0951674 -0.0161643
+-0.0306901 0.0678681 -0.026462
+0.0155988 0.0699697 0.0524229
+-0.0167333 0.0642714 -0.0369951
+-0.0167796 0.121583 -0.00869919
+-0.0594953 0.0747194 0.0418121
+-0.0630515 0.152177 -0.00858675
+-0.0111714 0.129564 0.00700207
+-0.0890821 0.101017 0.0143926
+-0.0145147 0.116898 0.0378441
+-0.0462973 0.0368721 -0.0182757
+0.0251418 0.056415 0.0432482
+-0.0114906 0.0532044 0.051601
+-0.0514985 0.0931716 0.0440238
+-0.0536498 0.152894 0.0173581
+-0.0226294 0.157855 -0.00422736
+-0.0723402 0.0380689 0.00697334
+-0.0100211 0.0383173 0.0131334
+-0.0469913 0.0345734 0.0373898
+0.0117235 0.127254 -0.00315056
+0.0163555 0.0343012 4.3653e-05
+-0.000810177 0.084021 -0.0366442
+-0.0417008 0.153622 0.00625938
+-0.0695833 0.156717 -0.0509483
+-0.00967078 0.0541668 -0.0336446
+-0.0862734 0.13657 0.044609
+0.0363518 0.0562159 0.0330449
+-0.0528028 0.0666303 0.0365007
+0.0263615 0.0352587 0.00303932
+0.00111992 0.10872 -0.0203906
+0.00958242 0.0350342 0.0036093
+-0.0639107 0.108163 -0.0148371
+-0.00462988 0.0451748 -0.0282624
+0.00356053 0.130245 0.0239041
+-0.0428482 0.128274 0.00047704
+-0.0896015 0.136498 0.0242003
+-0.011119 0.163582 -0.018751
+-0.0521911 0.0531856 0.0256383
+0.02777 0.0808734 0.0454779
+0.0197898 0.0754906 0.0515075
+-0.0405912 0.0404909 -0.0262976
+-0.0184208 0.185917 -0.0222223
+-0.0738815 0.117926 -0.00764413
+0.0124741 0.0346639 0.0372734
+-0.057552 0.0336321 0.0166122
+0.0220421 0.0848959 0.0495666
+0.0184956 0.0962193 0.0472822
+-0.0577255 0.0578321 0.0166151
+0.00647696 0.11413 0.0402504
+-0.073854 0.100736 -0.0128364
+-0.0528758 0.0985097 -0.0219976
+0.0185485 0.111232 -0.0158588
+0.0257216 0.0672521 0.0441644
+-0.000523566 0.0428273 0.0465064
+-0.0354915 0.050532 0.0385401
+-0.0294972 0.0602632 0.0372614
+0.00410653 0.111609 -0.0202712
+0.0583904 0.0706508 0.00920486
+-0.0644959 0.084745 0.0443622
+-0.0182219 0.0954777 -0.0312615
+0.0163111 0.0608546 -0.0282401
+-0.0725001 0.120391 0.0535845
+-0.0164977 0.0828905 0.0574138
+0.0130474 0.0490028 0.046739
+-0.072956 0.173805 -0.0388399
+-0.0264766 0.0576077 -0.0284232
+-0.0644961 0.0602892 0.0183972
+0.0357477 0.074144 -0.0137952
+-0.0655596 0.171143 -0.0433207
+-0.0784904 0.133065 0.0521095
+-0.0651287 0.156206 0.0175513
+-0.0205565 0.183109 -0.0139659
+-0.0680156 0.156066 0.0121787
+0.0233417 0.0549864 0.0441504
+-0.0745084 0.134461 0.0510337
+-0.0489659 0.12587 -0.00699728
+-0.0422261 0.0339521 -0.0076663
+0.00337017 0.091416 -0.0329064
+0.040054 0.0998936 -0.00479776
+-0.0939204 0.128289 0.0212475
+-0.0301543 0.157156 -0.0110394
+-0.0456539 0.0606919 -0.0125779
+-0.0534986 0.0833862 0.0450488
+-0.047648 0.0614917 0.0367154
+-0.0486267 0.13356 0.00299082
+-0.0895466 0.0969995 0.0164128
+-0.0339552 0.0695264 -0.0185169
+-0.0176031 0.0711548 0.0545194
+0.0454033 0.0457238 -0.00184235
+-0.0546836 0.0478194 0.0276676
+-0.0875304 0.0861027 0.015468
+0.00919687 0.124582 -0.00824181
+0.0404579 0.0971405 0.0281735
+0.0219677 0.0346711 0.00269802
+-0.0114833 0.0618754 0.0549615
+-0.0209254 0.127401 0.0135903
+-0.0681737 0.074979 0.0383298
+-0.0357386 0.176065 -0.00515676
+0.0340797 0.115381 0.00660331
+-0.0207606 0.0670735 -0.0371287
+-0.075369 0.155134 0.0270903
+0.000773445 0.126081 0.0315854
+0.0414985 0.058326 0.0311197
+-0.03873 0.0340634 -0.0163036
+-0.0929281 0.121393 0.0102886
+-0.0680681 0.061235 0.0168081
+-0.0756991 0.0688679 0.00254149
+-0.0138611 0.0386244 0.0283378
+-0.0806333 0.120347 0.049427
+-0.0534714 0.115278 0.0343029
+-0.0365049 0.169731 0.000981263
+-0.0624922 0.100117 0.0423224
+0.00907886 0.126317 -0.00613291
+-0.0935493 0.125561 0.0262639
+0.022475 0.0933993 0.047467
+-0.015827 0.0921385 -0.0358122
+-0.0210449 0.0384562 -0.0168371
+-0.0207268 0.0612423 -0.0346723
+-0.0134967 0.109686 -0.0201653
+0.0456137 0.0708816 0.00289794
+-0.0090863 0.16966 -0.0247514
+-0.0889386 0.0888873 0.0194501
+-0.0532128 0.133944 -0.00360453
+0.0195053 0.0351963 0.0310168
+-0.0255119 0.104394 0.0424048
+-0.0174974 0.103031 0.0436129
+-0.0299173 0.0383162 -0.0299848
+0.00451386 0.0856474 0.057126
+0.0147725 0.0939169 -0.0254338
+0.0242867 0.0719771 -0.0256393
+0.0172719 0.0348529 0.0254373
+0.0558147 0.064873 0.0261542
+-0.0364911 0.0662596 0.041455
+-0.0758603 0.151341 -0.0198831
+-0.0616679 0.0643653 -0.00651734
+0.0383551 0.0603737 0.0324667
+-0.0477542 0.0782681 -0.0190718
+-0.0550269 0.0560444 -0.00440953
+-0.0395059 0.0972892 0.042147
+-0.0777926 0.167262 -0.0295303
+0.0604641 0.0623144 0.017179
+-0.0777137 0.177848 -0.0500546
+-0.0521757 0.0461175 0.0166821
+-0.0754874 0.130275 0.0528009
+0.0116887 0.0343979 -0.00472037
+-0.0617898 0.16156 -0.0335933
+0.0442649 0.0973538 0.00716867
+-0.0616258 0.0641254 0.029779
+0.00550935 0.0688576 0.0555484
+-0.053845 0.0955972 -0.0217935
+0.00741716 0.0375454 -0.0236134
+-0.0596132 0.113903 0.0363038
+-0.0508811 0.108424 -0.0190099
+-0.0437584 0.079737 -0.0197567
+-0.0733029 0.15632 0.000130521
+-0.003234 0.0960652 -0.0317479
+-0.0575581 0.0507849 0.00163524
+0.00435827 0.129372 -0.0013469
+-0.025212 0.123605 0.0223303
+-0.0669175 0.115159 -0.00990572
+-0.0722654 0.153589 0.032663
+-0.0147591 0.033582 -0.024214
+-0.00115893 0.11911 -0.0142672
+0.019441 0.0384709 -0.0146972
+-0.0772499 0.172214 -0.0459981
+-0.069531 0.14702 0.0417131
+-0.0343373 0.0443897 -0.0277936
+-0.0705699 0.152776 -0.0468148
+-0.0918951 0.117319 0.00831437
+0.0103421 0.0567446 -0.0299462
+-0.0336919 0.119642 -0.0105178
+-0.0629712 0.145905 -0.0115915
+0.00646739 0.0342464 -2.28584e-05
+0.00713618 0.103008 -0.0210892
+-0.018026 0.0384381 0.0276504
+0.0433583 0.0505545 -0.0063311
+-0.0882504 0.0900881 0.0054683
+0.00248872 0.118285 0.0387448
+-0.0227774 0.0713561 -0.0378898
+-0.0154972 0.122303 0.0324651
+-0.0322294 0.0708154 -0.0244722
+-0.025189 0.174162 -0.0196112
+-0.0871031 0.0846537 0.0064784
+0.00836869 0.0928852 -0.0303774
+-0.0424793 0.0958739 0.0423242
+-0.0640607 0.152536 -0.00179872
+0.00949301 0.118213 -0.015379
+0.0461867 0.0806341 0.00618373
+-0.0408599 0.102809 -0.0209257
+-0.0431187 0.159159 -0.0099383
+-0.0154785 0.0828416 0.0569929
+-0.0775215 0.161144 -0.0189221
+0.0358655 0.112954 0.0143927
+-0.0759551 0.131077 -0.00722143
+0.0465282 0.0726943 0.00507292
+-0.0784776 0.134439 0.0514602
+-0.0718916 0.0995338 0.0398851
+0.0174027 0.127944 0.018931
+-0.0494895 0.143125 0.00338457
+0.0333197 0.0357288 0.0133458
+0.0132595 0.0751478 -0.0304595
+-0.0324893 0.100164 0.0432113
+0.0343769 0.112004 0.0266888
+-0.0108703 0.180136 -0.0264173
+-0.0872312 0.1132 0.0437313
+0.0353616 0.106017 0.0302164
+-0.0282335 0.0382933 0.0310718
+-0.0646654 0.132541 0.0415985
+-0.0416682 0.0336125 -0.0201879
+-0.0690362 0.134069 0.0476421
+0.023852 0.057789 0.0449027
+0.0440963 0.0735854 0.0249308
+-0.0624573 0.163073 -0.0525854
+-0.0341025 0.169759 -0.00204136
+0.0589446 0.0649523 0.0051412
+-0.0602752 0.0336649 0.0124615
+-0.0628859 0.1495 -0.0200671
+-0.0722644 0.0671374 -0.000515551
+0.0135851 0.0658847 0.0529797
+-0.00198691 0.0368792 0.0142478
+0.0367682 0.0700097 -0.0138015
+-0.0296169 0.0408892 -0.0298249
+-0.0376612 0.0606745 -0.0122764
+0.00800811 0.0345328 -0.00370443
+0.0105539 0.104067 -0.0202515
+-0.0488192 0.0586801 0.0351334
+-0.0557857 0.0840569 -0.0214422
+0.0308153 0.0525508 -0.0137522
+0.0423969 0.0451283 0.0286278
+-0.0332147 0.036763 0.0499127
+-0.0736682 0.0730938 -0.00832442
+-0.0175484 0.124749 0.0265509
+-0.063425 0.163107 -0.0254606
+-0.0727351 0.0832969 0.03983
+0.0319929 0.088146 -0.0193446
+-0.0444371 0.122416 -0.011439
+-0.0858505 0.116285 0.047652
+-0.00444148 0.0916785 -0.0352643
+0.022957 0.0981907 0.0456622
+-0.053144 0.0595659 0.0253997
+-0.0788525 0.107465 0.0324362
+-0.0457478 0.130844 0.0207105
+-0.0684896 0.172346 -0.0400602
+-0.034733 0.0498868 -0.0123113
+0.0415062 0.0499285 0.0325086
+-0.0665679 0.0404538 -0.00528616
+-0.00650346 0.112991 -0.0197156
+-0.0448474 0.0999398 -0.0215303
+-0.0816586 0.137613 -0.00180043
+-0.0585618 0.124728 -0.00774237
+-0.0466281 0.0592297 -0.0120314
+-0.0670784 0.0653289 0.0275882
+-0.0835882 0.125784 0.0507488
+-0.0164643 0.0842755 0.0572298
+-0.0904705 0.135055 0.0132171
+-0.022546 0.116788 0.03495
+-0.0334891 0.091814 0.044517
+-0.0719917 0.151909 0.0358108
+-0.0151953 0.168341 -0.0151527
+-0.0590718 0.156479 0.0080978
+-0.0154402 0.120098 -0.0111735
+-0.036496 0.17271 -0.000384966
+0.0392898 0.0993144 0.028831
+0.024983 0.0795787 0.048494
+0.0483695 0.0734096 0.0143189
+0.0196959 0.0394038 0.04222
+-0.00886334 0.103392 -0.0235214
+-0.0118005 0.0841384 -0.0387163
+0.0252205 0.0888413 -0.0232794
+0.0298168 0.052105 0.0376191
+-0.0776927 0.169444 -0.0419634
+-0.0314915 0.057461 0.0373842
+-0.0504539 0.0558071 0.0326022
+0.0138422 0.0901622 -0.0294996
+-0.0510104 0.149266 0.0138316
+-0.0341485 0.0337694 0.0159272
+-0.085608 0.144617 0.0380805
+-0.0475132 0.0875996 0.0450977
+-0.091127 0.143391 0.0261688
+-0.0781968 0.0778917 0.0320122
+0.0284509 0.104793 -0.0149826
+-0.0223025 0.0957816 -0.0275832
+-0.0179573 0.123303 -0.00653742
+0.0369901 0.111103 0.00416682
+-0.0643667 0.159406 -0.0155654
+-0.0701684 0.165994 -0.0191552
+-0.0863906 0.0819518 0.00951177
+-0.0224965 0.100254 0.0443771
+-0.0757302 0.147214 -0.00986768
+0.0357939 0.0699287 -0.0148404
+-0.0376499 0.0577418 -0.0112619
+0.019292 0.0988007 -0.0225555
+-0.00992376 0.097544 0.0521376
+-0.0493712 0.0572598 0.0342952
+0.0255474 0.054922 0.0420386
+-0.0494259 0.144129 0.00171058
+-0.0624989 0.104282 0.0409609
+-0.0430319 0.0336432 -0.0167728
+0.0179185 0.121996 -0.0074786
+-0.0190623 0.127503 0.00554509
+-0.0474205 0.145822 -0.000777163
+0.0526083 0.0475984 0.0212218
+0.00022388 0.0797271 -0.0356555
+-0.0301525 0.168207 -0.0169318
+-0.00151732 0.0576213 0.0542293
+-0.00248496 0.0548872 0.0545581
+-0.0502022 0.12654 -0.00566411
+-0.0529063 0.0676787 0.0373317
+0.00249985 0.107203 0.0424791
+0.0029144 0.125773 -0.00745627
+0.00334453 0.0496343 -0.0297987
+0.00449641 0.11692 0.039168
+0.0399282 0.041091 0.0244564
+0.0178192 0.126124 0.0248053
+-0.0799402 0.132433 -0.00455304
+-0.0649027 0.179945 -0.0575726
+0.0404255 0.0914089 -0.00978781
+-0.065797 0.132562 0.0435297
+-0.0372368 0.172627 -0.0118528
+-0.0554974 0.10569 0.0407246
+-0.076892 0.165957 -0.0247772
+-0.0587093 0.0344925 0.0418625
+0.00823978 0.0768076 -0.0338586
+-0.0626545 0.150596 -0.0225786
+-0.0384668 0.0931237 0.0434147
+0.0141618 0.0576523 0.0502255
+-0.0683767 0.176522 -0.0580176
+-0.0129882 0.119781 -0.0128781
+0.00848559 0.0950467 0.0516302
+-0.0429797 0.127137 -0.00436425
+-0.0497252 0.141657 0.00538484
+-0.0179056 0.127636 0.0191062
+-0.0520277 0.0563658 0.0215194
+-0.02384 0.0968692 -0.0247025
+-0.0561697 0.0684762 0.0377129
+0.0120601 0.0343849 -0.00838478
+0.0299331 0.0362092 0.00288494
+-0.0763652 0.1528 -0.0108857
+-0.0736067 0.154075 -0.0289008
+0.00533532 0.0538992 -0.0301758
+-0.0599208 0.0394628 0.0453423
+-0.0184879 0.0856371 0.0571362
+-0.0208094 0.0376226 -0.0178912
+-0.0137231 0.183161 -0.0241068
+-0.0648137 0.0346657 0.0352478
+-0.0271872 0.0379033 0.0118238
+0.0264669 0.0477487 0.0380114
+-0.0723733 0.0352474 0.00704331
+-0.0322701 0.0835031 -0.0295487
+0.0272688 0.122366 0.00977001
+-0.0603093 0.0652594 0.0325934
+-0.00180254 0.0385071 0.00372255
+-0.0522762 0.123638 -0.00859751
+-0.0776201 0.171284 -0.03689
+-0.0802965 0.0872747 0.0345612
+-0.0889001 0.136394 0.00820864
+0.000412609 0.0393166 0.0342543
+-0.0642567 0.0344972 0.033776
+-0.0921303 0.11612 0.0363104
+-0.0679654 0.134068 -0.0084026
+-0.0839818 0.115583 0.0478751
+-0.00536465 0.129031 -0.000823415
+0.00514522 0.103044 -0.0216473
+-0.0496209 0.0517545 -0.00857532
+-0.0757023 0.177226 -0.0456228
+-0.0298766 0.05514 -0.0203901
+-0.0861039 0.0846923 0.0224682
+-0.0238144 0.0879301 0.05313
+-0.0611505 0.153585 0.0321143
+-0.0917527 0.113836 0.0170127
+-0.0374964 0.0591338 0.0402834
+-0.0187977 0.0799028 -0.0389405
+-0.0680553 0.17056 -0.0341587
+-0.0658521 0.0361993 0.0388506
+0.0111435 0.100252 -0.0225401
+-0.0425873 0.125894 -0.0070983
+-0.0265027 0.0498541 0.0461184
+0.00111147 0.110147 -0.0201294
+-0.00249391 0.119678 0.0379989
+-0.0117585 0.0742488 -0.0381827
+-0.0586841 0.0466878 -0.00234651
+0.0295244 0.0750328 -0.0218147
+-0.0218606 0.101624 -0.0238704
+0.0287102 0.0942447 0.0434182
+-0.0709345 0.0627948 0.0166551
+-0.0225064 0.10717 0.041634
+-0.0335027 0.074683 0.04142
+-0.092242 0.128315 0.0292604
+-0.0374976 0.0888821 0.0433743
+0.0303768 0.0578247 0.0402716
+-0.00891857 0.0338467 -0.0251248
+-0.0533378 0.162724 0.0010506
+-0.0869041 0.141929 0.0394374
+-0.047972 0.135544 0.0173874
+0.0485157 0.0597129 0.0310438
+-0.00667005 0.0904165 -0.0359686
+-0.0759966 0.0994807 0.0369297
+-0.0625222 0.149113 -0.00558111
+-0.0718118 0.14996 0.0389054
+-0.0844416 0.147376 0.00515339
+-0.0165344 0.0392124 0.0380479
+-0.079893 0.0949635 -0.0095262
+0.0236407 0.0347514 0.0177381
+-0.0196654 0.0683158 0.0524244
+0.0245994 0.0981921 0.0445203
+-0.0849795 0.0952966 -0.00257745
+-0.0528207 0.121242 0.0358805
+-0.0236049 0.0394052 -0.0289635
+-0.0332166 0.165305 -0.0043102
+-0.0251865 0.160795 -0.0139572
+-0.0865509 0.152927 0.0144746
+-0.0693964 0.157876 -0.00437702
+-0.0628145 0.169399 -0.0485883
+-0.0643644 0.153473 -0.0380226
+-0.081904 0.115723 0.0482136
+0.0101277 0.0911581 -0.0305812
+-0.0405043 0.0944618 0.0422679
+0.021919 0.118008 0.0336347
+-0.0203338 0.123782 -0.00500918
+0.0111252 0.108699 -0.019265
+-0.0574976 0.0776487 0.0433498
+-0.0354848 0.0987251 0.0428224
+-0.0651932 0.141087 0.0409428
+-0.0240513 0.0386342 -0.0120079
+0.039324 0.106993 0.0191699
+-0.0754947 0.142836 0.0460912
+-0.0122699 0.0338184 -0.0220638
+-0.0246982 0.0551057 0.0409028
+-0.0578691 0.105465 -0.0183362
+-0.0264983 0.10435 0.041876
+-0.07915 0.166638 -0.0349654
+-0.0578202 0.140285 -0.0045343
+0.0220783 0.0686046 0.0476717
+-0.0770892 0.107143 -0.00760422
+-0.0902136 0.13513 0.0232187
+-0.0723372 0.156305 0.0208189
+-0.0650055 0.135525 -0.0079735
+-0.0549293 0.154823 0.0139773
+0.0292317 0.0773621 -0.0219141
+-0.0817276 0.0964548 -0.00656413
+-0.018203 0.175668 -0.0239316
+-0.0553377 0.0457536 -0.00639551
+-0.0161975 0.0432999 0.0517769
+0.0304284 0.0383851 -0.001443
+-0.0345483 0.152531 -0.00560476
+-0.0629676 0.160574 -0.0208244
+-0.0935783 0.124186 0.0262856
+-0.0311645 0.0580869 -0.017406
+-0.0317989 0.0382037 0.00155838
+0.0576172 0.0686777 0.0217698
+-0.00505811 0.0339518 -0.0207718
+-0.0696447 0.166615 -0.0510113
+-0.0629867 0.155807 0.0241223
+-0.0340215 0.0794269 -0.0255119
+-0.0867747 0.0981404 0.0024092
+-0.0880604 0.13085 0.0022566
+0.0184887 0.0948214 0.0475148
+-0.021497 0.0988475 0.0444941
+-0.0416678 0.0592681 -0.0121392
+-0.0567258 0.0480405 0.0316684
+-0.0423133 0.129133 0.00872164
+-0.000508444 0.105851 0.0435843
+-0.0592465 0.046889 0.0316721
+0.0461219 0.0806353 0.0161697
+-0.0281528 0.0348412 0.0481365
+-0.0702797 0.180333 -0.0522624
+-0.0478122 0.134031 0.00640478
+-0.0077489 0.0713239 -0.0366154
+-0.0122439 0.168894 -0.023749
+0.0212552 0.0777078 -0.0266851
+-0.0917522 0.132325 0.0122241
+-0.0361034 0.165201 -0.01444
+-0.052501 0.0805516 0.0443114
+-0.0654153 0.0336345 0.00606909
+-0.0623235 0.139333 -0.00679766
+-0.0616576 0.170967 -0.0555865
+0.00174509 0.0392548 -0.00741822
+-0.0260001 0.0677977 0.0418131
+-0.0684331 0.0336931 0.00540027
+-0.0448348 0.0942101 -0.0220316
+-0.0731091 0.158237 -0.0329184
+0.0078778 0.0989406 -0.0227671
+0.0314417 0.115539 0.0270138
+-0.00906667 0.129748 0.004892
+0.00649868 0.108551 0.0413323
+-0.0382124 0.150071 -0.00262103
+0.0332799 0.0564373 0.0374441
+-0.00349826 0.0647878 0.0565544
+-0.0487816 0.084091 -0.021606
+-0.0568391 0.118972 -0.0116757
+-0.0644875 0.156696 -0.0456027
+-0.0411616 0.152146 0.00524032
+-0.0636742 0.142603 -0.0078783
+-0.0711318 0.0777267 0.0384114
+0.00321355 0.0796602 -0.0346071
+0.00447281 0.110003 0.0420134
+-0.0174998 0.0772311 0.0559767
+-0.0263139 0.182659 -0.010558
+-0.0322455 0.15809 0.00238998
+0.045843 0.0760483 0.0203743
+-0.0548028 0.0464121 0.0246755
+-0.0376206 0.0376543 -0.029358
+-0.0523414 0.0402098 0.0465679
+-0.0432186 0.121963 0.0262727
+-0.0321664 0.125608 0.018357
+-0.0857232 0.0792432 0.0155047
+-0.0782439 0.151233 0.0351897
+-0.0187146 0.058392 -0.0343021
+0.0452185 0.0847535 0.00320441
+-0.0640415 0.167322 -0.0369994
+-0.0823499 0.132665 0.0507367
+-0.0301219 0.0493909 -0.0214267
+-0.0843946 0.0818335 0.0225112
+-0.0246526 0.0386383 0.0332956
+0.0563147 0.0580894 0.0250386
+0.00021169 0.0389894 0.029096
+-0.00241379 0.126666 -0.00637642
+-0.0301429 0.0551656 -0.0193914
+0.0331811 0.0417541 0.0279348
+-0.0861938 0.104994 0.0213645
+-0.0824118 0.0788951 -0.000494108
+-0.0743937 0.157452 -0.00470821
+0.0187225 0.127515 0.0179893
+-0.0829047 0.0763015 0.0175246
+-0.0650238 0.0641454 0.0272956
+0.0355567 0.0878311 -0.0169845
+-0.0887171 0.117597 0.0462102
+-0.0760085 0.141318 -0.005968
+-0.0127703 0.0756733 -0.0384193
+-0.0158456 0.122449 -0.00760827
+-0.0842393 0.107513 0.00238784
+-0.0674898 0.0986608 0.0416951
+-0.0554949 0.0427291 0.0458455
+-0.0201912 0.0383436 0.00560257
+-0.0372682 0.0344921 0.0377782
+-0.0357437 0.0380351 0.0467216
+-0.0450103 0.054631 0.0385549
+-0.0369768 0.047531 -0.0185543
+0.0520769 0.0581909 0.0294992
+-0.0329038 0.153455 -0.00604291
+-0.0725184 0.128806 0.0519752
+-0.0270556 0.0706113 0.0413767
+-0.0285061 0.116641 0.0323888
+-0.0144886 0.109993 0.0419529
+-0.0285168 0.0803552 -0.0356291
+0.00952067 0.0702149 0.0551678
+-0.0355616 0.151785 -0.00432824
+-0.0826529 0.0796856 0.0277856
+-0.0365963 0.127614 0.0137714
+-0.0657008 0.139678 0.041893
+-0.0758694 0.0777615 0.0343673
+-0.00737907 0.0367231 0.0491533
+-0.0704775 0.114632 0.0510417
+-0.059558 0.128315 0.0402204
+-0.0538405 0.0941624 -0.0218364
+-0.0274601 0.124651 0.00100866
+-0.0637125 0.0705931 -0.0131267
+-0.0644549 0.043254 0.0326925
+-0.0746657 0.154121 -0.0198989
+-0.0348879 0.043516 0.0457289
+-0.0234602 0.17569 -0.0129988
+-0.0720698 0.176015 -0.0442709
+-0.043544 0.157959 0.00535766
+-0.0407405 0.0739506 -0.0180651
+-0.0696125 0.150354 -0.0430103
+0.0418343 0.0943991 0.0271656
+-0.0932461 0.129666 0.0232459
+-0.0398464 0.0957237 -0.0225845
+-0.0764914 0.171559 -0.0359139
+0.0408836 0.0614281 -0.00367417
+-0.0356978 0.0346221 -0.0180732
+-0.0895729 0.151493 0.0191084
+0.0263253 0.122966 0.0165355
+0.0113407 0.0567362 -0.0298085
+-0.0736511 0.180693 -0.0540178
+-0.042544 0.16227 0.00511409
+-0.0522198 0.0374253 0.0467614
+-0.0777691 0.0689598 0.0151422
+0.0463347 0.0428813 0.020444
+0.0509435 0.0554131 0.029582
+0.0233146 0.125046 0.00829766
+0.00834665 0.0958673 -0.0275066
+-0.00680856 0.127356 -0.00506622
+-0.0554704 0.157309 0.00940753
+-0.0754721 0.103526 0.0362863
+0.044978 0.086159 0.0221711
+-0.0716236 0.170198 -0.0283222
+-0.0196387 0.0464931 -0.0280998
+0.0569791 0.0686933 0.0226042
+-0.0233118 0.182976 -0.0180572
+0.0290367 0.060539 0.0418753
+-0.0708458 0.0980019 -0.0152545
+-0.044501 0.0562098 0.0390177
+-0.00787685 0.105931 -0.0227718
+-0.0774743 0.140015 0.0480697
+0.0275361 0.10477 0.0382193
+0.00254476 0.127971 -0.00383507
+0.0235041 0.108407 0.0388101
+-0.055098 0.146723 0.029184
+-0.0257112 0.0634738 0.0402437
+0.0222133 0.103397 0.0428172
+0.0239484 0.0901184 -0.0234122
+-0.0265532 0.080945 0.0504296
+-0.0801014 0.0881671 -0.00858727
+-0.0467634 0.0560036 0.0374321
+0.0562967 0.0661688 0.0251012
+-0.0323569 0.124066 -0.00320487
+-0.00891511 0.126415 -0.00600997
+0.0343206 0.094597 -0.0141158
+-0.0876587 0.151372 0.0112162
+-0.0723621 0.114661 0.051285
+-0.033385 0.126374 0.00317306
+-0.0465636 0.146777 -0.00183655
+-0.0086601 0.174145 -0.0268323
+0.0224333 0.0422246 0.0409441
+-0.0723219 0.171178 -0.0314543
+-0.0633454 0.159973 -0.0185957
+-0.0741825 0.156237 0.0158024
+0.0283215 0.117455 0.0287048
+-0.0518625 0.050332 0.0226347
+-0.0345112 0.112532 0.034973
+0.0102504 0.0766955 -0.0323547
+-0.0628937 0.146875 -0.0135938
+-0.0913593 0.126907 0.0414668
+-0.0755221 0.11896 0.0528247
+-0.0186351 0.0933648 0.0534492
+-0.00679579 0.0826768 -0.0377354
+0.00822704 0.0782053 -0.033734
+-0.0942744 0.126919 0.0202522
+-0.0462848 0.131856 0.0204922
+-0.05065 0.0706021 0.0388719
+-0.00522459 0.0384215 0.0122026
+-0.0524927 0.0987339 0.0429361
+-0.0388306 0.112851 -0.0174267
+-0.0268641 0.101582 -0.02361
+-0.0846396 0.153647 0.0136585
+0.0166715 0.0353808 -0.0156588
+-0.0553627 0.139574 0.0304759
+-0.0257886 0.0768981 -0.036857
+-0.0402218 0.0342366 0.0285657
+-0.045101 0.156152 -0.00816042
+-0.0348248 0.0473223 0.0413292
+0.0145592 0.0672414 0.0526521
+-0.0436275 0.0548777 -0.0111987
+-0.0248971 0.163359 -0.0156802
+-0.0449755 0.115277 -0.0159431
+-0.0492995 0.0345621 0.0403913
+-0.0257365 0.0348667 0.0503471
+-0.0754593 0.159053 -0.00907047
+-0.0632614 0.0601538 0.00426714
+-0.0265686 0.0382637 0.0296453
+-0.0355718 0.165308 -0.0024565
+-0.0727498 0.180616 -0.0549771
+-0.0381364 0.171203 -0.0118442
+0.0153228 0.0362397 0.00366285
+-0.0383106 0.0336688 0.00433881
+-0.0125102 0.0897843 0.0566766
+-0.0484982 0.0890084 0.0450201
+-0.0889791 0.0915153 0.00944503
+-0.0511466 0.124736 -0.0077758
+-0.00758688 0.0376797 -0.0254717
+-0.0509981 0.147813 0.0138388
+-0.0147745 0.0382944 0.014
+-0.0305049 0.0617476 0.0379767
+-0.0109155 0.0356188 0.0494667
+-0.0703667 0.142544 -0.0104932
+-0.0424925 0.0902452 0.0426486
+0.0099296 0.113714 0.0390911
+0.0145599 0.088488 -0.0297413
+-0.00249512 0.122376 0.0359373
+-0.0216559 0.0972103 0.0449705
+-0.0717874 0.0850294 -0.0163139
+0.0281202 0.0348895 0.0148787
+-0.0582075 0.154657 0.0258383
+0.0103893 0.0434318 -0.0247637
+0.0283214 0.115107 0.0315696
+-0.0408808 0.115001 -0.0156637
+-0.0569818 0.0548922 0.00263009
+-0.0347008 0.0666358 -0.0153327
+-0.0518449 0.146252 0.0164181
+-0.0388328 0.0943088 -0.0230504
+-0.0315145 0.0788556 0.0411289
+0.0268942 0.0988154 -0.0185978
+-0.0875561 0.0968363 0.00343541
+0.0426825 0.0805137 0.0283126
+-0.0683872 0.0690317 0.0328821
+-0.0609319 0.0343399 0.0363539
+-0.0258016 0.0867079 -0.0364604
+-0.0891389 0.120288 0.0465529
+-0.062692 0.155999 0.0140721
+0.0223974 0.0473356 -0.0199928
+-0.0616833 0.0676348 -0.0109359
+-0.0752375 0.0864841 -0.0145142
+0.014283 0.0681091 -0.0306905
+-0.0603219 0.0470192 0.0356706
+-0.015495 0.104397 0.0428489
+-0.0698499 0.0994423 -0.0150141
+-0.0293842 0.08757 0.0444817
+-0.00548831 0.112771 0.0416249
+-0.0120723 0.0353434 0.0494553
+0.0118631 0.0894057 -0.0307263
+0.0362901 0.0769906 -0.0138255
+-0.0372663 0.033541 -0.0229762
+0.0110129 0.0846936 0.0546683
+-0.0563673 0.0575771 -0.00141956
+0.0162242 0.0835192 -0.0290783
+-0.0466776 0.13337 0.0173732
+0.0116668 0.0548951 0.0518589
+-0.0175019 0.0758159 0.0556202
+-0.0865692 0.133541 0.00131146
+-0.0366797 0.0636525 -0.0138021
+-0.074087 0.0734714 0.0331119
+-0.0762512 0.156264 -0.00677505
+-0.0414995 0.168206 0.00296291
+0.0023065 0.128418 0.0277808
+-0.0141822 0.0378114 0.0510973
+-0.0674332 0.127053 0.0499702
+-0.0482072 0.0335431 -0.012174
+-0.072499 0.117558 0.0529308
+-0.0281279 0.03862 -0.0128123
+-0.0616129 0.149191 -0.00221638
+0.0436181 0.0416961 0.0210317
+-0.0758657 0.097813 -0.01246
+-0.0818672 0.120683 -0.00433302
+0.00940058 0.0342529 -0.0182643
+-0.018805 0.0625267 0.0503254
+-0.053876 0.126919 0.0361236
+-0.0884983 0.0941957 0.00744581
+-0.0165005 0.120964 0.0336371
+0.0433486 0.0519969 -0.00665823
+-0.0624811 0.149792 0.0367836
+-0.0615025 0.16984 -0.0615386
+-0.0364388 0.0352264 0.0443258
+0.0340769 0.0556934 -0.0107486
+-0.00261634 0.0450445 -0.0274328
+-0.0328486 0.0986298 -0.0228073
+0.0198481 0.0795335 0.0516115
+-0.0599778 0.148254 0.0362061
+-0.00849422 0.0674811 0.0555845
+-0.0530196 0.144246 -0.000696127
+-0.0836424 0.0924862 -0.00555232
+-0.0691184 0.165207 -0.0519806
+-0.0305063 0.111166 0.0367005
+-0.0447319 0.125394 0.0226968
+-0.0165708 0.056922 0.0510974
+-0.0568794 0.0548721 0.000601057
+-0.0355126 0.10012 0.0421792
+-0.00149054 0.131258 0.0163007
+-0.0814469 0.0761204 0.000521161
+-0.0700369 0.0765697 0.0383694
+-0.0791449 0.166643 -0.0339646
+0.0151117 0.0434234 0.0444141
+-0.0568399 0.0344097 0.0371692
+-0.0180623 0.177182 -0.017491
+0.0492456 0.0728121 0.0176064
+-0.0178752 0.105871 -0.0225888
+0.00334696 0.0342028 0.0159318
+0.0153617 0.0344714 0.021761
+-0.0945397 0.121475 0.0202819
+-0.073516 0.18065 -0.0535934
+-0.0934071 0.117385 0.0163015
+-0.0631359 0.0699525 0.0366992
+-0.0252161 0.0550594 0.0400126
+-0.00605897 0.125119 0.0321155
+-0.0360017 0.17408 -0.0118959
+-0.00638198 0.124385 -0.00985914
+-0.0145975 0.0378025 -0.0168233
+0.00417447 0.127894 0.028461
+-0.0410286 0.0345047 0.0334549
+0.0292997 0.0538256 -0.0177694
+0.0372061 0.0980869 0.0328651
+-0.0745356 0.104026 0.0368301
+-0.00436707 0.0386778 0.0266309
+0.0189949 0.0449386 0.0430002
+0.00529011 0.0668325 -0.0327227
+0.00166319 0.130955 0.0203219
+-0.0905947 0.115833 0.0426569
+0.00338984 0.116722 -0.0177517
+0.0203176 0.126182 0.0214303
+-0.0598293 0.139488 -0.00569497
+0.0142784 0.11622 -0.015243
+0.0231289 0.0835821 0.0493611
+0.0515475 0.0540038 0.0286923
+-0.0317664 0.058161 -0.0143983
+-0.0397537 0.0782783 -0.0191449
+0.012627 0.12184 0.0342326
+-0.0823735 0.148711 0.0361489
+-0.012301 0.110982 -0.0195491
+-0.0883046 0.122998 0.0470686
+-0.0315077 0.113893 0.0345441
+-0.0888952 0.137894 0.0271916
+-0.0610259 0.126912 0.0416133
+-0.0475344 0.05323 0.0369443
+-0.00961348 0.0434416 -0.0262361
+-0.0541404 0.124102 0.0375109
+0.0509994 0.044648 0.0132154
+0.0303038 0.118886 0.0223059
+-0.0596345 0.0336285 0.0108415
+-0.0196267 0.0450293 -0.0277098
+-0.0247099 0.0381195 0.00851258
+-0.0774982 0.133088 0.0521596
+0.0276359 0.0629152 -0.0215123
+0.0535119 0.0717543 0.00602975
+-0.0334971 0.0831472 0.0419572
+-0.0596476 0.14187 -0.00422882
+-0.0924522 0.125595 0.0392516
+-0.068714 0.143769 -0.0144235
+-0.0468988 0.126761 -0.00595632
+-0.0303571 0.0537911 -0.0173707
+-0.0709316 0.147597 -0.0300096
+-0.0514754 0.115278 0.0338114
+0.0190263 0.120653 0.0329746
+-0.0340031 0.1089 -0.0192874
+-0.0335001 0.116617 0.0321346
+-0.0671562 0.0724925 0.0371747
+-0.0746759 0.152711 -0.0238933
+-0.0590669 0.120714 -0.00943474
+0.00548706 0.108567 0.0416722
+-0.0114996 0.101652 0.0440245
+-0.0649779 0.141437 -0.00794337
+0.0112608 0.130411 0.00668952
+0.0436616 0.0987354 0.0121603
+-0.0558948 0.101262 -0.0199275
+-0.0309036 0.0436875 0.0502489
+0.0142962 0.0652331 -0.0300484
+0.000574283 0.0347216 0.0149023
+-0.00623443 0.0389648 -0.00688285
+-0.0810472 0.147398 0.0390836
+-0.0491606 0.0375682 0.0458781
+-0.055978 0.0534457 0.00767233
+-0.0685375 0.17487 -0.0458569
+0.0289287 0.100617 -0.0165368
+-0.0709835 0.0353942 0.00988845
+0.0337836 0.0754424 0.0400679
+0.041497 0.0527902 0.0324777
+-0.0204109 0.178661 -0.0155986
+-0.0623894 0.149097 -0.0105741
+-0.0644192 0.16051 -0.0170316
+-0.0350535 0.0346922 0.0433273
+-0.0740398 0.145796 -0.011857
+0.0214237 0.0444841 -0.0187153
+-0.0570526 0.113331 -0.0158151
+0.0134717 0.127798 0.0260714
+0.0324011 0.0446474 -0.00561054
+0.00231866 0.0568936 -0.0320023
+-0.0273763 0.112504 -0.0170987
+-0.0224223 0.072452 0.0507888
+-0.0614531 0.154118 0.0305097
+-0.0222065 0.179998 -0.0209469
+0.00315207 0.102056 -0.0221009
+0.0413778 0.0561233 -0.00592276
+0.037882 0.105959 0.026802
+-0.0607248 0.0722644 -0.016058
+0.00061382 0.126415 -0.00611002
+0.0592992 0.0566775 0.0181738
+0.0474969 0.0638142 0.0292952
+-0.0321069 0.162239 -0.0144989
+-0.0520198 0.147215 -0.00210798
+-0.0819286 0.0748755 0.0145293
+-0.0333602 0.0339348 0.0195439
+-0.0555018 0.0987713 0.0432834
+-0.0630837 0.164691 -0.0325918
+-0.0473982 0.0343754 -0.0164682
+-0.0807821 0.0980376 0.0332837
+-0.0645109 0.0370591 -0.00764757
+-0.085403 0.141865 0.00516647
+0.0420715 0.0859357 0.0292923
+0.0391529 0.107674 0.00402907
+0.024552 0.110059 0.0374287
+-0.0631521 0.0360725 0.0429133
+-0.0619885 0.156033 0.0186659
+-0.024223 0.17569 -0.0123366
+-0.0138299 0.0392302 0.0367944
+-0.0306217 0.126038 0.0115365
+-0.0714938 0.120397 0.053531
+-0.0869305 0.151358 0.010227
+-0.0788893 0.125151 -0.00625598
+-0.0447778 0.0409599 -0.0173005
+-0.09234 0.131039 0.0252374
+0.0321511 0.0724311 -0.0187615
+-0.0735819 0.0777026 -0.0122023
+-0.0678037 0.166983 -0.024036
+-0.0897153 0.135171 0.0332079
+-0.0447805 0.0840976 -0.0212945
+0.0371007 0.10968 0.00116733
+0.0112368 0.0836448 -0.0310335
+-0.036484 0.0505609 0.038833
+-0.0118972 0.116803 -0.015741
+-0.0346708 0.0621866 -0.0131726
+-0.0397664 0.0812015 -0.0202928
+-0.069532 0.172114 -0.0375728
+0.00626682 0.131047 0.00486423
+-0.0590022 0.0579904 0.014414
+-0.00972298 0.0642282 -0.0359259
+-0.0269413 0.181454 -0.0140289
+0.033222 0.0842418 -0.0188996
+0.00639168 0.0433788 -0.024537
+0.00926262 0.129557 0.000393265
+-0.00751646 0.0732149 0.0579299
+-0.0513203 0.142869 0.00077197
+-0.0288553 0.0385536 -0.0110371
+0.0555265 0.0728462 0.0170262
+-0.085954 0.146023 0.00719275
+-0.0371011 0.0461641 -0.0234326
+0.0579592 0.0537863 0.0201793
+0.0104003 0.0418913 -0.0239147
+-0.0396188 0.0505923 -0.0110041
+0.0326207 0.0944486 -0.0159568
+-0.0170933 0.0554767 0.0502631
+-0.0891859 0.139294 0.0371595
+-0.0637097 0.166224 -0.0345967
+0.00422867 0.0824562 -0.0341922
+-0.0594261 0.151258 -0.000475846
+-0.0552814 0.0464664 0.0256754
+-0.0424851 0.0776249 0.0430145
+0.0184693 0.111176 0.038468
+-0.0294978 0.0574079 0.0367222
+-0.0435452 0.0405422 0.0435069
+-0.0600989 0.0598417 0.00157193
+0.0526979 0.0525681 0.0268245
+-0.0625031 0.0602955 0.00246046
+-0.0675133 0.108346 0.0377589
+-0.00349512 0.111424 0.0424267
+-0.00549779 0.110034 0.0429298
+0.0164758 0.0713296 0.0519403
+0.0458506 0.0876137 0.00718075
+0.0244747 0.0400424 -0.00510986
+0.00547063 0.131454 0.017409
+-0.0728779 0.117943 -0.00788041
+-0.0142717 0.17714 -0.027303
+-0.0257193 0.0617764 -0.0314442
+-0.050991 0.0504175 0.03464
+0.00152343 0.0759482 0.0573355
+-0.0304944 0.064586 0.038393
+0.016253 0.0794879 0.0534651
+-0.00764651 0.0496471 -0.0308946
+-0.077844 0.0743656 -0.00558198
+-0.0326464 0.0563525 -0.0113988
+-0.061813 0.175696 -0.0586065
+-0.0681691 0.0682156 0.031879
+-0.0493845 0.0657885 0.0368321
+-0.019309 0.0362824 -0.0277788
+-0.063712 0.167032 -0.0383216
+-0.0379003 0.123041 0.0266516
+-0.000679533 0.0554388 -0.0315999
+-0.0886752 0.135106 0.0413889
+0.011146 0.128332 0.0266558
+-0.0740639 0.178692 -0.0478641
+-0.0809318 0.142082 0.0447817
+-0.00975763 0.0742329 -0.0379217
+-0.0600964 0.0334795 0.00370066
+-0.0566436 0.0657735 0.0346839
+-0.0767139 0.070678 0.0244626
+-0.0810351 0.0787684 -0.0035164
+0.0405001 0.076619 0.0321646
+-0.0283979 0.155793 -0.00852382
+-0.0535904 0.0617699 -0.00886774
+-0.0149347 0.127911 0.00262222
+-0.0197362 0.181499 -0.0230211
+-0.0781409 0.0718256 0.0231698
+-0.0337588 0.121858 0.0267132
+-0.0741051 0.0686193 0.025039
+0.0417534 0.0788713 -0.00674491
+-0.0515024 0.0340065 0.0263967
+-0.0763933 0.111249 -0.00565203
+-0.0538034 0.0898608 -0.0222645
+-0.000575856 0.0980296 -0.0278345
+0.0581094 0.0704417 0.00814168
+-0.0891434 0.137902 0.0291936
+0.00340212 0.0390598 -0.024445
+-0.0620333 0.153738 -0.0275809
+-0.0177087 0.0584461 -0.0348025
+-0.0823897 0.104663 0.0290404
+-0.0194981 0.10024 0.044034
+0.0242883 0.0705502 -0.0254969
+-0.0899225 0.133822 0.0382154
+-0.0195055 0.108574 0.0413935
+-0.0446392 0.0548635 -0.0110876
+0.00035867 0.048192 -0.0299591
+0.0364284 0.0413843 -0.00274773
+0.0187875 0.0351105 0.0327558
+-0.0568852 0.111179 -0.0170834
+0.0118445 0.0806629 0.0540991
+-0.0687285 0.155709 0.0264626
+0.00655625 0.109588 0.0412446
+0.00917706 0.113608 -0.0184169
+-0.0613933 0.155777 0.0101812
+-0.0314952 0.0903684 0.0441958
+0.0124021 0.0448701 -0.0249804
+-0.0241038 0.0865955 0.0534593
+-0.0631641 0.149054 -0.0215452
+-0.0401934 0.0365351 0.0429119
+-0.0898981 0.135185 0.0362087
+-0.0526397 0.0618282 -0.00966488
+-0.0844214 0.0777776 0.012517
+0.0222568 0.0748707 -0.0265095
+-0.0150366 0.0384845 0.00106724
+0.0180702 0.0879847 -0.0272411
+-0.0142291 0.127243 0.024765
+0.0382486 0.104643 0.0273123
+-0.0748494 0.0964384 -0.0137204
+-0.0808743 0.136754 0.0491531
+-0.0568962 0.0970004 -0.0209687
+-0.0803034 0.072641 0.00422068
+-0.0584156 0.0459799 0.0422363
+-0.0579142 0.114001 -0.0151155
+-0.0561079 0.0571065 0.0121919
+0.00037651 0.0978532 -0.0276151
+-0.0336642 0.082217 -0.0255373
+0.0457702 0.0735931 0.00320764
+-0.056498 0.07472 0.0419593
+0.00305684 0.124987 -0.00863513
+-0.0272404 0.0877435 0.0480762
+-0.040496 0.0577326 0.0402811
+-0.0202415 0.0392282 0.0390567
+-0.020926 0.0334921 -0.0253378
+-0.0690953 0.0751628 0.0379926
+-0.0520047 0.0344961 0.0416004
+-0.0141843 0.128965 0.0174774
+0.0288353 0.0368345 0.0223773
+-0.0444076 0.0394861 -0.0222996
+-0.0838483 0.119157 -0.00284212
+-0.0034971 0.0732704 0.0586485
+-0.03681 0.0886191 -0.0239226
+-0.0669297 0.105269 -0.0144963
+-0.07603 0.0941366 0.0385416
+-0.0716625 0.145448 -0.0198949
+-0.0165056 0.0382425 0.0100681
+-0.0909349 0.113307 0.0123445
+-0.0192269 0.0381483 0.0222601
+0.026296 0.0862676 0.0469202
+-0.0118259 0.0386358 0.028745
+-0.0513331 0.0334323 -0.00718543
+-0.0685946 0.0353745 -0.00558788
+-0.0370306 0.151785 -0.00571407
+-0.0891386 0.129503 0.00423129
+-0.0447856 0.0348265 0.00740272
+0.040097 0.105566 0.00218117
+0.00862183 0.120558 -0.0139068
+-0.0679053 0.171131 -0.036968
+0.0164071 0.0345184 0.0219352
+-0.0501179 0.137029 0.00241503
+0.0125996 0.0459414 0.0443461
+-0.0654928 0.0818627 0.0433416
+-0.0215596 0.0891328 -0.036783
+-0.0685096 0.147001 0.0412847
+0.0400896 0.0702922 -0.00980716
+-0.0291528 0.0378835 0.0276599
+-0.0624944 0.145991 -0.00758108
+-0.029375 0.0621337 -0.0244169
+-0.0655919 0.151202 -0.0366034
+-0.064581 0.128354 0.0453237
+-0.0626195 0.153328 0.0013944
+-0.0863817 0.148632 0.0316852
+-0.0153553 0.112218 -0.0188504
+-0.0602045 0.0441634 0.0266895
+-0.0204995 0.111306 0.0398343
+-0.0454802 0.112265 -0.0167776
+0.0212764 0.0693138 -0.0277613
+-0.0458225 0.146281 0.00549558
+-0.065521 0.0335373 -0.00466605
+-0.00710114 0.0339482 -0.0211688
+0.0551094 0.0539301 0.0250409
+-0.0781434 0.0927222 0.0364655
+0.0291436 0.0707502 -0.0218013
+-0.091117 0.143373 0.0231646
+-0.0575628 0.0576989 0.003607
+-0.0745558 0.0684435 0.0233437
+0.000679346 0.0933957 -0.0329817
+0.0136703 0.0446634 0.0441067
+0.0425933 0.0791563 0.0282081
+-0.0098481 0.112657 -0.0193422
+-0.0678577 0.102354 -0.0152646
+-0.0245236 0.0838729 0.0539551
+-0.0522319 0.125489 0.0349878
+-0.0331359 0.168192 -0.0157544
+0.0437182 0.0944809 0.000197915
+-0.0271741 0.161328 -0.0145155
+-0.0635247 0.139599 0.0380296
+-0.0105236 0.0787711 0.0579243
+0.0221704 0.109999 -0.014573
+-0.0626188 0.166275 -0.0435849
+-0.0162218 0.186444 -0.0207352
+-0.00481374 0.128076 -0.00386981
+-0.0761439 0.154623 0.0283179
+-0.00628506 0.0952929 -0.0329709
+-0.0244623 0.0348843 0.0471798
+-0.0764469 0.175411 -0.0430646
+-0.0374817 0.0903202 0.0435434
+0.0448755 0.0917539 0.00218552
+-0.0464937 0.0411703 0.0442462
+0.00738566 0.0463583 -0.0259834
+-0.0269838 0.158131 -0.000540227
+-0.0195125 0.0800523 0.0567242
+0.0535386 0.0505579 0.00123438
+-0.0704829 0.066568 0.025804
+-0.0478545 0.117892 -0.0146818
+-0.0645863 0.144373 -0.0132186
+-0.0619148 0.161553 -0.037594
+-0.0328555 0.100056 -0.0225692
+-0.0605435 0.0660534 0.0336067
+-0.00290962 0.037693 0.0115129
+-0.0101883 0.0876449 -0.0371912
+-0.0625754 0.042738 -0.00542472
+0.00650044 0.0910463 0.0545358
+-0.0756811 0.154032 -0.0169094
+-0.0034723 0.130516 0.00409153
+0.00232953 0.116694 -0.0177181
+-0.0378274 0.0929022 -0.0235348
+-0.02161 0.158057 -0.00899889
+0.0304133 0.0415863 -0.00412062
+-0.0728954 0.176495 -0.0445729
+-0.0420309 0.0335517 -0.0220625
+-0.0187514 0.0906841 0.0550582
+-0.0855548 0.125248 -0.00272359
+-0.0137086 0.0614344 -0.0364468
+-0.020723 0.0597726 -0.0340423
+-0.0708646 0.0384387 0.000437312
+0.0310181 0.112726 0.0309619
+0.0131047 0.129972 0.0173477
+-0.0216432 0.124246 -0.00349177
+-0.0626999 0.0706798 -0.0138683
+-0.0865991 0.0833319 0.0164838
+-0.0644302 0.0384213 0.0160253
+-0.0187164 0.0611476 0.0502898
+-0.0791607 0.170809 -0.0419883
+0.00181256 0.0994772 -0.0233519
+0.0199074 0.11877 -0.0100039
+-0.0361903 0.151017 -0.000604378
+-0.084275 0.0897993 -0.00457099
+-0.0554832 0.0861944 0.0449632
+-0.0623633 0.0458155 0.0336786
+0.034658 0.114539 0.0168181
+-0.0736982 0.167846 -0.0232955
+-0.0181465 0.166773 -0.0192359
+0.0113761 0.0494361 -0.0277541
+-0.0440746 0.154693 -0.007872
+0.0606816 0.0664976 0.015162
+0.044367 0.0575454 -0.00546316
+0.0134639 0.0616949 0.0510096
+0.0400149 0.0829397 -0.0117765
+0.0423451 0.0690926 -0.00378897
+-0.0691689 0.0336248 0.00172074
+0.0582234 0.0593447 0.00320204
+-0.0900566 0.133779 0.0292173
+-0.0381652 0.0336678 -0.0288809
+0.0397017 0.104178 0.024171
+-0.0755036 0.121787 0.0531411
+-0.025634 0.122393 0.025161
+0.058528 0.0565928 0.00617045
+-0.0801768 0.155046 0.0137223
+0.0277963 0.0835666 0.045536
+-0.0628566 0.145948 -0.0105775
+-0.0133824 0.0383808 0.0105781
+-0.049358 0.146268 -0.00147688
+-0.0484712 0.0517504 0.0365675
+-0.0467968 0.0869913 -0.021986
+0.0553821 0.0590684 -0.000816519
+-0.0179551 0.0921164 -0.0358084
+-0.0789524 0.0921836 -0.0106406
+0.0374058 0.0893177 -0.0145297
+-0.032345 0.0473443 -0.0245628
+0.0173629 0.0537245 -0.0278081
+-0.0616059 0.160004 -0.0295877
+-0.0123225 0.124091 -0.00743567
+-0.0401607 0.163674 -0.0120006
+-0.06497 0.154244 -0.00563561
+-0.0510279 0.0336678 0.0250302
+-0.0771941 0.0893363 -0.0125642
+0.0224953 0.109772 0.0381484
+-0.0545656 0.13815 0.0298405
+-0.00171216 0.066944 -0.0344014
+-0.00330066 0.124033 -0.00952648
+-0.0724141 0.159616 -0.0379306
+-0.0128309 0.0869146 -0.0385108
+0.0379635 0.103337 0.0286718
+0.00150556 0.0870476 0.0569313
+0.0339501 0.0683557 -0.0167775
+-0.0296157 0.053701 -0.0213818
+-0.0239053 0.0350134 -0.0198326
+0.00348633 0.110018 0.042298
+-0.00459976 0.0405792 -0.0256485
+0.0313837 0.0352278 0.00968341
+-0.0524893 0.105673 0.0402508
+-0.0334757 0.072353 -0.0224701
+-0.00165204 0.0347369 0.0450897
+-0.0251253 0.179165 -0.0186166
+0.0418909 0.0939077 0.0272858
+-0.0417165 0.069628 -0.0168617
+-0.0751265 0.0670609 0.00488552
+-0.0702901 0.063891 0.0211244
+-0.0777094 0.170825 -0.0439812
+-0.0735195 0.135848 0.0500526
+-0.0690768 0.0739443 0.0372765
+0.0123912 0.116671 -0.0157278
+-0.0504991 0.105636 0.0396146
+0.0194996 0.0489742 0.0420155
+-0.0652338 0.145869 -0.0189253
+0.0183651 0.124757 -0.00246117
+-0.067493 0.105571 0.0389191
+0.00451331 0.0814276 0.0565046
+-0.0126391 0.0466477 -0.0295757
+-0.043534 0.0422491 -0.0203181
+-0.0576807 0.133928 0.0359191
+-0.0847679 0.10454 0.0257763
+-0.0763966 0.0748983 0.0314167
+-0.0163248 0.0390132 0.0346782
+0.0455396 0.083395 0.0201668
+-0.0404951 0.0747761 0.0426102
+0.0326457 0.113685 0.0274718
+-0.0533008 0.118582 -0.0133417
+-0.0548347 0.0518559 -0.00436961
+-0.0444358 0.0344955 0.0309851
+0.0022525 0.0986072 0.0504164
+0.0280941 0.107442 0.0372758
+0.0311382 0.100809 0.0381724
+-0.0608693 0.0982413 -0.018491
+-0.0808258 0.116274 -0.00349703
+-0.00493749 0.124022 0.0339675
+-0.0202041 0.0383371 0.000156328
+0.000176932 0.0881362 -0.0348875
+-0.0122454 0.128019 0.000407111
+-0.0750529 0.0860661 0.0392001
+-0.0200226 0.0403705 0.0532551
+-0.0196618 0.127752 0.0140421
+-0.0544977 0.0747139 0.0418232
+-0.0850765 0.107567 0.00438106
+-0.0759578 0.071995 0.0287387
+-0.0434567 0.155083 0.00724724
+-0.090134 0.132434 0.0362229
+0.022282 0.0706591 -0.0268891
+-0.090924 0.128274 0.0409748
+-0.0889908 0.13778 0.0388031
+-0.0788715 0.122217 -0.0060966
+-0.00443014 0.100204 0.0479984
+0.0327247 0.0646521 0.0402099
+-0.066223 0.15556 -0.0520809
+0.0118954 0.0685639 0.0540604
+-0.0805181 0.12599 0.0525745
+0.0465562 0.0753029 0.0092212
+-0.0743025 0.151276 -0.0308835
+-0.0905476 0.146077 0.0141502
+-0.0715441 0.112225 0.0480665
+-0.0679786 0.137002 -0.008171
+-0.0672001 0.044789 0.00569382
+-0.0714328 0.168025 -0.0480185
+-0.0584837 0.088969 0.0446761
+-0.0444852 0.0411138 0.0436529
+0.0142229 0.0821798 -0.0300828
+0.0137354 0.10206 -0.0220537
+-0.0532836 0.0335112 0.0086601
+-0.046743 0.0767653 -0.0182293
+-0.0653246 0.173014 -0.0475844
+-0.0105123 0.0633015 0.0555068
+-0.0652467 0.122825 0.0496059
+-0.0587837 0.0940397 -0.0203993
+-0.061496 0.107016 0.0394252
+0.032159 0.0404592 0.0270704
+-0.0550412 0.129739 0.0362139
+0.0187645 0.036357 0.00611202
+-0.051625 0.0474378 0.0157122
+-0.0945263 0.121474 0.0192827
+-0.0874631 0.104981 0.0103802
+-0.0444225 0.0587761 0.0392912
+0.00550135 0.107149 0.041587
+-0.0023107 0.0375379 0.0154093
+0.0365396 0.111887 0.0174946
+-0.0667677 0.0809002 -0.0178421
+0.0212994 0.0550028 0.0464604
+-0.00474995 0.0391641 0.0333259
+0.0385436 0.103322 0.0277283
+-0.0350927 0.168167 -0.014918
+-0.0381943 0.124735 0.0235454
+-0.0436117 0.125739 0.0201433
+-0.0122465 0.124398 0.0313659
+-0.018196 0.038272 0.00607299
+-0.0454731 0.0675709 0.040115
+0.0397094 0.0887389 0.0329441
+-0.0612601 0.0653881 0.0322823
+0.0358388 0.063303 0.0376893
+-0.0894207 0.0969969 0.0174102
+0.0247051 0.054807 -0.022754
+-0.0362363 0.0345287 0.0379647
+-0.0134852 0.104433 0.0435318
+-0.0390753 0.0353444 0.00990175
+-0.032893 0.0386199 -0.0119052
+-0.066881 0.172737 -0.0437921
+-0.0844296 0.0777425 0.00651672
+0.0102401 0.13009 0.0220074
+-0.0184847 0.091067 0.0550019
+-0.048793 0.155022 0.0100543
+-0.042488 0.1112 0.0368617
+-0.00484603 0.0989761 -0.0268273
+-0.0667655 0.079447 -0.0174677
+-0.0520123 0.033434 -0.00549431
+-0.0309502 0.0376665 0.0292806
+0.0125353 0.118934 -0.0141702
+0.0393762 0.0393721 0.0023232
+-0.0154839 0.0388074 -0.00858919
+-0.027433 0.108265 -0.0206521
+-0.0335566 0.11282 -0.0174155
+-0.0428158 0.126503 0.0190139
+0.0359007 0.0374161 0.00496434
+0.030827 0.118499 0.003976
+0.0482689 0.0616107 -0.00376704
+0.0172995 0.0637271 -0.0287659
+0.0352999 0.0727523 0.0387329
+0.0325099 0.0439072 0.0294151
+0.0434928 0.0597185 0.030951
+-0.0849411 0.14333 0.0402714
+-0.0419573 0.15213 0.00584722
+-0.0478585 0.101383 -0.0215741
+0.0158763 0.121559 0.0327664
+0.0196134 0.0505877 0.0439573
+-0.0408143 0.0899706 -0.0230035
+0.0179499 0.0360095 0.0408071
+-0.0491945 0.137084 0.0184007
+0.0422067 0.0898824 0.0277847
+-0.0568073 0.122 -0.00880521
+-0.0535468 0.0500774 -0.00609453
+-0.0791017 0.171279 -0.0410322
+-0.0812381 0.0774347 -0.00249764
+0.00451011 0.08973 0.0555486
+0.0360129 0.0947297 -0.0122566
+-0.0267986 0.0839175 -0.0367186
+-0.0336466 0.125738 0.0192922
+-0.0645061 0.0384674 -0.00726163
+-0.069197 0.145134 -0.0204031
+-0.0453102 0.150665 0.00801555
+-0.016121 0.0347931 0.0455365
+0.0372267 0.0827114 -0.0157704
+-0.0586519 0.047167 0.0396282
+-0.0723413 0.0352299 0.00501169
+-0.00850771 0.0457646 0.047699
+-0.0361402 0.0481769 -0.0171107
+-0.0694918 0.0986232 0.041191
+-0.0145821 0.0365575 -0.0175497
+-0.0152331 0.178626 -0.0269991
+-0.0375015 0.0761535 0.0421853
+0.0230994 0.0700125 0.0474321
+-0.0769031 0.149462 0.0386995
+-0.0160344 0.0394989 0.0396851
+-0.077278 0.155614 0.0132673
+-0.0461472 0.0695191 0.0407559
+0.013766 0.105146 -0.0193832
+-0.00180961 0.102694 -0.0227875
+-0.0404787 0.102851 0.0403978
+-0.0256602 0.0491814 -0.0262646
+-0.0640267 0.155773 0.0106957
+-0.0188798 0.0381919 0.018679
+0.0251044 0.111527 -0.0122017
+-0.00771141 0.130468 0.0154714
+-0.0143198 0.128437 0.0203415
+0.000556364 0.0427979 0.0462128
+-0.0107039 0.129221 0.0216334
+-0.0755898 0.0796389 -0.010614
+-0.0618567 0.156837 -0.0325918
+-0.0516893 0.0678068 -0.0129959
+-0.0631142 0.178334 -0.0583576
+-0.0386855 0.0651385 -0.0142461
+-0.0594798 0.0790546 0.0431577
+-0.029726 0.121561 0.0251755
+-0.0328596 0.153633 -0.000344229
+0.0339626 0.0356317 0.0117064
+-0.0718527 0.158151 -0.00382487
+-0.0194857 0.0486564 0.0485018
+0.0319575 0.0889685 0.042819
+0.00933955 0.0624337 -0.0310444
+-0.0172265 0.113695 -0.0184196
+-0.0866231 0.0846922 0.0194779
+-0.0663134 0.0608279 0.00678018
+-0.0718125 0.0922256 -0.0157107
+0.0550352 0.064867 0.0267865
+-0.0446824 0.0651214 -0.0145177
+-0.066499 0.0958724 0.0422345
+-0.0484771 0.135525 0.0064169
+0.0419641 0.0872658 0.0291034
+-0.0144336 0.120974 -0.0101151
+0.00537913 0.115468 -0.0184153
+-0.0169313 0.0940904 -0.0338108
+-0.0311219 0.087675 -0.0275557
+-0.0733475 0.129801 0.0519745
+-0.0628563 0.0432731 0.0396846
+-0.0181419 0.159077 -0.00932452
+-0.0244219 0.0752703 0.0498831
+0.0278638 0.0367181 0.000104301
+0.0464062 0.0525822 0.0317783
+-0.0352134 0.127051 0.0157486
+-0.037493 0.0605801 0.0408152
+0.0435542 0.0709351 0.0259153
+-0.061811 0.0896079 -0.0190442
+-0.0487502 0.167013 -0.00197199
+-0.011981 0.180127 -0.0244833
+-0.0273118 0.0346998 0.0432305
+0.0260624 0.113339 -0.0101501
+0.00139388 0.0977439 -0.0275242
+0.0217437 0.0348491 0.000619009
+-0.0598385 0.0385019 0.0199857
+-0.0742583 0.12978 0.0523998
+0.0125017 0.103142 0.0463418
+0.0222613 0.0768462 0.049813
+0.0226846 0.125635 0.0109073
+-0.0664848 0.153437 0.0331838
+-0.0635064 0.100118 0.0422551
+-0.0884181 0.136485 0.0410708
+-0.0821317 0.151156 0.0323844
+-0.035019 0.035354 0.0462574
+-0.0445836 0.049099 -0.0105442
+-0.0913513 0.126793 0.00727091
+-0.00465552 0.0526099 -0.031899
+-0.0536395 0.0361733 0.0466553
+-0.0624928 0.0775409 0.0419345
+-0.0454844 0.1652 0.00481603
+-0.0176555 0.10171 -0.0237622
+-0.0517386 0.139928 0.000994108
+-0.0894422 0.0969694 0.0114146
+0.0282036 0.106111 0.0374341
+-0.0930784 0.128223 0.0132485
+-0.0710378 0.113905 0.0504272
+-0.0589666 0.06768 0.0360494
+0.0249541 0.12014 0.0288767
+-0.0467094 0.0345808 0.0339444
+-0.0627411 0.0766785 -0.0179436
+-0.00548466 0.051944 0.0528973
+-0.0355056 0.0705073 0.0417804
+0.00377856 0.127353 -0.00517835
+-0.0595895 0.0659394 0.0339087
+-0.0639025 0.0344657 0.0356117
+-0.0549717 0.132532 0.0345672
+-0.0762259 0.0790445 0.0349679
+-0.0259103 0.0721759 0.0444214
+0.0315716 0.117859 0.00423829
+-0.0696582 0.0642657 0.000568637
+-0.0882731 0.143189 0.0351319
+-0.031681 0.0679763 -0.0234472
+-0.0699144 0.1253 -0.00883057
+0.0435982 0.0888699 0.0251665
+-0.0914617 0.144737 0.0211556
+-0.0205009 0.126788 0.0181341
+0.0311284 0.103423 0.0364018
+-0.0196184 0.043638 -0.0281382
+-0.0192518 0.185941 -0.0210687
+0.0556563 0.0725898 0.00964459
+-0.0899954 0.135014 0.00922069
+-0.0658394 0.170333 -0.0405107
+-0.0487066 0.064243 0.0362896
+0.0115006 0.100446 0.0479384
+-0.0479295 0.132887 0.00374503
+0.0216229 0.0700379 0.048827
+0.0151599 0.050478 0.0463014
+0.00510611 0.0386758 0.0457599
+-0.0284578 0.0789297 -0.0355663
+-0.081069 0.152209 0.0312004
+-0.0814521 0.13302 0.0511119
+-0.0115065 0.0517326 0.051159
+0.0190773 0.108184 -0.0165978
+-0.0879813 0.0860844 0.0054873
+-0.0565924 0.0442297 -0.00693458
+-0.0358918 0.166781 -0.00116722
+0.0263229 0.122689 0.0193841
+-0.0305096 0.0608404 -0.0204127
+-0.0790435 0.0718734 0.00353541
+-0.0264818 0.101588 0.0434387
+0.0224815 0.0892515 0.0484736
+-0.07435 0.0711851 0.0297739
+-0.0366402 0.0563002 -0.0110085
+-0.0858069 0.133905 0.0470456
+-0.0347686 0.16678 -0.00304399
+-0.0318926 0.0385829 -0.0116716
+0.0173027 0.0680054 -0.0293377
+-0.084368 0.114299 0.000284663
+-0.0761089 0.149998 -0.0108814
+0.0437289 0.0987183 0.00617361
+0.0134057 0.0374127 -0.0219366
+0.000807934 0.124791 -0.00838237
+-0.0406768 0.0621783 -0.0128097
+-0.0926608 0.121474 0.0282925
+-0.0595443 0.155728 0.018094
+-0.0646509 0.168222 -0.0372156
+-0.0197896 0.127727 0.0110836
+0.0112619 0.069597 -0.0315203
+-0.0784667 0.141403 0.0468168
+-0.0881381 0.0996585 0.0223676
+-0.0495985 0.048927 -0.00879829
+-0.0567267 0.15478 0.0220083
+-0.0273659 0.119585 -0.010507
+0.0191093 0.0375318 0.0414884
+-0.054786 0.147744 0.027387
+0.0185111 0.114004 0.0370685
+-0.0106027 0.171925 -0.0271985
+-0.0795217 0.0748572 0.0255446
+0.0527001 0.0462105 0.0152086
+0.0191089 0.0889764 -0.0262512
+-0.0917278 0.114662 0.0113396
+-0.0311696 0.0749025 -0.031542
+0.0103976 0.0505032 0.04997
+0.00150167 0.0504398 0.0522275
+-0.00913054 0.0987984 -0.026694
+-0.0607072 0.0707896 -0.0151427
+-0.0314435 0.033488 -0.0292746
+0.0322402 0.0842577 -0.0191914
+-0.0617587 0.160001 -0.0265888
+0.0366758 0.0659888 0.0371374
+-0.0410386 0.153314 -0.00775366
+-0.0916156 0.146104 0.0201482
+-0.008275 0.130081 0.0196055
+-0.0716229 0.0395313 0.00756641
+-0.0555501 0.0448059 0.0154665
+-0.0519883 0.0545681 0.0276385
+-0.063796 0.145383 -0.0141799
+-0.0204903 0.107154 0.041938
+-0.00950118 0.06052 0.0554819
+-0.0297859 0.073336 -0.0325546
+0.0225502 0.0873848 -0.0245875
+-0.0658345 0.0367656 0.0273328
+-0.0335698 0.0354174 0.0482024
+-0.0826039 0.0829175 -0.00455606
+0.0133284 0.055284 -0.0292269
+-0.000932932 0.0363158 0.0167895
+0.0190541 0.116198 -0.0132311
+-0.000494259 0.0911454 0.0560111
+0.0112951 0.130595 0.0166808
+-0.0164761 0.0673645 0.0539812
+-0.0180225 0.0385494 -0.00514634
+-0.0610891 0.0339525 0.017372
+-0.0707478 0.147309 -0.0278341
+-0.0189873 0.180146 -0.0170482
+0.0237757 0.0343382 0.00896337
+-0.00265737 0.0899953 -0.0354905
+-0.0718661 0.100809 -0.0137558
+-0.00649817 0.0939276 0.0556503
+-0.0246455 0.126418 0.012252
+-0.0157508 0.070024 -0.0384074
+0.0256059 0.12104 -0.000826914
+0.00250363 0.0489881 0.0513443
+-0.029644 0.125848 0.0118936
+-0.024804 0.0737635 0.0475256
+-0.0672658 0.131206 0.0466969
+-0.0817178 0.0953366 0.0328835
+-0.0286351 0.0918211 -0.0275955
+0.0414472 0.0971985 0.0261597
+-0.0680972 0.121444 0.0525081
+-0.0683202 0.166619 -0.0540065
+-0.0375072 0.0775843 0.0424046
+-0.0143913 0.0384112 0.00490303
+-0.0518947 0.109852 -0.0185479
+0.0338477 0.0711662 -0.016803
+-0.0450894 0.154663 -0.00752455
+-0.0564919 0.0875695 0.0445907
+0.0391967 0.0726247 0.033788
+0.0574073 0.0717824 0.0103168
+-0.0237163 0.0380022 0.0196686
+0.0120538 0.0907862 -0.0301745
+-0.0669793 0.134061 -0.00834965
+-0.00947746 0.116894 0.0392479
+-0.0328734 0.0680853 -0.0194707
+0.030263 0.116206 0.0279976
+-0.0348513 0.0345425 0.0400019
+-0.0532018 0.0733522 0.0412342
+-0.0577592 0.033805 0.0199655
+-0.00439966 0.119978 -0.0131705
+0.0162591 0.0434903 0.0442636
+-0.0567225 0.0423764 0.0206991
+0.00325132 0.12142 -0.0127844
+0.0145581 0.125506 0.0293407
+0.00448398 0.0989824 0.0487111
+-0.0896848 0.0929338 0.0144339
+-0.04491 0.13036 0.00775303
+-0.048947 0.138616 0.00839947
+-0.0307428 0.0552453 -0.0153798
+-0.0826044 0.1367 0.0480323
+-0.0749507 0.0661289 0.00944516
+-0.00473325 0.069866 -0.0358872
+-0.0167995 0.0347343 0.0471976
+-0.0426342 0.12559 0.0204963
+-0.0444709 0.120321 -0.0132547
+0.010477 0.116818 0.0374755
+-0.0744965 0.123196 0.0533572
+-0.047302 0.16443 0.00497116
+-0.0859996 0.118394 -0.000793117
+-0.0326967 0.0849828 -0.026556
+-0.0843669 0.106153 0.00138874
+0.0167493 0.127305 0.0229819
+0.0223908 0.0489358 -0.0217863
+-0.0762839 0.155844 0.0209052
+-0.0839499 0.0979633 -0.0036111
+-0.0216926 0.126501 0.0176944
+0.0378596 0.0914955 0.035553
+0.0420895 0.102851 0.00717012
+0.0366464 0.103365 0.0302885
+-0.0696779 0.086056 0.0423345
+-0.0340311 0.0339294 0.0212063
+0.0162763 0.0361212 0.00396256
+-0.0426327 0.0338426 -0.00397459
+-0.027617 0.125471 0.0155889
+-0.0937433 0.118772 0.0222988
+-0.0518432 0.133909 0.0302884
+-0.0413643 0.124214 -0.00934406
+-0.0413386 0.121239 -0.0122322
+-0.0396582 0.0336638 0.00768797
+-0.0853564 0.091162 -0.00253932
+0.0179914 0.120614 0.0332262
+-0.0717184 0.0792466 -0.0147262
+0.0215785 0.11262 0.0367657
+0.0236405 0.0366106 0.026972
+-0.07448 0.0662148 0.0164657
+-0.00149557 0.0973426 -0.0290749
+0.0342448 0.0842103 -0.0184253
+0.0045204 0.0661365 0.0560558
+-0.0072649 0.0384115 0.0117959
+0.0362267 0.104294 -0.00842134
+0.0232091 0.0782074 0.0494446
+-0.0204762 0.0786229 0.0556935
+0.0189956 0.125897 0.000310264
+0.0582502 0.0661055 0.0226582
+-0.0884672 0.113635 0.0306037
+-0.0595891 0.155231 0.0238846
+-0.0540479 0.142765 -0.001179
+0.0139994 0.0807368 0.0537041
+-0.0660333 0.155202 -0.00458552
+-0.0371914 0.175481 -0.00856986
+-0.0114786 0.114128 0.0403922
+0.00280587 0.10648 -0.0207933
+-0.061629 0.148291 0.0370712
+-0.0305056 0.115271 0.0335326
+-0.0847456 0.0911272 0.0289858
+0.0294623 0.103445 0.0374919
+-0.0884887 0.122612 0.00129126
+-0.0869453 0.0846809 0.01048
+0.04631 0.0778469 0.00818385
+-0.077491 0.135849 0.0507593
+0.00650523 0.0745046 0.0565842
+-0.0193751 0.0711448 0.0534686
+-0.03164 0.0581442 -0.0153958
+0.00337821 0.0392113 0.0295452
+0.026954 0.116596 0.0310646
+-0.0623115 0.16311 -0.0435951
+0.0154275 0.0350916 0.0411096
+-0.0724818 0.165221 -0.0429802
+-0.0359956 0.151076 -0.00202594
+0.0162209 0.0779008 -0.0293961
+-0.0478366 0.133877 0.0213554
+0.0569921 0.0661536 0.0243514
+-0.0318346 0.0915622 -0.0244444
+-0.0864107 0.0819973 0.0174801
+-0.0497993 0.0677848 0.0379447
+-0.0671663 0.164687 -0.0194859
+-0.00868026 0.111843 -0.0204858
+-0.0195177 0.0933631 0.0529187
+-0.0535918 0.114983 -0.0155816
+-0.068804 0.18096 -0.0579804
+-0.0846698 0.148755 0.00515607
+-0.0808035 0.0868637 -0.00756861
+-0.0309282 0.156627 0.000764301
+-0.0561456 0.0642166 0.0326189
+-0.0864523 0.0899653 0.00147962
+-0.0802598 0.0734072 0.0195467
+-0.025101 0.114847 -0.0155729
+-0.0348703 0.102876 -0.0215726
+0.00151752 0.0547965 0.0538164
+-0.0216758 0.0969718 -0.024798
+0.0367496 0.0931371 -0.012555
+0.00330684 0.0583228 -0.0321215
+-0.0697412 0.154452 0.0305168
+-0.0618525 0.0343021 0.022204
+-0.00886294 0.171168 -0.0237423
+-0.0216854 0.168305 -0.0122385
+-0.0435207 0.0562403 0.0394546
+-0.0620233 0.159983 -0.0376027
+-0.0751309 0.154085 -0.0179327
+-0.0480694 0.153165 -0.00566954
+0.0283556 0.0605487 0.0426528
+0.0115864 0.0348612 0.0423222
+-0.064559 0.11407 0.0417666
+0.0210547 0.0358177 -0.00168489
+-0.042575 0.0491291 -0.011035
+-0.0742409 0.113562 0.0499634
+-0.0659446 0.146784 0.0398667
+-0.0670071 0.172276 -0.0580562
+0.0251821 0.0357118 0.0226481
+-0.0129957 0.0883892 -0.0379783
+0.01814 0.0713245 0.0508426
+0.0161851 0.0347246 0.0253316
+-0.0234485 0.122824 -0.00599554
+0.00849456 0.0412846 0.0453159
+-0.0253871 0.124202 0.0208009
+0.00860136 0.121512 -0.0129363
+-0.0764996 0.128859 0.0532215
+-0.0637886 0.083851 -0.0191517
+-0.073438 0.175304 -0.0418354
+-0.0464485 0.132668 0.0189406
+-0.018505 0.112714 0.0394706
+-0.0579749 0.117711 -0.0123561
+-0.0241311 0.0384069 -0.0174035
+0.0286891 0.119649 0.00175522
+0.0135044 0.118213 0.0361594
+0.00748569 0.0942514 -0.0297902
+0.0223281 0.111319 -0.0139783
+0.00796203 0.131149 0.00690102
+-0.0888712 0.101031 0.0183836
+0.0208523 0.0352023 0.0276656
+-0.0939805 0.118754 0.0182968
+-0.0886426 0.129716 0.0443401
+-0.0562403 0.128346 0.0379943
+-0.0946719 0.122818 0.0192736
+-0.0844496 0.151409 0.0062115
+-0.0488054 0.124161 -0.00921799
+-0.0495787 0.0503337 -0.00863311
+-0.0642728 0.174473 -0.0515364
+-0.0355869 0.116022 -0.0147547
+0.0353133 0.0362497 0.0114171
+-0.0570854 0.136926 -0.00500822
+-0.033504 0.079379 -0.0265108
+-0.062469 0.033932 0.0153305
+-0.000579953 0.0361804 -0.0245898
+-0.0314067 0.0423682 0.0507901
+-0.0112759 0.125368 0.030237
+-0.00950387 0.075936 0.0571919
+-0.0424487 0.125177 -0.00834623
+-0.0077039 0.113721 -0.0184781
+-0.00342161 0.0338005 -0.0221963
+-0.0140717 0.118746 -0.0137718
+-0.0231943 0.0388081 0.0352395
+-0.0639512 0.156212 0.0208686
+-0.0624954 0.0890364 0.0453804
+-0.0303734 0.125779 0.00722581
+0.003605 0.0340592 0.00699628
+-0.0765794 0.15423 -0.00189723
+-0.0759273 0.08606 0.0386654
+0.0508473 0.0446622 0.0112162
+0.00609443 0.127443 0.0291456
+-0.0428742 0.105667 -0.0205602
+-0.0188968 0.0381911 0.0132528
+-0.086324 0.106283 0.0073644
+-0.0320928 0.0336737 -0.0220791
+-0.0466544 0.119173 -0.0140371
+-0.0710688 0.156192 0.0139947
+-0.055712 0.155088 0.0136896
+-0.0525045 0.159361 0.00819169
+-0.0543637 0.116891 0.0353365
+0.0318466 0.0424663 0.0288342
+-0.051547 0.125478 0.0342157
+-0.00249266 0.0760635 0.0587913
+-0.00575365 0.0727093 -0.0362416
+-0.00680153 0.129324 0.00093339
+0.0495021 0.0664943 0.0276338
+-0.0282448 0.11486 -0.0155715
+0.031224 0.0786608 -0.0202592
+-0.0148026 0.0827563 -0.0392327
+-0.071855 0.0993885 -0.014251
+0.0177513 0.0462342 0.0429632
+-0.0242082 0.121982 0.0271598
+-0.0922854 0.116039 0.0223382
+0.0434814 0.0832239 -0.00379707
+-0.0384996 0.171162 0.000767348
+-0.0712408 0.114861 0.0513991
+-0.0157632 0.12799 0.00385748
+0.019082 0.126548 0.00245443
+-0.00388013 0.0394939 0.0368098
+-0.0204678 0.122105 0.0297617
+-0.0285693 0.0399846 -0.0296196
+-0.0831878 0.0764607 0.0163622
+0.0190867 0.0428243 -0.0216805
+0.0483631 0.0628304 -0.00297175
+-0.0927311 0.120157 0.0322864
+-0.0241838 0.0579409 0.0417219
+-0.0517297 0.0723507 -0.015831
+-0.0217729 0.0684817 -0.0372671
+-0.00949546 0.0829261 0.0578441
+0.0172524 0.0778474 -0.0286871
+-0.0441607 0.162142 -0.00945516
+-0.00587725 0.105934 -0.0226578
+0.0253567 0.0518232 -0.0216362
+-0.0494861 0.156424 0.00985611
+-0.0174771 0.0924389 0.0547456
+-0.0151406 0.126373 0.0259068
+-0.0852968 0.0818288 0.005494
+-0.0244818 0.0988555 0.0446892
+-0.0930791 0.118839 0.037294
+-0.0662836 0.114247 0.046332
+0.0127465 0.0672208 0.05354
+-0.0414757 0.109827 0.0377618
+-0.0435203 0.0519967 0.0390799
+-0.0417672 0.0812092 -0.0204027
+-0.0786424 0.0732312 0.000545367
+-0.0358502 0.0986071 -0.0225695
+0.0443653 0.0561662 -0.00597205
+0.0226111 0.0458717 -0.017849
+-0.0108336 0.116804 -0.0157483
+-0.0865451 0.110395 0.00835385
+0.031421 0.0399741 -0.00264961
+0.0363991 0.039859 -0.00104313
+-0.0468008 0.0347657 0.0424884
+-0.0398282 0.0914347 -0.0233046
+-0.025008 0.0334859 -0.0261337
+-0.0465231 0.0804789 0.0433941
+-0.0689665 0.135529 -0.00828838
+-0.0264689 0.0379883 0.0100865
+-0.0345116 0.111154 0.0360997
+-0.0225694 0.0387321 0.0336407
+0.0372794 0.0574491 -0.00767997
+-0.0707981 0.0672067 0.0269443
+-0.0150683 0.0384098 0.0065829
+-0.0592389 0.0452743 -0.00430196
+-0.0334924 0.102881 0.0413291
+-0.079025 0.153836 0.00536375
+-0.0229321 0.055215 0.043371
+-0.0601957 0.0341396 0.0262143
+-0.0688541 0.147497 -0.029579
+-0.0613597 0.172535 -0.0585911
+-0.0748166 0.0921259 -0.0144369
+-0.0632016 0.165278 -0.0601981
+0.0402098 0.04091 0.000378677
+-0.047469 0.117985 0.0306301
+0.0368134 0.0781201 0.03746
+0.000515748 0.0349973 0.0453092
+-0.0534255 0.124412 -0.00739059
+-0.000488424 0.0801341 0.0575904
+-0.0706455 0.0701231 -0.00669595
+-0.0477034 0.0649971 -0.0135628
+-0.0348898 0.0767003 -0.020496
+-0.00451076 0.0788064 0.0581316
+-0.0693915 0.117164 0.0523368
+-0.0200653 0.164398 -0.0170398
+-0.073544 0.177863 -0.0540307
+0.0427163 0.0399244 0.0113768
+0.0240483 0.0713748 0.0470522
+-0.0154968 0.0659374 0.0537935
+-0.0686329 0.175846 -0.0473222
+-0.0628372 0.172536 -0.0525874
+-0.0796429 0.148681 -0.00084361
+-0.0663392 0.0600723 0.0146241
+-0.00400483 0.123769 0.0343163
+0.0322222 0.0597861 -0.0166881
+-0.0640918 0.158696 -0.0546245
+-0.00248901 0.0456504 0.0469622
+-0.072774 0.10871 0.0380686
+-0.0810086 0.154578 0.0119766
+-0.0695005 0.091616 0.0421021
+-0.0665162 0.155345 0.00690315
+-0.030539 0.0748507 -0.0325674
+-0.0672648 0.0680031 0.0322561
+-0.0660205 0.131186 0.0449542
+-0.0246171 0.125897 0.00496292
+-0.077893 0.12518 -0.00689701
+-0.0883724 0.121658 0.047175
+-0.0773948 0.167309 -0.02854
+-0.0604 0.0470132 0.0371523
+-0.027746 0.0753954 -0.0356568
+-0.0748509 0.0782361 -0.0105914
+-0.0571323 0.14819 0.0314465
+-0.0415029 0.0803953 0.042616
+-0.0628829 0.0649103 0.0305991
+-0.00169833 0.0598396 -0.033652
+0.0151569 0.107807 -0.0181851
+0.0566945 0.0674374 0.0239376
+-0.0717279 0.155642 0.00502354
+-0.00382186 0.102465 0.0438439
+-0.0587089 0.155741 0.0125904
+0.0572801 0.0608152 0.0247108
+0.017703 0.0913635 0.0485583
+0.0260543 0.116303 -0.00733098
+-0.0345036 0.0690703 0.0414109
+-0.0292922 0.117943 -0.0127907
+0.0213023 0.0835644 0.0502546
+0.0464907 0.0664648 0.0271426
+-0.0564929 0.14962 0.0306387
+0.0282135 0.118937 -0.00132982
+-0.000391601 0.123621 0.0341495
+-0.00114981 0.12653 0.03091
+0.0304544 0.114562 -0.00546317
+-0.0547437 0.0337519 0.0206417
+-0.0468823 0.107031 -0.0193009
+-0.0631801 0.0406886 0.0415101
+-0.0910325 0.133669 0.0112223
+-0.0592476 0.145654 -0.00231326
+-0.0125718 0.100502 0.0445971
+-0.0298246 0.0378766 0.0293214
+-0.0839351 0.123564 -0.00377373
+-0.0621407 0.163665 -0.0567978
+-0.0389566 0.155104 0.00497717
+-0.0878144 0.105004 0.012374
+-0.0794305 0.0908376 -0.00963692
+-0.0246551 0.0507167 -0.0273858
+-0.0796103 0.0799856 -0.0065507
+0.0330411 0.10941 -0.00791346
+-0.00231596 0.121888 -0.0112268
+-0.0597326 0.154693 0.0267485
+0.0339669 0.0697663 -0.0167955
+0.0205734 0.0999616 -0.0218299
+-0.0354929 0.0917868 0.0443508
+0.00339585 0.0355203 0.0220096
+-0.0315414 0.125778 0.00387502
+-0.0478194 0.135564 0.0104014
+-0.00879058 0.0812731 -0.0379859
+-0.0037488 0.0386615 0.00318783
+-0.0464486 0.0959731 0.0434949
+-0.0306087 0.0394849 -0.0300968
+-0.00234671 0.0967246 -0.0304442
+-0.0312616 0.0735186 -0.0295121
+-0.0423301 0.0340883 0.0282541
+0.0355908 0.113068 0.0185826
+0.000833787 0.106762 -0.0210825
+-0.021676 0.184465 -0.0190713
+-0.0305406 0.0566147 -0.0184018
+-0.0876394 0.113262 0.0257017
+-0.0851868 0.0966727 -0.00156833
+-0.0465061 0.0425232 0.0438042
+0.0106037 0.121274 -0.0126925
+0.0290611 0.0523826 -0.0177704
+-0.000764451 0.0769261 -0.0359174
+-0.0416101 0.0338187 0.00715256
+-0.0893298 0.0969555 0.0104169
+-0.0345694 0.163827 -0.00275159
+-0.0888276 0.090232 0.0214359
+0.0208395 0.034464 0.00266226
+0.0428658 0.0623821 -0.00251673
+-0.00588102 0.130577 0.00751387
+-0.0133142 0.0337765 -0.0222266
+-0.0435242 0.0590876 0.0398271
+0.0545899 0.0478435 0.0151974
+-0.0107349 0.0699421 -0.0371274
+0.027906 0.0578072 0.0419759
+-0.0416225 0.0520166 -0.011127
+-0.0207276 0.168298 -0.0126147
+0.0256959 0.0491338 0.0386649
+-0.0550795 0.153114 -0.00215772
+-0.0380808 0.0483205 -0.0131774
+-0.0276317 0.056316 -0.0254148
+-0.00815144 0.127733 -0.00346398
+-0.0627849 0.0852772 -0.0191174
+-0.0619877 0.169385 -0.052596
+0.0234401 0.112665 0.0358138
+-0.0659073 0.110934 -0.0126703
+0.0280721 0.0360499 0.0211097
+0.0105243 0.0687767 0.0545753
+-0.00679638 0.0982761 -0.0281107
+-0.0309109 0.0462432 0.0473418
+-0.0196031 0.0393462 -0.028238
+-0.0871129 0.152836 0.0157593
+-0.0911632 0.133688 0.01322
+-0.0464961 0.102903 0.0415914
+-0.0206991 0.0553418 -0.0317435
+-0.00949277 0.073156 0.0570282
+-0.0864179 0.083353 0.0184733
+-0.0841891 0.111446 0.02976
+-0.0940387 0.126929 0.0232615
+0.0406221 0.0899944 0.0307666
+0.0208423 0.104696 0.0425993
+0.0445354 0.0407636 0.0127885
+-0.0623396 0.172509 -0.0536126
+0.0342346 0.0852576 -0.0183147
+-0.0866427 0.151554 0.0100877
+-0.0470988 0.0345244 0.0321531
+-0.080576 0.154494 0.0106641
+-0.0137759 0.0756859 -0.0386228
+0.0216235 0.0430155 -0.0167288
+0.0376424 0.109732 0.0031582
+0.0589875 0.0607291 0.021951
+-0.0923003 0.132372 0.0212228
+0.0311691 0.0942449 0.0417029
+-0.0174159 0.162512 -0.00777918
+-0.0156178 0.12076 -0.00985742
+-0.0507328 0.121196 0.0335979
+0.028716 0.119662 0.0245591
+-0.0738138 0.0950345 -0.0145557
+0.0204425 0.0350747 0.0258809
+-0.0207737 0.0351435 -0.019333
+0.0223353 0.12586 0.0121947
+-0.0155009 0.0951913 0.0533641
+-0.0143883 0.038338 0.0212719
+0.00741103 0.0391504 0.030425
+0.0433932 0.0691823 -0.000799598
+-0.0760543 0.149976 -0.0168736
+-0.0701178 0.170154 -0.0291958
+-0.0483555 0.146018 -0.00117385
+0.0336441 0.0578174 0.0379601
+-0.0913716 0.140622 0.0201693
+-0.0308539 0.0958394 -0.0237431
+-0.0766992 0.0702795 0.00252119
+-0.0544948 0.107078 0.0398767
+-0.0587729 0.0796565 -0.019784
+-0.013621 0.128874 0.0191382
+-0.0634727 0.156127 0.0195874
+-0.0880436 0.0977019 0.0235765
+-0.0606626 0.0738612 0.0409255
+0.0348653 0.0795228 0.0399156
+0.0387467 0.0828368 -0.0137708
+-0.0573402 0.0424553 0.0177175
+-0.0784976 0.148406 0.0395361
+-0.0917148 0.117385 0.0263102
+-0.0330041 0.122377 0.0254817
+0.0172403 0.0768113 0.0531129
+0.0595736 0.0691817 0.0101411
+0.0306903 0.0708797 -0.0198199
+-0.0845462 0.119028 0.0490922
+-0.0501127 0.0337803 -0.0127711
+-0.0670049 0.0372923 0.032499
+-0.0915067 0.129676 0.0312386
+-0.0550517 0.0504886 -0.00434688
+-0.0484873 0.0790818 0.0439275
+-0.0635173 0.159862 -0.0515858
+-0.0706155 0.173275 -0.0394062
+0.0352172 0.0952034 -0.0127755
+0.0251052 0.0382735 0.0297226
+-0.0668809 0.106639 -0.013906
+-0.0678418 0.143634 -0.0139334
+-0.0235762 0.184403 -0.0123621
+-0.0257601 0.0726356 -0.0363191
+-0.0573375 0.0472769 0.0101218
+-0.085611 0.106332 0.02136
+-0.0265671 0.0617846 0.0387137
+-0.0126044 0.12951 0.0108053
+0.0214416 0.0362735 0.0322576
+-0.0354711 0.126342 0.0186171
+-0.0594976 0.0904384 0.0451853
+0.00310705 0.0348555 0.0387811
+0.0254813 0.0942452 0.0457882
+-0.0308576 0.10008 -0.0228293
+-0.0176768 0.0510699 -0.0312435
+-0.0162281 0.181624 -0.0200739
+-0.0195138 0.038345 0.00392275
+-0.0645154 0.121409 0.0489254
+-0.0248162 0.0593033 0.0409035
+-0.0571389 0.136712 0.0331888
+-0.0435213 0.0379732 -0.0242868
+-0.0606582 0.12408 0.0421371
+0.0346832 0.0519191 0.0323364
+-0.0913706 0.116528 0.0258009
+-0.0426868 0.0651551 -0.0146214
+-0.0215064 0.116765 0.0355266
+-0.0581012 0.158247 0.00415445
+0.00842312 0.0385006 0.0330183
+-0.0523141 0.162661 -0.0019165
+0.0606845 0.0623337 0.0161711
+-0.0495055 0.0848369 0.0453213
+0.0333786 0.06058 0.0393695
+-0.0689469 0.131135 -0.00874709
+-0.078943 0.132461 -0.00522567
+-0.0196521 0.0386292 -0.00926197
+-0.0594457 0.0334843 -0.00338966
+-0.054161 0.0337073 0.0136843
+-0.0384829 0.0959056 0.0428235
+-0.0869182 0.148604 0.0308154
+-0.0323987 0.116048 -0.0147978
+0.0359194 0.0798211 -0.0157295
+-0.0328255 0.12127 -0.00820532
+0.0414852 0.0569681 0.0316528
+-0.0270871 0.0520359 -0.0253933
+0.0508347 0.0727393 0.0196905
+-0.0198767 0.105865 -0.0225965
+0.0206869 0.0400703 -0.0126929
+-0.0285033 0.0616825 0.0373869
+-0.0714181 0.143109 -0.0104276
+-0.0804568 0.138622 0.0481167
+-0.0458049 0.0532278 0.0379952
+-0.0509023 0.125469 0.0333647
+-0.0871853 0.145927 0.0339699
+0.0558536 0.0594884 0.0261475
+-0.0889169 0.126733 0.0032966
+0.0110737 0.125093 -0.00680678
+-0.0358405 0.094357 -0.023472
+0.0259145 0.102099 0.0411479
+0.0426389 0.0764517 0.0281735
+0.00597565 0.131268 0.0190237
+-0.0475211 0.165506 -0.00586183
+0.0138473 0.035286 0.0424107
+-0.0544751 0.0987674 0.042954
+0.0329063 0.0668566 -0.0177475
+-0.0715523 0.0819441 0.0400873
+-0.0483263 0.149906 -0.00403153
+0.0417112 0.0986332 0.0241669
+-0.0591403 0.039472 0.0459797
+-0.0649985 0.156251 0.0205012
+-0.0389795 0.034282 0.00907489
+-0.0627215 0.0592404 0.0161384
+-0.0367435 0.0437017 -0.0271198
+-0.0164726 0.0387782 -0.0143554
+0.0302495 0.0773125 -0.0211724
+0.0378723 0.109729 0.00416584
+-0.0033562 0.120959 -0.0122202
+-0.0465665 0.0433151 -0.011194
+-0.0597431 0.093988 -0.019461
+-0.0756514 0.0743685 0.0320217
+0.0461779 0.083439 0.010174
+-0.0757827 0.151399 -0.00889222
+-0.0417451 0.0768346 -0.0188724
+-0.0617437 0.0421117 0.0428503
+0.00176163 0.130465 0.00157228
+0.0429689 0.0696277 0.0268653
+-0.0432762 0.0450842 -0.0143236
+-0.0525312 0.0475838 0.0226634
+-0.0153636 0.128543 0.00690549
+-0.0685053 0.109678 0.0379594
+0.0174805 0.103096 0.0453391
+0.0217176 0.0632088 0.0471364
+0.0359993 0.0955223 0.036379
+-0.0451488 0.0335546 0.00486717
+-0.0681193 0.15804 -0.05439
+-0.0661021 0.155727 0.025928
+-0.00573558 0.0684573 -0.035843
+-0.0181282 0.187252 -0.018852
+-0.0445141 0.050571 0.038927
+-0.00049716 0.0856626 0.0573342
+0.016507 0.0913965 0.0503683
+-0.0333397 0.0410057 0.0499212
+-0.0351946 0.125334 -0.00338173
+-0.0616183 0.16622 -0.0565931
+-0.0624979 0.0760891 0.0414437
+0.0350466 0.107363 0.0297386
+-0.0720199 0.063399 0.00874547
+-0.0877434 0.135138 0.0431967
+0.0458379 0.0588925 -0.00503856
+-0.0385014 0.119389 0.0303589
+-0.0647267 0.0417808 0.0373932
+-0.0226655 0.0537608 -0.0296706
+-0.0584982 0.105689 0.0406051
+-0.0137228 0.0685659 -0.0377913
+-0.0817302 0.142079 0.0441697
+-0.0426358 0.0548841 -0.0113796
+-0.0135008 0.082884 0.0573146
+-0.00338001 0.130095 0.0228247
+0.0172769 0.0708593 -0.0295557
+-0.0246932 0.065394 -0.0335995
+-0.0314011 0.178523 -0.00645128
+-0.0575589 0.154615 -0.000238768
+-0.0407441 0.0753914 -0.0183192
+-0.084936 0.144668 0.0388142
+-0.0365092 0.108385 0.0376381
+-0.0851088 0.102115 0.000391121
+-0.0646522 0.0642554 -0.00503339
+-0.0754983 0.145823 -0.00786764
+-0.0474148 0.133778 0.0200381
+0.012958 0.0904818 -0.0298536
+-0.0425054 0.0705013 0.0420152
+0.0369946 0.0686204 -0.0137746
+0.0462743 0.0775122 0.0165366
+-0.0417874 0.128546 0.00302224
+0.00250208 0.0547919 0.0536548
+-0.0543206 0.140979 0.0284164
+-0.0492132 0.138613 0.0153977
+-0.0204064 0.162527 -0.00684616
+-0.0194926 0.111309 0.040066
+-0.00849594 0.0829198 0.0577964
+-0.0467773 0.0826601 -0.021013
+-0.0535197 0.0472233 -0.00680686
+-0.0092432 0.169141 -0.0244221
+-0.0594862 0.0804633 0.0433033
+-0.0764447 0.154164 -0.0158984
+0.0585888 0.0538213 0.0151823
+-0.0588396 0.0925945 -0.0203375
+-0.0761105 0.167387 -0.0256061
+0.0432176 0.0401728 0.0130684
+-0.0395679 0.152136 0.0040279
+-0.0685344 0.180035 -0.058648
+-0.0404998 0.0930589 0.0424923
+0.0428754 0.100088 0.00417324
+-0.0320271 0.0553591 -0.0124271
+0.0199862 0.0348656 0.0241629
+-0.069479 0.123198 0.0530616
+-0.0239594 0.117024 -0.0138685
+-0.013157 0.175712 -0.0209577
+0.00451102 0.0674972 0.0557889
+0.0304128 0.0431004 -0.0051324
+-0.0887794 0.151473 0.0131594
+0.0317917 0.0949031 -0.0164462
+0.0342895 0.112223 -0.00202032
+-0.0728652 0.170808 -0.0480355
+0.0253565 0.075473 0.0472224
+-0.0754952 0.15561 -0.00190651
+0.060278 0.0581371 0.013168
+0.00444274 0.131539 0.0170385
+0.00950273 0.0546854 0.0525766
+-0.028415 0.178753 -0.00594863
+-0.011518 0.0431769 0.0500228
+-0.0504724 0.141671 0.0164028
+-0.0424936 0.045133 0.0413379
+0.0207994 0.125738 0.00307388
+-0.0689469 0.0433261 0.00632212
+0.0111753 0.0766426 0.0548499
+0.0297504 0.0462054 0.0339396
+-0.0674791 0.0622216 0.0214031
+0.0131787 0.0793804 0.0542326
+-0.0630395 0.136976 -0.00741235
+-0.0026931 0.0386465 0.0251959
+-0.0862725 0.103636 0.0233541
+-0.072832 0.162419 -0.0389636
+-0.0670825 0.156321 0.0197603
+-0.0572305 0.057508 0.0152056
+-0.0876158 0.136354 0.00421533
+-0.0214752 0.0609386 0.0459919
+-0.007347 0.0952877 -0.0329727
+-0.0613578 0.0586321 0.0151557
+0.00350505 0.0590839 0.0549927
+-0.0372275 0.160948 0.000450465
+-0.0457572 0.0336839 -0.00997088
+0.0106658 0.0351593 0.00371028
+-0.0714997 0.16363 -0.0138384
+0.00840839 0.117161 -0.0162388
+-0.0493716 0.143224 0.00839291
+0.0251748 0.123444 0.0203849
+0.0329112 0.096871 0.0389677
+0.044554 0.0917551 0.0201604
+-0.0384935 0.0562767 0.0397971
+-0.0785284 0.123123 0.0516319
+0.0426769 0.101505 0.0101616
+0.00833271 0.0567886 -0.0305627
+-0.0876135 0.100396 0.0230423
+-0.0327059 0.0779055 -0.0285245
+0.0119151 0.0860485 0.0542349
+-0.0675927 0.17056 -0.0354212
+-0.0807265 0.0770568 0.0269252
+-0.0384859 0.0520062 0.0392089
+0.0452145 0.0482364 0.0300085
+0.0204736 0.0851385 0.0500118
+-0.0600179 0.155783 0.0193707
+0.0164701 0.0976264 0.0474551
+-0.0456663 0.0410589 -0.0152981
+-0.0821974 0.128571 0.0521036
+-0.0304964 0.0974331 0.0445755
+-0.0540878 0.128312 0.0358453
+0.0390858 0.0407779 -0.000614316
+-0.0725241 0.13724 0.0489632
+-0.0620129 0.0587144 0.0113478
+0.0455822 0.0848004 0.0171734
+-0.0839185 0.112898 0.00127069
+-0.0728197 0.155564 0.00463235
+0.0277412 0.121021 0.0227689
+0.0301995 0.0768447 0.0437008
+-0.0106344 0.174261 -0.0225996
+-0.0617342 0.0737271 -0.0167014
+-0.0414956 0.0464933 0.0408152
+0.03243 0.0535036 0.0361605
+-0.0377322 0.150234 -0.00179971
+-0.0847627 0.109032 0.02334
+-0.0642974 0.167953 -0.0385345
+-0.0221614 0.0825281 0.0558751
+-0.0504951 0.0960175 0.0443724
+-0.0508177 0.0501221 0.014822
+-0.0436492 0.0577877 -0.0118151
+-0.0189776 0.0390241 0.0529956
+-0.0623698 0.169401 -0.0505859
+-0.0105368 0.0850533 -0.0384463
+-0.0181795 0.183113 -0.0176247
+0.0314401 0.110365 -0.00894711
+-0.0127075 0.065682 -0.0367743
+-0.0273345 0.172717 -0.009826
+-0.0666857 0.141706 -0.00893584
+0.0408833 0.10285 0.0201769
+-0.0876525 0.145908 0.0330215
+-0.0436328 0.056346 -0.0115255
+-0.0611631 0.0428583 0.0256966
+-0.0330915 0.16076 -0.0136886
+-0.085208 0.150101 0.00618898
+-0.0615069 0.172523 -0.0575905
+0.0555907 0.0604655 -0.000426808
+-0.0850315 0.151395 0.00719993
+-0.0728007 0.0864364 -0.0158265
+-0.003188 0.127967 0.0287063
+0.0455462 0.0861954 0.016167
+-0.0217098 0.115215 -0.0159934
+-0.0414975 0.0916447 0.0424797
+0.0487043 0.0430197 0.0122221
+-0.0869351 0.106366 0.0163624
+-0.0156753 0.0541059 -0.0332392
+-0.06162 0.150156 -0.00124665
+-0.00577101 0.098213 -0.0280417
+0.0223236 0.0550419 -0.0260567
+-0.00429403 0.131101 0.0138416
+-0.0636168 0.143654 -0.00954122
+-0.0855598 0.0912595 -0.00155473
+-0.0404413 0.10705 0.0387043
+0.0547917 0.0553704 0.0263503
+-0.0822116 0.101996 0.0303518
+-0.0437463 0.128889 0.0155826
+-0.0664819 0.0397537 -0.00588584
+-0.067283 0.161835 -0.0137578
+-0.061699 0.0599431 0.00295203
+-0.0715633 0.170815 -0.0500445
+-0.0861137 0.0805676 0.00950062
+-0.0502228 0.125461 0.0326401
+0.0589666 0.0552427 0.017183
+-0.0327176 0.125444 0.0196276
+-0.0632934 0.151996 -0.00122225
+-0.0512927 0.135429 -0.000552487
+-0.0184842 0.0897075 0.0555921
+-0.0260646 0.11803 -0.0129143
+0.0198889 0.0631747 0.0480195
+-0.0465912 0.145038 0.00283923
+0.0534733 0.0728245 0.019221
+-0.0352804 0.0341155 -0.0193879
+-0.0829241 0.126549 -0.00467577
+0.0279852 0.0352646 0.0181572
+-0.0531741 0.150869 0.0213978
+0.0202497 0.0347399 0.020698
+-0.062763 0.149042 -0.0175788
+0.00226918 0.115596 -0.0185376
+0.0250704 0.12404 0.011788
+-0.045498 0.101529 0.0420301
+-0.058497 0.0426323 0.0447374
+0.0455164 0.0904085 0.0121603
+0.0215692 0.0352857 0.025924
+-0.0274987 0.0631476 0.0380009
+-0.0140602 0.172758 -0.0187663
+0.0587826 0.0538552 0.0121765
+-0.0628795 0.15219 -0.00958093
+-0.0468135 0.1536 0.00939603
+-0.0928405 0.121514 0.033281
+-0.0622964 0.150648 -0.0145762
+0.0475064 0.0611159 0.0308231
+0.00412571 0.107297 -0.0203039
+-0.0703978 0.156305 0.0156818
+-0.053643 0.135335 0.0311995
+0.0067064 0.0341407 0.0184863
+-0.0466442 0.0397388 -0.0142756
+0.0119051 0.0711889 0.0540767
+-0.0447375 0.0357143 0.0441717
+-0.0228183 0.0840509 -0.0381648
+-0.023326 0.122164 -0.00726067
+0.0441999 0.0790177 0.0251667
+-0.0276246 0.160982 -0.00149388
+-0.0399791 0.126816 0.018458
+0.0222264 0.09191 -0.0233017
+-0.0627692 0.156841 -0.0155919
+0.044508 0.0412168 0.00624902
+-0.0731279 0.155455 -0.0309078
+0.0183024 0.0347298 -0.00182982
+-0.01652 0.0715906 0.0550352
+-0.091634 0.141989 0.0201675
+0.0440337 0.0734407 -0.000804833
+-0.0524198 0.0648658 0.0346087
+0.0572481 0.0508905 0.0141872
+-0.0164766 0.111102 -0.0196668
+-0.0418874 0.108498 -0.0194287
+0.0321354 0.0549697 0.0375085
+-0.0644897 0.102874 0.0413067
+0.0465079 0.0583728 0.0318256
+-0.0334582 0.0518969 0.0377238
+-0.0729908 0.139888 -0.00698816
+-0.0534544 0.124093 0.0367404
+0.0173165 0.0622663 -0.028279
+-0.0554104 0.0513256 0.00948897
+-0.014903 0.172738 -0.0182312
+-0.0502115 0.141667 0.015397
+0.0229958 0.0375848 0.0332895
+-0.0749615 0.135451 -0.00681495
+-0.0855353 0.0938173 0.0282665
+-0.069508 0.102769 0.0393316
+-0.0205392 0.0971418 -0.0249761
+-0.0312923 0.0362769 0.0513145
+0.0260175 0.0991397 -0.0189626
+-0.00594641 0.0989148 -0.0267499
+-0.0708605 0.0347825 0.00928864
+-0.0845393 0.103233 0.0269979
+0.0406232 0.0953057 0.0289912
+-0.0456818 0.0650665 -0.0140257
+-0.0326318 0.168236 -0.00522072
+-0.0765723 0.0689281 0.00553415
+-0.0176728 0.049548 -0.0303695
+0.00113463 0.130461 0.00151005
+-0.08699 0.0859713 0.00247197
+-0.0338357 0.095789 -0.0234311
+-0.0304987 0.10293 0.0419798
+0.0336335 0.0713894 0.0398251
+-0.0224957 0.101642 0.0440993
+0.0309373 0.119109 0.0111337
+-0.0734894 0.156164 0.020416
+-0.000755237 0.0740961 -0.035785
+0.0354988 0.0469226 0.030944
+-0.00617179 0.128513 -0.00228639
+-0.00460988 0.0388908 -0.00276124
+-0.0678289 0.135464 0.0458614
+0.0345596 0.114411 0.00388032
+-0.0884532 0.112251 0.0353052
+-0.0709934 0.170517 -0.0295248
+0.0284454 0.0995183 0.0412905
+0.0402167 0.0685122 0.0317439
+-0.0665769 0.0362823 0.0365183
+-0.0765583 0.148625 -0.00886956
+0.0576507 0.0606695 0.00219201
+0.060413 0.0664733 0.017165
+0.022246 0.0835763 0.0498509
+-0.0821459 0.0912329 0.0320422
+-0.0746727 0.145787 -0.00986958
+0.0345089 0.111329 0.0271807
+0.0594367 0.0663847 0.00713811
+0.0282217 0.0664463 -0.0207545
+-0.0619747 0.170963 -0.0535908
+-0.0394944 0.0492076 0.0395541
+-0.0787666 0.165266 -0.0299591
+-0.0749441 0.129634 -0.00796551
+-0.00112962 0.125371 0.0323555
+-0.0154803 0.0500282 0.047966
+0.0153592 0.0953434 0.0487033
+-0.085237 0.147388 0.00618456
+-0.0128008 0.0841443 -0.0388521
+0.024383 0.0518665 -0.0223004
+-0.0342551 0.0766309 -0.0244955
+-0.0670839 0.173532 -0.0453192
+-0.0772544 0.0764799 0.0316515
+-0.0270646 0.053566 0.0376661
+-0.0225205 0.112681 0.0384786
+-0.0884304 0.0874699 0.00847782
+-0.0737584 0.0914853 0.0405847
+-0.064968 0.128232 -0.00872903
+0.000512384 0.127929 0.028588
+-0.0599553 0.0610872 0.0239566
+-0.0384792 0.116679 0.0322191
+-0.0485119 0.112536 -0.0170517
+-0.0304781 0.0523954 -0.0163632
+0.0387588 0.108855 0.00681782
+-0.0406156 0.155109 0.0060988
+-0.0471466 0.149481 -0.0040486
+0.0179495 0.127337 0.00345096
+-0.0395837 0.0336987 -0.0198537
+-0.0633751 0.0344193 0.0288044
+-0.0424853 0.128365 0.0145816
+-0.0364913 0.113889 0.0338295
+0.0353283 0.112832 0.00268414
+-0.0653226 0.0343003 0.0144151
+0.0435313 0.065065 0.0273105
+-0.0795726 0.0867837 -0.00954059
+-0.0104381 0.171321 -0.0205524
+-0.0737003 0.156269 0.0145144
+-0.0733818 0.155466 -0.0289107
+-0.0198527 0.0382258 0.0238627
+-0.0188257 0.0725897 0.0542693
+-0.0778777 0.117832 -0.00599287
+-0.0365049 0.10423 0.0397359
+-0.00948278 0.0978353 0.051868
+-0.0103201 0.0393296 0.0497389
+-0.0876274 0.137747 0.00620032
+0.0416732 0.0819555 0.0304093
+0.0608524 0.0609661 0.0101561
+-0.0767143 0.154218 -0.0048969
+0.0174945 0.0838575 0.0514031
+-0.066433 0.0337378 -0.00503676
+-0.0232113 0.177135 -0.0206374
+0.0100949 0.034771 0.018605
+0.042675 0.0751161 0.0282624
+-0.0866662 0.0833296 0.0114916
+-0.0504965 0.157865 0.00943584
+0.0433406 0.0973216 0.0191637
+-0.0888303 0.0915034 0.00845607
+-0.0555242 0.0415797 -0.00918326
+-0.0337405 0.075174 -0.025488
+-0.0906275 0.137865 0.0211926
+-0.0123027 0.0389534 -0.0136872
+-0.045835 0.0941966 -0.0219229
+-0.0238433 0.163025 -0.0155105
+-0.0522937 0.12758 -0.00475935
+0.0308793 0.0356029 0.0166157
+0.0423563 0.0588819 -0.00453174
+-0.00663392 0.0466819 -0.0297341
+-0.0484493 0.0656843 0.0374132
+-0.0270407 0.125883 0.0113821
+-0.0910269 0.129538 0.0072515
+-0.0455907 0.0447683 -0.0109766
+0.00905498 0.0971664 -0.0248901
+0.00396755 0.0341147 0.00886829
+0.00550365 0.123767 0.0339438
+0.0400787 0.0432895 0.0279756
+-0.00815712 0.126302 0.0298556
+-0.0609217 0.118124 -0.010668
+-0.0141549 0.129252 0.0145753
+0.0274448 0.120188 0.0255104
+-0.0485004 0.111187 0.0370789
+0.0451596 0.0789195 0.0230398
+-0.0138991 0.162654 -0.0155462
+-0.0528814 0.0447887 0.0196824
+0.0277468 0.0465681 -0.0107176
+-0.0580291 0.124109 0.0406616
+-0.0404897 0.0874362 0.0429424
+0.0316544 0.117354 0.0228159
+0.0277648 0.098182 0.0420578
+-0.0391765 0.165177 -0.0125287
+-0.0691207 0.112747 0.0474107
+-0.0614963 0.102908 0.0417081
+0.0393676 0.0927337 0.0325144
+0.0214921 0.125223 0.0232941
+-0.0167077 0.059948 -0.0356741
+-0.0619704 0.118373 0.041992
+-0.0359339 0.109235 -0.0196158
+-0.0150259 0.185694 -0.0231645
+0.0245929 0.0577938 0.0442192
+-0.00233157 0.122878 -0.010278
+-0.0434949 0.0817618 0.042266
+0.0298844 0.0350171 0.0132987
+-0.00424346 0.0409986 0.0479883
+-0.0776115 0.15005 -0.0049035
+-0.0124244 0.108763 -0.0212047
+-0.0798966 0.083235 0.0342815
+-0.0813623 0.104616 -0.00457868
+-0.0167402 0.0671791 -0.0380101
+0.0259555 0.123153 0.0178233
+0.0406613 0.0638232 0.0297482
+-0.0129458 0.117871 -0.0148632
+-0.0708515 0.0937008 -0.0159297
+-0.0688238 0.1383 0.0462399
+-0.0886846 0.136388 0.00720801
+0.0460186 0.0714912 0.0208033
+0.0465334 0.07646 0.0111853
+0.000795729 0.0345137 0.0115011
+0.0318042 0.0661523 0.0406683
+-0.0277917 0.0810724 -0.036339
+-0.012329 0.0361667 0.050366
+-0.0672863 0.151256 -0.0426939
+0.0328851 0.0556122 -0.0127142
+-0.0444939 0.107088 0.0401229
+-0.088037 0.113814 0.026966
+-0.0228073 0.184465 -0.0170667
+-0.00369909 0.0598617 -0.0340393
+-0.0698551 0.16523 -0.017589
+-0.0464984 0.047794 0.0396541
+-0.0756919 0.143067 -0.00582827
+-0.0208788 0.0383361 0.00183886
+-0.0768287 0.154208 -0.00589938
+-0.0147866 0.0799249 -0.0391233
+-0.0699384 0.150598 0.0380766
+-0.0866088 0.126656 -0.00171455
+-0.0792409 0.168033 -0.0359701
+-0.0650871 0.0417056 0.03635
+0.0353256 0.109535 -0.00390394
+0.00651309 0.0828012 0.0562471
+-0.0512535 0.0528689 0.0137817
+-0.0635072 0.0590749 0.0125217
+-0.0892074 0.127019 0.0449806
+0.0451896 0.0875706 0.0191665
+-0.0576689 0.0350157 0.0450337
+-0.0441239 0.129077 0.0169132
+0.00351519 0.0634007 0.0566286
+-0.0456618 0.0741031 -0.0174455
+-0.045802 0.0382259 -0.0192856
+-0.0774749 0.141413 0.0470689
+0.019092 0.0350694 0.0292369
+-0.0721908 0.176974 -0.0457483
+-0.0228049 0.0784515 -0.0385457
+-0.0196863 0.0539295 -0.0316066
+0.0370985 0.0632585 0.0359995
+-0.0097823 0.0613531 -0.0352263
+-0.0518485 0.147799 0.0174109
+-0.0424957 0.11253 0.0356818
+-0.00161218 0.0387745 0.0252993
+0.0432025 0.0777701 0.0272794
+0.0158912 0.0644868 0.0510299
+-0.0624956 0.0861834 0.0447184
+0.0226823 0.0605452 0.0467602
+-0.0345153 0.0780634 -0.0235017
+-0.0693572 0.156301 0.0160519
+-0.0848272 0.110715 0.0391424
+0.00397477 0.0389229 -0.0104191
+-0.0107444 0.0685007 -0.0365794
+0.0105122 0.0673666 0.0542979
+-0.0493982 0.113885 -0.0164603
+0.0292359 0.120576 0.0147663
+0.0143954 0.0433708 -0.024029
+-0.0548811 0.099887 -0.0210509
+-0.0345638 0.113971 -0.0166195
+-0.00945158 0.0346766 0.0453022
+-0.0114995 0.0486859 0.0490069
+0.047721 0.0729559 0.00883547
+0.00782583 0.131487 0.0111342
+0.018385 0.126365 0.000765748
+-0.0801977 0.117632 0.0490824
+0.0508224 0.0446928 0.0102182
+-0.0792484 0.154932 0.0111245
+-0.0616259 0.175734 -0.0596865
+-0.0554957 0.10156 0.042627
+-0.0693451 0.162383 -0.0509602
+0.0464905 0.0624784 0.0299685
+-0.0626979 0.149033 -0.0165859
+-0.027787 0.0838632 -0.0360686
+-0.068908 0.112267 -0.0105177
+-0.0464636 0.157957 0.00818306
+-0.0656199 0.0690554 -0.0100807
+-0.0594903 0.081873 0.0434438
+-0.042501 0.0803745 0.0423542
+-0.0715599 0.0733863 -0.0105456
+-0.00392373 0.129832 0.00104637
+0.0231411 0.0844685 -0.0255261
+-0.0582906 0.0411368 0.01871
+-0.0231503 0.121506 -0.00857745
+0.0353371 0.0534224 -0.00701071
+-0.028498 0.108421 0.0390601
+-0.0161996 0.0386499 0.0314325
+0.0417053 0.0943445 -0.00480688
+-0.037505 0.0874848 0.0436782
+-0.0859867 0.140484 0.00417932
+-0.0394569 0.124785 -0.00795634
+-0.0629125 0.111049 -0.0145904
+-0.0697706 0.0337438 0.00328799
+0.0353216 0.0863185 -0.0174167
+-0.0529232 0.125495 0.0357533
+-0.0145001 0.0870236 0.0569643
+-0.00422597 0.10111 -0.0231367
+0.026954 0.114984 -0.00791167
+0.0123614 0.0509077 -0.0278502
+-0.0705953 0.157132 -0.0018785
+-0.0270301 0.0604609 -0.0294673
+-0.0252429 0.163867 -0.00684922
+0.0164575 0.0900289 -0.0273543
+0.0182356 0.126981 0.00216332
+-0.0276261 0.15573 -0.00786612
+-0.0687195 0.165823 -0.0200644
+-0.0237576 0.0713185 -0.0373359
+-0.0350727 0.157773 -0.0116201
+-0.0115095 0.129073 0.00398865
+-0.000506085 0.0442149 0.046198
+0.0372544 0.109701 0.0220387
+-0.0154921 0.0382096 0.0157388
+-0.0500202 0.131989 -0.0014354
+-0.025472 0.0851651 0.0520429
+-0.0328435 0.125555 0.000439943
+-0.0773991 0.152954 0.0323974
+-0.0504161 0.144734 0.0123765
+-0.0576549 0.124438 -0.00742698
+0.0532901 0.0621073 -0.00218568
+-0.0298754 0.0748068 -0.0335581
+-0.0642433 0.0338438 0.0114826
+-0.0316113 0.0409091 -0.0301005
+0.00142887 0.0392678 -0.00936829
+0.0274179 0.122108 0.0155174
+-0.0144987 0.0884006 0.0568363
+-0.0184962 0.109943 0.0409607
+0.0379028 0.0997575 -0.00879746
+-0.0244855 0.0461464 0.0516096
+0.03717 0.0713299 0.0361376
+0.0442521 0.0804694 -0.00179963
+-0.0693598 0.153979 -0.049866
+-0.045049 0.0367204 -0.0222184
+0.0226853 0.115014 -0.0119595
+0.0308676 0.0713453 0.0410867
+-0.0253533 0.0381958 0.00468802
+0.0115087 0.101793 0.0474223
+0.0122157 0.0346138 -0.0197432
+-0.078807 0.10613 0.032485
+0.0412927 0.101424 0.0211601
+0.0449984 0.0413097 0.00725015
+-0.0614983 0.0861808 0.0447299
+0.0201601 0.0357218 -0.00467829
+-0.0270641 0.0376545 -0.0293745
+-0.0491197 0.137061 0.00540677
+-0.00249881 0.0829011 0.0575494
+0.021052 0.0358187 -0.0026817
+-0.0154895 0.0559453 0.0511175
+-0.0718433 0.0833097 0.0403454
+-0.087976 0.141871 0.0376917
+-0.0787586 0.163869 -0.0289482
+-0.0485008 0.0732772 0.0415918
+-0.0366615 0.0606699 -0.0121541
+0.0262206 0.0435744 -0.00668237
+0.000219502 0.0370979 0.0467851
+-0.00149685 0.0456811 0.047029
+-0.0545635 0.122251 -0.00910565
+-0.0186556 0.0480312 -0.0293255
+0.0387854 0.0701818 -0.0117862
+-0.0654945 0.0398115 -0.0063825
+-0.0437744 0.116579 -0.0153348
+-0.0344901 0.0987486 0.043091
+0.0610023 0.062364 0.012157
+0.0141007 0.120583 0.0346592
+-0.0823269 0.108767 -0.000607289
+0.0214843 0.092023 0.0479434
+-0.070667 0.0763937 -0.014042
+0.021114 0.0592021 0.0480036
+0.0252499 0.0775815 -0.0248688
+-0.0601377 0.0338299 0.0176745
+-0.0579501 0.0592474 0.0206872
+-0.0769058 0.154074 0.0295482
+0.0198639 0.11968 -0.0089705
+0.0022305 0.0754937 -0.0353597
+-0.00780413 0.0840976 -0.0379648
+-0.0611789 0.172541 -0.0596341
+-0.0447417 0.0768063 -0.0185987
+-0.017374 0.0569064 0.0504968
+0.00450466 0.087016 0.0568401
+-0.0709391 0.109631 0.0395791
+-0.0674006 0.0406253 -0.00334064
+-0.0311093 0.169745 -0.00652433
+0.0242906 0.0676576 -0.0247124
+-0.0326084 0.171239 -0.00339173
+-0.0325897 0.0666513 -0.0194517
+0.0319052 0.0437397 0.0295375
+-0.0450254 0.127281 -0.00449582
+-0.0226309 0.0478785 -0.0276417
+-0.0583127 0.0580812 0.00726379
+-0.037778 0.0827556 -0.0219531
+-0.0518874 0.106988 -0.0190452
+0.0163996 0.044784 -0.0236657
+0.0103374 0.0553349 -0.0300221
+0.0206753 0.126786 0.0115854
+-0.0850979 0.131233 0.0492505
+-0.0192324 0.177141 -0.0234526
+-0.0199616 0.0697296 0.0526775
+-0.0561055 0.158254 0.000206899
+-0.055732 0.115927 -0.0145408
+-0.0417663 0.162365 0.00442786
+-0.0305905 0.119479 -0.0103702
+0.0234999 0.0955508 0.0464417
+-0.0498856 0.149233 0.0119087
+-0.0154824 0.185702 -0.0219175
+0.00917376 0.125511 -0.00726227
+-0.0913426 0.147495 0.0231401
+-0.00381375 0.0896299 -0.0357356
+-0.0686943 0.154419 0.0308917
+-0.02552 0.111233 0.0379672
+-0.0705473 0.1414 0.0460484
+-0.00201946 0.100869 0.0458524
+-0.0876244 0.129442 0.00130199
+-0.00449535 0.0965559 0.0536663
+-0.0271292 0.0850573 0.0494379
+-0.0914908 0.1337 0.0152201
+0.00523694 0.126704 0.0302977
+-0.0470651 0.153179 -0.00606436
+-0.0672153 0.156284 0.0168104
+-0.0427934 0.0869807 -0.0215837
+0.0423379 0.0683118 0.0277209
+-0.0295859 0.0790353 -0.0345348
+-0.0477964 0.062891 0.036824
+-0.00968443 0.0570101 -0.0338896
+0.0451851 0.0861731 0.0211635
+0.00951284 0.0532319 0.0521285
+0.0302906 0.0787129 -0.0208549
+-0.0738862 0.104992 -0.0108534
+0.0453646 0.0575572 -0.00557548
+-0.0663103 0.0759418 0.0397029
+0.0143833 0.128699 0.00214848
+0.00580886 0.130668 0.0218239
+-0.0131274 0.0387957 -0.00624825
+-0.00997898 0.172997 -0.0279186
+-0.0620827 0.174072 -0.0556227
+-0.0546337 0.0334816 0.0119976
+0.0208676 0.121124 0.0316774
+0.0220436 0.125932 0.0163676
+0.0377227 0.0561747 0.0314909
+-0.0721609 0.147032 -0.0238695
+-0.0738111 0.0907253 -0.0150698
+-0.0362217 0.0335837 -0.0228111
+0.0387097 0.105846 2.20656e-05
+-0.0556277 0.0365615 0.0468082
+-0.0836005 0.0763298 0.006515
+0.0280677 0.100848 0.0407486
+-0.0831241 0.100626 0.0298981
+-0.0305493 0.0479587 -0.0242789
+0.0165747 0.0519808 0.0466207
+0.0447673 0.0847221 0.00118921
+-0.0146056 0.0435263 -0.0269315
+0.0273074 0.0346174 0.0112772
+-0.0683005 0.139737 0.0452157
+-0.0485925 0.132707 0.00186362
+0.00897502 0.113705 0.0394792
+0.010104 0.0343592 -0.0200136
+-0.0769339 0.126684 -0.00758482
+0.00350625 0.0547769 0.0535608
+-0.0850528 0.0993835 -0.000573805
+0.00144009 0.0350568 0.0184024
+-0.0301745 0.17266 -0.0167996
+-0.0732751 0.148715 -0.0303812
+-0.0837086 0.0952625 0.0306499
+-0.0742711 0.149885 -0.0318724
+-0.00654578 0.0384949 0.010053
+-0.0248989 0.0968475 -0.0246804
+-0.0633856 0.148243 -0.0195768
+-0.0647288 0.126998 0.0468559
+-0.058406 0.0598457 0.000248469
+0.0425358 0.0710418 0.0280089
+-0.0915343 0.140602 0.0181819
+-0.0407824 0.116214 -0.0149415
+-0.0445073 0.0491885 0.039305
+0.0294698 0.0801098 -0.0210213
+-0.0277559 0.0348695 0.0499059
+-0.0137302 0.107232 -0.0215702
+-0.0482685 0.037339 -0.0123839
+-0.0673815 0.0659915 0.0287149
+-0.0567046 0.11983 0.0390246
+0.0211901 0.113994 0.0360983
+0.0319596 0.11565 0.0257836
+-0.050462 0.0402796 0.0458238
+-0.0364752 0.09732 0.0430461
+0.00119043 0.0895238 -0.0341779
+-0.0699807 0.149351 0.039589
+0.0439472 0.0917185 0.0231564
+-0.0559199 0.113507 -0.0160179
+-0.0853556 0.095327 -0.00158429
+-0.0662723 0.154476 -0.00173975
+-0.0186027 0.111108 -0.0196906
+-0.0563562 0.140993 0.0307629
+-0.00358231 0.0383094 0.0162632
+-0.0568935 0.0562594 0.000567085
+-0.00649422 0.0590504 0.0549316
+-0.0245507 0.183147 -0.010424
+-0.032468 0.175717 -0.00291757
+-0.0132616 0.175663 -0.0275653
+0.00407218 0.0361395 0.0234015
+-0.00250245 0.104479 0.0441797
+0.00787676 0.127927 0.0283381
+-0.0760841 0.164579 -0.0198769
+-0.0814657 0.130234 0.0522094
+0.0322493 0.109934 -0.00848346
+-0.0747758 0.152715 -0.0228916
+-0.0360726 0.1261 0.0198793
+0.00651921 0.0869957 0.0564058
+-0.0863282 0.151358 0.00923307
+-0.00766666 0.0527037 -0.0328501
+0.0329828 0.110047 0.0302661
+-0.0819069 0.0844754 0.0320139
+0.020413 0.0521197 0.0451417
+-0.043267 0.149185 0.00566881
+0.03267 0.0767015 -0.0187757
+-0.0861456 0.140625 0.0415389
+-0.0665323 0.154667 0.00252946
+-0.0231566 0.158136 -0.0102789
+-0.0217907 0.0957944 0.0466571
+-0.0638349 0.156748 -0.0426051
+-0.0346441 0.117803 -0.0126135
+0.00980894 0.0658051 0.0545289
+-0.080258 0.0859229 0.0345477
+-0.0117542 0.0386862 -0.015202
+-0.080536 0.135397 0.0502642
+-0.0325368 0.0792892 -0.0295289
+-0.0784828 0.0717889 0.00251767
+-0.00149343 0.0883979 0.0566431
+-0.0137942 0.0386802 -0.0156021
+-0.0444896 0.101534 0.0420576
+-0.00192307 0.107424 -0.021877
+-0.0440699 0.153194 -0.00699527
+0.00318991 0.0880718 -0.0337792
+-0.0344943 0.0718865 0.0415833
+-0.030416 0.0692532 -0.0284548
+-0.0622359 0.167822 -0.0495929
+-0.0344858 0.100109 0.0424402
+0.00649387 0.0590149 0.0539921
+0.0360791 0.111295 0.00152105
+-0.0587368 0.0434475 0.0440841
+-0.0417025 0.0666657 -0.0153449
+-0.0533816 0.0513995 0.0117052
+-0.0285002 0.097396 0.0440561
+-0.0690491 0.153118 -0.0485047
+-0.0144923 0.093841 0.0546527
+-0.0633747 0.036885 -0.0080479
+-0.0706693 0.165215 -0.0479768
+0.0127157 0.0350729 0.0423657
+0.00853944 0.100396 0.0475311
+0.0211162 0.126093 0.00605375
+-0.0514924 0.113914 0.0348157
+0.0172187 0.117738 -0.0128881
+-0.01069 0.0969192 -0.0307004
+0.0121568 0.0930338 -0.0284961
+-0.0772387 0.158974 -0.0142914
+-0.0667905 0.0852019 -0.0183581
+0.0154254 0.0834009 0.0522607
+-0.0487147 0.0723044 -0.01565
+-0.0464696 0.0675313 0.0396048
+-0.0110203 0.0383532 0.0129011
+-0.0205151 0.114503 -0.0172551
+-0.0556769 0.0499718 0.00979142
+-0.0503626 0.0642656 0.0349674
+-0.00189958 0.130575 0.00323807
+-0.00749418 0.0533074 0.0526841
+-0.0781504 0.0736081 0.0268981
+-0.00216638 0.09997 -0.023881
+-0.0374964 0.119384 0.0304732
+-0.0237883 0.0932085 0.0487292
+-0.0846322 0.139314 0.044315
+0.00579995 0.0355749 0.0242599
+-0.0498385 0.0970763 -0.0221981
+0.0311277 0.0795524 0.0433085
+-0.080771 0.105947 -0.00458985
+-0.0541694 0.136721 0.0304424
+-0.0158788 0.038593 -0.0159367
+0.0375503 0.0588742 -0.00872526
+-0.0278572 0.0972984 -0.0239915
+-0.0609119 0.0678343 0.0355003
+0.0406749 0.0801882 -0.00878559
+-0.0891047 0.101026 0.0153901
+0.0370023 0.11146 0.00905905
+-0.00649525 0.0576581 0.0543368
+0.0215982 0.0645366 0.046975
+-0.0290293 0.160675 -0.0139931
+0.00903586 0.100133 -0.0220275
+-0.0584961 0.104303 0.041452
+-0.0664115 0.162305 -0.0579417
+0.0239006 0.0520481 0.0413924
+-0.0216874 0.126575 0.00458035
+-0.0485184 0.0438796 0.0435224
+-0.0231474 0.0384868 -0.00611954
+-0.00826521 0.0380456 0.0491273
+-0.0528526 0.147782 0.0214111
+-0.0907516 0.137857 0.0201957
+-0.0758557 0.103473 -0.0101675
+-0.0397582 0.079747 -0.0196231
+-0.0147733 0.078434 -0.0385776
+0.00381296 0.0379313 -0.0132938
+-0.0694673 0.0635361 0.0216095
+-0.0528954 0.105563 -0.0191967
+0.0343906 0.0529675 -0.00763383
+-0.0293172 0.172724 -0.00740528
+0.00850711 0.0688384 0.055257
+-0.016261 0.181575 -0.0262548
+0.0213104 0.0415776 -0.0147
+-0.0780733 0.100357 -0.00962255
+-0.0846334 0.108922 0.00436756
+-0.0186964 0.0569405 -0.033635
+-0.037924 0.175153 -0.00739726
+-0.049768 0.081217 -0.020889
+0.0335081 0.0942386 0.0398247
+-0.0729901 0.154042 -0.0338982
+-0.0233975 0.156883 -0.00572928
+-0.0873262 0.103661 0.0203534
+-0.0501055 0.129693 0.0310292
+0.029581 0.0907082 -0.0200166
+0.043329 0.066441 -0.000599376
+-0.00664168 0.0482162 -0.0304375
+0.021889 0.0963552 -0.0220144
+-0.0265893 0.161003 -0.00174275
+0.044803 0.0945847 0.0121616
+-0.0725608 0.109721 0.0409258
+-0.0372497 0.126436 -0.00264816
+0.005339 0.0971934 -0.026912
+-0.0241177 0.120704 -0.00972559
+-0.0462757 0.0390662 0.0448146
+-0.00565778 0.12946 0.000751082
+0.0213227 0.122349 -0.00385694
+-0.0414913 0.0790271 0.0430475
+0.0190905 0.127062 0.0195525
+-0.0805286 0.124537 0.0519983
+-0.0782836 0.0860139 0.0367982
+0.0219644 0.126042 0.013483
+-0.0325696 0.0410226 0.0505793
+0.0295979 0.039453 0.0274445
+-0.0475678 0.0446906 -0.0104074
+-0.0654918 0.0917539 0.043991
+-0.0307813 0.122738 0.0233033
+-0.0854845 0.112639 0.0445732
+0.0231366 0.0404268 -0.00664294
+-0.00398687 0.126095 0.0313534
+-0.0641503 0.0436305 0.0113748
+-0.0314872 0.0646167 0.0387865
+-0.0776274 0.0692865 0.00957677
+-0.0195579 0.0946763 0.0515134
+0.014517 0.0344542 -0.0117299
+-0.0376663 0.0621956 -0.0129723
+0.00459507 0.101613 0.0450146
+-0.0281642 0.0346776 -0.0203658
+0.0147654 0.125019 -0.0047274
+-0.0344283 0.0338921 0.0139586
+-0.0364985 0.117968 0.0313259
+-0.0456444 0.0592254 -0.0120696
+-0.0260288 0.0381935 0.00636573
+-0.088169 0.124336 0.0468831
+-0.0540681 0.135339 -0.00310003
+-0.0291607 0.171183 -0.0175503
+0.0104455 0.0488162 0.0487077
+-0.0881632 0.0861128 0.0124706
+-0.0258758 0.0578187 0.0391737
+0.00450037 0.0427385 0.0456181
+-0.0537204 0.0491564 0.0326591
+0.0388727 0.0645792 -0.00975725
+-0.0500679 0.0501277 0.0166633
+-0.0669104 0.120913 -0.00889891
+-0.036233 0.0469115 -0.0220883
+-0.0118859 0.163867 -0.0168515
+-0.0619905 0.129678 -0.00799355
+-0.0652279 0.0397522 0.0288372
+-0.0508809 0.104197 -0.0202021
+-0.00186382 0.104504 -0.0225214
+-0.0619023 0.120903 -0.00899386
+0.00323955 0.0754773 -0.0351385
+-0.0384934 0.105604 0.0386511
+-0.0905225 0.118622 0.0053153
+-0.0284893 0.0835322 0.0466293
+0.00823162 0.0387858 0.0309201
+-0.0616053 0.156855 -0.0285887
+-0.0508615 0.101367 -0.0215394
+-0.0318582 0.102916 -0.0222908
+0.00526525 0.0350275 0.0444668
+-0.0646344 0.0337755 0.00968147
+-0.0640121 0.136992 -0.00763419
+-0.0456074 0.0345826 0.0394197
+-0.0864043 0.111678 0.00530063
+-0.0207807 0.0581858 0.0468036
+-0.0608886 0.105445 -0.0177606
+0.0417928 0.0746499 -0.00676608
+0.0195225 0.0821843 0.0511684
+-0.0464961 0.0833304 0.0442498
+0.0164933 0.119532 0.0345952
+-0.0626731 0.158367 -0.0396045
+0.00725591 0.129807 0.000165614
+-0.0909094 0.114612 0.0400043
+-0.0496217 0.0532216 -0.00894483
+-0.0204558 0.0772045 0.0549311
+-0.0225647 0.184728 -0.0122995
+-0.0389284 0.111648 -0.0181691
+-0.0312712 0.125373 0.00251041
+-0.0157734 0.075693 -0.0388238
+0.0245364 0.0862451 0.0478999
+-0.0296756 0.125596 0.0148252
+-0.0446861 0.130064 0.0166863
+-0.0225936 0.0382891 0.00334965
+-0.0787949 0.0758277 -0.00557109
+-0.0665305 0.155586 -0.0523326
+-0.0631388 0.0620641 0.0242
+0.0275571 0.0875682 0.0452466
+-0.0838788 0.153353 0.0242347
+-0.0365497 0.124951 0.0226726
+0.0318595 0.0673315 0.0407335
+0.00950257 0.0896505 0.0545501
+-0.0597218 0.118329 0.0399103
+-0.0840037 0.0992695 0.0294026
+-0.0777723 0.0832737 0.0363717
+0.0427594 0.0986702 0.00117933
+-0.0422677 0.111306 -0.0177858
+-0.0762231 0.16043 -0.0125715
+-0.0634008 0.115527 0.0417242
+-0.036507 0.106984 0.0382357
+-0.0384749 0.0351927 -0.0135871
+-0.0744578 0.144386 -0.00789461
+0.0593202 0.0701868 0.012517
+-0.0226744 0.0522819 -0.0290541
+-0.0875766 0.122583 -0.000713178
+-0.0170034 0.127025 0.0015954
+-0.0705369 0.155342 -0.0479286
+-0.0709342 0.128224 -0.00904999
+0.00705252 0.0346309 0.0397936
+-0.0585604 0.133937 0.0364008
+-0.0863384 0.102179 0.00442425
+0.0107631 0.0671702 0.0541647
+-0.0695537 0.163673 -0.0146023
+-0.0452915 0.1298 0.0046882
+0.00836647 0.0494746 -0.0282442
+-0.0691053 0.0641529 -0.000471523
+-0.0065051 0.0518538 0.05236
+-0.0557789 0.0811944 -0.0212002
+-0.0801928 0.109885 0.0408487
+-0.0136098 0.0997657 0.0454373
+0.0375013 0.045461 0.0306904
+-0.0857877 0.152992 0.0221351
+-0.00139702 0.0346206 0.0416594
+-0.0501963 0.061364 0.033592
+0.0161097 0.0974052 -0.0230873
+-0.0194917 0.0568426 0.0483686
+0.0492985 0.0561391 -0.00508332
+0.0184753 0.100361 0.0464541
+-0.0504953 0.154968 0.0107183
+0.0147875 0.105075 -0.0193
+0.023524 0.11536 0.0341991
+0.0310013 0.118944 0.0140014
+-0.0172406 0.178621 -0.0252251
+-0.0367055 0.112873 -0.0174612
+-0.026888 0.0344315 -0.0290471
+-0.052616 0.0542078 0.012269
+-0.0374932 0.0478153 0.0397186
+-0.0727381 0.151148 -0.0398146
+0.0042421 0.0740405 -0.0347398
+-0.0170835 0.187214 -0.0216216
+-0.0744375 0.0658205 0.00791081
+-0.0225303 0.159751 -0.00283877
+-0.015413 0.0343578 -0.0194213
+0.0138178 0.034673 0.033937
+-0.0756035 0.0846721 0.0383975
+-0.0823671 0.0939609 0.0321712
+-0.0597053 0.0675469 -0.0111319
+-0.0911321 0.146088 0.0161475
+0.0350128 0.0797448 -0.0167143
+-0.0835371 0.151134 0.0310567
+-0.0125098 0.0759113 0.0569785
+-0.014877 0.12853 0.00563728
+-0.067594 0.162379 -0.0559888
+-0.0299722 0.0523401 -0.0183637
+-0.0175125 0.109971 0.0410978
+-0.0602175 0.0443014 -0.00489461
+0.047415 0.0539813 0.0314992
+-0.0695317 0.0366687 -0.00405392
+-0.0710533 0.04057 0.0057746
+-0.0594926 0.112518 0.0361699
+-0.0870454 0.128039 -0.000695727
+-0.0548606 0.0532734 -0.00439052
+0.0197584 0.121448 -0.00690816
+-0.0217284 0.0919768 0.0523353
+-0.0331407 0.073693 -0.0254949
+-0.0165233 0.0472885 0.0494939
+0.0430185 0.100102 0.00517011
+-0.0941673 0.124186 0.0242853
+0.0398988 0.106999 0.0131638
+-0.0388567 0.0985732 -0.0220835
+-0.013744 0.0347692 0.0478272
+0.0525444 0.0728335 0.00848027
+0.0340202 0.108707 0.0300072
+0.0135389 0.0341511 0.00148413
+-0.0255703 0.121939 -0.00698176
+-0.0627659 0.0795658 -0.0187488
+0.0159163 0.0366121 0.0434543
+-0.0677812 0.0823162 -0.0178553
+-0.00231448 0.129778 0.000344647
+-0.0224096 0.15809 -0.00961754
+-0.0369427 0.15804 0.00437449
+-0.0557441 0.0768187 -0.0193441
+-0.0661875 0.165349 -0.0586121
+-0.0764308 0.11585 0.051182
+0.00923994 0.0795457 -0.0327494
+-0.0141356 0.103403 -0.0235224
+-0.0725643 0.165173 -0.0170441
+-0.0708131 0.0922561 -0.0160967
+-0.052837 0.143168 0.022419
+-0.0289488 0.0487095 0.0453204
+-0.033511 0.104273 0.0404948
+0.0173468 0.0552065 -0.0282783
+-0.0643722 0.0392301 0.0399397
+0.0154605 0.100515 0.0471558
+-0.0389991 0.0361252 0.0429011
+-0.0912831 0.133698 0.0142161
+-0.042206 0.166657 -0.0103803
+-0.0829702 0.111001 0.0428895
+-0.0244677 0.122018 -0.00707965
+-0.00847955 0.107265 0.0437628
+-0.0410173 0.12678 -0.00403845
+-0.00247117 0.091392 -0.0349524
+-0.0733228 0.17276 -0.036126
+-0.0584972 0.102936 0.0420973
+-0.0275816 0.0549129 -0.0253866
+-0.0567567 0.0416998 -0.00856929
+0.00796329 0.0376774 0.0282412
+-0.0764966 0.130271 0.0529935
+-0.0385029 0.0346069 0.040918
+-0.0178242 0.0882801 -0.0380186
+-0.0592916 0.0381211 0.04617
+-0.0507734 0.0826521 -0.0214824
+-0.011501 0.0787467 0.0576654
+0.0135076 0.115425 0.0371825
+-0.0649944 0.132589 -0.00831046
+0.00449953 0.0474774 0.0501288
+-0.0183564 0.0639745 0.0512546
+-0.0454992 0.0425256 0.0437126
+0.00186325 0.0380873 -0.0138264
+0.0213321 0.100802 0.0450693
+-0.0855641 0.121149 -0.00272592
+-0.0898794 0.136494 0.0232114
+-0.0498262 0.0941747 -0.0218116
+0.0413792 0.0533854 -0.00680998
+-0.0912918 0.11477 0.0353243
+0.0585317 0.0565811 0.0212119
+0.000449556 0.130948 0.00412356
+-0.0343831 0.0766477 -0.0234928
+-0.0394659 0.108422 0.0377073
+-0.0477552 0.161949 -0.00697323
+-0.0278288 0.122593 -0.00568164
+-0.0563034 0.124125 0.0396482
+-0.0656415 0.129793 0.0454963
+0.0484031 0.0553841 0.03118
+-0.0455014 0.116621 0.0320048
+-0.0728613 0.102198 -0.0128504
+-0.0867252 0.0994863 0.00342747
+-0.00226785 0.0370021 0.0122687
+-0.0557143 0.0709328 -0.0156898
+-0.0610115 0.132585 -0.00747053
+0.00217526 0.0894962 -0.0338845
+-0.012585 0.0933765 -0.0350613
+-0.0553875 0.143884 0.0305002
+-0.0920989 0.117453 0.031314
+-0.0616144 0.155309 -0.0245851
+0.0502575 0.0602229 -0.00418894
+-0.0735402 0.0708078 0.0302704
+0.00614005 0.103026 -0.0213684
+-0.00271026 0.0669475 -0.0345168
+-0.049518 0.0344739 0.029929
+-0.0525731 0.128311 0.0345149
+-0.0605331 0.151186 -0.000375192
+-0.0866695 0.135213 0.0450386
+-0.0515626 0.0460585 0.0186779
+-0.00891802 0.0982381 -0.0280905
+-0.0170028 0.0977503 -0.0256286
+-0.0541413 0.128093 -0.005327
+-0.0234618 0.0385102 -0.00806272
+-0.0234875 0.125296 0.0010065
+0.0238248 0.0404881 0.03829
+-0.0564079 0.0334582 -0.0027528
+-0.0667678 0.0695012 0.0345692
+-0.00845839 0.0346349 0.045549
+-0.0748544 0.15611 0.0141114
+-0.0718277 0.141507 -0.00801564
+-0.0263582 0.120444 -0.00943021
+-0.0384861 0.0847024 0.0437961
+0.0154742 0.126309 -0.00212525
+-0.0329093 0.0461288 0.0451027
+-0.00179731 0.0390446 -0.00419837
+-0.0830843 0.0843065 -0.0045636
+-0.00849798 0.051815 0.0518583
+0.0211703 0.0458979 -0.0197309
+0.0250466 0.0534973 0.0413033
+-0.00301309 0.0994095 -0.0252863
+-0.0286636 0.0662687 -0.0294695
+-0.0275164 0.0588544 0.0372755
+0.021248 0.0707121 -0.0275992
+0.0118973 0.0699023 0.0540919
+-0.0850671 0.0831487 0.00248224
+0.0112963 0.123527 -0.00913288
+-0.0471043 0.0355495 0.00808039
+-0.0305886 0.0341169 0.0127308
+0.0232695 0.0795597 0.0495474
+-0.0781795 0.165241 -0.0349583
+-0.00548333 0.122374 0.0356916
+0.02636 0.0531741 -0.0208871
+-0.0117787 0.0784571 -0.0380559
+-0.0374622 0.0945463 0.043653
+0.0298506 0.0915959 0.0433109
+-0.063716 0.150986 -0.0306408
+-0.0915859 0.128175 0.00825933
+0.0456498 0.0806034 0.02116
+-0.0483119 0.0614742 0.035964
+0.0375235 0.0968947 -0.00979522
+-0.0923144 0.132364 0.0182222
+0.0175115 0.118187 0.0352964
+-0.027798 0.0824702 -0.0362167
+-0.0679219 0.123838 -0.00890383
+-0.0136906 0.0585033 -0.0353384
+-0.0560167 0.0334996 0.00451355
+-0.00170896 0.0655406 -0.0343993
+-0.0134843 0.053101 0.0504987
+-0.0675811 0.143978 0.0427672
+-0.0395371 0.165252 0.00310729
+-0.00177026 0.0987839 -0.0266092
+0.0449905 0.0917771 0.0161555
+-0.0142754 0.0385008 0.0265607
+-0.024936 0.0546494 -0.0284077
+-0.0737754 0.0849525 -0.0153987
+-0.00225491 0.0393816 0.0354457
+0.00953649 0.101759 0.0470503
+-0.030493 0.0731979 0.0402297
+0.0418277 0.0395362 0.0134182
+-0.0622707 0.058834 0.014793
+-0.0042883 0.0999626 -0.0238822
+-0.0511241 0.157581 -0.00475152
+-0.0110467 0.0382737 0.0183997
+-0.0111844 0.110115 -0.0206413
+-0.0906536 0.150215 0.0201223
+-0.0636975 0.0593607 0.0104272
+-0.00965605 0.0527028 -0.0331963
+0.011809 0.0846857 0.0540696
+-0.0439904 0.115156 -0.0158426
+0.00534103 0.0581999 -0.0308279
+-0.00449084 0.119679 0.0378771
+0.00251006 0.102973 0.0437486
+-0.0256326 0.0383152 0.00270994
+0.0101829 0.0893384 -0.0312282
+0.0359735 0.108741 0.0274101
+0.000505152 0.0675448 0.0563482
+-0.0431097 0.0335646 0.0052718
+-0.0748156 0.16245 -0.0339456
+-0.0890383 0.09964 0.0104144
+0.0425362 0.0972508 -0.000830625
+-0.0136711 0.162609 -0.0156561
+0.0241599 0.0418198 -0.00678118
+-0.0181519 0.16827 -0.0202389
+-0.0404977 0.0986657 0.0417206
+-0.0809707 0.15134 0.0022444
+0.0151979 0.0420601 0.0445385
+-0.00221102 0.0959857 -0.0316631
+-0.0329609 0.0709036 -0.0224656
+-0.079699 0.101798 -0.00757602
+-0.0725189 0.144585 -0.0159026
+-0.0466234 0.165492 -0.0068396
+0.0185106 0.12405 -0.00369129
+-0.014344 0.183095 -0.0226028
+-0.0788576 0.105851 -0.00657974
+-0.0240104 0.109837 -0.0203148
+0.00980942 0.110782 -0.0193656
+0.0108601 0.117776 0.0369396
+0.0193075 0.0536075 0.0470681
+-0.0925525 0.131032 0.0242364
+0.00749212 0.131495 0.0152913
+0.00495998 0.131626 0.0157979
+-0.00415159 0.0385426 0.00685716
+-0.0241881 0.038442 -0.0062907
+-0.0114972 0.0870124 0.0568248
+0.0383205 0.0589284 -0.00670105
+-0.050793 0.124044 0.0335488
+0.0216558 0.0436146 0.0415846
+-0.0488766 0.0663121 0.037594
+-0.0460367 0.115268 -0.015925
+0.0354061 0.0981387 0.0355669
+-0.0414966 0.064844 0.0412967
+-0.0492702 0.0334521 0.00412227
+-0.0788564 0.173596 -0.0449928
+-0.0720001 0.0374977 0.00101403
+-0.0745188 0.135846 0.0503978
+-0.0705133 0.0930254 0.0420143
+0.0544062 0.0520207 0.00120422
+-0.016347 0.159993 -0.0102438
+0.00949781 0.0440631 0.0448456
+-0.0123976 0.0991026 0.0482068
+-0.00535711 0.0347531 0.0461025
+0.026456 0.0929171 0.0454329
+0.0245089 0.042142 0.038636
+0.043716 0.0750115 0.0261739
+-0.0839359 0.102045 -0.00261805
+-0.0806754 0.155074 0.0150117
+-0.0689 0.172262 -0.0550342
+-0.0523543 0.073291 0.0414729
+-0.0301406 0.0636155 -0.0234264
+0.0407753 0.0452541 0.0299878
+0.00638455 0.0464233 -0.0264515
+-0.0755977 0.151334 -0.0218791
+-0.00594273 0.0383379 0.0139478
+-0.0600908 0.115373 0.0375616
+-0.0424965 0.0733822 0.0425454
+-0.00260003 0.0405608 -0.0253579
+0.00350637 0.0702767 0.0558823
+-0.0897267 0.135137 0.0262095
+-0.0591547 0.117476 -0.0120923
+-0.024542 0.0428919 0.0537128
+-0.0054972 0.0576157 0.054162
+-0.0397846 0.0841362 -0.0215764
+0.0415613 0.0751972 0.0301802
+-0.0631728 0.0596464 0.0174802
+0.0423363 0.101455 0.00317956
+-0.0533301 0.1416 0.0264013
+-0.0464855 0.0931347 0.0435353
+-0.0629725 0.150532 -0.00369044
+-0.0853889 0.108959 0.00634578
+-0.0909761 0.118636 0.00631645
+-0.0384966 0.101445 0.0410637
+0.0194941 0.107309 0.0406484
+0.0396169 0.0843072 -0.0127653
+-0.0223745 0.0566587 0.0441983
+0.0607493 0.059571 0.0121639
+-0.0844811 0.123027 0.0489478
+-0.0570341 0.144219 -0.00185162
+-0.0723674 0.177806 -0.0472523
+-0.0466801 0.130916 0.0233152
+-0.02246 0.183226 -0.0115124
+-0.0707386 0.165621 -0.0179174
+-0.0739884 0.1541 -0.0249038
+0.00161401 0.13159 0.0117114
+0.0295344 0.0524338 -0.0167463
+0.00137166 0.0465972 -0.0284573
+-0.0349979 0.152158 8.20736e-05
+-0.0459591 0.0424584 -0.0122548
+0.032247 0.0800194 -0.0194064
+-0.0215329 0.0768164 0.0540336
+0.0182351 0.12763 0.00640475
+0.0169629 0.0348939 0.0289563
+0.0193977 0.0490363 -0.0230642
+-0.0596322 0.0604401 0.0228281
+0.0145003 0.108488 0.0407955
+-0.0720741 0.0646161 0.00403373
+-0.0712116 0.15818 -0.0429219
+-0.0175993 0.15966 -0.00802789
+-0.0759222 0.159085 -0.0100036
+-0.0384682 0.15361 0.00387723
+-0.0725333 0.0379686 0.00575754
+0.0455601 0.0904134 0.011166
+0.0375907 0.0937201 -0.0111657
+0.00483671 0.039382 0.0314929
+-0.026559 0.0377408 0.0211248
+0.0385027 0.0454964 0.0307784
+-0.0564952 0.047766 0.0395183
+-0.0198831 0.107284 -0.0222237
+-0.0779551 0.163899 -0.0249456
+-0.0563521 0.0342791 0.0304121
+-0.00751948 0.0746046 0.0579524
+-0.0827498 0.154172 0.0128373
+-0.00710449 0.125174 0.0317411
+-0.0367613 0.0798086 -0.0204262
+-0.036915 0.175546 -0.00898243
+-0.0705043 0.0887655 0.0418556
+-0.0522651 0.0335597 0.0034159
+-0.0677174 0.0409231 -0.00173026
+-0.0113677 0.180126 -0.0253581
+-0.0161521 0.03911 0.0518105
+-0.0690092 0.122845 0.052951
+0.00570986 0.0341754 0.0182505
+0.0184933 0.0865452 0.0498488
+6.3531e-05 0.129314 -0.00119744
+-0.0804587 0.135827 0.0500319
+-0.0754196 0.111293 0.0461553
+0.0424555 0.0902012 0.0271644
+-0.0928081 0.120209 0.0412843
+-0.0634884 0.0789934 0.0424288
+-0.0615251 0.0457206 0.0316818
+-0.0115387 0.0458293 0.048671
+-0.066289 0.0747237 0.0389788
+-0.0173046 0.166847 -0.0129407
+0.0331853 0.116604 0.00769666
+0.0445518 0.069148 0.0246508
+-0.091691 0.12831 0.0342454
+0.0434619 0.0930961 0.0241585
+-0.0678925 0.0435809 0.00801004
+0.0234224 0.0519071 -0.0231048
+-0.0208141 0.0595795 0.0467936
+-0.087519 0.112 0.0410625
+-0.0213082 0.126358 0.00326486
+-0.0606822 0.0362429 0.0450162
+-0.0576914 0.0693962 -0.0144511
+-0.0769716 0.13837 -0.00578148
+-0.0653565 0.1551 0.00564588
+0.0264433 0.0485879 -0.0182655
+0.039746 0.101828 -0.00373788
+-0.0610724 0.144529 -0.00434459
+-0.0662237 0.145026 -0.0176812
+-0.0283728 0.156641 -0.000811787
+-0.00971651 0.0348541 0.0433186
+-0.00481466 0.0868424 -0.0368113
+-0.031088 0.0335574 -0.0273919
+-0.0544366 0.120435 -0.011246
+0.00248882 0.121002 0.0363406
+-0.00349433 0.0911707 0.0563818
+-0.0931447 0.118854 0.0382959
+0.0254683 0.121415 0.0262007
+-0.0467966 0.0336683 0.000813328
+0.0319522 0.103353 -0.0134365
+-0.0633409 0.155276 -0.011594
+-0.0720139 0.180999 -0.0528377
+-0.0164541 0.0630817 0.0527623
+0.016475 0.0352036 0.002978
+-0.00226088 0.124171 0.0334893
+0.0391263 0.0631992 -0.00875738
+-0.0818614 0.114723 -0.0022038
+-0.0930555 0.120208 0.0402916
+-0.0904236 0.116034 0.0273085
+-0.0705028 0.159578 -0.0459334
+-0.0862816 0.117641 0.0480424
+0.0531688 0.0733724 0.0176223
+-0.0578751 0.134121 -0.00585274
+0.0423147 0.091604 0.0271557
+0.0101515 0.071231 0.055077
+-0.0435318 0.087421 0.0430041
+-0.0560394 0.131064 -0.00575471
+0.00125071 0.0712122 -0.0347068
+-0.0348542 0.165303 -0.00316457
+-0.0860328 0.0912972 0.00145067
+-0.00116523 0.0371346 0.0178171
+-0.0637756 0.0795327 -0.0183843
+0.00482779 0.0366504 -0.0137865
+0.0435599 0.0987371 0.0131605
+0.00150087 0.101618 0.0443156
+0.0314312 0.0625198 -0.0186445
+-0.0672777 0.169987 -0.0338702
+-0.0903951 0.118903 0.0450094
+-0.0501563 0.11976 0.0326732
+-0.0750921 0.156856 -0.022942
+-0.0275197 0.109846 0.0382427
+-0.0535612 0.0416919 -0.00977582
+0.0556505 0.0677792 0.00213147
+-0.0685182 0.0368214 -0.0053939
+-0.0780099 0.114072 0.0486721
+-0.0248787 0.0796614 0.0530244
+-0.0638477 0.164736 -0.0283363
+0.0142201 0.0793919 -0.0305544
+0.00713749 0.130032 0.0237524
+-0.0187348 0.175696 -0.0167204
+-0.00682337 0.088234 -0.0365489
+-0.0217663 0.11209 -0.0186927
+-0.0171714 0.0432613 0.0521182
+0.00513012 0.0373402 0.0458408
+0.0461568 0.0626078 -0.00274862
+-0.0412659 0.160879 0.0033623
+-0.0853172 0.110382 0.0233555
+-0.0158006 0.108342 -0.0207487
+0.00813236 0.110171 -0.0197068
+0.0265802 0.0345508 0.0130494
+-0.0660018 0.133981 0.0432166
+0.041807 0.0885902 0.0288907
+-0.024509 0.109889 0.0396002
+0.0354948 0.10491 -0.00909103
+-0.00850916 0.0688709 0.0557558
+-0.054442 0.0373135 0.0469328
+-0.010539 0.0390893 0.0340058
+-0.0858022 0.150106 0.00719342
+-0.0451719 0.0347129 0.0411467
+-0.00510128 0.0385919 0.0229448
+-0.0521978 0.0336397 0.008764
+-0.0162925 0.180099 -0.0261659
+-0.0902934 0.147439 0.0121579
+-0.0793826 0.0705862 0.00854889
+0.0209269 0.0658956 0.0477693
+-0.0116051 0.171103 -0.0260001
+-0.0635102 0.151152 0.0361873
+-0.0865918 0.127084 0.0480364
+-0.0756208 0.166729 -0.0233779
+-0.0507818 0.0840955 -0.0217037
+-0.0623945 0.164686 -0.0405941
+0.0109143 0.034258 -0.00287102
+-0.0326136 0.0384639 -0.0154224
+-0.0883155 0.139178 0.0394996
+-0.0317158 0.0383538 -0.00403424
+-0.00682874 0.0896331 -0.0361816
+-0.060744 0.0766988 -0.0182193
+-0.00743574 0.129906 0.00405669
+-0.0792494 0.0723341 0.0207326
+-0.036173 0.152719 -0.00677506
+-0.0305128 0.10708 0.0396423
+-0.0435905 0.0505542 -0.0107756
+-0.0204554 0.0347978 0.0481157
+-0.0591045 0.0344689 0.0400978
+-0.0840365 0.147342 0.0364323
+0.00340018 0.0348289 -0.0229504
+-0.0693319 0.141141 0.045512
+-0.0561609 0.0344771 0.0355158
+0.00119588 0.0881146 -0.0344258
+0.0583564 0.0538008 0.0181861
+0.0342539 0.0387023 0.0236157
+-0.0264982 0.125984 0.010106
+-0.0611832 0.146298 -0.00395593
+-0.0910251 0.124245 0.0440568
+-0.089862 0.115281 0.0432597
+0.0247433 0.124313 0.0130924
+-0.000820873 0.128641 -0.00248283
+-0.0554557 0.0533368 -0.00338183
+-0.0464641 0.122081 0.0270508
+-0.0451868 0.126658 0.0224837
+0.00145793 0.0977369 0.0519067
+0.0405445 0.0610221 0.0298369
+-0.0744952 0.0941746 0.0398302
+-0.0351234 0.033632 -0.0282515
+-0.0839267 0.145982 0.00417548
+-0.0224934 0.0435545 0.0535652
+0.0159352 0.127804 0.0226817
+-0.0572144 0.154757 0.0232881
+-0.0498753 0.0336124 0.000239655
+-0.0191672 0.0596981 0.049368
+-0.0242921 0.0918773 0.0492675
+-0.0523718 0.133555 -0.00317026
+-0.0557218 0.0723836 -0.0166307
+-0.00457986 0.0361758 -0.0248798
+-0.0737533 0.0901294 0.040627
+-0.00549531 0.10728 0.0439307
+-0.0181568 0.165005 -0.0179156
+-0.0554997 0.108443 0.0389722
+-0.0144882 0.101623 0.0437286
+0.0215585 0.0387445 -0.00669407
+-0.0752039 0.0696978 0.0256249
+-0.0569183 0.115707 -0.0143002
+-0.0731283 0.155734 0.00889607
+0.0347498 0.081125 -0.0176886
+0.00113903 0.131571 0.0129682
+-0.0279379 0.155215 -0.0039665
+0.0438288 0.0860483 -0.00379124
+-0.0202818 0.0386671 -0.01315
+-0.0639713 0.0651159 0.0301523
+-0.0729034 0.123797 -0.00826534
+-0.00948854 0.0965445 0.0534324
+-0.0616146 0.158432 -0.0255892
+0.0348698 0.112104 0.0254475
+0.0462561 0.0792459 0.0151754
+0.0132092 0.0348336 0.0300558
+-0.0650018 0.0435996 0.0108034
+-0.0629926 0.156114 0.0183129
+0.0432806 0.100121 0.0101615
+-0.0634166 0.118511 0.0453283
+-0.0718747 0.151003 0.0373736
+-0.0693203 0.155248 -0.0509683
+-0.058528 0.0400924 -0.008802
+0.0150592 0.0590177 0.0497649
+-0.0136861 0.0570325 -0.0345667
+-0.02332 0.0391695 0.0384733
+0.0410592 0.0985428 -0.00379645
+-0.042915 0.0436274 -0.0183221
+-0.0324875 0.068969 0.0402984
+-0.0927384 0.122733 0.00927055
+-0.0697859 0.156365 0.01735
+-0.0525617 0.0403541 -0.0109145
+-0.0163792 0.186908 -0.0208435
+0.00555045 0.034504 0.00513967
+0.0259201 0.0406241 0.0333279
+0.0340795 0.103399 0.0336714
+-0.0295185 0.0579228 -0.0214101
+0.0443631 0.0475049 -0.00446946
+0.00261537 0.0341134 0.0122343
+-0.0104909 0.104437 0.0435533
+0.0240885 0.124582 0.018553
+-0.084606 0.0993653 -0.00159598
+0.0315994 0.0505647 0.0349136
+-0.0887091 0.0983318 0.0213821
+-0.0109917 0.177231 -0.0295208
+-0.00927372 0.0384768 0.00588152
+-0.0731505 0.0794744 -0.0135813
+0.0377774 0.0672774 -0.012792
+-0.0257539 0.157476 -0.0102144
+-0.0524923 0.0340498 0.0261507
+0.0359032 0.0905437 -0.0158269
+-0.0358241 0.0900699 -0.0240653
+-0.0507764 0.0715485 0.0397729
+-0.0857724 0.0872268 -0.000524277
+0.0122145 0.0850407 -0.0307351
+-0.0818191 0.154205 0.0234297
+0.0239009 0.12202 -0.0014718
+0.0509663 0.0446851 0.0122122
+0.0405026 0.0469928 0.0315524
+0.00123226 0.0769082 -0.0355253
+0.0395203 0.0569025 0.0311403
+-0.0861982 0.144641 0.0372484
+-0.0218898 0.0382146 0.0234539
+0.0278568 0.0643129 -0.0209613
+-0.06664 0.0601639 0.0127094
+-0.0682452 0.17678 -0.058273
+-0.0326534 0.0578275 -0.0120318
+0.0449519 0.0847263 0.00223902
+-0.0243874 0.0379977 0.0213348
+-0.0375049 0.0648832 0.0416292
+-0.049486 0.0531643 0.034537
+-0.00680823 0.0840973 -0.0379387
+-0.00662043 0.0383357 0.0156226
+0.0246827 0.0347978 0.0179097
+0.052528 0.0664738 0.0271694
+-0.017323 0.112508 -0.01916
+-0.0589359 0.0481542 0.00467247
+0.0560814 0.0704234 0.0216351
+0.0445162 0.087501 -0.00181141
+0.0204668 0.0400207 -0.013702
+-0.0828557 0.0979824 0.0311146
+0.0393677 0.0547517 -0.00623241
+-0.0301563 0.0382285 0.0524978
+-0.0740972 0.155492 -0.0239137
+-0.0266047 0.0397022 -0.0293069
+0.0044664 0.0344032 0.010526
+-0.0644057 0.16752 -0.0356951
+-0.085796 0.123875 -0.00272102
+-0.0251727 0.175641 -0.0195733
+-0.0147266 0.0922559 -0.0359307
+0.0166529 0.120978 0.0330533
+-0.0652865 0.1555 -0.0467797
+-0.0622893 0.15065 -0.0135783
+-0.0173344 0.128368 0.0119773
+-0.044366 0.0366412 -0.0232589
+-0.0913152 0.114759 0.0363194
+-0.0647364 0.118589 0.0486106
+0.011956 0.0976358 -0.0233787
+-0.0378922 0.04725 -0.0183117
+-0.079848 0.116269 0.0487575
+0.0431642 0.0987038 0.0171581
+-0.0334777 0.0546734 0.0376709
+-0.0677151 0.171772 -0.0397619
+-0.0124935 0.123722 0.0323282
+-0.00945147 0.0352364 0.0483453
+-0.0729035 0.125275 -0.00849683
+-0.0837744 0.107497 0.00138169
+-0.0529962 0.0461208 0.0157076
+-0.0677529 0.141137 0.0442717
+-0.0840303 0.151908 0.0287412
+-0.0636039 0.0445634 0.0326846
+0.0192911 0.109605 -0.016128
+-0.0838969 0.104764 -0.000610535
+-0.0887185 0.143427 0.0331607
+-0.0929968 0.130998 0.0182299
+-0.0543463 0.160987 0.00512087
+-0.0909281 0.132287 0.0082314
+-0.0354987 0.113848 0.0338946
+-0.0465077 0.088954 0.0443573
+0.0301352 0.0955658 0.0419698
+-0.0199202 0.0381456 0.0185107
+-0.0186134 0.161522 -0.0143726
+-0.0646921 0.0617226 0.0224003
+0.0222832 0.066418 -0.0268569
+-0.0661617 0.0353568 0.0288449
+0.0192795 0.122165 0.0310901
+-0.00560235 0.0406015 -0.0258376
+-0.0404738 0.108409 0.038128
+0.0420248 0.0710795 0.0289899
+0.0450277 0.0945898 0.0071675
+-0.0490784 0.153156 -0.00527602
+-0.00149713 0.0689596 0.0566805
+-0.0709057 0.106531 -0.0119068
+-0.0626824 0.0436041 -0.00418427
+-0.066536 0.166455 -0.0250024
+-0.0218698 0.104438 -0.0229686
+-0.0731886 0.149857 -0.036868
+-0.0122347 0.0392642 0.0504717
+-0.0935435 0.118764 0.0233045
+-0.0797382 0.10948 0.0394939
+-0.0892801 0.091541 0.0104497
+-0.0547119 0.146209 0.0284156
+-0.00241231 0.037367 0.0100902
+0.000818555 0.130756 0.00282721
+0.04586 0.0820013 0.00419826
+-0.0250963 0.0348756 0.0487637
+-0.0673565 0.112647 0.0446949
+-0.0634506 0.15272 2.24523e-05
+-0.0706828 0.180611 -0.0569213
+-0.0205931 0.163965 -0.00888333
+0.0115331 0.101889 -0.0218781
+-0.0664983 0.102849 0.0407048
+0.0185027 0.118159 0.035136
+0.0458454 0.0834099 0.00517797
+-0.00887527 0.109466 -0.0219533
+-0.0858669 0.119072 -0.00140229
+-0.0102872 0.0344076 -0.0184603
+-0.0211482 0.169745 -0.0200914
+-0.00849115 0.111421 0.0423213
+-0.0613599 0.128292 0.04114
+-0.0076798 0.0569676 -0.0334142
+-0.0710297 0.16381 -0.0459687
+-0.0454992 0.112558 0.0357052
+-0.0343115 0.126654 0.00282732
+0.0360267 0.110062 0.0258818
+0.0368044 0.0942002 -0.0116901
+-0.0421812 0.123012 0.0251172
+-0.066012 0.139954 -0.00779963
+0.00198723 0.123051 -0.0105036
+0.0172553 0.072257 -0.0294021
+-0.013113 0.184484 -0.0260544
+-0.072893 0.152634 -0.0368963
+-0.0938278 0.128299 0.0222532
+-0.0675171 0.0409229 0.0105489
+-0.0735479 0.162209 -0.012171
+-0.0517008 0.0626767 0.0322349
+-0.0433082 0.037957 -0.0253239
+-0.0516781 0.0345962 0.0381142
+-0.0046354 0.0467251 -0.0296701
+-0.0777504 0.112676 -0.00382147
+-0.0281162 0.181397 -0.0109687
+-0.047699 0.144615 0.00435323
+-0.0663959 0.148276 0.0393784
+-0.0249816 0.15956 -0.0126947
+-0.00758477 0.0968518 -0.0305822
+-0.019536 0.116371 -0.0152209
+-0.0298632 0.102958 -0.0228236
+-0.0224181 0.05387 0.0440179
+-0.0625128 0.145366 0.0377954
+-0.0843383 0.133967 0.0484219
+-0.00452146 0.0443187 0.0472734
+0.000177098 0.0839833 -0.0361114
+0.0207016 0.113271 -0.0140876
+-0.065484 0.0847424 0.0442074
+-0.0201913 0.175663 -0.0226485
+-0.0364476 0.166788 -0.00019754
+-0.0206091 0.162049 -0.0149623
+0.0350254 0.0700182 0.0383083
+-0.0455491 0.131451 0.0178282
+0.00819795 0.130005 0.00128654
+-0.0353536 0.12061 0.029103
+-0.0271732 0.169704 -0.0183584
+-0.0657382 0.0436129 0.0101245
+-0.0722291 0.166627 -0.044985
+0.0309191 0.0539829 -0.0147501
+-0.0308747 0.056662 -0.0163864
+-0.0867734 0.123909 -0.00174219
+-0.0279078 0.0347965 0.0447705
+0.0191594 0.100268 -0.0222959
+-0.0154293 0.0382918 0.0211029
+-0.0578159 0.0636603 0.0309898
+-0.024177 0.172689 -0.0201134
+-0.0669849 0.0359436 0.0326963
+-0.0879792 0.086094 0.00648058
+-0.0181742 0.169737 -0.0210312
+-0.0170499 0.122405 0.0312344
+0.00906582 0.123154 0.0343752
+-0.034503 0.0874637 0.0428605
+0.0391693 0.108394 0.0111647
+-0.0917004 0.143358 0.0201656
+0.027747 0.0902677 -0.021551
+0.0430843 0.0496743 0.0322331
+-0.0791989 0.150078 -0.000876106
+-0.0259631 0.177171 -0.00957335
+-0.0395279 0.079033 0.0429651
+0.0302372 0.118499 0.00231637
+0.0449793 0.061326 -0.0034541
+-0.0376334 0.0548474 -0.0107543
+-0.0274342 0.111364 -0.0178958
+-0.0315627 0.048073 -0.0232988
+-0.018823 0.121694 -0.0088173
+0.00895989 0.0979651 -0.0237371
+-0.0254423 0.0473682 0.0503166
+-0.046654 0.0606571 -0.0123502
+0.0606526 0.0595573 0.0131644
+-0.0873547 0.094105 0.00537923
+-0.0202891 0.184471 -0.0210772
+-0.093713 0.126863 0.0152623
+0.00938205 0.0449001 -0.0251557
+-0.0903092 0.140666 0.025165
+-0.0676501 0.0667159 0.0297862
+-0.0164899 0.0602176 0.0520938
+0.019355 0.0565693 -0.0275356
+0.0104604 0.0340987 0.00091581
+-0.0785409 0.166665 -0.0309637
+-0.018017 0.0390618 0.0526069
+0.0189962 0.123953 0.0281041
+-0.0814357 0.0734392 0.00553468
+-0.0223732 0.03801 0.0163235
+0.0110271 0.112101 -0.0187639
+0.0456518 0.0904151 0.00617296
+-0.0789509 0.170805 -0.0389931
+-0.0312407 0.0510927 0.0390643
+0.0359235 0.106756 -0.00582268
+-0.0815808 0.0950721 -0.00753639
+-0.0849546 0.0871617 -0.00253673
+-0.0265403 0.0592021 0.0383808
+0.0398305 0.0739567 0.0329917
+-0.00085919 0.0358547 0.00813469
+-0.0747624 0.0700921 -0.00148683
+0.0313786 0.113275 -0.00606229
+-0.0902327 0.124018 0.00527185
+0.0268091 0.0506065 0.038521
+-0.0727909 0.0685075 0.0271607
+-0.0578274 0.0666818 0.0354001
+-0.0738208 0.0921589 -0.0148323
+-0.0390631 0.127858 0.0143467
+-0.00922314 0.174168 -0.0285672
+-0.0035205 0.039017 -0.00265492
+0.0435098 0.098719 0.0141568
+-0.0493916 0.144765 0.00938332
+0.0189816 0.0563976 0.0484166
+-0.0731928 0.064943 0.0125198
+0.0453289 0.0833826 0.0211694
+-0.0211162 0.1638 -0.0163957
+-0.0306102 0.125527 0.00421635
+-0.0262987 0.113585 -0.0162365
+0.0252163 0.1238 0.0175509
+-0.0237403 0.0669252 -0.0352956
+-0.00549562 0.0472961 0.0485942
+0.0045023 0.122399 0.0348631
+-0.0701614 0.178224 -0.0493215
+-0.0173769 0.125333 -0.00267782
+-0.0470115 0.129603 0.00120357
+-0.0317094 0.0374952 0.0310681
+-0.0297217 0.0382812 -0.0035606
+-0.0415986 0.169934 0.00129157
+-0.064505 0.152553 -0.0362048
+-0.0667255 0.178008 -0.0524224
+-0.0236086 0.0335974 -0.0240827
+-0.0156885 0.0555599 -0.0339026
+0.0182783 0.0708328 -0.0291795
+0.0541184 0.0510309 0.0235647
+-0.0765193 0.119025 0.0524244
+-0.0118673 0.0339713 -0.0202424
+0.00548892 0.118228 0.0378342
+-0.067477 0.0336926 -0.00520632
+0.0168316 0.0926978 0.0490711
+0.0255432 0.0768418 0.0475089
+-0.0617634 0.0795901 -0.0189973
+-0.0156786 0.0526029 -0.032522
+0.000420458 0.036172 -0.0244623
+-0.0256593 0.0810401 0.0523557
+0.026836 0.0634537 -0.0220606
+-0.0621975 0.166246 -0.0505873
+0.0578529 0.0523616 0.0171842
+-0.0217254 0.126122 0.00269746
+0.0235742 0.124212 0.0226421
+-0.0578055 0.0883401 -0.0213124
+-0.0798409 0.103395 0.0321858
+-0.0123464 0.178658 -0.023274
+0.0212154 0.0476501 0.0409677
+-0.0342487 0.0752311 -0.0224883
+-0.0230529 0.0839079 0.0553134
+-0.0214993 0.112665 0.0388138
+-0.0327955 0.0873016 -0.0254019
+0.0258836 0.0605349 0.0443599
+-0.0096598 0.0907753 -0.0363722
+0.0450284 0.0875565 0.0211548
+0.0334239 0.0414863 -0.00351395
+-0.0488087 0.138617 0.0133952
+-0.0658054 0.0924099 -0.017991
+0.0104979 0.0896334 0.054299
+-0.0043048 0.123153 -0.010566
+-0.0174665 0.17272 -0.016673
+-0.0344763 0.0561322 0.0383021
+-0.0857072 0.152777 0.0118249
+-0.0575671 0.0494422 0.00671449
+-0.0430533 0.0345113 0.0330204
+-0.065164 0.147357 -0.0239331
+-0.0326268 0.0520227 -0.0107626
+-0.067905 0.106631 -0.013438
+-0.0258738 0.125824 0.0147443
+0.0544233 0.0635568 0.0276516
+-0.0872747 0.139127 0.00719289
+-0.0315055 0.109789 0.0377033
+-0.0763386 0.161799 -0.0152953
+0.0232414 0.0663429 -0.0257954
+0.0174948 0.109841 0.0394103
+-0.0507289 0.129704 0.0318965
+-0.0425042 0.0577064 0.0400486
+0.022545 0.0955327 0.0468247
+0.0403951 0.0475373 -0.00531603
+0.0183271 0.0475932 -0.02269
+-0.0572639 0.0601869 -0.00219809
+-0.0852337 0.104506 0.0248257
+-0.0933098 0.126856 0.0132534
+0.0352918 0.108619 -0.00504659
+-0.0628349 0.0939281 -0.0188357
+0.00277101 0.099815 0.0475918
+-0.0637196 0.147938 -0.020833
+-0.0636347 0.156368 -0.0124044
+-0.0882602 0.111934 0.0373837
+0.0451564 0.0931924 0.00517592
+-0.0883906 0.0874807 0.0144622
+-0.0179879 0.0654395 0.0522544
+-0.0334338 0.0382234 0.0500909
+-0.00283875 0.0389996 -0.00436591
+-0.0295052 0.11528 0.03366
+-0.00151332 0.104469 0.0441334
+0.0194927 0.0906432 0.0481529
+-0.0877693 0.113692 0.0289151
+-0.0661933 0.0335338 -0.00299624
+-0.0273899 0.0499801 0.045145
+-0.0338474 0.0972112 -0.023083
+-0.075849 0.149415 0.0390624
+0.0325609 0.114759 0.0260072
+-0.0821806 0.0776422 0.0235195
+-0.0759474 0.151351 -0.0188826
+0.013384 0.043414 -0.024368
+-0.0077421 0.0340597 -0.0195129
+-0.00965525 0.0511768 -0.0320162
+-0.0677487 0.111258 0.0407689
+-0.0214969 0.0461967 0.0522939
+-0.0466073 0.0518764 -0.00969859
+0.0357625 0.0364791 0.0131618
+-0.0124847 0.111379 0.041672
+-0.079194 0.0832222 0.0349745
+-0.0926331 0.130966 0.0142325
+0.00419789 0.123154 -0.0106599
+0.00969178 0.121836 0.0352946
+-0.0295306 0.123946 -0.00125424
+-0.0711733 0.128436 0.0516087
+-0.0585141 0.0386878 -0.00928985
+-0.0739244 0.0668664 0.00165643
+-0.0424856 0.0410553 0.0431368
+-0.0176939 0.162435 -0.0154936
+-0.00215916 0.0369163 -0.0154166
+0.0205271 0.126116 0.00440152
+0.000359464 0.0907103 -0.0342066
+0.038908 0.0631632 0.033303
+0.0223132 0.124739 0.023599
+-0.070737 0.159582 -0.0449318
+-0.0281334 0.155101 -0.00344078
+0.0323761 0.107397 0.032947
+0.0390072 0.0393837 0.00207442
+0.0420748 0.0457918 0.0297783
+-0.0187683 0.0699858 -0.0381989
+0.0176298 0.0382941 -0.0187111
+-0.0688111 0.0922897 -0.0164711
+0.0419266 0.101462 0.0171593
+0.00341059 0.0376223 -0.0244648
+0.0461634 0.0792418 0.0171768
+-0.0637535 0.0431846 0.0296789
+-0.0273632 0.0534705 -0.0254085
+-0.0394955 0.0562825 0.0399491
+0.00548498 0.0590856 0.0545593
+-0.0934182 0.124107 0.0122673
+0.0324897 0.100233 -0.014155
+-0.00952254 0.0688375 0.0554289
+0.0191204 0.042209 0.0431814
+0.0195848 0.035993 0.00660837
+-0.0748916 0.10354 -0.0108565
+-0.0685642 0.0406581 -0.00126009
+-0.0225344 0.118142 0.03379
+-0.013583 0.0386256 -0.002471
+-0.0898618 0.113382 0.0394321
+0.0601893 0.0595178 0.0171788
+-0.0630097 0.121328 0.0458592
+-0.0196415 0.0725672 0.0536854
+-0.0211896 0.172692 -0.021286
+0.024653 0.104647 -0.0168345
+-0.0795268 0.096746 0.0348816
+0.0485163 0.0672488 0.000612911
+0.0400064 0.0422019 -0.00166327
+-0.0197891 0.0785016 -0.0390423
+-0.0260568 0.0375908 -0.0291887
+-0.00717802 0.130589 0.0142265
+0.0156678 0.0346738 -0.0117297
+0.0424576 0.0845381 -0.00679736
+-0.0302701 0.0365155 -0.0302567
+-0.0274598 0.0863801 0.0483431
+-0.0831854 0.11075 0.0323354
+-0.0514986 0.109783 0.0378241
+-0.0183396 0.126605 0.021835
+-0.0497522 0.0716181 0.0399477
+0.0165016 0.116787 0.0362663
+-0.0670324 0.0672056 0.0312385
+0.0201473 0.0414664 -0.0187017
+0.0364932 0.0484054 0.0314672
+-0.0501327 0.159092 -0.00542351
+-0.0752763 0.0667216 0.0105318
+-0.0341695 0.0337715 0.0105094
+0.0137891 0.103175 -0.021246
+-0.073587 0.148629 -0.0261691
+-0.0169441 0.184483 -0.0249355
+-0.0097273 0.130072 0.0104159
+-0.00405402 0.0391419 -0.01222
+-0.0887371 0.0955614 0.00743378
+-0.0864769 0.0806081 0.0125015
+0.040053 0.107027 0.0101639
+-0.042812 0.14778 0.00347562
+0.0248383 0.0835695 -0.0246296
+0.0277899 0.116538 -0.00556904
+-0.0291577 0.0380555 0.005854
+-0.0525571 0.150877 0.0178
+-0.0639921 0.134062 -0.00777265
+-0.0838901 0.110998 0.0281595
+-0.0134922 0.107228 0.0429665
+-0.0586918 0.149676 0.0345486
+-0.0616651 0.119834 0.0424717
+0.0456475 0.0890064 0.00517807
+-0.0089791 0.0383636 0.0133044
+-0.0903646 0.135051 0.0122148
+0.0317594 0.0835691 0.0424885
+-0.0240368 0.11082 -0.0193477
+0.0271768 0.112761 0.0342135
+-0.0356473 0.116902 -0.0136714
+-0.0739197 0.151223 0.0366634
+0.0410535 0.0759945 -0.00777525
+-0.0734182 0.169757 -0.0275332
+-0.00232938 0.0359607 0.0474459
+-0.085737 0.110915 0.0387737
+-0.0775985 0.123137 0.0521223
+-0.0748309 0.100681 -0.0121692
+-0.0866976 0.109058 0.0133472
+-0.0701875 0.0395708 0.00901355
+-0.0306891 0.120328 -0.00923215
+-0.045477 0.1214 -0.012376
+-0.033489 0.172734 -0.00156283
+-0.0565822 0.0339881 0.0253464
+-0.0404955 0.0451407 0.0414639
+-0.0555537 0.0420256 -0.00889368
+-0.0598777 0.102599 -0.0186645
+0.0592051 0.0552531 0.0121703
+-0.0758111 0.0741872 -0.00760517
+-0.038197 0.0342285 0.0289964
+-0.00312706 0.0390512 0.0319597
+0.0476183 0.0426691 0.0171605
+-0.0306281 0.0831438 0.0423752
+-0.049274 0.1386 0.00640083
+-0.0210747 0.0753924 0.0536136
+-0.093596 0.126936 0.0252692
+-0.0629825 0.129686 -0.00825839
+0.00470729 0.128083 -0.0039713
+-0.0335515 0.0373466 -0.0164398
+0.0425502 0.0637218 0.0280932
+-0.0707401 0.13973 0.0469958
+-0.0644842 0.0804582 0.0430441
+-0.0618671 0.112377 0.0367302
+-0.0698247 0.169548 -0.0276555
+-0.0863191 0.0806082 0.0115067
+-0.0216814 0.0523409 -0.0297011
+0.0377238 0.110496 0.0121805
+-0.0689171 0.158096 -0.0529848
+-0.067181 0.156627 -0.0534662
+-0.0268045 0.0811284 -0.0369845
+-0.0546722 0.139567 0.0297056
+-0.0554146 0.0649279 0.0339175
+-0.0193967 0.186852 -0.0171886
+-0.0357817 0.0351096 0.0179926
+-0.0718839 0.173642 -0.0520314
+-0.0409497 0.0337305 -0.016439
+0.0396966 0.105593 0.0211678
+-0.0789279 0.0699144 0.0158521
+-0.0414163 0.0476371 -0.0122303
+-0.00671791 0.0642099 -0.0355692
+0.0547677 0.0509942 0.0227339
+-0.0686614 0.0735088 -0.0131618
+-0.0738123 0.0655371 0.0172042
+-0.0904479 0.129526 0.00625875
+0.0197334 0.044328 -0.0216983
+-0.0896348 0.140659 0.0301806
+-0.00748945 0.0870384 0.0571349
+0.0217161 0.119158 -0.00841047
+-0.0545346 0.125365 -0.00640975
+0.0368294 0.108237 -0.00182731
+-0.0672538 0.152901 0.0344187
+-0.0807043 0.0827741 -0.00656651
+-0.0305099 0.113915 0.0346878
+-0.0721764 0.154012 -0.0399025
+-0.045061 0.130334 0.0180279
+-0.00652053 0.0688834 0.0561767
+-0.0444953 0.0817848 0.0424707
+-0.0874489 0.105009 0.0173545
+-0.0175711 0.0387182 -0.00892429
+0.000506539 0.0883906 0.0565122
+-0.0265193 0.12549 0.0159805
+-0.0464789 0.0917181 0.0434263
+0.0455125 0.0918121 0.0101608
+-0.0834627 0.110719 0.0412267
+-0.057205 0.0480928 0.032667
+0.00517049 0.0350387 0.0228068
+0.0457999 0.0820138 0.0191697
+-0.0420324 0.171559 -0.00171063
+-0.0475118 0.128596 -0.00180437
+0.0204841 0.0948066 0.0474378
+-0.0719895 0.163815 -0.0429694
+-0.0644943 0.0861671 0.0446171
+0.00851416 0.06604 0.0550264
+-0.0670308 0.141141 0.0435296
+-0.0848818 0.142006 0.0416598
+-0.0384808 0.106985 0.038039
+0.0180116 0.0754634 0.0524537
+-0.0725251 0.155433 -0.0349062
+0.0182337 0.128007 0.0135344
+-0.0233093 0.162498 -0.00577898
+-0.0850563 0.112998 0.00231897
+-0.0823398 0.145942 0.00119384
+-0.0852211 0.103481 0.00138673
+-0.071875 0.136886 0.0488574
+-0.0794627 0.138625 0.0485832
+-0.0435009 0.117967 0.030956
+-0.038588 0.0341641 0.0271976
+-0.0408255 0.0914222 -0.0231618
+-0.0551021 0.154591 -0.0020359
+-0.0748456 0.159073 -0.00827714
+-0.0621666 0.152205 -0.0155784
+-0.0494972 0.0776899 0.0438666
+0.00751862 0.0799738 0.0554444
+0.00532494 0.0625045 -0.0319907
+0.00237701 0.131635 0.0162813
+-0.0546261 0.151324 0.0271982
+-0.0236176 0.123316 0.0244011
+0.00251869 0.05336 0.0534808
+0.0225511 0.0888829 0.0485585
+-0.0370273 0.174099 -0.0109221
+-0.090997 0.129691 0.0382289
+-0.0732672 0.148476 -0.0292583
+-0.053498 0.0465766 0.0420409
+-0.0330184 0.0474571 0.0438647
+-0.0246064 0.033636 -0.0243161
+-0.0234471 0.125053 0.0200484
+-0.0830784 0.138234 -0.000100609
+0.0406549 0.0820323 0.0324674
+-0.0842996 0.0965857 0.0297797
+-0.0527544 0.03448 0.0379838
+-0.0799451 0.15529 0.0167266
+-0.057093 0.0521243 0.00061739
+0.0154036 0.0477404 -0.0246897
+-0.060782 0.082481 -0.019648
+-0.0700267 0.166609 -0.0500213
+0.0451823 0.091796 0.014161
+0.0346837 0.106039 0.030986
+-0.0396713 0.0621627 -0.012718
+-0.05111 0.0375368 0.0465746
+-0.0688918 0.119449 -0.00874323
+0.000197079 0.035652 0.0464555
+-0.00149822 0.0661867 0.0567241
+0.00350858 0.074484 0.056374
+-0.0284992 0.0703316 0.0397848
+-0.0555164 0.0482866 0.0387265
+-0.0908309 0.136473 0.0182032
+-0.0634905 0.0861851 0.0447067
+-0.00918339 0.033864 -0.0215021
+-0.0748916 0.123775 -0.00787892
+-0.0270496 0.033483 -0.0265278
+0.00488911 0.035483 -0.0145807
+-0.0442085 0.165146 -0.00911238
+-0.0322103 0.0386054 -0.0136114
+0.0190336 0.11528 0.0364777
+-0.000494586 0.0897644 0.0562541
+-0.0350004 0.157209 -0.0112204
+-0.0635638 0.147341 -0.0176577
+-0.0902987 0.121315 0.00530766
+-0.0705068 0.102745 0.0389474
+-0.0662636 0.175335 -0.0598585
+-0.0239792 0.0680021 0.045464
+0.0413142 0.0637288 -0.00386959
+-0.051889 0.108419 -0.0189045
+-0.0477652 0.131125 0.00158524
+-0.0400469 0.169775 -0.0108504
+-0.0755266 0.109807 -0.00760163
+0.00107791 0.130709 0.0215491
+-0.0655994 0.0349763 0.0155159
+-0.0628742 0.161547 -0.05443
+0.0359645 0.0981106 0.0346243
+0.00934693 0.129002 0.0260013
+-0.0768843 0.109139 0.0404116
+-0.010503 0.0674297 0.0550101
+-0.028646 0.0535523 0.0364431
+-0.072824 0.0936306 -0.0150907
+0.028615 0.035804 0.0196241
+0.0282076 0.0706829 -0.0227535
+0.0596824 0.0622541 0.020173
+-0.0025152 0.0575969 0.0540026
+0.000110958 0.036978 0.020027
+-0.0273656 0.0360131 -0.0296152
+-0.0624735 0.0344952 0.0183787
+-0.0360892 0.159232 -0.0124312
+0.0418577 0.100066 0.0211691
+-0.063571 0.122754 0.0468224
+0.0523857 0.0624129 -0.0025136
+0.0383109 0.0632029 0.0342252
+-0.0144971 0.0786767 0.0566892
+-0.0928565 0.129591 0.0132418
+-0.0681034 0.152856 -0.0481556
+-0.0746787 0.169356 -0.0440586
+-0.0335137 0.107031 0.0389932
+0.0424926 0.0583469 0.0313486
+-0.0223256 0.0637459 0.0453694
+-0.0648797 0.106687 -0.0146649
+0.0250125 0.0632249 0.0448766
+-0.0624284 0.159959 -0.0405984
+0.00349445 0.12099 0.0360851
+0.022067 0.0981797 0.0461337
+-0.0734899 0.123206 0.0535424
+-0.0321688 0.171168 -0.015915
+-0.0848969 0.106313 0.0233612
+-0.067172 0.174543 -0.0467986
+0.0246727 0.0884534 -0.0236513
+-0.0504949 0.0477308 0.0397221
+-0.064202 0.155431 -0.0413859
+0.00347944 0.095162 0.0537659
+0.0105108 0.100431 0.0479236
+0.021311 0.123415 0.0275211
+0.0415141 0.104253 0.009162
+-0.0617635 0.0387159 0.0237173
+-0.0044982 0.0952431 0.0547633
+0.0398123 0.066053 -0.00878746
+-0.00271622 0.0627636 -0.0349069
+-0.00914442 0.0387021 0.000210725
+-0.0814422 0.106028 0.0294684
+-0.0136643 0.0922643 -0.0359313
+0.0420557 0.0676716 -0.00377172
+-0.0364793 0.0945677 0.0439429
+-0.05033 0.0517928 0.0340061
+-0.0470088 0.130577 0.00217989
+-0.0286777 0.158132 0.000508817
+0.0185266 0.0345532 0.000246197
+-0.0147199 0.184604 -0.0232088
+-0.0384921 0.111131 0.0361977
+-0.0384978 0.102835 0.0403416
+-0.0215751 0.0667511 0.0487462
+-0.0887264 0.0996152 0.00841821
+-0.060662 0.0644224 -0.00688354
+0.0397235 0.080129 -0.010751
+-0.0136601 0.0389486 0.0334846
+-0.0106876 0.129553 0.00573838
+0.00810435 0.0348429 0.0181346
+0.0256081 0.104449 -0.0166247
+-0.0682325 0.168499 -0.0270627
+-0.0474794 0.0917467 0.0438194
+0.00950115 0.119644 0.0365249
+0.0437324 0.0790794 0.0263023
+-0.0905234 0.132421 0.0302253
+-0.0748541 0.107208 0.0370405
+-0.0943565 0.12553 0.0182582
+-0.0131926 0.0378477 0.0507876
+-0.0570855 0.0480965 0.0356642
+-0.04493 0.0346468 0.0377647
+-0.0665925 0.064199 -0.00375071
+-0.0829976 0.133839 -0.00205551
+-0.0406365 0.0548831 -0.0112562
+-0.00950098 0.0884225 0.0571104
+0.0335068 0.0468989 0.0306812
+4.31947e-06 0.034593 -0.0165995
+-0.0725884 0.155473 0.0265843
+-0.0755167 0.0714511 -0.00453448
+-0.0669139 0.0704667 0.0354638
+-0.069981 0.180634 -0.0574865
+-0.0116389 0.034923 0.0481436
+-0.0307766 0.0720324 -0.0295197
+-0.0178239 0.107521 -0.0218927
+0.020822 0.043607 0.0421342
+-0.025466 0.0460651 0.0509844
+0.0349766 0.11396 0.0183585
+-0.0599273 0.122373 -0.00867944
+0.0365334 0.0980835 0.033685
+-0.0621481 0.159972 -0.0385982
+-0.0915531 0.115336 0.039285
+-0.0888763 0.0982745 0.00841224
+-0.00324635 0.130613 0.0199814
+-0.0668526 0.0914559 0.0435065
+0.0175786 0.0475536 0.0427473
+0.0318002 0.118052 0.00717688
+-0.0414667 0.104283 0.0404247
+0.0562407 0.0648113 0.00118357
+-0.0753758 0.170369 -0.0311391
+-0.0620405 0.138434 -0.00686017
+-0.00249822 0.0870283 0.0569791
+-0.0542914 0.129735 0.0355428
+-0.0274963 0.100194 0.0434874
+-0.00951883 0.17115 -0.0217635
+-0.0305995 0.121953 0.0248664
+-0.0770757 0.068957 0.00853894
+0.0135031 0.119752 -0.013055
+0.0413777 0.0491221 -0.00619394
+-0.0669027 0.0396709 0.012801
+-0.0249365 0.0607087 0.0409751
+-0.0124795 0.0517352 0.0508543
+-0.0304 0.0650386 -0.0254348
+-0.0267061 0.0765373 0.0464972
+0.0196875 0.0385058 -0.013693
+0.0518591 0.0461434 0.019211
+-0.0447475 0.146272 0.00240034
+-0.0336457 0.0562895 -0.0107616
+0.0237552 0.0887468 -0.0239425
+-0.000502572 0.0965565 0.053664
+-0.0664522 0.0376478 0.0363332
+-0.041205 0.169789 -0.00987939
+-0.0630084 0.142674 -0.00705706
+-0.0305333 0.178655 -0.00565353
+-0.0137626 0.0784616 -0.0384771
+-0.0616465 0.0397266 0.0174413
+0.00939844 0.0418898 -0.0239164
+0.0403895 0.0519763 -0.00684208
+0.00239172 0.0434053 -0.0248906
+-0.0663598 0.15609 0.0142173
+-0.0667166 0.136853 0.0439657
+-0.0132042 0.171245 -0.025107
+-0.0511148 0.117699 -0.0144446
+-0.0686887 0.0620968 0.00507892
+-0.066502 0.0889512 0.0442634
+-0.0531749 0.0487012 0.0129919
+-0.0464945 0.0532702 0.037612
+-0.0763048 0.0702707 0.00153293
+0.00237024 0.0481449 -0.0294793
+-0.0669085 0.108072 -0.0133167
+-0.0614834 0.166203 -0.0576271
+0.028089 0.0929174 0.0442737
+-0.0239187 0.036252 -0.0191133
+-0.0394562 0.0347283 0.0406132
+-0.0679286 0.17514 -0.0470724
+-0.0737519 0.14858 -0.0228576
+-0.0335079 0.105635 0.0395993
+-0.0780357 0.0769322 0.031104
+0.047273 0.0720618 0.00573289
+-0.0566027 0.0562228 -0.000407584
+-0.0336617 0.0592604 -0.0121578
+0.0390714 0.108406 0.0131668
+-0.067572 0.158668 -0.00806913
+-0.0668441 0.0995074 -0.0160123
+-0.0155786 0.0348181 -0.0259692
+0.0524799 0.0636428 -0.00173686
+-0.0666208 0.161046 -0.0135117
+0.012487 0.118181 0.036207
+0.00850767 0.067431 0.0550095
+-0.0568164 0.0333332 -0.00454462
+-0.00056724 0.0909565 -0.0345037
+0.0122553 0.0695892 -0.0315106
+-0.0747099 0.0713354 -0.00558545
+-0.0151964 0.178666 -0.0203777
+-0.0707468 0.161979 -0.010709
+-0.00364517 0.0496603 -0.0307711
+0.0292759 0.0787271 -0.0215887
+-0.0606931 0.0659255 -0.00858452
+-0.055281 0.0594285 0.0232183
+0.0168274 0.0658911 0.0506364
+-0.0286315 0.159193 -0.0128611
+-0.0753259 0.0689002 0.0227894
+-0.0278046 0.0364789 0.0536304
+-0.020238 0.0938075 -0.0335417
+-0.0787919 0.108745 0.0367247
+-0.0627356 0.150882 -0.0252578
+-0.0374903 0.111156 0.0359971
+0.0123741 0.0494269 -0.0274814
+-0.0550935 0.0685958 0.0378502
+0.0152655 0.0695272 -0.0306629
+0.0304209 0.0460912 -0.00653037
+-0.0896888 0.137919 0.0321971
+-0.076768 0.156222 -0.00903892
+-0.0177411 0.17422 -0.017052
+-0.0582856 0.0695544 0.0380966
+-0.0710157 0.179813 -0.0510815
+-0.0283604 0.112635 -0.0172343
+-0.0441537 0.0408799 -0.0213021
+0.0104769 0.0949778 0.0509942
+-0.00239285 0.100006 0.0487279
+0.0421962 0.0929549 -0.00479827
+0.0401191 0.0900359 0.0318057
+0.0226855 0.103953 -0.0180758
+-0.0705692 0.037778 -0.000833243
+0.0213756 0.0429924 -0.0177346
+0.0141656 0.0475343 0.0448184
+0.02539 0.0849287 0.0474039
+-0.0485578 0.0361757 -0.0124661
+0.0237226 0.0699627 0.0465409
+-0.062494 0.155703 0.00979223
+-0.0499478 0.135176 0.00116888
+-0.0731261 0.154051 -0.0329012
+-0.0565591 0.0344267 0.0337344
+-0.0757231 0.155771 0.0225635
+-0.081733 0.0783168 0.0273929
+-0.0465781 0.0504461 -0.00966731
+0.0370638 0.0376395 0.0160314
+0.0401736 0.0801429 -0.00978947
+-0.0295615 0.171229 -0.00778742
+-0.0625363 0.158377 -0.0386027
+-0.0482692 0.133969 0.0226705
+0.00454759 0.0341639 -0.0171912
+-0.0620171 0.153759 -0.016582
+-0.0878261 0.11219 0.0337097
+-0.05597 0.0519966 -0.00239063
+0.0400386 0.0871415 -0.0117889
+0.0205921 0.0807207 0.0509473
+-0.0296224 0.0352251 0.019146
+-0.0381589 0.163687 -0.0131595
+-0.0675595 0.163657 -0.0167503
+-0.0522361 0.15086 0.0163848
+0.0360023 0.103374 0.0311349
+0.0272712 0.0929162 0.0448522
+-0.0277389 0.0423333 0.0528015
+-0.0824451 0.140729 0.0449221
+-0.0329396 0.0386558 -0.0303928
+0.0296623 0.114075 -0.00693776
+-0.0221975 0.0652175 0.046591
+0.045212 0.0819736 0.0221688
+-0.0258761 0.0796032 0.0512286
+0.0272389 0.0873294 -0.0222582
+0.00242016 0.0361514 -0.024222
+-0.0615581 0.145382 0.0374116
+-0.0695688 0.160974 -0.049948
+-0.0858053 0.0953564 -0.000572964
+-0.0464927 0.165223 0.0045927
+-0.0624159 0.15064 -0.016574
+0.0473464 0.0561746 -0.0057008
+0.0237088 0.0942271 0.0467477
+-0.0494979 0.0762481 0.043343
+-0.078769 0.165248 -0.0339573
+-0.00950205 0.12806 0.0264334
+0.05377 0.0682444 0.00163269
+-0.0679209 0.163786 -0.054975
+0.0290078 0.087549 0.0438096
+-0.0840398 0.132376 -0.0018283
+-0.0306543 0.0650659 -0.0244333
+0.0322458 0.0355363 0.00770856
+0.00335212 0.131364 0.00663122
+-0.0154115 0.128891 0.0141212
+-0.0372876 0.0421099 0.0439093
+0.0308492 0.0931255 -0.0185705
+-0.029871 0.0459583 -0.0272702
+0.0300675 0.0822073 0.0435477
+0.000382137 0.128869 0.0270967
+-0.0174793 0.0730127 0.0550809
+-0.0387497 0.0782817 -0.0191475
+-0.0433943 0.0335852 -0.0186462
+0.0391881 0.0673984 -0.0107969
+-0.0280713 0.175691 -0.00734553
+0.0316149 0.0916151 0.0423373
+-0.0762132 0.0879097 -0.0135406
+-0.0316751 0.0665766 -0.0214412
+-0.00307655 0.0345443 -0.0171652
+-0.0426807 0.0636637 -0.0138633
+-0.0921228 0.126953 0.0372491
+-0.0235086 0.0347636 0.0474886
+-0.0506072 0.0546369 -0.00878713
+-0.0685971 0.162283 -0.0128033
+-0.0637348 0.156074 0.0136991
+0.0233928 0.0475951 -0.0196868
+-0.0519018 0.105587 -0.0193502
+-0.00551889 0.0746529 0.0585785
+0.000500504 0.0519731 0.0534094
+-0.0412672 0.0338015 -0.0128657
+-0.0819225 0.125087 -0.0048212
+0.00722702 0.0796252 -0.0338785
+-0.0893296 0.0956153 0.0124232
+-0.00167125 0.0554598 -0.0320096
+0.0267785 0.0402768 0.0313512
+-0.0867821 0.10632 0.010369
+-0.0451957 0.131364 0.0135329
+0.018149 0.0699846 0.0508404
+-0.0878008 0.119885 0.00028492
+-0.0612546 0.0341987 0.0206565
+0.0115009 0.111256 0.0392728
+0.0152633 0.0751002 -0.0297036
+-0.0351444 0.0865581 -0.0244792
+0.000649673 0.0963928 -0.0300705
+-0.0345272 0.121283 0.0279162
+0.0296818 0.0815643 -0.0205093
+-0.03348 0.115008 -0.0157024
+-0.0728312 0.136891 0.0492499
+-0.00265601 0.0540246 -0.0319128
+-0.0422272 0.127744 0.0161624
+-0.0494399 0.119744 0.0319359
+-0.0574019 0.116942 0.0379675
+-0.0468361 0.0970763 -0.0219471
+-0.0616292 0.146031 -0.00460349
+-0.0933662 0.126937 0.0262691
+-0.0228186 0.161021 -0.00330981
+-0.0635624 0.152855 0.034229
+-0.0625195 0.144437 -0.00658249
+-0.0839827 0.0830482 -0.0025149
+0.0144965 0.116791 0.0366152
+-0.0766305 0.155099 0.0076657
+-0.0365494 0.127902 0.0108341
+0.02042 0.126659 0.0186188
+-0.0470606 0.0628926 0.0375096
+-0.00665705 0.114661 -0.0174859
+0.0409886 0.104212 0.016155
+0.0264254 0.054947 0.041554
+-0.064618 0.0659249 -0.00682147
+0.0143052 0.127349 0.0263844
+-0.0254714 0.0379526 0.0103195
+0.0213669 0.0851498 -0.0262488
+-0.0469792 0.133264 0.00837709
+-0.0845615 0.0777561 0.014943
+0.0384886 0.0513309 0.0319844
+-0.0128833 0.165453 -0.0135102
+-0.0811951 0.147316 0.000164965
+-0.0523892 0.141597 0.0213852
+-0.045982 0.130505 0.00444274
+0.0279356 0.0520839 0.0384098
+-0.0931866 0.124098 0.0112689
+-0.0316005 0.0707575 -0.0264789
+0.00339515 0.0448431 -0.0258796
+-0.019688 0.0352649 -0.0192337
+-0.0492398 0.164062 -0.00484765
+-0.00759694 0.039172 -0.0259394
+-0.0456148 0.043386 -0.0114089
+-0.0706825 0.163806 -0.0469738
+-0.0111277 0.166928 -0.0162357
+0.0150914 0.0873948 0.0517971
+-0.0488841 0.0335499 -0.0104742
+0.0191832 0.0974256 -0.0227258
+-0.068761 0.17368 -0.0560297
+0.0347852 0.0821986 0.0398055
+-0.0656191 0.164967 -0.0232289
+0.0488884 0.0431235 0.0112233
+-0.0204394 0.0725535 0.0530664
+0.0198178 0.127196 0.0112616
+-0.0870347 0.13912 0.00619253
+-0.0619782 0.15683 -0.0335967
+0.0192552 0.0735767 -0.0281447
+-0.0582892 0.0589697 0.00149643
+-0.0794885 0.131664 0.0524764
+-0.0625817 0.159955 -0.0415973
+-0.0344319 0.0350721 -0.0182387
+0.0339652 0.0955609 0.0387182
+-0.0350568 0.0344135 0.0294961
+-0.00649976 0.0842428 0.0569087
+-0.0606247 0.0394421 0.0446315
+-0.066026 0.146409 -0.0228827
+0.0265887 0.0491527 0.0382012
+-0.0447519 0.078285 -0.0193632
+0.0442188 0.0833029 0.0251703
+-0.025021 0.178659 -0.00994683
+0.0382789 0.10977 0.00952257
+-0.0756137 0.176488 -0.0441876
+-0.0706968 0.169922 -0.0279808
+-0.0514769 0.0344526 0.0347935
+0.00449209 0.108585 0.0419458
+0.0591616 0.0552765 0.0151753
+0.0295012 0.0578054 0.0407589
+0.0323993 0.0505614 -0.00746951
+-0.0570338 0.131087 -0.00617819
+-0.0304972 0.101559 0.0427282
+-0.00116978 0.0991573 0.0506694
+-0.0238077 0.0811303 0.0547388
+-0.00701023 0.0988653 -0.0267279
+-0.0156999 0.0584946 -0.0353551
+0.00922562 0.0809438 -0.0326125
+0.0453737 0.0474164 -0.00383546
+0.0044338 0.117686 -0.0167913
+0.0239341 0.0561524 -0.0247597
+0.0591083 0.0705376 0.015147
+-0.0594646 0.151494 0.0342364
+-0.0657091 0.157202 -0.00882727
+-0.0250337 0.0381576 0.00660247
+0.0420581 0.102887 0.0101643
+0.0436509 0.0403831 0.00924323
+-0.00449056 0.130995 0.0108991
+0.0044777 0.112767 0.0412512
+0.00553763 0.100304 0.04669
+-0.0942962 0.120123 0.0192891
+-0.0620801 0.0339964 0.0171254
+-0.0160023 0.128658 0.015367
+-0.0432963 0.128843 0.0142751
+-0.0634932 0.104261 0.0408123
+-0.0746115 0.103538 0.0368408
+-0.0222463 0.0739152 0.0519932
+-0.0544743 0.034136 0.0256577
+-0.0252277 0.12616 0.0135052
+-0.0320296 0.171249 -0.00429305
+-0.0132393 0.1837 -0.0278845
+-0.0324962 0.0718107 0.0406773
+-0.0765269 0.165965 -0.0237196
+-0.0833313 0.0829966 0.0292517
+0.0259015 0.0902483 0.0463733
+0.0095961 0.0354723 -0.00987583
+0.0511798 0.0581784 0.029952
+-0.0848476 0.0845966 0.0254873
+-0.0509379 0.131197 -0.00260501
+0.00252027 0.0730778 0.0562797
+-0.0135504 0.122737 -0.00796322
+-0.00761024 0.0420402 -0.0258045
+-0.0508461 0.134795 0.0276114
+-0.0804072 0.155064 0.0209566
+0.00350727 0.103765 -0.0218529
+-0.0106066 0.0420419 -0.0261259
+-0.0713436 0.0632651 0.0179295
+-0.067959 0.169303 -0.0298283
+-0.0236585 0.049302 -0.027521
+-0.069473 0.158882 -0.00587612
+-0.0766843 0.15421 -0.00390102
+-0.0220401 0.0852804 0.0556778
+0.0275877 0.0465825 -0.0117097
+-0.00852427 0.130326 0.0108566
+0.0130382 0.0344991 0.00293188
+0.0559458 0.0605187 0.000117677
+-0.0348266 0.0900917 -0.0242073
+-0.0890869 0.135136 0.0402764
+-0.0897624 0.136545 0.033205
+0.00547548 0.112757 0.0410095
+-0.0712367 0.159654 -0.00650092
+-0.0121993 0.177175 -0.0288808
+-0.0823069 0.0748418 0.00552391
+-0.054558 0.0460859 0.0144477
+-0.070487 0.0669606 -0.00253268
+-0.0556924 0.159448 0.00648476
+-0.00649361 0.105887 0.04408
+-0.0602281 0.059992 0.0213112
+-0.0580325 0.0579587 0.00923969
+-0.0338627 0.110196 -0.0186635
+0.0546876 0.0597691 -0.00173886
+-0.0625369 0.149102 -0.00757295
+0.0542703 0.0575789 -0.00178727
+-0.0088618 0.129865 0.0208462
+-0.0801514 0.109359 0.0377151
+-0.00679227 0.0798757 -0.0378854
+-0.0424904 0.0860159 0.0426903
+0.0479819 0.0723794 0.00739708
+-0.0560722 0.13957 0.0312222
+-0.0365138 0.0804626 0.0431357
+0.00167631 0.105337 -0.0215515
+-0.0775111 0.0860271 0.0374369
+0.0259521 0.11908 -0.00433188
+-0.0558236 0.0526652 0.00846948
+-0.0846054 0.11036 0.02536
+-0.0765518 0.15421 -0.000899711
+0.0127846 0.0699169 0.0536174
+0.0208082 0.1264 0.00735797
+-0.0504584 0.0502644 0.0363006
+0.0174244 0.125027 -0.00283112
+-0.0308709 0.178515 -0.0130008
+-0.00718543 0.0385691 0.00621806
+0.0407891 0.0886694 0.0309807
+-0.0357951 0.124657 -0.0058294
+-0.0554873 0.0400326 0.0469712
+-0.057026 0.0675163 0.0366088
+-0.0497286 0.133927 0.0265636
+-0.00790814 0.0384861 0.0079669
+-0.0811308 0.0841829 -0.00653469
+-0.010479 0.0991873 -0.02508
+0.00856046 0.0354979 0.0447263
+-0.0634822 0.166302 -0.0366942
+-0.0223475 0.0360366 0.0535038
+-0.0795325 0.124539 0.0521412
+-0.00951606 0.0745243 0.0569833
+-0.0130122 0.127478 0.0251829
+-0.0936226 0.120076 0.0132919
+-0.0540996 0.154592 -0.00271527
+-0.0879876 0.132208 0.00230713
+-0.034669 0.15585 -0.0101443
+-0.0197012 0.0598498 -0.0346368
+-0.0276791 0.155231 -0.00339809
+-0.0842452 0.0818537 0.025498
+-0.054537 0.0560032 -0.00541843
+-0.0497623 0.0665865 0.0371903
+-0.0891577 0.092949 0.0214162
+-0.0577737 0.0782037 -0.0194332
+-0.064492 0.104249 0.0405622
+-0.0336047 0.0695556 -0.0194645
+-0.0558611 0.0955845 -0.021564
+-0.0184974 0.0869962 0.0565805
+0.00637923 0.0372606 0.0264872
+-0.0665048 0.104229 0.0399675
+0.0566718 0.0553009 0.0238011
+-0.0283123 0.0383433 -0.00703005
+-0.0114184 0.169868 -0.0184586
+0.0211822 0.0909362 -0.0242734
+0.0406295 0.0806796 0.0323988
+0.0123659 0.128443 -0.000397752
+-0.0384845 0.0833049 0.0437838
+-0.01051 0.0531978 0.0517663
+0.00250545 0.0842781 0.0574483
+-0.0674995 0.0972695 0.0419768
+-0.0618921 0.119466 -0.00942759
+-0.00594439 0.13066 0.0175514
+-0.0188708 0.0382701 0.00775373
+-0.0605698 0.0727907 0.0401099
+-0.0115041 0.115551 0.0394745
+0.0300401 0.11902 0.00366373
+-0.0812551 0.10738 0.02923
+-0.0704758 0.123201 0.0533571
+-0.0711231 0.141136 0.0464522
+-0.0222312 0.125137 -0.000350139
+0.0436968 0.0818627 -0.00278544
+-0.00557531 0.0383818 0.0157938
+-0.0175218 0.187118 -0.0194148
+0.000510392 0.0689287 0.0563645
+0.0339979 0.0519394 0.0331121
+0.00286804 0.129802 0.0250965
+-0.0290472 0.0777737 0.0431405
+0.0209137 0.102084 0.0444516
+-0.00628355 0.0409075 0.0485853
+0.0605521 0.0595441 0.0141714
+0.0386236 0.0898511 -0.0127692
+0.0302987 0.0539206 -0.0157566
+-0.0421651 0.149301 -0.00412295
+-0.0126067 0.040646 -0.0265976
+-0.0788091 0.168052 -0.033971
+0.0359211 0.112779 0.0172688
+-0.0394762 0.17111 0.000601324
+-0.0330305 0.0384181 -0.00620006
+-0.0859939 0.0940196 0.000445293
+-0.0359122 0.158048 0.00410154
+-0.0745011 0.151286 -0.0298782
+0.0531496 0.0491587 0.00225551
+-0.0243767 0.179986 -0.0189674
+-0.0891975 0.0996627 0.0124046
+-0.0742533 0.17954 -0.0493425
+-0.0510836 0.145457 -0.000907293
+0.0483282 0.0561556 -0.00540695
+-0.0224848 0.0474635 0.0510926
+-0.0647533 0.163375 -0.0214725
+-0.0127683 0.163589 -0.0126806
+0.0112702 0.0766287 -0.031501
+-0.0460801 0.153165 -0.0063697
+-0.0396673 0.0606846 -0.0120669
+0.0304753 0.100799 0.0389817
+0.0504441 0.0731136 0.0180651
+0.0195371 0.122997 -0.00457304
+-0.0455152 0.0505363 0.0385492
+-0.0525396 0.0458696 -0.00783738
+-0.0679101 0.109459 -0.0121777
+0.0257715 0.122252 0.0234619
+-0.0641925 0.158337 -0.0512857
+-0.0679573 0.0636968 0.0236258
+0.0336501 0.0872305 -0.0183746
+-0.081408 0.0801232 -0.00353296
+-0.068364 0.143961 0.043402
+-0.060807 0.170968 -0.0607383
+-0.0530022 0.0712206 0.0395879
+-0.0629233 0.149038 -0.01858
+-0.0911763 0.131044 0.0302322
+-0.0866097 0.0859466 0.00148078
+-0.0213048 0.0567472 0.0459531
+-0.0884724 0.111842 0.0093465
+-0.0232358 0.0382045 0.0267906
+-0.0687325 0.178002 -0.0502345
+0.0171734 0.0960138 -0.0234178
+-0.0336295 0.0533957 -0.0102549
+0.0404048 0.0661215 -0.00776758
+0.0352114 0.113974 0.0112756
+-0.0509894 0.131098 0.0315417
+-0.0825925 0.0857998 0.0312629
+0.0165569 0.0367823 -0.018664
+-0.0158447 0.163118 -0.0162484
+0.0463618 0.0504062 -0.00492067
+-0.0256024 0.0918183 0.0477571
+0.0401119 0.105635 0.0181717
+-0.075865 0.120825 -0.00747435
+-0.0515138 0.0502892 0.0216268
+-0.0597307 0.0737738 -0.017073
+0.0327302 0.0795508 0.0421017
+0.0561478 0.0493933 0.0131905
+-0.0491927 0.149222 0.0111539
+-0.0505664 0.0459962 -0.00889176
+-0.0346044 0.0381371 0.0484275
+-0.0571418 0.0341673 0.0268338
+-0.0508978 0.0335658 0.00549258
+0.0499018 0.0460625 0.00228276
+0.000648366 0.101032 0.0453587
+-0.064515 0.0945534 0.0434117
+-0.00933623 0.127529 -0.00319765
+-0.0931674 0.126844 0.0122586
+-0.0775055 0.120428 0.0519362
+-0.00412302 0.0390868 0.0317249
+-0.0444953 0.12065 0.0276432
+-0.0808257 0.114785 -0.00282613
+0.00848893 0.0976878 0.0492062
+-0.0204952 0.119495 0.0334766
+-0.0744171 0.1312 0.052182
+-0.0354802 0.0365931 -0.0303176
+-0.0158225 0.127346 0.0227279
+-0.0622273 0.163125 -0.0345932
+-0.0308039 0.0345326 0.0408762
+-0.0684942 0.0944611 0.0423345
+-0.0282259 0.115945 -0.0147131
+-0.00496131 0.0393649 0.0367022
+0.000507606 0.089764 0.0561546
+0.0184391 0.121423 0.0322194
+-0.0293563 0.0761839 -0.0345604
+-0.0798193 0.0993879 0.0336913
+-0.0260706 0.125207 0.0176138
+-0.0466789 0.0383303 -0.0162856
+-0.0551627 0.0709645 0.0393255
+-0.0708102 0.086505 -0.0166182
+-0.0534691 0.0491595 0.0373719
+-0.0176627 0.0365106 -0.0181139
+0.00950436 0.0910078 0.0538342
+-0.0895706 0.136541 0.0322035
+0.0538065 0.0721186 0.0208488
+-0.00549555 0.115561 0.0401898
+0.00964519 0.0349724 -0.00752839
+-0.0134864 0.112741 0.0406725
+-0.00206815 0.039143 -0.00620903
+0.0130247 0.112857 -0.017601
+-0.0790398 0.119048 0.050662
+-0.0808858 0.0872378 0.0337267
+-0.0123796 0.124965 -0.00637162
+-0.0213885 0.125739 0.00103732
+-0.089509 0.125659 0.045333
+-0.05553 0.137483 -0.00349047
+0.0417216 0.100008 -0.000812454
+-0.0294372 0.045874 0.0494957
+0.0458807 0.0774123 0.0204549
+-0.010796 0.120869 -0.0120713
+-0.0650859 0.171096 -0.0446086
+-0.0309091 0.0594671 -0.0184147
+0.0318276 0.102039 -0.0140664
+-0.050474 0.137043 0.0223997
+-0.0892111 0.0956026 0.0114219
+-0.0551272 0.0478339 0.0400497
+-0.0376142 0.115213 -0.0159111
+-0.0262205 0.0604134 -0.0304432
+-0.0395514 0.159448 0.00235113
+-0.0548296 0.0912974 -0.0221769
+0.0140209 0.113717 -0.0165571
+-0.0376838 0.0651596 -0.0143574
+-0.0357596 0.0367769 0.0465803
+0.0218833 0.124858 0.00205716
+-0.0515413 0.0403485 -0.0110842
+0.0196453 0.0521206 0.045827
+-0.0274751 0.109286 -0.019717
+-0.054346 0.125513 0.0372066
+-0.061806 0.172532 -0.0555873
+0.0193853 0.0367967 0.0404
+0.00315064 0.0340463 -0.0192491
+-0.0419902 0.127061 0.0177443
+-0.0753578 0.0671035 0.0137678
+-0.017747 0.0685932 -0.0381265
+0.0502404 0.0581527 0.030355
+-0.01349 0.11138 0.0414506
+-0.088473 0.0908539 0.022804
+-0.0623246 0.0380624 0.0435494
+-0.0315191 0.0831203 0.0417649
+-0.0908528 0.131057 0.0322319
+-0.0524868 0.0959601 0.0436811
+0.0383485 0.10917 0.00520513
+0.0405643 0.0599899 -0.00408877
+-0.00769877 0.0598808 -0.0345717
+0.0253549 0.0875981 0.0473346
+-0.0126907 0.166905 -0.0150111
+0.0384994 0.0541178 0.0316123
+-0.034906 0.0367338 -0.0161439
+-0.057208 0.048538 0.00854022
+-0.0255159 0.108511 0.0401259
+0.0305676 0.0350004 0.0115893
+-0.0520943 0.0559627 0.0266271
+-0.0610057 0.155949 0.0190169
+-0.067333 0.1766 -0.0497355
+0.0258363 0.0844839 -0.0235493
+-0.0689178 0.164003 -0.0158096
+-0.00849374 0.116931 0.0393004
+-0.0752784 0.113511 0.0497641
+-0.0888148 0.144497 0.0313918
+-0.0453871 0.145929 0.00156561
+-0.0599561 0.0677317 0.0357891
+-0.0125434 0.0386707 -0.00229897
+-0.000271447 0.0356914 0.00658166
+-0.0415825 0.0366566 0.0434527
+-0.0297036 0.165315 -0.00626903
+-0.0467885 0.0855251 -0.0217462
+-0.0827882 0.125806 0.051363
+-0.0176693 0.0966335 -0.0284397
+-0.0464991 0.115243 0.033257
+-0.0569748 0.146758 0.0317266
+-0.0430879 0.156177 -0.00890493
+-0.00350236 0.0774419 0.0585703
+-0.0699027 0.158151 -0.0489236
+0.0362459 0.112339 0.00591924
+0.0367118 0.0920329 -0.0133924
+-0.0539202 0.0610131 0.0274265
+-0.0093317 0.127279 0.0279745
+-0.0726772 0.112018 0.047983
+-0.0451365 0.160644 -0.00892562
+-0.0209165 0.172715 -0.0146234
+-0.0477839 0.125387 0.0290716
+-0.0734873 0.156859 -0.0289164
+0.00860516 0.061703 0.0545256
+-0.0246606 0.0422329 0.0539554
+-0.0315436 0.153515 -0.00448892
+0.0345459 0.0571781 -0.011728
+-0.0791321 0.170818 -0.0399882
+0.0254504 0.0415949 -0.00563526
+0.0230318 0.0355156 0.0114574
+-0.0554984 0.107053 0.0399469
+-0.0296361 0.0522471 0.0373693
+-0.0438179 0.0928034 -0.0224841
+-0.0199243 0.0387302 -0.0112686
+0.0212455 0.0791286 -0.0267859
+-0.0532861 0.0527919 0.0115704
+0.00450017 0.0441843 0.0459802
+-0.0329932 0.0339759 0.0213799
+0.0553011 0.0604636 -0.000842819
+0.00165238 0.0932332 -0.0327923
+-0.0552284 0.0527023 0.00927604
+-0.0783599 0.0708413 0.0204513
+-0.0767777 0.176413 -0.0510191
+-0.0394918 0.104211 0.0396007
+0.0327921 0.0889736 0.0422708
+-0.00991923 0.0986226 0.0505787
+-0.0806729 0.108958 0.0307202
+-0.0822864 0.135367 0.0491747
+-0.0649369 0.0609076 0.00327394
+0.0386477 0.0715748 -0.0117783
+-0.0240415 0.126597 0.0109996
+-0.0781422 0.141688 -0.0047364
+-0.0427782 0.0841106 -0.0212812
+-0.0641686 0.178174 -0.0558405
+0.0252976 0.0661311 -0.0233121
+0.0189895 0.0631559 0.0484766
+0.0182463 0.0722224 -0.0290012
+-0.0777504 0.161717 -0.020949
+-0.051966 0.138521 0.000416067
+-0.0605353 0.155832 0.0177371
+0.0437866 0.098742 0.00716534
+-0.0494703 0.0370271 -0.0120635
+0.0464078 0.0806576 0.0101793
+0.0218218 0.116393 -0.0114503
+-0.0533273 0.132699 -0.00427378
+-0.0681775 0.0762505 0.039044
+-0.0250035 0.0896 -0.0352857
+0.000769534 0.0946028 -0.0322154
+-0.0158082 0.0346932 0.0474464
+-0.076979 0.148604 -0.00699397
+0.0467055 0.0730498 0.0181295
+-0.0496483 0.0634464 -0.0118311
+-0.0197535 0.0700012 -0.0382558
+0.0232727 0.0989983 -0.0208236
+-0.0777 0.16251 -0.0219398
+-0.0908755 0.147455 0.0141474
+-0.0334742 0.0638502 -0.015538
+0.00219672 0.0825025 -0.0349885
+-0.0814773 0.128835 0.0524787
+-0.0784807 0.13724 0.0497912
+0.0361312 0.11046 8.71157e-05
+-0.0454849 0.0931252 0.0434035
+-0.0635463 0.153079 -0.00800928
+-0.0529285 0.0339107 0.0244154
+-0.00862356 0.0451919 -0.0286362
+0.0192377 0.117984 0.0350388
+-0.000496915 0.0883839 0.0565827
+0.0316988 0.118246 0.0142694
+-0.0398347 0.169198 -0.01127
+0.0219416 0.125622 0.00635903
+-0.092876 0.129604 0.0142376
+-0.023566 0.0579721 0.0425175
+-0.0447621 0.126552 0.0211574
+-0.0390659 0.157734 -0.0109824
+-0.0038734 0.104505 -0.022849
+-0.0810823 0.146103 0.0405774
+-0.00499552 0.038756 0.0282379
+0.00659654 0.102942 0.0449664
+-0.0528078 0.0898592 -0.0221628
+-0.0415043 0.0340515 -0.0039392
+-0.0118724 0.166916 -0.0155725
+0.00801932 0.113693 0.0398597
+-0.0873717 0.0895698 0.0245766
+0.0235801 0.11767 -0.00881398
+-0.0592051 0.0411249 -0.00803844
+-0.0631955 0.174736 -0.0540401
+-0.00904474 0.102005 -0.0240096
+-0.0893459 0.0888735 0.0114634
+-0.0847817 0.111591 0.0313073
+-0.0318636 0.155275 -0.00893878
+0.020119 0.0578214 0.0483165
+-0.0884363 0.140505 0.0381916
+0.0268748 0.0768062 0.0459093
+0.00650425 0.06886 0.0554952
+-0.0600274 0.155812 0.00342033
+0.00439509 0.0433687 -0.0246925
+-0.0644393 0.157952 -0.0526177
+-0.0626717 0.152516 0.0345768
+-0.0686641 0.0435432 0.00268116
+-0.0668913 0.155545 0.00822429
+-0.0513204 0.0545255 0.0306253
+-0.0216946 0.055283 -0.031103
+0.0201038 0.121698 0.0313961
+-0.0435092 0.0973014 0.0425845
+-0.0598342 0.124083 0.0415696
+-0.0290584 0.0385824 0.0360072
+-0.0211666 0.0959679 -0.0277597
+0.0393164 0.0948581 -0.00836399
+-0.0465497 0.0354834 -0.0182685
+-0.0577953 0.0577539 0.0112722
+0.0343862 0.0533953 0.033694
+-0.0356597 0.12459 0.0229985
+-0.0703962 0.0382223 -0.000484462
+0.0394034 0.0772645 -0.00977482
+0.0374516 0.110677 0.0163977
+0.022681 0.0549804 0.0449373
+-0.00661876 0.0388692 0.029605
+-0.0298463 0.0958488 -0.0239617
+-0.0500656 0.165567 2.77718e-05
+-0.0624265 0.163056 -0.0535855
+0.0182459 0.035082 -0.00972071
+-0.0535426 0.139527 0.0278286
+0.0535157 0.0664189 0.0268642
+-0.0618871 0.044625 0.0401036
+0.0279315 0.0813321 -0.0222629
+-0.0364738 0.0959436 0.0435424
+-0.0648009 0.0867059 -0.0190299
+-0.0910478 0.113254 0.017639
+0.0328625 0.115479 0.000361714
+-5.55454e-05 0.1192 -0.0143689
+0.00440015 0.0419024 -0.0241382
+-0.0356548 0.0459643 -0.0252685
+-0.00874142 0.0699019 -0.0364843
+-0.0786816 0.173602 -0.0460003
+-0.0750442 0.11265 0.048722
+0.0132032 0.0850348 -0.0305799
+-0.0275703 0.070462 0.0404211
+-0.0333885 0.082189 -0.0265241
+-0.0498121 0.0912811 -0.0216901
+-0.0121305 0.129539 0.00953518
+-0.0888371 0.0942243 0.00943852
+-0.0733262 0.151241 -0.0368807
+0.0159012 0.0347663 0.0342789
+-0.0464698 0.0336288 0.00272222
+-0.0219797 0.0381347 0.0126751
+-0.0434985 0.112577 0.0357301
+0.0374146 0.0807844 0.0365828
+-0.0150623 0.160937 -0.0114195
+0.00882514 0.0347544 -0.00561715
+-0.0793646 0.150083 0.036366
+0.0444807 0.0526489 0.0324592
+-0.0140843 0.0382987 0.0177555
+0.0371109 0.0630101 -0.0117592
+-0.0795655 0.0711751 0.0181423
+0.0314182 0.0968966 0.040312
+0.0553211 0.0622297 0.0271921
+-0.0344916 0.0789231 0.04184
+-0.0708134 0.0893817 -0.0163657
+-0.0786856 0.174223 -0.045863
+-0.0497628 0.0345507 0.0333201
+-0.026557 0.0646504 0.0393284
+0.0499455 0.0733656 0.0164225
+0.0233132 0.0902311 0.0479207
+-0.0441494 0.163638 -0.00943446
+-0.048497 0.0464891 0.040915
+-0.0638143 0.15519 -0.0396115
+0.0296208 0.115866 0.0291818
+-0.0505003 0.100168 0.042883
+0.00450871 0.0910904 0.0550512
+0.0223914 0.093257 -0.0227104
+-0.0346391 0.0469045 -0.0241611
+0.0600903 0.0608951 0.0181821
+0.0174829 0.0976104 0.0472234
+0.0245219 0.0382712 0.0311236
+0.0373902 0.0561474 -0.00613784
+-0.0725233 0.143597 -0.0104167
+-0.0755086 0.133058 0.0519758
+-0.0469091 0.134066 0.0158053
+-0.0365004 0.0719314 0.0420432
+0.0599383 0.0692126 0.0131498
+-0.0228512 0.126901 0.0114323
+0.0370832 0.0408236 0.0259314
+0.0430366 0.0709859 0.0269587
+0.0442558 0.0917077 -0.00080891
+0.0366443 0.0915417 0.0373244
+0.0149217 0.127634 0.0251635
+-0.0260773 0.0547586 -0.0274003
+0.0223322 0.0348324 0.0210401
+-0.0674741 0.169344 -0.0310786
+-0.0943935 0.125559 0.0222675
+0.000334373 0.0554042 -0.031412
+-0.023822 0.0694685 0.046666
+0.024828 0.0768588 0.0482443
+-0.0593221 0.0615947 0.0254084
+-0.0274704 0.0506795 -0.0243965
+-0.0172176 0.177147 -0.0249576
+0.0433823 0.0490357 -0.00560381
+0.0244317 0.116294 -0.00934411
+0.0184177 0.0350663 0.0309125
+0.0404265 0.102791 0.0231613
+-0.0243375 0.1639 -0.00728245
+-0.0675442 0.151908 -0.0456642
+-0.0311974 0.0474073 0.0447828
+-0.0726957 0.175719 -0.0430358
+-0.0165027 0.0499584 0.0473896
+0.0323852 0.0461686 -0.00610484
+0.0214495 0.0822346 0.0504578
+0.016822 0.123899 -0.00554312
+-0.0694694 0.178653 -0.050518
+-0.0741019 0.156119 0.0187476
+0.0510202 0.0736047 0.0138558
+-0.0739033 0.14718 -0.0168588
+-0.0165785 0.162548 -0.00831661
+-0.0414778 0.0347327 0.0401772
+0.0319294 0.118052 0.0100791
+-0.0502835 0.146495 -0.00183305
+-0.0758664 0.116415 -0.00636144
+-0.0824071 0.136209 -0.001703
+-0.0519598 0.0335208 -0.000101812
+-0.0819554 0.0993316 0.0315904
+0.0213579 0.055075 -0.0266156
+-0.0422106 0.112435 -0.0169649
+0.0150002 0.128745 0.00378903
+-0.0430993 0.157658 -0.00954173
+-0.0816795 0.117485 0.0486704
+-0.00999143 0.0383941 0.00762464
+0.0248936 0.12332 0.00461274
+-0.0644877 0.0972949 0.0424471
+-0.032514 0.105674 0.0400124
+-0.0517751 0.0826668 -0.0215624
+0.00214252 0.103065 -0.0221511
+-0.0609083 0.169363 -0.0596932
+0.0270498 0.0919981 -0.0213752
+0.00735643 0.038818 0.0454516
+0.0115845 0.121127 -0.0125402
+0.0591992 0.0552614 0.014176
+-0.0901723 0.112303 0.0149799
+-0.0627834 0.035148 0.0195098
+-0.074757 0.111898 0.0475989
+0.0570719 0.0578424 0.00217676
+-0.0528487 0.0500508 0.0126245
+-0.00477608 0.0784365 -0.0374195
+-0.0645432 0.0673992 0.033354
+-0.0540085 0.145723 -0.00127177
+-0.010995 0.0388834 0.0322933
+0.00247314 0.0964836 0.053027
+-0.0624566 0.177245 -0.0586155
+0.0368789 0.0941727 0.035906
+-0.0219544 0.120804 -0.00985027
+0.0570851 0.0508934 0.0101876
+0.0102738 0.0724526 -0.032232
+0.0544954 0.0655564 0.000403771
+0.0210681 0.0415437 -0.0156999
+-0.0692317 0.155651 0.00154206
+0.0527009 0.0518645 -0.000768796
+0.0334294 0.116181 0.00636312
+0.0448957 0.0945828 0.0101613
+0.00249575 0.0952068 0.0540463
+-0.0124032 0.0388598 -0.00801871
+0.045282 0.0889737 0.0021781
+-0.00350234 0.0388725 -0.0137373
+-0.0678317 0.0335757 0.00383638
+0.00921578 0.0767579 -0.0331902
+-0.0534996 0.0987387 0.0427565
+-0.0124888 0.126191 0.0283067
+0.0103285 0.130654 0.00635323
+0.0314005 0.0446447 -0.00577901
+-0.0295471 0.0804664 0.0436378
+0.00584239 0.0374362 -0.00493399
+0.0435663 0.0408867 0.018056
+-0.0206234 0.0950485 -0.0308006
+-0.0216102 0.0408331 -0.028871
+-0.0256808 0.0663835 0.041558
+0.0103698 0.0351865 0.034574
+0.0249548 0.0809223 0.0484627
+-0.0551501 0.0641879 0.0328568
+-0.0633147 0.132484 0.0400888
+-0.062948 0.163113 -0.0275941
+-0.0620302 0.141028 0.0366839
+-0.0484797 0.126826 0.0298997
+0.00950548 0.107102 0.041296
+0.0390056 0.0914413 0.0336848
+0.0300323 0.108764 0.0348296
+-0.0198832 0.0335337 -0.0251748
+0.0128315 0.0391361 0.0445812
+-0.0263531 0.11244 -0.0170322
+0.0359611 0.109622 -0.00183337
+-0.0572001 0.0380562 0.0469117
+0.00550248 0.121034 0.0357708
+-0.0667821 0.14845 -0.031825
+-0.016957 0.186039 -0.0193264
+-0.0878947 0.131105 0.044958
+0.0363312 0.107346 0.0280412
+-0.0614985 0.0833224 0.0439406
+0.0542552 0.0478973 0.00920996
+-0.0787615 0.0867217 -0.0105634
+0.0226207 0.0360088 0.0127544
+0.00886878 0.0343168 0.00225753
+-0.0266191 0.0618553 -0.0304537
+-0.00302574 0.0387303 0.00142158
+-0.019905 0.038668 0.0324503
+0.0527798 0.0683653 0.00150186
+0.021964 0.0402022 -0.00870612
+-0.0126432 0.0481635 -0.0303259
+-0.0124951 0.0925417 0.056096
+-0.0373842 0.0433946 0.0425967
+0.0243858 0.124139 0.00725423
+-0.0540808 0.0434992 0.0186914
+-0.0590026 0.0609591 0.0242669
+-0.0846496 0.129332 -0.00265191
+0.0108129 0.0887938 0.0544498
+-0.0599027 0.106882 -0.0174092
+0.0235199 0.123889 0.00267512
+-0.0364958 0.116629 0.0319219
+-0.0274016 0.0386836 -0.0145853
+0.0575354 0.0620414 0.00218896
+-0.0617076 0.156842 -0.0315932
+-0.0566848 0.0344893 0.0422998
+-0.0515556 0.0459336 -0.00836292
+0.034036 0.037677 0.020853
+0.0440634 0.064827 -0.000963389
+-0.0783551 0.090033 0.0367591
+-0.0451437 0.162134 -0.00879907
+-0.0870992 0.0913786 0.00345195
+-0.0896332 0.0983435 0.0144056
+0.00267954 0.131212 0.00494959
+-0.0521038 0.0531706 0.024633
+0.033292 0.0856433 -0.0187503
+-0.0284873 0.0606333 -0.0264114
+-0.0366237 0.123115 -0.00817194
+-0.0417568 0.0797359 -0.0197866
+-0.0466787 0.0650533 -0.0138917
+0.0360448 0.0392022 -6.35907e-05
+-0.0192403 0.0387115 -0.0129795
+0.0431391 0.098698 0.00317491
+-0.0224767 0.091498 -0.0352097
+0.0093588 0.0524416 -0.0295377
+-0.0833358 0.105954 0.0271122
+-0.0146006 0.127548 0.000963555
+0.0122907 0.0652688 -0.0305463
+-0.0515682 0.0488001 -0.00762593
+0.0214986 0.122612 0.0290301
+-0.0271235 0.11599 -0.0147668
+0.0381316 0.109734 0.0151646
+-0.00681664 0.0854791 -0.0376549
+-0.0147515 0.07145 -0.0385454
+-0.0659657 0.129697 -0.00887578
+0.0359834 0.11203 0.00292702
+-0.0631298 0.144906 -0.0101196
+0.00903132 0.0343268 -0.014573
+-0.0348704 0.101474 -0.022105
+-0.0693077 0.0614952 0.0145437
+0.0349262 0.0896582 -0.0169179
+-0.037886 0.109925 -0.0191545
+-0.0372775 0.0472266 -0.0193178
+0.0112393 0.0349033 0.0350041
+0.0430009 0.0705508 -0.00279727
+0.0400623 0.0956447 -0.00679711
+-0.0676126 0.155322 0.00651001
+0.0598737 0.0581052 0.00916393
+-0.061495 0.100138 0.0425963
+-0.0575075 0.0435504 0.0160321
+0.0228298 0.0827896 -0.0258286
+-0.0115004 0.0925527 0.0561224
+-0.0223058 0.184466 -0.0180708
+-0.0624348 0.161527 -0.0435948
+-0.0143997 0.0383922 -0.000568703
+-0.0793362 0.0881239 -0.0095476
+-0.0548971 0.10981 -0.018029
+-0.0707512 0.156365 0.0199172
+0.0244407 0.0405616 0.0372831
+-0.0545055 0.113958 0.0351234
+-0.00749363 0.0547355 0.05304
+0.044284 0.0819099 0.0251484
+0.0117499 0.0519912 0.0501875
+-0.0706809 0.109318 0.0378585
+-0.0640006 0.161566 -0.01976
+-0.0122192 0.0378665 0.050479
+-0.0715061 0.148353 0.0408514
+-0.0652549 0.0667307 0.0320259
+0.0162842 0.118981 -0.0122323
+-0.0584978 0.0959813 0.0440843
+-0.0261553 0.169713 -0.0187023
+0.0163086 0.108997 -0.0174538
+0.019812 0.035154 0.0274956
+0.0403843 0.0547484 -0.00641578
+-0.0370524 0.128064 0.00917633
+-0.0181528 0.0388364 -0.0128782
+-0.0703699 0.144073 -0.0154773
+-0.0821317 0.15265 0.0057634
+-0.0121975 0.182647 -0.0286755
+-0.0179487 0.126229 0.0234428
+-0.0713342 0.065071 0.0216423
+-0.0135059 0.0357879 0.0504712
+-0.0551243 0.0482803 0.0389113
+-0.043841 0.0970933 -0.0219235
+0.0307935 0.0619124 0.0409121
+-0.0872404 0.149912 0.0282765
+-0.0777833 0.0694772 0.0182331
+-0.0479563 0.0699321 0.0400053
+-0.0325179 0.0704032 0.0404934
+-0.04199 0.0336868 -0.0166047
+0.00497409 0.0340864 0.0145521
+-0.0449304 0.0643377 0.0396087
+-0.0778694 0.106226 -0.00738941
+-0.0126221 0.0389953 0.033657
+-0.0632121 0.172304 -0.0615699
+-0.0276205 0.0874255 -0.0346253
+-0.0625254 0.138119 0.0359126
+0.00425284 0.0711834 -0.0342035
+-0.0788838 0.153282 0.0303949
+0.00652169 0.0362747 0.0255863
+-0.0662316 0.0345008 0.0140489
+-0.02106 0.174206 -0.0148174
+0.0185004 0.109841 0.0391791
+-0.0646081 0.0450546 0.000685835
+-0.0136021 0.0363077 -0.0261392
+-9.29522e-05 0.131467 0.0096514
+-0.0451771 0.128971 0.00184527
+0.00750493 0.0561002 0.0528313
+0.0361319 0.074097 0.0381795
+0.022807 0.125614 0.0138049
+-0.0196774 0.0509888 -0.0303435
+-0.0930693 0.120128 0.0262942
+-0.0230193 0.120798 -0.0098328
+-0.0271496 0.0384219 0.0311819
+-0.0748224 0.0935599 -0.014192
+-0.0354943 0.119369 0.0303337
+0.060906 0.0609648 0.0111554
+0.0112135 0.130703 0.0137986
+-0.0266186 0.0589226 0.0382515
+0.0218458 0.0672628 0.0473581
+0.00922858 0.116392 0.0380826
+-0.0579872 0.0576809 0.00662705
+-0.0151861 0.168246 -0.0215615
+0.0431809 0.0791159 0.0272636
+-0.0755673 0.0727762 -0.00660131
+0.0242315 0.0818412 -0.0251267
+-0.0250124 0.0782139 0.0518051
+-0.0338224 0.0338142 0.00692539
+-0.00946746 0.0362215 -0.025425
+-0.0416936 0.0652006 -0.0145392
+-0.0546754 0.0335075 0.00116676
+-0.0233106 0.15969 -0.00223977
+-0.0842752 0.141807 0.00320102
+-0.0818378 0.131303 0.0516681
+-0.0234556 0.161598 -0.0145283
+-0.0499699 0.150693 0.011804
+-0.010495 0.0471724 0.0477907
+0.0380379 0.075373 0.0356471
+-0.0450739 0.0363473 0.0448052
+-0.0737333 0.15548 -0.0259091
+-0.0716137 0.178389 -0.0484
+-0.0384987 0.0691035 0.0417776
+0.00141943 0.122927 0.0347542
+-0.057332 0.137224 -0.00518105
+-0.0557698 0.136063 -0.00393718
+0.0558337 0.0494217 0.00919997
+-0.0580135 0.04944 0.00163802
+-0.0357372 0.111668 -0.0181975
+-0.0550044 0.145721 -0.00143834
+0.00110225 0.0344701 0.00796988
+-0.0157589 0.038402 0.00281447
+-0.0521458 0.121812 -0.0107191
+-0.00850406 0.11834 0.0382239
+-0.0498654 0.102788 -0.0210486
+-0.0630574 0.15313 -0.033029
+-0.0734528 0.143001 -0.00787011
+-0.0577717 0.0334512 -0.00484461
+-0.0926703 0.124234 0.0402542
+-0.0236253 0.0450591 -0.0281331
+0.0444641 0.0686626 0.00115575
+-0.0394989 0.0620307 0.0413298
+-0.0489043 0.0531988 0.0353928
+-0.0549375 0.140991 0.0293007
+0.0134789 0.100443 0.0476777
+0.0344381 0.102088 0.0341795
+-0.0629237 0.112473 -0.0138486
+0.0456048 0.0918125 0.0071715
+-0.0679688 0.135528 -0.00836676
+-0.0561131 0.145329 0.0311927
+0.0222077 0.0403059 0.0403109
+-0.0930104 0.131018 0.0202297
+-0.073597 0.161047 -0.0349306
+-0.073142 0.0762988 0.0362199
+-0.0868887 0.102318 0.0233696
+-0.074876 0.107788 -0.00905848
+-0.061968 0.159998 -0.0366167
+0.0234524 0.0505688 0.0407158
+-0.0374809 0.113893 0.0340704
+-0.052457 0.144675 0.0183665
+0.000496502 0.103028 0.0440499
+-0.0107515 0.039289 0.0373765
+0.0177346 0.123618 -0.0052308
+-0.0278908 0.0903405 -0.0316075
+0.0555538 0.0665692 0.0013688
+-0.0679616 0.181138 -0.0572245
+-0.0246921 0.156571 -0.00408158
+-0.0295045 0.112518 0.0356692
+-0.0523224 0.146252 0.0184018
+-0.0831779 0.111548 0.00129095
+0.0381693 0.109765 0.0141664
+-0.0465876 0.132486 0.00741919
+0.0351546 0.112861 0.0227039
+0.00752051 0.0855871 0.0562726
+-0.0236256 0.0464233 -0.0274769
+-0.0820555 0.138062 0.0474469
+-0.0332203 0.171246 -0.00251328
+-0.0471051 0.157621 -0.00763511
+-0.0883909 0.0874867 0.0154625
+-0.0769362 0.0914256 0.0381174
+-0.075265 0.148568 -0.0158698
+0.015355 0.119233 -0.0124997
+-0.0073165 0.13056 0.0112981
+-0.0167502 0.070002 -0.0383082
+-0.0672167 0.147775 -0.0296135
+0.00424945 0.126892 0.0299609
+0.0188897 0.120837 -0.00821554
+-0.0628446 0.0334683 -0.00588606
+0.0333858 0.103442 0.0343819
+-0.0748011 0.0878022 -0.0147955
+0.00250445 0.0519435 0.0530423
+-0.0565994 0.0548437 -0.000400453
+-0.0657591 0.0794867 -0.0178324
+-0.0893947 0.113204 0.00833335
+0.00550466 0.122397 0.0349805
+-0.0593516 0.0471429 0.038917
+-0.0691412 0.109612 0.0381472
+0.012166 0.127075 0.0284779
+0.00215147 0.0340847 -0.0194818
+-0.0357383 0.152143 0.000762654
+-0.0225608 0.0608496 0.0442445
+-0.00675345 0.0727271 -0.0364938
+-0.0504985 0.0776737 0.0437561
+0.012653 0.128571 8.59956e-05
+-0.0775017 0.148428 0.039927
+0.0194833 0.0961991 0.0471957
+-0.00134544 0.0999407 0.0490888
+-0.00745251 0.100521 0.0469096
+0.0293349 0.108769 0.0355782
+-0.0628076 0.0881622 -0.0190458
+0.0438908 0.0973298 0.0041758
+-0.0618594 0.154827 0.00385225
+0.0224603 0.0878572 0.0487762
+-0.0684419 0.0805248 0.0412962
+-0.0414824 0.0817867 0.0423837
+-0.0394972 0.0591632 0.0405173
+-0.0699138 0.0616664 0.0106715
+-0.0256486 0.050648 -0.0266189
+-0.0189668 0.125144 0.0245507
+-0.0548939 0.161294 0.00305835
+0.0593671 0.0566851 0.00917266
+-0.0619624 0.0371632 0.0192279
+-0.0458599 0.129594 0.0221735
+-0.078334 0.175787 -0.0461739
+-0.00822607 0.100046 0.0481626
+-0.0580744 0.136937 -0.00566118
+-0.0915979 0.115467 0.0229868
+0.0255167 0.123738 0.0133816
+-0.0331932 0.0348891 0.047012
+-0.076964 0.129602 -0.00711544
+-0.0598599 0.0358888 0.0454954
+0.0450831 0.0463904 0.0280485
+-0.0315243 0.0802674 0.0412906
+-0.0239631 0.11903 -0.0119726
+-0.0346068 0.0483825 -0.0183276
+-0.0825971 0.103328 -0.00360734
+-0.0887132 0.118572 0.00232339
+-0.0188128 0.082729 -0.0390748
+-0.0866936 0.0833424 0.0154842
+0.00371617 0.0348648 0.0208524
+0.0267042 0.122545 0.0181085
+-0.0738109 0.0935956 -0.0146814
+0.0287557 0.0348074 0.0132587
+-0.0344434 0.174206 -0.0015497
+-0.053794 0.086942 -0.0216962
+-0.0584166 0.126929 0.0401124
+-0.0837712 0.127162 0.0508887
+-0.0249431 0.0907384 -0.0344432
+-0.0817429 0.0748341 0.0165378
+-0.0709721 0.148372 0.0407622
+0.0453179 0.0861686 0.00320477
+-0.052904 0.159748 -0.00276649
+-0.0630387 0.15529 -0.0125891
+-0.0628558 0.170957 -0.0505963
+0.0198342 0.0408002 0.0424386
+0.0114164 0.0403794 -0.0231815
+-0.0270194 0.12568 0.0143315
+-0.0340325 0.126267 0.001455
+-0.0096483 0.171546 -0.0270746
+0.0461889 0.0792428 0.016179
+-0.0314795 0.0774889 0.0410863
+0.00441886 0.0361314 -0.0238164
+0.0140504 0.0379362 -0.0217239
+-0.0064667 0.128955 -0.000718006
+-0.00729042 0.0388645 0.0312728
+-0.0537922 0.14151 -0.001138
+-0.0843649 0.125772 0.0501053
+-0.0489003 0.033496 0.00596365
+-0.00972794 0.166651 -0.0186764
+-0.0537672 0.0812389 -0.0213883
+-0.0327797 0.0337757 0.0180041
+-0.0738907 0.107101 0.0373066
+0.0441357 0.0659575 -7.19207e-05
+-0.0929503 0.128215 0.0122521
+-0.0898716 0.133794 0.0302191
+-0.0643705 0.154697 0.0294695
+0.023375 0.0504685 -0.0225374
+-0.052801 0.0690675 0.0379843
+-0.0823518 0.0966615 0.0320686
+0.00650836 0.0813916 0.0558754
+0.0249135 0.0390596 0.0323329
+0.0422621 0.0746939 -0.00581448
+-0.0239734 0.0636045 0.0427616
+-0.0648684 0.0967433 -0.0176098
+-0.0661842 0.163921 -0.0584969
+-0.0338218 0.0886934 -0.0246941
+-0.0545067 0.102902 0.0418134
+-0.0298032 0.034287 0.0163531
+0.00993007 0.126906 -0.00476687
+-0.0376745 0.0379475 0.0444361
+-0.0658844 0.114191 0.045149
+0.0205436 0.121905 -0.00538746
+-0.0134808 0.108609 0.0426611
+-0.0484883 0.0960313 0.0444485
+-0.0326323 0.125019 -0.000941466
+-0.0254216 0.0999543 -0.0239282
+-0.0410688 0.11258 -0.017122
+-0.0434945 0.0676224 0.0409141
+0.0153651 0.0493118 -0.0259325
+0.00422707 0.0782528 -0.0345112
+0.0285181 0.0968051 -0.0184722
+-0.0597676 0.0796261 -0.0193897
+-0.0714963 0.118989 0.0533881
+-0.0566004 0.0335105 0.0169198
+-0.0880799 0.113511 0.0432934
+-0.0208348 0.0956185 -0.0294009
+-0.010501 0.0759377 0.0571751
+-0.0797391 0.110092 0.0425713
+0.0423965 0.0704871 -0.00480867
+-0.071352 0.110742 0.0439553
+-0.0617103 0.0604885 0.000571471
+-0.000492298 0.0605899 0.0560413
+-0.0819087 0.121685 0.0492514
+0.0133657 0.116504 -0.0155461
+-0.0035043 0.0589584 0.0540181
+-0.0700245 0.0833021 0.0413654
+0.0410401 0.0656705 0.029359
+-0.0623583 0.164673 -0.0485921
+0.027252 0.0549488 0.0409918
+-0.0568093 0.0883611 -0.0215879
+0.0409151 0.0390283 0.00994476
+0.0189976 0.0408013 0.0429893
+0.038497 0.0527286 0.031838
+-0.0436566 0.0592613 -0.0123074
+-0.0456035 0.0504974 -0.010193
+-0.0427107 0.0335694 -0.0203532
+-0.0107484 0.0348144 0.0431359
+0.0366972 0.106807 -0.00382741
+-0.0475 0.109814 0.0383224
+-0.0581584 0.0685383 0.037238
+-0.0888985 0.128369 0.0446279
+-0.0618211 0.164489 -0.0586698
+-0.0622151 0.166391 -0.0605094
+0.000668194 0.039196 0.03081
+-0.0494963 0.0974185 0.0440407
+-0.0327214 0.154341 -0.00788327
+0.00831584 0.0624371 -0.0312473
+-0.0441024 0.124581 0.0229348
+-0.00474585 0.0712867 -0.0359934
+-0.0211964 0.0725528 0.0524066
+0.0440002 0.0888695 -0.00280666
+0.0083541 0.0524293 -0.0297113
+0.0104364 0.0472441 0.0475563
+0.0130443 0.113867 -0.0167218
+0.035717 0.0533288 0.0320909
+-0.0439793 0.169659 0.00035763
+-0.0261771 0.0395393 0.0541115
+0.0142627 0.0751304 -0.0300927
+0.0172008 0.0849074 -0.0286671
+-0.0301348 0.156065 -0.00950629
+0.0153602 0.0672491 0.0520407
+0.038354 0.0547461 -0.00609927
+0.0326073 0.112448 0.0288842
+-0.0230436 0.0879523 0.0537722
+-0.0507107 0.0708743 -0.0151986
+0.00170937 0.0361659 0.0210822
+-0.0106905 0.18126 -0.0286694
+-0.0543257 0.121248 0.0372193
+-0.086895 0.143263 0.0379805
+-0.0300853 0.179019 -0.00589649
+-0.0624495 0.15591 0.022857
+-0.0597659 0.0448149 0.0126042
+0.00226448 0.0346925 0.0189009
+0.00270214 0.10527 -0.0214784
+-0.0843731 0.110309 0.0377873
+-0.0603328 0.153535 0.00105643
+-0.00601124 0.0348376 0.0423067
+-0.0419337 0.160883 0.00416203
+0.025639 0.0740461 0.0458389
+-0.0724467 0.0361675 0.00255211
+-0.0515329 0.0431219 -0.00982617
+-0.0668209 0.036036 0.0339126
+0.0328708 0.0740673 0.0404957
+0.0429413 0.0682748 0.0268013
+-0.0687158 0.171626 -0.0372714
+0.0231488 0.116662 0.0336476
+0.0322304 0.0505255 0.0340589
+-0.0869233 0.112018 0.0232463
+-0.078057 0.0907599 -0.0115869
+-0.0538087 0.119788 0.0361741
+0.00650273 0.121045 0.0359095
+-0.00425882 0.128035 0.0283342
+-0.0558184 0.158024 -0.000144968
+-0.0699106 0.10657 -0.0124287
+0.0101685 0.124401 -0.00806495
+-0.0774125 0.06897 0.0169693
+-0.0204069 0.09844 -0.0243451
+-0.0678094 0.180556 -0.0587896
+-0.0490427 0.0341369 0.0285626
+-0.0112286 0.0338605 -0.0218986
+0.0300773 0.0754873 0.0435133
+0.00030024 0.0612559 -0.033673
+0.000950727 0.129943 0.000110463
+-0.083524 0.154076 0.0213615
+-0.0688604 0.0819375 0.0416515
+-0.0674926 0.0889102 0.043735
+-0.000658033 0.0525337 -0.0307361
+-0.0805064 0.103384 0.0314383
+-0.0596514 0.142474 0.0348633
+-0.00849673 0.105867 0.0437425
+-0.0317522 0.0735748 -0.0285005
+0.0171692 0.0345228 -0.00186568
+-0.0229141 0.111944 -0.0185359
+-0.00375332 0.07411 -0.0361467
+-0.00849121 0.103027 0.0437022
+-0.0323725 0.16532 -0.00484492
+0.0250885 0.119458 -0.00473925
+0.00228893 0.0341509 0.0103163
+0.03989 0.0630598 0.0312004
+-0.0146968 0.175692 -0.019662
+-0.00218576 0.0355897 -0.0160761
+0.0318792 0.0686784 0.0407831
+-0.0783091 0.16249 -0.0249404
+-0.0807007 0.0752735 0.0231846
+-0.00686818 0.0385321 0.0081342
+-0.0114932 0.036278 -0.0256312
+-0.076524 0.178854 -0.050295
+-0.093475 0.1283 0.0242551
+-0.063929 0.0354009 0.0416662
+-0.064733 0.15377 0.0322824
+0.0293628 0.105677 -0.0139766
+-0.0544684 0.119419 -0.0121872
+-0.0878486 0.143233 0.0360974
+-0.0866257 0.081991 0.0115028
+0.0324736 0.0490215 0.0326282
+-0.0472578 0.121113 0.0280085
+0.0275416 0.0349624 0.00541796
+-0.0827616 0.091206 0.0312465
+-0.0627318 0.159944 -0.0435973
+0.0444941 0.0637658 0.0284543
+0.0512305 0.0723962 0.00737259
+-0.0374845 0.100078 0.0419234
+0.00446502 0.0977292 0.050995
+-0.090055 0.132436 0.0352224
+-0.0771832 0.107237 0.0346968
+0.0132863 0.0695708 -0.0313558
+-0.0833513 0.099287 0.0301656
+-0.050588 0.0599426 0.0326193
+-0.0116999 0.0599414 -0.0352829
+-0.0629554 0.156782 -0.0386059
+0.0452979 0.0875774 0.0181674
+0.0367705 0.074074 0.0373409
+-0.0378297 0.12794 0.00447467
+0.000472166 0.0388678 0.0256446
+0.00293826 0.0356401 -0.0151121
+0.0194959 0.11257 0.0373879
+0.0178674 0.103889 -0.0200126
+-0.0197782 0.075693 -0.0390468
+-0.0162539 0.171251 -0.016682
+-0.0719027 0.156807 -0.0389123
+-0.0816716 0.0734987 0.0125379
+0.00248698 0.0399628 0.0461692
+-0.0118767 0.105907 -0.0227385
+-0.0633264 0.159631 -0.0180726
+-0.0147126 0.0384481 0.00298688
+-0.0598094 0.0896854 -0.0200419
+-0.0586861 0.0603162 0.0231261
+-0.0518133 0.0531756 0.0296409
+-0.0201151 0.123178 -0.00639815
+-0.0197736 0.0998405 0.0442778
+-0.00649912 0.118331 0.038456
+-0.0868133 0.0846987 0.0154763
+-0.0052065 0.0389581 0.0316148
+-0.0886495 0.113065 0.0417436
+0.0045077 0.107168 0.0418669
+-0.0635616 0.174109 -0.0525858
+-0.0657828 0.082373 -0.0185031
+0.00281465 0.0379685 -0.0135285
+-0.0863919 0.099468 0.00241821
+0.0544797 0.0539552 0.0258897
+-0.0865727 0.08823 0.0252282
+-0.0778042 0.156927 -0.0169128
+-0.00349196 0.114194 0.0413026
+-0.0523232 0.13528 0.029621
+0.0359531 0.0673443 0.0378699
+0.0103588 0.130588 0.0191927
+0.0383356 0.10264 -0.0058258
+-0.0906686 0.139207 0.0161786
+-0.0534974 0.0876167 0.045276
+-0.0609918 0.138116 0.0346365
+-0.010493 0.114167 0.0405696
+-0.0260866 0.0349169 0.0485155
+-0.0519529 0.0531525 0.0236322
+-0.0670544 0.153567 -0.0495044
+-0.000486159 0.0689333 0.056515
+-0.034827 0.0929417 -0.0239227
+0.0157074 0.0821031 0.0526782
+-0.0185046 0.116829 0.0366774
+-0.0357116 0.0358916 0.0155029
+-0.0711005 0.148774 -0.0369587
+-0.0146296 0.185817 -0.0244743
+-0.0871678 0.11039 0.0183619
+-0.0897192 0.129664 0.0425949
+-0.0278047 0.074956 0.0433932
+-0.0408028 0.033851 -0.0276993
+-0.0260362 0.165356 -0.00798775
+-0.022832 0.0348259 0.0458328
+-0.0327846 0.0346162 0.0403814
+0.0292084 0.0350186 0.0149853
+-0.0908558 0.14471 0.0151666
+-0.0389013 0.0336802 -0.0215651
+-0.00950572 0.0590791 0.0548422
+-0.0252687 0.0931263 -0.0308668
+0.00727173 0.0667978 -0.0321541
+-0.0478216 0.109884 -0.018362
+0.00164525 0.0348132 0.00406568
+0.0377191 0.0632143 0.0350986
+-0.0468821 0.108426 -0.0186436
+0.0252001 0.0818001 -0.0245703
+0.00238035 0.127411 0.0292755
+0.0255053 0.103245 -0.0173339
+0.011492 0.0445292 0.0444785
+0.0458991 0.0414061 0.011234
+-0.0302302 0.0537755 -0.0183734
+-0.0870355 0.111737 0.0342553
+0.0298569 0.0835122 0.0432289
+0.0344154 0.0409101 0.0271225
+0.00697892 0.131225 0.0065571
+0.0443985 0.0748779 -0.000803542
+-0.0703751 0.112557 0.0480687
+0.0398576 0.101362 0.0261824
+-0.0146217 0.0450296 -0.0279689
+0.0305372 0.0592022 0.0405121
+-0.0427308 0.169809 0.000879537
+-0.00260639 0.0419888 -0.0252454
+0.000821596 0.0412233 0.0465397
+0.0447686 0.0889311 -0.000811854
+-0.00992934 0.166943 -0.0180552
+-0.0743075 0.170773 -0.046055
+-0.0564797 0.0356812 -0.0108166
+0.0302902 0.078207 0.0438447
+-0.0601407 0.0410386 0.0173224
+-0.0404944 0.0478337 -0.0126145
+-0.00989846 0.0384846 0.0238656
+-0.0338875 0.0780022 -0.0265044
+-0.0309197 0.0805646 -0.0325792
+-0.0788495 0.1177 0.0505094
+0.00204515 0.0345955 -0.0162029
+-0.0115453 0.0445033 0.0495732
+-0.048476 0.116631 0.0320328
+-0.0121876 0.113225 -0.0179296
+-0.0193167 0.0754023 0.0546877
+-0.0653246 0.0648097 0.0284194
+-0.0417336 0.0739469 -0.0182277
+0.0129121 0.0806948 0.0538726
+-0.087913 0.0900756 0.00446758
+-0.0459794 0.167363 0.00259136
+-0.00407632 0.124795 0.032822
+0.00214512 0.131665 0.0104804
+-0.0242177 0.0387671 0.0542484
+-0.0864391 0.131188 0.0477462
+0.0208043 0.12624 0.020186
+-0.0682771 0.163789 -0.0539724
+-0.0225729 0.172715 -0.0135004
+-0.0434823 0.12913 0.00531313
+-0.0465355 0.0790498 0.0431447
+0.0415243 0.0623608 0.0290336
+0.0206713 0.0868458 -0.0260413
+-0.0616015 0.0614498 -0.00273471
+-0.0698033 0.087974 -0.016854
+0.00908719 0.0358267 -0.00842564
+-0.0333922 0.068118 -0.0184774
+-0.0820819 0.150001 0.0344048
+0.0348029 0.113058 0.00110003
+-0.00477205 0.0345951 0.0445699
+-0.0740526 0.172196 -0.0480444
+-0.0192069 0.125855 0.0229991
+-0.0404977 0.0520197 0.0394004
+-0.0367886 0.156481 -0.0105439
+-0.0531367 0.0490718 0.026657
+0.015473 0.0962531 0.0481291
+-0.0492612 0.115146 -0.0157671
+0.0536465 0.0728799 0.00890065
+-0.0263571 0.0549776 0.0383278
+0.0333229 0.0997779 -0.013667
+-0.0551968 0.138069 -0.00309725
+-0.0563111 0.122698 0.0396267
+-0.02088 0.107273 -0.0222055
+0.000924532 0.100829 -0.0227814
+-0.0907853 0.117276 0.00630342
+-0.0134985 0.11551 0.0389419
+-0.0921826 0.114725 0.0193089
+-0.0218136 0.116051 -0.0148581
+-0.0915139 0.140599 0.0171878
+-0.0723659 0.100858 0.0389128
+-0.0227439 0.0669905 -0.0360641
+0.0133914 0.0448806 -0.0247967
+-0.0334245 0.0346344 0.0419763
+-0.083931 0.103265 0.0277985
+-0.0172469 0.116672 -0.0155678
+0.0141307 0.108667 -0.0183815
+-0.0676215 0.0688155 -0.00772966
+-0.049646 0.138599 0.0173958
+-0.0836562 0.0966099 0.0305537
+-0.0662913 0.165749 -0.0234747
+0.0434836 0.0734019 -0.00279222
+-0.0672802 0.0405919 -0.00423161
+-0.0468922 0.0334761 -0.010008
+-0.00688399 0.107372 -0.022762
+-0.0471129 0.13404 0.0104021
+-0.0613177 0.0470312 0.00669678
+-0.0857102 0.0912822 0.000468321
+-0.0564836 0.0589584 -0.00242578
+-0.0544716 0.0607811 0.0269495
+0.0392359 0.0685928 0.0338195
+-0.0907738 0.125596 0.0437739
+-0.0123469 0.0383491 0.0216787
+-0.00750765 0.123161 -0.01054
+0.0441233 0.0959295 0.00318315
+0.0262791 0.0675449 -0.0231801
+-0.0432671 0.0465873 -0.0113888
+0.00633058 0.0567988 -0.0308016
+-0.0135852 0.123715 -0.00700086
+-0.00140945 0.12836 0.0278943
+-0.0283882 0.0380697 -0.0179434
+0.0478387 0.0734572 0.0126134
+0.0038745 0.0367677 -0.0140867
+-0.05057 0.0335281 0.00739754
+0.036728 0.111857 0.010401
+-0.00844614 0.128164 -0.00189615
+-0.0247501 0.0578943 0.0408638
+-0.0467618 0.0657183 0.0385512
+0.038544 0.0726461 0.034619
+-0.00748755 0.111393 0.0423782
+-0.0658988 0.116581 -0.00961273
+-0.0415297 0.118854 -0.0137293
+-0.062219 0.164671 -0.0505894
+-0.00870995 0.128748 0.0252759
+-0.0315128 0.115295 0.0334421
+0.0503991 0.0466746 0.0233055
+-0.0753594 0.113961 -0.00568407
+-0.0866603 0.10494 0.00737931
+-0.0457163 0.0345386 0.0341935
+-0.0466235 0.0548092 -0.0105711
+-0.0516722 0.0693248 0.037985
+-0.0826957 0.0898386 0.0312187
+-0.0154881 0.0758696 0.0561745
+-0.0518084 0.0913012 -0.0220555
+-0.0751346 0.145812 -0.00886348
+-0.0732189 0.155097 0.0278276
+-0.0127272 0.0348945 -0.0256797
+-0.0698308 0.071946 0.0353261
+-0.0657288 0.163321 -0.0189522
+-0.0464914 0.08757 0.0446532
+0.0296359 0.112746 0.0324848
+0.0275411 0.044881 0.0360262
+-0.0187772 0.186086 -0.0166294
+-0.0884282 0.0874635 0.00747939
+0.0325508 0.115423 -0.000329209
+-0.0410423 0.0336551 0.000178151
+-0.0638018 0.0632948 0.0265284
+-0.0224569 0.0524128 0.0435307
+0.057327 0.0700157 0.00587175
+0.0345611 0.0740948 0.0394254
+-0.0409173 0.0351021 0.0417247
+-0.0742127 0.154103 -0.0229066
+-0.0824094 0.151775 0.0307901
+-0.0803828 0.11899 0.049226
+-0.010458 0.0953808 -0.0330949
+-0.0630414 0.149018 -0.0195802
+-0.0293211 0.123712 0.0208659
+-0.0231795 0.0622145 0.0434152
+-0.0287301 0.172704 -0.00834509
+0.00364827 0.128043 -0.00393793
+-0.0642706 0.166732 -0.060237
+-0.0108397 0.175678 -0.0290324
+0.0244048 0.112688 0.0354614
+-0.047561 0.0361661 -0.0123414
+-0.0534987 0.0427392 0.045857
+-0.0231257 0.165273 -0.0171671
+0.0388181 0.104067 -0.00210374
+-0.0356652 0.156121 -0.0104266
+-0.072524 0.106883 0.0374001
+-0.0331471 0.172636 -0.0149853
+0.040265 0.0391745 0.017119
+-0.0342456 0.0708723 -0.0195447
+-0.0687416 0.11428 0.0497375
+-0.0559525 0.0473442 0.0115659
+-0.0244817 0.107102 0.0411704
+-0.00571075 0.0627939 -0.0354611
+0.00805559 0.124767 0.0327601
+-0.0144892 0.0800879 0.0568709
+-0.0444848 0.0775765 0.0423436
+-0.063261 0.129725 0.0418859
+0.0349031 0.111324 -0.00180439
+0.00654043 0.0954774 -0.0291051
+-0.0290961 0.0410008 0.0527549
+-0.0234218 0.0738847 0.0503501
+-0.0567453 0.0342237 0.02862
+0.0376516 0.0425419 0.0281451
+0.0336732 0.115326 0.0207292
+-0.0174938 0.122238 0.0311921
+-0.073145 0.152886 0.0338966
+0.0392908 0.0660103 -0.00977956
+-0.0671096 0.125666 0.0504247
+-0.0815589 0.10988 0.0387619
+-0.00472043 0.0655745 -0.0349603
+-0.0584923 0.0818911 0.043717
+0.0395145 0.0415874 0.025748
+-0.0134628 0.0989564 0.047529
+-0.086226 0.143316 0.0387173
+-0.0675131 0.145595 0.0418048
+-0.0142233 0.174199 -0.0261217
+-0.0564238 0.0718073 0.0399857
+-0.0748487 0.0664559 0.00653551
+0.0254329 0.0835701 0.0474102
+-0.0735012 0.145587 0.0437725
+-0.0684894 0.104161 0.0391613
+0.046334 0.0533506 -0.00578803
+0.0111342 0.034487 -0.019828
+-0.0362745 0.033679 0.00474125
+-0.0580289 0.129633 -0.0066561
+-0.0674348 0.171149 -0.0382253
+0.0172278 0.0353072 0.0394845
+0.0290523 0.120756 0.00899975
+-0.0788357 0.148682 -0.00186858
+-0.0257486 0.0365571 0.0540093
+-0.076603 0.120411 0.0526033
+-0.0107827 0.0784509 -0.0379132
+-0.0283013 0.0648191 -0.0294785
+-0.0318386 0.0929851 -0.0242124
+-0.0504991 0.156412 0.0101915
+0.0435836 0.0722927 0.0259867
+0.0187342 0.112585 -0.0153321
+-0.0434831 0.0762058 0.0427502
+-0.00415334 0.0367895 0.0481682
+-0.0469304 0.116649 -0.0154073
+-0.0434764 0.0335212 0.0034233
+-0.0527322 0.0723715 -0.0160877
+-0.0593593 0.0651443 0.0328932
+-0.05784 0.0926528 -0.0211082
+-0.07134 0.156839 -0.0007386
+-0.000856246 0.103081 -0.0226647
+-0.000582144 0.0347482 -0.0236897
+-0.0384944 0.0464446 0.0402202
+0.0567142 0.0522491 0.00518691
+-0.0616825 0.0346164 0.0411183
+0.00851655 0.0758606 0.0561295
+0.0196258 0.127091 0.0083394
+-0.0719446 0.159605 -0.0399328
+-0.0356475 0.0379034 -0.0136529
+0.0172444 0.125917 0.0260258
+0.0094903 0.116849 0.0377607
+0.0232634 0.124781 0.0210949
+-0.0349607 0.125018 0.0217662
+0.0185443 0.12732 0.00510228
+0.0118903 0.0349087 0.0279111
+-0.00450764 0.0842735 0.0572857
+-0.0148777 0.0364156 0.0513074
+-0.0861402 0.0859086 0.000475654
+-0.0472303 0.164057 -0.00679428
+0.010042 0.0970288 -0.0247384
+0.0134328 0.0846923 0.0528905
+0.0456558 0.0449086 0.0258493
+-0.00349992 0.0746709 0.0587938
+-0.0719223 0.112846 0.049279
+-0.0117304 0.0670858 -0.0365895
+-0.0107336 0.0670714 -0.0363227
+0.0281295 0.110111 0.0355841
+0.00524969 0.0395071 0.0332712
+-0.030417 0.0360576 0.0517185
+-0.0191865 0.172705 -0.0222871
+0.032634 0.0954843 -0.0150589
+-0.0901468 0.129651 0.0415795
+0.015143 0.0346779 0.0251566
+-0.0926446 0.122835 0.02928
+-0.0735699 0.131215 0.0516643
+-0.0342826 0.126777 0.01609
+0.00752119 0.0813632 0.0555605
+-0.0325031 0.116645 0.0321616
+0.0237641 0.0349876 0.0120857
+-0.0592101 0.142401 0.0336275
+0.0449966 0.0931749 0.00418165
+0.0373285 0.0874946 0.0364747
+0.0175277 0.0348888 -0.0135142
+0.0451983 0.0889806 0.0171667
+0.0123957 0.0434077 -0.0245497
+-0.0759299 0.126701 -0.00794305
+-0.0895421 0.090213 0.0124508
+0.0392717 0.0938049 -0.00924672
+-0.087269 0.112677 0.0244432
+0.0369017 0.0770479 -0.0128074
+-0.019615 0.127443 0.00679651
+-0.058632 0.131139 0.0380532
+-0.0759599 0.0675387 0.00855626
+-0.0867924 0.139107 0.00519652
+-0.051888 0.0528335 0.0130005
+-0.0604943 0.108372 0.0386396
+-0.0620497 0.155563 0.0244621
+-0.0414999 0.0690877 0.0417125
+-0.000194321 0.121911 -0.011267
+0.0260147 0.0563895 0.0427437
+-0.00627779 0.0395112 0.048561
+0.0073902 0.0433817 -0.0245369
+0.00650458 0.105723 0.0419107
+-0.0890324 0.144705 0.01118
+0.0241216 0.0968854 0.045587
+-0.0284948 0.111359 -0.0178892
+-0.0842319 0.104575 0.0266516
+-0.0575865 0.0586919 0.0194779
+-0.0281815 0.125725 0.0109634
+-0.0638193 0.158306 -0.0465978
+-0.0355455 0.11407 -0.0167228
+-0.0683421 0.111385 0.0423299
+-0.0144529 0.178665 -0.0210547
+-0.00977952 0.0372711 0.0498001
+-0.0625714 0.164724 -0.0395894
+-0.088699 0.0915828 0.0224195
+-0.0594754 0.144099 -0.00268098
+-0.0925679 0.116061 0.0213084
+-0.0317212 0.0350332 0.0489115
+-0.0106525 0.165176 -0.016643
+0.00734712 0.12316 -0.0106668
+-0.0554936 0.104327 0.041387
+0.00250176 0.0620246 0.0566613
+-0.00947595 0.130265 0.0133884
+0.0276842 0.0768145 0.0453329
+0.00629218 0.0639808 -0.0323017
+0.00798329 0.130466 0.00265255
+0.0573764 0.0621793 0.0248727
+-0.0628961 0.158419 -0.0175871
+-0.0639761 0.129691 -0.00851425
+-0.0630898 0.161515 -0.0224551
+-0.0838815 0.111187 0.0425305
+0.0464938 0.0778639 0.0121785
+-0.0265128 0.116639 0.0325108
+-0.0545075 0.047347 0.012948
+-0.0677458 0.149084 -0.0355035
+-0.0687437 0.173038 -0.0415702
+-0.0258142 0.0389536 0.0363636
+0.0354622 0.0808406 0.0390375
+-0.028407 0.156859 -0.0100656
+-0.0728523 0.100773 -0.0133449
+-0.000973441 0.0353569 0.0464761
+0.0217031 0.104101 -0.0182402
+-0.0900893 0.135135 0.0242145
+-0.0209098 0.0382599 0.00734769
+-0.0384975 0.0676842 0.0417259
+0.0505086 0.0461176 0.0032623
+-0.0324927 0.0932098 0.0444316
+-0.029469 0.17882 -0.00554327
+-0.0770271 0.0743283 0.0300122
+0.0313581 0.116535 0.0255569
+-0.0772285 0.173502 -0.0405421
+0.0114915 0.130592 0.00962923
+-0.0739058 0.125263 -0.00826143
+-0.0709356 0.0780686 0.0386829
+-0.0450603 0.156487 0.00667449
+-0.00258285 0.0361873 -0.0247048
+-0.00135222 0.101336 0.0444015
+-0.0894746 0.139279 0.0281819
+-0.00967152 0.0968708 -0.0306358
+-0.0704928 0.117562 0.0527864
+-0.0678494 0.155094 0.00351036
+-0.0752747 0.175704 -0.0425921
+-0.032145 0.0863362 -0.0265533
+-0.0345086 0.0775176 0.0416541
+0.0409071 0.0711839 0.0309718
+0.0182107 0.084868 -0.0280483
+0.037986 0.0861315 0.0356473
+-0.0158582 0.107196 -0.0215252
+-0.0536497 0.0382495 -0.0113033
+0.0400088 0.107038 0.00721094
+-0.0111671 0.0867859 -0.0382994
+-0.0758579 0.0963896 -0.0129621
+0.00275941 0.0343655 0.0174794
+-0.0528912 0.109829 -0.018387
+0.0352142 0.037348 0.0177424
+-0.0770086 0.090082 0.0382275
+-0.0537852 0.0344427 0.037794
+-0.0317722 0.0335835 -0.0256749
+-0.0533077 0.12062 -0.0114531
+-0.0670377 0.155239 -0.0519345
+0.0248201 0.0343822 0.00913252
+-0.077345 0.0838842 -0.0115833
+0.0143045 0.0638067 -0.0299257
+-0.00129201 0.123843 -0.0093277
+0.0380905 0.0941294 0.0341306
+-0.0932985 0.125478 0.0122618
+-0.034118 0.163722 -0.0147399
+0.0298704 0.114081 0.0310466
+0.0255132 0.110081 0.0370706
+-0.0476672 0.0405803 -0.0117113
+-0.0472716 0.130968 0.0245047
+-0.0619845 0.128209 -0.0080954
+-0.0644855 0.0917771 0.0443552
+0.00846054 0.0341727 0.000449307
+0.000942621 0.0347668 0.0167534
+-0.0160225 0.0958165 -0.0315688
+-0.0534556 0.0353304 0.0456783
+0.0142349 0.129723 0.0106274
+-0.0726014 0.0365856 0.00586956
+0.033081 0.038417 0.0236373
+-0.0678588 0.128454 0.0493479
+0.0276968 0.0797349 -0.0226793
+0.0317217 0.0639399 -0.0186866
+-0.00482566 0.0896201 -0.0359284
+-0.0704978 0.124601 0.053003
+-0.00149487 0.115594 0.0408235
+-0.0360812 0.0358497 0.0136623
+-0.00514848 0.0385788 0.00662082
+-0.0791696 0.110508 0.0441428
+-0.0215028 0.0448835 0.0530162
+0.0173223 0.0699836 0.0514025
+0.0379734 0.0672941 0.0355158
+-0.0858805 0.0926571 0.00145452
+0.00396412 0.0977772 0.0510597
+-0.0656399 0.11715 0.0490043
+-0.0771179 0.165222 -0.035974
+-0.0198829 0.0383003 0.00206982
+-0.0187849 0.159551 -0.0109781
+-0.0655235 0.0347285 0.0315692
+0.0298088 0.0848631 0.0431899
+-0.0202144 0.186446 -0.0187314
+-0.0737921 0.165213 -0.0399888
+-0.0287531 0.0767493 -0.0350292
+-0.0108764 0.178532 -0.0297831
+0.00248459 0.114158 0.0410016
+0.0523216 0.0588453 -0.00357691
+-0.0424144 0.147803 0.00244515
+-0.0387777 0.0827042 -0.0213153
+-0.0338762 0.105703 -0.0205658
+-0.087924 0.1365 0.0420055
+-0.0747046 0.0837005 -0.0145969
+-0.0657521 0.033742 -0.00672308
+-0.045381 0.0381676 -0.0212668
+-0.0868004 0.0846768 0.00848321
+0.0294149 0.118962 0.0248216
+-0.034174 0.107559 -0.0198979
+0.0280502 0.0740858 0.0440821
+-0.0776167 0.0914005 0.037394
+0.0235133 0.0407023 0.0389233
+-0.0568656 0.102623 -0.018982
+-0.0678684 0.063022 0.000880975
+0.0360361 0.100737 0.0329764
+-0.0922724 0.125575 0.0332589
+-0.0929242 0.120168 0.0332909
+-0.018498 0.108568 0.0416031
+0.0174435 0.128281 0.0160914
+-0.0242219 0.178615 -0.0196227
+-0.0704096 0.163806 -0.0479588
+-0.0810819 0.0814326 -0.00557353
+-0.0595808 0.0380953 -0.00917151
+-0.00023307 0.0988811 0.0510016
+0.00703854 0.0344034 -0.0150394
+-0.092972 0.125468 0.0112596
+-0.00348845 0.115565 0.0406522
+-0.000499736 0.11143 0.0424297
+-0.00349598 0.0562185 0.05401
+0.0274875 0.0380349 0.0264602
+-0.0191507 0.168261 -0.0198644
+-0.0708777 0.131245 0.0502751
+-0.0591241 0.1154 0.0371963
+0.015252 0.122005 -0.00948865
+-0.0238533 0.0958019 -0.0255967
+-0.0225065 0.111294 0.03935
+0.0394335 0.0834241 0.0342316
+-0.0599597 0.121237 0.0413621
+-0.0151227 0.160977 -0.0122661
+-0.0856126 0.0792275 0.0145081
+-0.0304111 0.0336116 -0.02356
+-0.0300276 0.0875944 -0.030572
+-0.0387164 0.0695709 -0.0161311
+-0.0658849 0.153363 -0.0443952
+-0.0108819 0.168382 -0.0176467
+0.0450682 0.090383 0.0171641
+-0.0624967 0.149081 -0.013576
+-0.0222042 0.178612 -0.0212581
+0.0294982 0.120461 0.0105965
+-0.0414977 0.115265 0.0337662
+-0.0499421 0.135837 0.0234945
+-0.0843142 0.152356 0.00793113
+-0.0410616 0.156231 -0.0095971
+-0.0238697 0.104438 -0.0232028
+-0.0067213 0.065597 -0.0353344
+-0.0108037 0.0827117 -0.0384206
+0.0138699 0.049008 0.0461763
+0.016266 0.0750624 -0.0291952
+-0.0813824 0.099165 -0.00657823
+-0.0355882 0.126454 -0.000576513
+-0.0627783 0.0343233 0.0272634
+-0.0864194 0.133874 0.0462429
+-0.0424946 0.0972875 0.0422451
+-0.00875136 0.116762 -0.015718
+-0.00610573 0.035829 0.0485597
+-0.0634859 0.146784 0.0381458
+0.00949393 0.109876 0.0399119
+-0.0286135 0.0817842 -0.0355888
+-0.0785092 0.126003 0.0529555
+-0.0564526 0.0602802 -0.00348733
+-0.0632263 0.153648 -0.0346156
+-0.0212315 0.0839098 0.0563274
+-0.0185478 0.0382321 0.00966598
+-0.0629734 0.126755 -0.00855487
+-0.0607657 0.139716 -0.00595313
+-0.0192289 0.178619 -0.0235673
+-0.0154933 0.0730227 0.0553537
+0.0208153 0.0564412 0.0475406
+-0.0390833 0.0486663 -0.0122287
+-0.065493 0.153273 0.0335324
+0.0608914 0.0637395 0.0141606
+-0.0153829 0.18014 -0.0206255
+-0.0822314 0.0842513 -0.00555381
+-0.0678037 0.0880304 -0.0174902
+0.0361089 0.0577094 0.0344737
+-0.0464121 0.035458 -0.0187253
+-0.0666201 0.0338653 0.00919115
+-0.0674808 0.0688292 0.0332504
+-0.0659293 0.156005 0.0129201
+-0.0294246 0.0861745 0.0444819
+-0.0581309 0.155502 0.017154
+-0.0726537 0.15621 0.0148854
+-0.0168438 0.180138 -0.0192059
+-0.0656741 0.0356447 0.0159226
+0.0163545 0.0507599 -0.025927
+-0.0293383 0.123554 -0.00265044
+0.00679991 0.131589 0.0107583
+-0.0398245 0.0942915 -0.0229995
+-0.0945717 0.122812 0.0182725
+0.00440363 0.0390362 -0.0241943
+-0.0798195 0.105901 -0.00558882
+-0.0117856 0.0813065 -0.0386038
+0.00749342 0.0372096 -0.0118978
+-0.0744971 0.176396 -0.0436946
+-0.00968478 0.0584187 -0.0340646
+0.0312312 0.117425 0.00123717
+0.0184875 0.0976002 0.0470854
+-0.0716235 0.0693585 0.0301698
+0.039816 0.0393083 0.00327619
+-0.0835287 0.11032 0.027366
+-0.0245014 0.043543 0.0534366
+0.0370893 0.106835 -0.00283087
+-0.0567623 0.154944 0.0190948
+-0.0275761 0.125766 0.0126577
+-0.00827698 0.0408222 0.049207
+0.0553826 0.0699889 0.0228528
+0.012476 0.0976634 0.0485624
+0.0597169 0.0580863 0.0181825
+-0.0261346 0.168251 -0.00989215
+-0.0319337 0.0680008 -0.0224492
+-0.0367004 0.0680804 -0.0157124
+-0.0192371 0.0959207 0.0497533
+-0.0482812 0.115062 -0.0157267
+-0.0625405 0.132491 0.039434
+-0.0464975 0.163768 0.00545168
+-0.0809296 0.0885877 0.0337432
+-0.0341216 0.0395911 0.0493113
+0.0322123 0.0856789 -0.0192748
+-0.0822934 0.0775365 0.000511811
+0.00709964 0.0342068 0.00386204
+-0.086438 0.0832915 0.00949498
+-0.0244616 0.0474336 0.050725
+0.00565547 0.0365592 0.0251573
+-0.0274618 0.045988 0.0503593
+0.010522 0.119127 0.036469
+-0.0736141 0.151246 -0.0348888
+-0.024687 0.0892375 0.0511394
+0.00296667 0.0390863 0.0277676
+-0.0494919 0.154959 0.0103413
+-0.058864 0.139321 -0.00549203
+-0.0327877 0.082138 -0.0285334
+-0.0423065 0.150496 -0.00548521
+-0.0631749 0.149 -0.0205832
+-0.0218319 0.0363367 -0.0187811
+-0.0723757 0.0638786 0.0154336
+-0.0358563 0.126885 0.000788129
+0.0192111 0.080597 -0.0276192
+-0.0620809 0.0336347 -0.00771095
+-0.0313625 0.0510794 -0.0143586
+-0.063822 0.115596 0.0429106
+-0.0645614 0.138204 0.0400205
+-0.0824235 0.124446 0.0510342
+0.0555936 0.0567472 0.0257684
+-0.0293723 0.0422984 0.0515712
+0.0526995 0.0702438 0.0035897
+-0.0647148 0.06349 0.0261636
+0.00450679 0.0702611 0.0557926
+-0.0421206 0.171253 -0.0079388
+-0.00823225 0.127328 0.0283641
+0.0085198 0.0716538 0.0557746
+-0.0603515 0.116839 0.0389782
+-0.0758447 0.151365 -0.0158827
+-0.0913489 0.117296 0.00730629
+-0.0787438 0.101744 -0.00857364
+-0.0758718 0.109158 -0.00765228
+0.0141976 0.0850086 -0.0301852
+0.0110282 0.0968851 -0.0245853
+-0.0821235 0.0802564 0.0295192
+-0.0500787 0.154631 -0.00525635
+-0.0278864 0.105837 -0.0222471
+-0.0355149 0.0804148 0.0426568
+0.0156112 0.0519525 0.0469795
+-0.0758417 0.114903 -0.00554375
+-0.00130995 0.124776 -0.00834251
+-0.0285122 0.180211 -0.00692909
+0.0124807 0.0949598 0.0504131
+-0.0679136 0.113718 -0.0102762
+-0.0871543 0.105024 0.0183639
+0.0375648 0.0926236 -0.0120119
+-0.0297787 0.125132 0.0177406
+-0.0253546 0.121816 0.0267508
+0.0463872 0.0806547 0.00917972
+-0.0386145 0.0492284 -0.011639
+-0.0604969 0.0918487 0.0452694
+-0.0754744 0.151328 -0.022882
+0.0184783 0.101734 0.0458501
+-0.0250671 0.0385158 0.031526
+-0.0384759 0.091717 0.0434324
+-0.0394992 0.0916803 0.0429883
+-0.0668335 0.143964 0.0420823
+-0.0653424 0.0629827 0.0247148
+-0.0644392 0.112372 0.0382632
+0.0242087 0.039076 0.0343007
+-0.0535427 0.0402957 -0.0106063
+-0.082326 0.0748249 0.00451639
+-0.0544972 0.0959632 0.0436086
+-0.020823 0.0868434 -0.0377816
+-0.0636947 0.167813 -0.0415938
+-0.0448731 0.128505 0.000263047
+-0.0608825 0.0996865 -0.0185327
+0.0079329 0.0630739 0.055296
+0.00434495 0.0973121 -0.027058
+-0.091323 0.113292 0.0153266
+-0.0074977 0.0801462 0.0578122
+-0.0899881 0.118599 0.00429898
+-0.072593 0.155911 0.00171291
+0.00944326 0.128939 -0.000930002
+-0.0669203 0.110822 0.0381745
+-0.0378406 0.0957387 -0.0228102
+-0.00994641 0.0339021 -0.0251924
+-0.0261195 0.0706905 0.0432458
+0.0285346 0.121033 0.017364
+-0.0702811 0.17421 -0.0421289
+-0.00949024 0.104446 0.0436658
+-0.0877186 0.105023 0.0153645
+0.0487537 0.043125 0.0102298
+-0.0709615 0.148056 -0.0324394
+-0.0785455 0.146115 0.0422588
+-0.0777749 0.150053 -0.00387978
+-0.0747481 0.158885 -0.00783629
+0.022966 0.0347513 0.0194226
+-0.000497806 0.0842866 0.0575088
+0.0329127 0.116986 0.00902312
+0.0303386 0.119339 0.00661655
+0.0335365 0.0483507 0.0312493
+-0.0506321 0.0530807 0.0328365
+-0.0283907 0.123379 0.0211752
+0.043167 0.0831963 -0.0047762
+-0.00976599 0.121876 -0.011136
+-0.0836817 0.0786288 0.0214472
+-0.0584699 0.0344613 0.0385122
+-0.031399 0.116965 -0.0137545
+-0.0679334 0.145349 0.0422649
+0.0355447 0.11347 0.012835
+-0.0343438 0.0384811 -0.00836679
+-0.0303159 0.0678299 -0.0274662
+0.030827 0.0835413 0.0428747
+-0.0367713 0.0871639 -0.0235593
+-0.0249824 0.117062 -0.0139085
+-0.0633873 0.169402 -0.0465883
+-0.0567938 0.0498747 0.00808849
+-0.0719281 0.148635 -0.0350398
+-0.0764024 0.150045 -0.00692327
+-0.085242 0.115675 0.000251725
+0.0352163 0.0367258 0.0146563
+-0.0476332 0.0345872 0.0389835
+-0.0306482 0.0819602 -0.032565
+-0.0258283 0.172717 -0.011167
+-0.0745076 0.115686 0.0517763
+-0.0625234 0.0413191 -0.00677899
+-0.02745 0.110307 -0.0187882
+-0.0444951 0.104328 0.0415155
+-0.0774643 0.155549 -0.0139037
+0.0154943 0.105779 0.0433144
+-0.00688511 0.0982482 0.0516445
+-0.0476227 0.122378 -0.0113753
+-0.0830725 0.139367 0.045586
+-0.0431901 0.039319 -0.0232745
+0.00551778 0.0828244 0.0566316
+-0.0364708 0.152123 0.0014574
+-0.00749897 0.0815283 0.0577578
+-0.0165021 0.118207 0.0361456
+0.013481 0.0358562 0.0436245
+0.0102178 0.0836927 -0.0316174
+0.0514697 0.0462224 0.00523719
+0.0399822 0.0910991 -0.010396
+-0.0510223 0.0339346 0.00874224
+-0.0327803 0.0793117 -0.0285199
+0.0549936 0.0732019 0.0123756
+0.0461994 0.0750316 0.00518987
+0.0371924 0.0391306 0.0220088
+-0.0737191 0.152664 -0.0318934
+-0.0548531 0.149577 0.0276913
+-0.00305215 0.125834 0.0316944
+-0.021742 0.0389771 0.0371835
+0.0252695 0.0532659 -0.021679
+-0.0633235 0.0388939 0.025715
+-0.053898 0.105542 -0.0189379
+-0.0718855 0.122345 -0.00846405
+-0.0334848 0.0561021 0.0379001
+-0.0635384 0.061476 -0.00191873
+0.0137785 0.0346695 0.0230735
+0.0204936 0.1267 0.00866396
+-0.0258672 0.156547 -0.00846874
+-0.089402 0.0996815 0.0144017
+-0.010288 0.172711 -0.0218803
+0.00772266 0.115023 0.0394097
+-0.0363729 0.176071 -0.00683571
+-0.0525546 0.0444744 -0.00849373
+-0.0577063 0.155408 0.0158579
+-0.0512663 0.12652 -0.00563382
+-0.0277699 0.0661915 -0.0304661
+-0.0394907 0.0422995 0.0416287
+-0.0592646 0.0346371 0.0433189
+-0.0917594 0.117442 0.030311
+0.0188028 0.0349604 -0.00569856
+-0.0184644 0.0528818 0.0482087
+-0.0649365 0.1467 -0.0209465
+-0.0397769 0.152293 -0.00702124
+0.056742 0.0696177 0.0218717
+0.0435205 0.0637429 0.0281056
+0.0514429 0.0626408 -0.00275857
+-0.0668197 0.100942 -0.0159632
+-0.078886 0.0812827 -0.00855752
+0.0483563 0.0710513 0.00477309
+-0.0415729 0.151549 -0.00635576
+-0.0122139 0.169818 -0.0178463
+-0.0454996 0.163749 0.00555272
+-0.0779251 0.168693 -0.0322923
+-0.0455017 0.0973341 0.0429686
+-0.0932761 0.122751 0.0112823
+-0.00193792 0.0388572 0.00152241
+0.0379602 0.108292 0.00117706
+0.0447742 0.0777119 -0.00080388
+-0.0365645 0.0341557 0.0276322
+-0.077566 0.155252 0.0102497
+-0.00781043 0.0346187 0.0439246
+0.0218954 0.061892 0.0473866
+0.0229726 0.108506 -0.0149598
+0.0350891 0.111006 -0.00183676
+0.00866181 0.128565 0.0271896
+0.00435977 0.0481043 -0.0288152
+-0.00551112 0.0390255 -0.00865823
+-0.0205328 0.113457 -0.0181494
+-0.0851368 0.0832799 0.0224738
+0.00348766 0.115539 0.0402625
+-0.0174898 0.105786 0.0424611
+-0.087451 0.133828 0.0444349
+0.00492538 0.111581 -0.020193
+0.0318279 0.0713659 0.0407221
+-0.0121811 0.0984293 0.0498089
+-0.0747959 0.149331 0.0394056
+-0.0571923 0.0344404 0.0353306
+0.0154304 0.0417921 -0.0229429
+-0.0481114 0.159106 -0.00699154
+-0.0285 0.0960446 0.0448096
+0.0354946 0.0642547 -0.0137843
+-0.0204882 0.0388257 0.0339872
+0.0353716 0.0741014 0.0388421
+-0.0157653 0.161968 -0.0148041
+0.00551566 0.0799926 0.0558154
+0.0181043 0.128017 0.0106305
+-0.0644854 0.0986987 0.0423063
+-0.0415014 0.0492193 0.0396812
+-0.0900528 0.132428 0.0342227
+-0.0126494 0.0496668 -0.0310907
+-0.0321289 0.0337822 0.0109163
+-0.0625403 0.149101 -0.00657536
+-0.0124899 0.104431 0.0434394
+-0.0728072 0.15012 0.0385587
+-0.0275374 0.156717 -0.00957418
+-0.0627683 0.04307 0.0276693
+0.00651507 0.0344231 0.0163793
+-0.0631947 0.163133 -0.0265887
+-0.0264832 0.105687 0.0411729
+0.0072963 0.0341516 -0.018557
+-0.018657 0.109944 -0.0204332
+-0.0843505 0.0842533 0.0274024
+-0.0531944 0.139931 -0.000456373
+-0.0741436 0.100877 0.037779
+-0.0658548 0.0952898 -0.0176963
+-0.0504071 0.163936 0.00393123
+-0.00384396 0.0384339 0.019723
+-0.0889438 0.137894 0.0261932
+-0.017832 0.0346972 0.047013
+0.0156145 0.128768 0.00543431
+-0.0517309 0.0489114 0.0216412
+-0.0358204 0.046598 -0.0238768
+-0.059344 0.139552 0.0335155
+0.0510761 0.0567889 0.0297952
+-0.0787812 0.166656 -0.0319662
+0.030718 0.111397 0.0323042
+0.0535299 0.049514 0.0226619
+-0.0446433 0.0346533 0.0343218
+-0.0169852 0.186593 -0.0230311
+-0.0743965 0.149892 -0.0310959
+-0.0373231 0.0354917 0.0439186
+-0.000691629 0.100255 0.0478272
+-0.0818959 0.141783 0.000186922
+-0.0304023 0.0382885 -0.00186367
+-0.00349386 0.0925503 0.0560196
+-0.088924 0.151541 0.0211005
+-0.0824519 0.0856305 -0.00554258
+0.0469336 0.0511672 0.030779
+-0.0852791 0.132127 -0.000702015
+-0.0891862 0.112803 0.0347042
+0.0229651 0.0928857 0.047441
+-0.0442655 0.127665 -0.00291939
+-0.0917744 0.132406 0.0242297
+0.00738689 0.0359942 0.0260187
+0.0456627 0.0890114 0.0111648
+-0.0860966 0.11232 0.0268196
+-0.0556879 0.117086 -0.0137514
+0.0093902 0.0739182 0.0557875
+-0.0794167 0.137236 0.0495785
+-0.0893497 0.130881 0.0042394
+-0.0656682 0.0337431 0.00949839
+-0.0263524 0.059005 -0.029433
+0.0104643 0.0346107 -0.00703394
+-0.0631576 0.119928 0.0457283
+0.0423355 0.0972587 0.0241615
+0.0603447 0.0595379 0.00916361
+0.0495034 0.0488243 -0.00166079
+-0.0740753 0.155198 0.0041876
+-0.0656926 0.125639 0.0489587
+-0.00648958 0.0503786 0.0513549
+0.0381951 0.102007 0.0289909
+-0.0592102 0.0595951 0.00211544
+0.0285202 0.0622348 -0.0207982
+-0.0876555 0.144675 0.00917716
+0.0519851 0.0567984 0.0293579
+-0.0300707 0.124739 0.00148409
+-0.0725865 0.0874189 0.0409577
+-0.00281209 0.0882041 -0.0358187
+-0.0637344 0.0736795 -0.0161836
+0.0142616 0.0794232 0.0540604
+0.0458875 0.0787805 0.0205292
+0.0245051 0.0849065 0.0478503
+-0.0617895 0.083881 -0.0194032
+0.0333636 0.0364347 0.0163708
+0.0165102 0.111269 0.0389693
+0.033894 0.111352 0.0280456
+-0.00616098 0.0344967 -0.0177303
+-0.0662325 0.14347 -0.0127636
+-0.0199914 0.0962147 -0.0280142
+-0.0259005 0.126064 0.0117956
+-0.0929641 0.121523 0.0342815
+0.00656148 0.101677 0.0461619
+-0.0600389 0.0627348 0.027804
+0.0335486 0.0889696 0.0416029
+-0.0688127 0.0908552 -0.0166124
+-0.0856608 0.0854539 0.0244177
+-0.0759458 0.0974591 -0.0125133
+-0.0667171 0.171901 -0.0422833
+-0.0191016 0.0431933 0.0528315
+-0.0589426 0.0357407 0.0458703
+0.013481 0.127543 -0.00145794
+-0.0239185 0.0383353 -0.00428996
+-0.0627701 0.0824471 -0.0192325
+-0.0614696 0.136692 0.0357094
+-0.0810116 0.0734375 0.0175497
+-0.0759173 0.12523 -0.00781198
+-0.00824401 0.0384507 0.0170014
+-0.0641628 0.157463 -0.0125984
+-0.0178575 0.122517 -0.00769635
+-0.0596856 0.0659756 -0.00895149
+-0.0807952 0.106052 0.0302403
+0.0156574 0.0925729 -0.0260099
+-0.081817 0.0734713 0.00853447
+-0.052947 0.1293 -0.00466978
+0.0313864 0.0929268 0.0420114
+-0.0242749 0.174204 -0.0124276
+-0.0678958 0.0610238 0.00808464
+-0.0477867 0.135371 0.0169352
+-0.0514248 0.0500855 0.0140283
+0.0463863 0.075041 0.00619921
+-0.0120829 0.121468 -0.0106691
+0.0474936 0.0651497 0.0284001
+-0.0370341 0.127886 0.0121304
+-0.0240288 0.0385625 0.0316972
+0.0484803 0.0651161 -0.0012457
+-0.0516556 0.0569841 0.0295138
+-0.0639861 0.131146 -0.00837414
+-0.0504965 0.087636 0.0455301
+0.03603 0.0808066 0.0380541
+-0.0869174 0.117103 0.00125292
+-0.0617229 0.155313 -0.01958
+-0.0631289 0.15403 -0.0107687
+0.00528045 0.114267 -0.0191116
+-0.0639453 0.167747 -0.0398404
+0.0288613 0.0520696 0.0379853
+-0.0623548 0.166257 -0.0465894
+0.000543528 0.123331 0.0344653
+0.0375704 0.0618629 0.0348997
+-0.0391935 0.128299 0.00543562
+-0.0593991 0.0472653 0.0079341
+-0.0244003 0.0390404 0.0383653
+-0.0676508 0.0338326 0.0090061
+-0.0292136 0.07193 -0.032514
+-0.0374976 0.0861098 0.0439188
+0.0247244 0.0549721 0.0426251
+-0.0892169 0.151457 0.0141575
+-0.02429 0.121354 -0.00839434
+-0.0618416 0.098205 -0.0180486
+-0.0320742 0.0383234 -0.000421092
+-0.0488761 0.107007 -0.0192731
+-0.0476462 0.123357 -0.010393
+0.0220922 0.12286 0.0278182
+-0.00150357 0.0647954 0.0567431
+0.000502823 0.0870298 0.0569751
+-0.0581295 0.0643065 0.0321224
+-0.0188005 0.0568615 0.0490899
+-0.0794271 0.0732336 0.00151817
+0.019219 0.0848258 -0.027423
+-0.0344972 0.116614 0.0320154
+0.000192029 0.0811649 -0.0359709
+-0.0741702 0.0968478 0.0394202
+0.00621596 0.083814 -0.033411
+-0.0671177 0.159814 -0.0107973
+-0.0187526 0.0641914 -0.0363857
+0.0556876 0.0493473 0.0181935
+-0.0364983 0.059104 0.0398977
+-0.071802 0.181053 -0.0556554
+-0.0116602 0.168404 -0.0170453
+-0.0478952 0.0713156 0.0406183
+0.0354015 0.0476244 -0.00628637
+-0.0262003 0.0750789 0.0460261
+-0.0550327 0.0674609 0.0370807
+-0.0565425 0.0415574 -0.00871771
+-0.0546448 0.115434 0.0349037
+-0.0682182 0.15577 -0.00101225
+-0.066899 0.132617 0.0454244
+-0.0743656 0.172848 -0.0365047
+-0.0734703 0.155395 0.00293075
+-0.0125152 0.0589286 0.0534547
+0.00233104 0.0554199 -0.0313859
+-0.0805618 0.101855 -0.00659893
+-0.0537592 0.0797599 -0.020636
+-0.0237797 0.125538 0.0184413
+-0.0508814 0.161419 0.0066624
+-0.0742588 0.0655235 0.0100016
+0.0457502 0.0805926 0.00319942
+-0.0764848 0.142819 0.0460732
+-0.0442438 0.113637 -0.0162318
+-0.00550074 0.0870334 0.0571343
+-0.059876 0.0997119 -0.0187764
+-0.069062 0.149033 -0.0371338
+-0.0598711 0.154188 0.0296083
+-0.044481 0.0973337 0.0428134
+0.0255359 0.118038 0.0305151
+-0.000498881 0.112805 0.0421187
+-0.073083 0.0981963 0.0397086
+-0.0766217 0.068534 0.0175211
+-0.038773 0.11398 -0.0166127
+0.0194763 0.0837958 0.0507486
+-0.0809353 0.145916 -0.000819165
+0.0301953 0.0476864 0.0346108
+-0.0284906 0.0932063 0.0444855
+-0.071967 0.162417 -0.0419522
+-0.0647895 0.0838376 -0.0190209
+-0.00994817 0.0389455 -0.0113423
+0.00268547 0.035256 0.0455248
+-0.0587181 0.0481161 0.00163754
+-0.0537032 0.140954 0.0276054
+-0.0166811 0.0377146 -0.0171581
+-0.0896263 0.0969991 0.0154111
+-0.0475653 0.166962 -0.00492463
+-0.0684985 0.0986495 0.0414678
+0.0399619 0.0730961 -0.00981181
+-0.0433911 0.121364 -0.0123522
+-0.0619851 0.167813 -0.0525933
+-0.0768904 0.0733563 0.0291265
+-0.058879 0.104045 -0.0185386
+-0.0154965 0.0573571 0.0513792
+-0.0115598 0.09531 -0.0330219
+-0.0335104 0.125389 -0.00127044
+0.0292004 0.119729 0.0233163
+-0.0141909 0.171251 -0.024451
+0.00225805 0.0711729 -0.0343766
+0.000838494 0.130009 0.0243594
+-0.0186635 0.0360947 0.0525267
+0.0441946 0.0874765 -0.00278813
+-0.0347028 0.122731 -0.00776716
+-0.0478246 0.129609 0.027299
+-0.0784918 0.144814 0.0436628
+0.020477 0.0989516 0.0463466
+-0.0870404 0.113136 0.0295379
+0.012093 0.120504 0.0352323
+0.00825492 0.0739666 -0.0336091
+0.00112807 0.104475 -0.0219821
+-0.0142621 0.120334 -0.0114431
+-0.0507965 0.0345143 0.033135
+0.0311896 0.0857114 -0.0197343
+-0.0894234 0.0956355 0.01542
+-0.0775093 0.0961888 -0.0115304
+-0.0358262 0.0929298 -0.0238031
+-0.0774962 0.131676 0.0527303
+-0.0421326 0.160667 -0.0107094
+-0.0276983 0.125752 0.00966815
+-0.045336 0.129618 0.020889
+-0.00368188 0.0613041 -0.0346439
+-0.0748644 0.171601 -0.033829
+-0.0207882 0.0770942 -0.0390427
+-0.044533 0.160785 0.0064482
+-0.0789135 0.0799145 -0.00757704
+-0.0700794 0.154941 0.0289273
+-0.0313268 0.0609036 -0.0184352
+-0.0853384 0.107683 0.0213404
+-0.0624789 0.152144 -0.0275875
+-0.0427656 0.0797392 -0.0197597
+0.00722196 0.0865913 -0.0328221
+-0.0720619 0.109399 0.0395074
+-0.0911632 0.132299 0.00922827
+-0.00610552 0.129863 0.0232869
+0.02524 0.115374 0.03316
+0.00541955 0.0912903 -0.0327619
+0.00896308 0.0344141 -0.00340754
+-0.0356782 0.0636593 -0.0138055
+-0.0555057 0.153886 0.023914
+0.0207355 0.0349558 0.0059225
+0.0360179 0.0848402 0.038086
+-0.0488433 0.098515 -0.0220378
+-0.0633934 0.178218 -0.0607118
+-0.0846638 0.0778105 0.0155166
+0.0437393 0.0720229 -0.000789276
+-0.0288953 0.122588 -0.00566495
+-0.025973 0.0851197 0.051146
+-0.0782416 0.0913778 0.0366028
+-0.0494978 0.0960237 0.0444817
+-0.0785831 0.0731535 -0.00247436
+-0.0698391 0.165209 -0.0499791
+-0.0586839 0.0335669 0.00570948
+-0.0610591 0.155387 0.024814
+-0.0642828 0.163385 -0.0227384
+-0.0658667 0.0334936 -0.00108817
+0.037341 0.0888457 0.0365275
+0.02301 0.0347163 0.00286296
+-0.0590207 0.126708 -0.0075139
+0.0463679 0.0792556 0.0081871
+-0.00960203 0.0406207 -0.0262166
+-0.0771598 0.160359 -0.0157997
+-0.0425011 0.163766 0.00491011
+-0.00971544 0.177216 -0.0294611
+0.021747 0.102101 0.0439088
+-0.087802 0.139216 0.0403868
+-0.0694557 0.0421945 0.00370163
+0.0173244 0.0580274 -0.0281164
+-0.011686 0.178646 -0.0240587
+-0.0245154 0.158144 -0.00224812
+0.021637 0.0948486 -0.0224193
+0.00951901 0.0504027 0.0504431
+-0.0252093 0.112572 -0.0171753
+-0.0736758 0.108402 0.0380105
+-0.0551152 0.0341599 0.0272668
+-0.0462814 0.155049 0.00841735
+-0.0164865 0.0730277 0.0553332
+-0.0853981 0.109039 0.0213496
+-0.0817879 0.0734817 0.0075372
+-0.0543644 0.15733 0.00977334
+-0.0391365 0.0406682 0.0418102
+0.00445432 0.130749 0.00275136
+0.0247455 0.105845 -0.0161092
+-0.0554962 0.0904299 0.0451691
+-0.00849692 0.0731924 0.0575239
+-0.0665361 0.11864 0.0512424
+-0.0771905 0.152834 -0.00389169
+-0.0684956 0.0958684 0.0422138
+-0.086559 0.0806364 0.0135028
+-0.065258 0.156162 0.0146042
+-0.0134788 0.105828 0.0432751
+-0.00273284 0.0712345 -0.035418
+0.0276777 0.0972525 -0.0189451
+-0.0768441 0.113421 -0.00459179
+-0.0291819 0.174148 -0.0171874
+-0.0392913 0.0344977 0.0373408
+-0.00249868 0.0965524 0.0536599
+-0.026518 0.10985 0.0386071
+-0.0272212 0.114809 -0.0155223
+-0.0617195 0.0669875 0.0343055
+-0.0824261 0.101938 -0.00456304
+-0.0889571 0.0955775 0.00843273
+-0.0288529 0.100117 -0.0233232
+-0.0899265 0.130893 0.00523191
+-0.0346189 0.112824 -0.0174204
+-0.0154754 0.111334 0.0410203
+-0.053649 0.0335392 -0.00958395
+-0.000215874 0.126274 0.0312521
+0.00810763 0.0366956 0.0273459
+-0.0915032 0.133721 0.0182157
+0.0193574 0.0537071 -0.027254
+-0.0617049 0.070743 -0.0146345
+-0.0745149 0.121791 0.0533186
+-0.070524 0.0682803 0.0295828
+-0.0206697 0.0697068 0.051972
+-0.0918785 0.141976 0.0181723
+-0.0408421 0.0345979 0.00840679
+-0.0738542 0.15551 0.00718209
+0.0055205 0.0427186 0.0455303
+-0.065431 0.168513 -0.0346313
+0.0194077 0.0659 0.0490938
+-0.0485039 0.0876217 0.0453743
+-0.0622817 0.0458517 0.0346831
+0.0349983 0.0362655 0.0094693
+-0.0912374 0.140583 0.0161703
+-0.0884146 0.113764 0.0250911
+0.0142472 0.0860448 0.0523279
+-0.0131413 0.127389 -0.000900164
+0.0289187 0.0580129 -0.0187889
+0.00423189 0.0768627 -0.0347545
+0.0204663 0.0385832 -0.00969847
+-0.0217971 0.0348633 0.0460203
+-0.0864575 0.101794 0.0247295
+0.00132582 0.0568889 -0.0321653
+-0.0697484 0.0793376 -0.0160307
+-0.0845391 0.102087 -0.000621587
+-0.0733924 0.0656461 0.018954
+-0.0391909 0.0342717 0.0287528
+-0.065551 0.112475 0.040245
+-0.0628947 0.161497 -0.0505862
+-0.0455612 0.125305 -0.00846085
+0.0204165 0.110729 -0.0153427
+-0.0119941 0.16759 -0.0225943
+-0.0778434 0.153328 0.00140062
+-0.0743032 0.152688 -0.027892
+-0.0719627 0.134048 -0.00796724
+-0.0322554 0.0722092 -0.0264952
+-0.0689145 0.123836 -0.00886831
+-0.0292201 0.0564848 -0.022383
+-0.0336564 0.0343441 0.0369141
+0.0587559 0.0579922 0.0215357
+0.0331644 0.1138 0.0262385
+0.0155789 0.125536 -0.0032763
+-0.0511913 0.034459 0.0313456
+0.0336899 0.0357287 0.00969367
+0.0540437 0.0734433 0.0120297
+-0.0588961 0.106893 -0.0176578
+-0.0158316 0.18484 -0.0207268
+0.0120317 0.0342138 -0.0138856
+0.0335354 0.0380053 0.0222769
+-0.0118847 0.117889 -0.0148923
+0.00991822 0.0342953 -0.00310719
+0.00806259 0.0342288 -0.0204182
+-0.00962665 0.0384388 0.00947704
+-0.00349166 0.0534503 0.0541192
+0.0248931 0.108132 -0.0145556
+-0.0355172 0.106999 0.038376
+0.0298839 0.118971 0.0235707
+-0.0896201 0.0969823 0.0124196
+0.00795856 0.126912 0.0298215
+-0.0734288 0.149863 -0.0358672
+-0.0513643 0.132495 0.031006
+-0.056967 0.0535025 0.000612409
+-0.0226813 0.0349023 0.0509736
+0.0573538 0.0634191 0.00214341
+-0.0178849 0.0387376 -0.0108688
+-0.0690262 0.170476 -0.0316587
+-0.0162544 0.183109 -0.0200888
+-0.0569078 0.052097 -0.000371255
+-0.0845703 0.11062 0.0357089
+0.035496 0.0454077 0.0303438
+-0.00267498 0.100539 0.0471075
+-0.080721 0.0845507 0.0336553
+-0.0900133 0.150126 0.0131697
+-0.0628916 0.0631016 0.0268901
+-0.0739067 0.163816 -0.0379732
+-0.0313311 0.0487062 0.0434625
+-0.036476 0.0533606 0.0387027
+-0.0636484 0.15559 0.00937973
+0.0135801 0.0874029 0.0531363
+-0.0259964 0.0967524 -0.0245741
+-0.0665286 0.168031 -0.0580342
+-0.0794099 0.141428 0.0463829
+-0.0496093 0.0334738 -0.00871292
+0.0373859 0.082128 0.0365587
+-0.00650329 0.0547609 0.0534371
+0.0253836 0.0503366 -0.0210264
+-0.00332845 0.128773 0.0271941
+0.0363318 0.0601344 -0.0117401
+-0.0258635 0.103016 -0.0235702
+-0.0251408 0.168241 -0.0184358
+0.018845 0.0956057 -0.0232473
+-0.0712372 0.167165 -0.0209901
+-0.0759412 0.151358 -0.0178788
+-0.0784019 0.152013 0.0336008
+0.000968412 0.0391138 -0.00557511
+-0.0865136 0.106289 0.0083757
+-0.0623969 0.0335761 0.00673913
+-0.0769787 0.135423 -0.00568624
+0.021851 0.0591836 0.0473037
+-0.0524335 0.115217 0.0341034
+-0.0884925 0.144689 0.01017
+-0.0774954 0.147028 0.0416906
+0.00429953 0.0340852 0.0162355
+-0.0489061 0.0346101 0.0421693
+-0.0377668 0.0812615 -0.0209367
+-0.0321125 0.0496937 -0.0183514
+-0.00333701 0.121977 -0.0113118
+-0.063853 0.129717 0.0428324
+0.0122687 0.0724051 -0.0314733
+-0.0295052 0.113904 0.0347936
+0.0428284 0.0676747 -0.00179274
+-0.0665096 0.0944832 0.0425185
+-0.0324964 0.117987 0.0309791
+-0.0240568 0.0972281 0.0446316
+-0.0729302 0.128204 -0.00868672
+-0.0930613 0.118852 0.0392987
+-0.0179932 0.0940702 -0.0337993
+-0.0276364 0.0917699 -0.0296042
+0.0270825 0.114018 -0.00875387
+-0.0701334 0.160982 -0.047936
+0.0160414 0.0343167 -0.00190332
+-0.0407181 0.0336157 0.00208844
+0.0537368 0.0581963 0.0283843
+0.0459393 0.0792136 0.00418579
+0.00219887 0.0866713 -0.0341557
+-0.0874475 0.125307 -0.000719081
+0.0171658 0.0974165 -0.0229214
+-0.0555243 0.0344634 0.0339194
+0.00337546 0.131746 0.0137901
+-0.037361 0.155079 0.00374727
+-0.00966712 0.0394179 0.0374824
+0.0401633 0.102703 -0.00178896
+-0.0792807 0.167978 -0.037009
+0.0137845 0.0344 -0.00993851
+-0.0224906 0.034851 -0.0281799
+-0.0815485 0.124491 0.0516101
+0.0440694 0.0973609 0.0121636
+-0.0361101 0.0351289 -0.0167641
+-0.0672139 0.168667 -0.0295504
+0.00726635 0.0696573 -0.0326992
+-0.0474987 0.0987688 0.0431343
+-0.0879643 0.115809 0.00328051
+0.0212116 0.083355 -0.0266295
+-0.0413155 0.0345032 0.0369079
+-0.0830031 0.148729 0.00315098
+-0.0365029 0.0818729 0.0434567
+-0.0265303 0.0632322 0.0390504
+0.0560084 0.0549549 0.0021707
+-0.00162661 0.100486 0.0474782
+-0.00782745 0.0882395 -0.0367822
+-0.0874416 0.113109 0.00532366
+-0.0755108 0.126011 0.0529241
+0.0317406 0.107408 0.0337947
+-0.0280888 0.121741 0.0242898
+-0.0114519 0.126605 -0.00415103
+-0.00942316 0.129915 0.019193
+0.0305901 0.117314 -0.000462026
+-0.00449008 0.116939 0.0397737
+-0.0174829 0.0365879 0.0522725
+-0.0480399 0.136313 0.0145941
+0.0078895 0.0386539 0.0453509
+-0.059976 0.125502 0.0413668
+0.00922467 0.131237 0.0102208
+-0.0164537 0.0924837 0.0552632
+-0.0397063 0.0680709 -0.01554
+0.0144891 0.0990552 0.047648
+-0.0194892 0.0771957 0.0553527
+0.00314961 0.0344334 0.00286196
+0.0322227 0.0828447 -0.0192606
+-0.086166 0.115735 0.00128445
+-0.0628659 0.161473 -0.0525859
+-0.0897633 0.133813 0.0392039
+-0.0931113 0.126933 0.0272608
+0.0442448 0.0902943 -0.00180307
+0.0383075 0.041189 0.0258499
+-0.038679 0.0636652 -0.0136088
+-0.0640888 0.165507 -0.029848
+0.00695321 0.13108 0.0193768
+-0.0281007 0.162292 -0.0150733
+0.0192374 0.0749637 -0.0278698
+0.0244608 0.0941673 -0.021671
+0.0131476 0.100265 -0.0227775
+-0.0301385 0.166718 -0.0165418
+-0.0651412 0.159482 -0.0565006
+0.0342867 0.0700233 0.0389954
+-0.0695171 0.141232 -0.00845814
+-0.0904292 0.148866 0.0241237
+-0.0253439 0.0693349 0.0439513
+-0.0623474 0.166249 -0.0485903
+-0.0193027 0.0445534 0.0525624
+-0.0258791 0.105846 -0.022482
+-0.0331634 0.0381954 -0.000525199
+-0.0640739 0.0617863 -0.0011495
+0.0413993 0.0942972 -0.00577735
+-0.030183 0.155051 -0.00785968
+-0.0209835 0.159643 -0.00415092
+0.0227131 0.118044 0.0330191
+-0.0268485 0.124528 0.000469072
+-0.0241773 0.17417 -0.0202285
+-0.012912 0.0339283 -0.0204101
+0.0235417 0.109895 0.0378397
+-0.0800641 0.107437 0.0308747
+-0.0374695 0.0383458 -0.0088734
+0.0372523 0.0646113 0.0362056
+-0.0324907 0.0817336 0.0416408
+0.0138217 0.125251 -0.00497301
+-0.0427639 0.126553 -0.0057736
+-0.0467249 0.0753156 -0.0175399
+-0.0861037 0.109061 0.0193453
+0.0206619 0.0348672 0.0224824
+-0.0804996 0.127434 0.052885
+0.00919876 0.0964636 -0.0261302
+-0.0321423 0.0806683 -0.0305334
+0.0242996 0.120934 0.0286395
+-0.0429021 0.171269 -0.00696466
+0.0145253 0.126603 0.0278836
+-0.0657391 0.142564 -0.0101503
+-0.0125598 0.0943837 -0.0340846
+-0.0809608 0.0720856 0.0135459
+-0.0230054 0.0386784 -0.0118395
+-0.0234022 0.157317 -0.0083471
+-0.0700956 0.06197 0.00856658
+0.0361469 0.0875521 0.038321
+-0.00703497 0.101085 0.0445106
+-0.0217097 0.181473 -0.0209735
+-0.0310875 0.179405 -0.00921261
+0.00340822 0.117733 -0.0168392
+-0.0306641 0.062253 -0.0214244
+-0.00851812 0.0604987 0.0555487
+-0.0105044 0.0745085 0.0567054
+-0.00265316 0.0511482 -0.0311061
+-0.0764634 0.157616 -0.00941011
+-0.0224335 0.0371726 0.0541058
+-0.0432016 0.171084 -0.00202068
+-0.0523174 0.057382 0.0266177
+0.0595665 0.0566863 0.0161765
+0.00171621 0.126464 -0.00619605
+-0.0635036 0.095949 0.0432601
+-0.00748541 0.0856517 0.0572176
+-0.0142172 0.114376 -0.0171381
+-0.0106623 0.0511436 -0.032067
+-0.0292482 0.0345559 -0.0204636
+-0.0369573 0.0340894 0.0258321
+-0.0544756 0.0413314 0.0465715
+-0.0940023 0.125512 0.016258
+-0.0685195 0.0916417 0.0424016
+-0.076491 0.140037 0.0480957
+-0.021763 0.159801 -0.0034487
+0.0107652 0.110575 -0.0191667
+-0.0296434 0.0486725 0.0446006
+0.0205709 0.0463131 0.0417824
+0.0371829 0.0726727 0.036151
+0.00170794 0.1258 0.0319097
+0.00812607 0.108726 -0.0199063
+-0.088847 0.0874807 0.0104655
+-0.0614823 0.0761372 0.0417782
+-0.077632 0.077285 -0.00766199
+-0.0914347 0.132413 0.0262297
+-0.0380759 0.16073 -0.01276
+-0.0580841 0.132712 -0.00634758
+-0.00546375 0.117984 -0.0150376
+-0.0825526 0.110518 0.0415894
+-0.0567945 0.0589511 -0.00142935
+-0.00849356 0.0842936 0.0575382
+-0.0464941 0.0987388 0.0427545
+0.0199235 0.0365522 0.038924
+-0.0181358 0.159669 -0.00704365
+0.0214919 0.0906421 0.0482356
+-0.0308996 0.107699 -0.0200324
+0.0310327 0.118783 0.0168832
+-0.049761 0.069112 0.038562
+-0.0388211 0.091456 -0.0235256
+-0.0139638 0.180133 -0.0220777
+0.0153381 0.127037 -0.000904662
+-0.0219975 0.107603 -0.0219593
+-0.0448317 0.0927682 -0.0220335
+-0.0127292 0.0909963 -0.036642
+0.0174939 0.0350076 -0.00788091
+-0.016176 0.165587 -0.0188354
+0.0276821 0.0862408 0.0453967
+-0.00121407 0.102594 0.0440764
+-0.0167645 0.162218 -0.0151135
+-0.0446938 0.0665983 -0.0153032
+-0.0709583 0.135514 -0.00804855
+0.0152869 0.0794603 0.0538116
+-0.028039 0.0849631 0.0475609
+-0.0252122 0.108563 -0.020971
+-0.0501485 0.141642 0.00337658
+-0.0802229 0.143442 0.044034
+-0.0728736 0.0659781 0.0205309
+-0.083982 0.134868 -0.000717316
+-0.070349 0.172644 -0.037875
+-0.015485 0.0673895 0.0543529
+-0.0374989 0.108379 0.0375203
+0.0194281 0.0399108 -0.0177171
+-0.0508059 0.0898498 -0.0218327
+-0.0916067 0.130926 0.00923792
+-0.0657827 0.158229 -0.0103034
+0.00352818 0.0386899 -0.0121702
+-0.0147383 0.10835 -0.0207588
+-0.0496313 0.111407 -0.0178803
+-0.0413837 0.128875 0.00906534
+-0.0523163 0.134709 -0.00240246
+0.00961512 0.122501 0.0348066
+-0.0755017 0.140041 0.0481
+-0.0678883 0.145704 -0.022127
+-0.0230319 0.0374462 0.0541561
+-0.00425848 0.0961384 -0.0318255
+-0.0895594 0.135155 0.0312102
+-0.0623104 0.0594537 0.00702264
+0.00422975 0.0796448 -0.0342885
+-0.0618471 0.153751 -0.0215773
+-0.00905798 0.034739 0.0470958
+-0.0575286 0.126935 0.0396404
+-0.0298496 0.180049 -0.0116061
+-0.0317613 0.0567558 -0.0133876
+-0.0839019 0.105911 0.0262878
+-0.0715304 0.102729 0.03849
+0.0144241 0.127312 -0.00121761
+-0.0787914 0.14589 -0.00282549
+-0.00925999 0.0421824 0.0495336
+-0.0284001 0.0385729 0.034376
+-0.0690967 0.148938 0.0398784
+-0.0561651 0.153258 0.0280528
+0.0408211 0.10424 0.0171662
+0.0569661 0.0701435 0.00568959
+-0.0318479 0.09723 -0.023215
+0.00233723 0.0391647 0.0293747
+-0.0839319 0.117006 0.0485566
+-0.0310508 0.0693178 -0.0264576
+-0.0270974 0.0794315 0.0481933
+-0.00975454 0.0728065 -0.0376393
+-0.0907216 0.131054 0.0332303
+-0.00149823 0.0535022 0.0547476
+-0.0920442 0.126938 0.0322524
+-0.049095 0.140149 0.0113941
+-0.0605441 0.113772 -0.0142303
+-0.00976932 0.0756525 -0.0380331
+-0.0878532 0.127045 0.0464651
+-0.010533 0.178644 -0.025906
+0.0593699 0.0691831 0.0171767
+-0.024781 0.0769658 -0.0376048
+0.0423711 0.0575006 -0.00528711
+0.0460928 0.061454 -0.00359733
+-0.0408554 0.101386 -0.0212924
+-0.0446853 0.169846 -0.00596698
+-0.0499657 0.0572278 0.0334797
+-0.0145604 0.127706 0.0231688
+-0.0624931 0.153672 -0.0316068
+0.0559752 0.0635544 0.0263749
+-0.0741944 0.0678888 0.022137
+0.0128784 0.0534523 0.0500797
+-0.014497 0.082865 0.0570346
+0.0100519 0.0351376 0.0435561
+-0.0764979 0.135856 0.0507679
+-0.0505672 0.0545537 0.0173366
+-0.073291 0.0682485 0.025526
+0.0168973 0.0504721 0.0453108
+0.0597511 0.0567143 0.0111681
+0.00962081 0.119433 -0.0146957
+-0.0261763 0.0931476 0.0454624
+-0.0034975 0.0661744 0.0565538
+-0.0174573 0.0601724 0.0514531
+0.0587589 0.059387 0.00417226
+-0.0388249 0.122181 0.0278208
+-0.0685252 0.175096 -0.0570393
+-0.0628061 0.0896011 -0.0190246
+0.0306772 0.118704 0.0210209
+-0.0655003 0.083298 0.0438708
+0.0560223 0.0713695 0.00682475
+-0.0298518 0.100096 -0.0230635
+-0.0422245 0.148296 -0.00246029
+-0.00149333 0.112805 0.0421166
+-0.0829153 0.0925695 0.0313446
+-0.0394018 0.0468721 -0.0179145
+-0.0784825 0.135851 0.0506454
+-0.0734876 0.127439 0.0525898
+-0.0280931 0.033441 -0.0266965
+0.0607571 0.0609589 0.0141669
+-0.0692316 0.172989 -0.0403442
+-0.0397906 0.162354 0.00198884
+-0.0505067 0.0805184 0.044061
+-0.0716519 0.156794 -0.0409079
+0.0407885 0.10564 0.00816522
+-0.00717727 0.0999816 0.0485274
+-0.0646289 0.156694 -0.0465976
+-0.089623 0.0983355 0.0134109
+0.00279805 0.0339767 -0.0211497
+-0.0142152 0.17272 -0.0253585
+-0.0396036 0.174135 -0.00601981
+-0.0669938 0.0358141 0.0313063
+-0.0497731 0.0627792 0.0345527
+0.0229897 0.121378 0.0295865
+-0.0457551 0.0336493 -0.0154708
+-0.0539285 0.152376 0.0223916
+-0.0664975 0.108359 0.0380432
+0.0293811 0.04325 -0.00550019
+-0.0166832 0.0525719 -0.0322771
+0.0164877 0.105762 0.0431793
+-0.0171637 0.0956465 -0.0313986
+-0.0314959 0.111117 0.0366419
+-0.0788622 0.169438 -0.0409605
+-0.0673163 0.13687 0.0448543
+-0.00450662 0.0828853 0.0572758
+-0.086732 0.125284 -0.00171301
+-0.0339024 0.123839 0.0236394
+-0.0665906 0.0686018 0.0336345
+-0.0647932 0.143933 0.0397518
+0.0283692 0.0466516 -0.00870467
+0.0329293 0.104175 -0.0123189
+-0.0761401 0.0728821 0.0296904
+-0.0142042 0.169737 -0.0232161
+-0.068634 0.151185 -0.044245
+-0.0135754 0.0347863 -0.0255909
+0.019989 0.0436019 0.0426848
+-0.015693 0.057044 -0.0346551
+-0.00164401 0.0482043 -0.0300627
+-0.0311183 0.172722 -0.00474304
+-0.0250193 0.118984 -0.0119284
+-0.0325683 0.124672 -0.00180773
+-0.0781672 0.0694403 0.0164131
+0.0335232 0.0673414 0.0396281
+-0.0927165 0.117489 0.0383035
+0.0402856 0.10561 0.017163
+-0.0284035 0.166813 -0.0078902
+-0.00473635 0.13076 0.00793547
+-0.0216948 0.0386212 -0.00966204
+-0.0436382 0.11786 -0.014681
+0.0533192 0.0587911 -0.00291354
+-0.0153516 0.0970497 -0.0288687
+-0.0434963 0.0661943 0.0406667
+-0.0466152 0.145766 -0.000178732
+-0.0206008 0.0386838 -0.0150911
+-0.0509261 0.0335608 -0.00538789
+-0.0896998 0.137926 0.0341919
+-0.0278811 0.0378156 0.0189805
+0.0364086 0.0854455 -0.0167057
+0.0349072 0.0875927 0.04003
+-0.0243811 0.0738035 0.0484997
+-0.0470246 0.133586 0.0187098
+0.00950521 0.0772084 0.0556135
+-0.0192998 0.0985099 -0.0244
+0.0447739 0.0438422 0.0248039
+-0.0504965 0.0819144 0.0441383
+-0.0346492 0.0577427 -0.0111408
+-0.048101 0.135891 0.0168055
+0.00147386 0.103921 -0.02207
+0.0494979 0.0678406 0.0265165
+0.00621357 0.0880484 -0.0332214
+-0.0763594 0.158279 -0.023921
+0.0359549 0.0646627 0.0378653
+-0.0462327 0.128102 0.0242709
+-0.0570384 0.142741 -0.0023851
+-0.0156536 0.0496375 -0.0309655
+-0.0157015 0.164 -0.0105798
+0.0160661 0.0349193 -0.0155613
+-0.0555615 0.0615422 -0.00607893
+-0.0506452 0.142899 0.00154993
+0.0227041 0.124378 0.0023667
+-0.0690811 0.0343024 0.0100819
+0.0296092 0.114943 -0.00583865
+0.0252655 0.0864752 -0.0236184
+-0.0579352 0.153021 -0.000467328
+-0.0699851 0.168026 -0.0510102
+-0.0649515 0.126767 -0.00875296
+-0.0310902 0.124844 0.00108587
+-0.07951 0.149797 0.0367578
+-0.0514931 0.156432 0.0104716
+-0.0854224 0.0885478 -0.00153705
+-0.0622051 0.0333895 -0.00205752
+-0.00958914 0.0376967 -0.0257201
+0.0438525 0.0874765 0.0251696
+-0.00448652 0.114189 0.0411781
+-0.0741351 0.0860483 0.039718
+-0.0162681 0.118552 -0.0135478
+-0.00571384 0.0655793 -0.035147
+-0.051609 0.164108 -0.000948719
+-0.0346229 0.116833 -0.0136016
+0.0105065 0.107115 0.0414414
+-0.0484736 0.0917654 0.0440291
+9.10767e-05 0.108392 -0.0207972
+0.0522547 0.0611036 -0.00320855
+0.00856462 0.11946 -0.0147195
+0.0326237 0.0768475 0.0419257
+0.0282302 0.0872832 -0.0216049
+-0.0693757 0.155378 0.0277002
+-0.0182673 0.180142 -0.0177524
+-0.0285043 0.0545632 0.0363758
+-0.0218074 0.0756618 -0.0388536
+-0.0633749 0.1608 -0.057006
+-0.0892506 0.151522 0.0201032
+-0.0472272 0.0642822 0.0376403
+-0.0699509 0.134055 -0.00826728
+-0.0820286 0.074884 0.0125291
+-0.0576046 0.151067 0.0326375
+-0.0425494 0.0346163 0.040046
+-0.0619058 0.105434 -0.0174028
+-0.0753497 0.108878 0.0391875
+-0.0594974 0.0946317 0.0447571
+0.013384 0.078066 0.0545225
+-0.0431375 0.160652 -0.0100842
+-0.0258359 0.0945143 -0.0266147
+-0.0245117 0.0536384 0.0409132
+-0.0664072 0.169883 -0.0364165
+-0.0726615 0.0640995 0.00799778
+-0.0451579 0.0395668 -0.0202936
+-0.00773777 0.0727528 -0.0370634
+0.0135086 0.116829 0.0366875
+-0.0836964 0.106272 0.0263573
+-0.0303071 0.0339954 0.0147064
+-0.000759903 0.102685 -0.0227147
+0.0258263 0.0624492 -0.0231007
+-0.0674047 0.179923 -0.0541082
+-0.0857367 0.111526 0.0418488
+-0.0560454 0.148678 -0.00182226
+-0.0476918 0.0635243 -0.0129244
+-0.0642806 0.164881 -0.0270495
+-0.0574962 0.108397 0.0389105
+0.00241269 0.0347278 -0.0230504
+-0.00449379 0.0548276 0.0540049
+-0.0627171 0.147502 -0.0125815
+-0.0213288 0.0581411 0.0459349
+-0.0608837 0.0367165 0.0449842
+0.0211328 0.126504 0.0131782
+0.00740015 0.0418656 -0.0238182
+-0.0737971 0.148055 0.0412991
+-0.00374732 0.0726737 -0.0357771
+-0.0204954 0.103009 0.0433484
+-0.0210495 0.127369 0.0106273
+0.0306407 0.0431175 0.0298982
+0.0109957 0.0698921 0.0545336
+-0.0439898 0.0350927 -0.0256307
+-0.0670986 0.0347786 0.0136227
+0.0215717 0.0401714 -0.00970048
+0.0214864 0.0934187 0.0477129
+-0.0174765 0.0715932 0.0547125
+-0.0246025 0.0824997 0.0540808
+-0.0774249 0.155543 -0.015906
+-0.00557868 0.109705 -0.0221876
+-0.00234233 0.10113 0.044176
+0.0314145 0.0384146 -0.00113672
+-0.0708385 0.0965734 -0.0156262
+-0.0358426 0.0345846 0.0397566
+0.0166934 0.111749 -0.0164123
+-0.0461447 0.0396778 -0.0162811
+0.0460542 0.0820303 0.0141751
+0.024254 0.0776067 -0.0252579
+-0.0585858 0.14384 -0.00236725
+-0.0590542 0.155341 0.0226214
+-0.0425019 0.049221 0.0396798
+-0.0737231 0.156865 -0.0279142
+-0.0640946 0.155219 -0.00966954
+-0.0136075 0.0420889 -0.0267571
+-0.0149109 0.0391012 0.0366853
+-0.0768619 0.116386 -0.00596474
+0.0464851 0.0651547 0.0281822
+-0.0672589 0.077344 0.0400985
+-0.0768893 0.176966 -0.046083
+-0.0870251 0.136346 0.00321516
+-0.046566 0.128368 -0.00156221
+-0.0881324 0.103677 0.0173573
+-0.0358716 0.10426 -0.0206916
+-0.00158589 0.110252 -0.0207823
+-0.0645869 0.117148 0.0471018
+-0.0493593 0.121175 0.032055
+0.00351232 0.0575709 0.0538233
+-0.0114209 0.107659 -0.022044
+-0.0134464 0.0388153 -0.00818864
+-0.0485053 0.108444 0.0391022
+-0.0783276 0.0839475 -0.0105972
+-0.0422429 0.129048 0.0117038
+0.0230175 0.0903576 -0.0236845
+-0.0840147 0.0993167 -0.00358504
+-0.0538991 0.108397 -0.0185513
+-0.00168424 0.0583535 -0.0329231
+0.00135578 0.0347199 0.040341
+-0.0858041 0.131212 0.0485351
+0.0546169 0.0694261 0.0240301
+0.0349752 0.0684447 -0.0157877
+0.0095201 0.0716259 0.0554078
+-0.00749453 0.0952341 0.0547544
+-0.019553 0.163976 -0.00913576
+-0.0640343 0.0457636 0.00169557
+-0.017901 0.0381554 0.0134869
+0.0133255 0.0594987 -0.0290386
+0.00648582 0.047441 0.0497645
+-0.0239518 0.123773 0.0227902
+-0.0318252 0.0609455 -0.0174329
+-0.0928746 0.122834 0.0282828
+0.00226062 0.131309 0.0062251
+-0.0414935 0.112526 0.0356807
+0.0202561 0.0791555 -0.0271913
+-0.0331056 0.0338156 0.0161014
+0.0297787 0.0446629 0.032196
+-0.0792621 0.084024 -0.00957002
+-0.0697175 0.155623 0.0028257
+-0.0391149 0.0337868 -0.0291782
+-0.0893977 0.135151 0.0292068
+0.04371 0.0987542 0.0111628
+-0.0281559 0.0380199 0.00608926
+0.0552084 0.0493743 0.00621284
+-0.0861539 0.149931 0.0300167
+0.042296 0.0775058 -0.00576261
+0.0415736 0.0765545 0.0302447
+-0.0532046 0.133931 0.0318349
+-0.0939252 0.118758 0.016301
+-0.027019 0.123094 -0.00421217
+-0.0471842 0.0355635 -0.0162689
+0.0137449 0.12859 0.0232984
+-0.0388402 0.0957243 -0.0226737
+0.0393482 0.0966985 0.0306886
+0.0405486 0.0596459 0.0301455
+-0.083332 0.0992842 -0.00460735
+0.0403123 0.0491555 -0.00629774
+-0.0135559 0.0378433 -0.0166597
+-0.0655014 0.0958911 0.0424957
+-0.00976126 0.0358952 0.049479
+-0.0624412 0.150596 -0.00171821
+-0.064981 0.131148 -0.00860586
+-0.0763864 0.109432 0.0420745
+-0.00149437 0.0801423 0.0576885
+-0.0163316 0.166866 -0.0132843
+-0.0862104 0.140486 0.00518463
+-0.0484837 0.159357 0.00832828
+-0.063685 0.169395 -0.0455915
+-0.0676574 0.0344024 0.0120657
+-0.0324957 0.0889348 0.0439847
+-0.0285919 0.0494861 -0.0235098
+-0.0925344 0.124191 0.0302708
+-0.0898664 0.135182 0.0372006
+-0.0675175 0.146991 0.0409028
+-0.0643109 0.0721294 0.0381075
+0.0336777 0.107392 0.0312726
+0.0416487 0.0806113 0.0304012
+0.0108925 0.130607 0.00797847
+0.00350574 0.071674 0.0559901
+-0.0687556 0.0680025 -0.00564855
+-0.0668955 0.116554 -0.00922261
+-0.0147132 0.0599449 -0.0358879
+-0.023059 0.0825255 0.0553698
+-0.0305016 0.108423 0.0388291
+-0.0575086 0.0507939 0.00466306
+-0.0811465 0.155009 0.0163089
+-0.0281138 0.125637 0.0139342
+0.00450187 0.0575756 0.0536585
+-0.0124992 0.0745024 0.0565746
+0.030795 0.119096 0.00823469
+0.0112449 0.0943173 -0.0278535
+-0.00350029 0.0856691 0.0572933
+-0.0135749 0.18083 -0.0284353
+-0.0387321 0.0724952 -0.0174162
+-0.0366243 0.151025 -0.00298791
+0.0282135 0.0579727 -0.0197309
+-0.0828916 0.0775885 0.00151125
+-0.00164877 0.0496874 -0.0307148
+0.0386307 0.106935 0.00116239
+-0.0871923 0.0861012 0.021463
+-0.0760841 0.104861 0.0354581
+-0.0244788 0.0486839 0.0492934
+-0.0883766 0.141855 0.0366703
+-0.0509887 0.143164 0.0163768
+-0.0496168 0.0561697 -0.00993077
+-0.00378208 0.0390472 -0.0102032
+-0.0843646 0.087116 -0.00354087
+0.00990951 0.0819581 0.0548044
+-0.0425006 0.0888114 0.0424593
+-0.0728637 0.099356 -0.013752
+-0.0206243 0.0436469 -0.0283402
+-0.0828496 0.117685 -0.00271563
+-0.0715585 0.181081 -0.0541999
+-0.0338561 0.0475081 -0.0226504
+0.00224005 0.0768974 -0.0352993
+-0.0935755 0.117419 0.0183042
+-0.0754318 0.155396 0.00808247
+-0.0674328 0.172594 -0.0425404
+0.027377 0.122298 0.0126488
+0.0174898 0.0874014 0.0499964
+0.0109848 0.123169 0.033628
+-0.0367194 0.0710436 -0.0172369
+-0.0285781 0.0423048 0.0521933
+0.033068 0.0984004 -0.0141329
+-0.0475947 0.0601221 0.0367025
+-0.0635768 0.155628 0.0253794
+0.0262764 0.100811 0.0416679
+0.0147323 0.129513 0.0122405
+0.0321413 0.0366814 0.019545
+-0.00794631 0.127212 -0.00487976
+0.0374618 0.0376657 0.00680115
+-0.0450017 0.0355455 0.0439167
+-0.0613089 0.0634913 0.028639
+-0.0275028 0.0988006 0.0435593
+0.051337 0.0560222 -0.00385605
+-0.0701879 0.175082 -0.0550269
+-0.0424973 0.155091 0.0068798
+-0.0156018 0.0435495 -0.027203
+-0.0387577 0.0797624 -0.0199123
+0.036687 0.0909845 -0.0142871
+-0.0621605 0.170953 -0.0526019
+-0.0503178 0.0515583 0.0186309
+0.0183954 0.0645286 0.0493775
+-0.0816036 0.0774754 -0.00149976
+-0.0167638 0.0728801 -0.0389011
+-0.0612458 0.141043 0.0360828
+-0.0650382 0.153613 0.000196596
+-0.0506214 0.0416531 0.0455899
+-0.0218256 0.086832 -0.0376579
+-0.0368977 0.110447 -0.0189068
+-0.0390704 0.124042 0.0247581
+-0.0145052 0.0544906 0.0506759
+0.0346875 0.0955379 0.0380285
+-0.0427281 0.0478381 -0.0112773
+-0.0589463 0.0436711 -0.00636451
+0.044641 0.0945606 0.00417916
+0.0417801 0.041383 0.0227466
+-0.066757 0.170863 -0.0580345
+-0.0104152 0.0998773 0.0473736
+-0.0467325 0.133652 0.0114554
+-0.0376877 0.163829 -0.000238726
+-0.0725153 0.142823 0.0458217
+0.0207674 0.103342 -0.0194283
+-0.00540678 0.121074 -0.0123374
+-0.0424989 0.102887 0.0413486
+-0.0462349 0.0354247 -0.01929
+0.0180016 0.125305 0.0262968
+-0.0162469 0.184587 -0.0200786
+-0.079084 0.0994215 0.0343706
+-0.0557053 0.132552 0.0352577
+-0.0512629 0.0388692 0.0464256
+-0.0515065 0.160835 0.00704803
+-0.0826893 0.152358 0.0291683
+-0.0584964 0.0932599 0.0452695
+0.024564 0.103479 -0.0175815
+-0.0846694 0.0831371 0.000497005
+-0.0865668 0.118992 0.0483015
+-0.0192412 0.184576 -0.0155995
+-0.00659114 0.03769 -0.0254352
+-0.0245806 0.124862 0.0196194
+-0.0368731 0.105664 -0.0202847
+-0.0621883 0.177235 -0.0596222
+-0.0672213 0.1608 -0.0122924
+-0.0303274 0.0375897 0.0276802
+-0.0234293 0.0522884 0.0423691
+0.0538492 0.0711959 0.0223128
+0.00550075 0.0772523 0.0562045
+0.0438483 0.076237 -0.00278527
+0.00633738 0.0581963 -0.0307089
+-0.0646256 0.0674757 -0.0084666
+-0.0310521 0.0450006 0.0489427
+0.0109104 0.126748 -0.00460652
+-0.0409513 0.128783 0.00774742
+-0.000502218 0.0938722 0.0552243
+-0.0166066 0.035315 -0.0186674
+-0.02118 0.169768 -0.013264
+-0.048723 0.166988 -0.000980568
+0.0301667 0.116977 -0.00204442
+-0.0129037 0.181603 -0.0240442
+-0.0461681 0.033576 -0.00628041
+0.0377831 0.0813859 -0.0147095
+-0.050774 0.143198 0.0153986
+-0.0591392 0.118534 -0.0111826
+0.0601642 0.0622865 0.0071402
+0.0055201 0.0674746 0.0556049
+0.0539548 0.0603844 -0.00239402
+0.0345037 0.0468848 0.0307194
+-0.0226112 0.04084 -0.0289768
+-0.088041 0.0995721 0.00642464
+0.0313753 0.111403 0.0314731
+-0.0818093 0.0776109 0.0245029
+0.0196586 0.112307 -0.0150514
+-0.0547371 0.114833 -0.0154193
+-0.00335753 0.11894 -0.0140663
+-0.0675878 0.0614559 0.0185068
+-0.0374891 0.0973119 0.0427062
+-0.0618754 0.0967815 -0.0181397
+-0.0177948 0.161129 -0.00657359
+-0.0762411 0.0901005 0.0388673
+-0.00749994 0.0647419 0.0560829
+-0.0872439 0.132483 0.0457019
+-0.0207923 0.0756874 -0.0390657
+0.00773677 0.0341095 0.00222437
+-0.00405506 0.101077 0.0451334
+-0.0537766 0.0826585 -0.0215583
+-0.0484986 0.0425777 0.0442245
+0.0370248 0.10907 0.0248298
+0.0550045 0.0727719 0.0183019
+-0.0531047 0.0345095 0.0361399
+0.0240424 0.122784 0.0256717
+-0.0321586 0.0349269 0.0472031
+-0.0487458 0.123267 -0.0102852
+0.0164927 0.107123 0.0418084
+-0.0518639 0.0999443 -0.0218198
+-0.0259535 0.0592275 0.0392168
+-0.0169683 0.186741 -0.0196674
+0.012157 0.123544 0.032833
+-0.0236685 0.0919017 0.0500491
+0.0048864 0.127407 -0.00526463
+-0.00324909 0.0389153 -0.000648163
+0.0108689 0.0576426 0.0524778
+0.0396737 0.107002 0.0161655
+-0.0816849 0.073475 0.00953613
+-0.0743109 0.165184 -0.0390136
+-0.0728909 0.120866 -0.00826881
+0.040969 0.0926354 0.0294955
+-0.00410534 0.0385566 0.0231802
+-0.0167703 0.0742961 -0.0390024
+0.0376363 0.109584 0.0207569
+0.00538144 0.0464854 -0.0270709
+-0.0503176 0.0388958 0.046006
+-0.0793777 0.154922 0.0242883
+-0.0476898 0.0679558 -0.0146484
+-0.0108886 0.108738 -0.0217426
+-0.0532571 0.151368 0.0204421
+-0.068651 0.163792 -0.0529788
+-0.0441151 0.0643553 0.040206
+-0.0275094 0.107088 0.0401149
+-0.0275566 0.0890776 0.0469337
+-0.0274957 0.102963 0.0425886
+-0.0266136 0.0837142 0.0504396
+0.015157 0.122808 -0.00836184
+-0.0234279 0.0636514 0.0436342
+-0.00941329 0.0943623 -0.0340451
+-0.0174189 0.178658 -0.0183022
+-0.0187779 0.183117 -0.0166827
+0.0130462 0.129592 0.0201813
+-0.0751825 0.149958 -0.0238676
+0.00897367 0.131122 0.0172577
+0.0483469 0.0589383 -0.00490848
+0.0422406 0.0986762 0.0221715
+-0.0921564 0.130934 0.011242
+-0.0327106 0.0764924 -0.028531
+0.0102149 0.0725802 0.055192
+-0.0636711 0.0593571 0.0158341
+-0.0123306 0.0394822 0.0386711
+-0.0718333 0.156164 0.022455
+-0.0864971 0.150096 0.00821548
+-0.0110742 0.123419 -0.00875247
+-0.080097 0.11274 -0.00201289
+-0.00271881 0.0655507 -0.0345764
+0.00140103 0.0390882 -0.0248121
+-0.0618299 0.0939366 -0.0189413
+-0.0716693 0.147461 -0.0281971
+-0.0231858 0.17269 -0.0205136
+-0.0637876 0.155678 -0.0402328
+-0.0228589 0.0637031 0.0444908
+-0.0238626 0.169762 -0.0118641
+-0.0752191 0.155599 0.0242023
+-0.0345019 0.0461718 -0.0254652
+-0.01605 0.0946681 0.0536372
+0.0246905 0.0477085 0.0389599
+0.0101881 0.0341976 -0.00109267
+-0.0293326 0.154386 -0.00360575
+0.00276097 0.131717 0.0121378
+-0.0859012 0.0899317 0.000454719
+-0.0297834 0.121969 -0.0069874
+-0.0297126 0.0508986 -0.0203549
+-0.0888501 0.151809 0.0151852
+-0.0824868 0.0965084 -0.00559576
+-0.0279025 0.124426 0.000511349
+-0.0111071 0.0879305 -0.0374747
+-0.0895782 0.133632 0.00522749
+-0.0325779 0.0341004 0.0231549
+-0.087069 0.100891 0.00537711
+-0.0182966 0.038653 -0.00715499
+-0.0181652 0.097581 -0.0254283
+0.00716304 0.0378885 -0.010707
+-0.0117789 0.0582633 0.0533407
+-0.0679898 0.154859 0.0296647
+0.0270346 0.0384464 0.0278157
+-0.0446977 0.147484 -0.0025954
+-0.0797208 0.0757926 0.0264575
+-0.0827795 0.113314 0.0464356
+-0.0405007 0.118003 0.0314814
+0.00913581 0.103011 -0.0206427
+-0.0712761 0.153449 0.0330143
+0.0296113 0.108994 -0.0114792
+0.0120747 0.0958655 -0.0254962
+-0.0357119 0.0695868 -0.0167299
+-0.0777217 0.159728 -0.0179219
+-0.0619192 0.0343817 0.0361087
+-0.0839142 0.0843714 -0.00355138
+0.0295472 0.11806 0.0262972
+-0.0344935 0.0733008 0.0417052
+0.0305902 0.0996469 -0.0155371
+-0.0731059 0.151228 -0.0378853
+-0.0740388 0.151266 -0.032878
+-0.0419789 0.152954 -0.00736227
+-0.00349089 0.112806 0.0419152
+0.00607582 0.0348373 0.023168
+-0.000568628 0.0388214 0.0254737
+0.0445611 0.0931651 0.0181595
+-0.0469298 0.126751 0.026776
+-0.0318643 0.104333 -0.0219242
+0.0119312 0.0725978 0.0541603
+-0.0435985 0.108724 -0.0190759
+-0.0274517 0.043312 0.0519115
+-0.00149233 0.077429 0.0585147
+-0.0618993 0.0433992 0.0415482
+0.0131559 0.129936 0.00738875
+0.00749621 0.107111 0.0412811
+0.0354668 0.0573224 -0.0106723
+-0.0211412 0.0652998 0.0483526
+-0.00680045 0.129424 0.0244883
+-0.0187344 0.126979 0.0202236
+0.00853139 0.0813381 0.0552215
+-0.0254455 0.0389929 0.0381911
+-0.0507728 0.111366 -0.017973
+-0.027716 0.0387019 -0.0165247
+-0.000266462 0.0936214 -0.0332218
+-0.0855847 0.0806062 0.0194802
+0.0100369 0.130324 0.00340984
+-0.0449017 0.148739 -0.00386394
+-0.0321132 0.0482449 -0.0223421
+-0.0893696 0.140675 0.0341739
+0.0448261 0.0875458 0.0221634
+-0.0454912 0.0719252 0.0419203
+-0.0718306 0.148291 -0.0327712
+-0.0812513 0.108802 0.0293202
+0.0429574 0.0859786 -0.00579554
+-0.0338336 0.0380945 -0.0153271
+-0.060738 0.148827 -0.00180261
+-0.0568701 0.141076 -0.0033696
+-0.0358396 0.125396 0.0214464
+-0.0789386 0.168616 -0.0354931
+-0.0315115 0.108439 0.0386203
+-0.0842691 0.117693 0.0488129
+-0.032501 0.101545 0.0423652
+-0.0289779 0.174216 -0.00689295
+-0.0622726 0.163207 -0.0582148
+-0.00885889 0.172674 -0.0247544
+-0.0519291 0.13698 0.0263868
+-0.0829532 0.112769 0.000219247
+-0.0237394 0.038003 0.0142418
+0.0321413 0.0513188 -0.0087021
+-0.0473947 0.0359569 0.0452833
+-0.0488828 0.108449 -0.0190525
+0.0415402 0.0928967 -0.0067838
+-0.0800241 0.0745873 0.0239149
+0.005197 0.0866258 -0.0333998
+0.00148166 0.107215 0.0427825
+-0.0694376 0.159556 -0.0509365
+-0.0306541 0.0650706 -0.0234343
+-0.0653365 0.167223 -0.0303028
+-0.0262324 0.15581 -0.00635861
+-0.0362329 0.165306 -0.00162934
+-0.00330758 0.0379537 -0.0147265
+-0.0267799 0.0893467 -0.0340353
+-0.0591073 0.155657 0.0168017
+-0.0331866 0.15511 0.000984746
+-0.0671323 0.152011 0.0359968
+0.0112495 0.0710359 -0.0320326
+-0.0289103 0.0508426 -0.0224168
+-0.0582351 0.043574 0.0153571
+-0.0770169 0.112922 0.0479771
+-0.0146932 0.0570315 -0.0346956
+-0.0735209 0.134443 0.0506533
+-0.0445794 0.130477 0.0137726
+-0.0744939 0.127436 0.052791
+-0.0376156 0.0492564 -0.0118933
+-0.0462534 0.123907 0.0259058
+-0.0434909 0.104315 0.0413728
+-0.0779429 0.0893818 -0.0115854
+-0.067492 0.10005 0.0413205
+-0.0882017 0.0949941 0.0238463
+0.0438775 0.06952 0.000229591
+-0.0171444 0.168289 -0.0207283
+-0.0236004 0.0383091 -0.00235181
+-0.0697889 0.172796 -0.0390999
+-0.0291426 0.042089 -0.0296009
+-0.0446441 0.0338442 0.00651202
+-0.000500925 0.121055 0.0369996
+0.022042 0.12426 0.000701449
+0.00803725 0.125889 0.0313
+-0.0517799 0.0840941 -0.0216716
+-0.0145005 0.0842486 0.056982
+-0.0886066 0.113065 0.00725433
+0.0156656 0.0713152 0.0525386
+-0.0164665 0.068805 0.0544258
+0.0182285 0.0820502 -0.0281776
+-0.00610364 0.0386755 0.000846714
+-0.0599938 0.126727 -0.00781868
+-0.0155017 0.100285 0.044225
+-0.0638562 0.0423917 -0.00506847
+-0.0444796 0.0338614 0.0280014
+-0.000499767 0.100727 0.0463954
+-0.0162094 0.172709 -0.0239586
+-0.0690346 0.0338087 0.00696066
+-0.062316 0.158431 -0.019584
+0.00644358 0.129282 -0.00129108
+0.0188124 0.0393785 0.042705
+-0.0847946 0.140657 0.0430258
+-0.0835274 0.0979539 0.0303801
+-0.0241902 0.160559 -0.0136368
+-0.06502 0.161419 -0.0172527
+-0.0772789 0.154395 0.0279022
+-0.0681261 0.15638 0.0193912
+-0.0337268 0.111492 -0.0180397
+-0.0323736 0.176483 -0.0134412
+-0.0291608 0.0806486 0.0445728
+-0.0846331 0.0781756 0.0181083
+-0.0498753 0.106996 -0.0192538
+0.00350083 0.0730867 0.0562031
+-0.0231171 0.0347933 0.0492623
+-0.0616059 0.0342155 0.0188015
+-0.0516 0.0545447 0.0296397
+-0.0763817 0.169448 -0.0429673
+-0.069513 0.17974 -0.0519891
+-0.0588484 0.13671 0.0342246
+-0.0780833 0.1597 -0.0209281
+0.00109253 0.113026 -0.0199046
+-0.0227366 0.157094 -0.00651614
+0.0344933 0.0929192 0.0394802
+-0.000408544 0.126448 -0.00615558
+-0.0805024 0.128853 0.052889
+-0.00020637 0.0947598 -0.0324026
+-0.089811 0.143072 0.0296513
+0.0321792 0.0929416 0.0413986
+-0.0145721 0.168692 -0.0222333
+0.0595491 0.0594739 0.0201736
+-0.0810451 0.0800939 -0.00453207
+-0.0267843 0.0880044 -0.0350453
+-0.040033 0.126629 -0.00388698
+-0.0208083 0.0348218 0.0462671
+-0.082826 0.11472 -0.00162443
+-0.0301654 0.12556 0.01613
+-0.0485613 0.0418518 -0.011173
+-0.0784181 0.163881 -0.0269512
+0.0387541 0.0617571 -0.00875906
+0.0464006 0.0792571 0.0121793
+-0.00359562 0.043415 -0.0257386
+-0.0333921 0.126443 0.0164188
+-0.00106292 0.130975 0.00499363
+-0.0668008 0.060458 0.0159676
+-0.0254977 0.107106 0.0408331
+-0.0682758 0.06442 0.0246162
+-0.0298175 0.125729 0.00888885
+-0.088267 0.147416 0.00925394
+0.0542609 0.050631 0.00222604
+0.0422118 0.100079 0.0191646
+-0.081175 0.14869 0.00117764
+-0.0344163 0.0346761 0.0417292
+-0.0623017 0.163119 -0.0425932
+-0.0298952 0.0565521 -0.0204023
+-0.076686 0.0781369 0.0338733
+-0.0338704 0.102893 -0.0218261
+-0.0355104 0.0775398 0.0419002
+-0.0584924 0.0630612 0.0296076
+0.0454221 0.0889974 0.0141646
+-0.0417964 0.0347181 0.00810808
+0.0363875 0.0505227 -0.00658574
+-0.053281 0.144674 0.0233765
+0.0262687 0.0352193 0.019674
+-0.0168964 0.123328 -0.00656517
+-0.0606083 0.118309 0.0403758
+0.00639612 0.0418759 -0.0239341
+0.0231261 0.0431609 -0.0107258
+-0.00718079 0.0390105 -0.0127195
+-0.00364386 0.0901332 -0.0356262
+-0.00854262 0.033753 -0.0231542
+-0.0124761 0.0531764 0.0512005
+-0.0231395 0.168252 -0.0189417
+0.0233331 0.0354178 0.02435
+-0.000241537 0.0397743 0.0467748
+-0.0723661 0.147118 -0.0228625
+-0.0517688 0.0612265 0.030932
+-0.063068 0.161146 -0.0557557
+-0.0279123 0.0793217 0.046185
+-0.0627986 0.0441541 -0.00325511
+-0.0165065 0.100263 0.0439632
+-0.0217072 0.0582569 -0.0327502
+0.0254642 0.12325 0.0062381
+-0.086501 0.0833246 0.0174861
+-0.074502 0.11613 0.052068
+0.032458 0.0910982 -0.0184345
+-0.0729629 0.155811 0.0249814
+-0.0506733 0.162525 0.00564316
+-0.0697867 0.034416 -0.00452426
+0.0189467 0.0754919 0.0520404
+-0.0165401 0.0997826 0.0440769
+-0.086829 0.0847067 0.0174745
+-0.0474936 0.146975 -0.00223523
+-0.065417 0.154594 -0.0449582
+-0.0614906 0.0590888 0.0075192
+-0.0686207 0.128453 0.0500102
+-0.023162 0.0958328 0.0451924
+-0.0258056 0.0550238 0.0391969
+-0.0102599 0.0407381 0.0498453
+-0.0664749 0.0875478 0.0443297
+0.0581415 0.0538012 0.00818348
+-0.0384918 0.0903063 0.0434643
+-0.0457684 0.132352 0.0133121
+-0.0728932 0.0941961 0.0410307
+-0.0809085 0.111715 -0.000772193
+-0.0833393 0.0979244 -0.00460929
+-0.0671961 0.15591 -0.00355939
+-0.0455114 0.0338265 0.027816
+0.01975 0.0343373 0.00255688
+-0.0875501 0.120326 0.0478169
+0.0353576 0.0505704 -0.00670224
+0.00356645 0.0339958 0.0125338
+0.0590653 0.0552605 0.0161784
+-0.084435 0.0791603 0.0205035
+-0.0255122 0.0349295 -0.0287387
+-0.0724789 0.110508 0.0438845
+0.00447986 0.0385716 -0.0118677
+-0.066989 0.136993 -0.00809827
+0.0384287 0.064558 0.0344028
+-0.0516036 0.0560273 -0.00839821
+-0.00350028 0.110017 0.0429859
+-0.0111634 0.0391658 0.035606
+0.0183426 0.0906063 -0.0259275
+-0.031909 0.154239 -0.00732019
+-0.0800971 0.0773092 -0.00453369
+-0.0190564 0.0920061 -0.0357108
+0.0133608 0.0494245 -0.0271921
+-0.0787339 0.140316 -0.00472414
+-0.0275167 0.116662 0.0324113
+0.00652621 0.104352 0.0432895
+0.0358497 0.0713653 0.0377445
+-0.0918605 0.116299 0.0240619
+-0.0522199 0.061167 0.0299696
+-0.0201447 0.166816 -0.0117812
+-0.0433732 0.122414 -0.0114499
+-0.0645963 0.0430073 0.0358234
+-0.0779043 0.1583 -0.0209193
+0.0367132 0.0547551 0.0317845
+-0.0351109 0.16372 -0.0144674
+-0.0434603 0.109995 -0.0184047
+-0.0576869 0.0677197 -0.0118328
+0.00623854 0.074018 -0.0343382
+0.0443987 0.0959613 0.0131589
+-0.089865 0.120262 0.0458544
+0.0103837 0.0449023 -0.0251665
+-0.0770006 0.139838 -0.00569476
+-0.072687 0.0955359 0.0408041
+-0.0569361 0.046073 0.0125834
+-0.0604913 0.0818799 0.0434166
+-0.0460645 0.151688 -0.00554828
+-0.015331 0.0349099 0.0491212
+-0.0229594 0.0811266 0.055321
+0.0274663 0.0754645 0.0450048
+-0.00267666 0.0374926 0.0135597
+-0.011518 0.0673875 0.054571
+0.013368 0.122467 -0.00997636
+-0.0722821 0.143895 -0.0129091
+0.0454962 0.0443878 0.000424365
+-0.0127602 0.0382241 0.0199007
+-0.091546 0.146121 0.023146
+0.00392744 0.0371222 0.0242968
+-0.0385489 0.119476 -0.0123722
+0.0114833 0.0936471 0.0518498
+-0.0643328 0.146767 0.0386771
+-0.0624894 0.163088 -0.0505885
+-0.0375004 0.0464372 0.040096
+0.0460037 0.0834239 0.0131685
+0.033027 0.108336 -0.00876159
+0.013228 0.0990749 -0.0229052
+0.034148 0.0442132 0.0295363
+-0.0907186 0.113289 0.0113419
+0.0210633 0.106016 0.0411627
+-0.0454948 0.119311 0.0290591
+-0.0676975 0.0607342 0.0101856
+-0.0195364 0.0461211 0.0518679
+0.0161339 0.0672434 0.0514025
+-0.0693216 0.0620201 0.0176481
+0.0429729 0.0944315 -0.00180352
+-0.0494828 0.135763 0.0221907
+-0.060805 0.0867676 -0.0196616
+-0.0247298 0.125997 0.0151584
+0.059297 0.0608379 0.0211666
+-0.080116 0.153024 0.0299773
+0.0574282 0.0681585 0.00377242
+-0.0535498 0.0486673 -0.00635158
+-0.0304741 0.177281 -0.004356
+-0.0855011 0.0792275 0.0175034
+-0.0804698 0.130248 0.0526854
+0.000343862 0.0539275 -0.0306641
+-0.0900062 0.133811 0.0372136
+0.0104354 0.0347372 0.0259595
+-0.0574962 0.0440189 0.0444763
+-0.0573422 0.0335757 0.00237022
+0.0404449 0.0739232 0.0320846
+-0.00464724 0.0496642 -0.0307417
+-0.0311133 0.0510509 -0.015361
+0.0169782 0.128539 0.0144983
+-0.0872732 0.151714 0.0113029
+-0.0345546 0.0409268 0.0482929
+-0.0745628 0.173554 -0.0490908
+-0.0213027 0.0381376 0.0110019
+0.0223647 0.0782061 0.0499784
+0.0111959 0.0879068 -0.0311136
+0.0141654 0.115006 -0.0159235
+-0.0175094 0.116845 0.0368185
+0.0185047 0.0369619 -0.0146835
+-0.0924063 0.129578 0.0112381
+-0.00949945 0.0517772 0.0514996
+-0.0666563 0.0656524 -0.0048951
+-0.0494962 0.100168 0.0429965
+0.00776642 0.130336 0.022539
+-0.0564976 0.0904367 0.0452654
+-0.0648339 0.153263 -0.0390895
+0.0140569 0.12802 0.0248446
+-0.00977705 0.174183 -0.0237537
+-0.0154865 0.0530505 0.0500296
+-0.0627622 0.0810191 -0.0190992
+-0.0385594 0.173184 -0.00190958
+-0.00314149 0.0972112 0.0530078
+-0.0418773 0.107078 -0.0201516
+0.0363342 0.109637 -0.000829727
+0.021507 0.126326 0.01189
+-0.030496 0.0988081 0.0439786
+-0.0769628 0.150462 0.0371334
+-0.0941104 0.126894 0.0182531
+-0.0255083 0.112568 0.0366767
+-0.0746801 0.157704 -0.00556618
+-0.0418449 0.0971142 -0.0220611
+-0.0359493 0.125342 -0.00457539
+-0.0258164 0.0853463 -0.0368715
+0.0497106 0.0482066 0.0259506
+-0.0716942 0.1568 -0.0399156
+-0.0618117 0.0590403 0.0165038
+-0.0714498 0.15679 -0.0419165
+-0.0701989 0.0368637 0.0105096
+0.0597267 0.0636404 0.0201833
+-0.0915748 0.124221 0.0431828
+-0.0690929 0.156328 0.0219534
+-0.0302767 0.0622182 -0.0224251
+-0.00771091 0.0627931 -0.0356131
+0.0394872 0.0513548 0.03224
+-0.0229845 0.0724431 0.0499564
+-0.0290201 0.125445 0.00626167
+-0.0729777 0.138423 -0.00695981
+-0.00991212 0.111561 -0.0201766
+0.000200297 0.0825801 -0.036136
+0.0364442 0.0590953 0.0349595
+0.0364996 0.0928818 0.0370772
+-0.0181329 0.0432293 0.0524811
+0.00280759 0.0350639 0.0204847
+-0.0626379 0.152126 -0.0285986
+-0.0704211 0.15543 0.027334
+0.000301963 0.100099 0.0481787
+-0.049492 0.0917757 0.044207
+-0.015502 0.0897786 0.0564851
+-0.0318792 0.156356 -0.0104816
+0.0416778 0.102863 0.015161
+0.0504722 0.048918 -0.000684915
+-0.0611415 0.0359024 -0.0090437
+-0.0264937 0.098817 0.0439871
+-0.000436317 0.122463 0.0356275
+-0.0875676 0.129767 0.0460862
+-0.0312863 0.0777611 -0.0325602
+-0.0303664 0.112853 -0.0174686
+-0.00773829 0.0684701 -0.0360951
+-0.0647534 0.156678 -0.0475943
+-0.0891175 0.0983455 0.0194044
+0.00833741 0.055373 -0.0305597
+-0.0550257 0.131065 -0.00539027
+-0.0305029 0.0689001 0.0393777
+-0.0596554 0.0343168 0.0331724
+0.0436089 0.0680569 -0.000247417
+-0.0786395 0.163873 -0.0279533
+-0.0574243 0.0613459 0.0260206
+-0.0338728 0.0483909 -0.0193366
+-0.0287306 0.074519 0.0412207
+0.016916 0.0577101 0.0489225
+-0.0184307 0.0347944 0.0485523
+-0.0655112 0.0803784 0.0426229
+-0.0332327 0.160967 -0.000804209
+-0.0533105 0.0541891 0.0115512
+-0.0356689 0.117866 -0.0126779
+-0.0699903 0.034504 0.00971713
+-0.0588141 0.0341524 0.0282501
+-0.0177813 0.0770869 -0.0388032
+0.0445157 0.0467554 0.0289718
+0.00964716 0.128306 -0.00229994
+-0.0666126 0.148623 0.0392621
+-0.0325544 0.0348985 0.0454309
+-0.0623108 0.039732 0.0166963
+-0.0917483 0.122888 0.0433845
+0.0271866 0.0819517 -0.0229154
+-0.00863658 0.0467032 -0.0298179
+-0.0620847 0.166243 -0.0515916
+-0.0912832 0.125583 0.0428488
+-0.0588072 0.0481223 0.00266039
+-0.0913122 0.133748 0.0212171
+0.0482658 0.0433313 0.0185611
+0.00774922 0.0351262 -0.0136823
+0.0357585 0.0562848 0.0339755
+-0.029123 0.166739 -0.016877
+-0.0338028 0.122413 -0.00742547
+0.0216799 0.0415358 -0.0117265
+-0.0257594 0.171231 -0.0110774
+-0.0641199 0.162494 -0.0212451
+-0.0535748 0.155622 0.0115317
+0.0531674 0.0736169 0.0146631
+0.0135129 0.0347107 0.0374491
+0.0227019 0.123147 0.0266031
+0.025252 0.0719314 -0.0249494
+0.0309797 0.118122 0.0225615
+0.0415492 0.0724945 0.03012
+0.000493498 0.119652 0.0380928
+0.0229975 0.123119 -0.000380287
+0.0234322 0.100371 -0.0202365
+-0.0620057 0.153738 -0.0265835
+-0.0398723 0.105663 -0.0203219
+-0.0632416 0.0445478 0.0366988
+-0.0310386 0.154131 -0.00157547
+-0.0042992 0.0348909 0.0408189
+-0.00181562 0.0826307 -0.0368615
+0.0388816 0.0927717 0.0335536
+-0.0335058 0.0760991 0.0415371
+-0.0314963 0.0917789 0.0442247
+-0.0512549 0.0612644 0.0318233
+-0.00281159 0.131227 0.0100802
+-0.0531145 0.157563 -0.00324336
+-0.0635867 0.03486 0.0405057
+-0.0627936 0.15522 -0.0356106
+0.0166245 0.122097 0.0315907
+-0.0106759 0.119083 -0.0141801
+-0.0465015 0.0689677 0.0402969
+-0.0626599 0.0423324 0.0141491
+-0.0515376 0.053149 0.0306286
+0.00413437 0.124074 -0.00964261
+-0.0105331 0.127013 0.0275477
+-0.042312 0.0337552 -0.0130352
+0.0472026 0.0681414 0.0256953
+0.0213439 0.0741385 0.0502206
+0.0156241 0.128368 0.0211329
+0.0358549 0.0843357 -0.0172902
+-0.0533892 0.064921 0.0343521
+0.0273368 0.091573 0.0449418
+-0.0440333 0.0423079 -0.0173091
+-0.0764978 0.13864 0.0490601
+0.00750117 0.0716903 0.0560753
+0.0454321 0.0861887 0.0181684
+-0.0812985 0.084505 0.0328118
+-0.0605375 0.155317 0.003221
+-0.0065332 0.130449 0.0187888
+0.0247646 0.122114 0.0259409
+-0.0711064 0.152637 0.0345827
+-0.0155013 0.0716083 0.0551341
+0.0277791 0.0822205 0.0455159
+-0.0445183 0.0675631 0.0404632
+-0.0772746 0.147261 -0.00486297
+-0.0868795 0.0927253 0.00342064
+-0.0458425 0.0985138 -0.0217256
+-0.0906083 0.131058 0.0342318
+-0.091547 0.146101 0.0191506
+-0.00249086 0.116945 0.0398999
+0.0385734 0.0699568 0.0346425
+-0.0129648 0.116833 -0.0157687
+0.0215791 0.120444 0.0319368
+-0.0899229 0.115405 0.0270455
+-0.0697992 0.0836733 -0.0171139
+-0.0415794 0.128056 0.0149128
+-0.0734779 0.180121 -0.0504836
+-0.0466973 0.0665278 -0.0146823
+-0.0673893 0.156703 -0.00509746
+0.00108438 0.119342 -0.0145393
+-0.019494 0.0842608 0.0571688
+0.0285713 0.0551672 -0.0188053
+0.00650695 0.0731027 0.0564796
+-0.0557862 0.0854763 -0.0214113
+-0.0743851 0.163815 -0.0369793
+-0.0286768 0.123948 -0.00103929
+-0.0301123 0.163751 -0.0154896
+0.0410386 0.099944 -0.00278716
+0.00848446 0.0518256 0.0516867
+-0.051108 0.0530218 0.0319282
+-0.0905758 0.113954 0.0388293
+-0.00470317 0.038779 0.00289117
+-0.0247258 0.0638997 -0.032873
+-0.04111 0.159177 -0.0108205
+-0.0892399 0.140676 0.0351725
+-0.075004 0.141334 -0.0064915
+-0.0463338 0.132474 0.00863126
+-0.0541416 0.034749 0.0443256
+-0.0781873 0.168068 -0.0319708
+0.0328915 0.0696754 -0.0177356
+0.0346158 0.0369318 0.00517598
+-0.0694908 0.124597 0.0526574
+0.0581844 0.0711857 0.0106064
+-0.0378081 0.0841771 -0.022143
+-0.0281622 0.169703 -0.0179592
+0.0305485 0.118199 0.0238252
+-0.0289649 0.0747374 -0.0345478
+-0.0272221 0.0904382 0.0465675
+-0.0514982 0.0848246 0.0453901
+-0.051623 0.0531083 0.0226238
+-0.0398125 0.0899922 -0.0232612
+-0.0236559 0.0709438 0.0478646
+-0.053816 0.0559281 -0.00642904
+0.0603322 0.0636924 0.0181801
+-0.0884616 0.136381 0.00620417
+-0.0394936 0.046476 0.0404962
+-0.0530638 0.0723343 0.0404003
+0.0102711 0.0695708 -0.0315811
+0.0339253 0.115718 0.0108315
+-0.0295473 0.0358282 0.0521362
+0.0116453 0.090034 0.0538428
+0.0450904 0.0875663 0.0201674
+0.0326336 0.0519746 0.0346532
+0.03367 0.072742 0.0398859
+0.024638 0.124378 0.010214
+0.0415181 0.0484385 0.0321463
+-0.044143 0.159411 0.00624881
+-0.0495653 0.047469 -0.00900107
+-0.0894571 0.131034 0.0422704
+-0.075804 0.161028 -0.0299559
+-0.0164919 0.0968814 -0.0286925
+0.0229929 0.0371968 0.0317242
+0.0352506 0.101471 -0.011425
+-0.049558 0.0389942 -0.0116749
+-0.0223649 0.171249 -0.0132085
+-0.0667327 0.078026 -0.0171522
+0.0442166 0.0846846 -0.00180459
+-0.0518774 0.104165 -0.0200373
+-0.0393536 0.0336231 0.00416845
+0.00720473 0.0823989 -0.0333538
+-0.0288578 0.101545 -0.0231915
+0.0245524 0.106048 0.0391612
+-0.0851811 0.0897279 0.0280525
+-0.00334607 0.0347739 0.0411187
+-0.0430221 0.128224 0.015861
+0.0243931 0.0503998 -0.0217952
+-0.0394902 0.0506047 0.0393469
+0.0293799 0.0892796 -0.0205263
+-0.0574934 0.0875623 0.0444505
+-0.0644211 0.0347126 0.0370276
+-0.0169241 0.181626 -0.0193127
+-0.0564978 0.0732565 0.0410435
+-0.0544221 0.144671 0.0284168
+0.0203184 0.0650483 -0.0276666
+-0.0648645 0.041891 0.032665
+-0.0451284 0.159142 -0.00893675
+0.0451235 0.093189 0.0121575
+-0.0577489 0.0479998 -0.00135721
+-0.0606371 0.0448145 0.012064
+0.0495086 0.0638139 0.0293036
+0.0458685 0.0862133 0.0111669
+-0.0531099 0.136165 -0.00197183
+0.0285441 0.0509095 -0.0177614
+-0.013074 0.0383381 0.00704947
+-0.0223231 0.0391341 0.0387105
+0.0393846 0.0429207 -0.00283799
+0.0202147 0.0847891 -0.0269071
+0.00923869 0.035402 -0.0117616
+-0.060367 0.11933 -0.00999174
+-0.0772797 0.157576 -0.0127941
+-0.0732669 0.179344 -0.0490063
+-0.0683896 0.0420777 -0.000309277
+-0.0539058 0.102757 -0.0202213
+-0.0453256 0.169857 -0.00299568
+-0.0616838 0.0659304 -0.00830259
+0.00414244 0.129952 4.9397e-05
+-0.0404915 0.113924 0.0347061
+-0.0942425 0.120105 0.0182851
+-0.0324906 0.080327 0.0414535
+0.0529677 0.0595446 0.0290441
+-0.0904857 0.114242 0.0332623
+-0.0703591 0.181312 -0.0565189
+-0.0475241 0.112407 -0.0169253
+0.0109831 0.0341684 -0.0140433
+-0.089612 0.139257 0.0251846
+-0.0373738 0.0365422 0.044687
+0.0564401 0.0662549 0.00171258
+-0.0581251 0.0334091 -0.00125013
+-0.0407273 0.0696207 -0.0166002
+-0.0669961 0.165196 -0.05701
+0.0131268 0.120538 0.0349816
+0.0367009 0.0812747 -0.0157528
+-0.0077824 0.0784642 -0.0379203
+-0.0647128 0.155185 0.0278857
+0.00549498 0.0951378 0.0528545
+-0.0108057 0.0342947 -0.0255969
+-0.0911579 0.129687 0.0342384
+-0.080608 0.0720682 0.0165498
+-0.073439 0.148627 -0.0298053
+-0.0271937 0.174158 -0.0183459
+-0.0244966 0.0509689 0.0431921
+-0.00162246 0.0450436 -0.027024
+-0.0775221 0.104823 0.0340694
+0.0154861 0.0927165 0.0506449
+-0.0599536 0.123822 -0.00839074
+-0.079866 0.0706372 0.0115498
+-0.0815235 0.0899003 0.0328752
+0.0313378 0.118325 0.00558524
+0.0248331 0.123944 0.0188283
+-0.0898787 0.112224 0.0169361
+-0.0662043 0.065068 0.0280019
+0.0246717 0.0434401 -0.00867806
+-0.0469681 0.134154 0.0128397
+-0.0291377 0.0860908 -0.0335904
+0.0147704 0.0519654 0.0475176
+-0.0296475 0.169744 -0.0079151
+-0.0211888 0.175661 -0.0220113
+-0.0347689 0.0780934 -0.0215038
+-0.013019 0.129549 0.0120959
+0.0421932 0.0662609 -0.00283376
+0.0111358 0.0352671 0.0436641
+-0.0705399 0.100871 0.0399167
+-0.0604975 0.0832903 0.0437356
+-0.0659485 0.126772 -0.00885106
+-0.0702518 0.06756 0.0285092
+-0.00688661 0.108791 -0.0226031
+-0.0786437 0.112204 0.0464731
+0.00637271 0.130879 0.0205945
+-0.066894 0.110895 -0.0121462
+0.0123118 0.0623753 -0.0299343
+-0.0285044 0.109801 0.0380702
+0.00650421 0.0883449 0.0558788
+-0.0545694 0.124267 -0.00721739
+-0.0626588 0.161511 -0.0455953
+-0.0861214 0.132549 0.0473951
+-0.0627776 0.125519 0.0444184
+-0.0177321 0.160293 -0.0123373
+-0.0490182 0.0345781 0.0369526
+-0.0297799 0.106834 -0.0211406
+-0.079558 0.151858 0.0332132
+-0.0404921 0.0648693 0.0415314
+-0.0530069 0.153493 0.0132253
+-0.0339683 0.0485791 0.0404406
+-0.0421354 0.0449426 -0.0173193
+-0.0517467 0.076797 -0.0188523
+-0.060863 0.0583083 0.0137477
+0.0112347 0.0794806 -0.0318525
+0.00351036 0.0856577 0.0572413
+-0.0648576 0.101039 -0.0173044
+-0.0601123 0.0381131 0.0455939
+-0.015494 0.0515277 0.0489706
+-0.0275254 0.1668 -0.00838328
+-0.0365126 0.077567 0.0421306
+-0.0195832 0.1596 -0.0115811
+0.00251466 0.0744821 0.0563666
+0.0589788 0.062133 0.0220601
+-0.066902 0.117219 0.0507079
+-0.0396194 0.0335538 -0.0253204
+-0.0297618 0.107877 -0.0202294
+-0.00601771 0.0990415 0.0504631
+-0.084398 0.0778007 0.013518
+0.0271613 0.0368693 0.0238228
+-0.0589877 0.0335902 0.00921609
+0.029871 0.0968887 0.0415927
+0.00949394 0.0426698 0.0450285
+-0.0697739 0.0382195 0.0100596
+0.0231426 0.0768603 0.0493195
+-0.00501253 0.125042 0.0324689
+-0.00710159 0.0387114 0.00061319
+-0.0177128 0.0599179 -0.0354327
+-0.045698 0.157938 0.00750606
+0.00190257 0.130874 0.00322319
+-0.0444648 0.0945053 0.0429498
+-0.0772757 0.148645 -0.0058688
+-0.069822 0.156776 -0.00162593
+-0.0445001 0.117958 0.0308281
+-0.0409685 0.0462375 -0.0173222
+-0.0305996 0.0509893 -0.0173575
+0.00196704 0.0385066 0.0244659
+-0.00668986 0.0584241 -0.0339312
+-0.0587805 0.0811174 -0.0202922
+-0.0492044 0.143127 0.00539863
+-0.0686509 0.155409 0.00612964
+-0.0404209 0.150087 -0.00469474
+-0.00449521 0.0925603 0.0561444
+-0.000397233 0.131333 0.0167016
+-0.0552402 0.138165 0.0306253
+0.0215752 0.056436 0.0468827
+-0.0248564 0.100174 -0.0239639
+-0.0165731 0.0386082 0.0295958
+0.0232801 0.125085 0.0182493
+0.0228318 0.0357435 0.0257706
+-0.0492021 0.127407 -0.00458885
+-0.0878029 0.112934 0.0313303
+0.0465727 0.0554592 0.0320923
+-0.0288967 0.0499669 0.0438168
+-0.000173892 0.120963 -0.0122496
+-0.0704499 0.154022 0.0317661
+-0.0151711 0.0346724 0.0458457
+-0.0640566 0.138182 0.0390191
+0.0398408 0.105612 0.0201716
+0.0444976 0.0583814 0.0318302
+0.031639 0.0370094 0.0209702
+-0.0104878 0.112778 0.0413082
+-0.0672962 0.0785128 0.0408262
+-0.0760729 0.0675487 0.00755458
+-0.0571409 0.0642584 0.0323718
+0.0261418 0.0859362 -0.0230192
+-0.015502 0.0856307 0.0568812
+0.0189265 0.119915 -0.00924366
+-0.0119328 0.103575 -0.0236984
+-0.00622128 0.0384574 0.0119659
+-0.0779451 0.128117 -0.00684087
+-0.0657248 0.120041 0.0506761
+-0.0623817 0.147548 -0.00757469
+-0.0875561 0.121673 0.0477803
+0.0222529 0.0365833 0.0139797
+-0.00142937 0.126525 -0.00622577
+-0.0226373 0.0386776 -0.0154938
+-0.0648114 0.0335165 0.00450366
+0.0210136 0.0713836 0.0497227
+-0.0348346 0.0347214 0.0345782
+-0.027609 0.0850124 0.048532
+-0.0856119 0.0819492 0.0204815
+-0.0601038 0.0347331 -0.00989443
+0.00929494 0.0956507 -0.0272714
+-0.0915391 0.118654 0.00731945
+-0.00449819 0.0604864 0.0551163
+0.0204818 0.0854612 -0.0266087
+-0.0429251 0.129071 0.00699388
+-0.0789967 0.138332 -0.00474353
+0.0343592 0.0519767 -0.00689954
+-0.0921408 0.125525 0.040859
+0.0516782 0.0702939 0.00352664
+-0.022659 0.0508417 -0.0286643
+-0.00138527 0.0424799 0.0468649
+0.0452912 0.0903849 0.0031762
+0.0401652 0.0717052 -0.00977551
+-0.0905185 0.148805 0.0131551
+-0.0470106 0.149195 0.00904699
+-0.0201874 0.0711262 0.0528634
+-0.0555353 0.0388223 -0.0103544
+-0.0714965 0.154091 0.0314059
+0.0232354 0.0968772 0.0460698
+-0.020264 0.0381835 0.0111715
+-0.0267635 0.177003 -0.0181719
+-0.0755105 0.151351 -0.0138965
+-0.00749931 0.0925693 0.0562701
+-0.063994 0.152679 -0.0352218
+0.0453927 0.0833662 0.00319518
+-0.0137973 0.081348 -0.0391911
+-0.0433806 0.120699 0.0278302
+0.0462048 0.0792353 0.00618416
+-0.0498122 0.141672 0.00439987
+-0.0592291 0.156682 0.00368263
+-0.0525972 0.055954 -0.00763978
+-0.0796979 0.108952 0.0363543
+-0.0334959 0.0335656 -0.024125
+0.0047441 0.131688 0.0100125
+-0.0530342 0.15087 0.0203968
+-0.0794975 0.133078 0.0519067
+0.0231582 0.125381 0.0124998
+-0.0898343 0.122953 0.0457467
+0.0336909 0.115719 0.00499933
+-0.0364989 0.0705154 0.0419282
+-0.0641133 0.155183 -0.0406054
+-0.0303694 0.034667 0.0426012
+-0.0474034 0.126784 0.0277907
+0.0312862 0.107094 -0.0114403
+-0.0399374 0.122179 0.0274746
+-0.0715157 0.106884 0.0372861
+0.0432452 0.100105 0.0111579
+-0.0264035 0.0386467 -0.0143525
+-0.053047 0.162457 0.00378602
+-0.0573985 0.155942 0.000257732
+-0.0104925 0.119661 0.037142
+-0.0107108 0.0656519 -0.03625
+0.0153129 0.0637748 -0.0295702
+-0.047649 0.128193 0.0275289
+-0.0395091 0.0986823 0.0417741
+0.0582857 0.0709436 0.0165587
+0.0144142 0.0418406 -0.0232939
+-0.0406818 0.0636695 -0.0135779
+-0.0700194 0.0408862 0.000674154
+-0.0898984 0.139201 0.0142132
+-0.0368759 0.102855 -0.0211016
+-0.031161 0.177923 -0.0048433
+-0.0216559 0.0380957 0.0145856
+-0.00121026 0.129846 0.000241032
+-0.0176504 0.0583335 0.0507279
+0.0492902 0.0704301 0.0235452
+0.008888 0.126629 0.0301427
+-0.0897638 0.136555 0.0361946
+-0.0903944 0.113745 0.0354564
+0.0327067 0.0659933 0.0401778
+-0.0167299 0.0383654 0.0243772
+0.0403616 0.0561214 -0.00579676
+-0.0891677 0.150225 0.0241083
+-0.0128992 0.165641 -0.0199242
+-0.0596113 0.0581543 0.0105384
+0.0326521 0.108705 0.0315863
+-0.0448105 0.126695 -0.00590468
+0.0440256 0.0973461 0.0131583
+-0.0694635 0.0618968 0.00696654
+-0.0667991 0.06462 0.0265045
+0.0388894 0.060327 0.0314833
+0.0120611 0.11304 -0.0178164
+-0.0635386 0.151731 -0.00361755
+-0.00656125 0.130634 0.0158888
+0.0344174 0.0430387 -0.00433126
+-0.00549778 0.129792 0.00189197
+-0.0499313 0.134148 0.000258943
+-0.0563569 0.155043 0.0148967
+-0.00737522 0.0388161 -0.00139235
+0.0283929 0.0347449 0.011384
+-0.010683 0.0908469 -0.0364652
+-0.048501 0.109818 0.0382143
+-0.0690431 0.169001 -0.0273587
+0.0102657 0.0954683 -0.0270889
+0.0126468 0.0820043 0.0535026
+-0.0507783 0.0613366 0.0327704
+0.00559724 0.128727 -0.00267638
+-0.044734 0.0724552 -0.0176324
+-0.0283736 0.0336157 -0.0231629
+-0.0679859 0.155562 0.00782161
+-0.0939853 0.126886 0.0172543
+-0.0238126 0.0840242 -0.0378907
+-0.0152029 0.16973 -0.0225848
+0.0303318 0.0382842 0.0249985
+-0.0463034 0.0382871 -0.0172845
+-0.012857 0.0968183 -0.0306036
+0.0139515 0.0933972 -0.0268828
+-0.0598089 0.0334419 -0.0052474
+-0.0682308 0.180685 -0.0584278
+-0.0564615 0.0452367 0.0437224
+0.0122525 0.036039 -0.0217262
+-0.0324956 0.119317 0.0295507
+-0.050852 0.0985174 -0.022094
+0.0359226 0.0926166 -0.0140085
+0.0475195 0.0583521 0.0315949
+0.00440154 0.12483 0.0329119
+-0.0725064 0.152612 -0.0398907
+-0.00124079 0.0388178 0.0271443
+-0.0855936 0.143251 0.00719107
+-0.0618131 0.161554 -0.0315928
+-0.0315498 0.0848744 -0.0295692
+-0.0167783 0.0770825 -0.0387039
+-0.024832 0.0930098 -0.0316179
+-0.0356976 0.121856 -0.0088333
+0.0456324 0.0875991 0.0131626
+0.0344601 0.0660136 0.0392214
+0.008313 0.0639391 -0.0318667
+0.0352496 0.0656442 -0.0147977
+-0.0468498 0.0999476 -0.0216953
+-0.0215077 0.111305 0.0395987
+-0.0345319 0.122423 0.0264163
+0.0333657 0.0835669 0.0412915
+-0.0594982 0.143919 0.0350801
+-0.0210079 0.184692 -0.0198306
+-0.09225 0.125605 0.0402535
+-0.0764966 0.117544 0.0520468
+0.0261457 0.100404 -0.0183041
+0.0314049 0.0431209 -0.00494122
+-0.000675964 0.056864 -0.0322097
+-0.0759667 0.135448 -0.00632576
+0.0194608 0.0865014 0.0497298
+0.0480114 0.0447211 0.0227621
+0.0382636 0.109749 0.0121659
+-0.0191397 0.0920316 0.0539979
+0.0148906 0.112386 -0.0170744
+-0.0156084 0.0378086 -0.0269252
+0.0166879 0.0355485 0.0409566
+-0.0719103 0.125286 -0.00863314
+0.0390766 0.0901064 0.0338413
+0.0238446 0.123573 0.0241681
+0.0180905 0.1262 -1.26099e-05
+-0.0241861 0.0351713 0.0521271
+-0.0864494 0.107673 0.0113573
+0.00554907 0.0341243 -0.0169616
+-0.0740319 0.152138 0.0351116
+-0.00773495 0.12664 -0.00628182
+-0.0408221 0.0343419 0.0301151
+0.0589083 0.0700926 0.0167877
+-0.0321537 0.168198 -0.0161712
+-0.0504087 0.0385253 -0.0116443
+-0.0719982 0.132651 0.0504199
+-0.0314938 0.0946271 0.0446065
+0.0415387 0.0610238 0.0295203
+0.0439094 0.0623682 -0.0025277
+-0.0745832 0.173457 -0.038075
+-0.0135013 0.163627 -0.011822
+0.00544999 0.097676 0.0507202
+-0.0233157 0.0695067 0.0475588
+0.0280693 0.112767 0.0337398
+0.0217645 0.057833 0.0471676
+-0.0875176 0.123015 0.0477063
+-0.0696847 0.0339658 -0.0022881
+-0.0251326 0.166747 -0.01768
+-0.0196064 0.177176 -0.0161969
+-0.0704588 0.109521 0.0380634
+-0.068398 0.171087 -0.0357069
+0.0111209 0.0908234 -0.0303895
+-0.0634854 0.149796 0.0371525
+0.00199826 0.122137 -0.0115071
+-0.0620402 0.161574 -0.0285866
+0.0543448 0.0567886 0.0274783
+0.00150309 0.0619973 0.0566118
+-0.0476286 0.0532889 -0.00972253
+0.0589424 0.064749 0.0219118
+0.00619535 0.0866083 -0.0331365
+0.00933928 0.0947261 -0.0283032
+0.0354634 0.113562 0.00993821
+-0.0622597 0.0337543 0.0119702
+-0.0286126 0.0778208 0.0441079
+-0.0291848 0.0649007 -0.0284708
+0.00716146 0.130043 0.000903466
+0.00854238 0.122369 -0.0118647
+0.0207709 0.0422154 0.0420468
+-0.0728566 0.114991 -0.00711315
+-0.062327 0.161572 -0.0265871
+-0.029645 0.121258 -0.00823608
+-0.0358448 0.0971832 -0.0228124
+-0.0241278 0.166765 -0.0179136
+-0.0833762 0.111067 0.0302504
+-0.0714085 0.0715566 0.0335759
+-0.0285052 0.11799 0.0309781
+-0.0436341 0.171062 -0.00299049
+-0.0254563 0.120601 0.0288472
+0.029856 0.0552774 -0.0168073
+-0.0277474 0.076815 -0.0357774
+-0.0305568 0.0845973 0.042796
+-0.0927119 0.117479 0.0363033
+0.00128405 0.131584 0.0158806
+-0.0853072 0.129862 0.0494994
+-0.0379579 0.11044 -0.0188969
+-0.0647113 0.0736859 -0.0158833
+-0.055064 0.0698751 0.038539
+-0.049499 0.0747526 0.0426395
+-0.0315694 0.0461612 0.0465874
+-0.0452548 0.169651 -0.00135352
+-0.0891941 0.0888738 0.0164555
+-0.0424866 0.0396651 0.043393
+-0.0870945 0.0846532 0.00548002
+-0.0530436 0.142764 -0.000526483
+-0.0664988 0.146992 0.0401715
+-0.0606301 0.0613516 -0.00265703
+-0.0321846 0.121876 0.025771
+0.0462743 0.0806463 0.0131736
+0.0355309 0.0527205 0.03199
+-0.0515418 0.0389441 -0.0114685
+0.0203586 0.0565379 -0.0271575
+-0.065976 0.0624665 0.0232686
+-0.0399438 0.0336374 -0.0217314
+-0.0584862 0.0833066 0.0438144
+-0.0449507 0.157934 0.00683281
+-0.0161733 0.168253 -0.0210405
+-0.0807961 0.0747709 0.0205502
+-0.0450711 0.153185 -0.00674331
+0.0122509 0.0766796 0.0546284
+-0.0165839 0.159908 -0.00982549
+-0.000693426 0.0367942 0.0054988
+-0.051438 0.0643214 0.0343604
+0.0173166 0.0411975 -0.0216758
+-0.0350925 0.0344983 0.0186791
+-0.0263041 0.10845 -0.0208491
+-0.0233997 0.0384863 0.0301002
+0.0336304 0.116029 0.0121428
+-0.084184 0.106292 0.0253661
+-0.0668605 0.102389 -0.0157781
+-0.0617744 0.0585089 0.0133805
+-0.037501 0.0634549 0.0414009
+0.0430852 0.0973049 0.0211625
+-0.0895621 0.0902365 0.017449
+0.0358939 0.0591552 0.0359628
+0.00041272 0.0994106 0.0497851
+0.0297429 0.112241 -0.00897067
+-0.0614607 0.155749 0.0232098
+-0.0190678 0.0347878 0.0501361
+0.0278403 0.121636 0.00711658
+-0.0293538 0.0475081 0.0471486
+-0.0878748 0.0861246 0.0134664
+-0.065267 0.132559 0.042478
+-0.0557536 0.0782586 -0.0197587
+0.0163546 0.0537375 -0.0279072
+-0.0768389 0.102007 -0.0101454
+-0.0762457 0.0708701 0.0261488
+-0.0434929 0.0410777 0.0433607
+-0.0820951 0.100566 -0.0055776
+-0.0124865 0.114128 0.0400495
+0.0495003 0.0496818 0.0274333
+0.0157351 0.0562704 0.0489701
+-0.0269138 0.0660937 -0.0314934
+-0.0205217 0.0448565 0.0528623
+-0.0147659 0.0742889 -0.0388052
+0.0292558 0.120076 0.0204837
+-0.0416192 0.0505822 -0.0110011
+0.00560187 0.0957087 -0.0293479
+-0.00449169 0.0575673 0.0538908
+0.0302324 0.0374168 2.32521e-05
+0.0404422 0.105635 0.0151656
+-0.0407521 0.0782965 -0.0192261
+-0.0321404 0.106348 -0.0206098
+0.0240312 0.1242 0.0213823
+0.0163901 0.0476981 -0.0240512
+-0.0540847 0.0341953 0.0274512
+0.0565883 0.0716209 0.0188851
+-0.063971 0.0343652 0.0164556
+0.0222263 0.0790988 -0.0263649
+-0.0480529 0.15019 -0.0042011
+-0.0364615 0.155102 -0.00949574
+-0.0107913 0.165034 -0.0192459
+-0.0720629 0.166594 -0.0198059
+0.0596228 0.0581166 0.00817617
+0.0193916 0.12656 0.0211758
+-0.029103 0.162278 -0.0149633
+-0.0114929 0.118282 0.0379089
+-0.0766495 0.0810868 -0.0106019
+-0.00184307 0.128669 -0.00252946
+-0.0100488 0.177211 -0.0257537
+-0.0544738 0.0624824 0.0299832
+-0.0840733 0.0966087 -0.0036103
+-0.0707265 0.080778 -0.0161096
+-0.0214771 0.122102 0.0291424
+-0.0428932 0.0358165 0.00869673
+0.0135568 0.129672 0.01894
+-0.00280854 0.081222 -0.0368531
+0.00517895 0.130408 0.0230466
+-0.067269 0.167119 -0.0252721
+-0.00747948 0.0919417 -0.035549
+-0.0365036 0.0478079 0.0395886
+-0.0569665 0.0548885 0.00161507
+-0.0744851 0.0663284 0.00571192
+0.0455621 0.0889987 0.00417598
+-0.0292503 0.036802 0.0530596
+-0.0435044 0.0605182 0.0400424
+-0.0915766 0.14196 0.0161629
+-0.0696706 0.14899 -0.0379959
+-0.0770107 0.152809 -0.00688788
+-0.0705529 0.0628294 0.0184736
+-0.044794 0.0870021 -0.0219374
+-0.0107414 0.120001 -0.0131465
+-0.000720709 0.0669492 -0.0343521
+-0.0214315 0.0906458 0.0534872
+-0.0354995 0.0619703 0.0405316
+-0.0628269 0.1502 -0.00476792
+-0.0640626 0.136748 0.0389546
+-0.0474986 0.102884 0.0412273
+-0.0116527 0.129557 0.00826831
+-0.0347732 0.0337732 -0.0208295
+-0.0214023 0.161048 -0.0139992
+-0.0752954 0.15636 -0.00353298
+-0.0688076 0.150274 -0.0424283
+-0.0238582 0.0382811 0.0283891
+-0.0935937 0.118737 0.0143019
+0.0184606 0.0475775 0.0422564
+0.00850874 0.0575011 0.0529664
+-0.0532082 0.149319 0.0233918
+-0.0320154 0.082069 -0.0305372
+-0.0190294 0.0739916 0.05444
+-0.00216392 0.0992947 0.0503069
+-0.0162644 0.11453 -0.017303
+0.0278981 0.113772 -0.00862034
+0.0459848 0.0602104 -0.00435135
+-0.0564936 0.0465915 0.0420515
+0.0169002 0.103075 -0.0211457
+-0.00731691 0.128182 0.0272242
+0.0205916 0.112587 0.0371117
+-0.0176105 0.0435992 -0.0276633
+-0.0274971 0.0619365 -0.0294418
+0.000272434 0.109746 -0.0202486
+0.0416377 0.084481 -0.00877138
+-0.0784224 0.0725404 0.0242536
+-0.00880164 0.0826803 -0.0379328
+-0.0147316 0.0685868 -0.0380387
+0.0333786 0.0476367 -0.00619535
+0.00348805 0.0413645 0.0460201
+-0.0227229 0.0625945 -0.0340193
+-0.0669932 0.138471 -0.00790807
+-0.037224 0.169679 -0.0130647
+0.0535575 0.0477942 0.0072134
+-0.0575878 0.158069 0.0020235
+0.0345395 0.0727588 0.0393885
+-0.0699466 0.072981 0.0361776
+0.020686 0.0367224 0.0371237
+-0.0728722 0.0355547 0.00103582
+0.00487825 0.131703 0.0129125
+0.0580945 0.0523756 0.014183
+-0.0866528 0.145956 0.0348405
+-0.00749813 0.125151 0.0317009
+0.0403042 0.0398794 0.0201445
+0.0355341 0.0875716 0.0391778
+-0.0249398 0.157384 -0.00964166
+0.00350274 0.0489558 0.0513808
+-0.00381736 0.131135 0.0125816
+-0.00837752 0.0353543 0.048476
+0.0140849 0.129676 0.00773008
+-0.010101 0.102023 -0.0240718
+0.0446756 0.091763 0.0191604
+-0.0637279 0.173384 -0.0513558
+-0.031495 0.061765 0.0382603
+0.0366571 0.0968397 -0.0108144
+-0.0285085 0.115306 0.0336868
+-0.00497421 0.126254 0.0309961
+0.00248615 0.104372 0.0430232
+0.00642086 0.116423 -0.0174422
+-0.0636795 0.0658475 -0.00727738
+-0.0891519 0.0956005 0.0104313
+-0.0860649 0.0994533 0.00140442
+-0.0735831 0.152654 -0.0328925
+0.00651157 0.066084 0.0555109
+0.0344822 0.102017 -0.0120204
+-0.0637552 0.15245 -0.00517189
+-0.077532 0.159745 -0.0169143
+0.00251128 0.0661582 0.0562906
+0.0151093 0.0887421 0.0518346
+-0.00945842 0.0387253 -0.00172767
+-0.0471724 0.133935 0.00981498
+-0.0188178 0.158773 -0.00942574
+-0.0194961 0.0654004 0.0509321
+-0.0774489 0.163906 -0.0229523
+-0.0267283 0.156621 -0.00899742
+-0.0465008 0.111213 0.0371008
+-0.00249784 0.0939038 0.0553992
+-0.0715513 0.0342218 0.00249626
+0.0107439 0.130936 0.0122066
+0.0266603 0.0421651 0.0343135
+0.011996 0.0344545 0.00276628
+-0.0653727 0.074532 0.0393295
+-0.0417745 0.172541 -0.00446528
+-0.0368752 0.0345479 0.0395694
+0.00440907 0.131695 0.0141669
+0.0189748 0.0699869 0.0502663
+-0.0690298 0.155601 0.00744971
+-0.0265663 0.0356908 0.0529027
+-0.0621593 0.13389 0.0382274
+-0.0375341 0.0356789 0.0117182
+-0.00861273 0.0434199 -0.0261503
+0.0317849 0.0490447 0.0333888
+-0.0637123 0.0445754 0.0336875
+0.0376665 0.0374378 0.0089364
+-0.058497 0.0904388 0.0452323
+-0.0442728 0.0437529 -0.0143172
+0.0204519 0.0357096 0.00704168
+0.0282191 0.0941913 -0.0197138
+-0.0688839 0.117973 -0.00851105
+0.0338372 0.104851 -0.0110391
+0.024912 0.0505255 0.0392969
+0.0125119 0.107097 0.0421465
+-0.00117532 0.0998676 -0.0237773
+0.0246952 0.0420222 0.0382704
+-0.0398433 0.0971287 -0.022179
+0.0268619 0.108823 -0.0133055
+-0.0799271 0.140795 0.0466609
+0.0180138 0.0808533 0.0524986
+-0.0868879 0.111328 0.0363925
+0.000567537 0.0921561 -0.0336854
+-0.0892038 0.0969467 0.00941895
+0.00816432 0.0904541 -0.0318561
+-0.064746 0.155508 0.00899366
+-0.0911853 0.113324 0.0173235
+-0.00120622 0.113981 -0.0187843
+-0.00924245 0.0407867 0.049553
+-0.00349897 0.0575855 0.053786
+-0.0375091 0.0407357 0.0441865
+-0.0584982 0.108398 0.0387966
+0.0391307 0.0786589 -0.0107679
+-0.0474967 0.100136 0.0424923
+0.0275962 0.102142 0.0400686
+0.0233313 0.0578274 -0.025582
+-0.0510235 0.0723937 0.0407728
+0.0280639 0.121158 0.0057742
+-0.0318235 0.0637622 -0.0194381
+-0.038893 0.0378836 0.042947
+-0.0455156 0.14919 0.00769333
+-0.0724664 0.0678961 0.0260135
+-0.0614699 0.156861 -0.0255852
+0.0511802 0.0687267 0.0256724
+-0.0639329 0.153712 -0.0368711
+-0.055548 0.0628794 0.0303893
+0.0228246 0.0344564 0.00866393
+0.0333583 0.0505553 -0.00686804
+-0.0436286 0.0534388 -0.0110764
+0.0170321 0.128388 0.0173658
+-0.0484634 0.122511 0.0297787
+-0.0908772 0.119982 0.00630567
+-0.0251882 0.121015 0.0283088
+-0.0621056 0.167818 -0.0515918
+-0.0434918 0.0451945 0.0416496
+-0.0261859 0.172679 -0.0191085
+0.0581533 0.0685799 0.00535861
+-0.0308235 0.12443 -0.00028071
+-0.088653 0.0982606 0.00741366
+0.000114549 0.110154 -0.0201623
+0.032895 0.11463 -0.00105927
+0.0393368 0.0984458 -0.00682083
+0.0171551 0.0988258 -0.0226279
+0.0605804 0.0651016 0.017176
+-0.0528261 0.149337 0.0214103
+-0.0213292 0.159914 -0.0125433
+0.000685965 0.124734 0.0330095
+0.0425127 0.0872289 0.028142
+-0.0754377 0.172239 -0.0469918
+-0.00949675 0.039136 0.0341772
+-0.0750736 0.0773173 0.0349007
+-0.0204972 0.104391 0.0429524
+0.044682 0.0804275 0.0241291
+0.0288766 0.0477511 0.0362254
+-0.0590849 0.0584397 0.0175987
+-0.0187468 0.0685918 -0.0381091
+-0.0908268 0.137853 0.0181986
+-0.0934137 0.128236 0.0152484
+-0.0722094 0.155629 0.00630789
+-0.0701241 0.109501 0.0382316
+-0.0833629 0.0829469 -0.00357326
+-0.0219158 0.177176 -0.0142605
+-0.0038834 0.0389548 -0.00453366
+-0.0468309 0.0956366 -0.0220125
+0.0589161 0.0621713 0.00415053
+-0.0518659 0.144686 0.0163701
+-0.0589723 0.0448133 0.0132235
+0.05973 0.0664208 0.00812497
+-0.0911185 0.128332 0.0402364
+0.0082766 0.0667723 -0.0317926
+-0.0557755 0.0826404 -0.0214196
+-0.0254275 0.181837 -0.00892324
+-0.0899879 0.140645 0.0281829
+-0.0725199 0.141421 0.0466976
+0.0173961 0.0343459 0.000212982
+-0.0435004 0.0424369 0.0431009
+-0.0397849 0.155107 0.00553982
+0.0474231 0.0702463 0.00356979
+0.00935197 0.130836 0.00599246
+-0.0466333 0.0562665 -0.0109539
+-0.0134154 0.0393527 0.0385623
+0.0202221 0.0721388 -0.0279345
+-0.0855696 0.139064 0.00222203
+-0.0690425 0.0382325 0.0107396
+-0.0147406 0.129011 0.0158201
+-0.0436768 0.0636379 -0.0137577
+0.058107 0.0694858 0.00643586
+-0.0523916 0.160438 -0.00307609
+-0.0208502 0.120881 -0.00994613
+-0.0144972 0.0772805 0.0565653
+0.0146633 0.0548535 0.0491553
+-0.0872189 0.103599 0.00739967
+-0.013497 0.0701643 0.0543951
+-0.0727808 0.161025 -0.0379399
+0.0541744 0.0495318 0.0218692
+-0.0180637 0.122407 0.0308158
+-0.0437406 0.150663 0.00676805
+-0.0471693 0.128157 0.0265222
+0.000324051 0.0583269 -0.0327186
+0.0183373 0.109817 -0.016338
+-0.0826495 0.137607 -0.000712655
+0.0256839 0.122773 0.00490001
+0.0354824 0.111268 -0.000157004
+-0.0457208 0.0643263 0.038969
+0.0547017 0.0700348 0.00381661
+-0.00761606 0.128811 0.0256727
+-0.0687402 0.156349 0.0177202
+-0.085121 0.108927 0.00536277
+-0.0739548 0.136937 -0.00691386
+-0.00649589 0.0884166 0.05709
+-0.068322 0.144999 -0.0199128
+-0.0891584 0.142048 0.0331685
+-0.0282821 0.0889315 -0.0326167
+-0.0270715 0.0381475 0.00619785
+0.0226739 0.0430625 -0.011732
+-0.0895091 0.147137 0.0278175
+-0.0396286 0.0534411 -0.011004
+-0.0570587 0.0521462 0.00466373
+-0.0421407 0.162162 -0.0108328
+-0.0831356 0.0816494 -0.00150376
+-0.0274399 0.180304 -0.00715734
+-0.055838 0.0927189 -0.0219026
+-0.0624754 0.163097 -0.0475912
+-0.064973 0.0365283 0.0405192
+-0.0434783 0.0690982 0.041489
+0.0407433 0.102836 0.021176
+-0.0588838 0.0468495 0.0306747
+0.00493781 0.100395 -0.0223096
+0.00122691 0.116615 -0.0176232
+-0.035551 0.0451135 -0.0264751
+-0.025842 0.091626 -0.0326108
+0.0509675 0.0463703 0.0218015
+-0.077144 0.164539 -0.0230622
+-0.0613807 0.122656 0.0428396
+0.0364941 0.0454217 0.0304675
+-0.0655017 0.0931357 0.0435076
+-0.0869021 0.114398 0.00327085
+-0.0624965 0.109755 0.0377659
+-0.0219613 0.124807 -0.00195706
+-0.0564977 0.109762 0.0379025
+-0.0489044 0.0413839 -0.0112514
+-0.0464999 0.104301 0.0412272
+-0.0689362 0.173831 -0.0430963
+-0.0274521 0.175685 -0.00821886
+-0.00850113 0.0633575 0.0560799
+-0.0350673 0.0752529 -0.020583
+-0.0702674 0.128451 0.0511564
+-0.0318141 0.156607 0.00124178
+0.0187844 0.127527 0.00803838
+-0.0133229 0.0978873 -0.0277326
+0.00349851 0.0356817 -6.66678e-05
+-0.0714787 0.0630924 0.012741
+-0.0723877 0.16801 -0.0460141
+-0.0314985 0.12639 0.0112101
+0.0103131 0.0935662 -0.0290602
+0.0162881 0.0708862 -0.0299631
+-0.0486922 0.0693814 -0.0146213
+-0.00965082 0.0496857 -0.0310806
+-0.0472721 0.035073 0.043832
+-0.0505797 0.0528906 0.0145102
+-0.00843296 0.037899 -0.0156923
+-0.0276376 0.0383723 -0.00322479
+-0.0394609 0.174124 -0.00699657
+-0.0444987 0.125316 -0.00848377
+0.0413134 0.0732089 -0.00778125
+-0.0654437 0.17819 -0.0606312
+-0.0194942 0.0498847 0.046612
+-0.0470957 0.0376632 0.0453493
+-0.0435029 0.0832144 0.0426759
+-0.0134871 0.123689 0.0319378
+-0.0174978 0.0744121 0.0553624
+0.0333782 0.11597 0.0192002
+-0.0203318 0.0946383 0.0508766
+-0.0412055 0.0419705 -0.0232873
+-0.0815038 0.0885533 0.0328994
+-0.0703591 0.0620888 0.0120183
+-0.0334658 0.0396217 0.0500837
+-0.036771 0.0343273 0.0309808
+-0.0165061 0.126041 -0.00139683
+0.0369819 0.102039 0.0307859
+-0.0207502 0.0626823 -0.0352205
+0.0061481 0.104478 -0.0212191
+0.0323926 0.117262 0.0173907
+-0.0357746 0.08137 -0.0222094
+-0.0375579 0.0341991 0.0273875
+-0.0503289 0.0543622 0.0156654
+-0.0287388 0.076371 0.0428795
+-0.0631791 0.0597373 0.0065938
+-0.00649181 0.104468 0.0439265
+0.00653601 0.0924318 -0.0319265
+-0.0371937 0.168177 -0.0134205
+-0.0375614 0.128197 0.00751871
+-0.0898903 0.135179 0.0352087
+0.037196 0.0699864 0.036159
+0.0276189 0.0564968 -0.0197599
+0.0447325 0.0931835 0.0161662
+0.0398803 0.0927067 0.0314285
+-0.0468272 0.125328 0.0268353
+-0.0715318 0.0347543 -0.000134182
+-0.0859938 0.0978404 0.0272064
+-0.0460065 0.0410789 -0.0142843
+-0.0499829 0.0586014 0.0334591
+-0.0614235 0.172219 -0.0618413
+0.00350193 0.0474397 0.0500395
+0.0226438 0.0875613 0.0487078
+0.0374992 0.0644481 -0.0117672
+-0.00648083 0.111994 -0.0206545
+-0.0934649 0.120072 0.0123034
+0.00542168 0.12935 -0.00135496
+-0.0765071 0.126009 0.0528667
+-0.0308338 0.109919 -0.0183719
+0.018594 0.125548 0.0250901
+-0.0205082 0.0474421 0.0508554
+-0.0252811 0.168282 -0.0104061
+-0.051716 0.150726 0.0145842
+-0.0317716 0.0863018 -0.027557
+-0.0793223 0.151473 0.000118749
+-0.0823192 0.154091 0.0115231
+0.0432611 0.071972 -0.00279979
+-0.0761461 0.154973 -0.00265921
+-0.032878 0.156591 -0.0107994
+0.0360211 0.0628935 -0.0127986
+-0.0321679 0.120788 0.027294
+-0.00521106 0.038426 0.0176436
+0.0377365 0.0388851 0.0205214
+0.0183131 0.127887 0.0164149
+-0.0580398 0.0608775 0.0245548
+-0.0791963 0.108632 0.0349508
+-0.00201716 0.131125 0.0175388
+0.0407504 0.0633497 -0.00473671
+0.0447287 0.0917385 0.00119217
+-0.0534928 0.0848236 0.0453456
+0.00605741 0.0346665 0.039556
+-0.0276244 0.0436594 -0.0289391
+-0.00868086 0.056987 -0.0336771
+-0.058573 0.0613666 -0.00334192
+0.00741372 0.0360842 -0.0231635
+0.00514996 0.0337963 0.0112147
+-0.064123 0.113942 -0.0123233
+0.0527625 0.0723674 0.0204268
+-0.0354974 0.0634085 0.0409173
+0.0287147 0.0352518 0.00538775
+-0.0522813 0.0461425 0.0206748
+0.0547864 0.0548406 0.00018303
+0.00557978 0.101599 0.0456072
+0.00472897 0.0950887 -0.030676
+0.0355131 0.0781566 0.0390786
+0.0402454 0.0843611 -0.0117637
+-0.0605819 0.0468615 0.000669297
+-0.0394923 0.074754 0.042367
+-0.0331798 0.0779303 -0.0275261
+-0.0683095 0.178205 -0.0587107
+-0.00995429 0.0389301 0.0324647
+-0.0495001 0.108413 0.0388185
+-0.0659124 0.113781 -0.0114133
+-0.0404538 0.105662 0.0393313
+-0.0654729 0.17978 -0.0563035
+-0.0614888 0.0918402 0.045217
+0.0333657 0.0640658 -0.0168115
+-0.0809488 0.144539 -0.000825536
+-0.0545043 0.0918174 0.0448821
+-0.0504943 0.147794 0.0128405
+-0.0745085 0.118967 0.0529255
+-0.0596424 0.0629313 -0.00554826
+0.0600133 0.0636587 0.00714888
+0.0272456 0.0746657 -0.023693
+0.0433693 0.0575272 -0.00543691
+-0.0084928 0.0591086 0.0550857
+0.0327041 0.0686805 0.0402125
+-0.0371896 0.166685 -0.0135589
+0.0115191 0.107071 0.0419973
+0.0398757 0.096658 0.0297176
+-0.0882102 0.118977 0.047099
+-0.0794917 0.134473 0.0511764
+-0.0147562 0.0388704 -0.0103641
+-0.0729608 0.135493 -0.0074448
+-0.0829718 0.144576 0.00217748
+0.0121355 0.107265 -0.0192728
+0.00249537 0.0427747 0.0458993
+-0.0590743 0.136941 -0.00615344
+-0.0740187 0.0822617 -0.01463
+0.0274881 0.0349726 0.0165028
+0.0249311 0.118938 0.0303034
+-0.0860712 0.137702 0.0022107
+-0.00546373 0.0337972 -0.022595
+-0.0425018 0.0506116 0.0394181
+0.0044907 0.119648 0.0370088
+-0.066886 0.129814 0.0472408
+-0.033949 0.0667384 -0.0165589
+0.0265464 0.0699406 0.043619
+-0.0486667 0.134012 0.00340208
+0.0201914 0.117982 0.0346477
+-0.033458 0.0353739 -0.0310204
+-0.0251991 0.0536651 0.0400375
+-0.0689113 0.147966 -0.0319204
+-0.0650665 0.151369 -0.0356223
+-0.065894 0.118002 -0.00906639
+-0.00150449 0.0350731 0.0394353
+0.00648653 0.0951017 0.0524749
+0.0322641 0.11194 -0.00663069
+0.0356067 0.113152 0.00567562
+-0.0317604 0.120314 -0.00921321
+-0.0666072 0.0846933 0.0437683
+-0.0745085 0.13306 0.0516401
+-0.0914301 0.133749 0.0202171
+-0.0271327 0.0917299 -0.030613
+0.0356733 0.107346 0.028881
+0.021724 0.104691 0.0421173
+-0.0214953 0.0474568 0.0509792
+0.0189666 0.119003 -0.0102495
+0.0330783 0.0534528 0.0353209
+-0.0796959 0.154266 0.00805358
+-0.0370933 0.175555 -0.00565624
+-0.0324183 0.116998 -0.0137964
+-0.015069 0.117815 -0.0147928
+-0.0541455 0.0482522 0.0392578
+-0.017538 0.18639 -0.0186026
+-0.0486882 0.138613 0.0123943
+-0.0134995 0.0786948 0.0569449
+-0.0792474 0.0803083 0.033239
+-0.0523607 0.12647 -0.00557636
+-0.0261456 0.180134 -0.00803266
+-0.0654933 0.0875673 0.0446215
+0.0410795 0.0647663 -0.00478377
+0.038759 0.104954 -0.0010414
+0.0213206 0.103387 0.0432887
+0.00249002 0.112797 0.0416669
+-0.02662 0.157614 -0.0107103
+-0.0524373 0.0487028 0.0136696
+0.0367672 0.0605146 0.0354804
+-0.0769184 0.0832691 0.0369336
+-0.0650248 0.0337055 0.00787315
+-0.0515046 0.159378 0.00834015
+-0.0547588 0.079768 -0.0207581
+-0.0799475 0.0796892 0.0318714
+-0.0819371 0.129486 -0.00455242
+0.0162371 0.0359566 0.0423025
+-0.052497 0.108432 0.038849
+-0.0330169 0.0750953 -0.0275046
+-0.0367909 0.0856326 -0.0224706
+-0.0909792 0.143017 0.0266346
+-0.0790213 0.169435 -0.0369802
+-0.0224887 0.120777 0.0306794
+-0.0714154 0.063966 0.00470687
+-0.0833338 0.121705 0.0492392
+-0.00224884 0.0410819 0.0473849
+-0.0064961 0.0647536 0.0562043
+-0.0154675 0.0382885 0.0102401
+0.0316901 0.0754766 0.0423249
+-0.0682663 0.0409329 0.00988698
+-0.0397472 0.0753921 -0.0181662
+-0.0404974 0.0534278 0.0394751
+-0.027235 0.0964545 -0.0242996
+0.01346 0.094917 0.0501359
+-0.0101655 0.178729 -0.0267529
+-0.0368558 0.0971787 -0.022608
+-0.0618627 0.061311 0.023361
+-0.00785703 0.0384956 0.0242725
+-0.00828946 0.0422134 0.0491908
+-0.0626761 0.177191 -0.057627
+-0.0197826 0.0770974 -0.0390157
+-0.0283747 0.0368322 -0.0186629
+-0.0678325 0.165206 -0.0549947
+-0.0762767 0.179149 -0.050884
+-0.0126939 0.0585083 -0.0350263
+0.0259904 0.108758 0.0377477
+0.042201 0.0819186 0.0294354
+0.0164623 0.11028 -0.0168584
+-0.000216315 0.0411702 0.046762
+-0.0166283 0.0393036 -0.0275139
+-0.0660426 0.171124 -0.0420386
+0.0456785 0.0862046 0.0141695
+0.00138117 0.044939 -0.0263139
+0.0461205 0.0704224 0.0223322
+-0.0776245 0.0703136 0.0210685
+-0.0756983 0.148597 -0.0138657
+-0.00849865 0.0773628 0.0576515
+-0.0145231 0.0446315 0.0506096
+-0.0683418 0.0625091 0.0209713
+0.0172542 0.0764235 -0.0285503
+0.00803706 0.0343648 -0.0148062
+0.02126 0.0748992 -0.0268979
+-0.0630463 0.113863 0.0385547
+-0.0145507 0.0980154 0.0489953
+-0.0546077 0.131128 0.0350935
+-0.012492 0.061843 0.0546212
+-0.028497 0.0550003 -0.0233987
+0.0217846 0.11532 -0.0122874
+-0.0931885 0.121553 0.0392843
+-0.0522878 0.055669 0.0133058
+-0.0592645 0.138135 0.0336221
+-0.0895773 0.139272 0.0261794
+-0.0653179 0.156011 -0.0499494
+0.0382996 0.103126 -0.00513692
+-0.00322923 0.0355467 -0.0162422
+0.0141613 0.0988714 -0.0229756
+-0.0404979 0.0776396 0.043177
+-0.000517251 0.0386237 0.0468325
+-0.0745039 0.117561 0.0526615
+-0.0404908 0.101464 0.0408992
+0.00150976 0.0562224 0.0541662
+-0.0302058 0.0649962 -0.0264588
+-0.0427465 0.0393017 -0.0242897
+-0.0680504 0.12005 0.0525411
+0.0105239 0.101777 0.0472989
+-0.051788 0.0855011 -0.0215694
+0.0121427 0.124109 -0.00776299
+-0.0714952 0.123214 0.0534125
+-0.0377025 0.0444987 -0.0253388
+-0.0285008 0.0573948 0.0366096
+-0.0557355 0.0753549 -0.0185519
+-0.0136024 0.0377623 -0.0264268
+-0.055443 0.13396 0.033868
+-0.0329956 0.122915 -0.00595413
+-0.0659107 0.120913 -0.00886784
+-0.00952503 0.0920885 -0.0357277
+-0.0437604 0.036567 -0.0252782
+-0.020729 0.181491 -0.0220031
+0.00793492 0.130935 0.0197362
+-0.00287417 0.10736 -0.0221559
+-0.0531678 0.0503031 -0.00638771
+-0.0649059 0.116607 -0.0100071
+0.0311853 0.0491232 0.0343139
+-0.0464498 0.034849 -0.0185661
+-0.0448976 0.168579 0.00154181
+0.0324248 0.0752705 -0.0187807
+0.00488488 0.0387234 -0.0100497
+-0.0607447 0.0752603 -0.0176616
+-0.0575406 0.0387439 -0.00960491
+-0.0874426 0.110454 0.0173412
+-0.0517698 0.0516016 0.0312301
+-0.0727656 0.156832 -0.0339136
+0.0123073 0.0638424 -0.0304488
+-0.00866157 0.0541436 -0.0334268
+0.00183737 0.0373069 0.04638
+-0.0298138 0.0344903 0.0411187
+-0.0674167 0.149888 -0.0375972
+-0.0770317 0.088754 0.0382806
+-0.0857815 0.0897033 0.0272482
+-0.0125983 0.037741 -0.0261872
+0.0182378 0.0893522 -0.0266421
+-0.0766704 0.154203 -0.00290271
+-0.0684648 0.0617211 0.0180797
+0.0505111 0.0637895 0.0291551
+-0.0497918 0.143216 0.0113941
+-0.0616227 0.156855 -0.0295846
+0.0290304 0.0968725 0.0421292
+-0.0756542 0.0679921 0.00394259
+-0.0526765 0.0514226 0.0124143
+-0.0625972 0.0348156 0.0215996
+-0.0544966 0.0791235 0.0440855
+-0.0544133 0.159808 0.00694146
+2.76528e-05 0.0391548 -0.0114154
+-0.00549746 0.0503818 0.0516227
+-0.0646199 0.0359342 0.0410351
+0.0410489 0.0445052 0.0289111
+-0.0356376 0.0548341 -0.0105043
+0.0272051 0.0465425 -0.0127095
+-0.0513967 0.161204 -0.00381805
+-0.0424671 0.124776 0.022048
+-0.0300883 0.0335187 -0.027157
+-0.0362553 0.0336801 0.0101688
+0.0513156 0.0588831 -0.00408417
+0.0399488 0.0688733 -0.0097971
+-0.0617146 0.155302 -0.0255819
+-0.0112103 0.129394 0.0199977
+-0.0552256 0.153277 0.0254807
+-0.0697772 0.0409122 0.00855159
+-0.0257631 0.0755055 -0.0369491
+-0.0601959 0.0422699 -0.00706205
+-0.0475933 0.134581 0.0184866
+0.0267481 0.0659374 0.0438828
+-0.0790343 0.0886679 0.0360671
+0.0606094 0.0637127 0.00915317
+-0.0823359 0.140394 0.000222625
+-0.0792589 0.1445 -0.00280742
+0.0288607 0.118772 0.0260462
+-0.000258207 0.0388058 4.93079e-05
+0.0142249 0.0779815 -0.0305449
+0.0279207 0.111816 -0.0105079
+-0.0649061 0.108122 -0.0141961
+0.0372666 0.0547889 -0.00619261
+-0.0258342 0.159627 -0.000620301
+-0.0761165 0.0874143 0.0388159
+0.0425599 0.101502 0.0121632
+0.0533305 0.0723883 0.0073663
+-0.0814882 0.139397 0.0468344
+-0.0119496 0.127575 -0.00116297
+0.0308488 0.116432 0.0267923
+-0.0342458 0.127284 0.0102001
+0.0488271 0.0733963 0.0130056
+-0.017912 0.059765 0.0509406
+0.0133103 0.0753629 0.0544488
+-0.0896061 0.126751 0.00429509
+0.034401 0.0461473 -0.00601616
+-0.0485411 0.166778 0.000587101
+0.0342862 0.0782566 -0.0167489
+-0.00549615 0.0925657 0.0562617
+-0.0700277 0.153659 -0.0489787
+0.00562336 0.034628 0.021452
+-0.0825014 0.0978733 -0.00561152
+-0.0665019 0.0818141 0.0428543
+-0.0628077 0.166262 -0.0415912
+0.0329576 0.0753133 -0.0177979
+0.0159612 0.0887478 0.0513106
+-0.0348521 0.0972102 -0.0229902
+0.00689753 0.13043 0.00224143
+0.0163113 0.0637479 -0.0291811
+-0.0681449 0.144372 -0.0168262
+-0.0709402 0.170831 -0.0510269
+-0.0618586 0.161576 -0.034591
+-0.05709 0.0562779 0.00261705
+-0.0511762 0.163872 0.00329038
+-0.0295002 0.0688631 0.0391758
+-0.0548706 0.0634738 0.0317723
+0.00519565 0.0838361 -0.0338494
+0.0412244 0.0703917 -0.00779979
+-0.0485608 0.164 0.00493162
+0.0405319 0.0913292 0.030651
+-0.0364055 0.0394201 0.0459276
+-0.0885895 0.126718 0.00227148
+-0.00135158 0.0925397 -0.0341169
+-0.0155034 0.0472755 0.0490261
+-0.0533709 0.0334238 -0.0075905
+-0.0135602 0.174221 -0.0197865
+0.0151695 0.0534137 0.0481113
+0.00249824 0.119676 0.0375233
+-0.0574904 0.0847348 0.0442092
+-0.0706266 0.111419 0.0453421
+-0.0498404 0.122243 -0.0112035
+-0.0580787 0.133988 -0.00600022
+-0.0856455 0.0845341 0.000486997
+-0.0677324 0.0847093 0.0432514
+-0.0516192 0.112658 -0.0171697
+-0.0294883 0.101537 0.0426799
+-0.0562967 0.0548357 0.00668262
+-0.0870689 0.0968011 0.00243877
+-0.0809104 0.126584 -0.00546143
+0.0226682 0.115322 0.0347114
+-0.0702279 0.156078 0.0244771
+0.00613975 0.0976727 -0.0254362
+-0.0654107 0.0782591 0.0414837
+0.0154936 0.104462 0.0445958
+-0.0557216 0.125528 0.0387388
+-0.0708946 0.1037 -0.0131771
+0.0207514 0.10232 -0.0203322
+0.040798 0.105646 0.00916422
+-0.0789759 0.136856 -0.00458832
+0.00163159 0.126824 0.0304308
+0.0217692 0.0444645 -0.0177596
+0.00149843 0.0965502 0.0531993
+0.00416774 0.034456 0.0194982
+-0.022279 0.185099 -0.0171819
+-0.0144819 0.0759021 0.0565083
+-0.062395 0.163038 -0.0545883
+0.0386856 0.0757975 -0.0108084
+0.0230618 0.0389706 0.0372995
+-0.0661823 0.154393 0.00121795
+-0.0751879 0.179229 -0.0530087
+-0.000499764 0.0590718 0.0548831
+-0.0616117 0.16 -0.0305904
+-0.0254372 0.0796492 0.0521904
+-0.087722 0.128407 0.0462822
+-0.0361331 0.122312 0.027301
+-0.0259579 0.0383264 -0.00469023
+-0.0615278 0.0399873 -0.00779984
+-0.0911978 0.147452 0.0151543
+-0.0776353 0.15693 -0.0189052
+-0.048662 0.0345502 0.0387985
+0.00500615 0.0390969 0.0281732
+-0.0664605 0.152204 -0.0437352
+-0.0514963 0.157854 0.00954267
+-0.0893902 0.139278 0.0291842
+-0.092072 0.128303 0.0302461
+-0.0166194 0.0421642 -0.027592
+-0.0880283 0.128084 0.00127828
+-0.06275 0.178179 -0.0598124
+-0.0242491 0.0796961 0.0538111
+-0.0575802 0.14965 0.0326026
+-0.0598499 0.0364094 -0.00954648
+0.0260337 0.0639191 -0.0225668
+-0.0215138 0.185205 -0.0184453
+0.00733204 0.0567933 -0.0307054
+-0.0394107 0.125604 0.021627
+-0.0805747 0.154604 0.0238516
+0.0319556 0.0942571 0.0410831
+-0.0503335 0.0345244 0.0401985
+-0.0521615 0.159088 -0.00368491
+-0.0816591 0.0828436 -0.00556986
+0.0120628 0.0346214 0.0245844
+0.00946799 0.112678 0.0395888
+-0.00501719 0.0348021 0.0425449
+-0.080434 0.0763484 0.0258387
+0.0419394 0.0802864 -0.00678235
+-0.0270715 0.179993 -0.0160072
+-0.00929516 0.17029 -0.0258484
+0.028889 0.0549767 0.0398373
+-0.0324184 0.123701 0.0227019
+-0.00768132 0.0976452 -0.0294292
+-0.0534956 0.0478266 0.0400304
+-0.0637998 0.0852745 -0.0191701
+0.0175395 0.0364962 0.0420884
+0.0289699 0.100814 0.0402993
+-0.0384924 0.0478181 0.0398313
+-0.00649796 0.0457161 0.0472731
+0.00861625 0.13122 0.00857267
+-0.0424707 0.0634258 0.0409808
+-0.0147714 0.163994 -0.0109737
+0.0514504 0.0735674 0.0125302
+0.0157166 0.0461353 0.0435597
+-0.0886232 0.152074 0.0182297
+-0.0732612 0.155462 -0.02991
+0.0560042 0.0728404 0.0157211
+-0.0465551 0.0447198 -0.0107805
+-0.020486 0.18455 -0.0138786
+0.00948927 0.0976692 0.0490505
+0.0112322 0.0342419 -0.000927635
+0.0153695 0.0617406 0.0502582
+-0.0137598 0.0382596 0.0196658
+0.0302365 0.0828976 -0.0200496
+-0.00484087 0.0994589 -0.0252596
+-0.0335771 0.177292 -0.00581839
+-0.0706171 0.160991 -0.0459386
+-0.0381352 0.155099 0.00439417
+0.0262713 0.112733 0.0346521
+-0.0288992 0.0377652 0.0242203
+-0.0741081 0.174769 -0.0407073
+0.0312687 0.106096 -0.0123707
+-0.0467828 0.168244 0.000200438
+-0.0544952 0.0440117 0.0450302
+0.00623037 0.129867 0.000104943
+-0.043169 0.163647 -0.0101027
+-0.0034944 0.103046 0.0439357
+-0.0265042 0.106069 -0.02235
+-0.0577843 0.0811473 -0.0206854
+-0.0358177 0.0886369 -0.024178
+-0.0726405 0.148337 -0.0310398
+-0.0454975 0.111194 0.0370842
+-0.0671848 0.0335335 0.00220964
+-0.0117936 0.0667192 0.0544625
+-0.0609674 0.125285 -0.00834926
+-0.080841 0.0760714 -0.00147772
+-0.0522091 0.118697 -0.0134778
+-0.074349 0.162439 -0.0349528
+-0.0740415 0.112641 0.0489542
+-0.0294567 0.0847909 0.044594
+-0.0204364 0.038385 0.0254029
+-0.0497015 0.070866 -0.0150622
+-0.0525829 0.113848 -0.0164008
+-0.0415348 0.163761 0.00444738
+-0.0644934 0.106993 0.039043
+0.0437981 0.0734503 -0.00176783
+-0.0284962 0.0946634 0.0451029
+0.0309795 0.0506032 0.0357766
+-0.0395331 0.128532 0.0067941
+-0.0424235 0.12018 -0.013117
+-0.0197167 0.103079 -0.0233045
+-0.0430994 0.12944 0.0113807
+-0.0913339 0.117411 0.0283055
+0.026348 0.0463448 0.037827
+-0.0406738 0.0606904 -0.0121867
+-0.071511 0.0930107 0.0417462
+-0.0866623 0.0964635 0.0264805
+0.00386952 0.131337 0.0182591
+0.0282305 0.08443 -0.0217055
+0.0128412 0.0347905 0.0282102
+0.00434097 0.053874 -0.0300717
+-0.0754795 0.0704499 0.0266608
+-0.0699695 0.135529 -0.00821968
+-0.0305143 0.0348089 0.0211376
+0.00750189 0.118272 0.0376599
+-0.0504996 0.108397 0.0385655
+-0.0779682 0.135412 -0.00525448
+-0.0273965 0.0380183 0.0261038
+-0.0520915 0.129726 0.0334448
+-0.0221568 0.157426 -0.00647102
+-0.0562219 0.0560519 -0.00142054
+-0.0817829 0.110167 0.0313299
+-0.0502435 0.0335698 -0.00160666
+0.0331444 0.0584441 -0.0147212
+-0.00651273 0.0760152 0.058184
+-0.0285619 0.108073 -0.0204718
+-0.0157027 0.123907 0.0301351
+-0.0175006 0.10024 0.0438179
+-0.0297515 0.154263 -0.00514597
+-0.0475033 0.113884 0.0346438
+-0.0154952 0.087016 0.0568367
+0.0435889 0.0706095 -0.000776861
+-0.0930208 0.116049 0.0173125
+-0.0783399 0.174997 -0.0480125
+-0.0650728 0.117149 0.0481049
+0.0600369 0.0650499 0.00814341
+-0.0678832 0.147765 -0.0303891
+-0.0802136 0.0813857 -0.00655277
+-0.0356852 0.127701 0.00820492
+0.0154871 0.0990335 0.0473819
+-0.019377 0.127678 0.00978651
+-0.0208657 0.123339 0.0268408
+-0.0553906 0.073233 0.0409139
+0.0560337 0.0553031 0.0245952
+-0.0306612 0.0816984 0.0420491
+0.04335 0.0902653 0.0251673
+-0.0137008 0.0599733 -0.0359611
+-0.0535493 0.045819 -0.00734382
+0.0152704 0.07093 -0.0305648
+-0.0706849 0.0819434 0.0406373
+0.0104915 0.114065 0.0387753
+-0.052073 0.150157 -0.00315276
+0.00150908 0.0458287 0.0477014
+-0.00149907 0.122451 0.0357652
+0.0346578 0.114254 0.0196698
+-0.0263079 0.125672 0.00579971
+-0.0662371 0.173912 -0.0594768
+-0.0111949 0.178453 -0.0296295
+-0.039457 0.0403768 -0.0273046
+-0.0321606 0.153429 -0.00535973
+0.0505072 0.0678423 0.0265215
+0.0377143 0.106919 0.0261871
+-0.0717609 0.172825 -0.0369735
+-0.034656 0.0592094 -0.011649
+-0.0237103 0.0348634 0.0507821
+-0.0409865 0.0355803 0.00929737
+0.0240747 0.0915746 0.0472686
+-0.0576816 0.0336048 -0.0104516
+0.034582 0.0563647 0.0357928
+-0.0304985 0.0631621 0.0381216
+-0.0145978 0.0392398 -0.0269855
+-0.0446029 0.130656 0.0108143
+0.0240159 0.124704 0.0156714
+0.00222038 0.0796794 -0.0348837
+-0.029229 0.179986 -0.0130226
+-0.0371614 0.0338798 0.00980443
+-0.0654857 0.101487 0.0416824
+-0.0386286 0.0534191 -0.0107521
+-0.0743388 0.0659419 0.0131754
+-0.0775178 0.172972 -0.0399134
+-0.0704983 0.0999903 0.0403231
+-0.0754673 0.153642 0.0315487
+-0.0567915 0.158113 0.00751453
+-0.0733158 0.165215 -0.0409863
+-0.0878452 0.096803 0.00445868
+0.02849 0.120167 0.00308975
+-0.0866911 0.107697 0.0133542
+-0.0422556 0.127428 -0.00269381
+-0.0684868 0.135467 0.0467048
+-0.0187173 0.108826 -0.0212527
+-0.0109134 0.038586 0.0018115
+-0.0689089 0.106601 -0.012938
+0.00232768 0.0597693 -0.0328325
+-0.0759088 0.150426 0.0375079
+-0.0642836 0.175364 -0.0612207
+-0.0626162 0.142488 0.0376248
+-0.0388973 0.150052 -0.00339157
+0.0187974 0.0398349 -0.0187285
+0.0404333 0.0725805 0.0320798
+-0.0863763 0.0991625 0.0261078
+0.0544186 0.0725633 0.0195702
+-0.076294 0.155585 0.0106948
+-0.0611522 0.045903 0.0393286
+-0.0167746 0.0756989 -0.0389455
+-0.0578115 0.0619893 0.0271205
+-0.0127071 0.179586 -0.0289228
+-0.0568431 0.0926948 -0.0216401
+-0.0900812 0.150215 0.0221142
+0.0222403 0.0416489 -0.00972259
+-0.0504069 0.135839 0.0247969
+-0.0304966 0.0545819 0.0366047
+-0.0103146 0.180354 -0.0288775
+0.0320122 0.117952 0.0129635
+0.0440424 0.0496996 0.0318585
+0.0393181 0.0603877 -0.00577734
+-0.071953 0.16101 -0.0409434
+-0.0437665 0.168716 0.00196199
+-0.0498819 0.105595 -0.0195612
+0.0217639 0.0458254 -0.0188683
+-0.0921421 0.116123 0.0383102
+-0.0636791 0.157483 -0.0138656
+0.0266706 0.04428 -0.00700704
+0.0433132 0.0818321 0.0274518
+-0.0580456 0.0494852 0.00468232
+-0.0735836 0.159386 -0.00731186
+-0.0544231 0.0344532 0.039385
+-0.00150237 0.089761 0.0564112
+0.015933 0.126357 0.0269718
+-0.0425015 0.0719333 0.0422422
+-0.0589488 0.147198 -0.00200697
+-0.087209 0.0941073 0.00444199
+-0.0120214 0.178126 -0.0292101
+-0.0835465 0.101952 0.0288636
+0.041496 0.0555737 0.0320634
+-0.0025007 0.0675576 0.0566246
+-0.0756877 0.15767 -0.00739081
+-0.0105023 0.0829243 0.0578427
+-0.00627368 0.128136 0.0276028
+-0.0404708 0.109814 0.0374017
+-0.00378356 0.130498 0.0212315
+0.0580765 0.0566038 0.0222343
+-0.0853725 0.111782 0.0273822
+0.0428559 0.0972978 0.0221679
+0.00122739 0.121444 0.0362285
+-0.0274798 0.0446461 0.0507675
+-0.0304832 0.12104 0.0263992
+-0.0371379 0.127502 0.0150528
+-0.0778671 0.177131 -0.0494084
+-0.0775564 0.166657 -0.0379504
+-0.0605167 0.0386224 -0.00865968
+-0.0171147 0.161213 -0.00734926
+-0.0726687 0.161352 -0.00991102
+0.032766 0.0700345 0.0403232
+-0.0458559 0.10138 -0.0215412
+0.017353 0.0374009 0.0430484
+0.000357196 0.0347559 0.0401008
+-0.0604421 0.0427792 0.0246961
+-0.0440271 0.128143 0.0184429
+0.0423724 0.056151 -0.00596664
+0.00534844 0.0596161 -0.0309806
+0.0320447 0.061134 -0.0177676
+-0.00279591 0.0988433 -0.0266823
+0.0289846 0.0664902 -0.0199255
+0.000300027 0.0360761 0.019065
+-0.0250833 0.0379957 0.0175874
+0.0345167 0.0754586 -0.0157294
+0.0153241 0.0623295 -0.0291944
+-0.0609083 0.0612023 0.0236586
+-0.0698972 0.0655268 -0.00153079
+0.00337067 0.115645 -0.0185908
+-0.0315398 0.0589058 0.0377684
+-0.00748372 0.0488969 0.0502433
+-0.0877886 0.0861226 0.0174689
+0.0414464 0.101443 0.020163
+0.0252372 0.0926012 -0.0220221
+-0.0572172 0.0498044 0.00711465
+-0.0384957 0.0719179 0.0419735
+0.0143485 0.0552312 -0.0288146
+-0.0512659 0.0360808 0.0462964
+-0.0880011 0.0941555 0.00641769
+-0.0508873 0.109845 -0.0186279
+-0.0514991 0.112527 0.0359192
+-0.0338144 0.0342727 0.0263277
+-0.0615036 0.0804118 0.0430159
+-0.0663263 0.0606754 0.0176657
+-0.0909825 0.11607 0.0303184
+0.0184707 0.107054 0.0413783
+-0.0243398 0.183957 -0.0138554
+-0.0158705 0.161111 -0.00904539
+-0.0335094 0.0647262 0.0398847
+-0.0782927 0.098997 -0.00960155
+0.0486963 0.0730972 0.0159514
+-0.0478872 0.0335336 -0.00475407
+-0.0154917 0.0883884 0.056678
+-0.077344 0.119067 0.051823
+-0.0560293 0.0674866 0.0368481
+-0.0635813 0.138158 0.0379352
+-0.0217661 0.0670215 -0.0366181
+0.0483442 0.0575601 -0.00531363
+-0.0237817 0.0727523 -0.0377511
+0.0443603 0.0490341 -0.0052894
+-0.0604973 0.0904382 0.0452731
+-0.0627563 0.152415 -0.0301468
+-0.0714195 0.067071 -0.00151156
+-0.0861662 0.147397 0.00721409
+0.011631 0.0474937 0.0464252
+0.0254946 0.0406248 0.0343049
+0.035443 0.111045 0.0256623
+-0.000588677 0.037658 -0.0249499
+-0.0388448 0.0971399 -0.0223049
+-0.0660244 0.166553 -0.0262486
+-0.048499 0.0848032 0.0451307
+0.0371019 0.111384 0.0119604
+-0.00927598 0.177254 -0.0287785
+-0.0389846 0.1533 -0.00797514
+-0.0351198 0.0484277 -0.0173281
+-0.00353807 0.0389271 0.0301841
+0.0132013 0.0864568 -0.0307211
+-0.0390625 0.110364 -0.0188163
+0.033372 0.106071 0.0326127
+-0.0831505 0.0857608 0.0304017
+0.0552187 0.0635647 0.027041
+0.0399168 0.0999289 0.0271558
+-0.0579697 0.0339719 0.0233097
+-0.0137397 0.178677 -0.0217984
+-0.0203244 0.0385446 0.0306811
+0.00122549 0.0359125 0.00298025
+0.0117447 0.0343946 -0.0103375
+-0.0913959 0.132306 0.0102259
+-0.0429194 0.0898997 -0.0223492
+-0.0511515 0.0337361 -0.0129379
+-0.0750027 0.155319 0.00677634
+-0.0771027 0.0689891 0.00817725
+-0.0353224 0.0340121 0.0244595
+-0.0291276 0.0386567 -0.0130433
+0.0303577 0.105377 -0.0136057
+0.0235082 0.12516 0.0112114
+-0.00249775 0.0787967 0.0582683
+0.0533686 0.0732758 0.0102917
+-0.0586915 0.0472669 0.00864036
+0.0328626 0.0738919 -0.0178203
+-0.017795 0.038392 0.00241319
+-0.044502 0.0478297 0.0399289
+-0.0747378 0.0687745 0.000531905
+0.0172248 0.12732 0.0217261
+0.0428517 0.0885116 0.026874
+-0.078089 0.159705 -0.0229182
+-0.00858725 0.0362397 -0.025275
+-0.0867205 0.102198 0.00542391
+-0.0926774 0.131034 0.0232376
+0.0167938 0.128074 0.00445644
+0.0541315 0.0553714 0.0271399
+-0.000925431 0.131188 0.0179397
+0.0288719 0.121048 0.0132077
+-0.00849451 0.0965679 0.0534544
+0.0226575 0.102902 -0.0189538
+-0.0787984 0.113337 -0.0032043
+-0.0099585 0.1135 -0.0182227
+-0.0282274 0.162443 -0.0041123
+-0.082525 0.0896742 -0.00660526
+-0.0477053 0.0708612 -0.0154107
+-0.0435026 0.0465062 0.0407289
+0.00126756 0.0669175 -0.0339113
+-0.0341799 0.0335887 -0.0224091
+-0.0623664 0.0443972 0.0296888
+-0.0374964 0.0676867 0.0416821
+0.00859545 0.0382141 0.0296981
+0.0458872 0.0834155 0.0151706
+-0.0908205 0.132399 0.0292201
+-0.0191683 0.0336751 -0.0214022
+-0.0140554 0.126614 -0.00210251
+-0.0260065 0.0335246 -0.026366
+0.0324259 0.0399358 -0.00240332
+-0.0296544 0.0346993 -0.0301222
+-0.0669615 0.129698 -0.00899609
+-0.0471845 0.0383965 -0.0142868
+-0.0572808 0.0345537 0.0438127
+-0.0627957 0.153425 0.0330074
+-0.0515105 0.13416 -0.00180112
+-0.0434907 0.171345 -0.00503558
+-0.0677742 0.0808646 -0.0174732
+0.00350312 0.0441648 0.0458711
+0.0291321 0.0686302 0.0420784
+0.0132792 0.0343795 0.0214237
+-0.0866978 0.12169 0.0483599
+-0.00350013 0.0801522 0.057807
+0.0371657 0.0997172 -0.00981258
+-0.0447383 0.0738987 -0.0178782
+-0.0605228 0.155495 0.0235493
+-0.0362392 0.151744 -0.00510561
+0.0454797 0.0637982 0.0288243
+-0.0672083 0.0609402 0.0172424
+0.0241031 0.0782197 0.0489777
+0.0442629 0.0672699 0.000591455
+-0.0289948 0.0522303 -0.0223864
+-0.0645013 0.0774777 0.0413253
+0.0444938 0.0959562 0.00517859
+-0.00459579 0.039143 -0.025596
+0.0184671 0.0913654 0.0479185
+0.0146407 0.129582 0.00935921
+-0.0505573 0.0439128 0.0441317
+-0.0141262 0.119616 -0.0126879
+-0.0849191 0.117035 0.0482987
+0.0280536 0.119554 5.13011e-05
+-0.0247655 0.0712486 -0.0365856
+0.0034971 0.091096 0.055256
+-0.0641848 0.0432086 0.0316934
+-0.0881185 0.151555 0.0230923
+-0.0680885 0.16093 -0.05501
+0.0474345 0.0682488 0.00159582
+0.0111403 0.105858 -0.0199086
+-0.0369545 0.0349347 0.0427177
+-0.0604782 0.144516 -0.00363507
+-0.0394712 0.08608 0.0435352
+-0.0548214 0.143869 0.0295389
+-0.028506 0.107069 0.0398546
+0.0281659 0.121502 0.0158045
+-0.0797197 0.143117 -0.0027917
+-0.0616803 0.166235 -0.0555923
+-0.0204271 0.0893191 -0.0369723
+0.0361287 0.085855 -0.0169039
+-0.00251199 0.107268 0.0437857
+-0.0114962 0.0842854 0.0575311
+-0.0738001 0.0651206 0.00865838
+-0.0114808 0.0353662 -0.0177045
+0.0391473 0.0421646 0.0269754
+-0.0565891 0.129759 0.0374849
+-0.0720408 0.171996 -0.0342175
+-0.0139288 0.0883705 -0.0380287
+-0.0562656 0.0335637 0.0133743
+-0.0196985 0.0957936 -0.0295783
+-0.00486881 0.104509 -0.0228932
+-0.0550525 0.129598 -0.0055846
+-0.0584858 0.0776493 0.0431837
+-0.0898534 0.121302 0.00430136
+-0.0191218 0.165312 -0.0179178
+-0.0249563 0.0383168 0.00102848
+-0.0199274 0.0958752 0.0490354
+-0.0574825 0.113918 0.0359516
+-0.00850157 0.101663 0.0440465
+-0.0873724 0.124348 0.0475064
+0.00764213 0.03621 -0.0128239
+-0.0264494 0.0648769 0.0395324
+0.0541546 0.0547912 -0.000791322
+-0.0434926 0.0789866 0.0425224
+0.0241906 0.121901 0.0271611
+-0.0866809 0.0819772 0.0124969
+-0.0717212 0.0344863 0.00580157
+0.0302841 0.11623 -0.00325108
+-0.0737112 0.155478 -0.0269075
+-0.0424683 0.108486 0.0389261
+0.0176716 0.0658898 0.0500991
+0.0494857 0.064014 -0.00214923
+-0.0514961 0.0945888 0.044111
+0.0340749 0.0901032 -0.0173771
+-0.0719584 0.0942006 0.0415089
+-0.0544894 0.0594391 0.0238452
+-0.0877192 0.101 0.0223776
+-0.0758319 0.173116 -0.0385323
+-0.0114857 0.119632 0.0369891
+-0.0313874 0.0581183 -0.0163942
+-0.0157652 0.0728861 -0.0388826
+0.0167046 0.0945555 -0.0241181
+-0.000498244 0.0647983 0.0567029
+0.0256473 0.0420743 0.0363142
+-0.0630437 0.12273 0.0457647
+-0.0540131 0.144678 0.0264098
+0.0135054 0.10711 0.0421551
+-0.00428335 0.124198 -0.00969837
+0.0415325 0.0816649 -0.00777347
+-0.0392229 0.0337594 -0.0179786
+0.0593141 0.0691549 0.00914325
+-0.0219522 0.0382139 0.00717586
+0.0288925 0.112764 0.0331675
+-0.0524014 0.152599 0.0134601
+-0.0628726 0.147915 -0.0152353
+-0.030456 0.158107 0.0014598
+0.0308953 0.0400111 0.0272142
+-0.0757616 0.109947 0.0435791
+0.0253341 0.0591059 -0.0237971
+-0.0261555 0.155801 -0.00568703
+-0.0679463 0.128236 -0.00906158
+-0.0156387 0.0377596 -0.0169892
+-0.0757064 0.112028 0.0472849
+-0.0155135 0.0631057 0.0533345
+-0.0512066 0.125627 -0.00670494
+-0.0896222 0.111892 0.015334
+-0.0493777 0.160927 -0.00574679
+-0.0630274 0.166296 -0.040584
+0.058244 0.0580344 0.0225642
+0.0413547 0.102812 0.0011821
+-0.0162922 0.125122 0.0270033
+0.02338 0.0632213 0.0460213
+0.0609114 0.0623534 0.0131596
+-0.0691061 0.164802 -0.0173282
+-0.0870447 0.0977755 0.0254107
+-0.00849378 0.112803 0.0415796
+0.0145027 0.115416 0.0371643
+-0.0184257 0.066889 0.0526426
+-0.0448982 0.123992 0.0241166
+-0.050497 0.0903958 0.0446608
+-0.0315626 0.0348573 0.0456798
+-0.0684915 0.0902546 0.0428415
+-0.0180785 0.0337977 -0.021304
+0.0043349 0.0389929 -0.00853324
+-0.0830349 0.153941 0.0230111
+-0.0800798 0.103192 -0.0065999
+0.0437731 0.0973301 0.016155
+0.00944321 0.131132 0.0160037
+-0.0514165 0.0627417 0.0327301
+-0.0528926 0.154865 0.0118243
+0.0187407 0.0740964 0.0517477
+-0.0721682 0.0657282 0.00147121
+0.00959045 0.131031 0.00893055
+-0.0694847 0.181423 -0.0563964
+-0.0569551 0.11454 -0.0150747
+-0.0821005 0.0885236 0.0320901
+-0.0174725 0.0383553 0.00432532
+-0.00258809 0.0348892 -0.0237423
+0.0413648 0.0939401 0.0283252
+-0.00375638 0.13079 0.0183493
+-0.0686466 0.0719376 -0.0111307
+-0.0688202 0.180176 -0.0531787
+-0.0397209 0.0710215 -0.0169451
+0.0184831 0.105752 0.0426872
+0.00809551 0.112572 -0.0192987
+0.0206432 0.121117 -0.00652883
+-0.0718516 0.0979698 -0.0147575
+-0.0662716 0.170413 -0.0392349
+0.0237477 0.0605032 -0.0251433
+-0.0340875 0.177472 -0.00744261
+-0.0167857 0.0784752 -0.0385587
+-0.0565291 0.0373798 -0.0104777
+0.00297843 0.0341587 0.014086
+-0.0667756 0.124253 0.0509201
+-0.026364 0.0359692 -0.029405
+-0.0550408 0.0334649 -0.000671931
+-0.0697701 0.0874139 0.0423816
+0.0246944 0.0835826 0.0481083
+0.0199488 0.115322 0.0360728
+0.0383916 0.042968 -0.00337479
+-0.0365829 0.0335193 -0.0246869
+-0.0355007 0.112502 0.0349387
+-0.0689238 0.125301 -0.00884615
+0.0395927 0.0385536 0.0157178
+-0.0889313 0.0875027 0.0114635
+0.0448665 0.0945715 0.00517989
+-0.0477042 0.0664777 -0.0141832
+-0.0434727 0.125255 -0.0084227
+-0.0166904 0.169787 -0.0155577
+-0.0134983 0.0501789 0.0495792
+-0.0624968 0.0833205 0.0441176
+-0.0342132 0.0345231 0.0384015
+0.043295 0.084533 0.027498
+-0.0819819 0.112797 -0.000848269
+0.0121624 0.129948 0.0198557
+-0.0674677 0.10143 0.0408399
+-0.0626754 0.059895 0.0191264
+-0.0367892 0.0459324 0.0404864
+-0.027194 0.0764697 0.0455544
+-0.0824053 0.0748814 0.00852871
+-0.0656294 0.0642362 -0.0044412
+0.032725 0.116988 0.0160848
+-0.0764226 0.102162 0.0358668
+0.00148048 0.0952613 0.0542408
+0.0228866 0.122341 0.0280976
+-0.0584486 0.139576 0.0330542
+-0.0402835 0.123242 -0.0103332
+-0.012241 0.0406566 0.0504983
+-0.0489426 0.0614374 0.0351759
+-0.0844851 0.0778045 0.00951927
+-0.0369817 0.156591 0.00432745
+-0.0882804 0.103688 0.0163664
+-0.0258065 0.0825691 -0.0373737
+-0.0355052 0.102861 0.0407303
+-0.0524183 0.131115 0.0329855
+-0.0227031 0.175691 -0.0136597
+0.050697 0.0684106 0.00144017
+0.000504835 0.0911354 0.0558722
+0.00231832 0.0583343 -0.0324165
+-0.0148886 0.169807 -0.0164639
+-0.0722033 0.152534 -0.0417656
+-0.0134817 0.073078 0.0557755
+-0.0255231 0.109882 0.0391184
+-0.0655581 0.135384 0.0421104
+-0.024745 0.0698061 -0.0360534
+0.0559546 0.0524347 0.0227151
+-0.0283257 0.118773 -0.011655
+-0.0335185 0.0974234 0.0440535
+-0.0817699 0.0748179 0.0155353
+-0.027189 0.162441 -0.00437298
+-0.0267454 0.0711222 -0.0350441
+-0.03015 0.171175 -0.0170282
+-0.026605 0.06607 0.0397555
+-0.074698 0.179765 -0.0510072
+0.0143367 0.0504741 0.0468665
+-0.0594975 0.111137 0.0367915
+-0.0346758 0.127158 0.0144691
+-0.0465015 0.0847604 0.0446321
+0.00381747 0.0354686 0.0455691
+0.0172732 0.0792708 -0.0288683
+0.0323738 0.104756 0.0346971
+-0.0794458 0.0813481 -0.00752304
+-0.0312226 0.0367355 -0.0304453
+-0.0110616 0.168437 -0.0238044
+-0.0579369 0.119806 -0.0105246
+-0.0337394 0.0355643 0.0323212
+0.0312129 0.0525777 -0.012761
+-0.0346988 0.120729 -0.0096591
+-0.0388776 0.0364147 0.043017
+-0.0271127 0.16377 -0.0158754
+-0.0114338 0.0347606 0.0448027
+-0.0897559 0.114544 0.00631807
+0.0408171 0.04213 0.0255289
+-0.0648854 0.102482 -0.0170908
+-0.0137359 0.061178 0.0537969
+-0.00359581 0.130946 0.00835725
+0.0439346 0.0959403 0.0181595
+-0.0194977 0.104404 0.0429832
+-0.0691323 0.0776098 0.0394254
+-0.00248627 0.097432 -0.0292057
+0.00445885 0.0387258 0.0265895
+0.0492859 0.0567642 0.0307116
+-0.077476 0.164468 -0.0240677
+-0.0666867 0.175728 -0.049503
+-0.0251661 0.0664206 0.0424455
+-0.027701 0.0549269 0.0368456
+-0.018943 0.164042 -0.0169159
+-0.0435133 0.0846552 0.0431729
+-0.0888345 0.136443 0.0400961
+0.00149473 0.112812 0.0419217
+-0.0298299 0.09304 -0.0247313
+-0.0836967 0.0790161 0.00252063
+-0.000924151 0.039273 -0.0117161
+-0.0567677 0.0811908 -0.0210238
+-0.0934681 0.120116 0.0253121
+-0.0429479 0.170625 -0.000616016
+-0.075975 0.156283 -0.00563956
+-0.00861288 0.0384077 0.0151551
+-0.00160584 0.0434015 -0.0251635
+-0.00451637 0.113738 -0.0185133
+-0.0780673 0.0690482 0.0132523
+-0.0237986 0.0784163 -0.0381462
+0.0404558 0.0643575 0.0302495
+0.00150103 0.0576486 0.0543674
+-0.0314973 0.0746234 0.0406619
+-0.0430409 0.0337266 -0.000289053
+-0.0303409 0.0462461 0.0481864
+0.0215433 0.04083 0.0414017
+-0.0328294 0.0901297 -0.0245803
+-0.0654933 0.0370192 -0.00733845
+-0.0128512 0.129269 0.0078276
+-0.0102634 0.129467 0.00444971
+-0.0525768 0.0530264 -0.00686565
+0.0152424 0.0737083 -0.0300265
+-0.0523202 0.0474101 0.0149978
+-0.03228 0.059616 -0.0144015
+0.0262796 0.0733084 -0.0244949
+-0.091934 0.128302 0.0312437
+-0.0556539 0.153362 0.0267778
+0.00449629 0.118272 0.0381357
+-0.00902947 0.129018 0.00125187
+-0.00169837 0.0391357 -0.00987107
+0.0277845 0.0849076 0.045525
+-0.0241779 0.1712 -0.0197595
+0.0450874 0.0847681 0.0221666
+-0.0251342 0.0878826 0.0516343
+0.00641806 0.0347537 -0.00236123
+-0.0411191 0.111396 -0.0179091
+0.027653 0.0506012 0.0379885
+0.0219297 0.123716 0.0263137
+-0.0688294 0.148429 -0.0341374
+-0.0315292 0.124197 -0.00202254
+0.00150698 0.0801002 0.0571866
+-0.0615835 0.0366556 0.0444374
+-0.0481389 0.160609 -0.00688834
+-0.0254054 0.0766649 0.0494071
+-0.0774728 0.155537 -0.0149084
+-0.0401214 0.159176 -0.0112287
+0.0596647 0.0691741 0.016158
+-0.011487 0.110004 0.0424075
+-0.0381186 0.128235 0.00584498
+0.048576 0.0464424 0.0249843
+-0.0923754 0.118793 0.0312942
+-0.0639323 0.123848 -0.00887264
+-0.0798905 0.126603 -0.00582167
+-0.0413231 0.0462396 -0.0163116
+-0.0908165 0.145736 0.0263481
+0.0446156 0.0959646 0.00916087
+-0.0821218 0.075868 0.0188618
+0.05068 0.0673838 0.000483718
+-0.0501479 0.0515412 0.017644
+-0.00617289 0.130741 0.0117189
+-0.051836 0.0956238 -0.0221428
+-0.074878 0.122304 -0.00772392
+-0.00159817 0.0419657 -0.0250292
+-0.0474982 0.162268 0.00647513
+-0.0331161 0.0498057 0.0395103
+0.00234342 0.0510926 -0.0302041
+-0.0851404 0.125756 0.0494653
+-0.0699016 0.160977 -0.0489386
+-0.0798846 0.0706301 0.0125498
+-0.0697873 0.0819627 0.0411407
+-0.0547576 0.161266 0.00105716
+-0.0895055 0.0902528 0.0184453
+-0.0261075 0.162258 -0.0150297
+0.046501 0.0611194 0.0308227
+0.0238707 0.0929061 0.0469915
+-0.0533713 0.0334322 -0.00211203
+0.0417012 0.085878 -0.00880084
+0.0288139 0.110493 -0.0110929
+-0.083716 0.087071 0.0295098
+-0.0798758 0.155212 0.019678
+0.0049172 0.0339971 0.00916661
+0.0160048 0.0590435 0.0493667
+0.0573849 0.0699459 0.0206376
+0.0345802 0.103262 -0.0113359
+-0.0797481 0.0789376 0.0314228
+-0.0346581 0.0340056 0.0228095
+-0.0631272 0.0656833 0.0316274
+-0.0145321 0.0459268 0.0498594
+-0.0364091 0.0339112 -0.0194195
+0.0181222 0.116444 -0.0134944
+0.0341932 0.113962 0.0237708
+-0.0761778 0.148614 -0.0108668
+-0.0044937 0.0473352 0.0489501
+-0.0328741 0.0807299 -0.0285171
+-0.0724981 0.121807 0.0536688
+-0.0657234 0.153927 0.0319321
+-0.0548973 0.112625 -0.01673
+0.0464212 0.0764513 0.00819032
+0.0272261 0.0451183 -0.00768323
+-0.0629092 0.156144 0.021238
+-0.0631603 0.151216 -0.00238889
+-0.0347632 0.076687 -0.0214942
+-0.0906385 0.147509 0.0131579
+-0.0122779 0.122169 -0.00937841
+-0.0588974 0.156171 0.00210438
+-0.0123378 0.123047 -0.00831897
+-0.0496312 0.0590927 -0.0108209
+-0.0409256 0.153594 0.00561766
+-0.0405007 0.0860467 0.0431081
+0.0445131 0.0735224 0.0237705
+-0.0213844 0.123724 -0.0049697
+-0.0633941 0.159891 -0.0485891
+0.0364077 0.044553 -0.00488844
+-0.0739928 0.155924 0.011504
+-0.0111043 0.0366055 0.0502176
+0.03375 0.0929319 0.0401542
+-0.00645978 0.0918654 -0.0354548
+-0.0827096 0.131285 0.0511192
+-0.0835459 0.133987 0.0490485
+-0.0294951 0.0617035 0.0376524
+-0.0493817 0.138599 0.0163919
+-0.055623 0.120216 -0.0109924
+-0.00449347 0.121049 0.0367461
+-0.048904 0.144756 0.0084067
+0.00645901 0.0392685 0.0301228
+-0.0913214 0.114759 0.0373166
+-0.0265805 0.0377426 0.0157053
+-0.00572231 0.0669806 -0.0352658
+-0.0525421 0.050441 0.0296546
+0.0313831 0.11825 0.0184294
+-0.0288441 0.0958675 -0.0242091
+-0.0149484 0.177196 -0.0200335
+0.0230906 0.0973761 -0.0211755
+-0.0134888 0.11412 0.0398002
+-0.0652337 0.169622 -0.0599681
+-0.069106 0.161031 -0.0101008
+-0.0147444 0.0700214 -0.0382575
+0.000412578 0.0376462 -0.0248548
+-0.0694764 0.165214 -0.0509787
+-0.0817245 0.100671 0.0313188
+-0.0464909 0.0704463 0.0410366
+-0.0604958 0.0890419 0.0453253
+-0.0356646 0.155102 0.0026804
+0.0313895 0.0549645 0.0381834
+-0.0390844 0.149487 -0.000628748
+-0.0799141 0.109193 0.0343277
+-0.033406 0.159477 0.0024166
+0.0461298 0.0806288 0.00519237
+-0.00455042 0.0384226 0.0105194
+0.054633 0.0708998 0.00492223
+0.0466692 0.0754291 0.0122452
+-0.0510158 0.118895 -0.0136999
+0.0442088 0.0931449 0.0211603
+-0.026052 0.036748 0.0540507
+-0.0121151 0.0568039 0.0522997
+-0.0605217 0.0372227 -0.00906293
+-0.0505374 0.138563 0.00240881
+-0.0499851 0.135487 0.00142097
+0.0375229 0.0590309 0.0330268
+0.00350924 0.0842701 0.0573364
+0.0132839 0.0652538 -0.0302637
+-0.0742776 0.161639 -0.0118948
+-0.0507685 0.164108 -0.00292996
+-0.0198709 0.104468 -0.0228058
+0.0376047 0.0616532 -0.0107499
+-0.0773811 0.108845 0.0387481
+0.0226208 0.102094 0.0434114
+-0.0882171 0.135133 0.0423395
+-0.0506614 0.0515945 0.0196285
+-0.0603044 0.155837 0.0105687
+-0.0124866 0.11001 0.0423152
+0.02167 0.125998 0.00768374
+0.0323984 0.0396183 0.0260504
+-0.0709343 0.126767 -0.00893718
+-0.0135132 0.116917 0.0382221
+-0.0116656 0.051126 -0.0319435
+-0.0309822 0.125744 0.00553845
+0.0459345 0.0862193 0.0101703
+0.00749696 0.119642 0.0368719
+-0.00350244 0.107276 0.0438161
+-0.0521339 0.128852 -0.00413976
+-0.0786185 0.152695 0.0319953
+0.0163345 0.0781449 0.0535802
+0.0377538 0.0771288 -0.0117747
+-0.0215296 0.0387791 0.0338148
+-0.0350693 0.0384092 -0.00660408
+-0.0919891 0.124178 0.0422069
+-0.0444587 0.11222 -0.0167423
+-0.0171725 0.0985232 -0.0244048
+-0.057494 0.112512 0.0360215
+0.0396241 0.0900718 0.0328369
+-0.0621913 0.163125 -0.0405922
+-0.0255449 0.0384207 -0.00839698
+0.0162606 0.0736784 -0.0295549
+-0.0663455 0.040996 0.0121932
+-0.0292314 0.114996 -0.0157151
+0.0252254 0.095572 0.0454222
+0.00388853 0.130454 0.00153712
+-0.0454814 0.0335414 -0.0134702
+-0.08387 0.148679 0.0348187
+-0.0174749 0.184587 -0.0183292
+0.0188962 0.0370007 -0.0126843
+-0.0625159 0.163122 -0.0305925
+-0.0433987 0.03363 -0.0131325
+0.0291629 0.037982 0.025034
+0.0129127 0.129715 0.00445998
+0.0182606 0.0778122 -0.0281935
+-0.0476906 0.0356242 -0.0142735
+-0.0190478 0.0404047 0.0529202
+-0.00364871 0.0982082 -0.0280452
+-0.0195235 0.184467 -0.0220738
+0.00382729 0.106411 -0.0207174
+0.00350781 0.064793 0.0565955
+-0.0205171 0.0383642 -0.00178242
+0.0122268 0.0836141 -0.0306261
+-0.0444606 0.147723 0.0056898
+-0.0869664 0.148754 0.00824898
+-0.0689807 0.155012 0.0293114
+0.0302795 0.0795477 0.0438394
+-0.0660235 0.174935 -0.0492702
+-0.0804891 0.133061 0.0515278
+-0.0447252 0.109884 -0.0183457
+-0.0902839 0.137831 0.0151959
+-0.0702292 0.153353 0.0333614
+-0.0915979 0.146114 0.0211525
+-0.0905232 0.122929 0.0450175
+0.00448177 0.0951431 0.0532987
+-0.0234909 0.120747 0.0300444
+0.0274801 0.0445395 -0.0065618
+-0.091814 0.116108 0.0403567
+-0.0537253 0.151161 0.0246275
+-0.0205455 0.126353 0.00242085
+-0.00205946 0.129266 -0.00113907
+0.00252933 0.0758769 0.0564116
+0.00824452 0.129671 0.000311795
+-0.000397685 0.0923281 -0.0338988
+-0.0559448 0.126938 0.0384169
+-0.0428369 0.0942645 -0.0226678
+-0.0598806 0.105454 -0.017999
+-0.0837054 0.10067 -0.00361944
+-0.0545817 0.152467 0.0257328
+0.0103827 0.0365006 0.0297934
+-0.0898089 0.133793 0.0332137
+-0.0618767 0.15376 -0.0175826
+-0.0665983 0.155819 0.0112334
+-0.0454977 0.108441 0.0393231
+0.000688563 0.105475 -0.0216898
+0.0156183 0.0348875 0.0323047
+0.0598096 0.0622539 0.00613597
+0.0222628 0.0359732 0.0163557
+-0.0492522 0.165358 0.00274428
+-0.018422 0.0583296 0.0500808
+-0.0233794 0.126748 0.0127038
+-0.0635915 0.172518 -0.0506017
+0.000120368 0.0351316 0.0162576
+-0.0286059 0.0564269 -0.0233938
+0.0373643 0.110979 0.0106211
+-0.0143444 0.162546 -0.0104323
+0.0174821 0.10039 0.0467276
+0.00834248 0.0609508 -0.0305126
+-0.0650557 0.129761 0.0446036
+0.0584157 0.0647883 0.022872
+0.0450662 0.0889731 0.0191643
+-0.0554099 0.0334223 -0.00251784
+-0.00144558 0.106667 0.0437112
+-0.0626402 0.0627915 -0.00434322
+-0.0406608 0.0335117 -0.0254825
+-0.0621215 0.15372 -0.0285871
+-0.0304827 0.0538056 -0.016375
+0.0276877 0.0607373 -0.0218456
+-0.0332153 0.107417 -0.0197253
+-0.0709666 0.138448 -0.00754922
+-0.0554983 0.0973521 0.0432389
+0.0051585 0.127708 0.0288034
+-0.0497318 0.0354763 -0.0126201
+-0.0713898 0.160567 -0.00801414
+-0.0135985 0.108507 -0.0209218
+-0.0701499 0.0695315 0.0320822
+-0.0618453 0.155287 -0.0285878
+-0.0774937 0.145636 0.0432119
+-0.0499442 0.140127 0.0163925
+-0.0622517 0.147555 -0.00557481
+0.0112895 0.0624411 -0.0303571
+-0.054281 0.0573695 -0.00641449
+-0.0468263 0.128888 -6.3255e-05
+0.0167125 0.0343686 0.00192575
+0.025374 0.0938744 -0.0213667
+0.0374202 0.110869 0.0135214
+-0.0202897 0.0381028 0.016664
+0.0122214 0.13032 0.0170232
+-0.0424979 0.0817557 0.0420871
+0.0247834 0.123596 0.021665
+0.0458295 0.0890233 0.00817039
+-0.0246722 0.05361 -0.0281576
+-0.0368219 0.0900544 -0.0239252
+-0.0331266 0.0338175 0.0106794
+-0.0863242 0.111849 0.0243217
+-0.0881544 0.121251 0.000301062
+-0.0639205 0.112438 -0.0133308
+0.00114374 0.101639 -0.0226194
+0.0117494 0.0671858 0.0538619
+-0.0177987 0.0336176 -0.0248428
+0.0384483 0.10837 0.0201721
+-0.0895436 0.0902218 0.014448
+-0.0441053 0.129054 0.00361434
+-0.0447524 0.033564 -0.0207541
+-0.040486 0.0346908 0.0404235
+0.0158804 0.124131 -0.00578699
+-0.0301445 0.169695 -0.0171502
+-0.0906194 0.139243 0.0211829
+-0.0653253 0.142516 0.0407395
+-0.0320761 0.0447291 -0.0281131
+-0.0764158 0.0699842 0.0233785
+-0.0254497 0.052221 0.0403383
+0.0262523 0.076131 -0.0243472
+-0.0174971 0.101623 0.0437353
+0.00533357 0.055349 -0.0305496
+-0.0493266 0.134948 0.0237381
+0.0053984 0.122421 -0.0118951
+0.038604 0.108395 0.0191762
+-0.0638345 0.0431637 0.0378429
+-0.0748055 0.0863518 -0.0148055
+0.0157558 0.127182 0.025475
+0.0337414 0.0384723 -6.48206e-05
+-0.0564853 0.0791423 0.0441771
+0.0234983 0.102092 0.0429315
+-0.00524932 0.101176 -0.023207
+-0.0804177 0.153092 0.00488677
+-0.0764988 0.13725 0.0499203
+-0.0550791 0.134447 -0.00412579
+0.0139517 0.124505 -0.00617757
+-0.0839821 0.127994 -0.00381712
+-0.0571198 0.115445 0.0365816
+-0.0622396 0.155257 -0.0325976
+-0.0454972 0.0761548 0.042184
+0.0313815 0.0461664 -0.00629419
+-0.0438412 0.0942345 -0.0223045
+-0.0236613 0.0852675 0.0544729
+-0.0616609 0.147135 -0.00399772
+-0.0600825 0.0413306 0.0227014
+-0.0105535 0.180959 -0.0288535
+-0.0676833 0.155656 0.026832
+0.0282931 0.118599 0.0272385
+-0.0871972 0.102223 0.00642609
+0.0103624 0.0494805 -0.028102
+0.0154246 0.0685991 0.0521564
+-0.0416312 0.117641 -0.0144485
+-0.0276264 0.046347 -0.026964
+-0.0916136 0.132311 0.0112256
+0.0178346 0.0505132 0.0449253
+-0.0444935 0.155066 0.00750552
+-0.037487 0.115255 0.0329307
+-0.0185008 0.119534 0.0344711
+-0.052516 0.0452355 0.0436109
+-0.00977222 0.11683 -0.0157853
+-0.0558279 0.0635792 0.0314789
+-0.0607324 0.0592584 0.00571875
+-0.0621725 0.160005 -0.022587
+-0.0603904 0.152423 0.000272984
+-0.0697355 0.134074 0.048407
+-0.0688943 0.103764 -0.0141878
+-0.0871513 0.117629 0.0474896
+0.0463722 0.0764454 0.00719365
+0.0582269 0.0686747 0.0208601
+0.0410646 0.07659 0.0312229
+-0.0298717 0.104385 -0.0225787
+-0.0346365 0.0766699 -0.022492
+-0.0639324 0.147049 -0.0189093
+0.0414492 0.10286 0.0161642
+0.041276 0.104245 0.0131611
+-0.0550666 0.151635 -0.00215779
+-0.0723648 0.0763024 0.0368597
+-0.0166996 0.0540293 -0.0329391
+-0.0108856 0.107334 -0.0222671
+-0.0609787 0.126745 -0.00811044
+-0.0495024 0.109811 0.0380885
+-0.0814376 0.0978185 -0.00662583
+-0.0771326 0.163938 -0.0219397
+-0.0690818 0.18144 -0.0564572
+0.031034 0.0964814 -0.0161287
+0.0445032 0.0555996 0.0323503
+-0.0335401 0.0732865 0.0413362
+0.0315592 0.035603 0.0149292
+-0.0625155 0.0344693 0.0376364
+0.0223706 0.0505198 -0.0231651
+-0.051638 0.0663266 -0.0117848
+0.0132667 0.0519749 0.0488584
+-0.0568732 0.108333 -0.017952
+0.0448639 0.0833492 0.023175
+-0.0316705 0.0806285 -0.0315587
+-0.0714676 0.155482 0.0269686
+0.0118001 0.034659 0.0389456
+-0.0860496 0.128472 0.048867
+-0.0155071 0.175699 -0.0190868
+-0.058019 0.131103 -0.00658932
+0.0113955 0.0434069 -0.0246972
+0.0568205 0.0566796 0.0240006
+-0.0267763 0.0365192 0.0538225
+-0.0564971 0.0987696 0.0431638
+0.0353453 0.0835128 0.0388598
+-0.0602464 0.144668 -0.00329576
+-0.00749863 0.0884246 0.0571361
+-0.0816964 0.0734472 0.00653139
+0.0399806 0.105624 0.0191716
+-0.0676913 0.172275 -0.0570278
+-0.0358314 0.0356542 0.0457978
+0.0503129 0.0516868 -0.00299828
+-0.0414959 0.0705202 0.0419075
+0.0246022 0.0942401 0.0462765
+-0.0735775 0.170801 -0.0470392
+0.0373196 0.105416 -0.00382358
+0.0463401 0.0518943 -0.00540594
+0.0400167 0.0646852 -0.00776271
+-0.0597593 0.07671 -0.0185219
+-0.0237194 0.0639841 -0.033754
+-0.0473867 0.0345201 0.0356021
+0.00159304 0.131118 0.00454966
+-0.073925 0.126728 -0.0084362
+-0.0243269 0.0616478 -0.0324508
+0.0457562 0.0904226 0.00816981
+-0.0688748 0.159133 -0.00709894
+-0.0394914 0.0944889 0.0427101
+-0.0687998 0.0822684 -0.0173873
+-0.0455924 0.119193 -0.014062
+-0.0369476 0.033676 0.00641963
+-0.09079 0.1297 0.0392322
+-0.0389556 0.0350986 0.042208
+-0.0414578 0.107073 0.0393054
+-0.00265934 0.098112 -0.0279111
+-0.0331649 0.0652734 -0.0174782
+-0.0343312 0.0836736 -0.0246034
+0.0134882 0.101805 0.0472084
+-0.0594997 0.0846925 0.0439263
+-0.0423306 0.040657 -0.0232664
+0.0092124 0.114671 -0.0175632
+0.0538026 0.0595499 0.0284925
+-0.0256867 0.0380701 0.0246091
+-0.0693658 0.16286 -0.0130912
+0.0333604 0.037057 0.0194583
+0.00949693 0.121023 0.0358683
+0.0321446 0.0360609 0.0164637
+0.0341544 0.0548861 0.0351403
+-0.000334987 0.0965293 -0.0302242
+0.0585628 0.0673807 0.0213416
+-0.053406 0.12345 -0.00838645
+-0.0749578 0.132548 -0.00734349
+0.0282219 0.0816125 -0.0219304
+-0.0351889 0.171161 -0.0140358
+0.00949153 0.0936876 0.0522363
+-0.0157849 0.172748 -0.017746
+-0.0175848 0.169785 -0.0150947
+-0.0835905 0.112379 0.0452164
+-0.0404862 0.0846544 0.0431896
+0.0231358 0.0404562 0.0392455
+-0.00366205 0.0540631 -0.0322696
+0.00959837 0.0403395 0.0451906
+-0.0692421 0.0422187 0.00798097
+-0.0285258 0.0717501 0.0402231
+-0.00789542 0.108803 -0.0224197
+0.0159009 0.113257 -0.0160529
+-0.00149436 0.0620061 0.056412
+-0.0420891 0.0363826 -0.0272583
+-0.00449341 0.104477 0.0440393
+-0.0683512 0.0607717 0.0117847
+-0.0927055 0.120137 0.0415853
+-0.0484911 0.115278 0.0334198
+0.02514 0.0350088 0.0196342
+-0.065935 0.125307 -0.00885715
+-0.0621483 0.0699034 0.036962
+-0.0178695 0.104461 -0.0227631
+0.0351768 0.0563002 0.0348659
+0.0105044 0.115477 0.0381888
+-0.0938558 0.126876 0.0162567
+-0.0632514 0.033799 0.0117273
+-0.0736013 0.0654333 0.0137843
+-0.0577792 0.0341881 0.0284371
+-0.0763952 0.0838159 -0.0125906
+-0.0296632 0.180174 -0.00867233
+0.00819029 0.0851531 -0.0324575
+-0.071633 0.174549 -0.0412084
+-0.0538265 0.0927341 -0.0220469
+-0.0471905 0.156504 0.00887867
+-0.0661815 0.0615106 0.0205126
+0.0144985 0.107111 0.0421568
+-0.0721929 0.152802 0.0342528
+0.0142765 0.0666697 -0.0302658
+0.0349485 0.0942163 0.0384062
+-0.0664891 0.0369705 -0.00688594
+-0.077495 0.158339 -0.0149115
+-0.0739383 0.160975 -0.0103701
+-0.00971429 0.0386927 -0.0148008
+-0.0618555 0.155289 -0.0295874
+-0.0621574 0.152203 -0.016578
+-0.032494 0.096035 0.0446186
+0.044345 0.0519693 -0.00630996
+0.0319954 0.0520213 0.0354999
+-0.0300925 0.0509394 -0.0183595
+-0.018449 0.0388382 0.0343981
+-0.0670639 0.154762 0.000889218
+0.0361767 0.0888967 0.0383392
+0.0262873 0.0942382 0.0451936
+0.0186534 0.103359 0.0446898
+-0.0523328 0.0334686 -0.00741897
+0.0507066 0.0540083 0.0292331
+0.0529037 0.0462692 0.0142047
+-0.0888522 0.0996312 0.00941041
+0.0275656 0.0563642 0.0414619
+-0.0371627 0.0336289 -0.0286501
+-0.0198294 0.0882519 -0.0375379
+-0.0907603 0.140585 0.0151783
+-0.00458896 0.0376652 -0.0252351
+-0.093041 0.12831 0.0262642
+-0.0743429 0.0955133 0.0396401
+-0.089704 0.111925 0.0143387
+0.0453684 0.0889907 0.0151607
+0.0456444 0.086201 0.0151659
+-0.0635175 0.0399079 -0.00714576
+-0.0294925 0.0903536 0.0441109
+-0.0888771 0.100994 0.011394
+-0.0121064 0.0869584 -0.0384624
+0.0373352 0.108319 0.0251875
+-0.0882187 0.112165 0.0210064
+0.0349174 0.110993 0.0268865
+-0.0849268 0.122064 -0.00322109
+0.0124968 0.112648 0.0387734
+-0.0662562 0.163203 -0.0177078
+-0.0640701 0.113939 0.0406208
+-0.0654246 0.0794919 0.0421931
+-0.0519669 0.0569186 0.0284516
+-0.0519207 0.0493094 0.0353906
+0.00333114 0.0341656 0.00499397
+-0.056914 0.133942 0.035273
+-0.0780215 0.158305 -0.0199209
+0.0276406 0.111416 0.0348725
+-0.0172565 0.181572 -0.0253576
+0.0372544 0.0379189 0.00466817
+-0.0211197 0.1653 -0.017528
+-0.0557637 0.121264 0.0386516
+0.0274329 0.121878 0.0183804
+-0.0623369 0.16467 -0.04959
+0.00450432 0.0883672 0.0562441
+-0.0649333 0.145142 -0.016034
+-0.0918355 0.118761 0.0292947
+0.0503561 0.073461 0.0121181
+-0.0732571 0.0860546 0.040246
+-0.0543933 0.14384 0.0284354
+0.0235922 0.124679 0.00697037
+0.049638 0.0724241 0.0192263
+-0.0691135 0.0647604 0.0241382
+-0.0277318 0.0385796 0.0327127
+0.0249679 0.0605263 0.0447882
+0.0220764 0.0741142 0.049509
+-0.012493 0.16839 -0.0164935
+0.0220311 0.0550166 0.0457656
+-0.0197467 0.0364265 -0.0184459
+0.000577278 0.0388845 -0.0129362
+-0.0178004 0.121647 -0.00876548
+-0.0516521 0.0334655 -0.0091126
+0.0221612 0.0754835 0.0496518
+-0.0384539 0.162349 0.000413916
+-0.0711225 0.0388168 0.00193457
+0.0334725 0.0950337 -0.0145821
+-0.00505247 0.102417 0.0438081
+0.0159216 0.0348476 0.0287894
+0.0277666 0.0347822 0.00749516
+-0.0675802 0.144972 -0.0192338
+-0.0477088 0.132967 0.0228963
+-0.0134912 0.0386664 0.0301779
+-0.0590273 0.134027 -0.00648451
+0.0244484 0.124114 0.020115
+0.0218798 0.0374214 -0.00364164
+-0.0658775 0.102439 -0.0164403
+-0.0743971 0.166132 -0.0206985
+-0.0634619 0.0339766 0.015084
+-0.0497324 0.138579 0.00441928
+-0.00151689 0.0428507 0.0468014
+0.00660528 0.0935786 -0.0311099
+-0.0862444 0.0819176 0.00849345
+-0.0634827 0.0876134 0.0450541
+0.0182388 0.0763952 -0.028136
+-0.0765343 0.0681368 0.0143622
+-0.092883 0.116038 0.0143172
+0.000494981 0.0442085 0.0460563
+-0.0518518 0.0970732 -0.0222063
+-0.0248173 0.0693751 0.0448313
+-0.089421 0.135156 0.0282104
+-0.0566159 0.0573558 0.0107416
+0.0312695 0.0800594 -0.0199503
+-0.03437 0.0738393 -0.0214808
+0.0226051 0.113885 -0.0127298
+-0.0658838 0.16421 -0.0204509
+-0.0417953 0.0435116 -0.0223513
+-0.0710782 0.156778 -0.0439119
+0.00348525 0.108604 0.0422849
+-0.0239399 0.118058 -0.0129545
+-0.0498545 0.0999668 -0.0218887
+0.0176793 0.0852191 -0.0283526
+-0.0426623 0.0592741 -0.0122692
+-0.0642751 0.044386 -0.00129652
+-0.0456062 0.127883 0.0223049
+-0.0818286 0.147374 0.0384552
+0.0125066 0.10443 0.0450477
+-0.0763281 0.174543 -0.0415648
+-0.0144887 0.0387707 -0.00835843
+-0.00853122 0.0430617 0.0490142
+-0.0783677 0.176339 -0.0480853
+-0.0408918 0.109911 -0.0187996
+-0.0634329 0.159891 -0.0505847
+-0.0278615 0.0987172 -0.0237448
+0.0172353 0.0806842 -0.0288156
+-0.0768582 0.104852 -0.0089026
+0.0310274 0.118497 0.0197321
+0.0262422 0.122687 0.00652555
+-0.000524008 0.041433 0.0467891
+0.0292827 0.060879 -0.0197951
+0.00853553 0.0366751 -0.00931803
+-0.092315 0.125571 0.0312621
+-0.000472926 0.0972534 -0.0289903
+-0.0604964 0.0861621 0.0446513
+0.0117525 0.0432202 0.0447834
+-0.0738828 0.103582 -0.0116089
+-0.00249719 0.0488761 0.0505372
+-0.0307845 0.0580469 -0.0184096
+-0.00234994 0.125819 -0.00745455
+-0.0301636 0.153871 -0.00371356
+-0.0815418 0.0912589 0.0328461
+-0.0901131 0.132441 0.0382173
+0.037389 0.0476423 -0.00613109
+-0.0646684 0.155196 -0.0425404
+-0.0928057 0.124227 0.0372672
+-0.0297999 0.12434 0.000117203
+-0.032492 0.0746402 0.0409516
+-0.0555716 0.122697 0.0389476
+-0.0717789 0.154685 0.0298089
+-0.0930714 0.12018 0.0352857
+0.0144798 0.109585 -0.0180587
+0.00343169 0.0361267 -0.0240106
+-0.0288758 0.046967 -0.0262149
+-0.0616418 0.158426 -0.0235923
+0.0103202 0.0609665 -0.0299301
+-0.0910325 0.14477 0.0261671
+-0.083926 0.0775674 0.0187821
+-0.0575363 0.138153 0.0326058
+-0.0295 0.0703058 0.0395502
+-0.0217308 0.0626511 -0.0346671
+-0.0640717 0.164086 -0.0255357
+-0.063271 0.158522 -0.0165888
+0.0210264 0.0895934 -0.0248804
+-0.0731992 0.145774 -0.0148545
+-0.0334943 0.0803079 0.0415842
+-0.0862122 0.111364 0.0347412
+0.0338239 0.11087 -0.00547119
+-0.0135288 0.0458914 0.0493586
+-0.0643715 0.139866 -0.00735458
+-0.0568939 0.158351 0.00118769
+-0.0405106 0.151258 -0.00613685
+-0.00551608 0.110856 -0.0214408
+-0.0787639 0.0696569 0.0125705
+0.00378339 0.0381062 0.0251953
+-0.0650446 0.154908 -0.0437098
+-0.089228 0.114813 0.0276717
+-0.00277394 0.0797805 -0.0365537
+-0.0661523 0.136835 0.0429956
+-0.0434818 0.0902492 0.04268
+-0.0184702 0.0959697 0.0503933
+-0.0801387 0.142096 0.0454029
+-0.00485582 0.0989472 0.0508482
+-0.0336234 0.153659 0.000337049
+0.00250661 0.0924946 0.055168
+-0.0729484 0.132565 -0.00781242
+0.0194715 0.127423 0.0125674
+0.00484292 0.129473 0.025811
+-0.0576054 0.0658547 0.0344063
+-0.0502601 0.0543084 0.0166402
+-0.027407 0.0396009 0.0539527
+-0.0105297 0.0560622 0.0527517
+-0.0456126 0.0519231 -0.010201
+0.000501847 0.0590908 0.0549783
+-0.0569845 0.0535242 0.00365398
+-0.0671097 0.0432428 -0.000257978
+0.0214666 0.0975514 0.0465681
+-0.08997 0.132328 0.0399309
+-0.0761969 0.167972 -0.0410261
+0.0170202 0.121328 -0.0087569
+-0.0138948 0.17568 -0.0202542
+-0.0281655 0.17267 -0.018055
+-0.0638531 0.04136 -0.00615806
+-0.0348821 0.0342989 0.0153052
+-0.000342105 0.0380462 0.00257941
+-0.00749789 0.0898138 0.0570783
+0.028524 0.0808687 0.0448153
+-0.0331206 0.0356024 -0.0184705
+0.0043586 0.119499 -0.0147306
+0.0467625 0.0462832 0.0266316
+0.0368364 0.111573 0.0161776
+0.00851174 0.0799624 0.0552814
+-0.00244825 0.112634 -0.0193375
+-0.0235385 0.11268 0.0379979
+-0.0115345 0.0922826 -0.0359317
+-0.09304 0.122895 0.0392709
+-0.0271645 0.17563 -0.018169
+-0.0772929 0.117422 0.0514809
+0.0179164 0.102978 -0.02104
+-0.0709646 0.0754682 0.0373385
+0.0216627 0.126095 0.0176515
+-0.0640284 0.119984 0.047923
+-0.0444795 0.0874935 0.0436599
+-0.0893861 0.0943037 0.0204146
+-0.0720651 0.173384 -0.0385311
+-0.0894927 0.14204 0.0311659
+-0.0454987 0.120637 0.0275066
+-0.0250745 0.0954862 -0.0252675
+-0.0895496 0.13918 0.0132126
+0.0192289 0.0820148 -0.027672
+-0.0154803 0.0645289 0.0535158
+0.0164872 0.108442 0.0405002
+-0.00663864 0.115688 -0.0165748
+-0.0494985 0.104247 0.040228
+-0.0673252 0.149334 0.0390086
+0.0300883 0.0872505 -0.0203879
+-0.0278877 0.0633808 -0.0294488
+0.0182732 0.069417 -0.0291542
+0.0171905 0.116688 -0.0137466
+0.0502632 0.0713497 0.022405
+0.0350985 0.114043 0.00837763
+-0.0505103 0.0452467 0.0429196
+0.0302544 0.113856 0.0308506
+-0.0605348 0.0333568 -0.0034971
+-0.00390558 0.0383472 0.0143493
+0.0270583 0.122199 0.00683201
+-0.0241505 0.0378782 0.0124647
+-0.0606031 0.0352186 0.0442288
+-0.0906667 0.113308 0.0195238
+-0.00876475 0.075634 -0.0378123
+-0.0531345 0.0641573 0.0333061
+-0.0262078 0.123609 -0.00273748
+-0.0629032 0.154793 0.00389792
+0.00322165 0.0782734 -0.0348651
+-0.0232226 0.0950277 -0.0288098
+-0.0497962 0.0869626 -0.02172
+0.0239811 0.109404 -0.0139261
+-0.00287196 0.105931 -0.0223953
+0.00350624 0.0619975 0.0564502
+0.0152965 0.129062 0.00674245
+-0.0198254 0.120831 -0.00989132
+-0.0672111 0.0749069 0.0386416
+-0.0199192 0.0375867 0.0533971
+-0.0507132 0.054338 0.0146004
+0.0338375 0.109906 -0.00644408
+-0.052068 0.0531865 0.02764
+-0.0665349 0.0638845 0.0254353
+-0.0340904 0.160759 -0.0135462
+-0.0456409 0.0577841 -0.0117617
+0.0425336 0.0678584 0.0273676
+-0.0549188 0.148123 0.0275408
+0.0178543 0.0352284 0.0378786
+-0.0254848 0.100235 0.0442056
+-0.014497 0.0856418 0.0570702
+0.0151023 0.0860518 0.0518047
+-0.0616341 0.0628646 -0.00472902
+0.02366 0.0848996 0.0483924
+-0.0496187 0.054694 -0.00943972
+-0.0328776 0.105721 -0.0208169
+-0.0144506 0.103914 0.0432646
+-0.0248813 0.105869 -0.0225199
+0.024788 0.0591582 0.0445118
+-0.0159391 0.0999021 -0.023843
+-0.0539979 0.153168 0.0186815
+-0.0738816 0.120852 -0.00799698
+0.0296461 0.118491 0.000643936
+-0.0540045 0.13652 -0.00234857
+-0.0593798 0.0335176 0.00740926
+0.0366379 0.08347 0.0371909
+-0.0520867 0.151648 -0.00355308
+-0.0188227 0.0387965 0.0325596
+0.00898388 0.131012 0.0072855
+-0.0682589 0.154325 -0.0506473
+-0.0521805 0.0531921 0.0266366
+-0.0617514 0.175333 -0.0614739
+-0.0169338 0.185679 -0.0240586
+0.015477 0.103104 0.045929
+-0.0729148 0.0713134 0.0317175
+-0.0172476 0.114664 -0.0174436
+-0.0126734 0.0384579 0.00339052
+-0.0832791 0.0884633 0.0304387
+-0.0858155 0.103519 0.00339021
+-0.0146369 0.0466344 -0.0294365
+-0.0773163 0.098935 -0.0105842
+-0.0145015 0.0631456 0.0536787
+-0.0689178 0.0717538 0.0356819
+-0.0255986 0.0394109 -0.0291464
+-0.0623671 0.0719748 0.0386642
+-0.0301518 0.0360809 0.0236741
+-0.030565 0.0383245 0.0341404
+-0.0574984 0.0918591 0.045399
+-0.0861528 0.0951452 0.0274373
+-0.0644941 0.0412041 -0.00599039
+-0.0363521 0.126723 0.0183002
+0.00755707 0.10303 0.0452955
+-0.0396625 0.0399023 -0.0274567
+-0.0838382 0.11616 -0.00137187
+0.0166591 0.0349342 0.0324763
+-0.0647933 0.15319 -0.00116291
+0.00911841 0.110151 -0.0195223
+-0.0697747 0.155761 0.0260978
+0.045415 0.0763654 0.00219579
+-0.0127734 0.171309 -0.0186592
+0.00748545 0.0964088 0.0510363
+0.0125027 0.109886 0.0398286
+-0.0779306 0.0866645 -0.0115691
+-0.0830177 0.0951656 -0.00554205
+-0.0184064 0.186879 -0.0179354
+-0.0866419 0.0923952 0.0266005
+0.026251 0.103389 0.0398709
+0.0333357 0.116389 0.013468
+-0.0452756 0.131436 0.0105618
+-0.035474 0.0519266 0.0383228
+-0.0536233 0.0657097 0.0353836
+0.0013977 0.0433563 -0.0248502
+0.0269244 0.118903 0.0281816
+0.0395 0.055533 0.0316092
+-0.0723024 0.111428 0.0467445
+-0.0364387 0.0357946 -0.0155844
+-0.0276413 0.159598 0.000270855
+-0.00596208 0.0394 0.0364646
+-0.00479094 0.0798443 -0.0373862
+-0.00779065 0.130523 0.0125627
+-0.0464848 0.12067 0.0277891
+-0.0645002 0.0889975 0.0448988
+-0.0896121 0.0902414 0.0154476
+0.0130231 0.0965172 -0.0241956
+-0.0452605 0.0391077 0.0445023
+0.0587398 0.0709245 0.0152557
+-0.0596114 0.0726835 0.0404064
+0.0240499 0.0348797 0.0195293
+-0.0682817 0.156606 -0.0532672
+0.0178388 0.104825 -0.0190099
+-0.0288938 0.180785 -0.00982491
+0.0323759 0.0738626 -0.0187418
+0.0314474 0.112439 -0.00717966
+-0.074091 0.144362 -0.00888576
+0.0510178 0.0461394 0.00424124
+0.00750963 0.0646928 0.0554932
+-0.0643093 0.0665984 0.0323388
+0.0133515 0.0566849 -0.029233
+-0.0243216 0.10004 -0.0240037
+-0.00749239 0.096543 0.0535421
+-0.00533786 0.0388247 -0.000985585
+-0.0884258 0.0996766 0.0213895
+-0.0320326 0.0609937 -0.0164107
+0.0535495 0.0533436 -0.000784809
+0.0393899 0.0533602 -0.00667374
+-0.0717205 0.168577 -0.0240459
+-0.0704919 0.126012 0.052539
+-0.0388888 0.109926 -0.019043
+-0.0507025 0.140081 0.0193694
+-0.0263231 0.034658 0.0434735
+0.0398861 0.0766416 0.0330246
+-0.0941682 0.126929 0.0222624
+-0.0117712 0.0770642 -0.0382004
+-0.0417668 0.040639 -0.0243092
+-0.0517327 0.164109 0.00103678
+-0.0721705 0.158208 -0.0379206
+-0.0356893 0.0651361 -0.0144415
+-0.065143 0.156205 -0.00860924
+0.00354988 0.0342019 -0.0174252
+0.00312416 0.107287 -0.0203844
+-0.0340011 0.127005 0.00589371
+-0.0418419 0.09571 -0.0225712
+-0.0333161 0.126997 0.0105451
+-0.0717391 0.165925 -0.0182956
+0.0559734 0.0494153 0.0101945
+0.0174969 0.108466 0.0401752
+-0.0507291 0.133637 -0.00121966
+0.0083246 0.0581885 -0.03043
+-0.0711713 0.176467 -0.0550529
+0.0165931 0.100464 -0.0223776
+-0.0544905 0.0862124 0.0452239
+-0.0574075 0.0649991 0.0334306
+0.0195092 0.092819 -0.0242669
+-0.0856512 0.0899172 -0.000541045
+0.0081342 0.104445 -0.020865
+-0.0752567 0.160324 -0.0108988
+-0.0376087 0.118212 -0.0130418
+-0.055019 0.14719 -0.00165707
+-0.04909 0.0628007 0.0352845
+-0.018783 0.0770899 -0.0389016
+-0.0336421 0.175583 -0.0129563
+-0.082659 0.0871422 0.0312687
+-0.0621779 0.061949 0.0245023
+-0.0782836 0.162467 -0.0289415
+0.0339055 0.0599168 -0.014725
+-0.0414124 0.128336 0.00169512
+-0.0398827 0.035133 -0.0101165
+-0.00781609 0.0854881 -0.0377912
+0.0082433 0.13138 0.00986533
+-0.0358714 0.105673 -0.0204021
+0.00749975 0.0589567 0.0535286
+-0.072631 0.0670284 0.0231935
+0.0525192 0.0691267 0.0251103
+-0.0688901 0.0621533 0.0194032
+-0.0824666 0.11008 0.0383967
+-0.0438038 0.0884337 -0.0219011
+-0.00534725 0.0379464 -0.0151277
+-0.0425045 0.0478596 0.0401075
+0.0214753 0.11175 -0.0144217
+-0.000497779 0.0489051 0.0509033
+0.0236032 0.116718 -0.00979024
+-0.0648062 0.0852609 -0.0190538
+-0.0395435 0.101505 0.0409276
+0.0209425 0.124573 -0.000263497
+-0.0286807 0.0383267 -0.00339493
+-0.0585081 0.0422988 0.0170665
+-0.0316383 0.0367739 0.0511824
+-0.085482 0.104867 0.00337403
+-0.00926648 0.100073 0.0477845
+-0.00448593 0.118295 0.0389891
+-0.0377467 0.0768482 -0.0188928
+-0.0640837 0.156142 0.0179222
+-0.0515285 0.144709 0.0153879
+-0.0267903 0.0866521 -0.0358137
+-0.0626407 0.163129 -0.0295903
+-0.00752629 0.0443832 0.0481509
+-0.0750304 0.169881 -0.0295693
+-0.0907748 0.12133 0.00629364
+0.0164129 0.0417834 -0.0225068
+-0.0317772 0.169741 -0.00573949
+-0.0546238 0.0527377 0.0100793
+0.0453589 0.0561811 -0.00597324
+-0.0651505 0.0366918 0.0402161
+-0.032507 0.108409 0.0384637
+0.0185107 0.108486 0.0398481
+0.0450172 0.0749324 0.00120229
+0.00251449 0.0702821 0.0560425
+-0.0434424 0.160833 0.00573037
+0.056541 0.064854 0.0254614
+-0.0648306 0.156078 0.013307
+-0.00545884 0.111961 -0.020621
+-0.0222505 0.0336283 -0.0219672
+-0.0319114 0.16826 -0.00591385
+0.0045246 0.0828376 0.0569094
+-0.0849678 0.0844642 -0.00152644
+0.0277057 0.120723 0.00280565
+-0.0133613 0.182397 -0.0284169
+-0.0569294 0.13993 -0.00415472
+-0.0104844 0.118266 0.038122
+-0.0725121 0.144203 0.0447958
+-0.0661037 0.0713259 0.0366501
+-0.050851 0.138527 0.021367
+-0.0580927 0.0577897 0.0147789
+-0.0157117 0.033701 -0.0245127
+-0.00261732 0.0341102 -0.0185505
+-0.0614975 0.10975 0.0377559
+0.00661243 0.131425 0.00784474
+-0.0602206 0.142504 0.0358229
+0.0126673 0.104052 -0.020179
+-0.0624955 0.0904382 0.0452713
+0.0164839 0.0699861 0.0519409
+-0.0334933 0.0946149 0.0444857
+-0.0904058 0.114907 0.0416618
+-0.0182558 0.178619 -0.0243596
+-0.0436529 0.0346111 0.0345638
+-0.00297107 0.0340356 -0.0204416
+-0.0246065 0.0394112 -0.0290873
+-0.0257404 0.0712076 -0.0359148
+-0.0285156 0.0433359 0.0513164
+0.0262381 0.119658 0.0279158
+-0.0734823 0.0649094 0.0160661
+0.0249492 0.109234 -0.0137375
+-0.0651326 0.157423 -0.0100634
+-0.0578906 0.0600472 -0.00173427
+-0.0868853 0.0847213 0.0144753
+-0.0610173 0.135506 -0.00686914
+0.0547011 0.0728313 0.00929699
+0.00513733 0.104474 -0.0214038
+-0.0199542 0.180019 -0.0229778
+0.022195 0.0344915 0.00477409
+-0.0509846 0.123023 -0.00999375
+0.0173702 0.0506958 -0.0254566
+0.0327797 0.0727287 0.040356
+-0.0376189 0.0505906 -0.0108802
+-0.057408 0.0521648 0.00264452
+-0.0845698 0.111358 0.0279354
+0.045113 0.0861573 0.00219478
+-0.0694333 0.0348816 0.0112742
+-0.0621334 0.15599 0.0157191
+0.0379075 0.0398433 0.0233434
+-0.0695824 0.180796 -0.0534457
+0.00287682 0.0368053 -0.01432
+0.0592296 0.0635939 0.00512091
+-0.0326951 0.0680731 -0.0204474
+-0.017619 0.161286 -0.0140538
+-0.00121244 0.0358159 0.011737
+-0.0485025 0.167013 -0.00296472
+0.0139694 0.0974449 -0.0231882
+0.0336763 0.102539 -0.0125747
+-0.0769165 0.147253 -0.00586064
+-0.0894763 0.140666 0.0321759
+-0.079441 0.139988 0.0475582
+-0.019773 0.0742847 -0.0390372
+-0.066871 0.0626922 0.0228964
+-0.0473301 0.134807 0.0120125
+0.0244991 0.106997 0.0390493
+0.0296386 0.114736 0.0306143
+0.0275719 0.0433403 0.0342886
+-0.0524918 0.107066 0.0397432
+-0.0544973 0.0427375 0.0458563
+-0.0837407 0.129905 0.0507752
+0.0390362 0.108381 0.0141662
+0.0136873 0.0685864 0.0531495
+-0.0780988 0.162499 -0.0239377
+-0.0804325 0.078146 0.029561
+-0.0720693 0.0709772 0.0321852
+-0.036497 0.0903135 0.0436162
+-0.0157593 0.121529 -0.00864145
+-0.0640118 0.135519 -0.00771971
+-0.0096474 0.0481504 -0.030386
+-0.0889991 0.11248 0.0367803
+-0.0718704 0.117956 -0.00810673
+-0.00253303 0.110473 -0.0210263
+-0.0151271 0.118705 -0.0137294
+-0.0533766 0.126536 -0.00565695
+-0.050165 0.0501393 0.0176523
+-0.0617795 0.126914 0.0422805
+-0.0077906 0.079881 -0.0380243
+-0.0181903 0.172708 -0.0227977
+0.0362974 0.0657667 -0.0137187
+-0.0193672 0.122992 0.0288371
+0.0118921 0.127946 0.0270512
+-0.0528594 0.0344415 0.0327571
+-0.0440834 0.0344755 0.0328349
+0.00820576 0.0343954 0.0203732
+-0.0384853 0.0819001 0.0436414
+0.0279153 0.112797 -0.00956049
+-0.0233818 0.177171 -0.0128784
+0.00211138 0.110155 -0.0201605
+-0.0214231 0.0385184 -0.00765668
+-0.0590379 0.13549 -0.00623086
+-0.0654804 0.152163 -0.03833
+-0.0328363 0.0957996 -0.0235469
+-0.0574937 0.0333307 -0.00285911
+-0.0723124 0.154022 -0.038905
+-0.00125765 0.0383424 0.0470318
+0.022422 0.125761 0.0150782
+-0.0285891 0.0935252 -0.0252241
+-0.0395009 0.16971 0.00189803
+-0.0211973 0.0363196 0.0534993
+-0.0671438 0.037039 0.0145094
+-0.0455015 0.115241 0.0333765
+-0.0416597 0.057808 -0.0117566
+-0.0597745 0.0434652 0.0436848
+-0.0594246 0.0334838 0.00203125
+-0.0609255 0.122379 -0.00879585
+-0.0633414 0.0357702 0.0187502
+-0.0629834 0.0594485 0.00869517
+-0.0240199 0.0537379 0.0416895
+-0.0382462 0.044597 -0.024375
+-0.00732189 0.100225 -0.0241674
+-0.0425982 0.0463965 -0.0133084
+-0.0889045 0.133745 0.0416542
+0.00049898 0.0385943 0.0466363
+-0.0295864 0.0462965 0.0488628
+0.00439164 0.0448792 -0.025855
+-0.0608362 0.0341593 0.0278122
+-0.0547243 0.0723714 -0.0165135
+-0.0274694 0.155208 -0.00473974
+0.0246484 0.0713321 0.0461382
+0.0124372 0.0548875 0.0512192
+-0.00549842 0.0828666 0.0570203
+-0.0616148 0.0337181 0.0103501
+-0.0346312 0.0752701 -0.0214845
+-0.0629229 0.058915 0.0109817
+-0.0424386 0.147805 0.00141712
+-0.0363751 0.12414 0.0242241
+0.0176113 0.111464 -0.0161155
+-0.0314976 0.0603384 0.0380002
+-0.0138112 0.128252 0.0219818
+-0.0603076 0.0409502 -0.0078507
+-0.0735166 0.141431 0.0469479
+0.0326456 0.111384 0.0297678
+-0.0635438 0.0341847 -0.00786744
+0.02297 0.122414 -0.00191144
+0.0401375 0.0953636 -0.00688813
+-0.0141538 0.0965092 0.052175
+-0.00422659 0.0383846 0.0124357
+-0.0311024 0.0343581 0.019624
+-0.0780471 0.153854 0.029137
+-0.0581213 0.151582 -0.000807379
+-0.0267449 0.0725846 -0.0356647
+-0.0191918 0.174184 -0.0227992
+-0.00378536 0.0798194 -0.0370348
+-0.0249464 0.0349691 -0.0199992
+-0.0564664 0.0423189 0.0186897
+0.0266976 0.119444 -0.00271582
+-0.023525 0.0349287 -0.0283944
+-0.0800951 0.15261 0.00324045
+0.0268493 0.119915 0.0267269
+0.0354747 0.0390827 0.0235255
+-0.0127812 0.17424 -0.0204206
+-0.0338617 0.168258 -0.00349456
+-0.0144845 0.0744882 0.056153
+0.0261935 0.0402752 0.032238
+0.0102706 0.0681153 -0.0309054
+-0.00974239 0.0387292 0.0290909
+-0.0644512 0.125591 0.047275
+0.010367 0.0479585 -0.0270631
+-0.0246099 0.0984431 -0.024327
+-0.0476227 0.0370311 -0.0128189
+-0.0780422 0.0846436 0.0366002
+-0.0566171 0.135321 0.0339425
+-0.0556004 0.0505584 -0.00338763
+-0.0907186 0.136468 0.0172046
+-0.0245124 0.180278 -0.0098524
+0.00742535 0.0346722 0.0416328
+-0.0699342 0.0651273 0.0236486
+-0.0124071 0.172769 -0.0198823
+-0.041856 0.149196 0.00419837
+-0.0809107 0.103235 -0.00559799
+-0.0631328 0.0335051 0.0030611
+-0.00851461 0.0647289 0.0558918
+0.0154483 0.127759 0.0239281
+0.0255922 0.123349 0.0191129
+0.0138934 0.0631004 0.0516475
+0.00118569 0.0983354 -0.0261952
+-0.0325387 0.118791 -0.011658
+-0.000757843 0.0354065 0.0103826
+-0.0248998 0.158417 -0.0112592
+-0.035233 0.0374002 -0.014964
+-0.0541243 0.156074 -0.00260128
+-0.0584646 0.0588965 0.0024905
+-0.0615294 0.0333928 -0.00373148
+-0.0602915 0.0343294 0.0347628
+0.0265767 0.0994658 0.0420977
+0.0347214 0.0712416 -0.0157876
+-0.040399 0.128703 0.00942739
+0.00251855 0.096887 -0.0286022
+-0.076485 0.148385 0.0403892
+-0.0606115 0.155938 0.0148123
+0.010878 0.0806434 0.0544608
+0.0384784 0.105492 -0.00082855
+0.0438672 0.0916755 -0.00180444
+-0.0513529 0.0733082 0.0416893
+0.0451032 0.0777437 0.000209071
+-0.0817242 0.148679 0.0369003
+0.0461375 0.0834298 0.00718398
+-0.0514739 0.135214 -0.000924577
+-0.00531173 0.100039 -0.0239686
+-0.0176147 0.042187 -0.0278695
+0.00727636 0.114035 -0.0188609
+0.0268989 0.0632714 0.044083
+0.0102735 0.0924657 -0.0299319
+0.010651 0.121836 0.0349107
+0.00895558 0.0361581 -0.0106394
+-0.0905601 0.144393 0.0275534
+0.043756 0.0467626 0.0296361
+-0.0417806 0.126404 -0.00562318
+-0.0358424 0.095771 -0.0231986
+-0.0809037 0.153834 0.0267225
+-0.0777263 0.156926 -0.0159116
+0.00417967 0.034897 0.044357
+-0.0351879 0.125718 0.0201989
+-0.0284012 0.038721 -0.0148192
+-0.0351226 0.169652 -0.0145814
+-0.0203438 0.180146 -0.0154935
+0.0345359 0.11019 -0.00473263
+-0.0932568 0.121548 0.0382795
+-0.0334767 0.152548 -0.00159465
+-0.0271731 0.174192 -0.00959576
+0.0159989 0.11444 -0.0153318
+-0.054238 0.13299 -0.00459005
+0.0366798 0.105376 -0.00582172
+0.0386277 0.0672715 0.0346845
+-0.0227209 0.162682 -0.0153632
+-0.0760409 0.0677685 0.0130189
+0.00250507 0.0772798 0.0565792
+-0.0345053 0.101515 0.0417518
+-0.0546003 0.0541349 0.0100271
+-0.000643212 0.127926 -0.00376413
+0.00284904 0.131659 0.0150261
+-0.0184884 0.186846 -0.021092
+0.0335193 0.114014 -0.000843968
+0.00632048 0.123167 -0.0106939
+-0.0564752 0.0624455 0.0290854
+-0.0138322 0.105995 -0.0224296
+0.00423384 0.0754618 -0.0348642
+-0.0281096 0.0778495 0.0450018
+-0.0776289 0.158329 -0.0159141
+0.0148253 0.0447411 0.0439981
+-0.0859023 0.122521 -0.0027014
+-0.0578481 0.0940916 -0.0211113
+0.00150378 0.0842858 0.0575429
+0.0326379 0.0849202 0.042017
+-0.0549752 0.0499938 0.0105067
+-0.0568824 0.10976 -0.0175883
+-0.00970298 0.0627929 -0.0357349
+-0.0178968 0.163686 -0.0167578
+-0.074969 0.105672 0.0364824
+0.00650677 0.0702743 0.0558788
+0.00487604 0.0992462 -0.0230983
+0.042474 0.101514 0.0131646
+-0.0643723 0.0593574 0.0120942
+0.0593748 0.0580631 0.00716733
+-0.00149842 0.111423 0.0424113
+-0.00749339 0.119159 -0.0142858
+-0.0771313 0.0754374 0.0308061
+-0.0477996 0.0869772 -0.0218762
+0.014411 0.0833733 0.0525453
+-0.0202678 0.159643 -0.00488449
+-0.0159305 0.0950186 -0.0327431
+-0.0279294 0.0931359 -0.0265478
+-0.0855021 0.102147 0.00137916
+-0.0938092 0.125562 0.0252741
+-0.058744 0.140559 -0.00481674
+-0.031677 0.126244 0.00820251
+-0.0264922 0.0447022 0.0511549
+-0.0205862 0.0382221 0.00925741
+-0.053491 0.104292 0.0408761
+-0.0370674 0.156264 -0.0103696
+-0.0634966 0.109514 0.0378318
+-0.0867621 0.084687 0.0184803
+-0.0830364 0.104646 0.028271
+0.0442212 0.0804374 0.0252067
+-0.0448473 0.0339909 -0.0230279
+-0.0037539 0.0755488 -0.0365646
+-0.0661663 0.158028 -0.0551775
+-0.0238007 0.0741774 -0.0380398
+-0.018731 0.0627665 -0.0359648
+0.0446574 0.0720977 0.0012022
+-0.0927955 0.121487 0.0416389
+-0.0620012 0.1241 0.0437622
+0.0300963 0.0995295 0.0401727
+-0.0719316 0.149607 -0.0394232
+0.0355637 0.0889227 0.0392444
+0.0493081 0.0547033 -0.00484617
+-0.0668328 0.0604514 0.0106116
+0.00304719 0.123088 -0.0105402
+-0.0255191 0.118043 0.0319974
+-0.0394865 0.115305 0.0335817
+-0.0326614 0.0592947 -0.0125392
+0.0575508 0.0523393 0.00818574
+-0.0893959 0.0942918 0.0174254
+-0.0269084 0.160002 -0.0134029
+-0.0506856 0.0345547 0.0383582
+-0.0800885 0.0739226 0.0209531
+-0.0277305 0.073972 -0.0353872
+-0.0320496 0.0849187 -0.0285721
+-0.0217999 0.0866355 0.0553929
+-0.0322022 0.0465812 -0.0258568
+-0.0442317 0.12547 0.021384
+0.0214935 0.0781932 0.0504764
+-0.0444883 0.150664 0.00744383
+-0.0303843 0.0566029 -0.0193937
+-0.0723854 0.155427 -0.0359059
+-0.0245149 0.0811097 0.0540325
+0.0189031 0.068639 0.0501604
+-0.0650109 0.041163 0.0307556
+-0.0194954 0.107168 0.0420699
+-0.0325124 0.113906 0.0343195
+-0.0544418 0.118427 -0.0131672
+-0.0536811 0.113759 -0.0162997
+-0.0559476 0.153959 0.0252069
+-0.0675391 0.124252 0.0515729
+0.0440796 0.0450784 0.0271934
+-0.0594971 0.101543 0.0424741
+-0.0184988 0.100234 0.0438197
+0.0434554 0.0790039 -0.00377815
+0.0140981 0.0343905 -0.0079847
+-0.0615105 0.0406302 -0.00752326
+0.0320683 0.0578123 0.0392046
+0.0144666 0.0962642 0.0485999
+-0.0315047 0.0631978 0.0384961
+-0.0306251 0.038441 -0.00943325
+-0.0847861 0.0804507 0.00450965
+-0.0549519 0.160962 0.00433648
+-0.0470839 0.131413 0.00333034
+-0.00104546 0.0391448 0.0323048
+-0.0526926 0.151783 0.016281
+-0.0223808 0.0958588 0.045836
+-0.0841478 0.15365 0.0123539
+0.0536189 0.0735747 0.0133449
+-0.00350831 0.0975151 -0.0292875
+-0.0571277 0.155869 0.0117051
+0.00341369 0.131576 0.0166618
+-0.0237378 0.0654511 -0.0345337
+-0.0858145 0.0991904 0.0269676
+-0.0759199 0.0783227 -0.00959072
+0.032684 0.0640121 -0.0177767
+-0.056282 0.132113 -0.00567386
+0.00328959 0.131137 0.0194851
+0.00882643 0.110931 -0.0195298
+-0.00876485 0.1716 -0.0262973
+-0.0151483 0.0405525 0.0515137
+-0.0498071 0.0343093 0.00865348
+-0.0569766 0.0339283 0.0235563
+-0.0226683 0.0381298 0.00891697
+-0.0855438 0.106245 0.00446783
+0.0454924 0.0651146 0.027904
+0.0150017 0.0576648 0.0496654
+0.00644791 0.119491 -0.0147367
+-0.0156486 0.0481142 -0.0300898
+-0.0650134 0.13537 0.0410634
+0.0113952 0.116794 -0.0158535
+0.0173388 0.0781757 0.0532571
+0.0536226 0.0587546 -0.00269037
+-0.0709897 0.0340252 0.000991695
+0.038384 0.106978 0.0241932
+-0.0385431 0.038993 -0.0286239
+-0.0451337 0.127804 0.0210049
+-0.0690676 0.152436 0.0353067
+-0.0883368 0.137775 0.00920322
+-0.0714828 0.0362083 0.00943052
+-0.0717062 0.159603 -0.040933
+-0.0255949 0.125933 0.00752005
+-0.047874 0.0346487 0.0423594
+0.0367516 0.111162 0.00316661
+-0.00949217 0.110042 0.0428369
+-0.0572015 0.0336196 0.0184714
+0.0150246 0.0392642 0.0442415
+-0.00832489 0.0993422 -0.0252442
+-0.0304761 0.0342807 0.0180201
+-0.026997 0.0382812 -0.00486026
+-0.0916784 0.144722 0.0181573
+-0.0703317 0.172249 -0.0530308
+-0.0159101 0.1643 -0.0176565
+-0.0850976 0.106195 0.00337687
+-0.035284 0.173981 -0.0126295
+-0.032733 0.155408 -0.00943888
+0.00217615 0.12934 0.0262849
+0.00123579 0.075497 -0.0355058
+-0.0332024 0.0455956 -0.0269373
+-0.0155006 0.103015 0.0432792
+0.0396392 0.106988 0.00416547
+-0.021523 0.118151 0.0342827
+-0.0184974 0.103009 0.0434402
+-0.047784 0.038449 -0.0122332
+-0.0104903 0.0604984 0.0550813
+0.0293518 0.0659692 0.0423806
+0.0185572 0.0930309 -0.0244868
+0.0173756 0.109987 -0.0165543
+-0.0865489 0.109072 0.0153468
+0.0363255 0.10537 -0.00683316
+-0.0394998 0.076195 0.0426907
+-0.0603651 0.0470889 0.0366883
+-0.0144951 0.119623 0.0361429
+0.0406661 0.105634 0.0121644
+0.0383891 0.0460848 -0.00524865
+0.0295409 0.0942529 0.0428642
+0.0373159 0.0880544 -0.0152271
+-0.0784316 0.0799342 0.0337318
+-0.0548348 0.124111 0.0382711
+0.0178682 0.0672532 0.0504022
+-0.0788979 0.123682 -0.00614143
+-0.0298552 0.0986755 -0.0232224
+-0.0771653 0.156191 -0.0114635
+-0.0923833 0.130942 0.0122392
+-0.0651094 0.121429 0.0498115
+-0.042493 0.0690949 0.0416622
+0.0416337 0.0792551 0.0303335
+0.0189066 0.0808659 0.0520326
+-0.029145 0.125694 0.0135548
+-0.0619967 0.14761 -0.00462246
+0.0255017 0.0449453 0.0383425
+-0.0925798 0.11747 0.0343056
+-0.00233027 0.0339229 -0.0220991
+0.00799401 0.0819204 0.0555296
+-0.0699548 0.147947 -0.0321477
+0.0415131 0.0394077 0.00724875
+-0.0712173 0.0846981 0.0410753
+-0.0880447 0.0874003 0.00446864
+0.00798497 0.0890814 -0.0324293
+-0.0117258 0.0656807 -0.0365783
+-0.0114796 0.112753 0.0411508
+-0.0817304 0.107364 -0.00260486
+-0.0293156 0.0820403 0.0446588
+-0.0495645 0.0375773 -0.0119604
+-0.043838 0.0956679 -0.0221641
+-0.00869681 0.129559 0.00358698
+-0.0933816 0.129671 0.0222434
+-0.0700603 0.163804 -0.0489659
+-0.00755399 0.0384559 0.0207545
+0.0159604 0.125249 0.0284184
+-0.0514974 0.0791051 0.0438079
+-0.0840796 0.0818676 0.0264914
+0.037525 0.0785071 -0.0127982
+0.0299804 0.119686 0.0179058
+-0.0638039 0.0881523 -0.0190251
+-0.0272788 0.0350567 0.0515587
+-0.00562089 0.115673 -0.0165634
+-0.0104428 0.0347186 0.0450504
+-0.0427898 0.116428 -0.015168
+0.0165768 0.126998 0.000104849
+-0.0238911 0.0738255 0.0493988
+-0.0485539 0.0376116 -0.0123218
+-0.0396922 0.0460798 -0.021311
+-0.0485652 0.0335345 -0.00306359
+0.0414749 0.104231 0.00716597
+-0.0445241 0.0409237 -0.0192998
+-0.0220397 0.0354083 0.0523916
+-0.0380711 0.0340829 0.00944176
+0.0139247 0.0348347 0.0392218
+-0.0297288 0.0335868 -0.0252735
+-0.00107263 0.0385746 0.00195199
+0.0117524 0.0352863 0.00381322
+0.0170772 0.0847646 0.051153
+-0.0656775 0.067321 -0.00750664
+-0.00543271 0.0918052 -0.0353894
+0.0133691 0.0343357 -0.00620151
+0.0451372 0.0875619 0.0011816
+0.0503362 0.0703636 0.0239238
+-0.0474927 0.0804818 0.0437565
+-0.00542063 0.0391587 0.0349931
+0.00193935 0.03568 -0.0153447
+-0.0774115 0.160346 -0.0169397
+0.049877 0.0727457 0.00893584
+-0.0640788 0.0598458 0.0171155
+-0.00650105 0.0472142 0.0482843
+-0.0241121 0.163789 -0.0160029
+-0.0173263 0.0611887 0.051725
+0.0171559 0.100271 -0.022436
+-0.0604932 0.155795 0.0206537
+-0.0609595 0.142497 0.0365005
+-0.0668489 0.0966702 -0.0167929
+-0.0149394 0.183104 -0.021718
+-0.0321779 0.0750041 -0.0285287
+-0.0226305 0.0710127 0.0496427
+0.0463117 0.0820487 0.00917902
+-0.0795939 0.112319 0.0461682
+-0.0658419 0.0995396 -0.0165139
+-0.0810165 0.134048 0.0507919
+-0.0486855 0.131027 0.0278379
+-0.0788429 0.112725 -0.00283498
+-0.0784933 0.0832425 0.0356821
+-0.0258381 0.0781035 0.0498012
+0.0426426 0.0858997 0.0283401
+-0.0677549 0.154168 0.0312275
+-0.0306743 0.0383989 -0.00386137
+-0.0857757 0.0926386 -0.000557841
+-0.0210104 0.0417331 0.053591
+0.0161529 0.100264 -0.0224296
+0.0387814 0.0821002 0.0350599
+0.0484193 0.0639761 -0.00211304
+-0.0858985 0.111778 0.0253403
+-0.0389634 0.128304 0.0114309
+-0.0634823 0.0352819 -0.00824664
+0.0395163 0.0646366 -0.0087647
+-0.0591064 0.0435686 0.0148077
+0.00621882 0.12419 0.0335647
+-0.0171539 0.0347559 0.0453522
+-0.0314811 0.0546225 0.0370229
+-0.0182701 0.114743 -0.017523
+-0.0605388 0.141029 0.0353291
+-0.063605 0.126943 0.0449774
+-0.03749 0.0533987 0.0390423
+-0.0573191 0.0507885 0.00568774
+-0.0424884 0.109818 0.0380938
+-0.082569 0.0790202 0.0265184
+-0.0653913 0.0757553 0.0400472
+-0.0105137 0.0589924 0.0541839
+0.0198393 0.0700116 0.0497622
+-0.0814721 0.135361 0.0497671
+0.00809889 0.111578 -0.0196036
+-0.0276072 0.038217 0.0294729
+-0.0647783 0.173212 -0.0488362
+-0.0760415 0.0675654 0.00655947
+-0.0322855 0.0610195 -0.0154117
+-0.00948933 0.0674612 0.0553354
+-0.0922478 0.11733 0.00930597
+0.0325339 0.116751 0.00316678
+-0.0788837 0.117794 -0.00533035
+0.0177807 0.10571 -0.0179484
+-0.0648315 0.0895741 -0.0187043
+-0.0303114 0.0384164 -0.0075003
+-0.0728418 0.0685704 -0.00149472
+0.0396278 0.103602 -0.00160767
+-0.0575003 0.109781 0.0378101
+-0.0359224 0.034124 0.026018
+-0.0230844 0.126658 0.00843513
+-0.0904612 0.131068 0.0382266
+-0.0782718 0.165861 -0.029036
+0.0284552 0.0607955 -0.0208488
+-0.0495337 0.163976 0.00447865
+-0.0665318 0.134006 0.0442059
+-0.0622043 0.0590015 0.0092504
+0.0124693 0.0962821 0.0494059
+0.0199668 0.115907 -0.0129188
+-0.0101559 0.0386047 0.027311
+-0.0224495 0.0580629 0.0442448
+-0.0768471 0.09916 -0.0110394
+-0.0438495 0.0999429 -0.0214407
+-0.0642587 0.173261 -0.0500973
+-0.0291541 0.123106 -0.00418201
+-0.0785185 0.16527 -0.0289621
+-0.0773807 0.0774654 0.0325309
+0.0184997 0.0892768 0.0486726
+-0.0147168 0.0628748 -0.03682
+0.0133075 0.062355 -0.0296823
+0.0174899 0.111215 0.038757
+-0.0829923 0.130939 -0.00341376
+-0.0749763 0.152739 -0.0169005
+-0.00979029 0.0798633 -0.0379189
+-0.0243904 0.183518 -0.0110527
+0.0382626 0.0899111 -0.0131489
+0.0353274 0.107617 -0.00596632
+-0.0649093 0.06918 0.0352438
+0.0545625 0.0595427 0.0278248
+-0.0664402 0.128427 0.0478848
+0.0302544 0.035019 0.00964843
+-0.0212084 0.186026 -0.0155815
+-0.00559653 0.0391515 -0.0257085
+-0.00382316 0.0854518 -0.0372434
+0.0556932 0.0688929 0.00299188
+0.0435925 0.0958855 0.00119521
+-0.061875 0.156868 -0.0195857
+-0.0283944 0.174224 -0.00779385
+0.000326986 0.131385 0.00837406
+0.0583787 0.0621209 0.00318289
+0.0262357 0.0740751 0.0449841
+-0.0747322 0.0729443 0.0316828
+-0.0650821 0.148822 -0.0290175
+-0.0436469 0.0601588 0.0398932
+0.0443703 0.0410834 0.0161644
+-0.0674507 0.155183 -0.000720573
+-0.0165017 0.177176 -0.0187481
+0.0352588 0.0755049 -0.0148105
+0.00551455 0.110936 0.0415028
+0.0248664 0.0898261 -0.023121
+0.00550646 0.078617 0.0558754
+-0.0698407 0.127049 0.051763
+-0.0375072 0.123454 -0.00854988
+-0.052616 0.0657163 0.0355847
+-0.0748963 0.0690517 0.0244939
+0.023431 0.11936 -0.00662051
+-0.0185076 0.120924 0.0327413
+0.0394332 0.101324 0.027167
+-0.00864992 0.124983 -0.00848236
+-0.0872247 0.152479 0.0216964
+-0.0215688 0.0623472 0.0460467
+-0.0475797 0.035695 0.0449374
+-0.0510737 0.151654 -0.00393732
+-0.0415 0.0930514 0.0423592
+-0.0544965 0.100156 0.0427594
+0.049267 0.0717276 0.00605578
+0.0292141 0.0815364 -0.0209002
+-0.0052585 0.095242 -0.0329133
+0.0151527 0.129419 0.0109697
+-0.0294996 0.100187 0.0432585
+0.0363367 0.0432226 0.0290731
+0.0327757 0.035977 0.0148418
+0.00349523 0.0427434 0.0456833
+0.046121 0.0848311 0.00917504
+-0.067462 0.157723 -0.00658264
+-0.0876012 0.0995367 0.00546504
+-0.0356487 0.0352259 -0.0310792
+-0.0585981 0.0658974 0.0341563
+-0.0639239 0.116652 -0.0103062
+-0.0525394 0.0472909 -0.00733632
+-0.0398304 0.034299 0.0303636
+0.0252131 0.0803965 -0.024704
+-0.0721022 0.165224 -0.0439746
+-0.058758 0.148538 -0.00150368
+-0.0625812 0.150647 -0.00957658
+-0.0878641 0.137757 0.00720039
+0.0109534 0.0475021 0.0472035
+-0.0699012 0.105141 -0.0130553
+0.0318353 0.0540522 -0.0127622
+-0.0866591 0.107689 0.0123597
+0.0552547 0.0595292 0.0270628
+0.0320484 0.11465 0.0272407
+0.0433462 0.0818009 -0.00379375
+-0.0294668 0.176906 -0.0160057
+-0.0169961 0.094658 0.0531741
+-0.0202578 0.0596247 0.0476545
+-0.0798939 0.123658 -0.00558813
+0.0482025 0.0703533 0.0231278
+-0.0206189 0.186125 -0.0151754
+0.0100127 0.0349584 -0.0111996
+-0.0661914 0.152591 -0.0424622
+-0.0478408 0.098515 -0.0219326
+0.026913 0.0619271 0.0440949
+-0.0328507 0.126562 0.0151396
+-0.0689146 0.108019 -0.0123122
+-0.00583756 0.0390351 0.0332216
+-0.0125377 0.0365668 -0.017148
+-0.0373858 0.0446552 0.0411638
+-0.0759006 0.161818 -0.014334
+0.0304033 0.107421 -0.0117891
+-0.0654084 0.175187 -0.050486
+-0.0633716 0.143922 0.0382956
+0.0194957 0.0920261 0.0477827
+-0.0288404 0.0972702 -0.0238091
+-0.00475508 0.0741241 -0.036385
+-0.0104985 0.0362063 -0.0254961
+-0.0625516 0.147537 -0.0115723
+-0.0816708 0.0869142 -0.00660013
+-0.00823999 0.130343 0.0167173
+-0.0809733 0.130966 -0.00434035
+-0.0437659 0.0811743 -0.0201658
+0.00743904 0.129465 0.0253135
+-0.00451238 0.0760575 0.0586977
+0.0302883 0.103408 0.0369471
+-0.0379006 0.151906 -0.00621808
+-0.00550346 0.076042 0.0585145
+-0.0217032 0.0597401 -0.0334972
+-0.0868755 0.112781 0.0262639
+-0.0336701 0.155604 -0.00983793
+-0.0126927 0.0599517 -0.0357172
+-0.0638978 0.150075 -0.0288161
+-0.0144059 0.112046 -0.0186792
+-0.00421023 0.0383902 0.0178766
+-0.0453052 0.113634 -0.0162273
+0.0147972 0.102084 -0.0220848
+-0.0484999 0.105649 0.0400819
+0.0216294 0.0875507 0.0490393
+-0.0124184 0.175705 -0.0216387
+-0.0328373 0.163842 -0.00376818
+-0.0666614 0.0672261 -0.0064803
+-0.0395052 0.119385 0.0302298
+-0.0489243 0.0675117 0.0383488
+-0.0552807 0.0343936 0.0305403
+0.00553119 0.0603997 0.0554086
+-0.0914264 0.14884 0.0201323
+0.0231929 0.110938 -0.0135659
+-0.065154 0.164972 -0.0244937
+-0.050496 0.074792 0.0427038
+-0.0657515 0.154274 -0.0462128
+-0.0343486 0.0367995 -0.0305331
+-0.0826303 0.103323 0.0293175
+-0.0597443 0.0338929 0.0194732
+-0.0425056 0.0591222 0.0401769
+-0.0743438 0.156862 -0.0249223
+-0.00222977 0.0396912 0.0474006
+-0.00562206 0.0388337 0.0298422
+-0.0338556 0.0723894 -0.0214737
+-0.0635465 0.0333817 0.00128463
+-0.0330138 0.0356955 0.0305887
+-0.0730865 0.16659 -0.0202232
+-0.0570856 0.153101 -0.000954757
+0.0275543 0.0960379 -0.019637
+-0.0229677 0.169763 -0.0123298
+0.0217819 0.106251 -0.0165369
+-0.0575003 0.0630187 0.0298519
+-0.00864981 0.171144 -0.0247734
+-0.053919 0.0587242 -0.00741756
+-0.0595 0.105675 0.0404663
+0.0351077 0.0740897 -0.0147891
+-0.0620479 0.155306 -0.016587
+0.0278721 0.0522836 -0.0197543
+0.0325208 0.0469245 0.0310812
+-0.06629 0.139698 0.0427919
+-0.078132 0.172939 -0.0407193
+-0.0294988 0.0559628 0.0364214
+-0.0374897 0.0562507 0.0395531
+-0.0662219 0.155662 0.00991681
+-0.0408786 0.0346362 0.0386374
+-0.0208999 0.185581 -0.0139755
+-0.0330517 0.0624982 -0.0144201
+-0.0767419 0.164619 -0.0220172
+-0.0697905 0.0865423 -0.0170841
+-0.0784816 0.0755217 0.0287043
+0.0172033 0.118701 -0.0119316
+-0.0185134 0.0473863 0.05026
+0.00729554 0.0653986 -0.0323322
+-0.0415011 0.0506114 0.0394281
+-0.0541424 0.033642 0.0190888
+-0.0921005 0.132392 0.0222257
+-0.0136741 0.0384938 0.00315386
+-0.0383322 0.163825 0.00056966
+-0.0762889 0.0738479 0.0305832
+-0.0875285 0.133568 0.00229932
+-0.0736181 0.0688668 0.0266732
+0.02687 0.0981666 0.0425225
+-0.051308 0.153569 0.0116824
+4.86222e-05 0.11836 -0.0154829
+-0.0517937 0.0583908 0.0296448
+0.0605105 0.0595417 0.010156
+-0.0573945 0.0371513 -0.0102727
+0.00965733 0.0345667 0.0223294
+0.0463647 0.0703187 0.00350637
+-0.0625718 0.1468 0.0377209
+-0.089178 0.137924 0.0381661
+-0.0134956 0.0759117 0.0568004
+-0.00574286 0.0755721 -0.037104
+0.0261865 0.123233 0.0107875
+-0.0580499 0.11553 -0.0140963
+-0.00762589 0.0451743 -0.028662
+0.0535357 0.0635428 0.028124
+-0.0718987 0.123811 -0.00847645
+-0.0635357 0.119961 0.0469254
+0.00211859 0.130671 0.0219319
+0.00252859 0.0358017 0.021576
+0.0527591 0.0693467 0.00250314
+-0.0451218 0.0335948 -0.0116042
+-0.0769111 0.100434 -0.0105662
+0.0223237 0.0564658 -0.026195
+0.0394644 0.107011 0.0181712
+-0.0776021 0.0994637 0.0357144
+-0.0632381 0.170981 -0.0495819
+-0.00862433 0.122038 -0.0113292
+-0.0548269 0.0450002 0.0157095
+-0.0506815 0.134691 -0.000340536
+-0.0495888 0.146296 0.0105853
+-0.00908464 0.173025 -0.027717
+-0.00410488 0.0346022 0.0429088
+-0.0260906 0.0386266 -0.0124061
+0.0283176 0.118208 -0.00273298
+-0.0318098 0.121167 -0.00811427
+-0.0737276 0.154081 -0.027902
+0.0162665 0.119939 -0.0112703
+-0.0270805 0.0349584 0.0482667
+-0.0284917 0.101554 0.0428228
+-0.0249764 0.159657 -0.0011434
+-0.0585904 0.142433 0.0328417
+-0.0486888 0.138617 0.0104009
+-0.0234979 0.0724108 0.049066
+-0.019247 0.158526 -0.00845424
+-0.0716194 0.0382939 0.000706648
+-0.0412769 0.0356814 0.042879
+0.0483353 0.0532726 -0.00489034
+0.0606695 0.0664968 0.0121468
+-0.069489 0.104131 0.0386578
+0.00750734 0.0990008 0.0480837
+-0.0624532 0.126929 0.0430601
+-0.0629568 0.15367 -0.0336031
+-0.0374985 0.0747273 0.041938
+0.0426086 0.0930422 0.0261716
+-0.0849422 0.153595 0.0209155
+-0.0543959 0.12661 -0.00573734
+-0.0742502 0.161028 -0.0329547
+-0.0627767 0.112367 0.0371562
+-0.0532977 0.158553 0.00873827
+-0.0769168 0.123731 -0.00719316
+0.0393533 0.0847596 0.0341247
+-0.0692244 0.15634 0.0190049
+0.0343018 0.0936044 -0.01506
+-0.0165008 0.0800909 0.0572191
+-0.014166 0.184338 -0.0242563
+-0.0631574 0.159924 -0.0465929
+-0.0374857 0.0519831 0.0389557
+0.03646 0.112262 0.0117392
+-0.0411413 0.0364371 -0.0278037
+0.0185712 0.126949 0.0207922
+-0.0603223 0.0385556 0.0217181
+-0.0769591 0.131054 -0.00672048
+-0.0295123 0.0565107 -0.0214026
+0.0430875 0.0930739 0.0251589
+-0.00582403 0.0390405 -0.0106025
+-0.0553855 0.0337802 0.0222515
+0.014479 0.100435 0.047468
+-0.0548752 0.0984577 -0.0213117
+-0.0501571 0.0529434 0.0176286
+0.0183573 0.0461568 -0.0227219
+-0.0554809 0.0440191 0.0450323
+-0.0877934 0.0860475 0.0044818
+0.00321463 0.130705 0.0223233
+-0.0505315 0.0389504 -0.011562
+-0.0819835 0.132406 -0.00340088
+-0.0758067 0.0877331 -0.0139103
+-0.091338 0.14476 0.0251578
+-0.0649682 0.034557 0.0300942
+-0.0283013 0.113756 -0.016413
+0.0259713 0.0619044 0.0444933
+-0.0535159 0.0640852 0.0330775
+-0.0046427 0.0482096 -0.0303136
+-0.0584956 0.0861498 0.0443498
+-0.0655423 0.145055 -0.0169033
+-0.0423586 0.123855 0.0235885
+-0.0864234 0.0806346 0.0145003
+-0.033107 0.125984 0.00180258
+0.000400525 0.0433705 -0.0249688
+-0.0337351 0.126905 0.0148106
+0.0594437 0.0677773 0.0191638
+-0.0433018 0.0342732 -0.0267127
+-0.0668634 0.040937 0.011312
+-0.0651408 0.146773 0.0392721
+0.0142259 0.080787 -0.0303234
+-0.0564981 0.0973554 0.0431547
+0.0234826 0.113521 -0.012343
+-0.022737 0.0385766 -0.00982941
+-0.0695434 0.0352232 -0.00418951
+0.060768 0.0651161 0.0111484
+-0.00338536 0.100168 0.0483773
+-0.0154942 0.0772732 0.0564359
+-0.0581438 0.114319 -0.0148345
+-0.0758612 0.165153 -0.0370257
+-0.0666041 0.164889 -0.0207192
+-0.0401309 0.160681 -0.0117333
+-0.00727995 0.0389199 -0.00704692
+-0.0726288 0.07489 0.035733
+0.0572537 0.0657957 0.00220085
+-0.0564793 0.151056 0.0307055
+-0.0459743 0.153608 0.00885524
+-0.046245 0.034596 0.0410145
+-0.0611658 0.168359 -0.0606871
+-0.0242347 0.0401682 0.0541848
+0.0432765 0.10012 0.00816425
+0.0330202 0.102118 0.0356213
+-0.00368236 0.0583856 -0.0334327
+-0.016783 0.0973001 -0.0271368
+0.018711 0.100467 -0.0223545
+-0.0500289 0.122604 0.03284
+-0.063243 0.0333437 -0.00222576
+-0.0187202 0.0613304 -0.0355606
+-0.0268504 0.0548324 -0.0264063
+0.0215374 0.086463 -0.0256391
+-0.0138967 0.099791 -0.0237429
+-0.00550708 0.0774167 0.0583085
+0.055466 0.0507517 0.00421414
+0.00822806 0.0344179 0.00390084
+0.028423 0.0535254 0.0391477
+-0.00689074 0.103109 -0.0232386
+-0.0320031 0.0370471 -0.0177181
+-0.0255422 0.0377889 0.0158759
+-0.0476682 0.165409 0.0039929
+-0.0673807 0.115762 0.049991
+0.00348136 0.111402 0.0420175
+-0.081586 0.0734778 0.0135382
+0.0427229 0.10007 0.00318201
+-0.0456223 0.0548403 -0.0108081
+-0.0226179 0.0464363 -0.0275647
+-0.0201905 0.172698 -0.0217858
+0.0374948 0.0941477 0.0350502
+0.0227469 0.0686119 0.0468992
+-0.012216 0.174205 -0.0276647
+-0.0906322 0.112714 0.0163744
+-0.0599044 0.111127 -0.0158584
+0.00535116 0.0480874 -0.0284111
+-0.0295604 0.158116 0.000994125
+0.0104513 0.122961 -0.0105071
+-0.0619452 0.123832 -0.00870252
+0.00605345 0.0341614 0.00369541
+-0.0696099 0.138316 0.0468524
+0.00349102 0.11963 0.0373483
+-0.0495577 0.0338416 0.0269497
+-0.0500211 0.0529295 0.0155558
+-0.0534917 0.0491191 0.0286591
+0.0546976 0.0478581 0.0131951
+-0.0803392 0.0841108 -0.00756769
+-0.0693719 0.180628 -0.057909
+-0.0247145 0.161052 -0.00252569
+0.0299408 0.0713176 0.0415086
+-0.0779905 0.173544 -0.0470087
+-0.0168218 0.086916 -0.0386596
+-0.0658968 0.109505 -0.0131657
+0.0326969 0.10609 0.0333845
+0.0191388 0.0356129 -0.00667825
+-0.0168818 0.100112 -0.0240537
+-0.0620293 0.135502 -0.00717407
+0.0377405 0.110012 0.0179226
+0.0360001 0.0381146 0.00239588
+-0.0151683 0.160834 -0.010917
+-0.0894324 0.117571 0.0455052
+0.0402874 0.063301 -0.00576463
+0.000231956 0.0755133 -0.0357459
+-0.0663652 0.0422587 0.0107808
+-0.0908359 0.114163 0.0368153
+0.0456753 0.0833922 0.00418733
+-0.0426429 0.0563425 -0.0115708
+-0.0472127 0.168412 -0.001987
+0.0163989 0.0433061 -0.0232691
+-0.0181224 0.165314 -0.018178
+0.014203 0.08785 -0.0301032
+0.00716038 0.0832586 0.0561062
+0.0547452 0.0661481 0.0263648
+0.0207672 0.0700064 0.0493524
+-0.0820552 0.1102 0.0401793
+0.0336664 0.0753805 -0.0167583
+-0.0827158 0.108829 0.000295564
+0.0250546 0.0420912 0.0376641
+-0.0866523 0.0868042 0.0239447
+-0.082018 0.151309 0.00327526
+0.0209029 0.107601 -0.0159886
+-0.0134952 0.0659366 0.0537869
+-0.0902062 0.143054 0.0286714
+0.0484774 0.0431365 0.00824398
+0.00679595 0.0352467 -0.0139815
+0.0154 0.0448131 -0.0240573
+-0.0715189 0.0972122 0.0409969
+0.0152962 0.0652155 -0.0297912
+0.0106046 0.128135 -0.0020835
+0.0273536 0.106086 0.0379553
+-0.0176729 0.0540415 -0.0325983
+-0.00110521 0.131378 0.0121444
+-0.0724827 0.124619 0.0532114
+-0.0738593 0.174047 -0.0391959
+-0.0646169 0.109762 0.0377795
+0.00521659 0.0824462 -0.0340286
+-0.0280135 0.0591603 -0.0264206
+-0.0676617 0.0433934 0.000689977
+0.0407264 0.0999947 0.0251764
+-0.0322885 0.177691 -0.00536129
+-0.0547546 0.035972 0.0465789
+-0.0425002 0.115266 0.0336474
+-0.0687451 0.0708436 0.0347552
+-0.0375019 0.0804666 0.0432825
+-0.0182946 0.181579 -0.0243778
+-0.0789826 0.115456 0.0491224
+-0.0415063 0.0534301 0.0394734
+-0.0708913 0.0403263 0.00282802
+-0.0548298 0.0927311 -0.0220321
+-0.0745142 0.138634 0.0488155
+-0.0807745 0.102028 0.0317433
+-0.0249646 0.181509 -0.0170525
+-0.0727415 0.154031 -0.0358995
+-0.0698172 0.0908437 -0.0164973
+-0.0366476 0.0577363 -0.0111372
+-0.0192308 0.0947234 -0.0324688
+-0.0118669 0.165326 -0.0197278
+-0.0804375 0.137229 0.0490949
+0.0134351 0.129972 0.01319
+0.0457654 0.0791979 0.00319646
+-0.0469166 0.129554 0.0250362
+-0.0581769 0.137607 -0.00562722
+0.04256 0.0817421 -0.00578018
+-0.0478101 0.0884245 -0.0219224
+-0.0424147 0.0344885 0.0314161
+-0.0645764 0.139638 0.0400104
+0.00451352 0.10035 0.0463879
+0.0423459 0.0915624 -0.00580854
+-0.0833163 0.106091 -0.000625527
+-0.0510681 0.0429687 0.0449412
+-0.0258019 0.0564099 0.0391373
+-0.0908661 0.142018 0.0261694
+-0.0222707 0.180155 -0.0129798
+-0.0375032 0.0987213 0.042382
+-0.0135516 0.0445689 0.0502862
+-0.0749157 0.0818909 0.0378096
+-0.042351 0.0336287 -0.0184783
+-0.0104895 0.0660607 0.0552117
+-0.0713722 0.163817 -0.0449613
+-0.0170629 0.040485 0.0522671
+-0.0629502 0.151043 -0.0063137
+-0.0420636 0.159404 0.00394669
+-0.0438717 0.105649 -0.0205239
+0.00352724 0.10161 0.0446753
+-0.00861199 0.118019 -0.01506
+-0.0658335 0.0881117 -0.0184537
+0.00251222 0.126485 0.0307749
+-0.0485567 0.0390246 -0.0119389
+-0.0600846 0.0399274 0.0217122
+0.0128427 0.034706 0.0391137
+-0.0306178 0.0409006 -0.0300462
+-0.0635449 0.0356868 -0.00823988
+-0.0063607 0.125295 -0.00886018
+-0.025376 0.059259 0.0400414
+0.0015066 0.0490028 0.0513272
+-0.0107915 0.0798668 -0.0380291
+0.0455381 0.0540654 0.0323771
+-0.0645999 0.0347243 0.0265296
+-0.074389 0.0874223 0.0399149
+0.0147945 0.0909396 -0.0283095
+-0.0256418 0.0382997 -0.00275652
+-0.0249427 0.17123 -0.0116584
+-0.0860007 0.147303 0.0341634
+-0.00989368 0.129282 0.00314288
+-0.056803 0.119986 -0.0107265
+0.0131837 0.129339 0.0031365
+0.0204173 0.0925165 -0.0239466
+-0.0881399 0.122604 0.000302573
+-0.0687931 0.166618 -0.053004
+-0.0116307 0.0337076 -0.023716
+-0.0395047 0.0776369 0.0429957
+-0.0435015 0.086056 0.04322
+0.0313221 0.0899509 -0.0192278
+-0.0512591 0.0544504 0.0206222
+0.0450165 0.0718833 0.00186291
+-0.0240342 0.0381218 0.00683415
+-0.0643335 0.153058 -0.000307605
+-0.0553413 0.0491317 -0.00437815
+0.0461434 0.0834347 0.0111711
+0.0469552 0.0427274 0.0188429
+0.0403147 0.061632 0.0300225
+-0.0345217 0.127119 0.00425139
+-0.0560415 0.0335011 -0.000906542
+0.0458803 0.0848141 0.013166
+0.0355169 0.0713149 -0.0148173
+-0.00649249 0.0978569 0.0522238
+-0.0720202 0.152598 -0.0428872
+0.00936768 0.0509673 -0.0289075
+-0.017803 0.0813337 -0.0391893
+-0.0164921 0.101629 0.0439544
+-0.0749763 0.136928 -0.00646616
+-0.018438 0.165372 -0.011068
+-0.0749694 0.0749712 0.0333987
+-0.0344916 0.0547205 0.0381399
+-0.0252176 0.0351344 0.0519405
+-0.0785113 0.10447 -0.00758869
+-0.0837382 0.0804711 0.0245022
+0.0352492 0.043109 0.0289456
+-0.0657408 0.0353871 0.0379044
+-0.0633722 0.04322 0.0387983
+0.0187703 0.0504962 0.0444745
+0.0134519 0.128957 0.00181284
+0.00181742 0.106617 -0.0209271
+-0.069971 0.156225 0.0143836
+-0.0793623 0.0739499 0.024599
+0.0192573 0.0903239 -0.0256184
+-0.0785673 0.0716608 0.0214639
+0.0207235 0.123161 0.0287274
+-0.0694864 0.116115 0.0518347
+-0.022007 0.0754165 0.0531212
+0.00541958 0.0361021 -0.0235849
+0.0126937 0.0345417 0.0229719
+-0.0272554 0.0377383 0.0173779
+0.0183414 0.126234 0.023568
+-0.0782171 0.159705 -0.021925
+0.0319954 0.11684 0.00152318
+-0.0364949 0.0747255 0.0419725
+-0.00631217 0.0422986 0.0485312
+-0.0696892 0.0733745 -0.0120577
+-0.0574743 0.0452883 0.0435332
+0.0270163 0.115378 0.0322111
+0.0100342 0.126121 -0.00591235
+-0.0765631 0.160404 -0.0136187
+0.0104935 0.0976882 0.0488434
+-0.088546 0.102334 0.0113879
+-0.0488628 0.0600536 0.0351294
+-0.0102645 0.038442 0.0220215
+-0.0471272 0.159118 -0.00765489
+0.0282711 0.0480264 -0.0137299
+0.0106928 0.0341923 -0.0160349
+-0.0413207 0.122297 -0.0113384
+-0.0112299 0.173502 -0.0278641
+-0.0702692 0.146349 -0.0238997
+-0.0311686 0.0820079 -0.0315681
+-0.058698 0.0349789 0.0448461
+0.0225489 0.0444802 -0.0157666
+0.00650352 0.0547197 0.0529464
+0.0375985 0.10834 0.0241868
+0.026474 0.110098 0.0367031
+0.0104332 0.0344417 -0.0125223
+-0.00834994 0.0943471 -0.0340215
+-0.0726673 0.155437 -0.0339106
+-0.0830075 0.0762889 0.0105229
+-0.0846192 0.0805533 0.0214764
+-0.0805239 0.148418 0.0381727
+-0.087237 0.106355 0.0143591
+-0.0447805 0.0423866 -0.0153071
+-0.0837301 0.147364 0.00414541
+-0.0832136 0.0770175 0.0194025
+-0.0259181 0.0649186 0.0404266
+0.0449079 0.0931824 0.0151569
+0.0348585 0.0808647 0.0399076
+-0.000497657 0.066177 0.0565989
+-0.081976 0.138997 -0.000769762
+-0.0164973 0.088378 0.056467
+-0.0655061 0.041163 -0.00538315
+0.0250139 0.0449606 -0.012685
+-0.0684343 0.0667749 -0.00454154
+0.0313723 0.0597573 -0.0175925
+-0.073748 0.0805288 0.0380979
+-0.0431166 0.0378307 0.0441123
+-0.0704863 0.169511 -0.0510127
+-0.0418064 0.0884466 -0.0220226
+-0.0725566 0.0737794 0.034925
+-0.0432285 0.12305 0.0247373
+0.0537086 0.0670896 0.000808459
+-0.0318715 0.0510682 0.0382665
+0.00533718 0.124533 0.0332195
+-0.0234982 0.0988724 0.0447778
+-0.0873895 0.143261 0.0370491
+0.0450408 0.0625178 -0.00265494
+-0.0618764 0.138649 -0.0067701
+-0.0637266 0.174609 -0.0527846
+-0.0739864 0.158247 -0.0289285
+-0.0616651 0.174109 -0.0575903
+-0.0346424 0.0780819 -0.0225024
+-0.0310543 0.0337173 -0.0219116
+-0.0769455 0.154831 -0.00883158
+-0.0339952 0.0752026 -0.0244888
+0.0354333 0.111001 -0.000827134
+-0.0790203 0.0935614 -0.0105962
+-0.0879913 0.136375 0.00520661
+-0.0582272 0.048399 0.00675942
+-0.00714757 0.130278 0.00704353
+0.0114556 0.0340617 0.001148
+0.0458421 0.0876102 0.0101629
+0.00312017 0.129984 5.00643e-07
+-0.0376568 0.0591992 -0.0116433
+0.00923557 0.129984 0.00166977
+-0.0579608 0.139021 -0.00516612
+-0.0909934 0.148856 0.0221303
+-0.0611919 0.0341824 0.0259657
+-0.0917869 0.115969 0.00931507
+0.00445187 0.116712 -0.0177471
+0.00711096 0.111601 -0.019782
+-0.00341693 0.115827 -0.0167447
+0.0411288 0.0792971 0.0313687
+-0.0358185 0.0337288 -0.0209957
+-0.0304972 0.0703216 0.0396594
+-0.076218 0.0887607 0.0388797
+-0.0701244 0.0632147 0.00385793
+0.0432229 0.0888059 -0.00480108
+-0.0321931 0.123411 -0.0044713
+0.0221624 0.0959197 -0.0219723
+0.0234605 0.0367801 -0.00165856
+-0.0234711 0.183379 -0.010712
+-0.0461137 0.0368295 -0.0192985
+0.023814 0.119372 0.031074
+-0.0617151 0.0722545 -0.0157777
+-0.0697425 0.164473 -0.0161193
+-0.0700395 0.077854 0.0390736
+-0.0793237 0.108591 -0.00458021
+-0.0622625 0.155951 0.0127725
+-0.0579896 0.126711 -0.00710506
+-0.0819874 0.0788394 -0.00151395
+-0.051802 0.111349 -0.0178923
+-0.0548009 0.0547174 0.00969263
+0.0456361 0.0819814 0.00319705
+-0.0362696 0.0447516 0.0428152
+-0.0678285 0.156225 0.0151421
+-0.0441012 0.15765 -0.00916962
+-0.0698712 0.102299 -0.0142744
+-0.0434973 0.0719505 0.0423325
+-0.0385101 0.124563 -0.00772445
+-0.0720478 0.154003 -0.0409023
+-0.0415192 0.155101 0.00654483
+0.030443 0.0496674 -0.00974777
+0.0100263 0.0352289 0.0272451
+-0.0657931 0.0349145 0.0296068
+-0.00453349 0.0975685 -0.029357
+-0.0575464 0.0576229 0.00774375
+-0.0675655 0.156308 0.0210392
+-0.0625478 0.177823 -0.0603383
+-0.0164994 0.107189 0.0421238
+-0.0628199 0.164682 -0.0345962
+-0.0725695 0.162422 -0.0399552
+-0.0295698 0.0377598 0.0258888
+-0.0285577 0.048864 -0.0238529
+-0.051128 0.0487627 0.0151791
+0.0297172 0.11319 -0.0079908
+-0.0129858 0.0389757 -0.0119758
+-0.0519687 0.0514416 0.0131188
+0.00659366 0.0345497 0.005308
+0.0431201 0.0959054 0.0231686
+0.0426395 0.101487 0.00716583
+-0.0326038 0.039499 -0.0302708
+-0.022273 0.0879769 0.0544159
+-0.0501719 0.132485 0.029178
+-0.0104724 0.123683 0.0330383
+0.0158783 0.103153 -0.0212298
+-0.0380583 0.0406922 0.0433465
+-0.05672 0.0341106 -0.0113244
+0.00284082 0.0994342 -0.0233056
+-0.00189869 0.037664 0.017192
+0.00849573 0.122392 0.0350922
+-0.0911887 0.13375 0.0222165
+0.0145889 0.124413 0.0307966
+0.0365837 0.0686678 0.0370221
+0.00534141 0.0341316 0.016402
+-0.0652159 0.16242 -0.0585196
+-0.0708983 0.120893 -0.00865195
+-0.0790974 0.103427 0.0328545
+-0.0233223 0.0386973 -0.0137829
+-0.0870669 0.0909973 0.0256595
+-0.0237781 0.0389651 0.0367703
+-0.0314981 0.107032 0.0395669
+-0.0488684 0.125064 -0.00815774
+0.0188255 0.104686 -0.0188612
+-0.0214383 0.162534 -0.00657802
+-0.0923673 0.124202 0.041188
+-0.0116952 0.0383509 0.0145738
+-0.0933085 0.117399 0.0213072
+0.00147085 0.0388322 0.0258794
+0.041327 0.0986069 0.0251647
+-0.063339 0.160302 -0.0538579
+0.0235731 0.114695 -0.0116124
+-0.0828981 0.101969 0.02963
+-0.0616452 0.139553 0.0354433
+-0.0343725 0.0357923 0.047703
+-0.0451209 0.0377458 0.0446873
+-0.0920088 0.118668 0.00830639
+-0.0495672 0.135498 0.00241956
+-0.0603606 0.0633645 0.0289482
+-0.067238 0.175347 -0.0588701
+0.053058 0.0705565 0.0234346
+0.0380671 0.0821074 0.0357563
+-0.0797544 0.0720045 0.0191472
+-0.0844521 0.153452 0.0225801
+-0.0749035 0.113464 -0.00617122
+-0.0384926 0.0605846 0.0409778
+-0.075255 0.0832856 0.0380964
+-0.0198342 0.0855003 -0.0383524
+-0.0649244 0.113824 -0.0119395
+0.0421 0.0690665 -0.00478535
+-0.0615968 0.0595411 0.0052883
+0.0357976 0.0378059 0.0192762
+-0.0314223 0.0343059 -0.0206653
+-0.0805979 0.0786983 -0.00455339
+-0.0516467 0.0481272 0.0388737
+-0.0325014 0.0618008 0.0386259
+0.0188656 0.11384 -0.0146811
+0.0360105 0.106014 0.0293761
+-0.0489136 0.125469 0.0310273
+-0.0702125 0.173659 -0.0540385
+0.0100557 0.112263 -0.0189498
+-0.0643724 0.0341771 0.0147182
+-0.023212 0.165344 -0.00918469
+0.059734 0.0692161 0.0111359
+0.0164747 0.104398 0.044527
+-0.0870127 0.10633 0.011369
+0.030786 0.0765476 -0.0208061
+-0.0657333 0.121445 0.0506733
+-0.00450341 0.0703715 0.0573471
+-0.0525943 0.0544911 -0.00726112
+-0.0226202 0.181624 -0.0117104
+0.00179227 0.0340095 -0.0213712
+-0.0768516 0.103431 -0.00952853
+-0.0773369 0.105608 0.0341784
+-0.0364954 0.0987325 0.0427313
+-0.0532526 0.161216 -0.00188451
+-0.0658747 0.0981197 -0.0167177
+-0.00202406 0.126832 0.0305449
+0.0396296 0.0392572 0.0187428
+0.0114981 0.0658063 0.0534716
+-0.0660116 0.154522 0.0303582
+0.0322049 0.0871235 -0.0192744
+-0.0161934 0.116736 -0.0156361
+-0.00805531 0.101876 -0.0238922
+-0.0425065 0.0548487 0.0395533
+-0.0623557 0.152158 -0.0235797
+-0.0550956 0.0333795 -0.00606735
+0.0194036 0.123725 -0.00335403
+0.0149002 0.0348014 0.0340409
+-0.0174953 0.112701 0.0395679
+-0.0824727 0.0992304 -0.00559052
+-0.0428553 0.101381 -0.0214106
+-0.0291214 0.0621103 -0.0254198
+-0.0530392 0.146248 0.021397
+-0.0658806 0.040185 0.0344505
+0.0298766 0.0889056 0.0433386
+0.0206783 0.0361727 0.0176735
+-0.029331 0.0791866 0.0433726
+-0.0474654 0.135069 0.0155888
+-0.0798447 0.116298 -0.00419638
+0.0278259 0.115624 -0.00659973
+-0.0400692 0.157713 -0.010751
+-0.087695 0.0860952 0.016472
+0.0119148 0.0630446 0.0522963
+-0.0586388 0.0367329 -0.00984378
+-0.0545581 0.0628278 0.0306388
+-0.0904983 0.133768 0.0272133
+0.0424823 0.0958192 -0.00180898
+-0.085893 0.115781 0.0473131
+-0.0827739 0.0762807 0.0135216
+-0.0783317 0.109572 0.0415234
+-0.0535658 0.132546 0.0330634
+-0.0901834 0.114057 0.0406088
+0.0134074 0.0463149 -0.0249889
+0.0112253 0.0952809 -0.0268838
+0.0150227 0.080777 0.0534508
+-0.0278391 0.168266 -0.00883037
+-0.0698489 0.175309 -0.0448893
+-0.0895811 0.137877 0.0241855
+-0.0790004 0.100402 -0.00859092
+-0.062851 0.116991 0.0425454
+0.0239206 0.0352552 0.0228022
+-0.000501715 0.0634055 0.0567322
+0.046037 0.0806318 0.0171753
+-0.0766672 0.154399 0.00327135
+-0.0117177 0.129576 0.0183624
+-0.0885031 0.148521 0.0281728
+-0.0728479 0.14776 0.0416103
+-0.015205 0.175685 -0.0260892
+-0.082938 0.100617 -0.00458659
+0.0398543 0.102779 0.025179
+-0.0336965 0.120802 0.028215
+-0.0625742 0.17727 -0.0581696
+-0.00806953 0.0988363 -0.0267114
+-0.0560752 0.0602595 -0.0044615
+0.0597447 0.0594744 0.0191904
+-0.0106444 0.0481591 -0.0303544
+0.00351281 0.081445 0.056735
+-0.0672464 0.173921 -0.0582812
+0.00251634 0.0459065 0.0480561
+0.000471055 0.038278 0.000679374
+-0.0002129 0.122901 -0.0103152
+-0.0382613 0.0393263 0.043596
+0.00848754 0.0426921 0.0451471
+-0.0482154 0.137103 0.0123981
+-0.015727 0.0657542 -0.0377517
+-0.0282054 0.0676114 -0.0305119
+-0.0306807 0.0363386 -0.0186663
+-0.0476849 0.119711 0.0291692
+-0.0663764 0.12565 0.049733
+-0.0488788 0.134867 0.0224297
+-0.0877229 0.0888584 0.0234132
+-0.0756171 0.172473 -0.0369846
+-0.033348 0.0384446 -0.00813352
+-0.0442894 0.126542 0.0198398
+0.0235131 0.101506 -0.0194672
+0.0538716 0.0661448 0.0268494
+-0.073604 0.148628 -0.0255988
+-0.0671901 0.0335697 -0.00322908
+-0.0886344 0.0949473 0.0228281
+-0.0761608 0.175035 -0.0499961
+0.0306065 0.111866 -0.00856301
+-0.0317456 0.124703 -0.000629789
+-0.0904268 0.150188 0.0141369
+-0.0639022 0.10675 -0.0154602
+-0.0541798 0.157923 -0.00210942
+-0.00323215 0.0940338 -0.0336602
+-0.0164901 0.115444 0.0380258
+0.053298 0.0648217 0.0277585
+-0.0843615 0.0993477 -0.00259153
+-0.00674006 0.0712942 -0.0362643
+-0.0653258 0.140047 -0.00770568
+-0.00635478 0.123294 -0.010702
+-0.055158 0.0361639 -0.0112393
+0.00412979 0.113096 -0.0199676
+-0.064574 0.0418551 0.0316967
+0.0525746 0.0462075 0.0162071
+-0.0234833 0.0448815 0.0530288
+-0.071322 0.138326 0.0479203
+0.0425401 0.0986672 0.000167984
+0.0273648 0.102724 -0.0167839
+0.0332874 0.111381 0.0289227
+-0.0537039 0.0594504 0.0244709
+-0.0227345 0.0390118 0.0369431
+-0.00354236 0.0429091 0.0474905
+-0.0724136 0.156792 -0.00114359
+-0.00249623 0.0689511 0.056733
+-0.0482461 0.131793 0.0256765
+-0.0515081 0.0490357 0.0376444
+-0.0944953 0.125552 0.0212653
+0.00638447 0.0346255 0.0414585
+0.0141724 0.0940368 0.0505038
+-0.0688973 0.120914 -0.00896239
+-0.0520364 0.14934 0.0173988
+0.00422853 0.0810435 -0.0341743
+-0.0515685 0.0473635 -0.00788512
+-0.0237608 0.156715 -0.0053038
+-0.0356104 0.127425 0.0141251
+0.035299 0.113666 0.0170439
+0.0334236 0.0903004 0.0414245
+-0.0251823 0.172681 -0.0196186
+-0.08807 0.113074 0.0239452
+0.0189601 0.036126 0.0191857
+0.00788239 0.0363273 0.00580236
+-0.0173959 0.0348327 0.0487444
+-0.0878896 0.111968 0.039224
+-0.064655 0.115706 0.0452756
+0.0311169 0.0445787 0.030603
+0.0441778 0.076309 0.025099
+-0.0896358 0.0915718 0.0124456
+-0.065807 0.090969 -0.0181206
+-0.0709064 0.123821 -0.00862928
+0.00649864 0.0924086 0.053834
+-0.0704989 0.134077 0.0490714
+-0.0596081 0.0614162 -0.00289701
+0.0242732 0.0346695 0.0161217
+-0.0464984 0.101529 0.041912
+-0.0498635 0.101385 -0.021584
+0.00433106 0.0496013 -0.0292546
+0.0107427 0.041795 0.045086
+-0.0739382 0.132552 -0.00766265
+-0.0162071 0.174195 -0.0247085
+-0.0886736 0.132413 0.0428724
+0.0320792 0.05838 -0.0156698
+-0.0192343 0.038226 0.00590432
+-0.0445033 0.11527 0.0334071
+-0.0847891 0.15265 0.0254465
+-0.0933214 0.129622 0.0172404
+-0.0346417 0.056288 -0.0107606
+-0.072488 0.172225 -0.0500329
+0.0233375 0.0606402 -0.0253621
+0.0366723 0.106016 0.0285439
+-0.0276074 0.0356491 0.0527176
+-0.053407 0.152198 0.0189083
+-0.0742721 0.166608 -0.0409997
+-0.0457331 0.0753099 -0.0177194
+-0.00672552 0.0670096 -0.035497
+-0.00219357 0.131295 0.0117423
+-0.0261647 0.0620468 0.0393395
+-0.0553241 0.0335005 0.00825618
+-0.0228582 0.119091 -0.0120569
+0.0213076 0.110412 -0.0149847
+-0.0314817 0.0889488 0.0439042
+0.0313336 0.0477022 -0.006755
+-0.0386183 0.174771 -0.00621679
+0.040988 0.0392554 0.0153655
+0.0608733 0.0623548 0.014161
+-0.00841473 0.0366574 -0.0164161
+-0.0191613 0.038383 0.000326194
+-0.00880856 0.0882704 -0.0368626
+-0.0596465 0.149865 -0.00094307
+0.00994371 0.0978413 -0.0235989
+0.0455086 0.055594 0.0323303
+-0.0860233 0.102167 0.0034068
+-0.0281256 0.165243 -0.0164075
+0.00425042 0.072607 -0.0344972
+0.0235113 0.118015 0.0324132
+-0.000261091 0.0350803 0.00896105
+-0.0532978 0.147774 0.0234078
+-0.0554295 0.0433 -0.00807812
+-0.0771312 0.155572 -0.0108986
+-0.0841536 0.0790628 0.0035277
+-0.0900384 0.135039 0.0102136
+-0.0727986 0.0849862 -0.0158247
+0.0336101 0.0962478 -0.0138935
+-0.0284441 0.0732827 -0.0345293
+0.00969167 0.0357093 0.0447693
+-0.0267255 0.0380235 0.0244373
+-0.0572883 0.132547 0.0364836
+-0.0528311 0.0941603 -0.0218064
+0.0400501 0.0644468 0.0314841
+-0.036531 0.116238 -0.0149852
+-0.00649604 0.0912014 0.0567618
+0.0144842 0.101799 0.0469727
+0.00323629 0.131729 0.0108817
+-0.0308992 0.0734931 -0.0305082
+0.0172066 0.068625 0.0512164
+-0.0657497 0.0765846 -0.017077
+-0.0737602 0.111876 0.0478461
+-0.0694356 0.066827 -0.00357005
+-0.0585001 0.119809 0.0399342
+0.0441644 0.0931187 0.000177172
+-0.0843417 0.0952366 0.029868
+-0.054753 0.0782755 -0.0197234
+-0.00738705 0.0379427 -0.0155249
+-0.0910658 0.143334 0.0151805
+-0.00249685 0.08015 0.0577289
+0.0340507 0.0835544 0.0405264
+-0.0523382 0.161184 -0.00281855
+-0.0812419 0.109765 0.0353982
+-0.0582589 0.129739 0.0385905
+0.0543559 0.049285 0.0042337
+0.015086 0.0406501 0.0443863
+-0.0280294 0.0835807 0.0475884
+-0.0393811 0.128131 0.00244283
+0.0208178 0.0415166 -0.0167046
+-0.0881465 0.111869 0.0203319
+0.0179003 0.0347727 0.0238228
+-0.0656433 0.0657616 -0.0058195
+-0.0840769 0.0911454 0.0297191
+0.00624923 0.0796338 -0.0339546
+0.0328487 0.0876389 0.0423414
+0.0276661 0.034679 0.0131567
+-0.00286572 0.104506 -0.0226523
+-0.0862889 0.10771 0.0183439
+0.0408829 0.0937805 -0.00720194
+0.000164408 0.0895345 -0.0346177
+-0.0843436 0.144613 0.00514953
+-0.0675701 0.180805 -0.0555973
+0.0220024 0.0727679 0.0493999
+-0.0156461 0.186781 -0.0233704
+-0.0187078 0.0364661 -0.0182818
+-0.0254003 0.0649585 0.0413183
+0.0122459 0.0780339 -0.0313519
+-0.0555013 0.0547806 0.00866941
+-0.0521449 0.157571 -0.00396744
+-0.073564 0.156227 0.0174776
+-0.00865052 0.104822 -0.0230347
+-0.0529425 0.0516633 -0.00638853
+-0.0652396 0.0384193 0.0154218
+0.0233172 0.0809188 0.0496338
+-0.0494012 0.054529 0.0344155
+0.0222475 0.0847573 -0.0259093
+0.0413844 0.0438265 0.0277643
+-0.0818597 0.146076 0.0399402
+0.0111047 0.0345035 -0.00868495
+-0.006336 0.10011 -0.0240468
+0.0245413 0.0819542 -0.0249712
+-0.00496439 0.130958 0.0121612
+-0.00978935 0.0841125 -0.0382567
+0.00551162 0.104351 0.0429177
+-0.0384918 0.0874952 0.0437107
+0.00946556 0.123094 -0.0106511
+-0.0897739 0.137922 0.033196
+-0.0653284 0.0349129 0.0366619
+0.00350126 0.104382 0.0428343
+-0.0368171 0.04253 -0.0279956
+-0.0634962 0.0775171 0.0416907
+-0.0558399 0.0666 0.0358943
+-0.033501 0.113967 -0.0166209
+-0.0105678 0.0384807 0.0255376
+-0.0875349 0.110472 0.0163392
+-0.0221423 0.0430524 0.0536615
+-0.0485662 0.0337988 0.0271958
+-0.0681764 0.0335792 0.00196619
+-0.00165753 0.05399 -0.0314052
+0.0457818 0.0746903 0.0202853
+-0.0845781 0.148672 0.0341151
+0.0452897 0.0861791 0.0201631
+0.00831626 0.0356874 -0.00657792
+-0.0196215 0.042233 -0.0284571
+-0.0649431 0.145366 0.0395451
+-0.0704953 0.104114 0.0382884
+-0.0414996 0.117985 0.0314618
+-0.0712521 0.17555 -0.0439596
+0.0452514 0.0931962 0.00916141
+0.00133085 0.058325 -0.0325937
+-0.0620033 0.158406 -0.0355965
+0.030344 0.1101 0.0335023
+0.0463602 0.0692197 0.00260588
+0.0444762 0.0945372 0.00319063
+-0.0491293 0.0430398 0.0442413
+-0.0789669 0.172206 -0.0419919
+0.0106503 0.130383 0.00504386
+-0.0484141 0.113756 -0.016334
+0.00450584 0.0547654 0.053433
+0.0441531 0.0720542 0.000197496
+-0.0134923 0.120989 0.0351213
+-0.0907438 0.135107 0.0202099
+-0.0590287 0.0481317 0.00366474
+0.0364319 0.108205 -0.00282023
+0.0178615 0.122874 -0.00643626
+-0.0356427 0.112876 -0.017464
+-0.0668607 0.154942 0.00387089
+-0.0486527 0.162759 0.00599863
+-0.00949915 0.105857 0.0435217
+-0.0615042 0.121243 0.0426924
+-0.0784762 0.0731416 -0.000473316
+-0.0740322 0.156054 0.0216877
+-0.0847959 0.101901 0.0272869
+-0.0596957 0.14074 -0.00502874
+-0.050497 0.0987878 0.0435099
+-0.071801 0.0745407 0.0361884
+-0.0549619 0.14242 0.0292765
+-0.0427321 0.0739589 -0.0183224
+-0.0508117 0.0354248 -0.0125858
+-0.0642011 0.0410429 0.0143098
+-0.0132685 0.101107 0.0437078
+-0.0475187 0.0790945 0.0436556
+0.0209941 0.0373175 -0.00464913
+-0.0204991 0.100239 0.044421
+-0.0684679 0.110537 0.0393979
+0.0243777 0.124503 0.0143821
+-0.0830368 0.0762381 0.00350806
+-0.073622 0.0747015 -0.00970199
+-0.0461368 0.13275 0.0116924
+0.0104091 0.0389479 -0.0231008
+0.0155004 0.116786 0.0363781
+0.0387891 0.096727 0.0316453
+0.0196906 0.074125 0.0513576
+-0.0225582 0.0383546 -0.00218286
+0.0487458 0.0724992 0.00846572
+-0.0668418 0.138273 0.0438208
+-0.0309771 0.0339917 0.0163773
+0.0411176 0.0661976 -0.00575682
+-0.0229076 0.0852723 0.0551257
+0.000828067 0.123861 -0.00936286
+-0.0250326 0.0621165 0.0410328
+-0.0651714 0.128382 0.0462127
+-0.0434333 0.15941 0.00551467
+-0.0264854 0.0348879 0.0467436
+-0.0628107 0.150584 -0.0245802
+-0.0123081 0.181626 -0.0249909
+-0.00919366 0.172678 -0.0237455
+0.0126063 0.0576596 0.0514859
+-0.0332159 0.0709306 -0.0214641
+0.0240158 0.0658883 0.0452055
+-0.0660765 0.124251 0.0501642
+-0.0588552 0.0351368 -0.0102919
+0.0124134 0.0346609 0.020994
+0.0122384 0.0644368 0.0527864
+0.0452304 0.0763569 0.00121116
+0.0242611 0.0448626 -0.0136813
+-0.0304238 0.12007 0.0279522
+0.0145126 0.0347575 0.026768
+-0.0217663 0.065545 -0.0358558
+0.00816067 0.125635 -0.0073679
+0.0183075 0.0679765 -0.028974
+-0.0180555 0.0909221 -0.0366017
+0.00824317 0.0602927 0.0539848
+-0.0687967 0.0894213 -0.0168337
+-0.0450098 0.146255 0.00342574
+-0.0335022 0.0661629 0.0402747
+-0.0781465 0.155117 0.0246877
+0.00450914 0.0758818 0.0564153
+-0.0135396 0.0366033 -0.0173816
+0.045728 0.077798 0.00320493
+-0.0913745 0.142001 0.0211607
+-0.0284862 0.102933 0.0423265
+-0.0302445 0.16108 -0.00171322
+0.0327554 0.116907 0.00609585
+0.0201031 0.0379621 0.0410367
+-0.090178 0.113449 0.0375353
+0.0422255 0.0887323 -0.00780894
+-0.0632995 0.045657 0.000708444
+-0.0344955 0.0889014 0.0434521
+-0.0735138 0.0874308 0.0404487
+-0.081144 0.11 0.0405445
+-0.046701 0.144949 0.00345496
+0.0239825 0.114006 0.0348506
+0.00951792 0.0799496 0.0550675
+-0.0589753 0.0343808 0.0315144
+-0.0715764 0.0724969 0.0344898
+-0.0763465 0.151411 -0.00788806
+0.0476241 0.0444058 0.00228058
+-0.0865319 0.0910336 0.0265354
+-0.0761893 0.0686573 0.0192806
+-0.0738377 0.169377 -0.0450494
+-0.013497 0.089796 0.0568243
+-0.003677 0.129286 0.0256231
+0.00334505 0.0372684 -0.00154693
+0.0285394 0.0735396 -0.0227021
+-0.067513 0.132633 0.0463034
+0.0459145 0.0862168 0.00717824
+-0.0631406 0.152896 -0.00931447
+-0.0777879 0.113218 0.0476364
+-0.023707 0.0340979 -0.0208155
+-0.0144671 0.110884 -0.0194361
+0.0102739 0.0667155 -0.0310192
+-0.00350236 0.0842813 0.0574606
+-0.0664798 0.0832826 0.043443
+-0.0635622 0.0403137 0.0257086
+-0.0426942 0.0666296 -0.0154091
+-0.017221 0.187225 -0.0211553
+-0.0336762 0.062222 -0.0135529
+-0.0673972 0.0641749 0.025006
+-0.0740248 0.149858 -0.0328754
+-0.0467235 0.128128 0.0253508
+-0.0262045 0.163884 -0.00647025
+-0.0271883 0.118982 0.0306038
+0.033772 0.0543003 -0.00971113
+-0.0758953 0.12228 -0.00740649
+0.00448236 0.11415 0.0407558
+-0.0698932 0.103728 -0.0136756
+-0.0567617 0.0782351 -0.019665
+0.0543638 0.0534389 0.000229046
+-0.081811 0.11456 0.047449
+-0.0565132 0.053486 0.0056729
+-0.057003 0.128342 0.0386502
+-0.0664962 0.0370022 0.0293944
+-0.0624918 0.101519 0.0421076
+-0.0687869 0.155336 0.00316719
+-0.0685122 0.141137 0.0449382
+-0.0527211 0.0709092 -0.0154358
+-0.00549985 0.0703921 0.057296
+-0.0709113 0.107952 -0.0112859
+0.00912605 0.108716 -0.0196568
+0.0361188 0.0794771 0.0382118
+-0.0588731 0.101172 -0.0189069
+-0.068257 0.129831 0.0487832
+0.0374605 0.0754022 0.0365814
+-0.032324 0.161031 -0.00122654
+0.0285746 0.0351013 0.0166057
+0.0394117 0.0870933 -0.0127933
+0.0113423 0.0644371 0.0532354
+-0.0583019 0.0447396 0.0435847
+-0.00749863 0.0773617 0.0576592
+-0.050194 0.116459 -0.0151638
+-0.0481437 0.0545922 0.0360102
+-0.0104704 0.100279 -0.0242341
+-0.0347529 0.111555 -0.0180951
+-0.0155011 0.120965 0.0341268
+-0.0784442 0.154274 0.027518
+0.0120599 0.0739551 0.0543847
+-0.0633352 0.0436031 0.0119653
+0.0217763 0.115313 0.0351727
+-0.0415089 0.165252 0.00421093
+0.0335736 0.0700381 0.039723
+0.00251112 0.0647983 0.0566425
+-0.0654261 0.0391693 0.0381077
+-0.0695564 0.114278 0.0502908
+-0.00162211 0.0369274 0.0160989
+-0.058966 0.123797 -0.00809452
+-0.0942641 0.126921 0.0212556
+-0.0335104 0.175675 -0.00315318
+-0.0368415 0.0943464 -0.0233446
+0.0133357 0.128238 -0.000223601
+0.00322397 0.0768846 -0.0351052
+0.00583724 0.038604 -0.0097514
+0.0244991 0.0390622 0.0333159
+0.039204 0.0699354 0.0337973
+-0.00749309 0.122405 0.0352331
+-0.0204932 0.0624346 0.0477982
+-0.0366651 0.0353042 0.023032
+0.0167127 0.0887461 0.050636
+-0.0697357 0.167099 -0.0218834
+0.0364696 0.0632797 0.0368445
+-0.0745038 0.141441 0.0470955
+-0.0621205 0.0458041 0.0366793
+-0.0544906 0.0820201 0.0451936
+-0.0645123 0.172574 -0.0485643
+-0.0421309 0.128083 -3.62159e-05
+0.0281636 0.121218 0.0186511
+-0.0121987 0.171236 -0.0257581
+-0.0281113 0.0605968 -0.0274147
+-0.0631879 0.0449558 -0.00115255
+-0.056884 0.0955743 -0.0213395
+-0.0516987 0.131736 -0.00321408
+0.00826283 0.110977 0.0402103
+-0.0738401 0.154086 -0.0269016
+0.00525204 0.071179 -0.0340737
+-0.0710521 0.173649 -0.0530415
+-0.0508226 0.162642 -0.00385759
+-0.0802179 0.141741 -0.00280512
+-0.0104908 0.12238 0.0346088
+-0.082839 0.145958 0.00218243
+-0.0764995 0.134472 0.0515165
+0.0572674 0.0552579 0.0228777
+-0.0459192 0.038241 -0.0182827
+0.0212995 0.0664627 -0.0275106
+-0.00266999 0.131274 0.0130017
+-0.0615996 0.159996 -0.0335919
+-0.0172476 0.12413 0.0281151
+0.0257469 0.104744 0.0391433
+0.033213 0.112692 0.0276861
+0.0156033 0.0352036 -0.0174539
+-0.030256 0.0608147 -0.0214135
+-0.0554996 0.0746996 0.0418498
+0.0250243 0.0618819 0.0448807
+0.0333333 0.0528011 -0.00875184
+0.0462789 0.0820452 0.011174
+0.0413782 0.0519867 -0.00685663
+-0.0228771 0.11806 -0.0129657
+-0.0608849 0.0381036 0.0449409
+-0.0255027 0.103002 0.0430099
+-0.0102615 0.128766 0.00159795
+-0.0140304 0.0389318 -0.0121434
+0.0242826 0.0691154 -0.0252241
+-0.0262141 0.0383199 -0.0177378
+0.000134491 0.116503 -0.0174981
+-0.0556551 0.0575 -0.00342108
+-0.0641179 0.115013 -0.0114251
+-0.0523454 0.059725 0.0287459
+-0.039493 0.0888698 0.0432118
+-0.0635876 0.0600882 0.0187607
+-0.0527647 0.138519 0.0263974
+-0.0421778 0.150669 0.00550662
+-0.0898169 0.147438 0.0111767
+-0.0440117 0.149183 0.00634807
+-0.0124981 0.0842783 0.057419
+-0.041501 0.0888244 0.0425932
+0.0390954 0.0814754 -0.0127535
+-0.00978632 0.0812687 -0.0379822
+-0.0143122 0.127128 -0.000614565
+0.043146 0.0650339 -0.00117659
+0.0508787 0.0465582 0.0223162
+-0.0187679 0.0341854 -0.027695
+0.0104088 0.0403968 -0.0232872
+-0.0615714 0.111062 0.0370307
+-0.0574772 0.0344195 0.038759
+-0.029988 0.0381577 0.0326274
+-0.0293835 0.0775974 -0.0345936
+-0.0174998 0.115454 0.0379182
+-0.0492034 0.0336154 -0.00143623
+-0.0160718 0.124871 -0.00420428
+0.0153397 0.120197 -0.0115352
+-0.0588103 0.157344 0.00530008
+-0.0448304 0.0956436 -0.0219722
+0.0199962 0.120682 0.0326204
+0.050389 0.0482108 0.0251806
+0.0208954 0.116644 -0.0117151
+-0.079388 0.147286 -0.00182539
+-0.0747645 0.0849032 -0.0147477
+-0.0505016 0.107064 0.0390734
+-0.0174992 0.03427 -0.0197565
+-0.01005 0.166619 -0.017705
+-0.0581312 0.0342101 0.0265873
+-0.0613803 0.17096 -0.0575947
+-0.0304965 0.0917653 0.0441169
+-0.0458806 0.10564 -0.0201801
+0.0202101 0.0833915 -0.0271395
+0.0323169 0.0376319 0.0223694
+-0.0223063 0.0380908 0.0216787
+0.035616 0.10962 -0.00284805
+0.0484836 0.0582148 0.031165
+-0.0809138 0.125107 -0.00520991
+-0.00566591 0.0540919 -0.0326394
+-0.00149662 0.114206 0.0415504
+-0.0263202 0.0930635 -0.029586
+-0.0680426 0.110046 0.0381289
+0.0249883 0.12025 -0.003603
+-0.0736149 0.155479 0.0262237
+-0.0299566 0.122268 0.0236125
+0.0238471 0.107154 -0.0155051
+-0.0566015 0.0451895 0.0246815
+-0.028491 0.0987621 0.0434122
+-0.0338535 0.0870951 -0.024854
+-0.0478322 0.0956344 -0.0220665
+-0.0226614 0.177177 -0.0135831
+-0.0810787 0.154935 0.0192662
+0.0439336 0.0428821 0.0236685
+-0.0114115 0.128814 0.0228458
+-0.0417827 0.0840916 -0.0212196
+0.0249862 0.118037 0.0310154
+-0.0641215 0.0336259 -0.00810847
+-0.0795112 0.081834 0.0339273
+-0.041505 0.119362 0.0299569
+-0.0033398 0.119986 -0.0131833
+0.0411805 0.0745986 -0.0077775
+-0.0446675 0.0636475 -0.0137193
+0.00937092 0.0937948 -0.0292997
+0.0415042 0.104246 0.00816492
+-0.0792333 0.169423 -0.0379787
+-0.0414888 0.0437926 0.0421195
+-0.00148881 0.0760516 0.0586512
+-0.0126769 0.0541386 -0.0335166
+-0.00577674 0.0385885 0.0246132
+-0.0394947 0.0676998 0.0417669
+0.0147262 0.129115 0.00511474
+-0.0045144 0.0774415 0.0584948
+0.0334512 0.0365216 0.00521608
+-0.0662857 0.0625946 -0.00141881
+-0.0659868 0.0418098 -0.00430732
+-0.0485691 0.0460686 -0.00963735
+0.0269239 0.0493817 -0.018692
+-0.0652895 0.175332 -0.0607504
+0.0558431 0.0722822 0.0186151
+0.0389971 0.039341 0.0203664
+-0.0252734 0.05785 0.0399799
+-0.0537245 0.0723552 -0.016258
+-0.0214963 0.104399 0.0429755
+-0.0649507 0.13395 0.041174
+-0.0641915 0.179229 -0.0572988
+-0.00649249 0.110023 0.0430195
+-0.0925801 0.120153 0.0312943
+0.0364682 0.111067 0.00216795
+-0.0487462 0.118344 0.031163
+0.0272987 0.047751 0.0374572
+-0.0235246 0.079724 0.0545007
+0.044563 0.0819287 0.0241608
+0.018083 0.0887399 0.0491141
+0.0180337 0.115273 -0.0142355
+-0.0838753 0.135332 0.0479212
+-0.0707318 0.154624 0.0301689
+-0.0897339 0.0916034 0.0174376
+-0.0487526 0.0782553 -0.019094
+-0.021696 0.0567795 -0.0319795
+-0.0524624 0.139899 0.000243693
+-0.016317 0.0384896 0.0261516
+-0.0172081 0.172701 -0.0233314
+-0.0664965 0.109745 0.0377695
+-0.0117557 0.0345134 -0.025836
+-0.000654571 0.0391799 -0.00969942
+0.00820345 0.083757 -0.0326005
+-0.0458982 0.107069 -0.0194756
+-0.0567459 0.15948 0.00480369
+0.00650779 0.0575337 0.0533257
+0.037787 0.0377202 0.0142753
+0.00846774 0.13132 0.015646
+-0.0475009 0.0425468 0.0439593
+-0.0766415 0.100814 0.0361238
+-0.028614 0.0408765 -0.0296027
+0.00929873 0.115842 -0.01682
+-0.0828745 0.119161 -0.00328383
+-0.0769895 0.0790529 0.034321
+-0.0878006 0.151251 0.0245374
+0.0208653 0.122279 0.030221
+-0.00768551 0.130297 0.0183702
+-0.0545511 0.0430136 -0.00860983
+0.030217 0.0843227 -0.0201565
+-0.0467665 0.152145 0.00944802
+-0.0631219 0.156103 0.0153645
+-0.0681832 0.155264 -0.0517309
+0.0142805 0.0345676 -0.0138073
+-0.0664934 0.0624679 -0.000297249
+-0.0641994 0.16384 -0.059407
+0.0464327 0.0769932 0.014129
+-0.041507 0.0591281 0.0403212
+0.0223695 0.0993436 -0.0211483
+-0.088603 0.087513 0.0164636
+0.00038562 0.0392239 -0.00953586
+0.0270604 0.0795391 0.0462139
+-0.0684865 0.0611195 0.0150424
+0.0105195 0.053345 0.0519069
+-0.0620106 0.15528 -0.0315878
+-0.00991465 0.0385501 0.00204441
+-0.0151984 0.171233 -0.0237028
+-0.026193 0.171192 -0.0190186
+0.0404914 0.0541681 0.032094
+-0.0115119 0.181449 -0.0261319
+-0.027122 0.166756 -0.0173778
+0.0338583 0.105892 -0.0101458
+-0.0671444 0.0628365 -0.000338348
+-0.0788571 0.120751 -0.0060883
+-0.0525645 0.0417313 -0.0101531
+0.0278652 0.0996344 -0.0174729
+-0.0681363 0.122845 0.0524474
+-0.0228108 0.0770465 -0.0385748
+-0.0135961 0.12464 -0.00600832
+-0.00365126 0.0525899 -0.0316543
+-0.068996 0.139931 -0.00789046
+-0.0310262 0.153728 -0.00354608
+-0.0497211 0.131062 0.0298847
+-0.00109314 0.103948 0.0441727
+-0.0204702 0.16083 -0.0136222
+-0.0865394 0.109089 0.0183378
+0.0400949 0.095337 0.0300286
+-0.0693797 0.128452 0.0506772
+-0.0438868 0.107083 -0.0199439
+-0.0470477 0.150201 -0.00445632
+-0.0370064 0.121579 0.0285082
+0.0198288 0.120602 -0.00797301
+-0.0549804 0.0334872 0.0101333
+0.00782186 0.127915 -0.00384433
+-0.0495314 0.12548 0.031876
+-0.0926082 0.117405 0.0243082
+-0.0215209 0.0382567 0.0252967
+0.00181128 0.125691 -0.00735123
+-0.0771897 0.117737 0.0516815
+-0.0554751 0.0519418 -0.00338574
+-0.0771699 0.154422 0.00455736
+-0.00649896 0.092559 0.0563419
+-0.0704303 0.164039 -0.0149268
+-0.036643 0.118048 -0.0128637
+-0.0535056 0.136701 0.0296589
+-0.0594928 0.0761776 0.0424443
+-0.00649656 0.0856337 0.0569558
+-0.0586618 0.0637687 0.0307411
+-0.0650964 0.155112 0.00596226
+-0.0626129 0.0371673 0.0184653
+0.0330114 0.107386 0.0320976
+0.0333812 0.0490928 -0.00645546
+-0.069711 0.1744 -0.043385
+-0.00744712 0.0961017 -0.0318028
+0.0413373 0.0392631 0.0117259
+-0.0487556 0.137056 0.00741027
+-0.0845701 0.112449 0.0449336
+0.0531449 0.0608429 -0.00288049
+-0.0358592 0.10284 -0.0213952
+-0.0778493 0.11932 -0.00645768
+0.0172333 0.0750251 -0.0287502
+-0.0195083 0.11546 0.0373373
+-0.0542618 0.0348321 -0.0120282
+-0.0344386 0.125663 -0.00162003
+-0.0690003 0.160066 -0.00858817
+0.0285895 0.0979793 -0.017709
+0.015268 0.0341755 -6.02454e-05
+-0.012432 0.12921 0.00653602
+-0.0222335 0.171216 -0.0204735
+-0.0656059 0.0615317 0.0026003
+-0.0324965 0.174231 -0.00238999
+-0.0398336 0.0384391 -0.0280596
+-0.0513902 0.122634 0.0344378
+-0.0735123 0.142806 0.0460464
+-0.0703661 0.16678 -0.0206717
+0.0128439 0.0343776 -0.0158182
+-0.074941 0.152735 -0.0189
+-0.0785348 0.0771858 -0.00655705
+0.0347176 0.114447 0.00679736
+-0.0192836 0.0385916 0.0308544
+-0.00226925 0.130756 0.00454173
+-0.0622845 0.161545 -0.0405978
+-0.0687671 0.0900946 0.0427048
+-0.028252 0.050761 -0.0234049
+-0.0818245 0.107456 0.0283887
+0.0216927 0.103078 -0.0191449
+-0.0539655 0.0364915 -0.0115887
+-0.0577688 0.142406 -0.00278963
+0.0347443 0.08354 0.0397721
+0.041088 0.0912985 0.0296287
+0.0209984 0.0578395 0.0478214
+-0.0607897 0.155834 0.0118473
+-0.0427999 0.167662 -0.00952768
+-0.0135045 0.0870342 0.0571061
+0.0551275 0.0637038 0.000299703
+-0.0500088 0.124901 -0.00796654
+0.040891 0.0917758 -0.00909975
+-0.057302 0.152908 0.030569
+-0.0490908 0.140152 0.0103957
+-0.062514 0.0399436 -0.00751704
+-0.0901142 0.14065 0.0241685
+-0.0614977 0.0847334 0.0442553
+0.00401707 0.125848 -0.00755459
+-0.0295217 0.0402041 -0.0298306
+-0.0770884 0.0866038 -0.0125752
+0.00250242 0.0441898 0.0459568
+-0.0884166 0.13498 0.0042424
+-0.0144984 0.11138 0.0412273
+-0.0543527 0.155034 0.0127444
+-0.0485461 0.135607 0.0194861
+-0.0763654 0.155962 0.0179624
+0.0194741 0.0351845 0.0201392
+0.0604235 0.0678625 0.0131519
+-0.0147437 0.0383723 0.00849375
+0.0123077 0.035562 0.0436453
+-0.0878555 0.0861109 0.00948006
+0.0461918 0.0820393 0.0121748
+-0.0376617 0.0344352 0.0359896
+-0.0640313 0.13251 0.040793
+0.00650251 0.122426 0.0350167
+0.046473 0.0747304 0.00699979
+-0.090578 0.13228 0.00723516
+-0.0665138 0.0986787 0.0417758
+-0.0753611 0.0724331 0.0302407
+-0.0737585 0.160179 -0.00884095
+-0.0875779 0.102333 0.0213648
+-0.0213902 0.0905176 -0.0361974
+-0.0663379 0.132604 0.0444522
+0.0420458 0.0817019 -0.00677657
+-0.0739471 0.131099 -0.00783391
+-0.00249367 0.0925505 0.0559214
+-0.0748382 0.149925 -0.0278668
+-0.0734967 0.126028 0.0530224
+-0.0386362 0.117281 -0.0140679
+0.00347668 0.0964809 0.0526894
+0.0453833 0.074968 0.00220665
+0.012072 0.11405 -0.0168987
+-0.0774663 0.168085 -0.0299733
+-0.0534988 0.0761753 0.0426023
+-0.0233682 0.126286 0.00541909
+-0.00704598 0.0392708 0.0363567
+-0.0791658 0.0990564 -0.00863296
+-0.0464518 0.0945568 0.0436355
+-0.0404194 0.128239 0.00205017
+0.0393898 0.107905 0.00701069
+-0.0398611 0.0338561 -0.0163385
+-0.0665222 0.156255 0.0214077
+-0.0672076 0.171872 -0.0410051
+-0.0708261 0.144835 -0.0182015
+-0.0650483 0.0701635 0.0361166
+-0.00764186 0.11082 -0.0214014
+-0.0836837 0.151385 0.0303528
+-0.0496912 0.162854 0.00564102
+-0.0114821 0.125053 0.0306553
+-0.0713615 0.158186 -0.0419305
+-0.0348112 0.0336186 -0.0263013
+-0.0652015 0.0334423 0.00269659
+-0.00682217 0.0390777 -0.0108403
+-0.0745121 0.155307 0.0054919
+0.00849016 0.0441134 0.0451901
+-0.041821 0.0914074 -0.0230213
+0.0243874 0.048835 -0.0205112
+-0.0578612 0.158406 0.00308521
+-0.0781467 0.116431 0.0503206
+0.0429791 0.071952 -0.00379352
+-0.00196689 0.131088 0.00752604
+-0.0728984 0.156837 -0.0329194
+0.00543206 0.119469 -0.0147017
+-0.00442631 0.0386612 0.00487339
+-0.089531 0.0983552 0.0174009
+0.00679264 0.0379024 -0.00704418
+-0.0255688 0.0356598 0.0531386
+-0.0343151 0.0794495 -0.0245241
+-0.0124944 0.0870249 0.0570339
+-0.0710693 0.155098 0.0285743
+-0.0663511 0.0350877 0.0310837
+0.00349789 0.122445 0.0347995
+-0.0414975 0.045132 0.0414403
+0.0348194 0.0365264 0.00732462
+-0.0740113 0.141343 -0.00688783
+-0.0303332 0.0706347 -0.0294852
+0.0503042 0.0691243 0.0253774
+-0.0701319 0.158154 -0.0479233
+-0.0358242 0.0915039 -0.0239402
+-0.0645394 0.0596403 0.015406
+0.0213135 0.0650138 -0.0271409
+0.0262112 0.0873747 -0.0229809
+-0.052671 0.112615 -0.017101
+-0.0592898 0.045994 0.0417021
+-0.0717164 0.163822 -0.0439567
+0.0178664 0.127935 0.017674
+-0.0655034 0.108381 0.0382088
+0.0278762 0.0942373 0.043974
+-0.0457869 0.0855328 -0.0217062
+-0.0643109 0.169365 -0.0428818
+0.0100266 0.0346111 0.0241784
+-0.00361434 0.0341476 -0.0187856
+-0.0389438 0.047744 -0.0146455
+-0.0676963 0.0648397 0.0261272
+-0.0374998 0.0691046 0.0417769
+-0.0568378 0.0613597 0.0260949
+-0.0369296 0.036554 0.0451414
+-0.0284901 0.0688983 0.0393825
+-0.0534824 0.0340932 0.0259063
+-0.0631168 0.15992 -0.0455978
+-0.0444353 0.0335419 -0.0188134
+-0.0168224 0.0960286 0.0515795
+-0.076233 0.145832 -0.00587217
+-0.0231748 0.0709692 0.0487695
+-0.0104382 0.0354056 -0.0175403
+-0.0897878 0.136555 0.0351995
+-0.0717761 0.0344583 0.000444464
+0.0353682 0.103387 0.0319873
+-0.00977607 0.0770524 -0.0379416
+0.00551406 0.0375423 0.0260562
+-0.00350144 0.0675505 0.0564719
+-0.0564947 0.102955 0.042036
+-0.061361 0.0336079 0.00692461
+0.00850062 0.121038 0.0360118
+0.0202826 0.0693621 -0.0284085
+-0.00908512 0.169637 -0.0217386
+0.0255848 0.123614 0.0162626
+0.0234098 0.0871372 -0.0242525
+0.0269727 0.112042 -0.0107557
+0.0262833 0.0935743 -0.0210485
+-0.059 0.0412164 0.021703
+0.0345357 0.0373492 0.0194302
+0.0530102 0.0462982 0.0132036
+-0.00365111 0.0511553 -0.0312289
+-0.0591025 0.0338635 0.0178635
+-0.0144888 0.0673806 0.0542261
+-0.0416194 0.0336308 -0.0257822
+-0.0186097 0.0407857 -0.0282477
+-0.0298888 0.0474725 0.0462905
+-0.00306646 0.0386027 0.0233477
+0.0330707 0.110451 -0.00703014
+0.0146846 0.037467 0.0442233
+-0.0390505 0.154795 -0.00905663
+-0.0306702 0.0891071 -0.0265975
+-0.090498 0.131069 0.0362301
+-0.0189866 0.10628 -0.022556
+-0.0125142 0.181139 -0.0289621
+-0.0236648 0.0522261 -0.0284113
+-0.0564969 0.100177 0.0431307
+-0.0314961 0.10429 0.0412052
+-0.0509168 0.0335668 6.7085e-05
+-0.0773495 0.081875 0.035997
+-0.0834254 0.141805 0.00220396
+0.00104126 0.108173 -0.0205653
+0.0181741 0.0988563 -0.0226017
+-0.0797776 0.115912 0.0485816
+-0.0816869 0.0734846 0.011537
+0.00150486 0.0856703 0.0573817
+-0.00849476 0.0745791 0.0575173
+-0.00549893 0.0939194 0.0556385
+0.0221626 0.0490425 0.0405889
+0.0363661 0.0873006 -0.0164353
+0.0491174 0.0712134 0.0219878
+-0.079214 0.155524 0.0184351
+-0.0654627 0.0598015 0.0150426
+0.0330982 0.0626311 -0.0167961
+-0.0839336 0.126519 -0.00402298
+-0.00950667 0.125161 0.0310898
+0.0292092 0.0563773 0.0403225
+-0.0273861 0.0720614 0.0416635
+-0.0647467 0.0379255 0.0402853
+-0.0521847 0.140082 0.0224024
+-0.0276164 0.0422898 -0.0293674
+0.0360108 0.100867 -0.0107814
+-0.0946899 0.124172 0.0202666
+0.0446233 0.0903218 -0.000806954
+-0.00230838 0.0348204 0.04129
+0.00391726 0.126651 -0.0064175
+-0.0633881 0.0336212 0.00649796
+0.00838362 0.046349 -0.0258656
+-0.0577252 0.156918 0.00853143
+-0.0693669 0.17099 -0.0332104
+0.0249955 0.0347512 0.0143719
+0.00961895 0.12141 -0.0128393
+0.021665 0.0416371 -0.0126942
+-0.0521438 0.0568294 0.0272279
+-0.0628733 0.0996403 -0.0179913
+0.0218834 0.0415901 -0.0107198
+-0.0546838 0.0435714 0.0206922
+-0.0176301 0.183064 -0.0184359
+-0.00750517 0.0471136 0.0478292
+-0.0520933 0.154615 -0.00405641
+-0.0865732 0.0860822 0.023453
+-0.0665787 0.163768 -0.0579853
+0.00636801 0.0479975 -0.0276935
+0.0368613 0.0587703 -0.00975684
+-0.0879266 0.10368 0.0183585
+-0.016623 0.0450359 -0.0278307
+-0.0895401 0.135156 0.0272131
+0.000356348 0.0496808 -0.0306188
+-0.0836962 0.138005 0.0462469
+0.0441945 0.077668 0.0251701
+-0.0685147 0.0930476 0.0422841
+-0.0232574 0.100051 -0.0240138
+-0.03748 0.0548048 0.0392179
+-0.0293599 0.15815 -0.0119938
+-0.021522 0.0336815 -0.0237529
+0.00128503 0.0655494 -0.0343406
+-0.0861178 0.0953813 0.000442214
+0.0350885 0.099465 0.0350983
+-0.0779853 0.13835 -0.00526914
+-0.0857179 0.124363 0.0486993
+-0.0309707 0.163858 -0.00458082
+-0.0722468 0.174258 -0.0400013
+-0.0149026 0.105901 -0.0222117
+-0.0673665 0.165482 -0.0209987
+-0.0876017 0.152029 0.0126504
+-0.0220763 0.0666765 0.0478151
+-0.0624814 0.094591 0.0443423
+-0.0196147 0.0379102 -0.0280301
+-0.0346582 0.0422066 0.0469558
+-0.0199036 0.0739897 0.0538964
+-0.00877818 0.0387104 -0.00343461
+0.000535895 0.0548656 0.0545076
+-0.0454881 0.10014 0.0423159
+-0.0404927 0.0958661 0.0421915
+-5.87354e-05 0.100974 -0.0229378
+-0.0283024 0.0362399 -0.0299084
+0.026308 0.0822369 0.0469135
+-0.06337 0.156813 -0.0136043
+-0.0624231 0.0357528 0.0196573
+-0.0709978 0.0698591 0.0316215
+-0.00550273 0.0661441 0.0562254
+0.00539692 0.0418924 -0.0240197
+-0.0711187 0.0642492 0.0206358
+-0.0614458 0.0606683 0.0222701
+0.0189142 0.0353585 0.00519133
+0.0315596 0.0497964 -0.00774264
+-0.0548596 0.0462919 -0.006395
+0.0010398 0.0392387 0.0326514
+0.0448141 0.0889533 0.0211601
+-0.0898897 0.136442 0.013225
+0.0409408 0.0873455 0.0311847
+-0.0866496 0.106304 0.00937201
+0.0315171 0.118424 0.0085036
+-0.091229 0.14471 0.0161551
+-0.00263717 0.12924 0.026005
+0.0142425 0.0645148 0.0521595
+-0.0509259 0.0571242 0.0316152
+-0.0585706 0.155353 0.0213449
+0.0242207 0.111888 -0.0125803
+-0.0305755 0.0788685 0.0415824
+-0.0664528 0.145477 0.0410093
+-0.00432524 0.0423738 0.047881
+-0.0434528 0.12491 0.0216806
+-0.0610445 0.045667 0.0306816
+-0.0148175 0.0855384 -0.0388203
+0.0594886 0.0594575 0.00616841
+-0.0740871 0.156873 -0.0259173
+-0.0414785 0.105663 0.0400022
+-0.0376995 0.0680509 -0.0154542
+-0.0698935 0.122364 -0.00881274
+-0.00848477 0.0718045 0.0573713
+-0.0394932 0.127549 -0.000886358
+-0.0856022 0.136615 0.0453504
+-0.0889467 0.143422 0.0321606
+-0.0738723 0.109242 -0.00905672
+-0.0222267 0.0906414 0.0528718
+0.00551724 0.0661119 0.0558057
+-0.0588983 0.0582416 0.00880815
+0.0225876 0.0388978 0.0383164
+0.0022443 0.0974458 0.0519249
+-0.056455 0.12554 0.0394323
+-0.00949777 0.091187 0.0566315
+0.00149085 0.103013 0.043912
+-0.00374904 0.0712712 -0.0357267
+-0.0394946 0.119701 -0.0126173
+-0.0631669 0.152168 -0.0312981
+-0.0139477 0.0625843 0.0539847
+-0.0604937 0.100137 0.0425915
+-0.0749718 0.138395 -0.00644263
+0.00624486 0.0401371 0.0456279
+0.0193551 0.0475975 0.0417872
+-0.0303971 0.0890708 -0.0275789
+0.0196022 0.0462781 0.0421275
+0.0317544 0.0632771 0.0405733
+-0.0662966 0.156977 -0.00759157
+0.0183734 0.0506657 -0.0252113
+0.0404388 0.0427247 -0.00185446
+0.0115151 0.105777 0.0436811
+-0.0301364 0.0349235 0.0476426
+0.0254917 0.0369057 0.0252691
+-0.0850483 0.109026 0.0223524
+0.0157867 0.112048 -0.0167369
+0.0360751 0.0370336 0.00715793
+-0.0781026 0.0818813 0.0353359
+-0.00650962 0.0773868 0.0579538
+-0.0494324 0.0586474 0.0343285
+0.0112135 0.116429 0.0374582
+-0.0555782 0.159581 0.0063787
+-0.0454954 0.160804 0.00677344
+-0.0709975 0.139911 -0.00751202
+-0.0547852 0.0339346 -0.0120065
+-0.079504 0.128859 0.053141
+-0.0155349 0.0459646 0.0502157
+-0.0704857 0.116111 0.0520944
+-0.0454716 0.0404727 0.0442216
+-0.0890267 0.148493 0.027289
+0.0192952 0.126057 0.00111502
+0.00542039 0.0392223 0.0299552
+-0.0509634 0.152153 0.0121451
+0.0432798 0.100122 0.00916351
+-0.0722295 0.16736 -0.0213426
+-0.0311459 0.0354418 0.0504241
+-0.0834736 0.114211 -0.000781836
+-0.0258217 0.181482 -0.0160394
+-0.0517798 0.115481 0.0337859
+-0.0763629 0.108471 -0.00759882
+-0.0757916 0.155001 0.00503825
+-0.0893649 0.111932 0.017326
+-0.0619999 0.132592 -0.00773229
+-0.033844 0.171255 -0.00164046
+-0.0352015 0.153653 0.00157065
+-0.0722895 0.147809 -0.0265569
+-0.0217088 0.114301 -0.017023
+0.026785 0.0955535 0.0441601
+-0.0481378 0.0672057 0.0386531
+-0.026667 0.0823364 0.0504973
+0.00619086 0.131536 0.009113
+-0.0526119 0.0580506 0.0248562
+0.00250286 0.0576093 0.0540213
+-0.0810169 0.0953587 0.0335948
+0.029848 0.0875415 0.0432926
+0.0464379 0.0778615 0.0131806
+-0.0134997 0.0856507 0.057198
+0.0263535 0.0795425 0.0469281
+-0.0265857 0.0603669 0.0385952
+-0.0334943 0.11802 0.0311453
+-0.00337868 0.117905 -0.0149619
+-0.0660268 0.177263 -0.0521591
+-0.0238887 0.156697 -0.00604726
+-0.00760592 0.125948 -0.00752899
+-0.0221488 0.0383333 0.0268965
+-0.0293863 0.155004 -0.00725783
+0.0105543 0.126889 0.0293082
+0.0501729 0.0446765 0.00723117
+0.0310879 0.115727 -0.00269046
+-0.0191314 0.122285 0.0303949
+-0.0777065 0.155692 0.0145746
+-0.0797904 0.152563 0.0316147
+-0.0710154 0.0391332 0.00421404
+-0.0889531 0.100999 0.0124002
+-0.0147295 0.0942902 -0.0339999
+-0.0812191 0.0785924 0.0290188
+-0.0766463 0.0803349 -0.0100768
+-0.0435275 0.152141 0.00710463
+-0.0608313 0.092512 -0.0191943
+0.0227948 0.124775 0.0223512
+-0.0831943 0.132626 0.0501472
+-0.0317593 0.0449779 0.048226
+0.00552401 0.0633596 0.0561453
+-0.0492065 0.128269 0.0305743
+-0.0634388 0.152153 -0.00650488
+-0.0568117 0.135044 -0.00489316
+0.0252231 0.117755 -0.00691168
+-0.0716366 0.0874136 0.0414306
+-0.0725279 0.091561 0.0413901
+-0.0764449 0.084677 0.0378167
+-0.00880306 0.0841017 -0.0380883
+-0.0688616 0.033602 -0.00179476
+0.0161578 0.0988387 -0.0226848
+-0.0829912 0.0966357 0.0312921
+0.00854504 0.101743 0.0468013
+-0.0161113 0.0419173 0.0519008
+-0.0115772 0.0991016 -0.0249869
+0.026625 0.0839457 -0.0229857
+0.0451532 0.0931968 0.0111604
+-0.0264982 0.113889 0.035131
+-0.00351628 0.0442826 0.04692
+-0.0202282 0.0639107 0.048901
+0.0154069 0.0403121 -0.0220991
+-0.0725345 0.140015 0.0475615
+-0.0340447 0.1653 -0.00374721
+0.00850451 0.0883096 0.055394
+-0.0516913 0.0680528 0.0372779
+-0.070167 0.162396 -0.0479528
+-0.0174382 0.127681 0.00469302
+0.0354105 0.0965418 -0.0122281
+-0.0427202 0.152139 0.00651185
+-0.00023381 0.123831 -0.00932637
+-0.073929 0.152666 -0.0308896
+0.0244967 0.0375596 0.0281073
+-0.038496 0.0450464 0.0406484
+0.0424477 0.0803262 -0.00578172
+-0.017618 0.163994 -0.00984759
+0.042638 0.101488 0.0111603
+-0.0114747 0.111375 0.0418865
+-0.0878262 0.152428 0.0199936
+-0.0605498 0.0341606 0.0243603
+-0.0474966 0.088987 0.0447599
+0.0139221 0.0913152 -0.0287052
+-0.0182228 0.038194 0.0115761
+-0.0697006 0.0619862 0.0158161
+0.0317346 0.0619381 0.0405155
+0.0470668 0.0701831 0.0226957
+-0.0222639 0.0783263 0.0546841
+-0.0624118 0.148891 -0.00459657
+-0.0245152 0.111258 0.0385919
+-0.0623581 0.164692 -0.0425931
+0.0189449 0.0348191 0.0239933
+-0.0489525 0.123989 0.0308621
+-0.0294789 0.0732089 0.0403736
+-0.0912678 0.12968 0.0332366
+0.0188735 0.102787 -0.0208351
+-0.0542898 0.0343509 0.030786
+0.0541934 0.0628656 -0.00090927
+-0.024607 0.037979 -0.0290368
+-0.0461075 0.164061 -0.00779976
+-0.00480748 0.0854817 -0.0373491
+-0.0398973 0.160894 0.00183362
+0.0122013 0.0878954 -0.0308742
+-0.0609826 0.13955 0.0346529
+0.01801 0.126774 0.0220214
+-0.0720383 0.149669 -0.0395937
+0.0268545 0.0350543 0.018119
+-0.00249757 0.0952299 0.0546317
+-0.0177632 0.0728777 -0.0388934
+-0.00835092 0.0354934 -0.0172056
+-0.0123646 0.109877 -0.0203825
+-0.0385 0.120755 0.0293207
+-0.0614467 0.0335533 -0.00933279
+-0.0144984 0.108621 0.0424908
+-0.071459 0.151188 -0.0433221
+-0.0227544 0.0753712 0.0524561
+-0.0581897 0.157381 0.00697939
+-0.0588054 0.0825509 -0.0205914
+-0.0254269 0.0781373 0.050782
+-0.0176233 0.0450417 -0.02779
+-0.0345002 0.10287 0.040969
+0.0398172 0.0390737 0.00420564
+-0.0642915 0.169488 -0.0607786
+-0.0391909 0.150688 0.00279786
+-0.0817139 0.108721 -0.00159489
+-0.0691226 0.174646 -0.044619
+0.0542982 0.0579702 -0.00188368
+-0.0903603 0.143336 0.0142018
+-0.0554977 0.109766 0.0379077
+-0.0646073 0.15754 -0.0113176
+-0.0857257 0.0994313 0.000394941
+-0.0634657 0.0730594 0.0392535
+-0.0114926 0.0604332 0.0544994
+0.00136064 0.0481752 -0.0296995
+-0.0476605 0.124307 -0.00939578
+0.00152589 0.0731231 0.0568629
+0.0454513 0.0412382 0.0102351
+-0.0555526 0.124119 0.0389742
+0.0111749 0.035437 0.032711
+-0.0631468 0.156791 -0.0395997
+-0.0364943 0.115224 0.0327734
+-0.0687764 0.180487 -0.0583042
+-0.0558353 0.0912839 -0.0220329
+-0.0487756 0.0826651 -0.0212781
+0.0222353 0.0804964 -0.0261413
+-0.0698715 0.11424 0.0504282
+-0.0534972 0.0732542 0.0410474
+-0.0354707 0.0874527 0.0429689
+-0.0522647 0.117566 -0.0142997
+-0.0687471 0.158212 -0.0056007
+0.0254863 0.0578069 0.043747
+-0.0625026 0.0973365 0.0428841
+-0.00849427 0.0925522 0.0562249
+-0.076914 0.17371 -0.0479126
+0.0285085 0.121244 0.0144975
+-0.0649629 0.0620542 -0.00149187
+-0.0487919 0.135536 0.0203921
+-0.0406031 0.160882 0.00257136
+-0.0717214 0.0807275 -0.0154713
+-0.0759462 0.128163 -0.00785989
+0.0065117 0.129736 0.0249737
+-0.00106791 0.0391062 -0.00597311
+-0.0539473 0.03352 0.0103166
+0.0264479 0.103016 -0.017087
+0.0368588 0.0672041 -0.0137655
+-0.0209608 0.0380992 0.0183358
+-0.0922682 0.12272 0.00827864
+-0.0758891 0.119352 -0.00728174
+-0.0619808 0.0469192 0.00268857
+0.0286963 0.0991802 -0.016993
+0.0173223 0.125777 -0.00156033
+-0.071812 0.0879125 -0.0161091
+-0.0634945 0.102894 0.0414572
+-0.0534816 0.0491363 0.0336594
+-0.0677428 0.164471 -0.018256
+0.0418243 0.102828 0.00318021
+-0.0345003 0.0347932 0.0310568
+-0.0508009 0.0912872 -0.0218676
+0.0344847 0.0868408 -0.0179179
+0.0193386 0.0579734 -0.027391
+-0.0621388 0.0334692 0.00329381
+-0.017215 0.175671 -0.0245809
+-0.0538714 0.0449084 0.0167075
+0.0201621 0.124133 -0.00175315
+0.00612185 0.108732 -0.0201634
+0.0101112 0.110138 -0.0193681
+0.0407992 0.0698146 0.0307925
+-0.0186672 0.0495328 -0.0300927
+-0.0804551 0.134426 0.050865
+-0.0719585 0.0377493 0.00378419
+0.00950065 0.0688226 0.0549942
+0.0451024 0.091769 0.003186
+0.0116064 0.121838 0.0345253
+-0.07744 0.155698 0.0205089
+0.0154982 0.118174 0.0357451
+0.0455409 0.0918154 0.00916522
+-0.0825371 0.14737 0.037761
+0.00019241 0.0853625 -0.035651
+-0.0413557 0.0405762 -0.0252979
+-0.00795135 0.129264 0.0240771
+-0.00779714 0.0812765 -0.0379169
+0.0279176 0.0508447 -0.0187774
+-0.0851867 0.0791254 0.00650076
+-0.071556 0.161392 -0.00951947
+0.0302201 0.119789 0.0108648
+-0.0664004 0.120055 0.0514481
+-0.0652563 0.0459546 0.00568144
+-0.0484523 0.0349311 0.00836568
+0.050668 0.0451751 0.0191374
+0.0235092 0.118527 -0.00774096
+-0.0799897 0.135372 -0.00407226
+0.0454193 0.0875784 0.00318139
+0.0218862 0.107458 -0.0158341
+0.0519418 0.0525693 0.0274887
+-0.0174883 0.044685 0.0517611
+-0.0503006 0.134918 0.0263293
+-0.0797918 0.11331 -0.00252121
+0.0170867 0.039703 -0.0206999
+-0.00603107 0.130744 0.0146461
+-0.0614566 0.0372076 0.0201515
+-0.0634342 0.039353 0.0417984
+-0.0520389 0.0545474 0.0246248
+-0.0700192 0.172057 -0.036324
+0.0425828 0.0778099 0.0282065
+-0.0943409 0.12415 0.0172628
+-0.03739 0.165304 0.000185179
+0.0380556 0.0834519 0.0357476
+-0.0140374 0.0384483 0.0012996
+-0.0834291 0.14469 0.0401339
+-0.055347 0.0335038 0.00284205
+-0.0577441 0.0590406 0.000553128
+-0.0586534 0.154964 0.024223
+-0.0627416 0.148221 0.0374769
+-0.0597552 0.0781833 -0.0189903
+-0.0882134 0.141936 0.0111996
+0.0441966 0.0973694 0.0101636
+0.00324014 0.0740573 -0.0349749
+-0.0320743 0.0763998 -0.0305477
+0.0424682 0.0642865 0.0278791
+0.00647808 0.111357 0.041027
+0.0241747 0.0351145 0.0138772
+-0.0842625 0.100702 -0.00260902
+-0.0538049 0.0486373 0.0382673
+0.0033632 0.097467 -0.0272178
+-0.0526204 0.141613 0.022402
+0.0331357 0.0570437 -0.0137102
+0.00753436 0.104363 0.0436686
+-0.029494 0.0631194 0.0377814
+0.0357221 0.0994501 0.0342567
+0.0398205 0.0604422 -0.00479028
+-0.0134826 0.109991 0.0421694
+-0.0618817 0.161578 -0.0325898
+-0.00560304 0.0434101 -0.0260312
+-0.0274608 0.0473022 0.0495228
+-0.065855 0.0967089 -0.0173163
+-0.00276158 0.0698244 -0.0351738
+-0.00250067 0.110029 0.0428965
+0.0142116 0.123033 -0.00860213
+-0.0633963 0.145356 0.0382744
+-0.033621 0.0519746 -0.0102559
+0.0385319 0.0997972 -0.00779458
+0.0312326 0.118751 0.0098088
+-0.011143 0.128894 0.00267925
+-0.0574832 0.0833327 0.0441985
+-0.0668542 0.114225 0.0472279
+0.0369848 0.0561762 0.0322
+-0.0688663 0.102328 -0.014772
+-0.0246521 0.0478035 -0.0267776
+-0.0806498 0.110292 0.0422048
+-0.0475911 0.163428 -0.00670042
+-0.00358669 0.0376696 -0.025221
+-0.0499193 0.118992 -0.0138138
+-0.0766944 0.171427 -0.0358927
+0.0174979 0.126711 0.000451693
+-0.0107378 0.177152 -0.0244143
+0.0397983 0.0672171 0.0328832
+0.00289976 0.039936 0.0460731
+0.030847 0.0875798 0.0429743
+-0.0394926 0.102848 0.0402648
+0.00332264 0.0568618 -0.0316357
+-0.0367537 0.0783235 -0.0195335
+-0.038823 0.0928858 -0.0233898
+-0.0644838 0.0931562 0.0439721
+-0.0298466 0.0385336 -0.0167929
+-0.0548009 0.0449973 0.0226803
+0.0118375 0.0344099 -0.0160341
+-0.0683506 0.181259 -0.055895
+-0.0107728 0.0387832 -0.00390135
+-0.0300375 0.0890464 -0.0285748
+-0.0710857 0.168903 -0.0252489
+-0.0757782 0.149978 -0.0188682
+0.030839 0.0995119 0.0394948
+-0.0329249 0.0369927 0.0503412
+-0.0732448 0.144163 -0.0109449
+-0.0897565 0.140652 0.029182
+-0.0735905 0.154201 0.0306806
+0.00579855 0.0347845 0.042995
+-0.0519166 0.0545256 0.0236155
+-0.01212 0.102458 0.0438351
+-0.0211595 0.178661 -0.0149212
+-0.014608 0.0421127 -0.0270124
+-0.0885789 0.0922253 0.0228661
+-0.0145885 0.128899 0.00863716
+0.010498 0.0909888 0.0536897
+-0.0066489 0.0388823 -0.00316153
+-0.0258212 0.0839605 -0.0371412
+-0.0797525 0.15498 0.0124103
+-0.0414563 0.108465 0.0385585
+-0.0525315 0.149847 0.0192949
+-0.0156627 0.184575 -0.0209705
+0.0428837 0.0887839 -0.00581701
+0.0242564 0.0734016 -0.0257301
+0.0192994 0.062217 -0.0274738
+-0.0310269 0.122601 -0.0056394
+-0.0569847 0.153801 0.0277423
+-0.0526515 0.0504392 0.0286525
+0.00150192 0.0634213 0.0567922
+-0.0838556 0.139345 0.0449552
+-0.0476133 0.0562658 -0.0107838
+-0.0527007 0.0693372 -0.0141095
+-0.0311494 0.157393 -0.0113544
+0.00313658 0.0348497 0.0441849
+-0.0311581 0.17265 -0.0162683
+0.0453494 0.0847845 0.0201731
+0.0285114 0.0619268 0.0428923
+0.000499004 0.0634057 0.0567297
+0.00751117 0.0575089 0.0530994
+-0.000499443 0.114191 0.0415203
+-0.0794921 0.146102 0.0417961
+-0.0252738 0.0381933 0.0263814
+-0.0376796 0.16681 0.00156763
+0.0387661 0.0870401 -0.0137857
+0.0296088 0.12015 0.0163431
+-0.0938694 0.121489 0.0252875
+-0.0396002 0.125498 -0.0067103
+0.0370837 0.103994 -0.00683208
+-0.0465559 0.0461276 -0.0102455
+0.0404351 0.0389029 0.0137659
+-0.0424925 0.100104 0.042001
+-0.0285717 0.12063 0.0270994
+-0.0800863 0.148726 0.0380799
+0.00214563 0.119376 -0.0145717
+-0.0288792 0.104408 -0.0227314
+-0.0312735 0.034639 0.0229335
+-0.0669165 0.12238 -0.00897156
+-0.0890273 0.0956446 0.021399
+-0.0897683 0.091592 0.0154417
+-0.0739499 0.156872 -0.0269145
+0.00919729 0.039194 0.0451612
+-0.0374937 0.109757 0.0368609
+0.0523694 0.0545712 -0.00274385
+-0.0339801 0.0348087 0.0434578
+-0.00541562 0.128879 0.0264449
+-0.0636022 0.151642 0.0357576
+-0.0693902 0.0672718 0.0289371
+-0.0220481 0.121595 -0.00868192
+-0.0390536 0.127857 0.00108873
+-0.090122 0.144414 0.0285066
+-0.0629168 0.114269 -0.0126902
+-0.0930993 0.129616 0.0162363
+-0.0325132 0.0575193 0.0378292
+-0.0193156 0.162502 -0.00702982
+0.00550789 0.0910775 0.054811
+-0.0234801 0.168298 -0.011313
+0.0473422 0.0575607 -0.00551801
+0.0214637 0.0989203 0.04607
+-0.0827604 0.106087 -0.00164696
+-7.52397e-05 0.037877 0.020989
+-0.0345343 0.126083 0.0189612
+-0.0512338 0.164096 -0.00192926
+-0.0477776 0.0826677 -0.0211258
+-0.0368214 0.16531 -0.000729186
+-0.0673944 0.162815 -0.015253
+-0.0186701 0.0971551 0.0477534
+-0.0366241 0.0360289 0.0452882
+-0.0195815 0.0341867 -0.0200865
+0.0298019 0.0862025 0.0431971
+-0.0932655 0.120203 0.038289
+-0.000505415 0.110024 0.0426421
+-0.0191383 0.16678 -0.0189611
+0.0173062 0.0421724 0.0440438
+0.0105403 0.105742 0.0436489
+-0.0345641 0.11594 -0.0146748
+-0.0944618 0.125537 0.019259
+-0.0679091 0.108046 -0.0128123
+0.0268137 0.118694 -0.00391821
+-0.0577288 0.0738232 -0.0175832
+-0.0494959 0.0988033 0.0435442
+0.0425948 0.0873487 -0.0068057
+-0.0366079 0.114094 -0.0167422
+-0.0064886 0.118022 -0.0150746
+-0.0694599 0.155751 0.00874428
+-0.0727804 0.0887809 0.0411113
+-0.0921325 0.117269 0.0252198
+-0.0769942 0.154149 -0.012901
+0.00413641 0.0979047 -0.0256761
+-0.0504737 0.113932 0.0347324
+-0.00655213 0.0389811 -0.00882376
+-0.021105 0.0431099 0.0534593
+-0.0732611 0.161033 -0.0359392
+-0.0668535 0.0938084 -0.0173106
+0.0523234 0.0724358 0.00729932
+-0.02575 0.0536249 0.0391706
+-0.0529014 0.114056 -0.0162353
+-0.0887923 0.1378 0.0112057
+-0.0604332 0.0585193 0.0100455
+-0.0105014 0.0546468 0.0522278
+0.0475389 0.0482604 0.0280949
+0.00247406 0.123881 0.0337357
+0.0282809 0.0389301 0.0276504
+-0.0903128 0.141958 0.0142327
+-0.0457178 0.0724199 -0.0170809
+-0.0393802 0.149525 0.00137589
+-0.0384762 0.128323 0.0101316
+-0.0387951 0.0343342 0.0305488
+-0.0627886 0.154765 0.0285735
+-0.044804 0.0884409 -0.0220028
+0.00621048 0.0851628 -0.0331463
+-0.0124997 0.0938947 0.0551641
+-0.0760018 0.163203 -0.0170986
+-0.0568081 0.154369 0.0248865
+0.0141304 0.056278 0.0501629
+-0.000201542 0.0357861 0.0174114
+-0.0687337 0.0764635 -0.0155195
+-0.0465141 0.0518831 0.0377757
+0.0306859 0.0377485 0.0237503
+-0.0887758 0.149859 0.0255696
+-0.0468066 0.088437 -0.0220186
+-0.0104567 0.111397 0.0420636
+0.00949238 0.0487693 0.0494463
+-0.0344171 0.0343826 0.0278837
+-0.0747225 0.161031 -0.0319529
+-0.00127097 0.123959 0.0338052
+0.0484686 0.0511467 0.0294828
+0.0216142 0.042218 0.0415059
+0.0159587 0.0874032 0.0512942
+-0.0579584 0.0336225 0.00939861
+0.0262865 0.0689766 -0.0234385
+-0.0457839 0.11676 -0.0154906
+-0.0431023 0.149502 -0.00451393
+0.0575358 0.0592738 0.00218909
+-0.0907151 0.116093 0.0293225
+-0.0626986 0.0658458 -0.00782349
+-0.0680529 0.0874243 0.0435129
+-0.0323521 0.0336874 -0.0296376
+-0.0208013 0.108893 -0.0213287
+0.00800637 0.0345135 0.0400968
+0.0600686 0.0650603 0.0191749
+-0.0881094 0.0861284 0.0104766
+-0.0292466 0.166794 -0.00735295
+-0.0455037 0.159315 0.00726546
+-0.0361152 0.127822 0.0095198
+-0.00430156 0.130062 0.00233767
+-0.032509 0.0506603 0.0384213
+-0.0316129 0.119551 -0.0104429
+0.0414143 0.104258 0.0111621
+-0.075527 0.0733333 0.0311756
+-0.0549715 0.161246 0.00205939
+-0.0503915 0.140104 0.0183826
+0.0152276 0.0835585 -0.0295949
+-0.0464862 0.0718998 0.0415251
+-0.00551998 0.0732424 0.0584734
+-0.0900165 0.133639 0.00622839
+-0.069719 0.0887582 0.0422978
+0.00474777 0.0367585 0.0247919
+-0.027126 0.165248 -0.0165316
+-0.0283135 0.0350192 0.0513697
+-0.0318897 0.0721821 -0.0275085
+0.0437433 0.0945326 0.0221692
+-0.0126802 0.0961728 -0.031918
+-0.0567215 0.04662 0.0276747
+-0.00532834 0.0367049 -0.0158504
+-0.0529595 0.0335568 -0.000338033
+-0.0240311 0.112816 -0.0174462
+0.01097 0.0520216 0.0508135
+-0.0328411 0.0915526 -0.0242438
+-0.0552728 0.0335199 0.0136226
+-0.0820994 0.104661 -0.00359906
+0.035799 0.0558975 -0.00871505
+-0.0868952 0.0991223 0.0252196
+-0.0296012 0.120713 0.0267425
+-0.0695324 0.125657 0.0522171
+-0.0424937 0.0790081 0.0428161
+-0.0632658 0.0419596 0.040132
+-0.0699149 0.161541 -0.0103834
+-0.0345105 0.0676457 0.041143
+-0.00514301 0.0997589 0.0492461
+-0.0697588 0.147131 -0.0275571
+0.0580762 0.0648724 0.00314588
+0.0241035 0.1245 0.0085821
+0.0377445 0.110141 0.00501649
+0.0413546 0.0999884 -0.00181466
+0.0180964 0.0604579 0.0488964
+-0.0341434 0.0780256 -0.025502
+0.0365014 0.0756142 -0.0127863
+0.0485013 0.0651587 0.0285278
+-0.0331365 0.162399 -0.0024379
+-0.0578171 0.08688 -0.0211007
+-0.0591308 0.125513 0.0408421
+-0.0248084 0.0826031 -0.0377611
+-0.00847175 0.0920515 -0.0356471
+-0.0281451 0.166722 -0.0170726
+0.0321478 0.0740867 0.0412125
+-0.0318598 0.0496767 -0.0173511
+-0.0683644 0.0381281 -0.00463362
+-0.0293612 0.0383343 -0.00169706
+-0.0546971 0.0334232 0.00665025
+-0.0604511 0.0584329 0.0155226
+0.0356702 0.108162 -0.00482135
+-0.087994 0.0981671 0.00544953
+0.042672 0.0737568 0.0282004
+-0.0414969 0.095865 0.0421344
+0.0227593 0.0727654 0.0487302
+0.0247922 0.121532 -0.00113746
+0.0282353 0.0775351 -0.0225519
+-0.0487687 0.0559317 0.0351683
+-0.0192566 0.180095 -0.0235875
+-0.0250606 0.0603159 -0.031412
+-0.0310964 0.160762 -0.0139612
+0.0143682 0.0767494 0.0542274
+-0.0714649 0.159596 -0.0419316
+0.0454023 0.0875829 0.0161653
+-0.0354973 0.0470472 -0.0223112
+-0.0465703 0.0490167 -0.00974944
+0.025334 0.0435501 0.0381106
+-0.0785372 0.168054 -0.0329755
+-0.0148858 0.0985034 0.047376
+-0.0302927 0.117007 -0.0138211
+-0.0802651 0.0963563 -0.00854135
+-0.030624 0.0348272 -0.0303515
+-0.000406928 0.0996624 0.04942
+-0.0576871 0.0335309 0.00594357
+-0.0923088 0.114683 0.0143254
+0.00732004 0.0351406 -0.00439972
+-0.00948171 0.174183 -0.0285537
+-0.0320503 0.12646 0.00953655
+0.0270529 0.0822264 0.0462092
+-0.0900419 0.139254 0.023178
+-0.0498185 0.0927102 -0.0215416
+-0.00751389 0.102333 0.0437439
+-0.0775302 0.161724 -0.0197184
+-0.044496 0.0451943 0.0419603
+-0.0362032 0.160944 0.000172036
+-0.0314741 0.053189 0.0369367
+-0.072385 0.158213 -0.0369175
+-0.0860963 0.145967 0.0357039
+-0.0554937 0.100184 0.0430705
+-0.0523102 0.116406 -0.0150785
+-0.0518166 0.09273 -0.0219218
+-0.024907 0.0916549 -0.0335476
+-0.0634479 0.141036 0.0381413
+0.0152366 0.121915 0.0327966
+-0.0631227 0.0445391 0.0377156
+-0.0865336 0.141884 0.00820248
+0.00748358 0.11412 0.0398951
+-0.071965 0.136965 -0.0074383
+-0.0608999 0.058839 0.0168686
+-0.0886398 0.102364 0.0173768
+-0.0688031 0.0659098 0.026726
+0.02824 0.0686155 0.0425458
+-0.0196877 0.127428 0.0169554
+0.0332508 0.0906175 -0.0178979
+0.019654 0.122236 -0.00577023
+-0.0457281 0.151677 -0.00565337
+-0.0685681 0.156629 -0.0529972
+0.0455148 0.0801982 0.0216904
+0.0232513 0.0734458 -0.026356
+-0.0856264 0.110331 0.00634317
+0.032415 0.0383305 -0.000488607
+-0.0697489 0.17084 -0.0530327
+0.0127518 0.0887452 0.0537008
+-0.0650469 0.168333 -0.0359323
+-0.0312058 0.066507 -0.0244549
+-0.0481456 0.14427 0.00342034
+-0.0250932 0.0385898 -0.0121739
+-0.0268796 0.181867 -0.0133655
+-0.0624905 0.0804598 0.0431805
+-0.0664501 0.0353918 0.0342807
+-0.0287674 0.078167 -0.0351681
+0.0384815 0.0729589 -0.0117402
+-0.0325668 0.0347124 0.0262002
+0.0258782 0.0645831 0.0443789
+-0.0486546 0.0620591 -0.0122264
+-0.086684 0.149909 0.029141
+0.0138472 0.123867 0.0319554
+-0.0513866 0.0584422 0.0306256
+-0.00251219 0.0378133 0.00785027
+-0.00926128 0.126278 0.029483
+0.0147315 0.0347337 -0.0176578
+0.0417187 0.066227 -0.00378154
+-0.0149615 0.0883672 -0.0380383
+-0.0678931 0.0900993 0.043242
+0.0149683 0.113515 -0.0163113
+-0.0719356 0.110274 0.042413
+-0.0333618 0.0751438 -0.0264858
+0.0116984 0.034577 0.0227351
+-0.0670519 0.166375 -0.0237602
+-0.0454276 0.0345386 0.0307405
+-0.00249621 0.0883993 0.0567366
+-0.0235661 0.115415 0.0353667
+-0.0944357 0.121484 0.0222838
+0.0334736 0.0940135 -0.0155006
+-0.0436018 0.0519969 -0.0109067
+-0.0781065 0.0948585 -0.0115273
+0.0456581 0.0729488 0.0206934
+-0.0274951 0.157765 -0.0111917
+-0.00306441 0.100922 0.0454807
+-0.0618021 0.116863 0.0404147
+-0.0344937 0.041903 -0.0294247
+-0.0427476 0.159417 0.00474491
+0.0374917 0.0484328 0.0317174
+-0.00814387 0.0339061 -0.0213361
+-0.0737927 0.132633 0.0513524
+-0.0397231 0.116184 -0.0149076
+-0.00950395 0.0773592 0.0576807
+-0.0505908 0.03436 0.0298011
+0.0187381 0.119283 0.0342968
+0.00523462 0.075444 -0.0346019
+-0.0321194 0.165225 -0.0156285
+-0.0276791 0.1239 0.019992
+0.0190254 0.061825 0.0484929
+-0.0821717 0.11152 0.00033013
+0.0241621 0.0505303 0.0399762
+0.0378012 0.0604211 0.0334272
+-0.0182252 0.159192 -0.00975232
+0.0423754 0.100105 0.0181719
+-0.0546942 0.0661242 -0.0103565
+-0.0685912 0.131247 0.0482807
+0.000498438 0.0938703 0.0551155
+-0.0281544 0.168213 -0.0175818
+-0.0417796 0.0485307 -0.0113147
+0.0287445 0.109341 -0.0118595
+-0.00260812 0.130913 0.0187596
+-0.0454889 0.0660999 0.0395126
+-0.0655106 0.0972881 0.0421527
+-0.0194848 0.0869694 0.0563134
+-0.0264967 0.121204 -0.00819998
+0.00829502 0.0653838 -0.032076
+-0.0287456 0.0753309 -0.0348961
+-0.0727338 0.0821447 -0.0156124
+-0.0470607 0.146242 0.00718592
+-0.0209665 0.0386858 -0.0114366
+-0.0600079 0.128191 -0.00754937
+-0.0653109 0.180421 -0.0593142
+-0.0559148 0.0548054 0.00768529
+-0.0524976 0.0917711 0.0441581
+0.0212182 0.0847586 -0.026404
+-0.0579878 0.0414274 -0.0083271
+-0.0726954 0.0791971 -0.0139413
+-0.0307256 0.0915724 -0.0247467
+-0.0556334 0.11822 -0.0129265
+-0.0457806 0.0841121 -0.0213757
+0.00438413 0.0465246 -0.0275852
+-0.010477 0.110005 0.0426237
+-0.0896333 0.0929554 0.018431
+0.0397783 0.106996 0.0151622
+-0.0127593 0.0728576 -0.0383837
+0.0319543 0.0766492 -0.0197037
+0.00131984 0.0612266 -0.0334746
+-0.0834451 0.136657 0.0474496
+-0.0558128 0.0869147 -0.0214989
+0.00250708 0.0474439 0.0499052
+0.0125018 0.115423 0.0374065
+-0.00563766 0.13083 0.0104776
+-0.0658527 0.144237 -0.0148815
+-0.089646 0.0929438 0.0164332
+0.0436072 0.041137 0.00426675
+0.0444767 0.0889055 -0.00179899
+-0.057137 0.0562876 0.0015684
+0.00522768 0.0810328 -0.0339223
+-0.0137183 0.0628763 -0.0368336
+0.00133514 0.0554198 -0.0315391
+-0.0188851 0.0334951 -0.0249427
+0.052927 0.0495927 0.0235839
+0.0522184 0.0461787 0.0182078
+0.0165976 0.0348504 0.0271124
+-0.0589342 0.12267 0.0410891
+-0.0669714 0.163891 -0.0179699
+-0.0703202 0.132668 0.0493213
+-0.0776493 0.0787462 -0.00818258
+-0.0881736 0.132451 0.0437642
+-0.0632228 0.141176 -0.0069873
+-0.0713401 0.171022 -0.0310853
+-0.047409 0.166836 0.00227952
+-0.0141433 0.181604 -0.0223083
+-0.0619045 0.104018 -0.0180451
+-0.0483068 0.13712 0.0113971
+0.0136813 0.0952834 0.0497668
+0.035272 0.0660164 0.0386352
+0.0461881 0.0785676 0.017326
+-0.0532105 0.0335853 0.013987
+-0.0171786 0.0971676 0.04907
+-0.0725346 0.145512 -0.0179133
+-0.0333802 0.0498304 -0.01435
+0.0509184 0.0496314 0.0259504
+-0.0572784 0.0576838 0.00160501
+-0.0619689 0.153737 -0.0245819
+-0.0544985 0.104295 0.0412117
+-0.0500704 0.137041 0.0213927
+-0.0191411 0.0697535 0.053261
+0.0582061 0.0634965 0.00313887
+-0.0204853 0.0800483 0.0563065
+-0.0472097 0.0335059 -0.0119372
+-0.0749299 0.155492 -0.0209193
+-0.0698715 0.116492 -0.00825865
+0.0375436 0.055493 0.03143
+-0.0538462 0.137744 -0.0016929
+-0.0607335 0.034496 0.0414254
+0.0295159 0.107768 -0.0121736
+-0.0689178 0.168027 -0.0530164
+-0.0779935 0.171503 -0.0379488
+-0.0881443 0.0887489 0.00447233
+-0.00442605 0.128738 0.0268092
+0.00451348 0.0633892 0.056472
+-0.0818952 0.134036 0.0502533
+-0.0372574 0.124492 0.0238955
+0.0138426 0.11139 -0.0180298
+-0.0818741 0.119187 -0.00382424
+-0.0756587 0.0744591 -0.00795246
+-0.026115 0.158145 -0.00104516
+0.037495 0.0513025 0.031739
+0.0589255 0.0580383 0.0211692
+0.0434376 0.0874432 0.0261531
+-0.0260776 0.125932 0.00880255
+-0.0740662 0.155757 0.0246008
+-0.0178239 0.0387614 0.0327968
+0.0417114 0.091515 -0.00780409
+-0.0241449 0.0905492 0.0505682
+-0.074497 0.124608 0.0532356
+-0.0458334 0.0927472 -0.0217986
+-0.0804383 0.111326 0.0449881
+-0.00529252 0.125273 -0.00885488
+-0.0889223 0.0888194 0.00846703
+-0.00624295 0.130196 0.00449841
+-0.0669483 0.0447271 0.0026821
+-0.0548497 0.0941617 -0.0218342
+-0.0534962 0.0931826 0.0441514
+-0.0347147 0.0696617 -0.0176192
+-0.0440132 0.0366004 -0.0242792
+-0.0474979 0.0464882 0.040801
+-0.0653409 0.0600919 0.00943789
+-0.0231718 0.171204 -0.0201308
+-0.00587295 0.130011 0.00319127
+-0.0664676 0.0383698 -0.00648508
+-0.0886456 0.0935942 0.0229142
+-0.0447618 0.116708 -0.0154556
+0.0194756 0.100345 0.0462123
+-0.0154951 0.0911415 0.0560918
+-0.0371641 0.0342638 0.0291868
+0.0162971 0.0651874 -0.0294171
+-0.0291548 0.169699 -0.0175574
+-0.0704877 0.0623972 0.0153213
+-0.0774944 0.092744 0.0372295
+-0.00984328 0.0975178 -0.0293224
+-0.0784995 0.162482 -0.0259435
+-0.0145068 0.0730096 0.0554058
+0.0203473 0.0727595 0.0505294
+-0.0616196 0.156864 -0.0215888
+-0.0832232 0.0789707 0.00151853
+0.0163786 0.0403059 -0.0216745
+0.000325641 0.0568761 -0.0321896
+-0.0192766 0.0554309 0.0481999
+-0.00592104 0.0389465 -0.0049376
+-0.0499986 0.143197 0.012378
+-0.0355049 0.076131 0.0419036
+0.053394 0.0525543 0.0260735
+0.00630024 0.125509 0.0321214
+-0.0349082 0.033686 0.00682403
+-0.0714928 0.117552 0.0529474
+-0.0589919 0.15382 0.0299308
+0.0585035 0.0621132 0.0229868
+0.00569406 0.0341002 0.00181761
+-0.0155184 0.118264 0.0365807
+-0.0424989 0.16674 0.00381643
+-0.0863225 0.128011 -0.00168174
+-0.0553953 0.118382 0.0373919
+0.0469197 0.0444607 0.00136465
+-0.056091 0.0334157 -0.00629765
+-0.0361548 0.166687 -0.0142688
+-0.0127937 0.0386426 -0.0153707
+-0.0118501 0.11995 -0.013068
+-0.00670797 0.0627873 -0.0354975
+-0.079327 0.169353 -0.0390258
+-0.0437872 0.0855322 -0.0215732
+-0.0280896 0.0549613 -0.0243859
+-0.0584052 0.033525 -0.00869675
+-0.0482395 0.144672 0.00644062
+-0.0554929 0.0932384 0.0449182
+-0.0347045 0.0851136 -0.0245778
+-0.0494996 0.0791204 0.0440794
+0.0372047 0.0385834 0.00228863
+0.0193241 0.0607694 -0.0271316
+0.00852018 0.0702413 0.0555324
+-0.0778099 0.148638 -0.00388521
+-0.06539 0.178765 -0.0548301
+-0.04996 0.133052 -0.000571002
+-0.0847199 0.0939171 -0.00356265
+-0.0326229 0.0385148 -0.00990233
+0.032773 0.036599 0.0179277
+0.0427869 0.0611675 -0.0033403
+-0.0366336 0.0548529 -0.010755
+-0.0870489 0.0900041 0.00248653
+0.0416085 0.0656213 0.0284032
+0.00293844 0.100629 -0.0225769
+-0.0728162 0.0907583 -0.0154663
+-0.0718707 0.116473 -0.00776413
+-0.0937263 0.121427 0.0132848
+0.00471758 0.0346554 0.0428856
+-0.0704897 0.0719829 -0.0097429
+-0.050201 0.0344166 0.0315946
+-0.0796522 0.0704439 0.0152371
+-0.0425023 0.0986936 0.0421906
+0.0383887 0.0445417 -0.00444706
+0.0311086 0.103751 -0.0138751
+-0.0667119 0.155932 -0.00484005
+-0.0912006 0.121567 0.0443209
+-0.019019 0.0418114 0.0529435
+-0.0892823 0.141954 0.0132429
+-0.0221125 0.0389367 0.0353489
+-0.0563218 0.0335364 0.00802021
+-0.0896372 0.0929496 0.0174335
+0.0130767 0.125591 0.0302496
+0.0537776 0.0692651 0.00258827
+0.0106605 0.0363802 0.031763
+-0.0297187 0.0523119 -0.0193651
+-0.0140732 0.0383739 0.00681638
+0.0269054 0.0726895 0.0441444
+0.0246103 0.075474 0.0479027
+-0.00359864 0.0405713 -0.0254999
+0.0269298 0.0804165 -0.0233375
+-0.0488158 0.0912881 -0.0217052
+-0.00415439 0.0390536 -0.00654274
+0.000507304 0.0828912 0.0574668
+-0.0158173 0.038248 0.0138275
+-0.0624172 0.0599054 0.00479638
+0.0162074 0.0821136 -0.0291532
+-0.0419982 0.0337727 -0.000124238
+0.0250957 0.0348061 0.00319961
+-0.0309108 0.0608665 -0.0194213
+-0.0387236 0.174145 -0.00898261
+0.0464355 0.0778581 0.0101835
+-0.0639936 0.132595 -0.00811291
+-0.0340062 0.0381682 0.049242
+-0.0477004 0.131837 0.0244001
+-0.00268932 0.130846 0.00581897
+0.0302059 0.0857499 -0.020278
+0.0384903 0.0499056 0.0320993
+0.010384 0.0463357 -0.0254801
+-0.00660048 0.0405957 -0.0258634
+-0.0114989 0.0366056 -0.0169842
+0.0105059 0.0348976 0.020389
+-0.0487973 0.070279 0.0395574
+-0.0394971 0.057712 0.040203
+-0.0253679 0.125634 0.0163937
+0.0361389 0.0902387 0.0383091
+-0.0654905 0.0889779 0.0446185
+-0.0197462 0.0656505 -0.036857
+0.0320676 0.117774 0.0158308
+0.00351414 0.0661565 0.0562774
+-0.0226137 0.0422636 -0.0288734
+-0.019191 0.123923 -0.00519119
+-0.0532423 0.046246 0.0226735
+-0.021638 0.0464604 -0.0276852
+0.0272834 0.0689403 -0.022937
+0.0211914 0.124678 0.000362022
+0.04653 0.0760573 0.0105389
+-0.0338201 0.127158 0.00888963
+-0.077651 0.154407 0.00585132
+-0.0417202 0.0710768 -0.017536
+-0.0887218 0.0874968 0.0134639
+0.0165095 0.0354073 -0.0166384
+-0.0454406 0.0336534 -0.00804117
+-0.0504088 0.153575 0.0112235
+-0.0286428 0.107004 -0.0213195
+-0.0218765 0.0933131 0.0510401
+0.0329715 0.116865 0.0119087
+-0.0914625 0.148845 0.019136
+-0.0596259 0.155781 0.0151651
+0.0375784 0.099381 0.0316743
+-0.0157845 0.0784788 -0.0385671
+-0.0795217 0.123111 0.0512585
+-0.0418108 0.0343847 0.029868
+0.0389991 0.108356 0.0151637
+-0.0709225 0.109376 -0.0106672
+0.0579353 0.0634887 0.0239229
+-0.058577 0.0727277 0.0406017
+-0.062479 0.152546 0.000181648
+-0.0544934 0.0834141 0.0452404
+0.0357112 0.102065 0.0324889
+-0.0715263 0.0944187 0.0416527
+-0.0651404 0.112408 0.0390225
+-0.0545541 0.160714 0.00540511
+-0.0144079 0.183333 -0.0275579
+-0.0621531 0.152198 -0.0185797
+-0.0657166 0.14722 -0.0249021
+-0.0460756 0.154674 -0.00723534
+0.01519 0.127729 0.000331934
+-0.0489579 0.137072 0.00640402
+-0.0485683 0.0335187 -0.00854361
+-0.0885037 0.114225 0.0283481
+-0.0540375 0.141288 -0.0013423
+-0.0472373 0.134368 0.0171539
+-0.0272298 0.037736 0.022792
+-0.0518585 0.0985114 -0.0220738
+-0.0110867 0.180248 -0.025982
+-0.0236236 0.0593674 0.0425181
+-0.0408247 0.092859 -0.0231395
+0.0561988 0.0567015 0.0248562
+-0.0086058 0.172644 -0.0268228
+0.0163504 0.0552051 -0.0284322
+-0.0344945 0.0336038 -0.0243554
+-0.0556539 0.0345276 0.0424927
+-0.0348371 0.155104 0.00211833
+0.0276605 0.0605608 0.0434107
+-0.0623508 0.146001 -0.00658982
+-0.0248115 0.081196 -0.037776
+0.0240847 0.110594 -0.013209
+-0.0895075 0.148492 0.0263454
+-0.0926235 0.124077 0.00926903
+0.0292051 0.0843756 -0.0209031
+-0.0353048 0.127501 0.00687019
+-0.0859011 0.134922 0.00126737
+-0.0742444 0.0756609 0.0347079
+-0.0752605 0.157705 -0.0064221
+-0.0337955 0.0808164 -0.0255276
+-0.0288635 0.154571 -0.00355817
+0.0360371 0.0547702 0.0325687
+-0.0101249 0.0392126 0.0357767
+0.0288986 0.120838 0.016073
+-0.0106831 0.0570151 -0.0340192
+-0.0628045 0.144114 -0.00718004
+-0.0895701 0.151478 0.0161361
+-0.0176156 0.0385615 0.0294218
+-0.0211148 0.0389017 0.0355855
+0.0329392 0.0541774 -0.0107445
+-0.00428899 0.0367463 -0.0156853
+-0.0458368 0.0956376 -0.0219211
+0.0381262 0.080772 0.035847
+0.0268148 0.0976356 -0.019356
+-0.0625367 0.161521 -0.0446005
+-0.0517979 0.0869425 -0.0216307
+0.0344672 0.111064 -0.00366583
+-0.0911264 0.115738 0.024682
+-0.0753098 0.0805155 0.0368289
+-0.0133248 0.129244 0.00909724
+-0.0272428 0.0370384 -0.018628
+-0.0384762 0.0423266 0.0418914
+0.0203738 0.0521374 -0.0257342
+0.0585485 0.0552063 0.00817117
+0.0134367 0.121611 -0.0110511
+-0.089438 0.113514 0.0412091
+0.0444691 0.0790854 -0.00178456
+-0.000786355 0.0797462 -0.0360298
+-0.0269011 0.155694 -0.0071882
+-0.08839 0.0995952 0.00742201
+-0.0662162 0.0396687 0.0135434
+-0.0355277 0.0846755 0.0433772
+-0.0858238 0.104979 0.0223569
+-0.0778773 0.120773 -0.00663343
+-0.0263675 0.107348 -0.0216948
+-0.0927086 0.12286 0.0332776
+-0.0661966 0.15171 0.0363078
+-0.0202018 0.177138 -0.0227808
+-0.0855834 0.141979 0.0409477
+-0.0504886 0.0946205 0.0445363
+-0.0604928 0.101522 0.0423039
+0.0379519 0.0659398 0.0354557
+-0.0840048 0.140674 0.0436515
+-0.0558989 0.109796 -0.0177742
+0.00991096 0.0343624 0.00242681
+-0.0506409 0.0514954 0.0146147
+-0.0324809 0.117911 -0.0127388
+-0.0621631 0.164652 -0.0535815
+0.0025214 0.130289 0.0235241
+-0.0506513 0.150706 0.0125676
+-0.0175006 0.0829087 0.0576844
+-0.00809599 0.0347439 0.04196
+-0.0340295 0.0384544 -0.00643688
+-0.0694928 0.101384 0.0400561
+0.0446992 0.0776181 0.0241159
+-0.0935142 0.126862 0.0142561
+0.0248702 0.121138 0.0274186
+0.00114443 0.118463 -0.015597
+-0.053795 0.115431 0.0343764
+-0.0905823 0.131055 0.0352302
+-0.00177837 0.0811944 -0.0365591
+0.0316669 0.110076 0.0318865
+0.0355137 0.0902592 0.0391607
+-0.0911524 0.122908 0.0442317
+-0.0909787 0.118866 0.0441649
+-0.0647368 0.0350417 0.0261211
+-0.0694997 0.166373 -0.0203616
+-0.0256221 0.0450194 -0.0280788
+-0.0652445 0.171051 -0.0600934
+-0.0773393 0.152802 -0.0018868
+-0.00223434 0.118045 -0.0151238
+-0.0662482 0.063188 0.0243484
+0.0400602 0.0922366 -0.00959201
+-0.00562712 0.0451708 -0.0285409
+0.000501495 0.0457296 0.0472541
+-0.0123701 0.125297 0.0298351
+-0.0778681 0.101964 -0.00928868
+-0.0609537 0.123826 -0.00859412
+0.0224677 0.112582 -0.013341
+0.00921575 0.0781468 -0.0329463
+-0.0349236 0.126603 0.0011375
+-0.00878487 0.0784493 -0.0377777
+0.00650569 0.075888 0.056486
+0.0412418 0.0802411 -0.00774788
+-0.093262 0.128309 0.02526
+-0.0314363 0.171254 -0.00518552
+-0.0520579 0.0336325 0.0248414
+-0.0815026 0.127419 0.0524098
+-0.0894637 0.136534 0.031204
+-0.084288 0.111698 0.0438155
+0.0333653 0.0918289 -0.0171871
+-0.0324333 0.126109 0.00355422
+-0.00141447 0.0391026 0.0304627
+0.00110904 0.0340429 -0.0196452
+-0.0650297 0.138462 -0.00769967
+-0.015954 0.105864 -0.0221228
+-0.0523859 0.0626167 0.0314055
+0.026783 0.122575 0.00815739
+-0.0385209 0.128019 0.0130694
+-0.029395 0.125597 0.00758806
+-0.0328882 0.0666632 -0.0184721
+-0.0494036 0.13704 0.0193807
+-0.0782331 0.109897 -0.00456592
+0.0157741 0.036715 -0.0196413
+-0.0294956 0.0660091 0.0384906
+-0.0679029 0.105215 -0.0140793
+-0.0620463 0.158428 -0.0205873
+-0.0703503 0.159267 -0.00619145
+-0.0378682 0.104226 -0.0203027
+-0.0918252 0.118761 0.028299
+-0.0411447 0.163664 -0.0114686
+-0.0574975 0.0426993 0.0453715
+-0.0747471 0.147201 -0.0128585
+-0.0134963 0.0744967 0.0564394
+-0.054142 0.0722337 0.0402304
+-0.0642908 0.169609 -0.0607929
+-0.0154978 0.0977476 0.0489325
+-0.0800099 0.07203 0.0185532
+-0.0921132 0.115989 0.0103178
+0.00725505 0.0754138 -0.0341479
+0.0536301 0.0568087 0.0282148
+-0.0479854 0.0346149 0.0371396
+-0.00149257 0.0746611 0.0586297
+0.0203189 0.05934 -0.026848
+-0.0115998 0.0391898 -0.02633
+-0.0295596 0.0663471 -0.0284716
+0.00348965 0.105764 0.0424132
+-0.0703543 0.0703917 0.033048
+-0.0606347 0.0629111 -0.00512698
+-0.01408 0.166026 -0.0199736
+-0.061044 0.0400333 0.0227114
+-0.0810735 0.143155 -0.000828212
+-0.0617474 0.0766736 -0.0179709
+0.0217467 0.124535 0.0248197
+0.00507814 0.101571 -0.0215886
+0.0346034 0.0592134 0.0376264
+-0.0712039 0.0342165 0.00436442
+-0.0288195 0.0384506 0.0326078
+-0.053518 0.1534 0.0145047
+-0.0556759 0.0661408 -0.010195
+-0.0677895 0.175109 -0.0580246
+-0.0699291 0.0421822 0.0072491
+-0.0067422 0.0741543 -0.0369448
+0.0199779 0.0885978 -0.0258535
+-0.0488263 0.0941792 -0.0218889
+0.0343607 0.0505331 -0.00657713
+-0.0725404 0.162229 -0.0113532
+-0.00793663 0.0384098 0.0134736
+-0.0556415 0.043673 0.0216881
+-0.0145298 0.100345 0.0444168
+-0.0815281 0.1484 0.0374104
+-0.0387388 0.0753845 -0.0180569
+-0.0116442 0.0481633 -0.0303354
+0.0363562 0.0559126 -0.00774494
+-0.0652193 0.1682 -0.0598394
+-0.0776736 0.10169 -0.00957801
+-0.0196644 0.0494984 -0.0297043
+-0.0282432 0.0763981 0.0437868
+-0.0328471 0.033696 0.0126517
+0.00347146 0.128699 -0.00262952
+0.0461484 0.0806375 0.015174
+0.0337656 0.111689 0.027893
+-0.0271752 0.172675 -0.0185845
+-0.0693701 0.141497 -0.00893397
+0.0317719 0.115994 -0.000976469
+0.0347163 0.0544411 -0.00865089
+-0.0651886 0.172101 -0.0460875
+-0.0678768 0.1616 -0.0125361
+-0.0634522 0.0423282 0.0135276
+0.0601313 0.0581272 0.0101639
+-0.0107388 0.117999 -0.0150205
+0.0339646 0.0916099 0.0404552
+-0.0498374 0.138571 0.0183794
+-0.0934962 0.117401 0.0173034
+0.0383972 0.0491164 -0.00642484
+-0.0280195 0.0378733 -0.0295429
+-0.0146147 0.12166 -0.00880985
+0.0372641 0.0686531 0.0362559
+0.0239959 0.0549509 0.0433236
+0.00994394 0.0362916 0.0335003
+-0.0208017 0.0799082 -0.0390716
+0.0233991 0.0534151 -0.0239637
+0.00722024 0.0851796 -0.0327872
+-0.0639758 0.128226 -0.00858393
+0.0238189 0.124864 0.00990899
+0.00150975 0.0474485 0.049901
+-0.0361905 0.168183 -0.0140562
+-0.0174884 0.0801344 0.0573382
+-0.0918829 0.116106 0.0333156
+0.00614351 0.12581 -0.00755937
+0.0340287 0.115127 0.0194375
+-0.0908622 0.135106 0.0192089
+-0.000650637 0.0496936 -0.0307015
+-0.0856199 0.144636 0.00717286
+0.0438423 0.0804362 -0.00278861
+-0.00949487 0.0503088 0.0507661
+0.0271211 0.103444 0.039376
+-0.0386188 0.04066 -0.0277325
+-0.0654456 0.154232 -0.00436037
+-0.0264896 0.100224 0.0439794
+-0.0715324 0.144165 0.0446205
+-0.0694829 0.118967 0.0529378
+0.0378869 0.110163 0.00793964
+0.0353212 0.108669 0.0283742
+0.0601522 0.0581329 0.0151721
+-0.0542607 0.057796 0.0208407
+0.00222051 0.130562 0.00190808
+-0.0641033 0.156361 -0.011127
+0.0432299 0.0944972 0.0241641
+-0.0229686 0.033489 -0.025736
+-0.0221215 0.127119 0.0131583
+-0.0671797 0.0604061 0.0141816
+-0.0288776 0.0903901 -0.0295833
+0.0603694 0.0609168 0.00815448
+-0.0494359 0.138587 0.00541192
+-0.0023893 0.0424447 0.047211
+-0.0543474 0.135324 0.0319505
+0.0228597 0.125444 0.016672
+-0.0334812 0.0737514 -0.024477
+0.0348071 0.0781711 0.0398247
+0.0054972 0.0547598 0.0532635
+0.00645879 0.122419 -0.0119062
+-0.0438011 0.128754 0.0022734
+-0.0849152 0.0791131 0.00550947
+-0.0506838 0.0678366 -0.0132392
+0.0126337 0.110109 -0.0186257
+-0.0497701 0.140145 0.0153991
+-0.0724387 0.0819305 0.0395669
+0.0576036 0.0717386 0.0163116
+0.00802743 0.0346823 0.0237027
+0.00218868 0.098191 -0.0260404
+-0.0368205 0.162344 -0.00074381
+-0.070799 0.0908224 -0.0163205
+-0.0539828 0.0700164 0.038652
+0.0135945 0.128354 0.000408423
+-0.0264981 0.0959784 0.0437675
+0.0190214 0.118116 -0.0113006
+-0.0618485 0.153752 -0.0205795
+-0.0552085 0.151192 0.0284379
+-0.0266144 0.0408668 -0.0293519
+0.00698354 0.131641 0.013682
+-0.0316463 0.0595496 -0.0164023
+-0.0758985 0.159659 -0.0269354
+-0.0491601 0.160603 -0.00598464
+-0.00858383 0.0384847 0.0096485
+-0.0717673 0.146065 -0.0213605
+-0.0899696 0.15095 0.0147905
+-0.00955085 0.0385956 0.00389466
+-0.0607249 0.0737695 -0.0169262
+-0.0751542 0.0995011 0.0375123
+-0.0707959 0.0850638 -0.0167146
+-0.0312047 0.123257 -0.00431908
+-0.053995 0.0675039 0.0372692
+-0.0419532 0.0345214 0.0385087
+-0.0289695 0.0380956 -0.0297496
+-0.0121936 0.163667 -0.0136225
+0.021294 0.0721108 -0.027322
+0.0597965 0.0678036 0.00914167
+-0.0657015 0.0736405 -0.0152375
+0.00697022 0.12731 -0.00520393
+0.033357 0.100796 0.0361067
+0.0587791 0.0686289 0.0199155
+0.00149398 0.0394449 0.0343588
+-0.0875531 0.12123 -0.000692815
+-0.0744527 0.154114 -0.0209063
+-0.0172261 0.0356447 0.0515267
+-0.0200013 0.0389743 0.053287
+-0.0569508 0.0343746 0.0319473
+-0.0184875 0.0829081 0.0576141
+-0.019368 0.183116 -0.0157888
+-0.0626506 0.153382 -0.0318715
+-0.00943219 0.095325 -0.0330289
+0.0431395 0.100108 0.0121576
+-0.0608162 0.0881975 -0.019441
+0.0357777 0.070014 0.0376374
+0.0505254 0.0735568 0.0151501
+0.0307633 0.0476275 0.0336614
+0.0294554 0.0416168 0.02991
+-0.0611913 0.173613 -0.0615062
+-0.0146115 0.109635 -0.0201085
+0.0379445 0.0686366 0.0354907
+-0.076675 0.154077 0.000107436
+-0.0315189 0.0351239 -0.0306591
+-0.0768434 0.109781 0.0434593
+-0.0522791 0.0490314 0.0356585
+-0.0380005 0.12652 0.0191796
+-0.0861323 0.103534 0.00440203
+-0.0659084 0.106679 -0.0142087
+0.000468869 0.0388702 -0.00172096
+-0.0623487 0.141045 -0.00649873
+-0.0484952 0.0862244 0.0454118
+-0.0685451 0.170527 -0.0328985
+-0.037499 0.101465 0.0412127
+0.0274201 0.0431121 -0.00573463
+-0.0197554 0.158352 -0.00754965
+-0.0567366 0.0753362 -0.0185878
+0.0533817 0.063336 -0.00140725
+0.0135006 0.105771 0.0435499
+-0.0631905 0.166285 -0.0395881
+-0.0932173 0.122834 0.0272862
+-0.0284888 0.0396421 0.053637
+-0.0134794 0.0559661 0.0512091
+-0.04424 0.130203 0.0124253
+0.0196407 0.0940896 -0.0236062
+-0.0625219 0.151129 0.0359075
+-0.0585008 0.0732388 0.0410714
+0.0608111 0.0651191 0.0151635
+-0.0275116 0.0560234 0.0370088
+-0.0127931 0.0799092 -0.038653
+-0.0544725 0.0478754 0.0402183
+-0.0905041 0.147099 0.0259896
+0.0291224 0.0877617 -0.0209279
+0.0381679 0.0993665 0.0307411
+0.00549435 0.0474709 0.0500045
+-0.0842531 0.102059 -0.0016008
+0.0164869 0.128389 0.00575868
+-0.043156 0.162156 -0.0100947
+0.0445553 0.0846952 0.000180444
+0.0409145 0.07739 -0.0077683
+0.0297353 0.111221 -0.00987421
+-0.0220481 0.0379707 0.0182323
+-0.0636401 0.0337302 0.00992182
+-0.0277909 0.0796672 -0.0363416
+-0.0247513 0.0944605 0.0453863
+-0.0291577 0.0733109 -0.0335988
+-0.0264744 0.0486202 0.0485825
+-0.0654948 0.104238 0.0403184
+-0.054309 0.153692 0.0171048
+0.000886988 0.0365316 0.0205866
+0.025787 0.114054 0.0339562
+-0.0624998 0.091833 0.0450322
+-0.0825753 0.107428 -0.000626511
+-0.0879726 0.100935 0.0073995
+-0.0849555 0.110375 0.0243559
+-0.00450509 0.0815118 0.0573962
+0.0411647 0.0886413 -0.00977915
+0.00923376 0.0823418 -0.0323881
+0.0250818 0.0983923 -0.0201688
+-0.0460388 0.0353834 -0.0203139
+-0.0563344 0.154371 0.0236088
+-0.0786725 0.15564 0.0171569
+-0.0174933 0.120917 0.0332266
+-0.0405771 0.0447491 -0.0223069
+-0.0706839 0.0363372 -0.00115986
+-0.0827485 0.134001 0.0496722
+-0.0566419 0.0336495 -0.0102846
+-0.0932956 0.12823 0.014251
+-0.0183957 0.116542 -0.0154107
+0.03698 0.0590759 0.0339965
+-0.0709427 0.132583 -0.00826816
+-0.0697213 0.0778913 -0.0154943
+-0.0222445 0.159024 -0.0114139
+-0.0571999 0.0684533 0.0375014
+-0.04663 0.0533425 -0.0102323
+0.00628325 0.0668147 -0.0324472
+-0.0477443 0.0767654 -0.0182192
+0.000336625 0.0525175 -0.0304496
+-0.0562455 0.0345922 0.0440034
+-0.00249349 0.0474079 0.0491587
+-0.00849662 0.115566 0.0401952
+-0.0346349 0.176996 -0.009991
+-0.0315471 0.0665587 -0.0224416
+-0.0114919 0.121016 0.0357517
+-0.00348929 0.0884115 0.0568027
+-0.0275554 0.0689002 0.0398598
+0.0463861 0.080656 0.0111753
+-0.0335046 0.109774 0.0374515
+-0.0104184 0.179993 -0.0295246
+0.0299649 0.0370453 0.0224182
+-0.0229027 0.109901 -0.0203838
+0.0326144 0.117295 0.0103313
+0.0369028 0.0954111 -0.0108822
+-0.0564742 0.041367 0.0464242
+-0.0770729 0.168746 -0.0303374
+-0.0310065 0.124592 0.0202545
+-0.06762 0.17339 -0.0440641
+-0.0124743 0.0632507 0.0548154
+-0.06879 0.067714 0.0304363
+-0.0188136 0.124392 0.0261122
+-0.0775236 0.155819 0.0175602
+-0.0744868 0.14835 0.0408614
+-0.0798509 0.120721 -0.00541034
+-0.0474977 0.0747299 0.0422594
+-0.0819076 0.08016 -0.00254028
+-0.0104535 0.0366522 -0.0168147
+0.0107598 0.0346122 0.0387698
+-0.0618853 0.158437 -0.0215849
+-0.0248668 0.103031 -0.023615
+0.0521945 0.0697716 0.0245573
+0.0156704 0.0936059 -0.0251021
+0.0371318 0.111041 0.00479819
+-0.0835634 0.0897492 -0.00557879
+0.00648846 0.118239 0.0378444
+-0.0454996 0.0464888 0.0408011
+0.00251072 0.0388788 0.0260522
+-0.0757603 0.10082 0.036651
+-0.072674 0.131225 0.051196
+-0.0107806 0.0770662 -0.0381287
+-0.0336363 0.153436 -0.00674709
+-0.0843022 0.0938821 0.0298739
+-0.00957953 0.177197 -0.0268263
+-0.06621 0.148552 -0.030869
+-0.0367939 0.127143 0.000444502
+0.0450752 0.0819431 0.00117926
+0.00252922 0.0387278 -0.0124032
+0.0124259 0.130345 0.00996559
+-0.039483 0.112566 0.0355031
+-0.0896451 0.11724 0.00430849
+-0.0307561 0.0876495 -0.0285591
+-0.0336555 0.0363317 0.0490618
+0.00481949 0.0349074 0.0372909
+0.0324749 0.095557 0.0400886
+-0.0601974 0.126918 0.041055
+0.0561271 0.0494063 0.0121912
+-0.0663732 0.0796127 0.0418746
+-0.0634873 0.105626 0.040045
+-0.0348887 0.174114 -0.0129217
+-0.0331172 0.123673 -0.00477506
+-0.0158191 0.0855498 -0.0389623
+-0.0630684 0.138136 0.036884
+0.00839558 0.0418967 -0.0238735
+-0.000234213 0.0957245 -0.0313684
+-0.00270805 0.0387067 0.00335713
+-0.0066107 0.0434378 -0.0261152
+0.0267348 0.0889072 0.0458132
+-0.057498 0.0762057 0.0428357
+-0.0559977 0.128155 -0.00607843
+-0.0652856 0.176792 -0.0608019
+-0.0847322 0.10481 0.00139005
+0.0045205 0.0842507 0.0571459
+-0.0540417 0.148675 -0.00217424
+0.00157845 0.0388465 -0.0127005
+-0.0649294 0.123847 -0.00887936
+0.0268943 0.0906576 -0.0219805
+-0.0692389 0.149629 -0.0402111
+0.0424058 0.101483 0.00416631
+-0.069135 0.0354547 0.0122501
+-0.0311414 0.168206 -0.0166543
+0.0247254 0.0405634 0.0363023
+-0.035656 0.0591967 -0.0115208
+-0.0492298 0.13342 0.00108021
+0.0186953 0.0943115 -0.0238444
+-0.0632815 0.159908 -0.0475928
+-0.0744952 0.144184 0.0450216
+-0.0273351 0.0750142 0.0443436
+0.0129485 0.0726239 0.0538836
+-0.0256504 0.178665 -0.00908499
+-0.0152817 0.126335 -0.00175389
+0.0171854 0.035921 0.00432788
+0.00536983 0.0385261 0.026955
+-0.069701 0.0749104 -0.0135814
+-0.0936513 0.125496 0.0142597
+-0.0218218 0.0854612 -0.0381675
+-0.0670338 0.0819342 0.0426575
+-0.0637771 0.0824308 -0.0191299
+-0.0579197 0.0410941 0.0197057
+0.004329 0.114453 -0.0192954
+-0.0743852 0.111313 0.0463698
+0.0153242 0.0566704 -0.0288596
+0.0201589 0.0349933 -0.00358051
+-0.0674387 0.0336478 0.00564073
+0.0380425 0.109755 0.0161689
+0.0214264 0.0348625 -0.00133145
+0.0129483 0.0405423 0.0447572
+-0.00171529 0.0627358 -0.0345403
+-0.0206569 0.0494682 -0.0293042
+0.0369479 0.0784891 -0.0137448
+-0.0877279 0.139146 0.00920485
+-0.0228745 0.0383806 -0.00412065
+0.0407791 0.105635 0.00716484
+-0.0164884 0.161116 -0.0081783
+0.0261701 0.115347 0.0327443
+-0.0171143 0.0393698 0.0395766
+0.0364251 0.0840505 -0.0167267
+-0.0413094 0.0336719 -0.0183114
+-0.00449481 0.0619627 0.0557718
+0.0354002 0.054813 0.0334165
+0.0257124 0.0795754 0.0477924
+-0.0900689 0.132434 0.0392074
+0.0111597 0.124256 -0.00791398
+0.023574 0.105697 0.0395934
+0.0172046 0.061784 0.0493931
+-0.0738846 0.110669 -0.00843945
+0.00601824 0.128477 0.0276707
+-0.0581623 0.155642 0.0142378
+-0.046474 0.0903329 0.04369
+-0.0204963 0.0988407 0.0444811
+0.0448392 0.0847511 0.0231667
+-0.0246346 0.0464142 -0.0272665
+-0.0164056 0.0347921 0.0489909
+-0.048358 0.146267 0.00883601
+-0.0626778 0.0407451 0.0424121
+-0.06586 0.154377 -0.00304604
+0.0375072 0.103901 -0.00584413
+-0.00221994 0.0380783 -0.0146251
+0.00247871 0.110023 0.0425049
+0.0588331 0.0552392 0.0181818
+-0.0156079 0.0352742 -0.0184368
+-0.0112854 0.0344473 -0.0186905
+-0.0170355 0.0338392 -0.0211402
+-0.0137571 0.128142 0.00234571
+0.0353694 0.082169 0.0388786
+-0.065182 0.160968 -0.0576695
+-0.0324895 0.0874934 0.0434306
+-0.0637445 0.0781022 -0.0180675
+-0.0882379 0.0914593 0.00646904
+0.0256941 0.120543 -0.00190068
+-0.0750751 0.149943 -0.025867
+-0.0477253 0.135673 0.0140062
+-0.0678845 0.116524 -0.00880656
+-0.0627671 0.15529 -0.013592
+-0.0588282 0.0408079 0.0456406
+-0.056691 0.0506774 -0.00137882
+-0.0828622 0.0910525 -0.0066104
+-0.0499126 0.0515141 0.0166499
+-0.0490107 0.146266 0.00962371
+0.0122318 0.130219 0.0070475
+-0.0116803 0.0570084 -0.0342026
+-0.0651676 0.167884 -0.0330971
+-0.0730453 0.0699885 -0.00346826
+0.0174821 0.0990004 0.0469682
+-0.0908453 0.133761 0.025216
+-0.0657306 0.150277 -0.0347821
+-0.0671422 0.159475 -0.0561779
+-0.00377564 0.078412 -0.0370359
+-0.0617811 0.042326 0.0146867
+-0.0252077 0.0348536 0.0435448
+-0.028493 0.0602587 0.0370952
+-0.08903 0.119932 0.00232561
+-0.0345174 0.105629 0.0392495
+-0.0234134 0.181486 -0.0190275
+-0.0664685 0.0611724 0.00451786
+0.0367619 0.0414833 0.0270934
+-0.0275613 0.121213 -0.00819283
+0.0347392 0.0848817 0.0397697
+-0.0655835 0.0626949 -0.00273961
+-0.0187525 0.0671388 -0.037784
+-0.0904123 0.13106 0.0392156
+0.0183728 0.0521803 -0.0265242
+-0.0394837 0.113931 0.0345962
+-0.050497 0.0848226 0.0453947
+-0.026736 0.125755 0.00710307
+-0.0284884 0.0890334 0.0453918
+-0.0441667 0.0657175 0.0402548
+0.0109368 0.035027 0.0276086
+-0.0219243 0.0335307 -0.0255712
+-0.0865855 0.100865 0.00437928
+-0.0114057 0.038823 -0.00778731
+-0.0606205 0.136712 0.0351771
+-0.0938957 0.124187 0.0252761
+-0.0877217 0.151511 0.024071
+0.0027861 0.0392982 -0.00725238
+-0.0435747 0.127942 -0.00117905
+0.00626863 0.114136 -0.0189815
+-0.0182416 0.0386382 0.0310248
+-0.065785 0.145733 -0.0198954
+-0.0867571 0.0833567 0.0144816
+0.0263294 0.0517767 -0.02097
+0.0205436 0.0357642 -0.00368285
+-0.0174561 0.0544373 0.0497557
+0.0051136 0.11017 -0.0202785
+0.0320036 0.0972394 -0.014969
+0.018368 0.0537078 -0.0275601
+0.00449367 0.115547 0.0400425
+0.030957 0.0564285 0.0393343
+-0.0480871 0.166778 0.00155196
+-0.0374511 0.122567 -0.00961353
+-0.067466 0.154933 0.00219081
+-0.0645473 0.0334176 0.0010517
+-0.0507826 0.0530079 0.0196214
+-0.0269873 0.0549465 0.0375414
+-0.0318114 0.0361324 -0.0187
+0.0211923 0.12581 0.0217553
+-0.0485738 0.111377 -0.0178292
+-0.0790938 0.10996 -0.003593
+0.0410408 0.0408917 0.00130956
+-0.0171973 0.174198 -0.0240623
+-0.0136738 0.0526181 -0.0325173
+-0.0194987 0.0828823 0.05729
+-0.00149547 0.119691 0.0381347
+0.0125362 0.127772 -0.00169738
+0.00352032 0.0772514 0.0561756
+-0.0037108 0.0392109 0.0335024
+-0.0682887 0.164315 -0.0170259
+-0.0861823 0.107654 0.00936346
+0.0116633 0.0616767 0.0519085
+-0.0828359 0.104706 -0.00261356
+-0.0473623 0.129578 0.0262098
+0.0143608 0.0508459 -0.0270896
+-0.0265586 0.171236 -0.0104749
+0.0203688 0.0459169 -0.020834
+-0.0404996 0.0591463 0.0404229
+-0.0164937 0.0758406 0.0558352
+-0.00649647 0.0898144 0.056995
+-0.070489 0.118975 0.0531649
+-0.0665486 0.169315 -0.0336077
+-0.0869443 0.101766 0.0237835
+0.0413201 0.104267 0.012164
+-0.0705201 0.0646959 0.0221381
+-0.0345088 0.104256 0.0402356
+0.0590657 0.0691634 0.0182335
+0.0274527 0.103904 -0.0160338
+-0.0321732 0.0461161 0.0457813
+-0.0446011 0.0519723 -0.0106716
+-0.0932418 0.125562 0.0272746
+-0.0458642 0.128671 0.00011454
+-0.0885465 0.0902329 0.022415
+-0.0693724 0.136902 0.0471868
+0.0383558 0.102292 -0.0062663
+-0.0638617 0.125566 0.0463833
+-0.017504 0.0870094 0.0567302
+-0.0370734 0.0393951 0.0451959
+0.00329134 0.119473 -0.0147093
+-0.0543235 0.0334648 0.00849253
+0.0274945 0.0381011 -0.00197122
+-0.0703836 0.151592 -0.0450749
+0.0441667 0.0973563 0.00616912
+0.0240844 0.0547426 -0.0237664
+-0.015779 0.0770791 -0.0385675
+-0.0731035 0.0667848 0.0215468
+0.0455074 0.0569933 0.0321208
+-0.0438752 0.128361 0.000408951
+-0.0622566 0.0709345 0.0378148
+-0.0713089 0.156055 0.0109968
+0.0323876 0.047596 -0.00623106
+-0.0610541 0.068813 0.0363796
+-0.0175437 0.119111 -0.0121224
+-0.0136792 0.0541002 -0.0332811
+-0.0477406 0.135604 0.0113959
+-0.0709176 0.112214 -0.00951227
+0.0301974 0.0887542 -0.0200097
+-0.0734581 0.168 -0.0440151
+-0.0685258 0.165031 -0.0185494
+-0.0264962 0.0690788 0.0415599
+-0.0249134 0.0383716 -0.00452352
+-0.086697 0.114875 0.0460769
+-0.0752073 0.156095 0.0183637
+-0.0189411 0.0376177 0.0530488
+-0.0634886 0.064446 0.0291098
+-0.0261594 0.066324 0.0406106
+-0.0142604 0.0974009 0.0506069
+-0.0316679 0.0763713 -0.0315414
+-0.040787 0.0855384 -0.021437
+0.0590343 0.06983 0.00945078
+-0.07763 0.165322 -0.0259443
+-0.0631195 0.176032 -0.0554618
+-0.0918958 0.129686 0.0292517
+-0.029505 0.0545565 0.0362962
+-0.0356809 0.123888 -0.0070042
+0.0421291 0.070468 -0.00580336
+0.0297749 0.0920783 -0.0194766
+-0.0415439 0.148326 -0.00168489
+-0.090059 0.136447 0.0142016
+-0.0555057 0.0946 0.044463
+-0.0945025 0.125547 0.0202583
+-0.0304869 0.0532061 0.0367531
+0.00830607 0.0917456 -0.031199
+0.0182274 0.125477 -0.00123802
+0.0138055 0.0712841 0.0533593
+0.0294478 0.0506302 0.0370841
+-0.0802909 0.104732 0.0311813
+0.0308738 0.115323 0.0282321
+-0.0889738 0.137888 0.0281941
+-0.0750897 0.149941 -0.0248696
+0.0395014 0.0469731 0.0315971
+-0.0599935 0.0586398 0.0172334
+-0.0790056 0.166641 -0.0359617
+-0.00233373 0.114874 -0.0177321
+-0.0241436 0.180147 -0.0104229
+-0.0746876 0.0700138 0.0272066
+-0.00503592 0.13043 0.00494647
+-0.069435 0.179317 -0.0579979
+-0.0896062 0.137812 0.0131974
+-0.0625358 0.155244 -0.0346054
+-0.071543 0.155755 0.00800576
+-0.0746181 0.165272 -0.019163
+-0.0386347 0.0548667 -0.0110053
+0.00350742 0.103001 0.0436938
+-0.0629079 0.15056 -0.0255866
+0.0200283 0.0371524 -0.00668325
+-0.0375331 0.127856 0.0134298
+-0.075576 0.155851 0.0124034
+-0.0145239 0.118305 0.0371093
+-0.0528711 0.15259 0.0147483
+-0.0639569 0.158297 -0.0475943
+-0.0437953 0.0869983 -0.0218056
+0.0183 0.0651194 -0.0285252
+0.0410434 0.0689808 -0.00777311
+-0.0391241 0.157933 0.00465789
+-0.0617079 0.155317 -0.0205813
+0.049194 0.055373 0.030576
+-0.0577821 0.0826022 -0.0210434
+0.00750154 0.123796 0.0339733
+-0.0844011 0.0777797 0.0105147
+-0.0508742 0.137048 0.0234112
+-0.0487311 0.13178 0.0269763
+-0.0224768 0.123487 0.0248086
+0.0572102 0.0550739 0.00417234
+0.0523558 0.0647992 0.0281407
+-0.0804668 0.131637 0.0521945
+0.0276827 0.0480336 -0.0156964
+-0.0121824 0.178673 -0.0292354
+-0.0228778 0.10587 -0.0225138
+-0.0644637 0.0743344 0.0396953
+-0.0655821 0.153706 -0.0431373
+-0.0176845 0.0525387 -0.0318817
+0.0256228 0.0363687 8.49366e-07
+-0.0208533 0.0866413 0.055877
+-0.0490886 0.157599 -0.00632625
+0.00958152 0.0417197 0.0451866
+-0.0135001 0.0800899 0.0570677
+-0.0885594 0.112819 0.0222051
+0.0440561 0.0945388 0.0201582
+0.00630898 0.0624816 -0.0315869
+-0.0560997 0.155362 -0.00113519
+-0.0238123 0.0867774 -0.0372362
+-0.0711896 0.155374 -0.0449035
+0.018728 0.0549999 0.0480114
+-0.0696134 0.172257 -0.054028
+-0.00359831 0.101107 0.0440537
+-0.033095 0.0723179 -0.02347
+0.0338305 0.107861 -0.00824999
+-0.0354812 0.0383051 -0.00290933
+-0.0238593 0.0838986 0.0547079
+0.0239371 0.103424 0.0418106
+-0.076687 0.14724 -0.00686649
+-0.0113442 0.129847 0.0112634
+-0.0595215 0.131137 0.0385262
+-0.00250336 0.0633801 0.0564795
+-0.0765967 0.152807 -0.00988734
+0.00617007 0.126444 0.0306412
+0.0264293 0.0400385 -0.00421056
+-0.0261224 0.165258 -0.0166522
+-0.00669164 0.129496 0.00145082
+-0.0531001 0.154605 -0.00338641
+0.0347186 0.113797 0.00249877
+-0.0746345 0.0660496 0.0075612
+-0.0897609 0.0915993 0.0164407
+-0.0848984 0.0965537 0.0289739
+-0.0217829 0.111029 -0.0195757
+-0.0890662 0.123985 0.0032876
+0.0609254 0.0637423 0.0131584
+-0.0495476 0.147557 -0.00269468
+-0.00609162 0.0391352 -0.0126175
+-0.047607 0.144918 0.0010701
+-0.0484709 0.165547 -0.00491912
+0.0489576 0.0466396 0.0248167
+-0.0391315 0.160685 -0.012118
+-0.0530423 0.14778 0.0224018
+-0.0471085 0.0683456 0.0397676
+-0.0785029 0.128864 0.0532728
+0.0368255 0.109713 0.0241821
+0.0163171 0.0686116 0.0516854
+-0.0729482 0.0914984 0.0411605
+-0.0805357 0.113778 0.0465863
+0.0302378 0.0727042 0.0419554
+-0.0625354 0.122703 0.0447625
+-0.0615083 0.170965 -0.0565878
+-0.0124852 0.0659775 0.0542376
+0.0219313 0.0605513 0.0474343
+-0.048186 0.135579 0.00839494
+-0.014696 0.0585192 -0.0354314
+-0.0818834 0.109932 0.0368633
+-0.0564976 0.101562 0.0427397
+-0.0692156 0.0343564 -0.00463486
+-0.0924819 0.125444 0.00927262
+-0.0116015 0.0406252 -0.0263738
+0.000388646 0.0448955 -0.0263577
+-0.0474886 0.05462 0.0367747
+-0.0150651 0.12575 -0.00315467
+-0.0225002 0.104414 0.0430095
+-0.016108 0.038364 0.00641286
+-0.0474972 0.105664 0.0404447
+0.053572 0.0650953 0.0274823
+-0.068963 0.0874301 0.0429809
+-0.0206158 0.0422474 -0.0286271
+-0.0745126 0.131657 0.0521168
+0.0246516 0.122175 0.000230276
+-0.00982514 0.16696 -0.0220459
+-0.00885716 0.0385311 0.024037
+-0.0568241 0.063612 0.0312362
+-0.0787856 0.109366 0.039802
+0.0392221 0.075321 0.0338531
+-0.0725057 0.102685 0.0380563
+0.0318729 0.0380045 0.0237472
+-0.0704322 0.13832 0.0474328
+-0.0325018 0.177105 -0.00443384
+-0.0226059 0.0381278 0.0251854
+-0.00949201 0.129843 0.00617837
+-0.00878563 0.110674 -0.0212403
+0.0347324 0.0882263 -0.0174421
+-0.046782 0.0841151 -0.0215173
+-0.0692662 0.0692944 0.0324707
+0.00925419 0.0696192 -0.0318888
+-0.0303184 0.0423041 0.0510935
+-0.0780856 0.0784826 -0.00760345
+0.0256389 0.0929167 0.0460121
+0.00457646 0.108164 0.0418882
+-0.0519222 0.0461016 0.019678
+0.00234204 0.0367065 0.0225428
+0.0457266 0.0847913 0.00519644
+0.0292205 0.0857953 -0.020938
+-0.0196964 0.0384682 0.0290787
+0.0127826 0.0926962 0.0520031
+0.0390362 0.0980073 0.030266
+0.0186124 0.127837 0.0122439
+-0.0535608 0.0430661 -0.00900679
+-0.0509276 0.0346131 0.0417321
+0.0233086 0.0634336 -0.024957
+0.00850697 0.0546686 0.0524774
+-0.0275662 0.123979 -0.00112939
+-0.0688326 0.13265 0.047942
+0.0112159 0.0922395 -0.029689
+0.00233442 0.0539469 -0.0306143
+-0.0446508 0.040942 -0.0182992
+-0.00948977 0.114167 0.0408028
+0.0254079 0.10205 -0.0180571
+-0.0850056 0.146006 0.00617966
+-0.00850241 0.0870443 0.0572609
+0.0097783 0.1251 0.0319006
+-0.0222638 0.126605 0.016039
+-0.0722117 0.0348867 0.00176609
+-0.0327045 0.111423 -0.0179721
+-0.057835 0.0897878 -0.0213715
+-0.076573 0.153595 0.0311713
+0.0595629 0.058084 0.0191786
+-0.0323163 0.155148 0.000487548
+0.0120506 0.0505153 0.0488388
+-0.0524497 0.140085 0.0234103
+-0.0325359 0.172727 -0.00270207
+-0.0711683 0.149278 -0.039104
+-0.0641214 0.155412 0.0266328
+0.0288394 0.112544 -0.00929606
+-0.0217358 0.0384567 0.028668
+-0.0719124 0.168014 -0.0470137
+-0.0448486 0.0351369 -0.0234128
+0.0159855 0.12897 0.0112743
+0.0311432 0.0373381 0.0223917
+-0.000793766 0.0867716 -0.0355698
+-0.0900654 0.132428 0.033223
+-0.0935895 0.122834 0.0262964
+-0.0520638 0.0723523 0.0405753
+-0.0111299 0.129809 0.0171219
+-0.0491641 0.0344528 0.0317811
+-0.0849325 0.0938555 0.0290926
+-0.0809703 0.132422 -0.00393108
+-0.0887798 0.140493 0.0370948
+-0.0577868 0.0840301 -0.0211707
+-0.0814849 0.0872077 0.0329213
+0.0191348 0.102061 0.0453843
+0.0573171 0.0523102 0.00718519
+0.039991 0.0847392 0.0332858
+-0.0668403 0.0335301 0.004077
+-0.0117893 0.0392416 0.0372019
+0.0216437 0.120011 -0.00733339
+-0.0125093 0.0883992 0.0567932
+-0.0378236 0.125803 -0.00505851
+-0.0750347 0.154671 0.0286993
+-0.0887093 0.112351 0.0387402
+-0.0638899 0.102518 -0.0176142
+-0.0600535 0.138395 -0.00620678
+-0.0103882 0.129888 0.00873113
+-0.0610188 0.119808 0.0416066
+0.0158574 0.104091 -0.0202309
+-0.0839121 0.122095 -0.00374203
+-0.0841686 0.143365 0.0409129
+-0.00166671 0.12799 -0.00382866
+-0.0434723 0.0647942 0.0406198
+0.0406639 0.0815903 -0.00978474
+-0.0652464 0.154114 0.00157024
+-0.0257535 0.0740897 -0.0368116
+-0.0739579 0.13841 -0.00677972
+-0.0288788 0.0592582 -0.0244095
+0.0093177 0.0926652 -0.0301396
+-0.0452267 0.150119 -0.00491516
+-0.0319894 0.0384633 -0.00603174
+-0.0794952 0.0854073 -0.00956797
+-0.0675492 0.129835 0.0480321
+-0.0523266 0.033478 -0.00194369
+-0.00450192 0.0718383 0.058171
+-0.0535372 0.0578641 0.0215172
+-0.0140108 0.0596764 0.0527295
+-0.000532268 0.111266 -0.0199168
+0.0523683 0.0540101 0.0281247
+0.0211966 0.123092 -0.002693
+-0.00468835 0.0598784 -0.0344633
+-0.0718785 0.102239 -0.0132694
+-0.0678239 0.15109 -0.0436673
+0.0350895 0.0686836 0.0383949
+0.0422361 0.101506 0.0151693
+0.0317521 0.0794454 -0.0197442
+-0.0577724 0.0796775 -0.0200459
+-0.0461631 0.0335506 -0.0117706
+-0.0827169 0.105982 0.0279083
+-0.0922534 0.122854 0.0424865
+0.0128317 0.0712714 0.0536973
+-0.0126798 0.126321 -0.00380105
+-0.00116162 0.0980337 0.0521962
+-0.0814909 0.0788596 0.028943
+-0.0501013 0.15611 -0.00554414
+0.00939521 0.0609325 -0.0302492
+-0.030101 0.160758 -0.0141091
+-0.031497 0.117989 0.0308563
+0.0231755 0.0916964 -0.0230758
+0.0434109 0.0987186 0.0151565
+-0.0514982 0.108428 0.0386132
+-0.0644896 0.0833289 0.0440861
+-0.0238622 0.101613 -0.0238665
+0.04258 0.0422624 0.0239479
+0.0354547 0.103863 -0.00997386
+0.0217345 0.0994968 0.0456553
+-0.0743457 0.168929 -0.0264214
+0.01504 0.0343531 -0.00213727
+0.00148487 0.0399885 0.0464307
+0.0273636 0.0699427 0.0430425
+-0.0548013 0.086928 -0.0216118
+-0.0729344 0.0901459 0.0411907
+0.0305961 0.110839 -0.00946183
+-0.0721093 0.0846859 0.0405598
+-0.067036 0.180898 -0.0568882
+0.0496382 0.068363 0.00147832
+-0.0149904 0.165173 -0.0188028
+-0.0928971 0.117368 0.0123132
+-0.000378579 0.101174 0.0451223
+-0.00167056 0.0392225 0.0339103
+0.0308479 0.0567691 -0.0158074
+0.00821609 0.0823703 -0.0328688
+0.0179771 0.0393777 0.0432522
+-0.0917891 0.141969 0.0171701
+0.0284614 0.0398271 -0.00325429
+-0.0273719 0.0335777 -0.022929
+-0.0799767 0.138308 -0.00390962
+0.0224205 0.0519815 -0.0241272
+-0.0206006 0.0393656 -0.0285093
+-0.075081 0.147222 -0.0118498
+-0.0748806 0.0992858 -0.0126164
+0.0126717 0.127043 -0.00291981
+-0.0321779 0.0474216 0.0442941
+0.0248435 0.0822524 0.0483141
+-0.087169 0.0964235 0.0255876
+-0.00114332 0.0356309 -0.0159104
+-0.0674627 0.138295 0.0446438
+-0.0656974 0.169193 -0.0361564
+-0.065794 0.155512 0.00862557
+0.0346025 0.0754478 0.0394941
+-0.0145323 0.043279 0.0510718
+-0.0739879 0.139879 -0.00672352
+-0.0921938 0.132347 0.0162256
+-0.077508 0.174998 -0.0490226
+-0.0161182 0.180144 -0.0199393
+0.0442692 0.0973579 0.00816486
+-0.0885535 0.112746 0.0331115
+-0.0527601 0.0447727 0.0186838
+-0.0301237 0.12585 0.013192
+-0.0359512 0.151053 -0.00163407
+-0.0579079 0.121934 -0.00872095
+-0.0709562 0.158172 -0.0439179
+-0.00996463 0.114432 -0.0172214
+-0.0308542 0.0986541 -0.0229751
+-0.0199407 0.0381449 0.0130842
+-0.0439068 0.129921 0.011069
+0.0290675 0.120111 0.00471365
+-0.0203588 0.175699 -0.0155519
+0.0542673 0.0491964 0.0212031
+-0.0348545 0.0986254 -0.0227182
+0.0413986 0.0830578 -0.00877387
+-0.0554939 0.0477978 0.0398952
+-0.0760774 0.166574 -0.0390172
+0.0438486 0.0846749 0.0261721
+0.0021495 0.0388151 -0.00319944
+0.04114 0.104231 0.00317036
+0.0165359 0.0912212 -0.0265781
+-0.0518469 0.0545626 0.0286406
+-0.0568589 0.0562507 0.00563881
+-0.0383911 0.127983 0.00280515
+-0.0857603 0.130763 -0.000714461
+-0.0173678 0.0389666 0.0345056
+-0.0266954 0.125077 0.00273937
+0.0143393 0.0349605 0.0410018
+0.0132369 0.0709965 -0.0314873
+-0.0317622 0.0338243 0.0127586
+-0.0767072 0.0724697 0.0281768
+-0.0694593 0.040787 -0.000292884
+0.013984 0.129601 0.0176686
+-0.00527436 0.124342 -0.0098488
+-0.0749724 0.149924 -0.0268701
+-0.0188238 0.0855077 -0.0385626
+-0.0577531 0.141417 -0.00374252
+-0.0506075 0.0335251 -0.00346549
+-0.0105008 0.103039 0.0436514
+-0.062498 0.0847471 0.0443617
+-0.0166725 0.0495705 -0.0306349
+-0.0368813 0.108512 -0.0198737
+0.0510305 0.0733741 0.0168194
+-0.0275083 0.112548 0.0360564
+-0.0636421 0.0627085 -0.00368166
+0.0411669 0.104244 0.0141607
+-0.00149973 0.0965741 0.0536819
+-0.0288186 0.0862428 0.0454609
+-0.0526183 0.0343668 0.0293685
+-0.0601235 0.15512 0.0251504
+-0.0378644 0.111663 -0.0181901
+0.0344602 0.0726275 -0.0157808
+-0.0144826 0.0530653 0.0501401
+-0.0700881 0.131265 0.0496481
+-0.0878883 0.0914318 0.00546674
+-0.0415923 0.0491549 -0.0111971
+0.0234288 0.0618809 0.0460892
+-0.0630663 0.151874 -0.00782908
+-0.0866506 0.128453 0.0480393
+-0.0781275 0.152854 0.000107941
+-0.0106285 0.174518 -0.0286758
+-0.0596993 0.0345337 0.0416145
+-0.0579832 0.0466328 -0.00336399
+-0.0265008 0.124041 -0.00116405
+-0.0254725 0.0400777 0.0541415
+-0.0178664 0.12824 0.013233
+-0.0206926 0.0385034 0.0288434
+-0.0534934 0.0747559 0.0420439
+-0.0652623 0.158339 -0.0115587
+-0.0767656 0.152802 -0.00889022
+0.0245199 0.0520168 0.0405174
+0.0264125 0.0450979 -0.0096842
+-0.012488 0.107228 0.0430572
+-0.078668 0.170753 -0.0430283
+-0.0625286 0.164689 -0.038593
+-0.0241791 0.159685 -0.00173809
+0.00849261 0.092349 0.0531984
+-0.0759472 0.132533 -0.00707033
+-0.0806057 0.0720192 0.00754007
+0.00646347 0.117501 -0.0166002
+-0.0178266 0.0947205 0.0526193
+0.000481761 0.10723 0.0430499
+-0.013526 0.162053 -0.0127433
+-0.0186103 0.042208 -0.0281438
+-0.0252891 0.0336623 -0.0225985
+0.00751041 0.0688465 0.0554032
+0.0252903 0.0675893 -0.0238235
+-0.065902 0.112354 -0.012152
+-0.0476622 0.0620749 -0.0123691
+-0.0940806 0.122789 0.0152778
+-0.0229201 0.115998 -0.0147881
+-0.0344826 0.0519106 0.0380623
+-0.0890068 0.11621 0.0451247
+0.0107555 0.0404168 0.045078
+-0.0894686 0.136415 0.011209
+-0.0757697 0.145819 -0.00688494
+-0.071833 0.152571 -0.043913
+0.0235861 0.0352777 0.0154316
+-0.0926495 0.129588 0.0122381
+-0.0647445 0.0780775 -0.0178137
+-0.00582898 0.0896214 -0.0360418
+0.0559073 0.0721087 0.0082759
+-0.0261702 0.0823861 0.0514348
+-0.0558857 0.0970202 -0.0212239
+-0.0630553 0.148575 -0.0182369
+0.00714931 0.123902 0.0338795
+0.0304322 0.0902625 -0.0195701
+-0.0137593 0.0388335 -0.0101314
+0.0427673 0.0818692 0.0284169
+-0.0651233 0.155698 0.0103085
+-0.0897032 0.113874 0.0229056
+-0.0447211 0.129823 0.00637961
+-0.0575 0.0588269 0.0212602
+0.0104936 0.11823 0.0368787
+0.0202805 0.12337 -0.00295598
+-0.0340138 0.155107 0.00155033
+0.0602047 0.0622908 0.0181797
+-0.0859874 0.153017 0.0132012
+0.0433237 0.0846089 -0.00479162
+-0.0678527 0.0937535 -0.0166708
+0.0608755 0.0651235 0.0141559
+-0.0737739 0.0878479 -0.0153893
+0.0296171 0.11988 0.0191943
+-0.00324005 0.038276 0.0477168
+-0.0806315 0.139432 0.0474021
+0.0455013 0.0583861 0.0319381
+-0.0740734 0.172255 -0.0349568
+0.0224678 0.0975265 0.046211
+-0.0525514 0.0389481 -0.0113995
+0.0281531 0.119463 0.0257844
+-0.0765864 0.155527 -0.0189073
+-0.0289503 0.0931616 -0.025199
+-0.0573663 0.0338673 0.0217593
+0.0396386 0.064502 0.0326274
+0.00539495 0.0433546 -0.0245866
+0.0256558 0.0782254 0.0477034
+0.0162437 0.0764684 -0.0291666
+0.0272037 0.100805 0.0412523
+-0.0316694 0.0357391 0.0272619
+-0.0623836 0.163119 -0.0315939
+0.0275463 0.095549 0.0435012
+0.0393856 0.0475887 -0.00567863
+-0.0394934 0.163848 0.00245451
+0.0242993 0.0928305 -0.0222726
+-0.0271788 0.0358787 -0.0194139
+-0.0734977 0.124615 0.0532793
+-0.0883817 0.123968 0.00128346
+-0.0257849 0.174205 -0.0110873
+-0.0281104 0.163768 -0.0157424
+-0.0662143 0.0386042 0.0318887
+-0.0109132 0.103533 -0.0236899
+-0.0616548 0.140062 -0.00630976
+-0.060057 0.135486 -0.00665791
+0.0434691 0.0624283 0.0290897
+-0.0236196 0.0436733 -0.0286374
+0.043495 0.0610671 0.0301862
+-0.0910584 0.133686 0.0122173
+0.0291029 0.0938741 -0.0193597
+-0.0261534 0.0383869 0.0314189
+0.00850666 0.0896726 0.0548038
+-0.0247527 0.0340557 -0.0209813
+-0.0186132 0.0436215 -0.0279143
+-0.0124858 0.0911558 0.0565265
+0.0053433 0.0524636 -0.0297405
+0.0403239 0.0999619 0.0261672
+-0.0522155 0.149331 0.0183918
+-0.0534968 0.0973516 0.0432358
+-0.0284959 0.10431 0.0415782
+-0.0908913 0.139194 0.0171389
+0.0264487 0.0948748 -0.0204583
+-0.0834511 0.149763 0.0335021
+-0.00425208 0.0941246 -0.0337645
+-0.0337113 0.0652961 -0.0165207
+-0.0405229 0.128682 0.00643622
+0.025364 0.0547555 -0.0216571
+0.0209176 0.124997 0.0245115
+0.0147936 0.104084 -0.0202238
+-0.0510936 0.156101 -0.00485677
+-0.00104637 0.116277 -0.0172455
+-0.0564804 0.0613799 -0.00459099
+-0.0261657 0.11885 -0.0117616
+-0.0612216 0.155927 0.0131437
+-0.0264503 0.181668 -0.00853376
+0.0163083 0.0594423 -0.028212
+-0.0188061 0.081321 -0.0390856
+-0.0660982 0.156586 -0.0534726
+-0.0596936 0.155857 0.0122367
+-0.0656404 0.0608118 0.00501538
+0.00550383 0.0716948 0.0562222
+-0.0473457 0.134062 0.00939848
+0.0233312 0.0436331 0.0404882
+0.0342215 0.0827959 -0.0185003
+0.00407718 0.131556 0.00833758
+-0.0524976 0.0931679 0.0439324
+-0.0206125 0.0553712 0.0467047
+-0.0499367 0.0345722 0.0419808
+-0.0720303 0.169416 -0.0480254
+0.0463102 0.0820482 0.0101764
+0.0239273 0.0383233 0.0327312
+-0.0556472 0.0657358 0.0349277
+0.0082124 0.0879974 -0.0324239
+-0.0483251 0.123967 0.0299918
+-0.00979541 0.0826872 -0.0380854
+-0.0104818 0.0688481 0.0551963
+-0.0738713 0.116445 -0.00712552
+-0.0783268 0.0804305 0.0341941
+-0.0318616 0.0386777 -0.0303614
+-0.0685663 0.0335043 0.000153325
+0.0419445 0.0972272 0.0251571
+-0.0324967 0.0831278 0.0417023
+-0.0385753 0.165326 0.00202421
+-0.0574991 0.105703 0.0407441
+-0.0735089 0.120392 0.0535609
+-0.0194999 0.105809 0.042534
+-0.0918084 0.11461 0.0202058
+0.0373089 0.0604869 0.0345236
+-0.0397982 0.0885212 -0.0227204
+-0.0838603 0.0771078 0.0156983
+-0.0683511 0.16683 -0.0228013
+0.00825384 0.0357096 0.0264477
+-0.0487592 0.0797294 -0.0200154
+-0.067984 0.13847 -0.00792156
+-0.0205709 0.127392 0.00935219
+0.0158596 0.0940217 0.0494261
+-0.00476401 0.100643 0.0463697
+-0.0144795 0.0617481 0.0535104
+-0.0635003 0.0931972 0.0443921
+-0.06148 0.0371866 -0.00855801
+-0.0235696 0.0368882 0.0541538
+-0.00084278 0.129714 0.0251926
+-0.0857238 0.0792489 0.0165033
+-0.00382707 0.0868147 -0.0366286
+-0.0623716 0.0433162 0.04063
+-0.0481783 0.127343 -0.00452632
+0.0258208 0.0577421 -0.0227411
+-0.0464997 0.109825 0.0383354
+-0.0632202 0.150553 -0.0275915
+0.0594014 0.060828 0.00515272
+-0.0379322 0.0359407 -0.029738
+-0.0628566 0.163115 -0.0590591
+0.032875 0.0504741 0.0332188
+-0.0798256 0.114817 -0.00349908
+0.00979876 0.0631089 0.0545118
+-0.00479883 0.0826783 -0.0376925
+-0.0586564 0.152453 0.0326111
+-0.0847868 0.0979024 0.0288114
+-0.0248237 0.0853842 -0.0372699
+-0.00156343 0.13088 0.0191419
+-0.0624949 0.0729745 0.0395167
+-0.0208752 0.105853 -0.0224653
+0.0381305 0.0743398 -0.0117665
+0.00679871 0.128004 -0.00391746
+-0.0769289 0.125211 -0.00745968
+-0.0251918 0.111615 -0.0181703
+-0.0538836 0.0984784 -0.021806
+-0.0535445 0.0444164 -0.0080927
+0.0449223 0.0903552 0.00117592
+0.00748556 0.116867 0.0384917
+0.0479919 0.0426572 0.0134999
+0.0269115 0.116892 -0.00595645
+0.0287509 0.0911639 -0.0204971
+-0.00583539 0.0910195 -0.0356702
+0.0122548 0.126063 0.0299441
+-0.0732964 0.0791377 0.0376894
+-0.0578898 0.108324 -0.0176181
+-0.0316803 0.111369 -0.0179291
+-0.00248889 0.101618 0.0440339
+0.0583601 0.0593964 0.0227402
+-0.0568793 0.105485 -0.0183902
+0.0313941 0.108732 0.0332945
+-0.0104953 0.0801622 0.0580036
+-0.0799858 0.150056 0.000166757
+-0.0448968 0.146123 0.00263093
+-0.0595037 0.0344238 0.0383245
+-0.0836036 0.133464 -0.00169527
+-0.0115063 0.0575113 0.0530742
+-0.0112578 0.037897 0.0501369
+-0.0404967 0.071918 0.0419528
+-0.024201 0.0373653 0.0542269
+-0.063129 0.0366622 0.0429743
+0.0461067 0.069238 0.0238359
+-0.0217169 0.0945664 0.0494448
+0.0519577 0.0621966 0.0293389
+0.0286828 0.072686 0.0432253
+0.0389262 0.103315 -0.00332456
+-0.0908979 0.126784 0.00627265
+-0.0604951 0.097348 0.0432235
+0.00320361 0.0838721 -0.0343861
+-0.0615214 0.155998 0.0173864
+0.0174482 0.090927 -0.0262636
+-0.0428815 0.108469 -0.0193857
+0.0528827 0.0476533 0.00520477
+-0.0692155 0.155426 0.0044718
+-0.0116319 0.126956 0.0271535
+0.0555832 0.0661715 0.0258304
+-0.0669079 0.139705 0.0437201
+0.0208911 0.120687 0.0321527
+-0.0692559 0.157013 -0.00287665
+-0.0642658 0.131126 0.0422113
+-0.00350345 0.108655 0.04343
+0.00595359 0.131311 0.0061803
+-0.0652676 0.179645 -0.0602668
+0.0113097 0.0609536 -0.0296395
+0.0202287 0.0385462 -0.010699
+-0.0528896 0.0556157 0.0124842
+-0.0830831 0.152763 0.0275295
+-0.0929926 0.121477 0.0272936
+-0.0679169 0.115123 -0.00939662
+-0.0715189 0.150138 -0.0417489
+0.0502478 0.0496891 0.0267596
+-0.088826 0.122625 0.00229599
+0.045739 0.0876044 0.00618298
+0.0276204 0.0364605 0.0224657
+0.0550864 0.0576626 -0.000774412
+-0.0601415 0.0397484 0.0187938
+-0.0467117 0.131872 0.0218067
+-0.00211002 0.131247 0.0146415
+0.0400335 0.107013 0.011165
+-0.0875275 0.141918 0.0101858
+-0.0321386 0.0511687 -0.0124242
+-0.05996 0.047085 0.0381143
+-0.0771576 0.158311 -0.0229061
+-0.0910473 0.139231 0.0181913
+0.0586943 0.0552354 0.0191792
+0.0541025 0.0616928 -0.00172111
+0.0193458 0.0347743 -0.00166328
+-0.0785503 0.175004 -0.046006
+0.0361753 0.0767902 0.0382584
+-0.00218115 0.0950603 -0.0327048
+-0.00446475 0.03907 -0.00848801
+-0.0509412 0.0543847 0.0317288
+-0.031974 0.126184 0.0154629
+-0.0517139 0.047497 0.0206563
+0.0390432 0.106963 0.0211652
+-0.0661031 0.169296 -0.0348743
+-0.0461189 0.0353483 0.0438447
+-0.0618314 0.155872 0.0114752
+-0.0414861 0.169687 0.00162271
+-0.0640913 0.154089 -0.00821335
+-0.0474977 0.0776489 0.0433419
+-0.000495324 0.0870356 0.0569136
+0.0572432 0.0508915 0.0131865
+0.0162675 0.0348087 0.0361219
+-0.0561497 0.0697401 0.0384165
+-0.0632023 0.166731 -0.0605917
+-0.0297129 0.0382953 0.00190139
+-0.00511763 0.0345398 -0.0175639
+-0.0614326 0.0342559 0.0293559
+-0.0526737 0.0678526 -0.0129346
+0.0213104 0.092205 -0.0236008
+0.0197097 0.119321 0.0339587
+-0.0214979 0.120818 0.0311972
+0.0121652 0.0940439 -0.0275601
+0.0264769 0.122884 0.00946172
+-0.0236707 0.0536853 -0.0289139
+-0.0413464 0.0470648 -0.0139804
+0.0254796 0.122858 0.0219249
+-0.0924012 0.125564 0.030262
+-0.0879683 0.133795 0.0435491
+-0.0521211 0.0500618 0.0133132
+-0.0655655 0.115703 0.0473772
+-0.0739163 0.0808829 -0.0136046
+-0.0678507 0.166619 -0.0550103
+-0.0116556 0.127143 -0.00273206
+-0.0318682 0.101497 -0.022474
+-0.0710899 0.143489 -0.012899
+-0.0174739 0.0587291 0.0509898
+-0.0238083 0.125586 0.00234805
+-0.0296624 0.0691842 -0.029462
+0.00123889 0.0998292 0.0485145
+-0.0648099 0.0910089 -0.0186372
+-0.0624633 0.170945 -0.051605
+-0.0911968 0.145718 0.0253129
+-0.0208075 0.0827095 -0.0389174
+-0.0156288 0.184043 -0.0262877
+0.0422094 0.0873179 -0.00779978
+0.00273738 0.0943137 -0.0318997
+-0.082233 0.0925905 0.0320729
+-0.0782161 0.110396 0.044452
+-0.0842181 0.153993 0.0196689
+-0.00949468 0.0532459 0.0520833
+-0.0867806 0.115997 0.0469199
+-0.0547757 0.0826557 -0.0215494
+-0.0382309 0.0365042 0.0436563
+0.021227 0.0727783 0.05004
+-0.00441949 0.0338393 -0.022426
+-0.0712771 0.0648585 0.00216525
+-0.0364976 0.111093 0.0360234
+-0.0669244 0.123843 -0.00898539
+-0.0178669 0.0554748 0.0496143
+0.020489 0.0906324 0.0482147
+-0.00549595 0.0605287 0.0555985
+-0.0289733 0.0536405 -0.0223788
+0.0191474 0.0435971 0.0432171
+0.00434602 0.0346139 0.0410512
+-0.0400219 0.111533 -0.0180322
+0.012127 0.0534588 0.0507501
+0.0284176 0.0415874 -0.00471776
+-0.0270737 0.125279 0.00405866
+-0.0221888 0.0348068 0.0442295
+-0.0447592 0.0797381 -0.0197229
+-0.0304968 0.172715 -0.00561384
+-0.0762362 0.0865455 -0.0135615
+0.0197685 0.0371215 -0.00768223
+0.0379293 0.0417908 0.0270611
+-0.0809612 0.0747382 0.0015261
+0.00168043 0.0346784 0.042239
+0.0257721 0.0915784 0.0461947
+-0.0898405 0.133789 0.0312158
+-0.0355388 0.0441134 -0.0275262
+0.00710192 0.0379595 0.027814
+-0.0620019 0.0401372 0.0237075
+0.0429025 0.100097 0.0151567
+-0.00267325 0.0569172 -0.0326724
+-0.0285904 0.110146 -0.0186081
+-0.0762074 0.0906406 -0.013533
+0.0535161 0.0677623 0.0259787
+-0.00262958 0.0466399 -0.0290845
+-0.0839307 0.125043 -0.00388859
+-0.0340047 0.0386047 -0.0302796
+0.0184751 0.082463 0.0515958
+-0.0574796 0.115365 0.0367006
+-0.0420623 0.154724 -0.00848194
+-0.0860758 0.0924352 0.0274562
+-0.0930739 0.122895 0.0382751
+0.051883 0.0734548 0.0112114
+-0.0811474 0.0769537 0.0251701
+-0.0618709 0.0338217 0.0137712
+0.0195119 0.0370935 -0.00868114
+0.00449835 0.0590783 0.0547231
+-0.0645467 0.148975 -0.0280488
+0.0404587 0.0426892 0.0267677
+-0.0712073 0.146616 -0.0240304
+-0.0512571 0.0488673 0.0206327
+-0.00789661 0.098211 -0.0280331
+-0.0821992 0.0980013 0.0318751
+0.0249936 0.037232 0.0266864
+-0.00349731 0.0456721 0.0469862
+0.0464132 0.0472054 -0.00271728
+-0.0659208 0.0390922 0.037189
+-0.0655814 0.167928 -0.031824
+-0.0726143 0.1704 -0.0286759
+-0.032982 0.0423452 0.0495212
+-0.0442602 0.153622 0.00782588
+0.0320708 0.117667 0.00585111
+0.0181014 0.0354956 -0.0136744
+-0.0756189 0.168382 -0.0269354
+-0.0302725 0.114038 -0.0167089
+-0.06455 0.166996 -0.0328772
+-0.0136948 0.125921 0.0278767
+-0.0594946 0.0973472 0.0432255
+-0.0660053 0.138467 -0.00776776
+-0.0538886 0.161243 -0.000916627
+-0.0521229 0.0491646 0.0356345
+-0.0669695 0.167967 -0.0280306
+-0.0692702 0.0635509 0.00193084
+-0.057893 0.109749 -0.0172343
+0.0162169 0.116863 -0.0139359
+-0.0837452 0.0818387 0.0274964
+-0.0188705 0.104448 -0.0228566
+0.017085 0.0604224 0.0492086
+-0.0636469 0.11387 0.0394431
+0.0060852 0.126695 -0.00651247
+-0.0563559 0.0448266 0.0148606
+-0.0534962 0.0959644 0.0436141
+0.0587007 0.0538335 0.0141792
+0.00148321 0.105804 0.0429258
+-0.0696571 0.0662079 0.0262916
+0.0292497 0.0745452 -0.0220465
+-0.0363535 0.0380033 0.0459253
+-0.0388642 0.104209 -0.02036
+0.0363189 0.106784 -0.00482843
+-0.0506381 0.0473796 0.0176699
+0.0415736 0.0738523 0.0301911
+0.00841968 0.0357631 -0.0122614
+-0.0449132 0.130768 0.0151196
+-0.0348253 0.0822923 -0.0236386
+-0.0756565 0.0672218 0.011813
+-0.0840475 0.0856522 0.0284432
+0.0358352 0.11315 0.0115155
+0.0378536 0.10688 -0.000832307
+0.0327708 0.0862789 0.0422215
+-0.0510409 0.034583 0.0365198
+0.0285939 0.108783 0.0362583
+-0.0291219 0.163733 -0.0155493
+-0.0075062 0.071811 0.0576623
+-0.0285902 0.125327 0.00496117
+0.022493 0.120697 0.0309281
+-0.081164 0.0734408 0.004547
+-0.011709 0.0628424 -0.0363307
+-0.0258651 0.101595 -0.0237434
+0.0205831 0.11206 -0.0147671
+0.0444356 0.0931566 0.0191609
+-0.04739 0.113671 -0.0162364
+-0.0489307 0.0334882 -0.00491951
+-0.0129236 0.118879 -0.0139348
+-0.0161652 0.0382063 0.017415
+-0.00495697 0.0978375 0.052341
+-0.0277397 0.0605536 -0.0284245
+-0.00547292 0.0385489 0.021098
+-0.00115741 0.0949656 -0.0326157
+-0.0444374 0.124419 -0.00954541
+-0.0821611 0.0761834 0.00152312
+-0.0144467 0.0348076 0.0441223
+-0.0715687 0.153984 -0.0439053
+-0.00636015 0.130593 0.00877385
+-0.0127796 0.0382227 0.0144711
+0.0370519 0.110502 0.0205344
+-0.0322265 0.0637977 -0.0184499
+-0.0106706 0.054151 -0.0336931
+-0.0455975 0.169625 -0.00241942
+0.0182033 0.0435661 0.0436183
+-0.0718144 0.147892 -0.0304457
+-0.0577521 0.050802 0.00265023
+-0.0586963 0.0588331 0.00348495
+-0.0866227 0.109058 0.0173532
+-0.0383512 0.122877 -0.00994551
+-0.070675 0.0778663 -0.0147995
+-0.0181879 0.174194 -0.0234207
+-0.0587357 0.153161 0.0315118
+-0.0350971 0.16074 -0.013448
+0.00536912 0.049521 -0.0287338
+-0.0474407 0.134003 0.00841493
+-0.0624554 0.1522 -0.0115838
+-0.0760236 0.150016 -0.00789124
+-0.0261434 0.0379494 0.0119939
+-0.068707 0.0613453 0.00749837
+0.0495547 0.0702574 0.0035522
+0.0608929 0.0651253 0.0121512
+0.0417276 0.0683416 0.0285931
+-0.0322652 0.177059 -0.0129859
+-0.027328 0.0951114 -0.0248637
+-0.0207784 0.0714012 -0.0384405
+-0.0483231 0.128062 -0.00327126
+-0.0424968 0.0449805 -0.0163196
+-0.0550216 0.142767 -0.00162505
+-0.0444981 0.112567 0.0357183
+0.039909 0.107011 0.00616363
+0.0103602 0.0524141 -0.0291489
+-0.0621527 0.0372105 -0.00831557
+0.0052003 0.124064 -0.00964829
+0.0584567 0.0701808 0.018095
+0.0154065 0.0880419 -0.0292971
+-0.0675878 0.0672405 -0.0057657
+0.0141143 0.129082 0.00347211
+-0.0769907 0.154191 -0.00889586
+-0.0351753 0.160922 -0.000113952
+-0.0865124 0.0819745 0.0105022
+-0.0802058 0.0759672 -0.0035211
+0.0412042 0.046738 0.0312341
+0.0531089 0.0539671 0.0274209
+-0.0202736 0.0966137 -0.0264451
+-0.021864 0.108885 -0.0213157
+0.0172909 0.0900542 0.0497289
+0.0151151 0.0645034 0.0516546
+-0.00371721 0.100591 0.046739
+-0.0281684 0.117044 -0.0138686
+0.044615 0.0762444 0.0239446
+0.00250222 0.0504849 0.0522926
+-0.0407291 0.0724971 -0.0177035
+-0.076873 0.114866 -0.00505023
+-0.0509699 0.0334609 -0.0108109
+-0.0307494 0.125973 0.00854668
+-0.0842046 0.10344 -0.000635192
+-0.0637785 0.0335481 0.00468656
+0.0573103 0.0709688 0.0191461
+-0.0548852 0.0344475 0.0323271
+-0.0566985 0.0694351 -0.0145553
+0.0116873 0.128578 0.0254498
+-0.0635208 0.0384034 0.0165311
+-0.0193913 0.161115 -0.00536021
+-0.0517184 0.0708739 -0.0153462
+-0.0355107 0.0789772 0.0422885
+-0.0308674 0.0359912 0.0254031
+-0.0496962 0.137023 0.0203775
+-0.000496498 0.0549075 0.0548747
+0.0203519 0.0506032 0.0432764
+-0.00603714 0.0387093 0.0280658
+-0.0424971 0.165251 0.00449932
+-0.088747 0.148763 0.0102254
+0.0140119 0.072675 0.0536492
+-0.0355033 0.109745 0.0370663
+-0.0495176 0.0451863 0.0426306
+0.0161864 0.128058 0.00281004
+-0.0689044 0.110844 -0.0111483
+-0.0648164 0.0412793 0.0318749
+-0.0594946 0.0959853 0.0440949
+-0.0201946 0.0918367 -0.0355405
+-0.00451061 0.0534011 0.0538125
+-0.0256167 0.0422692 -0.0291044
+-0.0366019 0.0472824 -0.0203909
+-0.0714721 0.152551 -0.0449162
+-0.0686495 0.0395764 0.0103048
+-0.0916814 0.147477 0.020141
+0.0344933 0.0646793 0.0392567
+0.0354037 0.0848596 0.0389463
+0.0335837 0.114911 0.0235455
+-0.00948608 0.0488348 0.0496357
+0.0162564 0.0875946 -0.0288434
+-0.0495004 0.0876335 0.045502
+-0.00788756 0.107371 -0.0226705
+0.0279061 0.0479696 -0.0147397
+-0.0593675 0.145365 0.0352791
+-0.0297371 0.179987 -0.0120259
+-0.00152895 0.1273 -0.00507098
+-0.053021 0.0473885 0.0142865
+-0.031661 0.0351392 -0.0196159
+-0.0428508 0.127424 0.0174253
+0.00853656 0.103079 0.0455737
+-0.0428329 0.0928281 -0.0227901
+-0.0533229 0.121583 -0.0104498
+-0.0281276 0.163902 -0.00573037
+0.00550696 0.0647473 0.0560963
+-0.0786632 0.155487 0.0200952
+0.0373574 0.0841251 -0.0157743
+0.00845531 0.04577 0.0469205
+-0.0816426 0.140732 0.045535
+-0.0198636 0.184564 -0.0147357
+-0.0441 0.149758 -0.00480897
+-0.0394895 0.0478295 0.0398724
+-0.0902912 0.136455 0.0152001
+-0.0912584 0.116106 0.0417079
+-0.078373 0.161039 -0.0249642
+-0.0823003 0.143183 0.00115625
+-0.0366712 0.0621691 -0.0130418
+0.0483193 0.0518215 -0.00445791
+-0.0647832 0.179003 -0.0560548
+-0.066692 0.1555 0.0271809
+0.0251524 0.123931 0.0146708
+-0.0729716 0.175028 -0.0520538
+0.0249807 0.0645674 0.0448324
+0.0189844 0.127654 0.0109555
+-0.023546 0.114036 0.0366055
+-0.0166929 0.178668 -0.0190282
+-0.0838411 0.0884243 0.0295799
+0.0340178 0.106064 0.0317678
+0.0172301 0.0834905 -0.0285819
+-0.0836745 0.0939124 0.0306595
+0.00650612 0.0856084 0.0565927
+-0.00650337 0.0633626 0.0562557
+0.00724714 0.123914 -0.00950504
+-0.04049 0.0677003 0.0417506
+-0.083014 0.0816043 0.0289568
+-0.0791181 0.10724 -0.00560787
+-0.0643983 0.155173 -0.0416037
+-0.0194853 0.0382676 0.0257029
+0.017193 0.0407686 0.0438767
+-0.0578741 0.0997697 -0.0193936
+-0.00470039 0.0340249 -0.0188849
+0.009491 0.0923319 0.053062
+-0.0679779 0.0615132 0.00568001
+-0.00851004 0.0960786 -0.0317903
+0.0222567 0.0734747 -0.02675
+0.0396829 0.102719 -0.00275708
+0.0333394 0.0519958 0.0339463
+-0.0317958 0.166782 -0.0057687
+-0.0851069 0.104842 0.00238218
+0.040355 0.0712163 0.0319238
+-0.0796414 0.0719293 0.00453596
+-0.00871509 0.0670095 -0.035665
+-0.04676 0.0797358 -0.0197068
+0.00759602 0.120603 -0.0139518
+-0.00757253 0.0384534 0.015324
+0.027396 0.0902329 0.0450202
+-0.0837001 0.104608 0.0275279
+-0.0648437 0.159826 -0.0567739
+-0.0182921 0.113707 -0.0184295
+-0.0318101 0.0499111 0.0410759
+0.0042017 0.130577 0.0226921
+-0.0882785 0.102304 0.00940329
+-0.0669196 0.157864 -0.00782765
+-0.0574974 0.104327 0.0414929
+-0.028183 0.0499752 0.0445203
+0.0437475 0.087439 -0.00380588
+0.047365 0.0735855 0.0109418
+-0.0355275 0.04785 0.0396404
+-0.00564979 0.0511569 -0.0315211
+-0.0622081 0.163133 -0.0355907
+-0.0126796 0.0555759 -0.033924
+-0.0434133 0.12436 -0.00948612
+0.0325363 0.0605817 0.0399114
+0.00828387 0.0859903 0.0560092
+-0.0377619 0.0480619 -0.0149351
+-0.0152064 0.0377587 0.0513804
+0.0337034 0.0740969 0.0399489
+0.0386678 0.106943 0.0231645
+-0.0568902 0.10122 -0.0192994
+-0.0629975 0.158364 -0.0415982
+0.0174963 0.116768 0.0361173
+-0.018574 0.174216 -0.0164984
+-0.0916005 0.147489 0.0211447
+0.0351839 0.113522 0.00409669
+-0.0642224 0.175708 -0.0529566
+-0.0646189 0.0691309 -0.0109873
+-0.0744709 0.159641 -0.0299365
+-0.0810037 0.0777776 0.0280061
+-0.0468539 0.0397424 -0.0132276
+-0.0387576 0.152152 0.00343994
+-0.0355301 0.0350253 0.0446914
+-0.0252945 0.179999 -0.0179968
+-0.0594833 0.0440844 0.0256893
+-0.0262483 0.175689 -0.00998917
+-0.0357 0.0344414 0.0311095
+-0.0348452 0.0957896 -0.0233484
+-0.0694619 0.0701676 0.0334316
+-0.0704025 0.156596 -0.000355665
+0.0197946 0.0872171 -0.0264236
+-0.00225576 0.119004 -0.0141489
+0.0447595 0.0819096 0.000199099
+-0.0414725 0.16704 -0.0108149
+0.0383695 0.0533606 -0.00654853
+0.0436976 0.0763605 0.0261605
+-0.059412 0.0342492 0.0297869
+-0.0105538 0.0962042 -0.0319333
+0.0354985 0.0483762 0.03122
+-0.0232213 0.183101 -0.0108227
+-0.0454832 0.0704956 0.0415155
+-0.0818632 0.143391 0.0428465
+-0.00588211 0.0384235 0.0193174
+-0.0715611 0.065876 0.0226562
+-0.0557658 0.0561367 -0.00241411
+-0.007704 0.0613485 -0.0352024
+-0.050582 0.13546 0.000440434
+-0.0239591 0.0958294 0.044594
+-0.0344217 0.156595 0.00275895
+-0.0721769 0.146332 -0.0246714
+-0.00172768 0.0683482 -0.0343533
+0.0465137 0.0736858 0.00606841
+-0.0379081 0.0345108 0.0393807
+-0.0536272 0.0632225 -0.00927695
+0.0216001 0.0346735 0.00635285
+-0.00546011 0.130518 0.00622904
+0.025022 0.0994981 0.0433749
+-0.059626 0.14292 -0.00334389
+-0.0662647 0.160967 -0.0574681
+-0.086688 0.0937529 0.026595
+-0.0292509 0.122699 0.0223824
+-0.020881 0.0609703 0.0467992
+-0.0727056 0.0704556 0.030746
+-0.0670342 0.154632 -0.0510962
+-0.0818617 0.117704 -0.00327392
+-0.00930377 0.0384012 0.0113924
+-0.0294534 0.0382504 0.0532249
+-0.0428028 0.034428 0.0296237
+0.034591 0.113857 0.0224952
+0.0260945 0.0981604 0.0431638
+0.0157288 0.0740195 0.0526622
+0.00528348 0.0654438 -0.0329345
+0.0342272 0.113045 -0.000582475
+0.0177023 0.127344 0.0204737
+-0.00349601 0.0619414 0.0556852
+-0.0633856 0.13531 0.0381918
+-0.0187732 0.0742782 -0.038946
+-0.0714922 0.124606 0.0531293
+-0.0387588 0.0432047 -0.0253505
+-0.0377685 0.112865 -0.0174473
+-0.0811078 0.0831466 0.0326628
+0.0121734 0.0347014 0.0407838
+-0.0423463 0.0344667 0.0367209
+-0.0247884 0.0905387 0.0498003
+-0.0589097 0.111154 -0.0162513
+-0.0119878 0.0389387 -0.0117395
+-0.0746688 0.0730125 -0.00771761
+-0.0636783 0.0344406 0.016873
+-0.0718387 0.063614 0.0140147
+-0.0537353 0.0753205 -0.0183524
+0.0399868 0.0793585 0.0332409
+0.0342696 0.0686799 0.038964
+0.0283038 0.121367 0.00870899
+0.020694 0.101208 -0.0211426
+-0.0607079 0.149875 -0.000940868
+-0.0663226 0.0771733 0.0404118
+-0.0856352 0.151298 0.0280417
+0.00450086 0.0533884 0.0535142
+0.0193556 0.0370965 -0.0106758
+-0.073245 0.152646 -0.0348949
+-0.0311279 0.168264 -0.00654632
+-0.0314769 0.122323 0.024544
+-0.00965298 0.0383614 0.0149817
+0.0322912 0.117174 0.00450048
+-0.0303956 0.0833549 -0.0325649
+-0.0305081 0.109824 0.0377476
+0.060267 0.0581373 0.011162
+-0.0782363 0.119072 0.0512696
+-0.0819743 0.130956 -0.00393996
+0.0125568 0.129953 0.0057397
+-0.0750314 0.165158 -0.038026
+-0.0842614 0.0857549 -0.00354776
+-0.0194949 0.122198 0.0303074
+-0.0885869 0.0914877 0.00746285
+0.0183032 0.0622432 -0.0278633
+-0.0188389 0.0383463 0.00224079
+0.0169223 0.0354899 -0.0154522
+-0.0510859 0.154625 -0.00472421
+-0.04134 0.171235 -0.00891614
+-0.00271064 0.0641639 -0.0348647
+-0.0404957 0.119327 0.0301663
+0.0161104 0.038261 0.0437952
+-0.0788559 0.0706244 0.0187647
+-0.0565382 0.0387829 -0.00997998
+0.00406092 0.0347375 0.0390843
+-0.052431 0.0503969 0.0246465
+-0.0548238 0.136818 -0.00273484
+-0.0168361 0.163394 -0.0165332
+0.0085002 0.0589241 0.0531764
+-0.00349833 0.104479 0.0440938
+0.041165 0.0675922 -0.00677134
+-0.0766837 0.0941158 0.0377884
+-0.0715005 0.108276 0.0374406
+-0.0514917 0.154976 0.0111
+-0.0766573 0.0758638 -0.0078194
+-0.0708734 0.116483 -0.00801313
+-0.0584915 0.0333664 -0.00308936
+-0.0132404 0.0420117 0.0507817
+0.0504568 0.0627892 -0.00292241
+0.0181009 0.0617863 0.0489038
+-0.0686053 0.155434 -0.0518073
+-0.0866142 0.111799 0.023338
+-0.0087012 0.0613261 -0.0351009
+-0.0667075 0.179209 -0.0538653
+0.0133269 0.036855 0.044466
+-0.0308424 0.0930072 -0.0244625
+-0.0526579 0.118327 0.034303
+-0.0802651 0.0940224 0.034298
+-0.0895241 0.094286 0.0154262
+-0.0580951 0.0448084 0.0137644
+0.0187472 0.0369987 -0.01368
+-0.0174935 0.0786826 0.056671
+-0.026682 0.0779832 0.0478067
+0.0449566 0.0931917 0.0141646
+-0.0598355 0.0968573 -0.0194316
+-0.015743 0.0388551 0.0331436
+0.045657 0.07639 0.00319799
+0.00221136 0.0782941 -0.0352071
+-0.0725589 0.0360747 0.00146649
+-0.0641358 0.117113 0.0460384
+-0.0709488 0.0833216 0.0408543
+0.0230126 0.0366914 0.0285839
+0.0164832 0.101772 0.0464774
+-0.0114886 0.10724 0.0431864
+-0.0748949 0.0968349 0.0387401
+-0.0428468 0.0368545 0.044028
+-0.0121243 0.183164 -0.0282842
+-0.0110799 0.0973863 0.0517395
+-0.0283441 0.0346627 0.0430398
+-0.0591236 0.0454581 0.0276809
+0.0359903 0.0834983 0.0380665
+-0.0894731 0.112826 0.0381953
+-0.0633619 0.165109 -0.0324564
+-0.0893245 0.139298 0.0361742
+-0.0113718 0.177173 -0.0236196
+0.0314957 0.0386039 0.0249642
+-0.0153586 0.171251 -0.0171482
+-0.0501632 0.165541 -0.000963216
+-0.0125979 0.0362885 -0.0258846
+-0.0109041 0.121705 -0.010941
+-0.01134 0.181374 -0.0292688
+-0.0636417 0.067527 -0.00924444
+-0.0645561 0.151545 -0.0345673
+0.0234128 0.0685823 0.0460905
+-0.0204536 0.184888 -0.0139868
+-0.0362035 0.16829 0.000195359
+-0.0423655 0.0354607 0.0428683
+0.029434 0.0414849 -0.00426139
+-0.0548859 0.0335879 0.0154264
+0.0301337 0.0958138 -0.0174156
+-0.0231819 0.174173 -0.0207431
+0.0495183 0.0596792 0.0306871
+-0.0615314 0.169388 -0.0555899
+-0.0645149 0.156191 0.0192193
+-0.0808163 0.150056 0.00117383
+-0.0203106 0.127423 0.0152774
+-0.048501 0.0946267 0.0446158
+-0.0621404 0.0458224 0.0356845
+0.014817 0.0713159 0.0530708
+-0.0482359 0.0600875 0.0359237
+0.0583839 0.0607371 0.00317993
+0.0532979 0.0476993 0.0202039
+-0.00334167 0.13115 0.0113211
+-0.0451105 0.146112 0.00345863
+-0.0728436 0.0965116 -0.0147387
+-0.00290701 0.128667 -0.00250924
+-0.0175351 0.0472943 0.0498404
+-0.0710465 0.156278 0.000878407
+0.0130461 0.106823 -0.0191157
+-0.0241467 0.169732 -0.0193183
+0.0184844 0.092024 0.0477707
+-0.0849646 0.0925759 -0.00355765
+-0.0135115 0.0617879 0.0541775
+0.0358003 0.0371828 0.0161878
+-0.0563756 0.0338236 0.0220041
+-0.0344987 0.119335 0.0301753
+-0.0207895 0.0363821 -0.0186131
+0.0366896 0.0394563 0.0234361
+0.0454465 0.0903989 0.00417224
+-0.0686026 0.0339552 0.0087048
+-0.0248008 0.0797877 -0.0377608
+-0.0253831 0.0645504 -0.0324979
+-0.0924079 0.114699 0.0153245
+0.0404169 0.104204 0.0201615
+-0.0864551 0.137921 0.0433346
+0.0453383 0.0861836 0.0191712
+-0.0550359 0.12552 0.0379729
+0.0499773 0.0719552 0.0208312
+-0.0878453 0.10502 0.0133698
+0.0226563 0.0416586 -0.00875234
+0.00847112 0.0503629 0.0509458
+0.0193029 0.12103 0.032512
+-0.0288694 0.102979 -0.023086
+-0.0655006 0.155906 0.0116223
+-0.0865291 0.125714 0.0480303
+-0.0762092 0.103511 0.0356214
+0.027039 0.0433782 0.0352623
+-0.00878391 0.0340179 -0.0196776
+0.01688 0.104029 -0.0201606
+-0.0779922 0.155321 0.011561
+0.012978 0.0975651 -0.0232996
+-0.0570356 0.142438 0.0315884
+0.00678439 0.0392286 0.0320303
+-0.0187316 0.184448 -0.0230478
+-0.05583 0.0898375 -0.0220234
+-0.0624118 0.168239 -0.0611966
+-0.019552 0.0381879 0.0203532
+-0.0619388 0.0647772 0.0309092
+-0.0929984 0.129612 0.0152364
+0.0241882 0.0633761 -0.0240832
+-0.0154901 0.11097 -0.019533
+0.0335254 0.101204 -0.0131717
+0.0440036 0.0411539 0.00525252
+0.0443474 0.05051 -0.00579969
+-0.00564997 0.0526431 -0.0322774
+0.024909 0.124002 0.00889289
+-0.0551719 0.0344352 0.0357625
+-0.00149801 0.0828985 0.0574954
+-0.0649207 0.122383 -0.00889091
+-0.0371067 0.163706 -0.0138205
+-0.013511 0.0673225 0.0538556
+-0.0664425 0.121454 0.0513831
+-0.0749127 0.151363 0.0363064
+-0.0786131 0.166659 -0.0369473
+0.0259941 0.0889184 0.046498
+-0.0508607 0.133588 0.0291236
+-0.0624206 0.150641 -0.0155752
+-0.0345377 0.0353482 -0.0311793
+-0.0926334 0.130971 0.0152338
+0.00420379 0.0852404 -0.0337772
+0.0493319 0.0575419 -0.00502247
+0.0210858 0.0848756 0.0499424
+-0.0209282 0.0711316 0.0521839
+-0.0556334 0.121157 -0.00996616
+-0.0578782 0.0955404 -0.0210377
+-0.0636177 0.149382 -0.0259273
+-0.023437 0.0753613 0.0517266
+-0.0424368 0.033567 0.00359466
+-0.0366861 0.0651313 -0.0144389
+0.00275029 0.0392893 0.0311503
+-0.0858603 0.137915 0.0441653
+0.00249981 0.0938632 0.054785
+-0.0405815 0.125646 -0.00686289
+0.00652265 0.0633208 0.0557678
+-0.0736187 0.0665006 0.01992
+0.0178849 0.106917 -0.0172488
+-0.0404999 0.16823 0.00286674
+-0.0578818 0.101192 -0.0190391
+0.0415111 0.0596706 0.0303495
+0.0445386 0.0917351 0.000179816
+0.0404099 0.0926692 0.0304567
+-0.0715386 0.177351 -0.0469381
+-0.00955325 0.129382 0.0220461
+-0.0304508 0.11875 -0.0116176
+-0.0553453 0.138992 -0.00307013
+0.0373215 0.0444316 0.0300039
+-0.0439866 0.0342955 -0.0250034
+0.0438502 0.081834 0.0262681
+0.0105117 0.057471 0.0526043
+-0.0609073 0.0423237 0.0152297
+-0.0566933 0.0478983 -0.00338525
+-0.0882052 0.0955366 0.00643448
+-0.0697305 0.146842 -0.0262196
+-0.0654573 0.131176 0.0439868
+-0.0332792 0.168261 -0.00439757
+0.0262829 0.0520004 0.03955
+-0.0246803 0.0386712 -0.0158919
+-0.0243119 0.0382419 0.00485642
+-0.0650689 0.0416148 -0.00522845
+-0.0224969 0.105778 0.0423492
+-0.0675666 0.163787 -0.0559757
+-0.0625249 0.0642497 0.029495
+-0.066705 0.170483 -0.0379595
+-0.0387912 0.0855771 -0.0218281
+-0.0362227 0.121033 0.0288309
+-0.0351413 0.166693 -0.0148789
+0.0484731 0.0728694 0.00986875
+-0.0715958 0.035386 0.00909438
+-0.0654475 0.0414866 0.0340095
+-0.0897915 0.135018 0.00821888
+-0.0256856 0.161028 -0.00218154
+-0.0294591 0.0367076 -0.0187628
+-0.0318602 0.0341892 0.0214236
+-0.0741619 0.0781636 -0.0115723
+-0.0759684 0.138187 -0.00615578
+-0.0746432 0.067744 0.0203901
+-0.0481968 0.058714 0.0359259
+-0.0809888 0.100705 0.031995
+0.0223647 0.0795488 0.0499944
+-0.0164996 0.0587643 0.0515064
+-0.0843239 0.0775269 0.0169616
+-0.0474174 0.157905 0.00867917
+0.0256365 0.0450396 -0.0116814
+-0.0560862 0.153109 -0.0014946
+-0.0364777 0.0491722 0.0391199
+-0.0353775 0.172711 -0.013245
+0.0345426 0.0361041 0.0132537
+-0.0476575 0.0606291 -0.0121142
+0.0517359 0.0693876 0.00244776
+-0.0895642 0.139283 0.0271809
+-0.0554895 0.087587 0.0448409
+-0.00460242 0.0419996 -0.0255341
+-0.0747436 0.0846695 0.0389578
+-0.0522959 0.0518057 0.0276471
+0.0344259 0.0713949 0.0392126
+-0.0858246 0.111645 0.00429163
+7.90085e-05 0.131159 0.00541676
+-0.0876151 0.1105 0.015342
+-0.0308705 0.0385373 -0.0301935
+-0.0174841 0.088353 0.056296
+-0.0717036 0.179379 -0.0498901
+-0.0872579 0.113355 0.0275168
+-0.0132522 0.180136 -0.0286131
+0.0147067 0.111012 -0.0176211
+0.0100468 0.0698695 0.0549195
+-0.00549411 0.130838 0.0134037
+-0.0444864 0.070528 0.0418968
+-0.0694946 0.0902043 0.0422251
+-0.0125029 0.0673483 0.0540527
+-0.0889341 0.0928773 0.0104474
+-0.049902 0.0335302 0.00572664
+0.0224871 0.0436168 0.0410219
+-0.0391731 0.163682 -0.0125377
+-0.0389872 0.0336658 0.00601497
+0.0423783 0.0676875 -0.00279832
+-0.0314483 0.177007 -0.0139273
+0.0365023 0.0700019 0.0369139
+-0.0817843 0.113273 -0.0014411
+-0.0155011 0.0786732 0.0567092
+-0.0616004 0.115786 -0.012288
+0.0336937 0.0994802 0.0365924
+-0.0819199 0.0775142 -0.000486403
+-0.0620032 0.154899 0.00420466
+-0.0689571 0.134062 -0.00839151
+0.0341993 0.115326 0.00949444
+-0.0853268 0.127125 0.0496018
+-0.0075399 0.0430305 0.0487452
+-0.000964681 0.0992981 -0.0251507
+-0.0896495 0.146064 0.0111487
+0.0457169 0.0792126 0.021174
+-0.0677903 0.180834 -0.0585489
+-0.0525855 0.0528134 0.0122839
+0.045458 0.0847917 0.019171
+-0.0620511 0.164652 -0.0545872
+-0.0012817 0.0411143 0.047028
+-0.0620444 0.166711 -0.0606187
+0.0416044 0.0774454 -0.0068035
+-0.0180891 0.0568831 0.0497969
+0.0289502 0.0888845 0.043761
+-0.0361509 0.0471597 -0.0213258
+0.0209931 0.0505428 0.042434
+-0.081698 0.0939818 0.0329068
+-0.0701548 0.148741 -0.0366493
+-0.0726057 0.158224 -0.0359121
+0.0452801 0.0777562 0.00119407
+0.0034868 0.107186 0.0422902
+-0.0603898 0.116109 -0.0126519
+-0.0799294 0.154987 0.0226092
+-0.0412543 0.0342017 0.0283816
+-0.073067 0.0692219 0.0282366
+-0.0232836 0.0382816 -0.000419572
+-0.0843726 0.0952582 -0.00357113
+-0.0871856 0.0923586 0.0257303
+0.0415318 0.09261 0.0284783
+-0.0528539 0.1113 -0.0177773
+-0.0653767 0.0770838 0.0407622
+0.0608603 0.0609709 0.0131614
+0.0163938 0.128844 0.0100049
+-0.028759 0.0386585 -0.0166912
+-0.0688752 0.11651 -0.00852528
+-0.00266028 0.0525834 -0.0313625
+0.0395925 0.0979794 0.0293107
+-0.063517 0.0417383 0.0266777
+-0.0206145 0.038142 0.0147556
+-0.0746919 0.0745094 -0.0088781
+-0.0730235 0.16103 -0.0369405
+-0.0511023 0.141628 0.018382
+0.026686 0.0963684 -0.0200186
+0.00049039 0.0952019 0.0544773
+-0.0374215 0.0466159 -0.0218044
+-0.0396639 0.0592228 -0.0116772
+0.0589085 0.0593684 0.0217913
+-0.069935 0.128232 -0.00913858
+-0.0154583 0.128246 0.0199229
+-0.082956 0.0762572 0.0165263
+-0.0698527 0.139727 0.0465118
+-0.0793995 0.0962934 -0.0095136
+0.029447 0.119051 0.00204245
+-0.0406195 0.0505975 -0.0111291
+-0.0337259 0.125903 0.000119567
+-0.00361865 0.109419 -0.0218821
+-0.0324923 0.0845615 0.0419149
+-0.0304819 0.0903593 0.0440392
+-0.0289421 0.0848695 0.0456392
+-0.067993 0.172429 -0.0412978
+-0.0699656 0.167828 -0.0233999
+-0.0633908 0.0664235 0.0326881
+-0.0328103 0.178226 -0.00982944
+-0.0144938 0.0897854 0.0566872
+-0.00301248 0.0391855 -0.0120497
+-0.0467348 0.10982 -0.0182008
+-0.0347751 0.123588 -0.00668109
+-0.081672 0.0966878 0.0327979
+0.0208066 0.08618 0.0495337
+-0.0294922 0.102919 0.0420695
+-0.0514977 0.0917694 0.0441515
+-0.0561584 0.13394 0.0346041
+0.0587961 0.055231 0.00916964
+0.0239769 0.0672243 0.0451455
+-0.0590987 0.135299 0.0356206
+-0.0833215 0.153324 0.00972396
+-0.0775565 0.148654 -0.00488618
+0.0134356 0.129163 0.0217505
+0.00242681 0.0392303 -0.00913048
+-0.00111738 0.0369593 -0.0152505
+-0.0884159 0.102321 0.0103913
+0.0452046 0.0684536 0.0248447
+-0.0107692 0.1278 -0.0014358
+-0.067702 0.169446 -0.0560134
+-0.0645991 0.162478 -0.0199783
+-0.0384905 0.0591295 0.0404813
+-0.0133897 0.0383025 0.0215062
+-0.0335039 0.113859 0.0341437
+0.00725148 0.0739904 -0.0339985
+-0.0197912 0.0347004 -0.0276305
+-0.0364291 0.0383909 -0.00870817
+-0.0382525 0.154358 -0.00883541
+-0.0576615 0.0645392 -0.00788705
+0.0271486 0.0677873 -0.0226945
+-0.0484929 0.0776741 0.0437591
+-0.0538207 0.0913026 -0.0221948
+-0.0414756 0.102877 0.0407886
+-0.0194769 0.0384097 -0.0016118
+0.0409764 0.0725373 0.0310711
+-0.046711 0.0723683 -0.0164352
+-0.0169229 0.0385492 -0.0161043
+0.0274461 0.0888981 0.0450769
+0.0384486 0.0446185 0.0300797
+-0.0498739 0.120141 -0.01301
+-0.0147995 0.0382136 0.0194957
+-0.034222 0.0422724 0.0479221
+-0.00554376 0.0388664 -0.0141367
+-0.00771915 0.0642161 -0.0356843
+0.0380609 0.108343 0.0221716
+-0.0496329 0.05762 -0.010324
+-0.0640324 0.0336604 0.00811729
+0.0288939 0.0349903 0.0075309
+-0.0369254 0.170672 -0.0129456
+0.0567415 0.0605855 0.00115011
+-0.026353 0.0382316 0.0044532
+-0.088166 0.0963498 0.023753
+-0.0332851 0.0368458 -0.0306141
+-0.0138558 0.0387296 -0.0044727
+0.0597512 0.0650182 0.00715554
+-0.0267551 0.0740245 -0.0360482
+0.0214915 0.0369736 0.0352586
+-0.0515738 0.0559395 0.0296214
+0.00622241 0.123988 -0.00957575
+0.0558148 0.0493476 0.0171957
+-0.0766567 0.112144 0.0469767
+0.0408877 0.0928069 -0.00817715
+-0.0862272 0.0886081 0.000477626
+-0.0341682 0.0723955 -0.0204945
+0.0468003 0.0745424 0.0107517
+-0.00983206 0.0896484 -0.0366649
+-0.00782261 0.0985178 0.051315
+-0.070543 0.17193 -0.0350862
+0.0371254 0.0869172 -0.0157926
+-0.059432 0.152725 0.0327387
+-0.0644942 0.149793 0.0375095
+-0.02966 0.0875784 -0.0315907
+0.0234483 0.0350084 0.0101439
+-0.0672661 0.155709 0.00954294
+0.0249549 0.0915796 0.0467751
+-0.0750729 0.0675817 0.0186826
+-0.065557 0.158804 -0.0559152
+-0.0869809 0.112371 0.0426661
+-0.0388924 0.0336117 -0.0270987
+-0.0925871 0.117342 0.0103086
+-0.0285134 0.0559644 0.0364164
+-0.0592485 0.148248 0.0355123
+-0.0386245 0.0472623 -0.0172994
+0.0417415 0.0676611 -0.00475281
+0.017067 0.127696 0.00312982
+-0.00768714 0.116771 -0.0157299
+-0.0210692 0.0667823 0.0496379
+0.0306718 0.0605569 0.0407187
+-0.086202 0.0805924 0.0105044
+0.0248868 0.0727438 0.0465386
+-0.0226479 0.182963 -0.0190305
+-0.064868 0.0953298 -0.0181139
+-0.0212331 0.0553385 0.0459146
+-0.0900228 0.148451 0.0254546
+-0.0659345 0.109414 0.0377967
+-0.0156357 0.0466082 -0.0291798
+-0.0783295 0.108958 0.0384425
+-0.0353519 0.169773 -0.000327923
+-0.0576724 0.155657 0.012957
+0.0299243 0.0902598 0.0434097
+-0.0938789 0.125503 0.0152603
+0.00849738 0.0910108 0.0540495
+-0.0924729 0.117499 0.0403021
+-0.0538856 0.101336 -0.0209374
+0.0230068 0.125355 0.00960117
+-0.0753773 0.0887668 0.039456
+-0.0164714 0.0348128 0.0436847
+-0.0124833 0.108618 0.0427908
+0.00650022 0.0937602 0.0531051
+-0.0254901 0.101602 0.0435889
+-0.0681644 0.132655 0.0471068
+0.0116725 0.130674 0.0125466
+-0.0658455 0.0693268 0.0349111
+0.0131057 0.0346676 0.0247536
+0.0111453 0.0752893 0.0548169
+-0.0414315 0.120058 -0.0129928
+-0.0667828 0.0837809 -0.018353
+-0.0558768 0.105489 -0.0184971
+-0.0646849 0.0705888 -0.0125799
+0.00250861 0.0634123 0.0567384
+-0.0102337 0.0987343 -0.0266102
+-0.0475686 0.0376232 -0.0123457
+0.0326729 0.0388984 0.0249367
+-0.0754158 0.14997 -0.0218646
+0.0149498 0.0475024 0.0442108
+-0.0897923 0.144692 0.013139
+-0.065193 0.0597221 0.0116014
+-0.0777759 0.113375 -0.00398806
+-0.0457101 0.131722 0.0089192
+-0.0575663 0.0481384 0.0346641
+-0.0838122 0.128533 0.0508937
+-0.0104939 0.0933018 -0.0349679
+0.0252085 0.0464911 -0.0166174
+-0.0789879 0.13894 -0.00474105
+-0.0475728 0.0656919 0.0379498
+0.0110822 0.113195 -0.0179885
+-0.0649225 0.170267 -0.0430968
+-0.00871405 0.112847 -0.0195489
+0.0452857 0.0889846 0.0161633
+-0.0171038 0.128182 0.00771491
+-0.0114919 0.0911558 0.0564108
+-0.0672347 0.158081 -0.05503
+-0.0375789 0.0335576 -0.0249215
+-0.028354 0.0521667 -0.0233844
+-0.0687469 0.179151 -0.0517127
+-0.0635972 0.164728 -0.0295802
+-0.00849416 0.0661021 0.0557034
+0.0018938 0.131459 0.00752669
+-0.0104875 0.10724 0.0431922
+0.0420847 0.0764929 0.0291356
+-0.0164676 0.125926 0.0254562
+-0.0666931 0.162075 -0.0149837
+0.000392133 0.0405199 -0.0247969
+-0.062597 0.0740287 0.040345
+-0.038486 0.115285 0.0333239
+-0.0134767 0.0545379 0.0508338
+-0.0379773 0.128134 0.0117903
+0.0282176 0.0746072 -0.022898
+-0.00949856 0.0898059 0.0569552
+-0.0633588 0.166271 -0.0375898
+-0.088608 0.0874693 0.0094764
+-0.00658802 0.126776 -0.00645935
+0.00550371 0.0533623 0.0533002
+0.0568364 0.0723477 0.016027
+-0.0746813 0.077485 -0.0103851
+0.0599778 0.0622697 0.0191849
+-0.0834343 0.143353 0.0415913
+0.0461466 0.0773319 0.0190905
+-0.0643928 0.0366139 0.0414145
+0.017105 0.0913787 0.0494605
+0.0113838 0.0463423 -0.025328
+0.00150906 0.0925101 0.0553138
+-0.0905552 0.131061 0.0372264
+0.0271939 0.0479684 -0.0167032
+0.0118641 0.130407 0.00833975
+-0.0534963 0.0413918 0.0463882
+-0.00348783 0.0548509 0.0542207
+-0.0241218 0.165279 -0.0170232
+0.0526044 0.0736805 0.0129696
+0.00493694 0.0358587 0.023833
+-0.0308996 0.0862326 -0.0295626
+-0.0749566 0.152744 -0.0158977
+0.022407 0.0700249 0.0481925
+-0.0644326 0.152123 0.0354487
+-0.083145 0.0762813 0.00952219
+-0.0066641 0.130277 0.00578337
+-0.0503124 0.0487527 0.0166746
+-0.0857975 0.0926505 0.000473688
+0.0319954 0.0554568 -0.0137989
+-0.0325248 0.0371997 0.032926
+-0.0378236 0.0914714 -0.0236656
+0.0107752 0.0603237 0.0523688
+-0.0709378 0.0995366 0.0403447
+0.00229927 0.0641027 -0.0339638
+0.0301658 0.0510827 -0.0137422
+-0.0152122 0.0387061 -0.0065833
+0.0328168 0.0373031 0.0209449
+-0.0564976 0.0959787 0.0438593
+-0.0530296 0.137293 -0.00118635
+-0.0114929 0.0745162 0.0566704
+0.0339687 0.0768049 0.0403387
+0.0229251 0.0476731 0.039919
+0.0153286 0.0594649 -0.0285327
+-0.0650165 0.0356472 0.0166692
+-0.0872319 0.104968 0.0093836
+0.0317565 0.0752189 -0.019756
+0.0174897 0.107108 0.0415537
+0.00650555 0.0716952 0.056225
+0.0214733 0.0808843 0.0504673
+-0.0157973 0.0382489 0.019257
+-0.073889 0.119392 -0.00790358
+-0.0588895 0.0969269 -0.0201624
+-0.0614701 0.166956 -0.0604533
+-0.0411287 0.160673 -0.0112161
+-0.0558134 0.0883826 -0.0218608
+-0.0206962 0.0385843 -0.00942784
+0.0401892 0.0759203 -0.00879733
+0.0191194 0.0349494 -0.00374623
+-0.0414976 0.113906 0.0346806
+-0.00581815 0.0854694 -0.0375201
+-0.0859756 0.0805547 0.00750576
+-0.0833395 0.103378 -0.00262342
+-0.0446335 0.126046 -0.00723965
+0.0260088 0.0910229 -0.0223512
+0.034944 0.10998 0.0278542
+-0.00248857 0.0703789 0.0573235
+-0.0102702 0.0385128 0.00564525
+-0.0283572 0.0578046 -0.0244014
+-0.0210295 0.0958616 0.0473023
+-0.0141375 0.0347096 0.0460356
+-0.0244241 0.178665 -0.0108375
+0.00749812 0.109597 0.0408218
+-0.0356643 0.0606925 -0.0124069
+-0.0638002 0.166551 -0.0354938
+-0.0862312 0.0940245 0.00140199
+-0.0365789 0.0337187 0.00826156
+0.0240933 0.0685753 0.045325
+-0.0891661 0.132396 0.0419315
+-0.0177346 0.065722 -0.0374816
+-0.0224613 0.12203 0.0284859
+-0.0509119 0.055753 0.0316394
+-0.0340805 0.0680941 -0.0175876
+-0.0166639 0.0364717 -0.017882
+0.0347021 0.0768104 0.0396564
+0.0213412 0.0565052 -0.0267347
+-0.0707159 0.179287 -0.0569572
+-0.0748092 0.0790936 0.0363823
+-0.0577944 0.0460393 0.0120187
+-0.0302932 0.123607 -0.00301843
+0.00749105 0.050377 0.0513506
+-0.0641553 0.162388 -0.0586672
+-0.0197076 0.059653 0.0484949
+0.0376477 0.110588 0.00928033
+-0.0151896 0.0391404 0.0514631
+0.020848 0.0400652 -0.0117024
+-0.0208303 0.119929 -0.0109428
+0.0157129 0.124796 -0.00448994
+-0.00658665 0.0388228 -0.0143041
+0.0254417 0.121647 0.000551492
+0.0535789 0.0658041 0.000119664
+0.0473148 0.0518659 -0.00495567
+0.0299175 0.0524736 -0.0157475
+-0.0183959 0.112492 -0.0191613
+-0.0893828 0.0916068 0.0204288
+-0.0614858 0.175719 -0.0606762
+-0.0901396 0.13244 0.0372222
+-0.0238257 0.0881589 -0.0366228
+-0.0218791 0.0383442 -0.00388387
+0.00124143 0.0390154 -0.00356473
+-0.0669805 0.1589 -0.00929727
+0.0483233 0.0547304 -0.00526262
+-0.0444857 0.0661533 0.0401374
+-0.0514919 0.076238 0.0430598
+-0.0301912 0.0664057 -0.0274649
+-0.0408343 0.0942887 -0.0229156
+-0.00749956 0.121159 -0.0124082
+-0.061476 0.158429 -0.028587
+-0.0675029 0.109729 0.0377486
+-0.0697083 0.1638 -0.0499695
+-0.062151 0.152195 -0.0205783
+0.0342924 0.0619556 0.0389482
\ No newline at end of file
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/cube_ran.pts b/Alpha_shapes_3/demo/Alpha_shapes_3/data/cube_ran.pts
new file mode 100644
index 000000000000..ae0320923a7d
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/cube_ran.pts
@@ -0,0 +1,582 @@
+581
+-9496.000158 -6621.999660 73324.000108
+1941.000008 -502.999956 53448.000262
+-13993.000076 -9472.000458 73547.999893
+-3165.000198 2805.999696 53841.000158
+3941.000109 -826.999564 53350.999780
+-13992.999698 -6391.999696 73548.000325
+-4629.000334 -2729.999756 72919.999638
+-14544.000229 7643.999701 62169.999969
+-3539.000009 -7617.000066 72743.000159
+-3569.999951 1963.000330 53954.000331
+4099.000115 540.000082 55720.000195
+3946.000208 3611.000347 54343.000242
+3942.000336 -1955.000290 53845.000430
+24.000106 -8480.000056 72560.000446
+-2817.999819 -7080.000021 72739.999999
+274.999768 2681.999578 53612.999729
+-5673.000363 -8522.000312 72919.999924
+-3569.999681 5328.999917 53954.000391
+7057.000447 22.999921 72019.999778
+-7114.999994 -4259.000412 73100.000243
+3129.999877 -1020.000207 53119.999650
+-14575.999938 2064.000292 60412.000409
+-8087.999603 -2692.999873 73164.999998
+-9496.000263 -8099.000270 73323.999696
+-14575.999757 4785.999619 60412.000416
+1767.000453 -2710.000440 72380.000399
+4723.999558 2984.999684 72199.999829
+4173.000154 -1942.000364 57518.000224
+-14185.000047 -8155.999786 69664.999947
+8462.999751 -2789.999723 72019.999998
+-14475.999680 -6322.000368 63961.000010
+-14185.000218 -6669.000381 69665.000452
+-14411.999521 8769.999611 63528.000202
+-3929.999793 121.999623 53660.000393
+-3538.999885 -6227.999801 72743.000078
+5664.000221 8483.999673 72199.999788
+4160.000223 3746.999664 57257.999712
+16.999585 1061.999516 53479.999584
+3441.000482 4789.999724 53120.000035
+3941.000301 861.000216 53350.999558
+3941.000166 186.000103 53350.999891
+-5672.999756 5721.000193 72920.000053
+-14411.999799 1051.999879 63528.000013
+3441.000192 5308.999633 53119.999836
+-13970.999556 -6778.999631 71592.999827
+-5673.000352 1448.000308 72919.999896
+1941.000287 3661.000398 53448.000221
+4159.999588 2681.999997 57257.999788
+2098.999573 1058.000232 53299.999983
+-3569.999774 280.000127 53953.999842
+-3538.999679 -9006.000017 72743.000111
+-3570.000143 -1402.000081 53954.000006
+-7115.000060 5734.999820 73099.999872
+-1026.999875 -1026.999558 53479.999537
+7056.999811 -4195.999750 72020.000402
+-3570.000168 3085.000137 53954.000020
+-13970.999844 -9803.999811 71592.999532
+17.000252 6285.000424 53479.999576
+-14322.999690 -2587.000320 65092.999918
+-5387.999792 -1969.999910 72920.000067
+-1426.999888 2743.999772 53744.000433
+-3538.999950 -2059.999970 72742.999563
+-14412.000000 6664.999905 63527.999948
+-3570.000271 3646.000059 53954.000087
+-3929.999828 -1973.999852 53659.999952
+-4237.999601 -7080.000344 72740.000252
+-14373.000194 -7866.999965 65785.999683
+3946.000001 2584.000490 54343.000220
+3941.000101 2886.999557 53350.999752
+4160.000230 551.000414 57257.999512
+4264.000084 1686.000457 60564.000497
+-9495.999646 -3667.999852 73323.999965
+4288.000261 1950.999734 60834.000001
+1432.000381 -1938.999865 53464.000475
+-5126.999748 3887.999847 72980.999916
+4287.999632 278.999662 60833.999729
+-2072.000101 17.000308 53479.999547
+-14411.999918 5261.999514 63527.999544
+-14185.000455 -5180.999602 69665.000041
+4263.999685 -536.999855 60563.999513
+4724.000258 1575.000409 72200.000149
+4159.999987 4812.999838 57258.000035
+-3930.000140 4837.999779 53659.999939
+-8543.000324 -8542.999590 73099.999989
+-3570.000177 840.999915 53954.000138
+3941.000105 1874.000098 53351.000382
+3946.000349 4637.999658 54342.999822
+8462.999539 8462.999818 72019.999892
+5664.000082 4253.999844 72200.000354
+-5387.999671 2302.000049 72920.000121
+-5388.000189 166.000459 72919.999521
+5664.000053 -4206.999676 72200.000476
+2473.999900 -2709.999879 72380.000265
+16.999506 -1027.000446 53479.999576
+4263.999639 -1647.999637 60564.000406
+3441.000140 1676.999539 53120.000327
+-9496.000107 -5145.000342 73323.999932
+-13992.999533 -4852.000259 73548.000110
+4287.999970 6968.000328 60833.999686
+275.000199 3746.999653 53612.999629
+-14412.000182 -350.999721 63528.000472
+-13992.999868 -4338.000196 73547.999622
+-8543.000347 -4259.000087 73100.000032
+16.999876 5240.000063 53479.999960
+-14372.999770 -9301.999508 65786.000118
+-5127.000314 8129.000114 72980.999503
+-1394.000093 -4227.999771 72560.000486
+4098.999711 3673.000482 55719.999928
+3946.000083 -1523.000092 54342.999694
+4724.000061 -1246.000449 72200.000281
+-13720.999502 -5353.000086 73556.000360
+4723.999887 7215.000403 72200.000242
+-14184.999932 -2754.999701 67936.999780
+1437.000194 -5630.999670 72380.000099
+-5444.999665 -9188.000372 72930.000378
+-4238.000442 -8500.999822 72740.000263
+-8542.999594 4307.000192 73099.999910
+-5388.000269 6574.999714 72920.000493
+-1394.000324 -2811.000366 72559.999570
+16.999584 16.999963 53479.999782
+-14327.000037 -2687.000254 67063.000303
+-1027.000347 6284.999698 53480.000414
+2850.999763 -5631.000213 72380.000333
+-14543.999669 -8982.999787 62170.000241
+-1426.999789 563.000156 53743.999616
+-5127.000214 -2474.000449 72980.999585
+-8542.999689 5734.999797 73100.000259
+-13993.000354 -8958.999738 73548.000223
+1057.999632 3139.999725 53299.999575
+7056.999573 1429.999852 72020.000196
+-13412.999816 -2989.999795 73597.999993
+-14411.999793 5963.000061 63527.999980
+-14544.000399 3487.000172 62169.999836
+4723.999840 869.999743 72200.000174
+1940.999817 5742.999710 53447.999666
+-14411.999874 7365.999941 63528.000371
+3441.000223 5827.000153 53120.000059
+1941.000349 1579.000153 53447.999990
+4723.999767 5099.999678 72199.999767
+-5444.999773 -6354.000185 72929.999902
+-11526.999785 -8253.000306 73393.000090
+4287.999859 5853.000374 60833.999882
+-3538.999732 -3449.999625 72742.999793
+-13993.000364 -7932.000020 73548.000260
+-14373.000228 -3563.000378 65785.999768
+4253.999995 -7026.999870 72200.000060
+-3164.999721 -539.000085 53841.000259
+3940.999621 -1165.000187 53351.000040
+4251.999655 -1611.999954 58826.000287
+3130.000441 1055.000205 53119.999800
+-7114.999827 -7115.000264 73100.000269
+-5388.000004 5151.000233 72919.999833
+-14543.999690 -4825.999812 62169.999558
+-3929.999555 6411.000130 53659.999733
+1940.999639 4702.000362 53447.999846
+-14411.999716 2454.999607 63527.999612
+3440.999501 -915.999922 53119.999778
+4288.000012 -1950.999731 60833.999534
+275.000261 1616.000437 53612.999949
+-1427.000136 -527.000171 53743.999568
+4251.999503 -525.000281 58825.999809
+-260.999615 -1966.999943 53479.999718
+7057.000208 -5603.000018 72020.000259
+-5127.000479 6715.000320 72980.999619
+-1427.000327 3834.000257 53744.000353
+3440.999911 6346.000423 53120.000030
+2850.999822 -7045.000455 72380.000243
+5664.000435 -1386.999766 72200.000059
+-14412.000002 3156.999581 63527.999801
+-8543.000189 -7115.000435 73099.999877
+3445.999629 2566.999931 53380.000265
+3440.999872 -1434.999562 53119.999546
+-3165.000457 5035.000031 53841.000213
+-3929.999582 2218.000457 53659.999557
+3445.999965 -1512.999532 53379.999504
+-1958.000338 -1957.000101 53738.999698
+275.000452 -1581.000215 53613.000308
+-14088.000048 -2934.999842 70989.999715
+-14373.000177 -4997.999695 65786.000128
+8462.999777 5649.999794 72019.999678
+1058.000275 6263.000038 53300.000358
+-7102.000019 -2619.000327 73101.999718
+-8542.999951 -5687.000307 73099.999616
+-3930.000250 2741.999930 53660.000203
+1300.999742 -1960.999792 53299.999640
+4723.999966 4394.999535 72200.000035
+4098.999994 1583.999527 55720.000241
+-13992.999829 -8445.999614 73548.000422
+4098.999861 -1548.999788 55719.999858
+-3930.000368 -1449.999960 53660.000492
+4287.999872 3066.000210 60833.999876
+4287.999522 2508.000016 60833.999841
+-5445.000250 -3519.000073 72930.000344
+-14232.999547 -8002.000380 67645.000212
+-5126.999777 -1767.000240 72980.999857
+3129.999543 5204.999843 53119.999708
+3946.000005 530.999826 54343.000175
+-13721.000221 -3816.000216 73556.000357
+8463.000349 22.999637 72020.000002
+4724.000003 3690.000471 72200.000108
+1058.000380 4180.999601 53300.000207
+274.999810 5879.000134 53613.000459
+354.000245 -2715.999978 72560.000238
+1437.000165 -4217.000476 72380.000479
+3940.999844 4913.000151 53350.999582
+-2895.000382 -1945.000376 53846.999541
+2099.000389 2099.000230 53300.000474
+8463.000426 1430.000487 72020.000078
+4252.000374 561.000004 58826.000032
+3940.999558 523.000164 53351.000416
+1437.000253 -2804.000496 72380.000323
+-14543.999762 -3440.999829 62169.999916
+-14543.999982 -6211.999551 62170.000041
+3441.000291 2714.999685 53119.999987
+5663.999985 -2797.000025 72200.000024
+-14411.999984 -1051.999942 63528.000370
+3440.999562 4271.000407 53120.000029
+-3539.000186 2107.000409 72743.000388
+1057.999822 -1024.000255 53300.000171
+3945.999666 5664.999689 54342.999562
+-5126.999539 5301.000010 72981.000462
+-14575.999627 -3379.999597 60411.999811
+3180.999744 -2710.000374 72380.000052
+-1026.999719 4195.999827 53480.000234
+-3165.000176 575.999615 53840.999507
+3941.000445 -151.999807 53351.000391
+-14576.000174 -657.999845 60411.999636
+-2349.999962 -1966.999590 53479.999902
+-14411.999854 3858.999681 63528.000283
+-10090.000319 -2795.000040 73260.999652
+3941.000477 5924.999710 53350.999731
+4085.000468 -1954.000357 55213.000428
+4253.999936 -8436.999819 72199.999776
+-1394.000360 -8479.999946 72559.999636
+-3569.999726 -841.000285 53953.999993
+-9083.999507 -2718.999761 73217.000072
+3441.000399 640.000398 53120.000050
+4287.999748 -1394.000023 60833.999874
+5664.000340 7073.999686 72199.999963
+-5387.999666 4438.999817 72919.999562
+7056.999636 -7010.000061 72019.999662
+1057.999689 5222.000173 53299.999663
+-5673.000248 4296.000142 72920.000031
+-1027.000260 5239.999713 53480.000273
+-7114.999766 -8543.000300 73100.000022
+274.999590 551.000141 53612.999775
+-3929.999711 -926.000493 53660.000132
+4288.000365 -836.000403 60833.999756
+3446.000332 3586.999913 53379.999531
+3887.999686 -2709.999801 72379.999876
+-3539.000418 -670.999562 72742.999614
+4251.999963 1648.000235 58826.000350
+7056.999875 -1382.999580 72019.999867
+-11526.999831 -9757.999777 73393.000349
+3130.000328 4167.000247 53120.000320
+8463.000402 2837.000196 72020.000275
+3446.000436 -493.000175 53380.000405
+-1427.000357 6013.999828 53744.000254
+-13993.000352 -5365.000211 73547.999983
+3130.000064 6241.999698 53120.000243
+-1393.999680 -7061.999503 72559.999762
+-3929.999947 3266.000354 53660.000396
+-5388.000052 8711.000308 72919.999522
+-5387.999641 5862.999935 72920.000126
+-5673.000220 24.000330 72919.999842
+4160.000111 -514.999580 57257.999620
+3445.999928 527.000347 53379.999914
+-8542.999580 7162.000367 73099.999863
+2947.999993 -1968.000009 53405.999963
+-3929.999592 -1974.000291 53659.999860
+-1305.999625 -1967.000077 53480.000398
+3129.999665 3130.000305 53119.999882
+-4237.999635 -4237.999904 72739.999541
+7057.000491 4243.000297 72019.999582
+-14576.000246 -6102.000206 60411.999747
+4264.000083 2796.999726 60563.999829
+4724.000254 5805.000459 72199.999985
+-5672.999808 -7097.000478 72920.000322
+-7114.999930 1452.000036 73099.999694
+-3929.999839 4313.999708 53660.000336
+-13971.000086 -5267.000118 71592.999574
+-3164.999892 1691.000266 53840.999559
+3941.000485 1198.999988 53351.000119
+-2071.999680 1062.000046 53480.000119
+-3930.000107 5362.999664 53659.999659
+-13972.000434 -2989.999797 73073.000355
+-5387.999734 1589.999640 72920.000470
+-14575.999747 6147.000157 60412.000152
+-3539.000484 4885.000479 72743.000415
+-8543.000350 23.999745 73100.000201
+4159.999933 5878.999799 57258.000196
+-5444.999733 -7771.000335 72929.999842
+-14372.999532 -6432.999688 65786.000443
+3941.000032 5250.000483 53350.999566
+-2817.999801 -4237.999840 72739.999681
+2099.000054 4180.999939 53300.000374
+3440.999903 121.000021 53120.000493
+-14575.999797 -4741.000478 60411.999775
+3940.999685 1535.999624 53351.000429
+-14576.000473 702.999598 60412.000428
+-14475.999775 -4911.999679 63960.999993
+-14131.000326 -2857.999672 69963.000289
+2099.000221 -1024.000206 53299.999555
+-3539.000177 -4839.000490 72742.999973
+-5672.999696 -4248.999669 72919.999901
+1057.999780 16.999883 53300.000257
+5663.999977 5663.999867 72199.999515
+5663.999992 -8436.999738 72200.000314
+-14412.000335 8068.000149 63527.999665
+-5388.000218 -545.999702 72919.999648
+4264.000448 3907.999781 60564.000285
+3129.999620 2092.000354 53120.000415
+1062.999967 -2715.999634 72560.000024
+3940.999708 -1840.000490 53351.000006
+23.999785 -4227.999646 72560.000090
+-3165.000129 -1654.000323 53840.999660
+-5127.000159 2474.000343 72981.000044
+3941.000234 2210.999659 53351.000276
+1436.999565 -7045.000204 72380.000395
+-1426.999662 1654.000050 53744.000497
+4159.999762 -1580.999657 57257.999765
+2099.000277 6263.000009 53300.000166
+-14233.000173 -9461.999637 67644.999640
+4724.000132 6510.000452 72199.999686
+-5388.000295 3014.999741 72919.999528
+4107.000341 -1973.999932 55973.999842
+-1027.000486 1061.999561 53480.000336
+4263.999763 5018.999546 60563.999509
+-3126.999968 6305.999575 53660.000329
+-1062.999814 -2715.999805 72559.999701
+3441.000092 -398.000054 53119.999576
+23.999882 -5645.000302 72559.999942
+-5126.999834 4594.000338 72980.999829
+4252.000254 4907.999952 58825.999554
+-3569.999712 4767.999673 53953.999940
+-14476.000032 -9143.000078 63960.999819
+4071.000131 -1967.999892 54460.000432
+3440.999875 3752.000283 53120.000467
+-14576.000485 3424.999842 60411.999944
+-5160.999508 -2520.999928 72949.000110
+4287.999692 3622.999957 60834.000077
+-5127.000118 1767.000066 72980.999700
+5663.999655 24.000344 72200.000194
+-14576.000480 7508.000120 60411.999689
+-2881.999956 -1974.000116 53659.999591
+3129.999776 16.999790 53119.999905
+-13993.000072 -5879.000105 73548.000170
+4723.999855 -2656.000037 72200.000312
+3940.999633 4574.999653 53351.000095
+17.000159 3150.999751 53479.999993
+-13721.000066 -6890.000008 73555.999864
+-5673.000136 8569.000239 72919.999812
+4287.999834 1393.999656 60834.000047
+-5127.000002 3181.000499 72980.999577
+1437.000111 -8457.999664 72379.999810
+-1027.000182 3151.000481 53480.000213
+8462.999880 -5602.999786 72020.000397
+5663.999998 -7027.000337 72200.000179
+-2071.999836 5240.000427 53480.000403
+3445.999729 4607.000036 53380.000383
+-1394.000136 -5645.000011 72559.999949
+-3127.000033 2113.999786 53660.000272
+3941.000324 2548.999788 53350.999985
+3940.999570 -1502.000342 53351.000013
+-3126.999914 -1030.999894 53659.999552
+-4238.000253 -2817.999880 72739.999988
+3440.999843 -1953.999504 53120.000421
+259.999737 -1960.999636 53300.000138
+-245.000117 -1948.999943 53618.999915
+-11526.999811 -5243.000037 73392.999756
+4724.000234 165.000038 72199.999547
+-3126.999977 3161.999991 53659.999978
+-3569.999564 4207.000094 53953.999501
+275.000170 -514.999842 53613.000034
+-11526.999613 -6747.999928 73392.999616
+-7390.999730 -5035.000249 73077.999705
+275.000340 4813.000352 53612.999844
+-2071.999948 3150.999602 53480.000403
+4251.999765 2735.000064 58826.000103
+-7115.000351 -5686.999885 73100.000358
+4098.999827 2628.999611 55719.999560
+8463.000124 -7010.000397 72020.000009
+-14232.999615 -6543.000442 67645.000485
+-3930.000232 5887.000299 53659.999634
+-14544.000461 2101.000409 62170.000359
+3372.000265 -1954.000261 53119.999806
+-14412.000115 1754.000439 63527.999500
+-14438.999828 -2520.999738 64242.999578
+-14329.999599 -2661.000068 66073.000238
+1941.000120 -1544.000357 53448.000031
+-4238.000332 -5659.000491 72740.000442
+4098.999594 -505.000192 55720.000025
+-2818.000128 -5658.999652 72739.999655
+4288.000306 -278.999978 60833.999586
+-1026.999893 17.000290 53480.000077
+-7114.999937 2878.999603 73099.999625
+4251.999706 3821.999721 58825.999856
+-14544.000411 -7596.999761 62170.000298
+-3539.000189 6273.999627 72742.999519
+-8542.999929 8590.000255 73100.000232
+-14544.000350 715.999575 62170.000076
+-9495.999848 -9576.000383 73323.999907
+-14576.000232 -7462.000020 60411.999731
+-14184.999642 -9643.999972 69665.000056
+-13970.999811 -8291.000315 71593.000038
+-5126.999814 1060.000113 72981.000052
+-7115.000366 7162.000434 73099.999958
+-3165.000448 6150.000036 53840.999507
+8462.999808 4242.999904 72020.000254
+7057.000202 -2790.000123 72020.000020
+-2071.999832 -1026.999844 53479.999642
+-7114.999518 -1404.000177 73100.000300
+3941.000476 3223.999580 53351.000151
+-3569.999782 1402.000069 53953.999777
+-3570.000289 7012.000244 53953.999930
+-5388.000194 877.999982 72919.999818
+-5126.999702 6008.000102 72980.999919
+4263.999700 6130.999796 60564.000158
+-8543.000290 1452.000226 73100.000426
+2850.999705 -4217.000056 72379.999818
+7056.999509 7057.000433 72019.999792
+-13992.999692 -3312.000439 73548.000061
+2850.999879 -8457.999587 72380.000259
+-3538.999600 718.000352 72742.999931
+-3930.000315 646.000457 53659.999635
+4264.000193 573.999697 60564.000002
+2099.000093 5221.999649 53300.000412
+-2071.999917 6284.999527 53479.999583
+4723.999862 7920.000427 72199.999887
+4330.999705 -1963.000266 59887.000081
+2851.000238 -2803.999644 72380.000218
+3440.999720 2195.999826 53119.999530
+-14543.999739 -2055.000043 62170.000137
+-14544.000178 -669.999739 62170.000308
+-14411.999915 351.000242 63527.999545
+3940.999876 5587.999982 53351.000452
+-11526.999792 -3737.999544 73392.999629
+3940.999584 4236.999929 53351.000136
+-7115.000083 -2831.999613 73099.999909
+-14232.999742 -5082.999812 67645.000324
+-3570.000011 -1963.000243 53954.000457
+-14575.999963 -8822.999905 60411.999771
+-3196.999729 -2722.999629 72739.999728
+4270.999791 -1943.999513 59089.999553
+-3930.000132 -402.000411 53659.999785
+4287.999518 -1951.000148 60834.000344
+1057.999742 2098.999992 53299.999970
+24.000007 -2810.999989 72560.000497
+-3570.000037 -280.000196 53954.000365
+7056.999709 -8415.999536 72020.000349
+7057.000090 5650.000225 72020.000014
+4099.000497 4718.000121 55719.999993
+-7115.000395 24.000272 73099.999724
+-14476.000166 -3502.000326 63961.000485
+-3569.999717 6450.999920 53954.000143
+-1163.000334 -1973.999751 53745.000092
+4723.999824 -541.000100 72200.000243
+3940.999990 3899.999923 53350.999622
+-3127.000218 5257.999652 53659.999673
+8463.000217 -1382.999504 72019.999695
+-14232.999844 -3624.000203 67645.000238
+-7390.999511 -3588.999711 73077.999992
+-5127.000472 352.999759 72981.000130
+2099.000363 16.999945 53300.000261
+-7390.999682 -6480.000469 73077.999642
+-5387.999952 7999.000376 72920.000277
+-3569.999553 2524.000332 53954.000210
+3445.999802 5627.000372 53380.000121
+-8543.000137 2878.999786 73100.000062
+-11225.000154 -2878.000184 73429.000219
+-5444.999752 -4937.000206 72929.999910
+-3539.000116 3495.999641 72743.000028
+4724.000434 -1950.999984 72200.000236
+-5387.999758 7287.000091 72920.000451
+3694.000162 -1947.999707 53364.999539
+-14412.000272 -1753.999800 63528.000480
+4724.000342 8625.000362 72199.999560
+2341.999734 -1961.000092 53299.999848
+-2071.999756 4196.000324 53480.000336
+-8543.000296 -2832.000371 73099.999810
+-5127.000024 8834.999681 72980.999971
+-13992.999602 -3825.000472 73548.000110
+3446.000174 1546.999928 53380.000489
+-3127.000366 4209.999619 53659.999561
+-5387.999685 -1258.000068 72920.000033
+-13720.999529 -8426.000197 73555.999797
+4135.999975 -1958.000343 56742.000312
+1058.000030 1057.999685 53299.999642
+2194.000288 -1954.000142 53438.999837
+1821.999693 -1961.000245 53300.000177
+-2486.000272 -2723.000311 72740.000113
+4251.999519 5994.999969 58825.999706
+-782.999723 -1966.999702 53480.000385
+-14184.999503 -3694.000155 69664.999741
+-7391.000162 -7925.000424 73077.999760
+3941.000365 3562.000286 53350.999697
+-5673.000072 -2824.999976 72920.000076
+-3929.999836 3789.999783 53660.000108
+4288.000033 5295.999782 60834.000285
+8463.000290 -4195.999621 72020.000158
+-1026.999905 2106.000122 53480.000172
+-14544.000315 6258.000031 62169.999860
+2098.999845 3140.000130 53300.000384
+17.000326 2105.999614 53480.000329
+-2817.999707 -2817.999500 72740.000297
+-5127.000216 7421.999889 72980.999545
+-14035.000213 -2961.999816 72026.999857
+3941.000206 -490.000295 53351.000305
+-3127.000000 1065.999857 53660.000041
+-14412.000070 4560.000349 63527.999884
+-1427.000275 -1616.999797 53744.000069
+-6126.000265 -2593.999720 73030.000099
+4099.000391 5762.000184 55719.999589
+3440.999902 1159.000232 53119.999985
+23.999963 -7062.000133 72559.999953
+-3164.999618 3921.000274 53840.999514
+3940.999690 6263.000241 53351.000160
+5663.999668 1434.000202 72199.999998
+3946.000045 -496.000294 54342.999676
+-3538.999923 7662.999718 72742.999936
+3946.000069 1557.999781 54343.000397
+-13992.999519 -7419.000292 73548.000211
+-14576.000246 -2018.999804 60411.999775
+4724.000039 2279.999748 72200.000311
+4253.999732 -5616.999621 72199.999908
+1940.999753 2619.999683 53447.999667
+3441.000116 3234.000032 53120.000379
+-7114.999901 4307.000119 73100.000483
+4288.000399 4738.000285 60834.000007
+4253.999724 -2797.000058 72199.999720
+5664.000222 2843.999541 72200.000437
+7056.999584 8463.000456 72020.000228
+-3930.000418 1694.000154 53659.999991
+-353.999670 -2715.999787 72559.999549
+-14162.999975 -2781.999699 68944.999901
+4287.999827 4180.999517 60834.000197
+-2071.999586 2105.999678 53480.000453
+-7390.999953 -9370.000271 73077.999510
+8462.999606 7057.000057 72020.000254
+7056.999555 2837.000361 72019.999548
+-7114.999806 8589.999936 73100.000030
+-5126.999903 -1060.000339 72980.999664
+8463.000265 -8415.999563 72019.999761
+-14475.999815 -7732.000263 63960.999905
+-14411.999736 -2454.999933 63528.000161
+4253.999680 -4207.000000 72200.000403
+-5341.000241 -2729.999555 72920.000190
+2853.000367 -1953.999662 53119.999629
+-3406.000346 -1973.999690 53659.999516
+-1775.999547 -2723.000080 72740.000246
+4217.999913 -1960.999660 58299.999623
+-12252.999887 -2905.000019 73451.999641
+-8542.999786 -1404.000473 73099.999728
+-3126.999630 16.999618 53660.000475
+4159.999910 1615.999982 57258.000198
+-2818.000192 -8501.000061 72739.999578
+-5673.000319 -5673.000048 72919.999599
+-5126.999657 -352.999916 72981.000008
+-14543.999526 4873.000287 62170.000355
+5664.000113 -5617.000339 72200.000484
+-13992.999970 -6905.000388 73548.000167
+-3906.999574 -2723.000211 72740.000342
+-5672.999570 -1399.999715 72920.000026
+-3569.999982 5890.000467 53954.000331
+4288.000173 6409.999525 60833.999858
+-5387.999815 -2682.000374 72920.000431
+-13971.000415 -3755.000354 71592.999978
+-3930.000128 1170.000156 53659.999938
+-1828.000158 -1966.999726 53479.999657
+17.000335 4196.000427 53479.999613
+-1427.000066 4924.000037 53743.999863
+-13721.000451 -9963.000322 73555.999557
+-5388.000021 3727.000164 72919.999832
+1941.000051 538.000495 53448.000163
+4287.999864 836.000460 60833.999839
+780.999670 -1960.999553 53299.999658
+-5673.000397 7144.999809 72919.999807
+-5673.000146 2871.999537 72920.000249
+533.000383 -1965.000046 53607.999748
+-13992.999662 -9985.999679 73548.000146
+4582.999714 -2702.999761 72199.999726
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/fin b/Alpha_shapes_3/demo/Alpha_shapes_3/data/fin
new file mode 100644
index 000000000000..7b20bc03c7fc
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/fin
@@ -0,0 +1,8 @@
+7
+5.51274721097227705 8.87625776353026552 1.95944807904169238
+9.0973375091665627 3.5350701520269201 4.7238755547204434
+0.911806739546155987 6.95856700036594145 2.36699662526417143
+5.36336900378107373 1.05840486239320186 1.22179856797203001
+0.289239615689291796 9.24621240074391082 2.17110435171762095
+1.39772879354093327 3.51084799856703622 9.44541630320511771
+7.31227573940480369 2.67306741439382023 0.511378392640958745
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/fout b/Alpha_shapes_3/demo/Alpha_shapes_3/data/fout
new file mode 100644
index 000000000000..016012bd00cc
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/fout
@@ -0,0 +1,17 @@
+5.51275 8.87626 1.95945
+0.911807 6.95857 2.367
+5.36337 1.0584 1.2218
+7.31228 2.67307 0.511378
+9.09734 3.53507 4.72388
+1.39773 3.51085 9.44542
+0.28924 9.24621 2.1711
+4 5 0
+5 6 0
+1 0 6
+3 2 4
+4 0 3
+2 3 1
+0 1 3
+2 5 4
+5 2 1
+6 5 1
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/head_ran.pts b/Alpha_shapes_3/demo/Alpha_shapes_3/data/head_ran.pts
new file mode 100644
index 000000000000..c9cacabc3ff2
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/head_ran.pts
@@ -0,0 +1,857 @@
+856
+304.000000 483.000000 110.000433
+173.000000 315.000000 150.000135
+389.000000 259.000000 110.000009
+197.000000 341.000000 130.000097
+390.000000 329.000000 69.999907
+87.000000 189.000000 119.999588
+427.000000 391.000000 19.999914
+219.000000 283.000000 159.999587
+228.000000 410.000000 149.999687
+176.000000 356.000000 150.000143
+36.000000 243.000000 40.000174
+409.000000 409.000000 9.999581
+345.000000 395.000000 130.000241
+378.000000 336.000000 79.999859
+405.000000 442.000000 29.999878
+437.000000 388.000000 20.000099
+385.000000 345.000000 90.000418
+223.000000 509.000000 10.000330
+253.000000 62.000000 10.000304
+339.000000 498.000000 40.000232
+418.000000 406.000000 20.000279
+203.000000 86.000000 99.999776
+96.000000 159.000000 120.000081
+390.000000 320.000000 69.999762
+344.000000 362.000000 139.999772
+157.000000 57.000000 -0.000304
+130.000000 480.000000 40.000064
+190.000000 294.000000 160.000245
+407.000000 398.000000 30.000234
+396.000000 436.000000 40.000360
+387.000000 332.000000 49.999562
+192.000000 317.000000 149.999693
+90.000000 134.000000 99.999822
+92.000000 252.000000 130.000028
+164.000000 251.000000 159.999649
+161.000000 448.000000 120.000467
+380.000000 453.000000 50.000039
+76.000000 423.000000 39.999921
+410.000000 176.000000 40.000464
+346.000000 238.000000 140.000280
+278.000000 464.000000 130.000458
+318.000000 464.000000 110.000374
+421.000000 273.000000 39.999857
+320.000000 85.000000 9.999990
+230.000000 60.000000 40.000167
+403.000000 443.000000 9.999941
+377.000000 278.000000 129.999965
+211.000000 75.000000 79.999614
+396.000000 451.000000 19.999695
+379.000000 323.000000 100.000100
+138.000000 162.000000 149.999904
+373.000000 359.000000 119.999709
+298.000000 154.000000 140.000005
+377.000000 481.000000 19.999977
+405.000000 280.000000 99.999667
+412.000000 329.000000 20.000329
+392.000000 320.000000 80.000343
+155.000000 323.000000 159.999924
+171.000000 323.000000 149.999700
+70.000000 369.000000 60.000396
+270.000000 512.000000 100.000031
+62.000000 359.000000 10.000338
+401.000000 300.000000 49.999758
+366.000000 156.000000 99.999742
+125.000000 289.000000 150.000344
+306.000000 417.000000 140.000297
+189.000000 303.000000 160.000009
+215.000000 339.000000 140.000396
+346.000000 349.000000 139.999537
+73.000000 365.000000 69.999577
+127.000000 77.000000 70.000150
+108.000000 80.000000 9.999701
+416.000000 396.000000 29.999763
+355.000000 471.000000 70.000335
+383.000000 332.000000 79.999789
+279.000000 495.000000 109.999962
+182.000000 392.000000 139.999695
+418.000000 194.000000 20.000169
+399.000000 396.000000 49.999602
+323.000000 406.000000 139.999632
+401.000000 296.000000 70.000372
+116.000000 94.000000 90.000421
+408.000000 302.000000 39.999870
+398.000000 444.000000 39.999970
+391.000000 316.000000 59.999679
+34.000000 233.000000 29.999582
+406.000000 412.000000 20.000116
+75.000000 278.000000 109.999973
+36.000000 251.000000 19.999539
+387.000000 142.000000 -0.000290
+415.000000 231.000000 60.000112
+114.000000 84.000000 59.999969
+176.000000 309.000000 159.999733
+104.000000 469.000000 79.999782
+134.000000 80.000000 80.000475
+365.000000 453.000000 60.000166
+76.000000 325.000000 100.000301
+372.000000 346.000000 120.000425
+384.000000 160.000000 79.999710
+352.000000 318.000000 129.999934
+385.000000 317.000000 40.000493
+381.000000 319.000000 110.000497
+103.000000 84.000000 19.999857
+400.000000 406.000000 40.000279
+354.000000 491.000000 60.000459
+419.000000 282.000000 10.000487
+203.000000 507.000000 60.000487
+235.000000 510.000000 89.999674
+444.000000 387.000000 29.999811
+391.000000 313.000000 99.999893
+398.000000 450.000000 9.999883
+131.000000 300.000000 150.000225
+83.000000 110.000000 40.000016
+187.000000 503.000000 -0.000434
+155.000000 323.000000 150.000140
+212.000000 54.000000 19.999945
+97.000000 291.000000 129.999725
+148.000000 308.000000 149.999883
+343.000000 211.000000 139.999546
+198.000000 328.000000 120.000389
+431.000000 405.000000 19.999725
+400.000000 300.000000 89.999605
+400.000000 184.000000 80.000122
+362.000000 340.000000 129.999568
+347.000000 272.000000 140.000053
+104.000000 251.000000 140.000464
+71.000000 131.000000 59.999648
+110.000000 94.000000 79.999923
+374.000000 479.000000 40.000239
+372.000000 328.000000 99.999759
+374.000000 456.000000 49.999600
+217.000000 466.000000 129.999695
+207.000000 340.000000 119.999813
+394.000000 298.000000 109.999600
+398.000000 158.000000 20.000463
+376.000000 422.000000 69.999535
+419.000000 204.000000 39.999848
+397.000000 425.000000 39.999772
+425.000000 394.000000 -0.000166
+395.000000 469.000000 0.000180
+203.000000 347.000000 130.000090
+175.000000 356.000000 159.999756
+337.000000 482.000000 79.999700
+403.000000 290.000000 100.000395
+384.000000 441.000000 59.999825
+103.000000 268.000000 139.999921
+88.000000 158.000000 110.000417
+420.000000 264.000000 49.999543
+394.000000 309.000000 59.999763
+403.000000 385.000000 49.999907
+398.000000 274.000000 109.999683
+398.000000 396.000000 30.000477
+188.000000 376.000000 149.999695
+251.000000 467.000000 129.999727
+410.000000 173.000000 -0.000375
+419.000000 388.000000 30.000459
+53.000000 178.000000 70.000064
+386.000000 456.000000 29.999720
+230.000000 432.000000 139.999657
+209.000000 102.000000 119.999952
+399.000000 261.000000 100.000481
+34.000000 263.000000 9.999982
+387.000000 185.000000 100.000227
+166.000000 200.000000 160.000091
+397.000000 459.000000 10.000459
+112.000000 355.000000 119.999623
+151.000000 416.000000 119.999934
+387.000000 396.000000 70.000126
+414.000000 205.000000 59.999887
+84.000000 431.000000 49.999623
+54.000000 333.000000 40.000151
+226.000000 489.000000 120.000098
+210.000000 331.000000 139.999959
+62.000000 355.000000 59.999599
+128.000000 201.000000 149.999744
+399.000000 310.000000 40.000499
+285.000000 137.000000 129.999978
+271.000000 90.000000 79.999948
+392.000000 406.000000 39.999814
+126.000000 71.000000 19.999775
+395.000000 316.000000 69.999631
+196.000000 340.000000 140.000123
+172.000000 101.000000 119.999703
+386.000000 386.000000 20.000299
+412.000000 373.000000 20.000375
+368.000000 337.000000 119.999973
+192.000000 56.000000 29.999926
+326.000000 425.000000 129.999868
+328.000000 124.000000 100.000456
+419.000000 252.000000 60.000317
+101.000000 187.000000 130.000292
+282.000000 510.000000 40.000476
+48.000000 169.000000 19.999612
+368.000000 263.000000 130.000181
+106.000000 86.000000 40.000336
+137.000000 485.000000 60.000020
+337.000000 498.000000 10.000284
+179.000000 390.000000 149.999695
+57.000000 165.000000 60.000363
+370.000000 319.000000 119.999686
+159.000000 305.000000 159.999920
+380.000000 410.000000 69.999540
+66.000000 161.000000 80.000411
+211.000000 325.000000 120.000116
+207.000000 322.000000 110.000247
+136.000000 139.000000 139.999844
+425.000000 364.000000 0.000175
+46.000000 181.000000 50.000130
+407.000000 374.000000 39.999586
+410.000000 170.000000 9.999842
+416.000000 288.000000 40.000290
+301.000000 198.000000 149.999552
+368.000000 431.000000 79.999967
+95.000000 115.000000 89.999527
+190.000000 504.000000 40.000392
+431.000000 381.000000 39.999951
+389.000000 385.000000 60.000331
+111.000000 236.000000 139.999941
+305.000000 86.000000 49.999887
+174.000000 344.000000 150.000400
+406.000000 290.000000 79.999632
+411.000000 176.000000 30.000029
+403.000000 401.000000 0.000395
+186.000000 371.000000 149.999597
+396.000000 378.000000 19.999972
+407.000000 393.000000 50.000248
+314.000000 84.000000 30.000111
+82.000000 442.000000 40.000237
+190.000000 63.000000 59.999546
+418.000000 280.000000 50.000063
+107.000000 109.000000 99.999534
+429.000000 377.000000 20.000148
+241.000000 399.000000 149.999519
+231.000000 480.000000 119.999633
+293.000000 494.000000 110.000320
+386.000000 395.000000 50.000398
+189.000000 304.000000 150.000129
+359.000000 426.000000 100.000239
+404.000000 445.000000 20.000042
+390.000000 362.000000 60.000269
+255.000000 393.000000 149.999647
+266.000000 511.000000 60.000270
+445.000000 377.000000 19.999922
+238.000000 512.000000 80.000183
+263.000000 74.000000 60.000051
+345.000000 327.000000 130.000341
+297.000000 510.000000 69.999558
+204.000000 336.000000 110.000464
+93.000000 273.000000 130.000439
+156.000000 143.000000 149.999849
+214.000000 414.000000 150.000013
+208.000000 475.000000 130.000315
+174.000000 350.000000 149.999545
+406.000000 179.000000 59.999608
+397.000000 418.000000 39.999645
+197.000000 340.000000 109.999887
+305.000000 95.000000 70.000078
+223.000000 451.000000 130.000063
+67.000000 291.000000 99.999993
+374.000000 461.000000 59.999831
+395.000000 317.000000 89.999780
+140.000000 482.000000 100.000201
+364.000000 361.000000 129.999692
+396.000000 462.000000 0.000002
+403.000000 421.000000 10.000436
+373.000000 174.000000 109.999736
+393.000000 458.000000 19.999949
+379.000000 456.000000 39.999971
+396.000000 240.000000 100.000184
+71.000000 118.000000 20.000391
+364.000000 427.000000 90.000438
+390.000000 440.000000 49.999887
+44.000000 183.000000 0.000039
+75.000000 348.000000 90.000315
+405.000000 315.000000 0.000238
+320.000000 96.000000 60.000082
+85.000000 447.000000 50.000024
+391.000000 313.000000 40.000474
+303.000000 506.000000 29.999976
+346.000000 147.000000 110.000432
+203.000000 323.000000 120.000169
+185.000000 502.000000 90.000110
+135.000000 94.000000 100.000385
+385.000000 326.000000 99.999934
+388.000000 474.000000 39.999867
+43.000000 221.000000 70.000067
+415.000000 267.000000 79.999572
+401.000000 300.000000 80.000252
+54.000000 190.000000 79.999547
+388.000000 414.000000 49.999501
+400.000000 435.000000 29.999929
+179.000000 325.000000 149.999681
+390.000000 475.000000 20.000480
+210.000000 329.000000 110.000432
+124.000000 264.000000 149.999656
+380.000000 357.000000 110.000447
+35.000000 221.000000 0.000130
+422.000000 256.000000 -0.000478
+297.000000 502.000000 100.000074
+387.000000 404.000000 40.000484
+121.000000 142.000000 129.999588
+363.000000 488.000000 49.999644
+81.000000 441.000000 -0.000224
+310.000000 125.000000 110.000381
+202.000000 330.000000 129.999580
+154.000000 79.000000 90.000488
+349.000000 281.000000 139.999939
+266.000000 452.000000 139.999876
+419.000000 273.000000 60.000253
+60.000000 291.000000 90.000373
+53.000000 160.000000 30.000462
+401.000000 327.000000 29.999868
+388.000000 333.000000 90.000054
+409.000000 393.000000 39.999876
+329.000000 501.000000 19.999774
+66.000000 203.000000 99.999570
+84.000000 101.000000 0.000252
+378.000000 372.000000 110.000496
+177.000000 378.000000 160.000055
+378.000000 208.000000 120.000080
+39.000000 260.000000 49.999598
+113.000000 439.000000 90.000322
+386.000000 404.000000 50.000352
+88.000000 335.000000 110.000457
+408.000000 239.000000 80.000309
+385.000000 339.000000 79.999563
+65.000000 359.000000 -0.000186
+388.000000 339.000000 70.000118
+194.000000 479.000000 130.000054
+205.000000 359.000000 150.000249
+308.000000 366.000000 149.999771
+411.000000 305.000000 9.999644
+336.000000 473.000000 90.000141
+107.000000 380.000000 100.000196
+413.000000 210.000000 69.999762
+417.000000 191.000000 9.999593
+422.000000 243.000000 30.000485
+290.000000 76.000000 39.999602
+387.000000 321.000000 99.999700
+107.000000 439.000000 79.999777
+240.000000 254.000000 160.000437
+422.000000 265.000000 9.999794
+49.000000 243.000000 79.999624
+396.000000 392.000000 29.999964
+69.000000 389.000000 9.999977
+393.000000 327.000000 79.999595
+383.000000 337.000000 90.000313
+124.000000 155.000000 139.999884
+390.000000 328.000000 89.999610
+388.000000 310.000000 109.999974
+401.000000 437.000000 20.000420
+181.000000 305.000000 149.999817
+122.000000 121.000000 119.999998
+81.000000 441.000000 20.000065
+107.000000 303.000000 129.999801
+51.000000 295.000000 60.000192
+97.000000 458.000000 70.000150
+112.000000 293.000000 140.000309
+392.000000 147.000000 29.999844
+395.000000 458.000000 -0.000345
+396.000000 471.000000 20.000089
+205.000000 445.000000 139.999722
+392.000000 425.000000 49.999927
+407.000000 291.000000 60.000455
+364.000000 329.000000 109.999573
+334.000000 449.000000 110.000287
+377.000000 296.000000 129.999513
+202.000000 396.000000 149.999929
+68.000000 386.000000 19.999990
+376.000000 332.000000 89.999690
+442.000000 399.000000 20.000326
+388.000000 295.000000 120.000295
+387.000000 341.000000 50.000408
+112.000000 81.000000 49.999621
+410.000000 386.000000 50.000226
+59.000000 311.000000 80.000359
+330.000000 499.000000 80.000308
+199.000000 332.000000 110.000351
+202.000000 332.000000 140.000116
+38.000000 196.000000 30.000366
+206.000000 407.000000 150.000108
+385.000000 458.000000 39.999801
+178.000000 370.000000 150.000203
+74.000000 419.000000 10.000074
+417.000000 405.000000 29.999702
+47.000000 272.000000 69.999870
+164.000000 373.000000 160.000203
+408.000000 409.000000 29.999548
+376.000000 335.000000 99.999615
+399.000000 396.000000 19.999683
+334.000000 491.000000 79.999633
+379.000000 478.000000 -0.000167
+303.000000 471.000000 120.000457
+291.000000 478.000000 120.000436
+400.000000 433.000000 0.000031
+90.000000 450.000000 59.999865
+319.000000 291.000000 150.000192
+33.000000 256.000000 20.000497
+445.000000 393.000000 10.000151
+341.000000 497.000000 69.999978
+390.000000 240.000000 110.000036
+276.000000 69.000000 19.999504
+173.000000 57.000000 40.000059
+209.000000 359.000000 139.999774
+387.000000 392.000000 20.000481
+318.000000 503.000000 89.999523
+378.000000 478.000000 39.999991
+84.000000 285.000000 119.999551
+337.000000 335.000000 140.000134
+117.000000 372.000000 109.999629
+359.000000 458.000000 79.999820
+146.000000 67.000000 60.000076
+377.000000 406.000000 90.000477
+381.000000 316.000000 109.999684
+48.000000 183.000000 60.000220
+302.000000 452.000000 130.000413
+138.000000 100.000000 109.999758
+268.000000 511.000000 20.000319
+210.000000 324.000000 109.999505
+331.000000 180.000000 139.999527
+354.000000 422.000000 109.999787
+287.000000 509.000000 80.000157
+217.000000 437.000000 139.999915
+348.000000 294.000000 139.999826
+145.000000 109.000000 119.999748
+86.000000 413.000000 69.999800
+407.000000 365.000000 39.999844
+393.000000 458.000000 29.999694
+180.000000 409.000000 139.999597
+79.000000 429.000000 0.000369
+385.000000 468.000000 50.000300
+167.000000 68.000000 70.000425
+424.000000 392.000000 40.000496
+334.000000 328.000000 139.999843
+88.000000 115.000000 79.999614
+185.000000 284.000000 160.000326
+178.000000 122.000000 140.000324
+96.000000 434.000000 69.999906
+138.000000 390.000000 119.999927
+379.000000 449.000000 60.000479
+383.000000 360.000000 100.000229
+394.000000 447.000000 40.000372
+429.000000 374.000000 0.000267
+250.000000 447.000000 140.000291
+374.000000 395.000000 99.999977
+421.000000 400.000000 29.999804
+173.000000 498.000000 100.000223
+112.000000 80.000000 29.999608
+397.000000 307.000000 69.999990
+94.000000 95.000000 30.000227
+365.000000 214.000000 130.000457
+69.000000 124.000000 -0.000140
+214.000000 342.000000 129.999922
+378.000000 324.000000 50.000407
+170.000000 92.000000 110.000496
+396.000000 206.000000 99.999936
+385.000000 359.000000 89.999911
+262.000000 483.000000 120.000212
+73.000000 418.000000 0.000094
+263.000000 117.000000 120.000412
+392.000000 469.000000 40.000013
+203.000000 340.000000 120.000411
+206.000000 141.000000 149.999614
+65.000000 250.000000 100.000372
+408.000000 263.000000 89.999711
+356.000000 326.000000 120.000249
+390.000000 318.000000 90.000241
+357.000000 369.000000 129.999641
+200.000000 332.000000 149.999692
+356.000000 314.000000 130.000478
+206.000000 335.000000 150.000105
+388.000000 349.000000 79.999724
+422.000000 361.000000 29.999572
+336.000000 384.000000 139.999898
+371.000000 477.000000 49.999938
+383.000000 332.000000 70.000333
+358.000000 117.000000 49.999606
+228.000000 511.000000 109.999685
+391.000000 449.000000 50.000425
+210.000000 331.000000 130.000294
+414.000000 332.000000 10.000205
+79.000000 429.000000 20.000389
+425.000000 348.000000 19.999522
+188.000000 500.000000 120.000132
+414.000000 395.000000 19.999694
+333.000000 502.000000 0.000474
+163.000000 74.000000 80.000256
+414.000000 352.000000 0.000273
+396.000000 471.000000 29.999511
+161.000000 113.000000 130.000121
+38.000000 271.000000 0.000064
+406.000000 390.000000 29.999509
+255.000000 136.000000 140.000180
+143.000000 362.000000 130.000256
+205.000000 348.000000 149.999703
+370.000000 484.000000 39.999679
+361.000000 394.000000 119.999961
+236.000000 511.000000 69.999764
+161.000000 344.000000 150.000324
+271.000000 99.000000 100.000087
+347.000000 129.000000 90.000352
+383.000000 473.000000 20.000348
+418.000000 261.000000 69.999636
+342.000000 477.000000 80.000249
+240.000000 212.000000 159.999945
+93.000000 387.000000 89.999525
+214.000000 335.000000 130.000266
+434.000000 365.000000 19.999711
+377.000000 248.000000 120.000476
+84.000000 227.000000 120.000431
+391.000000 462.000000 39.999559
+390.000000 473.000000 -0.000072
+442.000000 378.000000 29.999932
+357.000000 126.000000 69.999812
+64.000000 143.000000 49.999661
+339.000000 310.000000 139.999787
+376.000000 446.000000 69.999556
+421.000000 272.000000 29.999579
+383.000000 398.000000 79.999947
+377.000000 339.000000 90.000050
+357.000000 461.000000 70.000494
+381.000000 346.000000 99.999989
+198.000000 335.000000 129.999550
+383.000000 383.000000 89.999876
+392.000000 395.000000 50.000489
+385.000000 318.000000 50.000068
+196.000000 506.000000 109.999506
+183.000000 138.000000 150.000295
+434.000000 396.000000 0.000059
+38.000000 219.000000 50.000182
+390.000000 284.000000 120.000395
+365.000000 347.000000 129.999830
+74.000000 118.000000 30.000426
+207.000000 122.000000 140.000380
+113.000000 116.000000 109.999784
+416.000000 292.000000 30.000362
+414.000000 279.000000 80.000030
+441.000000 386.000000 0.000095
+144.000000 337.000000 139.999525
+386.000000 148.000000 60.000351
+93.000000 409.000000 79.999575
+170.000000 409.000000 129.999719
+104.000000 348.000000 119.999514
+377.000000 416.000000 80.000066
+392.000000 410.000000 40.000224
+322.000000 258.000000 150.000354
+387.000000 142.000000 39.999842
+378.000000 327.000000 109.999670
+403.000000 268.000000 99.999822
+219.000000 183.000000 160.000476
+196.000000 361.000000 150.000187
+436.000000 397.000000 30.000102
+187.000000 334.000000 150.000416
+361.000000 476.000000 60.000302
+265.000000 462.000000 129.999811
+357.000000 334.000000 129.999518
+397.000000 317.000000 80.000196
+201.000000 110.000000 129.999544
+170.000000 292.000000 159.999874
+376.000000 342.000000 110.000096
+288.000000 382.000000 150.000470
+385.000000 328.000000 40.000208
+380.000000 263.000000 120.000184
+279.000000 96.000000 90.000454
+298.000000 508.000000 10.000017
+391.000000 274.000000 119.999504
+80.000000 121.000000 70.000114
+414.000000 240.000000 70.000303
+72.000000 385.000000 50.000489
+312.000000 443.000000 129.999958
+381.000000 307.000000 119.999893
+147.000000 60.000000 29.999771
+233.000000 512.000000 49.999755
+129.000000 479.000000 69.999985
+383.000000 474.000000 -0.000300
+119.000000 474.000000 50.000440
+162.000000 87.000000 99.999822
+388.000000 320.000000 60.000475
+208.000000 92.000000 110.000454
+402.000000 441.000000 -0.000434
+247.000000 61.000000 30.000254
+60.000000 177.000000 89.999508
+375.000000 338.000000 100.000112
+388.000000 475.000000 30.000200
+169.000000 361.000000 150.000305
+73.000000 138.000000 69.999613
+151.000000 130.000000 140.000243
+292.000000 428.000000 139.999652
+43.000000 288.000000 40.000209
+411.000000 196.000000 69.999886
+191.000000 440.000000 139.999870
+188.000000 393.000000 150.000062
+379.000000 331.000000 100.000426
+421.000000 211.000000 10.000373
+151.000000 489.000000 110.000018
+214.000000 501.000000 120.000350
+186.000000 475.000000 130.000205
+119.000000 171.000000 139.999644
+166.000000 495.000000 49.999638
+94.000000 139.000000 110.000263
+361.000000 113.000000 30.000475
+287.000000 462.000000 129.999600
+119.000000 472.000000 0.000324
+336.000000 499.000000 59.999701
+397.000000 309.000000 79.999503
+396.000000 468.000000 9.999539
+418.000000 219.000000 50.000021
+188.000000 53.000000 9.999892
+317.000000 484.000000 99.999771
+87.000000 99.000000 9.999789
+440.000000 400.000000 10.000026
+77.000000 414.000000 50.000086
+59.000000 334.000000 69.999692
+389.000000 473.000000 10.000131
+93.000000 364.000000 99.999586
+191.000000 380.000000 140.000324
+397.000000 463.000000 20.000440
+314.000000 83.000000 -0.000144
+404.000000 252.000000 89.999526
+192.000000 55.000000 0.000057
+37.000000 211.000000 39.999811
+408.000000 337.000000 0.000463
+386.000000 321.000000 50.000145
+57.000000 307.000000 69.999726
+399.000000 434.000000 9.999597
+440.000000 394.000000 0.000167
+194.000000 347.000000 139.999819
+187.000000 359.000000 160.000408
+82.000000 430.000000 30.000265
+292.000000 510.000000 90.000293
+179.000000 291.000000 160.000422
+346.000000 484.000000 69.999785
+433.000000 395.000000 19.999927
+238.000000 463.000000 129.999988
+431.000000 404.000000 10.000165
+125.000000 346.000000 130.000258
+364.000000 483.000000 50.000249
+152.000000 60.000000 10.000471
+412.000000 390.000000 50.000296
+167.000000 492.000000 119.999873
+162.000000 360.000000 140.000440
+76.000000 394.000000 60.000355
+404.000000 389.000000 0.000108
+131.000000 68.000000 10.000393
+79.000000 430.000000 9.999539
+414.000000 282.000000 59.999976
+171.000000 344.000000 160.000494
+140.000000 307.000000 150.000051
+371.000000 276.000000 130.000475
+410.000000 320.000000 9.999772
+399.000000 300.000000 60.000152
+410.000000 275.000000 90.000213
+178.000000 501.000000 69.999844
+396.000000 463.000000 29.999717
+270.000000 511.000000 0.000287
+105.000000 365.000000 110.000111
+36.000000 263.000000 29.999728
+42.000000 269.000000 60.000204
+152.000000 382.000000 129.999554
+139.000000 124.000000 129.999830
+178.000000 499.000000 9.999512
+380.000000 329.000000 60.000364
+195.000000 398.000000 149.999704
+105.000000 138.000000 120.000289
+130.000000 480.000000 19.999848
+241.000000 504.000000 110.000227
+249.000000 61.000000 0.000215
+149.000000 63.000000 50.000394
+435.000000 381.000000 19.999612
+370.000000 120.000000 19.999582
+395.000000 363.000000 50.000173
+390.000000 455.000000 0.000083
+345.000000 465.000000 89.999529
+321.000000 451.000000 120.000069
+232.000000 72.000000 69.999566
+78.000000 441.000000 10.000433
+411.000000 254.000000 79.999644
+349.000000 104.000000 9.999972
+40.000000 224.000000 59.999868
+401.000000 417.000000 30.000379
+55.000000 328.000000 60.000186
+136.000000 66.000000 39.999869
+387.000000 459.000000 19.999694
+238.000000 120.000000 129.999648
+380.000000 232.000000 119.999852
+387.000000 336.000000 59.999680
+386.000000 316.000000 100.000192
+202.000000 323.000000 110.000169
+421.000000 243.000000 39.999865
+378.000000 477.000000 19.999946
+403.000000 407.000000 0.000441
+117.000000 473.000000 10.000461
+388.000000 454.000000 40.000397
+36.000000 209.000000 9.999788
+344.000000 158.000000 120.000283
+167.000000 319.000000 160.000206
+80.000000 432.000000 39.999684
+124.000000 318.000000 139.999804
+379.000000 285.000000 130.000148
+420.000000 205.000000 29.999982
+364.000000 457.000000 60.000173
+314.000000 319.000000 150.000372
+271.000000 387.000000 149.999929
+405.000000 324.000000 -0.000038
+393.000000 305.000000 49.999780
+380.000000 472.000000 50.000100
+392.000000 455.000000 10.000360
+430.000000 366.000000 30.000433
+88.000000 433.000000 60.000203
+400.000000 426.000000 20.000350
+198.000000 506.000000 19.999553
+369.000000 321.000000 109.999993
+389.000000 376.000000 70.000300
+447.000000 391.000000 19.999590
+78.000000 255.000000 120.000420
+201.000000 310.000000 150.000380
+385.000000 330.000000 99.999671
+313.000000 506.000000 50.000090
+398.000000 286.000000 110.000315
+366.000000 325.000000 119.999806
+431.000000 389.000000 39.999680
+71.000000 122.000000 9.999706
+416.000000 393.000000 -0.000388
+339.000000 98.000000 40.000373
+354.000000 120.000000 59.999789
+163.000000 480.000000 119.999792
+209.000000 78.000000 90.000471
+340.000000 454.000000 100.000347
+344.000000 120.000000 79.999566
+34.000000 221.000000 20.000076
+130.000000 440.000000 100.000378
+367.000000 328.000000 100.000402
+372.000000 485.000000 29.999664
+35.000000 247.000000 -0.000266
+230.000000 454.000000 130.000398
+155.000000 314.000000 150.000438
+386.000000 168.000000 89.999942
+423.000000 398.000000 20.000409
+252.000000 68.000000 49.999609
+405.000000 314.000000 30.000086
+78.000000 140.000000 90.000406
+373.000000 453.000000 60.000142
+159.000000 328.000000 150.000142
+74.000000 417.000000 30.000409
+330.000000 91.000000 20.000081
+388.000000 332.000000 80.000109
+385.000000 328.000000 60.000013
+174.000000 447.000000 130.000073
+316.000000 226.000000 149.999931
+393.000000 453.000000 30.000415
+361.000000 321.000000 119.999624
+376.000000 465.000000 60.000467
+366.000000 448.000000 79.999941
+58.000000 346.000000 50.000010
+391.000000 384.000000 50.000228
+162.000000 396.000000 129.999672
+425.000000 378.000000 40.000076
+421.000000 278.000000 -0.000240
+179.000000 381.000000 150.000273
+355.000000 483.000000 60.000125
+82.000000 442.000000 29.999998
+83.000000 108.000000 50.000310
+407.000000 175.000000 49.999596
+74.000000 418.000000 19.999690
+132.000000 415.000000 109.999606
+327.000000 489.000000 90.000109
+408.000000 211.000000 79.999683
+416.000000 201.000000 50.000427
+69.000000 380.000000 40.000280
+235.000000 151.000000 150.000472
+369.000000 307.000000 130.000229
+396.000000 164.000000 70.000265
+308.000000 338.000000 149.999970
+175.000000 330.000000 159.999778
+150.000000 349.000000 139.999937
+421.000000 219.000000 -0.000068
+444.000000 384.000000 9.999661
+407.000000 335.000000 29.999975
+123.000000 480.000000 90.000020
+388.000000 207.000000 110.000124
+190.000000 372.000000 140.000446
+127.000000 482.000000 30.000090
+276.000000 476.000000 120.000370
+413.000000 289.000000 49.999591
+240.000000 510.000000 30.000054
+410.000000 316.000000 20.000107
+354.000000 109.000000 -0.000420
+56.000000 226.000000 90.000305
+55.000000 346.000000 20.000297
+373.000000 329.000000 109.999831
+421.000000 269.000000 20.000125
+417.000000 194.000000 -0.000244
+377.000000 477.000000 10.000096
+311.000000 136.000000 120.000023
+355.000000 326.000000 130.000433
+84.000000 110.000000 60.000454
+202.000000 506.000000 80.000296
+398.000000 392.000000 0.000118
+261.000000 501.000000 110.000266
+386.000000 140.000000 10.000112
+75.000000 210.000000 110.000483
+418.000000 392.000000 39.999772
+47.000000 172.000000 39.999530
+201.000000 61.000000 50.000348
+174.000000 426.000000 129.999769
+406.000000 287.000000 89.999588
+406.000000 294.000000 50.000482
+178.000000 464.000000 129.999690
+379.000000 481.000000 0.000359
+66.000000 135.000000 40.000472
+439.000000 380.000000 -0.000057
+410.000000 300.000000 0.000483
+400.000000 198.000000 90.000463
+396.000000 305.000000 99.999628
+112.000000 327.000000 129.999537
+400.000000 351.000000 39.999731
+285.000000 445.000000 140.000481
+194.000000 345.000000 120.000109
+395.000000 373.000000 49.999714
+417.000000 277.000000 69.999982
+220.000000 511.000000 100.000036
+368.000000 181.000000 119.999800
+330.000000 162.000000 130.000194
+355.000000 188.000000 130.000376
+158.000000 58.000000 20.000298
+402.000000 419.000000 0.000043
+389.000000 147.000000 50.000103
+77.000000 161.000000 99.999915
+99.000000 98.000000 69.999881
+383.000000 472.000000 10.000356
+123.000000 366.000000 120.000131
+109.000000 78.000000 -0.000493
+441.000000 394.000000 29.999848
+118.000000 405.000000 100.000021
+148.000000 454.000000 109.999506
+416.000000 405.000000 10.000422
+214.000000 331.000000 120.000073
+377.000000 481.000000 9.999558
+381.000000 413.000000 59.999620
+400.000000 448.000000 30.000243
+185.000000 358.000000 149.999663
+194.000000 362.000000 139.999629
+184.000000 183.000000 160.000453
+391.000000 348.000000 50.000085
+378.000000 477.000000 30.000336
+314.000000 349.000000 150.000272
+159.000000 302.000000 150.000093
+70.000000 396.000000 29.999689
+186.000000 428.000000 140.000092
+384.000000 460.000000 50.000420
+240.000000 438.000000 139.999721
+384.000000 426.000000 59.999785
+396.000000 389.000000 50.000117
+210.000000 348.000000 139.999537
+46.000000 171.000000 9.999837
+173.000000 498.000000 30.000387
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/skull.pts b/Alpha_shapes_3/demo/Alpha_shapes_3/data/skull.pts
new file mode 100644
index 000000000000..563ef228171a
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/skull.pts
@@ -0,0 +1,27088 @@
+    106.2500    116.5000 -8.0
+    104.5000    117.2500 -8.0
+    102.2500    119.5000 -8.0
+     97.2500    129.5000 -8.0
+     93.5000    139.2500 -8.0
+     93.2500    147.5000 -8.0
+     94.2500    149.5000 -8.0
+     95.2500    155.5000 -8.0
+     99.2500    161.5000 -8.0
+    102.2500    163.5000 -8.0
+    106.5000    163.7500 -8.0
+    110.5000    160.7500 -8.0
+    113.7500    151.5000 -8.0
+    117.5000    143.7500 -8.0
+    118.5000    138.7500 -8.0
+    118.7500    131.5000 -8.0
+    115.7500    120.5000 -8.0
+    112.7500    116.5000 -8.0
+    105.2500    106.5000 -10.0
+    100.5000    108.2500 -10.0
+     96.2500    112.5000 -10.0
+     92.5000    119.2500 -10.0
+     91.2500    125.5000 -10.0
+     87.5000    135.2500 -10.0
+     87.2500    153.5000 -10.0
+     89.2500    159.5000 -10.0
+     89.2500    163.5000 -10.0
+     94.2500    173.5000 -10.0
+     95.5000    173.7500 -10.0
+     97.5000    175.7500 -10.0
+    102.5000    176.7500 -10.0
+    111.5000    173.7500 -10.0
+    114.7500    170.5000 -10.0
+    119.7500    160.5000 -10.0
+    121.7500    151.5000 -10.0
+    123.7500    147.5000 -10.0
+    125.7500    140.5000 -10.0
+    126.7500    133.5000 -10.0
+    125.7500    131.5000 -10.0
+    125.7500    127.5000 -10.0
+    122.7500    116.5000 -10.0
+    118.7500    110.5000 -10.0
+    111.7500    106.5000 -10.0
+    103.2500    100.5000 -12.0
+     97.5000    103.2500 -12.0
+     92.5000    108.2500 -12.0
+     87.2500    117.5000 -12.0
+     85.2500    126.5000 -12.0
+     83.2500    130.5000 -12.0
+     81.5000    139.2500 -12.0
+     81.2500    148.5000 -12.0
+     82.2500    150.5000 -12.0
+     82.2500    155.5000 -12.0
+     83.2500    157.5000 -12.0
+     84.2500    165.5000 -12.0
+     87.2500    175.5000 -12.0
+     93.5000    181.7500 -12.0
+    100.2500    183.5000 -12.0
+    104.5000    183.7500 -12.0
+    115.5000    179.7500 -12.0
+    121.7500    172.5000 -12.0
+    124.7500    166.5000 -12.0
+    127.7500    151.5000 -12.0
+    131.5000    140.7500 -12.0
+    131.7500    127.5000 -12.0
+    130.7500    125.5000 -12.0
+    129.7500    119.5000 -12.0
+    124.7500    109.5000 -12.0
+    119.5000    104.2500 -12.0
+    112.7500    100.5000 -12.0
+    102.2500     95.5000 -14.0
+     96.5000     98.2500 -14.0
+     88.2500    106.5000 -14.0
+     83.2500    114.5000 -14.0
+     77.5000    137.2500 -14.0
+     77.2500    152.5000 -14.0
+     78.2500    154.5000 -14.0
+     78.2500    160.5000 -14.0
+     79.2500    162.5000 -14.0
+     79.2500    167.5000 -14.0
+     83.2500    178.5000 -14.0
+     87.2500    183.5000 -14.0
+     91.5000    186.7500 -14.0
+    103.5000    188.7500 -14.0
+    105.5000    187.7500 -14.0
+    110.5000    187.7500 -14.0
+    118.5000    183.7500 -14.0
+    125.7500    176.5000 -14.0
+    130.5000    168.7500 -14.0
+    132.7500    152.5000 -14.0
+    135.5000    143.7500 -14.0
+    136.7500    129.5000 -14.0
+    135.7500    127.5000 -14.0
+    134.7500    119.5000 -14.0
+    128.7500    107.5000 -14.0
+    121.5000    100.2500 -14.0
+    112.7500     95.5000 -14.0
+    107.7500    123.5000 -14.0
+    108.5000    122.7500 -14.0
+    109.2500    123.5000 -14.0
+    109.2500    133.5000 -14.0
+    110.2500    135.5000 -14.0
+    109.5000    137.2500 -14.0
+    109.2500    142.5000 -14.0
+    110.2500    144.5000 -14.0
+    110.2500    147.5000 -14.0
+    112.2500    151.5000 -14.0
+    112.2500    153.5000 -14.0
+    111.2500    156.5000 -14.0
+    108.5000    160.2500 -14.0
+    106.5000    161.2500 -14.0
+    104.5000    156.2500 -14.0
+    101.5000    157.2500 -14.0
+    100.5000    159.2500 -14.0
+     98.5000    158.2500 -14.0
+     92.7500    153.5000 -14.0
+     92.7500    149.5000 -14.0
+     94.5000    147.7500 -14.0
+     96.5000    146.7500 -14.0
+     94.7500    143.5000 -14.0
+     94.7500    138.5000 -14.0
+     96.7500    136.5000 -14.0
+     99.5000    132.7500 -14.0
+    101.2500    133.5000 -14.0
+    101.2500    136.5000 -14.0
+    103.2500    138.5000 -14.0
+    105.7500    137.5000 -14.0
+    101.2500     91.5000 -16.0
+     95.5000     94.2500 -16.0
+     87.5000    101.2500 -16.0
+     84.2500    105.5000 -16.0
+     78.2500    117.5000 -16.0
+     73.5000    137.2500 -16.0
+     73.2500    153.5000 -16.0
+     74.2500    155.5000 -16.0
+     74.2500    163.5000 -16.0
+     75.2500    165.5000 -16.0
+     75.2500    169.5000 -16.0
+     76.2500    171.5000 -16.0
+     76.2500    173.5000 -16.0
+     81.2500    183.5000 -16.0
+     86.2500    188.5000 -16.0
+     91.2500    191.5000 -16.0
+    100.5000    191.7500 -16.0
+    102.2500    192.5000 -16.0
+    111.7500    192.5000 -16.0
+    118.5000    189.7500 -16.0
+    127.7500    181.5000 -16.0
+    135.7500    168.5000 -16.0
+    140.7500    133.5000 -16.0
+    139.7500    131.5000 -16.0
+    139.7500    124.5000 -16.0
+    138.7500    122.5000 -16.0
+    137.7500    116.5000 -16.0
+    133.7500    107.5000 -16.0
+    126.7500     99.5000 -16.0
+    122.5000     96.2500 -16.0
+    112.7500     91.5000 -16.0
+    105.7500    108.5000 -16.0
+    107.5000    107.7500 -16.0
+    109.2500    110.5000 -16.0
+    115.5000    114.7500 -16.0
+    117.2500    117.5000 -16.0
+    117.2500    120.5000 -16.0
+    115.5000    129.2500 -16.0
+    115.2500    135.5000 -16.0
+    114.2500    137.5000 -16.0
+    115.2500    139.5000 -16.0
+    115.2500    150.5000 -16.0
+    116.2500    152.5000 -16.0
+    115.5000    153.2500 -16.0
+    115.2500    160.5000 -16.0
+    111.5000    171.2500 -16.0
+    102.5000    170.2500 -16.0
+     98.5000    172.2500 -16.0
+     92.7500    169.5000 -16.0
+     92.7500    166.5000 -16.0
+     90.7500    162.5000 -16.0
+     90.7500    159.5000 -16.0
+     89.7500    157.5000 -16.0
+     89.7500    149.5000 -16.0
+     90.5000    147.7500 -16.0
+     90.7500    140.5000 -16.0
+     94.5000    134.7500 -16.0
+     96.5000    126.7500 -16.0
+     96.7500    121.5000 -16.0
+     98.7500    115.5000 -16.0
+    102.5000    112.7500 -16.0
+     93.7500    176.5000 -16.0
+     95.5000    175.7500 -16.0
+     97.2500    177.5000 -16.0
+     96.5000    181.2500 -16.0
+    104.2500     87.5000 -18.0
+    103.5000     88.2500 -18.0
+     99.5000     88.2500 -18.0
+     91.5000     93.2500 -18.0
+     87.5000     96.2500 -18.0
+     81.2500    103.5000 -18.0
+     75.5000    114.2500 -18.0
+     75.2500    116.5000 -18.0
+     74.2500    118.5000 -18.0
+     73.2500    123.5000 -18.0
+     72.5000    125.2500 -18.0
+     71.2500    133.5000 -18.0
+     70.5000    135.2500 -18.0
+     70.2500    160.5000 -18.0
+     71.2500    162.5000 -18.0
+     71.2500    169.5000 -18.0
+     72.2500    171.5000 -18.0
+     72.5000    173.7500 -18.0
+     76.2500    182.5000 -18.0
+     82.2500    189.5000 -18.0
+     86.5000    192.7500 -18.0
+     88.5000    193.7500 -18.0
+     90.2500    194.5000 -18.0
+     95.5000    194.7500 -18.0
+    102.5000    195.7500 -18.0
+    104.2500    196.5000 -18.0
+    111.7500    196.5000 -18.0
+    120.5000    192.7500 -18.0
+    128.5000    186.7500 -18.0
+    134.7500    179.5000 -18.0
+    138.7500    169.5000 -18.0
+    139.5000    167.7500 -18.0
+    139.7500    164.5000 -18.0
+    140.5000    162.7500 -18.0
+    140.7500    157.5000 -18.0
+    141.7500    148.5000 -18.0
+    142.5000    146.7500 -18.0
+    142.7500    140.5000 -18.0
+    143.5000    138.7500 -18.0
+    143.7500    129.5000 -18.0
+    142.7500    127.5000 -18.0
+    142.7500    122.5000 -18.0
+    141.7500    120.5000 -18.0
+    141.7500    117.5000 -18.0
+    139.7500    113.5000 -18.0
+    139.7500    111.5000 -18.0
+    134.7500    103.5000 -18.0
+    131.7500     99.5000 -18.0
+    124.5000     93.2500 -18.0
+    118.5000     90.2500 -18.0
+    114.7500     88.5000 -18.0
+    112.5000     88.2500 -18.0
+    110.7500     87.5000 -18.0
+    104.7500    102.5000 -18.0
+    105.5000    101.7500 -18.0
+    107.2500    102.5000 -18.0
+    108.2500    104.5000 -18.0
+    119.2500    116.5000 -18.0
+    119.2500    122.5000 -18.0
+    120.2500    124.5000 -18.0
+    120.2500    131.5000 -18.0
+    121.2500    134.5000 -18.0
+    120.5000    136.2500 -18.0
+    120.2500    141.5000 -18.0
+    119.5000    143.2500 -18.0
+    119.2500    160.5000 -18.0
+    117.2500    169.5000 -18.0
+    112.5000    176.2500 -18.0
+    109.5000    176.2500 -18.0
+    107.7500    175.5000 -18.0
+    102.5000    175.2500 -18.0
+    100.5000    178.2500 -18.0
+    100.2500    180.5000 -18.0
+     98.5000    184.2500 -18.0
+     94.5000    184.2500 -18.0
+     92.5000    186.2500 -18.0
+     89.5000    186.2500 -18.0
+     86.7500    181.5000 -18.0
+     83.7500    175.5000 -18.0
+     84.7500    173.5000 -18.0
+     87.5000    170.7500 -18.0
+     87.7500    168.5000 -18.0
+     86.7500    166.5000 -18.0
+     86.7500    160.5000 -18.0
+     85.7500    158.5000 -18.0
+     85.7500    156.5000 -18.0
+     86.7500    149.5000 -18.0
+     87.7500    140.5000 -18.0
+     92.7500    130.5000 -18.0
+     93.7500    121.5000 -18.0
+     94.7500    118.5000 -18.0
+     96.5000    114.7500 -18.0
+     98.7500    108.5000 -18.0
+    100.5000    104.7500 -18.0
+    102.2500     84.5000 -20.0
+    101.5000     85.2500 -20.0
+     99.2500     85.5000 -20.0
+     92.5000     88.2500 -20.0
+     87.5000     92.2500 -20.0
+     85.5000     93.2500 -20.0
+     83.2500     95.5000 -20.0
+     80.5000     99.2500 -20.0
+     77.2500    103.5000 -20.0
+     72.2500    113.5000 -20.0
+     70.2500    122.5000 -20.0
+     69.2500    124.5000 -20.0
+     68.2500    133.5000 -20.0
+     67.5000    135.2500 -20.0
+     67.2500    166.5000 -20.0
+     68.2500    168.5000 -20.0
+     68.5000    173.7500 -20.0
+     72.2500    182.5000 -20.0
+     76.2500    187.5000 -20.0
+     77.2500    189.5000 -20.0
+     78.5000    189.7500 -20.0
+     82.2500    193.5000 -20.0
+     86.5000    196.7500 -20.0
+     88.5000    197.7500 -20.0
+     90.2500    198.5000 -20.0
+     99.5000    198.7500 -20.0
+    101.2500    199.5000 -20.0
+    113.5000    199.7500 -20.0
+    118.5000    197.7500 -20.0
+    122.5000    194.7500 -20.0
+    128.7500    191.5000 -20.0
+    137.7500    181.5000 -20.0
+    141.7500    171.5000 -20.0
+    142.5000    169.7500 -20.0
+    142.7500    165.5000 -20.0
+    143.5000    163.7500 -20.0
+    143.7500    158.5000 -20.0
+    144.5000    156.7500 -20.0
+    144.7500    150.5000 -20.0
+    145.5000    148.7500 -20.0
+    145.7500    140.5000 -20.0
+    146.5000    138.7500 -20.0
+    146.7500    130.5000 -20.0
+    145.7500    128.5000 -20.0
+    145.7500    123.5000 -20.0
+    144.7500    121.5000 -20.0
+    144.7500    117.5000 -20.0
+    141.7500    108.5000 -20.0
+    136.7500    100.5000 -20.0
+    135.7500     98.5000 -20.0
+    130.7500     93.5000 -20.0
+    124.5000     89.2500 -20.0
+    118.5000     86.2500 -20.0
+    113.5000     85.2500 -20.0
+    111.7500     84.5000 -20.0
+    103.7500     97.5000 -20.0
+    105.5000     96.7500 -20.0
+    107.2500     98.5000 -20.0
+    109.2500    102.5000 -20.0
+    118.2500    113.5000 -20.0
+    122.2500    120.5000 -20.0
+    122.2500    124.5000 -20.0
+    124.2500    128.5000 -20.0
+    124.2500    131.5000 -20.0
+    126.2500    133.5000 -20.0
+    125.5000    135.2500 -20.0
+    124.2500    154.5000 -20.0
+    119.2500    177.5000 -20.0
+    121.2500    179.5000 -20.0
+    121.2500    184.5000 -20.0
+    117.5000    187.2500 -20.0
+    115.5000    187.2500 -20.0
+    109.5000    184.2500 -20.0
+    105.7500    180.5000 -20.0
+    102.2500    180.5000 -20.0
+    100.2500    184.5000 -20.0
+     96.5000    188.2500 -20.0
+     94.5000    188.2500 -20.0
+     92.5000    189.2500 -20.0
+     89.5000    188.2500 -20.0
+     83.7500    181.5000 -20.0
+     83.7500    179.5000 -20.0
+     82.7500    177.5000 -20.0
+     82.7500    173.5000 -20.0
+     83.5000    171.7500 -20.0
+     82.7500    170.5000 -20.0
+     82.7500    151.5000 -20.0
+     83.5000    149.7500 -20.0
+     83.7500    138.5000 -20.0
+     89.5000    130.7500 -20.0
+     89.7500    125.5000 -20.0
+     93.5000    116.7500 -20.0
+     93.7500    114.5000 -20.0
+     98.7500    104.5000 -20.0
+     99.7500     99.5000 -20.0
+    101.5000     97.7500 -20.0
+    103.2500     81.5000 -22.0
+    102.5000     82.2500 -22.0
+     98.2500     82.5000 -22.0
+     87.5000     87.2500 -22.0
+     81.2500     92.5000 -22.0
+     78.5000     96.2500 -22.0
+     75.2500    100.5000 -22.0
+     69.2500    112.5000 -22.0
+     67.2500    121.5000 -22.0
+     66.2500    126.5000 -22.0
+     65.2500    133.5000 -22.0
+     64.5000    135.2500 -22.0
+     64.2500    142.5000 -22.0
+     63.2500    151.5000 -22.0
+     64.2500    153.5000 -22.0
+     64.2500    169.5000 -22.0
+     65.2500    171.5000 -22.0
+     65.2500    174.5000 -22.0
+     66.5000    177.7500 -22.0
+     69.2500    184.5000 -22.0
+     77.2500    193.5000 -22.0
+     83.2500    198.5000 -22.0
+     88.2500    201.5000 -22.0
+     99.5000    201.7500 -22.0
+    101.2500    202.5000 -22.0
+    114.5000    202.7500 -22.0
+    128.5000    195.7500 -22.0
+    135.5000    189.7500 -22.0
+    138.7500    185.5000 -22.0
+    142.7500    177.5000 -22.0
+    144.5000    173.7500 -22.0
+    144.7500    171.5000 -22.0
+    145.5000    169.7500 -22.0
+    145.7500    165.5000 -22.0
+    146.5000    163.7500 -22.0
+    146.7500    158.5000 -22.0
+    147.5000    156.7500 -22.0
+    147.7500    148.5000 -22.0
+    148.5000    146.7500 -22.0
+    148.7500    125.5000 -22.0
+    147.7500    123.5000 -22.0
+    147.7500    118.5000 -22.0
+    146.7500    116.5000 -22.0
+    146.7500    114.5000 -22.0
+    145.7500    112.5000 -22.0
+    145.7500    110.5000 -22.0
+    139.7500     98.5000 -22.0
+    134.7500     93.5000 -22.0
+    133.7500     91.5000 -22.0
+    132.5000     91.2500 -22.0
+    129.5000     88.2500 -22.0
+    119.5000     83.2500 -22.0
+    114.5000     82.2500 -22.0
+    112.7500     81.5000 -22.0
+    101.7500     93.5000 -22.0
+    102.5000     92.7500 -22.0
+    105.5000     92.7500 -22.0
+    108.2500     95.5000 -22.0
+    108.2500     97.5000 -22.0
+    111.2500    103.5000 -22.0
+    115.5000    106.7500 -22.0
+    120.2500    113.5000 -22.0
+    126.2500    125.5000 -22.0
+    126.2500    127.5000 -22.0
+    127.2500    130.5000 -22.0
+    128.5000    130.7500 -22.0
+    130.2500    132.5000 -22.0
+    129.5000    133.2500 -22.0
+    129.2500    140.5000 -22.0
+    127.2500    158.5000 -22.0
+    126.2500    163.5000 -22.0
+    125.5000    165.2500 -22.0
+    125.2500    170.5000 -22.0
+    124.2500    173.5000 -22.0
+    123.5000    175.2500 -22.0
+    123.2500    187.5000 -22.0
+    121.5000    188.2500 -22.0
+    115.5000    191.2500 -22.0
+    108.5000    188.2500 -22.0
+    104.5000    184.2500 -22.0
+    101.5000    185.2500 -22.0
+     96.5000    190.2500 -22.0
+     93.5000    190.2500 -22.0
+     91.5000    191.2500 -22.0
+     88.5000    190.2500 -22.0
+     83.7500    184.5000 -22.0
+     81.7500    180.5000 -22.0
+     81.7500    177.5000 -22.0
+     79.7500    173.5000 -22.0
+     79.7500    166.5000 -22.0
+     78.7500    164.5000 -22.0
+     78.7500    157.5000 -22.0
+     79.5000    155.7500 -22.0
+     79.7500    139.5000 -22.0
+     81.7500    135.5000 -22.0
+     84.5000    131.7500 -22.0
+     84.7500    129.5000 -22.0
+     86.5000    125.7500 -22.0
+     86.7500    123.5000 -22.0
+     88.7500    121.5000 -22.0
+     89.7500    119.5000 -22.0
+     93.7500    109.5000 -22.0
+     98.5000    101.7500 -22.0
+     98.7500     99.5000 -22.0
+     99.2500     79.5000 -24.0
+     95.5000     81.2500 -24.0
+     93.5000     81.2500 -24.0
+     81.5000     87.2500 -24.0
+     72.2500     99.5000 -24.0
+     65.2500    115.5000 -24.0
+     61.5000    137.2500 -24.0
+     61.2500    168.5000 -24.0
+     62.2500    170.5000 -24.0
+     62.2500    175.5000 -24.0
+     66.2500    183.5000 -24.0
+     66.2500    185.5000 -24.0
+     69.2500    189.5000 -24.0
+     79.2500    199.5000 -24.0
+     86.2500    203.5000 -24.0
+     90.2500    204.5000 -24.0
+    103.5000    204.7500 -24.0
+    105.2500    205.5000 -24.0
+    113.5000    205.7500 -24.0
+    115.5000    204.7500 -24.0
+    117.5000    204.7500 -24.0
+    132.5000    196.7500 -24.0
+    140.5000    188.7500 -24.0
+    144.5000    181.7500 -24.0
+    148.5000    168.7500 -24.0
+    148.7500    161.5000 -24.0
+    150.5000    151.7500 -24.0
+    151.7500    132.5000 -24.0
+    150.7500    130.5000 -24.0
+    150.7500    122.5000 -24.0
+    149.7500    120.5000 -24.0
+    149.7500    116.5000 -24.0
+    148.7500    114.5000 -24.0
+    148.5000    111.2500 -24.0
+    142.7500     98.5000 -24.0
+    135.7500     89.5000 -24.0
+    127.7500     83.5000 -24.0
+    116.7500     79.5000 -24.0
+    101.7500     90.5000 -24.0
+    102.5000     89.7500 -24.0
+    106.5000     89.7500 -24.0
+    109.2500     94.5000 -24.0
+    109.2500     97.5000 -24.0
+    111.5000    102.7500 -24.0
+    117.5000    105.7500 -24.0
+    121.2500    109.5000 -24.0
+    127.2500    121.5000 -24.0
+    127.2500    123.5000 -24.0
+    133.2500    130.5000 -24.0
+    133.2500    135.5000 -24.0
+    132.2500    138.5000 -24.0
+    133.2500    140.5000 -24.0
+    132.5000    142.2500 -24.0
+    132.2500    149.5000 -24.0
+    130.2500    159.5000 -24.0
+    129.5000    161.2500 -24.0
+    129.2500    167.5000 -24.0
+    128.2500    176.5000 -24.0
+    125.5000    180.2500 -24.0
+    125.2500    182.5000 -24.0
+    123.5000    186.2500 -24.0
+    123.2500    188.5000 -24.0
+    120.5000    192.2500 -24.0
+    118.5000    193.2500 -24.0
+    112.5000    195.2500 -24.0
+    110.7500    194.5000 -24.0
+    109.7500    192.5000 -24.0
+    105.5000    190.2500 -24.0
+    103.5000    189.2500 -24.0
+    101.5000    190.2500 -24.0
+     99.5000    190.2500 -24.0
+     95.5000    192.2500 -24.0
+     92.5000    192.2500 -24.0
+     90.5000    194.2500 -24.0
+     88.5000    194.2500 -24.0
+     85.5000    193.2500 -24.0
+     84.7500    191.5000 -24.0
+     78.7500    179.5000 -24.0
+     78.7500    177.5000 -24.0
+     77.7500    175.5000 -24.0
+     77.7500    173.5000 -24.0
+     76.7500    171.5000 -24.0
+     76.7500    163.5000 -24.0
+     75.7500    161.5000 -24.0
+     75.7500    152.5000 -24.0
+     76.5000    150.7500 -24.0
+     76.7500    137.5000 -24.0
+     79.7500    131.5000 -24.0
+     82.7500    124.5000 -24.0
+     85.5000    121.7500 -24.0
+     89.5000    114.7500 -24.0
+     89.7500    111.5000 -24.0
+     97.5000    102.7500 -24.0
+     97.7500     98.5000 -24.0
+    104.2500     76.5000 -26.0
+    103.5000     77.2500 -26.0
+     98.5000     77.2500 -26.0
+     96.5000     78.2500 -26.0
+     93.5000     78.2500 -26.0
+     85.5000     82.2500 -26.0
+     83.5000     82.2500 -26.0
+     81.5000     84.2500 -26.0
+     79.5000     85.2500 -26.0
+     77.2500     87.5000 -26.0
+     74.5000     91.2500 -26.0
+     70.2500     97.5000 -26.0
+     66.2500    105.5000 -26.0
+     64.5000    109.2500 -26.0
+     63.2500    115.5000 -26.0
+     62.5000    117.2500 -26.0
+     62.2500    122.5000 -26.0
+     61.5000    124.2500 -26.0
+     60.2500    132.5000 -26.0
+     59.5000    134.2500 -26.0
+     59.2500    143.5000 -26.0
+     58.5000    145.2500 -26.0
+     58.2500    150.5000 -26.0
+     59.2500    152.5000 -26.0
+     59.2500    160.5000 -26.0
+     58.5000    162.2500 -26.0
+     58.2500    168.5000 -26.0
+     59.2500    170.5000 -26.0
+     59.2500    174.5000 -26.0
+     61.2500    178.5000 -26.0
+     61.2500    180.5000 -26.0
+     66.2500    190.5000 -26.0
+     72.2500    196.5000 -26.0
+     79.5000    202.7500 -26.0
+     85.5000    205.7500 -26.0
+     87.2500    206.5000 -26.0
+    103.5000    206.7500 -26.0
+    105.2500    207.5000 -26.0
+    117.5000    207.7500 -26.0
+    133.5000    199.7500 -26.0
+    139.5000    193.7500 -26.0
+    142.7500    189.5000 -26.0
+    147.7500    181.5000 -26.0
+    148.7500    176.5000 -26.0
+    149.7500    173.5000 -26.0
+    150.5000    171.7500 -26.0
+    150.7500    167.5000 -26.0
+    151.5000    165.7500 -26.0
+    151.7500    155.5000 -26.0
+    152.5000    153.7500 -26.0
+    152.7500    146.5000 -26.0
+    153.5000    144.7500 -26.0
+    153.7500    131.5000 -26.0
+    152.7500    129.5000 -26.0
+    152.7500    121.5000 -26.0
+    151.7500    119.5000 -26.0
+    151.7500    114.5000 -26.0
+    149.7500    110.5000 -26.0
+    149.5000    108.2500 -26.0
+    146.7500    101.5000 -26.0
+    141.7500     93.5000 -26.0
+    140.7500     91.5000 -26.0
+    133.7500     84.5000 -26.0
+    127.7500     80.5000 -26.0
+    121.5000     78.2500 -26.0
+    119.7500     77.5000 -26.0
+    114.5000     77.2500 -26.0
+    112.7500     76.5000 -26.0
+    102.5000     86.7500 -26.0
+    104.5000     86.7500 -26.0
+    106.5000     87.7500 -26.0
+    110.2500     90.5000 -26.0
+    110.2500     94.5000 -26.0
+    112.2500     98.5000 -26.0
+    112.2500    100.5000 -26.0
+    114.5000    102.7500 -26.0
+    118.5000    104.7500 -26.0
+    123.5000    105.7500 -26.0
+    127.2500    112.5000 -26.0
+    127.2500    114.5000 -26.0
+    130.2500    121.5000 -26.0
+    134.2500    125.5000 -26.0
+    138.2500    133.5000 -26.0
+    137.5000    134.2500 -26.0
+    137.2500    139.5000 -26.0
+    136.5000    141.2500 -26.0
+    136.2500    148.5000 -26.0
+    135.2500    150.5000 -26.0
+    134.2500    159.5000 -26.0
+    133.5000    161.2500 -26.0
+    133.2500    169.5000 -26.0
+    132.2500    174.5000 -26.0
+    130.5000    178.2500 -26.0
+    128.2500    184.5000 -26.0
+    124.5000    188.2500 -26.0
+    124.2500    190.5000 -26.0
+    122.5000    192.2500 -26.0
+    115.5000    196.2500 -26.0
+    112.5000    196.2500 -26.0
+    107.5000    195.2500 -26.0
+    103.5000    192.2500 -26.0
+    101.5000    193.2500 -26.0
+     97.5000    193.2500 -26.0
+     89.5000    197.2500 -26.0
+     87.5000    197.2500 -26.0
+     83.7500    194.5000 -26.0
+     80.7500    188.5000 -26.0
+     76.7500    181.5000 -26.0
+     76.7500    179.5000 -26.0
+     74.7500    175.5000 -26.0
+     74.7500    170.5000 -26.0
+     73.7500    168.5000 -26.0
+     73.7500    162.5000 -26.0
+     72.7500    160.5000 -26.0
+     72.7500    143.5000 -26.0
+     73.7500    138.5000 -26.0
+     72.7500    136.5000 -26.0
+     73.7500    134.5000 -26.0
+     78.7500    125.5000 -26.0
+     79.7500    123.5000 -26.0
+     90.7500    108.5000 -26.0
+     91.7500    106.5000 -26.0
+     93.7500    105.5000 -26.0
+     96.5000    101.7500 -26.0
+     95.7500     99.5000 -26.0
+     96.5000     97.7500 -26.0
+     96.7500     94.5000 -26.0
+     98.5000     93.7500 -26.0
+     99.5000     91.7500 -26.0
+     99.7500     89.5000 -26.0
+    103.2500     74.5000 -28.0
+    102.5000     75.2500 -28.0
+     97.5000     75.2500 -28.0
+     95.5000     76.2500 -28.0
+     92.5000     76.2500 -28.0
+     90.5000     77.2500 -28.0
+     88.5000     77.2500 -28.0
+     80.5000     81.2500 -28.0
+     73.2500     88.5000 -28.0
+     68.2500     96.5000 -28.0
+     62.2500    108.5000 -28.0
+     61.2500    113.5000 -28.0
+     60.5000    115.2500 -28.0
+     60.2500    121.5000 -28.0
+     59.5000    123.2500 -28.0
+     58.2500    131.5000 -28.0
+     57.5000    133.2500 -28.0
+     57.2500    140.5000 -28.0
+     56.5000    142.2500 -28.0
+     56.2500    171.5000 -28.0
+     57.2500    173.5000 -28.0
+     57.2500    176.5000 -28.0
+     58.2500    178.5000 -28.0
+     58.2500    180.5000 -28.0
+     64.2500    192.5000 -28.0
+     72.2500    200.5000 -28.0
+     78.5000    204.7500 -28.0
+     85.2500    208.5000 -28.0
+    103.5000    208.7500 -28.0
+    105.2500    209.5000 -28.0
+    119.5000    209.7500 -28.0
+    131.5000    203.7500 -28.0
+    135.5000    200.7500 -28.0
+    137.7500    199.5000 -28.0
+    140.5000    195.7500 -28.0
+    145.5000    189.7500 -28.0
+    149.5000    182.7500 -28.0
+    151.7500    176.5000 -28.0
+    152.5000    174.7500 -28.0
+    152.7500    170.5000 -28.0
+    153.5000    168.7500 -28.0
+    153.7500    161.5000 -28.0
+    154.5000    159.7500 -28.0
+    154.7500    148.5000 -28.0
+    155.5000    146.7500 -28.0
+    155.7500    130.5000 -28.0
+    154.7500    128.5000 -28.0
+    154.7500    122.5000 -28.0
+    153.7500    120.5000 -28.0
+    153.7500    116.5000 -28.0
+    152.7500    114.5000 -28.0
+    152.7500    111.5000 -28.0
+    150.7500    105.5000 -28.0
+    146.5000     96.2500 -28.0
+    141.7500     89.5000 -28.0
+    137.5000     84.2500 -28.0
+    129.7500     78.5000 -28.0
+    123.5000     76.2500 -28.0
+    121.7500     75.5000 -28.0
+    117.5000     75.2500 -28.0
+    115.7500     74.5000 -28.0
+    100.7500     85.5000 -28.0
+    101.5000     84.7500 -28.0
+    105.5000     84.7500 -28.0
+    107.2500     86.5000 -28.0
+    109.5000     86.7500 -28.0
+    112.5000     85.7500 -28.0
+    114.2500     87.5000 -28.0
+    113.5000     88.2500 -28.0
+    112.2500     92.5000 -28.0
+    113.2500     95.5000 -28.0
+    116.2500     98.5000 -28.0
+    120.5000     98.7500 -28.0
+    124.5000    100.7500 -28.0
+    129.2500    107.5000 -28.0
+    131.2500    111.5000 -28.0
+    131.2500    114.5000 -28.0
+    132.2500    116.5000 -28.0
+    132.2500    118.5000 -28.0
+    134.2500    120.5000 -28.0
+    135.5000    122.7500 -28.0
+    137.5000    123.7500 -28.0
+    142.2500    132.5000 -28.0
+    141.5000    134.2500 -28.0
+    141.2500    138.5000 -28.0
+    140.5000    140.2500 -28.0
+    140.2500    145.5000 -28.0
+    139.5000    147.2500 -28.0
+    139.2500    155.5000 -28.0
+    138.5000    157.2500 -28.0
+    138.2500    162.5000 -28.0
+    137.2500    164.5000 -28.0
+    136.2500    173.5000 -28.0
+    135.2500    178.5000 -28.0
+    134.2500    181.5000 -28.0
+    131.5000    184.2500 -28.0
+    129.5000    185.2500 -28.0
+    123.5000    193.2500 -28.0
+    119.5000    196.2500 -28.0
+    117.5000    196.2500 -28.0
+    113.5000    198.2500 -28.0
+    109.5000    198.2500 -28.0
+    103.5000    195.2500 -28.0
+    101.5000    196.2500 -28.0
+     95.5000    196.2500 -28.0
+     91.5000    199.2500 -28.0
+     89.5000    200.2500 -28.0
+     83.7500    197.5000 -28.0
+     80.7500    193.5000 -28.0
+     77.7500    188.5000 -28.0
+     72.7500    178.5000 -28.0
+     72.7500    176.5000 -28.0
+     71.7500    174.5000 -28.0
+     71.7500    162.5000 -28.0
+     68.7500    158.5000 -28.0
+     68.7500    153.5000 -28.0
+     69.5000    151.7500 -28.0
+     69.7500    134.5000 -28.0
+     70.5000    132.7500 -28.0
+     73.7500    127.5000 -28.0
+     74.7500    125.5000 -28.0
+     89.5000    107.7500 -28.0
+     93.5000    104.7500 -28.0
+     93.7500    101.5000 -28.0
+     92.7500     99.5000 -28.0
+     92.7500     96.5000 -28.0
+     93.7500     94.5000 -28.0
+     92.7500     91.5000 -28.0
+     93.5000     89.7500 -28.0
+     96.5000     90.7500 -28.0
+    103.2500     72.5000 -30.0
+    102.5000     73.2500 -30.0
+     96.5000     73.2500 -30.0
+     94.5000     74.2500 -30.0
+     91.5000     74.2500 -30.0
+     89.5000     75.2500 -30.0
+     87.5000     75.2500 -30.0
+     77.5000     80.2500 -30.0
+     75.2500     82.5000 -30.0
+     72.5000     86.2500 -30.0
+     69.2500     90.5000 -30.0
+     67.2500     94.5000 -30.0
+     64.2500     98.5000 -30.0
+     60.2500    108.5000 -30.0
+     58.5000    112.2500 -30.0
+     58.2500    116.5000 -30.0
+     57.2500    125.5000 -30.0
+     56.2500    128.5000 -30.0
+     55.2500    137.5000 -30.0
+     54.5000    139.2500 -30.0
+     54.2500    157.5000 -30.0
+     53.5000    159.2500 -30.0
+     53.2500    164.5000 -30.0
+     54.2500    166.5000 -30.0
+     54.2500    174.5000 -30.0
+     55.2500    176.5000 -30.0
+     55.2500    178.5000 -30.0
+     56.2500    180.5000 -30.0
+     56.2500    182.5000 -30.0
+     62.2500    194.5000 -30.0
+     69.2500    201.5000 -30.0
+     75.5000    205.7500 -30.0
+     82.2500    209.5000 -30.0
+     84.5000    209.7500 -30.0
+     86.2500    210.5000 -30.0
+     92.5000    210.7500 -30.0
+     94.5000    209.7500 -30.0
+     97.5000    209.7500 -30.0
+     99.2500    210.5000 -30.0
+    105.5000    210.7500 -30.0
+    107.2500    211.5000 -30.0
+    118.5000    211.7500 -30.0
+    120.5000    210.7500 -30.0
+    122.5000    210.7500 -30.0
+    131.5000    206.7500 -30.0
+    136.5000    202.7500 -30.0
+    138.5000    201.7500 -30.0
+    147.7500    190.5000 -30.0
+    153.7500    179.5000 -30.0
+    154.7500    174.5000 -30.0
+    155.5000    172.7500 -30.0
+    155.7500    168.5000 -30.0
+    156.5000    166.7500 -30.0
+    156.7500    154.5000 -30.0
+    157.7500    145.5000 -30.0
+    158.5000    143.7500 -30.0
+    158.7500    137.5000 -30.0
+    157.7500    135.5000 -30.0
+    157.7500    129.5000 -30.0
+    156.7500    127.5000 -30.0
+    156.7500    123.5000 -30.0
+    155.7500    121.5000 -30.0
+    155.7500    117.5000 -30.0
+    154.7500    115.5000 -30.0
+    154.7500    112.5000 -30.0
+    153.7500    110.5000 -30.0
+    153.7500    107.5000 -30.0
+    145.7500     91.5000 -30.0
+    140.7500     85.5000 -30.0
+    139.7500     83.5000 -30.0
+    133.7500     78.5000 -30.0
+    128.5000     75.2500 -30.0
+    123.5000     74.2500 -30.0
+    121.7500     73.5000 -30.0
+    117.5000     73.2500 -30.0
+    115.7500     72.5000 -30.0
+} -30.0
+{ -30.0
+    102.7500     82.5000 -30.0
+    104.5000     81.7500 -30.0
+    107.2500     85.5000 -30.0
+    109.5000     85.7500 -30.0
+    113.5000     83.7500 -30.0
+    117.2500     85.5000 -30.0
+    115.5000     92.2500 -30.0
+    116.5000     93.7500 -30.0
+    118.5000     94.7500 -30.0
+    123.5000     95.7500 -30.0
+    126.2500     98.5000 -30.0
+    135.2500    112.5000 -30.0
+    135.2500    114.5000 -30.0
+    137.2500    120.5000 -30.0
+    143.2500    127.5000 -30.0
+    145.2500    131.5000 -30.0
+    145.2500    135.5000 -30.0
+    144.2500    137.5000 -30.0
+    142.2500    151.5000 -30.0
+    143.2500    153.5000 -30.0
+    141.5000    158.2500 -30.0
+    141.2500    165.5000 -30.0
+    140.2500    167.5000 -30.0
+    141.2500    169.5000 -30.0
+    140.5000    170.2500 -30.0
+    140.2500    175.5000 -30.0
+    138.2500    180.5000 -30.0
+    135.5000    184.2500 -30.0
+    133.5000    185.2500 -30.0
+    126.2500    192.5000 -30.0
+    125.2500    194.5000 -30.0
+    116.5000    199.2500 -30.0
+    109.5000    200.2500 -30.0
+    102.5000    198.2500 -30.0
+     98.5000    200.2500 -30.0
+     96.5000    199.2500 -30.0
+     92.5000    201.2500 -30.0
+     86.5000    201.2500 -30.0
+     82.7500    198.5000 -30.0
+     76.7500    191.5000 -30.0
+     68.7500    176.5000 -30.0
+     68.7500    164.5000 -30.0
+     65.7500    158.5000 -30.0
+     65.7500    154.5000 -30.0
+     66.5000    152.7500 -30.0
+     66.7500    135.5000 -30.0
+     65.7500    133.5000 -30.0
+     68.7500    129.5000 -30.0
+     71.7500    123.5000 -30.0
+     76.5000    119.7500 -30.0
+     79.7500    115.5000 -30.0
+     83.5000    108.7500 -30.0
+     86.7500     99.5000 -30.0
+     90.5000     95.7500 -30.0
+     90.7500     93.5000 -30.0
+     89.7500     91.5000 -30.0
+     97.5000     84.7500 -30.0
+     98.2500     85.5000 -30.0
+    100.5000     84.7500 -30.0
+    104.2500     70.5000 -32.0
+    103.5000     71.2500 -32.0
+     96.5000     71.2500 -32.0
+     94.5000     72.2500 -32.0
+     90.5000     72.2500 -32.0
+     88.5000     73.2500 -32.0
+     86.5000     73.2500 -32.0
+     76.5000     78.2500 -32.0
+     70.2500     85.5000 -32.0
+     65.2500     93.5000 -32.0
+     59.5000    104.2500 -32.0
+     57.2500    110.5000 -32.0
+     56.5000    112.2500 -32.0
+     56.2500    116.5000 -32.0
+     55.2500    125.5000 -32.0
+     54.2500    127.5000 -32.0
+     53.2500    136.5000 -32.0
+     52.5000    138.2500 -32.0
+     52.2500    153.5000 -32.0
+     51.5000    155.2500 -32.0
+     51.2500    171.5000 -32.0
+     52.2500    173.5000 -32.0
+     52.2500    177.5000 -32.0
+     54.2500    181.5000 -32.0
+     54.2500    183.5000 -32.0
+     60.2500    195.5000 -32.0
+     68.5000    203.7500 -32.0
+     76.5000    208.7500 -32.0
+     78.5000    209.7500 -32.0
+     82.2500    211.5000 -32.0
+    101.5000    211.7500 -32.0
+    108.5000    212.7500 -32.0
+    110.2500    213.5000 -32.0
+    118.5000    213.7500 -32.0
+    120.5000    212.7500 -32.0
+    122.5000    212.7500 -32.0
+    124.5000    211.7500 -32.0
+    126.5000    211.7500 -32.0
+    134.5000    206.7500 -32.0
+    136.5000    205.7500 -32.0
+    144.7500    197.5000 -32.0
+    147.5000    193.7500 -32.0
+    150.7500    189.5000 -32.0
+    154.5000    182.7500 -32.0
+    156.7500    176.5000 -32.0
+    157.5000    174.7500 -32.0
+    157.7500    170.5000 -32.0
+    158.5000    168.7500 -32.0
+    158.7500    157.5000 -32.0
+    159.7500    148.5000 -32.0
+    160.5000    146.7500 -32.0
+    160.7500    137.5000 -32.0
+    159.7500    135.5000 -32.0
+    159.7500    129.5000 -32.0
+    158.7500    127.5000 -32.0
+    158.7500    123.5000 -32.0
+    157.7500    121.5000 -32.0
+    157.7500    119.5000 -32.0
+    156.7500    117.5000 -32.0
+    156.7500    112.5000 -32.0
+    155.7500    110.5000 -32.0
+    155.7500    107.5000 -32.0
+    147.7500     91.5000 -32.0
+    144.7500     87.5000 -32.0
+    143.7500     85.5000 -32.0
+    136.5000     78.2500 -32.0
+    128.5000     73.2500 -32.0
+    123.5000     72.2500 -32.0
+    121.7500     71.5000 -32.0
+    115.5000     71.2500 -32.0
+    113.7500     70.5000 -32.0
+    102.7500     80.5000 -32.0
+    103.5000     79.7500 -32.0
+    105.2500     80.5000 -32.0
+    107.2500     84.5000 -32.0
+    111.5000     84.7500 -32.0
+    115.5000     82.7500 -32.0
+    117.5000     82.7500 -32.0
+    121.2500     86.5000 -32.0
+    123.5000     86.7500 -32.0
+    124.2500     88.5000 -32.0
+    129.2500     94.5000 -32.0
+    128.5000     96.2500 -32.0
+    129.2500     97.5000 -32.0
+    130.2500     99.5000 -32.0
+    133.2500    103.5000 -32.0
+    136.2500    109.5000 -32.0
+    139.2500    113.5000 -32.0
+    139.2500    115.5000 -32.0
+    143.2500    123.5000 -32.0
+    144.5000    125.7500 -32.0
+    146.5000    126.7500 -32.0
+    148.2500    129.5000 -32.0
+    148.2500    134.5000 -32.0
+    147.5000    136.2500 -32.0
+    147.2500    141.5000 -32.0
+    146.2500    144.5000 -32.0
+    145.5000    146.2500 -32.0
+    145.2500    154.5000 -32.0
+    144.5000    156.2500 -32.0
+    144.2500    170.5000 -32.0
+    143.2500    175.5000 -32.0
+    140.2500    182.5000 -32.0
+    137.5000    185.2500 -32.0
+    135.5000    186.2500 -32.0
+    125.5000    196.2500 -32.0
+    120.5000    199.2500 -32.0
+    118.5000    199.2500 -32.0
+    112.5000    202.2500 -32.0
+    109.5000    202.2500 -32.0
+    103.5000    200.2500 -32.0
+     99.5000    202.2500 -32.0
+     94.5000    202.2500 -32.0
+     92.5000    203.2500 -32.0
+     88.5000    203.2500 -32.0
+     85.5000    202.2500 -32.0
+     76.5000    193.2500 -32.0
+     74.5000    192.2500 -32.0
+     70.7500    185.5000 -32.0
+     65.7500    175.5000 -32.0
+     65.7500    169.5000 -32.0
+     64.7500    167.5000 -32.0
+     64.7500    161.5000 -32.0
+     63.7500    159.5000 -32.0
+     63.7500    135.5000 -32.0
+     62.7500    132.5000 -32.0
+     64.5000    131.7500 -32.0
+     67.5000    125.7500 -32.0
+     67.7500    123.5000 -32.0
+     76.7500    114.5000 -32.0
+     79.7500    108.5000 -32.0
+     80.7500    103.5000 -32.0
+     85.5000     97.7500 -32.0
+     87.5000     96.7500 -32.0
+     88.7500     94.5000 -32.0
+     87.7500     92.5000 -32.0
+     89.7500     88.5000 -32.0
+     95.5000     83.7500 -32.0
+     97.2500     84.5000 -32.0
+     99.5000     84.7500 -32.0
+     97.2500     69.5000 -34.0
+     96.5000     70.2500 -34.0
+     91.5000     70.2500 -34.0
+     89.5000     71.2500 -34.0
+     86.2500     71.5000 -34.0
+     77.5000     75.2500 -34.0
+     70.5000     82.2500 -34.0
+     66.2500     88.5000 -34.0
+     65.2500     90.5000 -34.0
+     60.2500     98.5000 -34.0
+     56.2500    106.5000 -34.0
+     55.2500    111.5000 -34.0
+     54.5000    113.2500 -34.0
+     54.2500    117.5000 -34.0
+     53.2500    124.5000 -34.0
+     52.2500    129.5000 -34.0
+     51.5000    131.2500 -34.0
+     51.2500    135.5000 -34.0
+     50.5000    137.2500 -34.0
+     50.2500    151.5000 -34.0
+     49.5000    153.2500 -34.0
+     49.2500    173.5000 -34.0
+     50.2500    175.5000 -34.0
+     50.2500    177.5000 -34.0
+     51.2500    179.5000 -34.0
+     51.2500    182.5000 -34.0
+     58.2500    196.5000 -34.0
+     64.2500    202.5000 -34.0
+     70.2500    207.5000 -34.0
+     77.5000    211.7500 -34.0
+     82.5000    212.7500 -34.0
+     84.2500    213.5000 -34.0
+     97.5000    213.7500 -34.0
+     99.5000    212.7500 -34.0
+    100.2500    213.5000 -34.0
+    106.5000    213.7500 -34.0
+    108.2500    214.5000 -34.0
+    121.5000    214.7500 -34.0
+    123.5000    213.7500 -34.0
+    125.5000    213.7500 -34.0
+    135.5000    208.7500 -34.0
+    144.7500    200.5000 -34.0
+    147.5000    196.7500 -34.0
+    152.5000    190.7500 -34.0
+    156.5000    183.7500 -34.0
+    158.7500    177.5000 -34.0
+    159.5000    175.7500 -34.0
+    159.7500    172.5000 -34.0
+    160.5000    170.7500 -34.0
+    160.7500    164.5000 -34.0
+    161.5000    162.7500 -34.0
+    161.7500    150.5000 -34.0
+    162.5000    148.7500 -34.0
+    162.7500    140.5000 -34.0
+    161.7500    138.5000 -34.0
+    161.7500    130.5000 -34.0
+    160.7500    128.5000 -34.0
+    160.7500    123.5000 -34.0
+    159.7500    121.5000 -34.0
+    159.7500    119.5000 -34.0
+    158.7500    117.5000 -34.0
+    158.7500    114.5000 -34.0
+    157.7500    112.5000 -34.0
+    157.7500    109.5000 -34.0
+    156.7500    107.5000 -34.0
+    156.7500    105.5000 -34.0
+    153.7500     99.5000 -34.0
+    148.7500     90.5000 -34.0
+    146.7500     86.5000 -34.0
+    143.7500     83.5000 -34.0
+    142.7500     81.5000 -34.0
+    135.5000     75.2500 -34.0
+    127.5000     71.2500 -34.0
+    125.7500     70.5000 -34.0
+    122.5000     70.2500 -34.0
+    120.7500     69.5000 -34.0
+    102.7500     78.5000 -34.0
+    104.5000     77.7500 -34.0
+    106.2500     79.5000 -34.0
+    106.2500     81.5000 -34.0
+    108.2500     83.5000 -34.0
+    112.5000     83.7500 -34.0
+    116.5000     81.7500 -34.0
+    121.5000     83.7500 -34.0
+    125.2500     86.5000 -34.0
+    129.5000     91.7500 -34.0
+    131.5000     92.7500 -34.0
+    133.2500     96.5000 -34.0
+    139.2500    104.5000 -34.0
+    138.2500    107.5000 -34.0
+    141.2500    113.5000 -34.0
+    151.2500    127.5000 -34.0
+    150.2500    128.5000 -34.0
+    151.2500    130.5000 -34.0
+    150.5000    131.2500 -34.0
+    150.2500    133.5000 -34.0
+    151.2500    136.5000 -34.0
+    150.2500    139.5000 -34.0
+    147.5000    151.2500 -34.0
+    147.2500    160.5000 -34.0
+    146.2500    162.5000 -34.0
+    147.2500    164.5000 -34.0
+    145.2500    176.5000 -34.0
+    142.2500    183.5000 -34.0
+    127.5000    197.2500 -34.0
+    122.5000    200.2500 -34.0
+    120.5000    200.2500 -34.0
+    112.5000    204.2500 -34.0
+    102.5000    203.2500 -34.0
+     98.5000    205.2500 -34.0
+     93.5000    204.2500 -34.0
+     91.5000    205.2500 -34.0
+     89.5000    205.2500 -34.0
+     83.5000    201.2500 -34.0
+     74.7500    194.5000 -34.0
+     73.7500    192.5000 -34.0
+     69.7500    189.5000 -34.0
+     69.7500    187.5000 -34.0
+     66.7500    183.5000 -34.0
+     62.7500    175.5000 -34.0
+     62.7500    170.5000 -34.0
+     61.7500    168.5000 -34.0
+     62.7500    167.5000 -34.0
+     61.7500    165.5000 -34.0
+     61.7500    143.5000 -34.0
+     60.7500    141.5000 -34.0
+     60.7500    135.5000 -34.0
+     59.7500    133.5000 -34.0
+     62.5000    129.7500 -34.0
+     63.7500    123.5000 -34.0
+     67.5000    119.7500 -34.0
+     69.5000    118.7500 -34.0
+     69.7500    117.5000 -34.0
+     71.5000    115.7500 -34.0
+     74.7500    105.5000 -34.0
+     80.5000     98.7500 -34.0
+     82.5000     98.7500 -34.0
+     84.7500     95.5000 -34.0
+     83.7500     93.5000 -34.0
+     83.7500     90.5000 -34.0
+     92.5000     83.7500 -34.0
+     94.5000     83.7500 -34.0
+     96.5000     84.7500 -34.0
+     99.5000     83.7500 -34.0
+    143.7500    191.5000 -34.0
+    145.5000    190.7500 -34.0
+    147.2500    191.5000 -34.0
+    145.5000    192.2500 -34.0
+    104.2500     67.5000 -36.0
+    103.5000     68.2500 -36.0
+     93.5000     68.2500 -36.0
+     91.5000     69.2500 -36.0
+     88.5000     69.2500 -36.0
+     86.5000     70.2500 -36.0
+     84.5000     70.2500 -36.0
+     79.5000     72.2500 -36.0
+     75.5000     75.2500 -36.0
+     73.5000     76.2500 -36.0
+     68.2500     82.5000 -36.0
+     59.2500     96.5000 -36.0
+     55.2500    104.5000 -36.0
+     53.2500    113.5000 -36.0
+     52.2500    120.5000 -36.0
+     51.2500    125.5000 -36.0
+     50.5000    127.2500 -36.0
+     49.2500    135.5000 -36.0
+     48.5000    137.2500 -36.0
+     48.2500    143.5000 -36.0
+     47.5000    145.2500 -36.0
+     47.2500    159.5000 -36.0
+     46.2500    166.5000 -36.0
+     47.2500    168.5000 -36.0
+     47.2500    174.5000 -36.0
+     48.2500    176.5000 -36.0
+     48.2500    178.5000 -36.0
+     50.5000    184.7500 -36.0
+     55.2500    195.5000 -36.0
+     60.2500    201.5000 -36.0
+     67.5000    207.7500 -36.0
+     75.5000    212.7500 -36.0
+     80.5000    213.7500 -36.0
+     82.2500    214.5000 -36.0
+    101.5000    214.7500 -36.0
+    110.5000    215.7500 -36.0
+    112.2500    216.5000 -36.0
+    119.5000    216.7500 -36.0
+    121.5000    215.7500 -36.0
+    124.5000    215.7500 -36.0
+    138.5000    208.7500 -36.0
+    148.7500    198.5000 -36.0
+    151.5000    194.7500 -36.0
+    154.7500    190.5000 -36.0
+    160.7500    179.5000 -36.0
+    161.7500    172.5000 -36.0
+    162.5000    170.7500 -36.0
+    162.7500    163.5000 -36.0
+    163.5000    161.7500 -36.0
+    163.7500    135.5000 -36.0
+    162.7500    133.5000 -36.0
+    162.7500    127.5000 -36.0
+    161.7500    125.5000 -36.0
+    161.7500    121.5000 -36.0
+    160.7500    119.5000 -36.0
+    160.7500    117.5000 -36.0
+    159.7500    115.5000 -36.0
+    159.7500    111.5000 -36.0
+    158.7500    109.5000 -36.0
+    158.7500    106.5000 -36.0
+    149.7500     88.5000 -36.0
+    143.7500     81.5000 -36.0
+    142.7500     79.5000 -36.0
+    136.5000     74.2500 -36.0
+    127.7500     69.5000 -36.0
+    125.5000     69.2500 -36.0
+    123.7500     68.5000 -36.0
+    118.5000     68.2500 -36.0
+    116.7500     67.5000 -36.0
+    101.7500     77.5000 -36.0
+    102.5000     76.7500 -36.0
+    104.5000     76.7500 -36.0
+    106.5000     79.7500 -36.0
+    110.2500     82.5000 -36.0
+    113.5000     82.7500 -36.0
+    117.5000     80.7500 -36.0
+    119.5000     80.7500 -36.0
+    124.5000     81.7500 -36.0
+    126.2500     83.5000 -36.0
+    132.2500     87.5000 -36.0
+    134.2500     91.5000 -36.0
+    136.2500     97.5000 -36.0
+    141.2500    103.5000 -36.0
+    144.2500    108.5000 -36.0
+    144.2500    110.5000 -36.0
+    149.2500    120.5000 -36.0
+    153.2500    127.5000 -36.0
+    153.2500    135.5000 -36.0
+    152.5000    137.2500 -36.0
+    151.2500    145.5000 -36.0
+    150.5000    147.2500 -36.0
+    150.2500    154.5000 -36.0
+    149.5000    156.2500 -36.0
+    149.2500    166.5000 -36.0
+    148.5000    168.2500 -36.0
+    148.2500    173.5000 -36.0
+    147.2500    176.5000 -36.0
+    145.5000    180.2500 -36.0
+    145.2500    182.5000 -36.0
+    142.5000    186.2500 -36.0
+    140.5000    187.2500 -36.0
+    129.5000    198.2500 -36.0
+    122.5000    202.2500 -36.0
+    120.5000    202.2500 -36.0
+    114.5000    205.2500 -36.0
+    112.5000    205.2500 -36.0
+    110.5000    206.2500 -36.0
+    108.5000    206.2500 -36.0
+    106.7500    205.5000 -36.0
+    102.5000    205.2500 -36.0
+    100.5000    206.2500 -36.0
+     96.5000    206.2500 -36.0
+     87.5000    205.2500 -36.0
+     79.5000    200.2500 -36.0
+     77.5000    199.2500 -36.0
+     72.7500    194.5000 -36.0
+     71.7500    192.5000 -36.0
+     69.5000    190.2500 -36.0
+     67.5000    189.2500 -36.0
+     63.7500    182.5000 -36.0
+     60.7500    176.5000 -36.0
+     60.7500    174.5000 -36.0
+     59.7500    172.5000 -36.0
+     59.7500    161.5000 -36.0
+     58.7500    158.5000 -36.0
+     59.5000    156.7500 -36.0
+     59.7500    147.5000 -36.0
+     58.7500    145.5000 -36.0
+     58.7500    141.5000 -36.0
+     57.7500    139.5000 -36.0
+     58.5000    138.7500 -36.0
+     57.7500    137.5000 -36.0
+     57.7500    133.5000 -36.0
+     60.5000    127.7500 -36.0
+     60.7500    123.5000 -36.0
+     63.7500    120.5000 -36.0
+     71.7500    104.5000 -36.0
+     76.7500     98.5000 -36.0
+     75.7500     95.5000 -36.0
+     80.5000     88.7500 -36.0
+     82.5000     87.7500 -36.0
+     86.5000     84.7500 -36.0
+     89.5000     84.7500 -36.0
+     92.5000     81.7500 -36.0
+     94.2500     82.5000 -36.0
+     97.5000     82.7500 -36.0
+    101.5000     79.7500 -36.0
+    145.7500    191.5000 -36.0
+    146.5000    190.7500 -36.0
+    147.2500    191.5000 -36.0
+    146.5000    192.2500 -36.0
+     97.2500     66.5000 -38.0
+     96.5000     67.2500 -38.0
+     90.5000     67.2500 -38.0
+     88.5000     68.2500 -38.0
+     85.2500     68.5000 -38.0
+     76.5000     72.2500 -38.0
+     71.5000     76.2500 -38.0
+     66.5000     82.2500 -38.0
+     62.2500     88.5000 -38.0
+     57.2500     96.5000 -38.0
+     54.2500    102.5000 -38.0
+     53.2500    107.5000 -38.0
+     52.2500    109.5000 -38.0
+     51.2500    116.5000 -38.0
+     50.2500    121.5000 -38.0
+     49.2500    123.5000 -38.0
+     48.2500    132.5000 -38.0
+     47.5000    134.2500 -38.0
+     46.2500    142.5000 -38.0
+     45.5000    144.2500 -38.0
+     45.2500    158.5000 -38.0
+     44.2500    167.5000 -38.0
+     45.2500    169.5000 -38.0
+     45.2500    174.5000 -38.0
+     46.2500    176.5000 -38.0
+     46.2500    179.5000 -38.0
+     48.5000    185.7500 -38.0
+     52.2500    194.5000 -38.0
+     57.2500    200.5000 -38.0
+     58.2500    202.5000 -38.0
+     64.2500    207.5000 -38.0
+     70.5000    211.7500 -38.0
+     74.5000    213.7500 -38.0
+     76.2500    214.5000 -38.0
+     79.5000    214.7500 -38.0
+     81.2500    215.5000 -38.0
+    100.5000    215.7500 -38.0
+    107.5000    216.7500 -38.0
+    109.2500    217.5000 -38.0
+    121.5000    217.7500 -38.0
+    123.5000    216.7500 -38.0
+    125.5000    216.7500 -38.0
+    136.5000    211.7500 -38.0
+    147.7500    202.5000 -38.0
+    150.5000    198.7500 -38.0
+    155.5000    192.7500 -38.0
+    159.5000    186.7500 -38.0
+    162.7500    177.5000 -38.0
+    163.5000    175.7500 -38.0
+    163.7500    172.5000 -38.0
+    164.5000    170.7500 -38.0
+    164.7500    162.5000 -38.0
+    165.5000    160.7500 -38.0
+    165.7500    142.5000 -38.0
+    164.7500    140.5000 -38.0
+    164.7500    133.5000 -38.0
+    163.7500    131.5000 -38.0
+    163.7500    125.5000 -38.0
+    162.7500    123.5000 -38.0
+    162.7500    120.5000 -38.0
+    161.7500    118.5000 -38.0
+    161.7500    114.5000 -38.0
+    160.7500    112.5000 -38.0
+    160.7500    109.5000 -38.0
+    158.7500    105.5000 -38.0
+    158.7500    103.5000 -38.0
+    150.7500     87.5000 -38.0
+    147.7500     84.5000 -38.0
+    146.7500     82.5000 -38.0
+    138.7500     74.5000 -38.0
+    132.7500     70.5000 -38.0
+    126.5000     68.2500 -38.0
+    124.7500     67.5000 -38.0
+    121.5000     67.2500 -38.0
+    119.7500     66.5000 -38.0
+    101.7500     75.5000 -38.0
+    103.5000     74.7500 -38.0
+    105.2500     75.5000 -38.0
+    105.5000     77.7500 -38.0
+    109.2500     80.5000 -38.0
+    116.5000     80.7500 -38.0
+    120.5000     78.7500 -38.0
+    122.2500     79.5000 -38.0
+    123.5000     78.7500 -38.0
+    127.2500     79.5000 -38.0
+    128.2500     81.5000 -38.0
+    129.5000     81.7500 -38.0
+    137.2500     91.5000 -38.0
+    137.2500     95.5000 -38.0
+    139.2500    100.5000 -38.0
+    146.2500    107.5000 -38.0
+    146.2500    109.5000 -38.0
+    155.2500    127.5000 -38.0
+    155.2500    135.5000 -38.0
+    153.5000    142.2500 -38.0
+    153.2500    154.5000 -38.0
+    152.5000    156.2500 -38.0
+    151.2500    171.5000 -38.0
+    146.2500    185.5000 -38.0
+    144.5000    186.2500 -38.0
+    129.5000    200.2500 -38.0
+    122.5000    204.2500 -38.0
+    119.5000    204.2500 -38.0
+    113.5000    207.2500 -38.0
+    102.5000    207.2500 -38.0
+    100.5000    208.2500 -38.0
+     90.5000    207.2500 -38.0
+     84.5000    205.2500 -38.0
+     76.5000    200.2500 -38.0
+     64.7500    187.5000 -38.0
+     58.7500    177.5000 -38.0
+     58.7500    175.5000 -38.0
+     57.7500    173.5000 -38.0
+     57.7500    167.5000 -38.0
+     56.7500    165.5000 -38.0
+     56.7500    155.5000 -38.0
+     57.5000    153.7500 -38.0
+     57.7500    147.5000 -38.0
+     56.7500    145.5000 -38.0
+     56.7500    140.5000 -38.0
+     55.7500    138.5000 -38.0
+     55.7500    134.5000 -38.0
+     54.7500    131.5000 -38.0
+     57.5000    128.7500 -38.0
+     58.7500    123.5000 -38.0
+     61.7500    119.5000 -38.0
+     69.5000    102.7500 -38.0
+     71.7500     94.5000 -38.0
+     79.5000     86.7500 -38.0
+     81.5000     86.7500 -38.0
+     84.5000     83.7500 -38.0
+     86.5000     83.7500 -38.0
+     89.5000     80.7500 -38.0
+     94.5000     80.7500 -38.0
+     96.5000     79.7500 -38.0
+     99.5000     79.7500 -38.0
+    101.5000     77.7500 -38.0
+     50.7500    182.5000 -38.0
+     51.5000    181.7500 -38.0
+     52.2500    182.5000 -38.0
+     51.5000    183.2500 -38.0
+     95.2500     65.5000 -40.0
+     94.5000     66.2500 -40.0
+     90.5000     66.2500 -40.0
+     88.5000     67.2500 -40.0
+     84.5000     67.2500 -40.0
+     74.5000     72.2500 -40.0
+     70.5000     75.2500 -40.0
+     65.5000     81.2500 -40.0
+     61.5000     87.2500 -40.0
+     58.2500     91.5000 -40.0
+     53.2500    101.5000 -40.0
+     52.2500    106.5000 -40.0
+     51.2500    108.5000 -40.0
+     49.2500    118.5000 -40.0
+     47.2500    127.5000 -40.0
+     46.2500    134.5000 -40.0
+     45.5000    136.2500 -40.0
+     44.2500    144.5000 -40.0
+     43.5000    146.2500 -40.0
+     43.2500    174.5000 -40.0
+     44.2500    176.5000 -40.0
+     44.2500    178.5000 -40.0
+     45.2500    180.5000 -40.0
+     45.2500    182.5000 -40.0
+     46.5000    185.7500 -40.0
+     50.2500    194.5000 -40.0
+     59.5000    205.7500 -40.0
+     63.2500    208.5000 -40.0
+     67.5000    211.7500 -40.0
+     74.2500    215.5000 -40.0
+     77.5000    215.7500 -40.0
+     79.2500    216.5000 -40.0
+     99.5000    216.7500 -40.0
+    106.5000    217.7500 -40.0
+    108.2500    218.5000 -40.0
+    122.5000    218.7500 -40.0
+    124.5000    217.7500 -40.0
+    126.5000    217.7500 -40.0
+    137.5000    212.7500 -40.0
+    148.5000    203.7500 -40.0
+    157.7500    192.5000 -40.0
+    163.5000    181.7500 -40.0
+    163.7500    179.5000 -40.0
+    164.7500    176.5000 -40.0
+    165.5000    174.7500 -40.0
+    165.7500    170.5000 -40.0
+    166.5000    168.7500 -40.0
+    166.7500    161.5000 -40.0
+    167.5000    159.7500 -40.0
+    167.7500    149.5000 -40.0
+    166.7500    147.5000 -40.0
+    166.7500    138.5000 -40.0
+    165.7500    136.5000 -40.0
+    165.7500    132.5000 -40.0
+    164.7500    130.5000 -40.0
+    164.7500    124.5000 -40.0
+    163.7500    122.5000 -40.0
+    163.7500    117.5000 -40.0
+    161.7500    113.5000 -40.0
+    161.7500    110.5000 -40.0
+    160.7500    108.5000 -40.0
+    160.7500    106.5000 -40.0
+    159.7500    104.5000 -40.0
+    159.7500    102.5000 -40.0
+    152.7500     88.5000 -40.0
+    147.7500     82.5000 -40.0
+    144.7500     78.5000 -40.0
+    137.5000     72.2500 -40.0
+    127.5000     67.2500 -40.0
+    125.7500     66.5000 -40.0
+    122.5000     66.2500 -40.0
+    120.7500     65.5000 -40.0
+    101.7500     73.5000 -40.0
+    102.5000     72.7500 -40.0
+    104.5000     73.7500 -40.0
+    106.2500     74.5000 -40.0
+    106.2500     77.5000 -40.0
+    110.2500     79.5000 -40.0
+    117.5000     79.7500 -40.0
+    121.5000     77.7500 -40.0
+    129.5000     77.7500 -40.0
+    133.2500     82.5000 -40.0
+    136.2500     88.5000 -40.0
+    140.2500     92.5000 -40.0
+    140.2500     95.5000 -40.0
+    142.2500     97.5000 -40.0
+    141.5000     99.2500 -40.0
+    142.2500    101.5000 -40.0
+    146.2500    105.5000 -40.0
+    150.2500    113.5000 -40.0
+    150.2500    115.5000 -40.0
+    153.2500    119.5000 -40.0
+    156.2500    124.5000 -40.0
+    156.2500    127.5000 -40.0
+    157.2500    130.5000 -40.0
+    156.2500    139.5000 -40.0
+    155.5000    141.2500 -40.0
+    155.2500    158.5000 -40.0
+    154.2500    163.5000 -40.0
+    153.2500    172.5000 -40.0
+    151.2500    178.5000 -40.0
+    149.2500    183.5000 -40.0
+    148.5000    185.2500 -40.0
+    146.5000    186.2500 -40.0
+    139.5000    193.2500 -40.0
+    129.5000    202.2500 -40.0
+    119.5000    207.2500 -40.0
+    116.5000    207.2500 -40.0
+    112.5000    209.2500 -40.0
+    108.5000    209.2500 -40.0
+    103.5000    208.2500 -40.0
+    101.5000    209.2500 -40.0
+     98.5000    209.2500 -40.0
+     96.7500    208.5000 -40.0
+     90.5000    208.2500 -40.0
+     85.5000    207.2500 -40.0
+     83.5000    206.2500 -40.0
+     75.5000    201.2500 -40.0
+     63.7500    188.5000 -40.0
+     60.7500    184.5000 -40.0
+     57.7500    179.5000 -40.0
+     57.7500    177.5000 -40.0
+     55.7500    173.5000 -40.0
+     55.7500    169.5000 -40.0
+     54.7500    167.5000 -40.0
+     54.7500    140.5000 -40.0
+     53.7500    138.5000 -40.0
+     53.7500    133.5000 -40.0
+     52.7500    131.5000 -40.0
+     53.7500    129.5000 -40.0
+     62.5000    112.7500 -40.0
+     62.7500    110.5000 -40.0
+     67.7500    100.5000 -40.0
+     68.5000     98.7500 -40.0
+     68.7500     94.5000 -40.0
+     72.5000     88.7500 -40.0
+     74.7500     87.5000 -40.0
+     81.5000     82.7500 -40.0
+     83.5000     82.7500 -40.0
+     83.7500     81.5000 -40.0
+     85.5000     79.7500 -40.0
+     91.5000     79.7500 -40.0
+     93.5000     78.7500 -40.0
+     95.5000     78.7500 -40.0
+     99.5000     76.7500 -40.0
+     99.7500     74.5000 -40.0
+    143.7500     95.5000 -40.0
+    144.5000     94.7500 -40.0
+    145.2500     95.5000 -40.0
+    144.5000     97.2500 -40.0
+     66.7500    204.5000 -40.0
+     67.5000    203.7500 -40.0
+     68.2500    204.5000 -40.0
+     67.5000    205.2500 -40.0
+     95.2500     64.5000 -42.0
+     94.5000     65.2500 -42.0
+     89.5000     65.2500 -42.0
+     87.5000     66.2500 -42.0
+     84.2500     66.5000 -42.0
+     75.5000     70.2500 -42.0
+     70.5000     74.2500 -42.0
+     68.5000     75.2500 -42.0
+     68.2500     76.5000 -42.0
+     64.5000     80.2500 -42.0
+     58.2500     88.5000 -42.0
+     53.5000     97.2500 -42.0
+     53.2500     99.5000 -42.0
+     51.2500    103.5000 -42.0
+     50.2500    108.5000 -42.0
+     49.2500    110.5000 -42.0
+     48.2500    117.5000 -42.0
+     47.5000    119.2500 -42.0
+     46.2500    127.5000 -42.0
+     45.5000    129.2500 -42.0
+     44.2500    137.5000 -42.0
+     43.2500    139.5000 -42.0
+     42.2500    146.5000 -42.0
+     41.5000    148.2500 -42.0
+     41.2500    154.5000 -42.0
+     40.2500    156.5000 -42.0
+     41.2500    158.5000 -42.0
+     41.2500    173.5000 -42.0
+     42.2500    175.5000 -42.0
+     42.2500    179.5000 -42.0
+     44.2500    183.5000 -42.0
+     44.2500    185.5000 -42.0
+     50.2500    197.5000 -42.0
+     58.2500    206.5000 -42.0
+     64.2500    211.5000 -42.0
+     70.5000    215.7500 -42.0
+     75.5000    216.7500 -42.0
+     77.2500    217.5000 -42.0
+     98.5000    217.7500 -42.0
+    105.5000    218.7500 -42.0
+    107.2500    219.5000 -42.0
+    124.5000    219.7500 -42.0
+    132.5000    215.7500 -42.0
+    134.5000    215.7500 -42.0
+    140.5000    211.7500 -42.0
+    142.5000    210.7500 -42.0
+    148.5000    204.7500 -42.0
+    150.5000    203.7500 -42.0
+    154.5000    198.7500 -42.0
+    159.5000    192.7500 -42.0
+    163.5000    185.7500 -42.0
+    163.7500    183.5000 -42.0
+    165.7500    179.5000 -42.0
+    166.7500    174.5000 -42.0
+    167.5000    172.7500 -42.0
+    167.7500    167.5000 -42.0
+    168.5000    165.7500 -42.0
+    168.7500    147.5000 -42.0
+    167.7500    145.5000 -42.0
+    167.7500    138.5000 -42.0
+    166.7500    136.5000 -42.0
+    166.7500    132.5000 -42.0
+    165.7500    130.5000 -42.0
+    165.7500    123.5000 -42.0
+    164.7500    121.5000 -42.0
+    164.7500    118.5000 -42.0
+    163.7500    116.5000 -42.0
+    163.7500    114.5000 -42.0
+    162.7500    112.5000 -42.0
+    162.7500    108.5000 -42.0
+    160.7500    104.5000 -42.0
+    160.7500    102.5000 -42.0
+    158.7500     98.5000 -42.0
+    156.5000     92.2500 -42.0
+    151.7500     85.5000 -42.0
+    150.7500     83.5000 -42.0
+    139.7500     72.5000 -42.0
+    132.7500     68.5000 -42.0
+    126.5000     66.2500 -42.0
+    124.7500     65.5000 -42.0
+    121.5000     65.2500 -42.0
+    119.7500     64.5000 -42.0
+     99.7500     72.5000 -42.0
+    100.5000     71.7500 -42.0
+    104.5000     71.7500 -42.0
+    108.2500     74.5000 -42.0
+    108.2500     76.5000 -42.0
+    109.5000     76.7500 -42.0
+    111.2500     77.5000 -42.0
+    116.5000     77.7500 -42.0
+    118.5000     76.7500 -42.0
+    121.5000     76.7500 -42.0
+    123.5000     75.7500 -42.0
+    130.5000     75.7500 -42.0
+    132.2500     76.5000 -42.0
+    132.2500     78.5000 -42.0
+    135.2500     82.5000 -42.0
+    137.2500     86.5000 -42.0
+    144.2500     95.5000 -42.0
+    145.2500     97.5000 -42.0
+    147.2500     98.5000 -42.0
+    147.2500    101.5000 -42.0
+    149.2500    105.5000 -42.0
+    149.2500    107.5000 -42.0
+    154.2500    117.5000 -42.0
+    157.2500    122.5000 -42.0
+    157.2500    126.5000 -42.0
+    158.2500    128.5000 -42.0
+    158.2500    132.5000 -42.0
+    157.5000    134.2500 -42.0
+    157.2500    142.5000 -42.0
+    156.2500    144.5000 -42.0
+    157.2500    146.5000 -42.0
+    157.2500    160.5000 -42.0
+    156.5000    162.2500 -42.0
+    156.2500    169.5000 -42.0
+    155.2500    174.5000 -42.0
+    154.2500    177.5000 -42.0
+    151.2500    184.5000 -42.0
+    136.5000    198.2500 -42.0
+    129.5000    204.2500 -42.0
+    124.5000    207.2500 -42.0
+    122.5000    207.2500 -42.0
+    118.5000    209.2500 -42.0
+    116.5000    209.2500 -42.0
+    114.5000    210.2500 -42.0
+    112.5000    210.2500 -42.0
+    109.5000    211.2500 -42.0
+    103.5000    209.2500 -42.0
+     98.5000    211.2500 -42.0
+     96.7500    209.5000 -42.0
+     90.5000    209.2500 -42.0
+     83.5000    208.2500 -42.0
+     79.5000    205.2500 -42.0
+     75.5000    203.2500 -42.0
+     59.7500    186.5000 -42.0
+     54.7500    176.5000 -42.0
+     54.7500    174.5000 -42.0
+     53.7500    172.5000 -42.0
+     53.7500    168.5000 -42.0
+     52.7500    166.5000 -42.0
+     52.7500    134.5000 -42.0
+     51.7500    132.5000 -42.0
+     51.7500    130.5000 -42.0
+     52.7500    127.5000 -42.0
+     54.7500    122.5000 -42.0
+     57.5000    118.7500 -42.0
+     58.7500    114.5000 -42.0
+     60.5000    110.7500 -42.0
+     60.7500    108.5000 -42.0
+     63.7500    104.5000 -42.0
+     66.7500     98.5000 -42.0
+     67.7500     89.5000 -42.0
+     71.5000     86.7500 -42.0
+     75.5000     84.7500 -42.0
+     82.5000     78.7500 -42.0
+     84.5000     77.7500 -42.0
+     86.2500     78.5000 -42.0
+     90.5000     78.7500 -42.0
+     91.5000     76.7500 -42.0
+     94.5000     76.7500 -42.0
+     97.5000     75.7500 -42.0
+     97.7500     73.5000 -42.0
+     46.7500    142.5000 -42.0
+     47.5000    141.7500 -42.0
+     48.2500    142.5000 -42.0
+     47.5000    144.2500 -42.0
+     96.2500     63.5000 -44.0
+     95.5000     64.2500 -44.0
+     90.5000     64.2500 -44.0
+     88.5000     65.2500 -44.0
+     86.5000     65.2500 -44.0
+     84.5000     66.2500 -44.0
+     82.5000     66.2500 -44.0
+     70.5000     72.2500 -44.0
+     65.5000     77.2500 -44.0
+     60.5000     83.2500 -44.0
+     57.2500     87.5000 -44.0
+     51.2500     99.5000 -44.0
+     50.2500    104.5000 -44.0
+     49.2500    106.5000 -44.0
+     47.2500    115.5000 -44.0
+     46.5000    117.2500 -44.0
+     46.2500    121.5000 -44.0
+     45.5000    123.2500 -44.0
+     44.2500    131.5000 -44.0
+     43.2500    133.5000 -44.0
+     40.2500    148.5000 -44.0
+     39.5000    150.2500 -44.0
+     39.2500    170.5000 -44.0
+     40.2500    172.5000 -44.0
+     40.2500    177.5000 -44.0
+     41.2500    179.5000 -44.0
+     41.2500    181.5000 -44.0
+     43.2500    185.5000 -44.0
+     43.2500    187.5000 -44.0
+     47.2500    195.5000 -44.0
+     50.2500    199.5000 -44.0
+     51.2500    201.5000 -44.0
+     59.5000    209.7500 -44.0
+     63.2500    212.5000 -44.0
+     69.5000    216.7500 -44.0
+     74.5000    217.7500 -44.0
+     76.2500    218.5000 -44.0
+     97.5000    218.7500 -44.0
+    104.5000    219.7500 -44.0
+    106.2500    220.5000 -44.0
+    122.5000    220.7500 -44.0
+    124.5000    219.7500 -44.0
+    127.7500    219.5000 -44.0
+    138.5000    214.7500 -44.0
+    143.5000    210.7500 -44.0
+    145.5000    209.7500 -44.0
+    155.5000    199.7500 -44.0
+    160.5000    193.7500 -44.0
+    165.7500    184.5000 -44.0
+    166.7500    179.5000 -44.0
+    168.7500    173.5000 -44.0
+    169.7500    164.5000 -44.0
+    170.5000    162.7500 -44.0
+    170.7500    156.5000 -44.0
+    169.7500    154.5000 -44.0
+    169.7500    145.5000 -44.0
+    168.7500    143.5000 -44.0
+    168.7500    138.5000 -44.0
+    167.7500    136.5000 -44.0
+    167.7500    131.5000 -44.0
+    166.7500    129.5000 -44.0
+    166.7500    124.5000 -44.0
+    165.7500    122.5000 -44.0
+    165.7500    118.5000 -44.0
+    164.7500    116.5000 -44.0
+    164.7500    114.5000 -44.0
+    163.7500    112.5000 -44.0
+    163.7500    108.5000 -44.0
+    161.7500    104.5000 -44.0
+    161.7500    102.5000 -44.0
+    158.7500     96.5000 -44.0
+    158.7500     94.5000 -44.0
+    153.7500     86.5000 -44.0
+    152.7500     84.5000 -44.0
+    147.7500     79.5000 -44.0
+    146.7500     77.5000 -44.0
+    138.5000     71.2500 -44.0
+    131.7500     67.5000 -44.0
+    125.5000     65.2500 -44.0
+    123.7500     64.5000 -44.0
+    119.5000     64.2500 -44.0
+    117.7500     63.5000 -44.0
+     97.5000     70.7500 -44.0
+     99.5000     70.7500 -44.0
+    101.5000     71.7500 -44.0
+    104.5000     70.7500 -44.0
+    106.2500     72.5000 -44.0
+    109.5000     72.7500 -44.0
+    114.5000     74.7500 -44.0
+    120.5000     71.7500 -44.0
+    123.2500     74.5000 -44.0
+    132.5000     74.7500 -44.0
+    134.2500     76.5000 -44.0
+    134.2500     79.5000 -44.0
+    138.2500     83.5000 -44.0
+    140.2500     87.5000 -44.0
+    144.2500     91.5000 -44.0
+    150.2500    101.5000 -44.0
+    150.2500    104.5000 -44.0
+    155.2500    114.5000 -44.0
+    155.2500    116.5000 -44.0
+    158.2500    120.5000 -44.0
+    158.2500    123.5000 -44.0
+    159.2500    125.5000 -44.0
+    159.2500    136.5000 -44.0
+    158.5000    138.2500 -44.0
+    158.2500    145.5000 -44.0
+    159.2500    147.5000 -44.0
+    159.2500    163.5000 -44.0
+    158.5000    165.2500 -44.0
+    158.2500    173.5000 -44.0
+    157.2500    176.5000 -44.0
+    154.2500    183.5000 -44.0
+    147.5000    190.2500 -44.0
+    137.5000    199.2500 -44.0
+    130.5000    205.2500 -44.0
+    125.5000    208.2500 -44.0
+    123.5000    208.2500 -44.0
+    117.5000    211.2500 -44.0
+    115.5000    211.2500 -44.0
+    113.5000    212.2500 -44.0
+    108.5000    212.2500 -44.0
+    106.7500    211.5000 -44.0
+    100.5000    211.2500 -44.0
+     98.5000    212.2500 -44.0
+     96.7500    210.5000 -44.0
+     88.5000    210.2500 -44.0
+     83.5000    209.2500 -44.0
+     75.5000    204.2500 -44.0
+     73.5000    203.2500 -44.0
+     58.7500    187.5000 -44.0
+     55.7500    183.5000 -44.0
+     55.7500    181.5000 -44.0
+     52.7500    175.5000 -44.0
+     52.7500    173.5000 -44.0
+     51.7500    171.5000 -44.0
+     51.7500    168.5000 -44.0
+     50.7500    166.5000 -44.0
+     50.7500    146.5000 -44.0
+     51.5000    144.7500 -44.0
+     51.7500    139.5000 -44.0
+     50.7500    137.5000 -44.0
+     50.7500    131.5000 -44.0
+     49.7500    128.5000 -44.0
+     56.7500    114.5000 -44.0
+     57.5000    112.7500 -44.0
+     57.7500    108.5000 -44.0
+     62.7500    100.5000 -44.0
+     64.7500     90.5000 -44.0
+     67.5000     87.7500 -44.0
+     72.5000     84.7500 -44.0
+     74.7500     83.5000 -44.0
+     77.5000     79.7500 -44.0
+     81.5000     76.7500 -44.0
+     86.5000     76.7500 -44.0
+     90.5000     72.7500 -44.0
+     92.2500     73.5000 -44.0
+     94.5000     73.7500 -44.0
+     98.2500     62.5000 -46.0
+     97.5000     63.2500 -46.0
+     92.5000     63.2500 -46.0
+     90.5000     64.2500 -46.0
+     87.5000     64.2500 -46.0
+     85.5000     65.2500 -46.0
+     82.2500     65.5000 -46.0
+     73.5000     69.2500 -46.0
+     67.5000     74.2500 -46.0
+     65.5000     75.2500 -46.0
+     59.5000     82.2500 -46.0
+     56.2500     86.5000 -46.0
+     50.2500     98.5000 -46.0
+     48.2500    107.5000 -46.0
+     47.2500    109.5000 -46.0
+     44.2500    124.5000 -46.0
+     40.2500    142.5000 -46.0
+     39.5000    144.2500 -46.0
+     38.2500    152.5000 -46.0
+     37.5000    154.2500 -46.0
+     37.2500    167.5000 -46.0
+     38.2500    169.5000 -46.0
+     38.2500    175.5000 -46.0
+     39.2500    177.5000 -46.0
+     39.2500    180.5000 -46.0
+     41.2500    184.5000 -46.0
+     41.5000    186.7500 -46.0
+     45.2500    195.5000 -46.0
+     49.2500    200.5000 -46.0
+     50.2500    202.5000 -46.0
+     57.2500    209.5000 -46.0
+     63.2500    214.5000 -46.0
+     68.5000    217.7500 -46.0
+     73.5000    218.7500 -46.0
+     75.2500    219.5000 -46.0
+     83.5000    219.7500 -46.0
+     85.5000    220.7500 -46.0
+     87.5000    219.7500 -46.0
+     96.5000    219.7500 -46.0
+    105.5000    220.7500 -46.0
+    107.2500    221.5000 -46.0
+    122.5000    221.7500 -46.0
+    124.5000    220.7500 -46.0
+    127.5000    220.7500 -46.0
+    143.5000    212.7500 -46.0
+    158.5000    198.7500 -46.0
+    162.7500    192.5000 -46.0
+    167.7500    182.5000 -46.0
+    169.7500    173.5000 -46.0
+    170.5000    171.7500 -46.0
+    170.7500    167.5000 -46.0
+    171.5000    165.7500 -46.0
+    171.7500    156.5000 -46.0
+    170.7500    154.5000 -46.0
+    170.7500    146.5000 -46.0
+    169.7500    144.5000 -46.0
+    169.7500    139.5000 -46.0
+    168.7500    137.5000 -46.0
+    168.7500    131.5000 -46.0
+    167.7500    129.5000 -46.0
+    167.7500    125.5000 -46.0
+    166.7500    123.5000 -46.0
+    166.7500    120.5000 -46.0
+    165.7500    118.5000 -46.0
+    165.7500    114.5000 -46.0
+    164.7500    112.5000 -46.0
+    164.7500    109.5000 -46.0
+    162.7500    105.5000 -46.0
+    162.7500    103.5000 -46.0
+    160.7500     99.5000 -46.0
+    160.7500     97.5000 -46.0
+    154.7500     85.5000 -46.0
+    146.7500     76.5000 -46.0
+    142.5000     73.2500 -46.0
+    138.7500     70.5000 -46.0
+    131.7500     66.5000 -46.0
+    129.5000     66.2500 -46.0
+    125.5000     64.2500 -46.0
+    118.5000     63.2500 -46.0
+    116.7500     62.5000 -46.0
+     82.5000     69.7500 -46.0
+     96.5000     69.7500 -46.0
+    102.5000     72.7500 -46.0
+    102.7500     70.5000 -46.0
+    104.5000     69.7500 -46.0
+    106.5000     71.7500 -46.0
+    108.5000     70.7500 -46.0
+    110.5000     70.7500 -46.0
+    117.5000     71.7500 -46.0
+    120.5000     70.7500 -46.0
+    125.5000     72.7500 -46.0
+    127.2500     73.5000 -46.0
+    132.5000     73.7500 -46.0
+    134.2500     74.5000 -46.0
+    137.2500     80.5000 -46.0
+    141.5000     83.7500 -46.0
+    143.5000     84.7500 -46.0
+    147.2500     90.5000 -46.0
+    147.2500     92.5000 -46.0
+    148.2500     95.5000 -46.0
+    151.2500     99.5000 -46.0
+    151.2500    102.5000 -46.0
+    152.2500    104.5000 -46.0
+    152.2500    106.5000 -46.0
+    155.2500    110.5000 -46.0
+    155.2500    112.5000 -46.0
+    159.2500    120.5000 -46.0
+    159.2500    122.5000 -46.0
+    160.2500    124.5000 -46.0
+    160.2500    126.5000 -46.0
+    161.2500    128.5000 -46.0
+    160.5000    130.2500 -46.0
+    160.2500    135.5000 -46.0
+    159.5000    137.2500 -46.0
+    159.2500    143.5000 -46.0
+    160.2500    145.5000 -46.0
+    160.2500    148.5000 -46.0
+    161.2500    150.5000 -46.0
+    161.2500    162.5000 -46.0
+    160.5000    164.2500 -46.0
+    160.2500    174.5000 -46.0
+    158.2500    178.5000 -46.0
+    157.2500    183.5000 -46.0
+    155.5000    184.2500 -46.0
+    149.5000    190.2500 -46.0
+    136.2500    202.5000 -46.0
+    129.5000    207.2500 -46.0
+    124.5000    210.2500 -46.0
+    122.5000    210.2500 -46.0
+    118.5000    212.2500 -46.0
+    115.5000    212.2500 -46.0
+    113.5000    213.2500 -46.0
+    109.5000    213.2500 -46.0
+    104.5000    212.2500 -46.0
+    102.5000    211.2500 -46.0
+    100.5000    212.2500 -46.0
+     98.5000    212.2500 -46.0
+     96.7500    211.5000 -46.0
+     88.5000    211.2500 -46.0
+     83.5000    210.2500 -46.0
+     75.5000    206.2500 -46.0
+     71.5000    203.2500 -46.0
+     69.5000    202.2500 -46.0
+     68.7500    200.5000 -46.0
+     54.7500    185.5000 -46.0
+     54.7500    183.5000 -46.0
+     51.7500    177.5000 -46.0
+     51.7500    175.5000 -46.0
+     49.7500    171.5000 -46.0
+     49.7500    168.5000 -46.0
+     48.7500    166.5000 -46.0
+     48.7500    147.5000 -46.0
+     49.5000    145.7500 -46.0
+     49.7500    130.5000 -46.0
+     48.7500    127.5000 -46.0
+     49.5000    125.7500 -46.0
+     49.7500    122.5000 -46.0
+     51.7500    118.5000 -46.0
+     56.5000    109.7500 -46.0
+     56.7500    107.5000 -46.0
+     60.5000     99.7500 -46.0
+     60.7500     95.5000 -46.0
+     63.7500     89.5000 -46.0
+     69.5000     84.7500 -46.0
+     71.5000     83.7500 -46.0
+     73.7500     81.5000 -46.0
+     72.7500     79.5000 -46.0
+     77.5000     76.7500 -46.0
+     81.5000     74.7500 -46.0
+     81.7500     73.5000 -46.0
+     80.7500     71.5000 -46.0
+    100.2500     61.5000 -48.0
+     99.5000     62.2500 -48.0
+     93.5000     62.2500 -48.0
+     91.5000     63.2500 -48.0
+     88.5000     63.2500 -48.0
+     86.5000     64.2500 -48.0
+     83.2500     64.5000 -48.0
+     72.5000     69.2500 -48.0
+     68.5000     72.2500 -48.0
+     66.5000     73.2500 -48.0
+     59.5000     80.2500 -48.0
+     56.2500     84.5000 -48.0
+     50.2500     96.5000 -48.0
+     49.2500    101.5000 -48.0
+     47.2500    105.5000 -48.0
+     46.2500    110.5000 -48.0
+     45.5000    112.2500 -48.0
+     44.2500    120.5000 -48.0
+     43.2500    125.5000 -48.0
+     42.2500    128.5000 -48.0
+     40.2500    137.5000 -48.0
+     39.2500    142.5000 -48.0
+     38.2500    144.5000 -48.0
+     37.2500    151.5000 -48.0
+     36.5000    153.2500 -48.0
+     36.2500    159.5000 -48.0
+     35.2500    162.5000 -48.0
+     36.2500    164.5000 -48.0
+     36.2500    171.5000 -48.0
+     37.2500    173.5000 -48.0
+     37.2500    176.5000 -48.0
+     38.2500    178.5000 -48.0
+     38.2500    180.5000 -48.0
+     39.2500    182.5000 -48.0
+     39.2500    184.5000 -48.0
+     43.2500    192.5000 -48.0
+     43.2500    194.5000 -48.0
+     46.2500    198.5000 -48.0
+     47.2500    200.5000 -48.0
+     55.2500    209.5000 -48.0
+     61.2500    214.5000 -48.0
+     66.2500    217.5000 -48.0
+     72.5000    219.7500 -48.0
+     81.5000    220.7500 -48.0
+     86.5000    221.7500 -48.0
+     88.5000    220.7500 -48.0
+     90.5000    220.7500 -48.0
+     95.5000    221.7500 -48.0
+     98.5000    220.7500 -48.0
+    100.2500    221.5000 -48.0
+    105.5000    221.7500 -48.0
+    107.2500    222.5000 -48.0
+    116.5000    222.7500 -48.0
+    118.5000    221.7500 -48.0
+    125.5000    221.7500 -48.0
+    127.5000    220.7500 -48.0
+    129.7500    220.5000 -48.0
+    142.5000    214.7500 -48.0
+    154.5000    203.7500 -48.0
+    156.5000    202.7500 -48.0
+    156.7500    201.5000 -48.0
+    162.7500    194.5000 -48.0
+    166.5000    187.7500 -48.0
+    169.7500    178.5000 -48.0
+    171.7500    169.5000 -48.0
+    172.5000    167.7500 -48.0
+    172.7500    157.5000 -48.0
+    171.7500    155.5000 -48.0
+    171.7500    147.5000 -48.0
+    170.7500    145.5000 -48.0
+    170.7500    139.5000 -48.0
+    169.7500    137.5000 -48.0
+    169.7500    133.5000 -48.0
+    168.7500    131.5000 -48.0
+    168.7500    127.5000 -48.0
+    167.7500    125.5000 -48.0
+    167.7500    121.5000 -48.0
+    166.7500    119.5000 -48.0
+    166.7500    117.5000 -48.0
+    165.7500    115.5000 -48.0
+    165.7500    110.5000 -48.0
+    163.7500    106.5000 -48.0
+    163.7500    104.5000 -48.0
+    160.7500     98.5000 -48.0
+    160.7500     96.5000 -48.0
+    158.7500     92.5000 -48.0
+    158.7500     90.5000 -48.0
+    154.7500     84.5000 -48.0
+    153.7500     82.5000 -48.0
+    145.7500     74.5000 -48.0
+    139.5000     70.2500 -48.0
+    127.5000     64.2500 -48.0
+    122.5000     63.2500 -48.0
+    120.7500     62.5000 -48.0
+    115.5000     62.2500 -48.0
+    113.7500     61.5000 -48.0
+     81.7500     69.5000 -48.0
+     82.5000     68.7500 -48.0
+     87.5000     69.7500 -48.0
+     89.5000     68.7500 -48.0
+     92.5000     68.7500 -48.0
+     94.5000     69.7500 -48.0
+     99.5000     70.7500 -48.0
+    102.5000     71.7500 -48.0
+    102.7500     70.5000 -48.0
+    104.5000     68.7500 -48.0
+    106.5000     70.7500 -48.0
+    108.5000     69.7500 -48.0
+    110.5000     69.7500 -48.0
+    112.5000     68.7500 -48.0
+    115.5000     68.7500 -48.0
+    117.2500     69.5000 -48.0
+    123.5000     69.7500 -48.0
+    128.5000     71.7500 -48.0
+    132.2500     73.5000 -48.0
+    135.5000     73.7500 -48.0
+    138.2500     78.5000 -48.0
+    139.2500     80.5000 -48.0
+    140.5000     80.7500 -48.0
+    142.5000     82.7500 -48.0
+    144.5000     83.7500 -48.0
+    147.2500     87.5000 -48.0
+    149.2500     91.5000 -48.0
+    149.2500     93.5000 -48.0
+    152.2500     99.5000 -48.0
+    152.2500    103.5000 -48.0
+    158.2500    115.5000 -48.0
+    158.2500    117.5000 -48.0
+    160.2500    119.5000 -48.0
+    160.2500    121.5000 -48.0
+    161.2500    123.5000 -48.0
+    161.2500    125.5000 -48.0
+    162.2500    127.5000 -48.0
+    161.5000    128.2500 -48.0
+    161.2500    134.5000 -48.0
+    160.5000    136.2500 -48.0
+    160.2500    142.5000 -48.0
+    161.2500    144.5000 -48.0
+    161.2500    146.5000 -48.0
+    162.2500    148.5000 -48.0
+    162.2500    169.5000 -48.0
+    161.2500    176.5000 -48.0
+    159.5000    180.2500 -48.0
+    159.2500    182.5000 -48.0
+    146.5000    195.2500 -48.0
+    135.5000    204.2500 -48.0
+    131.5000    207.2500 -48.0
+    119.5000    213.2500 -48.0
+    116.5000    213.2500 -48.0
+    114.5000    214.2500 -48.0
+    109.5000    214.2500 -48.0
+    104.5000    213.2500 -48.0
+    102.5000    212.2500 -48.0
+    100.5000    213.2500 -48.0
+     98.5000    213.2500 -48.0
+     94.7500    211.5000 -48.0
+     93.5000    212.2500 -48.0
+     90.5000    212.2500 -48.0
+     88.7500    211.5000 -48.0
+     82.5000    211.2500 -48.0
+     72.5000    206.2500 -48.0
+     53.7500    186.5000 -48.0
+     51.7500    182.5000 -48.0
+     51.7500    180.5000 -48.0
+     49.7500    176.5000 -48.0
+     49.7500    174.5000 -48.0
+     47.7500    170.5000 -48.0
+     47.7500    164.5000 -48.0
+     46.7500    162.5000 -48.0
+     46.7500    148.5000 -48.0
+     47.7500    143.5000 -48.0
+     48.5000    141.7500 -48.0
+     48.7500    129.5000 -48.0
+     47.7500    127.5000 -48.0
+     49.7500    118.5000 -48.0
+     58.7500    100.5000 -48.0
+     59.5000     98.7500 -48.0
+     59.7500     94.5000 -48.0
+     61.7500     90.5000 -48.0
+     63.5000     89.7500 -48.0
+     63.7500     88.5000 -48.0
+     69.7500     81.5000 -48.0
+     72.5000     77.7500 -48.0
+     74.5000     77.7500 -48.0
+     76.5000     75.7500 -48.0
+     79.5000     70.7500 -48.0
+    101.2500     60.5000 -50.0
+    100.5000     61.2500 -50.0
+     94.5000     61.2500 -50.0
+     92.5000     62.2500 -50.0
+     89.5000     62.2500 -50.0
+     87.5000     63.2500 -50.0
+     85.5000     63.2500 -50.0
+     83.5000     64.2500 -50.0
+     81.5000     64.2500 -50.0
+     69.5000     70.2500 -50.0
+     63.5000     75.2500 -50.0
+     59.5000     78.2500 -50.0
+     55.2500     84.5000 -50.0
+     51.2500     92.5000 -50.0
+     49.5000     96.2500 -50.0
+     49.2500     99.5000 -50.0
+     46.2500    105.5000 -50.0
+     43.2500    120.5000 -50.0
+     41.2500    129.5000 -50.0
+     40.2500    132.5000 -50.0
+     39.5000    134.2500 -50.0
+     39.2500    137.5000 -50.0
+     38.2500    140.5000 -50.0
+     36.2500    149.5000 -50.0
+     35.2500    156.5000 -50.0
+     34.5000    158.2500 -50.0
+     34.2500    167.5000 -50.0
+     35.2500    169.5000 -50.0
+     35.2500    174.5000 -50.0
+     36.2500    176.5000 -50.0
+     36.2500    179.5000 -50.0
+     38.2500    183.5000 -50.0
+     38.5000    185.7500 -50.0
+     41.2500    192.5000 -50.0
+     46.2500    200.5000 -50.0
+     47.2500    202.5000 -50.0
+     59.2500    214.5000 -50.0
+     68.5000    219.7500 -50.0
+     75.5000    220.7500 -50.0
+     77.2500    221.5000 -50.0
+     84.5000    221.7500 -50.0
+     86.5000    222.7500 -50.0
+     88.5000    221.7500 -50.0
+     90.5000    221.7500 -50.0
+     92.2500    222.5000 -50.0
+    105.5000    222.7500 -50.0
+    110.5000    223.7500 -50.0
+    112.5000    222.7500 -50.0
+    125.5000    222.7500 -50.0
+    129.5000    220.7500 -50.0
+    131.7500    220.5000 -50.0
+    140.5000    216.7500 -50.0
+    144.5000    213.7500 -50.0
+    146.5000    212.7500 -50.0
+    157.7500    202.5000 -50.0
+    160.5000    198.7500 -50.0
+    163.7500    194.5000 -50.0
+    169.7500    182.5000 -50.0
+    170.7500    177.5000 -50.0
+    171.7500    175.5000 -50.0
+    172.7500    168.5000 -50.0
+    173.5000    166.7500 -50.0
+    173.7500    161.5000 -50.0
+    172.7500    159.5000 -50.0
+    172.7500    150.5000 -50.0
+    171.7500    148.5000 -50.0
+    171.7500    141.5000 -50.0
+    170.7500    139.5000 -50.0
+    170.7500    135.5000 -50.0
+    169.7500    133.5000 -50.0
+    169.7500    130.5000 -50
+    168.7500    128.5000 -50.0
+    168.7500    122.5000 -50.0
+    167.7500    120.5000 -50.0
+    167.7500    118.5000 -50.0
+    166.7500    116.5000 -50.0
+    166.7500    114.5000 -50.0
+    165.7500    112.5000 -50.0
+    165.7500    108.5000 -50.0
+    162.7500    102.5000 -50.0
+    162.7500    100.5000 -50.0
+    159.7500     94.5000 -50.0
+    159.5000     92.2500 -50.0
+    156.7500     85.5000 -50.0
+    152.7500     80.5000 -50.0
+    151.7500     78.5000 -50.0
+    145.5000     73.2500 -50.0
+    134.7500     66.5000 -50.0
+    132.5000     66.2500 -50.0
+    126.5000     63.2500 -50.0
+    121.5000     62.2500 -50.0
+    119.7500     61.5000 -50.0
+    114.5000     61.2500 -50.0
+    112.7500     60.5000 -50.0
+    112.7500     68.5000 -50.0
+    113.5000     67.7500 -50.0
+    114.2500     68.5000 -50.0
+    115.5000     67.7500 -50.0
+    117.5000     67.7500 -50.0
+    124.5000     68.7500 -50.0
+    129.5000     69.7500 -50.0
+    133.2500     72.5000 -50.0
+    135.5000     72.7500 -50.0
+    140.2500     78.5000 -50.0
+    141.5000     80.7500 -50.0
+    143.5000     81.7500 -50.0
+    149.2500     88.5000 -50.0
+    149.2500     90.5000 -50.0
+    152.2500     96.5000 -50.0
+    152.2500    100.5000 -50.0
+    153.2500    102.5000 -50.0
+    153.2500    104.5000 -50.0
+    156.2500    108.5000 -50.0
+    161.2500    118.5000 -50.0
+    161.2500    121.5000 -50.0
+    162.2500    123.5000 -50.0
+    162.2500    126.5000 -50.0
+    161.5000    128.2500 -50.0
+    161.2500    135.5000 -50.0
+    162.2500    137.5000 -50.0
+    162.2500    144.5000 -50.0
+    163.2500    146.5000 -50.0
+    163.2500    156.5000 -50.0
+    164.2500    158.5000 -50.0
+    164.2500    166.5000 -50.0
+    163.2500    173.5000 -50.0
+    162.2500    178.5000 -50.0
+    159.2500    184.5000 -50.0
+    144.5000    198.2500 -50.0
+    133.5000    207.2500 -50.0
+    124.5000    212.2500 -50.0
+    122.5000    212.2500 -50.0
+    118.5000    214.2500 -50.0
+    116.5000    214.2500 -50.0
+    114.5000    215.2500 -50.0
+    110.5000    215.2500 -50.0
+    108.7500    214.5000 -50.0
+     99.5000    214.2500 -50.0
+     95.7500    212.5000 -50.0
+     92.5000    212.2500 -50.0
+     90.5000    213.2500 -50.0
+     88.7500    212.5000 -50.0
+     84.5000    212.2500 -50.0
+     79.5000    211.2500 -50.0
+     71.5000    207.2500 -50.0
+     61.5000    197.2500 -50.0
+     56.7500    190.5000 -50.0
+     50.7500    185.5000 -50.0
+     50.7500    182.5000 -50.0
+     48.7500    178.5000 -50.0
+     48.7500    176.5000 -50.0
+     45.7500    170.5000 -50.0
+     45.7500    164.5000 -50.0
+     44.7500    162.5000 -50.0
+     45.5000    161.7500 -50.0
+     44.7500    160.5000 -50.0
+     44.7500    147.5000 -50.0
+     46.7500    141.5000 -50.0
+     47.5000    139.7500 -50.0
+     47.7500    127.5000 -50.0
+     46.7500    125.5000 -50.0
+     47.7500    124.5000 -50.0
+     49.7500    115.5000 -50.0
+     57.7500     99.5000 -50.0
+     58.5000     97.7500 -50.0
+     58.7500     93.5000 -50.0
+     60.7500     91.5000 -50.0
+     63.5000     87.7500 -50.0
+     63.7500     84.5000 -50.0
+     67.5000     81.7500 -50.0
+     69.5000     80.7500 -50.0
+     69.7500     79.5000 -50.0
+     71.5000     77.7500 -50.0
+     73.5000     76.7500 -50.0
+     79.5000     69.7500 -50.0
+     82.5000     69.7500 -50.0
+     84.5000     68.7500 -50.0
+     98.5000     68.7500 -50.0
+    100.2500     70.5000 -50.0
+    102.5000     70.7500 -50.0
+    102.7500     69.5000 -50.0
+    104.5000     68.7500 -50.0
+    106.5000     69.7500 -50.0
+    108.5000     68.7500 -50.0
+     39.7500    179.5000 -50.0
+     40.5000    178.7500 -50.0
+     41.2500    179.5000 -50.0
+     40.5000    180.2500 -50.0
+    100.2500     59.5000 -52.0
+     99.5000     60.2500 -52.0
+     94.5000     60.2500 -52.0
+     92.5000     61.2500 -52.0
+     90.5000     61.2500 -52.0
+     88.5000     62.2500 -52.0
+     86.5000     62.2500 -52.0
+     84.5000     63.2500 -52.0
+     82.2500     63.5000 -52.0
+     73.5000     67.2500 -52.0
+     65.5000     72.2500 -52.0
+     63.5000     73.2500 -52.0
+     58.5000     78.2500 -52.0
+     55.2500     82.5000 -52.0
+     52.2500     88.5000 -52.0
+     51.5000     90.2500 -52.0
+     48.2500     99.5000 -52.0
+     47.5000    101.2500 -52.0
+     45.2500    107.5000 -52.0
+     43.2500    116.5000 -52.0
+     41.2500    126.5000 -52.0
+     40.2500    128.5000 -52.0
+     39.2500    133.5000 -52.0
+     38.2500    136.5000 -52.0
+     36.2500    145.5000 -52.0
+     35.2500    150.5000 -52.0
+     34.5000    152.2500 -52.0
+     34.2500    156.5000 -52.0
+     33.5000    158.2500 -52.0
+     33.2500    169.5000 -52.0
+     34.2500    171.5000 -52.0
+     34.2500    175.5000 -52.0
+     35.2500    177.5000 -52.0
+     35.2500    180.5000 -52.0
+     37.2500    184.5000 -52.0
+     37.2500    186.5000 -52.0
+     41.2500    194.5000 -52.0
+     44.2500    199.5000 -52.0
+     45.2500    201.5000 -52.0
+     59.5000    215.7500 -52.0
+     68.2500    220.5000 -52.0
+     70.5000    220.7500 -52.0
+     72.2500    221.5000 -52.0
+     76.5000    221.7500 -52.0
+     78.2500    222.5000 -52.0
+     88.5000    222.7500 -52.0
+     90.2500    223.5000 -52.0
+    120.5000    223.7500 -52.0
+    122.5000    222.7500 -52.0
+    127.5000    222.7500 -52.0
+    133.7500    220.5000 -52.0
+    142.5000    216.7500 -52.0
+    147.5000    212.7500 -52.0
+    149.5000    211.7500 -52.0
+    160.5000    200.7500 -52.0
+    164.7500    194.5000 -52.0
+    170.7500    182.5000 -52.0
+    172.7500    173.5000 -52.0
+    173.5000    171.7500 -52.0
+    173.7500    153.5000 -52.0
+    172.7500    151.5000 -52.0
+    172.7500    144.5000 -52.0
+    171.7500    142.5000 -52.0
+    171.7500    137.5000 -52.0
+    170.7500    135.5000 -52.0
+    170.7500    132.5000 -52.0
+    169.7500    130.5000 -52.0
+    169.7500    126.5000 -52.0
+    168.7500    124.5000 -52.0
+    168.7500    120.5000 -52.0
+    167.7500    118.5000 -52.0
+    167.7500    116.5000 -52.0
+    166.7500    114.5000 -52.0
+    166.7500    112.5000 -52.0
+    165.7500    110.5000 -52.0
+    165.7500    108.5000 -52.0
+    164.7500    106.5000 -52.0
+    164.7500    104.5000 -52.0
+    161.7500     98.5000 -52.0
+    161.5000     96.2500 -52.0
+    158.5000     89.2500 -52.0
+    155.7500     82.5000 -52.0
+    150.5000     76.2500 -52.0
+    146.7500     73.5000 -52.0
+    140.5000     69.2500 -52.0
+    131.7500     64.5000 -52.0
+    125.5000     62.2500 -52.0
+    123.7500     61.5000 -52.0
+    115.5000     60.2500 -52.0
+    113.7500     59.5000 -52.0
+    108.5000     60.7500 -52.0
+    111.5000     60.7500 -52.0
+    113.2500     62.5000 -52.0
+    111.5000     64.2500 -52.0
+    108.5000     64.2500 -52.0
+    106.7500     62.5000 -52.0
+    119.7500     66.5000 -52.0
+    120.5000     65.7500 -52.0
+    123.5000     66.7500 -52.0
+    129.2500     69.5000 -52.0
+    131.5000     69.7500 -52.0
+    135.2500     72.5000 -52.0
+    137.5000     72.7500 -52.0
+    143.2500     78.5000 -52.0
+    143.2500     80.5000 -52.0
+    148.2500     85.5000 -52.0
+    148.2500     87.5000 -52.0
+    151.2500     91.5000 -52.0
+    151.2500     93.5000 -52.0
+    152.2500     95.5000 -52.0
+    152.2500     98.5000 -52.0
+    154.2500    102.5000 -52.0
+    154.2500    104.5000 -52.0
+    159.2500    110.5000 -52.0
+    159.2500    112.5000 -52.0
+    162.2500    118.5000 -52.0
+    162.2500    120.5000 -52.0
+    163.2500    123.5000 -52.0
+    162.2500    125.5000 -52.0
+    161.2500    132.5000 -52.0
+    162.2500    134.5000 -52.0
+    162.2500    138.5000 -52.0
+    163.2500    140.5000 -52.0
+    163.2500    142.5000 -52.0
+    164.2500    144.5000 -52.0
+    164.2500    147.5000 -52.0
+    165.2500    149.5000 -52.0
+    164.5000    150.2500 -52.0
+    164.2500    153.5000 -52.0
+    165.2500    155.5000 -52.0
+    165.2500    169.5000 -52.0
+    163.2500    178.5000 -52.0
+    159.2500    186.5000 -52.0
+    145.2500    199.5000 -52.0
+    138.5000    204.2500 -52.0
+    130.5000    210.2500 -52.0
+    124.5000    213.2500 -52.0
+    122.5000    213.2500 -52.0
+    118.5000    215.2500 -52.0
+    108.5000    215.2500 -52.0
+    101.5000    214.2500 -52.0
+     98.5000    215.2500 -52.0
+     96.7500    213.5000 -52.0
+     84.5000    213.2500 -52.0
+     79.5000    212.2500 -52.0
+     70.5000    208.2500 -52.0
+     65.7500    203.5000 -52.0
+     56.7500    193.5000 -52.0
+     55.7500    191.5000 -52.0
+     53.7500    190.5000 -52.0
+     52.7500    188.5000 -52.0
+     51.5000    188.2500 -52.0
+     48.7500    185.5000 -52.0
+     48.7500    182.5000 -52.0
+     47.7500    180.5000 -52.0
+     47.7500    178.5000 -52.0
+     45.7500    174.5000 -52.0
+     45.7500    172.5000 -52.0
+     43.7500    168.5000 -52.0
+     43.7500    155.5000 -52.0
+     42.7500    153.5000 -52.0
+     42.7500    148.5000 -52.0
+     44.7500    142.5000 -52.0
+     46.5000    138.7500 -52.0
+     46.7500    124.5000 -52.0
+     47.7500    119.5000 -52.0
+     49.7500    113.5000 -52.0
+     53.7500    104.5000 -52.0
+     56.5000    100.7500 -52.0
+     57.7500     94.5000 -52.0
+     58.7500     92.5000 -52.0
+     61.5000     88.7500 -52.0
+     61.7500     86.5000 -52.0
+     62.7500     83.5000 -52.0
+     67.7500     80.5000 -52.0
+     69.7500     76.5000 -52.0
+     71.5000     75.7500 -52.0
+     78.5000     69.7500 -52.0
+     80.5000     69.7500 -52.0
+     84.5000     67.7500 -52.0
+     89.5000     67.7500 -52.0
+     92.5000     68.7500 -52.0
+     94.5000     67.7500 -52.0
+     99.5000     67.7500 -52.0
+    100.2500     69.5000 -52.0
+    102.5000     69.7500 -52.0
+    104.5000     67.7500 -52.0
+    105.5000     68.7500 -52.0
+    109.5000     66.7500 -52.0
+    110.2500     67.5000 -52.0
+    116.5000     67.7500 -52.0
+     37.7500    179.5000 -52.0
+     38.5000    178.7500 -52.0
+     40.2500    179.5000 -52.0
+     39.5000    181.2500 -52.0
+    163.7500    187.5000 -52.0
+    164.5000    186.7500 -52.0
+    165.2500    187.5000 -52.0
+    164.5000    188.2500 -52.0
+     98.2500     58.5000 -54.0
+     97.5000     59.2500 -54.0
+     94.5000     59.2500 -54.0
+     92.5000     60.2500 -54.0
+     88.5000     60.2500 -54.0
+     84.5000     62.2500 -54.0
+     82.2500     62.5000 -54.0
+     69.5000     68.2500 -54.0
+     61.5000     74.2500 -54.0
+     59.5000     75.2500 -54.0
+     59.2500     76.5000 -54.0
+     56.2500     79.5000 -54.0
+     52.5000     86.2500 -54.0
+     50.2500     92.5000 -54.0
+     48.5000     96.2500 -54.0
+     48.2500     98.5000 -54.0
+     45.2500    104.5000 -54.0
+     44.2500    109.5000 -54.0
+     40.2500    127.5000 -54.0
+     39.2500    129.5000 -54.0
+     37.2500    138.5000 -54.0
+     36.2500    141.5000 -54.0
+     35.5000    143.2500 -54.0
+     35.2500    147.5000 -54.0
+     34.2500    150.5000 -54.0
+     33.5000    152.2500 -54.0
+     33.2500    156.5000 -54.0
+     32.5000    158.2500 -54.0
+     32.2500    170.5000 -54.0
+     33.2500    172.5000 -54.0
+     33.2500    175.5000 -54.0
+     34.2500    177.5000 -54.0
+     34.2500    179.5000 -54.0
+     37.5000    188.7500 -54.0
+     40.2500    195.5000 -54.0
+     46.2500    203.5000 -54.0
+     47.2500    205.5000 -54.0
+     49.5000    207.7500 -54.0
+     51.5000    208.7500 -54.0
+     52.5000    210.7500 -54.0
+     54.5000    211.7500 -54.0
+     59.5000    216.7500 -54.0
+     68.2500    221.5000 -54.0
+     76.5000    222.7500 -54.0
+     85.5000    223.7500 -54.0
+     92.5000    224.7500 -54.0
+     94.5000    223.7500 -54.0
+     98.5000    223.7500 -54.0
+    100.2500    224.5000 -54.0
+    114.5000    224.7500 -54.0
+    116.5000    223.7500 -54.0
+    125.5000    223.7500 -54.0
+    127.5000    222.7500 -54.0
+    129.5000    222.7500 -54.0
+    131.5000    221.7500 -54.0
+    133.7500    221.5000 -54.0
+    142.5000    217.7500 -54.0
+    147.5000    213.7500 -54.0
+    149.5000    212.7500 -54.0
+    157.5000    204.7500 -54.0
+    163.7500    197.5000 -54.0
+    170.5000    184.7500 -54.0
+    170.7500    182.5000 -54.0
+    172.7500    178.5000 -54.0
+    173.7500    173.5000 -54.0
+    174.5000    171.7500 -54.0
+    174.7500    156.5000 -54.0
+    173.7500    154.5000 -54.0
+    173.7500    147.5000 -54.0
+    172.7500    145.5000 -54.0
+    172.7500    140.5000 -54.0
+    171.7500    138.5000 -54.0
+    171.7500    134.5000 -54.0
+    170.7500    132.5000 -54.0
+    170.7500    129.5000 -54.0
+    169.7500    127.5000 -54.0
+    169.7500    123.5000 -54.0
+    168.7500    121.5000 -54.0
+    168.7500    118.5000 -54.0
+    167.7500    116.5000 -54.0
+    167.7500    113.5000 -54.0
+    165.7500    109.5000 -54.0
+    165.7500    107.5000 -54.0
+    164.7500    105.5000 -54.0
+    164.7500    103.5000 -54.0
+    161.7500     97.5000 -54.0
+    161.5000     95.2500 -54.0
+    157.5000     86.2500 -54.0
+    154.7500     79.5000 -54.0
+    151.7500     76.5000 -54.0
+    145.7500     71.5000 -54.0
+    140.5000     68.2500 -54.0
+    129.7500     62.5000 -54.0
+    127.5000     62.2500 -54.0
+    123.5000     60.2500 -54.0
+    116.5000     59.2500 -54.0
+    114.7500     58.5000 -54.0
+    106.7500     60.5000 -54.0
+    107.5000     59.7500 -54.0
+    111.5000     59.7500 -54.0
+    113.2500     60.5000 -54.0
+    114.2500     62.5000 -54.0
+    112.5000     63.2500 -54.0
+    110.5000     64.2500 -54.0
+    106.5000     64.2500 -54.0
+    105.7500     62.5000 -54.0
+     98.7500     61.5000 -54.0
+     99.5000     60.7500 -54.0
+    101.5000     60.7500 -54.0
+    103.2500     61.5000 -54.0
+    102.5000     63.2500 -54.0
+     99.5000     63.2500 -54.0
+    119.7500     65.5000 -54.0
+    120.5000     64.7500 -54.0
+    122.5000     64.7500 -54.0
+    125.5000     65.7500 -54.0
+    129.2500     68.5000 -54.0
+    134.2500     71.5000 -54.0
+    137.5000     71.7500 -54.0
+    141.2500     74.5000 -54.0
+    144.2500     78.5000 -54.0
+    144.2500     80.5000 -54.0
+    149.2500     85.5000 -54.0
+    149.2500     87.5000 -54.0
+    153.2500     95.5000 -54.0
+    153.2500     98.5000 -54.0
+    155.2500    103.5000 -54.0
+    160.2500    109.5000 -54.0
+    160.2500    111.5000 -54.0
+    163.2500    117.5000 -54.0
+    163.2500    123.5000 -54.0
+    162.5000    125.2500 -54.0
+    162.2500    135.5000 -54.0
+    163.2500    137.5000 -54.0
+    163.2500    139.5000 -54.0
+    164.2500    141.5000 -54.0
+    164.2500    143.5000 -54.0
+    165.2500    145.5000 -54.0
+    165.2500    156.5000 -54.0
+    166.2500    158.5000 -54.0
+    166.2500    171.5000 -54.0
+    165.2500    174.5000 -54.0
+    164.5000    176.2500 -54.0
+    164.2500    179.5000 -54.0
+    163.2500    182.5000 -54.0
+    159.2500    187.5000 -54.0
+    158.2500    189.5000 -54.0
+    148.5000    198.2500 -54.0
+    144.5000    201.2500 -54.0
+    130.5000    211.2500 -54.0
+    125.5000    214.2500 -54.0
+    122.5000    214.2500 -54.0
+    120.5000    215.2500 -54.0
+    118.5000    215.2500 -54.0
+    114.5000    217.2500 -54.0
+    111.5000    217.2500 -54.0
+    108.5000    216.2500 -54.0
+    106.7500    215.5000 -54.0
+     99.5000    215.2500 -54.0
+     97.7500    214.5000 -54.0
+     92.5000    214.2500 -54.0
+     90.5000    215.2500 -54.0
+     83.5000    214.2500 -54.0
+     74.5000    212.2500 -54.0
+     67.5000    206.2500 -54.0
+     65.5000    205.2500 -54.0
+     50.7500    189.5000 -54.0
+     49.7500    187.5000 -54.0
+     48.5000    187.2500 -54.0
+     47.7500    185.5000 -54.0
+     46.7500    183.5000 -54.0
+     46.7500    181.5000 -54.0
+     45.7500    179.5000 -54.0
+     45.7500    177.5000 -54.0
+     42.7500    171.5000 -54.0
+     42.7500    163.5000 -54.0
+     41.7500    161.5000 -54.0
+     41.7500    146.5000 -54.0
+     45.5000    138.7500 -54.0
+     45.7500    136.5000 -54.0
+     46.7500    131.5000 -54.0
+     45.7500    129.5000 -54.0
+     45.7500    123.5000 -54.0
+     46.7500    121.5000 -54.0
+     47.7500    116.5000 -54.0
+     49.5000    112.7500 -54.0
+     49.7500    110.5000 -54.0
+     52.7500    104.5000 -54.0
+     56.5000     97.7500 -54.0
+     56.7500     95.5000 -54.0
+     59.5000     89.7500 -54.0
+     59.7500     85.5000 -54.0
+     63.5000     81.7500 -54.0
+     65.5000     80.7500 -54.0
+     69.5000     75.7500 -54.0
+     73.5000     73.7500 -54.0
+     76.5000     70.7500 -54.0
+     83.5000     66.7500 -54.0
+     92.5000     66.7500 -54.0
+     94.5000     65.7500 -54.0
+     99.5000     66.7500 -54.0
+    101.5000     68.7500 -54.0
+    103.5000     67.7500 -54.0
+    105.5000     67.7500 -54.0
+    109.5000     65.7500 -54.0
+    110.2500     66.5000 -54.0
+    116.5000     66.7500 -54.0
+     37.7500    180.5000 -54.0
+     38.5000    179.7500 -54.0
+     39.2500    180.5000 -54.0
+     38.5000    181.2500 -54.0
+     97.2500     57.5000 -56.0
+     96.5000     58.2500 -56.0
+     92.5000     58.2500 -56.0
+     90.5000     59.2500 -56.0
+     88.5000     59.2500 -56.0
+     84.5000     61.2500 -56.0
+     82.5000     61.2500 -56.0
+     68.5000     68.2500 -56.0
+     66.2500     69.5000 -56.0
+     59.5000     74.2500 -56.0
+     56.2500     78.5000 -56.0
+     52.2500     86.5000 -56.0
+     49.5000     92.2500 -56.0
+     49.2500     94.5000 -56.0
+     45.2500    102.5000 -56.0
+     43.2500    112.5000 -56.0
+     42.2500    115.5000 -56.0
+     40.2500    124.5000 -56.0
+     39.2500    126.5000 -56.0
+     38.2500    133.5000 -56.0
+     36.2500    137.5000 -56.0
+     34.2500    147.5000 -56.0
+     33.2500    149.5000 -56.0
+     32.2500    158.5000 -56.0
+     31.5000    160.2500 -56.0
+     31.2500    171.5000 -56.0
+     32.2500    173.5000 -56.0
+     32.2500    175.5000 -56.0
+     33.2500    177.5000 -56.0
+     33.2500    179.5000 -56.0
+     36.5000    188.7500 -56.0
+     39.2500    195.5000 -56.0
+     45.2500    203.5000 -56.0
+     46.2500    205.5000 -56.0
+     59.2500    217.5000 -56.0
+     66.2500    221.5000 -56.0
+     72.5000    222.7500 -56.0
+     74.2500    223.5000 -56.0
+     82.5000    223.7500 -56.0
+     84.2500    224.5000 -56.0
+    101.5000    224.7500 -56.0
+    103.2500    225.5000 -56.0
+    111.5000    225.7500 -56.0
+    113.5000    224.7500 -56.0
+    122.5000    224.7500 -56.0
+    124.5000    223.7500 -56.0
+    128.5000    223.7500 -56.0
+    130.5000    222.7500 -56.0
+    132.7500    222.5000 -56.0
+    139.5000    219.7500 -56.0
+    147.5000    214.7500 -56.0
+    149.5000    213.7500 -56.0
+    158.5000    204.7500 -56.0
+    163.5000    198.7500 -56.0
+    166.7500    193.5000 -56.0
+    168.7500    189.5000 -56.0
+    170.5000    185.7500 -56.0
+    173.7500    176.5000 -56.0
+    174.5000    174.7500 -56.0
+    174.7500    152.5000 -56.0
+    173.7500    150.5000 -56.0
+    173.7500    144.5000 -56.0
+    172.7500    142.5000 -56.0
+    172.7500    138.5000 -56.0
+    171.7500    136.5000 -56.0
+    171.7500    132.5000 -56.0
+    170.7500    130.5000 -56.0
+    170.7500    127.5000 -56.0
+    169.7500    125.5000 -56.0
+    169.7500    122.5000 -56.0
+    168.7500    120.5000 -56.0
+    168.7500    117.5000 -56.0
+    167.7500    115.5000 -56.0
+    167.7500    112.5000 -56.0
+    165.7500    108.5000 -56.0
+    165.7500    106.5000 -56.0
+    164.7500    104.5000 -56.0
+    164.7500    102.5000 -56.0
+    160.7500     94.5000 -56.0
+    160.7500     92.5000 -56.0
+    154.7500     80.5000 -56.0
+    154.7500     78.5000 -56.0
+    148.7500     72.5000 -56.0
+    140.5000     67.2500 -56.0
+    124.5000     59.2500 -56.0
+    117.5000     58.2500 -56.0
+    115.7500     57.5000 -56.0
+     99.7500     59.5000 -56.0
+    101.5000     58.7500 -56.0
+    103.2500     59.5000 -56.0
+    104.2500     61.5000 -56.0
+    103.5000     63.2500 -56.0
+     97.5000     63.2500 -56.0
+     95.7500     61.5000 -56.0
+     97.5000     59.7500 -56.0
+    105.7500     59.5000 -56.0
+    106.5000     58.7500 -56.0
+    111.5000     58.7500 -56.0
+    113.2500     59.5000 -56.0
+    114.2500     61.5000 -56.0
+    111.5000     63.2500 -56.0
+    109.5000     63.2500 -56.0
+    107.5000     64.2500 -56.0
+    105.5000     63.2500 -56.0
+    104.7500     61.5000 -56.0
+    114.7500     60.5000 -56.0
+    115.5000     59.7500 -56.0
+    117.5000     59.7500 -56.0
+    119.2500     61.5000 -56.0
+    116.5000     63.2500 -56.0
+    115.7500     62.5000 -56.0
+    119.7500     64.5000 -56.0
+    120.5000     63.7500 -56.0
+    122.5000     63.7500 -56.0
+    127.5000     65.7500 -56.0
+    130.2500     68.5000 -56.0
+    135.2500     71.5000 -56.0
+    139.5000     71.7500 -56.0
+    144.2500     76.5000 -56.0
+    144.2500     78.5000 -56.0
+    146.5000     81.7500 -56.0
+    148.5000     82.7500 -56.0
+    150.2500     85.5000 -56.0
+    150.2500     89.5000 -56.0
+    153.2500     95.5000 -56.0
+    153.2500     97.5000 -56.0
+    155.2500    101.5000 -56.0
+    161.2500    109.5000 -56.0
+    161.2500    111.5000 -56.0
+    163.2500    115.5000 -56.0
+    163.2500    118.5000 -56.0
+    164.2500    120.5000 -56.0
+    162.5000    124.2500 -56.0
+    162.2500    133.5000 -56.0
+    163.2500    135.5000 -56.0
+    163.2500    139.5000 -56.0
+    165.2500    143.5000 -56.0
+    165.2500    147.5000 -56.0
+    166.2500    149.5000 -56.0
+    166.2500    159.5000 -56.0
+    167.2500    161.5000 -56.0
+    167.2500    169.5000 -56.0
+    166.5000    171.2500 -56.0
+    165.2500    179.5000 -56.0
+    163.5000    183.2500 -56.0
+    159.5000    189.2500 -56.0
+    146.2500    201.5000 -56.0
+    139.5000    206.2500 -56.0
+    137.2500    207.5000 -56.0
+    130.5000    212.2500 -56.0
+    124.5000    215.2500 -56.0
+    121.5000    215.2500 -56.0
+    119.5000    216.2500 -56.0
+    117.5000    216.2500 -56.0
+    113.5000    218.2500 -56.0
+    110.5000    218.2500 -56.0
+    107.5000    217.2500 -56.0
+    105.7500    216.5000 -56.0
+    100.5000    216.2500 -56.0
+     98.7500    215.5000 -56.0
+     92.5000    215.2500 -56.0
+     90.5000    216.2500 -56.0
+     88.5000    216.2500 -56.0
+     86.5000    215.2500 -56.0
+     77.5000    214.2500 -56.0
+     74.5000    213.2500 -56.0
+     70.5000    210.2500 -56.0
+     68.5000    209.2500 -56.0
+     45.7500    185.5000 -56.0
+     45.7500    182.5000 -56.0
+     43.7500    178.5000 -56.0
+     43.7500    176.5000 -56.0
+     40.7500    170.5000 -56.0
+     41.7500    168.5000 -56.0
+     40.7500    166.5000 -56.0
+     40.7500    147.5000 -56.0
+     41.7500    144.5000 -56.0
+     44.5000    138.7500 -56.0
+     44.7500    136.5000 -56.0
+     45.5000    134.7500 -56.0
+     45.7500    126.5000 -56.0
+     44.7500    124.5000 -56.0
+     45.7500    119.5000 -56.0
+     47.7500    115.5000 -56.0
+     48.7500    110.5000 -56.0
+     51.5000    104.7500 -56.0
+     55.5000     97.7500 -56.0
+     55.7500     95.5000 -56.0
+     57.5000     91.7500 -56.0
+     57.7500     88.5000 -56.0
+     58.7500     85.5000 -56.0
+     63.5000     80.7500 -56.0
+     65.5000     79.7500 -56.0
+     66.7500     77.5000 -56.0
+     67.7500     75.5000 -56.0
+     72.5000     73.7500 -56.0
+     72.7500     72.5000 -56.0
+     74.5000     71.7500 -56.0
+     80.5000     67.7500 -56.0
+     84.5000     65.7500 -56.0
+     87.5000     65.7500 -56.0
+     90.5000     64.7500 -56.0
+     99.5000     65.7500 -56.0
+    101.2500     66.5000 -56.0
+    106.5000     66.7500 -56.0
+    108.5000     65.7500 -56.0
+    115.5000     65.7500 -56.0
+    117.5000     64.7500 -56.0
+     69.7500     70.5000 -56.0
+     70.5000     69.7500 -56.0
+     71.2500     70.5000 -56.0
+     70.5000     71.2500 -56.0
+    104.2500     55.5000 -58.0
+    103.5000     56.2500 -58.0
+     96.5000     56.2500 -58.0
+     94.5000     57.2500 -58.0
+     90.5000     57.2500 -58.0
+     86.5000     59.2500 -58.0
+     84.5000     59.2500 -58.0
+     64.5000     69.2500 -58.0
+     58.2500     74.5000 -58.0
+     49.5000     91.2500 -58.0
+     49.2500     93.5000 -58.0
+     44.2500    103.5000 -58.0
+     43.2500    110.5000 -58.0
+     42.5000    112.2500 -58.0
+     41.2500    120.5000 -58.0
+     39.2500    124.5000 -58.0
+     38.2500    131.5000 -58.0
+     36.2500    135.5000 -58.0
+     34.2500    144.5000 -58.0
+     33.2500    146.5000 -58.0
+     32.2500    153.5000 -58.0
+     31.5000    155.2500 -58.0
+     31.2500    160.5000 -58.0
+     30.5000    162.2500 -58.0
+     30.2500    170.5000 -58.0
+     31.2500    172.5000 -58.0
+     31.2500    176.5000 -58.0
+     33.2500    180.5000 -58.0
+     33.2500    183.5000 -58.0
+     42.2500    201.5000 -58.0
+     47.2500    207.5000 -58.0
+     56.2500    215.5000 -58.0
+     60.5000    218.7500 -58.0
+     67.2500    222.5000 -58.0
+     69.5000    222.7500 -58.0
+     71.2500    223.5000 -58.0
+     78.5000    223.7500 -58.0
+     80.2500    224.5000 -58.0
+     85.5000    224.7500 -58.0
+     87.2500    225.5000 -58.0
+     93.5000    225.7500 -58.0
+     95.5000    224.7500 -58.0
+     97.2500    225.5000 -58.0
+    118.5000    225.7500 -58.0
+    120.5000    224.7500 -58.0
+    127.5000    224.7500 -58.0
+    129.5000    223.7500 -58.0
+    131.7500    223.5000 -58.0
+    144.5000    217.7500 -58.0
+    148.5000    214.7500 -58.0
+    150.5000    213.7500 -58.0
+    158.5000    205.7500 -58.0
+    163.5000    199.7500 -58.0
+    167.7500    192.5000 -58.0
+    172.7500    182.5000 -58.0
+    173.7500    177.5000 -58.0
+    174.5000    175.7500 -58.0
+    174.7500    170.5000 -58.0
+    175.5000    168.7500 -58.0
+    175.7500    159.5000 -58.0
+    174.7500    157.5000 -58.0
+    174.7500    149.5000 -58.0
+    173.7500    147.5000 -58.0
+    173.7500    140.5000 -58.0
+    172.7500    138.5000 -58.0
+    172.7500    136.5000 -58.0
+    171.7500    134.5000 -58.0
+    171.7500    130.5000 -58.0
+    170.7500    128.5000 -58.0
+    170.7500    126.5000 -58.0
+    169.7500    124.5000 -58.0
+    169.7500    121.5000 -58.0
+    168.7500    119.5000 -58.0
+    168.7500    116.5000 -58.0
+    167.7500    114.5000 -58.0
+    167.7500    112.5000 -58.0
+    166.7500    110.5000 -58.0
+    166.7500    108.5000 -58.0
+    164.7500    104.5000 -58.0
+    164.7500    102.5000 -58.0
+    162.7500     98.5000 -58.0
+    162.7500     96.5000 -58.0
+    158.7500     88.5000 -58.0
+    158.7500     86.5000 -58.0
+    155.7500     82.5000 -58.0
+    153.7500     76.5000 -58.0
+    148.7500     71.5000 -58.0
+    140.5000     66.2500 -58.0
+    131.5000     61.2500 -58.0
+    125.5000     58.2500 -58.0
+    120.5000     57.2500 -58.0
+    118.7500     56.5000 -58.0
+    111.5000     56.2500 -58.0
+    109.7500     55.5000 -58.0
+     99.7500     58.5000 -58.0
+    100.5000     57.7500 -58.0
+    102.5000     57.7500 -58.0
+    104.5000     58.7500 -58.0
+    106.5000     57.7500 -58.0
+    112.5000     57.7500 -58.0
+    121.5000     59.7500 -58.0
+    123.2500     61.5000 -58.0
+    121.5000     63.2500 -58.0
+    117.5000     63.2500 -58.0
+    113.5000     61.2500 -58.0
+    109.5000     63.2500 -58.0
+    107.5000     63.2500 -58.0
+    105.5000     62.2500 -58.0
+    103.5000     63.2500 -58.0
+     94.5000     63.2500 -58.0
+     90.7500     61.5000 -58.0
+     94.5000     58.7500 -58.0
+    118.7500     64.5000 -58.0
+    119.5000     63.7500 -58.0
+    123.5000     63.7500 -58.0
+    128.5000     65.7500 -58.0
+    132.5000     69.7500 -58.0
+    134.5000     70.7500 -58.0
+    136.2500     71.5000 -58.0
+    140.5000     71.7500 -58.0
+    142.2500     73.5000 -58.0
+    146.5000     80.7500 -58.0
+    148.5000     81.7500 -58.0
+    151.2500     86.5000 -58.0
+    151.2500     90.5000 -58.0
+    152.2500     92.5000 -58.0
+    154.5000     98.7500 -58.0
+    162.2500    108.5000 -58.0
+    162.2500    110.5000 -58.0
+    163.2500    112.5000 -58.0
+    163.2500    116.5000 -58.0
+    164.2500    118.5000 -58.0
+    163.2500    123.5000 -58.0
+    162.5000    125.2500 -58.0
+    163.2500    126.5000 -58.0
+    163.2500    137.5000 -58.0
+    165.2500    141.5000 -58.0
+    165.2500    143.5000 -58.0
+    166.2500    145.5000 -58.0
+    166.2500    150.5000 -58.0
+    167.2500    152.5000 -58.0
+    167.2500    172.5000 -58.0
+    166.5000    174.2500 -58.0
+    166.2500    179.5000 -58.0
+    164.5000    183.2500 -58.0
+    160.2500    189.5000 -58.0
+    159.2500    191.5000 -58.0
+    157.5000    192.2500 -58.0
+    151.5000    198.2500 -58.0
+    144.5000    204.2500 -58.0
+    140.5000    206.2500 -58.0
+    135.5000    210.2500 -58.0
+    123.5000    216.2500 -58.0
+    121.5000    216.2500 -58.0
+    119.5000    217.2500 -58.0
+    117.5000    217.2500 -58.0
+    115.5000    218.2500 -58.0
+    108.5000    218.2500 -58.0
+    106.7500    217.5000 -58.0
+    101.5000    217.2500 -58.0
+     95.5000    215.2500 -58.0
+     91.5000    217.2500 -58.0
+     87.5000    217.2500 -58.0
+     82.5000    216.2500 -58.0
+     80.7500    215.5000 -58.0
+     76.5000    215.2500 -58.0
+     70.5000    212.2500 -58.0
+     55.7500    198.5000 -58.0
+     54.7500    196.5000 -58.0
+     43.7500    184.5000 -58.0
+     43.7500    182.5000 -58.0
+     42.7500    180.5000 -58.0
+     42.7500    177.5000 -58.0
+     39.7500    171.5000 -58.0
+     39.7500    149.5000 -58.0
+     40.7500    142.5000 -58.0
+     43.7500    136.5000 -58.0
+     44.7500    131.5000 -58.0
+     45.5000    129.7500 -58.0
+     45.7500    125.5000 -58.0
+     44.7500    123.5000 -58.0
+     45.7500    116.5000 -58.0
+     46.7500    113.5000 -58.0
+     51.5000    102.7500 -58.0
+     55.5000     95.7500 -58.0
+     55.7500     93.5000 -58.0
+     56.7500     88.5000 -58.0
+     57.7500     85.5000 -58.0
+     62.5000     80.7500 -58.0
+     64.7500     79.5000 -58.0
+     66.7500     75.5000 -58.0
+     72.5000     71.7500 -58.0
+     86.5000     64.7500 -58.0
+     99.5000     64.7500 -58.0
+    105.5000     66.7500 -58.0
+    109.5000     64.7500 -58.0
+     68.5000     69.7500 -58.0
+     70.2500     70.5000 -58.0
+     68.5000     72.2500 -58.0
+     66.7500     71.5000 -58.0
+     34.7500    175.5000 -58.0
+     35.5000    174.7500 -58.0
+     36.2500    176.5000 -58.0
+     35.5000    178.2500 -58.0
+     34.7500    177.5000 -58.0
+    169.7500    177.5000 -58.0
+    170.5000    176.7500 -58.0
+    171.2500    177.5000 -58.0
+    170.5000    178.2500 -58.0
+    100.2500     54.5000 -60.0
+     99.5000     55.2500 -60.0
+     93.5000     55.2500 -60.0
+     91.5000     56.2500 -60.0
+     88.5000     56.2500 -60.0
+     62.5000     69.2500 -60.0
+     59.5000     72.2500 -60.0
+     56.2500     77.5000 -60.0
+     49.2500     91.5000 -60.0
+     46.2500     98.5000 -60.0
+     44.5000    102.2500 -60.0
+     41.2500    118.5000 -60.0
+     40.2500    120.5000 -60.0
+     39.2500    125.5000 -60.0
+     37.2500    131.5000 -60.0
+     36.5000    133.2500 -60.0
+     36.2500    136.5000 -60.0
+     34.2500    140.5000 -60.0
+     32.2500    150.5000 -60.0
+     31.5000    152.2500 -60.0
+     31.2500    156.5000 -60.0
+     30.5000    158.2500 -60.0
+     30.2500    174.5000 -60.0
+     31.2500    176.5000 -60.0
+     31.2500    179.5000 -60.0
+     33.2500    183.5000 -60.0
+     33.2500    185.5000 -60.0
+     41.2500    201.5000 -60.0
+     47.2500    208.5000 -60.0
+     54.5000    214.7500 -60.0
+     58.2500    217.5000 -60.0
+     62.5000    220.7500 -60.0
+     66.5000    222.7500 -60.0
+     71.5000    223.7500 -60.0
+     73.2500    224.5000 -60.0
+     82.5000    224.7500 -60.0
+     84.2500    225.5000 -60.0
+    101.5000    225.7500 -60.0
+    103.2500    226.5000 -60.0
+    109.5000    226.7500 -60.0
+    111.5000    225.7500 -60.0
+    123.5000    225.7500 -60.0
+    125.5000    224.7500 -60.0
+    130.5000    224.7500 -60.0
+    148.5000    215.7500 -60.0
+    156.5000    208.7500 -60.0
+    162.7500    201.5000 -60.0
+    167.7500    193.5000 -60.0
+    170.7500    187.5000 -60.0
+    171.5000    185.7500 -60.0
+    173.7500    179.5000 -60.0
+    174.5000    177.7500 -60.0
+    174.7500    173.5000 -60.0
+    175.5000    171.7500 -60.0
+    175.7500    154.5000 -60.0
+    174.7500    152.5000 -60.0
+    174.7500    145.5000 -60.0
+    173.7500    143.5000 -60.0
+    173.7500    139.5000 -60.0
+    172.7500    137.5000 -60.0
+    172.7500    134.5000 -60.0
+    171.7500    132.5000 -60.0
+    171.7500    129.5000 -60.0
+    170.7500    127.5000 -60.0
+    170.7500    125.5000 -60.0
+    169.7500    123.5000 -60.0
+    169.7500    120.5000 -60.0
+    168.7500    118.5000 -60.0
+    168.7500    116.5000 -60.0
+    167.7500    114.5000 -60.0
+    167.7500    112.5000 -60.0
+    160.7500     91.5000 -60.0
+    152.7500     74.5000 -60.0
+    148.7500     70.5000 -60.0
+    135.5000     62.2500 -60.0
+    124.5000     56.2500 -60.0
+    117.5000     55.2500 -60.0
+    115.7500     54.5000 -60.0
+     97.7500     57.5000 -60.0
+     98.5000     56.7500 -60.0
+    103.5000     56.7500 -60.0
+    105.2500     58.5000 -60.0
+    107.5000     56.7500 -60.0
+    115.5000     56.7500 -60.0
+    117.5000     57.7500 -60.0
+    122.5000     58.7500 -60.0
+    126.2500     61.5000 -60.0
+    124.5000     63.2500 -60.0
+    120.5000     63.2500 -60.0
+    117.5000     62.2500 -60.0
+    115.7500     61.5000 -60.0
+    112.5000     61.2500 -60.0
+    107.5000     63.2500 -60.0
+    105.5000     62.2500 -60.0
+    103.5000     63.2500 -60.0
+     99.5000     63.2500 -60.0
+     96.5000     62.2500 -60.0
+     94.5000     63.2500 -60.0
+     88.5000     63.2500 -60.0
+     84.5000     65.2500 -60.0
+     82.5000     65.2500 -60.0
+     81.7500     63.5000 -60.0
+     85.5000     60.7500 -60.0
+     87.5000     60.7500 -60.0
+     93.5000     57.7500 -60.0
+     96.7500     64.5000 -60.0
+     97.5000     63.7500 -60.0
+     99.2500     64.5000 -60.0
+    101.5000     64.7500 -60.0
+    103.2500     65.5000 -60.0
+    107.5000     65.7500 -60.0
+    111.5000     63.7500 -60.0
+    113.2500     64.5000 -60.0
+    121.5000     64.7500 -60.0
+    123.5000     63.7500 -60.0
+    126.5000     64.7500 -60.0
+    132.2500     67.5000 -60.0
+    133.2500     69.5000 -60.0
+    134.5000     69.7500 -60.0
+    136.2500     71.5000 -60.0
+    138.5000     71.7500 -60.0
+    142.2500     73.5000 -60.0
+    144.2500     77.5000 -60.0
+    148.2500     81.5000 -60.0
+    151.2500     85.5000 -60.0
+    151.2500     87.5000 -60.0
+    152.2500     89.5000 -60.0
+    152.2500     91.5000 -60.0
+    154.2500     97.5000 -60.0
+    158.2500    101.5000 -60.0
+    163.2500    109.5000 -60.0
+    163.2500    114.5000 -60.0
+    164.2500    116.5000 -60.0
+    164.2500    118.5000 -60.0
+    163.5000    120.2500 -60.0
+    163.2500    134.5000 -60.0
+    164.2500    136.5000 -60.0
+    164.2500    138.5000 -60.0
+    165.2500    140.5000 -60.0
+    165.2500    142.5000 -60.0
+    166.2500    144.5000 -60.0
+    166.2500    146.5000 -60.0
+    167.2500    148.5000 -60.0
+    167.2500    162.5000 -60.0
+    168.2500    164.5000 -60.0
+    167.5000    166.2500 -60.0
+    167.2500    173.5000 -60.0
+    166.2500    180.5000 -60.0
+    163.2500    186.5000 -60.0
+    152.5000    199.2500 -60.0
+    150.5000    200.2500 -60.0
+    148.2500    202.5000 -60.0
+    141.5000    207.2500 -60.0
+    133.5000    212.2500 -60.0
+    123.5000    217.2500 -60.0
+    120.5000    217.2500 -60.0
+    118.5000    218.2500 -60.0
+    114.5000    218.2500 -60.0
+    112.5000    219.2500 -60.0
+    103.5000    218.2500 -60.0
+     98.5000    217.2500 -60.0
+     96.7500    216.5000 -60.0
+     95.5000    217.2500 -60.0
+     79.5000    217.2500 -60.0
+     69.5000    212.2500 -60.0
+     55.7500    199.5000 -60.0
+     46.7500    189.5000 -60.0
+     44.7500    185.5000 -60.0
+     41.7500    182.5000 -60.0
+     41.7500    180.5000 -60.0
+     40.7500    178.5000 -60.0
+     40.7500    176.5000 -60.0
+     38.7500    172.5000 -60.0
+     38.7500    154.5000 -60.0
+     39.5000    152.7500 -60.0
+     38.7500    151.5000 -60.0
+     39.5000    149.7500 -60.0
+     39.7500    143.5000 -60.0
+     41.7500    139.5000 -60.0
+     42.7500    134.5000 -60.0
+     44.7500    130.5000 -60.0
+     45.7500    125.5000 -60.0
+     43.7500    121.5000 -60.0
+     44.7500    120.5000 -60.0
+     45.7500    113.5000 -60.0
+     48.7500    107.5000 -60.0
+     49.7500    102.5000 -60.0
+     50.5000    100.7500 -60.0
+     53.7500     96.5000 -60.0
+     54.7500     94.5000 -60.0
+     55.5000     92.7500 -60.0
+     55.7500     89.5000 -60.0
+     57.7500     84.5000 -60.0
+     61.5000     80.7500 -60.0
+     63.7500     79.5000 -60.0
+     64.7500     77.5000 -60.0
+     70.5000     71.7500 -60.0
+     78.5000     67.7500 -60.0
+     82.5000     67.7500 -60.0
+     88.5000     64.7500 -60.0
+     65.7500     71.5000 -60.0
+     66.5000     70.7500 -60.0
+     68.2500     71.5000 -60.0
+     67.5000     72.2500 -60.0
+    154.7500     95.5000 -60.0
+    155.5000     94.7500 -60.0
+    156.2500     95.5000 -60.0
+    155.5000     96.2500 -60.0
+    170.7500    173.5000 -60.0
+    171.5000    172.7500 -60.0
+    172.2500    173.5000 -60.0
+    171.5000    175.2500 -60.0
+     95.2500     53.5000 -62.0
+     94.5000     54.2500 -62.0
+     92.5000     54.2500 -62.0
+     90.5000     55.2500 -62.0
+     87.5000     55.2500 -62.0
+     65.5000     66.2500 -62.0
+     60.5000     70.2500 -62.0
+     55.2500     78.5000 -62.0
+     49.5000     89.2500 -62.0
+     49.2500     91.5000 -62.0
+     44.2500    101.5000 -62.0
+     43.2500    108.5000 -62.0
+     41.2500    117.5000 -62.0
+     40.2500    120.5000 -62.0
+     39.5000    122.2500 -62.0
+     39.2500    125.5000 -62.0
+     37.2500    129.5000 -62.0
+     36.2500    134.5000 -62.0
+     34.2500    138.5000 -62.0
+     32.2500    147.5000 -62.0
+     31.2500    152.5000 -62.0
+     30.5000    154.2500 -62.0
+     30.2500    158.5000 -62.0
+     29.5000    160.2500 -62.0
+     29.2500    172.5000 -62.0
+     30.2500    174.5000 -62.0
+     30.2500    177.5000 -62.0
+     33.2500    186.5000 -62.0
+     39.5000    199.7500 -62.0
+     44.2500    206.5000 -62.0
+     56.2500    217.5000 -62.0
+     62.2500    221.5000 -62.0
+     68.5000    223.7500 -62.0
+     70.2500    224.5000 -62.0
+     79.5000    224.7500 -62.0
+     81.2500    225.5000 -62.0
+     86.5000    225.7500 -62.0
+     88.2500    226.5000 -62.0
+    114.5000    226.7500 -62.0
+    116.5000    225.7500 -62.0
+    128.5000    225.7500 -62.0
+    130.5000    224.7500 -62.0
+    132.7500    224.5000 -62.0
+    143.5000    219.7500 -62.0
+    152.5000    212.7500 -62.0
+    154.5000    211.7500 -62.0
+    156.5000    208.7500 -62.0
+    158.5000    207.7500 -62.0
+    158.7500    206.5000 -62.0
+    163.5000    201.7500 -62.0
+    168.7500    192.5000 -62.0
+    173.7500    182.5000 -62.0
+    174.7500    175.5000 -62.0
+    175.5000    173.7500 -62.0
+    175.7500    151.5000 -62.0
+    174.7500    149.5000 -62.0
+    174.7500    142.5000 -62.0
+    173.7500    140.5000 -62.0
+    173.7500    137.5000 -62.0
+    172.7500    135.5000 -62.0
+    172.7500    132.5000 -62.0
+    171.7500    130.5000 -62.0
+    171.7500    128.5000 -62.0
+    170.7500    126.5000 -62.0
+    170.7500    124.5000 -62.0
+    169.7500    122.5000 -62.0
+    169.7500    120.5000 -62.0
+    168.7500    118.5000 -62.0
+    168.7500    116.5000 -62.0
+    167.7500    114.5000 -62.0
+    167.7500    112.5000 -62.0
+    166.7500    110.5000 -62.0
+    166.7500    108.5000 -62.0
+    164.7500    104.5000 -62.0
+    164.7500    102.5000 -62.0
+    162.7500     98.5000 -62.0
+    162.7500     95.5000 -62.0
+    152.7500     75.5000 -62.0
+    152.7500     73.5000 -62.0
+    148.7500     69.5000 -62.0
+    136.7500     61.5000 -62.0
+    129.7500     57.5000 -62.0
+    120.5000     54.2500 -62.0
+    118.7500     53.5000 -62.0
+    108.7500     55.5000 -62.0
+    110.5000     54.7500 -62.0
+    117.5000     55.7500 -62.0
+    121.2500     57.5000 -62.0
+    123.5000     57.7500 -62.0
+    127.2500     60.5000 -62.0
+    128.2500     62.5000 -62.0
+    125.5000     64.2500 -62.0
+    114.7500     60.5000 -62.0
+    112.5000     60.2500 -62.0
+    106.5000     63.2500 -62.0
+    104.5000     62.2500 -62.0
+    102.5000     63.2500 -62.0
+     95.5000     62.2500 -62.0
+     93.5000     63.2500 -62.0
+     91.5000     63.2500 -62.0
+     85.5000     66.2500 -62.0
+     81.5000     66.2500 -62.0
+     79.7500     65.5000 -62.0
+     78.7500     63.5000 -62.0
+     80.5000     61.7500 -62.0
+     84.5000     59.7500 -62.0
+     86.5000     59.7500 -62.0
+     92.5000     56.7500 -62.0
+    102.5000     55.7500 -62.0
+    104.5000     56.7500 -62.0
+     92.7500     64.5000 -62.0
+     93.5000     63.7500 -62.0
+     97.5000     63.7500 -62.0
+    102.5000     64.7500 -62.0
+    105.5000     65.7500 -62.0
+    107.5000     64.7500 -62.0
+    109.5000     64.7500 -62.0
+    111.5000     63.7500 -62.0
+    113.2500     64.5000 -62.0
+    116.5000     64.7500 -62.0
+    121.5000     65.7500 -62.0
+    123.5000     64.7500 -62.0
+    126.5000     64.7500 -62.0
+    131.5000     66.7500 -62.0
+    136.2500     71.5000 -62.0
+    142.5000     73.7500 -62.0
+    149.2500     81.5000 -62.0
+    153.2500     89.5000 -62.0
+    153.2500     91.5000 -62.0
+    154.2500     93.5000 -62.0
+    154.2500     95.5000 -62.0
+    158.2500     99.5000 -62.0
+    163.2500    108.5000 -62.0
+    163.2500    114.5000 -62.0
+    164.2500    116.5000 -62.0
+    163.5000    118.2500 -62.0
+    163.2500    132.5000 -62.0
+    164.2500    134.5000 -62.0
+    164.2500    138.5000 -62.0
+    166.2500    142.5000 -62.0
+    166.2500    146.5000 -62.0
+    167.2500    148.5000 -62.0
+    167.2500    151.5000 -62.0
+    168.2500    153.5000 -62.0
+    167.2500    162.5000 -62.0
+    168.2500    165.5000 -62.0
+    167.5000    167.2500 -62.0
+    167.2500    178.5000 -62.0
+    163.2500    186.5000 -62.0
+    156.2500    195.5000 -62.0
+    153.5000    199.2500 -62.0
+    151.5000    200.2500 -62.0
+    151.2500    201.5000 -62.0
+    148.5000    203.2500 -62.0
+    144.5000    206.2500 -62.0
+    136.5000    211.2500 -62.0
+    126.5000    217.2500 -62.0
+    123.5000    217.2500 -62.0
+    121.5000    218.2500 -62.0
+    118.5000    218.2500 -62.0
+    116.5000    219.2500 -62.0
+    113.5000    219.2500 -62.0
+    111.5000    220.2500 -62.0
+    109.7500    219.5000 -62.0
+     98.5000    218.2500 -62.0
+     96.5000    217.2500 -62.0
+     93.5000    218.2500 -62.0
+     91.7500    217.5000 -62.0
+     90.5000    218.2500 -62.0
+     86.5000    218.2500 -62.0
+     77.5000    217.2500 -62.0
+     72.5000    215.2500 -62.0
+     66.7500    210.5000 -62.0
+     62.5000    207.2500 -62.0
+     60.5000    206.2500 -62.0
+     54.5000    200.2500 -62.0
+     46.7500    190.5000 -62.0
+     43.7500    186.5000 -62.0
+     40.7500    181.5000 -62.0
+     38.7500    177.5000 -62.0
+     38.7500    175.5000 -62.0
+     37.7500    173.5000 -62.0
+     37.7500    166.5000 -62.0
+     36.7500    164.5000 -62.0
+     37.5000    163.7500 -62.0
+     37.7500    155.5000 -62.0
+     38.5000    153.7500 -62.0
+     38.7500    147.5000 -62.0
+     39.5000    145.7500 -62.0
+     39.7500    140.5000 -62.0
+     41.7500    134.5000 -62.0
+     44.5000    128.7500 -62.0
+     44.7500    126.5000 -62.0
+     45.7500    124.5000 -62.0
+     43.7500    120.5000 -62.0
+     44.5000    118.7500 -62.0
+     44.7500    114.5000 -62.0
+     47.5000    108.7500 -62.0
+     47.7500    104.5000 -62.0
+     49.7500     98.5000 -62.0
+     55.5000     91.7500 -62.0
+     55.7500     89.5000 -62.0
+     57.7500     83.5000 -62.0
+     62.5000     78.7500 -62.0
+     64.5000     77.7500 -62.0
+     64.7500     76.5000 -62.0
+     74.5000     67.7500 -62.0
+     81.5000     67.7500 -62.0
+     84.5000     68.7500 -62.0
+     87.7500     66.5000 -62.0
+    133.7500     65.5000 -62.0
+    135.5000     64.7500 -62.0
+    137.2500     66.5000 -62.0
+    135.5000     67.2500 -62.0
+    155.7500     95.5000 -62.0
+    156.5000     94.7500 -62.0
+    157.2500     95.5000 -62.0
+    156.5000     96.2500 -62.0
+     35.7500    185.5000 -62.0
+     36.5000    184.7500 -62.0
+     37.2500    185.5000 -62.0
+     36.5000    186.2500 -62.0
+    110.2500     51.5000 -64.0
+    109.5000     52.2500 -64.0
+     96.5000     52.2500 -64.0
+     94.5000     53.2500 -64.0
+     91.5000     53.2500 -64.0
+     87.5000     55.2500 -64.0
+     85.5000     55.2500 -64.0
+     65.5000     65.2500 -64.0
+     61.5000     68.2500 -64.0
+     57.2500     75.5000 -64.0
+     50.5000     86.2500 -64.0
+     50.2500     88.5000 -64.0
+     45.2500     98.5000 -64.0
+     41.2500    116.5000 -64.0
+     40.2500    118.5000 -64.0
+     39.2500    123.5000 -64.0
+     33.2500    141.5000 -64.0
+     31.2500    150.5000 -64.0
+     30.5000    152.2500 -64.0
+     30.2500    156.5000 -64.0
+     29.5000    158.2500 -64.0
+     29.2500    174.5000 -64.0
+     30.2500    176.5000 -64.0
+     30.2500    179.5000 -64.0
+     33.5000    188.7500 -64.0
+     37.2500    197.5000 -64.0
+     43.2500    205.5000 -64.0
+     44.2500    207.5000 -64.0
+     54.2500    216.5000 -64.0
+     58.5000    219.7500 -64.0
+     66.5000    223.7500 -64.0
+     68.2500    224.5000 -64.0
+     72.5000    224.7500 -64.0
+     74.2500    225.5000 -64.0
+     84.5000    225.7500 -64.0
+     86.2500    226.5000 -64.0
+    126.5000    226.7500 -64.0
+    128.5000    225.7500 -64.0
+    130.5000    225.7500 -64.0
+    132.5000    224.7500 -64.0
+    134.7500    224.5000 -64.0
+    141.5000    221.7500 -64.0
+    149.5000    215.7500 -64.0
+    151.5000    214.7500 -64.0
+    161.5000    204.7500 -64.0
+    165.7500    198.5000 -64.0
+    170.7500    189.5000 -64.0
+    171.7500    187.5000 -64.0
+    173.7500    182.5000 -64.0
+    174.5000    180.7500 -64.0
+    174.7500    177.5000 -64.0
+    175.5000    175.7500 -64.0
+    175.7500    166.5000 -64.0
+    176.5000    164.7500 -64.0
+    176.7500    158.5000 -64.0
+    175.7500    156.5000 -64.0
+    175.7500    147.5000 -64.0
+    174.7500    145.5000 -64.0
+    174.7500    140.5000 -64.0
+    173.7500    138.5000 -64.0
+    173.7500    135.5000 -64.0
+    172.7500    133.5000 -64.0
+    172.7500    130.5000 -64.0
+    171.7500    128.5000 -64.0
+    171.7500    125.5000 -64.0
+    169.7500    121.5000 -64.0
+    169.7500    118.5000 -64.0
+    167.7500    114.5000 -64.0
+    167.7500    112.5000 -64.0
+    160.5000     91.2500 -64.0
+    157.7500     84.5000 -64.0
+    152.7500     76.5000 -64.0
+    152.7500     74.5000 -64.0
+    151.7500     71.5000 -64.0
+    144.5000     65.2500 -64.0
+    136.5000     60.2500 -64.0
+    128.5000     56.2500 -64.0
+    126.7500     55.5000 -64.0
+    120.5000     53.2500 -64.0
+    118.7500     52.5000 -64.0
+    113.5000     52.2500 -64.0
+} -64.0
+{ -64.0
+    106.7500     54.5000 -64.0
+    107.5000     53.7500 -64.0
+    114.5000     53.7500 -64.0
+    118.2500     55.5000 -64.0
+    120.5000     55.7500 -64.0
+    128.5000     59.7500 -64.0
+    131.2500     63.5000 -64.0
+    133.5000     63.7500 -64.0
+    136.2500     66.5000 -64.0
+    137.5000     65.7500 -64.0
+    139.5000     66.7500 -64.0
+    142.2500     69.5000 -64.0
+    141.5000     70.2500 -64.0
+    138.5000     70.2500 -64.0
+    136.7500     69.5000 -64.0
+    135.7500     67.5000 -64.0
+    134.5000     68.2500 -64.0
+    132.5000     68.2500 -64.0
+    128.7500     65.5000 -64.0
+    125.5000     65.2500 -64.0
+    120.5000     64.2500 -64.0
+    116.7500     62.5000 -64.0
+    103.5000     62.2500 -64.0
+    100.5000     63.2500 -64.0
+     98.7500     62.5000 -64.0
+     94.5000     62.2500 -64.0
+     91.5000     63.2500 -64.0
+     87.5000     66.2500 -64.0
+     79.5000     66.2500 -64.0
+     77.7500     65.5000 -64.0
+     76.7500     63.5000 -64.0
+     78.5000     61.7500 -64.0
+     86.5000     57.7500 -64.0
+     89.5000     57.7500 -64.0
+     93.5000     55.7500 -64.0
+     96.5000     55.7500 -64.0
+     98.5000     54.7500 -64.0
+    101.5000     54.7500 -64.0
+    103.5000     55.7500 -64.0
+} -64.0
+{ -64.0
+     92.7500     64.5000 -64.0
+     93.5000     63.7500 -64.0
+     97.5000     63.7500 -64.0
+    102.5000     64.7500 -64.0
+    104.5000     65.7500 -64.0
+    106.5000     64.7500 -64.0
+    115.5000     64.7500 -64.0
+    122.5000     67.7500 -64.0
+    124.5000     66.7500 -64.0
+    126.5000     66.7500 -64.0
+    129.5000     67.7500 -64.0
+    136.2500     73.5000 -64.0
+    141.5000     73.7500 -64.0
+    144.5000     74.7500 -64.0
+    149.2500     81.5000 -64.0
+    150.2500     83.5000 -64.0
+    155.2500     91.5000 -64.0
+    155.2500     95.5000 -64.0
+    158.2500     98.5000 -64.0
+    161.2500    103.5000 -64.0
+    163.2500    107.5000 -64.0
+    163.2500    112.5000 -64.0
+    164.2500    115.5000 -64.0
+    163.5000    117.2500 -64.0
+    163.2500    130.5000 -64.0
+    164.2500    132.5000 -64.0
+    164.2500    135.5000 -64.0
+    165.2500    137.5000 -64.0
+    165.2500    139.5000 -64.0
+    166.2500    141.5000 -64.0
+    166.2500    144.5000 -64.0
+    167.2500    146.5000 -64.0
+    167.2500    150.5000 -64.0
+    168.2500    152.5000 -64.0
+    168.2500    156.5000 -64.0
+    167.2500    161.5000 -64.0
+    168.2500    163.5000 -64.0
+    168.2500    176.5000 -64.0
+    162.2500    188.5000 -64.0
+    159.2500    192.5000 -64.0
+    158.2500    194.5000 -64.0
+    148.5000    204.2500 -64.0
+    146.2500    205.5000 -64.0
+    139.5000    210.2500 -64.0
+    129.5000    216.2500 -64.0
+    125.5000    218.2500 -64.0
+    121.5000    218.2500 -64.0
+    119.5000    219.2500 -64.0
+    117.5000    219.2500 -64.0
+    115.5000    220.2500 -64.0
+    109.5000    220.2500 -64.0
+    107.7500    219.5000 -64.0
+     97.5000    219.2500 -64.0
+     95.7500    218.5000 -64.0
+     79.5000    218.2500 -64.0
+     74.5000    217.2500 -64.0
+     67.7500    212.5000 -64.0
+     58.5000    205.2500 -64.0
+     56.5000    204.2500 -64.0
+     46.7500    192.5000 -64.0
+     43.7500    188.5000 -64.0
+     36.7500    174.5000 -64.0
+     36.7500    158.5000 -64.0
+     37.7500    153.5000 -64.0
+     38.7500    144.5000 -64.0
+     39.7500    137.5000 -64.0
+     40.7500    134.5000 -64.0
+     41.5000    132.7500 -64.0
+     44.7500    127.5000 -64.0
+     45.7500    122.5000 -64.0
+     44.7500    120.5000 -64.0
+     44.7500    113.5000 -64.0
+     46.7500    107.5000 -64.0
+     47.5000    105.7500 -64.0
+     47.7500    101.5000 -64.0
+     48.7500     98.5000 -64.0
+     55.5000     90.7500 -64.0
+     55.7500     87.5000 -64.0
+     57.7500     82.5000 -64.0
+     64.5000     75.7500 -64.0
+     66.5000     74.7500 -64.0
+     74.5000     67.7500 -64.0
+     77.5000     67.7500 -64.0
+     86.5000     68.7500 -64.0
+     90.5000     65.7500 -64.0
+     68.7500     68.5000 -64.0
+     69.5000     67.7500 -64.0
+     70.2500     68.5000 -64.0
+     69.5000     69.2500 -64.0
+    108.2500     50.5000 -66.0
+    107.5000     51.2500 -66.0
+     98.5000     51.2500 -66.0
+     96.5000     52.2500 -66.0
+     94.5000     52.2500 -66.0
+     92.5000     53.2500 -66.0
+     89.5000     53.2500 -66.0
+     85.5000     55.2500 -66.0
+     83.5000     55.2500 -66.0
+     63.5000     65.2500 -66.0
+     60.5000     68.2500 -66.0
+     58.2500     74.5000 -66.0
+     54.2500     79.5000 -66.0
+     50.5000     86.2500 -66.0
+     50.2500     88.5000 -66.0
+     45.2500     98.5000 -66.0
+     44.2500    103.5000 -66.0
+     42.2500    112.5000 -66.0
+     41.2500    114.5000 -66.0
+     40.2500    119.5000 -66.0
+     38.2500    125.5000 -66.0
+     36.5000    129.2500 -66.0
+     35.2500    135.5000 -66.0
+     33.2500    139.5000 -66.0
+     31.2500    148.5000 -66.0
+     30.2500    151.5000 -66.0
+     29.2500    160.5000 -66.0
+     28.2500    167.5000 -66.0
+     29.2500    169.5000 -66.0
+     29.2500    176.5000 -66.0
+     30.2500    178.5000 -66.0
+     30.2500    181.5000 -66.0
+     32.2500    185.5000 -66.0
+     32.2500    187.5000 -66.0
+     39.2500    201.5000 -66.0
+     44.2500    207.5000 -66.0
+     45.2500    209.5000 -66.0
+     50.2500    213.5000 -66.0
+     57.5000    219.7500 -66.0
+     66.2500    224.5000 -66.0
+     68.5000    224.7500 -66.0
+     70.2500    225.5000 -66.0
+     79.5000    225.7500 -66.0
+     88.5000    226.7500 -66.0
+     90.2500    227.5000 -66.0
+    110.5000    227.7500 -66.0
+    112.5000    226.7500 -66.0
+    128.5000    226.7500 -66.0
+    130.5000    225.7500 -66.0
+    132.5000    225.7500 -66.0
+    138.5000    223.7500 -66.0
+    146.5000    218.7500 -66.0
+    148.5000    217.7500 -66.0
+    157.5000    209.7500 -66.0
+    162.5000    203.7500 -66.0
+    166.7500    197.5000 -66.0
+    173.7500    183.5000 -66.0
+    174.5000    181.7500 -66.0
+    174.7500    178.5000 -66.0
+    175.5000    176.7500 -66.0
+    175.7500    171.5000 -66.0
+    176.5000    169.7500 -66.0
+    176.7500    153.5000 -66.0
+    175.7500    151.5000 -66.0
+    175.7500    143.5000 -66.0
+    174.7500    141.5000 -66.0
+    174.7500    136.5000 -66.0
+    173.7500    134.5000 -66.0
+    173.7500    131.5000 -66.0
+    172.7500    129.5000 -66.0
+    172.7500    126.5000 -66.0
+    170.7500    122.5000 -66.0
+    170.7500    120.5000 -66.0
+    168.7500    116.5000 -66.0
+    168.7500    113.5000 -66.0
+    166.7500    109.5000 -66.0
+    166.7500    107.5000 -66.0
+    162.7500     99.5000 -66.0
+    162.7500     97.5000 -66.0
+    161.7500     95.5000 -66.0
+    161.7500     93.5000 -66.0
+    155.7500     81.5000 -66.0
+    152.7500     76.5000 -66.0
+    152.7500     73.5000 -66.0
+    151.7500     71.5000 -66.0
+    151.7500     69.5000 -66.0
+    147.7500     66.5000 -66.0
+    141.5000     62.2500 -66.0
+    127.5000     55.2500 -66.0
+    125.7500     54.5000 -66.0
+    119.5000     52.2500 -66.0
+    117.7500     51.5000 -66.0
+    113.5000     51.2500 -66.0
+    111.7500     50.5000 -66.0
+} -66.0
+{ -66.0
+    105.7500     53.5000 -66.0
+    106.5000     52.7500 -66.0
+    113.5000     52.7500 -66.0
+    116.5000     53.7500 -66.0
+    126.5000     57.7500 -66.0
+    130.2500     59.5000 -66.0
+    131.2500     61.5000 -66.0
+    136.5000     65.7500 -66.0
+    138.5000     66.7500 -66.0
+    144.2500     69.5000 -66.0
+    143.5000     71.2500 -66.0
+    141.5000     71.2500 -66.0
+    139.7500     70.5000 -66.0
+    138.5000     71.2500 -66.0
+    136.7500     69.5000 -66.0
+    135.5000     70.2500 -66.0
+    133.5000     70.2500 -66.0
+    129.5000     68.2500 -66.0
+    127.7500     67.5000 -66.0
+    121.5000     67.2500 -66.0
+    117.7500     63.5000 -66.0
+    111.5000     63.2500 -66.0
+    109.7500     62.5000 -66.0
+    103.5000     62.2500 -66.0
+    101.5000     63.2500 -66.0
+     98.5000     63.2500 -66.0
+     96.5000     62.2500 -66.0
+     94.5000     63.2500 -66.0
+     92.5000     63.2500 -66.0
+     86.5000     67.2500 -66.0
+     84.7500     66.5000 -66.0
+     79.5000     66.2500 -66.0
+     76.5000     65.2500 -66.0
+     75.7500     63.5000 -66.0
+     77.5000     61.7500 -66.0
+     87.5000     56.7500 -66.0
+     89.5000     56.7500 -66.0
+     91.5000     55.7500 -66.0
+     93.5000     55.7500 -66.0
+     95.5000     54.7500 -66.0
+     98.5000     54.7500 -66.0
+    100.5000     53.7500 -66.0
+    103.2500     55.5000 -66.0
+} -66.0
+{ -66.0
+     93.7500     64.5000 -66.0
+     94.5000     63.7500 -66.0
+     97.5000     63.7500 -66.0
+     99.2500     64.5000 -66.0
+    111.5000     64.7500 -66.0
+    118.5000     65.7500 -66.0
+    120.5000     68.7500 -66.0
+    122.5000     69.7500 -66.0
+    125.5000     68.7500 -66.0
+    132.5000     71.7500 -66.0
+    136.2500     74.5000 -66.0
+    138.5000     74.7500 -66.0
+    140.5000     73.7500 -66.0
+    143.5000     73.7500 -66.0
+    150.2500     81.5000 -66.0
+    152.2500     85.5000 -66.0
+    156.2500     90.5000 -66.0
+    156.2500     94.5000 -66.0
+    157.2500     96.5000 -66.0
+    162.2500    104.5000 -66.0
+    162.2500    106.5000 -66.0
+    164.2500    110.5000 -66.0
+    163.5000    111.2500 -66.0
+    164.2500    112.5000 -66.0
+    162.2500    121.5000 -66.0
+    163.2500    123.5000 -66.0
+    163.2500    130.5000 -66.0
+    164.2500    132.5000 -66.0
+    164.2500    135.5000 -66.0
+    165.2500    137.5000 -66.0
+    165.2500    139.5000 -66.0
+    166.2500    141.5000 -66.0
+    166.2500    144.5000 -66.0
+    167.2500    146.5000 -66.0
+    167.2500    152.5000 -66.0
+    168.2500    154.5000 -66.0
+    168.2500    158.5000 -66.0
+    167.2500    161.5000 -66.0
+    168.2500    163.5000 -66.0
+    168.2500    165.5000 -66.0
+    169.2500    167.5000 -66.0
+    168.5000    168.2500 -66.0
+    168.2500    171.5000 -66.0
+    169.2500    174.5000 -66.0
+    160.2500    192.5000 -66.0
+    148.5000    205.2500 -66.0
+    143.5000    208.2500 -66.0
+    141.2500    209.5000 -66.0
+    134.5000    214.2500 -66.0
+    127.5000    218.2500 -66.0
+    124.5000    218.2500 -66.0
+    122.5000    219.2500 -66.0
+    119.5000    219.2500 -66.0
+    117.5000    220.2500 -66.0
+    115.5000    220.2500 -66.0
+    113.5000    221.2500 -66.0
+    111.5000    221.2500 -66.0
+    109.7500    220.5000 -66.0
+    104.5000    220.2500 -66.0
+    102.7500    219.5000 -66.0
+    101.5000    220.2500 -66.0
+     99.5000    220.2500 -66.0
+     97.7500    219.5000 -66.0
+     83.5000    219.2500 -66.0
+     76.5000    218.2500 -66.0
+     70.5000    215.2500 -66.0
+     64.7500    210.5000 -66.0
+     57.7500    206.5000 -66.0
+     56.7500    204.5000 -66.0
+     55.5000    204.2500 -66.0
+     49.7500    197.5000 -66.0
+     43.7500    189.5000 -66.0
+     39.7500    182.5000 -66.0
+     39.7500    180.5000 -66.0
+     35.7500    172.5000 -66.0
+     35.7500    162.5000 -66.0
+     36.5000    160.7500 -66.0
+     36.7500    153.5000 -66.0
+     37.7500    151.5000 -66.0
+     38.7500    142.5000 -66.0
+     39.7500    135.5000 -66.0
+     44.7500    127.5000 -66.0
+     45.7500    122.5000 -66.0
+     44.7500    119.5000 -66.0
+     45.5000    117.7500 -66.0
+     45.7500    113.5000 -66.0
+     44.7500    111.5000 -66.0
+     46.7500    107.5000 -66.0
+     47.5000    105.7500 -66.0
+     47.7500    101.5000 -66.0
+     49.7500     95.5000 -66.0
+     55.5000     89.7500 -66.0
+     55.7500     86.5000 -66.0
+     58.7500     79.5000 -66.0
+     64.5000     75.7500 -66.0
+     66.5000     74.7500 -66.0
+     72.5000     69.7500 -66.0
+     76.5000     66.7500 -66.0
+     78.2500     67.5000 -66.0
+     80.5000     67.7500 -66.0
+     82.2500     68.5000 -66.0
+     87.5000     68.7500 -66.0
+     89.5000     66.7500 -66.0
+} -66.0
+{ -66.0
+     64.7500     70.5000 -66.0
+     65.5000     69.7500 -66.0
+     67.2500     70.5000 -66.0
+     66.5000     71.2500 -66.0
+} -66.0
+v 253 z -68.000000 -64.0
+{ -68.0
+     99.2500     50.5000 -68.0
+     98.5000     51.2500 -68.0
+     95.5000     51.2500 -68.0
+     91.5000     53.2500 -68.0
+     88.5000     53.2500 -68.0
+     82.5000     56.2500 -68.0
+     79.2500     56.5000 -68.0
+     68.5000     61.2500 -68.0
+     60.5000     67.2500 -68.0
+     58.2500     74.5000 -68.0
+     54.2500     79.5000 -68.0
+     46.5000     95.2500 -68.0
+     46.2500     97.5000 -68.0
+     45.2500     99.5000 -68.0
+     44.2500    104.5000 -68.0
+     43.2500    107.5000 -68.0
+     42.5000    109.2500 -68.0
+     42.2500    112.5000 -68.0
+     40.2500    116.5000 -68.0
+     39.2500    121.5000 -68.0
+     37.5000    125.2500 -68.0
+     37.2500    127.5000 -68.0
+     35.2500    131.5000 -68.0
+     34.2500    136.5000 -68.0
+     33.2500    138.5000 -68.0
+     32.2500    143.5000 -68.0
+     31.2500    145.5000 -68.0
+     30.2500    152.5000 -68.0
+     29.5000    154.2500 -68.0
+     29.2500    159.5000 -68.0
+     28.5000    161.2500 -68.0
+     28.2500    170.5000 -68.0
+     29.2500    172.5000 -68.0
+     29.2500    177.5000 -68.0
+     30.2500    179.5000 -68.0
+     30.2500    182.5000 -68.0
+     32.2500    186.5000 -68.0
+     32.2500    188.5000 -68.0
+     38.2500    200.5000 -68.0
+     41.2500    204.5000 -68.0
+     42.2500    206.5000 -68.0
+     49.2500    213.5000 -68.0
+     56.5000    219.7500 -68.0
+     64.5000    223.7500 -68.0
+     68.2500    225.5000 -68.0
+     78.5000    225.7500 -68.0
+     85.5000    226.7500 -68.0
+     87.2500    227.5000 -68.0
+    117.5000    227.7500 -68.0
+    120.5000    226.7500 -68.0
+    122.5000    227.7500 -68.0
+    124.5000    226.7500 -68.0
+    130.5000    226.7500 -68.0
+    132.5000    225.7500 -68.0
+    134.5000    225.7500 -68.0
+    144.5000    220.7500 -68.0
+    148.5000    217.7500 -68.0
+    150.5000    216.7500 -68.0
+    160.7500    206.5000 -68.0
+    163.5000    202.7500 -68.0
+    167.7500    196.5000 -68.0
+    171.5000    189.7500 -68.0
+    173.7500    183.5000 -68.0
+    174.5000    181.7500 -68.0
+    175.7500    173.5000 -68.0
+    176.5000    171.7500 -68.0
+    176.7500    149.5000 -68.0
+    175.7500    147.5000 -68.0
+    175.7500    138.5000 -68.0
+    174.7500    136.5000 -68.0
+    174.7500    132.5000 -68.0
+    173.7500    130.5000 -68.0
+    173.7500    128.5000 -68.0
+    171.7500    124.5000 -68.0
+    171.7500    122.5000 -68.0
+    169.7500    118.5000 -68.0
+    169.7500    116.5000 -68.0
+    167.7500    112.5000 -68.0
+    167.7500    110.5000 -68.0
+    166.7500    108.5000 -68.0
+    166.7500    106.5000 -68.0
+    161.7500     96.5000 -68.0
+    161.7500     94.5000 -68.0
+    151.7500     74.5000 -68.0
+    152.5000     73.7500 -68.0
+    152.7500     70.5000 -68.0
+    151.7500     68.5000 -68.0
+    147.5000     65.2500 -68.0
+    143.7500     62.5000 -68.0
+    137.5000     58.2500 -68.0
+    132.5000     57.2500 -68.0
+    126.7500     54.5000 -68.0
+    117.5000     51.2500 -68.0
+    115.7500     50.5000 -68.0
+} -68.0
+{ -68.0
+    105.7500     52.5000 -68.0
+    106.5000     51.7500 -68.0
+    113.5000     51.7500 -68.0
+    117.2500     53.5000 -68.0
+    119.5000     53.7500 -68.0
+    123.2500     56.5000 -68.0
+    126.5000     56.7500 -68.0
+    130.2500     59.5000 -68.0
+    131.2500     61.5000 -68.0
+    136.2500     65.5000 -68.0
+    136.2500     69.5000 -68.0
+    134.5000     71.2500 -68.0
+    132.5000     71.2500 -68.0
+    129.5000     70.2500 -68.0
+    125.7500     68.5000 -68.0
+    121.5000     68.2500 -68.0
+    119.7500     66.5000 -68.0
+    118.7500     64.5000 -68.0
+    113.5000     64.2500 -68.0
+    103.5000     62.2500 -68.0
+    101.5000     63.2500 -68.0
+     96.5000     63.2500 -68.0
+     88.5000     67.2500 -68.0
+     84.5000     67.2500 -68.0
+     82.7500     65.5000 -68.0
+     79.5000     65.2500 -68.0
+     77.7500     64.5000 -68.0
+     76.7500     62.5000 -68.0
+     79.5000     59.7500 -68.0
+     81.5000     59.7500 -68.0
+     87.5000     56.7500 -68.0
+     89.5000     56.7500 -68.0
+     93.5000     54.7500 -68.0
+     95.5000     54.7500 -68.0
+     97.5000     53.7500 -68.0
+    101.5000     53.7500 -68.0
+    103.2500     54.5000 -68.0
+} -68.0
+{ -68.0
+     71.7500     64.5000 -68.0
+     72.5000     63.7500 -68.0
+     74.2500     64.5000 -68.0
+     73.5000     65.2500 -68.0
+     69.5000     68.2500 -68.0
+     68.7500     66.5000 -68.0
+} -68.0
+{ -68.0
+     93.7500     65.5000 -68.0
+     94.5000     64.7500 -68.0
+    107.5000     64.7500 -68.0
+    116.5000     65.7500 -68.0
+    118.2500     66.5000 -68.0
+    119.5000     68.7500 -68.0
+    121.5000     69.7500 -68.0
+    123.2500     70.5000 -68.0
+    126.5000     70.7500 -68.0
+    128.5000     71.7500 -68.0
+    133.5000     72.7500 -68.0
+    135.2500     74.5000 -68.0
+    144.5000     74.7500 -68.0
+    148.2500     78.5000 -68.0
+    154.2500     85.5000 -68.0
+    154.2500     87.5000 -68.0
+    156.2500     89.5000 -68.0
+    156.2500     92.5000 -68.0
+    163.2500    106.5000 -68.0
+    162.5000    108.2500 -68.0
+    162.2500    111.5000 -68.0
+    163.2500    113.5000 -68.0
+    162.5000    115.2500 -68.0
+    162.2500    121.5000 -68.0
+    163.2500    123.5000 -68.0
+    163.2500    129.5000 -68.0
+    164.2500    131.5000 -68.0
+    164.2500    134.5000 -68.0
+    165.2500    136.5000 -68.0
+    165.2500    138.5000 -68.0
+    166.2500    140.5000 -68.0
+    166.2500    143.5000 -68.0
+    167.2500    145.5000 -68.0
+    167.2500    159.5000 -68.0
+    168.2500    161.5000 -68.0
+    168.2500    164.5000 -68.0
+    169.2500    166.5000 -68.0
+    169.2500    170.5000 -68.0
+    170.2500    172.5000 -68.0
+    169.5000    173.2500 -68.0
+    169.2500    175.5000 -68.0
+    162.2500    189.5000 -68.0
+    159.2500    193.5000 -68.0
+    158.2500    195.5000 -68.0
+    150.5000    204.2500 -68.0
+    146.5000    207.2500 -68.0
+    141.5000    210.2500 -68.0
+    133.5000    215.2500 -68.0
+    125.5000    219.2500 -68.0
+    123.5000    219.2500 -68.0
+    121.5000    220.2500 -68.0
+    117.5000    220.2500 -68.0
+    115.5000    221.2500 -68.0
+    109.5000    221.2500 -68.0
+    107.7500    220.5000 -68.0
+     97.5000    220.2500 -68.0
+     95.7500    219.5000 -68.0
+     88.5000    219.2500 -68.0
+     86.5000    220.2500 -68.0
+     85.7500    219.5000 -68.0
+     84.5000    220.2500 -68.0
+     82.7500    219.5000 -68.0
+     79.5000    219.2500 -68.0
+     74.5000    218.2500 -68.0
+     68.7500    214.5000 -68.0
+     62.5000    210.2500 -68.0
+     60.5000    209.2500 -68.0
+     51.7500    201.5000 -68.0
+     50.5000    199.2500 -68.0
+     42.7500    189.5000 -68.0
+     39.7500    183.5000 -68.0
+     39.7500    181.5000 -68.0
+     36.7500    175.5000 -68.0
+     36.7500    173.5000 -68.0
+     34.7500    169.5000 -68.0
+     34.7500    165.5000 -68.0
+     35.5000    163.7500 -68.0
+     35.7500    157.5000 -68.0
+     36.5000    155.7500 -68.0
+     37.7500    147.5000 -68.0
+     38.5000    145.7500 -68.0
+     39.7500    137.5000 -68.0
+     44.7500    126.5000 -68.0
+     45.5000    124.7500 -68.0
+     45.7500    121.5000 -68.0
+     44.7500    119.5000 -68.0
+     45.5000    117.7500 -68.0
+     45.7500    110.5000 -68.0
+     46.7500    108.5000 -68.0
+     48.7500     99.5000 -68.0
+     49.7500     94.5000 -68.0
+     51.5000     93.7500 -68.0
+     54.5000     90.7500 -68.0
+     54.7500     88.5000 -68.0
+     55.7500     83.5000 -68.0
+     58.5000     79.7500 -68.0
+     62.5000     76.7500 -68.0
+     64.5000     75.7500 -68.0
+     68.5000     72.7500 -68.0
+     71.5000     72.7500 -68.0
+     71.7500     71.5000 -68.0
+     73.5000     69.7500 -68.0
+     77.5000     67.7500 -68.0
+     86.5000     68.7500 -68.0
+} -68.0
+{ -68.0
+     66.7500     68.5000 -68.0
+     67.5000     67.7500 -68.0
+     68.2500     69.5000 -68.0
+     65.5000     71.2500 -68.0
+     63.7500     70.5000 -68.0
+} -68.0
+{ -68.0
+    142.7500     69.5000 -68.0
+    144.5000     68.7500 -68.0
+    146.2500     70.5000 -68.0
+    145.5000     71.2500 -68.0
+    139.5000     71.2500 -68.0
+    137.7500     70.5000 -68.0
+    138.5000     69.7500 -68.0
+} -68.0
+v 195 z -70.000000 -68.0
+{ -68.0
+    101.2500     49.5000 -70.0
+     97.5000     51.2500 -70.0
+     94.5000     51.2500 -70.0
+     90.5000     53.2500 -70.0
+     88.5000     53.2500 -70.0
+     82.5000     56.2500 -70.0
+     81.5000     55.2500 -70.0
+     79.5000     56.2500 -70.0
+     77.5000     56.2500 -70.0
+     66.5000     61.2500 -70.0
+     60.2500     66.5000 -70.0
+     59.2500     73.5000 -70.0
+     53.2500     81.5000 -70.0
+     50.2500     88.5000 -70.0
+     47.5000     92.2500 -70.0
+     42.5000    108.2500 -70.0
+     41.2500    114.5000 -70.0
+     37.5000    123.2500 -70.0
+     37.2500    126.5000 -70.0
+     32.2500    139.5000 -70.0
+     31.2500    146.5000 -70.0
+     30.2500    148.5000 -70.0
+     29.2500    157.5000 -70.0
+     28.5000    159.2500 -70.0
+     28.2500    171.5000 -70.0
+     29.2500    173.5000 -70.0
+     29.2500    178.5000 -70.0
+     32.2500    188.5000 -70.0
+     38.2500    201.5000 -70.0
+     43.2500    208.5000 -70.0
+     49.5000    214.7500 -70.0
+     57.5000    220.7500 -70.0
+     67.2500    225.5000 -70.0
+     76.5000    225.7500 -70.0
+     85.2500    227.5000 -70.0
+    109.5000    228.7500 -70.0
+    111.5000    227.7500 -70.0
+    126.5000    227.7500 -70.0
+    128.5000    226.7500 -70.0
+    135.5000    225.7500 -70.0
+    143.5000    221.7500 -70.0
+    155.5000    212.7500 -70.0
+    164.5000    201.7500 -70.0
+    172.5000    188.7500 -70.0
+    172.7500    186.5000 -70.0
+    174.7500    182.5000 -70.0
+    175.7500    173.5000 -70.0
+    176.5000    171.7500 -70.0
+    176.7500    143.5000 -70.0
+    175.7500    141.5000 -70.0
+    175.7500    135.5000 -70.0
+    174.7500    133.5000 -70.0
+    174.7500    130.5000 -70.0
+    172.7500    126.5000 -70.0
+    172.7500    123.5000 -70.0
+    169.7500    117.5000 -70.0
+    169.7500    115.5000 -70.0
+    167.7500    111.5000 -70.0
+    167.7500    109.5000 -70.0
+    164.7500    103.5000 -70.0
+    164.7500    101.5000 -70.0
+    161.7500     97.5000 -70.0
+    161.7500     95.5000 -70.0
+    151.7500     75.5000 -70.0
+    152.5000     73.7500 -70.0
+    152.7500     68.5000 -70.0
+    145.7500     61.5000 -70.0
+    138.7500     57.5000 -70.0
+    134.5000     56.2500 -70.0
+    132.5000     57.2500 -70.0
+    126.5000     53.2500 -70.0
+    112.7500     49.5000 -70.0
+} -70.0
+{ -70.0
+    106.5000     51.7500 -70.0
+    115.5000     51.7500 -70.0
+    125.5000     56.7500 -70.0
+    129.2500     58.5000 -70.0
+    129.2500     61.5000 -70.0
+    132.5000     64.7500 -70.0
+    135.5000     63.7500 -70.0
+    141.5000     66.7500 -70.0
+    143.2500     70.5000 -70.0
+    141.5000     71.2500 -70.0
+    139.5000     72.2500 -70.0
+    138.7500     71.5000 -70.0
+    134.5000     70.2500 -70.0
+    132.5000     71.2500 -70.0
+    128.5000     71.2500 -70.0
+    121.5000     68.2500 -70.0
+    117.7500     64.5000 -70.0
+    111.5000     64.2500 -70.0
+    105.5000     62.2500 -70.0
+    103.5000     63.2500 -70.0
+    100.5000     63.2500 -70.0
+     98.5000     64.2500 -70.0
+     95.5000     64.2500 -70.0
+     89.5000     68.2500 -70.0
+     86.5000     68.2500 -70.0
+     84.7500     67.5000 -70.0
+     82.7500     63.5000 -70.0
+     80.7500     62.5000 -70.0
+     84.5000     58.7500 -70.0
+     86.5000     58.7500 -70.0
+     90.5000     55.7500 -70.0
+     92.5000     55.7500 -70.0
+     98.5000     52.7500 -70.0
+    101.5000     52.7500 -70.0
+    104.5000     53.7500 -70.0
+} -70.0
+{ -70.0
+     71.7500     64.5000 -70.0
+     72.5000     63.7500 -70.0
+     75.5000     63.7500 -70.0
+     77.2500     65.5000 -70.0
+     76.5000     66.2500 -70.0
+     72.5000     66.2500 -70.0
+} -70.0
+{ -70.0
+    103.7500     64.5000 -70.0
+    105.5000     63.7500 -70.0
+    109.2500     65.5000 -70.0
+    115.5000     65.7500 -70.0
+    118.5000     66.7500 -70.0
+    119.2500     68.5000 -70.0
+    127.2500     72.5000 -70.0
+    130.5000     72.7500 -70.0
+    136.5000     75.7500 -70.0
+    138.5000     74.7500 -70.0
+    141.5000     74.7500 -70.0
+    151.5000     80.7500 -70.0
+    154.2500     84.5000 -70.0
+    154.2500     87.5000 -70.0
+    156.2500     91.5000 -70.0
+    156.2500     93.5000 -70.0
+    162.2500    105.5000 -70.0
+    162.2500    120.5000 -70.0
+    164.2500    126.5000 -70.0
+    164.2500    132.5000 -70.0
+    166.2500    138.5000 -70.0
+    166.2500    142.5000 -70.0
+    167.2500    144.5000 -70.0
+    167.2500    151.5000 -70.0
+    168.2500    153.5000 -70.0
+    168.2500    163.5000 -70.0
+    170.2500    169.5000 -70.0
+    169.5000    171.2500 -70.0
+    169.2500    175.5000 -70.0
+    162.5000    189.2500 -70.0
+    157.2500    197.5000 -70.0
+    147.5000    207.2500 -70.0
+    127.5000    219.2500 -70.0
+    124.5000    219.2500 -70.0
+    122.5000    220.2500 -70.0
+    112.5000    222.2500 -70.0
+    102.5000    220.2500 -70.0
+     99.5000    221.2500 -70.0
+     97.7500    220.5000 -70.0
+     80.5000    220.2500 -70.0
+     72.5000    217.2500 -70.0
+     64.5000    212.2500 -70.0
+     51.7500    202.5000 -70.0
+     43.7500    191.5000 -70.0
+     37.7500    179.5000 -70.0
+     37.7500    177.5000 -70.0
+     35.7500    173.5000 -70.0
+     34.7500    164.5000 -70.0
+     39.7500    138.5000 -70.0
+     45.5000    125.7500 -70.0
+     45.7500    120.5000 -70.0
+     44.7500    118.5000 -70.0
+     46.7500    113.5000 -70.0
+     45.7500    110.5000 -70.0
+     47.7500    106.5000 -70.0
+     49.7500     96.5000 -70.0
+     54.5000     88.7500 -70.0
+     56.7500     80.5000 -70.0
+     66.5000     73.7500 -70.0
+     70.5000     73.7500 -70.0
+     76.5000     69.7500 -70.0
+     78.5000     69.7500 -70.0
+     80.5000     68.7500 -70.0
+     89.5000     69.7500 -70.0
+     98.5000     64.7500 -70.0
+} -70.0
+{ -70.0
+     68.5000     65.7500 -70.0
+     69.2500     66.5000 -70.0
+     68.5000     68.2500 -70.0
+     66.7500     67.5000 -70.0
+} -70.0
+{ -70.0
+     63.7500     69.5000 -70.0
+     64.5000     68.7500 -70.0
+     65.2500     69.5000 -70.0
+     64.5000     71.2500 -70.0
+} -70.0
+{ -70.0
+     66.7500     70.5000 -70.0
+     67.5000     69.7500 -70.0
+     69.2500     70.5000 -70.0
+     68.5000     72.2500 -70.0
+} -70.0
+{ -70.0
+    144.7500     70.5000 -70.0
+    145.5000     69.7500 -70.0
+    149.2500     71.5000 -70.0
+    147.5000     73.2500 -70.0
+    145.7500     72.5000 -70.0
+} -70.0
+v 256 z -72.000000 -64.0
+{ -72.0
+    101.2500     49.5000 -72.0
+    100.5000     50.2500 -72.0
+     98.5000     50.2500 -72.0
+     94.5000     52.2500 -72.0
+     92.5000     52.2500 -72.0
+     90.5000     53.2500 -72.0
+     87.5000     53.2500 -72.0
+     83.5000     55.2500 -72.0
+     78.5000     55.2500 -72.0
+     76.5000     56.2500 -72.0
+     74.5000     56.2500 -72.0
+     67.5000     59.2500 -72.0
+     62.5000     63.2500 -72.0
+     60.5000     64.2500 -72.0
+     59.2500     67.5000 -72.0
+     60.2500     69.5000 -72.0
+     59.2500     74.5000 -72.0
+     57.5000     76.2500 -72.0
+     54.2500     80.5000 -72.0
+     47.5000     93.2500 -72.0
+     47.2500     95.5000 -72.0
+     44.2500    104.5000 -72.0
+     42.5000    108.2500 -72.0
+     42.2500    110.5000 -72.0
+     41.2500    113.5000 -72.0
+     40.5000    115.2500 -72.0
+     37.2500    124.5000 -72.0
+     36.5000    126.2500 -72.0
+     33.2500    135.5000 -72.0
+     32.5000    137.2500 -72.0
+     31.2500    145.5000 -72.0
+     30.2500    147.5000 -72.0
+     29.2500    156.5000 -72.0
+     28.5000    158.2500 -72.0
+     28.2500    172.5000 -72.0
+     29.2500    174.5000 -72.0
+     29.2500    179.5000 -72.0
+     30.2500    181.5000 -72.0
+     30.2500    183.5000 -72.0
+     31.2500    185.5000 -72.0
+     31.5000    187.7500 -72.0
+     37.2500    200.5000 -72.0
+     40.2500    204.5000 -72.0
+     41.2500    206.5000 -72.0
+     52.2500    217.5000 -72.0
+     56.5000    220.7500 -72.0
+     62.5000    223.7500 -72.0
+     66.2500    225.5000 -72.0
+     68.5000    225.7500 -72.0
+     73.5000    226.7500 -72.0
+     75.5000    225.7500 -72.0
+     77.2500    226.5000 -72.0
+     80.5000    226.7500 -72.0
+     87.5000    227.7500 -72.0
+     89.2500    228.5000 -72.0
+    112.5000    228.7500 -72.0
+    114.5000    227.7500 -72.0
+    127.5000    227.7500 -72.0
+    129.5000    226.7500 -72.0
+    133.5000    226.7500 -72.0
+    145.5000    220.7500 -72.0
+    149.5000    217.7500 -72.0
+    151.5000    216.7500 -72.0
+    158.5000    209.7500 -72.0
+    163.5000    203.7500 -72.0
+    167.7500    197.5000 -72.0
+    171.5000    190.7500 -72.0
+    173.7500    184.5000 -72.0
+    174.5000    182.7500 -72.0
+    175.7500    174.5000 -72.0
+    176.5000    172.7500 -72.0
+    176.7500    139.5000 -72.0
+    175.7500    137.5000 -72.0
+    175.7500    134.5000 -72.0
+    174.7500    132.5000 -72.0
+    174.7500    130.5000 -72.0
+    173.7500    128.5000 -72.0
+    173.7500    126.5000 -72.0
+    171.7500    122.5000 -72.0
+    171.7500    120.5000 -72.0
+    169.7500    116.5000 -72.0
+    169.7500    114.5000 -72.0
+    166.7500    108.5000 -72.0
+    166.7500    106.5000 -72.0
+    154.7500     82.5000 -72.0
+    151.7500     77.5000 -72.0
+    151.7500     75.5000 -72.0
+    154.7500     68.5000 -72.0
+    150.7500     64.5000 -72.0
+    149.7500     62.5000 -72.0
+    147.5000     61.2500 -72.0
+    141.5000     58.2500 -72.0
+    139.7500     57.5000 -72.0
+    136.5000     57.2500 -72.0
+    136.2500     58.5000 -72.0
+    137.5000     59.7500 -72.0
+    139.5000     60.7500 -72.0
+    144.2500     66.5000 -72.0
+    146.2500     70.5000 -72.0
+    143.5000     73.2500 -72.0
+    141.5000     73.2500 -72.0
+    139.5000     74.2500 -72.0
+    136.5000     74.2500 -72.0
+    132.5000     72.2500 -72.0
+    125.5000     71.2500 -72.0
+    117.7500     65.5000 -72.0
+    110.5000     65.2500 -72.0
+    105.7500     61.5000 -72.0
+    101.5000     64.2500 -72.0
+     96.5000     64.2500 -72.0
+     88.5000     70.2500 -72.0
+     84.5000     67.2500 -72.0
+     78.5000     70.2500 -72.0
+     73.5000     70.2500 -72.0
+     69.7500     68.5000 -72.0
+     69.7500     66.5000 -72.0
+     70.7500     63.5000 -72.0
+     73.5000     61.7500 -72.0
+     77.5000     59.7500 -72.0
+     81.5000     56.7500 -72.0
+     83.5000     55.7500 -72.0
+     85.2500     57.5000 -72.0
+     85.2500     60.5000 -72.0
+     89.7500     58.5000 -72.0
+     90.7500     56.5000 -72.0
+     92.5000     55.7500 -72.0
+     98.5000     52.7500 -72.0
+    103.5000     52.7500 -72.0
+    107.5000     50.7500 -72.0
+    112.5000     50.7500 -72.0
+    118.2500     53.5000 -72.0
+    120.5000     53.7500 -72.0
+    124.5000     57.7500 -72.0
+    126.5000     58.7500 -72.0
+    128.5000     56.7500 -72.0
+    130.5000     56.7500 -72.0
+    130.7500     55.5000 -72.0
+    126.7500     53.5000 -72.0
+    124.5000     53.2500 -72.0
+    115.5000     50.2500 -72.0
+    113.7500     49.5000 -72.0
+} -72.0
+{ -72.0
+    102.7500     65.5000 -72.0
+    103.5000     64.7500 -72.0
+    107.5000     64.7500 -72.0
+    111.5000     67.7500 -72.0
+    113.5000     66.7500 -72.0
+    117.5000     66.7500 -72.0
+    119.2500     68.5000 -72.0
+    123.5000     71.7500 -72.0
+    125.5000     72.7500 -72.0
+    126.2500     74.5000 -72.0
+    131.5000     74.7500 -72.0
+    135.5000     76.7500 -72.0
+    137.5000     75.7500 -72.0
+    142.5000     75.7500 -72.0
+    144.5000     77.7500 -72.0
+    151.2500     81.5000 -72.0
+    154.2500     86.5000 -72.0
+    153.2500     88.5000 -72.0
+    156.2500     94.5000 -72.0
+    160.2500    101.5000 -72.0
+    160.2500    107.5000 -72.0
+    161.2500    109.5000 -72.0
+    161.2500    111.5000 -72.0
+    162.2500    113.5000 -72.0
+    162.2500    118.5000 -72.0
+    163.2500    120.5000 -72.0
+    163.2500    122.5000 -72.0
+    164.2500    124.5000 -72.0
+    164.2500    126.5000 -72.0
+    165.2500    128.5000 -72.0
+    165.2500    133.5000 -72.0
+    166.2500    135.5000 -72.0
+    166.2500    139.5000 -72.0
+    167.2500    141.5000 -72.0
+    167.2500    145.5000 -72.0
+    168.2500    147.5000 -72.0
+    168.2500    162.5000 -72.0
+    171.2500    168.5000 -72.0
+    169.5000    171.2500 -72.0
+    169.2500    174.5000 -72.0
+    168.2500    179.5000 -72.0
+    165.2500    183.5000 -72.0
+    163.2500    187.5000 -72.0
+    158.2500    195.5000 -72.0
+    156.2500    199.5000 -72.0
+    146.5000    208.2500 -72.0
+    144.5000    209.2500 -72.0
+    136.5000    214.2500 -72.0
+    127.5000    219.2500 -72.0
+    125.5000    219.2500 -72.0
+    121.5000    221.2500 -72.0
+    119.5000    221.2500 -72.0
+    117.5000    222.2500 -72.0
+    110.5000    222.2500 -72.0
+    108.7500    221.5000 -72.0
+     99.5000    221.2500 -72.0
+     92.5000    220.2500 -72.0
+     90.5000    221.2500 -72.0
+     84.5000    221.2500 -72.0
+     79.5000    220.2500 -72.0
+     76.5000    219.2500 -72.0
+     66.7500    214.5000 -72.0
+     60.5000    210.2500 -72.0
+     58.5000    209.2500 -72.0
+     49.7500    200.5000 -72.0
+     40.7500    188.5000 -72.0
+     40.7500    186.5000 -72.0
+     37.7500    180.5000 -72.0
+     37.7500    178.5000 -72.0
+     35.7500    174.5000 -72.0
+     35.7500    169.5000 -72.0
+     34.7500    167.5000 -72.0
+     34.7500    163.5000 -72.0
+     33.7500    161.5000 -72.0
+     35.7500    158.5000 -72.0
+     36.7500    151.5000 -72.0
+     37.7500    146.5000 -72.0
+     41.7500    134.5000 -72.0
+     45.5000    125.7500 -72.0
+     45.7500    116.5000 -72.0
+     46.5000    114.7500 -72.0
+     46.7500    108.5000 -72.0
+     48.5000    104.7500 -72.0
+     48.7500    101.5000 -72.0
+     49.7500     98.5000 -72.0
+     52.5000     92.7500 -72.0
+     55.7500     83.5000 -72.0
+     57.5000     79.7500 -72.0
+     62.5000     76.7500 -72.0
+     66.5000     73.7500 -72.0
+     68.5000     73.7500 -72.0
+     71.5000     74.7500 -72.0
+     75.5000     72.7500 -72.0
+     77.2500     73.5000 -72.0
+     80.5000     73.7500 -72.0
+     80.7500     72.5000 -72.0
+     82.5000     70.7500 -72.0
+     87.5000     71.7500 -72.0
+     93.5000     68.7500 -72.0
+     98.5000     65.7500 -72.0
+} -72.0
+{ -72.0
+     64.7500     67.5000 -72.0
+     65.5000     66.7500 -72.0
+     68.2500     70.5000 -72.0
+     67.5000     71.2500 -72.0
+     63.7500     69.5000 -72.0
+} -72.0
+{ -72.0
+    147.7500     71.5000 -72.0
+    148.5000     70.7500 -72.0
+    150.2500     71.5000 -72.0
+    150.2500     73.5000 -72.0
+    149.5000     75.2500 -72.0
+    147.7500     73.5000 -72.0
+} -72.0
+{ -72.0
+     61.7500     72.5000 -72.0
+     62.5000     71.7500 -72.0
+     63.2500     72.5000 -72.0
+     62.5000     73.2500 -72.0
+} -72.0
+v 199 z -74.000000 -64.0
+{ -74.0
+    105.2500     48.5000 -74.0
+    104.5000     49.2500 -74.0
+    100.5000     49.2500 -74.0
+     92.5000     53.2500 -74.0
+     90.5000     53.2500 -74.0
+     88.5000     54.2500 -74.0
+     91.2500     58.5000 -74.0
+     94.5000     55.7500 -74.0
+     98.5000     52.7500 -74.0
+    100.5000     52.7500 -74.0
+    102.5000     51.7500 -74.0
+    105.5000     52.7500 -74.0
+    106.5000     50.7500 -74.0
+    112.5000     50.7500 -74.0
+    120.2500     54.5000 -74.0
+    121.5000     56.7500 -74.0
+    123.5000     57.7500 -74.0
+    124.7500     54.5000 -74.0
+    113.7500     49.5000 -74.0
+    111.5000     49.2500 -74.0
+    109.7500     48.5000 -74.0
+} -74.0
+{ -74.0
+     68.2500     57.5000 -74.0
+     66.5000     58.2500 -74.0
+     59.5000     64.2500 -74.0
+     59.2500     68.5000 -74.0
+     60.2500     71.5000 -74.0
+     58.2500     76.5000 -74.0
+     55.2500     79.5000 -74.0
+     47.5000     94.2500 -74.0
+     47.2500     96.5000 -74.0
+     32.2500    137.5000 -74.0
+     28.5000    157.2500 -74.0
+     28.2500    172.5000 -74.0
+     29.2500    174.5000 -74.0
+     29.2500    179.5000 -74.0
+     30.2500    181.5000 -74.0
+     31.2500    188.5000 -74.0
+     39.2500    204.5000 -74.0
+     43.2500    208.5000 -74.0
+     44.5000    210.7500 -74.0
+     54.5000    219.7500 -74.0
+     61.2500    223.5000 -74.0
+     69.2500    226.5000 -74.0
+     81.5000    226.7500 -74.0
+     86.2500    228.5000 -74.0
+    107.5000    229.7500 -74.0
+    109.5000    228.7500 -74.0
+    113.5000    228.7500 -74.0
+    115.5000    227.7500 -74.0
+    128.5000    227.7500 -74.0
+    130.5000    226.7500 -74.0
+    132.5000    226.7500 -74.0
+    143.5000    222.7500 -74.0
+    150.5000    217.7500 -74.0
+    160.7500    207.5000 -74.0
+    170.5000    193.7500 -74.0
+    173.7500    184.5000 -74.0
+    176.5000    172.7500 -74.0
+    177.7500    157.5000 -74.0
+    176.7500    155.5000 -74.0
+    177.7500    143.5000 -74.0
+    176.7500    141.5000 -74.0
+    176.7500    137.5000 -74.0
+    175.7500    135.5000 -74.0
+    174.7500    128.5000 -74.0
+    172.7500    124.5000 -74.0
+    172.7500    122.5000 -74.0
+    169.7500    116.5000 -74.0
+    169.7500    114.5000 -74.0
+    165.7500    106.5000 -74.0
+    163.7500    100.5000 -74.0
+    158.7500     92.5000 -74.0
+    154.7500     82.5000 -74.0
+    151.7500     79.5000 -74.0
+    151.7500     75.5000 -74.0
+    155.5000     69.7500 -74.0
+    155.7500     67.5000 -74.0
+    152.7500     63.5000 -74.0
+    148.7500     60.5000 -74.0
+    143.5000     59.2500 -74.0
+    143.2500     61.5000 -74.0
+    145.2500     63.5000 -74.0
+    148.2500     69.5000 -74.0
+    147.5000     70.2500 -74.0
+    147.2500     72.5000 -74.0
+    145.5000     74.2500 -74.0
+    141.5000     76.2500 -74.0
+    139.5000     76.2500 -74.0
+    139.2500     77.5000 -74.0
+    142.5000     77.7500 -74.0
+    148.5000     80.7500 -74.0
+    153.2500     88.5000 -74.0
+    153.2500     90.5000 -74.0
+    159.2500    101.5000 -74.0
+    159.2500    106.5000 -74.0
+    161.2500    110.5000 -74.0
+    163.2500    120.5000 -74.0
+    165.2500    124.5000 -74.0
+    165.2500    126.5000 -74.0
+    166.2500    128.5000 -74.0
+    166.2500    134.5000 -74.0
+    167.2500    136.5000 -74.0
+    167.2500    140.5000 -74.0
+    169.2500    147.5000 -74.0
+    169.2500    162.5000 -74.0
+    171.2500    166.5000 -74.0
+    169.5000    168.2500 -74.0
+    169.2500    175.5000 -74.0
+    167.5000    179.2500 -74.0
+    167.2500    181.5000 -74.0
+    155.2500    200.5000 -74.0
+    146.5000    208.2500 -74.0
+    125.5000    220.2500 -74.0
+    123.5000    220.2500 -74.0
+    119.5000    222.2500 -74.0
+    109.5000    222.2500 -74.0
+    107.7500    221.5000 -74.0
+    101.5000    221.2500 -74.0
+     99.5000    222.2500 -74.0
+     97.7500    221.5000 -74.0
+     81.5000    221.2500 -74.0
+     72.5000    218.2500 -74.0
+     60.5000    211.2500 -74.0
+     50.5000    202.2500 -74.0
+     42.7500    191.5000 -74.0
+     37.7500    181.5000 -74.0
+     37.7500    179.5000 -74.0
+     35.7500    175.5000 -74.0
+     35.7500    170.5000 -74.0
+     34.7500    168.5000 -74.0
+     34.7500    159.5000 -74.0
+     36.7500    149.5000 -74.0
+     45.5000    125.7500 -74.0
+     46.7500    113.5000 -74.0
+     48.5000    111.7500 -74.0
+     48.7500    109.5000 -74.0
+     46.7500    107.5000 -74.0
+     49.7500    102.5000 -74.0
+     50.7500     97.5000 -74.0
+     53.7500     91.5000 -74.0
+     52.7500     89.5000 -74.0
+     54.7500     84.5000 -74.0
+     57.5000     80.7500 -74.0
+     65.5000     74.7500 -74.0
+     67.5000     74.7500 -74.0
+     73.5000     76.7500 -74.0
+     75.5000     74.7500 -74.0
+     79.2500     76.5000 -74.0
+     81.5000     76.7500 -74.0
+     83.5000     74.7500 -74.0
+     85.5000     74.7500 -74.0
+     87.5000     72.7500 -74.0
+     96.7500     67.5000 -74.0
+     94.5000     67.2500 -74.0
+     90.5000     69.2500 -74.0
+     88.5000     69.2500 -74.0
+     82.5000     73.2500 -74.0
+     72.5000     73.2500 -74.0
+     69.5000     72.2500 -74.0
+     66.7500     69.5000 -74.0
+     67.7500     64.5000 -74.0
+     74.7500     57.5000 -74.0
+} -74.0
+{ -74.0
+    105.2500     61.5000 -74.0
+    105.2500     62.5000 -74.0
+    100.5000     66.2500 -74.0
+     97.5000     66.2500 -74.0
+     98.2500     67.5000 -74.0
+    101.5000     67.7500 -74.0
+    103.5000     65.7500 -74.0
+    108.5000     65.7500 -74.0
+    110.5000     68.7500 -74.0
+    112.5000     67.7500 -74.0
+    117.5000     67.7500 -74.0
+    123.2500     73.5000 -74.0
+    125.2500     77.5000 -74.0
+    125.2500     79.5000 -74.0
+    126.5000     79.7500 -74.0
+    128.5000     77.7500 -74.0
+    135.5000     77.7500 -74.0
+    136.7500     76.5000 -74.0
+    131.5000     76.2500 -74.0
+    125.5000     73.2500 -74.0
+    122.7500     68.5000 -74.0
+    120.5000     68.2500 -74.0
+    115.5000     66.2500 -74.0
+    113.5000     67.2500 -74.0
+    111.5000     67.2500 -74.0
+} -74.0
+{ -74.0
+     62.7500     69.5000 -74.0
+     63.5000     68.7500 -74.0
+     65.2500     69.5000 -74.0
+     65.2500     71.5000 -74.0
+     63.5000     73.2500 -74.0
+     61.7500     72.5000 -74.0
+     62.5000     71.7500 -74.0
+} -74.0
+{ -74.0
+    150.5000     71.7500 -74.0
+    151.2500     72.5000 -74.0
+    150.2500     75.5000 -74.0
+    148.5000     76.2500 -74.0
+    147.7500     74.5000 -74.0
+} -74.0
+v 191 z -76.000000 -74.0
+{ -74.0
+    103.2500     48.5000 -74.0
+    101.5000     49.2500 -74.0
+     93.5000     54.2500 -74.0
+     93.2500     61.5000 -74.0
+     96.5000     54.7500 -74.0
+    102.5000     51.7500 -74.0
+    104.5000     51.7500 -74.0
+    106.2500     53.5000 -74.0
+    107.5000     51.7500 -74.0
+    113.5000     51.7500 -74.0
+    116.5000     52.7500 -74.0
+    120.2500     56.5000 -74.0
+    120.2500     59.5000 -74.0
+    121.7500     56.5000 -74.0
+    120.7500     53.5000 -74.0
+    111.7500     48.5000 -74.0
+} -74.0
+{ -74.0
+     65.2500     58.5000 -74.0
+     63.5000     59.2500 -74.0
+     57.5000     65.2500 -74.0
+     60.2500     70.5000 -74.0
+     60.2500     72.5000 -74.0
+     57.5000     78.2500 -74.0
+     54.2500     82.5000 -74.0
+     48.2500     94.5000 -74.0
+     38.2500    121.5000 -74.0
+     32.2500    135.5000 -74.0
+     31.2500    140.5000 -74.0
+     28.5000    156.2500 -74.0
+     28.2500    172.5000 -74.0
+     29.2500    174.5000 -74.0
+     29.2500    179.5000 -74.0
+     30.2500    181.5000 -74.0
+     30.2500    184.5000 -74.0
+     35.2500    197.5000 -74.0
+     41.2500    207.5000 -74.0
+     56.2500    221.5000 -74.0
+     68.2500    226.5000 -74.0
+     78.5000    226.7500 -74.0
+     89.2500    229.5000 -74.0
+    110.5000    229.7500 -74.0
+    112.5000    228.7500 -74.0
+    125.5000    228.7500 -74.0
+    127.5000    227.7500 -74.0
+    130.5000    227.7500 -74.0
+    143.5000    222.7500 -74.0
+    153.5000    215.7500 -74.0
+    160.7500    207.5000 -74.0
+    170.5000    193.7500 -74.0
+    173.7500    184.5000 -74.0
+    176.5000    172.7500 -74.0
+    176.7500    165.5000 -74.0
+    177.5000    163.7500 -74.0
+    177.7500    141.5000 -74.0
+    176.7500    139.5000 -74.0
+    176.7500    134.5000 -74.0
+    174.7500    130.5000 -74.0
+    174.7500    127.5000 -74.0
+    163.7500    101.5000 -74.0
+    155.7500     89.5000 -74.0
+    155.7500     87.5000 -74.0
+    151.7500     79.5000 -74.0
+    151.7500     76.5000 -74.0
+    152.7500     73.5000 -74.0
+    156.5000     70.7500 -74.0
+    156.7500     67.5000 -74.0
+    154.5000     64.2500 -74.0
+    150.7500     61.5000 -74.0
+    147.5000     61.2500 -74.0
+    147.2500     62.5000 -74.0
+    149.2500     66.5000 -74.0
+    149.2500     70.5000 -74.0
+    147.2500     75.5000 -74.0
+    148.5000     75.7500 -74.0
+    150.2500     77.5000 -74.0
+    149.5000     79.2500 -74.0
+    147.5000     78.2500 -74.0
+    146.7500     76.5000 -74.0
+    145.5000     76.2500 -74.0
+    141.5000     78.2500 -74.0
+    138.5000     78.2500 -74.0
+    136.5000     79.2500 -74.0
+    134.7500     78.5000 -74.0
+    125.5000     78.2500 -74.0
+    120.7500     68.5000 -74.0
+    110.5000     68.2500 -74.0
+    106.7500     63.5000 -74.0
+    104.5000     64.2500 -74.0
+    101.5000     68.2500 -74.0
+     99.5000     68.2500 -74.0
+    100.5000     69.7500 -74.0
+    103.5000     68.7500 -74.0
+    103.7500     66.5000 -74.0
+    105.5000     64.7500 -74.0
+    107.2500     65.5000 -74.0
+    110.5000     69.7500 -74.0
+    112.5000     68.7500 -74.0
+    115.5000     68.7500 -74.0
+    117.2500     69.5000 -74.0
+    123.2500     76.5000 -74.0
+    123.2500     78.5000 -74.0
+    125.2500     80.5000 -74.0
+    136.5000     80.7500 -74.0
+    139.5000     81.7500 -74.0
+    143.5000     79.7500 -74.0
+    145.5000     80.7500 -74.0
+    147.2500     84.5000 -74.0
+    151.2500     88.5000 -74.0
+    151.2500     91.5000 -74.0
+    153.2500     93.5000 -74.0
+    156.2500     98.5000 -74.0
+    156.2500    102.5000 -74.0
+    161.2500    110.5000 -74.0
+    161.2500    112.5000 -74.0
+    164.2500    118.5000 -74.0
+    164.2500    121.5000 -74.0
+    166.2500    125.5000 -74.0
+    166.2500    129.5000 -74.0
+    168.2500    136.5000 -74.0
+    168.2500    141.5000 -74.0
+    170.2500    147.5000 -74.0
+    170.2500    161.5000 -74.0
+    171.2500    163.5000 -74.0
+    171.2500    165.5000 -74.0
+    169.5000    167.2500 -74.0
+    169.2500    175.5000 -74.0
+    167.5000    179.2500 -74.0
+    167.2500    181.5000 -74.0
+    158.2500    195.5000 -74.0
+    151.5000    204.2500 -74.0
+    149.2500    205.5000 -74.0
+    148.2500    207.5000 -74.0
+    140.5000    212.2500 -74.0
+    125.5000    220.2500 -74.0
+    123.5000    220.2500 -74.0
+    119.5000    222.2500 -74.0
+    108.5000    222.2500 -74.0
+    103.5000    221.2500 -74.0
+    101.5000    222.2500 -74.0
+     98.5000    222.2500 -74.0
+     96.7500    221.5000 -74.0
+     80.5000    221.2500 -74.0
+     71.7500    217.5000 -74.0
+     69.5000    217.2500 -74.0
+     64.5000    213.2500 -74.0
+     58.5000    210.2500 -74.0
+     49.7500    201.5000 -74.0
+     43.7500    193.5000 -74.0
+     37.7500    181.5000 -74.0
+     37.7500    179.5000 -74.0
+     35.7500    175.5000 -74.0
+     35.7500    173.5000 -74.0
+     34.7500    171.5000 -74.0
+     34.7500    159.5000 -74.0
+     33.7500    157.5000 -74.0
+     35.5000    154.7500 -74.0
+     36.7500    148.5000 -74.0
+     45.5000    125.7500 -74.0
+     46.7500    117.5000 -74.0
+     49.5000    111.7500 -74.0
+     49.7500    107.5000 -74.0
+     48.7500    105.5000 -74.0
+     48.7500    103.5000 -74.0
+     51.7500    100.5000 -74.0
+     52.7500     95.5000 -74.0
+     54.7500     84.5000 -74.0
+     64.5000     75.7500 -74.0
+     67.5000     75.7500 -74.0
+     69.2500     77.5000 -74.0
+     80.5000     78.7500 -74.0
+     86.5000     75.7500 -74.0
+     93.7500     69.5000 -74.0
+     90.5000     69.2500 -74.0
+     89.5000     71.2500 -74.0
+     81.5000     76.2500 -74.0
+     76.5000     76.2500 -74.0
+     67.5000     74.2500 -74.0
+     65.7500     72.5000 -74.0
+     65.7500     64.5000 -74.0
+     69.7500     58.5000 -74.0
+} -74.0
+{ -74.0
+     62.7500     72.5000 -74.0
+     63.5000     71.7500 -74.0
+     64.2500     72.5000 -74.0
+     63.5000     73.2500 -74.0
+} -74.0
+{ -74.0
+    149.7500     73.5000 -74.0
+    150.5000     72.7500 -74.0
+    151.2500     73.5000 -74.0
+    150.5000     74.2500 -74.0
+} -74.0
+{ -74.0
+     61.7500    217.5000 -74.0
+     62.5000    216.7500 -74.0
+     63.2500    217.5000 -74.0
+     62.5000    218.2500 -74.0
+} -74.0
+v 184 z -78.000000 -64.0
+{ -78.0
+    105.2500     47.5000 -78.0
+    104.5000     48.2500 -78.0
+    102.5000     48.2500 -78.0
+     97.5000     52.2500 -78.0
+     95.5000     53.2500 -78.0
+     94.5000     55.2500 -78.0
+     94.2500     60.5000 -78.0
+     95.5000     60.7500 -78.0
+     95.7500     58.5000 -78.0
+     96.7500     55.5000 -78.0
+    101.5000     52.7500 -78.0
+    105.5000     52.7500 -78.0
+    107.5000     54.7500 -78.0
+    111.5000     52.7500 -78.0
+    113.2500     53.5000 -78.0
+    115.5000     53.7500 -78.0
+    118.2500     56.5000 -78.0
+    118.2500     58.5000 -78.0
+    119.5000     61.7500 -78.0
+    119.7500     54.5000 -78.0
+    114.5000     50.2500 -78.0
+    110.5000     48.2500 -78.0
+    108.7500     47.5000 -78.0
+} -78.0
+{ -78.0
+     64.2500     58.5000 -78.0
+     60.5000     60.2500 -78.0
+     58.2500     62.5000 -78.0
+     56.2500     66.5000 -78.0
+     60.2500     70.5000 -78.0
+     60.2500     73.5000 -78.0
+     49.5000     92.2500 -78.0
+     31.5000    137.2500 -78.0
+     31.2500    139.5000 -78.0
+     28.5000    155.2500 -78.0
+     28.2500    172.5000 -78.0
+     29.2500    174.5000 -78.0
+     29.2500    179.5000 -78.0
+     30.2500    181.5000 -78.0
+     30.2500    184.5000 -78.0
+     35.2500    197.5000 -78.0
+     41.2500    207.5000 -78.0
+     53.5000    219.7500 -78.0
+     60.2500    223.5000 -78.0
+     66.5000    225.7500 -78.0
+     74.2500    227.5000 -78.0
+     75.5000    226.7500 -78.0
+     93.2500    230.5000 -78.0
+    106.5000    230.7500 -78.0
+    108.5000    229.7500 -78.0
+    112.5000    229.7500 -78.0
+    114.5000    228.7500 -78.0
+    126.5000    228.7500 -78.0
+    128.5000    227.7500 -78.0
+    132.5000    227.7500 -78.0
+    140.5000    223.7500 -78.0
+    142.5000    223.7500 -78.0
+    154.5000    214.7500 -78.0
+    166.5000    199.7500 -78.0
+    172.7500    188.5000 -78.0
+    174.7500    181.5000 -78.0
+    175.7500    174.5000 -78.0
+    177.5000    164.7500 -78.0
+    177.7500    139.5000 -78.0
+    176.7500    137.5000 -78.0
+    175.7500    130.5000 -78.0
+    173.7500    126.5000 -78.0
+    173.5000    124.2500 -78.0
+    160.7500     96.5000 -78.0
+    155.7500     90.5000 -78.0
+    151.7500     82.5000 -78.0
+    151.7500     75.5000 -78.0
+    157.5000     70.7500 -78.0
+    157.7500     68.5000 -78.0
+    156.5000     65.2500 -78.0
+    152.7500     62.5000 -78.0
+    149.2500     62.5000 -78.0
+    151.2500     68.5000 -78.0
+    148.2500     74.5000 -78.0
+    149.2500     77.5000 -78.0
+    146.5000     80.2500 -78.0
+    142.7500     79.5000 -78.0
+    141.5000     80.2500 -78.0
+    127.5000     81.2500 -78.0
+    124.5000     80.2500 -78.0
+    122.5000     77.2500 -78.0
+    122.2500     79.5000 -78.0
+    123.5000     80.7500 -78.0
+    129.2500     83.5000 -78.0
+    138.5000     83.7500 -78.0
+    144.2500     86.5000 -78.0
+    144.2500     88.5000 -78.0
+    146.5000     88.7500 -78.0
+    149.5000     92.7500 -78.0
+    153.2500     95.5000 -78.0
+    151.2500     96.5000 -78.0
+    152.2500     99.5000 -78.0
+    157.2500    104.5000 -78.0
+    163.2500    113.5000 -78.0
+    163.2500    115.5000 -78.0
+    165.2500    119.5000 -78.0
+    165.2500    122.5000 -78.0
+    167.2500    126.5000 -78.0
+    168.2500    135.5000 -78.0
+    170.2500    137.5000 -78.0
+    169.5000    138.2500 -78.0
+    169.2500    142.5000 -78.0
+    170.2500    144.5000 -78.0
+    170.2500    152.5000 -78.0
+    171.2500    155.5000 -78.0
+    170.2500    158.5000 -78.0
+    172.2500    162.5000 -78.0
+    169.5000    167.2500 -78.0
+    169.2500    171.5000 -78.0
+    170.2500    173.5000 -78.0
+    169.2500    177.5000 -78.0
+    167.5000    179.2500 -78.0
+    167.2500    181.5000 -78.0
+    157.2500    197.5000 -78.0
+    148.5000    207.2500 -78.0
+    130.5000    218.2500 -78.0
+    120.5000    222.2500 -78.0
+    118.5000    222.2500 -78.0
+    116.5000    223.2500 -78.0
+     97.5000    222.2500 -78.0
+     95.7500    221.5000 -78.0
+     90.5000    221.2500 -78.0
+     88.5000    222.2500 -78.0
+     76.5000    220.2500 -78.0
+     68.7500    216.5000 -78.0
+     58.5000    210.2500 -78.0
+     50.7500    203.5000 -78.0
+     44.7500    195.5000 -78.0
+     38.7500    184.5000 -78.0
+     38.7500    182.5000 -78.0
+     35.7500    176.5000 -78.0
+     35.7500    172.5000 -78.0
+     34.7500    170.5000 -78.0
+     34.7500    152.5000 -78.0
+     36.7500    146.5000 -78.0
+     43.5000    130.7500 -78.0
+     46.7500    118.5000 -78.0
+     50.5000    110.7500 -78.0
+     51.7500    101.5000 -78.0
+     54.5000     95.7500 -78.0
+     54.7500     87.5000 -78.0
+     56.7500     82.5000 -78.0
+     59.5000     79.7500 -78.0
+     65.5000     76.7500 -78.0
+     69.2500     79.5000 -78.0
+     74.5000     79.7500 -78.0
+     76.2500     80.5000 -78.0
+     77.2500     82.5000 -78.0
+     80.7500     82.5000 -78.0
+     81.7500     80.5000 -78.0
+     84.7500     78.5000 -78.0
+     72.5000     78.2500 -78.0
+     66.5000     75.2500 -78.0
+     63.7500     69.5000 -78.0
+     63.7500     66.5000 -78.0
+     66.5000     59.7500 -78.0
+     65.7500     58.5000 -78.0
+} -78.0
+{ -78.0
+    104.2500     64.5000 -78.0
+    102.5000     70.2500 -78.0
+     99.5000     70.2500 -78.0
+    100.5000     71.7500 -78.0
+    102.5000     70.7500 -78.0
+    105.7500     71.5000 -78.0
+    104.7500     69.5000 -78.0
+} -78.0
+{ -78.0
+    108.2500     65.5000 -78.0
+    108.5000     69.7500 -78.0
+    110.5000     70.7500 -78.0
+    112.5000     69.7500 -78.0
+    109.7500     68.5000 -78.0
+} -78.0
+{ -78.0
+     92.2500     70.5000 -78.0
+     91.2500     72.5000 -78.0
+     88.2500     75.5000 -78.0
+     87.2500     77.5000 -78.0
+     88.5000     77.7500 -78.0
+     93.7500     70.5000 -78.0
+} -78.0
+{ -78.0
+    119.2500     71.5000 -78.0
+    118.5000     72.2500 -78.0
+    119.2500     74.5000 -78.0
+    121.7500     76.5000 -78.0
+    120.7500     74.5000 -78.0
+    120.7500     72.5000 -78.0
+} -78.0
+v 194 z -80.000000 -64.0
+{ -80.0
+    106.2500     46.5000 -80.0
+    102.5000     48.2500 -80.0
+     95.5000     55.2500 -80.0
+     95.2500     60.5000 -80.0
+     96.5000     59.7500 -80.0
+     96.7500     57.5000 -80.0
+     98.5000     55.7500 -80.0
+    105.5000     54.7500 -80.0
+    108.5000     55.7500 -80.0
+    110.5000     54.7500 -80.0
+    115.5000     54.7500 -80.0
+    118.5000     58.7500 -80.0
+    118.7500     56.5000 -80.0
+    114.7500     50.5000 -80.0
+    107.7500     46.5000 -80.0
+} -80.0
+{ -80.0
+     61.2500     59.5000 -80.0
+     56.5000     63.2500 -80.0
+     56.5000     67.7500 -80.0
+     60.2500     70.5000 -80.0
+     60.2500     75.5000 -80.0
+     58.2500     79.5000 -80.0
+     54.5000     85.2500 -80.0
+     54.2500     87.5000 -80.0
+     48.5000     95.2500 -80.0
+     48.2500     97.5000 -80.0
+     45.2500    103.5000 -80.0
+     44.2500    108.5000 -80.0
+     38.2500    120.5000 -80.0
+     31.2500    138.5000 -80.0
+     29.5000    145.2500 -80.0
+     29.2500    152.5000 -80.0
+     28.5000    154.2500 -80.0
+     28.2500    171.5000 -80.0
+     29.2500    173.5000 -80.0
+     29.2500    178.5000 -80.0
+     30.2500    180.5000 -80.0
+     31.5000    188.7500 -80.0
+     37.2500    201.5000 -80.0
+     41.2500    207.5000 -80.0
+     51.2500    217.5000 -80.0
+     57.2500    222.5000 -80.0
+     59.5000    222.7500 -80.0
+     65.5000    225.7500 -80.0
+     72.2500    227.5000 -80.0
+     79.5000    227.7500 -80.0
+     95.2500    231.5000 -80.0
+    104.5000    231.7500 -80.0
+    106.5000    230.7500 -80.0
+    115.5000    229.7500 -80.0
+    117.5000    228.7500 -80.0
+    118.2500    229.5000 -80.0
+    119.5000    228.7500 -80.0
+    126.5000    228.7500 -80.0
+    128.5000    227.7500 -80.0
+    135.5000    226.7500 -80.0
+    147.5000    220.7500 -80.0
+    155.5000    213.7500 -80.0
+    166.7500    199.5000 -80.0
+    172.7500    188.5000 -80.0
+    175.7500    177.5000 -80.0
+    176.7500    168.5000 -80.0
+    177.5000    166.7500 -80.0
+    177.7500    154.5000 -80.0
+    178.7500    147.5000 -80.0
+    177.7500    145.5000 -80.0
+    177.7500    138.5000 -80.0
+    172.7500    121.5000 -80.0
+    160.7500     96.5000 -80.0
+    152.7500     87.5000 -80.0
+    152.7500     85.5000 -80.0
+    149.7500     81.5000 -80.0
+    152.7500     74.5000 -80.0
+    158.5000     71.7500 -80.0
+    158.7500     69.5000 -80.0
+    157.7500     66.5000 -80.0
+    154.7500     63.5000 -80.0
+    151.2500     63.5000 -80.0
+    152.2500     65.5000 -80.0
+    152.2500     68.5000 -80.0
+    151.2500     71.5000 -80.0
+    146.5000     77.2500 -80.0
+    147.2500     78.5000 -80.0
+    145.2500     79.5000 -80.0
+    144.2500     81.5000 -80.0
+    145.2500     83.5000 -80.0
+    145.2500     89.5000 -80.0
+    144.5000     91.2500 -80.0
+    140.7500     85.5000 -80.0
+    140.7500     81.5000 -80.0
+    139.5000     81.2500 -80.0
+    135.5000     83.2500 -80.0
+    133.5000     83.2500 -80.0
+    131.5000     84.2500 -80.0
+    130.7500     83.5000 -80.0
+    128.5000     83.2500 -80.0
+    128.2500     84.5000 -80.0
+    133.2500     87.5000 -80.0
+    137.5000     87.7500 -80.0
+    157.2500    103.5000 -80.0
+    163.2500    112.5000 -80.0
+    163.2500    114.5000 -80.0
+    166.2500    120.5000 -80.0
+    166.2500    122.5000 -80.0
+    168.2500    126.5000 -80.0
+    169.2500    133.5000 -80.0
+    171.2500    137.5000 -80.0
+    170.5000    139.2500 -80.0
+    170.2500    144.5000 -80.0
+    171.2500    146.5000 -80.0
+    171.2500    157.5000 -80.0
+    172.2500    160.5000 -80.0
+    170.5000    164.2500 -80.0
+    169.5000    169.2500 -80.0
+    170.2500    170.5000 -80.0
+    170.2500    173.5000 -80.0
+    167.2500    181.5000 -80.0
+    157.2500    197.5000 -80.0
+    148.2500    207.5000 -80.0
+    141.5000    212.2500 -80.0
+    132.5000    217.2500 -80.0
+    118.5000    223.2500 -80.0
+    104.5000    222.2500 -80.0
+    102.5000    223.2500 -80.0
+     78.5000    221.2500 -80.0
+     72.5000    219.2500 -80.0
+     65.7500    214.5000 -80.0
+     56.5000    209.2500 -80.0
+     48.7500    201.5000 -80.0
+     45.7500    197.5000 -80.0
+     37.7500    182.5000 -80.0
+     37.7500    180.5000 -80.0
+     35.7500    176.5000 -80.0
+     35.7500    172.5000 -80.0
+     34.7500    170.5000 -80.0
+     34.7500    159.5000 -80.0
+     35.5000    157.7500 -80.0
+     35.7500    152.5000 -80.0
+     34.7500    150.5000 -80.0
+     34.7500    147.5000 -80.0
+     37.5000    141.7500 -80.0
+     37.7500    139.5000 -80.0
+     44.7500    125.5000 -80.0
+     46.7500    116.5000 -80.0
+     50.7500    110.5000 -80.0
+     51.7500    105.5000 -80.0
+     53.5000    103.7500 -80.0
+     53.7500    100.5000 -80.0
+     57.5000     94.7500 -80.0
+     57.7500     90.5000 -80.0
+     56.7500     88.5000 -80.0
+     56.7500     86.5000 -80.0
+     59.7500     80.5000 -80.0
+     62.5000     78.7500 -80.0
+     67.5000     78.7500 -80.0
+     69.2500     80.5000 -80.0
+     71.5000     80.7500 -80.0
+     75.2500     83.5000 -80.0
+     79.5000     83.7500 -80.0
+     81.2500     84.5000 -80.0
+     87.7500     80.5000 -80.0
+     88.7500     78.5000 -80.0
+     84.5000     81.2500 -80.0
+     75.5000     80.2500 -80.0
+     69.5000     78.2500 -80.0
+     65.7500     75.5000 -80.0
+     62.7500     69.5000 -80.0
+     63.7500     59.5000 -80.0
+} -80.0
+{ -80.0
+    118.2500     61.5000 -80.0
+    118.2500     63.5000 -80.0
+    118.7500     62.5000 -80.0
+} -80.0
+{ -80.0
+    104.2500     63.5000 -80.0
+    104.2500     65.5000 -80.0
+    105.7500     63.5000 -80.0
+} -80.0
+{ -80.0
+    107.2500     63.5000 -80.0
+    108.2500     64.5000 -80.0
+    108.7500     63.5000 -80.0
+} -80.0
+{ -80.0
+    108.2500     66.5000 -80.0
+    108.2500     71.5000 -80.0
+    111.5000     71.7500 -80.0
+} -80.0
+{ -80.0
+    104.2500     68.5000 -80.0
+    104.2500     70.5000 -80.0
+    102.5000     72.7500 -80.0
+    104.5000     71.7500 -80.0
+    105.2500     72.5000 -80.0
+    106.5000     71.7500 -80.0
+} -80.0
+{ -80.0
+    117.2500     73.5000 -80.0
+    120.2500     79.5000 -80.0
+    121.5000     79.7500 -80.0
+    119.7500     76.5000 -80.0
+    119.7500     73.5000 -80.0
+} -80.0
+{ -80.0
+    153.7500     92.5000 -80.0
+    154.5000     91.7500 -80.0
+    155.2500     92.5000 -80.0
+    154.5000     93.2500 -80.0
+} -80.0
+v 203 z -82.000000 -64.0
+{ -82.0
+    106.2500     45.5000 -82.0
+    104.5000     46.2500 -82.0
+     96.5000     55.2500 -82.0
+     96.7500     58.5000 -82.0
+     98.5000     56.7500 -82.0
+    100.5000     56.7500 -82.0
+    102.5000     55.7500 -82.0
+    106.5000     55.7500 -82.0
+    108.5000     56.7500 -82.0
+    110.5000     55.7500 -82.0
+    114.5000     55.7500 -82.0
+    116.2500     56.5000 -82.0
+    117.2500     58.5000 -82.0
+    118.5000     58.7500 -82.0
+    118.7500     57.5000 -82.0
+    117.7500     54.5000 -82.0
+    108.7500     45.5000 -82.0
+} -82.0
+{ -82.0
+     60.2500     60.5000 -82.0
+     58.5000     61.2500 -82.0
+     55.5000     64.2500 -82.0
+     55.2500     67.5000 -82.0
+     58.5000     69.7500 -82.0
+     61.2500     73.5000 -82.0
+     61.2500     78.5000 -82.0
+     55.2500     86.5000 -82.0
+     56.2500     88.5000 -82.0
+     55.5000     90.2500 -82.0
+     54.7500     88.5000 -82.0
+     53.5000     88.2500 -82.0
+     52.2500     90.5000 -82.0
+     31.2500    136.5000 -82.0
+     29.5000    143.2500 -82.0
+     29.2500    152.5000 -82.0
+     28.5000    154.2500 -82.0
+     28.2500    171.5000 -82.0
+     29.2500    173.5000 -82.0
+     30.2500    183.5000 -82.0
+     31.2500    185.5000 -82.0
+     31.5000    188.7500 -82.0
+     37.2500    201.5000 -82.0
+     41.2500    207.5000 -82.0
+     52.2500    218.5000 -82.0
+     56.5000    221.7500 -82.0
+     71.2500    227.5000 -82.0
+     80.5000    227.7500 -82.0
+     84.5000    229.7500 -82.0
+     91.2500    231.5000 -82.0
+    103.5000    232.7500 -82.0
+    113.5000    229.7500 -82.0
+    121.5000    229.7500 -82.0
+    123.5000    228.7500 -82.0
+    126.5000    228.7500 -82.0
+    134.7500    226.5000 -82.0
+    147.5000    220.7500 -82.0
+    154.5000    214.7500 -82.0
+    163.5000    203.7500 -82.0
+    171.5000    190.7500 -82.0
+    171.7500    188.5000 -82.0
+    173.7500    184.5000 -82.0
+    175.7500    175.5000 -82.0
+    177.5000    166.7500 -82.0
+    178.7500    143.5000 -82.0
+    177.7500    141.5000 -82.0
+    177.7500    137.5000 -82.0
+    176.7500    135.5000 -82.0
+    175.7500    129.5000 -82.0
+    173.7500    125.5000 -82.0
+    173.7500    123.5000 -82.0
+    162.7500    101.5000 -82.0
+    157.5000     93.2500 -82.0
+    153.7500     90.5000 -82.0
+    152.7500     88.5000 -82.0
+    150.5000     88.2500 -82.0
+    147.7500     83.5000 -82.0
+    148.7500     80.5000 -82.0
+    150.5000     79.7500 -82.0
+    153.7500     74.5000 -82.0
+    158.5000     72.7500 -82.0
+    159.5000     70.7500 -82.0
+    158.7500     67.5000 -82.0
+    153.5000     64.2500 -82.0
+    153.2500     67.5000 -82.0
+    150.5000     74.2500 -82.0
+    148.5000     75.2500 -82.0
+    143.5000     80.2500 -82.0
+    134.5000     85.2500 -82.0
+    126.5000     85.2500 -82.0
+    127.2500     87.5000 -82.0
+    128.5000     87.7500 -82.0
+    131.2500     91.5000 -82.0
+    143.5000     92.7500 -82.0
+    143.7500     90.5000 -82.0
+    141.7500     88.5000 -82.0
+    139.5000     90.2500 -82.0
+    135.5000     90.2500 -82.0
+    133.7500     89.5000 -82.0
+    136.5000     86.7500 -82.0
+    140.5000     86.7500 -82.0
+    140.7500     84.5000 -82.0
+    142.5000     82.7500 -82.0
+    143.2500     83.5000 -82.0
+    143.2500     85.5000 -82.0
+    146.2500     87.5000 -82.0
+    145.5000     91.2500 -82.0
+    148.5000     92.7500 -82.0
+    151.2500     95.5000 -82.0
+    153.2500     99.5000 -82.0
+    161.2500    108.5000 -82.0
+    165.2500    116.5000 -82.0
+    165.2500    118.5000 -82.0
+    167.2500    120.5000 -82.0
+    167.2500    123.5000 -82.0
+    170.2500    129.5000 -82.0
+    170.2500    132.5000 -82.0
+    171.2500    134.5000 -82.0
+    171.2500    140.5000 -82.0
+    170.2500    142.5000 -82.0
+    171.2500    144.5000 -82.0
+    171.2500    151.5000 -82.0
+    172.2500    153.5000 -82.0
+    172.2500    158.5000 -82.0
+    170.5000    163.2500 -82.0
+    170.2500    173.5000 -82.0
+    167.2500    181.5000 -82.0
+    154.2500    201.5000 -82.0
+    147.5000    208.2500 -82.0
+    143.5000    211.2500 -82.0
+    122.5000    222.2500 -82.0
+    120.5000    222.2500 -82.0
+    114.5000    224.2500 -82.0
+    113.7500    223.5000 -82.0
+    109.5000    223.2500 -82.0
+    106.5000    222.2500 -82.0
+    104.5000    223.2500 -82.0
+     82.5000    222.2500 -82.0
+     74.5000    220.2500 -82.0
+     56.5000    209.2500 -82.0
+     46.7500    199.5000 -82.0
+     37.7500    182.5000 -82.0
+     37.7500    180.5000 -82.0
+     35.7500    176.5000 -82.0
+     35.7500    172.5000 -82.0
+     34.7500    170.5000 -82.0
+     34.7500    158.5000 -82.0
+     35.5000    156.7500 -82.0
+     35.7500    145.5000 -82.0
+     34.7500    142.5000 -82.0
+     37.5000    136.7500 -82.0
+     40.7500    132.5000 -82.0
+     42.7500    128.5000 -82.0
+     47.7500    113.5000 -82.0
+     50.5000    110.7500 -82.0
+     51.7500    106.5000 -82.0
+     56.5000     97.7500 -82.0
+     60.5000     94.7500 -82.0
+     60.7500     92.5000 -82.0
+     65.7500     87.5000 -82.0
+     61.5000     87.2500 -82.0
+     59.7500     83.5000 -82.0
+     63.5000     80.7500 -82.0
+     66.5000     80.7500 -82.0
+     75.2500     85.5000 -82.0
+     81.5000     85.7500 -82.0
+     84.7500     84.5000 -82.0
+     85.7500     82.5000 -82.0
+     84.5000     83.2500 -82.0
+     80.5000     83.2500 -82.0
+     67.5000     78.2500 -82.0
+     63.7500     73.5000 -82.0
+     63.7500     71.5000 -82.0
+     61.7500     67.5000 -82.0
+     61.7500     63.5000 -82.0
+     62.5000     61.7500 -82.0
+     61.7500     60.5000 -82.0
+} -82.0
+{ -82.0
+    104.2500     68.5000 -82.0
+    104.2500     69.5000 -82.0
+    103.2500     72.5000 -82.0
+    104.5000     71.7500 -82.0
+    105.5000     72.7500 -82.0
+    107.5000     71.7500 -82.0
+    108.2500     72.5000 -82.0
+    110.5000     72.7500 -82.0
+    108.7500     70.5000 -82.0
+    108.5000     68.2500 -82.0
+    108.2500     70.5000 -82.0
+    106.5000     71.2500 -82.0
+} -82.0
+{ -82.0
+     93.2500     73.5000 -82.0
+     92.2500     76.5000 -82.0
+     94.5000     74.7500 -82.0
+} -82.0
+{ -82.0
+    117.2500     74.5000 -82.0
+    117.2500     76.5000 -82.0
+    118.5000     77.7500 -82.0
+    118.7500     74.5000 -82.0
+} -82.0
+{ -82.0
+    106.7500     49.5000 -82.0
+    107.5000     48.7500 -82.0
+    108.2500     49.5000 -82.0
+    108.2500     53.5000 -82.0
+    106.5000     54.2500 -82.0
+    105.7500     52.5000 -82.0
+} -82.0
+{ -82.0
+    150.7500     91.5000 -82.0
+    152.5000     90.7500 -82.0
+    153.2500     92.5000 -82.0
+    151.5000     93.2500 -82.0
+} -82.0
+v 193 z -84.000000 -82.0
+{ -64.0
+    106.2500     43.5000 -84.0
+    105.2500     44.5000 -84.0
+     96.5000     56.2500 -84.0
+     96.5000     60.7500 -84.0
+     96.7500     58.5000 -84.0
+     99.5000     56.7500 -84.0
+    103.5000     56.7500 -84.0
+    105.5000     54.7500 -84.0
+    105.7500     47.5000 -84.0
+    107.5000     46.7500 -84.0
+    109.2500     48.5000 -84.0
+    109.2500     52.5000 -84.0
+    108.2500     55.5000 -84.0
+    112.2500     57.5000 -84.0
+    115.5000     57.7500 -84.0
+    117.5000     58.7500 -84.0
+    117.7500     56.5000 -84.0
+    116.7500     53.5000 -84.0
+    112.7500     49.5000 -84.0
+    108.7500     43.5000 -84.0
+} -84.0
+{ -84.0
+     57.2500     62.5000 -84.0
+     55.5000     64.2500 -84.0
+     55.2500     68.5000 -84.0
+     59.2500     70.5000 -84.0
+     63.2500     78.5000 -84.0
+     62.2500     81.5000 -84.0
+     59.5000     84.2500 -84.0
+     59.2500     86.5000 -84.0
+     60.2500     88.5000 -84.0
+     56.5000     90.2500 -84.0
+     55.7500     89.5000 -84.0
+     55.7500     87.5000 -84.0
+     54.5000     88.2500 -84.0
+     51.2500     93.5000 -84.0
+     31.2500    135.5000 -84.0
+     28.5000    149.2500 -84.0
+     28.2500    170.5000 -84.0
+     29.2500    172.5000 -84.0
+     29.2500    177.5000 -84.0
+     30.2500    179.5000 -84.0
+     31.2500    186.5000 -84.0
+     35.2500    197.5000 -84.0
+     41.2500    207.5000 -84.0
+     53.2500    219.5000 -84.0
+     60.2500    223.5000 -84.0
+     71.2500    227.5000 -84.0
+     82.5000    228.7500 -84.0
+     86.5000    230.7500 -84.0
+     93.2500    232.5000 -84.0
+    107.5000    232.7500 -84.0
+    111.5000    230.7500 -84.0
+    116.5000    230.7500 -84.0
+    122.5000    228.7500 -84.0
+    126.5000    228.7500 -84.0
+    128.5000    227.7500 -84.0
+    130.5000    227.7500 -84.0
+    147.5000    220.7500 -84.0
+    156.5000    212.7500 -84.0
+    163.7500    203.5000 -84.0
+    172.7500    187.5000 -84.0
+    176.5000    173.7500 -84.0
+    177.7500    160.5000 -84.0
+    178.5000    158.7500 -84.0
+    178.7500    141.5000 -84.0
+    176.7500    134.5000 -84.0
+    175.7500    128.5000 -84.0
+    173.7500    124.5000 -84.0
+    173.7500    122.5000 -84.0
+    168.7500    112.5000 -84.0
+    157.7500     93.5000 -84.0
+    152.5000     90.2500 -84.0
+    151.5000     92.2500 -84.0
+    149.7500     91.5000 -84.0
+    150.7500     89.5000 -84.0
+    147.7500     88.5000 -84.0
+    149.5000     87.7500 -84.0
+    149.7500     85.5000 -84.0
+    145.7500     84.5000 -84.0
+    147.5000     79.7500 -84.0
+    149.7500     80.5000 -84.0
+    151.7500     76.5000 -84.0
+    154.5000     73.7500 -84.0
+    159.5000     73.7500 -84.0
+    159.7500     71.5000 -84.0
+    158.7500     68.5000 -84.0
+    155.7500     65.5000 -84.0
+    154.5000     66.2500 -84.0
+    152.2500     72.5000 -84.0
+    146.5000     78.2500 -84.0
+    138.5000     84.2500 -84.0
+    139.5000     86.7500 -84.0
+    141.5000     85.7500 -84.0
+    143.2500     86.5000 -84.0
+    142.5000     88.2500 -84.0
+    140.5000     88.2500 -84.0
+    134.5000     90.2500 -84.0
+    133.7500     88.5000 -84.0
+    135.5000     86.2500 -84.0
+    131.5000     88.2500 -84.0
+    124.2500     87.5000 -84.0
+    128.2500     92.5000 -84.0
+    135.5000     92.7500 -84.0
+    137.5000     90.7500 -84.0
+    144.5000     90.7500 -84.0
+    147.5000     91.7500 -84.0
+    151.2500     94.5000 -84.0
+    155.2500    101.5000 -84.0
+    163.2500    109.5000 -84.0
+    165.2500    113.5000 -84.0
+    165.2500    115.5000 -84.0
+    168.2500    119.5000 -84.0
+    168.2500    121.5000 -84.0
+    170.2500    125.5000 -84.0
+    170.2500    127.5000 -84.0
+    171.2500    129.5000 -84.0
+    171.2500    135.5000 -84.0
+    172.2500    137.5000 -84.0
+    171.5000    139.2500 -84.0
+    171.2500    148.5000 -84.0
+    173.2500    152.5000 -84.0
+    173.2500    155.5000 -84.0
+    170.5000    164.2500 -84.0
+    170.2500    173.5000 -84.0
+    168.5000    177.2500 -84.0
+    168.2500    179.5000 -84.0
+    161.2500    191.5000 -84.0
+    154.2500    201.5000 -84.0
+    147.5000    208.2500 -84.0
+    132.5000    218.2500 -84.0
+    130.5000    218.2500 -84.0
+    122.5000    222.2500 -84.0
+    120.5000    222.2500 -84.0
+    116.5000    224.2500 -84.0
+    104.5000    223.2500 -84.0
+    102.5000    224.2500 -84.0
+     99.5000    224.2500 -84.0
+     94.7500    222.5000 -84.0
+     79.5000    222.2500 -84.0
+     70.7500    218.5000 -84.0
+     60.5000    211.2500 -84.0
+     56.5000    209.2500 -84.0
+     46.7500    199.5000 -84.0
+     39.7500    187.5000 -84.0
+     39.7500    185.5000 -84.0
+     35.7500    177.5000 -84.0
+     35.7500    174.5000 -84.0
+     34.7500    172.5000 -84.0
+     34.7500    156.5000 -84.0
+     35.5000    154.7500 -84.0
+     35.7500    145.5000 -84.0
+     34.7500    143.5000 -84.0
+     35.5000    141.7500 -84.0
+     35.7500    137.5000 -84.0
+     40.5000    131.7500 -84.0
+     49.5000    108.7500 -84.0
+     49.7500    106.5000 -84.0
+     52.5000    102.7500 -84.0
+     52.7500    100.5000 -84.0
+     55.7500     97.5000 -84.0
+     62.5000     92.7500 -84.0
+     69.5000     91.7500 -84.0
+     73.5000     89.7500 -84.0
+     83.7500     87.5000 -84.0
+     85.5000     84.2500 -84.0
+     83.5000     85.2500 -84.0
+     78.5000     85.2500 -84.0
+     72.7500     81.5000 -84.0
+     70.5000     81.2500 -84.0
+     64.7500     74.5000 -84.0
+     60.7500     66.5000 -84.0
+     60.7500     62.5000 -84.0
+} -84.0
+{ -84.0
+    109.2500     70.5000 -84.0
+    109.5000     73.7500 -84.0
+    111.5000     74.7500 -84.0
+    112.5000     74.2500 -84.0
+    110.5000     73.2500 -84.0
+} -84.0
+{ -84.0
+     94.2500     75.5000 -84.0
+     93.2500     76.5000 -84.0
+     94.7500     76.5000 -84.0
+} -84.0
+{ -84.0
+    115.2500     75.5000 -84.0
+    116.2500     76.5000 -84.0
+    116.7500     75.5000 -84.0
+} -84.0
+{ -84.0
+     63.7500     87.5000 -84.0
+     64.5000     86.7500 -84.0
+     67.5000     86.7500 -84.0
+     69.2500     88.5000 -84.0
+     67.5000     89.2500 -84.0
+     63.5000     91.2500 -84.0
+     62.7500     90.5000 -84.0
+} -84.0
+{ -84.0
+    144.7500     89.5000 -84.0
+    145.5000     88.7500 -84.0
+    146.2500     89.5000 -84.0
+    145.5000     90.2500 -84.0
+} -84.0
+v 247 z -86.000000 -64.0
+{ -86.0
+    107.2500     40.5000 -86.0
+    105.2500     42.5000 -86.0
+    103.2500     46.5000 -86.0
+     97.5000     54.2500 -86.0
+     97.2500     57.5000 -86.0
+     98.5000     57.7500 -86.0
+    101.7500     56.5000 -86.0
+    105.5000     48.7500 -86.0
+    105.7500     46.5000 -86.0
+    107.5000     44.7500 -86.0
+    109.2500     46.5000 -86.0
+    109.2500     49.5000 -86.0
+    111.2500     53.5000 -86.0
+    111.2500     56.5000 -86.0
+    113.2500     58.5000 -86.0
+    114.5000     57.7500 -86.0
+    117.5000     57.7500 -86.0
+    117.7500     56.5000 -86.0
+    114.7500     50.5000 -86.0
+    111.7500     47.5000 -86.0
+    111.7500     44.5000 -86.0
+    108.7500     40.5000 -86.0
+} -86.0
+{ -86.0
+     96.2500     58.5000 -86.0
+     96.2500     60.5000 -86.0
+     96.7500     59.5000 -86.0
+} -86.0
+{ -86.0
+     57.2500     63.5000 -86.0
+     55.5000     65.2500 -86.0
+     55.2500     69.5000 -86.0
+     59.2500     70.5000 -86.0
+     62.2500     76.5000 -86.0
+     65.2500     77.5000 -86.0
+     65.2500     81.5000 -86.0
+     68.5000     84.7500 -86.0
+     70.5000     83.7500 -86.0
+     75.5000     84.7500 -86.0
+     76.2500     86.5000 -86.0
+     78.2500     87.5000 -86.0
+     78.7500     86.5000 -86.0
+     76.5000     84.2500 -86.0
+     70.5000     81.2500 -86.0
+     63.7500     73.5000 -86.0
+     60.7500     67.5000 -86.0
+     60.7500     65.5000 -86.0
+     59.7500     63.5000 -86.0
+} -86.0
+{ -86.0
+    154.2500     67.5000 -86.0
+    153.5000     68.2500 -86.0
+    153.2500     70.5000 -86.0
+    152.2500     73.5000 -86.0
+    144.2500     80.5000 -86.0
+    143.2500     82.5000 -86.0
+    145.5000     82.7500 -86.0
+    147.5000     80.7500 -86.0
+    148.2500     81.5000 -86.0
+    154.5000     74.7500 -86.0
+    159.5000     74.7500 -86.0
+    160.7500     73.5000 -86.0
+    159.7500     71.5000 -86.0
+    159.7500     69.5000 -86.0
+    157.7500     67.5000 -86.0
+} -86.0
+{ -86.0
+    114.2500     76.5000 -86.0
+    113.5000     77.2500 -86.0
+    115.2500     78.5000 -86.0
+    115.7500     77.5000 -86.0
+} -86.0
+{ -86.0
+     63.2500     82.5000 -86.0
+     63.2500     83.5000 -86.0
+     62.5000     85.2500 -86.0
+     62.2500     87.5000 -86.0
+     59.5000     91.2500 -86.0
+     57.5000     91.2500 -86.0
+     55.7500     89.5000 -86.0
+     56.7500     87.5000 -86.0
+     54.5000     89.2500 -86.0
+     51.2500     94.5000 -86.0
+     36.5000    123.2500 -86.0
+     36.2500    125.5000 -86.0
+     30.2500    137.5000 -86.0
+     29.2500    146.5000 -86.0
+     28.5000    148.2500 -86.0
+     28.2500    168.5000 -86.0
+     29.2500    170.5000 -86.0
+     29.2500    175.5000 -86.0
+     30.2500    177.5000 -86.0
+     30.2500    181.5000 -86.0
+     31.2500    183.5000 -86.0
+     31.2500    185.5000 -86.0
+     32.2500    187.5000 -86.0
+     32.5000    190.7500 -86.0
+     37.2500    201.5000 -86.0
+     41.2500    206.5000 -86.0
+     42.2500    208.5000 -86.0
+     51.2500    217.5000 -86.0
+     55.5000    220.7500 -86.0
+     65.5000    225.7500 -86.0
+     74.5000    227.7500 -86.0
+     76.2500    228.5000 -86.0
+     80.5000    228.7500 -86.0
+     82.2500    229.5000 -86.0
+     88.5000    231.7500 -86.0
+     90.2500    232.5000 -86.0
+     94.5000    232.7500 -86.0
+     96.2500    233.5000 -86.0
+    104.5000    233.7500 -86.0
+    106.5000    232.7500 -86.0
+    108.5000    232.7500 -86.0
+    112.5000    230.7500 -86.0
+    116.5000    230.7500 -86.0
+    118.5000    229.7500 -86.0
+    120.5000    229.7500 -86.0
+    122.5000    228.7500 -86.0
+    126.5000    228.7500 -86.0
+    128.5000    227.7500 -86.0
+    130.5000    227.7500 -86.0
+    134.5000    225.7500 -86.0
+    136.5000    225.7500 -86.0
+    148.5000    219.7500 -86.0
+    155.5000    213.7500 -86.0
+    162.5000    204.7500 -86.0
+    166.7500    198.5000 -86.0
+    171.7500    189.5000 -86.0
+    172.7500    184.5000 -86.0
+    174.7500    180.5000 -86.0
+    175.7500    175.5000 -86.0
+    176.5000    173.7500 -86.0
+    176.7500    169.5000 -86.0
+    177.5000    167.7500 -86.0
+    177.7500    161.5000 -86.0
+    178.5000    159.7500 -86.0
+    178.7500    140.5000 -86.0
+    177.7500    138.5000 -86.0
+    177.7500    135.5000 -86.0
+    176.7500    133.5000 -86.0
+    176.7500    131.5000 -86.0
+    173.5000    122.2500 -86.0
+    170.7500    115.5000 -86.0
+    165.7500    107.5000 -86.0
+    161.7500    100.5000 -86.0
+    160.7500     98.5000 -86.0
+    154.5000     91.2500 -86.0
+    150.5000     89.2500 -86.0
+    148.5000     91.2500 -86.0
+    146.7500     87.5000 -86.0
+    145.5000     87.2500 -86.0
+    143.5000     85.2500 -86.0
+    143.2500     87.5000 -86.0
+    142.5000     89.2500 -86.0
+    140.5000     89.2500 -86.0
+    137.5000     88.2500 -86.0
+    135.5000     89.2500 -86.0
+    133.5000     89.2500 -86.0
+    131.5000     90.2500 -86.0
+    125.5000     90.2500 -86.0
+    122.7500     87.5000 -86.0
+    122.2500     88.5000 -86.0
+    127.5000     94.7500 -86.0
+    130.5000     93.7500 -86.0
+    133.5000     90.7500 -86.0
+    142.5000     90.7500 -86.0
+    145.5000     91.7500 -86.0
+    147.2500     92.5000 -86.0
+    150.5000     92.7500 -86.0
+    153.2500     97.5000 -86.0
+    154.2500     99.5000 -86.0
+    161.2500    106.5000 -86.0
+    164.2500    110.5000 -86.0
+    169.2500    119.5000 -86.0
+    169.2500    121.5000 -86.0
+    171.2500    125.5000 -86.0
+    171.2500    129.5000 -86.0
+    172.2500    131.5000 -86.0
+    172.2500    138.5000 -86.0
+    171.2500    143.5000 -86.0
+    172.2500    145.5000 -86.0
+    172.2500    147.5000 -86.0
+    174.2500    151.5000 -86.0
+    172.5000    154.2500 -86.0
+    171.2500    165.5000 -86.0
+    170.5000    167.2500 -86.0
+    170.2500    172.5000 -86.0
+    169.2500    177.5000 -86.0
+    165.2500    183.5000 -86.0
+    163.2500    187.5000 -86.0
+    158.2500    195.5000 -86.0
+    157.2500    197.5000 -86.0
+    150.5000    205.2500 -86.0
+    143.5000    211.2500 -86.0
+    135.5000    216.2500 -86.0
+    123.5000    222.2500 -86.0
+    120.5000    222.2500 -86.0
+    116.5000    224.2500 -86.0
+    112.5000    224.2500 -86.0
+    107.5000    223.2500 -86.0
+    105.5000    224.2500 -86.0
+     99.5000    224.2500 -86.0
+     92.5000    223.2500 -86.0
+     90.7500    222.5000 -86.0
+     78.5000    222.2500 -86.0
+     68.5000    217.2500 -86.0
+     64.7500    214.5000 -86.0
+     58.5000    210.2500 -86.0
+     56.5000    209.2500 -86.0
+     46.7500    199.5000 -86.0
+     43.7500    194.5000 -86.0
+     39.7500    187.5000 -86.0
+     39.7500    185.5000 -86.0
+     35.7500    177.5000 -86.0
+     35.7500    175.5000 -86.0
+     34.7500    173.5000 -86.0
+     34.7500    154.5000 -86.0
+     35.5000    152.7500 -86.0
+     35.7500    146.5000 -86.0
+     34.7500    144.5000 -86.0
+     34.7500    141.5000 -86.0
+     36.5000    137.7500 -86.0
+     36.7500    133.5000 -86.0
+     38.5000    132.7500 -86.0
+     38.7500    131.5000 -86.0
+     40.5000    129.7500 -86.0
+     41.7500    125.5000 -86.0
+     43.7500    120.5000 -86.0
+     44.5000    118.7500 -86.0
+     47.7500    109.5000 -86.0
+     50.7500    105.5000 -86.0
+     52.7500    101.5000 -86.0
+     53.5000     99.7500 -86.0
+     58.5000     93.7500 -86.0
+     62.5000     90.7500 -86.0
+     64.5000     90.7500 -86.0
+     66.5000     89.7500 -86.0
+     69.5000     89.7500 -86.0
+     71.2500     90.5000 -86.0
+     78.5000     90.7500 -86.0
+     80.5000     89.7500 -86.0
+     82.5000     89.7500 -86.0
+     86.5000     87.7500 -86.0
+     86.5000     86.2500 -86.0
+     82.5000     88.2500 -86.0
+     80.5000     88.2500 -86.0
+     77.5000     89.2500 -86.0
+     72.5000     87.2500 -86.0
+     70.5000     88.2500 -86.0
+     69.5000     87.2500 -86.0
+     67.5000     86.2500 -86.0
+     67.2500     87.5000 -86.0
+     64.5000     89.2500 -86.0
+     63.7500     87.5000 -86.0
+     64.5000     85.7500 -86.0
+     64.7500     82.5000 -86.0
+} -86.0
+v 190 z -88.000000 -64.0
+{ -88.0
+    108.2500     35.5000 -88.0
+    106.2500     36.5000 -88.0
+    104.5000     40.2500 -88.0
+    104.2500     44.5000 -88.0
+     97.5000     55.2500 -88.0
+     97.2500     57.5000 -88.0
+     98.5000     56.7500 -88.0
+    101.5000     56.7500 -88.0
+    102.5000     54.7500 -88.0
+    103.7500     46.5000 -88.0
+    106.5000     42.7500 -88.0
+    109.5000     42.7500 -88.0
+    111.2500     45.5000 -88.0
+    111.2500     53.5000 -88.0
+    114.2500     57.5000 -88.0
+    117.7500     57.5000 -88.0
+    115.7500     53.5000 -88.0
+    115.7500     51.5000 -88.0
+    111.7500     45.5000 -88.0
+    112.7500     43.5000 -88.0
+    111.7500     41.5000 -88.0
+    111.7500     39.5000 -88.0
+    109.7500     35.5000 -88.0
+} -88.0
+{ -88.0
+     56.2500     64.5000 -88.0
+     54.5000     67.2500 -88.0
+     54.2500     69.5000 -88.0
+     55.2500     71.5000 -88.0
+     56.5000     70.7500 -88.0
+     59.5000     70.7500 -88.0
+     62.2500     76.5000 -88.0
+     64.7500     76.5000 -88.0
+     61.7500     70.5000 -88.0
+     61.7500     68.5000 -88.0
+     59.7500     64.5000 -88.0
+} -88.0
+{ -88.0
+    155.2500     67.5000 -88.0
+    152.5000     70.2500 -88.0
+    151.2500     74.5000 -88.0
+    147.5000     78.2500 -88.0
+    145.2500     79.5000 -88.0
+    144.2500     81.5000 -88.0
+    147.5000     81.7500 -88.0
+    155.5000     74.7500 -88.0
+    158.5000     75.7500 -88.0
+    159.2500     77.5000 -88.0
+    160.5000     77.7500 -88.0
+    160.7500     71.5000 -88.0
+    157.7500     67.5000 -88.0
+} -88.0
+{ -88.0
+     65.2500     77.5000 -88.0
+     67.2500     81.5000 -88.0
+     67.2500     83.5000 -88.0
+     69.5000     83.7500 -88.0
+     71.5000     82.7500 -88.0
+     66.7500     77.5000 -88.0
+} -88.0
+{ -88.0
+     95.2500     79.5000 -88.0
+     93.5000     81.2500 -88.0
+     93.2500     83.5000 -88.0
+     96.5000     80.7500 -88.0
+     99.5000     80.7500 -88.0
+     99.7500     79.5000 -88.0
+} -88.0
+{ -88.0
+    115.2500     79.5000 -88.0
+    114.2500     81.5000 -88.0
+    117.2500     85.5000 -88.0
+    119.7500     87.5000 -88.0
+    117.7500     83.5000 -88.0
+    117.7500     81.5000 -88.0
+} -88.0
+{ -88.0
+     90.2500     85.5000 -88.0
+     90.2500     86.5000 -88.0
+     91.7500     85.5000 -88.0
+} -88.0
+{ -88.0
+     62.2500     86.5000 -88.0
+     61.2500     88.5000 -88.0
+     58.5000     91.2500 -88.0
+     57.7500     90.5000 -88.0
+     57.7500     87.5000 -88.0
+     55.5000     88.2500 -88.0
+     45.2500    105.5000 -88.0
+     31.2500    134.5000 -88.0
+     28.5000    148.2500 -88.0
+     28.2500    166.5000 -88.0
+     29.2500    168.5000 -88.0
+     29.2500    174.5000 -88.0
+     30.2500    176.5000 -88.0
+     30.2500    180.5000 -88.0
+     31.2500    182.5000 -88.0
+     33.2500    192.5000 -88.0
+     39.2500    204.5000 -88.0
+     47.2500    213.5000 -88.0
+     54.5000    219.7500 -88.0
+     62.5000    224.7500 -88.0
+     76.2500    228.5000 -88.0
+     80.5000    228.7500 -88.0
+     86.5000    231.7500 -88.0
+     93.2500    233.5000 -88.0
+    106.5000    233.7500 -88.0
+    110.5000    231.7500 -88.0
+    112.5000    231.7500 -88.0
+    123.5000    228.7500 -88.0
+    129.5000    227.7500 -88.0
+    146.5000    220.7500 -88.0
+    154.5000    214.7500 -88.0
+    165.7500    199.5000 -88.0
+    173.5000    183.7500 -88.0
+    176.7500    170.5000 -88.0
+    178.5000    161.7500 -88.0
+    178.7500    140.5000 -88.0
+    177.7500    138.5000 -88.0
+    176.7500    130.5000 -88.0
+    168.7500    111.5000 -88.0
+    155.7500     92.5000 -88.0
+    150.7500     89.5000 -88.0
+    147.5000     90.2500 -88.0
+    145.7500     88.5000 -88.0
+    144.5000     89.2500 -88.0
+    141.5000     88.2500 -88.0
+    137.5000     90.2500 -88.0
+    132.5000     89.2500 -88.0
+    130.2500     91.5000 -88.0
+    135.5000     91.7500 -88.0
+    137.5000     90.7500 -88.0
+    143.5000     90.7500 -88.0
+    148.2500     92.5000 -88.0
+    149.5000     91.7500 -88.0
+    151.2500     93.5000 -88.0
+    153.2500     97.5000 -88.0
+    163.2500    107.5000 -88.0
+    166.2500    111.5000 -88.0
+    171.2500    121.5000 -88.0
+    172.2500    130.5000 -88.0
+    173.2500    132.5000 -88.0
+    173.2500    145.5000 -88.0
+    174.2500    147.5000 -88.0
+    174.2500    149.5000 -88.0
+    172.5000    154.2500 -88.0
+    170.2500    174.5000 -88.0
+    165.2500    184.5000 -88.0
+    155.2500    200.5000 -88.0
+    148.5000    207.2500 -88.0
+    130.5000    219.2500 -88.0
+    128.5000    219.2500 -88.0
+    126.5000    221.2500 -88.0
+    120.5000    222.2500 -88.0
+    116.5000    224.2500 -88.0
+    107.5000    224.2500 -88.0
+    105.5000    225.2500 -88.0
+    104.7500    224.5000 -88.0
+     95.5000    224.2500 -88.0
+     86.7500    222.5000 -88.0
+     78.5000    222.2500 -88.0
+     66.5000    216.2500 -88.0
+     56.5000    209.2500 -88.0
+     47.7500    200.5000 -88.0
+     40.7500    189.5000 -88.0
+     40.7500    187.5000 -88.0
+     35.7500    177.5000 -88.0
+     35.7500    175.5000 -88.0
+     34.7500    173.5000 -88.0
+     34.7500    153.5000 -88.0
+     35.5000    151.7500 -88.0
+     35.7500    146.5000 -88.0
+     34.7500    144.5000 -88.0
+     34.7500    140.5000 -88.0
+     36.5000    136.7500 -88.0
+     36.7500    134.5000 -88.0
+     35.7500    132.5000 -88.0
+     40.7500    126.5000 -88.0
+     41.7500    121.5000 -88.0
+     44.7500    115.5000 -88.0
+     45.7500    110.5000 -88.0
+     50.7500    105.5000 -88.0
+     56.7500     93.5000 -88.0
+     65.5000     88.7500 -88.0
+     71.5000     88.7500 -88.0
+     77.2500     91.5000 -88.0
+     80.5000     91.7500 -88.0
+     82.5000     90.7500 -88.0
+     85.5000     90.7500 -88.0
+     87.5000     88.7500 -88.0
+     86.5000     88.2500 -88.0
+     80.5000     90.2500 -88.0
+     76.7500     86.5000 -88.0
+     74.5000     87.2500 -88.0
+     72.7500     86.5000 -88.0
+     71.5000     87.2500 -88.0
+     67.5000     87.2500 -88.0
+     64.5000     88.2500 -88.0
+     63.7500     86.5000 -88.0
+} -88.0
+{ -88.0
+    120.2500     88.5000 -88.0
+    125.2500     96.5000 -88.0
+    127.5000     95.7500 -88.0
+    127.7500     93.5000 -88.0
+    126.5000     93.2500 -88.0
+} -88.0
+///v 207 z -90.000000 -90.0
+{ -90.0
+    106.2500     33.5000 -90.0
+    105.5000     34.2500 -90.0
+    107.2500     35.5000 -90.0
+    109.5000     35.7500 -90.0
+    111.5000     34.7500 -90.0
+    110.7500     33.5000 -90.0
+} -90.0
+{ -90.0
+    104.2500     37.5000 -90.0
+    103.5000     38.2500 -90.0
+    103.2500     44.5000 -90.0
+     99.5000     49.2500 -90.0
+     99.2500     51.5000 -90.0
+     97.2500     56.5000 -90.0
+     98.5000     56.7500 -90.0
+    100.5000     55.7500 -90.0
+    102.5000     55.7500 -90.0
+    102.7500     49.5000 -90.0
+    103.7500     44.5000 -90.0
+    104.5000     42.7500 -90.0
+    104.7500     38.5000 -90.0
+} -90.0
+{ -90.0
+    112.2500     37.5000 -90.0
+    112.2500     46.5000 -90.0
+    111.2500     51.5000 -90.0
+    114.2500     54.5000 -90.0
+    114.2500     57.5000 -90.0
+    116.5000     57.7500 -90.0
+    115.7500     50.5000 -90.0
+    112.7500     44.5000 -90.0
+    113.5000     42.7500 -90.0
+    113.7500     37.5000 -90.0
+} -90.0
+{ -90.0
+     57.2500     64.5000 -90.0
+     53.5000     68.2500 -90.0
+     53.2500     71.5000 -90.0
+     54.5000     72.7500 -90.0
+     58.5000     70.7500 -90.0
+     60.2500     71.5000 -90.0
+     63.2500     76.5000 -90.0
+     63.2500     78.5000 -90.0
+     64.5000     77.7500 -90.0
+     64.7500     75.5000 -90.0
+     61.7500     69.5000 -90.0
+     61.7500     66.5000 -90.0
+     59.7500     64.5000 -90.0
+} -90.0
+{ -90.0
+    155.2500     67.5000 -90.0
+    152.5000     69.2500 -90.0
+    151.2500     73.5000 -90.0
+    145.5000     80.2500 -90.0
+    147.2500     81.5000 -90.0
+    148.5000     79.7500 -90.0
+    156.5000     74.7500 -90.0
+    159.2500     78.5000 -90.0
+    161.5000     78.7500 -90.0
+    161.7500     74.5000 -90.0
+    158.7500     68.5000 -90.0
+} -90.0
+{ -90.0
+    105.2500     81.5000 -90.0
+    104.5000     82.2500 -90.0
+    101.5000     82.2500 -90.0
+    101.2500     84.5000 -90.0
+    104.2500     86.5000 -90.0
+    108.5000     84.7500 -90.0
+    108.7500     83.5000 -90.0
+} -90.0
+{ -90.0
+     93.2500     84.5000 -90.0
+     93.2500     85.5000 -90.0
+     90.5000     88.7500 -90.0
+     94.5000     86.7500 -90.0
+     94.7500     85.5000 -90.0
+} -90.0
+{ -90.0
+    117.2500     85.5000 -90.0
+    116.5000     87.2500 -90.0
+    114.5000     87.2500 -90.0
+    114.5000     88.7500 -90.0
+    116.5000     89.7500 -90.0
+    120.2500     93.5000 -90.0
+    123.5000     98.7500 -90.0
+    125.5000     97.7500 -90.0
+    125.7500     95.5000 -90.0
+    121.5000     93.2500 -90.0
+} -90.0
+{ -90.0
+     66.2500     86.5000 -90.0
+     64.5000     88.2500 -90.0
+     61.5000     87.2500 -90.0
+     61.2500     88.5000 -90.0
+     59.5000     89.2500 -90.0
+     58.7500     87.5000 -90.0
+     57.5000     87.2500 -90.0
+     55.2500     89.5000 -90.0
+     48.5000    100.2500 -90.0
+     32.2500    130.5000 -90.0
+     28.5000    147.2500 -90.0
+     28.2500    164.5000 -90.0
+     29.2500    166.5000 -90.0
+     29.2500    173.5000 -90.0
+     30.2500    175.5000 -90.0
+     30.2500    179.5000 -90.0
+     31.2500    181.5000 -90.0
+     32.2500    187.5000 -90.0
+     38.2500    202.5000 -90.0
+     46.2500    212.5000 -90.0
+     56.5000    220.7500 -90.0
+     63.2500    224.5000 -90.0
+     74.5000    227.7500 -90.0
+     92.2500    233.5000 -90.0
+    106.5000    233.7500 -90.0
+    108.5000    232.7500 -90.0
+    110.5000    232.7500 -90.0
+    114.5000    230.7500 -90.0
+    116.5000    230.7500 -90.0
+    118.5000    229.7500 -90.0
+    122.5000    229.7500 -90.0
+    126.5000    227.7500 -90.0
+    129.5000    227.7500 -90.0
+    133.5000    225.7500 -90.0
+    135.5000    225.7500 -90.0
+    150.5000    217.7500 -90.0
+    161.7500    205.5000 -90.0
+    166.7500    197.5000 -90.0
+    172.7500    185.5000 -90.0
+    173.7500    180.5000 -90.0
+    175.5000    176.7500 -90.0
+    178.5000    162.7500 -90.0
+    178.7500    141.5000 -90.0
+    177.7500    139.5000 -90.0
+    177.7500    133.5000 -90.0
+    175.7500    129.5000 -90.0
+    175.7500    126.5000 -90.0
+    171.7500    118.5000 -90.0
+    171.7500    116.5000 -90.0
+    167.5000    109.2500 -90.0
+    155.5000     93.2500 -90.0
+    151.7500     90.5000 -90.0
+    146.5000     90.2500 -90.0
+    142.5000     88.2500 -90.0
+    138.5000     90.2500 -90.0
+    135.5000     90.2500 -90.0
+    133.7500     89.5000 -90.0
+    130.5000     91.2500 -90.0
+    130.5000     92.7500 -90.0
+    137.5000     90.7500 -90.0
+    144.5000     90.7500 -90.0
+    153.2500     94.5000 -90.0
+    153.2500     96.5000 -90.0
+    156.2500     99.5000 -90.0
+    159.5000    104.7500 -90.0
+    161.5000    105.7500 -90.0
+    166.2500    111.5000 -90.0
+    169.2500    116.5000 -90.0
+    169.2500    118.5000 -90.0
+    173.2500    126.5000 -90.0
+    173.2500    130.5000 -90.0
+    174.2500    132.5000 -90.0
+    174.2500    141.5000 -90.0
+    175.2500    144.5000 -90.0
+    172.5000    156.2500 -90.0
+    170.2500    174.5000 -90.0
+    166.5000    180.2500 -90.0
+    166.2500    182.5000 -90.0
+    157.2500    197.5000 -90.0
+    151.5000    204.2500 -90.0
+    140.5000    213.2500 -90.0
+    125.5000    221.2500 -90.0
+    123.5000    221.2500 -90.0
+    119.5000    223.2500 -90.0
+    117.5000    223.2500 -90.0
+    115.5000    224.2500 -90.0
+    109.5000    224.2500 -90.0
+    107.5000    225.2500 -90.0
+     98.5000    223.2500 -90.0
+     92.5000    225.2500 -90.0
+     84.7500    222.5000 -90.0
+     78.5000    222.2500 -90.0
+     66.5000    216.2500 -90.0
+     56.5000    209.2500 -90.0
+     47.7500    200.5000 -90.0
+     44.7500    196.5000 -90.0
+     37.7500    182.5000 -90.0
+     37.7500    180.5000 -90.0
+     35.7500    176.5000 -90.0
+     35.7500    173.5000 -90.0
+     34.7500    171.5000 -90.0
+     34.7500    159.5000 -90.0
+     33.7500    156.5000 -90.0
+     34.7500    154.5000 -90.0
+     35.7500    147.5000 -90.0
+     34.7500    145.5000 -90.0
+     35.7500    129.5000 -90.0
+     37.7500    127.5000 -90.0
+     41.5000    120.7500 -90.0
+     41.7500    118.5000 -90.0
+     46.7500    106.5000 -90.0
+     52.7500    100.5000 -90.0
+     54.5000     96.7500 -90.0
+     56.5000     95.7500 -90.0
+     56.7500     94.5000 -90.0
+     61.5000     89.7500 -90.0
+     70.5000     88.7500 -90.0
+     68.7500     86.5000 -90.0
+} -90.0
+{ -90.0
+     76.2500     86.5000 -90.0
+     75.5000     88.2500 -90.0
+     72.5000     88.2500 -90.0
+     80.2500     92.5000 -90.0
+     84.5000     92.7500 -90.0
+     87.5000     91.7500 -90.0
+     88.5000     90.2500 -90.0
+     86.5000     91.2500 -90.0
+     80.5000     91.2500 -90.0
+     77.7500     87.5000 -90.0
+} -90.0
+{ -90.0
+    103.2500    154.5000 -90.0
+    103.2500    155.5000 -90.0
+    104.5000    155.7500 -90.0
+    104.7500    154.5000 -90.0
+} -90.0
+v 178 z -92.000000 -64.0
+{ -92.0
+    114.2500     35.5000 -92.0
+    113.5000     36.2500 -92.0
+    113.2500     45.5000 -92.0
+    112.2500     50.5000 -92.0
+    114.2500     52.5000 -92.0
+    114.2500     56.5000 -92.0
+    115.5000     56.7500 -92.0
+    115.7500     48.5000 -92.0
+    114.7500     46.5000 -92.0
+    114.7500     36.5000 -92.0
+} -92.0
+{ -92.0
+    103.2500     36.5000 -92.0
+    102.2500     44.5000 -92.0
+     99.5000     48.2500 -92.0
+     99.5000     55.7500 -92.0
+    101.5000     54.7500 -92.0
+    103.7500     37.5000 -92.0
+} -92.0
+{ -92.0
+     57.2500     64.5000 -92.0
+     54.2500     67.5000 -92.0
+     53.2500     69.5000 -92.0
+     52.2500     74.5000 -92.0
+     53.5000     74.7500 -92.0
+     57.5000     71.7500 -92.0
+     60.5000     71.7500 -92.0
+     64.2500     78.5000 -92.0
+     65.5000     78.7500 -92.0
+     65.7500     76.5000 -92.0
+     62.7500     70.5000 -92.0
+     61.7500     65.5000 -92.0
+     59.7500     64.5000 -92.0
+} -92.0
+{ -92.0
+    153.2500     67.5000 -92.0
+    151.5000     70.2500 -92.0
+    151.2500     73.5000 -92.0
+    146.5000     78.2500 -92.0
+    146.2500     80.5000 -92.0
+    147.5000     80.7500 -92.0
+    153.5000     75.7500 -92.0
+    157.5000     75.7500 -92.0
+    161.2500     79.5000 -92.0
+    162.5000     77.7500 -92.0
+    161.7500     74.5000 -92.0
+    158.7500     68.5000 -92.0
+    156.7500     67.5000 -92.0
+} -92.0
+{ -92.0
+     94.2500     85.5000 -92.0
+     93.2500     87.5000 -92.0
+     94.7500     86.5000 -92.0
+} -92.0
+{ -92.0
+     60.2500     86.5000 -92.0
+     56.5000     88.2500 -92.0
+     56.2500     89.5000 -92.0
+     43.2500    108.5000 -92.0
+     31.5000    132.2500 -92.0
+     28.5000    147.2500 -92.0
+     28.2500    162.5000 -92.0
+     29.2500    164.5000 -92.0
+     29.2500    172.5000 -92.0
+     30.2500    174.5000 -92.0
+     30.2500    177.5000 -92.0
+     32.2500    184.5000 -92.0
+     33.2500    190.5000 -92.0
+     41.2500    206.5000 -92.0
+     51.2500    216.5000 -92.0
+     66.5000    225.7500 -92.0
+     80.5000    229.7500 -92.0
+     91.2500    233.5000 -92.0
+    107.5000    233.7500 -92.0
+    109.5000    232.7500 -92.0
+    111.5000    232.7500 -92.0
+    115.5000    230.7500 -92.0
+    122.5000    229.7500 -92.0
+    126.5000    227.7500 -92.0
+    129.5000    227.7500 -92.0
+    139.5000    223.7500 -92.0
+    147.5000    218.7500 -92.0
+    155.5000    212.7500 -92.0
+    164.7500    200.5000 -92.0
+    170.7500    188.5000 -92.0
+    175.7500    174.5000 -92.0
+    178.5000    163.7500 -92.0
+    178.7500    142.5000 -92.0
+    177.7500    140.5000 -92.0
+    177.7500    135.5000 -92.0
+    176.7500    133.5000 -92.0
+    175.7500    126.5000 -92.0
+    172.7500    120.5000 -92.0
+    170.7500    114.5000 -92.0
+    165.7500    106.5000 -92.0
+    155.5000     93.2500 -92.0
+    151.7500     90.5000 -92.0
+    140.5000     89.2500 -92.0
+    142.2500     90.5000 -92.0
+    145.5000     90.7500 -92.0
+    150.5000     92.7500 -92.0
+    154.2500     95.5000 -92.0
+    156.2500    101.5000 -92.0
+    155.2500    103.5000 -92.0
+    158.2500    105.5000 -92.0
+    161.5000    105.7500 -92.0
+    166.2500    110.5000 -92.0
+    169.2500    116.5000 -92.0
+    169.2500    118.5000 -92.0
+    171.2500    122.5000 -92.0
+    171.2500    124.5000 -92.0
+    174.2500    130.5000 -92.0
+    174.2500    150.5000 -92.0
+    172.2500    157.5000 -92.0
+    170.2500    173.5000 -92.0
+    163.2500    187.5000 -92.0
+    152.2500    203.5000 -92.0
+    150.5000    204.2500 -92.0
+    140.5000    213.2500 -92.0
+    128.5000    220.2500 -92.0
+    126.5000    220.2500 -92.0
+    122.5000    222.2500 -92.0
+    109.5000    225.2500 -92.0
+    105.5000    223.2500 -92.0
+    103.5000    224.2500 -92.0
+    102.7500    223.5000 -92.0
+     97.5000    223.2500 -92.0
+     93.5000    225.2500 -92.0
+     89.5000    225.2500 -92.0
+     84.5000    223.2500 -92.0
+     79.5000    222.2500 -92.0
+     62.5000    214.2500 -92.0
+     52.7500    205.5000 -92.0
+     43.7500    195.5000 -92.0
+     43.7500    193.5000 -92.0
+     37.7500    181.5000 -92.0
+     37.7500    179.5000 -92.0
+     35.7500    175.5000 -92.0
+     35.7500    171.5000 -92.0
+     34.7500    169.5000 -92.0
+     34.7500    163.5000 -92.0
+     33.7500    161.5000 -92.0
+     34.7500    142.5000 -92.0
+     33.7500    140.5000 -92.0
+     33.7500    138.5000 -92.0
+     36.7500    125.5000 -92.0
+     39.5000    121.7500 -92.0
+     39.7500    119.5000 -92.0
+     45.7500    107.5000 -92.0
+     54.5000     95.7500 -92.0
+     56.5000     94.7500 -92.0
+     56.7500     93.5000 -92.0
+     63.5000     88.7500 -92.0
+     76.5000     88.7500 -92.0
+     77.5000     87.2500 -92.0
+     75.5000     86.2500 -92.0
+     73.5000     88.2500 -92.0
+     71.5000     88.2500 -92.0
+     69.7500     86.5000 -92.0
+     67.5000     86.2500 -92.0
+     62.5000     88.2500 -92.0
+     60.7500     87.5000 -92.0
+     61.7500     86.5000 -92.0
+} -92.0
+{ -92.0
+    102.2500     87.5000 -92.0
+    101.2500     89.5000 -92.0
+    102.7500     88.5000 -92.0
+} -92.0
+{ -92.0
+     78.2500     89.5000 -92.0
+     77.5000     90.2500 -92.0
+     78.2500     91.5000 -92.0
+     80.5000     91.7500 -92.0
+} -92.0
+{ -92.0
+    136.2500     90.5000 -92.0
+    132.5000     92.2500 -92.0
+    131.5000     91.2500 -92.0
+    128.5000     92.2500 -92.0
+    128.5000     93.7500 -92.0
+    130.5000     92.7500 -92.0
+    133.5000     92.7500 -92.0
+    137.5000     90.7500 -92.0
+    139.7500     90.5000 -92.0
+} -92.0
+{ -92.0
+     83.2500     93.5000 -92.0
+     83.5000     94.7500 -92.0
+     87.5000     96.7500 -92.0
+     89.5000     93.2500 -92.0
+     86.5000     94.2500 -92.0
+} -92.0
+{ -92.0
+    123.2500     98.5000 -92.0
+    121.5000     99.2500 -92.0
+    121.2500    100.5000 -92.0
+    123.5000    100.7500 -92.0
+} -92.0
+v 171 z -94.000000 -92.0
+{ -64.0
+    114.2500     35.5000 -94.0
+    114.2500     48.5000 -94.0
+    113.5000     50.2500 -94.0
+    115.2500     51.5000 -94.0
+    114.2500     54.5000 -94.0
+    115.5000     55.7500 -94.0
+    116.7500     49.5000 -94.0
+    115.7500     47.5000 -94.0
+    115.7500     38.5000 -94.0
+} -94.0
+{ -94.0
+    102.2500     38.5000 -94.0
+    102.2500     40.5000 -94.0
+     98.2500     48.5000 -94.0
+     99.2500     50.5000 -94.0
+     99.2500     54.5000 -94.0
+    101.5000     54.7500 -94.0
+    101.7500     52.5000 -94.0
+    100.7500     50.5000 -94.0
+    102.5000     43.7500 -94.0
+    102.7500     39.5000 -94.0
+} -94.0
+{ -94.0
+     57.2500     64.5000 -94.0
+     55.2500     66.5000 -94.0
+     51.5000     73.2500 -94.0
+     51.5000     75.7500 -94.0
+     57.5000     71.7500 -94.0
+     60.5000     71.7500 -94.0
+     65.2500     78.5000 -94.0
+     66.5000     78.7500 -94.0
+     66.7500     76.5000 -94.0
+     63.7500     70.5000 -94.0
+     63.7500     68.5000 -94.0
+     60.7500     64.5000 -94.0
+} -94.0
+{ -94.0
+    152.2500     67.5000 -94.0
+    150.2500     74.5000 -94.0
+    146.5000     78.2500 -94.0
+    146.2500     80.5000 -94.0
+    154.5000     75.7500 -94.0
+    157.5000     75.7500 -94.0
+    160.5000     78.7500 -94.0
+    162.5000     79.7500 -94.0
+    162.7500     77.5000 -94.0
+    160.7500     71.5000 -94.0
+    157.7500     67.5000 -94.0
+} -94.0
+{ -94.0
+     75.2500     85.5000 -94.0
+     74.5000     87.2500 -94.0
+     67.5000     86.2500 -94.0
+     63.5000     88.2500 -94.0
+     61.7500     87.5000 -94.0
+     58.2500     87.5000 -94.0
+     47.5000    101.2500 -94.0
+     32.2500    129.5000 -94.0
+     28.5000    147.2500 -94.0
+     28.2500    161.5000 -94.0
+     29.2500    163.5000 -94.0
+     29.2500    171.5000 -94.0
+     30.2500    173.5000 -94.0
+     31.2500    182.5000 -94.0
+     33.2500    186.5000 -94.0
+     34.2500    192.5000 -94.0
+     40.2500    204.5000 -94.0
+     47.2500    212.5000 -94.0
+     53.2500    217.5000 -94.0
+     68.2500    226.5000 -94.0
+     71.5000    226.7500 -94.0
+     84.5000    231.7500 -94.0
+     91.2500    233.5000 -94.0
+    107.5000    233.7500 -94.0
+    109.5000    232.7500 -94.0
+    115.5000    231.7500 -94.0
+    119.5000    229.7500 -94.0
+    126.5000    228.7500 -94.0
+    130.5000    226.7500 -94.0
+    132.5000    226.7500 -94.0
+    144.5000    220.7500 -94.0
+    151.5000    215.7500 -94.0
+    157.7500    209.5000 -94.0
+    163.7500    201.5000 -94.0
+    173.5000    181.7500 -94.0
+    178.5000    163.7500 -94.0
+    178.7500    143.5000 -94.0
+    177.7500    141.5000 -94.0
+    177.7500    136.5000 -94.0
+    176.7500    134.5000 -94.0
+    176.7500    130.5000 -94.0
+    174.7500    126.5000 -94.0
+    174.7500    124.5000 -94.0
+    170.7500    114.5000 -94.0
+    165.7500    106.5000 -94.0
+    152.7500     91.5000 -94.0
+    146.7500     89.5000 -94.0
+    140.5000     89.2500 -94.0
+    137.2500     90.5000 -94.0
+    146.5000     90.7500 -94.0
+    153.2500     95.5000 -94.0
+    154.2500     97.5000 -94.0
+    153.2500    102.5000 -94.0
+    155.2500    104.5000 -94.0
+    160.5000    104.7500 -94.0
+    168.2500    113.5000 -94.0
+    168.2500    115.5000 -94.0
+    171.2500    121.5000 -94.0
+    171.2500    123.5000 -94.0
+    173.2500    127.5000 -94.0
+    173.2500    130.5000 -94.0
+    174.2500    132.5000 -94.0
+    174.2500    151.5000 -94.0
+    170.2500    171.5000 -94.0
+    166.2500    182.5000 -94.0
+    161.5000    189.2500 -94.0
+    156.2500    198.5000 -94.0
+    142.2500    211.5000 -94.0
+    130.5000    219.2500 -94.0
+    128.5000    219.2500 -94.0
+    118.5000    223.2500 -94.0
+    116.5000    223.2500 -94.0
+    114.5000    224.2500 -94.0
+    110.5000    224.2500 -94.0
+     98.5000    222.2500 -94.0
+     94.5000    225.2500 -94.0
+     88.5000    225.2500 -94.0
+     76.7500    220.5000 -94.0
+     74.5000    220.2500 -94.0
+     62.5000    214.2500 -94.0
+     59.5000    211.2500 -94.0
+     57.5000    210.2500 -94.0
+     56.7500    208.5000 -94.0
+     54.7500    207.5000 -94.0
+     53.5000    205.2500 -94.0
+     51.5000    204.2500 -94.0
+     50.7500    202.5000 -94.0
+     45.7500    197.5000 -94.0
+     38.7500    184.5000 -94.0
+     38.7500    182.5000 -94.0
+     36.7500    178.5000 -94.0
+     36.7500    175.5000 -94.0
+     34.7500    168.5000 -94.0
+     34.7500    163.5000 -94.0
+     33.7500    161.5000 -94.0
+     33.7500    152.5000 -94.0
+     34.5000    150.7500 -94.0
+     34.7500    142.5000 -94.0
+     33.7500    140.5000 -94.0
+     33.7500    135.5000 -94.0
+     34.7500    130.5000 -94.0
+     37.7500    122.5000 -94.0
+     44.5000    111.7500 -94.0
+     46.7500    105.5000 -94.0
+     49.5000    102.7500 -94.0
+     53.7500     95.5000 -94.0
+     55.5000     94.7500 -94.0
+     58.5000     91.7500 -94.0
+     66.5000     87.7500 -94.0
+     76.5000     87.7500 -94.0
+     80.2500     92.5000 -94.0
+     82.7500     92.5000 -94.0
+     79.7500     88.5000 -94.0
+} -94.0
+{ -94.0
+    129.2500     91.5000 -94.0
+    127.2500     94.5000 -94.0
+    130.7500     94.5000 -94.0
+} -94.0
+{ -94.0
+    100.2500     94.5000 -94.0
+     99.2500     95.5000 -94.0
+    100.7500     95.5000 -94.0
+} -94.0
+{ -94.0
+     86.2500     97.5000 -94.0
+     88.7500     99.5000 -94.0
+     87.7500     97.5000 -94.0
+} -94.0
+{ -94.0
+    100.2500     97.5000 -94.0
+    100.5000     97.7500 -94.0
+    102.5000     98.7500 -94.0
+    101.7500     97.5000 -94.0
+} -94.0
+{ -94.0
+    102.2500    157.5000 -94.0
+    101.2500    159.5000 -94.0
+    102.5000    159.7500 -94.0
+} -94.0
+v 173 z -96.000000 -64.0
+{ -96.0
+    115.2500     37.5000 -96.0
+    115.2500     45.5000 -96.0
+    114.5000     47.2500 -96.0
+    114.2500     54.5000 -96.0
+    115.5000     54.7500 -96.0
+    117.7500     48.5000 -96.0
+    116.7500     46.5000 -96.0
+    116.7500     40.5000 -96.0
+} -96.0
+{ -96.0
+    101.2500     40.5000 -96.0
+    100.2500     44.5000 -96.0
+     97.5000     48.2500 -96.0
+     99.2500     51.5000 -96.0
+     99.2500     53.5000 -96.0
+    100.5000     54.7500 -96.0
+    101.7500     41.5000 -96.0
+} -96.0
+{ -96.0
+     59.2500     63.5000 -96.0
+     57.5000     64.2500 -96.0
+     55.2500     66.5000 -96.0
+     51.5000     73.2500 -96.0
+     51.5000     75.7500 -96.0
+     57.5000     71.7500 -96.0
+     60.5000     71.7500 -96.0
+     63.2500     75.5000 -96.0
+     64.5000     75.7500 -96.0
+     67.2500     78.5000 -96.0
+     67.7500     77.5000 -96.0
+     62.7500     67.5000 -96.0
+     62.7500     65.5000 -96.0
+     60.7500     63.5000 -96.0
+} -96.0
+{ -96.0
+    153.2500     66.5000 -96.0
+    151.5000     68.2500 -96.0
+    150.2500     73.5000 -96.0
+    147.2500     76.5000 -96.0
+    145.2500     80.5000 -96.0
+    149.5000     77.7500 -96.0
+    151.5000     77.7500 -96.0
+    155.5000     74.7500 -96.0
+    158.5000     75.7500 -96.0
+    161.2500     79.5000 -96.0
+    162.5000     78.7500 -96.0
+    162.7500     76.5000 -96.0
+    160.7500     70.5000 -96.0
+    156.7500     66.5000 -96.0
+} -96.0
+{ -96.0
+     76.2500     85.5000 -96.0
+     75.5000     86.2500 -96.0
+     73.2500     87.5000 -96.0
+     77.5000     88.7500 -96.0
+     82.5000     93.7500 -96.0
+     84.5000     92.7500 -96.0
+     83.7500     91.5000 -96.0
+     82.5000     92.2500 -96.0
+     81.7500     91.5000 -96.0
+     80.7500     89.5000 -96.0
+} -96.0
+{ -96.0
+     67.2500     86.5000 -96.0
+     66.5000     87.2500 -96.0
+     59.5000     87.2500 -96.0
+     48.5000    100.2500 -96.0
+     44.2500    106.5000 -96.0
+     41.2500    112.5000 -96.0
+     36.5000    120.2500 -96.0
+     36.2500    123.5000 -96.0
+     37.7500    122.5000 -96.0
+     40.7500    116.5000 -96.0
+     45.5000    109.7500 -96.0
+     46.7500    105.5000 -96.0
+     52.5000     98.7500 -96.0
+     55.5000     93.7500 -96.0
+     57.5000     93.7500 -96.0
+     59.5000     91.7500 -96.0
+     67.5000     87.7500 -96.0
+     69.5000     87.7500 -96.0
+     70.7500     86.5000 -96.0
+} -96.0
+{ -96.0
+    137.2500     89.5000 -96.0
+    135.5000     91.2500 -96.0
+    136.5000     91.7500 -96.0
+    138.5000     90.7500 -96.0
+    143.5000     90.7500 -96.0
+    148.5000     92.7500 -96.0
+    152.2500     95.5000 -96.0
+    152.5000    102.7500 -96.0
+    156.2500    104.5000 -96.0
+    160.5000    104.7500 -96.0
+    164.2500    107.5000 -96.0
+    169.2500    116.5000 -96.0
+    169.2500    118.5000 -96.0
+    172.2500    124.5000 -96.0
+    172.2500    129.5000 -96.0
+    174.2500    133.5000 -96.0
+    174.2500    149.5000 -96.0
+    173.5000    151.2500 -96.0
+    173.2500    157.5000 -96.0
+    171.2500    164.5000 -96.0
+    170.2500    171.5000 -96.0
+    163.5000    186.2500 -96.0
+    152.5000    202.2500 -96.0
+    138.5000    214.2500 -96.0
+    129.5000    219.2500 -96.0
+    127.5000    219.2500 -96.0
+    121.5000    222.2500 -96.0
+    118.5000    222.2500 -96.0
+    114.5000    224.2500 -96.0
+    109.5000    224.2500 -96.0
+    104.7500    222.5000 -96.0
+     98.5000    222.2500 -96.0
+     94.5000    225.2500 -96.0
+     87.5000    225.2500 -96.0
+     74.7500    219.5000 -96.0
+     65.5000    216.2500 -96.0
+     58.5000    211.2500 -96.0
+     44.7500    195.5000 -96.0
+     38.7500    183.5000 -96.0
+     38.7500    181.5000 -96.0
+     36.7500    177.5000 -96.0
+     36.7500    174.5000 -96.0
+     34.7500    168.5000 -96.0
+     34.7500    164.5000 -96.0
+     33.7500    162.5000 -96.0
+     33.7500    150.5000 -96.0
+     34.5000    148.7500 -96.0
+     34.7500    142.5000 -96.0
+     33.7500    140.5000 -96.0
+     33.7500    134.5000 -96.0
+     35.7500    125.5000 -96.0
+     34.5000    125.2500 -96.0
+     32.2500    130.5000 -96.0
+     28.5000    149.2500 -96.0
+     28.2500    159.5000 -96.0
+     29.2500    161.5000 -96.0
+     29.2500    169.5000 -96.0
+     30.2500    171.5000 -96.0
+     30.2500    175.5000 -96.0
+     31.2500    177.5000 -96.0
+     33.2500    187.5000 -96.0
+     38.2500    200.5000 -96.0
+     45.5000    210.7500 -96.0
+     61.5000    222.7500 -96.0
+     71.5000    227.7500 -96.0
+     78.5000    228.7500 -96.0
+     84.5000    231.7500 -96.0
+     91.2500    233.5000 -96.0
+    107.5000    233.7500 -96.0
+    109.5000    232.7500 -96.0
+    119.5000    230.7500 -96.0
+    123.5000    228.7500 -96.0
+    129.5000    227.7500 -96.0
+    141.5000    221.7500 -96.0
+    154.5000    212.7500 -96.0
+    163.7500    200.5000 -96.0
+    173.7500    180.5000 -96.0
+    178.5000    163.7500 -96.0
+    178.7500    144.5000 -96.0
+    177.7500    142.5000 -96.0
+    176.7500    133.5000 -96.0
+    175.7500    131.5000 -96.0
+    175.7500    129.5000 -96.0
+    167.7500    109.5000 -96.0
+    152.7500     91.5000 -96.0
+    149.5000     91.2500 -96.0
+    145.7500     89.5000 -96.0
+    144.5000     90.2500 -96.0
+    143.7500     89.5000 -96.0
+} -96.0
+{ -96.0
+    127.2500     92.5000 -96.0
+    126.5000     93.2500 -96.0
+    126.2500     95.5000 -96.0
+    128.7500     95.5000 -96.0
+    129.7500     93.5000 -96.0
+} -96.0
+{ -96.0
+     94.2500    108.5000 -96.0
+     93.2500    109.5000 -96.0
+     94.7500    109.5000 -96.0
+} -96.0
+{ -96.0
+    154.7500     71.5000 -96.0
+    155.5000     70.7500 -96.0
+    157.2500     71.5000 -96.0
+    156.5000     72.2500 -96.0
+} -96.0
+v 169 z -98.000000 -64.0
+{ -98.0
+    101.2500     38.5000 -98.0
+    100.2500     39.5000 -98.0
+     99.2500     44.5000 -98.0
+     96.5000     48.2500 -98.0
+     99.2500     51.5000 -98.0
+     99.5000     53.7500 -98.0
+     99.7500     48.5000 -98.0
+    101.7500     39.5000 -98.0
+} -98.0
+{ -98.0
+    116.2500     38.5000 -98.0
+    116.2500     44.5000 -98.0
+    115.2500     46.5000 -98.0
+    116.2500     48.5000 -98.0
+    115.5000     49.2500 -98.0
+    115.2500     53.5000 -98.0
+    116.5000     53.7500 -98.0
+    118.7500     48.5000 -98.0
+    117.7500     46.5000 -98.0
+    117.7500     43.5000 -98.0
+} -98.0
+{ -98.0
+     58.2500     63.5000 -98.0
+     55.5000     66.2500 -98.0
+     52.5000     71.2500 -98.0
+     52.2500     75.5000 -98.0
+     57.5000     71.7500 -98.0
+     60.5000     71.7500 -98.0
+     66.2500     77.5000 -98.0
+     68.5000     77.7500 -98.0
+     68.7500     76.5000 -98.0
+     63.7500     70.5000 -98.0
+     63.7500     67.5000 -98.0
+     61.7500     63.5000 -98.0
+} -98.0
+{ -98.0
+    153.2500     66.5000 -98.0
+    149.2500     74.5000 -98.0
+    143.5000     80.2500 -98.0
+    144.2500     81.5000 -98.0
+    147.5000     77.7500 -98.0
+    151.5000     77.7500 -98.0
+    154.5000     74.7500 -98.0
+    157.5000     74.7500 -98.0
+    160.2500     78.5000 -98.0
+    162.5000     78.7500 -98.0
+    162.7500     76.5000 -98.0
+    160.7500     70.5000 -98.0
+    157.7500     66.5000 -98.0
+} -98.0
+{ -98.0
+     60.2500     87.5000 -98.0
+     50.2500     98.5000 -98.0
+     44.2500    106.5000 -98.0
+     37.2500    119.5000 -98.0
+     32.2500    131.5000 -98.0
+     28.5000    150.2500 -98.0
+     28.2500    159.5000 -98.0
+     29.2500    161.5000 -98.0
+     29.2500    167.5000 -98.0
+     30.2500    169.5000 -98.0
+     30.2500    173.5000 -98.0
+     31.2500    175.5000 -98.0
+     32.2500    183.5000 -98.0
+     34.2500    187.5000 -98.0
+     34.2500    190.5000 -98.0
+     40.2500    202.5000 -98.0
+     46.2500    210.5000 -98.0
+     58.2500    220.5000 -98.0
+     71.5000    227.7500 -98.0
+     80.5000    229.7500 -98.0
+     84.5000    231.7500 -98.0
+     91.2500    233.5000 -98.0
+    107.5000    233.7500 -98.0
+    109.5000    232.7500 -98.0
+    116.5000    231.7500 -98.0
+    126.5000    227.7500 -98.0
+    129.5000    227.7500 -98.0
+    147.5000    217.7500 -98.0
+    156.7500    209.5000 -98.0
+    162.7500    201.5000 -98.0
+    171.7500    184.5000 -98.0
+    175.7500    170.5000 -98.0
+    178.5000    163.7500 -98.0
+    178.7500    147.5000 -98.0
+    177.7500    145.5000 -98.0
+    177.7500    140.5000 -98.0
+    175.7500    133.5000 -98.0
+    174.5000    126.2500 -98.0
+    165.7500    106.5000 -98.0
+    155.7500     96.5000 -98.0
+    153.7500     92.5000 -98.0
+    141.5000     90.2500 -98.0
+    142.2500     91.5000 -98.0
+    145.5000     91.7500 -98.0
+    147.2500     93.5000 -98.0
+    149.5000     93.7500 -98.0
+    152.2500     96.5000 -98.0
+    151.2500     98.5000 -98.0
+    153.2500    102.5000 -98.0
+    163.2500    106.5000 -98.0
+    172.2500    124.5000 -98.0
+    172.2500    130.5000 -98.0
+    174.2500    136.5000 -98.0
+    174.2500    147.5000 -98.0
+    173.5000    149.2500 -98.0
+    173.2500    158.5000 -98.0
+    172.2500    160.5000 -98.0
+    170.2500    170.5000 -98.0
+    166.2500    181.5000 -98.0
+    157.2500    196.5000 -98.0
+    147.5000    207.2500 -98.0
+    140.5000    213.2500 -98.0
+    132.5000    218.2500 -98.0
+    130.5000    218.2500 -98.0
+    124.5000    221.2500 -98.0
+    122.5000    221.2500 -98.0
+    118.5000    223.2500 -98.0
+    115.5000    223.2500 -98.0
+    112.5000    224.2500 -98.0
+    107.7500    222.5000 -98.0
+    100.5000    222.2500 -98.0
+     94.5000    225.2500 -98.0
+     86.5000    225.2500 -98.0
+     70.7500    217.5000 -98.0
+     65.5000    216.2500 -98.0
+     56.5000    208.2500 -98.0
+     54.5000    207.2500 -98.0
+     53.7500    205.5000 -98.0
+     44.7500    194.5000 -98.0
+     40.7500    186.5000 -98.0
+     36.7500    176.5000 -98.0
+     36.7500    174.5000 -98.0
+     35.7500    172.5000 -98.0
+     35.7500    168.5000 -98.0
+     34.7500    166.5000 -98.0
+     34.7500    156.5000 -98.0
+     33.7500    154.5000 -98.0
+     34.7500    142.5000 -98.0
+     33.7500    140.5000 -98.0
+     34.7500    128.5000 -98.0
+     36.7500    124.5000 -98.0
+     48.7500    102.5000 -98.0
+     53.7500     97.5000 -98.0
+     54.7500     95.5000 -98.0
+     59.5000     91.7500 -98.0
+     61.5000     91.7500 -98.0
+     65.5000     89.7500 -98.0
+     73.5000     88.7500 -98.0
+     79.5000     90.7500 -98.0
+     83.2500     94.5000 -98.0
+     84.5000     93.7500 -98.0
+     84.7500     91.5000 -98.0
+     81.5000     90.2500 -98.0
+     80.7500     88.5000 -98.0
+     69.5000     87.2500 -98.0
+     67.5000     88.2500 -98.0
+     66.7500     87.5000 -98.0
+} -98.0
+{ -98.0
+    135.2500     89.5000 -98.0
+    133.5000     91.2500 -98.0
+    134.5000     91.7500 -98.0
+    137.5000     90.7500 -98.0
+    137.7500     89.5000 -98.0
+} -98.0
+{ -98.0
+    128.2500     93.5000 -98.0
+    126.2500     96.5000 -98.0
+    127.5000     96.7500 -98.0
+    129.5000     94.7500 -98.0
+} -98.0
+{ -98.0
+     57.7500     68.5000 -98.0
+     58.5000     67.7500 -98.0
+     59.2500     68.5000 -98.0
+     58.5000     69.2500 -98.0
+} -98.0
+{ -98.0
+    154.7500     70.5000 -98.0
+    155.5000     69.7500 -98.0
+    157.2500     70.5000 -98.0
+    156.5000     72.2500 -98.0
+    154.5000     72.2500 -98.0
+    152.7500     71.5000 -98.0
+} -98.0
+v 192 z -100.000000 -98.0
+{ -98.0
+    116.2500     37.5000 -100.0
+    117.2500     39.5000 -100.0
+    117.2500     47.5000 -100.0
+    116.2500     52.5000 -100.0
+    116.7500     53.5000 -100.0
+    117.7500     51.5000 -100.0
+    121.5000     49.7500 -100.0
+    118.7500     45.5000 -100.0
+    117.7500     38.5000 -100.0
+} -100.0
+{ -100.0
+    100.2500     38.5000 -100.0
+     98.5000     42.2500 -100.0
+     98.2500     44.5000 -100.0
+     95.2500     48.5000 -100.0
+     96.5000     48.7500 -100.0
+     98.2500     50.5000 -100.0
+     98.2500     52.5000 -100.0
+     99.5000     52.7500 -100.0
+     99.7500     51.5000 -100.0
+     98.7500     48.5000 -100.0
+    100.7500     39.5000 -100.0
+} -100.0
+{ -100.0
+     59.2500     62.5000 -100.0
+     56.5000     64.2500 -100.0
+     52.5000     71.2500 -100.0
+     52.2500     74.5000 -100.0
+     53.5000     74.7500 -100.0
+     57.5000     71.7500 -100.0
+     60.5000     71.7500 -100.0
+     62.2500     72.5000 -100.0
+     63.2500     74.5000 -100.0
+     68.7500     77.5000 -100.0
+     63.7500     69.5000 -100.0
+     63.7500     66.5000 -100.0
+     60.7500     62.5000 -100.0
+} -100.0
+{ -100.0
+    154.2500     65.5000 -100.0
+    151.5000     69.2500 -100.0
+    151.2500     71.5000 -100.0
+    146.5000     76.2500 -100.0
+    146.5000     77.7500 -100.0
+    148.5000     76.7500 -100.0
+    151.5000     76.7500 -100.0
+    154.5000     73.7500 -100.0
+    156.5000     73.7500 -100.0
+    160.5000     77.7500 -100.0
+    162.5000     78.7500 -100.0
+    162.7500     75.5000 -100.0
+    160.7500     69.5000 -100.0
+    157.7500     65.5000 -100.0
+} -100.0
+{ -100.0
+    143.2500     79.5000 -100.0
+    142.2500     80.5000 -100.0
+    144.5000     80.7500 -100.0
+    144.7500     79.5000 -100.0
+} -100.0
+{ -100.0
+     61.2500     87.5000 -100.0
+     59.5000     88.2500 -100.0
+     59.2500     89.5000 -100.0
+     51.2500     97.5000 -100.0
+     45.2500    105.5000 -100.0
+     35.2500    124.5000 -100.0
+     31.5000    134.2500 -100.0
+     29.2500    149.5000 -100.0
+     28.5000    151.2500 -100.0
+     28.2500    159.5000 -100.0
+     29.2500    161.5000 -100.0
+     29.2500    165.5000 -100.0
+     30.2500    167.5000 -100.0
+     30.2500    172.5000 -100.0
+     31.2500    174.5000 -100.0
+     31.2500    177.5000 -100.0
+     37.2500    196.5000 -100.0
+     43.2500    206.5000 -100.0
+     50.5000    213.7500 -100.0
+     52.5000    214.7500 -100.0
+     53.2500    216.5000 -100.0
+     54.5000    216.7500 -100.0
+     57.5000    219.7500 -100.0
+     65.5000    224.7500 -100.0
+     84.5000    231.7500 -100.0
+     91.2500    233.5000 -100.0
+    106.5000    233.7500 -100.0
+    108.5000    232.7500 -100.0
+    112.5000    232.7500 -100.0
+    114.5000    231.7500 -100.0
+    116.5000    231.7500 -100.0
+    126.5000    227.7500 -100.0
+    129.7500    227.5000 -100.0
+    136.5000    224.7500 -100.0
+    149.5000    215.7500 -100.0
+    158.5000    206.7500 -100.0
+    162.7500    200.5000 -100.0
+    171.7500    183.5000 -100.0
+    175.7500    169.5000 -100.0
+    178.5000    162.7500 -100.0
+    178.7500    148.5000 -100.0
+    177.7500    146.5000 -100.0
+    177.7500    142.5000 -100.0
+    175.7500    135.5000 -100.0
+    173.7500    124.5000 -100.0
+    163.7500    104.5000 -100.0
+    152.7500     92.5000 -100.0
+    148.5000     92.2500 -100.0
+    146.7500     91.5000 -100.0
+    145.5000     92.2500 -100.0
+    141.5000     91.2500 -100.0
+    145.2500     93.5000 -100.0
+    147.5000     93.7500 -100.0
+    151.2500     96.5000 -100.0
+    151.2500     99.5000 -100.0
+    154.2500    102.5000 -100.0
+    160.5000    104.7500 -100.0
+    163.2500    107.5000 -100.0
+    165.2500    111.5000 -100.0
+    165.2500    113.5000 -100.0
+    166.5000    113.7500 -100.0
+    169.2500    117.5000 -100.0
+    169.2500    119.5000 -100.0
+    172.2500    125.5000 -100.0
+    172.2500    133.5000 -100.0
+    174.2500    137.5000 -100.0
+    174.2500    140.5000 -100.0
+    175.2500    142.5000 -100.0
+    174.5000    143.2500 -100.0
+    173.2500    148.5000 -100.0
+    172.2500    153.5000 -100.0
+    173.2500    155.5000 -100.0
+    169.2500    173.5000 -100.0
+    157.5000    196.2500 -100.0
+    149.5000    205.2500 -100.0
+    139.5000    214.2500 -100.0
+    130.5000    219.2500 -100.0
+    128.5000    219.2500 -100.0
+    122.5000    222.2500 -100.0
+    120.5000    222.2500 -100.0
+    118.5000    223.2500 -100.0
+    111.5000    223.2500 -100.0
+    100.5000    221.2500 -100.0
+     98.5000    223.2500 -100.0
+     94.5000    225.2500 -100.0
+     87.5000    225.2500 -100.0
+     82.5000    224.2500 -100.0
+     74.5000    219.2500 -100.0
+     64.5000    215.2500 -100.0
+     57.7500    209.5000 -100.0
+     45.7500    195.5000 -100.0
+     38.7500    182.5000 -100.0
+     38.7500    179.5000 -100.0
+     36.7500    175.5000 -100.0
+     36.7500    173.5000 -100.0
+     35.7500    171.5000 -100.0
+     35.7500    167.5000 -100.0
+     34.7500    165.5000 -100.0
+     34.7500    143.5000 -100.0
+     33.7500    141.5000 -100.0
+     33.7500    132.5000 -100.0
+     38.7500    122.5000 -100.0
+     42.7500    112.5000 -100.0
+     46.5000    109.7500 -100.0
+     47.7500    105.5000 -100.0
+     55.7500     94.5000 -100.0
+     58.5000     92.7500 -100.0
+     61.5000     92.7500 -100.0
+     63.5000     90.7500 -100.0
+     67.5000     90.7500 -100.0
+     69.5000     89.7500 -100.0
+     71.5000     89.7500 -100.0
+     72.7500     88.5000 -100.0
+     69.5000     88.2500 -100.0
+     67.5000     89.2500 -100.0
+     64.7500     87.5000 -100.0
+} -100.0
+{ -100.0
+     75.2500     89.5000 -100.0
+     74.5000     90.2500 -100.0
+     81.2500     94.5000 -100.0
+     84.5000     94.7500 -100.0
+     82.7500     91.5000 -100.0
+     81.7500     89.5000 -100.0
+} -100.0
+{ -100.0
+    133.2500     91.5000 -100.0
+    132.5000     92.2500 -100.0
+    133.5000     92.7500 -100.0
+    134.7500     91.5000 -100.0
+} -100.0
+{ -100.0
+    127.2500     94.5000 -100.0
+    125.2500     97.5000 -100.0
+    126.5000     97.7500 -100.0
+    128.5000     95.7500 -100.0
+} -100.0
+{ -100.0
+    110.2500    103.5000 -100.0
+    109.2500    104.5000 -100.0
+    110.7500    104.5000 -100.0
+} -100.0
+{ -100.0
+     58.7500     66.5000 -100.0
+     59.5000     65.7500 -100.0
+     60.2500     66.5000 -100.0
+     59.5000     68.2500 -100.0
+} -100.0
+{ -100.0
+    154.7500     69.5000 -100.0
+    155.5000     68.7500 -100.0
+    156.2500     69.5000 -100.0
+    155.5000     70.2500 -100.0
+} -100.0
+v 186 z -102.000000 -64.0
+{ -102.0
+    100.2500     37.5000 -102.0
+     96.5000     45.2500 -102.0
+     94.5000     46.2500 -102.0
+     92.2500     49.5000 -102.0
+     96.5000     49.7500 -102.0
+     98.5000     52.7500 -102.0
+     98.7500     49.5000 -102.0
+     97.7500     47.5000 -102.0
+     98.7500     42.5000 -102.0
+    100.7500     38.5000 -102.0
+} -102.0
+{ -102.0
+    117.2500     38.5000 -102.0
+    117.2500     39.5000 -102.0
+    118.2500     41.5000 -102.0
+    118.2500     49.5000 -102.0
+    117.5000     51.2500 -102.0
+    117.5000     53.7500 -102.0
+    119.5000     50.7500 -102.0
+    124.5000     51.7500 -102.0
+    124.7500     50.5000 -102.0
+    119.7500     45.5000 -102.0
+    119.7500     43.5000 -102.0
+} -102.0
+{ -102.0
+     58.2500     62.5000 -102.0
+     56.2500     64.5000 -102.0
+     52.5000     71.2500 -102.0
+     52.2500     73.5000 -102.0
+     54.5000     73.7500 -102.0
+     57.5000     70.7500 -102.0
+     60.5000     70.7500 -102.0
+     63.5000     73.7500 -102.0
+     68.7500     76.5000 -102.0
+     67.7500     73.5000 -102.0
+     63.7500     69.5000 -102.0
+     63.7500     66.5000 -102.0
+     61.7500     62.5000 -102.0
+} -102.0
+{ -102.0
+    120.2500     64.5000 -102.0
+    119.5000     65.2500 -102.0
+    121.2500     67.5000 -102.0
+    121.5000     70.7500 -102.0
+    121.7500     67.5000 -102.0
+} -102.0
+{ -102.0
+    154.2500     64.5000 -102.0
+    152.5000     66.2500 -102.0
+    150.2500     72.5000 -102.0
+    148.5000     73.2500 -102.0
+    145.2500     77.5000 -102.0
+    150.5000     75.7500 -102.0
+    153.5000     71.7500 -102.0
+    156.5000     71.7500 -102.0
+    160.2500     77.5000 -102.0
+    162.5000     77.7500 -102.0
+    162.7500     74.5000 -102.0
+    160.7500     70.5000 -102.0
+    160.7500     68.5000 -102.0
+    157.7500     64.5000 -102.0
+} -102.0
+{ -102.0
+    142.2500     79.5000 -102.0
+    140.2500     81.5000 -102.0
+    142.5000     81.7500 -102.0
+    143.7500     79.5000 -102.0
+} -102.0
+{ -102.0
+    122.2500     82.5000 -102.0
+    121.2500     84.5000 -102.0
+    125.5000     84.7500 -102.0
+    123.7500     82.5000 -102.0
+} -102.0
+{ -102.0
+     77.2500     87.5000 -102.0
+     76.2500     89.5000 -102.0
+     74.2500     90.5000 -102.0
+     78.5000     91.7500 -102.0
+     84.5000     95.7500 -102.0
+     84.7500     94.5000 -102.0
+     81.7500     88.5000 -102.0
+} -102.0
+{ -102.0
+     60.2500     88.5000 -102.0
+     52.5000     96.2500 -102.0
+     46.5000    104.2500 -102.0
+     33.2500    129.5000 -102.0
+     29.5000    146.2500 -102.0
+     28.2500    157.5000 -102.0
+     30.2500    163.5000 -102.0
+     30.2500    170.5000 -102.0
+     32.2500    177.5000 -102.0
+     33.2500    183.5000 -102.0
+     39.5000    199.7500 -102.0
+     46.5000    209.7500 -102.0
+     48.5000    210.7500 -102.0
+     60.2500    221.5000 -102.0
+     73.2500    228.5000 -102.0
+     86.2500    232.5000 -102.0
+    112.5000    232.7500 -102.0
+    114.5000    231.7500 -102.0
+    117.5000    231.7500 -102.0
+    127.5000    227.7500 -102.0
+    129.5000    227.7500 -102.0
+    135.5000    224.7500 -102.0
+    146.5000    217.7500 -102.0
+    152.5000    211.7500 -102.0
+    154.5000    210.7500 -102.0
+    162.7500    199.5000 -102.0
+    171.5000    182.7500 -102.0
+    174.7500    171.5000 -102.0
+    178.5000    161.7500 -102.0
+    178.7500    150.5000 -102.0
+    176.7500    143.5000 -102.0
+    174.7500    129.5000 -102.0
+    172.7500    125.5000 -102.0
+    172.7500    123.5000 -102.0
+    161.7500    102.5000 -102.0
+    155.7500     97.5000 -102.0
+    153.7500     93.5000 -102.0
+    150.5000     92.2500 -102.0
+    147.5000     93.2500 -102.0
+    145.7500     91.5000 -102.0
+    144.5000     92.2500 -102.0
+    139.2500     91.5000 -102.0
+    142.2500     93.5000 -102.0
+    147.5000     94.7500 -102.0
+    151.2500     98.5000 -102.0
+    151.2500    100.5000 -102.0
+    157.2500    104.5000 -102.0
+    159.5000    104.7500 -102.0
+    163.2500    108.5000 -102.0
+    163.2500    110.5000 -102.0
+    170.2500    121.5000 -102.0
+    170.2500    123.5000 -102.0
+    172.2500    127.5000 -102.0
+    171.2500    128.5000 -102.0
+    172.2500    130.5000 -102.0
+    172.2500    134.5000 -102.0
+    174.2500    138.5000 -102.0
+    174.2500    145.5000 -102.0
+    172.5000    149.2500 -102.0
+    172.2500    160.5000 -102.0
+    171.2500    162.5000 -102.0
+    170.2500    169.5000 -102.0
+    162.2500    188.5000 -102.0
+    155.2500    198.5000 -102.0
+    147.5000    207.2500 -102.0
+    140.5000    213.2500 -102.0
+    125.5000    221.2500 -102.0
+    122.5000    221.2500 -102.0
+    118.5000    223.2500 -102.0
+    111.5000    223.2500 -102.0
+    107.5000    221.2500 -102.0
+    104.5000    222.2500 -102.0
+    101.5000    221.2500 -102.0
+     93.5000    225.2500 -102.0
+     90.5000    225.2500 -102.0
+     80.5000    223.2500 -102.0
+     72.7500    218.5000 -102.0
+     66.5000    216.2500 -102.0
+     59.5000    211.2500 -102.0
+     51.7500    203.5000 -102.0
+     45.7500    194.5000 -102.0
+     37.7500    178.5000 -102.0
+     36.7500    171.5000 -102.0
+     33.7500    160.5000 -102.0
+     34.5000    159.7500 -102.0
+     34.7500    144.5000 -102.0
+     33.7500    142.5000 -102.0
+     33.7500    136.5000 -102.0
+     34.7500    133.5000 -102.0
+     42.7500    113.5000 -102.0
+     46.7500    109.5000 -102.0
+     49.7500    102.5000 -102.0
+     52.5000     99.7500 -102.0
+     56.5000     93.7500 -102.0
+     59.5000     93.7500 -102.0
+     65.5000     90.7500 -102.0
+     67.5000     90.7500 -102.0
+     72.5000     88.7500 -102.0
+     71.5000     88.2500 -102.0
+     69.5000     89.2500 -102.0
+} -102.0
+{ -102.0
+    129.2500     91.5000 -102.0
+    127.5000     92.2500 -102.0
+    124.2500     97.5000 -102.0
+    125.5000     97.7500 -102.0
+    129.5000     94.7500 -102.0
+    128.7500     93.5000 -102.0
+    129.7500     92.5000 -102.0
+} -102.0
+{ -102.0
+    134.2500     91.5000 -102.0
+    130.2500     93.5000 -102.0
+    134.5000     94.7500 -102.0
+    135.7500     91.5000 -102.0
+} -102.0
+{ -102.0
+    111.2500    104.5000 -102.0
+    110.2500    105.5000 -102.0
+    111.7500    105.5000 -102.0
+} -102.0
+{ -102.0
+     58.7500     66.5000 -102.0
+     59.5000     65.7500 -102.0
+     61.2500     66.5000 -102.0
+     60.5000     67.2500 -102.0
+} -102.0
+v 208 z -104.000000 -64.0
+{ -104.0
+     99.2500     38.5000 -104.0
+     97.5000     41.2500 -104.0
+     97.2500     43.5000 -104.0
+     90.5000     49.2500 -104.0
+     90.5000     50.7500 -104.0
+     92.5000     51.7500 -104.0
+     93.5000     49.7500 -104.0
+     95.5000     48.7500 -104.0
+     97.2500     50.5000 -104.0
+     97.5000     52.7500 -104.0
+     97.7500     45.5000 -104.0
+     99.7500     39.5000 -104.0
+} -104.0
+{ -104.0
+    118.2500     39.5000 -104.0
+    118.2500     44.5000 -104.0
+    119.2500     46.5000 -104.0
+    118.2500     53.5000 -104.0
+    121.5000     50.7500 -104.0
+    123.2500     53.5000 -104.0
+    124.5000     53.7500 -104.0
+    127.7500     52.5000 -104.0
+    128.7500     50.5000 -104.0
+    125.5000     49.2500 -104.0
+    121.7500     46.5000 -104.0
+} -104.0
+{ -104.0
+    121.2500     59.5000 -104.0
+    120.2500     61.5000 -104.0
+    121.2500     63.5000 -104.0
+    120.5000     65.2500 -104.0
+    123.2500     66.5000 -104.0
+    123.2500     68.5000 -104.0
+    124.5000     68.7500 -104.0
+    123.7500     67.5000 -104.0
+    123.7500     64.5000 -104.0
+} -104.0
+{ -104.0
+     58.2500     61.5000 -104.0
+     54.5000     66.2500 -104.0
+     52.5000     72.7500 -104.0
+     54.5000     73.7500 -104.0
+     58.5000     69.7500 -104.0
+     60.5000     68.7500 -104.0
+     63.5000     72.7500 -104.0
+     69.5000     75.7500 -104.0
+     69.7500     74.5000 -104.0
+     63.7500     67.5000 -104.0
+     63.7500     65.5000 -104.0
+     61.7500     61.5000 -104.0
+} -104.0
+{ -104.0
+     93.2500     61.5000 -104.0
+     92.5000     62.2500 -104.0
+     92.2500     64.5000 -104.0
+     93.5000     64.7500 -104.0
+     93.7500     62.5000 -104.0
+} -104.0
+{ -104.0
+    153.2500     62.5000 -104.0
+    152.2500     63.5000 -104.0
+    151.2500     68.5000 -104.0
+    145.5000     76.2500 -104.0
+    146.5000     76.7500 -104.0
+    153.5000     69.7500 -104.0
+    155.5000     69.7500 -104.0
+    159.2500     73.5000 -104.0
+    159.2500     75.5000 -104.0
+    162.5000     77.7500 -104.0
+    162.7500     74.5000 -104.0
+    159.7500     65.5000 -104.0
+    156.7500     62.5000 -104.0
+} -104.0
+{ -104.0
+     71.2500     77.5000 -104.0
+     71.5000     78.7500 -104.0
+     73.5000     79.7500 -104.0
+} -104.0
+{ -104.0
+     61.2500     88.5000 -104.0
+     59.5000     89.2500 -104.0
+     59.2500     90.5000 -104.0
+     56.5000     93.2500 -104.0
+     54.5000     94.2500 -104.0
+     54.2500     95.5000 -104.0
+     47.5000    103.2500 -104.0
+     34.2500    128.5000 -104.0
+     30.2500    145.5000 -104.0
+     28.2500    155.5000 -104.0
+     30.2500    162.5000 -104.0
+     30.2500    168.5000 -104.0
+     32.2500    175.5000 -104.0
+     33.2500    181.5000 -104.0
+     39.5000    198.7500 -104.0
+     45.2500    207.5000 -104.0
+     53.2500    214.5000 -104.0
+     54.2500    216.5000 -104.0
+     65.5000    224.7500 -104.0
+     79.5000    230.7500 -104.0
+     86.2500    232.5000 -104.0
+    111.5000    232.7500 -104.0
+    113.5000    231.7500 -104.0
+    120.5000    230.7500 -104.0
+    135.7500    224.5000 -104.0
+    144.5000    218.7500 -104.0
+    151.5000    211.7500 -104.0
+    153.5000    210.7500 -104.0
+    162.7500    198.5000 -104.0
+    169.5000    185.7500 -104.0
+    178.5000    160.7500 -104.0
+    178.7500    151.5000 -104.0
+    176.7500    144.5000 -104.0
+    175.7500    137.5000 -104.0
+    171.7500    123.5000 -104.0
+    163.7500    106.5000 -104.0
+    159.7500    100.5000 -104.0
+    154.7500     96.5000 -104.0
+    153.7500     94.5000 -104.0
+    150.5000     93.2500 -104.0
+    148.5000     94.2500 -104.0
+    146.5000     94.2500 -104.0
+    144.7500     92.5000 -104.0
+    144.7500     90.5000 -104.0
+    143.2500     93.5000 -104.0
+    150.2500     98.5000 -104.0
+    150.2500    100.5000 -104.0
+    154.5000    104.7500 -104.0
+    159.5000    105.7500 -104.0
+    161.2500    107.5000 -104.0
+    163.2500    113.5000 -104.0
+    164.5000    113.7500 -104.0
+    165.2500    115.5000 -104.0
+    168.2500    118.5000 -104.0
+    168.2500    120.5000 -104.0
+    171.2500    126.5000 -104.0
+    171.2500    132.5000 -104.0
+    172.2500    134.5000 -104.0
+    172.2500    136.5000 -104.0
+    174.2500    140.5000 -104.0
+    174.2500    145.5000 -104.0
+    172.5000    149.2500 -104.0
+    172.2500    159.5000 -104.0
+    168.2500    174.5000 -104.0
+    163.5000    184.2500 -104.0
+    163.2500    186.5000 -104.0
+    154.5000    198.2500 -104.0
+    145.2500    209.5000 -104.0
+    133.5000    217.2500 -104.0
+    131.5000    217.2500 -104.0
+    127.5000    220.2500 -104.0
+    125.5000    220.2500 -104.0
+    121.5000    222.2500 -104.0
+    114.5000    223.2500 -104.0
+    106.5000    221.2500 -104.0
+    104.5000    222.2500 -104.0
+    103.7500    221.5000 -104.0
+    100.5000    221.2500 -104.0
+     96.5000    224.2500 -104.0
+     91.5000    225.2500 -104.0
+     81.5000    223.2500 -104.0
+     73.5000    219.2500 -104.0
+     61.5000    212.2500 -104.0
+     51.7500    202.5000 -104.0
+     48.7500    198.5000 -104.0
+     38.7500    180.5000 -104.0
+     38.7500    178.5000 -104.0
+     36.7500    174.5000 -104.0
+     35.7500    166.5000 -104.0
+     33.7500    159.5000 -104.0
+     34.5000    158.7500 -104.0
+     34.7500    146.5000 -104.0
+     33.7500    143.5000 -104.0
+     34.5000    141.7500 -104.0
+     34.7500    134.5000 -104.0
+     37.5000    128.7500 -104.0
+     37.7500    126.5000 -104.0
+     41.7500    116.5000 -104.0
+     45.5000    112.7500 -104.0
+     48.5000    107.7500 -104.0
+     48.7500    105.5000 -104.0
+     57.5000     93.7500 -104.0
+     60.5000     93.7500 -104.0
+     62.5000     91.7500 -104.0
+     64.5000     91.7500 -104.0
+     70.7500     89.5000 -104.0
+     67.5000     89.2500 -104.0
+     64.5000     90.2500 -104.0
+     62.7500     88.5000 -104.0
+} -104.0
+{ -104.0
+     76.2500     88.5000 -104.0
+     74.5000     90.2500 -104.0
+     75.2500     91.5000 -104.0
+     78.5000     90.7500 -104.0
+     82.2500     96.5000 -104.0
+     85.5000     96.7500 -104.0
+     85.7500     95.5000 -104.0
+     82.5000     88.2500 -104.0
+     80.5000     89.2500 -104.0
+} -104.0
+{ -104.0
+    127.2500     92.5000 -104.0
+    121.5000     96.2500 -104.0
+    120.5000     99.7500 -104.0
+    123.5000     98.7500 -104.0
+    126.5000     95.7500 -104.0
+    128.5000     95.7500 -104.0
+    130.5000     93.7500 -104.0
+    135.5000     94.7500 -104.0
+    137.5000     93.7500 -104.0
+    140.7500     93.5000 -104.0
+    136.7500     92.5000 -104.0
+} -104.0
+{ -104.0
+     58.7500     65.5000 -104.0
+     59.5000     64.7500 -104.0
+     61.2500     65.5000 -104.0
+     60.5000     66.2500 -104.0
+} -104.0
+{ -104.0
+     80.7500     91.5000 -104.0
+     81.5000     90.7500 -104.0
+     83.2500     92.5000 -104.0
+     82.5000     93.2500 -104.0
+} -104.0
+{ -104.0
+    152.7500     97.5000 -104.0
+    153.5000     96.7500 -104.0
+    154.2500     97.5000 -104.0
+    157.2500    101.5000 -104.0
+    156.5000    102.2500 -104.0
+    154.5000    101.2500 -104.0
+} -104.0
+//v 230 z -106.000000 -64.0
+{ -64.0
+     99.2500     37.5000 -64.0
+     95.5000     44.2500 -64.0
+     87.5000     50.2500 -64.0
+     91.2500     55.5000 -64.0
+     91.2500     63.5000 -64.0
+     93.5000     63.7500 -64.0
+     91.7500     61.5000 -64.0
+     91.7500     59.5000 -64.0
+     94.7500     55.5000 -64.0
+     93.5000     55.2500 -64.0
+     91.7500     53.5000 -64.0
+     92.5000     49.7500 -64.0
+     94.5000     48.7500 -64.0
+     97.5000     52.7500 -64.0
+     97.7500     49.5000 -64.0
+     96.7500     47.5000 -64.0
+     97.7500     43.5000 -64.0
+    100.7500     37.5000 -64.0
+} -64.0
+{ -64.0
+    118.2500     38.5000 -64.0
+    118.2500     39.5000 -64.0
+    119.2500     41.5000 -64.0
+    119.2500     47.5000 -64.0
+    120.2500     49.5000 -64.0
+    119.5000     50.2500 -64.0
+    119.2500     52.5000 -64.0
+    121.5000     51.7500 -64.0
+    123.2500     52.5000 -64.0
+    124.5000     50.7500 -64.0
+    126.5000     50.7500 -64.0
+    128.5000     52.7500 -64.0
+    130.5000     53.7500 -64.0
+    134.5000     51.7500 -64.0
+    132.7500     50.5000 -64.0
+    130.5000     50.2500 -64.0
+    124.5000     48.2500 -64.0
+    121.7500     45.5000 -64.0
+} -64.0
+{ -64.0
+     59.2500     59.5000 -64.0
+     57.2500     61.5000 -64.0
+     52.2500     71.5000 -64.0
+     53.2500     73.5000 -64.0
+     59.5000     67.7500 -64.0
+     62.5000     67.7500 -64.0
+     64.2500     70.5000 -64.0
+     64.2500     72.5000 -64.0
+     69.5000     74.7500 -64.0
+     69.7500     73.5000 -64.0
+     65.7500     69.5000 -64.0
+     63.7500     65.5000 -64.0
+     62.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+    152.2500     59.5000 -64.0
+    151.5000     60.2500 -64.0
+    151.2500     63.5000 -64.0
+    150.2500     66.5000 -64.0
+    149.5000     68.2500 -64.0
+    146.5000     73.2500 -64.0
+    147.2500     74.5000 -64.0
+    149.7500     72.5000 -64.0
+    150.7500     70.5000 -64.0
+    153.5000     68.7500 -64.0
+    155.5000     68.7500 -64.0
+    157.2500     70.5000 -64.0
+    159.2500     74.5000 -64.0
+    162.2500     78.5000 -64.0
+    163.5000     77.7500 -64.0
+    163.7500     75.5000 -64.0
+    160.7500     69.5000 -64.0
+    160.7500     67.5000 -64.0
+    159.7500     64.5000 -64.0
+    154.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+    125.2500     65.5000 -64.0
+    126.2500     67.5000 -64.0
+    127.7500     67.5000 -64.0
+    126.7500     65.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500     82.5000 -64.0
+     92.2500     83.5000 -64.0
+     93.5000     83.7500 -64.0
+} -64.0
+{ -64.0
+    118.2500     83.5000 -64.0
+    116.2500     86.5000 -64.0
+    120.5000     84.7500 -64.0
+} -64.0
+{ -64.0
+     60.2500     89.5000 -64.0
+     58.5000     92.2500 -64.0
+     56.5000     93.2500 -64.0
+     51.2500     98.5000 -64.0
+     38.5000    120.2500 -64.0
+     38.2500    122.5000 -64.0
+     34.2500    130.5000 -64.0
+     29.5000    148.2500 -64.0
+     29.2500    158.5000 -64.0
+     30.2500    160.5000 -64.0
+     30.2500    165.5000 -64.0
+     32.2500    172.5000 -64.0
+     33.2500    181.5000 -64.0
+     39.2500    196.5000 -64.0
+     45.2500    206.5000 -64.0
+     58.2500    219.5000 -64.0
+     68.2500    226.5000 -64.0
+     79.5000    230.7500 -64.0
+     88.2500    232.5000 -64.0
+    108.5000    232.7500 -64.0
+    110.5000    231.7500 -64.0
+    117.5000    231.7500 -64.0
+    121.5000    229.7500 -64.0
+    124.5000    229.7500 -64.0
+    136.5000    223.7500 -64.0
+    147.5000    215.7500 -64.0
+    158.5000    203.7500 -64.0
+    162.7500    197.5000 -64.0
+    169.5000    184.7500 -64.0
+    178.5000    159.7500 -64.0
+    178.7500    152.5000 -64.0
+    176.7500    146.5000 -64.0
+    176.7500    142.5000 -64.0
+    174.7500    138.5000 -64.0
+    171.7500    124.5000 -64.0
+    160.7500    102.5000 -64.0
+    152.7500     94.5000 -64.0
+    150.5000     94.2500 -64.0
+    148.5000     95.2500 -64.0
+    138.5000     94.2500 -64.0
+    134.5000     92.2500 -64.0
+    131.5000     93.2500 -64.0
+    128.5000     92.2500 -64.0
+    125.5000     95.2500 -64.0
+    122.5000     95.2500 -64.0
+    121.5000     93.2500 -64.0
+    121.2500     98.5000 -64.0
+    117.5000    104.7500 -64.0
+    119.5000    103.7500 -64.0
+    123.5000     97.7500 -64.0
+    129.5000     94.7500 -64.0
+    140.5000     94.7500 -64.0
+    144.2500     96.5000 -64.0
+    145.2500     98.5000 -64.0
+    148.5000     98.7500 -64.0
+    155.2500    108.5000 -64.0
+    159.2500    109.5000 -64.0
+    161.5000    113.7500 -64.0
+    163.5000    114.7500 -64.0
+    166.2500    118.5000 -64.0
+    170.2500    126.5000 -64.0
+    171.2500    136.5000 -64.0
+    173.2500    140.5000 -64.0
+    173.2500    145.5000 -64.0
+    171.2500    150.5000 -64.0
+    172.2500    152.5000 -64.0
+    171.2500    164.5000 -64.0
+    168.2500    173.5000 -64.0
+    164.5000    181.2500 -64.0
+    164.2500    183.5000 -64.0
+    161.2500    186.5000 -64.0
+    158.2500    192.5000 -64.0
+    147.5000    207.2500 -64.0
+    139.5000    213.2500 -64.0
+    121.5000    222.2500 -64.0
+    118.5000    222.2500 -64.0
+    116.5000    223.2500 -64.0
+    101.5000    220.2500 -64.0
+     95.5000    224.2500 -64.0
+     88.5000    224.2500 -64.0
+     81.5000    223.2500 -64.0
+     69.5000    217.2500 -64.0
+     56.7500    207.5000 -64.0
+     50.7500    200.5000 -64.0
+     38.7500    181.5000 -64.0
+     38.7500    179.5000 -64.0
+     37.7500    177.5000 -64.0
+     36.7500    170.5000 -64.0
+     33.7500    159.5000 -64.0
+     34.5000    157.7500 -64.0
+     34.7500    141.5000 -64.0
+     35.7500    139.5000 -64.0
+     34.7500    136.5000 -64.0
+     38.5000    127.7500 -64.0
+     40.7500    119.5000 -64.0
+     48.5000    112.7500 -64.0
+     48.7500    106.5000 -64.0
+     57.5000     94.7500 -64.0
+     60.5000     94.7500 -64.0
+     64.5000     91.7500 -64.0
+     69.5000     91.7500 -64.0
+     69.7500     90.5000 -64.0
+} -64.0
+{ -64.0
+     76.2500     89.5000 -64.0
+     75.5000     90.2500 -64.0
+     73.5000     90.2500 -64.0
+     71.5000     91.2500 -64.0
+     73.2500     92.5000 -64.0
+     75.5000     92.7500 -64.0
+     77.5000     91.7500 -64.0
+     79.5000     91.7500 -64.0
+     81.2500     93.5000 -64.0
+     80.2500     95.5000 -64.0
+     85.2500     98.5000 -64.0
+     87.5000     98.7500 -64.0
+     87.7500     96.5000 -64.0
+     86.5000     95.2500 -64.0
+     84.5000     96.2500 -64.0
+     81.7500     94.5000 -64.0
+     82.5000     93.7500 -64.0
+     84.7500     93.5000 -64.0
+     82.5000     90.2500 -64.0
+     80.5000     91.2500 -64.0
+} -64.0
+{ -64.0
+    143.2500     89.5000 -64.0
+    143.2500     90.5000 -64.0
+    144.5000     90.7500 -64.0
+} -64.0
+{ -64.0
+    118.2500    118.5000 -64.0
+    117.5000    121.7500 -64.0
+    121.2500    124.5000 -64.0
+    121.7500    123.5000 -64.0
+    119.7500    121.5000 -64.0
+    119.7500    119.5000 -64.0
+} -64.0
+{ -64.0
+    144.2500    132.5000 -64.0
+    143.2500    134.5000 -64.0
+    144.2500    136.5000 -64.0
+    147.5000    136.7500 -64.0
+    147.7500    132.5000 -64.0
+} -64.0
+{ -64.0
+     59.7500     63.5000 -64.0
+     60.5000     62.7500 -64.0
+     61.2500     63.5000 -64.0
+     60.5000     65.2500 -64.0
+} -64.0
+{ -64.0
+    153.7500     65.5000 -64.0
+    155.5000     64.7500 -64.0
+    157.2500     65.5000 -64.0
+    156.5000     67.2500 -64.0
+    154.5000     67.2500 -64.0
+} -64.0
+{ -64.0
+    151.7500     97.5000 -64.0
+    152.5000     96.7500 -64.0
+    155.2500     99.5000 -64.0
+    156.2500    101.5000 -64.0
+    155.5000    103.2500 -64.0
+    152.7500     99.5000 -64.0
+} -64.0
+v 251 z -108.000000 -64.0
+{ -64.0
+     98.2500     38.5000 -64.0
+     95.2500     44.5000 -64.0
+     92.2500     46.5000 -64.0
+     81.5000     50.2500 -64.0
+     84.5000     52.7500 -64.0
+     88.5000     50.7500 -64.0
+     91.7500     53.5000 -64.0
+     90.7500     51.5000 -64.0
+     92.5000     48.7500 -64.0
+     95.5000     49.7500 -64.0
+     97.5000     53.7500 -64.0
+     97.7500     50.5000 -64.0
+     96.7500     48.5000 -64.0
+     96.7500     45.5000 -64.0
+     98.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+    119.2500     39.5000 -64.0
+    119.2500     42.5000 -64.0
+    120.2500     44.5000 -64.0
+    119.5000     52.7500 -64.0
+    122.5000     51.7500 -64.0
+    123.5000     49.7500 -64.0
+    125.5000     49.7500 -64.0
+    132.2500     52.5000 -64.0
+    132.7500     57.5000 -64.0
+    133.7500     55.5000 -64.0
+    136.5000     53.7500 -64.0
+    141.5000     53.7500 -64.0
+    144.5000     54.7500 -64.0
+    149.2500     59.5000 -64.0
+    149.2500     63.5000 -64.0
+    145.5000     71.2500 -64.0
+    145.2500     73.5000 -64.0
+    147.5000     73.7500 -64.0
+    147.7500     72.5000 -64.0
+    153.5000     67.7500 -64.0
+    157.2500     69.5000 -64.0
+    160.2500     74.5000 -64.0
+    160.2500     76.5000 -64.0
+    163.2500     80.5000 -64.0
+    164.7500     79.5000 -64.0
+    163.7500     77.5000 -64.0
+    163.7500     74.5000 -64.0
+    157.7500     60.5000 -64.0
+    152.7500     56.5000 -64.0
+    140.7500     51.5000 -64.0
+    128.5000     49.2500 -64.0
+    122.7500     46.5000 -64.0
+} -64.0
+{ -64.0
+     62.2500     56.5000 -64.0
+     60.5000     57.2500 -64.0
+     58.2500     59.5000 -64.0
+     52.5000     70.2500 -64.0
+     52.2500     73.5000 -64.0
+     53.5000     73.7500 -64.0
+     59.5000     66.7500 -64.0
+     62.5000     66.7500 -64.0
+     68.2500     73.5000 -64.0
+     69.7500     73.5000 -64.0
+     64.7500     65.5000 -64.0
+     64.7500     56.5000 -64.0
+} -64.0
+{ -64.0
+    132.2500     64.5000 -64.0
+    131.5000     65.2500 -64.0
+    132.5000     65.7500 -64.0
+    133.7500     64.5000 -64.0
+} -64.0
+{ -64.0
+    106.2500     79.5000 -64.0
+    106.5000     84.7500 -64.0
+    106.7500     80.5000 -64.0
+} -64.0
+{ -64.0
+     93.2500     82.5000 -64.0
+     93.2500     83.5000 -64.0
+     94.5000     83.7500 -64.0
+     94.7500     82.5000 -64.0
+} -64.0
+{ -64.0
+    119.2500     84.5000 -64.0
+    119.2500     85.5000 -64.0
+    120.5000     85.7500 -64.0
+} -64.0
+{ -64.0
+    140.2500     86.5000 -64.0
+    142.7500     88.5000 -64.0
+    141.7500     86.5000 -64.0
+} -64.0
+{ -64.0
+    123.2500     88.5000 -64.0
+    122.2500     89.5000 -64.0
+    124.5000     89.7500 -64.0
+    124.7500     88.5000 -64.0
+} -64.0
+{ -64.0
+     81.2500     89.5000 -64.0
+     81.2500     92.5000 -64.0
+     79.5000     93.2500 -64.0
+     77.5000     91.2500 -64.0
+     75.5000     92.2500 -64.0
+     72.5000     92.2500 -64.0
+     70.5000     90.2500 -64.0
+     68.5000     91.2500 -64.0
+     60.5000     90.2500 -64.0
+     50.5000    100.2500 -64.0
+     35.5000    129.2500 -64.0
+     29.5000    149.2500 -64.0
+     29.2500    156.5000 -64.0
+     31.2500    163.5000 -64.0
+     31.2500    168.5000 -64.0
+     32.2500    170.5000 -64.0
+     33.2500    179.5000 -64.0
+     40.2500    197.5000 -64.0
+     49.2500    209.5000 -64.0
+     58.2500    219.5000 -64.0
+     68.2500    226.5000 -64.0
+     78.2500    230.5000 -64.0
+     83.2500    231.5000 -64.0
+    114.5000    231.7500 -64.0
+    116.5000    230.7500 -64.0
+    119.5000    230.7500 -64.0
+    129.5000    227.7500 -64.0
+    139.5000    221.7500 -64.0
+    147.7500    214.5000 -64.0
+    156.7500    204.5000 -64.0
+    163.7500    194.5000 -64.0
+    169.7500    182.5000 -64.0
+    177.5000    161.7500 -64.0
+    178.7500    153.5000 -64.0
+    177.7500    151.5000 -64.0
+    174.7500    137.5000 -64.0
+    172.7500    133.5000 -64.0
+    172.7500    130.5000 -64.0
+    170.7500    126.5000 -64.0
+    170.7500    124.5000 -64.0
+    159.7500    102.5000 -64.0
+    152.7500     95.5000 -64.0
+    149.5000     95.2500 -64.0
+    145.5000     97.2500 -64.0
+    140.5000     94.2500 -64.0
+    138.5000     95.2500 -64.0
+    135.5000     94.2500 -64.0
+    132.2500     95.5000 -64.0
+    140.5000     95.7500 -64.0
+    145.5000    100.7500 -64.0
+    148.5000     99.7500 -64.0
+    152.2500    106.5000 -64.0
+    152.5000    108.7500 -64.0
+    158.5000    111.7500 -64.0
+    167.2500    122.5000 -64.0
+    167.2500    124.5000 -64.0
+    169.2500    128.5000 -64.0
+    169.2500    133.5000 -64.0
+    170.2500    135.5000 -64.0
+    170.2500    137.5000 -64.0
+    172.2500    139.5000 -64.0
+    171.2500    153.5000 -64.0
+    172.2500    155.5000 -64.0
+    172.2500    160.5000 -64.0
+    167.5000    174.2500 -64.0
+    167.2500    176.5000 -64.0
+    165.5000    178.2500 -64.0
+    165.2500    180.5000 -64.0
+    160.5000    185.2500 -64.0
+    158.2500    191.5000 -64.0
+    150.2500    203.5000 -64.0
+    145.2500    208.5000 -64.0
+    138.5000    213.2500 -64.0
+    123.5000    221.2500 -64.0
+    121.5000    221.2500 -64.0
+    119.5000    222.2500 -64.0
+    101.5000    220.2500 -64.0
+     93.5000    224.2500 -64.0
+     88.5000    224.2500 -64.0
+     83.5000    223.2500 -64.0
+     73.5000    219.2500 -64.0
+     63.5000    213.2500 -64.0
+     50.7500    200.5000 -64.0
+     44.7500    189.5000 -64.0
+     39.7500    181.5000 -64.0
+     39.7500    179.5000 -64.0
+     36.7500    173.5000 -64.0
+     35.7500    163.5000 -64.0
+     34.7500    161.5000 -64.0
+     34.7500    145.5000 -64.0
+     35.5000    143.7500 -64.0
+     35.7500    134.5000 -64.0
+     39.5000    126.7500 -64.0
+     40.7500    121.5000 -64.0
+     45.5000    114.7500 -64.0
+     49.5000    112.7500 -64.0
+     49.7500    105.5000 -64.0
+     58.5000     95.7500 -64.0
+     60.5000     95.7500 -64.0
+     64.5000     92.7500 -64.0
+     76.5000     93.7500 -64.0
+     79.5000     96.7500 -64.0
+     81.5000     97.7500 -64.0
+     86.5000     98.7500 -64.0
+     86.7500     97.5000 -64.0
+     84.5000     97.2500 -64.0
+     82.7500     93.5000 -64.0
+     83.5000     92.7500 -64.0
+     82.7500     90.5000 -64.0
+} -64.0
+{ -64.0
+     89.2500     90.5000 -64.0
+     89.2500     91.5000 -64.0
+     90.5000     91.7500 -64.0
+} -64.0
+{ -64.0
+    128.2500     92.5000 -64.0
+    126.2500     95.5000 -64.0
+    128.5000     95.7500 -64.0
+    129.7500     92.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500     94.5000 -64.0
+    122.2500     97.5000 -64.0
+    123.7500     94.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500    102.5000 -64.0
+    118.5000    106.2500 -64.0
+    119.5000    106.7500 -64.0
+    120.7500    103.5000 -64.0
+} -64.0
+{ -64.0
+    117.2500    120.5000 -64.0
+    119.2500    124.5000 -64.0
+    120.5000    124.7500 -64.0
+    126.2500    130.5000 -64.0
+    131.2500    133.5000 -64.0
+    135.5000    133.7500 -64.0
+    138.5000    134.7500 -64.0
+    139.2500    136.5000 -64.0
+    142.2500    138.5000 -64.0
+    147.5000    139.7500 -64.0
+    149.5000    138.7500 -64.0
+    150.7500    132.5000 -64.0
+    145.5000    129.2500 -64.0
+    142.5000    130.2500 -64.0
+    135.7500    126.5000 -64.0
+    133.5000    126.2500 -64.0
+    130.5000    127.2500 -64.0
+    125.7500    125.5000 -64.0
+    126.7500    122.5000 -64.0
+    124.5000    122.2500 -64.0
+    123.5000    124.2500 -64.0
+    121.5000    124.2500 -64.0
+    118.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+    152.7500     61.5000 -64.0
+    153.5000     60.7500 -64.0
+    154.2500     61.5000 -64.0
+    157.2500     65.5000 -64.0
+    156.5000     66.2500 -64.0
+    154.5000     66.2500 -64.0
+    152.7500     64.5000 -64.0
+} -64.0
+{ -64.0
+    152.7500     98.5000 -64.0
+    153.5000     97.7500 -64.0
+    155.2500     99.5000 -64.0
+    155.2500    101.5000 -64.0
+    154.5000    103.2500 -64.0
+    151.7500    100.5000 -64.0
+} -64.0
+{ -64.0
+    155.5000    104.7500 -64.0
+    156.2500    106.5000 -64.0
+    155.5000    108.2500 -64.0
+    153.7500    106.5000 -64.0
+} -64.0
+{ -64.0
+    157.7500    107.5000 -64.0
+    158.5000    106.7500 -64.0
+    159.2500    107.5000 -64.0
+    158.5000    108.2500 -64.0
+} -64.0
+{ -64.0
+    173.7500    149.5000 -64.0
+    174.5000    148.7500 -64.0
+    175.2500    149.5000 -64.0
+    174.5000    150.2500 -64.0
+} -64.0
+v 304 z -110.000000 -64.0
+{ -64.0
+     97.2500     40.5000 -64.0
+     96.2500     42.5000 -64.0
+     93.5000     45.2500 -64.0
+     88.5000     48.2500 -64.0
+     86.5000     48.2500 -64.0
+     84.5000     49.2500 -64.0
+     75.5000     49.2500 -64.0
+     73.5000     50.2500 -64.0
+     71.5000     50.2500 -64.0
+     63.5000     54.2500 -64.0
+     59.2500     57.5000 -64.0
+     56.2500     63.5000 -64.0
+     52.2500     69.5000 -64.0
+     51.2500     74.5000 -64.0
+     52.5000     74.7500 -64.0
+     60.5000     65.7500 -64.0
+     62.5000     65.7500 -64.0
+     68.5000     71.7500 -64.0
+     68.7500     68.5000 -64.0
+     66.7500     64.5000 -64.0
+     66.7500     61.5000 -64.0
+     68.5000     56.7500 -64.0
+     72.5000     53.7500 -64.0
+     84.5000     54.7500 -64.0
+     83.7500     51.5000 -64.0
+     85.5000     49.7500 -64.0
+     90.5000     49.7500 -64.0
+     92.5000     48.7500 -64.0
+     94.5000     48.7500 -64.0
+     97.5000     52.7500 -64.0
+     97.7500     50.5000 -64.0
+     96.7500     48.5000 -64.0
+     96.7500     44.5000 -64.0
+     97.7500     41.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500     41.5000 -64.0
+    120.2500     48.5000 -64.0
+    119.2500     53.5000 -64.0
+    121.5000     52.7500 -64.0
+    121.7500     51.5000 -64.0
+    123.5000     49.7500 -64.0
+    127.5000     49.7500 -64.0
+    131.2500     51.5000 -64.0
+    133.2500     55.5000 -64.0
+    133.2500     63.5000 -64.0
+    135.5000     63.7500 -64.0
+    135.7500     58.5000 -64.0
+    136.5000     56.7500 -64.0
+    143.5000     56.7500 -64.0
+    146.2500     60.5000 -64.0
+    145.2500     63.5000 -64.0
+    148.2500     65.5000 -64.0
+    148.2500     70.5000 -64.0
+    151.5000     67.7500 -64.0
+    153.5000     67.7500 -64.0
+    157.2500     69.5000 -64.0
+    161.2500     76.5000 -64.0
+    161.2500     78.5000 -64.0
+    166.5000     84.7500 -64.0
+    166.7500     81.5000 -64.0
+    164.7500     77.5000 -64.0
+    164.7500     75.5000 -64.0
+    160.7500     67.5000 -64.0
+    158.7500     61.5000 -64.0
+    153.5000     56.2500 -64.0
+    145.5000     52.2500 -64.0
+    128.5000     49.2500 -64.0
+    122.7500     46.5000 -64.0
+} -64.0
+{ -64.0
+    141.2500     63.5000 -64.0
+    140.5000     64.2500 -64.0
+    140.2500     66.5000 -64.0
+    141.7500     66.5000 -64.0
+    142.7500     64.5000 -64.0
+} -64.0
+{ -64.0
+    147.2500     71.5000 -64.0
+    143.2500     74.5000 -64.0
+    145.5000     74.7500 -64.0
+    147.7500     72.5000 -64.0
+} -64.0
+{ -64.0
+    119.2500     86.5000 -64.0
+    118.2500     90.5000 -64.0
+    119.5000     89.7500 -64.0
+    122.5000     89.7500 -64.0
+} -64.0
+{ -64.0
+     87.2500     87.5000 -64.0
+     89.2500     88.5000 -64.0
+     89.7500     87.5000 -64.0
+} -64.0
+{ -64.0
+     60.2500     91.5000 -64.0
+     56.2500     94.5000 -64.0
+     55.2500     96.5000 -64.0
+     52.5000     98.2500 -64.0
+     35.5000    130.2500 -64.0
+     35.2500    133.5000 -64.0
+     32.2500    139.5000 -64.0
+     29.5000    150.2500 -64.0
+     29.2500    154.5000 -64.0
+     31.2500    160.5000 -64.0
+     31.2500    165.5000 -64.0
+     32.2500    167.5000 -64.0
+     32.2500    170.5000 -64.0
+     36.2500    187.5000 -64.0
+     45.2500    203.5000 -64.0
+     60.2500    220.5000 -64.0
+     64.5000    223.7500 -64.0
+     73.5000    228.7500 -64.0
+     87.2500    231.5000 -64.0
+    104.5000    231.7500 -64.0
+    106.5000    230.7500 -64.0
+    118.5000    230.7500 -64.0
+    131.7500    226.5000 -64.0
+    140.5000    220.7500 -64.0
+    150.7500    210.5000 -64.0
+    159.7500    199.5000 -64.0
+    168.7500    183.5000 -64.0
+    177.5000    159.7500 -64.0
+    177.7500    149.5000 -64.0
+    176.7500    147.5000 -64.0
+    175.7500    141.5000 -64.0
+    172.7500    135.5000 -64.0
+    172.7500    133.5000 -64.0
+    170.7500    129.5000 -64.0
+    169.7500    124.5000 -64.0
+    165.5000    117.2500 -64.0
+    159.7500    103.5000 -64.0
+    153.7500     97.5000 -64.0
+    150.5000     97.2500 -64.0
+    148.5000     98.2500 -64.0
+    134.7500     95.5000 -64.0
+    133.5000     96.2500 -64.0
+    134.2500     97.5000 -64.0
+    140.5000     97.7500 -64.0
+    141.5000     99.7500 -64.0
+    145.2500    102.5000 -64.0
+    147.5000    102.7500 -64.0
+    150.2500    106.5000 -64.0
+    150.5000    108.7500 -64.0
+    156.5000    111.7500 -64.0
+    162.2500    117.5000 -64.0
+    169.2500    130.5000 -64.0
+    169.2500    132.5000 -64.0
+    171.2500    138.5000 -64.0
+    170.5000    140.2500 -64.0
+    171.2500    142.5000 -64.0
+    170.5000    144.2500 -64.0
+    170.2500    152.5000 -64.0
+    171.2500    154.5000 -64.0
+    171.2500    162.5000 -64.0
+    170.2500    169.5000 -64.0
+    165.5000    176.2500 -64.0
+    164.2500    180.5000 -64.0
+    161.2500    183.5000 -64.0
+    157.2500    191.5000 -64.0
+    148.2500    205.5000 -64.0
+    132.5000    216.2500 -64.0
+    120.5000    222.2500 -64.0
+    115.5000    222.2500 -64.0
+    101.5000    219.2500 -64.0
+     95.5000    223.2500 -64.0
+     91.5000    223.2500 -64.0
+     89.5000    224.2500 -64.0
+     84.5000    223.2500 -64.0
+     66.5000    215.2500 -64.0
+     51.7500    201.5000 -64.0
+     47.7500    194.5000 -64.0
+     47.7500    192.5000 -64.0
+     44.7500    188.5000 -64.0
+     38.7500    176.5000 -64.0
+     38.7500    174.5000 -64.0
+     36.7500    170.5000 -64.0
+     36.7500    168.5000 -64.0
+     35.7500    166.5000 -64.0
+     35.7500    159.5000 -64.0
+     34.7500    157.5000 -64.0
+     34.7500    151.5000 -64.0
+     35.5000    149.7500 -64.0
+     36.7500    132.5000 -64.0
+     40.5000    128.7500 -64.0
+     40.7500    124.5000 -64.0
+     43.7500    117.5000 -64.0
+     48.5000    112.7500 -64.0
+     50.5000    112.7500 -64.0
+     50.7500    110.5000 -64.0
+     49.7500    108.5000 -64.0
+     50.7500    105.5000 -64.0
+     58.5000     96.7500 -64.0
+     62.2500     97.5000 -64.0
+     74.5000     97.7500 -64.0
+     76.2500    100.5000 -64.0
+     77.5000     99.7500 -64.0
+     82.5000     99.7500 -64.0
+     83.7500     98.5000 -64.0
+     82.7500     96.5000 -64.0
+     82.7500     94.5000 -64.0
+     84.5000     92.7500 -64.0
+     87.7500     92.5000 -64.0
+     83.5000     91.2500 -64.0
+     79.5000     96.2500 -64.0
+     72.5000     94.2500 -64.0
+     70.5000     95.2500 -64.0
+     64.5000     92.2500 -64.0
+} -64.0
+{ -64.0
+    120.2500     94.5000 -64.0
+    121.2500     95.5000 -64.0
+    122.5000     94.7500 -64.0
+    124.2500     95.5000 -64.0
+    124.2500     97.5000 -64.0
+    130.7500     96.5000 -64.0
+    126.5000     96.2500 -64.0
+    125.7500     94.5000 -64.0
+} -64.0
+{ -64.0
+    121.2500     99.5000 -64.0
+    120.5000    100.2500 -64.0
+    119.2500    104.5000 -64.0
+    117.5000    105.2500 -64.0
+    119.2500    107.5000 -64.0
+    119.2500    109.5000 -64.0
+    119.7500    108.5000 -64.0
+    121.5000    104.7500 -64.0
+    121.7500    100.5000 -64.0
+} -64.0
+{ -64.0
+     87.2500    100.5000 -64.0
+     88.2500    102.5000 -64.0
+     88.7500    101.5000 -64.0
+} -64.0
+{ -64.0
+     88.2500    120.5000 -64.0
+     88.2500    121.5000 -64.0
+     89.5000    121.7500 -64.0
+     90.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+    118.2500    122.5000 -64.0
+    119.2500    124.5000 -64.0
+    122.5000    127.7500 -64.0
+    128.5000    130.7500 -64.0
+    131.2500    136.5000 -64.0
+    133.2500    137.5000 -64.0
+    136.5000    136.7500 -64.0
+    148.5000    142.7500 -64.0
+    153.7500    140.5000 -64.0
+    154.7500    138.5000 -64.0
+    153.7500    136.5000 -64.0
+    153.7500    130.5000 -64.0
+    152.7500    128.5000 -64.0
+    151.5000    129.2500 -64.0
+    151.2500    133.5000 -64.0
+    152.2500    135.5000 -64.0
+    151.5000    137.2500 -64.0
+    149.5000    137.2500 -64.0
+    147.5000    139.2500 -64.0
+    146.7500    138.5000 -64.0
+    146.7500    133.5000 -64.0
+    145.7500    131.5000 -64.0
+    145.7500    127.5000 -64.0
+    142.5000    129.2500 -64.0
+    139.5000    125.2500 -64.0
+    137.5000    124.2500 -64.0
+    132.5000    123.2500 -64.0
+    130.5000    124.2500 -64.0
+    125.5000    124.2500 -64.0
+    126.2500    126.5000 -64.0
+    124.5000    127.2500 -64.0
+    120.7500    124.5000 -64.0
+    119.7500    122.5000 -64.0
+} -64.0
+{ -64.0
+    134.7500     53.5000 -64.0
+    135.5000     52.7500 -64.0
+    137.2500     53.5000 -64.0
+    136.5000     54.2500 -64.0
+} -64.0
+{ -64.0
+    148.7500     58.5000 -64.0
+    150.5000     57.7500 -64.0
+    154.2500     60.5000 -64.0
+    157.2500     65.5000 -64.0
+    156.5000     66.2500 -64.0
+    153.5000     66.2500 -64.0
+    151.7500     62.5000 -64.0
+    150.5000     62.2500 -64.0
+} -64.0
+{ -64.0
+     62.7500     63.5000 -64.0
+     64.5000     62.7500 -64.0
+     65.2500     64.5000 -64.0
+     63.5000     65.2500 -64.0
+} -64.0
+{ -64.0
+    151.7500     99.5000 -64.0
+    152.5000     98.7500 -64.0
+    154.2500    101.5000 -64.0
+    155.2500    103.5000 -64.0
+    153.5000    105.2500 -64.0
+    150.7500    101.5000 -64.0
+} -64.0
+{ -64.0
+    154.7500    105.5000 -64.0
+    156.5000    104.7500 -64.0
+    158.2500    105.5000 -64.0
+    157.2500    107.5000 -64.0
+    155.5000    108.2500 -64.0
+    153.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+    133.7500    126.5000 -64.0
+    135.5000    125.7500 -64.0
+    136.2500    127.5000 -64.0
+    134.5000    128.2500 -64.0
+} -64.0
+{ -64.0
+    132.7500    130.5000 -64.0
+    134.5000    129.7500 -64.0
+    136.2500    131.5000 -64.0
+    135.5000    132.2500 -64.0
+    133.5000    132.2500 -64.0
+} -64.0
+{ -64.0
+    139.7500    131.5000 -64.0
+    140.5000    130.7500 -64.0
+    142.2500    131.5000 -64.0
+    140.5000    133.2500 -64.0
+} -64.0
+{ -64.0
+    171.7500    148.5000 -64.0
+    172.5000    147.7500 -64.0
+    174.2500    148.5000 -64.0
+    175.2500    150.5000 -64.0
+    173.5000    151.2500 -64.0
+    171.7500    150.5000 -64.0
+} -64.0
+{ -64.0
+     99.7500    225.5000 -64.0
+    100.5000    224.7500 -64.0
+    101.2500    225.5000 -64.0
+    100.5000    226.2500 -64.0
+} -64.0
+v 387 z -112.000000 -64.0
+{ -64.0
+     97.2500     40.5000 -64.0
+     95.2500     44.5000 -64.0
+     89.5000     48.2500 -64.0
+     85.5000     48.2500 -64.0
+     83.5000     49.2500 -64.0
+     81.5000     49.2500 -64.0
+     79.5000     48.2500 -64.0
+     77.5000     49.2500 -64.0
+     72.5000     49.2500 -64.0
+     68.5000     51.2500 -64.0
+     66.5000     51.2500 -64.0
+     59.5000     57.2500 -64.0
+     49.5000     75.2500 -64.0
+     49.2500     77.5000 -64.0
+     51.5000     76.7500 -64.0
+     51.7500     75.5000 -64.0
+     59.5000     65.7500 -64.0
+     62.5000     65.7500 -64.0
+     65.5000     66.7500 -64.0
+     68.2500     70.5000 -64.0
+     71.5000     70.7500 -64.0
+     70.7500     69.5000 -64.0
+     72.5000     67.7500 -64.0
+     72.5000     65.2500 -64.0
+     70.5000     68.2500 -64.0
+     68.7500     67.5000 -64.0
+     67.7500     65.5000 -64.0
+     69.5000     64.7500 -64.0
+     69.7500     61.5000 -64.0
+     73.7500     57.5000 -64.0
+     75.7500     53.5000 -64.0
+     78.5000     50.7500 -64.0
+     80.5000     50.7500 -64.0
+     82.5000     51.7500 -64.0
+     86.5000     49.7500 -64.0
+     90.5000     49.7500 -64.0
+     92.5000     48.7500 -64.0
+     94.5000     48.7500 -64.0
+     97.5000     52.7500 -64.0
+     97.7500     50.5000 -64.0
+     95.7500     45.5000 -64.0
+     97.7500     41.5000 -64.0
+} -64.0
+{ -64.0
+    121.2500     43.5000 -64.0
+    121.2500     48.5000 -64.0
+    118.5000     52.2500 -64.0
+    118.2500     56.5000 -64.0
+    119.5000     54.7500 -64.0
+    121.5000     53.7500 -64.0
+    121.7500     50.5000 -64.0
+    125.5000     48.7500 -64.0
+    122.7500     46.5000 -64.0
+} -64.0
+{ -64.0
+    130.2500     51.5000 -64.0
+    133.2500     55.5000 -64.0
+    134.5000     55.7500 -64.0
+    135.5000     53.7500 -64.0
+    138.2500     55.5000 -64.0
+    138.7500     54.5000 -64.0
+    140.5000     53.7500 -64.0
+    141.2500     55.5000 -64.0
+    139.2500     56.5000 -64.0
+    140.2500     58.5000 -64.0
+    142.5000     57.7500 -64.0
+    146.5000     59.7500 -64.0
+    149.2500     63.5000 -64.0
+    149.2500     68.5000 -64.0
+    153.5000     66.7500 -64.0
+    157.2500     69.5000 -64.0
+    169.5000     91.7500 -64.0
+    169.7500     86.5000 -64.0
+    167.7500     82.5000 -64.0
+    167.7500     80.5000 -64.0
+    160.7500     66.5000 -64.0
+    155.7500     58.5000 -64.0
+    151.5000     55.2500 -64.0
+    145.7500     52.5000 -64.0
+    141.5000     52.2500 -64.0
+    139.7500     51.5000 -64.0
+} -64.0
+{ -64.0
+    107.2500     58.5000 -64.0
+    107.2500     60.5000 -64.0
+    107.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+    118.2500     59.5000 -64.0
+    118.2500     64.5000 -64.0
+    119.5000     64.7500 -64.0
+    119.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+    134.2500     62.5000 -64.0
+    135.5000     63.7500 -64.0
+    138.7500     62.5000 -64.0
+} -64.0
+{ -64.0
+    106.2500     82.5000 -64.0
+    105.2500     84.5000 -64.0
+    105.7500     85.5000 -64.0
+    106.7500     83.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500     84.5000 -64.0
+     92.2500     85.5000 -64.0
+     93.7500     84.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500     86.5000 -64.0
+     89.2500     87.5000 -64.0
+     91.5000     87.7500 -64.0
+} -64.0
+{ -64.0
+    118.2500     86.5000 -64.0
+    118.2500     87.5000 -64.0
+    119.2500     89.5000 -64.0
+    120.7500     89.5000 -64.0
+    119.7500     86.5000 -64.0
+} -64.0
+{ -64.0
+     93.2500     87.5000 -64.0
+     93.2500     88.5000 -64.0
+     94.5000     88.7500 -64.0
+     94.7500     87.5000 -64.0
+} -64.0
+{ -64.0
+     83.2500     90.5000 -64.0
+     83.2500     91.5000 -64.0
+     85.5000     91.7500 -64.0
+     84.7500     90.5000 -64.0
+} -64.0
+{ -64.0
+     60.2500     92.5000 -64.0
+     59.5000     93.2500 -64.0
+     57.5000     94.2500 -64.0
+     52.5000     99.2500 -64.0
+     49.2500    104.5000 -64.0
+     42.2500    118.5000 -64.0
+     37.5000    127.2500 -64.0
+     35.2500    133.5000 -64.0
+     34.5000    135.2500 -64.0
+     31.2500    144.5000 -64.0
+     30.5000    146.2500 -64.0
+     30.2500    156.5000 -64.0
+     31.2500    158.5000 -64.0
+     31.2500    162.5000 -64.0
+     32.2500    164.5000 -64.0
+     32.2500    167.5000 -64.0
+     33.2500    169.5000 -64.0
+     33.2500    172.5000 -64.0
+     34.2500    174.5000 -64.0
+     34.2500    176.5000 -64.0
+     35.2500    178.5000 -64.0
+     35.2500    181.5000 -64.0
+     36.2500    183.5000 -64.0
+     36.2500    185.5000 -64.0
+     42.2500    197.5000 -64.0
+     48.2500    205.5000 -64.0
+     57.2500    216.5000 -64.0
+     58.2500    218.5000 -64.0
+     59.5000    218.7500 -64.0
+     61.2500    220.5000 -64.0
+     65.5000    223.7500 -64.0
+     74.5000    228.7500 -64.0
+     81.5000    229.7500 -64.0
+     83.2500    230.5000 -64.0
+    107.5000    230.7500 -64.0
+    109.5000    229.7500 -64.0
+    120.5000    229.7500 -64.0
+    122.5000    228.7500 -64.0
+    124.5000    228.7500 -64.0
+    135.5000    223.7500 -64.0
+    141.5000    218.7500 -64.0
+    143.5000    217.7500 -64.0
+    147.5000    212.7500 -64.0
+    153.7500    205.5000 -64.0
+    162.7500    193.5000 -64.0
+    163.7500    191.5000 -64.0
+    166.5000    187.7500 -64.0
+    169.7500    179.5000 -64.0
+    170.5000    177.7500 -64.0
+    174.7500    165.5000 -64.0
+    176.5000    161.7500 -64.0
+    176.7500    159.5000 -64.0
+    177.5000    157.7500 -64.0
+    177.7500    149.5000 -64.0
+    176.7500    147.5000 -64.0
+    176.7500    145.5000 -64.0
+    173.7500    139.5000 -64.0
+    169.7500    127.5000 -64.0
+    157.7500    101.5000 -64.0
+    154.7500     98.5000 -64.0
+    151.5000     98.2500 -64.0
+    147.5000    100.2500 -64.0
+    142.5000    100.2500 -64.0
+    137.5000     99.2500 -64.0
+    133.7500     97.5000 -64.0
+    131.5000     99.2500 -64.0
+    130.7500     98.5000 -64.0
+    123.5000     98.2500 -64.0
+    121.5000    100.2500 -64.0
+    121.2500    102.5000 -64.0
+    119.5000    104.2500 -64.0
+    117.5000    104.2500 -64.0
+    115.5000    105.2500 -64.0
+    116.5000    105.7500 -64.0
+    118.2500    106.5000 -64.0
+    119.2500    108.5000 -64.0
+    120.5000    108.7500 -64.0
+    122.5000    106.7500 -64.0
+    122.7500    102.5000 -64.0
+    127.5000     99.7500 -64.0
+    130.5000     99.7500 -64.0
+    133.5000    102.7500 -64.0
+    137.5000    104.7500 -64.0
+    141.2500    106.5000 -64.0
+    144.5000    106.7500 -64.0
+    146.5000    104.7500 -64.0
+    147.2500    105.5000 -64.0
+    148.2500    107.5000 -64.0
+    155.5000    113.7500 -64.0
+    157.5000    114.7500 -64.0
+    164.2500    122.5000 -64.0
+    167.2500    127.5000 -64.0
+    167.2500    129.5000 -64.0
+    168.2500    131.5000 -64.0
+    168.2500    133.5000 -64.0
+    169.2500    135.5000 -64.0
+    169.2500    141.5000 -64.0
+    168.2500    150.5000 -64.0
+    170.2500    154.5000 -64.0
+    170.2500    160.5000 -64.0
+    169.2500    167.5000 -64.0
+    162.2500    181.5000 -64.0
+    161.5000    183.2500 -64.0
+    154.2500    194.5000 -64.0
+    151.2500    200.5000 -64.0
+    144.5000    207.2500 -64.0
+    142.2500    208.5000 -64.0
+    135.5000    213.2500 -64.0
+    131.5000    216.2500 -64.0
+    119.5000    222.2500 -64.0
+    115.5000    222.2500 -64.0
+    113.5000    221.2500 -64.0
+    106.5000    220.2500 -64.0
+    101.5000    218.2500 -64.0
+     97.5000    222.2500 -64.0
+     95.5000    222.2500 -64.0
+     93.5000    223.2500 -64.0
+     88.5000    223.2500 -64.0
+     81.5000    222.2500 -64.0
+     75.5000    219.2500 -64.0
+     66.5000    214.2500 -64.0
+     64.5000    213.2500 -64.0
+     51.7500    200.5000 -64.0
+     48.7500    195.5000 -64.0
+     48.7500    193.5000 -64.0
+     43.7500    185.5000 -64.0
+     39.7500    177.5000 -64.0
+     39.7500    175.5000 -64.0
+     37.7500    171.5000 -64.0
+     37.7500    169.5000 -64.0
+     36.7500    167.5000 -64.0
+     36.7500    161.5000 -64.0
+     37.7500    159.5000 -64.0
+     35.7500    155.5000 -64.0
+     35.7500    145.5000 -64.0
+     36.5000    143.7500 -64.0
+     36.7500    136.5000 -64.0
+     40.7500    128.5000 -64.0
+     41.7500    123.5000 -64.0
+     43.7500    118.5000 -64.0
+     48.5000    113.7500 -64.0
+     50.5000    112.7500 -64.0
+     52.7500    110.5000 -64.0
+     51.7500    108.5000 -64.0
+     51.7500    106.5000 -64.0
+     50.7500    104.5000 -64.0
+     52.5000    102.7500 -64.0
+     54.5000    102.7500 -64.0
+     60.5000     97.7500 -64.0
+     64.2500     99.5000 -64.0
+     72.5000     99.7500 -64.0
+     76.5000    101.7500 -64.0
+     78.2500    102.5000 -64.0
+     82.5000    102.7500 -64.0
+     85.5000    101.7500 -64.0
+     88.2500    105.5000 -64.0
+     88.7500    104.5000 -64.0
+     86.7500    100.5000 -64.0
+     82.5000     99.2500 -64.0
+     80.5000    100.2500 -64.0
+     78.5000    100.2500 -64.0
+     73.7500     96.5000 -64.0
+     67.5000     96.2500 -64.0
+     66.7500     94.5000 -64.0
+     63.5000     93.2500 -64.0
+     61.7500     92.5000 -64.0
+} -64.0
+{ -64.0
+     89.2500    119.5000 -64.0
+     88.5000    121.2500 -64.0
+     86.5000    121.2500 -64.0
+     82.5000    123.2500 -64.0
+     80.5000    122.2500 -64.0
+     79.2500    126.5000 -64.0
+     81.5000    126.7500 -64.0
+     88.7500    123.5000 -64.0
+     90.7500    119.5000 -64.0
+} -64.0
+{ -64.0
+    131.2500    122.5000 -64.0
+    127.5000    125.2500 -64.0
+    126.5000    128.2500 -64.0
+    121.5000    126.2500 -64.0
+    121.2500    127.5000 -64.0
+    124.2500    130.5000 -64.0
+    129.5000    130.7500 -64.0
+    131.5000    129.7500 -64.0
+    136.5000    129.7500 -64.0
+    138.2500    130.5000 -64.0
+    137.5000    132.2500 -64.0
+    133.5000    134.2500 -64.0
+    131.5000    134.2500 -64.0
+    131.2500    137.5000 -64.0
+    134.2500    139.5000 -64.0
+    141.5000    139.7500 -64.0
+    149.2500    144.5000 -64.0
+    153.5000    144.7500 -64.0
+    153.7500    143.5000 -64.0
+    155.5000    142.7500 -64.0
+    156.7500    139.5000 -64.0
+    155.7500    137.5000 -64.0
+    153.5000    137.2500 -64.0
+    153.2500    138.5000 -64.0
+    151.5000    139.2500 -64.0
+    153.2500    142.5000 -64.0
+    152.5000    144.2500 -64.0
+    149.7500    140.5000 -64.0
+    146.7500    138.5000 -64.0
+    146.7500    132.5000 -64.0
+    142.7500    128.5000 -64.0
+    140.7500    124.5000 -64.0
+    140.7500    122.5000 -64.0
+} -64.0
+{ -64.0
+    150.2500    123.5000 -64.0
+    150.2500    124.5000 -64.0
+    151.5000    124.7500 -64.0
+    153.2500    126.5000 -64.0
+    153.5000    130.7500 -64.0
+    155.5000    129.7500 -64.0
+    153.7500    128.5000 -64.0
+    154.5000    126.7500 -64.0
+    154.7500    124.5000 -64.0
+    152.7500    123.5000 -64.0
+} -64.0
+{ -64.0
+     67.7500     54.5000 -64.0
+     68.5000     53.7500 -64.0
+     70.5000     53.7500 -64.0
+     72.2500     54.5000 -64.0
+     68.5000     58.2500 -64.0
+     68.2500     60.5000 -64.0
+     66.5000     61.2500 -64.0
+     66.2500     62.5000 -64.0
+     65.5000     64.2500 -64.0
+     62.5000     64.2500 -64.0
+     60.7500     62.5000 -64.0
+     63.5000     60.7500 -64.0
+     63.7500     57.5000 -64.0
+     65.5000     55.7500 -64.0
+} -64.0
+{ -64.0
+    144.7500     56.5000 -64.0
+    145.5000     55.7500 -64.0
+    150.5000     57.7500 -64.0
+    154.2500     60.5000 -64.0
+    157.2500     65.5000 -64.0
+    156.5000     67.2500 -64.0
+    154.5000     66.2500 -64.0
+    153.7500     64.5000 -64.0
+    150.7500     62.5000 -64.0
+    149.7500     60.5000 -64.0
+    145.7500     58.5000 -64.0
+} -64.0
+{ -64.0
+    132.7500     99.5000 -64.0
+    133.5000     98.7500 -64.0
+    135.2500     99.5000 -64.0
+    134.5000    100.2500 -64.0
+} -64.0
+{ -64.0
+    150.7500    101.5000 -64.0
+    152.5000    100.7500 -64.0
+    153.2500    102.5000 -64.0
+    151.5000    103.2500 -64.0
+} -64.0
+{ -64.0
+    156.7500    109.5000 -64.0
+    157.5000    108.7500 -64.0
+    158.2500    109.5000 -64.0
+    157.5000    110.2500 -64.0
+} -64.0
+{ -64.0
+    132.7500    124.5000 -64.0
+    134.5000    123.7500 -64.0
+    136.2500    124.5000 -64.0
+    134.5000    126.2500 -64.0
+    135.2500    127.5000 -64.0
+    134.5000    128.2500 -64.0
+    132.5000    128.2500 -64.0
+    131.7500    126.5000 -64.0
+} -64.0
+{ -64.0
+    170.7500    144.5000 -64.0
+    171.5000    143.7500 -64.0
+    173.2500    144.5000 -64.0
+    173.2500    146.5000 -64.0
+    174.2500    148.5000 -64.0
+    174.2500    150.5000 -64.0
+    172.5000    151.2500 -64.0
+    170.7500    150.5000 -64.0
+    170.7500    148.5000 -64.0
+    169.7500    146.5000 -64.0
+} -64.0
+{ -64.0
+    172.7500    153.5000 -64.0
+    173.5000    152.7500 -64.0
+    174.2500    153.5000 -64.0
+    173.5000    154.2500 -64.0
+} -64.0
+v 392 z -114.000000 -64.0
+{ -64.0
+     95.2500     43.5000 -64.0
+     94.5000     45.2500 -64.0
+     88.5000     48.2500 -64.0
+     91.2500     50.5000 -64.0
+     92.5000     49.7500 -64.0
+     96.2500     50.5000 -64.0
+     97.2500     52.5000 -64.0
+     98.7500     52.5000 -64.0
+     95.7500     46.5000 -64.0
+} -64.0
+{ -64.0
+    121.2500     44.5000 -64.0
+    121.2500     47.5000 -64.0
+    118.5000     53.2500 -64.0
+    118.2500     55.5000 -64.0
+    121.5000     53.7500 -64.0
+    120.7500     51.5000 -64.0
+    122.5000     49.7500 -64.0
+    125.5000     49.7500 -64.0
+} -64.0
+{ -64.0
+     78.2500     49.5000 -64.0
+     77.5000     50.2500 -64.0
+     71.5000     50.2500 -64.0
+     65.5000     52.2500 -64.0
+     61.5000     55.2500 -64.0
+     55.2500     63.5000 -64.0
+     46.5000     79.2500 -64.0
+     46.5000     82.7500 -64.0
+     53.5000     73.7500 -64.0
+     57.5000     67.7500 -64.0
+     61.5000     64.7500 -64.0
+     63.5000     64.7500 -64.0
+     67.2500     67.5000 -64.0
+     68.2500     69.5000 -64.0
+     70.2500     70.5000 -64.0
+     70.7500     69.5000 -64.0
+     67.7500     66.5000 -64.0
+     67.7500     60.5000 -64.0
+     64.5000     60.2500 -64.0
+     64.2500     62.5000 -64.0
+     62.5000     63.2500 -64.0
+     60.5000     64.2500 -64.0
+     58.7500     63.5000 -64.0
+     64.5000     56.7500 -64.0
+     68.5000     53.7500 -64.0
+     70.5000     53.7500 -64.0
+     71.2500     55.5000 -64.0
+     72.5000     55.7500 -64.0
+     72.7500     54.5000 -64.0
+     75.5000     51.7500 -64.0
+     77.5000     51.7500 -64.0
+     79.5000     50.7500 -64.0
+     83.5000     50.7500 -64.0
+     84.7500     49.5000 -64.0
+} -64.0
+{ -64.0
+    137.2500     52.5000 -64.0
+    136.2500     54.5000 -64.0
+    142.5000     55.7500 -64.0
+    148.5000     59.7500 -64.0
+    147.7500     58.5000 -64.0
+    148.5000     57.7500 -64.0
+    151.5000     58.7500 -64.0
+    157.2500     65.5000 -64.0
+    155.5000     66.2500 -64.0
+    151.7500     63.5000 -64.0
+    150.7500     61.5000 -64.0
+    149.2500     60.5000 -64.0
+    150.2500     62.5000 -64.0
+    149.5000     67.7500 -64.0
+    151.5000     66.7500 -64.0
+    154.5000     66.7500 -64.0
+    158.2500     70.5000 -64.0
+    164.2500     82.5000 -64.0
+    167.2500     85.5000 -64.0
+    167.2500     88.5000 -64.0
+    169.2500     92.5000 -64.0
+    169.2500     98.5000 -64.0
+    170.5000     98.7500 -64.0
+    170.7500     89.5000 -64.0
+    169.7500     87.5000 -64.0
+    169.7500     85.5000 -64.0
+    167.7500     81.5000 -64.0
+    167.7500     79.5000 -64.0
+    165.5000     76.2500 -64.0
+    160.7500     65.5000 -64.0
+    155.7500     58.5000 -64.0
+    150.5000     55.2500 -64.0
+} -64.0
+{ -64.0
+    107.2500     57.5000 -64.0
+    107.2500     65.5000 -64.0
+    108.7500     62.5000 -64.0
+} -64.0
+{ -64.0
+     70.2500     58.5000 -64.0
+     70.2500     59.5000 -64.0
+     71.5000     59.7500 -64.0
+} -64.0
+{ -64.0
+     93.2500     84.5000 -64.0
+     91.2500     87.5000 -64.0
+     94.5000     87.7500 -64.0
+     94.7500     84.5000 -64.0
+} -64.0
+{ -64.0
+     72.2500     85.5000 -64.0
+     72.2500     86.5000 -64.0
+     73.5000     86.7500 -64.0
+     73.7500     85.5000 -64.0
+} -64.0
+{ -64.0
+    119.2500     87.5000 -64.0
+    118.5000     88.2500 -64.0
+    118.5000     90.7500 -64.0
+    120.5000     89.7500 -64.0
+} -64.0
+{ -64.0
+     81.2500     89.5000 -64.0
+     82.2500     90.5000 -64.0
+     85.5000     90.7500 -64.0
+     83.7500     89.5000 -64.0
+} -64.0
+{ -64.0
+     59.2500     94.5000 -64.0
+     57.5000     95.2500 -64.0
+     52.5000    100.2500 -64.0
+     48.5000    107.2500 -64.0
+     48.2500    109.5000 -64.0
+     39.2500    124.5000 -64.0
+     33.2500    139.5000 -64.0
+     30.5000    147.2500 -64.0
+     30.2500    155.5000 -64.0
+     32.2500    161.5000 -64.0
+     33.2500    169.5000 -64.0
+     35.2500    176.5000 -64.0
+     36.2500    183.5000 -64.0
+     39.2500    189.5000 -64.0
+     39.2500    191.5000 -64.0
+     59.2500    218.5000 -64.0
+     60.5000    218.7500 -64.0
+     66.5000    223.7500 -64.0
+     74.5000    227.7500 -64.0
+     81.2500    229.5000 -64.0
+    115.5000    229.7500 -64.0
+    117.5000    228.7500 -64.0
+    121.5000    228.7500 -64.0
+    123.5000    227.7500 -64.0
+    125.5000    227.7500 -64.0
+    133.5000    223.7500 -64.0
+    141.5000    218.7500 -64.0
+    155.7500    201.5000 -64.0
+    157.7500    197.5000 -64.0
+    159.5000    196.7500 -64.0
+    163.7500    190.5000 -64.0
+    169.7500    179.5000 -64.0
+    173.7500    165.5000 -64.0
+    176.7500    159.5000 -64.0
+    177.7500    150.5000 -64.0
+    176.7500    148.5000 -64.0
+    176.7500    146.5000 -64.0
+    170.7500    132.5000 -64.0
+    166.7500    120.5000 -64.0
+    158.7500    103.5000 -64.0
+    155.5000    100.2500 -64.0
+    153.5000     99.2500 -64.0
+    147.5000    102.2500 -64.0
+    135.2500    101.5000 -64.0
+    136.2500    103.5000 -64.0
+    135.5000    104.2500 -64.0
+    130.7500    101.5000 -64.0
+    127.5000    101.2500 -64.0
+    124.5000    102.2500 -64.0
+    120.5000    106.2500 -64.0
+    119.7500    105.5000 -64.0
+    114.5000    105.2500 -64.0
+    114.2500    106.5000 -64.0
+    115.5000    105.7500 -64.0
+    118.5000    106.7500 -64.0
+    121.5000    109.7500 -64.0
+    123.5000    110.7500 -64.0
+    124.7500    106.5000 -64.0
+    127.5000    104.7500 -64.0
+    137.5000    105.7500 -64.0
+    141.2500    108.5000 -64.0
+    143.5000    108.7500 -64.0
+    149.2500    111.5000 -64.0
+    149.2500    113.5000 -64.0
+    144.5000    118.2500 -64.0
+    144.2500    120.5000 -64.0
+    149.2500    125.5000 -64.0
+    151.5000    125.7500 -64.0
+    154.5000    124.7500 -64.0
+    154.7500    123.5000 -64.0
+    156.5000    122.7500 -64.0
+    158.2500    123.5000 -64.0
+    157.5000    124.2500 -64.0
+    157.2500    126.5000 -64.0
+    153.5000    129.2500 -64.0
+    153.2500    131.5000 -64.0
+    156.2500    133.5000 -64.0
+    156.2500    135.5000 -64.0
+    159.5000    132.7500 -64.0
+    157.7500    128.5000 -64.0
+    159.5000    126.7500 -64.0
+    158.7500    125.5000 -64.0
+    159.5000    121.7500 -64.0
+    161.2500    123.5000 -64.0
+    161.2500    125.5000 -64.0
+    163.5000    125.7500 -64.0
+    167.2500    132.5000 -64.0
+    167.2500    135.5000 -64.0
+    170.2500    137.5000 -64.0
+    167.5000    140.2500 -64.0
+    167.2500    145.5000 -64.0
+    165.5000    147.2500 -64.0
+    165.2500    149.5000 -64.0
+    169.2500    155.5000 -64.0
+    169.2500    162.5000 -64.0
+    167.2500    170.5000 -64.0
+    162.2500    178.5000 -64.0
+    161.2500    183.5000 -64.0
+    158.5000    186.2500 -64.0
+    148.2500    202.5000 -64.0
+    135.5000    213.2500 -64.0
+    129.2500    216.5000 -64.0
+    122.5000    221.2500 -64.0
+    119.5000    221.2500 -64.0
+    117.5000    222.2500 -64.0
+    112.5000    221.2500 -64.0
+    108.7500    219.5000 -64.0
+    105.5000    219.2500 -64.0
+    101.5000    217.2500 -64.0
+    101.2500    218.5000 -64.0
+     96.5000    222.2500 -64.0
+     83.5000    222.2500 -64.0
+     78.5000    220.2500 -64.0
+     65.5000    213.2500 -64.0
+     51.5000    199.2500 -64.0
+     47.7500    188.5000 -64.0
+     43.7500    184.5000 -64.0
+     39.7500    176.5000 -64.0
+     39.7500    174.5000 -64.0
+     37.7500    170.5000 -64.0
+     37.7500    157.5000 -64.0
+     36.7500    155.5000 -64.0
+     36.7500    143.5000 -64.0
+     37.7500    141.5000 -64.0
+     36.7500    139.5000 -64.0
+     38.7500    135.5000 -64.0
+     42.7500    121.5000 -64.0
+     47.5000    115.7500 -64.0
+     55.5000    109.7500 -64.0
+     53.7500    106.5000 -64.0
+     52.5000    107.2500 -64.0
+     50.7500    106.5000 -64.0
+     53.5000    102.7500 -64.0
+     54.2500    103.5000 -64.0
+     54.2500    105.5000 -64.0
+     58.7500    102.5000 -64.0
+     59.7500    100.5000 -64.0
+     61.5000     99.7500 -64.0
+     63.2500    100.5000 -64.0
+     71.5000    100.7500 -64.0
+     73.2500    102.5000 -64.0
+     75.5000    102.7500 -64.0
+     74.7500    100.5000 -64.0
+     67.7500     98.5000 -64.0
+     68.5000     96.7500 -64.0
+     67.7500     95.5000 -64.0
+} -64.0
+{ -64.0
+     97.2500     94.5000 -64.0
+     96.5000     95.2500 -64.0
+     97.2500     96.5000 -64.0
+     98.7500     96.5000 -64.0
+     99.7500     94.5000 -64.0
+} -64.0
+{ -64.0
+    110.2500     95.5000 -64.0
+    111.5000     97.7500 -64.0
+    113.5000     96.7500 -64.0
+    111.7500     95.5000 -64.0
+} -64.0
+{ -64.0
+     82.2500    101.5000 -64.0
+     79.5000    103.2500 -64.0
+     76.2500    103.5000 -64.0
+     78.5000    106.7500 -64.0
+     82.5000    104.7500 -64.0
+     84.5000    104.7500 -64.0
+     88.2500    107.5000 -64.0
+     88.7500    106.5000 -64.0
+     83.7500    101.5000 -64.0
+} -64.0
+{ -64.0
+    132.2500    117.5000 -64.0
+    132.2500    118.5000 -64.0
+    133.5000    119.7500 -64.0
+    133.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+     89.2500    120.5000 -64.0
+     88.5000    122.2500 -64.0
+     83.5000    125.2500 -64.0
+     77.5000    125.2500 -64.0
+     75.7500    124.5000 -64.0
+     76.5000    123.7500 -64.0
+     75.5000    123.2500 -64.0
+     75.2500    124.5000 -64.0
+     68.2500    128.5000 -64.0
+     69.2500    130.5000 -64.0
+     77.2500    132.5000 -64.0
+     79.5000    131.7500 -64.0
+     79.7500    130.5000 -64.0
+     82.5000    127.7500 -64.0
+     88.5000    124.7500 -64.0
+     91.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+    140.2500    120.5000 -64.0
+    142.2500    121.5000 -64.0
+    142.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+    118.2500    122.5000 -64.0
+    119.2500    125.5000 -64.0
+    120.7500    125.5000 -64.0
+    119.7500    122.5000 -64.0
+} -64.0
+{ -64.0
+    133.2500    122.5000 -64.0
+    132.5000    123.2500 -64.0
+    130.5000    123.2500 -64.0
+    124.5000    128.2500 -64.0
+    122.5000    127.2500 -64.0
+    122.2500    128.5000 -64.0
+    123.5000    129.7500 -64.0
+    125.5000    130.7500 -64.0
+    127.2500    131.5000 -64.0
+    130.5000    131.7500 -64.0
+    132.2500    132.5000 -64.0
+    132.2500    137.5000 -64.0
+    133.5000    138.7500 -64.0
+    139.5000    141.7500 -64.0
+    141.2500    142.5000 -64.0
+    142.5000    141.7500 -64.0
+    144.5000    141.7500 -64.0
+    152.2500    147.5000 -64.0
+    160.5000    147.7500 -64.0
+    160.7500    145.5000 -64.0
+    157.7500    142.5000 -64.0
+    155.5000    142.2500 -64.0
+    155.2500    143.5000 -64.0
+    154.5000    145.2500 -64.0
+    153.7500    144.5000 -64.0
+    152.7500    142.5000 -64.0
+    147.7500    139.5000 -64.0
+    147.7500    135.5000 -64.0
+    148.5000    133.7500 -64.0
+    147.5000    132.2500 -64.0
+    145.5000    131.2500 -64.0
+    143.7500    130.5000 -64.0
+    141.7500    126.5000 -64.0
+    140.5000    124.2500 -64.0
+    138.5000    123.2500 -64.0
+    136.7500    122.5000 -64.0
+} -64.0
+{ -64.0
+    147.2500    127.5000 -64.0
+    148.2500    129.5000 -64.0
+    148.7500    128.5000 -64.0
+} -64.0
+{ -64.0
+     61.2500    130.5000 -64.0
+     60.2500    133.5000 -64.0
+     61.2500    135.5000 -64.0
+     64.5000    135.7500 -64.0
+     66.5000    132.7500 -64.0
+     65.7500    130.5000 -64.0
+} -64.0
+{ -64.0
+    150.7500    103.5000 -64.0
+    151.5000    102.7500 -64.0
+    153.5000    102.7500 -64.0
+    155.2500    103.5000 -64.0
+    155.2500    106.5000 -64.0
+    153.5000    108.2500 -64.0
+    151.5000    109.2500 -64.0
+    149.7500    107.5000 -64.0
+    150.5000    105.7500 -64.0
+} -64.0
+{ -64.0
+    154.7500    108.5000 -64.0
+    155.5000    107.7500 -64.0
+    157.2500    108.5000 -64.0
+    158.2500    110.5000 -64.0
+    157.5000    112.2500 -64.0
+    155.5000    112.2500 -64.0
+    153.7500    110.5000 -64.0
+} -64.0
+{ -64.0
+    131.7500    125.5000 -64.0
+    133.5000    124.7500 -64.0
+    134.2500    126.5000 -64.0
+    133.5000    128.2500 -64.0
+    131.7500    127.5000 -64.0
+} -64.0
+{ -64.0
+    136.7500    126.5000 -64.0
+    137.5000    125.7500 -64.0
+    139.2500    126.5000 -64.0
+    138.5000    128.2500 -64.0
+    138.2500    130.5000 -64.0
+    136.5000    131.2500 -64.0
+    134.7500    130.5000 -64.0
+    136.5000    128.7500 -64.0
+} -64.0
+{ -64.0
+    139.7500    130.5000 -64.0
+    141.5000    129.7500 -64.0
+    143.2500    131.5000 -64.0
+    140.5000    135.2500 -64.0
+    139.7500    134.5000 -64.0
+} -64.0
+{ -64.0
+    168.7500    140.5000 -64.0
+    169.5000    139.7500 -64.0
+    170.2500    140.5000 -64.0
+    169.5000    142.2500 -64.0
+} -64.0
+{ -64.0
+    146.7500    141.5000 -64.0
+    147.5000    140.7500 -64.0
+    150.2500    142.5000 -64.0
+    148.5000    143.2500 -64.0
+} -64.0
+{ -64.0
+    168.7500    144.5000 -64.0
+    170.5000    143.7500 -64.0
+    172.2500    144.5000 -64.0
+    174.2500    148.5000 -64.0
+    173.5000    150.2500 -64.0
+    174.2500    151.5000 -64.0
+    174.2500    154.5000 -64.0
+    172.5000    155.2500 -64.0
+    169.7500    152.5000 -64.0
+} -64.0
+v 440 z -116.000000 -64.0
+{ -64.0
+     96.2500     42.5000 -64.0
+     94.5000     45.2500 -64.0
+     90.5000     48.2500 -64.0
+     92.2500     49.5000 -64.0
+     97.5000     49.7500 -64.0
+     96.7500     48.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500     43.5000 -64.0
+    120.2500     49.5000 -64.0
+    121.2500     51.5000 -64.0
+    122.5000     49.7500 -64.0
+    125.5000     49.7500 -64.0
+    121.7500     45.5000 -64.0
+    121.7500     43.5000 -64.0
+} -64.0
+{ -64.0
+     72.2500     51.5000 -64.0
+     71.5000     52.2500 -64.0
+     66.5000     52.2500 -64.0
+     62.5000     55.2500 -64.0
+     60.5000     56.2500 -64.0
+     55.2500     62.5000 -64.0
+     44.2500     82.5000 -64.0
+     43.2500     87.5000 -64.0
+     43.7500     88.5000 -64.0
+     47.7500     80.5000 -64.0
+     52.7500     74.5000 -64.0
+     53.7500     72.5000 -64.0
+     58.5000     66.7500 -64.0
+     62.5000     63.7500 -64.0
+     65.5000     64.7500 -64.0
+     68.2500     67.5000 -64.0
+     69.2500     69.5000 -64.0
+     70.5000     69.7500 -64.0
+     68.7500     66.5000 -64.0
+     68.7500     61.5000 -64.0
+     67.5000     58.2500 -64.0
+     61.5000     63.2500 -64.0
+     59.7500     62.5000 -64.0
+     59.7500     60.5000 -64.0
+     64.5000     56.7500 -64.0
+     68.5000     54.7500 -64.0
+     70.2500     55.5000 -64.0
+     72.5000     53.7500 -64.0
+     74.5000     52.7500 -64.0
+     77.7500     53.5000 -64.0
+     78.7500     51.5000 -64.0
+} -64.0
+{ -64.0
+    137.2500     54.5000 -64.0
+    139.5000     54.7500 -64.0
+    141.5000     56.7500 -64.0
+    143.5000     55.7500 -64.0
+    145.5000     56.7500 -64.0
+    148.2500     59.5000 -64.0
+    149.5000     57.7500 -64.0
+    152.5000     59.7500 -64.0
+    157.2500     64.5000 -64.0
+    156.5000     66.2500 -64.0
+    151.5000     62.2500 -64.0
+    150.2500     66.5000 -64.0
+    156.5000     67.7500 -64.0
+    159.2500     70.5000 -64.0
+    167.2500     88.5000 -64.0
+    167.2500     90.5000 -64.0
+    168.2500     92.5000 -64.0
+    168.2500     99.5000 -64.0
+    166.5000    103.2500 -64.0
+    166.2500    108.5000 -64.0
+    164.5000    110.2500 -64.0
+    159.7500    105.5000 -64.0
+    158.7500    103.5000 -64.0
+    154.5000    100.2500 -64.0
+    145.5000    105.2500 -64.0
+    143.5000    105.2500 -64.0
+    141.5000    106.2500 -64.0
+    138.5000    105.2500 -64.0
+    133.5000    100.2500 -64.0
+    127.5000    104.2500 -64.0
+    124.5000    104.2500 -64.0
+    124.2500    107.5000 -64.0
+    122.5000    108.2500 -64.0
+    119.5000    105.2500 -64.0
+    117.5000    104.2500 -64.0
+    116.2500    107.5000 -64.0
+    121.5000    108.7500 -64.0
+    125.5000    112.7500 -64.0
+    127.5000    113.7500 -64.0
+    128.5000    111.7500 -64.0
+    126.7500    108.5000 -64.0
+    126.7500    106.5000 -64.0
+    128.5000    105.7500 -64.0
+    130.2500    106.5000 -64.0
+    133.2500    110.5000 -64.0
+    132.5000    111.2500 -64.0
+    132.2500    113.5000 -64.0
+    133.5000    113.7500 -64.0
+    136.5000    108.7500 -64.0
+    138.2500    109.5000 -64.0
+    137.2500    111.5000 -64.0
+    138.2500    113.5000 -64.0
+    138.2500    115.5000 -64.0
+    141.2500    116.5000 -64.0
+    140.5000    117.2500 -64.0
+    137.5000    117.2500 -64.0
+    135.7500    115.5000 -64.0
+    135.2500    116.5000 -64.0
+    142.2500    122.5000 -64.0
+    152.5000    125.7500 -64.0
+    156.5000    121.7500 -64.0
+    158.2500    124.5000 -64.0
+    157.5000    125.2500 -64.0
+    155.5000    124.2500 -64.0
+    154.2500    130.5000 -64.0
+    152.5000    131.2500 -64.0
+    150.7500    129.5000 -64.0
+    149.5000    132.2500 -64.0
+    143.5000    132.2500 -64.0
+    141.7500    129.5000 -64.0
+    141.7500    127.5000 -64.0
+    136.7500    122.5000 -64.0
+    134.5000    124.2500 -64.0
+    130.5000    124.2500 -64.0
+    129.5000    126.2500 -64.0
+    127.5000    127.2500 -64.0
+    125.7500    125.5000 -64.0
+    124.2500    125.5000 -64.0
+    125.2500    127.5000 -64.0
+    124.5000    128.2500 -64.0
+    120.7500    125.5000 -64.0
+    120.7500    123.5000 -64.0
+    119.5000    123.2500 -64.0
+    119.2500    125.5000 -64.0
+    122.2500    128.5000 -64.0
+    128.5000    132.7500 -64.0
+    134.2500    139.5000 -64.0
+    138.5000    140.7500 -64.0
+    142.2500    144.5000 -64.0
+    145.5000    144.7500 -64.0
+    153.2500    148.5000 -64.0
+    159.5000    148.7500 -64.0
+    162.5000    149.7500 -64.0
+    168.2500    156.5000 -64.0
+    168.2500    162.5000 -64.0
+    167.2500    167.5000 -64.0
+    164.2500    173.5000 -64.0
+    161.5000    177.2500 -64.0
+    160.2500    183.5000 -64.0
+    156.5000    187.2500 -64.0
+    150.2500    198.5000 -64.0
+    143.5000    206.2500 -64.0
+    131.5000    215.2500 -64.0
+    120.5000    221.2500 -64.0
+    112.5000    221.2500 -64.0
+    108.7500    218.5000 -64.0
+    104.5000    218.2500 -64.0
+    102.7500    216.5000 -64.0
+     99.5000    219.2500 -64.0
+     93.5000    222.2500 -64.0
+     82.5000    221.2500 -64.0
+     74.7500    217.5000 -64.0
+     64.5000    211.2500 -64.0
+     58.7500    205.5000 -64.0
+     57.5000    203.2500 -64.0
+     53.7500    200.5000 -64.0
+     50.7500    196.5000 -64.0
+     50.7500    193.5000 -64.0
+     48.7500    187.5000 -64.0
+     43.7500    183.5000 -64.0
+     37.7500    169.5000 -64.0
+     38.7500    157.5000 -64.0
+     37.7500    155.5000 -64.0
+     37.7500    146.5000 -64.0
+     38.7500    143.5000 -64.0
+     37.5000    143.2500 -64.0
+     36.7500    141.5000 -64.0
+     39.5000    139.7500 -64.0
+     40.7500    129.5000 -64.0
+     43.7500    122.5000 -64.0
+     47.5000    118.7500 -64.0
+     49.5000    117.7500 -64.0
+     49.7500    116.5000 -64.0
+     56.5000    110.7500 -64.0
+     56.7500    107.5000 -64.0
+     61.5000    101.7500 -64.0
+     63.5000    102.7500 -64.0
+     68.2500    107.5000 -64.0
+     70.5000    107.7500 -64.0
+     72.5000    105.7500 -64.0
+     77.5000    108.7500 -64.0
+     81.5000    105.7500 -64.0
+     83.5000    105.7500 -64.0
+     84.2500    107.5000 -64.0
+     86.5000    109.7500 -64.0
+     91.7500    107.5000 -64.0
+     89.5000    107.2500 -64.0
+     81.7500    102.5000 -64.0
+     79.2500    104.5000 -64.0
+     78.2500    106.5000 -64.0
+     76.5000    107.2500 -64.0
+     75.7500    105.5000 -64.0
+     74.5000    105.2500 -64.0
+     71.7500    101.5000 -64.0
+     72.5000    100.2500 -64.0
+     69.5000    101.2500 -64.0
+     68.7500     99.5000 -64.0
+     67.5000     99.2500 -64.0
+     67.2500    100.5000 -64.0
+     65.5000    101.2500 -64.0
+     64.7500     99.5000 -64.0
+     66.5000     98.7500 -64.0
+     66.7500     97.5000 -64.0
+     58.5000     96.2500 -64.0
+     55.2500     97.5000 -64.0
+     41.2500    120.5000 -64.0
+     32.2500    142.5000 -64.0
+     30.2500    152.5000 -64.0
+     31.2500    154.5000 -64.0
+     31.2500    158.5000 -64.0
+     33.2500    162.5000 -64.0
+     33.2500    166.5000 -64.0
+     35.2500    173.5000 -64.0
+     36.2500    180.5000 -64.0
+     41.2500    193.5000 -64.0
+     44.2500    196.5000 -64.0
+     50.5000    205.7500 -64.0
+     58.2500    215.5000 -64.0
+     65.5000    221.7500 -64.0
+     74.5000    226.7500 -64.0
+     81.2500    228.5000 -64.0
+    116.5000    228.7500 -64.0
+    118.5000    227.7500 -64.0
+    122.5000    227.7500 -64.0
+    132.5000    223.7500 -64.0
+    142.5000    216.7500 -64.0
+    154.7500    201.5000 -64.0
+    156.7500    197.5000 -64.0
+    160.7500    193.5000 -64.0
+    168.7500    180.5000 -64.0
+    172.7500    166.5000 -64.0
+    175.5000    160.7500 -64.0
+    176.5000    156.7500 -64.0
+    176.7500    146.5000 -64.0
+    169.7500    132.5000 -64.0
+    169.7500    130.5000 -64.0
+    167.7500    126.5000 -64.0
+    167.7500    124.5000 -64.0
+    166.7500    122.5000 -64.0
+    166.7500    118.5000 -64.0
+    170.5000    104.7500 -64.0
+    170.7500     90.5000 -64.0
+    169.7500     88.5000 -64.0
+    169.7500     86.5000 -64.0
+    167.7500     82.5000 -64.0
+    167.7500     80.5000 -64.0
+    164.7500     74.5000 -64.0
+    162.7500     68.5000 -64.0
+    157.7500     60.5000 -64.0
+    151.7500     56.5000 -64.0
+    148.5000     56.2500 -64.0
+    143.7500     54.5000 -64.0
+} -64.0
+{ -64.0
+    107.2500     58.5000 -64.0
+    107.5000     64.7500 -64.0
+    107.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+    145.2500     71.5000 -64.0
+    144.2500     73.5000 -64.0
+    145.7500     72.5000 -64.0
+} -64.0
+{ -64.0
+     93.2500     85.5000 -64.0
+     91.2500     87.5000 -64.0
+     93.5000     87.7500 -64.0
+} -64.0
+{ -64.0
+    119.2500     88.5000 -64.0
+    118.5000     90.2500 -64.0
+    116.5000     91.2500 -64.0
+    115.2500     97.5000 -64.0
+    116.5000     96.7500 -64.0
+    117.7500     92.5000 -64.0
+    119.7500     91.5000 -64.0
+    120.7500     89.5000 -64.0
+} -64.0
+{ -64.0
+     83.2500     89.5000 -64.0
+     83.2500     90.5000 -64.0
+     85.5000     90.7500 -64.0
+     85.7500     89.5000 -64.0
+} -64.0
+{ -64.0
+    105.2500     91.5000 -64.0
+    104.2500     93.5000 -64.0
+    101.5000     96.2500 -64.0
+     98.5000     96.2500 -64.0
+     99.2500     97.5000 -64.0
+    101.5000     96.7500 -64.0
+    102.2500     98.5000 -64.0
+    103.5000     97.7500 -64.0
+    103.7500     95.5000 -64.0
+    105.5000     94.7500 -64.0
+    111.2500    101.5000 -64.0
+    112.7500    101.5000 -64.0
+    111.7500     99.5000 -64.0
+    111.7500     97.5000 -64.0
+    109.7500     96.5000 -64.0
+    108.7500     94.5000 -64.0
+} -64.0
+{ -64.0
+     96.2500     97.5000 -64.0
+     96.5000     98.7500 -64.0
+    100.5000    100.7500 -64.0
+    101.7500     99.5000 -64.0
+     98.5000     99.2500 -64.0
+} -64.0
+{ -64.0
+     90.2500    120.5000 -64.0
+     90.2500    121.5000 -64.0
+     84.5000    126.2500 -64.0
+     82.5000    126.2500 -64.0
+     78.7500    124.5000 -64.0
+     79.5000    123.7500 -64.0
+     81.5000    123.7500 -64.0
+     81.5000    122.2500 -64.0
+     79.5000    123.2500 -64.0
+     75.7500    121.5000 -64.0
+     73.5000    121.2500 -64.0
+     68.5000    123.2500 -64.0
+     65.5000    127.2500 -64.0
+     62.5000    127.2500 -64.0
+     60.5000    129.2500 -64.0
+     60.2500    131.5000 -64.0
+     63.2500    137.5000 -64.0
+     61.5000    138.2500 -64.0
+     62.5000    138.7500 -64.0
+     64.5000    137.7500 -64.0
+     66.5000    137.7500 -64.0
+     70.5000    135.7500 -64.0
+     72.5000    135.7500 -64.0
+     75.5000    136.7500 -64.0
+     77.7500    134.5000 -64.0
+     78.7500    132.5000 -64.0
+     79.5000    130.7500 -64.0
+     78.7500    129.5000 -64.0
+     80.5000    127.7500 -64.0
+     85.5000    127.7500 -64.0
+     87.5000    125.7500 -64.0
+     89.5000    124.7500 -64.0
+     91.5000    121.7500 -64.0
+} -64.0
+{ -64.0
+     60.2500    122.5000 -64.0
+     60.2500    123.5000 -64.0
+     61.5000    123.7500 -64.0
+} -64.0
+{ -64.0
+     55.2500    126.5000 -64.0
+     53.5000    129.2500 -64.0
+     54.2500    130.5000 -64.0
+     55.7500    127.5000 -64.0
+} -64.0
+{ -64.0
+     58.2500    136.5000 -64.0
+     59.2500    137.5000 -64.0
+     59.7500    136.5000 -64.0
+} -64.0
+{ -64.0
+     65.7500     61.5000 -64.0
+     66.5000     60.7500 -64.0
+     67.2500     61.5000 -64.0
+     66.5000     62.2500 -64.0
+} -64.0
+{ -64.0
+     59.5000     97.7500 -64.0
+     60.2500     98.5000 -64.0
+     58.5000    100.2500 -64.0
+     57.7500     99.5000 -64.0
+} -64.0
+{ -64.0
+    152.7500    103.5000 -64.0
+    154.5000    102.7500 -64.0
+    156.2500    104.5000 -64.0
+    155.5000    108.2500 -64.0
+    158.2500    109.5000 -64.0
+    151.5000    113.2500 -64.0
+    149.7500    112.5000 -64.0
+    147.7500    108.5000 -64.0
+    150.5000    104.7500 -64.0
+} -64.0
+{ -64.0
+     52.7500    104.5000 -64.0
+     53.5000    103.7500 -64.0
+     55.2500    104.5000 -64.0
+     54.5000    105.2500 -64.0
+     55.2500    106.5000 -64.0
+     55.2500    108.5000 -64.0
+     53.5000    110.2500 -64.0
+     51.7500    109.5000 -64.0
+     52.5000    107.7500 -64.0
+} -64.0
+{ -64.0
+    140.7500    107.5000 -64.0
+    141.5000    106.7500 -64.0
+    143.2500    107.5000 -64.0
+    141.5000    109.2500 -64.0
+} -64.0
+{ -64.0
+    152.7500    113.5000 -64.0
+    153.5000    112.7500 -64.0
+    158.5000    112.7500 -64.0
+    160.2500    113.5000 -64.0
+    161.2500    115.5000 -64.0
+    160.5000    117.2500 -64.0
+    154.5000    120.2500 -64.0
+    152.5000    120.2500 -64.0
+    148.5000    123.2500 -64.0
+    146.7500    122.5000 -64.0
+    147.7500    117.5000 -64.0
+    148.5000    115.7500 -64.0
+} -64.0
+{ -64.0
+    132.7500    127.5000 -64.0
+    133.5000    126.7500 -64.0
+    135.2500    128.5000 -64.0
+    134.5000    129.2500 -64.0
+} -64.0
+{ -64.0
+    163.7500    130.5000 -64.0
+    165.5000    129.7500 -64.0
+    167.2500    131.5000 -64.0
+    167.2500    133.5000 -64.0
+    170.2500    137.5000 -64.0
+    167.5000    140.2500 -64.0
+    165.5000    140.2500 -64.0
+    165.2500    141.5000 -64.0
+    167.2500    142.5000 -64.0
+    168.5000    144.7500 -64.0
+    168.7500    142.5000 -64.0
+    170.5000    140.7500 -64.0
+    173.2500    143.5000 -64.0
+    172.2500    145.5000 -64.0
+    173.2500    147.5000 -64.0
+    171.5000    152.2500 -64.0
+    169.5000    152.2500 -64.0
+    165.7500    149.5000 -64.0
+    167.5000    147.7500 -64.0
+    167.7500    145.5000 -64.0
+    165.5000    146.2500 -64.0
+    163.7500    145.5000 -64.0
+    161.5000    146.2500 -64.0
+    161.2500    147.5000 -64.0
+    159.5000    148.2500 -64.0
+    157.7500    146.5000 -64.0
+    158.5000    145.7500 -64.0
+    160.5000    145.7500 -64.0
+    159.7500    144.5000 -64.0
+    154.5000    144.2500 -64.0
+    147.7500    138.5000 -64.0
+    147.7500    136.5000 -64.0
+    150.7500    132.5000 -64.0
+    152.5000    131.7500 -64.0
+    156.2500    134.5000 -64.0
+    155.5000    136.2500 -64.0
+    158.2500    139.5000 -64.0
+    160.2500    143.5000 -64.0
+    161.7500    142.5000 -64.0
+    160.7500    140.5000 -64.0
+    161.7500    137.5000 -64.0
+    158.7500    134.5000 -64.0
+    159.5000    132.7500 -64.0
+    161.5000    132.7500 -64.0
+} -64.0
+{ -64.0
+    136.7500    131.5000 -64.0
+    137.5000    130.7500 -64.0
+    138.2500    131.5000 -64.0
+    137.5000    132.2500 -64.0
+} -64.0
+{ -64.0
+    169.7500    154.5000 -64.0
+    171.5000    153.7500 -64.0
+    173.2500    155.5000 -64.0
+    171.5000    157.2500 -64.0
+    169.7500    156.5000 -64.0
+} -64.0
+v 505 z -118.000000 -64.0
+{ -64.0
+     96.2500     43.5000 -64.0
+     91.5000     48.2500 -64.0
+     92.2500     49.5000 -64.0
+     94.5000     49.7500 -64.0
+     96.7500     47.5000 -64.0
+     95.7500     45.5000 -64.0
+     96.7500     44.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500     46.5000 -64.0
+    122.2500     50.5000 -64.0
+    123.7500     50.5000 -64.0
+    124.7500     48.5000 -64.0
+} -64.0
+{ -64.0
+     72.2500     52.5000 -64.0
+     68.5000     54.2500 -64.0
+     66.5000     53.2500 -64.0
+     58.5000     57.2500 -64.0
+     54.2500     63.5000 -64.0
+     43.5000     84.2500 -64.0
+     42.5000     88.2500 -64.0
+     42.2500     96.5000 -64.0
+     42.7500     97.5000 -64.0
+     46.7500     83.5000 -64.0
+     57.5000     66.7500 -64.0
+     61.5000     63.7500 -64.0
+     64.5000     63.7500 -64.0
+     68.7500     66.5000 -64.0
+     67.7500     63.5000 -64.0
+     64.7500     60.5000 -64.0
+     59.5000     63.2500 -64.0
+     58.7500     62.5000 -64.0
+     59.5000     61.7500 -64.0
+     59.7500     59.5000 -64.0
+     65.5000     55.7500 -64.0
+     69.2500     56.5000 -64.0
+     73.5000     52.7500 -64.0
+     77.7500     52.5000 -64.0
+} -64.0
+{ -64.0
+    141.2500     55.5000 -64.0
+    140.5000     56.2500 -64.0
+    137.5000     56.2500 -64.0
+    138.2500     58.5000 -64.0
+    139.5000     58.7500 -64.0
+    141.5000     56.7500 -64.0
+    145.5000     56.7500 -64.0
+    150.2500     60.5000 -64.0
+    151.5000     58.7500 -64.0
+    156.2500     62.5000 -64.0
+    154.5000     63.2500 -64.0
+    152.7500     62.5000 -64.0
+    151.2500     64.5000 -64.0
+    150.2500     66.5000 -64.0
+    155.5000     66.7500 -64.0
+    159.2500     70.5000 -64.0
+    163.2500     78.5000 -64.0
+    163.2500     80.5000 -64.0
+    165.2500     84.5000 -64.0
+    165.2500     86.5000 -64.0
+    168.2500     92.5000 -64.0
+    169.5000     90.7500 -64.0
+    169.7500     88.5000 -64.0
+    168.7500     86.5000 -64.0
+    168.7500     84.5000 -64.0
+    167.7500     82.5000 -64.0
+    167.7500     80.5000 -64.0
+    163.7500     72.5000 -64.0
+    163.7500     70.5000 -64.0
+    161.7500     65.5000 -64.0
+    156.5000     59.2500 -64.0
+    152.5000     57.2500 -64.0
+    150.7500     56.5000 -64.0
+    146.5000     56.2500 -64.0
+    144.7500     55.5000 -64.0
+} -64.0
+{ -64.0
+     68.2500     57.5000 -64.0
+     67.2500     58.5000 -64.0
+     68.7500     58.5000 -64.0
+} -64.0
+{ -64.0
+    145.2500     70.5000 -64.0
+    144.2500     72.5000 -64.0
+    145.7500     71.5000 -64.0
+} -64.0
+{ -64.0
+    129.2500     89.5000 -64.0
+    127.2500     90.5000 -64.0
+    129.7500     90.5000 -64.0
+} -64.0
+{ -64.0
+     94.2500     90.5000 -64.0
+     95.2500     91.5000 -64.0
+     95.5000     93.7500 -64.0
+     95.7500     90.5000 -64.0
+} -64.0
+{ -64.0
+    105.2500     91.5000 -64.0
+    102.5000     95.2500 -64.0
+    102.2500     97.5000 -64.0
+    100.5000     99.2500 -64.0
+     98.2500     99.5000 -64.0
+     99.2500    102.5000 -64.0
+    104.5000     98.7500 -64.0
+    107.2500    100.5000 -64.0
+    108.2500    102.5000 -64.0
+    109.5000    102.7500 -64.0
+    109.7500     98.5000 -64.0
+    107.7500     93.5000 -64.0
+} -64.0
+{ -64.0
+    118.2500     92.5000 -64.0
+    117.5000     93.2500 -64.0
+    117.5000     95.7500 -64.0
+    119.5000     94.7500 -64.0
+} -64.0
+{ -64.0
+    168.2500     94.5000 -64.0
+    168.2500     95.5000 -64.0
+    167.2500     98.5000 -64.0
+    164.2500    102.5000 -64.0
+    163.2500    104.5000 -64.0
+    161.5000    105.2500 -64.0
+    157.7500    101.5000 -64.0
+    154.5000    101.2500 -64.0
+    152.5000    103.2500 -64.0
+    147.5000    106.2500 -64.0
+    145.5000    106.2500 -64.0
+    143.5000    107.2500 -64.0
+    141.5000    107.2500 -64.0
+    134.5000    106.2500 -64.0
+    132.2500    109.5000 -64.0
+    131.2500    111.5000 -64.0
+    133.2500    112.5000 -64.0
+    133.2500    115.5000 -64.0
+    137.2500    119.5000 -64.0
+    142.2500    122.5000 -64.0
+    144.5000    122.7500 -64.0
+    146.5000    123.7500 -64.0
+    151.5000    124.7500 -64.0
+    156.5000    126.7500 -64.0
+    158.2500    130.5000 -64.0
+    156.5000    132.2500 -64.0
+    153.5000    132.2500 -64.0
+    149.7500    130.5000 -64.0
+    147.5000    131.2500 -64.0
+    147.2500    132.5000 -64.0
+    145.5000    133.2500 -64.0
+    143.5000    134.2500 -64.0
+    141.7500    132.5000 -64.0
+    141.7500    128.5000 -64.0
+    138.7500    125.5000 -64.0
+    138.7500    123.5000 -64.0
+    137.5000    124.2500 -64.0
+    135.5000    125.2500 -64.0
+    130.5000    124.2500 -64.0
+    132.2500    126.5000 -64.0
+    131.5000    127.2500 -64.0
+    129.5000    127.2500 -64.0
+    129.2500    128.5000 -64.0
+    128.5000    130.2500 -64.0
+    124.7500    128.5000 -64.0
+    123.7500    126.5000 -64.0
+    120.5000    125.2500 -64.0
+    120.2500    126.5000 -64.0
+    131.2500    136.5000 -64.0
+    136.2500    139.5000 -64.0
+    138.5000    139.7500 -64.0
+    141.2500    142.5000 -64.0
+    151.2500    148.5000 -64.0
+    157.5000    149.7500 -64.0
+    163.2500    152.5000 -64.0
+    164.2500    154.5000 -64.0
+    165.7500    155.5000 -64.0
+    164.7500    153.5000 -64.0
+    165.5000    151.7500 -64.0
+    167.5000    150.7500 -64.0
+    165.7500    149.5000 -64.0
+    164.7500    147.5000 -64.0
+    163.5000    147.2500 -64.0
+    164.2500    148.5000 -64.0
+    163.5000    149.2500 -64.0
+    160.5000    149.2500 -64.0
+    158.7500    147.5000 -64.0
+    157.5000    145.2500 -64.0
+    151.5000    142.2500 -64.0
+    148.7500    138.5000 -64.0
+    148.7500    136.5000 -64.0
+    150.5000    135.7500 -64.0
+    150.7500    134.5000 -64.0
+    152.5000    132.7500 -64.0
+    156.2500    135.5000 -64.0
+    156.2500    137.5000 -64.0
+    158.2500    138.5000 -64.0
+    160.2500    142.5000 -64.0
+    163.5000    142.7500 -64.0
+    160.7500    140.5000 -64.0
+    160.7500    138.5000 -64.0
+    157.7500    134.5000 -64.0
+    159.5000    132.7500 -64.0
+    161.5000    132.7500 -64.0
+    164.2500    135.5000 -64.0
+    166.5000    133.7500 -64.0
+    170.2500    137.5000 -64.0
+    169.2500    138.5000 -64.0
+    168.2500    140.5000 -64.0
+    167.5000    142.2500 -64.0
+    165.5000    142.2500 -64.0
+    167.2500    144.5000 -64.0
+    166.5000    145.7500 -64.0
+    168.5000    144.7500 -64.0
+    169.5000    145.7500 -64.0
+    171.5000    146.7500 -64.0
+    173.2500    150.5000 -64.0
+    172.5000    152.2500 -64.0
+    172.2500    155.5000 -64.0
+    171.5000    157.2500 -64.0
+    166.5000    157.2500 -64.0
+    166.2500    162.5000 -64.0
+    165.2500    169.5000 -64.0
+    163.2500    173.5000 -64.0
+    160.5000    177.2500 -64.0
+    160.2500    179.5000 -64.0
+    159.2500    182.5000 -64.0
+    154.2500    188.5000 -64.0
+    150.2500    196.5000 -64.0
+    143.2500    205.5000 -64.0
+    133.5000    213.2500 -64.0
+    131.2500    214.5000 -64.0
+    124.5000    219.2500 -64.0
+    121.5000    219.2500 -64.0
+    117.5000    221.2500 -64.0
+    114.5000    221.2500 -64.0
+    108.7500    218.5000 -64.0
+    106.5000    218.2500 -64.0
+    102.7500    215.5000 -64.0
+     98.5000    219.2500 -64.0
+     94.5000    221.2500 -64.0
+     84.5000    221.2500 -64.0
+     81.5000    220.2500 -64.0
+     77.7500    218.5000 -64.0
+     65.5000    210.2500 -64.0
+     63.5000    209.2500 -64.0
+     54.7500    199.5000 -64.0
+     51.7500    195.5000 -64.0
+     51.7500    193.5000 -64.0
+     50.7500    191.5000 -64.0
+     50.7500    188.5000 -64.0
+     44.7500    182.5000 -64.0
+     41.7500    178.5000 -64.0
+     41.7500    176.5000 -64.0
+     39.7500    172.5000 -64.0
+     39.7500    170.5000 -64.0
+     38.7500    168.5000 -64.0
+     38.7500    165.5000 -64.0
+     39.5000    163.7500 -64.0
+     39.7500    158.5000 -64.0
+     38.7500    156.5000 -64.0
+     38.7500    148.5000 -64.0
+     40.5000    144.2500 -64.0
+     38.5000    143.2500 -64.0
+     36.7500    142.5000 -64.0
+     36.7500    140.5000 -64.0
+     38.5000    139.7500 -64.0
+     42.5000    141.7500 -64.0
+     42.7500    139.5000 -64.0
+     40.7500    135.5000 -64.0
+     40.7500    133.5000 -64.0
+     42.7500    127.5000 -64.0
+     44.5000    123.7500 -64.0
+     43.7500    121.5000 -64.0
+     45.5000    119.7500 -64.0
+     46.2500    120.5000 -64.0
+     47.2500    122.5000 -64.0
+     51.2500    126.5000 -64.0
+     52.5000    125.7500 -64.0
+     53.2500    126.5000 -64.0
+     55.7500    122.5000 -64.0
+     60.5000    120.7500 -64.0
+     61.5000    118.7500 -64.0
+     63.5000    117.7500 -64.0
+     65.7500    112.5000 -64.0
+     64.5000    112.2500 -64.0
+     61.5000    115.2500 -64.0
+     58.5000    115.2500 -64.0
+     60.2500    117.5000 -64.0
+     60.2500    119.5000 -64.0
+     58.5000    120.2500 -64.0
+     56.5000    121.2500 -64.0
+     52.7500    118.5000 -64.0
+     52.7500    116.5000 -64.0
+     55.5000    113.7500 -64.0
+     58.5000    113.7500 -64.0
+     58.7500    112.5000 -64.0
+     61.5000    108.7500 -64.0
+     65.5000    110.7500 -64.0
+     66.5000    108.7500 -64.0
+     68.5000    109.7500 -64.0
+     70.2500    110.5000 -64.0
+     71.5000    109.7500 -64.0
+     76.7500    109.5000 -64.0
+     77.7500    107.5000 -64.0
+     81.5000    103.7500 -64.0
+     81.7500    101.5000 -64.0
+     78.5000    104.2500 -64.0
+     76.7500    102.5000 -64.0
+     76.7500    100.5000 -64.0
+     75.5000    101.2500 -64.0
+     69.5000    103.2500 -64.0
+     61.7500     98.5000 -64.0
+     59.5000     98.2500 -64.0
+     57.5000     97.2500 -64.0
+     55.5000     98.2500 -64.0
+     52.2500    102.5000 -64.0
+     51.2500    104.5000 -64.0
+     46.5000    110.2500 -64.0
+     43.5000    115.2500 -64.0
+     41.2500    121.5000 -64.0
+     40.5000    123.2500 -64.0
+     38.2500    129.5000 -64.0
+     32.2500    142.5000 -64.0
+     31.5000    144.2500 -64.0
+     31.2500    156.5000 -64.0
+     33.2500    160.5000 -64.0
+     33.2500    163.5000 -64.0
+     34.2500    165.5000 -64.0
+     34.2500    169.5000 -64.0
+     35.2500    171.5000 -64.0
+     35.2500    173.5000 -64.0
+     36.2500    175.5000 -64.0
+     36.2500    177.5000 -64.0
+     40.2500    189.5000 -64.0
+     47.2500    198.5000 -64.0
+     52.2500    206.5000 -64.0
+     55.2500    210.5000 -64.0
+     59.5000    215.7500 -64.0
+     63.2500    218.5000 -64.0
+     69.5000    222.7500 -64.0
+     77.5000    226.7500 -64.0
+     91.5000    228.7500 -64.0
+     93.5000    227.7500 -64.0
+    117.5000    227.7500 -64.0
+    119.5000    226.7500 -64.0
+    123.5000    226.7500 -64.0
+    135.5000    220.7500 -64.0
+    142.5000    214.7500 -64.0
+    144.5000    213.7500 -64.0
+    153.7500    201.5000 -64.0
+    155.7500    197.5000 -64.0
+    159.5000    193.7500 -64.0
+    162.7500    189.5000 -64.0
+    170.7500    173.5000 -64.0
+    171.7500    168.5000 -64.0
+    172.7500    165.5000 -64.0
+    174.5000    161.7500 -64.0
+    174.7500    159.5000 -64.0
+    175.5000    157.7500 -64.0
+    175.7500    144.5000 -64.0
+    166.7500    126.5000 -64.0
+    166.7500    116.5000 -64.0
+    168.7500    110.5000 -64.0
+    169.5000    108.7500 -64.0
+    169.7500     97.5000 -64.0
+} -64.0
+{ -64.0
+    129.2500    100.5000 -64.0
+    128.2500    102.5000 -64.0
+    124.5000    104.2500 -64.0
+    125.2500    105.5000 -64.0
+    124.5000    107.2500 -64.0
+    122.5000    107.2500 -64.0
+    120.7500    105.5000 -64.0
+    118.2500    105.5000 -64.0
+    117.2500    107.5000 -64.0
+    123.5000    108.7500 -64.0
+    125.5000    107.7500 -64.0
+    126.2500    108.5000 -64.0
+    128.5000    108.7500 -64.0
+    127.7500    107.5000 -64.0
+    127.7500    104.5000 -64.0
+    129.5000    102.7500 -64.0
+    131.7500    102.5000 -64.0
+    130.7500    100.5000 -64.0
+} -64.0
+{ -64.0
+     83.2500    104.5000 -64.0
+     83.2500    107.5000 -64.0
+     79.2500    111.5000 -64.0
+     78.2500    113.5000 -64.0
+     79.5000    113.7500 -64.0
+     89.5000    107.7500 -64.0
+     91.5000    107.7500 -64.0
+     91.7500    105.5000 -64.0
+     86.5000    107.2500 -64.0
+     84.7500    106.5000 -64.0
+     84.7500    104.5000 -64.0
+} -64.0
+{ -64.0
+    114.2500    108.5000 -64.0
+    114.2500    109.5000 -64.0
+    115.5000    109.7500 -64.0
+    115.7500    108.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500    111.5000 -64.0
+    122.5000    111.7500 -64.0
+    124.5000    112.7500 -64.0
+    123.7500    111.5000 -64.0
+} -64.0
+{ -64.0
+     66.2500    117.5000 -64.0
+     67.2500    119.5000 -64.0
+     67.2500    123.5000 -64.0
+     63.2500    126.5000 -64.0
+     60.5000    130.2500 -64.0
+     60.2500    132.5000 -64.0
+     62.2500    134.5000 -64.0
+     62.2500    136.5000 -64.0
+     63.5000    136.7500 -64.0
+     64.2500    138.5000 -64.0
+     61.5000    140.2500 -64.0
+     59.7500    138.5000 -64.0
+     56.5000    138.2500 -64.0
+     56.2500    139.5000 -64.0
+     58.2500    140.5000 -64.0
+     65.5000    140.7500 -64.0
+     71.5000    136.7500 -64.0
+     72.2500    137.5000 -64.0
+     75.5000    137.7500 -64.0
+     77.5000    135.7500 -64.0
+     77.7500    133.5000 -64.0
+     76.7500    131.5000 -64.0
+     71.5000    131.2500 -64.0
+     68.7500    128.5000 -64.0
+     69.5000    127.7500 -64.0
+     77.5000    127.7500 -64.0
+     79.2500    128.5000 -64.0
+     84.5000    128.7500 -64.0
+     87.5000    127.7500 -64.0
+     90.5000    124.7500 -64.0
+     90.7500    121.5000 -64.0
+     89.5000    121.2500 -64.0
+     86.5000    125.2500 -64.0
+     82.5000    127.2500 -64.0
+     80.7500    125.5000 -64.0
+     81.7500    123.5000 -64.0
+     79.5000    123.2500 -64.0
+     77.5000    121.2500 -64.0
+     73.5000    119.2500 -64.0
+     71.5000    120.2500 -64.0
+     68.5000    120.2500 -64.0
+     67.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+    121.2500    118.5000 -64.0
+    120.5000    119.2500 -64.0
+    120.5000    120.7500 -64.0
+    123.5000    119.7500 -64.0
+    122.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+     58.5000     99.7500 -64.0
+     60.2500    100.5000 -64.0
+     59.5000    102.2500 -64.0
+     59.2500    104.5000 -64.0
+     56.5000    108.2500 -64.0
+     53.7500    104.5000 -64.0
+} -64.0
+{ -64.0
+     64.7500    103.5000 -64.0
+     65.5000    102.7500 -64.0
+     67.2500    103.5000 -64.0
+     66.5000    104.2500 -64.0
+} -64.0
+{ -64.0
+    154.7500    103.5000 -64.0
+    155.5000    102.7500 -64.0
+    157.2500    106.5000 -64.0
+    154.2500    110.5000 -64.0
+    147.5000    113.2500 -64.0
+    145.7500    112.5000 -64.0
+    145.7500    110.5000 -64.0
+    152.5000    104.7500 -64.0
+} -64.0
+{ -64.0
+     69.7500    105.5000 -64.0
+     70.5000    104.7500 -64.0
+     71.2500    105.5000 -64.0
+     70.5000    106.2500 -64.0
+} -64.0
+{ -64.0
+     52.7500    106.5000 -64.0
+     53.5000    105.7500 -64.0
+     55.2500    108.5000 -64.0
+     54.5000    110.2500 -64.0
+     52.5000    110.2500 -64.0
+     51.7500    108.5000 -64.0
+} -64.0
+{ -64.0
+     73.7500    107.5000 -64.0
+     74.5000    106.7500 -64.0
+     76.2500    107.5000 -64.0
+     75.5000    108.2500 -64.0
+} -64.0
+{ -64.0
+    134.7500    109.5000 -64.0
+    135.5000    108.7500 -64.0
+    138.2500    110.5000 -64.0
+    137.5000    112.2500 -64.0
+    135.5000    111.2500 -64.0
+} -64.0
+{ -64.0
+    139.7500    110.5000 -64.0
+    140.5000    109.7500 -64.0
+    142.2500    110.5000 -64.0
+    140.5000    112.2500 -64.0
+} -64.0
+{ -64.0
+    153.7500    112.5000 -64.0
+    154.5000    111.7500 -64.0
+    162.5000    111.7500 -64.0
+    165.2500    114.5000 -64.0
+    165.2500    116.5000 -64.0
+    163.5000    118.2500 -64.0
+    159.5000    120.2500 -64.0
+    157.2500    120.5000 -64.0
+    150.5000    123.2500 -64.0
+    145.5000    122.2500 -64.0
+    143.7500    120.5000 -64.0
+    144.7500    117.5000 -64.0
+    147.5000    113.7500 -64.0
+    150.5000    113.7500 -64.0
+} -64.0
+{ -64.0
+    134.7500    113.5000 -64.0
+    135.5000    112.7500 -64.0
+    136.2500    113.5000 -64.0
+    135.5000    114.2500 -64.0
+} -64.0
+{ -64.0
+     50.5000    120.7500 -64.0
+     52.2500    121.5000 -64.0
+     52.2500    123.5000 -64.0
+     50.5000    124.2500 -64.0
+     48.7500    122.5000 -64.0
+} -64.0
+{ -64.0
+     72.7500    123.5000 -64.0
+     73.5000    122.7500 -64.0
+     75.2500    124.5000 -64.0
+     74.5000    126.2500 -64.0
+} -64.0
+{ -64.0
+    168.7500    143.5000 -64.0
+    169.5000    142.7500 -64.0
+    170.2500    143.5000 -64.0
+    169.5000    144.2500 -64.0
+} -64.0
+{ -64.0
+    152.7500    145.5000 -64.0
+    153.5000    144.7500 -64.0
+    154.2500    145.5000 -64.0
+    153.5000    146.2500 -64.0
+} -64.0
+v 552 z -120.000000 -64.0
+{ -64.0
+     95.2500     45.5000 -64.0
+     94.2500     47.5000 -64.0
+     92.5000     48.2500 -64.0
+     92.2500     49.5000 -64.0
+     93.5000     49.7500 -64.0
+     95.7500     46.5000 -64.0
+} -64.0
+{ -64.0
+    124.2500     47.5000 -64.0
+    125.2500     49.5000 -64.0
+    125.2500     51.5000 -64.0
+    127.5000     51.7500 -64.0
+    125.7500     48.5000 -64.0
+} -64.0
+{ -64.0
+     70.2500     53.5000 -64.0
+     69.5000     54.2500 -64.0
+     63.5000     54.2500 -64.0
+     59.5000     57.2500 -64.0
+     56.2500     61.5000 -64.0
+     45.2500     83.5000 -64.0
+     44.5000     85.2500 -64.0
+     43.2500     93.5000 -64.0
+     42.5000     95.2500 -64.0
+     42.2500    108.5000 -64.0
+     43.2500    110.5000 -64.0
+     43.2500    114.5000 -64.0
+     42.2500    121.5000 -64.0
+     40.2500    127.5000 -64.0
+     37.5000    133.2500 -64.0
+     33.5000    140.2500 -64.0
+     33.2500    148.5000 -64.0
+     32.2500    150.5000 -64.0
+     33.2500    152.5000 -64.0
+     33.2500    157.5000 -64.0
+     34.2500    159.5000 -64.0
+     34.2500    161.5000 -64.0
+     35.2500    163.5000 -64.0
+     35.2500    167.5000 -64.0
+     36.2500    169.5000 -64.0
+     36.2500    171.5000 -64.0
+     37.2500    173.5000 -64.0
+     37.2500    176.5000 -64.0
+     39.2500    180.5000 -64.0
+     39.2500    182.5000 -64.0
+     42.2500    189.5000 -64.0
+     46.2500    193.5000 -64.0
+     49.2500    198.5000 -64.0
+     54.2500    206.5000 -64.0
+     55.2500    208.5000 -64.0
+     63.5000    216.7500 -64.0
+     67.2500    219.5000 -64.0
+     73.2500    223.5000 -64.0
+     79.5000    225.7500 -64.0
+     81.2500    226.5000 -64.0
+     85.5000    226.7500 -64.0
+     87.2500    227.5000 -64.0
+     94.5000    227.7500 -64.0
+     96.5000    226.7500 -64.0
+    119.5000    226.7500 -64.0
+    121.5000    225.7500 -64.0
+    124.5000    225.7500 -64.0
+    134.5000    220.7500 -64.0
+    138.5000    217.7500 -64.0
+    140.5000    216.7500 -64.0
+    147.5000    209.7500 -64.0
+    153.7500    201.5000 -64.0
+    155.7500    197.5000 -64.0
+    160.5000    192.7500 -64.0
+    164.5000    186.7500 -64.0
+    168.5000    179.7500 -64.0
+    168.7500    177.5000 -64.0
+    171.7500    171.5000 -64.0
+    172.7500    166.5000 -64.0
+    174.7500    160.5000 -64.0
+    175.5000    158.7500 -64.0
+    175.7500    143.5000 -64.0
+    171.7500    135.5000 -64.0
+    166.5000    129.2500 -64.0
+    164.5000    128.2500 -64.0
+    163.5000    130.2500 -64.0
+    158.5000    133.2500 -64.0
+    155.5000    133.2500 -64.0
+    151.7500    131.5000 -64.0
+    148.5000    131.2500 -64.0
+    146.5000    133.2500 -64.0
+    143.5000    133.2500 -64.0
+    141.7500    132.5000 -64.0
+    139.7500    128.5000 -64.0
+    139.5000    125.2500 -64.0
+    136.5000    126.2500 -64.0
+    133.5000    125.2500 -64.0
+    131.7500    121.5000 -64.0
+    133.5000    119.7500 -64.0
+    136.5000    119.7500 -64.0
+    138.2500    121.5000 -64.0
+    139.2500    123.5000 -64.0
+    140.5000    122.7500 -64.0
+    142.5000    123.7500 -64.0
+    144.5000    122.7500 -64.0
+    148.2500    124.5000 -64.0
+    155.5000    124.7500 -64.0
+    161.5000    127.7500 -64.0
+    164.5000    126.7500 -64.0
+    164.7500    123.5000 -64.0
+    163.7500    121.5000 -64.0
+    158.5000    121.2500 -64.0
+    154.5000    123.2500 -64.0
+    149.5000    123.2500 -64.0
+    146.5000    122.2500 -64.0
+    142.7500    120.5000 -64.0
+    143.5000    118.7500 -64.0
+    146.7500    113.5000 -64.0
+    147.7500    111.5000 -64.0
+    148.5000    109.7500 -64.0
+    149.2500    110.5000 -64.0
+    150.2500    112.5000 -64.0
+    151.5000    112.7500 -64.0
+    153.5000    111.7500 -64.0
+    155.5000    111.7500 -64.0
+    157.5000    110.7500 -64.0
+    161.5000    110.7500 -64.0
+    166.7500    111.5000 -64.0
+    169.5000    107.7500 -64.0
+    169.7500    105.5000 -64.0
+    167.7500    101.5000 -64.0
+    164.5000    101.2500 -64.0
+    162.5000    102.2500 -64.0
+    157.5000    101.2500 -64.0
+    148.5000    109.2500 -64.0
+    145.5000    108.2500 -64.0
+    143.5000    109.2500 -64.0
+    134.5000    107.2500 -64.0
+    134.2500    110.5000 -64.0
+    137.2500    112.5000 -64.0
+    135.5000    114.2500 -64.0
+    133.5000    114.2500 -64.0
+    132.5000    116.2500 -64.0
+    129.5000    116.2500 -64.0
+    127.5000    117.2500 -64.0
+    126.7500    116.5000 -64.0
+    125.2500    116.5000 -64.0
+    123.2500    120.5000 -64.0
+    127.5000    120.7500 -64.0
+    131.2500    124.5000 -64.0
+    134.2500    128.5000 -64.0
+    133.5000    129.2500 -64.0
+    132.5000    128.2500 -64.0
+    130.5000    127.2500 -64.0
+    131.2500    128.5000 -64.0
+    130.5000    129.2500 -64.0
+    128.5000    130.2500 -64.0
+    126.7500    129.5000 -64.0
+    123.7500    125.5000 -64.0
+    124.5000    124.7500 -64.0
+    122.5000    123.2500 -64.0
+    122.2500    126.5000 -64.0
+    125.2500    130.5000 -64.0
+    130.2500    133.5000 -64.0
+    131.2500    135.5000 -64.0
+    136.2500    138.5000 -64.0
+    140.5000    138.7500 -64.0
+    142.2500    139.5000 -64.0
+    143.5000    141.7500 -64.0
+    145.5000    142.7500 -64.0
+    151.5000    148.7500 -64.0
+    161.5000    152.7500 -64.0
+    161.7500    149.5000 -64.0
+    159.7500    148.5000 -64.0
+    158.5000    149.2500 -64.0
+    155.5000    148.2500 -64.0
+    154.7500    146.5000 -64.0
+    151.5000    145.2500 -64.0
+    149.7500    141.5000 -64.0
+    151.7500    140.5000 -64.0
+    150.7500    137.5000 -64.0
+    153.5000    133.7500 -64.0
+    155.5000    133.7500 -64.0
+    159.2500    137.5000 -64.0
+    160.2500    139.5000 -64.0
+    161.5000    137.2500 -64.0
+    159.5000    136.2500 -64.0
+    158.7500    134.5000 -64.0
+    160.5000    133.7500 -64.0
+    165.5000    134.7500 -64.0
+    166.2500    136.5000 -64.0
+    168.5000    136.7500 -64.0
+    170.2500    138.5000 -64.0
+    170.2500    141.5000 -64.0
+    172.2500    143.5000 -64.0
+    172.2500    145.5000 -64.0
+    174.2500    147.5000 -64.0
+    173.5000    148.2500 -64.0
+    173.2500    150.5000 -64.0
+    171.5000    151.2500 -64.0
+    169.7500    149.5000 -64.0
+    169.5000    147.2500 -64.0
+    169.2500    151.5000 -64.0
+    170.5000    151.7500 -64.0
+    172.2500    152.5000 -64.0
+    172.2500    156.5000 -64.0
+    168.5000    159.2500 -64.0
+    166.7500    158.5000 -64.0
+    165.5000    156.2500 -64.0
+    165.2500    163.5000 -64.0
+    164.5000    165.2500 -64.0
+    164.2500    170.5000 -64.0
+    162.2500    174.5000 -64.0
+    159.5000    178.2500 -64.0
+    159.2500    181.5000 -64.0
+    156.5000    185.2500 -64.0
+    153.2500    189.5000 -64.0
+    149.2500    197.5000 -64.0
+    145.2500    202.5000 -64.0
+    142.5000    206.2500 -64.0
+    134.5000    212.2500 -64.0
+    132.2500    213.5000 -64.0
+    125.5000    218.2500 -64.0
+    123.5000    218.2500 -64.0
+    119.5000    220.2500 -64.0
+    112.5000    220.2500 -64.0
+    108.5000    216.2500 -64.0
+    101.5000    215.2500 -64.0
+     99.5000    217.2500 -64.0
+     95.5000    220.2500 -64.0
+     86.5000    220.2500 -64.0
+     81.5000    219.2500 -64.0
+     77.5000    216.2500 -64.0
+     75.5000    215.2500 -64.0
+     68.7500    210.5000 -64.0
+     62.7500    206.5000 -64.0
+     56.7500    199.5000 -64.0
+     53.7500    195.5000 -64.0
+     53.7500    193.5000 -64.0
+     52.7500    191.5000 -64.0
+     52.7500    187.5000 -64.0
+     45.7500    181.5000 -64.0
+     42.7500    176.5000 -64.0
+     42.7500    174.5000 -64.0
+     41.7500    172.5000 -64.0
+     41.7500    170.5000 -64.0
+     40.7500    168.5000 -64.0
+     40.7500    166.5000 -64.0
+     42.7500    160.5000 -64.0
+     40.7500    156.5000 -64.0
+     40.7500    149.5000 -64.0
+     42.5000    147.7500 -64.0
+     46.5000    145.7500 -64.0
+     48.7500    145.5000 -64.0
+     49.7500    143.5000 -64.0
+     47.5000    143.2500 -64.0
+     46.7500    141.5000 -64.0
+     45.5000    141.2500 -64.0
+     44.5000    143.2500 -64.0
+     40.5000    145.2500 -64.0
+     39.7500    144.5000 -64.0
+     37.7500    140.5000 -64.0
+     38.5000    138.7500 -64.0
+     40.5000    138.7500 -64.0
+     44.2500    140.5000 -64.0
+     45.5000    139.7500 -64.0
+     43.7500    136.5000 -64.0
+     41.5000    136.2500 -64.0
+     40.7500    134.5000 -64.0
+     42.7500    132.5000 -64.0
+     43.7500    130.5000 -64.0
+     44.5000    128.7500 -64.0
+     43.7500    127.5000 -64.0
+     42.7500    125.5000 -64.0
+     46.5000    120.7500 -64.0
+     48.2500    121.5000 -64.0
+     49.2500    123.5000 -64.0
+     51.5000    122.7500 -64.0
+     50.7500    120.5000 -64.0
+     52.5000    119.7500 -64.0
+     51.7500    117.5000 -64.0
+     53.5000    116.7500 -64.0
+     55.2500    117.5000 -64.0
+     54.2500    120.5000 -64.0
+     55.2500    122.5000 -64.0
+     58.5000    122.7500 -64.0
+     61.5000    121.7500 -64.0
+     62.5000    119.7500 -64.0
+     64.5000    118.7500 -64.0
+     66.5000    119.7500 -64.0
+     68.5000    118.7500 -64.0
+     75.5000    112.7500 -64.0
+     81.5000    109.7500 -64.0
+     83.2500    110.5000 -64.0
+     81.5000    112.7500 -64.0
+     84.5000    111.7500 -64.0
+     88.5000    107.7500 -64.0
+     90.7500    106.5000 -64.0
+     91.7500    104.5000 -64.0
+     89.5000    106.2500 -64.0
+     87.5000    106.2500 -64.0
+     85.7500    105.5000 -64.0
+     86.7500    103.5000 -64.0
+     85.5000    103.2500 -64.0
+     85.2500    104.5000 -64.0
+     80.5000    109.2500 -64.0
+     78.7500    108.5000 -64.0
+     76.7500    104.5000 -64.0
+     69.5000    104.2500 -64.0
+     65.5000    102.2500 -64.0
+     58.7500     98.5000 -64.0
+     56.5000     98.2500 -64.0
+     49.5000    105.2500 -64.0
+     47.5000    106.2500 -64.0
+     45.7500    104.5000 -64.0
+     45.7500     93.5000 -64.0
+     46.7500     88.5000 -64.0
+     48.7500     83.5000 -64.0
+     53.7500     72.5000 -64.0
+     58.5000     66.7500 -64.0
+     62.5000     63.7500 -64.0
+     66.5000     63.7500 -64.0
+     68.5000     64.7500 -64.0
+     68.7500     62.5000 -64.0
+     66.5000     62.2500 -64.0
+     64.7500     60.5000 -64.0
+     65.5000     59.2500 -64.0
+     62.5000     60.2500 -64.0
+     60.7500     59.5000 -64.0
+     61.5000     58.7500 -64.0
+     65.5000     55.7500 -64.0
+     67.5000     55.7500 -64.0
+     69.2500     56.5000 -64.0
+     68.5000     57.2500 -64.0
+     69.5000     57.7500 -64.0
+     72.5000     53.7500 -64.0
+     74.7500     53.5000 -64.0
+} -64.0
+{ -64.0
+    142.2500     56.5000 -64.0
+    141.5000     57.2500 -64.0
+    135.2500     57.5000 -64.0
+    141.5000     57.7500 -64.0
+    143.5000     56.7500 -64.0
+    145.5000     56.7500 -64.0
+    148.5000     57.7500 -64.0
+    152.2500     61.5000 -64.0
+    153.2500     63.5000 -64.0
+    151.5000     65.2500 -64.0
+    149.5000     66.2500 -64.0
+    150.5000     66.7500 -64.0
+    152.5000     65.7500 -64.0
+    154.5000     65.7500 -64.0
+    161.2500     72.5000 -64.0
+    164.2500     78.5000 -64.0
+    164.2500     80.5000 -64.0
+    166.2500     84.5000 -64.0
+    166.2500     87.5000 -64.0
+    168.5000     87.7500 -64.0
+    168.7500     81.5000 -64.0
+    164.7500     73.5000 -64.0
+    164.5000     71.2500 -64.0
+    161.7500     64.5000 -64.0
+    156.5000     59.2500 -64.0
+    152.5000     57.2500 -64.0
+    150.7500     56.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500     86.5000 -64.0
+     93.2500     87.5000 -64.0
+     93.7500     86.5000 -64.0
+} -64.0
+{ -64.0
+    131.2500     87.5000 -64.0
+    126.2500     90.5000 -64.0
+    128.5000     90.7500 -64.0
+    131.7500     88.5000 -64.0
+} -64.0
+{ -64.0
+     94.2500     91.5000 -64.0
+     95.2500     93.5000 -64.0
+     96.5000     92.7500 -64.0
+     95.7500     91.5000 -64.0
+} -64.0
+{ -64.0
+    106.2500     91.5000 -64.0
+    105.2500     93.5000 -64.0
+    106.5000     93.7500 -64.0
+    108.2500     95.5000 -64.0
+    108.7500     94.5000 -64.0
+    107.7500     91.5000 -64.0
+} -64.0
+{ -64.0
+    104.2500     94.5000 -64.0
+    102.2500     97.5000 -64.0
+    103.2500     99.5000 -64.0
+    100.2500    101.5000 -64.0
+    101.2500    104.5000 -64.0
+    106.5000    101.7500 -64.0
+    106.7500     98.5000 -64.0
+    103.7500     97.5000 -64.0
+    104.7500     95.5000 -64.0
+} -64.0
+{ -64.0
+     80.2500     99.5000 -64.0
+     78.5000    102.2500 -64.0
+     78.2500    104.5000 -64.0
+     80.5000    103.7500 -64.0
+     83.7500    100.5000 -64.0
+} -64.0
+{ -64.0
+    129.2500     99.5000 -64.0
+    127.2500    101.5000 -64.0
+    129.5000    101.7500 -64.0
+} -64.0
+{ -64.0
+    109.2500    101.5000 -64.0
+    108.5000    102.2500 -64.0
+    108.2500    105.5000 -64.0
+    109.5000    105.7500 -64.0
+    110.7500    102.5000 -64.0
+} -64.0
+{ -64.0
+    119.2500    104.5000 -64.0
+    120.2500    105.5000 -64.0
+    118.5000    107.7500 -64.0
+    120.5000    106.7500 -64.0
+    120.7500    104.5000 -64.0
+} -64.0
+{ -64.0
+     96.2500    107.5000 -64.0
+     95.5000    108.2500 -64.0
+     96.2500    109.5000 -64.0
+     96.7500    108.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500    107.5000 -64.0
+    113.2500    108.5000 -64.0
+    114.7500    109.5000 -64.0
+    115.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+    156.2500    113.5000 -64.0
+    155.5000    114.2500 -64.0
+    150.2500    118.5000 -64.0
+    151.2500    120.5000 -64.0
+    153.5000    120.7500 -64.0
+    153.7500    118.5000 -64.0
+    156.5000    115.7500 -64.0
+    158.2500    116.5000 -64.0
+    157.5000    118.2500 -64.0
+    155.2500    119.5000 -64.0
+    158.5000    119.7500 -64.0
+    161.5000    118.7500 -64.0
+    163.7500    115.5000 -64.0
+    162.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+    117.2500    116.5000 -64.0
+    117.2500    118.5000 -64.0
+    117.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+     70.2500    120.5000 -64.0
+     67.2500    123.5000 -64.0
+     65.2500    127.5000 -64.0
+     67.5000    127.7500 -64.0
+     68.2500    129.5000 -64.0
+     67.5000    131.2500 -64.0
+     65.7500    130.5000 -64.0
+     64.7500    128.5000 -64.0
+     63.5000    128.2500 -64.0
+     60.5000    129.2500 -64.0
+     60.2500    131.5000 -64.0
+     61.2500    134.5000 -64.0
+     59.2500    138.5000 -64.0
+     60.5000    138.7500 -64.0
+     62.5000    137.7500 -64.0
+     66.2500    139.5000 -64.0
+     64.5000    141.2500 -64.0
+     58.5000    141.2500 -64.0
+     59.2500    142.5000 -64.0
+     63.5000    142.7500 -64.0
+     66.5000    141.7500 -64.0
+     70.5000    137.7500 -64.0
+     75.5000    137.7500 -64.0
+     77.5000    136.7500 -64.0
+     77.7500    134.5000 -64.0
+     76.7500    131.5000 -64.0
+     71.5000    130.2500 -64.0
+     70.7500    128.5000 -64.0
+     71.5000    126.7500 -64.0
+     73.5000    126.7500 -64.0
+     77.2500    129.5000 -64.0
+     84.5000    129.7500 -64.0
+     87.5000    128.7500 -64.0
+     90.5000    125.7500 -64.0
+     90.7500    123.5000 -64.0
+     89.5000    123.2500 -64.0
+     87.5000    125.2500 -64.0
+     83.5000    127.2500 -64.0
+     81.7500    125.5000 -64.0
+     82.7500    124.5000 -64.0
+     77.7500    121.5000 -64.0
+     73.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+     48.2500    124.5000 -64.0
+     46.2500    127.5000 -64.0
+     47.5000    127.7500 -64.0
+     49.2500    129.5000 -64.0
+     49.2500    131.5000 -64.0
+     48.2500    133.5000 -64.0
+     50.5000    133.7500 -64.0
+     52.5000    127.7500 -64.0
+     54.5000    128.7500 -64.0
+     54.5000    126.2500 -64.0
+     52.5000    125.2500 -64.0
+     51.5000    127.2500 -64.0
+     49.5000    127.2500 -64.0
+} -64.0
+{ -64.0
+     59.2500    125.5000 -64.0
+     59.2500    126.5000 -64.0
+     60.5000    126.7500 -64.0
+     60.7500    125.5000 -64.0
+} -64.0
+{ -64.0
+     56.2500    139.5000 -64.0
+     55.2500    141.5000 -64.0
+     56.7500    140.5000 -64.0
+} -64.0
+{ -64.0
+    164.2500    141.5000 -64.0
+    164.2500    143.5000 -64.0
+    165.5000    144.7500 -64.0
+    165.7500    141.5000 -64.0
+} -64.0
+{ -64.0
+    152.2500    142.5000 -64.0
+    156.2500    145.5000 -64.0
+    156.7500    144.5000 -64.0
+    153.7500    142.5000 -64.0
+} -64.0
+{ -64.0
+    163.2500    152.5000 -64.0
+    162.5000    153.2500 -64.0
+    163.5000    153.7500 -64.0
+    164.7500    152.5000 -64.0
+} -64.0
+{ -64.0
+    152.7500     60.5000 -64.0
+    153.5000     59.7500 -64.0
+    157.2500     62.5000 -64.0
+    155.5000     63.2500 -64.0
+} -64.0
+{ -64.0
+     57.7500     63.5000 -64.0
+     58.5000     62.7500 -64.0
+     59.2500     63.5000 -64.0
+     58.5000     64.2500 -64.0
+} -64.0
+{ -64.0
+     56.7500    101.5000 -64.0
+     58.5000    100.7500 -64.0
+     60.2500    101.5000 -64.0
+     62.2500    107.5000 -64.0
+     59.5000    111.2500 -64.0
+     55.7500    109.5000 -64.0
+     53.5000    109.2500 -64.0
+     52.7500    107.5000 -64.0
+     53.5000    105.7500 -64.0
+     55.5000    105.7500 -64.0
+} -64.0
+{ -64.0
+     72.7500    106.5000 -64.0
+     73.5000    105.7500 -64.0
+     76.2500    107.5000 -64.0
+     76.2500    110.5000 -64.0
+     74.5000    111.2500 -64.0
+     72.7500    108.5000 -64.0
+} -64.0
+{ -64.0
+    165.5000    106.7500 -64.0
+    166.2500    107.5000 -64.0
+    164.5000    109.2500 -64.0
+    163.7500    108.5000 -64.0
+} -64.0
+{ -64.0
+     51.7500    111.5000 -64.0
+     53.5000    110.7500 -64.0
+     56.5000    111.7500 -64.0
+     57.2500    113.5000 -64.0
+     56.5000    115.2500 -64.0
+     52.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+    137.7500    112.5000 -64.0
+    138.5000    111.7500 -64.0
+    140.5000    111.7500 -64.0
+    142.2500    112.5000 -64.0
+    142.2500    114.5000 -64.0
+    140.5000    115.2500 -64.0
+    138.7500    114.5000 -64.0
+} -64.0
+{ -64.0
+     68.7500    124.5000 -64.0
+     70.5000    123.7500 -64.0
+     71.2500    125.5000 -64.0
+     69.5000    126.2500 -64.0
+} -64.0
+{ -64.0
+     74.7500    124.5000 -64.0
+     75.5000    123.7500 -64.0
+     76.2500    124.5000 -64.0
+     75.5000    126.2500 -64.0
+} -64.0
+{ -64.0
+     37.7500    146.5000 -64.0
+     38.5000    145.7500 -64.0
+     40.2500    146.5000 -64.0
+     38.5000    149.2500 -64.0
+     37.7500    148.5000 -64.0
+} -64.0
+v 442 z -122.000000 -64.0
+{ -64.0
+     95.2500     45.5000 -64.0
+     92.2500     49.5000 -64.0
+     93.5000     49.7500 -64.0
+     95.7500     46.5000 -64.0
+} -64.0
+{ -64.0
+    126.2500     50.5000 -64.0
+    126.2500     52.5000 -64.0
+    127.5000     52.7500 -64.0
+    127.7500     51.5000 -64.0
+} -64.0
+{ -64.0
+     65.2500     54.5000 -64.0
+     59.5000     57.2500 -64.0
+     53.5000     66.2500 -64.0
+     53.2500     68.5000 -64.0
+     48.5000     76.2500 -64.0
+     48.2500     78.5000 -64.0
+     46.2500     82.5000 -64.0
+     47.2500     84.5000 -64.0
+     48.7500     83.5000 -64.0
+     53.7500     72.5000 -64.0
+     59.5000     65.7500 -64.0
+     65.5000     62.7500 -64.0
+     69.2500     64.5000 -64.0
+     69.7500     63.5000 -64.0
+     64.7500     60.5000 -64.0
+     66.5000     58.2500 -64.0
+     64.5000     59.2500 -64.0
+     62.7500     58.5000 -64.0
+     66.5000     55.7500 -64.0
+     68.2500     56.5000 -64.0
+     67.2500     57.5000 -64.0
+     69.5000     57.7500 -64.0
+     69.7500     56.5000 -64.0
+     73.7500     54.5000 -64.0
+} -64.0
+{ -64.0
+    145.2500     56.5000 -64.0
+    144.5000     57.2500 -64.0
+    141.2500     57.5000 -64.0
+    148.5000     57.7500 -64.0
+    152.2500     61.5000 -64.0
+    152.2500     63.5000 -64.0
+    149.5000     65.2500 -64.0
+    147.5000     65.2500 -64.0
+    146.2500     68.5000 -64.0
+    152.5000     65.7500 -64.0
+    155.5000     66.7500 -64.0
+    158.2500     69.5000 -64.0
+    161.2500     73.5000 -64.0
+    165.2500     81.5000 -64.0
+    166.5000     81.7500 -64.0
+    166.7500     78.5000 -64.0
+    164.7500     74.5000 -64.0
+    164.7500     72.5000 -64.0
+    162.7500     68.5000 -64.0
+    162.7500     66.5000 -64.0
+    158.7500     61.5000 -64.0
+    152.7500     57.5000 -64.0
+    150.5000     57.2500 -64.0
+} -64.0
+{ -64.0
+    154.2500     80.5000 -64.0
+    154.2500     82.5000 -64.0
+    155.5000     83.7500 -64.0
+    155.7500     80.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500     88.5000 -64.0
+     90.5000     89.7500 -64.0
+     94.5000     91.7500 -64.0
+     93.7500     89.5000 -64.0
+} -64.0
+{ -64.0
+    128.2500     88.5000 -64.0
+    127.2500     89.5000 -64.0
+    130.5000     89.7500 -64.0
+    130.7500     88.5000 -64.0
+} -64.0
+{ -64.0
+    106.2500     90.5000 -64.0
+    106.2500     92.5000 -64.0
+    107.5000     92.7500 -64.0
+    107.7500     90.5000 -64.0
+} -64.0
+{ -64.0
+    121.2500     91.5000 -64.0
+    121.2500     92.5000 -64.0
+    122.5000     92.7500 -64.0
+    122.7500     91.5000 -64.0
+} -64.0
+{ -64.0
+     45.2500     92.5000 -64.0
+     42.5000     98.2500 -64.0
+     42.2500    104.5000 -64.0
+     44.2500    111.5000 -64.0
+     43.2500    122.5000 -64.0
+     34.5000    139.2500 -64.0
+     34.2500    143.5000 -64.0
+     33.5000    145.2500 -64.0
+     33.2500    155.5000 -64.0
+     38.2500    176.5000 -64.0
+     43.2500    189.5000 -64.0
+     49.2500    196.5000 -64.0
+     52.2500    202.5000 -64.0
+     59.2500    211.5000 -64.0
+     67.5000    218.7500 -64.0
+     73.2500    222.5000 -64.0
+     86.2500    226.5000 -64.0
+     94.5000    226.7500 -64.0
+     96.5000    225.7500 -64.0
+    119.5000    225.7500 -64.0
+    121.5000    224.7500 -64.0
+    124.5000    224.7500 -64.0
+    132.5000    220.7500 -64.0
+    142.5000    213.7500 -64.0
+    152.7500    201.5000 -64.0
+    155.7500    195.5000 -64.0
+    163.7500    186.5000 -64.0
+    171.7500    170.5000 -64.0
+    174.5000    160.7500 -64.0
+    175.7500    147.5000 -64.0
+    171.7500    136.5000 -64.0
+    167.7500    132.5000 -64.0
+    164.5000    132.2500 -64.0
+    162.5000    133.2500 -64.0
+    160.5000    133.2500 -64.0
+    163.2500    134.5000 -64.0
+    161.5000    136.2500 -64.0
+    162.2500    138.5000 -64.0
+    165.7500    139.5000 -64.0
+    164.7500    137.5000 -64.0
+    165.5000    135.7500 -64.0
+    170.5000    137.7500 -64.0
+    172.2500    141.5000 -64.0
+    171.5000    142.2500 -64.0
+    173.2500    145.5000 -64.0
+    172.5000    147.2500 -64.0
+    173.2500    148.5000 -64.0
+    172.5000    149.2500 -64.0
+    170.5000    148.2500 -64.0
+    168.5000    149.2500 -64.0
+    170.2500    150.5000 -64.0
+    170.2500    156.5000 -64.0
+    169.5000    158.2500 -64.0
+    167.5000    159.2500 -64.0
+    165.5000    164.2500 -64.0
+    164.7500    163.5000 -64.0
+    164.7500    161.5000 -64.0
+    162.7500    155.5000 -64.0
+    161.5000    156.2500 -64.0
+    160.7500    155.5000 -64.0
+    160.2500    156.5000 -64.0
+    163.2500    159.5000 -64.0
+    161.2500    173.5000 -64.0
+    158.2500    177.5000 -64.0
+    157.2500    182.5000 -64.0
+    151.2500    190.5000 -64.0
+    146.2500    200.5000 -64.0
+    139.5000    207.2500 -64.0
+    126.5000    216.2500 -64.0
+    124.5000    216.2500 -64.0
+    118.5000    219.2500 -64.0
+    112.5000    219.2500 -64.0
+    108.7500    215.5000 -64.0
+    104.5000    215.2500 -64.0
+    103.7500    213.5000 -64.0
+    101.5000    213.2500 -64.0
+     99.5000    216.2500 -64.0
+     95.5000    219.2500 -64.0
+     92.5000    219.2500 -64.0
+     89.5000    218.2500 -64.0
+     87.5000    219.2500 -64.0
+     85.5000    219.2500 -64.0
+     73.5000    213.2500 -64.0
+     67.5000    208.2500 -64.0
+     63.5000    206.2500 -64.0
+     57.7500    199.5000 -64.0
+     54.7500    193.5000 -64.0
+     53.7500    186.5000 -64.0
+     47.7500    181.5000 -64.0
+     44.7500    177.5000 -64.0
+     42.7500    168.5000 -64.0
+     43.7500    158.5000 -64.0
+     41.7500    154.5000 -64.0
+     41.7500    152.5000 -64.0
+     44.5000    148.7500 -64.0
+     48.5000    146.7500 -64.0
+     51.5000    146.7500 -64.0
+     55.5000    144.7500 -64.0
+     59.5000    144.7500 -64.0
+     65.7500    142.5000 -64.0
+     68.5000    138.7500 -64.0
+     72.5000    138.7500 -64.0
+     75.7500    137.5000 -64.0
+     77.7500    133.5000 -64.0
+     89.5000    127.7500 -64.0
+     89.7500    125.5000 -64.0
+     88.5000    125.2500 -64.0
+     84.5000    127.2500 -64.0
+     82.7500    126.5000 -64.0
+     84.5000    124.7500 -64.0
+     84.5000    123.2500 -64.0
+     82.5000    124.2500 -64.0
+     80.5000    124.2500 -64.0
+     77.5000    121.2500 -64.0
+     75.5000    122.2500 -64.0
+     70.5000    121.2500 -64.0
+     66.5000    126.2500 -64.0
+     68.2500    128.5000 -64.0
+     67.5000    132.2500 -64.0
+     66.7500    131.5000 -64.0
+     66.7500    129.5000 -64.0
+     64.5000    129.2500 -64.0
+     62.5000    130.2500 -64.0
+     61.7500    129.5000 -64.0
+     58.5000    129.2500 -64.0
+     58.2500    130.5000 -64.0
+     62.2500    138.5000 -64.0
+     64.5000    138.7500 -64.0
+     65.2500    140.5000 -64.0
+     59.5000    143.2500 -64.0
+     58.7500    142.5000 -64.0
+     56.5000    142.2500 -64.0
+     54.7500    140.5000 -64.0
+     53.5000    143.2500 -64.0
+     52.5000    142.2500 -64.0
+     47.5000    146.2500 -64.0
+     45.7500    145.5000 -64.0
+     44.5000    147.2500 -64.0
+     42.5000    146.2500 -64.0
+     40.5000    147.2500 -64.0
+     37.7500    140.5000 -64.0
+     39.5000    138.7500 -64.0
+     42.7500    138.5000 -64.0
+     43.7500    136.5000 -64.0
+     42.7500    134.5000 -64.0
+     44.7500    133.5000 -64.0
+     46.5000    129.7500 -64.0
+     51.5000    130.7500 -64.0
+     54.5000    129.7500 -64.0
+     55.5000    127.7500 -64.0
+     56.7500    128.5000 -64.0
+     57.7500    126.5000 -64.0
+     56.5000    126.2500 -64.0
+     54.7500    124.5000 -64.0
+     61.5000    120.7500 -64.0
+     64.5000    120.7500 -64.0
+     76.5000    112.7500 -64.0
+     76.7500    111.5000 -64.0
+     68.5000    110.2500 -64.0
+     67.7500    108.5000 -64.0
+     71.5000    106.7500 -64.0
+     75.2500    107.5000 -64.0
+     75.2500    109.5000 -64.0
+     76.5000    109.7500 -64.0
+     78.5000    108.7500 -64.0
+     75.5000    104.2500 -64.0
+     71.5000    106.2500 -64.0
+     68.5000    106.2500 -64.0
+     64.7500    103.5000 -64.0
+     60.5000    102.2500 -64.0
+     57.5000     99.2500 -64.0
+     55.5000     98.2500 -64.0
+     51.5000    101.2500 -64.0
+     49.5000    101.2500 -64.0
+     46.7500     93.5000 -64.0
+} -64.0
+{ -64.0
+    104.2500     94.5000 -64.0
+    104.2500    101.5000 -64.0
+    102.5000    103.2500 -64.0
+    103.2500    104.5000 -64.0
+    103.2500    107.5000 -64.0
+    101.2500    108.5000 -64.0
+    106.5000    108.7500 -64.0
+    107.2500    110.5000 -64.0
+    110.5000    110.7500 -64.0
+    114.2500    113.5000 -64.0
+    114.7500    112.5000 -64.0
+    111.7500    108.5000 -64.0
+    109.5000    108.2500 -64.0
+    107.7500    106.5000 -64.0
+    108.5000    104.7500 -64.0
+    107.5000    104.2500 -64.0
+    107.2500    105.5000 -64.0
+    105.5000    106.2500 -64.0
+    103.7500    104.5000 -64.0
+    105.5000    100.7500 -64.0
+    106.2500    101.5000 -64.0
+    107.5000    100.7500 -64.0
+    106.7500     97.5000 -64.0
+} -64.0
+{ -64.0
+     82.2500     97.5000 -64.0
+     81.5000     99.2500 -64.0
+     82.5000     99.7500 -64.0
+     84.5000     98.7500 -64.0
+} -64.0
+{ -64.0
+    128.2500     98.5000 -64.0
+    127.2500     99.5000 -64.0
+    128.7500     99.5000 -64.0
+} -64.0
+{ -64.0
+    161.2500    102.5000 -64.0
+    159.5000    105.2500 -64.0
+    159.5000    106.7500 -64.0
+    165.5000    109.7500 -64.0
+    167.5000    108.7500 -64.0
+    167.7500    104.5000 -64.0
+    163.7500    102.5000 -64.0
+} -64.0
+{ -64.0
+     91.2500    105.5000 -64.0
+     91.2500    106.5000 -64.0
+     92.5000    106.7500 -64.0
+} -64.0
+{ -64.0
+     98.2500    108.5000 -64.0
+     96.2500    112.5000 -64.0
+     97.5000    112.7500 -64.0
+     99.5000    109.7500 -64.0
+} -64.0
+{ -64.0
+    136.2500    109.5000 -64.0
+    136.2500    110.5000 -64.0
+    137.2500    112.5000 -64.0
+    136.2500    113.5000 -64.0
+    133.5000    117.2500 -64.0
+    129.5000    117.2500 -64.0
+    128.5000    119.2500 -64.0
+    126.5000    120.2500 -64.0
+    125.5000    122.2500 -64.0
+    126.2500    123.5000 -64.0
+    127.2500    125.5000 -64.0
+    126.2500    128.5000 -64.0
+    128.5000    131.7500 -64.0
+    130.5000    130.7500 -64.0
+    132.2500    131.5000 -64.0
+    132.2500    133.5000 -64.0
+    133.2500    136.5000 -64.0
+    134.5000    136.7500 -64.0
+    136.2500    138.5000 -64.0
+    138.5000    138.7500 -64.0
+    143.5000    139.7500 -64.0
+    147.2500    143.5000 -64.0
+    159.2500    154.5000 -64.0
+    159.7500    153.5000 -64.0
+    160.5000    151.7500 -64.0
+    162.7500    150.5000 -64.0
+    158.7500    147.5000 -64.0
+    157.7500    145.5000 -64.0
+    151.5000    145.2500 -64.0
+    149.7500    142.5000 -64.0
+    150.5000    140.7500 -64.0
+    151.7500    141.5000 -64.0
+    150.7500    139.5000 -64.0
+    151.7500    136.5000 -64.0
+    152.5000    134.7500 -64.0
+    154.5000    133.7500 -64.0
+    151.7500    131.5000 -64.0
+    148.5000    131.2500 -64.0
+    145.5000    132.2500 -64.0
+    145.2500    133.5000 -64.0
+    143.5000    135.2500 -64.0
+    144.2500    136.5000 -64.0
+    142.5000    138.2500 -64.0
+    140.5000    138.2500 -64.0
+    138.7500    137.5000 -64.0
+    139.7500    135.5000 -64.0
+    138.7500    133.5000 -64.0
+    138.7500    131.5000 -64.0
+    140.5000    130.7500 -64.0
+    138.7500    129.5000 -64.0
+    137.7500    127.5000 -64.0
+    135.5000    127.2500 -64.0
+    133.7500    125.5000 -64.0
+    132.7500    123.5000 -64.0
+    133.5000    121.7500 -64.0
+    135.5000    120.7500 -64.0
+    138.5000    121.7500 -64.0
+    142.5000    125.7500 -64.0
+    145.5000    124.7500 -64.0
+    152.5000    125.7500 -64.0
+    154.5000    124.7500 -64.0
+    159.5000    124.7500 -64.0
+    161.2500    125.5000 -64.0
+    162.7500    124.5000 -64.0
+    159.5000    122.2500 -64.0
+    153.5000    124.2500 -64.0
+    151.7500    123.5000 -64.0
+    150.5000    124.2500 -64.0
+    148.5000    123.2500 -64.0
+    142.7500    120.5000 -64.0
+    141.7500    118.5000 -64.0
+    144.5000    114.7500 -64.0
+    144.7500    111.5000 -64.0
+    141.5000    111.2500 -64.0
+    137.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+     85.2500    110.5000 -64.0
+     85.2500    111.5000 -64.0
+     87.5000    111.7500 -64.0
+     87.7500    110.5000 -64.0
+} -64.0
+{ -64.0
+    160.2500    111.5000 -64.0
+    159.5000    112.2500 -64.0
+    157.5000    112.2500 -64.0
+    153.2500    115.5000 -64.0
+    155.5000    115.7500 -64.0
+    157.5000    113.7500 -64.0
+    159.5000    113.7500 -64.0
+    162.5000    112.7500 -64.0
+    164.7500    114.5000 -64.0
+    163.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500    115.5000 -64.0
+    117.5000    118.7500 -64.0
+    117.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+    151.2500    116.5000 -64.0
+    150.5000    117.2500 -64.0
+    151.5000    117.7500 -64.0
+    152.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+     87.2500    117.5000 -64.0
+     89.2500    118.5000 -64.0
+     89.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+    162.2500    117.5000 -64.0
+    159.2500    119.5000 -64.0
+    161.5000    119.7500 -64.0
+    163.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500    123.5000 -64.0
+    116.2500    124.5000 -64.0
+    119.2500    127.5000 -64.0
+    119.7500    126.5000 -64.0
+} -64.0
+{ -64.0
+    156.2500    134.5000 -64.0
+    158.2500    135.5000 -64.0
+    159.7500    134.5000 -64.0
+} -64.0
+{ -64.0
+    152.2500    142.5000 -64.0
+    153.2500    143.5000 -64.0
+    153.7500    142.5000 -64.0
+} -64.0
+{ -64.0
+     59.5000     61.7500 -64.0
+     60.2500     62.5000 -64.0
+     57.5000     65.2500 -64.0
+     56.7500     64.5000 -64.0
+} -64.0
+{ -64.0
+    157.7500     65.5000 -64.0
+    158.5000     64.7500 -64.0
+    160.2500     66.5000 -64.0
+    159.5000     68.2500 -64.0
+    158.7500     67.5000 -64.0
+} -64.0
+{ -64.0
+     55.7500    101.5000 -64.0
+     57.5000    100.7500 -64.0
+     63.2500    107.5000 -64.0
+     61.5000    110.2500 -64.0
+     59.7500    109.5000 -64.0
+     55.5000    109.2500 -64.0
+     52.7500    106.5000 -64.0
+     54.5000    105.7500 -64.0
+} -64.0
+{ -64.0
+     49.7500    108.5000 -64.0
+     50.5000    107.7500 -64.0
+     52.5000    108.7500 -64.0
+     61.5000    112.7500 -64.0
+     64.2500    118.5000 -64.0
+     61.5000    120.2500 -64.0
+     58.5000    120.2500 -64.0
+     55.7500    117.5000 -64.0
+     53.5000    117.2500 -64.0
+     46.7500    111.5000 -64.0
+     47.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+     51.7500    119.5000 -64.0
+     52.5000    118.7500 -64.0
+     53.2500    119.5000 -64.0
+     54.2500    121.5000 -64.0
+     53.5000    123.2500 -64.0
+     51.5000    123.2500 -64.0
+     50.7500    121.5000 -64.0
+} -64.0
+v 430 z -124.000000 -64.0
+{ -64.0
+     96.2500     44.5000 -64.0
+     95.2500     45.5000 -64.0
+     96.7500     45.5000 -64.0
+} -64.0
+{ -64.0
+    109.2500     44.5000 -64.0
+    109.2500     49.5000 -64.0
+    108.2500     52.5000 -64.0
+    109.2500     54.5000 -64.0
+    110.7500     52.5000 -64.0
+    109.7500     50.5000 -64.0
+    109.7500     47.5000 -64.0
+    110.7500     44.5000 -64.0
+} -64.0
+{ -64.0
+     94.2500     46.5000 -64.0
+     91.5000     49.2500 -64.0
+     92.2500     50.5000 -64.0
+     93.7500     49.5000 -64.0
+     94.7500     47.5000 -64.0
+} -64.0
+{ -64.0
+    125.2500     50.5000 -64.0
+    127.2500     53.5000 -64.0
+    127.7500     52.5000 -64.0
+    126.7500     50.5000 -64.0
+} -64.0
+{ -64.0
+     66.2500     54.5000 -64.0
+     60.5000     57.2500 -64.0
+     56.2500     62.5000 -64.0
+     48.5000     77.2500 -64.0
+     48.2500     81.5000 -64.0
+     49.5000     80.7500 -64.0
+     54.7500     71.5000 -64.0
+     64.5000     62.7500 -64.0
+     66.5000     62.7500 -64.0
+     70.7500     64.5000 -64.0
+     69.7500     61.5000 -64.0
+     66.5000     61.2500 -64.0
+     65.7500     59.5000 -64.0
+     68.5000     56.7500 -64.0
+     72.5000     54.7500 -64.0
+} -64.0
+{ -64.0
+    142.2500     57.5000 -64.0
+    146.5000     57.7500 -64.0
+    152.5000     60.7500 -64.0
+    153.2500     62.5000 -64.0
+    152.5000     64.2500 -64.0
+    151.7500     63.5000 -64.0
+    148.5000     63.2500 -64.0
+    146.5000     65.2500 -64.0
+    146.2500     67.5000 -64.0
+    147.5000     67.7500 -64.0
+    149.5000     65.7500 -64.0
+    154.5000     65.7500 -64.0
+    163.5000     75.7500 -64.0
+    163.5000     71.2500 -64.0
+    160.7500     64.5000 -64.0
+    156.7500     60.5000 -64.0
+    151.7500     57.5000 -64.0
+} -64.0
+{ -64.0
+    154.2500     79.5000 -64.0
+    153.5000     80.2500 -64.0
+    153.2500     83.5000 -64.0
+    155.5000     85.7500 -64.0
+    155.7500     80.5000 -64.0
+} -64.0
+{ -64.0
+     91.2500     87.5000 -64.0
+     90.5000     88.2500 -64.0
+     92.2500     89.5000 -64.0
+     92.2500     91.5000 -64.0
+     93.5000     91.7500 -64.0
+     93.7500     90.5000 -64.0
+     92.7500     87.5000 -64.0
+} -64.0
+{ -64.0
+    107.2500     88.5000 -64.0
+    106.5000     89.2500 -64.0
+    106.2500     94.5000 -64.0
+    107.5000     93.7500 -64.0
+    107.7500     89.5000 -64.0
+} -64.0
+{ -64.0
+    127.2500     88.5000 -64.0
+    127.2500     89.5000 -64.0
+    129.5000     89.7500 -64.0
+    129.7500     88.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500     90.5000 -64.0
+    121.5000     92.2500 -64.0
+    122.5000     92.7500 -64.0
+    123.7500     90.5000 -64.0
+} -64.0
+{ -64.0
+     46.2500     96.5000 -64.0
+     43.5000     99.2500 -64.0
+     43.2500    105.5000 -64.0
+     45.5000    107.7500 -64.0
+     47.5000    106.7500 -64.0
+     51.5000    106.7500 -64.0
+     61.2500    111.5000 -64.0
+     63.5000    111.7500 -64.0
+     66.2500    116.5000 -64.0
+     65.5000    118.2500 -64.0
+     63.2500    119.5000 -64.0
+     66.5000    119.7500 -64.0
+     71.5000    117.7500 -64.0
+     76.5000    112.7500 -64.0
+     74.7500    109.5000 -64.0
+     76.5000    107.7500 -64.0
+     75.7500    105.5000 -64.0
+     74.5000    105.2500 -64.0
+     68.5000    108.2500 -64.0
+     64.7500    105.5000 -64.0
+     59.5000    105.2500 -64.0
+     57.5000    107.2500 -64.0
+     54.5000    105.2500 -64.0
+     53.7500    103.5000 -64.0
+     54.5000    101.7500 -64.0
+     56.5000    101.7500 -64.0
+     57.2500    103.5000 -64.0
+     58.5000    103.7500 -64.0
+     57.7500    100.5000 -64.0
+     55.7500     98.5000 -64.0
+     53.5000     98.2500 -64.0
+     49.7500     96.5000 -64.0
+} -64.0
+{ -64.0
+     48.2500    109.5000 -64.0
+     47.2500    110.5000 -64.0
+     48.2500    113.5000 -64.0
+     51.7500    114.5000 -64.0
+     50.7500    112.5000 -64.0
+     50.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+    100.2500    109.5000 -64.0
+     98.5000    110.2500 -64.0
+     95.2500    115.5000 -64.0
+     98.5000    112.7500 -64.0
+    103.5000    112.7500 -64.0
+    105.5000    111.7500 -64.0
+    108.5000    111.7500 -64.0
+    111.5000    112.7500 -64.0
+    115.2500    115.5000 -64.0
+    118.2500    119.5000 -64.0
+    119.7500    119.5000 -64.0
+    114.5000    113.2500 -64.0
+    112.5000    112.2500 -64.0
+    110.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+    161.2500    111.5000 -64.0
+    152.5000    116.2500 -64.0
+    151.5000    117.7500 -64.0
+    153.5000    116.7500 -64.0
+    155.5000    116.7500 -64.0
+    157.5000    114.7500 -64.0
+    163.5000    112.7500 -64.0
+    165.5000    114.7500 -64.0
+    165.7500    112.5000 -64.0
+    163.7500    111.5000 -64.0
+} -64.0
+{ -64.0
+     85.2500    112.5000 -64.0
+     83.5000    117.2500 -64.0
+     81.7500    116.5000 -64.0
+     82.7500    114.5000 -64.0
+     77.5000    114.2500 -64.0
+     75.2500    117.5000 -64.0
+     78.2500    118.5000 -64.0
+     78.2500    120.5000 -64.0
+     73.5000    123.2500 -64.0
+     70.5000    122.2500 -64.0
+     66.5000    126.2500 -64.0
+     66.2500    129.5000 -64.0
+     64.5000    131.2500 -64.0
+     63.7500    130.5000 -64.0
+     61.5000    130.2500 -64.0
+     57.5000    127.2500 -64.0
+     55.5000    129.2500 -64.0
+     53.5000    129.2500 -64.0
+     49.7500    127.5000 -64.0
+     47.5000    127.2500 -64.0
+     45.7500    125.5000 -64.0
+     42.2500    128.5000 -64.0
+     36.5000    136.2500 -64.0
+     34.5000    142.2500 -64.0
+     34.2500    156.5000 -64.0
+     35.2500    158.5000 -64.0
+     36.2500    168.5000 -64.0
+     40.2500    178.5000 -64.0
+     40.2500    180.5000 -64.0
+     45.2500    190.5000 -64.0
+     48.2500    192.5000 -64.0
+     55.2500    204.5000 -64.0
+     65.5000    215.7500 -64.0
+     73.2500    221.5000 -64.0
+     86.2500    225.5000 -64.0
+    101.5000    225.7500 -64.0
+    103.5000    224.7500 -64.0
+    115.5000    225.7500 -64.0
+    117.5000    224.7500 -64.0
+    120.5000    224.7500 -64.0
+    131.5000    220.7500 -64.0
+    138.5000    215.7500 -64.0
+    150.5000    202.7500 -64.0
+    156.7500    192.5000 -64.0
+    161.7500    187.5000 -64.0
+    165.7500    181.5000 -64.0
+    172.7500    165.5000 -64.0
+    174.5000    156.7500 -64.0
+    174.7500    147.5000 -64.0
+    173.7500    145.5000 -64.0
+    172.7500    139.5000 -64.0
+    167.7500    133.5000 -64.0
+    163.5000    133.2500 -64.0
+    162.2500    139.5000 -64.0
+    165.5000    139.7500 -64.0
+    169.5000    137.7500 -64.0
+    171.2500    140.5000 -64.0
+    167.5000    143.2500 -64.0
+    168.2500    144.5000 -64.0
+    167.2500    148.5000 -64.0
+    169.5000    148.7500 -64.0
+    170.2500    150.5000 -64.0
+    169.2500    152.5000 -64.0
+    171.2500    156.5000 -64.0
+    167.5000    158.2500 -64.0
+    167.2500    164.5000 -64.0
+    166.5000    166.2500 -64.0
+    164.7500    165.5000 -64.0
+    164.7500    163.5000 -64.0
+    163.7500    161.5000 -64.0
+    163.7500    150.5000 -64.0
+    161.5000    150.2500 -64.0
+    156.7500    145.5000 -64.0
+    155.7500    143.5000 -64.0
+    151.7500    142.5000 -64.0
+    150.7500    140.5000 -64.0
+    147.7500    139.5000 -64.0
+    150.5000    137.7500 -64.0
+    153.5000    133.7500 -64.0
+    159.5000    135.7500 -64.0
+    159.7500    134.5000 -64.0
+    153.5000    133.2500 -64.0
+    152.7500    131.5000 -64.0
+    146.7500    128.5000 -64.0
+    148.5000    126.7500 -64.0
+    151.5000    126.7500 -64.0
+    156.7500    124.5000 -64.0
+    150.5000    124.2500 -64.0
+    141.7500    120.5000 -64.0
+    139.5000    120.2500 -64.0
+    137.7500    118.5000 -64.0
+    138.5000    117.7500 -64.0
+    141.5000    117.7500 -64.0
+    143.7500    115.5000 -64.0
+    138.7500    112.5000 -64.0
+    137.2500    112.5000 -64.0
+    136.2500    114.5000 -64.0
+    132.5000    118.2500 -64.0
+    132.2500    120.5000 -64.0
+    138.5000    121.7500 -64.0
+    140.2500    124.5000 -64.0
+    137.5000    127.2500 -64.0
+    134.5000    127.2500 -64.0
+    131.7500    123.5000 -64.0
+    131.7500    121.5000 -64.0
+    129.5000    121.2500 -64.0
+    128.2500    124.5000 -64.0
+    129.2500    127.5000 -64.0
+    133.2500    129.5000 -64.0
+    132.5000    130.2500 -64.0
+    132.2500    134.5000 -64.0
+    134.2500    136.5000 -64.0
+    139.2500    139.5000 -64.0
+    146.2500    141.5000 -64.0
+    147.5000    143.7500 -64.0
+    149.5000    144.7500 -64.0
+    150.2500    146.5000 -64.0
+    153.5000    147.7500 -64.0
+    157.2500    150.5000 -64.0
+    162.2500    160.5000 -64.0
+    162.2500    169.5000 -64.0
+    147.5000    194.2500 -64.0
+    147.2500    197.5000 -64.0
+    141.2500    204.5000 -64.0
+    130.5000    212.2500 -64.0
+    118.5000    218.2500 -64.0
+    116.5000    218.2500 -64.0
+    114.5000    219.2500 -64.0
+    111.7500    217.5000 -64.0
+    108.5000    213.2500 -64.0
+    105.5000    214.2500 -64.0
+    101.5000    211.2500 -64.0
+     99.5000    214.2500 -64.0
+     95.5000    217.2500 -64.0
+     83.5000    217.2500 -64.0
+     73.5000    212.2500 -64.0
+     68.5000    207.2500 -64.0
+     64.5000    205.2500 -64.0
+     60.7500    201.5000 -64.0
+     56.7500    194.5000 -64.0
+     54.7500    185.5000 -64.0
+     50.5000    181.2500 -64.0
+     48.5000    180.2500 -64.0
+     45.7500    175.5000 -64.0
+     45.7500    171.5000 -64.0
+     44.7500    169.5000 -64.0
+     44.7500    157.5000 -64.0
+     43.7500    154.5000 -64.0
+     44.7500    151.5000 -64.0
+     48.5000    148.7500 -64.0
+     52.5000    148.7500 -64.0
+     76.5000    136.7500 -64.0
+     80.5000    132.7500 -64.0
+     88.5000    128.7500 -64.0
+     88.5000    126.2500 -64.0
+     86.5000    125.2500 -64.0
+     84.5000    127.2500 -64.0
+     80.5000    127.2500 -64.0
+     76.7500    124.5000 -64.0
+     80.5000    120.7500 -64.0
+     84.5000    118.7500 -64.0
+     87.7500    119.5000 -64.0
+     85.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+     54.2500    115.5000 -64.0
+     54.5000    115.7500 -64.0
+     57.7500    117.5000 -64.0
+     56.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+     47.2500    116.5000 -64.0
+     46.5000    117.2500 -64.0
+     46.2500    121.5000 -64.0
+     48.2500    125.5000 -64.0
+     49.5000    125.7500 -64.0
+     51.5000    124.7500 -64.0
+     56.5000    121.7500 -64.0
+     59.5000    121.7500 -64.0
+     62.7500    120.5000 -64.0
+     58.5000    120.2500 -64.0
+     52.5000    117.2500 -64.0
+     50.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+    109.2500    118.5000 -64.0
+    109.2500    119.5000 -64.0
+    111.5000    120.7500 -64.0
+    112.5000    120.2500 -64.0
+} -64.0
+{ -64.0
+    161.2500    118.5000 -64.0
+    159.5000    120.2500 -64.0
+    157.2500    120.5000 -64.0
+    160.5000    120.7500 -64.0
+    162.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+     97.2500    121.5000 -64.0
+     96.5000    122.2500 -64.0
+     97.5000    122.7500 -64.0
+     98.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500    121.5000 -64.0
+    115.2500    123.5000 -64.0
+    118.2500    129.5000 -64.0
+    121.2500    131.5000 -64.0
+    126.5000    131.7500 -64.0
+    126.7500    128.5000 -64.0
+    125.7500    125.5000 -64.0
+    124.5000    125.2500 -64.0
+    126.2500    128.5000 -64.0
+    123.5000    131.2500 -64.0
+    119.7500    128.5000 -64.0
+    117.7500    124.5000 -64.0
+    114.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+    160.2500    122.5000 -64.0
+    159.2500    123.5000 -64.0
+    161.5000    123.7500 -64.0
+    161.7500    122.5000 -64.0
+} -64.0
+{ -64.0
+     47.2500    137.5000 -64.0
+     47.2500    138.5000 -64.0
+     48.7500    137.5000 -64.0
+} -64.0
+{ -64.0
+     62.5000     58.7500 -64.0
+     63.2500     59.5000 -64.0
+     57.5000     66.2500 -64.0
+     56.7500     64.5000 -64.0
+} -64.0
+{ -64.0
+    157.7500     66.5000 -64.0
+    158.5000     65.7500 -64.0
+    159.2500     66.5000 -64.0
+    158.5000     67.2500 -64.0
+} -64.0
+{ -64.0
+     45.7500    101.5000 -64.0
+     47.5000    100.7500 -64.0
+     48.2500    102.5000 -64.0
+     50.2500    103.5000 -64.0
+     47.5000    105.2500 -64.0
+     45.7500    104.5000 -64.0
+} -64.0
+{ -64.0
+     71.7500    108.5000 -64.0
+     72.5000    107.7500 -64.0
+     74.2500    109.5000 -64.0
+     72.5000    112.2500 -64.0
+     68.5000    112.2500 -64.0
+     67.7500    110.5000 -64.0
+} -64.0
+{ -64.0
+    140.7500    126.5000 -64.0
+    142.5000    125.7500 -64.0
+    146.2500    133.5000 -64.0
+    145.5000    135.2500 -64.0
+    146.2500    137.5000 -64.0
+    145.5000    139.2500 -64.0
+    141.7500    134.5000 -64.0
+    142.7500    132.5000 -64.0
+} -64.0
+{ -64.0
+     71.5000    126.7500 -64.0
+     73.2500    127.5000 -64.0
+     70.5000    129.2500 -64.0
+     69.7500    128.5000 -64.0
+} -64.0
+{ -64.0
+     53.7500    130.5000 -64.0
+     54.5000    129.7500 -64.0
+     56.5000    129.7500 -64.0
+     60.2500    133.5000 -64.0
+     60.2500    135.5000 -64.0
+     61.5000    136.7500 -64.0
+     63.5000    137.7500 -64.0
+     65.2500    138.5000 -64.0
+     64.2500    140.5000 -64.0
+     61.5000    142.2500 -64.0
+     59.5000    142.2500 -64.0
+     56.5000    145.2500 -64.0
+     54.7500    144.5000 -64.0
+     54.7500    141.5000 -64.0
+     53.2500    141.5000 -64.0
+     54.2500    143.5000 -64.0
+     52.5000    146.2500 -64.0
+     51.7500    145.5000 -64.0
+     49.5000    145.2500 -64.0
+     48.5000    147.2500 -64.0
+     44.5000    147.2500 -64.0
+     42.5000    149.2500 -64.0
+     42.2500    151.5000 -64.0
+     40.5000    152.2500 -64.0
+     38.7500    149.5000 -64.0
+     38.7500    145.5000 -64.0
+     40.7500    144.5000 -64.0
+     41.7500    142.5000 -64.0
+     38.5000    142.2500 -64.0
+     37.7500    140.5000 -64.0
+     39.5000    139.7500 -64.0
+     40.5000    137.7500 -64.0
+     42.5000    137.7500 -64.0
+     42.7500    136.5000 -64.0
+     41.7500    134.5000 -64.0
+     43.5000    132.7500 -64.0
+     45.5000    133.7500 -64.0
+     45.7500    131.5000 -64.0
+     47.5000    130.7500 -64.0
+     49.2500    131.5000 -64.0
+     48.2500    133.5000 -64.0
+     50.5000    133.7500 -64.0
+     50.7500    132.5000 -64.0
+} -64.0
+{ -64.0
+    160.7500    154.5000 -64.0
+    161.5000    153.7500 -64.0
+    163.2500    154.5000 -64.0
+    162.5000    155.2500 -64.0
+} -64.0
+v 424 z -126.000000 -64.0
+{ -64.0
+    110.2500     34.5000 -64.0
+    110.2500     37.5000 -64.0
+    109.5000     39.2500 -64.0
+    109.2500     43.5000 -64.0
+    110.5000     43.7500 -64.0
+    111.5000     41.7500 -64.0
+    111.7500     34.5000 -64.0
+} -64.0
+{ -64.0
+     97.2500     43.5000 -64.0
+     92.2500     48.5000 -64.0
+     91.2500     50.5000 -64.0
+     92.7500     51.5000 -64.0
+     98.7500     43.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500     43.5000 -64.0
+    120.2500     44.5000 -64.0
+    123.2500     47.5000 -64.0
+    126.2500     52.5000 -64.0
+    127.5000     54.7500 -64.0
+    131.2500     57.5000 -64.0
+    132.7500     57.5000 -64.0
+    127.7500     53.5000 -64.0
+    127.7500     51.5000 -64.0
+    121.7500     43.5000 -64.0
+} -64.0
+{ -64.0
+    109.2500     50.5000 -64.0
+    109.2500     55.5000 -64.0
+    110.5000     53.7500 -64.0
+    110.7500     51.5000 -64.0
+} -64.0
+{ -64.0
+     66.2500     55.5000 -64.0
+     65.5000     56.2500 -64.0
+     63.5000     56.2500 -64.0
+     59.5000     59.2500 -64.0
+     56.2500     63.5000 -64.0
+     55.2500     65.5000 -64.0
+     52.5000     71.2500 -64.0
+     52.2500     73.5000 -64.0
+     63.5000     62.7500 -64.0
+     67.5000     62.7500 -64.0
+     71.7500     64.5000 -64.0
+     70.7500     61.5000 -64.0
+     68.5000     60.2500 -64.0
+     66.5000     61.2500 -64.0
+     65.7500     60.5000 -64.0
+     64.7500     58.5000 -64.0
+     68.5000     55.7500 -64.0
+     75.7500     55.5000 -64.0
+} -64.0
+{ -64.0
+    143.2500     57.5000 -64.0
+    141.2500     58.5000 -64.0
+    145.2500     59.5000 -64.0
+    151.5000     59.7500 -64.0
+    153.2500     61.5000 -64.0
+    152.5000     63.2500 -64.0
+    147.2500     63.5000 -64.0
+    145.2500     67.5000 -64.0
+    147.5000     65.7500 -64.0
+    149.5000     65.7500 -64.0
+    151.5000     64.7500 -64.0
+    152.2500     65.5000 -64.0
+    153.5000     64.7500 -64.0
+    155.5000     65.7500 -64.0
+    159.5000     70.7500 -64.0
+    161.5000     71.7500 -64.0
+    161.7500     69.5000 -64.0
+    159.7500     64.5000 -64.0
+    152.7500     58.5000 -64.0
+} -64.0
+{ -64.0
+     59.2500     76.5000 -64.0
+     58.2500     79.5000 -64.0
+     59.7500     80.5000 -64.0
+     61.7500     76.5000 -64.0
+} -64.0
+{ -64.0
+    153.2500     79.5000 -64.0
+    152.2500     82.5000 -64.0
+    153.5000     85.7500 -64.0
+    155.5000     86.7500 -64.0
+    155.7500     81.5000 -64.0
+    154.7500     79.5000 -64.0
+} -64.0
+{ -64.0
+     88.2500     86.5000 -64.0
+     87.5000     87.2500 -64.0
+     88.5000     87.7500 -64.0
+     89.7500     86.5000 -64.0
+} -64.0
+{ -64.0
+    107.2500     87.5000 -64.0
+    107.2500     89.5000 -64.0
+    107.7500     88.5000 -64.0
+} -64.0
+{ -64.0
+    127.2500     87.5000 -64.0
+    127.2500     88.5000 -64.0
+    129.5000     89.7500 -64.0
+    129.7500     87.5000 -64.0
+} -64.0
+{ -64.0
+    123.2500     88.5000 -64.0
+    123.2500     90.5000 -64.0
+    124.5000     89.7500 -64.0
+} -64.0
+{ -64.0
+     93.2500     89.5000 -64.0
+     92.2500     91.5000 -64.0
+     93.5000     92.7500 -64.0
+} -64.0
+{ -64.0
+    124.2500     93.5000 -64.0
+    126.2500     95.5000 -64.0
+    127.5000     94.7500 -64.0
+    126.7500     93.5000 -64.0
+} -64.0
+{ -64.0
+     50.2500     97.5000 -64.0
+     47.5000     99.2500 -64.0
+     45.5000     99.2500 -64.0
+     44.2500    102.5000 -64.0
+     45.2500    105.5000 -64.0
+     47.5000    105.7500 -64.0
+     50.5000    104.7500 -64.0
+     52.2500    105.5000 -64.0
+     54.5000    104.7500 -64.0
+     54.7500    100.5000 -64.0
+} -64.0
+{ -64.0
+     73.2500    106.5000 -64.0
+     67.5000    110.2500 -64.0
+     66.7500    109.5000 -64.0
+     64.2500    109.5000 -64.0
+     67.2500    113.5000 -64.0
+     67.2500    117.5000 -64.0
+     65.5000    119.2500 -64.0
+     59.5000    121.2500 -64.0
+     55.7500    119.5000 -64.0
+     57.5000    118.7500 -64.0
+     54.7500    117.5000 -64.0
+     53.5000    118.2500 -64.0
+     49.5000    118.2500 -64.0
+     48.5000    120.2500 -64.0
+     48.5000    123.7500 -64.0
+     50.5000    122.7500 -64.0
+     56.5000    122.7500 -64.0
+     62.5000    120.7500 -64.0
+     66.5000    120.7500 -64.0
+     68.5000    119.7500 -64.0
+     70.5000    119.7500 -64.0
+     72.5000    117.7500 -64.0
+     75.5000    117.7500 -64.0
+     77.2500    119.5000 -64.0
+     77.2500    121.5000 -64.0
+     74.5000    124.2500 -64.0
+     70.7500    122.5000 -64.0
+     68.2500    127.5000 -64.0
+     70.2500    128.5000 -64.0
+     69.5000    130.2500 -64.0
+     68.5000    129.2500 -64.0
+     66.5000    130.2500 -64.0
+     62.5000    130.2500 -64.0
+     60.7500    128.5000 -64.0
+     58.5000    128.2500 -64.0
+     55.5000    129.2500 -64.0
+     61.2500    134.5000 -64.0
+     62.2500    136.5000 -64.0
+     63.5000    136.7500 -64.0
+     64.2500    138.5000 -64.0
+     60.5000    142.2500 -64.0
+     58.5000    142.2500 -64.0
+     57.5000    144.2500 -64.0
+     53.5000    146.2500 -64.0
+     51.7500    144.5000 -64.0
+     49.5000    145.2500 -64.0
+     49.2500    149.5000 -64.0
+     47.5000    150.2500 -64.0
+     45.2500    158.5000 -64.0
+     43.5000    159.2500 -64.0
+     41.7500    156.5000 -64.0
+     41.7500    152.5000 -64.0
+     38.7500    149.5000 -64.0
+     37.7500    147.5000 -64.0
+     38.7500    144.5000 -64.0
+     40.7500    143.5000 -64.0
+     39.7500    141.5000 -64.0
+     43.5000    135.7500 -64.0
+     48.5000    136.7500 -64.0
+     46.7500    134.5000 -64.0
+     41.7500    133.5000 -64.0
+     42.5000    132.7500 -64.0
+     46.5000    132.7500 -64.0
+     48.5000    130.7500 -64.0
+     49.2500    131.5000 -64.0
+     53.5000    131.7500 -64.0
+     54.7500    130.5000 -64.0
+     42.5000    129.2500 -64.0
+     39.2500    133.5000 -64.0
+     35.5000    141.2500 -64.0
+     35.2500    148.5000 -64.0
+     34.2500    153.5000 -64.0
+     35.2500    155.5000 -64.0
+     35.2500    159.5000 -64.0
+     36.2500    161.5000 -64.0
+     37.2500    170.5000 -64.0
+     39.2500    174.5000 -64.0
+     39.2500    176.5000 -64.0
+     44.2500    186.5000 -64.0
+     48.2500    190.5000 -64.0
+     59.2500    207.5000 -64.0
+     67.2500    215.5000 -64.0
+     71.5000    218.7500 -64.0
+     79.5000    222.7500 -64.0
+     86.2500    224.5000 -64.0
+    101.5000    224.7500 -64.0
+    103.5000    223.7500 -64.0
+    114.5000    224.7500 -64.0
+    116.5000    223.7500 -64.0
+    120.5000    223.7500 -64.0
+    126.5000    221.7500 -64.0
+    136.5000    215.7500 -64.0
+    147.5000    204.7500 -64.0
+    151.7500    198.5000 -64.0
+    158.5000    190.7500 -64.0
+    165.7500    179.5000 -64.0
+    170.7500    169.5000 -64.0
+    173.5000    157.7500 -64.0
+    173.7500    147.5000 -64.0
+    172.7500    145.5000 -64.0
+    171.7500    139.5000 -64.0
+    166.7500    133.5000 -64.0
+    163.5000    133.2500 -64.0
+    160.5000    134.2500 -64.0
+    155.7500    132.5000 -64.0
+    154.5000    133.2500 -64.0
+    152.7500    128.5000 -64.0
+    154.5000    126.7500 -64.0
+    161.5000    122.7500 -64.0
+    160.5000    122.2500 -64.0
+    156.5000    124.2500 -64.0
+    149.5000    124.2500 -64.0
+    136.5000    119.2500 -64.0
+    140.2500    124.5000 -64.0
+    137.5000    127.2500 -64.0
+    134.5000    127.2500 -64.0
+    133.2500    134.5000 -64.0
+    134.5000    134.7500 -64.0
+    134.7500    132.5000 -64.0
+    137.5000    129.7500 -64.0
+    141.2500    130.5000 -64.0
+    141.2500    135.5000 -64.0
+    137.2500    138.5000 -64.0
+    146.5000    141.7500 -64.0
+    147.2500    143.5000 -64.0
+    150.2500    145.5000 -64.0
+    152.5000    145.7500 -64.0
+    156.2500    148.5000 -64.0
+    162.2500    156.5000 -64.0
+    162.2500    158.5000 -64.0
+    163.2500    160.5000 -64.0
+    163.2500    164.5000 -64.0
+    154.2500    181.5000 -64.0
+    149.5000    187.2500 -64.0
+    146.5000    192.2500 -64.0
+    146.2500    194.5000 -64.0
+    143.5000    200.2500 -64.0
+    131.5000    209.2500 -64.0
+    117.5000    217.2500 -64.0
+    114.5000    217.2500 -64.0
+    109.5000    211.2500 -64.0
+    107.5000    212.2500 -64.0
+    105.5000    212.2500 -64.0
+    102.7500    208.5000 -64.0
+    101.5000    208.2500 -64.0
+     95.5000    215.2500 -64.0
+     83.5000    215.2500 -64.0
+     74.5000    211.2500 -64.0
+     68.5000    205.2500 -64.0
+     64.5000    203.2500 -64.0
+     59.7500    195.5000 -64.0
+     59.7500    193.5000 -64.0
+     53.7500    181.5000 -64.0
+     47.7500    174.5000 -64.0
+     47.7500    169.5000 -64.0
+     46.7500    167.5000 -64.0
+     46.7500    153.5000 -64.0
+     50.5000    150.7500 -64.0
+     52.5000    150.7500 -64.0
+     55.7500    148.5000 -64.0
+     58.5000    144.7500 -64.0
+     65.5000    140.7500 -64.0
+     75.5000    136.7500 -64.0
+     79.5000    132.7500 -64.0
+     77.7500    130.5000 -64.0
+     78.5000    128.7500 -64.0
+     79.2500    129.5000 -64.0
+     85.5000    129.7500 -64.0
+     85.7500    126.5000 -64.0
+     83.7500    125.5000 -64.0
+     82.7500    123.5000 -64.0
+     84.5000    121.7500 -64.0
+     84.7500    118.5000 -64.0
+     81.5000    120.2500 -64.0
+     80.7500    119.5000 -64.0
+     81.7500    116.5000 -64.0
+     79.7500    114.5000 -64.0
+     76.5000    114.2500 -64.0
+     74.7500    111.5000 -64.0
+     74.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+     47.2500    108.5000 -64.0
+     47.5000    108.7500 -64.0
+     49.5000    109.7500 -64.0
+     53.2500    111.5000 -64.0
+     53.7500    110.5000 -64.0
+     51.7500    108.5000 -64.0
+} -64.0
+{ -64.0
+    102.2500    110.5000 -64.0
+     96.5000    113.2500 -64.0
+     93.5000    117.7500 -64.0
+     99.5000    113.7500 -64.0
+    102.5000    113.7500 -64.0
+    105.5000    112.7500 -64.0
+    110.5000    113.7500 -64.0
+    111.2500    115.5000 -64.0
+    113.5000    115.7500 -64.0
+    119.2500    119.5000 -64.0
+    119.7500    118.5000 -64.0
+    118.5000    118.2500 -64.0
+    116.5000    115.2500 -64.0
+    112.5000    113.2500 -64.0
+    109.5000    110.2500 -64.0
+    106.5000    111.2500 -64.0
+} -64.0
+{ -64.0
+    161.2500    111.5000 -64.0
+    149.5000    117.2500 -64.0
+    150.2500    119.5000 -64.0
+    160.5000    113.7500 -64.0
+    163.5000    113.7500 -64.0
+    164.7500    115.5000 -64.0
+    165.7500    113.5000 -64.0
+    164.7500    111.5000 -64.0
+} -64.0
+{ -64.0
+    136.2500    113.5000 -64.0
+    135.2500    116.5000 -64.0
+    136.5000    117.7500 -64.0
+    138.5000    116.7500 -64.0
+    140.5000    116.7500 -64.0
+    140.7500    115.5000 -64.0
+    137.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+     57.2500    114.5000 -64.0
+     58.2500    116.5000 -64.0
+     59.7500    116.5000 -64.0
+     58.7500    114.5000 -64.0
+} -64.0
+{ -64.0
+    162.2500    117.5000 -64.0
+    160.5000    118.2500 -64.0
+    159.5000    119.7500 -64.0
+    162.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+    105.2500    118.5000 -64.0
+    105.2500    119.5000 -64.0
+    110.5000    119.7500 -64.0
+    108.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+    101.2500    119.5000 -64.0
+    100.5000    120.2500 -64.0
+     98.5000    120.2500 -64.0
+     95.2500    123.5000 -64.0
+     93.2500    127.5000 -64.0
+     99.5000    121.7500 -64.0
+    103.7500    119.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500    121.5000 -64.0
+    117.5000    128.7500 -64.0
+    117.7500    124.5000 -64.0
+    114.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500    122.5000 -64.0
+    122.2500    123.5000 -64.0
+    126.2500    129.5000 -64.0
+    125.5000    131.2500 -64.0
+    119.5000    131.2500 -64.0
+    120.2500    132.5000 -64.0
+    124.5000    133.7500 -64.0
+    128.5000    131.7500 -64.0
+    128.7500    127.5000 -64.0
+    126.7500    125.5000 -64.0
+} -64.0
+{ -64.0
+     43.2500    147.5000 -64.0
+     42.5000    151.2500 -64.0
+     43.7500    152.5000 -64.0
+     44.7500    150.5000 -64.0
+} -64.0
+{ -64.0
+     59.7500     61.5000 -64.0
+     60.5000     60.7500 -64.0
+     62.2500     61.5000 -64.0
+     58.5000     65.2500 -64.0
+     57.7500     64.5000 -64.0
+} -64.0
+{ -64.0
+     71.5000    109.7500 -64.0
+     73.2500    110.5000 -64.0
+     71.5000    112.2500 -64.0
+     69.7500    111.5000 -64.0
+} -64.0
+{ -64.0
+     76.7500    124.5000 -64.0
+     78.5000    123.7500 -64.0
+     79.2500    125.5000 -64.0
+     77.5000    127.2500 -64.0
+     75.7500    126.5000 -64.0
+} -64.0
+{ -64.0
+     80.7500    126.5000 -64.0
+     81.5000    125.7500 -64.0
+     82.2500    126.5000 -64.0
+     81.5000    127.2500 -64.0
+} -64.0
+{ -64.0
+    141.7500    126.5000 -64.0
+    142.5000    125.7500 -64.0
+    143.2500    126.5000 -64.0
+    142.5000    127.2500 -64.0
+} -64.0
+{ -64.0
+    142.7500    131.5000 -64.0
+    143.5000    130.7500 -64.0
+    145.5000    130.7500 -64.0
+    147.2500    132.5000 -64.0
+    148.2500    134.5000 -64.0
+    146.5000    135.2500 -64.0
+    146.2500    137.5000 -64.0
+    147.2500    139.5000 -64.0
+    146.5000    140.2500 -64.0
+    142.7500    136.5000 -64.0
+} -64.0
+{ -64.0
+    152.7500    135.5000 -64.0
+    153.5000    134.7500 -64.0
+    157.5000    134.7500 -64.0
+    159.2500    135.5000 -64.0
+    160.5000    134.7500 -64.0
+    162.2500    135.5000 -64.0
+    165.2500    139.5000 -64.0
+    167.5000    139.7500 -64.0
+    169.2500    141.5000 -64.0
+    168.5000    143.2500 -64.0
+    169.2500    144.5000 -64.0
+    168.5000    146.2500 -64.0
+    170.2500    148.5000 -64.0
+    171.2500    150.5000 -64.0
+    169.5000    152.2500 -64.0
+    171.2500    154.5000 -64.0
+    171.2500    157.5000 -64.0
+    165.5000    160.2500 -64.0
+    162.7500    157.5000 -64.0
+    163.5000    156.7500 -64.0
+    163.7500    154.5000 -64.0
+    164.5000    152.7500 -64.0
+    164.5000    150.2500 -64.0
+    162.5000    153.2500 -64.0
+    161.5000    152.2500 -64.0
+    156.7500    145.5000 -64.0
+    156.7500    143.5000 -64.0
+    153.5000    143.2500 -64.0
+    149.7500    140.5000 -64.0
+    149.7500    137.5000 -64.0
+} -64.0
+{ -64.0
+    140.7500    138.5000 -64.0
+    141.5000    137.7500 -64.0
+    143.2500    138.5000 -64.0
+    142.5000    139.2500 -64.0
+} -64.0
+v 396 z -128.000000 -64.0
+{ -64.0
+    111.2500     35.5000 -64.0
+    110.5000     36.2500 -64.0
+    108.5000     37.2500 -64.0
+    108.2500     38.5000 -64.0
+    110.2500     40.5000 -64.0
+    113.5000     40.7500 -64.0
+    113.7500     38.5000 -64.0
+} -64.0
+{ -64.0
+    100.2500     41.5000 -64.0
+     99.5000     42.2500 -64.0
+     97.5000     43.2500 -64.0
+     92.5000     48.2500 -64.0
+     91.2500     54.5000 -64.0
+     92.5000     54.7500 -64.0
+     92.7500     51.5000 -64.0
+     95.5000     47.7500 -64.0
+     97.5000     46.7500 -64.0
+     99.5000     43.7500 -64.0
+    101.5000     42.7500 -64.0
+    101.7500     41.5000 -64.0
+} -64.0
+{ -64.0
+    109.2500     41.5000 -64.0
+    109.2500     43.5000 -64.0
+    110.7500     44.5000 -64.0
+} -64.0
+{ -64.0
+    118.2500     42.5000 -64.0
+    118.2500     43.5000 -64.0
+    122.2500     46.5000 -64.0
+    121.5000     47.7500 -64.0
+    123.5000     48.7500 -64.0
+    127.2500     54.5000 -64.0
+    127.5000     56.7500 -64.0
+    127.7500     51.5000 -64.0
+    123.5000     45.2500 -64.0
+    119.7500     42.5000 -64.0
+} -64.0
+{ -64.0
+    110.2500     51.5000 -64.0
+    109.5000     52.2500 -64.0
+    109.2500     57.5000 -64.0
+    110.5000     55.7500 -64.0
+    110.7500     52.5000 -64.0
+} -64.0
+{ -64.0
+     67.2500     55.5000 -64.0
+     62.5000     57.2500 -64.0
+     59.5000     60.2500 -64.0
+     56.5000     65.2500 -64.0
+     56.2500     68.5000 -64.0
+     64.5000     61.7500 -64.0
+     68.5000     61.7500 -64.0
+     73.7500     65.5000 -64.0
+     71.7500     60.5000 -64.0
+     66.5000     60.2500 -64.0
+     65.7500     58.5000 -64.0
+     67.5000     56.7500 -64.0
+     75.7500     56.5000 -64.0
+} -64.0
+{ -64.0
+    140.2500     58.5000 -64.0
+    140.2500     59.5000 -64.0
+    142.5000     59.7500 -64.0
+    144.2500     61.5000 -64.0
+    144.2500     66.5000 -64.0
+    145.5000     66.7500 -64.0
+    149.5000     63.7500 -64.0
+    154.5000     63.7500 -64.0
+    154.7500     62.5000 -64.0
+    151.7500     59.5000 -64.0
+    146.5000     59.2500 -64.0
+    144.7500     58.5000 -64.0
+} -64.0
+{ -64.0
+     60.2500     75.5000 -64.0
+     59.5000     76.2500 -64.0
+     59.5000     81.7500 -64.0
+     61.5000     80.7500 -64.0
+     61.7500     76.5000 -64.0
+} -64.0
+{ -64.0
+    153.2500     79.5000 -64.0
+    152.5000     80.2500 -64.0
+    152.2500     85.5000 -64.0
+    153.5000     86.7500 -64.0
+    155.5000     87.7500 -64.0
+    155.7500     84.5000 -64.0
+    154.7500     82.5000 -64.0
+    154.7500     79.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500     80.5000 -64.0
+     92.2500     81.5000 -64.0
+     93.2500     83.5000 -64.0
+     91.5000     85.2500 -64.0
+     93.2500     88.5000 -64.0
+     93.5000     90.7500 -64.0
+     93.7500     81.5000 -64.0
+} -64.0
+{ -64.0
+    124.2500     82.5000 -64.0
+    123.2500     84.5000 -64.0
+    125.5000     83.7500 -64.0
+} -64.0
+{ -64.0
+     88.2500     83.5000 -64.0
+     87.5000     84.2500 -64.0
+     87.5000     86.7500 -64.0
+     89.5000     85.7500 -64.0
+} -64.0
+{ -64.0
+    126.2500     84.5000 -64.0
+    126.2500     87.5000 -64.0
+    129.5000     87.7500 -64.0
+    131.7500     85.5000 -64.0
+} -64.0
+{ -64.0
+    123.2500     87.5000 -64.0
+    123.2500     88.5000 -64.0
+    122.2500     91.5000 -64.0
+    123.5000     91.7500 -64.0
+    125.2500     92.5000 -64.0
+    126.7500     92.5000 -64.0
+    127.7500     90.5000 -64.0
+    126.5000     90.2500 -64.0
+    124.7500     89.5000 -64.0
+    124.7500     87.5000 -64.0
+} -64.0
+{ -64.0
+     48.2500    100.5000 -64.0
+     46.2500    102.5000 -64.0
+     48.7500    102.5000 -64.0
+     49.7500    100.5000 -64.0
+} -64.0
+{ -64.0
+     46.2500    107.5000 -64.0
+     44.5000    109.7500 -64.0
+     46.5000    108.7500 -64.0
+     54.5000    112.7500 -64.0
+     52.5000    110.2500 -64.0
+     48.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+     71.2500    109.5000 -64.0
+     67.5000    112.2500 -64.0
+     69.2500    116.5000 -64.0
+     67.5000    118.2500 -64.0
+     61.5000    121.2500 -64.0
+     58.5000    121.2500 -64.0
+     55.5000    120.2500 -64.0
+     50.5000    119.2500 -64.0
+     48.5000    120.2500 -64.0
+     49.2500    121.5000 -64.0
+     53.2500    122.5000 -64.0
+     60.5000    122.7500 -64.0
+     62.5000    121.7500 -64.0
+     64.5000    121.7500 -64.0
+     66.5000    122.7500 -64.0
+     68.5000    121.7500 -64.0
+     70.5000    121.7500 -64.0
+     70.7500    119.5000 -64.0
+     72.5000    117.7500 -64.0
+     76.5000    117.7500 -64.0
+     78.5000    116.7500 -64.0
+     78.5000    115.2500 -64.0
+     74.7500    113.5000 -64.0
+     74.7500    111.5000 -64.0
+     73.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+    160.2500    110.5000 -64.0
+    159.5000    111.2500 -64.0
+    155.5000    114.2500 -64.0
+    150.5000    117.2500 -64.0
+    152.5000    119.7500 -64.0
+    152.7500    117.5000 -64.0
+    155.5000    115.7500 -64.0
+    157.5000    115.7500 -64.0
+    159.5000    113.7500 -64.0
+    161.2500    114.5000 -64.0
+    160.2500    117.5000 -64.0
+    157.5000    119.2500 -64.0
+    158.5000    119.7500 -64.0
+    161.5000    118.7500 -64.0
+    164.5000    114.7500 -64.0
+    164.7500    112.5000 -64.0
+    161.7500    110.5000 -64.0
+} -64.0
+{ -64.0
+    102.2500    112.5000 -64.0
+    101.5000    113.2500 -64.0
+     99.5000    113.2500 -64.0
+     96.5000    114.2500 -64.0
+     94.2500    116.5000 -64.0
+     97.5000    116.7500 -64.0
+     99.5000    115.7500 -64.0
+    101.5000    115.7500 -64.0
+    105.5000    113.7500 -64.0
+    108.5000    114.7500 -64.0
+    109.2500    116.5000 -64.0
+    112.5000    116.7500 -64.0
+    114.2500    118.5000 -64.0
+    118.5000    119.7500 -64.0
+    117.5000    117.2500 -64.0
+    113.7500    114.5000 -64.0
+    111.5000    114.2500 -64.0
+    109.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+     55.2500    113.5000 -64.0
+     58.2500    115.5000 -64.0
+     59.7500    115.5000 -64.0
+     56.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+    136.2500    114.5000 -64.0
+    137.2500    116.5000 -64.0
+    138.7500    116.5000 -64.0
+    139.7500    114.5000 -64.0
+} -64.0
+{ -64.0
+    101.2500    119.5000 -64.0
+     99.5000    120.2500 -64.0
+     94.5000    126.2500 -64.0
+     94.2500    128.5000 -64.0
+     95.7500    125.5000 -64.0
+     98.5000    122.7500 -64.0
+    103.5000    119.7500 -64.0
+    107.5000    119.7500 -64.0
+    112.5000    121.7500 -64.0
+    115.2500    124.5000 -64.0
+    118.5000    130.7500 -64.0
+    118.7500    128.5000 -64.0
+    117.7500    126.5000 -64.0
+    117.7500    124.5000 -64.0
+    115.5000    122.2500 -64.0
+    109.7500    119.5000 -64.0
+} -64.0
+{ -64.0
+     79.2500    121.5000 -64.0
+     73.5000    124.2500 -64.0
+     71.5000    128.2500 -64.0
+     68.5000    128.2500 -64.0
+     66.5000    131.2500 -64.0
+     61.7500    128.5000 -64.0
+     58.5000    128.2500 -64.0
+     53.2500    130.5000 -64.0
+     55.5000    130.7500 -64.0
+     59.5000    132.7500 -64.0
+     61.2500    136.5000 -64.0
+     63.5000    136.7500 -64.0
+     67.5000    133.7500 -64.0
+     68.2500    135.5000 -64.0
+     66.5000    137.2500 -64.0
+     64.5000    137.2500 -64.0
+     64.2500    138.5000 -64.0
+     65.5000    137.7500 -64.0
+     70.5000    137.7500 -64.0
+     75.5000    135.7500 -64.0
+     78.7500    131.5000 -64.0
+     77.7500    129.5000 -64.0
+     77.7500    127.5000 -64.0
+     81.5000    125.7500 -64.0
+     83.2500    126.5000 -64.0
+     86.2500    131.5000 -64.0
+     92.7500    131.5000 -64.0
+     88.5000    130.2500 -64.0
+     84.7500    126.5000 -64.0
+     86.7500    122.5000 -64.0
+     82.5000    124.2500 -64.0
+     81.7500    122.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500    121.5000 -64.0
+    120.2500    122.5000 -64.0
+    126.2500    128.5000 -64.0
+    127.2500    130.5000 -64.0
+    125.5000    132.2500 -64.0
+    119.5000    132.2500 -64.0
+    120.5000    133.7500 -64.0
+    125.5000    134.7500 -64.0
+    129.5000    132.7500 -64.0
+    129.7500    128.5000 -64.0
+    128.7500    126.5000 -64.0
+    126.5000    126.2500 -64.0
+    124.7500    124.5000 -64.0
+} -64.0
+{ -64.0
+    139.2500    121.5000 -64.0
+    141.2500    123.5000 -64.0
+    142.2500    130.5000 -64.0
+    144.5000    130.7500 -64.0
+    148.2500    132.5000 -64.0
+    147.2500    135.5000 -64.0
+    149.2500    136.5000 -64.0
+    148.5000    137.2500 -64.0
+    145.5000    137.2500 -64.0
+    142.5000    136.2500 -64.0
+    141.5000    134.2500 -64.0
+    138.2500    139.5000 -64.0
+    142.5000    136.7500 -64.0
+    146.2500    139.5000 -64.0
+    145.5000    140.2500 -64.0
+    142.5000    139.2500 -64.0
+    142.2500    140.5000 -64.0
+    144.5000    140.7500 -64.0
+    149.2500    144.5000 -64.0
+    152.5000    144.7500 -64.0
+    155.2500    147.5000 -64.0
+    162.2500    157.5000 -64.0
+    162.2500    163.5000 -64.0
+    160.5000    164.2500 -64.0
+    157.2500    163.5000 -64.0
+    156.2500    170.5000 -64.0
+    157.2500    172.5000 -64.0
+    154.2500    179.5000 -64.0
+    147.2500    188.5000 -64.0
+    144.2500    195.5000 -64.0
+    141.5000    199.2500 -64.0
+    124.5000    211.2500 -64.0
+    122.5000    211.2500 -64.0
+    118.5000    214.2500 -64.0
+    115.5000    214.2500 -64.0
+    109.7500    209.5000 -64.0
+    108.5000    210.2500 -64.0
+    105.5000    210.2500 -64.0
+    103.7500    208.5000 -64.0
+    103.7500    205.5000 -64.0
+    100.2500    205.5000 -64.0
+     98.2500    209.5000 -64.0
+     94.5000    213.2500 -64.0
+     87.5000    213.2500 -64.0
+     85.5000    214.2500 -64.0
+     79.5000    212.2500 -64.0
+     72.5000    207.2500 -64.0
+     71.5000    205.2500 -64.0
+     63.7500    199.5000 -64.0
+     61.7500    195.5000 -64.0
+     61.7500    192.5000 -64.0
+     60.7500    189.5000 -64.0
+     56.7500    184.5000 -64.0
+     48.7500    169.5000 -64.0
+     48.7500    166.5000 -64.0
+     47.7500    164.5000 -64.0
+     47.7500    155.5000 -64.0
+     51.5000    150.7500 -64.0
+     56.7500    146.5000 -64.0
+     59.5000    142.7500 -64.0
+     63.5000    139.7500 -64.0
+     62.5000    139.2500 -64.0
+     51.5000    146.2500 -64.0
+     49.5000    146.2500 -64.0
+     45.2500    157.5000 -64.0
+     43.5000    158.2500 -64.0
+     41.7500    157.5000 -64.0
+     40.7500    149.5000 -64.0
+     38.7500    148.5000 -64.0
+     38.7500    144.5000 -64.0
+     37.7500    141.5000 -64.0
+     42.5000    135.7500 -64.0
+     45.5000    137.7500 -64.0
+     46.5000    135.7500 -64.0
+     45.7500    133.5000 -64.0
+     46.5000    131.7500 -64.0
+     50.2500    132.5000 -64.0
+     52.7500    131.5000 -64.0
+     44.7500    129.5000 -64.0
+     42.5000    130.2500 -64.0
+     39.2500    134.5000 -64.0
+     37.2500    138.5000 -64.0
+     35.5000    146.2500 -64.0
+     35.2500    155.5000 -64.0
+     37.2500    161.5000 -64.0
+     37.2500    168.5000 -64.0
+     39.2500    172.5000 -64.0
+     39.2500    174.5000 -64.0
+     42.2500    180.5000 -64.0
+     59.2500    205.5000 -64.0
+     66.5000    212.7500 -64.0
+     74.5000    218.7500 -64.0
+     80.5000    221.7500 -64.0
+     90.5000    223.7500 -64.0
+     92.5000    222.7500 -64.0
+     97.5000    223.7500 -64.0
+     99.5000    222.7500 -64.0
+    100.2500    223.5000 -64.0
+    102.5000    223.7500 -64.0
+    104.5000    222.7500 -64.0
+    118.5000    222.7500 -64.0
+    127.5000    219.7500 -64.0
+    135.5000    214.7500 -64.0
+    140.5000    209.7500 -64.0
+    142.5000    208.7500 -64.0
+    161.5000    185.7500 -64.0
+    161.7500    183.5000 -64.0
+    166.7500    175.5000 -64.0
+    170.5000    167.7500 -64.0
+    172.5000    158.7500 -64.0
+    172.7500    146.5000 -64.0
+    171.7500    144.5000 -64.0
+    171.7500    142.5000 -64.0
+    168.7500    136.5000 -64.0
+    164.5000    133.2500 -64.0
+    162.5000    134.2500 -64.0
+    158.5000    133.2500 -64.0
+    155.7500    130.5000 -64.0
+    155.7500    127.5000 -64.0
+    160.5000    122.7500 -64.0
+    159.5000    122.2500 -64.0
+    157.5000    124.2500 -64.0
+    154.5000    124.2500 -64.0
+    151.5000    125.2500 -64.0
+    143.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+    153.7500    134.5000 -64.0
+    154.5000    133.7500 -64.0
+    156.2500    134.5000 -64.0
+    161.5000    134.7500 -64.0
+    162.2500    136.5000 -64.0
+    164.2500    137.5000 -64.0
+    165.2500    139.5000 -64.0
+    167.5000    139.7500 -64.0
+    169.2500    140.5000 -64.0
+    169.2500    143.5000 -64.0
+    170.2500    145.5000 -64.0
+    168.5000    148.2500 -64.0
+    170.2500    153.5000 -64.0
+    169.5000    155.2500 -64.0
+    169.2500    158.5000 -64.0
+    167.5000    160.2500 -64.0
+    165.7500    159.5000 -64.0
+    163.7500    155.5000 -64.0
+    164.5000    153.7500 -64.0
+    163.5000    153.2500 -64.0
+    159.7500    151.5000 -64.0
+    156.7500    146.5000 -64.0
+    156.7500    144.5000 -64.0
+    155.5000    144.2500 -64.0
+    152.5000    141.2500 -64.0
+    150.5000    140.2500 -64.0
+    148.7500    139.5000 -64.0
+    149.5000    138.7500 -64.0
+    151.5000    137.7500 -64.0
+} -64.0
+v 408 z -130.000000 -64.0
+{ -64.0
+    104.2500     39.5000 -64.0
+     94.2500     45.5000 -64.0
+     92.2500     49.5000 -64.0
+     93.5000     49.7500 -64.0
+     93.7500     48.5000 -64.0
+     95.7500     47.5000 -64.0
+     96.7500     45.5000 -64.0
+    101.5000     42.7500 -64.0
+    102.2500     43.5000 -64.0
+     97.5000     48.2500 -64.0
+     97.5000     49.7500 -64.0
+    102.5000     45.7500 -64.0
+    102.7500     43.5000 -64.0
+    106.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+    107.2500     40.5000 -64.0
+    107.2500     41.5000 -64.0
+    108.5000     41.7500 -64.0
+} -64.0
+{ -64.0
+    115.2500     40.5000 -64.0
+    115.5000     41.7500 -64.0
+    119.5000     43.7500 -64.0
+    127.2500     52.5000 -64.0
+    127.7500     51.5000 -64.0
+    124.7500     45.5000 -64.0
+    116.7500     40.5000 -64.0
+} -64.0
+{ -64.0
+    109.2500     42.5000 -64.0
+    109.2500     44.5000 -64.0
+    110.5000     44.7500 -64.0
+    112.5000     43.7500 -64.0
+    110.7500     42.5000 -64.0
+} -64.0
+{ -64.0
+    114.2500     44.5000 -64.0
+    117.2500     47.5000 -64.0
+    122.2500     50.5000 -64.0
+    122.7500     49.5000 -64.0
+    115.7500     44.5000 -64.0
+} -64.0
+{ -64.0
+    110.2500     49.5000 -64.0
+    108.5000     52.2500 -64.0
+    108.5000     69.7500 -64.0
+    111.5000     57.7500 -64.0
+    111.7500     50.5000 -64.0
+} -64.0
+{ -64.0
+     67.2500     56.5000 -64.0
+     63.5000     59.2500 -64.0
+     65.2500     60.5000 -64.0
+     71.5000     61.7500 -64.0
+     74.5000     64.7500 -64.0
+     74.7500     58.5000 -64.0
+     78.7500     56.5000 -64.0
+     75.5000     56.2500 -64.0
+     72.5000     57.2500 -64.0
+     70.7500     56.5000 -64.0
+} -64.0
+{ -64.0
+    138.2500     59.5000 -64.0
+    139.5000     59.7500 -64.0
+    142.2500     63.5000 -64.0
+    142.2500     65.5000 -64.0
+    143.7500     65.5000 -64.0
+    145.7500     61.5000 -64.0
+    143.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+     61.2500     75.5000 -64.0
+     60.2500     77.5000 -64.0
+     59.2500     82.5000 -64.0
+     61.5000     82.7500 -64.0
+     62.5000     80.7500 -64.0
+     62.7500     76.5000 -64.0
+} -64.0
+{ -64.0
+    153.2500     79.5000 -64.0
+    151.2500     83.5000 -64.0
+    152.2500     85.5000 -64.0
+    152.2500     87.5000 -64.0
+    155.5000     89.7500 -64.0
+    155.7500     86.5000 -64.0
+    154.7500     84.5000 -64.0
+    154.7500     80.5000 -64.0
+} -64.0
+{ -64.0
+    126.2500     80.5000 -64.0
+    125.2500     82.5000 -64.0
+    126.2500     84.5000 -64.0
+    126.2500     86.5000 -64.0
+    131.5000     85.7500 -64.0
+    132.5000     84.2500 -64.0
+    127.5000     83.2500 -64.0
+} -64.0
+{ -64.0
+     86.2500     82.5000 -64.0
+     86.2500     84.5000 -64.0
+     87.5000     85.7500 -64.0
+     89.5000     84.7500 -64.0
+     91.2500     85.5000 -64.0
+     92.2500     87.5000 -64.0
+     93.5000     87.7500 -64.0
+     93.7500     85.5000 -64.0
+     92.7500     83.5000 -64.0
+     90.5000     84.2500 -64.0
+     89.7500     82.5000 -64.0
+} -64.0
+{ -64.0
+    123.2500     86.5000 -64.0
+    123.2500     89.5000 -64.0
+    124.7500     86.5000 -64.0
+} -64.0
+{ -64.0
+     45.2500    107.5000 -64.0
+     44.5000    108.2500 -64.0
+     44.2500    110.5000 -64.0
+     45.5000    110.7500 -64.0
+     45.7500    109.5000 -64.0
+     47.5000    108.7500 -64.0
+     49.2500    110.5000 -64.0
+     51.5000    110.7500 -64.0
+     57.5000    115.7500 -64.0
+     59.5000    116.7500 -64.0
+     59.5000    115.2500 -64.0
+     55.5000    113.2500 -64.0
+     49.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+    159.2500    109.5000 -64.0
+    152.5000    115.2500 -64.0
+    152.2500    118.5000 -64.0
+    154.2500    119.5000 -64.0
+    157.5000    119.7500 -64.0
+    161.5000    117.7500 -64.0
+    162.7500    113.5000 -64.0
+    160.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+     72.2500    110.5000 -64.0
+     68.5000    112.2500 -64.0
+     69.2500    114.5000 -64.0
+     71.2500    115.5000 -64.0
+     62.5000    121.2500 -64.0
+     54.5000    121.2500 -64.0
+     52.7500    119.5000 -64.0
+     49.5000    119.2500 -64.0
+     49.2500    120.5000 -64.0
+     60.2500    125.5000 -64.0
+     57.2500    127.5000 -64.0
+     56.2500    129.5000 -64.0
+     58.5000    132.7500 -64.0
+     60.5000    133.7500 -64.0
+     61.2500    135.5000 -64.0
+     63.5000    135.7500 -64.0
+     63.7500    134.5000 -64.0
+     62.7500    132.5000 -64.0
+     65.5000    130.7500 -64.0
+     63.7500    129.5000 -64.0
+     63.7500    127.5000 -64.0
+     65.5000    125.7500 -64.0
+     68.2500    130.5000 -64.0
+     67.5000    131.2500 -64.0
+     68.2500    132.5000 -64.0
+     67.5000    134.2500 -64.0
+     69.5000    137.7500 -64.0
+     77.7500    134.5000 -64.0
+     78.7500    132.5000 -64.0
+     77.7500    130.5000 -64.0
+     77.7500    125.5000 -64.0
+     76.7500    123.5000 -64.0
+     73.5000    123.2500 -64.0
+     71.7500    121.5000 -64.0
+     71.7500    119.5000 -64.0
+     75.7500    116.5000 -64.0
+     76.7500    114.5000 -64.0
+     74.7500    112.5000 -64.0
+     75.5000    111.7500 -64.0
+     74.7500    110.5000 -64.0
+} -64.0
+{ -64.0
+    104.2500    113.5000 -64.0
+     98.5000    116.2500 -64.0
+     95.5000    116.2500 -64.0
+     93.2500    118.5000 -64.0
+     97.5000    118.7500 -64.0
+     99.5000    117.7500 -64.0
+    102.5000    117.7500 -64.0
+    105.5000    114.7500 -64.0
+    114.2500    119.5000 -64.0
+    116.5000    119.7500 -64.0
+    115.7500    118.5000 -64.0
+    107.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+     89.2500    120.5000 -64.0
+     87.5000    122.2500 -64.0
+     83.5000    124.2500 -64.0
+     83.2500    130.5000 -64.0
+     86.2500    132.5000 -64.0
+     92.7500    132.5000 -64.0
+     93.7500    130.5000 -64.0
+     92.5000    131.2500 -64.0
+     87.5000    131.2500 -64.0
+     84.7500    128.5000 -64.0
+     84.7500    126.5000 -64.0
+     89.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+    100.2500    120.5000 -64.0
+     98.5000    121.2500 -64.0
+     94.5000    126.2500 -64.0
+     94.2500    129.5000 -64.0
+     95.5000    127.7500 -64.0
+     95.7500    125.5000 -64.0
+     97.5000    123.7500 -64.0
+    103.5000    120.7500 -64.0
+} -64.0
+{ -64.0
+    108.2500    120.5000 -64.0
+    115.5000    123.7500 -64.0
+    117.2500    126.5000 -64.0
+    119.5000    132.7500 -64.0
+    123.2500    135.5000 -64.0
+    129.5000    135.7500 -64.0
+    130.7500    128.5000 -64.0
+    129.5000    127.2500 -64.0
+    126.5000    128.2500 -64.0
+    126.2500    129.5000 -64.0
+    129.2500    130.5000 -64.0
+    126.5000    133.2500 -64.0
+    121.5000    132.2500 -64.0
+    118.7500    129.5000 -64.0
+    118.7500    127.5000 -64.0
+    116.7500    122.5000 -64.0
+    112.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+    117.2500    120.5000 -64.0
+    117.5000    121.7500 -64.0
+    123.2500    125.5000 -64.0
+    123.2500    127.5000 -64.0
+    124.7500    127.5000 -64.0
+    123.7500    124.5000 -64.0
+} -64.0
+{ -64.0
+    141.2500    121.5000 -64.0
+    141.2500    122.5000 -64.0
+    144.2500    128.5000 -64.0
+    143.2500    131.5000 -64.0
+    144.5000    130.7500 -64.0
+    146.2500    132.5000 -64.0
+    148.2500    136.5000 -64.0
+    147.2500    138.5000 -64.0
+    148.5000    138.7500 -64.0
+    150.2500    139.5000 -64.0
+    148.5000    141.2500 -64.0
+    145.5000    141.2500 -64.0
+    148.2500    143.5000 -64.0
+    151.5000    143.7500 -64.0
+    155.2500    147.5000 -64.0
+    157.2500    151.5000 -64.0
+    158.7500    150.5000 -64.0
+    156.7500    144.5000 -64.0
+    155.5000    144.2500 -64.0
+    150.7500    138.5000 -64.0
+    151.7500    136.5000 -64.0
+    154.5000    133.7500 -64.0
+    157.5000    133.7500 -64.0
+    160.5000    134.7500 -64.0
+    162.2500    135.5000 -64.0
+    163.2500    137.5000 -64.0
+    164.5000    137.7500 -64.0
+    165.2500    139.5000 -64.0
+    168.2500    141.5000 -64.0
+    168.2500    143.5000 -64.0
+    169.2500    146.5000 -64.0
+    168.5000    148.2500 -64.0
+    170.2500    150.5000 -64.0
+    170.2500    152.5000 -64.0
+    168.5000    154.2500 -64.0
+    169.2500    155.5000 -64.0
+    169.2500    159.5000 -64.0
+    166.5000    162.2500 -64.0
+    164.7500    161.5000 -64.0
+    164.5000    158.2500 -64.0
+    162.5000    157.2500 -64.0
+    160.7500    156.5000 -64.0
+    159.7500    154.5000 -64.0
+    157.5000    154.2500 -64.0
+    157.2500    155.5000 -64.0
+    156.5000    157.2500 -64.0
+    156.2500    171.5000 -64.0
+    154.2500    177.5000 -64.0
+    150.2500    182.5000 -64.0
+    147.5000    186.2500 -64.0
+    144.2500    190.5000 -64.0
+    143.2500    192.5000 -64.0
+    138.2500    197.5000 -64.0
+    134.5000    204.2500 -64.0
+    128.5000    207.2500 -64.0
+    125.5000    207.2500 -64.0
+    119.5000    210.2500 -64.0
+    116.5000    210.2500 -64.0
+    114.7500    209.5000 -64.0
+    113.7500    207.5000 -64.0
+    112.5000    207.2500 -64.0
+    110.5000    208.2500 -64.0
+    106.5000    208.2500 -64.0
+    104.7500    205.5000 -64.0
+    104.7500    202.5000 -64.0
+    102.7500    200.5000 -64.0
+    102.7500    198.5000 -64.0
+    101.5000    198.2500 -64.0
+     99.2500    203.5000 -64.0
+     93.5000    210.2500 -64.0
+     89.5000    210.2500 -64.0
+     85.5000    212.2500 -64.0
+     83.5000    212.2500 -64.0
+     80.5000    211.2500 -64.0
+     70.5000    202.2500 -64.0
+     66.5000    200.2500 -64.0
+     63.7500    196.5000 -64.0
+     63.7500    193.5000 -64.0
+     61.7500    187.5000 -64.0
+     57.7500    183.5000 -64.0
+     51.7500    172.5000 -64.0
+     48.7500    167.5000 -64.0
+     48.7500    165.5000 -64.0
+     47.7500    163.5000 -64.0
+     47.7500    161.5000 -64.0
+     46.7500    159.5000 -64.0
+     46.7500    157.5000 -64.0
+     50.7500    148.5000 -64.0
+     53.5000    146.7500 -64.0
+     57.5000    144.7500 -64.0
+     61.7500    140.5000 -64.0
+     59.5000    140.2500 -64.0
+     55.5000    143.2500 -64.0
+     53.5000    143.2500 -64.0
+     50.2500    145.5000 -64.0
+     49.2500    147.5000 -64.0
+     48.5000    149.2500 -64.0
+     46.2500    149.5000 -64.0
+     47.2500    151.5000 -64.0
+     45.2500    155.5000 -64.0
+     44.5000    157.2500 -64.0
+     42.7500    156.5000 -64.0
+     42.7500    154.5000 -64.0
+     44.5000    153.7500 -64.0
+     44.5000    152.2500 -64.0
+     42.5000    153.2500 -64.0
+     40.5000    152.2500 -64.0
+     38.7500    147.5000 -64.0
+     39.7500    144.5000 -64.0
+     37.7500    142.5000 -64.0
+     39.7500    139.5000 -64.0
+     40.7500    137.5000 -64.0
+     47.5000    134.7500 -64.0
+     46.7500    132.5000 -64.0
+     48.5000    131.7500 -64.0
+     50.5000    132.7500 -64.0
+     53.5000    131.7500 -64.0
+     53.5000    130.2500 -64.0
+     51.5000    131.2500 -64.0
+     49.5000    131.2500 -64.0
+     46.5000    130.2500 -64.0
+     44.7500    129.5000 -64.0
+     43.5000    130.2500 -64.0
+     40.2500    134.5000 -64.0
+     38.2500    138.5000 -64.0
+     37.5000    140.2500 -64.0
+     37.2500    143.5000 -64.0
+     36.5000    145.2500 -64.0
+     36.2500    155.5000 -64.0
+     37.2500    157.5000 -64.0
+     37.2500    165.5000 -64.0
+     40.2500    171.5000 -64.0
+     40.2500    173.5000 -64.0
+     47.2500    187.5000 -64.0
+     53.2500    194.5000 -64.0
+     54.2500    196.5000 -64.0
+     61.2500    204.5000 -64.0
+     62.2500    206.5000 -64.0
+     70.2500    213.5000 -64.0
+     74.5000    216.7500 -64.0
+     82.5000    220.7500 -64.0
+     84.2500    221.5000 -64.0
+    116.5000    221.7500 -64.0
+    118.5000    220.7500 -64.0
+    121.5000    220.7500 -64.0
+    129.5000    216.7500 -64.0
+    133.5000    213.7500 -64.0
+    135.5000    212.7500 -64.0
+    140.5000    207.7500 -64.0
+    142.7500    206.5000 -64.0
+    143.7500    204.5000 -64.0
+    149.7500    198.5000 -64.0
+    158.7500    188.5000 -64.0
+    169.7500    166.5000 -64.0
+    170.5000    164.7500 -64.0
+    170.7500    161.5000 -64.0
+    171.5000    159.7500 -64.0
+    171.7500    145.5000 -64.0
+    169.7500    141.5000 -64.0
+    169.7500    139.5000 -64.0
+    164.7500    133.5000 -64.0
+    160.5000    133.2500 -64.0
+    158.7500    131.5000 -64.0
+    157.7500    129.5000 -64.0
+    158.7500    124.5000 -64.0
+    157.5000    123.2500 -64.0
+    153.5000    125.2500 -64.0
+    151.5000    125.2500 -64.0
+    148.5000    124.2500 -64.0
+    145.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+    140.2500    134.5000 -64.0
+    138.5000    136.2500 -64.0
+    138.2500    138.5000 -64.0
+    139.2500    140.5000 -64.0
+    143.7500    140.5000 -64.0
+    140.5000    140.2500 -64.0
+    139.7500    138.5000 -64.0
+    140.7500    135.5000 -64.0
+} -64.0
+{ -64.0
+     63.2500    138.5000 -64.0
+     62.2500    139.5000 -64.0
+     63.7500    139.5000 -64.0
+} -64.0
+{ -64.0
+    155.7500    115.5000 -64.0
+    157.5000    114.7500 -64.0
+    159.2500    115.5000 -64.0
+    158.5000    117.2500 -64.0
+    156.5000    118.2500 -64.0
+    154.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+     66.7500    121.5000 -64.0
+     68.5000    120.7500 -64.0
+     70.2500    121.5000 -64.0
+     69.5000    123.2500 -64.0
+     67.5000    124.2500 -64.0
+     65.7500    122.5000 -64.0
+} -64.0
+{ -64.0
+     68.7500    130.5000 -64.0
+     69.5000    129.7500 -64.0
+     71.5000    129.7500 -64.0
+     73.2500    130.5000 -64.0
+     74.2500    132.5000 -64.0
+     72.5000    134.2500 -64.0
+     70.5000    134.2500 -64.0
+     68.7500    132.5000 -64.0
+} -64.0
+v 390 z -132.000000 -64.0
+{ -64.0
+    105.2500     38.5000 -64.0
+    101.5000     41.2500 -64.0
+     95.2500     43.5000 -64.0
+     92.2500     49.5000 -64.0
+     97.5000     44.7500 -64.0
+    106.7500     38.5000 -64.0
+} -64.0
+{ -64.0
+    115.2500     39.5000 -64.0
+    115.2500     40.5000 -64.0
+    118.5000     42.7500 -64.0
+    120.5000     43.7500 -64.0
+    125.2500     49.5000 -64.0
+    126.2500     51.5000 -64.0
+    128.2500     52.5000 -64.0
+    128.7500     51.5000 -64.0
+    125.7500     47.5000 -64.0
+    125.7500     45.5000 -64.0
+    124.5000     44.2500 -64.0
+    118.5000     41.2500 -64.0
+} -64.0
+{ -64.0
+    105.2500     43.5000 -64.0
+    103.5000     45.2500 -64.0
+    103.2500     47.5000 -64.0
+    101.5000     49.2500 -64.0
+    100.7500     48.5000 -64.0
+     95.5000     50.2500 -64.0
+     95.2500     53.5000 -64.0
+     96.5000     54.7500 -64.0
+    102.5000     50.7500 -64.0
+    104.2500     51.5000 -64.0
+    103.2500     54.5000 -64.0
+    106.2500     58.5000 -64.0
+    106.2500     64.5000 -64.0
+    108.2500     68.5000 -64.0
+    108.2500     73.5000 -64.0
+    109.5000     72.7500 -64.0
+    109.7500     70.5000 -64.0
+    117.5000     56.7500 -64.0
+    120.5000     56.7500 -64.0
+    124.2500     62.5000 -64.0
+    125.5000     62.7500 -64.0
+    125.7500     58.5000 -64.0
+    120.5000     51.2500 -64.0
+    116.7500     49.5000 -64.0
+    116.7500     47.5000 -64.0
+    112.7500     43.5000 -64.0
+    110.5000     43.2500 -64.0
+    108.5000     44.2500 -64.0
+    107.7500     43.5000 -64.0
+} -64.0
+{ -64.0
+     79.2500     56.5000 -64.0
+     78.5000     57.2500 -64.0
+     75.5000     57.2500 -64.0
+     73.5000     59.2500 -64.0
+     75.5000     61.7500 -64.0
+     77.5000     62.7500 -64.0
+     77.7500     59.5000 -64.0
+     80.7500     56.5000 -64.0
+} -64.0
+{ -64.0
+    135.2500     58.5000 -64.0
+    138.2500     60.5000 -64.0
+    140.2500     64.5000 -64.0
+    141.5000     63.7500 -64.0
+    141.7500     61.5000 -64.0
+    136.7500     58.5000 -64.0
+} -64.0
+{ -64.0
+     60.2500     76.5000 -64.0
+     60.2500     77.5000 -64.0
+     59.2500     84.5000 -64.0
+     60.5000     84.7500 -64.0
+     62.7500     81.5000 -64.0
+     63.7500     79.5000 -64.0
+     62.7500     76.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500     77.5000 -64.0
+     90.2500     78.5000 -64.0
+     87.5000     81.2500 -64.0
+     84.5000     81.2500 -64.0
+     86.2500     83.5000 -64.0
+     87.5000     82.7500 -64.0
+     88.2500     84.5000 -64.0
+     90.5000     84.7500 -64.0
+     92.5000     86.7500 -64.0
+     92.5000     84.2500 -64.0
+     90.5000     83.2500 -64.0
+     89.7500     81.5000 -64.0
+     91.5000     79.7500 -64.0
+} -64.0
+{ -64.0
+    126.2500     80.5000 -64.0
+    126.2500     83.5000 -64.0
+    127.2500     86.5000 -64.0
+    129.5000     84.7500 -64.0
+    132.5000     84.7500 -64.0
+    133.7500     83.5000 -64.0
+    129.7500     82.5000 -64.0
+    128.7500     80.5000 -64.0
+} -64.0
+{ -64.0
+    152.2500     80.5000 -64.0
+    151.5000     81.2500 -64.0
+    151.2500     86.5000 -64.0
+    152.2500     89.5000 -64.0
+    155.5000     92.7500 -64.0
+    155.7500     88.5000 -64.0
+    154.7500     86.5000 -64.0
+    154.7500     83.5000 -64.0
+    153.7500     80.5000 -64.0
+} -64.0
+{ -64.0
+    124.2500     85.5000 -64.0
+    123.5000     86.2500 -64.0
+    123.2500     88.5000 -64.0
+    125.5000     86.7500 -64.0
+} -64.0
+{ -64.0
+     48.2500    106.5000 -64.0
+     46.5000    107.2500 -64.0
+     46.2500    111.5000 -64.0
+     48.5000    114.7500 -64.0
+     50.5000    115.7500 -64.0
+     48.7500    112.5000 -64.0
+     49.5000    110.7500 -64.0
+     51.5000    110.7500 -64.0
+     54.5000    113.7500 -64.0
+     56.5000    114.7500 -64.0
+     57.2500    116.5000 -64.0
+     58.7500    116.5000 -64.0
+     57.7500    113.5000 -64.0
+     53.5000    111.2500 -64.0
+     50.7500    106.5000 -64.0
+} -64.0
+{ -64.0
+    157.2500    107.5000 -64.0
+    156.2500    110.5000 -64.0
+    153.5000    113.2500 -64.0
+    153.2500    116.5000 -64.0
+    154.2500    118.5000 -64.0
+    158.7500    118.5000 -64.0
+    161.5000    114.7500 -64.0
+    160.7500    113.5000 -64.0
+    160.7500    109.5000 -64.0
+    158.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+     74.2500    110.5000 -64.0
+     72.2500    111.5000 -64.0
+     71.2500    113.5000 -64.0
+     73.2500    114.5000 -64.0
+     71.5000    116.2500 -64.0
+     60.5000    122.2500 -64.0
+     57.5000    122.2500 -64.0
+     51.5000    119.2500 -64.0
+     51.2500    121.5000 -64.0
+     54.2500    124.5000 -64.0
+     55.2500    126.5000 -64.0
+     52.5000    129.2500 -64.0
+     48.5000    131.2500 -64.0
+     44.7500    129.5000 -64.0
+     42.2500    132.5000 -64.0
+     38.5000    139.2500 -64.0
+     37.5000    144.2500 -64.0
+     37.2500    156.5000 -64.0
+     38.2500    158.5000 -64.0
+     38.2500    163.5000 -64.0
+     41.2500    169.5000 -64.0
+     41.2500    172.5000 -64.0
+     49.2500    188.5000 -64.0
+     56.2500    195.5000 -64.0
+     57.2500    197.5000 -64.0
+     64.2500    205.5000 -64.0
+     77.5000    216.7500 -64.0
+     83.2500    219.5000 -64.0
+     92.5000    219.7500 -64.0
+     94.2500    220.5000 -64.0
+    108.5000    220.7500 -64.0
+    110.5000    219.7500 -64.0
+    118.5000    219.7500 -64.0
+    127.5000    216.7500 -64.0
+    135.5000    210.7500 -64.0
+    156.5000    189.7500 -64.0
+    160.7500    183.5000 -64.0
+    168.7500    167.5000 -64.0
+    171.7500    151.5000 -64.0
+    170.7500    149.5000 -64.0
+    170.5000    144.2500 -64.0
+    167.7500    137.5000 -64.0
+    159.7500    130.5000 -64.0
+    159.7500    127.5000 -64.0
+    157.5000    123.2500 -64.0
+    153.5000    125.2500 -64.0
+    150.5000    125.2500 -64.0
+    147.5000    122.2500 -64.0
+    143.5000    120.2500 -64.0
+    143.5000    125.7500 -64.0
+    147.2500    128.5000 -64.0
+    147.2500    130.5000 -64.0
+    148.5000    130.7500 -64.0
+    149.2500    132.5000 -64.0
+    147.5000    133.2500 -64.0
+    145.7500    129.5000 -64.0
+    142.5000    131.2500 -64.0
+    145.2500    132.5000 -64.0
+    149.2500    138.5000 -64.0
+    150.5000    138.7500 -64.0
+    150.7500    137.5000 -64.0
+    155.5000    132.7500 -64.0
+    156.2500    133.5000 -64.0
+    160.5000    133.7500 -64.0
+    166.2500    140.5000 -64.0
+    168.2500    146.5000 -64.0
+    167.5000    148.2500 -64.0
+    169.2500    150.5000 -64.0
+    168.5000    152.2500 -64.0
+    166.5000    152.2500 -64.0
+    169.2500    156.5000 -64.0
+    169.2500    158.5000 -64.0
+    167.5000    162.2500 -64.0
+    165.5000    163.2500 -64.0
+    163.7500    161.5000 -64.0
+    163.7500    159.5000 -64.0
+    159.7500    158.5000 -64.0
+    159.7500    155.5000 -64.0
+    157.5000    155.2500 -64.0
+    155.5000    152.2500 -64.0
+    155.2500    157.5000 -64.0
+    156.2500    159.5000 -64.0
+    156.2500    169.5000 -64.0
+    153.2500    177.5000 -64.0
+    147.5000    183.2500 -64.0
+    143.2500    189.5000 -64.0
+    135.5000    198.2500 -64.0
+    135.2500    201.5000 -64.0
+    131.5000    204.2500 -64.0
+    126.5000    203.2500 -64.0
+    123.5000    206.2500 -64.0
+    120.5000    206.2500 -64.0
+    116.7500    204.5000 -64.0
+    114.5000    204.2500 -64.0
+    110.5000    206.2500 -64.0
+    107.7500    204.5000 -64.0
+    107.7500    200.5000 -64.0
+    106.5000    197.2500 -64.0
+    104.5000    196.2500 -64.0
+    103.7500    194.5000 -64.0
+    101.2500    194.5000 -64.0
+     96.5000    202.2500 -64.0
+     94.5000    203.2500 -64.0
+     94.2500    204.5000 -64.0
+     91.5000    206.2500 -64.0
+     89.5000    206.2500 -64.0
+     85.5000    210.2500 -64.0
+     81.5000    210.2500 -64.0
+     73.7500    203.5000 -64.0
+     72.7500    201.5000 -64.0
+     67.7500    198.5000 -64.0
+     64.7500    194.5000 -64.0
+     64.7500    190.5000 -64.0
+     61.7500    184.5000 -64.0
+     57.7500    180.5000 -64.0
+     52.7500    170.5000 -64.0
+     49.7500    166.5000 -64.0
+     49.7500    164.5000 -64.0
+     47.7500    158.5000 -64.0
+     47.7500    154.5000 -64.0
+     49.7500    149.5000 -64.0
+     54.5000    144.7500 -64.0
+     64.7500    139.5000 -64.0
+     62.5000    139.2500 -64.0
+     58.5000    141.2500 -64.0
+     56.5000    141.2500 -64.0
+     51.5000    143.2500 -64.0
+     47.5000    148.2500 -64.0
+     45.5000    149.2500 -64.0
+     44.5000    152.2500 -64.0
+     42.5000    153.2500 -64.0
+     40.7500    151.5000 -64.0
+     40.7500    148.5000 -64.0
+     38.7500    147.5000 -64.0
+     40.5000    145.7500 -64.0
+     41.5000    146.7500 -64.0
+     42.7500    136.5000 -64.0
+     44.5000    135.7500 -64.0
+     48.5000    131.7500 -64.0
+     49.5000    132.7500 -64.0
+     52.5000    131.7500 -64.0
+     61.5000    132.7500 -64.0
+     61.7500    130.5000 -64.0
+     65.5000    127.7500 -64.0
+     67.2500    128.5000 -64.0
+     66.5000    129.2500 -64.0
+     68.2500    131.5000 -64.0
+     68.2500    133.5000 -64.0
+     70.2500    137.5000 -64.0
+     71.7500    137.5000 -64.0
+     72.7500    135.5000 -64.0
+     68.7500    132.5000 -64.0
+     67.7500    127.5000 -64.0
+     70.5000    124.7500 -64.0
+     75.7500    126.5000 -64.0
+     74.7500    124.5000 -64.0
+     74.7500    122.5000 -64.0
+     72.7500    120.5000 -64.0
+     72.7500    118.5000 -64.0
+     75.5000    115.7500 -64.0
+     75.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+    105.2500    114.5000 -64.0
+     99.5000    118.2500 -64.0
+     97.2500    118.5000 -64.0
+     90.5000    121.2500 -64.0
+     86.5000    125.2500 -64.0
+     84.5000    124.2500 -64.0
+     82.5000    125.2500 -64.0
+     82.5000    130.7500 -64.0
+     86.2500    133.5000 -64.0
+     91.5000    133.7500 -64.0
+     97.5000    124.7500 -64.0
+    101.5000    121.7500 -64.0
+    103.7500    121.5000 -64.0
+     99.5000    121.2500 -64.0
+     96.2500    123.5000 -64.0
+     91.5000    131.2500 -64.0
+     85.5000    131.2500 -64.0
+     83.7500    127.5000 -64.0
+     87.5000    125.7500 -64.0
+     90.5000    122.7500 -64.0
+    100.5000    118.7500 -64.0
+    106.5000    117.7500 -64.0
+    111.2500    119.5000 -64.0
+    110.2500    121.5000 -64.0
+    113.5000    122.7500 -64.0
+    116.2500    125.5000 -64.0
+    120.2500    133.5000 -64.0
+    125.2500    136.5000 -64.0
+    129.5000    136.7500 -64.0
+    129.7500    134.5000 -64.0
+    131.7500    130.5000 -64.0
+    130.7500    128.5000 -64.0
+    128.2500    130.5000 -64.0
+    125.5000    134.2500 -64.0
+    122.7500    128.5000 -64.0
+    123.7500    125.5000 -64.0
+    122.7500    123.5000 -64.0
+    119.5000    123.2500 -64.0
+    107.7500    114.5000 -64.0
+} -64.0
+{ -64.0
+    139.2500    133.5000 -64.0
+    137.5000    134.2500 -64.0
+    138.2500    140.5000 -64.0
+    142.5000    141.7500 -64.0
+    139.7500    137.5000 -64.0
+    139.7500    135.5000 -64.0
+    140.7500    133.5000 -64.0
+} -64.0
+{ -64.0
+    153.2500    139.5000 -64.0
+    151.5000    141.2500 -64.0
+    147.5000    141.2500 -64.0
+    153.2500    145.5000 -64.0
+    156.2500    151.5000 -64.0
+    157.7500    150.5000 -64.0
+    156.7500    148.5000 -64.0
+    157.5000    147.7500 -64.0
+    157.7500    145.5000 -64.0
+    154.7500    144.5000 -64.0
+    155.5000    143.7500 -64.0
+    153.7500    141.5000 -64.0
+    154.5000    140.7500 -64.0
+} -64.0
+{ -64.0
+    111.5000     43.7500 -64.0
+    112.2500     44.5000 -64.0
+    111.5000     46.2500 -64.0
+    109.7500     45.5000 -64.0
+} -64.0
+{ -64.0
+    110.7500     49.5000 -64.0
+    112.5000     48.7500 -64.0
+    114.2500     51.5000 -64.0
+    114.2500     54.5000 -64.0
+    111.5000     58.2500 -64.0
+    110.7500     57.5000 -64.0
+    110.7500     54.5000 -64.0
+    109.5000     54.2500 -64.0
+    107.7500     52.5000 -64.0
+    110.5000     50.7500 -64.0
+} -64.0
+{ -64.0
+    107.7500     55.5000 -64.0
+    108.5000     54.7500 -64.0
+    110.2500     56.5000 -64.0
+    108.5000     58.2500 -64.0
+    107.7500     57.5000 -64.0
+} -64.0
+{ -64.0
+    156.7500    114.5000 -64.0
+    157.5000    113.7500 -64.0
+    158.2500    115.5000 -64.0
+    156.5000    117.2500 -64.0
+    154.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+     66.7500    122.5000 -64.0
+     67.5000    121.7500 -64.0
+     68.2500    122.5000 -64.0
+     67.5000    123.2500 -64.0
+} -64.0
+{ -64.0
+     63.7500    123.5000 -64.0
+     64.5000    122.7500 -64.0
+     65.2500    123.5000 -64.0
+     64.5000    125.2500 -64.0
+} -64.0
+{ -64.0
+    117.7500    124.5000 -64.0
+    118.5000    123.7500 -64.0
+    120.5000    123.7500 -64.0
+    122.2500    124.5000 -64.0
+    122.2500    127.5000 -64.0
+    120.5000    129.2500 -64.0
+    119.7500    128.5000 -64.0
+} -64.0
+{ -64.0
+     54.7500    130.5000 -64.0
+     55.5000    129.7500 -64.0
+     56.2500    130.5000 -64.0
+     55.5000    131.2500 -64.0
+} -64.0
+v 423 z -134.000000 -64.0
+{ -64.0
+    107.2500     36.5000 -64.0
+    105.5000     37.2500 -64.0
+    103.2500     39.5000 -64.0
+    106.5000     39.7500 -64.0
+    106.7500     38.5000 -64.0
+    108.7500     36.5000 -64.0
+} -64.0
+{ -64.0
+    112.2500     36.5000 -64.0
+    114.2500     38.5000 -64.0
+    114.2500     40.5000 -64.0
+    121.5000     43.7500 -64.0
+    122.2500     45.5000 -64.0
+    126.5000     49.7500 -64.0
+    128.5000     50.7500 -64.0
+    128.7500     49.5000 -64.0
+    124.7500     43.5000 -64.0
+    119.7500     40.5000 -64.0
+    117.5000     40.2500 -64.0
+    113.7500     36.5000 -64.0
+} -64.0
+{ -64.0
+    100.2500     40.5000 -64.0
+     99.5000     41.2500 -64.0
+     95.5000     41.2500 -64.0
+     92.2500     48.5000 -64.0
+     93.5000     48.7500 -64.0
+     94.5000     46.7500 -64.0
+    102.7500     40.5000 -64.0
+} -64.0
+{ -64.0
+    109.2500     43.5000 -64.0
+    107.5000     44.2500 -64.0
+    108.5000     44.7500 -64.0
+    110.5000     43.7500 -64.0
+    112.5000     44.7500 -64.0
+    112.7500     43.5000 -64.0
+} -64.0
+{ -64.0
+    110.2500     48.5000 -64.0
+    110.2500     49.5000 -64.0
+    108.5000     51.2500 -64.0
+    107.7500     50.5000 -64.0
+    105.5000     50.2500 -64.0
+    100.5000     49.2500 -64.0
+     97.5000     50.2500 -64.0
+     97.2500     53.5000 -64.0
+     98.7500     53.5000 -64.0
+     99.7500     51.5000 -64.0
+    101.5000     50.7500 -64.0
+    103.2500     51.5000 -64.0
+     96.5000     57.2500 -64.0
+     96.2500     63.5000 -64.0
+     99.5000     61.7500 -64.0
+     99.7500     56.5000 -64.0
+    101.5000     55.7500 -64.0
+    103.2500     56.5000 -64.0
+    103.2500     58.5000 -64.0
+    105.2500     60.5000 -64.0
+    104.2500     61.5000 -64.0
+    103.2500     63.5000 -64.0
+    101.5000     64.2500 -64.0
+    101.2500     65.5000 -64.0
+    103.2500     67.5000 -64.0
+    109.5000     79.7500 -64.0
+    109.7500     73.5000 -64.0
+    110.7500     70.5000 -64.0
+    113.5000     68.7500 -64.0
+    114.2500     69.5000 -64.0
+    115.7500     69.5000 -64.0
+    118.5000     65.7500 -64.0
+    118.5000     63.2500 -64.0
+    116.5000     62.2500 -64.0
+    115.7500     60.5000 -64.0
+    116.5000     58.7500 -64.0
+    116.7500     54.5000 -64.0
+    118.5000     52.7500 -64.0
+    122.2500     54.5000 -64.0
+    122.2500     56.5000 -64.0
+    125.2500     59.5000 -64.0
+    125.2500     61.5000 -64.0
+    126.5000     60.7500 -64.0
+    126.7500     58.5000 -64.0
+    125.5000     57.2500 -64.0
+    123.7500     52.5000 -64.0
+    119.5000     49.2500 -64.0
+    114.5000     51.2500 -64.0
+} -64.0
+{ -64.0
+     79.2500     57.5000 -64.0
+     78.5000     58.2500 -64.0
+     78.2500     61.5000 -64.0
+     79.5000     61.7500 -64.0
+     81.7500     57.5000 -64.0
+} -64.0
+{ -64.0
+    134.2500     57.5000 -64.0
+    134.2500     58.5000 -64.0
+    138.2500     62.5000 -64.0
+    138.5000     68.7500 -64.0
+    138.7500     60.5000 -64.0
+    135.7500     57.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500     62.5000 -64.0
+    121.5000     63.2500 -64.0
+    121.2500     66.5000 -64.0
+    124.2500     69.5000 -64.0
+    125.5000     68.7500 -64.0
+    125.7500     65.5000 -64.0
+    124.5000     65.2500 -64.0
+    123.7500     63.5000 -64.0
+} -64.0
+{ -64.0
+    125.2500     70.5000 -64.0
+    125.2500     79.5000 -64.0
+    127.2500     81.5000 -64.0
+    127.2500     83.5000 -64.0
+    128.7500     80.5000 -64.0
+    125.7500     74.5000 -64.0
+} -64.0
+{ -64.0
+     61.2500     76.5000 -64.0
+     58.5000     86.2500 -64.0
+     59.2500     87.5000 -64.0
+     60.5000     86.7500 -64.0
+     63.5000     81.7500 -64.0
+     63.7500     78.5000 -64.0
+     62.7500     76.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500     76.5000 -64.0
+     87.5000     80.2500 -64.0
+     84.2500     80.5000 -64.0
+     85.2500     82.5000 -64.0
+     91.5000     78.7500 -64.0
+     91.7500     77.5000 -64.0
+} -64.0
+{ -64.0
+     89.2500     81.5000 -64.0
+     88.5000     83.2500 -64.0
+     92.5000     86.7500 -64.0
+     92.7500     83.5000 -64.0
+} -64.0
+{ -64.0
+    133.2500     81.5000 -64.0
+    131.5000     82.2500 -64.0
+    131.2500     85.5000 -64.0
+    132.5000     85.7500 -64.0
+    134.7500     81.5000 -64.0
+} -64.0
+{ -64.0
+    151.2500     81.5000 -64.0
+    151.2500     82.5000 -64.0
+    150.2500     84.5000 -64.0
+    151.2500     86.5000 -64.0
+    151.2500     89.5000 -64.0
+    154.2500     93.5000 -64.0
+    154.2500     95.5000 -64.0
+    155.5000     94.7500 -64.0
+    155.7500     92.5000 -64.0
+    154.7500     90.5000 -64.0
+    154.7500     87.5000 -64.0
+    153.7500     85.5000 -64.0
+    153.7500     83.5000 -64.0
+    152.7500     81.5000 -64.0
+} -64.0
+{ -64.0
+    124.2500     84.5000 -64.0
+    124.2500     85.5000 -64.0
+    123.2500     88.5000 -64.0
+    124.5000     88.7500 -64.0
+    124.7500     85.5000 -64.0
+} -64.0
+{ -64.0
+     52.2500    104.5000 -64.0
+     50.5000    105.2500 -64.0
+     47.2500    110.5000 -64.0
+     48.2500    113.5000 -64.0
+     50.5000    115.7500 -64.0
+     55.5000    116.7500 -64.0
+     57.5000    115.7500 -64.0
+     57.7500    113.5000 -64.0
+     52.7500    108.5000 -64.0
+} -64.0
+{ -64.0
+    155.2500    104.5000 -64.0
+    155.2500    108.5000 -64.0
+    153.2500    114.5000 -64.0
+    154.2500    117.5000 -64.0
+    158.7500    117.5000 -64.0
+    160.7500    113.5000 -64.0
+    159.7500    111.5000 -64.0
+    159.7500    108.5000 -64.0
+    156.7500    104.5000 -64.0
+} -64.0
+{ -64.0
+     72.2500    111.5000 -64.0
+     72.2500    112.5000 -64.0
+     73.5000    112.7500 -64.0
+     73.7500    111.5000 -64.0
+} -64.0
+{ -64.0
+     73.2500    115.5000 -64.0
+     68.5000    118.2500 -64.0
+     66.5000    118.2500 -64.0
+     60.5000    122.2500 -64.0
+     56.5000    122.2500 -64.0
+     52.5000    120.2500 -64.0
+     52.2500    123.5000 -64.0
+     53.2500    125.5000 -64.0
+     52.2500    127.5000 -64.0
+     48.5000    130.2500 -64.0
+     45.5000    130.2500 -64.0
+     41.5000    134.2500 -64.0
+     39.2500    140.5000 -64.0
+     37.2500    150.5000 -64.0
+     38.2500    152.5000 -64.0
+     38.2500    158.5000 -64.0
+     39.2500    160.5000 -64.0
+     39.2500    163.5000 -64.0
+     43.2500    171.5000 -64.0
+     43.2500    173.5000 -64.0
+     50.2500    187.5000 -64.0
+     69.2500    207.5000 -64.0
+     70.2500    209.5000 -64.0
+     71.5000    209.7500 -64.0
+     77.5000    214.7500 -64.0
+     83.2500    217.5000 -64.0
+    107.5000    218.7500 -64.0
+    109.5000    217.7500 -64.0
+    120.7500    217.5000 -64.0
+    127.5000    214.7500 -64.0
+    134.5000    209.7500 -64.0
+    148.5000    195.7500 -64.0
+    150.5000    194.7500 -64.0
+    158.7500    184.5000 -64.0
+    164.7500    173.5000 -64.0
+    168.7500    163.5000 -64.0
+    170.5000    156.7500 -64.0
+    170.7500    149.5000 -64.0
+    169.7500    147.5000 -64.0
+    169.7500    144.5000 -64.0
+    167.7500    137.5000 -64.0
+    162.7500    132.5000 -64.0
+    159.5000    127.2500 -64.0
+    157.5000    126.2500 -64.0
+    156.7500    124.5000 -64.0
+    155.5000    124.2500 -64.0
+    152.5000    125.2500 -64.0
+    149.5000    124.2500 -64.0
+    145.5000    120.2500 -64.0
+    143.5000    119.2500 -64.0
+    143.2500    120.5000 -64.0
+    145.2500    126.5000 -64.0
+    147.5000    126.7500 -64.0
+    150.2500    131.5000 -64.0
+    148.5000    134.2500 -64.0
+    145.7500    130.5000 -64.0
+    143.5000    130.2500 -64.0
+    139.5000    132.2500 -64.0
+    135.5000    132.2500 -64.0
+    131.7500    128.5000 -64.0
+    129.5000    131.2500 -64.0
+    127.5000    131.2500 -64.0
+    125.5000    133.2500 -64.0
+    122.7500    130.5000 -64.0
+    123.5000    124.2500 -64.0
+    108.7500    117.5000 -64.0
+    104.5000    117.2500 -64.0
+     90.2500    122.5000 -64.0
+     89.2500    124.5000 -64.0
+     90.2500    126.5000 -64.0
+     89.5000    128.2500 -64.0
+     87.5000    129.2500 -64.0
+     88.2500    131.5000 -64.0
+     86.5000    132.2500 -64.0
+     84.7500    131.5000 -64.0
+     83.7500    129.5000 -64.0
+     84.5000    127.7500 -64.0
+     82.7500    125.5000 -64.0
+     81.5000    126.2500 -64.0
+     81.2500    130.5000 -64.0
+     82.2500    133.5000 -64.0
+     84.2500    134.5000 -64.0
+     85.5000    133.7500 -64.0
+     91.5000    133.7500 -64.0
+     95.7500    126.5000 -64.0
+    101.5000    121.7500 -64.0
+    103.5000    121.7500 -64.0
+    108.5000    119.7500 -64.0
+    109.2500    121.5000 -64.0
+    114.5000    123.7500 -64.0
+    117.2500    126.5000 -64.0
+    119.2500    130.5000 -64.0
+    123.2500    135.5000 -64.0
+    128.2500    138.5000 -64.0
+    130.5000    138.7500 -64.0
+    130.7500    136.5000 -64.0
+    127.7500    135.5000 -64.0
+    129.5000    133.7500 -64.0
+    131.5000    133.7500 -64.0
+    133.2500    135.5000 -64.0
+    136.5000    135.7500 -64.0
+    141.2500    140.5000 -64.0
+    147.5000    140.7500 -64.0
+    145.7500    139.5000 -64.0
+    147.5000    137.7500 -64.0
+    152.7500    138.5000 -64.0
+    151.7500    136.5000 -64.0
+    151.7500    134.5000 -64.0
+    153.5000    132.7500 -64.0
+    158.5000    132.7500 -64.0
+    161.5000    133.7500 -64.0
+    165.2500    136.5000 -64.0
+    165.2500    139.5000 -64.0
+    168.2500    143.5000 -64.0
+    166.5000    146.2500 -64.0
+    168.2500    148.5000 -64.0
+    167.5000    152.2500 -64.0
+    164.2500    152.5000 -64.0
+    165.2500    155.5000 -64.0
+    166.5000    154.7500 -64.0
+    168.2500    155.5000 -64.0
+    168.2500    158.5000 -64.0
+    167.2500    161.5000 -64.0
+    165.5000    162.2500 -64.0
+    163.7500    161.5000 -64.0
+    163.7500    159.5000 -64.0
+    162.5000    160.2500 -64.0
+    160.7500    159.5000 -64.0
+    159.7500    157.5000 -64.0
+    157.5000    159.2500 -64.0
+    155.5000    158.2500 -64.0
+    155.2500    171.5000 -64.0
+    151.2500    179.5000 -64.0
+    139.2500    190.5000 -64.0
+    138.2500    192.5000 -64.0
+    131.5000    197.2500 -64.0
+    122.5000    198.2500 -64.0
+    114.5000    202.2500 -64.0
+    112.5000    202.2500 -64.0
+    110.7500    200.5000 -64.0
+    110.7500    196.5000 -64.0
+    107.7500    193.5000 -64.0
+    106.7500    191.5000 -64.0
+    104.5000    190.2500 -64.0
+    100.5000    192.2500 -64.0
+    100.2500    193.5000 -64.0
+     94.5000    197.2500 -64.0
+     92.2500    200.5000 -64.0
+     87.5000    202.2500 -64.0
+     87.2500    203.5000 -64.0
+     84.5000    206.2500 -64.0
+     80.5000    206.2500 -64.0
+     76.7500    203.5000 -64.0
+     72.5000    198.2500 -64.0
+     70.5000    197.2500 -64.0
+     67.7500    193.5000 -64.0
+     67.7500    191.5000 -64.0
+     61.7500    181.5000 -64.0
+     56.7500    176.5000 -64.0
+     51.7500    167.5000 -64.0
+     51.7500    159.5000 -64.0
+     48.7500    153.5000 -64.0
+     50.7500    147.5000 -64.0
+     55.5000    142.7500 -64.0
+     58.5000    142.7500 -64.0
+     66.5000    138.7500 -64.0
+     63.5000    137.2500 -64.0
+     61.5000    138.2500 -64.0
+     58.5000    138.2500 -64.0
+     54.5000    140.2500 -64.0
+     48.2500    147.5000 -64.0
+     47.2500    152.5000 -64.0
+     45.5000    154.2500 -64.0
+     44.7500    152.5000 -64.0
+     42.5000    153.2500 -64.0
+     40.7500    151.5000 -64.0
+     41.7500    146.5000 -64.0
+     40.7500    144.5000 -64.0
+     40.7500    141.5000 -64.0
+     42.7500    139.5000 -64.0
+     44.7500    135.5000 -64.0
+     46.5000    134.7500 -64.0
+     49.5000    131.7500 -64.0
+     55.5000    131.7500 -64.0
+     57.2500    133.5000 -64.0
+     59.5000    131.7500 -64.0
+     61.5000    131.7500 -64.0
+     61.7500    129.5000 -64.0
+     64.5000    126.7500 -64.0
+     66.2500    127.5000 -64.0
+     67.5000    126.7500 -64.0
+     66.7500    124.5000 -64.0
+     67.7500    121.5000 -64.0
+     71.5000    118.7500 -64.0
+     74.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+     71.2500    120.5000 -64.0
+     72.2500    122.5000 -64.0
+     74.5000    122.7500 -64.0
+     72.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+     68.2500    130.5000 -64.0
+     69.2500    131.5000 -64.0
+     70.5000    138.7500 -64.0
+     72.5000    135.7500 -64.0
+     72.7500    133.5000 -64.0
+     69.7500    130.5000 -64.0
+} -64.0
+{ -64.0
+    148.2500    141.5000 -64.0
+    151.2500    144.5000 -64.0
+    153.2500    148.5000 -64.0
+    154.7500    149.5000 -64.0
+    157.5000    145.7500 -64.0
+    157.5000    144.2500 -64.0
+    155.5000    143.2500 -64.0
+    156.2500    144.5000 -64.0
+    154.5000    145.2500 -64.0
+    150.7500    141.5000 -64.0
+} -64.0
+{ -64.0
+    153.2500    152.5000 -64.0
+    153.2500    153.5000 -64.0
+    154.7500    156.5000 -64.0
+    155.7500    154.5000 -64.0
+} -64.0
+{ -64.0
+    151.7500     86.5000 -64.0
+    152.5000     85.7500 -64.0
+    154.2500     87.5000 -64.0
+    153.5000     89.2500 -64.0
+} -64.0
+{ -64.0
+     49.7500    111.5000 -64.0
+     51.5000    110.7500 -64.0
+     54.5000    111.7500 -64.0
+     55.2500    113.5000 -64.0
+     54.5000    115.2500 -64.0
+     52.5000    115.2500 -64.0
+} -64.0
+{ -64.0
+    156.7500    112.5000 -64.0
+    157.5000    111.7500 -64.0
+    158.2500    113.5000 -64.0
+    156.5000    115.2500 -64.0
+    155.7500    114.5000 -64.0
+} -64.0
+{ -64.0
+     96.7500    121.5000 -64.0
+     98.5000    120.7500 -64.0
+    100.2500    121.5000 -64.0
+     99.5000    122.2500 -64.0
+     97.5000    122.2500 -64.0
+     92.5000    128.2500 -64.0
+     90.7500    127.5000 -64.0
+     90.7500    123.5000 -64.0
+     92.5000    122.7500 -64.0
+} -64.0
+{ -64.0
+    117.7500    124.5000 -64.0
+    118.5000    123.7500 -64.0
+    121.5000    123.7500 -64.0
+    122.2500    125.5000 -64.0
+    121.5000    127.2500 -64.0
+    119.5000    127.2500 -64.0
+} -64.0
+{ -64.0
+    141.7500    132.5000 -64.0
+    143.5000    131.7500 -64.0
+    145.2500    134.5000 -64.0
+    144.5000    138.2500 -64.0
+    142.5000    138.2500 -64.0
+    138.7500    135.5000 -64.0
+    139.5000    133.7500 -64.0
+} -64.0
+v 451 z -136.000000 -64.0
+{ -64.0
+    107.2500     34.5000 -64.0
+    100.5000     39.2500 -64.0
+     95.5000     39.2500 -64.0
+     92.2500     46.5000 -64.0
+     92.7500     47.5000 -64.0
+     95.5000     43.7500 -64.0
+     98.7500     43.5000 -64.0
+     99.7500     41.5000 -64.0
+    103.5000     38.7500 -64.0
+    105.5000     38.7500 -64.0
+    109.5000     35.7500 -64.0
+    108.7500     34.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500     34.5000 -64.0
+    112.2500     35.5000 -64.0
+    113.2500     37.5000 -64.0
+    120.5000     41.7500 -64.0
+    122.2500     45.5000 -64.0
+    128.2500     48.5000 -64.0
+    128.7500     47.5000 -64.0
+    125.7500     43.5000 -64.0
+    126.7500     42.5000 -64.0
+    125.7500     39.5000 -64.0
+    117.5000     38.2500 -64.0
+    114.7500     34.5000 -64.0
+} -64.0
+{ -64.0
+    110.2500     42.5000 -64.0
+    108.5000     46.2500 -64.0
+    106.5000     46.2500 -64.0
+    104.5000     45.2500 -64.0
+    100.2500     46.5000 -64.0
+     99.2500     48.5000 -64.0
+    100.5000     47.7500 -64.0
+    101.2500     48.5000 -64.0
+    104.5000     48.7500 -64.0
+    110.2500     54.5000 -64.0
+    112.5000     54.7500 -64.0
+    117.5000     48.7500 -64.0
+    122.2500     50.5000 -64.0
+    125.2500     56.5000 -64.0
+    125.2500     60.5000 -64.0
+    127.5000     68.7500 -64.0
+    127.7500     66.5000 -64.0
+    126.7500     64.5000 -64.0
+    126.7500     62.5000 -64.0
+    128.7500     60.5000 -64.0
+    124.7500     52.5000 -64.0
+    124.7500     50.5000 -64.0
+    121.7500     47.5000 -64.0
+    117.5000     47.2500 -64.0
+    115.5000     46.2500 -64.0
+    113.5000     47.2500 -64.0
+    111.7500     45.5000 -64.0
+    112.7500     42.5000 -64.0
+} -64.0
+{ -64.0
+     97.2500     50.5000 -64.0
+     95.2500     54.5000 -64.0
+     95.7500     55.5000 -64.0
+     97.7500     51.5000 -64.0
+} -64.0
+{ -64.0
+     83.2500     56.5000 -64.0
+     80.5000     60.2500 -64.0
+     81.2500     61.5000 -64.0
+     81.2500     64.5000 -64.0
+     82.5000     64.7500 -64.0
+     82.7500     63.5000 -64.0
+     81.7500     61.5000 -64.0
+     83.7500     57.5000 -64.0
+} -64.0
+{ -64.0
+    134.2500     56.5000 -64.0
+    136.2500     62.5000 -64.0
+    135.2500     65.5000 -64.0
+    137.2500     69.5000 -64.0
+    137.2500     74.5000 -64.0
+    135.2500     76.5000 -64.0
+    137.5000     76.7500 -64.0
+    138.5000     73.7500 -64.0
+    138.7500     69.5000 -64.0
+    137.7500     67.5000 -64.0
+    137.7500     61.5000 -64.0
+    136.7500     58.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500     69.5000 -64.0
+     91.5000     70.2500 -64.0
+     92.2500     71.5000 -64.0
+     91.2500     73.5000 -64.0
+     86.5000     79.2500 -64.0
+     84.5000     79.2500 -64.0
+     84.2500     82.5000 -64.0
+     85.5000     82.7500 -64.0
+     85.7500     81.5000 -64.0
+     88.5000     78.7500 -64.0
+     89.2500     79.5000 -64.0
+     89.2500     81.5000 -64.0
+     92.7500     74.5000 -64.0
+     93.5000     72.7500 -64.0
+     93.7500     69.5000 -64.0
+} -64.0
+{ -64.0
+    103.2500     71.5000 -64.0
+    102.2500     73.5000 -64.0
+    104.5000     74.7500 -64.0
+    104.7500     72.5000 -64.0
+} -64.0
+{ -64.0
+    127.2500     76.5000 -64.0
+    127.2500     79.5000 -64.0
+    129.2500     80.5000 -64.0
+    125.5000     82.2500 -64.0
+    123.7500     78.5000 -64.0
+    122.2500     78.5000 -64.0
+    124.5000     83.7500 -64.0
+    129.5000     84.7500 -64.0
+    133.5000     86.7500 -64.0
+    132.7500     84.5000 -64.0
+    133.7500     81.5000 -64.0
+    132.5000     81.2500 -64.0
+    131.7500     79.5000 -64.0
+    128.5000     78.2500 -64.0
+} -64.0
+{ -64.0
+     62.2500     77.5000 -64.0
+     60.5000     80.2500 -64.0
+     58.2500     89.5000 -64.0
+     59.5000     89.7500 -64.0
+     60.7500     88.5000 -64.0
+     64.5000     80.7500 -64.0
+     63.7500     77.5000 -64.0
+} -64.0
+{ -64.0
+    107.2500     77.5000 -64.0
+    108.2500     80.5000 -64.0
+    109.5000     80.7500 -64.0
+    111.5000     78.7500 -64.0
+    109.7500     77.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500     82.5000 -64.0
+     90.2500     85.5000 -64.0
+     91.5000     85.7500 -64.0
+     91.7500     83.5000 -64.0
+} -64.0
+{ -64.0
+    151.2500     82.5000 -64.0
+    150.5000     84.2500 -64.0
+    150.2500     88.5000 -64.0
+    151.2500     90.5000 -64.0
+    151.2500     93.5000 -64.0
+    153.2500     97.5000 -64.0
+    153.2500     99.5000 -64.0
+    154.2500    101.5000 -64.0
+    154.2500    114.5000 -64.0
+    155.2500    116.5000 -64.0
+    157.5000    116.7500 -64.0
+    159.5000    114.7500 -64.0
+    159.7500    111.5000 -64.0
+    158.7500    109.5000 -64.0
+    158.7500    107.5000 -64.0
+    155.7500    101.5000 -64.0
+    155.7500     95.5000 -64.0
+    154.7500     93.5000 -64.0
+    154.7500     91.5000 -64.0
+    151.7500     90.5000 -64.0
+    152.5000     86.7500 -64.0
+    153.5000     87.7500 -64.0
+    153.7500     84.5000 -64.0
+    152.7500     82.5000 -64.0
+} -64.0
+{ -64.0
+     54.2500    102.5000 -64.0
+     52.5000    103.2500 -64.0
+     49.5000    108.2500 -64.0
+     49.2500    113.5000 -64.0
+     52.2500    115.5000 -64.0
+     54.5000    115.7500 -64.0
+     56.5000    114.7500 -64.0
+     56.7500    110.5000 -64.0
+     53.7500    107.5000 -64.0
+     55.7500    102.5000 -64.0
+} -64.0
+{ -64.0
+     67.2500    117.5000 -64.0
+     66.5000    118.2500 -64.0
+     64.5000    118.2500 -64.0
+     62.5000    120.2500 -64.0
+     58.5000    123.2500 -64.0
+     54.7500    121.5000 -64.0
+     53.2500    121.5000 -64.0
+     50.2500    127.5000 -64.0
+     43.5000    133.2500 -64.0
+     40.2500    138.5000 -64.0
+     39.2500    143.5000 -64.0
+     38.5000    145.2500 -64.0
+     38.2500    153.5000 -64.0
+     39.2500    155.5000 -64.0
+     39.2500    158.5000 -64.0
+     40.2500    160.5000 -64.0
+     40.2500    163.5000 -64.0
+     47.2500    177.5000 -64.0
+     47.2500    179.5000 -64.0
+     51.2500    185.5000 -64.0
+     52.2500    187.5000 -64.0
+     58.2500    193.5000 -64.0
+     64.2500    200.5000 -64.0
+     65.2500    202.5000 -64.0
+     75.2500    211.5000 -64.0
+     82.2500    215.5000 -64.0
+     86.5000    215.7500 -64.0
+     88.2500    216.5000 -64.0
+     89.5000    215.7500 -64.0
+     95.5000    215.7500 -64.0
+     97.2500    216.5000 -64.0
+    103.5000    216.7500 -64.0
+    105.5000    215.7500 -64.0
+    120.5000    215.7500 -64.0
+    130.5000    210.7500 -64.0
+    138.5000    203.7500 -64.0
+    151.7500    191.5000 -64.0
+    154.5000    187.7500 -64.0
+    157.7500    183.5000 -64.0
+    167.7500    163.5000 -64.0
+    168.5000    161.7500 -64.0
+    168.7500    158.5000 -64.0
+    169.5000    156.7500 -64.0
+    169.7500    144.5000 -64.0
+    168.7500    142.5000 -64.0
+    168.7500    140.5000 -64.0
+    166.7500    136.5000 -64.0
+    165.5000    134.2500 -64.0
+    161.7500    131.5000 -64.0
+    160.7500    129.5000 -64.0
+    155.7500    126.5000 -64.0
+    152.5000    126.2500 -64.0
+    148.7500    122.5000 -64.0
+    144.5000    119.2500 -64.0
+    144.2500    124.5000 -64.0
+    145.5000    125.7500 -64.0
+    147.5000    124.7500 -64.0
+    149.5000    124.7500 -64.0
+    152.2500    127.5000 -64.0
+    150.5000    131.2500 -64.0
+    150.2500    133.5000 -64.0
+    148.5000    135.2500 -64.0
+    147.7500    133.5000 -64.0
+    146.5000    133.2500 -64.0
+    146.2500    136.5000 -64.0
+    144.5000    138.2500 -64.0
+    134.5000    133.2500 -64.0
+    132.7500    132.5000 -64.0
+    133.5000    131.7500 -64.0
+    135.5000    130.7500 -64.0
+    135.7500    129.5000 -64.0
+    134.5000    129.2500 -64.0
+    130.5000    131.2500 -64.0
+    132.2500    132.5000 -64.0
+    131.5000    133.2500 -64.0
+    128.5000    133.2500 -64.0
+    126.7500    132.5000 -64.0
+    128.5000    130.2500 -64.0
+    124.7500    127.5000 -64.0
+    125.5000    125.7500 -64.0
+    124.5000    124.2500 -64.0
+    118.5000    121.2500 -64.0
+    113.5000    120.2500 -64.0
+    111.7500    119.5000 -64.0
+    100.5000    119.2500 -64.0
+     96.5000    121.2500 -64.0
+     93.5000    121.2500 -64.0
+     91.5000    122.2500 -64.0
+     89.5000    122.2500 -64.0
+     89.2500    126.5000 -64.0
+     91.2500    128.5000 -64.0
+     90.5000    130.2500 -64.0
+     88.5000    130.2500 -64.0
+     86.7500    128.5000 -64.0
+     84.5000    128.2500 -64.0
+     82.7500    126.5000 -64.0
+     80.5000    126.2500 -64.0
+     79.5000    128.2500 -64.0
+     79.2500    130.5000 -64.0
+     82.2500    134.5000 -64.0
+     87.5000    134.7500 -64.0
+     90.5000    133.7500 -64.0
+     93.7500    129.5000 -64.0
+     94.7500    127.5000 -64.0
+     98.5000    124.7500 -64.0
+    103.5000    121.7500 -64.0
+    109.5000    121.7500 -64.0
+    112.5000    122.7500 -64.0
+    120.5000    129.7500 -64.0
+    122.5000    128.7500 -64.0
+    124.5000    128.7500 -64.0
+    126.2500    131.5000 -64.0
+    125.5000    132.2500 -64.0
+    123.5000    133.2500 -64.0
+    123.2500    136.5000 -64.0
+    127.5000    139.7500 -64.0
+    132.5000    140.7500 -64.0
+    132.7500    139.5000 -64.0
+    135.5000    136.7500 -64.0
+    137.5000    136.7500 -64.0
+    147.5000    140.7500 -64.0
+    148.5000    138.7500 -64.0
+    150.5000    137.7500 -64.0
+    152.2500    138.5000 -64.0
+    153.2500    140.5000 -64.0
+    155.5000    140.7500 -64.0
+    155.7500    139.5000 -64.0
+    154.5000    139.2500 -64.0
+    151.7500    136.5000 -64.0
+    151.7500    134.5000 -64.0
+    154.5000    131.7500 -64.0
+    157.5000    131.7500 -64.0
+    163.5000    134.7500 -64.0
+    166.2500    138.5000 -64.0
+    166.2500    140.5000 -64.0
+    167.2500    142.5000 -64.0
+    166.2500    145.5000 -64.0
+    168.2500    147.5000 -64.0
+    168.2500    150.5000 -64.0
+    167.5000    152.2500 -64.0
+    164.5000    152.2500 -64.0
+    162.5000    153.2500 -64.0
+    160.5000    152.2500 -64.0
+    162.2500    155.5000 -64.0
+    157.5000    160.2500 -64.0
+    155.5000    159.2500 -64.0
+    153.7500    156.5000 -64.0
+    153.7500    154.5000 -64.0
+    152.2500    154.5000 -64.0
+    154.2500    158.5000 -64.0
+    154.2500    172.5000 -64.0
+    150.2500    178.5000 -64.0
+    149.2500    180.5000 -64.0
+    142.5000    186.2500 -64.0
+    140.5000    187.2500 -64.0
+    132.5000    192.2500 -64.0
+    128.5000    195.2500 -64.0
+    126.5000    195.2500 -64.0
+    124.5000    196.2500 -64.0
+    119.5000    196.2500 -64.0
+    114.5000    195.2500 -64.0
+    111.5000    194.2500 -64.0
+    107.7500    190.5000 -64.0
+    106.7500    188.5000 -64.0
+    104.5000    186.2500 -64.0
+    100.5000    191.2500 -64.0
+     96.5000    194.2500 -64.0
+     93.5000    194.2500 -64.0
+     89.5000    197.2500 -64.0
+     86.5000    197.2500 -64.0
+     80.5000    199.2500 -64.0
+     75.5000    197.2500 -64.0
+     69.7500    189.5000 -64.0
+     67.7500    185.5000 -64.0
+     56.7500    174.5000 -64.0
+     52.7500    167.5000 -64.0
+     52.7500    159.5000 -64.0
+     53.7500    156.5000 -64.0
+     50.7500    153.5000 -64.0
+     50.7500    148.5000 -64.0
+     51.7500    145.5000 -64.0
+     57.5000    139.7500 -64.0
+     61.5000    137.7500 -64.0
+     63.5000    137.7500 -64.0
+     64.7500    136.5000 -64.0
+     59.5000    136.2500 -64.0
+     56.5000    137.2500 -64.0
+     55.5000    139.2500 -64.0
+     53.5000    140.2500 -64.0
+     53.2500    141.5000 -64.0
+     49.5000    145.2500 -64.0
+     49.2500    147.5000 -64.0
+     47.5000    148.2500 -64.0
+     48.2500    149.5000 -64.0
+     48.2500    152.5000 -64.0
+     47.5000    154.2500 -64.0
+     45.5000    155.2500 -64.0
+     43.7500    151.5000 -64.0
+     41.7500    150.5000 -64.0
+     41.7500    139.5000 -64.0
+     43.7500    138.5000 -64.0
+     45.7500    134.5000 -64.0
+     46.5000    132.7500 -64.0
+     50.5000    130.7500 -64.0
+     53.5000    130.7500 -64.0
+     56.5000    133.7500 -64.0
+     58.5000    132.7500 -64.0
+     60.5000    132.7500 -64.0
+     62.5000    131.7500 -64.0
+     62.7500    129.5000 -64.0
+     64.5000    127.7500 -64.0
+     66.7500    127.5000 -64.0
+     65.7500    125.5000 -64.0
+     69.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+     69.2500    129.5000 -64.0
+     69.2500    130.5000 -64.0
+     71.2500    132.5000 -64.0
+     70.2500    134.5000 -64.0
+     68.5000    135.2500 -64.0
+     68.2500    136.5000 -64.0
+     70.5000    136.7500 -64.0
+     74.5000    132.7500 -64.0
+     74.5000    131.2500 -64.0
+     72.5000    130.2500 -64.0
+     70.7500    129.5000 -64.0
+} -64.0
+{ -64.0
+    140.2500    130.5000 -64.0
+    141.2500    131.5000 -64.0
+    145.5000    132.7500 -64.0
+    143.7500    130.5000 -64.0
+} -64.0
+{ -64.0
+    148.2500    141.5000 -64.0
+    148.2500    142.5000 -64.0
+    151.2500    146.5000 -64.0
+    150.5000    148.2500 -64.0
+    150.2500    150.5000 -64.0
+    153.5000    147.7500 -64.0
+    152.7500    145.5000 -64.0
+    151.5000    145.2500 -64.0
+    150.7500    143.5000 -64.0
+} -64.0
+{ -64.0
+    131.5000     81.7500 -64.0
+    132.2500     82.5000 -64.0
+    131.5000     84.2500 -64.0
+    129.7500     83.5000 -64.0
+} -64.0
+{ -64.0
+    155.7500    109.5000 -64.0
+    156.5000    108.7500 -64.0
+    157.2500    109.5000 -64.0
+    157.2500    112.5000 -64.0
+    156.5000    114.2500 -64.0
+    155.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+     51.7500    110.5000 -64.0
+     52.5000    109.7500 -64.0
+     55.2500    112.5000 -64.0
+     53.5000    114.2500 -64.0
+     51.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+     94.7500    122.5000 -64.0
+     95.5000    121.7500 -64.0
+     97.5000    121.7500 -64.0
+     99.2500    122.5000 -64.0
+     98.5000    123.2500 -64.0
+     96.5000    123.2500 -64.0
+     94.5000    126.2500 -64.0
+     92.5000    127.2500 -64.0
+     90.7500    126.5000 -64.0
+     90.7500    124.5000 -64.0
+     91.5000    122.7500 -64.0
+} -64.0
+{ -64.0
+    113.7500    122.5000 -64.0
+    114.5000    121.7500 -64.0
+    119.5000    122.7500 -64.0
+    122.5000    123.7500 -64.0
+    123.2500    125.5000 -64.0
+    122.5000    127.2500 -64.0
+    120.5000    127.2500 -64.0
+    118.7500    125.5000 -64.0
+} -64.0
+{ -64.0
+     82.7500    129.5000 -64.0
+     84.5000    128.7500 -64.0
+     86.2500    129.5000 -64.0
+     87.2500    131.5000 -64.0
+     85.5000    133.2500 -64.0
+} -64.0
+{ -64.0
+    126.7500    135.5000 -64.0
+    128.5000    134.7500 -64.0
+    130.2500    135.5000 -64.0
+    129.5000    137.2500 -64.0
+    127.5000    137.2500 -64.0
+} -64.0
+{ -64.0
+    165.5000    158.7500 -64.0
+    166.2500    159.5000 -64.0
+    165.5000    161.2500 -64.0
+    163.7500    160.5000 -64.0
+} -64.0
+{ -64.0
+    105.7500    200.5000 -64.0
+    106.5000    199.7500 -64.0
+    107.2500    201.5000 -64.0
+    105.5000    205.2500 -64.0
+    103.7500    202.5000 -64.0
+    105.5000    201.7500 -64.0
+} -64.0
+v 464 z -138.000000 -64.0
+{ -64.0
+    107.2500     32.5000 -64.0
+    104.5000     35.2500 -64.0
+    101.5000     35.2500 -64.0
+     99.5000     37.2500 -64.0
+     95.5000     37.2500 -64.0
+     92.5000     42.2500 -64.0
+     91.2500     46.5000 -64.0
+     94.5000     46.7500 -64.0
+     95.7500     45.5000 -64.0
+     94.7500     42.5000 -64.0
+     96.5000     41.7500 -64.0
+     99.5000     42.7500 -64.0
+    101.5000     38.7500 -64.0
+    103.5000     38.7500 -64.0
+    105.5000     36.7500 -64.0
+    107.5000     37.7500 -64.0
+    109.7500     34.5000 -64.0
+    108.7500     32.5000 -64.0
+} -64.0
+{ -64.0
+    114.2500     32.5000 -64.0
+    112.5000     33.2500 -64.0
+    112.2500     35.5000 -64.0
+    114.2500     37.5000 -64.0
+    116.5000     37.7500 -64.0
+    117.5000     39.7500 -64.0
+    121.2500     41.5000 -64.0
+    122.2500     43.5000 -64.0
+    119.5000     45.2500 -64.0
+    116.7500     43.5000 -64.0
+    114.5000     44.2500 -64.0
+    112.7500     40.5000 -64.0
+    109.5000     40.2500 -64.0
+    108.5000     43.2500 -64.0
+    106.5000     43.2500 -64.0
+    104.5000     44.2500 -64.0
+    103.5000     43.2500 -64.0
+    100.5000     44.2500 -64.0
+     96.5000     49.2500 -64.0
+     94.2500     55.5000 -64.0
+     94.7500     56.5000 -64.0
+     98.7500     47.5000 -64.0
+    101.5000     45.7500 -64.0
+    106.5000     46.7500 -64.0
+    109.5000     49.7500 -64.0
+    111.5000     50.7500 -64.0
+    117.5000     45.7500 -64.0
+    123.2500     49.5000 -64.0
+    126.2500     54.5000 -64.0
+    126.2500     58.5000 -64.0
+    125.2500     60.5000 -64.0
+    126.2500     62.5000 -64.0
+    126.2500     65.5000 -64.0
+    128.2500     69.5000 -64.0
+    129.5000     69.7500 -64.0
+    134.5000     67.7500 -64.0
+    136.2500     69.5000 -64.0
+    136.2500     71.5000 -64.0
+    134.5000     73.2500 -64.0
+    129.5000     73.2500 -64.0
+    129.2500     76.5000 -64.0
+    133.5000     77.7500 -64.0
+    136.5000     76.7500 -64.0
+    138.5000     73.7500 -64.0
+    138.7500     66.5000 -64.0
+    137.7500     64.5000 -64.0
+    137.7500     61.5000 -64.0
+    135.5000     58.2500 -64.0
+    134.5000     63.2500 -64.0
+    128.5000     66.2500 -64.0
+    126.7500     65.5000 -64.0
+    127.5000     61.7500 -64.0
+    129.7500     61.5000 -64.0
+    130.7500     59.5000 -64.0
+    127.7500     57.5000 -64.0
+    127.7500     55.5000 -64.0
+    125.7500     51.5000 -64.0
+    125.7500     49.5000 -64.0
+    122.7500     45.5000 -64.0
+    123.5000     44.7500 -64.0
+    128.5000     46.7500 -64.0
+    128.7500     43.5000 -64.0
+    126.7500     37.5000 -64.0
+    124.5000     37.2500 -64.0
+    120.5000     35.2500 -64.0
+    118.5000     36.2500 -64.0
+    116.7500     33.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500     49.5000 -64.0
+     89.5000     50.2500 -64.0
+     90.2500     51.5000 -64.0
+     92.5000     51.7500 -64.0
+} -64.0
+{ -64.0
+    130.2500     49.5000 -64.0
+    129.5000     50.2500 -64.0
+    129.2500     52.5000 -64.0
+    130.5000     52.7500 -64.0
+    134.5000     54.7500 -64.0
+    134.7500     52.5000 -64.0
+    132.7500     51.5000 -64.0
+    132.7500     49.5000 -64.0
+} -64.0
+{ -64.0
+     84.2500     57.5000 -64.0
+     82.5000     60.2500 -64.0
+     82.2500     65.5000 -64.0
+     83.5000     64.7500 -64.0
+     86.2500     66.5000 -64.0
+     88.5000     66.7500 -64.0
+     84.7500     62.5000 -64.0
+} -64.0
+{ -64.0
+     94.2500     60.5000 -64.0
+     94.2500     62.5000 -64.0
+     94.7500     61.5000 -64.0
+} -64.0
+{ -64.0
+     81.2500     67.5000 -64.0
+     81.2500     69.5000 -64.0
+     82.5000     72.7500 -64.0
+     82.7500     67.5000 -64.0
+} -64.0
+{ -64.0
+     84.2500     72.5000 -64.0
+     84.2500     73.5000 -64.0
+     88.5000     73.7500 -64.0
+     86.7500     72.5000 -64.0
+} -64.0
+{ -64.0
+     94.2500     76.5000 -64.0
+     93.5000     77.2500 -64.0
+     93.2500     79.5000 -64.0
+     91.5000     81.2500 -64.0
+     88.5000     81.2500 -64.0
+     89.5000     82.7500 -64.0
+     91.5000     81.7500 -64.0
+     93.5000     81.7500 -64.0
+     96.5000     77.7500 -64.0
+     95.7500     76.5000 -64.0
+} -64.0
+{ -64.0
+     62.2500     78.5000 -64.0
+     60.5000     82.2500 -64.0
+     60.2500     84.5000 -64.0
+     62.5000     82.7500 -64.0
+     63.2500     83.5000 -64.0
+     62.2500     86.5000 -64.0
+     59.5000     88.2500 -64.0
+     58.2500     96.5000 -64.0
+     50.5000    108.2500 -64.0
+     50.2500    112.5000 -64.0
+     52.2500    114.5000 -64.0
+     54.5000    114.7500 -64.0
+     56.5000    113.7500 -64.0
+     56.7500    108.5000 -64.0
+     55.7500    105.5000 -64.0
+     59.5000     96.7500 -64.0
+     60.7500     90.5000 -64.0
+     63.5000     87.7500 -64.0
+     64.7500     81.5000 -64.0
+     63.7500     78.5000 -64.0
+} -64.0
+{ -64.0
+     86.2500     79.5000 -64.0
+     84.5000     80.2500 -64.0
+     84.2500     82.5000 -64.0
+     87.5000     80.7500 -64.0
+} -64.0
+{ -64.0
+    128.2500     80.5000 -64.0
+    128.2500     81.5000 -64.0
+    127.5000     83.2500 -64.0
+    125.5000     82.2500 -64.0
+    126.2500     83.5000 -64.0
+    129.5000     83.7500 -64.0
+    132.2500     86.5000 -64.0
+    131.5000     87.2500 -64.0
+    134.2500     89.5000 -64.0
+    134.7500     88.5000 -64.0
+    131.7500     84.5000 -64.0
+    131.7500     82.5000 -64.0
+    129.7500     80.5000 -64.0
+} -64.0
+{ -64.0
+    151.2500     83.5000 -64.0
+    150.5000     84.2500 -64.0
+    150.2500     94.5000 -64.0
+    152.2500     98.5000 -64.0
+    152.2500    100.5000 -64.0
+    154.2500    104.5000 -64.0
+    154.2500    115.5000 -64.0
+    156.2500    116.5000 -64.0
+    159.5000    113.7500 -64.0
+    159.7500    111.5000 -64.0
+    158.7500    109.5000 -64.0
+    158.7500    107.5000 -64.0
+    155.7500    101.5000 -64.0
+    155.7500     99.5000 -64.0
+    154.7500     97.5000 -64.0
+    155.7500     94.5000 -64.0
+    153.7500     90.5000 -64.0
+    153.7500     86.5000 -64.0
+    152.7500     83.5000 -64.0
+} -64.0
+{ -64.0
+     65.2500    117.5000 -64.0
+     62.2500    121.5000 -64.0
+     58.5000    124.2500 -64.0
+     54.5000    122.2500 -64.0
+     53.5000    125.2500 -64.0
+     51.5000    124.2500 -64.0
+     47.2500    130.5000 -64.0
+     44.2500    132.5000 -64.0
+     39.5000    142.2500 -64.0
+     39.2500    152.5000 -64.0
+     40.2500    154.5000 -64.0
+     42.2500    164.5000 -64.0
+     50.2500    181.5000 -64.0
+     62.2500    196.5000 -64.0
+     72.2500    206.5000 -64.0
+     76.5000    209.7500 -64.0
+     83.2500    213.5000 -64.0
+     96.5000    213.7500 -64.0
+     99.5000    214.7500 -64.0
+    101.5000    213.7500 -64.0
+    104.5000    214.7500 -64.0
+    106.5000    213.7500 -64.0
+    116.5000    213.7500 -64.0
+    127.5000    209.7500 -64.0
+    133.5000    203.7500 -64.0
+    142.5000    196.7500 -64.0
+    153.5000    186.7500 -64.0
+    156.7500    182.5000 -64.0
+    160.5000    175.7500 -64.0
+    160.7500    173.5000 -64.0
+    166.7500    163.5000 -64.0
+    169.5000    152.7500 -64.0
+    169.7500    143.5000 -64.0
+    165.7500    133.5000 -64.0
+    162.7500    131.5000 -64.0
+    160.5000    131.2500 -64.0
+    160.2500    132.5000 -64.0
+    162.5000    132.7500 -64.0
+    166.2500    139.5000 -64.0
+    164.2500    143.5000 -64.0
+    166.5000    143.7500 -64.0
+    168.2500    146.5000 -64.0
+    167.5000    148.2500 -64.0
+    168.2500    149.5000 -64.0
+    167.5000    151.2500 -64.0
+    164.5000    151.2500 -64.0
+    162.5000    153.2500 -64.0
+    160.5000    153.2500 -64.0
+    160.2500    157.5000 -64.0
+    158.5000    159.2500 -64.0
+    156.5000    159.2500 -64.0
+    154.7500    157.5000 -64.0
+    154.7500    155.5000 -64.0
+    151.2500    154.5000 -64.0
+    153.2500    160.5000 -64.0
+    153.2500    165.5000 -64.0
+    152.5000    167.2500 -64.0
+    153.2500    168.5000 -64.0
+    152.2500    171.5000 -64.0
+    146.5000    181.2500 -64.0
+    134.5000    189.2500 -64.0
+    132.5000    189.2500 -64.0
+    124.5000    193.2500 -64.0
+    114.5000    193.2500 -64.0
+    111.5000    192.2500 -64.0
+    107.7500    188.5000 -64.0
+    105.5000    184.2500 -64.0
+    103.5000    183.2500 -64.0
+    102.2500    186.5000 -64.0
+     99.5000    190.2500 -64.0
+     95.5000    193.2500 -64.0
+     81.5000    193.2500 -64.0
+     77.7500    191.5000 -64.0
+     75.5000    191.2500 -64.0
+     72.7500    186.5000 -64.0
+     60.7500    177.5000 -64.0
+     57.7500    173.5000 -64.0
+     53.7500    165.5000 -64.0
+     54.7500    152.5000 -64.0
+     53.5000    151.2500 -64.0
+     51.5000    154.2500 -64.0
+     50.7500    153.5000 -64.0
+     50.7500    148.5000 -64.0
+     52.5000    147.7500 -64.0
+     54.7500    142.5000 -64.0
+     57.5000    139.7500 -64.0
+     61.7500    137.5000 -64.0
+     59.5000    137.2500 -64.0
+     53.5000    140.2500 -64.0
+     53.2500    141.5000 -64.0
+     51.2500    143.5000 -64.0
+     49.5000    150.2500 -64.0
+     44.5000    149.2500 -64.0
+     42.5000    151.2500 -64.0
+     40.7500    149.5000 -64.0
+     41.7500    148.5000 -64.0
+     40.7500    145.5000 -64.0
+     42.5000    143.7500 -64.0
+     44.7500    136.5000 -64.0
+     46.5000    135.7500 -64.0
+     46.7500    133.5000 -64.0
+     48.5000    131.7500 -64.0
+     52.5000    129.7500 -64.0
+     54.5000    130.7500 -64.0
+     56.5000    133.7500 -64.0
+     63.5000    131.7500 -64.0
+     63.7500    130.5000 -64.0
+     65.5000    129.7500 -64.0
+     65.7500    127.5000 -64.0
+     64.5000    127.2500 -64.0
+     63.7500    125.5000 -64.0
+     65.5000    124.7500 -64.0
+     68.5000    118.7500 -64.0
+     67.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+    100.2500    119.5000 -64.0
+     99.5000    120.2500 -64.0
+     96.2500    120.5000 -64.0
+     99.5000    120.7500 -64.0
+    100.2500    122.5000 -64.0
+     98.5000    123.2500 -64.0
+     92.5000    127.2500 -64.0
+     89.7500    125.5000 -64.0
+     89.7500    123.5000 -64.0
+     92.5000    121.7500 -64.0
+     95.7500    121.5000 -64.0
+     92.5000    121.2500 -64.0
+     88.5000    123.2500 -64.0
+     88.2500    126.5000 -64.0
+     91.2500    128.5000 -64.0
+     94.5000    128.7500 -64.0
+     96.5000    126.7500 -64.0
+    100.5000    123.7500 -64.0
+    106.5000    121.7500 -64.0
+    111.5000    122.7500 -64.0
+    115.5000    125.7500 -64.0
+    117.5000    126.7500 -64.0
+    118.2500    128.5000 -64.0
+    123.5000    130.7500 -64.0
+    124.2500    132.5000 -64.0
+    123.5000    134.2500 -64.0
+    123.2500    137.5000 -64.0
+    127.5000    140.7500 -64.0
+    129.5000    141.7500 -64.0
+    131.2500    142.5000 -64.0
+    135.5000    142.7500 -64.0
+    135.7500    139.5000 -64.0
+    138.5000    137.7500 -64.0
+    139.2500    138.5000 -64.0
+    141.5000    138.7500 -64.0
+    145.2500    140.5000 -64.0
+    148.2500    144.5000 -64.0
+    147.5000    146.2500 -64.0
+    147.2500    148.5000 -64.0
+    148.2500    150.5000 -64.0
+    149.5000    152.7500 -64.0
+    149.7500    150.5000 -64.0
+    150.5000    148.7500 -64.0
+    152.5000    147.7500 -64.0
+    150.7500    146.5000 -64.0
+    147.7500    140.5000 -64.0
+    148.7500    138.5000 -64.0
+    147.5000    137.2500 -64.0
+    145.5000    136.2500 -64.0
+    144.5000    138.2500 -64.0
+    141.5000    137.2500 -64.0
+    139.7500    136.5000 -64.0
+    135.5000    136.2500 -64.0
+    132.5000    139.2500 -64.0
+    131.7500    138.5000 -64.0
+    129.7500    134.5000 -64.0
+    127.5000    134.2500 -64.0
+    125.7500    133.5000 -64.0
+    125.7500    130.5000 -64.0
+    124.5000    129.2500 -64.0
+    120.5000    127.2500 -64.0
+    113.7500    122.5000 -64.0
+    114.5000    121.7500 -64.0
+    118.5000    121.7500 -64.0
+    123.5000    123.7500 -64.0
+    130.2500    131.5000 -64.0
+    134.5000    131.7500 -64.0
+    136.2500    132.5000 -64.0
+    137.5000    131.7500 -64.0
+    142.5000    131.7500 -64.0
+    139.7500    129.5000 -64.0
+    137.5000    129.2500 -64.0
+    134.5000    128.2500 -64.0
+    133.5000    130.2500 -64.0
+    130.5000    130.2500 -64.0
+    128.7500    128.5000 -64.0
+    128.7500    126.5000 -64.0
+    124.5000    123.2500 -64.0
+    122.5000    122.2500 -64.0
+    120.7500    121.5000 -64.0
+    117.5000    121.2500 -64.0
+    115.7500    120.5000 -64.0
+    105.5000    120.2500 -64.0
+} -64.0
+{ -64.0
+    144.2500    120.5000 -64.0
+    143.2500    122.5000 -64.0
+    145.2500    124.5000 -64.0
+    147.5000    122.7500 -64.0
+    149.7500    122.5000 -64.0
+    146.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+     78.2500    127.5000 -64.0
+     77.5000    128.2500 -64.0
+     71.5000    128.2500 -64.0
+     71.2500    129.5000 -64.0
+     72.5000    129.7500 -64.0
+     74.2500    131.5000 -64.0
+     73.5000    132.2500 -64.0
+     69.5000    134.2500 -64.0
+     69.5000    135.7500 -64.0
+     71.5000    134.7500 -64.0
+     73.5000    134.7500 -64.0
+     75.5000    133.7500 -64.0
+     76.2500    134.5000 -64.0
+     78.5000    134.7500 -64.0
+     81.5000    133.7500 -64.0
+     83.5000    136.7500 -64.0
+     89.7500    134.5000 -64.0
+     90.7500    132.5000 -64.0
+     89.7500    130.5000 -64.0
+     87.5000    130.2500 -64.0
+     87.2500    131.5000 -64.0
+     86.5000    133.2500 -64.0
+     82.5000    131.2500 -64.0
+     80.7500    130.5000 -64.0
+     81.5000    129.7500 -64.0
+     86.5000    129.7500 -64.0
+     86.7500    128.5000 -64.0
+     83.5000    128.2500 -64.0
+     81.7500    127.5000 -64.0
+} -64.0
+{ -64.0
+    154.2500    127.5000 -64.0
+    154.2500    128.5000 -64.0
+    151.5000    131.2500 -64.0
+    149.2500    137.5000 -64.0
+    152.5000    137.7500 -64.0
+    151.7500    136.5000 -64.0
+    151.7500    133.5000 -64.0
+    155.5000    130.7500 -64.0
+    157.5000    131.7500 -64.0
+    159.5000    130.7500 -64.0
+    156.7500    127.5000 -64.0
+} -64.0
+{ -64.0
+    154.2500    139.5000 -64.0
+    154.2500    140.5000 -64.0
+    155.5000    140.7500 -64.0
+} -64.0
+{ -64.0
+    150.7500     88.5000 -64.0
+    151.5000     87.7500 -64.0
+    153.2500     88.5000 -64.0
+    153.2500     91.5000 -64.0
+    152.5000     93.2500 -64.0
+    150.7500     90.5000 -64.0
+} -64.0
+{ -64.0
+    154.7500    106.5000 -64.0
+    155.5000    105.7500 -64.0
+    157.2500    107.5000 -64.0
+    157.2500    111.5000 -64.0
+    156.5000    113.2500 -64.0
+    155.7500    111.5000 -64.0
+    154.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+     52.7500    110.5000 -64.0
+     54.5000    109.7500 -64.0
+     55.2500    111.5000 -64.0
+     53.5000    112.2500 -64.0
+} -64.0
+{ -64.0
+     60.7500    128.5000 -64.0
+     61.5000    127.7500 -64.0
+     63.2500    128.5000 -64.0
+     62.5000    129.2500 -64.0
+} -64.0
+{ -64.0
+    126.7500    136.5000 -64.0
+    128.5000    135.7500 -64.0
+    129.2500    137.5000 -64.0
+    128.5000    139.2500 -64.0
+    126.7500    138.5000 -64.0
+} -64.0
+{ -64.0
+     45.7500    151.5000 -64.0
+     46.5000    150.7500 -64.0
+     48.2500    151.5000 -64.0
+     49.2500    153.5000 -64.0
+     47.5000    155.2500 -64.0
+     45.5000    155.2500 -64.0
+     44.7500    153.5000 -64.0
+} -64.0
+{ -64.0
+    104.5000    195.7500 -64.0
+    105.2500    196.5000 -64.0
+    103.5000    198.2500 -64.0
+    102.7500    197.5000 -64.0
+} -64.0
+v 452 z -140.000000 -64.0
+{ -64.0
+    106.2500     31.5000 -64.0
+    103.5000     33.2500 -64.0
+    100.5000     33.2500 -64.0
+    100.2500     35.5000 -64.0
+    103.5000     37.7500 -64.0
+    105.5000     36.7500 -64.0
+    108.7500     36.5000 -64.0
+    109.7500     34.5000 -64.0
+    111.5000     33.7500 -64.0
+    114.5000     37.7500 -64.0
+    116.5000     36.7500 -64.0
+    118.2500     39.5000 -64.0
+    121.2500     40.5000 -64.0
+    120.5000     41.2500 -64.0
+    114.5000     41.2500 -64.0
+    113.7500     39.5000 -64.0
+    109.5000     38.2500 -64.0
+    106.5000     41.2500 -64.0
+    104.5000     41.2500 -64.0
+    102.5000     42.2500 -64.0
+    100.7500     41.5000 -64.0
+    100.7500     38.5000 -64.0
+     97.5000     35.2500 -64.0
+     95.5000     36.2500 -64.0
+     91.5000     42.2500 -64.0
+     91.2500     45.5000 -64.0
+     96.2500     46.5000 -64.0
+     96.2500     48.5000 -64.0
+     94.5000     50.2500 -64.0
+     90.7500     46.5000 -64.0
+     89.5000     47.2500 -64.0
+     89.2500     49.5000 -64.0
+     90.2500     51.5000 -64.0
+     94.2500     52.5000 -64.0
+     94.2500     54.5000 -64.0
+     99.5000     45.7500 -64.0
+    103.5000     42.7500 -64.0
+    108.5000     43.7500 -64.0
+    111.2500     46.5000 -64.0
+    116.5000     43.7500 -64.0
+    121.5000     44.7500 -64.0
+    127.2500     53.5000 -64.0
+    127.2500     55.5000 -64.0
+    125.5000     60.2500 -64.0
+    126.2500     61.5000 -64.0
+    126.2500     64.5000 -64.0
+    129.2500     70.5000 -64.0
+    129.5000     76.7500 -64.0
+    134.5000     77.7500 -64.0
+    138.5000     74.7500 -64.0
+    138.7500     65.5000 -64.0
+    137.7500     63.5000 -64.0
+    137.7500     60.5000 -64.0
+    136.5000     59.2500 -64.0
+    134.5000     62.2500 -64.0
+    129.5000     65.2500 -64.0
+    127.7500     64.5000 -64.0
+    127.7500     62.5000 -64.0
+    130.5000     60.7500 -64.0
+    130.7500     58.5000 -64.0
+    129.5000     58.2500 -64.0
+    127.7500     56.5000 -64.0
+    127.7500     53.5000 -64.0
+    128.5000     51.7500 -64.0
+    133.5000     54.7500 -64.0
+    134.5000     56.7500 -64.0
+    136.5000     57.7500 -64.0
+    136.7500     55.5000 -64.0
+    135.7500     53.5000 -64.0
+    135.7500     51.5000 -64.0
+    133.7500     50.5000 -64.0
+    132.5000     48.2500 -64.0
+    130.5000     47.2500 -64.0
+    127.5000     50.2500 -64.0
+    124.7500     46.5000 -64.0
+    125.5000     44.7500 -64.0
+    129.5000     45.7500 -64.0
+    129.7500     43.5000 -64.0
+    127.7500     36.5000 -64.0
+    124.5000     36.2500 -64.0
+    120.5000     33.2500 -64.0
+    118.5000     34.2500 -64.0
+    116.7500     31.5000 -64.0
+    113.5000     31.2500 -64.0
+    111.5000     32.2500 -64.0
+    109.7500     31.5000 -64.0
+} -64.0
+{ -64.0
+     83.2500     60.5000 -64.0
+     82.2500     64.5000 -64.0
+     87.5000     66.7500 -64.0
+     89.5000     65.7500 -64.0
+     89.7500     63.5000 -64.0
+     87.7500     62.5000 -64.0
+     86.7500     60.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500     65.5000 -64.0
+     91.2500     67.5000 -64.0
+     92.7500     66.5000 -64.0
+} -64.0
+{ -64.0
+     82.2500     68.5000 -64.0
+     82.2500     71.5000 -64.0
+     86.5000     74.7500 -64.0
+     90.5000     72.7500 -64.0
+     89.7500     70.5000 -64.0
+} -64.0
+{ -64.0
+     62.2500     79.5000 -64.0
+     61.2500     84.5000 -64.0
+     63.5000     82.7500 -64.0
+     64.2500     83.5000 -64.0
+     63.2500     87.5000 -64.0
+     61.5000     89.2500 -64.0
+     60.7500     88.5000 -64.0
+     59.5000     89.2500 -64.0
+     58.2500     95.5000 -64.0
+     50.2500    109.5000 -64.0
+     52.5000    112.7500 -64.0
+     54.5000    113.7500 -64.0
+     56.5000    112.7500 -64.0
+     57.7500    102.5000 -64.0
+     64.5000     88.7500 -64.0
+     64.7500     79.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500     79.5000 -64.0
+     88.5000     81.2500 -64.0
+     85.5000     80.2500 -64.0
+     83.5000     83.7500 -64.0
+     85.5000     82.7500 -64.0
+     92.5000     81.7500 -64.0
+} -64.0
+{ -64.0
+    151.2500     84.5000 -64.0
+    149.5000     87.2500 -64.0
+    149.2500     95.5000 -64.0
+    153.2500    103.5000 -64.0
+    153.2500    106.5000 -64.0
+    154.2500    108.5000 -64.0
+    154.2500    113.5000 -64.0
+    155.2500    115.5000 -64.0
+    156.7500    115.5000 -64.0
+    159.5000    111.7500 -64.0
+    158.7500    110.5000 -64.0
+    157.7500    104.5000 -64.0
+    155.7500    100.5000 -64.0
+    155.7500     95.5000 -64.0
+    153.7500     91.5000 -64.0
+    153.7500     87.5000 -64.0
+    152.7500     84.5000 -64.0
+} -64.0
+{ -64.0
+     64.2500    117.5000 -64.0
+     64.2500    118.5000 -64.0
+     59.5000    124.2500 -64.0
+     55.5000    124.2500 -64.0
+     54.5000    126.2500 -64.0
+     50.5000    126.2500 -64.0
+     50.2500    127.5000 -64.0
+     44.5000    132.2500 -64.0
+     40.5000    139.2500 -64.0
+     40.2500    141.5000 -64.0
+     39.5000    143.2500 -64.0
+     39.2500    147.5000 -64.0
+     40.2500    149.5000 -64.0
+     40.2500    152.5000 -64.0
+     42.2500    156.5000 -64.0
+     42.2500    158.5000 -64.0
+     43.2500    160.5000 -64.0
+     43.2500    162.5000 -64.0
+     52.2500    180.5000 -64.0
+     53.5000    182.7500 -64.0
+     55.5000    183.7500 -64.0
+     65.2500    195.5000 -64.0
+     77.2500    206.5000 -64.0
+     81.5000    209.7500 -64.0
+     83.5000    210.7500 -64.0
+     85.2500    211.5000 -64.0
+     96.5000    211.7500 -64.0
+     98.2500    212.5000 -64.0
+    105.5000    212.7500 -64.0
+    107.5000    211.7500 -64.0
+    113.5000    211.7500 -64.0
+    115.5000    210.7500 -64.0
+    118.5000    210.7500 -64.0
+    125.5000    203.7500 -64.0
+    127.5000    203.7500 -64.0
+    130.5000    200.7500 -64.0
+    142.5000    191.7500 -64.0
+    149.5000    187.7500 -64.0
+    155.7500    180.5000 -64.0
+    158.5000    176.7500 -64.0
+    158.7500    174.5000 -64.0
+    161.7500    168.5000 -64.0
+    166.5000    159.7500 -64.0
+    166.7500    157.5000 -64.0
+    168.7500    152.5000 -64.0
+    169.5000    150.7500 -64.0
+    169.7500    144.5000 -64.0
+    167.7500    140.5000 -64.0
+    167.7500    138.5000 -64.0
+    164.7500    132.5000 -64.0
+    157.5000    128.2500 -64.0
+    154.2500    129.5000 -64.0
+    160.5000    130.7500 -64.0
+    161.2500    132.5000 -64.0
+    160.2500    135.5000 -64.0
+    158.5000    136.2500 -64.0
+    158.2500    137.5000 -64.0
+    163.5000    135.7500 -64.0
+    165.2500    140.5000 -64.0
+    164.2500    145.5000 -64.0
+    167.2500    147.5000 -64.0
+    167.2500    149.5000 -64.0
+    165.5000    151.2500 -64.0
+    166.2500    152.5000 -64.0
+    166.2500    154.5000 -64.0
+    162.5000    158.2500 -64.0
+    160.5000    156.2500 -64.0
+    158.5000    157.2500 -64.0
+    156.5000    157.2500 -64.0
+    155.7500    155.5000 -64.0
+    152.5000    155.2500 -64.0
+    149.7500    151.5000 -64.0
+    150.7500    148.5000 -64.0
+    152.5000    147.7500 -64.0
+    149.7500    145.5000 -64.0
+    149.7500    142.5000 -64.0
+    148.7500    139.5000 -64.0
+    147.5000    139.2500 -64.0
+    146.7500    137.5000 -64.0
+    146.2500    138.5000 -64.0
+    145.5000    140.2500 -64.0
+    143.5000    140.2500 -64.0
+    143.2500    143.5000 -64.0
+    151.2500    159.5000 -64.0
+    151.2500    168.5000 -64.0
+    147.2500    176.5000 -64.0
+    139.5000    184.2500 -64.0
+    129.5000    189.2500 -64.0
+    127.5000    189.2500 -64.0
+    123.5000    191.2500 -64.0
+    119.5000    191.2500 -64.0
+    117.5000    192.2500 -64.0
+    112.5000    191.2500 -64.0
+    109.7500    188.5000 -64.0
+    106.7500    184.5000 -64.0
+    104.7500    178.5000 -64.0
+    103.5000    179.2500 -64.0
+    101.2500    186.5000 -64.0
+     96.5000    191.2500 -64.0
+     88.5000    191.2500 -64.0
+     79.5000    188.2500 -64.0
+     72.5000    185.2500 -64.0
+     69.5000    182.2500 -64.0
+     67.5000    181.2500 -64.0
+     59.7500    174.5000 -64.0
+     55.7500    167.5000 -64.0
+     55.7500    150.5000 -64.0
+     54.7500    147.5000 -64.0
+     56.7500    142.5000 -64.0
+     61.5000    137.2500 -64.0
+     58.5000    138.2500 -64.0
+     54.5000    144.2500 -64.0
+     52.7500    143.5000 -64.0
+     50.5000    145.2500 -64.0
+     48.5000    145.2500 -64.0
+     48.2500    146.5000 -64.0
+     52.5000    146.7500 -64.0
+     54.2500    150.5000 -64.0
+     52.5000    152.2500 -64.0
+     52.2500    154.5000 -64.0
+     51.5000    156.2500 -64.0
+     50.7500    154.5000 -64.0
+     48.5000    152.2500 -64.0
+     46.5000    151.2500 -64.0
+     43.7500    147.5000 -64.0
+     44.5000    145.7500 -64.0
+     44.7500    142.5000 -64.0
+     43.7500    140.5000 -64.0
+     45.5000    138.7500 -64.0
+     47.5000    138.7500 -64.0
+     46.7500    137.5000 -64.0
+     46.7500    132.5000 -64.0
+     49.5000    129.7500 -64.0
+     54.5000    129.7500 -64.0
+     56.2500    133.5000 -64.0
+     57.5000    133.7500 -64.0
+     59.5000    131.7500 -64.0
+     60.2500    132.5000 -64.0
+     63.5000    132.7500 -64.0
+     64.5000    130.7500 -64.0
+     66.7500    129.5000 -64.0
+     67.7500    127.5000 -64.0
+     69.5000    126.7500 -64.0
+     75.5000    128.7500 -64.0
+     77.2500    129.5000 -64.0
+     81.5000    129.7500 -64.0
+     86.5000    127.7500 -64.0
+     87.7500    124.5000 -64.0
+     91.7500    121.5000 -64.0
+     89.5000    121.2500 -64.0
+     81.5000    128.2500 -64.0
+     77.5000    126.2500 -64.0
+     75.5000    127.2500 -64.0
+     73.5000    127.2500 -64.0
+     67.5000    125.2500 -64.0
+     66.7500    123.5000 -64.0
+     65.7500    121.5000 -64.0
+     67.5000    119.7500 -64.0
+     67.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+     99.2500    119.5000 -64.0
+     98.5000    120.2500 -64.0
+     96.2500    120.5000 -64.0
+    100.5000    120.7500 -64.0
+    101.2500    122.5000 -64.0
+     94.5000    126.2500 -64.0
+     91.5000    126.2500 -64.0
+     87.5000    128.2500 -64.0
+     87.2500    131.5000 -64.0
+     86.5000    133.2500 -64.0
+     81.5000    133.2500 -64.0
+     79.5000    134.2500 -64.0
+     77.5000    134.2500 -64.0
+     74.5000    133.2500 -64.0
+     70.5000    135.2500 -64.0
+     67.2500    135.5000 -64.0
+     76.5000    135.7500 -64.0
+     78.2500    137.5000 -64.0
+     86.5000    137.7500 -64.0
+     89.7500    134.5000 -64.0
+     90.7500    132.5000 -64.0
+     88.7500    130.5000 -64.0
+     89.5000    128.7500 -64.0
+     94.5000    128.7500 -64.0
+     95.7500    127.5000 -64.0
+    102.5000    122.7500 -64.0
+    109.5000    122.7500 -64.0
+    115.5000    125.7500 -64.0
+    120.2500    130.5000 -64.0
+    123.2500    134.5000 -64.0
+    123.2500    139.5000 -64.0
+    124.5000    140.7500 -64.0
+    128.2500    143.5000 -64.0
+    137.5000    143.7500 -64.0
+    139.5000    142.7500 -64.0
+    138.7500    141.5000 -64.0
+    136.5000    141.2500 -64.0
+    134.5000    142.2500 -64.0
+    132.5000    142.2500 -64.0
+    130.7500    140.5000 -64.0
+    130.7500    138.5000 -64.0
+    129.7500    135.5000 -64.0
+    126.5000    135.2500 -64.0
+    124.7500    133.5000 -64.0
+    124.7500    131.5000 -64.0
+    117.5000    125.2500 -64.0
+    113.7500    122.5000 -64.0
+    114.5000    121.7500 -64.0
+    120.5000    121.7500 -64.0
+    123.5000    122.7500 -64.0
+    132.2500    132.5000 -64.0
+    133.5000    131.7500 -64.0
+    136.5000    131.7500 -64.0
+    135.7500    130.5000 -64.0
+    137.5000    129.7500 -64.0
+    136.5000    128.2500 -64.0
+    132.5000    130.2500 -64.0
+    131.7500    128.5000 -64.0
+    126.5000    123.2500 -64.0
+    122.5000    121.2500 -64.0
+    113.5000    120.2500 -64.0
+    111.5000    121.2500 -64.0
+    109.7500    120.5000 -64.0
+    102.5000    120.2500 -64.0
+} -64.0
+{ -64.0
+    144.2500    119.5000 -64.0
+    143.5000    121.2500 -64.0
+    145.2500    123.5000 -64.0
+    146.5000    121.7500 -64.0
+    149.7500    121.5000 -64.0
+    147.5000    121.2500 -64.0
+    145.7500    119.5000 -64.0
+} -64.0
+{ -64.0
+    151.2500    133.5000 -64.0
+    150.2500    138.5000 -64.0
+    151.5000    138.7500 -64.0
+    151.7500    134.5000 -64.0
+} -64.0
+{ -64.0
+    153.2500    139.5000 -64.0
+    153.2500    140.5000 -64.0
+    154.5000    141.7500 -64.0
+    154.7500    139.5000 -64.0
+} -64.0
+{ -64.0
+    158.2500    142.5000 -64.0
+    158.2500    143.5000 -64.0
+    159.5000    143.7500 -64.0
+    159.7500    142.5000 -64.0
+} -64.0
+{ -64.0
+    158.2500    153.5000 -64.0
+    159.2500    154.5000 -64.0
+    159.7500    153.5000 -64.0
+} -64.0
+{ -64.0
+    110.7500     40.5000 -64.0
+    111.5000     39.7500 -64.0
+    112.2500     40.5000 -64.0
+    111.5000     41.2500 -64.0
+} -64.0
+{ -64.0
+     94.7500     41.5000 -64.0
+     95.5000     40.7500 -64.0
+     97.5000     40.7500 -64.0
+     99.2500     42.5000 -64.0
+     98.5000     44.2500 -64.0
+     95.5000     43.2500 -64.0
+} -64.0
+{ -64.0
+    123.7500     42.5000 -64.0
+    124.5000     41.7500 -64.0
+    125.2500     42.5000 -64.0
+    124.5000     44.2500 -64.0
+} -64.0
+{ -64.0
+    132.7500     68.5000 -64.0
+    133.5000     67.7500 -64.0
+    135.5000     67.7500 -64.0
+    137.2500     69.5000 -64.0
+    136.5000     70.2500 -64.0
+    132.5000     72.2500 -64.0
+    130.5000     72.2500 -64.0
+    129.7500     70.5000 -64.0
+} -64.0
+{ -64.0
+    150.7500     88.5000 -64.0
+    151.5000     87.7500 -64.0
+    152.2500     89.5000 -64.0
+    153.2500     91.5000 -64.0
+    153.2500     94.5000 -64.0
+    152.5000     96.2500 -64.0
+    151.7500     94.5000 -64.0
+    150.7500     92.5000 -64.0
+} -64.0
+{ -64.0
+    152.7500     98.5000 -64.0
+    153.5000     97.7500 -64.0
+    154.2500     99.5000 -64.0
+    153.5000    101.2500 -64.0
+    152.7500    100.5000 -64.0
+} -64.0
+{ -64.0
+    154.7500    105.5000 -64.0
+    155.5000    104.7500 -64.0
+    156.2500    105.5000 -64.0
+    155.5000    106.2500 -64.0
+} -64.0
+{ -64.0
+     53.7500    106.5000 -64.0
+     54.5000    105.7500 -64.0
+     55.2500    106.5000 -64.0
+     55.2500    109.5000 -64.0
+     54.5000    111.2500 -64.0
+     53.7500    110.5000 -64.0
+} -64.0
+{ -64.0
+    154.7500    108.5000 -64.0
+    155.5000    107.7500 -64.0
+    156.2500    108.5000 -64.0
+    157.2500    110.5000 -64.0
+    156.5000    112.2500 -64.0
+    154.7500    110.5000 -64.0
+} -64.0
+{ -64.0
+     63.5000    124.7500 -64.0
+     65.5000    124.7500 -64.0
+     66.2500    126.5000 -64.0
+     63.5000    128.2500 -64.0
+     61.5000    129.2500 -64.0
+     59.7500    128.5000 -64.0
+} -64.0
+{ -64.0
+    125.7500    137.5000 -64.0
+    127.5000    136.7500 -64.0
+    129.2500    137.5000 -64.0
+    129.2500    140.5000 -64.0
+    127.5000    141.2500 -64.0
+    125.7500    139.5000 -64.0
+} -64.0
+{ -64.0
+     45.7500    153.5000 -64.0
+     46.5000    152.7500 -64.0
+     48.2500    153.5000 -64.0
+     47.5000    154.2500 -64.0
+} -64.0
+v 420 z -142.000000 -64.0
+{ -64.0
+    105.2500     30.5000 -64.0
+    104.5000     31.2500 -64.0
+    101.5000     31.2500 -64.0
+     99.5000     33.2500 -64.0
+    101.5000     35.7500 -64.0
+    103.5000     36.7500 -64.0
+    105.5000     35.7500 -64.0
+    108.5000     36.7500 -64.0
+    111.5000     32.7500 -64.0
+    114.5000     36.7500 -64.0
+    116.5000     35.7500 -64.0
+    118.2500     37.5000 -64.0
+    117.5000     39.2500 -64.0
+    115.5000     39.2500 -64.0
+    113.7500     37.5000 -64.0
+    110.5000     37.2500 -64.0
+    106.5000     39.2500 -64.0
+    104.5000     39.2500 -64.0
+    102.5000     40.2500 -64.0
+    101.7500     38.5000 -64.0
+     97.5000     34.2500 -64.0
+     94.5000     35.2500 -64.0
+     92.2500     39.5000 -64.0
+     90.2500     43.5000 -64.0
+     96.2500     46.5000 -64.0
+     94.5000     48.2500 -64.0
+     91.7500     45.5000 -64.0
+     89.5000     45.2500 -64.0
+     88.2500     48.5000 -64.0
+     90.5000     50.7500 -64.0
+     94.5000     52.7500 -64.0
+     96.7500     47.5000 -64.0
+    102.5000     40.7500 -64.0
+    104.5000     40.7500 -64.0
+    109.5000     41.7500 -64.0
+    109.7500     39.5000 -64.0
+    111.5000     37.7500 -64.0
+    113.2500     39.5000 -64.0
+    112.5000     41.2500 -64.0
+    113.5000     42.7500 -64.0
+    115.5000     41.7500 -64.0
+    121.5000     41.7500 -64.0
+    123.2500     43.5000 -64.0
+    126.2500     49.5000 -64.0
+    126.2500     51.5000 -64.0
+    127.2500     53.5000 -64.0
+    129.5000     52.7500 -64.0
+    133.2500     55.5000 -64.0
+    133.2500     57.5000 -64.0
+    136.5000     57.7500 -64.0
+    136.7500     55.5000 -64.0
+    135.7500     53.5000 -64.0
+    135.7500     51.5000 -64.0
+    131.5000     46.2500 -64.0
+    127.5000     48.2500 -64.0
+    125.7500     45.5000 -64.0
+    126.5000     44.7500 -64.0
+    129.5000     44.7500 -64.0
+    132.5000     43.7500 -64.0
+    132.5000     42.2500 -64.0
+    130.5000     41.2500 -64.0
+    128.7500     40.5000 -64.0
+    128.7500     35.5000 -64.0
+    127.7500     33.5000 -64.0
+    126.5000     34.2500 -64.0
+    124.5000     35.2500 -64.0
+    122.7500     32.5000 -64.0
+    120.5000     32.2500 -64.0
+    118.5000     33.2500 -64.0
+    116.7500     30.5000 -64.0
+} -64.0
+{ -64.0
+    127.2500     56.5000 -64.0
+    126.5000     57.2500 -64.0
+    126.2500     60.5000 -64.0
+    127.2500     63.5000 -64.0
+    127.7500     62.5000 -64.0
+    130.7500     60.5000 -64.0
+    131.7500     58.5000 -64.0
+    128.7500     56.5000 -64.0
+} -64.0
+{ -64.0
+     84.2500     58.5000 -64.0
+     82.5000     62.2500 -64.0
+     83.2500     64.5000 -64.0
+     88.2500     66.5000 -64.0
+     91.7500     65.5000 -64.0
+     92.7500     63.5000 -64.0
+     89.5000     62.2500 -64.0
+     86.7500     58.5000 -64.0
+} -64.0
+{ -64.0
+    136.2500     59.5000 -64.0
+    130.5000     64.2500 -64.0
+    128.5000     64.2500 -64.0
+    128.2500     69.5000 -64.0
+    129.2500     71.5000 -64.0
+    129.2500     75.5000 -64.0
+    131.2500     76.5000 -64.0
+    137.7500     76.5000 -64.0
+    139.7500     72.5000 -64.0
+    138.7500     70.5000 -64.0
+    134.5000     70.2500 -64.0
+    130.5000     72.2500 -64.0
+    129.7500     71.5000 -64.0
+    130.5000     69.7500 -64.0
+    132.5000     69.7500 -64.0
+    134.5000     67.7500 -64.0
+    137.7500     67.5000 -64.0
+    138.7500     65.5000 -64.0
+    137.7500     63.5000 -64.0
+    137.7500     60.5000 -64.0
+} -64.0
+{ -64.0
+     83.2500     68.5000 -64.0
+     82.2500     69.5000 -64.0
+     84.2500     73.5000 -64.0
+     88.5000     73.7500 -64.0
+     90.5000     72.7500 -64.0
+     90.5000     70.2500 -64.0
+     86.7500     68.5000 -64.0
+} -64.0
+{ -64.0
+     63.2500     79.5000 -64.0
+     61.5000     83.2500 -64.0
+     61.2500     86.5000 -64.0
+     59.2500     90.5000 -64.0
+     58.2500     95.5000 -64.0
+     55.5000    101.2500 -64.0
+     51.5000    107.2500 -64.0
+     51.2500    110.5000 -64.0
+     53.2500    112.5000 -64.0
+     55.7500    112.5000 -64.0
+     57.7500    108.5000 -64.0
+     58.7500    101.5000 -64.0
+     62.7500     95.5000 -64.0
+     65.5000     89.7500 -64.0
+     65.7500     83.5000 -64.0
+     64.7500     80.5000 -64.0
+} -64.0
+{ -64.0
+     87.2500     82.5000 -64.0
+     85.2500     83.5000 -64.0
+     87.5000     83.7500 -64.0
+     88.7500     82.5000 -64.0
+} -64.0
+{ -64.0
+     82.2500     84.5000 -64.0
+     81.5000     85.7500 -64.0
+     84.7500     84.5000 -64.0
+} -64.0
+{ -64.0
+    151.2500     84.5000 -64.0
+    148.5000     90.2500 -64.0
+    148.2500     96.5000 -64.0
+    151.2500    100.5000 -64.0
+    151.7500     99.5000 -64.0
+    150.7500     97.5000 -64.0
+    149.7500     90.5000 -64.0
+    151.5000     88.7500 -64.0
+    152.2500     89.5000 -64.0
+    152.2500     92.5000 -64.0
+    153.2500     94.5000 -64.0
+    152.2500     96.5000 -64.0
+    155.2500    102.5000 -64.0
+    154.5000    104.2500 -64.0
+    152.7500    101.5000 -64.0
+    152.2500    102.5000 -64.0
+    154.2500    108.5000 -64.0
+    153.2500    111.5000 -64.0
+    154.2500    114.5000 -64.0
+    157.5000    114.7500 -64.0
+    158.5000    112.7500 -64.0
+    158.7500    107.5000 -64.0
+    157.7500    105.5000 -64.0
+    157.7500    103.5000 -64.0
+    155.7500     99.5000 -64.0
+    155.7500     96.5000 -64.0
+    153.7500     92.5000 -64.0
+    153.7500     88.5000 -64.0
+    152.7500     85.5000 -64.0
+} -64.0
+{ -64.0
+     65.2500    116.5000 -64.0
+     63.2500    120.5000 -64.0
+     59.5000    124.2500 -64.0
+     56.5000    124.2500 -64.0
+     56.2500    125.5000 -64.0
+     50.2500    128.5000 -64.0
+     54.5000    128.7500 -64.0
+     56.2500    131.5000 -64.0
+     56.2500    133.5000 -64.0
+     59.5000    134.7500 -64.0
+     61.5000    133.7500 -64.0
+     64.5000    133.7500 -64.0
+     66.2500    135.5000 -64.0
+     65.5000    136.2500 -64.0
+     65.5000    137.7500 -64.0
+     69.5000    135.7500 -64.0
+     72.5000    135.7500 -64.0
+     75.2500    138.5000 -64.0
+     74.2500    141.5000 -64.0
+     79.5000    141.7500 -64.0
+     82.5000    138.7500 -64.0
+     87.5000    138.7500 -64.0
+     89.5000    136.7500 -64.0
+     89.7500    131.5000 -64.0
+     94.5000    128.7500 -64.0
+    103.7500    121.5000 -64.0
+     98.2500    119.5000 -64.0
+     99.2500    121.5000 -64.0
+     99.2500    123.5000 -64.0
+     97.2500    125.5000 -64.0
+     89.2500    128.5000 -64.0
+     85.5000    134.2500 -64.0
+     83.7500    133.5000 -64.0
+     81.5000    134.2500 -64.0
+     79.5000    137.2500 -64.0
+     75.7500    135.5000 -64.0
+     69.5000    135.2500 -64.0
+     65.5000    133.2500 -64.0
+     64.7500    131.5000 -64.0
+     58.7500    129.5000 -64.0
+     58.7500    127.5000 -64.0
+     61.5000    123.7500 -64.0
+     66.5000    123.7500 -64.0
+     66.7500    121.5000 -64.0
+     65.7500    119.5000 -64.0
+     66.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+    144.2500    118.5000 -64.0
+    143.2500    119.5000 -64.0
+    144.2500    121.5000 -64.0
+    145.5000    120.7500 -64.0
+    145.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500    120.5000 -64.0
+    113.5000    122.2500 -64.0
+    111.2500    122.5000 -64.0
+    119.2500    129.5000 -64.0
+    122.2500    133.5000 -64.0
+    123.2500    140.5000 -64.0
+    125.2500    144.5000 -64.0
+    127.5000    144.7500 -64.0
+    124.7500    140.5000 -64.0
+    125.5000    136.7500 -64.0
+    130.7500    140.5000 -64.0
+    129.7500    138.5000 -64.0
+    129.7500    136.5000 -64.0
+    125.5000    136.2500 -64.0
+    123.7500    131.5000 -64.0
+    117.7500    125.5000 -64.0
+    116.7500    123.5000 -64.0
+    117.5000    121.7500 -64.0
+    119.5000    120.7500 -64.0
+    124.5000    121.7500 -64.0
+    128.2500    125.5000 -64.0
+    132.5000    132.7500 -64.0
+    134.5000    131.7500 -64.0
+    135.2500    132.5000 -64.0
+    136.7500    132.5000 -64.0
+    130.7500    127.5000 -64.0
+    128.5000    123.2500 -64.0
+    124.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+     88.2500    121.5000 -64.0
+     84.5000    125.2500 -64.0
+     78.5000    129.2500 -64.0
+     76.5000    129.2500 -64.0
+     78.5000    130.7500 -64.0
+     80.5000    129.7500 -64.0
+     82.5000    129.7500 -64.0
+     84.7500    126.5000 -64.0
+     89.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+     68.2500    126.5000 -64.0
+     69.2500    127.5000 -64.0
+     66.2500    129.5000 -64.0
+     70.5000    129.7500 -64.0
+     74.5000    127.7500 -64.0
+     76.5000    127.7500 -64.0
+     76.7500    126.5000 -64.0
+} -64.0
+{ -64.0
+     47.2500    129.5000 -64.0
+     45.2500    131.5000 -64.0
+     40.5000    141.2500 -64.0
+     40.2500    149.5000 -64.0
+     43.2500    155.5000 -64.0
+     44.2500    161.5000 -64.0
+     48.5000    168.7500 -64.0
+     52.2500    177.5000 -64.0
+     61.5000    187.7500 -64.0
+     65.5000    189.7500 -64.0
+     68.2500    192.5000 -64.0
+     69.2500    194.5000 -64.0
+     72.5000    196.7500 -64.0
+     80.5000    202.7500 -64.0
+     84.5000    204.7500 -64.0
+     88.2500    208.5000 -64.0
+     96.5000    209.7500 -64.0
+    100.2500    211.5000 -64.0
+    103.5000    211.7500 -64.0
+    105.5000    210.7500 -64.0
+    108.5000    210.7500 -64.0
+    113.5000    208.7500 -64.0
+    114.7500    204.5000 -64.0
+    120.5000    200.7500 -64.0
+    122.7500    200.5000 -64.0
+    131.5000    196.7500 -64.0
+    138.7500    190.5000 -64.0
+    147.5000    186.7500 -64.0
+    151.7500    182.5000 -64.0
+    158.5000    172.7500 -64.0
+    160.5000    164.7500 -64.0
+    162.5000    163.7500 -64.0
+    165.5000    158.7500 -64.0
+    168.5000    150.7500 -64.0
+    168.7500    142.5000 -64.0
+    166.7500    138.5000 -64.0
+    166.7500    135.5000 -64.0
+    161.7500    129.5000 -64.0
+    159.5000    129.2500 -64.0
+    161.2500    132.5000 -64.0
+    155.5000    138.2500 -64.0
+    152.5000    138.2500 -64.0
+    149.5000    141.2500 -64.0
+    145.2500    141.5000 -64.0
+    146.2500    143.5000 -64.0
+    144.5000    145.2500 -64.0
+    141.7500    143.5000 -64.0
+    133.5000    143.2500 -64.0
+    131.7500    141.5000 -64.0
+    130.5000    143.2500 -64.0
+    130.2500    145.5000 -64.0
+    138.5000    145.7500 -64.0
+    144.2500    148.5000 -64.0
+    147.2500    154.5000 -64.0
+    147.2500    156.5000 -64.0
+    149.2500    160.5000 -64.0
+    149.2500    168.5000 -64.0
+    145.2500    176.5000 -64.0
+    135.5000    184.2500 -64.0
+    125.5000    189.2500 -64.0
+    123.5000    189.2500 -64.0
+    121.5000    190.2500 -64.0
+    116.5000    190.2500 -64.0
+    111.5000    188.2500 -64.0
+    108.7500    184.5000 -64.0
+    105.7500    178.5000 -64.0
+    105.5000    174.2500 -64.0
+    103.5000    173.2500 -64.0
+    101.2500    184.5000 -64.0
+     97.5000    188.2500 -64.0
+     93.5000    190.2500 -64.0
+     84.5000    188.2500 -64.0
+     77.7500    185.5000 -64.0
+     75.5000    185.2500 -64.0
+     61.7500    174.5000 -64.0
+     56.7500    164.5000 -64.0
+     58.7500    145.5000 -64.0
+     56.5000    141.2500 -64.0
+     56.2500    145.5000 -64.0
+     54.5000    146.2500 -64.0
+     52.7500    144.5000 -64.0
+     53.7500    141.5000 -64.0
+     51.5000    143.2500 -64.0
+     48.5000    143.2500 -64.0
+     47.2500    147.5000 -64.0
+     45.5000    149.2500 -64.0
+     43.7500    148.5000 -64.0
+     42.7500    146.5000 -64.0
+     45.5000    144.7500 -64.0
+     45.7500    141.5000 -64.0
+     44.7500    139.5000 -64.0
+     48.7500    133.5000 -64.0
+     47.7500    131.5000 -64.0
+     48.7500    129.5000 -64.0
+} -64.0
+{ -64.0
+    126.7500     35.5000 -64.0
+    127.5000     34.7500 -64.0
+    128.2500     35.5000 -64.0
+    127.5000     36.2500 -64.0
+} -64.0
+{ -64.0
+     94.7500     40.5000 -64.0
+     95.5000     39.7500 -64.0
+     98.2500     41.5000 -64.0
+     96.5000     42.2500 -64.0
+} -64.0
+{ -64.0
+     61.7500     84.5000 -64.0
+     62.5000     83.7500 -64.0
+     64.2500     84.5000 -64.0
+     64.2500     87.5000 -64.0
+     62.5000     91.2500 -64.0
+     60.7500     90.5000 -64.0
+     61.5000     88.7500 -64.0
+} -64.0
+{ -64.0
+     59.7500     94.5000 -64.0
+     60.5000     93.7500 -64.0
+     61.2500     94.5000 -64.0
+     60.5000     96.2500 -64.0
+} -64.0
+{ -64.0
+     55.7500    103.5000 -64.0
+     56.5000    102.7500 -64.0
+     57.2500    103.5000 -64.0
+     56.5000    105.2500 -64.0
+     56.2500    108.5000 -64.0
+     54.5000    110.2500 -64.0
+     53.7500    108.5000 -64.0
+} -64.0
+{ -64.0
+    154.7500    107.5000 -64.0
+    155.5000    106.7500 -64.0
+    156.2500    107.5000 -64.0
+    156.2500    109.5000 -64.0
+    155.5000    111.2500 -64.0
+    154.7500    110.5000 -64.0
+} -64.0
+{ -64.0
+    159.5000    135.7500 -64.0
+    161.5000    135.7500 -64.0
+    163.2500    136.5000 -64.0
+    163.2500    138.5000 -64.0
+    162.5000    140.2500 -64.0
+    163.5000    140.7500 -64.0
+    165.2500    143.5000 -64.0
+    165.2500    147.5000 -64.0
+    164.5000    149.2500 -64.0
+    165.2500    150.5000 -64.0
+    165.2500    154.5000 -64.0
+    161.5000    156.2500 -64.0
+    159.7500    155.5000 -64.0
+    159.7500    153.5000 -64.0
+    154.7500    148.5000 -64.0
+    154.7500    146.5000 -64.0
+    157.5000    143.7500 -64.0
+    161.5000    143.7500 -64.0
+    161.7500    142.5000 -64.0
+    158.5000    142.2500 -64.0
+    156.7500    141.5000 -64.0
+    156.7500    138.5000 -64.0
+} -64.0
+{ -64.0
+     50.7500    147.5000 -64.0
+     52.5000    146.7500 -64.0
+     55.5000    147.7500 -64.0
+     57.2500    150.5000 -64.0
+     56.5000    152.2500 -64.0
+     52.5000    154.2500 -64.0
+     50.5000    154.2500 -64.0
+     47.7500    150.5000 -64.0
+} -64.0
+{ -64.0
+     49.7500    157.5000 -64.0
+     50.5000    156.7500 -64.0
+     51.2500    157.5000 -64.0
+     50.5000    158.2500 -64.0
+} -64.0
+v 388 z -144.000000 -64.0
+{ -64.0
+    106.2500     29.5000 -64.0
+    104.5000     31.2500 -64.0
+    101.2500     30.5000 -64.0
+     98.5000     34.2500 -64.0
+     96.5000     33.2500 -64.0
+     94.5000     35.2500 -64.0
+     94.2500     38.5000 -64.0
+     91.5000     40.2500 -64.0
+     91.2500     43.5000 -64.0
+     89.5000     45.2500 -64.0
+     89.2500     48.5000 -64.0
+     93.2500     52.5000 -64.0
+     95.5000     50.7500 -64.0
+     95.7500     48.5000 -64.0
+     99.5000     41.7500 -64.0
+    103.5000     38.7500 -64.0
+    107.5000     38.7500 -64.0
+    111.5000     36.7500 -64.0
+    113.2500     37.5000 -64.0
+    114.2500     39.5000 -64.0
+    116.5000     39.7500 -64.0
+    118.5000     38.7500 -64.0
+    121.5000     39.7500 -64.0
+    126.2500     47.5000 -64.0
+    126.2500     50.5000 -64.0
+    128.2500     55.5000 -64.0
+    126.5000     57.2500 -64.0
+    126.2500     60.5000 -64.0
+    128.2500     62.5000 -64.0
+    128.2500     68.5000 -64.0
+    129.5000     69.7500 -64.0
+    133.5000     67.7500 -64.0
+    136.5000     67.7500 -64.0
+    138.5000     66.7500 -64.0
+    138.7500     62.5000 -64.0
+    137.7500     60.5000 -64.0
+    135.5000     60.2500 -64.0
+    132.5000     61.2500 -64.0
+    129.5000     64.2500 -64.0
+    128.7500     62.5000 -64.0
+    136.5000     56.7500 -64.0
+    136.7500     54.5000 -64.0
+    134.7500     52.5000 -64.0
+    134.7500     49.5000 -64.0
+    132.7500     48.5000 -64.0
+    132.7500     46.5000 -64.0
+    130.7500     44.5000 -64.0
+    131.5000     43.7500 -64.0
+    131.7500     40.5000 -64.0
+    127.7500     39.5000 -64.0
+    128.5000     37.2500 -64.0
+    126.5000     38.2500 -64.0
+    122.7500     37.5000 -64.0
+    124.5000     34.7500 -64.0
+    121.7500     30.5000 -64.0
+    118.5000     31.2500 -64.0
+    116.7500     29.5000 -64.0
+    113.5000     29.2500 -64.0
+    111.5000     30.2500 -64.0
+    110.7500     29.5000 -64.0
+} -64.0
+{ -64.0
+    128.2500     31.5000 -64.0
+    130.2500     32.5000 -64.0
+    130.7500     31.5000 -64.0
+} -64.0
+{ -64.0
+     84.2500     57.5000 -64.0
+     83.5000     58.2500 -64.0
+     82.2500     62.5000 -64.0
+     87.2500     65.5000 -64.0
+     90.5000     65.7500 -64.0
+     91.2500     67.5000 -64.0
+     91.7500     66.5000 -64.0
+     92.5000     64.7500 -64.0
+     92.5000     60.2500 -64.0
+     90.5000     61.2500 -64.0
+     86.7500     57.5000 -64.0
+} -64.0
+{ -64.0
+     82.2500     67.5000 -64.0
+     82.2500     71.5000 -64.0
+     84.2500     73.5000 -64.0
+     89.5000     73.7500 -64.0
+     91.5000     72.7500 -64.0
+     91.7500     70.5000 -64.0
+     86.7500     67.5000 -64.0
+} -64.0
+{ -64.0
+    133.2500     70.5000 -64.0
+    129.5000     72.2500 -64.0
+    129.2500     74.5000 -64.0
+    130.2500     76.5000 -64.0
+    137.5000     76.7500 -64.0
+    140.5000     73.7500 -64.0
+    140.7500     70.5000 -64.0
+} -64.0
+{ -64.0
+     63.2500     80.5000 -64.0
+     62.2500     84.5000 -64.0
+     59.2500     90.5000 -64.0
+     58.2500     95.5000 -64.0
+     52.5000    106.2500 -64.0
+     52.2500    109.5000 -64.0
+     55.5000    111.7500 -64.0
+     57.5000    110.7500 -64.0
+     57.7500    106.5000 -64.0
+     59.7500    101.5000 -64.0
+     66.5000     91.7500 -64.0
+     66.7500     86.5000 -64.0
+     64.7500     80.5000 -64.0
+} -64.0
+{ -64.0
+    151.2500     85.5000 -64.0
+    150.2500     87.5000 -64.0
+    147.5000     90.2500 -64.0
+    147.2500     95.5000 -64.0
+    148.2500     98.5000 -64.0
+    153.2500    103.5000 -64.0
+    153.2500    105.5000 -64.0
+    156.2500    107.5000 -64.0
+    155.5000    111.2500 -64.0
+    153.5000    108.2500 -64.0
+    153.2500    113.5000 -64.0
+    155.2500    114.5000 -64.0
+    157.5000    113.7500 -64.0
+    158.5000    111.7500 -64.0
+    158.7500    108.5000 -64.0
+    157.7500    106.5000 -64.0
+    157.7500    103.5000 -64.0
+    153.7500     93.5000 -64.0
+    153.7500     89.5000 -64.0
+    152.7500     86.5000 -64.0
+} -64.0
+{ -64.0
+    143.2500    117.5000 -64.0
+    143.5000    119.7500 -64.0
+    145.5000    118.7500 -64.0
+    144.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+     64.2500    118.5000 -64.0
+     64.5000    122.7500 -64.0
+     67.7500    121.5000 -64.0
+     66.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+    119.2500    118.5000 -64.0
+    116.5000    122.2500 -64.0
+    116.2500    124.5000 -64.0
+    117.2500    127.5000 -64.0
+    122.2500    133.5000 -64.0
+    122.2500    143.5000 -64.0
+    125.2500    147.5000 -64.0
+    128.5000    147.7500 -64.0
+    130.5000    146.7500 -64.0
+    138.5000    146.7500 -64.0
+    142.2500    149.5000 -64.0
+    145.2500    153.5000 -64.0
+    145.2500    155.5000 -64.0
+    147.2500    159.5000 -64.0
+    147.2500    168.5000 -64.0
+    146.2500    171.5000 -64.0
+    140.5000    177.2500 -64.0
+    129.5000    185.2500 -64.0
+    127.5000    185.2500 -64.0
+    123.5000    187.2500 -64.0
+    121.5000    187.2500 -64.0
+    119.5000    188.2500 -64.0
+    112.5000    186.2500 -64.0
+    107.7500    179.5000 -64.0
+    107.7500    177.5000 -64.0
+    106.7500    175.5000 -64.0
+    106.5000    168.2500 -64.0
+    104.5000    167.2500 -64.0
+    102.5000    170.2500 -64.0
+    102.2500    176.5000 -64.0
+    100.2500    182.5000 -64.0
+     95.5000    187.2500 -64.0
+     91.5000    187.2500 -64.0
+     79.5000    184.2500 -64.0
+     68.5000    178.2500 -64.0
+     61.7500    171.5000 -64.0
+     58.7500    165.5000 -64.0
+     58.7500    153.5000 -64.0
+     59.7500    150.5000 -64.0
+     62.5000    146.7500 -64.0
+     62.7500    140.5000 -64.0
+     68.5000    137.7500 -64.0
+     70.2500    138.5000 -64.0
+     71.2500    140.5000 -64.0
+     70.2500    142.5000 -64.0
+     81.5000    143.7500 -64.0
+     83.5000    142.7500 -64.0
+     85.5000    142.7500 -64.0
+     89.5000    138.7500 -64.0
+     90.7500    133.5000 -64.0
+     99.5000    124.7500 -64.0
+     99.7500    121.5000 -64.0
+     97.2500    119.5000 -64.0
+     98.2500    121.5000 -64.0
+     98.2500    124.5000 -64.0
+     87.5000    132.2500 -64.0
+     87.2500    134.5000 -64.0
+     85.5000    135.2500 -64.0
+     82.5000    134.2500 -64.0
+     82.2500    135.5000 -64.0
+     83.2500    138.5000 -64.0
+     78.5000    140.2500 -64.0
+     72.7500    136.5000 -64.0
+     67.5000    136.2500 -64.0
+     65.7500    133.5000 -64.0
+     66.5000    132.7500 -64.0
+     66.7500    130.5000 -64.0
+     63.5000    133.2500 -64.0
+     59.5000    132.2500 -64.0
+     57.7500    130.5000 -64.0
+     57.7500    124.5000 -64.0
+     56.5000    124.2500 -64.0
+     55.2500    125.5000 -64.0
+     50.5000    127.2500 -64.0
+     50.5000    128.7500 -64.0
+     53.5000    127.7500 -64.0
+     55.2500    129.5000 -64.0
+     55.2500    132.5000 -64.0
+     54.5000    134.2500 -64.0
+     55.5000    135.7500 -64.0
+     57.5000    134.7500 -64.0
+     59.5000    134.7500 -64.0
+     62.2500    138.5000 -64.0
+     60.5000    140.2500 -64.0
+     60.2500    143.5000 -64.0
+     58.5000    145.2500 -64.0
+     56.7500    144.5000 -64.0
+     56.2500    145.5000 -64.0
+     54.5000    146.2500 -64.0
+     53.7500    144.5000 -64.0
+     55.5000    143.7500 -64.0
+     55.7500    142.5000 -64.0
+     53.5000    142.2500 -64.0
+     51.5000    143.2500 -64.0
+     47.5000    142.2500 -64.0
+     45.7500    140.5000 -64.0
+     46.5000    136.7500 -64.0
+     48.5000    135.7500 -64.0
+     47.7500    133.5000 -64.0
+     48.5000    131.7500 -64.0
+     47.7500    129.5000 -64.0
+     46.5000    129.2500 -64.0
+     43.5000    134.2500 -64.0
+     41.5000    141.2500 -64.0
+     41.2500    148.5000 -64.0
+     45.2500    156.5000 -64.0
+     45.2500    158.5000 -64.0
+     47.2500    160.5000 -64.0
+     49.5000    158.7500 -64.0
+     50.2500    159.5000 -64.0
+     50.2500    161.5000 -64.0
+     48.2500    163.5000 -64.0
+     52.2500    173.5000 -64.0
+     63.5000    185.7500 -64.0
+     67.5000    187.7500 -64.0
+     81.2500    197.5000 -64.0
+     86.5000    197.7500 -64.0
+     89.5000    198.7500 -64.0
+     97.2500    203.5000 -64.0
+     97.2500    206.5000 -64.0
+    100.2500    209.5000 -64.0
+    106.5000    209.7500 -64.0
+    108.7500    206.5000 -64.0
+    107.7500    204.5000 -64.0
+    107.7500    202.5000 -64.0
+    111.5000    198.7500 -64.0
+    113.5000    198.7500 -64.0
+    117.5000    196.7500 -64.0
+    124.5000    195.7500 -64.0
+    129.5000    193.7500 -64.0
+    134.5000    189.7500 -64.0
+    146.5000    183.7500 -64.0
+    151.7500    178.5000 -64.0
+    156.5000    169.7500 -64.0
+    156.7500    163.5000 -64.0
+    159.5000    160.7500 -64.0
+    162.7500    160.5000 -64.0
+    167.5000    150.7500 -64.0
+    167.7500    140.5000 -64.0
+    165.7500    136.5000 -64.0
+    165.7500    134.5000 -64.0
+    161.7500    130.5000 -64.0
+    158.5000    134.2500 -64.0
+    156.5000    134.2500 -64.0
+    155.5000    137.2500 -64.0
+    153.5000    137.2500 -64.0
+    153.2500    139.5000 -64.0
+    154.2500    141.5000 -64.0
+    151.5000    144.2500 -64.0
+    142.7500    142.5000 -64.0
+    139.5000    144.2500 -64.0
+    134.5000    144.2500 -64.0
+    130.5000    146.2500 -64.0
+    128.5000    146.2500 -64.0
+    126.7500    144.5000 -64.0
+    127.5000    140.7500 -64.0
+    129.5000    140.7500 -64.0
+    129.7500    136.5000 -64.0
+    128.5000    137.2500 -64.0
+    124.7500    136.5000 -64.0
+    123.7500    131.5000 -64.0
+    119.5000    128.2500 -64.0
+    117.7500    125.5000 -64.0
+    118.7500    121.5000 -64.0
+    120.5000    119.7500 -64.0
+    129.5000    124.7500 -64.0
+    129.7500    123.5000 -64.0
+    122.5000    119.2500 -64.0
+} -64.0
+{ -64.0
+     85.2500    123.5000 -64.0
+     82.5000    126.2500 -64.0
+     76.5000    129.2500 -64.0
+     76.2500    130.5000 -64.0
+     81.5000    129.7500 -64.0
+     86.7500    123.5000 -64.0
+} -64.0
+{ -64.0
+    130.2500    125.5000 -64.0
+    130.2500    127.5000 -64.0
+    130.7500    126.5000 -64.0
+} -64.0
+{ -64.0
+    131.2500    129.5000 -64.0
+    132.2500    131.5000 -64.0
+    132.2500    137.5000 -64.0
+    133.5000    137.7500 -64.0
+    134.5000    134.7500 -64.0
+    132.7500    130.5000 -64.0
+} -64.0
+{ -64.0
+    132.2500    141.5000 -64.0
+    133.2500    142.5000 -64.0
+    133.7500    141.5000 -64.0
+} -64.0
+{ -64.0
+    110.7500     33.5000 -64.0
+    111.5000     32.7500 -64.0
+    113.2500     34.5000 -64.0
+    111.5000     35.2500 -64.0
+} -64.0
+{ -64.0
+    128.5000     43.7500 -64.0
+    130.2500     44.5000 -64.0
+    128.5000     46.2500 -64.0
+    126.7500     45.5000 -64.0
+} -64.0
+{ -64.0
+     92.7500     45.5000 -64.0
+     93.5000     44.7500 -64.0
+     95.2500     45.5000 -64.0
+     94.5000     47.2500 -64.0
+} -64.0
+{ -64.0
+     62.7500     85.5000 -64.0
+     64.5000     84.7500 -64.0
+     66.2500     86.5000 -64.0
+     63.2500     93.5000 -64.0
+     58.5000    101.2500 -64.0
+     57.7500     99.5000 -64.0
+     61.5000     91.7500 -64.0
+} -64.0
+{ -64.0
+    149.7500     90.5000 -64.0
+    150.5000     89.7500 -64.0
+    152.2500     91.5000 -64.0
+    152.2500     96.5000 -64.0
+    155.2500    102.5000 -64.0
+    154.5000    104.2500 -64.0
+    153.7500    103.5000 -64.0
+    153.7500    101.5000 -64.0
+    150.5000     98.2500 -64.0
+    148.7500     93.5000 -64.0
+} -64.0
+{ -64.0
+     56.7500    102.5000 -64.0
+     57.5000    101.7500 -64.0
+     58.2500    102.5000 -64.0
+     57.5000    103.2500 -64.0
+     56.2500    107.5000 -64.0
+     55.5000    109.2500 -64.0
+     54.7500    108.5000 -64.0
+     54.7500    106.5000 -64.0
+} -64.0
+{ -64.0
+    158.7500    135.5000 -64.0
+    159.5000    134.7500 -64.0
+    162.5000    134.7500 -64.0
+    164.2500    136.5000 -64.0
+    164.2500    138.5000 -64.0
+    160.5000    143.2500 -64.0
+    157.7500    139.5000 -64.0
+    157.7500    137.5000 -64.0
+} -64.0
+{ -64.0
+    163.5000    142.7500 -64.0
+    165.5000    142.7500 -64.0
+    167.2500    144.5000 -64.0
+    165.2500    148.5000 -64.0
+    166.2500    150.5000 -64.0
+    164.5000    154.2500 -64.0
+    160.5000    154.2500 -64.0
+    158.7500    152.5000 -64.0
+    159.7500    150.5000 -64.0
+    156.7500    148.5000 -64.0
+    157.5000    147.7500 -64.0
+    156.7500    146.5000 -64.0
+    157.5000    144.7500 -64.0
+    161.5000    144.7500 -64.0
+} -64.0
+{ -64.0
+    142.7500    145.5000 -64.0
+    143.5000    144.7500 -64.0
+    147.2500    146.5000 -64.0
+    146.2500    148.5000 -64.0
+    144.5000    149.2500 -64.0
+    142.7500    147.5000 -64.0
+} -64.0
+{ -64.0
+     53.5000    147.7500 -64.0
+     55.5000    147.7500 -64.0
+     57.2500    148.5000 -64.0
+     57.2500    151.5000 -64.0
+     55.5000    153.2500 -64.0
+     53.5000    153.2500 -64.0
+     51.7500    152.5000 -64.0
+     50.7500    150.5000 -64.0
+} -64.0
+v 402 z -146.000000 -64.0
+{ -64.0
+    108.2500     27.5000 -64.0
+    104.5000     30.2500 -64.0
+    101.2500     29.5000 -64.0
+     98.5000     33.2500 -64.0
+     96.5000     32.2500 -64.0
+     94.2500     35.5000 -64.0
+     95.2500     37.5000 -64.0
+     92.5000     39.2500 -64.0
+     92.2500     41.5000 -64.0
+     93.2500     43.5000 -64.0
+     90.5000     45.2500 -64.0
+     90.2500     48.5000 -64.0
+     92.2500     50.5000 -64.0
+     94.7500     50.5000 -64.0
+     95.7500     48.5000 -64.0
+     94.7500     46.5000 -64.0
+     98.5000     43.7500 -64.0
+     98.7500     41.5000 -64.0
+    101.7500     37.5000 -64.0
+    104.5000     35.7500 -64.0
+    109.5000     35.7500 -64.0
+    111.5000     33.7500 -64.0
+    115.5000     36.7500 -64.0
+    117.5000     35.7500 -64.0
+    119.5000     35.7500 -64.0
+    123.2500     39.5000 -64.0
+    125.2500     43.5000 -64.0
+    129.2500     44.5000 -64.0
+    125.5000     48.2500 -64.0
+    125.5000     50.7500 -64.0
+    127.5000     51.7500 -64.0
+    128.2500     53.5000 -64.0
+    126.2500     57.5000 -64.0
+    127.2500     60.5000 -64.0
+    129.5000     60.7500 -64.0
+    136.5000     56.7500 -64.0
+    136.7500     54.5000 -64.0
+    134.7500     52.5000 -64.0
+    134.7500     50.5000 -64.0
+    131.7500     48.5000 -64.0
+    132.7500     46.5000 -64.0
+    130.7500     44.5000 -64.0
+    131.7500     41.5000 -64.0
+    130.7500     39.5000 -64.0
+    126.7500     38.5000 -64.0
+    128.7500     35.5000 -64.0
+    124.7500     34.5000 -64.0
+    126.5000     32.7500 -64.0
+    128.7500     32.5000 -64.0
+    124.5000     32.2500 -64.0
+    123.5000     30.2500 -64.0
+    121.5000     29.2500 -64.0
+    118.5000     30.2500 -64.0
+    116.7500     27.5000 -64.0
+    113.5000     27.2500 -64.0
+    111.5000     29.2500 -64.0
+} -64.0
+{ -64.0
+     85.2500     56.5000 -64.0
+     82.2500     61.5000 -64.0
+     83.2500     63.5000 -64.0
+     86.5000     63.7500 -64.0
+     91.2500     67.5000 -64.0
+     89.5000     68.2500 -64.0
+     82.5000     66.2500 -64.0
+     80.5000     69.2500 -64.0
+     81.5000     70.7500 -64.0
+     81.7500     68.5000 -64.0
+     83.5000     67.7500 -64.0
+     85.2500     68.5000 -64.0
+     84.5000     69.2500 -64.0
+     85.2500     72.5000 -64.0
+     83.5000     73.2500 -64.0
+     81.7500     72.5000 -64.0
+     81.2500     73.5000 -64.0
+     91.5000     73.7500 -64.0
+     92.5000     69.7500 -64.0
+     92.7500     63.5000 -64.0
+     91.7500     60.5000 -64.0
+     86.7500     56.5000 -64.0
+} -64.0
+{ -64.0
+    136.2500     59.5000 -64.0
+    129.5000     64.2500 -64.0
+    129.2500     66.5000 -64.0
+    130.2500     68.5000 -64.0
+    132.5000     68.7500 -64.0
+    133.2500     70.5000 -64.0
+    134.5000     69.7500 -64.0
+    133.7500     68.5000 -64.0
+    136.7500     63.5000 -64.0
+    134.7500     61.5000 -64.0
+    136.5000     60.7500 -64.0
+    138.2500     62.5000 -64.0
+    138.2500     66.5000 -64.0
+    139.5000     65.7500 -64.0
+    139.7500     63.5000 -64.0
+    138.7500     60.5000 -64.0
+} -64.0
+{ -64.0
+    138.2500     69.5000 -64.0
+    137.2500     72.5000 -64.0
+    140.5000     70.7500 -64.0
+    139.7500     69.5000 -64.0
+} -64.0
+{ -64.0
+    131.2500     71.5000 -64.0
+    130.5000     72.2500 -64.0
+    130.2500     74.5000 -64.0
+    131.5000     75.7500 -64.0
+    136.5000     76.7500 -64.0
+    135.5000     76.2500 -64.0
+    131.7500     73.5000 -64.0
+    132.7500     71.5000 -64.0
+} -64.0
+{ -64.0
+    142.2500     73.5000 -64.0
+    142.2500     74.5000 -64.0
+    141.5000     76.2500 -64.0
+    142.5000     76.7500 -64.0
+    142.7500     74.5000 -64.0
+} -64.0
+{ -64.0
+     63.2500     81.5000 -64.0
+     58.5000     92.2500 -64.0
+     57.2500     98.5000 -64.0
+     53.5000    104.2500 -64.0
+     53.2500    108.5000 -64.0
+     54.2500    110.5000 -64.0
+     57.5000    110.7500 -64.0
+     58.5000    108.7500 -64.0
+     58.7500    102.5000 -64.0
+     67.7500     92.5000 -64.0
+     68.7500     87.5000 -64.0
+     65.7500     84.5000 -64.0
+     65.7500     81.5000 -64.0
+} -64.0
+{ -64.0
+    151.2500     85.5000 -64.0
+    150.2500     87.5000 -64.0
+    146.5000     91.2500 -64.0
+    146.2500     95.5000 -64.0
+    147.2500     97.5000 -64.0
+    147.2500     99.5000 -64.0
+    152.5000    101.7500 -64.0
+    152.7500     99.5000 -64.0
+    150.5000     99.2500 -64.0
+    147.7500     95.5000 -64.0
+    147.7500     92.5000 -64.0
+    150.5000     89.7500 -64.0
+    152.2500     93.5000 -64.0
+    152.2500     95.5000 -64.0
+    155.2500    101.5000 -64.0
+    155.2500    105.5000 -64.0
+    156.2500    108.5000 -64.0
+    155.5000    110.2500 -64.0
+    153.7500    109.5000 -64.0
+    153.7500    106.5000 -64.0
+    152.5000    107.2500 -64.0
+    152.2500    109.5000 -64.0
+    153.5000    112.7500 -64.0
+    155.5000    113.7500 -64.0
+    157.5000    112.7500 -64.0
+    157.7500    104.5000 -64.0
+    153.7500     94.5000 -64.0
+    153.7500     90.5000 -64.0
+    152.7500     88.5000 -64.0
+    152.7500     86.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500    115.5000 -64.0
+    117.2500    116.5000 -64.0
+    117.2500    120.5000 -64.0
+    116.2500    123.5000 -64.0
+    122.2500    134.5000 -64.0
+    121.2500    149.5000 -64.0
+    124.5000    150.7500 -64.0
+    126.5000    149.7500 -64.0
+    130.5000    149.7500 -64.0
+    132.5000    148.7500 -64.0
+    137.5000    148.7500 -64.0
+    141.2500    151.5000 -64.0
+    144.2500    155.5000 -64.0
+    144.2500    157.5000 -64.0
+    145.2500    159.5000 -64.0
+    145.2500    164.5000 -64.0
+    143.2500    170.5000 -64.0
+    132.5000    180.2500 -64.0
+    126.5000    183.2500 -64.0
+    124.5000    183.2500 -64.0
+    122.5000    184.2500 -64.0
+    117.5000    184.2500 -64.0
+    114.5000    183.2500 -64.0
+    111.7500    180.5000 -64.0
+    108.7500    175.5000 -64.0
+    108.7500    168.5000 -64.0
+    112.7500    159.5000 -64.0
+    110.5000    159.2500 -64.0
+    106.5000    162.2500 -64.0
+    100.2500    162.5000 -64.0
+    101.2500    164.5000 -64.0
+    101.2500    173.5000 -64.0
+     98.5000    180.2500 -64.0
+     94.5000    183.2500 -64.0
+     89.5000    183.2500 -64.0
+     87.5000    182.2500 -64.0
+     78.5000    181.2500 -64.0
+     64.7500    172.5000 -64.0
+     60.7500    165.5000 -64.0
+     60.7500    161.5000 -64.0
+     59.7500    159.5000 -64.0
+     60.5000    158.7500 -64.0
+     60.7500    153.5000 -64.0
+     63.7500    147.5000 -64.0
+     67.5000    144.7500 -64.0
+     74.5000    144.7500 -64.0
+     79.2500    146.5000 -64.0
+     84.5000    146.7500 -64.0
+     87.7500    144.5000 -64.0
+     90.5000    138.7500 -64.0
+     90.7500    134.5000 -64.0
+     98.5000    124.7500 -64.0
+     98.7500    122.5000 -64.0
+     97.5000    121.2500 -64.0
+     97.2500    125.5000 -64.0
+     94.5000    128.2500 -64.0
+     90.5000    130.2500 -64.0
+     88.2500    134.5000 -64.0
+     84.2500    137.5000 -64.0
+     87.2500    141.5000 -64.0
+     86.2500    143.5000 -64.0
+     83.5000    145.2500 -64.0
+     81.7500    144.5000 -64.0
+     82.5000    142.7500 -64.0
+     81.5000    141.2500 -64.0
+     77.5000    143.2500 -64.0
+     75.5000    143.2500 -64.0
+     69.7500    138.5000 -64.0
+     65.5000    138.2500 -64.0
+     64.7500    136.5000 -64.0
+     65.5000    134.7500 -64.0
+     67.7500    133.5000 -64.0
+     64.5000    133.2500 -64.0
+     62.5000    134.2500 -64.0
+     59.5000    134.2500 -64.0
+     57.7500    133.5000 -64.0
+     54.7500    127.5000 -64.0
+     49.5000    127.2500 -64.0
+     46.2500    130.5000 -64.0
+     43.5000    136.2500 -64.0
+     43.2500    148.5000 -64.0
+     47.5000    157.7500 -64.0
+     49.5000    158.7500 -64.0
+     52.2500    162.5000 -64.0
+     52.2500    167.5000 -64.0
+     59.5000    178.7500 -64.0
+     67.5000    184.7500 -64.0
+     80.2500    191.5000 -64.0
+     83.5000    191.7500 -64.0
+     85.2500    193.5000 -64.0
+     88.5000    193.7500 -64.0
+     90.5000    192.7500 -64.0
+     91.2500    193.5000 -64.0
+    106.5000    193.7500 -64.0
+    108.5000    194.7500 -64.0
+    110.5000    193.7500 -64.0
+    114.5000    193.7500 -64.0
+    121.5000    191.7500 -64.0
+    127.5000    190.7500 -64.0
+    140.5000    183.7500 -64.0
+    146.5000    179.7500 -64.0
+    152.5000    168.7500 -64.0
+    153.7500    163.5000 -64.0
+    152.7500    160.5000 -64.0
+    155.5000    156.7500 -64.0
+    155.7500    154.5000 -64.0
+    154.7500    151.5000 -64.0
+    153.5000    151.2500 -64.0
+    151.7500    149.5000 -64.0
+    151.7500    147.5000 -64.0
+    149.7500    145.5000 -64.0
+    145.5000    144.2500 -64.0
+    143.5000    145.2500 -64.0
+    140.5000    144.2500 -64.0
+    138.5000    145.2500 -64.0
+    136.5000    145.2500 -64.0
+    134.5000    143.2500 -64.0
+    134.2500    145.5000 -64.0
+    131.5000    147.2500 -64.0
+    129.5000    147.2500 -64.0
+    127.7500    145.5000 -64.0
+    128.7500    143.5000 -64.0
+    127.2500    142.5000 -64.0
+    125.5000    146.2500 -64.0
+    123.7500    144.5000 -64.0
+    123.7500    140.5000 -64.0
+    125.5000    138.7500 -64.0
+    127.2500    140.5000 -64.0
+    128.5000    139.7500 -64.0
+    129.2500    140.5000 -64.0
+    130.5000    138.7500 -64.0
+    132.5000    138.7500 -64.0
+    132.7500    129.5000 -64.0
+    130.5000    126.2500 -64.0
+    128.5000    125.2500 -64.0
+    130.2500    127.5000 -64.0
+    130.2500    131.5000 -64.0
+    129.5000    133.2500 -64.0
+    125.5000    135.2500 -64.0
+    123.7500    131.5000 -64.0
+    121.7500    130.5000 -64.0
+    118.7500    125.5000 -64.0
+    118.7500    122.5000 -64.0
+    119.5000    120.7500 -64.0
+    125.5000    123.7500 -64.0
+    122.7500    120.5000 -64.0
+    118.7500    119.5000 -64.0
+    119.5000    117.7500 -64.0
+    128.2500    122.5000 -64.0
+    128.7500    121.5000 -64.0
+    121.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+    143.2500    115.5000 -64.0
+    142.5000    116.2500 -64.0
+    142.5000    117.7500 -64.0
+    144.5000    118.7500 -64.0
+    144.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+     66.2500    117.5000 -64.0
+     65.2500    119.5000 -64.0
+     67.5000    119.7500 -64.0
+     67.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500    117.5000 -64.0
+     89.2500    118.5000 -64.0
+     91.5000    118.7500 -64.0
+     92.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+     82.2500    126.5000 -64.0
+     79.5000    129.2500 -64.0
+     77.5000    130.2500 -64.0
+     77.5000    131.7500 -64.0
+     80.5000    130.7500 -64.0
+     83.7500    126.5000 -64.0
+} -64.0
+{ -64.0
+    161.2500    131.5000 -64.0
+    161.2500    132.5000 -64.0
+    159.5000    134.2500 -64.0
+    155.5000    134.2500 -64.0
+    153.5000    133.2500 -64.0
+    153.5000    136.7500 -64.0
+    157.5000    145.7500 -64.0
+    159.5000    146.7500 -64.0
+    162.5000    145.7500 -64.0
+    164.2500    147.5000 -64.0
+    163.5000    149.2500 -64.0
+    162.2500    155.5000 -64.0
+    164.7500    153.5000 -64.0
+    165.7500    151.5000 -64.0
+    166.5000    149.7500 -64.0
+    166.7500    141.5000 -64.0
+    165.7500    139.5000 -64.0
+    165.7500    137.5000 -64.0
+    162.7500    131.5000 -64.0
+} -64.0
+{ -64.0
+    119.7500     32.5000 -64.0
+    120.5000     31.7500 -64.0
+    122.2500     32.5000 -64.0
+    121.5000     33.2500 -64.0
+} -64.0
+{ -64.0
+    133.7500     55.5000 -64.0
+    134.5000     54.7500 -64.0
+    135.2500     55.5000 -64.0
+    134.5000     56.2500 -64.0
+} -64.0
+{ -64.0
+     85.7500     69.5000 -64.0
+     86.5000     68.7500 -64.0
+     87.2500     69.5000 -64.0
+     86.5000     70.2500 -64.0
+} -64.0
+{ -64.0
+     63.7500     85.5000 -64.0
+     64.5000     84.7500 -64.0
+     66.2500     86.5000 -64.0
+     66.2500     88.5000 -64.0
+     65.2500     91.5000 -64.0
+     63.5000     95.2500 -64.0
+     58.5000    101.2500 -64.0
+     57.7500    100.5000 -64.0
+     58.7500     97.5000 -64.0
+     61.5000     91.7500 -64.0
+     61.7500     89.5000 -64.0
+} -64.0
+{ -64.0
+     55.7500    104.5000 -64.0
+     56.5000    103.7500 -64.0
+     58.2500    104.5000 -64.0
+     57.2500    106.5000 -64.0
+     56.5000    108.2500 -64.0
+     54.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+     51.7500    129.5000 -64.0
+     53.5000    128.7500 -64.0
+     55.2500    131.5000 -64.0
+     55.2500    133.5000 -64.0
+     53.5000    134.7500 -64.0
+     55.5000    135.7500 -64.0
+     57.2500    138.5000 -64.0
+     57.2500    140.5000 -64.0
+     58.5000    140.7500 -64.0
+     59.2500    142.5000 -64.0
+     58.5000    144.2500 -64.0
+     54.5000    142.2500 -64.0
+     52.5000    143.2500 -64.0
+     48.5000    143.2500 -64.0
+     46.7500    142.5000 -64.0
+     46.7500    140.5000 -64.0
+     45.7500    138.5000 -64.0
+     46.7500    136.5000 -64.0
+     48.5000    135.7500 -64.0
+} -64.0
+{ -64.0
+    160.5000    134.7500 -64.0
+    163.2500    136.5000 -64.0
+    162.2500    141.5000 -64.0
+    161.5000    143.2500 -64.0
+    159.7500    142.5000 -64.0
+    159.7500    139.5000 -64.0
+    157.7500    137.5000 -64.0
+} -64.0
+{ -64.0
+     86.7500    137.5000 -64.0
+     87.5000    136.7500 -64.0
+     88.2500    137.5000 -64.0
+     87.5000    139.2500 -64.0
+} -64.0
+v 547 z -148.000000 -64.0
+{ -64.0
+    107.2500     26.5000 -64.0
+    105.5000     27.2500 -64.0
+    104.5000     30.2500 -64.0
+    102.7500     28.5000 -64.0
+    100.5000     28.2500 -64.0
+     98.5000     31.2500 -64.0
+     97.7500     30.5000 -64.0
+     95.5000     31.2500 -64.0
+     94.2500     34.5000 -64.0
+     95.2500     36.5000 -64.0
+     94.5000     37.2500 -64.0
+     91.2500     37.5000 -64.0
+     93.5000     37.7500 -64.0
+     96.2500     40.5000 -64.0
+     93.5000     42.2500 -64.0
+     93.2500     43.5000 -64.0
+     91.5000     45.2500 -64.0
+     91.2500     47.5000 -64.0
+     92.2500     49.5000 -64.0
+     95.5000     49.7500 -64.0
+     95.7500     47.5000 -64.0
+     94.7500     44.5000 -64.0
+     98.5000     42.7500 -64.0
+     98.7500     38.5000 -64.0
+    100.7500     37.5000 -64.0
+    101.7500     35.5000 -64.0
+    105.5000     32.7500 -64.0
+    106.2500     33.5000 -64.0
+    109.7500     33.5000 -64.0
+    110.7500     31.5000 -64.0
+    112.5000     30.7500 -64.0
+    113.5000     32.7500 -64.0
+    115.5000     33.7500 -64.0
+    117.5000     32.7500 -64.0
+    121.5000     33.7500 -64.0
+    123.2500     37.5000 -64.0
+    123.2500     41.5000 -64.0
+    129.2500     43.5000 -64.0
+    125.5000     47.2500 -64.0
+    125.2500     50.5000 -64.0
+    128.5000     50.7500 -64.0
+    131.7500     47.5000 -64.0
+    132.7500     45.5000 -64.0
+    129.7500     43.5000 -64.0
+    131.5000     42.7500 -64.0
+    131.7500     39.5000 -64.0
+    126.5000     38.2500 -64.0
+    125.7500     36.5000 -64.0
+    129.5000     34.7500 -64.0
+    129.7500     32.5000 -64.0
+    128.7500     30.5000 -64.0
+    126.5000     30.2500 -64.0
+    122.5000     32.2500 -64.0
+    121.7500     30.5000 -64.0
+    123.5000     29.7500 -64.0
+    123.5000     28.2500 -64.0
+    121.5000     27.2500 -64.0
+    119.5000     28.2500 -64.0
+    117.7500     26.5000 -64.0
+    114.5000     26.2500 -64.0
+    112.5000     27.2500 -64.0
+    110.7500     26.5000 -64.0
+} -64.0
+{ -64.0
+    135.2500     43.5000 -64.0
+    134.2500     47.5000 -64.0
+    129.5000     52.2500 -64.0
+    127.5000     53.2500 -64.0
+    127.2500     54.5000 -64.0
+    129.2500     55.5000 -64.0
+    129.2500     59.5000 -64.0
+    132.5000     56.7500 -64.0
+    133.2500     57.5000 -64.0
+    133.2500     59.5000 -64.0
+    133.7500     58.5000 -64.0
+    135.5000     57.7500 -64.0
+    138.7500     60.5000 -64.0
+    136.7500     54.5000 -64.0
+    137.7500     52.5000 -64.0
+    136.7500     50.5000 -64.0
+    136.7500     46.5000 -64.0
+} -64.0
+{ -64.0
+     83.2500     55.5000 -64.0
+     81.5000     59.2500 -64.0
+     82.2500     60.5000 -64.0
+     82.2500     64.5000 -64.0
+     83.5000     63.7500 -64.0
+     85.2500     64.5000 -64.0
+     86.5000     63.7500 -64.0
+     89.2500     65.5000 -64.0
+     87.5000     66.2500 -64.0
+     90.2500     70.5000 -64.0
+     91.5000     67.7500 -64.0
+     95.5000     67.7500 -64.0
+     93.7500     66.5000 -64.0
+     95.5000     65.7500 -64.0
+     94.7500     64.5000 -64.0
+     97.5000     62.7500 -64.0
+     95.7500     61.5000 -64.0
+     94.5000     62.2500 -64.0
+     92.7500     61.5000 -64.0
+     91.7500     59.5000 -64.0
+     86.7500     55.5000 -64.0
+} -64.0
+{ -64.0
+    125.2500     58.5000 -64.0
+    125.2500     59.5000 -64.0
+    127.5000     59.7500 -64.0
+} -64.0
+{ -64.0
+    102.2500     59.5000 -64.0
+    103.2500     60.5000 -64.0
+    108.5000     60.7500 -64.0
+    111.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+    140.2500     59.5000 -64.0
+    139.2500     61.5000 -64.0
+    140.2500     63.5000 -64.0
+    140.2500     65.5000 -64.0
+    141.5000     65.7500 -64.0
+    141.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+    134.2500     60.5000 -64.0
+    133.5000     61.2500 -64.0
+    135.5000     65.7500 -64.0
+    135.7500     63.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500     63.5000 -64.0
+    111.5000     65.2500 -64.0
+    103.5000     66.2500 -64.0
+    105.2500     67.5000 -64.0
+    118.5000     67.7500 -64.0
+    127.5000     68.7500 -64.0
+    130.5000     69.7500 -64.0
+    131.2500     71.5000 -64.0
+    131.7500     70.5000 -64.0
+    130.7500     68.5000 -64.0
+    133.5000     66.7500 -64.0
+    131.7500     65.5000 -64.0
+    131.7500     63.5000 -64.0
+    129.5000     63.2500 -64.0
+    129.2500     64.5000 -64.0
+    130.2500     66.5000 -64.0
+    128.5000     67.2500 -64.0
+    119.7500     63.5000 -64.0
+} -64.0
+{ -64.0
+     83.2500     71.5000 -64.0
+     83.2500     72.5000 -64.0
+     84.7500     71.5000 -64.0
+} -64.0
+{ -64.0
+     87.2500     71.5000 -64.0
+     86.2500     72.5000 -64.0
+     89.2500     74.5000 -64.0
+     97.5000     74.2500 -64.0
+     88.7500     72.5000 -64.0
+     89.7500     71.5000 -64.0
+} -64.0
+{ -64.0
+     77.2500     72.5000 -64.0
+     76.5000     73.2500 -64.0
+     73.5000     73.2500 -64.0
+     71.5000     74.2500 -64.0
+     69.5000     74.2500 -64.0
+     67.5000     75.2500 -64.0
+     64.2500     75.5000 -64.0
+     71.5000     75.7500 -64.0
+     72.2500     77.5000 -64.0
+     71.2500     80.5000 -64.0
+     72.5000     79.7500 -64.0
+     82.5000     74.7500 -64.0
+     81.5000     74.2500 -64.0
+     79.5000     75.2500 -64.0
+     77.7500     73.5000 -64.0
+     78.7500     72.5000 -64.0
+} -64.0
+{ -64.0
+    130.2500     72.5000 -64.0
+    129.5000     73.2500 -64.0
+    133.2500     76.5000 -64.0
+    132.5000     77.2500 -64.0
+    130.5000     77.2500 -64.0
+    128.7500     76.5000 -64.0
+    122.5000     76.2500 -64.0
+    122.2500     80.5000 -64.0
+    123.5000     79.7500 -64.0
+    129.5000     77.7500 -64.0
+    131.5000     78.7500 -64.0
+    133.5000     77.7500 -64.0
+    136.5000     77.7500 -64.0
+} -64.0
+{ -64.0
+    144.2500     72.5000 -64.0
+    143.5000     73.2500 -64.0
+    145.2500     74.5000 -64.0
+    142.5000     77.2500 -64.0
+    145.2500     79.5000 -64.0
+    146.5000     78.7500 -64.0
+    147.2500     79.5000 -64.0
+    150.5000     79.7500 -64.0
+    152.2500     80.5000 -64.0
+    159.5000     80.7500 -64.0
+    148.5000     75.2500 -64.0
+    146.7500     72.5000 -64.0
+} -64.0
+{ -64.0
+     64.2500     81.5000 -64.0
+     53.2500    106.5000 -64.0
+     55.2500    110.5000 -64.0
+     57.5000    110.7500 -64.0
+     58.7500    109.5000 -64.0
+     59.7500    104.5000 -64.0
+     58.5000    103.2500 -64.0
+     58.2500    105.5000 -64.0
+     56.5000    107.2500 -64.0
+     55.7500    106.5000 -64.0
+     55.7500    104.5000 -64.0
+     58.5000    100.7500 -64.0
+     57.7500     99.5000 -64.0
+     64.5000     85.7500 -64.0
+     65.2500     87.5000 -64.0
+     67.2500     88.5000 -64.0
+     67.2500     91.5000 -64.0
+     64.5000     95.2500 -64.0
+     62.2500     96.5000 -64.0
+     61.2500     98.5000 -64.0
+     64.5000     96.7500 -64.0
+     66.5000     96.7500 -64.0
+     68.7500     92.5000 -64.0
+     69.7500     87.5000 -64.0
+     67.7500     85.5000 -64.0
+     65.7500     81.5000 -64.0
+} -64.0
+{ -64.0
+    139.2500     81.5000 -64.0
+    139.2500     82.5000 -64.0
+    138.5000     84.2500 -64.0
+    138.2500     86.5000 -64.0
+    139.2500     88.5000 -64.0
+    139.2500     91.5000 -64.0
+    140.5000     92.7500 -64.0
+    140.7500     88.5000 -64.0
+    139.7500     86.5000 -64.0
+    139.7500     82.5000 -64.0
+} -64.0
+{ -64.0
+    150.2500     85.5000 -64.0
+    150.2500     87.5000 -64.0
+    152.2500     91.5000 -64.0
+    153.2500     97.5000 -64.0
+    155.2500    101.5000 -64.0
+    155.2500    108.5000 -64.0
+    154.5000    110.2500 -64.0
+    153.7500    109.5000 -64.0
+    153.7500    105.5000 -64.0
+    152.5000    105.2500 -64.0
+    152.2500    107.5000 -64.0
+    153.2500    109.5000 -64.0
+    153.2500    112.5000 -64.0
+    155.5000    112.7500 -64.0
+    157.5000    111.7500 -64.0
+    157.7500    107.5000 -64.0
+    156.7500    105.5000 -64.0
+    155.7500     99.5000 -64.0
+    152.7500     93.5000 -64.0
+    152.7500     87.5000 -64.0
+    151.7500     85.5000 -64.0
+} -64.0
+{ -64.0
+    147.2500     97.5000 -64.0
+    148.2500     99.5000 -64.0
+    151.5000     99.7500 -64.0
+    151.7500     98.5000 -64.0
+} -64.0
+{ -64.0
+    105.2500    109.5000 -64.0
+    104.5000    110.2500 -64.0
+     99.5000    113.2500 -64.0
+     97.5000    113.2500 -64.0
+     95.5000    114.2500 -64.0
+     93.5000    114.2500 -64.0
+     88.5000    116.2500 -64.0
+     86.2500    119.5000 -64.0
+     84.2500    123.5000 -64.0
+     85.5000    123.7500 -64.0
+     87.5000    121.7500 -64.0
+     94.5000    117.7500 -64.0
+     96.5000    117.7500 -64.0
+    100.5000    115.7500 -64.0
+    104.5000    115.7500 -64.0
+    106.2500    116.5000 -64.0
+    105.5000    118.2500 -64.0
+    105.2500    121.5000 -64.0
+    107.2500    123.5000 -64.0
+    108.5000    122.7500 -64.0
+    110.5000    122.7500 -64.0
+    110.7500    118.5000 -64.0
+    109.7500    116.5000 -64.0
+    110.5000    115.7500 -64.0
+    113.5000    116.7500 -64.0
+    117.2500    118.5000 -64.0
+    117.2500    124.5000 -64.0
+    119.2500    128.5000 -64.0
+    123.2500    135.5000 -64.0
+    123.2500    140.5000 -64.0
+    121.5000    142.2500 -64.0
+    118.2500    151.5000 -64.0
+    115.5000    154.2500 -64.0
+    107.5000    159.2500 -64.0
+    101.5000    159.2500 -64.0
+     97.7500    156.5000 -64.0
+     95.5000    156.2500 -64.0
+     91.5000    154.2500 -64.0
+     91.2500    156.5000 -64.0
+     95.2500    161.5000 -64.0
+     99.2500    168.5000 -64.0
+     99.2500    172.5000 -64.0
+     96.5000    176.2500 -64.0
+     92.5000    178.2500 -64.0
+     90.5000    178.2500 -64.0
+     87.5000    177.2500 -64.0
+     85.5000    178.2500 -64.0
+     84.7500    177.5000 -64.0
+     83.5000    178.2500 -64.0
+     79.5000    178.2500 -64.0
+     73.5000    175.2500 -64.0
+     67.5000    170.2500 -64.0
+     62.7500    163.5000 -64.0
+     62.7500    161.5000 -64.0
+     61.7500    159.5000 -64.0
+     61.7500    157.5000 -64.0
+     63.7500    151.5000 -64.0
+     68.5000    146.7500 -64.0
+     70.5000    146.7500 -64.0
+     72.5000    145.7500 -64.0
+     84.2500    151.5000 -64.0
+     89.5000    151.7500 -64.0
+     89.7500    148.5000 -64.0
+     90.5000    146.7500 -64.0
+     90.7500    136.5000 -64.0
+     92.7500    131.5000 -64.0
+     97.5000    126.7500 -64.0
+     97.7500    122.5000 -64.0
+     96.5000    124.2500 -64.0
+     96.2500    126.5000 -64.0
+     89.5000    132.2500 -64.0
+     89.2500    135.5000 -64.0
+     88.5000    137.2500 -64.0
+     86.7500    135.5000 -64.0
+     84.5000    135.2500 -64.0
+     82.7500    132.5000 -64.0
+     82.7500    128.5000 -64.0
+     81.2500    131.5000 -64.0
+     80.5000    133.2500 -64.0
+     81.5000    134.7500 -64.0
+     83.5000    135.7500 -64.0
+     84.2500    137.5000 -64.0
+     88.2500    139.5000 -64.0
+     88.2500    141.5000 -64.0
+     86.5000    143.2500 -64.0
+     84.5000    143.2500 -64.0
+     84.2500    144.5000 -64.0
+     83.5000    146.2500 -64.0
+     81.5000    146.2500 -64.0
+     78.5000    143.2500 -64.0
+     76.5000    144.2500 -64.0
+     74.7500    143.5000 -64.0
+     72.5000    143.2500 -64.0
+     70.7500    142.5000 -64.0
+     69.7500    140.5000 -64.0
+     67.5000    138.2500 -64.0
+     67.2500    140.5000 -64.0
+     69.2500    142.5000 -64.0
+     68.5000    143.2500 -64.0
+     67.7500    142.5000 -64.0
+     65.5000    144.2500 -64.0
+     63.7500    142.5000 -64.0
+     63.7500    138.5000 -64.0
+     65.7500    137.5000 -64.0
+     66.7500    135.5000 -64.0
+     62.5000    135.2500 -64.0
+     60.5000    136.2500 -64.0
+     58.5000    136.2500 -64.0
+     56.5000    137.2500 -64.0
+     55.7500    136.5000 -64.0
+     55.7500    134.5000 -64.0
+     56.5000    132.7500 -64.0
+     55.7500    131.5000 -64.0
+     55.7500    129.5000 -64.0
+     53.7500    127.5000 -64.0
+     51.5000    127.2500 -64.0
+     48.5000    128.2500 -64.0
+     45.5000    132.2500 -64.0
+     45.2500    137.5000 -64.0
+     44.5000    139.2500 -64.0
+     44.2500    146.5000 -64.0
+     45.2500    148.5000 -64.0
+     45.5000    150.7500 -64.0
+     49.2500    153.5000 -64.0
+     51.2500    157.5000 -64.0
+     52.5000    157.7500 -64.0
+     55.2500    161.5000 -64.0
+     55.2500    164.5000 -64.0
+     57.5000    167.7500 -64.0
+     61.2500    176.5000 -64.0
+     62.5000    176.7500 -64.0
+     68.5000    181.7500 -64.0
+     76.5000    185.7500 -64.0
+     78.2500    186.5000 -64.0
+     81.5000    186.7500 -64.0
+     83.2500    187.5000 -64.0
+     91.5000    187.7500 -64.0
+     93.2500    188.5000 -64.0
+    102.5000    188.7500 -64.0
+    104.5000    189.7500 -64.0
+    106.5000    188.7500 -64.0
+    108.2500    189.5000 -64.0
+    112.5000    189.7500 -64.0
+    114.5000    188.7500 -64.0
+    118.5000    188.7500 -64.0
+    120.5000    187.7500 -64.0
+    124.5000    187.7500 -64.0
+    126.5000    186.7500 -64.0
+    128.5000    186.7500 -64.0
+    130.5000    185.7500 -64.0
+    132.7500    185.5000 -64.0
+    142.7500    178.5000 -64.0
+    145.5000    174.7500 -64.0
+    147.7500    168.5000 -64.0
+    150.5000    162.7500 -64.0
+    150.7500    149.5000 -64.0
+    148.7500    147.5000 -64.0
+    146.5000    147.2500 -64.0
+    146.2500    149.5000 -64.0
+    144.5000    151.2500 -64.0
+    134.5000    146.2500 -64.0
+    132.5000    148.2500 -64.0
+    130.5000    148.2500 -64.0
+    128.7500    147.5000 -64.0
+    126.7500    143.5000 -64.0
+    127.5000    141.7500 -64.0
+    126.7500    140.5000 -64.0
+    126.7500    136.5000 -64.0
+    128.5000    134.7500 -64.0
+    131.5000    134.7500 -64.0
+    131.7500    131.5000 -64.0
+    130.7500    129.5000 -64.0
+    131.7500    122.5000 -64.0
+    130.7500    119.5000 -64.0
+    128.7500    118.5000 -64.0
+    121.7500    114.5000 -64.0
+    115.5000    113.2500 -64.0
+    109.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+    142.2500    114.5000 -64.0
+    141.5000    115.2500 -64.0
+    142.2500    116.5000 -64.0
+    144.5000    116.7500 -64.0
+} -64.0
+{ -64.0
+     67.2500    115.5000 -64.0
+     66.5000    116.2500 -64.0
+     66.5000    117.7500 -64.0
+     68.5000    118.7500 -64.0
+     68.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+    160.2500    131.5000 -64.0
+    160.2500    132.5000 -64.0
+    159.5000    134.2500 -64.0
+    156.5000    134.2500 -64.0
+    153.5000    133.2500 -64.0
+    159.2500    145.5000 -64.0
+    163.2500    150.5000 -64.0
+    164.5000    149.7500 -64.0
+    164.7500    137.5000 -64.0
+    161.7500    131.5000 -64.0
+} -64.0
+{ -64.0
+     77.2500    139.5000 -64.0
+     82.5000    142.7500 -64.0
+     83.5000    142.2500 -64.0
+     79.7500    139.5000 -64.0
+} -64.0
+{ -64.0
+    113.7500     27.5000 -64.0
+    115.5000     26.7500 -64.0
+    117.2500     27.5000 -64.0
+    116.5000     29.2500 -64.0
+} -64.0
+{ -64.0
+    125.7500     33.5000 -64.0
+    126.5000     32.7500 -64.0
+    127.2500     33.5000 -64.0
+    126.5000     35.2500 -64.0
+} -64.0
+{ -64.0
+    132.7500     52.5000 -64.0
+    133.5000     51.7500 -64.0
+    135.2500     53.5000 -64.0
+    133.5000     54.2500 -64.0
+} -64.0
+{ -64.0
+     83.7500     57.5000 -64.0
+     85.5000     56.7500 -64.0
+     87.2500     57.5000 -64.0
+     85.5000     59.2500 -64.0
+     86.2500     62.5000 -64.0
+     84.5000     63.2500 -64.0
+     82.7500     62.5000 -64.0
+} -64.0
+{ -64.0
+     92.7500    116.5000 -64.0
+     93.5000    115.7500 -64.0
+     94.2500    116.5000 -64.0
+     93.5000    117.2500 -64.0
+} -64.0
+{ -64.0
+    119.7500    116.5000 -64.0
+    120.5000    115.7500 -64.0
+    121.2500    116.5000 -64.0
+    120.5000    117.2500 -64.0
+} -64.0
+{ -64.0
+    121.7500    117.5000 -64.0
+    122.5000    116.7500 -64.0
+    123.2500    117.5000 -64.0
+    122.5000    118.2500 -64.0
+} -64.0
+{ -64.0
+    107.7500    119.5000 -64.0
+    108.5000    118.7500 -64.0
+    109.2500    119.5000 -64.0
+    108.5000    120.2500 -64.0
+} -64.0
+{ -64.0
+    118.7500    119.5000 -64.0
+    119.5000    118.7500 -64.0
+    120.2500    119.5000 -64.0
+    124.5000    120.7500 -64.0
+    129.2500    125.5000 -64.0
+    128.5000    127.2500 -64.0
+    125.5000    125.2500 -64.0
+    123.5000    124.2500 -64.0
+} -64.0
+{ -64.0
+    126.7500    120.5000 -64.0
+    127.5000    119.7500 -64.0
+    128.2500    120.5000 -64.0
+    127.5000    121.2500 -64.0
+} -64.0
+{ -64.0
+    117.7500    121.5000 -64.0
+    118.5000    120.7500 -64.0
+    119.2500    121.5000 -64.0
+    120.2500    123.5000 -64.0
+    121.5000    123.7500 -64.0
+    123.5000    125.7500 -64.0
+    127.2500    128.5000 -64.0
+    127.2500    131.5000 -64.0
+    125.5000    133.2500 -64.0
+    123.5000    133.2500 -64.0
+    120.7500    129.5000 -64.0
+    120.7500    127.5000 -64.0
+} -64.0
+{ -64.0
+     49.7500    132.5000 -64.0
+     51.5000    131.7500 -64.0
+     53.2500    133.5000 -64.0
+     53.2500    135.5000 -64.0
+     55.2500    137.5000 -64.0
+     55.2500    139.5000 -64.0
+     51.5000    143.2500 -64.0
+     48.5000    143.2500 -64.0
+     45.7500    139.5000 -64.0
+     47.5000    135.7500 -64.0
+     49.7500    135.5000 -64.0
+     48.7500    133.5000 -64.0
+} -64.0
+{ -64.0
+    129.7500    152.5000 -64.0
+    130.5000    151.7500 -64.0
+    137.5000    151.7500 -64.0
+    142.2500    156.5000 -64.0
+    142.2500    159.5000 -64.0
+    143.2500    161.5000 -64.0
+    143.2500    166.5000 -64.0
+    141.2500    168.5000 -64.0
+    140.2500    170.5000 -64.0
+    135.2500    174.5000 -64.0
+    128.5000    179.2500 -64.0
+    126.5000    179.2500 -64.0
+    124.5000    180.2500 -64.0
+    120.5000    180.2500 -64.0
+    114.7500    177.5000 -64.0
+    111.7500    172.5000 -64.0
+    111.7500    167.5000 -64.0
+    114.5000    163.7500 -64.0
+    116.5000    162.7500 -64.0
+    122.5000    155.7500 -64.0
+    127.5000    152.7500 -64.0
+} -64.0
+{ -64.0
+    101.7500    165.5000 -64.0
+    102.5000    164.7500 -64.0
+    103.5000    165.7500 -64.0
+    105.5000    164.7500 -64.0
+    106.2500    165.5000 -64.0
+    106.2500    167.5000 -64.0
+    105.5000    169.2500 -64.0
+    103.5000    169.2500 -64.0
+} -64.0
+v 616 z -150.000000 -64.0
+{ -64.0
+    106.2500     26.5000 -64.0
+    111.2500     27.5000 -64.0
+    109.2500     28.5000 -64.0
+    107.5000     32.2500 -64.0
+    105.7500     30.5000 -64.0
+    105.7500     27.5000 -64.0
+    101.5000     27.2500 -64.0
+    102.5000     27.7500 -64.0
+    104.2500     31.5000 -64.0
+    102.5000     32.2500 -64.0
+    100.7500     30.5000 -64.0
+    100.7500     28.5000 -64.0
+     95.5000     31.2500 -64.0
+     94.7500     29.5000 -64.0
+     93.2500     29.5000 -64.0
+     91.2500     33.5000 -64.0
+     90.5000     36.7500 -64.0
+     92.5000     35.7500 -64.0
+     94.2500     37.5000 -64.0
+     95.5000     36.7500 -64.0
+     96.2500     37.5000 -64.0
+     98.5000     37.7500 -64.0
+     99.5000     39.7500 -64.0
+     99.7500     37.5000 -64.0
+     97.7500     35.5000 -64.0
+     99.5000     32.7500 -64.0
+    101.2500     33.5000 -64.0
+    101.2500     35.5000 -64.0
+    105.5000     31.7500 -64.0
+    106.2500     32.5000 -64.0
+    109.5000     32.7500 -64.0
+    112.5000     29.7500 -64.0
+    113.2500     31.5000 -64.0
+    115.5000     32.7500 -64.0
+    117.5000     31.7500 -64.0
+    120.5000     31.7500 -64.0
+    122.7500     27.5000 -64.0
+    120.7500     26.5000 -64.0
+    119.5000     27.2500 -64.0
+    117.5000     26.2500 -64.0
+    118.2500     29.5000 -64.0
+    116.5000     30.2500 -64.0
+    115.7500     28.5000 -64.0
+    112.7500     27.5000 -64.0
+    113.7500     26.5000 -64.0
+} -64.0
+{ -64.0
+    125.2500     29.5000 -64.0
+    123.5000     32.2500 -64.0
+    121.5000     32.2500 -64.0
+    122.2500     35.5000 -64.0
+    123.5000     33.7500 -64.0
+    126.5000     33.7500 -64.0
+    128.2500     34.5000 -64.0
+    129.5000     33.7500 -64.0
+    129.7500     29.5000 -64.0
+} -64.0
+{ -64.0
+    128.2500     36.5000 -64.0
+    127.2500     38.5000 -64.0
+    128.5000     37.7500 -64.0
+    130.2500     38.5000 -64.0
+    130.2500     41.5000 -64.0
+    129.5000     43.2500 -64.0
+    130.2500     46.5000 -64.0
+    133.2500     47.5000 -64.0
+    132.2500     52.5000 -64.0
+    133.5000     49.7500 -64.0
+    135.2500     50.5000 -64.0
+    135.5000     55.7500 -64.0
+    137.7500     47.5000 -64.0
+    136.7500     45.5000 -64.0
+    136.7500     43.5000 -64.0
+    132.5000     43.2500 -64.0
+    130.7500     42.5000 -64.0
+    130.7500     39.5000 -64.0
+    133.5000     36.7500 -64.0
+    132.5000     36.2500 -64.0
+    130.5000     37.2500 -64.0
+} -64.0
+{ -64.0
+    123.2500     38.5000 -64.0
+    123.2500     40.5000 -64.0
+    123.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+    135.2500     39.5000 -64.0
+    134.5000     40.2500 -64.0
+    136.2500     41.5000 -64.0
+    136.7500     40.5000 -64.0
+} -64.0
+{ -64.0
+     98.2500     40.5000 -64.0
+     97.2500     41.5000 -64.0
+     98.7500     41.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500     43.5000 -64.0
+     87.2500     46.5000 -64.0
+     85.5000     50.2500 -64.0
+     81.5000     50.2500 -64.0
+     79.5000     51.2500 -64.0
+     80.2500     52.5000 -64.0
+     80.2500     55.5000 -64.0
+     79.5000     57.2500 -64.0
+     78.7500     56.5000 -64.0
+     78.2500     57.5000 -64.0
+     80.5000     60.7500 -64.0
+     80.7500     58.5000 -64.0
+     85.5000     53.7500 -64.0
+     86.5000     54.7500 -64.0
+     88.7500     46.5000 -64.0
+     90.7500     44.5000 -64.0
+} -64.0
+{ -64.0
+     95.2500     43.5000 -64.0
+     94.2500     44.5000 -64.0
+     93.2500     49.5000 -64.0
+     94.5000     49.7500 -64.0
+     96.5000     48.7500 -64.0
+     96.7500     46.5000 -64.0
+} -64.0
+{ -64.0
+    126.2500     43.5000 -64.0
+    126.2500     44.5000 -64.0
+    124.5000     46.2500 -64.0
+    124.2500     48.5000 -64.0
+    125.2500     50.5000 -64.0
+    127.5000     50.7500 -64.0
+    126.7500     49.5000 -64.0
+    127.5000     48.7500 -64.0
+    128.2500     49.5000 -64.0
+    128.7500     48.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500     49.5000 -64.0
+    116.2500     50.5000 -64.0
+    117.5000     50.7500 -64.0
+    120.2500     53.5000 -64.0
+    118.5000     54.2500 -64.0
+    117.5000     54.7500 -64.0
+    119.5000     55.7500 -64.0
+    121.2500     56.5000 -64.0
+    120.2500     58.5000 -64.0
+    124.5000     58.7500 -64.0
+    124.7500     56.5000 -64.0
+    125.5000     54.7500 -64.0
+    119.7500     49.5000 -64.0
+} -64.0
+{ -64.0
+    145.2500     53.5000 -64.0
+    144.5000     54.2500 -64.0
+    142.2500     54.5000 -64.0
+    144.5000     54.7500 -64.0
+    146.5000     53.7500 -64.0
+    148.7500     53.5000 -64.0
+} -64.0
+{ -64.0
+    111.2500     56.5000 -64.0
+    110.5000     57.2500 -64.0
+    107.5000     57.2500 -64.0
+    105.5000     58.2500 -64.0
+    101.5000     58.2500 -64.0
+    100.5000     60.2500 -64.0
+     99.7500     59.5000 -64.0
+     98.5000     60.2500 -64.0
+     96.5000     60.2500 -64.0
+     94.5000     61.2500 -64.0
+     92.5000     61.2500 -64.0
+     90.7500     57.5000 -64.0
+     89.5000     58.2500 -64.0
+     89.2500     60.5000 -64.0
+     88.5000     62.2500 -64.0
+     90.2500     65.5000 -64.0
+     92.5000     65.7500 -64.0
+     97.5000     66.7500 -64.0
+     99.5000     65.7500 -64.0
+    101.5000     65.7500 -64.0
+    103.2500     66.5000 -64.0
+    127.7500     66.5000 -64.0
+    123.5000     66.2500 -64.0
+    121.7500     65.5000 -64.0
+    122.7500     63.5000 -64.0
+    118.5000     63.2500 -64.0
+    116.5000     64.2500 -64.0
+    114.5000     64.2500 -64.0
+    112.5000     65.2500 -64.0
+    101.5000     65.2500 -64.0
+     99.7500     64.5000 -64.0
+    100.5000     62.7500 -64.0
+    102.5000     62.7500 -64.0
+    104.5000     61.7500 -64.0
+    107.5000     61.7500 -64.0
+    109.5000     60.7500 -64.0
+    112.5000     60.7500 -64.0
+    114.5000     59.7500 -64.0
+    117.5000     59.7500 -64.0
+    114.5000     58.2500 -64.0
+    113.7500     56.5000 -64.0
+} -64.0
+{ -64.0
+    150.2500     57.5000 -64.0
+    149.5000     58.2500 -64.0
+    143.5000     58.2500 -64.0
+    141.5000     59.2500 -64.0
+    136.5000     59.2500 -64.0
+    137.5000     59.7500 -64.0
+    139.2500     60.5000 -64.0
+    140.5000     59.7500 -64.0
+    141.2500     60.5000 -64.0
+    143.5000     60.7500 -64.0
+    144.2500     62.5000 -64.0
+    142.5000     63.2500 -64.0
+    144.2500     65.5000 -64.0
+    143.5000     66.2500 -64.0
+    141.2500     67.5000 -64.0
+    143.2500     71.5000 -64.0
+    143.2500     73.5000 -64.0
+    141.5000     74.2500 -64.0
+    146.2500     77.5000 -64.0
+    147.2500     79.5000 -64.0
+    152.2500     82.5000 -64.0
+    152.7500     81.5000 -64.0
+    153.5000     79.7500 -64.0
+    155.2500     80.5000 -64.0
+    161.5000     82.7500 -64.0
+    160.7500     81.5000 -64.0
+    156.5000     78.2500 -64.0
+    154.5000     77.2500 -64.0
+    152.7500     76.5000 -64.0
+    147.5000     76.2500 -64.0
+    145.7500     74.5000 -64.0
+    147.5000     73.7500 -64.0
+    147.7500     72.5000 -64.0
+    143.7500     70.5000 -64.0
+    142.7500     68.5000 -64.0
+    144.5000     66.7500 -64.0
+    146.5000     66.7500 -64.0
+    148.5000     65.7500 -64.0
+    155.5000     65.7500 -64.0
+    155.7500     64.5000 -64.0
+    153.7500     63.5000 -64.0
+    152.5000     64.2500 -64.0
+    150.5000     64.2500 -64.0
+    148.7500     63.5000 -64.0
+    149.5000     62.7500 -64.0
+    151.5000     62.7500 -64.0
+    153.5000     61.7500 -64.0
+    152.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+     85.2500     58.5000 -64.0
+     85.2500     60.5000 -64.0
+     85.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+     64.2500     61.5000 -64.0
+     65.2500     62.5000 -64.0
+     75.5000     63.7500 -64.0
+     72.7500     62.5000 -64.0
+} -64.0
+{ -64.0
+    129.2500     63.5000 -64.0
+    129.2500     66.5000 -64.0
+    130.5000     65.7500 -64.0
+    132.5000     66.7500 -64.0
+} -64.0
+{ -64.0
+     72.2500     65.5000 -64.0
+     70.5000     66.2500 -64.0
+     77.2500     69.5000 -64.0
+     77.5000     71.7500 -64.0
+     77.7500     68.5000 -64.0
+     75.7500     67.5000 -64.0
+     75.7500     65.5000 -64.0
+} -64.0
+{ -64.0
+    129.2500     69.5000 -64.0
+    128.2500     71.5000 -64.0
+    125.5000     74.2500 -64.0
+     92.5000     73.2500 -64.0
+     93.2500     74.5000 -64.0
+     91.5000     75.2500 -64.0
+     89.7500     73.5000 -64.0
+     91.5000     72.7500 -64.0
+     91.7500     70.5000 -64.0
+     88.5000     72.2500 -64.0
+     89.2500     74.5000 -64.0
+     87.5000     75.2500 -64.0
+     88.2500     76.5000 -64.0
+     93.5000     77.7500 -64.0
+     97.2500     81.5000 -64.0
+    100.5000     79.7500 -64.0
+     98.7500     76.5000 -64.0
+    100.5000     75.7500 -64.0
+    103.5000     76.7500 -64.0
+    105.5000     75.7500 -64.0
+    110.5000     76.7500 -64.0
+    113.5000     75.7500 -64.0
+    115.2500     76.5000 -64.0
+    114.5000     78.2500 -64.0
+    117.5000     79.7500 -64.0
+    118.2500     81.5000 -64.0
+    116.5000     83.2500 -64.0
+    116.2500     85.5000 -64.0
+    118.5000     83.7500 -64.0
+    120.5000     83.7500 -64.0
+    124.5000     81.7500 -64.0
+    125.5000     83.7500 -64.0
+    129.5000     80.7500 -64.0
+    131.5000     80.7500 -64.0
+    134.5000     77.2500 -64.0
+    132.5000     78.2500 -64.0
+    127.5000     77.2500 -64.0
+    126.7500     75.5000 -64.0
+    128.5000     73.7500 -64.0
+    130.5000     73.7500 -64.0
+} -64.0
+{ -64.0
+     75.2500     73.5000 -64.0
+     74.5000     74.2500 -64.0
+     69.5000     74.2500 -64.0
+     67.5000     75.2500 -64.0
+     61.5000     75.2500 -64.0
+     59.5000     76.2500 -64.0
+     57.5000     76.2500 -64.0
+     55.5000     77.2500 -64.0
+     53.2500     77.5000 -64.0
+     60.5000     77.7500 -64.0
+     62.5000     76.7500 -64.0
+     67.5000     76.7500 -64.0
+     69.2500     77.5000 -64.0
+     67.5000     78.2500 -64.0
+     61.5000     81.2500 -64.0
+     63.2500     82.5000 -64.0
+     61.5000     86.2500 -64.0
+     61.2500     88.5000 -64.0
+     58.2500     94.5000 -64.0
+     57.2500     99.5000 -64.0
+     54.5000    103.2500 -64.0
+     54.2500    107.5000 -64.0
+     55.2500    109.5000 -64.0
+     58.5000    109.7500 -64.0
+     59.7500    106.5000 -64.0
+     60.5000    104.7500 -64.0
+     59.7500    102.5000 -64.0
+     57.5000    106.2500 -64.0
+     56.7500    105.5000 -64.0
+     56.7500    101.5000 -64.0
+     60.7500     93.5000 -64.0
+     65.5000     85.7500 -64.0
+     67.5000     87.7500 -64.0
+     69.5000     88.7500 -64.0
+     69.7500     86.5000 -64.0
+     68.5000     86.2500 -64.0
+     66.7500     83.5000 -64.0
+     66.7500     81.5000 -64.0
+     70.5000     78.7500 -64.0
+     72.2500     79.5000 -64.0
+     77.5000     74.7500 -64.0
+     79.5000     74.7500 -64.0
+     78.5000     74.2500 -64.0
+     76.7500     73.5000 -64.0
+} -64.0
+{ -64.0
+    103.2500     82.5000 -64.0
+    103.5000     82.7500 -64.0
+    105.5000     83.7500 -64.0
+    104.7500     82.5000 -64.0
+} -64.0
+{ -64.0
+    131.2500     84.5000 -64.0
+    130.5000     85.2500 -64.0
+    130.2500     87.5000 -64.0
+    131.5000     87.7500 -64.0
+    131.7500     85.5000 -64.0
+} -64.0
+{ -64.0
+    150.2500     84.5000 -64.0
+    149.5000     88.2500 -64.0
+    152.2500     92.5000 -64.0
+    152.5000     94.7500 -64.0
+    152.7500     90.5000 -64.0
+    153.7500     87.5000 -64.0
+} -64.0
+{ -64.0
+     68.2500     91.5000 -64.0
+     67.5000     92.2500 -64.0
+     62.2500     96.5000 -64.0
+     66.5000     96.7500 -64.0
+     68.7500     92.5000 -64.0
+} -64.0
+{ -64.0
+    153.2500     95.5000 -64.0
+    153.2500     97.5000 -64.0
+    153.7500     96.5000 -64.0
+} -64.0
+{ -64.0
+    154.2500     98.5000 -64.0
+    154.2500     99.5000 -64.0
+    155.2500    101.5000 -64.0
+    155.2500    108.5000 -64.0
+    154.5000    110.2500 -64.0
+    153.5000    109.2500 -64.0
+    153.5000    111.7500 -64.0
+    155.5000    112.7500 -64.0
+    157.5000    110.7500 -64.0
+    157.7500    108.5000 -64.0
+    156.7500    106.5000 -64.0
+    156.7500    103.5000 -64.0
+} -64.0
+{ -64.0
+    152.2500    106.5000 -64.0
+    152.2500    108.5000 -64.0
+    152.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+    106.2500    108.5000 -64.0
+     94.5000    114.2500 -64.0
+     91.5000    114.2500 -64.0
+     87.2500    116.5000 -64.0
+     89.5000    116.7500 -64.0
+     96.5000    114.7500 -64.0
+     97.2500    116.5000 -64.0
+     95.5000    118.2500 -64.0
+     91.5000    118.2500 -64.0
+     85.5000    121.2500 -64.0
+     84.7500    119.5000 -64.0
+     86.7500    117.5000 -64.0
+     84.5000    117.2500 -64.0
+     81.5000    120.2500 -64.0
+     83.2500    122.5000 -64.0
+     83.2500    126.5000 -64.0
+     88.5000    121.7500 -64.0
+     90.2500    122.5000 -64.0
+     89.5000    124.2500 -64.0
+     92.2500    130.5000 -64.0
+     88.5000    133.2500 -64.0
+     86.7500    132.5000 -64.0
+     86.7500    130.5000 -64.0
+     83.5000    128.2500 -64.0
+     81.5000    131.2500 -64.0
+     81.2500    134.5000 -64.0
+     87.2500    138.5000 -64.0
+     87.2500    140.5000 -64.0
+     85.5000    141.2500 -64.0
+     84.5000    143.2500 -64.0
+     85.2500    145.5000 -64.0
+     84.5000    147.2500 -64.0
+     81.5000    147.2500 -64.0
+     79.5000    144.2500 -64.0
+     77.5000    143.2500 -64.0
+     73.5000    146.2500 -64.0
+     71.5000    145.2500 -64.0
+     70.7500    143.5000 -64.0
+     66.7500    140.5000 -64.0
+     64.5000    140.2500 -64.0
+     60.5000    138.2500 -64.0
+     59.2500    139.5000 -64.0
+     56.5000    145.2500 -64.0
+     55.5000    144.2500 -64.0
+     52.5000    149.2500 -64.0
+     52.2500    151.5000 -64.0
+     53.5000    152.7500 -64.0
+     55.5000    151.7500 -64.0
+     57.2500    152.5000 -64.0
+     58.2500    161.5000 -64.0
+     63.2500    174.5000 -64.0
+     75.2500    182.5000 -64.0
+     91.5000    182.7500 -64.0
+     91.7500    181.5000 -64.0
+     93.5000    179.7500 -64.0
+     94.2500    180.5000 -64.0
+     96.5000    180.7500 -64.0
+     98.5000    178.7500 -64.0
+    100.2500    180.5000 -64.0
+    100.2500    184.5000 -64.0
+    104.2500    185.5000 -64.0
+    105.5000    184.7500 -64.0
+    107.7500    178.5000 -64.0
+    105.7500    174.5000 -64.0
+    105.7500    171.5000 -64.0
+    107.5000    169.7500 -64.0
+    110.2500    175.5000 -64.0
+    110.2500    177.5000 -64.0
+    111.5000    177.7500 -64.0
+    112.2500    179.5000 -64.0
+    116.5000    180.7500 -64.0
+    119.2500    183.5000 -64.0
+    127.5000    183.7500 -64.0
+    137.5000    178.7500 -64.0
+    143.5000    172.7500 -64.0
+    146.7500    162.5000 -64.0
+    145.7500    159.5000 -64.0
+    141.5000    157.2500 -64.0
+    140.7500    155.5000 -64.0
+    134.7500    150.5000 -64.0
+    128.5000    150.2500 -64.0
+    125.7500    147.5000 -64.0
+    125.7500    142.5000 -64.0
+    124.5000    142.2500 -64.0
+    121.2500    145.5000 -64.0
+    118.5000    151.2500 -64.0
+    109.5000    157.2500 -64.0
+    101.5000    157.2500 -64.0
+     94.7500    151.5000 -64.0
+     91.7500    146.5000 -64.0
+     91.7500    142.5000 -64.0
+     90.7500    140.5000 -64.0
+     90.7500    135.5000 -64.0
+     91.7500    132.5000 -64.0
+     97.5000    125.7500 -64.0
+     97.7500    123.5000 -64.0
+     96.5000    122.2500 -64.0
+     94.5000    125.2500 -64.0
+     92.7500    124.5000 -64.0
+     93.5000    123.7500 -64.0
+     91.7500    121.5000 -64.0
+     94.5000    119.7500 -64.0
+     96.5000    119.7500 -64.0
+     98.5000    117.7500 -64.0
+    102.5000    115.7500 -64.0
+    104.2500    116.5000 -64.0
+    105.2500    122.5000 -64.0
+    108.5000    124.7500 -64.0
+    111.5000    121.7500 -64.0
+    111.7500    117.5000 -64.0
+    113.5000    116.7500 -64.0
+    115.2500    117.5000 -64.0
+    118.2500    121.5000 -64.0
+    118.2500    124.5000 -64.0
+    121.2500    130.5000 -64.0
+    121.2500    133.5000 -64.0
+    122.2500    136.5000 -64.0
+    123.7500    136.5000 -64.0
+    124.7500    134.5000 -64.0
+    121.7500    130.5000 -64.0
+    122.5000    128.7500 -64.0
+    127.2500    135.5000 -64.0
+    127.2500    138.5000 -64.0
+    129.5000    138.7500 -64.0
+    131.5000    135.7500 -64.0
+    131.7500    126.5000 -64.0
+    133.5000    124.7500 -64.0
+    133.7500    122.5000 -64.0
+    132.7500    120.5000 -64.0
+    130.5000    122.2500 -64.0
+    131.2500    123.5000 -64.0
+    130.5000    124.2500 -64.0
+    128.7500    122.5000 -64.0
+    126.5000    122.2500 -64.0
+    124.7500    120.5000 -64.0
+    120.5000    119.2500 -64.0
+    117.7500    116.5000 -64.0
+    118.5000    114.7500 -64.0
+    128.2500    119.5000 -64.0
+    129.7500    118.5000 -64.0
+    122.7500    114.5000 -64.0
+    117.5000    113.2500 -64.0
+    110.7500    108.5000 -64.0
+} -64.0
+{ -64.0
+    142.2500    113.5000 -64.0
+    142.2500    114.5000 -64.0
+    143.5000    114.7500 -64.0
+} -64.0
+{ -64.0
+     68.2500    114.5000 -64.0
+     67.2500    116.5000 -64.0
+     69.5000    116.7500 -64.0
+     69.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+     50.2500    128.5000 -64.0
+     48.5000    129.2500 -64.0
+     46.5000    133.2500 -64.0
+     46.2500    140.5000 -64.0
+     45.2500    142.5000 -64.0
+     46.2500    144.5000 -64.0
+     46.2500    147.5000 -64.0
+     47.5000    148.7500 -64.0
+     50.5000    144.7500 -64.0
+     50.7500    142.5000 -64.0
+     49.5000    142.2500 -64.0
+     46.7500    138.5000 -64.0
+     49.5000    135.7500 -64.0
+     54.5000    137.7500 -64.0
+     55.5000    134.7500 -64.0
+     53.7500    128.5000 -64.0
+} -64.0
+{ -64.0
+    158.2500    131.5000 -64.0
+    157.5000    132.2500 -64.0
+    154.2500    132.5000 -64.0
+    158.2500    140.5000 -64.0
+    161.2500    144.5000 -64.0
+    162.7500    144.5000 -64.0
+    161.7500    142.5000 -64.0
+    161.7500    138.5000 -64.0
+    162.5000    136.7500 -64.0
+    161.7500    135.5000 -64.0
+    161.7500    133.5000 -64.0
+    159.7500    131.5000 -64.0
+} -64.0
+{ -64.0
+    125.7500     30.5000 -64.0
+    126.5000     29.7500 -64.0
+    128.2500     30.5000 -64.0
+    129.2500     32.5000 -64.0
+    127.5000     33.2500 -64.0
+} -64.0
+{ -64.0
+     93.7500     35.5000 -64.0
+     94.5000     34.7500 -64.0
+     95.2500     35.5000 -64.0
+     94.5000     36.2500 -64.0
+} -64.0
+{ -64.0
+     97.7500     64.5000 -64.0
+     98.5000     63.7500 -64.0
+     99.2500     64.5000 -64.0
+     98.5000     65.2500 -64.0
+} -64.0
+{ -64.0
+    150.7500     78.5000 -64.0
+    151.5000     77.7500 -64.0
+    152.2500     78.5000 -64.0
+    151.5000     79.2500 -64.0
+} -64.0
+{ -64.0
+    118.7500     82.5000 -64.0
+    119.5000     81.7500 -64.0
+    120.2500     82.5000 -64.0
+    119.5000     83.2500 -64.0
+} -64.0
+{ -64.0
+    106.7500    118.5000 -64.0
+    108.5000    117.7500 -64.0
+    109.2500    119.5000 -64.0
+    108.5000    121.2500 -64.0
+    106.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+    122.5000    122.7500 -64.0
+    125.5000    123.7500 -64.0
+    128.2500    127.5000 -64.0
+    127.5000    129.2500 -64.0
+    123.5000    124.2500 -64.0
+    121.5000    125.2500 -64.0
+    120.7500    124.5000 -64.0
+} -64.0
+{ -64.0
+     72.7500    149.5000 -64.0
+     73.5000    148.7500 -64.0
+     75.5000    149.7500 -64.0
+     78.5000    152.7500 -64.0
+     80.5000    153.7500 -64.0
+     84.5000    158.7500 -64.0
+     89.2500    165.5000 -64.0
+     89.2500    168.5000 -64.0
+     85.5000    172.2500 -64.0
+     82.5000    172.2500 -64.0
+     80.5000    173.2500 -64.0
+     79.7500    172.5000 -64.0
+     77.5000    172.2500 -64.0
+     72.5000    170.2500 -64.0
+     69.5000    167.2500 -64.0
+     67.5000    166.2500 -64.0
+     64.7500    162.5000 -64.0
+     64.7500    160.5000 -64.0
+     63.7500    158.5000 -64.0
+     63.7500    156.5000 -64.0
+     69.5000    149.7500 -64.0
+} -64.0
+{ -64.0
+    121.7500    152.5000 -64.0
+    122.5000    151.7500 -64.0
+    123.2500    152.5000 -64.0
+    122.5000    153.2500 -64.0
+} -64.0
+{ -64.0
+    128.7500    156.5000 -64.0
+    129.5000    155.7500 -64.0
+    135.5000    155.7500 -64.0
+    140.2500    159.5000 -64.0
+    140.2500    162.5000 -64.0
+    138.2500    166.5000 -64.0
+    135.5000    170.2500 -64.0
+    131.5000    173.2500 -64.0
+    127.5000    175.2500 -64.0
+    122.5000    175.2500 -64.0
+    118.7500    172.5000 -64.0
+    118.7500    169.5000 -64.0
+    119.5000    167.7500 -64.0
+    123.7500    161.5000 -64.0
+    124.7500    159.5000 -64.0
+} -64.0
+v 544 z -152.000000 -64.0
+{ -64.0
+    105.2500     26.5000 -64.0
+    104.5000     27.2500 -64.0
+    101.5000     27.2500 -64.0
+    100.2500     28.5000 -64.0
+    101.2500     30.5000 -64.0
+    101.2500     32.5000 -64.0
+    102.5000     32.7500 -64.0
+    104.5000     30.7500 -64.0
+    108.5000     30.7500 -64.0
+    112.5000     28.7500 -64.0
+    114.2500     29.5000 -64.0
+    117.5000     29.7500 -64.0
+    119.5000     27.7500 -64.0
+    122.5000     27.7500 -64.0
+    121.7500     26.5000 -64.0
+    118.5000     26.2500 -64.0
+    117.5000     28.2500 -64.0
+    114.5000     28.2500 -64.0
+    112.7500     27.5000 -64.0
+    113.7500     26.5000 -64.0
+    110.5000     26.2500 -64.0
+    112.2500     27.5000 -64.0
+    111.5000     28.2500 -64.0
+    107.5000     30.2500 -64.0
+    105.7500     28.5000 -64.0
+    106.7500     26.5000 -64.0
+} -64.0
+{ -64.0
+     93.2500     29.5000 -64.0
+     92.2500     32.5000 -64.0
+     90.5000     33.2500 -64.0
+     90.2500     36.5000 -64.0
+     92.5000     33.7500 -64.0
+     93.2500     34.5000 -64.0
+     94.5000     33.7500 -64.0
+     95.2500     34.5000 -64.0
+     94.5000     35.2500 -64.0
+     96.5000     36.7500 -64.0
+     96.7500     34.5000 -64.0
+     98.5000     32.7500 -64.0
+     98.5000     30.2500 -64.0
+     94.5000     32.2500 -64.0
+} -64.0
+{ -64.0
+    126.2500     29.5000 -64.0
+    126.2500     30.5000 -64.0
+    127.2500     32.5000 -64.0
+    128.7500     32.5000 -64.0
+    130.5000     29.2500 -64.0
+    128.5000     30.2500 -64.0
+} -64.0
+{ -64.0
+    131.2500     32.5000 -64.0
+    129.2500     33.5000 -64.0
+    132.5000     33.7500 -64.0
+    133.7500     32.5000 -64.0
+} -64.0
+{ -64.0
+     99.2500     33.5000 -64.0
+     99.2500     36.5000 -64.0
+     97.5000     37.7500 -64.0
+    102.5000     38.7500 -64.0
+     99.7500     36.5000 -64.0
+    100.7500     33.5000 -64.0
+} -64.0
+{ -64.0
+    130.2500     35.5000 -64.0
+    129.5000     36.7500 -64.0
+    132.5000     35.7500 -64.0
+    133.2500     37.5000 -64.0
+    135.7500     35.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500     37.5000 -64.0
+    122.2500     39.5000 -64.0
+    122.7500     38.5000 -64.0
+} -64.0
+{ -64.0
+     91.2500     38.5000 -64.0
+     91.2500     40.5000 -64.0
+     91.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+    134.2500     39.5000 -64.0
+    133.2500     40.5000 -64.0
+    135.5000     40.7500 -64.0
+    136.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500     42.5000 -64.0
+     87.5000     47.2500 -64.0
+     88.2500     49.5000 -64.0
+     90.7500     43.5000 -64.0
+} -64.0
+{ -64.0
+     95.2500     43.5000 -64.0
+     95.2500     44.5000 -64.0
+     96.5000     44.7500 -64.0
+     97.2500     46.5000 -64.0
+     96.5000     48.2500 -64.0
+     94.2500     49.5000 -64.0
+     96.5000     49.7500 -64.0
+     98.2500     50.5000 -64.0
+     92.5000     55.2500 -64.0
+     90.5000     56.2500 -64.0
+     90.5000     57.7500 -64.0
+     92.5000     56.7500 -64.0
+     95.5000     56.7500 -64.0
+    107.5000     50.7500 -64.0
+    109.5000     50.7500 -64.0
+    109.7500     49.5000 -64.0
+    108.5000     49.2500 -64.0
+    106.7500     47.5000 -64.0
+    102.5000     47.2500 -64.0
+     98.5000     45.2500 -64.0
+} -64.0
+{ -64.0
+    133.2500     43.5000 -64.0
+    134.2500     45.5000 -64.0
+    135.5000     44.7500 -64.0
+    134.7500     43.5000 -64.0
+} -64.0
+{ -64.0
+    140.2500     45.5000 -64.0
+    137.5000     47.2500 -64.0
+    134.5000     47.2500 -64.0
+    136.2500     48.5000 -64.0
+    135.2500     50.5000 -64.0
+    137.2500     54.5000 -64.0
+    136.2500     55.5000 -64.0
+    142.5000     55.7500 -64.0
+    143.7500     54.5000 -64.0
+    139.5000     54.2500 -64.0
+    137.7500     53.5000 -64.0
+    136.7500     51.5000 -64.0
+    144.5000     47.7500 -64.0
+    144.7500     45.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500     46.5000 -64.0
+    114.2500     47.5000 -64.0
+    115.7500     46.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500     46.5000 -64.0
+    121.5000     47.2500 -64.0
+    119.2500     47.5000 -64.0
+    122.7500     47.5000 -64.0
+} -64.0
+{ -64.0
+    117.2500     48.5000 -64.0
+    121.2500     51.5000 -64.0
+    121.2500     53.5000 -64.0
+    119.5000     54.2500 -64.0
+    116.5000     53.2500 -64.0
+    114.5000     54.2500 -64.0
+    113.7500     53.5000 -64.0
+    114.7500     52.5000 -64.0
+    111.5000     52.2500 -64.0
+    112.2500     54.5000 -64.0
+    105.2500     58.5000 -64.0
+    107.5000     58.7500 -64.0
+    114.5000     56.7500 -64.0
+    115.5000     57.7500 -64.0
+    118.5000     56.7500 -64.0
+    122.5000     53.7500 -64.0
+    124.5000     54.7500 -64.0
+    123.7500     53.5000 -64.0
+    125.7500     50.5000 -64.0
+    122.5000     50.2500 -64.0
+    118.7500     48.5000 -64.0
+} -64.0
+{ -64.0
+     72.2500     50.5000 -64.0
+     70.5000     51.2500 -64.0
+     74.5000     56.7500 -64.0
+     76.5000     57.7500 -64.0
+     75.7500     56.5000 -64.0
+     76.5000     54.7500 -64.0
+     80.2500     56.5000 -64.0
+     85.5000     56.7500 -64.0
+     87.5000     54.7500 -64.0
+     86.5000     53.2500 -64.0
+     82.5000     56.2500 -64.0
+     80.7500     55.5000 -64.0
+     79.7500     53.5000 -64.0
+     74.7500     50.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500     57.5000 -64.0
+    120.2500     58.5000 -64.0
+    125.5000     58.7500 -64.0
+    124.7500     57.5000 -64.0
+} -64.0
+{ -64.0
+     77.2500     58.5000 -64.0
+     76.5000     59.2500 -64.0
+     73.5000     59.2500 -64.0
+     75.2500     60.5000 -64.0
+     78.5000     60.7500 -64.0
+     78.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+    148.2500     58.5000 -64.0
+    146.5000     60.2500 -64.0
+    143.5000     60.2500 -64.0
+    145.2500     61.5000 -64.0
+    144.5000     62.2500 -64.0
+    140.2500     62.5000 -64.0
+    141.2500     64.5000 -64.0
+    140.2500     65.5000 -64.0
+    141.2500     67.5000 -64.0
+    143.5000     67.7500 -64.0
+    145.2500     69.5000 -64.0
+    144.5000     70.2500 -64.0
+    138.2500     70.5000 -64.0
+    142.5000     70.7500 -64.0
+    144.2500     71.5000 -64.0
+    143.5000     72.2500 -64.0
+    140.5000     72.7500 -64.0
+    146.2500     75.5000 -64.0
+    149.5000     75.7500 -64.0
+    155.2500     78.5000 -64.0
+    154.5000     80.2500 -64.0
+    147.5000     77.2500 -64.0
+    147.2500     78.5000 -64.0
+    151.5000     81.7500 -64.0
+    155.5000     83.7500 -64.0
+    157.5000     81.7500 -64.0
+    159.2500     82.5000 -64.0
+    163.5000     82.7500 -64.0
+    160.5000     81.2500 -64.0
+    156.7500     77.5000 -64.0
+    157.7500     76.5000 -64.0
+    152.7500     73.5000 -64.0
+    150.5000     73.2500 -64.0
+    148.7500     71.5000 -64.0
+    150.5000     69.7500 -64.0
+    152.7500     69.5000 -64.0
+    144.7500     66.5000 -64.0
+    145.5000     65.7500 -64.0
+    144.7500     64.5000 -64.0
+    145.5000     63.7500 -64.0
+    149.5000     63.7500 -64.0
+    150.5000     61.7500 -64.0
+    153.5000     61.7500 -64.0
+    153.7500     60.5000 -64.0
+    150.7500     58.5000 -64.0
+} -64.0
+{ -64.0
+     93.2500     59.5000 -64.0
+     93.2500     60.5000 -64.0
+     91.2500     62.5000 -64.0
+     93.5000     62.7500 -64.0
+     95.2500     63.5000 -64.0
+     97.5000     62.7500 -64.0
+    101.2500     64.5000 -64.0
+    108.5000     64.7500 -64.0
+    112.5000     66.7500 -64.0
+    114.5000     65.7500 -64.0
+    116.5000     65.7500 -64.0
+    118.5000     64.7500 -64.0
+    125.5000     64.7500 -64.0
+    126.7500     62.5000 -64.0
+    118.5000     62.2500 -64.0
+    120.2500     63.5000 -64.0
+    119.5000     64.2500 -64.0
+    116.5000     63.2500 -64.0
+    114.7500     62.5000 -64.0
+     95.5000     62.2500 -64.0
+     93.7500     61.5000 -64.0
+     95.5000     60.7500 -64.0
+} -64.0
+{ -64.0
+     76.2500     63.5000 -64.0
+     70.2500     67.5000 -64.0
+     76.5000     67.7500 -64.0
+     78.5000     68.7500 -64.0
+     78.7500     65.5000 -64.0
+     77.7500     63.5000 -64.0
+} -64.0
+{ -64.0
+    129.2500     63.5000 -64.0
+    128.5000     64.2500 -64.0
+    129.5000     65.7500 -64.0
+    131.5000     66.7500 -64.0
+    130.7500     65.5000 -64.0
+    130.7500     63.5000 -64.0
+} -64.0
+{ -64.0
+    129.2500     67.5000 -64.0
+    128.5000     68.2500 -64.0
+    122.5000     68.2500 -64.0
+    123.2500     69.5000 -64.0
+    125.5000     68.7500 -64.0
+    130.5000     69.7500 -64.0
+} -64.0
+{ -64.0
+     76.2500     69.5000 -64.0
+     74.5000     71.7500 -64.0
+     76.5000     72.7500 -64.0
+     79.5000     71.7500 -64.0
+     78.5000     71.2500 -64.0
+     77.7500     69.5000 -64.0
+} -64.0
+{ -64.0
+     93.2500     70.5000 -64.0
+     96.2500     74.5000 -64.0
+     94.5000     75.2500 -64.0
+     91.5000     74.2500 -64.0
+     90.5000     72.2500 -64.0
+     87.5000     76.2500 -64.0
+     86.7500     75.5000 -64.0
+     86.2500     76.5000 -64.0
+     90.5000     81.7500 -64.0
+     91.5000     76.7500 -64.0
+     97.2500     82.5000 -64.0
+     98.2500     84.5000 -64.0
+    101.2500     85.5000 -64.0
+    102.5000     84.7500 -64.0
+    105.5000     84.7500 -64.0
+    106.2500     86.5000 -64.0
+    107.5000     86.7500 -64.0
+    110.5000     85.7500 -64.0
+    110.7500     84.5000 -64.0
+    105.7500     83.5000 -64.0
+    105.7500     80.5000 -64.0
+    101.7500     74.5000 -64.0
+     98.5000     73.2500 -64.0
+     94.7500     70.5000 -64.0
+} -64.0
+{ -64.0
+    132.2500     71.5000 -64.0
+    131.5000     72.2500 -64.0
+    127.5000     72.2500 -64.0
+    129.2500     73.5000 -64.0
+    131.5000     73.7500 -64.0
+    134.5000     74.7500 -64.0
+} -64.0
+{ -64.0
+    121.2500     72.5000 -64.0
+    117.5000     75.2500 -64.0
+    118.5000     75.7500 -64.0
+    119.2500     77.5000 -64.0
+    120.5000     76.7500 -64.0
+    121.2500     77.5000 -64.0
+    123.5000     75.7500 -64.0
+    122.5000     75.2500 -64.0
+} -64.0
+{ -64.0
+    104.2500     73.5000 -64.0
+    107.2500     75.5000 -64.0
+    108.7500     75.5000 -64.0
+    109.7500     73.5000 -64.0
+    108.5000     73.2500 -64.0
+    106.5000     74.2500 -64.0
+    105.7500     73.5000 -64.0
+} -64.0
+{ -64.0
+    124.2500     76.5000 -64.0
+    124.2500     78.5000 -64.0
+    125.7500     76.5000 -64.0
+} -64.0
+{ -64.0
+     69.2500     77.5000 -64.0
+     66.5000     79.2500 -64.0
+     64.5000     79.2500 -64.0
+     60.5000     82.2500 -64.0
+     61.5000     82.7500 -64.0
+     63.5000     81.7500 -64.0
+     64.2500     82.5000 -64.0
+     62.2500     86.5000 -64.0
+     54.2500    106.5000 -64.0
+     55.2500    108.5000 -64.0
+     58.7500    108.5000 -64.0
+     61.5000    102.7500 -64.0
+     61.7500    100.5000 -64.0
+     60.5000    100.2500 -64.0
+     60.2500    101.5000 -64.0
+     58.5000    103.2500 -64.0
+     56.7500    102.5000 -64.0
+     61.5000     92.7500 -64.0
+     61.7500     90.5000 -64.0
+     64.7500     86.5000 -64.0
+     66.5000     85.7500 -64.0
+     68.2500     86.5000 -64.0
+     68.2500     88.5000 -64.0
+     70.2500     89.5000 -64.0
+     64.5000     94.2500 -64.0
+     62.5000     94.2500 -64.0
+     62.2500     95.5000 -64.0
+     66.5000     96.7500 -64.0
+     66.7500     95.5000 -64.0
+     69.7500     92.5000 -64.0
+     70.7500     90.5000 -64.0
+     71.5000     87.2500 -64.0
+     69.5000     86.2500 -64.0
+     65.7500     80.5000 -64.0
+     71.7500     77.5000 -64.0
+} -64.0
+{ -64.0
+    151.2500     85.5000 -64.0
+    148.5000     88.2500 -64.0
+    151.2500     90.5000 -64.0
+    152.2500     95.5000 -64.0
+    150.5000     96.2500 -64.0
+    154.2500     99.5000 -64.0
+    154.2500    104.5000 -64.0
+    153.5000    106.2500 -64.0
+    151.5000    103.2500 -64.0
+    151.2500    105.5000 -64.0
+    154.2500    111.5000 -64.0
+    156.5000    111.7500 -64.0
+    156.7500    104.5000 -64.0
+    155.7500    102.5000 -64.0
+    155.7500    100.5000 -64.0
+    153.7500     96.5000 -64.0
+    153.7500     94.5000 -64.0
+    152.7500     92.5000 -64.0
+    152.7500     86.5000 -64.0
+} -64.0
+{ -64.0
+    146.2500     89.5000 -64.0
+    143.5000     91.2500 -64.0
+    144.2500     92.5000 -64.0
+    147.7500     89.5000 -64.0
+} -64.0
+{ -64.0
+    146.2500     96.5000 -64.0
+    146.5000     96.7500 -64.0
+    148.5000     97.7500 -64.0
+    148.7500     96.5000 -64.0
+} -64.0
+{ -64.0
+    106.2500    107.5000 -64.0
+    105.5000    108.2500 -64.0
+     94.5000    114.2500 -64.0
+     92.2500    114.5000 -64.0
+     97.5000    114.7500 -64.0
+     99.2500    115.5000 -64.0
+     96.5000    118.2500 -64.0
+     88.5000    122.2500 -64.0
+     86.5000    122.2500 -64.0
+     83.5000    123.2500 -64.0
+     81.7500    120.5000 -64.0
+     82.7500    118.5000 -64.0
+     80.5000    118.2500 -64.0
+     78.5000    120.7500 -64.0
+     82.2500    123.5000 -64.0
+     82.2500    126.5000 -64.0
+     80.2500    132.5000 -64.0
+     81.2500    135.5000 -64.0
+     84.2500    137.5000 -64.0
+     90.5000    134.7500 -64.0
+     90.7500    132.5000 -64.0
+     89.5000    131.2500 -64.0
+     87.5000    130.2500 -64.0
+     85.7500    129.5000 -64.0
+     87.7500    125.5000 -64.0
+     94.5000    121.7500 -64.0
+     96.5000    121.7500 -64.0
+    102.5000    114.7500 -64.0
+    103.2500    116.5000 -64.0
+    102.2500    118.5000 -64.0
+    103.2500    121.5000 -64.0
+    106.2500    124.5000 -64.0
+    110.7500    124.5000 -64.0
+    113.7500    118.5000 -64.0
+    114.5000    116.7500 -64.0
+    117.2500    119.5000 -64.0
+    117.5000    122.7500 -64.0
+    119.5000    123.7500 -64.0
+    123.2500    126.5000 -64.0
+    123.2500    128.5000 -64.0
+    124.2500    130.5000 -64.0
+    122.5000    131.2500 -64.0
+    121.5000    133.2500 -64.0
+    121.2500    135.5000 -64.0
+    126.5000    138.7500 -64.0
+    128.5000    137.7500 -64.0
+    130.7500    137.5000 -64.0
+    132.7500    133.5000 -64.0
+    131.7500    131.5000 -64.0
+    131.7500    127.5000 -64.0
+    133.5000    123.7500 -64.0
+    136.5000    123.7500 -64.0
+    136.7500    122.5000 -64.0
+    133.7500    120.5000 -64.0
+    131.2500    125.5000 -64.0
+    129.5000    126.2500 -64.0
+    125.7500    123.5000 -64.0
+    124.7500    121.5000 -64.0
+    123.5000    121.2500 -64.0
+    115.7500    115.5000 -64.0
+    116.5000    113.7500 -64.0
+    118.5000    114.7500 -64.0
+    123.5000    115.7500 -64.0
+    127.2500    118.5000 -64.0
+    129.5000    118.7500 -64.0
+    127.5000    117.2500 -64.0
+    113.5000    110.2500 -64.0
+    109.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+     69.2500    113.5000 -64.0
+     68.5000    114.7500 -64.0
+     70.5000    115.7500 -64.0
+     70.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+     87.2500    115.5000 -64.0
+     85.5000    116.2500 -64.0
+     85.2500    117.5000 -64.0
+     90.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+     51.2500    129.5000 -64.0
+     49.2500    130.5000 -64.0
+     47.5000    134.2500 -64.0
+     47.2500    142.5000 -64.0
+     48.2500    144.5000 -64.0
+     50.5000    142.7500 -64.0
+     53.5000    137.7500 -64.0
+     53.7500    131.5000 -64.0
+     52.7500    129.5000 -64.0
+} -64.0
+{ -64.0
+     89.2500    141.5000 -64.0
+     87.5000    142.2500 -64.0
+     86.5000    145.2500 -64.0
+     86.2500    149.5000 -64.0
+     84.5000    151.2500 -64.0
+     81.7500    148.5000 -64.0
+     77.5000    148.2500 -64.0
+     76.5000    150.2500 -64.0
+     74.5000    150.2500 -64.0
+     72.5000    151.2500 -64.0
+     71.7500    150.5000 -64.0
+     68.5000    150.2500 -64.0
+     66.7500    146.5000 -64.0
+     62.5000    143.2500 -64.0
+     60.5000    144.2500 -64.0
+     60.2500    151.5000 -64.0
+     61.2500    153.5000 -64.0
+     61.2500    156.5000 -64.0
+     63.2500    160.5000 -64.0
+     64.2500    168.5000 -64.0
+     66.2500    172.5000 -64.0
+     71.2500    175.5000 -64.0
+     73.5000    174.7500 -64.0
+     80.5000    176.7500 -64.0
+     83.5000    175.7500 -64.0
+     85.5000    172.7500 -64.0
+     89.5000    170.7500 -64.0
+     89.7500    168.5000 -64.0
+     91.5000    167.7500 -64.0
+     93.2500    168.5000 -64.0
+     96.5000    167.7500 -64.0
+    101.5000    168.7500 -64.0
+    104.2500    171.5000 -64.0
+    107.5000    166.7500 -64.0
+    109.5000    165.7500 -64.0
+    112.5000    166.7500 -64.0
+    115.5000    169.7500 -64.0
+    117.5000    170.7500 -64.0
+    118.2500    172.5000 -64.0
+    121.5000    172.7500 -64.0
+    123.5000    171.7500 -64.0
+    126.2500    175.5000 -64.0
+    131.5000    175.7500 -64.0
+    137.5000    172.7500 -64.0
+    140.7500    168.5000 -64.0
+    139.7500    166.5000 -64.0
+    139.7500    163.5000 -64.0
+    136.7500    159.5000 -64.0
+    130.5000    154.2500 -64.0
+    127.5000    155.2500 -64.0
+    125.7500    154.5000 -64.0
+    126.7500    151.5000 -64.0
+    124.7500    150.5000 -64.0
+    121.5000    150.2500 -64.0
+    119.5000    152.2500 -64.0
+    108.5000    159.2500 -64.0
+    105.7500    157.5000 -64.0
+    100.5000    156.2500 -64.0
+     97.5000    153.2500 -64.0
+     95.5000    152.2500 -64.0
+     90.7500    144.5000 -64.0
+     90.7500    142.5000 -64.0
+} -64.0
+{ -64.0
+    122.7500     51.5000 -64.0
+    123.5000     50.7500 -64.0
+    124.2500     51.5000 -64.0
+    123.5000     52.2500 -64.0
+} -64.0
+{ -64.0
+    121.7500     63.5000 -64.0
+    122.5000     62.7500 -64.0
+    124.2500     63.5000 -64.0
+    123.5000     64.2500 -64.0
+} -64.0
+{ -64.0
+    107.7500    118.5000 -64.0
+    108.5000    117.7500 -64.0
+    110.5000    117.7500 -64.0
+    111.2500    119.5000 -64.0
+    109.5000    121.2500 -64.0
+    107.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+     88.7500    153.5000 -64.0
+     90.5000    152.7500 -64.0
+     93.2500    156.5000 -64.0
+     92.5000    158.2500 -64.0
+     90.5000    158.2500 -64.0
+     88.7500    156.5000 -64.0
+} -64.0
+{ -64.0
+    120.7500    156.5000 -64.0
+    121.5000    155.7500 -64.0
+    122.2500    156.5000 -64.0
+    121.5000    157.2500 -64.0
+} -64.0
+{ -64.0
+     71.7500    160.5000 -64.0
+     73.5000    159.7500 -64.0
+     75.2500    161.5000 -64.0
+     74.5000    163.2500 -64.0
+     73.7500    162.5000 -64.0
+     72.5000    163.2500 -64.0
+     71.7500    162.5000 -64.0
+} -64.0
+v 350 z -154.000000 -64.0
+{ -64.0
+    105.2500     26.5000 -64.0
+    103.5000     27.2500 -64.0
+    105.2500     28.5000 -64.0
+    107.5000     28.7500 -64.0
+    105.7500     27.5000 -64.0
+    106.5000     26.7500 -64.0
+    108.2500     27.5000 -64.0
+    114.5000     27.7500 -64.0
+    116.5000     26.7500 -64.0
+} -64.0
+{ -64.0
+    122.2500     27.5000 -64.0
+    123.2500     28.5000 -64.0
+    123.7500     27.5000 -64.0
+} -64.0
+{ -64.0
+    100.2500     28.5000 -64.0
+    100.2500     29.5000 -64.0
+    102.5000     29.7500 -64.0
+} -64.0
+{ -64.0
+     97.2500     30.5000 -64.0
+     98.2500     31.5000 -64.0
+     98.5000     33.7500 -64.0
+     98.7500     30.5000 -64.0
+} -64.0
+{ -64.0
+    126.2500     30.5000 -64.0
+    126.2500     33.5000 -64.0
+    128.5000     33.7500 -64.0
+    128.7500     32.5000 -64.0
+    127.7500     30.5000 -64.0
+} -64.0
+{ -64.0
+     96.2500     34.5000 -64.0
+     96.2500     35.5000 -64.0
+     97.5000     35.7500 -64.0
+     97.7500     34.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500     36.5000 -64.0
+     91.2500     38.5000 -64.0
+     92.5000     37.7500 -64.0
+     94.2500     38.5000 -64.0
+     94.2500     40.5000 -64.0
+     92.2500     41.5000 -64.0
+     94.5000     41.7500 -64.0
+     94.7500     38.5000 -64.0
+     93.7500     36.5000 -64.0
+} -64.0
+{ -64.0
+    130.2500     36.5000 -64.0
+    129.5000     37.2500 -64.0
+    130.2500     38.5000 -64.0
+    130.2500     41.5000 -64.0
+    131.2500     43.5000 -64.0
+    130.2500     44.5000 -64.0
+    131.2500     46.5000 -64.0
+    130.5000     48.2500 -64.0
+    126.7500     46.5000 -64.0
+    125.5000     47.2500 -64.0
+    127.2500     49.5000 -64.0
+    129.5000     48.7500 -64.0
+    132.5000     49.7500 -64.0
+    135.2500     53.5000 -64.0
+    135.2500     55.5000 -64.0
+    134.2500     58.5000 -64.0
+    135.7500     57.5000 -64.0
+    136.7500     55.5000 -64.0
+    135.7500     52.5000 -64.0
+    131.7500     47.5000 -64.0
+    133.7500     43.5000 -64.0
+    134.5000     41.7500 -64.0
+    134.5000     40.2500 -64.0
+    132.5000     41.2500 -64.0
+    130.7500     40.5000 -64.0
+    130.7500     38.5000 -64.0
+    132.5000     37.7500 -64.0
+    132.7500     36.5000 -64.0
+} -64.0
+{ -64.0
+     96.2500     39.5000 -64.0
+     96.2500     40.5000 -64.0
+     97.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+     95.2500     45.5000 -64.0
+     94.5000     46.2500 -64.0
+     94.5000     47.7500 -64.0
+     96.5000     48.7500 -64.0
+     96.7500     47.5000 -64.0
+     98.5000     45.7500 -64.0
+    100.7500     45.5000 -64.0
+} -64.0
+{ -64.0
+    126.2500     52.5000 -64.0
+    126.2500     53.5000 -64.0
+    126.7500     54.5000 -64.0
+    127.7500     52.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500     53.5000 -64.0
+    114.2500     54.5000 -64.0
+    118.5000     54.7500 -64.0
+    121.7500     53.5000 -64.0
+    119.5000     53.2500 -64.0
+    117.5000     54.2500 -64.0
+} -64.0
+{ -64.0
+     85.2500     54.5000 -64.0
+     82.5000     56.2500 -64.0
+     80.7500     55.5000 -64.0
+     76.5000     55.2500 -64.0
+     76.2500     56.5000 -64.0
+     81.2500     60.5000 -64.0
+     83.5000     56.7500 -64.0
+     86.5000     56.7500 -64.0
+     86.7500     54.5000 -64.0
+} -64.0
+{ -64.0
+     89.2500     56.5000 -64.0
+     89.2500     57.5000 -64.0
+     90.5000     56.7500 -64.0
+     91.2500     57.5000 -64.0
+     91.7500     56.5000 -64.0
+} -64.0
+{ -64.0
+    127.2500     59.5000 -64.0
+    126.5000     61.2500 -64.0
+    124.5000     61.2500 -64.0
+    124.2500     62.5000 -64.0
+    130.7500     61.5000 -64.0
+    128.5000     61.2500 -64.0
+} -64.0
+{ -64.0
+     91.2500     62.5000 -64.0
+     90.2500     63.5000 -64.0
+     95.5000     63.7500 -64.0
+} -64.0
+{ -64.0
+     83.2500     64.5000 -64.0
+     81.5000     65.7500 -64.0
+     83.5000     66.7500 -64.0
+     84.5000     64.7500 -64.0
+     87.5000     65.7500 -64.0
+     86.7500     64.5000 -64.0
+} -64.0
+{ -64.0
+     88.2500     66.5000 -64.0
+     89.2500     68.5000 -64.0
+     88.5000     70.2500 -64.0
+     86.7500     69.5000 -64.0
+     85.5000     71.2500 -64.0
+     83.5000     71.2500 -64.0
+     84.2500     72.5000 -64.0
+     87.5000     72.7500 -64.0
+     90.7500     67.5000 -64.0
+} -64.0
+{ -64.0
+     65.2500     82.5000 -64.0
+     59.5000     92.2500 -64.0
+     55.5000    102.2500 -64.0
+     55.5000    107.7500 -64.0
+     57.5000    108.7500 -64.0
+     62.5000    100.7500 -64.0
+     61.7500     99.5000 -64.0
+     58.5000    105.2500 -64.0
+     57.7500    104.5000 -64.0
+     57.7500    101.5000 -64.0
+     61.5000     93.7500 -64.0
+     61.7500     91.5000 -64.0
+     65.7500     85.5000 -64.0
+     67.5000     84.7500 -64.0
+     70.2500     87.5000 -64.0
+     70.2500     89.5000 -64.0
+     66.5000     93.2500 -64.0
+     63.5000     93.2500 -64.0
+     63.2500     94.5000 -64.0
+     64.5000     94.7500 -64.0
+     65.2500     96.5000 -64.0
+     70.5000     92.7500 -64.0
+     73.5000     87.7500 -64.0
+     71.7500     85.5000 -64.0
+     69.5000     85.2500 -64.0
+     67.7500     82.5000 -64.0
+} -64.0
+{ -64.0
+    150.2500     85.5000 -64.0
+    147.2500     87.5000 -64.0
+    142.5000     89.2500 -64.0
+    142.2500     91.5000 -64.0
+    143.2500     94.5000 -64.0
+    149.2500    100.5000 -64.0
+    152.2500    106.5000 -64.0
+    153.2500    111.5000 -64.0
+    154.5000    111.7500 -64.0
+    156.5000    110.7500 -64.0
+    156.7500    103.5000 -64.0
+    155.7500    101.5000 -64.0
+    155.7500     99.5000 -64.0
+    153.7500     95.5000 -64.0
+    153.7500     92.5000 -64.0
+    151.7500     86.5000 -64.0
+} -64.0
+{ -64.0
+    107.2500    107.5000 -64.0
+    106.5000    108.2500 -64.0
+    100.5000    111.2500 -64.0
+     98.5000    111.2500 -64.0
+     92.5000    114.2500 -64.0
+     90.5000    114.2500 -64.0
+     86.5000    116.2500 -64.0
+     84.5000    116.2500 -64.0
+     84.2500    117.5000 -64.0
+     85.5000    116.7500 -64.0
+     87.5000    116.7500 -64.0
+     91.5000    114.7500 -64.0
+     96.5000    114.7500 -64.0
+     98.2500    115.5000 -64.0
+     97.2500    118.5000 -64.0
+     94.5000    121.2500 -64.0
+     92.5000    121.2500 -64.0
+     90.5000    122.2500 -64.0
+     90.5000    123.7500 -64.0
+     92.5000    122.7500 -64.0
+     96.5000    122.7500 -64.0
+     98.5000    121.7500 -64.0
+     98.7500    118.5000 -64.0
+     99.7500    115.5000 -64.0
+    102.5000    113.7500 -64.0
+    103.2500    114.5000 -64.0
+    103.2500    116.5000 -64.0
+    102.2500    119.5000 -64.0
+    103.2500    121.5000 -64.0
+    104.5000    123.7500 -64.0
+    108.5000    125.7500 -64.0
+    112.5000    122.7500 -64.0
+    112.7500    120.5000 -64.0
+    113.5000    118.7500 -64.0
+    112.7500    117.5000 -64.0
+    112.7500    115.5000 -64.0
+    114.5000    114.7500 -64.0
+    116.2500    116.5000 -64.0
+    116.2500    120.5000 -64.0
+    117.2500    123.5000 -64.0
+    119.2500    124.5000 -64.0
+    120.5000    123.7500 -64.0
+    122.5000    122.7500 -64.0
+    123.2500    124.5000 -64.0
+    121.5000    126.2500 -64.0
+    121.2500    133.5000 -64.0
+    123.2500    137.5000 -64.0
+    129.5000    137.7500 -64.0
+    132.5000    134.7500 -64.0
+    132.7500    131.5000 -64.0
+    130.7500    127.5000 -64.0
+    132.7500    123.5000 -64.0
+    131.5000    123.2500 -64.0
+    131.2500    124.5000 -64.0
+    129.5000    126.2500 -64.0
+    128.5000    125.2500 -64.0
+    128.2500    127.5000 -64.0
+    129.2500    129.5000 -64.0
+    129.2500    133.5000 -64.0
+    127.5000    134.2500 -64.0
+    125.7500    133.5000 -64.0
+    125.7500    131.5000 -64.0
+    127.5000    129.2500 -64.0
+    125.5000    128.2500 -64.0
+    124.7500    126.5000 -64.0
+    125.7500    123.5000 -64.0
+    123.7500    121.5000 -64.0
+    121.5000    121.2500 -64.0
+    117.7500    118.5000 -64.0
+    117.7500    115.5000 -64.0
+    119.5000    114.7500 -64.0
+    124.5000    115.7500 -64.0
+    121.7500    113.5000 -64.0
+    119.5000    113.2500 -64.0
+    116.5000    112.2500 -64.0
+    111.5000    110.2500 -64.0
+    108.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+     70.2500    112.5000 -64.0
+     70.2500    114.5000 -64.0
+     71.5000    114.7500 -64.0
+     71.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+    125.2500    116.5000 -64.0
+    125.5000    116.7500 -64.0
+    127.5000    117.7500 -64.0
+    130.2500    120.5000 -64.0
+    133.5000    120.7500 -64.0
+    134.5000    120.2500 -64.0
+    132.5000    119.2500 -64.0
+    126.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+     77.2500    119.5000 -64.0
+     75.2500    122.5000 -64.0
+     76.5000    121.7500 -64.0
+     81.5000    121.7500 -64.0
+     80.5000    121.2500 -64.0
+     79.7500    119.5000 -64.0
+} -64.0
+{ -64.0
+    136.2500    122.5000 -64.0
+    136.2500    123.5000 -64.0
+    138.2500    124.5000 -64.0
+    139.7500    124.5000 -64.0
+    138.7500    122.5000 -64.0
+} -64.0
+{ -64.0
+     84.2500    123.5000 -64.0
+     80.5000    130.2500 -64.0
+     80.2500    132.5000 -64.0
+     82.2500    136.5000 -64.0
+     87.5000    136.7500 -64.0
+     90.5000    131.7500 -64.0
+     88.7500    129.5000 -64.0
+     88.7500    125.5000 -64.0
+     86.5000    125.2500 -64.0
+} -64.0
+{ -64.0
+    139.2500    131.5000 -64.0
+    138.5000    132.2500 -64.0
+    139.5000    132.7500 -64.0
+    140.7500    131.5000 -64.0
+} -64.0
+{ -64.0
+     50.2500    134.5000 -64.0
+     49.5000    136.2500 -64.0
+     49.2500    140.5000 -64.0
+     50.5000    140.7500 -64.0
+     52.5000    138.7500 -64.0
+     52.7500    136.5000 -64.0
+     51.7500    134.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500    148.5000 -64.0
+     89.5000    150.2500 -64.0
+     87.5000    150.2500 -64.0
+     87.2500    152.5000 -64.0
+     84.5000    154.2500 -64.0
+     86.2500    158.5000 -64.0
+     87.5000    157.7500 -64.0
+     88.2500    158.5000 -64.0
+     88.2500    160.5000 -64.0
+     93.2500    161.5000 -64.0
+     95.5000    160.7500 -64.0
+     98.7500    156.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500    153.5000 -64.0
+    115.2500    156.5000 -64.0
+    114.2500    158.5000 -64.0
+    117.5000    159.7500 -64.0
+    119.5000    158.7500 -64.0
+    121.5000    158.7500 -64.0
+    123.7500    155.5000 -64.0
+    122.7500    153.5000 -64.0
+} -64.0
+{ -64.0
+     65.2500    157.5000 -64.0
+     65.2500    158.5000 -64.0
+     66.2500    160.5000 -64.0
+     66.2500    163.5000 -64.0
+     67.7500    161.5000 -64.0
+     66.7500    158.5000 -64.0
+} -64.0
+{ -64.0
+     71.2500    160.5000 -64.0
+     71.2500    166.5000 -64.0
+     74.5000    166.7500 -64.0
+     76.7500    163.5000 -64.0
+     73.7500    160.5000 -64.0
+} -64.0
+{ -64.0
+    104.2500    161.5000 -64.0
+    103.2500    162.5000 -64.0
+    104.2500    165.5000 -64.0
+    105.5000    164.7500 -64.0
+    105.7500    161.5000 -64.0
+} -64.0
+{ -64.0
+    148.5000     87.7500 -64.0
+    149.2500     88.5000 -64.0
+    151.2500     92.5000 -64.0
+    151.2500     94.5000 -64.0
+    154.2500    100.5000 -64.0
+    154.2500    104.5000 -64.0
+    153.5000    106.2500 -64.0
+    150.7500    101.5000 -64.0
+    150.7500     99.5000 -64.0
+    148.7500     98.5000 -64.0
+    148.7500     96.5000 -64.0
+    145.7500     93.5000 -64.0
+    144.7500     91.5000 -64.0
+} -64.0
+{ -64.0
+    108.7500    116.5000 -64.0
+    109.5000    115.7500 -64.0
+    111.2500    117.5000 -64.0
+    110.5000    119.2500 -64.0
+    109.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+    104.7500    117.5000 -64.0
+    105.5000    116.7500 -64.0
+    107.2500    117.5000 -64.0
+    106.5000    119.2500 -64.0
+    108.2500    121.5000 -64.0
+    107.5000    122.2500 -64.0
+    104.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+     82.7500    131.5000 -64.0
+     84.5000    130.7500 -64.0
+     85.2500    132.5000 -64.0
+     83.5000    133.2500 -64.0
+} -64.0
+v 204 z -156.000000 -64.0
+{ -64.0
+     89.2500     58.5000 -64.0
+     88.5000     59.2500 -64.0
+     88.5000     60.7500 -64.0
+     90.5000     61.7500 -64.0
+     90.7500     58.5000 -64.0
+} -64.0
+{ -64.0
+    135.2500     65.5000 -64.0
+    134.2500     67.5000 -64.0
+    135.5000     67.7500 -64.0
+} -64.0
+{ -64.0
+     80.2500     72.5000 -64.0
+     77.5000     74.2500 -64.0
+     77.2500     76.5000 -64.0
+     80.5000     76.7500 -64.0
+     82.5000     75.7500 -64.0
+     82.7500     73.5000 -64.0
+} -64.0
+{ -64.0
+    136.2500     73.5000 -64.0
+    135.5000     74.2500 -64.0
+    136.5000     74.7500 -64.0
+    139.7500     75.5000 -64.0
+    138.7500     73.5000 -64.0
+} -64.0
+{ -64.0
+    132.2500     75.5000 -64.0
+    131.5000     76.2500 -64.0
+    131.2500     78.5000 -64.0
+    133.7500     80.5000 -64.0
+    132.7500     77.5000 -64.0
+    134.7500     75.5000 -64.0
+} -64.0
+{ -64.0
+    140.2500     76.5000 -64.0
+    140.2500     77.5000 -64.0
+    139.2500     80.5000 -64.0
+    140.5000     79.7500 -64.0
+    140.7500     77.5000 -64.0
+} -64.0
+{ -64.0
+     66.2500     81.5000 -64.0
+     58.5000     94.2500 -64.0
+     55.2500    106.5000 -64.0
+     57.2500    108.5000 -64.0
+     58.5000    107.7500 -64.0
+     63.5000     98.7500 -64.0
+     62.5000     97.2500 -64.0
+     62.2500     99.5000 -64.0
+     59.5000    103.2500 -64.0
+     58.7500    102.5000 -64.0
+     58.7500     99.5000 -64.0
+     60.5000     95.7500 -64.0
+     60.7500     93.5000 -64.0
+     66.5000     84.7500 -64.0
+     68.5000     84.7500 -64.0
+     72.2500     87.5000 -64.0
+     66.5000     93.2500 -64.0
+     64.2500     92.5000 -64.0
+     65.2500     95.5000 -64.0
+     66.5000     95.7500 -64.0
+     73.7500     89.5000 -64.0
+     74.7500     87.5000 -64.0
+     73.7500     85.5000 -64.0
+     71.5000     85.2500 -64.0
+     67.7500     81.5000 -64.0
+} -64.0
+{ -64.0
+    148.2500     85.5000 -64.0
+    145.5000     87.2500 -64.0
+    143.5000     87.2500 -64.0
+    141.5000     88.2500 -64.0
+    141.2500     91.5000 -64.0
+    145.2500     95.5000 -64.0
+    152.2500    106.5000 -64.0
+    153.2500    111.5000 -64.0
+    154.5000    111.7500 -64.0
+    156.5000    110.7500 -64.0
+    156.7500    103.5000 -64.0
+    154.7500     99.5000 -64.0
+    154.7500     97.5000 -64.0
+    153.7500     95.5000 -64.0
+    153.7500     91.5000 -64.0
+    150.7500     85.5000 -64.0
+} -64.0
+{ -64.0
+     72.2500    110.5000 -64.0
+     71.2500    112.5000 -64.0
+     72.5000    112.7500 -64.0
+} -64.0
+{ -64.0
+    105.2500    110.5000 -64.0
+    103.5000    114.2500 -64.0
+    103.2500    122.5000 -64.0
+    105.2500    124.5000 -64.0
+    110.5000    124.7500 -64.0
+    113.5000    119.7500 -64.0
+    112.7500    116.5000 -64.0
+    109.7500    110.5000 -64.0
+} -64.0
+{ -64.0
+     95.2500    112.5000 -64.0
+     94.5000    113.2500 -64.0
+     91.5000    113.2500 -64.0
+     83.5000    117.2500 -64.0
+     81.5000    117.2500 -64.0
+     77.5000    119.2500 -64.0
+     75.5000    119.2500 -64.0
+     76.2500    120.5000 -64.0
+     76.5000    122.7500 -64.0
+     79.5000    118.7500 -64.0
+     83.5000    118.7500 -64.0
+     91.5000    114.7500 -64.0
+     96.5000    114.7500 -64.0
+     98.2500    115.5000 -64.0
+     95.2500    120.5000 -64.0
+     90.2500    122.5000 -64.0
+     89.2500    127.5000 -64.0
+     87.5000    128.2500 -64.0
+     88.2500    130.5000 -64.0
+     87.5000    132.2500 -64.0
+     85.5000    133.2500 -64.0
+     83.7500    132.5000 -64.0
+     83.7500    130.5000 -64.0
+     84.7500    127.5000 -64.0
+     86.5000    126.7500 -64.0
+     86.7500    125.5000 -64.0
+     84.5000    122.2500 -64.0
+     84.2500    124.5000 -64.0
+     83.2500    127.5000 -64.0
+     80.5000    130.2500 -64.0
+     80.2500    133.5000 -64.0
+     83.2500    136.5000 -64.0
+     88.5000    136.7500 -64.0
+     93.5000    128.7500 -64.0
+     93.7500    126.5000 -64.0
+     94.5000    124.7500 -64.0
+     98.5000    121.7500 -64.0
+     98.7500    116.5000 -64.0
+    101.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+    115.2500    113.5000 -64.0
+    117.2500    117.5000 -64.0
+    116.5000    118.2500 -64.0
+    116.2500    120.5000 -64.0
+    121.2500    130.5000 -64.0
+    121.2500    137.5000 -64.0
+    122.2500    139.5000 -64.0
+    125.5000    139.7500 -64.0
+    130.5000    137.7500 -64.0
+    134.5000    134.7500 -64.0
+    136.5000    134.7500 -64.0
+    140.5000    130.2500 -64.0
+    138.5000    131.2500 -64.0
+    133.5000    131.2500 -64.0
+    130.7500    127.5000 -64.0
+    131.7500    126.5000 -64.0
+    132.7500    121.5000 -64.0
+    127.7500    116.5000 -64.0
+    122.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+     82.2500    120.5000 -64.0
+     83.2500    121.5000 -64.0
+     83.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+    134.2500    121.5000 -64.0
+    137.2500    123.5000 -64.0
+    138.5000    122.7500 -64.0
+    141.5000    122.7500 -64.0
+    139.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+     74.2500    128.5000 -64.0
+     75.2500    130.5000 -64.0
+     77.5000    130.7500 -64.0
+     75.7500    128.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500    146.5000 -64.0
+    107.5000    149.2500 -64.0
+    103.5000    149.2500 -64.0
+     99.7500    147.5000 -64.0
+     97.5000    147.2500 -64.0
+     97.2500    148.5000 -64.0
+     98.5000    149.7500 -64.0
+    106.5000    153.7500 -64.0
+    112.5000    150.7500 -64.0
+    114.7500    150.5000 -64.0
+    115.7500    148.5000 -64.0
+    114.7500    146.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500    154.5000 -64.0
+     92.2500    156.5000 -64.0
+     93.5000    156.7500 -64.0
+     93.7500    155.5000 -64.0
+} -64.0
+{ -64.0
+    146.7500     88.5000 -64.0
+    148.5000     87.7500 -64.0
+    150.2500     89.5000 -64.0
+    150.2500     91.5000 -64.0
+    153.2500     97.5000 -64.0
+    154.2500    102.5000 -64.0
+    153.5000    104.2500 -64.0
+    143.7500     90.5000 -64.0
+} -64.0
+{ -64.0
+    108.7500    115.5000 -64.0
+    109.5000    114.7500 -64.0
+    110.2500    115.5000 -64.0
+    111.2500    117.5000 -64.0
+    110.5000    119.2500 -64.0
+    108.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+    118.7500    115.5000 -64.0
+    119.5000    114.7500 -64.0
+    121.5000    114.7500 -64.0
+    127.5000    117.7500 -64.0
+    130.2500    121.5000 -64.0
+    130.2500    125.5000 -64.0
+    129.5000    127.2500 -64.0
+    130.2500    128.5000 -64.0
+    128.5000    132.2500 -64.0
+    126.5000    133.2500 -64.0
+    123.7500    130.5000 -64.0
+    121.7500    126.5000 -64.0
+    121.7500    123.5000 -64.0
+    120.5000    123.2500 -64.0
+    119.7500    121.5000 -64.0
+    117.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+    104.7500    116.5000 -64.0
+    105.5000    115.7500 -64.0
+    107.2500    116.5000 -64.0
+    107.2500    119.5000 -64.0
+    106.5000    121.2500 -64.0
+    104.7500    119.5000 -64.0
+} -64.0
+v 273 z -158.000000 -64.0
+{ -64.0
+    128.2500     61.5000 -64.0
+    128.2500     62.5000 -64.0
+    127.2500     64.5000 -64.0
+    128.2500     66.5000 -64.0
+    128.2500     68.5000 -64.0
+    127.5000     70.2500 -64.0
+    122.5000     70.2500 -64.0
+    120.5000     71.2500 -64.0
+    113.5000     71.2500 -64.0
+    110.2500     72.5000 -64.0
+    121.5000     72.7500 -64.0
+    123.5000     71.7500 -64.0
+    129.5000     71.7500 -64.0
+    128.7500     70.5000 -64.0
+    128.7500     66.5000 -64.0
+    129.5000     64.7500 -64.0
+    131.5000     63.7500 -64.0
+} -64.0
+{ -64.0
+    136.2500     62.5000 -64.0
+    135.5000     63.2500 -64.0
+    136.5000     63.7500 -64.0
+    137.2500     65.5000 -64.0
+    138.7500     62.5000 -64.0
+} -64.0
+{ -64.0
+     81.2500     63.5000 -64.0
+     80.5000     65.2500 -64.0
+     75.5000     64.2500 -64.0
+     74.5000     67.2500 -64.0
+     76.2500     71.5000 -64.0
+     78.5000     68.7500 -64.0
+     81.5000     68.7500 -64.0
+     83.2500     70.5000 -64.0
+     83.5000     73.7500 -64.0
+     83.7500     69.5000 -64.0
+     81.7500     67.5000 -64.0
+} -64.0
+{ -64.0
+    150.2500     68.5000 -64.0
+    149.5000     69.2500 -64.0
+    147.5000     69.2500 -64.0
+    141.5000     72.2500 -64.0
+    139.7500     71.5000 -64.0
+    137.5000     72.2500 -64.0
+    138.2500     73.5000 -64.0
+    139.5000     72.7500 -64.0
+    142.5000     72.7500 -64.0
+    144.2500     73.5000 -64.0
+    142.2500     74.5000 -64.0
+    143.2500     76.5000 -64.0
+    143.2500     78.5000 -64.0
+    145.7500     78.5000 -64.0
+    146.7500     76.5000 -64.0
+    144.7500     75.5000 -64.0
+    146.5000     73.7500 -64.0
+    148.5000     73.7500 -64.0
+    149.5000     71.7500 -64.0
+    153.5000     69.7500 -64.0
+    155.5000     69.7500 -64.0
+    154.7500     68.5000 -64.0
+} -64.0
+{ -64.0
+    130.2500     72.5000 -64.0
+    131.2500     73.5000 -64.0
+    127.5000     75.2500 -64.0
+    127.2500     76.5000 -64.0
+    129.2500     77.5000 -64.0
+    127.5000     79.2500 -64.0
+    121.5000     79.2500 -64.0
+    119.7500     78.5000 -64.0
+    101.5000     78.2500 -64.0
+     99.7500     77.5000 -64.0
+     88.5000     77.2500 -64.0
+     84.7500     75.5000 -64.0
+     81.5000     78.2500 -64.0
+     78.2500     78.5000 -64.0
+     79.2500     81.5000 -64.0
+     82.5000     81.7500 -64.0
+     85.5000     78.7500 -64.0
+     89.5000     78.7500 -64.0
+     91.5000     79.7500 -64.0
+     93.5000     78.7500 -64.0
+    109.5000     78.7500 -64.0
+    111.2500     79.5000 -64.0
+    128.5000     80.7500 -64.0
+    130.5000     78.7500 -64.0
+    131.7500     72.5000 -64.0
+} -64.0
+{ -64.0
+    131.2500     79.5000 -64.0
+    131.2500     80.5000 -64.0
+    132.5000     80.7500 -64.0
+} -64.0
+{ -64.0
+     67.2500     80.5000 -64.0
+     65.5000     81.2500 -64.0
+     65.2500     82.5000 -64.0
+     58.2500     95.5000 -64.0
+     57.2500    100.5000 -64.0
+     55.2500    104.5000 -64.0
+     56.2500    107.5000 -64.0
+     58.7500    107.5000 -64.0
+     64.7500     96.5000 -64.0
+     63.5000     96.2500 -64.0
+     63.2500     97.5000 -64.0
+     59.5000    102.2500 -64.0
+     58.7500    101.5000 -64.0
+     59.7500     97.5000 -64.0
+     64.7500     87.5000 -64.0
+     68.5000     83.7500 -64.0
+     73.2500     85.5000 -64.0
+     73.2500     87.5000 -64.0
+     65.2500     93.5000 -64.0
+     66.2500     95.5000 -64.0
+     74.5000     89.7500 -64.0
+     76.5000     86.7500 -64.0
+     75.5000     85.2500 -64.0
+} -64.0
+{ -64.0
+    148.2500     80.5000 -64.0
+    151.2500     82.5000 -64.0
+    157.7500     82.5000 -64.0
+} -64.0
+{ -64.0
+    149.2500     83.5000 -64.0
+    147.2500     86.5000 -64.0
+    148.5000     86.7500 -64.0
+    151.2500     91.5000 -64.0
+    151.2500     93.5000 -64.0
+    153.2500     97.5000 -64.0
+    153.2500     99.5000 -64.0
+    154.2500    101.5000 -64.0
+    153.5000    103.2500 -64.0
+    151.7500    102.5000 -64.0
+    150.7500    100.5000 -64.0
+    149.5000    101.2500 -64.0
+    152.2500    106.5000 -64.0
+    153.2500    111.5000 -64.0
+    154.5000    111.7500 -64.0
+    156.5000    110.7500 -64.0
+    156.7500    105.5000 -64.0
+    154.7500    101.5000 -64.0
+    154.7500     99.5000 -64.0
+    153.7500     97.5000 -64.0
+    153.7500     92.5000 -64.0
+    151.7500     88.5000 -64.0
+    151.7500     85.5000 -64.0
+} -64.0
+{ -64.0
+    139.2500     88.5000 -64.0
+    139.2500     91.5000 -64.0
+    142.5000     92.7500 -64.0
+    148.7500     98.5000 -64.0
+    147.7500     95.5000 -64.0
+    140.7500     88.5000 -64.0
+} -64.0
+{ -64.0
+     73.2500    109.5000 -64.0
+     72.2500    111.5000 -64.0
+     73.7500    110.5000 -64.0
+} -64.0
+{ -64.0
+     93.2500    112.5000 -64.0
+     88.5000    114.2500 -64.0
+     84.5000    118.2500 -64.0
+     84.2500    120.5000 -64.0
+     85.2500    122.5000 -64.0
+     85.2500    125.5000 -64.0
+     82.5000    128.2500 -64.0
+     80.5000    129.2500 -64.0
+     73.7500    126.5000 -64.0
+     72.2500    126.5000 -64.0
+     76.2500    129.5000 -64.0
+     80.2500    136.5000 -64.0
+     85.2500    138.5000 -64.0
+     89.5000    138.7500 -64.0
+     91.5000    136.7500 -64.0
+     91.7500    132.5000 -64.0
+     94.5000    128.7500 -64.0
+     94.7500    126.5000 -64.0
+     98.5000    120.7500 -64.0
+     99.7500    114.5000 -64.0
+     97.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+    106.2500    112.5000 -64.0
+    104.5000    113.2500 -64.0
+    103.2500    116.5000 -64.0
+    102.2500    121.5000 -64.0
+    107.2500    124.5000 -64.0
+    108.5000    123.7500 -64.0
+    111.5000    123.7500 -64.0
+    113.5000    121.7500 -64.0
+    113.7500    119.5000 -64.0
+    111.7500    114.5000 -64.0
+    108.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+    118.2500    113.5000 -64.0
+    117.5000    114.2500 -64.0
+    117.2500    118.5000 -64.0
+    116.5000    120.2500 -64.0
+    118.2500    123.5000 -64.0
+    118.2500    125.5000 -64.0
+    122.2500    133.5000 -64.0
+    121.2500    136.5000 -64.0
+    118.2500    140.5000 -64.0
+    117.2500    142.5000 -64.0
+    112.5000    145.2500 -64.0
+    108.5000    147.2500 -64.0
+    105.5000    147.2500 -64.0
+     96.5000    144.2500 -64.0
+     93.5000    145.2500 -64.0
+     93.2500    146.5000 -64.0
+     94.2500    148.5000 -64.0
+    100.2500    152.5000 -64.0
+    102.5000    152.7500 -64.0
+    104.2500    154.5000 -64.0
+    106.5000    154.7500 -64.0
+    112.5000    151.7500 -64.0
+    118.7500    149.5000 -64.0
+    119.7500    147.5000 -64.0
+    118.7500    144.5000 -64.0
+    119.5000    142.7500 -64.0
+    121.5000    141.7500 -64.0
+    123.5000    142.7500 -64.0
+    125.5000    141.7500 -64.0
+    127.5000    141.7500 -64.0
+    131.5000    139.7500 -64.0
+    132.7500    135.5000 -64.0
+    139.5000    130.7500 -64.0
+    141.5000    129.7500 -64.0
+    138.5000    128.2500 -64.0
+    134.5000    131.2500 -64.0
+    131.7500    129.5000 -64.0
+    131.7500    127.5000 -64.0
+    130.5000    126.2500 -64.0
+    130.2500    129.5000 -64.0
+    128.5000    131.2500 -64.0
+    124.5000    131.2500 -64.0
+    121.7500    128.5000 -64.0
+    118.7500    122.5000 -64.0
+    118.7500    119.5000 -64.0
+    120.5000    115.7500 -64.0
+    125.5000    115.7500 -64.0
+    128.2500    118.5000 -64.0
+    130.5000    122.7500 -64.0
+    130.7500    120.5000 -64.0
+    129.7500    118.5000 -64.0
+    123.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+     74.2500    118.5000 -64.0
+     75.5000    118.7500 -64.0
+     77.2500    120.5000 -64.0
+     79.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+     91.7500    115.5000 -64.0
+     92.5000    114.7500 -64.0
+     95.5000    114.7500 -64.0
+     97.2500    116.5000 -64.0
+     93.5000    124.2500 -64.0
+     93.2500    126.5000 -64.0
+     90.5000    129.2500 -64.0
+     87.5000    129.2500 -64.0
+     85.7500    127.5000 -64.0
+     85.7500    119.5000 -64.0
+     88.5000    115.7500 -64.0
+} -64.0
+{ -64.0
+    104.7500    115.5000 -64.0
+    105.5000    114.7500 -64.0
+    107.2500    115.5000 -64.0
+    107.2500    117.5000 -64.0
+    108.7500    117.5000 -64.0
+    107.7500    115.5000 -64.0
+    108.5000    114.7500 -64.0
+    111.2500    116.5000 -64.0
+    111.2500    120.5000 -64.0
+    109.5000    122.2500 -64.0
+    108.7500    121.5000 -64.0
+    106.5000    122.2500 -64.0
+    103.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+    125.7500    136.5000 -64.0
+    127.5000    135.7500 -64.0
+    129.2500    136.5000 -64.0
+    127.5000    137.2500 -64.0
+} -64.0
+{ -64.0
+    113.7500    147.5000 -64.0
+    114.5000    146.7500 -64.0
+    115.2500    148.5000 -64.0
+    113.5000    150.2500 -64.0
+    111.5000    150.2500 -64.0
+    109.7500    149.5000 -64.0
+} -64.0
+{ -64.0
+     97.7500    148.5000 -64.0
+     99.5000    147.7500 -64.0
+    103.2500    150.5000 -64.0
+    102.5000    151.2500 -64.0
+    101.7500    150.5000 -64.0
+     99.5000    150.2500 -64.0
+} -64.0
+{ -64.0
+    104.7500    151.5000 -64.0
+    105.5000    150.7500 -64.0
+    106.2500    151.5000 -64.0
+    105.5000    152.2500 -64.0
+} -64.0
+v 370 z -160.000000 -64.0
+{ -64.0
+    105.2500     33.5000 -64.0
+    103.2500     34.5000 -64.0
+    106.5000     34.7500 -64.0
+    108.5000     33.7500 -64.0
+    110.5000     34.7500 -64.0
+    112.5000     33.7500 -64.0
+    117.5000     34.7500 -64.0
+    119.2500     36.5000 -64.0
+    120.5000     35.7500 -64.0
+    122.7500     39.5000 -64.0
+    123.7500     37.5000 -64.0
+    122.7500     35.5000 -64.0
+    120.5000     35.2500 -64.0
+    118.7500     33.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500     38.5000 -64.0
+     87.5000     42.2500 -64.0
+     87.2500     45.5000 -64.0
+     89.2500     47.5000 -64.0
+     92.5000     43.7500 -64.0
+     93.7500     44.5000 -64.0
+     94.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+     97.2500     43.5000 -64.0
+     96.5000     44.2500 -64.0
+     94.5000     45.2500 -64.0
+     97.2500     47.5000 -64.0
+     96.2500     50.5000 -64.0
+     98.5000     48.7500 -64.0
+    100.5000     48.7500 -64.0
+    100.7500     47.5000 -64.0
+} -64.0
+{ -64.0
+     80.2500     47.5000 -64.0
+     78.5000     48.2500 -64.0
+     81.2500     50.5000 -64.0
+     81.2500     54.5000 -64.0
+     79.5000     58.2500 -64.0
+     78.5000     57.2500 -64.0
+     78.2500     62.5000 -64.0
+     75.5000     65.2500 -64.0
+     77.5000     68.7500 -64.0
+     79.5000     65.7500 -64.0
+     79.7500     63.5000 -64.0
+     82.5000     59.7500 -64.0
+     83.2500     60.5000 -64.0
+     83.5000     65.7500 -64.0
+     83.7500     62.5000 -64.0
+     85.7500     58.5000 -64.0
+     86.7500     53.5000 -64.0
+     88.5000     51.7500 -64.0
+     88.7500     49.5000 -64.0
+     83.7500     47.5000 -64.0
+} -64.0
+{ -64.0
+    143.2500     51.5000 -64.0
+    140.2500     54.5000 -64.0
+    139.2500     56.5000 -64.0
+    135.5000     59.2500 -64.0
+    135.2500     61.5000 -64.0
+    136.5000     61.7500 -64.0
+    138.5000     60.7500 -64.0
+    140.2500     61.5000 -64.0
+    140.2500     64.5000 -64.0
+    141.7500     62.5000 -64.0
+    140.7500     60.5000 -64.0
+    141.5000     59.2500 -64.0
+    139.5000     60.2500 -64.0
+    138.7500     58.5000 -64.0
+    141.5000     56.7500 -64.0
+    142.2500     58.5000 -64.0
+    148.7500     57.5000 -64.0
+    149.7500     55.5000 -64.0
+    147.7500     54.5000 -64.0
+    145.5000     55.2500 -64.0
+    143.7500     54.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500     52.5000 -64.0
+     93.5000     52.7500 -64.0
+    103.2500     59.5000 -64.0
+    103.2500     61.5000 -64.0
+     97.5000     64.2500 -64.0
+     95.5000     64.2500 -64.0
+     92.2500     66.5000 -64.0
+     91.2500     68.5000 -64.0
+     98.5000     68.7500 -64.0
+    105.5000     66.7500 -64.0
+    114.5000     65.7500 -64.0
+    122.5000     62.7500 -64.0
+    120.7500     61.5000 -64.0
+    111.5000     61.2500 -64.0
+     94.7500     52.5000 -64.0
+} -64.0
+{ -64.0
+    126.2500     61.5000 -64.0
+    127.2500     62.5000 -64.0
+    127.7500     61.5000 -64.0
+} -64.0
+{ -64.0
+     55.2500     62.5000 -64.0
+     56.2500     64.5000 -64.0
+     60.2500     65.5000 -64.0
+     66.5000     65.7500 -64.0
+     65.7500     64.5000 -64.0
+     59.5000     63.2500 -64.0
+} -64.0
+{ -64.0
+    152.2500     67.5000 -64.0
+    151.5000     68.2500 -64.0
+    148.2500     68.5000 -64.0
+    150.5000     68.7500 -64.0
+    152.2500     69.5000 -64.0
+    149.5000     72.2500 -64.0
+    145.5000     75.2500 -64.0
+    143.5000     76.2500 -64.0
+    144.5000     77.7500 -64.0
+    146.5000     76.7500 -64.0
+    148.5000     76.7500 -64.0
+    150.5000     77.7500 -64.0
+    152.5000     76.7500 -64.0
+    155.5000     76.7500 -64.0
+    154.7500     74.5000 -64.0
+    159.5000     70.7500 -64.0
+    159.7500     68.5000 -64.0
+    157.7500     67.5000 -64.0
+} -64.0
+{ -64.0
+    117.2500     68.5000 -64.0
+    111.5000     71.2500 -64.0
+    112.2500     72.5000 -64.0
+    125.7500     72.5000 -64.0
+    120.7500     71.5000 -64.0
+    123.5000     69.7500 -64.0
+    127.5000     69.7500 -64.0
+    127.7500     68.5000 -64.0
+    126.5000     69.2500 -64.0
+    125.7500     68.5000 -64.0
+} -64.0
+{ -64.0
+     68.2500     72.5000 -64.0
+     68.5000     73.7500 -64.0
+     72.7500     72.5000 -64.0
+} -64.0
+{ -64.0
+     86.2500     72.5000 -64.0
+     86.2500     73.5000 -64.0
+     87.7500     72.5000 -64.0
+} -64.0
+{ -64.0
+    127.2500     72.5000 -64.0
+    128.2500     73.5000 -64.0
+    126.5000     75.2500 -64.0
+    128.2500     77.5000 -64.0
+    124.5000     79.2500 -64.0
+    122.7500     78.5000 -64.0
+    104.5000     78.2500 -64.0
+    102.7500     77.5000 -64.0
+     85.5000     76.2500 -64.0
+     84.7500     74.5000 -64.0
+     82.5000     75.2500 -64.0
+     84.2500     76.5000 -64.0
+     88.2500     77.5000 -64.0
+     82.5000     80.2500 -64.0
+     81.7500     79.5000 -64.0
+     79.5000     79.2500 -64.0
+     81.2500     80.5000 -64.0
+     81.2500     83.5000 -64.0
+     84.5000     81.7500 -64.0
+     88.5000     82.7500 -64.0
+     88.7500     80.5000 -64.0
+     90.5000     79.7500 -64.0
+     95.5000     80.7500 -64.0
+     97.5000     82.7500 -64.0
+     99.5000     81.7500 -64.0
+    103.2500     82.5000 -64.0
+    101.5000     83.2500 -64.0
+    104.2500     84.5000 -64.0
+    105.5000     83.7500 -64.0
+    104.7500     82.5000 -64.0
+    105.5000     81.7500 -64.0
+    107.2500     82.5000 -64.0
+    117.5000     83.7500 -64.0
+    121.5000     81.7500 -64.0
+    124.2500     83.5000 -64.0
+    123.2500     87.5000 -64.0
+    125.2500     88.5000 -64.0
+    124.2500     91.5000 -64.0
+    125.5000     91.7500 -64.0
+    126.2500     93.5000 -64.0
+    124.2500     95.5000 -64.0
+    125.7500     95.5000 -64.0
+    128.7500     88.5000 -64.0
+    132.5000     84.7500 -64.0
+    136.7500     82.5000 -64.0
+    133.5000     82.2500 -64.0
+    131.5000     83.2500 -64.0
+    129.7500     82.5000 -64.0
+    130.7500     77.5000 -64.0
+    129.5000     77.2500 -64.0
+    127.7500     75.5000 -64.0
+    129.7500     72.5000 -64.0
+} -64.0
+{ -64.0
+     64.2500     78.5000 -64.0
+     63.5000     79.2500 -64.0
+     58.5000     79.2500 -64.0
+     54.5000     82.2500 -64.0
+     52.5000     82.2500 -64.0
+     50.5000     83.2500 -64.0
+     50.2500     85.5000 -64.0
+     51.5000     84.7500 -64.0
+     53.5000     84.7500 -64.0
+     55.5000     83.7500 -64.0
+     58.5000     83.7500 -64.0
+     62.5000     81.7500 -64.0
+     64.5000     81.7500 -64.0
+     65.2500     83.5000 -64.0
+     64.2500     86.5000 -64.0
+     57.2500     98.5000 -64.0
+     56.2500    105.5000 -64.0
+     57.2500    107.5000 -64.0
+     58.7500    107.5000 -64.0
+     59.7500    105.5000 -64.0
+     62.7500     98.5000 -64.0
+     59.5000    101.2500 -64.0
+     58.7500    100.5000 -64.0
+     59.5000     99.7500 -64.0
+     59.7500     97.5000 -64.0
+     66.7500     83.5000 -64.0
+     68.5000     82.7500 -64.0
+     68.7500     81.5000 -64.0
+     69.5000     79.7500 -64.0
+     71.7500     78.5000 -64.0
+} -64.0
+{ -64.0
+     75.2500     79.5000 -64.0
+     75.2500     80.5000 -64.0
+     72.5000     83.2500 -64.0
+     72.2500     87.5000 -64.0
+     69.5000     91.2500 -64.0
+     67.2500     92.5000 -64.0
+     66.2500     94.5000 -64.0
+     67.5000     94.7500 -64.0
+     69.5000     92.7500 -64.0
+     70.2500     93.5000 -64.0
+     71.7500     93.5000 -64.0
+     72.7500     91.5000 -64.0
+     76.7500     87.5000 -64.0
+     77.7500     85.5000 -64.0
+     75.7500     83.5000 -64.0
+     75.7500     80.5000 -64.0
+} -64.0
+{ -64.0
+    148.2500     82.5000 -64.0
+    148.2500     84.5000 -64.0
+    150.2500     86.5000 -64.0
+    150.2500     88.5000 -64.0
+    152.5000     93.7500 -64.0
+    152.7500     91.5000 -64.0
+    150.7500     87.5000 -64.0
+    150.7500     84.5000 -64.0
+    152.5000     83.7500 -64.0
+    159.5000     85.7500 -64.0
+    162.5000     84.7500 -64.0
+    160.7500     83.5000 -64.0
+    156.7500     82.5000 -64.0
+} -64.0
+{ -64.0
+    139.2500     88.5000 -64.0
+    139.2500     89.5000 -64.0
+    140.2500     91.5000 -64.0
+    142.5000     91.7500 -64.0
+} -64.0
+{ -64.0
+    121.2500    101.5000 -64.0
+    121.2500    102.5000 -64.0
+    121.7500    103.5000 -64.0
+    122.7500    101.5000 -64.0
+} -64.0
+{ -64.0
+    154.2500    101.5000 -64.0
+    154.2500    104.5000 -64.0
+    153.5000    106.2500 -64.0
+    152.7500    105.5000 -64.0
+    152.2500    106.5000 -64.0
+    153.2500    108.5000 -64.0
+    153.2500    110.5000 -64.0
+    154.5000    111.7500 -64.0
+    156.7500    108.5000 -64.0
+} -64.0
+{ -64.0
+     91.2500    112.5000 -64.0
+     90.5000    113.2500 -64.0
+     88.5000    113.2500 -64.0
+     85.5000    118.2500 -64.0
+     85.2500    124.5000 -64.0
+     83.2500    129.5000 -64.0
+     81.5000    130.2500 -64.0
+     77.7500    127.5000 -64.0
+     74.7500    123.5000 -64.0
+     73.5000    124.2500 -64.0
+     72.7500    123.5000 -64.0
+     68.5000    122.2500 -64.0
+     68.2500    123.5000 -64.0
+     71.5000    123.7500 -64.0
+     79.2500    131.5000 -64.0
+     81.2500    135.5000 -64.0
+     83.2500    141.5000 -64.0
+     85.2500    142.5000 -64.0
+     88.5000    142.7500 -64.0
+     90.2500    143.5000 -64.0
+     89.5000    144.2500 -64.0
+     89.2500    146.5000 -64.0
+     90.5000    146.7500 -64.0
+     92.2500    148.5000 -64.0
+     94.5000    148.7500 -64.0
+    102.2500    154.5000 -64.0
+    103.7500    153.5000 -64.0
+     94.7500    147.5000 -64.0
+     95.5000    145.7500 -64.0
+     97.5000    145.7500 -64.0
+    100.5000    146.7500 -64.0
+    102.2500    147.5000 -64.0
+    110.5000    147.7500 -64.0
+    116.5000    144.7500 -64.0
+    118.2500    146.5000 -64.0
+    117.5000    148.2500 -64.0
+    107.5000    153.2500 -64.0
+    107.2500    154.5000 -64.0
+    108.5000    154.7500 -64.0
+    115.7500    150.5000 -64.0
+    120.5000    148.7500 -64.0
+    124.5000    145.7500 -64.0
+    126.5000    144.7500 -64.0
+    128.5000    141.7500 -64.0
+    130.7500    135.5000 -64.0
+    133.5000    132.7500 -64.0
+    131.7500    129.5000 -64.0
+    131.5000    123.2500 -64.0
+    131.2500    125.5000 -64.0
+    130.2500    128.5000 -64.0
+    127.5000    131.2500 -64.0
+    125.5000    131.2500 -64.0
+    121.7500    127.5000 -64.0
+    122.5000    126.7500 -64.0
+    121.7500    125.5000 -64.0
+    122.7500    123.5000 -64.0
+    123.5000    121.7500 -64.0
+    126.7500    117.5000 -64.0
+    125.7500    114.5000 -64.0
+    119.5000    114.2500 -64.0
+    118.5000    116.2500 -64.0
+    116.5000    116.2500 -64.0
+    116.2500    118.5000 -64.0
+    118.2500    122.5000 -64.0
+    118.2500    127.5000 -64.0
+    123.2500    132.5000 -64.0
+    123.2500    134.5000 -64.0
+    122.2500    137.5000 -64.0
+    115.5000    142.2500 -64.0
+    109.5000    145.2500 -64.0
+    103.5000    145.2500 -64.0
+     96.5000    142.2500 -64.0
+     91.7500    135.5000 -64.0
+     91.7500    131.5000 -64.0
+     97.7500    125.5000 -64.0
+     98.7500    116.5000 -64.0
+     97.5000    115.2500 -64.0
+     93.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+    106.2500    113.5000 -64.0
+    102.5000    116.2500 -64.0
+    102.2500    119.5000 -64.0
+    104.2500    123.5000 -64.0
+    109.5000    123.7500 -64.0
+    113.5000    121.7500 -64.0
+    113.7500    116.5000 -64.0
+    110.5000    114.2500 -64.0
+} -64.0
+{ -64.0
+     88.7500    116.5000 -64.0
+     90.5000    115.7500 -64.0
+     92.2500    116.5000 -64.0
+     90.2500    119.5000 -64.0
+     92.5000    119.7500 -64.0
+     91.7500    118.5000 -64.0
+     93.5000    116.7500 -64.0
+     94.2500    118.5000 -64.0
+     96.2500    125.5000 -64.0
+     94.5000    126.2500 -64.0
+     91.5000    129.2500 -64.0
+     87.5000    129.2500 -64.0
+     85.7500    125.5000 -64.0
+     86.5000    123.7500 -64.0
+     85.7500    122.5000 -64.0
+     86.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+    103.7500    116.5000 -64.0
+    104.5000    115.7500 -64.0
+    109.5000    116.7500 -64.0
+    111.2500    118.5000 -64.0
+    111.2500    120.5000 -64.0
+    109.5000    122.2500 -64.0
+    106.5000    122.2500 -64.0
+    103.7500    119.5000 -64.0
+} -64.0
+{ -64.0
+     85.7500    136.5000 -64.0
+     86.5000    135.7500 -64.0
+     87.2500    136.5000 -64.0
+     86.5000    137.2500 -64.0
+} -64.0
+v 484 z -162.000000 -64.0
+{ -64.0
+     96.2500     29.5000 -64.0
+     92.5000     32.2500 -64.0
+     89.5000     32.2500 -64.0
+     87.7500     31.5000 -64.0
+     87.2500     32.5000 -64.0
+     89.2500     34.5000 -64.0
+     89.2500     36.5000 -64.0
+     87.5000     37.2500 -64.0
+     87.2500     40.5000 -64.0
+     84.5000     43.2500 -64.0
+     84.5000     44.7500 -64.0
+     86.5000     45.7500 -64.0
+     86.7500     44.5000 -64.0
+     89.7500     41.5000 -64.0
+     88.7500     39.5000 -64.0
+     89.5000     38.7500 -64.0
+     92.7500     38.5000 -64.0
+     89.7500     34.5000 -64.0
+     91.5000     33.7500 -64.0
+     94.2500     36.5000 -64.0
+     95.5000     34.7500 -64.0
+     96.7500     30.5000 -64.0
+} -64.0
+{ -64.0
+    109.2500     32.5000 -64.0
+    106.5000     34.2500 -64.0
+    104.2500     34.5000 -64.0
+    105.2500     36.5000 -64.0
+    105.2500     39.5000 -64.0
+    101.2500     41.5000 -64.0
+    103.5000     41.7500 -64.0
+    105.2500     43.5000 -64.0
+    104.5000     45.2500 -64.0
+    102.5000     45.2500 -64.0
+    101.5000     47.2500 -64.0
+    102.5000     47.7500 -64.0
+    104.5000     46.7500 -64.0
+    115.5000     52.7500 -64.0
+    125.5000     56.7500 -64.0
+    124.5000     55.2500 -64.0
+    111.5000     47.2500 -64.0
+    108.7500     44.5000 -64.0
+    109.5000     43.7500 -64.0
+    109.7500     40.5000 -64.0
+    107.7500     38.5000 -64.0
+    108.5000     36.7500 -64.0
+    110.5000     36.7500 -64.0
+    112.5000     35.7500 -64.0
+    114.5000     36.7500 -64.0
+    116.5000     35.7500 -64.0
+    120.5000     37.7500 -64.0
+    123.2500     42.5000 -64.0
+    122.2500     45.5000 -64.0
+    123.5000     46.7500 -64.0
+    126.5000     45.7500 -64.0
+    126.7500     42.5000 -64.0
+    124.7500     40.5000 -64.0
+    124.7500     37.5000 -64.0
+    123.7500     35.5000 -64.0
+    119.5000     34.2500 -64.0
+    120.2500     35.5000 -64.0
+    119.5000     36.2500 -64.0
+    117.7500     35.5000 -64.0
+    112.5000     35.2500 -64.0
+    109.5000     36.2500 -64.0
+    107.7500     34.5000 -64.0
+    108.5000     33.7500 -64.0
+    118.7500     33.5000 -64.0
+    114.7500     32.5000 -64.0
+} -64.0
+{ -64.0
+     94.2500     38.5000 -64.0
+     94.5000     39.7500 -64.0
+     96.5000     40.7500 -64.0
+     95.7500     38.5000 -64.0
+} -64.0
+{ -64.0
+     77.2500     47.5000 -64.0
+     77.2500     49.5000 -64.0
+     79.5000     49.7500 -64.0
+     83.2500     51.5000 -64.0
+     79.2500     59.5000 -64.0
+     80.2500     61.5000 -64.0
+     80.2500     64.5000 -64.0
+     81.5000     64.7500 -64.0
+     80.7500     63.5000 -64.0
+     80.7500     59.5000 -64.0
+     81.7500     56.5000 -64.0
+     84.5000     52.7500 -64.0
+     86.5000     52.7500 -64.0
+     86.7500     49.5000 -64.0
+     84.5000     50.2500 -64.0
+     82.7500     49.5000 -64.0
+     84.7500     48.5000 -64.0
+     80.7500     47.5000 -64.0
+} -64.0
+{ -64.0
+     99.2500     48.5000 -64.0
+     99.2500     49.5000 -64.0
+     98.2500     51.5000 -64.0
+    101.5000     51.7500 -64.0
+     99.7500     49.5000 -64.0
+    100.7500     48.5000 -64.0
+} -64.0
+{ -64.0
+    141.2500     50.5000 -64.0
+    136.5000     56.2500 -64.0
+    136.5000     57.7500 -64.0
+    140.5000     55.7500 -64.0
+    144.5000     55.7500 -64.0
+    146.2500     56.5000 -64.0
+    144.2500     57.5000 -64.0
+    146.5000     57.7500 -64.0
+    149.5000     56.7500 -64.0
+    151.7500     54.5000 -64.0
+    149.5000     54.2500 -64.0
+    143.7500     50.5000 -64.0
+} -64.0
+{ -64.0
+     94.2500     54.5000 -64.0
+     91.2500     58.5000 -64.0
+     88.2500     64.5000 -64.0
+     89.5000     63.7500 -64.0
+     92.2500     65.5000 -64.0
+     91.5000     66.2500 -64.0
+     97.5000     67.7500 -64.0
+     99.5000     66.7500 -64.0
+    103.5000     66.7500 -64.0
+    105.5000     65.7500 -64.0
+    114.5000     64.7500 -64.0
+    118.5000     62.7500 -64.0
+    117.7500     61.5000 -64.0
+    108.5000     59.2500 -64.0
+     98.5000     54.2500 -64.0
+     96.5000     55.2500 -64.0
+} -64.0
+{ -64.0
+    135.2500     58.5000 -64.0
+    135.2500     59.5000 -64.0
+    136.5000     59.7500 -64.0
+} -64.0
+{ -64.0
+    138.2500     59.5000 -64.0
+    137.2500     60.5000 -64.0
+    141.5000     60.7500 -64.0
+    143.2500     63.5000 -64.0
+    141.2500     64.5000 -64.0
+    143.5000     64.7500 -64.0
+    151.2500     68.5000 -64.0
+    155.2500     69.5000 -64.0
+    152.5000     71.2500 -64.0
+    145.7500     69.5000 -64.0
+    141.5000     69.2500 -64.0
+    140.5000     69.7500 -64.0
+    147.5000     70.7500 -64.0
+    148.2500     72.5000 -64.0
+    146.5000     73.2500 -64.0
+    144.5000     75.7500 -64.0
+    148.5000     73.7500 -64.0
+    150.5000     73.7500 -64.0
+    152.5000     72.7500 -64.0
+    156.5000     72.7500 -64.0
+    158.5000     71.7500 -64.0
+    159.2500     72.5000 -64.0
+    161.5000     72.7500 -64.0
+    160.7500     70.5000 -64.0
+    155.7500     68.5000 -64.0
+    157.5000     66.7500 -64.0
+    154.5000     65.2500 -64.0
+    145.5000     63.2500 -64.0
+    142.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+     56.2500     61.5000 -64.0
+     55.5000     62.2500 -64.0
+     55.5000     63.7500 -64.0
+     60.5000     64.7500 -64.0
+     62.2500     65.5000 -64.0
+     69.5000     65.7500 -64.0
+     71.2500     66.5000 -64.0
+     72.5000     65.7500 -64.0
+     74.5000     65.7500 -64.0
+     76.2500     66.5000 -64.0
+     78.5000     64.2500 -64.0
+     76.5000     65.2500 -64.0
+     74.5000     65.2500 -64.0
+     70.7500     63.5000 -64.0
+     66.5000     63.2500 -64.0
+     63.5000     62.2500 -64.0
+     61.7500     61.5000 -64.0
+} -64.0
+{ -64.0
+    118.2500     67.5000 -64.0
+    115.5000     69.2500 -64.0
+    116.2500     72.5000 -64.0
+    121.5000     72.7500 -64.0
+    121.7500     71.5000 -64.0
+    123.5000     69.7500 -64.0
+    126.5000     69.7500 -64.0
+    121.7500     67.5000 -64.0
+} -64.0
+{ -64.0
+     63.2500     71.5000 -64.0
+     63.2500     72.5000 -64.0
+     65.2500     73.5000 -64.0
+     69.5000     73.7500 -64.0
+     67.7500     72.5000 -64.0
+     69.7500     71.5000 -64.0
+} -64.0
+{ -64.0
+     93.2500     73.5000 -64.0
+     93.2500     74.5000 -64.0
+     97.5000     74.7500 -64.0
+     99.2500     75.5000 -64.0
+     98.5000     76.2500 -64.0
+     93.5000     76.2500 -64.0
+     90.5000     77.2500 -64.0
+     91.2500     78.5000 -64.0
+     93.5000     78.7500 -64.0
+     95.2500     79.5000 -64.0
+     99.5000     79.7500 -64.0
+    101.5000     81.7500 -64.0
+    103.5000     80.7500 -64.0
+    105.5000     80.7500 -64.0
+    109.5000     82.7500 -64.0
+    112.5000     81.7500 -64.0
+    115.2500     84.5000 -64.0
+    114.5000     85.2500 -64.0
+    114.5000     86.7500 -64.0
+    116.5000     87.7500 -64.0
+    116.7500     86.5000 -64.0
+    118.5000     84.7500 -64.0
+    120.2500     85.5000 -64.0
+    117.2500     89.5000 -64.0
+    120.5000     89.7500 -64.0
+    121.2500     91.5000 -64.0
+    119.2500     93.5000 -64.0
+    121.5000     93.7500 -64.0
+    121.7500     91.5000 -64.0
+    123.5000     90.7500 -64.0
+    125.2500     92.5000 -64.0
+    124.5000     93.2500 -64.0
+    124.2500     96.5000 -64.0
+    125.5000     95.7500 -64.0
+    129.5000     95.7500 -64.0
+    131.7500     93.5000 -64.0
+    132.7500     91.5000 -64.0
+    135.5000     87.7500 -64.0
+    137.5000     87.7500 -64.0
+    137.7500     84.5000 -64.0
+    138.7500     81.5000 -64.0
+    136.5000     83.2500 -64.0
+    133.5000     83.2500 -64.0
+    130.5000     84.2500 -64.0
+    128.7500     83.5000 -64.0
+    128.7500     81.5000 -64.0
+    127.7500     78.5000 -64.0
+    129.7500     77.5000 -64.0
+    121.5000     77.2500 -64.0
+    118.5000     76.2500 -64.0
+    116.5000     77.2500 -64.0
+    114.7500     76.5000 -64.0
+    110.5000     76.2500 -64.0
+    104.7500     73.5000 -64.0
+} -64.0
+{ -64.0
+    130.2500     73.5000 -64.0
+    130.2500     76.5000 -64.0
+    131.7500     73.5000 -64.0
+} -64.0
+{ -64.0
+    137.2500     73.5000 -64.0
+    136.2500     75.5000 -64.0
+    138.5000     75.7500 -64.0
+    138.7500     74.5000 -64.0
+} -64.0
+{ -64.0
+     69.2500     77.5000 -64.0
+     68.5000     78.2500 -64.0
+     65.5000     78.2500 -64.0
+     63.5000     79.2500 -64.0
+     59.5000     79.2500 -64.0
+     53.5000     82.2500 -64.0
+     51.5000     82.2500 -64.0
+     50.2500     84.5000 -64.0
+     54.5000     84.7500 -64.0
+     63.5000     81.7500 -64.0
+     65.2500     84.5000 -64.0
+     67.5000     81.7500 -64.0
+     65.7500     80.5000 -64.0
+     67.5000     78.7500 -64.0
+     69.2500     79.5000 -64.0
+     70.5000     78.7500 -64.0
+} -64.0
+{ -64.0
+     86.2500     77.5000 -64.0
+     82.5000     81.2500 -64.0
+     81.7500     79.5000 -64.0
+     80.5000     79.2500 -64.0
+     81.2500     80.5000 -64.0
+     80.5000     84.2500 -64.0
+     81.2500     85.5000 -64.0
+     80.2500     90.5000 -64.0
+     81.5000     88.7500 -64.0
+     81.7500     84.5000 -64.0
+     84.5000     81.7500 -64.0
+     87.5000     81.7500 -64.0
+     87.7500     77.5000 -64.0
+} -64.0
+{ -64.0
+     76.2500     79.5000 -64.0
+     74.5000     81.2500 -64.0
+     73.2500     87.5000 -64.0
+     67.5000     93.2500 -64.0
+     68.5000     93.7500 -64.0
+     70.5000     91.7500 -64.0
+     72.5000     91.7500 -64.0
+     77.5000     86.7500 -64.0
+     75.7500     85.5000 -64.0
+     76.7500     80.5000 -64.0
+} -64.0
+{ -64.0
+    150.2500     87.5000 -64.0
+    150.2500     89.5000 -64.0
+    152.2500     93.5000 -64.0
+    153.2500    102.5000 -64.0
+    151.5000    103.2500 -64.0
+    151.2500    104.5000 -64.0
+    152.2500    107.5000 -64.0
+    152.7500    106.5000 -64.0
+    151.7500    104.5000 -64.0
+    152.5000    103.7500 -64.0
+    155.2500    107.5000 -64.0
+    155.5000    110.7500 -64.0
+    155.7500    105.5000 -64.0
+    153.7500    101.5000 -64.0
+    152.7500     91.5000 -64.0
+    151.7500     88.5000 -64.0
+} -64.0
+{ -64.0
+    138.2500     88.5000 -64.0
+    138.5000     88.7500 -64.0
+    142.2500     91.5000 -64.0
+    143.7500     91.5000 -64.0
+    139.7500     88.5000 -64.0
+} -64.0
+{ -64.0
+    112.2500     90.5000 -64.0
+    110.2500     91.5000 -64.0
+    111.2500     93.5000 -64.0
+    113.5000     91.7500 -64.0
+} -64.0
+{ -64.0
+     79.2500     92.5000 -64.0
+     79.2500     93.5000 -64.0
+     78.2500     96.5000 -64.0
+     77.5000     98.2500 -64.0
+     77.2500    102.5000 -64.0
+     77.7500    103.5000 -64.0
+     79.7500     93.5000 -64.0
+} -64.0
+{ -64.0
+     59.2500     97.5000 -64.0
+     57.5000    101.2500 -64.0
+     57.2500    105.5000 -64.0
+     58.2500    107.5000 -64.0
+     59.7500    106.5000 -64.0
+     60.7500    101.5000 -64.0
+     58.7500    100.5000 -64.0
+     59.7500     98.5000 -64.0
+} -64.0
+{ -64.0
+    124.2500    102.5000 -64.0
+    123.5000    103.2500 -64.0
+    124.2500    105.5000 -64.0
+    123.2500    107.5000 -64.0
+    124.2500    109.5000 -64.0
+    126.7500    104.5000 -64.0
+    125.7500    102.5000 -64.0
+} -64.0
+{ -64.0
+     76.2500    104.5000 -64.0
+     75.2500    106.5000 -64.0
+     75.7500    107.5000 -64.0
+     76.7500    105.5000 -64.0
+} -64.0
+{ -64.0
+    153.2500    110.5000 -64.0
+    153.2500    111.5000 -64.0
+    154.5000    111.7500 -64.0
+} -64.0
+{ -64.0
+     87.2500    112.5000 -64.0
+     86.5000    113.2500 -64.0
+     87.2500    114.5000 -64.0
+     86.2500    117.5000 -64.0
+     87.5000    116.7500 -64.0
+     89.2500    117.5000 -64.0
+     89.2500    119.5000 -64.0
+     90.2500    121.5000 -64.0
+     89.5000    122.2500 -64.0
+     90.2500    124.5000 -64.0
+     91.5000    124.7500 -64.0
+     93.2500    125.5000 -64.0
+     90.5000    128.2500 -64.0
+     87.5000    128.2500 -64.0
+     85.7500    126.5000 -64.0
+     85.7500    121.5000 -64.0
+     84.5000    120.2500 -64.0
+     84.2500    130.5000 -64.0
+     87.2500    134.5000 -64.0
+     86.5000    135.2500 -64.0
+     84.2500    135.5000 -64.0
+     83.2500    137.5000 -64.0
+     87.5000    144.7500 -64.0
+    100.5000    151.7500 -64.0
+    104.2500    154.5000 -64.0
+    108.5000    154.7500 -64.0
+    110.5000    153.7500 -64.0
+    114.5000    150.7500 -64.0
+    122.5000    146.7500 -64.0
+    125.7500    143.5000 -64.0
+    127.7500    139.5000 -64.0
+    126.7500    137.5000 -64.0
+    125.5000    138.2500 -64.0
+    119.5000    141.2500 -64.0
+    116.5000    141.2500 -64.0
+    110.5000    144.2500 -64.0
+    108.5000    144.2500 -64.0
+    106.5000    145.2500 -64.0
+    105.7500    144.5000 -64.0
+    102.5000    144.2500 -64.0
+     94.5000    140.2500 -64.0
+     87.7500    133.5000 -64.0
+     89.7500    131.5000 -64.0
+     96.7500    128.5000 -64.0
+     97.7500    126.5000 -64.0
+     95.5000    126.2500 -64.0
+     94.7500    124.5000 -64.0
+     95.5000    122.7500 -64.0
+     97.5000    122.7500 -64.0
+     99.5000    124.7500 -64.0
+    103.5000    122.7500 -64.0
+    107.5000    124.7500 -64.0
+    115.5000    120.7500 -64.0
+    120.5000    121.7500 -64.0
+    122.5000    119.7500 -64.0
+    123.2500    120.5000 -64.0
+    122.2500    125.5000 -64.0
+    120.5000    127.2500 -64.0
+    120.2500    129.5000 -64.0
+    122.5000    130.7500 -64.0
+    124.5000    131.7500 -64.0
+    126.2500    132.5000 -64.0
+    128.7500    132.5000 -64.0
+    131.5000    128.7500 -64.0
+    131.7500    125.5000 -64.0
+    132.7500    123.5000 -64.0
+    131.7500    121.5000 -64.0
+    131.7500    119.5000 -64.0
+    130.5000    118.2500 -64.0
+    124.5000    115.2500 -64.0
+    124.2500    117.5000 -64.0
+    123.5000    119.2500 -64.0
+    121.7500    117.5000 -64.0
+    120.7500    115.5000 -64.0
+    117.7500    113.5000 -64.0
+    116.5000    114.2500 -64.0
+    112.5000    114.2500 -64.0
+    107.5000    113.2500 -64.0
+     99.5000    117.2500 -64.0
+     96.5000    117.2500 -64.0
+     94.7500    116.5000 -64.0
+     93.5000    114.2500 -64.0
+     91.5000    113.2500 -64.0
+     89.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+     71.2500    119.5000 -64.0
+     70.2500    121.5000 -64.0
+     72.5000    121.7500 -64.0
+     72.7500    119.5000 -64.0
+} -64.0
+{ -64.0
+     92.7500     59.5000 -64.0
+     93.5000     58.7500 -64.0
+     94.2500     59.5000 -64.0
+     93.5000     60.2500 -64.0
+} -64.0
+{ -64.0
+     93.7500     61.5000 -64.0
+     94.5000     60.7500 -64.0
+     95.2500     61.5000 -64.0
+     94.5000     62.2500 -64.0
+} -64.0
+{ -64.0
+    107.7500     61.5000 -64.0
+    109.5000     60.7500 -64.0
+    117.2500     62.5000 -64.0
+    114.5000     64.2500 -64.0
+    110.5000     64.2500 -64.0
+    103.5000     66.2500 -64.0
+     95.5000     66.2500 -64.0
+     93.7500     65.5000 -64.0
+     96.5000     63.7500 -64.0
+     98.5000     63.7500 -64.0
+    100.5000     62.7500 -64.0
+    107.5000     62.7500 -64.0
+} -64.0
+{ -64.0
+    118.7500     83.5000 -64.0
+    119.5000     82.7500 -64.0
+    120.2500     83.5000 -64.0
+    119.5000     84.2500 -64.0
+} -64.0
+{ -64.0
+    103.7500    116.5000 -64.0
+    105.5000    115.7500 -64.0
+    107.2500    116.5000 -64.0
+    104.5000    119.2500 -64.0
+    102.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+    107.7500    116.5000 -64.0
+    108.5000    115.7500 -64.0
+    111.2500    120.5000 -64.0
+    109.5000    122.2500 -64.0
+    107.5000    122.2500 -64.0
+    105.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+    128.7500    125.5000 -64.0
+    129.5000    124.7500 -64.0
+    130.2500    125.5000 -64.0
+    129.5000    126.2500 -64.0
+} -64.0
+{ -64.0
+    126.7500    127.5000 -64.0
+    127.5000    126.7500 -64.0
+    129.2500    127.5000 -64.0
+    127.5000    129.2500 -64.0
+} -64.0
+{ -64.0
+     95.7500    145.5000 -64.0
+     96.5000    144.7500 -64.0
+    102.5000    146.7500 -64.0
+    104.2500    147.5000 -64.0
+    110.5000    147.7500 -64.0
+    113.5000    146.7500 -64.0
+    114.2500    148.5000 -64.0
+    112.5000    149.2500 -64.0
+    106.5000    152.2500 -64.0
+    104.7500    151.5000 -64.0
+    102.5000    151.2500 -64.0
+     98.5000    148.2500 -64.0
+     96.5000    147.2500 -64.0
+} -64.0
+v 400 z -164.000000 -64.0
+{ -64.0
+     95.2500     31.5000 -64.0
+     90.5000     42.2500 -64.0
+     88.7500     41.5000 -64.0
+     85.5000     43.2500 -64.0
+     88.5000     47.7500 -64.0
+     88.7500     45.5000 -64.0
+     90.5000     43.7500 -64.0
+     91.2500     44.5000 -64.0
+     92.5000     42.7500 -64.0
+     93.2500     43.5000 -64.0
+     92.5000     45.2500 -64.0
+     93.5000     45.7500 -64.0
+     94.5000     42.7500 -64.0
+     97.5000     43.7500 -64.0
+     98.2500     45.5000 -64.0
+     96.5000     47.2500 -64.0
+     93.5000     47.7500 -64.0
+     97.2500     49.5000 -64.0
+     96.2500     50.5000 -64.0
+     98.5000     50.7500 -64.0
+     97.7500     49.5000 -64.0
+     98.7500     47.5000 -64.0
+    101.5000     45.7500 -64.0
+    106.5000     39.7500 -64.0
+    108.5000     40.7500 -64.0
+    110.5000     37.7500 -64.0
+    116.5000     39.7500 -64.0
+    118.5000     38.7500 -64.0
+    121.2500     43.5000 -64.0
+    120.5000     45.2500 -64.0
+    121.2500     46.5000 -64.0
+    125.5000     46.7500 -64.0
+    127.5000     45.7500 -64.0
+    127.7500     42.5000 -64.0
+    126.5000     42.2500 -64.0
+    124.7500     40.5000 -64.0
+    124.7500     36.5000 -64.0
+    122.5000     35.2500 -64.0
+    115.7500     33.5000 -64.0
+    109.5000     33.2500 -64.0
+    107.5000     34.2500 -64.0
+     99.5000     35.2500 -64.0
+     97.5000     38.2500 -64.0
+     95.5000     39.2500 -64.0
+     93.7500     38.5000 -64.0
+     94.5000     37.7500 -64.0
+     95.7500     32.5000 -64.0
+} -64.0
+{ -64.0
+     80.2500     48.5000 -64.0
+     79.2500     49.5000 -64.0
+     83.2500     50.5000 -64.0
+     84.5000     49.7500 -64.0
+} -64.0
+{ -64.0
+     85.2500     50.5000 -64.0
+     86.2500     51.5000 -64.0
+     86.7500     50.5000 -64.0
+} -64.0
+{ -64.0
+    137.2500     50.5000 -64.0
+    137.2500     54.5000 -64.0
+    136.5000     56.2500 -64.0
+    136.2500     61.5000 -64.0
+    141.2500     63.5000 -64.0
+    140.2500     66.5000 -64.0
+    141.5000     66.7500 -64.0
+    142.7500     64.5000 -64.0
+    140.7500     60.5000 -64.0
+    146.5000     57.7500 -64.0
+    148.5000     57.7500 -64.0
+    149.7500     56.5000 -64.0
+    143.7500     52.5000 -64.0
+    141.5000     53.2500 -64.0
+} -64.0
+{ -64.0
+     95.2500     53.5000 -64.0
+     92.5000     55.2500 -64.0
+     90.2500     61.5000 -64.0
+     91.5000     60.7500 -64.0
+     91.7500     58.5000 -64.0
+     93.5000     56.7500 -64.0
+     97.5000     57.7500 -64.0
+     97.7500     55.5000 -64.0
+} -64.0
+{ -64.0
+     79.2500     56.5000 -64.0
+     79.2500     62.5000 -64.0
+     77.2500     66.5000 -64.0
+     78.5000     65.7500 -64.0
+     79.5000     66.7500 -64.0
+     79.7500     63.5000 -64.0
+     81.5000     61.7500 -64.0
+     80.7500     60.5000 -64.0
+     81.5000     58.7500 -64.0
+} -64.0
+{ -64.0
+     83.2500     58.5000 -64.0
+     82.2500     60.5000 -64.0
+     83.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+    109.2500     58.5000 -64.0
+    109.5000     58.7500 -64.0
+    113.2500     61.5000 -64.0
+    112.5000     62.2500 -64.0
+    100.5000     62.2500 -64.0
+     94.5000     65.2500 -64.0
+     92.5000     65.2500 -64.0
+     90.5000     66.2500 -64.0
+     87.5000     66.2500 -64.0
+     87.2500     67.5000 -64.0
+     97.5000     67.7500 -64.0
+     99.5000     66.7500 -64.0
+    104.5000     66.7500 -64.0
+    106.5000     65.7500 -64.0
+    109.5000     65.7500 -64.0
+    111.5000     64.7500 -64.0
+    113.5000     64.7500 -64.0
+    115.5000     63.7500 -64.0
+    120.5000     63.7500 -64.0
+    120.7500     62.5000 -64.0
+    119.5000     62.2500 -64.0
+    114.5000     60.2500 -64.0
+    110.7500     58.5000 -64.0
+} -64.0
+{ -64.0
+    128.2500     65.5000 -64.0
+    128.2500     66.5000 -64.0
+    129.5000     66.7500 -64.0
+} -64.0
+{ -64.0
+    133.2500     65.5000 -64.0
+    133.2500     67.5000 -64.0
+    133.7500     66.5000 -64.0
+} -64.0
+{ -64.0
+     64.2500     66.5000 -64.0
+     63.5000     67.2500 -64.0
+     59.5000     67.2500 -64.0
+     56.5000     68.2500 -64.0
+     54.7500     67.5000 -64.0
+     53.2500     68.5000 -64.0
+     55.5000     68.7500 -64.0
+     57.2500     69.5000 -64.0
+     62.5000     69.7500 -64.0
+     69.5000     70.7500 -64.0
+     71.2500     72.5000 -64.0
+     71.2500     74.5000 -64.0
+     74.5000     74.7500 -64.0
+     73.5000     74.2500 -64.0
+     71.7500     71.5000 -64.0
+     72.5000     70.7500 -64.0
+     74.7500     70.5000 -64.0
+     72.5000     70.2500 -64.0
+     68.7500     66.5000 -64.0
+} -64.0
+{ -64.0
+    127.2500     69.5000 -64.0
+    126.2500     70.5000 -64.0
+    127.7500     70.5000 -64.0
+} -64.0
+{ -64.0
+    141.2500     70.5000 -64.0
+    142.2500     71.5000 -64.0
+    148.5000     71.7500 -64.0
+    150.5000     72.7500 -64.0
+    152.5000     71.7500 -64.0
+    156.7500     71.5000 -64.0
+    152.7500     70.5000 -64.0
+} -64.0
+{ -64.0
+    157.2500     70.5000 -64.0
+    157.5000     70.7500 -64.0
+    159.5000     71.7500 -64.0
+    159.7500     70.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500     71.5000 -64.0
+    115.5000     72.2500 -64.0
+    107.5000     72.2500 -64.0
+    105.5000     73.2500 -64.0
+     90.5000     73.2500 -64.0
+     90.2500     75.5000 -64.0
+     88.5000     77.2500 -64.0
+     85.5000     75.2500 -64.0
+     84.2500     79.5000 -64.0
+     82.5000     80.2500 -64.0
+     80.5000     79.2500 -64.0
+     80.2500     82.5000 -64.0
+     79.5000     84.2500 -64.0
+     77.5000     84.2500 -64.0
+     70.5000     90.2500 -64.0
+     68.2500     91.5000 -64.0
+     67.2500     93.5000 -64.0
+     69.5000     92.7500 -64.0
+     74.5000     88.7500 -64.0
+     76.5000     88.7500 -64.0
+     77.5000     90.7500 -64.0
+     78.7500     86.5000 -64.0
+     80.5000     85.7500 -64.0
+     80.7500     84.5000 -64.0
+     83.5000     81.7500 -64.0
+     86.5000     81.7500 -64.0
+     88.5000     80.7500 -64.0
+     87.7500     79.5000 -64.0
+     88.5000     77.7500 -64.0
+     90.2500     78.5000 -64.0
+     94.5000     78.7500 -64.0
+     96.5000     77.7500 -64.0
+    112.5000     77.7500 -64.0
+    114.2500     78.5000 -64.0
+    115.5000     80.7500 -64.0
+    117.5000     81.7500 -64.0
+    121.5000     79.7500 -64.0
+    122.5000     80.7500 -64.0
+    126.5000     78.7500 -64.0
+    127.2500     79.5000 -64.0
+    126.2500     81.5000 -64.0
+    128.2500     85.5000 -64.0
+    128.2500     87.5000 -64.0
+    127.5000     89.2500 -64.0
+    128.5000     89.7500 -64.0
+    128.7500     87.5000 -64.0
+    130.5000     85.7500 -64.0
+    132.5000     85.7500 -64.0
+    133.5000     83.7500 -64.0
+    134.2500     84.5000 -64.0
+    135.2500     86.5000 -64.0
+    137.5000     88.7500 -64.0
+    139.5000     89.7500 -64.0
+    143.2500     91.5000 -64.0
+    143.7500     90.5000 -64.0
+    142.5000     90.2500 -64.0
+    139.7500     87.5000 -64.0
+    139.7500     82.5000 -64.0
+    138.7500     79.5000 -64.0
+    137.5000     81.2500 -64.0
+    135.7500     80.5000 -64.0
+    133.5000     80.2500 -64.0
+    131.7500     78.5000 -64.0
+    132.5000     76.7500 -64.0
+    136.5000     74.7500 -64.0
+    133.5000     73.2500 -64.0
+    131.5000     74.2500 -64.0
+    129.5000     74.2500 -64.0
+    126.5000     73.2500 -64.0
+    124.7500     72.5000 -64.0
+    125.7500     71.5000 -64.0
+} -64.0
+{ -64.0
+    141.2500     73.5000 -64.0
+    141.2500     76.5000 -64.0
+    142.7500     73.5000 -64.0
+} -64.0
+{ -64.0
+     68.2500     77.5000 -64.0
+     66.5000     79.2500 -64.0
+     64.5000     79.2500 -64.0
+     65.2500     80.5000 -64.0
+     65.2500     83.5000 -64.0
+     63.2500     90.5000 -64.0
+     67.7500     81.5000 -64.0
+     71.5000     78.7500 -64.0
+     70.7500     77.5000 -64.0
+} -64.0
+{ -64.0
+     76.2500     79.5000 -64.0
+     75.5000     81.2500 -64.0
+     76.2500     82.5000 -64.0
+     77.7500     79.5000 -64.0
+} -64.0
+{ -64.0
+    147.2500     79.5000 -64.0
+    146.5000     80.2500 -64.0
+    148.2500     82.5000 -64.0
+    150.2500     86.5000 -64.0
+    150.2500     89.5000 -64.0
+    151.2500     91.5000 -64.0
+    151.2500     93.5000 -64.0
+    152.2500     95.5000 -64.0
+    152.2500     98.5000 -64.0
+    151.5000    100.2500 -64.0
+    150.5000     99.2500 -64.0
+    150.2500    101.5000 -64.0
+    151.2500    103.5000 -64.0
+    151.2500    107.5000 -64.0
+    153.2500    111.5000 -64.0
+    155.5000    111.7500 -64.0
+    155.7500    110.5000 -64.0
+    154.5000    111.2500 -64.0
+    152.7500    109.5000 -64.0
+    152.7500    107.5000 -64.0
+    153.5000    105.7500 -64.0
+    154.2500    107.5000 -64.0
+    155.5000    107.7500 -64.0
+    155.7500    105.5000 -64.0
+    153.7500    101.5000 -64.0
+    153.7500     97.5000 -64.0
+    152.7500     95.5000 -64.0
+    152.7500     90.5000 -64.0
+    150.7500     86.5000 -64.0
+    150.7500     81.5000 -64.0
+    152.5000     80.7500 -64.0
+    151.7500     79.5000 -64.0
+} -64.0
+{ -64.0
+     61.2500     93.5000 -64.0
+     58.2500    100.5000 -64.0
+     57.2500    105.5000 -64.0
+     58.2500    107.5000 -64.0
+     59.7500    106.5000 -64.0
+     64.5000     97.7500 -64.0
+     63.5000     97.2500 -64.0
+     61.5000     99.2500 -64.0
+     60.7500     97.5000 -64.0
+     61.7500     94.5000 -64.0
+} -64.0
+{ -64.0
+    117.2500    112.5000 -64.0
+    116.5000    113.2500 -64.0
+    106.5000    113.2500 -64.0
+    100.5000    116.2500 -64.0
+     96.5000    116.2500 -64.0
+     94.5000    118.2500 -64.0
+     94.2500    123.5000 -64.0
+     95.2500    126.5000 -64.0
+     93.5000    127.2500 -64.0
+     91.7500    125.5000 -64.0
+     91.7500    122.5000 -64.0
+     90.7500    119.5000 -64.0
+     87.7500    115.5000 -64.0
+     85.5000    115.2500 -64.0
+     83.2500    121.5000 -64.0
+     84.2500    123.5000 -64.0
+     84.2500    128.5000 -64.0
+     86.2500    130.5000 -64.0
+     94.5000    130.7500 -64.0
+     96.5000    128.7500 -64.0
+     98.2500    129.5000 -64.0
+     99.7500    129.5000 -64.0
+    100.7500    127.5000 -64.0
+    103.5000    123.7500 -64.0
+    105.2500    124.5000 -64.0
+    108.5000    124.7500 -64.0
+    114.5000    121.7500 -64.0
+    117.5000    121.7500 -64.0
+    121.2500    124.5000 -64.0
+    124.5000    124.7500 -64.0
+    124.7500    117.5000 -64.0
+    119.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+    131.2500    120.5000 -64.0
+    129.5000    124.2500 -64.0
+    129.2500    126.5000 -64.0
+    127.5000    128.2500 -64.0
+    127.2500    130.5000 -64.0
+    129.5000    130.7500 -64.0
+    132.5000    125.7500 -64.0
+    132.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+     89.2500    140.5000 -64.0
+     88.5000    141.2500 -64.0
+     89.5000    143.7500 -64.0
+     93.2500    146.5000 -64.0
+     96.5000    146.7500 -64.0
+    100.5000    149.7500 -64.0
+    105.5000    150.7500 -64.0
+    108.5000    151.7500 -64.0
+    116.5000    147.7500 -64.0
+    120.7500    145.5000 -64.0
+    121.7500    143.5000 -64.0
+    120.5000    144.2500 -64.0
+    119.7500    143.5000 -64.0
+    112.5000    143.2500 -64.0
+    110.5000    144.2500 -64.0
+    106.5000    144.2500 -64.0
+     99.5000    143.2500 -64.0
+     97.7500    142.5000 -64.0
+     92.5000    142.2500 -64.0
+     90.7500    140.5000 -64.0
+} -64.0
+{ -64.0
+    108.7500     34.5000 -64.0
+    109.5000     33.7500 -64.0
+    111.2500     35.5000 -64.0
+    109.5000     37.2500 -64.0
+    108.7500     36.5000 -64.0
+} -64.0
+{ -64.0
+    111.7500     35.5000 -64.0
+    112.5000     34.7500 -64.0
+    114.5000     34.7500 -64.0
+    115.2500     36.5000 -64.0
+    113.5000     37.2500 -64.0
+} -64.0
+{ -64.0
+     92.7500     40.5000 -64.0
+     93.5000     39.7500 -64.0
+     94.2500     40.5000 -64.0
+     93.5000     42.2500 -64.0
+} -64.0
+{ -64.0
+     96.7500     41.5000 -64.0
+     98.5000     40.7500 -64.0
+     99.2500     42.5000 -64.0
+     97.5000     43.2500 -64.0
+} -64.0
+{ -64.0
+     99.7500     43.5000 -64.0
+    100.5000     42.7500 -64.0
+    101.2500     43.5000 -64.0
+    100.5000     44.2500 -64.0
+} -64.0
+{ -64.0
+    136.7500     59.5000 -64.0
+    137.5000     58.7500 -64.0
+    138.2500     59.5000 -64.0
+    137.5000     60.2500 -64.0
+} -64.0
+{ -64.0
+    111.7500     73.5000 -64.0
+    112.5000     72.7500 -64.0
+    113.2500     73.5000 -64.0
+    121.5000     73.7500 -64.0
+    130.5000     74.7500 -64.0
+    132.2500     75.5000 -64.0
+    131.5000     76.2500 -64.0
+    107.5000     76.2500 -64.0
+    105.7500     75.5000 -64.0
+    107.5000     74.7500 -64.0
+    109.5000     73.7500 -64.0
+} -64.0
+{ -64.0
+     90.7500     76.5000 -64.0
+     91.5000     75.7500 -64.0
+     92.2500     76.5000 -64.0
+     91.5000     77.2500 -64.0
+} -64.0
+{ -64.0
+     69.5000     77.7500 -64.0
+     70.2500     78.5000 -64.0
+     68.5000     80.2500 -64.0
+     67.7500     79.5000 -64.0
+} -64.0
+{ -64.0
+    136.7500     83.5000 -64.0
+    137.5000     82.7500 -64.0
+    138.2500     83.5000 -64.0
+    137.5000     84.2500 -64.0
+} -64.0
+{ -64.0
+     59.7500    100.5000 -64.0
+     60.5000     99.7500 -64.0
+     61.2500    100.5000 -64.0
+     60.5000    101.2500 -64.0
+} -64.0
+{ -64.0
+    104.7500    116.5000 -64.0
+    106.5000    115.7500 -64.0
+    111.5000    116.7500 -64.0
+    112.2500    118.5000 -64.0
+    111.2500    121.5000 -64.0
+    108.5000    123.2500 -64.0
+    101.7500    119.5000 -64.0
+    102.5000    117.7500 -64.0
+} -64.0
+v 233 z -166.000000 -64.0
+{ -64.0
+    105.2500     34.5000 -64.0
+    102.5000     37.2500 -64.0
+    100.5000     35.2500 -64.0
+     98.5000     36.2500 -64.0
+     98.2500     40.5000 -64.0
+    100.2500     42.5000 -64.0
+    102.5000     42.7500 -64.0
+    103.5000     40.7500 -64.0
+    106.5000     40.7500 -64.0
+    108.2500     41.5000 -64.0
+    111.5000     38.7500 -64.0
+    112.2500     40.5000 -64.0
+    118.5000     40.7500 -64.0
+    119.2500     42.5000 -64.0
+    121.2500     43.5000 -64.0
+    121.2500     45.5000 -64.0
+    122.2500     47.5000 -64.0
+    125.7500     47.5000 -64.0
+    123.5000     47.2500 -64.0
+    122.7500     45.5000 -64.0
+    126.5000     42.7500 -64.0
+    124.7500     41.5000 -64.0
+    125.5000     40.7500 -64.0
+    125.7500     37.5000 -64.0
+    122.7500     36.5000 -64.0
+    121.5000     37.2500 -64.0
+    118.7500     34.5000 -64.0
+    116.5000     35.2500 -64.0
+    113.5000     34.2500 -64.0
+    111.5000     35.2500 -64.0
+    110.5000     34.2500 -64.0
+    108.5000     35.2500 -64.0
+} -64.0
+{ -64.0
+     87.2500     38.5000 -64.0
+     91.2500     41.5000 -64.0
+     91.7500     40.5000 -64.0
+     93.5000     39.7500 -64.0
+     90.7500     38.5000 -64.0
+} -64.0
+{ -64.0
+     86.2500     43.5000 -64.0
+     87.2500     44.5000 -64.0
+     86.5000     46.2500 -64.0
+     87.2500     47.5000 -64.0
+     88.5000     45.7500 -64.0
+     90.5000     44.7500 -64.0
+     89.7500     43.5000 -64.0
+} -64.0
+{ -64.0
+     94.2500     44.5000 -64.0
+     95.2500     45.5000 -64.0
+     93.5000     46.2500 -64.0
+     95.2500     48.5000 -64.0
+     94.5000     52.2500 -64.0
+     92.5000     52.2500 -64.0
+     95.2500     53.5000 -64.0
+     96.5000     52.7500 -64.0
+     95.7500     50.5000 -64.0
+     96.5000     48.7500 -64.0
+     98.5000     48.7500 -64.0
+     99.5000     45.7500 -64.0
+    110.5000     51.7500 -64.0
+    111.2500     53.5000 -64.0
+    120.5000     56.7500 -64.0
+    121.5000     56.2500 -64.0
+    106.5000     48.2500 -64.0
+    100.5000     44.2500 -64.0
+     97.5000     45.2500 -64.0
+} -64.0
+{ -64.0
+    129.2500     44.5000 -64.0
+    129.2500     46.5000 -64.0
+    130.7500     44.5000 -64.0
+} -64.0
+{ -64.0
+    137.2500     60.5000 -64.0
+    136.5000     61.2500 -64.0
+    137.5000     63.7500 -64.0
+    139.5000     64.7500 -64.0
+    140.2500     66.5000 -64.0
+    141.2500     68.5000 -64.0
+    143.5000     68.7500 -64.0
+    143.7500     67.5000 -64.0
+    141.7500     65.5000 -64.0
+    143.7500     64.5000 -64.0
+    142.7500     62.5000 -64.0
+    138.5000     62.2500 -64.0
+} -64.0
+{ -64.0
+    129.2500     63.5000 -64.0
+    127.2500     66.5000 -64.0
+    128.2500     68.5000 -64.0
+    128.2500     72.5000 -64.0
+    129.5000     72.7500 -64.0
+    132.2500     76.5000 -64.0
+    132.2500     78.5000 -64.0
+    134.2500     82.5000 -64.0
+    134.2500     84.5000 -64.0
+    136.2500     86.5000 -64.0
+    146.2500     93.5000 -64.0
+    146.7500     92.5000 -64.0
+    142.7500     88.5000 -64.0
+    141.7500     79.5000 -64.0
+    139.5000     76.2500 -64.0
+    135.7500     74.5000 -64.0
+    135.7500     71.5000 -64.0
+    134.5000     72.2500 -64.0
+    131.5000     72.2500 -64.0
+    128.7500     68.5000 -64.0
+    128.7500     66.5000 -64.0
+    129.7500     64.5000 -64.0
+} -64.0
+{ -64.0
+     84.2500     68.5000 -64.0
+     80.5000     70.2500 -64.0
+     78.5000     70.2500 -64.0
+     83.2500     73.5000 -64.0
+     84.2500     75.5000 -64.0
+     83.5000     77.2500 -64.0
+     79.5000     77.2500 -64.0
+     77.5000     75.2500 -64.0
+     77.2500     77.5000 -64.0
+     75.5000     79.2500 -64.0
+     72.7500     77.5000 -64.0
+     72.7500     75.5000 -64.0
+     71.5000     75.2500 -64.0
+     67.5000     77.2500 -64.0
+     67.2500     79.5000 -64.0
+     64.2500     85.5000 -64.0
+     63.2500     90.5000 -64.0
+     58.2500    100.5000 -64.0
+     57.2500    105.5000 -64.0
+     58.2500    107.5000 -64.0
+     60.7500    106.5000 -64.0
+     67.5000     93.7500 -64.0
+     71.5000     90.7500 -64.0
+     79.5000     86.7500 -64.0
+     81.7500     84.5000 -64.0
+     86.5000     75.7500 -64.0
+     86.7500     72.5000 -64.0
+     83.5000     72.2500 -64.0
+     82.7500     70.5000 -64.0
+     85.7500     68.5000 -64.0
+} -64.0
+{ -64.0
+     74.2500     69.5000 -64.0
+     73.5000     70.2500 -64.0
+     74.2500     71.5000 -64.0
+     74.2500     73.5000 -64.0
+     74.7500     72.5000 -64.0
+     75.5000     70.7500 -64.0
+} -64.0
+{ -64.0
+    147.2500     77.5000 -64.0
+    143.2500     79.5000 -64.0
+    147.2500     80.5000 -64.0
+    150.2500     86.5000 -64.0
+    150.2500     89.5000 -64.0
+    151.2500     91.5000 -64.0
+    151.2500     96.5000 -64.0
+    150.5000     98.2500 -64.0
+    149.5000     97.2500 -64.0
+    149.2500     99.5000 -64.0
+    150.2500    101.5000 -64.0
+    150.2500    105.5000 -64.0
+    152.2500    111.5000 -64.0
+    155.5000    111.7500 -64.0
+    155.7500    107.5000 -64.0
+    153.7500    101.5000 -64.0
+    153.7500     96.5000 -64.0
+    152.7500     94.5000 -64.0
+    151.7500     85.5000 -64.0
+    149.7500     78.5000 -64.0
+} -64.0
+{ -64.0
+    119.2500    111.5000 -64.0
+    113.5000    114.2500 -64.0
+    112.7500    113.5000 -64.0
+    106.5000    113.2500 -64.0
+    100.5000    116.2500 -64.0
+     92.5000    115.2500 -64.0
+     89.2500    116.5000 -64.0
+     91.2500    120.5000 -64.0
+     92.2500    127.5000 -64.0
+     90.5000    128.2500 -64.0
+     85.7500    118.5000 -64.0
+     84.5000    118.2500 -64.0
+     82.5000    120.2500 -64.0
+     82.2500    124.5000 -64.0
+     85.2500    130.5000 -64.0
+     92.5000    130.7500 -64.0
+     94.2500    132.5000 -64.0
+     97.5000    132.7500 -64.0
+    100.7500    127.5000 -64.0
+    103.5000    124.7500 -64.0
+    107.5000    124.7500 -64.0
+    109.5000    123.7500 -64.0
+    117.5000    122.7500 -64.0
+    125.5000    127.7500 -64.0
+    131.5000    124.7500 -64.0
+    131.7500    121.5000 -64.0
+    130.7500    119.5000 -64.0
+    131.5000    117.7500 -64.0
+    130.5000    116.2500 -64.0
+    122.7500    111.5000 -64.0
+} -64.0
+{ -64.0
+    114.2500    149.5000 -64.0
+    114.2500    150.5000 -64.0
+    115.2500    153.5000 -64.0
+    115.7500    152.5000 -64.0
+} -64.0
+{ -64.0
+    134.7500     77.5000 -64.0
+    135.5000     76.7500 -64.0
+    136.2500     77.5000 -64.0
+    135.5000     78.2500 -64.0
+} -64.0
+{ -64.0
+     70.5000     78.7500 -64.0
+     72.5000     78.7500 -64.0
+     77.2500     83.5000 -64.0
+     76.5000     85.2500 -64.0
+     72.5000     88.2500 -64.0
+     70.5000     89.2500 -64.0
+     63.5000     97.2500 -64.0
+     62.7500     95.5000 -64.0
+     63.7500     90.5000 -64.0
+     66.7500     86.5000 -64.0
+     67.7500     81.5000 -64.0
+} -64.0
+{ -64.0
+     58.7500    104.5000 -64.0
+     59.5000    103.7500 -64.0
+     60.2500    104.5000 -64.0
+     59.5000    105.2500 -64.0
+} -64.0
+{ -64.0
+    152.7500    106.5000 -64.0
+    153.5000    105.7500 -64.0
+    155.2500    109.5000 -64.0
+    154.5000    111.2500 -64.0
+    152.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+    120.7500    112.5000 -64.0
+    121.5000    111.7500 -64.0
+    122.2500    112.5000 -64.0
+    121.2500    114.5000 -64.0
+    122.2500    117.5000 -64.0
+    120.5000    118.2500 -64.0
+    118.5000    119.2500 -64.0
+    116.5000    119.2500 -64.0
+    108.5000    123.2500 -64.0
+    104.5000    123.2500 -64.0
+    102.7500    122.5000 -64.0
+     96.5000    122.2500 -64.0
+     94.7500    120.5000 -64.0
+     96.5000    117.7500 -64.0
+    101.7500    117.5000 -64.0
+    108.5000    114.7500 -64.0
+    110.2500    115.5000 -64.0
+    116.5000    115.7500 -64.0
+    118.5000    113.7500 -64.0
+} -64.0
+v 207 z -168.000000 -64.0
+{ -64.0
+    105.2500     35.5000 -64.0
+    104.2500     37.5000 -64.0
+    102.5000     38.2500 -64.0
+    100.5000     36.2500 -64.0
+     98.5000     37.2500 -64.0
+     97.2500     45.5000 -64.0
+     95.5000     46.2500 -64.0
+     93.7500     44.5000 -64.0
+     92.5000     46.2500 -64.0
+     89.5000     46.2500 -64.0
+     89.2500     49.5000 -64.0
+     94.5000     56.7500 -64.0
+     95.7500     52.5000 -64.0
+     99.7500     46.5000 -64.0
+    106.5000     42.7500 -64.0
+    114.5000     42.7500 -64.0
+    119.5000     44.7500 -64.0
+    123.2500     48.5000 -64.0
+    126.5000     48.7500 -64.0
+    128.5000     46.2500 -64.0
+    126.5000     47.2500 -64.0
+    122.7500     46.5000 -64.0
+    125.5000     43.7500 -64.0
+    128.7500     43.5000 -64.0
+    124.7500     42.5000 -64.0
+    124.7500     38.5000 -64.0
+    120.5000     38.2500 -64.0
+    119.7500     36.5000 -64.0
+    118.5000     36.2500 -64.0
+    116.5000     37.2500 -64.0
+    113.7500     35.5000 -64.0
+    112.5000     36.2500 -64.0
+} -64.0
+{ -64.0
+     92.2500     39.5000 -64.0
+     91.2500     41.5000 -64.0
+     93.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+     84.2500     63.5000 -64.0
+     84.2500     64.5000 -64.0
+     82.2500     68.5000 -64.0
+     75.5000     74.2500 -64.0
+     70.5000     74.2500 -64.0
+     69.2500     75.5000 -64.0
+     64.2500     85.5000 -64.0
+     63.2500     90.5000 -64.0
+     58.5000    101.2500 -64.0
+     58.2500    106.5000 -64.0
+     60.5000    106.7500 -64.0
+     63.5000    103.7500 -64.0
+     63.7500    101.5000 -64.0
+     68.7500     91.5000 -64.0
+     66.5000     92.2500 -64.0
+     66.2500     93.5000 -64.0
+     64.5000     95.2500 -64.0
+     63.7500     93.5000 -64.0
+     64.5000     91.7500 -64.0
+     66.7500     85.5000 -64.0
+     68.7500     80.5000 -64.0
+     71.5000     76.7500 -64.0
+     75.2500     79.5000 -64.0
+     75.2500     82.5000 -64.0
+     76.2500     84.5000 -64.0
+     73.5000     87.2500 -64.0
+     71.5000     88.2500 -64.0
+     69.5000     90.7500 -64.0
+     78.5000     86.7500 -64.0
+     82.7500     82.5000 -64.0
+     86.7500     74.5000 -64.0
+     87.7500     67.5000 -64.0
+     85.2500     72.5000 -64.0
+     84.5000     74.2500 -64.0
+     83.7500     73.5000 -64.0
+     82.7500     71.5000 -64.0
+     83.5000     69.7500 -64.0
+     85.7500     63.5000 -64.0
+} -64.0
+{ -64.0
+    132.2500     63.5000 -64.0
+    129.5000     65.2500 -64.0
+    129.2500     67.5000 -64.0
+    130.2500     69.5000 -64.0
+    130.2500     72.5000 -64.0
+    133.2500     78.5000 -64.0
+    134.2500     83.5000 -64.0
+    136.5000     85.7500 -64.0
+    146.2500     92.5000 -64.0
+    146.7500     91.5000 -64.0
+    142.7500     87.5000 -64.0
+    142.7500     84.5000 -64.0
+    141.7500     82.5000 -64.0
+    142.5000     78.7500 -64.0
+    146.5000     78.7500 -64.0
+    150.2500     86.5000 -64.0
+    151.2500     95.5000 -64.0
+    150.5000     97.2500 -64.0
+    147.7500     93.5000 -64.0
+    147.2500     94.5000 -64.0
+    149.2500     98.5000 -64.0
+    149.2500    101.5000 -64.0
+    151.2500    105.5000 -64.0
+    151.2500    109.5000 -64.0
+    153.5000    111.7500 -64.0
+    155.5000    110.7500 -64.0
+    155.7500    105.5000 -64.0
+    153.7500    101.5000 -64.0
+    153.7500     94.5000 -64.0
+    152.7500     92.5000 -64.0
+    151.7500     83.5000 -64.0
+    150.7500     81.5000 -64.0
+    150.7500     79.5000 -64.0
+    147.7500     75.5000 -64.0
+    143.5000     75.2500 -64.0
+    139.5000     73.2500 -64.0
+    137.7500     69.5000 -64.0
+    136.5000     70.2500 -64.0
+    134.7500     69.5000 -64.0
+    132.5000     71.2500 -64.0
+    131.7500     70.5000 -64.0
+    131.7500     67.5000 -64.0
+    133.5000     65.7500 -64.0
+    136.5000     65.7500 -64.0
+    138.2500     66.5000 -64.0
+    138.5000     68.7500 -64.0
+    138.7500     65.5000 -64.0
+    136.5000     65.2500 -64.0
+    134.7500     63.5000 -64.0
+} -64.0
+{ -64.0
+    119.2500    111.5000 -64.0
+    113.5000    114.2500 -64.0
+    111.7500    113.5000 -64.0
+    107.5000    113.2500 -64.0
+    101.5000    116.2500 -64.0
+     94.5000    116.2500 -64.0
+     91.5000    115.2500 -64.0
+     87.2500    116.5000 -64.0
+     83.5000    123.2500 -64.0
+     83.2500    127.5000 -64.0
+     84.2500    130.5000 -64.0
+     89.5000    135.7500 -64.0
+     94.5000    136.7500 -64.0
+     97.5000    133.7500 -64.0
+     97.7500    131.5000 -64.0
+    100.5000    127.7500 -64.0
+    104.7500    125.5000 -64.0
+    103.7500    123.5000 -64.0
+    101.5000    123.2500 -64.0
+     99.5000    124.2500 -64.0
+     97.5000    124.2500 -64.0
+     97.2500    126.5000 -64.0
+     95.5000    128.2500 -64.0
+     93.7500    127.5000 -64.0
+     93.7500    125.5000 -64.0
+     92.5000    125.2500 -64.0
+     89.7500    122.5000 -64.0
+     93.5000    117.7500 -64.0
+    100.5000    117.7500 -64.0
+    106.5000    114.7500 -64.0
+    110.5000    114.7500 -64.0
+    112.5000    115.7500 -64.0
+    114.5000    114.7500 -64.0
+    116.5000    114.7500 -64.0
+    122.7500    111.5000 -64.0
+} -64.0
+{ -64.0
+    130.2500    113.5000 -64.0
+    131.2500    115.5000 -64.0
+    131.2500    118.5000 -64.0
+    129.5000    120.2500 -64.0
+    129.2500    124.5000 -64.0
+    125.5000    127.2500 -64.0
+    122.7500    123.5000 -64.0
+    123.5000    121.7500 -64.0
+    125.5000    121.7500 -64.0
+    124.7500    120.5000 -64.0
+    119.5000    119.2500 -64.0
+    118.5000    121.2500 -64.0
+    115.5000    121.2500 -64.0
+    113.5000    122.2500 -64.0
+    113.2500    124.5000 -64.0
+    114.5000    123.7500 -64.0
+    118.5000    123.7500 -64.0
+    126.5000    130.7500 -64.0
+    132.5000    122.7500 -64.0
+    132.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+    118.2500    142.5000 -64.0
+    116.5000    143.2500 -64.0
+    113.5000    146.2500 -64.0
+    111.7500    145.5000 -64.0
+    107.5000    145.2500 -64.0
+    107.2500    146.5000 -64.0
+    111.2500    148.5000 -64.0
+    114.2500    154.5000 -64.0
+    116.5000    153.7500 -64.0
+    116.7500    148.5000 -64.0
+    119.5000    144.7500 -64.0
+    119.7500    142.5000 -64.0
+} -64.0
+{ -64.0
+     89.7500     47.5000 -64.0
+     91.5000     46.7500 -64.0
+     92.2500     48.5000 -64.0
+     90.5000     49.2500 -64.0
+} -64.0
+{ -64.0
+     59.7500    103.5000 -64.0
+     60.5000    102.7500 -64.0
+     61.2500    104.5000 -64.0
+     59.5000    106.2500 -64.0
+     58.7500    105.5000 -64.0
+} -64.0
+{ -64.0
+    152.7500    106.5000 -64.0
+    153.5000    105.7500 -64.0
+    155.2500    108.5000 -64.0
+    154.5000    110.2500 -64.0
+    152.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+     86.7500    122.5000 -64.0
+     87.5000    121.7500 -64.0
+     88.2500    122.5000 -64.0
+     87.5000    124.2500 -64.0
+} -64.0
+v 246 z -170.000000 -64.0
+{ -64.0
+    105.2500     36.5000 -64.0
+    104.5000     37.2500 -64.0
+    102.5000     38.2500 -64.0
+    100.7500     37.5000 -64.0
+     98.5000     38.2500 -64.0
+     98.2500     39.5000 -64.0
+     95.5000     42.2500 -64.0
+     93.5000     42.2500 -64.0
+     93.2500     44.5000 -64.0
+     89.5000     48.2500 -64.0
+     88.2500     54.5000 -64.0
+     85.2500     60.5000 -64.0
+     86.5000     60.7500 -64.0
+     87.7500     58.5000 -64.0
+     88.7500     56.5000 -64.0
+     89.5000     54.7500 -64.0
+     91.5000     53.7500 -64.0
+     93.2500     54.5000 -64.0
+     94.2500     56.5000 -64.0
+     91.2500     63.5000 -64.0
+     92.7500     62.5000 -64.0
+     96.5000     55.7500 -64.0
+     96.7500     52.5000 -64.0
+    103.5000     46.7500 -64.0
+    109.5000     43.7500 -64.0
+    112.5000     43.7500 -64.0
+    117.5000     45.7500 -64.0
+    125.2500     52.5000 -64.0
+    128.2500     58.5000 -64.0
+    128.5000     62.7500 -64.0
+    130.5000     59.7500 -64.0
+    132.2500     60.5000 -64.0
+    133.2500     62.5000 -64.0
+    131.5000     64.2500 -64.0
+    129.5000     65.2500 -64.0
+    129.2500     67.5000 -64.0
+    130.2500     69.5000 -64.0
+    130.2500     71.5000 -64.0
+    133.2500     77.5000 -64.0
+    133.2500     79.5000 -64.0
+    134.2500     82.5000 -64.0
+    135.5000     82.7500 -64.0
+    146.2500     92.5000 -64.0
+    149.2500     98.5000 -64.0
+    149.2500    100.5000 -64.0
+    150.2500    102.5000 -64.0
+    150.2500    104.5000 -64.0
+    151.2500    106.5000 -64.0
+    151.5000    109.7500 -64.0
+    153.5000    110.7500 -64.0
+    155.5000    109.7500 -64.0
+    155.7500    105.5000 -64.0
+    154.7500    103.5000 -64.0
+    154.7500    101.5000 -64.0
+    153.7500     99.5000 -64.0
+    153.7500     94.5000 -64.0
+    152.7500     92.5000 -64.0
+    152.7500     87.5000 -64.0
+    151.7500     85.5000 -64.0
+    151.7500     82.5000 -64.0
+    149.7500     76.5000 -64.0
+    146.7500     73.5000 -64.0
+    142.5000     72.2500 -64.0
+    134.7500     63.5000 -64.0
+    134.7500     61.5000 -64.0
+    131.7500     57.5000 -64.0
+    128.7500     51.5000 -64.0
+    126.7500     50.5000 -64.0
+    128.5000     48.7500 -64.0
+    128.5000     45.2500 -64.0
+    126.5000     44.2500 -64.0
+    124.7500     39.5000 -64.0
+    120.5000     39.2500 -64.0
+    119.7500     37.5000 -64.0
+    110.5000     37.2500 -64.0
+} -64.0
+{ -64.0
+     84.2500     62.5000 -64.0
+     83.5000     63.2500 -64.0
+     83.2500     65.5000 -64.0
+     80.5000     68.2500 -64.0
+     76.5000     71.2500 -64.0
+     74.5000     71.2500 -64.0
+     71.5000     72.2500 -64.0
+     69.2500     74.5000 -64.0
+     68.2500     76.5000 -64.0
+     67.5000     78.2500 -64.0
+     65.2500     84.5000 -64.0
+     63.5000     88.2500 -64.0
+     63.2500     90.5000 -64.0
+     62.2500     93.5000 -64.0
+     59.5000     99.2500 -64.0
+     59.2500    101.5000 -64.0
+     58.2500    104.5000 -64.0
+     59.2500    106.5000 -64.0
+     61.7500    106.5000 -64.0
+     69.7500     90.5000 -64.0
+     68.2500     90.5000 -64.0
+     65.5000     94.2500 -64.0
+     64.7500     93.5000 -64.0
+     65.7500     88.5000 -64.0
+     66.7500     85.5000 -64.0
+     69.7500     78.5000 -64.0
+     72.5000     75.7500 -64.0
+     76.5000     73.7500 -64.0
+     77.2500     74.5000 -64.0
+     77.2500     83.5000 -64.0
+     71.5000     88.7500 -64.0
+     76.5000     86.7500 -64.0
+     83.7500     81.5000 -64.0
+     85.7500     77.5000 -64.0
+     86.5000     75.7500 -64.0
+     88.7500     69.5000 -64.0
+     90.7500     64.5000 -64.0
+     89.2500     65.5000 -64.0
+     88.2500     67.5000 -64.0
+     87.5000     69.2500 -64.0
+     85.2500     75.5000 -64.0
+     83.5000     76.2500 -64.0
+     81.7500     74.5000 -64.0
+     80.7500     72.5000 -64.0
+     82.7500     71.5000 -64.0
+     83.7500     66.5000 -64.0
+     84.7500     63.5000 -64.0
+} -64.0
+{ -64.0
+    106.2500    112.5000 -64.0
+    102.5000    116.2500 -64.0
+    103.5000    116.7500 -64.0
+    107.5000    113.7500 -64.0
+    109.5000    113.7500 -64.0
+    111.2500    115.5000 -64.0
+    115.5000    115.7500 -64.0
+    119.5000    113.7500 -64.0
+    122.5000    113.7500 -64.0
+    123.7500    112.5000 -64.0
+    121.5000    112.2500 -64.0
+    117.5000    114.2500 -64.0
+    112.5000    114.2500 -64.0
+    108.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500    115.5000 -64.0
+     88.5000    116.2500 -64.0
+     87.2500    118.5000 -64.0
+    100.5000    118.7500 -64.0
+    101.7500    117.5000 -64.0
+     94.5000    117.2500 -64.0
+} -64.0
+{ -64.0
+    131.2500    115.5000 -64.0
+    130.2500    117.5000 -64.0
+    130.7500    118.5000 -64.0
+    131.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+     86.2500    119.5000 -64.0
+     85.2500    120.5000 -64.0
+     84.2500    125.5000 -64.0
+     85.2500    128.5000 -64.0
+     86.5000    128.7500 -64.0
+     86.7500    125.5000 -64.0
+     85.7500    123.5000 -64.0
+     86.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+    121.2500    120.5000 -64.0
+    120.5000    121.2500 -64.0
+    118.5000    121.2500 -64.0
+    112.5000    124.2500 -64.0
+    110.7500    123.5000 -64.0
+    108.5000    123.2500 -64.0
+    108.2500    124.5000 -64.0
+    113.5000    124.7500 -64.0
+    115.5000    123.7500 -64.0
+    117.5000    123.7500 -64.0
+    121.5000    125.7500 -64.0
+    122.2500    127.5000 -64.0
+    124.2500    131.5000 -64.0
+    124.2500    134.5000 -64.0
+    126.5000    134.7500 -64.0
+    128.5000    131.7500 -64.0
+    128.7500    129.5000 -64.0
+    130.7500    125.5000 -64.0
+    129.7500    123.5000 -64.0
+    127.5000    123.2500 -64.0
+    129.2500    124.5000 -64.0
+    129.2500    127.5000 -64.0
+    126.5000    129.2500 -64.0
+    125.7500    128.5000 -64.0
+    122.7500    123.5000 -64.0
+    123.5000    122.7500 -64.0
+    126.7500    122.5000 -64.0
+    124.5000    122.2500 -64.0
+    122.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500    124.5000 -64.0
+     93.2500    126.5000 -64.0
+     87.5000    131.2500 -64.0
+     89.2500    134.5000 -64.0
+     95.5000    138.7500 -64.0
+     97.5000    137.7500 -64.0
+     97.7500    131.5000 -64.0
+    100.7500    127.5000 -64.0
+    105.5000    125.7500 -64.0
+    103.7500    124.5000 -64.0
+    100.5000    124.2500 -64.0
+     96.5000    127.2500 -64.0
+     94.5000    134.2500 -64.0
+     92.5000    134.2500 -64.0
+     90.7500    132.5000 -64.0
+     90.7500    130.5000 -64.0
+     94.5000    127.7500 -64.0
+     94.7500    125.5000 -64.0
+} -64.0
+{ -64.0
+    121.2500    139.5000 -64.0
+    120.5000    140.2500 -64.0
+    118.5000    141.2500 -64.0
+    114.5000    144.2500 -64.0
+    105.5000    144.2500 -64.0
+    102.5000    143.2500 -64.0
+    103.5000    144.7500 -64.0
+    109.5000    147.7500 -64.0
+    111.5000    145.7500 -64.0
+    114.5000    145.7500 -64.0
+    116.5000    144.7500 -64.0
+    117.2500    145.5000 -64.0
+    117.5000    148.7500 -64.0
+    117.7500    146.5000 -64.0
+    121.7500    141.5000 -64.0
+    122.7500    139.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500    154.5000 -64.0
+    113.2500    156.5000 -64.0
+    113.7500    155.5000 -64.0
+} -64.0
+{ -64.0
+    140.7500     75.5000 -64.0
+    142.5000     74.7500 -64.0
+    146.2500     77.5000 -64.0
+    149.2500     82.5000 -64.0
+    149.2500     84.5000 -64.0
+    150.2500     86.5000 -64.0
+    151.2500     94.5000 -64.0
+    150.5000     96.2500 -64.0
+    141.7500     84.5000 -64.0
+    141.7500     82.5000 -64.0
+    139.7500     81.5000 -64.0
+    139.7500     77.5000 -64.0
+} -64.0
+{ -64.0
+    134.7500     76.5000 -64.0
+    136.5000     75.7500 -64.0
+    138.2500     77.5000 -64.0
+    137.5000     78.2500 -64.0
+    135.5000     78.2500 -64.0
+} -64.0
+{ -64.0
+     60.5000    102.7500 -64.0
+     62.2500    103.5000 -64.0
+     60.5000    106.2500 -64.0
+     58.7500    104.5000 -64.0
+} -64.0
+{ -64.0
+    152.7500    105.5000 -64.0
+    153.5000    104.7500 -64.0
+    155.2500    107.5000 -64.0
+    154.5000    109.2500 -64.0
+    152.7500    108.5000 -64.0
+} -64.0
+v 234 z -172.000000 -64.0
+{ -64.0
+    104.2500     38.5000 -64.0
+    103.5000     40.2500 -64.0
+     98.5000     39.2500 -64.0
+     98.2500     40.5000 -64.0
+     94.5000     43.2500 -64.0
+     90.2500     48.5000 -64.0
+     83.2500     62.5000 -64.0
+     76.5000     69.2500 -64.0
+     74.5000     69.2500 -64.0
+     69.5000     73.2500 -64.0
+     59.5000    100.2500 -64.0
+     59.2500    105.5000 -64.0
+     62.5000    105.7500 -64.0
+     66.7500     98.5000 -64.0
+     67.7500     93.5000 -64.0
+     70.5000     89.7500 -64.0
+     78.5000     84.7500 -64.0
+     82.5000     80.7500 -64.0
+     84.5000     79.7500 -64.0
+     91.7500     65.5000 -64.0
+    100.5000     50.7500 -64.0
+    104.5000     47.7500 -64.0
+    110.5000     44.7500 -64.0
+    115.5000     45.7500 -64.0
+    122.2500     51.5000 -64.0
+    127.2500     59.5000 -64.0
+    127.2500     61.5000 -64.0
+    128.5000     62.7500 -64.0
+    128.7500     60.5000 -64.0
+    127.7500     58.5000 -64.0
+    129.5000     56.7500 -64.0
+    131.2500     57.5000 -64.0
+    134.2500     62.5000 -64.0
+    133.2500     65.5000 -64.0
+    131.5000     66.2500 -64.0
+    129.5000     65.2500 -64.0
+    129.2500     67.5000 -64.0
+    130.2500     69.5000 -64.0
+    130.2500     71.5000 -64.0
+    133.2500     77.5000 -64.0
+    133.2500     79.5000 -64.0
+    139.2500     83.5000 -64.0
+    140.2500     85.5000 -64.0
+    145.2500     90.5000 -64.0
+    149.2500     97.5000 -64.0
+    149.2500     99.5000 -64.0
+    152.2500    109.5000 -64.0
+    154.5000    109.7500 -64.0
+    156.7500    106.5000 -64.0
+    155.7500    104.5000 -64.0
+    155.7500    102.5000 -64.0
+    153.7500     98.5000 -64.0
+    152.7500     86.5000 -64.0
+    148.7500     73.5000 -64.0
+    144.5000     71.2500 -64.0
+    138.5000     65.2500 -64.0
+    128.7500     50.5000 -64.0
+    128.7500     46.5000 -64.0
+    125.7500     44.5000 -64.0
+    125.7500     42.5000 -64.0
+    123.5000     40.2500 -64.0
+    120.5000     41.2500 -64.0
+    118.5000     38.2500 -64.0
+    116.5000     39.2500 -64.0
+    114.5000     38.2500 -64.0
+    112.5000     39.2500 -64.0
+} -64.0
+{ -64.0
+    106.2500    112.5000 -64.0
+    104.5000    113.2500 -64.0
+    103.5000    115.2500 -64.0
+     99.5000    118.2500 -64.0
+     96.5000    118.2500 -64.0
+     94.5000    119.2500 -64.0
+     89.5000    118.2500 -64.0
+     88.2500    119.5000 -64.0
+     92.5000    119.7500 -64.0
+     94.5000    121.7500 -64.0
+    100.5000    119.7500 -64.0
+    106.5000    113.7500 -64.0
+    109.5000    113.7500 -64.0
+    111.2500    115.5000 -64.0
+    115.2500    116.5000 -64.0
+    118.7500    115.5000 -64.0
+    113.5000    115.2500 -64.0
+    109.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500    113.5000 -64.0
+    121.5000    114.2500 -64.0
+    119.5000    114.2500 -64.0
+    122.5000    115.7500 -64.0
+    125.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+    130.2500    116.5000 -64.0
+    130.2500    117.5000 -64.0
+    131.5000    117.7500 -64.0
+    131.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500    118.5000 -64.0
+    119.2500    120.5000 -64.0
+    114.5000    124.2500 -64.0
+    111.5000    124.2500 -64.0
+    109.7500    123.5000 -64.0
+    106.5000    125.2500 -64.0
+     98.5000    125.2500 -64.0
+     95.5000    124.2500 -64.0
+     94.2500    127.5000 -64.0
+     90.2500    131.5000 -64.0
+     89.2500    133.5000 -64.0
+     90.2500    135.5000 -64.0
+     92.5000    130.7500 -64.0
+     94.5000    129.7500 -64.0
+     96.2500    130.5000 -64.0
+     96.2500    135.5000 -64.0
+     95.5000    137.2500 -64.0
+     93.5000    138.2500 -64.0
+     91.7500    136.5000 -64.0
+     91.2500    137.5000 -64.0
+    101.2500    145.5000 -64.0
+    103.5000    145.7500 -64.0
+    107.2500    148.5000 -64.0
+    108.7500    148.5000 -64.0
+    107.7500    146.5000 -64.0
+    108.5000    145.7500 -64.0
+    112.5000    145.7500 -64.0
+    116.5000    143.7500 -64.0
+    118.2500    144.5000 -64.0
+    118.5000    148.7500 -64.0
+    118.7500    145.5000 -64.0
+    123.5000    140.7500 -64.0
+    129.5000    132.7500 -64.0
+    129.7500    130.5000 -64.0
+    126.5000    131.2500 -64.0
+    124.7500    128.5000 -64.0
+    124.7500    125.5000 -64.0
+    126.5000    124.7500 -64.0
+    130.5000    126.7500 -64.0
+    130.7500    125.5000 -64.0
+    128.7500    123.5000 -64.0
+    125.5000    123.2500 -64.0
+    121.7500    121.5000 -64.0
+    121.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+     85.2500    123.5000 -64.0
+     85.2500    125.5000 -64.0
+     86.5000    125.7500 -64.0
+     86.7500    124.5000 -64.0
+} -64.0
+{ -64.0
+    112.2500    160.5000 -64.0
+    113.2500    161.5000 -64.0
+    114.7500    160.5000 -64.0
+} -64.0
+{ -64.0
+     98.7500     46.5000 -64.0
+     99.5000     45.7500 -64.0
+    100.2500     46.5000 -64.0
+     99.5000     47.2500 -64.0
+} -64.0
+{ -64.0
+     93.7500     49.5000 -64.0
+     94.5000     48.7500 -64.0
+     98.2500     50.5000 -64.0
+     96.2500     53.5000 -64.0
+     95.2500     55.5000 -64.0
+     93.2500     60.5000 -64.0
+     87.5000     67.2500 -64.0
+     87.2500     70.5000 -64.0
+     86.2500     73.5000 -64.0
+     78.5000     81.2500 -64.0
+     68.5000     90.2500 -64.0
+     66.5000     90.2500 -64.0
+     65.7500     88.5000 -64.0
+     66.7500     85.5000 -64.0
+     69.7500     78.5000 -64.0
+     72.5000     74.7500 -64.0
+     76.5000     72.7500 -64.0
+     76.7500     71.5000 -64.0
+     80.5000     68.7500 -64.0
+     82.5000     68.7500 -64.0
+     82.7500     67.5000 -64.0
+     86.7500     59.5000 -64.0
+     89.7500     57.5000 -64.0
+     88.7500     55.5000 -64.0
+     90.5000     53.7500 -64.0
+     94.5000     53.7500 -64.0
+     94.7500     51.5000 -64.0
+} -64.0
+{ -64.0
+    124.7500     51.5000 -64.0
+    126.5000     50.7500 -64.0
+    128.2500     51.5000 -64.0
+    128.2500     53.5000 -64.0
+    126.5000     54.2500 -64.0
+} -64.0
+{ -64.0
+    140.7500     75.5000 -64.0
+    141.5000     74.7500 -64.0
+    145.5000     74.7500 -64.0
+    147.2500     76.5000 -64.0
+    147.2500     78.5000 -64.0
+    149.2500     82.5000 -64.0
+    149.2500     85.5000 -64.0
+    150.2500     87.5000 -64.0
+    150.2500     90.5000 -64.0
+    151.2500     92.5000 -64.0
+    150.5000     94.2500 -64.0
+    148.7500     92.5000 -64.0
+    147.7500     90.5000 -64.0
+    145.5000     88.2500 -64.0
+    140.7500     81.5000 -64.0
+    137.7500     77.5000 -64.0
+    138.5000     76.7500 -64.0
+} -64.0
+{ -64.0
+     65.7500     91.5000 -64.0
+     66.5000     90.7500 -64.0
+     67.2500     91.5000 -64.0
+     65.5000     94.2500 -64.0
+     64.7500     93.5000 -64.0
+} -64.0
+{ -64.0
+     62.5000     99.7500 -64.0
+     63.2500    100.5000 -64.0
+     62.5000    101.2500 -64.0
+     62.2500    103.5000 -64.0
+     60.5000    104.2500 -64.0
+     59.7500    102.5000 -64.0
+} -64.0
+{ -64.0
+    152.7500    104.5000 -64.0
+    153.5000    103.7500 -64.0
+    154.2500    104.5000 -64.0
+    155.2500    106.5000 -64.0
+    154.5000    108.2500 -64.0
+    152.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+    115.7500    124.5000 -64.0
+    117.5000    123.7500 -64.0
+    120.5000    124.7500 -64.0
+    123.2500    128.5000 -64.0
+    123.2500    133.5000 -64.0
+    122.2500    136.5000 -64.0
+    119.5000    140.2500 -64.0
+    111.5000    144.2500 -64.0
+    109.7500    143.5000 -64.0
+    105.5000    143.2500 -64.0
+    101.7500    141.5000 -64.0
+     98.7500    137.5000 -64.0
+     98.7500    134.5000 -64.0
+     97.7500    132.5000 -64.0
+     98.7500    129.5000 -64.0
+    101.5000    126.7500 -64.0
+    103.5000    126.7500 -64.0
+    105.5000    125.7500 -64.0
+    109.5000    125.7500 -64.0
+    111.5000    124.7500 -64.0
+} -64.0
+v 203 z -174.000000 -64.0
+{ -64.0
+    106.2500     39.5000 -64.0
+    103.5000     41.2500 -64.0
+    100.5000     40.2500 -64.0
+     96.5000     44.2500 -64.0
+     94.5000     44.2500 -64.0
+     94.2500     45.5000 -64.0
+     89.2500     50.5000 -64.0
+     86.2500     56.5000 -64.0
+     77.5000     66.2500 -64.0
+     69.5000     72.2500 -64.0
+     59.5000    100.2500 -64.0
+     60.2500    101.5000 -64.0
+     60.2500    104.5000 -64.0
+     63.5000    104.7500 -64.0
+     65.7500    101.5000 -64.0
+     67.7500     92.5000 -64.0
+     76.5000     83.7500 -64.0
+     78.5000     82.7500 -64.0
+     86.7500     75.5000 -64.0
+     92.7500     64.5000 -64.0
+     98.7500     56.5000 -64.0
+    100.7500     52.5000 -64.0
+    107.5000     46.7500 -64.0
+    114.5000     46.7500 -64.0
+    120.2500     50.5000 -64.0
+    123.2500     54.5000 -64.0
+    123.2500     56.5000 -64.0
+    126.2500     60.5000 -64.0
+    130.2500     68.5000 -64.0
+    131.2500     74.5000 -64.0
+    139.5000     81.7500 -64.0
+    144.2500     88.5000 -64.0
+    150.2500     98.5000 -64.0
+    150.2500    103.5000 -64.0
+    152.2500    107.5000 -64.0
+    155.5000    107.7500 -64.0
+    156.7500    103.5000 -64.0
+    154.7500     99.5000 -64.0
+    153.7500     91.5000 -64.0
+    151.7500     84.5000 -64.0
+    150.7500     77.5000 -64.0
+    148.5000     72.2500 -64.0
+    146.5000     71.2500 -64.0
+    136.7500     60.5000 -64.0
+    123.7500     42.5000 -64.0
+    119.5000     42.2500 -64.0
+    118.7500     40.5000 -64.0
+    109.5000     40.2500 -64.0
+} -64.0
+{ -64.0
+    107.2500    111.5000 -64.0
+    105.2500    112.5000 -64.0
+    107.5000    112.7500 -64.0
+    114.2500    116.5000 -64.0
+    118.5000    116.7500 -64.0
+    120.2500    117.5000 -64.0
+    119.2500    119.5000 -64.0
+    114.5000    124.2500 -64.0
+    110.5000    124.2500 -64.0
+    108.5000    125.2500 -64.0
+    101.5000    125.2500 -64.0
+     98.5000    124.2500 -64.0
+     97.7500    122.5000 -64.0
+    101.5000    119.7500 -64.0
+    102.7500    116.5000 -64.0
+     94.5000    121.2500 -64.0
+     96.2500    123.5000 -64.0
+     96.2500    126.5000 -64.0
+     93.5000    129.2500 -64.0
+     89.5000    131.2500 -64.0
+     89.5000    136.7500 -64.0
+     91.5000    133.7500 -64.0
+     93.5000    132.7500 -64.0
+     95.2500    133.5000 -64.0
+     99.2500    141.5000 -64.0
+    104.2500    144.5000 -64.0
+    113.5000    144.7500 -64.0
+    116.5000    143.7500 -64.0
+    121.5000    139.7500 -64.0
+    122.2500    141.5000 -64.0
+    120.5000    143.2500 -64.0
+    120.2500    147.5000 -64.0
+    122.7500    142.5000 -64.0
+    130.5000    133.7500 -64.0
+    130.7500    131.5000 -64.0
+    129.2500    132.5000 -64.0
+    128.2500    134.5000 -64.0
+    123.5000    138.2500 -64.0
+    122.7500    137.5000 -64.0
+    124.5000    134.7500 -64.0
+    124.7500    128.5000 -64.0
+    126.5000    126.7500 -64.0
+    129.5000    126.7500 -64.0
+    131.5000    128.7500 -64.0
+    131.7500    126.5000 -64.0
+    128.7500    122.5000 -64.0
+    125.5000    124.2500 -64.0
+    122.2500    124.5000 -64.0
+    123.2500    126.5000 -64.0
+    123.2500    131.5000 -64.0
+    121.2500    137.5000 -64.0
+    118.5000    140.2500 -64.0
+    113.5000    143.2500 -64.0
+    106.5000    143.2500 -64.0
+    103.5000    142.2500 -64.0
+    100.7500    139.5000 -64.0
+     97.7500    133.5000 -64.0
+     97.7500    129.5000 -64.0
+    100.5000    126.7500 -64.0
+    107.5000    126.7500 -64.0
+    117.5000    123.7500 -64.0
+    121.5000    123.7500 -64.0
+    120.7500    122.5000 -64.0
+    120.7500    119.5000 -64.0
+    123.5000    116.7500 -64.0
+    127.2500    117.5000 -64.0
+    127.7500    116.5000 -64.0
+    122.7500    115.5000 -64.0
+    114.5000    115.2500 -64.0
+    108.7500    111.5000 -64.0
+} -64.0
+{ -64.0
+     85.2500    124.5000 -64.0
+     84.2500    126.5000 -64.0
+     86.5000    126.7500 -64.0
+     86.7500    125.5000 -64.0
+} -64.0
+{ -64.0
+     97.2500    143.5000 -64.0
+    104.5000    147.7500 -64.0
+    107.2500    150.5000 -64.0
+    107.7500    149.5000 -64.0
+    105.5000    147.2500 -64.0
+     98.7500    143.5000 -64.0
+} -64.0
+{ -64.0
+    119.2500    148.5000 -64.0
+    119.2500    150.5000 -64.0
+    119.7500    149.5000 -64.0
+} -64.0
+{ -64.0
+    112.2500    161.5000 -64.0
+    112.2500    162.5000 -64.0
+    113.5000    162.7500 -64.0
+    113.7500    161.5000 -64.0
+} -64.0
+{ -64.0
+     97.7500     46.5000 -64.0
+     98.5000     45.7500 -64.0
+    100.2500     46.5000 -64.0
+    101.2500     48.5000 -64.0
+     99.5000     50.2500 -64.0
+     98.7500     48.5000 -64.0
+} -64.0
+{ -64.0
+     94.7500     50.5000 -64.0
+     95.5000     49.7500 -64.0
+     98.2500     52.5000 -64.0
+     97.2500     54.5000 -64.0
+     94.5000     57.2500 -64.0
+     94.2500     59.5000 -64.0
+     91.2500     62.5000 -64.0
+     90.2500     64.5000 -64.0
+     88.5000     65.2500 -64.0
+     88.2500     66.5000 -64.0
+     85.2500     73.5000 -64.0
+     82.2500     76.5000 -64.0
+     81.2500     78.5000 -64.0
+     79.5000     79.2500 -64.0
+     73.5000     85.2500 -64.0
+     69.5000     88.2500 -64.0
+     67.5000     89.2500 -64.0
+     66.7500     87.5000 -64.0
+     67.7500     84.5000 -64.0
+     71.7500     74.5000 -64.0
+     77.5000     68.7500 -64.0
+     81.5000     66.7500 -64.0
+     84.5000     63.7500 -64.0
+     86.7500     56.5000 -64.0
+     89.5000     54.7500 -64.0
+     92.7500     54.5000 -64.0
+} -64.0
+{ -64.0
+    124.7500     52.5000 -64.0
+    126.5000     51.7500 -64.0
+    128.2500     52.5000 -64.0
+    129.2500     54.5000 -64.0
+    130.5000     54.7500 -64.0
+    136.2500     63.5000 -64.0
+    136.2500     65.5000 -64.0
+    134.5000     67.2500 -64.0
+    132.5000     67.2500 -64.0
+    128.7500     62.5000 -64.0
+    126.7500     58.5000 -64.0
+    128.7500     57.5000 -64.0
+    124.7500     54.5000 -64.0
+} -64.0
+{ -64.0
+    142.7500     74.5000 -64.0
+    144.5000     73.7500 -64.0
+    146.2500     74.5000 -64.0
+    148.2500     78.5000 -64.0
+    148.2500     80.5000 -64.0
+    149.2500     82.5000 -64.0
+    150.2500     90.5000 -64.0
+    149.5000     92.2500 -64.0
+    138.7500     77.5000 -64.0
+    139.5000     75.7500 -64.0
+    141.5000     75.7500 -64.0
+} -64.0
+{ -64.0
+     63.5000     97.7500 -64.0
+     64.2500     98.5000 -64.0
+     63.5000     99.2500 -64.0
+     63.2500    101.5000 -64.0
+     62.5000    103.2500 -64.0
+     60.7500    102.5000 -64.0
+     60.7500    100.5000 -64.0
+} -64.0
+{ -64.0
+    152.7500    101.5000 -64.0
+    153.5000    100.7500 -64.0
+    155.2500    103.5000 -64.0
+    154.5000    105.2500 -64.0
+    152.7500    104.5000 -64.0
+} -64.0
+v 187 z -176.000000 -64.0
+{ -64.0
+    103.2500     41.5000 -64.0
+    102.5000     42.2500 -64.0
+     99.5000     42.2500 -64.0
+     91.2500     49.5000 -64.0
+     82.2500     59.5000 -64.0
+     81.2500     61.5000 -64.0
+     69.5000     72.2500 -64.0
+     69.2500     74.5000 -64.0
+     68.2500     77.5000 -64.0
+     66.2500     82.5000 -64.0
+     65.5000     84.2500 -64.0
+     62.2500     93.5000 -64.0
+     60.5000     97.2500 -64.0
+     60.2500    103.5000 -64.0
+     63.5000    103.7500 -64.0
+     65.7500    100.5000 -64.0
+     66.7500     95.5000 -64.0
+     67.7500     92.5000 -64.0
+     79.5000     79.7500 -64.0
+     87.7500     73.5000 -64.0
+     91.7500     65.5000 -64.0
+     97.7500     58.5000 -64.0
+    103.5000     50.7500 -64.0
+    108.5000     47.7500 -64.0
+    112.5000     47.7500 -64.0
+    117.5000     49.7500 -64.0
+    121.2500     53.5000 -64.0
+    124.2500     58.5000 -64.0
+    129.2500     66.5000 -64.0
+    131.2500     72.5000 -64.0
+    140.2500     80.5000 -64.0
+    144.2500     87.5000 -64.0
+    145.2500     89.5000 -64.0
+    148.2500     93.5000 -64.0
+    151.2500     99.5000 -64.0
+    151.2500    103.5000 -64.0
+    152.5000    104.7500 -64.0
+    154.5000    105.7500 -64.0
+    155.5000    103.7500 -64.0
+    154.7500    102.5000 -64.0
+    154.7500     96.5000 -64.0
+    153.7500     94.5000 -64.0
+    153.7500     91.5000 -64.0
+    152.7500     89.5000 -64.0
+    152.7500     87.5000 -64.0
+    151.7500     85.5000 -64.0
+    151.7500     82.5000 -64.0
+    150.7500     80.5000 -64.0
+    150.7500     77.5000 -64.0
+    148.7500     72.5000 -64.0
+    140.7500     64.5000 -64.0
+    139.5000     62.2500 -64.0
+    131.7500     52.5000 -64.0
+    130.7500     50.5000 -64.0
+    123.7500     44.5000 -64.0
+    121.5000     44.2500 -64.0
+    117.7500     41.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500    115.5000 -64.0
+    118.2500    118.5000 -64.0
+    118.2500    120.5000 -64.0
+    114.5000    124.2500 -64.0
+    112.5000    124.2500 -64.0
+    110.5000    125.2500 -64.0
+    111.5000    125.7500 -64.0
+    113.5000    124.7500 -64.0
+    116.5000    124.7500 -64.0
+    120.5000    122.7500 -64.0
+    120.7500    118.5000 -64.0
+    119.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+     98.2500    120.5000 -64.0
+     97.2500    122.5000 -64.0
+     98.2500    125.5000 -64.0
+    100.2500    126.5000 -64.0
+    104.7500    126.5000 -64.0
+     99.7500    122.5000 -64.0
+     99.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+    128.2500    121.5000 -64.0
+    128.2500    123.5000 -64.0
+    124.5000    127.2500 -64.0
+    121.2500    137.5000 -64.0
+    112.5000    143.2500 -64.0
+    108.5000    143.2500 -64.0
+    102.5000    141.2500 -64.0
+     94.7500    130.5000 -64.0
+     90.5000    130.2500 -64.0
+     88.7500    128.5000 -64.0
+     88.5000    123.2500 -64.0
+     88.2500    129.5000 -64.0
+     90.2500    131.5000 -64.0
+     88.2500    135.5000 -64.0
+     89.5000    135.7500 -64.0
+     93.5000    133.7500 -64.0
+     95.2500    134.5000 -64.0
+     97.2500    138.5000 -64.0
+    103.2500    143.5000 -64.0
+    107.2500    144.5000 -64.0
+    112.5000    144.7500 -64.0
+    117.5000    142.7500 -64.0
+    120.5000    139.7500 -64.0
+    122.5000    138.7500 -64.0
+    124.5000    134.7500 -64.0
+    124.7500    130.5000 -64.0
+    127.5000    127.7500 -64.0
+    130.5000    127.7500 -64.0
+    132.2500    129.5000 -64.0
+    132.2500    131.5000 -64.0
+    133.7500    130.5000 -64.0
+    131.7500    126.5000 -64.0
+    131.7500    123.5000 -64.0
+    129.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+    106.2500    125.5000 -64.0
+    106.2500    126.5000 -64.0
+    108.5000    126.7500 -64.0
+    108.7500    125.5000 -64.0
+} -64.0
+{ -64.0
+    126.2500    137.5000 -64.0
+    123.2500    142.5000 -64.0
+    125.7500    140.5000 -64.0
+    126.7500    138.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500    149.5000 -64.0
+    120.2500    152.5000 -64.0
+    121.5000    150.7500 -64.0
+} -64.0
+{ -64.0
+    107.2500    151.5000 -64.0
+    107.2500    152.5000 -64.0
+    109.2500    156.5000 -64.0
+    109.7500    155.5000 -64.0
+    108.7500    152.5000 -64.0
+} -64.0
+{ -64.0
+    115.2500    152.5000 -64.0
+    114.5000    153.2500 -64.0
+    114.2500    156.5000 -64.0
+    116.5000    154.7500 -64.0
+} -64.0
+{ -64.0
+     97.7500     46.5000 -64.0
+     98.5000     45.7500 -64.0
+    101.2500     49.5000 -64.0
+     98.5000     51.2500 -64.0
+     97.7500     50.5000 -64.0
+} -64.0
+{ -64.0
+     93.7500     50.5000 -64.0
+     94.5000     49.7500 -64.0
+     98.2500     52.5000 -64.0
+     96.2500     57.5000 -64.0
+     88.5000     65.2500 -64.0
+     88.2500     67.5000 -64.0
+     85.2500     71.5000 -64.0
+     84.2500     73.5000 -64.0
+     72.5000     85.2500 -64.0
+     68.5000     87.2500 -64.0
+     67.7500     85.5000 -64.0
+     68.7500     82.5000 -64.0
+     72.7500     72.5000 -64.0
+     75.5000     69.7500 -64.0
+     80.7500     65.5000 -64.0
+     81.7500     63.5000 -64.0
+     89.5000     54.7500 -64.0
+     91.7500     54.5000 -64.0
+} -64.0
+{ -64.0
+    124.7500     53.5000 -64.0
+    125.5000     52.7500 -64.0
+    129.5000     52.7500 -64.0
+    132.2500     56.5000 -64.0
+    132.5000     59.7500 -64.0
+    136.2500     62.5000 -64.0
+    138.2500     66.5000 -64.0
+    139.5000     66.7500 -64.0
+    143.2500     70.5000 -64.0
+    146.2500     74.5000 -64.0
+    148.2500     78.5000 -64.0
+    148.2500     81.5000 -64.0
+    149.2500     83.5000 -64.0
+    149.2500     86.5000 -64.0
+    150.2500     88.5000 -64.0
+    149.5000     89.2500 -64.0
+    147.5000     88.2500 -64.0
+    139.7500     78.5000 -64.0
+    139.7500     76.5000 -64.0
+    141.5000     74.7500 -64.0
+    140.7500     73.5000 -64.0
+    136.5000     73.2500 -64.0
+    133.7500     70.5000 -64.0
+    133.7500     67.5000 -64.0
+    130.7500     65.5000 -64.0
+    130.7500     62.5000 -64.0
+    127.7500     59.5000 -64.0
+} -64.0
+{ -64.0
+     62.7500     96.5000 -64.0
+     63.5000     95.7500 -64.0
+     64.2500     96.5000 -64.0
+     64.2500     98.5000 -64.0
+     63.2500    101.5000 -64.0
+     61.5000    102.2500 -64.0
+     60.7500    100.5000 -64.0
+} -64.0
+v 182 z -178.000000 -64.0
+{ -64.0
+    106.2500     41.5000 -64.0
+    105.5000     42.2500 -64.0
+    102.5000     42.2500 -64.0
+     94.5000     46.2500 -64.0
+     72.2500     69.5000 -64.0
+     69.5000     73.2500 -64.0
+     69.2500     75.5000 -64.0
+     68.2500     78.5000 -64.0
+     66.5000     82.2500 -64.0
+     66.2500     84.5000 -64.0
+     63.2500     90.5000 -64.0
+     62.2500     95.5000 -64.0
+     61.5000     97.2500 -64.0
+     61.2500    101.5000 -64.0
+     63.5000    101.7500 -64.0
+     65.5000     98.7500 -64.0
+     65.7500     96.5000 -64.0
+     67.7500     91.5000 -64.0
+     75.7500     83.5000 -64.0
+     76.7500     81.5000 -64.0
+     89.7500     69.5000 -64.0
+     90.7500     67.5000 -64.0
+     96.5000     59.7500 -64.0
+     98.7500     58.5000 -64.0
+     99.7500     56.5000 -64.0
+    104.5000     51.7500 -64.0
+    110.5000     48.7500 -64.0
+    113.5000     49.7500 -64.0
+    119.2500     52.5000 -64.0
+    129.2500     66.5000 -64.0
+    131.2500     70.5000 -64.0
+    137.5000     76.7500 -64.0
+    139.5000     77.7500 -64.0
+    139.7500     75.5000 -64.0
+    133.7500     69.5000 -64.0
+    133.7500     67.5000 -64.0
+    130.7500     64.5000 -64.0
+    130.7500     62.5000 -64.0
+    127.7500     59.5000 -64.0
+    123.7500     52.5000 -64.0
+    122.7500     50.5000 -64.0
+    123.5000     48.7500 -64.0
+    125.2500     51.5000 -64.0
+    128.5000     51.7500 -64.0
+    131.2500     55.5000 -64.0
+    133.5000     59.7500 -64.0
+    135.5000     60.7500 -64.0
+    141.2500     67.5000 -64.0
+    147.2500     75.5000 -64.0
+    147.2500     77.5000 -64.0
+    148.2500     79.5000 -64.0
+    148.2500     83.5000 -64.0
+    147.5000     85.2500 -64.0
+    140.2500     78.5000 -64.0
+    145.2500     88.5000 -64.0
+    149.2500     93.5000 -64.0
+    152.2500     97.5000 -64.0
+    152.2500    100.5000 -64.0
+    153.5000    101.7500 -64.0
+    153.7500     97.5000 -64.0
+    152.7500     95.5000 -64.0
+    152.7500     90.5000 -64.0
+    151.7500     88.5000 -64.0
+    151.7500     83.5000 -64.0
+    150.7500     81.5000 -64.0
+    150.7500     77.5000 -64.0
+    146.7500     69.5000 -64.0
+    135.7500     57.5000 -64.0
+    134.7500     55.5000 -64.0
+    128.5000     48.2500 -64.0
+    115.7500     41.5000 -64.0
+} -64.0
+{ -64.0
+    115.2500    116.5000 -64.0
+    115.2500    117.5000 -64.0
+    116.5000    117.7500 -64.0
+    118.2500    120.5000 -64.0
+    117.5000    121.2500 -64.0
+    113.5000    119.2500 -64.0
+    114.2500    120.5000 -64.0
+    115.2500    122.5000 -64.0
+    114.2500    124.5000 -64.0
+    119.5000    124.7500 -64.0
+    121.5000    123.7500 -64.0
+    121.7500    121.5000 -64.0
+    119.7500    117.5000 -64.0
+    117.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+    100.2500    121.5000 -64.0
+    100.2500    126.5000 -64.0
+    103.5000    126.7500 -64.0
+} -64.0
+{ -64.0
+     87.2500    127.5000 -64.0
+     86.5000    128.2500 -64.0
+     84.5000    129.2500 -64.0
+     84.2500    130.5000 -64.0
+     86.2500    131.5000 -64.0
+     87.5000    130.7500 -64.0
+     89.5000    130.7500 -64.0
+     91.2500    134.5000 -64.0
+     93.5000    134.7500 -64.0
+     95.2500    135.5000 -64.0
+     98.2500    139.5000 -64.0
+    104.5000    143.7500 -64.0
+    113.5000    144.7500 -64.0
+    115.2500    145.5000 -64.0
+    115.2500    148.5000 -64.0
+    116.7500    147.5000 -64.0
+    115.7500    145.5000 -64.0
+    116.7500    143.5000 -64.0
+    119.5000    140.7500 -64.0
+    121.5000    139.7500 -64.0
+    124.5000    134.7500 -64.0
+    124.7500    131.5000 -64.0
+    127.5000    128.7500 -64.0
+    128.2500    129.5000 -64.0
+    130.5000    129.7500 -64.0
+    134.5000    131.7500 -64.0
+    135.7500    130.5000 -64.0
+    132.5000    128.2500 -64.0
+    127.5000    127.2500 -64.0
+    124.5000    130.2500 -64.0
+    122.2500    136.5000 -64.0
+    116.5000    141.2500 -64.0
+    110.5000    143.2500 -64.0
+    108.7500    142.5000 -64.0
+    105.5000    142.2500 -64.0
+    102.5000    141.2500 -64.0
+     93.7500    131.5000 -64.0
+     89.5000    130.2500 -64.0
+     88.7500    128.5000 -64.0
+} -64.0
+{ -64.0
+    127.2500    139.5000 -64.0
+    125.5000    140.2500 -64.0
+    120.2500    150.5000 -64.0
+    121.7500    151.5000 -64.0
+    125.7500    141.5000 -64.0
+    128.7500    139.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500    143.5000 -64.0
+     94.2500    144.5000 -64.0
+     98.7500    144.5000 -64.0
+} -64.0
+{ -64.0
+    110.2500    148.5000 -64.0
+    108.5000    152.2500 -64.0
+    105.5000    150.2500 -64.0
+    105.2500    151.5000 -64.0
+    108.2500    155.5000 -64.0
+    109.5000    155.7500 -64.0
+    111.5000    149.7500 -64.0
+    113.2500    150.5000 -64.0
+    114.5000    152.7500 -64.0
+    114.7500    149.5000 -64.0
+} -64.0
+{ -64.0
+    107.7500     43.5000 -64.0
+    108.5000     42.7500 -64.0
+    113.5000     42.7500 -64.0
+    115.2500     44.5000 -64.0
+    118.5000     44.7500 -64.0
+    119.2500     46.5000 -64.0
+    118.5000     48.2500 -64.0
+    114.7500     46.5000 -64.0
+    108.5000     46.2500 -64.0
+    105.5000     47.2500 -64.0
+    103.7500     46.5000 -64.0
+    104.5000     45.7500 -64.0
+    106.7500     45.5000 -64.0
+} -64.0
+{ -64.0
+     96.7500     47.5000 -64.0
+     98.5000     46.7500 -64.0
+    101.2500     50.5000 -64.0
+     99.2500     51.5000 -64.0
+     97.2500     55.5000 -64.0
+     92.2500     60.5000 -64.0
+     87.2500     68.5000 -64.0
+     77.5000     79.2500 -64.0
+     70.5000     85.2500 -64.0
+     68.7500     84.5000 -64.0
+     69.7500     79.5000 -64.0
+     71.5000     77.7500 -64.0
+     71.7500     74.5000 -64.0
+     77.5000     66.7500 -64.0
+     79.5000     65.7500 -64.0
+     89.5000     55.7500 -64.0
+     94.5000     49.7500 -64.0
+     96.5000     49.7500 -64.0
+     95.7500     48.5000 -64.0
+} -64.0
+{ -64.0
+     62.7500     95.5000 -64.0
+     63.5000     94.7500 -64.0
+     64.2500     95.5000 -64.0
+     63.5000     96.2500 -64.0
+} -64.0
+v 164 z -180.000000 -64.0
+{ -64.0
+    107.2500     41.5000 -64.0
+    106.5000     42.2500 -64.0
+    104.5000     42.2500 -64.0
+    101.2500     43.5000 -64.0
+     94.5000     46.2500 -64.0
+     91.5000     49.2500 -64.0
+     87.5000     55.2500 -64.0
+     85.5000     56.2500 -64.0
+     70.2500     71.5000 -64.0
+     69.2500     76.5000 -64.0
+     68.2500     78.5000 -64.0
+     67.2500     85.5000 -64.0
+     64.2500     91.5000 -64.0
+     63.2500     96.5000 -64.0
+     63.7500     97.5000 -64.0
+     65.7500     93.5000 -64.0
+     67.5000     89.7500 -64.0
+     69.5000     88.7500 -64.0
+     77.7500     80.5000 -64.0
+     78.7500     78.5000 -64.0
+     76.5000     79.2500 -64.0
+     72.5000     82.2500 -64.0
+     70.7500     81.5000 -64.0
+     70.7500     78.5000 -64.0
+     74.7500     70.5000 -64.0
+     77.5000     66.7500 -64.0
+     82.7500     62.5000 -64.0
+     96.5000     47.7500 -64.0
+     98.5000     47.7500 -64.0
+    100.2500     48.5000 -64.0
+    100.2500     51.5000 -64.0
+     91.2500     61.5000 -64.0
+     89.2500     65.5000 -64.0
+     84.2500     70.5000 -64.0
+     83.2500     72.5000 -64.0
+     84.5000     72.7500 -64.0
+     90.7500     67.5000 -64.0
+     91.7500     65.5000 -64.0
+    105.5000     51.7500 -64.0
+    111.5000     49.7500 -64.0
+    116.5000     51.7500 -64.0
+    126.2500     61.5000 -64.0
+    127.2500     63.5000 -64.0
+    137.2500     74.5000 -64.0
+    138.2500     76.5000 -64.0
+    146.2500     87.5000 -64.0
+    147.2500     89.5000 -64.0
+    149.2500     90.5000 -64.0
+    150.5000     89.7500 -64.0
+    150.7500     79.5000 -64.0
+    149.7500     77.5000 -64.0
+    149.7500     74.5000 -64.0
+    145.7500     68.5000 -64.0
+    144.7500     66.5000 -64.0
+    136.5000     58.2500 -64.0
+    134.5000     57.2500 -64.0
+    132.7500     53.5000 -64.0
+    129.7500     49.5000 -64.0
+    124.5000     46.2500 -64.0
+    115.7500     41.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500    115.5000 -64.0
+    113.5000    119.2500 -64.0
+    110.5000    119.2500 -64.0
+    104.5000    121.2500 -64.0
+    101.5000    120.2500 -64.0
+     99.2500    126.5000 -64.0
+    100.2500    128.5000 -64.0
+    102.5000    128.7500 -64.0
+    104.5000    123.7500 -64.0
+    108.5000    121.7500 -64.0
+    110.2500    122.5000 -64.0
+    110.2500    124.5000 -64.0
+    108.5000    126.2500 -64.0
+    105.5000    126.2500 -64.0
+    105.2500    127.5000 -64.0
+    108.5000    127.7500 -64.0
+    110.5000    126.7500 -64.0
+    112.5000    126.7500 -64.0
+    114.5000    124.7500 -64.0
+    115.2500    126.5000 -64.0
+    116.5000    126.7500 -64.0
+    119.5000    123.7500 -64.0
+    120.2500    124.5000 -64.0
+    121.5000    123.7500 -64.0
+    121.7500    120.5000 -64.0
+    120.7500    117.5000 -64.0
+    119.5000    117.2500 -64.0
+    117.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+    128.2500    128.5000 -64.0
+    125.2500    130.5000 -64.0
+    128.5000    130.7500 -64.0
+    130.2500    132.5000 -64.0
+    136.5000    132.7500 -64.0
+    136.7500    131.5000 -64.0
+    130.5000    131.2500 -64.0
+} -64.0
+{ -64.0
+     87.2500    131.5000 -64.0
+     86.2500    133.5000 -64.0
+     87.5000    133.7500 -64.0
+     90.5000    132.7500 -64.0
+     92.2500    135.5000 -64.0
+     96.2500    136.5000 -64.0
+     97.2500    138.5000 -64.0
+    103.2500    143.5000 -64.0
+    108.2500    144.5000 -64.0
+    109.2500    146.5000 -64.0
+    107.5000    148.2500 -64.0
+    104.5000    147.2500 -64.0
+    100.7500    143.5000 -64.0
+     98.5000    143.2500 -64.0
+    101.5000    146.7500 -64.0
+    105.2500    149.5000 -64.0
+    108.5000    149.7500 -64.0
+    111.5000    148.7500 -64.0
+    114.5000    149.7500 -64.0
+    115.5000    147.7500 -64.0
+    115.5000    145.2500 -64.0
+    111.5000    143.2500 -64.0
+    102.5000    141.2500 -64.0
+     98.7500    137.5000 -64.0
+     97.7500    135.5000 -64.0
+     90.7500    131.5000 -64.0
+} -64.0
+{ -64.0
+    124.2500    132.5000 -64.0
+    123.5000    133.2500 -64.0
+    123.2500    135.5000 -64.0
+    118.5000    140.7500 -64.0
+    122.5000    138.7500 -64.0
+    122.7500    137.5000 -64.0
+    124.5000    135.7500 -64.0
+    124.7500    133.5000 -64.0
+} -64.0
+{ -64.0
+    126.2500    138.5000 -64.0
+    122.5000    144.2500 -64.0
+    120.5000    145.2500 -64.0
+    120.2500    146.5000 -64.0
+    122.5000    146.7500 -64.0
+    126.7500    139.5000 -64.0
+} -64.0
+{ -64.0
+    107.7500     43.5000 -64.0
+    108.5000     42.7500 -64.0
+    112.5000     42.7500 -64.0
+    126.5000     49.7500 -64.0
+    129.2500     52.5000 -64.0
+    132.2500     56.5000 -64.0
+    133.2500     58.5000 -64.0
+    139.5000     64.7500 -64.0
+    144.2500     71.5000 -64.0
+    147.2500     76.5000 -64.0
+    147.2500     79.5000 -64.0
+    146.5000     81.2500 -64.0
+    143.5000     80.2500 -64.0
+    140.7500     77.5000 -64.0
+    139.7500     75.5000 -64.0
+    133.7500     68.5000 -64.0
+    133.7500     66.5000 -64.0
+    131.7500     64.5000 -64.0
+    128.7500     60.5000 -64.0
+    126.7500     56.5000 -64.0
+    125.5000     56.2500 -64.0
+    124.7500     54.5000 -64.0
+    120.7500     50.5000 -64.0
+    115.5000     47.2500 -64.0
+    108.5000     46.2500 -64.0
+    106.5000     48.2500 -64.0
+    104.5000     48.2500 -64.0
+    102.7500     47.5000 -64.0
+    102.7500     45.5000 -64.0
+} -64.0
+v 148 z -182.000000 -64.0
+{ -64.0
+    109.2500     40.5000 -64.0
+    108.5000     41.2500 -64.0
+    106.2500     41.5000 -64.0
+     93.5000     47.2500 -64.0
+     90.2500     51.5000 -64.0
+     89.2500     53.5000 -64.0
+     90.5000     53.7500 -64.0
+     98.5000     47.7500 -64.0
+    101.5000     47.7500 -64.0
+    101.7500     46.5000 -64.0
+    104.5000     44.7500 -64.0
+    108.5000     42.7500 -64.0
+    113.5000     42.7500 -64.0
+    115.2500     43.5000 -64.0
+    120.2500     46.5000 -64.0
+    127.2500     50.5000 -64.0
+    130.2500     54.5000 -64.0
+    132.7500     54.5000 -64.0
+    130.7500     50.5000 -64.0
+    124.5000     46.2500 -64.0
+    113.7500     40.5000 -64.0
+} -64.0
+{ -64.0
+    109.2500     47.5000 -64.0
+    108.5000     48.2500 -64.0
+    106.5000     48.2500 -64.0
+    102.5000     50.2500 -64.0
+    100.5000     50.2500 -64.0
+    100.2500     51.5000 -64.0
+     97.2500     54.5000 -64.0
+     95.2500     58.5000 -64.0
+     91.2500     61.5000 -64.0
+     90.2500     63.5000 -64.0
+     85.2500     68.5000 -64.0
+     83.2500     72.5000 -64.0
+     89.5000     66.7500 -64.0
+     91.5000     65.7500 -64.0
+     96.5000     59.7500 -64.0
+    104.5000     53.7500 -64.0
+    109.5000     50.7500 -64.0
+    111.5000     50.7500 -64.0
+    119.5000     54.7500 -64.0
+    133.5000     68.7500 -64.0
+    138.2500     75.5000 -64.0
+    139.2500     77.5000 -64.0
+    145.2500     83.5000 -64.0
+    146.2500     85.5000 -64.0
+    148.5000     85.7500 -64.0
+    149.5000     83.7500 -64.0
+    149.7500     76.5000 -64.0
+    144.7500     66.5000 -64.0
+    139.7500     61.5000 -64.0
+    138.7500     59.5000 -64.0
+    136.5000     57.2500 -64.0
+    134.5000     56.2500 -64.0
+    134.2500     57.5000 -64.0
+    135.2500     60.5000 -64.0
+    139.2500     64.5000 -64.0
+    145.2500     72.5000 -64.0
+    145.2500     75.5000 -64.0
+    144.5000     77.2500 -64.0
+    142.5000     77.2500 -64.0
+    134.7500     68.5000 -64.0
+    133.7500     66.5000 -64.0
+    127.7500     59.5000 -64.0
+    127.7500     57.5000 -64.0
+    124.5000     54.2500 -64.0
+    120.7500     51.5000 -64.0
+    114.7500     47.5000 -64.0
+} -64.0
+{ -64.0
+     87.2500     55.5000 -64.0
+     85.5000     56.2500 -64.0
+     79.5000     62.2500 -64.0
+     77.5000     63.2500 -64.0
+     70.5000     72.2500 -64.0
+     69.2500     83.5000 -64.0
+     70.2500     85.5000 -64.0
+     72.5000     84.7500 -64.0
+     80.7500     76.5000 -64.0
+     81.7500     74.5000 -64.0
+     80.5000     74.2500 -64.0
+     76.5000     78.2500 -64.0
+     72.7500     77.5000 -64.0
+     72.7500     75.5000 -64.0
+     75.7500     69.5000 -64.0
+     87.7500     57.5000 -64.0
+     88.7500     55.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500    113.5000 -64.0
+    113.2500    116.5000 -64.0
+    115.2500    117.5000 -64.0
+    114.5000    119.2500 -64.0
+    112.5000    119.2500 -64.0
+    110.5000    125.2500 -64.0
+    111.2500    126.5000 -64.0
+    114.5000    126.7500 -64.0
+    118.5000    123.7500 -64.0
+    120.5000    124.7500 -64.0
+    122.5000    123.7500 -64.0
+    121.7500    122.5000 -64.0
+    121.7500    118.5000 -64.0
+    118.5000    118.2500 -64.0
+    116.7500    114.5000 -64.0
+} -64.0
+{ -64.0
+     98.2500    124.5000 -64.0
+     99.2500    127.5000 -64.0
+    100.5000    125.7500 -64.0
+     99.7500    124.5000 -64.0
+} -64.0
+{ -64.0
+    128.2500    126.5000 -64.0
+    124.5000    129.2500 -64.0
+    124.2500    133.5000 -64.0
+    123.2500    136.5000 -64.0
+    120.5000    140.2500 -64.0
+    120.2500    143.5000 -64.0
+    122.5000    143.7500 -64.0
+    128.5000    135.2500 -64.0
+    126.5000    136.2500 -64.0
+    125.7500    134.5000 -64.0
+    126.5000    132.7500 -64.0
+    128.5000    132.7500 -64.0
+    132.5000    134.7500 -64.0
+    134.5000    133.7500 -64.0
+    132.7500    131.5000 -64.0
+    127.5000    131.2500 -64.0
+    126.7500    129.5000 -64.0
+    129.7500    126.5000 -64.0
+} -64.0
+{ -64.0
+    101.2500    127.5000 -64.0
+    100.2500    128.5000 -64.0
+    103.5000    128.7500 -64.0
+    103.7500    127.5000 -64.0
+} -64.0
+{ -64.0
+     89.2500    133.5000 -64.0
+     87.5000    134.2500 -64.0
+     88.2500    135.5000 -64.0
+     88.2500    138.5000 -64.0
+     89.5000    138.7500 -64.0
+     90.5000    136.7500 -64.0
+     92.5000    135.7500 -64.0
+     95.5000    136.7500 -64.0
+     98.2500    140.5000 -64.0
+     97.2500    143.5000 -64.0
+    104.2500    147.5000 -64.0
+    106.5000    147.7500 -64.0
+    108.5000    146.7500 -64.0
+    110.5000    146.7500 -64.0
+    114.5000    148.7500 -64.0
+    114.7500    146.5000 -64.0
+    113.7500    144.5000 -64.0
+    110.5000    144.2500 -64.0
+    106.5000    142.2500 -64.0
+    101.5000    141.2500 -64.0
+     99.5000    139.2500 -64.0
+     97.7500    134.5000 -64.0
+     95.7500    133.5000 -64.0
+} -64.0
+v 148 z -184.000000 -64.0
+{ -64.0
+    108.2500     40.5000 -64.0
+     94.5000     47.2500 -64.0
+     80.5000     61.2500 -64.0
+     78.5000     62.2500 -64.0
+     71.5000     72.2500 -64.0
+     71.2500     80.5000 -64.0
+     72.5000     81.7500 -64.0
+     75.5000     80.7500 -64.0
+     84.7500     71.5000 -64.0
+     85.7500     69.5000 -64.0
+     97.5000     58.7500 -64.0
+    108.5000     51.7500 -64.0
+    112.5000     51.7500 -64.0
+    117.5000     53.7500 -64.0
+    123.5000     57.7500 -64.0
+    131.5000     65.7500 -64.0
+    139.2500     76.5000 -64.0
+    145.2500     81.5000 -64.0
+    147.5000     81.7500 -64.0
+    148.5000     79.7500 -64.0
+    148.7500     76.5000 -64.0
+    147.7500     74.5000 -64.0
+    147.7500     72.5000 -64.0
+    142.7500     63.5000 -64.0
+    132.7500     53.5000 -64.0
+    131.5000     51.2500 -64.0
+    114.7500     40.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500    114.5000 -64.0
+    114.2500    118.5000 -64.0
+    107.5000    124.2500 -64.0
+    103.5000    124.2500 -64.0
+    103.2500    125.5000 -64.0
+    105.2500    127.5000 -64.0
+    100.5000    129.2500 -64.0
+     98.5000    127.2500 -64.0
+     98.2500    130.5000 -64.0
+     99.5000    130.7500 -64.0
+    103.5000    128.7500 -64.0
+    105.5000    128.7500 -64.0
+    107.5000    127.7500 -64.0
+    109.5000    128.7500 -64.0
+    112.7500    127.5000 -64.0
+    107.7500    126.5000 -64.0
+    113.5000    123.7500 -64.0
+    115.5000    123.7500 -64.0
+    116.7500    121.5000 -64.0
+    115.7500    119.5000 -64.0
+    116.5000    117.7500 -64.0
+} -64.0
+{ -64.0
+    120.2500    120.5000 -64.0
+    119.5000    121.2500 -64.0
+    120.2500    122.5000 -64.0
+    116.2500    125.5000 -64.0
+    122.5000    126.7500 -64.0
+    124.2500    129.5000 -64.0
+    124.5000    135.7500 -64.0
+    126.5000    136.7500 -64.0
+    132.5000    133.7500 -64.0
+    132.7500    132.5000 -64.0
+    128.5000    132.2500 -64.0
+    126.7500    130.5000 -64.0
+    125.7500    128.5000 -64.0
+    127.5000    126.7500 -64.0
+    130.5000    126.7500 -64.0
+    134.5000    128.7500 -64.0
+    134.7500    127.5000 -64.0
+    130.7500    125.5000 -64.0
+    127.5000    125.2500 -64.0
+    124.5000    124.2500 -64.0
+    121.7500    120.5000 -64.0
+} -64.0
+{ -64.0
+     96.2500    124.5000 -64.0
+     97.2500    125.5000 -64.0
+     97.7500    124.5000 -64.0
+} -64.0
+{ -64.0
+     91.2500    133.5000 -64.0
+     88.5000    135.2500 -64.0
+     88.2500    139.5000 -64.0
+     92.5000    135.7500 -64.0
+     94.5000    135.7500 -64.0
+     96.2500    137.5000 -64.0
+     98.2500    141.5000 -64.0
+     95.5000    143.2500 -64.0
+     98.2500    144.5000 -64.0
+    109.5000    145.7500 -64.0
+    113.2500    148.5000 -64.0
+    115.5000    148.7500 -64.0
+    115.7500    144.5000 -64.0
+    110.5000    145.2500 -64.0
+    104.7500    141.5000 -64.0
+    100.5000    141.2500 -64.0
+     97.7500    138.5000 -64.0
+     98.5000    137.7500 -64.0
+     98.7500    135.5000 -64.0
+     97.7500    133.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500    137.5000 -64.0
+    120.5000    139.2500 -64.0
+    121.5000    139.7500 -64.0
+    123.7500    137.5000 -64.0
+} -64.0
+{ -64.0
+    118.2500    140.5000 -64.0
+    117.5000    141.2500 -64.0
+    118.5000    141.7500 -64.0
+    119.7500    140.5000 -64.0
+} -64.0
+{ -64.0
+    107.7500     43.5000 -64.0
+    108.5000     42.7500 -64.0
+    110.5000     42.7500 -64.0
+    112.2500     43.5000 -64.0
+    113.5000     42.7500 -64.0
+    117.5000     44.7500 -64.0
+    119.2500     45.5000 -64.0
+    125.2500     49.5000 -64.0
+    131.2500     54.5000 -64.0
+    133.2500     58.5000 -64.0
+    134.5000     58.7500 -64.0
+    135.2500     60.5000 -64.0
+    139.2500     64.5000 -64.0
+    142.2500     69.5000 -64.0
+    143.2500     71.5000 -64.0
+    142.5000     73.2500 -64.0
+    140.5000     73.2500 -64.0
+    136.7500     69.5000 -64.0
+    135.7500     67.5000 -64.0
+    127.7500     58.5000 -64.0
+    127.7500     56.5000 -64.0
+    125.7500     54.5000 -64.0
+    118.5000     50.2500 -64.0
+    112.5000     47.2500 -64.0
+    110.5000     48.2500 -64.0
+    108.5000     48.2500 -64.0
+    106.5000     49.2500 -64.0
+    103.5000     49.2500 -64.0
+    101.5000     51.2500 -64.0
+     98.5000     51.2500 -64.0
+     98.2500     52.5000 -64.0
+     96.5000     54.2500 -64.0
+     96.2500     56.5000 -64.0
+     92.2500     60.5000 -64.0
+     91.2500     62.5000 -64.0
+     85.2500     67.5000 -64.0
+     84.2500     69.5000 -64.0
+     77.5000     75.2500 -64.0
+     75.7500     74.5000 -64.0
+     75.7500     70.5000 -64.0
+     77.7500     68.5000 -64.0
+     78.7500     66.5000 -64.0
+     89.7500     55.5000 -64.0
+     92.5000     51.7500 -64.0
+     94.5000     50.7500 -64.0
+     98.5000     47.7500 -64.0
+    103.5000     44.7500 -64.0
+    106.7500     45.5000 -64.0
+} -64.0
+v 122 z -186.000000 -64.0
+{ -64.0
+    110.2500     39.5000 -64.0
+     94.5000     47.2500 -64.0
+     78.5000     63.2500 -64.0
+     72.2500     73.5000 -64.0
+     74.2500     77.5000 -64.0
+     76.5000     77.7500 -64.0
+     82.5000     73.7500 -64.0
+     92.5000     62.7500 -64.0
+     99.5000     56.7500 -64.0
+    107.5000     52.7500 -64.0
+    113.5000     52.7500 -64.0
+    119.5000     54.7500 -64.0
+    126.2500     59.5000 -64.0
+    133.2500     68.5000 -64.0
+    142.2500     77.5000 -64.0
+    144.5000     77.7500 -64.0
+    146.5000     76.7500 -64.0
+    146.7500     73.5000 -64.0
+    145.7500     71.5000 -64.0
+    145.7500     69.5000 -64.0
+    139.7500     59.5000 -64.0
+    129.5000     49.2500 -64.0
+    123.5000     46.2500 -64.0
+    120.7500     43.5000 -64.0
+    113.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+    114.2500    114.5000 -64.0
+    112.5000    116.2500 -64.0
+    114.2500    117.5000 -64.0
+    115.5000    116.7500 -64.0
+    115.7500    114.5000 -64.0
+} -64.0
+{ -64.0
+    101.2500    118.5000 -64.0
+    101.2500    119.5000 -64.0
+    102.5000    119.7500 -64.0
+    102.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+    121.2500    121.5000 -64.0
+    121.2500    123.5000 -64.0
+    116.5000    125.2500 -64.0
+    117.2500    126.5000 -64.0
+    120.5000    126.7500 -64.0
+    123.2500    129.5000 -64.0
+    123.2500    133.5000 -64.0
+    122.2500    136.5000 -64.0
+    114.5000    143.2500 -64.0
+    110.5000    143.2500 -64.0
+    102.5000    140.2500 -64.0
+     99.7500    137.5000 -64.0
+     99.7500    132.5000 -64.0
+    103.5000    129.7500 -64.0
+    104.5000    128.2500 -64.0
+    102.5000    129.2500 -64.0
+     99.5000    129.2500 -64.0
+     96.2500    131.5000 -64.0
+     91.5000    133.2500 -64.0
+     88.5000    138.2500 -64.0
+     88.2500    141.5000 -64.0
+     89.5000    141.7500 -64.0
+     90.7500    137.5000 -64.0
+     94.5000    134.7500 -64.0
+     96.5000    135.7500 -64.0
+    101.2500    142.5000 -64.0
+    100.5000    143.2500 -64.0
+    104.2500    145.5000 -64.0
+    108.5000    145.7500 -64.0
+    114.5000    149.7500 -64.0
+    114.7500    148.5000 -64.0
+    116.5000    147.7500 -64.0
+    126.5000    135.7500 -64.0
+    131.5000    134.7500 -64.0
+    131.7500    133.5000 -64.0
+    127.5000    133.2500 -64.0
+    125.7500    131.5000 -64.0
+    125.7500    128.5000 -64.0
+    122.7500    125.5000 -64.0
+    123.5000    124.7500 -64.0
+    125.5000    125.7500 -64.0
+    126.7500    124.5000 -64.0
+    122.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+    107.7500     43.5000 -64.0
+    108.5000     42.7500 -64.0
+    110.5000     42.7500 -64.0
+    112.2500     43.5000 -64.0
+    111.5000     44.2500 -64.0
+    111.2500     46.5000 -64.0
+    107.5000     49.2500 -64.0
+    103.5000     49.2500 -64.0
+    103.2500     50.5000 -64.0
+     96.5000     54.2500 -64.0
+     96.2500     56.5000 -64.0
+     94.5000     57.2500 -64.0
+     94.2500     58.5000 -64.0
+     92.5000     60.2500 -64.0
+     90.5000     61.2500 -64.0
+     83.5000     68.2500 -64.0
+     79.5000     71.2500 -64.0
+     78.7500     69.5000 -64.0
+     79.7500     66.5000 -64.0
+     89.5000     55.7500 -64.0
+     99.5000     46.7500 -64.0
+    101.5000     46.7500 -64.0
+    103.5000     44.7500 -64.0
+    105.2500     45.5000 -64.0
+} -64.0
+{ -64.0
+    113.7500     43.5000 -64.0
+    114.5000     42.7500 -64.0
+    115.5000     43.7500 -64.0
+    119.5000     45.7500 -64.0
+    126.2500     50.5000 -64.0
+    126.2500     52.5000 -64.0
+    128.5000     52.7500 -64.0
+    134.2500     58.5000 -64.0
+    137.2500     62.5000 -64.0
+    140.2500     67.5000 -64.0
+    139.5000     69.2500 -64.0
+    137.5000     67.2500 -64.0
+    135.5000     66.2500 -64.0
+    134.7500     64.5000 -64.0
+    130.7500     60.5000 -64.0
+    129.7500     58.5000 -64.0
+    128.5000     58.2500 -64.0
+    127.7500     56.5000 -64.0
+    125.5000     54.2500 -64.0
+    119.5000     51.2500 -64.0
+    113.7500     46.5000 -64.0
+} -64.0
+v 113 z -188.000000 -64.0
+{ -64.0
+    109.2500     39.5000 -64.0
+     93.5000     48.2500 -64.0
+     82.2500     59.5000 -64.0
+     75.5000     69.2500 -64.0
+     75.5000     73.7500 -64.0
+     77.5000     74.7500 -64.0
+     82.5000     72.7500 -64.0
+     89.7500     65.5000 -64.0
+     90.7500     63.5000 -64.0
+     92.5000     62.7500 -64.0
+     97.5000     57.7500 -64.0
+    107.5000     52.7500 -64.0
+    114.5000     52.7500 -64.0
+    124.5000     56.7500 -64.0
+    125.2500     58.5000 -64.0
+    137.5000     71.7500 -64.0
+    141.2500     74.5000 -64.0
+    143.5000     74.7500 -64.0
+    144.7500     70.5000 -64.0
+    142.7500     66.5000 -64.0
+    142.7500     64.5000 -64.0
+    138.7500     58.5000 -64.0
+    128.5000     48.2500 -64.0
+    114.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+    109.2500    114.5000 -64.0
+    108.5000    115.2500 -64.0
+    105.2500    115.5000 -64.0
+    108.5000    115.7500 -64.0
+    110.5000    114.7500 -64.0
+    111.2500    115.5000 -64.0
+    114.5000    115.7500 -64.0
+    114.7500    114.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500    122.5000 -64.0
+    122.5000    123.7500 -64.0
+    126.2500    125.5000 -64.0
+    128.7500    124.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500    124.5000 -64.0
+    119.5000    125.2500 -64.0
+    116.5000    125.2500 -64.0
+    115.2500    126.5000 -64.0
+    119.5000    126.7500 -64.0
+    123.2500    129.5000 -64.0
+    123.2500    135.5000 -64.0
+    120.5000    139.2500 -64.0
+    122.2500    140.5000 -64.0
+    121.5000    141.2500 -64.0
+    118.5000    146.2500 -64.0
+    118.2500    149.5000 -64.0
+    122.7500    140.5000 -64.0
+    127.5000    135.7500 -64.0
+    129.5000    135.7500 -64.0
+    132.7500    134.5000 -64.0
+    129.5000    134.2500 -64.0
+    125.7500    132.5000 -64.0
+    125.7500    129.5000 -64.0
+} -64.0
+{ -64.0
+    103.2500    128.5000 -64.0
+     99.2500    130.5000 -64.0
+     97.2500    134.5000 -64.0
+     99.2500    138.5000 -64.0
+     98.5000    139.2500 -64.0
+     98.2500    142.5000 -64.0
+    100.2500    144.5000 -64.0
+    108.5000    146.7500 -64.0
+    112.2500    149.5000 -64.0
+    113.5000    148.7500 -64.0
+    110.7500    145.5000 -64.0
+    111.5000    144.7500 -64.0
+    117.5000    143.7500 -64.0
+    119.7500    140.5000 -64.0
+    118.5000    140.2500 -64.0
+    114.5000    143.2500 -64.0
+    109.5000    143.2500 -64.0
+    101.5000    139.2500 -64.0
+     99.7500    136.5000 -64.0
+    100.5000    132.7500 -64.0
+    105.7500    128.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500    132.5000 -64.0
+     89.5000    133.2500 -64.0
+     90.2500    135.5000 -64.0
+     89.5000    137.2500 -64.0
+     89.2500    142.5000 -64.0
+     90.5000    142.7500 -64.0
+     90.7500    140.5000 -64.0
+     91.7500    138.5000 -64.0
+     90.7500    136.5000 -64.0
+     90.7500    133.5000 -64.0
+     92.7500    132.5000 -64.0
+} -64.0
+{ -64.0
+    107.7500     43.5000 -64.0
+    109.5000     42.7500 -64.0
+    110.2500     44.5000 -64.0
+    109.5000     46.2500 -64.0
+    110.2500     47.5000 -64.0
+    102.5000     51.2500 -64.0
+    100.5000     51.2500 -64.0
+     84.5000     65.2500 -64.0
+     83.7500     64.5000 -64.0
+     85.7500     60.5000 -64.0
+     97.5000     48.7500 -64.0
+    103.5000     44.7500 -64.0
+    107.5000     45.7500 -64.0
+} -64.0
+{ -64.0
+    119.5000     46.7500 -64.0
+    121.5000     46.7500 -64.0
+    125.2500     49.5000 -64.0
+    125.2500     51.5000 -64.0
+    123.5000     52.2500 -64.0
+    120.5000     51.2500 -64.0
+    117.7500     48.5000 -64.0
+} -64.0
+{ -64.0
+    128.5000     52.7500 -64.0
+    136.2500     61.5000 -64.0
+    135.5000     63.2500 -64.0
+    132.7500     61.5000 -64.0
+    131.7500     59.5000 -64.0
+    126.7500     54.5000 -64.0
+} -64.0
+v 98 z -190.000000 -64.0
+{ -64.0
+    108.2500     39.5000 -64.0
+    100.5000     43.2500 -64.0
+     94.5000     47.2500 -64.0
+     84.5000     57.2500 -64.0
+     79.2500     65.5000 -64.0
+     78.2500     70.5000 -64.0
+     79.5000     71.7500 -64.0
+     81.5000     70.7500 -64.0
+     83.5000     70.7500 -64.0
+     98.5000     56.7500 -64.0
+    103.5000     53.7500 -64.0
+    105.5000     53.7500 -64.0
+    109.5000     51.7500 -64.0
+    111.2500     52.5000 -64.0
+    113.5000     51.7500 -64.0
+    123.5000     55.7500 -64.0
+    134.5000     67.7500 -64.0
+    138.2500     70.5000 -64.0
+    141.5000     70.7500 -64.0
+    141.7500     66.5000 -64.0
+    137.7500     58.5000 -64.0
+    130.7500     49.5000 -64.0
+    129.5000     49.2500 -64.0
+    126.7500     46.5000 -64.0
+    115.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500    122.5000 -64.0
+    115.2500    126.5000 -64.0
+    119.5000    126.7500 -64.0
+    122.5000    127.7500 -64.0
+    124.2500    131.5000 -64.0
+    123.2500    136.5000 -64.0
+    119.5000    140.2500 -64.0
+    113.5000    144.2500 -64.0
+    108.5000    143.2500 -64.0
+    102.7500    140.5000 -64.0
+     99.7500    136.5000 -64.0
+     99.7500    133.5000 -64.0
+    104.7500    129.5000 -64.0
+    100.5000    129.2500 -64.0
+     96.5000    133.2500 -64.0
+     92.5000    133.2500 -64.0
+     89.5000    134.2500 -64.0
+     89.2500    142.5000 -64.0
+     91.2500    144.5000 -64.0
+     92.7500    144.5000 -64.0
+     90.7500    140.5000 -64.0
+     90.7500    135.5000 -64.0
+     92.5000    134.7500 -64.0
+     97.5000    136.7500 -64.0
+     98.2500    138.5000 -64.0
+    101.2500    141.5000 -64.0
+     95.2500    144.5000 -64.0
+    103.5000    144.7500 -64.0
+    101.7500    142.5000 -64.0
+    102.5000    141.7500 -64.0
+    108.2500    144.5000 -64.0
+    115.5000    144.7500 -64.0
+    119.5000    141.7500 -64.0
+    121.2500    142.5000 -64.0
+    118.5000    148.2500 -64.0
+    118.5000    149.7500 -64.0
+    121.5000    145.7500 -64.0
+    121.7500    141.5000 -64.0
+    126.5000    136.7500 -64.0
+    132.7500    135.5000 -64.0
+    126.5000    135.2500 -64.0
+    124.5000    137.2500 -64.0
+    123.7500    136.5000 -64.0
+    125.5000    133.7500 -64.0
+    125.7500    130.5000 -64.0
+    129.7500    124.5000 -64.0
+    123.5000    124.2500 -64.0
+    121.7500    122.5000 -64.0
+} -64.0
+{ -64.0
+    104.2500    145.5000 -64.0
+    106.2500    146.5000 -64.0
+    106.7500    145.5000 -64.0
+} -64.0
+{ -64.0
+    107.2500    147.5000 -64.0
+    113.7500    151.5000 -64.0
+    112.7500    148.5000 -64.0
+    110.7500    147.5000 -64.0
+} -64.0
+{ -64.0
+    103.7500     45.5000 -64.0
+    105.5000     44.7500 -64.0
+    107.2500     47.5000 -64.0
+    103.5000     50.2500 -64.0
+     97.5000     52.2500 -64.0
+     92.5000     56.2500 -64.0
+     91.7500     55.5000 -64.0
+     93.7500     52.5000 -64.0
+     99.5000     47.7500 -64.0
+} -64.0
+{ -64.0
+    113.7500     46.5000 -64.0
+    114.5000     45.7500 -64.0
+    115.2500     46.5000 -64.0
+    114.5000     47.2500 -64.0
+} -64.0
+{ -64.0
+    119.7500     47.5000 -64.0
+    121.5000     46.7500 -64.0
+    125.2500     49.5000 -64.0
+    124.5000     51.2500 -64.0
+    122.5000     51.2500 -64.0
+} -64.0
+v 100 z -192.000000 -64.0
+{ -64.0
+    107.2500     39.5000 -64.0
+    102.5000     41.2500 -64.0
+     95.5000     46.2500 -64.0
+     88.5000     53.2500 -64.0
+     82.2500     63.5000 -64.0
+     81.5000     66.7500 -64.0
+     83.5000     67.7500 -64.0
+     86.5000     66.7500 -64.0
+     99.5000     55.7500 -64.0
+    109.5000     50.7500 -64.0
+    113.5000     50.7500 -64.0
+    121.5000     53.7500 -64.0
+    136.2500     67.5000 -64.0
+    138.5000     67.7500 -64.0
+    138.7500     62.5000 -64.0
+    134.7500     54.5000 -64.0
+    130.7500     50.5000 -64.0
+    129.5000     48.2500 -64.0
+    121.5000     42.2500 -64.0
+    115.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+    117.2500    119.5000 -64.0
+    117.2500    121.5000 -64.0
+    115.2500    122.5000 -64.0
+    114.2500    124.5000 -64.0
+    116.2500    125.5000 -64.0
+    115.5000    127.2500 -64.0
+    116.5000    127.7500 -64.0
+    122.5000    125.7500 -64.0
+    120.5000    121.2500 -64.0
+} -64.0
+{ -64.0
+    132.2500    121.5000 -64.0
+    131.2500    123.5000 -64.0
+    125.5000    126.2500 -64.0
+    124.2500    134.5000 -64.0
+    120.2500    140.5000 -64.0
+    118.5000    141.2500 -64.0
+    115.5000    144.2500 -64.0
+    109.5000    144.2500 -64.0
+    101.7500    140.5000 -64.0
+     97.7500    134.5000 -64.0
+     93.5000    134.2500 -64.0
+     91.7500    133.5000 -64.0
+     90.7500    131.5000 -64.0
+     89.2500    130.5000 -64.0
+     91.2500    136.5000 -64.0
+     97.5000    137.7500 -64.0
+    100.2500    140.5000 -64.0
+    101.2500    142.5000 -64.0
+     98.5000    144.2500 -64.0
+     92.5000    144.2500 -64.0
+     90.7500    140.5000 -64.0
+     88.5000    138.2500 -64.0
+     88.2500    141.5000 -64.0
+     91.2500    144.5000 -64.0
+    102.5000    144.7500 -64.0
+    104.2500    145.5000 -64.0
+    105.2500    147.5000 -64.0
+    107.2500    148.5000 -64.0
+    112.5000    148.7500 -64.0
+    111.7500    147.5000 -64.0
+    109.5000    147.2500 -64.0
+    102.7500    143.5000 -64.0
+    103.5000    142.7500 -64.0
+    113.2500    146.5000 -64.0
+    117.5000    144.7500 -64.0
+    120.5000    141.7500 -64.0
+    121.2500    142.5000 -64.0
+    119.2500    146.5000 -64.0
+    120.5000    146.7500 -64.0
+    123.5000    141.7500 -64.0
+    123.7500    139.5000 -64.0
+    125.5000    137.7500 -64.0
+    128.5000    137.7500 -64.0
+    129.7500    136.5000 -64.0
+    127.5000    136.2500 -64.0
+    125.5000    137.2500 -64.0
+    124.7500    135.5000 -64.0
+    129.7500    125.5000 -64.0
+    133.5000    123.7500 -64.0
+} -64.0
+{ -64.0
+    100.2500    128.5000 -64.0
+     99.2500    130.5000 -64.0
+    104.5000    130.7500 -64.0
+    104.7500    129.5000 -64.0
+} -64.0
+{ -64.0
+    110.2500    129.5000 -64.0
+    109.2500    130.5000 -64.0
+    111.5000    130.7500 -64.0
+    111.7500    129.5000 -64.0
+} -64.0
+{ -64.0
+    112.7500     43.5000 -64.0
+    113.5000     42.7500 -64.0
+    115.2500     44.5000 -64.0
+    114.5000     46.2500 -64.0
+    113.7500     45.5000 -64.0
+} -64.0
+{ -64.0
+    102.7500     45.5000 -64.0
+    104.5000     44.7500 -64.0
+    106.2500     46.5000 -64.0
+    101.5000     49.2500 -64.0
+     99.7500     48.5000 -64.0
+} -64.0
+{ -64.0
+    115.7500     45.5000 -64.0
+    116.5000     44.7500 -64.0
+    118.2500     45.5000 -64.0
+    117.5000     47.2500 -64.0
+} -64.0
+v 87 z -194.000000 -64.0
+{ -64.0
+    105.2500     39.5000 -64.0
+    101.5000     41.2500 -64.0
+     90.5000     52.2500 -64.0
+     86.5000     59.2500 -64.0
+     86.2500     63.5000 -64.0
+     87.5000     63.7500 -64.0
+     99.5000     54.7500 -64.0
+    109.5000     49.7500 -64.0
+    114.5000     49.7500 -64.0
+    121.5000     52.7500 -64.0
+    132.2500     62.5000 -64.0
+    135.5000     62.7500 -64.0
+    135.5000     60.2500 -64.0
+    132.7500     53.5000 -64.0
+    126.7500     45.5000 -64.0
+    122.5000     42.2500 -64.0
+    116.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500    118.5000 -64.0
+    117.2500    120.5000 -64.0
+    115.2500    124.5000 -64.0
+    117.5000    123.7500 -64.0
+    119.2500    124.5000 -64.0
+    118.5000    126.2500 -64.0
+    116.5000    127.2500 -64.0
+    116.2500    128.5000 -64.0
+    117.5000    128.7500 -64.0
+    121.5000    124.7500 -64.0
+    120.7500    121.5000 -64.0
+    119.5000    121.2500 -64.0
+} -64.0
+{ -64.0
+    131.2500    124.5000 -64.0
+    130.5000    125.2500 -64.0
+    128.2500    125.5000 -64.0
+    127.2500    127.5000 -64.0
+    129.2500    128.5000 -64.0
+    130.5000    127.7500 -64.0
+    132.5000    126.7500 -64.0
+} -64.0
+{ -64.0
+    125.2500    130.5000 -64.0
+    125.2500    132.5000 -64.0
+    122.2500    139.5000 -64.0
+    115.5000    145.2500 -64.0
+    108.5000    145.2500 -64.0
+     98.5000    139.2500 -64.0
+    101.2500    142.5000 -64.0
+     95.2500    145.5000 -64.0
+     98.5000    145.7500 -64.0
+    100.5000    144.7500 -64.0
+    106.2500    147.5000 -64.0
+    111.5000    147.7500 -64.0
+    114.7500    150.5000 -64.0
+    113.7500    148.5000 -64.0
+    115.5000    146.7500 -64.0
+    117.2500    147.5000 -64.0
+    117.5000    149.7500 -64.0
+    117.7500    147.5000 -64.0
+    123.5000    143.7500 -64.0
+    124.7500    140.5000 -64.0
+    127.5000    137.7500 -64.0
+    132.5000    137.7500 -64.0
+    135.5000    136.7500 -64.0
+    135.5000    135.2500 -64.0
+    131.5000    137.2500 -64.0
+    129.5000    136.2500 -64.0
+    126.5000    137.2500 -64.0
+    124.7500    136.5000 -64.0
+    126.5000    133.7500 -64.0
+    126.7500    130.5000 -64.0
+} -64.0
+{ -64.0
+     93.2500    137.5000 -64.0
+     92.5000    138.2500 -64.0
+     88.5000    138.2500 -64.0
+     88.2500    142.5000 -64.0
+     89.5000    143.7500 -64.0
+     93.5000    145.7500 -64.0
+     89.7500    141.5000 -64.0
+     90.5000    140.7500 -64.0
+     94.5000    137.7500 -64.0
+     96.7500    137.5000 -64.0
+} -64.0
+{ -64.0
+    115.2500    151.5000 -64.0
+    116.5000    154.7500 -64.0
+    116.7500    151.5000 -64.0
+} -64.0
+{ -64.0
+    110.7500     43.5000 -64.0
+    111.5000     42.7500 -64.0
+    113.2500     43.5000 -64.0
+    112.5000     45.2500 -64.0
+} -64.0
+{ -64.0
+    107.7500     44.5000 -64.0
+    108.5000     43.7500 -64.0
+    109.2500     44.5000 -64.0
+    108.5000     45.2500 -64.0
+} -64.0
+v 81 z -196.000000 -64.0
+{ -64.0
+    105.2500     39.5000 -64.0
+    101.2500     41.5000 -64.0
+     93.5000     51.2500 -64.0
+     90.2500     56.5000 -64.0
+     91.2500     58.5000 -64.0
+     93.5000     57.7500 -64.0
+     99.5000     52.7500 -64.0
+    105.5000     49.7500 -64.0
+    107.5000     49.7500 -64.0
+    109.5000     48.7500 -64.0
+    114.5000     48.7500 -64.0
+    122.5000     51.7500 -64.0
+    129.2500     57.5000 -64.0
+    131.5000     57.7500 -64.0
+    131.5000     56.2500 -64.0
+    128.7500     49.5000 -64.0
+    123.5000     43.2500 -64.0
+    119.7500     40.5000 -64.0
+    114.5000     40.2500 -64.0
+    112.7500     39.5000 -64.0
+} -64.0
+{ -64.0
+    117.2500    119.5000 -64.0
+    117.2500    120.5000 -64.0
+    116.5000    122.2500 -64.0
+    111.5000    125.2500 -64.0
+    112.2500    126.5000 -64.0
+    115.5000    126.7500 -64.0
+    116.2500    128.5000 -64.0
+    115.5000    130.2500 -64.0
+    114.7500    129.5000 -64.0
+    111.5000    129.2500 -64.0
+    107.5000    131.2500 -64.0
+    102.5000    130.2500 -64.0
+    102.5000    131.7500 -64.0
+    111.5000    132.7500 -64.0
+    113.5000    130.7500 -64.0
+    117.5000    130.7500 -64.0
+    119.5000    128.7500 -64.0
+    121.5000    129.7500 -64.0
+    121.7500    128.5000 -64.0
+    120.7500    126.5000 -64.0
+    121.5000    125.7500 -64.0
+    122.5000    122.2500 -64.0
+    118.7500    119.5000 -64.0
+} -64.0
+{ -64.0
+    129.2500    126.5000 -64.0
+    128.2500    128.5000 -64.0
+    125.5000    131.2500 -64.0
+    122.2500    140.5000 -64.0
+    118.5000    144.2500 -64.0
+    114.5000    146.2500 -64.0
+    110.5000    146.2500 -64.0
+    103.5000    143.2500 -64.0
+     96.7500    138.5000 -64.0
+     93.5000    138.2500 -64.0
+     91.5000    137.2500 -64.0
+     88.5000    138.2500 -64.0
+     88.2500    139.5000 -64.0
+     93.2500    140.5000 -64.0
+     92.2500    141.5000 -64.0
+     94.5000    141.7500 -64.0
+     97.5000    140.7500 -64.0
+    100.2500    143.5000 -64.0
+     97.2500    145.5000 -64.0
+    102.5000    145.7500 -64.0
+    106.2500    147.5000 -64.0
+    114.5000    149.7500 -64.0
+    116.2500    153.5000 -64.0
+    117.5000    153.7500 -64.0
+    117.7500    149.5000 -64.0
+    118.5000    147.7500 -64.0
+    125.5000    141.7500 -64.0
+    130.5000    138.7500 -64.0
+    133.5000    138.7500 -64.0
+    133.7500    137.5000 -64.0
+    130.5000    137.2500 -64.0
+    127.5000    138.2500 -64.0
+    125.7500    137.5000 -64.0
+    126.7500    132.5000 -64.0
+    129.5000    129.7500 -64.0
+    131.5000    128.7500 -64.0
+    134.5000    129.7500 -64.0
+    131.7500    126.5000 -64.0
+} -64.0
+v 78 z -198.000000 -64.0
+{ -64.0
+    104.2500     40.5000 -64.0
+    102.2500     41.5000 -64.0
+     98.2500     49.5000 -64.0
+    101.5000     49.7500 -64.0
+    105.5000     47.7500 -64.0
+    114.5000     47.7500 -64.0
+    125.5000     50.7500 -64.0
+    125.7500     49.5000 -64.0
+    123.7500     44.5000 -64.0
+    120.7500     41.5000 -64.0
+    113.5000     41.2500 -64.0
+    111.7500     40.5000 -64.0
+} -64.0
+{ -64.0
+    129.2500    116.5000 -64.0
+    129.2500    117.5000 -64.0
+    130.5000    117.7500 -64.0
+    130.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500    118.5000 -64.0
+    116.2500    119.5000 -64.0
+    117.5000    119.7500 -64.0
+    119.2500    122.5000 -64.0
+    119.2500    126.5000 -64.0
+    116.2500    129.5000 -64.0
+    115.2500    131.5000 -64.0
+    117.5000    131.7500 -64.0
+    120.7500    130.5000 -64.0
+    121.7500    128.5000 -64.0
+    120.7500    126.5000 -64.0
+    122.7500    124.5000 -64.0
+    123.7500    122.5000 -64.0
+    118.7500    118.5000 -64.0
+} -64.0
+{ -64.0
+    112.2500    120.5000 -64.0
+    111.5000    121.2500 -64.0
+    106.5000    121.2500 -64.0
+    103.5000    124.2500 -64.0
+    101.5000    124.2500 -64.0
+    102.5000    125.7500 -64.0
+    104.5000    126.7500 -64.0
+    104.7500    125.5000 -64.0
+    108.5000    122.7500 -64.0
+    114.5000    122.7500 -64.0
+    115.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+    130.2500    127.5000 -64.0
+    124.5000    134.2500 -64.0
+    124.2500    137.5000 -64.0
+    120.5000    143.2500 -64.0
+    116.5000    146.2500 -64.0
+    113.5000    146.2500 -64.0
+    111.5000    147.2500 -64.0
+     99.7500    142.5000 -64.0
+     97.2500    145.5000 -64.0
+    103.5000    145.7500 -64.0
+    109.5000    148.7500 -64.0
+    114.5000    149.7500 -64.0
+    115.2500    151.5000 -64.0
+    116.7500    152.5000 -64.0
+    117.7500    147.5000 -64.0
+    120.5000    144.7500 -64.0
+    130.7500    138.5000 -64.0
+    126.5000    137.2500 -64.0
+    125.5000    139.2500 -64.0
+    124.7500    137.5000 -64.0
+    126.5000    135.7500 -64.0
+    126.7500    133.5000 -64.0
+    132.5000    128.7500 -64.0
+    133.2500    130.5000 -64.0
+    135.5000    132.7500 -64.0
+    135.7500    130.5000 -64.0
+    132.7500    127.5000 -64.0
+} -64.0
+{ -64.0
+    101.2500    130.5000 -64.0
+    101.2500    132.5000 -64.0
+    104.7500    132.5000 -64.0
+    103.7500    130.5000 -64.0
+} -64.0
+{ -64.0
+     91.2500    137.5000 -64.0
+     90.2500    140.5000 -64.0
+     95.5000    140.7500 -64.0
+     98.5000    141.7500 -64.0
+     98.7500    139.5000 -64.0
+     95.7500    137.5000 -64.0
+} -64.0
+v 75 z -200.000000 -64.0
+{ -64.0
+    107.2500     89.5000 -64.0
+    107.2500     91.5000 -64.0
+    109.5000     91.7500 -64.0
+} -64.0
+{ -64.0
+     90.2500    106.5000 -64.0
+     90.2500    108.5000 -64.0
+     91.7500    109.5000 -64.0
+     92.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+    115.2500    116.5000 -64.0
+    114.2500    117.5000 -64.0
+    116.5000    117.7500 -64.0
+    118.2500    120.5000 -64.0
+    118.2500    124.5000 -64.0
+    117.5000    126.2500 -64.0
+    113.5000    129.2500 -64.0
+    111.5000    129.2500 -64.0
+    109.5000    130.2500 -64.0
+    103.5000    130.2500 -64.0
+    101.2500    128.5000 -64.0
+    102.2500    130.5000 -64.0
+    102.2500    132.5000 -64.0
+    100.5000    133.2500 -64.0
+     98.7500    130.5000 -64.0
+     98.7500    128.5000 -64.0
+     97.2500    128.5000 -64.0
+     99.2500    134.5000 -64.0
+    101.5000    134.7500 -64.0
+    110.5000    131.7500 -64.0
+    112.2500    132.5000 -64.0
+    117.5000    132.7500 -64.0
+    121.5000    130.7500 -64.0
+    124.2500    132.5000 -64.0
+    124.2500    136.5000 -64.0
+    119.2500    144.5000 -64.0
+    113.5000    147.2500 -64.0
+    108.5000    146.2500 -64.0
+    107.2500    147.5000 -64.0
+    110.2500    149.5000 -64.0
+    112.5000    149.7500 -64.0
+    115.5000    152.7500 -64.0
+    118.5000    148.7500 -64.0
+    118.7500    146.5000 -64.0
+    123.5000    141.7500 -64.0
+    125.5000    141.7500 -64.0
+    125.7500    139.5000 -64.0
+    127.5000    135.7500 -64.0
+    127.7500    132.5000 -64.0
+    130.5000    129.7500 -64.0
+    132.5000    129.7500 -64.0
+    133.2500    131.5000 -64.0
+    134.5000    135.7500 -64.0
+    136.5000    134.7500 -64.0
+    136.7500    132.5000 -64.0
+    134.7500    128.5000 -64.0
+    131.5000    127.2500 -64.0
+    127.5000    130.2500 -64.0
+    123.5000    130.2500 -64.0
+    121.7500    126.5000 -64.0
+    125.7500    122.5000 -64.0
+    121.5000    122.2500 -64.0
+    119.7500    118.5000 -64.0
+    116.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500    137.5000 -64.0
+     94.2500    139.5000 -64.0
+     93.2500    142.5000 -64.0
+     97.5000    142.7500 -64.0
+    100.7500    141.5000 -64.0
+     97.7500    137.5000 -64.0
+} -64.0
+{ -64.0
+     89.2500    138.5000 -64.0
+     87.5000    141.2500 -64.0
+     88.2500    142.5000 -64.0
+     89.7500    139.5000 -64.0
+} -64.0
+{ -64.0
+    118.7500    125.5000 -64.0
+    119.5000    124.7500 -64.0
+    120.2500    125.5000 -64.0
+    119.5000    126.2500 -64.0
+} -64.0
+v 109 z -202.000000 -64.0
+{ -64.0
+    105.2500     86.5000 -64.0
+    103.5000     88.2500 -64.0
+    101.2500     88.5000 -64.0
+    104.5000     88.7500 -64.0
+    109.5000     86.7500 -64.0
+    114.5000     87.7500 -64.0
+    111.7500     86.5000 -64.0
+} -64.0
+{ -64.0
+    119.2500     90.5000 -64.0
+    119.5000     90.7500 -64.0
+    121.5000     91.7500 -64.0
+    120.7500     90.5000 -64.0
+} -64.0
+{ -64.0
+     98.2500     91.5000 -64.0
+     97.2500     93.5000 -64.0
+     98.5000     93.7500 -64.0
+} -64.0
+{ -64.0
+    100.2500     94.5000 -64.0
+     99.5000     95.2500 -64.0
+    100.5000     95.7500 -64.0
+    101.7500     94.5000 -64.0
+} -64.0
+{ -64.0
+    109.2500    115.5000 -64.0
+    107.5000    117.7500 -64.0
+    109.5000    116.7500 -64.0
+    113.5000    116.7500 -64.0
+    117.2500    120.5000 -64.0
+    114.5000    124.2500 -64.0
+    112.5000    124.2500 -64.0
+    107.5000    128.2500 -64.0
+    104.5000    128.2500 -64.0
+    102.5000    125.2500 -64.0
+    100.5000    124.2500 -64.0
+    100.2500    125.5000 -64.0
+    105.2500    130.5000 -64.0
+    107.5000    129.7500 -64.0
+    109.2500    130.5000 -64.0
+    115.5000    128.7500 -64.0
+    115.7500    126.5000 -64.0
+    119.5000    121.7500 -64.0
+    121.2500    122.5000 -64.0
+    122.2500    124.5000 -64.0
+    120.5000    126.2500 -64.0
+    120.2500    128.5000 -64.0
+    118.5000    130.2500 -64.0
+    115.2500    130.5000 -64.0
+    114.2500    132.5000 -64.0
+    115.5000    131.7500 -64.0
+    116.5000    132.7500 -64.0
+    118.5000    131.7500 -64.0
+    121.5000    131.7500 -64.0
+    124.2500    134.5000 -64.0
+    123.2500    139.5000 -64.0
+    114.5000    147.2500 -64.0
+    110.5000    147.2500 -64.0
+    105.5000    145.2500 -64.0
+     99.7500    139.5000 -64.0
+     99.7500    136.5000 -64.0
+    104.5000    134.7500 -64.0
+    104.7500    133.5000 -64.0
+    100.5000    133.2500 -64.0
+     98.5000    130.2500 -64.0
+     98.2500    132.5000 -64.0
+     95.5000    136.2500 -64.0
+     91.2500    136.5000 -64.0
+     88.5000    140.2500 -64.0
+     88.5000    142.7500 -64.0
+     92.2500    145.5000 -64.0
+     93.5000    144.7500 -64.0
+    100.5000    144.7500 -64.0
+    109.2500    149.5000 -64.0
+    111.5000    149.7500 -64.0
+    115.5000    154.7500 -64.0
+    116.5000    150.7500 -64.0
+    118.5000    149.7500 -64.0
+    122.5000    144.7500 -64.0
+    126.5000    141.7500 -64.0
+    128.5000    141.7500 -64.0
+    130.5000    139.7500 -64.0
+    132.5000    139.7500 -64.0
+    136.5000    136.7500 -64.0
+    136.7500    131.5000 -64.0
+    134.7500    127.5000 -64.0
+    131.5000    127.2500 -64.0
+    129.5000    129.2500 -64.0
+    131.2500    130.5000 -64.0
+    131.2500    132.5000 -64.0
+    133.2500    133.5000 -64.0
+    133.2500    135.5000 -64.0
+    131.5000    137.2500 -64.0
+    128.5000    137.2500 -64.0
+    126.7500    132.5000 -64.0
+    128.7500    130.5000 -64.0
+    124.5000    130.2500 -64.0
+    121.7500    126.5000 -64.0
+    123.5000    124.7500 -64.0
+    127.5000    122.7500 -64.0
+    127.5000    121.2500 -64.0
+    125.5000    122.2500 -64.0
+    122.5000    122.2500 -64.0
+    121.7500    120.5000 -64.0
+    118.5000    117.2500 -64.0
+    114.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+    106.2500    133.5000 -64.0
+    111.5000    134.7500 -64.0
+    112.7500    133.5000 -64.0
+} -64.0
+{ -64.0
+     90.7500    138.5000 -64.0
+     91.5000    137.7500 -64.0
+     93.5000    137.7500 -64.0
+     95.2500    139.5000 -64.0
+     96.2500    141.5000 -64.0
+     93.5000    144.2500 -64.0
+     90.7500    140.5000 -64.0
+} -64.0
+v 109 z -204.000000 -64.0
+{ -64.0
+    106.2500     85.5000 -64.0
+    105.2500     86.5000 -64.0
+    108.5000     86.7500 -64.0
+    109.7500     85.5000 -64.0
+} -64.0
+{ -64.0
+    110.2500    115.5000 -64.0
+    110.2500    116.5000 -64.0
+    114.2500    118.5000 -64.0
+    113.5000    120.2500 -64.0
+    108.5000    120.2500 -64.0
+    106.5000    121.2500 -64.0
+    104.5000    121.2500 -64.0
+     99.2500    124.5000 -64.0
+    102.5000    124.7500 -64.0
+    106.5000    121.7500 -64.0
+    107.5000    123.7500 -64.0
+    109.5000    124.7500 -64.0
+    113.5000    121.7500 -64.0
+    117.5000    121.7500 -64.0
+    121.2500    123.5000 -64.0
+    121.2500    128.5000 -64.0
+    119.5000    130.2500 -64.0
+    117.5000    130.2500 -64.0
+    115.5000    131.2500 -64.0
+    113.5000    131.2500 -64.0
+    112.2500    132.5000 -64.0
+    117.5000    132.7500 -64.0
+    119.5000    131.7500 -64.0
+    121.5000    132.7500 -64.0
+    125.2500    136.5000 -64.0
+    123.2500    140.5000 -64.0
+    120.5000    143.2500 -64.0
+    116.5000    150.2500 -64.0
+    114.5000    151.2500 -64.0
+    112.7500    150.5000 -64.0
+    115.7500    148.5000 -64.0
+    112.5000    148.2500 -64.0
+    109.5000    147.2500 -64.0
+    104.5000    145.2500 -64.0
+     99.7500    140.5000 -64.0
+     99.7500    138.5000 -64.0
+    101.5000    136.7500 -64.0
+    106.7500    133.5000 -64.0
+    102.5000    133.2500 -64.0
+    100.5000    134.2500 -64.0
+     98.7500    133.5000 -64.0
+     98.5000    131.2500 -64.0
+     98.2500    133.5000 -64.0
+     96.2500    135.5000 -64.0
+     97.2500    137.5000 -64.0
+     96.5000    138.2500 -64.0
+     96.2500    140.5000 -64.0
+     97.2500    142.5000 -64.0
+     96.5000    144.2500 -64.0
+     93.5000    144.2500 -64.0
+     91.7500    143.5000 -64.0
+     91.7500    141.5000 -64.0
+     90.7500    139.5000 -64.0
+     90.7500    136.5000 -64.0
+     89.2500    136.5000 -64.0
+     90.2500    138.5000 -64.0
+     89.5000    140.2500 -64.0
+     89.2500    143.5000 -64.0
+     90.5000    144.7500 -64.0
+     94.5000    146.7500 -64.0
+     96.5000    145.7500 -64.0
+     98.5000    145.7500 -64.0
+    101.5000    146.7500 -64.0
+    107.2500    149.5000 -64.0
+    109.5000    149.7500 -64.0
+    113.2500    152.5000 -64.0
+    113.2500    154.5000 -64.0
+    115.5000    157.7500 -64.0
+    117.5000    156.7500 -64.0
+    116.7500    154.5000 -64.0
+    117.7500    151.5000 -64.0
+    123.5000    144.7500 -64.0
+    129.5000    141.7500 -64.0
+    131.5000    141.7500 -64.0
+    133.5000    140.7500 -64.0
+    135.5000    140.7500 -64.0
+    137.5000    138.7500 -64.0
+    137.7500    134.5000 -64.0
+    139.7500    129.5000 -64.0
+    136.7500    125.5000 -64.0
+    134.5000    125.2500 -64.0
+    132.5000    126.2500 -64.0
+    130.5000    126.2500 -64.0
+    130.2500    128.5000 -64.0
+    128.5000    130.2500 -64.0
+    124.5000    130.2500 -64.0
+    122.7500    128.5000 -64.0
+    121.7500    126.5000 -64.0
+    125.5000    123.7500 -64.0
+    129.5000    123.7500 -64.0
+    128.7500    122.5000 -64.0
+    124.5000    122.2500 -64.0
+    122.5000    121.2500 -64.0
+    114.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+    132.7500    128.5000 -64.0
+    134.5000    127.7500 -64.0
+    136.2500    128.5000 -64.0
+    133.5000    130.2500 -64.0
+} -64.0
+{ -64.0
+    130.7500    133.5000 -64.0
+    131.5000    132.7500 -64.0
+    133.2500    133.5000 -64.0
+    134.2500    135.5000 -64.0
+    132.5000    137.2500 -64.0
+    127.5000    140.2500 -64.0
+    125.7500    139.5000 -64.0
+} -64.0
+v 97 z -206.000000 -64.0
+{ -64.0
+    107.2500     86.5000 -64.0
+    105.2500     87.5000 -64.0
+    114.5000     87.7500 -64.0
+    116.5000     88.7500 -64.0
+    117.5000     88.2500 -64.0
+    113.7500     86.5000 -64.0
+} -64.0
+{ -64.0
+    110.2500    116.5000 -64.0
+    108.5000    118.2500 -64.0
+    102.5000    121.2500 -64.0
+    101.2500    124.5000 -64.0
+    107.5000    119.7500 -64.0
+    110.5000    119.7500 -64.0
+    116.5000    121.7500 -64.0
+    120.2500    125.5000 -64.0
+    119.5000    129.2500 -64.0
+    114.5000    132.2500 -64.0
+    123.5000    132.7500 -64.0
+    125.2500    134.5000 -64.0
+    125.2500    138.5000 -64.0
+    119.5000    146.2500 -64.0
+    113.5000    149.2500 -64.0
+    104.5000    146.2500 -64.0
+     99.7500    141.5000 -64.0
+    100.5000    137.7500 -64.0
+    106.5000    134.7500 -64.0
+    103.7500    133.5000 -64.0
+    100.5000    134.2500 -64.0
+     98.5000    131.2500 -64.0
+     98.2500    133.5000 -64.0
+     95.5000    137.2500 -64.0
+     90.5000    137.2500 -64.0
+     89.2500    142.5000 -64.0
+     90.2500    145.5000 -64.0
+     93.2500    147.5000 -64.0
+     95.5000    147.7500 -64.0
+     97.5000    146.7500 -64.0
+    102.5000    147.7500 -64.0
+    111.5000    151.7500 -64.0
+    110.7500    150.5000 -64.0
+    111.5000    149.7500 -64.0
+    114.5000    149.7500 -64.0
+    116.5000    148.7500 -64.0
+    118.2500    149.5000 -64.0
+    117.5000    151.2500 -64.0
+    117.2500    155.5000 -64.0
+    118.2500    157.5000 -64.0
+    117.5000    158.2500 -64.0
+    114.7500    156.5000 -64.0
+    114.7500    154.5000 -64.0
+    113.5000    153.2500 -64.0
+    113.2500    158.5000 -64.0
+    114.5000    159.7500 -64.0
+    116.5000    158.7500 -64.0
+    119.5000    158.7500 -64.0
+    117.7500    154.5000 -64.0
+    119.7500    149.5000 -64.0
+    125.5000    143.7500 -64.0
+    127.5000    143.7500 -64.0
+    131.5000    141.7500 -64.0
+    137.5000    140.7500 -64.0
+    141.5000    137.7500 -64.0
+    141.7500    132.5000 -64.0
+    140.5000    131.2500 -64.0
+    138.5000    134.2500 -64.0
+    136.7500    132.5000 -64.0
+    133.5000    134.2500 -64.0
+    131.7500    131.5000 -64.0
+    125.5000    131.2500 -64.0
+    121.7500    127.5000 -64.0
+    124.7500    123.5000 -64.0
+    117.5000    119.2500 -64.0
+    115.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+    128.2500    122.5000 -64.0
+    128.2500    123.5000 -64.0
+    130.2500    124.5000 -64.0
+    131.2500    126.5000 -64.0
+    132.5000    126.7500 -64.0
+    135.7500    124.5000 -64.0
+    132.5000    124.2500 -64.0
+    131.7500    122.5000 -64.0
+    130.5000    123.2500 -64.0
+} -64.0
+{ -64.0
+    132.5000    135.7500 -64.0
+    134.2500    136.5000 -64.0
+    134.2500    138.5000 -64.0
+    132.5000    139.2500 -64.0
+    130.7500    137.5000 -64.0
+} -64.0
+{ -64.0
+     90.7500    141.5000 -64.0
+     91.5000    140.7500 -64.0
+     93.5000    140.7500 -64.0
+     98.5000    142.7500 -64.0
+    101.2500    145.5000 -64.0
+    100.5000    146.2500 -64.0
+     98.5000    145.2500 -64.0
+     96.5000    146.2500 -64.0
+     94.7500    145.5000 -64.0
+     93.5000    146.2500 -64.0
+     90.7500    143.5000 -64.0
+} -64.0
+v 120 z -208.000000 -64.0
+{ -64.0
+    101.2500     87.5000 -64.0
+    100.2500     88.5000 -64.0
+    102.5000     88.7500 -64.0
+    102.7500     87.5000 -64.0
+} -64.0
+{ -64.0
+    114.2500    116.5000 -64.0
+    111.5000    118.2500 -64.0
+    106.5000    119.2500 -64.0
+    105.5000    120.7500 -64.0
+    107.5000    119.7500 -64.0
+    111.5000    119.7500 -64.0
+    114.5000    120.7500 -64.0
+    116.2500    123.5000 -64.0
+    116.2500    126.5000 -64.0
+    115.5000    128.2500 -64.0
+    113.5000    128.2500 -64.0
+    114.5000    128.7500 -64.0
+    115.2500    130.5000 -64.0
+    112.2500    134.5000 -64.0
+    123.5000    131.7500 -64.0
+    125.5000    128.7500 -64.0
+    124.7500    127.5000 -64.0
+    124.7500    123.5000 -64.0
+    122.5000    125.2500 -64.0
+    121.7500    124.5000 -64.0
+    122.7500    121.5000 -64.0
+    121.7500    119.5000 -64.0
+    121.7500    116.5000 -64.0
+    120.5000    116.2500 -64.0
+    118.5000    117.2500 -64.0
+} -64.0
+{ -64.0
+    103.2500    121.5000 -64.0
+    102.2500    123.5000 -64.0
+    103.7500    123.5000 -64.0
+    104.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+    131.2500    122.5000 -64.0
+    131.2500    123.5000 -64.0
+    132.2500    125.5000 -64.0
+    134.7500    125.5000 -64.0
+    135.7500    123.5000 -64.0
+    133.7500    122.5000 -64.0
+} -64.0
+{ -64.0
+    135.2500    127.5000 -64.0
+    135.2500    128.5000 -64.0
+    136.5000    129.7500 -64.0
+    136.7500    127.5000 -64.0
+} -64.0
+{ -64.0
+     99.2500    129.5000 -64.0
+     98.5000    130.2500 -64.0
+     98.2500    134.5000 -64.0
+     94.5000    138.2500 -64.0
+     91.5000    138.2500 -64.0
+     91.2500    139.5000 -64.0
+     88.5000    143.2500 -64.0
+     90.2500    145.5000 -64.0
+     90.2500    147.5000 -64.0
+     92.2500    148.5000 -64.0
+     94.5000    148.7500 -64.0
+     96.5000    147.7500 -64.0
+    101.5000    147.7500 -64.0
+    108.5000    150.7500 -64.0
+    113.2500    155.5000 -64.0
+    113.2500    157.5000 -64.0
+    112.5000    159.2500 -64.0
+    114.2500    161.5000 -64.0
+    115.5000    160.7500 -64.0
+    113.7500    159.5000 -64.0
+    114.5000    157.7500 -64.0
+    114.7500    155.5000 -64.0
+    110.7500    151.5000 -64.0
+    111.5000    150.7500 -64.0
+    113.2500    151.5000 -64.0
+    115.5000    151.7500 -64.0
+    117.5000    149.7500 -64.0
+    118.2500    150.5000 -64.0
+    117.5000    152.2500 -64.0
+    117.2500    155.5000 -64.0
+    118.5000    156.7500 -64.0
+    118.7500    153.5000 -64.0
+    120.7500    149.5000 -64.0
+    125.5000    144.7500 -64.0
+    129.5000    144.7500 -64.0
+    135.5000    142.7500 -64.0
+    139.5000    139.7500 -64.0
+    141.7500    138.5000 -64.0
+    142.7500    136.5000 -64.0
+    141.7500    134.5000 -64.0
+    141.2500    135.5000 -64.0
+    140.5000    137.2500 -64.0
+    138.5000    137.2500 -64.0
+    137.5000    135.2500 -64.0
+    135.5000    136.2500 -64.0
+    133.5000    136.2500 -64.0
+    130.5000    135.2500 -64.0
+    128.5000    137.2500 -64.0
+    126.5000    137.2500 -64.0
+    119.5000    147.2500 -64.0
+    114.5000    150.2500 -64.0
+    111.5000    150.2500 -64.0
+    101.5000    145.2500 -64.0
+     97.7500    140.5000 -64.0
+     97.7500    138.5000 -64.0
+    100.5000    136.7500 -64.0
+    104.5000    136.7500 -64.0
+    106.5000    135.7500 -64.0
+    108.5000    135.7500 -64.0
+    108.7500    134.5000 -64.0
+    106.5000    134.2500 -64.0
+    102.5000    130.2500 -64.0
+    100.5000    131.2500 -64.0
+} -64.0
+{ -64.0
+     87.2500    130.5000 -64.0
+     87.2500    132.5000 -64.0
+     87.7500    131.5000 -64.0
+} -64.0
+{ -64.0
+     89.2500    135.5000 -64.0
+     90.2500    137.5000 -64.0
+     90.7500    136.5000 -64.0
+} -64.0
+{ -64.0
+     90.7500    143.5000 -64.0
+     91.5000    142.7500 -64.0
+     97.5000    142.7500 -64.0
+    100.2500    145.5000 -64.0
+     99.5000    146.2500 -64.0
+     96.5000    146.2500 -64.0
+     93.5000    147.2500 -64.0
+     91.7500    145.5000 -64.0
+} -64.0
+v 97 z -210.000000 -64.0
+{ -64.0
+    118.2500    115.5000 -64.0
+    117.5000    116.2500 -64.0
+    114.5000    116.2500 -64.0
+    108.5000    119.2500 -64.0
+    106.5000    119.2500 -64.0
+    103.2500    122.5000 -64.0
+    102.2500    124.5000 -64.0
+    104.5000    122.7500 -64.0
+    106.5000    121.7500 -64.0
+    112.5000    119.7500 -64.0
+    114.2500    121.5000 -64.0
+    115.2500    123.5000 -64.0
+    112.5000    126.2500 -64.0
+    112.2500    129.5000 -64.0
+    113.2500    131.5000 -64.0
+    111.5000    134.2500 -64.0
+    107.5000    134.2500 -64.0
+    104.7500    130.5000 -64.0
+    102.5000    130.2500 -64.0
+    100.7500    129.5000 -64.0
+    100.7500    127.5000 -64.0
+     98.5000    131.2500 -64.0
+     98.2500    134.5000 -64.0
+     99.2500    136.5000 -64.0
+    105.5000    137.7500 -64.0
+    111.5000    134.7500 -64.0
+    116.5000    134.7500 -64.0
+    119.5000    133.7500 -64.0
+    121.2500    134.5000 -64.0
+    123.5000    132.7500 -64.0
+    123.7500    129.5000 -64.0
+    121.5000    129.2500 -64.0
+    119.7500    128.5000 -64.0
+    119.7500    126.5000 -64.0
+    117.7500    122.5000 -64.0
+    118.5000    121.7500 -64.0
+    120.5000    120.7500 -64.0
+    121.7500    118.5000 -64.0
+    120.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+    131.2500    128.5000 -64.0
+    127.5000    132.2500 -64.0
+    127.2500    134.5000 -64.0
+    129.5000    132.7500 -64.0
+    131.2500    133.5000 -64.0
+    138.5000    133.7500 -64.0
+    138.7500    132.5000 -64.0
+    136.7500    128.5000 -64.0
+} -64.0
+{ -64.0
+     86.2500    131.5000 -64.0
+     86.2500    132.5000 -64.0
+     87.7500    131.5000 -64.0
+} -64.0
+{ -64.0
+    140.2500    137.5000 -64.0
+    139.5000    138.2500 -64.0
+    133.5000    138.2500 -64.0
+    129.5000    140.2500 -64.0
+    125.5000    140.2500 -64.0
+    123.2500    142.5000 -64.0
+    121.2500    146.5000 -64.0
+    116.5000    151.2500 -64.0
+    113.5000    151.2500 -64.0
+    113.2500    152.5000 -64.0
+    116.5000    155.7500 -64.0
+    118.5000    156.7500 -64.0
+    117.7500    155.5000 -64.0
+    118.7500    152.5000 -64.0
+    124.5000    146.7500 -64.0
+    128.5000    144.7500 -64.0
+    130.5000    145.7500 -64.0
+    132.5000    144.7500 -64.0
+    134.5000    144.7500 -64.0
+    137.7500    142.5000 -64.0
+    138.7500    140.5000 -64.0
+    140.5000    139.7500 -64.0
+    140.7500    138.5000 -64.0
+} -64.0
+{ -64.0
+     93.2500    141.5000 -64.0
+     92.5000    142.2500 -64.0
+     89.2500    142.5000 -64.0
+     88.2500    144.5000 -64.0
+     89.5000    147.7500 -64.0
+     93.5000    149.7500 -64.0
+     99.5000    147.7500 -64.0
+    102.5000    148.7500 -64.0
+    107.5000    150.7500 -64.0
+    113.2500    156.5000 -64.0
+    113.2500    158.5000 -64.0
+    114.5000    156.7500 -64.0
+    110.7500    152.5000 -64.0
+    110.7500    150.5000 -64.0
+    106.5000    148.2500 -64.0
+    100.5000    145.2500 -64.0
+     96.7500    141.5000 -64.0
+} -64.0
+{ -64.0
+     96.5000    143.7500 -64.0
+     98.2500    145.5000 -64.0
+     97.5000    147.2500 -64.0
+     93.5000    147.2500 -64.0
+     91.7500    146.5000 -64.0
+     92.5000    145.7500 -64.0
+     94.5000    145.7500 -64.0
+} -64.0
+v 108 z -212.000000 -64.0
+{ -64.0
+    118.2500    113.5000 -64.0
+    117.5000    115.2500 -64.0
+    114.5000    115.2500 -64.0
+    106.5000    120.2500 -64.0
+    104.5000    120.2500 -64.0
+    101.5000    123.2500 -64.0
+    101.2500    125.5000 -64.0
+    105.5000    121.7500 -64.0
+    109.5000    119.7500 -64.0
+    113.2500    120.5000 -64.0
+    114.2500    122.5000 -64.0
+    109.5000    130.2500 -64.0
+    105.5000    130.2500 -64.0
+    105.2500    131.5000 -64.0
+    103.5000    132.2500 -64.0
+    102.7500    130.5000 -64.0
+    104.7500    129.5000 -64.0
+    100.7500    128.5000 -64.0
+    100.7500    126.5000 -64.0
+     99.5000    127.2500 -64.0
+     98.5000    137.7500 -64.0
+    100.5000    138.7500 -64.0
+    100.7500    137.5000 -64.0
+    102.5000    136.7500 -64.0
+    106.5000    138.7500 -64.0
+    110.5000    136.7500 -64.0
+    120.5000    136.7500 -64.0
+    120.7500    134.5000 -64.0
+    117.7500    132.5000 -64.0
+    117.7500    124.5000 -64.0
+    116.7500    122.5000 -64.0
+    116.7500    120.5000 -64.0
+    118.5000    119.7500 -64.0
+    119.5000    117.7500 -64.0
+    119.7500    114.5000 -64.0
+} -64.0
+{ -64.0
+    122.2500    117.5000 -64.0
+    120.2500    123.5000 -64.0
+    123.2500    129.5000 -64.0
+    123.2500    132.5000 -64.0
+    124.5000    131.7500 -64.0
+    124.7500    126.5000 -64.0
+    125.5000    124.7500 -64.0
+    124.7500    123.5000 -64.0
+    125.7500    121.5000 -64.0
+    123.7500    117.5000 -64.0
+} -64.0
+{ -64.0
+    133.2500    128.5000 -64.0
+    131.5000    129.2500 -64.0
+    124.5000    137.2500 -64.0
+    124.2500    140.5000 -64.0
+    129.5000    137.7500 -64.0
+    129.7500    135.5000 -64.0
+    131.5000    134.7500 -64.0
+    133.5000    137.7500 -64.0
+    137.5000    135.7500 -64.0
+    139.5000    137.7500 -64.0
+    141.5000    136.7500 -64.0
+    140.5000    133.2500 -64.0
+    136.5000    131.2500 -64.0
+    135.7500    129.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500    139.5000 -64.0
+     88.2500    141.5000 -64.0
+     93.5000    141.7500 -64.0
+     95.2500    142.5000 -64.0
+     95.7500    141.5000 -64.0
+     92.7500    139.5000 -64.0
+} -64.0
+{ -64.0
+    134.2500    140.5000 -64.0
+    133.5000    141.2500 -64.0
+    131.5000    141.2500 -64.0
+    129.5000    142.2500 -64.0
+    125.2500    142.5000 -64.0
+    123.2500    146.5000 -64.0
+    124.5000    146.7500 -64.0
+    126.5000    145.7500 -64.0
+    128.5000    145.7500 -64.0
+    131.5000    146.7500 -64.0
+    135.5000    143.7500 -64.0
+    137.7500    142.5000 -64.0
+    138.7500    140.5000 -64.0
+    137.5000    141.2500 -64.0
+    135.7500    140.5000 -64.0
+} -64.0
+{ -64.0
+     96.2500    143.5000 -64.0
+     94.5000    145.2500 -64.0
+     92.5000    145.2500 -64.0
+     90.5000    146.2500 -64.0
+     88.7500    145.5000 -64.0
+     87.2500    146.5000 -64.0
+     90.5000    146.7500 -64.0
+     92.5000    147.7500 -64.0
+     96.5000    145.7500 -64.0
+     98.2500    147.5000 -64.0
+     95.5000    149.2500 -64.0
+     92.2500    149.5000 -64.0
+     95.5000    149.7500 -64.0
+     97.5000    148.7500 -64.0
+    106.7500    149.5000 -64.0
+    102.7500    146.5000 -64.0
+    100.5000    146.2500 -64.0
+     97.7500    143.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500    154.5000 -64.0
+    114.2500    157.5000 -64.0
+    116.5000    159.7500 -64.0
+    116.7500    154.5000 -64.0
+    115.5000    155.2500 -64.0
+    114.7500    154.5000 -64.0
+} -64.0
+{ -64.0
+    112.2500    162.5000 -64.0
+    111.5000    163.7500 -64.0
+    113.5000    164.7500 -64.0
+    113.7500    163.5000 -64.0
+} -64.0
+v 99 z -214.000000 -64.0
+{ -64.0
+    117.2500    114.5000 -64.0
+    116.5000    115.2500 -64.0
+    111.5000    115.2500 -64.0
+    110.2500    116.5000 -64.0
+    109.2500    118.5000 -64.0
+    107.5000    119.2500 -64.0
+    105.5000    120.2500 -64.0
+    103.5000    120.2500 -64.0
+    102.2500    121.5000 -64.0
+    101.2500    123.5000 -64.0
+     99.5000    124.2500 -64.0
+     99.2500    126.5000 -64.0
+    101.2500    130.5000 -64.0
+    102.5000    129.7500 -64.0
+    104.2500    130.5000 -64.0
+    106.2500    134.5000 -64.0
+    105.5000    136.2500 -64.0
+    103.5000    137.2500 -64.0
+    100.5000    136.2500 -64.0
+     97.7500    130.5000 -64.0
+     96.2500    131.5000 -64.0
+     97.2500    133.5000 -64.0
+     97.2500    135.5000 -64.0
+     99.2500    139.5000 -64.0
+    102.5000    139.7500 -64.0
+    104.5000    138.7500 -64.0
+    107.5000    138.7500 -64.0
+    111.5000    135.7500 -64.0
+    113.5000    135.7500 -64.0
+    113.7500    134.5000 -64.0
+    112.7500    132.5000 -64.0
+    115.5000    130.7500 -64.0
+    114.7500    129.5000 -64.0
+    114.7500    127.5000 -64.0
+    115.5000    125.7500 -64.0
+    115.7500    120.5000 -64.0
+    117.5000    118.7500 -64.0
+    117.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500    116.5000 -64.0
+    120.2500    119.5000 -64.0
+    118.5000    128.2500 -64.0
+    120.2500    130.5000 -64.0
+    119.2500    131.5000 -64.0
+    121.2500    135.5000 -64.0
+    122.7500    135.5000 -64.0
+    124.5000    131.7500 -64.0
+    124.7500    121.5000 -64.0
+    123.7500    119.5000 -64.0
+    123.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+    131.2500    131.5000 -64.0
+    129.5000    133.2500 -64.0
+    125.2500    135.5000 -64.0
+    122.2500    142.5000 -64.0
+    116.5000    149.2500 -64.0
+    112.2500    152.5000 -64.0
+    115.7500    152.5000 -64.0
+    124.5000    146.7500 -64.0
+    124.7500    142.5000 -64.0
+    126.5000    141.7500 -64.0
+    128.2500    142.5000 -64.0
+    127.2500    145.5000 -64.0
+    129.2500    146.5000 -64.0
+    132.5000    146.7500 -64.0
+    134.5000    145.7500 -64.0
+    134.7500    143.5000 -64.0
+    132.5000    143.2500 -64.0
+    131.7500    141.5000 -64.0
+    133.5000    139.7500 -64.0
+    137.5000    139.7500 -64.0
+    139.5000    140.7500 -64.0
+    141.5000    139.7500 -64.0
+    141.7500    136.5000 -64.0
+    139.7500    134.5000 -64.0
+    137.5000    134.2500 -64.0
+    134.7500    131.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500    139.5000 -64.0
+     91.2500    141.5000 -64.0
+     90.5000    143.2500 -64.0
+     91.2500    144.5000 -64.0
+     93.5000    144.7500 -64.0
+     97.2500    147.5000 -64.0
+     98.7500    147.5000 -64.0
+     97.7500    145.5000 -64.0
+     97.7500    143.5000 -64.0
+     92.7500    139.5000 -64.0
+} -64.0
+{ -64.0
+    107.7500    120.5000 -64.0
+    108.5000    119.7500 -64.0
+    110.5000    119.7500 -64.0
+    112.2500    120.5000 -64.0
+    113.2500    122.5000 -64.0
+    107.5000    127.2500 -64.0
+    103.5000    127.2500 -64.0
+    101.7500    126.5000 -64.0
+    101.7500    123.5000 -64.0
+    105.5000    120.7500 -64.0
+} -64.0
+{ -64.0
+    106.7500    132.5000 -64.0
+    108.5000    131.7500 -64.0
+    109.2500    133.5000 -64.0
+    107.5000    134.2500 -64.0
+} -64.0
+v 105 z -216.000000 -64.0
+{ -64.0
+    113.2500    114.5000 -64.0
+    112.5000    115.2500 -64.0
+    110.5000    116.2500 -64.0
+    108.2500    118.5000 -64.0
+    103.2500    120.5000 -64.0
+    106.5000    120.7500 -64.0
+    108.2500    121.5000 -64.0
+    107.5000    123.2500 -64.0
+    105.5000    123.2500 -64.0
+     98.5000    122.2500 -64.0
+     98.5000    123.7500 -64.0
+    100.5000    124.7500 -64.0
+    101.2500    126.5000 -64.0
+    104.5000    127.7500 -64.0
+    106.5000    126.7500 -64.0
+    111.5000    126.7500 -64.0
+    111.7500    124.5000 -64.0
+    114.5000    122.7500 -64.0
+    114.7500    120.5000 -64.0
+    116.5000    118.7500 -64.0
+    116.7500    116.5000 -64.0
+    115.7500    114.5000 -64.0
+} -64.0
+{ -64.0
+    120.2500    116.5000 -64.0
+    119.5000    117.2500 -64.0
+    119.2500    120.5000 -64.0
+    115.2500    128.5000 -64.0
+    116.2500    130.5000 -64.0
+    115.5000    132.2500 -64.0
+    114.7500    131.5000 -64.0
+    107.5000    135.2500 -64.0
+    104.5000    135.2500 -64.0
+    102.7500    134.5000 -64.0
+     98.5000    129.2500 -64.0
+     96.5000    128.2500 -64.0
+     96.2500    131.5000 -64.0
+     97.2500    133.5000 -64.0
+     97.2500    137.5000 -64.0
+     98.2500    139.5000 -64.0
+    102.5000    139.7500 -64.0
+    106.5000    137.7500 -64.0
+    108.5000    137.7500 -64.0
+    112.5000    135.7500 -64.0
+    113.2500    136.5000 -64.0
+    117.5000    137.7500 -64.0
+    119.5000    136.7500 -64.0
+    121.5000    136.7500 -64.0
+    123.2500    137.5000 -64.0
+    124.2500    139.5000 -64.0
+    122.2500    144.5000 -64.0
+    117.5000    149.2500 -64.0
+    112.5000    152.2500 -64.0
+    107.5000    150.2500 -64.0
+     97.7500    142.5000 -64.0
+     89.5000    139.2500 -64.0
+     89.2500    140.5000 -64.0
+     90.5000    140.7500 -64.0
+     93.2500    144.5000 -64.0
+     92.2500    146.5000 -64.0
+     97.5000    146.7500 -64.0
+    110.5000    152.7500 -64.0
+    112.2500    153.5000 -64.0
+    112.2500    155.5000 -64.0
+    113.5000    156.7500 -64.0
+    115.5000    157.7500 -64.0
+    115.7500    155.5000 -64.0
+    119.5000    151.7500 -64.0
+    126.5000    145.7500 -64.0
+    127.2500    146.5000 -64.0
+    128.5000    145.7500 -64.0
+    135.5000    146.7500 -64.0
+    136.7500    145.5000 -64.0
+    137.7500    143.5000 -64.0
+    138.5000    141.7500 -64.0
+    138.7500    138.5000 -64.0
+    137.7500    135.5000 -64.0
+    135.5000    135.2500 -64.0
+    133.7500    134.5000 -64.0
+    135.5000    133.7500 -64.0
+    135.7500    132.5000 -64.0
+    134.7500    130.5000 -64.0
+    127.5000    134.2500 -64.0
+    124.7500    132.5000 -64.0
+    124.7500    129.5000 -64.0
+    126.7500    125.5000 -64.0
+    125.7500    123.5000 -64.0
+    121.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+    108.7500    120.5000 -64.0
+    109.5000    119.7500 -64.0
+    110.2500    120.5000 -64.0
+    109.5000    121.2500 -64.0
+} -64.0
+{ -64.0
+     97.7500    133.5000 -64.0
+     98.5000    132.7500 -64.0
+    100.2500    134.5000 -64.0
+    101.2500    136.5000 -64.0
+     99.5000    137.2500 -64.0
+} -64.0
+{ -64.0
+    133.7500    142.5000 -64.0
+    134.5000    141.7500 -64.0
+    135.2500    142.5000 -64.0
+    136.2500    144.5000 -64.0
+    134.5000    146.2500 -64.0
+    132.7500    144.5000 -64.0
+} -64.0
+{ -64.0
+    114.5000    151.7500 -64.0
+    116.2500    152.5000 -64.0
+    114.5000    154.2500 -64.0
+    112.7500    153.5000 -64.0
+} -64.0
+v 104 z -218.000000 -64.0
+{ -64.0
+    113.2500    113.5000 -64.0
+    111.5000    114.2500 -64.0
+    112.2500    115.5000 -64.0
+    111.5000    117.2500 -64.0
+    108.5000    117.2500 -64.0
+    103.5000    121.2500 -64.0
+    101.5000    121.2500 -64.0
+     99.5000    122.2500 -64.0
+    100.5000    122.7500 -64.0
+    105.5000    123.7500 -64.0
+    113.5000    119.7500 -64.0
+    115.5000    116.7500 -64.0
+    115.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+    118.2500    116.5000 -64.0
+    118.2500    117.5000 -64.0
+    117.2500    122.5000 -64.0
+    115.5000    124.2500 -64.0
+    113.2500    125.5000 -64.0
+    112.2500    127.5000 -64.0
+    108.5000    131.2500 -64.0
+    106.7500    130.5000 -64.0
+    101.5000    130.2500 -64.0
+     98.5000    127.2500 -64.0
+     96.5000    126.2500 -64.0
+     96.2500    128.5000 -64.0
+     97.5000    127.7500 -64.0
+     98.2500    128.5000 -64.0
+     99.2500    130.5000 -64.0
+    105.2500    136.5000 -64.0
+    104.5000    138.2500 -64.0
+    102.5000    138.2500 -64.0
+     98.7500    136.5000 -64.0
+     97.7500    134.5000 -64.0
+     96.5000    136.2500 -64.0
+     96.2500    139.5000 -64.0
+     94.5000    141.2500 -64.0
+     91.2500    141.5000 -64.0
+     92.2500    143.5000 -64.0
+     94.5000    143.7500 -64.0
+     95.2500    145.5000 -64.0
+     93.5000    146.2500 -64.0
+     89.5000    144.2500 -64.0
+     89.2500    147.5000 -64.0
+     91.2500    148.5000 -64.0
+     98.5000    148.7500 -64.0
+    101.5000    149.7500 -64.0
+    107.2500    152.5000 -64.0
+    115.5000    153.7500 -64.0
+    117.2500    154.5000 -64.0
+    117.2500    156.5000 -64.0
+    118.7500    153.5000 -64.0
+    122.5000    149.7500 -64.0
+    126.5000    146.7500 -64.0
+    128.5000    146.7500 -64.0
+    130.5000    145.7500 -64.0
+    133.5000    146.7500 -64.0
+    136.5000    145.7500 -64.0
+    139.5000    140.7500 -64.0
+    139.7500    137.5000 -64.0
+    138.7500    135.5000 -64.0
+    134.5000    135.2500 -64.0
+    132.7500    133.5000 -64.0
+    133.5000    132.7500 -64.0
+    135.5000    131.7500 -64.0
+    135.5000    129.2500 -64.0
+    129.5000    133.2500 -64.0
+    126.5000    133.2500 -64.0
+    123.7500    130.5000 -64.0
+    124.7500    127.5000 -64.0
+    126.7500    126.5000 -64.0
+    127.7500    124.5000 -64.0
+    123.7500    122.5000 -64.0
+    123.7500    120.5000 -64.0
+    119.7500    116.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500    157.5000 -64.0
+    113.2500    159.5000 -64.0
+    114.2500    161.5000 -64.0
+    114.2500    163.5000 -64.0
+    115.5000    162.7500 -64.0
+    116.7500    157.5000 -64.0
+    115.5000    158.2500 -64.0
+} -64.0
+{ -64.0
+    117.7500    125.5000 -64.0
+    119.5000    124.7500 -64.0
+    123.2500    127.5000 -64.0
+    123.2500    129.5000 -64.0
+    119.5000    132.2500 -64.0
+    116.7500    127.5000 -64.0
+} -64.0
+{ -64.0
+    116.7500    137.5000 -64.0
+    117.5000    136.7500 -64.0
+    120.5000    136.7500 -64.0
+    123.5000    137.7500 -64.0
+    125.2500    140.5000 -64.0
+    124.5000    141.2500 -64.0
+    124.2500    143.5000 -64.0
+    121.2500    147.5000 -64.0
+    114.5000    152.2500 -64.0
+    111.5000    152.2500 -64.0
+    102.5000    148.2500 -64.0
+     98.7500    143.5000 -64.0
+     99.5000    141.7500 -64.0
+    105.5000    138.7500 -64.0
+    106.2500    139.5000 -64.0
+    108.5000    139.7500 -64.0
+    110.5000    137.7500 -64.0
+} -64.0
+v 134 z -220.000000 -64.0
+{ -64.0
+    114.2500     91.5000 -64.0
+    114.5000     92.7500 -64.0
+    116.5000     93.7500 -64.0
+} -64.0
+{ -64.0
+     90.2500    109.5000 -64.0
+     91.2500    111.5000 -64.0
+     92.5000    111.7500 -64.0
+     92.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+    127.2500    110.5000 -64.0
+    127.5000    110.7500 -64.0
+    129.5000    111.7500 -64.0
+    129.7500    110.5000 -64.0
+} -64.0
+{ -64.0
+    112.2500    113.5000 -64.0
+    112.2500    115.5000 -64.0
+    110.5000    117.2500 -64.0
+    107.5000    117.2500 -64.0
+    104.5000    120.2500 -64.0
+    100.5000    120.2500 -64.0
+    100.2500    121.5000 -64.0
+    102.5000    121.7500 -64.0
+    104.5000    120.7500 -64.0
+    107.5000    120.7500 -64.0
+    111.5000    117.7500 -64.0
+    114.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+    117.2500    115.5000 -64.0
+    115.2500    120.5000 -64.0
+    112.5000    124.2500 -64.0
+    110.5000    124.2500 -64.0
+    108.5000    126.2500 -64.0
+    110.5000    128.7500 -64.0
+    112.5000    127.7500 -64.0
+    112.7500    125.5000 -64.0
+    117.5000    123.7500 -64.0
+    120.5000    124.7500 -64.0
+    123.2500    127.5000 -64.0
+    121.5000    134.2500 -64.0
+    119.5000    134.2500 -64.0
+    117.5000    135.2500 -64.0
+    116.7500    134.5000 -64.0
+    116.7500    131.5000 -64.0
+    115.5000    131.2500 -64.0
+    114.5000    133.2500 -64.0
+    112.5000    134.2500 -64.0
+    112.2500    137.5000 -64.0
+    125.5000    137.7500 -64.0
+    126.2500    139.5000 -64.0
+    125.2500    144.5000 -64.0
+    115.5000    154.2500 -64.0
+    111.5000    154.2500 -64.0
+    107.5000    151.2500 -64.0
+    101.5000    148.2500 -64.0
+     98.7500    144.5000 -64.0
+     99.5000    142.7500 -64.0
+    103.5000    139.7500 -64.0
+    105.5000    139.7500 -64.0
+    107.5000    138.7500 -64.0
+    109.2500    139.5000 -64.0
+    109.7500    138.5000 -64.0
+    107.7500    137.5000 -64.0
+    107.7500    135.5000 -64.0
+    106.5000    135.2500 -64.0
+    105.5000    138.2500 -64.0
+     99.5000    138.2500 -64.0
+     97.7500    136.5000 -64.0
+     97.7500    134.5000 -64.0
+     96.2500    137.5000 -64.0
+     93.5000    140.2500 -64.0
+     91.5000    141.2500 -64.0
+     91.2500    142.5000 -64.0
+     89.5000    143.2500 -64.0
+     88.2500    147.5000 -64.0
+     89.5000    148.7500 -64.0
+     95.5000    149.2500 -64.0
+     94.7500    147.5000 -64.0
+     96.5000    145.7500 -64.0
+    100.2500    148.5000 -64.0
+     99.2500    149.5000 -64.0
+    102.2500    151.5000 -64.0
+    105.5000    151.7500 -64.0
+    109.2500    154.5000 -64.0
+    116.5000    154.7500 -64.0
+    118.2500    155.5000 -64.0
+    117.2500    160.5000 -64.0
+    120.7500    152.5000 -64.0
+    124.5000    148.7500 -64.0
+    128.5000    146.7500 -64.0
+    133.5000    146.7500 -64.0
+    136.5000    145.7500 -64.0
+    139.5000    142.7500 -64.0
+    140.5000    138.7500 -64.0
+    139.7500    136.5000 -64.0
+    137.5000    136.2500 -64.0
+    134.5000    140.2500 -64.0
+    130.5000    140.2500 -64.0
+    128.7500    138.5000 -64.0
+    133.5000    135.7500 -64.0
+    135.5000    135.7500 -64.0
+    137.5000    134.7500 -64.0
+    134.5000    133.2500 -64.0
+    128.5000    136.2500 -64.0
+    123.7500    130.5000 -64.0
+    123.7500    128.5000 -64.0
+    125.5000    126.7500 -64.0
+    128.7500    126.5000 -64.0
+    127.7500    124.5000 -64.0
+    124.5000    124.2500 -64.0
+    120.7500    119.5000 -64.0
+    118.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+     97.2500    125.5000 -64.0
+     96.5000    126.2500 -64.0
+     96.2500    128.5000 -64.0
+     97.5000    128.7500 -64.0
+     99.2500    129.5000 -64.0
+    104.5000    129.7500 -64.0
+    107.5000    128.7500 -64.0
+    107.7500    127.5000 -64.0
+    106.5000    127.2500 -64.0
+    104.5000    126.2500 -64.0
+    100.5000    128.2500 -64.0
+     98.5000    127.2500 -64.0
+} -64.0
+{ -64.0
+    134.2500    129.5000 -64.0
+    131.5000    131.2500 -64.0
+    132.5000    131.7500 -64.0
+    135.5000    130.7500 -64.0
+    135.7500    129.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500    159.5000 -64.0
+    113.2500    161.5000 -64.0
+    114.5000    161.7500 -64.0
+} -64.0
+{ -64.0
+     90.7500    144.5000 -64.0
+     91.5000    143.7500 -64.0
+     93.2500    144.5000 -64.0
+     94.2500    146.5000 -64.0
+     93.5000    148.2500 -64.0
+     91.5000    148.2500 -64.0
+     89.7500    146.5000 -64.0
+} -64.0
+v 125 z -222.000000 -64.0
+{ -64.0
+    114.2500     92.5000 -64.0
+    114.2500     93.5000 -64.0
+    116.5000     93.7500 -64.0
+    115.7500     92.5000 -64.0
+} -64.0
+{ -64.0
+     95.2500     95.5000 -64.0
+     94.5000     97.7500 -64.0
+     96.5000     96.7500 -64.0
+} -64.0
+{ -64.0
+    127.2500    106.5000 -64.0
+    126.5000    107.2500 -64.0
+    127.2500    108.5000 -64.0
+    127.2500    110.5000 -64.0
+    129.7500    110.5000 -64.0
+    128.7500    107.5000 -64.0
+} -64.0
+{ -64.0
+     91.2500    109.5000 -64.0
+     91.2500    110.5000 -64.0
+     92.2500    113.5000 -64.0
+     93.5000    113.7500 -64.0
+     92.7500    112.5000 -64.0
+     92.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+     90.2500    115.5000 -64.0
+     90.5000    115.7500 -64.0
+     92.5000    116.7500 -64.0
+     92.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+    116.2500    115.5000 -64.0
+    112.5000    119.2500 -64.0
+    112.2500    121.5000 -64.0
+    110.5000    123.2500 -64.0
+    108.2500    123.5000 -64.0
+    114.5000    123.7500 -64.0
+    114.7500    121.5000 -64.0
+    116.5000    119.7500 -64.0
+    122.2500    128.5000 -64.0
+    121.2500    131.5000 -64.0
+    118.5000    134.2500 -64.0
+    115.5000    134.2500 -64.0
+    118.2500    136.5000 -64.0
+    117.5000    137.2500 -64.0
+    118.5000    137.7500 -64.0
+    124.5000    135.7500 -64.0
+    124.7500    126.5000 -64.0
+    123.5000    126.2500 -64.0
+    119.7500    122.5000 -64.0
+    119.7500    120.5000 -64.0
+    117.7500    118.5000 -64.0
+    117.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+    101.2500    124.5000 -64.0
+    100.5000    125.2500 -64.0
+     98.5000    125.2500 -64.0
+     99.2500    126.5000 -64.0
+     99.2500    128.5000 -64.0
+     98.5000    130.2500 -64.0
+     99.5000    130.7500 -64.0
+    101.5000    128.7500 -64.0
+    106.7500    124.5000 -64.0
+} -64.0
+{ -64.0
+    126.2500    125.5000 -64.0
+    127.2500    127.5000 -64.0
+    129.5000    127.7500 -64.0
+    129.7500    126.5000 -64.0
+} -64.0
+{ -64.0
+    131.2500    128.5000 -64.0
+    131.2500    129.5000 -64.0
+    135.5000    129.7500 -64.0
+    135.7500    128.5000 -64.0
+} -64.0
+{ -64.0
+    133.2500    133.5000 -64.0
+    129.5000    135.2500 -64.0
+    127.2500    137.5000 -64.0
+    125.2500    141.5000 -64.0
+    126.2500    144.5000 -64.0
+    116.2500    155.5000 -64.0
+    117.2500    157.5000 -64.0
+    117.5000    162.7500 -64.0
+    117.7500    158.5000 -64.0
+    123.5000    150.7500 -64.0
+    130.5000    146.7500 -64.0
+    135.5000    146.7500 -64.0
+    140.5000    140.7500 -64.0
+    140.7500    138.5000 -64.0
+    139.5000    138.2500 -64.0
+    134.5000    143.2500 -64.0
+    129.5000    143.2500 -64.0
+    128.7500    141.5000 -64.0
+    129.5000    139.7500 -64.0
+    132.5000    139.7500 -64.0
+    136.5000    136.7500 -64.0
+    138.5000    136.7500 -64.0
+    138.7500    135.5000 -64.0
+    135.7500    133.5000 -64.0
+} -64.0
+{ -64.0
+     97.2500    136.5000 -64.0
+     97.2500    137.5000 -64.0
+     94.5000    139.2500 -64.0
+     90.5000    141.2500 -64.0
+     90.2500    143.5000 -64.0
+     88.5000    145.2500 -64.0
+     88.5000    148.7500 -64.0
+     90.5000    149.7500 -64.0
+     89.7500    147.5000 -64.0
+     90.5000    145.7500 -64.0
+     92.5000    144.7500 -64.0
+     94.5000    146.7500 -64.0
+     99.7500    147.5000 -64.0
+     98.7500    145.5000 -64.0
+     98.7500    143.5000 -64.0
+    100.5000    141.7500 -64.0
+    106.7500    139.5000 -64.0
+    104.5000    139.2500 -64.0
+    101.5000    138.2500 -64.0
+     98.5000    139.2500 -64.0
+     97.7500    137.5000 -64.0
+} -64.0
+{ -64.0
+    113.2500    137.5000 -64.0
+    113.5000    137.7500 -64.0
+    115.5000    138.7500 -64.0
+    115.7500    137.5000 -64.0
+} -64.0
+{ -64.0
+    100.2500    148.5000 -64.0
+     99.5000    150.2500 -64.0
+     96.5000    150.2500 -64.0
+     94.5000    149.2500 -64.0
+     92.5000    150.2500 -64.0
+     94.5000    151.7500 -64.0
+     97.5000    150.7500 -64.0
+    105.5000    152.7500 -64.0
+    111.5000    158.7500 -64.0
+    111.7500    155.5000 -64.0
+} -64.0
+{ -64.0
+    129.7500    136.5000 -64.0
+    130.5000    135.7500 -64.0
+    132.2500    136.5000 -64.0
+    131.5000    137.2500 -64.0
+} -64.0
+v 115 z -224.000000 -64.0
+{ -64.0
+    114.2500     93.5000 -64.0
+    114.5000     93.7500 -64.0
+    116.5000     94.7500 -64.0
+    115.7500     93.5000 -64.0
+} -64.0
+{ -64.0
+     96.2500     96.5000 -64.0
+     95.2500     97.5000 -64.0
+     96.7500     97.5000 -64.0
+} -64.0
+{ -64.0
+    124.2500    104.5000 -64.0
+    126.2500    108.5000 -64.0
+    126.7500    107.5000 -64.0
+    125.7500    104.5000 -64.0
+} -64.0
+{ -64.0
+    127.2500    109.5000 -64.0
+    127.2500    110.5000 -64.0
+    128.5000    110.7500 -64.0
+    128.7500    109.5000 -64.0
+} -64.0
+{ -64.0
+     92.2500    111.5000 -64.0
+     93.2500    114.5000 -64.0
+     91.2500    115.5000 -64.0
+     93.5000    115.7500 -64.0
+     93.7500    112.5000 -64.0
+} -64.0
+{ -64.0
+    132.2500    113.5000 -64.0
+    132.2500    114.5000 -64.0
+    133.7500    115.5000 -64.0
+    134.7500    113.5000 -64.0
+} -64.0
+{ -64.0
+    114.2500    115.5000 -64.0
+    111.2500    120.5000 -64.0
+    107.5000    122.2500 -64.0
+    102.5000    122.2500 -64.0
+    100.5000    123.2500 -64.0
+    102.2500    126.5000 -64.0
+     98.5000    131.2500 -64.0
+     98.5000    132.7500 -64.0
+    101.7500    130.5000 -64.0
+    103.7500    126.5000 -64.0
+    108.5000    123.7500 -64.0
+    111.5000    123.7500 -64.0
+    113.5000    120.7500 -64.0
+    115.2500    121.5000 -64.0
+    116.5000    120.7500 -64.0
+    116.7500    115.5000 -64.0
+} -64.0
+{ -64.0
+    117.2500    121.5000 -64.0
+    117.2500    122.5000 -64.0
+    120.2500    126.5000 -64.0
+    120.2500    128.5000 -64.0
+    118.5000    130.2500 -64.0
+    114.5000    133.2500 -64.0
+    114.2500    135.5000 -64.0
+    118.5000    135.7500 -64.0
+    119.2500    137.5000 -64.0
+    117.5000    139.2500 -64.0
+    115.5000    139.2500 -64.0
+    113.7500    137.5000 -64.0
+    112.2500    139.5000 -64.0
+    121.5000    139.7500 -64.0
+    122.7500    138.5000 -64.0
+    125.7500    132.5000 -64.0
+    124.7500    129.5000 -64.0
+    126.5000    125.7500 -64.0
+    125.5000    124.2500 -64.0
+    123.5000    125.2500 -64.0
+    120.7500    121.5000 -64.0
+} -64.0
+{ -64.0
+     97.2500    135.5000 -64.0
+     97.2500    136.5000 -64.0
+     95.2500    141.5000 -64.0
+     94.5000    143.2500 -64.0
+     88.5000    146.2500 -64.0
+     88.2500    149.5000 -64.0
+     94.5000    152.7500 -64.0
+     96.5000    151.7500 -64.0
+    103.5000    152.7500 -64.0
+    109.5000    155.7500 -64.0
+    108.7500    154.5000 -64.0
+    102.5000    150.2500 -64.0
+    100.5000    149.2500 -64.0
+     99.5000    151.2500 -64.0
+     96.5000    151.2500 -64.0
+     94.7500    149.5000 -64.0
+     96.5000    147.7500 -64.0
+     99.5000    148.7500 -64.0
+     97.7500    145.5000 -64.0
+     97.7500    143.5000 -64.0
+     98.5000    141.7500 -64.0
+    103.5000    141.7500 -64.0
+    107.5000    139.7500 -64.0
+    106.5000    139.2500 -64.0
+    104.7500    138.5000 -64.0
+    105.7500    136.5000 -64.0
+    103.5000    136.2500 -64.0
+    101.5000    138.2500 -64.0
+     98.7500    135.5000 -64.0
+} -64.0
+{ -64.0
+    130.2500    135.5000 -64.0
+    124.5000    142.2500 -64.0
+    127.2500    145.5000 -64.0
+    124.2500    149.5000 -64.0
+    131.5000    145.7500 -64.0
+    137.5000    145.7500 -64.0
+    140.7500    141.5000 -64.0
+    138.5000    141.2500 -64.0
+    134.5000    144.2500 -64.0
+    131.5000    144.2500 -64.0
+    129.7500    143.5000 -64.0
+    138.5000    139.7500 -64.0
+    138.5000    136.2500 -64.0
+    136.5000    135.2500 -64.0
+    137.2500    136.5000 -64.0
+    136.5000    138.2500 -64.0
+    134.7500    137.5000 -64.0
+    132.5000    138.2500 -64.0
+    131.5000    140.2500 -64.0
+    129.7500    139.5000 -64.0
+    131.7500    135.5000 -64.0
+} -64.0
+{ -64.0
+    115.2500    164.5000 -64.0
+    115.2500    166.5000 -64.0
+    116.5000    166.7500 -64.0
+    116.7500    164.5000 -64.0
+} -64.0
+ -64.0
\ No newline at end of file
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/thom1249.pts b/Alpha_shapes_3/demo/Alpha_shapes_3/data/thom1249.pts
new file mode 100644
index 000000000000..e3d4e09ed6a0
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/thom1249.pts
@@ -0,0 +1,1249 @@
+1248  
+27.850301 -17.970299 134.875148 
+-25.310101 -17.089901 117.229948 
+-30.421501 -21.008499 144.254249 
+0.114400 -1.784400 50.132200 
+-18.264400 12.484400 101.627799 
+17.396600 -1.906600 99.023301 
+21.175900 -19.185901 135.392952 
+21.063600 -19.043600 132.826796 
+-22.225100 -15.724900 108.897448 
+8.249500 -14.839500 101.639749 
+29.463299 -5.123300 142.671651 
+28.427000 -18.197000 149.973500 
+20.364199 6.405800 114.632099 
+14.811500 -9.141500 105.235749 
+-15.004000 -8.116000 98.497997 
+19.542701 -11.952700 123.446353 
+-10.693900 -4.016100 58.998050 
+-18.223399 -13.286600 96.398302 
+-24.134400 11.784400 107.332801 
+-23.475999 8.946000 104.191998 
+-4.457700 9.027700 56.901148 
+16.912700 15.277300 98.476347 
+12.924100 12.075900 77.677051 
+-21.715099 6.515100 96.397452 
+10.053100 -2.053100 61.576548 
+8.974900 -5.644900 68.852447 
+29.422501 -20.732500 142.186247 
+31.027899 -19.127900 149.983950 
+27.245601 -13.955600 143.737795 
+27.104600 -21.824600 149.962300 
+22.975500 -13.585500 143.232755 
+17.288300 -16.248301 111.504147 
+11.139900 -5.079900 66.779953 
+5.708200 -5.798200 66.274099 
+9.299900 -4.059900 60.559951 
+18.658001 -17.238001 120.339001 
+28.983600 -7.483600 149.996800 
+27.157400 -17.317400 149.988700 
+30.981799 -14.521800 149.960900 
+20.507200 17.852800 112.518598 
+14.246800 -7.776800 92.238399 
+15.299200 -12.349200 106.839596 
+20.051600 -15.941601 125.510798 
+17.014300 -12.824300 114.637149 
+22.088301 -9.988300 120.869147 
+18.696699 -9.706700 114.113353 
+21.106100 -15.646100 129.163047 
+22.033800 -2.333800 121.891898 
+-19.762800 -11.657200 96.948599 
+-20.256000 10.436000 98.992001 
+-2.200600 2.110600 56.369702 
+4.071700 -2.541700 66.255849 
+3.152600 -1.982600 62.086299 
+9.701500 -1.501500 62.625749 
+14.424000 10.726000 88.107003 
+-17.650600 6.960600 97.964700 
+-16.106900 1.746900 89.671550 
+3.865300 -3.635300 75.612649 
+3.290200 -2.310200 69.370102 
+-16.555599 8.445600 91.712202 
+-7.549400 1.549400 62.095299 
+6.940000 -9.100000 95.914998 
+7.074300 -4.804300 73.542148 
+-19.513600 4.613600 100.078202 
+-20.076300 6.286300 102.651850 
+-18.569800 -9.290200 100.035102 
+-20.560200 1.840200 99.014901 
+-17.004301 -7.375700 95.372852 
+-15.204500 -11.905500 99.517748 
+-11.031800 -10.748200 96.414102 
+-4.650500 -7.619500 80.814746 
+10.709000 -15.099000 110.989500 
+9.578600 -12.348600 107.329301 
+0.532000 -11.422000 103.195997 
+-20.686101 6.686100 104.721952 
+-15.619500 -8.810500 100.040252 
+-15.200400 -10.819600 104.194798 
+-12.088800 -11.001200 104.220598 
+10.674700 -9.114700 102.117354 
+20.819301 -18.709300 132.819646 
+20.199099 -12.049100 128.674543 
+19.385099 -11.085100 123.957550 
+-20.917200 -9.272800 92.751403 
+-4.043800 -2.546200 51.163101 
+-9.308000 -4.242000 58.466000 
+-16.998900 -14.221100 97.475553 
+-15.706300 -13.303700 92.791853 
+-19.028101 -12.051900 90.675951 
+-22.591499 15.911500 100.584248 
+-15.927600 14.587600 91.711202 
+3.550800 8.709200 54.815400 
+16.712400 11.697600 99.021201 
+-19.986700 12.906700 96.921649 
+-11.174600 7.344600 64.152697 
+-13.900700 8.860700 77.674651 
+11.669300 -3.059300 65.219648 
+15.810500 0.239500 89.140254 
+5.729900 -1.889900 53.249949 
+7.298300 1.991700 57.419149 
+23.049200 11.560800 111.494597 
+20.645301 4.974700 113.057652 
+13.972400 -3.812400 76.116204 
+25.074399 0.045600 121.367202 
+24.139500 4.980500 116.704751 
+24.998800 -17.598800 145.279407 
+26.568401 -16.038400 146.854205 
+29.687400 -21.817400 149.958700 
+22.317100 -19.487100 141.113554 
+25.554001 -17.094000 148.407002 
+23.782200 -13.892200 146.856105 
+27.890600 -16.050599 147.355294 
+12.177100 -4.727100 67.308550 
+9.268400 -5.148400 63.159200 
+10.442500 -4.652500 60.026251 
+11.252200 -4.762200 65.236098 
+8.167200 -3.957200 64.183597 
+7.972200 -4.402200 66.261099 
+-19.830300 13.350300 103.164847 
+30.963699 -7.213700 149.951850 
+19.028700 14.271300 109.414352 
+18.123000 15.257000 105.256499 
+25.123199 -0.783200 126.596598 
+23.697200 8.712800 116.683601 
+22.574900 2.235100 119.282450 
+22.567500 9.082500 114.078753 
+23.254100 5.555900 117.232048 
+20.163701 14.096300 113.586848 
+24.498400 -20.888400 149.954200 
+18.343900 -7.843900 101.601949 
+15.379100 -10.709100 108.904548 
+15.561800 -12.021800 110.440903 
+12.753200 -13.093200 108.906598 
+17.214001 -12.934000 112.521998 
+17.983100 -12.533100 114.631549 
+12.877700 -11.097700 103.713851 
+12.889700 -9.189700 101.594849 
+12.393600 -13.353600 103.161797 
+20.851200 -17.701200 130.215605 
+20.459600 -17.209600 127.624799 
+20.577200 -13.737200 125.553598 
+19.710300 -16.280299 122.945149 
+19.676200 -15.496200 122.928099 
+12.485200 -11.985200 105.252599 
+11.968600 -13.238600 106.829296 
+21.251200 -8.951200 115.150604 
+21.900801 -7.770800 118.780403 
+19.093600 -0.583600 105.761803 
+22.807101 0.602900 117.213548 
+22.114700 6.175300 112.542348 
+12.904200 -9.734200 107.327101 
+11.800100 -10.420100 109.390052 
+19.031600 -11.781600 121.380802 
+21.798900 2.881100 117.214448 
+22.072500 5.927500 114.596249 
+22.255400 -4.445400 119.797696 
+22.579200 -0.669200 119.284600 
+18.505701 -11.765700 116.707851 
+23.753101 -11.153100 131.261549 
+23.506001 -2.996000 123.983000 
+23.473301 -5.973300 123.966650 
+22.830800 -4.360800 121.870398 
+-19.869601 -13.140400 97.955200 
+-20.318900 -11.191100 95.365552 
+-21.455201 -1.124800 98.992401 
+-20.642100 -9.617900 96.928949 
+-22.819500 11.419500 103.675251 
+-21.773300 11.133300 102.113354 
+-21.579701 9.669700 99.015151 
+-2.144400 1.054400 53.792799 
+-4.323100 1.703100 55.838451 
+-0.517400 -2.832600 58.471300 
+-1.598500 -0.901500 53.790749 
+-3.327100 -1.722900 54.831450 
+-6.151400 2.481400 58.479300 
+-7.639500 -2.870500 58.995250 
+-4.462400 -3.167600 61.063802 
+-8.892300 -3.417700 59.488850 
+2.383600 -2.413600 66.271799 
+-1.912000 4.502000 55.359001 
+8.304700 -1.794700 60.532351 
+6.917900 -0.907900 57.918949 
+0.455600 1.654400 54.312800 
+4.490400 -0.380400 55.310201 
+4.719600 1.400400 55.329801 
+5.251200 -3.031200 61.070602 
+4.253600 -2.293600 55.836801 
+-1.507200 5.247200 57.431399 
+9.099200 -1.539200 61.579598 
+-3.477400 5.587400 57.436299 
+5.813900 -3.023900 62.626949 
+5.740100 -3.320100 64.685051 
+7.698300 0.961700 61.079152 
+7.038400 3.821600 60.524201 
+-1.123300 5.973300 58.473350 
+-11.906800 -9.293200 96.391602 
+-11.910600 -8.269400 97.959700 
+0.503600 -10.243600 101.626799 
+-4.825000 -9.885000 98.487497 
+17.830800 5.989200 98.510397 
+-14.861700 10.991700 86.029151 
+15.921900 13.058100 92.750953 
+15.026600 9.873400 88.103303 
+-19.060499 10.430500 98.994751 
+-18.130300 12.180300 96.929849 
+-17.176200 10.856200 94.316901 
+-17.909900 2.589900 96.955049 
+-19.156400 4.436400 96.916799 
+-19.930999 4.581000 98.499497 
+5.521700 -4.311700 71.965850 
+-19.701600 12.661600 100.069202 
+-20.812100 11.672100 98.483947 
+-20.825200 12.795200 96.917399 
+-18.757200 13.337200 93.281400 
+-18.345499 13.475500 90.702251 
+-20.228600 9.038600 97.455703 
+-18.708099 7.788100 96.405952 
+-16.348100 9.858100 90.195947 
+-7.977300 3.337300 60.541351 
+-11.808700 4.728700 71.995650 
+-10.434000 3.634000 65.202998 
+-5.086500 -4.323500 71.466753 
+0.870600 -3.170600 75.100303 
+-2.508200 -4.341800 75.095903 
+-9.061500 5.131500 65.209248 
+0.447400 8.312600 61.558698 
+0.540500 9.129500 65.230248 
+-7.760200 6.150200 62.099899 
+-5.932200 9.472200 62.098899 
+-10.075900 7.105900 68.332051 
+7.026000 -4.076000 69.872998 
+10.748600 -1.578600 65.744302 
+7.064500 -3.804500 67.802246 
+-14.228600 7.048600 81.830697 
+0.624000 -3.784000 78.732002 
+-2.199100 -7.120900 83.945449 
+0.910300 -4.610300 79.770153 
+-1.691200 -6.778800 81.879397 
+-14.983700 -7.696300 96.913149 
+-8.715400 -8.384600 93.307300 
+-13.627000 -7.513000 93.826496 
+13.315700 8.914300 81.347851 
+14.384600 -1.814600 84.457303 
+3.888300 -2.638300 71.449153 
+-20.895399 9.765400 102.112304 
+-19.105800 9.415800 100.592098 
+-19.144600 7.074600 99.522698 
+-21.144901 7.764900 101.102553 
+-21.158100 5.308100 100.035952 
+-20.203401 4.733400 100.078302 
+-20.285100 6.535100 99.552448 
+-19.867501 6.977500 97.956250 
+-16.701200 -10.818800 102.654400 
+-16.249600 -11.180400 101.110203 
+-19.134101 -12.015900 97.987950 
+-16.947700 -11.412300 97.981150 
+-17.707000 -10.403000 98.506497 
+-19.436600 -9.163400 100.031702 
+-21.721901 2.901900 99.029051 
+-21.651400 4.391400 101.599299 
+-17.619800 -10.570200 96.935099 
+-19.640300 -10.629700 95.374852 
+-18.564900 -1.845100 97.447553 
+-17.973400 -4.876600 94.328301 
+-17.237900 -8.492100 96.956049 
+-19.617101 -9.482900 95.876448 
+-19.072001 -7.548000 95.898998 
+-20.384401 1.644400 95.907798 
+-16.475200 2.025200 89.642400 
+-0.915300 -11.574700 99.532348 
+5.236500 -11.196500 101.118253 
+7.105100 -12.185100 103.692551 
+-4.833600 -12.456400 99.548198 
+3.587700 -12.287700 104.233848 
+-11.012100 -10.037900 99.548948 
+-14.849800 -12.400200 99.520098 
+-11.471800 -11.978200 100.044102 
+-13.937900 -10.512100 99.546048 
+-14.697600 -10.622400 102.126204 
+-16.399499 -13.070500 97.435253 
+-16.645599 -10.554400 96.437202 
+-14.318900 -9.381100 96.435552 
+-16.075000 -11.765000 97.432503 
+-13.879100 -11.310900 96.405452 
+8.370300 -6.840300 78.730152 
+5.836600 -8.476600 90.158297 
+8.049600 -7.739600 84.989800 
+6.871800 -13.841800 100.060902 
+2.995900 -5.875900 79.272949 
+-9.843800 -11.666200 93.308100 
+-10.480200 -12.669800 96.439902 
+4.401700 -4.881700 74.040852 
+4.844300 -6.424300 70.932149 
+6.401900 -6.821900 76.635950 
+-2.854500 -7.305500 75.117753 
+-12.435900 -5.864100 77.672051 
+-16.050100 -6.369900 87.584948 
+-14.378200 -7.051800 91.210898 
+-17.341500 -3.838500 91.719252 
+-16.670000 -7.100000 92.790003 
+-16.213400 -6.776600 90.183297 
+-14.210300 -9.339700 95.369852 
+-0.693600 -3.496400 66.798203 
+1.874500 -4.614500 73.032251 
+16.307500 -14.677500 114.098753 
+12.886800 -14.746800 108.388402 
+16.145200 -14.355200 111.992601 
+19.079701 -15.199700 120.344851 
+18.376101 -14.066100 116.163047 
+-6.587500 -13.632500 101.591249 
+-12.355600 -12.534400 102.152204 
+2.780700 -13.090700 104.190348 
+-16.055700 -13.014300 100.557148 
+-18.943901 -9.896100 101.638049 
+-19.953901 2.633900 100.033052 
+-11.035400 -9.444600 102.652300 
+-14.802200 -9.647800 103.188897 
+-19.080200 4.940200 100.034902 
+-19.051199 9.191200 102.634400 
+11.654100 -9.624100 105.782053 
+3.878300 -11.078300 104.199148 
+10.226000 -14.306000 110.443003 
+-20.797801 -12.252200 92.231099 
+18.481301 1.958700 105.255649 
+3.080900 -10.280900 101.090453 
+-20.208101 13.128100 90.710951 
+-9.834500 10.214500 64.157747 
+-21.474900 13.394900 95.362552 
+2.548200 -1.428200 49.629099 
+6.123200 -2.783200 54.286600 
+4.486300 2.443700 51.688151 
+5.448100 2.181900 53.784049 
+9.673400 0.846600 60.536701 
+9.712600 8.327400 65.196298 
+22.982500 17.437500 112.026251 
+23.942899 12.657100 115.671450 
+18.971300 8.268700 104.755652 
+21.303101 8.846900 111.491547 
+21.161500 11.518500 111.515747 
+20.607900 -4.577900 108.883948 
+22.374501 15.865500 108.362252 
+29.379899 -7.159900 148.399952 
+22.148200 -18.958199 138.514098 
+23.999200 -14.069200 146.359601 
+30.092000 -20.322000 145.316007 
+25.465401 -18.835400 147.887698 
+9.726500 -4.096500 61.043252 
+10.248800 -4.328800 62.629399 
+9.941900 -2.591900 62.635949 
+10.080400 -1.990400 63.665200 
+5.986500 -3.566500 66.793253 
+7.280200 -4.320200 66.260099 
+31.057399 -6.397400 149.998700 
+21.694800 8.405200 114.607399 
+22.731200 13.688800 113.030602 
+22.918801 11.191200 113.589398 
+21.985999 12.554000 113.048002 
+21.906799 11.493200 113.573398 
+22.248400 1.821600 119.794196 
+16.536301 -2.806300 94.323151 
+18.774899 -2.934900 105.782453 
+15.962600 -10.982600 108.911298 
+17.625200 -11.455200 112.532598 
+14.680600 -10.850600 106.805296 
+14.956100 -11.846100 108.878048 
+16.422500 -11.012500 112.516248 
+15.800800 -10.710800 110.950400 
+16.323700 -13.233700 110.441853 
+12.565700 -12.055700 101.607849 
+12.073700 -9.623700 103.671851 
+9.856000 -6.856000 78.237998 
+19.813300 -12.463300 123.476653 
+11.211700 -10.151700 103.685851 
+13.702600 -11.622600 107.356301 
+13.741200 -11.611200 106.795596 
+10.592600 -14.672600 109.941299 
+10.970000 -14.090000 104.730002 
+20.161701 -8.141700 108.380852 
+18.341101 -2.181100 103.670551 
+21.176500 -4.256500 115.113254 
+19.864300 -3.604300 110.972150 
+19.000100 -2.800100 107.320051 
+15.300200 -9.330200 107.320101 
+17.744199 -11.234200 114.607099 
+18.064699 -11.294700 116.687351 
+18.155199 -10.645200 117.212598 
+22.239300 0.710700 119.319650 
+23.097000 5.023000 116.683501 
+22.833101 4.646900 119.306550 
+23.943600 0.026400 121.896798 
+24.344800 0.935200 121.887398 
+22.038699 5.551300 114.109353 
+21.817901 7.242100 114.098953 
+22.650900 6.489100 114.590449 
+22.047599 -3.577600 117.238798 
+23.728501 -3.518500 121.894248 
+21.818500 -1.128500 117.224248 
+20.224299 -3.374300 113.042152 
+20.642800 -3.622800 115.146404 
+23.035299 0.004700 119.307650 
+22.762501 -3.402500 119.271250 
+26.109100 -5.889100 131.774553 
+26.260599 -2.320600 129.175297 
+24.383699 -5.773700 126.556848 
+24.585801 -3.455800 123.987900 
+24.507800 -1.517800 123.478903 
+23.095200 -1.885200 121.892598 
+-21.069200 -10.340800 95.895398 
+-21.263501 -9.066500 97.443253 
+-21.871401 11.921400 102.154304 
+-22.629499 10.979500 102.125254 
+-3.089700 4.849700 54.810150 
+-1.995700 1.025700 53.247149 
+-3.808300 4.718300 55.315851 
+-2.563500 -2.246500 53.773249 
+-4.778300 -1.591700 55.310851 
+-3.715500 -2.444500 54.827250 
+-2.715500 -1.094500 53.787249 
+-4.852400 3.982400 58.473800 
+-4.653400 4.553400 57.393299 
+-4.061100 2.651100 56.904448 
+-2.546700 2.416700 55.326651 
+-8.068300 -1.411700 58.985850 
+-3.838900 1.728900 56.915548 
+-7.604500 -2.105500 58.462750 
+-6.998900 -3.171100 58.460550 
+-5.521700 0.361700 57.949149 
+-2.973200 1.153200 55.353401 
+-1.923500 -0.326500 55.353251 
+-10.482400 3.952400 67.303800 
+-3.653800 -3.206200 65.213098 
+-1.448400 -3.021600 66.765803 
+-9.218600 3.098600 65.190698 
+-0.462900 2.592900 54.273550 
+8.063300 -0.003300 58.476650 
+2.443600 -1.503600 52.196802 
+1.720900 -0.570900 51.685451 
+0.261300 -1.001300 51.715651 
+-1.007300 0.077300 53.236349 
+1.049300 -1.919300 54.794650 
+-1.498700 0.418700 54.270650 
+-1.444500 0.014500 54.827750 
+4.184200 2.065800 54.802100 
+4.460000 2.760000 53.254999 
+6.734300 2.025700 57.927149 
+4.345700 1.744300 56.382852 
+-0.237900 -2.462100 58.461050 
+5.872000 -0.702000 55.336001 
+6.442400 1.107600 57.931199 
+3.319600 -1.989600 58.474800 
+4.282500 1.017500 55.351251 
+-1.445000 3.595000 55.877501 
+-0.485100 2.845100 55.877451 
+-1.454600 2.024600 54.822700 
+5.745400 2.754600 55.857701 
+5.633700 0.426300 55.311851 
+4.461200 -0.811200 52.715598 
+3.570900 1.759100 53.270449 
+3.250700 0.399300 52.195352 
+5.723800 3.876200 56.881898 
+-0.977000 5.387000 57.396499 
+4.967600 -2.257600 53.778799 
+-1.971400 5.711400 56.384302 
+8.033400 1.716600 60.016701 
+9.139800 -0.679800 61.599898 
+8.949100 -0.669100 61.074552 
+9.047300 -1.457300 62.088649 
+7.109500 4.410500 59.479750 
+7.933100 3.676900 60.556551 
+-8.984900 -9.175100 95.897548 
+0.598900 -9.778900 100.034452 
+-17.128199 12.078200 96.925899 
+16.645199 2.394800 95.882598 
+15.626100 1.453900 90.703051 
+14.841600 12.258400 90.150797 
+-15.930800 9.370800 90.169597 
+15.111600 10.078400 89.650800 
+-18.572300 12.242300 100.033852 
+-19.811201 12.281200 97.984400 
+-16.347099 13.737100 91.741452 
+-18.811701 13.021700 92.269149 
+-17.837300 13.337300 92.276349 
+-17.081200 13.271200 93.314400 
+-17.856500 4.066500 98.516747 
+-18.786001 4.746000 98.476997 
+-21.000300 3.670300 98.474847 
+-20.752300 2.872300 98.513847 
+7.249400 -5.679400 69.369702 
+5.777500 -4.487500 70.408752 
+4.603200 -3.233200 67.296600 
+5.974100 -4.854100 67.287050 
+5.335200 -3.745200 69.372602 
+-16.499700 13.289700 90.685151 
+-20.912000 12.362000 96.958999 
+-21.594200 12.804200 98.517897 
+-20.775100 12.475100 98.502447 
+-20.759800 13.199800 96.950099 
+-15.283200 13.193200 86.533398 
+-19.654900 12.824900 93.807546 
+-18.396400 7.436400 94.846797 
+-18.371999 13.702000 89.129004 
+-7.789900 4.059900 59.475050 
+-9.356500 1.886500 62.606749 
+-10.212100 3.162100 62.613949 
+-15.292300 10.132300 86.038851 
+-14.785000 9.135000 81.832497 
+-10.827800 2.417800 64.156097 
+-10.210600 2.390600 65.759702 
+-6.756800 -3.573200 65.236598 
+-9.469600 1.919600 64.170197 
+-2.924400 -3.455600 69.902798 
+-10.137300 5.887300 68.861347 
+-12.612300 6.612300 77.713851 
+1.076400 9.473600 64.698201 
+-2.029800 6.949800 57.415099 
+3.301900 -2.221900 67.790946 
+8.036200 6.673800 64.173097 
+-10.128600 6.178600 66.245699 
+-8.139300 6.189300 61.570348 
+-4.122300 7.932300 58.973850 
+-4.172100 8.732100 59.488950 
+-8.603300 3.333300 62.608349 
+0.563200 -2.753200 66.791603 
+0.562000 9.988000 68.346001 
+-9.018100 7.958100 62.615949 
+-6.984000 8.674000 61.562998 
+-9.686800 7.526800 64.176597 
+-7.311800 6.531800 62.604099 
+-11.889900 7.249900 71.455053 
+-10.956700 7.646700 65.726652 
+-10.665100 6.305100 70.952449 
+-9.969900 7.579900 65.210048 
+-9.153600 7.653600 65.723202 
+9.043200 -4.543200 67.796596 
+8.712100 -4.102100 66.776053 
+11.849900 -4.369900 67.794946 
+6.775700 -3.965700 71.967850 
+10.736500 1.233500 65.738252 
+11.129600 8.350400 71.974800 
+9.522200 -0.442200 62.591099 
+8.286700 3.443300 61.598348 
+9.468700 0.561300 62.619349 
+-11.538400 -8.511600 96.410802 
+14.541400 9.548600 87.060702 
+13.429200 -2.329200 77.184597 
+-19.824700 11.724700 101.637649 
+-20.738800 10.828800 100.560598 
+-20.055999 10.966000 100.551998 
+-19.408699 9.348700 98.990651 
+-20.488900 9.278900 101.080553 
+-21.865900 7.415900 99.537048 
+-21.178800 4.638800 98.470597 
+-20.600600 5.500600 101.599699 
+-20.710699 6.380700 97.959650 
+-20.677699 6.937700 97.976150 
+-20.338200 5.858200 99.525898 
+-20.277300 11.417300 102.156354 
+-20.647399 7.817400 102.631300 
+-16.013600 -13.416400 100.578198 
+-18.070301 -13.779700 99.544848 
+-19.446700 -12.923300 99.541648 
+-17.209300 -11.720700 99.545348 
+-16.739900 -11.550100 99.520048 
+-19.026900 -9.703100 100.061552 
+-17.887701 -12.452300 99.546148 
+-15.971300 -11.148700 99.559348 
+-15.678100 -9.831900 101.605949 
+-15.446900 -11.083100 102.661550 
+-20.269301 -9.190700 100.045352 
+-19.640699 -10.939300 98.474647 
+-21.477400 5.407400 100.046302 
+-18.805799 -11.964200 96.437102 
+-17.937401 -2.042600 95.886298 
+-17.162600 -0.177400 91.728702 
+-18.283601 0.073600 95.878198 
+-20.225801 -2.194200 95.902098 
+-19.877400 -1.292600 97.466303 
+-17.522800 -8.377200 98.513597 
+-19.861900 -0.118100 97.474053 
+-19.426100 1.256100 97.436953 
+-19.457500 -9.512500 96.936249 
+-18.080600 -9.899400 96.954699 
+-20.346100 -9.883900 95.351952 
+-18.459300 -7.490700 96.930349 
+-18.618901 -7.741100 95.880548 
+-18.978800 -8.421200 96.920599 
+-20.064400 -7.895600 97.452803 
+-19.394500 -4.695500 97.452753 
+-19.944901 -8.645100 94.317551 
+-20.432301 -8.337700 95.883848 
+-19.915901 -5.434100 95.892048 
+-21.048100 -0.571900 95.905948 
+-14.592100 8.032100 80.798946 
+-1.273500 -10.286500 100.048252 
+2.758700 -11.898700 101.104353 
+4.969800 -11.599800 101.074903 
+0.497400 -11.537400 101.103703 
+0.686300 -10.626300 101.633149 
+-1.961500 -11.018500 100.049252 
+8.126300 -10.126300 100.583148 
+3.692500 -11.092500 102.666250 
+6.195400 -11.235400 102.677700 
+6.806500 -13.476500 102.123254 
+5.796200 -12.036200 102.148104 
+7.812300 -13.262300 101.596149 
+7.333800 -11.483800 102.121904 
+4.534400 -13.864400 102.132204 
+0.311100 -12.631100 101.100553 
+-2.320100 -13.109900 101.094953 
+-0.060000 -12.310000 102.650000 
+7.110100 -12.570100 103.695051 
+-13.817700 -9.012300 99.521148 
+-11.398700 -9.541300 101.090653 
+-13.059600 -9.500400 97.980200 
+-1.984100 -10.455900 101.612949 
+-10.137700 -10.152300 97.456153 
+-10.090500 -11.269500 97.479753 
+-7.062300 -11.657700 98.473847 
+-10.540700 -9.509300 99.529648 
+-8.871800 -10.628200 100.589098 
+-9.435300 -11.774700 99.022351 
+-12.858100 -11.651900 99.020951 
+-10.158400 -11.291600 100.555798 
+-14.481000 -12.549000 97.469503 
+-9.823700 -10.536300 102.638150 
+-4.578100 -11.361900 101.630949 
+-4.400300 -11.479700 100.034852 
+-13.624600 -10.285400 97.952700 
+-12.417300 -11.102700 102.671350 
+-12.059100 -11.050900 101.110453 
+-13.340600 -10.629400 101.079703 
+-12.703600 -11.966400 100.583198 
+-13.709000 -11.591000 101.070503 
+-13.886400 -11.173600 102.646800 
+-14.580800 -10.569200 102.654600 
+-16.395599 -13.674400 96.957199 
+-15.273900 -12.876100 94.853047 
+-16.463399 -12.186600 95.398302 
+-16.845900 -12.194100 97.467053 
+-16.270699 -10.559300 94.849647 
+-14.895900 -7.924100 95.357052 
+-15.952600 -11.837400 95.888698 
+8.999400 -8.169400 88.624699 
+-1.951400 -7.968600 80.839296 
+1.519900 -13.839900 99.029951 
+-3.163900 -13.006100 99.523048 
+-2.444000 -8.756000 87.058002 
+-2.377500 -11.922500 96.416252 
+-5.825300 -11.704700 98.497347 
+-4.285300 -11.234700 98.502347 
+-3.072700 -9.337300 92.783653 
+-2.852700 -9.197300 91.228648 
+-10.256200 -13.323800 100.046902 
+-7.767800 -12.682200 99.541098 
+3.179500 -5.899500 75.594749 
+3.816800 -5.836800 74.068402 
+5.268300 -4.898300 74.594148 
+5.013300 -5.403300 77.176647 
+4.839400 -5.449400 76.149704 
+-0.478400 -6.161600 78.725802 
+-3.160100 -6.699900 78.209948 
+4.905800 -4.335800 74.037902 
+5.658800 -5.768800 73.034401 
+-18.743100 -12.386900 94.838447 
+-5.969000 -5.351000 71.455503 
+-14.914300 -4.505700 78.207848 
+-12.596700 3.606700 72.476647 
+-16.529799 -2.190200 87.570098 
+-14.929800 -2.460200 80.835096 
+-16.021900 -2.008100 85.479047 
+-16.434299 -4.845700 85.492847 
+-17.649101 -4.930900 92.780453 
+-17.411000 -5.029000 91.759502 
+-15.047400 -7.062600 89.661300 
+-19.743401 -10.336600 92.773303 
+-19.632000 -11.398000 92.253999 
+-20.240601 -10.509400 94.334701 
+-8.613500 -8.606500 90.718251 
+-10.367600 -8.342400 93.286200 
+-14.576100 -12.593900 91.751952 
+-15.813600 -11.806400 91.203198 
+-16.881300 -10.578700 93.819346 
+-5.934000 -8.366000 88.118003 
+-3.775600 -6.304400 76.112204 
+-3.915400 -5.844600 74.572298 
+-2.848200 -4.781800 73.530898 
+1.946800 -5.566800 71.978400 
+3.504500 -4.074500 74.042252 
+3.815800 -4.355800 72.992901 
+4.350600 -5.480600 71.435303 
+4.330000 -5.250000 72.494997 
+3.807500 -5.237500 70.398752 
+2.250300 -5.580300 73.030151 
+-1.741100 -4.118900 73.514448 
+-0.621600 -3.908400 71.474203 
+-1.640700 -5.509300 77.179647 
+-1.134300 -4.735700 76.117854 
+0.886300 -4.846300 77.178147 
+0.960500 -4.980500 75.595249 
+19.434700 -15.774700 122.917349 
+16.403399 -15.823400 113.566698 
+14.380000 -13.650000 106.839996 
+12.812500 -13.552500 106.791246 
+12.593000 -14.553000 106.286500 
+14.959600 -14.949600 109.944799 
+14.348700 -12.868700 108.369352 
+14.253200 -14.333200 110.456603 
+15.051900 -15.101900 112.025951 
+19.063800 -12.133800 118.796903 
+17.765000 -16.035001 115.677500 
+-1.132400 -12.367600 103.168797 
+-7.281300 -14.248700 101.594349 
+-12.936200 -13.733800 102.126904 
+-19.031599 -1.878400 99.009201 
+-18.427901 2.807900 98.486047 
+5.566800 -11.906800 104.233398 
+8.440000 -10.640000 104.229998 
+18.891900 1.818100 107.355951 
+-20.619101 -12.610900 92.240449 
+2.507200 -0.277200 49.103599 
+18.247300 3.062700 102.113654 
+19.661600 11.418400 109.920799 
+17.886900 4.673100 102.113454 
+-19.567501 14.097500 89.146254 
+-8.484300 9.104300 61.052852 
+-10.928400 9.608400 64.670801 
+9.342000 5.998000 62.605999 
+12.389100 10.620900 74.074552 
+23.612199 17.337800 114.111103 
+20.930699 7.409300 110.460353 
+19.408001 3.942000 107.339001 
+21.632499 12.437500 109.396252 
+19.459799 11.880200 107.834897 
+21.044199 9.885800 109.952099 
+19.995600 12.884400 111.507797 
+20.822699 10.117300 112.011351 
+21.259400 9.530600 112.034701 
+20.094301 15.515700 110.992150 
+22.501500 15.058500 110.950750 
+21.912701 12.347300 111.506347 
+19.004100 15.795900 105.242049 
+19.710200 15.499800 108.905098 
+21.259000 16.191000 110.434503 
+17.803699 13.776300 102.156854 
+15.177400 9.722600 87.078702 
+21.939200 -18.989199 138.529598 
+23.911700 -13.801700 146.315851 
+9.310900 -2.930900 62.110449 
+23.127999 13.542000 113.034002 
+22.026599 15.673400 113.068302 
+22.630500 10.409500 114.110253 
+22.306500 13.003500 113.578248 
+21.877799 12.492200 113.558898 
+22.036099 10.133900 114.108053 
+9.660500 -9.490500 100.570248 
+13.234500 -11.634500 105.267249 
+15.683900 -11.453900 110.986950 
+15.229400 -10.339400 108.919698 
+16.328500 -11.218500 110.444253 
+11.132700 -14.082700 102.661350 
+14.446700 -13.526700 106.293350 
+10.165900 -10.055900 104.192948 
+11.387200 -9.647200 103.683601 
+12.260800 -13.720800 104.740402 
+11.562800 -13.462800 106.811396 
+20.435100 -3.325100 110.967550 
+21.217500 1.302500 117.223748 
+20.850901 2.799100 115.150454 
+22.218400 5.011600 117.219198 
+22.275201 5.924800 114.597599 
+23.548200 4.351800 118.784103 
+23.407600 2.952400 119.283800 
+20.810401 -3.450400 115.130204 
+22.672000 1.668000 119.800996 
+23.458500 0.581500 119.309250 
+22.526901 -4.516900 119.833446 
+26.467201 -2.627200 129.168597 
+25.050799 -2.240800 126.560398 
+-18.884899 -12.705100 96.397552 
+-20.838900 -11.701100 96.910549 
+-20.707300 -10.302700 94.346351 
+-21.245200 12.155200 100.077402 
+-2.979900 -0.100100 53.750049 
+-1.436100 -1.653900 54.831950 
+-1.004900 -1.265100 54.287550 
+-4.738300 -2.201700 54.835850 
+-2.840700 -0.669300 54.839650 
+-2.847700 3.237700 55.851151 
+-3.452400 4.162400 56.373802 
+-1.977500 1.127500 54.316250 
+-3.410300 2.150300 55.324851 
+-9.306400 1.176400 60.556801 
+-9.533000 1.113000 61.563498 
+-9.235700 1.735700 61.552148 
+-5.845100 -0.054900 57.392449 
+-6.742400 -0.627600 58.988800 
+-6.203500 -2.826500 56.913248 
+-6.574700 -0.845300 58.472650 
+-4.095700 0.715700 55.857151 
+-3.577500 -1.022500 55.876251 
+-1.324400 4.944400 58.997800 
+1.937000 -0.987000 50.133500 
+0.420500 1.349500 53.775249 
+2.204900 0.255100 50.642450 
+8.248700 -1.888700 59.484350 
+6.950800 0.389200 57.935399 
+-0.660600 -0.699400 53.269699 
+-1.436900 0.696900 53.776549 
+-2.051700 1.461700 55.334151 
+-1.472900 -0.287100 54.813550 
+-0.004700 0.984700 54.317650 
+-0.319900 -2.520100 57.950049 
+3.078400 -1.708400 53.254199 
+5.237000 3.113000 55.848501 
+-1.456500 2.376500 55.346751 
+5.973600 2.056400 55.336801 
+3.632100 -0.452100 52.756048 
+3.661100 0.328900 51.675551 
+5.372600 3.557400 57.401299 
+-1.218900 5.388900 56.375552 
+-16.900299 0.640300 92.754853 
+-8.766600 -8.563400 94.831697 
+-17.369600 11.989600 98.505197 
+-14.430800 11.680800 83.424602 
+-18.450301 11.330300 98.474847 
+-18.156600 12.666600 92.276699 
+-19.437900 12.877900 95.391052 
+-19.977801 5.607800 97.986100 
+7.468500 -4.268500 67.279250 
+7.634000 -4.934000 68.831997 
+6.310500 -3.440500 68.330251 
+-17.804000 13.144000 97.973000 
+-19.238299 12.828300 98.505847 
+-16.842600 13.172600 89.123704 
+-17.875700 9.275700 97.457153 
+-17.528501 10.848500 95.360752 
+-10.420200 1.940200 61.599898 
+-5.235100 4.685100 57.397449 
+-10.689100 1.659100 62.080449 
+-9.898600 0.778600 63.675700 
+-6.698200 -4.701800 70.430902 
+-10.887500 -1.062500 63.111250 
+0.190800 -3.010800 71.970400 
+-0.084200 -3.165800 74.037902 
+-8.963700 6.073700 65.758152 
+-9.851000 6.131000 66.774503 
+-2.943200 -6.006800 79.243399 
+-2.575900 -4.564100 76.122054 
+-10.995400 5.735400 71.472303 
+7.643600 5.836400 61.051802 
+6.448300 4.791700 58.964150 
+-1.015200 6.165200 57.427399 
+11.096800 9.553200 71.478403 
+9.057300 6.952700 65.208648 
+-8.771400 3.781400 62.074299 
+-3.283700 7.473700 57.433149 
+-2.533300 6.363300 57.943349 
+-3.161800 8.221800 57.929099 
+-6.149500 6.839500 58.980250 
+-7.230500 8.290500 61.049752 
+-7.556200 4.366200 60.541901 
+-9.994300 4.304300 64.187847 
+-8.963900 4.083900 63.148050 
+-7.231200 8.501200 62.094399 
+-4.680400 9.130400 60.029801 
+-8.176900 6.906900 62.606549 
+-6.618500 9.308500 63.665750 
+-6.622300 8.532300 63.663850 
+7.832100 4.517900 61.581048 
+9.177400 6.492600 64.188697 
+11.363700 8.996300 73.526848 
+-14.315900 8.395900 81.857047 
+9.925000 -8.095000 91.732502 
+7.637400 -8.527400 92.273699 
+-16.025100 -1.074900 87.597448 
+13.503600 11.316400 80.826796 
+14.441300 4.428700 82.915648 
+3.068000 -5.418000 79.238999 
+5.164300 -4.084300 73.037151 
+-19.133900 10.793900 100.578048 
+-19.882701 9.742700 100.553648 
+-21.877999 8.168000 101.086003 
+-18.307699 12.037700 100.076152 
+-18.956600 8.146600 99.531698 
+-20.833301 8.623300 99.538348 
+-20.579900 5.269900 98.515047 
+-21.368699 7.318700 97.965650 
+-15.711300 -13.398700 102.149354 
+-18.242199 -14.137800 99.543898 
+-19.128900 -13.381100 99.530548 
+-18.751200 -13.208800 101.079403 
+-17.369601 -13.450400 100.595198 
+-15.470100 -10.289900 99.554948 
+-17.622000 -11.998000 97.979000 
+-18.969501 -12.970500 97.985250 
+-20.297800 -9.522200 98.486097 
+-20.041400 -8.988600 97.464303 
+-22.337700 6.107700 101.606149 
+-21.421200 4.661200 98.519397 
+-19.942101 -5.897900 94.318951 
+-20.196300 -2.363700 97.471853 
+-20.205400 0.605400 97.467303 
+-20.026100 1.306100 97.471953 
+-19.501500 0.671500 96.914249 
+-18.046900 -9.563100 98.506547 
+-20.152400 -9.007600 96.918799 
+-19.113601 -8.916400 98.483197 
+-19.917400 -5.452600 98.991301 
+-19.058700 -7.431300 97.455653 
+-20.600200 -5.409800 95.879898 
+-20.391500 -4.828500 97.459253 
+-18.158801 0.618800 95.375602 
+-18.085800 -0.914200 94.352101 
+-21.077800 1.227800 97.451103 
+-20.904700 3.534700 95.892648 
+-20.725500 -0.774500 94.337251 
+1.656800 -12.046800 99.528398 
+1.375800 -10.685800 101.107903 
+-2.204500 -9.755500 96.942749 
+2.351300 -13.141300 100.560648 
+4.268100 -13.268100 100.564048 
+4.446000 -11.966000 101.073003 
+1.185800 -12.065800 102.652900 
+3.278700 -13.098700 102.124354 
+2.657400 -11.867400 102.678700 
+-0.041200 -11.088800 101.619399 
+4.417300 -12.107300 102.673650 
+7.918300 -9.928300 102.149154 
+5.226100 -13.316100 101.623049 
+7.224300 -13.044300 102.157154 
+7.005200 -14.205200 101.632599 
+-0.241100 -13.088900 101.084453 
+-1.299100 -11.680900 101.605449 
+-0.725400 -11.414600 101.107303 
+-3.895800 -12.704200 101.622099 
+-2.657700 -12.092300 101.626149 
+-1.259700 -13.020300 102.145154 
+5.117700 -13.427700 103.683851 
+6.028100 -12.468100 104.194048 
+-9.005600 -11.644400 97.432203 
+-7.580700 -10.549300 99.009651 
+-8.126200 -9.903800 98.991901 
+-9.141600 -11.488400 98.999201 
+-9.957600 -9.722400 100.566198 
+-6.761800 -12.628200 100.064102 
+-10.849200 -11.060800 97.435403 
+-10.337200 -11.122800 98.996401 
+-15.430000 -13.560000 99.015001 
+-13.858600 -13.471400 99.030701 
+-11.126300 -12.393700 98.481847 
+-5.201100 -10.968900 102.114454 
+-4.884800 -10.385200 100.587598 
+-7.142300 -10.377700 100.583848 
+-9.404900 -10.375100 102.127554 
+-2.794400 -12.145600 100.062802 
+-3.641800 -11.558200 98.484097 
+-4.366100 -10.783900 100.051952 
+-16.248799 -12.571200 95.905598 
+-15.558200 -9.601800 100.070902 
+-12.069800 -11.720200 102.115104 
+-12.968800 -11.831200 102.110604 
+-14.535100 -11.014900 101.092453 
+-13.630600 -11.569400 99.529698 
+-16.839200 -13.770800 98.515397 
+-15.121400 -13.008600 95.889298 
+-16.586300 -7.463700 93.801846 
+-16.328800 -11.351200 97.950600 
+-14.892000 -11.678000 97.994000 
+-1.479300 -7.400700 81.845347 
+1.704500 -9.164500 92.257249 
+-2.526900 -13.033100 97.476553 
+0.609300 -13.289300 98.999651 
+-5.638200 -12.681800 98.505897 
+-2.951500 -9.328500 90.199247 
+-8.721500 -12.178500 98.494247 
+-10.965500 -12.024500 99.027251 
+-9.812600 -12.037400 97.448703 
+4.922200 -5.582200 75.621099 
+3.014000 -6.524000 74.052002 
+2.992300 -5.082300 76.651150 
+3.315700 -5.645700 77.702851 
+-0.489900 -6.620100 79.760053 
+-2.971100 -6.778900 76.119454 
+-0.741400 -7.228600 79.774303 
+7.418000 -5.658000 71.979000 
+4.855800 -5.685800 74.582898 
+-15.413100 -6.296900 84.993450 
+-13.719500 7.869500 77.700251 
+-13.932100 5.432100 80.283950 
+-14.582700 -7.297300 93.833646 
+-16.340899 -0.519100 89.144554 
+-16.430900 -7.379100 92.264549 
+-16.089500 -7.260500 92.760253 
+-20.344100 -10.375900 92.792953 
+-15.898200 -12.141800 92.775903 
+-17.373301 -10.936700 95.353352 
+-3.282800 -6.947200 76.158604 
+-4.096200 -5.783800 73.541898 
+-4.712700 -4.817300 73.548648 
+-5.949000 -5.221000 73.025501 
+-3.369100 -5.470900 76.115454 
+-5.298600 -6.371400 75.600699 
+-2.107300 -4.812700 75.101353 
+-2.906500 -5.103500 74.561748 
+-1.200300 -4.249700 72.479847 
+3.349200 -4.039200 73.014601 
+3.784100 -5.264100 71.457053 
+3.755100 -5.135100 73.027551 
+1.703800 -4.023800 73.006901 
+1.724800 -4.194800 71.992400 
+0.728000 -4.668000 76.129004 
+-1.398100 -6.191900 79.785953 
+1.302400 -4.142400 75.636199 
+0.616200 -5.796200 76.138104 
+1.033800 -5.393800 76.666900 
+0.773000 -5.513000 78.736502 
+2.573000 -4.103000 75.111503 
+2.523700 -4.603700 75.086853 
+3.848400 -4.078400 75.099203 
+0.352600 -5.902600 75.101303 
+14.779300 -13.719300 108.399652 
+14.169000 -13.929000 108.374502 
+14.034200 -12.924200 108.887098 
+13.809100 -14.669100 109.939549 
+15.374200 -15.574200 111.992101 
+14.246600 -14.726600 110.453303 
+14.163200 -15.183200 109.926599 
+17.995099 -14.645100 116.172547 
+18.727100 -12.777100 116.718551 
+5.203500 -14.453500 102.116754 
+-7.577200 -12.942800 101.621399 
+-12.417200 -14.212800 102.121404 
+-10.189200 -13.710800 101.630399 
+-12.684800 -12.595200 100.592598 
+-18.994600 3.034600 100.077702 
+17.938500 1.271500 102.139254 
+18.172200 1.587800 103.676101 
+20.542300 8.107700 112.536148 
+-8.325600 8.975600 60.522201 
+12.273400 11.316600 74.556698 
+11.399500 10.250500 69.889748 
+20.038900 15.501100 106.809446 
+19.741400 12.578600 109.395702 
+21.220699 13.649300 107.315351 
+20.607401 11.942600 110.958700 
+21.035200 8.784800 110.982600 
+20.700001 9.330000 110.440003 
+21.564700 11.035300 113.597348 
+21.831000 16.478999 112.030501 
+22.718699 15.041300 110.959350 
+22.218999 13.341000 110.999500 
+21.832900 16.197100 110.431453 
+21.624699 13.385300 109.392352 
+20.001500 14.638500 109.430752 
+20.050601 16.059400 108.890298 
+13.800800 8.389200 81.310401 
+8.918300 -3.068300 61.594148 
+9.239100 -2.609100 62.609549 
+24.849800 4.640200 121.359902 
+23.048699 12.901300 113.559348 
+11.362700 -9.082700 100.551348 
+12.453900 -9.783900 105.236949 
+8.091000 -10.551000 102.150504 
+13.143600 -13.903600 106.286800 
+9.834300 -14.154300 108.357152 
+11.236900 -14.266900 108.898448 
+24.045800 2.204200 119.297900 
+21.579900 -1.089900 117.204948 
+24.209099 0.660900 121.354552 
+-19.920200 -12.139800 96.954899 
+-19.705199 -12.014800 96.402402 
+-21.253200 -11.796800 96.958399 
+-20.864600 -10.305400 94.347701 
+-22.000500 12.300500 101.599749 
+-1.911700 -1.348300 55.359151 
+-2.414800 -1.665200 55.347601 
+-1.634800 -0.775200 53.242599 
+-0.924200 -0.765800 52.752898 
+-4.062100 6.662100 56.903948 
+-2.764500 4.794500 55.312751 
+-9.752800 -0.927200 60.543601 
+-9.007200 1.597200 61.056402 
+-4.900900 -3.109100 57.959549 
+-3.373400 0.763400 55.833301 
+-0.303400 1.973400 53.788299 
+6.939600 -0.359600 57.439799 
+-0.322800 2.972800 54.818600 
+2.601000 -0.291000 50.120500 
+5.754300 1.385700 55.862151 
+-1.026300 3.766300 55.321851 
+8.488900 -3.988900 63.154450 
+-8.255500 -9.234500 97.472253 
+-8.875700 -9.104300 96.412152 
+21.135701 13.684300 106.807846 
+-18.171500 12.571500 97.959250 
+-16.929101 13.089100 94.845447 
+-18.142899 12.772900 93.833546 
+-17.440600 12.530600 94.834697 
+7.168700 -4.628700 69.389352 
+-19.107301 11.067300 98.486347 
+-17.802200 11.132200 96.923899 
+-10.431200 -0.448800 61.079402 
+-10.630100 0.010100 64.709951 
+-2.191800 6.771800 57.914099 
+-9.452200 4.712200 64.178897 
+-10.022000 3.532000 64.679001 
+-8.746800 8.916800 62.591599 
+-7.065500 8.015500 62.072249 
+-8.323400 7.803400 64.193297 
+-8.401500 5.931500 64.154247 
+-8.958500 7.108500 64.150747 
+-7.750500 6.760500 63.154750 
+6.902000 -4.952000 73.026001 
+9.089200 5.610800 64.199597 
+2.031200 -9.061200 93.800596 
+0.774000 -9.234000 95.372002 
+6.025700 -8.835700 94.357851 
+-18.693999 10.284000 99.008001 
+-20.413700 5.623700 98.513147 
+-21.500199 7.400200 97.984900 
+-20.939700 -9.680300 98.505147 
+-20.005100 -12.404900 99.522448 
+-15.512100 -13.887900 100.568948 
+-18.016201 -13.173800 99.001901 
+-19.614299 -8.925700 98.487847 
+-20.485701 -7.234300 93.302150 
+-20.235900 0.045900 97.452053 
+-20.594000 -6.066000 98.998001 
+-19.252000 -7.988000 97.439003 
+-20.366200 -5.503800 94.351901 
+-20.729201 -8.130800 95.900398 
+-20.545800 -7.314200 94.342101 
+-19.504900 -7.225100 96.912549 
+-17.878101 0.438100 95.350952 
+-21.312100 3.762100 98.488947 
+3.354600 -12.344600 99.007301 
+4.605200 -13.745200 100.557598 
+1.130300 -12.400300 99.520148 
+2.467000 -12.477000 102.673500 
+2.390500 -11.400500 102.635250 
+-4.104200 -10.285800 98.507897 
+5.943600 -13.203600 101.626799 
+-0.886200 -12.363800 102.676900 
+-9.807600 -10.262400 97.451203 
+-4.884100 -10.545900 100.052952 
+-6.285300 -10.394700 100.042352 
+-5.408200 -11.391800 100.050902 
+-7.472800 -12.127200 100.053602 
+-13.600500 -13.159500 100.569748 
+-14.267400 -12.442600 98.996301 
+-11.429100 -12.900900 98.500447 
+-15.557100 -13.072900 97.436453 
+-11.864500 -12.355500 97.432753 
+-7.649700 -10.000300 102.125154 
+-3.450800 -12.419200 100.079602 
+-12.173600 -12.366400 99.018201 
+-15.638900 -12.681100 98.995551 
+-14.039000 -11.321000 97.995500 
+-5.541200 -9.768800 96.949399 
+-9.023300 -12.576700 98.513347 
+-10.629400 -11.940600 97.460303 
+-0.440800 -6.669200 80.829596 
+-2.398300 -5.061700 76.140854 
+4.359800 -4.659800 73.014901 
+-17.483601 -4.606400 92.783203 
+-3.060700 -6.689300 75.079653 
+-3.945400 -6.184600 74.557298 
+-5.946100 -5.913900 75.601949 
+-5.400000 -6.040000 77.164997 
+3.948800 -4.358800 72.489397 
+-1.300700 -4.529300 74.594648 
+-1.090000 -4.620000 75.095003 
+-0.904500 -4.375500 73.552748 
+1.464500 -5.244500 74.042252 
+-1.689200 -5.650800 78.205398 
+-3.034000 -6.826000 79.267999 
+-0.047900 -5.592100 77.176047 
+3.118000 -5.058000 75.633999 
+14.808100 -12.418100 108.899048 
+16.335901 -15.715900 111.507947 
+-1.860800 -14.149200 102.634600 
+-11.396100 -13.473900 101.091953 
+-9.172300 -11.177700 102.153854 
+-12.565700 -13.394300 100.567148 
+-19.577500 1.877500 100.046252 
+8.466200 -9.386200 100.578098 
+19.573299 12.556700 109.406652 
+21.416699 14.473300 113.053352 
+22.896101 13.143900 113.578048 
+11.592400 -9.272400 100.581198 
+24.156601 5.503400 118.783303 
+-19.708999 -12.051000 94.845497 
+-21.051500 -9.698500 97.464253 
+-21.918201 12.088200 102.130904 
+-2.026100 -1.613900 55.831951 
+-4.465300 6.075300 57.437349 
+-2.882900 5.062900 55.348551 
+-3.651000 -2.789000 58.954500 
+-5.789400 -0.200600 57.915299 
+-0.009000 0.189000 52.235502 
+-18.146099 12.766100 96.436952 
+-17.815799 13.105800 93.837096 
+-5.299400 -5.510600 76.135304 
+-4.335300 -4.734700 74.557348 
+-6.351800 7.451800 61.064102 
+-6.890500 8.200500 61.059752 
+-8.940100 7.870100 64.714951 
+9.550500 3.949500 63.675250 
+8.953900 4.346100 62.631949 
+-18.979699 9.259700 99.035151 
+-16.512000 -12.938000 99.548998 
+-20.079299 -8.850700 98.510347 
+5.940500 -12.870500 102.130254 
+0.809800 -13.409800 102.639900 
+1.534600 -13.684600 100.587298 
+9.148800 -14.488800 106.804396 
+-9.647300 -11.772700 100.551348 
+-8.129600 -12.640400 100.070202 
+-13.581900 -11.868100 97.974050 
+-3.431600 -12.718400 99.559198 
+-16.493100 -12.906900 97.953450 
+6.116500 -8.966500 93.318250 
+-7.767700 -12.922300 99.541148 
+-3.544400 -13.235600 101.092803 
+-5.058200 -11.761800 96.940899 
+1.882300 -5.152300 73.036151 
+1.651600 -4.141600 74.075802 
+1.381800 -3.981800 75.095903 
+-0.766000 -6.334000 80.806996 
+2.533300 -5.673300 74.576648 
+-20.022500 1.102500 99.023751 
+-20.421800 -0.278200 98.994101 
+20.742200 9.897800 108.386102 
+20.921700 15.538300 106.790846 
+10.002500 -14.412500 108.351252 
+-20.510999 -12.299000 94.854497 
+-3.427100 4.807100 55.851451 
+-4.795400 8.915400 60.512301 
+-5.921800 8.331800 62.104099 
+-17.686700 -12.443300 98.996651 
+6.241100 -12.721100 103.705551 
+1.394800 -13.844800 102.667400 
+-4.408600 -13.111400 101.095703 
+-4.308600 -13.251400 101.590699 
+-4.643600 -12.316400 97.958200 
+1.869400 -4.909400 74.054702 
+20.499800 9.810200 108.359902 
+19.769800 9.660200 108.369902 
+20.653601 9.906400 109.941799 
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/thom384.pts b/Alpha_shapes_3/demo/Alpha_shapes_3/data/thom384.pts
new file mode 100644
index 000000000000..36c8cf42d385
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/thom384.pts
@@ -0,0 +1,384 @@
+383  
+27.850301 -17.970299 134.875148 
+-30.421501 -21.008499 144.254249 
+0.114400 -1.784400 50.132200 
+-18.264400 12.484400 101.627799 
+17.396600 -1.906600 99.023301 
+21.063600 -19.043600 132.826796 
+29.463299 -5.123300 142.671651 
+28.427000 -18.197000 149.973500 
+20.364199 6.405800 114.632099 
+14.811500 -9.141500 105.235749 
+19.542701 -11.952700 123.446353 
+-15.004000 -8.116000 98.497997 
+-10.693900 -4.016100 58.998050 
+-24.134400 11.784400 107.332801 
+-23.475999 8.946000 104.191998 
+-4.457700 9.027700 56.901148 
+16.912700 15.277300 98.476347 
+12.924100 12.075900 77.677051 
+-21.715099 6.515100 96.397452 
+10.053100 -2.053100 61.576548 
+8.974900 -5.644900 68.852447 
+8.249500 -14.839500 101.639749 
+29.422501 -20.732500 142.186247 
+27.104600 -21.824600 149.962300 
+31.013999 -2.164000 149.977000 
+27.157400 -17.317400 149.988700 
+30.981799 -14.521800 149.960900 
+31.027899 -19.127900 149.983950 
+20.507200 17.852800 112.518598 
+21.309300 -12.729300 134.384644 
+19.385099 -11.085100 123.957550 
+22.975500 -13.585500 143.232755 
+14.246800 -7.776800 92.238399 
+15.299200 -12.349200 106.839596 
+-20.686101 6.686100 104.721952 
+10.410300 -14.950300 109.945149 
+-0.572800 -12.837200 104.743602 
+9.430900 -11.520900 105.765453 
+22.088301 -9.988300 120.869147 
+18.696699 -9.706700 114.113353 
+20.051600 -15.941601 125.510798 
+17.014300 -12.824300 114.637149 
+25.541301 -12.251300 134.885648 
+22.033800 -2.333800 121.891898 
+-18.289400 -7.380600 96.930299 
+-21.954500 4.094500 101.622749 
+-19.513600 4.613600 100.078202 
+-20.256000 10.436000 98.992001 
+-13.608300 -11.011700 97.960850 
+-2.165500 -7.894500 80.802246 
+-2.200600 2.110600 56.369702 
+14.424000 10.726000 88.107003 
+-17.650600 6.960600 97.964700 
+-16.106900 1.746900 89.671550 
+3.865300 -3.635300 75.612649 
+3.290200 -2.310200 69.370102 
+-16.555599 8.445600 91.712202 
+-7.549400 1.549400 62.095299 
+7.074300 -4.804300 73.542148 
+10.674700 -9.114700 102.117354 
+6.940000 -9.100000 95.914998 
+-20.917200 -9.272800 92.751403 
+-4.043800 -2.546200 51.163101 
+-15.706300 -13.303700 92.791853 
+-22.591499 15.911500 100.584248 
+-15.927600 14.587600 91.711202 
+3.550800 8.709200 54.815400 
+-19.986700 12.906700 96.921649 
+-11.174600 7.344600 64.152697 
+5.729900 -1.889900 53.249949 
+7.298300 1.991700 57.419149 
+17.288300 -16.248301 111.504147 
+11.139900 -5.079900 66.779953 
+9.299900 -4.059900 60.559951 
+23.049200 11.560800 111.494597 
+24.139500 4.980500 116.704751 
+29.687400 -21.817400 149.958700 
+22.317100 -19.487100 141.113554 
+23.782200 -13.892200 146.856105 
+28.643601 -7.063600 145.816796 
+-19.830300 13.350300 103.164847 
+19.028700 14.271300 109.414352 
+28.074900 -4.714900 140.597449 
+22.833101 4.646900 119.306550 
+22.090100 5.439900 116.685051 
+22.567500 9.082500 114.078753 
+20.163701 14.096300 113.586848 
+20.742100 -11.562100 131.231049 
+21.981901 -17.111900 134.370944 
+25.385999 -12.786000 140.117995 
+24.287300 -11.777300 136.968650 
+27.245601 -13.955600 143.737795 
+27.890600 -16.050599 147.355294 
+21.251200 -8.951200 115.150604 
+12.877700 -11.097700 103.713851 
+-18.707900 5.677900 101.101053 
+12.688800 -9.448800 105.264399 
+-11.035400 -9.444600 102.652300 
+-14.368000 -10.892000 101.091003 
+-1.861500 -14.028500 102.634250 
+-13.923300 -12.566700 98.998351 
+12.485200 -11.985200 105.252599 
+11.048700 -13.378700 106.834346 
+15.585200 -10.855200 108.912598 
+16.027501 -12.237500 112.513748 
+14.253200 -14.333200 110.456603 
+16.070500 -14.640500 114.080253 
+17.983100 -12.533100 114.631549 
+6.535600 -13.215600 105.777803 
+21.772400 1.057600 117.201198 
+22.093599 -4.353600 119.821796 
+12.941200 -11.261200 110.465603 
+8.894700 -11.624700 107.357351 
+19.696600 0.693400 108.898298 
+21.726600 6.443400 112.543298 
+18.646500 -13.406500 116.678251 
+21.180000 -14.900000 129.675001 
+24.322701 -5.942700 126.056352 
+20.577200 -13.737200 125.553598 
+23.806999 -11.367000 134.358494 
+21.780000 -11.330000 131.770003 
+23.553400 -3.403400 121.911698 
+-18.976199 -4.463800 99.036901 
+-18.976499 -2.053500 99.036751 
+-20.277900 -7.612100 97.431053 
+-20.563300 -1.986700 97.458353 
+-21.594099 7.434100 103.177947 
+-20.604900 6.144900 101.112553 
+-19.292400 9.542400 100.588798 
+-22.819500 11.419500 103.675251 
+-21.773300 11.133300 102.113354 
+-16.047000 -8.803000 98.486497 
+-17.838200 -12.431800 97.955900 
+-18.931901 -9.888100 98.489047 
+-2.144400 1.054400 53.792799 
+-4.323100 1.703100 55.838451 
+1.430600 -2.270600 61.570298 
+-2.026100 -1.613900 55.831951 
+2.131900 -1.761900 54.815950 
+-0.320800 -1.229200 52.214602 
+6.954800 -1.014800 57.937399 
+4.719600 1.400400 55.329801 
+-6.380700 2.000700 58.964650 
+1.736200 -5.286200 72.513097 
+5.514400 -4.744400 71.962200 
+3.504500 -4.074500 74.042252 
+-0.940300 5.240300 57.939849 
+0.447400 8.312600 61.558698 
+7.754600 1.155400 61.057302 
+7.038400 3.821600 60.524201 
+-18.130300 12.180300 96.929849 
+0.591600 -4.271600 79.750803 
+-16.671001 -7.499000 95.374502 
+-17.649101 -4.930900 92.780453 
+-14.640000 -9.350000 96.914999 
+-9.162100 -7.997900 88.098953 
+-15.918000 -6.132000 86.515998 
+-19.701600 12.661600 100.069202 
+-20.835200 13.045200 96.912399 
+-18.631699 13.451700 92.279149 
+-18.708099 7.788100 96.405952 
+-7.977300 3.337300 60.541351 
+-10.023200 0.453200 62.598399 
+-7.388900 -3.921100 68.870547 
+-3.846100 -3.533900 69.391952 
+0.788000 -3.358000 76.674000 
+-2.012200 -3.767800 75.083903 
+-7.760200 6.150200 62.099899 
+-9.870600 7.370600 66.764703 
+-11.900100 5.990100 72.514947 
+3.315700 -5.645700 77.702851 
+-0.920200 -10.459800 101.614899 
+-1.343500 -7.016500 82.893248 
+6.011700 -11.191700 100.565848 
+7.105100 -12.185100 103.692551 
+-10.273400 -10.216600 99.028301 
+-11.712200 -9.327800 96.408902 
+-8.960200 -11.809800 97.454903 
+3.113900 -12.953900 100.591948 
+3.243300 -10.013300 101.081653 
+-20.770601 -11.609400 92.244699 
+-19.028101 -12.051900 90.675951 
+-20.208101 13.128100 90.710951 
+-9.834500 10.214500 64.157747 
+4.486300 2.443700 51.688151 
+9.673400 0.846600 60.536701 
+9.712600 8.327400 65.196298 
+13.512100 -4.832100 74.061052 
+12.061000 -4.051000 66.245499 
+22.982500 17.437500 112.026251 
+23.673800 14.956200 114.606899 
+20.499800 9.810200 108.359902 
+21.161500 11.518500 111.515747 
+22.374501 15.865500 108.362252 
+24.998800 -17.598800 145.279407 
+26.518900 -9.998900 142.679451 
+27.565800 -12.355800 145.307907 
+24.669799 -12.679800 143.214905 
+23.095200 -1.885200 121.892598 
+24.370300 1.799700 121.900148 
+21.694800 8.405200 114.607399 
+24.475301 -14.645300 142.167647 
+23.101000 -12.941000 136.965500 
+23.011600 -11.721600 136.445796 
+11.249500 -10.039500 102.144754 
+11.478300 -9.638300 105.789153 
+-12.076300 -11.093700 102.666850 
+-10.158400 -11.291600 100.555798 
+-14.430500 -13.689500 100.589748 
+-11.942100 -12.587900 101.628949 
+4.210800 -13.780800 102.150404 
+11.627100 -10.087100 103.713551 
+13.965000 -12.725000 108.367502 
+13.494400 -10.934400 107.342201 
+11.087800 -11.727800 107.343901 
+17.523701 -10.653700 114.596849 
+15.976999 -14.507000 112.003501 
+22.654100 0.555900 117.237048 
+21.217500 1.302500 117.223748 
+10.458900 -12.888900 110.959450 
+20.789201 -3.569200 115.119604 
+12.419000 -14.169000 106.289500 
+26.735001 -12.275000 134.897498 
+23.753101 -11.153100 131.261549 
+25.044499 -9.814500 134.397244 
+-15.024300 -9.735700 103.167847 
+-18.943901 -9.896100 101.638049 
+-19.183900 -0.826100 97.473053 
+-21.081500 4.011500 100.074252 
+-21.030300 -7.229700 97.474853 
+-20.216900 -5.253100 99.011551 
+-20.370299 9.710300 100.569848 
+-18.827300 4.747300 101.606349 
+-17.820599 -13.119400 96.429702 
+-19.615700 -11.634300 96.937149 
+-17.897401 -11.592600 99.541298 
+-4.505300 -1.134700 55.352351 
+-3.076800 -0.133200 54.281600 
+-1.984000 -0.956000 53.782999 
+-1.971800 5.601800 55.859101 
+4.345700 1.744300 56.382852 
+4.337700 0.212300 53.788849 
+-5.845100 -0.054900 57.392449 
+-2.207900 2.327900 56.896048 
+-4.803200 5.673200 58.448400 
+-3.315500 7.895500 58.437250 
+-4.058200 3.998200 57.390899 
+-2.918700 2.268700 55.330651 
+1.922000 -4.172000 72.991001 
+8.036200 6.673800 64.173097 
+9.331000 0.699000 62.070499 
+15.177400 9.722600 87.078702 
+-15.047600 -11.302400 96.401202 
+-18.230100 -10.259900 96.959949 
+-19.210901 -7.459100 95.914548 
+-20.057501 -6.162500 95.906248 
+-14.785000 9.135000 81.832497 
+-6.880700 -4.639300 67.304650 
+0.504400 -5.664400 76.667200 
+-9.644500 3.944500 63.637750 
+-5.252100 8.492100 60.543951 
+-8.323400 7.803400 64.193297 
+-7.812700 5.902700 64.168647 
+12.889700 -9.189700 101.594849 
+-8.747400 -8.232600 93.291300 
+-8.437700 -9.452300 99.006151 
+4.299700 -11.999700 101.089853 
+-13.059600 -9.500400 97.980200 
+-4.751400 -11.228600 101.629299 
+-5.702600 -11.687400 100.078702 
+-0.019300 -11.130700 99.550348 
+-1.125500 -12.214500 101.077253 
+1.704500 -9.164500 92.257249 
+-8.743600 -12.276400 95.388202 
+-6.535000 -12.745000 98.482497 
+-0.395100 -12.694900 102.657450 
+8.012100 -6.662100 76.156054 
+5.773300 -7.943300 83.946649 
+-13.410600 -8.179400 97.974700 
+2.629100 -10.759100 104.719552 
+17.136201 12.023800 100.573098 
+18.969300 1.950700 106.829646 
+18.233000 12.227000 105.786503 
+19.635699 9.214300 108.397852 
+-19.567501 14.097500 89.146254 
+-10.928400 9.608400 64.670801 
+4.128600 -1.358600 51.189301 
+23.612199 17.337800 114.111103 
+22.350301 12.439700 113.035152 
+20.050601 16.059400 108.890298 
+25.622900 -14.602900 141.656443 
+13.433900 -12.663900 105.271949 
+14.446700 -13.526700 106.293350 
+-12.458200 -10.991800 104.215898 
+-7.977000 -12.133000 102.136504 
+-10.337200 -11.122800 98.996401 
+8.685300 -12.285300 103.677651 
+11.915700 -12.805700 110.432853 
+15.323500 -12.373500 108.876748 
+21.036700 2.813300 115.143354 
+20.474001 -10.874000 126.566998 
+-15.678100 -9.831900 101.605949 
+-18.537900 -9.082100 100.051052 
+-19.415301 0.275300 95.892348 
+-20.074500 -1.855500 98.997751 
+-20.657700 -11.132300 96.921149 
+-16.127301 -11.362700 102.676350 
+-4.404800 -1.805200 55.352601 
+3.603800 0.256200 52.236902 
+-1.456500 2.376500 55.346751 
+-6.989300 -0.650700 59.515350 
+-3.508500 6.938500 57.420749 
+13.405600 2.894400 79.752803 
+5.013300 -5.403300 77.176647 
+-16.463399 -12.186600 95.398302 
+-17.237900 -8.492100 96.956049 
+-15.187700 -11.322300 99.526148 
+-19.380301 -9.519700 94.354851 
+-17.254100 -10.525900 93.792946 
+-10.367600 -8.342400 93.286200 
+-18.943799 -7.526200 94.333101 
+-18.886901 -5.823100 95.911548 
+-18.345499 13.475500 90.702251 
+0.806700 -5.676700 77.718351 
+1.046900 -4.706900 77.708451 
+-9.061500 5.131500 65.209248 
+-11.407800 7.057800 72.511097 
+-4.013600 -10.796400 100.058202 
+3.416100 -12.676100 104.238048 
+2.260000 -12.440000 102.655000 
+7.753900 -12.673900 102.156954 
+9.956900 -9.976900 102.113454 
+7.505000 -11.235000 104.212498 
+5.119000 -10.599000 102.669500 
+-3.021400 -11.178600 103.199297 
+-8.721000 -11.079000 99.034501 
+-5.856500 -11.553500 98.481747 
+3.042600 -10.732600 99.536298 
+1.399600 -11.809600 101.119803 
+-8.425600 8.965600 60.527201 
+2.854500 -0.104500 50.117250 
+20.102601 14.287400 110.996300 
+20.071300 15.338700 106.825646 
+25.300099 -13.550100 140.075045 
+-14.544200 -10.735800 102.672900 
+8.899800 -11.309800 103.694901 
+8.373500 -13.593500 103.701751 
+14.957000 -13.707000 108.393502 
+-14.790800 -10.369200 100.579598 
+-19.526100 -0.693900 99.016951 
+-19.891100 1.501100 99.004451 
+-20.159900 -11.180100 95.360052 
+-19.838100 -11.101900 93.795946 
+3.044600 0.755400 51.682301 
+3.687800 1.442200 52.738898 
+-6.885100 -3.294900 61.557448 
+-6.215400 1.495400 59.492300 
+-17.352500 -7.377500 94.313751 
+-16.239999 -6.860000 91.224998 
+-20.576800 0.046800 95.891598 
+-18.031599 5.911600 96.409202 
+-16.499700 13.289700 90.685151 
+-9.316800 8.566800 63.131600 
+-6.187100 -10.722900 98.486447 
+3.329400 -10.959400 102.659700 
+-9.227300 -10.502700 100.586348 
+-5.203100 -11.776900 96.948449 
+2.934500 -1.344500 50.157250 
+21.912201 13.157800 111.506097 
+-17.928601 0.158600 95.890698 
+-17.785900 3.815900 96.932049 
+-20.299200 3.889200 98.485397 
+4.120400 0.749600 54.270200 
+-17.981600 -6.818400 94.324201 
+-19.942101 -5.897900 94.318951 
+-18.396400 7.436400 94.846797 
+-9.592500 7.612500 63.663750 
+21.840700 14.839300 110.435353 
+-20.119800 2.629800 96.935099 
+21.831000 16.478999 112.030501 
+20.249299 14.330700 108.894648 
+21.416699 14.473300 113.053352 
+21.707799 13.162200 109.433902 
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/data/torus_ran.pts b/Alpha_shapes_3/demo/Alpha_shapes_3/data/torus_ran.pts
new file mode 100644
index 000000000000..0ee8d1f9dec2
--- /dev/null
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/data/torus_ran.pts
@@ -0,0 +1,500 @@
+500
+231.000000 182.000000 0.000351
+14.000000 115.000000 -15.999829
+71.000000 94.000000 31.999592
+68.000000 54.000000 47.999560
+207.000000 119.000000 31.999602
+108.000000 241.000000 -31.999965
+36.000000 131.000000 -31.999798
+61.000000 79.000000 -16.000061
+158.000000 29.000000 47.999573
+171.000000 20.000000 32.000102
+80.000000 21.000000 15.999613
+208.000000 209.000000 -32.000094
+72.000000 154.000000 -0.000168
+130.000000 195.000000 0.000267
+159.000000 185.000000 0.000415
+165.000000 172.000000 -15.999620
+189.000000 138.000000 -16.000149
+180.000000 211.000000 -48.000257
+152.000000 182.000000 -32.000245
+196.000000 216.000000 -0.000361
+171.000000 63.000000 47.999650
+8.000000 118.000000 -0.000377
+167.000000 228.000000 0.000447
+149.000000 64.000000 -0.000335
+26.000000 166.000000 -31.999897
+62.000000 132.000000 15.999507
+129.000000 244.000000 -15.999563
+223.000000 57.000000 15.999837
+142.000000 25.000000 47.999532
+119.000000 12.000000 15.999691
+51.000000 213.000000 -32.000051
+67.000000 59.000000 47.999558
+244.000000 118.000000 16.000059
+229.000000 186.000000 0.000022
+151.000000 232.000000 0.000274
+177.000000 166.000000 -0.000265
+139.000000 71.000000 16.000400
+201.000000 184.000000 16.000257
+149.000000 26.000000 47.999937
+144.000000 184.000000 -32.000347
+212.000000 44.000000 16.000372
+122.000000 243.000000 -32.000271
+63.000000 226.000000 -15.999717
+14.000000 92.000000 -0.000228
+79.000000 191.000000 -48.000345
+168.000000 174.000000 -31.999750
+94.000000 239.000000 -15.999957
+128.000000 196.000000 -0.000407
+10.000000 151.000000 -0.000198
+28.000000 63.000000 16.000490
+50.000000 217.000000 -15.999698
+147.000000 242.000000 -16.000115
+11.000000 139.000000 -16.000482
+208.000000 183.000000 16.000006
+153.000000 28.000000 47.999911
+63.000000 29.000000 15.999721
+18.000000 173.000000 0.000064
+80.000000 86.000000 31.999967
+214.000000 131.000000 -31.999614
+25.000000 164.000000 -32.000292
+18.000000 81.000000 15.999688
+174.000000 164.000000 -15.999519
+112.000000 58.000000 48.000316
+221.000000 196.000000 0.000020
+87.000000 228.000000 0.000271
+85.000000 82.000000 31.999577
+136.000000 185.000000 -31.999946
+139.000000 12.000000 15.999814
+207.000000 136.000000 -31.999751
+243.000000 127.000000 -16.000406
+238.000000 83.000000 16.000043
+236.000000 175.000000 0.000133
+59.000000 39.000000 -0.000173
+138.000000 58.000000 48.000435
+63.000000 125.000000 -15.999958
+148.000000 59.000000 47.999763
+11.000000 116.000000 16.000295
+12.000000 104.000000 16.000059
+99.000000 195.000000 -47.999545
+176.000000 168.000000 -32.000485
+97.000000 186.000000 -0.000049
+26.000000 69.000000 0.000408
+67.000000 196.000000 -48.000408
+197.000000 73.000000 -15.999752
+180.000000 99.000000 15.999739
+246.000000 145.000000 0.000341
+54.000000 184.000000 15.999968
+194.000000 78.000000 -15.999879
+16.000000 144.000000 15.999772
+100.000000 28.000000 47.999568
+26.000000 108.000000 32.000427
+188.000000 58.000000 48.000056
+104.000000 23.000000 0.000019
+186.000000 193.000000 -47.999712
+242.000000 100.000000 16.000407
+139.000000 12.000000 31.999602
+229.000000 168.000000 -31.999564
+96.000000 230.000000 -0.000241
+144.000000 71.000000 31.999954
+139.000000 184.000000 -16.000332
+158.000000 226.000000 -48.000437
+54.000000 143.000000 -31.999968
+241.000000 163.000000 -0.000375
+110.000000 59.000000 47.999725
+88.000000 27.000000 0.000264
+159.000000 25.000000 0.000204
+228.000000 68.000000 0.000450
+53.000000 114.000000 31.999861
+76.000000 22.000000 16.000012
+238.000000 172.000000 -16.000306
+27.000000 174.000000 -32.000074
+71.000000 64.000000 48.000089
+58.000000 73.000000 -16.000054
+226.000000 75.000000 31.999956
+64.000000 224.000000 -32.000409
+219.000000 79.000000 -16.000015
+171.000000 219.000000 -48.000443
+17.000000 149.000000 15.999620
+85.000000 219.000000 -47.999948
+139.000000 243.000000 -31.999927
+64.000000 132.000000 -15.999923
+133.000000 60.000000 0.000370
+141.000000 13.000000 32.000016
+144.000000 193.000000 0.000487
+29.000000 77.000000 32.000389
+186.000000 227.000000 -31.999584
+51.000000 211.000000 -0.000140
+100.000000 67.000000 -0.000192
+153.000000 240.000000 -31.999932
+184.000000 64.000000 48.000329
+118.000000 233.000000 0.000081
+37.000000 196.000000 -32.000450
+196.000000 35.000000 32.000130
+43.000000 51.000000 32.000190
+97.000000 61.000000 47.999902
+18.000000 174.000000 -15.999889
+54.000000 112.000000 32.000389
+244.000000 102.000000 -0.000141
+26.000000 89.000000 31.999633
+183.000000 101.000000 -0.000397
+190.000000 155.000000 -32.000059
+141.000000 61.000000 -0.000261
+122.000000 69.000000 31.999905
+159.000000 239.000000 -31.999703
+180.000000 156.000000 -16.000295
+122.000000 186.000000 -32.000017
+159.000000 16.000000 31.999811
+111.000000 62.000000 0.000081
+30.000000 73.000000 32.000406
+40.000000 131.000000 -32.000022
+185.000000 50.000000 47.999556
+46.000000 121.000000 32.000010
+15.000000 91.000000 15.999817
+139.000000 243.000000 -15.999875
+194.000000 110.000000 -15.999682
+200.000000 221.000000 -16.000194
+146.000000 183.000000 -32.000064
+106.000000 191.000000 0.000436
+182.000000 156.000000 -0.000125
+201.000000 71.000000 -16.000001
+127.000000 59.000000 0.000459
+141.000000 242.000000 -32.000493
+171.000000 235.000000 -31.999615
+61.000000 176.000000 15.999908
+151.000000 14.000000 31.999740
+121.000000 185.000000 -16.000410
+9.000000 110.000000 -0.000308
+36.000000 124.000000 31.999681
+162.000000 16.000000 16.000300
+80.000000 234.000000 -16.000029
+15.000000 164.000000 -15.999884
+208.000000 72.000000 -16.000103
+67.000000 114.000000 15.999868
+120.000000 60.000000 0.000358
+153.000000 24.000000 -0.000315
+167.000000 77.000000 0.000084
+88.000000 178.000000 -0.000296
+178.000000 88.000000 31.999579
+75.000000 99.000000 16.000467
+151.000000 241.000000 -31.999550
+47.000000 183.000000 15.999840
+151.000000 180.000000 -15.999625
+112.000000 230.000000 -47.999580
+152.000000 60.000000 47.999920
+145.000000 183.000000 -15.999679
+62.000000 123.000000 -16.000320
+228.000000 142.000000 -32.000272
+106.000000 232.000000 0.000122
+89.000000 33.000000 48.000060
+118.000000 231.000000 -48.000438
+162.000000 239.000000 -15.999565
+196.000000 220.000000 -31.999656
+189.000000 117.000000 15.999870
+73.000000 46.000000 48.000414
+193.000000 37.000000 0.000188
+187.000000 221.000000 0.000304
+61.000000 140.000000 15.999972
+115.000000 184.000000 -15.999817
+153.000000 231.000000 -0.000374
+46.000000 134.000000 -31.999890
+68.000000 201.000000 -47.999923
+217.000000 55.000000 -0.000048
+200.000000 34.000000 16.000119
+152.000000 195.000000 -48.000153
+146.000000 72.000000 32.000142
+105.000000 242.000000 -15.999819
+158.000000 69.000000 0.000177
+145.000000 72.000000 15.999652
+103.000000 73.000000 32.000330
+246.000000 112.000000 -0.000307
+243.000000 128.000000 16.000331
+46.000000 48.000000 0.000354
+99.000000 15.000000 31.999993
+96.000000 70.000000 0.000313
+192.000000 129.000000 15.999724
+171.000000 36.000000 48.000142
+56.000000 41.000000 -0.000237
+87.000000 236.000000 -32.000264
+110.000000 242.000000 -32.000440
+90.000000 26.000000 0.000233
+219.000000 176.000000 16.000414
+196.000000 32.000000 15.999647
+225.000000 119.000000 31.999763
+168.000000 81.000000 31.999513
+103.000000 182.000000 -31.999641
+28.000000 192.000000 -16.000020
+225.000000 136.000000 -32.000475
+62.000000 117.000000 -15.999916
+58.000000 182.000000 16.000479
+94.000000 71.000000 0.000277
+210.000000 43.000000 16.000458
+238.000000 86.000000 -0.000143
+186.000000 28.000000 32.000422
+208.000000 46.000000 32.000427
+99.000000 60.000000 47.999544
+85.000000 36.000000 47.999560
+14.000000 140.000000 16.000064
+174.000000 91.000000 16.000080
+72.000000 33.000000 0.000351
+230.000000 95.000000 31.999702
+153.000000 15.000000 31.999736
+180.000000 44.000000 48.000142
+147.000000 13.000000 16.000173
+168.000000 27.000000 0.000135
+16.000000 168.000000 -16.000330
+12.000000 98.000000 0.000077
+84.000000 88.000000 15.999770
+175.000000 162.000000 -15.999729
+122.000000 12.000000 31.999587
+194.000000 145.000000 16.000214
+245.000000 104.000000 0.000096
+38.000000 50.000000 16.000261
+102.000000 231.000000 -0.000273
+120.000000 70.000000 32.000247
+103.000000 241.000000 -15.999562
+24.000000 73.000000 0.000059
+153.000000 241.000000 -16.000022
+80.000000 29.000000 -0.000425
+73.000000 223.000000 0.000246
+25.000000 91.000000 -15.999716
+110.000000 13.000000 31.999612
+142.000000 230.000000 -47.999894
+23.000000 185.000000 -16.000220
+226.000000 180.000000 -31.999881
+230.000000 105.000000 32.000364
+80.000000 169.000000 -31.999656
+219.000000 203.000000 -16.000266
+69.000000 142.000000 -0.000292
+33.000000 61.000000 0.000446
+66.000000 119.000000 15.999737
+29.000000 178.000000 -31.999839
+122.000000 195.000000 0.000250
+95.000000 79.000000 15.999537
+53.000000 141.000000 -32.000021
+228.000000 113.000000 31.999506
+110.000000 196.000000 -48.000009
+84.000000 167.000000 -16.000145
+221.000000 123.000000 32.000377
+192.000000 126.000000 -16.000016
+163.000000 237.000000 -32.000336
+107.000000 73.000000 15.999636
+30.000000 59.000000 15.999555
+143.000000 233.000000 -0.000014
+76.000000 233.000000 -16.000291
+140.000000 24.000000 48.000373
+13.000000 122.000000 -16.000396
+119.000000 243.000000 -15.999928
+219.000000 52.000000 15.999516
+39.000000 207.000000 -16.000205
+11.000000 153.000000 0.000400
+153.000000 227.000000 -47.999632
+197.000000 182.000000 15.999689
+96.000000 15.000000 16.000408
+189.000000 27.000000 16.000370
+85.000000 173.000000 -32.000317
+137.000000 185.000000 -15.999535
+186.000000 113.000000 0.000316
+47.000000 72.000000 -16.000307
+26.000000 147.000000 -31.999760
+34.000000 59.000000 0.000272
+184.000000 191.000000 -47.999729
+135.000000 195.000000 0.000041
+137.000000 22.000000 0.000252
+137.000000 70.000000 16.000342
+25.000000 164.000000 16.000081
+241.000000 162.000000 -16.000253
+25.000000 91.000000 31.999907
+204.000000 44.000000 -0.000409
+110.000000 184.000000 -32.000070
+71.000000 191.000000 -47.999714
+186.000000 141.000000 -0.000049
+112.000000 22.000000 -0.000413
+27.000000 187.000000 -0.000197
+28.000000 139.000000 -31.999749
+155.000000 76.000000 16.000041
+31.000000 135.000000 -31.999815
+99.000000 240.000000 -32.000440
+218.000000 59.000000 32.000098
+240.000000 164.000000 -16.000179
+186.000000 62.000000 48.000381
+193.000000 120.000000 -15.999543
+87.000000 19.000000 32.000031
+185.000000 148.000000 -0.000396
+187.000000 139.000000 -0.000262
+194.000000 177.000000 15.999986
+13.000000 133.000000 15.999525
+217.000000 131.000000 -32.000238
+73.000000 229.000000 -31.999844
+218.000000 196.000000 -31.999779
+62.000000 218.000000 -0.000483
+131.000000 12.000000 16.000284
+68.000000 136.000000 -0.000446
+14.000000 94.000000 16.000185
+112.000000 197.000000 -48.000241
+223.000000 198.000000 -15.999801
+71.000000 161.000000 -32.000219
+86.000000 18.000000 16.000351
+100.000000 227.000000 -47.999777
+17.000000 169.000000 -0.000308
+118.000000 24.000000 47.999953
+190.000000 100.000000 31.999686
+72.000000 103.000000 0.000019
+214.000000 124.000000 32.000046
+221.000000 132.000000 -32.000248
+81.000000 217.000000 -48.000242
+54.000000 71.000000 -16.000327
+14.000000 161.000000 -16.000004
+64.000000 31.000000 31.999705
+196.000000 223.000000 -16.000117
+114.000000 194.000000 0.000448
+239.000000 109.000000 -15.999611
+242.000000 155.000000 -15.999961
+62.000000 138.000000 15.999829
+155.000000 188.000000 -0.000170
+12.000000 131.000000 15.999532
+230.000000 150.000000 -31.999836
+12.000000 124.000000 -15.999937
+244.000000 137.000000 -15.999895
+38.000000 200.000000 0.000110
+175.000000 93.000000 16.000389
+40.000000 124.000000 32.000203
+129.000000 11.000000 15.999840
+39.000000 48.000000 16.000091
+23.000000 70.000000 15.999560
+89.000000 222.000000 -47.999557
+73.000000 26.000000 31.999999
+242.000000 94.000000 -0.000065
+229.000000 148.000000 -32.000276
+86.000000 237.000000 -15.999800
+229.000000 190.000000 -15.999638
+115.000000 71.000000 15.999835
+180.000000 95.000000 -0.000262
+247.000000 137.000000 0.000076
+130.000000 69.000000 31.999978
+38.000000 205.000000 -15.999885
+95.000000 238.000000 -31.999829
+155.000000 179.000000 -16.000164
+25.000000 153.000000 -32.000133
+17.000000 106.000000 -15.999715
+178.000000 167.000000 -31.999967
+209.000000 207.000000 -0.000472
+68.000000 34.000000 0.000071
+239.000000 146.000000 15.999682
+81.000000 38.000000 47.999976
+110.000000 23.000000 -0.000396
+27.000000 81.000000 31.999842
+136.000000 70.000000 32.000427
+145.000000 232.000000 0.000270
+140.000000 231.000000 -47.999598
+148.000000 196.000000 -48.000069
+16.000000 111.000000 -16.000408
+108.000000 14.000000 31.999518
+240.000000 91.000000 16.000149
+230.000000 160.000000 -32.000275
+64.000000 123.000000 15.999728
+16.000000 87.000000 15.999844
+8.000000 141.000000 0.000100
+222.000000 194.000000 -0.000178
+160.000000 61.000000 48.000409
+174.000000 20.000000 15.999672
+171.000000 174.000000 0.000162
+84.000000 81.000000 -0.000264
+151.000000 75.000000 15.999741
+36.000000 79.000000 -16.000373
+163.000000 18.000000 31.999651
+68.000000 116.000000 -0.000288
+185.000000 205.000000 -48.000148
+193.000000 135.000000 16.000057
+187.000000 119.000000 0.000122
+19.000000 80.000000 0.000444
+173.000000 64.000000 47.999899
+237.000000 82.000000 0.000371
+212.000000 211.000000 -15.999928
+229.000000 87.000000 31.999870
+69.000000 114.000000 0.000236
+97.000000 194.000000 -48.000360
+36.000000 176.000000 15.999577
+55.000000 213.000000 -0.000157
+189.000000 228.000000 -15.999840
+110.000000 192.000000 -0.000275
+174.000000 235.000000 -15.999655
+73.000000 99.000000 -0.000327
+28.000000 116.000000 31.999974
+229.000000 107.000000 31.999858
+153.000000 14.000000 15.999576
+103.000000 14.000000 16.000290
+130.000000 186.000000 -31.999906
+162.000000 62.000000 48.000005
+75.000000 160.000000 0.000127
+13.000000 161.000000 -0.000169
+183.000000 222.000000 -0.000352
+107.000000 182.000000 -15.999640
+105.000000 13.000000 15.999856
+50.000000 38.000000 16.000248
+175.000000 86.000000 0.000015
+30.000000 196.000000 -15.999867
+51.000000 42.000000 31.999990
+241.000000 93.000000 15.999799
+131.000000 243.000000 -16.000487
+243.000000 102.000000 15.999527
+30.000000 182.000000 -32.000239
+120.000000 185.000000 -31.999833
+66.000000 136.000000 -16.000264
+200.000000 42.000000 -0.000351
+25.000000 102.000000 32.000231
+176.000000 87.000000 32.000019
+160.000000 194.000000 -47.999614
+96.000000 240.000000 -16.000345
+230.000000 91.000000 -15.999643
+243.000000 157.000000 -0.000306
+243.000000 153.000000 -16.000310
+217.000000 124.000000 32.000136
+188.000000 197.000000 -47.999767
+121.000000 70.000000 15.999790
+242.000000 134.000000 16.000201
+165.000000 229.000000 -0.000410
+102.000000 24.000000 -0.000139
+230.000000 164.000000 16.000285
+182.000000 32.000000 0.000135
+247.000000 114.000000 -0.000002
+43.000000 204.000000 -32.000367
+210.000000 212.000000 -15.999682
+37.000000 59.000000 32.000195
+94.000000 16.000000 15.999830
+112.000000 25.000000 48.000203
+95.000000 17.000000 31.999534
+171.000000 192.000000 -48.000241
+125.000000 60.000000 0.000292
+12.000000 151.000000 -15.999890
+162.000000 193.000000 -48.000247
+161.000000 184.000000 0.000343
+70.000000 107.000000 -0.000360
+31.000000 120.000000 32.000491
+73.000000 209.000000 -47.999995
+106.000000 73.000000 31.999769
+145.000000 63.000000 -0.000340
+183.000000 152.000000 0.000134
+138.000000 197.000000 -47.999966
+106.000000 182.000000 -32.000377
+95.000000 176.000000 -15.999590
+61.000000 115.000000 -16.000234
+80.000000 169.000000 0.000431
+149.000000 23.000000 0.000338
+242.000000 121.000000 -16.000055
+63.000000 130.000000 16.000208
+229.000000 65.000000 15.999791
+152.000000 73.000000 31.999837
+9.000000 143.000000 -0.000190
+13.000000 100.000000 15.999721
+78.000000 89.000000 0.000382
+175.000000 226.000000 -0.000207
+79.000000 64.000000 47.999724
+165.000000 83.000000 15.999635
+173.000000 191.000000 -48.000118
+67.000000 141.000000 -15.999508
+149.000000 229.000000 -48.000104
+75.000000 156.000000 -15.999668
+13.000000 155.000000 -15.999930
+110.000000 71.000000 32.000201

From 3779d21163b3a80f3e1cce95c2f41fb6ff3c58aa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 25 Aug 2023 14:36:51 +0200
Subject: [PATCH 0668/1398] doc that the functions depend on Eigen

---
 .../interpolated_corrected_curvatures.h          | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 4b940f157e88..b90d66cbde2e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -1037,6 +1037,8 @@ class Interpolated_corrected_curvatures_computer
 * By providing mean, Gaussian and/or principal curvature and direction property maps as named parameters, the user
 * can choose which quantites to compute.
 *
+* \note This function depends on the \eigen 3.1 (or later) library.
+*
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
@@ -1127,6 +1129,8 @@ void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
 *
 * computes the interpolated corrected mean curvature across the mesh `pmesh`.
 *
+* \note This function depends on the \eigen 3.1 (or later) library.
+*
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
@@ -1198,6 +1202,8 @@ void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
 *
 * computes the interpolated corrected Gaussian curvature across the mesh `pmesh`.
 *
+* \note This function depends on the \eigen 3.1 (or later) library.
+*
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
@@ -1268,6 +1274,8 @@ void interpolated_corrected_Gaussian_curvature(const PolygonMesh& pmesh,
 *
 * computes the interpolated corrected principal curvatures and directions across the mesh `pmesh`.
 *
+* \note This function depends on the \eigen 3.1 (or later) library.
+*
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam VertexCurvatureMap a model of `WritablePropertyMap` with
 * `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and
@@ -1341,6 +1349,8 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 * By providing mean, Gaussian and/or principal curvature and direction property maps as named parameters, the user
 * can choose which quantites to compute.
 *
+* \note This function depends on the \eigen 3.1 (or later) library.
+*
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
@@ -1426,6 +1436,8 @@ void interpolated_corrected_curvatures_one_vertex(const PolygonMesh& pmesh,
 * \ingroup PMP_corrected_curvatures_grp
 * computes the interpolated corrected mean curvature at vertex `v` of mesh `pmesh`.
 *
+* \note This function depends on the \eigen 3.1 (or later) library.
+*
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
@@ -1503,6 +1515,8 @@ interpolated_corrected_mean_curvature_one_vertex(const PolygonMesh& pmesh,
 * \ingroup PMP_corrected_curvatures_grp
 * computes the interpolated corrected Gaussian curvature at vertex `v` of mesh `pmesh`.
 *
+* \note This function depends on the \eigen 3.1 (or later) library.
+*
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
@@ -1580,6 +1594,8 @@ interpolated_corrected_Gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
 * \ingroup PMP_corrected_curvatures_grp
 * computes the interpolated corrected principal curvatures and directions at vertex `v` of mesh `pmesh`.
 *
+* \note This function depends on the \eigen 3.1 (or later) library.
+*
 * @tparam PolygonMesh a model of `FaceListGraph`.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *

From 1db314ee4424a115df56520a15a526ab27cf30b9 Mon Sep 17 00:00:00 2001
From: David Coeurjolly <david.coeurjolly@cnrs.fr>
Date: Fri, 25 Aug 2023 14:39:38 +0200
Subject: [PATCH 0669/1398] Fixing image  filenames in the doxyfile

---
 .../doc/Polygon_mesh_processing/Doxyfile.in   | 35 ++++++++++++++++++-
 1 file changed, 34 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
index 8c263a409995..ca887f906691 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
@@ -23,7 +23,40 @@ EXCLUDE_SYMBOLS += experimental
 HTML_EXTRA_FILES           = ${CGAL_PACKAGE_DOC_DIR}/fig/selfintersections.jpg \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/mesh_smoothing.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/shape_smoothing.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/icc_diff_radius.png
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/icc_diff_radius.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/icc_diff_radius.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/ bimba-dmax0.020000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.020000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.030000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.030000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.040000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.040000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.050000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.050000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.020000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/ bimba-dmin0.020000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.030000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.030000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.040000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.040000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.050000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.050000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.020000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.020000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.030000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.030000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.040000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.040000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.050000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.050000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.030000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.030000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.040000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.040000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.050000-0.000000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.050000-0.002000.png\
                              ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_cheese.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_colors.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_rg_joint.png

From c16b155d4ee72ef3fd0f44086b84dee79b683269 Mon Sep 17 00:00:00 2001
From: David Coeurjolly <david.coeurjolly@cnrs.fr>
Date: Fri, 25 Aug 2023 14:39:59 +0200
Subject: [PATCH 0670/1398] Removing old image file.

---
 Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in | 2 --
 1 file changed, 2 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
index ca887f906691..8afaceb878f4 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
@@ -23,8 +23,6 @@ EXCLUDE_SYMBOLS += experimental
 HTML_EXTRA_FILES           = ${CGAL_PACKAGE_DOC_DIR}/fig/selfintersections.jpg \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/mesh_smoothing.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/shape_smoothing.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/icc_diff_radius.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/icc_diff_radius.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/ bimba-dmax0.020000-0.000000.png\
                              ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.020000-0.002000.png\
                              ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.030000-0.000000.png\

From 4b450a594840de692804db70433aa900ed670dca Mon Sep 17 00:00:00 2001
From: David Coeurjolly <david.coeurjolly@cnrs.fr>
Date: Fri, 25 Aug 2023 15:12:56 +0200
Subject: [PATCH 0671/1398] Cleaning up not used images

---
 .../doc/Polygon_mesh_processing/Doxyfile.in   | 21 -------------------
 1 file changed, 21 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
index 8afaceb878f4..5cdf93414ac8 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
@@ -23,30 +23,9 @@ EXCLUDE_SYMBOLS += experimental
 HTML_EXTRA_FILES           = ${CGAL_PACKAGE_DOC_DIR}/fig/selfintersections.jpg \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/mesh_smoothing.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/shape_smoothing.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/ bimba-dmax0.020000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.020000-0.002000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.030000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.030000-0.002000.png\
                              ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.040000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.040000-0.002000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.050000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.050000-0.002000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.020000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/ bimba-dmin0.020000-0.002000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.030000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.030000-0.002000.png\
                              ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.040000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.040000-0.002000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.050000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.050000-0.002000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.020000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.020000-0.002000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.030000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.030000-0.002000.png\
                              ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.040000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.040000-0.002000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.050000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.050000-0.002000.png\
                              ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.000000.png\
                              ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.002000.png\
                              ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.030000-0.000000.png\

From 28efeb20569b20b5baa1ac8b15d1476caa8681b7 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 27 Aug 2023 19:13:42 +0300
Subject: [PATCH 0672/1398] integrated curvature vis to display property

still need to add the radius setting part
---
 .../Display/Display_property_plugin.cpp       | 77 ++++++++++++++++++-
 1 file changed, 73 insertions(+), 4 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 994dcd2e8d9b..ed0de184db33 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -22,11 +22,13 @@
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
 #include <CGAL/Polygon_mesh_processing/measure.h>
 #include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
+#include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 
 #include <QAbstractItemView>
 #include <QAction>
 #include <QApplication>
 #include <QColor>
+#include <QSlider>
 #include <QColorDialog>
 #include <QInputDialog>
 #include <QMainWindow>
@@ -47,6 +49,8 @@
 
 using namespace CGAL::Three;
 
+
+
 Viewer_interface* (&getActiveViewer)() = Three::activeViewer;
 
 class DockWidget
@@ -99,6 +103,11 @@ class Display_property_plugin
     MAX_VALUE
   };
 
+  enum CurvatureType {
+    MEAN_CURVATURE,
+    GAUSSIAN_CURVATURE
+  };
+
 public:
   bool applicable(QAction*) const Q_DECL_OVERRIDE
   {
@@ -238,6 +247,14 @@ private Q_SLOTS:
       dock_widget->maxBox->setRange(0, 360);
       dock_widget->maxBox->setValue(0);
     }
+    else if (property_name == "Interpolated Corrected Gaussian Curvature" || 
+             property_name == "Interpolated Corrected Mean Curvature")
+    {
+      dock_widget->minBox->setRange(-1000, 1000);
+      dock_widget->minBox->setValue(0);
+      dock_widget->maxBox->setRange(-1000, 1000);
+      dock_widget->maxBox->setValue(0);
+    }
     else if(property_name == "Scaled Jacobian")
     {
       dock_widget->minBox->setRange(-1000, 1000);
@@ -432,11 +449,15 @@ private Q_SLOTS:
       dock_widget->propertyBox->addItems({"Smallest Angle Per Face",
                                           "Largest Angle Per Face",
                                           "Scaled Jacobian",
-                                          "Face Area"});
+                                          "Face Area",
+                                          "Interpolated Corrected Mean Curvature",
+                                          "Interpolated Corrected Gaussian Curvature"});
       property_simplex_types = { Property_simplex_type::FACE,
                                  Property_simplex_type::FACE,
                                  Property_simplex_type::FACE,
-                                 Property_simplex_type::FACE };
+                                 Property_simplex_type::FACE,
+                                 Property_simplex_type::VERTEX,
+                                 Property_simplex_type::VERTEX };
       detectSMScalarProperties(*(sm_item->face_graph()));
     }
     else if(ps_item)
@@ -506,10 +527,15 @@ private Q_SLOTS:
   {
     CGAL_assertion(static_cast<std::size_t>(dock_widget->propertyBox->count()) == property_simplex_types.size());
 
+    const int property_index = dock_widget->propertyBox->currentIndex();
+
     // leave it flat if it was, otherwise set to flat+edges
-    if(sm_item->renderingMode() != Flat && sm_item->renderingMode() != FlatPlusEdges)
+    if(sm_item->renderingMode() != Flat && sm_item->renderingMode() != FlatPlusEdges && property_simplex_types.at(property_index) == Property_simplex_type::FACE)
       sm_item->setRenderingMode(FlatPlusEdges);
 
+    if(sm_item->renderingMode() != Gouraud && sm_item->renderingMode() != GouraudPlusEdges && property_simplex_types.at(property_index) == Property_simplex_type::VERTEX)
+      sm_item->setRenderingMode(GouraudPlusEdges);
+
     const std::string& property_name = dock_widget->propertyBox->currentText().toStdString();
     if(property_name == "Smallest Angle Per Face")
     {
@@ -527,6 +553,14 @@ private Q_SLOTS:
     {
       displayArea(sm_item);
     }
+    else if(property_name == "Interpolated Corrected Mean Curvature")
+    {
+      displayCurvature(sm_item, MEAN_CURVATURE);
+    }
+    else if(property_name == "Interpolated Corrected Gaussian Curvature")
+    {
+      displayCurvature(sm_item, GAUSSIAN_CURVATURE);
+    }
     else
     {
       const int property_index = dock_widget->propertyBox->currentIndex();
@@ -629,6 +663,8 @@ private Q_SLOTS:
     removeDisplayPluginProperty(item, "f:display_plugin_largest_angle");
     removeDisplayPluginProperty(item, "f:display_plugin_scaled_jacobian");
     removeDisplayPluginProperty(item, "f:display_plugin_area");
+    removeDisplayPluginProperty(item, "f:display_plugin_mean_curvature");
+    removeDisplayPluginProperty(item, "f:display_plugin_gaussian_curvature");
   }
 
   void displayExtremumAnglePerFace(Scene_surface_mesh_item* sm_item,
@@ -809,6 +845,32 @@ private Q_SLOTS:
     displaySMProperty<face_descriptor>("f:display_plugin_area", *sm);
   }
 
+  void displayCurvature(Scene_surface_mesh_item* sm_item,
+                        const CurvatureType curvature_type)
+  {
+    SMesh* sm = sm_item->face_graph();
+    if(sm == nullptr)
+      return;
+
+    bool not_initialized;
+    std::string tied_string = (curvature_type == MEAN_CURVATURE) ?
+      "v:display_plugin_mean_curvature" : "v:display_plugin_gaussian_curvature";
+
+    SMesh::Property_map<vertex_descriptor, double> vcurvature;
+    std::tie(vcurvature, not_initialized) = sm->add_property_map<vertex_descriptor, double>(tied_string, 0);
+
+    if (curvature_type == MEAN_CURVATURE)
+    {
+      CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature(*sm, vcurvature);
+    }
+    else if (curvature_type == GAUSSIAN_CURVATURE)
+    {
+      CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature(*sm, vcurvature);
+    }
+
+    displaySMProperty<vertex_descriptor>(tied_string, *sm);
+  }
+
 private:
   template<typename Functor>
   bool call_on_PS_property(const std::string& name,
@@ -964,6 +1026,10 @@ private Q_SLOTS:
         zoomToSimplexWithPropertyExtremum(faces(mesh), mesh, "f:display_plugin_scaled_jacobian", extremum);
       else if(property_name == "Face Area")
         zoomToSimplexWithPropertyExtremum(faces(mesh), mesh, "f:display_plugin_area", extremum);
+      else if(property_name == "Interpolated Corrected Mean Curvature")
+        zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, "v:display_plugin_mean_curvature", extremum);
+      else if(property_name == "Interpolated Corrected Gaussian Curvature")
+        zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, "v:display_plugin_gaussian_curvature", extremum);
       else if(property_simplex_types.at(property_index) == Property_simplex_type::VERTEX)
         zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, property_name, extremum);
       else if(property_simplex_types.at(property_index) == Property_simplex_type::FACE)
@@ -1298,7 +1364,10 @@ isSMPropertyScalar(const std::string& name,
   if(name == "f:display_plugin_smallest_angle" ||
      name == "f:display_plugin_largest_angle" ||
      name == "f:display_plugin_scaled_jacobian" ||
-     name == "f:display_plugin_area")
+     name == "f:display_plugin_area" ||
+     name == "f:display_plugin_mean_curvature" ||
+     name == "f:display_plugin_gaussian_curvature")
+
     return false;
 
   // the dispatch function does the filtering we want: if it founds a property

From 46ac0f90604291123bacd57e40b9bfa8c9b2b044 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sun, 27 Aug 2023 19:27:23 +0300
Subject: [PATCH 0673/1398] trim whitespaces

---
 .../demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index ed0de184db33..e5baf54cfd7e 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -247,7 +247,7 @@ private Q_SLOTS:
       dock_widget->maxBox->setRange(0, 360);
       dock_widget->maxBox->setValue(0);
     }
-    else if (property_name == "Interpolated Corrected Gaussian Curvature" || 
+    else if (property_name == "Interpolated Corrected Gaussian Curvature" ||
              property_name == "Interpolated Corrected Mean Curvature")
     {
       dock_widget->minBox->setRange(-1000, 1000);

From 49d6821d9bf3ad827ad664e739c90e0cd8c24909 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 28 Aug 2023 13:51:57 +0200
Subject: [PATCH 0674/1398] accomodate update to c++17 STL

---
 Kernel_23/include/CGAL/Kernel/function_objects.h | 16 ++++++++--------
 .../Polygon_mesh_processing/autorefinement.h     |  4 ++--
 2 files changed, 10 insertions(+), 10 deletions(-)

diff --git a/Kernel_23/include/CGAL/Kernel/function_objects.h b/Kernel_23/include/CGAL/Kernel/function_objects.h
index 8974b762dcb4..8309a3c97ce7 100644
--- a/Kernel_23/include/CGAL/Kernel/function_objects.h
+++ b/Kernel_23/include/CGAL/Kernel/function_objects.h
@@ -2211,8 +2211,8 @@ namespace CommonKernelFunctors {
       Plane plane3 = construct_plane(p3, q3, r3);
 
       const auto res = typename K::Intersect_3()(plane1, plane2, plane3);
-      CGAL_assertion(res!=boost::none);
-      const Point* e_pt = boost::get<Point>(&(*res));
+      CGAL_assertion(res!=std::nullopt);
+      const Point* e_pt = std::get_if<Point>(&(*res));
       CGAL_assertion(e_pt!=nullptr);
       return *e_pt;
     }
@@ -2221,8 +2221,8 @@ namespace CommonKernelFunctors {
     operator()(const Plane& plane1, const Plane& plane2, const Plane& plane3) const
     {
       const auto res = typename K::Intersect_3()(plane1, plane2, plane3);
-      CGAL_assertion(res!=boost::none);
-      const Point* e_pt = boost::get<Point>(&(*res));
+      CGAL_assertion(res!=std::nullopt);
+      const Point* e_pt = std::get_if<Point>(&(*res));
       CGAL_assertion(e_pt!=nullptr);
       return *e_pt;
     }
@@ -2245,8 +2245,8 @@ namespace CommonKernelFunctors {
       Segment s2 = construct_segment(p2, q2);
 
       const auto res = typename K::Intersect_3()(s1, s2);
-      CGAL_assertion(res!=boost::none);
-      const Point* e_pt = boost::get<Point>(&(*res));
+      CGAL_assertion(res!=std::nullopt);
+      const Point* e_pt = std::get_if<Point>(&(*res));
       CGAL_assertion(e_pt!=nullptr);
       return *e_pt;
     }
@@ -2255,8 +2255,8 @@ namespace CommonKernelFunctors {
     operator()(const Segment& s1, const Segment& s2) const
     {
       const auto res = typename K::Intersect_3()(s1, s2);
-      CGAL_assertion(res!=boost::none);
-      const Point* e_pt = boost::get<Point>(&(*res));
+      CGAL_assertion(res!=std::nullopt);
+      const Point* e_pt = std::get_if<Point>(&(*res));
       CGAL_assertion(e_pt!=nullptr);
       return *e_pt;
     }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 0fb843c31c00..b3133304bb96 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -292,8 +292,8 @@ void old_intersection_coplanar_triangles_cutoff(const typename Kernel::Point_3&
 
   CGAL_kernel_assertion_code(int pt_added = 0;)
 
-  const typename Kernel::Point_3* prev = &(*boost::prior(inter_pts.end()));
-  Iterator stop = inter_pts.size() > 2 ? inter_pts.end() : boost::prior(inter_pts.end());
+  const typename Kernel::Point_3* prev = &(*std::prev(inter_pts.end()));
+  Iterator stop = inter_pts.size() > 2 ? inter_pts.end() : std::prev(inter_pts.end());
   for(Iterator it=inter_pts.begin(); it!=stop; ++it)
   {
     const typename Kernel::Point_3& curr = *it;

From f499b635341b85b977328d6c0f7e4c8f4c1b6265 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <Laurent.Rineau@cgal.org>
Date: Mon, 28 Aug 2023 14:07:24 +0200
Subject: [PATCH 0675/1398] Update features_detection.h

---
 .../include/CGAL/Mesh_3/features_detection/features_detection.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Mesh_3/features_detection/features_detection.h b/Mesh_3/include/CGAL/Mesh_3/features_detection/features_detection.h
index 461cda686995..943674f45ddd 100644
--- a/Mesh_3/include/CGAL/Mesh_3/features_detection/features_detection.h
+++ b/Mesh_3/include/CGAL/Mesh_3/features_detection/features_detection.h
@@ -3802,7 +3802,7 @@ inline constexpr Cube convert_to_cube(unsigned int n) {
 // User-defined literal operator.  Given an integer in octal notation, like
 // 01234567, gives the cube with the same colors. For example, `01234567_c`
 // is `Cube{0, 1, 2, 3, 4, 5, 6, 7}`.
-inline constexpr Cube operator"" _c(unsigned long long n)
+inline constexpr Cube operator""_c(unsigned long long n)
 {
   #if !defined(_MSC_VER) ||  (_MSC_VER > 1900)
   assert(n < (1 << 24));

From ea46c6f28252ea4010b610cc883cebbe5ea1f6a1 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 28 Aug 2023 16:24:03 +0300
Subject: [PATCH 0676/1398] Pacify msvc17: explicitly name the (non-const)
 iterator type

---
 .../include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h      | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
index 5aa184d4d0c8..2889f219237f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_zone_2_impl.h
@@ -946,7 +946,9 @@ _leftmost_intersection_with_face_boundary(Face_handle face, bool on_boundary) {
 
   // Traverse the isolated vertices inside the face (if there exist any), and
   // check whether an isolated vertex lies on the curve.
-  for (auto iv_it = face->isolated_vertices_begin();
+  // MSVC17 requires an explicit (non-const) type for the iterator.
+  typename Arrangement_2::Isolated_vertex_iterator iv_it;
+  for (iv_it = face->isolated_vertices_begin();
        iv_it != face->isolated_vertices_end(); ++iv_it) {
     // If the isolated vertex is not in the x-range of our curve, disregard it.
     if (! is_in_x_range(m_cv, iv_it->point())) continue;

From 4fbcb937044844d9afb5f486f45bdd664704c366 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Mon, 28 Aug 2023 16:54:30 +0200
Subject: [PATCH 0677/1398] a few cleanups

---
 .../demo/Circular_kernel_3/CMakeLists.txt     |  8 ++---
 .../demo/Alpha_shapes_2/CMakeLists.txt        | 12 +------
 .../demo/Apollonius_graph_2/CMakeLists.txt    | 19 ++++-------
 .../demo/Bounding_volumes/Bounding_volumes.ui |  2 +-
 .../demo/Bounding_volumes/CMakeLists.txt      | 34 ++++---------------
 5 files changed, 17 insertions(+), 58 deletions(-)

diff --git a/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt b/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt
index 3f46c3dcd935..2ed07a6904ec 100644
--- a/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt
+++ b/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt
@@ -12,18 +12,16 @@ endif()
 
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGL OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets OpenGL)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
-  add_executable(
-    Circular_kernel_3 Circular_kernel_3.cpp Viewer.cpp
-                      ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  add_executable(Circular_kernel_3 Circular_kernel_3.cpp Viewer.cpp)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Circular_kernel_3)
 
   target_link_libraries(Circular_kernel_3 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
-                                                  Qt6::Widgets Qt6::OpenGL Qt6::OpenGLWidgets)
+                                                  Qt6::Widgets Qt6::OpenGL)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Circular_kernel_3)
diff --git a/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt b/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt
index 4049f54c00d5..f8e410b6a4ea 100644
--- a/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt
+++ b/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt
@@ -4,19 +4,9 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Alpha_shapes_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
-include_directories(BEFORE ./include)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
diff --git a/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt b/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt
index 9cf502573e57..a7bf703fb43b 100644
--- a/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt
+++ b/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt
@@ -15,25 +15,18 @@ endif()
 
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
-  #--------------------------------
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(DT_UI_FILES Apollonius_graph_2.ui)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Apollonius_graph_2.qrc)
-
-  # use the Qt MOC preprocessor on classes that derives from QObject
-
-  # The executable itself.
-  add_executable(
-    Apollonius_graph_2 Apollonius_graph_2.cpp ${DT_UI_FILES}
-                       ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(
+    Apollonius_graph_2 Apollonius_graph_2.cpp Apollonius_graph_2.ui
+                       Apollonius_graph_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Apollonius_graph_2)
 
diff --git a/GraphicsView/demo/Bounding_volumes/Bounding_volumes.ui b/GraphicsView/demo/Bounding_volumes/Bounding_volumes.ui
index 6228db3d7178..73b0415f93c6 100644
--- a/GraphicsView/demo/Bounding_volumes/Bounding_volumes.ui
+++ b/GraphicsView/demo/Bounding_volumes/Bounding_volumes.ui
@@ -197,7 +197,7 @@
    </property>
    <property name="icon">
     <iconset>
-     <normaloff>icons/min_circle.png</normaloff>icons/min_circle.png</iconset>
+     <normaloff>:/cgal/Actions/icons/min_circle.png</normaloff>:/cgal/Actions/icons/min_circle.png</iconset>
    </property>
    <property name="text">
     <string>Minimum Enclosing &amp;Circle</string>
diff --git a/GraphicsView/demo/Bounding_volumes/CMakeLists.txt b/GraphicsView/demo/Bounding_volumes/CMakeLists.txt
index 56ed6427701e..bdf70858d185 100644
--- a/GraphicsView/demo/Bounding_volumes/CMakeLists.txt
+++ b/GraphicsView/demo/Bounding_volumes/CMakeLists.txt
@@ -4,46 +4,24 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Bounding_volumes_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
-include_directories(BEFORE ./include)
-
+find_package(Qt6 QUIET COMPONENTS Widgets)
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(DT_UI_FILES Bounding_volumes.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Bounding_volumes.qrc)
-
-  # use the Qt MOC preprocessor on classes that derives from QObject
-
-  # The executable itself.
-  add_executable(
-    Bounding_volumes Bounding_volumes.cpp ${DT_UI_FILES}
-                     ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(
+    Bounding_volumes Bounding_volumes.cpp Bounding_volumes.ui Bounding_volumes.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Bounding_volumes)
 
   target_link_libraries(Bounding_volumes PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
-                                                 Qt6::Gui)
-
-  include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
-  cgal_add_compilation_test(Bounding_volumes)
+                                                 Qt6::Widgets)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Bounding_volumes)

From 3a52549c410a87a8c01be35367d612809e1d9da9 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Tue, 29 Aug 2023 16:35:15 +0200
Subject: [PATCH 0678/1398] more cleanup of CMake scripts for Qt6

---
 .../demo/Circular_kernel_3/CMakeLists.txt     | 11 +----
 .../demo/Alpha_shapes_2/CMakeLists.txt        | 13 ++----
 .../demo/Apollonius_graph_2/CMakeLists.txt    |  9 -----
 .../demo/Circular_kernel_2/CMakeLists.txt     | 29 +++-----------
 GraphicsView/demo/Generator/CMakeLists.txt    | 24 ++---------
 GraphicsView/demo/GraphicsView/CMakeLists.txt | 13 +-----
 .../demo/L1_Voronoi_diagram_2/CMakeLists.txt  | 25 +++---------
 .../demo/Largest_empty_rect_2/CMakeLists.txt  | 25 +++---------
 .../Periodic_2_triangulation_2/CMakeLists.txt | 13 +-----
 GraphicsView/demo/Polygon/CMakeLists.txt      | 25 ++----------
 .../Segment_Delaunay_graph_2/CMakeLists.txt   | 26 +++---------
 .../CMakeLists.txt                            | 32 +++------------
 .../demo/Snap_rounding_2/CMakeLists.txt       | 27 +++----------
 .../demo/Snap_rounding_2/Snap_rounding_2.qrc  |  9 +++--
 .../demo/Spatial_searching_2/CMakeLists.txt   | 26 +++---------
 .../demo/Stream_lines_2/CMakeLists.txt        | 26 +++---------
 .../demo/Triangulation_2/CMakeLists.txt       | 40 ++++++-------------
 17 files changed, 83 insertions(+), 290 deletions(-)

diff --git a/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt b/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt
index 2ed07a6904ec..42cc885bbffa 100644
--- a/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt
+++ b/Circular_kernel_3/demo/Circular_kernel_3/CMakeLists.txt
@@ -1,22 +1,13 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Circular_kernel_3_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 find_package(Qt6 QUIET COMPONENTS Widgets OpenGL)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
-  add_executable(Circular_kernel_3 Circular_kernel_3.cpp Viewer.cpp)
+  qt_add_executable(Circular_kernel_3 Circular_kernel_3.cpp Viewer.cpp)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Circular_kernel_3)
 
diff --git a/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt b/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt
index f8e410b6a4ea..39e6c10e48ba 100644
--- a/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt
+++ b/GraphicsView/demo/Alpha_shapes_2/CMakeLists.txt
@@ -12,17 +12,12 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
-
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(DT_UI_FILES Alpha_shapes_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Alpha_shapes_2.qrc)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
   # The executable itself.
-  add_executable(
-    Alpha_shapes_2 Alpha_shapes_2.cpp ${DT_UI_FILES} ${CGAL_Qt6_RESOURCE_FILES}
-                   ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(
+    Alpha_shapes_2 Alpha_shapes_2.cpp Alpha_shapes_2.ui Alpha_shapes_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Alpha_shapes_2)
 
diff --git a/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt b/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt
index a7bf703fb43b..219466b79416 100644
--- a/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt
+++ b/GraphicsView/demo/Apollonius_graph_2/CMakeLists.txt
@@ -4,15 +4,6 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Apollonius_graph_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 find_package(Qt6 QUIET COMPONENTS Widgets)
diff --git a/GraphicsView/demo/Circular_kernel_2/CMakeLists.txt b/GraphicsView/demo/Circular_kernel_2/CMakeLists.txt
index 054e5feeedb4..940c5bcc27d3 100644
--- a/GraphicsView/demo/Circular_kernel_2/CMakeLists.txt
+++ b/GraphicsView/demo/Circular_kernel_2/CMakeLists.txt
@@ -4,37 +4,20 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Circular_kernel_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(DT_UI_FILES Circular_kernel_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Circular_kernel_2.qrc)
-
-  # use the Qt MOC preprocessor on classes that derives from QObject
-
-  # The executable itself.
-  add_executable(
-    Circular_kernel_2 Circular_kernel_2.cpp ${DT_UI_FILES}
-                      ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
-
+  qt_add_executable(
+    Circular_kernel_2 Circular_kernel_2.cpp
+                      Circular_kernel_2.ui Circular_kernel_2.qrc)
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Circular_kernel_2)
 
   target_link_libraries(Circular_kernel_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
diff --git a/GraphicsView/demo/Generator/CMakeLists.txt b/GraphicsView/demo/Generator/CMakeLists.txt
index 2b6dbe1c77be..cea168a2c9d9 100644
--- a/GraphicsView/demo/Generator/CMakeLists.txt
+++ b/GraphicsView/demo/Generator/CMakeLists.txt
@@ -3,15 +3,6 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Generator_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
@@ -21,18 +12,11 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(DT_UI_FILES Generator_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Generator_2.qrc)
-
-  # use the Qt MOC preprocessor on classes that derives from QObject
-
-  # The executable itself.
-  add_executable(Generator_2 Generator_2.cpp ${DT_UI_FILES}
-                             ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(Generator_2 Generator_2.cpp
+                                Generator_2.ui Generator_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Generator_2)
 
diff --git a/GraphicsView/demo/GraphicsView/CMakeLists.txt b/GraphicsView/demo/GraphicsView/CMakeLists.txt
index 771f3225dd64..aa84ba549cb6 100644
--- a/GraphicsView/demo/GraphicsView/CMakeLists.txt
+++ b/GraphicsView/demo/GraphicsView/CMakeLists.txt
@@ -3,25 +3,16 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(GraphicsView_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
-  add_executable(min min.cpp ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(min min.cpp)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS min)
 
diff --git a/GraphicsView/demo/L1_Voronoi_diagram_2/CMakeLists.txt b/GraphicsView/demo/L1_Voronoi_diagram_2/CMakeLists.txt
index e8c2499c325e..058ac7ad55b3 100644
--- a/GraphicsView/demo/L1_Voronoi_diagram_2/CMakeLists.txt
+++ b/GraphicsView/demo/L1_Voronoi_diagram_2/CMakeLists.txt
@@ -4,18 +4,9 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(L1_Voronoi_diagram_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 include_directories(BEFORE ./include)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
@@ -23,17 +14,13 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(DT_UI_FILES L1_voronoi_diagram_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./L1_voronoi_diagram_2.qrc)
 
-  # The executable itself.
-  add_executable(
-    L1_voronoi_diagram_2 L1_voronoi_diagram_2.cpp ${DT_UI_FILES}
-                         ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(
+    L1_voronoi_diagram_2 L1_voronoi_diagram_2.cpp
+                         L1_voronoi_diagram_2.ui L1_voronoi_diagram_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS L1_voronoi_diagram_2)
 
diff --git a/GraphicsView/demo/Largest_empty_rect_2/CMakeLists.txt b/GraphicsView/demo/Largest_empty_rect_2/CMakeLists.txt
index 8fedcbb9f469..275095d4b70d 100644
--- a/GraphicsView/demo/Largest_empty_rect_2/CMakeLists.txt
+++ b/GraphicsView/demo/Largest_empty_rect_2/CMakeLists.txt
@@ -4,35 +4,22 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Largest_empty_rect_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(DT_UI_FILES Largest_empty_rectangle_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Largest_empty_rectangle_2.qrc)
 
-  # The executable itself.
-  add_executable(
-    Largest_empty_rectangle_2 Largest_empty_rectangle_2.cpp ${DT_UI_FILES}
-                              ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(
+    Largest_empty_rectangle_2 Largest_empty_rectangle_2.cpp
+                              Largest_empty_rectangle_2.ui Largest_empty_rectangle_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Largest_empty_rectangle_2)
 
diff --git a/GraphicsView/demo/Periodic_2_triangulation_2/CMakeLists.txt b/GraphicsView/demo/Periodic_2_triangulation_2/CMakeLists.txt
index f8acebb2ee4c..f6b0698e4cba 100644
--- a/GraphicsView/demo/Periodic_2_triangulation_2/CMakeLists.txt
+++ b/GraphicsView/demo/Periodic_2_triangulation_2/CMakeLists.txt
@@ -1,18 +1,9 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Periodic_2_triangulation_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 include_directories(BEFORE ./include)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
@@ -35,7 +26,7 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   source_group("QT" FILES ${QT_headers})
 
   # The executable itself.
-  add_executable(
+  qt_add_executable(
     Periodic_2_Delaunay_triangulation_2
     Periodic_2_Delaunay_triangulation_2.cpp
     ${DT_UI_FILES}
diff --git a/GraphicsView/demo/Polygon/CMakeLists.txt b/GraphicsView/demo/Polygon/CMakeLists.txt
index db1fe276a5ea..341021360a39 100644
--- a/GraphicsView/demo/Polygon/CMakeLists.txt
+++ b/GraphicsView/demo/Polygon/CMakeLists.txt
@@ -4,15 +4,6 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Polygon_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6 Core)
 
 find_package(Eigen3 3.1.0 QUIET) #(requires 3.1.0 or greater)
@@ -28,23 +19,15 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   include(${CGAL_USE_FILE})
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
   if(CGAL_Core_FOUND)
     add_definitions(-DCGAL_USE_CORE)
   endif()
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(DT_UI_FILES Polygon_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Polygon_2.qrc)
-
-  #  add_library( CGAL SHARED IMPORTED )
-  #  SET_PROPERTY(TARGET CGAL PROPERTY IMPORTED_LOCATION ${CGAL_LIBRARY} )
-
-  # The executable itself.
-  add_executable(Polygon_2 Polygon_2.cpp ${DT_UI_FILES} ${DT_RESOURCE_FILES}
-                           ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(Polygon_2 Polygon_2.cpp
+                    Polygon_2.ui Polygon_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Polygon_2)
 
diff --git a/GraphicsView/demo/Segment_Delaunay_graph_2/CMakeLists.txt b/GraphicsView/demo/Segment_Delaunay_graph_2/CMakeLists.txt
index 7a947227eece..463f5a424c11 100644
--- a/GraphicsView/demo/Segment_Delaunay_graph_2/CMakeLists.txt
+++ b/GraphicsView/demo/Segment_Delaunay_graph_2/CMakeLists.txt
@@ -4,37 +4,23 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Segment_Delaunay_graph_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6 Core)
 
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 include_directories(BEFORE ./include)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  include(${CGAL_USE_FILE})
   add_definitions(-DQT_NO_KEYWORDS)
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(CDT_UI_FILES Segment_voronoi_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Segment_voronoi_2.qrc)
 
-  # The executable itself.
-  add_executable(
-    Segment_voronoi_2 Segment_voronoi_2.cpp ${CDT_UI_FILES}
-                      ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(
+    Segment_voronoi_2 Segment_voronoi_2.cpp
+    Segment_voronoi_2.ui Segment_voronoi_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Segment_voronoi_2)
 
diff --git a/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt b/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt
index e3cb33be16c0..980aa3401a2a 100644
--- a/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt
+++ b/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt
@@ -4,40 +4,20 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Segment_Delaunay_graph_Linf_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6 Core)
 
-set(QT_USE_QTXML TRUE)
-set(QT_USE_QTMAIN TRUE)
-set(QT_USE_QTSCRIPT TRUE)
-set(QT_USE_QTOPENGL TRUE)
-
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 include_directories(BEFORE ./include)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   set(CMAKE_AUTOMOC ON)
-  include(${CGAL_USE_FILE})
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
   add_definitions(-DQT_NO_KEYWORDS)
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(CDT_UI_FILES Segment_voronoi_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Segment_voronoi_2.qrc)
-
-  # The executable itself.
-  add_executable(
-    Segment_voronoi_linf_2 Segment_voronoi_linf_2.cpp ${CDT_UI_FILES}
-                           ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(
+    Segment_voronoi_linf_2 Segment_voronoi_linf_2.cpp 
+    Segment_voronoi_2.ui Segment_voronoi_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Segment_voronoi_linf_2)
 
diff --git a/GraphicsView/demo/Snap_rounding_2/CMakeLists.txt b/GraphicsView/demo/Snap_rounding_2/CMakeLists.txt
index 896dfc63b086..ab1015f2fc36 100644
--- a/GraphicsView/demo/Snap_rounding_2/CMakeLists.txt
+++ b/GraphicsView/demo/Snap_rounding_2/CMakeLists.txt
@@ -4,34 +4,19 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Snap_rounding_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Widgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
   add_definitions(-DQT_NO_KEYWORDS)
-  set(CMAKE_INCLUDE_CURRENT_DIR ON)
-
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(DT_UI_FILES Snap_rounding_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Snap_rounding_2.qrc)
 
-  # The executable itself.
-  add_executable(
-    Snap_rounding_2 Snap_rounding_2.cpp ${DT_UI_FILES}
-                    ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(
+    Snap_rounding_2 Snap_rounding_2.cpp
+    Snap_rounding_2.ui Snap_rounding_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Snap_rounding_2)
 
diff --git a/GraphicsView/demo/Snap_rounding_2/Snap_rounding_2.qrc b/GraphicsView/demo/Snap_rounding_2/Snap_rounding_2.qrc
index 7604c41cc813..b4307047176a 100644
--- a/GraphicsView/demo/Snap_rounding_2/Snap_rounding_2.qrc
+++ b/GraphicsView/demo/Snap_rounding_2/Snap_rounding_2.qrc
@@ -1,8 +1,11 @@
 <RCC>
-  <qresource prefix="/cgal/Actions" >
+  <qresource prefix="/cgal/Actions">
+    <file>icons/grid.png</file>
+    <file>icons/snapped.png</file>
+    <file>icons/unsnapped.png</file>
   </qresource>
-  <qresource prefix="/cgal/help" >
-    <file alias="about_CGAL.html" >../resources/about_CGAL.html</file>
+  <qresource prefix="/cgal/help">
+    <file alias="about_CGAL.html">../resources/about_CGAL.html</file>
     <file>about_Snap_rounding_2.html</file>
   </qresource>
 </RCC>
diff --git a/GraphicsView/demo/Spatial_searching_2/CMakeLists.txt b/GraphicsView/demo/Spatial_searching_2/CMakeLists.txt
index 55770b5f4c3a..78c6acd254de 100644
--- a/GraphicsView/demo/Spatial_searching_2/CMakeLists.txt
+++ b/GraphicsView/demo/Spatial_searching_2/CMakeLists.txt
@@ -4,35 +4,21 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Spatial_searching_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(DT_UI_FILES Spatial_searching_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Spatial_searching_2.qrc)
-
-  # The executable itself.
-  add_executable(
-    Spatial_searching_2 Spatial_searching_2.cpp ${DT_UI_FILES}
-                        ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(
+    Spatial_searching_2 Spatial_searching_2.cpp
+                        Spatial_searching_2.ui Spatial_searching_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Spatial_searching_2)
 
diff --git a/GraphicsView/demo/Stream_lines_2/CMakeLists.txt b/GraphicsView/demo/Stream_lines_2/CMakeLists.txt
index 71deef9e9100..f3f3133898a1 100644
--- a/GraphicsView/demo/Stream_lines_2/CMakeLists.txt
+++ b/GraphicsView/demo/Stream_lines_2/CMakeLists.txt
@@ -4,35 +4,21 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Stream_lines_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
   set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(DT_UI_FILES Stream_lines_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Stream_lines_2.qrc)
-
-  # The executable itself.
-  add_executable(
-    Stream_lines_2 Stream_lines_2.cpp ${DT_UI_FILES} ${CGAL_Qt6_RESOURCE_FILES}
-                   ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(
+    Stream_lines_2 Stream_lines_2.cpp
+    Stream_lines_2.ui Stream_lines_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Stream_lines_2)
 
diff --git a/GraphicsView/demo/Triangulation_2/CMakeLists.txt b/GraphicsView/demo/Triangulation_2/CMakeLists.txt
index 6ee55850f86d..a3ff3a16dd43 100644
--- a/GraphicsView/demo/Triangulation_2/CMakeLists.txt
+++ b/GraphicsView/demo/Triangulation_2/CMakeLists.txt
@@ -4,16 +4,9 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Triangulation_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
-set(CMAKE_AUTOMOC TRUE)
+set(CMAKE_AUTOMOC ON)
+set(CMAKE_AUTOUIC ON)
+set(CMAKE_AUTORCC ON)
 set(CMAKE_INCLUDE_CURRENT_DIR TRUE)
 
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
@@ -31,13 +24,10 @@ set(CMAKE_INCLUDE_CURRENT_DIR ON)
 # The "constrained Delaunay" demo: Constrained_Delaunay_triangulation_2
 #--------------------------------
 
-qt6_add_resources(CD_RES_FILE Constrained_Delaunay_triangulation_2.qrc)
-qt6_wrap_ui(CD_UI_FILES Constrained_Delaunay_triangulation_2.ui)
-# The executable itself.
-add_executable(
+qt_add_executable(
   Constrained_Delaunay_triangulation_2
-  Constrained_Delaunay_triangulation_2.cpp ${CD_UI_FILES}
-  ${CGAL_Qt6_RESOURCE_FILES} ${CD_RES_FILE})
+  Constrained_Delaunay_triangulation_2.cpp
+  Constrained_Delaunay_triangulation_2.ui Constrained_Delaunay_triangulation_2.qrc)
 target_link_libraries(Constrained_Delaunay_triangulation_2
                       PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
 target_include_directories(Constrained_Delaunay_triangulation_2
@@ -48,12 +38,9 @@ add_to_cached_list(CGAL_EXECUTABLE_TARGETS Constrained_Delaunay_triangulation_2)
 #--------------------------------
 # The "Delaunay" demo: Delaunay_triangulation_2
 #--------------------------------
-qt6_wrap_ui(D_UI_FILES Delaunay_triangulation_2.ui)
-qt6_add_resources(D_RES_FILE Delaunay_triangulation_2.qrc)
-# The executable itself.
-add_executable(
-  Delaunay_triangulation_2 Delaunay_triangulation_2.cpp ${D_UI_FILES}
-                           ${CGAL_Qt6_RESOURCE_FILES} ${D_RES_FILE})
+qt_add_executable(
+  Delaunay_triangulation_2 Delaunay_triangulation_2.cpp
+  Delaunay_triangulation_2.ui Delaunay_triangulation_2.qrc)
 target_link_libraries(Delaunay_triangulation_2
                       PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
 
@@ -63,12 +50,9 @@ add_to_cached_list(CGAL_EXECUTABLE_TARGETS Delaunay_triangulation_2)
 # The "Regular" demo: Regular_triangulation_2
 #--------------------------------
 
-# The executable itself.
-qt6_add_resources(R_RES_FILE Regular_triangulation_2.qrc)
-qt6_wrap_ui(R_UI_FILES Regular_triangulation_2.ui)
-add_executable(
-  Regular_triangulation_2 Regular_triangulation_2.cpp ${R_UI_FILES}
-                          ${CGAL_Qt6_RESOURCE_FILES} ${R_RES_FILE})
+qt_add_executable(
+  Regular_triangulation_2 Regular_triangulation_2.cpp
+  Regular_triangulation_2.ui Regular_triangulation_2.qrc)
 target_link_libraries(Regular_triangulation_2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
                                                       Qt6::Widgets)
 

From 7af862ec8a0194e9943caf3d6df44e15d830a6c8 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Tue, 29 Aug 2023 16:55:28 +0200
Subject: [PATCH 0679/1398] fix trailing space

---
 GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt b/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt
index 980aa3401a2a..842ed5ff23bb 100644
--- a/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt
+++ b/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/CMakeLists.txt
@@ -16,7 +16,7 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
 
   qt_add_executable(
-    Segment_voronoi_linf_2 Segment_voronoi_linf_2.cpp 
+    Segment_voronoi_linf_2 Segment_voronoi_linf_2.cpp
     Segment_voronoi_2.ui Segment_voronoi_2.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Segment_voronoi_linf_2)

From 1f13a625b11732ec9240e3249c1a279a08556a18 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 30 Aug 2023 09:32:17 +0200
Subject: [PATCH 0680/1398] restore the OpenGL format in DemosMainWindow

That still does not work well when the widget is a `QOpenGLWidget`.
We probably need to derive from that class, to call `glClearColor(..)`
in the `paintGL()` method.
---
 .../include/CGAL/Qt/CreateOpenGLContext.h         | 12 ++++--------
 .../include/CGAL/Qt/DemosMainWindow_impl.h        | 15 +++++++++------
 GraphicsView/include/CGAL/Qt/debug_impl.h         |  1 -
 GraphicsView/include/CGAL/Qt/qglviewer.h          |  2 --
 GraphicsView/include/CGAL/Qt/qglviewer_impl.h     |  1 -
 5 files changed, 13 insertions(+), 18 deletions(-)

diff --git a/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h b/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
index e85911f73e87..5c37bffe9a05 100644
--- a/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
+++ b/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
@@ -19,16 +19,12 @@ namespace Qt{
 inline QOpenGLContext* createOpenGLContext()
 {
     QOpenGLContext *context = new QOpenGLContext();
+    QSurfaceFormat format;
+    format.setVersion(2,1);
+    format.setProfile(QSurfaceFormat::CompatibilityProfile);
+    context->setFormat(format);
     context->create();
     return context;
-
-    //QSurfaceFormat format;
-    //format.setVersion(2,1);
-    //format.setProfile(QSurfaceFormat::CompatibilityProfile);
-    //context->setFormat(format);
-    //QGLContext *result = QGLContext::fromOpenGLContext(context);
-    // result->create();
-    //return result;
 }
 } // namespace Qt
 } // namespace CGAL
diff --git a/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h b/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h
index 9b1761e6b868..8b6cb174703c 100644
--- a/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h
+++ b/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h
@@ -208,19 +208,22 @@ void
 DemosMainWindow::setUseOpenGL(bool checked)
 {
   if(checked) {
-    // AF QOpenGLWidget* new_viewport = new QOpenGLWidget;
+    QOpenGLWidget* new_viewport = new QOpenGLWidget(this);
+    new_viewport->setUpdateBehavior(QOpenGLWidget::NoPartialUpdate);
 
     // Setup the format to allow antialiasing with OpenGL:
     // one need to activate the SampleBuffers, if the graphic driver allows
     // this.
-    // AF QGLFormat glformat = new_viewport->format();
-    // AF glformat.setOption(QGL::SampleBuffers);
-    // AF new_viewport->setFormat(glformat);
+    auto glformat = new_viewport->format();
+    glformat.setSamples(4);
+    new_viewport->setFormat(glformat);
 
-    // AF view->setViewport(new_viewport);
+    view->setViewport(new_viewport);
+    view->setViewportUpdateMode(QGraphicsView::FullViewportUpdate);
   }
   else {
-    view->setViewport(new QWidget);
+    view->setViewport(new QWidget(this));
+    view->setViewportUpdateMode(QGraphicsView::MinimalViewportUpdate);
   }
   statusBar()->showMessage(tr("OpenGL %1activated").arg(checked?"":"de-"),
                            1000);
diff --git a/GraphicsView/include/CGAL/Qt/debug_impl.h b/GraphicsView/include/CGAL/Qt/debug_impl.h
index 4f3c152697c6..a9e0d6da5b1a 100644
--- a/GraphicsView/include/CGAL/Qt/debug_impl.h
+++ b/GraphicsView/include/CGAL/Qt/debug_impl.h
@@ -23,7 +23,6 @@
 #include <CGAL/Qt/debug.h>
 #include <QDir>
 #include <iostream>
-#include <QOpenGLWidget>
 #include <qopenglfunctions.h>
 namespace CGAL {
 namespace Qt {
diff --git a/GraphicsView/include/CGAL/Qt/qglviewer.h b/GraphicsView/include/CGAL/Qt/qglviewer.h
index a89a66a4b744..8ee3b4135f29 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer.h
@@ -70,8 +70,6 @@ class CGAL_QT_EXPORT QGLViewer : public QOpenGLWidget, public QOpenGLFunctions {
   Q_OBJECT
 
 public:
-  //todo check if this is used. If not remove it
-
   explicit QGLViewer(QOpenGLContext* context, QWidget *parent = nullptr,
                      ::Qt::WindowFlags flags = ::Qt::WindowType(0));
   explicit QGLViewer(QWidget *parent = nullptr,
diff --git a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
index b6bfc70e9ac3..3cca531c5fb2 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
@@ -2446,7 +2446,6 @@ void CGAL::QGLViewer::setMouseBinding(::Qt::Key key, ::Qt::KeyboardModifiers mod
 
   ClickBindingPrivate cbp(modifiers, button, false, ::Qt::NoButton, key);
   clickBinding_.remove(cbp);
-
 }
 
 

From 4740f81a1b706af3c8ecd6153f24d6d3fbd5b3fe Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 31 Aug 2023 15:43:44 +0200
Subject: [PATCH 0681/1398] add a target to compile all CGALlab

---
 Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
index dea8e54d2b0a..f4129a57c9fc 100644
--- a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
+++ b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
@@ -64,6 +64,10 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
     if(TARGET Polyhedron_3)
       add_dependencies( ${plugin_name} Polyhedron_3 )
     endif()
+    if(NOT TARGET CGALlab_all_plugins)
+      add_custom_target(CGALlab_all_plugins)
+    endif()
+    add_dependencies(CGALlab_all_plugins ${plugin_name})
     #metadata management
     #create "${plugin_implementation_base_name}.json" in BINARY_DIR
     STRING(TOLOWER "${plugin_implementation_base_name}.json" base_name)

From 4dc2ad3f36a9f2023e3e0ceaa5e44bf38b7332ea Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 4 Sep 2023 14:05:18 +0200
Subject: [PATCH 0682/1398] fix map type

---
 .../CGAL/Polygon_mesh_processing/autorefinement.h   | 13 +++++++------
 1 file changed, 7 insertions(+), 6 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index b3133304bb96..32765252a6f2 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1480,12 +1480,13 @@ void autorefine_triangle_soup(PointRange& soup_points,
   // TODO: reuse the fact that maps per triangle are already sorted
 
 #ifdef CGAL_LINKED_WITH_TBB
-  std::conditional_t<parallel_execution,
-                     tbb::concurrent_map<EK::Point_3, std::size_t>,
-                     std::map<EK::Point_3, std::size_t>> point_id_map;
+  typedef std::conditional_t<parallel_execution,
+                             tbb::concurrent_map<EK::Point_3, std::size_t>,
+                             std::map<EK::Point_3, std::size_t>> Point_id_map;
 #else
-  std::map<EK::Point_3, std::size_t> point_id_map;
+  typedef std::map<EK::Point_3, std::size_t> Point_id_map;
 #endif
+  Point_id_map point_id_map;
 
 #if ! defined(CGAL_NDEBUG) || defined(CGAL_DEBUG_PMP_AUTOREFINE)
   std::vector<EK::Point_3> exact_soup_points;
@@ -1605,7 +1606,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 #else
     //option 2 (without mutex)
     /// Lambda concurrent_get_point_id()
-    tbb::concurrent_vector<tbb::concurrent_map<EK::Point_3, std::size_t>::iterator> iterators;
+    tbb::concurrent_vector<typename Point_id_map::iterator> iterators;
     auto concurrent_get_point_id = [&](const typename EK::Point_3 pt)
     {
       auto insert_res = point_id_map.insert(std::make_pair(pt, -1));
@@ -1616,7 +1617,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
     //use map iterator triple for triangles to create them concurrently and safely
     soup_triangles_out.resize(offset + new_triangles.size());
-    std::vector<std::array<tbb::concurrent_map<EK::Point_3, std::size_t>::iterator, 3>> triangle_buffer(new_triangles.size());
+    std::vector<std::array<typename Point_id_map::iterator, 3>> triangle_buffer(new_triangles.size());
     tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
       [&](const tbb::blocked_range<size_t>& r) {
         for (size_t ti = r.begin(); ti != r.end(); ++ti) {

From 9d68f5350e491bb1b23a42f14027285477a18780 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 4 Sep 2023 14:58:47 +0200
Subject: [PATCH 0683/1398] doc + changes

---
 Installation/CHANGES.md                                     | 6 ++++++
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h   | 5 +++--
 2 files changed, 9 insertions(+), 2 deletions(-)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 479984002682..b361d15dec76 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -35,6 +35,12 @@ Release date: October 2023
 -   Removed the class templates `Gray_image_mesh_domain_3`, `Implicit_mesh_domain_3`, and `Labeled_image_mesh_domain_3`
     which are deprecated since CGAL-4.13.
 
+### [Polygon Mesh Processing](https://doc.cgal.org/6.0/Manual/packages.html#PkgPolygonMeshProcessing)
+
+-   Added the function
+    `CGAL::Polygon_mesh_processing::autorefine_triangle_soup()` that refines a soup of triangles so that no pair of triangles intersects
+     (they can share an edge or a vertex). Also added, the function `autorefine()` operating directly on a triangle mesh and updating it
+     using the aforementioned function on triangle soup.
 
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 32765252a6f2..884ce3477aa8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1128,8 +1128,9 @@ void generate_subtriangles(std::size_t ti,
 /**
 * \ingroup PMP_corefinement_grp
 *
-* refines a soup of triangles so that no pair of triangles intersects in their interior.
-* Note that points in `soup_points` can only be added (intersection points) a the end of the container, with the initial order preserved.
+* refines a soup of triangles so that no pair of triangles intersects.
+* Output triangles may share a common edge or a common vertex (but with the same indexed position in `points`).
+* Note that points in `soup_points` can only be added (intersection points) at the end of the container, with the initial order preserved.
 * Note that if `soup_points` contains two or more identical points and only the first copy (following the order in the `soup_points`)
 * will be used in `soup_triangles`.
 * `soup_triangles` will be updated to contain both the input triangles and the new subdivides triangles. Degenerate triangles will be removed.

From 0303b8dfd5eb99acb0668ff02e5e22c4d2c60424 Mon Sep 17 00:00:00 2001
From: Nicolas Saillant <saillantnicolas01@gmail.com>
Date: Tue, 5 Sep 2023 15:58:43 +0200
Subject: [PATCH 0684/1398] Update CMakeLists for QT6

---
 .../Polyline_simplification_2/CMakeLists.txt  | 27 +++++--------------
 .../Surface_mesh_deformation/CMakeLists.txt   |  5 ----
 .../demo/Triangulation_3/CMakeLists.txt       | 25 +++++------------
 3 files changed, 12 insertions(+), 45 deletions(-)

diff --git a/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt b/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt
index 90254ff949da..db32bac7b395 100644
--- a/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt
+++ b/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt
@@ -4,39 +4,24 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Polyline_simplification_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
-find_package(Qt6 QUIET COMPONENTS OpenGLWidgets Widgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 include_directories(BEFORE ${CMAKE_CURRENT_SOURCE_DIR}/include)
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
-  set(CMAKE_AUTOMOC ON)
-
   add_definitions(-DQT_NO_KEYWORDS)
+  set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(CDT_UI_FILES Polyline_simplification_2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES
-                    ${CMAKE_CURRENT_SOURCE_DIR}/Polyline_simplification_2.qrc)
 
   # The executable itself.
-  add_executable(
+  qt_add_executable(
     Polyline_simplification_2
-    ${CMAKE_CURRENT_SOURCE_DIR}/Polyline_simplification_2.cpp ${CDT_UI_FILES}
-    ${CGAL_Qt6_RESOURCE_FILES} ${CGAL_Qt6_MOC_FILES})
+    Polyline_simplification_2.cpp Polyline_simplification_2.ui Polyline_simplification_2.qrc)
 
   target_link_libraries(Polyline_simplification_2
                         PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
diff --git a/Surface_mesh_deformation/demo/Surface_mesh_deformation/CMakeLists.txt b/Surface_mesh_deformation/demo/Surface_mesh_deformation/CMakeLists.txt
index 33263a815435..3f5e0bdb430e 100644
--- a/Surface_mesh_deformation/demo/Surface_mesh_deformation/CMakeLists.txt
+++ b/Surface_mesh_deformation/demo/Surface_mesh_deformation/CMakeLists.txt
@@ -4,11 +4,6 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Surface_mesh_deformation_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
 set_property(DIRECTORY PROPERTY CGAL_NO_TESTING TRUE)
 
 find_package(CGAL REQUIRED)
diff --git a/Triangulation_3/demo/Triangulation_3/CMakeLists.txt b/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
index bce91a5a51b3..1058b455a761 100644
--- a/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
+++ b/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
@@ -4,14 +4,6 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Triangulation_3_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 # Find includes in corresponding build directories
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
@@ -20,7 +12,7 @@ set(CMAKE_AUTOMOC ON)
 
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets OpenGL)
+find_package(Qt6 QUIET COMPONENTS Widgets OpenGL)
 
 if(Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
@@ -48,24 +40,19 @@ endif()
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   include_directories(BEFORE ./)
-
-  # ui files, created with Qt Designer
-  qt6_wrap_ui(uis MainWindow.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./T3_demo.qrc)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
   # cpp files
-  add_executable(
+  qt_add_executable(
     T3_demo
     T3_demo.cpp
     MainWindow.cpp
     Viewer.cpp
     PreferenceDlg.cpp
     Scene.cpp
-    ${uis}
-    ${CGAL_Qt6_RESOURCE_FILES}
-    ${CGAL_Qt6_MOC_FILES})
+    MainWindow.ui
+    T3_demo.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS T3_demo)
 

From 586a71e66ef3fedc55bce6148837bfc4b08b739c Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 6 Sep 2023 01:59:35 +0300
Subject: [PATCH 0685/1398] added missing reference to paper

---
 Documentation/doc/biblio/cgal_manual.bib          | 9 +++++++++
 Heat_method_3/doc/Heat_method_3/Heat_method_3.txt | 2 +-
 2 files changed, 10 insertions(+), 1 deletion(-)

diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib
index 89d062ddddf5..2abd7e1b30d4 100644
--- a/Documentation/doc/biblio/cgal_manual.bib
+++ b/Documentation/doc/biblio/cgal_manual.bib
@@ -2049,6 +2049,15 @@ @Article{ cgal:rz-jcam-04
   update        = "09.11 penarand"
 }
 
+@article{ cgal:sc-lntm-20
+  ,author        = {Nicholas Sharp and Keenan Crane}
+  ,title         = {{A Laplacian for Nonmanifold Triangle Meshes}}
+  ,journal       = {Computer Graphics Forum (SGP)}
+  ,volume        = {39}
+  ,number        = {5}
+  ,year          = {2020}
+}
+
 @inproceedings{cgal:ssgh-tmpm-01,
   title={Texture mapping progressive meshes},
   author={Sander, Pedro V and Snyder, John and Gortler, Steven J and Hoppe, Hugues},
diff --git a/Heat_method_3/doc/Heat_method_3/Heat_method_3.txt b/Heat_method_3/doc/Heat_method_3/Heat_method_3.txt
index 82ad37d2d41b..2b2d3f8aab3a 100644
--- a/Heat_method_3/doc/Heat_method_3/Heat_method_3.txt
+++ b/Heat_method_3/doc/Heat_method_3/Heat_method_3.txt
@@ -41,7 +41,7 @@ the mathematical theory of the Heat method. The last section is about the \ref s
 
 Note that this package depends on the third party \ref thirdpartyEigen library (3.3 or greater), or another
 model of the concept `SparseLinearAlgebraWithFactorTraits_d`.
-This implementation is based on \cgalCite{cgal:cww-ghnac-13} and \cgalCite{cgal:fsbs-acidt-06}
+This implementation is based on \cgalCite{cgal:cww-ghnac-13} , \cgalCite{cgal:fsbs-acidt-06} , and \cgalCite{cgal:sc-lntm-20}
 
 This package is related to the package \ref PkgSurfaceMeshShortestPath. Both deal with geodesic distances.
 The heat method package computes for every vertex of a mesh an approximate distance to one or several source vertices.

From 88a9d86012230914bbb80e8eef81e3468ab93387 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 6 Sep 2023 02:30:05 +0300
Subject: [PATCH 0686/1398] added url

---
 Documentation/doc/biblio/cgal_manual.bib | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib
index 2abd7e1b30d4..38b745f67809 100644
--- a/Documentation/doc/biblio/cgal_manual.bib
+++ b/Documentation/doc/biblio/cgal_manual.bib
@@ -2053,6 +2053,7 @@ @article{ cgal:sc-lntm-20
   ,author        = {Nicholas Sharp and Keenan Crane}
   ,title         = {{A Laplacian for Nonmanifold Triangle Meshes}}
   ,journal       = {Computer Graphics Forum (SGP)}
+  ,url           = "https://www.cs.cmu.edu/~kmcrane/Projects/NonmanifoldLaplace/NonmanifoldLaplace.pdf"
   ,volume        = {39}
   ,number        = {5}
   ,year          = {2020}

From 167db62e0753cf73965e97eccbe6b2545e96d59c Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 6 Sep 2023 12:50:39 +0300
Subject: [PATCH 0687/1398] moved bib to cgal_manual.bib & restored geom.bib

---
 Documentation/doc/biblio/cgal_manual.bib      | 23 +++++++++++++++++
 Documentation/doc/biblio/geom.bib             | 25 +------------------
 .../Polygon_mesh_processing.txt               | 10 ++++----
 3 files changed, 29 insertions(+), 29 deletions(-)

diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib
index 89d062ddddf5..453f1968678e 100644
--- a/Documentation/doc/biblio/cgal_manual.bib
+++ b/Documentation/doc/biblio/cgal_manual.bib
@@ -1331,6 +1331,29 @@ @INPROCEEDINGS{cgal:la-srpss-13
     address = {Girona, Spain}
 }
 
+@article{cgal:lrtc-iccmps-20,
+  author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert and David Coeurjolly},
+  journal = {Computer Graphics Forum (Proceedings of Symposium on Geometry Processing)},
+  number = {5},
+  title = {Interpolated Corrected Curvature Measures for Polygonal Surfaces},
+  volume = {39},
+  month = aug,
+  year = {2020},
+  url = {https://doi.org/10.1111/cgf.14067},
+  doi = {10.1111/cgf.14067}
+}
+
+@article{cgal:lrt-ccm-22,
+  author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert},
+  journal = {Discrete & Computational Geometry},
+  title = {Corrected Curvature Measures},
+  volume = {68},
+  pages = {477-524},
+  month = jul,
+  year = {2022},
+  url = {https://doi.org/10.1007/s00454-022-00399-4}
+}
+
 @article{cgal:lm-clscm-12,
     author = {Lafarge, Florent and Mallet, Clement},
     title = {{Creating large-scale city models from 3D-point clouds: a robust approach with hybrid representation}},
diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib
index f072116a2e27..5d6a1f80b0c4 100644
--- a/Documentation/doc/biblio/geom.bib
+++ b/Documentation/doc/biblio/geom.bib
@@ -152043,7 +152043,6 @@ @article{cvl-ew-12
 	Pages                    = {215--224},
 	Year                     = {2012},
 	Url                      = {https://monge.univ-mlv.fr/~colinde/pub/09edgewidth.pdf}
-}
 
 @inproceedings{tang2009interactive,
   title={Interactive Hausdorff distance computation for general polygonal models},
@@ -152054,26 +152053,4 @@ @inproceedings{tang2009interactive
   pages={74},
   year={2009},
   organization={ACM}
-}
-
-@article{lachaud2020,
-  author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert and David Coeurjolly},
-  journal = {Computer Graphics Forum (Proceedings of Symposium on Geometry Processing)},
-  number = {5},
-  title = {Interpolated corrected curvature measures for polygonal surfaces},
-  volume = {39},
-  month = jul,
-  year = {2020}
-}
-
-@article{lachaud2022
-  author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert},
-  journal = {Discrete & Computational Geometry},
-  title = {Corrected Curvature Measures},
-  volume = {68},
-  pages = {477-524},
-  month = jul,
-  year = {2022},
-  url = {https://doi.org/10.1007/s00454-022-00399-4}
-}
-
+}
\ No newline at end of file
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 9773216f3cb6..d81a1f6029e4 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -940,7 +940,7 @@ not provide storage for the normals.
 \section PMPICC Computing Curvatures
 
 This package provides methods to compute curvatures on polygonal meshes based on Interpolated
-Corrected Curvatures on Polyhedral Surfaces \cgalCite{lachaud2020}. This includes mean curvature,
+Corrected Curvatures on Polyhedral Surfaces \cgalCite{cgal:lrtc-iccmps-20}. This includes mean curvature,
 Gaussian curvature, principal curvatures and directions. These can be computed on triangle meshes,
 quad meshes, and meshes with n-gon faces (for n-gons, the centroid must be inside the n-gon face).
 The algorithms used prove to work well in general. Also, on meshes with noise on vertex positions,
@@ -955,10 +955,10 @@ in each direction is called the principal curvature: \f$ k_1 \f$ and \f$ k_2 \f$
 curvatures). Curvature is usually expressed as scalar quantities like the mean curvature \f$ H \f$ and
 the Gaussian curvature \f$ K \f$ which are defined in terms of the principal curvatures.
 
-The algorithms are based on the two papers \cgalCite{lachaud2022} and \cgalCite{lachaud2020}. They
-introduce a new way to compute curvatures on polygonal meshes. The main idea in \cgalCite{lachaud2022} is
+The algorithms are based on the two papers \cgalCite{cgal:lrt-ccm-22} and \cgalCite{cgal:lrtc-iccmps-20}. They
+introduce a new way to compute curvatures on polygonal meshes. The main idea in \cgalCite{cgal:lrt-ccm-22} is
 based on decoupling the normal information from the position information, which is useful for dealing with
-digital surfaces, or meshes with noise on vertex positions. \cgalCite{lachaud2020} introduces some
+digital surfaces, or meshes with noise on vertex positions. \cgalCite{cgal:lrtc-iccmps-20} introduces some
 extensions to this framework. As it uses linear interpolation on the corrected normal vector field
 to derive new closed form equations for the corrected curvature measures. These <b>interpolated</b>
 curvature measures are the first step for computing the curvatures. For a triangle \f$ \tau_{ijk} \f$,
@@ -1285,7 +1285,7 @@ is covered by a set of prisms, where each prism is an offset for an input triang
 That is, the implementation in \cgal does not use indirect predicates.
 
 The interpolated corrected curvatures were implemented during GSoC 2022. This was implemented by Hossam Saeed and under
-supervision of David Coeurjolly, Jaques-Olivier Lachaud, and Sébastien Loriot. The implementation is based on \cgalCite{lachaud2020}.
+supervision of David Coeurjolly, Jaques-Olivier Lachaud, and Sébastien Loriot. The implementation is based on \cgalCite{cgal:lrtc-iccmps-20}.
 <a href="https://dgtal-team.github.io/doc-nightly/moduleCurvatureMeasures.html">DGtal's implementation</a> was also
 used as a reference during the project.
 

From 72fd73e2b7f4db9e9b4c1f20cdfaddfafe6ee05f Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 6 Sep 2023 12:51:28 +0300
Subject: [PATCH 0688/1398] Update geom.bib

---
 Documentation/doc/biblio/geom.bib | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib
index 5d6a1f80b0c4..969a1a79b5ba 100644
--- a/Documentation/doc/biblio/geom.bib
+++ b/Documentation/doc/biblio/geom.bib
@@ -152053,4 +152053,4 @@ @inproceedings{tang2009interactive
   pages={74},
   year={2009},
   organization={ACM}
-}
\ No newline at end of file
+}

From 5ddcf716b618c7683e6427e6310e7b361d6177d1 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Wed, 6 Sep 2023 12:52:34 +0300
Subject: [PATCH 0689/1398] fixed order in bib

---
 Documentation/doc/biblio/cgal_manual.bib | 20 ++++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib
index 453f1968678e..5fc304486601 100644
--- a/Documentation/doc/biblio/cgal_manual.bib
+++ b/Documentation/doc/biblio/cgal_manual.bib
@@ -1331,6 +1331,16 @@ @INPROCEEDINGS{cgal:la-srpss-13
     address = {Girona, Spain}
 }
 
+@article{cgal:lm-clscm-12,
+    author = {Lafarge, Florent and Mallet, Clement},
+    title = {{Creating large-scale city models from 3D-point clouds: a robust approach with hybrid representation}},
+    journal = {International Journal of Computer Vision},
+    volume = {99},
+    number = {1},
+    pages = {69-85},
+    year = {2012},
+}
+
 @article{cgal:lrtc-iccmps-20,
   author = {Jacques-Olivier Lachaud and Pascal Romon and Boris Thibert and David Coeurjolly},
   journal = {Computer Graphics Forum (Proceedings of Symposium on Geometry Processing)},
@@ -1354,16 +1364,6 @@ @article{cgal:lrt-ccm-22
   url = {https://doi.org/10.1007/s00454-022-00399-4}
 }
 
-@article{cgal:lm-clscm-12,
-    author = {Lafarge, Florent and Mallet, Clement},
-    title = {{Creating large-scale city models from 3D-point clouds: a robust approach with hybrid representation}},
-    journal = {International Journal of Computer Vision},
-    volume = {99},
-    number = {1},
-    pages = {69-85},
-    year = {2012},
-}
-
 @inproceedings{ cgal:lt-fmeps-98,
     author = "Peter Lindstrom and Greg Turk",
     title = "Fast and memory efficient polygonal simplification",

From 7beae3e8beb8d400d7e997471467198d14ab8e7c Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Wed, 6 Sep 2023 16:19:02 +0200
Subject: [PATCH 0690/1398] Made images colors adapt to their base color

---
 .../demo/Polyhedron/Scene_image_item.cpp      | 27 ++++++++++++-------
 Polyhedron/demo/Polyhedron/Scene_image_item.h |  2 ++
 2 files changed, 19 insertions(+), 10 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
index e9999831d4e9..6969b172e378 100644
--- a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
@@ -24,7 +24,7 @@ template <typename Word_type>
 class Image_accessor
 {
 public:
-  Image_accessor(const Image& im, int dx=1, int dy=1, int dz=1);
+  Image_accessor(const Image& im, int dx=1, int dy=1, int dz=1, const QColor& default_color = QColor());
 
   bool is_vertex_active(std::size_t i, std::size_t j, std::size_t k) const;
   const QColor& vertex_color(std::size_t i, std::size_t j, std::size_t k) const;
@@ -64,12 +64,12 @@ class Image_accessor
 };
 
 template <typename Word_type>
-Image_accessor<Word_type>::Image_accessor(const Image& im, int dx, int dy, int dz)
+Image_accessor<Word_type>::Image_accessor(const Image& im, int dx, int dy, int dz, const QColor& default_color)
 : im_(&im)
 , dx_(dx)
 , dy_(dy)
 , dz_(dz)
-, default_color_()
+, default_color_(default_color)
 , colors_()
 {
   const std::size_t xdim = im_->xdim();
@@ -88,14 +88,15 @@ Image_accessor<Word_type>::Image_accessor(const Image& im, int dx, int dy, int d
     }
   }
 
-  double i=0;
-  const double starting_hue = 45./360.; // magenta
+  const double nb_Colors = colors_.size()+1;
+  double i=1;
+  const double starting_hue = default_color.hueF();
   for ( auto it = colors_.begin(),
        end = colors_.end() ; it != end ; ++it, i += 1.)
   {
-    double hue =  starting_hue + 1./double(colors_.size()) * i;
+    double hue =  starting_hue + 1./nb_Colors * i;
     if ( hue > 1. ) { hue -= 1.; }
-    it->second = QColor::fromHsvF(hue, .75, .75);
+    it->second = QColor::fromHsvF(hue, default_color.saturationF(), default_color.valueF());
   }
 }
 
@@ -753,6 +754,11 @@ void Scene_image_item::drawEdges(Viewer_interface *viewer) const
 
 bool Scene_image_item::isGray() { return d->is_hidden;}
 
+void Scene_image_item::setColor(QColor c) {
+  color_ = c;
+  invalidateOpenGLBuffers();
+}
+
 void Scene_image_item::invalidateOpenGLBuffers()
 {
   setBuffersFilled(false);
@@ -779,9 +785,9 @@ void Scene_image_item::initializeBuffers(Viewer_interface *v) const
 
 template <typename Word_type>
 internal::Vertex_buffer_helper*
-init_helper(const Image &im, int dx, int dy, int dz, bool is_ogl_4_3)
+init_helper(const Image &im, int dx, int dy, int dz, bool is_ogl_4_3, const QColor& default_color = QColor())
 {
-  internal::Image_accessor<Word_type> image_data_accessor(im, dx, dy, dz);
+  internal::Image_accessor<Word_type> image_data_accessor(im, dx, dy, dz, default_color);
   return new internal::Vertex_buffer_helper_impl<Word_type>(std::move(image_data_accessor),
                                                             is_ogl_4_3);
 }
@@ -800,7 +806,8 @@ void Scene_image_item::computeElements() const
     CGAL_IMAGE_IO_CASE(m_image->image(),
                        d->helper = init_helper<Word>(*m_image,
                                                      d->m_voxel_scale, d->m_voxel_scale, d->m_voxel_scale,
-                                                     d->is_ogl_4_3));
+                                                     d->is_ogl_4_3,
+                                                     color_));
     d->helper->fill_buffer_data();
     getTriangleContainer(0)->allocate(
           Tc::Smooth_vertices,
diff --git a/Polyhedron/demo/Polyhedron/Scene_image_item.h b/Polyhedron/demo/Polyhedron/Scene_image_item.h
index fadffb352c45..d841f4b4f33d 100644
--- a/Polyhedron/demo/Polyhedron/Scene_image_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_image_item.h
@@ -49,6 +49,8 @@ class SCENE_IMAGE_ITEM_EXPORT Scene_image_item
   void set_image_weights(const Image& img, const float sigma);
   float sigma_weights() const;
 
+  void setColor(QColor c);
+
   void invalidateOpenGLBuffers();
   void initializeBuffers(Viewer_interface *) const;
   void computeElements() const;

From 6f8116c4d55cb4fd691ea4e02e003f468b8afd68 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Wed, 6 Sep 2023 18:24:27 +0200
Subject: [PATCH 0691/1398] Update mesh coloring. Visible surface patches uses
 the domains' colors. The mesh generated from an image has now the same color
 (if their base color is the same).

---
 .../Polyhedron/Scene_triangulation_3_item.cpp | 28 +++++++++++++++++--
 1 file changed, 26 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
index 7dc8c51f1ce9..837d859aa973 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
@@ -442,6 +442,7 @@ struct Scene_triangulation_3_item_priv {
   typedef std::set<int> Indices;
   Indices surface_patch_indices_;
   Indices subdomain_indices_;
+  std::unordered_map<int, int> visible_surface_patch_to_subdomain;
   std::unordered_map<int, int> id_to_compact;
   QSlider* tet_Slider;
   bool is_filterable;
@@ -643,6 +644,7 @@ Scene_triangulation_3_item::triangulation_changed()
   // Fill indices map and get max subdomain value
   d->surface_patch_indices_.clear();
   d->subdomain_indices_.clear();
+  d->visible_surface_patch_to_subdomain.clear();
   d->visible_subdomain.clear();
   d->id_to_compact.clear();
 
@@ -664,7 +666,18 @@ Scene_triangulation_3_item::triangulation_changed()
        end = triangulation().finite_facets_end(); fit != end; ++fit)
   {
     max = (std::max)(max, fit->first->surface_patch_index(fit->second));
-    d->surface_patch_indices_.insert(fit->first->surface_patch_index(fit->second));
+    int index = fit->first->surface_patch_index(fit->second);
+    d->surface_patch_indices_.insert(index);
+    int dom0 = fit->first->subdomain_index();
+    int dom1 = fit->first->neighbor(fit->second)->subdomain_index();
+    if (dom0 == 0) // if cell is not in complex
+    {
+        d->visible_surface_patch_to_subdomain[index] = dom1;
+    }
+    else if (dom1 == 0)  // if opposite cell is not in complex
+    {
+        d->visible_surface_patch_to_subdomain[index] = dom0;
+    }
   }
 
   d->colors.resize(max + 1);
@@ -882,12 +895,23 @@ Scene_triangulation_3_item_priv::compute_color_map(const QColor& c)
   }
   const size_type nb_patch_indices = surface_patch_indices_.size();
   i = 0;
+  double patch_hsv_value = fmod(c.valueF() + .5, 1.);
   for (Indices::iterator it = surface_patch_indices_.begin(),
          end = surface_patch_indices_.end(); it != end; ++it, i += 1.)
   {
     double hue = c.hueF() + 1. / double(nb_patch_indices) * i;
     if (hue > 1) { hue -= 1.; }
-    colors[*it] = QColor::fromHsvF(hue, c.saturationF(), c.valueF());
+    colors[*it] = QColor::fromHsvF(hue, c.saturationF(), patch_hsv_value);
+  }
+
+  const size_type nb_visible_patch_indices = visible_surface_patch_to_subdomain.size();
+  i = 0;
+  for (std::unordered_map<int, int>::iterator it = visible_surface_patch_to_subdomain.begin(),
+       end = visible_surface_patch_to_subdomain.end(); it != end; ++it, i += 1.)
+  {
+    double hue = c.hueF() + 1. / double(nb_patch_indices) * i;
+    if (hue > 1) { hue -= 1.; }
+    colors[it->first] = colors_subdomains[it->second];
   }
 }
 

From c059ee5be3f9014ca433d9d6437b464909f3f4e4 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Thu, 7 Sep 2023 10:06:25 +0200
Subject: [PATCH 0692/1398] Updated scene mesh creation The color is
 initialized to the base item's color.

---
 Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
index 59c687fb8a40..ca47e02782a9 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
@@ -1037,7 +1037,7 @@ treat_result(Scene_item& source_item,
                             float((bbox.ymin() + bbox.ymax())/2.f),
                             float((bbox.zmin() + bbox.zmax())/2.f));
 
-    result_item->setColor(default_mesh_color);
+    result_item->setColor(source_item.color());
     result_item->setRenderingMode(source_item.renderingMode());
     result_item->set_data_item(&source_item);
 

From 3d49105c91b5d7f3b7b9400f25b59118abfb5cd1 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Thu, 7 Sep 2023 14:57:16 +0200
Subject: [PATCH 0693/1398] Incorrect closing HTML comment

Newer versions of doxygen are more restrictive (and following the rules) in respect to the end comment of a HTML type of comment, i.e. `<!-- ... -->`, so parts of the paragraphs were missing
(Triangulation/index.html and Triangulation/group___pkg_triangulations_ref.html)

See also https://www.w3.org/TR/2006/REC-xml11-20060816/#sec-comments
---
 Triangulation/doc/Triangulation/PackageDescription.txt | 2 +-
 Triangulation/doc/Triangulation/Triangulation.txt      | 8 ++++----
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/Triangulation/doc/Triangulation/PackageDescription.txt b/Triangulation/doc/Triangulation/PackageDescription.txt
index 0b5d4c7b5ed3..2ef98bf9d843 100644
--- a/Triangulation/doc/Triangulation/PackageDescription.txt
+++ b/Triangulation/doc/Triangulation/PackageDescription.txt
@@ -67,7 +67,7 @@ of the underlying Euclidean space \f$ \mathbb{R}^d\f$.
 The neighbors of a full cell are also
 indexed  in such a way that the neighbor indexed by \f$ i\f$
 is opposite to the vertex with the same index.
---->
+-->
 
 \cgalClassifedRefPages
 
diff --git a/Triangulation/doc/Triangulation/Triangulation.txt b/Triangulation/doc/Triangulation/Triangulation.txt
index 452891fa4158..d45c8cd1ba8a 100644
--- a/Triangulation/doc/Triangulation/Triangulation.txt
+++ b/Triangulation/doc/Triangulation/Triangulation.txt
@@ -41,7 +41,7 @@ that is pure, connected and without boundaries nor singularities. The
 <i>dimension</i> of the triangulation is the dimension of its maximal
 simplices.
 
-<!--- cardinality, i.e., they have the same number of vertices.--->
+<!--- cardinality, i.e., they have the same number of vertices. -->
 In the sequel, we will call these maximal simplices <I>full cells</I>.
 A <I>face</I> of a simplex is a subset of this simplex.
 A <I>proper face</I> of a simplex is a strict subset of this simplex.
@@ -136,12 +136,12 @@ Possible values of \f$d\f$ (the <I>current dimension</I> of the triangulation) i
 triangulation data structure.
 <DT><B>\f$d=-1\f$</B><DD> This corresponds to an abstract simplicial
 complex reduced to a single vertex.
- <!---  and a single full cell. In a geometric triangulation, this vertex corresponds to the vertex at infinity.--->
+ <!---  and a single full cell. In a geometric triangulation, this vertex corresponds to the vertex at infinity. -->
 <DT><B>\f$d=0\f$</B><DD> This corresponds to an abstract simplicial
 complex including two vertices, each corresponding to a full cell;
 the two full cells being neighbors of each other. This is the unique
 triangulation of the \f$ 0\f$-sphere.
-<!--- (geometrically, the finite vertex and the infinite vertex),--->
+<!--- (geometrically, the finite vertex and the infinite vertex), -->
 <DT><B>\f$ 0< d \le D\f$</B><DD> This corresponds to a triangulation of
 the sphere \f$ \mathbb{S}^d\f$.
 </DL>
@@ -260,7 +260,7 @@ Therefore, the reader will make
 the best use of this example by reading it slowly, together with the reference
 manual documentation of the methods that are called (see here:
 `TriangulationDataStructure`) and by trying to understand the various
-`assert(...)` statements.--->
+`assert(...)` statements. -->
 
 \cgalExample{triangulation_data_structure_static.cpp}
 

From a3148fb8f5d4cea082c5ea03caab9d72480b30cc Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Thu, 7 Sep 2023 17:33:26 +0200
Subject: [PATCH 0694/1398] issue #7701 Appearance of "Set of Faces" in
 documentation.

Remove gray background and get some indentation
(Note this proposed pull request needs the proposed pull request #7700)
---
 Triangulation/doc/Triangulation/Triangulation.txt | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/Triangulation/doc/Triangulation/Triangulation.txt b/Triangulation/doc/Triangulation/Triangulation.txt
index 452891fa4158..0fdc6a4d6c06 100644
--- a/Triangulation/doc/Triangulation/Triangulation.txt
+++ b/Triangulation/doc/Triangulation/Triangulation.txt
@@ -130,7 +130,7 @@ Two full cells \f$ \sigma\f$ and \f$ \sigma'\f$ sharing a facet are called
 <I>neighbors</I>. A full cell has always exactly \f$ d+1\f$ neighbors.
 
 Possible values of \f$d\f$ (the <I>current dimension</I> of the triangulation) include
-<BLOCKQUOTE>
+\par
 <DL>
 <DT><B>\f$d=-2\f$</B><DD> This corresponds to an empty
 triangulation data structure.
@@ -145,7 +145,6 @@ triangulation of the \f$ 0\f$-sphere.
 <DT><B>\f$ 0< d \le D\f$</B><DD> This corresponds to a triangulation of
 the sphere \f$ \mathbb{S}^d\f$.
 </DL>
-</BLOCKQUOTE>
 
 ## The `Triangulation_data_structure` Class ##
 

From 8afc4347b43414e19fdebdc5925181a102293ae6 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Thu, 7 Sep 2023 17:43:05 +0200
Subject: [PATCH 0695/1398] issue #7702 Appearance of " Hilbert Sorting" in
 documentation.

Remove gray background and get some indentation
---
 Spatial_sorting/doc/Spatial_sorting/Spatial_sorting.txt | 8 +++-----
 1 file changed, 3 insertions(+), 5 deletions(-)

diff --git a/Spatial_sorting/doc/Spatial_sorting/Spatial_sorting.txt b/Spatial_sorting/doc/Spatial_sorting/Spatial_sorting.txt
index a97ef3ead181..6dd4d3cef740 100644
--- a/Spatial_sorting/doc/Spatial_sorting/Spatial_sorting.txt
+++ b/Spatial_sorting/doc/Spatial_sorting/Spatial_sorting.txt
@@ -42,18 +42,16 @@ to the unit square \f$ [0,1]^2\f$, such that \f$ f(0)=(0,0)\f$ and \f$ f(1)=(1,0
 in the following way:
 the unit square is subdivided in four such that
 
-<BLOCKQUOTE>
+\par
 \f$ f([0,\frac{1}{4}])=[0,\frac{1}{2}]^2\f$,
 \f$ f([\frac{1}{4},\frac{1}{2}])=[0,\frac{1}{2}]\times[\frac{1}{2},1]\f$,
 \f$ f([\frac{1}{2},\frac{3}{4}])=[\frac{1}{2},1]^2\f$,
 and
 \f$ f([\frac{3}{4},1])=[\frac{1}{2},1]\times[0,\frac{1}{2}].\f$
-
-\f$ f(\frac{1}{4})=(0,\frac{1}{2})\f$
-
+<br>
+\f$ f(\frac{1}{4})=(0,\frac{1}{2})\f$,
 \f$ f(\frac{1}{2})=(\frac{1}{2},\frac{1}{2})\f$, and
 \f$ f(\frac{3}{4})=(1,\frac{1}{2})\f$.
-</BLOCKQUOTE>
 
 Then each square is subdivided in the same way recursively.
 \cgalFigureRef{Spatial_sorting_fig_Hilbert8} illustrates this process.

From 3ef293b5bd21e31567fcef8557e266091503f284 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 8 Sep 2023 11:41:14 +0200
Subject: [PATCH 0696/1398] Update to new cgalModels

---
 .../include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h  | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
index 94bcd7ab5f12..c551716d618e 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/Remeshing_cell_base_3.h
@@ -35,7 +35,7 @@ It has to be a model of the concept `RemeshingTriangulationTraits_3`.
 \tparam Cb is a cell base class from which `Remeshing_cell_base_3` derives.
 It must be a model of the `SimplicialMeshCellBase_3` concept.
 
-\cgalModels `RemeshingCellBase_3`
+\cgalModels{RemeshingCellBase_3}
 
 */
 template<typename Gt,

From b286df4b96923e23d4bb72dce15839fc04999c28 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 8 Sep 2023 11:49:32 +0200
Subject: [PATCH 0697/1398] fix warnings (and ASAN errors)

---
 .../Arrangement_on_surface_2/PropertyValueDelegate.cpp    | 2 +-
 .../examples/Arrangement_on_surface_2/draw_arr.cpp        | 8 +++-----
 .../include/CGAL/Curved_kernel_via_analysis_2/Point_2.h   | 8 ++++----
 .../demo/Periodic_3_triangulation_3/MainWindow.h          | 6 +++---
 .../demo/Periodic_Lloyd_3/MainWindow.cpp                  | 2 +-
 5 files changed, 12 insertions(+), 14 deletions(-)

diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PropertyValueDelegate.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PropertyValueDelegate.cpp
index 0f2dbb004986..ba47beb81df0 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PropertyValueDelegate.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/PropertyValueDelegate.cpp
@@ -22,7 +22,7 @@ PropertyValueDelegate::PropertyValueDelegate( QObject* parent ):
   QItemEditorFactory* factory = new QItemEditorFactory;
   QItemEditorCreatorBase* creator =
     new QStandardItemEditorCreator< PositiveSpinBox >( );
-  factory->registerEditor( QVariant::UInt, creator );
+  factory->registerEditor( QMetaType::UInt, creator );
   this->setItemEditorFactory( factory );
 }
 
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
index 8c3c9b4daf85..91da88edc68a 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
@@ -22,8 +22,8 @@ std::tuple<unsigned char, unsigned char, unsigned char>
 hsv_to_rgb(float hue, float sat, float value) {
   float red, green, blue;
   float fc = value * sat; // Chroma
-  float hue_prime = fmod(hue / 60.0f, 6);
-  float fx = fc * (1.0f - fabs(fmod(hue_prime, 2) - 1.0));
+  float hue_prime = fmod(hue / 60.0f, 6.f);
+  float fx = fc * (1.0f - fabs(fmod(hue_prime, 2.f) - 1.f));
   float fm = value - fc;
 
   if(0 <= hue_prime && hue_prime < 1) {
@@ -104,9 +104,7 @@ int main() {
                     float h = 360.0f * id++ / arr.number_of_faces();
                     float s = 0.5;
                     float v = 0.5;
-                    float r, g, b;
-                    typedef unsigned char uchar;
-                    std::tie(r, g, b) = hsv_to_rgb(h, s, v);
+                    auto [r, g, b] = hsv_to_rgb(h, s, v);
                     return CGAL::IO::Color(r,g,b);
                   }, "hsv colors", true);
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
index 789f24b841e4..f64c67b70eac 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
@@ -736,13 +736,13 @@ class Point_2 :
     swallow(is, '(');
 
     // read values
-    is >> iformat(rep._m_xy);
+    is >> IO::iformat(rep._m_xy);
     swallow(is, ',');
-    is >> iformat(rep._m_x);
+    is >> IO::iformat(rep._m_x);
     swallow(is, ',');
-    is >> iformat(rep._m_curve);
+    is >> IO::iformat(rep._m_curve);
     swallow(is, ',');
-    is >> iformat(rep._m_arcno);
+    is >> IO::iformat(rep._m_arcno);
     swallow(is, ',');
     is >> rep._m_location;
 
diff --git a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.h b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.h
index 0972fe6db4c1..79b3e5bec140 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.h
+++ b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.h
@@ -103,15 +103,15 @@ class MainWindow : public QMainWindow
   }
 
   ~MainWindow() {
-    delete(ui);
-    delete(s);
     process->close();
     delete(process);
+    delete(s);
+    delete(ui);
   }
 
 public Q_SLOTS:
   void help() {
-    QString app = QLibraryInfo::location(QLibraryInfo::BinariesPath)
+    QString app = QLibraryInfo::path(QLibraryInfo::BinariesPath)
       + QDir::separator();
 #if !defined(Q_OS_MAC)
     app += QString("assistant");
diff --git a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/MainWindow.cpp b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/MainWindow.cpp
index 8287214bbcfa..f4eb7aeb793a 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/MainWindow.cpp
+++ b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/MainWindow.cpp
@@ -204,7 +204,7 @@ MainWindow::newPoints(int n)
 }
 
 void MainWindow::help() {
-  QString app = QLibraryInfo::location(QLibraryInfo::BinariesPath)
+  QString app = QLibraryInfo::path(QLibraryInfo::BinariesPath)
     + QDir::separator();
 #if !defined(Q_OS_MAC)
   app += QString("assistant");

From 4addbd6ddc2b9064617c4374efa3e60aa4f46d73 Mon Sep 17 00:00:00 2001
From: "dependabot[bot]" <49699333+dependabot[bot]@users.noreply.github.com>
Date: Mon, 11 Sep 2023 05:35:00 +0000
Subject: [PATCH 0698/1398] Bump actions/checkout from 3 to 4

Bumps [actions/checkout](https://github.com/actions/checkout) from 3 to 4.
- [Release notes](https://github.com/actions/checkout/releases)
- [Changelog](https://github.com/actions/checkout/blob/main/CHANGELOG.md)
- [Commits](https://github.com/actions/checkout/compare/v3...v4)

---
updated-dependencies:
- dependency-name: actions/checkout
  dependency-type: direct:production
  update-type: version-update:semver-major
...

Signed-off-by: dependabot[bot] <support@github.com>
---
 .github/workflows/build_doc.yml              | 2 +-
 .github/workflows/checks.yml                 | 2 +-
 .github/workflows/cmake-all.yml              | 4 ++--
 .github/workflows/delete_doc.yml             | 2 +-
 .github/workflows/demo.yml                   | 8 ++++----
 .github/workflows/list_workflow_last_run.yml | 2 +-
 .github/workflows/reuse.yml                  | 2 +-
 7 files changed, 11 insertions(+), 11 deletions(-)

diff --git a/.github/workflows/build_doc.yml b/.github/workflows/build_doc.yml
index 85158cfc285e..b629c1870cf0 100644
--- a/.github/workflows/build_doc.yml
+++ b/.github/workflows/build_doc.yml
@@ -60,7 +60,7 @@ jobs:
               content: 'rocket'
             })
 
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4
         name: "checkout branch"
         if: steps.get_round.outputs.result != 'stop'
         with:
diff --git a/.github/workflows/checks.yml b/.github/workflows/checks.yml
index 0af6e276e6ed..78d96aa94dbe 100644
--- a/.github/workflows/checks.yml
+++ b/.github/workflows/checks.yml
@@ -11,7 +11,7 @@ jobs:
     runs-on: ubuntu-latest
     
     steps:
-    - uses: actions/checkout@v3
+    - uses: actions/checkout@v4
     - name: install dependencies
       run: |
         .github/install.sh
diff --git a/.github/workflows/cmake-all.yml b/.github/workflows/cmake-all.yml
index d0507b4d4305..b9e7226c62dd 100644
--- a/.github/workflows/cmake-all.yml
+++ b/.github/workflows/cmake-all.yml
@@ -11,7 +11,7 @@ jobs:
     runs-on: ubuntu-latest
 
     steps:
-    - uses: actions/checkout@v3
+    - uses: actions/checkout@v4
     - name: install dependencies
       run: sudo apt-get install -y libboost-dev libboost-program-options-dev libmpfr-dev libeigen3-dev
     - name: configure all
@@ -25,7 +25,7 @@ jobs:
     runs-on: ubuntu-latest
 
     steps:
-    - uses: actions/checkout@v3
+    - uses: actions/checkout@v4
     - name: install dependencies
       run: sudo bash -e .github/install.sh
     - name: configure all
diff --git a/.github/workflows/delete_doc.yml b/.github/workflows/delete_doc.yml
index 38f5ab445ac2..0910e74ef3be 100644
--- a/.github/workflows/delete_doc.yml
+++ b/.github/workflows/delete_doc.yml
@@ -14,7 +14,7 @@ jobs:
     runs-on: ubuntu-latest
 
     steps:
-    - uses: actions/checkout@v3
+    - uses: actions/checkout@v4
     - name: delete directory
       run: |
          set -x
diff --git a/.github/workflows/demo.yml b/.github/workflows/demo.yml
index 123458ebe047..a98dfba56b83 100644
--- a/.github/workflows/demo.yml
+++ b/.github/workflows/demo.yml
@@ -9,7 +9,7 @@ jobs:
   batch_1:
     runs-on: ubuntu-latest
     steps:
-    - uses: actions/checkout@v3
+    - uses: actions/checkout@v4
     - name: install dependencies
       run: .github/install.sh
     - name: run1
@@ -17,7 +17,7 @@ jobs:
   batch_2:
     runs-on: ubuntu-latest
     steps:
-    - uses: actions/checkout@v3
+    - uses: actions/checkout@v4
     - name: install dependencies
       run: .github/install.sh
     - name: run2
@@ -25,7 +25,7 @@ jobs:
   batch_3:
     runs-on: ubuntu-latest
     steps:
-    - uses: actions/checkout@v3
+    - uses: actions/checkout@v4
     - name: install dependencies
       run: .github/install.sh
     - name: run3
@@ -33,7 +33,7 @@ jobs:
   batch_4:
     runs-on: ubuntu-latest
     steps:
-    - uses: actions/checkout@v3
+    - uses: actions/checkout@v4
     - name: install dependencies
       run: .github/install.sh
     - name: run4
diff --git a/.github/workflows/list_workflow_last_run.yml b/.github/workflows/list_workflow_last_run.yml
index 79b1d2c06348..d12b758e62ba 100644
--- a/.github/workflows/list_workflow_last_run.yml
+++ b/.github/workflows/list_workflow_last_run.yml
@@ -12,7 +12,7 @@
         messages: ${{ steps.cat_output.outputs.message }}
       steps:
         - name: checkout
-          uses: actions/checkout@v3
+          uses: actions/checkout@v4
         - name: run script
           run: |
             chmod +x ./Scripts/developer_scripts/list_cgal_workflows_last_run.sh
diff --git a/.github/workflows/reuse.yml b/.github/workflows/reuse.yml
index 8b0bba4260ee..c55ba6df40d9 100644
--- a/.github/workflows/reuse.yml
+++ b/.github/workflows/reuse.yml
@@ -10,7 +10,7 @@ jobs:
   reuse:
     runs-on: ubuntu-latest
     steps:
-    - uses: actions/checkout@v3
+    - uses: actions/checkout@v4
     - name: REUSE version
       uses: fsfe/reuse-action@v2
       with:

From a4136707b24d991c7694018b6d0ac83e7da82757 Mon Sep 17 00:00:00 2001
From: Nicolas Saillant <saillantnicolas01@gmail.com>
Date: Mon, 11 Sep 2023 09:51:06 +0200
Subject: [PATCH 0699/1398] More CMakeLists Updates for QT6

---
 GraphicsView/demo/Generator/CMakeLists.txt    |  2 +-
 .../Periodic_3_triangulation_3/CMakeLists.txt | 24 ++++---------------
 .../demo/Periodic_Lloyd_3/CMakeLists.txt      | 23 ++++--------------
 .../CMakeLists.txt                            |  9 +++----
 .../Polyline_simplification_2/CMakeLists.txt  |  2 --
 .../Triangulation_on_sphere_2/CMakeLists.txt  | 17 +++----------
 6 files changed, 17 insertions(+), 60 deletions(-)

diff --git a/GraphicsView/demo/Generator/CMakeLists.txt b/GraphicsView/demo/Generator/CMakeLists.txt
index cea168a2c9d9..6a3c0d9a4ac0 100644
--- a/GraphicsView/demo/Generator/CMakeLists.txt
+++ b/GraphicsView/demo/Generator/CMakeLists.txt
@@ -5,7 +5,7 @@ project(Generator_Demo)
 
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
diff --git a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
index d2cfa5ea7706..da044276aec7 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
+++ b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
@@ -4,20 +4,11 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Periodic_3_triangulation_3_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 # Find CGAL
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # Find Qt6 itself
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGL OpenGLWidgets Help ToolsTools)
+find_package(Qt6 QUIET COMPONENTS Widgets OpenGL Help ToolsTools)
 
 if(Qt6_FOUND)
   add_definitions(-DQT_NO_KEYWORDS)
@@ -30,11 +21,9 @@ if(CGAL_Qt6_FOUND
    AND Qt6_FOUND
    AND TARGET ${CGAL_QCOLLECTIONGENERATOR_TARGET})
 
-  # UI files (Qt Designer files)
-  qt6_wrap_ui(UI_FILES MainWindow.ui)
-
-  # qrc files (resource files)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Periodic_3_triangulation_3.qrc)
+   set(CMAKE_AUTOMOC ON)
+   set(CMAKE_AUTOUIC ON)
+   set(CMAKE_AUTORCC ON)
 
   # use the Qt MOC preprocessor on classes that derive from QObject
   qt6_generate_moc("Scene.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_Scene.cpp")
@@ -52,7 +41,7 @@ if(CGAL_Qt6_FOUND
       ${CMAKE_CURRENT_BINARY_DIR}/Periodic_3_triangulation_3.qhc)
 
   # The executable itself
-  add_executable(
+  qt_add_executable(
     periodic_3_triangulation_3_demo
     Scene.cpp
     moc_Scene.cpp
@@ -61,9 +50,6 @@ if(CGAL_Qt6_FOUND
     periodic_3_triangulation_3_demo.cpp
     MainWindow.ui
     moc_MainWindow.cpp
-    ${UI_FILES}
-    ${CGAL_Qt6_RESOURCE_FILES}
-    ${CGAL_Qt6_MOC_FILES}
     Periodic_3_triangulation_3.qhc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS periodic_3_triangulation_3_demo)
diff --git a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
index 03a49088d023..038cb121393f 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
+++ b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
@@ -4,14 +4,6 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Periodic_Lloyd_3_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 # Find includes in corresponding build directories
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
 # Instruct CMake to run moc automatically when needed.
@@ -19,7 +11,7 @@ set(CMAKE_AUTOMOC ON)
 
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGL OpenGLWidgets Help ToolsTools)
+find_package(Qt6 QUIET COMPONENTS Widgets OpenGL Help ToolsTools)
 
 set(CGAL_QCOLLECTIONGENERATOR_TARGET Qt6::qhelpgenerator)
 
@@ -29,11 +21,8 @@ if(CGAL_Qt6_FOUND
 
   include_directories(BEFORE ./)
 
-  # ui file, created with Qt Designer
-  qt6_wrap_ui(uis MainWindow.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Periodic_Lloyd_3.qrc)
+   set(CMAKE_AUTOUIC ON)
+   set(CMAKE_AUTORCC ON)
 
   if(DEFINED QT_QCOLLECTIONGENERATOR_EXECUTABLE)
 
@@ -51,15 +40,13 @@ if(CGAL_Qt6_FOUND
       ${CMAKE_CURRENT_BINARY_DIR}/Periodic_Lloyd_3.qhc
     WORKING_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR})
 
-  add_executable(
+  qt_add_executable(
     Periodic_Lloyd_3
     Periodic_Lloyd_3.qhc
     Periodic_Lloyd_3.cpp
     MainWindow.cpp
     Viewer.cpp
-    ${uis}
-    ${CGAL_Qt6_RESOURCE_FILES}
-    ${CGAL_Qt6_MOC_FILES})
+    Periodic_Lloyd_3.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Periodic_Lloyd_3)
 
diff --git a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
index cda66cbac6e7..d57ee2e529bc 100644
--- a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
+++ b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
@@ -20,14 +20,11 @@ if((CGAL_Core_FOUND OR LEDA_FOUND)
 
   include_directories(BEFORE include)
 
-  # ui files, created with Qt Designer
-  qt6_wrap_ui(UIS P4HDT2.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(RESOURCE_FILES Main_resources.qrc)
+   set(CMAKE_AUTOUIC ON)
+   set(CMAKE_AUTORCC ON)
 
   # cpp files
-  add_executable(P4HDT2 P4HDT2.cpp ${RESOURCE_FILES} ${UIS})
+  qt_add_executable(P4HDT2 P4HDT2.cpp P4HDT2.ui)
 
   target_link_libraries(P4HDT2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
   if(TARGET CGAL::CGAL_Core)
diff --git a/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt b/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt
index db32bac7b395..e8ffecc2a3dd 100644
--- a/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt
+++ b/Polyline_simplification_2/demo/Polyline_simplification_2/CMakeLists.txt
@@ -17,8 +17,6 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   set(CMAKE_AUTOUIC ON)
   set(CMAKE_AUTORCC ON)
 
-
-  # The executable itself.
   qt_add_executable(
     Polyline_simplification_2
     Polyline_simplification_2.cpp Polyline_simplification_2.ui Polyline_simplification_2.qrc)
diff --git a/Triangulation_on_sphere_2/demo/Triangulation_on_sphere_2/CMakeLists.txt b/Triangulation_on_sphere_2/demo/Triangulation_on_sphere_2/CMakeLists.txt
index 6499a9d7ffbb..5fc26c32a7f7 100644
--- a/Triangulation_on_sphere_2/demo/Triangulation_on_sphere_2/CMakeLists.txt
+++ b/Triangulation_on_sphere_2/demo/Triangulation_on_sphere_2/CMakeLists.txt
@@ -11,20 +11,12 @@ set(CMAKE_ALLOW_LOOSE_LOOP_CONSTRUCTS true)
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
 # Instruct CMake to run moc automatically when needed.
 set(CMAKE_AUTOMOC ON)
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
 
 # Find CGAL and CGAL Qt6
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # Find Qt6 itself
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets OpenGL)
+find_package(Qt6 QUIET COMPONENTS Widgets OpenGL)
 
 find_package(Eigen3 3.1.0 QUIET) #(requires 3.1.0 or greater)
 include(CGAL_Eigen3_support)
@@ -33,12 +25,9 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND AND TARGET CGAL::Eigen3_support)
   # Include this package's headers first
   include_directories(BEFORE ./ ./include)
 
-  # ui file, created with Qt Designer
-  qt6_wrap_ui( uis Mainwindow.ui )
-
-  #qt6_generate_moc( main.cpp Mainwindow.moc)
+  set(CMAKE_AUTOUIC ON)
 
-  add_executable  ( Triangulation_on_sphere_2_Demo main.cpp Viewer.cpp ${uis})
+  qt_add_executable  ( Triangulation_on_sphere_2_Demo main.cpp Viewer.cpp)
 
   add_to_cached_list( CGAL_EXECUTABLE_TARGETS Triangulation_on_sphere_2_Demo )
 

From 0d7280ea63ac21e406a9608871f4e6e1f0abc5d5 Mon Sep 17 00:00:00 2001
From: Nicolas Saillant <saillantnicolas01@gmail.com>
Date: Mon, 11 Sep 2023 16:10:20 +0200
Subject: [PATCH 0700/1398] CMakeLists updates for Qt6

---
 .../Hyperbolic_triangulation_2/CMakeLists.txt | 20 ++++--------
 .../demo/Linear_cell_complex/CMakeLists.txt   | 32 +++++--------------
 Mesh_2/demo/Mesh_2/CMakeLists.txt             |  5 ---
 .../Periodic_3_triangulation_3/CMakeLists.txt |  2 +-
 .../demo/Periodic_Lloyd_3/CMakeLists.txt      |  3 +-
 .../CMakeLists.txt                            |  2 +-
 .../demo/Triangulation_3/CMakeLists.txt       |  2 +-
 7 files changed, 19 insertions(+), 47 deletions(-)

diff --git a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
index 0c4ea157c891..9d46e7227294 100644
--- a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
+++ b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
@@ -7,33 +7,27 @@ set(CMAKE_INCLUDE_CURRENT_DIR ON)
 # Instruct CMake to run moc automatically when needed.
 set(CMAKE_AUTOMOC ON)
 
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Core Qt6)
 find_package(LEDA QUIET)
 
 # Find Qt6 itself
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND
    AND Qt6_FOUND
    AND (CGAL_Core_FOUND OR LEDA_FOUND))
-  # ui files, created with Qt Designer
-  qt6_wrap_ui(UIS HDT2.ui)
 
-  qt6_add_resources(RESOURCE_FILES resources/Delaunay_triangulation_2.qrc)
+   set(CMAKE_AUTOUIC ON)
+   set(CMAKE_AUTORCC ON)
 
-  # cpp files
-  add_executable ( HDT2 HDT2.cpp ${CGAL_Qt6_RESOURCE_FILES} ${RESOURCE_FILES} ${UIS})
+  qt_add_executable ( HDT2 HDT2.cpp)
   target_include_directories(HDT2 PRIVATE ./ ./include)
   add_to_cached_list( CGAL_EXECUTABLE_TARGETS HDT2 )
-  target_link_libraries ( HDT2 CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
+  target_link_libraries ( HDT2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
   if(CGAL_Core_FOUND)
-    target_link_libraries ( HDT2 CGAL::CGAL_Core)
+    target_link_libraries ( HDT2 PRIVATE CGAL::CGAL_Core)
   else()
-    target_link_libraries ( HDT2 ${LEDA_LIBRARIES})
+    target_link_libraries ( HDT2 PRIVATE ${LEDA_LIBRARIES})
   endif()
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
diff --git a/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt b/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt
index c001d50f23ff..b152c55bd9da 100644
--- a/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt
+++ b/Linear_cell_complex/demo/Linear_cell_complex/CMakeLists.txt
@@ -5,18 +5,8 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Linear_cell_complex_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 # Find includes in corresponding build directories
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
-# Instruct CMake to run moc automatically when needed.
-set(CMAKE_AUTOMOC ON)
 
 ## To add expensive tests
 # add_definitions("-DCGAL_CHECK_EXPENSIVE")
@@ -42,7 +32,7 @@ add_definitions(-DCMAP_WITH_INDEX) # to use cc with index (handle otherwise)
 ##################
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
-find_package(Qt6 COMPONENTS Widgets OpenGL OpenGLWidgets)
+find_package(Qt6 COMPONENTS Widgets OpenGL)
 
 if(NOT CGAL_Qt6_FOUND OR NOT Qt6_FOUND)
 
@@ -51,17 +41,14 @@ if(NOT CGAL_Qt6_FOUND OR NOT Qt6_FOUND)
 else()
 
   add_definitions(-DCGAL_USE_BASIC_VIEWER -DQT_NO_KEYWORDS)
+  set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  # ui file, created with Qt Designer
-  qt6_wrap_ui(uis MainWindow.ui CreateMesh.ui CreateMenger.ui
-              CreateSierpinskiCarpet.ui CreateSierpinskiTriangle.ui)
-
-  # qrc files (resources files, that contain icons, at least)
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES ./Linear_cell_complex_3.qrc)
-
-  add_executable(
+  qt_add_executable(
     Linear_cell_complex_3_demo
     Linear_cell_complex_3_demo.cpp
+    Linear_cell_complex_3.qrc
     MainWindow.cpp
     Viewer.cpp
     Linear_cell_complex_3_subdivision.cpp
@@ -69,15 +56,12 @@ else()
     typedefs.h
     import_moka.h
     MainWindow.h
-    Viewer.h
-    ${uis}
-    ${CGAL_Qt6_RESOURCE_FILES}
-    ${CGAL_Qt6_MOC_FILES})
+    Viewer.h)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Linear_cell_complex_3_demo)
 
   target_link_libraries(Linear_cell_complex_3_demo
-                        PUBLIC CGAL::CGAL CGAL::CGAL_Qt6 Qt6::OpenGLWidgets Qt6::OpenGL)
+                        PUBLIC CGAL::CGAL CGAL::CGAL_Qt6 Qt6::OpenGL)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Linear_cell_complex_3_demo)
diff --git a/Mesh_2/demo/Mesh_2/CMakeLists.txt b/Mesh_2/demo/Mesh_2/CMakeLists.txt
index 6619032f709f..5087c477a12d 100644
--- a/Mesh_2/demo/Mesh_2/CMakeLists.txt
+++ b/Mesh_2/demo/Mesh_2/CMakeLists.txt
@@ -4,11 +4,6 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Mesh_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
 find_package(CGAL REQUIRED)
 
 include(${CGAL_USE_FILE})
diff --git a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
index da044276aec7..22c26c48986b 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
+++ b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
@@ -55,7 +55,7 @@ if(CGAL_Qt6_FOUND
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS periodic_3_triangulation_3_demo)
 
   target_link_libraries(periodic_3_triangulation_3_demo
-                        PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::OpenGLWidgets Qt6::OpenGL)
+                        PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::OpenGL)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(periodic_3_triangulation_3_demo)
diff --git a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
index 038cb121393f..cb944392edf4 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
+++ b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
@@ -50,8 +50,7 @@ if(CGAL_Qt6_FOUND
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Periodic_Lloyd_3)
 
-  target_link_libraries(Periodic_Lloyd_3 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
-                                                 Qt6::OpenGLWidgets Qt6::OpenGL)
+  target_link_libraries(Periodic_Lloyd_3 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::OpenGL)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Periodic_Lloyd_3)
diff --git a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
index d57ee2e529bc..d3ba88394b2f 100644
--- a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
+++ b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
@@ -13,7 +13,7 @@ include(${CGAL_USE_FILE})
 
 find_package(LEDA QUIET)
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 if((CGAL_Core_FOUND OR LEDA_FOUND)
    AND Qt6_FOUND
    AND CGAL_Qt6_FOUND)
diff --git a/Triangulation_3/demo/Triangulation_3/CMakeLists.txt b/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
index 1058b455a761..ab246bc44268 100644
--- a/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
+++ b/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
@@ -57,7 +57,7 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS T3_demo)
 
   target_link_libraries(T3_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt6)
-  target_link_libraries(T3_demo PRIVATE Qt6::OpenGLWidgets Qt6::OpenGL)
+  target_link_libraries(T3_demo PRIVATE Qt6::OpenGL)
   if(TARGET CGAL::TBB_support)
     target_link_libraries(T3_demo PUBLIC CGAL::TBB_support)
   endif()

From b77659beb202fc494a5b1c18c28218be1b3429d5 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Mon, 11 Sep 2023 17:21:37 +0200
Subject: [PATCH 0701/1398] Added support for vtk images (vti format)

---
 .../Polyhedron/Plugins/Mesh_3/CMakeLists.txt  |  4 ++--
 .../Plugins/Mesh_3/Io_image_plugin.cpp        | 23 +++++++++++++++++--
 2 files changed, 23 insertions(+), 4 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
index 2cc3f58854f2..706ce2d36439 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
@@ -34,14 +34,14 @@ if(ITK_FOUND)
   target_link_libraries(mesh_3_plugin PUBLIC CGAL::ITK_support)
 endif(ITK_FOUND)
 
-find_package(VTK QUIET COMPONENTS vtkImagingGeneral vtkIOImage NO_MODULE)
+find_package(VTK QUIET COMPONENTS vtkImagingGeneral vtkIOImage vtkIOXML NO_MODULE)
 if(VTK_FOUND)
   if(VTK_USE_FILE)
     include(${VTK_USE_FILE})
   endif()
   if("${VTK_VERSION_MAJOR}" GREATER "5" OR VTK_VERSION VERSION_GREATER 5)
     if(TARGET VTK::IOImage)
-      set(VTK_LIBRARIES VTK::IOImage VTK::ImagingGeneral)
+      set(VTK_LIBRARIES VTK::IOImage VTK::ImagingGeneral VTK::IOXML)
     endif()
     if(NOT VTK_LIBRARIES)
       message(STATUS "NOTICE: DICOM files (.dcm) require the VTK libraries, and will not be readable.")
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
index 80eedf998fa9..32ec637c9210 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
@@ -56,6 +56,7 @@
 #include <vtkNew.h>
 #include <vtkStringArray.h>
 #include <vtkImageData.h>
+#include <vtkXMLImageDataReader.h>
 #include <vtkDICOMImageReader.h>
 #include <vtkBMPReader.h>
 #include <vtkNIFTIImageReader.h>
@@ -1089,6 +1090,7 @@ QString Io_image_plugin::nameFilters() const
   return QString("Inrimage files (*.inr *.inr.gz) ;; "
                  "Analyze files (*.hdr *.img *.img.gz) ;; "
                  "Stanford Exploration Project files (*.H *.HH) ;; "
+                 "VTK image files (*.vti) ;; "
                  "NRRD image files (*.nrrd) ;; "
                  "NIFTI image files (*.nii *.nii.gz)");
 }
@@ -1128,8 +1130,25 @@ Io_image_plugin::load(QFileInfo fileinfo, bool& ok, bool add_to_scene)
   QApplication::restoreOverrideCursor();
   Image* image = new Image;
 
+  // read a vti file
+  if(fileinfo.suffix() == "vti")
+  {
+#ifdef CGAL_USE_VTK
+    vtkNew<vtkXMLImageDataReader> reader;
+    reader->SetFileName(fileinfo.filePath().toUtf8());
+    reader->Update();
+    auto vtk_image = reader->GetOutput();
+    vtk_image->Print(std::cerr);
+    *image = CGAL::IO::read_vtk_image_data(vtk_image); // copy the image data
+#else
+    CGAL::Three::Three::warning("VTK is required to read VTI files");
+    delete image;
+    return QList<Scene_item*>();
+#endif
+  }
+
   // read a nrrd file
-  if(fileinfo.suffix() == "nrrd")
+  else if(fileinfo.suffix() == "nrrd")
   {
 #ifdef CGAL_USE_VTK
     vtkNew<vtkNrrdReader> reader;
@@ -1146,7 +1165,7 @@ Io_image_plugin::load(QFileInfo fileinfo, bool& ok, bool add_to_scene)
   }
 
   // read a NIFTI file
-  if(fileinfo.suffix() == "nii"
+  else if(fileinfo.suffix() == "nii"
     || (   fileinfo.suffix() == "gz"
         && fileinfo.fileName().endsWith(QString(".nii.gz"), Qt::CaseInsensitive)))
   {

From 303282aec6841421ea9d623670d89f1906866fa5 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Mon, 11 Sep 2023 17:33:34 +0200
Subject: [PATCH 0702/1398] fix "Save as..." in CGAL Lab

---
 Polyhedron/demo/Polyhedron/MainWindow.cpp | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index 5829ffb5e22c..1714b547af9e 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -1948,10 +1948,10 @@ void MainWindow::on_actionSaveAs_triggered()
           return;
     }
 
-    Q_FOREACH(QString string, filters)
+    for(QString string: filters)
     {
       QStringList sl = string.split(";;");
-      Q_FOREACH(QString s, sl){
+      for(QString s: sl){
         QRegularExpressionMatch match = extensions.match(s);
         if(match.hasMatch())
           filter_exts.append(match.capturedTexts());
@@ -1987,9 +1987,9 @@ void MainWindow::on_actionSaveAs_triggered()
     if(filename.isEmpty())
       return;
     last_saved_dir = QFileInfo(filename).absoluteDir().path();
-    // AF  extensions.indexIn(sf.split(";;").first());
+    auto match = extensions.match(sf.split(";;").first());
     QString filter_ext, filename_ext;
-    // AF filter_ext = extensions.cap().split(" ").first();// in case of syntax like (*.a *.b)
+    filter_ext = match.captured().split(" ").first();// in case of syntax like (*.a *.b)
 
     filter_ext.remove(")");
     filter_ext.remove("(");

From c276b54e94594a876183a0f83260b21659616401 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Mon, 11 Sep 2023 17:33:54 +0200
Subject: [PATCH 0703/1398] Remove one occurence of "qt5"

---
 .github/workflows/cmake-all.yml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/.github/workflows/cmake-all.yml b/.github/workflows/cmake-all.yml
index d0507b4d4305..77f607ab8849 100644
--- a/.github/workflows/cmake-all.yml
+++ b/.github/workflows/cmake-all.yml
@@ -20,7 +20,7 @@ jobs:
         mkdir build && cd build && CXX=clang++ cmake -DWITH_examples=ON -DWITH_tests=ON -DWITH_demos=ON -DBUILD_TESTING=ON ..
         ctest -L Installation -j $(getconf _NPROCESSORS_ONLN)
 
-  cmake-testsuite-with-qt5:
+  cmake-testsuite-with-qt:
 
     runs-on: ubuntu-latest
 

From 873c3b26cfc97b19909fcdda7b38e7d1685ab6ba Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Mon, 11 Sep 2023 17:46:27 +0200
Subject: [PATCH 0704/1398] remove a few occurrences of "qt5"

There are still a lot!
---
 AABB_tree/demo/AABB_tree/AABB_demo.cpp                        | 2 +-
 Alpha_shapes_3/demo/Alpha_shapes_3/Alpha_shape_3.cpp          | 4 ++--
 .../demo/Arrangement_on_surface_2/arrangement_2.cpp           | 2 +-
 Documentation/doc/Documentation/Third_party.txt               | 4 ++--
 Documentation/doc/Documentation/Usage.txt                     | 4 ++--
 .../doc/Documentation/advanced/Configuration_variables.txt    | 4 ++--
 Documentation/doc/Documentation/advanced/Installation.txt     | 2 +-
 Documentation/doc/Documentation/windows.txt                   | 2 +-
 Documentation/doc/resources/1.8.13/BaseDoxyfile.in            | 2 +-
 Documentation/doc/resources/1.9.6/BaseDoxyfile.in             | 2 +-
 GraphicsView/demo/Alpha_shapes_2/Alpha_shapes_2.cpp           | 2 +-
 GraphicsView/demo/Apollonius_graph_2/Apollonius_graph_2.cpp   | 2 +-
 GraphicsView/demo/Bounding_volumes/Bounding_volumes.cpp       | 2 +-
 GraphicsView/demo/Circular_kernel_2/Circular_kernel_2.cpp     | 2 +-
 GraphicsView/demo/Generator/Generator_2.cpp                   | 2 +-
 .../demo/L1_Voronoi_diagram_2/L1_voronoi_diagram_2.cpp        | 2 +-
 .../demo/Largest_empty_rect_2/Largest_empty_rectangle_2.cpp   | 2 +-
 .../Periodic_2_Delaunay_triangulation_2.cpp                   | 2 +-
 GraphicsView/demo/Polygon/Polygon_2.cpp                       | 2 +-
 .../demo/Segment_Delaunay_graph_2/Segment_voronoi_2.cpp       | 2 +-
 GraphicsView/demo/Snap_rounding_2/Snap_rounding_2.cpp         | 2 +-
 GraphicsView/demo/Spatial_searching_2/Spatial_searching_2.cpp | 2 +-
 GraphicsView/demo/Stream_lines_2/Stream_lines_2.cpp           | 2 +-
 .../Triangulation_2/Constrained_Delaunay_triangulation_2.cpp  | 2 +-
 .../demo/Triangulation_2/Delaunay_triangulation_2.cpp         | 2 +-
 GraphicsView/demo/Triangulation_2/Regular_triangulation_2.cpp | 2 +-
 .../demo/Hyperbolic_triangulation_2/HDT2.cpp                  | 2 +-
 .../demo/Periodic_Lloyd_3/Periodic_Lloyd_3.cpp                | 2 +-
 Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp                | 2 +-
 29 files changed, 33 insertions(+), 33 deletions(-)

diff --git a/AABB_tree/demo/AABB_tree/AABB_demo.cpp b/AABB_tree/demo/AABB_tree/AABB_demo.cpp
index 9727327004f0..881fd8710dbf 100644
--- a/AABB_tree/demo/AABB_tree/AABB_demo.cpp
+++ b/AABB_tree/demo/AABB_tree/AABB_demo.cpp
@@ -30,7 +30,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("INRIA");
   app.setApplicationName("AABB tree demo");
 
-  // Import resources from libCGALQt (Qt5).
+  // Import resources from libCGALQt (Qt6).
   CGAL_QT_INIT_RESOURCES;
 
   MainWindow mainWindow;
diff --git a/Alpha_shapes_3/demo/Alpha_shapes_3/Alpha_shape_3.cpp b/Alpha_shapes_3/demo/Alpha_shapes_3/Alpha_shape_3.cpp
index 784ee1af57ff..3ec08a1113ec 100644
--- a/Alpha_shapes_3/demo/Alpha_shapes_3/Alpha_shape_3.cpp
+++ b/Alpha_shapes_3/demo/Alpha_shapes_3/Alpha_shape_3.cpp
@@ -16,8 +16,8 @@ int main(int argc, char** argv)
   application.setOrganizationName("GeometryFactory");
   application.setApplicationName("Alpha Shape Reconstruction");
 
-  // Import resources from libCGALQt (Qt5).
-  // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
+  // Import resources from libCGAL_Qt6
+  // See https://doc.qt.io/qt-6/qtresource-proxy.html#Q_INIT_RESOURCE
 
   CGAL_QT_INIT_RESOURCES;
   Q_INIT_RESOURCE(Alpha_shape_3);
diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/arrangement_2.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/arrangement_2.cpp
index 35d589585d8d..f0a5ccfe47fa 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/arrangement_2.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/arrangement_2.cpp
@@ -19,7 +19,7 @@ int main(int argc, char* argv[])
   QCoreApplication::setOrganizationName("CGAL");
   QCoreApplication::setApplicationName("2D Arrangements Demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   CGAL_QT_INIT_RESOURCES;
 
   ArrangementDemoWindow demoWindow;
diff --git a/Documentation/doc/Documentation/Third_party.txt b/Documentation/doc/Documentation/Third_party.txt
index d55d10c2cbef..569599ae0fdf 100644
--- a/Documentation/doc/Documentation/Third_party.txt
+++ b/Documentation/doc/Documentation/Third_party.txt
@@ -107,8 +107,8 @@ the location of third-party software during configuration.
 
 Qt is a cross-platform application and UI framework.
 
-The component libCGAL_Qt5 is essential to run the \cgal demos and basic viewers.
-It requires \qt5 installed on your system.
+The component libCGAL_Qt6 is essential to run the \cgal demos and basic viewers.
+It requires \qt6 installed on your system.
 In case \qt is not yet installed on your system, you can download
 it from <A HREF="https://www.qt-project.org/">`https://www.qt-project.org/`</A>.
 
diff --git a/Documentation/doc/Documentation/Usage.txt b/Documentation/doc/Documentation/Usage.txt
index 1c02423cf496..046f3d6da384 100644
--- a/Documentation/doc/Documentation/Usage.txt
+++ b/Documentation/doc/Documentation/Usage.txt
@@ -171,9 +171,9 @@ In order to link against Qt5, you need to run:
 
     brew link qt@5
 
-After that, you will have to specify the Qt5_DIR by hand to cmake, using something like
+After that, you will have to specify the Qt6_DIR by hand to cmake, using something like
 
-    -DQt5_DIR=/usr/local/opt/qt5/lib/cmake/Qt5
+    -DQt6_DIR=/usr/local/opt/qt6/lib/cmake/Qt6
 
 where `/usr/local/` is actually your current brew installation directory. Check this directory
 to be sure where the Qt5 is placed on your machine.
diff --git a/Documentation/doc/Documentation/advanced/Configuration_variables.txt b/Documentation/doc/Documentation/advanced/Configuration_variables.txt
index 8434b496014b..7cedae4344ac 100644
--- a/Documentation/doc/Documentation/advanced/Configuration_variables.txt
+++ b/Documentation/doc/Documentation/advanced/Configuration_variables.txt
@@ -27,7 +27,7 @@ configure and/or build. Their values can be ON or OFF.
 | `WITH_examples`     | OFF   |
 | `WITH_demos`        | OFF   |
 | `WITH_CGAL_Core`    | ON    |
-| `WITH_CGAL_Qt5`     | ON    |
+| `WITH_CGAL_Qt6`     | ON    |
 | `WITH_CGAL_ImageIO` | ON    |
 
 \subsection installation_flags Compiler and Linker Flags
@@ -181,7 +181,7 @@ Under Linux, the \gmpxx is also searched for, and you may specify the following
 \subsection installation_qt5 Qt5 Library
 
 You must set the cmake or environment variable `Qt5_DIR` to point to the path
-to the directory containing the file `Qt5Config.cmake` created by your \qt5 installation. If you are
+to the directory containing the file `Qt6Config.cmake` created by your \qt6 installation. If you are
 using the open source edition it should be `<path>/qt-everywhere-opensource-src-<version>/qtbase/lib/cmake/Qt5`.
 
 \subsection installation_leda LEDA Library
diff --git a/Documentation/doc/Documentation/advanced/Installation.txt b/Documentation/doc/Documentation/advanced/Installation.txt
index 933565ad78fc..7bf4f0f98748 100644
--- a/Documentation/doc/Documentation/advanced/Installation.txt
+++ b/Documentation/doc/Documentation/advanced/Installation.txt
@@ -61,7 +61,7 @@ See the page
 | :-------- | :------------- | :------------ | :----------- |
 |   \cgal   | none           | Main library  | \gmp, \mpfr, \boost (headers) |
 | `CGAL_ImageIO` | `WITH_CGAL_ImageIO` | Utilities to read and write image files  | \zlib, \vtk (optional) |
-| `CGAL_Qt5`  | `WITH_CGAL_Qt5` | `QGraphicsView` support for \qt5-based demos | \qt5 |
+| `CGAL_Qt6`  | `WITH_CGAL_Qt6` | `QGraphicsView` support for \qt6-based demos | \qt6 |
 
 \subsection installation_examples CGAL Examples and Demos
 
diff --git a/Documentation/doc/Documentation/windows.txt b/Documentation/doc/Documentation/windows.txt
index d40059d76cd3..8b4674530077 100644
--- a/Documentation/doc/Documentation/windows.txt
+++ b/Documentation/doc/Documentation/windows.txt
@@ -114,7 +114,7 @@ not depend on `Qt`. However, one of the examples in the Triangulation_2 package
 for visualization purposes. If you already have `Qt` installed, you can simply fill in the requested
 CMake variables and paths. Otherwise, you can also install it using `vcpkg`:
 
-    C:\dev\vcpkg> .\vcpkg.exe install qt5
+    C:\dev\vcpkg> .\vcpkg.exe install qt6
 
 Remember to specify `--triplet` or the related environment variable in case you target 64-bit applications.
 
diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index 7f347c1529c0..137dd3e63d87 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -78,7 +78,7 @@ ALIASES                = "cgal=%CGAL" \
                          "gnu=GNU" \
                          "ms=MS" \
                          "qt=Qt" \
-                         "qt5=Qt5" \
+                         "qt6=Qt6" \
                          "eigen=Eigen" \
                          "opengr=OpenGR" \
                          "libpointmatcher=libpointmatcher" \
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index f5d4533ce70e..3548e27a271c 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -87,7 +87,7 @@ ALIASES                = "cgal=%CGAL" \
                          "gnu=GNU" \
                          "ms=MS" \
                          "qt=Qt" \
-                         "qt5=Qt5" \
+                         "qt6=Qt6" \
                          "eigen=Eigen" \
                          "opengr=OpenGR" \
                          "libpointmatcher=libpointmatcher" \
diff --git a/GraphicsView/demo/Alpha_shapes_2/Alpha_shapes_2.cpp b/GraphicsView/demo/Alpha_shapes_2/Alpha_shapes_2.cpp
index d81a7cb7c49c..31222218e48f 100644
--- a/GraphicsView/demo/Alpha_shapes_2/Alpha_shapes_2.cpp
+++ b/GraphicsView/demo/Alpha_shapes_2/Alpha_shapes_2.cpp
@@ -311,7 +311,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Alpha_shape_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   CGAL_QT_INIT_RESOURCES;
 
   MainWindow mainWindow;
diff --git a/GraphicsView/demo/Apollonius_graph_2/Apollonius_graph_2.cpp b/GraphicsView/demo/Apollonius_graph_2/Apollonius_graph_2.cpp
index 31c3c828d765..7d42f4bddf10 100644
--- a/GraphicsView/demo/Apollonius_graph_2/Apollonius_graph_2.cpp
+++ b/GraphicsView/demo/Apollonius_graph_2/Apollonius_graph_2.cpp
@@ -313,7 +313,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Apollonius_graph_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
   CGAL_QT_INIT_RESOURCES;
   Q_INIT_RESOURCE(Apollonius_graph_2);
diff --git a/GraphicsView/demo/Bounding_volumes/Bounding_volumes.cpp b/GraphicsView/demo/Bounding_volumes/Bounding_volumes.cpp
index c224faf6e663..7b6071d93abf 100644
--- a/GraphicsView/demo/Bounding_volumes/Bounding_volumes.cpp
+++ b/GraphicsView/demo/Bounding_volumes/Bounding_volumes.cpp
@@ -573,7 +573,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Bounding_volumes demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
   CGAL_QT_INIT_RESOURCES;
 
diff --git a/GraphicsView/demo/Circular_kernel_2/Circular_kernel_2.cpp b/GraphicsView/demo/Circular_kernel_2/Circular_kernel_2.cpp
index e593af52c147..53555763d100 100644
--- a/GraphicsView/demo/Circular_kernel_2/Circular_kernel_2.cpp
+++ b/GraphicsView/demo/Circular_kernel_2/Circular_kernel_2.cpp
@@ -336,7 +336,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Circular_kernel_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   CGAL_QT_INIT_RESOURCES;
 
   MainWindow mainWindow;
diff --git a/GraphicsView/demo/Generator/Generator_2.cpp b/GraphicsView/demo/Generator/Generator_2.cpp
index 0072354e66c3..a10c3566a108 100644
--- a/GraphicsView/demo/Generator/Generator_2.cpp
+++ b/GraphicsView/demo/Generator/Generator_2.cpp
@@ -338,7 +338,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Generator_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
   CGAL_QT_INIT_RESOURCES;
   Q_INIT_RESOURCE(Generator_2);
diff --git a/GraphicsView/demo/L1_Voronoi_diagram_2/L1_voronoi_diagram_2.cpp b/GraphicsView/demo/L1_Voronoi_diagram_2/L1_voronoi_diagram_2.cpp
index 726a509b885f..57aaab80f01f 100644
--- a/GraphicsView/demo/L1_Voronoi_diagram_2/L1_voronoi_diagram_2.cpp
+++ b/GraphicsView/demo/L1_Voronoi_diagram_2/L1_voronoi_diagram_2.cpp
@@ -395,7 +395,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("L1 Voronoi diagram_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   CGAL_QT_INIT_RESOURCES;
 
   MainWindow mainWindow;
diff --git a/GraphicsView/demo/Largest_empty_rect_2/Largest_empty_rectangle_2.cpp b/GraphicsView/demo/Largest_empty_rect_2/Largest_empty_rectangle_2.cpp
index 67e4f336075d..20e13248017e 100644
--- a/GraphicsView/demo/Largest_empty_rect_2/Largest_empty_rectangle_2.cpp
+++ b/GraphicsView/demo/Largest_empty_rect_2/Largest_empty_rectangle_2.cpp
@@ -327,7 +327,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Largest_empty_rectangle_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
   CGAL_QT_INIT_RESOURCES;
   Q_INIT_RESOURCE(Largest_empty_rectangle_2);
diff --git a/GraphicsView/demo/Periodic_2_triangulation_2/Periodic_2_Delaunay_triangulation_2.cpp b/GraphicsView/demo/Periodic_2_triangulation_2/Periodic_2_Delaunay_triangulation_2.cpp
index 00beec2bc227..b878c6c69dd7 100644
--- a/GraphicsView/demo/Periodic_2_triangulation_2/Periodic_2_Delaunay_triangulation_2.cpp
+++ b/GraphicsView/demo/Periodic_2_triangulation_2/Periodic_2_Delaunay_triangulation_2.cpp
@@ -476,7 +476,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("Nico Kruithof");
   app.setApplicationName("Periodic_2_Delaunay_triangulation_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
   CGAL_QT_INIT_RESOURCES;
 
diff --git a/GraphicsView/demo/Polygon/Polygon_2.cpp b/GraphicsView/demo/Polygon/Polygon_2.cpp
index 67c16d0b3dca..dc9fdf66275a 100644
--- a/GraphicsView/demo/Polygon/Polygon_2.cpp
+++ b/GraphicsView/demo/Polygon/Polygon_2.cpp
@@ -596,7 +596,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Polygon_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
   CGAL_QT_INIT_RESOURCES;
   Q_INIT_RESOURCE(Polygon_2);
diff --git a/GraphicsView/demo/Segment_Delaunay_graph_2/Segment_voronoi_2.cpp b/GraphicsView/demo/Segment_Delaunay_graph_2/Segment_voronoi_2.cpp
index 07845c04bc31..de2e7b18cee9 100644
--- a/GraphicsView/demo/Segment_Delaunay_graph_2/Segment_voronoi_2.cpp
+++ b/GraphicsView/demo/Segment_Delaunay_graph_2/Segment_voronoi_2.cpp
@@ -426,7 +426,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Segment Voronoi 2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   CGAL_QT_INIT_RESOURCES;
 
   MainWindow mainWindow;
diff --git a/GraphicsView/demo/Snap_rounding_2/Snap_rounding_2.cpp b/GraphicsView/demo/Snap_rounding_2/Snap_rounding_2.cpp
index 8ab184cfdce2..9af19ac62f11 100644
--- a/GraphicsView/demo/Snap_rounding_2/Snap_rounding_2.cpp
+++ b/GraphicsView/demo/Snap_rounding_2/Snap_rounding_2.cpp
@@ -341,7 +341,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Snap_rounding_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
   CGAL_QT_INIT_RESOURCES;
   Q_INIT_RESOURCE(Snap_rounding_2);
diff --git a/GraphicsView/demo/Spatial_searching_2/Spatial_searching_2.cpp b/GraphicsView/demo/Spatial_searching_2/Spatial_searching_2.cpp
index d25a215c8cc0..0c982df5ccb9 100644
--- a/GraphicsView/demo/Spatial_searching_2/Spatial_searching_2.cpp
+++ b/GraphicsView/demo/Spatial_searching_2/Spatial_searching_2.cpp
@@ -302,7 +302,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Spatial_searching_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
   CGAL_QT_INIT_RESOURCES;
   Q_INIT_RESOURCE(Spatial_searching_2);
diff --git a/GraphicsView/demo/Stream_lines_2/Stream_lines_2.cpp b/GraphicsView/demo/Stream_lines_2/Stream_lines_2.cpp
index 37e2138ece54..7dd2b13661b7 100644
--- a/GraphicsView/demo/Stream_lines_2/Stream_lines_2.cpp
+++ b/GraphicsView/demo/Stream_lines_2/Stream_lines_2.cpp
@@ -279,7 +279,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Stream_lines_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
   CGAL_QT_INIT_RESOURCES;
   Q_INIT_RESOURCE(Stream_lines_2);
diff --git a/GraphicsView/demo/Triangulation_2/Constrained_Delaunay_triangulation_2.cpp b/GraphicsView/demo/Triangulation_2/Constrained_Delaunay_triangulation_2.cpp
index 5da75ee41da8..990a8952cad2 100644
--- a/GraphicsView/demo/Triangulation_2/Constrained_Delaunay_triangulation_2.cpp
+++ b/GraphicsView/demo/Triangulation_2/Constrained_Delaunay_triangulation_2.cpp
@@ -923,7 +923,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Constrained_Delaunay_triangulation_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   CGAL_QT_INIT_RESOURCES;
 
   MainWindow mainWindow;
diff --git a/GraphicsView/demo/Triangulation_2/Delaunay_triangulation_2.cpp b/GraphicsView/demo/Triangulation_2/Delaunay_triangulation_2.cpp
index e00d9fa260fd..55a11c0171bf 100644
--- a/GraphicsView/demo/Triangulation_2/Delaunay_triangulation_2.cpp
+++ b/GraphicsView/demo/Triangulation_2/Delaunay_triangulation_2.cpp
@@ -412,7 +412,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Delaunay_triangulation_2 demo");
 
-  // Import resources from libCGAL (QT5).
+  // Import resources from libCGAL (Qt6).
   CGAL_QT_INIT_RESOURCES;
 
   MainWindow mainWindow;
diff --git a/GraphicsView/demo/Triangulation_2/Regular_triangulation_2.cpp b/GraphicsView/demo/Triangulation_2/Regular_triangulation_2.cpp
index 6df0dd319011..07a3ed67ad0a 100644
--- a/GraphicsView/demo/Triangulation_2/Regular_triangulation_2.cpp
+++ b/GraphicsView/demo/Triangulation_2/Regular_triangulation_2.cpp
@@ -334,7 +334,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Regular_triangulation_2 demo");
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   CGAL_QT_INIT_RESOURCES;
 
   MainWindow mainWindow;
diff --git a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/HDT2.cpp b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/HDT2.cpp
index bd76416342bb..9dd9c45c7f95 100644
--- a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/HDT2.cpp
+++ b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/HDT2.cpp
@@ -411,7 +411,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Hyperbolic_Delaunay_triangulation_2 demo");
 
-  // Import resources from libCGAL (QT5).
+  // Import resources from libCGAL (Qt6).
   CGAL_QT_INIT_RESOURCES;
 
   MainWindow mainWindow;
diff --git a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/Periodic_Lloyd_3.cpp b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/Periodic_Lloyd_3.cpp
index ae0074e0bcc8..0f8f1dd27b93 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/Periodic_Lloyd_3.cpp
+++ b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/Periodic_Lloyd_3.cpp
@@ -13,7 +13,7 @@ int main(int argc, char** argv)
   application.setOrganizationName("INRIA");
   application.setApplicationName("3D Periodic Lloyd");
 
-  // Import resources from libCGAL (QT5).
+  // Import resources from libCGAL (Qt6).
   // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
   CGAL_QT_INIT_RESOURCES;
   Q_INIT_RESOURCE(Periodic_Lloyd_3);
diff --git a/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp b/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
index 7b6e5225dfe3..05f30fa3da64 100644
--- a/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
+++ b/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
@@ -54,7 +54,7 @@ Polyhedron_demo::Polyhedron_demo(int& argc, char **argv,
   std::cout.precision(17);
   std::clog.precision(17);
 
-  // Import resources from libCGAL (Qt5).
+  // Import resources from libCGAL (Qt6).
   CGAL_QT_INIT_RESOURCES;
 
   this->setOrganizationDomain("geometryfactory.com");

From 7d79636f0bec6a5e703f3a9c81c9052d6e5ed0cf Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Mon, 11 Sep 2023 17:48:24 +0200
Subject: [PATCH 0705/1398] Removed unnecessary lines

---
 Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp | 6 +-----
 1 file changed, 1 insertion(+), 5 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
index 837d859aa973..91e88fb6ae22 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
@@ -904,13 +904,9 @@ Scene_triangulation_3_item_priv::compute_color_map(const QColor& c)
     colors[*it] = QColor::fromHsvF(hue, c.saturationF(), patch_hsv_value);
   }
 
-  const size_type nb_visible_patch_indices = visible_surface_patch_to_subdomain.size();
-  i = 0;
   for (std::unordered_map<int, int>::iterator it = visible_surface_patch_to_subdomain.begin(),
-       end = visible_surface_patch_to_subdomain.end(); it != end; ++it, i += 1.)
+       end = visible_surface_patch_to_subdomain.end(); it != end; ++it)
   {
-    double hue = c.hueF() + 1. / double(nb_patch_indices) * i;
-    if (hue > 1) { hue -= 1.; }
     colors[it->first] = colors_subdomains[it->second];
   }
 }

From 25c82a2ea29c9c790b4edaa49f2390cf25928df1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Tue, 22 Aug 2023 23:28:56 +0200
Subject: [PATCH 0706/1398] UpdateSizing_field_base docs

Co-authored-by: Andreas Fabri <andreas.fabri@geometryfactory.com>
---
 .../internal/Isotropic_remeshing/Sizing_field_base.h            | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
index 55cdfceff24e..580601bbaecb 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
@@ -31,7 +31,7 @@ namespace Polygon_mesh_processing
 *
 * \cgalModels PMPSizingField
 *
-* \sa `isotropic_remeshing`
+* \sa `isotropic_remeshing()`
 * \sa `Uniform_sizing_field`
 * \sa `Adaptive_sizing_field`
 *

From 04e3be8b8c9cac56c1a36e771bc49843e3696aa8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Tue, 22 Aug 2023 23:29:28 +0200
Subject: [PATCH 0707/1398] Update Concepts/PMPSizingField docs

Co-authored-by: Andreas Fabri <andreas.fabri@geometryfactory.com>
---
 .../doc/Polygon_mesh_processing/Concepts/PMPSizingField.h       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index 8f89b3a88967..afd1db889147 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -48,7 +48,7 @@ std::optional<FT> is_too_long(const vertex_descriptor va,
 std::optional<FT> is_too_short(const halfedge_descriptor h,
                                  const PolygonMesh& pmesh) const;
 
-/// called to define the location of the halfedge `h` split in case `is_too_long`
+/// called to define the location of the halfedge `h` split in case `is_too_long()`
 /// returns a value.
 Point_3 split_placement(const halfedge_descriptor h,
                         const PolygonMesh& pmesh) const;

From 237e915d2baecc52ea8890cf10a323a555b92459 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Wed, 23 Aug 2023 21:00:28 +0200
Subject: [PATCH 0708/1398] Use any argument convertible to double for
 overloads

in isotropic_remeshing()

in split_long_edges()
---
 .../Uniform_sizing_field.h                    |  2 +-
 .../CGAL/Polygon_mesh_processing/remesh.h     | 31 ++++++++++---------
 2 files changed, 17 insertions(+), 16 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 7e8c24f3dd22..2ef86ab0233c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -80,7 +80,7 @@ class Uniform_sizing_field : public Sizing_field_base<PolygonMesh, VPMap>
   * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. The default
   *        vertex point map of pmesh is used to construct the class.
   */
-  Uniform_sizing_field<PolygonMesh, VPMap>(const FT& size, const PolygonMesh& pmesh)
+  Uniform_sizing_field<PolygonMesh, VPMap>(const FT size, const PolygonMesh& pmesh)
     : Uniform_sizing_field(size, get(CGAL::vertex_point, pmesh))
   {}
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index db036a4be6ac..a8da9fd9a019 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -51,7 +51,8 @@ namespace Polygon_mesh_processing {
 * @param pmesh a polygon mesh with triangulated surface patches to be remeshed
 * @param faces the range of triangular faces defining one or several surface patches to be remeshed
 * @param sizing uniform or adaptive sizing field that determines a target length for individual edges.
-*        If a number is passed, it uses uniform sizing with the number as a target edge length.
+*        If a float is passed (i.e. sizing is convertible to a double), it will use a `Uniform_sizing_field()`
+*        with the float as a target edge length.
 *        If `0` is passed then only the edge-flip, tangential relaxation, and projection steps will be done.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
@@ -197,7 +198,8 @@ namespace Polygon_mesh_processing {
 template<typename PolygonMesh
        , typename FaceRange
        , typename SizingFunction
-       , typename NamedParameters>
+       , typename NamedParameters = parameters::Default_named_parameters
+       , typename = typename std::enable_if_t<!std::is_convertible_v<SizingFunction, double>>>
 void isotropic_remeshing(const FaceRange& faces
                        , SizingFunction& sizing
                        , PolygonMesh& pmesh
@@ -338,9 +340,11 @@ void isotropic_remeshing(const FaceRange& faces
 // Overload when using target_edge_length for sizing
 template<typename PolygonMesh
        , typename FaceRange
-       , typename NamedParameters = parameters::Default_named_parameters>
+       , typename SizingValue
+       , typename NamedParameters = parameters::Default_named_parameters
+       , typename = typename std::enable_if_t<std::is_convertible_v<SizingValue, double>>>
 void isotropic_remeshing(const FaceRange& faces
-                       , const double target_edge_length
+                       , const SizingValue target_edge_length
                        , PolygonMesh& pmesh
                        , const NamedParameters& np = parameters::default_values())
 {
@@ -377,8 +381,8 @@ void isotropic_remeshing(const FaceRange& faces
 *
 * @param pmesh a polygon mesh
 * @param edges the range of edges to be split if they are longer than given threshold
-* @param sizing the sizing function that is used to split edges from 'edges' list. If a number is passed,
-*        all edges longer than the number are split into sub-edges.
+* @param sizing the sizing function that is used to split edges from 'edges' list. If a float is passed (i.e. sizing
+*        is convertible to a double), it will use a `Uniform_sizing_field()` with the float as a target edge length.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 
 * \cgalNamedParamsBegin
@@ -424,7 +428,8 @@ void isotropic_remeshing(const FaceRange& faces
 template<typename PolygonMesh
        , typename EdgeRange
        , typename SizingFunction
-       , typename NamedParameters = parameters::Default_named_parameters>
+       , typename NamedParameters = parameters::Default_named_parameters
+       , typename = typename std::enable_if_t<!std::is_convertible_v<SizingFunction, double>>>
 void split_long_edges(const EdgeRange& edges
                     , SizingFunction& sizing
                     , PolygonMesh& pmesh
@@ -473,21 +478,17 @@ void split_long_edges(const EdgeRange& edges
              fimap,
              false/*need aabb_tree*/);
 
-    // check if sizing field needs updating
-    if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM, VPMap>>)
-    {
-      //todo ip: check if sizing field needs to be checked and updated here
-    }
-
      remesher.split_long_edges(edges, sizing);
 }
 
 // Convenience overload when using max_length for sizing
 template<typename PolygonMesh
        , typename EdgeRange
-       , typename NamedParameters = parameters::Default_named_parameters>
+       , typename SizingValue
+       , typename NamedParameters = parameters::Default_named_parameters
+       , typename = typename std::enable_if_t<std::is_convertible_v<SizingValue, double>>>
 void split_long_edges(const EdgeRange& edges
-                    , const double max_length
+                    , const SizingValue max_length
                     , PolygonMesh& pmesh
                     , const NamedParameters& np = parameters::default_values())
 {

From ec1793f54d46112ccc35f94e73cf8518fc5a5b79 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Thu, 24 Aug 2023 17:50:16 +0200
Subject: [PATCH 0709/1398] Documentation update

---
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h   | 5 ++++-
 .../include/CGAL/Polygon_mesh_processing/remesh.h         | 8 ++++----
 2 files changed, 8 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 2ef86ab0233c..c49273921074 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -44,7 +44,10 @@ namespace Polygon_mesh_processing
 */
 template <class PolygonMesh,
           class VPMap =  typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
-class Uniform_sizing_field : public Sizing_field_base<PolygonMesh, VPMap>
+class Uniform_sizing_field
+#ifndef DOXYGEN_RUNNING
+  : public Sizing_field_base<PolygonMesh, VPMap>
+#endif
 {
 private:
   typedef Sizing_field_base<PolygonMesh, VPMap> Base;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index a8da9fd9a019..45ce27304cb8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -51,8 +51,8 @@ namespace Polygon_mesh_processing {
 * @param pmesh a polygon mesh with triangulated surface patches to be remeshed
 * @param faces the range of triangular faces defining one or several surface patches to be remeshed
 * @param sizing uniform or adaptive sizing field that determines a target length for individual edges.
-*        If a float is passed (i.e. sizing is convertible to a double), it will use a `Uniform_sizing_field()`
-*        with the float as a target edge length.
+*        If a number convertible to a double is passed, it will use a `Uniform_sizing_field()`
+*        with the number as a target edge length.
 *        If `0` is passed then only the edge-flip, tangential relaxation, and projection steps will be done.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 *
@@ -381,8 +381,8 @@ void isotropic_remeshing(const FaceRange& faces
 *
 * @param pmesh a polygon mesh
 * @param edges the range of edges to be split if they are longer than given threshold
-* @param sizing the sizing function that is used to split edges from 'edges' list. If a float is passed (i.e. sizing
-*        is convertible to a double), it will use a `Uniform_sizing_field()` with the float as a target edge length.
+* @param sizing the sizing function that is used to split edges from 'edges' list. If a number convertible to
+*        a double is passed, it will use a `Uniform_sizing_field()` with the number as a target edge length.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 
 * \cgalNamedParamsBegin

From f73e7d4a79a833268f4d134cd2ca877b162ddd15 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Wed, 6 Sep 2023 21:38:01 +0200
Subject: [PATCH 0710/1398] Add adaptive sizing information to the user manual

---
 Documentation/doc/biblio/cgal_manual.bib      |  10 ++++++++
 .../Polygon_mesh_processing.txt               |  23 +++++++++++++++---
 .../fig/uniform_and_adaptive.png              | Bin 0 -> 316564 bytes
 3 files changed, 29 insertions(+), 4 deletions(-)
 create mode 100644 Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/uniform_and_adaptive.png

diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib
index 89d062ddddf5..713047b1ed50 100644
--- a/Documentation/doc/biblio/cgal_manual.bib
+++ b/Documentation/doc/biblio/cgal_manual.bib
@@ -3073,6 +3073,16 @@ @article{ecvp-bhhhk-14
   bibsource = {dblp computer science bibliography, https://dblp.org/}
 }
 
+@inproceedings {dunyach2013curvRemesh,
+  booktitle = {Eurographics 2013 - Short Papers},
+  title = {{Adaptive Remeshing for Real-Time Mesh Deformation}},
+  author = {Dunyach, Marion and Vanderhaeghe, David and Barthe, Loïc and Botsch, Mario},
+  year = {2013},
+  publisher = {The Eurographics Association},
+  ISSN = {1017-4656},
+  DOI = {10.2312/conf/EG2013/short/029-032}
+}
+
 @book{botsch2010PMP,
   title={Polygon mesh processing},
   author={M. Botsch and L. Kobbelt and M. Pauly and P. Alliez and B. L{\'e}vy},
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 8f5863bd1f0f..0f89da2c013f 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -116,10 +116,19 @@ to the original surface to keep a good approximation of the input.
 
 A triangulated region of a polygon mesh can be remeshed using the function
 `CGAL::Polygon_mesh_processing::isotropic_remeshing()`, as illustrated
-by \cgalFigureRef{iso_remeshing}. The algorithm has only two parameters :
-the target edge length for the remeshed surface patch, and
-the number of iterations of the abovementioned sequence of operations. The bigger
-this number, the smoother and closer to target edge length the mesh will be.
+by \cgalFigureRef{iso_remeshing}. The algorithm has two parameters:
+the sizing field object for the remeshed surface patch, and
+the number of iterations of the abovementioned sequence of operations.
+
+The sizing field establishes the target edge length for the remeshed surface. The sizing field can be uniform or
+adaptive. With the uniform sizing field, initiated by the `CGAL::Polygon_mesh_processing::Uniform_sizing_field()` constructor,
+all triangle edges are targeted to have equal lengths. On the other hand, with the adaptive sizing field, initiated by
+the `CGAL::Polygon_mesh_processing::Adaptive_sizing_field()`, triangle edge lengths depend on the local curvature --
+shorter edges appear in regions with a higher curvature and vice versa. The outline of the adaptive sizing
+field algorithm is available in \cgalCite{dunyach2013curvRemesh}. The distinction between uniform and adaptive
+sizing fields is depicted in figure \cgalFigureRef{uniform_and_adaptive}.
+
+As the number of iterations increases, the mesh tends to be smoother and closer to the target edge length.
 
 An additional option has been added to \e protect (\e i.\e e. not modify) some given polylines.
 In some cases, those polylines are too long, and reaching the desired target edge length while protecting them is not
@@ -134,6 +143,12 @@ Isotropic remeshing. (a) Triangulated input surface mesh.
 (d) Surface mesh with the selection uniformly remeshed.
 \cgalFigureEnd
 
+\cgalFigureBegin{uniform_and_adaptive, uniform_and_adaptive.png}
+Sizing fields in isotropic remeshing.
+(a) Uniform sizing field.
+(b) Curvature-based adaptive sizing field.
+\cgalFigureEnd
+
 \paragraph Delaunay-Based Surface Remeshing
 The mesh generation algorithm implemented in the \ref PkgMesh3 package can be used to remesh a given triangulated surface mesh.
 The algorithm, based on Delaunay refinement of a restricted Delaunay triangulation,
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/uniform_and_adaptive.png b/Polygon_mesh_processing/doc/Polygon_mesh_processing/fig/uniform_and_adaptive.png
new file mode 100644
index 0000000000000000000000000000000000000000..4aca8a398d26d773f009845adefcaa90bc7e5915
GIT binary patch
literal 316564
zcma&ObyQSg+c&xi1*DPg7z7mrq`NzZkOm3qp}R#ux<fiey1P|Uq`Q%j?igW+vw5EP
zJ?H!WJ8Q8S)(o@R_qFdUeldirsmNkKBYy?}0JglGlsW*QL;?VE9{N-8nQINf&)@^9
zrMR*<0Mx`{-kLlCfM@d7l9FmJ>ar5F^3sw#9Q-^ytZ(0N0DxS0mWGE;BAi%c75)MD
zoy6QpO{(2TfS#coeE?54A1?tg3C1H3>kSEe_KuJUKT}StCusVaTvph6E_1V`ctn_9
zq?Q5S5zW%K20!oP!$ZU@qJ2Aa`*y@@6gLo`;6?o3d>epYJw!-gjwV)Bu4k|#5Sd7B
z4V4z}@6Zp+C%pi0g5u@r?^-Q-i&W(RAOnumZy*Hye;z)ys=d$#Xybu3dV+0Cq&Rh8
z;Em=0AuvD+RBP0kKLe5gz|PB8f*vTv1`aOdMV<h2C5cNUz+66M2|5ss1f(&`LXgGU
zfcIJ-)mf0ce*n4VV)SoNyDO0bbsOKxA_sOn0o-GB;&8>@1A%E0EWZI-K4d_W`uQ*l
ztrAKu`$X4TiLqlyvm6r8J(N70syM+(*ql5@?s0aqwobSH!>&fcgybcj1;!?QW@-k*
zbGdC4r4cLuAio~}e$OWwxBYkX&tHpeyW@-A{CnFI2YL~@)7AU-C}dOsPi6FY!FX$H
z2F0--soJf}wnQITcn4UmUK?^QV&v*Q8}q)7^y0e}qt4D#8xW$Re1?g6$Y`3^!M+hG
z^1%7WVJ*`C3Vii`(fb5&N*7D3=q~tl=VW5<Ua20lJ%lR3VGrMCxbF`MxQlr?zRp!+
zz(N#psuSL<Mz7rO)uJ9RMK_qdPOuyB_LL^&4kOV68z>J|?N(_-YZ$WY_CG>Gj>OTK
za0kTv&sn3$G2;O|ORl$GZ~#c`x{eiljRXv*7H$AQ`wpo=aT1AAA36X?<$iosEslou
zov^$cC-Xa1dp8NP$x|sYEJ(Kyp2XA5K+0!%q$%QLn%x3(s14O9<hl6ifAH$RbMRqr
zuMrr0+;=2-`kplV2WfjK2CDb~`g0RHfiQg2m^u0pbdt0fRC*IRu7tos+TAchD1GmM
zb0KnxgiXAm9K#u_Ga-Mpf!Iyl;sEX2h}(#ES&pQSwNR8PWH+&vVjA*@zFe1aS1w$`
zz?6L3aq@a<;lRfHZ{vzPZmxh|M2uPBI0ueJ)Vzs7)Mx4U;X33m`iaf9bhzKea+^`<
z@VXOGbZ46!qeGA*1D_wD8wKP2unUTdlhskukt}9BV5lc(Mc2mo6wL91i9WGdwVu(N
z;JU}tRG=nKN2dJ65gj#MHlq;}&U52LIS9^R!lueII>xxS@|g0ra*J}Tg&Kt-6L{8{
zN-y@~V1p~0=(U06w5jn;akz1+35da;n@xlQy<zK082J$O!XyF(?hm3{s9$s5N~GnM
zLWfJTr_f8o1akD`VY%*VY#N_So^!dSGY)4EOAZyX7EF(&TU%Pgt=M*5TQQbDQA?+e
zrB2xHpzUt&e!B3$!Vbm$)GuesOlC{wL-vidiHt2xsp!dMYTAG%`|MkaG|MlzUmUb_
zUR}NNC5rz=kSvh=F4;eMyHr!lMN4$rs}xhSObfTn=$&7Yj8>i6MhV6gaoKbUl~!8`
zPvwZZhkC5qDAc&1)A%mv#tgeQG(;vhRIWhNtf`MInvS^d?T1qxi5cg2DEln7UzAPt
zYp)NK+@ByQ+}V7TG$dV0Ey^w8EwcVP4I|<7)vTTH&u1!((2Zb^_^_g|in7+s*i=|l
z_*d{QcrSD=m>xPG5+Cj_9J@JYiDj{5T?)Vi;BFYLJgv~ykk&=F(LIq#vwg2!jLTn_
zIJ?W^vX`)nf=iOU<C)`e8eVoTbe=deI}SdxlizV>JGNh}o5xRr{}kg7S+&OZSQU)R
z7ce!yIQne4!R<*RVo~luX<E*;@?ptV$i&q8?P6h1Vee+=%i$#3bc@#U`bpQ{zXw>B
z%IC@l4`TSIGi|d?I_KLLZ=*xLN@w;eMDj%Tr!1uS4n0XxPJx$yc_;GD>)qwM*>d?A
zgMF5L*o?NF8ijTSR)#>vP-AgLMn#W%25gmZoiO(0#LG(!`vs1J+k<BZ=?6~_`L9f_
z7_VSgqg1~s38-cST?KueUEO}W+c~!H7yjY;S<+MTb64Av!ZOb#>ztdUNHK1RAk{sU
zL<9CM;+uVr_fYZ{`BCdc!{lW_Mq9>G#XM|k`L}SdUl~IAO$NoF;ZNaX@rx6<&brg@
zjjV4O-+r9OZL=A<8|fM$I;d6aGGAoRu)_uxd-T^jhJ4-&hzNhU8QDb<=@UWD@y_|&
zS=33tD%{E7KjWX~k9M1l5WE?>i~ZO2$LoyvROQKgr0+;uNF5)^Kh~kxqR^nGp?*c<
zeiHqp?I|0U2$2L92DUDZbD~2x$r;798RwEEOZqs`FZ3)TJ&GIl-!GJ?XYgY}N6}aD
z{2hv}m3DtOqKB=?+J!aKSd*oZT>BBeeD${U%^tK~!_~<Z&N5TJsf)1eh&hcdiE0sC
zv}ts9w=B1@Q@1la$Y>61E^Yqk`T3vpX)1y1a|p&^_-4;sk8t>g3-Y#II%no)x@L;2
zS>@JJehbOp-I1Ye4<TJ{-8f&qkS_$OwW3>}XeHFxNL9DK*(*~$KMT$XQI+n@kIskI
zG&L&-CH&2Lmwd&yEa)eBV->0@<JQNCp{oAcE1oQ&h2dQJoz%=q`RKgUJS%@vW>RK>
zI<|F6{p(rwCgvtpi`TCcu{XW`!hTUCe*OjDWVm)YUnH^%Q5r9(SFcpVAy#55e(kAG
zs_)q>*CD4j#kp#6zjw`m8AR;c5m&9&TwOQU?5TUYM&BjfM$8bYLE`a-!%)4|+|&AG
z!f(iGs5a$JZCyuQ>&(V$=`2S5)5O=WlCOibxspqg28Zk`FZ5c>h)j~rwT^94r}f_j
zydp_9E_W<1uKZUm)BJZ`Tg7<V_tFctu&|=g^y_e6ZohEfz8tRGRi)5jBR)MAdV*a+
zaT>ivVGL7Pan19#xr`aEAO1Cr!fnERsQ<gMeDN%gr{KyvE5LB*-CadlQ|J7Pg_*8p
z51(_KPgF#LE5}I(?G3LzwQW13{Vwe%j)InB$xSI*yZ-twH_Ljc_GZWWeDy)Ql0M$I
zadog;s_N>h#ek{vL{rNNIBsPGIxJ)yrh7Cv>b=7GA-?sUX|>4LXG3i#Z{+9F&*9ay
zfTm0IeL1h!69Qds<*Ws;T;aTq<DIC2EGi=^+0Ld1|6`5~Gq-;3SncfGEN0=;>&>9V
zjc?}Pva?h~g{RV%yx>Z=X|{$?!wyTy(QHu?*CVASWBB0t%66>bNxS0(J=}DWu}QH)
zxKdcw-|_B`T$R4V{s;Kbp|((^>xJ^Z;P~-mz>Q7!w9D+j**AtcULD7M2NX^AFP15r
z8Cx&^xnCWUcsx5&S~B#G^{l$>T)5jqyTRQHsK2lI&<$Jr_rCl6=uchTV;qdn+4o5g
zlb`=g$o`g{W{_csj?JQ>p};2ZI5Qtf{PV5$+w;+1{_h^V_Fc-hSMSylilaKWb0?VB
zk)vIeUM1(w$7Ll|0{smAH0>i^!ly;I6(fs&$IZvBtNk4`Y0S4`_iE?kH)j3c##G@V
z+rIa=Z1CW71gk9HC^%%&n#rjv1AzAn00;~QfE)0sz#RZ^V+Vk}_W&U91pr7KGh3lT
z;0qXza=I=6fcgCKKmyV;NdeTs26-uQP0!2&KaXajS+_g#mj3XeQ76-Wr%b+H;hK$n
zh2xXrSTuAzEkZXsybcdMbcn7*U@<a==f%nsiDl<1XOB(dMQ13BhmU{2Z+**|c^8W#
zKSB)oy3S+Yrr{2cqouUE(S;9(%rP6Jj0#E2(0r+Ig8%*yycR^_jrM;(*K_?jfhFbt
z{4J?)EQMN~|L<LoZ-2`?X!^fr`S0llav_ob_vz_B{r@?U=N4uM%K!1kOl&FW=22=z
zk75#^OOknwR5%Hq%@ld$1p0q3DwXrq{Fp*js(Zau_^<z5#VErW)~qaB+w&a%9ddZH
z?zc}z_k(_i9k2{Hfu!s5iM8batR_`pr02Wd?zw`XUcMA5)WC>}Q6ZBv6ZZ2R_AkZO
z|16@N5U)0m#-Wum$J?=o|88X>CWSdZ|8ZTJ(wdSuf>-yYZCwH9h*whhceCmBs~7;E
zTebc)!nG*X(+tCb|LcFFJ1L&s(NcK%Lddy(^t_!HBin((o2Ro*D!eXS9lHU1KqU{3
z)L-7twl#)J*H<Cvfn2lWDzC-YP@$G8zfk7AbKk?M@AfgwXLXl?p0@DFf|{;x>2Tlj
zLBp0+4}n$v|J(~Be>HvR<gpJB_?P=L5^X9oPA3PQ7D}a}gICUuhw?$F^k*YuBmg|W
z#2^1GMGC!LLGasph>UKXPJWMWAVIHe?B%7Apw0uGBq77W>a7uA4RIPM?g^_fO7I=w
z-l&r~9J$7~Pbc4)NyD$qA>FuYDM7L}hBLP05cGYzq<MD4q;}9^7v<!AHZ|Q+WjN)G
zLM^z`RgU@cKU+*Z_+WS?`WP9=oLig`*5*Bc1A#ZmRY-9J(vg=QQq&wvo|ZS)^;x`1
z3PxQpm9vHKHxE*?NTR5~f!+h|j&m<=HDbks@W_^t;%0nEBwSV0wF2&&aTL2g5EJRL
ziWWSJzny_yVG->pa$p%=_v!6pXgQ^<ChV3E@hO+R<d1yhaEQuMrJC&}&TgsB>0{Xw
zn2{aLp?N*f@#FM4vR^9<rglcz%OfgCS8y)tF3fK@?ryP*SDwh9n*xwi8|Q;Q$6oxp
zi%vfARTZ|}%VPcZ>oITm5Ca(*J~(&Wrc!f_dzSz~txne&H>smx6u2r<U$ZD~MFtXi
zg8<ok$||18gkFp~v)>t%{tl_H{Q)3`Z|35T_-X}SwZfBZS1est$>e0G%?X4HKMDM~
zC<^_TEtF~7rWw6#H+$~FSAY3a%g@MK);N=SQVq-pl)3PFt=U9i4Zk;A`<__1>bAm1
z=%Q#&8t>e3IhfRA1lPf3a;k@uTpH+FNstA00$?{wTiT3LHSn-G>^tl{SCZ1oY=Jo<
zRsotPapXKe40Ge2_pfN7$JGOlx@}Zx$HLkJ2*X*`s1ETZKK>SC!3+Ki${X9q1Fn}7
z@03QY`MCQm$ubo)+?R5^qNQrw2kL;eFjGP#lq%IQ`nWhL#)!P@yQ>yxUx`A#TvR$i
zoA^N|oXRM8oIv{i>3t0S;#ldveEr@{E<=Qv1VI^HL~6q_vG2XzLP0)3f?7DHlhyub
z4)64?r)2y*O3xH2Zq}vbiNWP72fq;HMt0M_?^|B=9^DrTvcM>iA!6k!C0&W_!7GiY
z0E3U66P4R0_oKM^w$$9GXq8#z$QBK-8oy?yo|{~dCbXUtfFp1okC;Q7^{3<c=T66U
zq-nl8YVhv+9N`TU(f!h=pWH5+H+cx-JDi-OD46<n1O!{UVAK0GZqvqXFmJ5;Cp^nk
zd7}ehL@WPONXI>QZm-wwV~+ek8_Da25J;QeQQ^-lXJgUUe5E9A8jWVR@IJepBje~B
zksIRu;%`%9{w|oYu9hctWcK4MVssW8(V-a2`Xb_+Be)kR7pJFuIu##|^T4B}fBES>
z*T4JEIJ1BKdAizacm@f64lTgoMzh?Qih5vjwwV<armwkpu$8ydFgp33=9cTSoaRf8
z_ni5D<s&@&R3Tq26;JA|5vA26lO5k?mi^G;H7?x?bID&T945>%5BSKZGVteaC}CTU
z@H%tG_AyZ8V(Un-$vY>?c_+HZSY6rOrvCPDr}+2$zyR*y`CfG>0zvg7jXb){xjjux
zg47`=L-|j``(USCyCcO-{61w5*<y+-!Ko@=m_^PIVFnnb%ws;9z2RD2eq4(%!W!5m
z1yIO?2^<*{d-1qVSCsrr4vv%Jz-8#a+5JYBfDZhW>DOuDTaF2KT0V>~%PFV2F{rJ=
zepyGnr}TutBnw4<C3cx2Vc~Zrihr=-{^}9G=XGX+yuER-&7sv{oU!TR9&gLB*Nz(Q
zv711u?zY!mj}+&}wbNENi{M^PdU$5geuh?4(WtFg)bjR3Xm$>>EwN%|Dj(H^qx}A`
z=cd*1((Gtoi9Ni``t!2qi5LkWmWboyv?qog2q`6H_%Y*SghqQg1~WQJl*|(QsF{Wh
z;MjSI0=XJF->MxZecBKC#8FI+R}ysNU*9vC)T{l(%>BrIk1m!;7bU&s^dMEI<+;8&
zwsZ)V_<(bt<zu1ht-GDE{UL0)sM@8+t8zZPwZy&;n01#qyh;&Hi<txXlE9nV;#kSY
zxB_B#zh?7iPee_JBDC|YKMR9bXbF6+c@53)!Hjhws_>#)kON+R&vlthz^j0>Nh~LK
ziQfqagoyL@==kUd$D3`uCscyjH560bP&QV03ol&WvaFNxwI4D>dk1juOl`mP2v{wG
zdtTMSVpac~T*c;G9&6U3n{yNN4M*YkcmJ@)mr;$Ra%%TBh-xD)H1{7U<|=q4MH&u<
z@^cuNsj9$QR6k<{Z$Gdesb}vx%5B}n>4D%}ZYrX3|F$}5;($e4*>=X8cIX`&wz0yH
zFiPf~_~6Cu*R^%zad4;Q(X}5)({G4&%l8z|WAFU3StF+^XNF@p07eP#;<5jCTh&YD
z6Ts@R2;P1|l(5BFKM{Ll_;s`4=x9#z!<Io5U4bbt(DSpu#~ui)qE1~h;uIOd^6!gI
zG;=uN@940xqcrB`@l#!{UhQ}L=}&?Z=7as9v1I#?MitTi>aly(h13c68_n3uYAt3}
z_}PNFaQ?4`RBY)uo$ts)`G!o=A%fFgQ?{%Uw+~qV%Psr1YFq@jmG1Vw^>xmW(6{q|
zWBh;^q@GU>7ptOct(=1Q!?rkWh+%=Fp>}`yePu1bm`Wx-Z=>tQ=I!Jzw^+1QQXhoq
z`d>b3Cl~hzS>^Bzs7CE*Y>w8gzN~8GMn=(%`y38fpFZE;)Q^@BjMDrHDD1(+QNbbM
zF-{b`_RXI!l~HadX;|99mx-BKrsgleFzo+u*tp&4ZoOE+5!meV@NHw{E@z~DrF8!#
zZ;eZ4#hrJj?9dzB=6E3yvZYGv{=1cpD>vgXq@D&z|1E6535*TDg!{Et4Mkv=+5kf&
zB<h=Bl8}+`2vej0i*9?paz~r-V<#9z8@Z%hZCxz*zP(EeJFqfxnew?kEqdM2f9UN$
zv&;n5tS#Pf%_?S_`X^PFJi6#HjpM~rNp)84qoiMAKAvFD7)DpiXW~w&`Xx(9cEWQx
zn6J}bqIG%4+DXV;FNFn%f~x<gjOByuf}fy5rYQ46Gyxl_iU+dY__fYb{&@|FdH%O;
zjc|JTquvSvXN7z#w1R9g1>(cz=4rp(?M5B#-WopYrX63Qr+7^V&h+QriwmQfmu6%6
z=TMJZw*a?IFk;}s@oN8-TTaOlvg)F$=UWL6Nu!?LggaTx!9!N6g5wvFO+NMeZP8k@
zJZ=t`kiL=SVS#Mw7D0-Q+Q!A8(SY_{XAfg}({ZZ>6V>U}#g>N$uDMLMzQg^_e?fQm
zHfV><B-RJ6wDvQ*Vt<=FT5l;h;>=MwUWb{jUCy6NW|fJhFgxo6@!4CPc^*VvcrixT
zmne|B>HI*arGAMsHzj|I`0b;ZNyGdQPQZr#O8E;351b)fS&+Ke3ai!N6ovO6xrXSd
zYyIxMXB@K#O#vb|rv-_&au>ebT(s)(Y0(`_s?=W#jaQsxwR3s1sXzPMdIfk#uI^vw
zX%&29kRnWGM@CPO61*{@YD4Nim(i~s&}WR`G8dW=I2*`6vP^y5nd4>rIPhn}2!~r}
zY-`KM&t13uSKZ;ZH~ySY)!(Xfon;ny6)49tjkZP)-YH|-q6qRC!%1(4n)}y`Tep3%
z{9hb#{M+ULw1c3mAGex|w>q9weW=S)vE(|eW|I2?BTNZ)>UMLoPq!P*d)R&&*bKJ6
z4~=xXn-x?kEU)OMO<*3`pPKxZQ``F)jXaYcB*M3;yq@POb5AFUP$`HAz#nq3bWv}~
z#XD%o!Qst$CVDC@229O%@5rN1+2L)t-Y=fU(M43WiQ+dMo=RZ_+Y+QvFMz>V<~zR=
zJO~w8EuZ}Uh#s(4ecqCqV8!=xl7Shub~LH>N>_8kI()r_)UfhoGDZ=c^4IP1)4k+u
zm%d!d>*q3zo_^t#z%NrMs0ltZz}XK*UBj1Iy9i%Ti+OSA;T5}h;rZ5naYMstkvhj)
zJmxu&I{ou|*n6X_jTX}XT?&zw@|Pl<eCh3;G46fW;y*P6y>`m9gLw(kD&Cp@?5LI^
zVPpRq4^M-6T`4LUu<)fAmj%A4_!Jd@^Pp2%W$$iro)dHkn;L0zhv$R|%y_VZ7Hunh
z^u!Nb5=h<lc|;~X^I~6HisTWRuF*W4ToRBPW?O05hL|~$4fOEVka`>)8K=spF#QZ_
z)mE!=0UyaUO=*UzH`VD*0{exS`sKK{MTXxl@Ba6SvA<({y|y8N+AWyG$`W!TPnS>T
zN&M744E|;wKgy}4vA<JFmSg2U%Fj*gRls4iphjiZP@vo2(Zc;Ex`aa6M!Itin>M_A
z9^X5l>7%F<%E{n*3wfzbzd&lfH;J~Ysg$qle=a&L7wV!z#FGdKLyd0|e)=E;ZX*)x
zbC@1(KcTW9SHV{~7{Zt8x74_w12`*`qMqt``24Hy<Se-pCHFndC${}Gx_CgVNSr3J
zWOl-~u|U@q^;qOC{9n=ct4Au_Aa8rmnfc1^LndFd)s^>PemWaS^)yoB(k(t2+Kn1o
zuy^S_Z_H-b+WB3y3RtoYZx*Eboju8Ne2q<Q2D^;sJ(IE>=~IjUh$nx*eH*J{SkHX6
z*myOG{jeWC`Jx9b(1*f}_^{<!n;!fmcIQplf6!aB_-UqJfUi>-qAVSrKC8LydI+v6
zhCO@tpH5=i5`Y)5nea8b(a`G??Cr?kwHmC36;Hap{)|e#3V1wo0!#Lx3CzkA{^P?7
z%QDo^f}Zop|HAuBNv<LcHj4Hfw&vnqJ)qkR7prv6b>)ZsYT-|#OaZk|#96U_J_=Wi
z)efNmfg5f5nWz3>oBQ1MFqU@&1V-w^Pyr$D@|-4E;+3G&-g{oID*lM)KKk0X2k#7N
zPyui_B~)HG_eprT01>KX^EQSz_Co>O6C6bToRv+K?B0LC7k~$l`|z|s2gblKfI~$=
z^nEsFM%DKXrl%zKlbuJAD;pqsbcWl07QzJP8gH<_`!!n4?BWHIGQk^g{k8e;9+5tQ
zN>lvZbyN}6RWkyYddJ`rkv>cLJ-h=3KpJ=FDvK=rRzXDB{Q=hWC+}y&*$o{CGvCx1
zqALp?^nF5W%}l&Q4Lthfzjt)3gP3u-67C6Mo%wT$_7oXNcVAjPu?t3ndpIt-?p%KG
zc<4^S&6TWT+W;S%x4{LOjamH7lSdc=ff{ISt=kHSYoYa!tx`s#y};9_HN?t3*jlB6
zf;4CaGSa^+fw$H#(mSmgOuZ)7SKvHSPgQwYXJ@cZoYpT9>J|tvY_8dhU>&fye=TEo
zzDMJByUp}>voq!5wG!HzEU_RQ_ghJ5x(vzX{$_Li;XB?^etWyaahIJs6>b&8Yh-Y`
zffD|4acaxX8OlT(wvDm4iA35WGywaMuTYNrp&fR^hxBU~aHwb*-csfDo|*gJLOL+Y
z2ex-Pmo-<}ocKZh$%h5LqkxKld)M6uVcv^t&f%kH(Q1$y`#GBRR+E4*B+*D_F7m_`
z{q>~+p<j$6F9FnE1tYADT6aN8GX5-gGOtVYXfkP5$%v~qd4ze_>+tDJmGAr^E+ff#
zTD9o^_VUZ~u;P0n`fGn4y(hPai;G4h^<*LZ`lD?`IW;4#!|C_sUPV7*rE0!qFGQ{T
zqH5c4Vk7hy1HrA`g8ay!YuG#eNq;aK-hRb>N0ucyX)3AG;v!t%KuFc6w`yeWGjh=;
zdT~k?y^t+cv)KLMc6qOxFz3nW*?6G#InZ{08m^DMv6u#?#ua&Xf;25%6Qp@M0_SgX
zb`qb*BX-W@3|6;Xa1Ef8bvM|d4#>aO6LK<DD-dn-8ism2^sLMnl@=<Kyp)I>=|=)^
z53Ive3{^n1er#_v?Zal<M1@PW_lNr1E@}5CgrN7LI~Ycf0C=cJp8EhB2xc<I{KiI?
z&IM=gSz9k2sNEerQ{hHMWiJpj$RL|U0J2FsS_pJVNqwv^`+y?V;LniZSwO5;Q#l`O
zXG?crHlPCaho`8(+R2sbTEa{Q0K`%rYFyrn(8x`=Pn^5-FLX(R-S&HS^aC;gk~?o%
z?b|seR?F^Qo^`gBDq@uFB9uJ>j{P1&-GxQBsc9B&{;c`@+HD5svxvTAC%f+qvOZp;
ze);plAnZs60>O0b+h7VcUzx2PlBZl<#;Rz|Mt)50O{}YCQh6KyphU#Nmi;VPFyD^C
zjL$7x!2trKh&p8gsuuQRxphOCR1K$hMwuo4OJLMJTZCBGfvI<@?f|l6<iPufzi?#0
z=Efh>=NK_t*BY>mJb1&%FX~b5hY3DQ;dAWM)TI1i`#huZPvZP}^XS0T3anM|$Ch?)
zbAayVJ>t-IC2HiZGg_EpHOtF^T7kkl=H!R-Gy&TO+WyxU;eTy8M|E+nvI%B(WBRx<
z9HuXmD1dcv@^!0fIJ&A%rG`SDN*<F>ip=4@eaWXvG`N#Iq=^5LoUZCPz}UO3%|UCr
zSWkAkNyV@82pgfh&?lksLGvVJw=7!zYfJTYdg+ApsJSLVT1`LAz}1HXAGd?2O?lfI
z#*?#EWHkM=QMfq|7r{*xcTp61hmZW}y20;A!u1Jae9fNvE7k^1eewgttwx1(uY{DB
znlU`3-8$byR9g^qc~n<GIf#5(a!6_|EzRmH?&>LkC4uia7Q|cgv<-sw{q?v}V_zTU
z(_Vhh8F{ZO-B4OhX(RfPi;5?Sc=1bKX}e+NzfS&b74t?mCwHg}h+3a(ZeVvbPs^zK
zGHP}!)$d>PQ!d<?fV3Yn&ddW-AlEB&Nc?x3v64}ZwCyXHcPzXG0Qr}f;LS#bwTeCi
z_-Z%Se~doDeUFEM7)<CSeDUaX1+fx6a`%Ad!*l!G=JV|@pVh``2h>0%DX?Z7t96|<
z{14v+4jTa-@IwPQJlWp{@8UgjI7uA{*34Fm9{4Ioe@TLT9`Ylf=YBzYi`7`=rT9XC
z{48)gPxl+xei9J^oA#2id~u$=AeVHU-v;6va-bTdSql2sa(s>#JO4hkAfjFnkZZLc
zS28m+7gQm2b8jT}dyK>``SoU<pI3!9HspN&1AEBw>deemO!D+vca?_exqEd#SGJwm
zReKRMTe-ar@<{<%Guvg@NCblFN!;S%O?c_9bC@7`oBLGk)vL*p(b;958Ifsh1Qn3$
zzh#RA8LyzSeIN#*;p)k)?NTG5|9s6=MRD61|J3Ta_i>%o_W4*5!VCyx5PWlXr2nx2
z94b%&JN>&CY_DcWPe}iM$YKWR;g4YV&?ZDJET(p#Kxun1v7wUj4C0<V7L|EF+c$SI
zI3P{@5z;!alV@?T<e?pm&)cu#uNYj`S2W6|Px>cResE*)Z)WF!hPCV{C8I8j(>uq?
zsfBWU8)NtrxDHdT5ZAsd9@sKHb`zA63po~=c17Dqe<PM~Iy%>nXy(rREdgPai46?O
zm3xe-i#whRNA{2)sd&`!phS*Ifj#ZcryyDUW;B@n9yNTDg)UN)WM5#dKW%iO;T~oM
z(!7-A5AS7?e+O;8@mgIR_Z#E1e`u=m!US@4`~CP@x-?$&rb2W?KjjqkD9O*K1wCCM
zkiz7)3RERNypKylnJ3g#B>b4fvf`ngLK-@-o^`IVA@53cBI$Uw>~}1>dB5Tu@dmoS
z^|5abs^xCK%<5!Ay{vmMr3rG8lgm{y)2$#UjtpEm_~)eZ%!7Ba<FJ%5Pr<YdN_fb9
ziwgv@zBW1(R;?`_yKV>JjzBFstt9Cvv5ua^m`OXl)59`JjP=V?N{QI-UENpQ4l>|Q
z?5Vtb2z;Y`3$z{keQt^t@B;^P0@=oZ^1VBiLu-F>SQzswc`(<bm=)|^tbNNaU2eNA
zovUCyYJ1&~$6&7l%OvPiFs~URT15juMw7;csxo3CC0pcC9U12{H1z}<7!nXm-9`yG
zg0S23pW|p<qcPAPHnAJDxd#pxo|pKLD740Q8lWR4Ui*_Sw%n0>MF2%;bWDwNO@PpT
z=-moK1S-bHh+9A^U6lf<JRy>&Imf7uZta}e2`6@J!d-1osmsH|DYbsB4mK1^T0szw
zP`OFNZumr}dG>Vn0`ca`{?-!S?7rjj$W8BnfXm)EG+HJ0@K<lVM|sNtEejNt01Opx
zP%%`dn>QPzY>%qigeAb}xE?Py+|!J~)?#a1mKWdV=&DRIDzv+v_}2eW)0dOA0KtoM
z70t@MlLG?ebh^#@5te(q<e1TV&To!HcE}tusBBl&|B+=OI5?SpfQ>5Xf4I37F;WIQ
z-P2dH`RHz7q;16V`>$sO+$&&vVC?|^)T&RzaY{9^BeySItz3|0xal!I2M=4Uf$(Zk
zTU{63U|a;qs0B2STI(aMffM>{I~2F-d&xI~Wgyl>qLpKY{f!quXPJr#p^tdBpeB5n
z7GEHRFE>aJQUazq@fhRn0lLAhuLDqk;;!wgw}>Y|MO)U7@vJ}G64r{UxL{sExywJA
z*+^20n{n;sr%;^Eo%*NEeuN}zYRD~u#260j4jm-O%6*Q;W@4KWsSS%bKz4Oh2vPKS
zzwd}dfrFR=A<;DPG^hF?IwN)@qbr2vHHj?g+gBY}+HBTK68Vx<ReZ=9LiYqXcGvGM
z1QXhYDef`AGXBwL#rq|zRZ_Cu?)E9C_1K~NOqeXx^nKvPTyZm24%!-3li_|HL}Bn<
z?Xak)sRYn|VZ<2z$P|dGlFUZMcDQO}1WBSO#<9PU;$R%h<Jxd81v9EQwhyltl$VY(
z%f6vRL?eZ-=`=u@1WAa7mGcHnmAhPVR@zPtV^|U(HeCxbe%U|nm5;>_<18OZ*)dD=
z1ANGSm?nD=pSh+%@-ihiW13{@?+A7icjtf=^9R3rc`*t1#MP70mHl99%%dhESjkgR
zhhPQX?+aH+9^(%pc-d4}h7ywMuo-(?CA2Xc%pj4F2r-@Ce_g-VPuGP{r0`Hz`Q~}#
z_C%8W{@5fH52+!5qJqHu8DqE<zC7d)Em?hG{LUQ07Tc(fOQ0#BE`gPxf1o50-|gr9
zqkwcZK?bsQD2?Tw+}=2MqCoeIRsaeug)j=i=)#Db!%$obo)u_gi}`r1k$~Z{=ljsX
z*^hX>`;nD~MQ-_o=5v^-T*w<gR#8(q$xgrF2TTHXZuY%o)CswK?jDeGoQs#bte?=Z
zj+T>CP6;hPo|Y%%J)TR1tZ;GnRd6OEW>uA%w#Z}qHH{hUbM}u_2dvI`pSR6Cd_r`H
zIb$WU7|)psQwO{U@|j;n8-Q$$DHl)v9BF=W!$&XtJO!zE98pE|ODB*}iCu=@7ij-N
zD#VvAyTvw_&kvG<=7AcC6hMZ^f7GlNK+Q@ijl^sw82$M+WOO)-kpBldL@NILPFW*y
zn;(uMA`g*>5n3q1GkF{-9=Er_9VBi_jest{IM*F1PQai-QbRs{`7`~GbiCf2zn%8s
z4$IXLqPYe3qMV79c{6L+)}f0=kf?9egB~H{xb*t{2Y=oEtn<VN$HDSV-U*1k5p_#3
zOI?AEj2U!cqOSmyLQ5qW8D`5T#er^6V|8*4V1f&Uo1Ujj0`!kM-=M5MGd~u7F9<W&
zL6|9AFmQpFfbFLgG@!5lrK(3h`t_tVSkl=*kj0?GWF?;e1<h7d&O0J(eUB0U#jvtb
z4kyQ@|42>(d3)LhLoB;W7LDK!xrAbLFN7Qc+H#zI*Hz<`BzpJjsiq(7$+;zB#4}?+
z_gF>(OnccTd}>kX(+3mzjU(*iSA?Z>Ca4n+;_~!y2@-GUr^c3fm>4raF(xQDzMs9G
zX5W6a%BkJOKX`@VK5BT#_)o|EKNJ*4r=d&Fi+_LzRZ3_jC_ST*OX7j^KMFYiA5q&X
zSgE^^<lSd?Nr2Ow$s<F4?Dt;vH8{GLgkGqxj;BpA$z*#P48378$Y4&8T472mt`Sl4
zCk1jRw^qA55f95>vrFq@F5RMHVET8Vza3_n3mEy7tP3}I2MKRVWYgsYk|1Xy0J!eV
z=VnKRn|1PpD54l*GcRg7W5&GQ_v<(BISp$;%D5L)Ah!3Ixa%yzw0qtW#FbxMUDCin
zVRLh2L~3#p%`wAr8Dj2ABS$Ui1_!ELmce>}lyIS@{JP<aH)4%)^O+BeLl)VezQI8k
zMa$1HMp4z8+mxgWqL0Dx)xlY|#2LFu{toh_6ptD{pq3?G@I@Z|an=C8O!w_$*LFq}
z#q!Z19e8A{NE2c77^X(78z??{yh}yDY<zg`6+_vP{S9d~h{(RvNmzfqNO!JXs9o1u
z*@t`<fhxsP6-0b;P-4pCRxHzJVTPgx%Db4wvi~*t>)C~FaIB9a!7LBbu;~Ag*`%y$
z8}@Pmc5_X=Zu@W=d3tR0IMVn$-d-IyTj#Qp7IMFGLaohwdWdEsT7nF>GZd928`>T=
z@bl264i#T6cEjzt=@JLq!>1&6f{fHI<c`n>4E=ZiG~BFrKq<G&vDGb1FX9v=KeE$z
zKcNYrh3JAavMRfDvRfE}w`=zGd~RSgLC;28hGp;|dP0v9&3hRl3UvDK3qpnr%ut9<
zPLZ4S;=8Wz_%Z~PS?BdnW5)RjWB?F;kZRS_LLpoc0|>8kSHkZuMeimZW@n~2@~t?%
zzgV<-wXhvY{CHM)<+?d{(mraYNhn`mI5R`?3W|EWnsH#MfLGGQ?ray;M)EG;h_e(O
zvLCY5RH#r4`b}TK8C6XTFbeLL4eAKP_mkc0y_3vOKSU^mR(K7YfLTZkiVc5yR-|fv
z6G#_j^n|s~X7h2NSF{PQ!xZ!7gzme6Q90^`8+=)UWM(}K*vxay(&M*XJn-bGCQY#)
zRs{}Mbxq}-M32?g&hV1=jj|+$>1bY8A6RG)Ux*Xc)A83zK{*_p$+ha$@^w(jQMqSQ
z*oo;NXA(<YESKJuMhWD6`)OJU=!H`8&9vJN<eq*9(hSxoXJL+VOJdk<1QR9&lZ1t1
zjNf<YF%Qr4e@II~N!}WSZ8prK<IB)WRQ(C)OCj>_so`=3ClE)z=ker3yS1>K`okx2
zRV(uOR$8<r0QIYRzRtFmy1aVDXNm+czlS5A2YjIV_&xx>Ao(?HtmR>HuI^7(44!od
z6$VmxKI`%h_pR#pRRyb?B6_JK3+0oX48cKF*(bN^xHE5Lpb0#K3CI?6aa_B$Vy3Y>
zlor9N`Z8mc<J7us9~6mFST7c3izlaLCjVuDvXV{>^Vvb$(Q`N_WOL?Wfs{mQ*NpKq
zF&%=0?phS~s%io8U)?yM;)fM|9OZ+uhoyX(4bl#W8a}08Y-yUUU=_i)&+2P`KLl}V
z87tmwN<XeegHPjolFf=LgN|}QPkQHS&kEvx`24*MmA13!4{#>jerZNjV(zw+%p6QT
zcP0+b^e=$-An5;#FC#;Qp-B8OnEn5C7o3+{LhRV`)r2L!YGQ^E^tB|?r~2D4y_X?r
zFp9@SeGSEiKxHz5o^^kPvkyNRNa%}0s$Efwc3mjW*JAwIG(kMJEv{h~Nq8b5W52at
zZ)Dn=k6!St_j@tD@W>TsKC_oGV{rQlB!tf4Wn5|TE9)q;_aFzjmY)J&ui4NZINu^P
z%I|5B;pVCLTPAS=2e#;&C8^*SXH)WNusk?SfNJP1kSmW^1`RZk3=vY<p6`k))X?Ac
zL{;b85I3T+Vh~bQD-g>Q67ggN(c3D#;YJCKFP&DTk4mF98^1s|vxJPYW~P{L7f-q!
z6{2rg_I?rVC26g3*Vu<^c}-j3gs6*GC{HM*3Ax!-a!<V!_SQRFS|{`GV8oa_;V3Cc
z<XI+=ep2Tk(GUv=)d+Wc09CEiO=;R`%-gjg*4S19{JuPRddJ0%_-p%wz^>PqCJR=W
z)dw)o7^CXwMq$$ml6&tX;+$UE{8ChdCPQlU;wX{5P-~jI;_o_zBzXVz6~?7Y;fsZ`
zAeT6kFqJLj$v+!!)T$bdQ^O?Z?fqdLeu@$(Jy~~*;kCyi4`I=T)PE5&XD&CH;u=#k
zq{k>AkY48XCOb#Z47t0zNy}SNOfPbQONjPL7eq8xcapECq9Inn034Mq%PPCnh9IPA
zotE0$AyJG9LNv^^d51QM#HgPe8S^;~Y%|a@7$;j7fAY1StCw&p<zl)pMoU3Og@8(v
zcGwUKt@dR?$1{03Np~Uq;7IZtmcLD!fN!l%$-Po|p5YP-I!{XzK16`W`Zd7!!|HLa
z7XQ<%FuXc#P42A{PS4;5F`v1XKeNlxu9a*1FqkhhUCIg@sN<YzJonW&s~9n+WsFK;
zc~kb5=yK2LetWrr)+^`k7%<mdzw{n^P?YBiRJz~}u9tcxZY>!JP3TRfjljy}IsOXe
zr`Q2;#eoijxXR*VVW8FgR&d*BD~1eNa@^bKkm@Hhzm=Pm9Wf4HlhQ}ZyC6`f2c);j
z1pn^2tZNf|*uOup)Jf*3pi*1UGl$~S#}I=?3exnT3=&-kh=FR&@#Q*_y^wjN&G83#
z`=nNmznWm-s}(&B3ClOVX0^UZcp6JvgDH*t(Qy%*R*BHdp6f4MpWydh&99ngjL}<~
z;O?IPK7a6OK*V!_FH0(3O+7wU-buIZ(8#95Vjpk8mQ9K{Turb<p~Fcsmvy=2=s1%v
zbyy8)LLCc%0G$>HR$UeWYT_CDF_}<xWil<Sk5JWa?N^MY!`_1^0UE{81a-a=?&(s{
z!GeWXjL|8S3!Pnb!Fvpnqg&!nLIWL9<DjyPQ68*vR0C1Z%GhzJkmwMK6l4mcj8p!^
z^Xj?vdD5V#!C0cWubXPwtESC3oVjuLzS)+~!3RxGjofE6G~ibu4e$~Qkw^8-A7~_j
zM9|G|YnmMJYxj%)_>%g@<^2$v(BPiA@m(t#K?6OJB7IeJrdob+z-ONMVHDv+%x}`9
zyqp1x(vuoh1<EK$>bNu+ZMM%!38Yl!JXlW(9QL#z&`pPNqj%DG=+-)CVe#JX*YoEu
zm}E@HFWAMO5_~G87r7zhqLhA!zaJrrd^PK{!ol`ysu&2*BNt?lf6!&;ekKzl8#8=V
zMvZ%<I4;6$g2k%N)ml6oV11#GWJUREUX`a_wEb=)TTKZ+iS~>*kRc*U$>~i)q|UI?
z07Hblmvn8kfJ`#&L?cM;2!n)2(fe2ilJ91O35+yi63@u|%!fj<_E+|5sl8+W)mchf
z3#R@3wc4-umOvUb@vNNrxt>_dKa1ZMYw#od2uUvvMh#?QDe$9^CzOnrrp@ZFSkBu~
zWPbatU*h|P#{R&QHGJtOgJcEY_6l(uGS@8US83=!-57*95-000gUYfT;dyQsW0G5s
z?N4e7<$1>NdPr7JJLp;XGd6>Z!VI&*SE&6*0H~gTS{n)gwrMeVI_wvwru~It!Xw)E
zYD^hXVPd%qrCwd8R2Do!i@UHe=c)k(UPG5>j1du_>qdnL=LEy-tkZGX9Hfgeh<mrg
z3xd%LycLd(c81=ayOfuHxh&V~WoP{9ZhT`*VfKBB-2?)~`UpAQbK*GC>o$^%KPO=8
zV*FJY$Xw5t9n8UY7%H>qE&Fi_Jrrwko$QZhE<JlGsYD##(?*Srp{c@l_;W~v7kULN
zxPuRwfT|S~xfri;5dd9=l-n>|xgtDLZ$-ax4%BlLHsht(F#8K59<QFHsg*{|iA{<z
zjHN-1{SsG>_;2QOd5g2Xc93$XW2A?^@OiO$QciK@12_glrR{W{qtlLgj50-t`3oW=
zvJ}X<z2zi|FI~hW2w{=WU^h73L+HE0>!Xz^ZSDhA)gY4X7@%O#%ItT@*-uRSS~q!}
zex<=_*SK;nP^H;R&?ltt3;*HxjN|)3N}P?iQ7CRe;(Cmi|1hITcrJl-@5FpONlg@e
z^MDccpF-hZLp^_d&JOgLTL=7J{K3tFd+nAbzn9-=U7Xxd0Tud0YwZO!8b)1T{Ga44
zc=8Z&%}p|1@*a>Iyg-E|L279<j4InZ*fA6diS!;w)8CUpe`|y&s+&x}K{wSqSDGZQ
z56d-Itd%1Pt6HGlPWC{eaGXG9(N+$F!6cks3#xU}S0o2E_xLqPX`gk^aE*qFej~dS
z>TA`as8_GJZY(s^i0FPaA6?ZGJDx^WGfgc@KG#B3b92QXC~BP}7r&2D+f;pmcTwkQ
z^crgJ8ZToc>ag^ikJNB8z;`jz&adzXK_C5DF-V$38}^H+A~{9fWvo&}@uWPhlER?z
zg48I(`;of&6~Po3xbOZSU*s!D_`=BU1ka`CKRLs`qnD?&&`eQA#;Df!IMa8N^WI?f
zFxc>LV=lR)heGUvoe=4~mTw)=S*HgW!WwzY1r)t<#x)L={{=k2IjgXrPO3$U<&)~Y
zp2E3KX3+GyLXjK5imhtsO&3P##_!E1)?u)ZS#DiB3hAWhvsL}L8Gtjrr~mC^#dLvk
zr<1e9PRj2Hg9kZUqHQE~%Z?|r<^~1v%mhOAkO&1n`Rdp6i*fJujWnSqgLwkKNR*W8
ze7GnSvYtJfc%&BY?WK3Reh<~ZhFJwAuyms1zjan#0Bx(YuDntNk#U!qjVDI9muB=P
zn-!M^^W>PeEax`(lGqE9FoAlbpiuk%g(PNVYgR@g1G22m3I&7n>OLobGq)oK?5O09
z7xJhC`Cn37^W$X@WW>_rAh^%}B180iV<hCG%7GWYOvb&$S6;vJ9@)p1-&qtK50wVq
zwCa?6HfJs^R*A^J>BkdiS%@jb7qgdwPO7s0^S`gs)P9oiM1?z;169PhM&!jW88W1`
z^^|?ZPulrXDCKwU)z{=g{-)JFN(ol5^%_HEP|>2<O}_rkvrO|do{A(7Bvu8+Nv`hv
zz*}eGqezIMuQ*%((_Y9k7aYax<fTn;h&(kMMcyH_GX2w6Q;-Kp{LNY|itlmc!su7a
zxDj>%g{!)}2e_aiEvKN%q?f*{(->m|6bM`wIr8}|yfee!Ap5`iN`TirT3yrs{`@Sd
zIk;yiiCIr4pETmlp2K>L)?$@Z4LZbFN%_f|bOnZD;hDNbqz%<2U+{#g<a^h6L@6t8
zpVH`P`Fem<{=m5k20x9yGgjel6Nps{TEz&gFe-A4k9g`Kk!<vY)0%M*<Zv-8KowF%
zU`3cQONsR8IqvHyk^-X{&^3V&xQ=6<(7=R*f;v-kwG&I6!NDyRQ0?<mFv~MWIdNBH
z=iA6m9Hkz+H(7+r#7VFmMMwUUG2>T|q!X`ofOr19{0ySk<jN2ksOCsf$)=a)E<ffp
zJ0Zg_Jn3$2yn^`OWoA=JgEsV0(&lpDeDni7IGV7ageR!t7?VudTVH;qlrb8Wgv3it
z-5NilP>*|d%&GRFid>hXqNziKyR|uB(r2s&u8rSclh_yl(hp6r`HY&LAu=0DHk%ft
zSgPaWFjGV;8!~`16Mzo$7Q*mJHdxvd0hRhHI3-C6Bmy-&f3cFTcUb0Uxx%-6P`dt)
zY0(j?tmSavwdDW}7~OvhmF{M;1uLfDmDe*MlT+T7z@rl3LxMfM+D%N6ktz#bHf<_<
zLUjTpG<e<Svrr_gY;`TO91?YlO;<y?U`;K%Xi)%4#?@BdwW0#Cbw^9jI;Eh_Luc5u
zX|d-Ma&8^ZOJzr&e;(W)FM~>lFh+>kpwxec4CXFiDJy^Y8yRxtmd(krJW^EsHi+NL
zK5G8?PxoJqFX%i~5=lexA_NlHk>@*8fOePQ>Ib4hPjtE;R*TVu@qMWU*sRlP#*p0j
zx`b;`0AB~?+6lzTF0Fif`5}*xYctQeFDOGI0sZdWlIQ6Rp^$r0XcGEYtDBM#!{4Cw
zi%@K{J&&hCcK`CCQ-&~^Sq2|;mhXi-jOLAc$2L`Ze>&d`B_DS=rJ|SGbDH3yN|0uZ
z=t&`}`t4a!KZ1W!@U67-UEx!bQhuGcLjhgnLPgXsL6?}BtQlU!+gG}%BjpvSCI~5F
z@%?8NNE2}VT0UEe^lVNy|FebPr%)M_8Ih;zRsKdd1SHg64POp?tU=7Hc|&MZ{4eM8
zX7_IVa3ag>6Wi=^VW<jdu6a`(^Nv88_AuI0K$rjnVFcs<3RY&4hSuDs;q{FA)h)_y
zkWMXS5=&O;*4~52{br_|1+~37CJ26D*er0MTmF8LNn%lyqqLaTq+TJ%*H_?I9x%2Q
zacl<fctGzaF=mh>u3$DY(^Q1HawIKF%{e16TJ!wewhKb-msuiKx~%h%yOCRKz6&bx
zcNp|aWRNA5CvKryTYQ%w9aK2}YFLk=ijmwK<4n+M)XqFUw}O&WxbF$nrp(%wmFrbG
ztXATO2ta9q^+63u#H2pWxqE0RG$p?GoN{JB*!}hyDDON6jrJ&jEFstt|A$-4mLydD
zGgtZI=oB<~v=@E7wehC@$ine^-Zqxm=J0b-_S+xDqw&mtrKQ^pPF?@DEW<k|370;@
zIiyHuS5ib8pFhpRcD+0HlkF>$XC9>VHOnlEk}>!YaZr)!-ZLzZ->O`)hVZlv&zC0r
zu#a-27pH7C%n;$_M=q}eTX+-a-IPqbu)6qVXLU*b<vas_J)Fo!M*{Xn(~3!oG<j*6
zi+g0sG=W)9Q<CtUz7eGg{@_3$Eum2~tt%EZ2j;Dzf&plkaol?k|LxIkAY903WQ6`<
zvry_(@u-D9zj$+)e#-dtqcH38rHALDEGM!haV7<s$)-oc!C9azVYpC`TpTk2f~TY3
zmMob*Ag8h7m&G6Ux1<Cn&?n<U7v%S{kNU}ROH4=CQ(&&^y5opH;#VAVXufZw)~Dfj
z>OsX2iAg9~O>NH`)i0sXW~GYhgz{qaX)~b`i{$hx&ng(qBP<9RUw)k=>G>j3St|m7
z!6zcuf>?1@2u}~JM}=?{MJtOs{5aTLY8Wx}Z%lwT=%%nE>k4{_6Ag_BQAL{+)Y&pg
zg!l%zMG@%MOW}KZ&5vOk?NBkt$2!7H6$rySC?4j&>Ke_Nc7W{5=UZud4Va#r@Rsl@
z=!Eo?;@BNWgHZQtW_$lQ;Nt{DqfbC?m^?pHp6hY8c$8AVuNJ>7$;^e@c`~KD34~c>
z;ULQiMLufX?XR6bfeApk02=T48!K-pnzle5Dp8)h+S<1#m*V#32e+c%*9lNjB@@pC
zHNo&l2gK933$M+!?cnZWdT2=rD~1{R5V6b(V)7<wvxQk9eEo!@hSNYhHj+~&8l-Z5
zL`avQUGF(Ly)aZ?^f2J&$#`4nmZKdVy}Tx}P1YPTNl@@yVN^XT3*YA@zt<N5(Y~o`
z>w4!u^~{ollJ6@b->}P(ek`Zoo4WoZfsmeLU`fv=RU#jLd7g02dVC9JVY9W(O@K5$
z=;Dsu58O8ejT9oYLWrsFM^+R5pM8{_co2ih%ubzjuKv7-)r-rbIuGKpJB&Z<G2YlV
zEiY^5&w<9xLD;9TrSCVm`9;UPoU5Q~9MQh7{A7f59{NOa#BB*}QT7y6@9_=ec&fJB
zZ6+nT^9Nk#K+A6*NF2@L2}hCVM~FI&f=azdOw<+Wts)>V@Qtcxj}hvK2lBZ~Yi7V4
zNYH}b?|pkn|8B?QHdApkjNN*q)qct_LBE<5n8Af1Pa$X!@+^et;Ri;f>xi#Sqsj$J
z^^yjoR!@m$rSGbug`L{yzuM8#<<@60^!KG5Q1Uc%*_5l+YO|ffTvyBLN}Cl3B|+eb
z(})FC`a)%<f^x0T&K*u^bK$sm+tWDFIg&jmrnDt!$$}MtTM$7Ei6GYd*=*&#S-~pV
z6+L3C{PoH018i%30GpQaT+vc?MGdQy!~N5k9TlL08|2wCH})3$Qb?McDVLxa6j&JE
z*wu_^NHvV5V?D7&noRGeX`}WF%;B_Wdw;n9Xqp1O{xq_LG~kCr;vXmWUqtmapcjo6
z{Mbm&bu<RQ@8{H%{ODk!sJDNm?VH6$6%{`ast?jJL@uM<VLkeN1Pt%758579k-9JU
zcE|Q#SH8mvTr4VD1^-Wg4{zt|W>FwW0#I75QTB#C*UO-vIRCZ!v}2UVR40kYjA))q
zOLo%caB~#BfCzoT(=vt9Ryao)yWu5kdMS|tLxVMEo|Q4P+mjQ7NGT9_DNzPb?5o)E
z(Rm<MpsGbEYT8hizZ3-C_G^+9Ym#9}lPpe)gi9`pJYCyLR?z^Zby{fB7166;;!>BY
zrw|^^-&36tuZC2uB531gGD7yg6TaH7di9Mby%=0EpmMaY_NBy3Jipm*IODA;OiVAQ
zlAa}E8U!jSeO#_pQ~ms?u+JvjQnW7%=0S(Rclb-FCI>0)ooc-_+FDb8tG{XbyAtI;
z(=s?@$#!*n?^caUiT@v(&N?c}_50gHDIqnal*Ay2f}n&n0z=nGx1`j7qyiEmIdmfk
z$j~L-jg&|?Ln$I1(k1fVocH_t=bUxca;+oGGxxLay+7BrrTX+8ko?_71<b|F&S?@n
zo)Tpe70~UA=SVu_$GEPIU#tUqDH0iig5DVvjglv)!T*HXuOD+#=I1_uYs7L+28?(-
zn)+f-Y+nGwg<$^ww0@vv_yp=xI5z@PkRkYYh1LEBvZE4T+H>iBNSPj3^cr-`Oj~W3
z6FWxxYDg7PzUp97_P@6=F)_17k7*l{zI@>h;@6Azut-Qi8DfwM;^Bl(A;%u>K^_<K
zt*43_PO$${RhbfAV0w;GA&g*01w!RYNxyA5QyxIa)_>>bJi%j6Kr4PA<4Pcn?T*>U
zpL_&;>J-Lzyjr5`5~W`dG~{O(YN}OT)^}J=9d-!Omzf3)V&_jgKM5=&|Fmz#Be61h
zdz=O5q~KXft{Tg^{z|gs{?jIfbQ%iWWwn5jVy<EH*jF*^Z$Q<7TYm3D({qvLWva59
z(%rKr+V0+Z1d%YU%({RWi?5+hPU)wc-wUJ}@AbNmp-!`i%u5H=OblU*Q{AsMazIo7
zC5ZP@TjLrAJR9{aY^#52qrpV_@y~W@$-z3hk&RNdO{GpR+%VQ@MbD87IJ2sFjjZs5
zpt2_4!yS2iPxsF{#}iYmtK`DW?glfdQa%IKy6oYB?2%HnO#HZ|=_?X{=tjL%E-#OK
zP6U)cDV``cBKK66htBmAm&7`0JC!GclLW%o?sm%Zg;h`fk9{iuakZNOMGHQ?rnQ4f
z4U(TQaPB2|yJCUx!`Li2kE6RJlemX4Nb=IkzcJZtrB}F|o}qlEOqmFyo@^xtDPYzr
zVtOL`vi4?v%2r2vT5bhsRp?Fg|GPt-#m*9TUz}W=EO&D)xlCtVm&VcVrt`NP5l_eZ
z#IJbd<yIi#qvg2pnZh%}t$rcuGB$*)@TWJ*>t)dAje<?HJ9kN-Jaj^I0^)LD?)u=_
zyJ+^Ph@6lYkqXcTbwR4&%u&61x6E$7`_UwAlBgHi`G{ASlIyGib5AS#M6AtwF?IDp
zhu;ftWp^o4c<KwoPy=#>6Iv3aFcjr8HU-M}C5#nB?w~sM+Ht*i*e`fC{;bX*Zl-ya
zS8W?f1o<C0RVq)Z?GP1i!d|OGDHq0=HQL?0=r1MBjFfc-efDhEHYbbWo;SC{&|hpr
zaSSEas|h`pF4guVVj`hfh5cMVC}bl~3=-|!<>Efaa!!#b${wD5^d#p4J&0Os_t{Q>
zK~A$Jabj$A*nfTo!#DM2xqDSn8f*&@j>8O@?zIPe*(ogM1?Bq6f|`n_qta|U7$Miu
zqrNRTA*@!%oyfnReCm6d68byK<xobPlwebSD5uNS>5G~yc73tv4z!mtr6SDj1u@l9
z9A~gtRs<KgR9KcCk`=L8d|1vFeSCbO`CCB5*iRmSu*lBr-V2CAsCjI%+pqLkiaS3#
zle%JZ{%aY8{wyCQumu=x!|yuS*lcs{<m)HIArGFZNKRf$QCScu)4dPmTvdEUq4fH_
z>_Et+6*1BC&VqRMY?Pr+>k!;29Ah|N(|%gH@$ZjbEX?5X&%Snvg%)1qa@w@tck1%0
zdpd|zg5f5mnqdA=$dkq4LZMgLNho28tJWwlu>=^k*-#h0t79bJMxGW_lG0dfAoa)h
zwTEUmA)!{?UK4c<^BaI8Z7pUYiD@!~#GMo>$LtJi(TX$<OO|+qu#EKUT{Oi(_tiw&
z+(DFVTq3ty_7=W~Q{W-N$3-$>e9o}B=h;H@{slG_^px3JwNJgY3IS)fr%7}G%oIH+
zly4%>2%+saCj~bH7OSq+gLdK66PtBaTepY9KMSz=Jz0fdVI|odik6K9rY_4elOvv)
z8v#Z~Ri`X5vKI-w*b)Tv!h$<r@nI(%TJ-8zqP|hcU!Q9{WI2E9*fUN_81Q2Hmhx6=
z_a<BKL#{bg^R?&lVGbP=z%YcbM0+g!<~peai5C-w%VoRLkQFsG^3P7G*8S1aGhvTF
zzTpSOHL;+!G6_s71k(pulgEmYJO^H+&!@c~!|4s;x({*rU6QL81LULbtNN)kZewDi
zXdA*3Vck<4mF~AX3YeHPMuN2z=xT04F)i|c@3!N8nSJDM6s?T7n@d*<nAqJ=u1K4u
zVu~^8gU$=Nb`BKvCkA9JpZ^`(fpBJn&Vo~0GGXD6FHUKlRi~|f6j+}FIqi-R9K_xI
z-LrYk9&Hn!M>sJ7K5|rH#l78k*+)uG&t%E_PGn#|A977_?3bH#YFx3NrafRx;{DPj
zUYc*{7g82r|IH$IiVmK__TUk`e6*Xaq|<;MO#pFqJg!4PX;~v-sCkcrb^I!t-jtSS
zo<nkX?`p#mczN2o%fc!G$^B`rIG$xv<{E*jPJ)dRyeGlYg*32Z0^slNk3)Ceyi#@$
z{1Uxolsr{{_0vARFD=u+LpThKnX$ly0J-y~(Ft_sH|Z-C@r$CFW}UNi<NNsEL<V3k
z-Ui_6?cAo~s!3+FKjmrTnqB>86}vWoH^!7;d^<;wQXzeba?NZdsna>6)^{d+wTPFN
z=Bh}m5wt{`IV-s`aUPiAzPqHbGa=3KIJgLtcy6i67-rJvOyg2CCUM}yMJeB@aE1HN
zWX_-%-&3|<j$Zpt$PjT-T?~VroAc^fm$h1puuGux=3wi;c7SLF^M5gcdQ4!n#%3wl
z28_pElFGwPF7JSh1%BAPZEa-a$O*W<l>Iv#I-hlq5b>E<jN`RaP9rn13#@>JuVFnx
zXuVHvP8EQ{YX>#Jz@J>aG?y6~haZURydnN;Cves_m5ruFkZ{#YNkEngj00g25C(+9
z9mR<P^MWB5<#TWWme%N`g@4OYxw%DE{)>z4s#e!lf(l$E^}d|GsLS>oBnOiq{?)sb
z0`;J9O{X`;ebEU<(|owc<=QV?**qtY?#@|%5TIkRz(0Gy=y{2oQ&eBlJ=z+BOM`9k
zDkr#84g~SuTRs;=Iv5y|qqwNa<+L$P?$+i;+RKZ+W$a-m-u@*@^CblO4_w1%!{ZNK
z##Cb|^vYWXq<{F82F8wdgIw}0h&){>@09Z3Na9=DuTXeRmj6=HdkyrAcUNYG=lR1Y
zb0Zy%-d~%Za5I4uL45Pe-^e=gY;jNb{!}I!)(99%_J)co^mb}~>Ow9p5(B<U0U&kS
z1-fqi+{et1GD%{iVxA@vy^4G?mb5WHOpV9YDi>E^v#>K7adyYh2PV580`Uityint<
z>yEjhylW^+Tpsy~TC(3)a*H&m5+cF*specK<*<&i`tr;d>yJHu5)HHixAR3bu~y`0
z-~ZJyp=`p6tHCm~gV-wN4Ql<gM>X>gIzJshpjN$IgOF3E9ma)Q(d%^G{xj#Nzi=yA
zY3{T7%kLupr5l}BYMcu}JO5O2wkASuFy3Cm8LE#yi&akgQ579=km3Dcb`&&U+e6WP
zxq*D>0y(t~{>Ynv)T=J(5rb}@w0}6p7k<NY9)}0IZ*4P^p4l|QDbHaQd@r?P<u(9=
z2Wda{DM`4nqYsaVVSGQ-PRA~&ANykKo7=KQ;3}d|W?ytL)lz{NuTzW77xwQF<$`6x
zakH6XXm|l(Y9trbKv_?=f8uLi&+xx%y59`Kf-He{E7AySd;C&zOUsX!1*33ix7f_B
zKFWH;n4ab9B1D}vVNs%m?rU<J$k*futpcpFV9wP^9ur^fTAd&w*j2O)HbD~a>d#!u
zbr7S>0zo&v;b5o=!cr1LhJZ~t#&O=?3pWbGju~(=3dPXDRpB*AV*c;<C#qtZ5l4Q#
zkLh=<)(n^<wc=hnf@E>spwAmC`UJxu4SV^Axq46~T7CK1#yK{KKX{$)*G^VOiPK->
z8Q+G<j>gGCp2vaXUN*fWHA@qW6dVkXz0?Cq6d2Q|RsUpb!HzzeM(-#Qhy|&qNDLI1
z_ub!W4b=LIwImn3d5tt=|B_w8RTRe|61k>!aCsM_khw#3=WNZkAm3c!+%OwO=xfdX
zsu(k@D8zos5v7zJPObdva-#=UJO65zZQPu@{^Ta=V=_g%h8@=<hPQO#Z4#X!<44SV
z!XTW)34Kf@YEYEb>aP&GeDbn|g}|~Z>hkq}IWnU58V<CyqWMj@%2Z~PIOZs1wsn<z
z7Y%B0I^AMg)RUmiY5eq*Lb6E^VCQ&|O)kK^q3HhhlH;}h95RX%yAPQ^+OSmj9H+0E
z3eKcIu|}ygSgK(4XyVySfNdR+9^k|rCEbC8P(k-&Co`#E(t9j10wmP6-&*p#?F?9B
z5=m~y6k8X|(fG^XqGH)A&<?Z^jU#)6m{<o>?>+muJJMUe(mTfMRs+gx+6OeOVf-G1
z#{<EAtoGF5t;JAlZlxtjE0vXuUsof-FE*MHm2chFaz9p2Xb@$LsU$qRxBu?wnWkuJ
zoJw1U@l&`CPn3)1-Eb-Ib_E^q<-QGZe4eW7T7ZDZ$x=14Xw`fQ<cxl_>59@Q&Sm=G
zM;^hX6E5}}sGi&#mT&J0$K9MN-(rSXNA&01+erbHz3WZES`;`c==Q1w9mM6V>BjD6
z<X~W-aHZ8Y?R(3Vh~TS6a(iv>izd=`O{P~O9N!FM`#FDziln4#Do)6m&8hq@EHB!D
z>96<%5lU}(`M0Si8ez4y#(~mv_|}io@UW4_z;)rH>6ymOveCTDYyb|JJBc<8;hA6y
z^7HHmK-z`xBJCx2b^)@T(6j^+%g)gqlF?XQAV+`i#&O`i1CZKxS6%&={L8B|#6GPc
z!D|5l^kTj_#2G+C$ESt86d#9+0PKH<dH3m)sLKcy$uf{10e=XLGsAAe&UcuZo{C5H
zs;JlA6=jR+9a5;fC&2De*X+~_dOAYV!~33$06L6rS}NN5@NwGEO=30D?%%zC5)fx#
zLqTD6f&AAfeb%Y_|ETh&UeE>l1qy?GZHsX%=GMPO&szU-UDy4o+kbn|21ZK^H+4>L
zRBv>q&vE^@sCvjE<*Qr%Z~sJs|JmNo8&!tWru&{d!HOH)AsIMcJby%`ui1LLgq_8l
z)qXFzjZc7fSJyA=p8fid6{ntFM9dkk_S?a}`HoM0bzJ;<I#)b8w`b_*9jDMU#1bUp
zW!DXhn}^Lk0Fn8ASqc(c40V8J@%~$J|GP`Hau{@to=#M#X6t-b4!H!HzK)Bfj0X-z
zqARllg20%txO1jo(bOYzNa$aGT{AlkxcI^%AN0<)#QLk7-|wM`y@~5HM-$f>@zqbB
zzgFBxhz70RrPnc3H!(~JzP`M9$^fw&4mfwv)O0<)8mlz~zxw!-re(md30z#`kkxJc
z)7!PLW~{!=B02>gyOxF*e)M~%bpP_lF?Du5AZ!N!`=+)F5x?OWgtM5XR%2$1e3$bc
zd1MpGkr?ie+4K=lqMTaP-Y@Q9Qg4Zk)0J6uQJbfp-}$Uewr}0rYAD^3f$UG5Cr0-U
z7`~t%031on)wQR|af?X94yXNAvorXncdVI~aI%FzhD^|3gjs`5OU5%#tI55#@^d>d
z_fl9r*GRh~NA93S{zse>@`RjT&fej178!pLevWt{<>qtCMWMu8%(TxaGQYpH_S|bx
z0-8$lyrv31p8e7i(NSQySRqbPPMz4c|MDti<bQ*)Ef#Ic!EMkT+x^$7di@?W8AD_Y
zB^kDT3J~nfk&h5zYVZi@QN28`RZn3gw;5%wElb_tzPDpAYq(UZ!Pg5}h>1v1r*Ebl
z_4$%Li<d&_uv|<j7l`F={If55_#=M=5+<*e9fY}#jmEN^&;Z{%mwyR;xhFHNxs=Q=
zwVeA?I4R6>&QuxLg!&8Ixsy#3kBsNt-Xz49)E$S*R;k^_vK(Jljz=uNYd<8{9{7Or
zuzd&%8oK*Q{%tYwB34`V&D75fP+4fe2GlbvIjjH%?Z-aF2l1wlp+)cpAJ)=^+Sv4F
z1@#PKD>)P@ZMJ%{2jIxr5dYgJ)jhe$I&27&#C+A}DWIPCS-YN9m)4&e<7eGJMTwEK
z7BhSiM4gluT=PQIoiC$23$af@c=<7=a1LTi=fGZIV}hWj%JS$x5r#Q5k%1mtDHqDi
zX)cMq+V8?x5WC<?;XQ0JsTPw_HZOsSTSrr&G!aagAFLDL)G&Nl+^+H8TzdP(_~AvE
zJwg0(x3&ED)NUFw0HQyVfl7`#uxC6IF8Sl5WX-<-lcn@5jyGoqZ$KjFv{dJ>IWwxk
z-`?Eo4r?jJ$`Oa!u0N8NMVJ|S2c8tt8If7tvnP~e`pB%fQh}Uueyp}zwqI+Hac%>M
z*ij14eD&Aem1CSj5k`B&IsI&Z4)B3|nf(KXL;d`uwWYEN{Iy%>4G}XDtoFE9y+E7u
zv?hZE@lot`dfqXP>>{=_h;^^M0^XceT2AL*r?QC3`fppW;3HB+w3@jm>=)uvcC@zm
z4{HX0Z1KCea!}Qs-y|T(Ny}m6eN!fz7MGcG)f1db(E<b(008aHD!u-__;u?B5p;Gj
z^_Hi-+EbA@?Y7?j57Z!oPf5O5mmTLm#LcT$AR(ByNyB3Yxq6h;rb?+SB{Gfp^GriA
z=cfECGedbuBpYf_gs~H(xSQ9QX5vd&6rhDK=rL2$(_)~xNeOwPX2(3=7AtsL!6DM!
zdMJ${%PRTy>vwO$2i9!whLj#_C2E?_cDjjMg(bvEJ7%vSD!de@_8DEOi|&6#!ENI`
zFX<J1tNG1Oy70lhPFN-Z8BW$6P-xr2v!yMw1z|^VT_jcb#YGiu<OfQ;N}Q1S-1%%T
zp0^0Xw5Lu_?|Jpmy`>~TLrd3MxsD8hO9n%=hnFRROT+L}n-z&E%ext3?%J!z9BL%r
zk7Wa;&^FmPf}OHJITM*YE#YOr5HUkOt*XGr13zi_KeV@3bgGpqxwf$PtNdo?<xf_W
zsY|BvGHwncyZLH)E26XD@00N1^F<<7OEdzP0A4BOsF6)f24_|#qbhmG4z3(3z#RdB
zkT_jB8BH9R$kR1&M~~+<WvdW#fZM1Tur=8LYf}_2bdz$#D^Lxf6##>YEA};zr7R86
z9DYxR&{~<4wOa&+KY@3JZ)LD~e2etwOY~OiVBZe=o)o<m9G$7X=NU+@kR2?gm-Fht
zMiTqm;orx^_iAjs5?EqcqD5$I+>(G+tWKU*CV++A_R+rd4<m|h;IC*0_AEEq*qPSV
z!ClPgzc&$_TnMe-;~K>L9S+Pq{F9@N$i$^#)kNCDW>x9q_KYOQ%yovzpoWvGD)D=h
z9-AI?6{G8D)@V*a+cq4~cDNmbsRN^{&*|a~WsC;yK4elWR^0CYGXMe57IuG`?S{PA
z(OP=&ast3%Ca@{%$`bw5+EdnzDpYmtqG>d|ATJXz4YK`EX=e5?oiwaI>;6AN8h!ya
zZf-GlgKU1;C=#e0&D-X;j}pYN6iH3lZCN-<#D#!sYz^Av89$yXgLx_fF44gTmNORo
zKF_xw<Qt&zbC!i_NuOp~R3rS}082?0AodoJ_@KJ`3Iga>8Tr<?J6zA;Rx+mbcV?3B
z#l+9e12e(=G^8ujrnUBuJ4vZHVI<ac_acNWIwPqR=fk(++hZ5C&BMFEzXQYx;GDEF
z*>XD<0!4}Hl2hZFo^D5@xB`iYMnkK^*!)c7$gk$C<0uBu)qt9gc`0l6o;gJ2F_PkD
zzVeyfm|%;@p!UZ3W3MYCV~>4)Z>BM<*|noJx-4jjW=a;wOq#OF<}Mn+)$LBJq*h30
zDhY|9X>m>b#e&E6j>XjL887LKY_IQp?!Mcb_m9L4zIPcAFlM<jNQrqnU(oFxPE9?=
zY^BsNd~gf}Kl?b~;^>EZuY%SH?0NN^CYx77PrX2yKsVgmJm0!Y)KKOeHMZ3^^d`}+
zN}A15$bAOmD|&=k6_B*{5+PN|pl`}L{Jt?W>WJe9eM5g1Py43^&kamy*&N4w<^NpK
z)auayp2gUu?R>MdA#dz->y(PI4G`mfVjwV*u~PHUk7C;RJPmb?P;J|zYV{pFo1uT#
z+UL7jTJupy*}p8P^=lL;{dfM|yEIrTwh*FojoNICt*Z@=`#?w7{M+gASntST{7J+b
zjI6f1`8Qu`EAvV46-iB^YqI4QwP&%QkT=g&>(7%nks`i2O<yy<wx1(qzV|JA`YRPu
ztAC<hS;_sF=Vcb|4*C1fCW7ll7KQ(z3vZ=)HVVQeM-!G?#ipJ<IrRX0)>kK;=lYhv
z783xz%^<e2M}Wrjs-dbC(kNgW=#--&*c!yC1ff1v3T+Uq@D=mgJ{UNpscEK(W^C*9
zjv`ltFO#c!?E~Vn4-{zvj4LXcSkOIA@t_D8cme3|RgnTp%)dI3&|d{b93w|nxRRXj
zMx%6GO%4xNLckp@3{!dGaPioqcTWy_m)Za_{=_{I6@$$fvs0J5Q3R4m#<2F?wo=_Y
zxzTn<(QCiv70nc#FEc#jzdk6ewPu|-9QBeDKr3jlC&s$V-J+#>DPt$cye?o(w+V>!
zM*LqKsimD193fr^cu^Db%+kQMTZfn9q}J2fQ&BmguLGP817f{4*ldsOox+W-1%|Rk
z+A!O<OAj9gs1gm!0AdB4?5>d4(*odE_heQ8cars0RJ0K;AOF(8$MsWXORl!T5&Q><
zIIls9#EBUD%sxrX2T}|p_#aKD3eqJ*`Vb8O4@3N0PFv>Y<P1NN0dK<{NGQ1(U{qYm
zWlwTz3Om72?E6BU5?V@+ytzV8WKQ=1cctH(A$7Ko;2#&auoV@*gHwf=`R{e0m%V|Z
z9rDSK)9sZjrQ`Ulg3TS*@q*G5-U%H>%^q2hxinu~=||@CH{vr}JjQyt8<(Scn-A$g
z7lb<|@cxTMN>cy2Ij435XaL>Bfy5ohe<?C7W=u@hmR{YtImF*EO&?t)jgvmhMA|4)
zXL3;H4r$yn&{Wj_bsOgHt3>(Uty9|^KW9Zlk=2YKJ0Or8KmHM&Eb`a${|2%qgj_$S
zdF=ey5)X&i=wT5_oKIS$#_vpwz!mN@sP5xah2gXV1rv@`Ig-Gi`9H)>D#gL>s}6f8
z=3r%|l>`C}Q0P=J`wSR77vX(a2ugWwg5ye%-j1)4_%DHfSG&!1j!)Vmg^K9Pwf=+)
zEP*L|ucqEC&NMvs)w*;bpHq|F>*)agAUM&^!()7+$s@{18tV5?77`WMwxkl6xjwEm
zFdDS$+n~6}1cN6(-#CG)1=%AY&5fYfumJF5h2#95{da<I*-e@Y?q5{{*B2Iexm~}_
zmM~2BuI}a1Ljce_gE^VU1&K_m&G|f|$R4Mlhc0jxO1Dv>M2fN+R<*r0NSM<zHoUX`
zP6n-D6KO24%tZ~{1s|e?j7cD86Cc<hXD8D`k0;E^qkd<L`t<V8h1+`KE286iz!8Xj
z!%WM8E;v2ls&#iIfgZ`<Ua~`LyxHpoo+27*m*zM?Cy7BAhufsHMVGm+R)(<EjUtha
z55LiL)ZSCN|KL+LhJwrB>+~c``ySDxhFX%VwTBw2%7-+JwPI7J%_s+G`qI}Zt3L{`
zxK~DHCQ>n0N{boMKS}3T=j0)E>#JP26@%=SJ8C|t`*^|*5kuoc01!M-lOo!@)7CPr
zKuNU*(nsHx5B=>zS)IXc9;gIqK^ND_q{;x2@kiC<gCR2uN>IIpuaAuY95Hfv6-a#G
zCL3H>dUM^D4Z^+4fExV_>S&Y5fSpX;2^^;j>}vrDoxNCS_lT1n#*EazD?3FVdiXiq
zj7P!W5-|qch!Dj?lSPi|tTHr!eLFIUuUGC!68ws)ae{-^NW)GesaKEp68O)3>J0!F
zB7dlhIlaO+2z1Kod0fVWqaZ%*Ss;6K<ZY8u-I@b<{T3TbCh(I?y>v$8bJ;*D*Cy)m
z{mzvu+qqaH`Bmt$*iZ`Dbk(e7HcV!p#4wM0>RK4}f0199f~@uBfa?SD0R_7(2jmxM
zPpa=y_hRJr9p-(WxmFX*o1<=>cGKm*K{Z*PAMe3{k80aFHd~DIuGSh8vWTi==Itw;
zPq2xya(v(d;h^0i2<yc96Uxd)+xtf7)WILxGg4F5vL^j9ha3!l5Rp~|`9=cFim-`)
z7%!VRnK_O)X;xK{?e0Pxfw#cVsDc|Z(zkr0A%NUGF{cdI79tMs9WuqK<cQu2s@TgU
zzS}pdD5~}x(uw3Um|=$@-<a^nU$LAw%8|%?M^Kp>w7|S2TvZhg<ZcIIOyUGFOZ!#k
z1DSC<!gi<n(ffH#Y-<U3g`P$}3cg4TPO!_54i9h-^<T=Q^$+L7lrUb>D*UrgeL_{f
zO!uKhP3COf>dnt_QsYRrImx6#W88zpAMX!UaMywc-upB_s9ZkQoN!E3l>zv-i_y!6
z{T7+fmRtGq8Wr(sa#aR5e|4V9R==M2OiD+q4k%qBvFhob7@pob6W^#N8Cd<S+pjE{
zmaTZ1{_&cVA0%n+)@^!K{`AGfSFDYgHf7Dd*}awowTe|Tg)=z2o2TOzP1G9<zUIiU
zKIQu{O{`Tk4*ARUu67mc&lYRS>2PYY#+6w?&*aoPf2~PK_GzeO6PD%W`(Qh2Bsa+^
z{Pev50hnPM`>`)#4i&bps(W5{ZXbQBKK84nPPvX|H2B^(Tzy3)vnH^`;oy^f;x@4u
z<!^dOPM38>e2g6LXvha4^k3lVKu-7>qPspaiwWiXT!86qPSIhE$3(`s!QSvCkWHAJ
z>3d}S{FJIYm#KT$Bhk&U9pbRnZ^LnvYSm^i<vyF?26v4~j~+Uy&pFOJ1DBln>#x@Z
zAR;tBvNV}@`3u<m0FiBUC+8~7{YG?gDuQ$ce7{?nkVh$6@J6LKxDa(6Vt3CbQ}Tq;
z^4gra^uzQaYfiex&WK59t#51{klRsBgN*U1gyELcCD@u!TKKkgWbt5X>Zo{U;>xN8
zy{Q@DP+(sz(9m4_mgkURO@d~_pdfuh1kMPCJ&q7tKlw{BCwbLxQ|xm!QO0Xjk)Wr(
zB0hDjR*<|-6iMStYO>rXibx22UHP3Y3@%#%E=}_gD7rKD-SBQb0G>L0fLj4i=m=dS
zi%6Rm+^U~mc=f(M>i;XsltNX(HSai;x%h`d2ELLFWh}h?@%nUDW)|@dR@c3j?f8#-
z4ZxfhbZHi;e*@&RRkuLlYOJ8`Mgi{SD%OUmaJPo#jrl!N?mvmV7`bhb07yT-V{ara
zTVYUHK#?ctJ(Q-h<I11nx%PaaT(X`(OOY)E3RkAaT2hF4g#G#^dcGSE-Vy<_e9^p^
zs}-~g%`34*PuWpuPYkVEDCedRRU5+M+Y)lPbVPuG4i?VR*%$otn^DE%Lr{4};>A1;
zgwnAr7cARl^}Z5uQ>!_=OVeR|p?g2PaYhSWK%(H?Qp6kyg;NdoQ;cH&6*f&P*=nT;
z+tRvj6HEPTqK`kWZ^xL|;2Qnc2^Q|Sd-p*3CVwb;eBM}f<*qA11M1CB+v*j}FKx6Q
z5?XviXHbasOihiD#MtOpT4k>J<;Wt2zhYR1ftT_B`dRZn+D$q3kC?Z##22nJ+7R7H
zPT!|44%<^19(uhYP$P_``&&w3r6W2G)&fiL^LuB?Obf)r8H!RZVueU&I(~d$d`#KT
zKjG?cXZKKzar;*LFjD8+LJn2;<!IKl?)+N%{Pf}^_G-`<f%N<58P!Xsz*5|BsZwFa
zcik79Aq9d^_1<Qfr@gg5Mv|bOwi4hTiU$}?&l-<f-$%H41lWp2pI1}o5}q?F3Tt>e
z;jyRAro9HOuRkW&M>5mai-$A&51UPb-`#_IIS@KV;LF$M5BdYo4%dI4oh)QDhf%C>
zZu0}%1rQW75hZ3Wr2+zT(b3<i{DoJ$t*7a`t<))`^*n+C79q`Y+p^$V1Cne8lzxL}
z)zj#_afmGjJ+-L!JO_P$_(E(PA)SmjuJ81T;gy}AG#YpEWyeJS6+v;w%-srQzrqO;
znQQvFYOmF^*K{)l51h+2mZ(>8d?h)V3wuXQw7lBzRk}y*i4`<mi?PNvsJI9_n4EPk
z?mZhGvs3z1S1y<!%?Vx<Ctfp^$G9;`Zot$Wwq^AlSzRLYT~x~mjbGX*ky24gs9HMC
zFH_oqY58f~aau%-&<M=|s=M8$+5QhM|FSTv`V?cn&b5*Lc@;Q)HJL<tavwA5;C=RY
zKeInjshK=7nKHqieUc1r#<(#j9FCx&qnqRkyuvLzDYq27iO)PTcN(|(2JG`l&K|U4
zc!I<!ler@TkPUAy?1npXs}83hMt1ytP*^%i2THJp8((ev@vRz8CDjZG9(%UD=<rWh
z<yKOfYrUYCc5iM%lZpOhed4Os+ssAuok|2%IO_z7=hRLURsE<*w2q$R-;$Y0VFTw+
z8g@lfu%ew$pbM-dqO~noXUZ#J_z%0?Ui@oKbvNMFrIY_Hxt<a{EJ@JqJd&Qh2{~Df
z^!=VxF&guF$|Q_w`srJQ{<bss|5aA_%+jE(-SM7#?{<t@BMjxS57d)@du3sv2FLAg
zhGgZh&Uy6phvVxFh2@XZct~iDsGclk@{rp73{EBL5|04v%7#^-l!%)r17S-n5K4%;
zqo}1pX}#9ib|de(btCT)g#1xpyVf+6p<_j%YQ-}^e3TA^n3xt%mTZ95@EJg`Oe8Y{
zd0*7u*H!|kTd5ke{5JxS!A}caFNh&lWaZ#43K%Ph;Wt3rAheXR0>jKHJBoEjE`rWA
zxgPGl2#Qeh!;L%!c2;$9VyQfJimbJ0@iyy4s3<yNI-J6P>#;Tc3km}Ya|E#&?hBdX
zOE6?f(Ess!(vs8W51rw>-{cJKce*>Db`)<xz?F5atH$oahsIx>sW48d(`G-+x>%`G
zj}^q^UnC}TvZAVmVWfeAj<<gd{$xSZRwlz``2u4KQg()?s()dL)wg}9i^QNn!+RMR
z?w-{af0WmvbRA$&Ko_L6G7s_JyFEr%)!bl8u-uzEAIYH}IpFY>&YB&y$<OYfnuoH(
zdVshStGt}KxO4AefMuLU=j?CPz4}X_oVg8odxcGv<y*<cl+)`s+u1jGUQJVt1cKkE
z$0tdgQ6HIfihui=Z(VI$NC#PJ@y2+O)eVL<n`B*F*0lPro|RZUXAFg*2pyH_l`iuF
zo*E@Pn`%9LPQVs(5)DI44BwaLs(#x0D*Af~!N%T45y>w$qKYKk)sEzU2(rIOYRRIm
zsXE%j@&3~z+=$K?Zd^B&(WeVkp5ii8j{}J#m&fcfskB(bCjDhAK;Z)XMkt{3xhviX
z6e>W3_*Evv-ZdKmVPGl5h4#h>1@>wBy*M5M`gsOV76(xrFU)!t3f&c2h_7hlY_Dix
zA%#tlBTN408|$gnT4NoaWHyjeHe5DMwTa6-p@M}Iay#DK$z($r^<fh!v$Z$5(nuIR
z%YPN`Zr$!bT-Gk)p<CD26DQ<>MIVBx@4%K=(DiSFO;?cLSR?(_mOn|!$i|Ms=i+1t
zeqrWbyia1?XAEbpq=nDAD)~K*j6=$)a(Y$=#>T>ZhvW1M9a@kNI<KlVDivP;l#fko
zE-)w8pIAqW*yb&MDiG@7%(yKA-ZQRU1?!Ok#9dop4sRDCksQXKl$RffPL23PR*-QQ
zn;_S{d6l4_6F6ZQ{9yr!^U)vrCuHm1Ux%k}{aak%vJnC&Ga-;%`2D%^B$7$LUe{V#
zcI$6GqBDoV70ndzqr&yI&2+S&9#}6b?z+<!j@1R#)Uo^&3>V}3ET$nQYpB2plv_p5
z$pzdk`7jEB_-qh$0^Mws)KriDC0vib$;Jz_+Gm~oNAjC@hU|Ci(}I+!#c3O^?A)RR
zrGl37fY;P87x<h$heVbvqI(ww)bKL|I|VUhF_D&=o@HtVP|Hht|C0Em5ir(7%k7?v
z6DrdlN>%C+IBc2kH)BR<9$}rZ<7$1ZD|M#<x*H}O1C?vN^3Sc=_~{VeD`xs>kA`Ji
zp`zL78#(44a?CfG-lK^}_nqV}koGSF!4mVWxX!(1xg18-U#Gypy5KYQ0Mj9MreSf=
z?DddjwZXo%3Avo{FY2CP#J#s|A*zTb;=j)Gz&!L6T;ej_8UL^e#q~;hWMdB7Nv6a|
znkCL9rf6nT%Yo044kuLf)X(6A;~d$@ILsz4=%7?KxFLLi>e`_d=RUcWIZRP4%(#z>
z!g>v{#c?p?u-ST`&jy9=JfNHRySzN3zch}YGF<<`cWW$_35Bnr(7u~ps()v48gsZf
z^$>%}ju}x^_|xO-XhOWE{oei|e>D@nzwX+Ap<vS&#*0tIuO=GuWW&bOg=9XgQLnxI
zZ>;EX3O;dzKR#0)s|3$#id8p>z}(SS=agPylWN@FG9Rcq#4z}!<5MEsQ;E(|_>&)l
zQqy!rFN`Ug&dd3-=h`#tu`IXHn%)=L1KyL?V4Buj)cV*-6xC{TWuBWVK_W_nSv?T@
zV%LNU9=e?TOX`spV-0B&vXp->OBRM!Fj(p%uO!WycAMGJ8VUYjFO|_7dG{4-XM*ml
z!jq`u(2L8r-%kxI=v!L11zufW{<K(rdq(S*uEAeY4)d>H8@Ueu&(_Fs>+i9^pT9Gs
zPb%LAhobTS*C|)KeENSmOePNULVU0sVZH|O(&AWYeSS|AGG<-kF#5SrSP&^QTKS#e
z&Gp&tstNxWP>aJU;U-+fBV@-BtYMGtyG*J0RofO!*%!uA<PptGXsVK1a(&1fp@u&%
zf)`xp)ZPXW^z|D7nGI`p6gVRmCOg6S$9VPW@mWPF{wPop&R^YF0eP<4LfX0@WZt7`
zp!8n%Sp`<Fkr-cwUtleSQG$V{hCrOcFu&`z3{qJypJp@NGK<NPdEaHOTG{Iu)mn_7
z8do&hom+LKuu$+|mLKWGe7MOqJ2x&z1)dDC#ka3k;51H|^q#SXr7X1q;keo1fnKRJ
zs;6mu#UVnJ`eKIolRRUtL%MX{NaB0rfBw<(Tm>)wZR=9xwg7`tz<^8#?<i3mxxg*Z
zVRo+o-y&XjMXpI|TZb?A74jB(k~)-n>UmN{M|9Hi5L=m&GV4flZYk<m-(cE_EldjP
z{!=W!uekIDZ)M&gOIA&!)RWtlx=TOk<EQ!4HDd=S&dG0rW023^sU*8VG@s=#LxVr~
zB*on+@I<fL3I;0Vkej>(D1BoMr>FlfTr_Md$=3snC@r6<-VI_90kO|9+J-o<3^Qg5
zW@fQ3h3!n`1Gacee_8OWX+HVLmpzQ-t4zZDP6Ef)tzvJoqIgo<CY8fqWl5f%y>3*E
zp3h1)p$!L2DOgG)Hh%rxaX8B07R`$stW~Ng-&lu?fYJX<Yfto-L!(;zI<gE>dV{G)
z8TTjp#NXu%<$hRwUsk1&0iVp5p^Q&R;T&(T1Gh)=uj&L?m4S%xYXR}we~5;#mVRK4
z#-mL<I3%t{1Wc6F0oc{h3syCv>1s!o-}I+ANJs*lr*EX9V_O?f;Ny3-4=*vTE|6x*
zDN1rMJ|{YUXbPHgkWbH%(}z_Me=w|#<1^6DPN5yY2|$Tm%gED?H%=eTlr#z$#iWNc
z#G?mr)06G&!p!lX_J+`K{pHC+2GY?VwpGgo+vZ;|(Q)|fPJOg(QQ&lcwfyN(!=nJO
z$3%kdkp8u9yd4g#M^wwAZ>x*0u0i=ATGCtbcW(XaBmu>n$46=W_7=9CCsvc)bXglF
zMme#(Ndgg%)%gW?5@bhD?$?%g@mN?83%}bjy#f!rG;Y9yWGTHB0)?$R?<aP#3lu0t
zk1mvgIiVjM6;?T*JabD!tg@6;9!xx}D8Oax<&THJ_|#uIjW7I+0|p%CE5<DN(=gVX
zj^ja4z#|~oukiG2^rIA7_8C%~n{K`fJP2iTYMP<k2+P92q<a9%Zq3UX#f<1?{3H|`
zzK`R37bV!bCwz1b=>ka);_~vqSQ78j4K}Q*<9F05&vUPCfmxiC9lZ>Avv1+tUP{Ty
z9-}rEAEH6gKNTOE5iqnvZ{(l6DcG5`e{kfjNQTuWhU+g+ClEQCaR_-L8(WaXD{=1z
z-OPU<6I&b%*x4+x$-1cB=84!kLGg^PpSMO6!0hZmfz_S~Bxv~_{V=sL5CT4z>$kx~
zfAI9zorx!vpxjNLWGT-HRl&}m)L;e6z+X+{Yj?G)fk4r2B`=zyOf^cr8b2%V;QxB~
zaE}9gHbpd2Lk*i2#k;u$F(TF}pneF<C`&k@H+@bMpL{?smwl(ZfBw5pHsdz6LQ8SU
z)yu)#ifA-cvHB+d#abYgQ1iqyCl>HXG+bHh=1ez+sTW~F9LCBdR7#YG?cYE4zP}Z3
za%88W$o+c5K@uwB;AXCHcoG>%-WMm^y$wR+QK*1GL}unQF2gDt#eDY22!-)mqxKA}
z5u2l=R?tA|a4>v>|Nlr-{trIR{ju(iDGuyDGPwQ2syWk5I2A#hoZ&B0eoObzXG&j9
za3Cj+N0WC9-+0gX4BML~LnAeIOlmYP0sDG*pJtd&J7;HQUfkP!Wiu~<e<+<&n@Saz
zjB>R+R<;ug=Xo6xp_GyRRZ)?3?GUKdxFi1P15u}|gX!V*yoL4oYZ5deGL%;br+7eV
zrtz#Heynj+p8_p?nWx7qaFF1j-SX7Z`&E>BU0togQ$J}sERlQm;&#9#hjnJo7ye52
zV?=rLg*Ijd1k7oUwWPZZ;9Fvo>*fN8r{Q2pjy!FH39Ffw#%U+2YZjwa6I;YX(thd0
zF|2BLzNQipfJKr<oF5C1?3xR8#pmL`&FsnuJPtB)-2aRydg2}lLRr{ei6>K&GJYXO
zwHENZ0dKii+0NV%Q+~=Uz-+wA7%>;7Hsim(8GYLUmBXsI&Lm$aof;TLM%cJWg1qfU
z-%Evo<+EMuj2}VLkuTV>pZFMYxuEenS)M0|uF0Rh9sm7b2ir2toGFQWfXm_FaZMZs
zSCN&9=`nA<KbK_OGw@0Vq8>T0kAt7A2bb|uEND_WjzEe{s4??XiA*4$Tp)N|tr6f9
zU?D-{*q;`tg&B`zpW+?6mA|y(n!wJverQz;9vyBp=f}4)i%!feURes2tow0!wt1f9
zaPxtq8RhGWUa8zNs;e(y;!Z9$S-C4OB0m6m4MBEi9u}5aoQ>%)TSV79yK^uvW>{CI
z?U6iXVJI)u$cVC#*?unBn(;Jov^$x+gcv#d8w<F8(VM55fq~{ON|ZJ1h%w(y90=5V
z+Gj+)!eYnJSPPLIo)uIPsj<6|B3I4dm|F{+u;Io37*R1FlJu(hBU58SU#qcqq)705
z{Jy<y79@EPibmnuiZm03%~)6(+6S%@vFiWGJ1GNwXYjQWSQPY>jYUhmQ_q($Jq<-W
z;+zrf41Uj!z)vUKe=RO!#tLULE5VJNFWMPjlc}ACQb>oHFTSx293?EK45KPM;6x5D
z5M8;#swM6^yV7yrnN@bAxNwZ*;X;(a2)_=~zc$7U!4eqr1Sds|-aDYUkQ~SyRJZLV
zadGPqCt8jok+*2PXGi^mrqpnF%*aG#5F(h@rR7XI3l<(Jl_4|%h4=eZ^`Q0hA0c4C
z(Xs!X4b_+OfgerF>H<S)X}$=OW@h2;x=|#`?~hgbbnPz;Hd8WmgMYOMQg|Y|dvc_p
zQzKZdF4Or;3_mf^pLh^=o)br#&lOF3E7?g&GYE96S;Zk+<jmJIq-{u_vADXF6YY$2
z6%!@pO!0Y=YQ6{q_os!x#8XL5#W7?Gs%Y_h^FI|jt49HJ07II5sfSi@5)~iUBE_xD
zso+E_bkYXUNwB{oJdt4)eD`EW+crCv1+5U$S3X*iyjt^Cu9oMZ=No}=Rp6+EF0ok&
zwci;9A&svR?H+KtunIKJ01*&4Bx_AP2Vb<^I$QatW;5lyba&4cxbCC{tN8$nq*<J^
zS#NDu?!*l+Q7lvKM&q6MXVp6vLp|6V0jc^D27Zp@E<LM-R0e4!J~W4~kL&r1>Q8D*
zURX1&uH@un@ZR=~T7{XDKeAof`xZ_XYoq6)U}MbUuQJhvF?Uze<kMDvh|yrOFXkpg
zolPBGeo>apO+|v9)GAaiPtQ)a9AofTNzLGDfEBG!Ag-Ng2>C)B60r6G+6@E--GG8>
zI{vW`oTI1p;`=1>U{iuhH(Gh8^`!QWPX>}cuNJk&Y_Fuf6)*~NlzHeO1Ii{BV&)xv
z6#-{<zbX#v>}c?zG^ER&H|)Ncv&rtO;s`EtW{;@Ve16rhdxN*n`z(JFG0vp9o1P3|
z?w2WA)s2kP0fNI_U(nSP5PLH-mv__Dhb#m2aMawC@BLfQV+0B0M$oP-k=+~be6v5{
z^ycTHhlnLsWXN0(6EkaLX$tU0smYC2r#^?vYQqOKHF5&zwdV_9aDfNfkqnX#Pvk64
zAM$Idj&s?A3y+7As}x#9`S&cKOdJCxk~g(=x>5ZWMN+q5{S{i#j8C}0pZ8T?`*;28
z)-aqIq44|9@Yk=qeh@PCRQlfdRh?5)1QNOVcZS}>&}TT@^Ih`>YQVKdCIg7s0j0SB
z`BC`g#e;I~>DvpJTIAZp&f=y8N!F7(?w7OS7DC$=5<+hj8HSCQm!`3Dl$<Uk7DBe}
z!|IAY*|#Y#3H|>)HQR-)vmJ+iKaQQnel)uMIR*z!x0G#^Nq=9{6rIHz%#?5A&kK>n
zCROms_JTI_4pT9moka*{snM)08mMkrZjrsYcl1;U@>Wo1QWS9ASF{RRWQBn<8wXCf
zZQ+MuMGssHTsFFdD>Tb>*teP+{^k`%W=0p{4jP*L@|-(#7k$#}x?Z+0B3xrr5MY_R
z6F%|cJbkf&b?bhMU*3oQ6u1Xs=P~e;+NBBAw`AaWepm}PmT~r7yZ-80U-3ck3uq_i
z1J~rWmL<2rnm$~sHQ57>OvJo!l=P50sVYT1gyb_18EV6(ky^IRHh)rws=`HV)?|Ja
zRXD%Xe*dH)$~6eA^CP63)CKQMWyp<X_#lI{u%>3?AFY3mNv!QX0}ep$jzd_7MG4PZ
zh{MO!x#Mh<8}|%#uLS-J_^X1YOnB|;M2O*ys2abmupfaFMYQ@_(V42Z?-cqDW~59R
z*c=7f7RYi6JZH;^c>PCoXNgK_hpj{;dCDJKaYFFO2tR_WsJB;+X2U95Xnx9-R~vPV
zOT9^4a!V@=Y!}1>4(H(?f~mu0g}l^Rq00mNKPh!DXQ@@@M!d8GOd3Y)FGRqtO>u7@
z9B5)$xfI@WZ_7ZaCBEspZ&U&-v#FcjPAi|rx{kkbL7>AUxS)?F@?#R^Qg?*EAmCh~
zU-S~>XzuDyoZ9r;aEiMhtoP-PufXq4h7;y&=Kl57PPI@~EST0JucmRp2d-f|mgyyO
zPgg7On0WP7Wf}xKi~JC{WtrAY0cK=(rB=3Sx}CL%1=LG|^u-PLJk!(0!$4Ugclvzz
zCBW+5-X-y56-XpgI<`1MwVXY2*ol|>oWf#uIr@Os=jZ86s20B6uwIq*(>tNSmAILN
zv1z7TnXCj0ho-9DXPHFkB=kzN_2aU&3tY9{Zr5efMKH8KF0HU4Vo6j<iz=uIVHp{!
z9LQD}?>IRpdhngXK;-lF^noFIerxTWyaG}e`5<dLCNJ{9(?`5a$dak#;=$7phu~Cg
zGrV`dwc*$H77k~Y9{1eDpX-UoxmwA5=bs?Nzbm5pts2G`m}DIF>ufiPn41{d*;gG6
z7MShfXHRJW-%V~)8CTBD(AmCj#QrRE-d@Y-VQPvZ2|+0vr1N0mMi=c<rbao-FYws5
zn%)dF(!A!@!XkMS5%%kO(T8a>K&zq$LjJl>70?QSQ!wCTI@X-b(IgYg;0n#Q4e{&=
z10J>fndZM#AFCsPLhrF^5y%4EtVnws7<;Soe*&r|Iz7T)U3{;BprCngOOUs4Qlk^U
zJ+?=T^)~a&w&&{EUrH@zf#8x?pPoD(+!($jp%TF!yWi;f<mY&AZsA=Fy0a51%dFU|
zYH~>bHl7o6^aQxZ*K}_j8x)?g{Tuz=4<2Ya<I+(A2?@MUS+VBE^E=Y%`#5ablrE!|
z^#u#dr$V7i%ex9uz0(qHl$k!338&3@dqw2h`3Cw;XJfZD7fy6%N&1(;T<{NgIzit5
zn*atZ@DnS~XZPn%Pbe$^R~uZ>>D;3Hn+1+w3XgXw!~t^|Ux-aJoFtdk;|p66jrVe{
zN!GzOMdE2*aj_&wlx?`_Amd4Lg~tfP4wXY;7=r>O4QDQ9kegHn*ble#kac?R$1io8
zQzh7zHb}H=Y%ZkwtI_MZB;^~P({A!Ohb^Q;d1wB5W93k&d7Pr#7WBhTuUzk28*&70
zGcx{?GBCAMwCJlfpf7w7MSXIaNQqTwCorwjcv2`!S(A6{08H-{9N16IJalq;I=QMt
z#<XSZ=8JOfLG$&WadR7H{b3-;Mvgz{0Dn7dd|;=VNW0PjpYrAm0Xe*8x>>FIB=ec>
z&4mgN;6$~(`4GrWi$*+|BhwhS=rgtyaHC|IsCzXhaNckvdsi@&&H@s!gy`>7>c9!I
z=N66;>mX)UhEg3RY<7L3F^WX<)7?57`wq_;r6vlILKjHm=@{kVhrh}pI@Y*KP)qXc
zl8H3TP$~-IdGze#gS)t6_-rlTz)(w|ia7dwO54dsqXQ3Uvw0yux)wdaMlf2yqTzyd
zVAKfQGCbf;2iTjPUgu2f?qQH@REhvg`po_C&5r^OwH#XHv>g+!TqwGPemV(@&A+^{
zcWR_ZgOp9?2*F<v?3yBilmp7|X0_?boxGxfN~R}T@suEk$0-Ho;0$If4YY85ZE^Fn
zlrA#c9W<VzA!ld)li!|5izIH9i4~nks3(E@kA+P|J>8tciHV@_DPmjPw(FV-c?O|(
zPwdDnvBCPoqRl-{=YMP~4mGgYTF$b(!R6R&pMc?bPOwHxV0!3*vrXRTIJ*!N0>sL>
zzAWW?UNb`P>-gU7<YJ-*GK6K0>v3GQA1_T|62FTHL0CSxE>HR+;CM7!C9$N($^+xK
z`oeh)0%pLMy}}B<%#Rl*oR;}bI1D6uMj1DKY|}j&bw;*X2s=iF{Ty_wf@@OBPDo%m
z&cnfPM7kF=Z#RL##EJmaMR}1{8yEGB@khL>d(YUc0j}~bZs75lGo4-h<bUt|FTb3-
z)|kV}(EtA0Z~Q>^yV2(HQs$=B-yXb&fXaI6gTJQwWu7(Q^2<rr)FIYS9d1I5Zp|c}
zsu90<e~hdzY0&QWzhYI>H{L6FczKUQpK_Hb(Q+fE8daw(<8ar6ljly(5_;8#M27SO
zw!#?-ScOvDktN8gY=CUc`;?~HjF~w_NPQ8qr?L<EJ0{*sCqE?x#`d%S@deW$UI|36
zc5kmX>cNB9EA>LCyJOf4nNV8%>m|3`&d8eOb=$h!`Y8yVj@Ms)wuHQPHv|UKFH`S7
z2snAn^A?`z9oBC+TbKR@)Pc~E_xZwCxl4Dg+N6LQmJ-s@-mFG)#@e3Pz1w4dJy%C?
z{zPfs?Bw$Xray1wz|k|Nr!9@HU%)`(zdeIzbi<LLo^xM&k^jAoyd)N^xecoKSy;1R
z{?_|St+h0L<nLc}YL^Cgwl7JWOq+b&@57U))p?1Ymjer=SL$N&+XA1D^FWpJ`_?d@
zsC4i2)X0H%?@;K1!k59a#?xxBdCn2|E8h@jd>a|=6E&5OiZos*XL`z1r@_b_GZ9tp
z8~AnV`Cv2q$*nT)(mBh><SE-(I<wOAmGfD!<c^k8bxaxWWZtTUMINlT>;^Fgce!a9
zFvM8~H8E+cT$-oIhs)fx5|gK1|AM!<<!`{7_Y-Qa|LqK(&Y0qG@x_ADD~T2f=)r5$
z7^>gH1&ROIQ`AIdw2AUB>50C(|8+_{WZNP4TJXr!2I)8Y!|S1sX=UE##9HC_m|OXW
zT9tc;!uGnQ+^ZgT@-<0n_vTU+o9<QPiB0K5XMx}1$6r@IZy5Y7ufF|cEc+j;qum>@
z<|2?vc~bAZP8TkyJ}i?_SL>_ej)ltjPJhwz>E7F7d(q-yEN0EUK6~S`^PW4tWl^s0
zpH$NNd&%gN=KA1<T_(f72y!g^lg+E}VOsAt-y+VFzuB`<)(X}zfRzPiTCp!>M+0JI
z<(@v;K2%v4$#@U1fq|ojNp!kp5>AEWqWhuz`f&=KCn6<iJkI7T(zVjI0F2e>>{Ov}
zQSS(F@!qH8&WJtfqZbru8@)I%JZQ;AHBrm*$cyd0#qzZbk7X>rZ_5?}<k75}`Q|On
z;d$~M)r_qB>+E~8ZRb8b=#;;^_#l80?sIxAdZPnz1AYm}kA#Jr^(z1~VG-)=3pHob
z8ZCxOZxmcCsid23vkZoFLf>%rnS^xph>mNSErNAEF2I>p#KCo7;0^h9J(zkMZ|j{q
z4_Jcg5*tp0=HDbk;T9x6aU&+ZN8!zMP9`UqlSaiTdi?UqZ~mOtHP%+4HF;Vf>TkZV
zoAN)t`|<7jk0f$s<=Tnd`(w{J(FIo2QboR=_g}(N1wsXX^~ik&p`sv8?5JIbxMrR!
z=uT@;Le*VxbzMu1d}HnX7wh$4L#CL!0OT`RGkOD_{{jH7;PVK<N1u|At0XzcI>5b>
zfkCV8(M#N~2}<?MBAoUwbFpK;5C*wnkv-l6?6aC+Q1P`UPhSM9TW44N9sK0&K$s<W
za~AZcKNT!0z%SI(-SnJoUd0FEgI`KPQQP(S;FBZq7KDjEJ4JetiX3}#&5XxeQP6FG
z-Mx-DT3>pnFM2c{7KzPxkbMy<vwS^Ut*9!$O2?*!gAbN^T*<#-fYkT3uu|GiAKA9+
z)~|UA`6(p`zv4bXSJ4Gc^r0gOF)nO!w<iVd<kSnIg*pUS)^5u^^GwVCE8=66U^@&r
ze|(@QZSz}Pd2L9at_iWc2(X{{YXo+H-<s-sptvp0dL9p!Q+%4QqIz8r%$Xsgf%AXc
zh3Wj4iV<OG<OhhQH>|SoHBkJMG7A?<6AjpfMk8~I@fA7OKu2dkq8idl_qy|0`EQ&r
zN#oM?R5Ip*aDkVR>?qF>>0dEecyVD7!oM*%&H#0-w_cNxvr4O)Ted5`(paWVEq~8X
zTmvdLuRw&8I|AORpv8)s50-OTW{?!G;S7?4yFuR8gc+QvQs(}FOj3ZCjsu`ycNpLH
zHm}SR3)J!iw;5NdDK0|Uuismub#XG2Me@cLyd-*@5A+Cr855yZ=IGb~b;s`ZT#C&q
zY?&e6M9kgSAg9cV9EL(=$YjD9@^eP%1dR1QIjUDd*Y4TKd^9IG+j*z;mvh1h6JVPQ
z06TKvA>pbg?zVfDUjr5#u~DiJEC4Pc6ixIRBq$eO#d2aOwY*yoynb$}{6Ct`GAgPz
zY}-RgBSVWwcS?6N!~nvO($X!G3P^~EFn|m#Ekh3_GK3(gJTyv|q$1KtgY<XvzVG)#
z*YbyJ>9A+-dtcXi9!J@VW1i<06Ln8qV<eXt;F)~Riyt$brwjd$Ukxp-BBl6%n86#!
z5I>D8d+w;K*{U=KzM!JeZ3a*4>M|_;i-t!nk0xLF_I`XfyZ`y!%k*m;9r=5Xa!I2x
z1t9awk)UF<U-*ZG6P~?7RxFhuWwOoC_X5W3ZsI3x-?)Qvw&6tZkx!5?uh%t7R&Gd`
zv_2yEN26!)=PY^<vcMuW^R#&M6#AhE0LqigT;HwwyH!_gT3iYp%b+wCWEbh*k>-g9
zg&V30w$_5hymy;@A>WslH^5W-A%8rj+z@jtTVbWZv)4~A%33&=VZ;1{&k5AwK#Gh+
zpEq#@z_MNP$9w^W2t@fnL=^lU*z_7S?!YJ^2?X7qyPN}Y$^Rtm8Fsl&L&>f_N~<l>
zdTc%#`z0~oS!xht#J?Tx!Dz`#o9>PyWs~&l;4XI;=$V!7td#uAPlUqNs{`f^r$qxz
z#^?{lv5G4DEG0tv&-8-lj+&<r`_PT|m_YW>f7N*8hRBk6JOyfhZD~3brTH^B#qPA(
z{O~(I>HCv3i~__pCz6UBX-mBam21-Oa?SZ7!4>v}g%u{*MuC?a*L9`u{O*_V=&N7C
zSLVDY*B^n(h3Zq==|$3i-eS+>JrP@)BOl$34Y!FdS8V^gULO4&AP;Xb5W8;Bhfdnh
zUffS_S{-)Hn^PP!G9~%!miBC~Q1n2=+g0+wszkMQ8psN>ro2Kc!Czf#c=#xUeGL9l
zMDNA8gm$Tp8ON)|w}n%@WBLsN9GsU1IaQ4ogvPr8cCtz9t5)YV=baxD50Yn|$%`C_
z?~l&mIE~IVTtrEkBoVB_2L*z68oUX%=4#I!r<5-i1FdID+jp-&tY-$l+(yc{`qd11
zhS{%9qrCsT=POsquIbwjWS$yjy=3to5Z3ox_Eg9Sz80`sy{7fxav2kxIG&|h>28Gn
z9`=k`RrEQ{3Q?rbs|@yZxzbdWKDrn;N=H>Mzi+$>h-oY!Nvw|(`@q{<I;a8A@4@%;
zG}^3#ZArgmo^X4;P~t%LDRDMkJZNlrWWNgto-fb;E2l+0V~j<qt@d~Q>Me{~=s@xR
zxT%BvHK#VkJ|e+H<#Um|r#ulk81r8XYp4ihRIFQ9IBQ1}F>^%2pk3+l2RUtH;v~^s
zPs&p=d0w?Yv6P|ec0*tBBzOU5o_5Qa`aJqT6ue8(0{RXMv*IK@Sg}ATTf3)#!A-jM
z#}fcD33UH{*k9RGX%r2{#40na&AhO5L?3${x<Z<#+OT|u-e?Xq=QX3No}%8-FKW(4
zayq|aew_H+^NhsU=$XE)vM5EPZ{1k;)%TsJBdG(mNZ;!Zz482X_Ul{yi0)y@%XrtZ
zMN{%}^e5*oftNjHqQkKc(aZHI-y%gEH!;#OFIZU<#r)oYb@Xx^F(2G{Jd=Xgudo^v
z@xnO(3nSNM5&JtFBzTHWtijRJ54lK(t;=1Fe9!+3{PA#M3ha;~(Gm%8zO_1YQObp>
zaRb^6beLI52fX86=bC$6JiGAQjY=^wwS#)Q71BXyw(5Ha#PT)^px&cO4}67xW(?4|
ztQK+AKPPZ9eSzN*#U7n^5N}BnJrlRA>K&Pgedx<RyTBhUb43cd>FDkCjx5;5i?ilT
z7z2U}Xt7&Pg-4IrYtp*Dxm~t1X1l`nCiObxZ*ebdg&`3TEqJQ~mvX21mT~(+5-Q4%
zl}$dG1(ZI!aMwLu+<!hQWuTJHc;^G+fV)ipFVFWQf-S6mDnUI2oH2+AH<i~el|r}Z
z^z_B^pLy?Re1;7rO6rcq)(_HO*6dlC?6%iz{<CVZ!a)^Jh=ueE3h46*TizA5to)qL
zZVk!hr7^atrowdnz!o|eblu|pA65<I3(&xA=T`#dxX(G5!vvmqGsZ+Y)tOEigItu(
zZmTR?L+!Z&#Uzi0;P`o*`+G#1LTyE2<Y$O+NAIejVBdERolk~u2X4C95cId5U(5AQ
zW|s19q30-G3)xMDhv;6D)NWLl{AyVzN7CAeo4ax^rCQ)CvyY=xn)>P`IM|~cIktz>
z2fAY%TT5DFSZ#(lKnDD^+#d9|PG84aL{nd$tmOH_3F8!4Ub8wpEXbkh*5k8gEMaoL
z_Ul-7O0)BEm^w3Yixr&;XS_zk`Y7zZd)<jhd{mqE_R@<A-Nq*Lv4g`*x~bgCDYc)J
z7dV8)XDR&AQ8d%jYTzpm5q_c!k~pJ$Qk9MZJI_}F4JwPApxVTaV-%sgKVJ-z&t`CM
zbVZ`WJL&Xji^X3N2{EigJjp=2)N=u38rl-5w1l%OO`RxIBkCtl@xp6iUknthGa^^E
zbE-v_8DAV=xR9JLrS46nz%C!;aNjOokDb9lcJr!(*OR~~LnH{`Sx=fpxrEax{W|d0
z&&VRD{N)ZG+HVrkdWZxom_Ut95g)6$;#C~Pw-3M+W^k4lZslJtg`am|o%BR$wR%!~
z#<E8NUH&te?8{h+;RmAP^KSn-;A4ISaLj~BJdv2$p=r9iY}0fu5HY@QSI0jNUT!xA
zRb5&o6r{_fdKYNwQf=>XB3H_8BsqZjU8Q}Td2E`LnWszZ+7**OA@e7m!HsAZSSNz4
zZ@htZF=b$~D_nE;xRpVBV)$*x7aB71f-+2*`vz}MSG5!f<?34cyuoS4-lWDHAs^Q*
zk52)lFbHXrE#_$KCh=X5b|}Ea$kS`=QnXBA3Sb^io|j;mD$`2)W6k<>jHOSrFf={C
zy=j>N<mlO1eokrk9<U*un=nt{=-3U@yfc(TU6QfttDACF8-_%do=>M)U;3P0@6Y`{
z_mUH2nZ;s;PjB6LxD9VwfiVZ$^$VVH8{R2b;N?gVUiNc1jb6XN9!?ffY3eo>Ky&%|
zFk%dQM}LYek5DDtvb4RRAUQM2G7Ua3R8P{%R5(5j43f4D=={Gd;OVyWXd_9{r%JA9
z(CYs)4^C`?-7!JYZ=AtvTT9{WN=fdD&G|f`V(Mx8|EO)b1|!xYGRt_G<aoR))NL)f
zhMdo>7oL|bX606f|A;m16*Q7EzgyOiHq*)RXF*}IJ<e=E*34?6p;UcL$ekKFdbm%c
zq3-x4@Rwv%-b=OrN{dDp=qk`Fd`f1OYJIYtJ7F!{za#pv4y|TCL;uO?CSdLXfUw0s
zIpYVeA`c!n<f;$dRun#dUN^fh*^qS{od43SPtIrUy5?Fr391{t74qu8nw>)>V>@+{
z(+j=x+$(7hbM*?eoErQypdsnXY+1g!4qlrn^H7}7Zy*ywlo-%DN*-Y?okLr12OTn<
zZT>u%3^$h_q;Y2SfZS+5jm_~=Bw~2?+pM!6j9kyWf4wvQf>C1qy>w~}W5>-Cjj_PP
zq^@+Q>1NOq2s_)Tp6ae+)WNzl1VibLjo8hEDNg!xWR>)xZopXy`2rq~V)=AO&A9F+
z!y#Au>~XL#GLQr?Y|z@Ab^!t!caMj9F<m1G{FZDu`rhwOh_pYoAF_`KVE8S~8u;-w
zX<saVF6oJ_5P#{D(1sl|Jj@*F1Pq*ys|<ZtpyROwIv#isTa)C=JA5&ztZL^iBF`@K
ziS)}JVaV+X?l7d2!02gB!i}LhpTO8<r>l{uB777N6ZUrNJPU~#`8B)BoqwSqDVLAO
z(ZhY9<|S3fXUFJ1*R-w(*gOcP`K)JJd~gCzr2kF+7P6>o@ZxTc1AK^Q=q~G?3`R>L
z2b!!wa}c5peQF*%EQTR+iumjRCYrjcTYxtCcjh*qKCTL=|3C4wBZNFjhP~6%39Dl>
zu#lngZfvaQwJg1(sF57@Cs6gKX=RY+0=y6V3THRRgb@?Av_~4r!<+Mi!E(|ouo|o@
z(@*Kuc9-XjCGXeMVDB!Q(4KP!Go`%nMsl0qxi7s;#x(IWzxBHuJPAKNu#5bhxwY@^
zIHvvfat__=P(HOi@q2W;S|)k$BZ!m^YK)TIV}%MkVZ=ji>3{VeClM6v_;sDsoi9Xm
zj^}WEv&{{!&3Jmh!^NA=e$1lsYxIwBgB}20BfIB${_k20UGAU?Bbi~F6CJu1zPe68
z9hepVFwOS!8h~%fN!~7uZKqAPxIdBfSnNYzEE7k3@DzUm@E3Y799ZUmaBE@lp8Abj
zj4%l&R8GC*BR-aOtsRnhrF^Qe9hXHY^itj!u*qO};PxA*B6W{F2@>tMl@l<%Nn;qN
zm2`A4dKb8+gK9_KS)v~bdG+)0;1P%@@u&Qm7~%WiE)t=-1O2tK5T@DvfMTvR#bY55
zZ2Xp@h;DYIchY$P`!txU8wuCg3s41Cu9V*ZScPx&!+Ej_g<7loUDp_Y2Mm`Pv4%nr
zDBPbLLB__GP(X;n>VTOOtayUoei_=mSATIv)HSEG-tlNF!7KGqI_YY(#|T&juc_5!
zyG#K3n7NfFsw}qUBBNJVgt#Q!ox}rBTyeFz`oc!vroXyfk+yN*?`QN_Eq;^zNuA1S
zXKc<GfrguEAC1ZX(jUS0ISTB0wHRJt({IuD>nVet_e+ih?@$FCR?`;2y(JCXkhBc_
zhj-2>kuyYmZyx{|7>GuJ!P6fo4CYpto#}z8I6mOkTA0fq^cEU%buto$ez2*cuQV9|
z%#tUJ_fE1vSlom_yXM+3Z@I%goc!Y}?@K70yd<Tp)SBPEIqb2AfVqfHAT9QoT6+k3
zm9NB6FLZb7wEO7A44$WM19u}8f)i{J<;JLD{N*5e%tFihGhC4NQAx@NT7SaA^o$rV
z#>>b4Jb!8<#-VpS+<d$%Y*_rhmwVqAME4pPOqj9HP{llK<23D=uzb{ZY|_{0cF*an
ziF5c>ny8MY;FN$rcj>Cl$OU>Caq`kBW6^&;TBb<x$>z5Jo1VaTTt#piVnrT{&AhbK
ziyC$W{;(nL(;y;89Xj%66`Y?i>W0bJ%nY--BAmC1I7K;w)IrB|GPEk}r^M@=kIRQr
zlo_o19q+>uAQASJ4DuX<8tDwC-?RV`dpL~f2)zze@q@h6yj&=_I4EX(FZ+yPYoQif
zknjplEd?^CMB$iN2e(;xELtLJ0&F>PifxNfWr_x@Uyk?jj7IxHMA0`Ix|`AdvPi(+
zo1_a)#~Q~t3CEk%#S)`wwho!6M&WtofWCm0Qs2B6IWC~XQI`6oL@A0yG9`L)5uEVw
z6NSy9CbxDK-UGe}*aHwv5}QV)>ky(W{sC!g3vW}rELR*|Ld|sV3TWM_ftOMOlnisg
z10ZHAhT>H3)OEfCgFi>WSo_$E=8AI;*t>us+LkT{j9PoULU=9TA2*tKv1>4ItG%hF
zpaFe^7|=tom{6Jp=r)5~?*<Kd$IV=w;_+k|`$jwIhTx9|_>tpmRf<G93@<ue_NS8r
zYHd@vURn;g)`tGA*JMAl%W+|G*U<6gbhiR^#)SO$1h-I=kLE>(YU>*n3D@1m9Sb!?
zoz96hS-|QH0xli8*G*xZV>4<=IEBe9`JSIoy_Y&&axy(;fDa%>o8xC{v5xeqP=z*4
z&-cS2Vk%97p-Qk3Rbo}FDLgV*yT-lnXXRvQdSZE|WV-=~a&SV<>(z2T(Ts2KE&uXN
z|KtN4ZGz&p=TrWpB;wG?_6^6&Hf!T21=V@;pA>ZU)~hx`1Np;?w(Z=E)9>T*A;tr3
zBoV4ESr+!S=#wD8Qh<E9v3liKa@W@}ra3{|3&#lhH@K2P4irv<<3z*}$Bs(;BKg0T
z-`nMAK#0Is8Qm<K{lbC=398ZkZ!S3gm$1140Hw8$5ie2}?#hZZqxiGgH5h1rq0c@y
zhYHZavfM1Vm}ZXa5)4Vn33BLWC8!;;7-TzARH)?gB-Aw!h&W!qyHvS1Y{Z?7GkGK5
zjA2Xoc@VBj($^tyOl*30qg$T^rjnDtpFVtFq<^4$9ySTuy7^zU+0|(BdA*Q{nAw#3
zba{9Q!ZBzs&IFa;;69N%eh~89lpP5KMe&>Jd?kW%W%MR(d5*4~!Y#dvbWwrr!;#al
zl_TnUW-W*HE#9UPEZ47WTc^I$+_)<>E8`7`BV&52ry_!X`QU4~1)NZzRX~;Ne!yug
zO;}gj%jLqB7epuDOf4XBND)J-Zh8SXako(0A3p`iN`hxznKFZ!;!6Vwt2h7%QLld!
z>g)HppsoJ6u{SR%*R%R^y74S=K^B1ZI&DaedT8jQkvXNMgX+2@>cb{Y;ZwznIXnTS
zM3VW0KgXT<0s^O^di?{&-gw+0FN&jUk(q+EmHvQE9QWa2bgMzB4Rqhf;55OXK&hN4
zQlla*I*HUfhrQz9Jy+fqAspyGN6W!KRY(hUhrr2XB*ks>*&xR&xL}qah7<7>*f#S(
zl(dz;)Kk5o0?wp<ExO&PxlWUDf8%OFPMj-}qo=fZ;MPrpH@IRW<8a+kkua?sW7C8f
zO^*+Q)+pEu3vIr?R0r4~vrY4MZr<XGpTTY51v-!23t0PZvT4gynp|-jpw5Gj%AYFp
zR2OkOl($`abQcE=*co&08DtyfBtLlk4AnkRHU`7*9sN)L;1s~)$`gH;yM!+n#679j
zfA)Q&!2_YQN&XG(&zrQ5Ar=O##)#9)?{a_rckrmVL~~9IMjrwzNR5yN^r7^_XkT&1
zgq*Ag6nb?xCZ{*-yNnzN6V&~EX)D?xgs}rXf)fl<Z=%A$QhWyz=fSVo2`cx|<>qkO
zNjd@Ga=2OY-PD_Ip`Iz<c)t6{mH?1x?$Xd?&kG&POC|l_jbc=J51`rdHU-{_b8vhz
zF+H95YV5)!>(rQCI<m9ZWEK;}YHuQ#m$$`}c*o98PF{Ii5+Cqz)P}tzT(-TF@5&ie
zSu;KEE4&eJ18;UT=!^L^)P#TcOaMGmK6Qm{B|h2lo5qTeF{v8BDJE>V#I3S;hdw7!
z*&rirFfc;#Qm~|=G{Ate#jFbe7;pecyVloZ9x$odcs#&I9&`dml^rn#rOQYz8n)F9
zQ^(XaajQz$x13xQPGYHE-VSx|@D-(C&su0;OZU&EG;bdo3}wivsrxu0Z~jbPK<6)>
zeb1e`fS_fV*UB7YYk8J_Ek2c+Mn|U!oJ*P!$Fh$1`}FWmRRA-NyCxldw@Ne^lO<TW
zYT63rX@)-wzX^2i)ZZ*7AiJ>+ya(L3!9d6SX~bD`ZzT_YilZ8Ci6t>utT8BlH&7Pp
z_-En!7z>RwPl}k$?XA9i{5EY`1YDlZq?fTD6bVZQ4VeDuwV54l_4$Y8wCUjrFwVWh
zo6CS#KcorX)R}R(`>V9NaI7!tv*)O_GBSAcn@L&Zac<Mx5K3|R%ph)wJoN+e6SkT&
zmNN^S5@qkb0I&%8OkOI%A828Msifd!Sbjb7&{Er1P70eKNcZU9TdYg+Eg`JTveUxD
zC6Hd@02(_g@T|QB=xAGKLVioDuik;gG`ri_|Cy@|Z>~Xe(2K|?loG6sNlMj(;#dTF
zZv0wW_49jw^h!d7zZt3qw#B~BpVt5M{KN~yU^DUjqnns@s-iMy0#D2<x_m1=<~))a
z$PY6p2-msw7e2^PQS)1K$J3^X$Uh}x)uj=Vz-X`H#yNoNb3b1h%<{=KMEww5Rn6pL
z75X6Zm@FmVN3~&UPP~q80jdZD{ZMbMF{j(3ElDGCM6M*;DGQ&7lB507<+5vew8Gfu
z*4t<9yVCTk&fPfAfJ+p{+SV?2a$P`HI38O~>%DXk<g1?~3micjq&eBe(MkSx;5{VR
zK}zTQ=IRqrYs6tyr}4(1=0Ag+&e}{Pq+Oh2xnjyp)j4|aqU+Z-%L#L3EY<2`x$$R@
zMLnvI;IN~3HWaUz_{*TQ;%`W~o660QER@|0qA>CS<%o<ov{Lpm-cb{Zky(BGX>5qd
zP^{;b%m2l2@I&=2eaSk6`N4&qv!WwUQhY~_w9MJcYFGAqf1iI1zdg7mzLoxwr1__0
zP5jJ6Kc0-sO=ZR-@_j*J=PUns5<*-RkOqBvv;wA9%SNw-_GiK%yEB%MA7?O#?P+|2
zO-Sx`ow=2h@$=doRPnZl;=P|*#FcDFaFN=&jCIPo-?DVeqk;W6rcH41vCT)e0tG-|
zWIY$n6ssAl;fdBP7UxHcgKd4w!i2y6Hkc0>kEnso&!)z`+PMcw9794%^q7cS9dfwf
z4zhQy%-LhJ+GqID3=y9IhdzNhdb|B_g(?k9c9Hfi?OTmnzWhWZMrvgM-Kf|8P_BVE
z`5LmezOHR#%5n2hq|F(yEGOg_342jHa)0{7Z6vf@r{efw{pDl|_Z}43%woW8C5jh0
zw|C2k3xok9wqd`#SY*EJ=$Ps=@{>>JS~=>q@bz;gaK=Y(OS;9ej~NnI>l@c)dl*#?
za?2f_`PJ~VMZTNH^K^Ztj9)pP@$_oilRF@f=ExD-5bD9&TrOy|hi%JG`xg_-UiJd;
ztBrlrWPnQN3*bY1-}+43Qs<Nm&f3jN#>TQk_=VY)x^zA{)ZD0v(sVwH@l$wu==JDs
zKyOyJ9z`DB!|NNOP#cZAoLO_Zfd14e-e$$%W__Q(QJxFi(a%p^C>Yo|?*V)i#7IBV
zP(%q>(<+t%z-<nf(i!~&M)ZSLtq)CmU0%9#7ghS2{%D^3g%ctv&*rY1$0D$7s6Rf$
z2K=ort{e5o7N%;I1(|Nr(q`OW-!nqL)nbfS*&p$g;SjBT(qly6cNkF@cC1EW5-Q9$
zPVpfoZ%IAaL9cN&-xM~Xjo$uvNABd|e|J9geexNK*py&9lrwP%+WdBCjboIfFJHZm
z<xCPZbtg;X-G9CkVP4J7Z`ekef!Q&`<Ek~IjxN_ssADvIG>EiVKeDOd;eued_95Vh
zg#&p!kM_*y1{R4AZtsC(W6q&V)8l~d^Pxkzc?aFXYp}rLB5zVcm_)1ns&XAKXSe@v
zZ@`B*RVhldiZ_w%_Tj%*mbPy4L^lCp5UlI_c8s~DgSrojucSrl`G_w(adhcKMQV4!
zh?g@9s3?JZuR*4|CBL)I<~s!Pzuw;B5*Tj^0qdAs7@(oYGaCh`#2_}mzFl&qC&ur4
zl&{9h(J~YMUp~*_q^bW^^ajPmfGxg0>^rqlOQ`*ZYMZ-<$K2aVb!TH>F|^$TSciM|
zSX?<q`?<Q~>IM8c@biWI(}>p)9pYVAilJmrm1@iCDJj1-rAcwXo{+(b8Ky&p`~`gi
ze1HHLiDGuX>yGue0jz<Jo7)H)nQ@=Le{JcMH1Fi&F3zZIa9>r`@U2=QT^jYl)FjD|
zcMb9x*JIgHldk^0wbeN?BLD7)5F?6>YPsBk+8y-KZG&F(bcN6YU_zJFNhrnCOCnRS
zO(t^6s^Erp^L!t!7@D#%*#lH-`qQPeM{D{OME5|LSb~FdN46mkFc@qVnNd`1x>V}J
zAuS5%x8?)=Ywso_J?LIyst%NiC7pN>PWa|==)~u<fz-;Gq~{7Bj5OY@=nrb<gM0Ag
z7ooS=wYGNN1Bvo0CELxKa48Cu2$6P&n|Gt;a5^tPpXuG+-~GS!+{~zlTvIN<@bm|F
zgL(lTrP6T_c^L(9O_HPlS){oEaq$~Bp~d&?DV+X-WjDOrk4su4=MjGG)@_|hBm!SW
z*pc9k2MLrSK^jmZ`Nq4B>VQ~C0&vA|@5=|Bo=xe;D%K|24g&<=p%M>`DgMR6vpD3`
z`Ip15>G7%Y33%FQB+b_fyHgJ>ihaMvIMK0sq?I0Cu7dPAqfTa+9oLO1&-ICWu86lW
z%bYC-3B=k2s#4l+Q0N5FCVnx=0fNtjaqOb2lhdh<!X4lCDtgkW<#@iw`BNq3av`N3
z94Fq5Lj#poP>tqb)X-|&9VVa@Ci|rHm<Cbo>VFnBO+LBdW|F)X;hkWh96+uV@*@vo
z#L-EErbN=rLhRnTEal3G6WO|2vKYtl@;}aIY(0oxMN)O4v6op*onO<$m3rbbn*d30
z9LkfT2~zzxk*!-0>lv5$*`ARxho<{~rFMH3WSKWiO`{2njZcG@Vsw1(zlup}rTCY8
z7uj}lDF8q_wQHl-p?_uNT3v)NH7m)IL)Ou=o(1diUK{~#n-Repz!Gr%dfW4=U`qZ&
zm7PL_s&jjKym2Ucs!5UXz#~ch+5WgT#GRCJ@lCj7eOLxB`US7jCbLhAe4B0eV63<^
zK9ayV_0$J&-Rkl5{BxAK_BZycUiL)&p~oj4E^Rg5uhO`26t&IxspZLoPT97spAG{E
zjj%;E+H?cls=4_0#ev`m5PZF>kw2dY_+?^2D|!hEsx*o$%?l&HGcvROvkkPw>u>RL
zxV#tcQA-6oe#5Q(2+a1+k%9Ht*Qu-Bj}>Y8=ZPBlKxbQjqU3uqN5~RWM3_GSSGx00
zf5_S7ahY=Sh_JA#^vGjdW!8ai%F|*EF0AwMZoDH0877}@X%qX>l#J*$yx{x^r=c|&
zp_o{-K=I;!0mk8;8|$!_xK{w?>(|BRfFSt(IB^QkRrwuV1%u!k%maej31Ch7Q?vfx
ztkTAodx}M7WO42p(S_Z13%|(a42cy#$Ysc!NPZDHEuW0ZaH@l3@UGA@**(ffpYcJk
zYtIGi6~Vh%N-wZet>hPN`SS*nYjeb#nGVNnWG<#Wd)FKR>l~uegpHho4}4z3>x58S
zvG_Ji1>TqU&!|l0-~YLMK&Bc>jYEuZVv({fPvBos<(XnnDKFPxknNiu`W;<UEJ}mm
zv@b4{Z>+rYX4_*W`<5rZ=xsQ|9aDw(e_k>Ks55aY00+CMItDlfQ4+Yju^fb`W6ujP
zy>%IUr9-evktd*H#8d-)g)m-9$TXrg0c?xVm!JO=es)6w9m)dbKQ$n;uPDcd1!M>%
zDD;pkCWAQRL~=K%4Q^@wh6(L-fnNj=>p2e&;l~Y7!p7%c?m~8VlWqUDKBM3XH2;ye
zC3$gsfjt9y+tdNeAjV%gSegtA^9I9_&{;m6s`V4at%Y4-2r**(6%&1IhQ$6}e^+wl
z4^!ZRYA17dy33Z*eS^$mjT7TX2>OOcskxY}jCF0#>9`|5)5`R{)T9-0Z|j@)`Jb6_
zaGm)Q0E)-UXpTtD-}{L3?gek@DkiWByj?N=#s$(~D9mCtbudoX<(2V>khWWVrw{VW
zCT*_=$r|9;xPb)I9S3bdJ|a0nO@B`gIp8~3O0cP0FY7$?O*S7*)_UJPST3xH;$l|U
z?E3q8%-<V?{9}qMHsomYlD3+Me>iHE5m7y;sa%-*GUaM;xOv}uS!QUGJIsZ8_u&((
ze36z?$cG2CtoqwSFEdDgM80&Gc8dsu;Rb>$nj_H+RZit1czCToc>by6vQCwj)pX>s
z-lYw6oSBw*6zHM3Ql}D5Jo$8L?x>Rg5X<*D&ecr|rfv-ZfVvZfB%!GY&g$A`*2HLx
z|H_--cJe<=s-_d&?~IDYqcg)8Jz`BaUyKvm9n5E8=y2oMAz-7Oe!{p(GuGqYwgeW>
zfwD6mxeOg;<%#exA21Ua!IXE^VXRAH)QXTucpz<KoN#g`6{2D#%H7rGtSo+b3@4HK
zq+nenku5<_XCkC4>v!rZ5`CC0WmGX3b*qm(?eE(ra?q4f2XbTwXgZC4S(2{tBem$<
zRdkA`ek+Fio+RhIe#b){XnIcuwP=Jn7rHmh6{BNI9U3ZhVEt}Qe?e`iv<AZ0H?mNX
z#JoxW{JO+@BaZ`C7$~Ojxe`Iht%iVgdHaus#IhA#_$w@bo!YGDg`<z)oUwGeE+vb3
zGJOt7_iZO1%SRsm3)}b#g^bdPa3+A}{+rhnN4#T*A@SU~#lBD`xVwox*}JoFGyt^W
zu_p3@FA6$e%krS4;v(Raw@td{2E^`d=S;no>sio?gV)|x>aB924h{l=myd{1)mpe1
z&m0_1e8Sx>^R*`{a%x}4eI}7JAu{oG;zlF4^~J{*wZCOk1~<f;k*BYhWxtUNQyqP1
zs~o=`AF>sXZk02rwq4Si`zP-%qAhr&s3&jQ`pJ7@b3R0OHrfIKX5v!cGm<4|jH`zx
zl<F^bBqY;=w7MQv%{<l~Pa5g+AihUTqk{t4y|K;)I=>FD&#-O~gf?-kNo>dv-HCX<
zNI3IrS*h7%*FW*a6wf70>y19F^4~m&PZ2c7rpJ#h{wIlpqWy)FlD``F%uJ24LbKoB
zcYZsZRDRO;;B&-;fbr{iX4h)<iIg{RBqsO~qr9Pw+{Qq@V9ao14|UC=Lvq07H>;GX
zeQn2o;vB0`@A+-}lMuJ4rc~fg0$;{lb44B)e_6T*uiCBlQCAGv6(GZsi3<M@&}9S$
zX1bd6>YOfn3HSFDZ90Ie!mMLXryZH6A2<{6lt0!FBq8pUo@c)D{6&+fGXOW7KQ><J
z8hnJu2L`p1g74dJsi1%#Gdm8=Y!IzUyB_%-SqK`Iwi`l}e}gqqyq422+mQ&HIG}rR
zH%XcP|84o)ig*%em&eywLQxMmqs=!C<e}jKh!vW~5^IyYffqW6wowefB;wXZIWB!f
zy3sBqqVRgSkQov=Fthzd{dG&Lx3E_`Nm2m=|BhVSnr>WuJltJxGOL`kE;~dj>W%3v
z`^%u1)uch%Mkxd1Gw>FB=VpD(6Z`cQ=TG?<^#>+ac(m+@!o`{ftIA9b*|7M^9>CB3
z^~1u2>&GNRp{L<y$*RHL?4e-pN_@Iob|Et<SdIwzQ5&gq*)Oj`+%F$W-jUYO4omxa
zUBQWfC5Mn-r<!wA`d?tI!tCj{+q{UMaPiu6YVXs2^IJOYbgX6<w|q<;C3mEwQMK)0
zMx|54g~Z<`7$Wza0;fAc`|;I7|Btpn{s<QAozA@P!`o7xu>7PJ?`oM%m1O*E4huX~
z7!_2U(Qdm%q)QcNv$^;NWUx{XKR-6Kn4H?NM3IP$xU4!iS3IO7E*iW862D=V(V}VH
zw$YiA7FFElQxDK|3a8*+O#r@Rv~w{)`vBGU5Hy+Q=A@$Ts5$cSmyB0w+%+eC`jQ&^
z><Akk`G6olEf|W!s{3yJg`UC{;_>ab9)-)g2=_t{-<D`Z+)@_4AQk$b_z4I>7X-&t
z^fDN!S@@oGq<QU6^HwZ0o{`&1AXI(n;{l<NJe^&CwNGk^;9{ouW2#X@Go?LQNs(C;
zW-hT=mV!!Cmj+~##o1~68As!|lWN|8E9&rx)#{hUY(m<IB?nQ1(}y6E&Ta;TL$~js
z-G;`7ar>!Yq{8JP6k(GGVkx}1Pok6KS=t)a9Oz&-At38zDi%*adS<!td)u2-Y-KNx
zSOPTaz*O-@S)@w54-$fO4-N=~KM@(zaza%!MXiZB;*0>ZtrN7RNZJcXJJ3YkEwe=l
z9VG;_1eA<ye>(El)1T{g$SkdRg_M9H+AmsC8!b1Tcw2R;r8=jK2y)^4UzORZ_xJ0(
z=?RKSO}`KFX3MAZZd_Y0v$7JSy~h{f_u*BYix{5|bH5s8E$mT%Umn1zI*WS9CN}d4
zoII0w`PDwZka{hZxXEpkV_Fmhyr5B?Bl!lfGb*n_98QYKuhQKQBw~{#xDo-wy-zGM
zp}#f?(M7p0w)ZS=`WxpJg}2zyw-lh=iUijN9)#RUu#SL{jazgqh?}Nh<oDwv)_<Yk
z?31sIEirrEOA_#h%||hJYBQk!twfPdQqEOVVXp%SxJOCmxRQ!keR$}NSS3$&s3mSv
zGq?h!$J_r#^5~1esndoeE(&R*r%GVt*9kNIpZV>ipx^cAVp=$}!3PgTJ46~|hm7W5
zT%S3;MN(Oibrtw^7s+pwR{>l7ofU44A4f?)j7TfJ7qi?N|1LV&TU<~Atvx(otRW!@
zHp$LIIy6tKE@yw9AM`4a+l|!L7bgQ9=B!jSvrlCw9XnErc7l;VQJ6c{TKOBCmpvi+
z(m)cUUDc{s`9-%wdl^P^@Q7YfPu0}Tk{p$ykw?E}{k4Y?Aez8giu!Y7HV7~48xu>?
zly%rAA9NlMF163Rx?AVsKCVI)wp5`ZdK)%^$J&Y#fG7Q7|Jw(00opZTy3wX2*TCnp
zJN#=#jP{5?C7FC;i;2~ueE)2!D#j4+DeNHoKbg9wY7V3nhQUJzwx*VezN3T9CF$<_
zlv`%q2clYn9^Rx}=hKZa*6D&bP)$uC2ADC($wCzNi={H+SClv$4RC0*SMU<OUiIrB
z!|#5j(Fkn*@o@}O=y&(aQ_AQS_MB`_aHbXB4ZhIS-%GElbe{z(Yp4TPf)q?TK+h{)
z=&y0|cA>g7Amq__|JAkKcv60qyE@aH<@^2>75E=6PYPvc>!698IEJw9QvHm$-hak(
z!r1$I*l;VVwY^AhL+-qm$%`ork`ED{|19X&cKe_vSg|n!-}1GT-Bg;<cfsEgmC@-v
zmg!+x;qd7|!lYEHb<?KOO~RS~#DVS5Yi%G!(2`>c)Z85aTz6nTpT5ZUzOm1nCm>8(
z69Ybf7$;KV30a--ixg5&cn4t9-iuX_5U54RS_yOZ8ahNz-7}J_-iXS9xaejHFkA-|
z!k^a_X_H95hVZ7VQd9)mNVCa94c_K0{>*z%N~KG2)ONV?-7*d3(ux`x>i3Kq)QO6R
zZYJl-D*dp#R2CcuJT9>q?jH0p@tM5cDRTKaFNU5hSVA3WMJE;{C4w{q17lStH$6f*
zHoUp+bG6Qd>m4Rg!)*5rN#Ka?7xOW<GFET#gn&*CgxQ`fxf{I}0sXWn7_%_>1PX`q
zmHxL{nxL~nF0k)hNa{YRLv=3wd1^ugz!!f4mNPnRK6AMJudd9)0&E<Bsb@U9GVJ?-
z(HL>qxJcuqfx=j;t^S<)I`x3MxdO<pX)3m6pGHNQ%otB<Qba!ac#D32L&1Slg}_ci
zSIZb7t4u2^FK=^|X#L{$aVq|(k_X$bvZJROHP!S#MLZh5%AuIVHJ^H!5k<V#lzOX=
zKG5PKtmL8{>w($cqeB%KVJO(+he3kRcviy=Bl?qCC2=%)?jQqtfAc<;eEqb*qw+&=
zY7v>eaYvE!y|XO;OwOGGnSNzyZ}l_Ee~XqW+OPSGs)NXjvgz5tG5u0#fzhb9z~wgt
z{P@Ca<MKyb`0YOhy3BZrB8^M~xDp$?7@MX-CeHuDiHq2m9|4PnuB}>$>r<iKxX*GB
zz!?fXep8TIwslv|<v4h@C25La%yx*@HpoeIsMohH)c#-sFx;r!KtZL<8vh@nTLJwH
zF%Y^3sDlvBWt67zpDcBaIx20d&6?*FM<<-j_`>gf-lkz3g!8uTP$6uV4peY0uC@98
zN@;fc@mL+OaSFlIu(_ogMg<}`k-(SCAtXTOY)lp?R-*w5MBio~A8Rbm-i7t*JwCIL
z!no#qjd|ng_=x^qqeX+}*U07PL`OLFKXG{twg`CNSUMNQTflxQbd>XD>(P?fq-^mt
zJDH7_yNS^|Nb8fIEO6db_Ze^sSZ4@m5_Kg3YNNC?W+RQiAs@n<c}eeOdxg~VxFfoI
z=7cB@Oe<u32ehM8IeN5nlk?0Ui3&`EJiYj33S%Cg|NWyn_7WJ@hf9iZ!}Iz8?aaV4
z0-me1@8t&aqx++0g3qp2Vbw^KoHfe;rKWeClc{Ou;2Y}=KAk^c+IqAyN?xE><2Yyz
zXV7`RG;P=X>Rt4RW;51BpV-=V=Zi-=tGjMiHu=B!3HjCY=w!}cz`ypQA#gQlp|OMS
zfZJ7EM8<AZ^FuXm(%k_CY<}HLqxI&_Zr4jM#YKJN%dU2tfBx+jPg{3b&F|{UBl^1a
z?&b*nK{$^A6ynrTbFx$2A{S^1=BVj0rT={$=umD0dR+Qh*a~d62id<iErGAc5N^b>
zkA37<+o8hEmyKpRX0`z%rOn{6Zqao;ykj=nyR9=hzWybl`D&_k^$peG?8-ki3G+n#
z6I0K`K;a(&PowkAujnA3ASS)U9sbYu-69t1DB_0q0DdmufE_&zs!9pd+=ZU|=(VK*
zq+m<})Acm`J=;1snvCgtZ}6QP@BwIn&F~NIcPc4K&sFgO_xUVAwW@LAp>0cK^?&8J
z0LbyiL44ye2uIq`d@NszunQqnI@k?dIDclO^uDZwUWXGT0iIn6+H*44U|H?)KP+s(
z`+dq@qMmNFw_Zr34f{HSQCQa+y6bY_1ERLC2#D#Z<o`3$U<iKBK%A{4ykDF}%ZUos
z|1D&n0F`}Bs`vqHt(&_G856Qo61m6DE8NW_SUvRKb~v2Benr_LrIw7Kf_*vBTuIiv
zoS%$;Jm&l3r#S~s@Ors5WEI*?S;Lr<?*sf4cAvbpY1H34;HXGB^9KkIW&ad8gedzz
z`m=Nc&0@OQ8s6Rc77kwTnp(=y;6cU#9%ST^-I5H#z9B?E46O{@3YmS5Q1pCAYDQlQ
zXxCTi(!o*y6bY{?lwwkReI+;Dl&O*YR-Uh4=2xVX{XkU;8kU<#w#H;XpbM#{rr5C~
z0(;Z%GB!6OG~J#tg5_ONFsoj}l`sA)_tc0n%%tRdaH{dh-B2(X-;D4aPzJZukh2ex
zsU1{q!WhZ^fk|3UFFC^R**^t7%xqCK48Zx-H%U?i!=>ZU4lDn7-x^g8{U9ospnW$Q
zXe&#|kvka!=`9u?gBm*RxVcU)tZ32i*uJe%4{oQc&T)Bj;`y*_FsV(umG<?ABaE@n
zAh@`x<%=6x_?-(gB2%1e2(%|9<i3ycDH5i?qgTyqllo6rXQ^ABBT3K0#4IUZ4lm&9
z2D<1ZDU_F|X>}S3(zyN9Z%vkAf7BI<h(zvwDA)W8Bt?6>zw#j{9p$i#PD+ToG7SJf
z;Eu`<S>EY#?5Tay@1zxE9Se{`9qqT4(#$J?`)@?82q)Ox79<wPIC(r*G+vKxx={vx
z_@lvy6yDd^xzYTXZPK3jgd`bDVKwUNz!JG!OK?cQB27*<#PSbzLUe3QPOCaAJH)@m
zt!bU?WIjDF_W%s`i8(fDi5bOOA;d4DlNE`peX|woLS92WjU>)o$k~$ifH=mF*}JW~
z3in-9>c>)Xzt8S()$rX$4#$(x>tX{wabjUyv=Sk6Wrif_v~7I{@2$#R<xDPEQpBcU
z=Dlkp=au{Oa4OoHq9IWcylZw1jjp>f%ZY@U4he+iulkHMbZ=VG&NE0lElw(M^qwM!
z9pn68e~M*~bFekp3ot6uCK5v6|C|uyM~uhJV&nUcsDd^0IL1_*wK8aR1}Z%p{jrIU
zf0Qe5YyrzI(+#Qs1Zi%)Zn}K>t6gIIJt1KFZ!yo(SVOWxU{UOkfMW%~gUD-GWTaP!
z-z49>Ac#7({*z03kr9sSd<8ZE`Xlwp8t)#yl1RHX5S|QoI`pp!Gd_1N@>lU&uxPDX
z9uCi^V%1ERpp{JG+<*Ey)<H6xe9kBEZDnjC)q#R?&bDawNo&BoHoAB5(Zm#OAz863
zbr=r!Im;89$J=FG$ihjwZyS~CCpKI2|ArRMCoD++Ed^S~3(&uhuGDUJ`+4+h261)#
zF_lUyEzs=8@6y0rz2uU_t+{LWtslD&b`B0kn<}~DItdbI&R`^-%i1)6tvaWBn;;U*
z<9;c&dwAutAyvZ9#zyio-#HePF(Ej0I1$Tn@boeTG=t>xg3_~BXrxMGIB;U>{QbAp
zRVTma1r>rMsfal{tq9e5Y8c@59o|tKIq^QbEgcJ{q}l6%&LhQ_4<I^W4u0pPTMy6a
zeC}$}zrYIbz6pl@eVbY81L@N!eA&akOgx6`OQpG4;g!Hj0)^S5wNdx!N^E__xLowL
zH#DZnvKXYtu5aHlCHvLg=YB9b#)hODqwic8cC5mrS;`v+D7cEeu{j$C3F(8()h7+f
zVjwrcKOXlb*2C5*9b7yWM)(Es50258@dJ;Jt!6;25_Emsl*D9DrfO^$c=bX5b2{%$
zH8FlYuu1E$GEZreZVuk;K?neg$WI9(z&0WfQf<A}lx^>CZ~BbP{&!xNqK<BEn27+9
zs}-R|^oB3+uPfExBWBA>(E!ti<`1tbyIsy{EWK=wq;EWO;)?JIKJ?T^6|9eGAh=Om
zKlFGhO%OcTyvk-D*r9AmXTIItHLlCD@qacOQ3NWVycdd`$i_5vQ702dok#r~C?=5^
zL{~ZA`kCq!eO1FUZl1=g<2a3BDp*P<crKFB+r&fMHO=SKhd!>ZdHoJO6nBmPZRBZ-
zqip5+H>Gn#-dRsgg?q4%-#8TC0RO3)lwbcRFB8wRW+y~#^ces7My{+U;-P5nBmKO<
zabR8x_DK};@q=TYwTr#%=_tKJ4VKbb%uyFtfH-jg!X5v4r|`c0@0$0p)#Tp8DGLS7
zxu;jkoI}_KkS5H3Z5dL0d~p0RPOPeC3a5aVyji$Aa?_#dc%gN#05P`Hx^OZlt9(A+
z(herb4J82kz%&VOk($q&k&t_Q$JF|1Xh`0412iJkEpN~fgwYDFL<C=<9VY;q%vxM&
z&^wE&V<1Y9ip3{H8uAXb1aTrcd_Mu&@in#5(a$FaQJJJw&ZPD0w)!(W{m->B1;QgQ
za~6I>yO>{6|L#5<0~VN#ww_6<Q;j+~j_T-<2jAFe8c23yi^jM1)UbGv7LZY3)4{%9
zF9XAIu7{s17KC+4_UUGVqY<JZmRs76L<z!FjHaA_TLmmkUUPdU;wNP>%a3ZWX?UEQ
zS)`P|kFFzvvu>fUL|mIE&Gv^~of2+ZB`=ABl>l*3X=mK3(aCK27OE6YmHRHstib_6
z<3*2d4s==GV14mEne;`pDAsHemP(@a2lh!_KlOm<cisWD?7=2ax3E~~d^7{NTQ#I!
z-LUHz(Z0m?_#GAK0lG6y>`*TQNbBAZF!ImXb(VHTeGMOB7|R_w)0E7j4QqKr^sIt{
zSx>^8P4-R+iNjvo>Im`C3#8BBM6WdVurN^0W#|t`V%+Y<vn4R)%ya+&&Tj0|mrci~
z`AG$|ju%y1N0$1PTwG~|C*Lg7D2W>I#OX={<AWtzZ>YbK0f`PHRby<BIJjVB%qeRe
z|GqNB$XCHrygIcD!y=NmeX?9+tSx$@L_7&~7XD_;o~Iz^_h6~|<dZOnCJw=iMC58M
zdF`<jd~$~Ak#2G<O(K|W9`_ZWku|y`;-rB?-}dkMb@!`eyo(yaIs1H;-`=T`Xs3yQ
zy`A$_QK^$vy#!rhkgZpGaoBTuJ^fmiE8)RQtgjba(e+TLtWIM_HF;w)EJgjQ(IdB3
zWofviy7W7Ty>*0ETHJ>pz3iV`84U}fIMaSIX=@3n@*p?(AmL76ZJXvzZ_1R3(HhgK
zjZTg>srQise#Wk_&luIy<H6Hkg3*+=`|jl%&`V$e!GQn-1VdzP%M_p<3{P_p0m@zA
z$qn@9+xg8(Az0Np>AnBFRh|YGX-LTiY+gthyxgO6-^k!7I7GbaZTuwD`yfn;)(yrW
zSl=i95wRl?NIZYSDoBP;8R*f?6q+beb?21E5SYZWcK}O?Taj3<wV?YaRuTh+gu@@$
z+l-}#La}JZj`E5=U00rUDzlG?%m{t15#HJ2sBAc6ue&41sy-MKJ9dVUO!k=gIe`D=
zh~~F6PAY4Ln{*Q?Lsa(zUtn~6SVoPk65~pL!hDqbN>6+49Z|NeMy<$@d*~at0znpH
z`?=7?&vG4Z>DPi1&M{N8^hpBrW#@L@HrwC!+&vjf^L|*ulo}Br6||Se>%m##M!~;H
zH>3on{Ec3q75p-P&5{}WxXuXPb_2VTW#eXLOJKzLg=?;OF;@n@FhSK}CRK4!#u@iV
zReQ1F)r353K--}_RQ-gsFwlSEVrB5M{pF1eR;5L=56{%$MJJ*au-)na#2g{NY;KE9
ze}Mhv=pX_f^BqnPCIh3Xx;A;vs-<{2JFLRFQ5pEr9^Keq%@e%C{@fz84~YvCxpCKV
z=QucvMo%qt75>QvA1{zB&=jU@U`xv%+@TJJa?o~-q*=N6y9t$HmN43kLsPHDM%T8Z
zDv~qB`lk*KZ$(P{$xQyMD&0Bwkto{R6{;pR<gTM_`Jvi)*>~hR9UwqR<Sb8f`O7zg
zY1rFm{>y22ep7&gJOUW<r?Zlq&9`|@p5p$T%G_w^IuXEWsJ0_&eA<VXq*|V61ufqx
z49fS9MSE|T`2u<ksd9X_K(N#ymp+}k=9`87FO$p_j}RMN)zTkRYuuuy!*-Ng&i@Z~
zP7%OzsP~`iei$DD%j$lyK6D)kK44;gr}fT30-=H|MNvu1>})sEAOT4h9sr4^Eg^z-
zJCkxuH6eRBketc65bCIH7I~2GBL2=}USy`hkhQ@Om8gVidhL!297PLi1lrjd_1{&>
zyD7DGmVnZd>Q4v-!Klr{1E~mPEv1VNN1_jC2Hn7ToUiQiIi&UA?dC)7D^vAvjEdre
z*ULaki^^K%ArMygV5tyJITYsw53`==($K1FaxF=5JU%9O$*=nzj971)<#m$mtPlln
zoKpKCW&CLpG3<USGX3SO2&U(bM)Jn`63Kk!ogfT_$FgA$pZ?fM1v|f+9i$LRc=Gg#
z2BJ3120z-wRyS91xugK|)96yM_Gu%V!FnSjT01$06P}+xwNbtaOrq1kp)7v=QPW9k
zA#2Mxg^J~4$o)2uP8HH2E;*`Hb6{4BMu;0@g>}*q0Jh<8+D03fdOlMKXj?Zhb$<%J
zwMQeRU@ueB;0yoYQ;@^;Y(k?{X7NB=XY|xI1$P#k3!))KpZ-J@G+`s)jp;uTCe9CH
zqZ3F-X`pAaq@|_NFV4|Y)+g5+zV4P~NTg6!dhWsGSKy)NL;?<n&#+h-d*H>X@$+=k
z(vrcvWzv~f(P@$I4fV@kQG=TXqs_9?2%A^YA*Q9~nif@)zVe{I(FgR2Y~oj;&vcp9
zFP~M9WocLvgqd8FfPA~d)LF!nL3-9%5wpHW<#ga+A;*^{|3tt4T1%2FAh8o1te{i(
z02@ch2J9vrVe+@Xa3C?en9nbla)Y1gq{0Y1S&qTcPXw*)Ws&?~8uM6VVhsC+d!Mn(
zV}lT-H>t-3tkgon+qf#i2>gp)2QX?lri+u{o)BDFoy!i<cu}>NBg4<1ppa6$9A^Y}
z9f;*u1jYJkw9jjdu%fj;Z3^QxCA}oHrIz3wL{2=qt&t7ix8lAJZ~y}Vor)Nrx6M(^
zyVoh2@!bzN8pgUyQ*&tBh#MXe9UXvNt{S-bLS{uThlLqq4N<V71PF%8j|~h|nj=~3
zDEQ_r%bOas(_*QGczQjEI8ckPhvjZ-8VpEfn?<>ur^T=X7i(wHy?rE=S-%avC9K)e
z7L(s^B7e1bBoOu$|A-Ec7~y4p&Pm~Y&JYO%0bvh|kaH))JC&tnMQXK~p8~r6o4uOl
zU;^d&%_{!A3pBt+ALY98qfPYB=^^Dn7!J{~vz^>aU0bs*EtaU0)Y+N&M05_`5CIxm
z5d=3&3-da6<~{lM3)`Xq>T%mdkLi!R<3TJ(-}f}pWa-zQ{qrdn?skpe2kd?^MTAOS
zkpj1tok)i&Fu4)&oHXD;m}V!wg?a<J7#fICryDnp)<7&}`r}`3+p)*5XxC$ZFEec5
z8i@x#D>zPX^7@MNC0;7#Y=Td)V#vP~@LIT#X71QgIY4*Kp_(bVKC$+36;6|0$fD9h
z#?VZpTHP$|zOg212-utKMvO?J06EPEac*xccc6`KsEc>~_kCWnrM!(GFyA}}jxIM`
z!i&BZ2o0Y;q9k_Y$|F#`^=ZiQ>#U(BG%1NI)XSi3^T&U)%D=QZQHzA*NEe*;nR>a{
z=Gz-<xze(JN2AvC>k7t+y=*8Cv`IV)V#sX!!AW!(%7ws2@T->84a|7=sJ{+@fLFG$
z$B`1--}7ZaZeqm7Nhi-?S?Fy%csv^D(#Yb>Vr3t9mpgFnc8+-mE{(c5K*!&M*A%m|
z;pV`JMW<M_+F0LBpqL&pPHmkS3g&$fl~UHb+Og>B9<V^@7ZglaFgutP^mwfh?_HV7
zi>88wGdp+08+v=DQdWJs0Ckdm+tm&X_<DU@1w89kdhZg^sVjA}u7MI&e53p6oU|o9
z8)zJrnEPhNo_%0k{WuU^t-)}V?WJc0dK#>s2|1Fr7!Dc<K4`Z00=wCL0Layhzio$w
z6oh(N!yI5847kJ`kXkz?lyyNpeOWxKJpK2<J^rU_M}K039GIq4u-)&c0vt(pb#raX
z$(=)s0a-j3v0|oG2J2n$p!RER9-*TOP)NT2_u=^@CL~}Ictv$XOUUgH{}X;|%4N(E
zD<$8PKh{#6f099@*CspLdv7<7ORmfc{Y+<5=-INH$O*s)Wm@08v&rhTAtXu9yYo3j
z2lJ^<B5V+p{i0J;*qtJNR6=(f@C2dF-VdTdzP;<0Hw#YWw~v&TyR$+3Gt7=1TTgT%
zXQkdvS0T(GZ+I=Ae7(s0>||$5cxvkSJHfkdwb*8Q_Mqdq0e{qtd%S?CgnIN?rsq|K
z{kR@KS0Wp_oTLb5!4(o7%@i%i@{sE8S?ze7LoIor!-3Lb+29`(NnPMGs}2ULtzSnf
zg!O~wino+sg3n<o)&Z)P%RWxWJAM|ekxWEPzj0bjQFD_L+V+>!*sCGv6OH@5<R=xM
z`RR-P=HuIVk-Cb1RKY?VDh;tq$<}~sYde7VOwh_N;z05}>)=WTlPvCEp1Swbc|8)@
zyLi%K4P`MYGK59(B#d7^>OOxd1!8LA(G#(VwWTlcQ~DPgzKfUFfA@FQ6?tea%WL7~
zQwd1|$ZX0(w3z_5?vcmM$90?^j|LB6w)+?&niI;L`|`)!9iN!POd3o}%<mz=;`XoN
zW2<xbIjNqLH)0zaFBq!#3i;P^;}9;8Qz(p7_sO%X%Ka<~);+9HJ~TMlj$|&ncVYU@
z4+3(OATlQLL6=2L0<!W=`1;e;3AYf^WEHz=$|^Xsp&pIJJ7r+2zKoF8+m8@0LKdFz
z1X@Pmq6Ar$Po`zSt30g`Hr!=lnOB_16v2VOr*f<zbwSSRWzoAb@l(6>+>l@9Ja6bM
zwD(A12Jl?js`@}s$Zn<6u`(;&F2#mX&dTtr#q$c)f&0+T{ln7f%cPrE8&}5${K%=J
z_ahY;*CBz3crc5djGL4Jg^rm@WJ5w$e(6V%x7jQo4U@t_Jp#_}&A2gs+IKM|h1)W{
zskk(>27YA?ZQd~USG8$CM;4f<f+05{v8R%epcZc(G>$@4d}mVX_Hldg@I&pJW=aHS
zxe9S~=&0Xc(1085I_30j#_0bE(MbAuSs=k!;Xlxv6~0L_6J^@O4VBQ1HF3999i8@H
zyZ%$-14i=A31pYg1(uy6G8<|e+i2`{pY#97{eLW7WmHsuv>gVJ4(SHz4v|ht0f7OA
zZV+jZ?vxx#kdPX>W2CzzC8ZIh8>CD6-T!;<!|;W*?z(g5+~3(}?|sgJ{8VM?>8jzc
z#r@XM#I!#mt8mK}qfF(Tl_hNU4K4<xeCLZkktfTF7^HvW?l67>Rh$5E`$XFQqJKcR
zAeA9!Jrjn%aD3x_%Vl2M9-vBJT=YAH<bN9%4HcdFuTw{di}%YfQZYNTq=0GLf2iI#
zIwZf$oDr}r6{-ofM{1Lb>sLwQEYBOUCwUJZT0+Bfzb0X6WI`r=mwKAWcqhjf9>@85
zH$7)vamwV#j!XuNQwGDbL8G7ked|xt)3VU@ztNrO6UJEdX}(K<&w`@x=koyD8<QDV
z*_{h=$Nz|>8!FO@0}S#{#(%|oFsoW1Q2JP}@f)p^{{;vh3IssblRVH=w~rJ*3^Z*B
zBYcOkIg{DT{w>cv8(2w~z_=rymO8FhnAxId59~()Ht={VQs6n?vjR*U1u$u9Gxqx2
zkRWvE<H>_*<jPh|$5uni_ZT>Sy<|AD^hf$#w>M4>d3gaOG5Mj&WIht%%n!<8iR@*U
zwejgD)EFqPjMHT%bG&=GuXg?zw4`8uAy7zC2!KCM5dm)*Fcl5BOD)Ydk8L;jIUV(@
z$i{%tva>4v1CC<XPOP8yktAQrWlFxgEmUH3KKLk;)s;6w?XmJ0VLViJcY&1I_e_pz
zrReC4a_aKx=q7{mnn$sBTUM)}pZP|l4GvwoxsPjq%8D>`veV0)Jk{#r=ahux(}y4?
zt>rSPV!{(w6i<rk;lM<=GSy0E<ZzAt%d?=Cd#Lg5%_Z=kN)v*XL)bjYVJlK|XAC3C
zV!m?TmQHvmdiD~qa^nS^w)^&T&{cDC<?EwWwooB_FwHJ-c@qwv@G9MD5^DMHVM7Np
zGnbFWH{T93fSKU1|K@^o9aDaNlC)2JZZlFX!na~tQL&Ds4gviFYzfD1=me1f*Gn{F
zXk9Fk#^yP%_d_qNVxTyuBHo^I2w>u0^*v-8E#XfOD5NJ*(^XdS`M4_=C-Z{WSK>Tz
zI&6HmUT6>aNS-%woNYL2h~ONOAKl^)=VwS2>Cq(#v>Ne4Gfbl@2CeFZ>aPV5&s+sC
ziAYJq*_-wcKpy~X3}Ox|QwPk3AVn_|f_7Hz+mRoFqm7JwN^e!gUoOo*NR>bfBZ9*;
zrd`k}RY!aKMEcp`0I4nK>@XJI!Ri<yj1w*RQ*A1V{=W&eavB-Rz$US$V>edKNnkm!
zu-<dd@hvdEyl>_HiK}_Fl9Dd^<D1wpKB9o{>}ArxKGX29mA>DEkI73wTNI`O(bv`c
z7mC;peP7B-r5EfKwi>iR>_Xv<bQ+9zCe(g0f}!$b8E&+8Qzl^|gwvv;74Ax`>66eI
z#;NY8p4I>Q2yq10aNaI`3^UXI7&B!f6PBpp0Ziiis#6kHlL6HV-QvY-Cy^cGBidfe
z%JYzJnoy12Kuuf)_dByvg$%+=sWb2g94j=5WfTZwV#%bmm>L`4Y_NybAMURxy7F(|
zPrGtEwh`me9`9GXaXY2(3jSZ`<b;2G`Fx7-JtSNKb0RFcUHh^Rrd2j|0$A!qGEXpG
z%2&m09U3h-cI<kr0MGW&X<{yuD+69Ub=XiW7bZBlC?&ZAOuJPC41(;V`5sBq%8+*i
zUaR-xFWM+tTqDH+C@Nb_LLPj$Kl%>+C`4iWZw+_o5eM48{l^p(0brgargZ*ZhEUKU
zAGn-!1*^=$;L~yA)?l&q>mrdEMZ-J+hd<+U9xEbJ9y++Kub5tEn3T#T=DxlgJqv6J
z5A*`+0avWR*%46fLG}A4Tz~{qrwwMJ0Y>r0avOxmGQ~bPbvwVb;IAQboE3n+)F|Yt
z8C0F1F5U+33zReA)#n%xScGR)ljjs#tu)Xb@lg%KN{gAl?Dqll4zdHNUEE~er*XZv
zxAbYhy_a~)nQrJ^wdZ0%M2g;oG`%<vbg%psvEpK#)5GAgtp)m1T+Bw$sLTtHHc_1q
z+y7B~xhk!Aox~K!2z#~HS3&6e4ygf{xr@1-2V|f*ev5GbZ=#I>W0|i{I_k$r#Qh6(
zBUq0C+TH#5x!#^iIRwY=jLqDr?oG?y#zF#blAJ=KF{3rmKN|a*;Go6|nmDjT@S?-U
zV+yM%JIQFOyKD_xDPL7KTZ&10q!t$oXgXl5u{=S5gAe`mRXLCpNUMfaZ1QN!eYnaI
zmQYWCJ(ysMeY58N;R}A*88o!?ie&R6Gp1t-P|6tjHH}|lT|5&oydw*tTBk_)gvWZL
zzg1Kl9&cF`#ei>@nb;4gHPXQ2_r!{8<;Vd5JN=2lx&X23F?KU|$Bs-49l$2p$SVNz
zlDgW)d7M0?Xe2ya{8XbY;8BXvb;#EkFKRa|KRdrK(5Q5)^PJ-Lmvxhab4q-{@6W&H
zfhuf2Rq9iSWR9R3zLc5IAdp|8Go+0S+mxB_QgHJ%xixeE0y4ULxFZ^;5d3#P7uaII
z4mcewR*P>wm}sF{blLkWa*$R_i>955H1^P)qez?^pnwAJDY=-M?caLBxBL-<scw0S
ztXo~0gB;m5M1=)hW`%t50c|daqpS?^a!I9!QF2P8Ao>}EKaSlUbK<4=wrv1UxH;&<
zIEIHb&;hqVvUDK~6)FdCf;=!u8gedD8}XAN8rF_p;L&;B#Ra?6MP7Q1ae8?2k@L;?
z4OIzJLZ+i5@<Y(|is(xG<`9k4SI*ru)l`w+C+8o1gfbV@-q(Ih=c@1a#J2EO=adLR
zjrjIqgmtNQsFw5d=ohlkOdNi<TFQlAFYayz_eQg-%iv-+N}eAO2N(Mjem5&EZq~l7
zZ3ph!*)k|ZS3&B#l}6A|#WBl|IW`@xxdwp;-D6!bufBGMwmIJh+yn|_tPQBB{E)(V
zc9Lf<xCZZrj#Gl=QKMU1?22$%!K}(y4N08sC^4E=`Vl?WK`%i@-%BG3mZ=*Uso5LH
z^VAsIKCwgEZ_hdJRM~Ox06R-hsukqUQDROd7x7ip&K6U`1^Tf@_skIW-Cv<Q+2){|
zLr~v9IJeCky%cj59Eg<_)RVb((YDk`Y=gY#0N4>57_><)w9ztHqR^ic!v3z%I?<x%
zmDfuT1uj#_Yd0=^!_?G;@0EY_HNU^heK%R?(DnuCEWSoFz_5ELj*#w}+oXXn1|4+J
zo$pH;;{R%Mqcno9Yyh$N&3x<f#Ns4gm!!>b__{=_1AbPNm#SMi!S2BsVwcSZ9yo0L
zKrC;)TMAZ~>#M)T4kql}nPJ$jvnGq~AYF34ZU|LVpV=$5j4ztHP*(n=I}?AA%*%QB
z>nP}@Myz2O7U|UCuCEpOMMhNU!1Uc}B+JPmZGhUuh6*IRV=dp7$|LNP^r&(<Wp!HB
zh+PL&^1j<e)@v@c>fDo^5fx8mEC{FGmKWP)t6mZttP@d4IhSev+%zewvJ1uNhLTqF
zh<I;UBlR(I2%f(fk`=}~dEAX^sY|(}e0&9Bz2xh+3~EXO$LO@%l!~6AORz2m%`q#@
z`p>EAI`Qh0xKTW##5aaTvQV{=a*rLpzR+8wOMbGH47)$}H@>89Q_81d@-y|&U_v1$
z87;T2Nm&q$p@=9yKTjK^ByYXNgkqdRD~+wLus!y6Ql1PDZXafgYjHhcn;{$f+LTOb
z7MVph0rrc(*}j)vvww+Sv(wewh9{%F9gJQiVK-5Fxm>zmUFg22GG4b=lY8uMA0Y&H
zL5BPJXS8YMo3=O@r>G9Ay-}~EpZ>8RZCko1j>X-s9OQr&Lh(1Y|GJOhOX&~gqlcwd
zZkq1eV3+4O1UHcu$IlRbA2l`UD=5{<jqfGJH8xG_;non{HvL$58mF@~ybtl>MZzZc
z&$Z~Bs`u|YgtWa;V9LBR><^!AL%nYlWluCW#(Hi!R4~2N-8o%f*1c-d`5Q5)WW53f
z^>-Gmn1&_mX`EOLSL{WD6~O(P8`huJc2;|HqjP#C#7qf&2oJ+z12T2`f;B?ugNJ&D
z@EMj1H6Z@SKc>E9ch$DGsc2a05*sSdImD~X&%FEqVuDnDwYsSLQCe(KfgGFc?yaqZ
z6l;y+g9$nvS}q|u*{AB*hL!iY>@PluIyA#sTKScG-}e5jeCuP^CF_0g6arGl!`%LP
zf2SCH78`=MekR+I)D<Ap%EK1?HlXCTjv^g-%S{o-*1p~l@f|EdlBv^TZb(AR)^%9C
z8h=@h3iC)ZSk*NpV9zW)xSAqBH+V1(_nm*u1(qaa3CT|#JdM}IlRjBL>HB>DEFpUR
zw2bHtcA-TJrdRZtxI&bQ%c5?~<h2io=Ayqz2&`RC#O(f^CU`P^u>)?YZh#XF|In^s
zNqp@rZ-fW2+IgVjHEJqqMRM+#OqC50^<PMKCRyW6(GAd0EcGU+DpaN~wRX9=HZ4Vs
zU7R=6wGP+KHqU3jTU_!-RSuT&Gmmmj5D`2$7x1X_cpAnJ$GIS1oT3N8+U1?*h;EoI
zLodb_u`tQ1ye4aleJ4>cGa7=3SiwF-X;m%D)RV7u{;C+u>NvutwM&H#^V86!6G&L+
zeyZSdf@?^_fhkwhNrU_jX9udY6b_^w|HSxpoECHjSk?Vi($R{z|7z^|OAXU6c07{W
zUo^FYi&b&{5o3)|L)g1TE#svVk<(4&iFu3$F4)1W?Xb3{=Z(Y<_c=sg6Jmbr%fex?
zTDb<`{IWmZwh<cqPo%GsTd0v)`~@+2w)*}6mn@(ro0v{o4Bt6ULjyIJ?sE&|@CYH3
zxuzMER(ZQmsLJ8gS<_}}wm)~ngQQnAXl*da4CDBHiP<Ou-`4b-YNL~7g8Pd%!VB3U
z(Dl#`AFJ7dQt2cFmhTD4+BjH&L&Ie!LRy0fm8_`}hI6iyx4`a61NWah0tH*ske~QU
z{=EVPq9>O8Y0voD`WdmpNulIZ?eo-e@AVweU*|0Yr&S_XM6ucBiI?3GKZ&dENvn$K
zc$VIe)<9PFx|+3NfS@QN7{4H%jSL;Dq^h^yj5;RTr)*;>^W<6o@iW1iCFUSWy|GSL
zL{s~R4O;u<7=%fOC?NepjKCn;*G5q`9EeC~gZvc`XNmE%c|LSGp$>{h+LScmEtn!4
z+7&+I+W&4s9Eh-uGC1oXmx@|&)ymJbm2UU6i6;rkCsvP~s<7#g|9O--V*NpBp0!?s
zbFHMqZC<rYo2r76zU<V9(xO7N+qXb_cQ&OckCpWXz}X#Te{4FN`BzW>G%{B>bT%^l
zCB?i~6w)mdoA*lf#Lp=Le_(3XFq}Ogw8AVZY=@!1L{~$~NlBw5Vx$GaB(^ccDb{bJ
zINam%ZP3e!+kUPY(-yQs-{4dl`zVFVtG{b>?QIkmkHcu2v&_A<AmR0WRXR6f74DG(
z%^;D{wbh(Ykk*j*df)M#Pt{<j`=UFKQ~{X|4ErF_VZECpcl(l^gjdpi{^y>+U-CZz
zBeZhCiSiMHqj$D%(Ik)m1iS1;(B~vdYZRfx<{&}XZRosa2j>GdHCAIV*@<5u&+JAR
zbT7#50YmJS{$c6_3k&6s_r60_`r>Q1itK$5k~ay?heaun_FvfX7}5f>{NaT}S!p&^
zF##NFdp@KRugp-UfZOYceGqe&_fTCsZir8S?y({<6mh>{W}<-<zPaKx>0o0fn1sxT
z`s^g0O&)d@Jk`~{SX|ZNDL9Tec(m!LPyV0}MCnmEvhcdLc*Kt(s?Zpnw!OKE{8#RR
zKi-Dq!_bJ>I8E?o2n+OUf+u}nSJw1jEvF8$J()shv%@1ty-Sky!dsmEs_%(GEi@GV
z*QB3L=cKrUEr8RARgV~n2)M(Ld{sqnAY!n((ffia&=tw_MmB#YH(ylgug6h~i3K^&
z3+T`6ViH{iaMU|{n%-2Pj<9_}Mpe;~si~~160DzXD-{i1kq0?R!VjP-NrjWl2A!d1
zJ$1&cGes0I%w&_Bk+~F;&SdMCrNwyqxi-D8*r*hV;?xRQqrT$;CM%18R$KW|sOky*
z7e8Vj9&BwLy0JKON_}aikaOq(bXgCAmr1%~?@{H1?LuQXAtc}H-7)4gUhs0dlXzC~
zN;6C|KX2t)OgR>cA(l<MMBN(UBN9Wx3f>chpqN;gCAPrOoF5Coa=iNgfFoW$I5EHN
zWS5H_4W>G9BOWWBfC~GgG}|slX9@|aeUZ#`r`O8OeXeF@?Ik0!riA0*r9S8MvzN27
zW+bFICKW8-CZ@sclQtYLGXVjXOAvKk{4!=Cl}<dd(ieEj&ZBDm>~<H7cKXYhX<8ST
zVzX7N@Pye0Wewbaey4IROyb#ju~=TQGKY2nVpy$<O@+(Jp?^$dWPKk(gGCVHKRHVs
zn91;#H#Z`EIqJV4OS!i?vsWRiwXDe5?R6<LkzdX$2q}hroiC+3gJ&apfSiepUl(k!
z*>k}zh!k6PT2L&5|6v#3l*i!6nHAK@Qf29sLhN*u_{o%_tT5WTiV2IT1OFpx?1A?C
zXm+Bj!U~pzEv3=1?`_p4$>G+yv*DIPNU=J49LjGuGyP6_muRRo$d*{ni4(F}o8Kk&
zFT_dDNzE8pVv%J|UHA>0<t;tapEDmX82A#VF#bGHwf8Q<o`D8v=e}8~eA)KF(KeU=
zGCRmIkTxX0^JBIk%xU0&83XAZrn`9k^VQ_xTSCb=Kd1X3VnnX1P;ACouMC0%ee3xl
zfWY@OAoWHwPj%A=spGJLk%lHgX1D?!ilHBDr&r{K4Ow)Y>sEV7zyBhgWqNl2#gA=*
zJ|`QTL5vk(th_!@f<{Kn3NEVZ!P%}5>Zeh5K57h}Bm~PVqnCmd=;p@^<fV5zNmXS&
zjbs$+7}VxERr=Brv(BZ=>9y65+FI>%ikYAjITj)ZqqBl<7a$h-$=2SBS;8!Ow<N*k
zE6~jDVOY2oZKH*VQ;Pj4G+vbY4giQC%-m8LtDCKWM-T|0QE=!GH4DZ!t{l$!sX>t6
zZjT7!Hi~kaN*6?*fR4CqVE>PUK4l57<!q4hm%Ygk$Rd!!NW9YvZuH9`Z(raoWg{WT
zrYa+QWH~;HnMM-_(Y=7Z+FI!sLj?FBk=&+Xjua5;zJiETOj7mh1Zxn(2i@(y{?rx^
zO-WurElVl6o9RUR?ls7<yz!gu%yT|Ovqk_XM&~>{tNs;QYz66VCWHQqv?)n#{DmD3
zcIgi})80@78&<G=vjD_*X2K8}$}nMXjl_V@!K;FwJls$-SW)W$CSoHQ)o9*n7<Sgq
z>#1^Rd%zh^)wX&^7&I^0B#Npy`F-2JuEe*}msHy!9s6oH>x(4=iq$SpHCTS+v}6(&
zC01IX6{*xI6e((oHkgWas`<BvDoIhwo{`$NkDsp=5`&OaEoXdgX(0_~dHj06y+MgP
zKC7<<j=%F?gWOV0MdcFL3CCx|znrU3M_b%BB!}>>pc}3(+Qde^T=XrGB){q)c_<?7
z*{^bf27*$)GB~qnJ0D1KUvBvG$1si_*r}QW9^$ByU067{#zH@Vvpa&bq->U#$yqfV
zT4|DX$ZzFr+|E2x{m7<%l0sR#Nc5%H&yGeU(U(->H6v<lS`|mm+lnL>%x`6s00<iV
zQF}Y9>Ht=tqg9!Sr1^)u;Zi1uoM0uFhhyBiU(2~jMd{@fl|>?*W$inwV0vS)lri7k
zc}?$HsvfeS2JxHlTls@s(<e@&q5gF*D~(DIWkb#@A@tumGO$Etoa`SjjnvGvm4GUr
z^(4fOl+|^2%$H0!WCmFqjYwOQ(^*vxExRMAwgJopVbu89la1g?+B@mk<Vmz*f=~%E
z@nDX62dZ(lfl8vh-^BzePZ+-xIQybx+Ve$;&#e7oG0k%ApE}7PRqNwKf$`GkrY9G^
zmXmftdkix2P-Ug?0!{I5y|6VAPHkyilV*+YpR`NAG=Ku1vRI5x5sP~8X%3~y*+h{6
zneG*8gxoV9ZBKyLlj_K-vJyw`5EU*Rt*$cA0`kM!Wnz3DdW^<8D0LCEw_F#KhlbCl
z%;Tu9&1RPiZka4^$+}$B$LqK<D)#KUa;rL2LgY&*;4t|5{pJyJxNsxVZWrKa*z_Lg
zMmzhLw*qn{Ae=ab`?>^_R_IbDSs*dULL_Q3B^uv<wn}A&_%D5CNa_lbStL!M8YlFn
zmT&@HQO!A;IGT`C*3T_W8h;wu7~QP@1KVNO%z;e&`c+GrVxO9P@vGR2h;E8+1)VJ9
z+c%|?<>L*!><0lzBu(?J*RP;aMc7313wwz_%S%Cdr?>`qdUm}6Ohz{si$mQ{ltBdq
z+gliiLg1_STPUz(o8I@Ag-o<(?kxDo3L`{Ly)oLHW`*Aa^T6`Nwbuv55urGX{s++k
zmuvg|H;$N*EWSa?Q6<>lJm|(R>J29Yr(2`4g!p$-@{%aRWlrdSW#ug@EbA>hcuZzl
zG5wC);pH|ah2d-psFaKTi1#oY9$xI6iO$sdAa9o#VT>>|khBgMph70)t^&)y4zVW+
zM}<iX5T&^3>>_HXec^VC=rqD87K#arek%jr*JJuc*dvp?t(_mb>4~$8emS*jedwP$
z&=PJoNOAejX;8KB`+&7L#Ez96Up+a#`eS97wB)a5Lc#5P$j?m_*Et>T*h_%P2&Ui8
zYg4Q48^_DJQ~ld@)<nT4Sk8O0z8^WbkqmD;z3jCF7AO<G{IpeF43_Vlv(MG#PvOS^
z^%nbgXnty<p8S+F?lbl?vXWQVEWo;xup~I~RVf^wRny(vk%cxj0GhT`5>r3NZnq0p
z!u|AV*Pah3*kk-PDScHL5^j2_MVHGqH!7~`#SQ1d3MwilEC*I7!!6D#dwWiz{d1M|
z!5ZPK)<dG?UnLj{XGQ1y{)r)Np^#bQ`jUZ87bGO?y9#7Z@|(yTt+e%N%zxiO{(?*T
zE_m%qiBtAY%bro`h~)c~uJE>`=U!WuYp9C64E6o{VKM9V41fP6dNN)7AW)FKQR6<w
z4(FSm)rcsb&h%c%hwurC(CqO|CK3J_LK^<$C2;NFBmi-eab30(m7C-I$(|W*usJ$B
z6LaCWu22`@nzk*WoLlO;njQ2xgita@wyA?eTBH$!D8#$Bg!@Kyd-QF>Mvb4Z*{?A5
zb@<ZxV(`85L)?a2sN5qphY2uS_1fqemM@;Zt8sZgRC!$AlG}J)j+xVCC0+EZ!sgH)
z%+$ssBsz0Eh2uw}qHAd^QFAw%Y%HjK!o983Fkh8_gUIWOty}<(<Bru2M!a$qz%(dQ
zMD*_V-FT&D{Abs(V&Rg+JCPA(#gKp(jR?cvY!r4s<39hWXl7-0uUkKVUsscv@Zgxr
zwe+2nV~&Z3NT2*p0DA?qCx^OCl*Sv|?Ww7981c&Lo<q3aeky-<d*?;8y*npZTP#w#
zrdsENvdL>RjqL%IM<kQwL@Z&;wO($$b2%0_nC&m-J>=VJ$S|bP2K#2pBd=DhJYOV6
zx&=#l6H02zWVHUHL|P+!INn5_ZY2)I;ar^FnFiuZyvyyZ&|PC;PBObP;w3IyqjkI2
zGYv%HW^V0v{0e|u+OOMn4%%b<ydHv_r0jEkf0_2gP}$Q)!S^8*D9f@yDoDXEmrl$d
zwex&MBl0M=(6%|B;7u$=6)^CH0E<lEPp>ky85Ch*P%E<zwoPb74K?!TF*=woZX%$l
zORFBs=bd4;2+6NyF$}hmkEZn&4`$Fne+7m~>wk>ANR&Q{vt9|^rO8AA2^Z~Vd*7||
z30JMY1@WoSzuoxt(-ief8kcz>;%diAzrCU|)BM4Bq#nq|vJmYzVIQwHD#8DVSr<=p
zma1b_cosA<S+;Ip9w23o9P`oOWuA{kktd17{E;Z(vwXX&O*vw%LQs5^>E;|vYM`6O
zoxeiPQ!Xo{eWlly-h0BzUl7Nwv6;Lc(JB}xCbZhpl=nv(mnic6ooml|m9)!HArBJh
zxN{qi&+PA@5va*u7Mn<*er{1LVR;%EKs-a5lmQBzq>(pIDlSHttb&OERDsALzhrGp
z(((N&{Zg8Vc6OQ{`)xz5qpHqN0VslANYs7o!j8^UQ8<<71SawBKm!GTcE_lOw_*#i
zA5jzWWQX2~IU#!=n#u7{0e2qb+Op?36jM2MwwIcJ`Rsiq$~7$+lzAx2ck>}Yzvg?T
zsw%{p!R)e?=VUm4u|k!x;Z<T1v&mMg+tg><Y+0&Jn*Dg#Vj;zPGJW;gF!9ksMvHXK
zY{a1o0jDOq9!Sc46QFxO4RlAw%nLb;#D|G=R$5d#8)&p%S#zPM;0w~}+E8JWM2(s1
zQ^4%D+`9F8;fN!F=?X0tcv|9$oH|e-;*)<RVKpc}(L6s{@tAg&-{v(y`j6LA{!*&^
zJo(w03MsawGzkm|(@Nr8>v?qUZb<t;>}##QsBZ*~-iuc^HhvF)J9eNZ#ODR`{VJNA
z9oBLjY#Y-(lOz2n`lU4A{H@34lqQV-q+w#{X8m*}$d1Zab<vHzlQ~$UBL+x1`dH`L
z&<U~*J4>TXmtpxUEB764yoO+xY$O;;v`Hu2X+iH51SPnHmIfK*eg4z~I)6e5?)7_S
z14o0B<RH?WxNL3NOhvWQiJH6S4%#2mWpedcGDxjEU@Th;7;e+0o1h%4M48;7y(E|2
zRC9HTk43Kv*+RKF3^qb2F=BMm4#$d#364JXo$go*{)x-)=1ak|9y~fnEvjx(5ZsP%
z)Q6&dGm*y(p%0hVC`i@Z^u7BNtoxvx0<!x3@L(V_gyW6MoO+a)`3{q4iI{62DcP3c
zl6~>%QaWwS6l#%~JUE67EBA6Il-f?b{GqO0uam>|bz44wy7j05^|Ub&56+_0QAz})
zSTJZMvdO$sz=l|k1SL`t{@J*<WMWLEwdh?j_wi^@9e2~G!-J`TS+|Q$5AMSk?pjXx
znXfJE&z<yAwdayJgg&Ii&3g7JlwZ=EIf*x)thO4jtwdy;Q+TKyc-L;GT*I35`}xXV
zCNpNDK-gjm4pS6j-4#s;%=kuL1JlMm#r@Y*!*wTN6ytWyl7XzN0XJlotSB(ma2f_Y
zUU1Zl_Z&j)Mcdb5SS8DBs0NYD^|0{OpiO5YxD;5P;)UQtvb4tiDsrqp2_Iy%S6@?k
z9S9$y6E+CSa2B2lNp71d%T;rO3^L+XX_c!q1+hBmuXn`;nWpAm@tV=A*sBl{-6w_V
zPwd=+_fG$=Fi+K$P{;`X2CwjgmB0V>A@&IDXqhnfURpOt{a!{mX3RKE_a$=LXeA{Q
zj?Y_+&cjN=syTH0Vrw`-tY&2g6RCjZ&u^X|-$&~{(p<m~1IdAW&5x<ga`C<7uftDJ
z#5WB9q~ZtrUmOA<$-aU>jvk)MT7<TI)FMelwM8$-1j+}>#a6BAZLyi$1>kFLY>d0U
zCnU0AEhnzNN+x_&s>q|CYCaQ7t24!s5m9HjK|+Unt2XO_y1`fDHTbMcrhh3@>Vnx<
z<g)m4zDabZ+F3l!I%|K2w*w~KK3VSbK4Vp3vb6_b0gJ&z7?Q`!SGu4nE9#k;QaG`3
zTB-E`rjJl!kfaaC(`I@L=pl(l`dE8QVDgvMw=&evY!<>-%|2#4DJAI83kreftEq-7
z`)C%?V)14Fxi2hd0Ch}^@VIcj-{Hj6hJs%s{sJyRxkhCHI)JImJ&tC|(MT6$VHA=K
zo~l6ayS*f7UwoG+sxwZ0q5NyerD76mmzz^4!(lNhlw)jSGve#PSStY!d_gq>?dEYQ
zv5OBv<$s+9&@tzFJX?A>w7U!l4M!<MdYq^N8rB0Pqt4t|g-y{a>6ffEIP>p}#SVGZ
z2!S#a6a%8)e5F0~P)O6X@mq1?1wQh?SKq&VbqQ)H!3>P-NR}VNqpHSWSKOLq0xtuC
zO>VL8O>`C08HzubjDNMn(RMalb=P<3i_3a4{@Ze#hPjy}oe1P9V#9^Zd>WH0=BaOv
zOzmE%<APN9pcU@{9Pi^ZTTrk`FFab=<+P<DR&>`71o7sV;4Q7$P%Xk`JW$(!h2MUw
z33ge^aCb3<H>Fr>^zZ;Lx<F|12c%PddqW=*?aR)i298Xc?f>EgR1jfO@#ahr+!Cn~
zhs`c3hBw3iuE2dRl&W&!7X=qve%_LDL6tpD9KmwW+&RBb={|x;4x)@M-<!0ej{51k
z72u<*(nk$yP=(HZlz9F<5_TpgaG1|aPScTvgxvjU;T%x|4Or4)ItlL(nfc5-Nw@O{
z4bJ-5oB>#!pS^(3{%t9l&zstk39i8~3Pib98Gi@9#4<49!_MfOhI2E2tXC(2VBX)!
zL=Q~k{MBO$_4X!xvoP2N5V^pt_Bq-GZsjIYS700Nlxh(>6}=blaFA}!Uu2?(SZKY1
zKyCYJD!PAKj-XC;!v$bR3hO>G!>SU-34=Llh$}B6>aW{2znQ5C%QF?<-wR$ZpO%AJ
zX;$ueQd;xM_P8SOIanJfr7m;_D0^CW2teEKHxOLMeEr_a8YghBM0r5ZsU$4;^(W)|
zyKx*!a$ftlRG|jDW3@DjPWUh1oI97de@$~+!i5y--G{Bn69d@aiGN8oPc&DZt}IhR
z2f=Q3>7XW>*ZhRf%3jw-9OwC7Br;>~R~oh+it-!>w=mDhhMW}^navle`@KFe?;^Ny
zIVIUE5sQx2tlmuIeX2Au(c%>8od`=47cGbm9C2q54)AHg<6yaC=86)_zYbF52I0H)
zoR$1L{d6P9y#Nh2EBdZ%%XpbH_ixJ+v6BySLU?&R^{jG5{x5cb4!|Hf9LL&H@Wte<
z*88SyF&nZ_VG}dF_`$=Zjw$+GG%8LiojmDA6E%$vuyEG>vz%M-zk7hX!th$<IboO0
z=iID}u-g}Iy-qrRn0G9@4j)!cv(k8Zc($8T2x>AW=YK^ipo3$B0tu7STDL`yhebq!
zTXcW$3u?cJeIx^|tr!P|Px7lw&>vRg00kcvQ0^gZng2nF&2UaSpE;<T`yzAv(ZIm3
zZCtNgucQE-;4lhRZK#IWSY7K?>4B<JxVl<vZtEFRG5{1OW_Q%s%t{Hxj)h6|2geA(
z3c0PFFIkJ_db@{GZJ1Dr(9|C|!L>hri3N0<i@P}I&@<9TNhk<9=*r&@Ce@bWPA3s#
zQd~8peO;8>;k@wZM1$-bZ#`!elr|3Uq*w*KhYy1NB-?yAEV@fU!%l0<f!gHU?H`q{
zgf26VA~riIO|-Lg-8>o^nFniEzFyn!wl^P_94w4+Y@%}>;o*Ubg6Z#P7wJ54io5_?
zdipRmRXY7TI$kJne(|g4MWXLvD_7CVmc*I<9~Y0Gv}Plk_^ju8Ru|CRcc+Wh0C`KG
z15hye-J=S4de<7ceM~4xqPq0CHtn$1SH(=`M5p><FcbNdVtX5vZZZ>aC_}WATk7`n
zgem!thm=>GMk!q;0ZKmazY6;9B=qj3OI5cAt>iz5*O7z)QH)+kn!3B~eD3x8UplbH
z@w-C+YsRC*V{8thlM$K`XnmG}F90$>55HYazmWYVBJ~_J(0(of`cHR`NSyAX%(kBq
zS;Z?DzYPT8zfgTJ0{-SahVOmjN0Xocg@tTNy#$5T)XC0h28aXpus0^8nb*kAUCsPq
zF=B>N6M$q-5b^#_`Eo@`!b#xfrUOLh?jHVYk~o3*$Pj_J@>u4t-*lcWhP)9IbXWzU
zTYlUQQXKo2cyE|({K}oC#S?y!9}js0GXFR89RC#m?YfHLXesacTLKEm{Q3vvjbFC-
z$#C5My>YEz7?b_Q{4R~i;7p9{<X?&StS71d=f!80`S9=V#;hxw_lxfSM$K=C#t!|&
zNJRqwl4VE=K?mU1(c>Os<49p=yWzY~?dSTxcZ`>EF>-J}GyAuC2lOQ2bL$Zx`07ad
zy2Q->u&~ePA@1Xz%=U!tKL7OLb3dPl&Dr4=E#AfeOO4QDbRxgocw7Zliy7Iwb2r^p
z?YqfNg2Gl9Rt!aUw(5@2yH#XT9*yMgU60StuckcC+JibNcDd(e;#m%OvRB>GBKIgf
z9=E)w8~tUYo_6g6x@<Se3MIE&1@}YonT_#-23lU^{;K%Q9QZV}I-xzjY`t|KUyj$H
zzA)!7zG~Q3^x&{Ow|k@CxKvs7W4Gm_8*6pY@*KYL&2U^E+1L7_ohnwTro*eSi;?Ft
z-76u@F0J_p)!UC}T?g3lFPBPXuUbweOvH|K1@8@(d}3tG6YQoBn?yxD99waxKZ2CA
z)jF!@`?@SYKE4r6tG>_)%5M99cfUE#bwsr&>W@glDN{Y7zD|JK1F)k}LQtLd)4$Te
zrg#<Vi-#_)znLkNBUjO@oBp|v8*!U%q!G%i2L`2ggwkZ<XLUahtG<$USSK>^>pf_t
zGqy|@{}5&Hj4V*wYu#0gA4JiPT*;gpuM>N#s!TW&uIQwvV};N7Hj2g1tDT_W<Ad{-
zJ~r!wl+DI2rt`*6>*WY*n)Kko<NXjIJ~c#0@7+&-n{uv*c^}dehrPzus=UZQ6Kzm$
zzSs_La3ANu`mz!*azc7Ve$u&pb9SeNaFNx}ZvLvbD^U*}ATlXP#n2O!;vm?q68Z*L
zn7c-DO<35%+SFwBGBK?Bt)I0TOM1mBm{ROP;(-PQU@&=S%7QT;P~sNx?iH0N%3hG%
zk`CQ#$fim(ieq~53CQhQjVDh*Xs*g3?oHFFV@gVd%s=dTe&)B&`kf59kv?yD)SX4+
z8Ea7ux&%ERcOioSyF||he<xb*Df5oUs)f&E+5DQZ`q&E)0HtYe8P|FOo^`^08@J?9
z&>#4C{Db?x<Whl?MhuG_N4jgT`t2mTfYibYXgJKjL3JZ(BUXY&BV7PC1gjg5r^IF-
z%kW1OV#1WlsMQy<xBiWF!aRDPuh-_e@M37*Gew}Xen+#x+EVo-MR<3MdVuKd4~RE0
z+gEPZ6W!f;fS~LHgc2T;=>qTn7w<s$+Z4#GGCo{<DqWMb?8^8W%$-coD8<yO1UKS+
z$Jz#5M>bp@XLcs+k^1eQ^^NS1*%G_Dg<qb&M7NKk5t=544=J<aUG{?8hdbHxALXBa
z&)_ae&E1#7sX2y0Sp+=pL9@l@EtPuTn4b$Iu>Sc(A7}$69b~|yvx*#buXJ^}g=LAz
zS7`TXAl<EsI;6LYGt1qAnk~*{&)-?ezOfigk^$5~4)G|8vB4V~*+zPnb2|pG%eQJ@
zP-esjDIk5M0v%aAoF2WkuPrQ(rjm|stY4WF058vO9an`6<ynMdkz%T^*LpcVU(sR|
zRRo`(W{IrnrCE*G29iSd7tT^K*E=r&Wpi*uRP0*Zyz>a2+OAwLVbiZ;jM+;Ld5xVA
z#)hex$`b{s$D9|NH(L2$GyhWy>4RAluhSKoLDEP>O5N)ra=9ol5UdL&&Len|V!O)j
z9oS`k5->nLDwz98lRHf@&Omzu$i}DSD&Jbf(a{NsDtj8xvTAag)hivo@pf3DheXWs
z4w^N7&CDdgW2`=@e2s$a6Q#JS@r(iTHk*(F2V)VC<G#-&1?S%>Q>LbfeAd^A#{rPd
zN(r|86((1mdUD72n^P~Mm~vD$1I-V2f7T-U&J7Nf4?cCWO-2#~Eu0c#5uwH2%OR0S
zo#ol*U#S$`MBS`CEeAyg7D$mH$rFbvL=5R!gaf#o!#BbECh_?hhj5kPw2nba=!`25
zOeT@{W6H&2toWP6La00icdOteq^bUyWowU#U+lGD)-PmS6qq!5r<Lqr@V9jJ-mKe2
zLY0rmeF|O`L}&>vRHqkQjx9LGUx~ZbT1qLvV}2Ju)I(eYHIf&fw(6V)`4eJ!g7b#~
z(nm3MyH6d&u22hnJAFm9dsUB6CM^xw7B>@e-+jJ;`JX_J57);U_F!N)f4w?!W!g#i
zL_N!Z?E%HNmemP4`1Ys0*1-SISIWi|lvmg|4Qt;5TwJV0a3yN#!Hjf`8lDbSsg8y%
zHSMddPurr{$#ezr-4QamHjWA_4EJh6&Q7hB8T3}+!9cFRu(d<E50TS0Y7%%LV#RPG
z8z{5Y5M+v$$rT3jH&SwA3sY2$n@-Q=Y1t|mAND4zfGaL3iAdz78>)w;s_cDBW0i?f
zaqz+gD<Pi{0s4Xj95iOy*sxpG-ZBx`esp@8dUKP66w~;Rg~fOHqBz)M!*Hrin4u&{
zs9bEDDG}Z!Y)YjG+{h08xG6brkd=N(JWvUdrfFx&SRwuLI}avAVhAqOodoluMg!_L
z6L$I~F^I31D1=@DMr36R75VQJZ79&R=!j)+S1?ZIHZtJCNFtD21r$e|!#LrF6C}{A
zzq~I=<`y%zDZr|+U$TQsy-Al6CFUPpdyMvH@wHx=oqPVS{M)uZJE>QS982Y=yqj&|
zQuL|XyMI~VkOvrjT?JM^g()(mYAgWNdn;#$OfQ6O@Nf$NQne~6GkF$SB2v(AuUZmI
zKImf-vE8hkkqVa$I(lDEVvtE(umEIh`+7g0I*AY}tOQS(DqF=%b(gc^HHou+3b7Am
ztEA?Cazu7g61`3NSC#nzOpl!h|JYBl2Dy7a`f9+vl8&9}d>%}4nf*zvoAv>(N*qZV
z7{==3O~P2Ns~{ARe3fZ0<WcGb2Q$5c^3ccGfVJA-Q+w_1j<dNspwSciYX0ET4+F+R
zkAeUiW(}?#dIVxIVO#`&5MQiXxFtThjsF@Gf49i+ce?mi4?dWd+v7`UEABVpeL0$A
zc5_{yUYffKmZuxPVu2L?vhVLoCGB>KxM-~^(R1raF$$+E-e>;mODf<s0hZ^Wsrmh9
zyNJ425Ik6h8V)kz*&J^Y4B9csT=Gj5GKDkk?o^^){Vk<fZ~Um#Fit;`?zozzjoGUe
z<Qk|)nE?W{!CmT$3v_~(mNGM=xA{z$NWqUnor@hM$59H}rA9M}A8WQH3cD$+01);=
zAoF$Blp85L(A(ki_j<>3mVdR$KJQ_4B_S5kSJ6u!wMcIhR93g+9ZoFy-o$@Pt$!pP
zfma?jFu&qLL0NgWkkQneg}H-oBi<P|F+U*eA2)b&J`gO9*3$^3^^Q9`rnr!_8+iWD
zha?2VQJ2>J3Na|`>qIM;s5&5p;XV%f3xil)Q5F<U{C&k7uYcfgJJuisg8C1U$EcCZ
zeaua!ADUYq<f&z^Ma}}oLiQF(V8y#g8-G+*CbqC-6E9x7pX<VQEfDjR^A8mw{(=b!
z0Og%!y}muTFX7|El)+Kh0#k)Q1L_2EggTd-WP7J|XL8zSvF&_eDLJ?G%g*%YA-CU$
zj!nNGM6Pqv{3-%+Mf}=z#yeU&Eoji(MAQykmJ)A*C=@0hZ2ybJ{u-(q(Q8A2Hj`09
zjh!d&TT_p*Lu6_#BU*>figDyI=WLO#4B5M#m3!FgX6t4H;gr#W^^B=>*3zIy_jFD<
zOV#*{INzh`Zbh}ws8Fqlq-aq3YQZ7O?rSM6V>8Nm`wpom_>O1Md5#ZHyKWoq>n=OM
zxE5xv)v3`gW%gGQIr!7Lev_B|^1hR$)RLs?Ht#{kYW+U{%!7|0k7>??>JgoK+8GaG
z-mluO*IQ&|(P2f`*fPg<{PsJWDV}sX8d|dGP`ry{#?7G1K*QXKz^qPu8A4Z*lK0v&
z<wo3aGTxM$a;B*9#M}7#&K>UUkL6Hr`EPz_?Dv(7hcM!&J>0RvSKCdyOz6^w`f$KQ
z<$|f9p+fP<>+0UW`Y&>|d6uFt=e%2o7mseuN$E{n*U?XvfjS$j+2S{T+dwsg^ySsa
z`8WH+9rc#Ss`+3M(&d+jw$KA7b-e+z?fl9juQ(H(EA&(N!GXM;oaQKVMv!!ZMM6))
zfBYVJNH$4xJ?4Nd&pQuK$e1MZ-QHDL-}cnV-W8H;te5duK<{~4eR)Fv$@kgstS<oh
z6JT2e4g1Ouhm|*k&v1-AYfVIn6=Ub+=_V$fb0_u0xL$0NN2oo){&+>%ZFmfdVSr?r
z1AbT42wR#&EsT({H(Hq6BWPsH9eXU=+!pK?>OjGf$D;c~Vu4lf0&p+sKLr+6hu7a<
z{`vg{3Rm%RltAp=jbj6jN^ruT08tQ;$pG3-SKcYn0;C@5vT5r!jE<7v@@+*v_b*2g
z^2B_JzqL_sHax)nN8*jCle)e?>3>X89Ka-%9rF>5MQi-7WnU?}bnRxX6xx}cnSlfx
zUzgaG77trP7ABniKFOWIkB=9ZR|r@7Kjs5<_PV7l2Hm_^nSkO|;cR-7aXNK0U1@~o
zB5y;ow^d>N_lE4=k-0P){xQEg01GA=Z2gY*Iy<j^P4!-4>+;+O?nzurh1?xnL)+ic
z_SA|lfvPNllDtm=*n${9fiSF9>-rEY`<ow(A+<R^39+Cx%cd5?qp;lK4@XnN&NDlE
zS~5`*gL4IdKY1cKh)b5mZMwb-C`o*wisVrpTqZR3%B6lsw@|0HS}Ok3Xrn6zpusJC
zYUmB6)6t{gp^Ii}6~Y%Ty4!zyFG|`$CHolAL37<Q{#6u?yXg9$vRt-p<xaEj@yA_X
zfHMVQyEG*Wz}J5?Z)oAZy%B@7D(n0oZxey@zol1jqd3}zjV_nMq}@?9WnEwPO6yzS
zh_*iflR&2h?(FA3{+iPGh5Xj|MeVw5TtoBi<+R(2(MkRw0)>gu^elIwtg3N_A~-04
z_?IuSp%3YiQ|WGvrh2MXX>FV0A3#T8^HQnOb?K`=2?N|!TK+=UtTe1oQf|L`*GJ#t
z>E8XQmG@m?8j%*-&c_$Xy)0+T%!04_l2k>$lwQ}?AgLnS+$ej*B?jylrj7a&&V+cp
znZBexst%rtc6(b01rzyWyYi;#3-$y1Bg*R&z>9zj#AS=C<AL$z@e*b4@ZRAOw_4}-
z4`?X(zBqn@cSaqs#b*AhwrRGH7Khs^d`{qP?rPuh%k+zu9D%LqPXJ8|JGr8HivI;j
zx?qSeR^|MfP39H)&LM%J|LR|R%8s@8lTI{P6e!!;;XoTYL63i8<2xa@1lUQjL3SOm
zvf{RxRFV1D^nO*lze<qT{K(bc*-t)cPUP=WE6eYcD)t+8b)1=a;l?|IoS@w`cCBg`
zLJMfAs%}87hAmyG-cdXnS8~%eFQKr?BF6p&VY=dfMlUDqOxE*b&W;OB`6R<Cy|Fc+
zQ9U~?WwoxAzd>hVKtRF6wp_nh^9k-tA~9#@SZ;3{vmiO+(mi0UW}I~n{k^)|YFF^_
z@7<V(?rNQ7)lHO_Vpoxd%$>M|&b8-GV#DXFj7##S+O&Fs$ux$E+qaiO9>%f7Wfxn5
zRuIQoJ&ar@&Vz^CDqHf5+0DV0yiMbyBu@je*zu0YuDYWO-OGNgs@(V#kT&vUs5}-~
zNLH;W5(8Skfaiii_)L+_R!DhXRWJayJb1E_#*kUyd01O9WR!pvs(k9KJ0GkNJg^f2
z>XQZ*`3}M?Gk}hU7}0Jmvq=i-J4zBx1FMfA7UfWIaQ^#{qY2SdJv5RI)FSF~SFk)~
z=t1}(4VPXe@{Y6<^i!feam4WLpc?_JU3!X8Rwo09srgrNuv`d63Jp>L8pRcbcrH4$
zCm%KT)<fcDz#zL37SV-uO4Eb><98dMpddB?^A&-%V8(_|kLM!DoiD3Y@BdIxmf$r@
zWl63*ZFwCHyf-dztuvb(2QmaJr2eAcZ~V>}j}we;ja}&k!O1#J2PK;&#;uWgPnI{3
zLjN{jz<s8R2Qr<!1#C@hsU6F;v|gRIJ3ToI?YSE*e!ps6twx3cVwZjXbpa~SDc33C
z>o`w=aEUvw=F$GBVp=jMbDh`ebfaGv2iI3k{MD)Phy;CWPOUd{^N*@brOKq3rs>gM
zB?L*EGE8;8R>$n6bl#?BQC=`RK)*_x_W;lKQ5B(|yBCN2)bKcb*tq$-E~sOQie!Px
zu{F`rpj!1=ohC?b)wATyi?v8W;7XeI^S^!UWM#RcZU)2=@)JkvU}|-@)bP?Ror9JJ
zJDP8mdoiRCA!`0f%36hu;kcfwOIAH-_fT~HZoNWEC@limw32b$J|7}atyk4eAMEs5
zKJXcEY)}|Wy$wer@xdnjh(&TJZCSC}R$9<mO%sf%_nx}sD<>*Z3!%MN)TPfULbpx{
ziD57wwZ=D2mL=^r|3KRzN!=F58;^0u$CXPD=-~#@e=l`Y@5!H|suK{Ipg4!3kj$Q5
z1m`!YC?hCy>Xzl}l_%l}u}Cfsee+)jcC3C}i30x@mjtW>!Dn4R0F0w8zR5iBW}baX
zmxL2O_x$w9Ac&T;miDjkFN3Tye=Nt5IW$tv;&!!_Vr6Q`<<m{D#k8l)LHHxINh#0X
zo!u^fR%B5^4M&f{?%-_Gy7g6_+n)nSRru0DQyJC_oKEjU0dDCuhx4(U?wM4`MyBsk
z8C8irV&(H#)!`Qr%U#@)hM$i<RcsJW*MH-;Cfodn4YibNGn7>7I*9LV%{Sfo^9#;Z
zf>iCP;CRs;O%pj(K&0WuIw5x*)eCSI;_VpNBSF+S&*DOtw?hcx?#@6AkR6NS1Chm#
zj(bGT18a3sv>iHr0<$mTpXD?L{no-JXm0P*hh1hGfOXi1LkAyY&eaM*1p&+^(;g$p
zG5%vM#lm5SB!d=WW;K8!OhazT<MMs)2=3xK6OQUTh80I8xSgqSrXBE(jo}dJXb9(j
zAqn;A+WloM19(>DPV~D=k+Dj-KbG-AaWyF>MQ;zpT`&o%UR#<wbG<KLVM8UsB)MwM
z43!t8q?m`54$`EtZ)DIDmm|kWSI$6@e3eEF*5;98r71Yisf<7ZM9tLa*~MlWfZRv;
z#>Z?@>zKwi1{J2mxA0L`U&~B`R3B&h65axw1U1enbyrbMn#~i63_pn^h5_09yG@sr
z#bOhzIG|@2w{JbWHR89i(_xQ!P(3)NmAj}r|5^xg#olQ5N8j4pjZof8#$vKF-zCq!
zuzJ$OAWQ)F;w<fukRrpRFuvMWQOxu}2Df9trMxxru&ZPw1^-9&V_Dogpq`$sc-L{T
zEL#rpnl7H0SY$DI>v{Ora&w0ie~HP%{Nyj`Y@Fch@ROzcI=N4xf}D_<FUk#g2XlCo
z`@af#h&iX=8J_~*`DXl8@WI3vvQ>?lG#m^?W%2DYO7r;qgTdpnJOAnGIHq-m(o%J)
z`z)utU6F2jd5*i~{WMORs6~z^JODNn{p^=%(#pqgt>6AaU^b^Ljyse4!?u-o;>hUj
zEBZve7S`Tjd6BnhnJkvpk)fV}*FV~EG1;6#vZ9zuuJFi!-}Ju^NSPphWX{SdI&={4
z>c?iJFA`{+>hj$rjpV1-|9ya2>Bav7RELhU(uf;~syJ8izx&JT7n=uIM_gr#Bt|k_
z{0I2uWe~c(>Q<{bUGYIuj($%vL%8+1O<b{oH(Wsw{KXGLN)F$k{#V6z8&xb7q}F;J
z&793k<qCOB80mGKj2NO&5(EaZ1rfnRR+lh>@}};Kma}0J39;c8QR!Uc<RU~zueUrJ
z8#rP^joz_s6kK53j-R9I7iqYQBTKe?Nm-++wUyV&vruCiSap^Eul)@PfMb?a?G2S&
z1FlTTt-b~9_NiMl*Niv|KyL>-^ti41r;2&3Sd&M~i*a%S?5s9kMtcUZh%IQID88+D
zb7GisqM6Tk*?z%o@(`%uH7A4HNvz6q4i3hSfC~QQ+wOXiJTfd#NiCTn43cDT^NV3@
zYGWj7V=FFoF-hT_)JmL}#7{{LR$XP4#u@T`x&{XFW&P^=EgU{UIy8TtPvR0JUTMGj
zO@Kil+8V0zkk>ksX$^?%9w4Ulew?M(H_aX@{FR0o@=SP@S$wBGsq+D2#Rn})eQ!gF
zm<BaMDaXwbg0vXLP(khq*o&<q;`(;*wqs-@($KCa!hB+V9oZQs+2o;qMN<zF@+crE
zFT-8mW%M?zYhi5Gs~07@#+X-?BxE9Pas6z%xCb;E>OMqNO)kihRN-ofWaEs~MvX>z
z;M#I<W`89Psv0*GWjVoGLClqCwVX|H>SwGiswhu!SD8~kjwfcc6EXScOB8MKe&t3-
z)sMlP7d#mKjU{W&WBi?w$P(^3gsLL*_MJ=;Ki#}7@<8Bd2Q5sJvcXN%s>7s()p)~h
z*RU??o85+?^5f65{3}ehOr7LSWsm*%Dyw}i!xxNJBM{u>C+n1(_{QRDMec&e!o~7N
zlLi=9c7u<VQhv!6&>DndG@~&mWYo<5L=&B(<Akl(Qe*HLia{y1YsIy@(kO67F;o5q
zt>3T-#6<Ug2&*l}=Mr4UAcJ_}r7f-=yWIa*YKH-dwU^lOI9pJ4Ts0i^;8tDoFkWGA
z<(S3?o-C@KwacfGpz`(lq{I=?KJR>q_SHoGX`<7P7y)nfJao}=&blHg-yM$NoAn`a
z+()HbeXQg5y(;%H=?C=A8#Jhd`hh-*KNwh$Ud&<(9LPlf!_rv>MA>#-dnhT9Te?9J
zr9q@ya7gLymTra=1QbxZLArbBZb4d7aww&SM!MlUdA|2IpfFdQd#}CLvEc*9$E~5;
z>*IGT_Zbc2Lk&{}Guy+&qutBkmK)fqM;FK-4ZELL9w7P=K0H%*{FBD9Z5oyVJ!rY{
zD^*5r-&`r5q-1EHGP?+G9@k_*+rjwjOm3?31;(}JfplBg4O>g^oamwO5zOSMKC^9c
ztRVZJov-w*<$4=oY@)i@k&c((Z=bu5?$cqTqfJtid;b~``R5sMd&yUy*dSGw(3!W}
zs8eqYOH(Cb78SLx&6Q`wq=>AG(e4tr=}#$?J&FufMjcu%|0zfe+uOR_X)--4b_;A?
zu%vquwGNvMig17Rcxs2Re7%HrE8_R5wxoc)e7^fw*j@s=ZNu(Uf4O9i`+6L<g1xfh
zr*^fO+;T<MHT4>VqlN}wo#P6cywk*ZSrJk*n-?|keeyg}HNCD#rt9~@fs}NHS{jbi
z>rthzW`c+2Ki=)vhAw$#6HkrfV7Bz?&Ibu&tWEN~2jP=Pm6#N4UO^syLYoN+8n0rW
z6sQ-yWqzD+@8dinfFgrUWdEzFLA>g<U1D%q@Ze*r`vFL&#e{jLO$P#Dg|MT^#0Vqd
zMAfM5$Cf{$#wBUewrZ5aVJ&!^ppI355z4DRgsW96UWKhad9c&w2}2Xfva(gIFa0vx
z>ZBv2#CmK99z$Y0aZk01#l<W8R5c_@ue-La+OrXw*O8c-0*0z)!M;C_UF>X!CqTSY
zA0@0g5u{l%Gw*nby-MoyEyAW?x#dQzl14UcaQZJcPy!3RgQo`r$XZUK`6}geUtC5-
znYPMIH?~Qhv{9YR1~{x}c<AXg?3o33J!)t@tU<J7hP8kEQt~<cPI{ZZnzk8@$m_|x
zTe)tV$<8Hj6D@-FW(b+r+(q!ClF2z)p=L~A!CdWq$LQ;x)A-bwVg*@4kHT4Xn6ZQ!
zws57@55*R*^s_Y0B=0<FLmTN9I4BgL6&fKf-Py!ywW1CAJ1Ow)=>U^st~QEb1w8|8
zc<hnW;-AY`2GR3E@C}-SxO+bGQibj>dO<B}$kL4J<ezB1z{<6}dR)`d-L8_pKeaqr
zK#bR#vIv9c@EL0Jz)n^ciF5|Q|NZI-rVNn5zCm*N=1yQZtf+T6ALJc9%?Shpwi&nC
zI1h1}2^k3{^E;m_dlT9FS%B}2wA#dsywAfW5uwYclS0YGh=h0M?B5{L8ejhDL(>5D
z$gCy<-EN!rXfClf`a}j)(HJAl+kWZxUq<T$Ck_dl@tRlhAN2vI%0D$L+Oh%A3T{-h
zC6TNPFe!6E2J&$rUOy-1tfm?PVh!H^hJ)o#7`-j{c41Qy#PibbA6bkan$AyJ>pI%K
zBDf@b<@NhFCE2Ct$bcR}rJ_Ip;O5+7x1pY|Y5$Oc@9M{WP{^dbcAFoHWh?Z|+FG#U
zWUjE)d78yU&m+QOKBe+vTU&+NhL1v+{{7oG0fYlwyHv_j@8{#czC#L8p8B>tj^&++
z6%4j*6{Q^|5zvjcA99=17bqv^MRH+~*w=Vxj*faO!TlJtYqJ!GIBL=UgYR#6?F@2T
zeM#MpYOXr4Ux)&8X3me>4WToI_?}tor!MyA{>6)}XoF3Eps3^Z>ts`S=zB)Cqh552
z8v=;)whep6Lyzr2zoPVs#lywgL&LiJ=G3IY0$YvWn?de+EuA#~V4GobHAhmdPH*z7
z9B@e52G;k!5`NX`#HwAoHMQ*#o}~uY_A9}dr}213lK43N*MI&wXVy5Z-u_R&dSrrn
zQSp~LV~KReSc!F}&gydTdOnu>Hn_;B0#U}rAS1eN3ZI!G0;b;*3k-^d(-Zf1@K<tu
z;gLMJ1hNGaK!?hnskD>;&taqQBXwDe-8AK{>}F1ltZjol7qw2SgSscI)5AKBWuB8~
z+Zrd3+>CkD9>Ef~dEv^<McPaTFgAWP)2PYwR3r<Y1wO`rWFm=(axml>I}!!y9`afD
zTft}6CbV;PH4fcn<>Q==HqoBmMeMC(Bk-5Q+scvjw$VpvNVe^EQY>*ISrg<{|JJhg
zrLQd=uL+~(qkT;zQdo&R+h)hfU{$-)zq?+uPF+nQlkeaMLQG$%c*t{<q|?VgUt=Js
z`9rr2Y;mGax9?-=Rl9Hn*96+vK_+VZRkE{Q#kkk`>#uYZN+uFb-%xYzuLgDh)a%%j
zGH>~!fruK_Dy_k{%iWW>wb5~yGIVHO(p`C(_}LmtGpo1*=K0y9{r6v&Tw#5<1^JNy
zkbIP%C?$`=F~Y^`tja_yQOv}2xev5&mp4$S1E9m#Xr|rFJl3$7+Q&I(ZSfxB0XaN3
zr~GV2S-~V8YF-)pflyS6Q+1t0Ib4#{t47MA^CH5;LG97PXQai^3O<U8y1wi*#&#G~
zr##<11KhA|O03Cba99z?s4{`jMU-hS^2E#c*YyK0(UdKg%FsgT3w(tj`Oj7Y=uvx!
zv?t9@d}xd(FSi3;ALwk~OgLv5$MktW@~0pxcG_{*BSh1egtu1NNU9TqE?_f2DtOx4
zc)Yq=*KG3mh4)^qA12FzPL?MsD-Gr0l@gMuug-vPY9|(zy2MpAyiEaNeY^k7kdJ42
z_hbD5leXRZH{;AnV(x|*BJp2YB?^0(7$Lj|zYNhTB#})RS2VK)BF<%UzE$~yJ}4S!
zv!&~{sb}y8lckao{nCw~Rd-9ZpL*T9S7m2kQE45`4y`^d|2Dw^)1jjJ)V@K>;$_<;
zXZ1|%=(Ate@7{Ze*b5?ssk=@G^a^W*wYR;FTh6X=NYubu5*ukJs;7(-!QSn<%PP*B
zHKjs^GEi7;*V{a_;*n%z&I0qN-azQB(T^O4=&JZpJM_@J_J&{$o7m}u)PIo;VXio=
z)#?8yZ7p_feja5H$YJ~QWGxJSI$Pimv=FKr!@pX*QGfc5vutFH2rK(t(WcUAc{!*i
z-b4#rwvDM*l&4{m5OWexMSdslC>)(emGUu!$YyN@K-n)49&lkh1knp-<&&se_p1J3
zBl3glX%wl0JGNx?(S|^13%xF~Nj||-7K*Z|ScMU`$GF6IK1aK>;A3<VHZ#n-(;E`n
zd%j7oIX2}`j7_&RS7)1w5lWN&c|_7+RCsJQ-Cb_f#=(}ERxOo5Rq)wqm!Dh&^&)ly
zWraJHR|W(lEKOb^;}eemCYhb7oAchfe*K?r5@{sDbTk);A^h-r-wz8K0nh*Y3@wjR
zNG+_<qaMB2^ZF2Q)mo+g+ltl}S;QxSXD#Z35sJgi->WJRzgHi>R8s1Lv|rFwHqFH7
z&gNllUfg^cp(r2Z+;R9zZ{gg24*f0@0ooIRC?v&!*B9xG<Ii%=K8Q;9UC(?~RRz8j
zRZ5PftECqo5y3_C!xVLx7nFPdb)g*Uj;9~d!9bVo;KBQ|)%^<6u~cn8eKwXDyZaT@
zOGPHp0waR0*q1Hnww?#RWhP7NyP8k_2zb1n?0>XB{65i9T6XXYN6ub;@nE2T>mH4+
zup_fYSTsr6=O7_XyN#b6`c}|2|Mzk$S2vJ2@aVelD2?#w3a>2gCuQ%eXrYfD+-VWO
zoAd=t(<On}wN9V;0g8>8AFsLXoA`8m6rNX9uF>l9%r?>dDO=UV?GrEq1v%#fGelb2
zwoc~M)d*{IMtNje7WAckUB3J)yxKvFooZ7%d%ZZQ`k0=k#Zxw};@E@@Vd!|9sfl9L
zd)>9F8Z-&Wek-peFhz9Twisb%>FSyu58kvl3zi@m@<ptZP`Go1Exm#$>n$+yx#dl@
zw|Ce|xx$5!n6o~&6{bIH9Z~w_x&IFtVGd?+d|(FWc9IU{<OpBBR-9w4;G(szL=By{
zf7_4Y<S)}Q@0Dzha1+<!&yKYo*%@xB?HW~yc7qNY9rBP&LxJR4-jP8neXcp0&xJ0#
zj)eJ)49}v{%>-%eyr_hpu<KJed1=kvryp}Q5WO#{4K0U4LSJW@p)gucId(9YezaWC
zLv?Sj%VWcIk@L%U?^qALINwYAUPs5VZgws6so`7N<f^9d_2%5ZC2%*Rc`TmHM~tYw
z0`4W6^W7W5^BU3^L7yKC@{<YzpPawSVL081&`tnHlauFx7z!hDs2Pqz?b>qh14K88
zgNlXZBs-n<9~}4DT}@@{rjU28&BZ6Q$0iFN$Ys=jeV3s4VA_3@-{<%oRPA_}4tI;2
zA}yk|z*HZcgZ_?1$5&Qyr{jZbXZ7X!a=CprqiZ&o-k_xy7qGLGH3&Dn0v+p(`QFp{
zK!!IEBC{_HSkvsoIRw<TCXWCV;K|}yVZ^=$!|6hyJ`uA;5u+N%lg7h|$8R<;^cxtu
zfmce!A#nZmh4+nDc6H>F^cxM}cRU|+-JEB!(2SJQj$9qYJLGXrSHgz18qR~Gujj!y
zGdqXUQf@60Y*pB*{l)t@Md8vF-G8Tk(nu_G9ZH>D`IMgoLR4Rz@ckIA-mx5^$BfqZ
zi6F$`{@4os@fkz0Wac^iml>m#e==Ne-n&qE@azYn80DT!-Vte&<d2-X>C#QF-IU#C
zTLSlVOBE5et4}oNcks=$l(;#N7(-!XY7H}cfleypLmZ{?yK)(2qhStzy0j=W>N~N|
z-&RYEtQC#PV}!EQ;%j*?(g2&g0B@4h+jz^Ej%*sS{lQ`nl{PuUcEjJ%nnT+{e{UvQ
z5(n`xR?ywsDq@f~bimAf9pUo!;?|5<F#DnNQ<?u$)1l1WZYfe~i2c;jBO~LhAdc<M
zfWrD8Zwr_({<H2`0TMUSg8tA8yVEA06C_iC>Adu|!TT7w2WNf4^EE@;khVnEL6SEd
znf8KOt6wJNOO_|mVkR_rm$hfYo87t1@tS!Hd+k^pb4g8Bcs4ZaaEOI%`_+2xeWlwv
z==4=h8`W!eP-bu`F>=Clq<5;6>eM4^hZ$<Ub7Uj6e}811I!sKHQDY(NbsVzO-k5Ga
zJ{C?Ph}IoVjZNHaty--iu2S@{WA$m%&z<^Q`cw>_p_T3t(bQiHo8x~4-(Pe6CmeDW
zUewY?^|$%8<WYxv+bX!%M_MCKrJ13DJO1U)#j4MX-I(Zl$&0NbfhlnQOdB%BUs#*2
zSt@3T#Q-b&g8z%+Esap2Xg?6J0nulEk|6^XEJQB&#PMJbANMg-{O?|AN^9*tO@@RO
z)hRAlq(BQJ6pY04B)05HInD@4k<I#@>W%rR6xaGhtY=hLZq@AJ!S?^L>UI{5%4Eio
zBDMpd^5piC{~_7&9k6mR!k9X-E}FiS?Cy&2V8@M(jjLahE`?x(85Wf=FiiM7SFSY%
zd8*y7hNH=(A*u>({O>w{nem!8mhfKh?jW|%_BnL93#0s@77S;dIc@9}`d>DFdv?CY
zAiHeB2sIQf!kaVW_pu>-1xiNks;%36?a;Ol-72YH8Xx{36*SXcgy4rEBIUK~`m*rp
z01QL*l3nEU`VO8iiZf7LWuj=EHfz3<6Bu=v$?p%YOS%E0%~X<E&6nHMX4oh3oxOoQ
zxlMc=C-vAScn^=2Gq#(sf9L7j8Htfnbu6bAID3fB48@`+KSiaLo&h-ubvKO1ZAZ6-
zwcb#S+kR=|aRs%Np(@5#NyWVn{o}!6-a7&nA~5{E60gy2G&d5?`gvi+kY--*4~p8!
z)oM`%I{!urRs+oPgjVY`KMCJ6Z_najqGMu2e8dR-7!@3c+N0je74Y1H#_E?>?N9I?
zn)0=3lWrA)6hWX_gZxDmBFedN;x~E2`6sQR;>8PBQMXn-rTurNwm2kSZA@83ZU`pv
zOdA^I+P?6#yTzQkH%$Dzy}xjt8lSkA7on&6Lovc{{FsxXjmP&RW37rDTD=))g|mt}
zXVAim?^M<uP*wn0pp+`JSrI>)srWPV1d(<vOfg`>N`zv%rFj~M6LnomadE%nw6$1e
zKL)Gr`77gM><aCsQxZ?#gMgplL{twKxO?=eP~#r5)isaU{>t783y_;52+K!cTfanD
z!jIt1L)<dHsi+Pox_MtSTde|!^olLc)(@V#)tTy^3V%yn9N%ErIIchsg)zL_s0i=l
zIR&N^L-NP<`x|F<-T!P{XWf7Xg46)2KT{ZQ6eAYnsbyR&3l-&F<sRx5Y|HAHbADjx
zG!neGQD3AMdUC%L+N;;hTF|4tcu!=<Y}RUNS*u(6&`+vVm+T9;hkO@4IJYTIQ?F4h
z$bI$$EpqXLlKkSK@J;~|dh)CeH4MJ#83IPiRrEZ-9~xOp#_2tYfEm9QJK#h6FN6z$
zA+WAv2Rcq+*D-o9i;W`61lq%ooQyv2eEw%z_BgVgMKdF2Y|83RJH#!H4T=$dA%A|L
zO5weo^iJ9>e7U-!&4bT49niDzndme04qv^kuzAZkAm_Bi_35PTSkPdwcwtH)6mGJG
zBDGUjGrCyHrjFE^tQ=nW{oV0bYw`I~;%Ha(2XA9JNlqZ>U&|pq4f+LUqHvQme?0%s
z=bJURSFa*aJJ_ec1HRKMI1bI8$oBR2aD#DGxfdP6!F@|m>UngtCO*lKGNrGdZpiKz
zZqoU49J17D=3GDfkOg|;qe6u?ce@3;+AA%Oi@lU0Lto15--DGDf|s@lUS0Pv!ukZQ
zaql=)9?!OR75tQpzHQZcT7^~`{Y>2;r|CNNcY&lo^5N9iy|}AdZBWYGhj#O2f<@Uh
zB0-@)U{=-c2S>a}w%OmH8<9m}b%_>tUfVe&?0vn0KYm|g19^@&d)?bD`#Z?t%b4K8
zE5*=z>yOJ+r6feWcwr6=Fb~6qN$SxScW;_^j>>Is0c|4n^zL!Wzha1bH)$h_na7=V
z{5jc;CyYz>?GkXc=m2>LO<il|J?4KNwA)1&JDoYa7@=ox&ZMceYk{vVaDhm<3@yw(
zr-1RM?ZC@e;&@7~^P*VJh^bOl*#d=xk3kh<VW)jwv8FeOSs25lST{>>X{TH|p@Le8
z=8e_1F7Y2P@fg@iqi11;Z%Jhfuf=`%57Vj7%a&_Cl9@3F3TG@R(wR@!*>f>TG{&{p
zKV0{Z9L9MsXi}9PXFLi!W#7I)HLaWt^%iYzczVEgL~D1MQJ{b{H^5GLnbFgnk~*kq
zEvD9;WE?ZPcXAiP+?N@BmN!NA&&Ag6CsasWWrhHc{v@N#o4Bs=YMl3g!i`2%no&DE
zz%(On69utfKT>`|RoUdVbl$Y2YcSCC=3<wld32;6DWuOirHxBk6es{*ybgs5uEl5_
z&A~Ld8yjYeDe)-dJlZhb^dx0in*AgXoUAVOODu?#!*MJhjWwST?sXNM#h!|?XrBm&
z87f+q<nL~njT5obl)AdC4vZ|ii>%oxtXX(sW09xy%MHxT*bO?}ttfL!s??Vaa$0o(
zr~>fIQ-BgrsK=6U1i#S|X$y&G)nu+AK^OM^_ZUD*8-3V76-WqidH^4p*sPz!%jPLU
zKjho$r7$`CJUP%v)}d`dvO*qcUhgXY9-u-_$Pd|tE0MGi$obxt?Sl>Rar#Zdrq8iv
z9{F%r%#g0HY|6R~$dp&Q@Fpm*xM=?R<~Z;j(VI^B2Il2ECHG|Ms!s*YA3#uQHj^Km
z8jGb|aBr@yKxGp+qFtanK1^cI<ML+40b3=P)sQf>-b6>Uvg=9e5#9sR2o*A7puLPK
zKOG!67kloug(#a~9NMtl*Vb#``GCK6|1jZ@o<&~hQ6^f<R<gDql=4|LdJ~e1h$)AE
zPh}7LZl?Dw<9yh6A2qthFV^C{1>lkKANkOtgTL$2kP76I_*>77AZulI!pkc>mpsCa
z_sd|H%6VHm|0qb>5Z4P?$TRF59N}em>9&599QfJaF)AvE0&#M-wE8(x#^vfaQ11TQ
zLdT67Otf+?yXwS}01wOH#2RQkIY8@KbY#~j255=S0%C#VgI3~0{e$iPP&1Np9B8I8
z2+3D|kPUvAUACSB$_^T1CjOuEXLEQvUq<)7T|bgK2pPMhaF%d+mdfcLm`>&oc0%Fi
z^qmyu2x`p`TXgBOn0;N{01&~*w}fK&5DXT2|F3gN61`SK`b%|eS+;tYOC<_F+Jaf8
zEirajU|*^uML+%_60r4Kp!dkc$ubu@FSooK{FuI`UzLd_fW~+5X>a1=o|dMQ;VQ_l
z`&^0no3_>MCYno#0kbJee<t;JBazgf)jy`O$wk|ICSb+6Khl=kZr91)u!t$@$Z%|9
z5uaIcA>BuY<~p@le?9jxTRkc>hH8+*M$U7=iN9UeC3Wz6ydyftmTB&eshQUuW*(!c
zb~f#dd;|tx!u7!A{7!HLXOG;m9L;)uhr^Js<!A|XjRu^DrM0F+i>=kQTFvxY4*ksa
zB05q5sv$eaO4xfJl=|<M-U&8Kocu~GW7}JaY<e9hf^12jQ7~W6xk+>1pI91`Lxty6
zJ@KXC<ILnk`A_lSlVd<An_i~31vj$tgwd}#ux#tC9C2(t4aaCpe}N(N`g?|?q?+((
zHhi@x)9ZyGV)Ap2(0kp&XrZ|2RYAShP`eX$m%bW}*)pU~?PX$On&dYO?vaf98870d
zH}OYB`R@8|TGPkOx)Kbhka5cO+k(5y5>SR%?<z$JRDZL4Dt?k?_j^@!$>ub9&Z)b3
z`DFmENT^}yG3!w>Uxt_K(Y0X>4fkSzf>%%NDcMc(wWw?knRfwC&$e!8PmRzpiw!)6
z2p(#PPj+2J52sLw_GTA{i5TD4QHnZ<q-G#f42dJf%3CN@EnWL(6=lxXwIjw0;M6N5
zyurDAhmSWeH7t)Ryt7ZVsV%o<src^*O#mz9UB}xB(~Ki!+TennT<PY%`!+0k?=azt
znA5HzyewX2>Hy-IV|B({1Ow~~m!Y4bO?d%@<jv%gO>BpiNZ54!*zugQ>=gF)l)cO7
zqJ2tNR)-F9t5&c+f!(J)C8_X$M_zooq)snnl9G_75DOSIa1XUb%F~O|n-jhL7G+s%
zr|c%RJbus2A|}X3Kht<G^*o^gipqNcMx)M`t-!&;B58X!qmIRN{MC-#tb{0t?T;ZQ
z(N5>{gdXc#GhUgcBs?e?*A|P(<{G!QdV_l$0Upg_`-~$~w06?_GKc{f-y>OoIp&Es
zKSaZ#WVA%qK?jI^K9H4vK+UW59~YIz2o*fUCfVx^(x7v%vce#OtDbf~7qi7=wNYDT
z!~i^Cyo}{o{HY*y9Vcy4sV%l@!1N~x06%6YZn*S?4aT+<97OP>`0ZK{-_F8{?Qr_P
z4THE3NJ6}JBJEwpuevz?g(;C@LQ8CK82;s`>-42hM$Efsdc;ZjPvdYi*ZG!C2=OXC
z{fgVC_Z<6nPjlvN)-347ZK77w?0A&0*hS7<>NUMWKJqGH$zc&)o@*l~>rh>3q9;FA
zyZ6Vr`Bn;qQIyL8e?ayQmSoBt{+@rid$M#YZ)%Ep>QqHW`{b$4b?QMKZZKJ|o>pzU
zbtJO$&`a9`j3*q_H4Ch1i<jOHqv4VmeeD%hGQsnKyVIA*{^p!^KeB6^W=nT|&pnFE
zD(D1xCq9lAW~VOdEA2~n<gcxq^+-OhnH`5nF96VAK`R4HO{h`_6o4?r289$PnqohE
zg%|%t<$*}nW?jMO<afd}0sa_UOpny@%~4-#uX&=BSUk3C2f7$*;468W6_g&q%A!#&
z=zl9-&245=l1LP&uRBd?IdJS$kg#qe3(wkwAR5Y>x0$GsDU`pESsfMuIa0({rD$Qh
zeAf+&=}nq6z3T0Z35GT^3xQCM<(zW6_oW3*8Nk2QJyMQVcq-(%rbAnlHZwn0w;FQq
zW1BI8Nqyk`BoMkWkRF{&dZ1%HqE-5lo<o{xO7|&yn!x7x%BR2{O&$Rl^@{e<ptjer
zgTMD~>81Xs%p0Q-A5<|RQW&A?fdG$~?i|U&f2UX_y6Y)k5w<(yvANnA{$_voR4L!i
z5S1(7knjlh5&SJ$ssvHXaH=;{d?lF8aWhueZ~Lq~S_4x;zK3p%!BT9S1EFX1_qzY}
zH|4G-^i_&YKKiE{mp0^{iV7_iB4$PCYqk81Es5~tjyNuo_4`v*6tp=dbecj<TTBtV
zI8ELsao9Sxf=87eEy&b%We>}CK}?EIK?kdutC^JTR#Z+ppZ`IFmSXjdJQ*)<34{{J
zTX}^8E(_sQOs%oXC_D^I6d#68=q1_tcIsu|Hh)@G`=HzoJeU&0X3)dHTHpx+NW`Fp
zr=hW;laQvWP`V*M+(1|_pr^U3vwm64_$gz=hI?m@Z}5_c&T4jomi3KSRYQpHc7WtT
zonMIW0ZI>p?T}A(a01@W)EEseN!{r7o#p+cmqJ}WktZ0snDdESw`y1R3s|(-Zab56
zA0A^oOVTg|^~yki|AIfAww>JN()iS`&2fR8(ShJbYc?LrP#fevcBSX;&q%GiWrLR@
zSvq)JqN{?{m>8k(ZQ8;S{Jb5y1{<2!Ul(84G+_CZ+-+Cc)PGn3-dS96s+7Tkot5!K
z@3Aw|iqyS!Bdx@4-VtXoI#>dWT~ImQlF+|ih20Jxdm?|kg{#vZ0v%=|%)16%u34pT
z*hK!nJnz>%-g^d_5mMWVw0c=Z72vZVZPtnMRdaL@LN}?O^72T{`|74;>K;$}JsK;}
zbU-Wk{S_AoNi&BhpV>n?LH-2;@(`g~4P-zO&sZxTxD{GX$^86nMl;!JZy+G`6FyL%
zaDe*s=KMH;QZgpF<lwM^p;|}qm0#Oc?0-+uA)VA($coIy23lZ~c_c2&`jl3uUGS50
zX9DHm43I=sTtqB}H-yI*2(Un=;AsxB^A2so_X40}SPn#7&aKC7363C)Sn`mp``M_K
zc7soN5CDcr=(%1U#cjMTNq!&nMOtCK75eNs&%~OqQu5DHbXaQ99)rU%d7N>9nL{v7
z>hV2K@u#^fe;)ax8Q^6m9@tqO8D2&n>(;zr>DTj5>$kWJEF)uqjgAl!Je!ooT5qH`
z=}NQ6uJ5=ck6NyO$<j|yj!4${N_Zjke&f}TU;=a<6H|e2^o=y0W~m1?Q78bRG-q_v
z(*EW??Y7!NBc;-E|LEoxURr}dKL!n(SZW*RtK=hslernV`FzUF^$QN=K$NI{@fiq9
z%GVB4li<j5|NoT#Bc+xHdSv^Vv*LogMev-&uG^J=x97@|D4VQ?qRg9t>J!2Bm@j!C
zaOF>}_vTkJsncTOW1;$uW_4I62s8COTn%y20#$Q+U#UAx$RCjX|NmK&%v&f`>uJ;j
z$7yj@z(b?Z8{JtRxwaa*!#XpogDVk47A#>J4MthPJ|4Fk&IYXo<i{(^-y3rD<6t6N
z2ofCXa^BAjj(_#(pFSFZmbbllh!cO4*$q~@<pA(0K9-qZrwJXd2jv|SKu7P{(^{`6
zrUk&Y=Rcwn!h~FpcuSWxb}24FcyX1+V~>Fxpi(fZ9!H&jaZR(0Gc-cBmTBMDiNWt)
znBd7qI5a)K^?5-$?mYUs&dosfXzB~P)!NDZk0t7RS_n}d>}ENmPiQ&VBA>mGy<~@l
zK`D1>>@`5fI~{~c<k0!tL!MK1<Mi?OT~EN)o#m!~j}sGSgRx7cmqlW2sf_3EazNks
zyAXt;<v5tr<h7VsM%ODBfikk?ZUM+UtNVI)SrRzkpa0GlT|L~}<f1;V-3fi|!1<$q
zxZPLc8nu7sehd$KmxC6j?xx@AjsNMDe=HmRS7H<t`XIXTxOB(iP;7T(oetiPG1Jxc
zAUh_+WBCZP=N?yUoiO1~wCN9e<-ng)Nww$Vw4zQfdq_-=c9I&>;IGi_LA?A}08@s9
z_Uz<DPS02btbmx~=IaY=&?%kd7<m||@vz7L#pM)t{w0m5))cTN`sukFuZ}}fxw*2=
z=A@71^Vknn96QkZBNO8v5wAyhL2~$v#F?l)?s?Q%jb0WbiG?`f_fbHAodsk>6JR+f
z%4AZmy%lhGC+2q0jcH>2NQAMa`IaP=DXiKwx8MmUs(_V#OYNNLE{YV($Frre-#uQx
zLl+oxOw3VM>v?oczD%J=(P;?+PgCQ1=+R}(GEAi9fdh-2Z5I%22ceC>0V4MgiIZ<F
z4p(fDPRh|%j8PF@rmGB#7Y0?8=G6Ml?3kfUFU><E`9|=3HJisb;P&VQI7B<)SA<8$
zgp2XYOniEuLjMO~Bx0gc`#4>A+Ci(dG=mT5N3PC~@ftHEGo4|GBfQrwOwkqT!mqw7
z?|mqh^XMgtkQ+McuX7oWEz|aycEH|0;7BzJ)Eq&f@X`N#ieQ~@!X#4bQqX{4DBCel
zngEJ9a~4|vkG%2(oJirS$9YUuw&@6__z|!5N056|jWHR?t3ZZq)X*lHqxK>XtfGsg
z(Jwo^GxX)d%;=#=4)*J=vw^SH%aPNLT*_)E7pLh}4myn`yT|snC4zbue@l+O!-2<5
z5gU;Pn8LS(lq4mt8e+^c?`3iLQHy|C68ojKns(}2K2CtH(JY^jt(gMMkPR*-(2KKy
zCv0jFHMI6y3YL9<dOixvE?Ok61Aj4%hQG|8{!>mK{M0)?I8|75BB>l*`J_7aYdn$K
z>?{hGo_~)hd1bX)VaR!YuRBLc)$g;mlm^`}lOmwt$&q2&f1`aAe(gyHCgPVc>Ve$J
zk5D*Ukrzt(%U}NIR+OV=uI1b(mWVXv9n+aH!};^VlLcbxp?`tuw<5d@{6{XUc6R}I
z*_GKvk6(Mcf_KcZU(&NWFP~PIJ>K_$pX^6WOET3IfU0|<#QeB!pYJH}e3>J8P3rx%
z;*oCcoMoAbGKJ#GI#acmYj<!u;y-l@JG8;p7wLMumgAK8usnW>lvJE5izR}-wBU=m
zF?Br2y1%R`lJ?!o2`?nOmG`QEeqYhwGJ&W-@H^Dv+Z)-KrK=9-uK0ScNh?V9slL;#
zH{!Phy++<Z%|G1|b|(Y*7<12vplY=%HDnB4x6P~CI6-dW6d6^Pd9o|}8D^m+A%+uO
zq`#%uWR-*N{%6vXI?7O^8B#+vRE{iBs;EBiXT=Jcr{kQd^_1-TNiBOk+u^Tk{JhP>
zF9oM@S!!3Kee;3G%jw;^V&#{&F!y3S$tg~aQoc6zpqGyk_10u1THRNz&}>!Y_cO}V
zxNQ|5zv-1nH_X_3ztHg7?5{*@IryrEYqxZ*ep~w|YfB%$YRMOhgfn~lVTki@{Ys6c
z=5zHc!U(gY0o=+)`zX5nk*o?czUoK$e9vGeYTdv^Y`?M#DhJme&nfX#F~Y>HU+79U
zKVfyruF49T>BIhm(g)fKfyi)$2LEwXdQ>Q|=4-5`pKFu)7)c8)<;4Upq5(&jjnVNn
z$&38`ZeDrbiBN+IA&dgGAUEJFKR>By&if}Aw4OkFctl*c5GImzmst3(aaJ#g?^Awe
z$9F`sj7X_qCDxj4Bu~L)kwr&AXHJ9H2g>i!das8N*K7CaVSC&acHyG0hMLm`p(=?}
zgcI$x$G=qH2jW0r_SpeBnR=Dln6bJ6J?<&xg?p%v0($@m2M>bdJ6IqkXpgnjGR06|
z)at>e;PNi2AlakEZeSALS~&S~WPGh2)%pmJcN@2brrIl2*|uTQk>ZzL%ygy#w!PE?
zJE9%K5q?30u-E^*qiqg*lh~*CQm0f1IDaNY?_UC=1iOKj1C3{DDQp27Zby9v-1q^^
zm&VKoMn6`@YhPX>E-x;Z=~r{xPoB&-!=0DvhL4qel>%%-|27+Vjep7Jx;dHaD|it#
z*Dg>>MA&wnD8?w!&VB%Nuoa|p&lM|<w8e!ri;3swVB9mZ8!{RZ&zBHm(B%FBdPx9S
zAwUmS2-xIa>ozgsqhM_y$w@kI-rR|S>~HSslG7E;vybqN6F6bJ0LVT{6m0ie^mJP8
zfSMRULY374Rp6NyZ-ay@r>X?$Wv#%WV`R!9J!EQSL_7^C0~j_m4$%T)g$`%)6@w2r
ziv~ZE!GGfdLnXI}cig|Mj)D%c9omJvC&O0H9a_1=B)Guggahg|L7c*=%5L1GUIE=*
zOUj%yg5i6JGShq8pdde;vhOolGf0C%KZkB<32~w)IbLiZdkxE}ulqBiM#D{P;8zlo
z6f^7*VT;q>lK2+hRkM!hp|AY=5R9AO1t*ip?Ye9Gpaxr9X*7HCCHUt7C?j(8D}CJC
zAKglQf}9`RwXBeBm>huh3V+q^Da9YKpM+q1>kFCk>Ti8R$FADu?HsJYQoV9cMgr1N
zH_55&Lmg(_+B59Ku{%L{zNjUCm8e1l6`MvfqLD@y`t~&EQv@S<JKtVurH;MAYf~4n
z?T_=^Ea#ivxORnuk4SSsR_(UYMvYNIgz2MESYzQ@yU_ikwqTJkkkrG5I6dIqfm|34
zkfcu`Iqg|x2W1;9M}7fZ9V170MUw`Z!^h_3R)p57(P=rh^xf2IGn32>byGY`?iPa7
z=!~#F!2Yb|ea)xfO42m4>BFm}@!Ohgr7(L^q1*gi|9oiw+FhS96ZO9kb(`(rjeqmC
zk=CvfG4oOes}W)ct$;V`Fc?<g?0K14D-GX7Jif>-`shv(TEg|oLS|zU#X|6L^v-P4
zkR+EcFvFGAb2R#?@MrXnJOP<!O{ec5Q>{V9|F?$UZQeExY4cnGxeD-N*y7~XWus(_
z-7*QkQNIeXBNUX58{hb!xsn<Y83STs?cMobK=3vLwSqD5t%J21t~u7N9RRc^fkGBA
zEq;iQADne^bSVbL0S-tO38T%vsf}q#8G`6lrK)xQ+LF*60T^^qLjL_}|AeMYTah-n
zr_0;XJnN)y-R}PiJzSj(9Cug*aAzF#Z(oS$Y-oNb>pUCmv*MHW9*$+ztqkC|+)h!@
z!Qd=mR962CFv^a7-Iz=05O&U0i7_HFrhrferX2mIXWd}P2MWZFeRgA#T2=7SF;{pQ
z!N2<XGmpn$;P<q#4kP0>IP47PsCJ2wO22-@dtP>Ba57~Ehb^@X;~)0NUxYK-e3_-{
zoqS#nM*se)9HR>giJGboU27dXF=m_|eH$h^RZW)S<<Z~qYu&9AKW=1r0=_i^2bqTh
zW4xb7+{t}KC_|k!GwcyLADnyiVq3w&FR5JRV=&Br3q0VOc1|VQ)&JqYC_#aC_K&8Z
zKD^d`NP48}L!e5YO73knd1mhP=wGqN8{PkN<7pC=OE<9*fHeAfn(~e8zDzl@UUXH<
z;esSP`MGkIN>s)m`q#)*bsBh<qE(fX2~bHEcPYI_@GH-+jO;(cuY}wQRR###6eMs?
zOY6iK`RrKw$~TG+$>&>5>hS$N<KDUo!S^RecfIZS9N4VT2N&Mqzd%?N5*yn+pP!ER
zmiBrn!N^zC_#HdG(|MsO|JWE{e>5S!9`9hWa;3urkqrQNu(Osk<=mbvDpuE!#KGvQ
z(4=B2Tg`1Wx$)XtpAbw1>_4p{U!aFFPyZ{XAFt#BZ^5v8wH9-5!G#0yP@#i>{DbB{
znD+;D3Y}5)q!EC2a!@*jGLlgsn{STV8qXs;(4#;91c(Sdw<y3Y%3&hg-o;6ne&-e-
zyXWpy{eV&nEBKW@#P<b@QCFvhfk@%t#~`?Uo=^VuYJd;q6jXnZB|(8cU>?FcPj`c?
zE#$MTf_yLj1@L7*&?{cZsIlXyloAp&15#sNc*bQ1@mQlrUj>@@q=)}#*A{kwDV9K|
z3Z&i3BH_<wHH@5HFNydk!A^bs%j9RqCtzvJ#Mi3ZF#!%1tS610<#TB)lLe1v1|ys&
z{6ff&o4XbMmcN?$3@t5vCpx{_0)sUPZNFZhD3Xb3T=?ik;zhD$KqY$G;ry_N<)L{K
z5xPeQZ@#Px#fM?il84Y5nRvT%x0eVYI_HdH5i!Y6Cyu58<m&Qip>r2fN~fXjqr)^^
zQ!9(>0B*D7nVUo;oKw|gXZz+-Ta_{Ll!Y(;h2C_()-%F-On|h_<%H%)C~sm%*h3<o
ze+AGDr4w(kvxHTfMD~ftTr+b(!YS)^%A}V$VW`wX0kO`!-J-%zsjW#blAY(Qnhs^L
zR(WeB5lu-UJ4N1jJG{CYtk&Of_^Ml9=Vc_p^vr;?Fg4$L6}ydCL}x6a(d8A}k7Fx6
zYI54|V*WnTlU~J^1C)?P*P98yKUY|5qsE{ex7ZmP_TNjb2_3EnpH6SJ(xhh1K`CaU
zckQ>?h?#gkfRC3VK4nI2@*SI;pMUo<?clQ@Bt~m|<W@6Q(DHw`p}M+u-vVp(GN|y0
z{}l;NZ>u=y!`w8m9f6ZOfD}c0EpjvN{8SpmzG=NUM5XZDZCihDW+B%A$RFiDr_m9y
zAHaQrPDd+4nPdq?n*hKIj}MA_K6K<1r@Og?ka)QOg^G%;pZZmm3w32?Jh|EY;5G&b
zuAmkc`5BFft2+4_RJ(ku5vFD=Hlt{0M75{FR|<=zQ0Cml?H-2IJfuMNBUon4eSlB}
zoTl&iNOaaCO$Pnjo*lb(eky9{&~!-u(9xeeKK~5r1aN-gjLp7ab=gZ)MhT5qdE?S4
zGgd_7v?ra8%LFbnU*M#*845l0?Q>H0P)xEdjXXwxh*LtzT?z|)moSxtUe^8-GlCuW
zu-9fb`Bkdc2V$tyA;gSOB}=Bt|8Qf-HHtTaZAa&YG5V3JI5=OgH;+NL`oLigok0&R
zJQJGSq#$N2c`Pbqq$R9rjS<d_L#9^kqC!$9xEk+Y)v{E5Z|hQaEsOVz;-5{ew}qMA
zrYN+p2$Kk|ECwmsq!{t#x<qvr#8jpg9f(!K-@l&O^vz$*6zDifG;FR97tVS%%45;f
zRp$O?(qXMQ@42&owWG+Q<SpV0Myh{@A`z#qfx#=n5suNt7mwXf8LE<|9k2jeH)7?J
zUcEVhjbTPpj!q{l&T&l3BZxL<dBS}qqE@C-t4&4!<1}pMEwv*eKz}N%nyKRGj8``^
zins61ux@gaM{FEEZ9QIWK&>;Lf~6xCz^q(G=uI4;kLeYI{~H-BM^=*1CS<4+KS>FA
zQ$5$<_tpYtI=ft30Sa<~+fNX>>Umyvj-lwXd4#SdJIMOreI5Gewff~)E;k=Bj>i$o
zsXmyCISNtsR#e=sA_T*@s=#<2Rw)kye(Zy}ONz&$*I`*tKg}oT)OI>shKE5!aF`Hx
zYS%QKYWR;83_TXRM!s$Bg&w_$z^CQEi%Sp|2~GUoe{igX!{EEeprhVVJb((k28R>H
zV`_TtD<u(LMFG=KswFzLEy++XpTlSNy+}344ArC$e{ns^7;EWQeU#WPgh7PzjxLOQ
zTfmqVC5ITbS3TMM?{@*0c1?lM^y5LF+_z?==20%G;^TxE;p)32bh_UpjKa?qKN<DK
z7xtG)mngDQ`^LHOB(BWMu|Ruc$;EdKYM&Lu-=X9##wZ1~K*WJv5#68BQUxj!s<bHf
zAH>OK`7>Cb@dGLl0iYbzqrzM?;>3(LSd%~Wj#a6DUALRI8Rak}%%^ex`9)Fb?X3A_
zRQtg6cXQmUwIIU97s{*2-m|60*pMjN?F3;<@W?z(n9MRnw&oa)r@QK*iU*jL4$lE|
zlp0E?cv|;<0`B3@X)(Q)+Q-zTrBjddj#t#nhI7{gTaUyZ@0nlN#c_^nrY1k0YdE#n
z+24vRb#2+MXSqEhCc<6XE%*ljEbfP5nHX=)3@$##&n)GPYS@KFM^a|I!f3X7ql`Z`
zvc1hHPvv=99pL%PQ&8m;K8>GWq@~hf`@3-WoVz2bB59c8KnzD?8tXqMc=ose%%m7R
zEg~jYT8jnk!MT7VRl0~iuA7S<D#kI+#Zv6u$Lltmh+gd#vGh@6KKQt#<&-tbwz8<`
z95_q<RQZf_ZQUO95T4^fAix><bLF^zXPsYM$0&#=oz)m!F1j$-9*ATFq!r?alYSvM
zpC9*=MyW57(LIXb9sLnVt@s{QDgnTSF+g^V=zRamcA@5&C&=>kmjyzh)0ID{Y~G}5
ze+x-COWc03g<1LpP1QVxQn}-B7MPE4(WVtjoIMy&!GN80+n(9j{O|*DYK`$*0+d|T
zn#rF_^)C;^P@x(NyuF!1h9ukt5Hn=!#oQ!HZ?nWdO;*SXnPaT<49<&^S&WE|RVL8`
zPq{@YC`(mXk?%|1$2?!SKJ}s@GHP+Yk2~cy>sAnXlQ_1w>RP(qM|7ZM>DJ&f@`VGY
ztup-C-6Yy)l(jnfgO+2*f4}Hg$3e>Lp*}}t#N)?^c<>RNFPz<j`1uUQC%F@o<MhT4
zh|2|mieJlTyb*ToJ=9v316^yc@|eXO4{SZK^TAN)DdXF*=_wtCs2IWCZ54oreDU2z
zV|O7mR+&@j7g|Y5L%*=x2t6LX+8EdAia#X>o2>q1mIjz^lUnXPE@>aX`>@QJ@=nB4
zvo_;7lD^F{#Zi{YruZfAJTMc4Mx28&c0$)0vnK8QPSuV-CP6~K{UB5$D;YK1fO?8b
zDs%(4ygl#651dfX4XQ^m`}uH-rCaNUx0}~-O~wCA#jaWY(x^fHJ6dR+bP%y*?u$Dv
z&?xV~2w&2+CJxBGEoe^6O1-N2wvWD&_7-spw~26Z4HX#jm1@O(@B_Fk0H#7G7@QmW
zurpZ54J7M`^#D!X=l2Pz?fqtBW!8A0Pu55GpU@ql-@>E{>y3}Xn4=b5fp=6~We%0J
zVu1A1UNR%mDA{Lj$X?eriWDRP-CU7<G!<+j<W=@A;-ZuLP%i<+ybvD`wTPrwrsCQf
zY6M+v(QSD`fq%>j@u+5#joEt&z-jHSwqeXc8stUf8bXy+vx~&b_`^DmGNhGVKy?!_
z@`H*v0XK<P>Awxf*T|iRJz80V)9XQb-exm|Ty{F+oW+7;-9ae>C+>wYUCtG_njU#m
z9(xW}grmIBw~Bua%2eE!Mi_&n^7s9#@2!50^(%8c4=@uFAYFiDzqa|tG?~h4itvDZ
zp?~j?$<#~KZ3&j=<zX=bn<F=f=i)%J!0M5In?F>?7lA35=$?>~m!V!+XIaM~+08wn
zS0nvDM%1qmdO$dSvS7_kz?cDcsPOhp6INq-uMpcdfFrO;CHgtL^>a<kLS8zJDBbA6
zh)N>myaz7L{ZBNXyQkvq?1YSpsf4i^P`yT~exzc$wESB}Jb4}~o}Y>lTM3kA?GTKP
zvkWzXjEuaDd<Q=QbEm~M1pf!kPN4B(T+}Vy7n6o`k)W1*v7$--b6WeHafOV5-}v>}
z$`ym9Ak;s%qXN3KGcD2PM_Fu!Ob9+a5{6HF<mQN2*)qh4FJWnV`xn~1<ss}_;Ts=1
zVr`LIk|%RiW{6SZ-;$8mI*lH_P-)D)w5Mg!^OA*6|2q5zAJQapS(AB-j=#t8cIEqL
znqIT>6FV<zX1M=z$b#42kgXU}+rU@W%G#C5SX}}Rlb6>w4|tB0RjY0!#nb-Sy*0B+
zt&~O>WcieF`WyT7l7F4yqbFq#s|HO<a$M}Y8Z8*;ERR(!v|g!Thw;8-@PA>P=P{0p
zKX%j8e1m@aQWc?buM<4zKzd9pawz;w9EKENKz!2tt}0vPoDsr^_JE3c|53h)ay3AT
z4u9DWx+(Ell%bf+Cu8QA9kp|RPe3_MpyP$g-zVNIBx>w~3hwu?XSyx<=2`MySWI%_
z;u!0`T2V^tN1F~s8gA;Hw!D2p#l@;ru)*@uTnb%lk4QB;2e7Pf;NN$9+oK3f4LfzW
zH%P6~zSmxTQ#$r!B{&|?DR~*NA3|<)5iAQBPdE=zywgQLA#y9#QV9|tm&2<1QTM@B
zFkXxS-r0{WD?eD;kM{(h5ut#C&p0uLtdR|xQnA|#EXa}SXb@;H(P?KIn6DMAv%X-0
z&XrzXYhwMo(8Ea<(R9RM){N&eBInloW>7kR7+W9v^mj*yuaMzW^7NAV#=8m8Y!E)1
zjkPB4?~cYMV><cOwrg>CY=O-sSBmU=Ew~lvuUFo0b3C<6cGCJwaG$??;AcvxoehJg
zQo&Nq-)rwOQpB<in#P_{shC>M@l-IZf#CEdK^bJ7UnTWt;^3cq8mF}jD;}}de>NNz
z4_MdkQPfJuJ{E|&{lHT9^0)45L)wJ#XL>Fy6{c!`AK@OrOX*qcTBeeIhL50!Lu}?g
zJ$P%bl`~N!^O)dAf^ez^<8kI@4`FA;*WW~f*>()_^4w21D$0Uy=VpCEEh>-JhJDXg
zK@=NJT;0qGk>(;D;U6PA#>9N9DWC~PiLMX}EON*~%T9%D1wP}k)OKw24w-I~)sDZJ
z=y((EQ1o}ARVrdT<`05(L$@4-cHKUi8EBB6wW&MBZ<zj#^d)pp`}t_d&RoGxr!G+7
ze+6Opr(kSJ%(H_<VgDUl&t;|TnbJy3i&D4s?Gus%F|YeSn}WOibvQc_mJ9w!n#^FZ
z^AwYgdOKI5bNofT+Ys}o!}IO<x&J~~S!CT*g$z?HP52%a6`iyQw-ZNKn(!I!sU2i&
z$ESOf>hN~YTm7b1ip&ful_2Vh$I+S+)NS5UF1)d-wIyRF4&TrpYq<d4s)ru*VKo6*
z<&qD$E{B^x-r!W^U=oRBSLHn`I`L!lKkY3<h0bSgYvgSfV9ekwmYIEB!ai6T|Ay?z
zmTtj*hAqO3o(OLp9pd|G@u<G6Wa7>zr#C#&@{b_k)6UiuU(Hjrpu_ZEZTqvdg-$1{
zI`z4#0zVSH`H5q?Wy~$oOG=o|r28q)`-GjYahwQC3@ey#ujn7wu?2O2nCsBGEn}ye
z<{CotOD;*!D=+dZw~Y_JKow{_@#oEK3Ff-{gN0OP$tvn?S)^n5Q`0$$%YtD#nj_M#
zxEsvUXUt-(Qz)+yf{4&`pelPaZtYEikkRET{pQq`mDi;#@X2muB@(Xl^U(QPgIp^8
zxNY$KI`RtQ?~i$Qg9cDU<uaD4&rlL0MpVeTw&Wkq9XnsMe|*|xe=TL7pVp;E!6=>4
zLz^|-_###tEhRCIsKo~3!zS_{`%i4X^jQJXi)^cYJF6dqgV3qgO7M?<_PJ{sy2U)M
z@9uV1jY@~O<eL)Xu5Z(KI-hkVE8b7kF-R6Bne|9*ft>q*D8wI_o>A$HE`S{B*sQi)
z6|dOFPrVPen^><I0$OmyV`Dj6_^)ca?O`gORp|*oZ68|5zokNC7Vy~R8e{-|cI5Zt
zRaFYXA8Hx&!z@*x7KtF(s4e-A8})Tfk;MW7@lD)0K0C!*jA)kj({vrEO3aqy{?WtD
zmzcTQewPsYnmO@C651!!cLTyZ1dOV+ir+CpiT2mWhKg{)<;t;9o^)vSJxRV|?@@C|
zlv@sd(Xazwu4WF~80<+$A@vA;fpOPLY(eza;6lIx5cRn-9NUGL^O7$TKhQuSn<6*V
z3FmHmzl_8Te4YfG#92@HWttu{4%}Fg)3KT5Z`>9|n?%K$ve0}o<d3Pi5SCF}AxT*N
zsBx2WyjadgQ7qA2F?Hbl#(d+(|NF7;v?Lub%?vvmy)cj+Gwt;=b}qnr*gO+xMa~3L
zsX0sd9?+NHlJPl0dC-&mRSp1PlgGy2`zKncIZU%avfPo{)l5?FI`0XiZpEj#1xJIH
zIm@N1vd2eEpa*M#KB*^05S36~YTX|=e1B>nWIvLE$*wUeKlKwgSL!-tc*=#igkD6+
zWTu|Kb@q3r?onWceJx%PZ)JG{Q=+!Re+>w?bqa+K(>(HW^Ims@$#_1C6Ccs)b4wqK
zbvRiw?#8@~QQCHHb+S%*f!%+ME;70@JNIK)YoTG47?3;qAP+aC@473bjz>$x8kHzS
z>Goi=PLNVCTuV8Kx7MIzQYuWMH|fe+dNLDMHk3h?l+mLpdl?>vxiUt$7?d@hY0)Iz
zzb`Z9Sr5()!iwkXbJDL&A6~Q>J4Px4uq-}BNq%BZUZ&NoOWO0rOTMSZ!ud#c;oE=O
zd^eN9zx5a9Xtu%u(UBrl_OMI8MUd-p%7quG@s%Q52`iD!MzVJ=Jy6Kce#i>B`hArv
z)c29qA*}rO3x_OgM&=$!r+GyoF<l5L)~`YyUPbXvD5eK$27h(@HoUq6Y($^#$Sir;
zgE!vd=T`@`Yp6Y7BWe11vp)Lp-}m2=xcA5@ntk?}1UPn+`&8q@vl2GX$;wp<*HUmi
z{<czt6*uL)z!axaT>a)vTCt!U=~#Wu^BOS~mi2cSfB(~G02PXrZBB@uNVT)4NKA?a
zxihJw>eDHKx1*ntzN$_|WdZftb#g4RfrPR0av_obH=QOH{P89*A?>Z?QM|c1KwoM~
zNaEt0zmpN-vrAbM<SLXwevU0lZz$rXV$<VME}*dz456rIdfEF>f7lU$<+qHGo}Ue0
zp2x@L_>Vi>Fb#yH|JKDl3_X3#6wjwL$-l-EXHol2yW$g$ev#)=>4?{stvV{l&JVLg
zSB!8zBbvBDJKdPiA(=tbLGzdGG{+w&%O)8)<qWh7&+<jz00N_-1pYf+Rl?HGZAh!`
z+dW$!xWY*x?1iWM8x*s2h2aH@VXeHqa^BY9BA51~7KLvPj3k`<P3<84kaKwlRuz5@
z!B0yQcAt%}SS?TWE4)Z0AedCK65`O&3l87Dr%db_A&HojvENXeP13Ue#k|^ty;D6H
z)>Ttv3ZuhJp|C3Jh($!ywh%7FOcqqbV4B=?ip?S*sj%<(ML9OHDCrQW=97%DFH8%t
z8SF)m$xl*iL`q`9B;tl~U-9}yAQ^APJ7*(XS)DJ|4c1oxc%5Q${xD$W%dzCR@OQVj
zJ7Wx?a9Q(!mFm;{kQ6g$>flJj#!u;mrx_QCRQ*AJKGRV&=^E82A_fG=-?01{xW@cj
z>vyhBL>^!&mpIHpj3@GGdwg8bLcQxMLk{#mh$eN64<ZrbuqCb+!OOXpRm5#g|Bt4#
z3W%z0!}Wk5C4xwoq9C10ry?LAJ#<OO5Yh}FB_-WRHw@ifN_R;2M>j}I?|1&a_raWa
zKsmG4dY|XMuj`Il5w%;5Uujo&B6W;g*094*PaOBT!cZIwv(IWXQG@zV!7Q=4qEEn!
zV+mcdb5gS+MXYnHimJogrpvbgN9+jP#Hrw^%&j10PfP`vmOUKcg&m0rdDQ)_`CmE>
zLM%<ixFwZ@r4M%r-@Yt(kwdFm0NOsDP>Lf_mDQaekinJGdkFSJrj=XQ`i~;Nf1Je8
zYLo9H16W>K=5hXVclV@}_v!freqRr3k^>8=3ns{|{ZF-A7ACz_Gx)$aBiF?MR9y3L
z71w1I_F>!>Ct0Ji)oOkk86}iI9%ww#y`E)H8K!n1acXGHI?tU>Bd%1gb<75tw{|6{
zfWqk<-x~T8gksUN{pYc;t$RhgTBpK<BkEb`rnYTR39ZN6QMroJz3q*rB=tx4%+KHG
zyC;|N<V>LUswJ0RoC+*T-<6Gg+vv8G)13>P>M-~JZ#yg88!32|{-sg3VksP|Ud+y`
zt+FKX5+fAiv#O9a0=Tmp71C#;y0(rmR*=3n1`eHfU>7MMzvrT`ajGUZCZGdiJ;dIB
z60<k%wPyVUJSRlJoQ1_JkK1DJ)hM|v-&1sWy~7yT4!T3|^K=N?Cqf2Bwpa!p((7Ik
z;)>OOk!DB|Ch;zJmc@kCt*4jFCp`eeBho2wy?~!LQj&HAW**Qb3Xs7@_2#&02VVnv
zH(ZQPV+m>Rtb-oGHo9+*l7=$Pi`e^?_XKxEvmMg@08ZFLIpZ=W=nA}sV6F}08Z0zq
zZi_-zvcmC!Wr(8f?fELw2QZn3uV&r<AnIkekWRveEAa?lpy>l(?T44*3xwacIqKfK
zjCPI$f_VB1-BW-=WIK$x#D4jiPn7Tu?d9jjmmlRsldD(=hb|mIUcO;u8HQxk=C#EL
zJQn-eB=k|P3`6W^8y6w#c@vI$+*V;zD`(Y*35XxKcs{3c01CQyf;N0p{7X%>{)l6(
znScA$JGRF<Zt`~n53~O$mM)#-?e$KCh088mCKLP+$HL(&jh=O3Ff4C#&p|!X_I>{i
z0Rz$L27?}P-SI0?BR!!~r=_VH@Y9m~U&q3A=xs!Qy(nlejx9IxfHxrc3)){lKucBh
z@hBgDta{m&)EJqL?Vh~7*XQk4b^ygwnov=8FI#}<Wm^)ZQMIVtgkOg`1fKqa=_n+n
zC~Q^mP(3e@6o$Oia>>_O-%~A9DpTY=zOR>jN_sOUxm6*zRj<1?DY<fviaEX+d;LsI
zqczhF&v|iQer@3z&f8>zY;+zv6%HqHvil{T&Ntml6p3@DIqDQpMOUI*YuAd13{x~6
zyc15Zao{7~b7cH)&+;yfN-!l|E#IvSPSs4zle(4`UUO;KlRD|;@l?#lOAn*~AFjv|
zbEg7r#Rq*nMtTh7ilq|BKEv@0*udK7-0^{R%^GCAG2$9e49KQuAuqw(*zruz!`hmC
z{yOabKh9*S>bJ$XwZ_&A_a|P$B9lV%wLd6b3=mJ!X?*&SgA=evB=qkvUp-DSskqTv
z9B;f)tQ&7nrD2~K3>Y+LeUZVk^L_{L<7XVcrP118F&)+mjEEaXSD&+tI&|p@oWFUz
zbrQF#EgXU@F#DTD848EebS_aJ{<Qpw+o3R-?fN@faecEuYV5g*AybEf19*%bh+AWQ
zdjM2qO2eO+GkJaA^&(?To!A9jR{gx$)4N?`3!Pxu-GoV@SV_TLjGi-{Wp{N8)BNrE
zCjYdbU9mYO7Tlqsw@3becyQT4#4=sfDN|IJica%;kL#{~zLstFWh;Gc&{sijV(!nD
zUG0|A@slA{##e;c(*&|&-0lYZVQr4q0+gnp`S2z8Ttms{C(BABYiqs|7Wq4ca<+&u
ziX*_AWrF<o|J;XAk!fz#mJmX{d89xMH5i*e@CVaOy-<-W5t+@@q!Iyk$x-M{A=_Mg
zz)4D^a?+IAne%`AF15wMvRnvisHw3VIpEpjw7|>}VZ=Y%DxFA~@ZCrD=iEU<g-~Vy
zpLq_8CI1&(UIF7MBCSuruzuktl1L9axz;E$|5c3+OkNC<^|SH|o}~TLq+Ga~Ti?>T
z@nlV1w3{%*k}Cc>bQ+$mo?Jj#5JUk?6M0MICCif)IS<Tlw}|$V{Y7E#2o&ROl-p~8
zK0vrOoB88b)ynMIA1%BxTwA$ka~h^9CKw8w3e&mnh`OI?-D(>V6Q)&kIo^M=Yf8Jv
z5ynzr?P$z|(L<<`9{c`ZBWs1rSbQmRpYCUKv~-W-Z)S(wpuNIDTClo~@fMwwe@DHi
zs061uT~j-v`-{7#htdna2xCd{HCDTcu2d6TNp@=skQHVB+@qW-_n`um(Bm5#8ToBG
z6tM_3f3D;WaD7gvV6u`D1Lu78;*qai*Olg$F@I~phD|)OdVx^YPq6m7Zw|!VkqHTR
zAb>ytFQ5J`a79%5v<Ci@qJASi;%His`W2@lb}aNyR#J$4u(@18E--bqFP_C*7HliS
zgWo;TMv;gE**xl&VY2M|jNUS1h8(&E$O*0EJWz@R>vUPeDiJ9BpM;t()5px#y$AzN
zL4J=+jEvj^RJDjIYET$7hz}e_BY8c$6`>i}geo8Y{_Ia!X{aq7W-@RmVZq|_vYTbd
zzYvCGhzQAcDEMfgJOhKa4_;7ALZABjYI-L)hgjl2eV0(VehjU^&nT)~L}mC~{swyF
zyT*H7ZpD>@{DA(+MB>uT&0kl-NOBI6ssljXPKK1K1IO(I^(iohWdX{P+LGv1@jTPf
z&h;GZUsLd9gS=hIF7LHC(6In)v*ElIAQT)vBel|@eoleUQTUb3A=`YR0R^OhJLXAO
z^JpsRa~i%j5B(&`8dZVBMSj8cuav9}$aUwp0@a>IU5J3$n?Vz>0tbvp(XOOov1h&0
zj<{qg_DY%*%Df)UirWIS0GStQ+r0HliPwBsmlRuE<42jdYsci&tx7ihe3dUpZ(6=Z
zevaG;oCDLp?<&%beDe2DkxV;%1VNZkfL~M00x?BZcUoe?cO^k(*FWl{ZQr4<In`3G
zQc5G^XQW?;ZC3oe<_LP3bAn4$4(}H7Pi~}*S$V6nO3vOnK`_64!$|XG;)GQ$XdQgw
zWR*2r3JtAm8yibJ@~TCz9=cL9%f)>NIC!3!yx*8n%BbH<Dux8d0!V~E$g`j{)jb#<
zF9B9FHYknPyDkE_udaPE_4gMT__h;8NR|OuQN!Si;KcpdR!`H{T9z`m7PIeJgUEA+
zXk*~0SRL!P1I42crqVAlET}c0N|A^Uzh<cLUc2OAk_rP;bf^qAsZX<M`W6``jlA;m
z)znOg^8k?@{P6(8&xa+^EFg#=?DAvW)in;|Vb*(r!U>Pe-{12Nk8_f(dKHj-b`QA4
zi~`+mtsfYUxNElUqph@6O0If^6whNJzZ@du!oyE7sV|oQCC8bG;XM`(rB8Rl@c#3B
zmJLWuMVS)A$gwCA5{$s4n#q-(v%TOO-hTxc0mMhlU#gLc4a0u2OtG<;H+rJlEE=<S
z4A@U6wcq0fm?UJoo*G{H{!DA8Gk-@xsHUV_)ptb6#Dqh>qiQ8p9Zn)`yREt|5S27Q
zsLfnB{ntgJ%U?AOZtQy_vK4wq?NDZ)`#fV(wT$0>Q4=7A!ky?IS0>vs0VapJyh7_J
zyY8RrsdX&I4Y1VtJ8}02v>0wJ6*=(+eVtiTN*fGisIwhn9i*puN>_@z8k{ZENF^9M
zloPR}!wp*&8J%TrL|Syjuw3Ij^5hXXQX{w0D`BI@Qr?!QiKj=md|Z-@<kpX%(~{Ac
z);fCR_0%^_$}9Pne^IXTO5K8*1Y|x??X@5wB4EQZd#Jb%E9LBRpGulWtcA9>(lMA#
zgrG{u`n`35-)c=CgRGdI1o;fp*(>-ro4#)v)aXG@WH)o+?87l4ua_w#?pz_9bhlJ)
zw8@eS@1B*Yey+$BVwgy5B;MA^-*(7xtxc#AO@efTmC4v!TAqx<dIN3BunYkcz%QXe
z`|=Q0CW1;RifZ#jGqdBp^eWiF^QO6d`E+p3{Y*E|jP>tyr|fimGCjy_Gv&_xOW^6r
zg;gQ)vQWFS|D=ydwRVnSer74zT+Xq7HA6~oy_TW9Ar9wU6C=YZ<2;UGf1*^>L=7=O
z+J2HQ`HjxuB|N+eM%C8E&Y(e!1rkd6_VPoTX!si<I}dYGNo9zu7;@3linUaN?}r;K
zo72bVke5iZCI`r3fF~~FKM7f8s8EN!chla-GdyhC>AVj8Kh?Y2lFSN6`Zt?r?7CWC
za2^Pvcqii}S|-`%HiXo&TgyjM!6<E$MBPC{_T9^oz|oYT%$PQEK#iAy;LD5bU35<m
zZf>aWE>xWMZZgcJ;2b#|!5>XFV<x*GmMzY8A#s#=n;4waAG8Z!RI{57<4KI$t#&<}
z&cgIw_xPsv4DRu}7+`L(g)TojX=dHD2}?X5H-CyJa)X2X#Tmj6xc3vc1&{@K2>x}b
zhb=N?V;$z7CO+U`r(1qGq9a{uAaLop@5cY1libbZz~a8}ZR*(Ga{?Uiznda165l#+
zzkc%^%&dAS3a@~L4htqb^fW*dvaORh+va$_EcA4E+ih$i>DZ(oiG-@S*#>t|-1@9L
zZU>u3Mx(n$6gLHS>;#r-I7zU@a_SJ%GwM2J@A8=^-JW<hm+<d%izs}{ODfY%D4LUp
zMOT%`O^ZTmQl3*92@E$cj~giqG^bV+%AE%c(HV_X)<cU1t}Y!dm_|l7nJafVc>?uE
zx{mT(p9)c<3dZkRaf|4S7|rQh!u}BF-pdZL@)XHh9PMaz^Bl8oByj-zZ9DjxusiZS
zi~cnOZ<rqvFxad{H4d(P!4G@(4?thzI={x?6d|B@z{#T@v-i`UWqV8RA0GKm+?I+(
z4fDlgOhOBY1IK869W7^)BLH#`zvHpC{Pig4R~EOP!hyTXz^Nt|L5rTMH?@x+>I*y;
zx3EV6-%UZMS>pKwV0c?$6Z?=-YK@x5QTx35o%M~n_TgU>wZ_Es1)LW>1oWGfbONaq
zusa?9xIys6Tpf<Sjh&u&gM-0x;iF)HT|E9U)FprsqF-`11PZ&P;1F`NOo1$t&YyaZ
zL;&zDE8_=pfYp1TR)l8JDI^w*#i54CVE^YM4pOVHz+CaCFWs9z?(4Dz@pETN5^klM
z+rs6TU!V75gcNWii3h~s_;cY7>OEXq6f+oNpNowEL3?P4{YX>#vz7kSw12a=<O+~3
zE$MUq->;I*6l>;%e2IDJyeyok!>bx4#f#BGmYIXr9h()??S`vSsd_4-Nc&MGc9|#R
zh*{>0&Z$}YBnuhMSE@8yX(mMIGid#36xa22^UZl9|8>AhcutewP5!2xs_My^BAXnc
z?!&nGjXHFQ+P#%M8MTNQTDOj@oP5@*nc5#e7g}?z<HWsO<*n577XJ|(k7c)UB<~`{
z?2-P2(qt|*4@9QL;&;})9_STfiS2vSxPJEO0uhW)B2tqBP9;zA_gXBx%+tS$%<%s{
zSN!qq%xgZW*X~8YZeMr_yd@jP&bSxLUE*)<klBo;_lBBXUoqgFIc5j&hR}UBn7vIw
zWEQ>d0CA4rfW?mjNo(}_@+=)_DGIqHADSglwpjZ+I6l!?iF1)2ns(>|kDZbd^Tz+T
zi7IZwAts~|^nm74_OFD3eJGlanSth*(}9Fl_v9B=dI9Bp_1{LP`25{xKt_erp}Z3?
zU2Y;$NBuqhS2l)%!aWb{Ka_J?3Se<SLsG+{q_8pwx-CbNuZ6?Q8dJzi9P-*}uOIO~
zP<uBIt75`?edwORZxwAJzmRc*$kHEJIq7k%C))HpSn2lFHO~@;Mi$7Up1haq>z4pr
z@5+pl=x27iW1ObXcZ3Pv$nrT(c3X;|bSYOCG4%DMPRDOxS3gD&1>`a}jDurUC)h_L
z`{O{eUC<+s%rf*}B3*KH3F`hdta_z6LkTr|M0>@$EsP=U(WOg-fjAc5n!o`!@X3Z5
z-r>XLdQB?6K45xTMZK^Qhw}$C=*@9_DDf&lPbVqELf4!a`H<$7zY>|koU9&iO#j3S
zZS^|me=8%;PkbB5yr~!&lQaRp0yI$B<wSTl5NggZ0Yi_DL>E&^4x`B<f4cijykJTB
zuJ=Z#^<|M?7uQIX!*aA`@hoMQBQ7&JTOWrsu0*bR5Fh?@kg6~FWT2BozX~0WH`n@j
z(T{?xqf@WaTriOf-a;H5lWE+1>^OnG3k%51lrsjt1!93(dB@KXPioPv;DDEV`f=e6
zlTiE;-4t>Rr>sjWeqkv4shf~)iN%Z9#>O$R1~zld!i}Bs0*SP*p0H1*siEMK{VCxP
z(37S1*S%W=J%yRXF*>(AzCKVOQ{>2pUc!%dkgSOp%wRvdCOHihSx?3{*Ei0sT-kom
z!YLK!%4L|$&TWDTqu~o`ANtFA?H33ZI+d4beGF3vb*Y1CwdB!wO7uG=YHY?#(gNgi
z(mV_pLTOMX;_?q)Xsib_a6a<S!KJ3bdjC3-S@5pJ+4v}2ofz^ryr_!7#eO+lXBLcT
z-D|eCw=L7GtTw<dpPU;qR`um6qqK)W6Dn7%Lh`xkuJ<edkf^D$l$LTW2eT9ZOh|B=
zeO2cZ(AZO|I;q8wf&}@{{BV8Knp-@?2e=FTmvIy_8`7)fZ+P4Xo3RO7$bA|!^6l}l
zs8xWNB6zPhPdd|zmGR9G>_n){|5Q%e8o+J(?gzgsYt}H*!rqrGY?A~}&8a#yP%)Fl
z8Ox>W?xZZJQ7G5xL=mlh+&WjKko{1M6YrO$1n!zj*<c_-xQ7-=QK<FF72Fv+!G=(=
z*>k(J^2=XvPq5QedLcT217Q+-_EP-o)y=zA+vay5U;OY0BK4`q-r$=Q0rYdS3c>p4
z^kimk_RB!;G3>r<bD_vzTmKDD6R%U}pEXzUwH8F*v@w`H@xT|0dmjTY1ETX+_UP!r
z3*}n1BBhB<&IN63&my;l#%uhq#bJwcxJntoZoOKqwB^D6M}2%No>usP<5stdvDE9+
zScTlTZ+2!_g#QESQD+UG0(~LYON{80WgK;XgeQ6AWzm$nv7BV^P!lESq>k;GoXRHW
zW-}9hi5ZceZl{BZ194nu_RBFF5x4W#DA1tE$8!H1H%N(K*>>5X0;4u5T957N;>Jau
z(qLffIAD^GXhZ2}n;fmxn!&~<Q6KZ4QE^<@3W`KTr)(MU+r3-So~~79XX=ZR(pigY
z9dn*Mu6EQdmMVGc$9;v+7i|3S(IfkURFUAg`n3}`YR$z9#Y)Pe5@T4TN~wlESAa@j
z^u$JcZbM0(5v<Yk7<38IGsK={)bzRSAmevP2{?dzEMC>sTwVo?yHH-ae><=%@pGEd
zyovu}yLro(uf_@aL4GA7O5vr)u&<DT76fFE+lbO<eBoF&$ibxXK45}O2HPndy^1t7
zcqR7v$6+|W&@NgPwImU@U-PRoP>_^*FL0cv*OZ<0hY&q94Yj5%=7dcIVCm2kL6W>I
zv^hlRshB_Qcfo3KOq71t{0BcNwk)LhoOTzi;QI8@aYyjI0VePpL=`WFEyu}Ur{r&)
z)rnA;x0+xNWE3{@cI;=Py|~4M_UnZ1M>nq~@z8#xeSKEmRJg=ewDo?%T`sO(ql#aD
zA4{t_>#sw6932j{QGjb2=K1c!XrrYHDBjX`<NSrGlfm@>-s#LHryu@xu;zpV^}ew^
z$B|1WuQ^1DxlUhI!Q5yA2nW`V#f3RR3MT6^`7lU3!Vu*1I+61SNbu|Y2ZeRv27q2c
zUPH1g`GS|N5;LVqVmrCPP6G5RIIB+Zj+%Lx#r}d%0{+1tk-NV?U$;4+GE8B;#sp|Z
zRv<|rMDoQUV7;50pq}wb$@ZmUsqAg?2^s)qbZHg%@w%~1y0|@gzY}0Wwlo35Te=@*
zfHai8(m=i+pRG^{`v}o*(cwz9mgV5>a-w-l9f~Zrki>t76nZNOhb`zRDZLq~kve;P
z<9&&68#iLBHpz#w{J`#OR%0J#8etnyWc2^AC}w*S3UA2QK*`QeKWsR7XqXnqb1L-s
zBy+|e3AOou>olK=Dp`s?Nwb+DXAycj9#s4|_2i~zo#nWnVDO^0Jrb)i;=x=g`t4pu
z;7?&Jv}fTD^<<a|YByL{ns*osMSHaRE24)IqW_S~jZ0H=pFNGv->()R6KtwpF=c<^
zPcrn#XCZc_9$`dctE?2nbJOeK>D@B@V5ub15t0M%c|IPqMFtF5N{r#oeqy#ao6&u-
zUKZ)#jR5A=K{F_db~688dmMuKk@;YIY>k*j8Jq#Iy<OFNw1bMHjWp5&j3?v>2OKxP
zNj^&LeuvwsT^i(~Q}9W%bp_ezoqs`2h0+~MgZOfCQB;_jY1y0q7=rIk)R)I+*&V?F
zUcp^9%i-!7pn$ms3Yd@#mV*^6Tyu2E66aNK0*0wLcABD}x}o)o@XS}Y)&oNDojI11
zQN?4eU#V@w$ak*4lxe?&2+rDpde?b{K=_%zTlN$itBb=2g#OPrx{5#-(U7S{app^R
zg=+DBX=*YT6*^TX$GqBlN|=U0u1d(D#pF_^rn38U7;aZWKV|&Lz9af^=taIBO!rgR
zIa}TnRXz2h5rNHX3Tfx@c5<pGxFFtK6#F7$v<b0-0LQhl)5%dvsxs)4{`g|aejq&j
zh{<2CGV%&3Pe^ON6xext@(o~e(u1dK)nZ9ZdvG&Bd%!S|@Ndh7)6xrYGlMdWU}el`
z0ZRi1byGe)1lh4tBgJKM4nr&C=A33>46~qcHr-pzBMnh$CnR{u(@0Xn)^UJE$Oy!y
z02dKPi)z3sXF`{|2c6LF!q<>N5|Tsn`$rM5vsLcj=fkB(EFH{swxwJJfC0MkDwH&c
zx4FJH?*n68iLy^t@NNJI6>$$${(#8|zO4NQO|trfN(ZSaAbR)5=R|W{@PnF`4O--T
zt(I79E9({!AYajfMrgDYPy~wgy|Gv>yLqY@kjHg9abHuMU9wAIKmHz|LIU$qIZuyP
zxicZ5%*2})vSK^BIf%OqMk?&DAskzsPFkb&PEMOsQB&N%Y$_vCsj?V2m!^x+bE#_#
zVLwlA|A*in7JzE7FLDLLX3hce6EQ*h*c+MC*=P~SFdx`aWVxv%vVHwyE$V_5L@mxc
zxb<O`Dsz+BJ#-rX7nz7*Gc2qOMltB1)qF#=Hh36b$fEs%N$>^ZFH)sf^iQUs&t|1b
z)^Vugyob;ge__T3hv8|7!-S5q>C=E;?@VA!rzdt|EO<Ju8hJ{Lr1>&(-WCAP!O8%I
zS3H*A?N(Uq<NL%`s#rSh_r;J&lxf)aE!0l`43L(2<B-Xs`1uDDW>{F=m-PO)wR)Rd
z>M;Cr*5ve>Gd2PSw`kPR1L`V61Jw$pV#7o*ZKjrHy8H@ca9qQXw$4Cu-NFTKjD+q`
z^)lJ84*?lkWB3!X2o$4^HCK7qlLX~fg|gLF3eT3_3dm|$El2<b(jV>NWhB)h#G>>h
zeqsDz@sBAy?Tvf^0fG#`7~0FPKb=c3>O8YAnFmP$^qH2^xqtUaywsQ^@dlcrkU+!Q
zE(@1htu0%ajkb)Bn3DhXy8%PIHj+2PS1Bj0Io>+E&-Q*+FYySLf})mE_|ul4q>$bR
zr_<87ZI6j^TcUH%ojmHU5OO7Uuo49q=b-O(_ev;)JGnbQwM%n#=qIxgBZI_=bxV>!
zlB@2ZhSmQj<pssoV1*@tT&7!8F8f4G;kV3O2BAz8>pc#x;y8*j7Qjy%cxkOmWm|cY
zBw+H$wZye+iX4xutbz@@|0a}LvBdWC%e;nG;EACR&`ZZ4<=;X~YyX&oTfY4}r#wCT
zaf)?_Dc2CnH&yK_)U`Q1W?GddZlgDPBWf)VXLH|Aoo=NxGWCBQ#jJ1t`tP>%L>SGm
zI37do>xolp#gwm}nw9e4v`h2wROIHA&lT2s5%%+f6#~~_ef_omca~cNQm(_TxSkM>
z^WHbt3^ejdKHC_-1<NHuE5Cm4+|SYdqp^lze@u6NXjkMjaq}hy?lP>pN4UB`?5|-F
zsLA^_#;)M0pl>&?jT@=qejKTHyCyxS=b64m3W7RUm*JxVmsIEX5a^DR@MA@;P|aXt
z6FcNG5=ZM4WPX%)6fU?GxoV<v2f6GRVd}ws1C?%!I7#unqbKC?J~Cv)eMvIA@NXCK
z1(TJ(c?{ClW+pj{2i0nY0xsIr-M&|E#Yfepn#%spnUPD5O_t`4Xi>fSBO*8;V@bBB
zOvlk&p{Bn2eTeJ!q=8LSd)Q)tz+6*q-op4qRZ{<@sZQ!wPt3IuW{L<hk@IAOnb>9&
zOn`>b@aVQ@H)cWyruBc0r0-V7<6z);HN5RarBZ0}UCr5ur-`Rx@E1q`vyv-TN=|Wh
zpMzg<6uI_4N{yUqZxsMSITSIZoxEmEan}6cZS5(pSjp3xQ#s9my(tM+qt19kjsq|)
z-yj8&2ad0|`O#Zc+-qJTQ>pyB+^K>4+S>5}u=aM<OpSD>rAKs+=#OHSY37S~N(X8w
z-^b(${1_RIAO8Du$XbQMcrGQ9rRfjA-D}O7%xMHOPqM&FW6ozqUO>9sMqpN27g9G9
z?oT1FOb?xtzDX9C)jH}1kt@cV9Pg`WABOVyRR-;G?>(pm&TS#CQ`?HJ!=1xQEFsX@
z8=s$X$zdA>)t}?2(yhRoEDPo9z--ik%fAU*;-h0e){@KvaH_8LIMhq8vjknLmypSG
z0CgxMtaWNSFsBvF`r>&QExn*OlBw{BLGu@B!0&RF^L~w5DM*}#%^uTqDmi=LFiz9y
z2b^tgWd#C!cZ><^1^3RTW6)j{2OXj{ppN|Vt3F~4oHHvKboA)~%5&)315m?gr{w<_
zEiyMMB-_lhGO4wV(;ajpnRYQH1@Eg6V9<QvhNw!)1#oDUWd&pwsy{=x5v#MDtzBJ_
zDH40;B3z<a3Z7K$fO#9lBTu5mGr-b(X>~4F^$2lzSgI3Cr}??WWz0y{L?di#_9O_?
z>J!`PyCjcg@TI=$fg>b|y;>igPONHs5H}%U;P3LSu~kH4Sm|jVqMkY&)$MjCo8*o!
zj<34LgftpklijzQnTPN@@Fp9I_xW&j=BaMa7o%?+aT3OrjW2a67n?=F13=tfAki!*
z3zi#J{w3|Xq8o99TJNyTYAWw#1CFhr5R1SjpOR8fi(+6J=im22o(Pxq9~1&tdwgFV
zN{yPcz?@iS`}U7wOO3YuNS29!d<llr$||8-kvCJa@pFTJlYqaC{*w7*Dd`jQQHvgh
zgm|aw*<6EOZfAhAC1xJ3aPC)JHTIOrFv4>lw^J?A%Y6z~v?Z#FyG?lFt4*~)-EnN;
z?*2R+=(I7BTPo@9z|rpI0q02mUoz001s_k;ufiE=3?ZEOfj7GX!>2Rb)XY=k+fm&_
zp`~vKLTJjx3dBo>FPlR?j~k+;MZX!t$-j8&-P`nOg_KgTX(G45<v0W)V|qM(^P(M0
zNs8AuUoaO?WG}{51qcywR!{XQ?TuyoCiN)3+)i-v-@XI(LN^kW`tu{ma#in$7Sa2f
zr5_We$>(zw1uhw-q?@3U&n)B%vJ1kN1xGn^GqaiI9!Eg>_Q+c%wF7AoIAeurqE@KO
z3TuDb|Id|L!i{L&V(Rr4{8@{edx24n=Fuzs>9v)rs`L37EqLOjU=q{qQ>Y952<gAC
z^LNI{he>l=9cDQ-Rn1ug$T^bv!M$f;T1?AjquDyV-09X1L(gUB{8V5h>$2JEPU0}O
zbWu5+aZeL^^eXw#(4AYcgjW$JZMQ#rqZUyINR_t8-j#XkmllPWmn?spFxT~j+)ie|
zgS|rbR$uB4v=ePQb{s<pU;f2kG04fH;$hJ4TzfBe_?_C?gI_hf$wNG~Vd*K5(+PBi
z)c$7%nv2v}sp?ZOG2OnawMpMK{&45i)7|eDVG?B)Lz+|2)8;+Bs_PWi4b4wGPhXa%
z7w_2@j+GjWC-v7B46iiKO+4D?rZ`8*P`-?tMocH3th<Ko6}qhyU#gVp3LERG9A$1v
zOo&XIWiIc?Q_1ftrLj*oBPfbus-M1knA<9Fh?0A4qXnOYKzI4_cU9fScy~>pEjyFn
zje!+NArRrB^q{Q%$J4YLyCr05U>j5(n?uBQI42k==gmiy^DoG*URXyEg;D<DkF@MW
zv#ffX)h;<-ZP}w7K9C}ztsVq8)}z^<B)KUPMp6sa_Ji1TD`LvJ(az>eS)>_yNijQ@
zKAH@>ttIlVHT1mcp~pc1HJ#$WEPn=OyauKIchcpRa+Wok^;)x)ENdZW0zoZuz}g5C
zue&SIJ{`qw(I{~927Ax|L=L*}4>6tW{<M&`%sb0d!usTHDxUMt@Q-Xs^9X9;5<FG<
zM%h6jHm(6J>8P`bABUy$%`ZWpc2$?J`RKeRO`<GqbVJvKx-S=2^ih=2_SI~+<KX`M
zad7a~Xt3K;<sSzNjPjgeyYdBGFAKNd78xZAdf6e$l4t(YWKDhU{+hdCdFsvhqNXe@
zBvudIB$kS2g90KG{8!Cz@0X@8#r@Do@{55JRxy}8g(UAp-wC>Ep3ciwuk#EcJKN>e
zpMXU9?YON{bI(@96JfTo@Y{J4Yo|66OLYTWLscR%3#62=r1xF7l5!nV9sFTFn_4K7
z{OVh()o_2Y&+DBd!i$@enot6aq47nRjv|!UCux9HPuNt~CUnh~{U~YoNwgBg?qhHm
zaYb4&*cY{Be$*uNw4DfjVL0N{<_k*Q*b#pDf((T>47)WdM`cnnkD;d&J6O<fBIm0@
z5lRiOi>D`JR(YvL;&vZ`1l#)zs+Xh>1gGqvf|6Ll6Gpv9@HFZ@pXxNplJ|)xAO74-
zan>1Y<Q}x&UpOM>1e{pzYmKGi<M_SDH_@gk^yv4e!%O+F^BMeAVv5YKAhFONA6nj1
z8Sb&^xl0pA%|H<4MDAHz6?)x(?LQ_|BKfFuO9W`rh0cGCzKXCz4&Izu&kN~(N$bW$
zGiZLuRV#i7C79?<y>V%K3SnvpR7+D3cGK~dAd2vHZokR|gu#-&1ub53!!em=jwH}f
zVfd2cTDk{T8&6)A%^Lb-_5A!e>bjij^&R|^FY<NAdvA(DibbHg6@;zW!8S<>nhq(@
zEil&8!k0t_@Hs)oh^bBPvV}<&)lR!3=)+ojz*51hiBUCnS`~37!Y5No8rsLPbl%%_
zWS+ZNBm@MW8X3LldPK!cRfI|rL<(asmM+}@vb9v^t^ib$t&+4d;>v`1I6z=Pwc#0q
zvW9I{c*^76t;b<~bg&{iQ)n~30h1W3YgyU3u-xaii)fvz-1Y{cU*_pV%PNl>1v2f;
ztht!c8c5iN;^v9=jHXmFp6s;j<t>LpvZrW@jSzH0*Z)pE0+wRUudp&2-#C#l*bg(g
zQ=u5?l4jA<d#{`_gQ*-Qs2TbrFT4Z&E<<@tUsg8tbxYo%`|-qTt6+KCXAiz!_$!uS
zQ<@k2DL*HUhTC=33?&1VkRBX<qoz^1ZVqqf+o>x;_i2X}Uv`}*di#n+wTsa6W!|?K
zXa@inp3DZ{Bvr_Cr&#~^H#9x!6_UuOUOE*Vr8nFDTPGrA^91@XGS!4=k&m#FyDQx6
zRLwL5hvSXQ+qYbnvVQ&x$XZK%nc{V2^{@Hgv~Le|(PH4M%!<x``Xxu!P9{_p^ZgRX
z0VwB@`QkP+#LtTsJ>Y7gFVfZu!|0S0sWLN5_lV!QtrgZEoztO=M0hE;mU%1rOmZim
ze1-0kF6z)Fu7xFBJ58MnQ3kp#{M5|+dgvD!u>+142EWO%Aqv7Agknz#&fO<+fn26&
z#<lP{t8JchNVpd+`eFF3j^j4xxr(#O*G`k`O_7^N-oR$?w#!{EiSGB`=*CHjG;Gny
z_*c#5lOTnqIOgrRjXlpO?4r6PSaY<vGSTY7d))%2{p$5&WcCHPV$WVllJMLlTAvL*
z;AWd`(n5CI)p=X#f(*6^#GP551xi8M7107-&$Ld`!epHvL7(@Yzhyrg516Q&<$$us
z&hW5Tj|HU9aX^oR<}eCIpR{bA68mRaw4v@Oexk6nOb&2@Uv516ZQfgPKaxiiN^S8z
zxV*b{6VAPoI#OhTh;dQi@#qf7aHA<oed8A}B2%XR<Hs34iU~s)?}g(NOVUC*{nZ6S
zzVJ79?kl_GrjOSB$dC)pXY%8;p<M*D+o%7%UHP^<m*^%!zkWqhwtVXNJ)+iQNk_p^
z{&d!TC6xLKee3D;dLuW-WHYxbfW1^ZJ%y|Qyz|`s(|JIc`|x30{<NJ(`@Drjq;GV#
zk0iiX43A-)EGe?owbP@($dOuQ#L_aTF5ZIAa=b=!9KXIb?~mfyTTdIT^J>QT!91m^
zh2mFrf;5N=J!sG0x5JNQ1@ajwmKL%OFVf0zUvIe9Flx-j*4uzN_vh$fB@+11+_00M
z^Tk_ORRML)x{Zej4<V7*$CSsh1_;oX<EQZcK+j}Bi9bIA`2Y%`n2;>~o^JkGV>#<T
zRt(m`I#2jS9JlT4hzg#P14gTVWx1qq7!!Bs!D{LAN+JiN;PZ(`A<Y3GI5L2-@T~TC
zV+!Ubo^xHx%Gutd$YI_S$ZP#QJ7ZD0dHUH^p<jqCqjc>ISC(I|@O$dCGd@YIa9UPQ
z0y8c<Hsv1iCtIrtABl+beovt1h;<rL@x&%%#jk*j)vDZ3Vdq~AgyrdV{7Ggna0g~v
z^pJwR3oYjI?YnUF5Xxk+#7Bq*?*ez!!iL}r*ZZ<H`JQ|XVyBj49y(Xuj{JM|&QjB(
zzD*V;hBc4MFG>!XK$2^`!4FHv=iq_M7o;#nR1Cu!mm<3k{DdA1)5X)D9bt=E&4eZr
zZB@IA`JXEMHe`B`+fs6IAew{->5*?`r>+4F@<VU^eMI+`vaZZpBxGQdUcT`qG!**H
zdYS}>lC|kwddNL`VG3?-f#>;8gv!vST7EaF;%+-(a=ov_5lFr|2GZ4*&TeH5ZIbX<
z$j$s?%@?DpYMtJ%vTYw6&TH(QBP>`j#uJ;v#h{W(x-9#m^q@r%Xw)ChJYsVyW(2^o
zas{L;n^!#oByoLBs#VD?iw1~GSNU)ZezwwAlNM;fwC10H=3(J?YJu99vA0Zck5pcz
zvTU@_bSCnM*W4}W!BEK*G}@~2gY_yKTlb8DiafCq9^j-!4}&m$8H?^@a8(Cd2<#6o
z)I=<(cGB3gD^@58;O`n${v~R<_{$iZ47eXxgAxM(TV(HTx|)-)xFP+2l!Ag2(XX89
z;9}Awl~DL|JW{R5pG-FffUK6Wfzm~YSwnpU2GU|tUQS3eG7hP*ZEc-WEYrsCyvxEb
zQAcoWrTKmT%=s@$UI}eON6%TJ4@GO>5?PSNlG3+nXPz^c;QRjHOeiJE?#6@P%+`l;
z%+7B7->+~>^EULG8zy!I<41QjD9%O8Hhm<TOpElO<=bNq?s8Z^l!qRL+=jaK_;wPC
z6`xv~tNayk@cit!2B@K?KVZs@6Tabj0JU3tGSu{7xu*rEy4CNgS!A$Ke){n|hpumI
zFK;oL>85L|v^K^qpyl2;_J<TDdhE5(q!)Ffs^z105ngwBZ4oAP((@W$?ITJtRkN^E
zs#m{yFQt7aZT7$<Gc3Xyb?$0kdD=m!*Dkq=@9Qo79Gh?70!!G99td*p${O~23<-`u
zv{16h=Hhkca{Uh-^<UcjeesFzW}EQc-)&<X0u#{00Wb}QorgrJZhFvsH0IJDiw`fa
zxB<ttCm`d3f!wWtwFozooRYO>J3~xjo5ye*5dGBRgu{Wws#4T}f`?_m;rA}Vw}hdx
z_#8#eD%z0MiNx(<KWudy2BVWb_clE>eS!s{`qk6dBVrC5YU~$f=?#LR^V0;hgB>qT
z-u20QH!rgq;K~|WX>KGOK@|H&fERVRrds-vaFZd=_?wx4*`G~4RFgvlUGZ!)7c7=O
zE;^x4{Y@*~i!#cai!`fNbgXaQT<ISjOohkxwobo14OyxpzOFTfLb51()J#xgzn})4
zHbVXb<-HI+Z7!;tZyAFo7qkN>Iwq;(&TRAUd^9}?luMV_{q9Dls#qr89xa;!Sq`mz
z9%ua!bDQB{e<|KJRZuWvdnKn#6DTJ5rx3GwsLYhQLdxD?i&k+CYcR7C9uC2#6141o
zkQDf7A`kg!l7{FpV?}J<m%XJUinqlaBR6*lKELN-yBwg;`J`7Y%z3!5Oa5FpId(v+
zWrlsqCfz??tSXB?Wa;OmjzjYDc1aK60Spo+B-<bCuj>0!*!jwrg~<VB{UZBf9(1;a
zJ{@cUq3owi6?1pa<*>_7hDpF}TQ{Q758KEZ96F~IKJ`L@G}R@n9r@B7|En~~FP>TG
zf@(&-Y1ioofO(=tZUEb_FoGrCc-^lqJkDW7bi#my=#~Wn@SwDsgIjF}{VYraoQ@~z
zD4jVPVts;N;E<#sf(`CfIespZeQpS!js0zecDXr-IX*BF>&xfN;;fO|13qgUxl(`W
zWN_#Ac4=FmS7hU{-j9M{9XTKSSZYi9UVR`11VuE%c)licohru1j}N>hBX&wanD0OE
zL=W5LGv)hwdPJ#YC>k2R?66oyI9R5a$_RO;l0-kg`O}{Pg<NHw6D?RQamGr&jzBlk
z+186+a)jk=IkI9UlUh2NuwK*Uc&rj>p8J%eHd?UsBF<l?(D_wah|Ft=?Me^v!O_iU
zIJu#MtqRJRzTF8X45a8PS$^Ud9@L4UQzoxw3H-kdR)$6wK==AI!K0$q_h&)4OpAkx
zYu$S;bkhF`B|E-nD0KjLN7P8>O5mGuMN`x?Vle)Qe&W91Bo_eA`#xY-)xsA*p}+)f
zEN)65Akc*GkD~?0_k~|}aOdl0-}zCx?{MGhx|(}EB}D>1AQctj-!*1mZj~@#6;HXu
zcONDV{a$ok@u&pOMqD$Zsj9VQXIgYZA5){@Da4w9G{Mt>$CkXcvHWT#;0a*`tSSP)
zBT|IB^F0>i<C7g3t}a~CU9aIp@LU-^@Du<Y2%1xx$|sgB9T03K^WG+RTL;N+2UGM-
zvTEHl(xWgAAs;FFjVn#O5E{M|M=7<3_Lx^7p7*JzfM_vtqk<Uo`PbP?A_mlkJ48TR
zaO!hxLa>wgTSiwVi(;2S30v52HH}fIeZ1~Aj@ktnJz@B=o}HfaPI5abFM+Xh@`+xx
z0KMN>Fbd<QQN(@#Ogvb%`A5m7we#VO)*KmHC?RS$*=c`6Hp@VoMkLRUZ}ixLk%%bR
z)<kb<HFv*YXG*~-AYbUoy=~S_rs-tU+SIf#Y$_o#)jfIgeo|31xy@9Y$x%!k^BtO;
zL#Kw+*uXM>%R@`ogJXI`(s9Q&Y4Y-=M-8v^9e3F|_3`1Td#C#cWQtEL<)aXY(RY+H
znxsvFtsK7O$iMezLT8D<5E1v<tBvw5U^6K<`o9rfQYPG>y;rlF{?z3b!Xi{}uhZ_s
z1B_-kpn^Qg2EhVqyC<ac)&&)%E7KnAM1@5LMi+C+#vjB|6m6gH?P0pjScQl2P{_o-
zx*vO}VapsUsk#bLVK3c0sO=v*`!H!8gjY6y(GqZa+-iOQY)`-f5mrj$d<z@r-~|9n
zZV-JQF0uy0$#TT^ZEp7F6dGYl1py#Fqu@N42T)d9jQ{EtSs%<gMSAo)iVP4k9`C-{
zkbT&GX1L?lUGsZjr))fX>7QkSVvcGr&3VY=^9huTv|YUyauj^`DpJ?irzi}4`I7Pv
zHjq&@T*ImEVi>v22yj=btPAuR)wAVHVU%j}d{mnL)#%i+xVbT_#JfW}@m2DEazU&0
zD9Rz%bHrU=wC-9FCiuuMs7x;G*wM7mLhHM_%g>?lFu7}ugZ~;imOu$3`g6~*mP|w*
zd57Y8V~cx@8;1$KyAVpDHaFp9p3Pt3UwC(CCxK3P9<513Jwj>gTb|rf^9?$bPEm@#
z5HU?eeR9D=V@9bHUA0@Ib?U?1hYR?~8^5*62ht%LX;$ij+fqU?{(_#8nzl0UXJ1y1
zY@uS=)?oA0V17}99xi4RTBxLuS1M4hK{7tlopqph?A(+wvrHx^2#s9>JOjHP|7i@y
za?Dtn;cz)s`z437UhEkbMX1rpYm^h@^P)hhH&<X6Qww3_X|Juakt$J>r}{|2*7>ij
zVf18-oOL#|Frd=p_PH~5U<Y#gz3KMBrG<?e*U!FUpN)-pIr(^6C;_BjsATy!Bo-F4
zDO}iI0`xMab9U%CWZUwPuJnj^@c22$R>kyLC)!D?G>65Cr0Fhh&EJNWdhe`DNI~PX
z`jy3)+=hVnT<rPVNhrIURd+!*++-`)gvEAC%TaeaYtzc(0L9}ze)@&+!UQf(+0I<Q
z*@llqsUUVYAxoaO!ET*0E!>Uep>EwwEN*NPRcn{|!g?{UZpcT0Gda%+C0W#VtKz;i
z-0q;R5tMa7Zna`Gr)*X#sVW8arrGSMRk*y@_k3>Gz7*?U@zcpm6h9Cx+3`%jC@>*A
zvRRw4!9I(i=Ra&$93WRR`PK#E;@?>Yg0I2Fd!5EdY^Su2JH=bbOK$H1fe>7r3aHGo
zfn#?xg9L`4cRF`-la3V?e|HQF_hkU3m4;eLwu6!s8Qc1ggplL?Y%}%nJuvWg{rb>G
z(hwr1IkE|gkWCxkz{l0(@(v^`9$mUH{MNZx#~JwB<dFJzU|`B5?zX%OcJenUY+zt?
z&A;fxh^OSQ!{)A~Ip?hzn9Gw$D3zF7zb}#M;dma9U3s);&z2+;=vU7LeWSXCg&<aY
zyo<AodR2efO(5>1k<j-%*~P*?Q<A5wbLwQg`AzajqKV0NaDaUk=20$eU{01MBid}w
zKZ*k_uF?jkNfC175VrlbJyeB8ktv3)*WnEVn36XlLi#z3+;wBYZCGL$P28Nc(fLNz
zgn=nCaQkTS_yO<}F&_0!ztJ@+ygbt94SA+QYFg@_#XXq3(gu(O$WOe{GHw|%jVkZd
zg9Z2Thd=0PWY8ydS6F>3HByZ*x3k-oVdw4JUAST%a5E~D)%@xX?pMElYd_Q<+>AGR
z7W?OaNEU+$Rq~{Q<~L2hQ(5x#0inQ==tXw#{~!t>mr&lyJTC8TvU7^N->-C1U`VXH
zDrM2m3pZh)?8zE+pL&m0cr_`eQ&*81`5zKRa(Ht6eI(jolxd1bvu>hn&$253D?cqt
zSY2I;m?$NGyTR%ie0LU%w{DY+^!Pd7(c29Xh=NaE^jf6BsNVKzEw_o+cFn1q6+`*v
zepTs<bnc#O395#YPENh)<%#UUG9(|h6BO{6x~0^m8YB^m#TJwk$rBU@IjbCJ@G0Lv
zZ<_B49hWku(jNE6lIohpihcoeJOePt(}BN$fJ6!{NTh6a!G?v0U+W>;2~G|;$-TQ>
zx!>0OrwjdJ?fyDMuRUeSqdVdw-k(_ArTijOZ-4^yGm{Ins*W(8K<wW`C+H?R4cPR^
zVj;r2@GXWgHYCapBZHxGfc6S1A58?KRUzakJsRXVNqGSgvrbz8Ndz?9E}=fbbupXe
zHe_c3B8EcF*b><G*6r@UdoL*v6F^1ywokanf;+fAgFy20F4RhOTLR@I#b|cL&63`m
z?_vQs=^$W&gP%WAf~tbr1qxq9pFF+x)2gzLCW$iZGAf?ZIy>e3j`L+GT3~_u+~G2%
z5{}84B`9o0q6VwI%S=<oAmmm6BrXg>RYJd=fKP7{N<ph+3smeK9;u(2$3hJO^I(A~
zL*`ad-F&7=jeQHP*MW#ToeT3*lc@?fdmIJ%Qh>A!Dwi>W+UtPM&c~=!0&KEMX7FXO
zcsI<^3hb(#oIDiJf@6U{bhlo`{z08i0zcou*Dd;`Z$|JQ7OvJN-y;S{Hu)d4$i@mt
zEG-k^BEHGJo{M)Db{||hi=vO10hLqHQo?OKe1ZOD#lug$ts@ZU0xFdMksLyKI*A5h
zdYq?u3;^N$0&o8+&{y^gazqPg%1GKbzqf1lej}@<fi2|f?dGX5b+WJVP&R76PA~IR
zg8yE=9%b-xHhf*HdEvQj%p_`h?%p5xJuy_XMZDz$hmnL6y#w^TnQ|?ur_siu_%tyD
zk%1R<`jPt~^h>k+vgR)h7Z#tIIxN(TnaJ5nrlLW?A-US{I2cbH{0u}p(<?-_z~!f7
z+to9D&u8dn`f~S>DCoRp*D<5|+=r5upjfk^xoG`)h5Y~#or_p1!zVO+>uT4s2uVIk
zaD(~Ku%_&}R4T_;I*s%w-Hy1fMvb>U_vWg$oJ)xoQ5R=;2ZeUfzau0<1Z2Z$5ImvY
zY~KP#IG{0YnFhf?1@jIv>AE-jhW>{E$&+UpvcjtMx@8jLPpnvL8vi~ixtc;I)aSUK
zNFYVl5>?9})~|V)0%`9vTU62;IXfc0BELFXZ{tMrHk+Sju#gwYjU-|>tXCbkN7T&z
zc~SdPK#`b9UBH^^d%>~N<vh<sS3v5ni}DpQxxlzVyUsbUWApaUKMw8<akUnhmg62c
zE%fZ6Qv;W$*FyujpYFgPhv#Kp-t+^=F&jkL?s0$1i$83$Fv7Gfx=tt-Mi}e^KE{^s
zrkrcTFme}lLZK&5D?WYFyv`?;4M0pxpy?Uv!d}49{`{m}rpYKSj9*xQm^(Bb7Fx;=
zS*Ro<&)OQI!3~2c7iJ3%4XE70Yn(rPZg}&~VnVgnf|ajGyk_>VY%+o3^c>^en2m~V
zh5_PMXF3zw|9!HfP)d6vUn?9%nBD370kbxJl9#o4iCzLpZGT(praMo>pS<#!n-cA!
zf*A9+c_(W%R{kQkHRvsbXh32U;w0z9e@;C81{dXk|7>TKdjIa2{Xlp~8wvO@02d$h
zUnA1cv{<s!57vDMXYCk#FYBIcB<rCE@4T?N4xmFxtn|`cp8XXLy-jaQ-BtPw79i)D
zE=<UVsFHceVFt>^p-+HYp5F>W&9RPYqYGKS0UMukoqj+!#sOu7=Qp;utU&pN+jY}*
z?tj)I>NqXkHv$SpI&`tP5YUPdYgasVh~XbTOwp1)Aa$5#b4ssu?3GLCTI;GzQ<`X+
z2{(6@lu}3dHEiz{hYh{nGsxLyGiTPUtd&_QVfpGD2<?b@ch*%onfufAd``9g`_H*M
zxr!+zSKVE#|7>#HNL1^^1uVPqIKc}CPt-dnpEO8(r{38W=6exGPhM!@U!3c-GFD;?
z0%rBaA!2>lJ?GJ(Jx?;>Dn~7@H{V~wMn*V)M^bU|><Ooe{D%VeKKc;86;&a5|0g5V
zYnvBCxxC3sSZ+4;Hai~EU#)jl+{h-2K8^L_yCERZeu?VVz}>k)?#uRE69lt=TAAAC
zpfp##NM}Eqyfd_uGI~&$m0dd(0s1$TjKA{A+nQ)!{SF`UyKd%eFVY<4@)(jUxn2}W
zX(g&AW4E~1#s;59Dy1WaS7DwB)Qs$v5*>U#e8sV4C1zv09Kx3;=*LGV&9EW3@R)m5
z@y_l_4g$k*@sGWYW<*PxdQV~H9oKa~ws>t{tDG>WyFt)QgKcy5t_dYbU?>$}%iW<U
z`lX|qz@vuYnj4AcXrygLZg+FCm4=}x4MQJ~&O0#V3l_$S_Qsba;>Bkj7TJx!yNKv$
z*<M0zZ>Y&ec1J0lhn|pT8eDvZnXHYvjND2?Jj(5xcSqL<SX%EVV1G;VO-arbnn?|u
zl!~^$pFDmF;Ux?M*MD~H1Xc5EM$jW;fR6cg$L2gac;g79RdDb)fzo?QA!L+rVr$!q
z3f@j7+bz78OM!L5e5jD%QBnwB?$+VzL;efuFcr5Y`1%9qAvdR=+y=4@_Yl)f1p#Fo
zN(i8(y$!wuWfDw<1zvn0H@fL{2_#H!DVU~izROfPcDkI!gSgJGtU&BHp1drqGc)O#
zsvjN(EVK&4pzQ#Ea&hWke}5@3iM9{a{3Ya3L=P@r`BZ?D2&N<IIk4ydy>&X+i#KHz
zuM!%qx3Qp%Z;vF5KQ4#IViUq~_u}Inq8eg&D5r*FKpld_xoL@jmaEOS{faKk9sAvG
zbEe&D39gO<n@&>TZ{-FEXb)Qs&9pWYn^-!qHp>yRw;6zr4GJbv#;37Hl_#PbZZa82
zolMBuh^_|tDJ&sR+|^k(hUn!nh-lq+#iOFGCM7-@%6Hv^j{p74-AVRJ<`-h+>j6aK
zS6M_4x5|jDL6C8im|gqT)paHir1(QP(FvQF(Smt;(rzKx)boqC3$6Uj-nH?xUl`KV
zlLE6cYt*XQ8{*wElNi66(4mvI;I69)DDZx6Y0Nm7z?9oC$m{--M3*QyrOZ><(gxij
z*`O%Ti1Hqr>Ypq($<U&R<-epPL30~SK(lYzvGX^_9=;y7?2pXz(992-lFrd-DOkXq
zlw*Khj&WvCn1K5<IFI=*&PU)<Hac2k{o;nsZ+>#K*V!9QFEe^e5_EG8q6TyJ)3uhy
zjkNQ*Jst(2>P{P|EI>(UQYFJ#$kiD$sL~S9Rz#;wstpX5b_E>J`+M*}%Cuy}5UEU`
zKCxE2dg}FUoapcfe5UWSY8rV4JOsc_EMn($PaYr|?lM8vl%y=ql=3gx8=q(_wYI%D
z?NRVm&fBF}zbE3puc3K+@eP-8rJ*^Rvf!&6Mc(-AhJO0D<@>U>ox71~9<;7Xytf`<
zxkAlfd2Z(8;ggk>Jd7)ua<Z-Fa7;n7{pK;xYS{PqlP^K3@xjvmFiSWdMXRNzj?b>v
z<8=c>^NUKZw@*~XgZnw}RTG#}hH&IgJ~&$m(uj&$a2>{>xSS2XNH|^jwCk&j!`<R*
zq@X{~J;~hi2s%r~jqd&K&I}jc-?HgED?D%AQ|Z|KFgazZ`-xjuwB_AX_HVvN`J|n*
zLf;14`h&1DvILd4&h~#dmMfIyo-t5t;T=4=&y`oc!^+4~k5FB^RtQi&BHMGz%G~1#
z)jjICD5D-2RfA2>5wP<#C$AI&TF^B8u0fHY>VpI8pH0q`y}4QW@zKATF?aaqYr1*?
zYoCF>-D;x+WlcoyR-um1<*<f>o+9!{S!W{Zh}I9{7ui(NP{rZw%#ieE*H$M@qJ%2b
zC93@a38#Cu+NYZwc+uAS1qV4-9)nN(AC|5%D$1^F4_zYC9V#H*-O?e=&>`I*Al(Rv
zG)PF7Al;o0-3;9@NDbXE(%;Ryz8_~Te}S_&v(MhwzQS$Vy07hv7xWMdktBI^zED92
zV329`7c{$?|5q2M^52UGH>e$UOxz6h-&_xnsRJN22C{hkWrmV*2qMSJ+H-q-1gIad
zCt1xjF`)RsKkvj?uOrgHLjY3_eyYVwoGFz`%fa@ogK`^!@V$n_1|UA&P)@tf$(HDt
zgU$G-6=Zgjh&js$Aqx+))yKv7lh5DMH^*bF`jqdghy&xWB?#8>)--!onk$1p{9Gt7
z2EuW+E!3~*J;uf{<MJa}kH!Z&kz65p6W_Jas}hgD=(quaBs?@G!Xh}UfL%?^XtUX0
zTn{trOoZFI&DLrc?@uD`F4kW}DP9cULJ9n3I~TeTwvA=5FOf^lbu2H!5bizN^Dmyj
z<aPO3O$^d)gUY(AmFr2qQcFPcP}v$T_TZ({-ZO&j^z(~J@@61Wb<URnhH2t*_&8qE
z(j-`zP4m;{3o!booYJ7q=EE}pMZ0(Tju+irIk%aK0$#BD%3|W$`F}kJ^~?GH7`=o|
zB5a3E59a9jC~8dM6ObpEIx-(<%>DV4Q;c7xsfo-Pt(9l2z?rIHQk&C$c(RAN_ePb*
zohPgc$W=f2^aJ}?`?2L~tm=OQ@T)~|hGhTfpqQD-g0~Tj1q(&tRlz5E6Ozd57yXg>
zOl0{P)4{XS0t$-}@yddqF_2TbsT(c?G0OH8W;f8G3(~5UCzK^NUI&L)sB|>bHW!@y
z`9hiDXKK%tHriI3uiotO!psC+*zhx_qsmRmzhw`-?$4Eq6Rx%?1Om8-Oo@Q-^2#q!
z_R#rcndaj6ac(!iT7hzEy1+}PNfTVmXEf{4$;(V;c{ws>scTOMu#W48m|w`+)n3XB
z`aj=j;V?`9X-uc#Iy$jNEey<LFOIiBN|^2A31jSA-2>5gj$_N2ylm-|MgY<IyOS?#
z01+ap%0HI%n~jKf^$mdc55Q4(OLoilo2PWeHen|N-kx%scH(vB6+j1$82^135HReG
zIA;RHwEy`ON09wDxn}r!^`Whyg)Y1NbZl}?oiF#5l&uU#<>$KB9Qq234>6-#ldmZ?
zlPnLBQYzvIKUB5E=4a$9#?f&0Q<MfJOgFHys{;yg%#ZI2=lsre^>iFZ++MLXw4p@5
z1d3HG#&dZ0GV>2em>|60nQqWa`m^!qA&e*K6wjUN&~v*ZyHIJ*<#{RJA0j>SLIwkE
zDTsP#i&+cgH_apbSK@!lwc!20-12-l?R@n;e}O_%ISpR?2lRO{$(cURfKQxx-h#%e
zeB0TT5(*d%MDqL;s-cV5FbkGdoQ<!GPFO{*CzmlCOl6l(-8_h0Y)Gs1cN@Doa;(=Q
z75K{?6EL&u-pKqv7NWO&dw9RE;8M~O*5!5Le?Q2xMug*iJQ)9zR~tN4htBV-Ei)wn
ztB8E{BYKt~i<2BoCDXG&{~V8>b6KUZdJ1J&I}4&N2s29|qsrV#dvBh=>u8yX>Ge0>
z3<Ef>`+q<z6t1K#|ErR~16Ozumqm(ODd4+7zUa<n|B>`$tfpwkDySA2EKJS<sA`nV
z7(TB8pC_L~r&1U&jF?L2^x0JffdFkAKB)M&48s0ZQ&PJwuy9VRllKM^hMJuhObY%#
z1}?_eqq7JUoiY>>G^NSL*Ayq4dZG<TyR;_C&X-rgw|Wf3vXr@)Bqd*ep?SX8&>k?@
zUI@lmtEy0c5x8Jd>8viNo3l&31lDM;fB_x}a4VBi$3ctm49aN_R67^HOru(bvrl=G
zz<_MAmPtk%+Tuweo$pTfGb7g`Ul+&=7NTPUcN1Jdu9IHCkN+X!$3qX?F<$||oCh>w
zv{wYml9(C+BsiUb1P35efR@}P)GvvWWep0Q-WD}gVMNsbc+}EOC(l(J2NVm~qosn_
zeBICj4YUJK@r<O@+&vPLMzM`lgWt^V6Qhv<^H1~Gga&a_k@U+*a}QW35lk>vrXNKj
zI0Z~XOqwULh~8q~=`_tIXopz<5;zmxtJ$(*2~N7Veco?ysJ%23xTUMi6!qsKr@deP
zyZssWM}sS`aRvd^s_?}M`)d?W$)Fcr5r9nRo}n&2NRPwM<>z^xk1I1a4LzAn{wdC3
zr6p<`I~j~>Eg&!}yNv)+u3goluMr)A&dOD7M5+$iIVnWND>TNPZyl+Ny@Z-5r#Qcq
zhf!^w>;^J@)`BDjsH}qw^d<Y9f)1>@ca!zhagv1icChD^!Bt6wmpG1Vma4jq%7>{w
z?p+lf*6s#IEq@5HlqgGK7ADJy6x#Auy_}NlX(`3|S@OcSDa;q+ZmNO$c*5gRg}P#R
z**SdIfc`Y{9iBi_QuKFZu`9NdR{BcS^6Ap6(MvjZCeb^$SHY~vyfvN9Cw1Z=^vA(~
z*+)ZLSh7#2ZQa)^MPd<aJqEHM#m>#K+qZT;#wn(ssa64vMCn80_?p>~$f#zf*v6OR
z276;#HzMAFRzQ$|Of&J}?>XSIqLA*!7jv$Xta;|jz;1W|15X%}<PQLbmOdssO~A{n
zIJ@j$DK`V8E_j08>;U%fHw<kZ8YF&|#!f~?Phq=~HeK8k&|Q>8_;phf+gi%iM)T(Y
zDz~eD0oFPZoxK3JIX69{_;Gtjipl+cne{EuCl)$f1&$*)&3#{AY&=AUy?O)FnA>^S
zzuY|pGGM0u`TI_&a|d`?IPA2Hj-^%${#@n>oTM79B}-T30w`TQFGXlK*Ep)uMMQRG
z*gCmo>>K2%CqeKZFT7P{==_870^jM9Tlrr5?5%@af}@IkSrNe%AN)MbPG7rJ;qq&K
z(-V(lJx;yF%;l2SDb=B@amYt}v9&#~Sn7=4DxtATXo>rpZ&xMl&qvWG`h|d<jLB!s
z@q>>m?G&<QqoC&7$k}fX_Dc3%=99uj;4Q&+3iD(0`)G%Ptg-g)R$1SVgF(x}^PTk`
z?-sCGod=3;gY=jCccFipnF#p5_-hFV8zSm=ZrQ9vsmDff%&L8>9Cr1FR(7$u67!bt
zj$i}ccVijTs7c10;T0U2Ax<a2Ai<c=ORQiCGpO5yH#tw_qbB|3v!EI6h|GzOJn?YE
zijh>xZf?Q};u8OFedPj0ucocV+ftiAq{v1u+VZl@w5&o=fa8<rk%Rav^QRH60mG%T
zmz)`gB)1e4ezZb(gy)OcDpc$}^gG}}2%IM%)ExMx#ie6P9n~W+M8?-4v{+AFvH?lr
zF~$4WY9z1oxBjTKl55+!VFgcTEY^oc?P9VR5=Nept(|L~Zl=@iyxvV8-&8P2lF7CK
z$xN_!H97bPh`8PJ(1zFgeWWU)P{X#z&U^K};V<9OY0@G@-<yC3Z3+u)y=YjP6d6gZ
z-~QF;i>EBaXfLO((r*Ij=-Dt=O;$;nsA!S_GNk@4o^ds8k))~uAd4U1j{C%5TqiG7
zfX(nWlz2g952GZ43(TdON<|kVGAZcTL8Rl%B#LTGQkY!8YLyj9QQg0y={+D}s2}+@
zyJX8T4UwuUyH9(kseDqb+CD@l$hiLyN-y*lY&NQBboEj3MMxNwNQw_a&3WwKKBtf?
zMRI7BUK6TpotjD3=ArAm7iDHw${g9HEG^g5C{kBTMX+47ErVhH&Uvi8ol7Kpz>fX+
zs4OZQwl0UAr9Ba5c{y5bH&?dY#OIKv?gJ<&sYI%n5C#c*1#C^q4fJ=50OU6Eso|!u
zfsnMK`gs6a9?d(B)_y+y>ZOBm6_rRX%g0ddzl|DorC@;~fL`d?La}2{72EygQgMeI
zv-QY;x6<3yu6y@nna?wkA|lG8y1J%E&Esy>e=XDbb6uZL7QpN8<=cHU!vP~D(y&7y
z1_@H|g_FG;KzM-QDDn=~c&~df*vHZ!`#qs7K)?)#Tk2&-0WPvcb0&uX5yLFsRnmSb
z@s?StW^p-;F7zQCy<OqGh%l}(G2$1m(-&JD&#i9%XH?LOS}GC(H-0XA`4=Wqb8`O7
zp-97N@E$jwz$@TNMT`Y^t!VKe)6<o_dC&g4$W~ykh%n7yA`gS{C!!1?U`&1L?M@lx
z7y4cnAvm9~Vt?qmwvKsXt{5qj0*0K!m(&QJz>_*^S97mOE(Ix-3|<Q!KKs2Ui?p+R
zL1qC9<vfrXK?Z*#(7A!_<a`EghnQfn7t5d*HnW!r|F`y9a>jkYjIB8PAPU^_Xp;B_
zvDO2#IiEtaTnaUbT#<|(BUeK;VIU{`TUqgI3!BA%my!ls@rnBQQ9gchm7`_qN5f@t
zTAtHe-mk|g3#wUS|CngHpXp;r-Rmd6H|??;M#zZ$!qd}mV$-XJvwkPX8uwSI<ZT?$
zs}&8BLt&+NWH%@#D=wz?|7rqx+O@*$J3G6)Elb+!t=>YJ4@lF;LwJ=oIdk0=9DmSb
zo9=Q7?WWJFG+J^U9l8<UZB02%Xr!<+z}kysOFC!n&F@gccwd*a9gHj#9+)GxWEakC
zT~tnMmzO1v@UVsqymTMvA5k_lHLE6A)QW0cxW`v?E3v8;E}R*?YYwM~33X|w#)0Sm
zwS=+ekO4BN9ywZj-g7t1;k5l`heVVc!dM^1n^v~ye1#Te51Qm^8k*NRf90y8Qne=<
zod02zIH@1(_^MNM;t-477D{w*0$i7Ouz0FAzy%8zhNBg{xnl%Y{jh;F0Hk8X0O1cM
z|4g3oXiCrAjf_*)j;HnGm{P7)5$KZ>$CYhS6pQ<KnpFD9K-mlkL2C;1YFB;pm5PKZ
zDmBEVlV9w>r<f7gRYJWb;PuFxhS&uH5X$C*(lPP8@4*Dw@$ovlA^4Pay|tAhPA^>E
zRGokW2sP8*<^qIN0WZm7Q#Gwmx?%E5?#i|T%ZR<Hp2_y#b`xLt!+-_}?d-p7k?+Sq
zm>QoD3?uj7bP8Zp67}JPT&<m6&9J`JkbO48rU2EUGpUKRD5LO7;wu`UJdRlbKsCCq
z8kNZ62pP^r<O_FotS_1@@ug*R<uE0T0^D@tCeiS_Mup=>`b`9xH3`ic+ArSQvpFAt
z{FttpOE&#n8-6;6jy0jvw+Qc_;p;lNi;DmJj_XwR#g+@S+s6?nKKkIik9$stnHG{z
zCXcdzjtr}DqR};J>}=PLp`b~a0NCp|tYO|=2HMGfn1G2WKYzu~u*dNl9#8Mva*QE^
zIUdIb99cjv=yhGxJn*}M8Y3xz+kN{NfzLtOip>v?gKfG3sX*iNs_g&zu7Rm43PD1^
zd_yW30ty9e)k%TuSZmP6u05x<(pI0Nqd+6D{2-HsJlKLR(wQA@`0rz$K3}DKOY@1P
z-zxD<q;al9t2bSj{HiJ*pC_9p@p?2OcZL{_wzf-;AD0TNoLbI@sP&c9L3ju4$I9EO
z)36F!a?+77w{L^TaKGl9CqRC=aRG}gY2~=N#oHGOB`8wgy^(E^6p6arFBQ75c&jx&
z-fA_N<6mJuw`+7pTI7n~ak_XobDl7=b$0Q_U1hKND9Nx_YXbFje3W#SGr81!gd#($
zGj~4xNZv56gZ|M!<LCZ3@j4R3xvJ(Q%}W`!3y2m;fPx?Pj{1!RAY9XwVXK?Jv6z9T
z`I$zza{ubhTj2itz{Rc}n6sd!gMSRT&d64&4n?V^M-LZ`AIN1i4Y?N$w;UY!@Hv(z
z&#%ohK{V_$i^vu}R<VOjAg^=opi}k-14ZM@G;71^!s)V4!Ni+Q4i&3ORM%oN1J`N`
zC)zC$%k5;t4w=MbJI=0R2YuS@DDGQBGl8Yg-kA+mTGYDa#g$7GO1{s_B5e^3;A>;O
zDBa6@O@Et1@><5guz8;&z$od&-S#ytlo}Z2nHNeMJ_mC(EnYZHqB<oaJ!<?U4zoT#
zm+DxBQ?EXsf)sJyPqKXPSs7O!;0MWI7X#oN%jsjjZzl$9kP4YRc3>^yx3xupwoBYk
z|2GnS<#S8m6E(fK-QDCl4p1^M-`7a>y6v(3@*x@ijhPgk?`fQ2^2g_xuR`7z-fUni
zMWjV?vjj-{Hi33Sw>=Puh@OIt2~MrzGy50;Q9K;p6d*v4#SfCc_N(mpJrYzT8J7i{
zD=W(z%IeZ?%ON1=Gnb0xiI$R5=Vz;e|7ISwWBNTC-fyF;jShz7@<UU~vBPw5h6aCe
z<t|n0t#xY(I;%6Z4~|Hr;vLF35)w6fTQ0?UT*e7EuX{}jX)qa4x<r(n=<;FA<S%me
z1lWMtdPn9m^tnql0O_@y0Zi=eU{0u0Xns-Of&8J-th=mRV#nDKeS>Jl!ch1(DrHhK
z8mpiN*o`CyZ%=4XL!7Y=c`dAhAAqi7_8J<v^)Zg)H<#&P54w?D2Ku(?&o*@Z)g^Bm
zN(iFqJu(TGjf9>ADEX?QdrjsJrSs6rD;)?dEB4+i{{U@TZ!KYxr&uPtQY;hCW*rpH
z+Lz7*&(CW(KPjhL$}|`Hpaye2tcFjpnW$N6pqa%T3;;$dr9w^YCoFCc5R=TDR6dOR
zq-^zMk!5xY#+FM$isoB*!E(*Z5<&^5>4Ra_BK1g-kiXN!@W=bUD1qXiEThIk#xfiK
zLb?P(hExGhFIxRT&8oEqoAnjjT4hhCq~Z8B%ElPLyp-c5*b{yidj|pK_E_0K3bSR_
z2sI!vwXw_EgNggcDaNa$k(3l`mbJ!ICnS3GN{$wqD2l3?o)z=t7M`lZTvi!3bmT!C
zfbSO4o4W1`ZW^lwGEb*{Wx%skDi6AcBLfL}_HDDf(q+zY%=*CDKQsWTfIFS1zd2??
ztnpOrh-%Ea(#>5Bt`jx_a;nJ=yom(^W|bU8qukd$PxUU=XX|YA6pk00sANVn%ghx9
ziJ+IdU_t7yDqhB)oQabb%CcpAJN&4G1|6ZUACf-V9Z-&oMwvv5L<K<-%OOUmfHSHG
z%f7xePRro#$h8fi<ZU^`UcvBoQC#D8Y?{KVTK@+`yj}L`S`D3W<oQI$xKFV+>h1Q<
zULUSbqbF+-AY9X>joliL9O^ElFS0DBSE~X5cCq94tmJha$kt5he(T}By6C()u4)IW
zE98y4`bhYUyM7L%JH=p?b<Xeh2*z;d+>zhLgAca%QjjgqG++3iJB^$KpS?X%%^OIP
z=R6;Ia)G~9PKGtVSIoi`qd$&T*&7i03x#>pk~+RPe&gD_bWR3yfAtrzrm4tsdDckW
z3c;Qm;f{+&1HB@Fy8!3M<|9@LGO!eB-)kkBL>@t$0d5={GkuU*6Fr@QPO9*$k<bR;
zdv@*i$g7YwAl4ly2ZmlW$)qkP7tJ0~K5{AJfGR2f17PV%<D<+)b$w*m!AQTa*UTi{
z-`!Bm6vpc*Qo>xVqH2gPpmDkjK$+KgRm;B!v4=cWdD&-1eK&mTh*2M&kNiE`DXra)
z$?$2yw5Tv>B@h|63lrOEB_e#mr>+U*b_$KrQLSIyPv?@I)N3q;iP#cZMpIacuMeD7
zX)xkbktMwl@DTGtLqT~>|Fw(D+FSYi-tcq76oVYIuJ6ZB*Jog3X}34VZRL+c+2ZK6
zkqU{Q7YnI-xd++$!nVYNum%HZ0*?*~ZF6l<ET*_IsYKiFJwr}8x`g{5PB`p@EH=M$
z0_QTCcg}%#dB}0NwBB`t`+Z1hfa2U3uThwt0a)9`-CBd}4K@MhA7j+By9t5?Pojor
z_l_11kN5FeTOFf`H2LTjdMHkf?AHFOcn{fFzL-1UQ<5c{`-`m+YcOd)lTAvEr(TNS
z7OKSpa-f^)k=%DFH+eTO<PDs7C;&&b&+4;xi#We>UAF%EsU^{Oql+m(4&x@BdVSkN
z=$87sFhC}o8d@a~T}tGzFvgTw{t8UaZdfc?3w{l*c^##PReSG1h?v|^mYXaR1T|QT
zjE^Sl|2)uF+2rH6G(w6+_`LrsRf{R3uIuRtS2c-h>smesg~5t{MR5A=ft5d$@D=A<
zv5;?lKU$Qg4f9eSOY1*`Hh5pQVuFW?Bn9dz$MU`3ebM48JU%woL?4){d_^>-GT<}b
zro8~KV?Q4EtK?zz*;-OsgeD+24qdX}^Znjid9zG%%^viw;Gm?vG5w=<MsM`(I8xY}
ze)T&o6nHEr1gXJYR7nzn(MoI1Il_`?AFj*maw2E){q(tbX#1q%Jo*8}97^o}YRK=C
zoyDhL*N(tB-gEP&oG`*GO@p>@4)cRZM6cZn7qUe+hesa0y0_%UwFx=OGfC;47Fd+N
zrF~chj5_ntV$=nm8c6xZ@obK3tv>VMBhiQkj+rR*ZM6+Hu^i+j$i%qzTRnqz94PNo
z%}80CZaAy{L?-BsGc1q&9A`W5B=I>HF9c0<hl?dqd*<%-M~th?#$0ccRcwj*R8a;j
ziDxVX(&Y5(@@mcm#L?@SJ4aa>9JhZs<*ybEse!idTiu`k3Z8jY+vHt`(c!inmCnU9
zGQ{w#ZJE~*qdw7k`^VTLp$cAWE~JEk&K-FJZ&WwzNO451*|*}3k|62cf$w;dieK6@
zs$G4qJ6)P+FKeA|$r3(jc?fi7`&H=;u6tMa_)qQ2{Z-U!l%^H0zj?`*&9<`4^JU`=
zg>#34mAv2lS%Wkh-#3Df3vQT~kCbN`*iuX#+&j(7R(>p}7G+p@Up+6%21-FFAymuP
zX?i92H93tTeWO(F>Cw5%2nL+Jhka!OHPAHZ%CeehT>73ADB@1j?$pfQuN($(5)xjW
zIG(#ys-nKnIOFVqPGsH~|9NVs^2|0l*s?*%X~@t=fE~9{jbhYwQi>8Cy!RQr)`GBz
zRrwIj@Eo=Xc+S>&T}+a;+%d*m5)$G#DO?y!M9r`Zg|hO~e$>Vt%12#Rn!_Zad-<#V
zJx6jLotyP=_GhG@cw+N#eykBGAk<7iiWCZXy58yQU5V!73|Zo=^6E$(H|43fcAUyk
zPgbX0{D%9ke=_PB14s1Vih%i^l-C!fkeZpUy-wq~B3<#$&oYtN%=m^JC#Q;Bb3|I@
zLOxLEZMb^BQe71C;b}&Yp85P9<d@D7T7gVWdFhB8KKKHH=^sNZY5>)|;?}>e@HVoY
zG#FYBK1{L3RTo1W%KvirlzpL}ysW#nTHT3ln;Ty|s0g{#eP(+9_b7F-x^|V{wEI&7
zu_aoq7&&OlJ9LbVtJbLSpwwT-hhnCFQJl)Yf@<TmZ0g2f{uP_OqRm&mI9P=}zKHkU
z)$}E}A^vbZQ>H(<e+f&|!6;`t4a0dH8OUfM<=yjl+PXzpo@AQb<tX4dN{mCjBxZF8
z&+gD_9az*WZG=H?Y;eJ)dD*qJr{*42PKKye*e4l(TARJy^U}xQ<^$6A_`$V4CCe6)
z3&S0r56JXmcdu_8eD%Ikm))TpPJT^s)~x=n<d}W@_L2v^(jXhPBZiqMbx!HHb9w!`
zbt$wlFcbE(A>&4*jEr--jb%2m8pf$s{CJ~4go_Ri?r=+nH7+Y=EBT2%$}f8y!`l6g
z5?91-ro1QBRXrRcLT>Pe?ud`QVI>C_{D-IL?q~$<l)`{K>=ldZ#bxMVTEOF+5*GPx
zOoh^n+1hkNB%vi{Mz<A29CWmFbMe_Qoys|v#1_e7a88p4El6EcEJ{i^aOts=U0Z~G
zR87>uIBT0+9d_l=@|H0{7Ed-TB?nQj)EHaQL@osP=My2wHGdJA>Xt+|+lavqBB+F$
z%i=!O+}6td{!0qOK(&+19>HO!2fO0Mcn@BG>2&&|a6sNy=<#9VXU=!(v{Wl_x#lkq
z&?XUbCS~rPp(!$n-DtNhGdIWY;uKE<U<C;Ra|`$G$oi}0oy%TxBllHS0g_*+)z%g4
zQYtLR%0_Py@MH~Q^QEVdzK=5tWE%6Yn|!#YLV{Hx=qaS9yf?5h?=b6*<bjIlO0}44
zdQ~$1^L0bo!0T7pBG46d&83OF5r7;jUScySik9sL#OB;KXfQIxP${YDg>R$0bu!BM
zygF9ZcB*`iO5>K<e1agOXF%@w2EIlXNe9N2!Ku$N6xWR%Y`9LhL{YaOwfcEmRRcLc
zxkRj?I!Z4yb7@^K*QLNyP5HY5$=4iC!FIN)%~IEsAwbxEeP5`Pm1*xjJvVnMg$TIR
z<X4j&FFc$?GaQf=55|0yuy0FZU^7lLvvsa%2npU%a4Nf^Fw?V_3tVz?ebc_)+4z3E
z>y&pC^I2t7p`o0BL6K*vQlf7;?doX)MZwYl=STkcxhw@I6AuSP*L(isR)U$z(IG61
zu?qX2{{<X)y=i#H(zfVR8#X=gdl<WAw3>iW{R;3WL$<sAcjl>OAVXg7m&<T}t!V#a
z2T8`(?Psp|Po~}v{#;#<4DXW!?d4sECwopd)<$Q7`GOoVUsL-{K6Y7=(;>6;qL<=y
zdz_c*huq6{iw@fE2tKm^^(E|71Q!<Vhbr-rZ0<+?RE@Oy)ItKX^i(hKYMqw;_UQ|g
zo_fa@7%9ye9{a@8MM8?JH8<N1+y0k7+d<FD_ckU#mh;=hXWyH=JWwrE8obV;j=VuN
zBM0vkR3vdWNtKy)KqW;-OZ-Wr{|#g@aN4>PmbdF{54SuY+3e|ZGe5ug4OQo?7QrAI
zUX+wiw0U3nL6Ss)3?YYM;*hBeewUq3Y@uhOPZ|bCFUX=BIC_^SouKP3rT;F5_U5v!
zZm+}oH(&XuYE#Q!*MGVV7Bxwf$yCTX+nh!yOoY0AR;qksg~GQMYR8!-LGzYBM8o)m
z)Ke(fkA?%}PMavW&U*{*f3ep4OD?crL4`lw{JP=xt?LG=!S2*e#Ua+T%{Ti}dNd2n
zF~|0^1Rvr>m$UTh$Et6^Mykz~_7bTFbIbf!y+No7Ut<pT*duzvllvPAx@n&v_EV!?
zCH@PYGI%m{7|YC`azaUX3-|oZ0(V*pB4IW(EsV3qJ{x4EQjp*fkk`$Ub|px!C{9Hz
zE+O&b>Eq%`XL%J(AYa)~XMfQd`qu88g325IDiuYK@14D=UFmC$2ujO3ZH*pR*2AcG
zaoX1gNEGwh2ZB>gZ^!RJ4XzPSp?~;IhmBtynVLW~RYKx<5SPeuTdCZLEd70s<_bD?
zZUIl?Wp~>Wh&nI1!*0Sy+6@2QODpzIoc15n;X+90_549&a#Y^8f4;#fxz4G-tvpng
zx034`GhENa9z5uXr4AY*jb$6@WZLP;Y<SBP1&=Kj+D10zbdlqTp3zhIZYYy@49mG{
zH2NMYx#jQS4gg(8=*#h>6yr9@98`HWt7hCQJ}45XJ;Z)Fx5vL`l#y!vfaFG}AOUqP
zL!Q6Xig53Q(T(#bvyZXKOWybP!=DD*X%`7zp1zk}1_3ldaf43fv!N{b10L~iBb6vN
z?FL1p6+V9Zgh%^B@o9qWNg&7}p?Q0Rhgi1RN>6`;gBg|iQrRms0V^&hlB>4lcS5g|
zdGY&bDv{p5Yk$=8<>NU9CZO6}(NyYM@jOiRem~U`i=|!8N9t*RZ&@mtZ_#?JC4OFD
zRiLWqa&Ss_RwQHnXfU7Z@5E9jzi87Ic5=9WT=gGtKtWsYK6PP%1RnFhb;IVdVY|N7
z7eUffTd3`?ci9x&deANANX&~KiGz9;J0BlJLGf`1wp(FwB&JspeZ`D9D4<NiE1LkQ
z!NmH~o}0}~y_wWtLv&7>_tq=aMocR~{jluI)*?MT$?pxSBS(p}UsrWlS(_?nlaHAN
zCuzppUgu!sqLWcB-`atOP_{rD!&26}&x44=$c~8%o0G_Q8D3^whINPQfpgO=pDRv3
zs`L8>YH|P{;wWDd<Nc3!AA5?cA?F-bWrm3(kaxDon27+7_6Aa>T?>27{N3UD4foIG
zyYA;(s*Xd=1#2UyCbBimllYkb#@j<A+Hnmr@-h{ckEcxtd;2c~sh@-cM3-*^VT@!$
z2;0EJD8TD4XbWhlk0ZK@axBDmq|Q4;2s=loi#AyJ@X^EN-*45~linz71%1Ns2i$^E
zxLFUO$zZl{04C_m?xZ;=$eM~w`!;~~$Gzu+WMxFX^~&hl1!p#GBV=$s-h|`k5mcKN
z*I2%BUm`v;H6P$sWTqW*cYk}?Zrsu>0bA6a8$ID=)MjN(mF`3DPwS=X21cx&NhPt6
z?^Irz0pb|%i4$G8JEQ$QpB$e4ohjt}H)Yfn&N<TwqKQ6ReD!yC4g<JYx|RQ7(tL=*
zSv9tx7VRN9jJZ@)Yl-mIQ!~;6LT+ckY$)^4VtaR8D?@j`4tS#)ENbTi&sR=Mp{lOl
z4BMS!VrvHP*SM7I_qwnUS5*gi{)Mj|mt9shVN@^Fb}h1}n8EwXhr7twfFXQ2vGU$|
zG@<}3SFbj0HB5t%PZvq<`?H<BXJr9s3{r)|Xl-bt?^-0z+xB?7FM)TX%Ix$eXP{b1
zoaoB!P^f#46}uv)d|KCzQRNlHd}dNss?T9>XjB|O>+v?F&SRrPRn_^n?&~qiW(PpY
z4nVI$bErPsl^A$J`~n;Co@}U4h<CgY)>yrt*z`VX%6EKFm#8xnL0xtpp<)v&dYq~e
z)9R_*lF)7ZMJw}VZds{^dG7add2P3Qwe<OJaF6QQy#KxTP2Fs)o<DlkF&g@4G8mSB
z5J;Dig_Q^-R%yO&+&Hy8P7P_S8_~WX+cjCHJieWA3)7RL3+*dMNfTn{W!5r~<h;00
z-8vJk>W@&M9!vn@mAX<<xM8m%ZMxp6m7~?)`}lbo%I7BQ@^@I7eB!(ERwlwAYX>S4
z+Nrmnq*7JZL+sJv{yS0A`KEspY<lhPj#CdxxLKStVsS{G9Zbc4V|ghJBxO0aeuqa$
zCkQxS`JVN4H^DwsHPQI|{*Kj@h=Yd{$5N@Ej(oqBfJ$lnU~Rn~3>S5iIinzJQ`dZ=
z{O-|7FK)GE<wpu)8h)qtMmCOR_rANcl};~QeK=oCr?3y9`I|KwQq^EjVt;#;nZh}-
z#Fz4nL>Ge-oA0I2#!6i+(Qk4*bWudD&s62+zr#n#<o(Cqr~0wm+lYQZLdQs6@Lm2*
zt*xZ#xt6$nh?IATocB)B$G{Z35;d7cuU;CL;in9imCcRQ^ZrApF2|2ekn-@R;QO2b
zpc*7YpQ5mEHrC=|z12xuHAz2kq4o>u5FNZ3P?Px-sJ20-Fj-P0T84*+5a}MMtfN<4
zh}pV}gZc{nvD&nMv;2};*w~n+5p0Brh5dN}gT(tDG3l7zv|n*Hd^&(n59)qw$szf}
zGnz%;R3PrvK;KpnhrEFdQ3nl+8hsRaP63nNT0~e2#XgWEqB`dkR|Z=@I{Pk1zzfdK
zclXI&>2{q@*E}bu$h0~eK}U&baQq+U&Dt$@x38C^@RDz*m&4wrA~r87Q+tCV0Rr^)
zr{_SZ9&{u_FF1t3r|bNeZO&k<a+>5^tTM&~_2q)s!+!>DA%iISzUsfa>+IYVr{xJC
z<d0OKp&$8Z6C;4ckl0!2RnXCI*yHjnPN;OkeL-ElJOQC10fgd)AzRSH^z2_T<8!uL
zLNYB=xauA9>(%R#E#-l#zP=?Wg4!FglwXKTW9fflGc&s8$zId_IQmf+I@OaRIywAf
ztx6?Cj%@#TYQ)Aei$<%Nix<`2QyEi^b!O6@es5~g5~A0o1fB&6Z&_bNm8X-Mw57Xs
z%U3-(XNq1us*>{z$9%HwzO`<TyqEOUH>(I+8#CH?OD}EYo=SXT$gS~HmkuJuH*ER@
z1}>(%vlHm}0yYXZd6x5dwzb_T`#5$(7+p-pog}XynVprk0!fLG@>y#DyudskS`|Y~
zwO7qU7h{KZz%`k|z|~u+*H2BWP9b>vQ^4=ED&?e!u8Qx_3?ruD5A6@k8%aGIqIz(m
z001c|cJ%gzGIs`xdOldV7-)e9ArJb-DeDB<c`2ln{}Ge4IJM+dAUxPn<O)<8O9-c6
z)H{-wr4R)ll+u)~p;f$l$5;;*)N1<O1q1JDRh)7rwCx~S7WywsUSm1ZpIhYFo64%S
z5fdtwDH`*df(W2f>s3$4$$JRfU_Z{pp;uc;_S1%7_k#vgXb!8(j@X#K8nVaU>1rd}
z46$j5glX9_2$`--!b<g43@n`hx&9AcSJ*0{F6i0a+|_G-|1{+P7=_J_UW?v`o&7p<
zt%LVoh`{r6Og&{yjrB?#?3q|kHizND9qq)2aNyIu2!Qn1P>O{RI}-jfs!x+a$p|NH
z(Ksigi<TZ6V$}n`!6)OU9L_z9*!;)bnTAEk5Gk*SNeSn48qm3TCJjE<xDlDaw+j1R
z^EyN4L!kr55BlMPMAj<lVBSYg^C2;;7!GC!@vx9T#X`8EN)Oo@DI)!MP@9KR^!Gv2
z#i)rWtoWPxx*v9XE}69>OD8`SSmAfT`nY25sPtbCpx05!i8eWs*6_zlDHJ@Z_I7s(
zu{;E?;PdNBe>4A4bQA32NMkz|v1tuTf__<~qeh7@QRmwi%+JgI>fR{3k4_Z=L%?3E
zu$PkBPu{fCPVnNCkzN^^OyVh(s+=&vpA>9Aq=!xkFP%l?C+3rM&$znWfc1Pwcyj{H
zEn}I9h!^rw+O;hQe*LJHR?l*wizHV5NAogL2RxpvJz+*?J;~^#iJ(&9qke3lowN#a
zIPJn7a`6ZE6tN=th?H@~2nprC7FEKOl;$FRU!iY=JIaN)GbJ5*Q;DE=y4#bzX*i8*
zgN*S$eo4|<i}W~~u<QH@5xumn-PKymN_-Sg7H6Ki28>v5U&BKC?H4hGab(2Pi7hFm
zA|fS`&2g=oW=bccTu(-cAo$4h=I%*>#P)fD{4v#Qb0Y`M{wF`ZtYD~P4Ps;{`j5>h
z(K7V*pdqtYv=M!`=Ic=zcTv<ULUP2>_XZ-3r*STS|8*g$y^-T}jr@ec>stl95SS9W
zBfP*9^cQ%7n2&V`O^=MUEj~aW_jEIb4@gB^&W=F`l-@lV#3%%z>ZbRY?XJ4Hy3yXT
zgMOG+gb?aWW08Oj))p>;xc*MzKzf>J(C8l5`@xGDCWUjLk{EC`8nge1g-njos=bk+
zF?iS~iD&SM7!SD`@ja|IbI~0sBVF%|y?E#o0%}77+h*&IZM<GBE<f|G8C(Hd9-hv#
zTtFg)AEFoL&ivqQKt{K7X%>qJO6Ac8lZt%t#UuG(eA(9Yq|2yOvgodqAfvt`nJA0b
z-wSUi0)>>nE5p88)#4~aCkS7{1Ct5R@a$@PS7JCcNRT_mGw|(m*Q@0Z*(Kr!Q!3yh
zEy&S1*<IQQU;AjjeVsLq$%CI$s~C^vTdKscZ}_@x`@O);e;F4SS5unLNNA@|bfCO(
zKMM$T(s}`5esS(&E%)~9x=B;}-uu;AoyJrTe{jB6dOM_*Q071IFqma=xvd;s+ukFg
zQ{l|8rlM7K)w;)uv`Rk{b<RR!_nC9j?|Pag;^-FrA@-r8?2gtvRK3P8K!YjaWJRsg
z;qoi;!JP%~kfO;H)_)hi{UgJ+IyO>zxU$^}^jeFhJB+OMDbr>v;mF)DYsK;hVc=^U
za@~8VsWn+OWe<ip20Y=TJyS?D^37eZuFvKm?;QEzuzu{Y=|NkwzwD17rqHucU{Vrq
zFg)sJW$)fXTc6(Zr&_z0J9%Vs%Q8Y<auij^S-tL3ELFs$`@vVH0H83ppZ>(2g)~KE
zowY+Fqd3Znr$iDt;x>HrWI{q+`nFYf;4#^E)Ci`(&xZb`nP81rA8mkX47T;Ctl!7-
z7#q%tn!dx6rHcet({k~BPsq&!zq5~_A~qeLv~!j$Bb8lovyE8=M`4+L=8mR~&A8)o
zEmVoalT#wVz-!Wl=AE>O@drZXtMdJEWZQ)AW(>XdEkdNvd(NqcPJO?gQg7yCP>(s6
zxtP6Sk|nVHXLd>TqZCi%cqbBfz%0->vMH;r%;JkVLU_g<{@Ab7lBTKi$=tNa?M(hV
zLEz3`J=72zNY}^ge%5x{JUaahpJ(~?r$_ypjAp(rp~ZE?=Go{Iirne_^+x9s7B|Yq
zs*|Fu>@h}`IYeQeE5L}`krxxmdw$8O)XV?KE2Zzy9F+@YI|}B9gX83l5p+b>*q5~+
z7&PKgdHlW0(MXSF0@X12tM{Zt(c^?7L77^r(NzS12SnX>(*z$IX<kV5$S)G5F!k7U
z{V83oLyYeJY!I1VWI9}YBL2K!+*cXqk|#*jlzcd{5dGn`rDG}T=LI<JN4|M1iRo}x
zqw3GsS@dAtfzHDeN%*(lnsMTT?q^jMeS)=zG2YDI(a6WtP08bmYelVxOWzrkHzrA|
z|4mpUQTJ0{p1eXqx3Jd0r0MXQfKLM-fW1rfDbg7=&cp|tZtMd-PsbW~bUYJis*`I!
z{C8it-|toni~DtTz9E=}WV<XFFUn`N90-8(38{fhlrLj9%&193xym3rWgSOC=<$vR
z>IH2n$aaU@-b$pii9dNWFBBHWK%&;5z{t<PzH4q&HsgmB&vrQaG;ykO83UmdepKoX
z=(x`G)dcMW6)pqHZ+7u#8uzDoGNQbk>SG*%gb;A~H9-5b_H}SF0GHnfZl4muZ{Ujo
zH-e_^W>8_Bq@GyA(~mmKQj7NIlxC*S?OOLeXHQ$aEXf=|(}f+jt@TY_uLGa68*Dq5
z;HO48sN_NQ&jUQrcK>N;j}w;f^jA|=mv*n`RXSTCPX&+r(tcZ?xy_5i<8!0xcjNr0
ztMhK{zRF|{HU7H+E3iZRtJRrjZ@<*?k(0wc)tT6*v%0Iy-GEE4J<r-_w>AKfgspsr
zkhUqev0?Lp_AT9_AXyxTD~v&3fwyk_RM@u<|MvMk`|~HEiwlT!l^|#zXxPS|VPt%E
zBd}>;R3gsAx@?{PYOHf3zK}(FIqk<>ITffR_vxw0p^NQNSLkRuF1b^O{12)b>^f8C
zuesr$maKrOyq_M}`+UBp{{+`tM;wiH$PCGA;D7H54r3}keKHO)79P7D+Hab@4_lT$
zIZ3hK%70n8!#{v#MmtXA*Ix;{wOQ$<8`qV4eezFR6e_c?U1rMFh1yEBG?qQiLiHVs
z*0k5+i^`njnREV#;fwzaY*BHo*p>|p5ew^Z<iEzTX}WUrcGA1I>G~c({HSu*G5dYy
zQa3K+`rhlL?6EMAe=+8X$^YY>%eS=w09Gl00p+A++TR*Gu>5O|C<OFdhYJ3k-YBaG
z0K;auzl*wt+&>f!K>Rs3QBw7^{`Yt_@6dhpz-90`V#~hl&<LCWx+a0<aTh{WN<lP<
z6lDvK^Px(9v%UW3(C<_a$9u1&K;HGeR_-FYD06OdqWBS?7WJYZDVP3(#(K|P!;qDz
z5yZ(Y4%dBC=?V$N3jXjhD?VJe(IbJV#LrUNQ6Gjns@&?L%1svbc&x3*Gjme<1hPfG
z%9e=yY|>%9mT@Q-Vk#&wh6X=5M)De+lcq@M?HUz?5|L3>F)@}Lm|o7Zm1X~tpLr)$
zrfzCg(Q&%}gO6vQ6Jf)OT$nf%*P0#u&yFH9(LLQCk56F%IpX4{A0Kw`iMM*r19KoZ
zB59MZ?pDO7ZM+z=7sb_cOYgJMJ7Ir)19rTA*rAUb9<ASL=nOnePUxUn4hW5WBb5Pp
zHzI&!KRxk-{!8#Ri8D<Ncm=u`GXq1v0ypJXRw<JU+RMfw`8ja@Z1DVQ>JshRn}z@V
zSGIR=bfQp8QRM%Lu{0rJ7Ft=E*y!*e^^K5Kbye;&U^jMEkM#P+=-h5!e?}Pc#Y+Rz
zI#|^x411R+cUu8Tu1NLl?XTStU8r;;OVS#GW0szUo|k-$=g{#_qAL2-2p5HdMRHkI
zkt~)<o?^emdcY+9wk=-%XN9oO?p45k1V2~I-}hatRm^_&i|N$nc0Qu4_b<b|s{mjV
z5l}r#rA0U1!6G_lX%1EU{aoRofJRK$T2D5Q8mm<cC--p8g-&iW+tDJm@H_SuSdR16
z+BC7bHtv76;s=xhq+VY}l{oA_M(SZ{9Cd7csD{Vp{8x^$@A57UwXl$iE&c56Wxx_f
z&&MkwpuS}ri~B(iFY*TXuRomRKW?OiIE-cH?2^Z0ZvZc=_-w#naLn7cdNl$Dne`>D
zjCXv$Z{I9hi6-vA0}q!xQJUC+A4k#BwA$tkA6Kx%z{hw$l@z*KTNF@Sxj6uqp=SPG
zwfwgHP@A?JbrxTyG`n`}x3g4aC-zd0GjZUEnXjUakOlD&dOWMA-XcC#*`aWhM*7M;
zUCRhL@uRZ;4+GhxA_nZNE+_BE!<6qxhdQjv)poWw6k>7D{4Uv7qAc@Y>23qOfL#jm
zBaM)jfb8!%(!0?QY^b0YtWn@)o7X-Sm@Gb^p=At*#rnK{IiN4VWw@wdOcFR*x^V?|
zI<6o+)lHPGC-$HtUornH5s-j!?BiTJ@-?tdsmArtrhS74Gz1CFZssAv{6wNj1%IB<
zVps2dXc>(ExREIkn3T&_#`thlOSDNlbaA?%xg(MAsBhmt(M<NyFE%JS+e@U_3sJ)r
zr`=gwt@J)Fvk2zLeF56oxRV87Uq~JF?w^A%9;sKy>HL@NIGEdBz%}$2Dy{P<_BqWK
z@96Y212at>P9x<zS&9WXLHB<^b(bLf#;IA0+i^H!lk5K3JRM(7Y$4=^IEeWMjo{K1
z=1wRYsYq5*Ss8~rFRr_iwT*miZzA4_V<zRBYFR<Z6xwT^e?Q+)eFl>k+V`}%Wl+eW
zYN9Kf&Sbb~nBPrgn9xfyo5(N6iIYyKMml1B+U!B<KF%Y4*4%iH({+@CKvTMW{PD*o
z@G6Zyivvi(?!p)Vj3R*yId1$xwVX~tRU3zIXWyZByQO#W$CuQdEGB&(Eb0k&h4Q@J
z{43)q71)<H{t;nNvjg~h(4)jp=*RD7tfT4{k*Ri@@cfm!eRikgYy70DG^|_c;wX1R
z@_cX@R9-Hp<O^J19L6^(Z|xL%{~O?049aJTgUo1va~oX47YDYA2AzibaQKB{S)?pW
z-Y9uwIO%uh(Zzx;rsM5}Bh4!cx$nAIPt65mI&v&|j7dx3EB1^`Z&C)eD6I`5?Q;Hf
zrLnTs6c+32kHi!fvnbD*_rVU}jh2EU-y1SV#0HsnYAlOeRewSgih#2=s6oWKhFq&b
zm2&wd!&Nz5rG>r?lA_7C1WY#BSM5`$f=|yTK;!U259#>wfTr(5O=H}e-2pc#0<Geu
z0&RzhTZ|tEN<6Sco7)Iz^Ehipkh$GonOGxyxT$$;ad0AY@DbH^bj;K*79uvIi*(Ou
z^vxV<^!qO`N7viT;ZjkrBjr__Hyymfp)uOHsXM7hHS<xNRTP@CIKa1z0jhk|63%^I
z(Ewo2!kFn=30CY`bB7hea?0(~icTE<j&T_8wPSPmba?-W%JHM2=UnB*;@){poG%PD
z4kIo#<>Z2Y7OEas;3*RLYX!KejQ>_f2KWlF1|MVY1spv9r6|@kozA@Y^GLs~aiii1
zD71nObfL|Bcih^scpmZ??k?V$D3iPVcgy2W22B&>eYyZ(UMj(M*5KiH#29f5`aMJV
zP8=5MIRy|DzkJ<>{yTVkMI?(A^bbumzI7l!G$@2)I&U&emp!0u(U<qxCo`GjqKYo+
z!JkDBxn~_qi9io#V(I7j{1IQn38Mhs)_<pVJaF0<rUJzGr6fb-oD}Z>_-&9=mZ;+i
zCzmE7g+ag8MxkI$p2%QH9xsE0QfXKA)18;lLv36J?7^|qBU8MQ;|p!T-|O?ZTOwm(
zY8G4>x*?xcZ;`7-Z-b+|zeUn6SF@0v4r=SyqA7^-5UO*Fr&T@`Q7t2T+Nk!YIq%Yy
zQp7stCKA19{}&{z)UT7cer5%{9shW<+J3E4)umficq~P6WVL`iCl=v2A7E1@9B57c
z1?6GmEx!^$gX-%0h-Gf#L&qjQ&0)a7`<eB}_Tj%}CP#!s@yACm!>fO1EqrR$j%8v_
zKT$bD%zZ_UiP~<GR=voNUqOWLO4dClhW;=?axMoS+>Zr4xUNA#2gu*3l*&{;<IANS
z?H4W7$`KrEyT4LJp|u4Tj|lGoGE?zYIm*()Vq>0K;A~zUMVcuvWaDg1bp%GZaCgP}
zuhexHH14K}N=PiCArnM~3yme^&NiiR4iG3;a4`~gwEH~%L@3&&ZtmDSZgT<W)my<P
zu+#pTf}TXux|%;zuRks}Pd_F-LOZStTewngKHFvqfd83AW?&lF^_e@3S}z9Xb^PYP
zCKgT8m#j0j6d+bio^>ECeG1nujHyFyfr_Bj`wcv$G-ejr=RtEuT+OTawddN7Bo3Ht
zaL|-U8;*ACX@z68rlZCU-#L`bcbu}6J)bOUW%u_z{izEVf4$MCxJuwGc<<B>FDbb_
zevAK%E0HHA&kOyV>M!E8Hg&%q(UjSMbn5RT6lC@&5O@S+a8W^@KeRa90G&NbP%gX~
zQ_BpgmW%#|VqfF~)gZt{V*8p>9J0f$-)QIC@Pqq1RWCOV_Na50MCvo23Szr=lolSi
zn6d)tepOIqpeNSeCbBeur>E2eaeUA*lVLGq08fe4o)&0bl2%I93oit8tI<@tx|aEc
zw^V$ITPAdcXAT&sRyJ!}xrcof8tPr=rkgiEm>ye?WtXz<EMn6f2JcwAJ<dIe9WQM0
zs?GH-ARqiGHqk|i)!H&asbW=Ck_5|(W^!($XZw3eWBHoIU=4Iq#~nY<q!_ym#P@pL
z{7nD_xyg!!0b9QnZz%k4&12yF^u2yg=pmt!e3|T1pI?!-RbMt2-<8}b7!8L;3)fPb
zMmwK)l%<x%5m@oV;5C`5b98BXv&E!@TD+~lr#Q<3Y`L{6q|F_QV(Id;HORP$8pmp#
z%n5cAnP>d$TLUG2IsUK=``4*o`}@FwkK4MSr{*Gdv1m%2oUTD#eVoB{>(r{Q7j)r}
z@41qaIl$GoTFMnwb2%9BL6*FV2UcM<kT%!I)Lr4EHUEN*GQKJOinw#3Sq3U!(d(sF
zg^)e{%e^rltA8FTh_53qq67Dr#*BpWWq1LMWzV|8CcYV=TgtQ$@}MgS#Fqx8$DzuK
zpuqwhs2M}@+#iM(0&y<D7NvG*oX{k!Tv2JX`!LylRj**1Uh4PS<C5S{hrb|hgOhVX
ztLxkV-e8esy$BUw6l#(ZbMWMiPnt|NyPbFi>)faORB$wSTX&`8d1j!rsxVFFUN1@~
zWrgZWpwA(~+N9nHk)cU<QF#Taxf91~hA9<x$OlY&t}+il8}z6p%QApfZ$a9}#{5~w
ziYNL%fK17**fxDPVG8%Bm~o_^z9|lS89EJwY2ZKky)5#dH1Bhpy>oruv`j3%msP%X
z5F1;MY~{hnxecgHEQ<UL{ARRPL`&X!di7p3CsmG}bOK@i4<usy_@Kz}ZD8bO)`_PR
zaI<<Kg!WC0FWCowLJlYWT{J}&!u`FK$O;#dfi}{^7rkuM!Gn#8=xlt9^%~b<QZ?}l
zgB#(UP@;sbDtDBY;3cvHL3FfT=<Fy3H{dRl!N+A6IJ&Yxm``BfBp)&+pvHg;Oxg#f
zj)?zx7d&${kDE63z4Yq|KgECa!k_HcgDN*Z(dU+f9R6D3HfZF&Cdhb4Lc05^f02cj
z37@LtG=@a@vFq|4e)_NFVRc8%74Y9^fp1l1x7S~ZIka0#C(U7&5-B90$->LR5s?0#
z-vd3MOOD%U`tPLSj^{?&xMjQT8(_oI4J>Vcz{PkAFWgoHc)LG^SrN?{@A*t)Rvr({
zJ7|yapwxZImi*nnO1Hz39dc-1md07u_$pUjTMHg$cMw$dAkTX)q{cIf#2vgI<ds#^
z?qzAZ<v=*GN|#2t-Fd0Ibo48WyJWGN3qL6jJt{;`re~DHRlEh7g*9?Bwcgk`f2Tjj
zpkIE>#uUW|5G);<D%rz(>o$J`Y#fCx*<bnOR{U~RPEdxmj=jBUYwCQpRrSv*ey3Dp
zzr1(r{@G%(>e2M$_k|pmqs1g-?vjS(;Sfz+(8iB%&RA4!t}f~Kz<QIdrB)=a26Mk8
zQC%dK7<m0iIQO@JHGYhsLcL|)3!UUt$j_<(9!VP7utsWXaUGjT=lrSv^JE)KcQdKU
z004pVsU<H1rMml4o}fWQZYQ-2b=u9eo>q#O3$LGqMO}+l9;v5zfgqW}`xXBUk?XM=
zQQ@u2?5S2*23ikR_F}uxFeRZuI3^7Tf%3=vy^o`+ybKc8nsndvCAZcVIN8aG)eCzt
zLw~EsWR((MENbBn+&e41(8!SEr~!7u%YF|8Ql;?oHMYYb*h%?*`UnQ4Nq+da^B1j&
zR`75AMEswWM$day7~NzY@f`wA+#*%;VPH$4qaukOTd6rueP%sPB;(ELzuReVRhgN=
zo5!3B6@<dtG&%Uw+n{LVLE5c37o^&0P1d!HFa7)=knhPq1^D&XgCs2`_4<Ex+^7Hf
z=A?&+3tzr&KTTs^g*$A`hM*c^&_&X|%{J`%j@Hyp%aGINV_WmY_cl^!y@z=r`r{~a
z3Fgw2$*UEoWLiA!m{!d7f0zb}USAigb{ey6Bnfz{%aI0bp-0V8V5O)U8smL7I2faV
zwV_-iISZO4o2>SemSRrr|9Cpfu&AQN>mv;U0s<0(2m{g~B_$yp5;Ammih#6q$<Phb
zLkL4R(jeWP(jZ7kH^{rW_kZ6H=g|*7&x~`<*|FAdt&JwQgep22a_o<&$SP(PtnJU*
zRiBKy&(dbU!=8Vp|6<3UBdfqqQZI?WGoy3U)Zc966?W{aEYh5x5@M8ZXskPm?M+5%
zlQ7;Q`5LB8y5}qhyuxb{zSakB06x{+iKqKQY>;AcGzaqPW%`lEmnxT5pvUJfw@Y+K
zhu$aG6;{8zB(UIBBIU3$V*b)G-T@|vi8nR26fKP9#;Lhl`uUpyP_u$tpN-8-MQJeF
zc(-ELho>HGet8E;Fvu&w>Xfuua`}6Ab<df{^^v8_FtiJp^p;<4>2;4HK6el=_b!KA
zR4GU%^frmLcqp9B?%2ayE3jX?MJ+fEAx5U9zOZIK`hv#CY@5>>MXXw$S5RT@r4wu-
zZ>ZH#pfh#QzHWkH`^079H8bmg%9$=A@c0c%3O-sFL-)w7b;~0LMmLX5i2fgzfeuX?
zQ@*zcKvsBR+myK}^t|3?<OX3k8SgW~m!*6BI6efe$d@p4D|Bv~=QOeEfX(ZC_K!g^
zrS0u^3tQ&{Fb{}>f5@_}T34g}c1a@Qb9t(sz0M*AGfv&FYRc+{3e%6LllOxMIeIgS
zUHR`#C#EU>)}7%B={$)?`%wJ#xn1EaJn6=k>N;JQorEk8#9YOBoaRmNOn>&4U&dp_
zz%}2>!zjJDImhe;Ksg9Aw(3n?SUFEPt}+p%(NpYaX&Ao+?*rbBFcc{gS?B?kB2=zT
zEbui+IGpO7yN|20EG&rlj=BUh)UXvKK7uD#z4<c!iUVAaE+aa_H1ZR)x&SEQ4=&^^
zhCg4kE$qJWDe9b-j=Yu+k7dowR2!ZiFmM%0ee<z9Nj_@7@x<czv-jc+zKcGEk^J@>
zohX8_I)n1M({JgiPs5W>%ic8X&LEGag2j}I2iun9-yiF*PQrVKhp>X>ru&DnPYoqa
zj1AQ*7(eb@$dgQ81k!a6T#pM0APAg?aVF>d1{u1uS~UP7#H7~QbK3ldOKyvo@y&W4
zv(<B;r~-Uo#1K4EeK}b!wR1rA8N5Hf7jO#*vjEhSr_uE15zDm)?H{O?hD#dX@?|Di
zcALNeAT6?9`6DO`-GYx31(95nm8SBm;Vl;L+E}wa9<TqyU2k-9inVvSe+Br`2gcNw
zh0D`&%jOff<ZgVnx{Gc9AiBD~aI%W&)xp#LK*L+tQrmeXz%A--VP|(=Y+ZjQ=QPW*
zbicPZ?)8UJU0_0r$L;N*u1O=3<dUzkdDbwDHsh_wTd<6)yX6fk@^vg+M^M0EF#;9j
zf(M-Fcj5HnyxKM6KdAd=wxE2M@5Y*)lRC(t$(&`qOhDRsc5=g0BqQX!@oWB~2$|V}
z_sq;@a4o^AWqBt`cOho(dRK75P`#)o+x9}a95unvr2^afomNcFdE5mL0Xs67nbR5z
zF09Cy_FpaVzey$UWeT%(QK>2d1G1P4J_C~#u+1CGU0Opoi4(+6AG<|#F{%1ieu|zi
z=whD8V%>6)24?6EEoW7)9B)?zhWCJ%aM1iV^P%p#d%l(+w%~pP9hRJE3RurTKIxnK
zfzxJMsz2L-FP<b<X2&!=CH3{$7cy&)rubk}U|aYk8L)gFCentfhYS_P^}jsYlUBW#
zm$yP{Ra-k0Zq;oV;i4(YauQP+*e~pObo39Cu=_%YmrB(9@Sx=f!#iPsn&q|UE4>hY
z0t8YVr5DXeqEbXJ=1y*qd_$}5F_6kVZCpI&<eiL^$m1^$ea_z<UUtbT3!Cs-sE8dm
z6MoB=;6yLGouuHk7o$@v6H&3(Ab7to_z33B=REFP92MQ17jodvDy9F=3MpuQsdwO~
zUuDQapIq~Hu_j7QKJy1Ny^1&9@3l51#Bpb@Ga&4b$5fxwg{xPD)9C`A1lRSAFh1M$
zuO~{3@jJa0Vv{?NZEt4HW68?o{GfM5kTi)H<&NIU59EIZ`RK*$!_LDL>(?m6uyz3J
z6KryEpWkS&I7Sb%bIZb=BK*BDO>9;mpsY6_7)pE5(sG)?f`JCJ`Ho%teGI+UxBz>P
zX_AeZU&Y@F%fv_e$cv`{VUzG(8!Hg;2Z&E0yVXqpqbUMz=v#9XG>KSvrj9ihT+3YO
zq<S?&zuYvyxq0%RWR-6gMAm<d6sjk;T3@jztO~Fe5%$#n?olM6GQtDBP6zX!qt0k9
zUy?T=el2n5XUuEK18Vj8A)Bz7=f1zZ30%lD4CH)#_S0*a{!tYhNTomayxX~;cPrKB
zt+UL_+COV~hlA)JpvLqm`WIO#Zui?J-#s-^KNYYxo4FT?8U4JcXi6l0(HvBZXGQ!k
zZD}+ef%pF(pLK)<+1sVU##x<WnB0MVA{!Eu^Q7MQkFnIN3>9K_m~}*+9!^4FEQ2<O
zTo+m|K%w;`lTUy61N`-Gi3rJ?4pB>mdXAC<S-HCerrC7@sXMzp_{Ru}oWc@gXNy&a
z$v!X7JCfTH#Pw4hvJiN1M&;h;aTY7oN?XAZ_6&PeS$Kb=r-Z{4?&gx1JULJQj|MJA
zvgiJgiqI2dX*>KSp6`d184}?fOAWkzH$1<ciEsYKNZD{ta0`B)yO#~nrSlhq7xW}Z
zsEENWrF~`z1QkCqQPlH(^W&|?hP)!7rN5_m&<J%M%~mC>Yf#Ek{z}T~^T2Bfd!M%>
zaGs)Mmk8zK@ry(qlm+IP=o9Wek(Kn3R$aKzq+9B8UR_yi-4K|?mM1bf*SP7u7U<u#
z(_{ZvLm4#j*2$Y5)AgpocyHWL)QBSMxdOx(qLSSzvLA?BtR2mO927-V)N)*@M*b=M
zEX30gKOw7(zpQBVRaQYt>;zQ)9YGdC-|(6;(UdW!`fzCiM$z4NvR%D?7W^dw9rq)Z
z%&(K=w@Y4i!Q_NgV$~ir)w>$(tT&4ui&j1~?SZHqZUm+DmJ7-&Xo41F0X!~=fo^#z
z0zN7^<RmVUu>z&x+Dz`{PRE~(jPj+qp30HdEo(}={^2{1rW~5%O#P?rm8=xeADkI7
z78>({y}cCRQG~pDlFn9_*&Y`%jEX<JPy~zgXpKovFm3PZO&m!ZloSuGO&s06hjP6v
zaX2x5H&(CpN;aps$-qKYznL52P%`W{enImx(u^1@RZlIiZT9Z7sWDfz%!=*1CdtKH
z(Tw}gq-Qr)KN9G|ATT7yN}0~zGSls;QCOxu?7SxLLut6e=2u<}FnN%r9&xn>H!m3Y
z{f|sr=&czeG!7hdnq--LyS=v*heqsL@s&WT)PCpJf+6L89UYQBNewibBST@<m$L8c
z@ROzTN@arYlt<=bTvbvpUh)>rJ{>&qUdXQ^_PhKdNewxpGPW+L*rP$AgnUq}Tx{P;
zaS|ILZb>3$6(qBSN?w}Ms4Jop(Y#sWH#3SOxh5ZagIJ{hOj%(QO}ui{`#)j~4e82u
zET4;Lp_Z#NjHXJ)^7ARMiaR2TI{Z!`h91a|(2O=ZdgJ;920+%JpxnzwH|^|f8lTZp
z`Emvke{Oe3YYw5{js?DC?3fzdGFx>?!1Sy%6}F9^WAY%o)wii7&IU;1moPCdH_H8h
z66=GBI46&d$$lUAXANC}?&m$<&snyIUz5jB`n6tD5SXE+mbcQ4WO7T6epojfKzyZ%
z%A<P4j*x+Gw-a{J19-O@PLJ6}$&1s8F?j!nOy}^Q#nwh0t5x;r9-L5;y79eQunxvu
zxBq)N3BU00Qq4UK*tSf$1XOl?`pgJxC)w(rxar^QT`L*s$BbnUs_@J!9;E-Wyu2#5
zCdyyUNPp;i<UA$iR=Y9G{9tzf4K6p`;;I#kAtzL<scTALLQKg571A31p+CVnPWqTy
zt4FI<2g=)jPN*vFr+oH_wf*!fJm^l*PBcsIPAx%cw=%q;)p?2!n)iL0%F?`v7>=1m
z#9a<Jz9ghLL&TF0#J-~@61N<oGy#ojMq3p$?doUF>SKqE6LqyF&56ZwC&$jzLi*F*
z$GTfvbBU!9&9YhZ4NgvC*WV2cOu4{%gapZOr1r&=+b`F0cJMcEnhJVp@W~rrK7H4L
zc}X}k$kOfc&3AMbn$XeJHj}|~dqfQY5W4Ty3dzt@!_b^9NKd~UcVhuprVP;|R0$PM
zhjUkXS|OrACS<L|#JAE@9lFw_TCn*Vj;Aa~sCF_$CSQlvwVGZJ^<?Ag4w^{x$K9Y~
ztJ=sL6<18i6xLB`i74jSex{D6R<$j(kR?z#H*I(Sr(aVq6sJ%X29@Ac<f19e{bZ!1
zat_~6PG?&P>nMh!g{}cmH6f{=X_(Xza(_P;A`QOD1p!0v4-Isu-T6JCHK%4I)N~Vc
z0|YWTn9ALU-2zn{78?A895YOdFP>u3HaU?HH%s7rtgwd#R@iONzai+vTt7=kQ<=<y
z6v;n0p1PRtKyQtxuuAo&(^izb{acKLf}-#W2?s5M)npwbBE2M(h(`{?SM&6&WK^}K
z?4>7~E}ZI>A7?D@K592-pUd>6X^ih;bubzg@7z~=$1f>0s$i6fOB-3Rs3#=ELb?&2
z0vMGiaV;^dnUOK4q_*<7t5>|$-xC>-&BkRX&vd8#-oBsM;e1lPtY7#;KXd2V&Vl#h
zF<eQ@OO;Rx+~Vq?Z+aVBEH4-;??hKcmRm|&zPN%LYrknzH-^tHP>C5IL0JW(0<oPQ
z_o(#}n{^seKx=J2S7Xg%P`vo&=ESRX{E!Ngc4>auY7h~kXItd4hp;{-u6@$3Bigi7
z-tcG#22yPa2Fc-UJv-|b!xt8U$g39?N{^q-Ht>f*>)qR))y&Q64EvYtv-LCbTz^M@
zKlZs*Eq#dhw<jdeNsRE+*5k30Ld49^-~_WZ@ppX(q_o{6w_j2@O*_@6maYZG&qi*4
z5Cd%Nbri?jo5QdDck&a1qlG4<%oufa18N!{Vz>P^IYeEk+?VrmM24_vt6<K`--lA!
z%`Ot8G|E=NkomB%Nh1Qc7loZXd1GD){${@+oPlkx&tq--%e;bLhky_GMO$!fu<1gW
z7`o5YxkN;_C;8}LwM`Kcob-QHBsG7t_4$`TB8nR{%i-H9)hP^gF``<exT1w#CJVuE
znw|j`USj<5w@m__$fb%~YDG^vdGT73{v|@fvDFi1*Gmt+Q(qyh^IkIS<Zj_zY%0BP
zCH6V_^{f9N*RV0pb*LcvC9|Ss-TMu4m2G>|GDQl~!`E<F&7!1edtwRV?zFO$+_Vy+
zQWd{bhsRr=Lla>ae*`B@U-f%^*Qt0HWUU$gM&HqF=iH}6Q<p@0&UI@9-OC*k-f&r>
znHG@_G!}!Cn}V!{V)m}_rD|20l!Nd6cAW5nX4rGHPmNmm?9EI=@|NHAcZ=#DF_;l2
zots;K_y+yu*`tIb;Qy0Q4b9#aB))9n!oMd<<>lXdvlLl|8W(Q`&q)TcX)>J*;WAvP
zzAnO4lg28N%Z>*zu`gLdfk|4D)VAgzUlA=?l?29|A*OQhZQ^UkTkvwP%(Ep_T2n*7
z4kC@g!);*B6{Yt&VK0AMFEReBF^&*Dpc+o>25@D)KWf2eYZ`PtFif}95;{^7Gh;cp
ziY&$8Z(OdQaf0jQMi2x0%ALKa#pJ`ds_*v*-fwWG!>pOF=Orj;KeU(QQ2pSfD#hXo
z>Gjy_7T(07zc*f&n@h8}?Z%h~R^J-zH(~Uj#W7TF(oVMm+M`u^IjlWXXNJDsOmQtz
zXGOc!+A6lp012!MgM_VC1h)l*oxF|S%@vUbFsTmj9?!HfZTE(g9v>+az%`Q`c3Ueh
zOQE%KJuK79Bb*i_CDH7=(w2hZbTBzY^Id+#j7{*r5W2Q+C1IgIdHh`24zI^faC%FL
zKkmFBXdZx_7tj@nN1**ZxcysyH;L1lK_N$a=E+BF3A_3SCd*m8`fInbSV?i8OZhT6
zlyNY9Ny!s|tnnD<vnInye9AenOhSo{la7ck{v((6gR>Vaj_?(mbwfR)iW-BFkj2J_
zykjkSQk?-NZ;GepUJG8f?J&5+-`{@5`OmAuZiijM08=YQU(LHn3)5gN{iti9e#E`S
zSR@$NgbJ;)Q%6g9{QXtSx*s6WBEtx~1x%!&HB1oMTGl<;9El37eEn2(3T0B<jIfHi
zC@Pf=JN;*=*Rh5tZN)SRqIRw0r8+R*cL$ZZ8#wt^zhxN4N|>HN-^sk2k+6#oRN*2d
zx7Dnp!TI7wgSo&98T;Yr5iV<K*B0nkQ5$2kZu(R3yE%I}a~yK^PXyh+M0{?QUftyn
zn1+mq$}@r3koR@zCPil7^d5)pCi&QFeNZC<B{kkXj5E1;6(X+7y0hzMUUS!3C6CgE
zJQf-p2YlxZ6OW@(j}o$yJb(5p-!*xv#A0M5os*>WXmUi^D1Ly;Xm<1xs`<}#F>zeV
zd5)X5zzMtQ6QI_a2*jr*mk3hZQMhc)*Xx(Hff`XCI7+()$7{L1gD_36$Z~*RL{XCY
zzckloZa?~G$&6~_2<z_Y;UgY*y2NPtbTqr33KmTjd?~y8F<-V30>O*<o4e1SLqY`1
zZfkKP)+M!qt=pec%VIl_)4h-S>*d5D9lZ(p%q^^nAI57fkU=nvgLVGV2Q6~X<6X3s
z?nHv*#m?|pX^^C>c)B)2wwH2Rrt`gB_H0Cw5%_;!P^Wp1y%f6WEx0|;uwx&&x4>dr
zO~|qSQzHF^R8jkFw0dIpj%^X5B_P?uK*3ECYpv}#SGAN9bIY--Gvr%5P7h9g;^g*`
zv5N}sOXlv=#<_6n0UBp?a%G7HAgB-v3I`PBRigT|GD(7lMXFzf*sMroDouvJ?z;dE
z^u*WE{VSm)oO`1G`9;H9aq^D8l4OiqjfHM%2bJZhP_dtdJ#t)a9$xHwjF>snL_kDG
zbA8bRcxnL8BUV~!9c<PyaCKs}rwksO28M_e*)%?_Qy6Mwr~kJas?P&WH{~~=)P@S@
z-DQ*KM7~6R-BUa4jbwJjS=vf@mpzJS(X9p6kS>j7v<`i1=M+^ut{k*nGNdNLzo451
za)h3VMBd>u6I4~-ec7$69QA%#d`(B8P!Be?fXJ(N_EC_1aQ>&qTlZXa<z_6u2lb%(
z*@rviX8paE!>0A+WP}@~ZC_E%k(};6=5spOqRqIkrZx3cq5vPK!7ug&!ra!(F3G2F
zze=CqiruAR+>F=eLETg$hAoi^A5`UEVe=hQF20WZ5gDDeFYBno$+XmhxW)V6=D4TE
zQ(+$tW>S<D#!k5Eky<v3DcuexCYW2l2T6^;m+uc-2lnl7-x}Gw$c;NwInt7s8()#U
zeHPZcg8(CoR@QSmU2|mqCF?n{ZXLX!a3)AGwfc;2+Np!Nr1G)PXPGk6Hi7T?FkR+Z
zl=8wd1@ZV|&rMQDn5b9>>s3XtW}h(&SN~SIy@s?|=Q#+W1kLnl)fo7Sj2m~Y`BTp?
zt6|Y9^NxCWA2n6>$dze%NA5FMiffpB_u-@tgN&<tCBKVSs@QCdc)=+{{%ZIi9*C>Y
zMY-93(TsV5-e)VD1GS96wW(toVv3cfumPDD)MVRFU|oQ&|Dix6>!2hs1g`D7TxD4W
z<2y_8yeDHhnYWz&Ox*G{HjPQAgW!d)5{U^{{#EjK-TR+N%#yZUU+0~0pV!eCKTQ?v
z&ytIC;0*{uM?92O79R&W8?aU{M{ikupfmO?HVLdCuHLs4ejhpr7thH(zcqA;X~r11
z?vI2RQLH8~5b6eUb!ZBi%f{`qsxhdb!fX?rBhSQXRUk_@r>DN8He{mT%)7Ihup2%~
zs#=pTRqbzryfen(_L9h8=vqRU*H4SBUe2A_WfiuPQ-J1YeJ?=_u1wd+nw>g%yH?ce
zu<Wyv@J1}Tl(6As=s}=p3FYW7d7r{ojBUBxrf1dKu}hTIUaBvVKBYi@4Y%wf_`Hnl
zT(?f3O3oWq?T-E~)OhiE<*W=2Vb`CTq%tfD;<L(PB=`(pv|hzhhWi$DX2-F121S-8
zDm1-9PPeL9C@Z;OH`_WV;ssH)T+dIS&OXKINAD<>QIOd%?Kn?4nlHN^WQvId-o<}P
z0UpA*9jd(Z9{~$*+^h<J<FVtj2DbZ{)H*puU*W{3E8j}z#Bq(GXM7&4C{#@VLw6&V
z(T+sSbuxYG3^6Aa_U}DUr6(2?wG<Tce;Q94cI-UyPa!rDz~wj|2iI;=Y5~30>m~d9
z+as}9ygFW$q3{fQ{jP83?@I1}-qmin7`lJK<5Fg$gNjU>r^>eR)R#$&spImd=grZ>
zhCcPjNM<dqFtUKNEYzrqRtO|%AmL=(RRy_hieZCmFIw+@6M_Jya*aU97C>Cuhfs`&
zR6@r9Jw+nQsn(1g_4n@Q?S0D0fEg=yZW^scMRD2eJ(SP%G5jKqqhG$Ge?f!wJu|T_
zG3Rk_kTejzEt(7zpY@RnIX;WKFXi$Ow%OhMX{SC;C>_fgDKWN3tGsw>hx<(4(s-m~
zxB2<QI*UR0!sgQK1qRY{U<}p+{`(QNws;4odjbbhcHV+w2%pYqpD}k_<}$X?<S|vF
z3phXn7c<A4IDtcbh}#a_C|+aUNy4tY=G8C4`mV2DGqoj_=yXm>`;Gq4tEm4Z`XlN~
ziI)%9mO?ra8zqrVrF}cpaSX@>L_Om%5}c>bL>povI<h&^Qdf)StTG^$JLUp@CYvZ(
z<$9{_*I@yE!-1!^8R!3ckjoL`B`NErQ(fePXS3&{$CvIBoFobwF9wTPs{EjT8(H5)
zFg7{fhG|SMU>DjUAAFhEom7`{cUk(dQsSSHIUhW^924)4AuQi7i#x=it%ye`S@x|g
zV%kA2R<a`w!)N6@SIuS3jI>4??Ai)Q$p$!(yY}de7h!M<hXGv4zW(KwEp4PJY{xrF
z*-@LTwtY0llWPLox&7Z$DJMmK#KUQj>5I+;CM<ylDkId_IYhMKfovPrqcx`80fbWK
z#C|(VFijVgh_qKN%5+Z@H7$Cjo|u%+bv3XM%iFsxb$M*oE^9t_r4aovF7wJyt83PH
z8LTvvS23SJLPcRY7k3_XDj<s?F<Fxf6MxFvs7Y-3(rxgJd}7AUSor#idz$z0KI0tJ
zFR%jpY3U{U`LClmq%Z9eyz`eT)Vy&qqdd?VC3zy@km1BoLZ}2m0lg8giLv}W-&v4Z
zj()HKR)usp5aw)r_faT7OAE-X6)|7D=-n$#TyQ99X{pk@5t=g3q86r5H@6}3p%VCA
zUFh61)<MBfj6(VEFHcuRL8XOa*BWM7&Cgx=x(&sdi&@fF9mAfe9V@=*jm|GHYb5XZ
zf=#L}DXW>J$9_;lzCs*t?UY=u9G?~_{apVz5W@QC0s%YyHC<^%jq};^5D9a{^&k4q
zPf#Pniq!V(-+I|m=}(JCnDT0K4P)IapXA~sskvPQX#cG78|CnVG!21d<DomxNePY@
zoeHE{?W}k;YV}XfvyCV{kg-NGRc+-)y;xR{_J{OU%ILc@gZM8z<bNQ?_+80h*$*$h
zhmMgzP!d5UDn^RM<~_J!rDcdS$fOPO(kl=B6XH`+&9<zRluEN`n6hvTwsJ*GT4g)U
z8tDK$s3?hIenn)#f=pB0_JpN&z<2BbQBBwyK^JY~Qgo)Y^noXBu)#U|8;|8O6b2bM
z-!2O}HaMC5E!YGqf9$S{(Yd2+B3vU?8H@^{^)RFzIrq9ECm&^;A&OG^K|j>>+Sj-x
zh4}fJLL=|ITT2^l_(M?ct!qrDSQRpFm2oJX(tL?&2i+B=E!oPT&96~ktHEGE%AN87
zh!ZtSP(IGu^n2|28mekD@(o09iq4g9OtC&C^hSi>GRKLM;xSyXAv@Ics(*!}p_EZs
zsi}}>h|7)cFxk6NX~7HTx(p2l4_47gG~Xk%-irsI_`&}iIi+R}oM=?pS7(YQlbO+v
zp(`VXmvNb^tm7M~*F!sE-*q%9*|natA%tJ4sGYh({Dkwo(eO)A^rxwMz2Di0V4Xc)
zkT~l6)E_4qmS6dk_ax_WoRma~VeeVG*`M2mnIMonNcdIoIyZl*NOeCWS_%5%p{^lw
zCLxZx`*pZWJM7HxxKR!FV9JEgME`OTC{3c~leR7uc+Mt_v#v3aPZpx{8C|41M59C=
z-d2nVyWbb1Rk@bl7n6cTGzX$*pG<k&cn7x6nAOZk?$`Xi_*IHMGGaM0s;qSp{lhFf
z&++N@Dwfp!Zwv=o5pq9;WB-ux>+x~ZAS5alZN|D!h#@d+=lo_>p{)8upHT?{U+{vd
zVTEd{a3k@npo)7=ODIPj%A{iN7RXh>UA4wC9K9^e?{}mm3L?ycLLKk(ZJ3qq<Qr#9
zX^XbEnNupkYpFq0w}lr~RTEVUNjU5#edLW6GlY-Q<vz`?j4HNQP@_BatK!J{ZNLx_
zSH04WiX>4g0!gPFDruMES~6c@fL+Ek5E*xDD6im*OHBaHTxevI1}4q(maQ5j?4x&}
zu7ne_+Rl>MGENdDLqU$*j-<F$)~9Q&-f%F#rTnyA=c^Vvm#2|bq9ugw`Td34=Y!Of
zEzn*>hSUZ$<xU_{Q8r<)lOiR5>Y9nVPx2xem_raj0JyXlk_3GY+6q>)F?<9`d&K-6
zfg#VaPd=Q(F`7S`l__n^ZL1ryU8AhrXLqu*Hw%t9j^swn4j=m&kJ?V4-{mV_Xuma~
znD?_?t;yq3eEWhSyc}9OaZ|k|(T=9OMGnQ4`|Y~&7R9J9Dv8omeayJKsak@ixfm|j
zUS&VVEdA&f$9d7db2%Uqt;{uwL%U-Oi-)m&hUG05tt>oaoimz)mlzGKEVdqVyLIpk
z(ZYN)#cW<5#8a!NcF15PXAL2ci6<Tz$Vd$AHoX?KQ(AQepaFmFfN?*Ml_<59;Mr_6
z0}}&$9oOc&uvy{KFS<DkAl5%t&#e(aPh>z))_hGM)o}|Pd#vs<DE|xbB2`a!I;m!{
z_)mYJsxcx1CadubByjBlyge4s1&Y14>;&oGT?B1C!CD6%<!2&TNc+P}`3aCG<d^T5
zXA(l;=ukVf2)YH7fyZY0HtSBD6eddhs7Ta<y4r9V9l2Hwlt+UFPh4_kD9Gkb$J!tG
zVWnaOOEO)=yaF!KCe9#Xn#j5R;pIP(NBHED(6MnGp#Ms;r$`Zl2Ljwq5CzDqR%+6;
z4aLG*2dx9IHPu*+)M$Gd*s*ftVjsw1H`9@WN4?<(i+mv`6puDckZSE@I4o4oXA>#J
zor}%97!%K~=x9;XEd{2y9S5i9=Y&Dg8Xc>ya?>`G&A%VMbK%NQ;RQT5ikLYX4Fmyn
z5$8f5I8rr(BAQ!X|7jpzT^o`77Ca=EvOq1n=PLgJwUs9t?Rmal5<1<G>qiCMjslPh
zu37FqXC7ba><=;_({UD<dYM)J^IIuRfv7Z8-tttlP^`(r3TE%!cnLN%O@He@G8pd^
z+EpKY2|{;vi*N_UJblUu+J*i$ZxU$Fgx~!3mv8_Xng@H9*=PU%%tU%$xN*n{uHPv7
zhtCpR$=a{^G%bLlAgbvFO6PEGEfk^^y>M7(G-7A5xlJ0}%wS#2Rm%yj_E6{H&^B0c
z=k@P6NELr=;E(>ga!5?4e(P?j4xvJWKv$^_wjH+K0P9$V$#7FGUXV1AAB|u^yWD<4
zSpZ*B9hN59^zy2O>6DALCoa!3e?$SDq`7B1_HuX6q*qaVzZQ?=eWY2zJ9=-@CkOx1
zeHm&U96!xRd0=Fek@B7Fo+*(-fXAJ}LC3#nqx!k5@A=}a0{w$ItV#oWFlX_WPv&)3
zi^Cz*FcN2DhzREB=-3KK!vgeP%P=IDfZ?g6v57q)zT^T<i;>xn)4CiHNok+?*=<J9
zY;z8{W?}ZeXHeFv!VkDrkDX_Bs;eEA&jgv>M0}P(Lr(N<B!TYGYt_mxSGTs0wrG~B
zc)93ZM6?#OTMvHGF#-irh9-0k02xCD?>b~&3*J`xphufc6+6&t>C7)Qp%V9c)BbzU
zWTg)UMG6BWXGBPiGx1$`{;$8Ss~CN(E0&c@>BQ3bLR()#SFrCL#;cDBV4}LDzd94p
z;@yV#YW$-vxU~`vAdQD!N5(K=Q{}291OI5CVLJPu>qroYz9$MzIRSdz`(|F&gy7P@
zI5R$}Dr@9(a^}@|pzsf#1;$=e=nuTYsCFbuS(9)E&{J3XJ@vZd^>mOhBgy&YW~$<7
z6~uOiKgMyLKFgr%<fF4i?1&#~rOEHPn=|3;PjjU@9e0y3=F&f+F7I`a<vL_^`tSdQ
zmFT*D*}jF-jJDzS+E!B?P-rBCEO=6@gfoWpAg|(}B6YE>-RkNuH^3@hb#j$ArP1Xz
zu>0O}xhw2(hOMqHwxVPyQ!iC8VqJgUZy1wus_rvJy{Ww?VoTLAm29HIwEsOazQoO^
z3J^0pJ%6x*5gB1p_Y0$N_}~+3ufeY9a5lbHG4??u<l%ZK&RDLqd#80S7)(!t3|`QP
zp8~BrF~Y4OFQ1A$<ecn;PFL)=<|NnBVwAQ_kj#gl4EPf9+6)B6gym?|%De(;wtp-Q
zie6fig=`b(rYX9qRyh?zIi`ek`F>R((-1gD8`^HMNJ>uVk7~Qwz|B`GY*Qp(DdUpB
z9SiaBLjsbYJq~U<kB2okk+97~8aH8+dDF6AE&<YiDhQI%kw5pZ<`!{vkUrHn1@&>>
zA8v&AyyLhD<=nLV5z9GPZi~ma$|kls-<uMP<dpo18SmHlm%-j}dEme%DXaGAOV>?C
z3fZsUdt9Yk-wH>=AJ4p0&vN5(BL;*8cm2>=B$<M~{kib=n{joAdq9_{9X0`Tl3dpU
z)Ip}J-{DpG#?_r?$T%ZW8kv*$v3%_{={~TvGx^}qkbl#*T+LL}t2#;ghED)}*Mu{U
zctGKUhVO1;q+LbUH^za)q_ez_>;)I|>8WwQ{+>BQ=18!-XAdlRp7<XATD9*ru`Ys_
z?las{G5M;$<n7<Ee|zX~;Vu83HJ;<x_3Kb5{gGP7oANK8v@C_qAFC5-b@7Mwukj9I
zFAT!<_~tDmUC0mtz!D(%mC*=cw#l8)%=^+;iQ^wOWpZ<WdTHs48nt)jWvjn09rD@8
zOg50PQ)fDmi_kBe8(C}aQM8$}t&hP(F?@#kH`Z62<_%i6Z9l$8z0bc0G*1^0CUPK9
zO7mjopH{TIVkD~vX&kzex)OQ0z!-@!|2fHj5m?xqYg4ZR2@2SmD^1JZQ$kl0xO$#H
zSr}MpPyD7{2=fStat_C`Uuc2Nwu})J)9%;`SVZB;s~r4F-f$XZ@J2Cx-<DgXvum){
z;*^=f2raZ{CeJ0Xq)v<JR;XtcqjTHW&XL9VZq*v9Z}YI2{d1)9-+qz&G0&Q@?kH@Q
zMHJX;P8~l(;#X5r+c--NoZR~MIq7{3`9;04W9|<yDt-o7F7$uT;D{hZ^2WIPC~WiY
z>@zjXW1$$|CzPwC*Mj|TJM{R7tqYt;f=)vBi;c~n6?MzupjWt0y6Djx+flmM1}Elq
z%e{pLv@u%^OMg)AQX8i8D$NL+ex>}vcjS*Y={!lQVoeqGL&^_30hc*!%upM9NF9&z
z$r$!zi+1_eNYxEweLe$pI;ryimG{I<U_fuqkQ;qQ49V;<h)RuBVkZ#8eT*Jr+}viz
zEuG4OM_3zD)EB+_AhW%d{~P{N8aX!306%}k|8XzRfa;fJ-H>T&x3fRr%!*+vb8jWH
zSh_!;F^{+N^NG%JR4#Xzht_8?7^Q)pmwV6U6kro(_s2jXc^`RW5~V)l<<d#2Qgh>5
zKW|cb>Z{bvqRqMsTz0x3kGCG(aW~(k+Rj;!(LkVT^b=|`F<y*1ojO{?H+0f?j`tw$
z(tZ+Ra6VFhkuK{^g|A;dnP{(ZCN%q2K|G?44u%At49yyDLD$$^<;s06)zcYZFiy!=
z#j5G}V-xk5fuY#wVp?49cyxHC8v1MAZRwr-h0900&3$(-wV}^+Zj>4XzyPSRT`VQ0
zP$zkRQA26<wuwTNDv(V0OvK^vuR$l^2C=`w&lz`k-mi&M<lE2~<eaBOdM7*;1T>xl
z;6ITWP)nyTh<H<OjCcq!&)98)y9lKo>qKJ5%OZyRt5CmB4aV5HBlVw;M}9<*JHBYD
zqpi%zq4ces&7_j23{cqw#21gG0&6C+40aKM@+N{*<^_&Qu|ICpHqQ=JZSHFHwn#h(
zmaJXh9DGG_cyd;6wVcnFGi5&Yuu&PK4<jfrTJP$`9QG$}$*rObw`qXU>zY?iyS#eP
zPL4pMZ5z-ySAczMI5obb5Yy}i938)^dc(b&<NFs2_ZC<8GcNHW>%aXVnVaUJtAkf&
z0S@P1UmZ=xIOSxfAN;Jp4+D(t3y}8sPAb$fi%QgJWF@X=K0x@mELcCA3x4TSyeGk>
zu3n*N6ai01)0~pF$g99eyx9nOTmm%>BYP`g#u=Lz9FSSoX{D&~vR|S@Mj!aco$)E=
z<&Uob?30)jqGBoTdH#kgmh5w?*orq&OTS(?19HmIboMV2S=HfROyKu$w*08|;Z`Zg
z7^z*TI+-g4BAd!ld(;$yt>sQ@{FT(o)OVyYayQua0}$Y;LX9c$mhQrkuqExi6V*FE
z-R&l8d~GT)QLva{Hre7VbTpPF^0U1&sfCbqPHh^V?D*p=c}v%3;Hd8fJW{ubn<?p?
zmMb&W#CjyJBJBD5u2d1>K;)u#HcU$>m8!R4kbcp-H6i68?i+|JYQMuQ6H%f*Hdr<M
zt0u2Z$OR%Hhi<>~WQ!T$MGEl8PnQ`pJa0cz{bs}R8fp-Y47#RkB4M#Q9ZpE@RrEFp
z$chaC25^w@g7+`4VmlF?cd0B=Z8Dazrg;hBe+Ttc<GIw$0%eF;CkedHR|&4}ng{v=
zRnnCrJ}(MIOF}{c_V2Iqf{8!~^u;_fjcDb20%0>kt=vnq2sBo`d+3D20hvCB)0XAl
zgGMJ4LQ4H&&2k#t$}p4xF2~C|qBpFJBO(pp{VMJ3k3|{csC<4_>)drwmBPxl{l#7<
zxS>|i;TfZ#j3&kDuG%nyCi_d%P7O40%=`qg1P&|U4V@s>_9vwcUoxh&$-sDhCQAHE
z1>Re{hEn&6&dL*wZV!aKi2y1kfRlNO^-wg*B`ECQn$L`-Hc!N4ZSsOvMa@!OMXW;x
zxC~ldw>-fNl}%~64xmcQ5L9V7M7^W1Yl=1^e*VL|a62RfA%{-~%joAqk*el_*fFX7
z%-Zd8YI$I`JJY+&MZ$6wi+s5`a7=9|_iMiE^Mmv`ph1h|@&3*JxsL!UO6lp<e5IqE
zG-)Sp+RZwolhBw@3au)P<h(^4rA|}^Q^s3}_#k1ogIebTp1YyJlTuX>I97CAkz$o<
zms?VmtAdr|e_^kwr8lI;)R;J?BxEs%oZGs7`}fk*LxP|Ui$HRI4w#=~D?G~dc1_Dg
zY>00v3egPbeapHV=7p`i1?+=1oWZ0jsPm6z)WOT!lbs^bwa91TWYH9h8^PpG)&<7B
z49*P>kn4e%vmT}v`K`fK0xsM3Um9)r4|J`ACDFQG$VmTGwwuAz4ooDFu$)f#V;>7u
z1HoSYGxh9*z>4>N2@)|YH_^J$4BEO2Dx`mLnTtY-%J$jPuqaj$<mnZT>6tY}G#}-t
zgkR^Br&#Mnv%1%8SX|v!s@gEe@E1vR-;G^taZVKf5MWdn9)<nT{qbf%;Ny?%uO3D3
zeip+q<cXU1;0b5+P5gzR)3h?I;wp;DmR>8W@ciX7hSn$n6nlQpS4%gOL>E=_mg`qv
zlM7(1Iw$5EkGh0v8pg;fT5N~@{_)70sf`ST4H*mi40;}2`qd#Z$o;Y`lSSv@$hS%7
z`@I5!;3y1&mx&COsEgLmEw74ev}RZaUc)MIb`mLWUGQQhC^`}ESQ@vp5!%5y^bI8H
zQP#&E#8{<gAD4{-QeYCc>Tq>jg6qaz6E(t33$}gM>yzT;oGQ#M=b(19J7Mnfen@*?
z@(UTA#+~3#-f(HcW+pnxnT|Dbut14qC=%50&rqpIh5E~Cca3)Ufq9ZDM4IUAZ4}2x
zO|8Lo71gmS2v+~gEoZZ5kpff2Cq5u_b+s!K=$6eOt2X;+SM*1kq$m2m7bKiT3=Q`B
zJ@2K6`!)`eBoUCe?^Uh8z6A}zhTyNU6y0F;hb_<)wSObRKL#;E6*praUVPcq?IqY4
zV`%<I0x*c}G8)hcm#3g5kS6gCmK|B&jrxd1wmO&toT5jn!Y*jxc^PjR1JTA%mc6sv
zCH&P=x>x<Fy%nrSGCimJn;6WA_x~X(>XyUMIn_O^yOMpCF++#RQFyP;C>S^MUP3zx
z=$s*gPkv>fo+vCxR75;uVlf(Tdq&LJtlApUtW^`{j4ym#u=e80bHK@s@<ia3Y<OrT
z!L!I43ZVw}Qd51tlVLpk7dYm_?5`Ohq1CHP<t~I$S-r5=)SwFWN9_7^O(;cMLkri5
zJ$js;sZ`7^L|RjgK<dH^$KlkraDI%bqkx!eF|1<`e%_7PKVBN4kUM~WD^#3X(qb0f
z8uFu;nU^K1S-v;L{Z^Oau5{8?TWu*AMpc&VW=O2I9Sn789_R??5HavH<tdt_hlyxb
zOIu)mc8SCQ-+~$@s-AB&ahRl=vKGtyj<%f)Mh;EkU``$Mf_GYsPgz+NA>$4|{A#sq
z?Vx{*s({7u-Y=Yi@S#%T@GTS^CNfG$OAcA|t#3e>Ghb1Htz`HsJ}LDr*ATOkFpX=i
z95b&VoLb_BP`^3JteRqYP!gFM%2Zu;(+gqw%C2}wP+&}$khJ6WES?-}7oEs)sp06#
z8ChuH8n*8K!Dme_U_>wW_oL8-=>)DJ(P^ijXg;8TejxQzwd%%psR45f2Hk*Q2cfZC
zQBQv?Q5pr7Ddc_K?OkLPRbjvXf_ImISR`GMDxagz-vWz(1qcjKes#jMh=^z0i05kv
z0_<A*78_?!#YTFK@9Rhx5H!DNBRH-dE2H+%*qi#inMV`;=4_t(S?xG4NK%hy30Q)P
zVC_XDQ$L2?g+cw~-_6US#p5qguyTyOlztGtyCKrjx0Ed&77Bl9?qo@8BF>AQZnQV_
z7Bw=;f6Ws2<=3Sj1qT*A?z1V)*7haM7cv)3r7SrzK9(l-1mRN-R*=hDacLiE!%rq!
zGDIgh8P9#nXbSrVf6^5pwjAd5C28`PV>I446ZJ?}?F;pU82pYxwOa2S1;ZsLSar$G
zb%8)8N;K}tX8z%8BQ*eDC}EkT|Lh|RZHNZbIKdH_rv9m<?H;S@EdZ7Il`|Hc<^A>Q
zh&EHXe&>m`&i;8u$>4RKon98&f5iN9qaJ5XX=L`>{fK@Scn?X0q;V;qNn+zphT<wT
zG}unsY3)M8KIqa(EO{CbO6fHjYju%U8>nOlj&V6U&q;bk#7f9J3U$apWK+sJ%>|hd
zogYt~Oafz^Fim2%K=Dmiv({r6=0&99Tr!b>X3yVyMNraO$6-Fd1s0erMQ$LAi-bAg
z!@9a@Kv%r<T%H;NBdK7aRb~zDv}91G4_^#hQ_+yRPZ@h5a#Ga8bq2Jgj-EV?Je6!B
zJV+FOs0*vl)j$V0+s4xJ56_ZqQ_|PEb*#<^5ZhUCDMsYsRo}V%l41ru_aexR(#UPT
z1wn+}0N~HE<)KIJT(Zy7b@Ukc)*dzdH3q4JHe7Ccyn6mOPB6zY*Pch&&)<Hd!Sjxq
zUIxv}^VW1xlqcezS#N3W{JuXQX1QdwiCw81bBb+!k|0VJPBy4Xav=D}waD6NtmXYk
zixn1A^i?~#=BQyAvD2P@{FUObZ!6ng_O_=@yxQ*?acYo9gt%Gm4H7yv>3KK5t*u>D
zhLJ$Lpl9<{B&J@v4VH{XYO&j5vT(G4XBnQR3Y*@9p!0Ju3ucDD3=$i+_p3>FP8>P0
zVI);)kZLNiv?>M`SFPo^jj|KWb;GuN2fFYIzg;g?@uvf99t7hE0w!m4Hg$ogdoxEt
zI`XOs(c8B<np#Y&p^KLMq5JNW2b)7Lt2Y^`lA+ZppJO|3J}Pn;kGHOY{uQL&?sjFZ
z3lNx|RmF<C!>i?7riDR5)%dDuP)TYTTZt_Xh;raKn){3YCg>_>sTh8BKPH~{X=?eN
ze6>|b?7{W4nefA7R>iaHZ+qdwMW#OvhBI+9%6LO)Ki0EVBg4vS{F9n*6Rz$-?EpHe
zZy;yBFj62{Qs04$Q~O)-P?~6{V&Qh8WSpa#`LopFIAH<?qhcC@X{sKCuyOl10_VH9
z<mYdvQr2^H(O1rUUQ<^|qS+ifjAh_a%)+!E3_NGF_9bSxRi+Dvo~NG|TSwN27u5ss
z`6RU(<EnpspS7+`-hZytE={+(Z_S~+Y3L^?c4U`TnpoXLE+(Ljjo}`$?zh6<zkQB0
z3;g<I(ERi8XS?KD!k<5&M4D3yY@yoC1wU_J1nB7d0~IGc#PuGJs$RIS=NVEPFpu%T
z)JCiO=HJ25_7WdT?`z=)A9?*Cjz{~yg%cXGHJjyJzq?WofZ+Ry;IPxtH#~4uRGsHS
zXLfLHXSiHpHt~W%Ol_^w*rC?fBRKG}!(c(-n2oAH;p4htvFdU!;(5=p-0<8Tr=m1;
ziqPsE506E)zCS1rA5H>3+yrU$XnGIsorE|@ybu~>kEB$VNSbj;+IodtKo=fpP8^zC
zX$$>5ZVc9)wV}oo>`WXh2#J{5GFPnv7He7KEo7fI58IUn|EM8t<u^+LFyAcNew)m>
zbRNADf^KFEF|eKZ5{*H*-i1TkiqY3uy*nODjR$NrdRRjl6zo!$Kb(tv7C!M{VEuN=
z{#umm@t0#4DE@S;@Cch5nS}jx4y*9yy^E!=uOVKAHL|90ZoLC^jcMz(@?s#)bUUHs
zqDYp)HxobmG6mPG+Yayf-JkSw)tNO|Zz2Q5_Jf3j8Y)UI0q7IJt0ffqpBnn(@L)9X
z`S|>)FSBpUrGh~~ip1A;=`l1*XdKgYBNh-LZ)*4{d((Cw20harZkipll_ne*US6K<
zo6t3#k-4B&@0r|{tA|?$3OqqE@#RWlt^_I2>b3S7=*WnSAWaN0gxy+?`@8GqaNj@M
z$ZPJxj3V7@TUAdznJRG0D^RDLikzXgC6oE!Jdx~h5}rTA*8SGA9rhcJLEg0Tqj0Oz
z9PrIrT|hA$p@X?Bd(4C!@A6{rWXst-5zT;BAId2UV)UorKTgcD{vDh7GrV=5`B-YS
zY5&*Fp@x#a`jys$u#Ohsjrjd1yL6<CDPR`Wx~{1I96j+F9uta4i7APWv#FLOCx9?k
z0EB@`ee%fdm*oXFl7-}YJcmaCwnQ9<M|pFY96q$EEJsAxsH1lWK`(p)VOlyV7Czh4
zVd*V0<vCArE+>{vgdjAtrHP0uaB7BBd4tlYaHvT!P~sDmu%dLi<|?ZBSYxEhzJ0v%
z^~oq`Q&gavTkG#){AiF=|8ETd?m;N7cV+!Ebt+L0cj&=?eJZt9VzCT<WNU5N(6OgE
zV=T`(U1iDfr9e=Gu=#RglD#X&!Vo-<MhE8_s80A=##yk4MVtOS0zc$r31fcq0Er6g
z&yReCiV86E(k2qIauC&XGY&76ouT461yuEz3s;iPfhuMhH-fQ3Riw1+)^0ofqD5J`
zl_vW9o|e$QoqmlHhp@sY*7r0K0epKcFb)?s2DSHfzmx}iC!Kic>77kyD2}yEKs-J6
z3<}5Oe78n<qp4(-zN%4E&-7Cl>OnN1i;PM1mnEM2KktmhCwlgo!&Hpers^tUwINfq
z*T=KmCq3ct#L}@pljo?V?1)6HOIR@yhs$+Rxlhl?R^1;A?)C@B4QT`9t6t5{za3&>
zDqtD%<swcpnc@cp11hUSOzPEgq<$Xaqk(Bt3Ax8!2!wTUxo)wxOw~dyA7$@XIHira
zu{5#QzDAP+R3&47wbog-)GV8<1Nc{eUntXm1;^|38&;nIPM&r8b5P5Nrybiv6f-CO
z_hko+{f<0`rWQ)m1YPIFUB7_`i6M0L@4C?H%4^;Hmd_XU=I`xXTLlH@)$*r}rJ1eH
zo$(?V0R=a{XYF0RJn175ZBv`NKLwy0W@xi)Ze(Lfyt+J4CA<4Q<t2z#DgXfssWO&S
zU_WiS0B8Xg4wo4Q!}f6;R4rQ?93U3C5jch-AHIz=t3t(jD43aO+C32lKW<J@41Xy_
z+Kd({p+gHQaHwTSAEDlTSKsb7CkJF>D9u3>fp|i7Evz`h&yKt#jDP~v7iBqAtaHRO
z5CSxS0Q7qN6I2%Q0(HEfyexR{Ct&J_ziMbDJrW_MF&eMh$OUoBXAkUdSoR8VsJR>~
zki^rkUl0KQUhxt`sB-H<{-O?7k7DE%`2LijmFqR1O>Zq~5TT@exiJWPge=7V%+G@l
zGK}*+^ufLM`{IN9Yrg$2)uphEcq*Z!7w-QrjDF}pqVhQO0gN}~S<$+7yYFsr!YU>@
zlf065&&o8W(n>IDWuIFhQ^z)?p!`aGi-(gp>l@V^IfpdrIjb7nfJ~HlwD@XO`7w)r
zR#`As1jdw0#6S%KHKfQ<yp*GScm6Sm(W+D{-y<_T?N(p8g6^C+iulqL*qsp>m(y;{
zlXb;~)RONwgr}Svj1f+Pt{x<CNBNPuu-*rafoR@aH#S*-?LST9I{tI(P1yY}5;DR>
zc$<k(2Jso{hS>bM4iGXW#54r0$^78@kri%!-Z4q3Y@1_Hlt>T6$9VVJJCk|7cE8Tf
z%rtMCD^V=AjJW29S~EK8SYR3+E1G2&T9W^KaNxY9wXM&WYqKpswU}#>+e#3tK)|it
zXjMtTS5ZJtLl{c12+VXA@VMh;KjxQrRO?P{J?eLs{LR73hSK{LkYkW#?e;{9Sk+UX
zn+Vw!f{Vp(hM*DY(P09HEK$*DGd*)&HhD2LFaiK@lVb*NQcwn-;;=lC@4=EM62#b{
zTTMEvVT*j!MhANsH$l)YMZpT{UWhjHmtKMZQ=WmWpptHV$vNL|JefmbF^!iHnHcS)
zjW@m>+pheZIcSGp0TrxhNWh-CAAT|83)+E5Iz(nz*{?YYS-j?c8GG-7ZWiR>3KhM&
zvaliz<~QiYc#v?^yU4#hRxLbYP=3U){$$HN)9Layv#%$O)AbzmX0VtyAVMHmHmV(j
zGM8=5ra)z(_pQaCJPI5W>8ZuN5>;p2PBSW30*-1l!+5JPZ&?{_AMtf_<p=*qmP&Su
za2w}UKD8?)Y%hI4M#t-&z78X4%IB}mkBEzMF+Y04jqGqD%1{0QzZ+S%x)}${R|tjA
zeEu0yR_^t0vk`<EG0)ATtlV#MfTw}$K|%wi<{C&y==_1l$uMtu&o?rJ`!VX<v6ido
z9*}~OqxnySyq%JW9*?lvz_h*ON!Wk9c9z#n^~L=MT8GC5;lkeJ5g#i@-RZb9z7_B|
z2E2rUJwlhEyg?%gNl%|t;ndZ*l;==z%pvDoUZ4X=MWaPO7^KKZ{IXx%E)LK@7{?Fj
zRBR)rPoEE#Y*kxSYp|Tle>Ik?8f5Z#L?VoFofjx01}6>R-9!ocgswdNYrYuFFPZEK
zZFOVak12~IAMJQvcMn}Uj>awb3mL<Vi*+@GPd;}PAAm$s_;#f!6+^Ej^=4~+ePT`2
z81`B<cH#hIdwA&I2#^E6(r#CPeJAo<E|FBKN5jgAJrID`7nb2u8N1lpx!&QsP{qxD
z!zB_^pj(-Kt8s?UWE)&zvb1uI$1^%$SbVKI-FnRAz>;k~oenw5|96;dL!!O^s0`(-
zr`UrX<$%I-fb~5%b>-uNdvYEk1#NSoV!Z^lq0}{b{z-;`S&iT%hPsbjRd|>N3D@(u
z+&A~`!a%!R-zOk{MfP1tOCc830*61`;ssTxQPLNp9;!=LBqM&`{h<%B1)~cO@4`0S
z3;wrB9ISai?RAp$Ms;!Q^-@_o^@m(=Kt;Sjy<V&YubId5HGQ);CR`Vw#!CYf6felp
z6(IQ!W}kmt^3m~s0IdLpi)E#)+gVr2%3L}{AeCh+1UNWT;vz7XlJ9FlWP)W#fA~UU
zq#8xLX@>OU+@Pmb*7P}0`7<2t;vRpq*bF0eI4MeK_V8YllgU_I0ddSjDGSeL)tl;*
zq=z)Tuf)Sq3rGylU(zM-NT{0;mrSV8#T(L&>*u=~y1#)1Hq(1WI@p-0p@+h8w`YI*
zl)h3=s8A$YaC=D|^Ry}S^WE@J5Gnc1wsARLMF@WwwtqfTsHhC72FrVYL)>WoRj`E=
zAi+G8e`O_ql>weXQPSeyoYlhVP4{3svw{4Esj}xRHV>YppYS`dVuv&nljJ-X2!{#l
zt8;W=?S$Q=)x>@-{=6NJ*|bv&%jawfyLJVu94sN+GcJK9hE1={id2<mSFo~o+C_gG
zRJLmD!|2M?$Mm=kq26$GgTnU;)ieTA%PR5io?c-d;U)HR9c~|d#_D=)BtqBbXqSRO
z@A8CO=KP@p;H<zQEUPi?`^m-kpp5BJ^hQ7xPwKYWGyb-vqSVL)-B=FfO%~c``Vsn-
z&tkRY)A>>2Z+`e1m%g`cKf_#qim{B2boqY;`;5)zlkp>~KsQ|fx6lzo0YNhPeqVQ^
zg$+e1VtNJYCPdGhc~ULW>@8)QS!g|ViPS69Wl^5Ji(r{16OdQk>9%w;RW(>A<0ft>
z<SJ0a;i@n)lflPga$_1>Uk0{ysz}tF1fgVyISnzDim3~ziFY^2YX#*mcUitZ5lGqn
zX-UG>T3w}6*(QjdL<#*HW3uGr8tSf#&3$klAHj3M7ME)9j$$dwvug#36TYK!K)PZm
z%pb)@-_QOy&RiUM5&!>aI?J#qqqPeU-6BZ0lyrkg2}&c9Lw7d<f^?(OAt2r0FyzqP
z9nvi!21rOZ$hYU5@BF}@!Zq{0dq1((y&R*;3!V-PpTF{Pj9d=a33m?ed0&(9-jd5j
z{}X%OE}|Y)w6COtnY;l7w+EnCG@NzZ{w9^H8R4*vQiHMP;QR1I^-$QH`Y6`4W?p=Q
zAf{Sd1++&|h-m2hO(QO~lQv9Uy<9dkp!lLga3%`Lk_-jGfM1YR&bCkgS|Hvo=Ts%a
zvq$_NbCk)suugGdgFf`9b3~lfZwzCo@wX(8>k=`7ya&z&-tNeGjN9+(4=3doPUkB?
zi#2wiD|#b7c&}0ovS(EAj)#VG(IGS)7rLt#7Lma=<Ty!`CVVjl^W#2DO^1yZFcP8n
zKt>{opMLpRqV4A5&DwTn9{@poV~L7VseDx!o=6e6G#KXdI)k6tye@Vm_~2s#$tPw%
z;D@X#V<_^93BgjK%1oYS<0`e(S1_KP@hey2eUCNH;d@vUb<!IBkDMjSz{>$6@$?`+
zTdpC!+8Vl+MqZ#CN%&EL*HV%^IOtWn{lcDKcBttp44);+B;7m7YD<D?YDHu=S{tl;
zqY1?5UZgZy%JQc|QF_dO)IG)@EC0)-T@D>`^0XyhWUbd=&Qp$ZDhn}=-)9RgIsaT6
zt<PSxv}8C>f}&2iB0?fam?=8Rzh0u0Ye6c6w=%1CG^zaX5%vu!>3L%*(`RPc<r`Bu
zs(SQhN6+(CPV+VwpESwYmD_-H<4*6_X;;>z?2(LUTc?rUChX6wbP@w|;h4K@Ps?hm
z+RqI<OK{NC_$KJU!Sk{|pewg@@tqN2f&E$5*_UKKO$KZ>#mh=V|L+pffFz9<boR4o
zWUG#-K$R@fdNk*m2)gY9KZ*$&YScXSQ;EBRm)?I9H7I<C6(A%_FGNnzx+bGR6Hj+b
z3z~K`NKFltC6YYu{^rL;=d<ky2|!TW5c#6UpxXOP3(^0XMPiJ{pitnQ65=BQiLpq$
z-<A6_zHW~J%zIS73NPA;dU<cWUsFIumi_4S^qAZEskGOe#3n{;5E-zRrHpHigyd{5
zgEK|Ecs?EWVh#%aik)UybjPyEDE#U*BJshF_artj&BUgs($?0ENa?D0LOQL|ZvGI+
zn1DPgvER!c=JCAiy#Q0s?{nNel<GLKnNfL(P0O%GxGGQ0Yqc0?1P^%7dTJ@^b?@3z
z6-m?&Hg2CD^*g3U)b7;%ti!SUk{oQ`K+Gmy?ZAs=DZamF!N45D4;)NM-V3VcUK)cq
zde+)WB*YKng&cGcxaXoihhSJ$kz9y+1{GBeD~EGDNH&zfCYA#&x4EC<nMjbX%>r~c
z#7lEDzP+n?oKYt+fWUxFqpqRMPvcIJsOw35&UD~E8V!?*uxxbo;^3B!FWdQ0jNh#1
zHL4_rVAX)?(-0%;hJ>B*ZXgl2l7B=;*{&ZZ+OE*~@@1-RkJFC*4HATyU7vl&I0K5h
z?kmfC)}}Ni;?lowLC!@o2&Gd}c=aGNJn@IPB1PFlkK}r;)5x%(za6RaYv*blPC{C{
z!&d=w6h3I_yzOv<J$WX3p-Pe7p?>J@&2CM!*H;VMSVV2HS_Sx2g}id6GtZ5@YZIH&
zR_>+|^lR@TV~ZgpC+Wds*lycxsXTued@*9Pi3b49{~xZHF~}b?`V~EP%g{ApcG8jk
z8RL>gh~tX3ZT&rC=J#yJ2LG(x7-9b)x9@>%H&ckP>(`(j?d<|Ep^s6u4;$z|JLK|%
zb)aL@ISmJ*=0}3gI~$Lk(|_5Sc>Lnxy>1|+hjI@1$g@#2j5H-WEZo?7rf};*<>v&H
zMCD)qV}7uHQ$_&-#=Jp6l^lLhV)O{O)HklR<fzK3JH9Y1qK%f-Myq05;=4@vMBF(s
zzO~%qn6~jVKm*GxAqKmrp$JY!^dC!dED}z_7WM+QcDH5dftIeC*Q*WR5}Nw7RMc^n
zYsCs+9q;KB=)x$>>$<%R(_e~H&7f`@=%EidTl9uy*V}QfEK|_D_5u75`^h}QOUd`h
z^sM3=3v>=l8xrBxv?0+4@`_xGE5EpV#(0*?3re<eT47T#;eK!p_I~>C8VmCOd_Q!6
z$wd9dw)k~ispFnYypE;CWHxDVNYJa*Mag}${nz^<p@sNp=J*duvUsTzur2~3t%Dtd
z?9^*AADX$ujZJ+yipaEU_WMTQ#_th)(_)IdUv+}tsB1D)TlA(bBZ_~D&p?Bzzoa99
zO()-jLFn~$rww^U67}%2+%J<gnH_Py3hyx|h;67WZ~RUgVVTA_d8<{619()PvTl5K
zEWMQlyklG(_F!){f?`B0Pb?P=m#X@N6S$sv-Ft+)b1Bs(j;C2>YKGxY*VJB}e@Y7f
z&0{cahvpl;Z|Fn{-ZMKD1+Lz~LHJ$~qm5vuG#Y~69h-rW>$tU46*O4vDK@AP0jJlL
zg!}%U(p-OLmOM^4PFj8RctUij-$03Nlq}0%ME;DeY79qoGMy%RJ8|hlH|<u$fi3=!
z7|#<K1O`sGDelg{+Jo$BWRcOV{ttmjDeTjE;Br_Wrln1bNEJ^(I-n<NWj+7h4iUf@
z%Ea;qIblUp@MuJg)yYm#a(1<Y3qRW6HtgJ)zp!u#gv$Xrwf}baeJtSScHaI|spRtI
zb7tpIPmm@a7(N(cY*ZaFN;5vqD@wdefU|zVbOpLbe_jT0oi8jH_T?G1X(e((G4lB%
zJ`5p`+cc=I8`&)e)NXLZ$Vr6%Ap+{c6Nxmsp2Uy=$G>^sEay?Xwd!|&JNDRx+AVAH
zlLOI*@ixmp2$JJ{Ql<?_HDU<TU2u8XP#`!_Qoq3;^eC85+7kqJdH>Eg2LdDNFU*Q0
zO221q^gblYCI-ZS{slei7u=toU}L$fu%jwU-#%A&B8hRs#;*bM6SNMgq*e)^>g_t_
zi&h3R0OQ6Oq9K1QOm|mPa*pUSUJX(wjGl7Fgi>vekm4p)d{2~Jy}UV0kOw37ku`iO
zwa`FM90c(Aa4Fh`r}^lMRB6iJNx;V|_j$gCapXoGlv2vwEakvCCrr6fTo{>U?NaMI
zWxD46@~T(rY)U;8Q5+k)A4ki-7YFuaM9?5FgiW`hK5}#8zfx0PAOfb}07MLQ2=eQC
z7NUhOzSanv>@Is7$D3)Wvzx`wOEALZDKrQ|B9bPOsX^fl7>XYSj8_s{UNC^dhg}ZG
zd7Tcc6IH)&if4qY5M{HS3}Mm$U?rdL?<d3Vsgc)Jpy3TFZ|3enXJ|Ol5Sfg;-xt%|
zRD9Y9k4s9SV>)eFTP;&fcaGohJ}l`%i-53t{+z?Xrqup@0{~$EqwbBRSWLsDKF|`-
zCzm`^whJB;-IjX5Dpm<R-Qx1l7raq`$DDNJaGLHYs5wEb&B*)6So?M^HjlYQa$Z9I
zT<@%0^`v`>ER_ut?mUpLT|;%MN=F~+WIYc$o6-V6RNe%t_EzoT!?BmW88nr^Q<Kkh
z_A@3(da@oIRX(b^2^0b=1<p8zE^IarU$?YW4=PiTmn(+p*V0&3ehpZq0&xIBaDNkw
zxVA-)LA77uhzG!>oJFE*O_&+_ug`N-%cxPJLUIikGy~Vx-23{OE!6bUrG|#5&TNhL
z-V}>^r{V+2lH6kCR?OCO1cAcyU{E2FxP={nHh#Ul;>*Lmt8%gh@YVLNM8Us&@;b35
zc$Xj6Yt@pIi6~vneZ_??YN{=()AA-w=*29qasZS1@{^%arXII>`9ainu#q^<!vb~~
zkm8FCK|=dJN_~kHSWcHCDTa-4B{hNl*7_o_>3<)~S2zNn!O7NrKgP}B-@ySC7`<}q
zoqW(<@C&9lO8`s7sPrP;nwZDgs1ehApiRhhLwI>XsHZeMk$Eb$o(;5tbjS=DP-}KV
z21o7d_gFBwds)DAxLRMC4lP2A7$jez6E#zurXi~OKLwo^m>Env(qhNHPaNaFfhV@I
zo{%~Z$4cqw{xwK3pS^1=E^hFlXTwwQ4v1U}2(EhDayQ^Br!LH=(>&gz<sL0FsuS{t
z$Ntkcj5gnVePsoUHs~dj>4%vQH2ofggsz;;^+#=B(dzu?P`%iJ3Jsc;&TX|40URsL
zL8KtCm<~8WmEM@Hwkbf0%~IlaA8RugIhqrbRx*}5u=0bTiDRc7Af4yvG_7Uc8>a%<
z(m%EXI#KfMo|`l1D|}kKNrRU6K%-|QYX2;$XF{Dq|HWPJ#I!i1QYcbnrWWb6tBvJM
zpX-Ukx!I%>DJ@gyqDx^x)_zW;Brj`ENJ0u2`<EYPt{QoUbrRyL^ud#D+LO#AFZMqs
z>u|XHekQHb6+VgcQJNH}K|ICbNdC>G?AZSxUEhCQP*-RzS7h0W|AV}O{b4ejK-u=V
z^vTHIwmn9Kk7p<bXU!D)f)@!3^;-tdAxU%ca{&7v+kZYeg-JHXBR{GU@vx7Kn-GAy
zJi$o7ln-dPyQgjfX$im4#eFsNnmYf`mnWO_Q*S-KFY#b-OOTOfRER^=RiidKXX=OB
z_Gh_9k35OL=xo$@JZ&bWMR9mX>T)z!O>&>GOL^)LPIl0S$#Y0)&6Do(bjcii1H15`
zlbtb?S2G3v_}CM21Qv^yf7rJ?xnrX5^knilwztlq$t;5pnWDmp2b`&QaDI3Y+M<*J
zSj~^CDApoG6kF0*wQc<FeKvJ%l9CNxWNdqcnKrG4l{HAAJ(mVt)nZ%)ECl)_r_921
zfSPL3uKKGZ(Num3_k-Qzd(Xc`UxRJTQs<s(RkAy!lP9p4pYnnAJeyp5fHCp-$0Q;5
z_2$Zzv$atkgM!6p>g&I|_AF+uK4h3XCE1tnME?9?az4%!)4cywHgeEh-_-5ZY-$qQ
zaYy~CQqEk1N1pSQ@V+hWc6_<fXG~D!d^FfxYF*QHa_xUF60)o_&a=Ej_b)Z$?DX1x
z<+3|ZmCR8iD@~dB!>d~bNLO!b(9_QNqA8J0P9LD$Vgq-65gMC7v{sdB*d8MR=kqT-
z(SL~K#rmj7kHb+&_DqogKrr=Q_zfoA@gIauz6FKG_0;W-<l5UlMWy`SvRl%}GNjAR
z^I1~hg|AlUdhH?!G@J;#_H9mL{`cBD2*Qm@`WdkU>00W9nn4aBso+~EN3MjzoG5=m
z6{fSfS_!&c?aCN7oB2<WIoI=O?vH*ZL8Wc#{7O*Zb7(`^ZZpi|MKYhxvqJue`Nb{6
zCl0@Fg&0NwCzT3tQd4hoTszHp*G?8Mw>v;<enR>`pJM;M{(4W2^YaG`V}DoQIhOeE
zLlYqRJEh!zbWq7x<Mr2vq1sSuzrhk_1_LUHNt*!I(aG9+X6-IUCH&35w2MuUGTsg9
z**=h9nXz8ADFP4L=w3EZd%j^6@-L>sO!F8<D#kur=J38Ge2Q*MtXR8?9)rlQlLOsZ
zvV<c-1d4{paRmdy-VrdD^nL3L!C>1Xs*QG-aZXsIemVE{D@(q<TpqUaAcqHx*f7O;
zc31C?_Dl;JtRzPV{Nf<iJiuOMJwMi=&X0`q&F^Z3W0QPK!Z!9NoPaiY1oG?p|NBjb
z6AUqWD?0&$LJJE$unx(%GSUv|J!5+KK!D!s&!BSrdNcoSb6PDM&q~EzG!U~yPw+h0
zJE|!rvW@qi4wyii6M+#_EcjJS*ub9-!$+^0Hg_R4*l8|(MP)N)%<sjp->oLgsqOE9
zstB7llJaDvJ(`9VwTl!-{d@A6q|&MPAO39`#nqCx#5ttV(I}IWj#`a5ow)EtrOoY>
ztYbG7ksH^s7`U*zG2Wxb=iLRi&TWJME7wM7eI>2KT3b?9p3vwLQ3bQjw;JxXSF(|o
zfUc)yiQp8DbD*BZNlzp(r{!W=t$)glP1u!B7&;NeN`2D25jL*<HSP27?i>mYr@~lr
zMr7C^atC#uAUpM9pFOv#;UL4>{^1+OQp0)OQ<~brv9P!m$Oi70aeZw%SLq(?yjfGM
z<eReKOEHh5tUVtcShzDEa}=1-PFhxbco5k^GnIq-u37lGL*V6%zz5-@Y8$^5N@`EX
z#oTrl2YTd>)>QRDQ<+~JZ_eyh%0R=V<Mv9eYj=F+pBzinw*|Nv#>4Zpoq)Pr6`f)q
zFKRa5w;+?~H{-`!agRW%IyXIW*~y084xKC3F&@;8&h8&3ay*%-dFSt#WqvO?U`^5&
z@b-3{m2?ydv8qNQDF+Y;GCOr&s*XrOyq2Q-|I=4dgEi%MW#9bT6#7WvljddIO#Z_5
zFoD^P75Ylk2*<MgpqeLCTlg{n45}Zv#Ap9w*;_w438BD>+(hOQR_uPtViuqp(3D__
z25cB^dM+ood*>tl=u|!fN_!Q6sPg>*-@8yua(_FUWGyeZU(TSy;ce=q(ZCXgu%vmJ
zQjp0ar>a;W?8VQ=NHHq9vSdN00qj$0#>`4q2O(mFUb(a0i}=kpq&R93I)%w5u2I}R
zv6Nb=6N@oSOwAI{fxbJN)uuK5apRp9cp!<_uja{*at5D3q{YiXhw?z--5nKAI|tsS
z{-(lV*1{Bd-|ACxmQoHfEUN`VrR?SA5|kDI%6;T_a2c7!=l+`!(Xf)6K6KV@tF-v(
z0f|>F{ApZmmSN((t=E(dNxOzVXu0?RjB6E6)A3n{t3NLwnrz|S^}kmc?{BR9?y)`@
zqmP6>^_&ypmkicXusf|JRFQ1=7+vPdp?1Ji3>SJiz7Yn(Mr0o5tb4+nq}j51CxAhV
zqeJ@K(7r!z>(Mby+!ecs-YB~4+^fDWc`=r?jM!M?mt%d)yXKpF_uYRhDBJVh?`ITv
zKmJvrKC}DOj}0s<M8HDwl&1OOY^q<!ZM{Ni^5x)`hs=EcB2&y$!f?0_vod%G&46o=
zPZP+z(L0aCbvJXL`}?hZ`}(~CU?ObgyqhljY<3@dxq0slHDBHT52P8>c004!`C|)k
zf<7M)ex*C&0Wi}nqj6P)XTV~wh8zXy-b9|p7p?s>yR`-$98A3R77?Z=d$kN2+LK)<
z`Xy7uPPl8{8a1r4D&!6}ZP>0-1vZo+?tkn#VN@Bra&q=RgO4TT9B=K?n%+Dm(qS}5
zzwHP!VxPcoYxtTjyetw`#bP$EUmccq^$hW&Z=%5}{-lgbPA%PD;<Z2~MNs>1pe~IF
zJsJE*fW-M<IqSTy4hjHgaw9@oCLE@$N<FgBudM03PTwz$9ly<fzIOBoB9K}8?uHYR
z?7ZDVnx8-$vERh=M{KsWLvN*Cbwk!%0kWv69jNB4g~;RWwH%>SOd9C6A>B3eyAN?%
zt@B%os#fI;h%t%&AoaT*k1LlxRRV5YeLjd8N$UA46>&s~u3&R0(Rde`p}65z!adLB
zjjyDsEpycB3nOkt{3{HIhac!-5Da}ba7+DMg#@YQ8Bs&N(w^ai9H!rSQk}7=`vTf%
zBEM%oBEnDqtt2s&^>?cJqO>V;;4p!l8iweftDag(k3jor&dihUPYwCWVTWtD^X#3H
z-s{?iRwJE1+z)A5s629zP+X+nZsb79WgrO4!3FFDXzz|Fqohk}07W}l?=|pwKV`Hz
zbZSOT05qHC4;I64Azt#wK1D(zN-x)n4r1sKdHk~<VYY{L>v4vh9u)OgSsEQBiRY{g
zK6|^0sKc(&KE|bGf$+PcwI5^+-=eFxY@C?ov#*WIK8}B%{g(g+;j(_T-L^VYn=$!>
zzwSHtzZpNNSpl;iG%RNrXrU{+C?hv#9cPFsQ3Y;B977%dWmDt*vMS4y__K4Ymr>%d
z;n&!S3QiW`&T$P9*;lLSAD4!8A~!z{-~V2F{wqW10;|#>tK}{VY>fV6yc7BND&Syc
zz8`92_&7>i*|<%BK<Hu9*(e1u2!N5fambxfR?AN<UaoJ7o77#JNZEZwS;4Lr7aPT3
z_i{HcoL?l~Fo2Zca9O~#VhE%nNmS+#oZZI5^XggRmkXxqTNY2<#53N@I0WPn>+HVk
zyM7mm#3&yhiNL46a*2K9o|kTJlqt*=+juuv61r{A%*MJ)ZJ1So((c2MwKagZ3sw^#
zz+mD>mvI&Dh-7BZf2Jk13KEfEArjr$^yWD-)02m!Yp>t~U^{1Bz=hJE^>6d!{}2VE
z6SkS!xcaC^-@GJVP(8|TcJZMa=K)IO<gmplHpkY0q`Y*##`PZdGHpcWZ2*<5%3QTi
zwCAhhSEDc9p30U#55L(X7=d~xt?%ks4T`7|4F#+?ZI*Pr!1yZm*x)xMr^>#Gc5>)h
zWfhqWgSmECVNrHFIhEY+8^1xh?!AI14}RiMmRe3*y{DSedExvc0zK6mb?JJ{A%lSP
z5jZCVMg1qLl1*Nc9>Jx#6!t+-5_MwV#wYSOrz79B!|@^ivu+~**cof0Q2D5VAie7&
zL5n7Py`yJZ`c%y9a1U5&sZF8ptyq9L$|WaQPNlBJcVMc#`SVFH(>bNBT~oV0pMTOu
zkMUPU6^ZyWZk*hg)bPXkAQkl8(03V7C)6A@1b&Wg6mGa|qL+F+b!}8QZG8_q>fBjH
zMMHSv&6lmf6o%x6Q9G}OC^m<Bs;Y>}h+lgS2Q@ujeksoaXqAT7CnvC?rdQ7-`^7de
zvV*;D1|q@490O#iAeY}DJ&h2MMlgiMS}e7QlVJiQN|xl}_E1DJOR`B7HLV#Ck26yh
zGqTeL^*>b!2hB%|=pQ+U(Z_Ama#hT)Q+^>=j*7$^pf>Ey&Ang%Ny{D-Pk)SFc_?ji
zVWvL0+NwRGXS){T+WBn(>Wt)Ohi5y#=lVBQdSEaC_pzaY8f9sHTnTx1?07!kJh#HB
zA18Cz%Yzct7l6d$S^T`kY!KggE{08xi=%?$jRe*i#Z2B(O;yS++`3nsJp5<%u#vI~
z1<r2YqKTX*HkXBl<32`9>2tR*h6yPlq5J!at#8pl^JR6>j#TZxZ+~|yD@9Ett=<h-
zbI#@Ug+^QNRyC8;64_AoQ$mx}@x-bOTwH`vKnkY~1RJ~jNz<?KX2Tkeaas?P`-%iv
z=f@~uHxj|kTfZb{qpoCTuV5*nE#pQL5Trt784wM<3^aJyMzKdx0$*xaR}<8H>G$i3
z?KZY-S)z_Wc37P>@)R{PBj51_MMzJMFJ(Wxd7kVkp|+!`ckaOzlSGLZ*;{;1Sp<{?
zns+E!CO`Ag-XI&N!5Y?pUN8B@`wjALY%*I9@R;B0`1QVEID3gR+YSA)_C$Mbzr!#(
zzeky3iwmABjLtw010!TbyG7Z+!@s)b;PtdTpnabBNIsA2l-OhMCNBQD-VBsYb!j>p
z@X_CYi8l#;_gqY*Dd@kko1edfe1@{y2ess>TdLrr!N&d(W*B8zzJ$yaV-j*opUINb
zw>g@x*S{~&Ey;`XeFR{m{O0IzKMX~8r?<0@tf%_*hl$9~N`8sXM<STVUVbu>5OyEq
z;2_#^PHCz1jbB9U1FX}Sk3+ZTQh!M?EF+c;hn$Q3!1Dfx4K~j8J1kwb6YHW^%=A}a
zwC&N)e8J-tWs(_=)Nk_C&r!Gi<>LC)?SpjO7a3>`h3y<sel}<-;a3q5%SFA=Pf`>w
zrIa;hvi!>WpS-W}+L$q(BxZN+)(*ijAqQ6~G!rNa^Ct4x0u^A-cRv%|D~X8u{9V7K
zBpwtQ!)0`^&X4QFz1_aG7<c$1R=L#AsxOCUe4)!78*gNXT9Hx8C@HeBEQ`fJrpTPk
z=dd31&)0)TJC?0hU#<#OPOt?}CtL>4)d(y92P~P5L#Pb45as-5(ve-B#B!;B<HW)D
ze)k&S=su0(#6l0UrGB#I_<4IvldOo;Jwq}Ez>2Z&yI&9~`1D69oNL=?|5V=%6gWlT
zeMv#7VvLc7l@#0iPdsZ7eX~#oAyK{YcV%FzX{;KZJ`?ekE5NowMajB>h4q#J`1oVF
zz_slQWZK4{sgxUkuoHGI6&F+%TA+uaG8V$Pxd&KDs<r>rS;nB&L2$Ol>L;Hd7rszM
z3Y^USUp))V*m=89<3dq#6%}IW+zeBkKYjLhrQZ2=R?k>LC4H?UG8VsvzKa29|5bg-
z=#!WoKD{%EReFY2kxN=OioPF;J=oy|(rv14naq)&_jcSG^@9w1<kcT9aLS!Y7k-^)
z+*gZ(vLN@z7&OuO>2fN>IOAMNe8<A?R<%E-EOmW(;)2OQVc)e2MU!s(Ybhhbt<dh|
zqMr=~BG6M~LveKl5)j7H_5c9JpZv!g7Yqi)&yi9dObCAK&q5F#?E1Yj6W3M`hX&(y
zo%M^_XsWmMzhKg$?o61(-uqVzCLVNH@oa(5<<=Uv6B*lcWfn`q6MMMmmNdjCaqXSz
z(dT-Wv8n_HZAdMbWY3^)`$h)Vijosq?CbPh3<+d!Nbnvy9xiJ=Tv+kV-D;H`{voi=
zdyLH_IDFM+`8bCE2tN9|WQrYSe{6FDxmxc2xDA@;)b&Qs019&^@6ctZ1rUgn_n1yP
zl270UhB?bowG_QbEH}<mc`#g)VsF5cNh!FG2fk^}lZ%A|_p|A}d&7BV6peDUUmrf0
z91}^Lc4b1W1j`nA|HzCgOTt2aG0LEQ$?IlPn$^_aC(jNHprEZ!WUb=Qs=sexFl0Yo
z45ce;<Yo7jS1gPRuD;{BUFVFCw4QVtR-KU!vzVLad+|pp$ZsI-wK8d1yG~D2ORXrD
zu%pWK(4ErErvGE}Q|ZA;K^JKa6tlvDhV@VlhntlnDrQ9Nc-`i1oi31JvV~gGj#P*L
z#z%gwD0TVEU+iT36k!}950_tz6YC`@+C6i?H)3+ysPK?U8$RVTpKo;k;xRp!j-5$t
zqLwwv$ufHkJ-^cpktKq}Ngf(r-8WWo0$u4&asRT)wB0`2T>_A?A9wVZG`YKp9<#~Q
zNcumw2(&;ywgR>o;a}Q$9WiO?qiJ`;&pYLDQm_X+iihMfgf>RZKy?;Sk>jzpwVdNy
zFA3dzmxBv-8?wujV%7o6+SIRDh)$RD>wY%bI_t5HnZ?K1efRxN)W1bX_aJZe0+?@x
z3%UVc4<&&p56FXAD5?6@aU38h8d>#uY@_OEl++TH(M{)EiTFOz)7LpMS-$C~$SMf!
zUAw@O7-T2;G>W;rv3!`Zp|Mi+xPLflAmo=4U+sVeNIx-0Msr*s|Ly8-4Py8H8fI97
zz18nA-S*ji_nMIrj$TpPSF^u6jbI698E#XxfE6l={!r__D@eS+u7|FjsIvrG+G4nO
zwHd#G#?jiXUiRmK!@BQPJ`1-)xLux*quvwf#Ma3oy9NyxeB_PgK%Bbe7G(>CdHD-2
zcLNMD7Xz<_J_HyWY%zJ$xf+{VO*}2fxBcYX<5EXR_0uvUIyD~+#vG;k(TWuC@AhCo
z2W<W@$txzEmKO#Kh(qjN0V(oF{+WMxSbwigeLO!!#3?Phzx1Ja7S_cai;%9cF>%tF
zN-c0{emvaiflp(|S5@}r+pe<4?)5h;!=#;Y+?e_&u+{1US!iu!S>JcX7{iJ&lpc={
zA-co^%<S>whj}9fh>1B!@m<cX3)Q#NWwtt5X#6|lb&IlwDONQn;RMVxO2yI<t_FV5
zx?#p1DLi12g1Cc?mn@?2Ij3nMLaPTRn^1K@^>_dFxp2<saqeWP10W=YGbss7!$O6}
zlm~{kv=l%-2vhen&6w$(z&GZ)$1e-E0VJ$sG6x6rDT0C2et11FBE8gX2OM}K_N#W0
z@f7tXHQcUo+!Mi&n%mQ}?C%|r^u*lt>^n@ymKU0}z!OTcx`Q8@g4HOCAQgHXm5q06
z;~$@A&_fX>&s3&Jhf@g6jP0f~G$DLTtiM@0*kr5pU1DJ5U43T{Q>?1>em$W)+EbCT
zp}V?meZxJ4@>lhhB;~OpIaTV^Bjp8A#dgoKN#EDxIa|&jU4Jbg?cop^n2ijHQJlAa
z5OR&cK~K?9BL0(>)aKK$_NWgrc|4=j{fb_Rd6@A#bX)J6r&a)^!>2oS!yIN9bF3=H
zlp;k)fvIH4nz6771@@@sRU`bZz<eew<Rvvkr@(IX`R*-R{g>0;I?X3GD#B)?3rlPI
zYhN+aUZp(fBv;oVY><rd^vF3oL*P3@{T>MBebW{HjfSlx6+lp-sZO7WvVd$YDn9z6
z0#PzDx@j0H86rxA*3-dJwk85jg5w2)XZAUZ%Cnb&(&mc5&&-t}^k+xtA+A}2=5R2F
zu|WutcpM`ptui4589)CTs6Ecvz_j3TaQPS1p%H83B>-GOCs%&nOZ`a90R$PG@=ZV;
zAXpxUIDHThyitBZU?n>hHjeAsoUd-qqBP6qOuNJAtD`T1Sthz`9g}X1-qWuWwA*3=
z<TL&iP*<kYRv&#iIVfSAq&%JZsQ|)+k^m!B;)n@6V00~H?_&>5!e==KcNXz?rR^f)
zBm+6g2InHn@C)b^#M++p+B+g?NNiGQ;Ys)N^Gm{s7Ej;a)@_D`KYsE+B}utQ5AbT#
z?U$)*^TCSp=`p{0ICt?}R60ii(nN&}G)#Nc&p(4py<<%pqK@LxJ5r>5K0(A-PGRw8
z4gf>JQCMS8VFfb`asnO3Lpiw&vY+xwmMM8E_!6dVQx9-yxd^pCC+S#sV3zq1bJk<@
zcznCYZV(#`W$AZp?UnXg-94>6y{<VSNMX*w_m;xT=lFdZFe|^TsXxc64qKh)VD;l}
za63lQ!!n^XPk(SCH&kXo`>Z=-#mvuozRAs_9a?+x0V0c2DCeZu4mY(IQk@fSr#hX|
zx);2^2j_y`4%*aPsf!?FmXV6O5(&;Z6y|PpzV=vy`N6(F0R$agH5Naz0Hd}shD^Vk
zfnkh?*o2ZlftxJ@3e-axWp5q467}UQ0^eoWb_ta!&Jqns4L&;_LMNZn)7Bz?%@WJ8
z_%OP9IpV3RwauKHrBU%tX&jxO2RtSvwP-+~Hb&qi2-8B5!Vo3004p|OK(WD-?CiQ`
zL3<7F*I526m&+eP1GZitFeMVT95R=<IUF)`k~i$H0AE`<K}AmzR4zf7mBbUI1*<=P
zVYIGqm5z!iW0^Z3ul*2`Fn_!A3LCK%mpjJ!cANZLL#16sldnBd@V7<7Iv?-Xdxd`Y
z52X|JB|xnP>~TTRK&jv)HQ=*5VRsUK5Lpn)tbwLupJDB@tE_Hm)*8(cTk%jXBD>iz
z0xoq&8vTPC3peK}bV(VLBcpsPwMqD~AMRbYq5W#L>=fSRKwLz{2qLPet{xbJa1_|f
zV`IkI8^Sf#P2=rjm}~Y{Y)C;(DV%j|MZ`8MezAHb2<gem2f(*Gr=6}OQ3E-V^Jmrf
z5Vo2qK$jBMllDm{<<T~3vb(h7gVQVn%M&_7H*%yNZ<Zt!m;Fx;()EwFGx$srXTbDm
zeEJ<kGbZEs;Mr6ykb!zEw%&d5=<x=43HN@N)3Y3!I+mym<F@+-M%<B3Frj=R<K;G3
zQZuCfD1mQ2B%B|USia}c!DG>jAu1}WJh7J;BzP`PZs%FdyXyAz2~QeVTe;X{Bdf#0
zC3~%J$PE9e)Gc7dGd)+U#aVU44PB7^M<dOYB9WKzc2}4@`n@lU5I=aLJw#gW_j;Ke
zJ5;HiB|7>3>~NJ01#>R=jE9zfvNMk?h{)~)wJVQTu_MER*s?};#X=qPYT5J@oE`(M
zMzw}kWSi<yY-V5p8*yDjD@<=QjSY`jKAw$Z`{q?EPi)|maUNg&ez93=@^&JtwO59O
z09z1Hfy>E?rENRQWq#_r;Ncg5`a=p6joQCnJrjpyFnjRzsCqj?<U*O^Vj@)z?O9wl
zdD9ewT1v)cRR6CWtyV8SQ9+mA3kcU6H5ABKn)CmRK0$c#o%cnd<&mwe%OIfc{0Wq&
zb_17MFi1vg|FwY6#Y>~pP9c2lu~B&+0q)$g+0ne$Z-W$e1;*+4f8K*ygH$@IeMN8+
z?2gxaK};G&TTYSNeVi!-#2x=VfRMDaGRFqFbxYAKUyb_Uu)9r#2Vu`H2dg`L+XNbf
zJ|@3^4DlH|Z%nz>TC8Jp_3QEwz-^lJnTy@&icclc#ZWi7K%f=Y2esv?@n>T_d(bzh
z5y@&@N@qU1f+RJ@!5y2i)UC2p%=9ORyeeLE+6w8zu5)dO>;2#B`|J-_htG%+GRLeP
zTI5MwR7bHbPf@~?6xhBSNj>-A$e;_#6SGVc9~dkwIKQwtH-sidf`xfF5R8$I=^-l=
zL5j&40d-83W~uEnL*0Kk3|0RYXFn$o1+O)v6Ntf-8Jnbbn$Y1K@D>X#b(B==yeGKa
zO7-fDss)N;X`khB3O^|6ekneFN02&r{ST${b~dyxzA)Lv2pTgFV~q9BKCeVeU$1ZL
z{>X?)2p2*rNA;Pz?Gs}&ue*zqR&=mi;EF6`3_N9bhJLzcxV}ysue<4cRY(eZ4970S
z)HfjdR?E#VHa}4IVDgnfm1AHfx4kZ#xpo~=>!JLqAAU^95vsA4t9t&{7y4BfhbfrY
zoY{`KDyb$8%=lCoF>8Yp>r~UuoI%L<@$?U%+8_ta*oCkg5XYeK-A~qPqO1$H4eHQm
zQp!xD@CWUexrdWsodkId6S%~Knb)<=pM)BiV}WDFt_nm&f|#l-eP*AwX?6^FMl<%M
z>M!O5M8C0MJUiqD2jPxKs7iIw+_dw;QAHJH_WVN6PF`bB-<#pPVIw1WI*8>D&O{3J
zu<m#=DAhOhtPf|E&W1{e<zu6k*9+s=cHDGr8=(EOfRriq*yg2YIg#M+T^*9X5<gWp
z$wMlq8WF^GF9(k!FF<&sbZ)8AKanw7|0H{}WXVws713I#1G9&?FY!6K&qXYz2hrT9
zmo+jqXux3tH05&;^=IBR*f@m^8GNlnxY?|*ohuM{LRyZtDH-fpgn*NNw<3~fn8iNK
z+ftnK-Oui9Py;+8;^&UkDa^iy1G;lW{r*M+88t~A#J0;X!KhS49p$-nZzq2yWmuBp
z_~P+({aydg=R^Ms#m!cF+Li5-l|wf`JMDodmPS#>etIgKH7Qr%GLQwHmJh{WlxgPD
z>)HL`;Q-*1ecQ2Wh!;W!L1rkp0Ye!C!o+(ogq%#@BEEl;iY#mu=zRy$(t8X21g9_0
zPcAkj<JG!a>8Y_8I3M5rzp@(zg0v-_T;!o}CS-Kh@P2wunqbS@D{5)twGut)0B&=U
z7w^`y+5=bKd$YsOO(!?NHF$$T682fLr>Xjh=cu%knq?<H8J$oo1*b}VxJIFC_hw7O
zWza9Npz<j0Obs9R*bd#qmvYAMq2@P%`;Ir_BLT7gv8j2elp5LsWr?a(bsS(^Ffc_W
z29{C8@)2uavyBDSYT<j@)TfbYmgnD?3JY%5<*6s00@FAE4tSXeUN*YOHNQ##wQPd7
zru68pHTsD4rPwJTsSndP))Hl6=Mn%U3eD=7Bha4wN2Wm(kb~KYOq>JpU%KA6T`S5H
zwR6wRDIM$@7tx;inNuaa0cs?+i%Y>FDyEost0d<!a9nXqG!Vn8%mlNTT)V$ol{-(Z
zE=oMlue7}bUwReellLVdI%;DjJ1a%@FdJN}j-O@<%72>6`x32NZeJC^nHQ1<^e_nb
z?aCDv(Q2b^_w=etIdWFqk3itpo1YbqpNxWJRn#NBIxTiVA)3c*STVjfh6*$Yk59-5
zTJ6>(62NBZ`^E}5cSw?75;Mn0w+(mrX_Pn&oES~KOOiEtV*)bP_6Xj;y5*x=yAvP0
zIA8#FZXw9VSpFbVy`)^#V%PKhXE;dSzK1*npD#I%4S75O#>AxEvV*ObCyK^tp0ck9
z@yM|j#KlVkhbbZ|*dmYre#>=ZfAlQdUR?|=xi*F$v@dv_sXFJh6J!0U>Oi)n{ii~y
zE;+y>r|;rohL3n1or<=Rh0lPo2s572t7_tNRb!vJOu^8^<N^oy4d{F#Vqvn06AK}o
zWDODng760O&PcSeyIFl3d<$R?qiowfOfO!jLmK03y?dOfZf67}p-<`X&Cz>wP|AK+
z>?WRnI^nhDA3!xhS_hHCUC6`Jzq)5fjiJErnRcIBpTJz4GXz4ZX@DJtwYn7--0Kc(
zdPSvb6qL-miJ~?UN)+|E331J|GR4)5ZqUi&^^#4SCod@W#f&{4`0i7$36wiitJ-pM
z2u*%deyC%Z2l~VgwG?={s*ZO+8v>UuwZMSI>zX^moH;+H-b{a;rJ;(h{0&orHR-zh
z`KtGUme%S*9nyk|{s!cT|A$@-0pXfaoaU}`V@?x9Ow?k%t|P)r_sSIMEY-gf9L#{2
zz~yl9Zw2r8{Z?D|;nC+59x*CG8&afgH}P{2=7)o;lxaWq93MN-VWdOr0HvAtSNN0#
z*j5gwXd~0_c<wu+_|}>cX~Lx}s$><H;~>5e#r*V*R*>ch<IJLuzC7@y6KrKzgOMo8
zZoy|&TS4D+<&=wg>`q|@=&!s~W`jk24QUzTIc$RhSk+0Kr3tFZOOlYWH%nKEVw}o=
z^`xDhidhwzkuxsjdqaWb@x~9H-`f}7A=`;ZZ+UozDbySCGrpH`$khKzhE}(~Z@~=M
z@nBmb{!0x3b(uc$ZtvbzBFWsm<v-{Lvcc)gD}$@TG|`*ZkX5Xxs2pJaAg58-ckA%5
z)W|LrnFT|vHQBOI1C}?A&VRqLlxA8xMS#)owOpnRdB{9A)1(0(VX$GuBc`b3S^z3;
zDQ8sADr-n8;b~PYSVTYfe!#_hO;&L@aeS2@dpg7rX<2TY7%DBPvdI{uYCfF*RO;nu
z6}#Tjz;HLa3R(R^sO(YscQqsrX&7|e5$OXi!|;Nb1EFU@&h!yBBq49ybl5a#1ouxC
zL9TBI0;zq51Op5H>q#`2`qo?&2FUnyqggtW2a6glu&CJ${f7m3dN!oob@)(z5ZZ!O
zD3AuS!bAb^fKe{Aur-hX8E^+dZafC-c5&UPSz?9Uao0-n8w*6ZWLVOSokGjVzJR$t
zL?(60L)id&Q)gys);TkyXt~(R<#t1Css5xqD%|%6{hpKoB19}fdghQlwH(g6fa_`$
zyYNz}kebsP(N3s5Z|AKS3fGr){He2=z%F6X1AF~3>8;<l3S!4c=|@Pc^yB#|#RBi)
z6np7`k5{YqO8wQgN=9ZS>>A}Sxi%E_3iJXc#+U^d{E&bv6^*iwj8IDY=Z7M|R1%NW
ze~T<16kb>_4FZcfAyD|%c6oUiVQn<JK;GaKvV=o{cF!yEqBJ3HTtH|1^QoDNmQtVr
zsDKV@?4B$?Srd|WuH8aFz9h*;i}ef*HmRxTM3AbMiAV3+>zn4cqL9cUj>WNM%5f{b
z9u$Qbm+cHU%IFrnPDxcK{ZWEq3fV8;#Mw+{j#f(A2z3j>gLpfw(|@K@n<<$3#z~1$
z6Rk<kD9#GOPU%~W2XJ=au<(Nn`H=|0hln*G-rL>lU&*JLhsiS1NQC;GKv;>T%Oc3P
zWCxF{1JaL5({?i_g9FE^!aoD_OnU5Jc1o{PNn@#_kjB<0F%oprY;R}K=bOOBn3%g0
z(QYP2ukziRl++;A0aVL+=}k<+<p$~J0wVi3bzlHssvGB^q+Ckwu2etP^dizp3yn^k
z&f(jogz$R<F_CJCy+Qp(MlSQ(!D@#NvV>=Zw{%po(4LaPx$EBL=MG^4Q^c%~WBCh5
zHTXRR$Cp`P&Jy&KRt*I@-D4)eJxBS*um=8$DunN$t>2c#51K%V>f$fANY0Jp>9uW~
zF-d?Ea65=eh3+_B1>jSFWEpEn7c#9n=v8fFROv#A42VY^V_oyq(u9}PjK=83?a0)|
zAOK3Tkph5x`S}v;_tU>9Q<Ys-%XA!kvHJ$kZx4<lVPp4#j~lG&KUWjgiPie-$*fU#
z&~I7FBozF{rP_w7-K+#^Xo_g69`)RG7JKnhiNV>P?rqBY@TmMw6E*QBCpkG38;HWh
z&c7w%tlHr?th|5l;L9EC-Npw3s%F5&<3~n+ArmZ)2f@XiBT*}wZy}g8yOgz_{X4qQ
z^YX1%1}NyjY{GS*&~H5k_)cPRYH_<WB5OM{UCGX~wv3*7ngPTi@6~-_$*nl3i&{2>
zfh&p@`2ZtdWFO3#m*x2NP!Mx4j#Eg7H!k3yqcQsaZ-A}FGPQUdAljrod%p7VS@g6S
z6Ih00QYW01xNG%=y9B>cJWhhzcMz%g%}f`#jB2JxI3(A>+e#cgQ&CQeN<6x0;x_ai
z@t*9M{7|rNHceghI{i{i_o6?evX3@aChUubdX<{SL2VBKZjuz;V2SM1OJmCTr>1z=
zh50FxUkJj9DoqS3+!sO3g9V0lWOTz?{7o2~Jx+{%lkc3AkLz!(9?20b!wOC1EJWpZ
z0D|%7J$>u_)04po$}4dFbKCB-wV#if$BQ259W-$$p$n)&h>--Ic{`)QpYN=cVbVGg
z9v9<}pJml|5nAM8yBMWt$K^0ebW?MZz(i6UJ6uMuHMw><KU!=_Q|(j!w1X{X+};Vj
zCXqC>kF>bR;KH_e9&ja1Rre13dFY+=&V|Hs%QHX)xmLSPBp1DAjpO^7#ii@L`g(zf
z4B6hSbn}_yY5VpEh}8Gm7ozxGzpKdaBjO#e9A8-m|9cwAIQf+$2R}>GDpB5L@08bk
z?-XoKBw8*ARVG%DV;*oicQ>V*VkHozugtTc*#C_185ekxkxZ5-8ambbA60&gP~zo7
zkQ<eGkP!42+^GaLF~|t`;!U_o8<4i1O{d|5tPp)KqOK$Nv^s&_MUsYz&FQjfO*KrM
z!WRT{?FYb4exODC%p-8oRVEaPFK3uKf5+f-Kjyp}m6QR}!2EN_0doYn-|~l)Nyy6&
zW3xV+qm6`56;u+UvEk>+|JY+x0o*P5N2GUyeo+?a(cv0O07uR(KDW~5b*h)h%%hk1
zdvGSz(@`g}`sR0{ZC(bOJIMI{d_I8X&)Gu8iXvm&T<Py`&vzyMzzIJ^7c7=*<*x1l
z{k2YrzCKnYaFzmJqYj=arV}!$-v=0{wH}S@Y3K!<Pw+x!JFN=gHe9|1B22779K3SY
zDx-e6IVLw(FIoRtGQ9a@O^yc|n`y8I;xQjnm*N@Y8Q|M*ndKI*V2be|o3r(*7xFaG
zjq)+JXR&w6Ft5vt)iBgj=-3;A8%2CWL_W#Th{+$;W2<rwo4m0Xv{xZNFVb7o;*Kf2
zi=C%C)|)2OLo|V*t<=}|DgCYuW^(47`hP6ZMtx&;2ZH&hh<43&+=s_Dr`Px<`+|3Y
zz%6n80;Gq>1=>)Lzfn%jN5uiD^UZBVFUY$9fT~}Rkbt-Sg<#lQcO{Z4eVx;qrN<z|
zyLx@{To6^R(^Q7)yA88s&o;Xs%8(!X$Q@bk==~RT(W7~fzp)P>w(EUJ{W9oTKi>un
zzP@J!|1|~(me_C8JpzacOY<L2BzFj0C$47}R_U+NA~!FnD@RvcxwO@lD9SML{i?$g
z?TYQ`VSgvUtp0sCks{AG{%IKc1d~4*2r~+A=*W>p{LOT@N9&Bof;!G{<&5(PVdRz$
z?j>>FeYAz9J3GaZ;`|u#w67zX8?|ugEKHK^?-~$#xPmfrC+}RaIB-J5FO$k)r}l5`
zO73~)c`%wBd;0RLIF)IcQ`PVF{zksgs2f+#zm}{oZ{jUEqQ_Xt8idAOwSKj-gDSr@
zW#JM$-~Ig_ni5ScE974l(I2wKYDIjjq}Qq%$8N+ln)^NAOH#@}=l5;b6g{d#6KS3M
z03~%zVT12ac1T3W{j-ozrfrhq<S%84GT2#8W?LrK{+cjL*CVD!+~jR-aQp#KSDmSM
zb;1W1aKE3vBe6<Y___0y*)?+V1_#qq@vG3#qnA+9qyj&UMKVjA!l+;B?OA5KBm28a
zcA<H(k9yga$pW&Zn3<!HB<q3kTVM4RwK3x)i<6yWoIlw`k1B@*lGoLu&GQj%sE}_6
z^6M)vNc9N5t_%U~4H>sKWdknad!Mwt*O|B;nsa0gv7BF4#Z>K*9B1Cf>KCxjnF<>L
zFuS6!#z{oLH2e?BSO_-b<2*Y(<&^TR+m33XvFB48>^ODk8V57!v7RtS4b_i~8p2N#
zFMO<XV%}FCC>?)fxu4$PZ-xDWvE%+2CE}DARHSfLQ&R|f7H#-+aKwhfx#*Ks%`n>|
zytt$7w9gx<!VyvK8K{6nP${_dx8ClDLS(lUDUL~Qi^zHthxmaj-4Msy?cka-Gh}(5
zD-N(Y=r0^pH>`(eAE03H*VXEf;y1;Cf|&1B|I!$joO39+n8Rxo+VIq9pJDa#Tw#MP
zBP&E-o=BQ6>=H1q(GCNQB%UxuejZo#=ow<zyK78YF%)7Fzq=+`=YC-RLz)xE@==k!
zUdl`G$zos#MLQ{3lIle*YyX;Il&7#%fsq#4PXi7N6m+U;z?*cV{{=-lbHq}n)qXfH
zqGIg3BdIc`?mL^#!gnzu<*(dL@v(0{*w<F=vpMn~w(?(A6o1jFled)w`8phlQijcP
z^!^jH&(qfz{_0A&WhGf@)J93WZ9czvBSTUurtEHOOKjg90k5~0f5po~EXP|0xg3}j
z^g^mXf20rcjcgNzgZl>=609*ogZjVJlJxcS94##30ibo>ka8gq1hFnqk!-+fHp{b?
z7ZX4Fn;DJLEf(5G+`|!yEySrXx1K0VG$aty@GV((isORa;#UupXe#Y6R@v<-yD9;r
zyF5nnl(?E(O8gvq6N>fAjew_AV#2o)JoA%(+@P?j-A75-3{RrS0PV~w>8jNaB|}Hs
z=}h$4Kuf?L1Jz=XGPo5}PY9}lobQRxlJOa0GmyVrYHQKkqNJEbsLYGNo8%tN;`o4!
zlualy+8mN@;2=*Cz}M<Me>iw_I(6cBVgJ9(fhUocCDvZ2K#<l4*j?^fd}K`r^A;rU
z8-JtZA5zyMbo8@O8aObtUpSXk%%b=g=zZ`pmh(z)sO9Oki!6lRolXk%ZlCS>bnCFJ
zNPKS58Js99Ve~S{w#2cV)5C`nf~YJ;buwe^`iso#Q6O12@X_;`pFdOjD-H;<1|_^*
z>*@cxH&gOqv0qKg8NcZye0<?%gvP~w&Vjii>Xs#7#jix1CBE}a!e{#}<m^e()0|Mu
zxS~W2;d8pAp#(Ny&Iu{NkJTt%%z6O{f$Jw(71@CuF;;jYLHl`u#r?||^d!EWA5i`N
zlfgD}WCL(3A{c%1u8kN_9*DpXLP+doVV?BT8<ZjNs3!1n=tFAk*t%hM<s^?;^@`dp
z0rwxZ2b;wGhcZpOCKXkeo=7bE$ZkEL{18woDH_|urRH0??6n0f(OjUoF48uOdjVqf
zQR}0e&zv=Vf0p8LO7uS;H`7g_A>`uKb{3wt-;zR&=q{|akAFOBp~H2ql+O~w94RIe
zmh0xMpi^Ns*ayS_(KrUFa99nBK~f2eT{ar~Yw-%HM}32q-3Ad-A1GxB5rbSB{-gTh
z4t^Br#!jf>oYQ6gz)Hcao>UKGi~;G7K3*FA*Ahn+I+2XQ5<i*{PnpHS>j@F~KO!H>
zJL=->pz~e+wYId!O6D_|tq<!vPmy_*smh!NW#%$R$6a~WDLzW<vZorFN|huJoZk~y
zbada2lSb}pNzHTUi=mqS_x~O|N29W$WTG^1{xuo?(WJ0k;yN%RTfuPQ^Jvk3zd2;!
zLC72Ly>YaDu5_eG_q9r}!o?lVdz0IHFo(St52A}CjHTrzYyY@+`y5~oae44X9N>5`
zvHrK)&C+(RfSwi$>LXU9Zr2Bsk2?E^5~6?VK32zT1`05<`#9a->HYt&p4_ErfB50x
z4vLg4gAUh`A2413Vv6@?y!A-MzkY`Z2Y6R`L8z=oJRU(Ni1uZ|H+WV&@LENUk`{O?
zHL4~s=9pq|;g?JOZ;q5ZpR2hJ;%BG6f+x<by<p%8o{7re^gH*wjIL*il}=}K&{xIJ
zu#P>0JL&0rF<$z=sJ+1_@uu9PP$VH0nQkuObdwY1%3#YvHP<OjX;zQ&x_U)D@vizw
zGpXJt+9mU=Dq$Ox`sJP*|CL8LLZjQ9P4qORP~m9)`C8EG0`_*;O*~L@OkHFE(%xWg
z^xQ)GIeiih2g=U?iLYK{2-2RTJ+|*e3Ki83sNAaA3(&>auI(4v8kR8P#>eL9lTBh+
zFy564I1NfvRAvcN4M|1vx`XFT3u#0ElSW$u6TvM-+3AD4RJQpL$uQ<9ozbqB7X>ex
z=XTLz&u$mY|0X&4zyErTxh!%j>!w_qpY!xu5>gW#&F&$${+=ZM;Qo_;qIv=L<?BD&
zrT6Ks(mEN>+>f7l_&5}RpnE4Exy&P%B3D;iaxzyl*l}(PFrMESE!PbtL6*Amd#pjk
z5P-xs#WAT3QqYO=1qgL>Ag*kZJ&Jk!;pBdT{$y>>&*a~q+YX=xLB6FZ$hY*=fI-}a
z`Qr`^U?}Ma2g4B%W%-Fm7*Qd`0&CZN@01LpqKetwdtgm2K5Xt<!Y|OURb)U&rI}T7
zUJZ<=8d@_iGBb4Fx=?gAu!S&^XF3GRL0k^Q%I$650jo(LtzwZp(ZPial1^aI3Y{p;
zkQDtM<%$lsmHs{J1Y{Ub^F$jeq8<@_VbS+ua_ulBhIeRct`d7n{)Pr<oV4@^EB)uS
zJt18lUFFbd`#B<@f&Os(C%f;$XImj(Sq+r~5~G7Q;<xn^VEC<lnD!MLGhyWpIUK8w
zTuX~Vs(--`8U%>2GWh`F6at`i`?|~mJ!$)Rz-|6-y(qa3SDB6*DWC~Vo|sb+9Q?*<
zY6S!xc@>ik`Opd0assILd2+*K7^bP^ui^}pXt($^>+cj?6R!u(Q<%$A9F^j=vIDdV
zhOV+zHLT<7T;G`J>QBmFAV6&EBRLE|lC!3nlIcnTyIFo-l|#Nu5YHGoGxm6;{cO-7
zjN4ggkUd4;AJB46?wcv>-xI;Swt*}C0SIt_jJ#KsGd*p0lF#>$(Ll8=RBTb#l<rMk
z{qv$9BOvfyn$imJms;GCuH&CO0ukXbj-~u@2Za^J?jc}4%hLb2Sv;a7V~#O-uQB?r
zJx7%ejhb|>#DB%m?bqhmHh<=jogFklD%k&TAz&-S*N^i60b0i!A4>Tb1fl!7lPe7|
ztTshE*z^SX+=cebd1?`}9dYh9Q_&2|Nt6+~fkhfyXOc??DU9Ns?4+H$smupH89+M_
z%IX!%JfEV*UWf0gsyl_2&jOQ9TRjx$X?Xf}Zn~P8oNXSRw|8iw^&(rJ(og*1^1uo0
zp6+ptH~NApo-52Be?Ao+%lf^r7cTkg>6z{3Go6^Y1v{s5B4@!Z;uRw8`M;bRvtHzQ
zI)B0FttuA1uUs#SW#Rv5ddsk=-u`=gKw3h2Xr#NlYe+!`89Jo9q(M+p7#azs84z$N
zX+c^_X{1p=LXeR90!ls?_w)O|*axpTh&}t-pIGZ$v?iM&J!FO`G<{~pS1z*(eh2X}
z7yM&8U{*Bi$(5;KYP3f<df5Sa$e67uUH`v+-39~*p{@z6#h-J)aj#r{Qt2yqM9n<X
z=i>FkGS(;Tu}!&DncDE<nXVtx)H}}eK72?pScv*zZcX)l@M%Z6$fNBhC(0?0OI`AL
zcOSkdtxsV`t^VPbbWxwVVO0Ddp-pDA5&#^3IN`%C8l!=?OMA47S3=;NO7DX)gHh%_
z;AG9<ZLzAJ@#GaSNP*!5ue8kw?M}lv6aev#7hW|h-{rz%4#lm-tlts?s3+@PtXFFU
zz3jElopI!3t3fW{?tN?ui*ba`eB7Tmq-uswG7Aoym46@Tm&g7jCkmE@Zvi)A819m;
z!P~cXDkvfwW=7@+&15#?<m4!+b`Wd+Pdf?mMB0l^{FJ4l&I)!AEDX<;sXE{e;dXD3
z2SSCch=bO3PGOtbzz<GK!<d_Dk;FXXO(5WtVet>FvpdNn=fE@_i&&>B+9btcgbUqJ
zX-fiJ2r7Mv!9V>SoaSe--Ox(KG&m-5z0Ua2`+;YM!x65Nxqo2sbW*ebx=YH#8MQF!
zKkg##-Ygi*UZWMC(=5G)L=zwl3AH0IPq`orBb+QhEX3=Z7fmIE?Gg_YwJ9h;^8mMH
zbV($I@xz){um202YGh8LlEdBEL-0lm>xzahvE^zy8%<uiFV1kVitbf#6LlWHnYYvK
z9lGowXoLRO)}#i9ivw?^{ORjy&O>+3sNJf08`C<*@`%lti@#{P-lED2yZ?5p2wu=}
z#y&yvfs<PBsINzH-0LK=@+%wQ$m0QyyjsCnxVKIum<L<k1o63|fw~`lKa*%yeFYuS
z{UT(*sQq?f;h%>r$yeUAQWi9BRtlLml(O8~4{uyvgn&Bn^3zpkVvwVHn%W(eA45r?
z`*Q_XQr;++UbqG_n|O_|aZN&Wi+Uv(FzK}BV;B0NA3p}|G=p4qo7W#DweMBjTtm9{
z@VVk*sHGbm-V3Wbf$sVE88K<%p&>ltnSJxOjM*S{`0(S7bk|6=$<KMPx07p4lypj#
z8We~iWDnl%BU3mX;x(&{MUxmC(zX5Xr^(-qu{Fs;W}L1-t7J4Opb88L5OzlDaqjHD
zykZR)(I@xtWunoV1e&#|hlz`y_wikQ<X+kKAQQ3XS95z$?xPJqYv}%ScX+)1^zI|0
z(_zdAJdo9oEtdFfHrfVPz9OSAVC;I|2urYeUHM$x#Y^y_BaCI$qoR{a(~z?WQ;ir6
zXlOP=A@ANE2mbogi!Hob%M$$dg}xDvfo@1C<#oecK}_HeGY7b<%r>7oHa==G{1hKu
zpU8$pqD?cvn#|<=bmOzCq*-t6G=P&R=-bKI|DN~s|J)(HfKlD;o013?pO=StU?_}>
zr=!qj^eT<`f9uDN@hFe~X7|YBQH~TR<BFajCyfn0O_PvgX+O@Quclj_vjn~w6C&4q
zkm3!Nt5MjZ3BXFj!kMTfEO=bsYU8Dy|Fwi*X?~Aoiz{Tn^D?Pl$w*eB2f5T2i?`C&
z%=H8CZ2}TwaoOpyC_gz*>}am<jG-F8Wz|i?)Wv;=Mp%oFznuxg5+4jGWG38BEl;fO
zu+-eX=GyU<JmXNt7k(kiprX4?58Kr|@?Ts>kCE&A`sM#_a*}5GInO~b;+;67O%=f-
zZnSpToz;NAjgx=7D!m&xZMTC0YVn<NdHf{a!w%|MlvD>ZdI|til+4EdWi6Vs-IuvP
zrAzLU;~j;TzO%dl51n7#`$0#+OnOWk(I2m6Jh&vu=Pp=M^P*s%&5v)O3fpD5#o1gs
zr<?coR6o<QD$)p!@piv>-t33w1V_Mh0o|;T>x&Yi4`$CQeCaFkQgJCg(O}~64ux*^
z2imvlkUH0+tknMJEVUW4=|JE@h9;}rwlc)Z`0omYL+Dbxcp&94WSdj=Pv3^YzH;&s
zR4oLM!|$wic~f7#Fop(<gg*CS8&W5kD5m2&lH*%ZETd==@)q{i0OkeIw?GUzOz4x#
z|8dK3$G6V!OyG2x6JWBKf=bZ^cG`Jg4T<b$;1u0jFd?SYORtL7PhyBKVGwZl0n<@s
zz?e&SqPUx}Ex<^O1@unH43mn43EtgjN}6b5c&`Jc)TWnyv`n04e0YQY7tZ(1<i~HP
z12gV-zb%aly53jpv`*B&9gFzDXUJs!!}NK!$y>b{xvw(bho^v$&MnO>aoOzayYOae
zHF)$Ez#O$ujwBt=Y?w3fYYmz=Pds4C=co^g^+^(Xl&K$GnsCx89|`b9R=RJ3fkcKT
zYdp&XD=*qZ7lUL;U_-N8$ydx?F{)QWIpZ&bKv2s6^j>on$nKbe_AYU?wVXs6c~=YB
z44x9BQ@N4%nuAeDp~V1V_QYzeLa_<6Y=?GNpEMWD-te%P^yIdtG1g>>Pnv)>(kRJh
zt3_5As40t{Sh1+|we^kXm!tG00WzC#SPbQ-pLNr-L}Z_MshxTj`6cZYNX`BD;8p0j
z_3u9SbG6$2J)B$IV=~E{4nh|KD92-Yw5FBF;#o*f1pUg~?#|X&J|06)vj!4+)?&4^
zq)tG84RSGz0pS7=&svs)Z$C@hiNshFE$=79A!)zuW;tz?p?eBGpevA~u?o>nOtiG$
z13~Y7_}}Dx2n4KoK7DrvW0r+f!}~Ug#ae!1vw?Nj18jd+SmS9K9B}5<VWx!#nY{DP
zT%nXR?|=4g!@lj{u@<hAs#^+WpHeQ!yB+e`G{)*UboeWz;j$+#`W8=4qVb+H+~sZG
zoaVn3K5<m|ec-5!!iy%|&Cea)EHgW6tdrymo2+6fCY|P(v~rtp&k*CFtC{-*1~I=^
zJ5KXL)7Z4kFF@otx7aFel>eBazV6S=*bw>XI#>E!fYl@^h%=(h;2P-ODFNj5`#?U5
zz6wu%kC~c+uGf5IIRG9)q#enXQBm}wns-emVF?W3kQ`GpSZz<K1(mE75NT_kW~|^$
zq7v?PE{?AA{4!nS#EV|tbK2OA<4GT?Vu5GduxU*%D;`K4zaZ<EN#)uJG*0F6+~Y@2
zgVFy#Q7wZ#W5n-T_ANeTL}W$nx%;o~<5IuGsDFTNFzIFyhG&@oT9!U<?eu<No-?2w
z?*@M2{Io*+1`*Vdx+w_%6k^#?f5Wm_#+D#FNQzfdQkMXax25bY`?vNFY>or3p6exZ
zn?1?2YzKmbRj^VcVP-`lO$^hX0y%bZ$i2vNOXH06R4D^e2`vJY=5Ym^h`LlS)B|Iw
z(wXv^IDuYJ1M=k>v{3~b--hv-K;T&J9G#fQp16F)!vC&r67II~(iU!AkN!(sKsu*>
zmDJH+L71+F$ouh3HHaAKiz7*2E6!9@>45d=hXL&*ex?MP198iTzc)@!&!^5Iz3FT?
zf#{mh7)Oko3(MDZ9c5tJKL5eNb0;sD^&vEGJ*Vw`E#4c`Oh>`Wp)QF}&iT5$`VN=d
zI8lJ5!B?w5OE^FEY$R@dQh}Fb1uTlwE%~CN(+(ZU28B#|=LsZg#|)jni8Yi5bh7A=
zNeo;p;oi%&X=Ja=Vna09bMehF_e|f+wN;_+QUb^*B_>=_*7tXj62wJ^@$QBEqDcRB
zxtAZR<L6$d%bEM%v+pWAUp9*<omly5H7HlGM~98HayXMX5e>d^p3RV-q)rS|WL&x}
zZ(3<dlG5X@-v%$1;fm`}upSw#4n5b56d(>8WKb1k(Jm=Zx-2-Un9MZMvV3A+Ds*WD
z<P&A}<tQHX7cg9UFrX^?f~KVGxrEo=N{jq3mmY{`28yutAa9+uvDP{jNuGbz8}g1<
zem!S>9*v3WI{bgTs2_Itd%(3nGg4zm-2+arz{~3dLzQZl#GN5NE1E1(Gw+`>*e0S#
zqqQYfMC>H(7a6<3sYg0wE*n9gYPx!R$?n7tJb$ar{r?lIG&zUn9!9KPl>9URVAks&
z?e(1OAoGQNy0vN39@Lr7BbtiqL?j`9_LN9=oNLT-q$897wHwd|US~?vKA3XbQPX7c
z*}GX8xos&C%UK1D@DY$^reqg8UcPpq8s@10fgZ+qC0%Di3A?1Qvx`AM1ZGccEC;%u
z<1->RMGtN?jPEV^a5_S{A)!v;StJ`4ms3IYN1}sD1Bw(<SPTJ&ID1kKy~&bg^{b~n
z>t&RNSl7~Iu*Z+S-n%Db<+#jv@P=f9t&+*D|Dlh)BV4qlT2Fv^5#)>cfa1g!9NJOf
zqZtGGRbp^^WK-5eWn?@Dj4|O!U<HsNB+k#|){d>ul4z*v5YMw)EuJ}cj(m46c}B(a
z<c{F0{|g=F|CmvR;cmeV-fN=}Bp*v?7e#;(12vRi79muLmy!Fgp>qtAM`exQfZnM{
zzt_1WLPiG;AQ$(=-HrAWR3z(K^_A4=gWW6fN^oU(&IBRGO@c<ry(g%6FglDru772y
z1WtuM-(X!o!_dD$1;?LEqTtw$6fSSdEMDVu$-jI)K%>tfR%Z&!LXl~2*uIk_(4hqs
zVVytXy=L#IDkE5UQ6+Z@E<qe;Q#3)sZ!?<)avpCxMBk-Esj?$bUEPoa!Ct_p_w(B1
zVEbP9PC5a9s-0qnR~Z2UJ#?V~Uo?IUf-O#rTnUtHfc&$iWTv?U8jrOhKIeU#tB=vl
z=M^ENEReOqHoieN$EU-KfHzTgvqEz`*lZGeW&)gTnpyO#xoX(c7#ms2@ofy5rdW|6
zl`g#8ks1_LJs%Uqh(vn`ufElG9Lze-MKo{f+xzGmn?9)3f{|L6%mrBnOtMH7usmq7
z^=W;C=qfZSX!2Q;+8jb9CGK>a_k%dz{^fl|OKwk03eiI-#!-g$%&KX{iL)T8GP_Lq
z<e5o98czD6U*|&0HjMSH>7BUHQ(6~M+Xq+?{i1^ceW~$Gpriz(&g1j-P^Ykb2QU}C
z_r?RCN0ieHiDnOym7pAWw58;+l)7;rL#x!0VrB>f4~5DC%tX?m<WHjl=^xFMab#N_
z6ETQtuwf%Qs1OP4srgR22>oi(ldo<&v3Q}AaCW4ykVu=2!>@|qYi`NYORRhV{bn_Y
zOX`6A9tYZ<S3uiiDt6Ba773yh!wRwp%`{3~J?-~`xVTR-RbMLVVR6;q>(DOAQ+vo2
z!X@V(%~^H~Z2L{cy0*#{_xga!Tb)80X9&6EtnYQQ(`R{Uj&UhS0?ZKXy%iX9X|EOW
zAs8;tccssNoghU^0jUFH5lsV<Nmi?-j%E|v_E=VBrwgt}&Si*}B!G}P&X&BQ@QHDJ
z$zfb^H56mQ<Uw-W!j#bkZ4=*2^D{1GHX1vYA}vR-65x7H%Z~gXRlbVExZy?@ljFG}
zV*R`*!lnPB;BVcTwh86Vz2MF!qhAmQ{+PCdx#r@iL2eDI|B0wR%7cOCae^y&7GJMC
zCJP92Lhi~Y{QTSumxg8t=oPagM+DIKzHIC4vG9=hSCwOMv9y4#Ow={@%lm`3VR{78
zs=`B9R!2#z@`Iy)kB<&+8{So|fxC*8nx+O2kBp#!*tj7R3!3HTu(6je7!~4i9D96p
z4XPTkXJ890;W9RN8*E+zXG;Q9PfCZ@_lo#C|GX>^schr({8qmux7_SIxNWf3>>um6
zv~N8tFw8%)@MH-95`An2iFA;%_!hw?HNauS2m@rttyHo>^uy6Cv8jlr^U#&tIkXkv
zTkklX2eSPODT-j@J+Ic!w1(V;3J1pr(s^7}kdn7OgipJp&V-)v-zk{U58QFeoV4J!
z=mjj<kTUI$!_A3(aj1Q-jn2inClwkR77!YE9+>o`vV0LuU`u2KlFDVUkOQ(O6)jX`
zwD(}yuZ{#P{E}?lsz}OLvT&g8REE|1e_sA|FjG2Mc-Hv!7h=?y&Fmrag3(nKzlj_1
z9R{{Z(7fi(ku17i<^L$$UH#o-tvDOK{)5ZInI6AE<J*SNHxsdCML!Il)@EY({0#^O
zEb`7umLr(3#p+j2r$+&DW^89KhTBn)kB&G-0Mqh*L&5zsOK<NAN$VuFw5L&mf-IRl
zRv^TNPI*oI_YR6Gzw`+BS~9YWc?Q6e7+hp8M~3$ArX4p(FU%qE-T;F1xNvJ*Fk0&Y
z1^eCgWs5htYb_UKv<#kX$$5vSJ5k$B*z`cO-}XbnPe!3uB$<?>oTv>++y}ZGO`9jY
zSv_|iACuCuA?qTJsa*d8U}#Yo6-0X@ZA%kC)k|Yt5ALm%rUSMx<unu>%h<B$hLMr9
z0f3Y>de4CfAqQ?K*L*vUI#?;)n9f>XTyJ__WI<L_>TPO`bO`JBy^u|RI;=SO02WSF
z3&wG#0hc@PHZ@=5ay1{R^!(-Rj0fRN3w-S2xfki*lWX?%B3B<-YoyB-u_1pXq!;yN
zC>vSn{BTP?w-Myd^GV0W3B+IYtwr?=o4xN~0*GLYJ4vx$c%dVP$HYt&r-A=o#7Zxq
zwPU3weK5d8uU7S2wy?eN^9PCNg9yQL%WMa7@oy&LB6eV4@nIQ=LoOERWoNMXV2Gf1
z@7WUlC#-HcCZ6&ZV^!drvBR{{S!ZSc)Jt6g_=TJ+zLrx-*6^V7fz;*~jZ*q2om!sd
zz`L#nm*`JttJDA@d>8~0;ud{W&#KZsDbjm%<uo(J<{VsX`Q$}(grR3hyNhDxf8Pe{
z!o|xW^K~?pvXxOFd58XPS=sZj7xzyHJ4k9Fe)(*HE|nkUs&t117$BGb^`^G%AqW`J
zp*RhTh%6;z;{mfP)Bk42QXjh9W!&3r_upbcGU0mSe$?Yy_j<Q~M*7@R107Mv*Daw2
z=XhK9U!!-KG#`klWwNG9UC#1bJTyOesHQW~u_qGbn*P^4NdvHuZ(-@`bPt<0hg^`%
z-yZRqz&*Be9t?0yICJBp*ku_XPRA@N)O@gaa`DRHE!@GGCWq~x*o&F5PO-&Xe0Lgq
ze3CS0%U9xDXZHk3&ur6Jnl_m9HvW(J=upEbBbmj$ERxcHIMb3Fyf%q8V3cH}una8f
z?tR*=QVNk+o6CVznOMe*f!>sL#}|KKHWQgI%rW*)|JzOQkKRqrA2*8uDB-$eAAV)*
z`XhL=*Ad_qfRXu&5o?W=SIQQ)=d;<2D`vcq5_!Z_1+#J~N^0&$CDmZ&<1Ib{ogh1V
z|C1fI6<f`3JMLx-?vOL!!NSE6bYIQPlnrR8U00Xg|E)i7*S(Y_wEU3=KMti*%V~~T
z(<QIfHe;bL_i>Z`jj&+DIK=}4>ljl5veoC&G3$dnVQg{V<^260<6G_Xg*hAjPL&$~
zdGtT2UB%7mz~OBkYbGx0+FRw7iC1E&X17UVSt%;L!Z9!^V0Lf#b<vf>?gg6+Go_M{
zx=Q@~9g<0v<R(CmisTMpdpBX7`)#4doOkPYlqbeH!ATAR?0%)e|7=aW-H$YxF;)h~
zNO^T5QbZ`?zgu)1S3^>+@vE-*^Z}V(C|xe-u`(SG-n=o`Qi8h74qWi4I5Qcmyt896
z92y}1h0)vk`a3nFs9Rnm8?+)B;`&(kk>6@$-NE=ciC}{JmO77?p|iBEW!8+XztdT0
zaIZx3e{whoitpielU<(x#G|EA5R|r`m0q_dK%S8bGw1^BaI?ZQT|4hs`Tpgcre~J4
zQgM}8vFq+xRXlN@%Q{i7h8q}UtXqkJ=0z%b`F!AM=`<JtyiNEFcSw(zJ1FmO|9PT*
z%U&S$ckAzNpd~Q`DB#Um3)6q)VDQQEM|+TgC=$EY{n8WjnF0{mP%+})=-M%J(;{;S
z`Xj_;1+bE^W=Fr%J1q13k3zZEIZUMH3soHiHlc0L_-&Rbh5l4P$AYZ1h{1BvT#*DM
zd1{b>#69-b<*0p{vRhjXcSFRN$pgzJ%l}ec-*SFo^kBb?Ih6`J><fP*-?(1BeF;P+
z;f-VL2VKJCDfXur@%*U^6J-w59*wb2viLBI>pngGeoI85FMSiiX8-GoqMSX(@S}Re
z9t#Xu`?WpVx95kd?mujRXL0d(?g(1vxzHMig#eK!&I5GTpOvHgtwAZ`&yXO4S>gX_
z<$JC{_>$tkTN(FYkO5@>B1I!B_^MrG+9Z~g>#MW-N(`ke{MiuS9@wWhO0SSn+;^mI
z?Oq%~oh?0ZCB(@1sv-7yUOP&`#-S^lq_ihb)8hswN6UXH);oq>nhnWlB2z;2&&5mu
zCyT4h<x29f`y@x5wX24HYTnP;kKAN!WXb9=%gZ8eMW$nm$x6a#`F9{mr)UL}E0QZu
z(&e&h>27ql-;f{TF~8(kJjVDFAmZ66mEyU090e1dzEsh_V0dF%TA^EIVF+A*LBFLM
z5>l9g+?aVJ0oe8U$Wj>FPzPF>T4tl8@vUBtsA5)n8O@;(sFl;=2Jwz(-QOweoE_kq
z0Z}-16NIeeF;M)fhDzFPXH0fvV+jB+F}w?iWKRN4>-t7Os~4<62?(u}dVM>)GJgL#
zB%1UviWy|*HS~9gM}N>lHV=*7nTlXV%!%5Oja$TARHkSBX>YuLKI!LA;7FKjqqK>~
zpvGlaW4p6L&)ZiBfRB*QV$Rqy92mj8j^;ZR2Zn|fv6<<7y3c<A2j9I2I`vN=G#%ye
z?R47hb0<*q-yc0o*W}ca-Zg*stL%^-szV`8MnI8Jy>I?~+E}1}Bhp&ZO*kNVK8@t1
zq7QE~)SPvjrn57-kAJ4>Yn4k1c286G)bdNOH-=3~T|Z|}O{FtxR@ma%D*fpBU9gZe
z+KB7-*9`sJv}ZCHF-qzJ1Z+sRXq@LcjI1O*+j(*Gk!0$jmOwplLR7bBdvSfRack~F
zv?y8g!tYq@<nf`5b)D1*%i^(Wr$#Z3RX5HPc~r%{&fIPslbPf{OE*tIuA3~V85}?;
zMxku29tQrUDdjW}tRkdEO1NzrPs~gMc5DDX(L_=FBW=Sw_jPAXGL6e6!=7P*S;U@6
zFLb!mXw)*Xhdj1&_q3(gJK#ITIVm0(e8VqTc|LBD_FsDG99MN%;mSPocw$XP_@QOK
z?tO(LYtM$i<M88%sxA|cdZR6qpSf@5Q^Ik2nv`m_94Rin9-Z9cvm<Aj+_Q@d=z%{I
z?gLUT4*})`!~Sa#2re+aQ_X#a8QHuV8QUeG7WC+|oPT14=P!IX%}^axxuNCsK*4v9
z1=0;8SBL{o7Y1bGEv&XQDK>etoGmB^@qDTEe7&}yT`Y)UYc&ZpcK^RU)0q<9BxgIv
zuO)CUf4W$eIO`kdA05k3Yg5c#t`sa6dsCaT@UYi!s$+yjd9A{hNFuZ>A>7?&c16KR
z<?|!Is`g10YP%(`pT*<t<yjNnb<MtM=s1>_PjL)$vhuOUkBWS34?zKP`n6K&=c=XD
zAFsphPQ{)Kw<$84|LUJBrM(^5(wohQtKaCS`$hPdy|<u(a?)@hUpwFq=sa#56g}B2
z^T4$nDz+vwaw;iN)uHt(Zg*t%6sC`k=dmS6IXm&1ZDh(cbmp%(Rr-$6hY*5i&)ng_
zmS*$70tR)F^zbK63FGZ$s;i$iibM6LL)Yv9&)x@|RngJSo=<}v@8u@X9^$dC6q?qf
z4Gft_B3)YFBjnkSShrt)V4A)FF##2WIhpReMr<{T&wA$1*Xyodn7RJ`y*>V1Y!NPK
zQaPibP3$39-rG>J>`dA;%!bq^!@%M>ar;CL0)<&8|HI97TwAIb;1=}0M=^Q<1_b0F
z%^2q;PgI$-jo}E09ZmXfD7>-e^sdN`X#RhFo4i9ELoO1d&;3DJl&qU_ju#ThKQJKw
zj|e>y&yqRkJo4w0_!miLR)2KGyRc+7Bme_a->J0!oIm8SI7%`I$U4wrZvl|*yj3yS
zMD0)-jWz{<JL8y6gP>0Ar2D5?boDR*ZNRo!#bN%-G^Fj=xbe8hz|dowQ`*p0vtNF+
zz{BLN0~Cy_x_rrl^hg0GaT-Q99*?$y=}>@^mc3VXQ-ZR-4rou+l(Z=LJ$J^#=~O`T
za6~ut7kKT;<a<UqX5&ZvYPCv6j~97=Du=4Jl3uz0z_l8tn6LZjpzFg3z(tXty!3=Z
zcDB%6&Y%N|gB#DnmP(#t<IR+}s)q*ng$E-4{fObWY+=E_Sp91p^}J4Gy2lonsK68n
zC86|CfI9cbo(<4>jSicgJ`nk25(5GyPgZ&N*>&dZXdw+$jS3YOF<up&(ohs0bH&h4
zuePVKv)o<Bqw7YQ$_jnJGZFnFiFOaMPmZqBelUg#G!+;AZ$LMAvrLYd(XWac=-|i#
z5&Mep4>C@>7q(gAm$;zTGxg5eNR>!B^O>3IHA0W>?c!BNhRjm2cb`EG#HLVgHotIR
z3-M%dSuLfl1$_IZ(vc{kM+lfNK0-2IN5C3c5om;NY?MMi4w?1Purs)BQ;0pQ`>(6z
z@103Yb%zot5lJ9I_G^l3KYw)H@21^d6Q^&wqaGGqKj}4zxf@M`;$jyvCHG15!@m_C
zzhGZfqvSA|1~~X>+c|6+!}5iL*pY0BIlzQWwTsiiW7GJqf-mYw<V&=;XWh0mHG)0S
zstc7>ve=2Cu<VNe?oTC|wIfaLgMMD>Z0ch%{)?CR`|E~wI;;-yYbBRAY`29Aup+B?
zLu_A7=&nej?qq`m5l(!d0A8&FgY$Pbl>GmtkU##~2|`6kFcFcGd!tLu55I_dXImi(
zUg-p_ae|(r@2hPllSQR?)W4{1cH^?1tJO<SejZ0D-mG^OjEsthvy0LR{+ktqZOfNq
zU^c$KJT5#>$lC8-V@6*X=6*><sZGI6DA^?&T5ED2Hx>JPB}Iu{#Jo`m5Ik2G@eFH*
z(%tVfa-goZteoP7eC;!cXYtt@Ku!Jr74acI-W0Z|e=X<L%%z`42QbVLG#7LM?s&XT
zZPZ!`gQ(*$rLbQGgSz`HGmmFDNZcPy3fB$^iR8M3W_jf5&~YY9m{L^Kh58*Z;iOm!
zorOWt<uE@B(}gy7j4+6KX%Rj)k$q4wZg)$sRl<&J*PQ<CM8ha}2u3ZY>3fbeBfu%2
zN<JXJ6y9#Xheyklm7EN0O2Mt%kUQGs)omgdChoz_yH$Cy9dzI8J~)vD`G+epDp*4T
z8h8bH8Er}Fxagn2*c&MjMDz^_BVs%@SjdN;+n!2hLgr}H{726N;ylT1aMjiPSLL>p
ze|Iijw>ZE6o&@Erg%Vf|_}D<E=B6JyJHS9$q%SQO+DG16d>rlg@)>u<s1OKd$U?bJ
zzuoM*G8gCiuA&q8=Fa36n9J6D)T@*zl>Fw(OA2i4FeqrG7Vq(RzqTiBEBFu+5k2K-
zz8B^f)RcIj26BF_`##d#=99>l6S2b$w*!lFcp!2o6Cb87MLrEJ_hWH$IT&TyT;1-4
z1%5P~^S^HU!`@6e=o7zRXg3(YPIk^Qtcg0;2z$8=d&yR%LfR4d0FUy%7PC?uOHWDQ
zgQ7_G*6coUPoE9X!L0rH<lH|8DVMXYyL+Ky`N5j?Sl>^>PCDMohAodQIPG_wEjF7O
z{NnPQH0Xu8?lMO_7kN78$DTrKtco>AhRvLSctZX6i}4T6ZQq4!)uF4{i6B>AuVxiT
z{Ng0H#q5fY;o*~#4>LY+z}XA~Le^1zuNQZGU&XPU$3OaT7-%<I1ifcY&{61i?R=AX
zD%zO5B_m*W@%Qk=>>uxo^R~gFpSCgIG+<OjwmpC5Ye*yjX3ef}ye-jYeOocaQ->|t
z>~t!;>J9!Y_M|%GTJLXsGk=AbPhNe(h?D%);_`6?L5Wc`K4fjTb&-w3<h#4mw~Jc^
z`(+lW7=L-zqTCX(f|HsyQ1Cf?O_MeE*3`5yQ+qVdvz>c9*3}=Ld!j}0@4^I*kal%`
zO=Mpv$@@whnwjTZ%d#ps=1@}ss9G7XO^o$(X_`RiI(=gqWs&|jfu}N+-$w=E>~D}S
z_m6(D68hu~f8lFfIdkk)^%S<rGxnt19LcR(t6#>5?2(Z|^Lu})*juq=*;HqeI4XBv
zuE?6Cu=(Fiml}qf9WXl?QAhkeSWwXt=dB}BWrXFRcFe212O`ykvCh7poDa`G)lhWC
zl*n?QD&W<jP`%butNp1s_(#^7v|S)0+5>+tPkrDZ>ikOQL)+hv5A^~{bkdz)PZyIK
zI>a}H;FXZ6TFoxEhTxZoN8h{JVX@}bS0KhZv~#Rp0x?>6XTq~8&iS11#uS&$*Uc-6
zSOep42q_O=GneyLTgmWp6Sf(f%!PJJa46CQ^20am7H_WJCOkQq-*Y2(Vsv7-#t6bU
zVGn<3`?XgK?;^K+$8-NHmad!iORLYf<pP}R1U82DbvX4mU0CP)UI})e6!4g{JGfmM
zbsM7wHkIA_#QzNh^@+DWs&S9C-5Z2J%83K-OVGM0$+jK<h=V5d_am8Akrn*R=tm8u
zml7R}M5>(!qi<M<-LE+{fRryLJ=$lLGPn?1xz(k5gv)xR0v{GX=`nnbCag?|PN(3N
z-}HA#_L!xl9NH`|e%O*DZtqVz6lq@laBn0-WGE(*p~p^mYG}P!m_&{1<#Y}<3<d2)
zW4F@fUgvo<7phHma*_?aYakmR&D^r9r{dkR>frOCe93)s4KZ?)@-@W~H!R*1ro)Ta
zJ9o!tjY5&xUK8{BRK?lGh+^+qS2^L>wJ3v_SM!@m%RlmK*#dB_^r7H(nZP&k8N-~H
z=xA}?D<73M<z!MAB$;b*ha+`xW|@`oB>Bl(a%Ar5+N%65X7_<*BQu;ZO%40U>%v5W
z6889q&IX7%OI}#g7Xv%}$l(G7=E{!?0m)_!91-m(<61t1hII6Rd|%NC-tg0PR~nl}
zB!_OBLC5E7+{*Zjo&j{h=>@0vEg8~DE%CYQb9>CJ^eNNVWVJ)2l^f|#F-^x=LMi>d
z+~3t*G1gdRQ7i(J``<qOw0?-#yh}{4O6a?nD8A^p(Q4BM7Ul8*!F!Nov5tEXxdkid
zKMXxgW-IV69LS!@xk2Op5wqT2#{(s+>s^Iy+4(N^VfXs_A!es7CNe*sA3;wdV;?FW
z{^B;Ppvd$^<@^aEr4_tp09QUMGK1cy`1_Sl*WkUwP-<0x4h}RsOH1x(o+lY3ieU#&
z=&7JG>T^HzkT<ayPMamPvsP<B-udF}qN(q9HDQ(*k5*$#gFNLoYKK1kd-<6!(z`__
zrdf~<`n@Jp?U`I=^F2S9_CMY)lv-T+l*Evf&elrK@J^}@W3^glzyCd}JVA2g75}RX
zQDc6*TSxB7I^{9Pd~Wk(#1~#esn`0mpEbGQSiJ&hnUJV2h?>*lx7BSwE#z2T;I}At
zq>@1KkEWk;|Iz$2ISfZX50)EUqq8&Z5`KZy)-p9^bHO?`?T<F1a%+`QAnnDQ)*z!a
zbEt9%A!i9_ZqtmWSBZaMgSAsDGGI#_pTa<9O=4reXK#>oG-X7+FlMuo&5)@~R&z<f
zIM<Q*2kuU0;!u$_or$1vD=rAvvHfn?WdIdT|278-l=ku7%%62M&7(MnPA|ZnJl9l&
z$8@(Qe<f<da>=2xSYAAn!e;&!M9vWM0tYftcR>B4F5K=W5nP1Km1UEf9G?!d8Gr>3
zrHQKs8~Rtj@<uV3=s<S1W12q;2(!sx{oT9<gtS}dd^OgY6jg6tS!UX<l+B@RhDh4i
z!Q;MO)g^m=N$}F$h{9T<Ff9f9#~Or!(2GK~_P_YGSUR#6X-+s{#Jx9zR=FYNOPHDc
z&;ecku`SH{{-CR>X<r!87njEDx~wWS(r4P160$x46NECS_Wb*&+7?v0f;eBqM)eY$
zHavZ>^7Vs}MC}L@RM2T+UUUO`-k=Zt;(nQfsbl(|2k_F9{P1yqRpDSO&nP{Euewv<
z{!XC3Ek8v$ZD+dlbR%Qw9irZ9(GKGs_en3DpEYlq!u+}&-p`3z6!*T3<`lVV12322
z@gY7M?c>jVw(<h0hQ4y7CArCAU8`)33sTi55PN*%C99q}HE??13bc<lrP>d9mOq>B
z%)VKcWgl%R<|(Jzdp?_WbAJcq*zuM-P+H{{H6UOEc_KpLS^fG0x=Hz`a)3{tlv%|w
zFfHrQaiintsMVY5@;w7!uF>bW-L5R>G$CEQ<(tCdzvwIVzd;AiTZi>hxQ<V`;D)%~
ze<&&H!m@dysK$rv4%cYju7?gW$3^=LM1K(M?vr-$4v?7frG!7Xt>8)USGs4F&gQ(d
zPC@MT!dw*ob&Hho$C0N7w59e)ak09xfoCnPEO7PkEb!xc71tsfTBn&Pn!)DUEHa&-
z$x7?^B%tO6_uZpvU{CZfYT#YXIN8v>9~X$$=~u^0{n-1thZ7x17r!Ad=ZZ+|BQm4m
zl?hkF=(W`phk7QkW(=5RtBjMeZ?%$~)_)yTv1XEDKalgCOGVA6cklbQ<7WF>o(g-S
zjOdUGeu=<Wxw5xv$%~M+85qkn9@DPr2F{3M_%IJrn*tGuKG1MV!wk0TsJ=S7>XUAL
zlvU`q#7Oe-sSR&=f)ks-kPAED!=yUQ&ZH3y{Rjf7Qq8@Zz0gIekwV%rSHb*DitiA9
zg+(7p1)oOa-yS@MK^!RddPA5(Cyy86>87BVSN7B6v9lyan$@dKv*e$3JIhXt?IZbK
z-@Fxxmrt@(R@Rbbt>W%(vSqjhV{CNYG6Adp^0G3^=#K3Wy`Im%4V1Z*%@!m!y*Ap2
z29Tns)Ohs`x29F05puH?dt!j$WI5NAV*<W{u(iwkZ@>2~n){KIa0Dl2KS~wptTY`V
zj~RP|^PH@DoMuOBx`QM2oW{47Mw{TV^#<M8LZ@a}ftK%e^V<h5Yz3N_yB6x{Muip$
zqy!;bEkBSNdW2QME1vhdupv?(PDed`2pzQk8!WSjZ}Np{Tnh$NUFJ@0eVdZ~a`#tk
zhqq_sVzy>**h_y8?X#P2`q{qf>-YOsoPP1l2;!~V_tt`w8_URF4I5;p&GV{E4e3Sz
z?Z9vDRBY)RS*bXhA*Y}p;g;V$f23>d<9?V?>7b`$rvG}pp!^A7TA(}DjrKkZd$vON
ziJ%-+BaM6s&}ZJPV%^;FiPAGO_wwUQ542WNv~?P-k7_aKEIc0ft){#S%A#-E{bf<(
z{wn@SdS5}(#BFLiqfW0~Mb<8XlZ<QHz@MnjglqHVZ6>-a=SD9{4)z!I$|y~tBO2|-
z^yhFS?K7skTc!8s6Vwv-3II+|1jocP9euQ+f!~i*ES?23?!Gx>hYqVgeLi=?&mJH0
zXz8hKbe+2&KHTlQA)$j>ntZ}T?`^rd=X$NJk2*xYnj~VbvB4cG2++P&_tEJJ%^DT$
zhQ&Vf>HUrWTJ7xNb~N!uI^T6?wCF1y?;DPLz3$2sAt5Q6S24i3p^{k6_$chDMydLk
z1mSQb)@_wY(zG1+_=hARWQPT*q)ry`9G)j6dpXHtv$5IwglwD&a7<BF=Bs70RvVb9
zL;}T3uGLIlmsW*+9iJ5U1kRxss&i_OT8Upy{Y$D6ibW@UuGNb|FjVu2Y`esyslk2v
zDHK`1KBW?A!&rOU;pQ02t1Z{;s+=V~jT3gCJuXY?nKD*y)@pITw8UKe9BII;?ZP82
z6#)4P^D0)VRTef9wiFSqWgg&(zmUa~PN--4FtVQ!A+S-ZZJM~%H$YH=Ww=W=La;6_
zdY#6|qm_i95T8G8*a$S&IDvHk^Een_<rIkTY$2c=qnJjEnW69~hzk53LFVwzIOGxY
ztv3$a@@v$dj%=y@jq@g)``Cu4zc)seM+;AkrO4Y7xh~Xw<X>Hv>f0Djo7-TmlJ%yP
zA5Ke;^ZcurX0CZxZ^$5tT_oU3cOz(SU}_jWV8G2M-PnLT9A}NkpZ}!FgMMzjcD%fs
zgGp5%H8j^h=dPh0tu%M=z^2ia&wQaFl=O@Y-9y2kH*DX2l{Al!`Ta%gSuu#HXz}0o
zO>R;{IMeXd2jzSiy`&D5jlCrC^PW*;Kolo9RKq68G?ezPa&KK@(t6m`q30gqQNE%c
z^w+pz)nN({tcKJpcq~5Z#brVpqd&+chcUAzh8|qtf_k9x7c2hV;dzmAty64WS6~Wu
z&`AF|PAdt5p-N!A0R;|MWovM}U_xVw_(#p=3?a+~%<)@~^u8@vzewpz>oC@;D>1F-
zfi3#Jo$Qe^_a~BvCzckv(I-@=VUKchiFAHhC+u!*Wr}(rji)qGU|wTV@t<WjRUXV=
z^I#-iD^+ML?~U5v$hO^hr$nH>UD2jHjCtkF8T7&q5{%vcC}-r{G<K5w$zx9(ig?>h
z(rRysV#a%U(5gP+4O{K4ev#=#{lL9TZ2BKZjFKg9ibP)F>mxS$CcH)p>%vBT55c{I
z3_aRTXY2VAR-Nnhb45`ND*n&`-)@8^gU(4j_MS*^C41rpv`QrFiveZM%S|(NgS!Gp
zE@?lBV`OYy7mr5=`$4{sv#^IvyMOoD^}RzgxxM{Hbj6YRx^)~EI>V?k0Z27GLN(<%
zL}T8@JUQ{v*Cw{hgqbrKIT<jgWcvXLE1^b$&@cYHf|k{3wEfQVlP~LUw1Ua<Z>|5x
zW=to4<X93!+v>slC%$Poc%NV${glXsK+c)AA&^nEBjZ08!yME}Pn<_=ns#Cc*6aCF
z7nnM12N?v_zAaL#@g{%<?Np$_mh|FbwP_kI_Lwl6ihzG~&govqE)&GLOX~)DJ$QqC
zJ?NOdP^&4uQ{>bC^znx++aIS|4_8U;INo{Mv|hKdNu|VHQ=P7%f4|QKc;8+;W^H<Z
z%c&z8i;W$IVr3I!aqQfaCX$jWTj$~v%6}$o1!9YnPo3@+Tr0fhTAZtOlzs@L3DNF<
z>ZikQF%&1bH7S0C8JEToR<Ni+w;mBIHizF*KN`N|xk&oQdbWJ(3XyhUi?w>&MxOeK
z+Dbv1KQAb>$hmj2@ho_IV(SE=PufqgC8om4?M{|br~2BVDUL-y<E{DKZH9Qy^jXqb
z{R#gTrI_{U`K!3K#mrzi1|MCsL*b$4*!8==d6qp^1HZSgg**`HSO|KumhUG&MMa!2
zN&fBW_eQ%4K2NK3scb#O&I2>-8r(-8V?+MAD%+uH8)q=_?Fhx<o=E!0^XC+Ny!=*_
z+%mUSDALs&T~EjspT%|jk6QQK4vqNA1!w(t!dSlGVOZRfE6$yeseR!rQ}W>poa2q1
zTAI4i0^^b3AE^ZD=9lm+cij3FrIcbto(|oZtYVgg#}JpCwbz`lAVZeQs(7U8-78OD
z@gO}PpdTWa=H%u)>|a^u+xCgOD5JIP^^pJktBexq3)`Mz{#8qxcsdvK`=Fh0>mIHw
zRe{@q<?TyG)fae>ZRx#os~5OE7$e9YreP<+0lbp_br-7dwr{!4ct!sHXp=h<DV5~c
z^ZvG0)mxFA-%Py@ZZvC>(mnxMDy}RTLg!ItmYKdwTbLA?8hWW}Ky{zYp~#`x%;^a+
zYS3JT=j~}DLI@VeHBiJ>^-dopWv8O>`U{!55#?^r)$X(3Z^m49z|mRL_90C7jBYV>
zu9CrJPkN6N{9c?r2M0wy3y!?l?c_b9^sgU6=;2lRKiy+Fl-r2^svk-`#70`as&>Jj
zl)4~!{2x2!Q1}XuVpA<|&CnN8<mB^9hRg7}w?eU%3B{LyZrkvfIFpTxb+DY#hOm0Q
zc#zYE&E>gVwJsTDxhiy*Jt?u6))=Ev%4(J+(Sg}zdJyw?JpKAs$)mU8mb{vWEDO@m
zVr|)hA!T5k^}zH4%jr-NdpPZrx6j{(d90-=gjqGWMdyvv==_s*K7GT}?$M%1x8(Vv
zSyKM#bo4augT%KR2f2+9B}%h6E+hOo&RFf(3yP;;$P+vR138#=$aMcyl-j_}{J)YC
z3Q=_mj38gK+*t*t>%p?*4=#nUx1Z>VY;CW}HFB0C#;!XPKQFEP#9J>&s!ar5&*8ZG
zHqBCQf@nCyk3a2`g$)%6Xfl|}s3#w(qj!mHIXlu=Plw^Hp@sZs$<Fr(%f@utPgcSo
zj%0h#=9*~ROFlfe099KkON7H*CXt}g8u}XZ>~xL=spGUcAh@Wi)jQO6VXiM-5n5P=
znkW0vHq_OOcHXSG%0FdH`*bZq7(7kqQal3*e=&R!?`h5$05PIp`ey|}q*i)+uCB^^
zy$`1Qy1?hBJ1w5-L0z73)}fdX8rae0op=1$=yV#2b4XsDt-<5V<Pw<T%P*)pZll<L
z_m?H-Pe~6n%~F8>PhyF~Geeb?5`VH<T>i9DGKVR{fjpB;Zi(I0BBVNLdTH!{UW`)I
z$9E0sR7t#We4cZ$;@M>AQPL<22Xx%TZ}mfHb^A$uW=1Ufgh#`HaMSInh?(U$K8H>A
z=vc_};dIEJJfqlHVWs?9jx7@_`}Sf(`+3b=P>ON?1ZOgmPXYh0ckZZE`}O|z{JD-)
z+q&hp@PC8Y>3&PceXU80F*?*3mBQusGKquckhsb%6R9K7(P?B8H+Cmw&(qZyGKl|<
zIjh;$7f}1lN8%C(@W@evuy)4n<{vliknWem^@H<mGTiKmxrzm9`-64|uP0g)TCAy?
z?>PzC7qX-}Rk-`ZwMuYg3%Y#Z^Bq<1BvuKDv$*sMvO_Q)Yn9}uXwn_NAtgSj4EX7{
z$+mZB%Z`M!S8-W4oVm<1YIGVgdlDAu9?tIJztq@vwB98Fxzd#hr$&_3Y6IG;fgXQl
z|D(O}g>-`{97cDbr(wAr#FO=luy_mqcxQq(g$H}R|2a8?2W9f}yE>TG1$GHD8zVDX
zv3-A-%ds9MDopoJ%E-({lEDV*MeJy9Ix#5lP%@#fQjMv7O|)DWhLY=r4XGYc3@*y3
z#3h}(;_JN<!t6AAC0suH@nIxC#VOh{Lnt;5r47eVs$MK7`HO&s=}OcLOv@zZKUav2
zW)}^+*C#UN9E$Cvs~ss~2sG<^mxa=Gn#}x-O`k)U`|{>n59~>qaR&7Noc~<{qnyXH
zLb0Bf`BE>4VU((c^oI6F_$s;orThuXmR+{nPRUnGQWK7T*YK>@CdvJ8R8#b%wv1nu
z8eSD&JxX(`Lib-YGT_@<A2#lp$--*68r(@EJ+Hp)uCs|uP?f(+OHI>9Oafbhv7nBe
z9bI>}cr-deIQsiAboHxdiKC|Rh_1Hf56FtQ<L@dq6aGew(d7OLY%+Bfd{jD|C~{UB
z@tV2m`#P0g3f+Xzt_$x=U>Im97Jfp<==7lJU=zu`;E=yiN@oHC4d7b$tfXx3e3<t#
zZ<RdkN>{iW-b`dK@&^oq{j)2XjelAw4Q;ExZ~`xC_IVwr;@!-z_|<IJesxakyitRL
zkG_&CV`=ce*D3Ko3;+8U5}ZMybhD^Q7D{{>ADGyHv~$L{!8+!#8)C@BN7R_Q(g$Ap
z$LrJ&@Fdo?_JecLg9RAuv%iScvhBB~oZjqSYeCHo;O_WS)5hD=J9drQ%pm1x+2U!=
z=a`T~eig)L=)*kWhc6y2j}N%zhYrbW4Fze#)hY1B6E^U21}0zd{kMZz5x4dv4m?uv
zMZUCJEc#4v5Cqd;si@d>JtJDrC{>M<g;;voj@F<%fcCVx_$W9{EOIWHrl`GIF6^nZ
zWb*E#P&#R^F#h__IGAc}_Lp2n-KO`?pT_0TaDUp-=-3O`9*!#AsTM>NZ$Nic!_8!>
zqVNdu%@<X3oA8DZ!Q0zjRpa?EP;$4dtW-GTVN-I&Lz?$7)r`k=sx9}w`2Us39wi>n
zsQ)lkKr@=DW<+6nZ3nSkt&=AQ0LBgFM-8Zu1r^EUx^w-<RW|-<(RKd{ATO_TZ>@ia
zaWBofKBrveF&t7x5Twcm?0z@TEZYfL8~7P_uN2K~7Aa3>y=e=r+ss<j(vC@br^Ern
zCUYwNERVHH4nrMHt;oNNhWGq+8Pq3D%zyljEt3tNuY7v@gKWw~CyVw%Z{F_eMu_Hq
zbiR>?KfGAr{l%Mr1#6k%$7g!h8Ce4*6U&pdi~6oRc{;l8rMVvm)Y*|2L5bg#8n$9x
zO6nWX=19<EMu8r4BhI!kt?SvPMu?Z+-X#oFMt@eXE2S<rP@u%Xd_%LzLh?5gmi0YT
zOdy}K#^iU3d<J%sczo@rPAPTFAvE&B?4_LSlgBXPml_2sYH7?i?$G0VkYJF48yWU`
zvCl$+DIt2Y)4Dsm)F5a0X`Lf%?MoydbWi1)MuzvRk%gObJnOrPEHO+|n9o|C*xxIq
zG_hIMcXjF{5=H$N4B|qhAuCXfrfA`5+0y2<m(~u3C=(KBl}cCA1MX6KaS96V(Md+m
z&O+X@Qi0-$7kkzp_RpM3&f}~x5A!4ZIljktQ2!c?VQc;q{yo3T>xFFNpKt?#miJ(e
z?aO$YI0+4LST6Vb+-s3Wo?hlEC^AQwxdvyL4DA!t$?se`3wpqLX0=V)q9Y(ElS&4T
zz(M}sj?xl+R+R~$p6I!jZ(EnQx-yi@j3%wnCF8GoldkX{jD_NavwhOl{AuQPhl>yc
z^+&YDY%V(Kgfh$Ep(j%cCvofdAE+?XdRngMc2i*f{&ys0C#?p1IYF*>Q;G&nWwjoU
zO&AMExj6F*CVzP)2|ez@BkkvjRS>TjT6-N`|Fpc}&C8&Y`s5*f8lF|J<jhs!pjnnM
z`Pdui`S&a-6yC-)Wr(#AB|j)o&o^CE<$c`ea3_k-ognsD;5QwLV|hg*nS7(@{z+c>
zw(k9|`S&)Nxx$7v=NAWg_gjz3Muew~+%$AGEd`x&dPko&9y2p%&s4M@BDvoiTe4M6
zCY=TF_&E8Ka^Xmg2I;-omkbb{?+1wEx2YNGo2cdk{Vu2Gg9t9sb~u-fg~+#Bj`XLQ
z@_ISH=1d1$Qy*oReoZwj<D)|>3(US&Mpb-}r>e|mAAPnz_`~C?M5eICgbnVWrIj&R
zDv_oNOp6#_h9*2a{&M&HaRQ3a)KihU5wk8AT?jYy-dk^nsyZONygqF1oo~C;x~u9n
zpcq9ux3wDhb}KqBtX~T$kWTAR#B*vxBWx*!vGVN*nav#dqN?}$<IK3U&|Bh@X0c{<
z;%ZRUFXp<gvpFPYg6@ifHYqN0?|L;Z8J%>GFF9vk4xo$*QLsHpXV6=fQ&E~eC+m4S
z_x@<OCVft5<I)qp)vJd>JkCTanq~eR?VRNddN@@+531K6avwuIdD}h;4*@#O+sS(D
zE0h54QFn0-jm_Rk@LgH-IN236N!_F{l`VB5+U%rreU#=zk;WXbxka-lwuqneFSmUs
zao_8L=rboGbE!Cc5-Z3w*u&Z8*PR?{5tYf6RQAe(RC|pW1@c7Ak<`1SSXayxmGoc%
zGyCB&mv9rtxu4BoKZtK{w13Pl2C{!EkU?!j>9jA7?7bm!b`=j6#lEM!z7zm(H@_;c
zLkYywO8w$EsLgaIJM)t?@6irNM<m;q{0wfGLsjF82o&oxev_#IsNOmQ>QM-F0=JS>
zgkda}ON7v3v|Yyx452VN_!7s59|Pp~9oRK~(0*SZrjFNyP9#{G1=A)29%}w54n0+S
zA>E%f_mj%e<=Q4VXPjnyZ?cT98jq=U@-X{(Y&(QAqT$x$FG7V;P=ok<0W|bt4hEwt
zw4eT(><ZJ1Um&{QfUQ%RP`49@BcERMz{dT@H5T~DP=P04=ykCfmrWHr172%*?8Lj<
zIdA7Bb69u|3LFVVF8lW<q%Lm%cQu}2_goqjXisUTSCsmIO<hUlnFS!w_inzvepEqA
z3h5N(sZ4meQVva@m>(a^S<W~WPZ!Hd8fVTBtFJevdR``ghs)2hap-8nUPiDi`5&~c
z%=}ya#B(?^XLwyt4|qXPu%mfkL<q{$rb)k-_=K6c{UIsC-tf7S<wsLI-G~Z(;sO2r
zO?G%G8Eh_yu7L{qtf!63jlGn;h@2<2-y2x^Np&Up_-c+4afMqvQ1517%(X%T`sz^C
zePPzYtrC1Q9u4fBT|2`_&HgdngfI<Y-BlNOA5f*8b1@)X7lh`?3(;gH|4{tSB468F
zr0XMJU1c)L%+f-L{}Gh(?9y}n{ebqqLt`eaS}FE|+D@OHF7;qj=IolK^EN;K@7FEr
z>F0zA;M|c1=gt!dd*aTR-+6VX!wu2>g!IQCQ%8=jRMCXDfl&F9iu;uCi=%BsO(L^`
zcSWV_<KY*~oQWN=z6zFq{f|#StiA6@!~(F9Xm~M)V$Kf(r#UEe)po1`5{U&*F;y{f
zBQELHHuS%l+6ab;(xhwOR6Dr)%0$EQSsG#=mLm%0o(>GRCw1(J4-N;@6@A4kSsq&+
z^u$wDgOdvuk478)G$+uZ;5Dq!XR_5YURq*&_PdN;yzy=I9Je$U*?|6YWNTB6St@6d
zA)E}vjiZKNdQqr5LrndJV{T1~190*!^UD7Hji~=OqO`nttX7$*^oH52^u3q8uMA=U
zzoCKW<ZEy|wc_xfd(#qK4^`~SToL%H>uf45Ev&UF{45Dhf3X0mxe^rGJ1m0t{+$=r
ziHe12uX_y9F;905otMPZ>QGP$Kgl5&w*d7gH)aD9VURXOJZQQtm=oKiNgSfmv3hLK
z(PV5*KRMy_Vglxmq-#_*-_DIBehNu0%xq((pe@tp=F#;e_6V)~<awU|Vr#6S4G)r3
zavN9HH2(SJFp}=sz8!r)rl1C5dymK8&pa@ULj%!3ci-HS?Q0%<e?HwT*)xZ~$@Iz6
zi=LCY@$pTuVqsdgSFSHVpPT|`@8r_a#k&R(Q!Tt59H(OCx`F~tnZj6}#AsqdoaYG#
zZ`{>iNM0rN)fd<4Vs~YiaDtf75OhLDkr~RwK@I%pnH+fXBaBOfj_xNk5OR)=UQ&5j
zQ<Fb>DD5i$)FG|otZ#pAvzo|3I3w=8FUr8sR1)k(;s5#U{(m%`WmuJ4_w_d*NGc$)
zDe3NRq$Q-;NF$vRBGM@!vFQeBl<sapx<NXmB&55McX9sD`+@76>wGz|@4ePN=N!K=
zCg=%{$<9|kniqCOgxf@AHraUW><1~=4_IB&ony<&*ma?((u8pa7KL$6DPf-fP7ICF
z#h0ZJW1{9OhB6$mo66xDNlbz{9auQNH>sxSEh`qBzB?K&_EJyK%3ey7^X#t_5D)%o
zJR><0@C^12WWs^X3?vWNyX2{N`OK!^o%2FYh=RpqSP&i6i7jOO?Z#p1rnKY`N8=<Z
zw<A@;*U;v(2V#i8T0wcX(;4{^(C+=cN}hgpip>&-GD^|zMVkuc6$#tGS*l#eV`WR(
z5FN`3_H<}U`mv(sFbnr#Pfq;g0t%|32^@$=Vz$DYlv++T5vR4p#|UmeOAzq-sF=g0
zTMry5=Za#bY@4z0JQ?w_B|0iCyd*u7LU@LYF>VYja{`91?$~0$c5H&dqR=UIz3k4v
z*@+r9L<M{Wy!tH!9#{{8pO&xDRRYle*d*xfhGdHngk_3r>0rk6u-&&uN-g}uhm2WH
zIw1T=3!nYi8;+1Qc_h101O(>Z;?pF2cs5frErRN{cG1+}NrO%}hwkW;w(nzCn8NkR
zG~-1c0vYHGbWf5-8Od+E8avMAG#ibW<1*)I_WyQ`sG5&=(#gA+p%{~??ccwb2#7-d
z(U|llmgTPHHsYGQuH5~^Rt<*feWMB^$V5@aHMvDK4Ub8ncSJzt<zk+{aD#v%D-fK8
zKap51RP<rF^ubG#rdbl<vB^MzdMSM1MhRKzkTPglAP17oYiJsI2afDWzuH8>yNg6y
zsnkv!Ff<9FE|afZ4Q|=_iB3IiKl`~ujrd9RL~T*Hkl1Huf&>l#_{YPn-9`Nn)oLoz
z(218PQ|Zl@=0BRrSizB_H0%d-Ld0c>_n9YA{v~%eq$5}(G0IaFhb#PHk%ya$oARwp
zmtryC_6WwEKEzmL1I#g*7TNDv>#GPrery{U^(!-Lx^2GueWIUZ|3cAvhd$0O2fjUd
zMN4Y!k>omrD;uuOJJh4HOYFY<kME`N(3+)>_s{4<)2$}L+|h#NwPWBsQ*v!-kV!ku
ze)~NL-E=5IPmNBoc4UnJ98P3Y-xMBRX<Sx;UV*#`#?M+r{x`C3gWll_z#}++krY3x
zx_lc@@SdE;=@YvZ&^c&hvZ(?+4>nsjTQ;ntd18|tj7~|<$j(Usy@30c6yfBFU~fK5
zz!|U)?OXys7IK{1%ctXCv7{%YEpG>8{TzT<xSAZwK>S)=TYErI7_RIB*qo>aDLa%j
zuFeG{K?hKp|0^mhM=hN`Zrz?<ie9y+>mc0HlRQ!m5s;Sgmq=`i7$3;9tUgEuVmkPF
z1)`{al!aOOB1e<_o)rua<C<u&@qb9^DGHaCn;#ra?6B|Ff2Bx<;W1svBaP|;4;qoE
zNs#`n?1^L2p<F)WL<|}O!~#Z97>i+o$<5WgL=;J9l^<adP!b;ce0u$db{3lUg2$R}
zo%rc;4Mx8>dW|9<G%-=@f|HV)Aqc0O-FZ5L3L|eAQ1oL!WWetB_;D_Z$NzV}|4N6?
zf<mQ%ZhPWkceeho%S&U;Gm_J-Z2>IX0V&Yt!DMk|c^lCrh8=3cpq=;{A7b6Wo5?6i
zL1ULPlmH+ZHjSPOIvtd=b3IQ?cRK$%y$}eZg=Z_|wYE3i2FvN|MCG(*1jeAAzl!C+
zjsIDtlt0?nTVcAS2>H_;19b0)cBooQ#i@^oTZ1sD#=gYe>Uz$=z`X@(o(J?0<R<&i
zZC{Y|enTK&<n;bPK;G2K=VkUil+(5MlPG!5u_$?HTUl~0DdEOg4muvQK^J&9WX2**
zr}tn4?yMY;N+EOE@vx7@{B#1&@%xzSH8v2810zQuVN=~uJBsgf5ekk7uT~h{^IjB{
zvN7$MQ|z&j#7zd8fuYn2i)0#hLMEd7gGosk@C;h2<#`m?IuAAUNLq3zrx*>z>UN>7
z17r$36|zjRHbGQ=z_>xrbeULxfeO-2$Z0F0dk0L`8%qYX@Xt@xbF{N1gWARH&L!jI
z#WNgB^XZF?`z|YQN8UCJ!WH9ngW<pEhLl_LGPLSG?oVHx0S!YRR{1_kL!h!g;WhO9
zyas4TIx_JG1!t-SGe>l19@j*Z80i{b;6<JI?ylqwuC-|aozeTDns+%F@>8mq$SXh(
zkw}q$cIhAQR&)r7ev2m$Eu2v6j!5`AzZ?*epPdrUS&lhivj0^>a)Ga460!4?fLvse
z3=EiCvb<lsY^vwHYSg^i1^uwExfSgAM<RdL!jD6<t@<`bH_zRcZ@IjFz%}~IR-QW4
zL~Cl$19?gy7==UsF5w49mi2iU0-Lmrq(I%N_rYD;u!G~4;AQ3CNW$FX36a@KBY+Ty
zIPABll&)E1Ah7dr+YF<(Z()jOH@RK^VcF(Ba(V%|y7)~%6IvG)b6U6OhDY%g3)WfC
z#fi6vy7VzVVr0dslnSvM(~4!NFfd+%)ndzF8mY?cd%F|WD%eV+fQM1ujV+foo2MdZ
zGbBINspWs|YXcNLcCgnLH$K~EdkyPq@}Ao9!T-}i6VUZKfFdyEb%2h~RD+2n<>Tj_
zX1Kei-G_tEpvB%GIGy(*nm*DZY%k*-^A|}|hLsnxWn`6gh*}XW{xo9lALLfWKwDgx
z!r{|;B)F%4xwfgu=;y}5_H&H6+8gq%FdMN9S9*zG-(t-|bj)oYx3l2*EI7!$#IDem
zDY_RHTdu3x2}N4qlMHlPJ<Bn5V|CS}2v5nrDsPQ1p(x6A6J;f-#Xdn_adzwC6vuWg
zdo^0ipmr=1+t;cldP=~Yb2ZdaopC_uSSGHxy@cYkkp8OTT<Ov43hRmH1WvIzMU5z)
zME}$E5MJggpH?T0!7X~WObtUypgJT$s&>|b(k~m=_dUG_(jB08q7d=Rjwpf~-dn>P
zPl!0+oId0oXDr~BugL|-ZTr0~g-m@Y$s?TtOG^AO{Nl$Upnk}(q2$R*v3IAO9VZg$
z5raV7M23|Ix2~pFO4bs1hgI~F*N%IuPeH+$qJFV^B+XGUr?6HNR4B}v5p%g3_(#Oc
zfOD=y%!fz~PALtR+zHzhqg0nGEiwj@5Zs&;gQ1x?Ku6=n9`X;!)j$|pW$dVC!BJPo
z@_3t4IdXKfZ!E*KFzWAtxkdt(uLp{|CKa4`eW=t%UvOo#2&IlSW)73PS|3jn7+Mbp
z9vcnUUVDQVbXoJz4wVENQ^!uurJOZ^3jboX+opl777g3nzzYWzeLAOV+A$_mB71G<
zOKudi%)=sNd4uXqG^HQPscA7~JTj}A<+p{geMJ6&Qm9&mrpDe(c#AK%I0vr^<=^V@
zP7VUi%Ok_jYY0z8yl!-IOH~H@5|I+KnaLjYZE$!KspD2L^yVzLh(!!33zq<e)F7`x
z;3&D2tw_`jmFa#mCAc<t=1WnyewUq=3gPb4=loB|9hNuwvy6`}D;!RD$GwkoXWOsO
zt(w-mBN=e-d+rJauR7ws&r|e5@;`K}zTIjK4=iOn(Jt^kJ`qA9ug>}S8Vd%+C*Cu;
z*ipb^wFa34g3SmFWSPddWRm^^7v__u%fp9=w~l@s#w^_UV>4V2O_OoyCx>UpZ7c~0
z%1Fj6X+@^od(rm$=TpO|?cAUa_XBnK)9ClxJWfAO<HJFBxBB<<zA(E~NtKBwsSa$?
zy`R!*XslLP)0l-CvFnSjLsw{P=~!Jaqic!jGW+Uwq^o=Rx5vBC;n(h%<)3ncp*{Z1
zQQnOLN{$Rfoxv{=DFimrZ;Lyj++*Wnvch7YL#MIjH47AlRe$$F<GxLs8fvJxj8g?2
z;;1&XT|4gGI!=9jrSnD`ISQ<+12x5AgVr=cL$XaAeT%`HN(;T$$yS>gpKoP}K~+VW
zChjnEibJ~W+}1o~^AG7u6aH`4p#0}k+wgX-+2%eOF=`bD@bzZP5IV@xa^?*+h4a{y
zX9;QGd@_?p<pgGGadIhuBlq~1K4^N7NG>gXEJ5MUn;(=*(kx}GS}TB2DOkI~lT5kj
zu)Jy@Pra_+%rRhLkeu!1SZ}e~I8KR;V;@)Xt#HPXVCk2zaY1Yxs0n>-Epj8@U+@+W
z8l`S_=-uL7-N1al1rEmwW-*Wy&mfZe(Z7aK7gTNiI(*unqfqbvCRTyShDfI*aRwbf
zLx1+4Z$cnq+i_}{o_Pf~5t_X|QMqXrUV=?*@(|AxgXdBf{Q5?q*~NvdfX_Y~eDX`@
zL^^l)3{p#t|GphGDYB_xB*>WT?yT)uQfM3%oVpPi>o-rRGz8x~yk#HkRqYlDtLf|;
zJ=!61>UE$<%F)%H=mQ^wECEseo@p^nEnH+?G$r;m+a<iTC4$Ts;Rm<B24b^GS*G7~
zYp_rG**_+U4Oc<XC&Gj&s|r|2vu~@()w2(|FIs23>0c-ObuA$%68P^_{7aCiCTU8I
z0eQWRHXZ`M@T)GS(M?<5`K?6F;C5mE4KZ)C!J=quSm0dr%|a47`-l065l3+_h3*UQ
z_#!}rr|*?cMXP&3Tv|4b(^0Rw2y;L8TP-A&xBM82#Mg7XEiC&wlRqqPStN6LAWuA3
zB!l^-8Md9gCk=b#oqrMN`SoUP@>RmE`?}+&x<Kx0Lg4Pu0JhrXEmz2C6BMwH39|3U
z=p_R=pSU2>s9|;xFM?KlweSlsoLY^BQ=QOy!GVl>HH238eLEF|-B_pitx9MXEhc4>
zB1yTf%ls~FPUL|bp<m0y9GIu2%njcp33kqcGk{>0#|d_0Q>f9%MwXAFrBXP-0T2p<
zA_(O4Eg;qQdNA<#7ka(`v+Y^0I}c`%*Yz%>*UGLI4db9Zari=>#goB>-S}G*u`n;C
zU9op{(k8Vj^hK%Umx_Mv-=n`XN0I(m2;GrNmPbJyb(Ha5N2=)ML4de*^+sZ<`ih6*
zu(gliu6Lsz2;N<+&-P%L=dn1a`E&<QAY1jV&5mhc)KBgabtQ9lUSS!7-xCdwzJEWB
z10N~OE?WDtVApg1R0slz+`sXoh7$nhM^ny3mXxs&VFhmQ$D(>#bG?rCQf1Zr_1_b|
zvjKhjR~{x|oN?;q16J=ldJXkT*s3gJ@+!4_k>%H?xI0_J?gn2-Q1!tJF4%%CIKag#
zG*J-loNDpVY+hYmLj4(cgPVzcqtI}6;6vYRNb5_QFamyddB@XOukRbY+`ryEP>_F_
ziMe9cj`8ruN4NbTr5%@s%pBI*>h-d%mpT7h9>rdkamlcm>lmK$k$a|WODbqa6;x~V
zgxOesmg+4|7yO3iG&Vf-cO|9OvgKL3!7E1!NPz65&udxqxvRG|MNOUDqlnSE3()?Z
zW(rLpfldKA8mC)1;vo|JJcDctt&sTJST+PeQ_-v!gi1n5fvMY84{d*A@CMr0=3M?W
z&gX)kO+h4K<nIwOSS;Xv+XDtKu2tn|1)?f3$2Eo=(>8Ck@~pM6p7$%U_86u$5hdwH
zO!`PJJ)cjOGm-mHu;uPO#Qkn{V6uA+^lEPX_Z0m_18N9v{XY8!CG|zxt113PRaZO`
z)wxgWS`ZA_ujxRv*QjCCOJ6e^Yo*>QEPfgZsrc8*`ncXBzo~sz5fMLk;cKY#$Nx+G
zCdf%?3?E+qg}HyF)2J_PG)k}X>>}d<7&{tHm!5hP-ts@Z`bd7aJX?L70FVVs<jw}u
zrDZpah{%aCyFwH}lB18ZFOAl>LstdWDLbLS%?l83%0N=}@|3^Lne%PkRp=S%B<9}=
z&=Y26F<rNPODd+9E^2jM^%e0LC1~Ya%nO&>(f;77?h}Q<o+988U+^*{!U(US^Sw};
zp|^kc%;UVJXlTO-rtG@G4JbB-kZ>?tv-P}|cvhzZBGM=V(O=v*1Xo0B^P=t5r~xKb
zCG+l-o)|r2a>(DCW;2V1%=c$qiyAAFF)t6U04gg4)^=vpy9LHf$qcAgp8_KOjQo}`
zieug;w?|3q!Rk%tTsI^K)}z|ZAq_o0jlgk+1hvUfTp|_Z4?q<xdgl2hQB%-^$6^C*
zQ8958^j+AUey!15k!j@!I4QGbTXaWpj?if(KyjHQrUr6dUe+HJED|y})p5Z}OY{<;
z<3+y=4~5I#lY!yEW)_g6sN*?aw%leSWN|n+uHbjCHi|e9O6%e?&tKl)9W32b?#&;4
zcx%wIyV;fIB-N??Tn<m_-Eu0M7l1|s05r<9_~{{$U#K&gQU*{3KQkhH9pu&>j=paF
zi*Q|5WE+)V-;BB~Pm>mqg@$r<x&iT%@J|EI3g>Q9{vS2Mn<|uhF4y{50bHTn9$9OM
zBdi;HJBxt3Ozkh`N?h0MF2V{-0%207VGx_z9i7%oyrrt3z%ql_=@hr!LE7>I-%`xn
zlyBbBClRj}a<N4Vjj@w9$slwUGLzGAe7I9KZ{ak>MWWw*m~=rC>QyOCB158}SyhwU
zj@<Lt(9klZHUx@}4$prwe+mR|B5$xBX@SS5;rb@jv>*o>7Y@KP(@TU8vD&iO4u-My
zZX9C4^MZbGfq7|WY?XJ)Up07kk;0zD*6WDnw=~Id>1<+;UKLhpv||3DiIG;-Gj4c|
zK`UH?UU<t&r)Q}&fX@r}oTho!rz=|GT%<+Dy8SjQR~U6+(5n4`CakVk8$_)SupAJD
z4XkVuK~O{#OC&AW%u!=xavqyo=X-ZZ72G)1%zqL$Tem{msiUS#UTyAq#RtQ+o7W*x
zH4DLCqAp)IXFQ+ct!OzcScX78m3W2<_YB1gwfuFS-Jz1_R2$VN4;m&YH%xr{4g`MA
zmCfv-pkDGKcBh1kp!_&zMQr0P(!$@T3&CjKm#IC?@H6>7i7Qjea&oSH^x%A18X7kQ
z`LRE9-C_7DGdeVm4720|aD$wz{+wSlLb0XFn$kj%(84QENx95fY+!Jj>Q20)EB;ms
zy3=QX!2KmtP}KmsQpgc)?rxc{O@>hiI;N>revfZ2I2e3!GLI+=0wjv%K>vXYj8<$P
zjUiDi7JW_8+7S^cOM$X#rA8ZR-hYKMX&T3|;>x=k3R6bKQ56XMS<pzFB_qxsdNCb7
zI;c<YwtGdA8%YJKnOfVm9ml3LA}EDK<4&Vx=0)EodR($lY6t~5OQY=@d=(R8)GvPr
z$2y<+@bKe4s7Hh1t-6yh>Yq)%^Q^GUQ5G;-CJNB)P&Sx2drf3JTffbH!U=H<j2X)i
z$x4nXo>5XJ>6Isl%k$D$YFvH`fqbcNCxeVR&#FKmo_uZS;<8ZJ5>K@M1K_oW6rk2v
zK9{BPlzK3f;V|_bQv(g6KPAO!3XG;(@=$pYFqL(}w{t)+n9L+8t&F4*TO;CGw#+)9
z%-TOOQ$P|72(l4}e{TPLSLr1AF#}^YeeO#ab;#y;G>V4r>KZe9LsZQt?Vs={4m`XS
zH9O8F`?U6=_Xh7}yRH^9Xt&osqM7yyumyrk*dJheh8}6Eh#Y)*>8PbrnmB4Ovuybp
zHl#NHCqz1V{-kK8TGn^Gu}=^>uULSp$=HX)YRy6oB(xxfm;Rs>!U@CaNlP;87y3ss
z*hked+E8NfQ^=(kSjc2n&ibiBsno(brauQ$Mm^d*nn$DY=hKpCB%T@sNJsmc-gc)9
zpHlwK)7`899(_fEq>+<QLGa|KJ7o-_*8D${A%G!sO7P=B2;fm_C4b%9X7q8Z5jr*-
z=uBw(K{XtZ>Yu?#`sc{`R^z*lp@e6dPdoDhSLl2$CMMHS6D0o}GL}cSwNJf=_(gqM
zM22jS-Ev3L;DTo|fYS}!eF0><h5>E4KA!<F9r%Rt#_;AgYx6#KP{Y9|uj%cxcA;}+
z2>S3%W%sAOTB4X|FauljzJVcoznoPpbAEGNO_>zDgt6LBI{`J0=mt;!fVGd+CiZLn
zhE_c<sKTBwx78aZtz7KlIv7G7is^){b@x)fRth+OG%fEck(c*p&>c#TeRmKqB1M*}
zVa|`hN4HeL!ARQt-u>df$^wV-|4(!<BRVe3*;6yze)i%6w0P4%E4M-Ig}Q5)@lL>6
z^e6iPf0jh9j2Cg6-_>HTvZq}ePkDX`P3o)BG-2J<?ZRj#@V13_W@bO#R&Q*t9|%$K
zM>T_sJbkBoe};BMdIXqqHsY!quHAM>Zs%rFzdJe;+GexZ2aC(wusW81t3Xc&-Zg~`
z+AvC%%sBd_#>*-ux{(a~M;PG;C{$c$48#OoES$v0C6X%NpR}}?^tEGr->6hErD)Fu
zpzX5`_}ty#XozpA`&bcj_oqxy<uZ$$f(fZ56uJkhQ+`O+ZPuZ5wJgSW+VP?sl!Qcz
zN$z~^&v>W#n<SS+;TrXFZ@$LC5)RsU7qp+ZP<30X7@$C|y2gJ)K2)axLN5}KdST!P
z9kR`Lq&FOuA=D`s&4F0pxx&Hw5Qa082L<RUKj08+R6E@UC%V$>Pc&%ZAOKwQmZOGH
zl{w<0a`8q+&%f~g(=drBhUUn3v67kWlhsw%>!G`p`vBei?LvQ1$Ao?T_>}=axGokE
z=C|^wwH^gDYTw?7D?_C+XC`z~JXxy$-r0{us5~U;*~^a=o%*lXs%sLBKb8!WH}^r)
z3DL~XsLgyWq!CH~o{6h@cx=>gG@{|iLJaZ0<l*!!V8}shCoT(bgAx1SH8tt$S=8{k
z_ojiI!T(IXPX%Zr#kFK==*toaDz{dR0g$K+y%sQkyxv$l3+(g7V>srEsKB0cT$xVX
z9<FGH`O%PDj2l=*x)nHk9`(&G?&{m^welEkhP2=2`En1x1Uk)kP8LUxWTx(~*H9^L
zn|6Ds5`9h)(5}w8KqXWfdOUq!!0E#jzm!<+_{Zw-L4sz|7UfD^4F&(vAfhzh`%;vX
zUXq4dL34*PEO1|#I;Fb(7GvI_SL*TtDVper^!GnLSA*2=j}HbEZ&Sa$fjAW-tdg&(
zRnFEZa$XdEhhau?XZ-e?+WtcUnwb0~xDU)qQVYWAxP54dKUv^)gi(z$56D_V8uyZx
z(MYx>hws9^RiEt2Lrt;ny`IIIG7BOCyV-)r#g8-63yr<GD+N~)GKr3d7r@5@OLU>`
zbvO2VWu<$on!qvdLn!=QV;KX<qCn*-gAg`Sfjr*wvJJ18=T6wf!ee7q{=6xoI_iyQ
zvmMo&j&YT9Ni<U{(WxR6OsyWmq9gByVGFO5KksU+8_4M|4fZ0*XKywqdJniyW=8ht
zZqwQcaAlV!!B><%hSEgN@jEB8T;+8Lqu&!jV^V(J?sdi-Z#e5JCJm5#4KLhi;O7M&
zcO-ORF<mvloBl63^nd0QsJEDhX8ie}4Odzz9&tO-Q`R{$eqPps?%C0D&n$4;;%=N5
z<FdOe|9Z7V-=!OSC8l?yS9~-h13D{A=~$Yeo*UpZ3(OV%y>X5`y`W-6nEuaH!>)NL
z2?tTebr8FzT`EFG5{1^!;nPI+=$511)-B{JkkixG=*KwOp;J;b)*Zn!J8y2{;JY8@
zGhDyY_KyE14_xMq?cn!QWmkI(1khM$z8ltQn6<G`>W$RylnYR|70X3_il(te{^3(~
z1%_t{{bz6F+Oip}c<*+~Um&kg0hj3Az?+XD;1_#BK`v7I^Bc+Qhs<UJK*+nHKy2)u
z{P_%Lb+1v)ahn;IkEXyS{5b3XCGs3Onn?Pa^`}hb2%{cQ9W*S!2CYG5_iEsVaH=xx
z&-lfG-q;%y$m5&!@rxBsE-s*B)lbF0naHAkkne4BL%e_U-3mB*AfVO`=Km-M+fGIQ
zK^-n$=d*x5Ha+Ez%O?#5Gr3EiG9y?#DV_YwSFP)QyT&!gzXHCSN~cJE`Of5ZP=%w(
z8dENo@D6b?XXfak<3RY~nV-rcJ{X4)0V4b<*^SrB-cN1yGNX#Uu-!-pUksrEWCo#B
zT`-61?n%4je4l>n{cX$xPZDsFDM0e)#>;+}AE-tGA0#DqvB1L4bjhvAQ}d*@P5H~<
zKh<Ng8>uk1S_+0&5YXQ~wo<V)PATfKJ<)$7P()}W^~VPKs31`su`KF|MJTL7U=z4K
zSmMN4h0EPy?1#ja15LHmX4j#K$D5`KZ^1GqGrE3x&aD<((6wZrA(<<r%ayCpPZj+_
zmNs16P0HL!ZH5}+2Y6XT2zwT2CZwb}FZ8EA0DXrWNu^H8<`Ad-M|I{sBE-=QCnRm`
z>oc(2r>a)8MixicU~la9mq6X_XXMUVFkpbJSa9Kj3@e#Vxhhl&IcNe4qH$+~g-i^K
zML8R}t-36Mzt>l_*h%{>)y{&-_;+un76R9pI<9n??Ez&=kXQSrDR^<ppXxZr^F3ha
zF7S9&=#r1za>mSj&iFpJfALORR-IXg9iOIz1F#$OX|WS<7&Q5Cyyu8CPuuZ-R+N9I
zj;3Ih_$>NTcStW|DY4pHGSDv;n{7nb;K>P*ur82{8{@)&iJ0MxgNds%w%?XP5!oxC
z4?c5L98QP0TQ(|BP0LHkxMM!yoE>PhI5{cUghLamyFVeGzx9??PNcKXg<I<wB*aR`
zdgqFdyC~fffx$FYAfSr^LrhTb{uP<K_UR+`k({PYw`Dml4H_lhPbq1xZ$C(ZuR0zo
z<+#faUxKQA58qg63K#F6G+`HFd>XpQO~CVn=_p!8m`?m4x*b@=Dg7cyKPsQC&y?kx
z4?OM3I{i8mjsnC6IYglG&;<CTA%0JKKY3#VBQEjNLw7}P<Fm}cSXsJj6R=Xptjppj
z)+#!+F>Rswm|g{yV%M4+EBMc7IwUIoRPrTH;rW$;dnbZEEwzzFLK$yHo!N6J)SguB
zls~JT@xT1Yj%5t`{FKhW?i6Xcz)EnEhb@yet3lMFgr<hsy^cQm=CL3S8~b7G@|DJE
zv1z{CLdObLxmA(b@MzlH_~~-Z^Hz!dSz~$=MYZntjSnTu0VEID#&3Ro9Rh4tTY!EJ
zEMF9Y`&DS-XLA`qMg;QfXLBZjb0P;}bi~vwC`J^{1bD=PF+bOZlle3Z@UC0r&kr1@
zB3S8@&<1}LQ#A&CiMiW$gW>3wDwiV1Sd6&dHG6iTPIU>$l>SAyaq&BBZf3JOYYzpZ
zk56abND;7mG~;wU&}3k0P;tHPWc!jv&gp`yEtB-m=x6qO2V@9+DZ-<v1wW$$wOcjk
zTPXtiMOX~a`vyuhI`q?-7}~$HMVyvZnN}N3{I|NkX8t2}rjpE)o(~=2(`#M7!@<BA
z2{>ds5RLc1Fy>M21Os!BJrD(yo~_b#;4tX;-96^X#Js56DPW;K-DzAL?lDy77I?v3
zYeC2iRq>yvak^u9)vr+Ub&F(h>IAXiDNR^cqTUDCvrwvRd4v5?5WyUg1a}u#CboRT
z@Y|sy46mB*{(Pe$kwFW*sUraF`!gn{c+~i`_g?UmzWzW66{KbtEZaL2TuuoItgw(#
zcZ@Cxno~UO4(VW%h3>=CO@)_tV>&fnd!UpHe;m~l0SNS%D}-jYeIp`h2nw*9NAR<S
z2u>3*wDwoBwBzk9zO|Q>Ak*iUw8^9*`nEqx08VF7H}yvri8MQD3XdK|4;-|t{HfQ!
z6KB347LJfkii>)fu+{4TXy$p7liJ;FgPSbDkB^^m6xp-`Q9-W1YDr5l*X7XI#mnPY
zavBX{*bu;mSRP*78U5-|V!nJ&eBew{|LZSKq3Yv(v^QKdRqoc5%+b6kFcffHJp}nu
zsmQFJ>GKY(f(1{Z1te5#$|2AouO$zgvCu(G!@fzZ-<jEB)-u5<PYOb6B_OLh-L+$}
zHaS5>Uhy0@Fr2>hfw|N2361-VzYn85P~I%HLx>hKE03{|x7S6IC$|=UZIe~#pAz{{
z>NwqgJ2a~gzi>72ySXvI4BwI?**e>fTgiK-AD9r_g-IE4K96v)AQgv0TCP?0U|(PH
zhK?*}n?>X2!7y-3bfZT}Xl|mE$QUvGNsa*IupeUbINS%N6=HM_sDhgoE{Lw7H*haZ
z$Rlps{K8K%ipD^oQI&h;FQ)9gf1E&1Ksrj(AbtMt&|W{5m8BX1Cwj<%Na$3;FZHdQ
ze2M5xa``+3hn`V|B{?i))=v7N5wvWJ*P&?D8i#zGN4zl%6L^I~C;H18t?yi7-oawD
zTLzvx5-8xA)~AWEcb8%LZjm+Heb`YJzjz3XD6;<LNUnTf8^MQliO|=c50kBt46>vf
z@JU;20LGQa%Lh1RK;1&l+L~UZFu-Bz<Q0+XYrrN0e4rh%DeghXsVQxC<B^d!s=LjO
zK52Gl(||4iSl%jiI11^rIM>N}d~FO<^HufkfGX-h+OCn-i9R5(l0XiMU(c!%Ag#6_
zJRpwS&na(C9}q^AAqjqK)NUn!z;S{S-_bdBzhx8H#yYPUdoCBs2Mu6vhgg~HLsG);
zX&6^Vv9XrGDLD~9zw%CrpPZ(eKgX8Qn?vynZze-l?H=Ps0Jd68M8e(ZyC`ROmdA6F
zp07xIOU@_*tH6CUC!{r3n|*)9Bt?s3zp@*)=aIm}Aphip>rixf;o6%0Ws_eLrAr`Z
zF$dxj%01yHAe+X>K<rTnqN5hxxv0Ii!9F*WBift&Szw=)q@?V$d(sv26T2jh0sEkL
z#ZrU4!B6jR1xge)QOz!wL#{-89_+!F5)HdJjB>Gs#tE13UoDuOP-q(e@q{rZ;r2v(
zorkXdX`5ELG1UUK>d=oz6ZV?i(4y?jJ39SR4FTGM%IipCU%?%z1X@0#qV+0B@>O9U
z6CA`7YeDh9-apM+@ssa_Qep74s&#4?r=oVzmesQiGr6#C;Dh_R&ef^}11B4*rdd&>
zo#<FwdE6rt>P%q1FgQIm_W)a-shaD)Pbg&y&MUYf!|*Qu=<vNVCE+z~hn;AZD&f1<
zp)dx6bp$s<l4*T3$ib_zO2?8;?iUFpJ4Ajo@_^3#>9+EYE~%PeLR|LiGrQ~FPH#pj
zWUngJKi*O3WS3c@FFqP#;mF2HLtb)@b<3KE(S&270_@r?G7eqKS#q0iyB+eQ_3&|a
zjHN`UQ`4oHzVwk3=_IIph!Ov&*G4tg!`)Bdw=S2>XVt$JeM;xwyJZ%Rv{#VAa``mB
z=WLySD5wX$(QqJF|2v1=a-+DXd@<N@EW)SXVaMj7>Lg;30cJ5{EKKP;T0`ds`li%s
zAzWJxHrK!mml8$423Po^2H6(7Qrla;^I#8#Tx06~tEHpoCcNDZv_IqZ0l7F)L48!%
zuKW*U-Mhzyx33W)^Oqi7WbLl586tHF8ISJ))b)|`6cWo=n%T+&TCh|kDmIXpPn|j#
z3`G}C^xOKksMIt|47GlXy&%rSqYAE6Fcr=1@@q+ul0rDtP{G9VPv|zUjtjV(Or72q
zQ;cwMYYt+r?wz>BHop%`WSMV8iuQew>`}B^MeqZe93lI*8H8RLOu-pMAjH8EQlr)m
zf;P}UFY?BjO5{9V^{ohh{W8x(S(|{Q;hg^`?E@_m0cmq~cw{MCV#FzhTApZwkgD#7
z7TceLkLdnlPsTdIp7v8cW6cx&%`-k5Nj4R%#ykKs3VCTS$+#?{6o+!oeJ5UHur`Zc
zN0EG;pdE;qd2v^`PGZy>5#9-t!upWCzyLt8JWf6_DYVtU;DFyMqWaL^M6v$+#G*z6
za62M^+g++$xjYKJDadI*G(bvOG9*?yQZz*Hb$N1{JUXE=JFe`mPtl63(K`K%`@g9<
zS8v&S0^ym~*`)`K%czfm$G?}hJi&ZUK?Sg2Y3QcGJWAuPlMarf??b8KbtkU<8^&KW
zh3gYTXUAWh^44cC<u-*dl_jfx&G!_lcruZ?7RUq#B<K2j_^!SnYbkRu;t}RXGL*vN
zO&>T*2#kVQINg82s`PfMxC(fAHQh$kaQmA-MU~lYbhHtR^*T8M9y#o<B0)J}`3#uC
zgN;E4-jpSSs1~J|Po=3=bKv+^>5`CzLeFng`55?<>CV?TU&-R4Cg{X6;DUmm0B9$h
zEBB8%1mFeOySned4rh4>s|8x>=Zj6CiI3vQq^?AB6ggoV(-M4Cm}=M6dGg`Jt@w_;
z#&_Ia+UDFsUvT(&;N9RuqfjE#>>w&0GrT3kIe%|Ip5cTSL{%Yu75c8bp2h_{_SKu&
z;={c&dm@!4_F@yXd>)@^VmdyKpOrWnrCmy4UEgIM3F)RW8*BbI${4|n7tBShommI3
zuk~(2JslP?qq>YLNxYwX->fCvI~1akXZ~RuYv#yRR9$t1A2<e9dY8Xmy!Ld>Jbber
zFJKYKd8jjlx?a9Z1^-#j=D-c6GY6f|t~?2Gdk5+A)dHZ1Nygs4u|qNY)$p}aiBm_d
zI^1kcOK)%(jLk4>bE|iVo|+h&59^ke(W8-Y4^e*9d>Z|>zC6=N^R+dVLAfaxEgyYN
zSoZ&Y@Zz7Bz>G=;OqZWR05NF!*Kwsz^d$fU2t9gHA_fUR(neCcGe@(FlyFoPL2cqK
zR;o`>EDAoNvO(A(=H8*po&Kdxov2xWydeTpT_l4WU$UolchpT-H|#Slqdy2!hhIO6
z1?*#b^>fB=%`<UcX^@q2+DKNq;`A8|$>BO+MZ2YsUX^SXGrodRy)TA;GNfJ^O`E7B
znIG(H&xQ~c@%4Dn&6L5T&a%3aQTuh>-mtD;lX+0Fxy%>K4QZ45v}`!vji!k5(nJVp
zgJonz+S#3r5wocD&F*#5fO5jfPZG|+t!wJ*ML5ae!!566esM-}?`dbGcgA*ghLq$1
zHheGd;%p&geRsO8ZyE1b4dsym3u?jm#Z?}*ruBVVO~-=auR%DEAtx=l&WW_!Yb$+C
zmSY<nDmc1Q)4XV6kAv7Dc$dpWg(Af^fk8h_A)OS$vLKAC6~V1FVekH_7jUk^zX1#5
zs(AY@h<7mzj|}iE!B#7Av;cN$OX&Y%)jB{2-(+guiU4+H*SFyOC+vY=$e{ju-MCb6
zh21cI)M`^<OA28Q@x?@sZ5D<Evld9~+uGh|C|tdL)pAd^y?8h%P_u7DW~|A9v<MFL
zVkMa1u6<Px{b%}sTf&B@!!g;>sE;jAO!RfSgaP+8B<QzHzz5o0hN35Gmb{2EDIDAh
z<|mUL*s<Sw%C^>H7a1ic6~2{<aBl|=S%7MA+V!qvG2rVv80V8xE}NbNgam0$l#4Vb
z<2M?3Tsa{Bi3H?76%T}H6*vZGYq?Y!f{2FXnE{Twof-<MR&(n$R0H7EfOHg5ZTN}2
zGWQ8%JpDysOao$*HiotTfv17!_ZDXMjgvn@vBkS{<otT5U5wh-fWj2K=kQ2%Oas+G
zR}i?rRqXmT6rkhCCk5p{wFqkyK8Mg6>M20quO;l$)CFkUVutMV{&{24BMb<_BRn3O
z2%Ao+9IN86o8-ih6V68V$-LsyvYB-&3{6-!Hx|B*$me&T4gMDarv|kzvifxd0hdeP
zAP8xe0jVFpl+DJ*Yvx6MYdLtI`QF)<=kUGRH5sO;{A3<bmgMz9J{Auk>644~?GeJC
z+-`*zum8tBPn{Xx0Scn^3CM>*`R|{y|A>WW+VQ|_q<<;+j~a6cXwm=MTuvJ^R!J;g
zN1>6(eKB9rkJaA?<lpk9D`{i-+=TpjLs>l+%#>BIZb4nX;KJaja?e{H7gi+V8kQ+d
zAz0G;O%n~IK57u=1!eVP#oLcS_sUXVj))ZFB|K15DB|W>b5h@g=C<0jJu-G8+-kB=
z&!{WfPw%f5R$M@*oOQ6Zax-!sW?ul{$cS^M;5TxROi)4YE>_Kj*4raI(qB2&?^|BO
z>G<I~G;qkGn15hp?-)6?{7Q%^7)J2fWKqR){B}2ODbmKE`H{#o&8$Kzna8O#PW9Ka
zbceE|!Q(WxLaOoRIb_au%;xyb!WV(@BnEE#qS)YN#)GLE{#Se`=zW*Y@c!!ZVdm6S
zNAra*Yn!y8^rEGX7rEe^a6EG6kaH}4bD2uO!y^QO{qV+5xU4_pN*lau(5cTtBJ4-V
zu7V98Sj(QREIq)%ld0B>v~jXpXeWqNW0UTb17Am5JEK$mD2@w~Q%mq~q)D_JmQtYi
z|6_b#1n1Db&WV);MsLbrBq+ibxq_LB)h>LB#Kj!JJvxB_S;Kif0WXnkbsU~XD;i2h
z{WJt``WiNS@qg(nyXY_(USng<+xdBK330>hshzbO7@838zo(Hr_i4gC4=E$u)dgHR
z_)K5DLqIkiFmQ(h7H$b7ws5-I4YD3rD!x@3<(mZ$5P3qtRi|=?&+@|oRoRq`A^`*s
z*TgS#TRo@G%n4OUs~FQd4ADBTG8C6ncp%sAnQ2KARI(3w%5ZdtO4V)^wN`7gXfr6Q
zN|Rzw(&zpz$Fwx4E*8@LkgwFIha|D|dhXc5E8WXGm7$J_NGwXs&`L8HSH|0jCakEf
zh!BP;`lvl{V`dLARQoe=(n1-U3{QpwhPVl~O<*!$)DWc0`vt7q(Pm13oS;}Uhwsl`
zVt~Iyv||PhQrb-3>wUX`0D1hw{hqu|tqL>!xpL?(N|#Eu)VA3O;mWac>fb2D@cM*<
zIUGmKOS${1MyEyhl(2RH^(vQ}#qFy^FwMBG^FkX2#bSdI-K$#Zm`mg6>K<-gnC5Iz
zP5^>JZ#BgDtznyG+7gXq8ofeIa{A`?K$54pGC}*C_bW240@qqWU|RG{1V?bE3~LLa
zFRws&CUYxNBMd!oh6A_vF?&$Hg;tduQs&O|n%0=qO-5F>elb=$H0ROk4C%YXe!O}g
ze>@L8cs(%hIsM?!3(~~&WiX+KtTZM&lg5}V>~B0<r`+}c-TV07cLMjCKdPoo5BvPA
zBa>X&e38%rSxp^%Zf?U+GfV?cesZ1eht<x%ZGUFz&^O;)Fc0l$+Qi{blch^nf*>?w
z5Ws){0csQ<pr`UzJjX<{mYy@|D&R4HeVm38p<0+jk0fb0QHF))hcelk=Gp6jj8>(Z
z$Wvq-iYpTyeHI-ULnKHGw_(#j0ZwRvi8F^t2r$(m?=9S+@L>LX33&&gMMxi4-hB9D
zs?1}$%sBXQx-9j1jv}Ay(xxFr>7qyrg7j<(U0$27grA$nM~sK0j0R@S4XXyJe$E|E
z>|qK^WC%tK;p;{cl%IqYd|CvtG3U(|mZpEPO)a=}+z&kZ`4O(9;J~?TSyF1ysD&qG
zA&vhSma!KYk<E&*K<sCN37#j3EAZ%#CgWx1;z&AaT0)%<II~9<KyFX;csiIAebuZx
zJeQB+(d}%wEPI=~RY7h#+Vi$~u7@&54zndkpex<?y$k2`pti-wpX<aLrhxMtW7@r^
zw=<&F6SnDBmxrR!iAu38i#wGWW40*uJ(qk@RM$<<!!9I^_ZK6(vh~f9#_FQD48iET
zul7GoRgjp&U4JLLg*%1xjiK?<7^nt%u-Uzv+@Ugl+Q!xJXzhG!@P|qZ1=o*<6&D0#
zk)I<j|8B0@+rHqv9`(bQiR}Tvo+$U{4szy^c=gUJw^Y_18UY(GDM=HgOkBByOk9!C
z2-NBv@rF)RGlYm<JE?Z85CxVgUe-YEF$(!VmuAQCu6{KsiD8gzkD}G=RDqyUyup)+
z5Y|;;2jM#Q$Cz2;ejdrzszjSv2tG@RR?aiP4L)r}*kh3p4nP+li?`ien{*D;N-+-M
z2(}>F)wPW?(0fa7AIa5<1&Qw&J6-r40l=aFPgh?kV2p9a?cw=OaR3zRwXbs$OJ!;i
zV{$jQBX?4orxLWmTrB4Zt|~<eiIWA0o`1!4M9#~4O=fv4T0I?uCtjTe31%aIGzkqZ
zTGbP(KWeQFJJdaERluFgTmWPb<VtzD_Ch=V^Yi*SxJm{oW)>(knLve4kd@&_=uB*m
z)Kt0_w8+34XYGk&%~Q4Q;Y*pdPSF4DcNDC9))ukqM^0d+A?ZTOaw151qK8BDKWVad
z>bTV06P7Sd2=Z#4Yt~Qp{(^7M;*gM*;{-G{=}bVYQR?$z{N?)rtG0If&CN5twxA=t
z*Uzh=wW%Ri<iom&+H>Q{UWB`pOobDk+3^x!gLf_S)mhr)K6G$l2IAI9=drGIB|u^<
z>6Ph^g;uJLI6MsE=tufJ30dW!Qe&&T;H$@y5%ZSl{m{D-^-gWsCoct^LIE73-xzOl
zXizQz(s4dj$^k{KUwN<yF0M@a9+Q<iqH@PXE~jXuCSQtJN({mo-}sHIPF;f6DYCq4
z^|#H2h>?fFP^#u~2!4>uMr~lsJ70U=XGM~&;K=JlVl<O>e*V(bP-69nT?>6<1m-Uh
z23mP1sGX>4W07QWsFtY;W&_K)2er`IHEHC&myyBfLfO_&h~K)WSipUn(V;=Tr72zh
z>Kn#{{1bOHv4<?DLd$1)I_idX)O;*Gh9pT-U?=pa74es6lFuB_$)3E?u5$m`Ie%c!
zytRS9vf&(-%fi!az;0ZlPI60pm7Zmcy>j_^Q~H<_Qn*XjR4|Aj;#iP&OM(<ibqlL6
zcYh`}=|L^#vRtw4?f0Mir7=V+{rSq|>Xiqg+3r8{xL+$J;@~UJ%Y`=l9d_g){8ONA
z6Y*cxM=b(`ED-I{;NZKk;tf7nG{_3|{z1pj-lthgKkp$`M7`i1R$9IIBwvz0AQ#O8
zGBq0V-iZbtpY+d(1#bP_Ar6S`(G66yq_nX!6Jgr5on*?5mBvu&VsbKjGwC*91J(h^
zsOj<B>7#sj`#byX=FF0d^BU38*g4-H>tnMlSiZM_OI~&nQwFl!#7?{GbXLZHpE?AR
z3Zies)nt*bMC}!R%Mtj)In*Uhw^*y1z|em!xNZI)CLrmyG)`nDWIMIkb?&Ts4IXuO
ztC>?{(&bYeh)y|)U)C=ht#1nGe`3rMeBVE(hLn%08#Q;1n3x4|#<SL%#h}WoBfLs`
zpRQsWG7K{l*T_M=GE)NsZJmSURi$lrUS`jGFQaFo7V2Rj+4kkv(qg@g639x51cO=$
z;gq^gcIRA#E~n<V0{BzSP5tRbelRHMf)&J*YP+{b=AfT5G#zWG!!TnMXrU1Oy^2_G
zUcSn}V<|$19{}WE6}1oH(6v&0S{&Y0hQ<Cgy7t47DOTx{4FmrNFJhh;3`(<?uW^Zp
z6=hDkM)S3pA7>Qn?0#-0X%*5j2{PRS?(Qv^-4oanPr^i_ri~E&wz^*K^u99aVoEsA
z0VkiWXkbk+;E|S*x@<ufSH?q#7fL8RKY@1_7Bh^X3gqfWKRTjh6G|ug!$)(aJKES#
zwmd@CzUVFosgUktfdt>W-D?gYwpLTahrXXfZ>T{i7%yA&W<v3sj3U@DLejTLnw=7b
zkpy*ZcZWAV#5*{&jPR6s?O13)0$3ik(mWQN$Nj=0A9;?k<F<$ROsXQ7|3);GV<BnU
z@YSnPycZ=5!F)tC`#?uHIkX1H7!mULe?ZQke2gNE=>pgU;-mX%-=)1A)XiV@#&$4X
zB**9IMqA|-s&Gk`tvM%kE4|-lQ0^>%$y|8adZK2VCV%*He0MC5w{Y(Dr1$cx5k(l}
z=;#;$!WBFFeboo3<I6a*LQ&P<atRuIiv39?OdFdWlt|V7xD{a!^qCP6R!(SAl>7+o
z!0qLdZ17S(_VA7X!xpd_3T`evPE3NMfNKhMlL;#=jtfvPrd7>>+87l%UgQ+9WXLcK
zhB4_3<rNSavyhY&;WN>Ou*PKDB#b{Z%j6bhgezC{uycOgJ{5!%gbQ#<*+|eU*+V>@
z-J<zD0nks?rYVygu~ap)6s(6cuIdf*Es;a}2zg~TQHO`V+Wr+BTb{;>CU0VbD-e+i
zJL%P&xJ5gE{;B9%i6TYy-_6a}k3bW75*oxp(&eb~qMb=?lFlpKCgrgLc&&rE59$N3
z{C4To7me9cv$Mg`!~TiI7W2+5C2$H`*EnBDin`jE^`>-ER=*60y}LAYd?EHQ1`FD?
zj*W|YInWDZta3vK00R@m`0<d$#P&DaE9V3{-7_r{2}?)Y8@w!I!=(`gpOF@UzetB}
zI18dr`K$73zzh$NCS>ire~-^4O}guUfUp~s{tNn3#^Cw7|L1g!-eRbS1+ai*Y!viL
zXnO88K$5V`W_F?#RMD7aXiYw?LiB?;rLlSYRLed97J$?kQvy7TFn}6G-afBkwmKu4
zWSNxy=5+Re0B(%7AFXxR@@9V1KIkazyv(>WQAyuZM0k1Pz;&hbDOuuB2d%}YN0*B@
zR=Qb7t*b99wiw$6xlsFDXFX^*Hdv00ADI;JKrpmi+-~e1C8bs!_-oger>(&c&q4p=
zYRC(?^hdur!qEaDGzl8VAf*&7Y@}Dk>8(a5`t3==hkK9WaL(#9T5jj5kO&N+-=A}H
zG<CAy6GQY5>u|d<=J{8%JxP`}rk7NNwvGWE?GNCAPk}KsYU2RN!%$u)NYc+}%4h;^
zP~KwrV*OEd-7)v%j7n@DO%ARt$*b~=7y?}yH=oYEni>z(ELHQ81gj}G0biR%BtLBt
z>dYm1OBmT<wz}pI^5^EECU%iIO_N_Xd4jR2!th7DfH2DP*dc%mKd!7u8wG5LApV4;
z61xr3@d-Q$2utMBF{ff>Z5@Ax<w)*l>bPSdLra<F1=X_^sGJ`B?fBNamkzq`pU&q3
z^&hcsZ`{A+Ikmi%-)UTD=PXE87|!E7w&3Q1KKrM=gLno+YqswoYfafuehp}f#F!pQ
zDkDovCQ3J-oZrdk$gqqRc4>YQW0rd<^~Y}fOoUoD%FO*3uFp5{&ZgbrZcpH9X23gv
zVLF!LxYn|jx0__43q2j-@zc-#R$=y;0&JDGGpv*ZGICy!S@@rD=@=VoT$zLvL=e_l
zzZUZX2?6qaX<-{Rw=9MxqJ-<y!KHc9N810A<^G3i=R;IOQuyj#Wmtr&X%WqohrK02
z$m9twg2OSg4P}c5(8!*0<p}sBI(+{rKuqkPoh(3qjwf=ig|xq4vNtQVr`y?kFI`|c
ze!&$SLbWAr$SZnIIsmF0qW>WuYT-jD%wOj~Ng)VfJ9sqK(a4Y0TwHIz;)|2~AV$Gy
zp{|=e`1Fbf$IsHl1dSR{6FWxC`ITJ65H;6oa4mg3cnN8G{_k+p78eZmZ&E*hv38RJ
zB)2Hr!6$Y=r`1!#9|P_<G!!;?N*FBU9#illX(j@L5;w%1tg0;(XUYe@E>He_fy#a`
z6v7p4D9Gw^PrzC1kd6Se^>Y+$4H>k!RUhS|>dOef)(EdRt*Gwhy;UeN+PJJo?0)hy
z=dTaJv=+;IzDC1n2Cb76(Ag=q0AlfKuW%4zwvP_nb{J3V+K2!#HbN~#UDp3ql|4<L
zhFbqiDGrwE-rqXsuyd|Z;}qwjvh384uqqi|lox&f-(ZL%Q{;du)M+@@h9)lil6~((
z-#+WdHm5BgBb4awL0y<E29pc)l{~R6jw}UrM5^P|b@z=s_WJklhNC8M0WgXtem2RO
z5i-nZp^tuEikLz(SGU7pmt#QoNy^OOCI`OAmXd-OFWJ<qnoBFm90r<0G-|A^$6R*5
zn|VJ!AUt3_J{dnCAFcx73W(yh2g&JQY7TC?NMPcV>m`D&I&~>eRipa~#v@Fo^Qh2P
zPD^!HEFn_WXmfc>-bcR8F;E3OJ=a%}Ac@O4SBh=N1MfNM9x4SnJ)#*1+$jzd4|{x(
z5nmD=l}Jy~M-bJOT^I->v}bY>99iKjFC5h}hl_&HiM?4AZ`x=rAL7_?4if9owY<i*
zj~bySs3lCgR)@&ZZ(o>>4J*s7Vg89VhrD#h>KI8!Tp32*T|6v)v<5>mQjNRtnKT8Q
zC35<pH`3y<0`H9z3k*c44{()Z3%tX{Ioo0d=4sLlPI)dkjQhnp9_^i|rYx%-JC6Jg
zfqjn=*DKj<4Hbiw5XWP@zJ9!7IA^DvgCCbWljThjOD(2WY7upjO+=ddER7wjr4t2x
zXr)h=2bf~bEf?9ZzY&NIjJ=9sU?Q5F>$%at5W@ZA@tZ%oxCXKk@J#q<tg_9eeHq;n
z1#}{j{u0>_vy;P8VK_1Y7(F#X#`J8%k-=3N^YwiT+En7NHGd>^^pHwRsn$2$URdg=
zp>X2LywvD)Q%m~nwxaqL;@CqU1|qbAKyJV`+abs(UAzW}EE3o<c|Z$5QvR}?LZldk
zhEw7r*+>=90J#YP50lC-Y8wUO$^r2rJztk<KzOrWNf3xp_loy5{rNe80hcqh$lfhk
zZpFPDVAza-Z5d<Efp4DGsAc}wmf-6mY7wGo5e||v@^acp1aMe>&<@s}u9hRRi8b3j
z{~O6qp=JiF)L8dzD9Xl_y<q18ysK_5SUDM=6H8NM@@V^R8J*}+2~TD;0{L>f6R3D#
zjQX<KNv&}w7*{j0vqDvacwYxrQ6v{Q1TkGNV39XNjzfc$63-L$>Xzzr3}*(tQ7^r%
z<Yo49rlgyY$3xJRK4t+n@lk{>t{erZsdnuTdLky|KNjgEu56B&7S(k4WWQNbG}W_4
z<sJD}0ZEIzrB&;<ne*+@(~<K(n>^(1%{H+7<-oR(+_Vt+haP3`hTW+B8wf~P1-o+1
z9=ao4*pCf8!3G3ty2yv!erwd$H*4B_A=+TY4P5-?9!rgp>@BNZZOlnRG#t6loVnI4
z-%kb8-LM_QLnjJ>NUi3+lqU4fhvTY{v1^gBdqyUwKw=~o80$+}fJmGzNn|6K4FYTx
z&#cYEwg69rheO$^ZSjxbGo68@QQEmTds=$=^`1k%XI<$Kqu{R{lgID`pjP2$sCW{C
zoGyrXzza|IGbZ@QPCHQcLw>C86S?Pc(Nn`;v59<2MQnX7vWYqX0Bk^={4_-NTB?jO
z5*NdLvt?A|ZWtnfn<!!^N?p>1uyW3%{Pjgfik0!>7?&WC!6pZo3Mi=abz`P?vL*Fo
zP-)>>K8h7CjP&qVJsA<_5vqlbn>obkP6XLQ7YhT53=&u|GCLCpnfgFK{5c~}fFRIW
zV5a8DZW2yt{H;7bd!F(q=SPw=BY}zyas)gy>XkTI+tU(t5^%GD`7ea*){Ee^Yuhr}
z=r`Uu+i@on-S?Ut8oG&`u!=P|Ayq~jId#cK`iDe$OGyOAC$zzdc!_gAY>k+sV`TJ{
zXpC#-V2T8_zD~!O?U!{WmgCO~wKNsYg3z~6Bst@$U4(dj&;Sa73>jI;#jF$c3#QrQ
z{q=h%nzYt#_=ze<;=1lj>To`vD)RsvC~Y|8|Iu`oVNtDZ6dqDiVd$;_Nu|4cXrx=Z
zK~lN|q#LB91tg_gx?2H3kS+lUkrI^eopa9j!|OWN@rSVYo;~mLthMfCC`*d84m?Oy
zOIm%3<y#f%qy&hA-!JMjeQ%c05de-$1WU7XfErbB9>6G`O4RLBTxni;oS+1=+~So6
zfw;POUDELphFcO#t2(DdEBvpvvvLAy19~5HN~+$yx_#iBWsg}w>bHwH_gUJJ{$##%
z_6rP!J&PQ>2_`16A!#W3Oaib0lEl}ZQuRE=J{00K(IGZ<x*UpFv4Tlx!ZtWd<&PkN
z|8Dbn{U>b7l+!yA9J}wz6Eh#bFtonBx=F#Egu{})pCTS;koBCp@(-WA<h&&R%X9Sc
z{G`jWikm;-FGEPc!{TZ|R=2tJVKgD){YFFY@n>r+=?2caczPUB%K_?nB-2q-`nk4J
zKLR)-Tx_(TSXYj70avNrd{!b!$`(Yfm?9#@`t8m<P@wA^``6^n^oX`uwaX<v9qwKN
zQSULr`l&$LMDmtM)G@E#Q&*l8PHriC<|ze^(ddlA!cvn*?ECf~K>U{yI2W&QAmC1Y
z&sxu2^iLM4h5ZEg0azgW1wZaFp!JP#Q5i-bfYlLVeFT{HqTrq=9~s}bBnUpsBd_2z
zb@vq~{8%+c%1!g>-1<D1sJV~SL$X@Od`_2oXcmu4yJcAer^!a~m}}BhIrXXuk0Hjo
zT*siwVt*+#hCS~ei`cr`lo5H5*MYp?{)r*V!&kuZfmO|FI9HF9ALyKSgB5?M(Wh8s
zC-qaYuQhm_ViqCPQ%6sn@lp(_N&B1}pU>9pF@PU80Mc_NMp6J?HY>jK8z^Mv+fE8z
zNQZoPw#Na$wE2QaPM6e6MF!;S`!4yWIXWLeNz<oKyBrEWpCA0Zu_~U3lIJN*8ws~6
z?Y+&;GFN&CCq*K}N&R)^YYMjnua<T8r*c(5Z<LPkpvdhWtFY)QXfJj;6`A42tZ=z@
zzC{nouK9v$8Ao1!L2>>V(gXexXQnuVcV~*9MZP%;(xWIE2V3Ms-hNvH9JHZVueskn
zM4Z5QQ#if9-+Mt$qvZ2im6J<VP~Q;9_te7j9zMy*#UHCI9bOhDv@Yhh^OSjJ7f9XM
zz1Hj)-jhl8RUu;6;I*Qa;t$JZQK!o2gvMu8CRu_4SK`G%v2PDeacK3N0{`PK6rGgy
zWkn+{xM1B?AK;cn%t*fMxQ?)T=f~bSb0&<NVjN((@cBa8pNz=C^fO59yzseQrqYBd
z!qQ~{(-11Tn*oY<Zln>1KMl>2&rEQJ2kSso8Q$#<#sUFKGJC7$G^C^~%}ZA(fGoCc
zE9RX0n%c5`!c2GZNZs9C(oiOBY9~#dNNW9VQ@UDF<WFrGPKaHQA-Nz!s1sT7bG5$0
z0_^cwU#vQSSc`NDA$+Tc?dR;nLp{bk|Ce@+_}1l~UU^--90UEn<DbJ&z!k5C=T>+a
zT39rDd4&P3IkDlabO2vIVoG*fWspJj<i)N4!j+D}0P)=aV-M*;IIV`Y!?3Kv&t{r~
z5k^Ok5`4%*=UY9<O*^8pp(Y=+*Lv|=r_VAOMlaeCh<Pt<&&5Z7n7OCBy&adgg8UU{
zv4K3G&32l<w#VF>h&F%YyPB~cxKDx~``-JJLJ>yKGS9yoj^nqiMLynu<gtgbsE7EZ
znV^WgK1Y55$ZBt@2kO(BHwo#3M28094JJ+8?<w~Rp4f=i))U}jb*dzB9s|?9-pz90
z-dcy!7VtV;<!Q0SkUdi%6?zsbvkbNji<Ru|@>{^1J_NQni63i$uVrs4l@pp+#{7%x
zVfWWy^_392?g*f!`4(VLR&@HwAK(w+k*-U-ry0gyLprH-3+#}l&qZrcH5*C_+j6aE
zdYqz*sRog^{}iz5pvN=_f|=)q%d2x;K(8f1yvrp^nW8V)4d>r79W%={(Pm)`J}b~C
z`+4l|ycy42FLp1imG~!yTu&O~V!lBgs1pUeBqJ5E|2cBovv_S1d%Y7>vVY@+lw@&!
zBm%a9>YL>HWyEt2>M?4;3t8sq>x;ZA@}mHG#&}j`++OGqo^M>Jo6hUcC>va4g@=3U
z9Kw;)`Pn`;&XPCx23t(M*JKr(UvH5I|LU=JgyeE&w56fQ6~lCi*>b;?<G4)Gr;)8_
z&=*V|veJEM4RAj|BU5@-HldE)za*5e@Gkm1qpXI8Yd6Gx^j$Ukr#hUGTdbohW{4?6
zM_4cJh(8vG(2S%4;=y^!=D_nVZEn%Y{<V1iaNS#QJnndh+;*e7rg@JIQB3y97eQ%I
zVn~IJ{{jgq5%0bDr5h2~U&FblX4D5fJG9>xKbXh9$A0$a;-OI7*D;HcspW@R5BXO8
z6DdYO;}pd*3Vh$1EnjnSRShcl!}kaOsR$xVf>y83kq9<WBFwRcSU)sd<hcO)zUIm-
znqI0t6ZRrq4qL>XS(esQw@%ooULxnP`|Z-WPZn%2USfS3y_8U=G8PLc<+aJrS5WU*
zi^Ed1=@}B1JixR600Mn__P)5%5KEPHIEsF!94lqO(Z*)jRX;O$s%gl2pNmZ@KE5B)
z7Z`)OWzQaz0oSWuqQ&Q#n;oMM2^)?7EeGjQ5IGunoN(dx2CP!N3lLwa8m}9`D<=-Y
z4f*_aPlO)%I=$2HH%*9BL1i`R0lB&Vl*KDsy{YrpqvuWKGL>P^Fd}|9YvkBMTY%u7
z9*BNuh7JK3D{C0s=3;V!ISH*zqu}#ypfb70<)4&^l;8H}Yx&QI+q<Q}RgVSHw1nSg
z3gp4}w`)itIe#8(i^bU=q{{zzx^v;EyZz}g<08(BcFj72J&g?igD_rUR?FSZ#x&T_
zNMZUA9-S6N#3k2IeGNZ@gUPp})?{wr3IK1OITWaT$^c&Lr6~{3ARs?lu~o)$EXfS}
z^?{W@U-kI8U?I0^PKY&v@Ua@`xQTB`-ipKwGsYa6y6h6ign%Q!>u+8e%m}|N0`cTh
zqHt-z2!=cw%1{m^8v=y<yoZhFa6S`W&+1uqgS%56SEx6wh^<6L8(XH`G^b^a16U#1
zPVtQTM0HB^Cq{={X|xVd(vUJqL-EJUMxb9_j2@w19(=q9b8zLZT^5$@6ENdsY?;s)
zhLLn{tLBZ{Iwhop!8l-YZ@DGBDBPyDH+-M)wqq=rVzc?vrZG38@-HsgT=Q~#jZB3>
zy)!xSrXqp<#<J3JD+38g$-LmS(HR6$nTY>KW^}j!POi<74WhTRqeuW9ju#*z@n?*K
z#Ypm7SY6cTa<YDJQETX|s%I9f4F_Ev7Q34PQ(DZ}4*qOMUWJ-ulC$`H#2A==o*1xa
z=Lrfmpa()~D#{U0_`7Kx#8)ZFf0!>Zy&wA4vrK#j@$^810ULbV?}KSVm*S|vb{#f9
zXgD*#RR~slh<SpRArWw1?hqv|xr6i9yVrS%>od(Q?c+zbFmvtVRuE`FeEIT)b9IaF
zVi%z5zcrVsrqWF(V7Q8Vcaa39fj(9@tUuR`V>$J*Y?iiSPbvyY$ASzYz0K)OZ2fBw
zAf`HXeM_&DBK?R9O)*vDzzAi{$g8z$`$ni-EK*}jY+a9ti0<Z<E{Tr!sH94m=dG8V
zB~l9Wn1({abbXk&IKm;}y~k2K^H(MeDWRA@#JIwNu`(u!_ca(9gT*#65U31XM2pG!
zJ6rSRADF-e{i=Zz)6uVgI-J`AIy^sqm-Q+`^jVk#TYQ~ryj&dnfwlA4BQ#;<hZlb7
z3*pd500CLV7;C&^2eFz3_|eXIEX{vk80ADV>FnUt`7c|2Lr0&NKe@`@TGQN;rBZEL
zX?^I~<Xfn&_C$7?&!{0SMMcewY}OEXSqQ9X#N}((;bjPdCLBtJBCc9MYuh}%Y-zh?
zvDfYcQE@8p?T;k6DQ;Uc`ImC!h;IpW=_P^04+&@@)RAIL%8{U^VYIlyTEM*+lG_Nq
z5FT%(9{5e*yc`i9(X_e0sl!s5_;gHzj~LXnT1;65%aX&lz9WQ#2MFN+6}=s-30{La
zI~?HP(ElS&RtDN`hfb!*qgSDQu3zW7HC%fizvry0opa-xhy6jgJz~3z4uvFQOcx%M
zj+3gwVt(ZR{iJRyfke1(<hjCkoM`$aJt`U5<gQp)^ik~5$_X0;iiqKX7_|Uo{qH5!
zMK|J>)FEij_lw;CYTSb_pEDXeIe@y3FGpL+9VwrB$_+P<qm0Zxx3A!QX+X|fubI}?
zg3k(EkD%$w`O{O;sb8C?Ry~hnn#mCy3#@^TX|w33;@owER}|hl@~vr^CVXNHF~C-S
zn4SXtI%W=zeF7d|$m{2j6%_4iMUy((D^hurM1oL&I6~{im3F)VLJc(Pp$UQF*br)a
zQDC<K1`_Ni4|$^B5DXsGg_g)iaCyA^<{n!M+gLR}9j?D5R3`mmlHaYaYt@wA56Hby
zDjLYAbAmAuo97yi+k}Z<v{V~Eglnd@Dv>rZDn=JEMmyl35?b1^Zy0VIA=GiY#lm02
zUvJAY*8EJP>4(`7aRkVhI2w-tt$n-;4QowISVIxwp@Yg(Wvl2D&;Y$Q9NW7zY$OO<
zmx?H@*rxZ1TZtx>KHs5|FDv4D3fxa(77v0{8KjYa<7hkzm*UBIkb^w_2r^j1kg?!6
zD`8x6W?U%EG2|d^mLzNF2?BDtsNw6!9{pBS9*&Hnm2q}pqGYm=Jp%%G$Mzbi3fQQK
zZ7LuVS8eA`$hfF?Ym|=C;4DoEC=b9JQDjK9QejW%;=dU3x4WBTJei^(s9nqdfd1G}
z2dyfF$;+}r`0|GR87zT!wd3%Q-P&z~kM3rwJY!r)?PYY+^b2n{puH;53;DkVekbFJ
z?c2t1&FRFv%pZ@Q<mdWvn;u7yD#%2S!aaC+1ZfWo6XlHmPLCUFgvRkke&v>~rij(s
zNz~FcN4>iqJ-_>##xlyRlK|I@25UbA*H#Gq@>4`Xddm#wMzlx$dg-(5@3GGw2iE-o
zY}3fd2S!V;rkFmBk=Smrn4<=~e{^pM-_0iSMVkeyAoNh9H;<{|sOxY$MM5|^sKr4v
z29Rkp?tu?v@1!qysw<Cuz96mjfC3BTq-1%>u{(GH{e+d1C$%X)A}7gbYuZ3xBhS^{
z@bv#Y#(uvBdrkbAxU|N-^SPn37TU6{B~J;KKl@w@DSbZIW1;o~?tbj;{MVD2SAgXR
zVFAd5_j@)*h)0_k{EMS+PXNZOSE#z`N#ye_Tb#r<E3!LRg<XP}4ADjLg_lhRzN|?E
zauMJsAJSvQjnfKp=Y1RpQh^U4h;StsI@c8$D&vIARm6V!cn<q#>j;a3B0YcAbV4{o
z(%=;D<lhv$bFuSt8a}$maab29GXo`I!*lEj$7hnw3Kl8PFF##Z$zkW{&u>>i2fuHf
zFE7Dd%E3boQuf*XZg~x3X)QHsGhjSMvTER({|q$K2r&8-15&ml1fuGg{~GDd4lLQq
zVWI>9`D4~5a_&YAk@j-CY|3)t;&;@nOke1ApNz>p(qCkyi>Ak~=WNlDgG5kEhc)Ck
zwwGgrN$DC6l3U^mr0D@k%-&!Ppdby38d*U>8nGwYDK0D|X=p;q3;29M>EUqCUmU)j
zrFLOVsJw{(GfWGy{?~AT2~WqzxKE63)B1UD&#pCwV_$t>z8@5>^dXIN>TSvui&}1~
z1pw6x3mWv|>dF110Yy43Sh#FU_m%hmAksw_ws+y$z#@Fh{X;(j5OTe{m^2${?Mn{i
zM~ihSWuTLOm<+>E>+~<E9Vd4pkhT?Vx09Mpt}wR-nfz%1z4uUrVMsw1Fv(b~H~ADc
zCw9pd?vX;&DKV>yzFtlJ33EPyY=WKg-#t1RN$hIwpS6F2mo1yWmZQ#2>9VJGKAQp$
z&#_s-nkE#a;rc5uQ)8I(5M~CUFx|J8n*i-nQ!$b^$UT6;P*`JDM<xx-SDL6A0FVw$
z{mkatDS$j!Wk{TAhV1*HI9|~0)=M0p(cY<(m%<VB0<qF`f#Z~@@(W!u0|V4&3X}#0
za}EqNdoyCLXQsu%<;TXs)F2mBb#qdio!Er~<bdWGR}ykXl|Imzp^(C)O9dxS7p-6?
z8bPL{`t~bW$ko@kv@zo|iz@*IlM|r9>kB<)Q7mO|+$;T;`KUAb<=^8-+XOemQ&`+W
zn=pT6t!bY=wr<!OlmVLK(^NruDH@5>ODe-hR_T`cOq~&Mr|&5{P68r20-ew;Z%q?J
zMm3#J0D`gWpH8TH!TG{zl57Q&E-^*YYQxtlbBMq^ptmW2_l)2tjDnlR`$B*U&qYdr
z4#UpiMT5Wrsy<q@N5sE0c2E>%3Xu%_scjS(cY|KeMLB&gVg;|7GX7|7|JP)8b(*6E
zhG74!+jfA`joIemSBS}e|F9Zt3EgGHVl`?hST)p$of8W#*^zw-T9g#vFzKvW@VIUC
zHbu6+=~ZIYk*?VLaoF^sm@redDe=*^>MfR1vi6iRnL`ISP+jMp<D<YWiLW>3tAM1B
z)blvSAiXY2GT}Ezh)O#O1W;rJf9Dc^EuWf}7T~ATLUr~FrdPAi7KGgWmBBtNCr_Q4
z;nEnTf8|AHaK!aX0kZz*A<!#OfnI@HaL@wM48}4BIL`C-0%}y>cbeSG3Fmc*;nZ!-
ztBr!4@)40OC~{d{@#*Iod)27M>N0^gtPEB(-9wNuou;N&AbBgI_yrp($7;h%c3?ax
zmz@o;0gCkt3IEo0FpIhn%MgH%D77aL;lTHO0<xP`x*IT-6#|3VD_KwQUudHi-ha^|
zk|~5;pTUb0DmJYP1oN{QMr!hD67uO#g!mrf;ERcLe5HP>+}M6#-J|+OHu<M@HRWeE
z^Kp*0<p6;8x%gWa^WW>;Alz@n;&wIPt3DB&V4}KS{y_-|Nc!`wWr(I<*M;=xXtV4|
zR(Q_%<MU#|W~KM(a=7kvcDh<SrQ{``xh6Sb55oN^6E>Ko?5Uy(1(VL3_N^6OyL>bd
zS<FJ~*z%upoho4Jef~ybibS?FJO6?E>pFny34K+HJh~JoS%-`Tk*S?nJ24U1<9<JL
zB#*Wi#t0X;DW+CF&5Z9zr$>1~w72wSDCdM|;W+2H4R0f6!#<$?K|;Xp;Pa7S4jCpN
z@C{yqCcc-;4hBHMUwJh&bJb!PKb_ZJ^nxOXJq~{;UI65y;^A%jIMolxMV$NMpwij9
z8e!A868Ff1C6&7PS%P3E{gwp&QqNz6O)H*77*eoYaNifoaj&mLdh+eZ@C+D~c8+OM
zM1eHAv+Hql{;WPbS+4caAkYc0LKE4M$v`hmTbvR#obsl7{;wS4t`e!2X%keQ$?VO<
zFWl|@M+I*<EIvZ~RKE4g{7F1+mR9+33yGO30~)rD&q*6c@B~8PW>CG~eWJ(p>qweW
zMoi%}+52jJV+%#;76mXfdS}?QR=hk~$4WyvN~a&h=*XejDtx!TWXZs7VAPz8E7v99
zAZ=8{^V-cr;|V&Ne_o)Ra^x%Y3INisqK1=T1`&^#FU{?&lN*3RE7pNZn?qB(&j+yo
z|2c%O%0mQwrj4*<lh=1TT&7&A0mg!#m#)w5wZfrcZ8#TitQ(-C;H`(STROaTlTm96
zN9V^4;=0n3?#@}s{4QFJs1N?(Sikcm-`W82eQO>bMPDeJOnO)6WYR=5#8$d}fP2~e
z-B0eEV6f=B9MMBAM|f+*tMFuWGub%ig)mV2^vA8gZvfZ9OnmrpMh49bR5ZBVe=AS9
zt#{pC4x}PMN~)XgC3y_Kpb8TUIt-X0nm#nS%dNIsm9I`3?0=kN4=YkOfgaGBB-$EN
z-6LGUTe!d|vgkW1O3o!8iRiiK&}34bU*>d~%GQqS<#MlBBk61Iw9}M|eMmHA3PgWO
zgq;g=3V`FF9fPKt*&&@nw+j=F4~N=5Rs9xX-m%VN5q_5O&Q~{stTO{uGy?aN@OU!l
zq3N-0DCywOeGNLivBh7f7Xm+!hB*_%<clLSsBASm@=Y#FdWkpHX+F5j-2jj4+TmcK
zMy_?j4KD_N&z&Or)!?}jwI0U^3e9LCm`F9Lv}D4QGlNYIaItELP=6e;eobAj;Nt0%
zG}YAJFOAfZW6}n@a}B!4iS1ow;G}&5*j_Ch^l_52IC9^(eSN{=AW6R(O+=Vs?y6Sa
zmRQ(k3z*bf{-%N=ip_0bP)NaTT8a5E1le5M8YcuI<s|L`tr5+*L9?oTW8=Y(ulzt~
zXaGEvnmz%#{rajnbh6|`8OEU8UKsQ?Sik3>i(BETt5<1Yco`^bp)`Y2!w#>U_89-P
z0(0%hjaIIC7A+(3fE<#-?0^_aUxRZDpcEd7?|1MuNF9{;PEO2WyDN28g?sL9It}5C
zN>8BYf+2ipbA=CQB$__C^rJOjk`7T8CiW<!&TmUb32#9$$h6dFbP*~=5M%SLd4MwV
zn-icd@NW5c^6i(Y%l_e6-vMMOWfriffnr5TdWrb}5i@s>)4X7*FG%;%C`R{~VE;fN
z`9zB2&<scD^6VN=9q<`piAsPZJHrCkPU0NG!v?s1w*^>t@GAh>^)z#!tRM$3A-OQA
zM<Xlt_QJA7`lGgpEB^>&+}ar8bZf4)`*ca*gfcVXY)1SCba5Am5{HivhrD8!N|0qE
zMOb1W&k>CT+nr$A_!DKI9$fgFnU#t*u~?E?28eSr%AMdWhDK@syM-38wW-grPkw?8
z>B~Ktt~eDHhoi>rS*D_BjiR?_slhV0%&PR|{;VO=X!s-6<NSYr3bmeW+{vPCS%agq
zd%_VcrjYm{!q3V8HY^W|Ec2%=0MxC0T-YoLMDfs{VOlDx6=${y9v$&J!UM^)K=A?$
ztVOUGLtqI3@y*<0hr`oKT}lMjqOka{FAHU2VpYHWb=0&~&65C9g#szq<B|?v1q_Ub
zAKb9-2bSN6@|4}QCcL`3!-lN)ECfsA929&7XIK+2E_ree(iLZ-g|I1mEH7V6uUV6i
z3*9b%=Sq?|;`ugS7vzAdK$}nr5LeFf0v;*ERh3FE1${erJrRzlSr3L~T}Xm)bV+<g
zsM<dG8Dz}G#T!1?!IzvopvNo*$8;GtUU^auI1Y=d&(T?9W&m!oe1YH>O#sX8_Hg80
zzY0#_bx34REvxv1DTT=(wOJm{C33%GV>|z{0IUdv-OEerzMSSGjj+XK@B$~!?t95T
zyWvzkx-AMeiW=LM&)+Rpe~LbQ4I9U5uk?5%g&4i38ts5Z9rX_($VVWywcL#Z`04v#
zbf+@63Z{S;BP?AZ`kQiO@5fLLOtfvE7FGS0)wicpu!J!4rlEjEx^!jS<%OXZwJxJ&
z!;O5xbbiix*@8)a!TsWqTl2R(69nP&Sp1g1>mfwx!F&oQ@<qJMhd^@O%dv<KP~3y8
zm>W)Xdh6)P553=mZz}7|Q$3yQuXz3lJL#fs-<n!0d}ZxupNRhQTeQJv6f%~H`uY1;
zCKP|C&;+PY{)@drPLDoT?tDP#K^g2HZ|@Gz1{Ii4U2`V!!zr-wd8Fxphg4LY>${S*
zs-i<JHH0JjT_LH`qG_<mlj01r#Q68#lMjA+nN_+-$`=U^Yba=kTM&-YuM-UEt5`>H
zb*RcSrSmS3|Cj-C4AORSH2{F3c{}@n4-4c2xHT{Lgw*Ka>#T9GXmXj0*6eSK+l@?H
zp?4lFL!nL=n)C6^zh@*9zzdGpGowlT>a-Fx3RFL7Mg@@%5ltQ9X{nhmErAIL=X(8I
z@_;5my{QZ%dbT|~g|zaAc8mcO!wLSoF?;)&L2brz)-26WBeWCZvTw-<{U)=cO@y8v
zSqzPR9XY%4GPFir7jfcGm3RKzETx86x6mwueAkl}pc+A5fEI$)KuqW$0LY^!wc@M+
zv;<qHI%5<T7@d1Ay7P=tc_zHiCCkJM6dw{P5sq6`7vj@EI#u|h>CFKQ!T%hwQ1N(F
z#R~jRJBPv|co<jB@9cfP!R%pV82E#R1?<5ap4}X@CBLGiZgHcdJ!0n7D`EA{EbY6F
z?ivIifEE=*i95(lrHN*D7cfF)*`eSaSohV(;v@plDUg8XsktE>2A4^Z4NI42jEdoC
zxz6Xq+{lF6Zv;<Y)hbajMu$V?scnrLVY6Yw22$E77*_u5$8Ne)<D(8yw7=_kZfgW^
zZjeCYqVx-*-axQr3CmUh@yZB0etRp>P5teG#KEYB<;?CS1u-#W`PWKPX=aKsl?ukV
zX8XL7o-s85Q6#J{Z0=6bkRe8c7eUAHjxuo>qd|*J3a}x?Nv>k7A}Y0d;y;f>QB%5s
zqyn5C&XCx293=gu<wCIxE$5D<e<Psxh;N4ny-De7u+zcl>tCJ1pWIh41Rm5K)l=`W
zbD~QaX=)p}L3&m38a@rQ9}=irRD{pE?58n1@U<WUd>T?`g|T0@KwS7&g2~Dc=6}6j
zh9)>V#4;}5IHXh(D*i0fY4DRf?6vCbvN=$4^vAT_*ga&V4pH~am>$KzfPac<8$2NE
z6&y2dn}}l<X%3uh0I3rikU%+K`5{yj<3SXf%lp;J2_b<Zvb>A<gA3mh{cATq{`rB(
z!$*|RRVI_o{?d^EhOH>rsD&^=AIQzs-F!tw6wRg<fJiF+cv&p>)tq0N5$gS8@Ryj7
z4<O)T!k4}nxX0EBbBsf<KaLPi74tL$Y7cxpEfQ=t83WSf85J{a7i<&k3*K*EmNV6#
zk<!zHlD9@8U{LQd=-_tK8NR6exg05OCgPDSn^=-OT>t#d`u4|IN_!Y+d|G&Gd)na|
z+|lO&u8nE!Xm{Yrv@r1cC~_;aI7bfWn9StuQ0WP=GLBi+s)~IgO)dE<XaV24dvD+^
zO6;03^>go~L7$?A0~Q3dAEQBzmVfynayr!Np@_bP0`VnRM21PMbB{q_9s7|PL1)4t
zL3|w{U22Y-7Ek)aBu2h!%pCHDC9BFGW-xY5937I2x^zz9NISY}20d`GAg`Xmo5GB|
z@llO2UWxGLO}N`__Fln1H8OrUlQyv9E;fqb<O`CZrMCdUP50$<ZHXqPCAbrA?rVdl
zxuDoe5X4fC6HFF&I8#sonP3m%TLS;qpO*}9We9mr!2wQwagi$MFt1rl!85A<@inaH
z_tKePinPdMO}0+a>3jU76I;@LOsE`MG(BL8J0e+~vk4iU{i$|AAnFpZY@Z_RSQ|w(
zug`jVrx5$hNrO5Xp`Rdyj)`uZ(Job~6!|2FvU#dG5Qh$Ql`+Isu_B*V#Kzi&-%@Kk
zD81n_GKV#eirWl4tBkQ@Gx9b~NiQ}0q788|WdvaMU=&be_cs{)tSBw(%_n~hAX&=Q
z)erMlUUG$q%8ZSZyc{3d`17D1LP8%+;w2RI;Gq}7Sn5CQ<%D&ALML6Bu30U}{ULni
z*C*b?+4Vh|lp+9OvMy~qD_~FmP%QZCp6GXOs0HZDXb%aHMSm^Drdfr^_i58wfCfEk
z!Nu9PC&2NX<6js|-TC9RvLVwtT7M*(Lb7+3w`A_Uj;68jc;aUzc@9n39PLDQ-awQE
z4y!YcNm*_5c@pN~P*y3~cL&4U&OXcUDst(CP`X-3{JZLo{9h>_VDTj0LUAA>0?N~T
z%6TAWKZ-}cf!N2Ug-~I-M&LI}GGtnP>$&k2y))ON^Trac#$YU|d8zij@njR%=pwXX
z>wwF-9q`^C*GwMtz<ESDLEPQ>mGE!qqYl<e=12?%^PCT48W!PP=px)Gr|>n<h&c@4
zG*4t0?K^$p8GNeH)&hcq99p5diAwQW>c{XoR))fXStYH|stUz^QmDMw9!&d6eV=oa
zANLXDpCoOvY#8ip(`7jO=}QR2cyR}hT67K#atbQxjxVc)X?ouGe|zrc*0Ob62PrsY
zT$4_L09WTyhY6GNqz#9gO`#3L_{y>Lv5%x0ROjo&dB(`=s3P6Yrj$j{q*{l_iJ6ZS
z18MC-@w2h_SLc~v-^AYOcUbP=c3|`>X*hxcrTclxLbr>!IOg}WxR$zhm()oYUG~;d
zFm7!V?UMH=d>TvwjON<!nQw9VdTr}`<i*#L;m;|i(_x03A5l)DETd?l|3$L#5h-^F
z=y&Tzj>=huFb~XDz3q2Bfw+fZSi$wAEgd3{yeh9GfuX=LNX(T3Z}2VvG%u;Wud{?;
z-4h(jt6QfJ0U%vr8@}}{ECw~YYD^ue+ZhD{f;^r6_bau4D|n=^6X};xXeyxnkO(~l
zu_gkRLo~>f@qsq~l{7#Np*3@=!qIt!IVw5PQ_2YNw_y98wwT2ERSp_*^)&^?K<kai
zT?ks-tx+AuwW7J}7oi&BC|2QkAq){*jRye`NEob++LPj%gL3h=jrx!QI^SO;?oXob
z0WkocH;s!oq8h_{OI2ZLbm$$Cu28A+9$es>Y&(><a!q&Oyep-tj^q68Pq-u6K6uF8
zPLG4pladEZo1VUK6lct+%CKk0P9EIx=sSm!#ge|Rx@*8$2-Lx3NUfIK#qEh%3tuuo
z_TK4yfupUU+7%>E3$Lo1Z%=0fkge&6VzDT|M0NorU7@zR^bZ0242Ugp=Kx!3dA3Sd
zLBAR(3{*coXGI|rX(}ku?52?g>oa=z9V=}8YP0gtZ(@-DvKw_1{RNjDTC$tg+JnM;
z4nVW<Km#-zN(Hc`aoYoMy}}O|9x~MAZ!~tJ#^kT{Ikli!FkeZ{HV|rA+I+c1FHyeV
zvs}*<G)DVo8cyl^mb-hAz_y`4*@oC(f>(o0YEE)OvNF(1a$&eHW(A0gQedX;z2wW9
zXaJm|=U_4@TrN0iGZhX?mzaz)Oc`092T*B952(ng??y`Tk$O$#v#)P<^#(LLt6p!9
z(yclhn5=*YIDwP(cibHx1kuV3kj7?h;;K;Dl;Py9h9wJFT;-dc&_t^l7gC?xM51g=
zvg6`Om$G@;BCV}%6i5PZ7r}qk&J|(C;0xrS?^fIoTl^~8?U*~7p3NADdgISQ)(4EK
zh3$4v*(^r&b9@*YTe>se$D2^66V_+j)!Hg!-dq-a7aE->6%NuRPb*?&`BX;`Q)C6D
z_N7y#^`){bOOf9!rh2(Spx}=J0T6u@2#8PFZg3sa#Yn2vw1dtv1lb%Q*CpO^9Q1bF
zFX>QuJ>*UzkOg>lGT)CY*Ju#tOoF9*veb%Z1?UJ{ZpMdWz>M((-VeQMvBn?O0As)g
zc?Onr4-q@{$4k`~`)#if3;X9fh>aZ)1|U}wH3dsD;s~eCT(W<q=Iwc87i+uyCtCEQ
zBKi57Db`C7KtDSDEkXLrQ=b#hdl$#r0uH?p9`j?~n{}$V6dv+ZOXGAee3Fg&Zt5bw
z1YmC<d9vDWLCYOyBhjE9sW%qJ75*Qm(*qU6u|Rtlj8wa+VkDWC41U+-FM;Fda4Z8%
zc&8$R_thx_+)kY=Zv8nd9PiGM@M@W;f$I*k4#Fi$G~HlnLqrHV_W%zBQG2_OKLkD{
z%qwdCr>zTIQl%hM?fhCp#b|$69ea#m9D`x~>i1fsVE3PE1N%btwU4FsUmjSMFv>Ik
z*!qx7+P~=NVe7&e1Ip&mA&YH)MFsMciv`$yo#yRpW0UC+C^Ucs*L~|PKy#?mI<4^4
zxxat-R>4dlDRl@jNdmgt^wA09+C)N@1H+okh`pFBDbTA7EhS7JUR>82Bn!R$+~@+1
z3cl1>u$bS!c^C@k4)Lp_Hro)JhW>&-yqK22&w(<+T^ut@(2q^D-jTzRW0HGO5?amP
z^Y&p)Zbr_r-3bMr>o46KoTsk~{?Md-aCf$vpVKA6<Re@Ut416|eg}CY*jT_0^x;LW
zY@Mm7r)zh13#JYUnf6oQV3)KxLRh3$E&wQ@@#e%gVi-GFeoS5ci&D^*>e3%}O;KQB
z{pQS^Tv*+uOBl^Mf<WQC5AjO+crI@iql6ZBxf}7j9n{rHj$>FlO#x{M3=+?mxt%O@
z%v__GzkUIWH$sBOBEik<qdNW-jkHT-A^5i6BP++C|1jGbOj_f3^wHsrG1&vSZLg?1
z_sr_MrJ)9zalKH59|9m8kDn)-3_J;7ytxX7DnX6BzQzMg95@V6%7U||W+R9&w_xz%
z+=Lz)G$P808;STt1Xxhf`6E*J88fR^?Y+)Q2ivqGke<K_=``oC*0+6Gn5NmFx*{a*
zzl#Vzlf0YCea#>d!hV`en<8k~SFYjcS<URekYb}GG#!;LMEi)AuIO5uP8VcyuOw)5
z9EsfX4}m4~_zp;Z@+bJYUYXCoM84@*)pxFV;7(#H%~&0x4&?w`DTPElR?TfLxqm#O
zFNA$g&;&NlADJ*Js0DM(ic3Mz&NBf+>2W&eLKv$DGro0)oB<lXWGL?feGFKFS29)D
zn&F3;oc!1+gJus@+s1{*7sEQq_W()4$o5GKLN*7dOyg&3Q@={q1`6DQC~%UL)xB^s
zekdG)Rxrh+cA*t;^Gi8*E9qnQfLles7lD411%_k-x~36Rp{J>z!;KY)E_k=umKZd(
z7qen;JYg=vK~it|_&%_5p$5ddGsbjQ2YyRi{&_w#J@}BenRv-Qn@TxF)W3pk$h1Eg
zd@_JnE@$KCU>zPY4k5_)rPy56^DcgI6Mi1D#c4&o+`#oF?2_`*672R~PS#4KZ%Md4
zqgN)!q;8pqQ>YkdHc}u%2LT1mL#<BoAE|AIJ7B$!?|R~uW%kpX!w0FpX$9Uizf7Du
z{w$eZM8>52Tl~GtUm>fhpo^!X6lo}I7(;4qb+>)~CaYQ1Bnh1@mFtCQhFn&a_ozzn
zQz@?m9ULTIxnwK*^I@K_#+{7Ee|_J(&8CK41^(K)UU@7|+^M#;5A3UgdOAZwVU|_(
z#D#ZHO<uymM$Ox$jqz6W7mq!{CAa+R(P|V+iY)6yt3*LjwCq{m)a}{&#xVrAo1YW|
z<!2nv-Mv!5XnM(`!nWnP^#p(EXH);5oucK7l4YvL;Z(}_(jy#`!XZlss}*Q+ugDqW
zt;J$4`h-gzKA_Zx*eW=lo-_EyEm;BoEX)7~-~O;t1<j%Wi2EM4XHF(>eXO_`VuDg7
z%uT-R2i?j7>uo<oBa`gC&hUg5NzGV!y4(-=2F?s%_iiQpSo_Iz;+BqQ`d=HwZDn~z
z8^USzN&~0s-^#PP7o9+k+*+KvLh$~ON1`n6>w<fmm-BxtSTV-2$~6sW+D;$b7}^LZ
z+w3}IWp3nB)jh}E0LaytlG%?Bsg~<rv`g^6lG(&e8Lq$T`y)BQD6*YE<xc*^@;?Sv
z>x*tY(tISsA(c54@;b3(!HRkLgmQ#P=e4#rq?xc!@2RZ^B0#;sX<2*dR(WkuSOI*p
z0NOEzb95&})%TE)%`&Fawj|FAruv6Ej#~(;){MJhaeI3BLnH*tM!{e{Hfw7C`AZ|l
z#`6m4^GcuGpK~+*SordNz_kLSatdDlS@MGHv@#lyu8m9Hl4$}5S5SVa-nM}pR4!$}
zO{-yJX2I#TZ1PM{QqpHL4*e8h_15ey80rQ!!x}Y{W+ZS6#9r3Il}!P9A~Aym5Lo@A
zfz?z}jk5S70wFpxph;P}3oP5+X7<rT7-FzGj#)L?`_pa)VU=>_ll@^tLjXR6=BQL$
z8*#?X%MJd=aOOc2MsgnoG1KZ|GB@)3?POWaKvYufbjpOhOg}dvS?I;3@Lb;2BN5LQ
z99CsUI09@tsQ{&1zCZ$B+<baOR_aWu9#vXZDKglMF@|D|KEahnU8qV#GSjO6?En9<
z2xjkLEwO(`=s&b^Sk)o%S!sSL;~K@{z)M9kfMQ|*nM)?2lL^TT-~D|v$XcxQ3==v;
z7RyuV${5o$^}44?Yo{TDHWH5^D&*<TEIUVHT~Vu-*V!41m=LJBTQydaM#-U4E-VEE
zC4@5x@&cF%ica1UHzF^Bx+_QzSYme`0@zRlP~%>`>~0oQGY1DXqT}M9pFsDaLjKi%
zx%1X>b@>_PloG5=V7Nq~1>-dlkDYX-Xx)&PfGlBccAor$wJ*w~Zzfc*j<@ONWVCDZ
z^YvJ6Rx)@U`08)~-5t0J%^Styn!l3fw2W75;bNysA3iX<jcHr@E4js~;Ob`99|$p@
zv;>Ck&E_3=uj_jA4qchYTHJ#XV<Q=+7Z-hgB>NLG&Ce-8>j;(k5rD-&>b-H^o{eZ4
zQ&PRdz?Xw6E(hOO;SaMW<QV{s9jJ|wm?*yMBF%>=YL}9Itv@bT3~vCbe<je-IHU0V
z5qy_v`h1TRtUZHdI?z$8pFGJY$oQl$6Oz;$kBdcDRL*QvrZ3kB1G@un>S8668)2KL
zlePI0d~Urd!+Yu%nDlkevt4_N^*_)LR>3iMpPZX5Z`uF#$$-^Y*x{#4@S6S>dHE6a
z3ks$9{EITQeQ5&Z&%v&a)sq!C=Gz=O<~D|n&xeSJ8lc6yr_1;o`R9`gBU}=$!8si&
zMI&c)F&XG$U4i>8x@aH4`ok%0P@^Lf3@bgUR|5a1m^?o`7|<aBUMSnF*G+*jajs1m
z#q@JS_~b98IGOD8Vfj}T-)~xR0FK{|(oFjmC#xn-VH~Q~LHi58XZx?TeGm9}JiG{q
zlqy^{Z}VD2fhcEn@1a#x{>+fJRvP5dp^kbs=lI`E+czRn5ykd^J>aEUq?p<P6sZ0h
z+?^H<6gZv#<ppU{;%0@dC*dur<3{wr%;&aXP+JB_QVKl)hYk>Rr93!vnm8No$#%?|
zR&t3tQfQbu9D0196<J#bQVoifq?23UZ%oahwHZIQ@wAkxw}Dfv#X@D3A?eIRoc{JP
zH(CT&U(gq_Vzo$Kkf<nscrJIxmCnrFWALfmK%*<6<wRgteGxEqRs#V!1_31Z09Nz1
zvxz9jXKz%S;NgY^TMk_%Gn;qKM&M8zipc4q^<m6W(^$O9#5KNvSyc4s0aV&6t=An$
zr(gO2I~qcJNL73wGfZR0sAR<E`L@d1seiG*b<Em!bOI(!bN2ftS|D+e$;^mebzVGB
z)h@+uGAWbj)zBm<W;2(NEGdVyrDCQwBOE7LKJZBHb81*LwFd7(?5G+Uir1wp2u}H1
zmJx!NUMD!yLGJEx32Lic#IrQMyoklqY>adxR_BdeXa|>(1YE`kr?UwiX8>3wdh=aD
z<oGB0Eb@yKG-blqW+u4}K7(m<mF&<h+jkLYMkpwF0?nWpVRFdudmOI!1hs=}7`oPN
zZu2mMEEaqnLRjJBQAP--hbY`h@9D%8qb9e^?tPYo1B?gZp4w=9WJoTCgRbX~v69oa
zGyZHM9gr=-=s67C-Yq}-v{nQjX%VQzX7-(bulab(6ZIE^X-B@F8?8%`ejAcUipKCx
z?nxoF(e*GqMn^_O=~*tF0<1UOzJlz(B>9i`jpZ#$>c)${G}NLicwNCn*B~X?fUhj*
z#sLHCd+XlD@e1K5`A5U*sx=X;v65=^)rRtW%=H3Xy5=zRxfuHO;aL!bD2LkJ{(+Of
zPk?Jl)J&OVv|oc{=&XG@Y>LT^L}h%Q*P{%U@XPngfW^(jA}oSUYa(}F0?Ac5B4Nlx
zmypIaDAOo|Desv)CWGZ_CVa_X`={a-Kly{><zK?U^%L<)_n|JS^SnVJ)>9=5KJU-6
za0DF)B5C1gL;CW0r7N)lbKU%aBN_N8z2j<J_=D(7+%!<X!Y)6Z+X7=C62_H@oeUo%
z_RF<w!5bE-zH*9SK>DCEmttX752yaT#kR|IJiuygch-1_ZYzT?Jj9^7abXNG2>DFF
z<!^tW#x?PlUdqwn01hW24?hT9_1^e3AcE9W1>YE^*Q|=rxXhFVUx1%3Qe1@rkdaDf
zToS~807TN_Kn>Mj4B~@{jotygq9^!rgCKd03<39m5rCWUL3PHu0-~f5K}DIW&0$`6
z1*F#vHHc^tsdNhLSR055JlOxVg)v63gEl8vNL2-CHX8Oor3MzO=NN13SCZNpA3^(?
zwFCgIbDNy7P?=vW;K~$BQnp#hyB*Q5s8<`RZ5w~~l3tN~Pem=Mbjd%HM~ER*l<Sg3
zb2||Jdsk%&`W_pMDRk=uihWF`e5+<WJbJr}Rz4%NBVac=Zz#ENzV`7;Sy&57Jr=_i
zr&EKujwXm^K`d)8qKp2<$CqMl6g_$H%@;a|u)+dyJ`%v?K$!;^u)jHj&OMcHiGl5{
zt;=1AKgaHXp^s49*`<_&C97C%h~DHf^W)rzhd341g(vHGvAaFCm=7Be!EY{0Ea4zL
z^;rh&<Cj>YN;TQX<5D$Q-*b*31~xNLdFQ!D7syk_N2wyZe{7zntL&#))Y4)yoQ$9Q
zk&PfztNZ1)m~^rRugHBVJ4Uraa@`nXClGdgMohV<1}~BYT7I;i4y6R!GVSTWauTz9
z0|GqtE$Sf}T(iS8i-#g--#`bo{vMlAkgllJ&p@8`X}<9>rGQ=T{kP9!AZ4l0wamTL
zJ4XKxj{|atRnkS{Jc<Ctq|SbU_9vGHdz2Zrg7V@MccN3oXX?d)V&cBn)$!jKESOQD
z^K!AD8RM{&!OOXHF#64lx4Z%uY8QP&I?8w)l+n4*0;-!^lFrmzm5V?Xii3{Z?m!8i
zGMPfC=-;1#+{7S8&p~=<Uu8*Y(!s4>(6A=)@@fkDhSJ>Y<oFR%2v2d{y14w6z{Qxl
zvm93>iqYD3MU0APc#oi;osq7AC~zXQ9)j|{9s>F}XMa%$?O!2CR;BOA5@or?{^wBO
zB7e9J?kHG(x}d#EL3C1qhf@LA#nu6qRisE!L&=<^Fv&MY_adca1#PY<10OfZ`l}QF
zuhPMwR1p%x^!gOeufvbc8|C?7afM?RQOuFg-*G~W3+MrV6?riZ^n`3X`vxA>@x7`j
zRt`D3@0}<?r}{&4*6=Baoc2v0B*^0qaRK}NLOY|yd9}$$*rH&sv-LG*NP9jKC)^{x
zRn%hIUA5HyYC|1CqCXLW=os|~*F3?#Zm0zEN9idk<<!dmQ+7BnFx8H_X1>(`xvTvg
zU_fzy_~rGTi3P1$Po#7nxB>T2)~otS+e$TmH*lA-vBH3EO5CMz_X)0vBv_o&#J1(G
zO)LHzGsJ_$6_Xi`+dHOt7|K_vC3rEOVjL#y82wa$(E?L%RoA)*(G0{{^RpdK5h_EQ
zyuC(B*Bm}OB%C6P@UqB!rh4k`5k^)CKFMhevE)WXPK@S>Ma`*;$<&_K?<mvrkgC{M
zJ&d4dv?JE#h-YPk@Bi)OkQW|#H!Zj8_vjD+I=Fw~^yNX=Ng>W14*1o|e|dbc``4JJ
zBWMcOx%c}gw*TOvb^JB3I0XFN?CNNkJOw1xbBryqmYu0`<0yI65g2)Ul!+Jvg9DB?
z;I~woaM6>x6QKR9Vli2|&a5Pc<)N^`H70a(o}VC9W?%9xsxUuYuAqHoz>FgNQYr5n
z4q8nF+t#-0>;<sN*CujC!uWsRynFAO@B$ROB_``P(cT9<&B?tm;yg`a2Gi_65m|v)
zf)S2RcoO1F<=D4JKKXo%wgSeb?TiyzECDH4%aoA$@jX=KVX=W4_D~{-=g5L}PTN*m
ziNhdQWo9Wbyr@kh9e@1ejMM`tg-?1|s*)2x9vSEkI4Pf5_jSroCkDX|6F^WlR=?3m
z{}+L}$Sov7sVxsCrm2jr`ztpz>W5h}1WzwP_SMnM_a9v046V2E%77W3`c%tS4$arE
z2FS550e*a5)LSmP0$PWJ;`0n!*<^V?)X_r5NZsBBchl0EXMKyF!?9S?d%y2;qKl@U
zGR<0=ZG%=uTY5!(y#+us2YrQnSt#o%)uQTl-4?*R^h*%{^OL51)u07eQTM$yxJx^L
z*XHHc2=x6ekn!`nnsuWh2KPNlK@iDjR}3^`;`sCb4crKV#Q;SG2Z7e#>vOLEVlX&c
zhLw(U!7gba|Es_Hr0UiUe4S{{)hUDTHn7ae6f865{+tp*(l^foUj5QyB$BHy3m=Dd
z5jA9#MD&zNsok<b@|g`eJutV!@g>s)xkvDEe17YTB7LNcmgVBrbKA_l3zjJ=Z~fE0
zvfFi1evkW+gqEiRi95^+{tSm)ap_!XpdtpKK`nrne{1>6_DvO7Z0LURa4}28A3%H<
zPyQ)$5B69+2Z;CwK;?R6!}47uXH9Q~wG;fh9p~VeYrMI*qXagY&YCZ>i29AM`I@87
ztlB;fn$xav0K}&&$HX(Sz^+T|*jw|u@Y*2K(0z``!^8GxWog;5XMbOSxA}xhM0nj%
zTQv6<t*&_0#)>NKtr8_!nVA^6)M_r!y$<%A2s2gI79<N94z$pZ7C%KLzPG!Z$}fPH
zOg|2xqox!7(`B`xrT1rRNLDcXkv%t%c+X$bALlc^G72ya(~*;&PGufS()k?&$N<yj
zYse6=OA=8aM3UI3ki{=I;aKUuxfcRiW$tCzC<a6C&Dh=Tdf}8*k)4s)&*4go{ZxdT
zd*^yPu>Y{#q-^NEXSKt0i}w<!g_8GmLCvg@c;?&4;{~O%@kp=b1x1lgD`F&xJM~qq
zPD0Y7PQ4*me~58V!NzSh8Y5Yjx<SfiYJ1=?eP-RppXneJUDQU#S+{X@7`dLkr0EZO
zpX{s!$ekgDNbBH-@N|5axO{r-O9;>&72SGj*yC!onJJqwEI|vN-!3p0Ow4$fmhR5(
zZWWF`@{9{+=n!Gr5Z(kGRaJu1N-X$;4M8ls`DoNp=)dW{1bkDF3@5Uq{1d$D4E*C2
zl^=m{xs;t~@~EN!9M;WfXgc>3`nbMTna%`>gt(vAR#y_dq~CusMUd3;>~!E@^Sh!(
z6Stk}W||<BgR#QFxNM6(<l0G2Jwy0i<{hk2Vy#HU5bGLKPZ?I0I6dKEV@45FJH7{t
zs5p#|jVbQ2h>EAM<mN`_`%rh5yov%yCr?&Wo)3Khvk=2D&(eXihClAT5STRxz?$Fi
zyCtM26VBpY<Ie>lw4f}kLr5RO(p3d(p>hDF<+=C$Ey6N%#TqMYn-yLMh&}BD_>LDE
zK;MckOexHJCD{Gro6q(DBcChS8(t?WRmK)pk;3WUQFJ=tx|U8n9dl-WHwTf2lDacA
zFsIIja|UWspE{rkEo(d~&<=AboFBxKP9gtM3#ktoou0LM!-qnaQee2!ELsb0J&@o2
zEiOr9_NKUY1~Qj=#BE|uHvZ+}JqW6m&=%HlQ!vKp%FB@PCMjF$?0y1puH2QEZX3Qi
zfcpm0m7wSA`maGD>_!v-z!3Kd0RoFyZnpP<Jia2@Df{cu)zdLykSIB;+l^!WlS*#>
z5WuI+9^?nDKYJ<8YpXVF&ul*7N8+(Woeq`Ez=)L^RT4ve0#le@v{lf+hb5*-9E`9G
zebuJ~7Vthn4>va)^xo@=uIMIch4+zM95X9R9B@d=(P}*~IL`$$l13ZrPO+r?sqWKp
z%569)8QUL&NI80}G>XMVgORVR_$h^~n%W>%xI$d{oG{LfGJP=o46!<M>5q9YH-YMM
zVsgJe<=FAM=rF_;Q6uRFb%m@tDOS9lYXaTu55&wu@hV8ax`Wdrj)FnPHVVmV<g}=d
z!G=#1^UnueS2bS>03Y9YUar9!9P|lsG((EIcuAxx&l0mHna$_Af4A24j2;vP;?k+)
zy|DmPOC7=s(fi2yB7P5Yls$g@=3x!%cU=7xz_I|0|Fm&*;W$odob~Fn(mbmmKbV2P
zeYFXUZhaprp8+}L&fr5uIjv^nFd^kLXSP^LQG>#8R$0Pfl`(3^$(Vt+d)5E~6Ath{
zjQ=cqByB=#q*y(4C-YuY3?UB5i29J@oGbsJHrkigkFeL?{1_GO{y{A2ZlQ5{p(9lb
z`h_F?SaC@j*GxU8D8G#Vb0&$rPdwZ@mf#=UO?*skPU&AQ(Q*BAG)r_Yp|!wxZcLTK
zVC#a;{i@Y~Sg>L7qw~ds8OyZdpF+|)Q}3}q^%=|dC3Hd7qbMw`m}?^Zep$j7>JM*%
zKcFUq?V*uQfas*^E0^vkESbx{x_(_v4R-w3zb<6)*?GOCE?9Zt@gm?Sfi|{)mlCRZ
z4({o@ZiNd_s5T=|Fuv6O+zWt$bO9PfVrm$))wql_dRuQYn!%x26V^MkOln5|N9_%Y
zcz?L5C;#N-aL1j%Yt8kmXF;GCcw<oj%4sal|5^xT={g>;%bsS6uwLKRZrTa~Ck8Qt
zETJVjg`p<a#<3BB0<kAj-SZ6SNJaDoAZ?pQ%z~I#9K}Jy%pTeuZ5j4Q#yDa_>p3Up
zB!Tah+k~fVF@OSNpyp^=yk{9H5Rz}-l=HwQ65)8vGGg0fT(t?~)=n9c+NvMtO`pZu
z1jkQo-3~;REa(s5aFUk(q*u*cK^B4_vw%FP;AsqD@Xh$v@lA*dxuY4vm-52h%+Ywp
z`~kJ_Ld)shKsM3MsYOmQqb8+ydhiO=lB)b@I)4I%th(nB5FZmjLz=hHHolxLkF&gP
zv_+KhkOo>8=q@6+LpvJ{13$X}`vhB%E|!6#XJmx#U^y~e3zaRju!I4RDH;pJL5HUC
z*zL8$%9Y56KI*H)Gn!urS7Ll>b&mhp`UNBYxE{<=QozZ4@+6fRx#>y=BATumMLHze
zhcUnwBYEu54GLTffCW+nAYUVSJp1*MNDUvDRW6uIUqvU$_CW_pfmYj(KLiH3-AiO8
zC}zTH6#gK9riKG(Dsq8R=Ylj)k)G!!TmoqA(_?S;)&f4TU{g25@3T(bO7A*r_*s#`
z=!E0#ou@s4bUY*npF7Uk=F$yp#1_Y7DBL5eqaEJL;QdMZ)QBO6jG(^YP3g`S7sM>c
zfvexjm4r;;3kC7+lX8w9UP2!(@&mqGpBD)oRUCOe>f#<W5qM0^Wo5&=ty@{sMvUW4
z9w%>{DmMLAfJyB@`WN}%25FsB0IPz4G^8#e--k0Hd36=B$8F#|#`BlLRY|F`>_Rfy
zt3~R52iH32RD<NC8B7FSv?o92u1^rh%c~aCqVjS@%LuHC!d23*6`!d=&lL}=o8$79
zR9WA?_`ZnC3IxC639=hv5o6`%d6Qd$Cj*L#o8s)*9XRk=)txb=aCHbA&Hs8CNPx^3
zfd^3{qp7bDp#o?RCX@v=nGwm10o{d*qthW<1&!^kApD68*5EO~r#z~&p|4X?6yZ`J
z9LdT%&Ba^#3VbwaYuRnqhL60{UJmuNzOSI5wlv;(sXKZ+a>lYyTXFASWGU<rTHFDU
zXA?Tama;&hP(kx_+VdC1bnM7`)V55y<`D|woH{rhfbd|;?10vGzU*>=p8h2k+~8wa
zdC1dhkml%N#iM9&#2?bZPO*zrd$sygC@XvjDi6|9mjTS_sdhH}a|D=Hva?FI%w_Li
z)@**KZA3S~j8A_%m7DoMP?;1-;)79<okEHopX)dWCOLZWqg(#&!qdzuca~6cM1Nx9
zUQ3&ougjn6@YylD#+P;Mr{8=n7Zl*WPQbwoX!=h*WVz-<-eXJ#&9Q=PUP#|={E3!7
zqfEG7WfFz!n2phy7fM#+RZm9nuisKS$IAQuvsEXcl)$fEFYKHK$&86oI-R9jgD&AS
zyg6^tzmOsBq-&ii;BR4NSj!=Bpt~GFr26cn`V;}1^Z_gdoGVr_*kVDklX_usILuRG
z2%6si^-PQSfRj4AZe-kp>9Og_`rTn)qEY2V5&MP`=pd`0WDT}>SW`*79j#j#^6470
zCx@mJ+`l4Fo@N2Gf4`v@FrI}fRjDF<>^g%%NhT3o{2`}>&3wdmA)A1d<It$ey42(F
zr!hYT`HdzvU6G)jaR%pVyD*#fN?>I-O#x-+KfG61zQ58tHBc_~GfhJB(+X=Cvi<hj
zmj9C%EgwIeiwmeX#S{v$3d}WN0BhL()NoXhjc!!EX&mYxO;q|Jl90Lf%zS)-7$0WQ
zTUS{`nd(yF$X{&Q)QSp@R{CEeiIX1?p>^71ZG!{Ew%qK^xFku{>9BQpSRPebZ;u`^
ztt|)KgwJjESJB=7czWxgsJ}m6c<B!5kdW>MY50=T-6<h0Ag**OC>_$>-Q5UMf~0hJ
zhcrm+J^Y^M-akGAGYm63yL-+%UX_Sy9i%`o4EDy)hb9UOoWXHcw@Gaxf^xLj(QV8?
zvG6>G__h;}02Y1(<;Nk65{hI%Lx1mo04eTuy%+!;;2VM~Z$A*-dXFiv5>LPq^Rr4-
zOsW`8H5x8OLlO+eSCv|xxG}LZ^kI_XuotN0DD?;RZ7!I_>1%)+j`Dm}nsjFSYOM>D
zvjL<?m;6r<Z~nFUs-MY52I@8Yf=Ay$Zg7R5YH|kAMkSKG)Kb0RS)9F(>Iy71r6kEG
zgG=OU&>WL4o|m}Db5cjOH~p7EyLPT1tkr^0T_W6&ws?w|`is}M+)kW+b#V6ys-g`>
zuG@Y<zJ+;5b&kW@9?kyNQs$-I5^DJnn^5zH8g;Rpm3onC{GJv9M28&<WdjgH=F0?}
zqzL6s;F4w77xDK5qiYZ4jlWwAvxk0{XH?iptARo@zipe*he6W+%TObzJJ<l;99Ijn
zZ?L0JTYk`nL0)Rq3(i{F#$_IUyu<9(I<uY*>-&!6lx$-uh>(UXG!k+C$$DJ5h~wQ$
zT%0X2l$=6eapGSawey}(*Y(SC`=Tnzd#=45-N8gv=67%IoWol3OGOzNGA24Blh2}b
z2?%q9j1!p_I{yG_v+Jl8OJ4p%JP&>a9!pA-!QtFXP7D!eZkhW3pR?_05<P&~+KDYT
z##Zcmd~}K$D05bs_Fbxqku}`9T1QTJ815<i9d+8`CqR8lf0^*@*P6W!sdRDT6Z$TT
zBc}D(MX(9>dbhO6IA9fl`xAk<-nmEmMnIU9C5GPk7#Y9#IK4cCHVNq;!8GATYKklZ
z*<zb*=*GE_cuvh`kuEzb`QjX%^Wf2TNO0)vDP<`aN6J2x84s_cN1cn8Yes#7Y*f=Y
z5svS2&UJ)gHS$LmX`S5W52k0n5Wg;oO_cjJxaJ|62|z?&7PZhR{bGK@ea*90<~qqo
zYvZ`B{#lU!)$c)zFd!!TEKW;>5EB`j8=6WHt#iHLh>5gz+;mXFW*Aq_O*p8K=S2)@
zVUg#Y<(Yol)ph;Y1Pp&6Kx`PzH<tVm)8_kiB?~Sl_Az<5wXcOhnw9i`G=wL2uJi&f
zU3du#98M6-31u}li!R_=JDk5a{pU@mu;B*|z^LELC6Yt<LY~kVf_IZk7N<zv<@;eR
zexIVnqFJ0Vb+9d~=~yn8w04SuA&KySbrm}$r17fvogmzqea<_jK(^unJMp@jnF!g8
zERV;B-|b(0lZA)zP}A_>ByYN-1#lKdvJSyj`Aj~`1rn*38bIX|B3GmzC-~m}I`fvI
zM(*{DwO%NVb#WpS&$!8)r~lhgO~-T;u%Y<%ZHQ&|Ii<+=R3Q;9PG)12{Ckh{&(;Zp
zbEVuln<?iSx8-oLo;P|rB6+OW_d2<@Xzwr+dJB76zNv%Hp7%aXjbcBRqN}Oq?!#EI
zkTL2fh{!BFKoZ{qSB76*iGv#KOev1PET_n*x(6D1s|%<#(mMFOBlMTb`J-5Na)+Me
z4;iz!5`O6d61XkBPDXD6(+3&!P#Sz+P^(oo?4x3&-7%E|7D<%uY;5Os;T_)YV$FUg
z@thW#WhrQ^sl~khq-&5*H!;fMWOxrRPxAb}&+;m6JwBlUK(E%l+_y@trR#aoLh2gV
zQvRJQkx+BAfW+{Z`WW?>pd|q4eArc^;J}lSCDoXs`usSwNY$P3I#G#K$XE~&53t<7
zC5js63c9L>g}Obwx=?&sVY~^#*5o1Dium8pA*64u3c%Hg7+%PzZ>!o1f|b^LHzjxe
z_TzIR7~qCm%RmKP*(5oV6FnGnl_?RdWMX;7C-Al0Y51}!fG;=jMZ4LvtSLp^I{!W%
zW8>XI#3W6h{NE86<pHJ28WQj<Hp6}bQ3b27?w8ebZM(DG$DBN;tARGxIQlCxf9L44
z<^Kg^1sibqsZu|X(<mr^815ce(g%|!`|H%_KKscTA_=zGpR1O0DM9E3$FKwN?)m0B
zAhGZkP{RP}xvp!3okBNcq4oZkxlRoxu#zjy)&*ft2ReApMwvLKHs@oCiu``Tah2b9
z3FT?exCt<KBN8HtHVgX~1=-5!_+==I*x4A~60438@_@BdvIKvdIDs0RU`najS!*r&
z=ELD+bE&-PY<`PDbZ&-1yVbjmhLOMi7O{nYe@95oeezCpq!1EMa;-FoRr2MRv%9Ly
zj5Q~s3q#;g0@bw6VM!R9f%NE*_Ojgz!li5YS-2ykXGrO*Sw?GbnUg0O9|x3?x{Bqb
zc{BLgFazX=!Qcn+szv>QQJ5>pz!9x$27v>E84&+Zv^fcY*{=qHa2&OFxrl5yM&|&C
zPa5|g&u_!l*}W4i^&z-mUE?P}kN8Aw`*!J>)C;P<#Q+6oFQA!Vw$mgnh-JR({haVh
zL@WA>2Eue$i^6{v_7p2aA%kw(pRapOfUhhg#x)lU+goD+ku%laOW6|l4Q{Z(Y#^YE
zvBy_!DZx`f7D5)L%xa*!Qk9hZAYF&wu$oKcxT7^uf9(nJNvZ=FS+lhrcMM346s<Za
z-8Vq`aK*C<vAN=rXd9(|ZELI%gbo2>#9ak`%X3nS`5r5T=gdM8I9bv}U99;{?pw<e
zn-E@msRL4p`BfCwNRV2zmbu8|c^EL<LplqjoL|7R#X$uaw^gSWupJl*WUh(%$sauj
zZ0wr$u7Au^{bfmSW4br>-_WOmwDdgzcg)s9j=gFG$sIaVT?1`2dq>GTuwh0=R3agy
z`}k^-L~FM<`%COE-Z&ZZ*8?geQ5o3J{?xRQo0IiR!O*8EI>xBLu+1Zf?;svbXF@Eo
zcM>4VNw?D^!1pW`s8Io7aIB==uT!EeNu8IrR4U+nu2fwLnILon#3^{Q_q87SBB{%f
z@WQPF6U!Vh(>y<(n<*A+?hKbE<1*F#F2|3%gRH(d|1y(5Huyd@W?0VYc#hFn^1@hB
zmTFF%t1XvTJ(BJt{;~gy7;1+D&NdknxZm63Gl9<#YJjruEYPZ-h{h0V>MKw5)*m}F
zjLwi4f(RPOmERf3AZWTpJ;dsmO8;QzXl*7rh|dDC3ZvarU--PjkE#P#eJ(Yi+n}@f
z0#>RKE_*$`)0gcV9v5-x-@s%EHPHIuo}_iIIIANz{h2hpF2eR3->7M-Nc+UuNDrP|
z8aL9$iA!&g-IMar;Vz?UQ0aJSuEp`thAp}j5G(^v;fz^oZ8-wc+j5^^5+Hh|8%|Og
zwc=es9Q*wWK^53gwq#<oy>I~ROLrj#W((apGWPxZKR1J6E5&FfyxpW?+<kRhtExS3
zLNU#5s>>d-<tI_MbcO)yK-sOa%CoYKLLm=XKs<A#w)P*Ovg1sE2jlbx?5dGs#{3Z1
zUg|om8$0h*xqQkw@?HWFy4{=4iLX4`x!}xjFdKz%Aat%*Xf?JLTZQV#22IO$sFauL
za9(!4iu2g6Z%27NBY@(|Q7730Ct^f3;J{C4cc4cs{q2Pu62O8FjvVk$Wxl+zP|B8Z
z{he=oP$E+U*jG8=fg9YA2gyAxhf@JS6N|)|q(fjNMG(rvsLNoSf{WJ8V9faYI<$g8
zG#T}k_NzQ^o=#KhQ!OhHdl3O*VVp#_tSR#hzt*&ZeJ--M+})Fq&3W$%h8PkhnkC>?
zU15d?DA%g?%(Z&Ej`_~?jn((?k_~F-OlX05YPNmkyKC##`B4Kn_xB?9QmIjy`aZs!
zg^67|3T}TsPA=8EJcXtMs%fj%UTx-cma9UvT1r-Hm#BoVMyjfrwy1=q>w#)J?5Ln`
zH?>I=S~PAgHqynRvTK&qdI6bi8J_%jQhW4JPJd^Xx$Cff7?}Z#)|X+yu(~J9x-PId
zr$dSXn&L<T$%UFz;z?{@@zaw<5WlPm*#`<YH)Ancs6Su<QFXn0cc6OBzjtg=^kUYk
ziIk6{i`|S-4Jf=)KT$o{Ubw?z*EW^YzqjH?t0ZR>;=i*=VjNTISUi6iJS({ocgT=x
zqI#$~I<GF9{5YpGf48o;+ePu@cj>S3=>UlF?Et0xQ#6`YSBD0E*v&EUSedus+Y{*?
zD^j|EB^QC0wL98$d}fYL-O;>ww&wuSVU%SmR`o%OkyRJyo6e$|?3%}59eif1pvX)P
zY(BOQomK!&c>yRk3l%8F_)>>_v-bVWl}5$`m*U@d3sw|ng-tFlg*;3*=`0I6k;x^F
zEzkJR+xzppEdBuCM+D9jGXr=orb9f=G&Tz|FI(rFNTf;Sp*TGkWVA!qOn@=NbPUWL
zy7?Obl%@)o@5}k<i*9um$$b)<3Et#CK(Nk89W5WB0IJL%5Z@3?vH)^p&{y{{gpZ2v
z(#f>0+I~C+biVGV$s}pJ6}}Q);k<79mciG5-Y%|I@dsp>EIM$F^2{8B*3<yFu@Eu|
zM(jlRH;Xs_w8LS}Hask!(`>j7ekuMhfa5Q6w79_@cs<!87&gmH^+PuIb4Tsc?+W$b
z(rG8!XDmU?PGaa<tkff+^;xl1tbB;#Q+s2(+Gs2>I)}D+mSxahntktNiRrO)j`YlC
z^gN)Mji@YbSLMyFtHK&{&u0#JCwF|<n01`+r}lsqCSf4UjTD2WxKwwhlbQ2Eo`2l4
z9uP?226qLydCBZsIlq^I*{SN`02YoAdQ}5br*!ssN`7qy5B$Do9pf}cq1I2)Ejc+C
z>b#(+tI2uWGn4<Wmw(;^rz85E8*oxbc6M(6Mb+_NleR7;ifL@*-?et7R6HP`Rs06=
zpP{d-olyqJmzl+ENEdr^8GK87x_S#iUC9lVEeds6<Flcw`#qh)=s$)hbQ@yBxOtm|
z9F?EGf-P12wT~ttU~u6WTzO_-15XYTU(uCCY)YGHnGC9F6GLy}fw3VK`^yTKj3ORJ
z1|=+^Tpl793hV|Kh@TIRSfa&4`G${GU;N$t)xxapJ*mOld`z9UtP!GAVHK@1BPr=1
zC(-8mo;PYi3@zvV@fYYZa=^2z7toEjalu~meR2fq_B4c-WU&^@y@cro>2lYvxvO($
zz?TE^V}#X@rrFQ0l5E4FP)KFa@!h7%ooR2s!3yUN!{~}1wbmw=98W)X8%uN(x$}9(
z5Ri9tdzS;0%zc;HdfW8#1yf0(ee0%dW*$52{{aKC;DpGf7G@e&{YE`hjshKt4{|O&
zT-1A2MS|m`2I$QuNTd;Yc6<aR$N%bqfNTl4MEzgLVq#zgxCgZlA1L?r#nobtPFjv@
zF_!{^9v{9C;jI4rA`qezj^}S_?3ln++E$ox=srB@m{U6Nb~KI?2sQBNLg`|!y;xf&
z;Cf%-q5dFO#~ge)z<d@<I{a?;zbH$Ej}PC5KD2OybeJ~;P;KNG{Qj7Fq`zo+j}jL!
z=YnFo${h2eFR^o<?(6=C&uj8k_=;aU`-wd_p3nGoJ2w@&(gK`^r6y!G#3WWsZ>0=v
z%U7=TS2)&xGdI;|h51~XpW(u~=%Ga*dI;NvZ~iT8tM%}^`KAO_8!)!023`RF0nuF@
z9tw{g%Xh?MFYySVFw>+C>rHui1X@{J1<Y;t430!V3i@1AhuIFx@m~2~79vPF>`ig9
zRntlRcNnA64Da%V`=d9tGFie>e4nrq*|8gfONjXurcu>buF@B(wxWFzI}L5xsbmU;
z@OPAfHB)h_5Tr?4{PIsP(PEC>Y?bRy{vm=}L<~akW&%v~(x57>pYio|jyStCA$-Us
z`574=w@1PjHw?(D?`LSb6S4a#B9%bvMbQ80d0h$rHlN&u^oVjqIFt9xK?1*r;p(d4
zyrC>2!58)%{8i{e7lBaqrUS7QAT80MbP>Q1>hxQA>L~Yn9_~XNRo0DXE5QpOR=|af
z=iC%6TQ7Sz9bVbJTz&lS^vT8^v%-rg>n#(;2T+(1o>SNQdZ57Dit_n^pc_O26ZvU)
zzZ%k`p>GzT^uhf&us}}r`SM$yZSJ>YnaZc`_3co%4|$1)yZ6ZSuZpV63h#ZL!&nQy
z{6h8S|H%EWD(m{oT&E%=I8%;3jISGQBzl8ePa`5?$sCzrFk{`r2r4-ZaR6TZuQ?Uk
zWxW=U6)u<$k&Xa6Xaf4<HTunB!}|7nZQ0_D!bg-%o4$J^!H1M8S%rt~?{1$_j(62J
zq`7G4d|ggZ$pED;Jw*tVPRxio{~SUm@ta~aW{`n|^K6j?JQN`@dISo$0!uN?%1maQ
zr_Nt#F8nYZMPDr7w4VH<vvn8$8#WayL(Q83a=ZrdyCqw|cL;L6GRiRmGb1yKW%^|Q
zfCKU5Cml>c59k`TrMfhj{;IKFF1>gEYb7_l73g4}WfSfc{wOkSnJM$Kwh~FyvVcR1
z6kw~vz4T{KVs7y4tfjmrvmQi+ohQqF;Pulrycxu7V>m<`+`Tj5ra$?h8pDNWy%kFx
znBK?*4b`t)^r9gl2Q<Ga5jO^##|*cmf|FXPj!to#kYynMN}iUt*!z5N2Q9X>J716+
zPbMG-O1l2&=vT(;OSHJE6}219^zNs|>*JXM8_NkJ(W<0CADj;<z2|<GwO<@={#!kJ
zUxt`u{(H*-=aC`AEaOG5SHCL=X=gs72<Uyb3-o!Wn<$f*eegVZ9Me~MX7X}ShD2<#
z*@0h`09KUCpCF2FX)8;V^{TjtR3QG$>duHYoG#(x>k1SqJNIb!JK(s8Fjy825=8rj
zOiEa{QVG#!$_L51q&ZSV)f^6RnK9;dXAzW0pz9I9^C*hzykUw5JDG15CxAsm2Xy_C
zsWpPol;0^MyQF&%k8XBk<Vib>y5Ej(c%%VNho6&{Wc5DpKz9aE{={}il37#ZYBlgR
zqfwWena+NPv%S|RdBTqGjv5`ueEZB5Ia+%fsTz11fmKcI^U5rsJyxE%)s8I#62kxT
zD{2ir5tw`mB`J%i>Aw0O`!G?{1_EoS!54B^2kjLr(O+CaU>Y(+uY{U}j{OzVhr1H~
z#>x4JSH&5E+a<jzB;amYM(rEN5IIGN8B?R{ZUeSoaJMpNKoP*NH&aI!uhNQKP&`5_
z@D0bL9q#7X8J{i!cxOhYVW3zY{tO}KvE=M$0c*zQ@x5?Bc!F=KsaD<cG9xF}A=EAl
z@(>1|G6xoziX?>LbZ5IQ1&S6r_%*K(g!`@fHG3Fv74V#vG_}a-2~ZlJzBB%(BV7Zs
z9X|gr-(iJ>QI<WI#Eo?JF^cBhhoANvCn7LP&@3WCj5lb%q=dW4LtD!@Gq%YO&v@IM
zJTnJZI~laLk5<nMdk&F$kUzF|fwmh+_@g5~lG;32J!nn7Nx+5Kh@5!5`UmzWfT{gX
z*hb!b-}*@m1cP!=P6|c=MjtoWc8E3}e%=Fwdl0i}0$J;i309^btAF06WWk~O+5rjP
zv-Swdd5n`Cf#S9Az^6{)jC<d{7aeod6S$P(;y*HWxik-If!!Q^_!3_kt*-4G5!@`4
zVnQBWV#~O%;}#gb#Htv&^ZhDVWBI9EB4!YF=09vD^bxPl2OW!jb?X0e{Cp_!B#ceb
zqYsNuH6)Fbg1z=^;Ba4c{Qr#eJHF?XB0^z1v&3Fb-_+MM?;?)-)^56o)KY4qbiSbt
zsT;xLLEnqs-Ua8YHRd(}E%<ZR&~l75HHP^=F`bAG0q8}ZRA8zMF9G5_e(Uk|gL~iV
z9Dras^!Jmosgvq7bpN<dRn=H7E5ZE`8rnB|7DggKK2`eLtvBGBpgh>{g^q(Mva;(;
zIpL4CU>ok@N3d{v=G+DVmGlRz=OmP8y4S0>aU&^@IKU9*_3oEv&xdDIdl1*Qe&pA-
zLUoCH`=-s?_$B>>sK<?j2s6ubn2jmFtUO+DX&49*D|ie-Tol$FWo`8zIC04O?(or(
zk{wiL!>X@eV*U9)*(+m=*w6_fu4PoAcp1@0d^&F8&5&+()!0x_4{S$i0BN~zpVI=9
z;8tDGgy_Q%VK)n1RnagjP<Zs(jX!t_td!_NxsjLixO5YBLa%(e*X_Lz<c&AmmU%w`
zA4~tG#VV!t7uwv#@lzad3-@DVfwX*h`I*|+Cq`~PgBK6Lqmg#;!}(3}an^~%csIr7
z!hdrq0}JP_g&=2Ijdq9!gDwm(xqg5ECSmvi&D&?k@Mj|67Y%Y(_PNDrK+$o{-_PK`
z=Mapz1XYg+C@r1d%_}PxW5WF{Q+UlW^jSZGYXQrn9EF2GSwT`N|MM(x_bKM<jT=zE
z7MS@{9L}UrplDBkQDieY-Nzee9vy<$XSn82A0mYaOaPvp8DbF5k*a{gySKXyM*4hu
zK=9a*cNBD%@dP#;iE+;;6*xNNP~W5h%p++&*XZ6P6HfVsoBo6i)G?!gq#Q=q4_Rh#
z&oJR!*S3m2pV*TSm~G7ug4m4gBi(@=<_bx*6o@k-K4P=mdIt>X#S^3EnTFo+==a!;
zI0v-b$c5$xuc#@|P^|{Z#HM8fVG_V?8lLei8$YcV{pf0pd?9|#R~gTIqUCKAoYz+V
zfPQu@SXVm-Y;_@9zHfBnhI-!sy4lAYjXlwR+~&%Ews)t&haBp3e#S}l(9d6LBKZ1&
zv=UW^<ceo=0;oTVLyap)Be`v%F9tWPe@g_QNiT9L#58kdme^t3a5?DShPIPvOf^4`
zLVz)&_iXn@Fk|4w@xcG=#_~N6cra(>(y#tUh6u;>CZZ*JeOF#RB~M1fS-J|NU+GDw
z`s-@cX7h!dKTKg#aIIGKKlCk`7Xk7lT2}t<mEJY9F#@Cx-S-G7p)VoNc2>cQu}mS?
zBM@|%Gv%->(D;(6mpznoIFw_@{ebHfjTodzTcPwdekWwlzlR{17J}mPVO917gQ}DZ
ztBr*gmktlaXj!q*q3HH^Q@_&~-V0f?z(;qXd!<VWmK$T^kGCQ!aTYscct*zsTMm&O
zjMQU2?09x8F*hQrX7OI<sj`8}nYzRVDs)m~Bgh`q%9#x)giKVIqp+4oW#}ee9NifV
zAQG#!d}zo@BP&4d7K%q2q=~CU0B81uw?G}kG=t!abzmxJFC|E;_{EDjaEWkQxCx7l
z*strKkUouVh9Q^$UOaa#VBdD6U?8my4bY|H=N(cRe`0t3_@(CU;0<u3I0X42u7!wQ
zz%*NmTRW7dEY!(6y$6VdL<e@g-C_RMD<Vr#Wy0kCC{k#+)QIqQF+L^vKEIO8Sj>&B
ze;rJA=*7_+bj<hb)Owx9>97qavi&MebX3wCiDSD#&Y{nbiBXqQ-b2=k=q8C6d3xl&
z$?&{MZP-m`Rl25cIrO}C8%^Q08U39p=6&p*;Qok(9O0FVx{o{=E;585|HJ?vammtI
zwfpvA+4nPC?}U)#D3kIS4V>kD<1EoC>#JW;R|fIIvFBXyH5yt_n+*MN{ei;y2=^C~
z1cbGIp{H;NiWG-68EQt!*h&rky5yOPkUYojQms4k!-@QIlX&r6R+}Vb)eP2(^!AIJ
za3KxZi{DVwqLn=Csc$bG5dXG^wIZJv8Vnm^#|ONSL{Vo8cIdvjwyl~XD8P;Qo&{GN
z^dU%+Crp!IiaA+Zjoo@<>OAPpLn3^HK}gWnNRV6`)qQ9{l~WI|ZP(S6ZQ5Vu?pvjC
z58L}g4E1FA7{pL%hDVv)`Xdr1e<eIc$ezf9YkIR7_L$0gU}d3vTla<%(@M67b2P&3
zUj*q~r|9Knd@&>Oz<caR*>x<sx^-U^7$$<e1c2pNUto!{<eNHW^>iEy1tQI>*{Mti
zo7WWxc;P%M*KpY!J$4^=;d&CHk?0&iXk*l-W@t+9_hkHjPI^pg>o&{HXdu;<Qm5qA
zxXPXwpyyn&xzZF#<;Asq^7{tKHT;mKu%)Jedbg#dmP9F^kY++MbrlOQd)ShD^<7ef
zQP_*nsNWao>!<dTTda;SQM0i3N^tTlCh&c776}*Qzc_&vfS#PGY{Q;mP7jS`=1y&X
zz(zlzbu!vdwVRcA!r!^3CAjc%)F@%~iSSJ49(SgF@N(H+(H{dR1kU6qXui*S?6MnJ
z>1+o{CN!WYY*#aLbB)x-X)`4Z6qlE-Y`l@(ZK*8$+q!LIWK7|;-u-Pv<ELs}x#F-n
z);r04gDKmLuP0vq-7)sTUMZ3q+s<QM6jZ*p&27nJZdG+O(L*5>f5!Dtc5KTXh?q+C
z8&%5iuYA$DO5bbz7&N|$XHS3puM<LT(ipS~NB^e&{>&SR`=6O<Z#4Q<fqNF}fu@|O
zB21}s<9(5hhFF~9cu~LR*nQc}AZ_%Yy_bq%IY!%iCuWt9{&&4fEj7sRvrD}{X1rOS
zqY<3K)09LbGn+Wmdc<b>BP=+|W~)8pw~X^m?8|XeXXl6a|2h(nARjnOu*w>`a$H7~
zLp<@8^t1ID(+^uCuzfv;M4nFZ_zbGQBWZd!`p~eP*f0K=P(y^|oc<jMck<<U8iP<@
z+TX|fJGzOow_{VMPaksJxOaT@WB9iu{B#c|NdlDxv3%dEoQ5tRE_B?aCQ>^-vEP=S
z8mui7`E)tT8MMz4@n-Uf5$xukGMW*G?PUB+sFR+!6uuS1m{_=&y0Cs>!7f+6T7>>E
zYK+(On||BbiQAG$q7i0u9~>#W$k|!HByK)6n|t%H1dFTs=r}x}v)D_e6O}hx<(s|x
zZfsM#|34FQzMaL1UCPfA>n8&}tr&X2#RdP!B}qiDMJSHjD6+E9KM#m+M}3xanykm|
zP)$$mDn#eG5F+z4K>f)nBIa8#aGp6W$IeOf)Un|<Hsc@Fxtn~pAmmFGA?~i!)UI#G
zXF7HWvlXm@<(;_uhWH9xl3p96+;^J(hO$+U^c+0=mg^|-s<t`oYKC1rg-4-4*1;E~
zWA4*azyQmb@?!69?yf0D$)eQZ2w&M(Z3$yuP8pRZIMgIn9ND^o0`YCneQ)nfz2E5T
zVFugcx}5v|rXmsqScA}90Wp-vqvO}U8mNDW`DgVOIK3*<7fWv72pkaEmqxvd-ONfv
zx+ouKv$<E%Aw7dQy}SLeHKE1(pW>6Bu9ozp7p}0$2VM+J_9caIIV!e~fe%+M%Nz5b
zJ_L7VF;8sX`9k*#m$R&Ay3nxn<&gKm<EP7nZQ=6yvj@$_a89g*{^KS2E5=nL-_l1v
z21C7=_hTERc+m;RpKmVJ@Met#Z>hp=ZYWrO%ItI3^ZyN4QvA;u^{4TP6Ku1G{LL5*
zWI&iKSB<LGUGlO8Q~L4qh6np*R(JQYjsqs{E}Pf-*BSVszY0}<D?)T9OA9l3BYm3`
zR#NeIgYz{VqYN?z!dEotSI^j5FF{lS;l;vTXTmhC;;TcFaAJh%>O6;?zD$)X7EQiW
zoIz=3(J=zZQp2tuT=tAo{ubvU(XQ?q?uK|VElPFnqtE7f>1%9BtH_48?2_r^8%kIH
z`zCa}74#&Ny;lzxX{@u|Rz6;tq{72`MvRfOmh43%s1*qUY8t;jkmMf3t`|cSh%_7s
zr@3^E-lUjrC%UeNi}TtnM3K@<pC@Zc>(xYk8Xk*irsopAEJlYCs>}Tzzd(tHS}_Z|
zr!T=y!is8`nwQU`i$1P^TSE{+@TwZhbAaCUjulN=prUl=j+esXIG1gbII=w=F+PNn
z%?qc3Sfe8<5_QXu?1LKaMVA&du_8uY6`DKE`Y*$Gj7v(b$m_A@lZLTB3DfQkdD4I#
zQhd9)H|dAL7B%UV(}fFG*-G!jTPgxXtD#fLj#w5q>jI5cxHGSTLh<p%0u4q<(y&s*
z_a(U6+2!&IXLI)Ks|dj>okqGg8XY!-A}51`MoF5z@wlua&V#vw8SzJ*HJ5lS_@(Gg
zTK=W_r@6=XK4MfZu=Os*nXRLUk4O{?Cc>M1N~MU%gz50I6&)YIpV(|$6q+!y;R)Q}
z<9ve1z-jFBYn)N@`&~<7Th*vWc<SBw6i#lKcmB7g&eaq)u;C!hWYK1DBS-bdx49~v
z!e#piH(@jz)L5MZseMF67Ke-@G~9WnG+k??Wx+H?t-`NNMUKN)24{EYDX$b9GVl`3
zt49=3t^bTU5G95gDS7B;+XjQ8J3*Z8NV<v>Ppww6fQF3{^(1$e3B5P$7t>)9hgUM<
z3EIuV^LDOp55bb}boKOGLDV*ywTgvjlJ-A$s=&{zh*|V#Y5HD;0n#-RCK`izYvJiM
zk9H^YLTuTZqWoJw7$>mW3}AY)Q6TiL8<(pU3XvdQelJ8)PSq_yn9cVY5qjzBSqW6I
z&9PM9q~8vn^sg@NLZ=At;Df?ZCqwJvQKUz4jy<#pqRI(2e7`0^>rn}WBp{NoShMnU
zo2HLSv?Z*xvSRj1y80SKQtSwbTW*xQVrnFD_E0N>%7H9I2@kcdjYn?|!GNzP!Wg?a
zx9at3pqyxa$<{<AVIJY}*3w64u0+(K02;xpBO1RyrRATVU?n~Ssr`KCweerwu@NH#
z%4cSNT90<plWjKgV<?&XPN(<Nx6~uokg*5)`2HC8VdsY)HJT-PRy?S%)N5Ta2IdYJ
zWA|>W9@rC?*%nu`FIy=|72`5_<*UT^%_enaG|>=L`J4v!3(q&_D#NWCp4F1Nwj_>F
zED;-iPU(ryW&R_raX9y#ZMZwXLR$HiI^wy_Y1D`Td-q6RQlfCG*T>%NoHg?7|J;8R
zR}qI4`G~>vnqB@%5Nrz@_Dg6ndtUL<b2d3#_=jZ&lHa9w;vhoSm;7+_IuDm$(EM@U
zN(y)S+~2zn?}YFF67nT5uZt8p>gipL@87x8|CKiwOElvvUd%Fu;3BVMU$N-sMWX>2
zb$x_?;jQSuA$7ht#c<MEBp+Ny+SSq4m4oB{>PU+P3YPbU81qbNORH){uG4?==Pdsj
zLU~~0Eq>j8B($&-yj?vu=e(4Nu2J(!X0r-QW3JfgQO+mF64N(tuHU8noYG&SKEk{8
z+^EBhENJMoUd@rpZgv0atev#-7ne%NiS3(rhhJ=#9fX@!r4#NQen#wa;Jke=Kls}i
zEyJL`)u(Dx@bqgfPCG99q6d}$pJ5gXg;~4W_rl<fCY#pz-D!-Xw-UTd>5&&|LWz`|
zJ!@KTJtc)sp-N3tp%kzEq1P1?yLI<Vn^9F4|B~Kj3S-}6!+eBvWvdoiBG-dVN$j1`
zOpe7ac@yF>t1_1FPaxFoyFmzWl7jv}zV_T9h)<R5PGMYVQ@s5{>A30oF|*U_J^zvh
zbckSrzEq0?Iw_>NTf82NsWj~}_AU*ppaMf{x^qIjmKj&q2F`WQ(Vmi$XP<Fm_ldS^
zj@wkRW1i=v<ipcT*yoMM<g$%T*NnWkbzV4*x77!#oR|qWUvJ(>zq(t+EZTx%zI?Q*
z_iK0gyNZ%6j(OE5FkKdD$ZM%SurXIAJ#l2SoH^-RQmwhj2Yl&gnK0EF_h}zF@9ZJC
z!JO`mU|?!Y(rW#wZuUk0uxQ3WF_iuC@K-iBsDvp5YB@S@6yDS`l@noIk*x5^$Op5P
z`@5UHWEie~8KSFRJ{=NKoO#9lC5{@I>E|2G71;(<`#JgwC%Tt!ZNFj}nCq9n@3MyO
zX!4cWGUdpRBgC7kR<)ztsQIepBwVF>($^J-*qRE7R3a#Z(@F~!e&ia93)JlhBOsT0
z6NeW!$Aw14BrTF~HDjrxBR8`jE@h>%!*Acyc^w$nTRgqsMJV<b^()qYPKAlZA?X|$
z8E+>JZo33Kr|JeZ2`IazS=i8v@wDa^;!4zYltMP?VPy%19pRrue!B3nL3_99Q=&|F
zGb0TM77P<NZiBy>R9YE7axXM>6q={g|I!7W4zp;~rE25qKVea?T$F&y7jl2tP1H0g
zd%OG{rOuv?#BbJW+BkcV5F{c{qB~ztnqf*zpUt}8?z(PVuQCrDtgJG<sTG}w6J@;V
zYP%H+2$G#9+Sq~B<m)isk-!E&)7w!<YuuZiPg^Y3Ec%VGqe0>?Dy}#xjnchGr3O0~
znJxJJ8ozM(Jj5aLG3k+}$+~L}jF)M-M-gDXu0NW^gw@|`!3><UujuRr^N4dDpaLBc
zEB?;Lu{!NxEWp?f-3i}Mf9huesQVNNt=^KRFx{W(4aRX^1p9CEO`BfTwd)x>%sJSH
zROm({K%^POz9Ja8RS6tY3(y)0OAjZg6PZzQ!CEg{6=y?J(bt2qolP^uqX;X{`b{&u
z$+R3${mh6H4?=en3SMg{M6+!+UppAAw#FMvASaoB-6+87SenEl5@Ci~a}qFRE}p&>
z{qWFE<GenBFXl24qqd%jAf&}iHPiVMRtE7JxY;?1m;cnkF8m%$o*xMq#sYI^GHK1}
zj7k$aX*<8+->(FFFTzNOvF>gbCdt@l&pI)1)=y8I;bMr_XS~8IHvIzvFuw|aAZ|#9
zsEZ#ZsYVlivHo}7!%e_fX{x?Fkj4i`2bUL?cs>50_!NRZ$8k*#*DrkiTFg0H`-8TA
zq8J|`a+{yR4vRjRlW;_~^Na6nz`TX_DCdVZaMOt|N!se;v1`O4sX=^KA{(H3R7TvZ
z{K<5=Z%RxFtqSfN<6Bewz}(u)QhiHE0y!?LAVi-_4BK0?V8(xo*wyj04YFlv*qx^5
z|0j$XI|DtoF`ST{HuvL3rY(g$AqGjH=ERvWA(JMFq1VPW41c>t{k(<A?8^=5bqji1
zTH-q7JXPCNtn~feDr=;oe8%GGf8gDOH|F|F>+yHb`|sQ`F&u<a^q(oj`kUSA3m6vl
z&rsjfp6BtEeKWH^hr*dHfW~@ni<kxW_M#b$q$BqLF#`1JM3U(UqzJNWHQ#;n#!~A%
zKn)9r&|-=BsO81*Gr`fT=c}6)^uo(>=Eu76L(k*);o!L2T1K(|WfAc$TwDo4roQd%
z^WGaBNaL)zrdhM;)d*c^6(&*tq5OVPk(gnd@t2JUv3~VmYn1v<fMu>c&Z!Ru=qv~+
z20}>jfO2sVs>18oNW`_$&V!?M?dY7zQH)>6GQG`KTS$MkyOBalREe%HNb9eYUEH7?
zSSn7fK80&ZLHwzr`mKR(xvQf-O92O6!UmjNntQQ>0R;;4crmrQCy}7pU+<l^52H09
zD6C%Pm2}JIH41k5Yvtpgi-&TtnMw=3;*W#(1X<F-FMU_C#*`Kv<2%AxPZKs*=ARol
zaN6bJ2re$h!tr*AW(P2aNn_LyXL2_^^E6w~DO)1_<bM?3=l@7E<SZE^ATVTod9!{a
zYNj(~+9CPqoY8yiX~JK08FZd}*~3f<Nl4Orl1`{n!EC}WveBuNeDN*RxcDzB0Tiz;
z(Nguu@TNxN38{~^wT4JWWIg&pvJz8howEIEcLH4h8!6f8i>En*ZG%2Pjt>=)iUM3G
z4g!$={8^C=Lm^;R)cxtFF-G0hWchnX3~vq`i+=|Dz56Ch4LLqL?X89c4faNd41GHi
zcn|way+Nb*O}$^Ff&9<A@AO3E)+QksZjG4ZBoUSoH<@#K>Wd@pah|(T2QQnDS&=1^
zXpN+=-P4rl>Kf$=P9(wUbe@Op0Qs`3;@HNr`vb>6P#kN-An!vdt7d8v>bxlWzMfF%
zlSJG{-bx{od{y=mhmX)@v#tLzh=73@TKZZc$P!x3uWN`<iVkJo<-#DlTYRTTYiIY3
zz_#7hGo`6yEk?>@NL-Uk#W$}j=V|M%RD8L$kd9=brjxEtBm0fC-@Xc4v`P6N;g3wS
z@@)dz4(M6~)$eoYhmG2py40Zmk!1X`>9|M~+{ODQwgi=uoGbrrXjqYAm&F?-Fx_CN
zi1ck1!(LFuGvLmbH(LX%ATl@QqcTLucFEl>WmwTd$S7<GJv25T&e3Hq{(<t(e%|D?
zq{S;v2V6&D;`VQX$KfGcLP3TrJr1b|gUvSmKX^M0FM>l<u}@C#BOf%s?_Ql|v_@ed
z`!#!vIlMLQjGTTK8bEN>)W7R+Bz}R*x7#!M){SaJ0kZM3S#BiUx9MKr@IY>xifo%<
zVRPYzEX^5~=4<OF&7g{<A%x8SYg~AJUeS;0)X0=<WAXe+WWrAo|NZHDc|neCy9Cse
z4h*}|$+RElBa$nZO;N@e$qwVlHD{A?1pTd1FZ2>m14Y#|+z2~nK(9w8t|ovZ?PhxU
zH0NC|l<;pw)7ksp_Rmvk-tmlhgC}{a)*rAuAZj7HOaA4SO`dRGP0uH1@&XLZU%v5V
z-c%Sp-6-&mu?Dz21>m$UYPAIU%0IXtpYaXY?ro{>sQ}N}x?-W$-|lQJh(j#_^nzZE
zeziM>=P&!fw}M@~jB?vez-sbBHib&WS>G3~SIEh+(JFAKPvdK;smeC{f{#ZU)lNcI
z?LV#P9P8rvwjcLu2Z+l}8lF+wcc=nsyaq)V(5IK6H=;Ohv8766xVU6c5^hkreGAro
zKZiX3uE3$zB?WVN8?^VAuzpS0u!B6*GFn!mCm8=~ov|DraOf&pnR=(BVTTs^F7*J}
zC{<>F<cj%<3R>>u^XbymYea;Yb710NT8lY+!e(wa%%NdhYtGRCe{qhpb#<6|nQUn=
z-1o=FvwX=|e8p1n6djA!;yQB;xV)f|2MGzYJ7)%KhcYEw@hTWCoTP{U>36ulaCz>d
zj)~*a_+#?~Oor9A4wwhxD>VTuw%YW0r-WP!r^W4T`ctryv>#f(=1WoyD1WKuT`=Nm
za>d#EewCnvlYKvn=$?_RDH%J05dMj3@wLy@4;pp)ruBT|sK?zUhfOO-wD<MV1Z;(5
z4sYxzm^rY8ejV1m2_7Az98}@gIcVL}<eH1HP<(;>SF~BbIuv#dTr9r*XW8mUqdqDj
zjB@t6lt6(bJNz2dlUF067y)XAKV^mB65wSI)WMTEbEYP5u69`9`g<lr{_yscxT~pE
z6H6YQ?C=Lo0D8#?62iq89VtTT7BhsVdQfj#-jrQ78y!!q`c20{>@uX_sZO}6QnzN>
zoybD~KHSvgKMVr$>5Qq1IvIY-?kIZs_4c&Y@A|8k6i;^{k{aE)PgO{@h+*hN?B-jK
zB?zH2;|Kg1f7owFus+`boR$q<-2BMVL5AA$N_(g{6+SHTN3OV$F_kS<2D-ks$wILl
zPt__ybfcV&iMLRJ2xfzHDi-hbLNE*Hauuz~rCa#|Gx@#VaE~o@Exu0RpDwR=_QsMk
ziQVm=h#XZ<l`cG44_)+UL>Fo3;nL=mGda|O`+=f%jjX;C=AkeldJ6vOYA62R{dr0b
z>WhiiKmi}ug&rOQvkUeko2ty{9l<?s^2+X39Z5=o&0sg%Z<ql=GG8}d%yOlFbfekg
z{}M+h*%uPWL;MOlYA7AM9-1GpQpX*RcX+|o!;^LNceF|7&axaWAx@=CG4(LvqE_)6
z+NoKXa^NF@u<Bj^_P!`#6uFTDrX+#iNIG3MW?((yYxd1fy)W7Du9>+bX6a2d=D*6%
z6LR0S#V@~3T$d8C;)kk0!h|CvUwWm{7@qeibl~dkn0idDNm2$4RlmG;V3{zJ)`(ud
zKHT&FrI#xlmMYy{O&U^oO>)WYZnpDzN+ZsF7{<2mSlaL4|D-ojclEvbbS;a>^N;)L
zS(`@k%ZoUa$h%K9$Gx4aY#&t*Z;LQ^SRe_hc@Mv19CwZjdurjP4%CJ~_fdcCZDe-V
zowsdsjsdjMr8MP6Zn=TR#2zJREW#*uLvk7FS(;z1Q?eLxnF%p5rs}bOFv4<eDN`9s
zjwRE3HWVmc!v(t)hNR6rMqQi)R#ZjV_lMxR+)#8Gy{em7^3TTn&zj0ExqL*&Oq{V(
zPkFccF1%5<U_@m4spvhaH`EvPu;kkg6FifqAd&Kogm>;;pz)u%Ga2wFgB@k9*ZRA2
z2h!-!yh>URGba`_G&oZD%2(wAq6q`z)!J3>Yb%4D{^2<ApUfu{3dh}h@#h(&)v^A9
z*;mh%fB5r&1~02rorA%^?v=``x+6J3G{-Prw-|UpGd{zY|2!-Us@jlLioR0!xt(iC
zIOTZxa3kA^1pA55j7~z%EW)|#H2q+onG25>>15U<SQa1>wuAm9hE=xgi{@4N5jWwN
z(xqxXWJ#YYbVWFLMv+d#LfuR)#lcVZDQZG5sFt2WhNQBjviAaI`Zo}^WmL0^dwlxX
zh6yuQh<6M;%oo0^l+~gm6r&ILgB@$!U2A-o7!2FzGABIGiPD=qAu|jqOj4m5ZYx|R
zGaLoC#Hx6z(Kw4Wu2obfEXaS@YPjz>xl9UC5KbFHYv#%E$*>L*KPw$$dl7YXJMXPk
zvi7k?CAWg|vv>$f)I(&N!+&x*(QHLVe%A$dv<|}(L{JQGoO?FamAiYSHO&x9c-gXn
z`u@^`^v{c{B&5HY_%!p+{gd5$y>gj_I&U)eUY{%V*>J#*ow#vQwzcV<yIZ{%Yr9$Y
zII_y3aeh&Jj)9qS>C^314l>5xv&y<H&v39rmX8qm6zONbS+==24HQf&CuLBjjE3b2
zPg|lhqDZ1oaog}DAXHj7texMm2n<A8uCHC2Np`(3gW#gCppY3|+;r(bgiyyx0>22Y
zpvN@5cgcS={<zN{Vb&!TjLq|OI#9V*tP?h@whM=UxId6-LDMY1CD^%n9rx}UPVt<Y
ze@@GT^GHl1uXM#3gMb;G1nodGH$dYe#1or{&I^XLg-mJEX7pn)wK6^HdPUphb(X~1
zXC#R?%N;&K27R#Ez`jvK2{-~t4g3tX6WHgT?|Jm7O!Vq(O{~qr^^aGvSCS}c^05*J
zVE|WR{@U2pnG7j5pJq{X8HdHSbDh-yYf^u+v7fhX_sGQekJIx_8>duh>X-``|0E*5
zMrY`aCwi}Fi=D0~B_O1S_0~n%)3nN)=Ped-hIK^xH2k)i{XN`Kc}Qf#k;ep=79`|b
z6%dPlyl~edKP4hz{rajmZK}c|Z!!-Wi7yj|*awes*!_#xAV+`id-@k5PnPDqHvblN
z7e!0ovjR_7Lk!)09YkDDqN~h&nS>QAr8>nd+l_xS{04~jdoOHPuMdJ;*2be=6UjPH
zlNCv7U<|UVYabRNMd(rr`TchWV=470*O>@o!7H0<tYANFTG7)n^*Om4>YRja`<P=X
zX@5HKRZdv0#^BAI{V}onV`ABvQ<Ulm<7#kxxHvfD?#RI)>8%!ghzi>BHt*Bd!IC|7
zb{A(f%S(es>IpBG0DV0?CNB##7AD~kocFL`baU-TJEf~}BXtx49ZHdT#(zFOtImX(
zvSdaf%3dpv71l^dik}k(a_8C1r)(*rJt||FvP%#mnNQbs+!RlfC=|Vp2yC@~rg!RX
z=Doiud}-aO4M{-g8!&n2Nj;lq`U?}1plO0m0B1gWK3*N;OKZtGOBDIzUnQ17u+DeK
z-I1Z7eR_qZ9#R85Q32^Mo1Pm1ETP}YWGiB)@Oq~A*W@H)r83GW4W_$9b<w%J26A00
zn;phPSndrssNiL@?e*W!;JOrU`y=U#5^f_yh_Rngmi%uyF=F0i+wR9kA9*=wEJ$@w
zgNeEU@@2-m*t7>!u@#1@!c;<$@$zb8Wc3*<x;M(9GY#+oU!%7jEA!b;xo`13*8ZAl
zw}(U5U6NEerMaZu)aBZzU~-mg{1=KsqD7>HwP=exw|{4Vv>7NDT@blAZDjeAeacWS
z8+Ge@kQZg3W{H!T-i&6wVm6H4EQ-j$>cX;ut6>Oy)Gd~7X#F-EX!=4`qVhp9hO$Xx
zza$QGrB4Hi#W%VClzh-5(&`XUYp=#a|1WCb3;NcK=8DmwhW4xB`HZG~_SVZD`(my&
zR&FnBZEZ9r+xpzgf0ED_>F_~q&JlSpZYh3h444_QzmgVey+3}gYA)u7W3rgVlE0%A
za~OlEV>g1$+=s^s(@QA}icKxB^t1W?s#j5hJG93GX-hKJa^^ro$-nESu-w8&vvJM$
zwM{JJq#Vb~#d{7+k}Lja=p@_;F#>D?cuTvJ<G=|s%zv*=*?L$$*f!_fOI+=*M3m4C
zzu_75f}M!ZOEPwXcLX9gUBR5;C_CRtIPO6&G_|H!6QW0{bj7w>#;A2wY~!M1GSo74
zA^6_NXqp=_j36X)G7S|1;AV|<a;(a)?wtkS_BQmjPU*)C#KLqPWppU&JTe>w4!>47
z2<r*w#d1k~?bk($@X3M?o63?b$FJzrF6tR!Jv=lm^)UZil+)hzFKfhuq`{GR_IN5w
zI4PoyLFOv@SXd5jGeAR)z<feiX#A;0sw2hFyZz<41Q}bW{`Mz;OdzVyNaW9LT!NPb
z&qpp$3OY0$mUKY({_wYkVWASMrl)>}hWuS|*0f@&sVrfGOR=cSEhqYqH>99R??Wh<
z-D1Zskt}cEPH=eZMtJAfzo8Dttjjzh{7Vl@p~FJAcuK@kH(9UxlSTuHh<d@UYG^}<
zq5U5Fte#!QfGGuwWEkb^u@ClvxrTdMl7KKk2-m#M>*aqygu}8Rj~*Y$LcIe`ocbfA
zPDhP6<W;C^8rw&tHb&EGrSi0TQP_8v3CRt*l(f^%4*L5+DNrzCj)SiJt42j|sd+sg
zazc{kk+%>5S!1h%G=GssbV&~q!GE;G<ZS|0!AYr-uD8}g<DHgnx)3=QQI05YFv@s5
zwf(m-)|vm2iB^^Dc{54`{j7H6tyh4|)`t+r=eXZofK9KizGg$5Li7^S$yn>O;Wk(+
zYUTu1^Ms2iQGR&x?p+n%-r4Fp9?M?quwW(xOz<*kpuTiAHf3*;%%S`X$s3(UUm*Dp
zLHm$nW_o~Lu%X|eEL!Xpm!|sOBe9aEfp6;2jjHb{>8W6qeG3zRt^JBUYK?ob^#kwV
zn%QQ)T>)Gawd={b`ca2tW7o<nb*okHSH&Y?UWCj5ph5aAG#i|4SaTOT@(oF<9iZ>$
zhj(^NVqu68shf6U_O0&~e_ca6f65L7sN7}G`S>A45b>QSe;S?d<ly+(<C@pc2_fOx
z56<;3??z>U?gCzcodAT>!D<vHSbb{&u>fF77~3#<8IAO9^V*D5SNWzDN?@2FLp-D~
zws?4jgT}LbL)5C4T<{<HgloKhQC+SOLp%yL3<*#t>OE>o5t4M5hHa4Bb2s^>c`O{z
z;Ua&k^82fbnGz^@Z3cfRhR*B|;h`!U>9Z3ko#BncHD^!k$my3cF^V*x!gG7r7QVy%
zk06qijY%cDIFSu2t!Bo9GhX{Xg+J$(a*&v6r9q1?9hK?cup-Q!^jfrtAjl&7^5wPt
zJsm(||Ddajf*a#~atTWd(jQ*7PI2><`f^AF%jW^VrsTn6eTCpoTazJ`GK<q{z1I^6
zv0jcHumkq`b?(-TAut1yxjN!?UAGv@+)+Ks`@N7PO)R<?ePTC2Qb*uE`$})VhyCB<
zJZ_mZ?EKN_42LRR+ebHhu5KH@`E=au2l{_Bffk+m)*Vx)>!391w0}Vid+^2}2=wT-
zbt80|Gql<IG4s*%(!|@ZV8f{#|3FoaL4%JobVBh{Y%x@aS-|FL;VwtuCI6Q>t?9u(
z#l3ElIyVJBUc%)OP7g4z*@B-V(fQ)rKK9aFud7B`wix3p9BP?_<%8F|$oO*r2f3Kh
z<)b?q-Xg;jDrCI#xB*fMg&i%tfB)5{X5yQ12eqkpam^w=MzLs3tPtP0ItSVLDMU)+
zUWESl{>>Yw)DfNh;=CVZkwwZ?cyLZ8TKoiihGDTD@xqqjSnOArMF1WJ^hVwC7c)j<
zWu`mrZ@GH{E3A+8L{R2zUskDJ4byP45+B;(@nxs^o(7{V9|Q8uivSjr_KICOvXjP8
z363FsCjR!xk9Co)G}?PX36m+><BAGc+DbG`>|7;&PEM(fXk*$>R7@rP4H?jhP>6O(
zN4U7%<L=(Yyzfc4_zmU1{f);Mg)zeT-}$%<ebtk`--XlYIpY}&_wyPIT2E7yq$Z9!
zXGg0vLs^gO^)AqgXDmv~$oDi74?7<?D~6LxN0RNeQkg2aKAvO9ZVFT}WEb4(D%!5F
zCU*Z_SlWK|`?xsEin*(!v$lYT?W(CjvT0V}X+d4x@VjB^ShPI%X#*Ih+ZKt<vZ&-8
z*f=`H2^PzIZ<dDy3i@Vt_0!yauiJ#tJ?_iB`Rg2oBDD9hA2T$4yf5OeJ0`y@^1!FN
ze>@=-pl`m)jbF$(Z7Vob%(EFzY-tAB1mQO$Gbhvks`683cZdGunbtw&OKjpzvo;MS
zE>gyA0t!4oV&afoH9)AJ0U~Q7z#nj1U-L(O?iJj#{Ajz3+h;ZTOigsk+VsU0mEL#?
zYa5l8hftPj7_gMh-mZ*3mf-1U*y+ALG~P%kJ|AL*Oi#+0j<h``#osi-2024IX-f<G
zQ|(G=4ZK}O&vE&^IRiW>Tt`H^F5|D|OB?eAqFha@^!!sAezY)@JD56I9E`<NI!)DY
zh3dgHZ%SBKr7{#A_bXEF#0%7%_OY{#8R!4?{-a1c7->D%i?nB5u=(-c+W^`-{O^=g
zlMH$dK2foP|9;C+zX>jsoS1pBxs@NzLpd<>G$EU($E53ky#Lc2rHe(6r2_z(6D1Di
zWlbJ$hb0J4$Bu7Yw(lE5$Dok@EE$|oaVEXrr7S{_B21zy5wR#rBM1C>VSgw)62ZJ^
z^&o5<&6KcohPZxcEDaT!`v*;fcpEW{h|ZL6O9FmeRGm)0J}g7B2Aj=3%g)TGy7=CZ
zOUIp)t$5wSemvO+PET()BAW{dQ!G1Kn95}Qz_(%Sqhg@<mFO|ez*CpbM;{#|>x8rl
zEbFnK2;q_TW;OHhdx+tYL^qA*ADcdk*?l}6JMncF1f!2i<oB5~2_~|p1{I%5+mV;j
zS<E7d>@l_csAAa#V<j9!(4)g8d#v)${XVP^ZhfoAw`96w2T(dsF-m=4>SEONe`tEk
zsHnd8|9fa@!~rCwrMp{TKzir~>6Y&1BO%@0Ipi>ufRxf8-62S~G)M^l<M0074_J#Q
zEY6xaXP<q&<F#kM;(_X@=E_Ah_uR3U$wDFi$8sND!VaZQ#bEAD2hXs0En_>$g;0nC
z*N2&VFTe~2gVu+tRE}5-=$3YPEqV*)lCbbJfj=QLCSvpBCw5XIP4mpx?b)XUu6;Ja
zAb4@6<ldhA`oBZWLm9Ygsl@2L1RD5+|7ckuhs;E~Vp$|6;2Ni%`4?<Zz5Ye&0Ly&y
zE=8{{rP>(aIR@>1hl;+kzF+*=Sv-kv_*>e&KrD=`J)V@K*DsRA+wn%m^u{sPeMgHA
zJ{-X&peX~>H+yZL@a|1NkXvk73<AE|jVGC4JW!fnjJV-5+AZZHFNo;|i6H#pn)F6^
zHE{1#TanC%e-otTcE}eSQN)uiZ-%K8!oxO=on=W?6w$Fr(N3PBdkH!Y!a+e;3Q&<V
z{facz5MUeaHTFHJ`RZ{w!e$<u8({1r<IAYZ-uv3Ab^VFm_r-tn=WVt_!N2lRf?rTG
zewy_2m!gvRc64s}`y!;Qv61#ugt>y#p)`~^n{#B6boa)oP2w~%<dL-g4noE<+R^&X
zqANUL{3`qoid}B=@niqy5emR=`3D-hTAEj}G{wtF*8I?D^oa;J1)*>cj#xa)f?FUO
zg-I(XHK@zUZl&!*c<7B@-7djJ5|$p{kF`O|rRMACax7UMyZ)DiRA*ADPm%i4;W+(1
zGXLkEgqWB2MDa07neIvj2n0O6-1qT+oO2g%bJEs%PIWI`wA5^)gk^Tb&}AdMPxRjG
z9m5u<2?a8kiHa*G{(C!{^WT7&zT*sm*8H2U(_hc-!Rvq|M7jQK2afRj*d2K`bbd(}
zxXAPSAZ#Cfs6ff;4z;R17O>Er%k(P6=k3Q#af-TjX`qBhM#3u#+MeGD^b$I(`d2d-
z<M*^P3T&371V#G<r6{OuXUG8mwS{iBX|@1xr|_hDetJIzC9#gq;^LakQcS2+S6OkV
zPn?rN@2VWI51~ZP*;k4ci-{`KZ=TaXK*Eb)!Zar08#JEV$@&a*_Dz8*`2+7L4~Hpp
z8fjHx%v!#9@D$`7p*tJrj;LH;TqCviNw$oe+nc-(uek7i?eD2jTz2%qUov&pdVNe^
z{d)zeZ=2`-1dg5~Iz0<lshG#YgD6(&vw$ivtV_QnV8Y9LM80wMwMzOm?uKljrtI$N
z*hNC1rcA}k)V(KL;%m5utl7USY`@yfF%L^j_#Nc0-XL=cL_|3q?<$s`XrZW&9sNcl
z??f%9v4<K6dlnx>$8?+8!oi#c-$ylTSZ6+vJf_?BBlpiD%f5B*GUXP;(8FqYLE(h(
zD<re1i`4<Fw&CBg3pQQ-e;j1`b|Hw*n+6h_#Wc@IAT;Pz$bWGQx0Z8{gwzH-Fn%IU
zb9XQ%n3<;UE}F{rB8ut8@kjBI4W5><`f+%5)g4%;h`meVDLDSk&0DL*R5zZzK&K|3
z9Z$dO&YI-X?@A0O{?Q!TEGTCVGFJMYp*4j`E5cqiQ;{K4D3Pd%Q$`*RCbx4XPp9b_
zYGRc43wy_XgKsDe0~mqmN&`M04zPNzyH12kvfOAEzNZ`ecH#`<+G%n2_cUv&XB(Gl
zo)if8o7in~YU`r6LbT5yzc_8x>F6*#9HaZXHg8sVL9+Nm;c>F_zv2_%IiEr10`_m<
z-%d6rdQYaeZ|;Nlm+mLf7U@4UEexYI?81}iW!;G?*sqYxC_}a-(v`!D-P>*{jwmum
zYG;gwfh0kZd?+DP`FJ&N$jhj`3Gi^n2%__pCl_xA;i!*;7M(g?v*I)y3x+nC$JK(#
zjF0SjP|8BdhLA23g0FhbKkD2~iU;PjMjJ&E(j!N$`4@z0aMtK&YLBQd+03#wTSHD8
zYw>G7#P1Xf;Yq*Wd#d(f;DO-_$2WB$$Q)|potolNCJC6l(i%v6CO~>MD4%VNJ!r}H
ziT~8+zjPQ!Dx;-_mJ%>&_`FK<k!JthB0&XZEI-^9u`}o)SH#PH?-A;>1Qwr8nbJ*9
z?=&WFuq~2Psxy$8a|g`1zmZQJpjhTzO_0Lq`M+$!SJ6XDT&f33Kz|)6ej{(J&Q4u7
z64cvJBkdwHYR-aW8d}WKqkS3pos_!3l3yYCZ}Jaz5C6H`hUd=Z1ZI71!In=|$fam1
z?1?P%DLB-$zDNWwC2iH+8!iEVnEpNL$gpB(bS`*lf;Z#Si+yBn;L5px6nmGo*>PH9
zi27&J8gn|^%}>q>I$E}QVhu;N;WVW-M{ix%ze)D%cgAnZ+~U<dM$ijl+id5{hRJCA
z5OX0j?6)+{8?4OIncC`Tl)jkXk~SwJtMz%~y`Fii`NE2wnO#~L5#qdu%dM27``>tD
z6-y{_$WWAAHPaqV8cj-&2F>n%dWQU=2UF-~+h3|ax<Sq!3-8<Gvxe<WBuIKreS|bM
zqr(}oiNAAnr!>oa^^3j<vQYEJVtUP%N1X79Rtz$QJ`^n_wQH(-J0PR@@iy2lcbown
za-OtB0)8N1qFO#5*#DBxeXkrvIOMA?fLg|K&vq1e{<<EsyhZ|-X5qk7WS*y}LJ`A}
zcr&Nn?PabKMnWJKFw_gvasXWakgAs%#rH;?(RoSZ$o(P+OZ%3`>9rii5P`>rUqGz8
z*aU)gU6I_I#KplNhA*z008(92*VbUjXWPI%<wwfpr-1E0%I4WRupD}khn5UBF$nH|
zBI99B(4!AcuiFdpsTF)|fHKD{Xot{-WC*`#k((UWGx@*da?1MuZ=RJWl$}o~K7q6@
zak7+pgpRd>a(9szGq1o%=oSrk>xynDpD`A4F$6e+5&AsHITaosyD?BgT)y?-ldSNS
zzlpk(YD(aPBf)lAd4dYyisrq!7@TG%m`=xg4!hySNU&{e0onq@Ui!#+;~mKl@%p<r
z6yySG+-ZxoefW2skJc|A{)LxI{<gwN9N-Iu^zW$Dp}Z=mp}Wq@t57AzQsEcJ_?<VO
zHI<TyI?;1T1}TcQ3|m<~0jt$Q`5m#+{HJ;kr>&#CfNzheH;oJx(|hxy#!Yu|kH<Uo
zyxp>ww0x!!dp%v#z9Wo_{%tV=@b3b<H+r-$axfewlyb&~5C7dE12?{Z-{9?C2bVT<
zPSj68;Au9rNx`;*%J#W)J6Q-{Vb^7$iVOX%)h$Y3O7M!mdU5#PWr63n|L~J$vET||
zgTpri;Vr?eYXyK+?*hCHMe>t^Kkt%`^HU)a<;>Yh@$ZctD$QwE-U5NyXBmY<4O!Rp
z*|=M_e)+=n^9K<g3eJovx@W)_<{3Mu61(||=1O|0@h^L}bF1^#pPmo2`WRS9-(oj=
z)#WSe+ESn$>}TmJrJyDEv&Z^#DOs}?-exj?k?ms*oU`1n+caB`T*Y-B+VP~74;N6n
z8aSciRyho0sc`+FU6efW{v&3x6kgWry;uR6-~ASzXa{cj5C^osNA9=3wi069Znc+x
z2hmX_L|5K)Z?g({t-$5c%2u2MjltIKr@QunJk5^wG`iF+-)E-Z9VP6(U27Gqp5;L{
zA58@`i;2-vySPh~*;+VSkl}!MoQ&w2o)3|N=Xh6ry1CkHHB30ZWwAcm0OHI&+udYf
zA})wWQf6xcn7FPl;{1r_4l}C+J$H^L>le==tPmKBYjiml@0@eRIV0vLt8J}*ZVDMO
zW*X~hPVMIFb0*A>cQ{PIW%KJ+1hs2T;`-7D>Kg)7eT^#vNKS$$2&<aEg$!))vc*=r
z4O*{nrW4L<8?_5aj;~hEbznIlX>-!|&vT+(1hrff@xM`L9@8|hoh!ZHJ!+JUFg(I!
zs!i<WWEHR1C(c+qt0`$$xn!CB3KK3l+$q)7m1z{3;JW`FK~m<{*1l7gw0m*SD;98U
z1hV4jzGlLEokl|64T!a?xk2Q+Uv3$LSCI~kjLCzXdQ}D4SWDD|7NEha9X#`_Iu*+n
zD{bKu^FRQ7grdX*qNZWeZzR28-0|hFTJ(!V`S^ka_XlxQYSmllQX_&5)4U{(Y=^ij
zwb=b@#Ge1AD`;^Rmorv?C=X?OO^*FRW@-qGD=FS_NfL7#%OUFea4Or@9EVj1*MEJ<
ztk>BVpc-M-7^n&|foB}Sk0PwaqFH7u=BwXNc_N4JP-I$Pb>&Bvw69dL&NXJT@N2&{
zu@lCnTkB{K(1x3#%dX5e!W@*U)c`nyB(Sz%$}<w5x#4zt;1&K*$DzR!o%48UyfxMP
z0)#}m%=iRj>MXugF}~}pqcz52^HYqMI?wI8-I{tug3R=8v)V*c6@&_$O8QS@gkXiz
zhD%Lhy?rCv!)zh}5Sh&0isv+aB<h{#pX+lXw=e&0^s*4g$;^~bQ*23beItQxlmN*E
z%bmY9#F6wCjCbP08*+ivbVpw`RJqt$>Kz?M_*F$g=QWlcP;)WVoJ#SGQ9`ql;k;X4
z^VRRK;7{>L>O+*gGOAj`hxC^4u_eF4l>yz6KYhvY$4sSGm$3n~X`>#!x9u*Ccg0f8
z0-0$c$&WkfbNZ>KNU5(7ETR!F`3aFBL};;C^ci)ynWFsFv(}b>%EI^~to3`|BZNtm
zf2c8wP#b@ldWFyBkQrS&2cu3*MvhI@s#O|ikZR@t?}UZE`SzduIts{^@;MOH1C)m*
zXPZ4o50XR*eSk$I$*QM!aNIo<$l5%aAWi|jRyKTyJu3_MNTYE7fay?quE4M^0jUrz
z05#fkaY2dm*Qz~9HrOy=1<R8ZI=14R^Tz_Pxm8pof+?nL-3#9c2L)aE{@Q;#8FX}n
zwKWT5J1m*1aK9P<^BwWjB#~TgD{P{65d4p+?!f3La}rQ@JBboIds#)oZfC?Y7kaPf
z{u&buc!4D<R`oI7<2%`g09%up@>vFV5j8qL@lge?1i>8vqec1QA9<7$_8}quqk-7Z
z#3pHn7N_;|y8mo-k<-DH-0|n{IuvrqIg=qlb^Tj*WSd9g7#&SCS7KNPkBD=_Ve*YV
z!H}@9|Ixy%DMpn5ms?<yk)^W1yx$L)))EYpMT^azpPDNh4e6JgpOjZK(%WX9%7L{-
z0bV~#{LdSQ{xI~Ym|El=&_-O-9k$82W1d)z=PZymX_czbb^W>NR;-?Y_iCXtGZ+~Q
zEw<{@$*&7ym%)z@p1J=^el>~jXo~?^4j;g?ea&@v1lTTc@Jbrd+{iBkkjj@gGGS>a
z*bM7Du4ZEmZN#V&7WV%zrpbi$dVwRFhzyAiYNgkx+zfmqOeHzm=vBvJklGk}tj^Cm
zj%*zUX}>!d@)I539cfX0x?VI$rW)NvPc?ynlDxV59RbBL;+63SSaAt|>PU|P1`!)?
zdUsM{=6}ENqu!OMjO$LVgW7bFK*0U}%4<Cnau?H{S^QliahKshv+ZX?d(~n{W?brE
z15T2ZCywTU-|;sw0TPY&sEhG$SmNPYHzM$9GPP>vTOifvfzqF$D)x6cH;Bw2ZL0mY
zegYY!>a|_44h+pipWa+CX*l-%M+VgrN@sh2N!(f)aG5Fr)cLghyv4j6{s!lxbl$AY
zmuLOwysjm;YkTgA{bJ=yCpsuu>b&DAVROS`51bDfW7a+3-na1iHMIU~|F<_dBuQGW
zli`~tW%EZ@{!_KR9kA`}sa64i1tQbw41lD8U9MsyOya4&<?M18NFdMkW4$I~GMEY%
zNfZUKL7PyOsak<6N1DkoWwy7~p4`Vwuy~Mp*K{}ucG+%)V*GdV>L#4WcZHvB@a(~l
z>f8EHL8kk7&{XtX(PeoWx-R**8Q|6jdOmnH8u`3EHgdJqST3W7nHz>B)>;!wN6mod
z#yQv#k5Q+oVInsIM5jw_LK~iMf%(qr$2+lDNo?w*i-!OD$5X#kqnQ6+#u7h`?cF9E
zGF;*j>`uVE6sa-oo}<l`8po>W@Cu_@VpR$c+y-l*At7e+GkcM~FUKxtB)h`Z@G@f$
zpN7QV?*x%1^lZ{u!(7y?A4(enyBheXS?>1$AxU>MuHRqVs`mGHwzkDR-=!@^fS0AT
zeSN^c!2XgUnZF+fcJw{ogc_NZEt0|W-V{G8Gi<S53lcQ8oeMp3vY4tWjzz>E$Axar
zqU~I}2l$$-v?r66{#EsT-5K<ujW8^DrGQv!`Ajo`B0`o;bY9o4?5HE!(goFgf(8fx
zQR{jUE3-gLOQk0diPfp9$>CExWxkk~sh>4vWN+TpS6cXNMQ2VeSm2{ygjY0+_=D7M
zr~3J!5;HQ4ogpZOrp$_`L?A^0W$IfKaUk@I%!E$v{gb`I7$&ps{w?p%(0{#WPit?_
zzom3yUkJ)=Z|@+lg|GEW7>3A>09`GPSpO@gW$tP!VeHr9o1feFB-5l_dZ!yuL;00o
zGUZq4P59?cUQ95N0XzNt!G$iLj)op|z{Si%p%%1kM3q_JC>V5?yyy5W`IsS8aT@4z
zB|9;4TC+I$k$RzwxuiVrR9sx4vlOJ#KkhVEuL%UuWp6b)W2vCIE%m4-GsNj3KP)_&
zrMEKoAS+#U`P&010B!pnt<>b*RRzrrBjNtR9|uO-NR$3{J1FKkxJOTX1fZYr9wlU4
z@Bm4ZR1i3}V@-$=dL>nYEXNrw-){k$b3m>d*i@LQni4ux(V8sBSwoG^RvefmP<gpw
z5dG|2P=PyYj?b|tMqZcABc{L9T}IC`+awf(UKP*YQ-ETk<174%aY}acC`8?qlMKpW
zVrEgK<dnYsjd%yuya9{xNBMj84&<uU4Ai%kr5_2S7io7r7wRy--WbRkQN6<QSqQFD
z8D_hWdvpU4_~G2!ny*(ByElY8@N*kJC=IJS7Jt>%TKuTQ5Y@PZ>bhpbepUV85GJ{P
z`7G9uGwZu@)bt6p!wW<t9io-&#p0T`(9@+AR$zy{<s@dKG{kG;Yoy%DtMd6}6WrG%
z{lzyzAzyk)k?|8B+H={0nCBVsH^0AnIA!<9rJT1Ve39HE&+)0-S|ZL<<Ie#*r|cXB
zRsZev?|a&5MU+A)WRy3*l#(i%TYPqWpD8m<@c_v8oUMDpmeXphCqLb+%a&}K0rgp~
zKmj)WFC*Kg7^mCCVipyzCaQYUIAN3T-jr7zqCs+Kv^~})GM+{sKX`-XyTX0aT$Cd7
zj&QK}q@^s%rinRp^%p`oNwFZtoi+^{<5_0rcGMxAUU`8u-9zPzZ>fMzg<Wui+I9C;
zr@Y73LE$)Gb+@L<bH(rH_d><D8K-G3@Q=9Gm>X=&6oXa3QQ(J$5B^_G&aYtd^raS3
zo|VRLT%L5p_&`Ngt26(8`Vnj|vlhe}T6w2Z&zvqii=?qIv_7w7PZa>W_Ba0S1^Flw
z|J_QRVl3<iQ1TqyaRHIZJdun#YR(v&DZf{w?eA#V`Fm;j*)%@uzNXrpGC@J0{WQq)
za)Rwr0c(G0?9Jh$-YG8Bk4RgGlPRWtc`;x&Ws1;NMuLr!r<R^fwAMre?xhVp8=M!6
zP0lNf61uY~jymzDW6Zq=`dSA|_nhH2=V#-BBqr2;v`w}bJG_C@q!Yci{n(Y2tmp+;
z>#dG*S#aA<J`fAN;G^jpYwcIqo@k&tX_!4c;db6Hm9#;|p`3lFZc`tt^SsSVJ!_Cu
zx@{~X^}=)fVp_VAhHu^vp8lZ|-C+l)kzKcK2;6Y9m$bNuLw9pZzl$^di<UL7qqKdQ
zEcr7}K(@=K@me+I73eYAkWiXoltAC7LYea+<#uXU2xX_E^cweWEnb28^o>FNfoGfF
z$0t+WF=qBP);;aZ+$<TKKKF0~_Pd~~w6eYMHORwPU`-;`mr=lR`*2hZe6nglI-nZV
zC%pU9?Y>N1Ru!1v`a4gaN&bcXLD9(DKjN^Ng5kn`Qgbt76F|T~lUsoNNb=W2XO7O@
zw&`Jbu{=Um$ob&Wqj$P0a(bLIUvO&PlI|TvqCXKSBi3xjaJ?HKbw$6}-Zw^to<k3V
zamX$$)n&Y9iF{`X#J{AkhZH9X>4>@U5cypl`}HZ7h)lBJyqhyfbRa3aeC}-T4=D)S
z3~#-VY&Ih5caydKXwGGvd}zvf#h3Qc9O9tpXFl;oAK@Fr0;s8b!K?;VWu&wX;k=u<
zkiyxb(Rs8VZ33(&o`!iYan(SkKzE>$#LG|9nPve)CwTe&i%xht#i*OEkDWOgCgNeh
zK5y}5M&yW*9cBho_J}lRaWd<HKkGNV#S8@#w|W?`bC38?emkj#B83EIMvXR#t>0R@
zo1Z&DSolJOJh=#%s$95Sc^YD@kdgBCUx1Hf-&*Hs-A($$CXvNB!NdQ{VAJ(1mYN!<
zT3L=(-c=j^S4sffRY5HL+1I|#8xGi5mm5|EKCcji0|zQiS_EWW>Td=3=3bFA9(C#>
zio`tm)3lHXjTRM-MwS>r8+T89S`&GSDbHE7PgAn~>|kXA^IoSRWrx!kw0Tb{gz86q
zV}`h5+ZR>IO!_={)F$;n@TZuDuWAv@cgWjkgq<+;8phLNC$zSGq}U?(K&~cdN?QD|
zEO6eY2;+Fy`KA7x7)vp|2%Q00?vx_LE%YS(o9)n#lblUIc<RSOpWQx`Xv-SLOUBU6
zbG*d&cHP&WkVUQnX57e@h-`39r4?tX&nM@6AMD`xlciB<?l(vWXTJDM8Xfh#h4wyl
z)R%hXz^6DiFGUX(>$uF|@;Ua7KG`-Z1j>P%wfO8X1p2)8<q;AV1amWlLP*2LmdaMK
z!@t8TX+lE6^Ifw<1BR-2#H?Jg$VBvDX%)^s%dr}ARC_APi3KH``TVzqO-M0tBw4Fr
zPbP9S8AlM1*`ETs=*?~0mpZ6ySwtvOoZeF@B85ZzU(0b`G9hcD;4jFKiTs|U(pCTE
zb#Ntgn{|o1mlnrb6+mO;UKWeN!dHLjM>4d)<`u6HzPW6H#C@lto00)$GhnD#lf`;#
zog-LLoOenz*(5m1nCIuZA=NRt-b#xeS*f7#7E6_C)Os)^$t2gRaVvK~PDj1D$!B;4
z6dhLm#d#zeQrCbG4>-<M%;oEk(Z&er6<yb$zcUp6I??HK{M!WNc67aw*RAJ69BE1%
zZT^!*_s0l(*|CE$)1p{+mXhL)=yli}cPo-rSXYC#-yIJs<EnfpTUv~P+}u&6;`naV
zxhUs^#$XagYA0}tYymQd!6(iFeS-lFMa|CWW3{x@<e5)F)m*j3nq|j`ABO^KDDkI;
z6x3yMFGs-x{k3S(-~^}Hkq$d;B_@#W@K1zrFR(lLo@DGCS4T25s91#>MU2%F;(B?=
z^W{6RUR72s`eo5I2B?a46I>a>o2JiBm-L!rSqLcZLIc#3XgP~Em;~|unx{T%%9~8G
zSLhyw(8krKZuzf&Zo!mf1JMRg^uMQs&cbq;X97zwpmJy~<5$E60u@H?_`2hxSbk4n
z^{BirLV{%><|EhxuyAl?O8UfENUq;Os2)ibm!Ov2rS|dZJ<!0|(54V+d&EBsCfqpi
zw|b?<Js@zwvAj>wsWx9?+bNYF*_OmN@_ZYce8qxX=9&ht<j)F|9n(kI<PQy#W%Ue6
zN=A+YlsZVf=36nf(^a<m2C1a}18sxB=fW*x@%P3&tdhTT9eCLcDC<A?J^7wrBa+e{
zU>voVOm1Tz2Xk+0KDJ53&>CuJ=yI^}GkShJ4=MhsO6uwhd#$G#qCTNA!O1BJ#=^i6
z|6CRMl?94A1U(~+Vrc`yq*Q_Oeg`QJ>v7*Ky2)RbgYKlufIJP*E!KV=r0=ryk{$Ok
z^?;@!;G?N-bGBVzr^8-kvHEe3Nh4Q9Rox}UxIPuv7nIk?+*|bhj3?Fmy^WqKKruMG
zvV_;=N)QS3ujc}i4RIbS-DADl^GwEHzF6#Bej)<VGI%>bJflI?#H11P@8^}ZvYPoY
z0JDU+O<(Eqv*FuQ(irzdLg}>Ov4(K<j()t`4Q>sy2C3oWa)tYm{oUc%e(j6A=9mWC
zZ+sT6K^-Dx#p#ejkzqH-26deuW6=T*c2PYRbT<Oj*5fl<K*f(J&aJ-&%J(%6sBl2r
zILDUsUiuQ(COUaMjfC8>2F`2#OZlN0w{U>h)zRbbh~E>SmBO>0$1dMvhSDZVPE>8T
z=1p)BWUxYc!k0!b?!r|_G#yjL$s5hj+kg}s)JMxNKrOuaVSu7fV=1nU<--qcnrJQn
z`tUU^F{>!Wv<KK#$*#03{`v6?Mo1w5Is=GlsY>m4u(z3`6EK}Osrm?D32GN+CQ}|=
zreYk9GtXSo`OMzL4j|ljfpq7{W1V{`TC~n=RKKvp{4~^uf;m@yfrDjF3>jrSEu~yL
zZg8t^7?-vNu~@^mrGG5?*zE$e;G!pF-gZM@>i`9$3c#~b0E|h_+@E`0+uW_)hr!h7
zaZ;5sx|~Bs_{5M=3B-Ajk*H*=-_~xL{>C@OaPg`{-&HzLiMP7deerY(EJO#X1gI;4
zq1&sDds0O4*oX9n$-TUani~0r@oIAwth?6Xss(NIU|c5Lno6={%bePnk+uNqAk)@_
zjIQt8cp!`~-9=m1B$M8MwuZNmner9>N$-B{clQGp;S&@{zsqK1tenzmi<jFOP4^PM
zmXjeLmcjL$tJfssi+ouheHFu12@Z#KEq%%FLX$rwTvJ4v>WF_aitHjYQUl)kC;R@K
zBNf%dN}Kwn$w%D#Tfi`Ex)n+nOt~}He>F{t2TXeE1(pE3MMs(jn5AnEEZHO4Z5>d-
z+J8W5hOf_}Yf!zg2s6gUqmf!Hf&AEQL~F#u)PtqCDu|^<<<LtvTpqqz&rHL@-t+zB
zjhL_c_V`UlbpAhQ7qYMM53SM95?b`O6cYpLL&AKO46CRax8K_-gITpDHLF3kHu;-w
zrw_jU9UrYkHSf{evzlLpOweJJlKyR#M4}^#V7FION9X4Bh??hy&ti10k{$L#GLdzT
zuFLeWyseT@MhNtC-q?#<`>8nwvN<%1Hf@bTOw>jiVdlU$)1M0LLwW(5wGloXTtU_E
z8PlkkKeK%#&2XC*V_)6T*3*KmTRUa>Q0TOokYq@ExwjbhFdOz>W_d1C7XBHReQu&^
zKNF?+Zp~mdySR)GkXm06d+8cuft+6DfBvq51cqNx`0MzheFjr93mC2DuwsI>Ve)hC
zdV}`u0jij^BojYK_WOp}jvCEBisAcHaRZ6|w*b^(o_ObWzHwjaTGCFBrWHf+X7>^!
zfMD?Uua1=|wZO;u@IGc3!bA`ERGIx#r%|^^$i6R0sKy}chf;1aZA1OgVq_D1rYbY>
ze*MBWySPlF$`rCP#aRUwkCvAX@I$qn+jXYE2<e{(=agKEpH4;T3=CgJIe`5|Qss2#
z@^ttL@+PwLIq69F4jpEyR(s!jxfEi(IC-=RfBwdge@a5SP3onz@n@DoA-c|iwD}V2
zGGm*&kV+fB#4Qfir1I#xU@opQq(mH{SomIj2YoxWODZemDBKye6E=t!OL?^Qt~^GQ
zJjVzFEPTHF4y4tqgrtSOGL83PXp#){a;T{|C13TUh#nE&?`47%O~9*@0&o+XYd4Z;
ziT>!7+hCvP>o)(hb9p&!PCTX|f{XQTGN2obQTW5%ay%Tjga+Cat|nObUM&FYb#1>Y
z0JM;2xG02j>&Gy@D~yiE?=oR2r8mfU3G)jSw)UCup)z?YMrI?AuwrgKc`_M_ZB7I{
zUb1Z2HZwcrn$pvgKg~rjlj1MU^?nn0NF~=Sel%%*&M#hnfsYdPs>xu&4q+wwy6TWl
zaKKH-I1(f+-Bk^VNj%%L47tX~lhDZ)x3+><il>HPsK9~@{j~<x_Q(jUB#<p7)*owr
zRuJPqjP58nutPN`Bu7?eF*mf2Drz%YOozi`Ux>HwT)n5v!VRT$Pg-UaLkS5%phkhw
zqCJagHcj5^RuLE23;|}ff-e!E2h%DA+kA3QM8ljdoA1Ht^KJ2pD{h8}`vTjPaEU<Y
z1h0TUp)Iz?z5F<r&Hvh!z~VN%{~G`2br8sEp9LDGOMXA<8Ox7nU|}-yVD)*a23EmJ
zlqZ7-0owDapU}sfW2*KJk!HYVv2)#3@|vZ>aof9Tc9c7D#$+MaqG(Y9xRrH`TO+=6
zo)u%Y+kTbmP;|J=o;N==EA$7Qg!BfVkn6*9rKHd%pf~0XO=|u%!XRV@O5iMRpBCLn
zD`A{DhZ{)WMckyY7S?jHg<3pL>VQpo`o(57Sv>gtg)p?Y8tt>Z*I$kEHIZIEiZ0e+
zQj8ca4-w2;^1GcdtCV6k6#?Dh-Ge!Xb{42sBJ8wt+XhhXkwEN(#Am+$IW8S9(u#Qd
zGWF0wNY<`2YW4NzOD}57DnG5I>S4>7yynA*MUCFO3IrwO@4x)}`_Gy;afrHm2Ak%q
z(9Js(s$LoIJW6Jf91?9C=IX{M4KeIIdE^r5#2q9#)=DFaXk;GMU+qvueaX4Q+E?Az
z)W~hc)k;;neale?vE9xQ+ac!qQ1(P^waSL+GQunI^d+zlBKlXwI1LdO4;&-vh~??z
z?#osQK5hc2cns2X2hRU~`AKSuBiD&t=Vv6b#@F{hTLd@=>S70_o^su(fP7s6EyMS~
zJ0myMS+q3deyz2ws8N~J(HGk>n%E=S`f;tR2C~(I0J1^&6G7y-wf;P1v>$r-<wu|`
zC%*z1W`VuyZZAtbe}rU~ezwS?>bq9jY_Dq1D~|D+s}Px(Ostw<y{$xvzG5-ZZ{%{1
zsYXHkZc=|w7Ix@MoOS9uxEru8PR`r$KQNmsV7#6WonvDK-fv(mgSKnRrF3K&m^A%Q
ziweFC{|yFFj~jM;_!U_)sXg+?p}MWOJszRXR=t}sMVki*<|Bw81!43<57<~9c9F>G
z{{85KWIXc&C6po3u#qcoVaUQoV%9S?-{$9|9)^%--gH#+!b}M>V#b0uAA;5~TiGr^
z%^W*sSZYh3NmS>p&F8I73f0a=iWP+ah<0Cb3(WfZyn5O8t?47B+>~#$2m+7Zpwdu@
zHN*-W3N(oZi;7BS3$Vy)nSwzeAd5&J0+mHgCMje^hWx_$4`?h!2lV;lJ(?jAVuBB{
z8IfWle2>2hmw*4+OvBOA=BaYf(xt^H03=#UUA}AFC?x!ZzQyL`RDV+(UOjSZ7k<uG
zhV}YH*5<7YuJG);T5RPLy3qz%xH+#mAgYFS&@zl{ql55&dJ2GAqvNF=oJ%k#u`{&r
zOLRSQrB-r2)HY~-*bEm1oy!JpT?8PRv$q+&cFpngc1-ePH#Ph0T(kcSMKGJiAj@5|
zTo{SP@IIsk4r!1Ywc1fpd^y;*)jwwAvVKuTg!Y+S*HYoM7?*UVov}RcqX6H(+YJMX
zn>2+Qa4H&jy$wWsOD6iC^-~Wgp`=GUTekq5jED*Ojy7#gb`0}!1aA^}Z`LC6>*2K|
z{SlKVOPLV4wvCJ(i!FfsQdF~Vrp3^9x{LGgAx(03wOrsV0s`PKfxRD!#3ul4Q+*@$
zwM-ac(hsB`kw8K~s=2?T`Zxk0ok?JEm$|;{Rr6l^#hZnE?la4!DULhtYIN*A4!gYZ
zX`hNgh0?KICfwzb1e$xo!YYB3aI~3zfqa-0GK8$jNwyc*EP@~YAp%(!-W`Z;b_4%?
zMZ_)7-OP^DkA#TJZyFdeU%D`SK&^`C(-MgQT(|GvP-3ybwaQ7UxYRe)RW57lAKL7+
z=U&+3;_AFk&l=f7sZv+S-{66`S?<Xf=F(NJvxUsKD<DD04V;ilY<Ra^+c@T$F@B}2
z=uN=L^k(|FiVn2sjkgHtIWqH!tja>{yMpNw-;;Vm>Yk51k<W!NM)*kqaKW_@QY!a#
z|4{l-wTa9TLpjIQ3ui5uXr(4FLXz7xr=rg|9J1hhpb1-iP*0<9C#)4rk}iBt11;r4
z0iU2+ztwRrsxB__!#bNSX|?ryGI<q@3FaSI(TtT!qnX+5KIrW|+WD_A1w;}Q7#U0@
zMK!(Rzi8unF}}_zhIhr$Kq1FcBgkNqD{8l-3CNQN(!(s1Uxc0J?>p>+NR>XmE2-6N
zb2Gs-NX>HpY5pcrV+qL>)>|fr=|_Vv<{i&q_0U+nCXkFiJC`*bpzY8K!**?wQV%!j
zPt8b=mU1Vm<?CH7mm}$fgR8e|_;qW$s${Q87Xl#7^N8IgAm}ncH#ouClJFRUkA<{O
zR)qy8t%i;B3wXzv(dG7DeFa~d)6MI!J8U7z`rX%j>*WaZKv=WqEW=Tww9J8*yeY!v
z@Cm1c6adBv0R=Q$(q|kVR0^OZ1Lz*vpG2DeaqlJ(01VM2KrKRZmkt>Qf>6g3BBZ8(
zssU;k&?mb@bNWaWf(%rxI{9L32Gj+KncU2(@*zjQSD#EE&QuzOuv~P}c^gWzb~tB<
ze!{nc9+XG`mv2{U4+tqBz&x<{X%|Ox+PyC%@sHbd2~6AUARCs_9~SD(=DjmSA8JjL
zwPSs;EDv{m=3aVAB^8VC^@DI{_k>xZzC6oQ7MjQ%Lg!LEjnLZj8{4V`N}*PR_Zn&y
zQpIEE&fEH>u$Pc`wPCVqTBcPT&460O_x!hKz96Q!S9SGi1wbgRZ$0$}r#%K%)ug_S
z9kDBwsq|)BDx%!W(J6Cazib~cH6&9NMFDI2{s%r3B5Qa0_~q6gEzaM01Q)tZsBR?P
z^P(?4f3@ez5-dDNv=bXyL}<iCL1!A(5yBR8N$9jG<cvp>h(&;;Wx_0=9Dl4wR`<^i
zs~9!-wd)lk8zu+LGvU1EerA5;m}GZ`oD@V+7H3Z97b0e++>*t&lM}zT^Sbd1$;fLx
zUuk|f!o6lW{H`Gb%|VLAVW#r;tm}hkzrw-?r?uz(nd{Zo{Y}HrBnPDbu&Iyk5Wu84
z-RLlpu^Il^&CwT|rLZj^+B0VK+$r=E8n&k;hDoM!6;-M+wDgemu(QFJe*QnT(^dxj
z4^M}2qm5A`0W&NGQPQEsejUR%FsZ2&u*>Wz5xxEEDi(1+qR?HY%{#{`L?2)_Z&XDT
zIyp4LBw#FB6Ij35e+(EA6+^$y0?8by-;jU2h3Dg)NW82ov5)}7HzRrR`1xazCULw#
z;1wo+_G{{v{-M(F5E56LZBfdg#P)vMN3(FB^zZTG_X#iV>Wv#_XEhc_W6zDpG~t)1
z>zXgn#eZV;1%P-nO5;Ava^JT#N*BJ+>g@+Wr^wzXzVa7eP@{DgSU#Y-{TJ&;1oTVs
zslGnYiuqi1_6uASt|Xi4q(W;|$qt}v7WjP2h)q(SwghB_2AF*%K0^-zU5%3h0E|H5
zrVRkAJoO$FkO-@}LyZpU{&-b9s!GIlk@*O>?yJLKht^!Oxc%4<c=x^BT2?&ris{h1
zGCMkdL;G_J6NxF=*`e;vrKWqIy36RMovg;8Fp^?on}dv_P{UpP^4`743>3^&-Vp<A
zswe#`OC_;@#=Kzg5`8YxJ5@}bCNoXx*8&Xd5<pUP${T=ZLAF{HW~4Lu*q;Lqt`1q(
zQC=*J<3msg$~j*2dj;(ZwCF3zWH$3@t)aYd&(NKaoFlHq1Mo-z&*9b5dab~2XmzJZ
zXzd3B%?~4uAW0{)j#I$&Z#CBms0DrRtE5rRB|8-bl*ykGyAKH6NG`x!a0h^Eu{U3V
zC*&=>!fN#vIfU!3{qajl-H<6T^q!;u=&XgaOtDA+_SRj{#q=y@;rfD?c<<DP6B{xU
z==mn_^k?vzyOT&dBLKQ|nDJVQCE&=}Sih~_{p2#2`$wcMOZRU#t4-vHXM-z_8^!YZ
z3u@)8-vwJh2l=(T_8sNz+(4jkm!s+Otyj)d{@@4Gm8bcmR%??dzw1?k>(CpN!KRPh
z0oF|SdAG17n>rxNh4z2UGx-(yAnH#^Z-x>Y9gXis$_tP_?HtMIbx8!lfnV2TBwzg_
zxPk}<j9*2UFZ6T&7WcpDq{5IoH@a;0e7u$Uhd&q;sa}}cUwouA^;~t!-S@GZT{LZZ
zcARO07y=YQ*@6|uN3JG-NYPYlsH)=E{MWFo8$ffmA*}a^^5{4UNTUawyq-F&O_;LB
zU31?E$?N5zQ~xj}{r;FnGaVV=d`)*<aX976Dn0dQ>FLW~)A6a?iW9PL5?_HixAN-M
z0z-fo>;d!%sU#m37(WiQ13(0Tm6!Ywp#OKtf4|~#{kpAU@gM49buapec3d#my@C@<
z{c=3!^6U7Hm+F^58}jRl@hP3#dUz+Izq~!vFT}4m{+mePZ~ljFG2PBRFC5#P_QFTb
zE<iqu9_Y&LWRpFD%oVNuY1-0SKx#oG)MXNVv94Qpm}QoE8_DJ2HfV5`4A;8xe})Xk
z+y+SO!DFxYr<-Zmj1BW+=1NxUPDNJ$f=IMYJbbNl=3ybr^FIkCorHYF#(ND((*Qdr
zgG2B8m4Ahd)dG0i^PKi}?0*n=FKpK5^3O;PTxu!|B9Ld>5jho9@oUn5u6)E{IGey}
z>qct}MLyB?Td^utZl;G@bF}KpFT^@~2rUUh3TI%cd+j^YS*S745J-@ykRl2JC{xd{
z&L9r2lmB2?3PibK5P!Dn)#E*|kVRwk$LS`h5m3MJGV6an>!D3+L6f=3J+^Unyy(8>
zC1J+`i`Ne!$}E&0G($@k1}UEXa5_2HF0CF4@!0%UI?=*A-_il}xxSsdJzyZ6TeER4
zDv?qLz)%0lU=w(f7a)L;KT({W_BIuD6ZW6kMxlGfV9_+u9RBhH8?=~8i*ujHZjleR
z<a@;9oI03zWS6zY!5#DLc_b^50eE7@Ra;}@Z$;!?I+nwmIg;7+uAZv#m>QV5w0_xs
zqfJDQ4bc7t$on^ed3aXj067v#3N7`>eU_&Siv{Tuw&4?^0Vp5(6jh*`gh9Fp*^s$E
zSkmduKG=Vgp_H0!%fIwj%xG8_>w(?R)Qz#}U4cq4$kdvBKWN5TF&FM5p#(CDNtH__
zeMq8KCx7@lb@{;%NN`b4b$$6edQ`6YE)Sc+nM&^%7;u-}uky89Qm4`iuA8$4{7XKl
z$MJhQU8T`f%8Sl)2q#>!55~-8JvzRl3(i4~ZF$Ky-&{vsA&!%_!OM*088OO~)PLh?
z#gwhPF59cdk1-fAwn!jcm@h{*B*XXmcQH*Fvp$!2Z!*6xu3%0ttW;2n|8aKrKRYpA
z(yx58DxaM~ItG@2I{+<2G5Im?ORAYUj(ofAQ1=$l%+NZXsXozc{qi^A9AM6F07zDE
zI2>5ESbpS?$@LOw<?y0!xABw7mHZAOXF=^V<4bo8-=H$dM~=aQn?P|zt^Tb2aoC!s
zqtMMBEVdYnSl~LAl0jkS?0`n#8Y1Y0?+vFvJG@7kc$?PS;vf^i$!MzEK(f}bJVBb>
zR+<erm-L^2(7BPrwNPZ{9QRA#j@&pn$RYbOMMccaamVN*%z8ch_$w!8<j}&sYt&}y
zcxPuLP&D|Qm1R(!TB&;@fYTdk3cibDJiV5ph%P@Ry>E7q`N8-_AL!*~is46$b7_r7
zWV%W2>M&K85W3j1D;64D!VOgmRuOGDq0>g$d4iS-_kRp^bhBPnI`By<%j}b;!z#(r
zL$l!q&U(EnmDu`W(UqjkKQU7`U`p0=jm139dG~7)4}g%iOL?%o4G2PZnS-U%Kv@x%
z!@wt>w6P;V5m$7TfA!|Bzc@r>;x7>#*5KV>!W+I*(Ltb4=Y4ocj)I6^t7mh+W=K5J
zY*4Q<5)s$3hiIym*;BbmCOC)O(?WD)+8pKD5|X3C2_pXrvUsCzi$E1jI-pvGI48K2
zrkB2FQTMGn>a=3ib(p>Y;uJBw+zhE=!x_zRG&xCG+4q?x&{EQ|g(%r@*-S;0XlNB&
z1hNFXZqAA&Ojs~mGqIS8=V7L{Cj;o8z-wvYPN=p-i3w?;sKB5_gdLelRCg_M&pOJS
z#_JIn5NNIWK;SIPb>}upI;_8Ksa(!o=D+vJ$vIoz?r7(Q{=9r`-1`X5^v-(AH&l1>
zip=bp`DW+Wlp_u*`oH{#v!P3B!%j6n3}2q5?7c+vA8e9Gk&Jsb*8+OI4tM4suKi6u
zhSRTS1W&)8(vfq^LyGb2t=5`G;(cRKV{NVh5W!DF@$v>eyQdi4jLBD=3Z|!xK=&3l
zMO|buTJ2jg5S1!TLy*lQjsejuAG|}Qf;DyPmcL`KE&TpjmV~n%R2s$z)k66suiE?6
zSY~?c{vr5?oyp_J^6*@kjkX^at?+!a>Vmb+Mv<HCV9pdkf^q={(Ub>}Yh5zNBis8X
ztTE()l!s?(bAj2T1~---==zbl={L&6iL`8+8K#Wko44-q*TMV?=Gz#G<pRi%Xn7vX
zv^*9?Z1C4no7{FEhEg^t>L$YCT0UBxTifRK8Lk2gU!4IUO9sNIr(TWeI$FZe%)@xc
z<>z16DHMp%0VV6HOC{e4w1@K~j7VhAZ^^4?BJ>3y<NE1e*7fVnBMS)JKAk*WiFX2^
z+Ce>y69LWCBf`}S#(yR|Q9!8->K>|<qr<Zz{iv}4>oti8u}{-cPPjEJDdlOXbY8V?
zmm_XZ3gY)(W11C`oCTyT?VZ1={P|nOJIC8r$)v40m>oDPuFBXi*0Q=<3X>L4wF(yE
zSTD|hW-)uLEay_F2LGQ;^eKvZG`jBX|HnUE<>v9W*8vU4mGP1#_3QJH;iFdNH{Hcn
z$<Gmh`o=NQqU~`S+N$G*Tx(vg=a7rd--rripayo}v&~s30SA|<96V(N-~tiDx#dfL
zg&mJ}<|#};?p`#$V1>(pj>MMgJsp{KzTB`PQnD~Jcfu@9q|^-#DR;ASAmCnn4y<{m
z+-bM4y{e5U0o^1x&Rg4@KP8|Z+}kQ_cctb=zn|J2r-B!wNJBEjd|$$7a-=A-xB5FB
zjzk~NH#;Lj^#r>kikDYGU4CXMCUxk8QIxzU5^N9Jz5K7`w!%4<oNyG*q;*af=iD#d
zaIWuu@qSO_6^O7bmFD$OwqwE>?7*!+2)`DKmw0OeOU5mjdl)`rz%8261<1r3yvwIv
zZ1{PP(yvAC!bkWk$O?}77Y1o~DxsRr{w2@<Fbpxff$-buHMmx*G7H~5u%uOqXK208
z{Gw)aLE6b}H&`YRvF1`Rk2yiS?y0m_`nzk<fAIXft}~VBT*upLQDJzg8<taku~YtU
z<pZO+(VIq+u8K>1DDK#9E)QVn#cVBh1m_5B92m?w0W)Lf*Y3Ig4#E4!eb+^;w+=JH
zNeh(=<9ADS?k0{$$`X3^PYo-cYq#I^gg-j9hdqs#3;A4X{WK~Y8)aAC@mikLn#)`B
zOSzR^V6HsVj5mg#cU4RaIj%1eXtn&0kt?V9w|JsNq7g^3*>4&fa-#gYYA!=3^3dyV
z7w<;J8rf1EcIS0&Jj3|gn{Mqd%kB*p(-Gx|?O!?gOIe5PFk%!Z6SKAc=wpb#^>Hp5
zgV?cTNWZZshfhSNV=JIVV^MUL<71hgJZMQoB(E$QA^o<vTodb=23T;&Y;N^P5(ly+
zpEXDd03DSJ#Gq$+iSB5h<ZJRQUpyi3ZG9K_%uiUsp#D8|iOQEHu{djBqlA;KWd5!A
zuX7HsAqJ!7hx#n*&|+0;V)~2aOw;W+_Ud|#59+3xZR~#CjwY`N_KN32A>y}Sy&4B*
z7xYwgYBXRTxm(5o8n5xCYJR~!9QPgkIT*H~-D`&9aoM`7fN$2nIn8)$SZ_O+KPEWc
z&zok$OP#!+S8;VEng?$$b1(ioer|c1!10}ksr+}rp$cKOis9?xfxsiFNMs0_3-Hlh
zR*1|7%|j{=Cug5sIP9AicLi3Qv51?4#Wz#rJ|vw0++s+9c>O-gz{J~Al53_3W;Ei?
zM{nb2A3uJyh>)tMral4SaI$K2Y=@@$%WOcu4?(Cakv4U-Rek)Z8VU)L^!8oNSnhrt
zPi7FnCcbm@vsgs=#}GRaJ#E+A8aMRkU&%&_q%W^_pyE1KexkjFKdedYrAsM38-^C#
z)Ltl*uDRn}2<kWsq>RF9fv*u;W~?DoG4J{*gr`*1eZ%qix?DTxDXW$pHFYDBY+eDu
z{Qy{x!|jm<gP&<CJUUT&I_&hp5+y6lWI+Zb@mPHx6Q0d+d~6p)`Vs~;Tp90w9_IU#
zOQ|~~-Kl}j_CI5T`kFb@ko9`A_~;u>qn-y?8*m110O08xQNjBHATK}~j=k(cFl`Z;
z7-_!fGHca1%EKt28$v^9pq$xl^CB`r)E<wr_h!J9JQ9N&H8ikx!$?z^U7V9mNIR@I
zI$afXafW%~5W!zB)Q%;?)p3^Vu(z;R2xH4JzOl18=uXpEO`$fmYr`2k*t$CkL|kJz
z`Q*(<RK1cItlTr|j~FfeuC2MjSK5g_jppaOh9hdGZUSE;gKAv!)+imB+AX1uv^rF6
znBioY71&4d-p&xnv62N<Se)Ic==ZKp#c;Ae$UamUio7-8km*f!l*rTdcE3CnQdT>n
z7f9yEZd5#=HC!i_QXlv}vYBNyBBv<!a~K?N4e9-Lr{5nDwGt%S{*V!KEAnhFjCSMC
zPjY*{&+EV{;r18+*kdn&1}U+Wgf}<;r=lB^DDmEA&ewl7iaiGY*EKtyEHRCr777u1
zoZYf{Kejh&t*c240yjU;v&TDV`?W{38RG=%j$@Wr`v}KMRf;;B=obhM{cTFmAGz@i
z`urw({2j}xX#xHr@6G42=Uj*RH&t8d6O}>Eqi}BBsaI>FW4C+0{8c5k*A>x+)9SjY
zk9^w;YdlX`igt9Yqt-T%{mMEE(vS8sYQvcIj>g(*es)y<pq#&-H8|~Yr3-Nccb20b
zxSQkd;~reT>W0a9(#!}6#ovvzSuCbrNb;|0JqV<&cR0upZ&3B9ZJoK1Y6CZB#e>_B
z-I%^u>t7Puo)@W<M=BILVqrKr<oto^M*A9}<|Q39cdRmqdLtfI9hXbEL(Q4il)Bau
zd#*aiP{w$jDiapCxn=5}LEmZvXZzX?&yn?LhG`fTs`?8=8$L&R5ImgWdfY<6wVchJ
zqiX{}_(`O`z4^-s^oY$76F`NkGDI$#!}_kChg0qw#%Tu0tr}z@7S=G0081+~rV^@c
zs5iOr-y&|0h}FHMBwm&so*>QX-O{9(z(80NA;p36z*TRJ#{1vE8GoZ_Pm_yB5E)uH
z{Y@6ikUnBHP}p&`FY>?H87I$%f0ad8l3v1DgL4#HzesUwyPpHXI?~y@$+J=O#J-0t
ztGh<UGO2Lx&5J+na;Ew>1)Xa^z7yqN8W;q<iX<k&7_m7_pOdglPS%8aupKUzCSQW+
z;6F8eQ2V4zPMgV@x`fQSvd3|aV%<6B$#Q-yDT-U9UMr0t@38=ic1<Svt0_H;ADdYW
zOF44|_8!_(kI&X2o5}k6ef)(Wb)=aAqI2F4m;YVn*1qQY-C1cbWZBKy28MVJVVoXB
z{*RZYa&lKe9Q3c_{O`N}$MB`=c>(%&q{vWIHM*I}m$gygK?qZxSW}uSsH8myD}lFn
zZZC}-yZ8o~7_?IaAlogzo<tN?1Wd@ng<n2|MTm;3m3_M8h-0pjIcZmcgl<kRxvJPw
zR(MKH@%}<>tXwjJoY;)x>+rY=&L$<OJ0};~Z^W`;5{BA8(XI>9#sG8ViVzS;qm_wz
ziv`x^=xRa@UfqiyJ1~f$7r%HKCH!v+6Qys!-eG87?0o`t%!=0S=~v;Hp$(??c%Z}b
zcO>8?8E#m{dsS9FN6Kf9t1O&Aipd<^jCld}d0Z`VCsfUB9OVRB$Qws1N~;TQ=;=wd
zri+&CebopY>cczote!=u49kt0<?$Qqpty2-S?8#e?NLn)#b_7|K%3=#55Ni4#ay<X
zk+y3--csJj>_5y}mhf0k|H}r=_1mERGZ*X6SX$zryK*Q_egCTk@ULs#U?@N_iOF=e
zBh{{#mnL;iUThIy#NF_9n{Mr|k5L~k>)B?nuEyyeNyO}<X98qgtg~R?C>(jDtB`-;
z^3d8l3t?CLz)eXgnrpsy96F(Pn33M6L{6-<^F-<DYGbW4$<ECMDkSA-25t6|+_$M|
z?$7Bs0F4?1dMWb@crN;Z8qeqW<_~_u){X^cjC-0xhdLQi&Q?Id{M*$5x7yQH#a%T9
zi{?bB0SD$h%;N>Xkt>`t(BDI7B@Wqyb~l&mRUK>HRi>HXDi~?4BZR*kPB*Oh@7sV-
z|DBz|QL-JBzP-5SO>}yKyoy!gdUZE#OTn+m(wf=A^<nILyiFly;o|!%-)i1g7KK&d
zJ*44HJeZfpuR^g2@jdS1j=9>K`q^#dLn;)cy<m@Y2^ewQfW(BHkavvTb9?rRsVZrn
zj(sazo=*PbdMZ&!(nXO!hRzdRbEZjSJ=PQZgWt&HAyR*8={%`XKt;!@&Z)C;3ekX*
zgX}Is%$b$|1@MSVM!IsgZ1Kh|at*JA&lfqFz1S;{hDE3=H<SMGBS**fZ7eUU7U(2Q
zXR2*1kC7Q_d*4t#nF5Bk^A=E(>i<vvxn;wXP5%{Eh;68uqL}j*5W^ctGVcBaEFV1p
z6cUvn;bcY7ifEIMTClw;h;C7%A~n7sbw9Y$J9jI?0&*TL$FFW`(2JXR!&e34Mj1ll
zge$?-D4mQ|RI&9e|NH>j=xi;%TE7LZJhq}+AJN{FUMrcm08I$iN(=x8xR|DDRayuf
zd8EyD#4P#$SUT@`s^9<rAL~taWfVeG_9&4}IFvn(b#TbuWQ1c^WREh+I5_69_sS|o
zk?oMZ9S*Vy;dl9det+n{ZjE!!>s;6K`FPy#B{wpjlu5VA)E~}5u<o~`%+~ye0Xhe|
zM#5+<pRBJ+KL*@59l2ac2)6*%fQ$}sHklKl;UPL)Xh~W>AidccG_xb(Rx~MdHoGYj
zO8D}bAVFL>2@zmi=REF-P#e-_qVicFqF$zH0?pvvkJT^<xIs@+HBoW2=f?g2v_q6K
zH!-F9I%|!)G52|+?F?FHK*5Cn3m?vA2(5dW9<3dpGhn5pk^E%0bYQHrAPO|Ow3e1H
ze3n2jM=6|!5URzWJ~fRoem@jTE=<DVkX%P`@35Rezr((rt7EaoS<&zSP8xr%ImA_5
z1goNM=Z{mJx726Ul&8E!@4gox^8g_<YG5woZfeMsZ4xj<3*$TBEq?r=KF2c4DvHr;
zo&d^Z=~Z5jQhY5>aZ68q(ZGk-zLY4+l#!NO#3ox%AOx`ODw>)0oPS7#TFxz8l0dFr
zYVbdzEd&Uejh8#-IUw>!a^6Y^9mp*zEy4`8eBS;$v)GC?lgG|GK1D}$Cs4sS14efW
zo8jK<UsxG&n~Ee!sQ!D}%MYbFJ$kGrxDQ5E9X0DHkWTk<y4}||f4^}ZzsFMr=3Ry|
zJ3nY)Bw=aIFTUgm{ItOlXSb+K+5uF4#F2?P<Ca}0hoUx5zyr~=e!QA%$-b;^+~(<h
z2zLm&oJXILP=ByO**ofWvE+6h{h{)P(bC^+)|H@FTP2q(>x0V5h69~N<K}k%0-IK9
zL%!20sPr$=&?eCD4mF2>Wj`-*l>BDoQfC(_oa>q3M{Ii0*HAY$GFKwiLHpKsOk$lb
z-U}jWPTl)e-rl~MED?^e)AeF}Eo!80=O;hVuew*OGs40@)@k_uCvTum2DTcFjpa83
zg{4D^K!uD%yY_2>^~Q`vT;}Se0P2(0;H&qVJk3c(U#$cb==I%ai9r<7G^K+gmqdG)
zy;x!V+A{(UF7OcwB4kJX4PoIfHl%_CrQNa}dxpL{u-U7OmcP!eXixT|P=Mc4?Nbc^
z3ksl^Q*0976ZHr)Z3M!i+?gf+OUn7=FJ=o!%!<NR4d-LyTu&neof*qCQ=2e1d0Ube
zfqUvX%fz7=#0H^PT%Xw|V^dB7K3A$!Z`qU=_#uN}XdUH*h1Y$%$)x*1mmlm&rU#us
zuab7l4zUC@WVb-Eo$Qw14A=1`0VuABvx@JH|MBxy+ea@IyCMv>EqkmMvB5+=O>eEj
z{37dPzN4{sixo4F^)Pd>GZy$@qqPB+v*14gp`NdV%1C<VNWw1L6)+4WO29GDq~Aa{
znU2th1n6Yg+;@k?6KXSsl?q2a?Inbq)am)?#tUZN8P8vqIXEDOJlUQ@$w9rDL)j0x
z6W+M)LAcrEi<iTr#*{`cmqhhahqcQ+x>rlN*~Y|nyT89mQ6Ge!l~cV$%-4n;N}LtX
z89n%K=cz<@-s-=CZ@rvHU$uBJlON<Ua&>Q?^-z>5ym?1&#<<~Gu52*SK@L=SMM$<o
zDf-M#vZT=s+m(J3%Zip&N&G%6^($KQI*CU>xc41Rd9YB&@U<2Z^xgypE!@k|!w|ym
za&o#*5pBCf07&{Gk^EMp@A*zk1W$#klB5V{G~@+7FlzKaZu;!P19FNObzaa=tGnft
zl00Sx>a1?;x`@QJW{*pccb=!R5ujWd0@fpMz=Wvd+ze1t<>gVqWJw<$?Y|H!>rs?;
zGlG}deT!@goN|gnM)Lx(4m;o>p4Tnki$#wx4E!R$!9Wu*<!;SR%KvIH?`y%{5Hyq|
zU{h`5&hjgb=HvJOWOgt&!6ontF2{8h@Ey7+^)AFgbwajQI(1hCX-F(!6&$qhl=-v|
z?s>=S0(5>Ey8h^P0-t0YAHCX-YC9_oG01JbIWpOofHE35{(XkETM|**=Fo<#(BCRZ
z%I0kX@DPT~=%{cC-Gzzg<^u2JC*lci!?~oRDT7|P2gbDsGYcsh?Nfv3rD&RwP_QbU
zFkyb^8wMv)>#fgC`%MKi!x_G_$ZZM2Vx>EXvPpW+ny5BHkAyD~w>OMy2R^2@XWbAA
z>s&o8@wMhpYMxeCQ#DBKY~K%mr2Y~|Wt<=JWP@AxYO%Z~vRTu3);~uIG5x(4-*`C)
zx+YJuFeV1w;g4iDrn`~<n16mO`4_+^+5-PnBRzIg&93`x2>C4s+FHQpHm^wW<fX|{
zpy8M!sv6h1rqZ&pV!B2^3SP5WDN!W&tBz{4lw&A7tnvtz<153zBGC*XdhxvTrn24b
zY$c43AEXU)XTT=IZy187d=Wa)9)v;!AH5R0p|K93g|6m#-M>#?wsh^Vpv>&!Ub7!M
zqzWWU>Q1}&?-AxB)XLhiYsH#O@!IdtCcWRMMxn=7t}iTiuV>udQ15Yg(CDXlknIN7
z*Gv;rNkoy;%Mueup0XD*{9xb~Gg&qS#X7QskJ>IMOI0$uGT#@0bkw6)WVf%^31AV_
zx|W@k+~95t1`$_BS**Ki6iE!RYDSTOHgO1$3d)5@&!$tDZFuWGFyRAFyp+B;E=w9=
zu^R(XErDiD_LVupjwdi$hcl<{(?($l#__ReVs^p^&@Umq0%&%MWJGJe!pQ1&d_)S8
z(Y03EM^R-G^i<yOt#5FBxf*^UcEjxP#N5=&h398w6+)+x!{C7gNs>^U{c0e9=IvSR
z8sNz;GSF#N33!0r2eZKs;?197U5>XPJ!h^@m%o?<BZ5BQh~&VzlzcDd+{Ci7;Dx7E
zML$lPYK5!n9q+uP#mAlsnEa39v=J<5m{^|ind>}ienr$Z!pWN5Fnda8QL7-My3Nw6
zZA!dfx3g15UY9c?-`b$f=^@PkV;{?5npDmH*ppS>yD)a)nEsa~Bw+UyC@+2JGU`7k
zW<H1t-a%a?`{Djb1+(D}T4_MK&KLp}d<;|~z7;Lsr5U5}`qCTdn|}voekC46KJz^%
ze`d=cx1DQqL+cvV1gfYC8@@q^l@1_$3amm?EeUWT;^6V{TIw=TdXxy>#o`&6S8PHT
zr&nH@7k8(8eH@p>n7BdbMzt0y!%qG1aJKLpUi+wyv|8`0(=Nw$DZd%BqfEH>{2=)u
z?hmt7t~)R`MF;94o@@tlb{X;=gqyr0+h^F497vag1y3eXzBZEl4;&M}><kb-oOU3I
zKAi_APG{5W{tS&jepcUNM_Mv=5l13qITD0!$q1pjm;{%?hKz<Tm#r0gKakQnxUg&2
zmcB9>|NHWUTt3A2W!k$e1FNA=PuBeC*S)3Nwj0o<UCpLapV@T=CP9gQzFcOz13+<J
z17T0$-qg9t-o|jAi>5Q|6=mTI*O1xEiC)!8#rfrAHXtwxw{S6GmfK`Whq*Gvbr|X<
zJ86c)WfhCy3Vw5sS>n+#ALXfU{Ra+8yAy=aL%5k(ZX5r91e^)|hNfaucEZGqK?S=}
z^Fued+@~kQco@rA=W7-USqDew9R7Ak^ae6C4wrm<qts8*T)E;oF#RpxsRRLKH*hrg
z;zvHP&kc5h*1H!!${TXL|BZb2V*~VbLSa_$E15mdU%fE&ViiAix~|Pw9UvG*dOj=9
zVcn2nE~#Cn<3)t;tY;_@(IyNy{K9gG*S;8?@xXiZ;_(>{hwD^oYG#T=8OZcBf!Gf>
zMC;*ZX;HP$U5<Y&I8Q!}`sKXR;xS{fUmtQK+b=u{)aJGdTw~fE9WCpzAs0sQ`T++@
zT9A$~fy=jNH0OR*@n-I>Mh0e=kgDq;)@(q|<1_6!A5Wf5mgHOt(4(>ade3J<Zas!)
z7bV{7OERpMhbpQylnD^z;=Ac0mc@|w1+?>Y)UMe-<_B+>qC<!tSOk&4S%eUcMH+U%
z-x|dWe;tK@@}Ue9oj@mv>CID_OXb<;t%j%^CJ3@Fko>qlmA{<{ULv0;iDfc5X(~?&
z57JD|uGWQo-<9hCpHHA63DER1wO?y^T_q`$Ct0m*reknpUZnTsk2PX%)ZmU)_h-B&
zq3le-soC~5Mf3Dn!8LM^$quv%TglA_p=kO;!Qq?3WWt2l_w@fVsw4KE?(lQ*Y!uq4
zVuzW%tC3GBZ#Dfk;7fSW?<j5vL@7!k&f6L`5vaa*z)0&YXt4<fCj{14AQd9+vLxd7
zuo&rbc*(|Z?K0dhcr!vEjNFsYuSEzf)&Gj*lFXSJq^6*2(jdqseZ3`q=(zMdgHn?c
z6to#<<geY5F#a8&lnhEzHwcs|XhZi{L3kUx^N3zZWt>7Jx2Q0*+OnKYp|i><%S_O~
zIfA9reiI#cwh_>Q`;y|T&6j?Z%y>k(y#G4z52Lv`TvqSy<JbsS(2DacP$naZkvF&%
z4(|?@1DJ}O54|j0y!3saZvkd2B;+da^{<Or3nN@P^TdGB9DvU0c+wPCGHK@dtX2ha
z^SgyWlbt-n`hA4o8{tF4O<47?k3x>5`0&PwF;zLGqFQolF;UF-mzf8#ej{n)x$+>W
zU(Fw9RH;lZ+A?XMQRcLV>qtRd*>3*N5@kQTyA05Nh@2%{OBpI?2DP^{2i{i@h~04;
zGq{<KR0)h{#z@a+bowPV_v43>WDgZMLx-OYT)=3{B_dQ^iLw<ua=VN&KPW^{Re@>7
zXu3U=adc}6@doVW!F>ZzsP6b}aeFWVY(c?bE>eIsl6gFRY@UYw8eQw&J(O?r=<3ZU
zpg{K?=q4mp?EBG~ouKGCZtZAaU^m1W4143$<8Ob6>5g)Q_O=t;&$-im4m7-U6+W{!
z;;)N#5XN>kd(Yt3d85rsYm{*;@e3#vv_y-CIEF5Ld)nD-JylJU+30{@X^hVs7=jnC
z@c(p|;Jf*5kpUgM@|0niYOAPs#gsIZB;s^JRy+yJ?pE4AB~(C{M3sieP<rwOo3H!G
z=rzGPnuA^O^V_OqUBd5eopLnUZEe)rWmU^zPhwjo2U_!9gEydI)MXBE)t!Uly<+t9
z$ng~T-{0EL&F0t83f+;ZBVQvwvQLN8t|@guYmPhiC%w{VIi-HOb1b}Z;}X_YuIXo_
z{gASgq4#xTNK(6adbR9Fx0Ohq7>0H(snqzE2%SmED>E0U{;1)AfJ_*x6E8U5Gk>lK
z^ad5!(!TF2iw4Ql)!zC-HfFP7sofuS<Lb*lsQCBo=xJT^{kaL)$ajcTf{FgWWm(7h
zxFtBZoSW+Q27_TNE3bE0ki*tNQA=xJa-V*M69AadDmW<NQ}h_6*i6jQikDWgcM9B5
z8c=2kHsOzCRY=u!UvLeSuy?J)=^un}%%^S=?2%a1AYu7)5#7<;>0r-D%8v4Jj-<f)
z6U(O?B=57!oQq+*ZdfMXey@;Sq);uDX@{3qM+n+GvS>Gw9sMqIF~Y=_>Hx%f$KaUj
zivPtJp%;EtlCz}eDw{Z4lJif%t)I#$wkOzFkT{CTNaiY<!BfEz=5(`SH1#kD38|(A
z0Ei-nyybbx(N%syQ~C{!4OrEwZl}&xkatcIIIJ+f^SQ9}YV)oRR=bFy1RFJiTl)hJ
z7WpgP+@@I$MMWfU<WKnRXRPCk23B_*VV?wCR<2dN!C`;!P0}yd-kkmozfbph5SDEZ
zC3vfQyPZQZ-xO+w4&bz8hR}D|huSP8(vhfjkp2DTV!*FmE&l*YrBT5FHKru0=AL`L
z^4q074y0JF7{o*oq3A#(J+$g+c)m@bI-Eg|uAR-#ojc@FOcx?uaM~~aFvvgqox#&P
zLYw=^`;StEBi{3l7BAl4(UbiAS37}>oiGYc3y-hp=_^V9w&9lahHRNauJ8FU$tS8^
ztaL%MusJ<b0Kdhuf7EMr8g57XN1ygvG9c+s@)mC=Zr1z>`#5%gO^@Hg89Y4Kut#nn
zz@hbiDKeapzHbJ*qt|C{@x#uT=Fis9!~S*u;G`b|!e%!(KvG&n$K=hO+eP&E-~-LP
z+}odA)Bl<h_=*mo|Fuc`kTlE;OWe&B&(}eqV-W<!;rEhlYOIFI!FIv;{(v0)Co8H#
zV*}Aj_|W#&^eov`DRw`$x3}r*J|%p@Bk(6&y@JE$IQI5wtS?LVvAz@cBg+s9XK+r9
zise4L#&qqLV#Lo!wf|YGdJXlu!#8r^VxLE;tOpG|M1ls6GnVw<5k4eq5S3l0%2NSi
zrpFt(4Kr4vB*PN3@}K@Z0t7Syh|ktZ@}ks6CV{FOeOBgrv}%PVIY@?!<SJ7}G3n|0
zMPZtUSp9u#79X<cRTN(k7ZXRmVs%q;y}3fm)e<dVF6T0{XuE$w@VM>>R%sWzO;;eU
z1B?@6usU#w|1!~*Uc>Djq0su%PChqXj6eF2cRWd&+PhLiQP-kpw{*O~s-Xl};3z|&
zT7L&o<WH3|mFnp1zWJ#|8=Rq@b{z8(wpH`Bm0U|7dK-YG!!j)hOx6yTQo|`+btyH7
zqZldw2?P1uEcd(D@>Kx*|NTm5c;2ew)cV5Mc<wy~U8^0>_FJ3qtHA-i+210<T<#BC
z3CDgt+1V)Q;bU-14>Y^Y+j&voGl--K-9zkr8TYsPbQeg(+Wz+Q@{iFIswVt?Bs-ub
z4MNE}L9v=h;t0^hk1mqvRRao%u;wyj@bSz`X4N)pG=5Gmv+9|k`lrF_<y_zGaLpis
zvxb%%;4*N(r$WC1ogY08Am@LURWXk(q54oz`pkmJt1O)SGxbF|uER*WkC}ps(G1Y{
z9sr*t+K=~Ugv=`*Q-gV)ATg~Fq?(^C7r*|%B5%jI?m8QyC#0`t{<114gIp$B+DAaA
zqowZ(dUj&g@K^}(`$;INXOt)s3VH|;n{VZ>7mcaaqC=`R-w|SQnClYCs_(=sW%Vna
zaezcLCcK_pUzK<ltYKsy(h5~#YsA4j<K;NYJo2k{8RO9Ebx)a&{e}VdeFlB|jA{g_
z=r;^&W=#vZ7mSRKIWqhY?*~kH{G$dI?oSCkJ+>}C9X9<}nI>7>s6<IrJM5u2*sL9B
z<P{~R0b@+0vUq+^;_o0c(e`DX%5Wc~yUaER^ph6WzT{No{$uVxpCuG~8w;Iqi{wrE
zgpZ3|^S->9g(mmYP8WUaC?;2v)<Sz%8g)i@BV_+od&Frk70E{Ty?uk1G>fed83-s=
z==f2!@o>rK`L)9535-gfQ&`X5?LwiRxdAxbb?Ho^x7UTjaAljZtlu10K?wq@g>xHc
zP#`PC_g^LbQc8aw8wa#r_FMu_?pyHHx9hk1elK~O;4KJ?qJbHFfWMvDM}ussLO>2E
z^SJ9h(}Uz*I+EQi3>S8QA4*<9`5^39a>V5AE88ICEl6P09i1L#5WK}uD12<rK4p~$
zIE#pKo4+=9Dckukr$Ndo+3Ls{fWw(o%y08rz3AW529=gx#i80cI{_-_$P%byeyt7L
zl^Hzi5Ie$aKSt3EJeTvF0<EB10A~Td{qIs{X0U1jGZQ1^EjVT9*Z$l8kQ}H2Vvq%a
z-!>Ng{mnLo0yQ;#(yPSfjzsr|FLRCu<2d8;0V{Fs*6B%<F?Md_78^)XT%pFlUwL4S
z;?AyLnzdvBSuoX)EdPG0fS{9rnu&qlv9L9nbeVR9OBU}eK%Cz`mX^?jyagHIgOl&|
z(c%BPqff7-vHOEnGm;C&$4>&<Ou)geHtsU0sugrCdC$O><SAI%yoo#3BAu_rq+E*X
z`dpT0vVE=F-wzZ&UN=odKKN^Dlv&jLD`<ONQ&#I$df}70-HZdd!}idC{-Lfd!+vV$
zh{WrP+zQGt#EbL*Gcurn9`X;WU%CMN+3Qzm|J&Uw;%s26L?92wAD+ohhB7YO@eLX{
z<uhq&;M6!q9Xp;iES`T)?efGlwBt#%w0_GLAYNQfN_;M_Vw*@U9%vMs|Mzk?KSw;c
ztzP4w&gj8!gLh)5Zji7bEm1SYHOV)9acXCutbUj4{eD;PRwq<}VvZ`X3SA04A22-g
zZ_}Dde?GD(iayflZ43}Bn1!AHv>hKg-Q4h0Z#639YI0ehq)jQ85uGWtQkhD4E_Y4w
z!Fir<migRqRNXk{G2SlDte(#{%rets{or(?^3?Np60NA~aeob<EGIjS4wyaH{A@S$
zzOv}a7m!>G_-<2kF0I5YyMzrL4&==d(|q4%M-uy0vm#nRqqbnQs@_cEbIkc%Who_5
z?(fRv)+gWjUr?Su^J8>)adk@o>(x1k_WRzvA965o4rh}`ndGYj5)x8DE4PnGTc|tm
z-31|JXO@CyvGcgWpnOQpKC79%aTZE0;D_)d?Hx1bLin!FruP`_!P<)QpK2PX!Mi})
z-5rF#c*h1ofF%-)!wfJlmseyaozj}K4^r^HBf>BtVkv#LvhvNCLw<O4(cvSL>NKj}
z#X*?bW9#@rCGnK$uA2ZVW4~308U+;wA?eegL$LxQ9hY?~Dz;po4<~dGpd+ey<=pF&
zhjqV9;T>@>mAy|x;Rd*NpgKYUD(5_qyX4~zw~u8&s=J^^L^ImDSotPJ5>Zhe$!{hd
za8LB^oOB3WnFgQ=2k_K&S<v`J>uxbM!1#?A;_mL>V7Ti=-fDoyRNw!oyHF@ET04rQ
zk*Siby`C#Rf73dT;|{|>%*MsKe_3qdzEaBfg+wu8QGK{$@8Qc`S6MFOlm)Q-V6<@*
z?<%{3g417@4nSbCL|;cB=0qt*4rzGsKd&Hf&1ch77hG4R^l6_REzSyXM;;TxJo-kI
zj~cY6@R!B31cNlUS5Vb`qM{M!xD+ZEpeYZVbJPSg%4V8&{_@;s6Ml-N6{XaUFhlW`
z#6vI2gk$gA15Q4?{z2aLrS;SMHeR9Sb9gVVu>9d#Yo^|KQC<?#Z*O0E6F=$e0aBx)
zJd*?F6C0MfGiF!h2W-xCL37ftJyuV@!-giG_|wVqpSKQ|^G7j*6wl8mz?k{^_4t*l
z!9%o9x!Gi=Z?iU+WWr7oHJxTOQ`z0x*GSa&ez5^UN12#cpX**1=fmbqqKn~aA;k?U
zWuCQ^`7Ke--cupNj$ps(9J}NMEFPOjYM?T%0DgF<1~x8@c2OyMbs3fU($OtGKqtR=
zK^Rf`0O$kG{-?gC+GdL{L#a8fFNrz*T>85!9WC$RZ96woylz}9IkIM)cVAV8r=E)C
zyiXWJwQ^m?tQ>-K0q!+7kT|b38Xq~nD>uG7?U4>wDAT9omWdcs=($`LZ%EO*=z=Ss
zWF9gY^%m6w`L9t`ctL3!0_b~5*K|e)#(K$;7<AxJnT;a&Noz`Vlu2(<9mn1Ti}Vo&
z@-5|A;PyE~MC<B7BS@dprRc<sgJ~l*VB4Ge2ccAwSd~#+GK2wJpp2i>ogGhq=A(vF
zI)i83A8^X|WX-bM(9c6S(Y;uzgIUKNvLIQZe@bw<v(QX8uL}azR;8J5ehRH`Smsc6
zI>##|hcNJZ<uA6z8Qz%!r+6t!*0apT&p-kyeoBM4b&-6xKj~acQK2UDQXXD-?0jxr
z)$TejfgQ;NEPk_x{>DIDnS6#k4f71^A425y?erGUw%VrS^z(eYfjs6NL2ldZOPaQu
zGelbNOybML5GK4#-O&a$2sf#qGDDp##SQ)1S*VQphS@<-;pxo?96_M6ms!CQXj(yX
z<|2gdZNEdfiS&(R;R9juOBf`h-{t=JHp3MDz)r*k5HMzrCpX1wHg1+ziE{AIT`WCo
zaP&$nzazDDZA;Z-QYJcu6?y)C*y)kW3*%>j-={O&IeQnE{bMuhBae>)c^}Tz<RP7l
zl1|3Ix7Ypbi@mWcx|%TyWgoab+^mW>&O6rLXDv;&nS#r$W+9;2J<obrIA<<)s%p&Y
z^JDp{zczoHW;hfsH-jDe>geVPgImV4-8R6Xm~VR%%&;Qkt6m`Qim5ps8N=q;rQs+6
zwp=VLOd^G!CR;s@x8A&^<(u>+|A3Yg_!|51LE*MA{u)F!F}AL!*znKrdXwnnhLdi(
z9{-nETqNn<h1J{yQ$A0QVWI*>S=6ckykJQ(CwV+&3<3;Bb>A|7AD3IE<7Th{H{33Y
ztn5b@7cv-EHOn6CnEV99cslkfos&%6of2%q_NSyd@U)|IE(RycPnUEn8H1f4t7VH*
zrF-{UxZzL}Ku9@C^VLjy=k$|=f2ssY>U&4#zd#lUtwJE%E49|O{k$f32ov&g%CBN1
zf!=je@6Eyh6hnW}4Mbi`OtGPht0=8M9nZnne4}J8jo#MCVioSsZv39ZE^!<(pqYNC
z?j683d!jZJM8g^=6vCTB&glk$t-5dg9C^mMDq$?~zgchKZUb(+Q-zHw^o;t#p-OIF
z<WP<Pc93^tC!fQoJTr^!%_*t^X}X&2lye5)PhU$41AEg->i>lu(c{Qs)q$=Jex<#F
zbO7EQ-w!8g%Nn2$OEi)i!yQZM54^YJ{MgvP+Y%v$n?ceg3mks;rPp(A6O+?vaDoxo
zEJeNdb?-UA9|M2(^*7zJVPIkvvvd|z5`ow)e`o2*sORLaHF`#tox|!9?);FAv^@gA
zUMR9h(^YSM2)>X2pQ-!c8Q4F$<RF`u%6x5kDQ4+YwYLVt${rD--`e={1FLd&j4E1H
zx^_t;@!dlx!^Fz6SB|FFjfIgOXf#dPN5>VNjRN>1=UKFv(7Pe0+PA)!$vtH|X{o`<
zjtA^<?P7FgHRrYhN&p%f^*L*%+>gk4gfZ-^9?p2~@e}2JtH-3Y^53Jo#%d1DqmCUT
zGeM&N-4Fksvm6F#P`Hz*(MV&6`lop@up+X=qUL3U991hhxhe1JplY1%e5E;p_MS=g
zOYL5$q{Hd4XIAMz$9SH1Zr5FPcn^tyrgP=>^=j0zDv1F~@wUT?ezYia89I$E?RfX*
zcUk;;vHydORhqyR|32e-)b&H*V$!cjUi*bwzc66>`0NoR_D;WSBf$17_Mnw=ciWQB
zR>UA^;~JYcbUm`P_h+5or?JkpI@k4<$NT?=MDh^dn|ha6pi(KV;B2Dtp~rZX#bWz5
z#{a_kkG0unXXW!CaQs$DL_XWUS;qJX3zn?DyRrj;yfP2{yyP$b!7DhJTct7fJXrmV
z%c2jKT2L&|sQE>=*fM)BuAFVKU{FxhlL0f%$jxA<ZzG_sb$`1_`VxmOdeDb;%-nHK
z97*ocQ5VH#jzurcSZ&>uWkZ@ZcMZv^u8-QLt*F{Rz}4v7i<4p4PK_0=bYj^kvwa(d
z9G=)Ts<Y}E$>9lf^tQJ<8+0-trDi>Yy_Cs3$#hYCkeujqCAV)e%q+j|8Jia8Cv_w>
zwRvmX(PL6N`fk$bTs?Ogd}@rJ--)Xqu_{uBX|Vosa5||$cSwnM+j=#?(K8vNqvQ6j
zsc+S^9Fd^U9dmm_`lMOgh|bmc4(>t0w`vAndbzT*D<;T76%p_+-tO#Uk%-TK>@9$@
zN5mW=F@{6?d9BA^-&~nd_4f`1)31{s866EwuV5#W!P^V78I0FCusr%n><~?=r|_c;
zRqGDUu-B=b&zn@81HkQyVA()&HUG}%t??+NZ_H=8S0))g3U2q!MN?B5bfRJ-3$c$%
z9*X&)e99g=wnj|Gr?FXom;F2zU33zimP__6MQ1gp)ck$_JCb?0QkhW&x{p)mfs`8y
zATU2JCm~I0GW=yo>_J29>ES>Ec(zu6XFCDuvD?0~L$Fs|!^AYoKku&C#!C4B>AMQ}
z_NRnE5gwpCwe|P1U4Xx^DNMG(^1TM_4}nV(#r3yrXt3R1_?i+-n80|wVb&e_<Ocv$
zTnxHE2{uj4Q-5t=&E&8-@+YN!2sU~Xg$K#zKP2;bQGb@&!ct%81Agx6c_9ajbk#nA
z=c2%ey49afp}yG%+;E*$Jt1C|Psv31(i7v|f3l#LNkUYNPxOv1Sy7YZ#CSaAwYI3Y
zQ7E+oriK84<Zt##E1t!yysUOx=tkSDRmX?qj=%K3*yt9JD&x>nZa?=MVG2JkO+0g3
zJ#J-ei<199zN|N88((X4)ZFADNr<uJaN^fK%v*1)w@N!JG92nXtDSvnVppXpy{ea9
zk#Qs4r<;r(324{$P3$cheWTNZrFlJWqu2Hs;<wLZ?WHPg=GWXH5xr_d8@|3cA%^yi
zCyNx~VAaIiEmv80z)-DhH}#E81to(dmOx>gj9<#<9!S@_Ywda4MD#zM2oA;H+V=2}
zOyrWJt%A!ZeW5CXe}Tx6Cie9{9R9lpD^IbzU1gx_x?ie#5HQSCD3MyrFsz8)T}l&r
z8h=eD0&hHe33%&fHIx}*PvTgq<3npE3M8n!`AzX=>V8lB1f{cjZQp)<?JTe)$tqp{
z2pp#NbPb*yJvp03Dz+As8pNd91^9v2JIy*(-$}Qp`dih!aT}JSr^=?aVv>ucMDi8$
z%6-3c2bsE~PcF;Gqq15nTw})N>l$?^XvGj-St~4+0;_%xlAft2U1HDcwgHg8^nM+`
zGAmDRf<U9-!R@1oLA&2}`@5Vm<wEt|V+u3?aeNrzC`e|KVfe{JLxS{5Krpmt^~k5{
zAZAc%M4<4&X~u+qu4heP{o#qG@o|~mAYQhFZ|nHzSS%~6eFR4r(JF)=s-6|Ylj6zx
zW*Q`3r>vxT79$OvVJe`PTIy>oo+9CjA##R6_Se#0%q+_cZ6SgzYPQgKC2rQN+TnLw
z{DedebYnLdW0O>&ExxDaBC|>0d}Z)>`{QhLH(n#|_R+Dv=f4QXdSzDEGt)d2!JPrg
za+y`#LrTIbl|)>zj>)Xs;c;wQ-@?kjatV(Zj_O3~`ryr$4nv{Iff8;D<M$<2r*qNA
zm>;zP?c#8i@fI-Bz79&r9L;0R_KYq8{mi>Gj~y{DE7aGU%lVB=yX82i{@K@;Kd__Z
z-@^jWw|0T6Qq)^QZmwr;+Ws`Yj_E$mG~DpltW<@1+4fv@utv;lMXK$}6{f~kFw2%=
zMZN!;MWf-^fdG*Lf+AgGBK>)riccR@YC@_e3Ze<(-qDGxYYfXjF9-EywQsqxGzGHR
z%@Ehy$6j=C%ja#<%E{^xeZvh?+rUfWe64}cqBd~(P_KASH=LFv5)>diTol!qL!tGs
zYYc&|UUw}+(Sl=1jZgwKDKJkVA&*G7_3rv--Y3;j_|Ju$q3KyQ-7fj;6@BjhvT0|t
z%g7C3rhc@Nx+JOZvU&<(061_ub~lQtVQ0bXU2nd%Z`FA$!>Mc5Xb;+jFSb~X4p6zH
z4@={Azp~v{Ed*Q5!vd<O8looeBPgE6c@siY+J^kHmdvvVs0a?zL`}tb2eSJRG&~2-
z=?urkFF|pkgGTP?>w|QG)Etd3=;J`}h(#Cd>(pF+xfn_?tKk2nk^)K!D)rV`*F<0Y
zE<ZsAOHnY$bdcqJLC?-L)553}?`xNG2I*A(2pYOrI4tba&GlcsZZ7KIzM=5UpXS^v
z|5snfkd_jLcjeYuQ1@=}Lc{K@vhsc1JkeKj@kVMUO5wjBR^+L|^5KRb4Cg5$ywlC4
z<mm3kQp(vx5Dz9A@y9-LgB!e!ts?L<ngFBc>K|?|O`jVe#5wuWT+?f$>8K#KLKH@_
z-ExB0kk9%PZ6v&py68WtP4(?i4Liq!Q%equJgaNZF=}(}J^eR2e%1i6VtMtG_oI>K
zlh*L;;qO6b1=9cYIz<fndpl!&`+9MC>;0jR)H$H;OV`v?O(mo(Mv5CLyN4%?K~j+R
z1}hrZ;(^K<Y;&zLN9Sq+@hvNWK*WO_oZ;Jh;I7{FTKnw+Rdc&4nay2qdMSp-k9$<t
zrg>EE+C^8;=<F{S-gTpUPvr1S2&frK$>dsX5k+rDOhtrfWNbp+d+PSp()KVEubFL?
zn_l`E&~n-T-D*oezwscokIdCKJT)T=EnycC`+i|ZMA0p2xmfe6hizj5Sgb^}A0`ff
zxerZ%-D4wC4lK)#kOLdL??xb_{P_xDr$eTZ^&(3RMRRP&w$;khIh*bg^(W=!Tqg)}
z0+ha6#1HOpK#WX)g@3Bo2%rY}IX}R&t0!ZV0$E|5-_-v{q4_WF!gh%JUV9NAWJVw}
z6|nmjPpa|@R?EneX<_utlFeQ&td@42UrQ0AE~j8=%&XJVa+^FT`<~&h^+<7x7ahde
zobes%{cl@Pcy+u&?{U*@15!&KU;K6;*VR8p=QP|iNc9$>Dj@>|TC}-o^D<)TtA5Un
z$p%=2KA5(lCG?&nVIY`pnCx;z6M>+eT9K|3?@TGy1FLw*;bN96Exs2=UI|p!R;Pbe
zYKP-z{L~D7J(bto5w-u-@DdDmqUV5#X4R4k@|NRmW_R^l&m=%zP%ZisZey&(PL?$A
z=IG%#xk1XWo=R&23|G>>!4$Pz{)|My&s81>(Zkp8ISL5&X!q&-EO@=GW)>YIHv0H_
zarw7j;3IFW_%*}4ITPaVzL#SF*LiKo_kX&EXu<np2e6f^G%5H|nTq=pM0)iD#;p2}
zv+otFCeFBPW|t4UJK%@ze%SLi11s_DtAyB`F#Vgm3!MdTEw{>6@^$maq=&o}Q&UDF
zr3v1)OZXTnek)}ywY?Et_F0O)x@T#(75Ad@(njsN5ptbzs^!}bth$jg+|UU6y*GPI
z!fAqYfjs1j+V|ZbNmpt!R6}k;k-=zrmHPNu8;iPWVm)ydJb<<vFfNO(t#=^%uQiG(
ze3ZZM$$InpT_%7xffD^o2vtTX)jb2Vi@JNVuhjP?o*65Z8OC0^$wZyX)x(r)prNe=
zv$S<l_*O$2&*!y!3Pan?@rV3KhQ(2zSaQKae#~i)as_e74@<=O+VfJrhWCzF0scYU
z;$=+zLzZTd7e$#awFO<M1CLD_mh-%~M1i?`XRZ>WFD@sV^l@^r7ey4G%Q>BgS7j)8
zDy(KM{qE;`QCFT7K68<-;Lui{_q7ozHB1yZ`~@PP1-i6T{ztkv=g9CD@0fBv=ZJP?
zeIvK<t2d79sq;^r&4AS~`V#7Dlpt$2z5*a`WS-zZJzwt)m}=l%dF%W)Yu0Y#=~$K3
zwLe962a>*J_?HLL_89NHLaD8X*xa?`=E|WbV>M*ps~YhJNhgZ#h@RJ}Kr5H~A)sbX
z$PE)M!$~XOy!hFcA!o@SVQ(()o=UsdW=VdpHa?K7j|qN2zEJAKv}$^%Q`1^Q2VN|j
zrkrIMt3HT(GY~;lDA=R%sp!87Z&3-(7e(^)x7;fW@qClQ&)5xK@l>u6bio3-G|~TP
zG?zhJ!K!>u0V17Wke$%ePA$&+5u;~&^x`h<fd`(ysHUT2!j?-ZT?D-)!#KUps@VO8
z^p;;%>9Cq8VVCk<g8GNkS`+GZZ8y`qZ83e}ce2QhMypm<tP8qoy0uf%ejHx5(!%^%
z`yh(F?@LO9S+!wd6?OUILHtI<#S-d;!)ZDmOl_0=Zva-3_wCgL{%txOI!I|@ZKT25
z65f4xzdZGGk!WU=X(#o3x2Hj8q}lH(hrh9}p(OFJ9Y5CR7c80B4SPs43VmjrILcBO
zE7?;*+C5M#<+3Fr#Q&L^fA22__cQ%-i{G!YqeGNi`gnyT_BAw9PP!8Gh5C1!f&{XL
zV62s?ZUESh`$Bi-UF@emBc?JSQY$vnvV+iypO{{5_KLMlD=RC(Ev&O)?@EGv@-IT@
zS&R`-QF;~3>3Uz6$+q{-CWK;B5wSJ^(fP#RL6ZkX(Q459c;Eu8IAw+Y;}`3_pWsN&
z5Zd@(VfmD^#;S5`vp9)-`a@pPk(NnxEcgZ+2~tK@@l@KgSyRw$ke?&__!@h@xG@Hi
z)9HPOm*u~sk>m0uiOSdkuhf+clMs08dnA59H2mm8#c7`RJ{c_e&0R5A!&-RyV8wXZ
ziFfYnd;hh@%H!^Id#_)<^LHYCI_n-kjc!3Mvm*5P>R;>Xdl^(Alh!BS$zwL1FCxvX
zjoFF*G7OEP2jEJr!<^pVAR#n=(@3K0CltO(iiz?_WAS@Wq|&Dx&iF|fyroe<zqBSr
z@hjxF<8LsbX#^JQ$?|#OCzi`u8>P9EUU!{CEqS*&WV1khf_q$%`5Nh(&E|j6LYghI
zn#uJ9#Y*(3yMshgV?UN<XuK_S;@w&!k<^ZK%Nd2=cv60Knf&t*G_3s5r1%AW5gsj#
z&1K*x%ug&9i54HI+<M71TJ|vH5n(~1-9xOn+tj7K(im=~fT)VqDcpyEn`$(p@V^+{
z;Y8CpJQMVg+q(#KdLF4~y1>&k(nTBbt!icOTKrwp@8@HPqBC7UUd8+g1znxrN^Q#k
z;-^5is&g{j--w!Es<b;pW4sYVcqB%s-kmu!aMp@!+F-&(f*u5!;)4~Zn}lkz4Udyj
znxzFxUKN*>TrvDk=huAj8Vhfz{$8tQ;K$!{Zhhk&4GsLQ$F9TpS<*r03kK>wTuU4J
zU&(05W21cq9RdIJ=2Z#%!>5bHrQbwj(_UZiz4$(WXfJpm=^rT80*Uy7J`^vMmLPvC
z4c>9Q+SZqTvu0DJ$I6V`lLN)`;u8C_8|TL@uU@GW=u><qt@LeW_*Lnab|10Z!O<;t
zR;AO&6&Q3lDIIQsAZ_=5sQSJ`_e*|Y+hNoAwztV0vV#uGnMUiHpGSq0Ogy)GnT(|M
z?m%Gexz)9-(5byNkER=f6Kq*Ah_l##x@%AN)aVsy7^lZ5+)NrWnk#8q6RIVxV*0lj
zMkh#wakTNZUCOU~2ja)<4#Bi4O6h4XHkVwPUs#7Iv(QlgxTt%Y5Q_ZbHO+e)X1wwE
z*kVv#?ar6|mDA7)#FiZe!^WS?`<9%Tet-X3!#@>-p~}CCdBT0NQD!5rsc7yMGb(>U
zXBL74;Hz8GV)5{u4s^YwyS-vi=<hZAT+hGEG{45LOH2giUhH&;4IILBA0M1ldB^G1
zm2JR9yrEmj22FD@BK8U0#Q%6&dkUP3`XJME_O-DCKHJm`d&+%8UYYmNFM4ymECW&P
zmjx5sCf_fR{q^7>YGpALeSFNiY1_$xWnL$M((vOuj!J7J{ienlt%i!7GPngI?rOs-
zi^hTm=v{AXV&6QqDO{-9%$2MxiY86>e8G5u`l{*2h?N4kLB9%JKL+q9cqFY>Rt=~&
zdPrBn(q1U?pS*~v_S0NJYr1>z?=z*TeNOe(%4XCdD*hGhk8DWlW+!0fXkLEsXWPxJ
zp7)=be-^H#+iYgvNlH7O-fuWHPEH2rYylD`<8Pn4=e6k0fU>c{GW3bH?)vTfD?Z==
z$9J>^AR=+wvii0CF;o?Pj}Io3VzskqNTLlSkO*a}Dt$h|_VJzHu6{2UXH=L{o$b>E
znmQ#EgH3Rsq_LpheBMUQKe<W(#XlD+?sOuKLLizMA31z_BVaUI;Mq#bkX$vB{>~ev
z8<-vP3E2`CDoVm2bDrJ&Wk2F2qVBpxJ*K<<qln}upP3@jy?X^69NMviRsEzk<eFhP
zc;$~d<4Q8vKB<fwn>I<{=)2L4z7Xi2!pn`SHh+sM!L(oD>G;Djf^NOY$%RYN50g2u
ziRLJs`kI`A!r{lup9PoGaG&;Ij-wj9J>1ylv<#gAz<<cRwe_Z~&!78mh#%@H1<O{*
zYUirVM+W}MuvWPIiF|>hTz*m-Z>ufo^Wr}-B=3$yv`N;<>AXXyDZf{dGMu2!xQ*0h
zzMU&eBSN4;q$=B~qzo><t6!6u@OFrq@%z-X!g6g}!+G58E4~P#O6e0plfaxTj~^{Y
z`h;Fq52vwN>RnU*@~)H2M^>X{fB!av=lLlAGiJzjZS_88=dtL;P^gRPv?zI&MqTr1
z=85NrcOT5f|87$#s)M2q{ncW<=fbaX9g{elv>+|JmY1qSzzJ@S#LcMpXT~3tk9+u@
zzEJGdANOk>NN3db47(Vkup-s|3DqJ{!lq+(l(D%eMBNk_Ej_nmF#)5$=}vynuY>mG
zUP17Roqyonuu0FfbFRJ7P{{GN|Bt76x3@IC3ofwoMR0w2Eh!y6zhk?Yl(~_GYwP@`
z;b+ZiQyK*MTgGcknNqYkK{)P>0G}1X3tolp^1A}swH8B6CZc;??|=JRBxY^7dHENs
z(~sw4L=*1#vkt0-p^$-zl5LE!U1Mb2j{W~I%U>poJ~A?2{Iqov+xv^+%qchSSle1E
zBLJ`6!^$EGKFtUOSx&bzrtWs@_hQYUSquH_HJOB1X<16D-LE$MR;j68b7buB6&!ti
zU5HL=0;e1;*PhdbSyr^1c}AAzuy@l<XL8o9dw6XBvJ#ezpD?1sGIvm6pvJyC8VBYq
zm>T68bKfkNXP7?4l@deyaYCq6Im~bO65oN2b73BPu^n9qk+C(GvE{|pd|HJP0(O^K
z#N+@u0|Crv`k-yMt$?B2z#;#uQ_Gg;%^|Wellf3+$&N06{(U`%{vu_IR6<{TB536N
z{82JqgjuX=icAR{yn*w*93c}Hn`&P99ywmvmr!CP<9Nu*j1x|8uQ)TJg_ANc`(1BM
z2n4A<5695#Hm#~0_&gXXRI~?F-V$1E`N86XH@-Jgn!4d|HisOf;~w*4lzGI&9Jm<D
zE`ZoRd~;-Wa)GgzGogW-yVM+iD_8N#$b;m@wd=Xm|L2fvp8?zVpgCm4%hXxugj(J)
zf_2z87>AI5TPP&&H+K#eC87*{eEH5U!ljG(r*eXFr=1zK3>8mdZax`R`btAKP8*j1
zL)eP^@7s<cljvnen?U*OZ4XK}_I=NuzU@16)o>(q<{I7Mi-Y%n4)wVVoo<u#MApME
zI7p+IUcD!bZn6yEg`5zkyb;m=_OYi|&jWlOBa?0>zy5B!xDv{1w0vY6Rj+$Zx5+5`
zN0=XHr9C4zGK-#jGAwpWZQ!hIDe6NJ)kyVH&ruj@oGt}{lgyZ1NBUrLDUVI%kmrJD
zZVx;Z9sb|M#%Nf+=#kNb7rhom7DI7wn)A+Jf>yZ&fwSrpEH|dPwe$2d0cL;Gcn}e4
z3CM^MUyWJ|Btj`Y4;c~+BzUx!WgkXT-`vgOuQvlS-Drk8pF2SWDmu*&GiD-4*)+eE
z!pIfdRoeZ_A+}shNI?JIw3w)`hB*wIb;?3iWml+Evza<6?QXwMFVpE<b3YN*Ef%Fr
z(38-s{GVZo3cWC4tl~~foiaH;d?&>+r9tCqR3=WvY~dKno7uTfJd)k-wEpX(MM-b4
z26V-!Q^~AfaQiuD!SCi_b@{`I-8}~E-;#k3u}Q`I|E64GJ1p^SL`B#S7?)SS3da~w
zUw+DR^~H^h3?V4Rt@JX-$+$ht1@u$`e~p`78V;1iSr_v4+?L>LwSNuOyq9rnBP2^~
zM(bwU;b+^p+&&7SI{6{Z`M$>k<i+d*DL*4rZOE8ScqtFRKb9gWNXl4!Sm4-~-(d+#
zN)aA6dr2GdItwx*?!W0KUcZJq)m?=FVT|wSdM9!6-a5I*#@pUAuM2c)W`#31w|p1t
zMs=2^g63O`Y9f#ZGVx<3XS!K;uf%$YKpq-elghuAokp$pp|&#7NIBhe%k9*2X(tEK
znDOcyz%aa-8nLWidxeq1`bpm`i@*C{w!YytqLy!gnFHVx7474;xtI`==$U@VKWUrG
z;rurvGg>;kD4bPobmjJBmzf@58OwHJ7_XtvCZvP!coIM9Ng(@%Ateq%kU6#|nwPIp
zi}k<AkRlUHsSxt!(Z=gkq~sIQ2pw<2vJCsxiYf57mbc)%SUUd6M{G>Wcu|{H>{iMh
z^RsNh%j9O2%haXF?wWSDg0U<!pS&M^y3PgQiiMZ0Fv!K}mpZY2in}Al11`$eWlJYT
z(X%z#!cZm*QdGbHZ66a~Xrrn6H?i4}i8HS!vA58FYQDMk)q;@m+~bd1Q661i&;X|a
z*wpThnCforfe2DM7e5MSPPb4?&TXS8eUbcW-Lb*ul;ZY9W23V7dMVuZM+Qxa_3ypn
zfRW&MBuMUKo&x|8UQrimz~5297Y{y(-qzO;b5l@_+^+Kz=CiY;aVB{Z{(`Q?aem=l
zJeOEcjs5DWvmCEBY|swCO^(JW3{?#DQ!5;@uAi63Ei}e0_egb1^p<pE&kwMunsaJ-
z@sjbxHIbi=e<@9(^TI!2aFxcdbf&;pi`IcN=0;Eav67NfC+$mK{y%PtZsPB*X4mBI
zwJsoM%-OZ-TIqY5C*qmhFoV~V+Wy^KoIxs0`&2tE?XxrNKkfTv3wByrK%!P+sArL=
z5t&X#ce^b6id`oY4iInC=7;J6=4|90A05Y@_4<W%DB`60uk$?Uwl!kHI;C(lI*84g
zbIOYMH>T{x#37b0SgdB-UX^2;OudUp8Je^lUC<#zYBf69MHbhK9wEp5mch7E00^#U
zC{L_<Fb@smzAQ}!;(cXH39uJk6i+m6zi3?=6=h=AyDwBKD>b9hIrdyP)e#jM*=5>R
zfPSq@ob7C;)6Z=*O3U+_@y;}>{HRMG@~@X14S&G}-*=7`ENv}HfnwQNJk#a0RYiSi
zt3p+e{!VsSy_M<<89~M~9xWI-`{W$BX5P%enbmezqrkay@>tAaPES>ApyqmOwaS{V
zihmgZ%DBiGbs4xYg`=Yd2KZb<EzM-Zf(%n*P`Vx%T2?AP4KqEFo9+5h&EnM-iGe-a
zp<T~+<pbB$GG8Bjwb#YX{N^~tkZW7-qfV3u0`HWa1DzlB_J*JMNx-4=iPGA{`*)3?
zQDTwU-ivATto*3!cp`eCaxlxQ14<0zFfTc$_e?~HWyNBP7Oao6w|eAJ@WF4^wF8e<
z7aq#MF&UY(M=fH*m>%|Wl<+x_lj42kZzo#rdrRHC^Tqy-T7cCT4%`RZ7?d+8RJHq7
zIB`fl$?rh_Sz0-pN{RYGV5vw{@zfaUO|4g1gdD>UFy1WwNEqp8U8fWz=GenDB#_&H
zNIfjgQvF>fM&kt@+a(PKyMINcJ00<ITNjvT>9$`rTxw1az24>`>*&m*#=sa0TI9e>
z1IJMdk*|Rj8zp1?KP$b<ar%|}yZrA_O>yW?eXl_^NY-G;IJ>C*I0Wqi<0YqVJ$A-O
zD{VJQ*AuFK&cf-}%8%-K;iC+N$H@4R^SOZCecm6QE6lR}kATgKwSKtfhl`jGczX)P
zC=r<7F}fF0ch|5u52(Lbh|;GV>EDF68d>CgK+B}es;RAhJw8HB_`hi1S5TK;h0oR~
zzfh{j8nd1lSD18)>!o-xmm4rf>EWQI{&i9O$pb%ES9*NO|A18xaYy0AafB2;#Io33
zq&w#LGs4B@CsphN@sYli@6QQ-x%%x6uOW&;<1G63cdCr<ls3mAm8pV{ZWYV5(nTwm
zCHl}t$e4{LkLL1R1?iiGaHdp4(Y@UI*D`+>j#8v>lgJy@3%<44=ow(83BkU2C0k{Y
zoA~f&@BIUYO)()MsQU;dkt64JPN9fErDFlZi(E1q)?Vg0gJ1w^Bl>RJc)ixoB5_Hf
zvmG1}!>xP2WfB^Jv#=96n29jvbdOhU9tPhrszoTbs)*_58=Iv$dMl%Cf3zW-fwZ)9
zP;B8H0rwqt>j%L+aKogm&f5vJgw_1f^;<@4!EIhh?pZfPX7CfRN^T(yF_D~gGdFad
z@>2|dXc%Un#nWE}nFlVDT9;)~!lT)wcCfQQVFs#6qF1xDmy9-mCV2r6X+U(-v6cR4
zv#m;65V8rz+eLhYN6x<*wkJNmI7nW(bU)ka-E(Ph<BgvK+<~FX__jxM-G&qXdf_1H
zRPJ23_E6@3*hGT;f|WA?z~r2p#@tT%KT&Nbm_Pr{s&)(tza6c3aI*L51eb1Td)2;$
zT-7auw<JtOx!8L{m{V4}5w()+Z}<MKR+P@B14vl|K}TkT_0^SIyzMws9Aq!RC|(L6
zLj>wBwH7Y5OxD=^@vlSbqW1#D$|KIavHvJVQkUB)_V(#Ld(Q#h^`h<er&fN8lZ=4i
ztz&2j5rg^wum^=hOM2x@0OoNTur!-`iBkIegFUzYX}4TSat6|5nR#2Nlau%H1O6u&
zd$OR|{$fnGokrhR7FC*N?wVE8B0W|;aXY22AMMgSR~_dx7U*?Wnoq#Dx{B*|nRWxe
zsl{*ZHzS}Ud>4}mpEYN1W0>XQJ5?7n{=gPITT9tHPWr3u0pA}+NU2H23;gT78qM5{
zn}1v`tqvT|o?Jx&uZp{hU@=Yvx#Ew2u%i$W1gK`2uOtBw$T8dL{^G6HN!c*}smogs
zcTG_8y^<X0NZ<hLC5|-ipJ+eZ&Qr*VNZ{o{d(=@AXf*J)Z={THqNw#jyWnJ|K>zjw
zjp(fSGN+#HZp0n(bE!XR0diQ8fR%?_8Wcm@p#guiTQ{zG-_uHOe)VmI;Ir7@afO-Z
zIn;IF*K_1<{)w!Qv*29GAN`4Xu~{)^)i#iuwg&E6r@C=#n}rz4|1-kXTM0IaMWY<p
z$1o7#V4IG`PbWUJ($z1a;gNbo^<{lb_-(+goAZ=iY55NV_B$Vg&BC)DxayO2B-aqR
znxg3UpM#CsRhSeA+q(!tm{YrPj{|jrcCZwCTReB{aA${V)e42hZ4tQ9)wfGEl3Yap
zGmceou9`C*C%UFLpr_q_mQs!|{8wuH5xVi(J6gn4EO!zExcQ0wYo*$Z#xu1Zh*kW`
zq1q$xF0|;Z#s`}{<g-|cDs2qfmh)<bWE+WifeNr|>As!dHE7o8jMW_{y1=-@ljrM3
z^fT>$GVpmIr9i(OzkOB~H-0&?;{$PDm~ZdaBHEcxZ2t<1pM>o5Uvjr&kJhnA6`)&k
zseIbl+xtl&NBG&qjb>BH*4n{Aks^cwoNc2t3Zb`gugt5tuLc3%UI5uV?~nZYkK@a5
z`aY=Id1E0WnJ82~;~EQnHLIb36h3pWH0#uHy<NcnV_gO&wODXhJh^5~w5|&u?DWtl
zo05~`no2*VNmuju$}J;4L*U36-R--FE+Ofs@T_C_Lq}AId%7H0gZOT{NADuuaKE-n
z;s!k9WBbst*sty}1*}u?XBy{C9Bi-E)hT6tl!6O;_GcyG_aK`;<weTEVP67`gKwH_
zuo&)nYt)!-MGg`Z5C<FCVGRE@R=0mD2cH0GrmRlT+++zkP0-JFf<uED@<on+|39A2
zGOWozVA}&kKt!db1`^UB9Wp{11nCX|>5dVjRYFo)y1Qc_?H@#t?i5gJuz>@{=y-0Q
z_juk<e&cYvcmMLb&Qp~CRaxetZfokTO>s!;m49iRiyJ+ZBGD1rgw#e^-JAYXewky$
zFf5UAcL2m-Hte9f#qIDVSgfzKHbX7qOI7DEs(D5H&d9wey`btPyJ_!~^Q={?0ehQB
zF&)Hi((ZCmUAf3`49q_8uFBgBzz<Z^^S`by0uT-EChx@{k5LjWrFBw?#eOcGzD>4X
zIyb-fbi1QOb)xIRV&OeyJ{8nTD;xwf&M-!a@wsgGL70%OmiT?zgW`^3fDS_fq7}?6
zUj{xG1)s|W``ODxx&rQDbzCZ7f99c=OGv@NWpt7t&sO+{m5Ree7SUJ`FsK>v-ssy3
z;Wv}RA@9~gTd>x<#YBASfFUQMVPS0ppaAs(*x-{uu-}R-5;X-SB}ACrrpi(n{>xYP
zD!y~aF|7LHy&8HPY_6H5|D;vCPCpu~h55$ZTTM(iwZ3%Bc6tjfOFZaqe7l-G1V`(>
zZ4m;Nha(<FrPXhzim`Ple*XPAzRxG##ZPF^7e{>#v}q!ZXI%JH+0TYSPr?=P;~=Io
zG_cl?raeUXpAukX(f`<z{35Crh^s~bL(2T2(ORe<U<y|XuE(e{6gR(DAg*(Xw@eRg
zWO`A`So@4hh0b3ey<~$#??ab2MTjZN#U*FoD;7xD$&brDgusang6C^3;1_4mKd`ZJ
z92aQm52*(Kxg5cg*;5gcxAQMvxLUzmpZ`v2cMMjje_jr;KlqRe#{LL?z%!3kv{!L$
z5gEy~>VK;nHb(o0E}~*y1V5Iu;qUgH*sw;+7+x6X&6ni~I#lHm8mEtXM)T}Q6VCZ|
zA9&%?&}okg02>z4_+Hi9qXE(Sf^Pgk&O>`j>NXL1g+C10gAFMS`d(|EdW8$&{JdSY
zg9~@BAz{FVMYKNJ^?|rB9u@D;_#I+jV1K?N;K0ej{9+>@aP7IiIJh`d^GDS^xXgKX
zt*gpglmHq=4rMT!U5BMEq|=(C)mct;5Bvfrx*M%b)u#N33GidbIIir}Ed0+55~o!D
zKwIYk+x%4;EFYjM=ZRL4*k$vg<?5{`=0k~O5tWyLKq^jKtWBGA%S|G9dbC?xo_ReG
z6Ndy>Z>klXr$m;%JrQe__E>eN#Zhzx)HXa`o!f#c;fiRfFfxv+zlUBY6g*zpXRia-
zxs6_@c}Gjdl6>Q?pTng~JeUz3zu}Y@!!&nAKcBcN(Lk8xqA#+t+;s~+-2JKLm4Y~3
ziQBd~&(7kR80zp21P$*5NOVW@K4yi%;!v?2WD*a$Agj67TpHm6#_BfcGU`ty7D^BT
z_k1Ayjpq<RfASK2G3^>ZTq*1{Tj(<CT;qJA=KJpux!Ash`Y-4G`j&`{d-+YQ|L*XX
zrXExQjj3mnkA8DMdd%dN-Busj?iI+zGxze&uJ40zX10iZ*cZvg=Am&D6Y29jw$$1>
zCA|mYyZ2`I`*cU_pKzFb8;V+roSO}xgcR(~J$4Z_n-Q%h<T=zX*fl;o399rLUxV~L
zCC)i`XM{M?uWl5*br-T#?h33!3<UFNSvNn>!D&6sPte7Of~zZ)9dr#Dr=$rkB`AHX
zHPDTD)g*K?(#;d81W&L+VT7zrjF2W~etIeUmt!NY4{3FqlIA0#jsvhyPgG_BNI6H=
z4KL27L@?T0&IS<WJd$0|^^zHx&TJnRb?$nt*eX23^YwMOBJn+a#N3`Cy6waSHYL#-
z0$dTSZLD2|;@b&ZdnarKO^;$oX35tMX%;S~vp-}Bl$3vC{>@(}k;oyDlR)eW&TjXs
zk>pPuZ<maM6=oSQng)Nn_;j-&aEEN4rTKdTbTV*7uPx*Gz$z_h-7{l=rM>KZTJ#Qh
z<qodT?|`G~yVi~wp;n}T)Dv_>77W&69Ol44m6s%s&W3XM2iFCoYtJNY{DUP-4O4_(
zdDv{%#A?1>9}Cc_e4e4}W?}q%0=@jXcOCvLHrj@-NBDOF(0cpVoLddAm5FL4nkWFK
z#A1Ma4FUmq+)Ab}$MsWMpkj&(db_(t?Ex@rm@*0-tPcReDcW_qHl%)C0D$F_dn=oP
z8vxr(plJHf%h#{%buPA0Ua!I%4KwZrzhl(P2Nh&Y7rrmJ4m`(Bn9%<AWZ^N*xT8+N
z)Q;xTl6#J38<4G5@T4j1l{Txte?~@zWw;H<`Fi8W)%)^)Sx=vAf!K^}UP+gSQqTG&
z8%-Ji1I1T2r%)PzS=kV59$DNOx^#1s){J32tlmkzvr1{_bsTP5GL{qEWUCcww3P9C
zE*CU{WqYR8-1p86ExpJJ<=-<OAfp^L2cM1g>D%U`e93VAoBZumV^WiWwXVY3;-c?@
zqDMIjB9~Pw_WaxvvEOAWvV+_|xr80Bne;`@5jQzxCqVKLt#AoW{IH@46(4POH9nCm
z+WgT^?-XI7=Zsy-fKP$|^cKkGZvtQjtI03y|3o-kB|@A<Ji|M4G<9Fn?j947MQZZh
z`2le!&$p<FLcp2gxp6A>-`x~B1P6pT4I~5|4jo}|K<sC|oqw=?BeB%#Td%w*kQ4>1
z-nvaskxa-s;HiN?%Ya1cHee&M=ni;dCM|KHW#=T&e56~l?qO%JSjJ`IccIzUYs+ez
zD9dyd_YE)fj(c>n+r~T6b0PK8^{T@tO2^G}sLO3#56lPxd;w$$2f^%N$>#(^2-RFu
zkb*Z$z9l-qaCP{GBi*Ne+z<AMv;BNJ`CcL`k294W<unyCHbO{{CpY&GvYqV{{crMX
z9JWk?K?<S+@lbDzqVZ>$YO7`sx4d0qS|SFs8^5X<GzUNpR`_9jvTK8CxaED=IOJFS
z8I1J9XY5FAFM;7L6t0_bF59QWd7jat+cFLu`T?XNlcitDc;-FnuE$mCs^IS!9qYEz
z$QQ~)KIeI7ac3jQQ66rhb(PWC8V?uL&5kG=+cXsKr?ZPC(z`@KaXDk(CV9of%*)*7
z3>|kucNDSF{?t#S;xp6&B1Yl7eE0J>IZQDP2!%cXyet5AY)2U1O3#O&^+)+@ML%FE
zJM6k*q1&|%zze2s^^AhHtsQ`h7w3Nz9xb5h_saT8vT3Agvf8!?5}LZ4gEu<Eu=4%b
zf7r{gFB+Ox+-%-;yi31)l4Sgx#>W9On9(<aIA7A08sLZCHuZm6pyzEO#G9($vdwBa
zwCI6s_&+fd=zmSO4MjQt+G<VG(@PN0z|ES`;(TC#5J|`Zm?)T^TQ*g$b~O!KR}H6=
zGqb-D{IypCpvkDOWq<yvVzNjpu&p;;F0ASLv`j8|K*~Xd;3bEubxD`J%4{zgHmVwq
z@0-x`qWU#qM#lVH_YIH-V?L}0O<j!+Xy(rHGGnjo6sYBh?Z2NX<_{iAZ`Z#w#(OgM
z(o74*Y!c2K5k?9EMi3m?Xb?*nt}q!Z?zg4jzyI0zS$+hnEl-WppUpy4R*#E5DycZL
z{_+ZT@!9T?t<0zi0Te!1h5`Y3AoGI@T7G`}^dE2`{b)krtp+q-qyttonrqN|?Eg+{
z&ift`x|D!zf28#+Y~y^}tkY3H;09_<9X5hU^%l$*K&m_YY<oix%fOE~^mq;_*7>;=
z@tf$%XZS=5=X+&@aM-Z*yiI&5fF_}M*i^M3Ue7)Ayp8+?a59L;gqTjlSpT+JAg9W~
zz36`ScIyUEZ+yFCV{oP}Cgyb(2Q3_SzlGINALzk-wcC|uuo-oRKH2s|_`_E<C?043
zZODvw8J~gHHjOFdu<CN!=E=gr@Y6gpT3a5JOZv7moAc{>Qx=?PpXQjRoaIJmXg;lG
zd#>~2)Aod^;iFM|Td`B1?8|{5I!L5Tw^RM_b&%&qh}(YJm1xtTc4TR$>`$hsgk_?@
zI~}maGJtk2+VlJ;)^+Fz2F8ro``<69X??5iMsC8skcueA^iR&}@p8wv+xr(p5^DDF
z<?7Wwt5AFKnM=IxkHF<xWUkY#UX0ejNXllweB*zo;LFU(&JWm1?V8@aViNq>$zq`R
zM+#)!lt5ledQC-TeZ25csWQO=+WW;4PcOTvI|>V_9~QS-HPgP&dJqqPCJ6k^D8UvL
zXX&L$n#j4sxkwmn5D~o4@R)>h{-{`F;5=8O%HGo0ZdQ*&*W6h_MVH#zN#4c9O@l!|
zzDj^~E;44>elYScto?Q63r9#Rb^4`_D6iK3oF0CM1>x94RZhZHX<;t3{XI0Elks0&
zcCJ}Nghan|t;Lb4a-EBm0lGp#q<r#9#FfE}#Bj@O6!jdB3yc56`@a9hxa35sidz_0
ze<M;$qyBgENI*2KA#*tmyeSbDGd_u~shj(y8QF~TyIh)oSd(4d)puO!p`fv(lGN;f
zb_I-MQQ@|`cKLpGE`iXrC7)b7=ReCKI}nXM<$^4`qL1&_1fanH0%@sib77vrEtM|Q
z`pMZ>29TxwvHn#h>6<X~(8ZpX6<5Nlo@FU*I;wq!Vxih*R)xxW4n!xAw!rd4eg@L~
zmJ|Kwomcm%S7_343kbJyk6|h`A}Z?V<8;>^dXX7AkJc_RpeGT<k&m3O3J>a)|0!m!
z0JM*Hk}@d=F9%ZY-BS{P`KG2`0iRs!scbnFyf;Lgc=SDz0Jl+*`?1`Z$6M!pHU`gt
zTbWjaH0m<t#3D+R_EzAxvyYQ7#M~KXE0`MGx4ydm9$>eDx}$<ykGtXXm2>F^C3~^2
ztl&lVNv|e0j=Iqbzy$-Y)+u}KsM8dDUUZ^=afn;dSeiZ7NuccARmZgVsQ1gXOC_gZ
z8wb)SQF0XvCXg6d-n?!(G?r?7h$~OPM9L8#4jyRN)zILs^nTahu4l(bl!VX7(H+q`
z51b^{ChbOu8NVr5jY@Z~Wq6?1o$vJD+$29!UN1+B|M5j*VOgww`i-sgE8bj&M8k<0
zXZc*=dr@SPYkZm8QKTy#@ZD?s^UeGTd`PUUu`U)k$owwv*Ubpbq8!KKz9X^Z$jQ{j
zU2^1`GOxu3PGrqLvGFZ${r({sVT~mYi}9NxC$V(>*JjE*N#S_EJ8rts5iMJ3uRplf
zC^26sTZe%s2o4YvG&ecw)5BZPJ74SmeJ?e${x%#X3BmE-3n$6{Lw8lsr**VEN;9Wx
z8X~^BU1LA`FQvOU7~r9v5fyWYPwYv#p*Zm_ehn-~b-MGg<o#X7a8DhHxR^tpxB3>c
zKPyPawLw^w{j8w&n!9#-7scM{TRfh@b-IiVp>PB}f2gYni3Qwg>-DB)r};>0q;kmV
zN%8!~>r$vcytcN+*k}!-x640RKTl<l>#i#}tDbIx@n4h8PPgeb?JlT!HY)HrX1ub~
zPD8bbS{oHzC0*)Kqaz0EXvu8Q;}<C>#8M^-4AK>Un}%m*XYf%MdY4UcgdO(eMG?2u
z<SCj=Ib^oM3&Wh^%j`^r<|p)kM%|6(-4EDYR;}}Pqpy>7&nb0fZTMm}k=|ZLEmpp^
zaGoox=-{j?7W#7qs^NI<`d*w@8w?EQCRK~<$VwLPe4R(8+}<&9_zthR4;niwBjTx4
zQTlol%vxAqpa7LvIRE@lenQz@$}y9(#-Lq-t{7j7jHB!9?eXy2Mb8{-X^lBvJnQ?W
za5FJ$$C;x_DnzRO0*ne0TM9s3E=S$Y5-P7sx>D&ETHcz*wyt?!F;-3sdea$IE)D%y
z<}Fw5k~Wyg!FKIl&qN33Y`M#7rYba*0G)gWz|7%$WWMt8%j-Iz!>x!n4Es;iX;3tN
z2glldvw~aAJp)Fe&xpiMc76|7>p2@bz8`mK^2fMEK_<N*ZsIdSu?5y5#O6T@w==d|
z5@%cv0517*0|8?uz;;`1oU8CHf_b{6suT+n`-Y+lH!eS&Wm`xm;?H8Zob=+x{nAT-
z0J`}n?gHe0Sf3K0N_JOm*jQ(lNe$I4Z$s{Er$)Wl76FQ3>c8zX|8x^FtZ}dLOV<a%
zv9Iak;j@qhksMerU9CRkaf@=nW|GpJ;*+JG>e##{k#$#;+Hvw0PnF>ju>1!~2SrQ{
z4Sm1xdIbH#sdPd3IQ_T0Y}P;-zjEW|Pp*4{*HZ$(QS!fdF)Fm_4~V(Ze~;WkSxkP&
ze2`zk(5t|hAG-luRyG=0J{n*h$`B^#*S`ZgG!wBi{;2`%IZP^5`kJha^PC$U)7&*m
z7lTOYKKxZRf87eBfQ;;RIqH*<!?z}3#q+<FUOkSdOyse}zHgEdHnbTk$^SaI_O&Q0
zwsehd%>Iza1bJX0Am+{Mz`c`h&|FD8{qu@TjBkR=^G4l1!(gyo7ZXyZ@AY@Krp163
z7Y`dbbvz=)P%wJXFh9uV{OU-CtECkgiWhLV=n7<IPU}sKMFt}fjc%U5-sJgto;H11
zj9eFB|A8^6!k>UWsGZ#g!)%h*jA7(Jxl#txZWr=c%Y=LGrMP<p`eyU2B@9_jX`+V}
zJB6@)$)8y^R@T#F=ia#t7?xb0yzB{4oj))RB2wtK0t|*pA@6#adv$3p!nOP#oVkp0
zN!&;nPq%U3DZ7PjArgX=M>r=1{|5d$C&!n|R>C|4Xro<9bA_CV%=J;5@qHJ07p=0t
z9;X7*6Q`rK<Hsc`U!_zPk-%BBHzdhooEG6l*Z$V~r9MDdcmL<}{u*TWZHyapBhHQt
ztvHLbV8;%XmH^wjq7Y+|Ue*@l7Rd>8HD+k{E<n<AxvvUAH3W&Qq88x-z=&TER;wF=
zGSe`u)I=_f=0K_pEMZ<fWrN<nG=0qXL|MU;#0FXep?*U(9{n?>=4=Ktts_My{&&Wu
zg+fsks%J2E_S5%kU1Pv)S9y?y$b#O$ZALk9+SeaQsq8nXBa4c0vzF!F$3f2#eEg7@
zEMgZ$wEb{wh0W;Sez;(}26AZE!Z(2P3Fku-@C)Q8(D~6t3$h}raeQQVTMO{PDgczR
zPYHK1n@7fzu){^P(#o6~po}zmjX{rOakboAB%^N$bNWe)r4_W-;N`m>pME8lz4^0j
zp3%9q5&zp9u2Wm3NL)UIKN-F(e2kj{V?4xAVb4$7((kX%-z&DCDxTkgSG4iilJ38@
z`sIv>QtSC((k#)lr~P`){`Fk%Nlk_tWIS*bHRpUL<;ls<tTkr4-8yT}&)9!jZD=2}
z@Y`5L7n?^*`OvM^xWgL-nI+@Rv!9v=Z(?epB#?T`Dn_4BG~@}wZT0}Q9c$uVgyk|p
z17qEM)1E)}IK-G(|Ej@MGjTTF5%>r(;hSX9EIwi4xRDkE9a*1%PA50WHqX+cY5SAP
zAhO2=1jWo0+Wwlsk)2*~z>uS8F>^jOjub>dFZ>@SLLR7YnFX~j)Of!y|4_kLTRzou
zwxiRt4C~8Eynil&4^OI>9f=o-Ir$@m4A^qnG^wg%P0yHcLp->t3CQfy9Ou8Txd@AA
zZlc}8dx<C=Cy!pR3vvV6ZrILp`R+hBbYOEps#Gg1A|Q9)kbiJmDRftKBD-P*D=vzD
za@ZYH3AeNNy1~)=3paelTdLemuNaIyg^P&m-V_8oE_^r*z=WU`6_x~Q&Y0&qlDoEC
z0Kk8Jk;yHOyo1`Tvn}Sn`cDs^vlRh=Zo_?a4z#ETAay2cdm3AfCs!2P!Wcrm*1AvX
zVm=15$YuBMo8mqE6O_lpiAE!%RTswJ*X%H)wPKzZmqCms{j_QFAnSTU44&(4$uOSs
zZHGTPfJ)?SY{zRVd+1IAxYSCrKLT7}PZ?stCU0I1VYpJmM`2HEZ8dEN%w!Cc0$v%o
znSm{<(|;X)5khEc=sMyFjO4(`!+#Yo#<3?*HR^$@+Ze(|N{Ca}syi@cB~pPFf1_9H
zF5dfI1G6&B4PpS{cBV3@oOZ<74y`fQOCOr_qFI@@i=ezr+C=<=m;d;nylxt2Y$BUR
zGv7pr>qyMeR;@gB)$_M=H&pU(BD)iVesy^|&lJ6B6H(x+YEQy)X*5)w=UHk%EX4GV
z=8WMwbifZO!HN+aWHT-fUwp4oXsC@<0T2z7JqL3Uen&%fmVH1;o4;ovs0HBkk#2*)
zOIU-4v>09hyKK-B7uc~F;xI^ulWL(nS2&+tA@QY^m0Zgfdr!^1XveMjUPc<gZN3j|
z)+!D^>g=-p$+6CVHkV5=5`%2yf`Q8}7Hlcq4VxwQ|LuB}LYU6DV3I?zmj!^T_;p7s
z|I?%a={9h7$Fc0NT2)6BrtO&AAN&*>B$%I^M>Y1W1@;Q!nMTO*bF6iWCY5BQiP_}i
zom}^~+qoQh%5DUw`SAME(Z;rRGQ`mKB1gQ5W#qVLR)q1&dvE`ej2gML;mmdRd1Wr!
zVF0->M{Lc1n2s8;&x&iMCHl{SFy@#U<QQBwB?)3SN9|bz*5J=nTbP=gf+S4vsz?J*
zgZ7OKdhp$EO7jgzdGnK~Q`XOuht$JWl4QqPK2A?pS`6ro=i9R4|8B~1qI-cvMMNdl
z2P<Fu?Y`WI{Tm=qA3m?=+A_NQ)F#{1syjwhx--*`*ai@)f$HD{hf6DAUuwrNg3CD)
zt8S1`r<-<bgPas))bUl|zkJq<!~TIQB`V51v2|0FK&Jbi@xJ#_=zXTsI?uaQ{Rvo~
zizbzpiQ*hgA-0uwgZP~4z|O?{zqeSfDzStGVC-W$D14b_XY7N`+x?<NTnD3SuZOn;
z)D&~3n|1PHEfNvNudx1WH<&IPPHr*pYVk7wb|kO89@yKsHb6n=R$P`oru&nz&e>wk
zdw9hSSUgMc12+a~vo}o=w^=jg?W>m-nJ>c4CbSk>G=lhsZHoWuF_?rXLyT`U>ALj+
zScaYg(qB@~IA^Z8G!KlVnG-RbAi?JrK8uIM*w%%HJd)v)#)$hSOkTXkvi(N9XbK>u
zZe6-=AD6y^dcVJM&voDb_2c$1L3y>Z_pIyPKFi-h=fb+#i^)3e8frD{%R%-*UNko}
ze_T1;e0B%q#K&~?3Du};oUxZxNh-v*9(c7B&CGP_Z~WND{)ZYD|I}Z5??*339)?_u
zY6-8_#oeXf^wxO>`KBM3LO#upECSY^m7I@aN%;uL`nAB$wZ=hJk?h#zv@P2s9-Y?u
zk>or{5M?!<mWkY4u}W+y{Id>ViRtiv^M(aQQ8h_k89)Lk8^S)UtZQxYlp)ENvXoo?
z!Xl>YvvjE_TY1t=>n0vVw%(XFF)QPMfQ1qsh{C0yg?5H(*bvTF1&;+QfhhS|1_b@)
zw#zFc6ulM01jS|r+bb&oof{=&U1GrwZm<AIt~S2S8|t^Zo1`@--ls8{7j(c-L3|Cf
z-5agl41T8Jc%h1S9^#ZP<eYssK^yQNdYkx5b6vYYyym@!C-S1kO@7Q}yI}MWAd?G9
zMPQ!#gi^{eZ=>!4q-$OW6D!74S1?#RQ~i&zLO0Bq0`}vCruobu!h7O_@<dh8VB@>)
zSf_Bq*v1_&rp=<RK-v%7?_M=d)n*#Y-F;v3w0pg(TsxFt>t?<p-MlSFng;0E0hjyK
zu@m(9^D_>`3;;NFXW%eI5lXFSh^t>VdfsWN5u$8xY_vOe>8Y4#LS?_&vwc}}NUP(X
zte>^=^WmyWjdIdpBbY3EbEKV2b|7U-(L_t?rgDvQ&K1eo!cz;i?&dkMTgFV82{aA2
zxd-w_YCgih!-MqCBGUDnw7(}ImQ1AC^LwH3ua2BB@n5^LI^o-w;&+})`!z)~5MMPW
zyC4fGp~TaT<uH^`Eq}F0U^tg$So}1u_04WTAykHeJg<DdDG^UPumk!1$uX3$tujh&
zy?W3G`MwFQPY~!#$vxbQvqevzo>IKzAXgAaw)GSq&{(O$faIA|#29?E4t+3KUv3D=
z9XzsfjuO?iH^WxIsM7XUkq#j{UuI%R%@r*~8^j$(Qvjr>Ytr=Fb0W%ozG>k<nJX?h
z8_!a_!u;PlS03tJ9LZcIUNeJ!1E!9`yCMD!;9s0*N}G{$dV27$Ti8E&Y)H)`9Xd+h
zAd;<TxKjD*Y&=j5GI>%de4}&*Pqbe1@q@>+WeVZeYEMNAK}jpf<oep=hKT=M9i#t|
zoq+T5_DYP~JhsPE5%wqKi~-<j+>6QcR~v}bK$iS^=orrqBun7Kd9qWH9HnHN`B$pa
zOU6!~FD39orYwmcpgvxiuzb+>s`Rc^zhCZwTUWd`|3n*CiOJxzsLOX<r;Zm>TbG}7
ztDl)sap?H2Y0<*PEj<NnVngxf8lJ@fV7Vt8_X`N`X4enRhog($j`sl2GD}wNy+|!C
z8B?;s$Xr;#I+vsjTY>5LNBXskSO=OjJppRL7A^TV`cnNh-Ifo)QLisQIY*-aT&V{@
zB;X&WzzHCV0l;mPfI3eE$cS@;o{)}e1Mltg%TY32o4S~h&|M+Lf{MO|kl<5CpKZ^I
z4_EQ$xIi)kH4q|vi>t3g&$q!tsBNx#^y-nWx3yDG$)o83mQtDmm9XMi>np~f`Ha!w
zD}j&nOr=ys!pF#t5+et?&ridJBna3Vo@uod$ttR%YIcoUf9P}?sHRmkNPYq(p#<3a
zXS8I~2Y;jW6HWTV-HMImYZ!!lUmrH7Zx`%JzT55+e3um5>8oA$Ce-8rsaAy_UKCQ^
zAv9v$t;*aB__pnnCbIG4DcIg_2vthXM$&lmH92dE=#})ThkyAxR2ImSM}yLO{KCYe
zk}2_H;Atq}_L$3F^RBi1MhMOrONi&#?|gFI6WqSVMi5&==L1|ofb?+k@grz0(XK1-
zXWqu*L}Y-z;}K|w%PwL&&dUYe`47<bY{W}_4?tjpWdDnKkjkWOY*cCFxBe8Nw7;yi
z!{=sU{$5VnBhMiu_kA2dkW)^IRX!|@Gnc*4@;)^Fp%#OnIi>(J8o>Sc1Q43M&OaBk
zw1I6JGjVPjfYNRoYMZ4MmO5i|zCI7_d~pgYKAnpnvH7+e{{2CJ`Rn^m40GopSS|~p
z`g?Seb^!c$w$lL;BNat4gt%C;@krkJ_;40TStu&Am8p$4r!Na^aEcY^4P|Zi^_+x7
z0u4V`sKxhG!^xfd-f{&1M=3ekRea>hcI9Cvt>}QIi+4|Bf#*!s^%to+{21?y1#WS;
z6ItpK1dC}}>e<*7Kz{6qLVQ2V6HZYsjnTR)t>$dMtNiE0j6I`Ir0)d48fO68DciR6
zNFPH=$pK(G1c0Ae86IK!ONR9;O^__G<mR$Z`vY)N4J7`J<5cL!z!9FC+e=LN+@Upf
zdF%5d67`XsivO3S`IV!<Z8%0WKtJVB6G$8~9-oe#MShw6WiguF^weNe9|-0ljkBW+
z5f_^x&FL%)!hj^E)-Y+XtsP~OIDT5L6bU4o#>ff0z73(Cc{JF3k^BtcYgk%}ruaG@
znYM{rvU|KXPOQLfm6WdzS*WoxKqqxurmN=MIFc+_B+y}5NQ!~knpE6H$zZJBvL5%y
zdoO?nGIbHfG*ySzl_mY$WnA33FWHah$T>B{n4OPObO^9eeM7)61k1I?Py>%g=jP07
z1jtaxbC93Vr0*t8fZ8|ID4Pw5WwdZdJ9J3Y9EzEeK3#*D3%+pe$u0G=X>1h9CINr|
zs<dt&SOrBxcd)L7_<0?qHwN$tJp&q2j~=0e)Nv^EeY{Mi*{$F{->72=1Lyg^X=$*h
znm>4f3(S;&9p$ta+f_?u`1y<1oTapoLTrrEngLU{!#t63zrTw(*F>!B(W%B>i3g-U
z)%uKz9Pl!Iw3esO!ifuW=Us3G@*T(b1J^Ky>4gxaTr+ulZWzS9AbCW~$Fn>y5;%%a
zvfdJXKM0t-(0h$c4Z8iYR3wJDoY+<lrs;s_u%r!Msmd^&*y+@>@xPn#x)W7I-($Go
ziR>M3kbWa}gMa#0z3ddB91)Rk7>a=tdH^{NMUZSu3wIdf5k8?)@-8@^BfLk(fg9b*
z2tZvPOlSY|nF61kFN~h46{w%%QYeQMNLljA$v;ymp(Yy&kFXa$4haofcgNxQZwjcb
zd#ECO{!?B>1jKU0@5sAV<0W6d%tg#`<AH!cD9b-ts(wN}EM0MsdOTWQYtF{2f4WM*
za3rzPqgJ~l$IKF(0+YLX`zKELZA)R9Xpww(j66HS`5zOd!6sNWCYg+Eki);+D3N)=
zq64hknT~HEmB&CZzv~oVyY_X;HD0QKiUU^#S1E0dxXMw`n2N5Ih*mXOUOQ@F&RbqV
zbe2%utL9jLhV*nbhw@n&xKW?0mRJ^_!^AvQP@y{Swc@zHwY>3xU*!pDAQ;;53$Fl7
zWSJrSwMXw~(yq#)ROi_zP^yB^YX$r1fGTm@s(65Cpb_e>s-zOquR{Tl2dE=oS5cL~
ze_oqZoR_-sV657>yIZN+G}sozxR^!{IGLXYnyLSsP$Hw%&_hE`WSr`!xDUReyOQzL
z#QOpre^PdRMCr}+Oy9HBAhdtqrX1E+_K}pQcw<U^ft1mqS#>Er>_3*qqrd7^MlE9Z
zk<oN67()M(AdzR5DaX3+MACt1QnLJBAeqTxVBf(QnR=sCe0rre8L#WLhEoEw@%Pdh
z`Puz*Cj|p7<rg-g&WTgep#Ri?pzP7@n?%>2j~Cfjy>?ikZ=fztEK~90nYnCh(`6;X
zvkL$N3t*7`|9hC>3xD90!$3`MPGmKIq9}cq$&vo2yB-?PQy`!fh}SbhW_&|bb7RHa
zdyK5<+(SbQj^pj18KP|W8Wn^seu9JTOn=CD58L!zg{phmsOqHZy;hG)s?i+e3w6I6
zK`94@^0ddNbK|MKVn~kRpi#{QpQzxzT(Rt!*R~c{f3%=tx#)~*&0O3e5=*vatRtJO
zq@7=um7Y0MCaJsbJ-W2eVFxuAVig7-#hvCaWPs%~i?7}i{gKKwFYjGS4XUUfRtHC3
zF8=HR4PSo)&cvBV2X^!pHx?f1;#3(Z@Uz=2L@o*y<Z<kX0R0H5f54-m<f=Z8C15V6
zk=5*8b$@qzd%m__VaCW?`Hy>@bY|6W7{Dj{_vhPaN1ztizv_2u;mL!IS-w`ra#Z?_
z6Njr(KDloln*sM)vObFcj(MK<>n<wIwd=7E)nF+@mxne}8*=e8F<e*|XsAg6!j+dG
zFK+6ekEQyk;QKJ2WdO}pGg4jbuvTR_uE?wGq(9okMMOF=krxZ@r>Z{t2v*`3o8vAm
zx|_Id`w7INq!mM=IJaeE!QDmBcOuSI=~i-vqg=pFgWO{-=eN#owUIR^+pozWt_h)o
zB!|lVB_rNX%~r++AA1C@0pw7YtYYF@-V`qAnjF6+^ESyzO_iw2kGzaqKxC>Y&A9rf
zoIl?q$4OF&OVWNJQqYV%8skmVS5^6phoW|E5D4+|g?RfTvT;BF9KCx{X;l*!th5gt
zl-&bJ3(83g{=o7m@q{Z>e%1e|benzx{;kB(HYA&by3HzkwEmv;@yneG&xD348uf)s
z@PJ*ktIK$%A=v6?mXpG#@w528Ngxa$m;kVhI0#IM<o18n2E@)gXOi(+Swk%IdZzE(
z^?KxNQCT%)0=5yQpMg1K2eY@V&>eH)1xtF9lPFdf4S|jzzOSibd2l@-pCmPrUY7xH
zzW$hQe2cB>R^q4q2=04w>|sJ8q(4!sB)`{vrsn4O*G{b$pw5PzT>L(@{PtOO0#9~O
z@)94^_;>bfzSsz1+_HiFpfpj!?5-!Z`h^P*UoYUkONS1Npah`Qx^qS3)z!#b3N}1_
zB@%aEw!}Xy=&%IEzSHFDn#rybF$FNYxBEVSpp(5vf%-W7kVDQI_#NSa{^33gCkF0_
z02v<xMw(D|4l?1*8MZNS_vxQejQL(#ez@S084imgxvg%&I9^<y;K?iMaHIAmn5$&t
z-aGl<i-2j*!|RUm>ma@sNGT5iYz=JkV{*^Aw|H=AQDGZ^Fq6&C=PX`dR0UURq|U%E
zWdDunowoe#E7{V7w6&LXA)7Q0q`o;|-1RE9jMTL!l8S8P<e0De=A~O$DYNXeY`5+C
zkWzM5`jN6VTROnP{_%mo?nz!>&@+;Zl|bG0Awcn6#5LbD`<a?VuGcq2BveRIDFruy
z^Tn<}ivV>oUyxE_z3QC-C%*`Ss33V}h1cFfM^Z21w-bWImM}ju&+DOSI&dzjHcb>+
z0ptxhS*xsik|Mw2>VKfoeVOog+%nBW35#r=*uv67@Dj%16!S~iX#bPY*%#_dUzzK0
zhH?T#jC3d#=SWvT0#;c&cc|(R0zL22uN7~$dA)A_o4le+mn@7U>dzyfNXy3=LJaaQ
z*poiBb?U!HHL3NK&ExM}ztO}M;i;S&wRvJ_MF<xm<Bo2E61zIoM-Je6koe|l8hqQ`
z2GV9@R<4H*N_|(QXFrpdK^MQO_juB^TluJ`M%eU@IfC7P=79=qf9Zmbe>osk=b6~G
zQ|n3rNH`b(d^dsOxYDx~bd_l5sP($v{rBt%o>Dan%4i^*t1%u|c>oYdV`W*{C?k=3
z(|W;sb<g>o_Z~9YsjM_NsyzbOf|cJLNZ@#hz3^8NrRjS09vv`p{V8KDN5$^2d%pkY
zHHk4q2k8wx1!n$ytXXRAs0m9JDXvn%gVfZP=lD-KEBjDEZ!^i0thYNIhI*CNR$#0C
zbyZ>QFEli`fKy&NW#1c}Eqx%1kSFhl{RNw-iox!1#<%R4SFoLIsLMx8#TKPp4+k__
z8#g`YJJ4pob|<#rt!;*1SLxK_#r+aXv&7RQA$sr-!bWgz%kA?L-ECW6>Nn+PsFUxx
zaBtrTonkuGi53uCJ_xFBFT3tKD{~4t{$ANWsGF9Xp*$TuTeU>5SUp-ZjR|A<ZK}@u
z<b<aYr?E{SjoP}D+f?DMoEYK|=+0Ga51jKUNW@a$4)Ba%o=Pa28o2XqxDw&T(AtYw
zW=|v{`OKyMt{<xbBN7Sy>WwduyAcQdKJU5v0My{j_lrB40rsfRKE^c7TkA9M0+oAu
z-F3!J2)A-gmL}QvH(gddjKSV=;?R8_m#}=X%Kzz`4M%v+c(Jg!c4)2T2A<M(;8!ch
z+aQxw*Kl&glbsM#JP-&7;~N5D{Lom5DL_P@kwX3IulW|e4ODm4OhrCy?Txui#adg5
z=zOPo69ad;Mk>bXyPBgH7)Q_RT34cmV&ZoeR}$$BpVfCfYkBSgq!xgl<2uyMtz1*s
z;qao9W5!{ALhfK}uBK$=Zr&9-!p(hg;}k|42&JJBhROxFXLG8#7rVLij#Uc8dA<CN
zh&XOuZEM~Z?83Y@??0AcGy02^Jh8=#{XYvD0M`}{t7$N*;Ly^0w#Y)*QWM!?Bme++
zm;Jp?zLmkAb$`|);h&>5yip1v8a(T1_AgCtmTeR&LKLkj;3{dlIjthztwjgdYSt`h
z)mqG}DI34&4iN|dhN1$)mEJ#Vr!tj6_T3useHKvWBb9jA<0~G`wTmlYkDLc;G$f6t
z1j`kXC}W*u9UX*u=PB^%^{&Bhr*+t1A@}}tgf(mn>O{W3SSZD5BzOw(HFJ+Ei6f}d
zsC>)(@wjXD((&q>jzUV@5O;vr<}nur_0{=!ppK8@eqwOdIf?vc4WL=pJ~5^thsu?q
zyFEock$3BBfl=$)77KmO9>17;&8*oyHz>+4*2FK8e`ViFJbh85R-w)$%b@+5K%aG%
zj^TCM$6ZB|&kArHo6v+@J4D&9MNMzA!2}Htf(^-a#$u6XyNNaQ=!I(7a1BCYLc)H0
zG$+&BZtbSde7-I&SM${lU$ru#hW+Zj;@GVkxGN+&$rJNgt$Gg^)d-KQ=Vj;`93hUM
zogyv2BVyqG2u;V;(5YZ!l-;g?Yb(6U?V?n5S=M%~Y}x$lmo}2NTX}Gzve7UVnm|t@
z-Et7Rc}U9mpYF=Kq1zi~#iEMI(R&OsSh(HP;t-{b;gMMUZUFD&u;GL%$hNb&WwDv4
z%`3SgqjclZdcxvmtpes2R^>~&*V62Rv3KTA0&-7u_1;`bb6K?nXNJdcaHU4?8SN@k
z4vzWbNC>(Z-(8wK;L&1qPj%oH(Cu?TaOT9#JP+I~esH^_!ZtAzSikV2K*4ir06M1&
zonD%Ms`daPm&%<!JEPLscj{#DUPXaM@?%*cSru5b51=02`DtXj#`57hyxRa&U(_|D
zBdxl=jMv>P7CW4|zTwL^6sp*!$kWXIoQ!5!GM&kQ??jBemdz^j+^^2SLj0qcOlkwg
zzq0z*(%7ypo?V1w%EV7~95U12G6&aP2CpHhgNG@1wL!txs&{(Q7`XJB%<-G!v&8F^
z<D095(7si6;`jPYA0EflSA5lAmF$m-Npui^w82r%p5nycYb%H>S2irTr94i)_If7%
zjOlIIeMz=F_1-Q9?4W(!NG@aA<HkLD8bWu=XY$28!nSBo)qbb+Ti-9+0At|^SAE$Z
z<Z8dsmA%eL(%SMX%}?|G3+gK(B_pndqIYzZ_hUj{K6s)%^xp%rTp^kI+7)c*?BLhT
zJ9FuCi~Ml4RF%Ppp!lND8^+?OTLgUb%Tdrpbe*GVLw&?)>!QT~SBr|pLi0#h->u$%
zp;botXL%12Py8<m79P3oMyK3~5Fk%=@!QIBEg2K%LXHbxu{g=JgAdBO4fl=Kw*_un
z&<I(!1R<y4&^c*F&tdBOJ?n||*q>VngTvtmP65m>=*4QE#y_a>-(bC*yjh0MwjO^0
zeYIx2d@6L1{l{-HYFUS&_~i2U=B{Vxs*%z&T869Qb;Uu_admOGstOWD7z57G;JCj4
z!RLvNuRS?7ZwzssIV;aSKRTOUAB~yaJuAs0pcHAki(;6mCD|5Oah@Z0Z^kHa3s<z(
zbS3x_(Z%Q99+*$8b1`08)VC8g9|!f-SX)xWZ{7Oj9gI~6JaSSGNXR>ANmTh9pKly!
zdtku&BE#fwaNS6aN4)v^%MfW)a1Z})+jyRx0KmDuB_A4RRebmGjmy=liJrDCs@A0m
zro3RDB$8!s`l5(XFHe^wYNo&NYR-Xma(_VSO-ETTLy(HTUn3^ZvIf!{x|Khhu-E_i
z*6QF!+4m7Q+kmo00F^8t??l&7j(lkr=11XlYz>+IM+y?>kk71Y^w*s7F+d@yY7=7n
zalVQ;(*`ek*j}%{8211BzAHTxO@#BreEK)&chXe|oadH+Yl7Pf-+U+EvUDBROWtUw
zon}#;q)7Rq0}*NWKm?LWWuZ5LQ9%jt=AssamS4e8d#tl4R}|gc%Q{|ds)@=wK3Zt2
z#Pvy}iND3<2VdR}H~npr8!L;_OsAC;l%YMm=#rOiO>15~?%&rs64GM!W4G|2`Nx^|
z9X#I9(AC||NS8>i!f$mx0TgnOSElA_5lZ;ub!d+PHN_lj-4}FVH}6w6BXEtobAb+6
zC;JEOsx$YFnDbBc<?pq8$!3|&pHa78Pc0P9c#Kk1UaDM`vC)F{7(o>-W$^~M`X%ej
zTEt3Bt*$}3OSd1oY1`H>X5cE78x@WDKQ>K6h?R2=wLw_S-6USGrK#Zo#@IV{R=w=4
zQ>{;}ZDdIhznQ*byzu5L*NqJk{pXs(A*ioo*so@;HOn#8=>tVZpa$%`SjPwvoCvn>
z6zkU8s<vG|v~H6fTHMGV&x4EQp}dujYek~lyyQBdsY+B5zV60%Fi?der7l2r49H|-
zUD9qz5%sdkZe5wx;WpY*<S%~Bn@fHqQ*RqR^y>#$`JH_DtLw3G`#R&Kx#1LH;;|T#
zwT9>YUuh;5(t)o^#Zi8)jA|lcZ2MQvLXI8L;?WN~c7Ml1P6Z5GpSm2JRLMPfZPT13
zqQioMcdIkC;?YcFI9H%tV%iekRUAoh`x56z$H#Ox_S-1Z^6S98+DYiFd|_U!9AoOr
zDHtg?XWvscs9)N@r{A`g207AtQ#*`aQOSwt@}h$|&t{h;31J<)ERoQ-c@4$h^Q%@x
zCmP$9JOS)iN8vbxqWeRZNLu6B-3?$c>~75qiAs|{V|Hw{y&uX5+w<o=?8HgU6TM-;
zp0y-F_?PXwQ?JLcy@y2|^TbY&+|#>_=DfBWk`tK)bX#wdh2<0rrQ8;}3as_bUB2mM
zq8@R=><0j_`yIQs8M=aPYnT$Bz*Hut#`(3lId$`SZJZVk?!cey9SwiGs_){Vf@{pX
zP5)Tr*qp_5*e-i8{8eU&%Olax7Da7zQ9-5!(jF@bYl>rKOcS@i3su!T8aw>my%YcP
z^b!H-_nc7LJ%9{g_k$-q<<Q*q1D~ZIV+)srq@)?HTq6@0%Fh`Er-_+lG@HD`xR^_6
zWSlyE+HZ1wy0)Go$NGP0-ucpOO9uN|)REsvw~~ATr`XT9-dpHtLnIBmHC;`%lja}X
z?b}9FtnOMXci)*IBDFiqc1dkJ7Nf=*B<w>hMy|E5To1n9-YwsL91-rTNE+Z6u5j&Z
z8B=|yuIpOH9OxhuJAZU)Bhy?vCS}^oZ&eRSY>$tGVtwvuzE0)wVxXm`Wq2egxw!aW
zRHbO1=QKfl4((KH$O~A?vA=50`5LXQ^Ow2b$o7DDQ|htJ9}<Jz2`t?$vyv-OZKX<i
zZsXmzGIs$snHg$UGtZ%uhD{ZCWn_v4%(0gYzr?}}nkstf)=^=L5j?Qo#EkdDn+@+C
zJJ1RzmY8}~)I&D64_MSBwgnF14CgLc54EsC(>-s%#wX9+eeNBB+froIX}bgUu7Zy5
zrhDRA32cySf9@Q9GRx@Nhjk-PU~^H*R5<Heig%xKe=FS+Ow+WnROXbbyy_n0j@p$u
zA}p46xpZ(cm#)z`u$C#lN?DnzGq$e@-uZySd<g*02av{7nlq+@4#5};RJYsUb!*__
zRebTCqn2_Dl!~jdIrzhcO47it6;bicuXL;30MY3;ex-8DSSjUFLle?5nv>AEJHt?J
z2z6c*bP={Nup#2uSv6R<=_4$*8Cvv6O=BfqrGPEgtS+478=8G|eR(|dLaV5vUX=<G
zRo%^=%3}g7SMq$<L<m2%Cbs(M22U)k`I3_EZ@6H=YF=j|T}AJb5^dP8gGD?>{Tpkz
zo8D;?(6Z?+*JMz4({hRUTy{@=7lAE8A?^vu@(?$0?Ab+LMfS=4f<jn*5kav(t19^$
z_eav#kHd$*mJb#2#SU51Y3IH`5&W@NqvBO{X89DfxSK(1IQA#;mSE*PZzPpxIg4=O
z%8?Old~d_STF-FCp!ojzJJN~;T@LO2=}ALIH40aX*c2I*{~w5L_5*J1SybF$zrAw<
zkMT)#FSSJL8C|G6=z@{)Dmt*ooR&~IPfMMu+vG>|L!_kZ9VEZovk7=Mv%$i^WS_B_
zk}%Se-MZ5-);??-l;2eNVV>HQx$>%YYOrut3Ay;~DBK2zg_V|V?>M@MqcTcz<m4K8
zw{kYz_$H%`)H1<#swC}HX)suGS;U$mNvCdej%S%LCqZKEymDdbYvy`wuu|Wbn3w?g
z*_3@tMCER6vSMfV^7<}xxXz@B@Ejv_%cxeC%5e;XV@9KYC$T1TRACeb@!ZGvB@74x
zd>ZouH>?gap<T<U#<5nUuPdtnRBBD2G^g&0*5YWMMmgbfCX0+#YnD=*)MwgQ-}R%b
za1h3JEV51v=mM*`edo<sK;1>73=P}Ym$M_0u^n+(gH&*9_hWd%=RpRB$1-j0t5pw{
z$|!!CbO_mr*+#LXvCT&y8+8=j_v5IYQEtG55SMuhb?L@xEc%R8kE|K|T08wtD}zyV
zF*&<58QUOV2_XRf8@fTe;p^NP+G+8wWP0gl`Y$nE!#DOX9~L0X?E^0z#+aS;!(caH
zX9}Zif?3L0y}pZ@_5hYUOZ{HqsQeX}7938<sn}*xJDO9}+7R1UyRgxxOEF^~qBLrr
zE;eiE%BaRQSjIYi&<z{e4hc?imGhb)!Cr1VBB-GTr#+J1npjKi=lSA(a{6db?D5yU
z$f|&kwZ(@{T>iBU=|)FW$_W6*Ljsusin*+6z28^0MK!1Kq!k|NRxKi9A;T4$YQjC(
zFO`_sIXIGNWphjR#^uHm6vTO@YCo68evu{8Ay(^p8qcQL$uX$W>B1&sxZ-z%>@X2H
zs5te&L%O=xbTt0Wp6n0-#f!dPzW?p&5xBU{X7FA?Lm`5nC*2ZWQ{`M@zWr66ZtN&x
zqUI{rL~*LecoAc>65Uxp;e;))$XDFh4`^SJGIyqOJZmZQIw&=+m3xW6lbx!1H@Mmx
zCNR_UskW`B@tVXnU-6am;j&YoTe8H$4z!-rvRP9Tg%0bGlyGK+zY+Y+J<rv`kUoD|
zjjU~hpj7qo*PO(SI)?-LyS4)k0--_k5{6Y77)tdjRN4Y-C}X$#r`=24Ux7B>J)<|f
ze&*d>6^XO7sw=R26>T0f-V4|kM&Skgtg2#JEAQi9^=MuH2Nk~guA;gN_K;$*dJFi^
z(xAib)||oLSkV((_Sk?tH=a>u`+D|5TB$@1*p~n++x@PxQ(=!aFX!Knh99uV$(Jf&
ze!!t0{*zYinj)gb;eC5H^vn_?wBnbbpk1i&r4OHrG2{xa&&cO`<$;bjuKiDd$VQH$
z7pEZk&Af$52ZKzrLQ?N1GDT3`XtSC%p1yYXgGh&$adiy}Bc^o)??e=zob)n^VLCxv
zHezl+h!?wV--4i(9*^=2^afiGwJJEmA8BROoZv^*XpzKQ&Yry>BR-^Et@@pG29_<Z
zCDc+anHln!9<VP^r6p1;%jY{|L9bTW(@&<}-A4*ufL+jB50r5t<P4RGNgm%>I)`<=
z^1V$Md~+!UdW%?<S%31U;iFcDDPAe7*20_tt;Oc=iuDxx*?s$%JdVGR2GLZ7qeY_p
z|5(m?=|C?wQu#Z^4#X_XiMoIUDSaK+mLi87i^|grlfqZpR4tVY^>r)a1%G${1lI&>
zv@;ykheVyG==LotQDCoXTsyE;WgK}S_bJ|`w?a4e0yuB2209|+FNE_JFHPfZj!u{G
z=?yu3Z54G1DMK203;%X<auczbruj2Vx{MXp%BqyrRHQ?zIR9&8ez(7*Y=48T<|btV
zkr1G+F+yz%ELuw^(|cU6Tn$najXdOnA8xk`)3=7pFL^&%$qT3E1&VOUJK2p2g`~*<
zR<tR~0ZYh|OOoSmQXWU97{T_bn%baN*}q2(_dp^A*fr~sxpb!?piLs~0c%ex8db1@
zvj<XrUzj6YCpY()dn&xE`AS0E2e`q;Ev)ayeBcXAVNFRd8jp}0eTMRb71n@&-h%rZ
zdyIuJsq6<1GN;d?W=q1-_uLJXEb7cm-1lASk}Nx?dp}(m&+0}gkjlotNanz;ApH?@
zXj^KS^^qZ(E}L8pOoX<3D!QZVZ;f)#K<g6;y_(IB&g1X7|6uxl0jnE(o_2moh2Q5N
zA4X=w9NbwV;`zw37Z}ZSeKD6z(-l*b#}L)x)9*1)NR{+C@PCU&BS7v~2&jJM+|44&
zs1O;v7Fs>_K4AUWA{Xkpf7E5CxT;#Pc2W^le8b>#oXo5y>q+7xLa)Y*s2`#mtMCH?
zVDYa0{JZXpr8o_25tVtdYV=SNI>lCPyDQq=PaA7-@`=GuC#1aSfqOSnQ0w|d!Z94-
zkNvGkDiI)K<2(1=RLE(z4C$OKzDiJ-U{s(<Hutmt%0dX&=jF0FTV98mRj%^2=E{V}
z`~dbf8JQU14KEL&1U0yBnyRrG0w^<yHm;;7l2EcYXmMPSlfu!Ec0Lb-O3v9sT<4VZ
zG4ALDNrnrTz)RBWU|qEi+0y+EU=iHmymiKYbVMJMz0h4Zk4aBb1hHxBIV8RX7G7)I
z#w>BRt)FM;I`lZYIfzwN?y*JCDsDP=#$gC0a}NTY<*{u}-oCy>ss8JQXvg}Mo>-Mi
zbfCgwva0pk@t5z8Xt~?6snGA>1Q2a7W%q*X_)_Wt{E=DkL1nggsHkMepW$Fbxob-H
z*eLKBM_$1Bmuc={9L!%-b28vkju@89PEpSuZ~PlGs-fMOvVbzMwTdB}WQ}Ky$$O?_
z2Cvb4T5mj+W5lg}56KIbLUXNS%32Xc+H@LYn+iF}Kjvpf&sc+K0ig-aT__GH(d{xH
z6b7t;AYnzHjs-UF+!pK=$+t<%gGg7<K?F(~0gph3-(1~EAe_F|Z&z$T8!3KlBvy$m
z7G)Av6J{dS?h1h#(0viD4<u32ycGm@-LRV^THRh4^9ojd)B=W3?UoPJL@ZiK3jCDc
zS>j}E_gyGRWocBmF9ItwDk*d=W>}9!A;X$3U8!Qs@&ZS3Qh6sH$C)2J$BLXXHO{nc
z8h$-tD;m=!qUde2*GpwRhG%R%EZ7moL9)J#VN$w3<1AIPQYC;wGDS~^!uD6i?XK7V
zOlkDCR+A`39{BYX|MAfuq|$xU9XKVaj+6S4v?BVMkON4V`J;tG(xLRsDU~dx#_Z9@
z70<3?m7ftno_~D)u~SNS<e4^Y-9T%+JEx_L$4Vj|$oChv85EY3()*skJ@jQl{>epF
zO0>e%D<P8mY%vc2OEeMz_ixZv&iycHpycbi_sed}>nJNmScz1l;4jb9(B;Psd+CN&
zn2v?Cb+~PRqUer+I>JC(U85X7tCr7YtI_A-L?wDc@_6_rQy>>%&Eoh!G+kv_(`~p%
z1qnq3Mhoib2I&-#jglB_bV$jF!AlB5I)qV<RGN(#-JrlgkrJdw4QY`sDFu-;&vnlC
zec1JXp68BV+&8BH`4*kDO3)Ei!9x_Ac&$wOS?W+hD>Bd|q~z?rHrKjY>;4h5Ns=`?
z&Ts}`tnA4XetJJ#u8N@GDE}nxdECYyM%Wiflw$SZK+t?iAhNlk;>HXR1mv>(VD-c7
zB3?Nd)Q`zT>C|kHV6Aw~y$cvwbofNtox2%Q$g;<kiWB|4vqxEICAQ-J+HbWb+PoV)
z<KKLwtrS=^@Tu*sk!dY_DDP`0M6ndDk~4E);P|`1cO?a7kGS;zPJ82bUtU@vt}JYI
zQUbclY%8l$oj#JjX4SOFUe?3>|F$v@Mme5P6ac%YD-SM&%MVxA*<j@5apYX6sLY5-
z3Z1uMD1Lfw6sgRiFf0-DKd~6LF{;V0y{rr46*y4xCu56(B<8;E$GNaoN3%V!8JT)N
z+h3FWu`cvcrjHRNlmUXLY$sB8w3OBRWUfhn_Mk-akS^b-9P5gY<3qU*OKxP+7&sjo
z{MWxs%1GtqVN^-AtS$g+F-dh%F6$dgf#AoYRHZpRJC90J=TgKMyg%gsq?N*kGOb%1
zIi8cA*}`_B##r{wbrp2Hd#N+Cv;tORY<tYVC&kqsL2WPf_uDITQv1~kgEgmA*)|3o
zoVMKHuct1_$zE-CtFJHl`#0MbR^4|yKgd(q=rMMoMm0TaA8j7O^l9qIh4!IgOL1c+
zH;NR?Xy;@)SXE(}+Vr3Z-0Hie;^rT=pImJ1o>s_bYXU@A<{Q_SCxyx{9mJd?W|;<~
z`&Ac8bE-J)j5JOGI0n$I6vYB<mff7RZL-NfQbaLoY)EpZ1@Xu8siUUL{NJ4cr$%u`
zY0Ykuc|fCmwRKt&z_V`cDx^F<U0jNxwEmo;R?}Pe&Er8cwkE*w@ZIa=GCUtd>2FbJ
z_i#{1+39R=g;1Bzk(0SYEdk0}kVo^>S38tDZ3L;2d~>kGVxt~cSIwrr{VC3fdQN5a
z47|QxOjnC;XBxMRppxRsRX~SsB)uf4%rzfYHJz0y?Yfx&BA)_41YAy+K6mdkF}C6Q
z-@mn;nexg=--(wT;_J2f&9&=mTx1G24~m>tFp-}ci=53EsnG<SeA6PIjNObX1K)p1
zE7xoz4bpF?!rIs#FXXp9^epP%_+7!rfU9;AODBGw9NgC1HLgvS$^Lnx8=O;{+9SGI
zB=n;%aaUemXZJJH>h_fpiu<d}lPfCpp>EZpld|%QF1B_xqef(VeZW<J@+t`ygdk=Q
zw6Bc70KTsSx)RkSNX=zQwn~I*RnJXmyboZk%i?KeDQ}9W7Iq^`f4eCc{I^R%?FP!r
zdAHcF@NQCkmIRqpPYK-N!?zNW#O!dZnsG`EjL~|-o%bi)e%AWI@tNe>H&=F^IFn;a
zQbCZ?KhgYO2v!3Pl=_p<d1E)BDP48`aNrA`Bip?CdI2{|$7pi1I7+XNPM6%B{9Wg3
zu$ZUW1ovmx8nF+x@3M5>m~D_a3&@YZeHno3dTl<Z?IjbRxMId$^(&a2WbLQ}MA|PB
z-n*I?R~0nN6Z7dopn+wb##xDEaSOi6b#jVVbj@m14&-8z74eq|M*6!7TMz5r>3(}*
z%iIKMUvZSU9tXstbO6+hpAG5QE0Vw(8fXaU)`IUA-tN1$ayFBj*vSMVE~IC~PhL#W
z6H}9y-+!z7(&Fbpf5nNRD->d<9jC`kQBJTBON@xjSl?`-(*mKyEv)cLZr>L?=l|2v
zX5q`T$zhKZ54&k6j87T<SO`ulD@Bn~)wQ|(KdfXpf$3=1bY5kCqm_guf#q?tO_E`d
zE%XYO*?m%DrO);9_sWc%`8X9cRc$_oj*`v(WM%FPMnPQEc1M#c44GAmmo<VkLv_~O
zY-uz3>6?2sL$`7L^I#$7kuR=-ukywaM*-m2+iA)j{NC_5`{Uq?R<z>10u6}UGJxU5
znl$O?_$_b&iS#|yqh47KH>tTs6S^w#jq)<p=1_wh2~jOdq`2|n?^g7Xmv(XwJ=ow%
zRU7j{D6m+<Vs10N7I!XqcB2U7!LR-_z@enX!@sUfFsih6>}!t?%1fQ=6^&cuMl4yF
zmt<$;(6-I3g15Iuzqr?E?zISi_^;!&OEJ0bJ*wQ6Dsuv%e)Q@uipTGo%!O@$>j#>u
zs-`0?d<MaT=nJ7pZo38HuEc8Oa_6mzWod5tH98_B8KKe-gk3QjN88f%Xv9jZ>U@#~
z#bjDQDyHf*^v#AHbAbN@(dPM8ZD9?IIRQ#I<G6bC%5fdN=KQ($6-`axyk*_dUcL}d
zPWX?H!L1HU02}Klz2$^hOqDXX77M=l8Ydk$@SP*6YNqdnqR0%tee>_sVL@ckP+kRj
z98mZR*H`MCd{_MvK0FwG)((AjHOjI7k-9X5nlI<P*!yD>x-RWyn%3m7z}|;K{byP%
z;f<(CQj2#EMWU}QrdDc5utn{BFyqnhA?h|*AVnvN!+BkxSSJpFQyV+(vB<skcHN)g
zfeh2t8{L}@R*PVO2&DaBy!D7jhigsR-dIH&z<9q%pi8yKY$`xBf6*!fn9wW|9ewiH
zB48_s(`f87E(!8Px445Wgf!V0*}9+IeE9%fFBgYNp+OuvP>0cj*sY;vAP+sYwHXY<
zJk<3YY_OiFk+u4|<dz@=IzvzgGk$o2w{_ob%Dj0?ic398zYC!!gD6obsKUd>9yF!O
zV4T)@WQP713<toil?GV}e>b9RM)K)EJtV~0;pqJ7z*%E%`**2wIM*uyWh&C~!?}+#
z2DdjWh)8wYBRq59_|<v2Q%F2hMz0wLZYM3G1qesJNMf`#hC`LT%Y7DUaytXBu3&>%
zJ{^%?T?H&bW|N);9yJ5L4yowkI|kYG-zZFe6%YAe!==9tIPldWQei{R9_BNkBmF{$
z`e%iJ@qU<JnY7oa)ZLb3tlp(_3Z;N6{9WDdl6C4u>$xPv0uATC=M6Bs@wIl5^0=NJ
zPv!g998v*R_ZzX)cuJUKqLweYSWkGQEZ-hq=))R1Q3H7Ze?KGR$i|z(%rx10Hk<9S
zp~nPQYY~?Za4)M;5C&e@hrb-o7vMr=(IEKtq{bDNYs+BdSM157hYBXEK|`oY|0nRp
zPkyFSa~=P&NAv0K<6ETLl^*ClXi#VHPw8`;)zyY!-bQ3**lU}ha>`!)!NhOVJt6hJ
znL`!R4jP*Rc|TceL<X89%UPD+9$qp3D~P{@7+7b_QI)fq?f*Icb@D#$@)H-bAWVPy
z|L7#^`^tMYhciD&%a9-3l}_;)Tr+o(6;W&VLYTM(r#iv!k=1m}sAKs|MJjq#x1Svw
zjo=rGqZD|>Y;*KER!^!{lNZ>x8lmG3%W-2~9$rUIu+u1>46EuQwPX;s^r`lzhHY8b
zg<ORIdiOk`ZQ;KB(@SutezjyMD7Z`iUznknt*YAjOM*v4Kw+_8)}foFI)Ib20|Kw9
zXlz4OfF8g0t0B=b|C;-~FLDAk=ni&EOY=XjYZ=BE8nHN)f&2->YrhsMMjDz?gC^ES
z%y!u4bi3(I$xTd-Zr*>yYqT&!dCMwQLv=~8riu(HqMHJvIkfmiP~Q1G6QbK=bmXi>
z0n{U;!?ek&eEh!e;Ol428#pAG&eAj3;i*ZMY<r^c7WwSy%L%C)AH}*&$NR5!l`I5~
zschrF(^f|%M_$8w3t;+3@RxH=oYxv570tvu>~$zDDN0?%Ux)Zhj`p~=si6PFN3Ve>
z$$3!j1Gl88vC*hGt2%C<?L*S*ca3<}L%)dC$H=)3_!I}+jl)Fiw;T8D>99#>$x+Ez
zne!#6=JHzv<e5ZE`?t$N!$th`*<dY?SI}<;P`|ybAM9VV;gbPw!~p~GjWdP{5z?sk
zn}~8fLF5h{sG~Vp?DD9}(_y)+{hCW1JHDneAX#+c66w9Dd};&tMe9%VHD8L7`c;U8
z-PGNI4C9=le2KP)5m~(2BvMh`W&P{O{9}q+`WWf$s8a%w7be;4n)<bRtgf3u*yTo_
z1D+DV#$i0O4++9)^yt>`NgcQuKd9<YJFPLEiKY3%yxXXk={$HlSPz3+k$}*$#jX4}
zd7ZXd_J>1>J{#Da_3lOi7$BYX&b8?pL6S=@`LMovL$yT)7RSlaE~wx4;Zc5#wYiuV
zDyrZ(%aG44+dClbUGHMpy3;QI(nuzz`3`!5J3{bVYrf+2v+o5kMdw^}87?PR2)@g8
zFSQqHYkKM7na_ldoDA`pUjA9VHE=<His}c(VY*J&xJd7Qa-2Ere8_EiQovOqG1Gak
ztPqU8TVw8Gc?3h=siH|s(H*IEIj5Y42xm{{Z1~0bBR7F#4;esw?vcN!WYQ<vSTn6{
zjt%NlW=?+vJWJTAQ?V!Uyo!4GpC3P&hl*uS`c0Fj9ZW@NNJQM}&VdI&Kn1MkP=^w*
zKK{4ho9EktVNwus!ITYFzUY?*0V`U9`e>a_ee{FVwquNkl+-D4oT^ZrA{zct7;@Zv
zlHkCNd$YCfI3l9(VCC#?Cwu-YSNbsZFF#2jl|V~NOqJe$CAuPDDf83Q8#_-p$8OM)
z&;l9~T5zB2zpuYKd$8FH6NZ4!wVx%bImjP#8cXn}2xJ@BQi~-{w25fLJ%&P5ntyMJ
zjN8h<2E9I|hoh7O9i^NWslkkK{5*?Eap#vZkDsy+)+cM3@lo(3DBKycHkmA*_t#s~
zD0rBnXVBCc?mXeEQrKtF=qo@#B6OLf6DzCVE;hn!L<GYuN^VhOr=qT>4>{g?M@6Td
zkaGk5CL4Bl+NZ9sV!gz$PDU}Nl%O@~5rhe9)&SQe#-#e_8#m=$z=c}0D8Q{WBW8T1
zH}6pmdu3#QXi{GcIyKBKN90>-CJhY`^W8UW)R-9EpI4A-wH{j27qor@*;6v4g`@_c
zt|{w#kWjfUAzbnn^==qjlYDJnDlD^z&pV6RgD*tjGo=*YMW$F1C;*c^eK8DQsV=*n
z6;UqBKuI?LfD-GJX?o)mN@zm)rF+!xzu7`v0lhoOE7gL$MbDnFN~%vJ`rsN*M>;<-
zZtCanA%OAryQygz3RzUOP20FZ{Mwa^+f!f-@ub2*jW=0}coCMWa$)JM=m}iYD}M~=
zgbDH((`K+q>7E<Wv^FW^ehgG|fOBOCthF%4@PkD}gl8MR`)q!z<VJOqaL6|9gjSK_
z1?I{GV>?EfayS~8aN&mU36J<36Z)PT#R<(#9mN5akI*6%_Uu^^%(O*%9Naoo-3$hP
z-=j`edt*RN?NLNn;@`tx%60b@{lO08cFAhF&aSuQZZ@pfgp}%AW!hxOV&d02q|^UP
zs$p|21bSp}mtPkcg}!Q1N0O@3O$&LN&?iJr&uYM|$U~EUo{gvzV&ZH;*o#8CZ+j(8
zA>ZG=x7U^w)Q2mSzZ5Ob+O58-sVJ8n<R;4(7yM*|F`Ik+M)S0hJZsFwI&*v5YKXqK
zetJ#Rl31*qO4Q5!ENTVIzdFom&k$hBBeqm!KAZh4ddDQU6a2?6^rMhI69TQmKI7_m
zh?58n?`!$HKYRgw>U<$|eMl>dS-Vj4&5g&DnkSCMKz{`|uAag0Uerc!oai&%a<VJ+
zA9|`OB^0~lalo)%vT47c+E{Yv7@LaE=#m5(jt&I!ZP;>L<U$Ruo35Aq+@CUYGPnCE
z{AHPJ=*kr45H4t;ebNju&g;3+g0FfZmo5&r@sTc?x@WW&-^pid>B%_K!<9H)T^S^(
zEd2=pAuL96TJOt+`${M#VsjJBRwkqQ!C(P;<@%zrYE7(Wnt-{!YxxxO-~Xojbk|=b
zW__$KLOG6{QXcK;7Hr8@^um(I>A~@$z-zB|5ud-z|NTxkzgQ@9yvea&6MVW+az<Ea
z;6$8LOwJUGlx%2C{QX?Uk7c&zHmjhN0^u7uZZ1n-FU7CTNO=afbQGxOzMb7((3PI<
zJ<6k<(&kMb1g8p*HKKYJLW~)FlQfk=r&tBO4wEvYAZH_&TW>2Jbs07GJ3k0|9c=xn
zWPsK%7XaU$eS2fKbL?q17$cjeAwdCaZ=Q}MiYI>un;Y27KM2*#^AY@5(0Ah(UVZmv
zz)4G(t=r7o3%R7#=6-g>7sH%j0H|KNiYA0pV7okWY7npzyf)t=&__L5S@nQ4`azJc
zuHPrLnmv&k;#)^t{Ok18)~g<82!o1I`2BHNtY~`t96GizgKlNSmk6NQ%hgKSwW2gx
z@V(fhjEmI&3bFvMcUth`Z2>Cp#l$#1vT1OZGDF;-no>J_G}u2f)RlOT`)MB-$wJAb
zTneR)2h*6>ygwa3z8cgfyk`}AesmuBQe^0x-|>ZVSAUwo?x$&)F-UUZbQBA&nlvM+
z=;5aU3iJ9mc_g?xQXE-7Irf|bt!l}Iwdo@weTbH&ge^~!Ozz%q;t`I)^?;;!F$E)Z
zi#IKp$6<Q3{Jo8OE$yw%J7;&=I6}{lzmI<mOm#4z(#$rQyW({sH1<3*0Gx>dBD}6D
z+)M4Eb%o8cwPwCjh?Q^9fq77Lz$Q<j({TzmfdfK#;JlcPF~PaSJr!?&Y4jce2Q^#t
zMSA}X1=&>aHAW>Zd5!zykc}907XK_DLrOGn0vg3DK$5$WIy8z|&P0JV<6C-qO^(^q
z5iitdD@p#7hTfbQhrIPy)-pADzgH&bx9|UKg>~>o>jgVWNkq#uLFmt7H?D`&Y}WsA
z_6Y89%q=-pXgGyU`Y3NSl{L$H4<mPF22SpGy{#{{I4`<rL|77$s>m^r8x|3iyfO2e
z4X2nV*XKYy`U`)0MpLgff-A>dhxw8MHR+?Utr}d|kba`|(6ERYD8EH#1eCSWZ!NJ3
zpbb&JUP7mo{rc{&ZnZDQmQ+@h=|%KK&p5Fgv84x8zsSc1nM;=iXupYqCVsD*=1s~(
z!;*!Ic(2H>m{XqWv`SKNk8F>vP|4a(RmSnS5OA0wJ=3o88j?^?H)|6V!@mAR%tQ6t
z4@fq?XyL6HpM}gW%#9mE{SK_cT<r?(^X)3!?7!bGqTR@VwLn5|K^jvI{4e@90#oZ`
z;Jy&rz-+a{0v*pki|$)*U=RLGl=7|KO?pq6AMms2=lKb5<(QxS6Cpl85(7%WPKPCE
zCn%N(zt_Bvnfg1i%r>c*D&Ab2|9Gt?k)N0sz`4Vn4FQok`O>L=9xGoOQM)MC7>oa@
z=|4rB)OGIb9<{Wo@X}9!s7jQKH50vthvl_q2w!dkR_o|*&l}A0i4_VJyhYlKWgq4I
z_8XHFY_s{$xUfad58Y0Od(0lh{5-LKP+5Vg(5apbG1TzGxTa#RAnRfoa3B5W)VHoA
zv;A`vM8&e;gI-Ez_1HBz=?Hj+UsGn3U;CV&(nU^v_Ng3`O`0^cQ-p5n3gg!Kxp_&0
z1Z$eqDH)NjxvUchwu4geqP>$I^jz#wJm;MUhtEV>1AfIOFO}`?-w4a%Taf(E25Z^I
zIpIdYYA{v^Wy;`RLca660{0%JL^jtl*S~DQ)!xPe?<Z7x#REo<?F|HqM6%a|RA6B-
z-DvVUp-L(>=<5<NbYwDK5Q!=&_t5n$(TB4L5Po$3qkZB<iQq4$Vl}o5N=%H;wX9iB
zL-puD1zE>JtP@x9kf*u;YCjXW!q)<tmpTBqLBwwU8;!gEkH52m?+TQLS5N$)n<TJ~
zjI9K|VqbJnN=w|9j~$po%TlfK<tb5<>DZB11uYl#rx@JYhQbvyRm$IAeJYQCpuFdK
zF!RIKQ_3!x&?Q0yYSC%89~eEk=mIk%Ug)Qxu|O|t4mr-uDgO3_QizC390o}Li7X2P
zgt)@VD_*oB?b<B7Tz48VcJZRsEnA}<A#6_E8~2-B^QS9uNDn~>L1k98_<Q*UFNp)O
z2P@bbdFKOdR3#_Pyne5ocVOIaZ5!I+YqcZ7Ud&P?PdD&o$bsL<A-LZhJ<Qg=0hkUz
zeK*f`tI@<yVSdtbzD^X~l4i`y{xel}A)_-t73&HepxeER)8bgy9~`>qM|;-L*~rQa
zy$bEMdCFAfd|bBsdP>C<1E+j=mpdWqH2Y{vT<L>@*!<_N^1_mH^)luG_8sXSBg)5O
zI<=071@RE#^{|?Bev8q$@+hpH$=v6NTd0oMqmdEut3L`Zj!?P-z6t-2wJY455^Eo9
z6cpVw0zcUDB$$d;DXkEn8XG^C3#{Mrgt57<Nx&Wz@n6FDB${8uFwlvmKc#$f(b<M7
zOscz{<><K<Aq=fNF*1JtZR!f7A)#)mVUSCfcchlgw^lT&^^(~W2a@_-3kFV7O7N6_
z3ZA_(rCsQrh(D?H=264o=5D~>fGaX~iu)zXwT?Bs7BvCZN-I&x%U@nE+#(BbKdQOG
z-z(3Pkil=UE*RZ_N#OACoS?z)+-HYDU%OdaJQz)Qyct|t>bd<fFgfTHaNzc~=`1Ij
zo;LYEVSJ?vR(@*B(Hh}Y1xouj2aP^KaLcU7fz)S-vG+#|d+%iyB_WL7dQ=Lw=m5e|
z_q_9Z&j3FjDLpP<y4sQd>|2e!vJ;%AKhWjzUAgNE7n3N}hPDo8rfp2Q{?=>dUz&4j
z3Vu~}<&r7PHu3{G4I)%DRCS<_*e@(K1u@o8LuE~8(upk(1^!m?<_>6vdOhTi-IsQh
zh$ab#$yNR=Js{&(f^~OK9Ho#yrbsu$XxZI^p^kwlrcAMF;`JFSOlcBL0i?il0??l4
zQ+}S-&n?(PDYs;%#)^@7INK`zK|;rVqlngf5g|a$jUuPa|Gn<~h2KGtLQT1@?39&`
z5ayb7dzqC#MWbY%?Bq+^>CoXh;@YJ2GAl<Sx#bKo;-^y1f*D<9-A|(4Mo^VkE%5O|
z)MsPnruD8h*I23Cfe7$mq_q74viYiHzE=`%-Qy7;n)h0QK77UJ^ELZ%6XJMWQ@Da*
z*+YLl15S<E-Riq0kAExQxu1}CKI#3njU*klT8*+TOfsoqWL$0n91y9C9(%b%Nn0{2
zTYn8uY$8iHR7NlKvC1Sbm7{6U2nfwD2AkZbyhZ3U(gj?TqT)KMJHS*fJNj=+4!uS6
z>F>p_w|aki4q+?UOgO8~20$8R<XU+#5(c?JQ!gyKa5}kV3Tl5t(7S}kw^Szfkf)L`
zrZl5~<i{SZ!~u9Ull;PNy{P`Q4BSx#H3eGZ82cvfjl4cIjs{d3RdC+r%0NCTdh9J_
zEk9}G9Qx4)#Kbki9|ttNt;%V~Ef)qFl5bL3EvN)0HjgRAVbr-|1t=qI<gAs7RfB<L
zfoI5TVtK}<Y`f!PqOD%)5-IW_-}{lN#BqI7t9O|YFpr+jcOcz8=@L5ghvqlS)s%qw
zu7ofozHqw0)Gls?BA!OwlTVFpQh4MuB(D)JBu@D(Sy&SgvrVSY@ZvT3?3Z}WJ0kC%
z37mR$qUnAn7?6U#jO*LS84K&KZ@46=m8Y9y%h)Qk?sP718W8SVrZ9s5ZK{08skdNh
zE*-#`bMi(w`AE#;au&5X%+ysWvRSa&l5v{fJ1_%w-N6Qrse&Ex+6dIKi_r?Ry~Jv_
zlen#k5YcQ?zH2!JuE!7r!zk2u%4@)<oEUqzk8j&bU#-t0k!^FP=7>^nyWyQ`a})h;
z89f-x)Wiw#>hpumCQk`m@30UsG@vsX57^u(F`i7?g+xI(Hl;!Ex_75+h5=)<qPy9?
z9xu+uqSO59(!cJlG+^TKYaz!(-QtFyXD9BZHkOfT-bJx1n8|46mMBQBe59&wAkkNi
zIBYk`bJ0mVU(s(L^+e?brONrn!PH5$IYic<=s0sDeX-iwJXttJ&eb~e<dsWqwDX3R
zFt!mor&&V#b@J@_MbEX#p)CYy;*Rh$Wj(#OBH9}k`8c51j^_Ip==@VVTA@y3N(r|F
zw?25(UAbB_7f*Une4?pyVj96xw8qukk5k6kWg(WA-h8SWo*^inOfyu)|16Ujm6cfo
zLJ;El_o^k1l=3<2j)2j0b_xC17JbKKpum9z^pgZPr(Nal^t~^_M{}KK1|27R7M`83
z@QL7}aYu}{j{)HB{r3G|cOMPfz)qikYd#cVk^e39kLz3QZF*<9PAjFoYVMQ0i%a7t
z6?XKXrcA_jSra;G*i*fYqKSAd7rZ6A9l4>;uq*FKf#Kv2(bT`+&0K+TN2cFtFQ^H9
zfgE?6hO4+W+jy5D7Zh`Q*Kn~w1V2~24j^5Q2tS4mZqXE<Tl9&E-Ew#no0%vm2&{Wl
zP@k<TooNvgZ7WJgJ<M<S40PnqCSdo)*4KJwN7O^tY=xz8m)KBCZYi;WU!kBAR*Lp4
z*c)XndgZ!YE=S`sw_z59d^jmcAH-o^<a|u3&Diq;yy@>K?|CU59YEIBH4`s=&1+_Q
z7;2&*l)`iBkq;q_3sMytByl;LGP1j}Jo8lIxIL1sq~+%bsy}EY&<~SAW-||-X8+3G
z|I6ajCj(>WG;x{Jit&|e@0L~d0&buYG5Tg*|L%H3Qq(Ob*ovG9?$gvzt;`r_1y5pA
z^Ft13KXHqKIF*c~FL7nT9Gi`#zIzNG3vzq)ItBTSF|r)n9LULKfD@z++7vc1_dm??
zJ%+YSOqZn@e>BKeHcXfcrx9y~r}r|F^e>ay66~+v$(L=|3u17F7&)q&F1gpBWu?}Z
zih)|`F9WuTP*{s!dcu|ew~5<1{E8Ugw-gSEu+~#|oL`R1Je%Pp^5?gv()sZZ=||aD
zvbzP%Z?e2SlIE(*oL9)wvqaZzbpVXqC{^QNOAcp<Zc)FC_wdAI996fvm=4SCX`UfF
zNwr&g_4IpK^64@iDB2^nUaZWmX0V;xdtpL8l_vJT4uHH}rlMN9XjcLv_I^16)vCms
z+rmk8XBwX*O#kmR$Oy4OGNq2SmVs%87mT6zwh_Z`tqqi$AfUNqIvjJi?T5xZ?@!ZZ
zA%@(sq~d1V{EO%Q&Diq~0e*DW#vAWD7OWEaqXQy+L;Xh^(V!D62?Y4lH7=vDDgj%0
z8wEGA4C{qwH$0B)H-|j1sAnLGtn0F>#ad+rwTY$3GL121CWutLhP9GeVMOz%Z+|@&
zu6iy5W5+F&R=-a!Y{<{<bE4K8L^#qHi#r{leRfz>Q%RRT%3m<I;alm1?N~+40Wj*1
zO;AV<H!b_+dVu}hJ^@-d_n5wt62QOLMBNZVMivY`B<qW8>Es|IY2+ByxZ#=z0nKRw
zbOpszSD=SdwZOnHIxXOd7#=oNWy!vBBUe|9tcM$~E=r5&D@XEa8XMvdJBDrsjN&Rx
zjYfH*pA>h|64tdXA`0JGF})0~^&WNY9G1as*pUe3>Qy@40#PP%0!5?|4?RSeFJu8G
z6?5Qji4u3EDeEfXpYtQeVnErK_W=SC)n{7lc8%&#PP^l+UGuE9$v6Hgl$!7{pOSJB
z3e@k5a1B5>K23OB^8DiUVw{1B9}U?OUh_$8va(FQpXHBX$tvDK!SQ~6>?y^H8;Qh@
zMkobHGor5%{N~u|Z~WyRt%$EZaguU$Js`FhCAbEp5LIRUL_7-`3?rXW`_;S{i*FYg
zTY5R0X34REU!2k3ndH)e3o<G166;mz%4}R~gmRz5X|?B`?@od=q$$T*$-XTj)?gpn
zzUkYyH!`(7xQi5-xzsoT$mnob>t@`x5W_oD;X|A>iW1mZbF@_E*qG-uW~%RYN1^-N
zVFsHpK1gHV1T6OT`>P+O9OB?TRSnBU5SiRwcj(8@XMZ2}4hPU#PIY!zRWpR5KF^Lo
zF9~2~JQNxauuA}<=<M9LlYgk~Ldq*YJ*_Hr7dHuLT4u6g($wH3?D>qlhTdg2PjJ1$
zdl|v1PyXB)*h)PR%78BF!u}(rCq_n_igYciZuXJJO{JyMh^@dtmMC#=^F~ia=7IXw
zT-~9_%BrR$g3Mg`c4IIndZJ%@{>QU}sAczH_!cLM%E3~(!0-C(@psV!=zKU(YpJ-y
zHQ$F5d+I`7UN92w`1DMtp2VhHr;1y-lyxS>?m<%Q&L<m%uC?0fS+&6#@lvw+g1Efv
z<zTudrx@5X7@FOH0!9~SREzJ~>)PI)068(h`4XlgOCy_i<BG~Ys9MOd#$wGf#OW0_
z=2TMR*MIHmRUWo_A&xp7hwOhV_p&>6YP#75<m4SU{e2<eG*T@cKGjwpOJ$2%YTDHt
zi#`aPE44X#yA!w-BpScP=CUK~vLjeC9A`ub`hw&Mys}WlTsNWp?NRY!o1bA^98DfD
z{lIqHd5i9!>|7bL1NoeBQqwoXDwd(~-%ojYk}u}%uZa+30oRbR(%Mhx@hDdUqO8=S
z^KCtcjjtDft%i}L8K$-WCrd=$rzp)OBJhc;fic>|z>5){R7NAF*q5YxdeN8&2(vgB
z2#a}}sQDir8d|fk__+XG4=tk@wf2JMa|LbA_CtT`vsVW1rW~%St+Ph{4T0PRg8(_T
zKA%LpB<P^Oa8OysPgz-6E=z!^u<$Ci#-`Zw*7%Qvzp?lXVQ}8q)8wGrBTBENl1PTM
zm~R(}ZVeXOk?hkZG5T1P2?s+MJ1nQ6abW=HnyKb!-bP=p$<nqURn|&Xz_x=;dp2^b
z-0s!<U3@%Zzzltcnwx>+qM5B5ciDd_mwg&#pxab$G__8VzHP()YjKloCHU@$rKQgM
zi_~j#`uE}YjEcPY%XB&0ZQfZYWKUa4qFnD#*lbN18oRo;qWJ>%78okBPr3myh9eG8
zA^1h{^^j1$g4w~xt@*~g&XuKUBpqY;jggp+vyImWb$$9|WJ<60Nej40+PUTgVWjk&
zYI^Qxi{2yVA5O@QX@68w6OJcB#?F*)=b<!8wFQS^d_B=@MC2{Ex~gxldp5`G_|9`s
z3if#Itxn=v-seF@|AIU(@la6GZ=oy!oNCVShWw;E)Ckd{hi{QFj(db1eD#DdbzOJr
ze7&eoulDame7Si<_hR^lMUW?Y;NxMz;wqi;$U@1ECv?~@$iL(bs{f}vs`3uaf=`)z
z&8{b$YuK7-P`s2FZzEVfz2Xrq{A6@z!$y~hi<I!kNGt7?4=&aogBh=-X^j1R#@6O$
z;^?$ZULe184R-=N2F6Cg)L^5LFQO4)t@N&2C5Qd`RqLs51f)Ht-ox)^c|Y;V;uhV?
zr<9sdx=ANhM{Y_H>K<N?bjY;kyxYF;(Id#HDO`gN7o@eT5d#4!{<nDr4>JAPj$Q2T
z(k*Me$qAo&O&n=Y8^-N@Vyo!aq8qy?EE;M=8|unoH!5-iiZehl!(g(;vRc!*If~|(
zrfn5|Ub~4elj3D{TmnTna&~Jm@tBc0gJe!7i-sZoF<Q4R!BuVwPA&Sf01kN*F8W!}
zNgABN)yPYLBVM`BW<Y*bn#I%o$#gQ%Vw|OTK$De^Jh{`ZAy?Z65a;GLp$6BE2N4uv
zA3_Lc{z*k+%QzJ)tf7)K%$uWIZL2DKpyS#rMYksgv*H()LEBA}yLZ{bj~{yz?-Q)0
z$N&iQ7ZB)}Pqi-{W{X}6qG+9A-1J7Psjx8@$uYOn$r$YDwa*)${&-9IS9dDkq)O0L
zzd_n1v!>o}F(r}?akX0#_2kzAdqc{7A`;XyIhY+GW0Q+XQ746^%o{z=XN*LRB2RKO
z%3NuJo^I)FfgT_x#%p6F&@cCjJvD$LdB14Fz%;n%67={+6R7xCuE3@%S>lzU9jW#r
z9YO+69A>Cz{mQ8)D!_xu=3IB+o`2l2A5V|~eKn+~xpATz@)>7RS5^BUmi9qSLz-EX
z0>e(|y<${gDi6CgIZbIAPYh>!+ItJHzhOlLwzj+*rw7mR8wrA(Dl0BZO_$>LrGJS1
zlaqcX+0r-^_mF(OLw`KoZO#;OIx0dgcuQv$3dcYNEPPcuzT_36`o4+6Dek_oCmcm-
zpBFA#cOUvIt7j%q`5}vUK9n+*%ZSw%<}r*YM4h~h4Ow41%BCrk5t${v@}ml%9anw?
zwB9=jGMRzS@kh)|et8FsK#X-(M~MNGo@&Dqw-_m-bN4|_SHg#*YZ>>qzBRgeJ`LWj
z+D?be`WvscwpFk7Z_+^Th!$wykrw}mxGS|Y>4>f+0omFB<57!v_Nm5Fc2X6xJq2i%
zj<H{hSXrrOo}pR&aBwcXrMDuOF^rJ8mUP=p&}p(7J5a8gDus;np1vMjpntvUuvY%Z
zU`_vEmlv=+eDxzspz()4(O0LpwgZ(%=U6WnnYdAOO7u$t-b6JMKKe4Yk7`DWSgA3b
ziDAojiarDD6f{cmajXqtqD!|X?mp8w=YiAo+;jG)rQ^?c@L#uyGH;v9s;4BnH-Pup
zdD#@fVJwI8p>})7CwDb&OmijvBY=n(Bn^>iM~4dnPpd9S0?d14CMPCuZ8y0!#v!7-
z)*_I4kWB5;ObbrCu^t#x9QZwE7XkH}UDNZ^tEs%PvB&*v);me){!<`mM`l?(+AnQ(
zhbp9$&%WrYESIaw%J2b0oTy+1n@i)ac>9qHS0Flg+ajpu;C^FdhK+`Fob}n5-#l)o
z7-4OBVPKX`bXs@^OqlYxuBYf0hanowx6s@{o*Gbd1%-;e>|YKijZ@k=ajc6kpS#g=
z8Sp#n@e*I&GV{8Sog+7d4o#5^pCM{YSvi^?t<?LWcHVs#5b!@q1IreRaGz$(0q%B9
z3D4kin}hjBcpi<a*Q&TLgHE#FyJ_&S5&R5KsIW-$$u=iG-eZ4cm#hhgPy`!6jh7EW
z<5`xL5&LU%{S|_a6)VHVioh=76{S(90oe2Sw2z4|gRjG%6*bz))I3OUw+(<us^2D1
zJLZ`RtO_KTNxvE+FRS=`9haO8KtGJh|Kmv(#_{sfozycv50Lo>5-tb#g|a-D{T)K~
zF{y2VnylFDJ_*3ksD?e7v~e~OXr*oM5P^`7z9Xr=-+$xLqur3<P37MjaWa0ASvlm^
zEaeULrsqiaBl9av)B104dwS5}C-2adz-GEM*`(R7y!fvCL0e^2Qg>n_xh7rQb(bQ-
zuys4&8$9VL{L-F$WEey@Q%I~Aohxzu`x?VqFxOP9v`;;{tQW*e2QqLRQ(rgKVNuou
zIX?MdweBu(v7YW%`8NN<p8|yKh2$x+euhFb`NC4E`M2`>v))SRg|T=!6~PVAlnE50
zIf)p@%{FRtkYUqww%=`xKYr>IF3o0_{ZgpD@?C_^Oost#Bc{121pO#M$!LlSJdjE=
zLRFU2BzvHF5_oQ%W&gI^&gw&f=reULQ#W#V4TO7niqLcW*aOUDph(t+^u^kTm(iw?
za#~}-(9iGr-u(RLUuN9sIFtR{4^7sxIXWd-?%JgKs*1RgFMD`s1an*DIcq9yEw_JU
zD!OZ;;R!Q}`*#+*N1V!J@0~bEEv*o#o04@qxiXoh=a0pJnYHgrN8dV__${J+pN0j-
z-AWHGU=22ew>o{#K6Q5==nyua!{6`WLbZCL_GVTo!XEqp#oxMxXmLc~f^!AYWUsnt
zq|ysW@JbM0xunQesCiyCgB~hpMSxwL-_E@OU3OVSWoyZ#Hw~CnYY1%xW)0#2-9~n~
z71pj7h>WDk<%fiKqmwZf7cQjY!b9_nx_;vlO)><?kqiMi;$xX?UKVST2tw-`RY6&p
zg0oAyjKjn;ghF(t>ourAA)9>TkkW5f!(@xV7{P&0H&N`-kuL?14s2nXvZ<Ot1Ry#O
zqekt(E;aO#ZAo<eE8Wi04u>pB@tisuwB+^k$uXN;W|yi>b-T75c@`=M1^?)w`|gpF
z`p{aQn%i8nTiRnC`KFU(|BGhdg0x4^%J87+5=}z*Id^~C4+Kg#`&Z)nqseI-LBX*4
zo0UQks76tp=3R<^0#Ou${w0vJb(Mo`X-dQbgX4xw7~(UGk1}3z8ANI@Q${m8IZD+D
z5pKTWMy>&;^hwxonJ=5X3|Dpq(7%kzGV^agdEXL$*G#mO=*z!iHJ7GUr43I3gZp$w
zwg15^C{&{R{VlFL?{Z`YZ3kSqa21W6-MJq0Dw4iO?T2e*WkvZ4#8(0(2u3YM<z88=
zw-N1=*thy0bjOs`v)uK?Q0;Izj*))cC(}u(`skJ?HJ6>62>d&XD{1J1X$p>lSdOG2
zsjW=L7r-U$#}ic220HhU28f#AmG+X7yv!KGE*9yuGoXEQpB=NGQJ18*36o;E@+g5V
z(G^KkrURH%9KzX?pBjEI=yo<(c{R4x4tIC|E1L|k^|s3Zc*hy({q7jLF)%_oD^uQM
z==*zEMq^B`Z9fet_+;I?!!ujT<p!b#p_|t6V{!raI`p3Tevi-NgzVoOq#R0oL_!l%
zdKdan$g&t7ftl~J|Fu)XuU-bc8uV<Pn{Sl)oaW>6&0jA@^2NH7BbvkjlrMDNQtE<Z
zQQZ&6K<a#DCbfbTHGUvRp)|8VHZsU;RLeI~&whn1RdL~{kr}_)J<Ip4TJO+EyX7xm
zr8fD}3o|oCxOTz16@?)^_!bFaDO{fi?-66I%fX$uVl0y3Ez=I}4S4IE^X4cAehoBS
zS2J<+g&6iCVH%)|k5LCuk1P}CMz3GoHs3L73)qPoAs89%<0U@FIe#Yw6=5lFP6(mH
zKw}#G>6Xcl4SOISyb!iu$Za&#C9U8xT{rmcx(|ay9mPd+%vhJ3nFlo%Y=7KNI0!s>
zfoi78HqD=kT^Oo)keb-Lb$A%S3WElulI0~MUxmJ%RwinE|Ds1rv`(<rc?O=2Z=M{P
z1I9<bArKBVE+$Wm%O0Zz#SE{ms=TvFs@0S}-0(`l*O%XCw19@iZ|0;-l4JJ-RtfAM
zIO$ldUm-Oat(9EA+NMEzNCpurdJqM*1GyfELU7Hc37tU(=3#5I?0mb`P;pjRrP(4g
zL$5*RQ9@>SQB-bBcR)&aGivuMGQ@2Z+H5*L?H`Rc?Sx%SWT<nd@n8Qt1DDJUJOAwu
zi)uc>qD>-{&(!+ONsTL%cC{c%A|21baaN#3*VD`drQu1ifsQHA8og6!k5NLi<9mm#
z4V_TC)w|mWX9m(Iz7HVDVJhQ=xSVOTI-I-5XmTs9me{M*F4WDhvCl!xJgK(dH5gsw
z0dru+Cj{1Ol5Z3Rfap&;q)j{xZU3b|dGzBYnqQDW+UZb-M<|)~j6u;&>D(<v{`Y2r
z%hWSrUmN<iL2fYI!}2HB#{F2VZ=F+Ch3=%3FzhxY{<qa!)+~Zb!zBV?x`ROv%YEvX
z)}MT>I1{+h-xa(UO0vbAg3J4KZ;mXVUvW0kUM;R-uMyHA=4}CU(u{T_W#xoEJ*hou
zYA|_Ld5fB0bWN;W4gi;WwksCOrud_U?rk#_mtl>U=k^Wvk<_gOCC<H(2#v8W9}LM(
zJT|jQ2ihjnP5-KaE2~wUv(%K^<r~c@o%tQ1knoZZ2$ukK$;Hm!|9)X4(5x!SUP^1t
z6>kHTpup?5|HR=+q%EpPRL7ojY{V_-MhByWn?cMEK3vU{g^^+z{T-F>e4kH92uXD2
z50Zq3(b|#A4spK*Jj|waXT@Zmz<z+JQ5pGFjERb3YXd;GX~dc)kI0L=6_4e14&R7h
z?~sTc_YEs4j0ZZGT}!f=qG0aM6CEg$P14h9(vxhe0?V<QwU-$76Lcrz50FuHRWWEd
zmoujk`NW(I>KIhZ4Lch<oky$}2}rB9Q5iZuL?G*@Q*YyBOPZB2v0x5|E`hESya}6z
z=XYc~;h#N|v^p*EucT7l?#pY?a-2hH=&crO<I2$99R-)hs4@B;tv^G=(dznRG=itK
z2up0#R`1)=s(wO&&&Rf^M4*<KAP=63{d7G;#9?4F&53KuiiN9gQo|({Rz(=~sWHTt
zJfgw=S^Qt)w)|$CDYTbPO)?|weG`nm)p4PyKEhuXNQ@>!PV2hrlf*q42xo=z&q5MV
zI=MEbdMutcc(c|34Z3xLqVLoH6{O_bXOO<nYTf?3{&s`tFi9$V_*|1D=jDlG+NwKl
z&lJGbZK$(}c=BGG+&@Zio^5|Q{j$htEv&V?lpdT6AigMP@~^J~-Uzex$zb~~9DZQo
zKjV}k4kq<F%*%6mX<;=n&Y_)Y3cS=@$&+r7aWKnoMY1}G?j%lQj@0?=ZbILxxjv4;
zth|V37gqazR6m%VxaX!kZ4vuux-S39PzLgJniK@YWdAP3wjIXt@hvCEAU^fwv&^;r
zC1DsO$6hqPh=m~zoB3{4P12i~)`f6{Y+ouP$VPq~+9XV!4Lo_D+>Cn!(SP3K0#ANK
zUpe8BbpMOcj|=}y|EZEW22Sb?wz2v<vSOGrzYBq4<862B)1-?fvz+zxt~R38w01Bg
zSabq5Q(7_6ST!t0d_BMTFv&zYW<D;g#0WN5yE4%AH;_jSJ>R%tapAc<q^5kVak$o_
zqRBKV=^BUWA&KnEcG~*$AmpU%KV~*n@>RT*ia>2|Du&xFWT6w{F`HrmmlgXjS_9Kv
zf3+SLvlST>Xwqa3xt*r({LEGT25%9Wwx!J$*=re%3uVT<RY$1$@={5kw8IV`ZU=6;
zF9)LJKnFB`+T7<r$X73;{E0>u#+yyeW#UUgPhT53UnB56Ry_ka8syo!g`b>n#MvjC
z{=>M9c9pTHzWieYC$_B&TF;MfT^2u1S%%)`%Ow$XAYDNCiz12Z+W={HK41dLw4|L@
zb;gH@bpYrkJV$)*f^m#L)1!6J0K}#JiSTQ!7C*YC`0@Y>b-8MlW5;_bY#F=JP3{KO
z3f3?9qs39MU|0$jU>aPmY!sC?(I{lprDkpXjB>tYsP|45@3u9c`IN81JqS2Sy=SFz
zD>&1_ejlG1a^Bacf=X8LP6)MEK4m$Tub+w0+`D=p7c##7&kj)|LQ;(a>o?Tc2Q4UM
zM`FiDX93V?9v{_b<;2_XOxJPU^@wVhma`>RxdNB($M1jd1j>t$cBFZ(STV4_Z#S>x
zL>H-z(=$RQY}J*s7Q8W)E|M#%3;S@&!D!}5u2yTPGo#69satONbm{;yPh|FIY>EEE
zo7w_R`Ey5c!xNt$UdfND#EmZ6PGHPTv)BDjI&l9z`I+DvY;OPvYB#Da!zBoI?Em6B
zK<9q0CCxnQKIFS(@LxEJC(V0e-&1LPz+b3=PBKXp2b;?yq9meY<ubZl+q3~#KX>w~
z3h`T`Hmh%)hHzi@(%$(F=`XjcPU!Q~#rGGI;9ndjTCW)4wqau_dl;m#i&iqbNU1MG
zNdNQ?wdM+nB&7MP4P0yEyWqWJRHGGu*9k{z_uV~0W@O765I#(3K9DbI!HV5D)vlib
zu}+fY!GaX&QE#{pF+K94wpQ&^$bWB}GkEHw3v_hqAg~BEr*Tv7i)s1jB5Gda`>1ZD
zmvW)oio(<R*UEf6b#!A>Y@!9`*pF&jUsR=Lz`cos!i9!v973Aa+Zzq9wRj{!EOQuR
zli1gzN3res&AH_0bCI29gpRkh1(LsY3RW@|mn2~HB$43T_RqpXY6WO(H@`}M{$WK~
zp7;MSzfORXGO|4l-cU$dXAC0ycUdc~{6}b6d2`cO_qHXiJ~R?#c<z<X%15TCB?|g~
z;t{G)Nt){Tc?55h=~@RdV`c7|tj+kmM>d)IcM?nGy`?mFWrgjw%43OOUMTBiq+dN<
z2KUTr$ttV`qFCuuD>`~q`kr>V_#IN@UCed2(3^247TL|E8osCG(6dK^tA;q`6AKq%
zb4xkfx$af>k~?ul3zEu^SAn$#DLqs>tUb7ur!W5izy_CWq$y33VG-gBp+2B{)TiLK
zgK>;3)N&qJNIqPWR8r6sZIg(tW)8G7UN90Pu7CM`<K+4=m5s7yd1eYHU)XomMd@g#
zp7fKLVS&fXwCArpgKR-Sa#g1#*A+@NWmFeE1)K6E#}0R)-lX0#h!XE}f{B7uP>bbG
zl$>bL^;e%HLUOU1fH}e(aooe@Njnppl9-UcgWZJ~a@v&u$c|OQ=D*rXBbBx@75{GQ
zz{bj9s>)rmnZUCVhhJZ=k~m)C8B&MKt4&kDw>X5FP5@z!GD(S|cSuy6P9>%vdwCn4
zESMthJ+Fp|vo7Es0}fc#`$v+p00S?_V7l<8**6m|+mM!oYz1Bm%K@(upL&6JW&sfC
z2jhX!>y@6_FE#qg*1s-x9i{tD>eL!4I>c@5-5XKn!F&!580%?f3+0Tb81dw%0~gp}
zuu%sEA9Ii>94VRot{q7MjYtk`|M->qmz9k4%3j*d^~yRN6Kc}A(NTv#d(5?2rfn=H
z#jeAkq<^EX`^`iSqH$MdV1|j6{7=>s4`-Mue%iXAFhuMUo3?pJ31^k@*jvfJEqGR8
zX{BTg;v{*;WZ`3;PSwHf{1TRozGZ$JWKFmN#Jyq@nrt?J<t*Nwx$Z5kDzLv^Q1))Y
zA3{D%4<^~L_-T~jt*(Ng=0P{k2A()JJR-Hu^J$v?s>lSj|G!#c{J?#KH1_O<;TsM5
z-hbcMp(L2$rEPwC6uM@=L*?@hkNlL4g_2vc{fIwuR!$=uXE_jZoiW_rppT-rE=!Q{
z5ph5oVAGq}G1XDQ=}J@X(^fht`Z6c+Ti=Sb7flKHwR_RfRM>Vv)<C~u1TM*J1dJ@^
zAR%9v+tq20gUFSWo4XrDA-(fW@BD4i))c1+v3JDHNUp=A8;Z7Z=doZ5I)NUqiYT39
znPXBy(`8bA<>);2JYZdUUyypW|BI~vS3F8$BERO}p|ov)KJ7eCkraY5p!=H7yVd$R
zrxP)$$Y&;Bqy)Q64@ypeTxd+TvOfol(M<+iLJ|@@cxgj-#z^=i#`cYg1ZTD16d0IB
zG}ie({XHJXNtajWW^8_P)2ge4DbPmmqrsQP!FGNO>^7p}vere``kWtmwQM-<jJZ-8
zq*+JnzoD8dcieQ+>w@FIXF!SSm;AZlIN%tmbO;i<!~T~$Z^4T^Df`z4@ca{MF0vfo
z7k;!gc&Q5I8+DOi2YY83%v2WlBi*U7UGWOd0?DO2&S|-lTDR_81na!XWG}7IWNE0Z
zZBy`Yo_&t4PZMc!q8Cui^45@S-3W((BBq~7y*Bh>56Y1l=sPlQq-(-aXge}j4ejW#
z7|&SK<*JFp1*_?M3GEaI95+!iJzkiWLa`^OF7>#)u_tmXHm_E`FnIlnEj=Whe%9&w
zwY2Nm*Z*Z?<<s2a)J({?g!Ms-9ujBQO}fk-Db5<CU1hpGwyo;4&e_b(73dT0PvI{T
zNkiNMxiA^P6q0D$<2=svVto?ftG7I+Hcj6vS}=Bm(d4vCxcQhQ+_0!3R>wu0Zad}=
z2M%TnlCqr1wR|N@v!4?tow)toW@|0`B9$$WH09+;<+P+iX0sG5@9DtOCU;j`o-#eP
zR1E{q1&s{@!;8y;Wd73`Av<jRztIo>MnK$MJQI@hSXn<f2=2U2HiO(|cblsVfqbG`
z1(7^qJ-A`vE$NwJL>dr?vi@XZ96955moAV{*9C4Q_?Ku{W$^XWkA5|LWJhj4RxkQa
zK5Q{1(&0t+YPwJS#{KmgoMOLr<$Ma`qxpD~_38=Y3p9Uasvo~gi8agwzrVl`MYl24
zAQ#>LsYCH3%S2l#I*le+(AatNTkGeJzQOq5EMY;F!|!oTXMOsAgh^Rgl<Xsk|E9&3
zD7~ii2ol=slov9FkY;jrSlLb(GU@=TUe_bY&bn>e?SrKKo3GODWcgcij(9tB*c;Zo
z&;U$6#mV}nb<NJ$7*V&c8jF?j{k%?~#_IVUW89;7tXwya+m#(k_Nxk8@*EL5i0PJy
zyJKe?s@XskqPx0EbZjnJUAfM`{!O_93u-Ab1RQYXkO`QR@s`K6BbiI7>?k}*rq@fd
zv&BE<Q~TRvtLeQHib?#o4_>Z3Sy~PXWhF(62CHV$j6Qpk_&xp3J)$v~X)~<J&@y9-
znPmNPvMH)c<S)U*qxiY{!HnUjM&xc{BwW)P^VW6Q5fNp2$DZ04`b3!uQn%{vn$sAC
z7Qk_e=2}ljJ|Czb4*ntPwgs*g)=GB0mjW*=s?#IT!s*uuFN;)?sa6ZPjj#zH^Wuc}
zMA5tBHxsr4j<kaAYV4beZfpZ=1$K@c$B^KBVu;!A^Y?N2J)h4m1xZ|8wUrEMnvT=u
zKeyF$(yguwynNKu53I8fnNO9#y-#osa2M;5sexzHlyfqVO4Z9;We>Kev64J}Bi3AY
z3mw1CaCYt$k>3?Ky>dc3^8Ht6yG-n$SS?*Kq1*2T>;7rNR-{q5L|oke@bumBQ26ox
zheQgIJ<G`6dnIvaWv|RaMmVxLnMt<D2pKth%N=EwtVq^bXJzH=#8HIb`##_A_xHzn
zJp6Z$_r1sK^?W^tOhV3ufOe7G*B|Faicm<2mf8S+Dc6&Ht8$Ak>t_oz*>fgQatjSG
zow5Z5=;aO}=@wiZw%p{FTa^Rwn2fnG+&_4yj<E2A_fW_l&TnEw^xvA_1v0%ct&x1%
zb+K>W6YmkxTJF0@D>X6WbmQxbd9FpfAefOYl9-Lg{&3p~&=ii$_1K;pmr&ic?=*Js
z3wXQw$34rM=)G*zDwGM&)T;4Zi%#TE>r731TAms*%<5vXl;qLQ=peiOeSvI}jY&2J
zp}GP0fS|y*B7Ykx?!GEVn;;`|yDcMD%65?CJ~}&ML3OHZnfR+ew9~31>_<~`W}RG}
z>a^`ev`MGwL2Rw71WdN_jo^pfG2PMU2#1<LOvllft7+FP1G%Pvlw!Zo$AiRd7G>K-
z6PmR<+xyU8Zt6uG0Xc|l<DK^;ZS>V~ublkHJh@|SU|nE<kxr&)R)(Wd+zY)VW`>Dp
z)EJf38$X=f;0hw?juGYxx4o3WWi}<+8~&<vC{vmENf!=U7E(0r_%N!ph$DPVm5AT!
z37|vbVTzkTo%9)~D{Dl!jSku197R4?66Uq(cUWvOdzK#r1CjC19lm0Z{Peu;kIEY8
zFmd}}Cv(1<sF6KelF&2p@HHmDO_<AqG>@f6j}}df`f*%?@?21B^z5K$%8O90(>htd
zk^Y5zu0(-6($l;n-}$gtE63aWhF2U9bA{|t2P`2qo9I2;FE*244H-^JEfWzicBLh$
zpw;t0!eIG-hJhsfMG1h#ofucP{$a1QI#D$L|9mxW>cfpvGP9OverBNJ;hX*|fd~qp
zXL}`Gh<l1|Ol^k-XZM#TEKnr{RvL00EOe(IVK?yY9A%mxT69ci$&q->@8;z5PWl6(
z3DvZFH3k4TL-v!X(9LY5A2$y5Yy3Llr+F@|@Ux*f`CSb!OlKao6SAZ5AhG}xSk-UL
z>T&YMWtGWnJIN-cojsLuK6qFxGn%Gf0<k&O0AI<iclyFA?)fv&ZHublP;A=!SnNmj
zNB=Y}%^b7SpT4YD4#>d(D51Ozx&D+LrSdWZf2{F?i!ZIo-EHu`A?W?XIQ!l;ExyJl
z{iDhyU7nDDQT3Q^2~hLAz=n?}@PD_>%-VVo^`Il)BsEp|Aft|ZI#@j(Rq{5=XegXj
zy7KE@!)Z!ApBrb5E!!be%fIhNL#iVSJ_FxtLRe1*96N6&F#I3Pp2p9ix^cj3#HMs+
zjmB{S7n?&T<t2>R@;jx4(VI{2N`>|!Ha#fH5%)~+^phmHZs_{E{ch>^zN{EcA2<E6
zyJBap$B^1G)5@f@1%)U4%IM?he=antm6~sA+Y^<6mo65risiD`F2d(nN$$zQ17nLA
z;$~xuROE(7{Nvi7omsY}eTAKQr@6eByo^`HGI}@Jn=Mk9CipkKXIC!eq*~V1Q1AuX
z(k*zj%v~uv=L5JpUkLY<V?j5#i$BruDL?1qR7CM4LRl;8vbLsUmy=t8<<HZz&1#-R
z3jf4PUvZ!72rfAtHWkgS{3yY=z$8Jc5*zhV=kRtv48Ok&ZPSWkK&KrNLG4CX%{~$9
zps}hl;tA7=+abc27ol^Fq#LfzxN$ozD1SMz-u|^WGxAPeV@KkeRSJtjCO(M!_jCqb
z6?fzTOWw*aEA)(efavt>NIS_XrKRaGPKuf{!zS>5l~E8dRVDfXt_ASBg{h6QrT1#Z
zF^}tTb2}g(e|pqgT~mkbI%p}~WXSwJ!~%m+rq{f#H-aWnmBzn`EL|=aiEf5%6+Smq
zx_r;%@x)U<&|c}y0Ox_o+eSQ-!j<v+kzGG#=$2w`Cf@?zbY}6ro<`|a=Is_wi)=ry
z;M^ZcDlsZA)VRwz6ii(Q68(K1P(KkY>fb8mi&r_4DVFpjG{rVoA>z(hIbb`>`32D8
zkKHsQqr{2v>7lTH=336lv})Kvtt%Nat2rO-*=qp*y6wzb*v4${xvNo{Ec2ALiJF+_
z!#WSSwc=XrHXAjEJ<6?up=A;Cpk~E2zI)@MI3P_c0}koA$oAoAc3KNc9jQHdp>|zC
zXx8o8M}6z2!F-JYqQNx}1ybp_fK`vAfe^pizA5w7n7RycV!%MLi#>}GCeCOG*^^M(
zZ_rHX17_hdK&b3l^N>!P%aG~AjbVP#-Vm>Ez<6g5xQ1~K_-`_2(%GYWONPcv1uA6O
zGwRw|pj-YWkq1~)*As1u``N%`sUaXt1o|ysD|Vi2op-?{vp7@GuQ#aJR7z!UnU`_0
z-GW0{z~##mAl7{$EOefd&L62#i<Lkzq5Gw#(L)-Wp&Gl!zn9bn=DfH;4e!BV^9rs1
zbbIx)EbVRMXkZ#{Id)Ko0~bXojSf@6Gu()eg03Q=8STA)3j3hKz4^u9TyFcrmW#W<
zNkt-aLM%V5zF5L-%KmtUKK0%QsI{!#z$gWVTl{1}eIVId;$xFU0($1Em|K(G*nZX)
zs^YVtx!5-r|8u%X_bQhpU@V{MRV?X1*J^TpH>e`7!vE#_i+5@B{H$M})55yWV=6vg
zHSDBr`&%$%c(BP3!rBsO-^rEG-N&KA0r}P4v?!95B>(qe!&xne?f|yRdJxMbd15n>
z6#%2ru-1MPKZ{y+Q29$jFX4WpszIRqu$XF-23;ihoP6~`7deI!X5Eso&@Zr(CFpRw
zjpJp!=~Cy;S^t8Laslp->#KG;APm=K^7r}Ng($?aXF3hFXk;8umU9{YvnXNNd0Uz_
zB=yJ!hRo2ZxwIK00DXg8vo(gA2q4vI+T!{Pnw8fY^h$=Yd!9E`Tyy=3-F!sz@|NaE
zdyY0gY=9*`yOJ_@;mHP`k+svB=5r>n#Fq&lf@>Z!0aXC0U#TtVDHj-Cj+|YHv1DBT
z@b|s&Hme8RnGrfBTO7L)pPUNiur5cqk>9soRI9PPA67O!u7%Ipg4WB*P0Z>;+sLi^
zeuie9i^`JH|Kg5ku-g$p#xERSiz<))lD|?I`!-9R*Vnd*9rd=G!+mO-n|kvRX%5R}
z4sVS6T!J{ZT87nf8;)Ced6rC|PxkeB^l5UkM*`CYHsIl%m&Tu*^P8>7BWOjm>wyLx
zv+bqL%U)kHpesul|3Mtrh^VI{nMUikF7E6cs$9uh*%!T3D7$bzR;Z1icjkQo{?4kB
z(u8`L&&YDny$s_T#``MG97ZF;LT8k~s(%b-VQU;Wb3I4aG2}LJ2b=Q9?vvXd@rg2%
z700$$@jD$4bsqRAVD>oN&X#Y6Hn(j}*&W+3C|H3R%iQz!)UAd(?qOdx#GK<F9CzQ3
z*c*3Z_&5<_9AHfFe;r5Es7Zm)6=V<K<~a<WOtqfo1>38T(wFNfdK^`u;i%V}8u;xe
ztmazg`suqmuFhH%Jn^<P6KY$Mw6Ni&isY6i<LiYLl!d=y0V*T(em_UBl81)>ZTYu;
z`vifG$qP|l^VLv;SsP?cwED0?R-m3h63|kB_G+Urgt)a)^?TJen@(I2y1{5tzfwAG
z3VE3x0rs~;CwIbKm5iTp@Xj06Cdw&54`Ph2FYoJji%v~?2^QJG;gQL`*5dh~QCQ(Z
z3pej6``0*M%bBn)RJWl<MQO{oD%EQCKIl-SO^;Pu)3tzyx?+Q0a<1_PB#Me!&EF56
zP~+n*o6n5beM$@Lhs+b?iSgvc7JP2QdiG@V=~LHnKW}XdMl`lAOW4_W=3DRtA^VE<
zc0MAupo48^xQ61w%fpi?rA14!8K*h)>b{6WTto9RGKGx<67>7sF)=@afkXkc&I%s0
ze<lImjz{!dn^4JG|3uixKL^K-$@(75A|Di(7#4k=vZM2T!A<VcDR*xQXHI8}8f+nV
zu{@>Mn`<||9@_q^2w_h1S>ju=f9AhpD<uJ}j+C)sS&+5rS62@Xjkey}Df3Jkdjr}w
z)4zTB_bqpH%>C___nWou^JhFMJy6OU#%p-*^@V9O(1Qws2@Hl@Ai!S_K^?&cnz$((
zBPj$_Yhw>&fj2J+WcTEeOwfa|re|5?I#U?tx;v?ZcwZ1lmVkX6RHsebjv!6p_m}W&
z`&uJ6#=?I`^EEz}XNG82>AO~jXvXELZj|&ZNu&DEJRD_Sdoi<~X?08Yp4XF-uaSx$
zIZ!w|Z95GXG6{ZJ_OhCMqby5DT6`pCFMi}jcYuoBo?^Um0pefxO?(0cZ4aS|C@7?w
z`l6}){AD0sL{!T$5^PnHR{*GLhLj_i#%E4I%U`wQJ5SH-Z1*OsE)p?t$8bg*ZsgSH
zu0?#DPU|*>nwsZLj2EslsBCp!*ZB1o9nG7#urJ79J2#a1>f3(j`x0iWbpz{7Jb#ms
zeHDg^E<kCbO8}@|rh8Q~im)YA;jhw1Y6C(I*u(wa3Xqzfiv>`9ayQ;1%Z;ye`;s4P
zn$k{oDq>mO5b|>g={`7f@A))AZJ~m%D*4Q+bT$i#5Md3YTX7B}%k}(Alc>6L3LN*2
z8#Xczhv{ix*3C@Jax(EoR!O|K5wC+a26S^1==4o`MRb_;m_L@&cuM0QEdMCk2qGD{
z8DoCI%Dar65+F^w?WR~y6(k@*lwwmtUTC{p5<oQ}9~|>F>|y$4-5{7Et)^=NTd8u@
zXaJ2j%0FX4Vis4suGVb4cy~N*^hOWIDYvUSXfs_uCKjiTLKD2D?D!v6iI9%mjE|;O
z@8H7(__Q?%lt*LDS#43kDod9MNoQJD=a8PdqW4M!`<^M{<j<PInz6=cSPDFYRNDP(
zrrl2=zs&~Gd=thw?kkCIbe3ak>s8;qJfwq1j<`3U&a>O+WLTJ~@XhEv<~Qn@CtLxD
zHpk?q@QMz`UnWLZ#2UXXkiFH-57cfqt!zey$Q@a~CpYcg1xzGz&Y57I|MOO5l3BBa
zd?IO{P$>XgHvz0I3e4hfe~UM{7a1>3>{{IAXQY9~Gr8T2bbGYsGmsK8T9ZzO5j5D)
z+b+pP2$peVH!i5U<37w8xf<M4sW*QRQ4lhVYbaChcUwi7r~Zm9p107TGkc;>lPc4(
zyBvwZe{2&8m0k;l3oYzfy<{r+(v+9Wq0VZg$KH6auIC;3!mrMicAsVD;Ov$K)(;$~
zQqo;PtK|ki)T#dwC376h5d?^iV8asM-SALZ!d!I!#FIJBB{B}+xZoRq#ycJ+2orw-
z!|yb$E_ttD^nEzr={)Uo4SEZnZS-<Uym-rEM!iLR`Dhz<IQ=>LYI&HaR9r+?KycsM
zS-z!torS5ATL?`Ev++Nb8egC}{v`Iq=$Z}&0E4g8uZnKnV`=5++r4h-b+Ld@PZDpM
zF{BpA@Me{;Sk|&>Z$r$_j<$22%2-~yf3`fiNc<n73TDR+%x0GayR?9%j1~=y>ec4x
zYKYK!O)4x!3!xz)=`7oV4$?D`j)+Y+gbzHf{9{W7nbopeO6~pKMk~OWx_?mIS`(Oc
z`Mb!u+)!qAl-szADba*3eba(r*NrPy0l^KOwK26<T~~2ecu^lEr&c=rEwfx5866a~
zu!)+NcD%9pcE_g0(H?FVfsX>!Wf=W5)DYDOSX?rOJBOb*r86a3a5TNLs0m3#4Kg$L
zTAnPKaP!vYThl&w)?22n<F_ZBRl(q0cJ?~H5${oY%>HZ-|IuB^PInG#x};4Gr{p&K
z!aYRhu%ClqePO!u(V}<sg}9rv1SxOQbK1_@ZvQ}Jw7{%uoa5>v^lV7qDin=Ww0Z%q
zk%gFDrRlw|T>E`}+n+!MKn0O^+rFrP(i_O*6M}$YU^H-K6x3oO!lX;p#NXC-us*$}
z*JxCpdMW2|nQl_?j=hv?jwWOA<_-V6@}`?I<%n)E$<+i=eYpeDO`QhdQAZ0sy-4qC
zdC#?@_%ZfU#P-b%X8A4V`z2i(3x<W+I*uyEN2iDWjAL?IC$1=XZXY_S8gZ(}{xJ8j
zxmI)9st3yG!WBIM&|5Mp%n}781%8hIjfOE^;Z3Y|yi|!R>N&hBc-pj?RvDn|#_lw(
zCo_P{@Crhob5yU?4JAVwBC^leTrKvu?=eLNykwhVMrk4y<3!X@zL#|YlFJoW$*_yg
zYI*DwG9Y%vG1sKdJ?;gUlPb5Lo?cS2dUHZ-j!N&mo(uZab8uTbv@FvfqPJcp%6)ip
zK<?<Jek{Uv{c(d^nbGy$zUF_bYc4vpaH~xKXTZ0&&U2;izcI5}1%7ov&QU#zvTbm%
zxDzg@(=(Niur7|M99y9feW={W*rZJZm3b!XFInPK$t4+ZH;%5c<@$}SrT4vciNduN
zW1$09X)+D25xi?a2lL}hbMU7VrT_iH{HRsR_qN9RDn%}od72bRR1RHSVu$W%kF`=d
z_ABn7|LF|5Q~G!JI)%JMDD97D@VMnzla7d;K!$skpo;P?jFdebS>fmd%^@j-;N`kJ
zs<-zU%q4wmjsR+O(a4hs5eM(5%-b5CG!O;^Y;cRp_G5&EKy~eYgS&zCg@23SXd?FU
z10#6|x+O^0;e%Iv7JA}@1ZUc!hN6Mhj+?jEY*__4vW;-CJDHA>kS@1$5e6cMTJlM_
zoUdK}kw>l$m$2XYl}agXH;Fzj+}uF6s^4x6d&%V_*G}$Wc^Pw~CzOTklI5kGg;8Yh
zc|n>qmFnL`2whS%VShpdX)89Q39!t5St#f6;v5@Ky7+gyvGm>iMrr-*B}wboG$q01
zk&Qcw5f5V3vntX929&U7Yw26S4>#d6H}<mKnVk^qo`!&WwZ)~)&e4*_t$YJuN>vDK
zk5<pC4I}ivKGKk=G+7OC|AwjhYkc=gaadN?!e$8?=Ux{e2_>F=d$|H*7Pc$m-kNVb
zwGoxE&r>hwqe5kB8oe(;p!5g%jfec_ZS*~4;l<MH^N;4=-x2)p2?;^O{R785X^GNl
z{P`+%A3AHT(eBqMtaNFPe0k$@Qq`^9GA!CNH3jV&`O*yr_qISYz;2n!t_O{mR_gKn
z0pt1Rp2MNm=%!p$?(o#s4W><7Ly4|8>Jcr5^N(u0z;^fF%Ecy6-$18y8)~f?y4}Fb
z7p0qY9J$dCB6@6Rp0-oY%Xxo#)kEHwc%ek-`*gehfPR(#%1W%sInpTHev5HKLS^Gy
z+pWZ|@}id+S93y7J@Sw;ei4fa@pW))qS>ACeut?$&+q2FLgQ;qhK<u#c5ksfo7GA)
zbLD38uEr1NGP2&C6wT~g395q+J-H;~V{77tj9ip5=Ez=YF~S(BZndOf&JU+O&TbC(
zDGlTPeS{B`Ln|r+3PwA?U^4UD0S7AD`!r8=oN)e?tH;r<nr4UgtammF8bDar(mSOv
zTF6u2c}ol-uvhHIMd~VOdK;wdE<r$+76Jkl6f{ij9(P&)@C0tongzd2HBx=*wFRFm
zaZZkn_CWE{zS^x}nxG8e1)0H8Cea3QshUjwr?IP6-W*ASh<35r^ls#$&6axWbx;2f
zw6^P1sYAM-XG?|b6D5O>G-8H!H8^LF7!`a?9!r^R84#rUy+lxkiIFFQmCJv$3j((o
z0SL?F=+YMZ{QYfvW&Ac<piS0Nu~Y)<t-*-aI<bzvEfI|(oSI6JpdO{47sp(QsDxX=
zyLz`Gqm~NW#e-PmxG~*4OYaiZKUR_sD%MATiZ~E=bNGq<WiaL0jgzjz1rH5W=jRm-
zm9Cdv%gvHhH1%@HqMO8Z8ja1s{&8`yh;SCi7}X`2D*EQjjT`?}Tx(xfA<V*5atb9k
z!KMVhz=;gN`_`Y){@+3^3S;32@){%pdK0GKpW^{_5v<&PJ~L+(qw|MfW6K<E4%#*b
zRK*hpPjqG0q&MeJjc;)!()`s`aGiadq>(AJ<HFcQ9?R7-j*U7Jqh;1{((>osx!aOb
z^uoXXH~Oqix%bmgXaVK#GX~|-d2M!fL8C<SCBsK`W@7aIOHk(Ttvq681^^52T8ZFF
zh*)PnLrb=3u>ok1Fn%T}FG}d9e!gXUWo3TK<&B^DzA`vQS@?M1K<8{ZFNK9J&sMd^
zBJL4wC_-ymA#5wxQ8bX8jSwS5WvzS2RjhPxKS`gz|C#JwHKW3qt6=zzG>ubLRB-uD
z*axrkfB^BNO};jV<J#`w(lUh616w|w673!2&Vy|UjVG1xWQbQtg6V!JD@tEx?bojn
z!YT@uQ<^p8E;lZJeA;qu3R*ZVriV%3Hmb8}ayr`@G?xY(nw5Ok<&eL?BvfgWCSA73
zb@u*D>5u#o3S@%iWTGJL^I{~eED4{^$8AZwlA=2mk}<L32z<h*a#z!-U}vC3@svsO
z!#kZ7k2x~F1VugNXgdk<bdhpz+c`WlG%;`WV5R95#b-T#)jEIcIed*XV$o}KQus*2
z`{FZ^CPQRPgA!tH@dvQ!HV=cPkwbt%)|0?fa6~*b7~?`b0RcN|OTx*_L>8mI$*dsr
z)Gl=Srp9Pxk&ofgHCyYJL>RM)#;Cd=u{5Rw#*kSJ?G>-Q#cPjo{;oLstF20-`27<T
zX%)xM!<Y4ZiN-jLPygQZk2g|GDXYiwnqfH9E$ms(5>K1ALON?o-(fF*zhq)4Gx0(0
zsS4sxy}m_~IKyZUVQNhAgWrCR5DT(npp4{-Z-P>?BQTd9gggP*h{Zj*)E|`Zbe1`^
z=!k&%Tyd#LNVhD<akmG#HAqERq(*H)aDNz6zwjd}bjs%#8-7G>zO9}gM}_hx=Foav
z;Rcq4Q!&L?jpp+B3q98r^vLuqcUsO1X<+UL%6w7<trQ!m8C{3#^q3Bn-tz>KGy=4T
zbV=`}g2Wh{Fm8W1WrWai7#H45t*#?j!d|qN{tD>xpU~^-2jq3R`QO|n#B<DzPGh1m
z-zWJ?c{<^${0X8oP-?eT<LFU$vQ)vapT1MXTjdNxRrBL32eHh<$fbt#4%_El3C2E_
z12@=8UhvPvrR&7i#(bN+@24#VpDo>a1AJOTP|}qtvDYj$Zu_gum!T~we=mSmM@8{V
zf;flF(FJDAP@9RKC-E-y+TWZ@Mzfei`8CyheKnauz$Nc^-(6_FezVM|HBr?6yy@*1
zS`BJjO!r?)4W^nE55wHi9_=lfUNssT=w3){6Kza?DdqB0&&EJ7m{e4U_t8uoglxeU
zS7sK=yT5cP`f)E6YOx8>;<w<q^A{wU!o(9j)y3Y^Zw#_Dy#JRJLZ}xKj-&uPy2WRP
zeacDxFG)`aXuZu#iwEQ~>Uu%Mp<L~dTQp6%<_E0uJK!4gv-JD6WWe*->F7o7C!_+y
z<t)kxvVYyVD)kc5zX@091m7a#O-vLe4pZx#%IrqO)!1{IPE_l{9ZY?3sZzr~uJNwj
zcAFYCYnZq(s|}@T$4rVoQJ5rm{=T$-p!)10^v`Q*gG>J%)0Qq66X)XZi*%ipoDz~x
zX1Zp^u34jBb;={=hO(UGL1vX3v1`Rki!JIuN0`b2;*QEDLH{Q7o10i2UQ7UNjh%rY
zLGB@IxN4X5P`b9197*dhvSRqTLl)RjQf)PjF>v@Y7PDmvu)g6+Ze<-sof2VZLp1as
z4#zEI{@irJP5U$2yqfsw#iF;mE=zmuP}VQJn@EpAMY#drEbj5GY`>e(tN{ANucwkV
zKMB>BX($OrTF`GYpSS-aqxka?0p5*s-nKFS8B#ebr$kB1QVwAba^NyQMGTH(tWb)5
zY9g|OtRrxEUesWlX_PEp){C9K?bh@Wm_+@>Mrkw%RWyt$?tNgiwK4c>#=Tx5T><GD
z`>5wML%!*xONoJVjEJJ+;zfJw-18i=`ioWcx8^+)M6KSjC8%x67hy26dpiZsf*ibl
zAP$*`mAlI2fi?Lh$adR$7NpR;ufKeyd%P-SuOnCTzJgpIe2VV$uqeJPq0xV+sM^$k
z_svoHMvB#dQE6V&E5<a9<iEC?v~VCZ+Tk(Qx8QQJ5XSay(^Xvh*I;qQxA=PPp!-JI
zm3#SPI)*6p1rtxDyz6GU=X(3m<bj80)}B_)Yaf;^#k<ON@m#T^5*6^NokIi;?9GIH
z;i4zoT6Eg9S7fZH=l5R|Tp}P5gdBm}`S~lrisiH%+=@e6)B+EsTFB`%B#2);#Uj)N
zP)%L5Ii}o8u7ypbUuq3YjEAiULW4C%Z@}XE<24_1IWEa0PNeg0QKB8lDXcFx&SWRw
zY!uE-{0KA((1miCobo6m#~C6MllkcFO}m(Ckf#F&r~!fF8CV;)_bn)3`5ZDSx~gCN
zdBgq(hy3D=nKoG27kR->nAl}Rdv^;wbR}O*%-tsj5OEa^4D!aub3ebBhTqCorDbEv
zt$U>FhAB}c?AND9JT&E5o*L0c+FX5sXa(CH7wc1j1lRYf<VL9aOMSkgA*oj99jS$s
z_9mh2EC$qySr5Wq7~}-J<PY$U4-nY;wGgQ7xWjU`z1*GjQ$4jZC@VNNum-QO|LLv)
zL*QrHUSPv><Jq6js+S;aU{dQy;P{vs!znMTIR-B3G2bpQnU`;VXsyA%ck(C(RJ0|f
zwK_qg(5N#em7;Ptcm>zLa($zuyYY0`;Y0t!Y~I9YL;iHO?#!*REx2`~Va_xSJ+<Ga
zhK#k9RcrngQ}uYhipzt~yoMJMr2e0duf6mfM^8#Pd0gI)fo&CM237>4@VW5O&rRv3
zt#=3=v&s?OW=#b}Q4nUjvkQb9f@=r7Y1usXmnf7Fvoe<23`FTihez%S{s3X2gZzlA
z>7*=lL)*VF^;5R!E40We$H!NAFZg~CoN18l6E#TXYNgWU^PmW2^nR-=`i*5}^XA5D
z7VX~}vqk21vPD~JJG+LlTuU^)<dc>Pt|#T1o5oG!o;P;J&-tFSS!emff9f;#Rk@LA
zY&2_lsZ(D&d~8%GlgJbQ1$GfUqfSxYJV7uiaa>)kdjvk|`9^mZ!{B-1AWa4~3H5Ai
z;jqU{vH<5XkzTUR=blqt2TcLYwpWlZo8T&rZ#G}!Qe)LFk85RPbXQ7JS&QM9#}V!M
z>Hj)JL31rU+lI8$aiOzE7lh#43R^Tt{M&0^{IN~`QabSfS&B}wy+jfLFh>9e+2_@E
zd-I*EXU9;O()8L|6ZMM&1_s114OSQ{SjnFEOyAyGoAxDGF_8B&O9&w)aCV5Kxf2B0
zT=JshML`i@@%}Ye5?n)a_$+6O-<R*bk}dq+z-3z>`}Xgzqm53lmysiRH*JgR1eA2T
z$o=-d$demwFTe3jxLo?as3;V+sGzm;cr}`I3|?hC>IMaC#di33G*TuAtdv6j^pO&;
zHjh1<3f>*SjYANia^V7%DYyP#YKWyaOJqFHcUyC~?%!W8sy6Ll>_PD7LA+A=!v4`s
zpJ#8hH4Ji#xuXoAl|*$JmklN+XCn3Dis)tQVN~U17iq<sMQRHQGv3lA&Se`g)1)1M
z1-y&H6p!ir{b;+u%i?;RRk`@fF7Q^Z?WIU#JX3olAla0tt91Rzg+#pEJ6rpGuoHNG
z-;s5w>7Cn$(gMk%=@=uE^Q(8E*V{W14l>u17?^YN9CymehL_ylRg_Z<8|4`5IQe-S
zcDcSQ;>jr~`lV$-XY28tcb$WI-D`(tLyK4Tg_>kKoj{RHIee{2U5{vTFVVwiGj!G^
zAC9@mf)@|q^I9+qF&sg-uMQBFHZWb(hyMi`2vKaL_Q3sS2;i~q|NVTs%q6Mg2w>ol
zqO{Lh4-C9}LHkAm){Tph@Z-a-ODFaqePy6z|L&X3Q!;7R1vgdxtGq!*EG|6Gj+F0`
z1uA`<lZsuKj6+YW8+2)?b;m?M)@uo&Iliyy8+DusmqfXRGm1g`o9On9&Hvuv9ic6$
z**q29DCKCu`1l3q-J9YslJQAp3(9Kwy6_2)+y8wtQC$BY8%M{U1%wVLj4RhUl~#Ie
z_Z~i+{dwdrbziBoC9v@th-)?9n&>YF-YP(AomB^qPPJ5`&}Ex|A)-gI_p!z){pioW
z^#L=z+=cMue$%R3h1wi#c$rFaQ=a-7744~SW&L00%#2i^f+lM>1x{yT(&2}b%<;Zi
zr_=NPf6s(!zqub_&N;9yR)8Es!bsLWMpiGU?nQ{HWxK0(SPh)3(xiz$fk<IAnFNS8
zzAu*-gh&Rzwi6rRRqfJ#7sxb`ewnJ#Lz?g#hT2NYP!P4umOD8QCTUzJnsB;*!%SU+
zx?mtA<etQ+5B!J~Ubj&}W4z2OTepzFkAOV}db4UGCj;F(>GH6&ML~}*i+z*srJq)G
zN~X$#67Kl1o?kZ7<EBY12lixn#!rfN$ZYe8Q(n}s_c}F|#LU0^@5u-XPF)XP>EJd}
z4(M`mqv-|it|F&QDS7)`y~EEW8WuP40B=nJ{YK}ri%)RX<kZ*yO%;jxdp&0ZQy(bv
zxnGC&j15w>R#GhU#GrE7j?J{^j$nr#k?`zyPAqmqj=Ws7=fbsVg2=ek2)1`ra#$X;
zoKS7zgeGHM#ZTUU?SBp5-@%yM1yIorX&d9l(u$MrZvKwFwkz-;_uE-B`}j>>e#Nq}
zOr~q5hZ+qpi&BJ}K7r~Kc(&_y0ms_Xk_BINbMCnRfFy^N2}`}RbeZJ4?@)?9zq8cF
z2yr!lKuVgxmL?}>dv{mB9}#+4rVAG=L<WLfG`@1{XYylRi_5sMW=n}AVOf#0li@9=
zH;O(4>4gklQ(4qnP}<bnnDCfP?vV(v8*r<9wU~fKLuo`>t`CY91ossQNN$p%e;GeP
zq)j9H7RbZ~{`8;iQC(R9gTdvOKC{U{%{PZIYiNft1@5p91(+)QZhIh$*z|=6cHuT4
zK?83&j76kc6v-p~Y&&Zmv-YQryS3mtm3#GEn~rV&;svcLSE~7_G&Fo^v4-e^{CN3c
zYiM)}%(k_3C8jT5Yn+|O8rIy1GgchSq)*q8L-#o}FE#oz2;1FIB0;cXNx<ReEB`fA
zFA*NsCwp-jpzBj>>j2_RvU==&h*>A@`qOR&=Q89=q+U3`vF2lDgWf2!1^tYSYbCDq
zxsS9wwbRGr4iVzA)rPA^7(czPQh#jZNR{P%8L!*I_9%ZI#GNb~oX|)bYIadCWx~YR
z48;s(g_Axbnar$RhOh6;hH26zB{n6Tuh7}A23!?&Mc9OpOo6o`;Y|do!4k@UM?&_&
znu)5015R1S=v@c_7hsY)3ua3v0+C$|ggMY%bMB;OyB<>v=V!up)NB4nuCL79*DlAf
zmH76bFyI&nK^|e!*9mR}BFEuNB?`3<mZzL8GfYC~Cmm^ACkuow-@0Q{u*WT#!&M<L
zDi*e@a3gpwcmb7{Du3NtZwB))x5;gt5An}7>>)I3(f1WXKS6d(K2}d}f~K^C8ylX5
zv!4z8ePT!kc}~|(x$_S9bs1v#T(j%Xf58DM;y;5mm=4~5zqiH0_w9sexAU(V#IO|O
z(Nglq9rpG&sYmC5i#RZ-CGOX`S3%(wug3L|qfHvqgyU*%EZDe1w0J$}^cd?_oR~MD
zJbMo=Bv}vq_iq0~F3VPKUhdu~yW375Clg@BiS>_C)3`9uVbdHpGog_?`=)EDS5mjx
zVJwrLYP2lr)!M{iV18vHtgML80dMCOo;?F|)yzRcKG;64^x{h4%|yt6pDE;zJr$@0
zpJ_Ao4gCZ5_r=}-*%F2SB&;r=l{{T$?qRw+MsVa`JAWV*+>>_A<@;B6v?a)2LjO(y
zh`EeC1A8v~Z%o(Vb!OBQ*V4qV5)b&Ht*u+TNE-ryl^z!TsbJIPs@B!-m}G?rPWA}N
zSHBgXAETD5j!lE5OqaOP;-#XtR)fdGtcs&gxqg>Z9jX~W4q?T9Q8!>91Fpt@5ulp+
z0eH!F2ytzugq;ZBabPk#6>X_1zUMm^?rYAXIuK0)XtftS5K#Dtt$dyhCoapkog1-A
z8HLeBR+e_jUIW$q0yS3<a_~={sej|_=DFFUh|^!n#R5?cN*ny~rUQC9lm>AQ8XT<}
zzVrfWY&Sgx-tCFB$+F$e(SWV$Q(Eb~5K&C7HF``<c(NV$UOI0;_~VuvZrpjUxf>q%
zM4jl-R?NLW&fgB#{i$6`^Ge^*^t{|Vr6=6*=>%pLgASbvQKQ!1Sz4N0dP)8#Z1Fkr
zQw_vE3t`-}sqYH}y2y*KI1c2OJ_3IuRbqGcaw@N4;0C#APZ()HT9AgdUqjW?Je4wE
zM!LN^OPY&wu=!H&88Ezr=rXAQf}<IjlxO}vBZO<V7d;EV7^<THGUr?x5>orNm6mH|
z`FUBz`^j7J!`w4oHAs^n8Wn>csS*@}cJyp$#Zsc_a1sAoFv7VGJ+rH;iKV}5_|=Qz
z$AkI>iAo~;_X^!v+D{fS_%Xws^;AT4DBOPbDWoC&L(=kZ1$0;z?%nQqSonYt_P?T8
zWm*xYr%h^@_TL+#y+R1IP~{BA1`<8~FOOB2jlSj9n@q%SvUu<1T54xrqc(fJP#b&G
z)RjZSxTLO3n(6&H3M7$#E{<ljsmUB5TRy7+BAiS6uqMk!-+|ET$^pg0K-7*-X7x^f
zsFc<jSIWl(#Yz$0h9({MTAKyfWp2EQNR?qLb4daswY&dg)yRs=fPeHt%n>dsUzmz!
zQk?<<uDK)QAwMu&d<0}0nRSu3?b+m3UPzvyK2Z~~nbN{|V@-w!L5^d!`IHuDhs|NP
zTx@OFvIJ9tSBLLWYH85TvaG;>S>8(jkB#F%z1jPC)A)F_3RJdE?{bI);)f55VqyDa
z*JKC3v5|G%uqh@)aH62WeKk4u+FK~A(S3IH%^>WUGlFmjb|g*5nBVh)3|PTRE6in4
z4_xLFxqkO!p`Zd}$9GHl%;7)Bi-QEIHV-Em=aU0o=8`{iy;V|gJL`i&C*HRxR;<rq
zoD_vETQ?>osdzWbXQ^@~fxZZTwyVKthE}QcHtnmS?UnsKZGKV&lr5R8Zn{aAO(cc-
zXnWP5iy%_L*tCYLQuC$>2v^~x=>aRnbV<c>POtps;V&A4ECFe5zVH&BIKtQ%(AHUD
z2BF`t_p+@xw?PVBb!_;ONljJgA-D6)+B#29suOQZp2+`w%O>~G{5mYHH&;w(Qk(Lh
zZM(l+Z71XB17j$cnW0y<CR2?L3+V0&G8P<GW_Sb+jh+8w!x+t&UOwrx{25*sSUq{Y
zG&yTl(?6agZcm3vWc0}R0n#Dp>hQtLZ7s)9bhZxxADHfZgiQ2{O@8}t&G-+jK&~!i
zsJ7oBlJn;$HA^)XW+xAlD=U+fFCPI)BFSBWJ96NAfdCism6-z{n`S}v%!xP_?PR{`
zNg4Vv+MK3sHm_Mzw^Eg+^t|Ikik9oJPs87rew&8S-ea%R5WK-hn_R`NzC1lE85rR=
zb4k_fMrK1@oT+=&JJiw$7At!wi|R8RdEKJ|*}A3jtXqor2@gz9AbkeJN&p<7wx*0&
z4xqGhSornV-v_*p@jb`$VQ_O=SQO9x;f#W(RW2ZQ4Vf|(&fnFDt{3SlKV1*=&#uWm
z)bRHU5krr2+u7w_m$ld(TaP<q7z|a69_6B!IZU>lf*+KMwhN!D9yT9glW>h^)w)1Z
zyer{`+bZdXovz(EKMwKgdiZSHFYs*P18CC1)#11$?)+YpS!yBe6=32|$<3!~4cj3E
zL*{x4c;LYGp8)WmQd51>_{2QIcZV`D+a3avZ;EVYsyOi{|Ef*LZA14ZmDvp_Cs`ar
zz>G7$Nd2L2eqel?$b)P-LG6i5FzcX8PS}2@Xk_9Wg=r||YX8TEbLMNOr4mi?W7uvv
zQkihIG}v(ZJM9aC%0iT|j)8==BS&Zv_!V%4aTj6PI@L=+%Ut!W6VQtXOmhhJr>O~^
zoPf&n+Q0oDhsMhZxnhG)Pqu%4`o!g8=Bmq_Ejw&8Af#D*R7Vn^^KOE+OKlB(g@qfj
zqy=fm71cO`Zl;&>r<q`-j3)=tVe*V<!qMm9wu_>nY3LIq2X;&yDLttbDT_@ByWs4&
zxbyGpOFrTVUAmB!Nn~FnX&oOoL^&wLUOfS~Y_0pk1T?nwW#2GF{5Jy)LHKSOtmar1
zzuoo?Gy0nvBJb|muz;_+N@~U)m{kprZ<J8+ebvvf1id=j|AbM=ZQSWf-8G)5b@38*
z8wu5#h?b{j9Dv=WZ&Nsb6rzG8qi<<kRmq6ooEfVP@CAN<RZ*KzI+c4^vx~y!cL1P3
zy#Mgh$UyguJRf_02l5FtWb7c}ldlP0eQh56uJqQjZSP=AeSmk#oe>iaGCK7hD{dAy
zQWVLr%`K~FgH*e!{-Ul*`{3Y<CQD_SxatQI?7WX{x5TkI2Z;JhLh<^W`%s!*)1;!X
zUKi0V+I^1$KdN|90cks+*@}|O=O4Q1AcMH}?+)Y-(%$;lK3^~Kf27~$3mnU{&6Rax
z9HmVP2brYwK+xfb&d-jy;lTTGyL&h@*}_bolw!?vQj|D@;}dwy!Dk}q-u{Qzs;{y(
zs-kIO^qH+7g_IUXy3_ynY65>TniPw(>BGqqkC#m9AD6h^sE!*@`hztwarxL&(wNK3
zT=|RzeIR(;S(z{Rbx~~7J^SA38~F3A>>Ex--t2|?*G%G9Y-gVZm$2|e9bHWAO(JIL
zKxOP`faFUMBWmk91HqyI;@M<oSHUZ&Gx>rLamxP@e0sExl4eTl-{BL}=GI=GIfx(5
zw(?ynY1oHs_G;x$zrNOl-u#7G+zzSJdzqzAK?nO>MRGrNwBMIGRbAx!aUsoDQ^jj3
zLmX8yKIqWg9Xi`F5cp|K#v4Y_+L0t$N?5h!<Ar9T@RQUH^jg8mpO1th1F3n%zm1CZ
z%q3{G<6+PLPxHi|$5GE6nS0nhB%cs(DUYU+CqG_%o3ZTu_GtllAYimLXRGhGEEo$G
z>q}!r7wStzqgFmQzD7ZxHw8lCy;XHA*^5bELkF^%(JNd=mvU+(Gs%o#?iMDiweBg)
zvXKfx0pq+Tm6W#h?U5*i5&(`|xl#f@lUizDZ@o@<8G<UnDb2c`Dec*LkOzra;S25f
zNm#S0>Gw;NkO+|YUC~5n6zh({KrMOM5XuxO*n(3FkxApHbr}-j$;c45%3f<yB)JNs
z7vUP~pR!G~;h`ca9)AEoxu#uI7DZ8L-bii=ycYhYNnc(a)}=)EEuf)syI)ER5M$fV
z^0=b&r|&<;31f0~PFE+Q2(yU)(1=vzIUOhB$1$W(jgHV-Xi`&8#-#BJa(vjSL7SVI
zlM(pnkqFflPa_s-9hL8IO(vuPX=)s>!Lo9^8y`8fsH7z$=gN}w11i)^UEHmu^&35v
zqi|4071wm5E6ZJGFPPY%%gP}OCDLDLXJzj(JLzQfu}<5}!{AQo?;PRP=P_B|zuPG3
z@Y^RQ%lOwEf#*OsDPOqbTD?D$(%$*s-*}Lg3a=i{WZmY5c6|WRv5s@!_8tMBjL8!z
zLGNNUlNA{ChJRJOAB$d<QI}R)KPsnj-RudsY-PVw>UwIytTZ*%KO=-2Pr!|eTw2?4
z7ioXkyM+;_1HrnAj-ThkPcSQSCz@9G7$<I0omfu!@ltb0yzMN)9uJV}{r<L?)R`d@
zk!AD79)Q4?oOYTQ|BeIrt7q{Xx%I0erGT=K&@3F{F4tumN%_Ts{PsvdDSl7`&zKs1
zW2mM8k-4YECse>3i8^Dhvs*xs+?_W^=wnEQLdo1R|0Xxru3gKi8Hd{F*~4>Pwu%zj
zs3-R;)jKqqMB0Seb7kGM{a2W}88nY11=nuAQBWVvZt`H`Xr9m>2_`js)lDkoTYX(-
zW=7Ws#4CmkL2+=`l&q^Nmd~<(l$3HvonHXf$i)pv06tUj@t2KTgdInKrewOvA)qxZ
zvxjVmIEe`i<B0gjpKPB3?cx&|3K%zX*^f8T$dtxa7Qg1cMY=<4i`khtU`jRDWjbif
zR$Nhwb8zc~*Yg-XY)1F|I1<2H+V)8yjG|w4vTliq7}-4PZ>-TH8VOQ$#!j)0diRvw
z2@4?99XJVbW!97BgNJU_WznfLns8kidvm)4QS-s@h*PgHvkEeZY4U^kB?vwYkXsJA
zHXHpd=mvqI?~Gno<2#|BF1!k^ReKh{8(jVK{XT5UE`+tjcaL^dG&1q`h7K?3jEJIU
z05S=&U#*`DCu1d-*0nx7yUFD((CW^e)E#wov$IByZ)_1B`Azkw$Z*4E8i+-L+$#c7
z4B%UVc>hQ8Img(dil4eR9e`TX4>M0FK#KDYSg<Vsdg`qO+*jr0>gt~h81gz!<kVh9
z9ryxxV&5u6*U~k;K}hF|kG;p+Y8~rzeXM!zqbtayps{{I1q?Y-wCvV>W`#4VvsyKT
z3bdWp1jp6sIr=l0o$f99uV762MHldLlLriR#fUfJN0)0gQ#e|$CQ04_j$#l)#Rts`
zCyoH}Acqh_aPP*zSr?;$npX_!sl}8q6}C#lzs*N)a>b1QVIb6;I}vb!yjQT-T)utx
z?%iI-Z^S4|rb&lrqvsV4wq!NpuF;$Olb0NfH)R`><?{;u3*&u^x;nYftPr7se;T$(
zyz(rslgsPzrUsQ$ZXR+SGkIV%iuN3Lw_a9oi@g2SG|CnEB6EAQ?a55rHPFyLXczzT
zwgex$T&WvB^?wqDdB<I_4=pIbJ|r~^)=I$E@HL$W>>Lm>qY2-B)TFb+y}dHin{bFH
zMaUg}As@G%Tk5gcfN}6D>Y&Q$89V_m5Uu{LZG<nWgv|Jk<ABhQ*DAx$<-I<tGWp!p
z3x*=ekt}Mn%JS&9&pS0)kcZa1Rlu`!Cj*B!oMTtZeXlv`w)otA_9aMK*`W=;dX}d}
zN8hF&emvs;r_sfE7i;j}hHO~>0cDP(Df_3XP3LqKw1oa1^H0fp^)F<79`hOrA6Y0H
zyum+zFOm@zO~W6%obG$@zI_aH@LRG-YfP)F+-;RE_n@%iWu?f|`AV>v7-ZQo&R?ek
z=;^QxO$h;?C#Su$r##~gL&Uv;)xsF6zrAy}?9zH#dmW4%12|G2Bw^*npypp48P{ue
zU)OII8zBS?6(E1Y-#alwFI$KS=T8a$t|J5LU2rK15iZ3jL+XuG<efNz6DeVEAvZaT
z*vfSy{r92_MM#ydWmYM)Bp+%E)Ma7@Iqk*!EoRK64-Gkss~Ix}>CByNC`%_fM_yAv
zrfR=EUEqbX#PEV)h)sUHq+1dR<txNF5CC|6i3Gz2!(w|MTX&qXf6ht!-PWiLUPg0)
z{DaIg>&$ChF<*u!A`nr^6z(3Djq>=mBL4(M&g8sb%*s9&t@{L|6Ck0ahKw#JV5$FS
zKZ^-?h^&mRoL?qHfEhoy%J0GRp9&5X#{^mI)KTLGgPsZg3X+R9y|L-lrTtR0zcmPe
z?@D$XxHa0N*6QbJ&duAHwOUJ2F|}xT1xcF^TIrW-2UW(Tu>N!c2{KYq8wCu4Dw1o9
zR0PeDJgJ>mOcao~BF_RH?WFE)V~WkUVo&wG7kCwF?ecF8C;S~cyz1le;r+t6Nu3Eb
zfCd_xZw{VTdDlg-wAnk}F-wqjYd8no`5oi%Q*5o1SMT)3V%Pr~uxMlwfhtkrU%u$?
zK~qCBUNaU&7KK8|#6+D1gqit`$x-Ltvf=OU`DQ8n#4jF1r1h9(nU2;1l2!rwbA018
z(ODE!q1MJ~N3&Bmj(3XeUq>1`wn!^>c8}!#4X0c0kLFzew1x6>eP*4#G1$R*i6_x^
zlv)TpGeHXW$i%m?DgP_I5rXqc043Jo6v&(8CXDbEBnix_z>6COb-k!l&w;t$RE2Jx
zM5a5{t~bi^9`Z+3vXgG|9H0^^*P3lO>Ri5ZJtXPi&t_D>lq2=Zwkar3K~2Hu@oj#J
zg4+$QO;^7PK`e$N9*>zQlnp)Bdsjxqs>VLl^!9~+5ekVaKvaj&wx4Y`G`~v`-sK%Z
zvE*j9z*nr@dQL#o`x2aVn*?z|d*Ov}R%_XRuGvKcxD{K@Z%@av@sY9ZY!x|H>?SlB
z#opY)+Ni<?Q;EFX$;oj$5ZRa_Ov_?xTI8xmi$>Vre=lk^C)`CwG3Nid=p;-)>+YA{
z(2!W*gs4}1?+Pa}jwZ-+((b`n|6<)}CK8IZi7V3gh!}9Z6L2EuKA6GJA^T4on7_sL
zhW%IHfNM#1pg(qq+V@fS*9$A|_`7P?Bcr5~vyb#V?83zfiwFo|<Pe#$axi_~sXS7;
z{l~5`IQ`Ekv)tMoTeHmqO3cmItG%+mge3z-qcgngPvbbg<7!c3l1XJ=Y9U#PQ}D77
zEpPr=w2a8&FHMsCEn^Z;Lqf;@6Uf>fw-hF7hb^r<2K@|k>dIe`XJFjpYkl9p7d0F7
zl)g%K*K*2$&=7aT<O}aQmCJA~(AyJ+3j=hf;0C%ogQO|H_9K&0m7<U<4g_D_kp=vg
zH{wElDss|SR*D-d`5iP^OlZH`-c?uF`NuZ?eb{?vK+yIJXn8TN)~updHZ>so`P$+c
z2aAT$=g4q;*8meSwEgqPt3Ec3MV|j6x*$!=4!rr`@pz4YMZqG+8?Rh8$jBI-Tb$Zi
zmZm0_Q=U|IrGrE6pcV2Tq^QWzv~U7ryR*y;`2-qcIMYYMkZIJ>E5c&%191LvuhzWv
z5nTJm*!x`S$)G1*SQ8&4$X=f=>P?)3nZM)mMsRi|;u!BAf*8vVel8AsQbqUGXnJ44
z=eyh2Sm)EX0Y+-_mZw4Um0kKat?y^J2IK2SMk|Le?UXt%*HckLoNaAtLJpjU4%$Jk
zZK?BEOy-k(W2>$yS%)%*yLatp;l(KdnLC|yI&{OWJbgJ(U^60SWn(bJTWxD0318Qk
zs{3v;O96sJiT+#omu-D^SLl*92l@a``I-}G#FEyYCFcBo_!nFS8GC*D7v^ARHM?yQ
zq!kJg&$_Bl&J7f$h6x|OJTv7F|1gbbcnD^a<duO^XOQaJoN|GWr=90;C}4`TJ=0kK
z)Q35U_rG1RQl}JXX%_<NUl#$fX^>YBQS!s!i?!Wx2@4Hp6dpLZ%0LflpS*RKZ=!Yu
z9b13rNQ3|WIGXDN_G*7$WHHnYw-%pogNpoh7WHYU?e~;nWlj}7j`8Y*gJ+XHLsKU|
zF1}pE4udkU`3UkVCHrV-^#X$grA3HPk@ps$KZ-p}0RYf502HqhkgBHdz*y=V=z5(A
zCx>+f*=&IA!Kuww%1&Yp*;6K*OOI5+AP$u!1>PltR{mjw)^e+d@Mv_%x>)s|#SVYg
zkX_n3xS`jYTJChd9!4olW>(e|=dDUY{>~iy{<j@G5rWm+eL1X5<xYm|v-I8STbqI3
z`IEb!?aOlB@pka3ox{53g5xw!bq`bzXT+gH%XU=OFW<E@Yl0yF<kOK-cxh8Is1Bcw
zyIqdVYH~}sKs%F^AD0lv`&~PVICQ(+?x&UX)UB?c&O>Jtns6XVOhz{<SNe7VS3Yiu
zS2UAs^v{I2p)*--O~8g+zE>2?Qo2_<-fVMZzBE~-w6)xJxN8jSs3CJ;Jp2Mp0aOP1
zAh!w{eR;etpxPHyii~elINM$aW0lgQ^KPl%wu_b`j&Wpatxrh(s?Umn60w9kAUuTl
zet~JOn)o>EbAO2&%Y*66TNok3kSmysd&BuzD=lVtKmA=kr$!Nep78)rfpRL6>n`T(
zO8bq3j#Y$ovE@IELc8s~4O-LU6GGGAqz`)vlHG4{dJiz#>`j2#nC!yAXQvwm!-Hgt
zB>jMq$7~xNq|?6V9s=wy^PYj`D7|iH{je7F-gUwI(#BthrB9}R&X)wr#N#$r4rhWl
z=+~Mi)dycPT4KlxYO7MAww~?jEO8UA!pK&ZwImK;Sm8LevIRCbKzY|e(b?Yg{Zuoo
zXgqw9uzyYk<&)b%)=Ng+OF+O2tY!si0j>F+T#f?ViHicr1b}e9O3B^7=Xgr+XLyMn
zNN;~DE+i%ucKh3j+KO*7o@M@U`vcYoz2fG$-I&xNp~Ezz16yzn*=fYSA6J^Ty2E6N
zvXmcvZe#{Kmv)44S1GIReRkYU!*~Ck04+Uht?%?N>SJ(AhQ-}^|ACroO{C<vHJyL)
z_3!_yC?t?%y$vsWSXn^X(OxSc(V(P{4zk<ca6S(%&Cj)t4#Rz%+t^(*Cb<KpH3XK^
zXYSj@0(#q@@c(q%E_$gYg0ti?X8*{2i$)j!DL)973<f&{x;+U*cHTGxC!7Au`CLx6
zE`%MXe=Z3Dla_E|n#0rTzR`qV0+`l{^^$c=fE~f1jl;P{;;}|>x4;DzWIAkJX?{i3
z2g64MAvE1zd@qfJ+zkObzK8GJi@pDE4g*djDTGC&2E0Y@p0x*`eJ)8N5>!$@MUHAv
zPcDp=GMpmJ97EX;p7cF2Nm#1`8f@RWK$A(sr=)^VKcOz#ckobjPsIT;jJW5ShfpdV
zs>v73c0W>!mdRf?oVW@yTNctUSbGuyQ260U<y!~y|FSxm!hGy?1LxLe$NmFl&jIeg
zyW%PpMzCRl{75|wqyN(Tj~6gdIu-Xqx~kh?4BB*k_rp1?<=BjCEtm$b<$4C2x#H4q
z?rOWXP#KndfL+RZ%*;>D4g7szOmM_27DKph7m6_rnx;X)#jhn_Q*SthvF<A66j})U
z_Y&AyX*TU5IjKOS=za6iE4m4C9yaiM<?nv{`KEd@wBslYWWU>V-IGxKq-g$-h1Kmd
zNBXv=c0-%mqf;^;Q3-Hu%}?4*ZVVjVYPPYvas+v*UGyT&H_h2Pe&uWzlq&2y4V~}!
z5>5q_)#W|DJp}k96I#|0l%GW9Rn^3#+B{93^2N@kEnQMUim$S03}%{PM8Syy4$}Ng
zW+;N0-QW~JB!aIM91a7shE}(&k$z}#Mm=7j0+B(k^Y3rYULfO{_y{;8B<z-%GFDF?
zupzd;Kq6c?6hv)a9(`>z;YlL3EY=&c`CXK)IvHTq3RR-O;IF(vHwMqU+oov{_XTM8
zY<W#=tFl*Bhr6uq0IJ~)0#9xY0VpH)xO26$yj3auKVWesI|?89{x6pKMp)Qtxhg5-
z87^{>)wPpQ%Bli@jts)}C2;yz*{{RoFZ-Gxa&g5VQ6x)qp;N6e`t^b~?+e)+i^Zc^
z^sx?;HeDPj*Njg^ZN0vs>h=(4w*iuu<daK)GJ@v5^gg42u(XR3{rLahT{3rOZNaN3
z3~(YiBmxl4NP%d2_u(fXQ2BpL-g)j^b=}Fk-!?q-XVQ4GWAQ&<xnI%yfhC9Su0)NA
z9=BG3tnzOBg4i0MdRcz$+b`dwJ8xaRWKce}fd{y5R<2L#cP8j&pAY{g&OgvD|EKv@
z`f=YsG7JwM{;pf9Gy5fz_Jw8NfU|qsb8Cv%vOM1*{GXBk{_oQkzy;NhHlBTdvoxo^
z6}asu?b5Y!;BuyF84cjHGh@%XWB#HM%AmD#NzZNfhZwW8h_CEfRH@Gn?7w_xXaFBu
z2t65TQqQg^8Pjj;PhIcN|9SS4>Fel@Mg7;OpDwuu?7;Q`JrVNRtRJ`$8#Go1+$VUm
z$a>N-+una+?}5XR{nN#EPrm2ndhMb5e`$t<<FWR;qmM88cKq;*mGSHhz<I}Iv9HC;
zUI1rk!}6>jP5IBzV6=7$-<cDYmCzyIz1!aWRkmkj;C-}0!tP}}C~!62E|%kVY~q-p
z5@xp5qThCM?i8nd_iC956_HO%s@_a?=w3Db@11qxwflDWf0z4vVZt`+vP1WuGkkii
zR;OnV^pw<mdCOPAKPN7prM0lVzhc+7e=9cDhuVEMJ#a5JUN3%mUn+1cB1^{_xX0|~
z*FP_dZVIZ`=&(<aH~X{l-1D2DvfuWb-jZX_^dA54PV{#7|C?o3^(wr5&)<oQ{~wC2
zdr{cGKjoXeLmlw8@YQ?mtM0_}Z~43MxZR!G7lF&77xe3VyODnJ*}<*T%eK^A|5_&A
zvoDHA`t!=WUagA1qIZH!uZmdV8*D9jHKS~+>b$j2w#B}MO}Q`!TopD7opK>V?d=Q0
z$N%~I^L}mpWZ4QFh0Fd39EH35vZBiR)?#;I+sHQ;lRIt*FS(@L_1^m5;U6c?eczsU
z`~EJ_7~RF>_@mxWXRuycvUU4h+bSMlBm3Knk46ari*MYY23GLc!D;%N`5In8qxz@w
zfeZut8l)G*;FbB}CGP-oC{zH*xbYh}w2LD0;v#UZCa_dT*2|1()}Q~W{rBrcGtam(
O0D-5gpUXO@geCyMVxb5C

literal 0
HcmV?d00001


From cd6692661d8c5314ba9409d9a132e1e2f3728fd9 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Sat, 9 Sep 2023 11:32:18 +0200
Subject: [PATCH 0711/1398] Move Sizing_field_base.h out of internal

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h        | 2 +-
 .../{internal => }/Isotropic_remeshing/Sizing_field_base.h      | 0
 .../include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h | 2 +-
 3 files changed, 2 insertions(+), 2 deletions(-)
 rename Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/{internal => }/Isotropic_remeshing/Sizing_field_base.h (100%)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index fcc96deb9baf..b1794a6a6b77 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
-#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h>
+#include <CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h>
 #include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 
 #include <CGAL/boost/graph/selection.h>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h
similarity index 100%
rename from Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h
rename to Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index c49273921074..02d21df369be 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
-#include <CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/Sizing_field_base.h>
+#include <CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h>
 
 #include <CGAL/number_utils.h>
 

From 22b08dfaf86a0a5792ea6d656b8b34a1b911dced Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Sat, 9 Sep 2023 11:46:43 +0200
Subject: [PATCH 0712/1398] Update documentation

Info on curvature calculation in Adaptive_sizing_field

Update reference manual welcome page
---
 .../doc/Polygon_mesh_processing/PackageDescription.txt     | 7 +++++--
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h   | 3 +++
 2 files changed, 8 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 83929a699818..74bfc24e231b 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -115,8 +115,6 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - `CGAL::Polygon_mesh_processing::split()`
 
 \cgalCRPSection{Meshing Functions}
-- \link PMP_meshing_grp `CGAL::Polygon_mesh_processing::isotropic_remeshing()` \endlink
-- \link PMP_meshing_grp `CGAL::Polygon_mesh_processing::split_long_edges()` \endlink
 - `CGAL::Polygon_mesh_processing::remesh_planar_patches()`
 - `CGAL::Polygon_mesh_processing::remesh_almost_planar_patches()`
 - `CGAL::Polygon_mesh_processing::refine()`
@@ -131,9 +129,14 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - `CGAL::Polygon_mesh_processing::smooth_mesh()` (deprecated)
 - `CGAL::Polygon_mesh_processing::angle_and_area_smoothing()`
 - `CGAL::Polygon_mesh_processing::tangential_relaxation()`
+- `CGAL::Polygon_mesh_processing::tangential_relaxation_with_sizing()`
 - `CGAL::Polygon_mesh_processing::smooth_shape()`
 - `CGAL::Polygon_mesh_processing::random_perturbation()`
 
+\cgalCRPSection{Sizing Fields}
+- `CGAL::Polygon_mesh_processing::Uniform_sizing_field()`
+- `CGAL::Polygon_mesh_processing::Adaptive_sizing_field()`
+
 \cgalCRPSection{Orientation Functions}
 - `CGAL::Polygon_mesh_processing::orient_polygon_soup()`
 - `CGAL::Polygon_mesh_processing::orient()`
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index b1794a6a6b77..60c9e5f76597 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -32,6 +32,9 @@ namespace Polygon_mesh_processing
 * provides a set of instructions for isotropic remeshing to achieve variable
 * mesh edge lengths as a function of local discrete curvatures.
 *
+* The local discrete curvatures are calculated using the
+* `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()` function.
+*
 * Edges longer than the local target edge length are split in half, while
 * edges shorter than the local target edge length are collapsed.
 *

From 7037103416379b20e7254325460696b95d98a20d Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Sat, 9 Sep 2023 12:49:03 +0200
Subject: [PATCH 0713/1398] Introduce ball_radius NP for curvature calculation
 in Adaptive_sizing_field

---
 .../Adaptive_sizing_field.h                   | 42 +++++++++++++++----
 1 file changed, 34 insertions(+), 8 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 60c9e5f76597..783b7f5e5669 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -71,31 +71,50 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
   *
   * @tparam FaceRange range of `boost::graph_traits<PolygonMesh>::%face_descriptor`,
   *         model of `Range`. Its iterator type is `ForwardIterator`.
+  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
   *
   * @param tol the error tolerance, used together with curvature to derive target edge length.
-   *       Lower tolerance values will result in shorter mesh edges.
+  *        Lower tolerance values will result in shorter mesh edges.
   * @param edge_len_min_max is the stopping criterion for minimum and maximum allowed
   *        edge length.
   * @param face_range the range of triangular faces defining one or several surface patches
   *        to be remeshed. It should be the same as the range of faces used for `isotropic_remeshing()`.
   * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. It should be the
   *              same mesh as the one used in `isotropic_remeshing()`.
+  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+
+  * \cgalNamedParamsBegin
+  *   \cgalParamNBegin{ball_radius}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
+  *                           by summing measures of faces inside a ball of this radius centered at the
+  *                           vertex expanded from. The summed face measures are weighted by their
+  *                           inclusion ratio inside this ball.}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures.
+  *                           It can effectively smooth the curvature field and consequently the sizing field.}
+  *     \cgalParamType{`Base::FT`}
+  *     \cgalParamDefault{`-1`}
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+  *                     measures on faces around the vertex.}
+  *   \cgalParamNEnd
   */
-  template <typename FaceRange>
+  template <typename FaceRange
+          , typename NamedParameters = parameters::Default_named_parameters>
   Adaptive_sizing_field(const double tol
                       , const std::pair<FT, FT>& edge_len_min_max
                       , const FaceRange& face_range
-                      , PolygonMesh& pmesh)
+                      , PolygonMesh& pmesh
+                      , const NamedParameters& np = parameters::default_values())
     : tol(tol)
     , m_short(edge_len_min_max.first)
     , m_long(edge_len_min_max.second)
     , m_vpmap(get(CGAL::vertex_point, pmesh))
     , m_vertex_sizing_map(get(Vertex_property_tag(), pmesh))
   {
+
     if (face_range.size() == faces(pmesh).size())
     {
       // calculate curvature from the whole mesh
-      calc_sizing_map(pmesh);
+      calc_sizing_map(pmesh, np);
     }
     else
     {
@@ -108,14 +127,16 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
                             is_selected, std::back_inserter(selection));
       Face_filtered_graph<PolygonMesh> ffg(pmesh, selection);
 
-      calc_sizing_map(ffg);
+      calc_sizing_map(ffg, np);
     }
   }
   ///@}
 
 private:
-  template <typename FaceGraph>
-  void calc_sizing_map(FaceGraph& face_graph)
+  template <typename FaceGraph
+          , typename NamedParameters = parameters::Default_named_parameters>
+  void calc_sizing_map(FaceGraph& face_graph
+                     , const NamedParameters& np)
   {
     //todo ip: please check if this is good enough to store curvature
     typedef Principal_curvatures_and_directions<K> Principal_curvatures;
@@ -123,6 +144,10 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
     typedef typename boost::property_map<FaceGraph,
       Vertex_curvature_tag>::type Vertex_curvature_map;
 
+    using parameters::choose_parameter;
+    using parameters::get_parameter;
+    typename Base::FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
+
 #ifdef CGAL_PMP_REMESHING_VERBOSE
     int oversize  = 0;
     int undersize = 0;
@@ -132,7 +157,8 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
 
     Vertex_curvature_map vertex_curvature_map = get(Vertex_curvature_tag(), face_graph);
     interpolated_corrected_principal_curvatures_and_directions(face_graph
-                                                             , vertex_curvature_map);
+                                                             , vertex_curvature_map
+                                                             , parameters::ball_radius(radius));
     // calculate vertex sizing field L(x_i) from the curvature field
     for(vertex_descriptor v : vertices(face_graph))
     {

From 426c6f9f5b156b1938ab59f19e2682c5cf7e3ff5 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Sat, 9 Sep 2023 15:56:04 +0200
Subject: [PATCH 0714/1398] Update polyhedron demo with ball_radius np in
 Adaptive_sizing_field

---
 .../Adaptive_sizing_field.h                   |   7 +-
 .../Plugins/PMP/Isotropic_remeshing_dialog.ui | 219 ++++++++++--------
 .../PMP/Isotropic_remeshing_plugin.cpp        |  73 ++++--
 3 files changed, 191 insertions(+), 108 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 783b7f5e5669..6525d7b2f85f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -85,10 +85,9 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
 
   * \cgalNamedParamsBegin
   *   \cgalParamNBegin{ball_radius}
-  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-  *                           by summing measures of faces inside a ball of this radius centered at the
-  *                           vertex expanded from. The summed face measures are weighted by their
-  *                           inclusion ratio inside this ball.}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures.
+  *                           It can potentially smooth the curvature and consequently the sizing field in the
+   *                          case of noisy input.}
   *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures.
   *                           It can effectively smooth the curvature field and consequently the sizing field.}
   *     \cgalParamType{`Base::FT`}
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_dialog.ui b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_dialog.ui
index 540a52c1bff9..fd2e9c6ab6c3 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_dialog.ui
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_dialog.ui
@@ -10,7 +10,7 @@
     <x>0</x>
     <y>0</y>
     <width>381</width>
-    <height>545</height>
+    <height>620</height>
    </rect>
   </property>
   <property name="windowTitle">
@@ -59,7 +59,68 @@
      <property name="title">
       <string>Isotropic remeshing</string>
      </property>
-     <layout class="QGridLayout" name="gridLayout_2" rowstretch="0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0" columnstretch="0,0">
+     <layout class="QGridLayout" name="gridLayout_2" rowstretch="0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0" columnstretch="0,0">
+      <item row="15" column="1">
+       <widget class="QCheckBox" name="curvSmooth_checkbox">
+        <property name="text">
+         <string/>
+        </property>
+       </widget>
+      </item>
+      <item row="13" column="0" alignment="Qt::AlignRight">
+       <widget class="QLabel" name="minEdgeLength_label">
+        <property name="text">
+         <string>Minimum edge length</string>
+        </property>
+       </widget>
+      </item>
+      <item row="25" column="1">
+       <widget class="QCheckBox" name="smooth1D_checkbox">
+        <property name="text">
+         <string/>
+        </property>
+       </widget>
+      </item>
+      <item row="22" column="1">
+       <widget class="QSpinBox" name="nbSmoothing_spinbox">
+        <property name="minimum">
+         <number>0</number>
+        </property>
+        <property name="maximum">
+         <number>100</number>
+        </property>
+        <property name="value">
+         <number>1</number>
+        </property>
+       </widget>
+      </item>
+      <item row="12" column="0" alignment="Qt::AlignRight">
+       <widget class="QLabel" name="errorTol_label">
+        <property name="text">
+         <string>Error tolerance</string>
+        </property>
+       </widget>
+      </item>
+      <item row="24" column="1">
+       <widget class="QCheckBox" name="protect_checkbox">
+        <property name="text">
+         <string/>
+        </property>
+        <property name="checked">
+         <bool>true</bool>
+        </property>
+       </widget>
+      </item>
+      <item row="12" column="1">
+       <widget class="DoubleEdit" name="errorTol_edit">
+        <property name="text">
+         <string/>
+        </property>
+        <property name="placeholderText">
+         <string>0.00</string>
+        </property>
+       </widget>
+      </item>
       <item row="3" column="0">
        <layout class="QHBoxLayout" name="horizontalLayout_2">
         <property name="spacing">
@@ -109,7 +170,7 @@
         </item>
        </layout>
       </item>
-      <item row="15" column="0">
+      <item row="17" column="0">
        <spacer name="verticalSpacer">
         <property name="orientation">
          <enum>Qt::Vertical</enum>
@@ -122,87 +183,17 @@
         </property>
        </spacer>
       </item>
-      <item row="18" column="0" colspan="2">
-       <spacer name="verticalSpacer_3">
-        <property name="orientation">
-         <enum>Qt::Vertical</enum>
-        </property>
-        <property name="sizeType">
-         <enum>QSizePolicy::Maximum</enum>
-        </property>
-        <property name="sizeHint" stdset="0">
-         <size>
-          <width>20</width>
-          <height>24</height>
-         </size>
-        </property>
-       </spacer>
-      </item>
-      <item row="12" column="0" alignment="Qt::AlignRight">
-       <widget class="QLabel" name="errorTol_label">
-        <property name="text">
-         <string>Error tolerance</string>
-        </property>
-       </widget>
-      </item>
-      <item row="12" column="1">
-       <widget class="DoubleEdit" name="errorTol_edit">
-        <property name="text">
-         <string/>
-        </property>
-        <property name="placeholderText">
-         <string>0.00</string>
-        </property>
-       </widget>
-      </item>
-      <item row="13" column="0" alignment="Qt::AlignRight">
-       <widget class="QLabel" name="minEdgeLength_label">
-        <property name="text">
-         <string>Minimum edge length</string>
-        </property>
-       </widget>
-      </item>
-      <item row="20" column="1">
-       <widget class="QCheckBox" name="smooth1D_checkbox">
-        <property name="text">
-         <string/>
-        </property>
-       </widget>
-      </item>
-      <item row="17" column="1">
-       <widget class="QSpinBox" name="nbSmoothing_spinbox">
-        <property name="minimum">
-         <number>0</number>
-        </property>
-        <property name="maximum">
-         <number>100</number>
-        </property>
-        <property name="value">
-         <number>1</number>
-        </property>
-       </widget>
-      </item>
-      <item row="19" column="1">
-       <widget class="QCheckBox" name="protect_checkbox">
-        <property name="text">
-         <string/>
-        </property>
-        <property name="checked">
-         <bool>true</bool>
-        </property>
-       </widget>
-      </item>
-      <item row="17" column="0">
-       <widget class="QLabel" name="nbSmoothing_label">
+      <item row="25" column="0">
+       <widget class="QLabel" name="smooth1D_label">
         <property name="text">
-         <string>Number of Smoothing iterations</string>
+         <string>Allow 1D smoothing along borders</string>
         </property>
         <property name="alignment">
          <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
         </property>
        </widget>
       </item>
-      <item row="19" column="0">
+      <item row="24" column="0">
        <widget class="QLabel" name="protect_label">
         <property name="text">
          <string>Protect borders/selected edges</string>
@@ -212,24 +203,14 @@
         </property>
        </widget>
       </item>
-      <item row="21" column="1">
+      <item row="26" column="1">
        <widget class="QCheckBox" name="preserveDuplicates_checkbox">
         <property name="text">
          <string/>
         </property>
        </widget>
       </item>
-      <item row="20" column="0">
-       <widget class="QLabel" name="smooth1D_label">
-        <property name="text">
-         <string>Allow 1D smoothing along borders</string>
-        </property>
-        <property name="alignment">
-         <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
-        </property>
-       </widget>
-      </item>
-      <item row="21" column="0">
+      <item row="26" column="0">
        <widget class="QLabel" name="preserveDuplicates_label">
         <property name="text">
          <string>Preserve duplicated edges</string>
@@ -239,7 +220,7 @@
         </property>
        </widget>
       </item>
-      <item row="16" column="1">
+      <item row="21" column="1">
        <widget class="QSpinBox" name="nbIterations_spinbox">
         <property name="minimumSize">
          <size>
@@ -252,7 +233,7 @@
         </property>
        </widget>
       </item>
-      <item row="16" column="0">
+      <item row="21" column="0">
        <widget class="QLabel" name="nbIterations_label">
         <property name="text">
          <string>Number of Main iterations</string>
@@ -265,6 +246,22 @@
         </property>
        </widget>
       </item>
+      <item row="23" column="0" colspan="2">
+       <spacer name="verticalSpacer_3">
+        <property name="orientation">
+         <enum>Qt::Vertical</enum>
+        </property>
+        <property name="sizeType">
+         <enum>QSizePolicy::Maximum</enum>
+        </property>
+        <property name="sizeHint" stdset="0">
+         <size>
+          <width>20</width>
+          <height>24</height>
+         </size>
+        </property>
+       </spacer>
+      </item>
       <item row="11" column="0">
        <widget class="QLabel" name="edgeLength_label">
         <property name="text">
@@ -312,6 +309,46 @@
         </property>
        </widget>
       </item>
+      <item row="22" column="0">
+       <widget class="QLabel" name="nbSmoothing_label">
+        <property name="text">
+         <string>Number of Smoothing iterations</string>
+        </property>
+        <property name="alignment">
+         <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
+        </property>
+       </widget>
+      </item>
+      <item row="16" column="0">
+       <widget class="QLabel" name="curvSmoothBallR_label">
+        <property name="text">
+         <string>Ball radius</string>
+        </property>
+        <property name="alignment">
+         <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
+        </property>
+       </widget>
+      </item>
+      <item row="15" column="0">
+       <widget class="QLabel" name="curvSmooth_label">
+        <property name="text">
+         <string>Curvature smoothing</string>
+        </property>
+        <property name="alignment">
+         <set>Qt::AlignRight|Qt::AlignTrailing|Qt::AlignVCenter</set>
+        </property>
+       </widget>
+      </item>
+      <item row="16" column="1">
+       <widget class="DoubleEdit" name="curvSmoothBallR_edit">
+        <property name="placeholderText">
+         <string>-1</string>
+        </property>
+        <property name="clearButtonEnabled">
+         <bool>false</bool>
+        </property>
+       </widget>
+      </item>
      </layout>
     </widget>
    </item>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index a819c2c22943..06155a62c217 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -300,7 +300,8 @@ class Polyhedron_demo_isotropic_remeshing_plugin :
                       const double target_length,
                       const double error_tol,
                       const double min_length,
-                      const double max_length)
+                      const double max_length,
+                      const double curv_ball_r)
   {
     std::vector<edge_descriptor> p_edges;
     for(edge_descriptor e : edges(pmesh))
@@ -335,7 +336,8 @@ class Polyhedron_demo_isotropic_remeshing_plugin :
               error_tol
               , edge_min_max
               , faces(*selection_item->polyhedron())
-              , *selection_item->polyhedron());
+              , *selection_item->polyhedron()
+              , CGAL::parameters::ball_radius(curv_ball_r));
         CGAL::Polygon_mesh_processing::split_long_edges(
           p_edges
           , adaptive_sizing
@@ -394,6 +396,8 @@ public Q_SLOTS:
       unsigned int nb_smooth = ui.nbSmoothing_spinbox->value();
       bool protect = ui.protect_checkbox->isChecked();
       bool smooth_features = ui.smooth1D_checkbox->isChecked();
+      bool curv_smooth = ui.curvSmooth_checkbox->isChecked();
+      double curv_ball_r = ui.curvSmoothBallR_edit->value();
 
       // wait cursor
       QApplication::setOverrideCursor(Qt::WaitCursor);
@@ -425,7 +429,8 @@ public Q_SLOTS:
       {
         if (edges_only)
         {
-          do_split_edges(edge_sizing_type, selection_item, pmesh, target_length, error_tol, min_length, max_length);
+          do_split_edges(edge_sizing_type, selection_item, pmesh,
+                         target_length, error_tol, min_length, max_length, curv_ball_r);
         }
         else //not edges_only
         {
@@ -461,7 +466,8 @@ public Q_SLOTS:
               }
               else
               {
-                do_split_edges(edge_sizing_type, selection_item, pmesh, target_length, error_tol, min_length, max_length);
+                do_split_edges(edge_sizing_type, selection_item, pmesh,
+                               target_length, error_tol, min_length, max_length, curv_ball_r);
               }
             }
 
@@ -517,7 +523,8 @@ public Q_SLOTS:
                 PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol
                                                                , edge_min_max
                                                                , faces(*selection_item->polyhedron())
-                                                               , *selection_item->polyhedron());
+                                                               , *selection_item->polyhedron()
+                                                               , CGAL::parameters::ball_radius(curv_ball_r));
                 if (fpmap_valid)
                   CGAL::Polygon_mesh_processing::isotropic_remeshing(faces(*selection_item->polyhedron())
                      , adaptive_sizing_field
@@ -600,7 +607,8 @@ public Q_SLOTS:
                 PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol
                                                                , edge_min_max
                                                                , faces(*selection_item->polyhedron())
-                                                               , *selection_item->polyhedron());
+                                                               , *selection_item->polyhedron()
+                                                               , CGAL::parameters::ball_radius(curv_ball_r));
                 if (fpmap_valid)
                   CGAL::Polygon_mesh_processing::isotropic_remeshing(selection_item->selected_facets
                      , adaptive_sizing_field
@@ -675,9 +683,10 @@ public Q_SLOTS:
               {
                 std::pair<double, double> edge_min_max{min_length, max_length};
                 PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol
-                                                                           , edge_min_max
-                                                                           , faces(pmesh)
-                                                                           , pmesh);
+                                                                , edge_min_max
+                                                                , faces(pmesh)
+                                                                , pmesh
+                                                                , CGAL::parameters::ball_radius(curv_ball_r));
                 CGAL::Polygon_mesh_processing::split_long_edges(
                   edges_to_split
                   , target_length
@@ -704,7 +713,8 @@ public Q_SLOTS:
                 PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol
                                                                              , edge_min_max
                                                                              , faces(pmesh)
-                                                                             , pmesh);
+                                                                             , pmesh
+                                                                             , CGAL::parameters::ball_radius(curv_ball_r));
                 CGAL::Polygon_mesh_processing::split_long_edges(
                   edges_to_split
                   , adaptive_sizing_field
@@ -799,7 +809,8 @@ public Q_SLOTS:
             PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol
                     , edge_min_max
                     , faces(*poly_item->polyhedron())
-                    , *poly_item->polyhedron());
+                    , *poly_item->polyhedron()
+                    , CGAL::parameters::ball_radius(curv_ball_r));
             if (fpmap_valid)
             CGAL::Polygon_mesh_processing::isotropic_remeshing(
                  faces(*poly_item->polyhedron())
@@ -862,6 +873,8 @@ public Q_SLOTS:
     unsigned int nb_iter = 1;
     bool protect = false;
     bool smooth_features = true;
+    bool curv_smooth = false;
+    double curv_ball_r = -1;
 
     std::vector<Scene_facegraph_item*> selection;
     for(int index : scene->selectionIndices())
@@ -902,6 +915,8 @@ public Q_SLOTS:
         nb_iter = ui.nbIterations_spinbox->value();
         protect = ui.protect_checkbox->isChecked();
         smooth_features = ui.smooth1D_checkbox->isChecked();
+        curv_smooth = ui.curvSmooth_checkbox->isChecked();
+        curv_ball_r = ui.curvSmoothBallR_edit->value();
         }
       }
     }
@@ -1011,6 +1026,8 @@ public Q_SLOTS:
     unsigned int nb_iter_;
     bool protect_;
     bool smooth_features_;
+    bool curv_smooth_;
+    double curv_ball_r_;
 
   protected:
     void remesh(Scene_facegraph_item* poly_item,
@@ -1042,7 +1059,8 @@ public Q_SLOTS:
           PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol_
                                                                      , edge_min_max
                                                                      , faces(*poly_item->polyhedron())
-                                                                     , *poly_item->polyhedron());
+                                                                     , *poly_item->polyhedron()
+                                                                     , CGAL::parameters::ball_radius(curv_ball_r_));
           CGAL::Polygon_mesh_processing::split_long_edges(
             border_edges
           , target_length_
@@ -1072,7 +1090,8 @@ public Q_SLOTS:
           PMP::Adaptive_sizing_field<Face_graph> adaptive_sizing_field(error_tol_
                                                          , edge_min_max
                                                          , faces(*poly_item->polyhedron())
-                                                         , *poly_item->polyhedron());
+                                                         , *poly_item->polyhedron()
+                                                         , CGAL::parameters::ball_radius(curv_ball_r_));
           CGAL::Polygon_mesh_processing::isotropic_remeshing(
               faces(*poly_item->polyhedron())
             , target_length_
@@ -1234,6 +1253,10 @@ public Q_SLOTS:
       ui.minEdgeLength_edit->hide();
       ui.maxEdgeLength_label->hide();
       ui.maxEdgeLength_edit->hide();
+      ui.curvSmooth_checkbox->hide();
+      ui.curvSmooth_label->hide();
+      ui.curvSmoothBallR_edit->hide();
+      ui.curvSmoothBallR_label->hide();
     }
     else if (index == 1)
     {
@@ -1245,6 +1268,25 @@ public Q_SLOTS:
       ui.minEdgeLength_edit->show();
       ui.maxEdgeLength_label->show();
       ui.maxEdgeLength_edit->show();
+      ui.curvSmooth_checkbox->show();
+      ui.curvSmooth_label->show();
+      ui.curvSmoothBallR_edit->show();
+      ui.curvSmoothBallR_label->show();
+    }
+  }
+
+  void update_after_curvSmooth_click()
+  {
+    if (ui.curvSmooth_checkbox->isChecked())
+    {
+      ui.curvSmoothBallR_label->setEnabled(true);
+      ui.curvSmoothBallR_edit->setEnabled(true);
+    }
+    else
+    {
+      ui.curvSmoothBallR_label->setEnabled(false);
+      ui.curvSmoothBallR_edit->setValue(-1);
+      ui.curvSmoothBallR_edit->setEnabled(false);
     }
   }
 
@@ -1268,6 +1310,7 @@ public Q_SLOTS:
     connect(ui.splitEdgesOnly_checkbox, SIGNAL(clicked(bool)), this, SLOT(update_after_splitEdgesOnly_click()));
     connect(ui.edgeSizing_type_combo_box, SIGNAL(currentIndexChanged(int)),
       this, SLOT(on_edgeSizing_type_combo_box_changed(int)));
+    connect(ui.curvSmooth_checkbox, SIGNAL(clicked(bool)), this, SLOT(update_after_curvSmooth_click()));
 
     //Set default parameters
     Scene_interface::Bbox bbox = poly_item != nullptr ? poly_item->bbox()
@@ -1313,6 +1356,10 @@ public Q_SLOTS:
     on_edgeSizing_type_combo_box_changed(0);
     ui.protect_checkbox->setChecked(false);
     ui.smooth1D_checkbox->setChecked(true);
+    ui.curvSmooth_checkbox->setChecked(false);
+    ui.curvSmoothBallR_label->setEnabled(false);
+    ui.curvSmoothBallR_edit->setEnabled(false);
+    ui.curvSmoothBallR_edit->setValue(-1);
 
     if (nullptr != selection_item)
     {

From b370381e0a54153a2c48b8748001b244c4d232d4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 12 Sep 2023 15:26:31 +0200
Subject: [PATCH 0715/1398] add missing ending

---
 .../include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 6525d7b2f85f..d77803bba822 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -95,6 +95,7 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
   *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
   *                     measures on faces around the vertex.}
   *   \cgalParamNEnd
+  * \cgalNamedParamsEnd
   */
   template <typename FaceRange
           , typename NamedParameters = parameters::Default_named_parameters>

From cf1b5fd46af49ea1d557c2fb499d99a6c07fc043 Mon Sep 17 00:00:00 2001
From: Nicolas Saillant <saillantnicolas01@gmail.com>
Date: Wed, 13 Sep 2023 11:38:45 +0200
Subject: [PATCH 0716/1398] Update CMakeLists for QT6

---
 .../Hyperbolic_triangulation_2/CMakeLists.txt |  2 +-
 .../Periodic_3_triangulation_3/CMakeLists.txt |  3 +-
 .../CMakeLists.txt                            |  2 +-
 .../CMakeLists.txt                            | 33 +++----------------
 .../Principal_component_analysis/PCA_demo.cpp |  6 ----
 5 files changed, 9 insertions(+), 37 deletions(-)

diff --git a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
index 9d46e7227294..c4191347bfdc 100644
--- a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
+++ b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
@@ -20,7 +20,7 @@ if(CGAL_Qt6_FOUND
    set(CMAKE_AUTOUIC ON)
    set(CMAKE_AUTORCC ON)
 
-  qt_add_executable ( HDT2 HDT2.cpp)
+  qt_add_executable ( HDT2 HDT2.cpp resources/Delaunay_triangulation_2.qrc)
   target_include_directories(HDT2 PRIVATE ./ ./include)
   add_to_cached_list( CGAL_EXECUTABLE_TARGETS HDT2 )
   target_link_libraries ( HDT2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
diff --git a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
index 22c26c48986b..7225c76cd3ba 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
+++ b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
@@ -50,7 +50,8 @@ if(CGAL_Qt6_FOUND
     periodic_3_triangulation_3_demo.cpp
     MainWindow.ui
     moc_MainWindow.cpp
-    Periodic_3_triangulation_3.qhc)
+    Periodic_3_triangulation_3.qhc
+    Periodic_3_triangulation_3.qrc)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS periodic_3_triangulation_3_demo)
 
diff --git a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
index d3ba88394b2f..3b838ba2c829 100644
--- a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
+++ b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
@@ -24,7 +24,7 @@ if((CGAL_Core_FOUND OR LEDA_FOUND)
    set(CMAKE_AUTORCC ON)
 
   # cpp files
-  qt_add_executable(P4HDT2 P4HDT2.cpp P4HDT2.ui)
+  qt_add_executable(P4HDT2 P4HDT2.cpp P4HDT2.ui Main_resources.qrc)
 
   target_link_libraries(P4HDT2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)
   if(TARGET CGAL::CGAL_Core)
diff --git a/Principal_component_analysis/demo/Principal_component_analysis/CMakeLists.txt b/Principal_component_analysis/demo/Principal_component_analysis/CMakeLists.txt
index 9b7e95914aae..9a6ace55f2b3 100644
--- a/Principal_component_analysis/demo/Principal_component_analysis/CMakeLists.txt
+++ b/Principal_component_analysis/demo/Principal_component_analysis/CMakeLists.txt
@@ -3,15 +3,6 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Principal_component_analysis_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
 include_directories(./)
 
 # Find CGAL and CGAL Qt6
@@ -25,30 +16,16 @@ if(NOT TARGET CGAL::Eigen3_support)
 endif()
 
 # Find Qt6 itself
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets OpenGL)
+find_package(Qt6 QUIET COMPONENTS Widgets OpenGL)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
-  qt6_wrap_ui(UI_FILES MainWindow.ui)
-
-  include(AddFileDependencies)
-
-  qt6_generate_moc("MainWindow.h"
-                   "${CMAKE_CURRENT_BINARY_DIR}/MainWindow_moc.cpp")
-  add_file_dependencies(MainWindow_moc.cpp
-                        "${CMAKE_CURRENT_SOURCE_DIR}/MainWindow.h")
-
-  qt6_generate_moc("Viewer.h" "${CMAKE_CURRENT_BINARY_DIR}/Viewer_moc.cpp")
-  add_file_dependencies(Viewer_moc.cpp "${CMAKE_CURRENT_SOURCE_DIR}/Viewer.h")
-
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES PCA_demo.qrc)
+  set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  add_file_dependencies(
-    PCA_demo.cpp "${CMAKE_CURRENT_BINARY_DIR}/MainWindow_moc.cpp"
-    "${CMAKE_CURRENT_BINARY_DIR}/Viewer_moc.cpp")
-  add_executable(PCA_demo PCA_demo.cpp ${UI_FILES} ${CGAL_Qt6_RESOURCE_FILES}
-                          ${CGAL_Qt6_MOC_FILES})
+  qt_add_executable(PCA_demo PCA_demo.cpp MainWindow.ui MainWindow.cpp Viewer.cpp Scene.cpp)
 
   target_link_libraries(PCA_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt6
                                          CGAL::Eigen3_support Qt6::Widgets Qt6::OpenGL)
diff --git a/Principal_component_analysis/demo/Principal_component_analysis/PCA_demo.cpp b/Principal_component_analysis/demo/Principal_component_analysis/PCA_demo.cpp
index 04b8cf11f13c..a5a393c4d478 100644
--- a/Principal_component_analysis/demo/Principal_component_analysis/PCA_demo.cpp
+++ b/Principal_component_analysis/demo/Principal_component_analysis/PCA_demo.cpp
@@ -51,9 +51,3 @@ int main(int argc, char **argv)
   return app.exec();
 }
 
-#  include "Scene.cpp"
-#  include "Viewer.cpp"
-#  include "Viewer_moc.cpp"
-#  include "MainWindow.cpp"
-#  include "MainWindow_moc.cpp"
-

From 4b3279e66589ddce5159d4973cebc4b1f51e28ec Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 13 Sep 2023 14:59:10 +0200
Subject: [PATCH 0717/1398] Remove the "Use OpenGL" option from 2D demos

---
 .../include/CGAL/Qt/DemosMainWindow.h         |  2 -
 .../include/CGAL/Qt/DemosMainWindow_impl.h    | 40 -------------------
 2 files changed, 42 deletions(-)

diff --git a/GraphicsView/include/CGAL/Qt/DemosMainWindow.h b/GraphicsView/include/CGAL/Qt/DemosMainWindow.h
index d28d98b37188..8f71f6bf1171 100644
--- a/GraphicsView/include/CGAL/Qt/DemosMainWindow.h
+++ b/GraphicsView/include/CGAL/Qt/DemosMainWindow.h
@@ -89,7 +89,6 @@ public Q_SLOTS:
 
 protected Q_SLOTS:
   void setUseAntialiasing(bool checked);
-  void setUseOpenGL(bool checked);
   void popupAboutCGAL();
   void popupAboutDemo();
 
@@ -108,7 +107,6 @@ protected Q_SLOTS:
   GraphicsViewNavigation* navigation;
   QLabel* xycoord ;
 
-  QAction *actionUse_OpenGL;
   QAction *actionUse_Antialiasing;
   QAction *actionAbout;
   QAction *actionAboutCGAL;
diff --git a/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h b/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h
index 8b6cb174703c..5f8c85c1d7f3 100644
--- a/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h
+++ b/GraphicsView/include/CGAL/Qt/DemosMainWindow_impl.h
@@ -32,7 +32,6 @@
 #include <QMessageBox>
 #include <QStatusBar>
 #include <QGraphicsView>
-#include <QOpenGLWidget>
 #include <QTextStream>
 #include <QSettings>
 #include <QUrl>
@@ -41,7 +40,6 @@
 #  include <QSvgGenerator>
 #endif
 #include <QtCore>
-#include <QtOpenGL>
 
 #include <CGAL/config.h> // needed to get CGAL_VERSION_STR
 #include <CGAL/Qt/DemosMainWindow.h>
@@ -62,13 +60,6 @@ DemosMainWindow::DemosMainWindow(QWidget * parent, ::Qt::WindowFlags flags)
   xycoord->setMinimumSize(xycoord->sizeHint());
   xycoord->clear();
 
-  actionUse_OpenGL = new QAction(this);
-  actionUse_OpenGL->setObjectName("actionUse_OpenGL");
-  actionUse_OpenGL->setCheckable(true);
-  actionUse_OpenGL->setText(tr("Use &OpenGL"));
-  actionUse_OpenGL->setStatusTip(tr("Make Qt use OpenGL to display the graphical items, instead of its native painting system."));
-  actionUse_OpenGL->setShortcut(tr("Ctrl+G"));
-
   actionUse_Antialiasing = new QAction(this);
   actionUse_Antialiasing->setObjectName("actionUse_Antialiasing");
   actionUse_Antialiasing->setCheckable(true);
@@ -151,12 +142,9 @@ DemosMainWindow::setupOptionsMenu(QMenu* menuOptions)
   if(!menuOptions->isEmpty()) {
     menuOptions->addSeparator();
   }
-  menuOptions->addAction(actionUse_OpenGL);
   menuOptions->addAction(actionUse_Antialiasing);
   connect(actionUse_Antialiasing, SIGNAL(toggled(bool)),
           this, SLOT(setUseAntialiasing(bool)));
-  connect(actionUse_OpenGL, SIGNAL(toggled(bool)),
-          this, SLOT(setUseOpenGL(bool)));
   actionUse_Antialiasing->setChecked(true);
 }
 
@@ -203,34 +191,6 @@ DemosMainWindow::setUseAntialiasing(bool checked)
                            1000);
 }
 
-CGAL_INLINE_FUNCTION
-void
-DemosMainWindow::setUseOpenGL(bool checked)
-{
-  if(checked) {
-    QOpenGLWidget* new_viewport = new QOpenGLWidget(this);
-    new_viewport->setUpdateBehavior(QOpenGLWidget::NoPartialUpdate);
-
-    // Setup the format to allow antialiasing with OpenGL:
-    // one need to activate the SampleBuffers, if the graphic driver allows
-    // this.
-    auto glformat = new_viewport->format();
-    glformat.setSamples(4);
-    new_viewport->setFormat(glformat);
-
-    view->setViewport(new_viewport);
-    view->setViewportUpdateMode(QGraphicsView::FullViewportUpdate);
-  }
-  else {
-    view->setViewport(new QWidget(this));
-    view->setViewportUpdateMode(QGraphicsView::MinimalViewportUpdate);
-  }
-  statusBar()->showMessage(tr("OpenGL %1activated").arg(checked?"":"de-"),
-                           1000);
-  view->viewport()->installEventFilter(navigation);
-  view->setFocus();
-}
-
 CGAL_INLINE_FUNCTION
 QMenu*
 DemosMainWindow::getMenu(QString objectName, QString title)

From 0d9037b8dacbae191c3f7deac483d30fffca06a3 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 13 Sep 2023 14:59:21 +0200
Subject: [PATCH 0718/1398] add the ui file

---
 .../demo/Hyperbolic_triangulation_2/CMakeLists.txt          | 6 ++----
 1 file changed, 2 insertions(+), 4 deletions(-)

diff --git a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
index c4191347bfdc..2f75d88b48ae 100644
--- a/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
+++ b/Hyperbolic_triangulation_2/demo/Hyperbolic_triangulation_2/CMakeLists.txt
@@ -4,9 +4,6 @@ project(Hyperbolic_triangulation_2_Demo)
 # Find includes in corresponding build directories
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
-# Instruct CMake to run moc automatically when needed.
-set(CMAKE_AUTOMOC ON)
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Core Qt6)
 find_package(LEDA QUIET)
 
@@ -17,10 +14,11 @@ if(CGAL_Qt6_FOUND
    AND Qt6_FOUND
    AND (CGAL_Core_FOUND OR LEDA_FOUND))
 
+   set(CMAKE_AUTOMOC ON)
    set(CMAKE_AUTOUIC ON)
    set(CMAKE_AUTORCC ON)
 
-  qt_add_executable ( HDT2 HDT2.cpp resources/Delaunay_triangulation_2.qrc)
+  qt_add_executable ( HDT2 HDT2.cpp HDT2.ui resources/Delaunay_triangulation_2.qrc )
   target_include_directories(HDT2 PRIVATE ./ ./include)
   add_to_cached_list( CGAL_EXECUTABLE_TARGETS HDT2 )
   target_link_libraries ( HDT2 PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::Widgets)

From cb68fdf09ecec5e2e26f3d866799ccf931dd35c5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 13 Sep 2023 15:20:11 +0200
Subject: [PATCH 0719/1398] Add breaking changes

---
 Installation/CHANGES.md | 12 ++++++++++++
 1 file changed, 12 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 479984002682..01485063f191 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -35,6 +35,18 @@ Release date: October 2023
 -   Removed the class templates `Gray_image_mesh_domain_3`, `Implicit_mesh_domain_3`, and `Labeled_image_mesh_domain_3`
     which are deprecated since CGAL-4.13.
 
+### [Tetrahedral Remeshing](https://doc.cgal.org/6.0/Manual/packages.html#PkgTetrahedralRemeshing)
+-   **Breaking change**: The template parameters of
+    `CGAL::Tetrahedral_remeshing::Remeshing_cell_base_3`
+    have been modified, reverting changes introduced in CGAL 5.6.
+-   **Breaking change**: The vertex base of
+    `CGAL::Tetrahedral_remeshing::Remeshing_vertex_base_3`
+    must now be a model of the concept ` SimplicialMeshVertexBase_3` (and not only `TriangulationVertexBase_3`).
+
+### [3D Simplicial Mesh Data Structure](https://doc.cgal.org/6.0/Manual/packages.html#PkgSMDS3)
+-   **Breaking change**: The template parameters of
+    `CGAL::Simplicial_mesh_cell_base_3`
+    have been modified to enable passing a geometric traits and a custom cell base class.
 
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------

From 67baec27a1e9b9d64128d054ddc12fdd625a090c Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 13 Sep 2023 15:37:01 +0200
Subject: [PATCH 0720/1398] Fix Optimal_transportation_reconstruction_2_Demo

---
 .../CMakeLists.txt                            | 56 +++----------------
 .../dialog_options.cpp                        |  3 +
 .../dialog_options.h                          |  1 +
 .../scene.h                                   |  1 +
 .../window.cpp                                |  1 -
 5 files changed, 14 insertions(+), 48 deletions(-)
 create mode 100644 Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/dialog_options.cpp

diff --git a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
index 2b4aafc27cb8..5b8060beca2b 100644
--- a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
+++ b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
@@ -3,27 +3,11 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Optimal_transportation_reconstruction_2_Demo)
 
-if(NOT POLICY CMP0070 AND POLICY CMP0053)
-  # Only set CMP0053 to OLD with CMake<3.10, otherwise there is a warning.
-  cmake_policy(SET CMP0053 OLD)
-endif()
-
-if(POLICY CMP0071)
-  cmake_policy(SET CMP0071 NEW)
-endif()
-
-# Include this package's headers first
-include_directories(BEFORE ./ ./include)
-
 # Find CGAL and CGAL Qt6
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # Find Qt6 itself
 find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
-if(Qt6_FOUND)
-  add_definitions(-DQT_NO_KEYWORDS)
-  set(CMAKE_INCLUDE_CURRENT_DIR ON)
-endif(Qt6_FOUND)
 
 # Find CImg
 find_path(
@@ -40,33 +24,15 @@ else()
 endif()
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
+  set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
-  set(SRCS glviewer.cpp scene.cpp Otr2_demo.cpp window.cpp render.cpp)
-
-  set(CGAL_Qt6_MOC_FILES moc_dialog_options.cxx moc_glviewer.cxx moc_window.cxx)
-
-  set(UIS pwsrec.ui options.ui)
-
-  qt6_wrap_ui(UI_FILES ${UIS})
-
-  include(AddFileDependencies)
-
-  qt6_generate_moc("window.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_window.cxx")
-  add_file_dependencies(moc_window.cxx "${CMAKE_CURRENT_SOURCE_DIR}/window.h")
-
-  qt6_generate_moc("glviewer.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_glviewer.cxx")
-  add_file_dependencies(moc_glviewer.cxx
-                        "${CMAKE_CURRENT_SOURCE_DIR}/glviewer.h")
-
-  qt6_generate_moc("dialog_options.h"
-                   "${CMAKE_CURRENT_BINARY_DIR}/moc_dialog_options.cxx")
-  add_file_dependencies(moc_dialog_options.cxx
-                        "${CMAKE_CURRENT_SOURCE_DIR}/dialog_options.h")
-
-  qt6_add_resources(CGAL_Qt6_RESOURCE_FILES pwsrec.qrc)
+  add_definitions(-DQT_NO_KEYWORDS)
+  set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
-  add_executable(Otr2_demo ${SRCS} ${CGAL_Qt6_MOC_FILES} ${UI_FILES}
-                           ${CGAL_Qt6_RESOURCE_FILES})
+  add_executable(Otr2_demo glviewer.cpp scene.cpp Otr2_demo.cpp window.cpp render.cpp dialog_options.cpp
+                           pwsrec.ui options.ui pwsrec.qrc)
 
   target_link_libraries(Otr2_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::OpenGLWidgets)
 
@@ -86,9 +52,7 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Otr2_demo)
-else(
-  CGAL_Qt6_FOUND
-  AND Qt6_FOUND)
+else()
 
   set(OTR2_MISSING_DEPS "")
 
@@ -102,6 +66,4 @@ else(
 
   message("NOTICE: This demo requires ${OTR2_MISSING_DEPS} and will not be compiled.")
 
-endif(
-  CGAL_Qt6_FOUND
-  AND Qt6_FOUND)
+endif()
diff --git a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/dialog_options.cpp b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/dialog_options.cpp
new file mode 100644
index 000000000000..4419cbc979d5
--- /dev/null
+++ b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/dialog_options.cpp
@@ -0,0 +1,3 @@
+#include "dialog_options.h"
+
+Dialog_options::~Dialog_options() {}
diff --git a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/dialog_options.h b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/dialog_options.h
index 8df3c2c86056..25d3f497bd51 100644
--- a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/dialog_options.h
+++ b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/dialog_options.h
@@ -26,6 +26,7 @@ public Q_SLOTS:
     {
         setupUi(this);
     }
+    virtual ~Dialog_options();
 
     void set_all_ranges()
     {
diff --git a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/scene.h b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/scene.h
index 7ac83c723f59..9cc6b7240571 100644
--- a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/scene.h
+++ b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/scene.h
@@ -17,6 +17,7 @@
 #ifdef CGAL_USE_CIMG
 #define cimg_display 0 // To avoid X11 or Windows-GDI dependency
 #include <CImg.h>
+#include <QMessageBox>
 #endif
 #include <utility>      // std::pair
 #include <vector>
diff --git a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/window.cpp b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/window.cpp
index 31003233b111..3e52a5ef95e6 100644
--- a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/window.cpp
+++ b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/window.cpp
@@ -11,7 +11,6 @@
 
 // local
 #include "window.h"
-#include "ui_options.h"
 #include "dialog_options.h"
 
 MainWindow::MainWindow() :

From 86e28d2c85e868b20a41ac5939673bc324e6c830 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 13 Sep 2023 15:45:15 +0200
Subject: [PATCH 0721/1398] Change default model

---
 Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
index 66e9653f1b41..113215b631a1 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
@@ -63,7 +63,7 @@ using Facet = Triangulation::Facet;
 int main(int argc, char** argv)
 {
   // Read the input
-  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/armadillo.off");
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/bull.off");
   std::cout << "Reading " << filename << "..." << std::endl;
 
   Points points;

From b01da56a56ee4418dc2396f6541ed1ffa7796497 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 13 Sep 2023 17:13:39 +0200
Subject: [PATCH 0722/1398] remove occurrences of OpenGLWidgets in demos' CMake
 scripts

---
 GraphicsView/demo/Polygon/CMakeLists.txt                    | 2 +-
 .../Optimal_transportation_reconstruction_2/CMakeLists.txt  | 4 ++--
 .../demo/Polyhedron/implicit_functions/CMakeLists.txt       | 6 +-----
 3 files changed, 4 insertions(+), 8 deletions(-)

diff --git a/GraphicsView/demo/Polygon/CMakeLists.txt b/GraphicsView/demo/Polygon/CMakeLists.txt
index 341021360a39..303b381e038f 100644
--- a/GraphicsView/demo/Polygon/CMakeLists.txt
+++ b/GraphicsView/demo/Polygon/CMakeLists.txt
@@ -13,7 +13,7 @@ if(NOT TARGET CGAL::Eigen3_support)
   return()
 endif()
 
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   include(${CGAL_USE_FILE})
diff --git a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
index 5b8060beca2b..d62d77e37b77 100644
--- a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
+++ b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
@@ -7,7 +7,7 @@ project(Optimal_transportation_reconstruction_2_Demo)
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # Find Qt6 itself
-find_package(Qt6 QUIET COMPONENTS Widgets OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Widgets)
 
 # Find CImg
 find_path(
@@ -34,7 +34,7 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_executable(Otr2_demo glviewer.cpp scene.cpp Otr2_demo.cpp window.cpp render.cpp dialog_options.cpp
                            pwsrec.ui options.ui pwsrec.qrc)
 
-  target_link_libraries(Otr2_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt6 Qt6::OpenGLWidgets)
+  target_link_libraries(Otr2_demo PRIVATE CGAL::CGAL CGAL::CGAL_Qt6)
 
   # Link with pthread if necessary
   if(CIMG_INCLUDE_DIR)
diff --git a/Polyhedron/demo/Polyhedron/implicit_functions/CMakeLists.txt b/Polyhedron/demo/Polyhedron/implicit_functions/CMakeLists.txt
index b821fd3e7791..174535ff5d5e 100644
--- a/Polyhedron/demo/Polyhedron/implicit_functions/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/implicit_functions/CMakeLists.txt
@@ -23,11 +23,7 @@ include_directories(BEFORE ${Mesh_3_implicit_functions_BINARY_DIR} ../include)
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 # Find Qt6 itself
-set(QT_USE_QTXML TRUE)
-set(QT_USE_QTMAIN TRUE)
-set(QT_USE_QTSCRIPT TRUE)
-set(QT_USE_QTOPENGL TRUE)
-find_package(Qt6 QUIET COMPONENTS OpenGLWidgets)
+find_package(Qt6 QUIET COMPONENTS Core)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   # put plugins (which are shared libraries) at the same location as

From 03e89cc97b23d23c75964274969a69ba89fb138a Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 13 Sep 2023 17:57:54 +0200
Subject: [PATCH 0723/1398] fix periodic_3_triangulation_3_demo

---
 .../demo/Periodic_3_triangulation_3/CMakeLists.txt     | 10 +---------
 .../demo/Periodic_3_triangulation_3/MainWindow.cpp     |  8 ++++++++
 .../demo/Periodic_3_triangulation_3/MainWindow.h       |  7 +------
 3 files changed, 10 insertions(+), 15 deletions(-)
 create mode 100644 Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.cpp

diff --git a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
index 7225c76cd3ba..bab63515c66d 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
+++ b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/CMakeLists.txt
@@ -25,12 +25,6 @@ if(CGAL_Qt6_FOUND
    set(CMAKE_AUTOUIC ON)
    set(CMAKE_AUTORCC ON)
 
-  # use the Qt MOC preprocessor on classes that derive from QObject
-  qt6_generate_moc("Scene.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_Scene.cpp")
-  qt6_generate_moc("MainWindow.h"
-                   "${CMAKE_CURRENT_BINARY_DIR}/moc_MainWindow.cpp")
-  qt6_generate_moc("Viewer.h" "${CMAKE_CURRENT_BINARY_DIR}/moc_Viewer.cpp")
-
   # generate QtAssistant collection file
   add_custom_command(
     OUTPUT ${CMAKE_CURRENT_BINARY_DIR}/Periodic_3_triangulation_3.qhc
@@ -44,12 +38,10 @@ if(CGAL_Qt6_FOUND
   qt_add_executable(
     periodic_3_triangulation_3_demo
     Scene.cpp
-    moc_Scene.cpp
     Viewer.cpp
-    moc_Viewer.cpp
+    MainWindow.cpp
     periodic_3_triangulation_3_demo.cpp
     MainWindow.ui
-    moc_MainWindow.cpp
     Periodic_3_triangulation_3.qhc
     Periodic_3_triangulation_3.qrc)
 
diff --git a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.cpp b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.cpp
new file mode 100644
index 000000000000..2d77555e636b
--- /dev/null
+++ b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.cpp
@@ -0,0 +1,8 @@
+#include "MainWindow.h"
+
+MainWindow::~MainWindow() {
+  process->close();
+  delete(process);
+  delete(s);
+  delete(ui);
+}
diff --git a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.h b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.h
index 79b3e5bec140..ca9bf07e1160 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.h
+++ b/Periodic_3_triangulation_3/demo/Periodic_3_triangulation_3/MainWindow.h
@@ -102,12 +102,7 @@ class MainWindow : public QMainWindow
             this, SLOT(about()));
   }
 
-  ~MainWindow() {
-    process->close();
-    delete(process);
-    delete(s);
-    delete(ui);
-  }
+  ~MainWindow();
 
 public Q_SLOTS:
   void help() {

From 09a4ac1ad7769a229985094188815368a673ff4b Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 14 Sep 2023 14:39:45 +0200
Subject: [PATCH 0724/1398] cosmetic changes

---
 .../Optimal_transportation_reconstruction_2/CMakeLists.txt  | 2 +-
 .../demo/Periodic_Lloyd_3/CMakeLists.txt                    | 6 +++---
 Three/include/CGAL/Three/exceptions.h                       | 3 ---
 Triangulation_3/demo/Triangulation_3/CMakeLists.txt         | 4 +---
 Triangulation_3/demo/Triangulation_3/MainWindow.cpp         | 4 +---
 Triangulation_3/demo/Triangulation_3/MainWindow.ui          | 6 ------
 6 files changed, 6 insertions(+), 19 deletions(-)

diff --git a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
index d62d77e37b77..207781a6c6b9 100644
--- a/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
+++ b/Optimal_transportation_reconstruction_2/demo/Optimal_transportation_reconstruction_2/CMakeLists.txt
@@ -61,7 +61,7 @@ else()
   endif()
 
   if(NOT Qt6_FOUND)
-    set(OTR2_MISSING_DEPS "Qt6.4, ${OTR2_MISSING_DEPS}")
+    set(OTR2_MISSING_DEPS "Qt6, ${OTR2_MISSING_DEPS}")
   endif()
 
   message("NOTICE: This demo requires ${OTR2_MISSING_DEPS} and will not be compiled.")
diff --git a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
index cb944392edf4..579699f9b6e7 100644
--- a/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
+++ b/Periodic_3_triangulation_3/demo/Periodic_Lloyd_3/CMakeLists.txt
@@ -7,7 +7,6 @@ project(Periodic_Lloyd_3_Demo)
 # Find includes in corresponding build directories
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
 # Instruct CMake to run moc automatically when needed.
-set(CMAKE_AUTOMOC ON)
 
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
@@ -21,8 +20,9 @@ if(CGAL_Qt6_FOUND
 
   include_directories(BEFORE ./)
 
-   set(CMAKE_AUTOUIC ON)
-   set(CMAKE_AUTORCC ON)
+  set(CMAKE_AUTOMOC ON)
+  set(CMAKE_AUTOUIC ON)
+  set(CMAKE_AUTORCC ON)
 
   if(DEFINED QT_QCOLLECTIONGENERATOR_EXECUTABLE)
 
diff --git a/Three/include/CGAL/Three/exceptions.h b/Three/include/CGAL/Three/exceptions.h
index 927489b4f203..ccf67496230f 100644
--- a/Three/include/CGAL/Three/exceptions.h
+++ b/Three/include/CGAL/Three/exceptions.h
@@ -19,9 +19,6 @@
 #include <exception>
 #include <QString>
 #include <QApplication>
-//#include <QScriptable>
-//#include <QScriptContext>
-//#include <QScriptEngine>
 #include <optional>
 #include <QStringList>
 
diff --git a/Triangulation_3/demo/Triangulation_3/CMakeLists.txt b/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
index ab246bc44268..1cf16c563dfd 100644
--- a/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
+++ b/Triangulation_3/demo/Triangulation_3/CMakeLists.txt
@@ -7,9 +7,6 @@ project(Triangulation_3_Demo)
 # Find includes in corresponding build directories
 set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
-# Instruct CMake to run moc automatically when needed.
-set(CMAKE_AUTOMOC ON)
-
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6)
 
 find_package(Qt6 QUIET COMPONENTS Widgets OpenGL)
@@ -40,6 +37,7 @@ endif()
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
 
   include_directories(BEFORE ./)
+  set(CMAKE_AUTOMOC ON)
   set(CMAKE_AUTOUIC ON)
   set(CMAKE_AUTORCC ON)
 
diff --git a/Triangulation_3/demo/Triangulation_3/MainWindow.cpp b/Triangulation_3/demo/Triangulation_3/MainWindow.cpp
index 3e8af7b0b0b1..030948e7a2ca 100644
--- a/Triangulation_3/demo/Triangulation_3/MainWindow.cpp
+++ b/Triangulation_3/demo/Triangulation_3/MainWindow.cpp
@@ -72,8 +72,6 @@ void MainWindow::connectActions()
   // Help menu actions
   QObject::connect(this->actionDemo_Help, SIGNAL(triggered()),
            this->viewer, SLOT(help()));
-  QObject::connect(this->actionAbout_T3_demo, SIGNAL(triggered()),
-       this, SLOT(popupAboutDemo()));
 
   // Quit
   QObject::connect(this->actionQuit, SIGNAL(triggered()),
@@ -214,7 +212,7 @@ void MainWindow::on_actionClear_Scene_triggered()
 void MainWindow::popupAboutCGAL()
 {
   // read contents from .html file
-  QFile about_CGAL(":/documentation/documentation/about.html");
+  QFile about_CGAL(":/documentation/documentation/about_CGAL.html");
   about_CGAL.open(QIODevice::ReadOnly|QIODevice::Text);
   QString about_CGAL_txt = QTextStream(&about_CGAL).readAll();
 
diff --git a/Triangulation_3/demo/Triangulation_3/MainWindow.ui b/Triangulation_3/demo/Triangulation_3/MainWindow.ui
index e808c9eda3ba..0bdf33a8176f 100644
--- a/Triangulation_3/demo/Triangulation_3/MainWindow.ui
+++ b/Triangulation_3/demo/Triangulation_3/MainWindow.ui
@@ -112,7 +112,6 @@
      <string>Help</string>
     </property>
     <addaction name="actionDemo_Help"/>
-    <addaction name="actionAbout_T3_demo"/>
    </widget>
    <addaction name="menuFile"/>
    <addaction name="menuEdit"/>
@@ -555,11 +554,6 @@
     <string>Stop Animation</string>
    </property>
   </action>
-  <action name="actionAbout_T3_demo">
-   <property name="text">
-    <string>About T3_demo</string>
-   </property>
-  </action>
  </widget>
  <layoutdefault spacing="3" margin="1"/>
  <customwidgets>

From 3fca44f9492f5e5e70de0bd560dffba54603eb0d Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Thu, 14 Sep 2023 16:04:23 +0300
Subject: [PATCH 0725/1398] Left \ingroup statements in separe lines

---
 .../Arrangement_on_surface_2/CGAL/Arrangement_2.h    | 12 ++++++------
 .../CGAL/Arrangement_on_surface_2.h                  |  2 +-
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_2.h
index bf3e048637d7..a269c6e01842 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_2.h
@@ -160,12 +160,12 @@ class Arrangement_2 : public Arrangement_on_surface_2<Traits, typename Default_p
 
 namespace CGAL {
 
-/*! \ingroup PkgArrangementOnSurface2Insert insert The function `%insert`
- * inserts one or more curves or \f$ x\f$-monotone curves into a given
- * arrangement, where no restrictions are imposed on the inserted curves. If an
- * inserted curve is not \f$ x\f$-monotone curve, it is subdivided into \f$
- * x\f$-monotone subcurves (and perhaps isolated points), which are inserted
- * into the arrangement.
+/*! \ingroup PkgArrangementOnSurface2Insert
+ * The function `%insert` inserts one or more curves or \f$ x\f$-monotone curves
+ * into a given arrangement, where no restrictions are imposed on the inserted
+ * curves. If an inserted curve is not \f$ x\f$-monotone curve, it is subdivided
+ * into \f$ x\f$-monotone subcurves (and perhaps isolated points), which are
+ * inserted into the arrangement.
  *
  * \cgalHeading{Requirements}
  *
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
index 4ae02d2b0e14..fe4de62ca8f0 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
@@ -1014,7 +1014,7 @@ class Arrangement_on_surface_2 {
 
 namespace CGAL {
 
-/*! \ingroup PkgArrangementOnSurface2Insert insert
+/*! \ingroup PkgArrangementOnSurface2Insert
  * The function `%insert` inserts one or more curves or \f$ x\f$-monotone
  * curves into a given arrangement, where no restrictions are imposed on the
  * inserted curves. If an inserted curve is not \f$ x\f$-monotone curve, it is

From e93a09901caa9c96eafb667e128e3e593459c0d3 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 14 Sep 2023 15:13:46 +0200
Subject: [PATCH 0726/1398] finish review of polyhedron demo

---
 Polyhedron/demo/Polyhedron/Scene.cpp             | 1 -
 Polyhedron/demo/Polyhedron/Show_point_dialog.cpp | 2 +-
 2 files changed, 1 insertion(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene.cpp b/Polyhedron/demo/Polyhedron/Scene.cpp
index a00ef63117f3..feb5ab6f0024 100644
--- a/Polyhedron/demo/Polyhedron/Scene.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene.cpp
@@ -15,7 +15,6 @@
 #include <QObject>
 #include <QMetaObject>
 #include <QString>
-#include <QOpenGLWidget>
 #include <QEvent>
 #include <QMouseEvent>
 #include <QPainter>
diff --git a/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp b/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp
index 5df594bc57c4..915c6a0494f6 100644
--- a/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp
+++ b/Polyhedron/demo/Polyhedron/Show_point_dialog.cpp
@@ -53,7 +53,7 @@ void Show_point_dialog::interprete_string(const QString& string)
     + "$";
 
   QRegularExpression re(full_re);
-  QRegularExpressionMatch match = re.match(string); // AF @todo  QRegExp had exactMatch()
+  QRegularExpressionMatch match = re.match(string);
   if(match.hasMatch()) {
     // const double x = re.cap(1).toDouble();
     // const double y = re.cap(2).toDouble();

From d8d371b12b57202f5316b91db0a53a5a3c2c8852 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Thu, 14 Sep 2023 16:41:41 +0300
Subject: [PATCH 0727/1398] 1st revision

---
 .../CGAL/CORE_algebraic_number_traits.h       | 218 ++++++++++++++++++
 1 file changed, 218 insertions(+)
 create mode 100644 Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/CORE_algebraic_number_traits.h

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/CORE_algebraic_number_traits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/CORE_algebraic_number_traits.h
new file mode 100644
index 000000000000..4b40d11fd1d7
--- /dev/null
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/CORE_algebraic_number_traits.h
@@ -0,0 +1,218 @@
+namespace CGAL {
+
+/*! \ingroup PkgArrangementOnSurface2TraitsClasses
+ *
+ * `CORE_algebraic_number_traits` is a traits class for CORE's algebraic
+ * number types.
+ *
+ * \sa `Arr_conic_traits_2<RatKernel, AlgKernel, NtTraits>`
+ */
+class CORE_algebraic_number_traits {
+public:
+  /// \name Types
+  /// @{
+
+  //! The integer number type.
+  typedef CORE::BigInt                    Integer;
+
+  //! The rational number type.
+  typedef CORE::BigRat                    Rational;
+
+  //! The polynomial type.
+  typedef CORE::Polynomial<Integer>       Polynomial;
+
+  //! The algebraic number type.
+  typedef CORE::Expr                      Algebraic;
+
+  /// @}
+
+  /// \name Utility Functions
+  /// @{
+
+  /*! Obtain the numerator of a rational number.
+   * \param q A rational number.
+   * \return The numerator of q.
+   */
+  Integer numerator(const Rational& q) const;
+
+  /*! Obtain the denominator of a rational number.
+   * \param q A rational number.
+   * \return The denominator of q.
+   */
+  Integer denominator(const Rational& q) const;
+
+  /*! Convert an integer to an algebraic number.
+   * \param z An integer.
+   * \return The algebraic number equivalent to z.
+   */
+  Algebraic convert(const Integer& z) const;
+
+  /*! Convert a rational number to an algebraic number.
+   * \param q A rational number.
+   * \return The algebraic number equivalent to q.
+   */
+  Algebraic convert(const Rational& q) const;
+
+  /*! Construct a rational number that lies strictly between two algebraic
+   * values.
+   * \param x1 The first algebraic value.
+   * \param x2 The second algebraic value.
+   * \pre The two values are not equal.
+   * \return A rational number that lies in the open interval (x1, x2).
+   */
+  Rational rational_in_interval(const Algebraic& x1, const Algebraic& x2) const;
+
+  /*! Obtain a range of double-precision floats that contains the given
+   * algebraic number.
+   * \param x The given number.
+   * \return A pair <x_lo, x_hi> that contain x.
+   */
+  std::pair<double, double> double_interval(const Algebraic& x) const;
+
+  /*! Convert a sequence of rational coefficients to an equivalent sequence
+   * of integer coefficients. If the input coefficients are q(1), ..., q(k),
+   * where q(i) = n(i)/d(i) then the output coefficients will be of the
+   * form:
+   *               n(i) * lcm {d(1), ... , d(k)}
+   *       a(i) = -------------------------------
+   *               d(i) * gcd {n(1), ... , n(k)}
+   *
+   * \param q_begin The begin iterator of the rational sequence.
+   * \param q_end The past-the-end iterator of the rational sequence.
+   * \param zoi An output iterator for the integer coefficients.
+   * \return A past-the-end iterator for the output container.
+   * \pre The value type of q_begin and q_end is `Rational`, and
+   *      the value type of zoi is `Integer`.
+   */
+  template <typename InputIterator, typename OutputIterator>
+  OutputIterator convert_coefficients(InputIterator q_begin,
+                                      InputIterator q_end,
+                                      OutputIterator zoi) const;
+
+  /*! Compute the square root of an algebraic number.
+   * \param x The number.
+   * \return The square root of x.
+   * \pre x is non-negative.
+   */
+  Algebraic sqrt(const Algebraic& x) const;
+
+  /*! Compute the roots of a quadratic equations \f$a*x^2+ b*x + c = 0\f$
+   * with integer coefficients.
+   * \param a The coefficient of \f$x^2\f$
+   * \param b The coefficient of \f$x\f$
+   * \param c The free term.
+   * \param oi An output iterator for the real-valued solutions of the
+   *           quadratic equation.
+   * \return A past-the-end iterator for the output container.
+   * \pre The value type of oi is Algebraic.
+   */
+  template <typename NT, typename OutputIterator>
+  OutputIterator solve_quadratic_equation(const NT& a, const NT& b, const NT& c,
+                                          OutputIterator oi) const;
+
+  /*! Construct a polynomial with integer coefficients.
+   * \param coeffs The coefficients of the input polynomial.
+   * \param degree The degree of the input polynomial.
+   * \return The polynomial.
+   */
+  Polynomial construct_polynomial(const Integer* coeffs,
+                                  unsigned int degree) const;
+
+  /*! Construct a polynomial with integer coefficients given rational
+   * coefficients.
+   * \param coeffs The coefficients of the input polynomial.
+   * \param degree The degree of the input polynomial.
+   * \param poly Output: The resulting polynomial with integer coefficients.
+   * \param poly_denom Output: The denominator for the polynomial.
+   * \return Whether this polynomial is non-zero (false if the polynomial is
+   *         zero).
+   */
+  bool construct_polynomial(const Rational *coeffs,
+                            unsigned int degree,
+                            Polynomial& poly, Integer& poly_denom) const;
+
+  /*! Construct two polynomials with integer coefficients such that P(x)/Q(x)
+   * is a rational function equivalent to the one represented by the two
+   * given vectors of rational coefficients. It is guaranteed that the GCD
+   * of P(x) and Q(x) is trivial.
+   * \param p_coeffs The coefficients of the input numerator polynomial.
+   * \param p_degree The degree of the input numerator polynomial.
+   * \param q_coeffs The coefficients of the input denominator polynomial.
+   * \param q_degree The degree of the input denominator polynomial.
+   * \param p_poly Output: The resulting numerator polynomial with integer
+   *                       coefficients.
+   * \param q_poly Output: The resulting denominator polynomial with integer
+   *                       coefficients.
+   * \return (true) on success; (false) if the denominator is 0.
+   */
+  bool construct_polynomials(const Rational* p_coeffs,
+                             unsigned int p_degree,
+                             const Rational* q_coeffs,
+                             unsigned int q_degree,
+                             Polynomial& p_poly, Polynomial& q_poly) const;
+
+  /*! Compute the degree of a polynomial.
+   */
+  int degree(const Polynomial& poly) const;
+
+  /*! Evaluate a polynomial at a given x-value.
+   * \param poly A polynomial.
+   * \param x The value to evaluate at.
+   * \return The value of the polynomial at x.
+   */
+  template <typename NT>
+  NT evaluate_at(const Polynomial& poly, NT& x) const;
+
+  /*! Compute the derivative of the given polynomial.
+   * \param poly The polynomial p(x).
+   * \return The derivative p'(x).
+   */
+  Polynomial derive(const Polynomial& poly) const;
+
+  /*! Multiply a polynomial by some scalar coefficient.
+   * \param poly The polynomial P(x).
+   * \param a The scalar value.
+   * \return The scalar multiplication a*P(x).
+   */
+  Polynomial scale(const Polynomial& poly, const Integer& a) const;
+
+  /*! Perform "long division" of two polynomials: Given A(x) and B(x) compute
+   * two polynomials Q(x) and R(x) such that: A(x) = Q(x)*B(x) + R(x) and
+   * R(x) has minimal degree.
+   * \param polyA The first polynomial A(x).
+   * \param polyB The second polynomial A(x).
+   * \param rem Output: The remainder polynomial R(x).
+   * \return The quontient polynomial Q(x).
+   */
+  Polynomial divide(const Polynomial& polyA,
+                    const Polynomial& polyB,
+                    Polynomial& rem) const;
+
+  /*! Compute the real-valued roots of a polynomial with integer coefficients,
+   * sorted in ascending order.
+   * \param poly The input polynomial.
+   * \param oi An output iterator for the real-valued root of the polynomial.
+   * \return A past-the-end iterator for the output container.
+   * \pre The value type of oi is Algebraic.
+   */
+  template <typename OutputIterator>
+  OutputIterator compute_polynomial_roots(const Polynomial& poly,
+                                          OutputIterator oi) const;
+
+  /*! Compute the real-valued roots of a polynomial with integer coefficients,
+   * within a given interval. The roots are sorted in ascending order.
+   * \param poly The input polynomial.
+   * \param x_min The left bound of the interval.
+   * \param x_max The right bound of the interval.
+   * \param oi An output iterator for the real-valued root of the polynomial.
+   * \return A past-the-end iterator for the output container.
+   * \pre The value type of oi is Algebraic.
+   */
+  template <typename OutputIterator>
+  OutputIterator compute_polynomial_roots(const Polynomial& poly,
+                                          double x_min, double x_max,
+                                          OutputIterator oi) const;
+  /// @}
+};
+
+} /* end namespace CGAL */

From 8123d2e2f8cfc4c679b968109396f5234cc5834d Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Thu, 14 Sep 2023 16:44:26 +0300
Subject: [PATCH 0728/1398] Added missing documentation for
 CGAL::CORE_algebraic_number_traits

---
 .../doc/Arrangement_on_surface_2/PackageDescription.txt          | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
index c14d0489746b..20dc50a57953 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
@@ -236,6 +236,7 @@ implemented as peripheral classes or as free (global) functions.
 - `CGAL::Arr_bounded_planar_topology_traits_2<GeometryTraits_2,Dcel>`
 - `CGAL::Arr_unb_planar_topology_traits_2<GeometryTraits_2,Dcel>`
 - `CGAL::Arr_spherical_topology_traits_2<GeometryTraits_2,Dcel>`
+- `CGAL::CORE_algebraic_number_traits`
 
 \cgalCRPSection{Functions}
 

From 8c2f72d94daa22183ed2584ebf4eb471ede91638 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Thu, 14 Sep 2023 16:44:47 +0300
Subject: [PATCH 0729/1398] Removed erroneous link

---
 .../doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
index fe4de62ca8f0..2c0d60278730 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
@@ -34,7 +34,6 @@ namespace CGAL {
  * \sa `Arr_default_dcel<Traits>`
  * \sa `ArrangementBasicTraits_2`
  * \sa `CGAL::overlay()`
- * \sa `CGAL::is_valid()`
 
  * Insertion Functions
 

From e5f49d70991dc610ca80acf0e1123d00157ba10a Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Thu, 14 Sep 2023 16:56:58 +0300
Subject: [PATCH 0730/1398] Fixed the description of the topology traits

---
 .../Arrangement_on_surface_2.txt              | 22 +++++++++++++++----
 1 file changed, 18 insertions(+), 4 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index b4bff8ed2db1..f7dfaa98b520 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -5651,10 +5651,24 @@ must model the basic concept `ArrangementBasicTopologyTraits`. A model
 of this basic concept holds the (\dcel) data structure used to
 represent the arrangement cells (i.e., vertices, edges, and facets)
 and the incidence relations between them. At this point we do not
-expose the concepts that refine the basic concept. The package
-contains one topology traits, namely,
-`Arr_spherical_topology_traits_2`. It can serve as a topology traits
-for an arrangement embedded on a sphere. More precisely, for an
+expose the concepts that refine the basic concept.  The package
+contains three topology traits class templates, namely,
+`Arr_bounded_planar_topology_traits_2`,
+`Arr_unb_planar_topology_traits_2`, and
+`Arr_spherical_topology_traits_2`. The first two are internally used
+to define any instance of the class template
+`Arrangement_2<GeometryTraits_2, Dcel>`. In particular, an instance
+`Arrangement_2<Geometry_traits_2, Dcel_>` is derived from the instance
+`Arrangement_on_surface_2<Geometry_traits_2,Topology_traits>`, where
+the `Topology_traits` type is selected based on the provided geometry
+traits `Geometry_traits_2`, or more precisely, on the boundary
+conditions defined by the geometry traits. If all sides of the
+boundary of the parameter space are cosed, the instance
+`Arr_bounded_planar_topology_traits_2<Geometry_traits_2,Dcel_>` is
+selected; otherwise the instance
+`Arr_unb_planar_topology_traits_2<Geometry_traits_2,Dcel_>` is
+selected.  The third topology traits serves as a topology traits for
+an arrangement embedded on a sphere. More precisely, for an
 arrangement embedded on a sphere defined over a parameter space, the
 left and right boundary sides of which are identified, and the top and
 bottom boundary sides are contracted.

From 2f6d51b49b495b2693d0be912e344876dee6e87a Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 14 Sep 2023 16:27:16 +0200
Subject: [PATCH 0731/1398] Remove a few occurrences of CGAL_Qt5

... and replace by CGAL_Qt6
---
 .../Arrangement_on_surface_2.txt              |   4 +-
 .../CGAL/draw_arrangement_2.h                 |   4 +-
 .../CGAL/draw_polygon_set_2.h                 |   4 +-
 .../include/CGAL/draw_polygon_set_2.h         |   4 +-
 .../create_and_use_a_cmakelist.txt            |   6 +-
 .../doc/Documentation/Third_party.txt         |   2 +-
 .../doc/scripts/test_doxygen_versions.sh      |   2 +-
 GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h |   4 +-
 GraphicsView/include/CGAL/auto_link/Qt.h      |   4 +-
 GraphicsView/include/CGAL/export/Qt.h         |   2 +-
 .../CGAL_Qt5_moc_and_resource_files.cmake     |  25 ----
 .../CGAL_SetupCGAL_Qt5Dependencies.cmake      | 127 ------------------
 ...GAL_enable_end_of_configuration_hook.cmake |   6 +-
 .../Help/CGAL_SetupCGAL_Qt5Dependencies.rst   |   1 -
 .../Help/CGAL_SetupCGAL_Qt6Dependencies.rst   |   1 +
 Installation/cmake/modules/Help/index.rst     |   2 +-
 Installation/test/Installation/CMakeLists.txt |  96 ++++++-------
 .../test/Installation/link_to_CGAL_Qt6.cpp    |  11 ++
 ...make.in => test_configuration_qt.cmake.in} |   6 +-
 ...tion_qt5.cpp => test_configuration_qt.cpp} |   0
 .../CGAL/draw_linear_cell_complex.h           |   4 +-
 .../Linear_cell_complex.txt                   |   4 +-
 Nef_3/doc/Nef_3/CGAL/draw_nef_3.h             |   4 +-
 Nef_3/doc/Nef_3/Nef_3.txt                     |   4 +-
 .../CGAL/draw_periodic_2_triangulation_2.h    |   4 +-
 Point_set_3/doc/Point_set_3/Point_set_3.txt   |   4 +-
 Point_set_3/include/CGAL/draw_point_set_3.h   |   4 +-
 Polygon/doc/Polygon/Polygon.txt               |   4 +-
 Polygon/include/CGAL/draw_polygon_2.h         |   4 +-
 .../include/CGAL/draw_polygon_with_holes_2.h  |   4 +-
 .../doc/Polyhedron/CGAL/draw_polyhedron.h     |   4 +-
 Polyhedron/doc/Polyhedron/Polyhedron.txt      |   4 +-
 .../doc/Surface_mesh/Surface_mesh.txt         |   4 +-
 Surface_mesh/include/CGAL/draw_surface_mesh.h |   4 +-
 .../CGAL/draw_face_graph_with_paths.h         |   4 +-
 .../Surface_mesh_topology.txt                 |   8 +-
 Testsuite/test/post_process_ctest_results.py  |   2 +-
 .../CGAL/draw_triangulation_2.h               |   8 +-
 .../doc/Triangulation_2/Triangulation_2.txt   |   4 +-
 .../CGAL/draw_triangulation_3.h               |   4 +-
 .../doc/Triangulation_3/Triangulation_3.txt   |   4 +-
 .../CGAL/draw_voronoi_diagram_2.h             |   4 +-
 .../Voronoi_diagram_2/Voronoi_diagram_2.txt   |   4 +-
 43 files changed, 134 insertions(+), 275 deletions(-)
 delete mode 100644 Installation/cmake/modules/CGAL_Qt5_moc_and_resource_files.cmake
 delete mode 100644 Installation/cmake/modules/CGAL_SetupCGAL_Qt5Dependencies.cmake
 delete mode 100644 Installation/cmake/modules/Help/CGAL_SetupCGAL_Qt5Dependencies.rst
 create mode 100644 Installation/cmake/modules/Help/CGAL_SetupCGAL_Qt6Dependencies.rst
 create mode 100644 Installation/test/Installation/link_to_CGAL_Qt6.cpp
 rename Installation/test/Installation/{test_configuration_qt5.cmake.in => test_configuration_qt.cmake.in} (89%)
 rename Installation/test/Installation/{test_configuration_qt5.cpp => test_configuration_qt.cpp} (100%)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index 5254543120c7..b7c41b3e5ccb 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -6750,8 +6750,8 @@ An arrangement data structure can be visualized by calling the \link PkgArrangem
 
 \cgalExample{Arrangement_on_surface_2/draw_arr.cpp}
 
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \cgalFigureBegin{aos_fig-draw_arr,draw_arr.png}
 A snapshot of the window created by the program
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/draw_arrangement_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/draw_arrangement_2.h
index f415f5c9e7ec..a22a398115e0 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/draw_arrangement_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/draw_arrangement_2.h
@@ -28,9 +28,9 @@ namespace CGAL {
  * opens a new window and draws `arr`, an instance of the `CGAL::Arrangement_2`
  * class template. A call to this function is blocking; that is, the program
  * continues only after the user closes the window. This function requires
- * `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is
+ * `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is
  * defined.  Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link
- * with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+ * with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
  *
  * \tparam GeometryTraits_2 a geometry traits type, a model of a 2D arrangement
  * traits concept. At this point it must be an instance of either
diff --git a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/draw_polygon_set_2.h b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/draw_polygon_set_2.h
index df7a777dbdc9..5728fe8b86c6 100644
--- a/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/draw_polygon_set_2.h
+++ b/Boolean_set_operations_2/doc/Boolean_set_operations_2/CGAL/draw_polygon_set_2.h
@@ -3,8 +3,8 @@ namespace CGAL {
 /*!
 \ingroup PkgDrawPolygonSet2
 
-opens a new window and draws `aps`, an instance of the `CGAL::Polygon_set_2` class. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+opens a new window and draws `aps`, an instance of the `CGAL::Polygon_set_2` class. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 \tparam PS an instance of the `CGAL::Polygon_set_2` class.
 \param aps the polygon set to draw.
 
diff --git a/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h b/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h
index 3a5a31421be5..6eaa81b02f7b 100644
--- a/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h
+++ b/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h
@@ -27,9 +27,9 @@ namespace CGAL {
  *
  * opens a new window and draws `aps`, an instance of the `CGAL::Polygon_set_2`
  * class. A call to this function is blocking, that is the program continues as
- * soon as the user closes the window. This function requires `CGAL_Qt5`, and is
+ * soon as the user closes the window. This function requires `CGAL_Qt6`, and is
  * only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.  Linking with
- * the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add
+ * the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add
  * the definition `CGAL_USE_BASIC_VIEWER`.
  * \tparam PS an instance of the `CGAL::Polygon_set_2` class.
  * \param aps the polygon set to draw.
diff --git a/Documentation/doc/Documentation/Developer_manual/create_and_use_a_cmakelist.txt b/Documentation/doc/Documentation/Developer_manual/create_and_use_a_cmakelist.txt
index 02ff32da6bc3..14eb07f8d8f0 100644
--- a/Documentation/doc/Documentation/Developer_manual/create_and_use_a_cmakelist.txt
+++ b/Documentation/doc/Documentation/Developer_manual/create_and_use_a_cmakelist.txt
@@ -33,14 +33,14 @@ This section describes a minimal example of a program that uses \cgal and Qt5 fo
 \skip cmake_minimum_required
 \until project
 
-\skip #CGAL_Qt5 is needed for the drawing.
+\skip #CGAL_Qt6 is needed for the drawing.
 \until endif()
 
 \skip #create the executable of the application
 \until "draw_surface_mesh.cpp"
 
-\skip if(CGAL_Qt5_FOUND)
-\until target_link_libraries(draw_surface_mesh PUBLIC CGAL::CGAL_Qt5)
+\skip if(CGAL_Qt6_FOUND)
+\until target_link_libraries(draw_surface_mesh PUBLIC CGAL::CGAL_Qt6)
 \skip endif
 \until #end of the file
 
diff --git a/Documentation/doc/Documentation/Third_party.txt b/Documentation/doc/Documentation/Third_party.txt
index 569599ae0fdf..67533c1aef90 100644
--- a/Documentation/doc/Documentation/Third_party.txt
+++ b/Documentation/doc/Documentation/Third_party.txt
@@ -77,7 +77,7 @@ we recommend that you define the environment variable
 \subsection thirdpartyMPFR GNU Multiple Precision Arithmetic (GMP) and GNU Multiple Precision Floating-Point Reliably (MPFR) Libraries
 <b>GMP Version 4.2 or later, MPFR Version 2.2.1 or later</b>
 
-The components `libCGAL`, `libCGAL_Core`, and `libCGAL_Qt5` require
+The components `libCGAL`, `libCGAL_Core`, and `libCGAL_Qt6` require
 \gmp and \mpfr which are libraries for multi precision integers and rational numbers,
 and for multi precision floating point numbers.
 
diff --git a/Documentation/doc/scripts/test_doxygen_versions.sh b/Documentation/doc/scripts/test_doxygen_versions.sh
index f71d5c6e0220..c847e110a2d2 100644
--- a/Documentation/doc/scripts/test_doxygen_versions.sh
+++ b/Documentation/doc/scripts/test_doxygen_versions.sh
@@ -117,7 +117,7 @@ if [ "$HAS_REF" -ne "1" ]; then
   if [ $IS_RELEASE = 0 ]; then
     cd $ROOT
     mkdir -p ./build && cd ./build
-    cmake -DWITH_CGAL_Core=false -DWITH_CGAL_ImageIO=false -DWITH_CGAL_Qt5=false .. 1>> ./build_logs
+    cmake -DWITH_CGAL_Core=false -DWITH_CGAL_ImageIO=false -DWITH_CGAL_Qt6=false .. 1>> ./build_logs
     CGAL_NAME="$(cat $PWD/VERSION)"
     cd $ROOT
     rm -rf ./build
diff --git a/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h b/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h
index 118426a54df1..6aad119ecc35 100644
--- a/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h
+++ b/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h
@@ -14,8 +14,8 @@
 
 #include <QtCore/qglobal.h>
 
-#if defined(CGAL_Qt5_DLL)
-#  if defined(CGAL_Qt5_EXPORTS)
+#if defined(CGAL_Qt6_DLL)
+#  if defined(CGAL_Qt6_EXPORTS)
 #    define CGAL_QT_EXPORT Q_DECL_EXPORT
 #  else
 #    define CGAL_QT_EXPORT Q_DECL_IMPORT
diff --git a/GraphicsView/include/CGAL/auto_link/Qt.h b/GraphicsView/include/CGAL/auto_link/Qt.h
index bcaf3cbd99c3..a08e108e2d34 100644
--- a/GraphicsView/include/CGAL/auto_link/Qt.h
+++ b/GraphicsView/include/CGAL/auto_link/Qt.h
@@ -16,13 +16,13 @@
 #include <QtCore/qglobal.h>
 
 #if (! defined (CGAL_NO_AUTOLINK_QT))
-#if ( ! defined( CGAL_EXPORTS )  && (! defined ( CGAL_Qt5_EXPORTS )))
+#if ( ! defined( CGAL_EXPORTS )  && (! defined ( CGAL_Qt6_EXPORTS )))
 
 // If CGAL_EXPORTS is defined it means that we are building the CGAL
 // library as a DLL. The CGAL.dll does not really depend on CGAL_Qt,
 // whatever the header inclusion graph says.
 
-#define CGAL_LIB_NAME CGAL_Qt5
+#define CGAL_LIB_NAME CGAL_Qt6
 
 #include <CGAL/auto_link/auto_link.h>
 
diff --git a/GraphicsView/include/CGAL/export/Qt.h b/GraphicsView/include/CGAL/export/Qt.h
index 7d79a2069917..a1392b2610a2 100644
--- a/GraphicsView/include/CGAL/export/Qt.h
+++ b/GraphicsView/include/CGAL/export/Qt.h
@@ -18,7 +18,7 @@
 #if ( defined(CGAL_BUILD_SHARED_LIBS) && ( ! defined(CGAL_HEADER_ONLY) ) ) \
   || defined(CGAL_USE_Qt5_RESOURCES)
 
-#  if defined(CGAL_Qt5_EXPORTS) || defined(CGAL_USE_Qt5_RESOURCES)
+#  if defined(CGAL_Qt6_EXPORTS) || defined(CGAL_USE_Qt5_RESOURCES)
 // defined by CMake or in cpp files of the dll
 
 #    define CGAL_QT_EXPORT CGAL_DLL_EXPORT
diff --git a/Installation/cmake/modules/CGAL_Qt5_moc_and_resource_files.cmake b/Installation/cmake/modules/CGAL_Qt5_moc_and_resource_files.cmake
deleted file mode 100644
index 2d566decf613..000000000000
--- a/Installation/cmake/modules/CGAL_Qt5_moc_and_resource_files.cmake
+++ /dev/null
@@ -1,25 +0,0 @@
-if(CGAL_Qt5_moc_and_resource_files_included)
-  return()
-endif()
-set(CGAL_Qt5_moc_and_resource_files_included TRUE)
-# qrc files (resources files, that contain icons, at least)
-if(EXISTS ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/resources/CGAL.qrc)
-  qt5_add_resources (_CGAL_Qt5_RESOURCE_FILES_private
-    ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/resources/CGAL.qrc
-    ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/icons/Input.qrc
-    ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/icons/File.qrc
-    ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/demo/icons/Triangulation_2.qrc)
-else()
-  # Installed version, in CMake resources
-  file ( COPY
-    ${CGAL_MODULES_DIR}/demo/resources
-    ${CGAL_MODULES_DIR}/demo/icons
-    DESTINATION ${CMAKE_BINARY_DIR})
-  qt5_add_resources (_CGAL_Qt5_RESOURCE_FILES_private
-    ${CMAKE_BINARY_DIR}/resources/CGAL.qrc
-    ${CMAKE_BINARY_DIR}/icons/Input.qrc
-    ${CMAKE_BINARY_DIR}/icons/File.qrc
-    ${CMAKE_BINARY_DIR}/icons/Triangulation_2.qrc)
-endif()
-
-qt5_wrap_ui(_CGAL_Qt5_UI_FILES ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/ImageInterface.ui)
diff --git a/Installation/cmake/modules/CGAL_SetupCGAL_Qt5Dependencies.cmake b/Installation/cmake/modules/CGAL_SetupCGAL_Qt5Dependencies.cmake
deleted file mode 100644
index c6701aeb1a1b..000000000000
--- a/Installation/cmake/modules/CGAL_SetupCGAL_Qt5Dependencies.cmake
+++ /dev/null
@@ -1,127 +0,0 @@
-#.rst:
-# CGAL_SetupCGAL_Qt5Dependencies
-# ------------------------------
-#
-# The module searches for the dependencies of the `CGAL_Qt5` library:
-#   - the `Qt5` libraries
-#
-# by calling
-#
-# .. code-block:: cmake
-#
-#    find_package(Qt5 QUIET COMPONENTS OpenGL Widgets)
-#
-# and defines the variable :variable:`CGAL_Qt5_FOUND` and the function
-# :command:`CGAL_setup_CGAL_Qt5_dependencies`.
-#
-
-if(CGAL_SetupCGAL_Qt5Dependencies_included)
-  return()
-endif()
-set(CGAL_SetupCGAL_Qt5Dependencies_included TRUE)
-
-#.rst:
-# Used Modules
-# ^^^^^^^^^^^^
-#   - :module:`Qt5Config`
-find_package(Qt5 QUIET COMPONENTS OpenGL Widgets OPTIONAL_COMPONENTS Svg)
-
-set(CGAL_Qt5_MISSING_DEPS "")
-if(NOT Qt5OpenGL_FOUND)
-  set(CGAL_Qt5_MISSING_DEPS "Qt5OpenGL")
-endif()
-if(NOT Qt5Widgets_FOUND)
-  set(CGAL_Qt5_MISSING_DEPS "${CGAL_Qt5_MISSING_DEPS} Qt5Widgets")
-endif()
-if(NOT Qt5_FOUND)
-  set(CGAL_Qt5_MISSING_DEPS "${CGAL_Qt5_MISSING_DEPS} Qt5")
-endif()
-if(NOT EXISTS ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/GraphicsItem.h)
-  set(CGAL_Qt5_MISSING_DEPS "${CGAL_Qt5_MISSING_DEPS} <CGAL/Qt/*.h> headers")
-endif()
-
-#.rst:
-# Result Variables
-# ^^^^^^^^^^^^^^^^
-#
-# .. variable:: CGAL_Qt5_FOUND
-#
-#    Set to `TRUE` if the dependencies of `CGAL_Qt5` were found.
-#
-if(NOT CGAL_Qt5_MISSING_DEPS)
-  set(CGAL_Qt5_FOUND TRUE)
-  set_property(GLOBAL PROPERTY CGAL_Qt5_FOUND TRUE)
-
-  include(${CMAKE_CURRENT_LIST_DIR}/CGAL_Qt5_moc_and_resource_files.cmake)
-
-  if(NOT TARGET CGAL_Qt5_moc_and_resources)
-    add_library(CGAL_Qt5_moc_and_resources STATIC
-      ${_CGAL_Qt5_MOC_FILES_private}
-        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/GraphicsViewNavigation.h
-        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/DemosMainWindow.h
-        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/GraphicsItem.h
-        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/GraphicsViewInput.h
-        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/camera.h
-        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/frame.h
-        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/keyFrameInterpolator.h
-        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/manipulatedCameraFrame.h
-        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/manipulatedFrame.h
-        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/qglviewer.h
-        ${CGAL_GRAPHICSVIEW_PACKAGE_DIR}/include/CGAL/Qt/image_interface.h
-        ${_CGAL_Qt5_UI_FILES}
-      ${_CGAL_Qt5_RESOURCE_FILES_private})
-    target_include_directories( CGAL_Qt5_moc_and_resources PUBLIC ${CMAKE_CURRENT_BINARY_DIR})
-    set_target_properties(CGAL_Qt5_moc_and_resources PROPERTIES
-      POSITION_INDEPENDENT_CODE TRUE
-      EXCLUDE_FROM_ALL TRUE
-      AUTOMOC TRUE)
-    target_link_libraries(CGAL_Qt5_moc_and_resources PUBLIC CGAL::CGAL Qt5::Widgets Qt5::OpenGL )
-    if(Qt5Svg_FOUND)
-      target_link_libraries(CGAL_Qt5_moc_and_resources PUBLIC Qt5::Svg)
-    endif()
-    add_library(CGAL::CGAL_Qt5_moc_and_resources ALIAS CGAL_Qt5_moc_and_resources)
-    add_library(CGAL::Qt5_moc_and_resources ALIAS CGAL_Qt5_moc_and_resources)
-  endif()
-
-endif()
-
-#get_property(QT_UIC_EXECUTABLE TARGET Qt5::uic PROPERTY LOCATION)
-#message( STATUS "Qt5Core include:     ${Qt5Core_INCLUDE_DIRS}" )
-#message( STATUS "Qt5 libraries:       ${Qt5Core_LIBRARIES} ${Qt5Gui_LIBRARIES} ${Qt5Svg_LIBRARIES} ${Qt5OpenGL_LIBRARIES}" )
-#message( STATUS "Qt5Core definitions: ${Qt5Core_DEFINITIONS}" )
-#message( STATUS "moc executable:      ${QT_MOC_EXECUTABLE}" )
-#message( STATUS "uic executable:      ${QT_UIC_EXECUTABLE}" )
-
-#.rst:
-#
-# Provided Functions
-# ^^^^^^^^^^^^^^^^^^
-#
-# .. command:: CGAL_setup_CGAL_Qt5_dependencies
-#
-#   Link the target with the dependencies of `CGAL_Qt5`::
-#
-#     CGAL_setup_CGAL_Qt5_dependencies( target )
-#
-#   The dependencies are
-#   added using :command:`target_link_libraries` with the ``INTERFACE``
-#   keyword.
-#
-function(CGAL_setup_CGAL_Qt5_dependencies target)
-
-  if($ENV{CGAL_FAKE_PUBLIC_RELEASE})
-    target_compile_definitions( ${target} INTERFACE CGAL_FAKE_PUBLIC_RELEASE=1 )
-  endif()
-  target_link_libraries( ${target} INTERFACE CGAL::CGAL)
-  target_link_libraries( ${target} INTERFACE CGAL::Qt5_moc_and_resources)
-  target_link_libraries( ${target} INTERFACE Qt5::OpenGL Qt5::Widgets )
-
-  # Remove -Wdeprecated-copy, for g++ >= 9.0, because Qt5, as of
-  # version 5.12, has a lot of [-Wdeprecated-copy] warnings.
-  if( CMAKE_CXX_COMPILER_ID STREQUAL "GNU"
-      AND NOT CMAKE_CXX_COMPILER_VERSION VERSION_LESS "9" )
-    target_compile_options( ${target} INTERFACE "-Wno-deprecated-copy" "-Wno-cast-function-type" )
-  endif()
-
-endfunction()
-
diff --git a/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake b/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
index 81f62d9aab45..a25a85fa50c4 100644
--- a/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
+++ b/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
@@ -24,7 +24,7 @@ function(CGAL_hook_check_targets)
   endif()
   get_property(_targets DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR} PROPERTY BUILDSYSTEM_TARGETS)
   set(_list_of_deps)
-  set(_special_targets  demos examples tests ALL_CGAL_TARGETS CGAL_Qt5_moc_and_resources uninstall install_FindCGAL)
+  set(_special_targets  demos examples tests ALL_CGAL_TARGETS CGAL_Qt6_moc_and_resources uninstall install_FindCGAL)
   foreach(t ${_special_targets})
     if(NOT TARGET ${t})
       continue()
@@ -110,8 +110,8 @@ function(CGAL_hook_fix_ctest_depending_on_Qt5)
       continue()
     endif()
     get_property(_target_links TARGET ${_target} PROPERTY LINK_LIBRARIES)
-    if("CGAL_Qt5" IN_LIST _target_links OR "CGAL::CGAL_Qt5" IN_LIST _target_links)
-      set_property(TEST "compilation of  ${_target}" APPEND PROPERTY FIXTURES_REQUIRED CGAL_Qt5_moc_and_resources_Fixture)
+    if("CGAL_Qt6" IN_LIST _target_links OR "CGAL::CGAL_Qt6" IN_LIST _target_links)
+      set_property(TEST "compilation of  ${_target}" APPEND PROPERTY FIXTURES_REQUIRED CGAL_Qt6_moc_and_resources_Fixture)
     endif()
     endforeach()
 endfunction()
diff --git a/Installation/cmake/modules/Help/CGAL_SetupCGAL_Qt5Dependencies.rst b/Installation/cmake/modules/Help/CGAL_SetupCGAL_Qt5Dependencies.rst
deleted file mode 100644
index 815f7a4dd5f1..000000000000
--- a/Installation/cmake/modules/Help/CGAL_SetupCGAL_Qt5Dependencies.rst
+++ /dev/null
@@ -1 +0,0 @@
-.. cmake-module:: ../CGAL_SetupCGAL_Qt5Dependencies.cmake
diff --git a/Installation/cmake/modules/Help/CGAL_SetupCGAL_Qt6Dependencies.rst b/Installation/cmake/modules/Help/CGAL_SetupCGAL_Qt6Dependencies.rst
new file mode 100644
index 000000000000..87365f45ac4a
--- /dev/null
+++ b/Installation/cmake/modules/Help/CGAL_SetupCGAL_Qt6Dependencies.rst
@@ -0,0 +1 @@
+.. cmake-module:: ../CGAL_SetupCGAL_Qt6Dependencies.cmake
diff --git a/Installation/cmake/modules/Help/index.rst b/Installation/cmake/modules/Help/index.rst
index b47d4211d9b3..b13ae1e506f9 100644
--- a/Installation/cmake/modules/Help/index.rst
+++ b/Installation/cmake/modules/Help/index.rst
@@ -16,7 +16,7 @@ Contents:
    CGAL_SetupBoost
    CGAL_SetupCGALDependencies
    CGAL_SetupCGAL_CoreDependencies
-   CGAL_SetupCGAL_Qt5Dependencies
+   CGAL_SetupCGAL_Qt6Dependencies
    CGAL_SetupCGAL_ImageIODependencies
 
 TODO
diff --git a/Installation/test/Installation/CMakeLists.txt b/Installation/test/Installation/CMakeLists.txt
index d8b14c0bb170..c057119bbd3c 100644
--- a/Installation/test/Installation/CMakeLists.txt
+++ b/Installation/test/Installation/CMakeLists.txt
@@ -78,10 +78,10 @@ else()
   set(NON_STANDARD_INSTALL_PREFIX ${CMAKE_BINARY_DIR})
 endif()
 
-if(WITH_CGAL_Qt5)
+if(WITH_CGAL_Qt6)
   find_package(Qt6 QUIET COMPONENTS Core)
-  if(Qt5_FOUND)
-    create_link_to_program(CGAL_Qt5)
+  if(Qt6_FOUND)
+    create_link_to_program(CGAL_Qt6)
   endif()
 endif()
 
@@ -152,12 +152,12 @@ file(MAKE_DIRECTORY "${NON_STANDARD_INSTALL_PREFIX}/non_standard_install")
 file(MAKE_DIRECTORY ${NON_STANDARD_INSTALL_PREFIX}/non_standard_build)
 file(MAKE_DIRECTORY ${NON_STANDARD_INSTALL_PREFIX}/test_config_file)
 
-if(CGAL_Qt5_FOUND)
-  file(MAKE_DIRECTORY ${NON_STANDARD_INSTALL_PREFIX}/non_standard_install_qt5)
-  file(MAKE_DIRECTORY ${NON_STANDARD_INSTALL_PREFIX}/non_standard_build_qt5)
-  file(MAKE_DIRECTORY ${NON_STANDARD_INSTALL_PREFIX}/test_config_file_qt5)
-  configure_file(test_configuration_qt5.cmake.in ${CMAKE_BINARY_DIR}/test_config_file_qt5/CMakeLists.txt @ONLY)
-endif()#CGAL_Qt5_FOUND
+if(CGAL_Qt6_FOUND)
+  file(MAKE_DIRECTORY ${NON_STANDARD_INSTALL_PREFIX}/non_standard_install_qt)
+  file(MAKE_DIRECTORY ${NON_STANDARD_INSTALL_PREFIX}/non_standard_build_qt)
+  file(MAKE_DIRECTORY ${NON_STANDARD_INSTALL_PREFIX}/test_config_file_qt)
+  configure_file(test_configuration_qt.cmake.in ${CMAKE_BINARY_DIR}/test_config_file_qt/CMakeLists.txt @ONLY)
+endif()#CGAL_Qt6_FOUND
 
 #If ctest is ran from a global config, CGAL_SOURCE_DIR exists, but from Installation/test it doesn't. In that case, however, there is a CGAL_DIR.
 if("${CGAL_SOURCE_DIR}" STREQUAL "")
@@ -173,28 +173,28 @@ configure_file(test_configuration.cmake.in ${CMAKE_BINARY_DIR}/test_config_file/
 
 #test CGAL_DIR = source_dir (Git_root or CGAL-5.x dir.
 get_filename_component(CGAL_DIR_CORRECT_PATH "${CGAL_SOURCE_DIR}/CGALConfig.cmake" DIRECTORY)
-add_test(NAME test_config_file
+add_test(NAME test_config_file_in_CGAL_SOURCE_DIR
   COMMAND ${CMAKE_COMMAND} ${GENERATOR} ${INIT_FILE} -DCMAKE_BUILD_TYPE=Release -DCGAL_DIR=${CGAL_DIR_CORRECT_PATH} -DCGAL_GIVEN_DIR=${CGAL_DIR_CORRECT_PATH}
     "${CMAKE_BINARY_DIR}/test_config_file" #src
-  WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file") #build
-list(APPEND test_config_lst "test_config_file")
+  WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_in_CGAL_SOURCE_DIR") #build
+list(APPEND test_config_lst "test_config_file_in_CGAL_SOURCE_DIR")
 
 if(RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE)#CGAL_BRANCH_BUILD
   #test CGAL_DIR = CGAL-5.x/lib/cmake/CGAL
   get_filename_component(CGAL_DIR_CORRECT_PATH "${CGAL_SOURCE_DIR}/lib/cmake/CGAL/CGALConfig.cmake" DIRECTORY)
-  add_test(NAME test_config_file_2
+  add_test(NAME test_config_file_in_lib_cmake_CGAL
     COMMAND ${CMAKE_COMMAND} ${GENERATOR} ${INIT_FILE} -DCMAKE_BUILD_TYPE=Release -DCGAL_DIR=${CGAL_DIR_CORRECT_PATH} -DCGAL_GIVEN_DIR=${CGAL_DIR_CORRECT_PATH}
       "${CMAKE_BINARY_DIR}/test_config_file"
-    WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_2")
+    WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_in_lib_cmake_CGAL")
 else()#CGAL_BRANCH_BUILD
   #use the CGAL_DIR
   get_filename_component(CGAL_DIR_CORRECT_PATH "${CGAL_SOURCE_DIR}/Installation/lib/cmake/CGAL/CGALConfig.cmake" DIRECTORY)
-  add_test(NAME test_config_file_2
+  add_test(NAME test_config_file_in_lib_cmake_CGAL
     COMMAND ${CMAKE_COMMAND} ${GENERATOR} ${INIT_FILE} -DCMAKE_BUILD_TYPE=Release -DCGAL_DIR=${CGAL_DIR_CORRECT_PATH} -DCGAL_GIVEN_DIR=${CGAL_DIR_CORRECT_PATH}
       "${CMAKE_BINARY_DIR}/test_config_file"
-    WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_2")
+    WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_in_lib_cmake_CGAL")
 endif()#CGAL_BRANCH_BUILD
-list(APPEND test_config_lst "test_config_file_2")
+list(APPEND test_config_lst "test_config_file_in_lib_cmake_CGAL")
 
 #configure cgal for a non standard install without Qt6
 get_filename_component(CORRECT_INSTALL_PATH "${NON_STANDARD_INSTALL_PREFIX}/non_standard_install/dummy.txt" DIRECTORY)
@@ -206,40 +206,40 @@ add_test(NAME config_non_standard_cgal
 add_test(NAME install_non_standard_cgal
   COMMAND ${CMAKE_COMMAND} --build "${NON_STANDARD_INSTALL_PREFIX}/non_standard_build" --target "install" --config "$<CONFIG>")
 
-#test CGAL_DIR=non standard place without cgal_qt5
+#test CGAL_DIR=non standard place without cgal_qt
 get_filename_component(CGAL_DIR_CORRECT_PATH "${NON_STANDARD_INSTALL_PREFIX}/non_standard_install/lib/cmake/CGAL/CGALConfig.cmake" DIRECTORY)
-add_test(NAME test_config_file_3
+add_test(NAME test_config_file_non_standard_install_lib_cmake
 COMMAND ${CMAKE_COMMAND} ${INIT_FILE} -DCMAKE_BUILD_TYPE=Release -DCGAL_DIR=${CGAL_DIR_CORRECT_PATH} -DCGAL_GIVEN_DIR=${CGAL_DIR_CORRECT_PATH}
 "${CMAKE_BINARY_DIR}/test_config_file"
-WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_3")
-list(APPEND test_config_lst "test_config_file_3")
+WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_non_standard_install_lib_cmake")
+list(APPEND test_config_lst "test_config_file_non_standard_install_lib_cmake")
 
-if(CGAL_Qt5_FOUND)
+if(CGAL_Qt6_FOUND)
   #configure cgal for a non standard install with Qt6
-  add_test(NAME config_non_standard_cgal_qt5
-    COMMAND ${CMAKE_COMMAND} ${INIT_FILE} -DCMAKE_BUILD_TYPE=Release -DCMAKE_INSTALL_PREFIX=${NON_STANDARD_INSTALL_PREFIX}/non_standard_install_qt5 -DCGAL_INSTALL_LIB_DIR=lib
+  add_test(NAME config_non_standard_cgal_qt
+    COMMAND ${CMAKE_COMMAND} ${INIT_FILE} -DCMAKE_BUILD_TYPE=Release -DCMAKE_INSTALL_PREFIX=${NON_STANDARD_INSTALL_PREFIX}/non_standard_install_qt -DCGAL_INSTALL_LIB_DIR=lib
     "${CGAL_SOURCE_DIR}"
-    WORKING_DIRECTORY "${NON_STANDARD_INSTALL_PREFIX}/non_standard_build_qt5")
+    WORKING_DIRECTORY "${NON_STANDARD_INSTALL_PREFIX}/non_standard_build_qt")
   #install cgal in the non standard place
-  add_test(NAME install_non_standard_cgal_qt5
-    COMMAND ${CMAKE_COMMAND} --build "${NON_STANDARD_INSTALL_PREFIX}/non_standard_build_qt5" --target "install" --config "$<CONFIG>")
+  add_test(NAME install_non_standard_cgal_qt
+    COMMAND ${CMAKE_COMMAND} --build "${NON_STANDARD_INSTALL_PREFIX}/non_standard_build_qt" --target "install" --config "$<CONFIG>")
 
-  #test CGAL_DIR=non standard place with cgal_qt5
-  get_filename_component(CGAL_DIR_CORRECT_PATH "${NON_STANDARD_INSTALL_PREFIX}/non_standard_install_qt5/lib/cmake/CGAL/CGALConfig.cmake" DIRECTORY)
-  add_test(NAME test_config_file_4
+  #test CGAL_DIR=non standard place with cgal_qt
+  get_filename_component(CGAL_DIR_CORRECT_PATH "${NON_STANDARD_INSTALL_PREFIX}/non_standard_install_qt/lib/cmake/CGAL/CGALConfig.cmake" DIRECTORY)
+  add_test(NAME test_config_file_non_standard_install_lib_cmake_with_qt
     COMMAND ${CMAKE_COMMAND} ${INIT_FILE} -DCMAKE_BUILD_TYPE=Release -DCGAL_DIR=${CGAL_DIR_CORRECT_PATH} -DCGAL_GIVEN_DIR=${CGAL_DIR_CORRECT_PATH}
-    "${CMAKE_BINARY_DIR}/test_config_file_qt5"
-    WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_4")
-  list(APPEND test_config_lst "test_config_file_4")
-endif()#CGAL_Qt5_FOUND
+    "${CMAKE_BINARY_DIR}/test_config_file_qt"
+    WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_non_standard_install_lib_cmake_with_qt")
+  list(APPEND test_config_lst "test_config_file_non_standard_install_lib_cmake_with_qt")
+endif()#CGAL_Qt6_FOUND
 
 #test CGAL_DIR=non standard build
 get_filename_component(CGAL_DIR_CORRECT_PATH "${NON_STANDARD_INSTALL_PREFIX}/non_standard_build/CGALConfig.cmake" DIRECTORY)
-add_test(NAME test_config_file_5
+add_test(NAME test_config_file_non_standard
 COMMAND ${CMAKE_COMMAND} ${INIT_FILE} -DCMAKE_BUILD_TYPE=Release -DCGAL_DIR=${CGAL_DIR_CORRECT_PATH} -DCGAL_GIVEN_DIR=${CGAL_DIR_CORRECT_PATH}
  "${CMAKE_BINARY_DIR}/test_config_file"
- WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_5")
-list(APPEND test_config_lst "test_config_file_5")
+ WORKING_DIRECTORY "${CMAKE_BINARY_DIR}/build-test_config_file_non_standard")
+list(APPEND test_config_lst "test_config_file_non_standard")
 
 foreach(tgt ${test_config_lst})
   #add_custom_target(${tgt}_target)
@@ -268,19 +268,19 @@ foreach(tgt ${test_config_lst})
 endforeach()
 
 set_property(TEST install_non_standard_cgal APPEND PROPERTY DEPENDS config_non_standard_cgal)
-set_property(TEST config_non_standard_cgal APPEND PROPERTY FIXTURES_SETUP test_config_file_3_target)
-set_property(TEST install_non_standard_cgal APPEND PROPERTY FIXTURES_SETUP test_config_file_3_target)
-set_property(TEST test_config_file_3 test_config_file_5 APPEND PROPERTY FIXTURES_REQUIRED test_config_file_3_target)
+set_property(TEST config_non_standard_cgal APPEND PROPERTY FIXTURES_SETUP test_config_file_non_standard_install_lib_cmake_target)
+set_property(TEST install_non_standard_cgal APPEND PROPERTY FIXTURES_SETUP test_config_file_non_standard_install_lib_cmake_target)
+set_property(TEST test_config_file_non_standard_install_lib_cmake test_config_file_non_standard APPEND PROPERTY FIXTURES_REQUIRED test_config_file_non_standard_install_lib_cmake_target)
 
 set_property(TEST install_non_standard_cgal APPEND PROPERTY LABELS Installation_Tests CGAL_cmake_testsuite)
 set_property(TEST config_non_standard_cgal APPEND PROPERTY LABELS Installation_Tests CGAL_cmake_testsuite)
 
-if(CGAL_Qt5_FOUND)
-  set_property(TEST install_non_standard_cgal_qt5 APPEND PROPERTY DEPENDS config_non_standard_cgal_qt5)
-  set_property(TEST config_non_standard_cgal_qt5 APPEND PROPERTY FIXTURES_SETUP test_config_file_4_target)
-  set_property(TEST install_non_standard_cgal_qt5 APPEND PROPERTY FIXTURES_SETUP test_config_file_4_target)
-  set_property(TEST test_config_file_4 APPEND PROPERTY FIXTURES_REQUIRED test_config_file_4_target)
+if(CGAL_Qt6_FOUND)
+  set_property(TEST install_non_standard_cgal_qt APPEND PROPERTY DEPENDS config_non_standard_cgal_qt)
+  set_property(TEST config_non_standard_cgal_qt APPEND PROPERTY FIXTURES_SETUP test_config_file_non_standard_install_lib_cmake_with_qt_target)
+  set_property(TEST install_non_standard_cgal_qt APPEND PROPERTY FIXTURES_SETUP test_config_file_non_standard_install_lib_cmake_with_qt_target)
+  set_property(TEST test_config_file_non_standard_install_lib_cmake_with_qt APPEND PROPERTY FIXTURES_REQUIRED test_config_file_non_standard_install_lib_cmake_with_qt_target)
 
-  set_property(TEST install_non_standard_cgal_qt5 APPEND PROPERTY LABELS Installation_Tests CGAL_cmake_testsuite)
-  set_property(TEST config_non_standard_cgal_qt5 APPEND PROPERTY LABELS Installation_Tests CGAL_cmake_testsuite)
-endif()#CGAL_Qt5_FOUND
+  set_property(TEST install_non_standard_cgal_qt APPEND PROPERTY LABELS Installation_Tests CGAL_cmake_testsuite)
+  set_property(TEST config_non_standard_cgal_qt APPEND PROPERTY LABELS Installation_Tests CGAL_cmake_testsuite)
+endif()#CGAL_Qt6_FOUND
diff --git a/Installation/test/Installation/link_to_CGAL_Qt6.cpp b/Installation/test/Installation/link_to_CGAL_Qt6.cpp
new file mode 100644
index 000000000000..f83cad157054
--- /dev/null
+++ b/Installation/test/Installation/link_to_CGAL_Qt6.cpp
@@ -0,0 +1,11 @@
+// Use something defined not in headers but in the CGAL library to test that is was indeed properly built and linked to,
+
+#include <CGAL/Qt/utility.h>
+
+typedef QRectF (*mapToSceneFunction)(const QGraphicsView* , const QRect);
+
+int main()
+{
+  mapToSceneFunction f = CGAL::Qt::mapToScene;
+  return (&f > 0) ? 0 : 1;
+}
diff --git a/Installation/test/Installation/test_configuration_qt5.cmake.in b/Installation/test/Installation/test_configuration_qt.cmake.in
similarity index 89%
rename from Installation/test/Installation/test_configuration_qt5.cmake.in
rename to Installation/test/Installation/test_configuration_qt.cmake.in
index 548c6fba2bf8..6283fc661205 100644
--- a/Installation/test/Installation/test_configuration_qt5.cmake.in
+++ b/Installation/test/Installation/test_configuration_qt.cmake.in
@@ -1,6 +1,6 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(test_configuration)
-find_package(CGAL COMPONENTS Qt5)
+find_package(CGAL COMPONENTS Qt6)
 add_definitions(-DCGAL_USE_BASIC_VIEWER -DQT_NO_KEYWORDS)
 
 get_filename_component(CGAL_DIR_PATH "${CGAL_DIR}/CMakeConfig.cmake" DIRECTORY)
@@ -10,5 +10,5 @@ if(NOT ${CGAL_DIR_PATH} STREQUAL ${CGAL_GIVEN_DIR_PATH})
   message("${CGAL_DIR_PATH} != ${CGAL_GIVEN_DIR_PATH}")
   message( FATAL_ERROR "The CGAL_DIR is wrong !")
 endif()
-add_executable(test_configuration @CMAKE_CURRENT_SOURCE_DIR@/test_configuration_qt5.cpp)
-target_link_libraries(test_configuration PUBLIC CGAL::CGAL CGAL::CGAL_Qt5)
+add_executable(test_configuration @CMAKE_CURRENT_SOURCE_DIR@/test_configuration_qt.cpp)
+target_link_libraries(test_configuration PUBLIC CGAL::CGAL CGAL::CGAL_Qt6)
diff --git a/Installation/test/Installation/test_configuration_qt5.cpp b/Installation/test/Installation/test_configuration_qt.cpp
similarity index 100%
rename from Installation/test/Installation/test_configuration_qt5.cpp
rename to Installation/test/Installation/test_configuration_qt.cpp
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/draw_linear_cell_complex.h b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/draw_linear_cell_complex.h
index 0e0d2f392b58..648d2c81ef3c 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/CGAL/draw_linear_cell_complex.h
+++ b/Linear_cell_complex/doc/Linear_cell_complex/CGAL/draw_linear_cell_complex.h
@@ -3,8 +3,8 @@ namespace CGAL {
 /*!
 \ingroup PkgDrawLinearCellComplex
 
-opens a new window and draws `alcc`, a model of the `LinearCellComplex` concept. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+opens a new window and draws `alcc`, a model of the `LinearCellComplex` concept. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 \tparam LCC a model of the `LinearCellComplex` concept.
 \param alcc the linear cell complex to draw.
 
diff --git a/Linear_cell_complex/doc/Linear_cell_complex/Linear_cell_complex.txt b/Linear_cell_complex/doc/Linear_cell_complex/Linear_cell_complex.txt
index 0cb7753c302a..cac02fc6200d 100644
--- a/Linear_cell_complex/doc/Linear_cell_complex/Linear_cell_complex.txt
+++ b/Linear_cell_complex/doc/Linear_cell_complex/Linear_cell_complex.txt
@@ -265,8 +265,8 @@ A linear cell complex can be visualized by calling the \link PkgDrawLinearCellCo
 
 \cgalExample{Linear_cell_complex/draw_linear_cell_complex.cpp}
 
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \cgalFigureBegin{fig_draw_lcc,draw_lcc.png}
 Result of the run of the draw_linear_cell_complex program. A window shows two 3D cubes and allows to navigate through the 3D scene.
diff --git a/Nef_3/doc/Nef_3/CGAL/draw_nef_3.h b/Nef_3/doc/Nef_3/CGAL/draw_nef_3.h
index f65883f84053..d61f502cc4f0 100644
--- a/Nef_3/doc/Nef_3/CGAL/draw_nef_3.h
+++ b/Nef_3/doc/Nef_3/CGAL/draw_nef_3.h
@@ -4,8 +4,8 @@ namespace CGAL {
 \ingroup PkgDrawNef3
 
 Open a new window and draws `anef3`, the `Nef_polyhedron_3`. A call to this function is blocking, that is the program continues as soon as the user closes the window.
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 \tparam Nef3 a model of the `Nef_polyhedron_3` concept.
 \param anef3 the nef polyhedron to draw.
 
diff --git a/Nef_3/doc/Nef_3/Nef_3.txt b/Nef_3/doc/Nef_3/Nef_3.txt
index 60e98f188640..2edbb56529d6 100644
--- a/Nef_3/doc/Nef_3/Nef_3.txt
+++ b/Nef_3/doc/Nef_3/Nef_3.txt
@@ -424,8 +424,8 @@ A nef polyhedron can be visualised by calling the \link PkgDrawNef3 CGAL::draw<N
 
 \cgalExample{Nef_3/draw_nef_3.cpp}
 
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \cgalFigureBegin{fig_draw_nef_polyhedron, draw_nef_3.png}
 Result of the run  of the draw_nef_3 program. A window shows the nef polyhedron and allows to navigate through the 3D scene.
diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/draw_periodic_2_triangulation_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/draw_periodic_2_triangulation_2.h
index 0bf8e1b6fe66..cbad54f1f7aa 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/draw_periodic_2_triangulation_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/draw_periodic_2_triangulation_2.h
@@ -4,8 +4,8 @@ namespace CGAL {
 \ingroup PkgDrawPeriodic2Triangulation2
 
 opens a new window and draws `ap2t2`, the `Periodic_2_Triangulation_2`. A call to this function is blocking, that is the program continues as soon as the user closes the window.
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 \tparam P2T2 a model of the `Periodic_2TriangulationTraits_2` concept.
 \param ap2t2 the 2D periodic trinagulation to draw.
 
diff --git a/Point_set_3/doc/Point_set_3/Point_set_3.txt b/Point_set_3/doc/Point_set_3/Point_set_3.txt
index 513659988820..f06483789f0e 100644
--- a/Point_set_3/doc/Point_set_3/Point_set_3.txt
+++ b/Point_set_3/doc/Point_set_3/Point_set_3.txt
@@ -169,8 +169,8 @@ A 3D point set can be visualized by calling the \link PkgDrawPointSet3D CGAL::dr
 
 \cgalExample{Point_set_3/draw_point_set_3.cpp}
 
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \cgalFigureBegin{fig_draw_point_set,draw_point_set.png}
 Result of the run of the draw_point_set_3 program. A window shows the 3D points and allows to navigate through the 3D scene.
diff --git a/Point_set_3/include/CGAL/draw_point_set_3.h b/Point_set_3/include/CGAL/draw_point_set_3.h
index f8d9000cfa3e..ecd747b3cdf1 100644
--- a/Point_set_3/include/CGAL/draw_point_set_3.h
+++ b/Point_set_3/include/CGAL/draw_point_set_3.h
@@ -22,8 +22,8 @@ namespace CGAL {
 /*!
 \ingroup PkgDrawPointSet3D
 
-opens a new window and draws `aps`, an instance of the `CGAL::Point_set_3` class. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+opens a new window and draws `aps`, an instance of the `CGAL::Point_set_3` class. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 \tparam PS an instance of the `CGAL::Point_set_3` class.
 \param aps the point set to draw.
 
diff --git a/Polygon/doc/Polygon/Polygon.txt b/Polygon/doc/Polygon/Polygon.txt
index b21d57325e70..f84a10c8a8ce 100644
--- a/Polygon/doc/Polygon/Polygon.txt
+++ b/Polygon/doc/Polygon/Polygon.txt
@@ -86,8 +86,8 @@ A polygon can be visualized by calling the \link  PkgDrawPolygon2 CGAL::draw<P>(
 
 \cgalExample{Polygon/draw_polygon.cpp}
 
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \cgalFigureBegin{fig_draw_polygon,draw_polygon.png}
 Result of the run of the draw_polygon program. A window shows the polygon and allows to navigate through the scene.
diff --git a/Polygon/include/CGAL/draw_polygon_2.h b/Polygon/include/CGAL/draw_polygon_2.h
index 1ab6ea142674..800e15e18a06 100644
--- a/Polygon/include/CGAL/draw_polygon_2.h
+++ b/Polygon/include/CGAL/draw_polygon_2.h
@@ -25,8 +25,8 @@ namespace CGAL {
 /*!
 \ingroup PkgDrawPolygon2
 
-opens a new window and draws `ap`, an instance of the `CGAL::Polygon_2` class. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+opens a new window and draws `ap`, an instance of the `CGAL::Polygon_2` class. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 \tparam P an instance of the `CGAL::Polygon_2` class.
 \param ap the polygon to draw.
 
diff --git a/Polygon/include/CGAL/draw_polygon_with_holes_2.h b/Polygon/include/CGAL/draw_polygon_with_holes_2.h
index d8b72c9bdd92..a530ad0a221b 100644
--- a/Polygon/include/CGAL/draw_polygon_with_holes_2.h
+++ b/Polygon/include/CGAL/draw_polygon_with_holes_2.h
@@ -28,9 +28,9 @@ namespace CGAL {
  * opens a new window and draws `aph`, an instance of the
  * `CGAL::Polygon_with_holes_2` class. A call to this function is blocking, that
  * is the program continues as soon as the user closes the window. This function
- * requires `CGAL_Qt5`, and is only available if the macro
+ * requires `CGAL_Qt6`, and is only available if the macro
  * `CGAL_USE_BASIC_VIEWER` is defined.  Linking with the cmake target
- * `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition
+ * `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition
  * `CGAL_USE_BASIC_VIEWER`.
  * \tparam PH an instance of the `CGAL::Polygon_with_holes_2` class.
  * \param aph the polygon with holes to draw.
diff --git a/Polyhedron/doc/Polyhedron/CGAL/draw_polyhedron.h b/Polyhedron/doc/Polyhedron/CGAL/draw_polyhedron.h
index 3ce65574799e..9ed56fe232c2 100644
--- a/Polyhedron/doc/Polyhedron/CGAL/draw_polyhedron.h
+++ b/Polyhedron/doc/Polyhedron/CGAL/draw_polyhedron.h
@@ -3,8 +3,8 @@ namespace CGAL {
 /*!
 \ingroup PkgDrawPolyhedron
 
-opens a new window and draws `apoly`, an instance of the `CGAL::Polyhedron_3` class. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+opens a new window and draws `apoly`, an instance of the `CGAL::Polyhedron_3` class. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 \tparam POLY an instance of the `CGAL::Polyhedron_3` class.
 \param apoly the polyhedron to draw.
 
diff --git a/Polyhedron/doc/Polyhedron/Polyhedron.txt b/Polyhedron/doc/Polyhedron/Polyhedron.txt
index cff55a73257d..e9d9cb1a5b35 100644
--- a/Polyhedron/doc/Polyhedron/Polyhedron.txt
+++ b/Polyhedron/doc/Polyhedron/Polyhedron.txt
@@ -284,8 +284,8 @@ A polyhedron can be visualized by calling the \link PkgDrawPolyhedron CGAL::draw
 
 \cgalExample{Polyhedron/draw_polyhedron.cpp}
 
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \cgalFigureBegin{fig_draw_polyhedron,draw_polyhedron.png}
 Result of the run of the draw_polyhedron program. A window shows the polyhedron and allows to navigate through the 3D scene.
diff --git a/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt b/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt
index e7a521eaaabc..b7be50a395fc 100644
--- a/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt
+++ b/Surface_mesh/doc/Surface_mesh/Surface_mesh.txt
@@ -388,8 +388,8 @@ A surface mesh can be visualized by calling the \link PkgDrawSurfaceMesh CGAL::d
 
 \cgalExample{Surface_mesh/draw_surface_mesh.cpp}
 
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \cgalFigureBegin{fig_draw_surface_mesh,draw_surface_mesh.png}
 Result of the run of the draw_surface_mesh program. A window shows the surface mesh and allows to navigate through the 3D scene.
diff --git a/Surface_mesh/include/CGAL/draw_surface_mesh.h b/Surface_mesh/include/CGAL/draw_surface_mesh.h
index 8dd25acd5b2b..72158e05836c 100644
--- a/Surface_mesh/include/CGAL/draw_surface_mesh.h
+++ b/Surface_mesh/include/CGAL/draw_surface_mesh.h
@@ -17,8 +17,8 @@
 /*!
 \ingroup PkgDrawSurfaceMesh
 
-Open a new window and draw `asm`, an instance of the `CGAL::Surface_mesh` class. The function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+Open a new window and draw `asm`, an instance of the `CGAL::Surface_mesh` class. The function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 \tparam SM an instance of the `CGAL::Surface_mesh` class.
 \param asm the surface mesh to draw.
 
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/draw_face_graph_with_paths.h b/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/draw_face_graph_with_paths.h
index e2a13b4bf5ff..df9bde13a6f3 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/draw_face_graph_with_paths.h
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/CGAL/draw_face_graph_with_paths.h
@@ -4,7 +4,7 @@ namespace CGAL {
 \ingroup PkgDrawFaceGraphWithPaths
 
 opens a new window and draws `amesh`,  either a 2D linear cell complex or a model of the FaceGraph concept, plus the paths lying on this mesh given in `apaths`.
-A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt5`, and is only available if the flag `CGAL_USE_BASIC_VIEWER` is defined at compile time.
+A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt6`, and is only available if the flag `CGAL_USE_BASIC_VIEWER` is defined at compile time.
 \tparam Mesh either a 2D linear cell complex or a model of the FaceGraph concept.
 \param amesh the mesh to draw.
 \param apaths the paths to draw, which should lie on `amesh`.
@@ -17,7 +17,7 @@ void draw(const Mesh& amesh,
 \ingroup PkgDrawFaceGraphWithPaths
 
 opens a new window and draws `amesh`,  either a 2D linear cell complex or a model of the FaceGraph concept, plus the paths lying on this mesh given in `apaths`.
-A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt5`, and is only available if the flag `CGAL_USE_BASIC_VIEWER` is defined at compile time.
+A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt6`, and is only available if the flag `CGAL_USE_BASIC_VIEWER` is defined at compile time.
 \tparam Mesh either a 2D linear cell complex or a model of the FaceGraph concept.
 \param amesh the mesh to draw.
 \param apaths the paths to draw, which should lie on `amesh`.
diff --git a/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt b/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
index 4ce425fb91f2..ad624ea45868 100644
--- a/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
+++ b/Surface_mesh_topology/doc/Surface_mesh_topology/Surface_mesh_topology.txt
@@ -153,20 +153,20 @@ In order to find the edge width of the surface, one can make use of the routine
 
 \cgalExample{Surface_mesh_topology/edgewidth_surface_mesh.cpp}
 
-In these two examples, the mesh and the cycles can be visualized if CGAL_Qt5 is enabled.
+In these two examples, the mesh and the cycles can be visualized if CGAL_Qt6 is enabled.
 
 \subsection SMTopology_Example_IV Compute Face Width
 
-The following example computes the face width, and visualizes it if CGAL_Qt5 is enabled.
+The following example computes the face width, and visualizes it if CGAL_Qt6 is enabled.
 
 \cgalExample{Surface_mesh_topology/facewidth.cpp}
 
 \subsection SMTopology_Example_V Basic Homotopy Test
-The following example shows how to load an off file and how to create three closed paths on this surface. Contractibility and free homotopy tests are then performed. The example also shows how to use the \cgal viewer if CGAL_Qt5 is enabled.
+The following example shows how to load an off file and how to create three closed paths on this surface. Contractibility and free homotopy tests are then performed. The example also shows how to use the \cgal viewer if CGAL_Qt6 is enabled.
 \cgalExample{Surface_mesh_topology/path_homotopy_double_torus.cpp}
 
 \subsection SMTopology_Example_VI Basic Simplicity Test
-The following example shows how to test the simplicity of a closed path on a double torus. The original path is visualized if CGAL_Qt5 is enabled.
+The following example shows how to test the simplicity of a closed path on a double torus. The original path is visualized if CGAL_Qt6 is enabled.
 \cgalExample{Surface_mesh_topology/path_simplicity_double_torus_2.cpp}
 
 \subsection SMTopology_Example_VI_VII Polygonal Schema
diff --git a/Testsuite/test/post_process_ctest_results.py b/Testsuite/test/post_process_ctest_results.py
index 120094cabbb3..2ec152996977 100644
--- a/Testsuite/test/post_process_ctest_results.py
+++ b/Testsuite/test/post_process_ctest_results.py
@@ -47,7 +47,7 @@
           name="libCGALCore_shared"
         elif name == "libCGAL_ImageIO":
           name="libCGALimageIO_shared"
-        elif name == "libCGAL_Qt5":
+        elif name == "libCGAL_Qt6":
           name="libCGALQt5_shared"
         if name=="incomplete":
           is_writing=False
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/draw_triangulation_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/draw_triangulation_2.h
index 4b63d19a344d..6ca50c894cf4 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/draw_triangulation_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/draw_triangulation_2.h
@@ -8,9 +8,9 @@ has constraints they are drawn.  If the face type has a member
 function `bool is_in_domain()` the faces inside and outside of the
 domain are drawn in different colors.
 
-A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
 Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with
-`CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+`CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \tparam T2 a triangulation class derived from `Triangulation_2`  or `Constrained_triangulation_2`
 \param at2 the triangulation to draw.
@@ -26,8 +26,8 @@ opens a new window and draws a constrained triangulation. If the triangulation
 has constraints they are drawn.  The faces inside and outside of the
 domain, based on the property map, are drawn in different colors.
 
-A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \tparam CT2 a triangulation class derived from `Constrained_triangulation_2`
 \tparam InDomainPMap a class model of `ReadWritePropertyMap`  with
diff --git a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
index 249c5a0117de..a7aead03e285 100644
--- a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
+++ b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
@@ -509,8 +509,8 @@ A 2D triangulation can be visualized by calling the \link PkgDrawTriangulation2
 
 \cgalExample{Triangulation_2/draw_triangulation_2.cpp}
 
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \cgalFigureBegin{fig_draw_triangulation_2,draw_triangulation_2.png}
 Result of the run of the draw_triangulation_2 program. A window shows the 2D triangulation and allows to navigate through the scene.
diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/draw_triangulation_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/draw_triangulation_3.h
index 266e73dcca29..82d1caf91248 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/draw_triangulation_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/draw_triangulation_3.h
@@ -3,8 +3,8 @@ namespace CGAL {
 /*!
 \ingroup PkgDrawTriangulation3
 
-opens a new window and draws `at3`, a model of the `TriangulationDataStructure_3` concept. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires CGAL_Qt5, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+opens a new window and draws `at3`, a model of the `TriangulationDataStructure_3` concept. A call to this function is blocking, that is the program continues as soon as the user closes the window. This function requires CGAL_Qt6, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 \tparam T3 a model of the `TriangulationDataStructure_3` concept.
 \param at3 the triangulation to draw.
 
diff --git a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
index 0b1170a552ed..84daca88505f 100644
--- a/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
+++ b/Triangulation_3/doc/Triangulation_3/Triangulation_3.txt
@@ -569,8 +569,8 @@ A 3D triangulation can be visualized by calling the \link PkgDrawTriangulation3
 
 \cgalExample{Triangulation_3/draw_triangulation_3.cpp}
 
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \cgalFigureBegin{fig_draw_triangulation_3,draw_triangulation_3.png}
 Result of the run of the draw_triangulation_3 program. A window shows the 3D triangulation and allows to navigate through the 3D scene.
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/draw_voronoi_diagram_2.h b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/draw_voronoi_diagram_2.h
index 1eb06f9c3530..530bcaf5dda2 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/draw_voronoi_diagram_2.h
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/CGAL/draw_voronoi_diagram_2.h
@@ -6,8 +6,8 @@ namespace CGAL {
 opens a new window and draws `av2`, the `Voronoi_diagram_2` constructed from a Delaunay Graph which is a model of `DelaunayGraph_2` concept.
 The class `Voronoi_diagram_2` provides an adaptor to view a triangulated Delaunay graph as their dual subdivision, the
 Voronoi diagram. A call to this function is blocking, that is the program continues as soon as the user closes the window.
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 \tparam V2 a model of the `AdaptationTraits_2` concept.
 \param av2 the voronoi diagram to draw.
 
diff --git a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Voronoi_diagram_2.txt b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Voronoi_diagram_2.txt
index 2ee66c16c184..437036f97efd 100644
--- a/Voronoi_diagram_2/doc/Voronoi_diagram_2/Voronoi_diagram_2.txt
+++ b/Voronoi_diagram_2/doc/Voronoi_diagram_2/Voronoi_diagram_2.txt
@@ -493,8 +493,8 @@ location queries.
 A 2D Voronoi Diagram can be visualized by calling the \link PkgDrawVoronoiDiagram2 CGAL::draw<VD>() \endlink function as
 shown in the following example. This function opens a new window showing the Voronoi Diagram of the given input sites/vertex locations. A call to this function is blocking, that is the program continues as soon as the user closes the window.
 
-This function requires `CGAL_Qt5`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
-Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt5` and add the definition `CGAL_USE_BASIC_VIEWER`.
+This function requires `CGAL_Qt6`, and is only available if the macro `CGAL_USE_BASIC_VIEWER` is defined.
+Linking with the cmake target `CGAL::CGAL_Basic_viewer` will link with `CGAL_Qt6` and add the definition `CGAL_USE_BASIC_VIEWER`.
 
 \cgalExample{Voronoi_diagram_2/draw_voronoi_diagram_2.cpp}
 

From 48f37a14dc9563617633c3a313c94d2cf00d8e1b Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 14 Sep 2023 17:02:21 +0200
Subject: [PATCH 0732/1398] remove occurrences of Qt5

---
 .gitignore                                    |  8 ------
 .../Developer_manual/cmakelist_script.txt     |  2 +-
 .../create_and_use_a_cmakelist.txt            |  4 +--
 .../doc/Documentation/Third_party.txt         |  4 +--
 Documentation/doc/Documentation/Usage.txt     |  8 +++---
 .../advanced/Configuration_variables.txt      |  8 +++---
 Documentation/doc/Documentation/windows.txt   |  9 +++----
 GraphicsView/TODO                             | 11 --------
 .../Segment_voronoi_linf_2.cpp                |  2 +-
 GraphicsView/include/CGAL/export/Qt.h         |  4 +--
 Installation/LICENSE                          | 11 ++++----
 ...GAL_enable_end_of_configuration_hook.cmake |  4 +--
 .../config/support/print_QT4_version.cpp      | 19 --------------
 Installation/include/CGAL/export/helpers.h    |  2 +-
 .../Installation/test_configuration_qt.cpp    |  2 +-
 .../Linear_cell_complex_3_demo.cpp            |  2 +-
 Mesh_2/demo/Mesh_2/README.txt                 |  2 +-
 .../Polyline_simplification_2.cpp             |  2 +-
 .../fundamental_group_of_the_torus.cpp        |  2 +-
 Testsuite/test/post_process_ctest_results.py  |  2 +-
 Three/doc/Three/Three.txt                     | 25 +++++++++----------
 21 files changed, 46 insertions(+), 87 deletions(-)
 delete mode 100644 GraphicsView/TODO
 delete mode 100644 Installation/cmake/modules/config/support/print_QT4_version.cpp

diff --git a/.gitignore b/.gitignore
index a53ed4269ce2..90f003227c6f 100644
--- a/.gitignore
+++ b/.gitignore
@@ -178,12 +178,6 @@ GraphicsView/demo/Triangulation_2/Makefile
 GraphicsView/demo/Triangulation_2/Regular_triangulation_2
 GraphicsView/demo/Triangulation_2/qrc_*.cxx
 GraphicsView/demo/Triangulation_2/ui_*.h
-GraphicsView/src/CGAL_Qt5/*.dll
-GraphicsView/src/CGAL_Qt5/*.lib
-GraphicsView/src/CGAL_Qt5/*.so
-GraphicsView/src/CGAL_Qt5/Makefile
-GraphicsView/src/CGAL_Qt5/moc_*.cxx
-GraphicsView/src/CGAL_Qt5/qrc_*.cxx
 HalfedgeDS/test/HalfedgeDS/cgal_test_with_cmake
 HalfedgeDS/test/HalfedgeDS/test_hds
 HalfedgeDS/test/HalfedgeDS/test_hds_decorator
@@ -879,7 +873,6 @@ Surface_mesher/demo/Surface_mesher/.*.deps
 Surface_mesher/demo/Surface_mesher/.qglviewer.xml
 Surface_mesher/demo/Surface_mesher/Makefile
 Surface_mesher/demo/Surface_mesher/Surface_mesher
-Surface_mesher/demo/Surface_mesher/Surface_mesher_Qt5_Demo
 Surface_mesher/demo/Surface_mesher/VTK/Makefile
 Surface_mesher/demo/Surface_mesher/VTK/mesh_a_3D_image
 Surface_mesher/demo/Surface_mesher/VTK/mesh_a_VTK_3D_image
@@ -894,7 +887,6 @@ Surface_mesher/demo/Surface_mesher/out*.off
 Surface_mesher/demo/Surface_mesher/polyhedron_remesher
 Surface_mesher/demo/Surface_mesher/polyhedron_remesher_with_edges
 Surface_mesher/demo/Surface_mesher/qrc_*.c*
-Surface_mesher/demo/Surface_mesher/qt5-demo
 Surface_mesher/demo/Surface_mesher/ui_*.h
 Surface_mesher/doxygen
 Surface_mesher/examples/Surface_mesher/.*.deps
diff --git a/Documentation/doc/Documentation/Developer_manual/cmakelist_script.txt b/Documentation/doc/Documentation/Developer_manual/cmakelist_script.txt
index 7b451bf81784..26c1f7c0ef4b 100644
--- a/Documentation/doc/Documentation/Developer_manual/cmakelist_script.txt
+++ b/Documentation/doc/Documentation/Developer_manual/cmakelist_script.txt
@@ -23,7 +23,7 @@ If the parameter is not given, the script creates <B>one executable for each giv
 source file</B>.
 <DT><B>`-c com1:com2:...`</B><DD> Lists components ("com1",
 "com2") of \cgal to which the executable(s) should be linked. Valid components are \cgal's
-libraries (i.e.\ "Core", "ImageIO", and "Qt5"). An example is `-c Core`.
+libraries (i.e.\ "Core", "ImageIO", and "Qt6"). An example is `-c Core`.
 
 <DT><B>`-b boost1:boost2:...`</B><DD> Lists components ("boost1",
 "boost2") of \boost to which the executable(s) should be
diff --git a/Documentation/doc/Documentation/Developer_manual/create_and_use_a_cmakelist.txt b/Documentation/doc/Documentation/Developer_manual/create_and_use_a_cmakelist.txt
index 14eb07f8d8f0..d55f4c0819ba 100644
--- a/Documentation/doc/Documentation/Developer_manual/create_and_use_a_cmakelist.txt
+++ b/Documentation/doc/Documentation/Developer_manual/create_and_use_a_cmakelist.txt
@@ -25,8 +25,8 @@ the section \subpage thirdparty.
   - `-frounding-math` with gcc
   - `/fp:strict /fp:except-` with MSVC
 
-\section secexample Minimal Example Using Qt5
-This section describes a minimal example of a program that uses \cgal and Qt5 for some GUI features.
+\section secexample Minimal Example Using Qt6
+This section describes a minimal example of a program that uses \cgal and Qt6 for some GUI features.
 
 \subsection subcmake CMakeLists.txt
 \dontinclude Surface_mesh/CMakeLists.txt
diff --git a/Documentation/doc/Documentation/Third_party.txt b/Documentation/doc/Documentation/Third_party.txt
index 67533c1aef90..dda99763ac9d 100644
--- a/Documentation/doc/Documentation/Third_party.txt
+++ b/Documentation/doc/Documentation/Third_party.txt
@@ -102,8 +102,8 @@ version shipped with \cgal.
 The page \ref configurationvariables lists CMake and environment variables which can be used to specify
 the location of third-party software during configuration.
 
-\subsection thirdpartyQt Qt5
-<b>Version 5.9.0 or later</b>
+\subsection thirdpartyQt Qt6
+<b>Version 6.4 or later</b>
 
 Qt is a cross-platform application and UI framework.
 
diff --git a/Documentation/doc/Documentation/Usage.txt b/Documentation/doc/Documentation/Usage.txt
index 046f3d6da384..0cfdb9ba30ec 100644
--- a/Documentation/doc/Documentation/Usage.txt
+++ b/Documentation/doc/Documentation/Usage.txt
@@ -166,17 +166,17 @@ if no debugging is intended. Users should thus run:
     cd CGAL-\cgalReleaseNumber/examples/Triangulation_2
     cmake -DCGAL_DIR=$HOME/CGAL-\cgalReleaseNumber -DCMAKE_BUILD_TYPE=Release . # we are here using a release tarball
 
-The package Qt5 on brew is "keg-only", which means it is not "linked" with brew.
-In order to link against Qt5, you need to run:
+The package Qt6 on brew is "keg-only", which means it is not "linked" with brew.
+In order to link against Qt6, you need to run:
 
-    brew link qt@5
+    brew link qt@6
 
 After that, you will have to specify the Qt6_DIR by hand to cmake, using something like
 
     -DQt6_DIR=/usr/local/opt/qt6/lib/cmake/Qt6
 
 where `/usr/local/` is actually your current brew installation directory. Check this directory
-to be sure where the Qt5 is placed on your machine.
+to be sure where the Qt6 is placed on your machine.
 
 \subsection usage_configuring_cmake_gui Specifying Missing Dependencies
 
diff --git a/Documentation/doc/Documentation/advanced/Configuration_variables.txt b/Documentation/doc/Documentation/advanced/Configuration_variables.txt
index 7cedae4344ac..7c475f547766 100644
--- a/Documentation/doc/Documentation/advanced/Configuration_variables.txt
+++ b/Documentation/doc/Documentation/advanced/Configuration_variables.txt
@@ -85,7 +85,7 @@ and will serverly limit performances.
 | Variable              | Description                                                           | Type        | %Default Value |
 | :-                    | :-                    | :-   |  :-            |
 | `CGAL_DIR`            | Full-path to the binary directory where \cgal was configured          |Either CMake or Environment | none |
-| `Qt5_DIR`             | Full-path to the Qt cmake directory  |CMake| platform-dependent|
+| `Qt6_DIR`             | Full-path to the Qt cmake directory  |CMake| platform-dependent|
 
 
 \subsection installation_variables_third_party Variables Providing Information About 3rd-Party Libraries
@@ -178,11 +178,11 @@ Under Linux, the \gmpxx is also searched for, and you may specify the following
 
 
 
-\subsection installation_qt5 Qt5 Library
+\subsection installation_qt6 Qt6 Library
 
-You must set the cmake or environment variable `Qt5_DIR` to point to the path
+You must set the cmake or environment variable `Qt6_DIR` to point to the path
 to the directory containing the file `Qt6Config.cmake` created by your \qt6 installation. If you are
-using the open source edition it should be `<path>/qt-everywhere-opensource-src-<version>/qtbase/lib/cmake/Qt5`.
+using the open source edition it should be `<path>/qt-everywhere-opensource-src-<version>/qtbase/lib/cmake/Qt6`.
 
 \subsection installation_leda LEDA Library
 
diff --git a/Documentation/doc/Documentation/windows.txt b/Documentation/doc/Documentation/windows.txt
index 8b4674530077..0dd5839a8b3b 100644
--- a/Documentation/doc/Documentation/windows.txt
+++ b/Documentation/doc/Documentation/windows.txt
@@ -118,7 +118,7 @@ CMake variables and paths. Otherwise, you can also install it using `vcpkg`:
 
 Remember to specify `--triplet` or the related environment variable in case you target 64-bit applications.
 
-As Qt5 is modular and as the \cgal examples and demos use only some of these modules
+As Qt6 is modular and as the \cgal examples and demos use only some of these modules
 you can save download and compilation time by specifying an *installation option*:
 
     C:\dev\vcpkg> .\vcpkg.exe install cgal[qt]
@@ -234,11 +234,10 @@ A typical `Qt` installation would consist of the following steps:
 <ul>
 <li>
 Download and install the Qt library for open source development package for your Visual Studio version at
-<a href="https://www.qt.io/download">https://www.qt.io/download</a>
-(here is the direct link to the <a href="https://www.qt.io/offline-installers">offline installers</a>).</li>
-<li>Add the environment variable `QTDIR` pointing to the place you installed Qt, e.g., `C:\dev\Qt\Qt5.13.1`,
+<a href="https://www.qt.io/download-open-source#source">https://www.qt.io/download-open-source#source</a>.</li>
+<li>Add the environment variable `QTDIR` pointing to the place you installed Qt, e.g., `C:\dev\Qt\Qt6.13.1`,
 as this will help `cmake` to find Qt.</li>
-<li>Add the bin directory of Qt, e.g. add  `C:\dev\Qt\Qt5.13.1\msvcXXXX_YY\bin` to `PATH`, where `XXXX_YY` is something like `vc2017_64`.
+<li>Add the bin directory of Qt, e.g. add  `C:\dev\Qt\Qt6.13.1\msvcXXXX_YY\bin` to `PATH`, where `XXXX_YY` is something like `vc2017_64`.
 To avoid any conflict with another dll with the same name from another folder, add this path as the first in the list.</li>
 </ul>
 
diff --git a/GraphicsView/TODO b/GraphicsView/TODO
deleted file mode 100644
index ec7ea6d5649d..000000000000
--- a/GraphicsView/TODO
+++ /dev/null
@@ -1,11 +0,0 @@
-Les inputs se sont seulement un simple  mousePressEvent (pour un circle, il faut cliquer deux fois)
-Pour le cercle, ça serait bien d'avoir la possibilité d'entrée un cercle par centre/rayon, ou deux points diamétraux, ou trois points.
-Bloquer l'input sur un truc // aux axes (avec shift)
-S'inspirer de ipe, en général.
-
-Control: pour les navigations
-Shift: pour // aux axes.
-
-Affichage du (x,y) par rapport à l'origine de l'objet en cours.
-
-Integrer src/CGALQt5 dans le build process de CGAL, avec CMake.
diff --git a/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/Segment_voronoi_linf_2.cpp b/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/Segment_voronoi_linf_2.cpp
index 7b67d31ad4a5..77d9e7c4dc00 100644
--- a/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/Segment_voronoi_linf_2.cpp
+++ b/GraphicsView/demo/Segment_Delaunay_graph_Linf_2/Segment_voronoi_linf_2.cpp
@@ -522,7 +522,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Segment Voronoi 2 demo");
 
-  // Import resources from libCGAL (Qt5)
+  // Import resources from libCGAL (Qt6)
   CGAL_QT_INIT_RESOURCES;
 
   if (argc == 2) {
diff --git a/GraphicsView/include/CGAL/export/Qt.h b/GraphicsView/include/CGAL/export/Qt.h
index a1392b2610a2..a5b1c82fa197 100644
--- a/GraphicsView/include/CGAL/export/Qt.h
+++ b/GraphicsView/include/CGAL/export/Qt.h
@@ -16,9 +16,9 @@
 #include <CGAL/export/helpers.h>
 
 #if ( defined(CGAL_BUILD_SHARED_LIBS) && ( ! defined(CGAL_HEADER_ONLY) ) ) \
-  || defined(CGAL_USE_Qt5_RESOURCES)
+  || defined(CGAL_USE_Qt6_RESOURCES)
 
-#  if defined(CGAL_Qt6_EXPORTS) || defined(CGAL_USE_Qt5_RESOURCES)
+#  if defined(CGAL_Qt6_EXPORTS) || defined(CGAL_USE_Qt6_RESOURCES)
 // defined by CMake or in cpp files of the dll
 
 #    define CGAL_QT_EXPORT CGAL_DLL_EXPORT
diff --git a/Installation/LICENSE b/Installation/LICENSE
index 1ba1accba3e1..dd6e40c93dcb 100644
--- a/Installation/LICENSE
+++ b/Installation/LICENSE
@@ -5,9 +5,8 @@ The CGAL software consists of several parts, each of which is licensed under
 an open source license. It is also possible to obtain commercial licenses
 from GeometryFactory (www.geometryfactory.com) for all or parts of CGAL.
 
-The source code of the CGAL library can be found in the directories
-"src/CGAL", "src/CGALQt", "src/CGALQt5" and "include/CGAL" (with the
-exception of "include/CGAL/CORE", "include/CGAL/OpenNL").
+The source code of the CGAL library can be found in the directory
+"include/CGAL" (with the exception of "include/CGAL/CORE", "include/CGAL/OpenNL").
 It is specified in each file of the CGAL library which
 license applies to it. This is either the GNU General Public License
 or the GNU Lesser General Public License (as published by the Free Software
@@ -26,9 +25,9 @@ Distributed along with CGAL (for the users' convenience), but not part of
 CGAL, are the following third-party libraries, available under their own
 licenses:
 
-- CORE, in the directories "include/CGAL/CORE" and "src/CGAL_Core", is
-  licensed under the LGPL (see LICENSE.LGPL).
-- ImageIO, in the directory "src/CGAL_ImageIO", is licensed under the LGPL
+- CORE, in the directory "include/CGAL/CORE" is licensed under the LGPL
+  (see LICENSE.LGPL).
+- ImageIO, in the directory "include/CGAL/ImageIO", is licensed under the LGPL
   (see LICENSE.LGPL).
 - OpenNL, in the directory "include/CGAL/OpenNL", is licensed under the LGPL
   (see LICENSE.LGPL).
diff --git a/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake b/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
index a25a85fa50c4..4b6053671fc8 100644
--- a/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
+++ b/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
@@ -103,7 +103,7 @@ disable this ${type}.\n\
   endif()
 endfunction()
 
-function(CGAL_hook_fix_ctest_depending_on_Qt5)
+function(CGAL_hook_fix_ctest_depending_on_Qt6)
   get_property(_targets DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR} PROPERTY BUILDSYSTEM_TARGETS)
   foreach(_target ${_targets})
     if(NOT TEST "compilation of  ${_target}")
@@ -120,7 +120,7 @@ function(CGAL_hooks_at_end_of_all_directories)
   CGAL_hook_check_targets()
   CGAL_hook_check_unused_cpp_files()
   if(BUILD_TESTING)
-    CGAL_hook_fix_ctest_depending_on_Qt5()
+    CGAL_hook_fix_ctest_depending_on_Qt6()
   endif()
 endfunction()
 
diff --git a/Installation/cmake/modules/config/support/print_QT4_version.cpp b/Installation/cmake/modules/config/support/print_QT4_version.cpp
deleted file mode 100644
index cd290f2f4e4a..000000000000
--- a/Installation/cmake/modules/config/support/print_QT4_version.cpp
+++ /dev/null
@@ -1,19 +0,0 @@
-// Copyright (c) 2008 GeometryFactory, Sophia Antipolis (France)
-//
-// This file is part of CGAL (www.cgal.org)
-//
-// $URL$
-// $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
-
-// Tests if QT5 is available and prints its version string.
-
-#include <iostream>
-#include <QtCore/QtGlobal>
-
-int main()
-{
-    std::cout << "version=" << QT_VERSION_STR << std::endl;
-
-    return 0;
-}
diff --git a/Installation/include/CGAL/export/helpers.h b/Installation/include/CGAL/export/helpers.h
index 4b384c71f4bc..3f5750902f80 100644
--- a/Installation/include/CGAL/export/helpers.h
+++ b/Installation/include/CGAL/export/helpers.h
@@ -12,7 +12,7 @@
 #ifndef CGAL_EXPORT_HELPERS_H
 #define CGAL_EXPORT_HELPERS_H
 
-#if defined(CGAL_HEADER_ONLY) && ! defined(CGAL_USE_Qt5_RESOURCES)
+#if defined(CGAL_HEADER_ONLY) && ! defined(CGAL_USE_Qt6_RESOURCES)
 #  define CGAL_DLL_IMPORT
 #  define CGAL_DLL_EXPORT
 #  define CGAL_DLL_LOCAL
diff --git a/Installation/test/Installation/test_configuration_qt.cpp b/Installation/test/Installation/test_configuration_qt.cpp
index 73206ca0b4fe..34436111e123 100644
--- a/Installation/test/Installation/test_configuration_qt.cpp
+++ b/Installation/test/Installation/test_configuration_qt.cpp
@@ -26,7 +26,7 @@ int main(int argc, char**) {
   std::istream_iterator<Point> end;
   Triangulation t;
   t.insert(begin, end);
-  if(argc == 3) // do not test Qt5 at runtime
+  if(argc == 3) // do not test Qt6 at runtime
     CGAL::draw(t);
   std::cout<<"OK."<<std::endl;
   return EXIT_SUCCESS;
diff --git a/Linear_cell_complex/demo/Linear_cell_complex/Linear_cell_complex_3_demo.cpp b/Linear_cell_complex/demo/Linear_cell_complex/Linear_cell_complex_3_demo.cpp
index cd31d8592173..8b318c69bac7 100644
--- a/Linear_cell_complex/demo/Linear_cell_complex/Linear_cell_complex_3_demo.cpp
+++ b/Linear_cell_complex/demo/Linear_cell_complex/Linear_cell_complex_3_demo.cpp
@@ -31,7 +31,7 @@ int main(int argc, char** argv)
   application.setOrganizationName("CNRS and LIRIS' Establishments");
   application.setApplicationName("3D Linear Cell Complex");
 
-  // Import resources from libCGALQt5
+  // Import resources from libCGALQt6
   // See https://doc.qt.io/qt-5/qdir.html#Q_INIT_RESOURCE
   CGAL_Qt_init_resources();// that function is in a DLL
   Q_INIT_RESOURCE(Linear_cell_complex_3);
diff --git a/Mesh_2/demo/Mesh_2/README.txt b/Mesh_2/demo/Mesh_2/README.txt
index efef749b3b80..34074405361b 100644
--- a/Mesh_2/demo/Mesh_2/README.txt
+++ b/Mesh_2/demo/Mesh_2/README.txt
@@ -1,5 +1,5 @@
 This directory contains non-graphical demos of the 2D Mesh Generator
 package.
-The Constrained Delaunay triangulation Qt5 demos has a 2D meshing feature that
+The Constrained Delaunay triangulation Qt demos has a 2D meshing feature that
 demonstrates the  2D Mesh Generator package. See in the directory
 demo/Triangulation_2/ of the CGAL tarball.
diff --git a/Polyline_simplification_2/demo/Polyline_simplification_2/Polyline_simplification_2.cpp b/Polyline_simplification_2/demo/Polyline_simplification_2/Polyline_simplification_2.cpp
index 2e15255eaef6..10542f4f8da9 100644
--- a/Polyline_simplification_2/demo/Polyline_simplification_2/Polyline_simplification_2.cpp
+++ b/Polyline_simplification_2/demo/Polyline_simplification_2/Polyline_simplification_2.cpp
@@ -503,7 +503,7 @@ int main(int argc, char **argv)
   app.setOrganizationName("GeometryFactory");
   app.setApplicationName("Polyline_simplification_2 demo");
 
-  // Import resources from libCGALQt5.
+  // Import resources from libCGALQt6.
   CGAL_QT_INIT_RESOURCES;
 
   MainWindow mainWindow;
diff --git a/Surface_mesh_topology/test/Surface_mesh_topology/fundamental_group_of_the_torus.cpp b/Surface_mesh_topology/test/Surface_mesh_topology/fundamental_group_of_the_torus.cpp
index 7aa6ea5ea649..1f445d7ebc0a 100644
--- a/Surface_mesh_topology/test/Surface_mesh_topology/fundamental_group_of_the_torus.cpp
+++ b/Surface_mesh_topology/test/Surface_mesh_topology/fundamental_group_of_the_torus.cpp
@@ -121,7 +121,7 @@ int main()
 /*
 #ifdef CGAL_USE_BASIC_VIEWER
   std::vector<Path_on_surface<SM> > paths={pij, pkl};
-  CGAL::draw(sm, paths); // Enable only if CGAL was compiled with Qt5
+  CGAL::draw(sm, paths); // Enable only if CGAL was compiled with Qt6
 #endif // CGAL_USE_BASIC_VIEWER
 */
   for (int i=-4; i<=4; ++i)
diff --git a/Testsuite/test/post_process_ctest_results.py b/Testsuite/test/post_process_ctest_results.py
index 2ec152996977..6da4d7de21c1 100644
--- a/Testsuite/test/post_process_ctest_results.py
+++ b/Testsuite/test/post_process_ctest_results.py
@@ -48,7 +48,7 @@
         elif name == "libCGAL_ImageIO":
           name="libCGALimageIO_shared"
         elif name == "libCGAL_Qt6":
-          name="libCGALQt5_shared"
+          name="libCGALQt6_shared"
         if name=="incomplete":
           is_writing=False
           is_ignored=False
diff --git a/Three/doc/Three/Three.txt b/Three/doc/Three/Three.txt
index b8987352aea0..593d7623b2f3 100644
--- a/Three/doc/Three/Three.txt
+++ b/Three/doc/Three/Three.txt
@@ -322,7 +322,7 @@ To create an external plugin, you must make a new Cmake project.\n
 
     project( Example_plugin )
 
-Configure CMake as you desire and fetch the right Qt5 packages :
+Configure CMake as you desire and fetch the right Qt6 packages :
 
     # Find includes in corresponding build directories
     set(CMAKE_INCLUDE_CURRENT_DIR ON)
@@ -331,13 +331,13 @@ Configure CMake as you desire and fetch the right Qt5 packages :
     cmake_minimum_required(VERSION 3.1...3.23)
 
     #Find CGAL
-    find_package(CGAL COMPONENTS Qt5)
+    find_package(CGAL COMPONENTS Qt6)
     include( ${CGAL_USE_FILE} )
-    # Find Qt5 itself
-    find_package(Qt5
+    # Find Qt6 itself
+    find_package(Qt6
                  QUIET
-                 COMPONENTS            OpenGL Script Svg Xml
-                 OPTIONAL_COMPONENTS   ScriptTools)
+                 COMPONENTS            OpenGLWidgets Svg
+                 OPTIONAL_COMPONENTS   WebSockets)
 
 You will probably have to fetch the libraries exported by the Polyhedron_demo, like the Scene_items.
 
@@ -370,15 +370,14 @@ Notice that an external plugin will not be automatically loaded in the Polyhedro
     cmake_minimum_required(VERSION 3.1...3.23)
 
     #Find CGAL
-    find_package(CGAL COMPONENTS Qt5)
+    find_package(CGAL COMPONENTS Qt6)
     include( ${CGAL_USE_FILE} )
-    # Find Qt5 itself
-    find_package(Qt5
-                 QUIET
-                 COMPONENTS            OpenGL Script Svg Xml
-                 OPTIONAL_COMPONENTS   ScriptTools)
+    # Find Qt6 itself
+    find_package(Qt6 QUIET
+                 COMPONENTS OpenGLWidgets Svg
+                 OPTIONAL_COMPONENTS WebSockets)
 
-    if(Qt5_FOUND AND CGAL_FOUND)
+    if(Qt6_FOUND AND CGAL_FOUND)
       find_package(CGAL_polyhedron_demo)
 
     include( ${CGAL_POLYHEDRON_DEMO_USE_FILE} )

From 68f7646dcbca3066ec65a81fd22b371a3605b4e5 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 14 Sep 2023 17:02:49 +0200
Subject: [PATCH 0733/1398] remove stray CMake debug messages

---
 Polyhedron/demo/Polyhedron/CMakeLists.txt | 20 --------------------
 1 file changed, 20 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/CMakeLists.txt b/Polyhedron/demo/Polyhedron/CMakeLists.txt
index 4aaa5a99984d..afcfd708dc06 100644
--- a/Polyhedron/demo/Polyhedron/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/CMakeLists.txt
@@ -40,10 +40,6 @@ find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6 ImageIO)
 set_package_properties(CGAL PROPERTIES TYPE REQUIRED)
 include(${CGAL_USE_FILE})
 
-if(CGAL_Qt6_FOUND)
-  message( STATUS "we found CGAL_Qt6")
-endif()
-
 # Find Qt6 itself
 find_package(Qt6 QUIET
              COMPONENTS OpenGLWidgets Widgets Qml
@@ -55,12 +51,7 @@ set_package_properties(
   PURPOSE "Enables the 3D Features, for GUI and visualization."
   DESCRIPTION "To find this package, it should be sufficient to fill the Qt6_DIR variable with: <Qt_dir>/<Qt_version>/<Compilator>/lib/cmake/Qt6")
 
-if(NOT Qt6_FOUND)
-  message( STATUS "we did not find it")
-endif()
-
 if(Qt6_FOUND)
-  message( STATUS "we did find Qt6")
   add_definitions(-DQT_NO_KEYWORDS)
   add_definitions(-DSCENE_IMAGE_GL_BUFFERS_AVAILABLE)
 endif(Qt6_FOUND)
@@ -128,17 +119,6 @@ set_package_properties(
   DESCRIPTION "A library for parallel programming."
   PURPOSE "Plugins such as Mesh_3, Bilateral smoothing, and WLOP are faster if TBB is linked.")
 
-
-
-if(NOT CGAL_Qt6_FOUND)
-  message( STATUS "NOT CGAL_Qt6_FOUND")
-endif()
-
-if(NOT Qt6_FOUND)
-  message( STATUS "NOT Qt6_FOUND")
-endif()
-
-
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   include(${CGAL_USE_FILE})
 

From 9bba3bd5fa57a8c8fb861fcd07b541e9238d97d5 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 14 Sep 2023 17:06:34 +0200
Subject: [PATCH 0734/1398] fix the list of used Qt6 components

---
 Documentation/doc/Documentation/Third_party.txt | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Documentation/doc/Documentation/Third_party.txt b/Documentation/doc/Documentation/Third_party.txt
index dda99763ac9d..1784cd7f88c5 100644
--- a/Documentation/doc/Documentation/Third_party.txt
+++ b/Documentation/doc/Documentation/Third_party.txt
@@ -112,9 +112,9 @@ It requires \qt6 installed on your system.
 In case \qt is not yet installed on your system, you can download
 it from <A HREF="https://www.qt-project.org/">`https://www.qt-project.org/`</A>.
 
-The exhaustive list of \qt5 components used in demos is:
-`Core`, `Gui`, `Help`, `OpenGL`, `Script`, `ScriptTools`, `Svg`, `Widgets`,
-`qcollectiongenerator` (with `sqlite` driver plugin), and `Xml`.
+The exhaustive list of \qt6 components used in demos is:
+`Core`, `Gui`, `Help`, `OpenGL`, `OpenGLWidgets`, `Qml`, `Svg`, `Widgets`,
+`WebSockets`,  `Network`, and `qcollectiongenerator` (with `sqlite` driver plugin).
 
 \subsection thirdpartyEigen Eigen
 <b>Version 3.3.4 or later</b>

From b05e1e9e4604aa8663366f6f6aed416c215cce7e Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 14 Sep 2023 17:32:55 +0200
Subject: [PATCH 0735/1398] Remove UseCGAL.cmake

and our old CMake macros `use_lib` and `use_component`.
---
 .../Arrangement_on_surface_2/CMakeLists.txt   |   1 -
 .../Arrangement_on_surface_2/CMakeLists.txt   |   3 -
 CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt |   2 -
 .../benchmark/Filtered_kernel/CMakeLists.txt  |   6 +-
 GraphicsView/demo/Polygon/CMakeLists.txt      |   1 -
 Installation/CHANGES.md                       |   1 +
 Installation/CMakeLists.txt                   |   3 -
 .../cmake/modules/CGALConfig_binary.cmake.in  |   4 +-
 .../cmake/modules/CGALConfig_install.cmake.in |   3 +-
 Installation/cmake/modules/CGAL_Macros.cmake  | 121 ------------------
 Installation/cmake/modules/UseCGAL.cmake      |  51 --------
 Installation/lib/cmake/CGAL/CGALConfig.cmake  |   4 +-
 Installation/test/Installation/CMakeLists.txt |   2 -
 .../Linear_cell_complex_2/CMakeLists.txt      |   6 +-
 .../cmake/FindCGAL.cmake                      |  93 --------------
 .../Linear_cell_complex_3/CMakeLists.txt      |   4 +-
 Mesh_2/demo/Mesh_2/CMakeLists.txt             |   6 +-
 Mesh_3/examples/Mesh_3/CMakeLists.txt         |   3 +-
 .../CMakeLists.txt                            |   1 -
 Polyhedron/demo/Polyhedron/CMakeLists.txt     |  10 +-
 .../Plugins/Surface_mesh/CMakeLists.txt       |   2 -
 .../Plugins/Three_examples/CMakeLists.txt     |   3 -
 .../Polyhedron/polyhedron_demo_macros.cmake   |   2 +-
 Surface_mesh/benchmark/CMakeLists.txt         |   6 +-
 Three/doc/Three/Three.txt                     |   2 -
 25 files changed, 21 insertions(+), 319 deletions(-)
 delete mode 100644 Installation/cmake/modules/UseCGAL.cmake
 delete mode 100644 Linear_cell_complex/benchmark/Linear_cell_complex_2/cmake/FindCGAL.cmake

diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt
index 5e9bf30e1d7a..b1de5935340d 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt
@@ -16,7 +16,6 @@ find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Core Qt6)
 find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if (CGAL_Qt6_FOUND AND Qt6_FOUND)
-  include(${CGAL_USE_FILE})
   add_compile_definitions(QT_NO_KEYWORDS)
   include_directories( BEFORE ./ )
 
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/CMakeLists.txt b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/CMakeLists.txt
index bd49b35a5ac5..f138fb0beb3e 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/CMakeLists.txt
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/CMakeLists.txt
@@ -8,7 +8,4 @@ enable_testing()
 
 find_package(CGAL REQUIRED COMPONENTS Core)
 
-include (${CGAL_USE_FILE})
-# Since CMake-2.8.12: New CMake script, that defines the targets and
-# the CTest test cases.
 include(${CMAKE_CURRENT_SOURCE_DIR}/cgal_test.cmake)
diff --git a/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt b/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
index f017575dd855..98a5ab469f39 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
+++ b/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
@@ -20,8 +20,6 @@ set(CMAKE_LIBRARY_OUTPUT_DIRECTORY "${CMAKE_RUNTIME_OUTPUT_DIRECTORY}")
 
 find_package(CGAL REQUIRED COMPONENTS Core)
 
-include(${CGAL_USE_FILE})
-
 find_package(Eigen3 3.1.0 QUIET) #(requires 3.1.0 or greater)
 include(CGAL_Eigen3_support)
 if(NOT TARGET CGAL::Eigen3_support)
diff --git a/Filtered_kernel/benchmark/Filtered_kernel/CMakeLists.txt b/Filtered_kernel/benchmark/Filtered_kernel/CMakeLists.txt
index b894f7392295..b240de403f81 100644
--- a/Filtered_kernel/benchmark/Filtered_kernel/CMakeLists.txt
+++ b/Filtered_kernel/benchmark/Filtered_kernel/CMakeLists.txt
@@ -9,12 +9,10 @@ add_executable(bench_simple_comparisons bench_simple_comparisons.cpp)
 find_package(CGAL REQUIRED COMPONENTS Core)
 
 add_executable(bench_orientation_3 "orientation_3.cpp")
-target_link_libraries(bench_orientation_3 ${CGAL_LIBRARIES}
-                      ${CGAL_3RD_PARTY_LIBRARIES})
+target_link_libraries(bench_orientation_3 CGAL::CGAL_Core)
 
 add_executable(bench_comparisons "orientation_3.cpp")
-target_link_libraries(bench_comparisons ${CGAL_LIBRARIES}
-                      ${CGAL_3RD_PARTY_LIBRARIES})
+target_link_libraries(bench_comparisons CGAL::CGAL_Core)
 set_property(
   TARGET bench_comparisons
   APPEND
diff --git a/GraphicsView/demo/Polygon/CMakeLists.txt b/GraphicsView/demo/Polygon/CMakeLists.txt
index 303b381e038f..ee30af0275eb 100644
--- a/GraphicsView/demo/Polygon/CMakeLists.txt
+++ b/GraphicsView/demo/Polygon/CMakeLists.txt
@@ -16,7 +16,6 @@ endif()
 find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
-  include(${CGAL_USE_FILE})
   add_definitions(-DQT_NO_KEYWORDS)
   set(CMAKE_AUTOMOC ON)
   set(CMAKE_AUTOUIC ON)
diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index eb1e09caa197..a0202f39624f 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -14,6 +14,7 @@ Release date: October 2023
 - **Breaking change**: The usage of `boost::shared_ptr` has been replaced by `std::shared_ptr`. Packages affected are 2D Straight Line Skeleton and Shape Detection.
 - **Breaking change**: The usage of `boost::optional` has been replaced by `std::optional`. Packages affected are 2D Straight Line Skeleton, 3D Fast Intersection and Distance Computation (AABB Tree), and the Kernel intersection.
 - **Breaking change**: The usage of `boost::variant` has been replaced by `std::variant`. Packages affected are 2D Arrangements, and the Kernel intersection.
+- **Breaking chahge**: The file CMake file `UseCGAL.cmake` has been removed from CGAL. Usages of the CMake variables `${CGAL_USE_FILE}` and `${CGAL_LIBRARIES}` must be replaced by a link to the imported target `CGAL::CGAL`, for example: `target_link_library(the_target PRIVATE CGAL::CGAL)`.
 
 #### 2D Arrangements
 
diff --git a/Installation/CMakeLists.txt b/Installation/CMakeLists.txt
index d773903a310a..d9a0eecee3cc 100644
--- a/Installation/CMakeLists.txt
+++ b/Installation/CMakeLists.txt
@@ -656,7 +656,6 @@ endif()
 #
 # Variables used when WITH_{demos|examples|tests} are TRUE
 #
-set(CGAL_USE_FILE ${CGAL_MODULES_DIR}/UseCGAL.cmake)
 get_property(CGAL_FOUND GLOBAL PROPERTY CGAL_FOUND)
 get_property(CGAL_Core_FOUND GLOBAL PROPERTY CGAL_Core_FOUND)
 get_property(CGAL_ImageIO_FOUND GLOBAL PROPERTY CGAL_ImageIO_FOUND)
@@ -755,8 +754,6 @@ install(PROGRAMS ${scripts} DESTINATION ${CGAL_INSTALL_BIN_DIR})
 
 install(DIRECTORY ${CGAL_MODULES_REL_DIR}/
         DESTINATION ${CGAL_INSTALL_CMAKE_DIR})
-install(FILES ${CGAL_MODULES_REL_DIR}/UseCGAL.cmake
-        DESTINATION ${CGAL_INSTALL_CMAKE_DIR})
 
 if(IS_DIRECTORY auxiliary/gmp/include AND IS_DIRECTORY auxiliary/gmp/lib)
   install(DIRECTORY auxiliary/gmp/include/ DESTINATION ${CGAL_INSTALL_INC_DIR})
diff --git a/Installation/cmake/modules/CGALConfig_binary.cmake.in b/Installation/cmake/modules/CGALConfig_binary.cmake.in
index 7987a2bbd1f3..eaab3c7f7f7a 100644
--- a/Installation/cmake/modules/CGALConfig_binary.cmake.in
+++ b/Installation/cmake/modules/CGALConfig_binary.cmake.in
@@ -93,8 +93,6 @@ set(CGAL_ImageIO_USE_ZLIB                 "@CGAL_ImageIO_USE_ZLIB@" )
 
 set(CGAL_VERSION "${CGAL_MAJOR_VERSION}.${CGAL_MINOR_VERSION}.${CGAL_BUGFIX_VERSION}")
 
-set(CGAL_USE_FILE "${CGAL_MODULES_DIR}/UseCGAL.cmake" )
-
 if ( CGAL_FIND_REQUIRED )
   set( CHECK_CGAL_COMPONENT_MSG_ON_ERROR TRUE        )
   set( CHECK_CGAL_COMPONENT_ERROR_TYPE   FATAL_ERROR )
@@ -169,7 +167,7 @@ foreach( CGAL_COMPONENT ${CGAL_FIND_COMPONENTS} )
 endforeach()
 
 # Starting with cmake 2.6.3, CGAL_FIND_COMPONENTS is cleared out when find_package returns.
-# But we need it within UseCGAL.cmake, so we save it aside into another variable
+# But we need it within CGAL_CreateSingleSourceCGALProgram.cmake, so we save it aside into another variable
 set( CGAL_REQUESTED_COMPONENTS ${CGAL_FIND_COMPONENTS} )
 
 # for preconfigured libs
diff --git a/Installation/cmake/modules/CGALConfig_install.cmake.in b/Installation/cmake/modules/CGALConfig_install.cmake.in
index 9ee7c0ba8803..eac955bb91c0 100644
--- a/Installation/cmake/modules/CGALConfig_install.cmake.in
+++ b/Installation/cmake/modules/CGALConfig_install.cmake.in
@@ -54,7 +54,6 @@ set(CGAL_ImageIO_USE_ZLIB                 "@CGAL_ImageIO_USE_ZLIB@" )
 
 set(CGAL_VERSION "${CGAL_MAJOR_VERSION}.${CGAL_MINOR_VERSION}.${CGAL_BUGFIX_VERSION}")
 
-set(CGAL_USE_FILE "${CGAL_MODULES_DIR}/UseCGAL.cmake" )
 set(CGAL_GRAPHICSVIEW_PACKAGE_DIR "${CGAL_INSTALL_PREFIX}" CACHE INTERNAL "Directory containing the GraphicsView package")
 
 if ( CGAL_FIND_REQUIRED )
@@ -153,7 +152,7 @@ foreach( CGAL_COMPONENT ${CGAL_FIND_COMPONENTS} )
 endforeach()
 
 # Starting with cmake 2.6.3, CGAL_FIND_COMPONENTS is cleared out when find_package returns.
-# But we need it within UseCGAL.cmake, so we save it aside into another variable
+# But we need it within CGAL_CreateSingleSourceCGALProgram.cmake, so we save it aside into another variable
 set( CGAL_REQUESTED_COMPONENTS ${CGAL_FIND_COMPONENTS} )
 
 # for preconfigured libs
diff --git a/Installation/cmake/modules/CGAL_Macros.cmake b/Installation/cmake/modules/CGAL_Macros.cmake
index 2cc35fdc572e..3636673f55eb 100644
--- a/Installation/cmake/modules/CGAL_Macros.cmake
+++ b/Installation/cmake/modules/CGAL_Macros.cmake
@@ -211,127 +211,6 @@ if( NOT CGAL_MACROS_FILE_INCLUDED )
 
   endmacro()
 
-  macro( use_lib )
-
-    set (lib "${ARGV0}")
-
-    set (vlib ${CGAL_EXT_LIB_${lib}_PREFIX} )
-
-    if ( ${vlib}_FOUND AND (NOT TARGET CGAL OR WITH_${lib}))
-
-      if ( NOT ${vlib}_SETUP ) # avoid double usage
-
-        if ( "${ARGC}" EQUAL "2" )
-
-          set (usefile "${ARGV1}")
-
-          include( ${usefile} )
-          message (STATUS "Configured ${lib} from UseLIB-file: ${usefile}")
-
-          # UseLIB-file has to set ${vlib}_SETUP to TRUE
-          # TODO EBEB what about Qt6, zlib?
-
-        else()
-
-          ####message( STATUS "${lib} include:     ${${vlib}_INCLUDE_DIR}" )
-          include_directories ( SYSTEM ${${vlib}_INCLUDE_DIR} )
-
-          # TODO EBEB remove definitions?
-          ####message( STATUS "${lib} definitions: ${${vlib}_DEFINITIONS}" )
-          add_definitions( ${${vlib}_DEFINITIONS} "-DCGAL_USE_${vlib}" )
-
-          if ( ${vlib}_LIBRARIES )
-            ####message( STATUS "${lib} libraries:   ${${vlib}_LIBRARIES}" )
-            link_libraries( ${${vlib}_LIBRARIES} )
-          endif()
-
-          ####message (STATUS "Configured ${lib} in standard way")
-
-          set( ${vlib}_SETUP TRUE )
-
-        endif()
-
-      endif()
-
-      if (NOT ${vlib}_SETUP )
-
-         message( WARNING "${vlib} has not been set up" )
-
-      endif()
-
-    else()
-
-      if ( WITH_${lib} )
-        message( SEND_ERROR "Try to use ${lib} that is not found")
-      endif()
-
-    endif()
-
-  endmacro()
-
-
-  macro( use_component component)
-
-    message (STATUS "Requested component: ${component}")
-
-    if(WITH_CGAL_${component})
-      if(TARGET CGAL::CGAL_${component})
-        add_to_list( CGAL_LIBRARIES CGAL::CGAL_${component} )
-      elseif(TARGET CGAL_${component})
-        add_to_list( CGAL_LIBRARIES CGAL_${component} )
-      else()
-        add_to_list( CGAL_LIBRARIES ${CGAL_${component}_LIBRARY} )
-      endif()
-      add_to_list( CGAL_3RD_PARTY_LIBRARIES  ${CGAL_${component}_3RD_PARTY_LIBRARIES}  )
-
-      add_to_list( CGAL_3RD_PARTY_INCLUDE_DIRS   ${CGAL_${component}_3RD_PARTY_INCLUDE_DIRS}   )
-      add_to_list( CGAL_3RD_PARTY_DEFINITIONS    ${CGAL_${component}_3RD_PARTY_DEFINITIONS}    )
-      add_to_list( CGAL_3RD_PARTY_LIBRARIES_DIRS ${CGAL_${component}_3RD_PARTY_LIBRARIES_DIRS} )
-
-      # To deal with imported targets of Qt6 and Boost, when CGAL
-      # targets are themselves imported by another project.
-
-      if (${component} STREQUAL "Qt6")
-        find_package(Qt6 COMPONENTS Widgets OpenGLWidgets Gui Core Script ScriptTools QUIET)
-      endif()
-
-    else(WITH_CGAL_${component})
-
-      # now we are talking about 3rd party libs
-      list( FIND CGAL_CONFIGURED_LIBRARIES "CGAL_${component}" POSITION )
-      if ( "${POSITION}" EQUAL "-1" ) # if component is not a CGAL_<lib>
-
-        if (NOT DEFINED CGAL_EXT_LIB_${component}_PREFIX)
-          set(CGAL_EXT_LIB_${component}_PREFIX ${component})
-        endif()
-
-        set( vlib "${CGAL_EXT_LIB_${component}_PREFIX}" )
-
-        if (${vlib}_FOUND)
-
-          use_lib( ${component} ${${vlib}_USE_FILE})
-
-        else()
-
-          ####message( STATUS "External library ${vlib} after find")
-          if (${vlib}_FOUND)
-            ####message( STATUS "External library ${vlib} about to be used")
-            use_lib( ${component} ${${vlib}_USE_FILE})
-          endif()
-
-        endif()
-      else()
-
-        if (NOT WITH_CGAL_${component})
-          message(STATUS "NOTICE: The CGAL_${component} library seems to be required but is not build. Thus, it is expected that some executables will not be compiled.")
-        endif()
-
-      endif()
-
-    endif(WITH_CGAL_${component})
-
-  endmacro()
-
   function( cgal_setup_module_path )
     # Avoid to modify the modules path twice
     if(NOT CGAL_MODULE_PATH_IS_SET)
diff --git a/Installation/cmake/modules/UseCGAL.cmake b/Installation/cmake/modules/UseCGAL.cmake
deleted file mode 100644
index 43449b85e512..000000000000
--- a/Installation/cmake/modules/UseCGAL.cmake
+++ /dev/null
@@ -1,51 +0,0 @@
-#
-# UseCGAL.cmake can be included in a project to set the needed compiler and linker
-# settings to use CGAL in a program.
-#
-# The variables used here are defined in the CGALConfig.cmake generated when CGAL was installed.
-#
-#
-include(${CGAL_MODULES_DIR}/CGAL_Macros.cmake)
-
-cgal_setup_module_path()
-
-if(NOT USE_CGAL_FILE_INCLUDED)
-  set(USE_CGAL_FILE_INCLUDED 1)
-
-  include(${CMAKE_CURRENT_LIST_DIR}/CGAL_Common.cmake)
-  if( CGAL_DEV_MODE OR RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE )
-    include(${CMAKE_CURRENT_LIST_DIR}/CGAL_SetupFlags.cmake)
-  else()
-    include(${CMAKE_CURRENT_LIST_DIR}/CGAL_display_flags.cmake)
-  endif()
-  include(${CMAKE_CURRENT_LIST_DIR}/CGAL_GeneratorSpecificSettings.cmake)
-  include(${CMAKE_CURRENT_LIST_DIR}/CGAL_TweakFindBoost.cmake)
-
-  set( CGAL_LIBRARIES )
-
-  foreach ( component ${CGAL_REQUESTED_COMPONENTS} )
-    use_component( ${component} )
-  endforeach()
-
-  include_directories( "${CMAKE_CURRENT_BINARY_DIR}" )
-
-  if(TARGET CGAL::CGAL)
-    add_to_list( CGAL_LIBRARIES CGAL::CGAL )
-  elseif(TARGET CGAL)
-    add_to_list( CGAL_LIBRARIES CGAL )
-  else()
-    add_to_list( CGAL_LIBRARIES ${CGAL_LIBRARY} )
-  endif()
-
-  #message (STATUS "LIB: ${CGAL_LIBRARY}")
-  #message (STATUS "LIBS: ${CGAL_LIBRARIES}")
-
-  include_directories ( ${CGAL_INCLUDE_DIRS})
-  include_directories ( SYSTEM ${CGAL_3RD_PARTY_INCLUDE_DIRS} )
-  add_definitions     ( ${CGAL_3RD_PARTY_DEFINITIONS}  ${CGAL_DEFINITIONS}  )
-
-  if(NOT CGAL_NO_BLANKET_LINKING)
-    link_directories    ( ${CGAL_3RD_PARTY_LIBRARIES_DIRS} )
-    link_libraries      ( ${CGAL_LIBRARIES} ${CGAL_3RD_PARTY_LIBRARIES}      )
-  endif()
-endif()
diff --git a/Installation/lib/cmake/CGAL/CGALConfig.cmake b/Installation/lib/cmake/CGAL/CGALConfig.cmake
index abd23a6e7fe0..7b3f2c419cb4 100644
--- a/Installation/lib/cmake/CGAL/CGALConfig.cmake
+++ b/Installation/lib/cmake/CGAL/CGALConfig.cmake
@@ -2,7 +2,7 @@
 # This file is the CGALConfig.cmake for a header-only CGAL installation
 #
 
-# For UseCGAL.cmake
+# For CGAL_CreateSingleSourceCGALProgram.cmake
 set( CGAL_REQUESTED_COMPONENTS ${CGAL_FIND_COMPONENTS} )
 
 set(CGAL_LIBRARIES CGAL)
@@ -113,8 +113,6 @@ include(${CGAL_MODULES_DIR}/CGAL_Common.cmake)
 include(${CGAL_MODULES_DIR}/CGAL_TweakFindBoost.cmake)
 include(${CGAL_MODULES_DIR}/CGAL_enable_end_of_configuration_hook.cmake)
 
-set(CGAL_USE_FILE ${CGAL_MODULES_DIR}/UseCGAL.cmake)
-
 include(${CGAL_CONFIG_DIR}/CGALConfigVersion.cmake)
 
 # Temporary? Change the CMAKE module path
diff --git a/Installation/test/Installation/CMakeLists.txt b/Installation/test/Installation/CMakeLists.txt
index c057119bbd3c..5a22a7c42333 100644
--- a/Installation/test/Installation/CMakeLists.txt
+++ b/Installation/test/Installation/CMakeLists.txt
@@ -32,8 +32,6 @@ endmacro()
 
 find_package(CGAL REQUIRED COMPONENTS Core)
 
-include(${CGAL_USE_FILE})
-
 include(CGAL_CreateSingleSourceCGALProgram)
 
 create_single_source_cgal_program("endian.cpp")
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_2/CMakeLists.txt b/Linear_cell_complex/benchmark/Linear_cell_complex_2/CMakeLists.txt
index c63decf81000..cfa7f45bb92c 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_2/CMakeLists.txt
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_2/CMakeLists.txt
@@ -26,12 +26,12 @@ link_directories(${OPENMESH_LIBRARY_DIR})
 # Polyhedron
 add_executable(polyhedron_performance performance_2.h polyhedron_performance.h
                                       polyhedron_performance.cpp)
-target_link_libraries(polyhedron_performance ${CGAL_LIBRARIES})
+target_link_libraries(polyhedron_performance CGAL::CGAL)
 
 # LCC_2
 add_executable(lcc_performance_2 performance_2.h lcc_performance_2.h
                                  lcc_performance_2.cpp)
-target_link_libraries(lcc_performance_2 ${CGAL_LIBRARIES})
+target_link_libraries(lcc_performance_2 CGAL::CGAL)
 
 # Surface_mesh
 add_executable(
@@ -80,7 +80,7 @@ add_executable(
 
 target_link_libraries(
   performance_2
-  ${CGAL_LIBRARIES}
+  CGAL::CGAL
   surface_mesh
   algo
   assimp
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_2/cmake/FindCGAL.cmake b/Linear_cell_complex/benchmark/Linear_cell_complex_2/cmake/FindCGAL.cmake
deleted file mode 100644
index a4b0902e60d4..000000000000
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_2/cmake/FindCGAL.cmake
+++ /dev/null
@@ -1,93 +0,0 @@
-#
-# The following module is based on FindVTK.cmake
-#
-
-# - Find a CGAL installation or binary tree.
-# The following variables are set if CGAL is found.  If CGAL is not
-# found, CGAL_FOUND is set to false.
-#
-#  CGAL_FOUND         - Set to true when CGAL is found.
-#  CGAL_USE_FILE      - CMake file to use CGAL.
-#
-
-# Construct consistent error messages for use below.
-set(CGAL_DIR_DESCRIPTION "directory containing CGALConfig.cmake. This is either the binary directory where CGAL was configured or PREFIX/lib/CGAL for an installation.")
-set(CGAL_DIR_MESSAGE     "CGAL not found.  Set the CGAL_DIR cmake variable or environment variable to the ${CGAL_DIR_DESCRIPTION}")
-
-if ( NOT CGAL_DIR )
-
-  # Get the system search path as a list.
-  if(UNIX)
-    string(REGEX MATCHALL "[^:]+" CGAL_DIR_SEARCH1 "$ENV{PATH}")
-  else()
-    string(REGEX REPLACE "\\\\" "/" CGAL_DIR_SEARCH1 "$ENV{PATH}")
-  endif()
-
-  string(REGEX REPLACE "/;" ";" CGAL_DIR_SEARCH2 "${CGAL_DIR_SEARCH1}")
-
-  # Construct a set of paths relative to the system search path.
-  set(CGAL_DIR_SEARCH "")
-
-  foreach(dir ${CGAL_DIR_SEARCH2})
-
-    set(CGAL_DIR_SEARCH ${CGAL_DIR_SEARCH} ${dir}/../lib/CGAL )
-
-  endforeach()
-
-
-  #
-  # Look for an installation or build tree.
-  #
-  find_path(CGAL_DIR CGALConfig.cmake
-
-    # Look for an environment variable CGAL_DIR.
-    $ENV{CGAL_DIR}
-
-    # Look in places relative to the system executable search path.
-    ${CGAL_DIR_SEARCH}
-
-    # Look in standard UNIX install locations.
-    /usr/local/lib/CGAL
-    /usr/lib/CGAL
-
-    # Read from the CMakeSetup registry entries.  It is likely that
-    # CGAL will have been recently built.
-    [HKEY_CURRENT_USER\\Software\\Kitware\\CMakeSetup\\Settings\\StartPath;WhereBuild1]
-    [HKEY_CURRENT_USER\\Software\\Kitware\\CMakeSetup\\Settings\\StartPath;WhereBuild2]
-    [HKEY_CURRENT_USER\\Software\\Kitware\\CMakeSetup\\Settings\\StartPath;WhereBuild3]
-    [HKEY_CURRENT_USER\\Software\\Kitware\\CMakeSetup\\Settings\\StartPath;WhereBuild4]
-    [HKEY_CURRENT_USER\\Software\\Kitware\\CMakeSetup\\Settings\\StartPath;WhereBuild5]
-    [HKEY_CURRENT_USER\\Software\\Kitware\\CMakeSetup\\Settings\\StartPath;WhereBuild6]
-    [HKEY_CURRENT_USER\\Software\\Kitware\\CMakeSetup\\Settings\\StartPath;WhereBuild7]
-    [HKEY_CURRENT_USER\\Software\\Kitware\\CMakeSetup\\Settings\\StartPath;WhereBuild8]
-    [HKEY_CURRENT_USER\\Software\\Kitware\\CMakeSetup\\Settings\\StartPath;WhereBuild9]
-    [HKEY_CURRENT_USER\\Software\\Kitware\\CMakeSetup\\Settings\\StartPath;WhereBuild10]
-
-    # Help the user find it if we cannot.
-    DOC "The ${CGAL_DIR_DESCRIPTION}"
-  )
-
-endif()
-
-if ( CGAL_DIR )
-
-  if ( EXISTS "${CGAL_DIR}/CGALConfig.cmake" )
-    include( "${CGAL_DIR}/CGALConfig.cmake" )
-    set( CGAL_FOUND TRUE )
-  endif()
-
-endif()
-
-if( NOT CGAL_FOUND)
-  if(CGAL_FIND_REQUIRED)
-    MESSAGE(FATAL_ERROR ${CGAL_DIR_MESSAGE})
-  else()
-    if(NOT CGAL_FIND_QUIETLY)
-      MESSAGE(STATUS ${CGAL_DIR_MESSAGE})
-    endif()
-  endif()
-endif()
-
-if(CGAL_FOUND)
-  message(STATUS "Found CGAL.")
-endif()
diff --git a/Linear_cell_complex/benchmark/Linear_cell_complex_3/CMakeLists.txt b/Linear_cell_complex/benchmark/Linear_cell_complex_3/CMakeLists.txt
index 4b65e2ee3c5e..5502fe39111c 100644
--- a/Linear_cell_complex/benchmark/Linear_cell_complex_3/CMakeLists.txt
+++ b/Linear_cell_complex/benchmark/Linear_cell_complex_3/CMakeLists.txt
@@ -33,7 +33,7 @@ target_link_libraries(
   OpenVolumeMesh
   boost_timer
   boost_system
-  ${CGAL_LIBRARIES}
+  CGAL::CGAL
   algo
   assimp
   container
@@ -65,7 +65,7 @@ target_link_libraries(
 # LCC_3
 add_executable(lcc_performance_3 performance_3.h lcc_performance_3.h
                                  lcc_performance_3.cpp)
-target_link_libraries(lcc_performance_3 ${CGAL_LIBRARIES}
+target_link_libraries(lcc_performance_3 CGAL::CGAL
                       ${MAP_VIEWER_LIBRARIES})
 
 # OpenVolumeMesh
diff --git a/Mesh_2/demo/Mesh_2/CMakeLists.txt b/Mesh_2/demo/Mesh_2/CMakeLists.txt
index 5087c477a12d..74c8b7f2d86a 100644
--- a/Mesh_2/demo/Mesh_2/CMakeLists.txt
+++ b/Mesh_2/demo/Mesh_2/CMakeLists.txt
@@ -6,16 +6,14 @@ project(Mesh_2_Demo)
 
 find_package(CGAL REQUIRED)
 
-include(${CGAL_USE_FILE})
-
 # conform target
 add_executable(conform conform.cpp)
-target_link_libraries(conform ${CGAL_LIBRARIES} ${CGAL_3RD_PARTY_LIBRARIES})
+target_link_libraries(conform CGAL::CGAL)
 add_to_cached_list(CGAL_EXECUTABLE_TARGETS conform)
 
 # mesh target
 add_executable(mesh mesh.cpp)
-target_link_libraries(mesh ${CGAL_LIBRARIES} ${CGAL_3RD_PARTY_LIBRARIES})
+target_link_libraries(mesh CGAL::CGAL)
 add_to_cached_list(CGAL_EXECUTABLE_TARGETS mesh)
 
 include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
diff --git a/Mesh_3/examples/Mesh_3/CMakeLists.txt b/Mesh_3/examples/Mesh_3/CMakeLists.txt
index 0b59088e04a2..16e7bcd755de 100644
--- a/Mesh_3/examples/Mesh_3/CMakeLists.txt
+++ b/Mesh_3/examples/Mesh_3/CMakeLists.txt
@@ -124,8 +124,7 @@ if(TARGET CGAL::CGAL_ImageIO)
     add_executable(mesh_3D_gray_vtk_image mesh_3D_gray_vtk_image.cpp)
     target_link_libraries(
       mesh_3D_gray_vtk_image
-      PUBLIC CGAL::Eigen3_support CGAL::CGAL CGAL::CGAL_ImageIO
-             ${CGAL_LIBRARIES} ${CGAL_3RD_PARTY_LIBRARIES} ${VTK_LIBRARIES})
+      PUBLIC CGAL::Eigen3_support CGAL::CGAL CGAL::CGAL_ImageIO ${VTK_LIBRARIES})
     cgal_add_test(mesh_3D_gray_vtk_image)
     add_to_cached_list(CGAL_EXECUTABLE_TARGETS mesh_3D_gray_vtk_image)
   endif()
diff --git a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
index 3b838ba2c829..ee592422710c 100644
--- a/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
+++ b/Periodic_4_hyperbolic_triangulation_2/demo/Periodic_4_hyperbolic_triangulation_2/CMakeLists.txt
@@ -9,7 +9,6 @@ include_directories(${CMAKE_BINARY_DIR})
 set(CMAKE_AUTOMOC ON)
 
 find_package(CGAL REQUIRED COMPONENTS Core Qt6)
-include(${CGAL_USE_FILE})
 
 find_package(LEDA QUIET)
 
diff --git a/Polyhedron/demo/Polyhedron/CMakeLists.txt b/Polyhedron/demo/Polyhedron/CMakeLists.txt
index afcfd708dc06..28bf9132603b 100644
--- a/Polyhedron/demo/Polyhedron/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/CMakeLists.txt
@@ -38,7 +38,6 @@ option(POLYHEDRON_QTSCRIPT_DEBUGGER
 # Find CGAL
 find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt6 ImageIO)
 set_package_properties(CGAL PROPERTIES TYPE REQUIRED)
-include(${CGAL_USE_FILE})
 
 # Find Qt6 itself
 find_package(Qt6 QUIET
@@ -120,8 +119,6 @@ set_package_properties(
   PURPOSE "Plugins such as Mesh_3, Bilateral smoothing, and WLOP are faster if TBB is linked.")
 
 if(CGAL_Qt6_FOUND AND Qt6_FOUND)
-  include(${CGAL_USE_FILE})
-
   qt6_wrap_ui(MainWindowUI_files MainWindow.ui)
   qt6_wrap_ui(SubViewerUI_files SubViewer.ui)
   qt6_wrap_ui(statisticsUI_FILES Statistics_on_item_dialog.ui)
@@ -209,7 +206,7 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_library(scene_basic_objects SHARED Scene_plane_item.cpp
                                          Scene_spheres_item.cpp)
   target_link_libraries(
-    scene_basic_objects PUBLIC demo_framework ${CGAL_LIBRARIES} Qt6::OpenGLWidgets
+    scene_basic_objects PUBLIC demo_framework CGAL::CGAL_Qt6 Qt6::OpenGLWidgets
                                Qt6::Gui Qt6::Widgets)
   add_library(scene_color_ramp SHARED Color_ramp.cpp)
   target_link_libraries(scene_color_ramp PRIVATE Qt6::Core)
@@ -225,7 +222,7 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   macro(add_item item_name)
     add_library(${item_name} SHARED ${ARGN})
     target_link_libraries(
-      ${item_name} PUBLIC demo_framework ${CGAL_LIBRARIES} Qt6::OpenGLWidgets Qt6::Gui
+      ${item_name} PUBLIC demo_framework CGAL::CGAL_Qt6 Qt6::OpenGLWidgets Qt6::Gui
                           Qt6::Widgets)
     add_to_cached_list(CGAL_EXECUTABLE_TARGETS ${item_name})
   endmacro(add_item)
@@ -376,8 +373,7 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
   target_link_libraries(Polyhedron_3 PRIVATE demo_framework)
 
   # Link with CGAL
-  target_link_libraries(Polyhedron_3 PUBLIC ${CGAL_LIBRARIES}
-                                            ${CGAL_3RD_PARTY_LIBRARIES})
+  target_link_libraries(Polyhedron_3 PUBLIC CGAL::CGAL_Qt6)
 
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Polyhedron_3)
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
index e1b75611bac6..0af285ce58fb 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
@@ -7,8 +7,6 @@ if(NOT CGAL_DISABLE_GMP)
   if(TARGET CGAL::Eigen3_support)
     find_package(CGAL REQUIRED COMPONENTS Core)
 
-    include(${CGAL_USE_FILE})
-
     qt6_wrap_ui(parameterizationUI_FILES Parameterization_widget.ui OTE_dialog.ui)
     polyhedron_demo_plugin(parameterization_plugin Parameterization_plugin
                            ${parameterizationUI_FILES})
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/CMakeLists.txt
index 9761cea5fd5f..23f8d5f89994 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/CMakeLists.txt
@@ -17,9 +17,6 @@ find_package(Qt6 QUIET
              OPTIONAL_COMPONENTS WebSockets)
 
 if(RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE)
-  if(Qt6_FOUND)
-    include(${CGAL_USE_FILE})
-  endif()
   polyhedron_demo_plugin(example_plugin Example_plugin)
 
   qt6_wrap_ui(basicUI_FILES Basic_dialog.ui)
diff --git a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
index f4129a57c9fc..6bdda967ab8b 100644
--- a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
+++ b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
@@ -60,7 +60,7 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
       set_property(TEST "compilation of  ${plugin_name}" APPEND PROPERTY FIXTURES_REQUIRED demo_framework_SetupFixture)
     endif()
     # Link with CGAL
-    target_link_libraries( ${plugin_name} PUBLIC ${CGAL_LIBRARIES} ${CGAL_3RD_PARTY_LIBRARIES} )
+    target_link_libraries( ${plugin_name} PUBLIC CGAL::CGAL )
     if(TARGET Polyhedron_3)
       add_dependencies( ${plugin_name} Polyhedron_3 )
     endif()
diff --git a/Surface_mesh/benchmark/CMakeLists.txt b/Surface_mesh/benchmark/CMakeLists.txt
index 33ae6c845694..818e8cb6b9d3 100644
--- a/Surface_mesh/benchmark/CMakeLists.txt
+++ b/Surface_mesh/benchmark/CMakeLists.txt
@@ -12,12 +12,12 @@ add_definitions("-std=c++1y")
 # Polyhedron
 add_executable(polyhedron_performance performance_2.h polyhedron_performance.h
                                       polyhedron_performance.cpp)
-target_link_libraries(polyhedron_performance PRIVATE ${CGAL_LIBRARIES})
+target_link_libraries(polyhedron_performance PRIVATE CGAL::CGAL)
 
 # LCC_2
 add_executable(lcc_performance_2 performance_2.h lcc_performance_2.h
                                  lcc_performance_2.cpp)
-target_link_libraries(lcc_performance_2 PRIVATE ${CGAL_LIBRARIES})
+target_link_libraries(lcc_performance_2 PRIVATE CGAL::CGAL)
 
 # Surface_mesh
 add_executable(
@@ -29,7 +29,7 @@ add_executable(
   performance_2 performance_2.cpp performance_2.h polyhedron_performance.h
                 surface_mesh_performance.h lcc_performance_2.h)
 
-target_link_libraries(performance_2 PRIVATE ${CGAL_LIBRARIES})
+target_link_libraries(performance_2 PRIVATE CGAL::CGAL)
 
 create_single_source_cgal_program("sm_sms.cpp")
 create_single_source_cgal_program("poly_sms.cpp")
diff --git a/Three/doc/Three/Three.txt b/Three/doc/Three/Three.txt
index 593d7623b2f3..2afe5f4d27ca 100644
--- a/Three/doc/Three/Three.txt
+++ b/Three/doc/Three/Three.txt
@@ -332,7 +332,6 @@ Configure CMake as you desire and fetch the right Qt6 packages :
 
     #Find CGAL
     find_package(CGAL COMPONENTS Qt6)
-    include( ${CGAL_USE_FILE} )
     # Find Qt6 itself
     find_package(Qt6
                  QUIET
@@ -371,7 +370,6 @@ Notice that an external plugin will not be automatically loaded in the Polyhedro
 
     #Find CGAL
     find_package(CGAL COMPONENTS Qt6)
-    include( ${CGAL_USE_FILE} )
     # Find Qt6 itself
     find_package(Qt6 QUIET
                  COMPONENTS OpenGLWidgets Svg

From 40a7f324d3487876bf647737101835717b4a5407 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 15 Sep 2023 11:27:43 +0200
Subject: [PATCH 0736/1398] fix a compilation error

The generated `ui_Deform_mesh.h` was not is in the right directory.
I have moved the definition of the item in the plugin directory.
---
 Polyhedron/demo/Polyhedron/CMakeLists.txt                 | 7 -------
 .../Plugins/Surface_mesh_deformation/CMakeLists.txt       | 8 ++++++++
 2 files changed, 8 insertions(+), 7 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/CMakeLists.txt b/Polyhedron/demo/Polyhedron/CMakeLists.txt
index 28bf9132603b..d2d45f83c7b4 100644
--- a/Polyhedron/demo/Polyhedron/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/CMakeLists.txt
@@ -295,13 +295,6 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
     add_item(scene_textured_item Scene_textured_surface_mesh_item.cpp
              texture.cpp)
     target_link_libraries(scene_textured_item PUBLIC CGAL::Eigen3_support)
-    qt6_wrap_ui(editionUI_FILES Plugins/Surface_mesh_deformation/Deform_mesh.ui)
-    add_item(scene_edit_item
-             Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.cpp
-             ${editionUI_FILES})
-    target_link_libraries(
-      scene_edit_item PUBLIC CGAL::Eigen3_support scene_surface_mesh_item
-                             scene_k_ring_selection scene_basic_objects)
     add_item(scene_mcf_item Plugins/PMP/Scene_mcf_item.cpp)
     target_link_libraries(scene_mcf_item PUBLIC CGAL::Eigen3_support)
   endif()
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/CMakeLists.txt
index ce9c7e682094..36cbea480cd9 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/CMakeLists.txt
@@ -2,6 +2,14 @@ include(polyhedron_demo_macros)
 
 if(TARGET CGAL::Eigen3_support AND "${EIGEN3_VERSION}" VERSION_GREATER "3.1.90")
 
+  qt6_wrap_ui(editionUI_FILES Deform_mesh.ui)
+  add_item(scene_edit_item
+           Scene_edit_polyhedron_item.cpp
+           ${editionUI_FILES})
+  target_link_libraries(
+    scene_edit_item PUBLIC CGAL::Eigen3_support scene_surface_mesh_item
+                           scene_k_ring_selection scene_basic_objects)
+
   polyhedron_demo_plugin(edit_plugin Edit_polyhedron_plugin Deform_mesh.ui)
   target_link_libraries(edit_plugin PUBLIC scene_surface_mesh_item
                                            scene_edit_item scene_selection_item)

From 11c8b17f884f6fee9417923b4d770e7d97e41fe8 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Sun, 17 Sep 2023 14:25:23 +0100
Subject: [PATCH 0737/1398] Box_intersection_d: Fix doc link

---
 .../Box_intersection_d/CGAL/Box_intersection_d/Box_traits_d.h | 4 ++--
 .../doc/Box_intersection_d/PackageDescription.txt             | 4 +++-
 2 files changed, 5 insertions(+), 3 deletions(-)

diff --git a/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_traits_d.h b/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_traits_d.h
index a3731b377d46..b981a093d7f2 100644
--- a/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_traits_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/CGAL/Box_intersection_d/Box_traits_d.h
@@ -47,12 +47,12 @@ Box_traits_d();
 
 
 /*!
-\ingroup PkgBoxIntersectionDFunctions
+\ingroup PkgBoxIntersectionDEnums
 */
 enum Setting  { COMPLETE, BIPARTITE };
 
 /*!
-\ingroup PkgBoxIntersectionDFunctions
+\ingroup PkgBoxIntersectionDEnums
 */
 enum Topology { HALF_OPEN, CLOSED };
 
diff --git a/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt b/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
index 0574d49cc386..724fabe7234f 100644
--- a/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
+++ b/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
@@ -2,6 +2,9 @@
 /// \defgroup PkgBoxIntersectionDConcepts Concepts
 /// \ingroup PkgBoxIntersectionDRef
 
+/// \defgroup PkgBoxIntersectionDEnums Rnumerations
+/// \ingroup PkgBoxIntersectionDRef
+
 /// \defgroup PkgBoxIntersectionDClasses Classes
 /// \ingroup PkgBoxIntersectionDRef
 
@@ -56,4 +59,3 @@
 - `CGAL::box_self_intersection_all_pairs_d`
 
 */
-

From 7500e801c7480b5cc7ac3873cef62dd5546bbb03 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 18 Sep 2023 09:17:15 +0100
Subject: [PATCH 0738/1398] Fix typo

---
 .../doc/Box_intersection_d/PackageDescription.txt               | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt b/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
index 724fabe7234f..9844c8f94824 100644
--- a/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
+++ b/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
@@ -2,7 +2,7 @@
 /// \defgroup PkgBoxIntersectionDConcepts Concepts
 /// \ingroup PkgBoxIntersectionDRef
 
-/// \defgroup PkgBoxIntersectionDEnums Rnumerations
+/// \defgroup PkgBoxIntersectionDEnums Enumerations
 /// \ingroup PkgBoxIntersectionDRef
 
 /// \defgroup PkgBoxIntersectionDClasses Classes

From c140a5df31f69d837c5d37fad66fb42d673698e7 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 18 Sep 2023 11:15:07 +0100
Subject: [PATCH 0739/1398] Add \cgalCRPSection{Enumerations}

---
 .../doc/Box_intersection_d/PackageDescription.txt            | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt b/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
index 9844c8f94824..2e3b3607b687 100644
--- a/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
+++ b/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
@@ -42,6 +42,11 @@
 
 \cgalClassifedRefPages
 
+\cgalCRPSection{Enumerations}
+- `CGAL::Box_intersection_d::Setting`
+- `CGAL::Box_intersection_d::Topology`
+
+
 \cgalCRPSection{Concepts}
 - `BoxIntersectionBox_d`
 - `BoxIntersectionTraits_d`

From 71cd38ecb5fe12330791ba40ad71eb4eac1f27b7 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 19 Sep 2023 12:20:06 +0300
Subject: [PATCH 0740/1398] Several fixes mainly related to output iterators

---
 .../Arrangement_on_surface_2.txt              |   2 +-
 .../CGAL/Arr_algebraic_segment_traits_2.h     | 402 ++++++++----------
 .../CGAL/Arr_batched_point_location.h         |  64 +--
 .../CGAL/Arr_conic_traits_2.h                 |  29 +-
 .../CGAL/Arr_point_location_result.h          |  35 +-
 .../CGAL/Arr_polycurve_traits_2.h             |  19 +-
 .../CGAL/Arr_vertical_decomposition_2.h       |  80 ++--
 .../CGAL/Arrangement_2.h                      |  33 --
 .../CGAL/Arrangement_on_surface_2.h           |  49 ++-
 .../CGAL/CORE_algebraic_number_traits.h       | 180 ++++----
 .../Concepts/ArrTraits--Intersect_2.h         |  35 +-
 .../Concepts/ArrTraits--MakeXMonotone_2.h     |  20 +-
 .../batched_point_location.cpp                |   2 +-
 13 files changed, 467 insertions(+), 483 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index f7dfaa98b520..4299322e38cd 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -5663,7 +5663,7 @@ to define any instance of the class template
 the `Topology_traits` type is selected based on the provided geometry
 traits `Geometry_traits_2`, or more precisely, on the boundary
 conditions defined by the geometry traits. If all sides of the
-boundary of the parameter space are cosed, the instance
+boundary of the parameter space are closed, the instance
 `Arr_bounded_planar_topology_traits_2<Geometry_traits_2,Dcel_>` is
 selected; otherwise the instance
 `Arr_unb_planar_topology_traits_2<Geometry_traits_2,Dcel_>` is
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_algebraic_segment_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_algebraic_segment_traits_2.h
index 069d91859ee7..5007dce85f53 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_algebraic_segment_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_algebraic_segment_traits_2.h
@@ -26,45 +26,37 @@ one of the integral types above.
 
 
 */
-template< typename Coefficient >
+template <typename Coefficient>
 class Arr_algebraic_segment_traits_2 {
 public:
 
 /// \name Types
 /// @{
 
-/*!
-Value to specify whether a point should be in the interior
-of a segment, or its minimal point,
-or its maximal point in lexicographic order.
-*/
+/*! Value to specify whether a point should be in the interior of a segment, or
+ * its minimal point, or its maximal point in lexicographic order.
+ */
 enum Site_of_point { POINT_IN_INTERIOR = 0, MIN_ENDPOINT = -1, MAX_ENDPOINT = 1 };
 
-/*!
-the type for bivariate polynomials,
-with innermost coefficient type `Coefficient`.
-Constitutes a model of the concept `Polynomial_d`
-with two variables.
-
-\sa `CGAL::Polynomial_d`
-*/
+/*! the type for bivariate polynomials, with innermost coefficient type
+ * `Coefficient`.  Constitutes a model of the concept `Polynomial_d` with two
+ * variables.
+ *
+ * \sa `CGAL::Polynomial_d`
+ */
 typedef unspecified_type Polynomial_2;
 
-/*!
-model for the concept
-`AlgebraicKernel_1`
-*/
+/*! model for the concept `AlgebraicKernel_1`
+ */
 typedef unspecified_type Algebraic_kernel_1;
 
-/*!
-represents coordinates of points.
-Typedef from `Algebraic_kernel_1::Algebraic_real_1`
-*/
+/*! represents coordinates of points.
+ * Typedef from `Algebraic_kernel_1::Algebraic_real_1`
+ */
 typedef unspecified_type Algebraic_real_1;
 
-/*!
-Typedef from `Algebraic_kernel_1::Bound`
-*/
+/*! Typedef from `Algebraic_kernel_1::Bound`
+ */
 typedef unspecified_type Bound;
 
 /// @}
@@ -74,46 +66,41 @@ typedef unspecified_type Bound;
 
 /*!
 
-*/
+ */
 Construct_curve_2 construct_curve_2_object() const;
 
 /*!
 
-*/
+ */
 Construct_point_2 construct_point_2_object() const;
 
 /*!
 
-*/
+ */
 Construct_x_monotone_segment_2 construct_x_monotone_segment_2_object() const;
 
 /// @}
 
 /*!
 
-
-*/
+ */
 class Construct_curve_2 {
 public:
 
 /// \name Object Creation Functors
 /// @{
 
-/*!
-Returns a `Curve_2` object that represents the curve defined by
-the polynomial `p`
-*/
+/*! Returns a `Curve_2` object that represents the curve defined by the
+ * polynomial `p`
+ */
 Curve_2 operator() (Polynomial_2 p);
 
-/*!
-Returns a `Curve_2` object specified by `s`.
-The passed string represents the defining polynomial of the curve
-and must be given in a MAPLE-readable format using "x" as first
-and "y" as second variable, e.g.,
-"(x^3*y-2*x)*(-6*x-y^3*x^6)"
-for integer coefficients, and "3/2*x*y^4-5/7*x^2+3/1"
-for rational coefficients.
-*/
+/*! Returns a `Curve_2` object specified by `s`.  The passed string represents
+ * the defining polynomial of the curve and must be given in a MAPLE-readable
+ * format using "x" as first and "y" as second variable, e.g.,
+ * \f$(x^3*y-2*x)*(-6*x-y^3*x^6)\f$ for integer coefficients, and
+ * \f$3/2*x*y^4-5/7*x^2+3/1\f$ for rational coefficients.
+ */
 Curve_2 operator() (std::string s);
 
 /// @}
@@ -122,49 +109,42 @@ Curve_2 operator() (std::string s);
 
 /*!
 
-
-*/
+ */
 class Construct_point_2 {
 public:
 
 /// \name Object Creation Functors
 /// @{
 
-/*!
-Returns a `Point_2` object that represents the `arcno`-th
-point in the fiber of `cv` at \f$ x\f$-coordinate `x`,
-counted from the bottom, starting with zero.
-\pre (`cv` must not have a vertical line at `x`,
-and \f$ 0\leq arcno < c\f$, where \f$ c\f$ is the number of points
-in the fiber of `cv` at `x`.)
-*/
+/*! Returns a `Point_2` object that represents the `arcno`-th
+ * point in the fiber of `cv` at \f$ x\f$-coordinate `x`,
+ * counted from the bottom, starting with zero.
+ * \pre (`cv` must not have a vertical line at `x`,
+ * and \f$ 0\leq arcno < c\f$, where \f$ c\f$ is the number of points
+ * in the fiber of `cv` at `x`.)
+ */
 Point_2 operator() (Algebraic_real_1 x, Curve_2 cv, int arcno);
 
-/*!
-Returns a `Point_2` object that represents the
-point on `xcv` at \f$ x\f$-coordinate `x`
-\pre (`x` is in the \f$ x\f$-range of `xcv`.)
-*/
+/*! Returns a `Point_2` object that represents the
+ * point on `xcv` at \f$ x\f$-coordinate `x`
+ * \pre (`x` is in the \f$ x\f$-range of `xcv`.)
+ */
 Point_2 operator() (Algebraic_real_1 x, X_monotone_curve_2 xcv);
 
-/*!
-Returns a `Point_2` object that represents (x,y)
-*/
+/*! Returns a `Point_2` object that represents (x,y)
+ */
 Point_2 operator() (Algebraic_real_1 x, Algebraic_real_1 y);
 
-/*!
-Returns a `Point_2` object that represents (x,y)
-*/
+/*! Returns a `Point_2` object that represents (x,y)
+ */
 Point_2 operator() (Coefficient x, Coefficient y);
 
-/*!
-Returns a `Point_2` object that represents (x,y)
-*/
+/*! Returns a `Point_2` object that represents (x,y)
+ */
 Point_2 operator() (Bound x, Bound y);
 
-/*!
-Returns a `Point_2` object that represents (x,y)
-*/
+/*! Returns a `Point_2` object that represents (x,y)
+ */
 Point_2 operator() (int x, int y);
 
 /// @}
@@ -173,91 +153,86 @@ Point_2 operator() (int x, int y);
 
 /*!
 
-
-*/
+ */
 class Construct_x_monotone_segment_2 {
 public:
 
 /// \name Object Creation Functors
 /// @{
 
-/*!
-Writes a sequence of `X_monotone_curve_2` objects (terminal
-segments) into `out`. These terminal segments compose an
-\f$ x\f$-monotone (or vertical) segment of the curve `cv` that
-starts in `end_min`, and ends in `end_max`.
-\pre (`end_min` must have a unique \f$ x\f$-monotone segment
-to its right, or `end_max` must have a unique
-\f$ x\f$-monotone segment to its left. Furthermore,
-`end_min` and `end_max` must be connected
-by an \f$ x\f$-monotone segment of `cv`)
-*/
-template<class OutputIterator> OutputIterator
-operator() (Curve_2 cv, Point_2 end_min, Point_2 end_max,
-OutputIterator out);
-
-/*!
-Writes a sequence of `X_monotone_curve_2` objects into `out`.
-These segments form an \f$ x\f$-monotone (or vertical)
-segment of the curve `cv`.
-
-If `site_of_p==POINT_IN_INTERIOR`, the maximal segment is
-returned that contains `p` in its interior.
-
-returned that contains `p` as its left endpoint.
-
-returned that contains `p` as its left endpoint.
-\pre (If `site_of_p==POINT_IN_INTERIOR`, `p`
-must be an interior point of an \f$ x\f$-monotone or a vertical
-segment.
-must either have a unique \f$ x\f$-monotone segment to the right,
-or a vertical segment from `p` upwards.
-must either have a unique \f$ x\f$-monotone segment to the left,
-or a vertical segment from `p` downwards.)
-*/
-template<class OutputIterator> OutputIterator
-operator() (Curve_2 cv, Point_2 p,
-Site_of_point site_of_p,
-OutputIterator out);
-
-/*!
-Writes a sequence of `X_monotone_curve_2` objects into `out`.
-These segments form a straight-line segment connecting
-the points `p` and `q`. If `p` and `q` share the
-same \f$ x\f$-coordinate, the constructed vertical segment consists of
-only one `X_monotone_curve_2` object and can be computed
-efficiently. In the non-vertical case,
-the construction is only possible if `p` and `q`
-have both rational x- and y-coordinates.
-\pre (`p` must not be equal to `q`.)
-
-*/
-template<class OutputIterator> OutputIterator
-operator() (Point_2 p, Point_2 q,
-OutputIterator out);
+/*! inserts a sequence of `X_monotone_curve_2` objects (terminal segments) into
+ * an output container given through an output iterator. These terminal segments
+ * compose an \f$x\f$-monotone (or vertical) segment of a given curve that
+ * starts in `end_min`, and ends in `end_max`.
+ *
+ * \param cv The input curve.
+ * \param end_min The starting point.
+ * \param end_max The ending point.
+ * \param oi The output iterator that points at the output container.
+ * \return The past-the-end iterator of the output container.
+ *
+ * \pre `end_min` must have a unique \f$x\f$-monotone segment to its right, or
+ *      `end_max` must have a unique \f$x\f$-monotone segment to its left.
+ *       Furthermore, `end_min` and `end_max` must be connected by an
+ *       \f$x\f$-monotone segment of `cv`)
+ */
+template <typename OutputIterator>
+OutputIterator operator() (Curve_2 cv, Point_2 end_min, Point_2 end_max,
+                           OutputIterator oi);
+
+/*! inserts a sequence of `X_monotone_curve_2` objects into an output container
+ * given through an output iterator.  These segments form an \f$x\f$-monotone
+ * (or vertical) segment of the curve `cv`.
+ *
+ * If `site_of_p==POINT_IN_INTERIOR`, the maximal segment is
+ * returned that contains `p` in its interior.
+ *
+ * returned that contains `p` as its left endpoint.
+ *
+ * returned that contains `p` as its left endpoint.
+ *
+ * \pre (If `site_of_p==POINT_IN_INTERIOR`, `p`
+ * must be an interior point of an \f$x\f$-monotone or a vertical
+ * segment.
+ * must either have a unique \f$x\f$-monotone segment to the right,
+ * or a vertical segment from `p` upwards.
+ * must either have a unique \f$x\f$-monotone segment to the left,
+ * or a vertical segment from `p` downwards.)
+ */
+template <typename OutputIterator>
+OutputIterator operator() (Curve_2 cv, Point_2 p, Site_of_point site_of_p,
+                           OutputIterator out);
+
+/*! inserts a sequence of `X_monotone_curve_2` objects into an output container
+ * given through an output iterator.  These segments form a straight-line
+ * segment connecting the points `p` and `q`. If `p` and `q` share the same
+ * \f$x\f$-coordinate, the constructed vertical segment consists of only one
+ * `X_monotone_curve_2` object and can be computed efficiently. In the
+ * non-vertical case, the construction is only possible if `p` and `q` have both
+ * rational x- and y-coordinates.
+ *
+ * \pre (`p` must not be equal to `q`.)
+ */
+template <typename OutputIterator>
+OutputIterator operator() (Point_2 p, Point_2 q, OutputIterator out);
 
 /// @}
 
 }; /* end Arr_algebraic_segment_traits_2::Construct_x_monotone_segment_2 */
 
-/*!
-
-
-Models the `ArrangementTraits_2::Curve_2` concept.
-Represents algebraic curves. Internally, the type stores
-topological-geometric information about the particular curve.
-In order to use internal caching, instances should only be created
-using the `Construct_curve_2` functor of the traits class.
-
-*/
+/*! Models the `ArrangementTraits_2::Curve_2` concept.
+ * Represents algebraic curves. Internally, the type stores
+ * topological-geometric information about the particular curve.
+ * In order to use internal caching, instances should only be created
+ * using the `Construct_curve_2` functor of the traits class.
+ */
 class Curve_2 {
 public:
 
 /// \name Modifiers
 /// @{
 
-/*!
-returns the defining polynomial of the curve.
+/*! returns the defining polynomial of the curve.
 */
 Polynomial_2 polynomial () const;
 
@@ -265,124 +240,105 @@ Polynomial_2 polynomial () const;
 
 }; /* end Arr_algebraic_segment_traits_2::Curve_2 */
 
-/*!
-
-
-Models the `ArrangementBasicTraits_2::Point_2` concept.
-Represents points in \f$ \mathbb{R}^2\f$. Intersection points of algebraic curves
-are in general non-rational, so we need a data structure that is capable
-of representing arbitrary points with algebraic coordinates.
-
-The traits class represents algebraic coordinates by the type
-`Algebraic_real_1`, which is a model of the `AlgebraicReal_1`
-concept.
-A point \f$ p\f$ is stored by a triple \f$ (x,cv,arcno)\f$,
-where \f$ x\f$ is the \f$ x\f$-coordinate of a point, \f$ cv\f$ is an instance
-of `Curve_2` that contains the point, (and has no vertical line at \f$ x\f$),
-and \f$ arcno\f$ is an `int`, denoting that \f$ p\f$ is met as the \f$ arcno\f$-th
-point when shooting a vertical ray at \f$ x\f$, starting from \f$ -\infty\f$
-(where counting starts with \f$ 0\f$).
+/*! Models the `ArrangementBasicTraits_2::Point_2` concept.
+ * Represents points in \f$ \mathbb{R}^2\f$. Intersection points of algebraic
+ * curves are in general non-rational, so we need a data structure that is
+ * capable of representing arbitrary points with algebraic coordinates.
+ *
+ * The traits class represents algebraic coordinates by the type
+ * `Algebraic_real_1`, which is a model of the `AlgebraicReal_1` concept.
+ * A point \f$ p\f$ is stored by a triple \f$ (x,cv,arcno)\f$,
+ * where \f$ x\f$ is the \f$ x\f$-coordinate of a point, \f$ cv\f$ is an instance
+ * of `Curve_2` that contains the point, (and has no vertical line at \f$ x\f$),
+ * and \f$ arcno\f$ is an `int`, denoting that \f$ p\f$ is met as the
+ * \f$arcno\f$-th point when shooting a vertical ray at \f$ x\f$, starting from
+ * \f$-\infty\f$ (where counting starts with \f$ 0\f$).
+ *
+ * In addition to the methods listed below, the copy constructor and assignment
+ * operator for `Point_2` objects are also supported.
+ *
+ * The functor `Construct_point_2` constructs `Point_2` instances.
+ */
 
-In addition to the methods listed below, the copy constructor and assignment
-operator for `Point_2` objects are also supported.
-
-The functor `Construct_point_2` constructs `Point_2` instances.
-
-*/
 class Point_2 {
 public:
 
 /// \name Modifiers
 /// @{
 
-/*!
-returns the \f$ x\f$-coordinate of `p`.
-*/
+/*! returns the \f$ x\f$-coordinate of `p`.
+ */
 Algebraic_real_1 x () const;
 
-/*!
-returns the \f$ y\f$-coordinates of `p`.
-
-<B>Attention:</B> As described above, points are not stored
-by their \f$ y\f$-coordinate in `Algebraic_real_1` representation. In fact,
-this representation must be computed on demand, and might become quite
-costly for points defined by high-degree polynomials. Therefore, it is
-recommended to avoid to call this function as much as possible.
-*/
+/*! returns the \f$ y\f$-coordinates of `p`.
+ *
+ * <B>Attention:</B> As described above, points are not stored
+ * by their \f$ y\f$-coordinate in `Algebraic_real_1` representation. In fact,
+ * this representation must be computed on demand, and might become quite
+ * costly for points defined by high-degree polynomials. Therefore, it is
+ * recommended to avoid to call this function as much as possible.
+ */
 Algebraic_real_1 y () const;
 
-/*!
-returns a `Curve_2` instance that `p`is part of.
-*/
+/*! returns a `Curve_2` instance that `p`is part of.
+ */
 Curve_2 curve () const;
 
-/*!
-returns the arc number of `p`.
-*/
+/*! returns the arc number of `p`.
+ */
 int arcno () const;
 
-/*!
-returns double-approximations of the \f$ x\f$- and \f$ y\f$-coordinates.
-*/
+/*! returns double-approximations of the \f$ x\f$- and \f$ y\f$-coordinates.
+ */
 std::pair<double,double> to_double () const;
 
 /// @}
 
 }; /* end Arr_algebraic_segment_traits_2::Point_2 */
 
-/*!
-
-
-Models the `ArrangementBasicTraits_2::X_monotone_curve_2` concept.
-Represents terminal segments of an algebraic curves,
-that means vertical segments or \f$ x\f$-monotone segments with no critical
-\f$ x\f$-coordinate in the interior of their \f$ x\f$-range.
-Terminal segments might either be bounded or unbounded.
-By definition, each interior point of
-a non-vertical segment has the same arc number (see the documentation of
-type `Point_2` above, which is called the <I>arc number</I> of the segment
-(note the arc number at the endpoints might differ).
-Such segments are represented internally by a 4-tuple \f$ (p,q,cv,arcno)\f$,
-where \f$ p\f$ and \f$ q\f$ are the endpoints, \f$ cv\f$ is the <I>supporting curve</I>
-that the segment belongs to, and arcno is the arc number of the segment.
-
-Arbitrary (weakly) \f$ x\f$-monotone segments are presented by a range
-of `X_monotone_curve_2` instances, whose union equals the segment.
-The functor `Construct_x_monotone_segment_2` allows their construction.
-To construct all (maximal) terminal segments of a curve,
-use the `Make_x_monotone_2` functor supplied by the traits class.
-
-*/
+/*! Models the `ArrangementBasicTraits_2::X_monotone_curve_2` concept.
+ * Represents terminal segments of an algebraic curves, that means vertical
+ * segments or \f$ x\f$-monotone segments with no critical \f$ x\f$-coordinate
+ * in the interior of their \f$ x\f$-range.  Terminal segments might either be
+ * bounded or unbounded.  By definition, each interior point of a non-vertical
+ * segment has the same arc number (see the documentation of type `Point_2`
+ * above, which is called the <I>arc number</I> of the segment (note the arc
+ * number at the endpoints might differ).  Such segments are represented
+ * internally by a 4-tuple \f$ (p,q,cv,arcno)\f$, where \f$ p\f$ and \f$ q\f$
+ * are the endpoints, \f$ cv\f$ is the <I>supporting curve</I> that the segment
+ * belongs to, and arcno is the arc number of the segment.
+ *
+ * Arbitrary (weakly) \f$ x\f$-monotone segments are presented by a range
+ * of `X_monotone_curve_2` instances, whose union equals the segment.
+ * The functor `Construct_x_monotone_segment_2` allows their construction.
+ * To construct all (maximal) terminal segments of a curve,
+ * use the `Make_x_monotone_2` functor supplied by the traits class.
+ */
 class X_monotone_curve_2 {
 public:
 
 /// \name Modifiers
 /// @{
 
-/*!
-returns the supporting algebraic curve of `s`.
-*/
+/*! returns the supporting algebraic curve of `s`.
+ */
 Curve_2 curve () const;
 
-/*!
-returns whether `s` is a vertical segment.
-*/
+/*! returns whether `s` is a vertical segment.
+ */
 bool is_vertical () const;
 
-/*!
-returns whether `s` has a finite endpoint on the left
-*/
+/*! returns whether `s` has a finite endpoint on the left
+ */
 bool is_finite (CGAL::Arr_curve_end ce) const;
 
-/*!
-\pre (The corresponding curve end is finite)
-*/
+/*! \pre (The corresponding curve end is finite)
+ */
 Point_2 curve_end (CGAL::Arr_curve_end ce) const;
 
-/*!
-returns the arc number of the segment.
-\pre (The segment is non-vertical)
-*/
+/*! returns the arc number of the segment.
+ * \pre (The segment is non-vertical)
+ */
 int arcno () const;
 
 /*!
@@ -395,8 +351,6 @@ Algebraic_real_1 x () const;
 
 }; /* end Arr_algebraic_segment_traits_2::X_monotone_curve_2 */
 
-
-
-
 }; /* end Arr_algebraic_segment_traits_2 */
+
 } /* end namespace CGAL */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_batched_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_batched_point_location.h
index bafb54b7db7b..d71d0f7faf9b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_batched_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_batched_point_location.h
@@ -1,36 +1,38 @@
 namespace CGAL {
 
-/*!
-\ingroup PkgArrangementOnSurface2PointLocation
-
-Performs a batched point-location operation on a
-given arrangement. It accepts a range of query points, and locates each
-point in the arrangement. The query results are returned through the output
-iterator. Each query result is given as a pair of the query point and an
-object representing the arrangement feature that contains it, namely a
-discriminated union container of the bounded types `Face_const_handle`,
-`Halfedge_const_handle`, and `Vertex_const_hanlde`. The resulting
-pairs in the output sequence are sorted in increasing \f$ xy\f$-lexicographical
-order of the query points. The function returns a past-the-end iterator of
-the output sequence.
-
-\cgalHeading{Requirements}
-
-<UL>
-<LI>`InputIterator::value_type` must be `Arrangement_2::Point_2`.
-<LI>`OutputIterator::value_type` must be convertible to
-`std::pair<Arrangement_2::Point_2, Arr_point_location_result<Arrangement_2>::%Type>`.
-</UL>
-
-\sa `CGAL::Arr_point_location_result<Arrangement>`
-
-*/
-template<typename Traits, typename Dcel,
+/*! \ingroup PkgArrangementOnSurface2PointLocation
+ *
+ * performs a batched point-location operation on a given arrangement. It
+ * accepts a collection of query points, locates each point in a given
+ * arrangement, and inserts the query results into an output container given
+ * through an output iterator. Each query result is given as a pair of the query
+ * point and an object representing the arrangement feature that contains it,
+ * namely a discriminated union container of the types `Face_const_handle`,
+ * `Halfedge_const_handle`, and `Vertex_const_hanlde`. The resulting pairs in
+ * the output container are sorted in increasing \f$xy\f$-lexicographical order
+ * of the query points.
+ *
+ * \param arr The arrangement.
+ * \param begin The begin iterator of the container of input points.
+ * \param end The past-the-end iterator of the container of input points.
+ * \param oi The output iterator that points at the output container.
+ * \return The past-the-end iterator of the output container.
+ *
+ * \cgalHeading{Requirements}
+ *
+ * \pre The value type of `InputIterator` must be convertible to
+ * `Arrangement_2::Point_2`.
+ * \pre Dereferencing `oi` must yield an  object convertible to
+ * `std::pair<Arrangement_2::Point_2, Arr_point_location_result<Arrangement_2>::%Type>`.
+ *
+ * \sa `CGAL::Arr_point_location_result<Arrangement>`
+ *
+ */
+template <typename Traits, typename Dcel,
 typename InputIterator, typename OutputIterator>
-OutputIterator locate (const Arrangement_2<Traits,Dcel>& arr,
-InputIterator points_begin,
-InputIterator points_end,
-OutputIterator oi);
+OutputIterator locate (const Arrangement_2<Traits, Dcel>& arr,
+                       InputIterator begin,
+                       InputIterator end,
+                       OutputIterator oi);
 
 } /* namespace CGAL */
-
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
index d53d7b3bb21a..afe365a3da4e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
@@ -467,20 +467,23 @@ class Arr_conic_traits_2 {
      */
     Approximate_point_2 operator()(const Point_2& p) const;
 
-    /*! Obtain a polyline that approximates an \f$x\f$-monotone curve. The
-     * polyline is defined by a range of approximate points beginning at
-     * `oi`. The type `OutputIterator` must dereference the type
-     * `Approximate_point_2`. The first and last points in the range are always
-     * the endpoints of the given arc `xcv`. The operator returns a
-     * past-the-end iterator of the destination range.
-     * \param oi An output iterator for the resulting polyline.
-     * \param error The error bound of the polyline approximation. This is
-     *              the Hausdorff distance between the arc and the polyline
-     *              that approximates the arc.
+    /*! approximates a given \f$x\f$-monotone curve. It computes a sequence of
+     * approximate points that represent an approximate polyline, and inserts
+     * them into an output container given through an output iterator.  The
+     * first and last points in the sequence are always approximations of the
+     * endpoints of the given arc.
+     *
+     * \param oi An output iterator for the output container.
+     * \param error The error bound of the polyline approximation. This is the
+     *        Hausdorff distance between the arc and the polyline that
+     *        approximates the arc.
      * \param xcv The exact \f$x\f$-monotone arc.
      * \param l2r A Boolean flag that indicates whether the arc direction is
-     *            left to right.
-     * \return The past-the-end iterator of the output iterator.
+     *        left to right.
+     * \return The past-the-end iterator of the output container.
+     *
+     * \pre Dereferencing `oi` must yield an object of type
+     *      `Arr_conic_traits_2::Approximate_point_2`.
      */
     template <typename OutputIterator>
     OutputIterator operator()(OutputIterator oi, double error,
@@ -521,7 +524,7 @@ class Arr_conic_traits_2 {
   Trim_2 trim_2_object() const;
 
   /*! Obtain an `Approximate_2` functor. */
-  Trim_2 approximate_2_object() const;
+  Approximate_2 approximate_2_object() const;
 
   /// @}
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
index 2a48e35b399b..0456c4e06f8c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_point_location_result.h
@@ -1,27 +1,28 @@
 namespace CGAL {
 
-/*!
-\ingroup PkgArrangementOnSurface2PointLocation
-
-A unary metafunction to determine the return type of a point-location
-or vertical ray-shoot query.
-
-\tparam Arrangement must be an instance of the `CGAL::Arrangement_2<Traits,Dcel>` class template.
-
-\sa `ArrangementPointLocation_2`
-\sa `ArrangementVerticalRayShoot_2`
-\sa `CGAL::Arr_naive_point_location<Arrangement>`
-\sa `CGAL::Arr_walk_along_line_point_location<Arrangement>`
-\sa `CGAL::Arr_landmarks_point_location<Arrangement,Generator>`
-\sa `CGAL::Arr_trapezoid_ric_point_location<Arrangement>`
-*/
-template <class Arrangement>
+/*! \ingroup PkgArrangementOnSurface2PointLocation
+ *
+ * A unary metafunction to determine the return type of a point-location or
+ * vertical ray-shoot query.
+ *
+ * \tparam Arrangement must be an instance of the
+ * `CGAL::Arrangement_on_surface_2<GeometryTraits,Topology>` class template.
+ *
+ * \sa `ArrangementPointLocation_2`
+ * \sa `ArrangementVerticalRayShoot_2`
+ * \sa `CGAL::Arr_naive_point_location<Arrangement>`
+ * \sa `CGAL::Arr_walk_along_line_point_location<Arrangement>`
+ * \sa `CGAL::Arr_landmarks_point_location<Arrangement,Generator>`
+ * \sa `CGAL::Arr_trapezoid_ric_point_location<Arrangement>`
+ */
+template <typename Arrangement>
 struct Arr_point_location_result
 {
   /*! The type of the arrangement feature that is the result of a
    * point-location query or a vertical ray-shoot query, namely,
-   * `std::variant<Arrangement::Vertex_const_handle, Arrangement::Halfedge_const_handle, Arrangement::Face_const_handle>`
+   * `std::variant<Arrangement_on_surface_2::Vertex_const_handle, Arrangement_on_surface_2::Halfedge_const_handle, Arrangement_on_surface_2::Face_const_handle>`
    */
   typedef unspecified_type Type;
 }; /* end Arr_point_location_result */
+
 } /* end namespace CGAL */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polycurve_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polycurve_traits_2.h
index a1bb1b331d12..e5b8be8d93c7 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polycurve_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_polycurve_traits_2.h
@@ -238,17 +238,22 @@ namespace CGAL {
                                     const Point_2& tgt) const;
     };
 
-    /*! Subdivide a given subcurve into x-monotone subcurves and insert them
-     * into a given output iterator.
+    /*! Subdivide a given subcurve into \f$x\f$-monotone subcurves and
+     * isolated points, and insert them into an output container. An object in
+     * the output container is represented by a discriminated union container
+     * that holds either a point or an \f$x\f$-monotone curve.
      */
     class Make_x_monotone_2 {
     public:
-      /*!
-      * \pre if `cv` is not empty then it must be continuous and well-oriented.
+      /*! performs the subdivision.
+       *
       * \param cv the subcurve.
-      * \param oi an output iterator for the result. Its value type is a variant
-      *           that wraps Point_2 or an X_monotone_curve_2 objects.
-      * \return the past-the-end iterator.
+      * \param oi The output iterator that points at the output container.
+      * \return the past-the-end iterator of the output container.
+      *
+      * \pre if `cv` is not empty, then it must be continuous and well-oriented.
+      * \pre Dereferencing `oi` must yield a polymorphic object of type
+      * `std::variant<`\link Arr_polycurve_traits_2::Point_2 `Point_2` \endlink, `X_monotone_curve_2>`.
       */
       template <typename OutputIterator>
       OutputIterator operator()(const Curve_2& cv, OutputIterator oi) const;
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h
index 7a39bd94d777..38c0403f9fd6 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h
@@ -2,51 +2,53 @@ namespace CGAL {
 
 /*! \ingroup PkgArrangementOnSurface2Funcs
  *
- * Produces the symbolic vertical decomposition of a given arrangement,
- * performing a batched vertical ray-shooting query from all arrangement
- * vertices, such that every vertex is associated with a pair of objects, one
- * corresponds to the arrangement feature that lies below it, and the other
- * corresponds to the feature that lies above it.  The output of this function
- * can be readily used for inserting vertical walls and physically decomposing
- * the arrangement into pseudo-trapezoids. To do this, it is convenient to
- * process the vertices in an ascending \f$ xy\f$-lexicographic order. The
- * visible objects are therefore returned through an output iterator, which
- * pairs each finite arrangement vertex with the two features it "sees", such
- * that the vertices are given in ascending \f$ xy\f$-lexicographic order.
+ * produces the symbolic vertical decomposition of a given arrangement. More
+ * precisely, this function performs a batched vertical ray-shooting query from
+ * every arrangement vertex, and pairs each vertex with a pair of polymorphic
+ * objects, one corresponds to the arrangement feature that lies below it, and
+ * the other corresponds to the feature that lies above it.
  *
- * Produces the symbolic vertical decomposition of the `arr` arrangement.  More
- * precisely, it performs a batched vertical ray-shooting query from all
- * arrangement vertices, such that every vertex is associated with a pair of
- * objects, one corresponding to the arrangement feature that lies below it,
- * while the other corresponds to the feature that lies above it.  The query
- * results are returned through the output iterator, which pairs each finite
- * arrangement vertex with a pair of objects, the first represents the feature
- * below the vertex, and the second represents the feature that lies above
- * it. Each object is an optional variant that wraps a handle to an arrangement
- * feature. If the vertex is the top end-vertex of a vertical edge, we say that
+ * The finite arrangement vertices and the features they "see", if exist,
+ * that are, the query results, are inserted in ascending \f$xy\f$-lexicographic
+ * order (of the query vertex) into an output container given through an output
+ * iterator. If the vertex is the top end-vertex of a vertical edge, we say that
  * there is no feature below it; similarly, if it is the bottom end-vertex of a
- * vertical edge, we say that there is no feature above it. In these cases the
- * optional object is set to be empty; otherwise it is set as follows:
+ * vertical edge, we say that there is no feature above it.  Each feature, if
+ * exists, is represented by a discriminated union container that holds an
+ * object of one of the following types:
+ *
  * <UL>
- * <LI>`Halfedge_const_handle`, if the vertex is located above (or below) an
- * edge. The given halfedge is always directed from right to left.  In case
- * there is no concrete edge below (or above) the vertex, and the arrangement
- * is unbounded, then the object returned is a <I>fictitious</I> halfedge.
- * <LI>`Face_const_handle`, in case there is no edge below (or above)
- * the vertex, and the arrangement is bounded.
- * <LI>`Vertex_const_handle`, in case the vertex is located vertically above
- * (or below) another arrangement vertex.
- * </UL> The function returns a past-the-end iterator for its output sequence.
+ * <LI> `Arrangement_on_surface_2::Halfedge_const_handle`, if the vertex is
+ *      located above (or below) an edge. The given halfedge is always directed
+ *      from right to left.  In case there is no concrete edge below (or above)
+ *      the vertex, and the arrangement is unbounded, then the object returned
+ *      is a <I>fictitious</I> halfedge.
+ * <LI> `Arrangement_on_surface_2::Face_const_handle`, in case there is no edge
+ *      below (or above) the vertex, and the arrangement is bounded.
+ * <LI> `Arrangement_on_surface_2::Vertex_const_handle`, in case the vertex is
+ *      located vertically above (or below) another arrangement vertex.
+ * </UL>
  *
- * \cgalHeading{Requirements}
+ * The output of this function can be readily used for inserting vertical walls
+ * and physically decomposing the arrangement into pseudo-trapezoids.
  *
- * `OutputIterator::value_type` must be
- * `pair<Arrangement_2::Vertex_const_handle, pair<Object, Object> >`.
+ * \param arr The arrangement.
+ * \param oi The output iterator that points at the output container.
+ * \return The past-the-end iterator of the output container.
+ *
+ * \cgalHeading{Requirements}
  *
+ * \pre Dereferencing `oi` must yield an object of type
+ * `std::pair<Arrangement_on_surface_2::Vertex_const_handle,
+ *            std::pair<std::optional<Type,std::optional<Type>>>,
+ * where `Type` is
+ * `std::variant<Arrangement_on_surface_2::Vertex_const_handle,
+ *               Arrangement_on_surface_2::Halfedge_const_handle,
+ *               Arrangement_on_surface_2::Face_const_handle>`.
  */
-template<typename Traits, typename Dcel,
-typename OutputIterator>
-OutputIterator decompose (const Arrangement_2<Traits,Dcel>& arr,
-OutputIterator oi);
+template <typename Traits, typename TopologyTraits, typename OutputIterator>
+OutputIterator
+decompose(const Arrangement_on_surface_2<GeometryTraits,TopologyTraits>& arr,
+          OutputIterator oi);
 
 } /* namespace CGAL */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_2.h
index a269c6e01842..465f1f3a9b20 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_2.h
@@ -379,37 +379,4 @@ template <typename Traits, typename Dcel>
 bool remove_vertex(Arrangement_2<Traits,Dcel>& arr,
                    typename Arrangement_2<Traits,Dcel>::Vertex_handle v);
 
-/*! \ingroup PkgArrangementOnSurface2Funcs
- *
- * Compute the zone of the given \f$ x\f$-monotone curve in the existing
- * arrangement. Meaning, it output the arrangement's vertices, edges and faces
- * that the \f$ x\f$-monotone curve intersects. The order of the objects is the
- * order that they are discovered when traversing the \f$ x\f$-monotone curve
- * from left to right.
- *
- * A given point-location object is used for answering point-location queries
- * during the insertion process. By default, the function uses the "walk along
- * line" point-location strategy - namely an instance of the class
- * `Arr_walk_along_line_point_location<Arrangement_2<Traits,Dcel> >`.
- *
- * Compute the zone of the given \f$ x\f$-monotone curve `c` in the arrangement
- * `arr`.
- *
- * \pre If provided, `pl` must be attached to the given arrangement `arr`.
- *
- * \cgalHeading{Requirements}
- *
- * <UL>
- * <LI>The instantiated `GeomTraits` class must model the
- * `ArrangementXMonotoneTraits_2` concept.
- * <LI>The point-location object `pl`, must model the
- * `ArrangementPointLocation_2` concept.
- * </UL>
- */
-template <typename Traits, typename Dcel,
-          typename OutputIterator, typename PointLocation>
-OutputIterator zone(Arrangement_2<Traits, Dcel>& arr,
-                    const typename Traits::X_monotone_curve_2& c,
-                    OutputIterator oi, const PointLocation& pl);
-
 } /* namespace CGAL */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
index 2c0d60278730..48485644adeb 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
@@ -1294,38 +1294,45 @@ bool remove_vertex
 
 /*! \ingroup PkgArrangementOnSurface2Funcs
  *
- * Compute the zone of the given \f$ x\f$-monotone curve in the existing
- * arrangement. Meaning, it output the arrangement's vertices, edges and faces
- * that the \f$ x\f$-monotone curve intersects. The order of the objects is the
- * order that they are discovered when traversing the \f$ x\f$-monotone curve
- * from left to right.
+ * computes the zone of the given \f$x\f$-monotone curve in a given
+ * arrangement. More precisely, this function finds the arrangement vertices,
+ * edges ,and faces that the given \f$x\f$-monotone curve intersects, and
+ * inserts them in the order they are discovered when traversing the
+ * \f$x\f$-monotone curve from left to right into an output contaiuner given
+ * through an output iterator. An object in the resulting zone is represented by
+ * a discriminated union container that holds a vertex handle, halfedge handle,
+ * or a face handle.
  *
  * A given point-location object is used for answering point-location queries
  * during the insertion process. By default, the function uses the "walk along
- * line" point-location strategy - namely an instance of the class
+ * line" point-location strategy, namely, an instance of the class
  * `Arr_walk_along_line_point_location<Arrangement_on_surface_2<GeometryTraits,
- * TopologyTraits> >`.
+ * TopologyTraits>>`.
  *
- * Compute the zone of the given \f$ x\f$-monotone curve `c` in the arrangement
- * `arr`.
+ * \param arr The given arrangement.
+ * \param c The \f$x\f$-monotone curve.
+ * \param oi The output iterator that points at the output container.
+ * \param pl The point-location object.
+ * \return The past-the-end iterator of the output container.
  *
  * \pre If provided, `pl` must be attached to the given arrangement `arr`.
+ * \pre The instantiated `GeometryTraits` class must model the
+ *      `ArrangementXMonotoneTraits_2` concept.
+ * \pre The point-location object `pl`, must model the
+ *      `ArrangementPointLocation_2` concept.
+ * \pre Dereferencing `oi` must yield a polymorphic object of type
+ *      `std::variant<Arrangement_on_surface_2::Vertex_handle,
+ *                    Arrangement_on_surface_2::Halfedge_handle,
+ *                    Arrangement_on_surface_2::Face_handle>`.
  *
  * \cgalHeading{Requirements}
- *
- * <UL>
- * <LI>The instantiated `GeometryTraits` class must model the
- * `ArrangementXMonotoneTraits_2` concept.
- * <LI>The point-location object `pl`, must model the
- * `ArrangementPointLocation_2` concept.
- * </UL>
  */
 template <typename GeometryTraits, typename TopologyTraits,
           typename OutputIterator, typename PointLocation>
-OutputIterator zone
-(Arrangement_on_surface_2<GeometryTraits, TopologyTraits>& arr,
- const typename GeometryTraits::X_monotone_curve_2& c,
- OutputIterator oi,
- const PointLocation& pl);
+OutputIterator
+zone(Arrangement_on_surface_2<GeometryTraits, TopologyTraits>& arr,
+     const typename GeometryTraits::X_monotone_curve_2& c,
+     OutputIterator oi,
+     const PointLocation& pl);
 
 } /* namespace CGAL */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/CORE_algebraic_number_traits.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/CORE_algebraic_number_traits.h
index 4b40d11fd1d7..b48ef555575a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/CORE_algebraic_number_traits.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/CORE_algebraic_number_traits.h
@@ -29,88 +29,102 @@ class CORE_algebraic_number_traits {
   /// \name Utility Functions
   /// @{
 
-  /*! Obtain the numerator of a rational number.
-   * \param q A rational number.
-   * \return The numerator of q.
+  /*! obtains the numerator of a rational number.
+   *
+   * \param q The rational number.
+   * \return The numerator of `q`.
    */
   Integer numerator(const Rational& q) const;
 
-  /*! Obtain the denominator of a rational number.
-   * \param q A rational number.
-   * \return The denominator of q.
+  /*! obtains the denominator of a rational number.
+   *
+   * \param q The rational number.
+   * \return The denominator of `q`.
    */
   Integer denominator(const Rational& q) const;
 
-  /*! Convert an integer to an algebraic number.
-   * \param z An integer.
-   * \return The algebraic number equivalent to z.
+  /*! converts an integer to an algebraic number.
+   *
+   * \param z The integer.
+   * \return The algebraic number equivalent to `z`.
    */
   Algebraic convert(const Integer& z) const;
 
-  /*! Convert a rational number to an algebraic number.
+  /*! converts a rational number to an algebraic number.
+   *
    * \param q A rational number.
-   * \return The algebraic number equivalent to q.
+   * \return The algebraic number equivalent to `q`.
    */
   Algebraic convert(const Rational& q) const;
 
-  /*! Construct a rational number that lies strictly between two algebraic
+  /*! constructs a rational number that lies strictly between two algebraic
    * values.
+   *
    * \param x1 The first algebraic value.
    * \param x2 The second algebraic value.
    * \pre The two values are not equal.
-   * \return A rational number that lies in the open interval (x1, x2).
+   * \return The rational number that lies in the open interval (`x1`, `x2`).
    */
   Rational rational_in_interval(const Algebraic& x1, const Algebraic& x2) const;
 
-  /*! Obtain a range of double-precision floats that contains the given
+  /*! obtains a range of double-precision floats that contains the given
    * algebraic number.
+   *
    * \param x The given number.
-   * \return A pair <x_lo, x_hi> that contain x.
+   * \return The range of double-precision floats that contain `x`.
    */
   std::pair<double, double> double_interval(const Algebraic& x) const;
 
-  /*! Convert a sequence of rational coefficients to an equivalent sequence
-   * of integer coefficients. If the input coefficients are q(1), ..., q(k),
-   * where q(i) = n(i)/d(i) then the output coefficients will be of the
-   * form:
-   *               n(i) * lcm {d(1), ... , d(k)}
-   *       a(i) = -------------------------------
-   *               d(i) * gcd {n(1), ... , n(k)}
-   *
-   * \param q_begin The begin iterator of the rational sequence.
-   * \param q_end The past-the-end iterator of the rational sequence.
-   * \param zoi An output iterator for the integer coefficients.
-   * \return A past-the-end iterator for the output container.
-   * \pre The value type of q_begin and q_end is `Rational`, and
-   *      the value type of zoi is `Integer`.
+  /*! converts a sequence of rational coefficients to an equivalent sequence
+   * of integer coefficients. If the input coefficients are
+   * \f$q(1),\ldots,q(k)\f$, where \f$q(i) = n(i)/d(i)\f$, then the output
+   * coefficients will be of the form:
+   * \f$a(i) = \frac{n(i) \cdot \mathrm{lcm}(d(1),\ldots,d(k))}{d(i) \cdot \mathrm{gcd}(n(1),\ldots, n(k))}\f$.
+   * It inserts the output sequence into an output container given through an
+   * output iterator.
+   *
+   * \param begin The begin iterator of the rational coefficients input
+   *        container.
+   * \param end The past-the-end iterator of the rational coefficients input
+   *        container.
+   * \param oi The output iterator of the integer coefficients output container.
+   * \return The past-the-end iterator of the output container.
+   *
+   * \pre The value type of `InputIterator` is `Rational`.
+   * \pre Dereferencing `oi` must yield an object convertible to `Integer`.
    */
   template <typename InputIterator, typename OutputIterator>
-  OutputIterator convert_coefficients(InputIterator q_begin,
-                                      InputIterator q_end,
-                                      OutputIterator zoi) const;
+  OutputIterator convert_coefficients(InputIterator begin,
+                                      InputIterator end,
+                                      OutputIterator oi) const;
 
-  /*! Compute the square root of an algebraic number.
+  /*! computes the square root of an algebraic number.
+   *
    * \param x The number.
-   * \return The square root of x.
-   * \pre x is non-negative.
+   * \return The square root of `x`.
+   * \pre `x` is non-negative.
    */
   Algebraic sqrt(const Algebraic& x) const;
 
-  /*! Compute the roots of a quadratic equations \f$a*x^2+ b*x + c = 0\f$
-   * with integer coefficients.
+  /*! computes the roots of a quadratic equations \f$a*x^2+ b*x + c = 0\f$
+   * with integer coefficients, and inserts them into an output container given
+   * through an output iterator.
+   *
    * \param a The coefficient of \f$x^2\f$
    * \param b The coefficient of \f$x\f$
    * \param c The free term.
-   * \param oi An output iterator for the real-valued solutions of the
-   *           quadratic equation.
-   * \return A past-the-end iterator for the output container.
-   * \pre The value type of oi is Algebraic.
+   * \param oi The output iterator of the output container of real-valued
+   *        solutions of the quadratic equation.
+   * \return The past-the-end iterator of the output container.
+   *
+   * \pre Dereferencing `oi` must yield an object convertible to `Algebraic`.
    */
   template <typename NT, typename OutputIterator>
   OutputIterator solve_quadratic_equation(const NT& a, const NT& b, const NT& c,
                                           OutputIterator oi) const;
 
-  /*! Construct a polynomial with integer coefficients.
+  /*! constructs a polynomial with integer coefficients.
+   *
    * \param coeffs The coefficients of the input polynomial.
    * \param degree The degree of the input polynomial.
    * \return The polynomial.
@@ -118,8 +132,9 @@ class CORE_algebraic_number_traits {
   Polynomial construct_polynomial(const Integer* coeffs,
                                   unsigned int degree) const;
 
-  /*! Construct a polynomial with integer coefficients given rational
+  /*! constructs a polynomial with integer coefficients given rational
    * coefficients.
+   *
    * \param coeffs The coefficients of the input polynomial.
    * \param degree The degree of the input polynomial.
    * \param poly Output: The resulting polynomial with integer coefficients.
@@ -131,10 +146,11 @@ class CORE_algebraic_number_traits {
                             unsigned int degree,
                             Polynomial& poly, Integer& poly_denom) const;
 
-  /*! Construct two polynomials with integer coefficients such that P(x)/Q(x)
-   * is a rational function equivalent to the one represented by the two
-   * given vectors of rational coefficients. It is guaranteed that the GCD
-   * of P(x) and Q(x) is trivial.
+  /*! constructs two polynomials with integer coefficients such that
+   * \f$P(x)/Q(x)\f$ is a rational function equivalent to the one represented
+   * by the two given vectors of rational coefficients. It is guaranteed that
+   * the GCD of \f$P(x)\f$ and \f$Q(x)\f$ is trivial.
+   *
    * \param p_coeffs The coefficients of the input numerator polynomial.
    * \param p_degree The degree of the input numerator polynomial.
    * \param q_coeffs The coefficients of the input denominator polynomial.
@@ -143,7 +159,7 @@ class CORE_algebraic_number_traits {
    *                       coefficients.
    * \param q_poly Output: The resulting denominator polynomial with integer
    *                       coefficients.
-   * \return (true) on success; (false) if the denominator is 0.
+   * \return `true` on success; `false` if the denominator is 0.
    */
   bool construct_polynomials(const Rational* p_coeffs,
                              unsigned int p_degree,
@@ -155,58 +171,70 @@ class CORE_algebraic_number_traits {
    */
   int degree(const Polynomial& poly) const;
 
-  /*! Evaluate a polynomial at a given x-value.
-   * \param poly A polynomial.
+  /*! evaluates a polynomial at a given \f$x\f$-value.
+   *
+   * \param poly The polynomial.
    * \param x The value to evaluate at.
-   * \return The value of the polynomial at x.
+   * \return The value of the polynomial at `x`.
    */
   template <typename NT>
   NT evaluate_at(const Polynomial& poly, NT& x) const;
 
-  /*! Compute the derivative of the given polynomial.
-   * \param poly The polynomial p(x).
-   * \return The derivative p'(x).
+  /*! computes the derivative of the given polynomial.
+   *
+   * \param poly The polynomial \f$p(x)\f$.
+   * \return The derivative \f$p'(x)\f$.
    */
   Polynomial derive(const Polynomial& poly) const;
 
-  /*! Multiply a polynomial by some scalar coefficient.
-   * \param poly The polynomial P(x).
+  /*! multiplies a polynomial by some scalar coefficient.
+   *
+   * \param poly The polynomial \f$P(x)\f$.
    * \param a The scalar value.
-   * \return The scalar multiplication a*P(x).
+   * \return The scalar multiplication \f$a \cdot P(x)\f$.
    */
   Polynomial scale(const Polynomial& poly, const Integer& a) const;
 
-  /*! Perform "long division" of two polynomials: Given A(x) and B(x) compute
-   * two polynomials Q(x) and R(x) such that: A(x) = Q(x)*B(x) + R(x) and
-   * R(x) has minimal degree.
-   * \param polyA The first polynomial A(x).
-   * \param polyB The second polynomial A(x).
-   * \param rem Output: The remainder polynomial R(x).
-   * \return The quontient polynomial Q(x).
+  /*! performs "long division" of two polynomials: Given \f$A(x)\f$ and
+   * \f$B(x)\f$ compute two polynomials \f$Q(x)\f$ and \f$R(x)\f$ such that:
+   * \f$A(x) = Q(x) \cdot B(x) + R(x)\f$ and \f$R(x)\f$ has minimal degree.
+   *
+   * \param poly_a The first polynomial \f$A(x)\f$.
+   * \param poly_b The second polynomial \f$A(x)\f$.
+   * \param rem Output: The remainder polynomial \f$R(x)\f$.
+   * \return The quontient polynomial \f$Q(x)\f$.
    */
-  Polynomial divide(const Polynomial& polyA,
-                    const Polynomial& polyB,
+  Polynomial divide(const Polynomial& poly_a,
+                    const Polynomial& poly_b,
                     Polynomial& rem) const;
 
-  /*! Compute the real-valued roots of a polynomial with integer coefficients,
-   * sorted in ascending order.
+  /*! computes the real-valued roots of a polynomial with integer coefficients,
+   * and inserts them in ascending order into an output container given through
+   * an output iterator.
+   *
    * \param poly The input polynomial.
-   * \param oi An output iterator for the real-valued root of the polynomial.
-   * \return A past-the-end iterator for the output container.
-   * \pre The value type of oi is Algebraic.
+   * \param oi The output iterator of the output container of real-valued root
+   *        of the polynomial.
+   * \return The past-the-end iterator of the output container.
+   *
+   * \pre Dereferencing `oi` must yield an object convertible to `Algebraic`.
    */
   template <typename OutputIterator>
   OutputIterator compute_polynomial_roots(const Polynomial& poly,
                                           OutputIterator oi) const;
 
-  /*! Compute the real-valued roots of a polynomial with integer coefficients,
-   * within a given interval. The roots are sorted in ascending order.
+  /*! computes the real-valued roots of a polynomial with integer coefficients
+   * within a given interval, and inserts them in ascending order into an output
+   * container given through an output iterator.
+   *
    * \param poly The input polynomial.
    * \param x_min The left bound of the interval.
    * \param x_max The right bound of the interval.
-   * \param oi An output iterator for the real-valued root of the polynomial.
-   * \return A past-the-end iterator for the output container.
-   * \pre The value type of oi is Algebraic.
+   * \param oi The output iterator of the output container of the real-valued
+   *        root of the polynomial.
+   * \return The past-the-end iterator of the output container.
+   *
+   * \pre Dereferencing `oi` must yield an object convertible to `Algebraic`.
    */
   template <typename OutputIterator>
   OutputIterator compute_polynomial_roots(const Polynomial& poly,
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
index 7f0c1a50fcd5..f13a26422e92 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--Intersect_2.h
@@ -16,26 +16,33 @@ class Intersect_2 {
   /// A model of this concept must provide:
   /// @{
 
-  /*! computes the intersections of `xc1` and `xc2` and writes them <I>in an
-   * ascending lexicographic \f$xy\f$-order</I> into a range beginning at
-   * `oi`. The type `OutputIterator` must dereference a polymorphic object of
-   * type `std::variant` that wraps objects of type either type
-   * `pair<ArrTraits::Point_2, ArrTraits::Multiplicity>` or
-   * `ArrTraits::X_monotone_curve_2`. An object of the former type represents an
-   * intersection point with its multiplicity (in case the multiplicity is
-   * undefined or unknown, it should be set to \f$0\f$). An object of the latter
-   * type represents an overlapping subcurve of `xc1` and `xc2`. The operator
-   * returns a past-the-end iterator of the destination range.
+  /*! computes the intersections of two \f$x\f$-monotone curves and inserts the
+   * result in ascending \f$xy\f$-lexicographic order into an output container
+   * given through an output iterator. An intersection, if exists, is
+   * represented by a discriminated union container that holds either an
+   * intersection point along with its multiplicity or an overlapping
+   * \f$x\f$-monotone subcurve. If the multiplicity is undefined or unknown, it
+   * should be set to \f$0\f$.
    *
-   * A special case may occur when the parameter space of the surface, the
-   * arrangement is embedded on, is identified on the left and right sides of
-   * the boundary. An intersection point that lies on the identification curve,
+   * \param xc1 The first \f$x\f$-monotone curve.
+   * \param xc2 The second \f$x\f$-monotone curve.
+   * \param oi The output iterator that points at the output container.
+   * \return The past-the-end iterator of the output container.
+   *
+   * A special case may occur when the left and right sides of the boundary of
+   * the parameter space of the surface, the arrangement is embedded on, are
+   * identified. An intersection point that lies on the identification curve,
    * between two \f$x\f$-monotone curves that intersect at their left and right
    * ends must be ignored.  Consider two \f$x\f$-monotone curves that intersect
    * at their left and right ends, respectively, at a point \f$p\f$ that lies on
    * the identification curve. If, for example, the number of intersections
    * between these two curves is greater than 1, the order of intersections is
-   * non-deterministic.
+   * nondeterministic.
+   *
+   * \pre Dereferencing `oi` must yield an object of type
+   * `std::optional<std::variant<std::pair<%Point_2,ArrangementXMonotoneTraits_2::Multiplicity,X_monotone_curve_2>>`,
+   * where `%Point_2` is a model of `ArrTraits::Point_2` and
+   * `X_monotone_curve_2` is a model of `ArrTraits::XMonotoneCurve_2`.
    */
   template <typename OutputIterator>
   OutputIterator operator()(ArrTraits::X_monotone_curve_2 xc1,
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
index 3f125aea2f65..a86290bd333d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrTraits--MakeXMonotone_2.h
@@ -15,12 +15,20 @@ class MakeXMonotone_2 {
   /// A model of this concept must provide:
   /// @{
 
-  /*! subdivides the input curve `c` into \f$x\f$-monotone subcurves and
-   * isolated points, and inserts the results into a range beginning at the given
-   * output iterator `oi`. The type `OutputIterator` dereferences a
-   * `std::variant` that wraps either an `ArrTraits::Point_2` object or an
-   * `ArrTraits::X_monotone_curve_2` object. The operator returns a past-the-end
-   * iterator for the output sequence.
+  /*! subdivides an input curve into \f$x\f$-monotone subcurves and isolated
+   * points, and inserts the results into an output container given through an
+   * output iterator. An object in the output container is represented by a
+   * discriminated union container that holds either a point or an
+   * \f$x\f$-monotone curve.
+   *
+   * \param c The input curve.
+   * \param oi The output iterator that points at the output container.
+   * \return The past-the-end iterator of the output container.
+   *
+   * \pre Dereferencing `oi` must yield a polymorphic object of type
+   * `std::variant<%Point_2, X_monotone_curve_2>`, where `%Point_2` is a model
+   * of `ArrTraits::Point_2` and `X_monotone_curve_2` is a model of
+   * `ArrTraits::XMonotoneCurve_2`.
    */
   template <typename OutputIterator>
   OutputIterator operator()(ArrTraits::Curve_2 c, OutputIterator oi);
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/batched_point_location.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/batched_point_location.cpp
index 6d42fb6ca5f6..f2cbc29815d4 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/batched_point_location.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/batched_point_location.cpp
@@ -23,7 +23,7 @@ int main() {
     Point(1, 4), Point(4, 3), Point(6, 3), Point(3, 2), Point(5, 2), Point(1, 0)
   };
   std::list<Query_result> results;
-  locate(arr, points.begin(), points.end(), std::back_inserter(results));
+  CGAL::locate(arr, points.begin(), points.end(), std::back_inserter(results));
 
   // Print the results.
   for (auto it = results.begin(); it != results.end(); ++it)

From c66218bf8512568ed7eca8d7b46da9442f6d9218 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 19 Sep 2023 13:42:40 +0300
Subject: [PATCH 0741/1398] Fixed typo

---
 .../CGAL/Arr_vertical_decomposition_2.h                         | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h
index 38c0403f9fd6..09f2ad4e5d21 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h
@@ -40,7 +40,7 @@ namespace CGAL {
  *
  * \pre Dereferencing `oi` must yield an object of type
  * `std::pair<Arrangement_on_surface_2::Vertex_const_handle,
- *            std::pair<std::optional<Type,std::optional<Type>>>,
+ *            std::pair<std::optional<Type,std::optional<Type>>>`,
  * where `Type` is
  * `std::variant<Arrangement_on_surface_2::Vertex_const_handle,
  *               Arrangement_on_surface_2::Halfedge_const_handle,

From fe68498e9521ca4e1cc52ea10ac64024569ce35c Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Tue, 19 Sep 2023 14:59:11 +0200
Subject: [PATCH 0742/1398] CGALConfig.cmake remove the early return()

Otherwise we have a lot of warnings like:
```
CMake Warning at /usr/lib64/cmake/Qt6/QtPublicWalkLibsHelpers.cmake:284 (message):
  When trying to collect dependencies of target
  'Constrained_Delaunay_triangulation_2', the non-existent target 'Qt6::Svg'
  was encountered.  This can likely be fixed by moving the find_package call
  that pulls in 'Qt6::Svg' to the scope of directory
  '/home/lrineau/Git/cgal-testsuite-dockerfiles/testsuite/CGAL-6.0-Ic-66/test/Triangulation_2_Demo'
  or higher.  This warning can be silenced by setting
  QT_SILENCE_MISSING_DEPENDENCY_TARGET_WARNING to ON.
Call Stack (most recent call first):
  /usr/lib64/cmake/Qt6/QtPublicWalkLibsHelpers.cmake:320 (__qt_internal_print_missing_dependency_target_warning)
  /usr/lib64/cmake/Qt6Core/Qt6CoreMacros.cmake:609 (__qt_internal_collect_all_target_dependencies)
  /usr/lib64/cmake/Qt6Core/Qt6CoreMacros.cmake:709 (_qt_internal_finalize_executable)
  /usr/lib64/cmake/Qt6Core/Qt6CoreMacros.cmake:564:EVAL:1 (qt6_finalize_target)
  test/Triangulation_2_Demo/CMakeLists.txt:DEFERRED
```

The issue was that `find_package(Qt6) ...` is required in any
sub-directory, because imported targets like `Qt6::Svg` are
local to the directory scope.
---
 Installation/lib/cmake/CGAL/CGALConfig.cmake | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/Installation/lib/cmake/CGAL/CGALConfig.cmake b/Installation/lib/cmake/CGAL/CGALConfig.cmake
index 7b3f2c419cb4..93e9e8830f0a 100644
--- a/Installation/lib/cmake/CGAL/CGALConfig.cmake
+++ b/Installation/lib/cmake/CGAL/CGALConfig.cmake
@@ -146,11 +146,6 @@ foreach(cgal_lib ${CGAL_LIBRARIES})
     set(CGALConfig_all_targets_are_defined FALSE)
   endif()
 endforeach()
-if(CGALConfig_all_targets_are_defined)
-  return()
-endif()
-
-message(STATUS "Using header-only CGAL")
 
 if(NOT CGAL_FOUND)
   return()

From 0ffb2563519e010abec22682b05ca71ae27f28c5 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Tue, 19 Sep 2023 15:11:55 +0200
Subject: [PATCH 0743/1398] fix the workflow demo.yml

The four batches were wrong: they all compiled all the plugins, instead
of only a fourth of them.
---
 .github/test.sh | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

diff --git a/.github/test.sh b/.github/test.sh
index a744f6d5b08a..cf69ebee9552 100755
--- a/.github/test.sh
+++ b/.github/test.sh
@@ -3,11 +3,10 @@
 FACTOR=$1
 set -ex
 cd Polyhedron/demo
-LIST_OF_PLUGINS=$(/usr/local/bin/cmake --build . -t help | egrep 'plugin$' |& cut -d\  -f2)
+/usr/local/bin/cmake -S Polyhedron -B build -DCGAL_DIR=$2
+LIST_OF_PLUGINS=$(/usr/local/bin/cmake --build build -t help | egrep 'plugin$' |& cut -d\  -f2)
 PLUGINS_ARRAY=(${LIST_OF_PLUGINS});
 NB_OF_PLUGINS=${#PLUGINS_ARRAY[@]}
 DEL=$(($NB_OF_PLUGINS / 4))
-mkdir build
 cd build
-/usr/local/bin/cmake -DCGAL_DIR=$2 ../Polyhedron
 make -j2 ${PLUGINS_ARRAY[@]:$(($FACTOR * $DEL)):$((($FACTOR + 1) * $DEL))}

From 5247f0fbdbdb9b754050bd03e19e646267f23740 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 19 Sep 2023 15:43:02 +0100
Subject: [PATCH 0744/1398] Bounding_volumes: Use Eigen library in demo

---
 .../demo/Bounding_volumes/CMakeLists.txt      | 10 +-
 GraphicsView/demo/Bounding_volumes/Ellipse.h  | 92 ++++++++++---------
 .../demo/Bounding_volumes/data.pts.cgal       |  3 +
 .../demo/Bounding_volumes/rect.pts.cgal       |  4 +
 .../demo/Bounding_volumes/slanted.pts.cgal    |  4 +
 5 files changed, 68 insertions(+), 45 deletions(-)
 create mode 100644 GraphicsView/demo/Bounding_volumes/data.pts.cgal
 create mode 100644 GraphicsView/demo/Bounding_volumes/rect.pts.cgal
 create mode 100644 GraphicsView/demo/Bounding_volumes/slanted.pts.cgal

diff --git a/GraphicsView/demo/Bounding_volumes/CMakeLists.txt b/GraphicsView/demo/Bounding_volumes/CMakeLists.txt
index 78f97078c03e..ac02fc6554c9 100644
--- a/GraphicsView/demo/Bounding_volumes/CMakeLists.txt
+++ b/GraphicsView/demo/Bounding_volumes/CMakeLists.txt
@@ -18,6 +18,10 @@ find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Qt5)
 find_package(Qt5 QUIET COMPONENTS Widgets)
 include_directories(BEFORE ./include)
 
+find_package(Eigen3 3.1.91 QUIET) #(requires 3.1.91 or greater)
+include(CGAL_Eigen3_support)
+
+if(TARGET CGAL::Eigen3_support)
 if(CGAL_Qt5_FOUND AND Qt5_FOUND)
 
   set(CMAKE_INCLUDE_CURRENT_DIR ON)
@@ -40,7 +44,8 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Bounding_volumes)
 
   target_link_libraries(Bounding_volumes PRIVATE CGAL::CGAL CGAL::CGAL_Qt5
-                                                 Qt5::Widgets)
+                                                 Qt5::Widgets
+                                         PUBLIC CGAL::Eigen3_support)
 
   include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
   cgal_add_compilation_test(Bounding_volumes)
@@ -53,3 +58,6 @@ else()
   message("NOTICE: This demo requires CGAL and Qt5, and will not be compiled.")
 
 endif()
+else()
+  message("NOTICE: This demo requires CGAL and Eigen, and will not be compiled.")
+endif()
diff --git a/GraphicsView/demo/Bounding_volumes/Ellipse.h b/GraphicsView/demo/Bounding_volumes/Ellipse.h
index ce5e09a556c3..d950b8fd8061 100644
--- a/GraphicsView/demo/Bounding_volumes/Ellipse.h
+++ b/GraphicsView/demo/Bounding_volumes/Ellipse.h
@@ -1,6 +1,9 @@
 #ifndef ELLIPSE_H
 #define ELLIPSE_H
 
+#include <Eigen/Dense>
+#include <Eigen/Eigenvalues>
+
 template <class R>
  class Ellipse_2 {
 
@@ -20,50 +23,51 @@ template <class R>
       CGAL::Simple_cartesian<double>::Conic_2 co;
       me.ellipse().double_conic(co);
 
-      double a11 = co.r();
-      double a12 = co.t()/2.0;
-      double a22 = co.s();
-      double b1 = co.u();
-      double b2 = co.v();
-      double c = co.w();
-
-      assert(a11*a22-a12*a12 >= 0);
-
-      double delta = (a11>a22)? a11-a22 : a22-a11;
-      if( (delta < 0.00000000001) && (a12 == 0)){
-        ce = Point_2(-b1/(2*a11), -b2/(2*a11));
-        a_ = b_ = std::sqrt(b1*b1+b2*b2-4*a11*c)/(2*a11);
-        va_ = Vector_2(a_, 0);
-        vb_ = Vector_2(0, b_);
-        return;
-        }
-
-      double kden = 2.0*(a12*a12 - a11*a22);
-      double k1 = (a22*b1 - a12*b2)/kden;
-      double k2 = (a11*b2 - a12*b1)/kden;
-      ce = Point_2(k1,k2);
-      double mu = 1/(a11*k1*k1 + 2.0*a12*k1*k2 + a22*k2*k2 - c);
-      double m11 = mu*a11;
-      double m12 = mu*a12;
-      double m22 = mu*a22;
-
-      double r = std::sqrt((m11-m22)*(m11-m22) + 4.0*m12*m12);
-      double lambda1 = ((m11+m22) + r)/2.0;
-      double lambda2 = ((m11+m22) - r)/2.0;
-
-      b_ = 1.0/sqrt(lambda1);
-      a_ = 1.0/sqrt(lambda2);
-      double omega = 1.0/
- std::sqrt((lambda1-m22)*(lambda1-m22) + m12*m12);
-
-      double u1x = - a_ * omega*m12;
-      double u1y = a_ * omega * (lambda1-m22);
-
-      double u2x = b_* omega * (lambda1-m22);
-      double u2y = b_* omega*m12;
-
-      va_ = Vector_2(u1x,u1y);
-      vb_ = Vector_2(u2x,u2y);
+      // https://en.wikipedia.org/wiki/Matrix_representation_of_conic_sections
+      double A = co.r();
+      double B = co.t();
+      double C = co.s();
+      double D = co.u();
+      double E = co.v();
+      double F = co.w();
+
+      assert(A * C - B*B/4 >= 0);
+
+      Eigen::Matrix2d A33, A33i;
+      A33 << A, B/2, B/2, C;
+      A33i = A33.inverse();
+
+      Eigen::Vector2d v;
+      v << -D/2 , -E/2;
+
+      v = A33i * v;
+
+      ce = Point_2(v[0],v[1]);
+
+      Eigen::EigenSolver<Eigen::Matrix2d> es(A33);
+
+      Eigen::Matrix2cd ev;
+      ev =  es.eigenvectors();
+      double x0 = ev.col(0)[0].real();
+      double y0 = ev.col(0)[1].real();
+      double x1 = ev.col(1)[0].real();
+      double y1 = ev.col(1)[1].real();
+
+      double lambda1 = es.eigenvalues()[0].real();
+      double lambda2 = es.eigenvalues()[1].real();
+
+      Eigen::Matrix3d AQ;
+      AQ << A, B/2, D/2,
+            B/2, C, E/2,
+            D/2, E/2, F;
+
+      double K = AQ.determinant() / A33.determinant();
+
+      a_ = sqrt(-K/lambda1);
+      b_ = sqrt(-K/lambda2);
+
+      va_ =  a_ * Vector_2(x0,y0);
+      vb_ =  b_ * Vector_2(x1,y1);
     }
 
 
diff --git a/GraphicsView/demo/Bounding_volumes/data.pts.cgal b/GraphicsView/demo/Bounding_volumes/data.pts.cgal
new file mode 100644
index 000000000000..49b66d2f77a8
--- /dev/null
+++ b/GraphicsView/demo/Bounding_volumes/data.pts.cgal
@@ -0,0 +1,3 @@
+0 2
+2 1
+0 0
diff --git a/GraphicsView/demo/Bounding_volumes/rect.pts.cgal b/GraphicsView/demo/Bounding_volumes/rect.pts.cgal
new file mode 100644
index 000000000000..ab69a7198547
--- /dev/null
+++ b/GraphicsView/demo/Bounding_volumes/rect.pts.cgal
@@ -0,0 +1,4 @@
+-2 1
+-2 -1
+2 1
+2 -1
diff --git a/GraphicsView/demo/Bounding_volumes/slanted.pts.cgal b/GraphicsView/demo/Bounding_volumes/slanted.pts.cgal
new file mode 100644
index 000000000000..0af8ad54f6b2
--- /dev/null
+++ b/GraphicsView/demo/Bounding_volumes/slanted.pts.cgal
@@ -0,0 +1,4 @@
+-2 -1
+-1 -2
+1 2
+2 1

From 672a0d02bb39d3698438b67fdfed068c19c73961 Mon Sep 17 00:00:00 2001
From: Andry <85350850+Kuprin2000@users.noreply.github.com>
Date: Tue, 19 Sep 2023 18:09:51 +0300
Subject: [PATCH 0745/1398] Added type cast to preprocess_weights() to avoid
 warnings

---
 Straight_skeleton_extrusion_2/include/CGAL/extrude_skeleton.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Straight_skeleton_extrusion_2/include/CGAL/extrude_skeleton.h b/Straight_skeleton_extrusion_2/include/CGAL/extrude_skeleton.h
index 6d9c0286d0b1..bb8929a3da96 100644
--- a/Straight_skeleton_extrusion_2/include/CGAL/extrude_skeleton.h
+++ b/Straight_skeleton_extrusion_2/include/CGAL/extrude_skeleton.h
@@ -955,7 +955,7 @@ preprocess_weights(WeightRange& weights)
   // Since the max value might not be very close to 90°, take the max between of the large-% weight
   // and the weight corresponding to an angle of 89.9999999°
   const FT weight_of_89d9999999 = 572957787.3425436; // tan(89.9999999°)
-  const FT scaled_max = (std::max)(weight_of_89d9999999, 1e3 * max_value);
+  const FT scaled_max = (std::max)(weight_of_89d9999999, FT(1e3) * max_value);
 
   for(auto& contour_weights : weights)
   {

From d2ab01fc5d8ff81b425fb6b1bb226764a6d29dd2 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 20 Sep 2023 12:25:17 +0300
Subject: [PATCH 0746/1398] Forced references (to std::variant) not to spread
 over more than a single line to pacify older version of Doxygen

---
 .../CGAL/Arr_vertical_decomposition_2.h                       | 4 +---
 .../Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h  | 4 +---
 2 files changed, 2 insertions(+), 6 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h
index 09f2ad4e5d21..15631d265e38 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertical_decomposition_2.h
@@ -42,9 +42,7 @@ namespace CGAL {
  * `std::pair<Arrangement_on_surface_2::Vertex_const_handle,
  *            std::pair<std::optional<Type,std::optional<Type>>>`,
  * where `Type` is
- * `std::variant<Arrangement_on_surface_2::Vertex_const_handle,
- *               Arrangement_on_surface_2::Halfedge_const_handle,
- *               Arrangement_on_surface_2::Face_const_handle>`.
+ * `std::variant<Arrangement_on_surface_2::Vertex_const_handle, Arrangement_on_surface_2::Halfedge_const_handle, Arrangement_on_surface_2::Face_const_handle>`.
  */
 template <typename Traits, typename TopologyTraits, typename OutputIterator>
 OutputIterator
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
index 48485644adeb..5886ce3f19d8 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
@@ -1321,9 +1321,7 @@ bool remove_vertex
  * \pre The point-location object `pl`, must model the
  *      `ArrangementPointLocation_2` concept.
  * \pre Dereferencing `oi` must yield a polymorphic object of type
- *      `std::variant<Arrangement_on_surface_2::Vertex_handle,
- *                    Arrangement_on_surface_2::Halfedge_handle,
- *                    Arrangement_on_surface_2::Face_handle>`.
+ *      `std::variant<Arrangement_on_surface_2::Vertex_handle, Arrangement_on_surface_2::Halfedge_handle, Arrangement_on_surface_2::Face_handle>`.
  *
  * \cgalHeading{Requirements}
  */

From 88bcd4096625b172d1091e33cfb37118513e50a1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 20 Sep 2023 12:48:42 +0200
Subject: [PATCH 0747/1398] Enable changing the oracle in the AW3 builder

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h        | 12 ++++++++----
 1 file changed, 8 insertions(+), 4 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index f12ad06804b1..86010b27dfcf 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -173,7 +173,7 @@ class Alpha_wrap_3
   using Alpha_PQ = Modifiable_priority_queue<Gate, Less_gate, Gate_ID_PM<Dt>, CGAL_BOOST_PAIRING_HEAP>;
 
 protected:
-  const Oracle m_oracle;
+  Oracle m_oracle;
   SC_Iso_cuboid_3 m_bbox;
 
   FT m_alpha, m_sq_alpha;
@@ -183,10 +183,12 @@ class Alpha_wrap_3
   Alpha_PQ m_queue;
 
 public:
-  // Main constructor
+  Alpha_wrap_3()
+    : m_queue(4096)
+  { }
+
   Alpha_wrap_3(const Oracle& oracle)
-    :
-      m_oracle(oracle),
+    : m_oracle(oracle),
       m_dt(Geom_traits(oracle.geom_traits())),
       // used to set up the initial MPQ, use some arbitrary not-too-small value
       m_queue(4096)
@@ -198,6 +200,8 @@ class Alpha_wrap_3
 
 public:
   const Geom_traits& geom_traits() const { return m_dt.geom_traits(); }
+  Oracle& oracle() { return m_oracle; }
+  const Oracle& oracle() const { return m_oracle; }
   Dt& triangulation() { return m_dt; }
   const Dt& triangulation() const { return m_dt; }
   const Alpha_PQ& queue() const { return m_queue; }

From 4512b0e6f44ec1ac42ae0854bba2abb12588b7b8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 20 Sep 2023 12:52:20 +0200
Subject: [PATCH 0748/1398] Rewrite the extraction of possibly non-manifold
 wraps

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 295 ++++++++++++------
 1 file changed, 193 insertions(+), 102 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 86010b27dfcf..6e8e323e85a9 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -648,165 +648,256 @@ class Alpha_wrap_3
     return true;
   }
 
-public:
-  // Manifoldness is tolerated while debugging and extracting at intermediate states
-  // Not the preferred way because it uses 3*nv storage
-  template <typename OutputMesh, typename OVPM>
-  void extract_possibly_non_manifold_surface(OutputMesh& output_mesh,
-                                             OVPM ovpm) const
+private:
+  void extract_boundary(std::vector<Point_3>& points,
+                        std::vector<std::array<std::size_t, 3> >& faces) const
   {
-    namespace PMP = Polygon_mesh_processing;
-
-#ifdef CGAL_AW3_DEBUG
-    std::cout << "> Extract possibly non-manifold wrap... ()" << std::endl;
-#endif
-
-    clear(output_mesh);
-
-    CGAL_assertion_code(for(auto cit=m_dt.finite_cells_begin(), cend=m_dt.finite_cells_end(); cit!=cend; ++cit))
-    CGAL_assertion(cit->tds_data().is_clear());
+    std::unordered_map<Vertex_handle, std::size_t> vertex_to_id;
 
-    for(auto cit=m_dt.finite_cells_begin(), cend=m_dt.finite_cells_end(); cit!=cend; ++cit)
+    for(auto fit=m_dt.all_facets_begin(), fend=m_dt.all_facets_end(); fit!=fend; ++fit)
     {
-      Cell_handle seed = cit;
-      if(seed->info().is_outside || seed->tds_data().processed())
+      Facet f = *fit;
+      if(!f.first->info().is_outside)
+        f = m_dt.mirror_facet(f);
+
+      const Cell_handle ch = f.first;
+      const int s = f.second;
+      const Cell_handle nh = ch->neighbor(s);
+      if(ch->info().is_outside == nh->info().is_outside)
         continue;
 
-      std::queue<Cell_handle> to_visit;
-      to_visit.push(seed);
+      std::array<std::size_t, 3> ids;
+      for(int pos=0; pos<3; ++pos)
+      {
+        Vertex_handle vh = ch->vertex(Dt::vertex_triple_index(s, pos));
+        auto insertion_res = vertex_to_id.emplace(vh, vertex_to_id.size());
+        if(insertion_res.second) // successful insertion, never-seen-before vertex
+          points.push_back(m_dt.point(vh));
 
-      std::vector<Point_3> points;
-      std::vector<std::vector<size_t> > faces;
-      std::size_t idx = 0;
+        ids[pos] = insertion_res.first->second;
+      }
 
-      while(!to_visit.empty())
-      {
-        const Cell_handle cell = to_visit.front();
-        CGAL_assertion(!cell->info().is_outside && !m_dt.is_infinite(cell));
+      faces.emplace_back(std::array<std::size_t, 3>{ids[0], ids[1], ids[2]});
+    }
+  }
 
-        to_visit.pop();
+  template <typename OutputMesh, typename OVPM>
+  void extract_manifold_surface(OutputMesh& output_mesh,
+                                OVPM ovpm) const
+  {
+    namespace PMP = Polygon_mesh_processing;
 
-        if(cell->tds_data().processed())
-          continue;
+#ifdef CGAL_AW3_DEBUG
+    std::cout << "> Extract manifold wrap... ()" << std::endl;
+#endif
 
-        cell->tds_data().mark_processed();
+    CGAL_assertion_code(for(Vertex_handle v : m_dt.finite_vertex_handles()))
+    CGAL_assertion(!is_non_manifold(v));
 
-        for(int fid=0; fid<4; ++fid)
-        {
-          const Cell_handle neighbor = cell->neighbor(fid);
-          if(neighbor->info().is_outside)
-          {
-            // There shouldn't be any artificial vertex on the inside/outside boundary
-            // (past initialization)
-//            CGAL_assertion(cell->vertex((fid + 1)&3)->info() == DEFAULT);
-//            CGAL_assertion(cell->vertex((fid + 2)&3)->info() == DEFAULT);
-//            CGAL_assertion(cell->vertex((fid + 3)&3)->info() == DEFAULT);
-
-            points.push_back(m_dt.point(cell, Dt::vertex_triple_index(fid, 0)));
-            points.push_back(m_dt.point(cell, Dt::vertex_triple_index(fid, 1)));
-            points.push_back(m_dt.point(cell, Dt::vertex_triple_index(fid, 2)));
-            faces.push_back({idx, idx + 1, idx + 2});
-            idx += 3;
-          }
-          else
-          {
-            to_visit.push(neighbor);
-          }
-        }
-      }
+    clear(output_mesh);
 
-      PMP::duplicate_non_manifold_edges_in_polygon_soup(points, faces);
+    std::vector<Point_3> points;
+    std::vector<std::array<std::size_t, 3> > faces;
+    extract_boundary(points, faces);
 
-      CGAL_assertion(PMP::is_polygon_soup_a_polygon_mesh(faces));
-      PMP::polygon_soup_to_polygon_mesh(points, faces, output_mesh,
-                                        CGAL::parameters::default_values(),
-                                        CGAL::parameters::vertex_point_map(ovpm));
+    if(faces.empty())
+    {
+#ifdef CGAL_AW3_DEBUG
+      std::cout << "Empty wrap?..." << std::endl;
+#endif
+      return;
+    }
 
-      PMP::stitch_borders(output_mesh, CGAL::parameters::vertex_point_map(ovpm));
-      CGAL_assertion(is_closed(output_mesh));
+    if(!PMP::is_polygon_soup_a_polygon_mesh(faces))
+    {
+      CGAL_warning_msg(false, "Failed to extract a manifold boundary!");
+      return;
     }
 
-    for(auto cit=m_dt.finite_cells_begin(), cend=m_dt.finite_cells_end(); cit!=cend; ++cit)
-      cit->tds_data().clear();
+    PMP::polygon_soup_to_polygon_mesh(points, faces, output_mesh,
+                                      CGAL::parameters::default_values(),
+                                      CGAL::parameters::vertex_point_map(ovpm));
 
     CGAL_postcondition(!is_empty(output_mesh));
     CGAL_postcondition(is_valid_polygon_mesh(output_mesh));
     CGAL_postcondition(is_closed(output_mesh));
-
-    PMP::orient_to_bound_a_volume(output_mesh, CGAL::parameters::vertex_point_map(ovpm));
+    CGAL_postcondition(PMP::does_bound_a_volume(output_mesh, CGAL::parameters::vertex_point_map(ovpm)));
   }
 
   template <typename OutputMesh, typename OVPM>
-  void extract_manifold_surface(OutputMesh& output_mesh,
-                                OVPM ovpm) const
+  void extract_possibly_non_manifold_surface(OutputMesh& output_mesh,
+                                             OVPM ovpm) const
   {
     namespace PMP = Polygon_mesh_processing;
 
+    using vertex_descriptor = typename boost::graph_traits<OutputMesh>::vertex_descriptor;
+    using halfedge_descriptor = typename boost::graph_traits<OutputMesh>::halfedge_descriptor;
+    using face_descriptor = typename boost::graph_traits<OutputMesh>::face_descriptor;
+
 #ifdef CGAL_AW3_DEBUG
-    std::cout << "> Extract wrap... ()" << std::endl;
+    std::cout << "> Extract possibly non-manifold wrap... ()" << std::endl;
 #endif
 
-    CGAL_assertion_code(for(Vertex_handle v : m_dt.finite_vertex_handles()))
-    CGAL_assertion(!is_non_manifold(v));
-
     clear(output_mesh);
 
-    // boundary faces to polygon soup
     std::vector<Point_3> points;
-    std::vector<std::array<std::size_t, 3> > faces;
+    std::vector<std::array<std::size_t, 3> > polygons;
 
-    std::unordered_map<Vertex_handle, std::size_t> vertex_to_id;
-    std::size_t nv = 0;
+    // Explode the polygon soup into indepent triangles, and stitch back edge by edge by walking along the exterior
+    std::map<Facet, std::size_t> facet_ids;
+    std::size_t idx = 0;
 
-    for(auto fit=m_dt.finite_facets_begin(), fend=m_dt.finite_facets_end(); fit!=fend; ++fit)
+    for(auto fit=m_dt.all_facets_begin(), fend=m_dt.all_facets_end(); fit!=fend; ++fit)
     {
       Facet f = *fit;
       if(!f.first->info().is_outside)
         f = m_dt.mirror_facet(f);
 
-      const Cell_handle c = f.first;
+      const Cell_handle ch = f.first;
       const int s = f.second;
-      const Cell_handle nh = c->neighbor(s);
-      if(c->info().is_outside == nh->info().is_outside)
+      const Cell_handle nh = ch->neighbor(s);
+      if(ch->info().is_outside == nh->info().is_outside)
         continue;
 
-      std::array<std::size_t, 3> ids;
-      for(int pos=0; pos<3; ++pos)
-      {
-        Vertex_handle vh = c->vertex(Dt::vertex_triple_index(s, pos));
-        auto insertion_res = vertex_to_id.emplace(vh, nv);
-        if(insertion_res.second) // successful insertion, never-seen-before vertex
-        {
-          points.push_back(m_dt.point(vh));
-          ++nv;
-        }
+      facet_ids[f] = idx / 3;
 
-        ids[pos] = insertion_res.first->second;
-      }
+      points.push_back(m_dt.point(ch, Dt::vertex_triple_index(s, 0)));
+      points.push_back(m_dt.point(ch, Dt::vertex_triple_index(s, 1)));
+      points.push_back(m_dt.point(ch, Dt::vertex_triple_index(s, 2)));
+      polygons.push_back({idx, idx + 1, idx + 2});
 
-      faces.emplace_back(std::array<std::size_t, 3>{ids[0], ids[1], ids[2]});
+      idx += 3;
     }
 
-    if(faces.empty())
-      return;
-
-    if(!PMP::is_polygon_soup_a_polygon_mesh(faces))
+    if(polygons.empty())
     {
-      CGAL_warning_msg(false, "Could NOT extract mesh...");
+#ifdef CGAL_AW3_DEBUG
+      std::cout << "Empty wrap?..." << std::endl;
+#endif
       return;
     }
 
-    PMP::polygon_soup_to_polygon_mesh(points, faces, output_mesh,
-                                      CGAL::parameters::default_values(),
+    CGAL_assertion(PMP::is_polygon_soup_a_polygon_mesh(polygons));
+
+    std::unordered_map<std::size_t, face_descriptor> i2f;
+    PMP::polygon_soup_to_polygon_mesh(points, polygons, output_mesh,
+                                      CGAL::parameters::polygon_to_face_output_iterator(std::inserter(i2f, i2f.end())),
                                       CGAL::parameters::vertex_point_map(ovpm));
 
+    auto face_to_facet = get(CGAL::dynamic_face_property_t<Facet>(), output_mesh);
+
+    idx = 0;
+    for(auto fit=m_dt.all_facets_begin(), fend=m_dt.all_facets_end(); fit!=fend; ++fit)
+    {
+      Facet f = *fit;
+      if(!f.first->info().is_outside)
+        f = m_dt.mirror_facet(f);
+
+      const Cell_handle ch = f.first;
+      const int s = f.second;
+      const Cell_handle nh = ch->neighbor(s);
+      if(ch->info().is_outside == nh->info().is_outside)
+        continue;
+
+      put(face_to_facet, i2f[idx++], f);
+    }
+
+    // grab the stitchable halfedges
+    std::vector<std::pair<halfedge_descriptor, halfedge_descriptor> > to_stitch;
+
+    for(face_descriptor f : faces(output_mesh))
+    {
+      const Facet& tr_f = get(face_to_facet, f);
+      const Cell_handle ch = tr_f.first;
+      CGAL_assertion(ch->info().is_outside);
+
+      for(halfedge_descriptor h : halfedges_around_face(halfedge(f, output_mesh), output_mesh))
+      {
+        const vertex_descriptor sv = source(h, output_mesh);
+        const vertex_descriptor tv = target(h, output_mesh);
+
+        // only need the pair of halfedges once
+        if(get(ovpm, sv) > get(ovpm, tv))
+          continue;
+
+        // One could avoid these point comparisons by using the fact that we know that the graph
+        // has faces built in a specific order (through BGL::add_face()), but it's better to make
+        // this code more generic (and it is not very costly).
+        auto graph_descriptor_to_triangulation_handle = [&](const vertex_descriptor v)
+        {
+          const Point_3& p = get(ovpm, v);
+          for(int i=0; i<4; ++i)
+            if(ch->vertex(i)->point() == p)
+              return ch->vertex(i);
+
+          CGAL_assertion(false);
+          return Vertex_handle();
+        };
+
+        const Vertex_handle s_vh = graph_descriptor_to_triangulation_handle(sv);
+        const Vertex_handle t_vh = graph_descriptor_to_triangulation_handle(tv);
+        CGAL_assertion(get(ovpm, sv) == m_dt.point(s_vh));
+        CGAL_assertion(get(ovpm, tv) == m_dt.point(t_vh));
+
+        const int facet_third_id = 6 - (ch->index(s_vh) + ch->index(t_vh) + tr_f.second); // 0 + 1 + 2 + 3 = 6
+        Vertex_handle third_vh = ch->vertex(facet_third_id);
+
+        // walk around the edge (in the exterior of the wrap) till meeting an inside cell
+        Cell_handle start_ch = ch, curr_ch = ch;
+        do
+        {
+          const int i = curr_ch->index(s_vh);
+          const int j = curr_ch->index(t_vh);
+
+          // the facet is incident to the outside cell, and we walk in the exterior
+          const int facet_third_id = 6 - (curr_ch->index(s_vh) + curr_ch->index(t_vh) + curr_ch->index(third_vh));
+          third_vh = curr_ch->vertex(facet_third_id);
+          curr_ch = curr_ch->neighbor(Dt::next_around_edge(i,j));
+
+          if(!curr_ch->info().is_outside)
+            break;
+        }
+        while(curr_ch != start_ch);
+
+        CGAL_assertion(curr_ch != start_ch);
+        CGAL_assertion(!curr_ch->info().is_outside);
+
+        const int opp_id = 6 - (curr_ch->index(s_vh) + curr_ch->index(t_vh) + curr_ch->index(third_vh));
+        const Facet tr_f2 = m_dt.mirror_facet(Facet(curr_ch, opp_id));
+        CGAL_assertion(facet_ids.count(Facet(curr_ch, opp_id)) == 0);
+        CGAL_assertion(tr_f2.first->info().is_outside);
+        CGAL_assertion(tr_f2.first->neighbor(tr_f2.second) == curr_ch);
+        CGAL_assertion(tr_f2.first->has_vertex(s_vh) && tr_f2.first->has_vertex(t_vh));
+
+        const face_descriptor f2 = i2f[facet_ids.at(tr_f2)];
+        halfedge_descriptor h2 = halfedge(f2, output_mesh), done = h2;
+        while(get(ovpm, target(h2, output_mesh)) != get(ovpm, source(h, output_mesh)))
+        {
+          h2 = next(h2, output_mesh);
+          CGAL_assertion(h2 != done);
+          if(h2 == done)
+            break;
+        }
+
+        CGAL_assertion(get(ovpm, source(h, output_mesh)) == get(ovpm, target(h2, output_mesh)));
+        CGAL_assertion(get(ovpm, target(h, output_mesh)) == get(ovpm, source(h2, output_mesh)));
+        CGAL_assertion(get(ovpm, target(next(h2, output_mesh), output_mesh)) == m_dt.point(third_vh));
+
+        to_stitch.emplace_back(opposite(h, output_mesh), opposite(h2, output_mesh));
+      }
+    }
+
+    PMP::internal::stitch_halfedge_range(to_stitch, output_mesh, ovpm);
+
+    collect_garbage(output_mesh);
+
     CGAL_postcondition(!is_empty(output_mesh));
     CGAL_postcondition(is_valid_polygon_mesh(output_mesh));
     CGAL_postcondition(is_closed(output_mesh));
-
-    PMP::orient_to_bound_a_volume(output_mesh, CGAL::parameters::vertex_point_map(ovpm));
+    CGAL_postcondition(PMP::does_bound_a_volume(output_mesh, CGAL::parameters::vertex_point_map(ovpm)));
   }
 
+public:
   template <typename OutputMesh, typename OVPM>
   void extract_surface(OutputMesh& output_mesh,
                        OVPM ovpm,

From 4d50ec46b361ca0c912f3725d91fe673ff6ed869 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 20 Sep 2023 12:53:12 +0200
Subject: [PATCH 0749/1398] Consider all cases in facet_status

In a normal run of the algorithm, we shall never ask the facet status
of a facet that is already outside, but it's better to be complete
and it costs nothing.
---
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h    | 9 +++++++++
 1 file changed, 9 insertions(+)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 6e8e323e85a9..7c48a51ba6c5 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1027,6 +1027,15 @@ class Alpha_wrap_3
     // skip if neighbor is OUTSIDE or infinite
     const Cell_handle ch = f.first;
     const int id = f.second;
+
+    if(!ch->info().is_outside)
+    {
+#ifdef CGAL_AW3_DEBUG_FACET_STATUS
+      std::cout << "Facet is inside" << std::endl;
+#endif
+      return IRRELEVANT;
+    }
+
     const Cell_handle nh = ch->neighbor(id);
     if(m_dt.is_infinite(nh))
       return TRAVERSABLE;

From bff07b2fc9ef0c26209475deae428ed77c29fecf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 20 Sep 2023 12:55:11 +0200
Subject: [PATCH 0750/1398] Simplify the gate comparer: we can also sort
 artificial facets like normal facets

Artificial facets are *not* infinite facets.
---
 .../include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
index 8d63e34c9e3b..824d27bc2c10 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
@@ -68,11 +68,6 @@ struct Less_gate
   template <typename DT3>
   bool operator()(const Gate<DT3>& a, const Gate<DT3>& b) const
   {
-    // @fixme? make it a total order by comparing addresses if both gates are bbox facets
-    if(a.is_artificial_facet())
-      return true;
-    else if(b.is_artificial_facet())
-      return false;
     return a.priority() > b.priority();
   }
 };

From 5304f739b9f4e26c49630a1fe2970e5c5711b20e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 20 Sep 2023 12:57:02 +0200
Subject: [PATCH 0751/1398] Enable restarting from a previous wrap

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 82 ++++++++++++++++---
 .../internal/parameters_interface.h           |  1 +
 2 files changed, 73 insertions(+), 10 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 7c48a51ba6c5..9a0ee2ddb619 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -176,8 +176,8 @@ class Alpha_wrap_3
   Oracle m_oracle;
   SC_Iso_cuboid_3 m_bbox;
 
-  FT m_alpha, m_sq_alpha;
-  FT m_offset, m_sq_offset;
+  FT m_alpha = FT(-1), m_sq_alpha = FT(-1);
+  FT m_offset = FT(-1), m_sq_offset = FT(-1);
 
   Dt m_dt;
   Alpha_PQ m_queue;
@@ -268,6 +268,20 @@ class Alpha_wrap_3
 
     const bool do_enforce_manifoldness = choose_parameter(get_parameter(in_np, internal_np::do_enforce_manifoldness), true);
 
+    // This parameter enables avoiding recomputing the triangulation from scratch when wrapping
+    // the same meshes for multiple values of alpha (and typically the same offset values).
+    //
+    // /!\ Warning /!\
+    //
+    // If this is enabled, the 3D triangulation will NEVER be cleared and re-initialized
+    // at launch. This means that the triangulation is NOT cleared, even when:
+    // - the triangulation is empty; you will get nothing.
+    // - you use an alpha value that is greater than what was used in a previous run; you will
+    //   obtain a denser result than what you might expect.
+    // - you use a different offset value between runs, you might then get points that are not
+    //   on the offset surface corresponding to your latter offset value.
+    const bool resuming = choose_parameter(get_parameter(in_np, internal_np::refine_triangulation), false);
+
 #ifdef CGAL_AW3_TIMER
     CGAL::Real_timer t;
     t.start();
@@ -275,7 +289,7 @@ class Alpha_wrap_3
 
     visitor.on_alpha_wrapping_begin(*this);
 
-    if(!initialize(alpha, offset, seeds))
+    if(!initialize(alpha, offset, seeds, resuming))
       return;
 
 #ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
@@ -648,6 +662,35 @@ class Alpha_wrap_3
     return true;
   }
 
+  // This function is used in the case of resumption of a previous run: m_dt is not cleared,
+  // and we fill the queue with the new parameters.
+  bool initialize_from_existing_triangulation()
+  {
+    std::cout << "restart from a DT of " << m_dt.number_of_cells() << " cells" << std::endl;
+
+    Real_timer t;
+    t.start();
+
+    for(Cell_handle ch : m_dt.all_cell_handles())
+    {
+      if(!ch->info().is_outside)
+        continue;
+
+      for(int i=0; i<4; ++i)
+      {
+        if(ch->neighbor(i)->info().is_outside)
+          continue;
+
+        push_facet(std::make_pair(ch, i));
+      }
+    }
+
+    t.stop();
+    std::cout << t.time() << " for scanning" << std::endl;
+
+    return true;
+  }
+
 private:
   void extract_boundary(std::vector<Point_3>& points,
                         std::vector<std::array<std::size_t, 3> >& faces) const
@@ -1105,7 +1148,8 @@ class Alpha_wrap_3
   template <typename SeedRange>
   bool initialize(const double alpha,
                   const double offset,
-                  const SeedRange& seeds)
+                  const SeedRange& seeds,
+                  const bool resuming = false)
   {
 #ifdef CGAL_AW3_DEBUG
     std::cout << "> Initialize..." << std::endl;
@@ -1121,20 +1165,38 @@ class Alpha_wrap_3
       return false;
     }
 
+    if(resuming)
+    {
+      if(offset != m_offset)
+      {
+#ifdef CGAL_AW3_DEBUG
+        std::cerr << "Warning: resuming with a different offset!" << std::endl;
+#endif
+      }
+    }
+
     m_alpha = FT(alpha);
     m_sq_alpha = square(m_alpha);
     m_offset = FT(offset);
     m_sq_offset = square(m_offset);
 
-    m_dt.clear();
     m_queue.clear();
 
-    insert_bbox_corners();
-
-    if(seeds.empty())
-      return initialize_from_infinity();
+    if(resuming)
+    {
+      return initialize_from_existing_triangulation();
+    }
     else
-      return initialize_with_cavities(seeds);
+    {
+      m_dt.clear();
+
+      insert_bbox_corners();
+
+      if(seeds.empty())
+        return initialize_from_infinity();
+      else
+        return initialize_with_cavities(seeds);
+    }
   }
 
   template <typename Visitor>
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index 7792ad5cdb60..435075df6e2a 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -237,6 +237,7 @@ CGAL_add_named_parameter(smooth_constrained_edges_t, smooth_constrained_edges, s
 // List of named parameters used in Alpha_wrap_3
 CGAL_add_named_parameter(do_enforce_manifoldness_t, do_enforce_manifoldness, do_enforce_manifoldness)
 CGAL_add_named_parameter(seed_points_t, seed_points, seed_points)
+CGAL_add_named_parameter(refine_triangulation_t, refine_triangulation, refine_triangulation)
 
 // SMDS_3 parameters
 CGAL_add_named_parameter(surface_facets_t, surface_facets, surface_facets)

From 36017331c2e12a62a055943732b1cfed4d128eb4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 20 Sep 2023 12:58:30 +0200
Subject: [PATCH 0752/1398] Add an example of successive AW3 restarts

---
 .../examples/Alpha_wrap_3/CMakeLists.txt      |   1 +
 .../Alpha_wrap_3/successive_wraps.cpp         | 151 ++++++++++++++++++
 2 files changed, 152 insertions(+)
 create mode 100644 Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt b/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt
index 2014b9baa7ca..11dec5f4134d 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt
@@ -12,3 +12,4 @@ create_single_source_cgal_program("triangle_soup_wrap.cpp")
 create_single_source_cgal_program("point_set_wrap.cpp")
 create_single_source_cgal_program("wrap_from_cavity.cpp")
 create_single_source_cgal_program("mixed_inputs_wrap.cpp")
+create_single_source_cgal_program("successive_wraps.cpp")
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
new file mode 100644
index 000000000000..600d533ee411
--- /dev/null
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
@@ -0,0 +1,151 @@
+#define CGAL_AW3_TIMER
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/alpha_wrap_3.h>
+#include <CGAL/Polygon_mesh_processing/bbox.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/Real_timer.h>
+
+#include <iostream>
+#include <string>
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
+using FT = K::FT;
+using Point_3 = K::Point_3;
+
+using Mesh = CGAL::Surface_mesh<Point_3>;
+
+// We want decreasing alphas, and these are relative ratios, so they need to be increasing
+const std::vector<FT> relative_alphas = { 1, 2/*50, 100, 150, 200, 250*/ };
+const FT relative_offset = 600;
+
+int main(int argc, char** argv)
+{
+  std::cout.precision(17);
+  std::cerr.precision(17);
+
+  // Read the input
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/cube.off");
+  std::cout << "Reading " << filename << "..." << std::endl;
+
+  Mesh mesh;
+  if(!PMP::IO::read_polygon_mesh(filename, mesh) || is_empty(mesh) || !is_triangle_mesh(mesh))
+  {
+    std::cerr << "Invalid input." << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::cout << "Input: " << num_vertices(mesh) << " vertices, " << num_faces(mesh) << " faces" << std::endl;
+
+  const CGAL::Bbox_3 bbox = CGAL::Polygon_mesh_processing::bbox(mesh);
+  const double diag_length = std::sqrt(CGAL::square(bbox.xmax() - bbox.xmin()) +
+                                       CGAL::square(bbox.ymax() - bbox.ymin()) +
+                                       CGAL::square(bbox.zmax() - bbox.zmin()));
+
+  // ===============================================================================================
+  // Naive approach:
+
+  CGAL::Real_timer t;
+  double total_time = 0.;
+
+  for(std::size_t i=0; i<relative_alphas.size(); ++i)
+  {
+    t.reset();
+    t.start();
+
+    const double alpha = diag_length / relative_alphas[i];
+    const double offset = diag_length / relative_offset;
+    std::cout << ">>> [" << i << "] alpha: " << alpha << " offset: " << offset << std::endl;
+
+    Mesh wrap;
+    CGAL::alpha_wrap_3(mesh, alpha, offset, wrap,
+                       CGAL::parameters::do_enforce_manifoldness(false));
+
+    t.stop();
+    std::cout << "  Result: " << num_vertices(wrap) << " vertices, " << num_faces(wrap) << " faces" << std::endl;
+    std::cout << "  Elapsed time: " << t.time() << " s." << std::endl;
+
+    std::string input_name = std::string(filename);
+    input_name = input_name.substr(input_name.find_last_of("/") + 1, input_name.length() - 1);
+    input_name = input_name.substr(0, input_name.find_last_of("."));
+    std::string output_name = input_name
+                              + "_" + std::to_string(static_cast<int>(relative_alphas[i]))
+                              + "_" + std::to_string(static_cast<int>(relative_offset)) + ".off";
+    std::cout << "Writing to " << output_name << std::endl;
+    CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
+
+    total_time += t.time();
+  }
+
+  std::cout << "Total elapsed time (naive): " << total_time << " s.\n" << std::endl;
+
+  // ===============================================================================================
+  // Re-use approach
+  //
+  // Here, we restart from the triangulation of the previous state, and carve according
+  // to a (smaller) alpha value. This enables considerable speed-up: the cumulated time taken
+  // to run `n` successive instances of `{alpha_wrap(alpha_i)}_(i=1...n)` will be equal to the
+  // time taken to run alpha_wrap(alpha_n) from scratch.
+  //
+  // For example:
+  // naive:
+  //   alpha_wrap(alpha_1, ...) ---> 2s
+  //   alpha_wrap(alpha_2, ...) ---> 4s
+  //   alpha_wrap(alpha_3, ...) ---> 8s
+  // will become with reusability:
+  //   alpha_wrap(alpha_1, ..., reuse) ---> 2s
+  //   alpha_wrap(alpha_2, ..., reuse) ---> 2s // 2+2 = 4s = naive alpha_2
+  //   alpha_wrap(alpha_3, ..., reuse) ---> 4s // 2+2+4 = 8s = naive alpha_3
+  // Thus, if we care about the intermediate results, we save 6s (8s instead of 14s).
+  // The speed-up increases with the number of intermediate results, and if the alpha values
+  // are close.
+  //
+  // !! Warning !!
+  // The result of alpha_wrap(alpha_1, ...) followed by alpha_wrap(alpha_2, ...) with alpha_2
+  // smaller than alpha_1 is going to be close but NOT exactly equal to that produced by calling
+  // alpha_wrap(alpha_2, ...) directly.
+
+  total_time = 0.;
+  t.reset();
+
+  using Oracle = CGAL::Alpha_wraps_3::internal::Triangle_mesh_oracle<K>;
+  using Wrapper = CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle>;
+  Wrapper wrapper; // contains the triangulation that is being refined iteratively
+
+  for(std::size_t i=0; i<relative_alphas.size(); ++i)
+  {
+    t.reset();
+    t.start();
+
+    const double alpha = diag_length / relative_alphas[i];
+    const double offset = diag_length / relative_offset;
+    std::cout << ">>> [" << i << "] alpha: " << alpha << " offset: " << offset << std::endl;
+
+    // The triangle mesh oracle can be initialized with alpha to internally perform a split
+    // of too-big facets while building the AABB Tree. This split in fact yields a significant
+    // speed-up for meshes with elements that are large compared to alpha. This speed-up makes it
+    // faster to re-build the AABB tree for every value of alpha than to use a non-optimized tree.
+    Oracle oracle(alpha);
+    oracle.add_triangle_mesh(mesh, CGAL::parameters::default_values());
+    wrapper.oracle() = oracle;
+
+    Mesh wrap;
+    wrapper(alpha, offset, wrap,
+            CGAL::parameters::do_enforce_manifoldness(false)
+                             .refine_triangulation((i != 0)));
+
+    t.stop();
+    std::cout << "  Result: " << num_vertices(wrap) << " vertices, " << num_faces(wrap) << " faces" << std::endl;
+    std::cout << "  Elapsed time: " << t.time() << " s." << std::endl;
+
+    total_time += t.time();
+  }
+
+  std::cout << "Total elapsed time (successive): " << total_time << " s." << std::endl;
+
+  return EXIT_SUCCESS;
+}

From 19cb693a1b9ff119593057c76402493b03e474e9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 20 Sep 2023 12:59:46 +0200
Subject: [PATCH 0753/1398] Improve debug code

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 84 +++++++++++++------
 1 file changed, 60 insertions(+), 24 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 9a0ee2ddb619..0579297c4335 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1053,6 +1053,24 @@ class Alpha_wrap_3
     TRAVERSABLE
   };
 
+  inline const char* get_status_message(const Facet_queue_status status)
+  {
+    constexpr std::size_t status_count = 3;
+
+    // Messages corresponding to Error_code list above. Must be kept in sync!
+    static const char* message[status_count] = {
+      "Irrelevant facet",
+      "Artificial facet",
+      "Traversable facet"
+    };
+
+    if(status > status_count || status < 0)
+      return "Unknown status";
+    else
+      return message[status];
+  }
+
+public:
   // @speed some decent time may be spent constructing Facet (pairs) for no reason as it's always
   // just to grab the .first and .second as soon as it's constructed, and not due to API requirements
   // e.g. from DT3
@@ -1062,9 +1080,9 @@ class Alpha_wrap_3
 
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
     std::cout << "facet status: "
-              << f.first->vertex((f.second + 1)&3)->point() << " "
-              << f.first->vertex((f.second + 2)&3)->point() << " "
-              << f.first->vertex((f.second + 3)&3)->point() << std::endl;
+              << m_dt.point(f.first, Dt::vertex_triple_index(f.second, 0)) << " "
+              << m_dt.point(f.first, Dt::vertex_triple_index(f.second, 1)) << " "
+              << m_dt.point(f.first, Dt::vertex_triple_index(f.second, 2)) << std::endl;
 #endif
 
     // skip if neighbor is OUTSIDE or infinite
@@ -1119,6 +1137,7 @@ class Alpha_wrap_3
     return IRRELEVANT;
   }
 
+private:
   bool push_facet(const Facet& f)
   {
     CGAL_precondition(f.first->info().is_outside);
@@ -1127,19 +1146,29 @@ class Alpha_wrap_3
     if(m_queue.contains_with_bounds_check(Gate(f)))
       return false;
 
-    const Facet_queue_status s = facet_status(f);
-    if(s == IRRELEVANT)
+    const Facet_queue_status status = facet_status(f);
+    if(status == IRRELEVANT)
       return false;
 
     const Cell_handle ch = f.first;
-    const int id = f.second;
-    const Point_3& p0 = m_dt.point(ch, (id+1)&3);
-    const Point_3& p1 = m_dt.point(ch, (id+2)&3);
-    const Point_3& p2 = m_dt.point(ch, (id+3)&3);
+    const int s = f.second;
+    const Point_3& p0 = m_dt.point(ch, Dt::vertex_triple_index(s, 0));
+    const Point_3& p1 = m_dt.point(ch, Dt::vertex_triple_index(s, 1));
+    const Point_3& p2 = m_dt.point(ch, Dt::vertex_triple_index(s, 2));
 
-    // @todo should prob be the real value we compare to alpha instead of squared_radius
+    // @todo should prob be the real value that we compare to alpha instead of squared_radius
     const FT sqr = geom_traits().compute_squared_radius_3_object()(p0, p1, p2);
-    m_queue.resize_and_push(Gate(f, sqr, (s == ARTIFICIAL_FACET)));
+    m_queue.resize_and_push(Gate(f, sqr, (status == ARTIFICIAL_FACET)));
+
+#ifdef CGAL_AW3_DEBUG_QUEUE
+    static int gid = 0;
+    std::cout << "Queue insertion #" << gid++ << "\n"
+              << "  ch = " << &*ch << " (" << m_dt.is_infinite(ch) << ") " << "\n"
+              << "\t" << p0 << "\n\t" << p1 << "\n\t" << p2 << std::endl;
+    std::cout << "  Status: " << get_status_message(status) << std::endl;
+    std::cout << "  SQR: " << sqr << std::endl;
+    std::cout << "  Artificiality: " << (status == ARTIFICIAL_FACET) << std::endl;
+#endif
 
     return true;
   }
@@ -1160,7 +1189,7 @@ class Alpha_wrap_3
     if(!is_positive(alpha) || !is_positive(offset))
     {
 #ifdef CGAL_AW3_DEBUG
-      std::cout << "Error: invalid input parameters" << std::endl;
+      std::cerr << "Error: invalid input parameters: " << alpha << " and" << offset << std::endl;
 #endif
       return false;
     }
@@ -1230,7 +1259,9 @@ class Alpha_wrap_3
       std::cout << m_queue.size() << " facets in the queue" << std::endl;
       std::cout << "Face " << fid++ << "\n"
                 << "c = " << &*ch << " (" << m_dt.is_infinite(ch) << "), n = " << &*neighbor << " (" << m_dt.is_infinite(neighbor) << ")" << "\n"
-                << m_dt.point(ch, (id+1)&3) << "\n" << m_dt.point(ch, (id+2)&3) << "\n" << m_dt.point(ch, (id+3)&3) << std::endl;
+                << m_dt.point(ch, Dt::vertex_triple_index(id, 0)) << "\n"
+                << m_dt.point(ch, Dt::vertex_triple_index(id, 1)) << "\n"
+                << m_dt.point(ch, Dt::vertex_triple_index(id, 2)) << std::endl;
       std::cout << "Priority: " << gate.priority() << std::endl;
 #endif
 
@@ -1246,7 +1277,9 @@ class Alpha_wrap_3
       std::string face_name = "results/steps/face_" + std::to_string(static_cast<int>(i++)) + ".xyz";
       std::ofstream face_out(face_name);
       face_out.precision(17);
-      face_out << "3\n" << m_dt.point(ch, (id+1)&3) << "\n" << m_dt.point(ch, (id+2)&3) << "\n" << m_dt.point(ch, (id+3)&3) << std::endl;
+      face_out << "3\n" << m_dt.point(ch, Dt::vertex_triple_index(id, 0)) << "\n"
+                        << m_dt.point(ch, Dt::vertex_triple_index(id, 1)) << "\n"
+                        << m_dt.point(ch, Dt::vertex_triple_index(id, 2)) << std::endl;
       face_out.close();
 #endif
 
@@ -1373,7 +1406,7 @@ class Alpha_wrap_3
     inc_cells.reserve(64);
     m_dt.incident_cells(v, std::back_inserter(inc_cells));
 
-    // Flood one inside and outside CC.
+    // Flood one inside and outside CC within the cell umbrella of the vertex.
     // Process both an inside and an outside CC to also detect edge pinching.
     // If there are still unprocessed afterwards, there is a non-manifoldness issue.
     //
@@ -1664,7 +1697,8 @@ class Alpha_wrap_3
 private:
   void check_queue_sanity()
   {
-    std::cout << "Check queue sanity..." << std::endl;
+    std::cout << "\t~~~ Check queue sanity ~~~" << std::endl;
+
     std::vector<Gate> queue_gates;
     Gate previous_top_gate = m_queue.top();
     while(!m_queue.empty())
@@ -1674,15 +1708,16 @@ class Alpha_wrap_3
       const Facet& current_f = current_gate.facet();
       const Cell_handle ch = current_f.first;
       const int id = current_f.second;
-      const Point_3& p0 = m_dt.point(ch, (id+1)&3);
-      const Point_3& p1 = m_dt.point(ch, (id+2)&3);
-      const Point_3& p2 = m_dt.point(ch, (id+3)&3);
+      const Point_3& p0 = m_dt.point(ch, Dt::vertex_triple_index(id, 0));
+      const Point_3& p1 = m_dt.point(ch, Dt::vertex_triple_index(id, 1));
+      const Point_3& p2 = m_dt.point(ch, Dt::vertex_triple_index(id, 2));
       const FT sqr = geom_traits().compute_squared_radius_3_object()(p0, p1, p2);
 
-      std::cout << "At Facet with VID " << get(Gate_ID_PM<Dt>(), current_gate)  << std::endl;
-
-      if(current_gate.priority() != sqr)
-        std::cerr << "Error: facet in queue has wrong priority" << std::endl;
+      std::cout << "At Facet with VID " << get(Gate_ID_PM<Dt>(), current_gate) << "\n";
+      std::cout << "\t" << p0 << "\n\t" << p1 << "\n\t" << p2 << "\n";
+      std::cout << "  Artificiality: " << current_gate.is_artificial_facet() << "\n";
+      std::cout << "  SQR: " << sqr << "\n";
+      std::cout << "  Priority " << current_gate.priority() << std::endl;
 
       if(Less_gate()(current_gate, previous_top_gate))
         std::cerr << "Error: current gate has higher priority than the previous top" << std::endl;
@@ -1691,7 +1726,8 @@ class Alpha_wrap_3
 
       m_queue.pop();
     }
-    std::cout << "End sanity check" << std::endl;
+
+    std::cout << "\t~~~ End queue sanity check ~~~" << std::endl;
 
     // Rebuild
     CGAL_assertion(m_queue.empty());

From 029d7a8fba55237bcdc8d608c40d79d0ec5273ab Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 20 Sep 2023 16:50:48 +0200
Subject: [PATCH 0754/1398] fix test/Installation tests on Windows

---
 Installation/test/Installation/CMakeLists.txt | 23 ++++---------------
 1 file changed, 4 insertions(+), 19 deletions(-)

diff --git a/Installation/test/Installation/CMakeLists.txt b/Installation/test/Installation/CMakeLists.txt
index 5a22a7c42333..db725c17645f 100644
--- a/Installation/test/Installation/CMakeLists.txt
+++ b/Installation/test/Installation/CMakeLists.txt
@@ -7,32 +7,16 @@ project( Installation_Tests )
 
 
 macro(create_link_to_program COMPONENT)
-
   add_executable(link_to_${COMPONENT} link_to_${COMPONENT}.cpp)
-
-  include_directories(${${COMPONENT}_3RD_PARTY_INCLUDE_DIRS})
-
-  add_definitions(${${COMPONENT}_3RD_PARTY_DEFINITIONS})
-
-  link_directories(${${COMPONENT}_3RD_PARTY_LIBRARIES_DIRS})
-
-  # Link the executable to CGAL and third-party libraries
-  if(CGAL_AUTO_LINK_ENABLED OR CGAL_HEADER_ONLY)
-    target_link_libraries(link_to_${COMPONENT} ${CGAL_3RD_PARTY_LIBRARIES}
-                          ${${COMPONENT}_3RD_PARTY_LIBRARIES})
-  else()
-    target_link_libraries(
-      link_to_${COMPONENT} CGAL::${COMPONENT} ${CGAL_3RD_PARTY_LIBRARIES}
-      ${${COMPONENT}_3RD_PARTY_LIBRARIES})
-  endif()
-
+  target_link_libraries(link_to_${COMPONENT} CGAL::${COMPONENT})
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS link_to_${COMPONENT})
-
+  CGAL_add_test(link_to_${COMPONENT})
 endmacro()
 
 find_package(CGAL REQUIRED COMPONENTS Core)
 
 include(CGAL_CreateSingleSourceCGALProgram)
+include(CGAL_SetupGMP)
 
 create_single_source_cgal_program("endian.cpp")
 
@@ -68,6 +52,7 @@ if(WIN32 OR CMAKE_SYSTEM_NAME STREQUAL Windows)
   target_link_libraries(display_dll_version_info version)
   add_executable(test_gmp_mpfr_dll test_gmp_mpfr_dll.cpp)
   target_link_libraries(test_gmp_mpfr_dll version)
+  use_CGAL_GMP_support(test_gmp_mpfr_dll)
   CGAL_add_test(test_gmp_mpfr_dll)
   add_to_cached_list( CGAL_EXECUTABLE_TARGETS test_gmp_mpfr_dll )
   string(RANDOM RDM_DIR)#5 random chars to avoid conflicts in parallel testsuites

From d092d4b0e3a7669f980ef675375754154ab38653 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 20 Sep 2023 14:34:36 +0200
Subject: [PATCH 0755/1398] Reformulate a cross product to increase precision

---
 .../edge_collapse_surface_mesh.cpp            | 10 +-
 .../include/CGAL/Cartesian/MatrixC33.h        |  7 ++
 .../internal/Lindstrom_Turk_core.h            | 98 ++++++++++++++++++-
 .../internal/Common.h                         |  5 +-
 4 files changed, 112 insertions(+), 8 deletions(-)

diff --git a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_surface_mesh.cpp b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_surface_mesh.cpp
index d21417d98295..3e88f4b090df 100644
--- a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_surface_mesh.cpp
+++ b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_surface_mesh.cpp
@@ -16,10 +16,12 @@ namespace SMS = CGAL::Surface_mesh_simplification;
 
 int main(int argc, char** argv)
 {
+  std::cout.precision(17);
+  std::cerr.precision(17);
+
   Surface_mesh surface_mesh;
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/cube-meshed.off");
-  std::ifstream is(filename);
-  if(!is || !(is >> surface_mesh))
+  if(!CGAL::IO::read_polygon_mesh(filename, surface_mesh))
   {
     std::cerr << "Failed to read input mesh: " << filename << std::endl;
     return EXIT_FAILURE;
@@ -33,6 +35,8 @@ int main(int argc, char** argv)
 
   std::chrono::steady_clock::time_point start_time = std::chrono::steady_clock::now();
 
+  std::cout << num_vertices(surface_mesh) << " vertices, " << num_edges(surface_mesh) << " edges (BEFORE)" << std::endl;
+
   // In this example, the simplification stops when the number of undirected edges
   // drops below 10% of the initial count
   double stop_ratio = (argc > 2) ? std::stod(argv[2]) : 0.1;
@@ -45,7 +49,7 @@ int main(int argc, char** argv)
   std::cout << "\nFinished!\n" << r << " edges removed.\n" << surface_mesh.number_of_edges() << " final edges.\n";
   std::cout << "Time elapsed: " << std::chrono::duration_cast<std::chrono::milliseconds>(end_time - start_time).count() << "ms" << std::endl;
 
-  CGAL::IO::write_polygon_mesh((argc > 3) ? argv[3] : "out.off", surface_mesh, CGAL::parameters::stream_precision(17));
+  CGAL::IO::write_polygon_mesh((argc > 3) ? argv[3] : "out_SC.off", surface_mesh, CGAL::parameters::stream_precision(17));
 
   return EXIT_SUCCESS;
 }
diff --git a/Surface_mesh_simplification/include/CGAL/Cartesian/MatrixC33.h b/Surface_mesh_simplification/include/CGAL/Cartesian/MatrixC33.h
index 7cc2858020b3..3c24abbc3c24 100644
--- a/Surface_mesh_simplification/include/CGAL/Cartesian/MatrixC33.h
+++ b/Surface_mesh_simplification/include/CGAL/Cartesian/MatrixC33.h
@@ -131,6 +131,13 @@ class MatrixC33
     return Vector_3(v*m.r0(), v*m.r1(), v*m.r2());
   }
 
+  friend std::ostream& operator<<(std::ostream & os, const MatrixC33& m)
+{
+  return os << m.r0() << std::endl
+            << m.r1() << std::endl
+            << m.r2() << std::endl;
+}
+
   RT determinant() const
   {
     return CGAL::determinant(r0().x(), r0().y(), r0().z(),
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
index 59002f636814..dd901c8d89ae 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
@@ -13,6 +13,8 @@
 
 #include <CGAL/license/Surface_mesh_simplification.h>
 
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+
 #include <CGAL/Surface_mesh_simplification/internal/Common.h>
 #include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/LindstromTurk_params.h>
 #include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_profile.h>
@@ -119,9 +121,103 @@ private :
   const Geom_traits& geom_traits() const { return mProfile.geom_traits(); }
   const TM& surface() const { return mProfile.surface(); }
 
+#if 0
+  // a*b - c*d
+  // The next two functions are from https://stackoverflow.com/questions/63665010/accurate-floating-point-computation-of-the-sum-and-difference-of-two-products
+  static double diff_of_products_kahan(const double a, const double b, const double c, const double d)
+  {
+    double w = d * c;
+    double e = std::fma(c, -d, w);
+    double f = std::fma(a, b, -w);
+    return f + e;
+  }
+
+  static double diff_of_products_cht(const double a, const double b, const double c, const double d)
+  {
+    double p1 = a * b;
+    double p2 = c * d;
+    double e1 = std::fma (a, b, -p1);
+    double e2 = std::fma (c, -d, p2);
+    double r = p1 - p2;
+    double e = e1 + e2;
+    return r + e;
+  }
+
+  static double diff_of_products(const double a, const double b, const double c, const double d)
+  {
+    // the next two are equivalent in results and speed
+    return diff_of_products_kahan(a, b, c, d);
+    // return diff_of_products_cht(a, b, c, d);
+  }
+
+  template <typename OFT>
+  static OFT diff_of_products(const OFT& a, const OFT& b, const OFT& c, const OFT& d)
+  {
+    return a*b - c*d;
+  }
+#endif
+
+  static Vector SL_cross_product(const Vector& a, const Vector& b)
+  {
+    const FT ax=a.x(), ay=a.y(), az=a.z();
+    const FT bx=b.x(), by=b.y(), bz=b.z();
+
+    auto minor = [](double ai, double bi, double aj, double bj)
+    {
+      // The main idea is that we expect ai and bi (and aj and bj) to have roughly the same magnitude
+      // since this function is used to compute the cross product of two vectors that are defined
+      // as (ORIGIN, pa) and (ORIGIN, pb) and pa and pb are part of the same triangle.
+      //
+      // We can abuse this fact to trade 2 extra subtractions to lower the error.
+      return ai * (bj - aj) + aj * (ai - bi);
+    };
+
+    // ay*
+    FT x = minor(ay, by, az, bz);
+    FT y = minor(az, bz, ax, bx);
+    FT z = minor(ax, bx, ay, by);
+
+    return Vector(x, y, z);
+  }
+
+#if 0
+  static Vector exact_cross_product(const Vector& a, const Vector& b)
+  {
+    CGAL::Cartesian_converter<Geom_traits, CGAL::Exact_predicates_exact_constructions_kernel> to_exact;
+    CGAL::Cartesian_converter<CGAL::Exact_predicates_exact_constructions_kernel, Geom_traits> to_approx;
+    auto exv = cross_product(to_exact(a), to_exact(b));
+    exv.exact();
+    return to_approx(exv);
+  }
+#endif
+
+  static Vector X_product(const Vector& u, const Vector& v)
+  {
+#if 0
+    // this can create large errors and spiky meshes for kernels with inexact constructions
+    return CGAL::cross_product(u,v);
+#elif 0
+    // improves the problem mentioned above a bit, but not enough
+    return { std::fma(u.y(), v.z(), -u.z()*v.y()),
+             std::fma(u.z(), v.x(), -u.x()*v.z()),
+             std::fma(u.x(), v.y(), -u.y()*v.x()) };
+#elif 0
+    // this is the best without resorting to exact, but it inflicts a 20% slowdown
+    return { diff_of_products(u.y(), v.z(), u.z(), v.y()),
+             diff_of_products(u.z(), v.x(), u.x(), v.z()),
+             diff_of_products(u.x(), v.y(), u.y(), v.x()) };
+#elif 1
+    // balanced solution based on abusing the fact that here we expect u and v to have similar coordinates
+    return SL_cross_product(u, v);
+#elif 0
+    // obviously too slow
+    return exact_cross_product(u, v);
+#endif
+  }
+
   static Vector point_cross_product(const Point& a, const Point& b)
   {
-    return cross_product(a-ORIGIN, b-ORIGIN);
+    return X_product(a-ORIGIN, b-ORIGIN);
   }
 
   // This is the (uX)(Xu) product described in the Lindstrom-Turk paper
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h
index 4ed45a02d1e6..5255a0b53591 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h
@@ -114,10 +114,7 @@ inline std::string optional_to_string(const std::optional<T>& o) {
 
   namespace internal { namespace { bool cgal_enable_sms_trace = true; } }
   #define CGAL_SMS_TRACE_IMPL(m) \
-    if(::internal::cgal_enable_sms_trace) { \
-    std::ostringstream ss; ss << m; std::string s = ss.str(); \
-    /*Surface_simplification_external_trace(s)*/ std::cerr << s << std::endl; \
-    }
+    std::cerr << m << std::endl;
 
   #define CGAL_SMS_DEBUG_CODE(code) code
 #else

From 985c8a7825ed3d0d2289825c199274f37f36b795 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 20 Sep 2023 16:58:59 +0200
Subject: [PATCH 0756/1398] Add a test

---
 .../CMakeLists.txt                            |  1 +
 .../data/far_xy.off                           | 90 +++++++++++++++++++
 .../test_edge_collapse_stability.cpp          | 71 +++++++++++++++
 3 files changed, 162 insertions(+)
 create mode 100644 Surface_mesh_simplification/test/Surface_mesh_simplification/data/far_xy.off
 create mode 100644 Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp

diff --git a/Surface_mesh_simplification/test/Surface_mesh_simplification/CMakeLists.txt b/Surface_mesh_simplification/test/Surface_mesh_simplification/CMakeLists.txt
index 2f55474593af..9c1e010e5efb 100644
--- a/Surface_mesh_simplification/test/Surface_mesh_simplification/CMakeLists.txt
+++ b/Surface_mesh_simplification/test/Surface_mesh_simplification/CMakeLists.txt
@@ -12,6 +12,7 @@ create_single_source_cgal_program("test_edge_collapse_Envelope.cpp")
 create_single_source_cgal_program("test_edge_collapse_Polyhedron_3.cpp")
 create_single_source_cgal_program("test_edge_profile_link.cpp")
 create_single_source_cgal_program("test_edge_deprecated_stop_predicates.cpp")
+create_single_source_cgal_program("test_edge_collapse_stability.cpp")
 
 find_package(Eigen3 3.1.0 QUIET) #(3.1.0 or greater)
 include(CGAL_Eigen3_support)
diff --git a/Surface_mesh_simplification/test/Surface_mesh_simplification/data/far_xy.off b/Surface_mesh_simplification/test/Surface_mesh_simplification/data/far_xy.off
new file mode 100644
index 000000000000..efa40d4b9a19
--- /dev/null
+++ b/Surface_mesh_simplification/test/Surface_mesh_simplification/data/far_xy.off
@@ -0,0 +1,90 @@
+OFF
+36 50 0
+
+104605.80000019073 1217329.6000003815 134.27659606933594
+104605.75 1217329.6000003815 134.27859497070312
+104605.55000019073 1217329.7999992371 134.29460144042969
+104605.80000019073 1217329.7999992371 134.28489685058594
+104605.75 1217329.7999992371 134.28680419921875
+104605.75 1217329.75 134.28469848632812
+104605.55000019073 1217329.75 134.2926025390625
+104605.55000019073 1217329.7000007629 134.29060363769531
+104605.80000019073 1217329.75 134.28280639648438
+104605.84999990463 1217329.7999992371 134.28300476074219
+104605.69999980927 1217329.7999992371 134.2886962890625
+104605.55000019073 1217329.6499996185 134.28860473632812
+104605.55000019073 1217329.6000003815 134.28660583496094
+104605.84999990463 1217329.6000003815 134.27470397949219
+104605.59999990463 1217329.7999992371 134.2926025390625
+104605.75 1217329.7000007629 134.2825927734375
+104605.65000009537 1217329.75 134.28860473632812
+104605.80000019073 1217329.7000007629 134.28070068359375
+104605.84999990463 1217329.75 134.28089904785156
+104605.69999980927 1217329.7000007629 134.28460693359375
+104605.90000009537 1217329.7999992371 134.28109741210938
+104605.90000009537 1217329.6499996185 134.27490234375
+104605.90000009537 1217329.7000007629 134.27690124511719
+104605.65000009537 1217329.5499992371 134.28059387207031
+104605.59999990463 1217329.5 134.28050231933594
+104605.90000009537 1217329.5499992371 134.27070617675781
+104605.69999980927 1217329.6000003815 134.28059387207031
+104605.65000009537 1217329.6499996185 134.28460693359375
+104605.59999990463 1217329.7000007629 134.28860473632812
+104605.65000009537 1217329.4500007629 134.27650451660156
+104605.59999990463 1217329.6000003815 134.28460693359375
+104605.55000019073 1217329.5 134.28250122070312
+104605.55000019073 1217329.5499992371 134.28450012207031
+104605.90000009537 1217329.75 134.27900695800781
+104605.84999990463 1217329.7000007629 134.27879333496094
+104605.84999990463 1217329.6499996185 134.27679443359375
+3  30 23 26
+3  3 4 5
+3  26 23 1
+3  22 33 34
+3  8 9 3
+3  17 0 35
+3  17 1 0
+3  4 10 5
+3  15 1 17
+3  8 3 5
+3  15 26 1
+3  6 14 2
+3  0 25 13
+3  35 0 13
+3  6 16 14
+3  28 16 6
+3  7 28 6
+3  8 5 15
+3  16 10 14
+3  8 15 17
+3  16 5 10
+3  18 8 17
+3  16 19 5
+3  19 15 5
+3  18 20 9
+3  18 9 8
+3  11 28 7
+3  11 27 28
+3  21 35 13
+3  21 22 35
+3  22 34 35
+3  31 24 32
+3  24 23 32
+3  24 29 23
+3  29 1 23
+3  19 26 15
+3  27 26 19
+3  28 27 19
+3  28 19 16
+3  29 0 1
+3  30 26 27
+3  29 25 0
+3  18 33 20
+3  34 33 18
+3  34 18 17
+3  34 17 35
+3  32 23 30
+3  32 30 12
+3  12 30 11
+3  30 27 11
+
diff --git a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp
new file mode 100644
index 000000000000..f2efb2182448
--- /dev/null
+++ b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp
@@ -0,0 +1,71 @@
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Surface_mesh.h>
+
+// Simplification function
+#include <CGAL/Surface_mesh_simplification/edge_collapse.h>
+#include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_count_stop_predicate.h>
+#include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h>
+#include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h>
+
+#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+
+//bbox
+#include <CGAL/Polygon_mesh_processing/bbox.h>
+
+#include <iostream>
+#include <fstream>
+
+namespace SMS = CGAL::Surface_mesh_simplification;
+
+typedef CGAL::Simple_cartesian<double>                        Kernel;
+
+typedef Kernel::Point_3                                       Point_3;
+typedef CGAL::Surface_mesh<Point_3>                           Surface;
+
+typedef SMS::LindstromTurk_cost<Surface>                      Cost;
+typedef SMS::LindstromTurk_placement<Surface>                 Placement;
+
+int main(int argc, char** argv)
+{
+  std::cout.precision(17);
+  std::cerr.precision(17);
+
+  std::string filename = (argc > 1) ? argv[1] : "data/far_xy.off";
+
+  Surface mesh;
+  if(!CGAL::IO::read_polygon_mesh(filename, mesh))
+  {
+    std::cerr << "Failed to read input mesh: " << filename << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::cout << "input has " << num_vertices(mesh) << " vertices." << std::endl;
+
+  CGAL::Iso_cuboid_3<Kernel> bbox(CGAL::Polygon_mesh_processing::bbox(mesh));
+
+  // scale a bit the bounding box bbox, because the kernel is SC
+  bbox = { bbox.min() - 0.01 * (bbox.max() - bbox.min()),
+           bbox.max() + 0.01 * (bbox.max() - bbox.min()) };
+
+  std::cout << "Bbox: " << bbox << std::endl;
+
+  SMS::Edge_count_stop_predicate<Surface> stop(num_halfedges(mesh)/10);
+  Placement placement_ref;
+
+  SMS::edge_collapse(mesh, stop,
+                     CGAL::parameters::get_cost(Cost())
+                                      .get_placement(placement_ref));
+
+  CGAL::IO::write_polygon_mesh("out.off", mesh, CGAL::parameters::stream_precision(17));
+
+  for(auto v : vertices(mesh))
+  {
+    if(bbox.has_on_unbounded_side(mesh.point(v)))
+    {
+      std::cerr << "Error: " << mesh.point(v) << " is outside" << std::endl;
+    }
+  }
+
+  std::cout << "output has " << vertices(mesh).size() << " vertices." << std::endl;
+  return EXIT_SUCCESS;
+}

From 3316dc5c01b195e86f1d836587e368f7e8e3b458 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 20 Sep 2023 17:00:58 +0200
Subject: [PATCH 0757/1398] Restore some base code

---
 .../edge_collapse_surface_mesh.cpp                           | 2 +-
 .../CGAL/Surface_mesh_simplification/internal/Common.h       | 5 ++++-
 2 files changed, 5 insertions(+), 2 deletions(-)

diff --git a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_surface_mesh.cpp b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_surface_mesh.cpp
index 3e88f4b090df..a37cb970c930 100644
--- a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_surface_mesh.cpp
+++ b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_surface_mesh.cpp
@@ -49,7 +49,7 @@ int main(int argc, char** argv)
   std::cout << "\nFinished!\n" << r << " edges removed.\n" << surface_mesh.number_of_edges() << " final edges.\n";
   std::cout << "Time elapsed: " << std::chrono::duration_cast<std::chrono::milliseconds>(end_time - start_time).count() << "ms" << std::endl;
 
-  CGAL::IO::write_polygon_mesh((argc > 3) ? argv[3] : "out_SC.off", surface_mesh, CGAL::parameters::stream_precision(17));
+  CGAL::IO::write_polygon_mesh((argc > 3) ? argv[3] : "out.off", surface_mesh, CGAL::parameters::stream_precision(17));
 
   return EXIT_SUCCESS;
 }
diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h
index 5255a0b53591..4ed45a02d1e6 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/internal/Common.h
@@ -114,7 +114,10 @@ inline std::string optional_to_string(const std::optional<T>& o) {
 
   namespace internal { namespace { bool cgal_enable_sms_trace = true; } }
   #define CGAL_SMS_TRACE_IMPL(m) \
-    std::cerr << m << std::endl;
+    if(::internal::cgal_enable_sms_trace) { \
+    std::ostringstream ss; ss << m; std::string s = ss.str(); \
+    /*Surface_simplification_external_trace(s)*/ std::cerr << s << std::endl; \
+    }
 
   #define CGAL_SMS_DEBUG_CODE(code) code
 #else

From 433881020e0271f39bab161a4493c95840e60077 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 21 Sep 2023 10:18:30 +0200
Subject: [PATCH 0758/1398] Remove needless header include

---
 .../Policies/Edge_collapse/internal/Lindstrom_Turk_core.h       | 2 --
 1 file changed, 2 deletions(-)

diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
index dd901c8d89ae..31c12e18c54d 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
@@ -13,8 +13,6 @@
 
 #include <CGAL/license/Surface_mesh_simplification.h>
 
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-
 #include <CGAL/Surface_mesh_simplification/internal/Common.h>
 #include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/LindstromTurk_params.h>
 #include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_profile.h>

From 91f0aeee190950517229c22e008e08552ae3720f Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 21 Sep 2023 14:03:36 +0100
Subject: [PATCH 0759/1398] Move section

---
 .../doc/Box_intersection_d/PackageDescription.txt        | 9 ++++-----
 1 file changed, 4 insertions(+), 5 deletions(-)

diff --git a/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt b/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
index 2e3b3607b687..5f7e72b6313d 100644
--- a/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
+++ b/Box_intersection_d/doc/Box_intersection_d/PackageDescription.txt
@@ -42,15 +42,14 @@
 
 \cgalClassifedRefPages
 
-\cgalCRPSection{Enumerations}
-- `CGAL::Box_intersection_d::Setting`
-- `CGAL::Box_intersection_d::Topology`
-
-
 \cgalCRPSection{Concepts}
 - `BoxIntersectionBox_d`
 - `BoxIntersectionTraits_d`
 
+\cgalCRPSection{Enumerations}
+- `CGAL::Box_intersection_d::Setting`
+- `CGAL::Box_intersection_d::Topology`
+
 \cgalCRPSection{Classes}
 - `CGAL::Box_intersection_d::Box_d<NT,int D,IdPolicy>`
 - `CGAL::Box_intersection_d::Box_with_handle_d<NT, int D, Handle, IdPolicy>`

From e18026d9e7d3be03fbbc38d7b7f6d699df79900f Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 21 Sep 2023 14:08:16 +0100
Subject: [PATCH 0760/1398] linking in the doc

---
 .../doc/Box_intersection_d/Box_intersection_d.txt              | 3 +--
 Box_intersection_d/doc/Box_intersection_d/dependencies         | 1 +
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt b/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt
index 2dcd2db8d30e..b3101a05aaca 100644
--- a/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt
+++ b/Box_intersection_d/doc/Box_intersection_d/Box_intersection_d.txt
@@ -216,7 +216,7 @@ boxes and approximated geometry, which is the case here. It saves us
 the extra space that was needed for the explicit `id`-number in
 the previous example.
 
-We run the self intersection algorithm with the `report_inters`
+We run the self intersection algorithm with the `report_inters()`
 function as callback. This callback reports the intersecting boxes. It
 uses the `handle` and the global `triangles` vector to
 calculate the triangle numbers. Then it checks the triangles
@@ -480,4 +480,3 @@ however, we learned too late about this implementation.
 
 */
 } /* namespace CGAL */
-
diff --git a/Box_intersection_d/doc/Box_intersection_d/dependencies b/Box_intersection_d/doc/Box_intersection_d/dependencies
index a4d5f76715e3..a01021f28b7a 100644
--- a/Box_intersection_d/doc/Box_intersection_d/dependencies
+++ b/Box_intersection_d/doc/Box_intersection_d/dependencies
@@ -4,3 +4,4 @@ STL_Extension
 Algebraic_foundations
 Circulator
 Stream_support
+Polyhedron

From fffea5c616d56b872eb8430e0dd286bdf4ce4658 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 21 Sep 2023 15:29:31 +0200
Subject: [PATCH 0761/1398] add an avx version for archive, it is slower so not
 used in general, CGAL with avx is itself slower

---
 .../internal/Lindstrom_Turk_core.h            | 30 +++++++++++++++++++
 1 file changed, 30 insertions(+)

diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
index 31c12e18c54d..70750a95eca2 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
@@ -155,6 +155,36 @@ private :
   }
 #endif
 
+#ifdef __AVX__
+  static Vector SL_cross_product_avx(const Vector& A, const Vector& B)
+  {
+    const FT ax=A.x(), ay=A.y(), az=A.z();
+    const FT bx=B.x(), by=B.y(), bz=B.z();
+
+    __m256d a = _mm256_set_pd(ay, az, ax, 1.0);
+    __m256d b = _mm256_set_pd(bz, bx, by, 1.0);
+    __m256d c = _mm256_set_pd(az, ax, ay, 1.0);
+    __m256d d = _mm256_set_pd(by, bz, bx, 1.0);
+
+    __m256d s1 = _mm256_sub_pd(b, c);
+    __m256d s2 = _mm256_sub_pd(a, d);
+
+    b = _mm256_mul_pd(a, s1);
+    d = _mm256_mul_pd(c, s2);
+    a = _mm256_add_pd(b, d);
+
+    double res[4];
+    _mm256_storeu_pd(res, a);
+
+//            a  * (b  - c ) + c  * ( a - d);
+//    FT x =  ay * (bz - az) + az * (ay - by);
+//    FT y =  az * (bx - ax) + ax * (az - bz);
+//    FT z =  ax * (by - ay) + ay * (ax - bx);
+
+    return Vector(res[3], res[2], res[1]);
+  }
+#end
+
   static Vector SL_cross_product(const Vector& a, const Vector& b)
   {
     const FT ax=a.x(), ay=a.y(), az=a.z();

From d65cd2d298b12a4156423c6171d93bbb56b77d0d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 21 Sep 2023 16:12:35 +0200
Subject: [PATCH 0762/1398] fix macro

---
 .../Policies/Edge_collapse/internal/Lindstrom_Turk_core.h       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
index 70750a95eca2..d97688dde8bd 100644
--- a/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
+++ b/Surface_mesh_simplification/include/CGAL/Surface_mesh_simplification/Policies/Edge_collapse/internal/Lindstrom_Turk_core.h
@@ -183,7 +183,7 @@ private :
 
     return Vector(res[3], res[2], res[1]);
   }
-#end
+#endif
 
   static Vector SL_cross_product(const Vector& a, const Vector& b)
   {

From 41702c944be33550264119a45b1132d8b0f8b871 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Fri, 22 Sep 2023 16:05:50 +0200
Subject: [PATCH 0763/1398] Added clip box support for image items

---
 .../resources/no_interpolation_shader.frag    | 10 ++++++++
 .../resources/no_interpolation_shader.geom    |  9 ++++++-
 .../resources/no_interpolation_shader.vert    | 24 +++++++++++++++++++
 3 files changed, 42 insertions(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.frag b/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.frag
index 904a0907c095..87d4736352ed 100644
--- a/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.frag
+++ b/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.frag
@@ -7,6 +7,7 @@ in GS_OUT
   flat vec4 color[4];
   vec2 uv;
   flat vec4 prob[4];
+  float dist[6];
 } fs_in;
 
 uniform bool is_two_side;
@@ -15,11 +16,20 @@ uniform vec4 light_diff;
 uniform vec4 light_spec;
 uniform vec4 light_amb;
 uniform float spec_power ;
+uniform bool is_clipbox_on;
 
 out vec4 out_color;
 
 void main(void)
 {
+  if(is_clipbox_on)
+    if(fs_in.dist[0]>0.0 ||
+      fs_in.dist[1]>0.0 ||
+      fs_in.dist[2]>0.0 ||
+      fs_in.dist[3]>0.0 ||
+      fs_in.dist[4]>0.0 ||
+      fs_in.dist[5]>0.0)
+        discard;
   vec4 color;
   //find base color of pixel
   vec4 m1 = mix(fs_in.prob[0], fs_in.prob[1], fs_in.uv.y);
diff --git a/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.geom b/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.geom
index f1b664d07a9e..663fe6c44a82 100644
--- a/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.geom
+++ b/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.geom
@@ -8,6 +8,7 @@ in VS_OUT
   vec4 fP;
   vec3 fN;
   vec4 out_color;
+  float dist[6];
 } gs_in[4];
 
 out GS_OUT
@@ -17,6 +18,7 @@ out GS_OUT
   flat vec4 color[4];
   vec2 uv;
   flat vec4 prob[4];
+  float dist[6];
 } gs_out;
 
 void main(void)
@@ -25,19 +27,21 @@ void main(void)
   gs_out.fN = gs_in[0].fN;
   gs_out.fP = gs_in[0].fP;
   gs_out.uv = vec2(0.0, 0.0);
-
+  gs_out.dist = gs_in[0].dist;
   EmitVertex();
 
   gl_Position = gl_in[1].gl_Position;
   gs_out.fN = gs_in[1].fN;
   gs_out.fP = gs_in[1].fP;
   gs_out.uv = vec2(0.0, 1.0);
+  gs_out.dist = gs_in[1].dist;
   EmitVertex();
 
   gl_Position = gl_in[3].gl_Position;
   gs_out.fN = gs_in[3].fN;
   gs_out.fP = gs_in[3].fP;
   gs_out.uv = vec2(1.0, 0.0);
+  gs_out.dist = gs_in[3].dist;
 
   // We're only writing the output color for the last
   // vertex here because they're flat attributes,
@@ -67,18 +71,21 @@ void main(void)
   gs_out.fN = gs_in[1].fN;
   gs_out.fP = gs_in[1].fP;
   gs_out.uv = vec2(0.0, 1.0);
+  gs_out.dist = gs_in[1].dist;
   EmitVertex();
 
   gl_Position = gl_in[2].gl_Position;
   gs_out.fN = gs_in[2].fN;
   gs_out.fP = gs_in[2].fP;
   gs_out.uv = vec2(1.0, 1.0);
+  gs_out.dist = gs_in[2].dist;
   EmitVertex();
 
   gl_Position = gl_in[3].gl_Position;
   gs_out.fN = gs_in[3].fN;
   gs_out.fP = gs_in[3].fP;
   gs_out.uv = vec2(1.0, 0.0);
+  gs_out.dist = gs_in[3].dist;
   // Again, only write the output color for the last vertex
   gs_out.color[0] = gs_in[0].out_color;
   gs_out.color[1] = gs_in[1].out_color;
diff --git a/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.vert b/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.vert
index 727e4b07d9a8..115e809f9129 100644
--- a/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.vert
+++ b/Polyhedron/demo/Polyhedron/resources/no_interpolation_shader.vert
@@ -9,15 +9,39 @@ out VS_OUT
   vec4 fP;
   vec3 fN;
   vec4 out_color;
+  float dist[6];
 }vs_out;
 
 uniform mat4 mvp_matrix;
 uniform mat4 mv_matrix;
 uniform mat4 norm_matrix;
 
+uniform bool is_clipbox_on;
+uniform mat4 clipbox1;
+uniform mat4 clipbox2;
+
+void compute_distances(void)
+{
+  for(int i=0; i<3; ++i)
+  {
+    vs_out.dist[i]=
+    clipbox1[i][0]*vertex.x+
+    clipbox1[i][1]*vertex.y+
+    clipbox1[i][2]*vertex.z +
+    clipbox1[i][3];
+    vs_out.dist[i+3]=
+    clipbox2[i][0]*vertex.x+
+    clipbox2[i][1]*vertex.y+
+    clipbox2[i][2]*vertex.z +
+    clipbox2[i][3];
+  }
+}
+
 void main(void)
 {
    vs_out.out_color=colors;
+   if(is_clipbox_on)
+    compute_distances();
    vs_out.fP = mv_matrix * vertex;
    vs_out.fN = mat3(norm_matrix)* normals;
    gl_Position = mvp_matrix * vertex;

From 87003941220f792096961bb9a3896afc5afdfb2b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 24 Sep 2023 22:52:20 +0200
Subject: [PATCH 0764/1398] boost::mpl::if_ -> std::conditional

---
 .../CGAL/AABB_face_graph_triangle_primitive.h |  9 ++-
 .../AABB_halfedge_graph_segment_primitive.h   |  9 ++-
 .../include/CGAL/number_utils.h               | 16 ++---
 .../include/CGAL/Arr_batched_point_location.h |  3 +-
 .../include/CGAL/Arr_overlay_2.h              |  5 +-
 .../include/CGAL/Arr_tags.h                   | 59 +++++++++----------
 .../CGAL/Arr_vertical_decomposition_2.h       |  3 +-
 .../Arr_traits_adaptor_2_dispatching.h        | 23 +++-----
 .../Arrangement_on_surface_2_global.h         | 10 ++--
 .../Arrangement_on_surface_2/test_tags.cpp    |  1 -
 .../test_traits_dispatching.cpp               |  1 -
 .../internal/OM_iterator_from_circulator.h    | 29 ++++-----
 .../internal/initialized_index_maps_helpers.h |  4 +-
 .../CGAL/boost/graph/named_params_helper.h    | 18 +++---
 BGL/include/CGAL/boost/graph/properties.h     | 10 ++--
 .../CGAL/boost/graph/properties_OpenMesh.h    | 15 +++--
 BGL/include/CGAL/boost/graph/property_maps.h  |  1 -
 .../CGAL/Combinatorial_map_iterators_base.h   | 34 +++++------
 .../CGAL/Compact_container_with_index.h       | 11 ++--
 Filtered_kernel/include/CGAL/Lazy_kernel.h    |  1 -
 .../CGAL/Generalized_map_iterators_base.h     |  1 -
 .../include/CGAL/sibson_gradient_fitting.h    |  1 -
 Kernel_23/include/CGAL/Kernel_traits.h        |  1 -
 Mesh_3/benchmark/Mesh_3/StdAfx.h              |  2 -
 .../Implicit_to_labeling_function_wrapper.h   |  7 +--
 .../Image_to_labeled_function_wrapper.h       |  1 -
 Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h   |  7 +--
 Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h  |  7 +--
 .../CGAL/Mesh_3/Triangulation_helpers.h       |  1 -
 .../CGAL/NewKernel_d/Cartesian_filter_K.h     |  1 -
 .../NewKernel_d/Cartesian_static_filters.h    |  7 +--
 .../CGAL/NewKernel_d/KernelD_converter.h      |  9 ++-
 .../include/CGAL/NewKernel_d/functor_tags.h   |  3 +-
 NewKernel_d/include/CGAL/NewKernel_d/utils.h  |  8 +--
 NewKernel_d/test/NewKernel_d/Epick_d.cpp      |  4 +-
 Number_types/include/CGAL/Lazy_exact_nt.h     | 10 ++--
 Number_types/include/CGAL/Quotient.h          |  8 +--
 .../Algebraic_structure_traits.h              |  8 +--
 .../CGAL/Sqrt_extension/Coercion_traits.h     |  4 +-
 ...t_to_labeled_subdomains_function_wrapper.h |  7 +--
 .../CGAL/Periodic_3_function_wrapper.h        |  7 +--
 .../CGAL/Periodic_3_regular_triangulation_3.h |  1 -
 ...ABB_traversal_traits_with_transformation.h |  1 -
 .../internal/Corefinement/face_graph_utils.h  |  7 +--
 .../Polygon_mesh_processing/intersection.h    |  1 -
 .../CGAL/Polygon_mesh_processing/locate.h     |  1 -
 .../include/CGAL/Polygon_mesh_slicer.h        |  9 ++-
 Polynomial/include/CGAL/Polynomial.h          |  1 -
 .../include/CGAL/Polynomial/Polynomial_type.h |  6 +-
 Polynomial/include/CGAL/Polynomial_traits_d.h |  6 +-
 .../include/CGAL/Dynamic_property_map.h       |  7 +--
 .../CGAL/Mesh_complex_3_in_triangulation_3.h  |  1 -
 .../include/CGAL/Compact_container.h          | 10 ++--
 .../CGAL/Concurrent_compact_container.h       |  4 +-
 .../include/CGAL/Handle_with_policy.h         |  6 +-
 .../include/CGAL/Named_function_parameters.h  | 13 ++--
 .../include/CGAL/transforming_iterator.h      |  7 +--
 .../include/CGAL/Skin_surface_base_3.h        |  1 -
 .../include/CGAL/Fuzzy_iso_box.h              |  2 -
 .../include/CGAL/Search_traits_adapter.h      | 12 ++--
 .../Straight_skeleton_aux.h                   | 11 ++--
 .../CGAL/Constrained_triangulation_2.h        |  5 +-
 .../include/CGAL/Regular_triangulation_2.h    |  1 -
 .../include/CGAL/Triangulation_hierarchy_2.h  |  1 -
 .../include/CGAL/Regular_triangulation_3.h    |  1 -
 ...n_cell_base_with_weighted_circumcenter_3.h |  1 -
 .../include/CGAL/Triangulation_3.h            |  1 -
 .../include/CGAL/Triangulation_hierarchy_3.h  |  1 -
 .../include/CGAL/_test_cls_delaunay_3.h       |  1 -
 .../CGAL/_test_cls_parallel_triangulation_3.h |  1 -
 .../test_regular_insert_range_with_info.cpp   | 18 +++---
 71 files changed, 212 insertions(+), 292 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_face_graph_triangle_primitive.h b/AABB_tree/include/CGAL/AABB_face_graph_triangle_primitive.h
index 5422c84b2ae6..021cdc6270ab 100644
--- a/AABB_tree/include/CGAL/AABB_face_graph_triangle_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_face_graph_triangle_primitive.h
@@ -21,7 +21,6 @@
 #include <CGAL/AABB_primitive.h>
 #include <CGAL/boost/graph/property_maps.h>
 #include <CGAL/Default.h>
-#include <boost/mpl/if.hpp>
 
 namespace CGAL {
 
@@ -57,9 +56,9 @@ template < class FaceGraph,
            class CacheDatum=Tag_false >
 class AABB_face_graph_triangle_primitive
 #ifndef DOXYGEN_RUNNING
-  : public AABB_primitive<typename boost::mpl::if_<OneFaceGraphPerTree,
-                                                   typename boost::graph_traits<FaceGraph>::face_descriptor,
-                                                   std::pair<typename boost::graph_traits<FaceGraph>::face_descriptor, const FaceGraph*> >::type,
+  : public AABB_primitive<std::conditional_t<OneFaceGraphPerTree::value,
+                                             typename boost::graph_traits<FaceGraph>::face_descriptor,
+                                             std::pair<typename boost::graph_traits<FaceGraph>::face_descriptor, const FaceGraph*> >,
                         Triangle_from_face_descriptor_map<
                           FaceGraph,
                           typename Default::Get<VertexPointPMap,
@@ -76,7 +75,7 @@ class AABB_face_graph_triangle_primitive
 {
   typedef typename Default::Get<VertexPointPMap, typename boost::property_map< FaceGraph, vertex_point_t>::const_type >::type VertexPointPMap_;
   typedef typename boost::graph_traits<FaceGraph>::face_descriptor FD;
-  typedef typename boost::mpl::if_<OneFaceGraphPerTree, FD, std::pair<FD, const FaceGraph*> >::type Id_;
+  typedef std::conditional_t<OneFaceGraphPerTree::value, FD, std::pair<FD, const FaceGraph*> > Id_;
 
   typedef Triangle_from_face_descriptor_map<FaceGraph,VertexPointPMap_>  Triangle_property_map;
   typedef One_point_from_face_descriptor_map<FaceGraph,VertexPointPMap_> Point_property_map;
diff --git a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
index 135682273199..3f5481d0cfe1 100644
--- a/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
+++ b/AABB_tree/include/CGAL/AABB_halfedge_graph_segment_primitive.h
@@ -24,7 +24,6 @@
 #include <iterator>
 #include <boost/mpl/and.hpp>
 #include <CGAL/type_traits/is_iterator.h>
-#include <boost/mpl/if.hpp>
 
 #include <CGAL/Default.h>
 
@@ -70,9 +69,9 @@ template < class HalfedgeGraph,
            class CacheDatum = Tag_false >
 class AABB_halfedge_graph_segment_primitive
 #ifndef DOXYGEN_RUNNING
-  : public AABB_primitive<  typename boost::mpl::if_<OneHalfedgeGraphPerTree,
-                                                     typename boost::graph_traits<HalfedgeGraph>::edge_descriptor,
-                                                     std::pair<typename boost::graph_traits<HalfedgeGraph>::edge_descriptor, const HalfedgeGraph*> >::type,
+  : public AABB_primitive< std::conditional_t<OneHalfedgeGraphPerTree::value,
+                                              typename boost::graph_traits<HalfedgeGraph>::edge_descriptor,
+                                              std::pair<typename boost::graph_traits<HalfedgeGraph>::edge_descriptor, const HalfedgeGraph*> >,
                             Segment_from_edge_descriptor_map<
                               HalfedgeGraph,
                               typename Default::Get<VertexPointPMap,
@@ -89,7 +88,7 @@ class AABB_halfedge_graph_segment_primitive
 {
   typedef typename Default::Get<VertexPointPMap,typename boost::property_map< HalfedgeGraph,vertex_point_t>::const_type >::type  VertexPointPMap_;
   typedef typename boost::graph_traits<HalfedgeGraph>::edge_descriptor ED;
-  typedef typename boost::mpl::if_<OneHalfedgeGraphPerTree, ED, std::pair<ED, const HalfedgeGraph*> >::type Id_;
+  typedef std::conditional_t<OneHalfedgeGraphPerTree::value, ED, std::pair<ED, const HalfedgeGraph*> > Id_;
 
   typedef Segment_from_edge_descriptor_map<HalfedgeGraph,VertexPointPMap_>  Segment_property_map;
   typedef Source_point_from_edge_descriptor_map<HalfedgeGraph,VertexPointPMap_> Point_property_map;
diff --git a/Algebraic_foundations/include/CGAL/number_utils.h b/Algebraic_foundations/include/CGAL/number_utils.h
index c17823d72b9d..5a5bc2d242d3 100644
--- a/Algebraic_foundations/include/CGAL/number_utils.h
+++ b/Algebraic_foundations/include/CGAL/number_utils.h
@@ -194,21 +194,21 @@ root_of( int k, Input_iterator begin, Input_iterator end ) {
 template< class Number_type >
 inline
 // select a Is_zero functor
-typename boost::mpl::if_c<
- ::std::is_same< typename Algebraic_structure_traits< Number_type >::Is_zero,
- Null_functor  >::value ,
+typename std::conditional_t<
+ std::is_same_v< typename Algebraic_structure_traits< Number_type >::Is_zero,
+ Null_functor  >,
   typename Real_embeddable_traits< Number_type >::Is_zero,
   typename Algebraic_structure_traits< Number_type >::Is_zero
->::type::result_type
+>::result_type
 is_zero( const Number_type& x ) {
     // We take the Algebraic_structure_traits<>::Is_zero functor by default. If it
     //  is not available, we take the Real_embeddable_traits functor
-    typename ::boost::mpl::if_c<
-        ::std::is_same<
+    std::conditional_t<
+        std::is_same_v<
              typename Algebraic_structure_traits< Number_type >::Is_zero,
-             Null_functor >::value ,
+             Null_functor > ,
        typename Real_embeddable_traits< Number_type >::Is_zero,
-       typename Algebraic_structure_traits< Number_type >::Is_zero >::type
+       typename Algebraic_structure_traits< Number_type >::Is_zero >
        is_zero;
 return is_zero( x );
 }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
index 42715621e4b2..85ba6ccc235f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_batched_point_location.h
@@ -26,7 +26,6 @@
 #include <CGAL/Surface_sweep_2/Arr_batched_pl_ss_visitor.h>
 
 #include <vector>
-#include <boost/mpl/if.hpp>
 #include <boost/type_traits.hpp>
 
 namespace CGAL {
@@ -120,7 +119,7 @@ locate(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
    */
-  typename boost::mpl::if_<std::is_same<Gt2, Bgt2>, const Bgt2&, Bgt2>::type
+  std::conditional_t<std::is_same_v<Gt2, Bgt2>, const Bgt2&, Bgt2>
     ex_traits(*geom_traits);
 
   // Define the sweep-line visitor and perform the sweep.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
index 2951b1983fe8..dfa6fb89ffc1 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_overlay_2.h
@@ -25,7 +25,6 @@
 
 #include <vector>
 #include <optional>
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/or.hpp>
 #include <boost/type_traits.hpp>
 
@@ -247,8 +246,8 @@ overlay(const Arrangement_on_surface_2<GeometryTraitsA_2, TopologyTraitsA>& arr1
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
    */
-  typename boost::mpl::if_<std::is_same<Gt_adaptor_2, Ovl_gt2>,
-                           const Ovl_gt2&, Ovl_gt2>::type
+  std::conditional_t<std::is_same_v<Gt_adaptor_2, Ovl_gt2>,
+                     const Ovl_gt2&, Ovl_gt2>
     ex_traits(*traits_adaptor);
 
   Ovl_visitor visitor(&arr1, &arr2, &arr, &ovl_tr);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_tags.h b/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
index 91313be6c5d8..1aac06155855 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
@@ -21,7 +21,6 @@
 #include <CGAL/config.h>
 #include <boost/type_traits.hpp>
 #include <boost/mpl/bool.hpp>
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/and.hpp>
 #include <boost/mpl/or.hpp>
 #include <boost/mpl/not.hpp>
@@ -246,14 +245,14 @@ struct Arr_all_sides_not_finite_tag :
 struct Arr_not_all_sides_not_finite_tag :
   public virtual Arr_not_all_sides_oblivious_tag {};
 
-typedef boost::mpl::bool_<true>                                 Arr_true;
-typedef boost::mpl::bool_<false>                                Arr_false;
+typedef std::true_type                                          Arr_true;
+typedef std::false_type                                         Arr_false;
 
 template <typename ArrSideCategory>
 struct Arr_is_side_oblivious {
   typedef ArrSideCategory                                       Side_cat;
   typedef std::is_same<Side_cat, Arr_oblivious_side_tag>        Is_same;
-  typedef boost::mpl::if_<Is_same, Arr_true, Arr_false>         result;
+  typedef std::conditional<Is_same::value, Arr_true, Arr_false> result;
   typedef typename result::type                                 type;
 };
 
@@ -261,7 +260,7 @@ template <typename ArrSideCategory>
 struct Arr_is_side_open {
   typedef ArrSideCategory                                       Side_cat;
   typedef std::is_same<Side_cat, Arr_open_side_tag>             Is_same;
-  typedef boost::mpl::if_<Is_same, Arr_true, Arr_false>         result;
+  typedef std::conditional<Is_same,::value Arr_true, Arr_false> result;
   typedef typename result::type                                 type;
 };
 
@@ -269,7 +268,7 @@ template <typename ArrSideCategory>
 struct Arr_is_side_identified {
   typedef ArrSideCategory                                       Side_cat;
   typedef std::is_same<Side_cat, Arr_identified_side_tag>       Is_same;
-  typedef boost::mpl::if_<Is_same, Arr_true, Arr_false>         result;
+  typedef std::conditional<Is_same::value, Arr_true, Arr_false> result;
   typedef typename result::type                                 type;
 };
 
@@ -277,7 +276,7 @@ template <typename ArrSideCategory>
 struct Arr_is_side_contracted {
   typedef ArrSideCategory                                       Side_cat;
   typedef std::is_same<Side_cat, Arr_contracted_side_tag>       Is_same;
-  typedef boost::mpl::if_<Is_same, Arr_true, Arr_false>         result;
+  typedef std::conditional<Is_same::value, Arr_true, Arr_false> result;
   typedef typename result::type                                 type;
 };
 
@@ -285,7 +284,7 @@ template <typename ArrSideCategory>
 struct Arr_is_side_closed {
   typedef ArrSideCategory                                       Side_cat;
   typedef std::is_same<Side_cat, Arr_closed_side_tag>           Is_same;
-  typedef boost::mpl::if_<Is_same, Arr_true, Arr_false>         result;
+  typedef std::conditional<Is_same::value, Arr_true, Arr_false> result;
   typedef typename result::type                                 type;
 };
 
@@ -307,10 +306,10 @@ struct Arr_all_sides_oblivious_category {
   /*! Boolean tag that is Arr_all_sides_oblivious_tag if all sides are
    * oblivious, otherwise Arr_not_all_sides_oblivious_tag
    */
-  typedef typename boost::mpl::if_<boost::mpl::and_<Lef_obl, Rig_obl,
-                                                    Bot_obl, Top_obl>,
-                                   Arr_all_sides_oblivious_tag,
-                                   Arr_not_all_sides_oblivious_tag>::type
+  typedef std::conditional_t<Lef_obl::value && Rig_obl::value &&
+                             Bot_obl::value && Top_obl::value,
+                             Arr_all_sides_oblivious_tag,
+                             Arr_not_all_sides_oblivious_tag>
     result;
 };
 
@@ -340,10 +339,10 @@ struct Arr_all_sides_not_open_category {
   /*! Boolean tag that is Arr_all_sides_not_open_tag if all sides are not-open,
    * otherwise Arr_not_all_sides_not_open_tag
    */
-  typedef typename boost::mpl::if_<boost::mpl::and_<Lef_not_ope, Rig_not_ope,
-                                                    Bot_not_ope, Top_not_ope>,
-                                   Arr_all_sides_not_open_tag,
-                                   Arr_not_all_sides_not_open_tag>::type
+  typedef std::conditional_t<Lef_not_ope::value && Rig_not_ope::value &&
+                             Bot_not_ope::value && Top_not_ope::value,
+                             Arr_all_sides_not_open_tag,
+                             Arr_not_all_sides_not_open_tag>
     result;
 };
 
@@ -379,18 +378,18 @@ struct Arr_sides_category {
   typedef boost::mpl::or_<Bot_obl, Bot_ope>                     Bot_obl_or_ope;
   typedef boost::mpl::or_<Top_obl, Top_ope>                     Top_obl_or_ope;
 
-  typedef typename boost::mpl::if_<boost::mpl::and_<Lef_obl_or_ope,
-                                                    Rig_obl_or_ope,
-                                                    Bot_obl_or_ope,
-                                                    Top_obl_or_ope>,
-                                   Arr_all_sides_not_finite_tag,
-                                   Arr_not_all_sides_not_finite_tag>::type
+  typedef std::conditional_t<Lef_obl_or_ope::value &&
+                             Rig_obl_or_ope::value &&
+                             Bot_obl_or_ope::value &&
+                             Top_obl_or_ope::value,
+                             Arr_all_sides_not_finite_tag,
+                             Arr_not_all_sides_not_finite_tag>
     tmp;
 
 public:
-  typedef typename boost::mpl::if_<boost::mpl::and_<Lef_obl, Rig_obl,
-                                                    Bot_obl, Top_obl>,
-                                   Arr_all_sides_oblivious_tag, tmp>::type
+  typedef std::conditional_t<Lef_obl::value && Rig_obl::value &&
+                             Bot_obl::value && Top_obl::value,
+                             Arr_all_sides_oblivious_tag, tmp>
     result;
 };
 
@@ -532,11 +531,11 @@ struct Arr_two_sides_category {
     Is_open;
 
 public:
-  typedef typename boost::mpl::if_<Is_identified, Arr_has_identified_side_tag,
-    typename boost::mpl::if_<Is_contracted, Arr_has_contracted_side_tag,
-      typename boost::mpl::if_<Is_closed, Arr_has_closed_side_tag,
-        typename boost::mpl::if_<Is_open, Arr_has_open_side_tag,
-          Arr_all_sides_oblivious_tag>::type>::type>::type>::type
+  typedef std::conditional_t<Is_identified::value, Arr_has_identified_side_tag,
+    std::conditional_t<Is_contracted::value, Arr_has_contracted_side_tag,
+      std::conditional_t<Is_closed::value, Arr_has_closed_side_tag,
+        std::conditional_t<Is_open::value, Arr_has_open_side_tag,
+          Arr_all_sides_oblivious_tag>>>>
     result;
 };
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h
index 75c8f25e0c96..099f44192ee5 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_vertical_decomposition_2.h
@@ -24,7 +24,6 @@
 #include <CGAL/Surface_sweep_2/Arr_vert_decomp_ss_visitor.h>
 
 #include <vector>
-#include <boost/mpl/if.hpp>
 #include <boost/type_traits.hpp>
 
 namespace CGAL {
@@ -124,7 +123,7 @@ decompose(const Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
    */
-  typename boost::mpl::if_<std::is_same<Gt2, Vgt2>, const Vgt2&, Vgt2>::type
+  std::conditional_t<std::is_same_v<Gt2, Vgt2>, const Vgt2&, Vgt2>
     ex_traits(*geom_traits);
 
   // Define the sweep-line visitor and perform the sweep.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2_dispatching.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2_dispatching.h
index e4533596dd2b..283b2dc66b5c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2_dispatching.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2_dispatching.h
@@ -17,7 +17,6 @@
 
 
 #include <boost/mpl/bool.hpp>
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/and.hpp>
 #include <boost/mpl/or.hpp>
 #include <boost/mpl/not.hpp>
@@ -59,25 +58,21 @@ struct Or_traits {
 
 private:
 
-  typedef boost::mpl::bool_< true > true_;
-  typedef boost::mpl::bool_< false > false_;
+  typedef std::conditional<
+       std::is_same_v< Arr_smaller_implementation_tag, Arr_use_traits_tag >,
+       std::true_type, std::false_type > Smaller_traits;
 
-  typedef boost::mpl::if_<
-       std::is_same< Arr_smaller_implementation_tag, Arr_use_traits_tag >,
-       true_, false_ > Smaller_traits;
-
-  typedef boost::mpl::if_<
-       std::is_same< Arr_larger_implementation_tag, Arr_use_traits_tag >,
-       true_, false_ > Larger_traits;
+  typedef std::conditional_t_<
+       std::is_same_v< Arr_larger_implementation_tag, Arr_use_traits_tag >,
+       std::true_type, std::false_type > Larger_traits;
 
 public:
 
   //! the result type (if one side asks for traits, then ask traits!
   //! Or vice versa: If both ask for dummy, then dummy!)
-  typedef typename boost::mpl::if_<
-              boost::mpl::or_< Smaller_traits, Larger_traits >,
-              Arr_use_traits_tag,
-              Arr_use_dummy_tag >::type type;
+  typedef std::conditional_t<
+              Smaller_traits, Larger_traits >::value || Arr_use_traits_tag::value,
+              Arr_use_dummy_tag > type;
 
 };
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
index 0f2957d47149..ee072c95778c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
@@ -23,8 +23,6 @@
 
 #include <list>
 #include <boost/type_traits.hpp>
-#include <boost/mpl/if.hpp>
-#include <boost/type_traits.hpp>
 #include <list>
 
 #include <CGAL/Arr_accessor.h>
@@ -271,7 +269,7 @@ insert_empty(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
    */
-  typename boost::mpl::if_<std::is_same<Gt2, Cgt2>, const Cgt2&, Cgt2>::type
+  std::conditional_t<std::is_same_v<Gt2, Cgt2>, const Cgt2&, Cgt2>
     traits(*geom_traits);
 
   // Define a surface-sweep instance and perform the sweep:
@@ -326,7 +324,7 @@ void insert_empty(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>&
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
    */
-  typename boost::mpl::if_<std::is_same<Gt2, Cgt2>, const Cgt2&, Cgt2>::type
+  std::conditional_t<std::is_same_v<Gt2, Cgt2>, const Cgt2&, Cgt2>
     traits(*geom_traits);
 
   // Define a surface-sweep instance and perform the sweep.
@@ -379,7 +377,7 @@ void insert_non_empty(Arrangement_on_surface_2<GeometryTraits_2,
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
    */
-  typename boost::mpl::if_<std::is_same<Gt2, Igt2>, const Igt2&, Igt2>::type
+  std::conditional_t<std::is_same_v<Gt2, Igt2>, const Igt2&, Igt2>
     traits(*geom_traits);
 
   // Create a set of existing as well as new curves and points.
@@ -979,7 +977,7 @@ non_intersecting_insert_non_empty(Arrangement_on_surface_2<GeometryTraits_2,
    * Use the form 'A a(*b);' and not ''A a = b;' to handle the case where A has
    * only an implicit constructor, (which takes *b as a parameter).
    */
-  typename boost::mpl::if_<std::is_same<Gt2, Igt2>, const Igt2&, Igt2>::type
+  std::conditional_t<std::is_same_v<Gt2, Igt2>, const Igt2&, Igt2>
     traits(*geom_traits);
 
   // Create a set of existing as well as new curves and points.
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_tags.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_tags.cpp
index 81eae4204966..a86325de2afc 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_tags.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_tags.cpp
@@ -6,7 +6,6 @@
 
 #include <boost/mpl/assert.hpp>
 #include <boost/mpl/bool.hpp>
-#include <boost/mpl/if.hpp>
 
 struct Traits1 {
   typedef CGAL::Arr_open_side_tag Left_side_category;
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_traits_dispatching.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_traits_dispatching.cpp
index 5c8e19fa12e0..ce17f3b9105e 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_traits_dispatching.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_traits_dispatching.cpp
@@ -4,7 +4,6 @@
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2_dispatching.h>
 
 #include <boost/mpl/bool.hpp>
-#include <boost/mpl/if.hpp>
 
 int dispatch(CGAL::Arr_use_dummy_tag) {
   return 0;
diff --git a/BGL/include/CGAL/boost/graph/internal/OM_iterator_from_circulator.h b/BGL/include/CGAL/boost/graph/internal/OM_iterator_from_circulator.h
index e726e161a6bd..01104c546804 100644
--- a/BGL/include/CGAL/boost/graph/internal/OM_iterator_from_circulator.h
+++ b/BGL/include/CGAL/boost/graph/internal/OM_iterator_from_circulator.h
@@ -20,8 +20,6 @@
 #include <boost/operators.hpp>
 #include <boost/concept_check.hpp>
 
-#include <boost/mpl/if.hpp>
-
 namespace CGAL {
 
 // adapted from circulator.h, does not support
@@ -45,23 +43,20 @@ class OM_iterator_from_circulator {
 
   typedef typename I__traits::iterator_category iterator_category;
 
-  typedef typename
-  boost::mpl::if_c<  Prevent_deref
-                   , C
-                   , typename C::value_type
-                  >::type             value_type;
+  typedef std::conditional_t<  Prevent_deref
+                             , C
+                             , typename C::value_type>
+                                                         value_type;
 
   typedef typename C::difference_type difference_type;
-  typedef typename
-  boost::mpl::if_c<  Prevent_deref
-                   , C&
-                   , typename C::reference
-                  >::type             reference;
-  typedef typename
-  boost::mpl::if_c<  Prevent_deref
-                   , C*
-                   , typename C::reference
-                  >::type             pointer;
+  typedef std::conditional_t<  Prevent_deref
+                             , C&
+                             , typename C::reference
+                            >             reference;
+  typedef std::conditional_t<  Prevent_deref
+                             , C*
+                             , typename C::reference
+                            >             pointer;
 
   OM_iterator_from_circulator(){}
 
diff --git a/BGL/include/CGAL/boost/graph/internal/initialized_index_maps_helpers.h b/BGL/include/CGAL/boost/graph/internal/initialized_index_maps_helpers.h
index 2d85e38d35c1..eddefcec7fb2 100644
--- a/BGL/include/CGAL/boost/graph/internal/initialized_index_maps_helpers.h
+++ b/BGL/include/CGAL/boost/graph/internal/initialized_index_maps_helpers.h
@@ -276,8 +276,8 @@ class GetInitializedIndexMap
 {
 public:
   // Check if there is an internal property map; if not, we must a dynamic property map
-  typedef typename boost::mpl::if_c<
-      CGAL::graph_has_property<Graph, Tag>::value, Tag, DynamicTag>::type    Final_tag;
+  typedef std::conditional_t<
+      CGAL::graph_has_property<Graph, Tag>::value, Tag, DynamicTag>    Final_tag;
 
   typedef typename internal_np::Lookup_named_param_def<
       PropertyTag,
diff --git a/BGL/include/CGAL/boost/graph/named_params_helper.h b/BGL/include/CGAL/boost/graph/named_params_helper.h
index 1e0efd6faa60..4dce0049b1ab 100644
--- a/BGL/include/CGAL/boost/graph/named_params_helper.h
+++ b/BGL/include/CGAL/boost/graph/named_params_helper.h
@@ -20,7 +20,6 @@
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/property_map.h>
 
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/has_xxx.hpp>
 
 #include <fstream>
@@ -43,11 +42,10 @@ class property_map_selector
 {
 public:
   typedef typename graph_has_property<PolygonMesh, PropertyTag>::type Has_internal_pmap;
-  typedef typename boost::mpl::if_c<Has_internal_pmap::value,
-                                    typename boost::property_map<PolygonMesh, PropertyTag>::type,
-                                    typename boost::cgal_no_property::type
-                                    >::type type;
-  typedef typename boost::mpl::if_c<Has_internal_pmap::value,
+  typedef std::conditional_t<Has_internal_pmap::value,
+                             typename boost::property_map<PolygonMesh, PropertyTag>::type,
+                             typename boost::cgal_no_property::type> type;
+  typedef std::conditional_t<Has_internal_pmap::value,
                                     typename boost::property_map<PolygonMesh, PropertyTag>::const_type,
                                     typename boost::cgal_no_property::const_type
                                     >::type const_type;
@@ -209,10 +207,10 @@ struct GetGeomTraits_impl<PolygonMesh, internal_np::Param_not_found, NamedParame
 
   struct Fake_GT {}; // to be used if there is no internal vertex_point_map in PolygonMesh
 
-  typedef typename boost::mpl::if_c<Has_internal_pmap::value ||
-                                    !std::is_same<internal_np::Param_not_found, NP_vpm>::value,
-                                    typename GetK<PolygonMesh, NamedParametersVPM>::Kernel,
-                                    Fake_GT>::type type;
+  typedef std::conditional_t<Has_internal_pmap::value ||
+                             !std::is_same<internal_np::Param_not_found, NP_vpm>::value,
+                             typename GetK<PolygonMesh, NamedParametersVPM>::Kernel,
+                             Fake_GT> type;
 };
 
 template <typename PolygonMesh,
diff --git a/BGL/include/CGAL/boost/graph/properties.h b/BGL/include/CGAL/boost/graph/properties.h
index 80b02a191a14..1fd71599ad10 100644
--- a/BGL/include/CGAL/boost/graph/properties.h
+++ b/BGL/include/CGAL/boost/graph/properties.h
@@ -140,9 +140,9 @@ struct Point_accessor<Handle, ValueType, ConstReference, true>
   typedef ValueType                      value_type;
   typedef Handle                         key_type;
 
-  typedef typename boost::mpl::if_< std::is_reference<ConstReference>,
-                                    ValueType&,
-                                    ValueType >::type Reference;
+  typedef std::conditional_t< std::is_reference<ConstReference>,
+                              ValueType&,
+                              ValueType > Reference;
 
   Point_accessor() {}
   Point_accessor(Point_accessor<Handle, ValueType, Reference, false>) {}
@@ -172,9 +172,9 @@ struct Is_writable_property_map<PropertyMap, boost::read_write_property_map_tag>
 // property map must define.
 template <typename PropertyMap>
 struct Is_writable_property_map<PropertyMap, boost::lvalue_property_map_tag>
-  : boost::mpl::if_c<std::is_const<typename std::remove_reference<
+  : std::conditional_t<std::is_const<typename std::remove_reference<
                        typename boost::property_traits<PropertyMap>::reference>::type>::value,
-                     CGAL::Tag_false, CGAL::Tag_true>::type
+                       CGAL::Tag_false, CGAL::Tag_true>
 { };
 
 } // namespace internal
diff --git a/BGL/include/CGAL/boost/graph/properties_OpenMesh.h b/BGL/include/CGAL/boost/graph/properties_OpenMesh.h
index 861f5aea98b6..f6f56cea7ef8 100644
--- a/BGL/include/CGAL/boost/graph/properties_OpenMesh.h
+++ b/BGL/include/CGAL/boost/graph/properties_OpenMesh.h
@@ -13,7 +13,6 @@
 #include <CGAL/assertions.h>
 #include <CGAL/boost/graph/properties.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <boost/mpl/if.hpp>
 
 #ifndef OPEN_MESH_CLASS
   #error OPEN_MESH_CLASS is not defined
@@ -29,13 +28,13 @@ namespace CGAL {
 template <typename Mesh, typename Descriptor, typename Value>
 class OM_pmap {
 public:
-  typedef typename boost::mpl::if_<std::is_same<Descriptor, typename boost::graph_traits<Mesh>::vertex_descriptor>,
-                                   OpenMesh::VPropHandleT<Value>,
-                                   typename boost::mpl::if_<std::is_same<Descriptor, typename boost::graph_traits<Mesh>::face_descriptor>,
-                                                            OpenMesh::FPropHandleT<Value>,
-                                                            typename boost::mpl::if_<std::is_same<Descriptor, typename boost::graph_traits<Mesh>::halfedge_descriptor>,
-                                                                                     OpenMesh::HPropHandleT<Value>,
-                                                                                     OpenMesh::EPropHandleT<Value> >::type>::type>::type H;
+  typedef std::conditional_t<std::is_same_v<Descriptor, typename boost::graph_traits<Mesh>::vertex_descriptor>,
+                             OpenMesh::VPropHandleT<Value>,
+                             std::conditional_t<std::is_same_v<Descriptor, typename boost::graph_traits<Mesh>::face_descriptor>,
+                                                OpenMesh::FPropHandleT<Value>,
+                                                std::conditional_t<std::is_same_v<Descriptor, typename boost::graph_traits<Mesh>::halfedge_descriptor>,
+                                                                   OpenMesh::HPropHandleT<Value>,
+                                                                   OpenMesh::EPropHandleT<Value> >>> H;
 
   typedef boost::lvalue_property_map_tag category;
 
diff --git a/BGL/include/CGAL/boost/graph/property_maps.h b/BGL/include/CGAL/boost/graph/property_maps.h
index aab29d9b8811..b6973feb65c8 100644
--- a/BGL/include/CGAL/boost/graph/property_maps.h
+++ b/BGL/include/CGAL/boost/graph/property_maps.h
@@ -15,7 +15,6 @@
 
 #include <CGAL/property_map.h>
 #include <CGAL/boost/graph/properties.h>
-#include <boost/mpl/if.hpp>
 
 namespace CGAL{
 
diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h b/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
index a50266f76592..555dc554c58e 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_iterators_base.h
@@ -18,7 +18,6 @@
 #include <CGAL/Compact_container_with_index.h>
 
 #include <queue>
-#include <boost/mpl/if.hpp>
 
 #include <type_traits>
 
@@ -68,24 +67,24 @@ namespace CGAL {
   class CMap_dart_iterator;
 
   template < typename Map_,bool Const>
-  class CMap_dart_iterator<Map_, Const, Tag_false>: public boost::mpl::if_c< Const,
+  class CMap_dart_iterator<Map_, Const, Tag_false>: public std::conditional_t< Const,
       typename Map_::Dart_container::const_iterator,
-      typename Map_::Dart_container::iterator>::type
+      typename Map_::Dart_container::iterator>
     //public internal::CC_iterator<typename Map_::Dart_container,Const>
   {
   public:
     typedef CMap_dart_iterator<Map_,Const> Self;
 
-    typedef typename boost::mpl::if_c< Const,
+    typedef std::conditional_t< Const,
           typename Map_::Dart_container::const_iterator,
-          typename Map_::Dart_container::iterator>::type Base;
+          typename Map_::Dart_container::iterator> Base;
     // typedef internal::CC_iterator<typename Map_::Dart_container,Const> Base;
 
-    typedef typename boost::mpl::if_c< Const,
-                                       typename Map_::Dart_const_descriptor,
-                                       typename Map_::Dart_descriptor>::type
+    typedef std::conditional_t< Const,
+                                typename Map_::Dart_const_descriptor,
+                                typename Map_::Dart_descriptor>
                                      Dart_descriptor;
-    typedef typename boost::mpl::if_c< Const, const Map_, Map_>::type Map;
+    typedef std::conditional_t< Const, const Map_, Map_> Map;
 
     typedef std::input_iterator_tag iterator_category;
     typedef typename Base::value_type value_type;
@@ -180,25 +179,24 @@ namespace CGAL {
 
   template < typename Map_,bool Const >
   class CMap_dart_iterator<Map_, Const, Tag_true>:
-      /*public boost::mpl::if_c< Const,
+      /*public std::conditional_t< Const,
       typename Map_::Dart_container::const_iterator,
-      typename Map_::Dart_container::iterator>::type*/
+      typename Map_::Dart_container::iterator>*/
     public internal::CC_iterator_with_index<typename Map_::Dart_container,Const>
   {
   public:
     typedef CMap_dart_iterator<Map_,Const> Self;
 
-    /*typedef typename boost::mpl::if_c< Const,
+    /*typedef std::conditional_t< Const,
           typename Map_::Dart_container::const_iterator,
-          typename Map_::Dart_container::iterator>::type Base;*/
+          typename Map_::Dart_container::iterator> Base;*/
     typedef internal::CC_iterator_with_index<typename Map_::Dart_container,Const> Base;
 
-    typedef typename boost::mpl::if_c< Const,
-                                       typename Map_::Dart_const_descriptor,
-                                       typename Map_::Dart_descriptor>::type
+    typedef std::conditional_t< Const,
+                                typename Map_::Dart_const_descriptor,
+                                typename Map_::Dart_descriptor>
                                      Dart_descriptor;
-    typedef typename boost::mpl::if_c< Const, const Map_,
-                                       Map_>::type Map;
+    typedef std::conditional_t< Const, const Map_, Map_> Map;
 
     typedef std::input_iterator_tag iterator_category;
     typedef typename Base::value_type value_type;
diff --git a/Combinatorial_map/include/CGAL/Compact_container_with_index.h b/Combinatorial_map/include/CGAL/Compact_container_with_index.h
index d3d67c57a88d..dbb9aa8bae6d 100644
--- a/Combinatorial_map/include/CGAL/Compact_container_with_index.h
+++ b/Combinatorial_map/include/CGAL/Compact_container_with_index.h
@@ -861,14 +861,13 @@ namespace internal {
     typedef typename DSC::value_type                  value_type;
     typedef typename DSC::size_type                   size_type;
     typedef typename DSC::difference_type             difference_type;
-    typedef typename boost::mpl::if_c< Const, const value_type*,
-                                       value_type*>::type pointer;
-    typedef typename boost::mpl::if_c< Const, const value_type&,
-                                       value_type&>::type reference;
+    typedef std::conditional_t< Const, const value_type*,
+                                       value_type*>   pointer;
+    typedef std::conditional_t< Const, const value_type&,
+                                       value_type&>  reference;
     typedef std::bidirectional_iterator_tag           iterator_category;
 
-    typedef typename boost::mpl::if_c< Const, const DSC*, DSC*>::type
-    cc_pointer;
+    typedef std::conditional_t< Const, const DSC*, DSC*> cc_pointer;
 
     CC_iterator_with_index(): m_ptr_to_cc(nullptr),
       m_index(0)
diff --git a/Filtered_kernel/include/CGAL/Lazy_kernel.h b/Filtered_kernel/include/CGAL/Lazy_kernel.h
index 911a86debc30..c6b6cb2444ab 100644
--- a/Filtered_kernel/include/CGAL/Lazy_kernel.h
+++ b/Filtered_kernel/include/CGAL/Lazy_kernel.h
@@ -27,7 +27,6 @@
 #include <CGAL/Filtered_kernel/internal/Static_filters/tools.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <boost/none.hpp>
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/or.hpp>
 #include <CGAL/Lazy_exact_nt.h>
 
diff --git a/Generalized_map/include/CGAL/Generalized_map_iterators_base.h b/Generalized_map/include/CGAL/Generalized_map_iterators_base.h
index 034b1600f936..1747f89f354b 100644
--- a/Generalized_map/include/CGAL/Generalized_map_iterators_base.h
+++ b/Generalized_map/include/CGAL/Generalized_map_iterators_base.h
@@ -19,7 +19,6 @@
 #include <CGAL/Compact_container.h>
 #include <queue>
 #include <type_traits>
-#include <boost/mpl/if.hpp>
 
 namespace CGAL {
 
diff --git a/Interpolation/include/CGAL/sibson_gradient_fitting.h b/Interpolation/include/CGAL/sibson_gradient_fitting.h
index f08600a4603c..f6d6d0559dd8 100644
--- a/Interpolation/include/CGAL/sibson_gradient_fitting.h
+++ b/Interpolation/include/CGAL/sibson_gradient_fitting.h
@@ -23,7 +23,6 @@
 #include <functional>
 
 #include <any>
-#include <boost/mpl/if.hpp>
 #include <boost/utility/result_of.hpp>
 
 #include <iterator>
diff --git a/Kernel_23/include/CGAL/Kernel_traits.h b/Kernel_23/include/CGAL/Kernel_traits.h
index 4839184ff304..e12d38503bca 100644
--- a/Kernel_23/include/CGAL/Kernel_traits.h
+++ b/Kernel_23/include/CGAL/Kernel_traits.h
@@ -19,7 +19,6 @@
 
 #include <CGAL/Kernel_traits_fwd.h>
 #include <boost/mpl/has_xxx.hpp>
-#include <boost/mpl/if.hpp>
 
 namespace CGAL {
 
diff --git a/Mesh_3/benchmark/Mesh_3/StdAfx.h b/Mesh_3/benchmark/Mesh_3/StdAfx.h
index 57890430a5b2..9648697498aa 100644
--- a/Mesh_3/benchmark/Mesh_3/StdAfx.h
+++ b/Mesh_3/benchmark/Mesh_3/StdAfx.h
@@ -42,11 +42,9 @@
 #include <boost/mpl/clear.hpp>
 #include <boost/mpl/contains.hpp>
 #include <boost/mpl/end.hpp>
-#include <boost/mpl/eval_if.hpp>
 #include <boost/mpl/has_key.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/mpl/identity.hpp>
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/insert.hpp>
 #include <boost/mpl/insert_fwd.hpp>
 #include <boost/mpl/iterator_range.hpp>
diff --git a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
index 7e3af3de705e..3ab3f0d3ba5f 100644
--- a/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
+++ b/Mesh_3/include/CGAL/Implicit_to_labeling_function_wrapper.h
@@ -33,7 +33,6 @@
 
 #include <boost/dynamic_bitset.hpp>
 #include <boost/type_traits/is_function.hpp>
-#include <boost/mpl/if.hpp>
 
 #include <CGAL/config.h>
 #include <CGAL/assertions.h>
@@ -67,9 +66,9 @@ class Implicit_to_labeling_function_wrapper
   }
 
 private:
-  typedef typename boost::mpl::if_<boost::is_function<Function_>,
-                                   Function_*,
-                                   Function_>::type Stored_function;
+  typedef std::conditional_t<std::is_function_v<Function_>,
+                             Function_*,
+                             Function_> Stored_function;
   /// Function to wrap
   Stored_function f_;
 
diff --git a/Mesh_3/include/CGAL/Mesh_3/Image_to_labeled_function_wrapper.h b/Mesh_3/include/CGAL/Mesh_3/Image_to_labeled_function_wrapper.h
index 45246e4463db..3d1c030ff08b 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Image_to_labeled_function_wrapper.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Image_to_labeled_function_wrapper.h
@@ -26,7 +26,6 @@
 #include <CGAL/Image_3.h>
 #include <CGAL/function_objects.h>
 #include <functional>
-#include <boost/mpl/if.hpp>
 
 namespace CGAL {
 
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
index 44e4f82b82d2..ad023df618e2 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_cells_3.h
@@ -37,7 +37,6 @@
 
 #include <boost/format.hpp>
 #include <boost/mpl/has_xxx.hpp>
-#include <boost/mpl/if.hpp>
 #include <sstream>
 #include <atomic>
 
@@ -172,9 +171,9 @@ template<class Tr,
          class Previous_,
          class Concurrency_tag,
 #ifdef CGAL_LINKED_WITH_TBB
-         class Container_ = typename boost::mpl::if_c // (parallel/sequential?)
+         class Container_ = std::conditional_t // (parallel/sequential?)
          <
-          std::is_convertible<Concurrency_tag, Parallel_tag>::value,
+          std::is_convertible_v<Concurrency_tag, Parallel_tag>,
 
           // Parallel
 # ifdef CGAL_MESH_3_USE_LAZY_UNSORTED_REFINEMENT_QUEUE
@@ -209,7 +208,7 @@ template<class Tr,
           Meshes::Double_map_container<typename Tr::Cell_handle,
                                        typename Criteria::Cell_quality>
 # endif
-         >::type // boost::if (parallel/sequential)
+         > // std::conditional (parallel/sequential)
 
 #else // !CGAL_LINKED_WITH_TBB
 
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
index b4e2af503757..50e0a6cef08d 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
@@ -46,7 +46,6 @@
 #include <optional>
 #include <boost/optional/optional_io.hpp>
 #include <boost/mpl/has_xxx.hpp>
-#include <boost/mpl/if.hpp>
 #include <CGAL/tuple.h>
 #include <sstream>
 #include <atomic>
@@ -640,9 +639,9 @@ template<class Tr,
          template<class Tr_, class Cr_, class MD_, class C3T3_2, class Ct_, class C_2>
             class Base_ = Refine_facets_3_base,
 #ifdef CGAL_LINKED_WITH_TBB
-         class Container_ = typename boost::mpl::if_c // (parallel/sequential?)
+         class Container_ = std::conditional_t // (parallel/sequential?)
          <
-          std::is_convertible<Concurrency_tag, Parallel_tag>::value,
+          std::is_convertible_v<Concurrency_tag, Parallel_tag>,
           // Parallel
 # ifdef CGAL_MESH_3_USE_LAZY_UNSORTED_REFINEMENT_QUEUE
           Meshes::Filtered_deque_container
@@ -679,7 +678,7 @@ template<class Tr,
           Meshes::Double_map_container<typename Tr::Facet,
                                        typename Criteria::Facet_quality>
 # endif
-         >::type // boost::if (parallel/sequential)
+         > // std::conditional (parallel/sequential)
 
 #else // !CGAL_LINKED_WITH_TBB
 
diff --git a/Mesh_3/include/CGAL/Mesh_3/Triangulation_helpers.h b/Mesh_3/include/CGAL/Mesh_3/Triangulation_helpers.h
index db2dde5b6d3d..e8517c94945a 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Triangulation_helpers.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Triangulation_helpers.h
@@ -23,7 +23,6 @@
 #include <CGAL/STL_Extension/internal/Has_nested_type_Bare_point.h>
 #include <CGAL/Time_stamper.h>
 
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/identity.hpp>
 #include <boost/unordered_set.hpp>
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_filter_K.h b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_filter_K.h
index c02efa6dcc65..25ec0c4f25c4 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_filter_K.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_filter_K.h
@@ -15,7 +15,6 @@
 #include <CGAL/basic.h>
 #include <CGAL/NewKernel_d/KernelD_converter.h>
 #include <CGAL/NewKernel_d/Filtered_predicate2.h>
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/and.hpp>
 
 namespace CGAL {
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h
index 5c3a64287d28..122cfe90885b 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h
@@ -16,7 +16,6 @@
 #include <CGAL/Filtered_kernel/internal/Static_filters/tools.h> // bug, should be included by the next one
 #include <CGAL/Filtered_kernel/internal/Static_filters/Orientation_2.h>
 #include <CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_circle_2.h>
-#include <boost/mpl/if.hpp>
 
 namespace CGAL {
 namespace SFA { // static filter adapter
@@ -98,9 +97,9 @@ struct Cartesian_static_filters<Dimension_tag<2>, R_, Derived_> : public R_ {
         template <class T, class=void> struct Functor : Inherit_functor<R_, T> {};
         template <class D> struct Functor <Orientation_of_points_tag,D> {
                 typedef
-                        //typename boost::mpl::if_ <
-                        //std::is_same<D,No_filter_tag>,
-                        //typename Get_functor<R_, Orientation_of_points_tag>::type,
+                        //std::conditional_t <
+                        //std::is_same_v<D,No_filter_tag>,
+                        //typename Get_functor<R_, Orientation_of_points_tag>,
                         SFA::Orientation_of_points_2<R_,Derived>
                         //        >::type
                                 type;
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/KernelD_converter.h b/NewKernel_d/include/CGAL/NewKernel_d/KernelD_converter.h
index d62b8215cc52..edfb15ae9e95 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/KernelD_converter.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/KernelD_converter.h
@@ -23,7 +23,6 @@
 #include <CGAL/Kernel/mpl.h>
 #include <CGAL/type_traits/is_iterator.h>
 #include <CGAL/transforming_iterator.h>
-#include <boost/mpl/if.hpp>
 #include <CGAL/NewKernel_d/store_kernel.h>
 #include <CGAL/NewKernel_d/Kernel_object_converter.h>
 
@@ -80,12 +79,12 @@ class KernelD_converter_
 
         // Explicit calls to boost::mpl functions to avoid parenthesis
         // warning on some versions of GCC
-        typedef typename boost::mpl::if_ <
+        typedef std::conditional_t <
                           // If Point==Vector, keep only one conversion
-          boost::mpl::or_<boost::mpl::bool_<duplicate::value>,
+                          duplicate::value ||
                           // For iterator objects, the default is make_transforming_iterator
-                          boost::mpl::bool_<(iterator_tag_traits<Tag_>::is_iterator && no_converter::value)> >,
-          Do_not_use,K1_Obj>::type argument_type;
+                          (iterator_tag_traits<Tag_>::is_iterator && no_converter::value),
+          Do_not_use,K1_Obj> argument_type;
         //typedef typename KOC::argument_type K1_Obj;
         //typedef typename KOC::result_type K2_Obj;
         public:
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h b/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h
index a3255d25eb00..4eb0e8900631 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h
@@ -18,7 +18,6 @@
 #include <boost/type_traits.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/mpl/not.hpp>
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/vector.hpp>
 #include <boost/mpl/empty.hpp>
 #include <boost/mpl/front.hpp>
@@ -233,7 +232,7 @@ namespace CGAL {
 #undef CGAL_DECL_ITER_OBJ
 
         template<class A,class T,class B,class C>struct Get_functor_category<A,Construct_ttag<T>,B,C> :
-          boost::mpl::if_c<iterator_tag_traits<T>::is_iterator,
+          std::conditional<iterator_tag_traits<T>::is_iterator,
                            Construct_iterator_tag,
                            Construct_tag> {};
 
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/utils.h b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
index a1ac6faeddd2..f2e6a2f3ada5 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/utils.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
@@ -145,11 +145,11 @@ struct Has_type_different_from <T, No, true>
 #define CGAL_KD_DEFAULT_FUNCTOR(Tg,Name,ReqTyp,ReqFun) \
     template <class K, class O> \
     struct Get_functor<K, Tg, O, \
-      typename boost::mpl::if_c< \
+      std::conditional_t< \
         Provides_functor_i<K, Tg, O>::value \
         || !Provides_types<K, boost::mpl::vector<CGAL_STRIP_PAREN_ ReqTyp> >::value \
         || !Provides_functors<K, boost::mpl::vector<CGAL_STRIP_PAREN_ ReqFun> >::value \
-      , int, void>::type> \
+      , int, void>> \
     { \
       typedef CGAL_STRIP_PAREN_ Name type; \
       typedef K Bound_kernel; \
@@ -159,11 +159,11 @@ struct Has_type_different_from <T, No, true>
 #define CGAL_KD_DEFAULT_TYPE(Tg,Name,ReqTyp,ReqFun) \
     template <class K> \
     struct Get_type<K, Tg, \
-      typename boost::mpl::if_c< \
+      std::conditional_t< \
         Provides_type_i<K, Tg>::value \
         || !Provides_types<K, boost::mpl::vector<CGAL_STRIP_PAREN_ ReqTyp> >::value \
         || !Provides_functors<K, boost::mpl::vector<CGAL_STRIP_PAREN_ ReqFun> >::value \
-      , int, void>::type> \
+      , int, void>> \
     { \
       typedef CGAL_STRIP_PAREN_ Name type; \
       typedef K Bound_kernel; \
diff --git a/NewKernel_d/test/NewKernel_d/Epick_d.cpp b/NewKernel_d/test/NewKernel_d/Epick_d.cpp
index 18ac1657ee63..5693977869a4 100644
--- a/NewKernel_d/test/NewKernel_d/Epick_d.cpp
+++ b/NewKernel_d/test/NewKernel_d/Epick_d.cpp
@@ -509,8 +509,8 @@ void test3(){
     ;
   CP_ cp_ Kinit(construct_point_d_object);
   CV_ cv_ Kinit(construct_vector_d_object);
-  typename boost::mpl::if_<std::is_same<typename Ker::Default_ambient_dimension,CGAL::Dynamic_dimension_tag>,Construct_point3_helper<CP_>,CP_>::type cp(cp_);
-  typename boost::mpl::if_<std::is_same<typename Ker::Default_ambient_dimension,CGAL::Dynamic_dimension_tag>,Construct_point3_helper<CV_>,CV_>::type cv(cv_);
+  std::conditional_t<std::is_same_v<typename Ker::Default_ambient_dimension,CGAL::Dynamic_dimension_tag>,Construct_point3_helper<CP_>,CP_> cp(cp_);
+  std::conditional_t<std::is_same_v<typename Ker::Default_ambient_dimension,CGAL::Dynamic_dimension_tag>,Construct_point3_helper<CV_>,CV_> cv(cv_);
   CCI ci Kinit(construct_cartesian_const_iterator_d_object);
   CC cc Kinit(compute_coordinate_d_object);
   CL cl Kinit(compare_lexicographically_d_object);
diff --git a/Number_types/include/CGAL/Lazy_exact_nt.h b/Number_types/include/CGAL/Lazy_exact_nt.h
index 3f06ef3fb329..3f8a2812968a 100644
--- a/Number_types/include/CGAL/Lazy_exact_nt.h
+++ b/Number_types/include/CGAL/Lazy_exact_nt.h
@@ -19,7 +19,6 @@
 #include <CGAL/boost/iterator/transform_iterator.hpp> // for Root_of functor
 #include <boost/operators.hpp>
 
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/logical.hpp>
 
 #include <CGAL/Interval_nt.h>
@@ -1179,12 +1178,11 @@ struct Coercion_traits< Lazy_exact_nt<ET1>, Lazy_exact_nt<ET2> >
         Are_implicit_interoperable;                                     \
     private:                                                            \
         static const  bool interoperable                                \
-        =std::is_same< Are_implicit_interoperable, Tag_false>::value; \
+        =std::is_same< Are_implicit_interoperable, Tag_false>::value;   \
     public:                                                             \
-        typedef typename boost::mpl::if_c <interoperable,Null_tag,NT>   \
-        ::type  Type;                                          \
-        typedef typename boost::mpl::if_c <interoperable, Null_functor, \
-    INTERN_CT::Cast_from_to<NTX,NT> >::type Cast;                       \
+        typedef std::conditional_t <interoperable,Null_tag,NT> Type;    \
+        typedef std::conditional_t <interoperable, Null_functor,        \
+    INTERN_CT::Cast_from_to<NTX,NT> > Cast;                             \
     };                                                                  \
                                                                         \
     template<class ET>                                                  \
diff --git a/Number_types/include/CGAL/Quotient.h b/Number_types/include/CGAL/Quotient.h
index e91e22208a50..8c117c2fb6d8 100644
--- a/Number_types/include/CGAL/Quotient.h
+++ b/Number_types/include/CGAL/Quotient.h
@@ -627,13 +627,13 @@ template< class NT > class Algebraic_structure_traits_quotient_base< Quotient<NT
 
     };
 
-    typedef typename boost::mpl::if_c<
-        !std::is_same< typename Algebraic_structure_traits<NT>::Sqrt,
-                         Null_functor >::value,
+    typedef std::conditional_t<
+        !std::is_same_v< typename Algebraic_structure_traits<NT>::Sqrt,
+                         Null_functor >,
          typename INTERN_QUOTIENT::Sqrt_selector< Type,
                                                   Is_exact >::Sqrt,
          Null_functor
-                            >::type Sqrt;
+                            > Sqrt;
 
     class Simplify
       : public CGAL::cpp98::unary_function< Type&, void > {
diff --git a/Number_types/include/CGAL/Sqrt_extension/Algebraic_structure_traits.h b/Number_types/include/CGAL/Sqrt_extension/Algebraic_structure_traits.h
index b0913afb1b6f..b1500148b598 100644
--- a/Number_types/include/CGAL/Sqrt_extension/Algebraic_structure_traits.h
+++ b/Number_types/include/CGAL/Sqrt_extension/Algebraic_structure_traits.h
@@ -204,10 +204,10 @@ class Algebraic_structure_traits< Sqrt_extension< COEFF_, ROOT_, ACDE_TAG,FP_TAG
   typedef Sqrt_extension< COEFF_, ROOT_, ACDE_TAG,FP_TAG > Type;
 
     // Tag_true if COEFF and ROOT are exact
-    typedef typename ::boost::mpl::if_c<
-       bool( ::std::is_same<typename CGAL::Algebraic_structure_traits<ROOT_ >::Is_exact,::CGAL::Tag_true>::value )&&
-       bool( ::std::is_same<typename CGAL::Algebraic_structure_traits<COEFF_>::Is_exact,::CGAL::Tag_true>::value )
-           ,::CGAL::Tag_true,::CGAL::Tag_false>::type Is_exact;
+    typedef std::conditional_t<
+       std::is_same_v<typename CGAL::Algebraic_structure_traits<ROOT_ >::Is_exact,::CGAL::Tag_true> &&
+       std::is_same<typename CGAL::Algebraic_structure_traits<COEFF_>::Is_exact,::CGAL::Tag_true>
+           ,::CGAL::Tag_true,::CGAL::Tag_false> Is_exact;
 
     typedef typename Algebraic_structure_traits<COEFF_>::Is_numerical_sensitive
     Is_numerical_sensitive;
diff --git a/Number_types/include/CGAL/Sqrt_extension/Coercion_traits.h b/Number_types/include/CGAL/Sqrt_extension/Coercion_traits.h
index 6b4344348d4d..5b5ddfa45c69 100644
--- a/Number_types/include/CGAL/Sqrt_extension/Coercion_traits.h
+++ b/Number_types/include/CGAL/Sqrt_extension/Coercion_traits.h
@@ -178,7 +178,7 @@ template <class A, class B> struct CT_ext_not_to_fwsqrt;
 //<EXT,ANY>
 template <class COEFF, class ROOT, class ACDE_TAG,class FP_TAG, class B>
 struct Coercion_traits_for_level<Sqrt_extension<COEFF, ROOT, ACDE_TAG,FP_TAG>, B , CTL_SQRT_EXT>
-:public ::boost::mpl::if_c<
+:public std::conditional_t<
              // if B is fwsqrt
               ::boost::is_base_and_derived<
                   Field_with_sqrt_tag,
@@ -192,7 +192,7 @@ typename Algebraic_structure_traits<B>::Algebraic_category >::value
             ,
             //else take Intern::Coercion_traits not for fwsqrt
             INTERN_CT::CT_ext_not_to_fwsqrt< Sqrt_extension<COEFF,ROOT, ACDE_TAG,FP_TAG> ,B>
-              >::type
+              >
 {};
 
 // <ANY,EXT>
diff --git a/Periodic_3_mesh_3/include/CGAL/Implicit_to_labeled_subdomains_function_wrapper.h b/Periodic_3_mesh_3/include/CGAL/Implicit_to_labeled_subdomains_function_wrapper.h
index a96c2eafa366..d821ab2fe3f9 100644
--- a/Periodic_3_mesh_3/include/CGAL/Implicit_to_labeled_subdomains_function_wrapper.h
+++ b/Periodic_3_mesh_3/include/CGAL/Implicit_to_labeled_subdomains_function_wrapper.h
@@ -15,7 +15,6 @@
 #include <CGAL/license/Periodic_3_mesh_3.h>
 
 #include <boost/type_traits/is_function.hpp>
-#include <boost/mpl/if.hpp>
 
 #if defined(BOOST_MSVC)
 #  pragma warning(push)
@@ -47,9 +46,9 @@ class Implicit_to_labeled_subdomains_function_wrapper
   }
 
 private:
-  typedef typename boost::mpl::if_<boost::is_function<Function_>,
-                                   Function_*,
-                                   Function_>::type Stored_function;
+  typedef std::conditional_t<std::is_function_v<Function_>,
+                             Function_*,
+                             Function_> Stored_function;
 
   /// Function to wrap
   Stored_function f_;
diff --git a/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h b/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h
index 2780d6183932..b1ee5e650654 100644
--- a/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h
+++ b/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h
@@ -18,7 +18,6 @@
 #include <CGAL/Periodic_3_mesh_triangulation_3.h>
 
 #include <boost/type_traits/is_function.hpp>
-#include <boost/mpl/if.hpp>
 
 namespace CGAL {
 
@@ -46,9 +45,9 @@ class Periodic_3_function_wrapper
   }
 
 private:
-  typedef typename boost::mpl::if_<boost::is_function<Function_>,
-                                   Function_*,
-                                   Function_>::type             Stored_function;
+  typedef std::conditional_t<std::is_function_v<Function_>,
+                             Function_*,
+                             Function_>:                       Stored_function;
 
   /// Function to wrap
   Stored_function f_;
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h
index 7eed15886cd0..63fb94044699 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_regular_triangulation_3.h
@@ -31,7 +31,6 @@
 #include <CGAL/spatial_sort.h>
 #include <CGAL/utility.h>
 
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/identity.hpp>
 #include <boost/property_map/function_property_map.hpp>
 #include <boost/unordered_set.hpp>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/AABB_traversal_traits_with_transformation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/AABB_traversal_traits_with_transformation.h
index 838842771364..7dad2004ecd0 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/AABB_traversal_traits_with_transformation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/AABB_traversal_traits_with_transformation.h
@@ -27,7 +27,6 @@
 #include <CGAL/Simple_cartesian.h>
 
 #include <CGAL/Aff_transformation_3.h>
-#include <boost/mpl/if.hpp>
 
 namespace CGAL {
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
index 4a15d9e59c74..68f0c9e5e6c8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Corefinement/face_graph_utils.h
@@ -18,7 +18,6 @@
 
 #include <CGAL/Polygon_mesh_processing/orientation.h>
 #include <CGAL/property_map.h>
-#include <boost/mpl/if.hpp>
 #include <fstream>
 #include <sstream>
 #include <set>
@@ -388,12 +387,12 @@ struct TweakedGetVertexPointMap
   typedef typename std::is_same<Point_3,
     typename boost::property_traits<Default_map>::value_type>::type Use_default_tag;
 
-  typedef typename boost::mpl::if_<
-    Use_default_tag,
+  typedef std::conditional_t<
+    Use_default_tag::value,
     Default_map,
     Dummy_default_vertex_point_map<Point_3,
       typename boost::graph_traits<PolygonMesh>::vertex_descriptor >
-  >::type type;
+  > type;
 };
 
 template <class PT, class NP, class PM>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
index 26e205ea43d9..f32f9d907a98 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
@@ -29,7 +29,6 @@
 #include <CGAL/Side_of_triangle_mesh.h>
 
 #include <boost/iterator/function_output_iterator.hpp>
-#include <boost/mpl/if.hpp>
 
 #include <exception>
 #include <iterator>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
index ef361b175299..b99ed460a6f6 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/locate.h
@@ -30,7 +30,6 @@
 #include <CGAL/use.h>
 
 #include <boost/graph/graph_traits.hpp>
-#include <boost/mpl/if.hpp>
 #include <variant>
 
 #include <array>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h
index f1b88540a606..a608179f49ae 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_slicer.h
@@ -30,7 +30,6 @@
 #include <CGAL/Polygon_mesh_processing/internal/Polygon_mesh_slicer/Axis_parallel_plane_traits.h>
 
 #include <variant>
-#include <boost/mpl/if.hpp>
 
 #include <CGAL/boost/graph/split_graph_into_polylines.h>
 #include <CGAL/boost/graph/helpers.h>
@@ -79,12 +78,12 @@ template<class TriangleMesh,
   class AABBTree = AABB_tree<
                        AABB_traits<Traits,
                          AABB_halfedge_graph_segment_primitive<TriangleMesh,
-                                                                typename boost::mpl::if_<
-                                                                  typename std::is_same<
+                                                                std::conditional_t<
+                                                                  std::is_same_v<
                                                                     VertexPointMap,
-                                                                    typename boost::property_map< TriangleMesh, vertex_point_t>::type >::type,
+                                                                    typename boost::property_map< TriangleMesh, vertex_point_t>::type >,
                                                                   Default,
-                                                                  VertexPointMap>::type> > >,
+                                                                  VertexPointMap>>>>,
   bool UseParallelPlaneOptimization=true>
 class Polygon_mesh_slicer
 {
diff --git a/Polynomial/include/CGAL/Polynomial.h b/Polynomial/include/CGAL/Polynomial.h
index b3681eb43b5f..ad61432cd405 100644
--- a/Polynomial/include/CGAL/Polynomial.h
+++ b/Polynomial/include/CGAL/Polynomial.h
@@ -34,7 +34,6 @@
 #include <CGAL/basic.h>
 #include <CGAL/Handle_with_policy.h>
 #include <CGAL/boost/iterator/transform_iterator.hpp>
-#include <boost/mpl/if.hpp>
 #include <CGAL/Flattening_iterator.h>
 
 #include <CGAL/Exponent_vector.h>
diff --git a/Polynomial/include/CGAL/Polynomial/Polynomial_type.h b/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
index e2529d2e3495..de6bcdc447bd 100644
--- a/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
+++ b/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
@@ -486,9 +486,9 @@ class Polynomial
       // and NT would be changed by NTX
       typedef typename Fraction_traits<NTX>::Is_fraction Is_fraction;
       typedef typename Coercion_traits<NT,NTX>::Type Type;
-      typedef typename ::boost::mpl::if_c<
-      ::std::is_same<Type,NT>::value, Is_fraction, CGAL::Tag_false
-        >::type If_decomposable_AND_Type_equals_NT;
+      typedef std::conditional_t<
+      std::is_same_v<Type,NT>, Is_fraction, CGAL::Tag_false
+        > If_decomposable_AND_Type_equals_NT;
 
       return sign_at_(x,If_decomposable_AND_Type_equals_NT());
     }
diff --git a/Polynomial/include/CGAL/Polynomial_traits_d.h b/Polynomial/include/CGAL/Polynomial_traits_d.h
index 6eb4f0d6e3f2..dfbf7cf31357 100644
--- a/Polynomial/include/CGAL/Polynomial_traits_d.h
+++ b/Polynomial/include/CGAL/Polynomial_traits_d.h
@@ -999,7 +999,7 @@ class Polynomial_traits_d_base< Polynomial< Coefficient_type_ >,
 
   // Sign_at, Sign_at_homogeneous, Compare
   // define XXX_ even though ICoeff may not be Real_embeddable
-  // select propoer XXX among XXX_ or Null_functor using ::boost::mpl::if_
+  // select propoer XXX among XXX_ or Null_functor using ::std::conditional_t
 private:
   struct Sign_at_ {
   private:
@@ -1036,8 +1036,8 @@ class Polynomial_traits_d_base< Polynomial< Coefficient_type_ >,
   typedef Real_embeddable_traits<Innermost_coefficient_type> RET_IC;
   typedef typename RET_IC::Is_real_embeddable IC_is_real_embeddable;
 public:
-  typedef typename ::boost::mpl::if_<IC_is_real_embeddable,Sign_at_,Null_functor>::type Sign_at;
-  typedef typename ::boost::mpl::if_<IC_is_real_embeddable,Sign_at_homogeneous_,Null_functor>::type Sign_at_homogeneous;
+  typedef std::conditional_t<IC_is_real_embeddable::value,Sign_at_,Null_functor> Sign_at;
+  typedef std::conditional_t<IC_is_real_embeddable::value,Sign_at_homogeneous_,Null_functor> Sign_at_homogeneous;
   typedef typename Real_embeddable_traits<Polynomial_d>::Compare Compare;
 
 
diff --git a/Property_map/include/CGAL/Dynamic_property_map.h b/Property_map/include/CGAL/Dynamic_property_map.h
index a7dc48b5354a..bca414e19b00 100644
--- a/Property_map/include/CGAL/Dynamic_property_map.h
+++ b/Property_map/include/CGAL/Dynamic_property_map.h
@@ -19,7 +19,6 @@
 #include <CGAL/property_map.h>
 
 #include <memory>
-#include <boost/mpl/if.hpp>
 
 #include <unordered_map>
 
@@ -127,9 +126,9 @@ struct Dynamic_with_index
 {
   typedef Key key_type;
   typedef Value value_type;
-  typedef typename boost::mpl::if_<  std::is_same<bool, Value>,
-                                     value_type,
-                                     value_type&>::type  reference;
+  typedef std::conditional_t<  std::is_same_v<bool, Value>,
+                               value_type,
+                               value_type&> reference;
   typedef boost::read_write_property_map_tag category;
 
   Dynamic_with_index()
diff --git a/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h b/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h
index f77f1d9c07f3..ef7c6164f2d0 100644
--- a/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h
+++ b/SMDS_3/include/CGAL/Mesh_complex_3_in_triangulation_3.h
@@ -37,7 +37,6 @@
 #include <boost/bimap/multiset_of.hpp>
 #include <CGAL/boost/iterator/transform_iterator.hpp>
 #include <boost/iterator/iterator_adaptor.hpp>
-#include <boost/mpl/if.hpp>
 #include <boost/unordered_map.hpp>
 #include <boost/static_assert.hpp>
 #include <boost/type_traits/is_same.hpp>
diff --git a/STL_Extension/include/CGAL/Compact_container.h b/STL_Extension/include/CGAL/Compact_container.h
index 24f7ef91c721..81ff5cf1bce2 100644
--- a/STL_Extension/include/CGAL/Compact_container.h
+++ b/STL_Extension/include/CGAL/Compact_container.h
@@ -35,8 +35,6 @@
 #include <CGAL/assertions.h>
 #include <CGAL/IO/io.h>
 
-#include <boost/mpl/if.hpp>
-
 // An STL like container with the following properties :
 // - to achieve compactness, it requires access to a pointer stored in T,
 //   specified by a traits.  This pointer is supposed to be 4 bytes aligned
@@ -866,10 +864,10 @@ namespace internal {
     typedef typename DSC::value_type                  value_type;
     typedef typename DSC::size_type                   size_type;
     typedef typename DSC::difference_type             difference_type;
-    typedef typename boost::mpl::if_c< Const, const value_type*,
-                                       value_type*>::type pointer;
-    typedef typename boost::mpl::if_c< Const, const value_type&,
-                                       value_type&>::type reference;
+    typedef std::conditional_t< Const, const value_type*,
+                                       value_type*>   pointer;
+    typedef std::conditional_t< Const, const value_type&,
+                                        value_type&>  reference;
     typedef std::bidirectional_iterator_tag           iterator_category;
 
     // the initialization with nullptr is required by our Handle concept.
diff --git a/STL_Extension/include/CGAL/Concurrent_compact_container.h b/STL_Extension/include/CGAL/Concurrent_compact_container.h
index 7f18ab80f57e..e6a2a5dbecf1 100644
--- a/STL_Extension/include/CGAL/Concurrent_compact_container.h
+++ b/STL_Extension/include/CGAL/Concurrent_compact_container.h
@@ -1,4 +1,4 @@
-// Copyright (c) 2012  INRIA Sophia-Antipolis (France).
+3// Copyright (c) 2012  INRIA Sophia-Antipolis (France).
 // All rights reserved.
 //
 // This file is part of CGAL (www.cgal.org)
@@ -36,8 +36,6 @@
 #include <tbb/enumerable_thread_specific.h>
 #include <tbb/queuing_mutex.h>
 
-#include <boost/mpl/if.hpp>
-
 namespace CGAL {
 
 #define CGAL_GENERATE_MEMBER_DETECTOR(X)                                           \
diff --git a/STL_Extension/include/CGAL/Handle_with_policy.h b/STL_Extension/include/CGAL/Handle_with_policy.h
index 5f952a66e15f..528bf8061d10 100644
--- a/STL_Extension/include/CGAL/Handle_with_policy.h
+++ b/STL_Extension/include/CGAL/Handle_with_policy.h
@@ -21,8 +21,6 @@
 #include <CGAL/assertions.h>
 #include <CGAL/use.h>
 
-#include <boost/mpl/if.hpp>
-
 #include <cstddef>
 
 #ifdef CGAL_USE_LEDA
@@ -728,10 +726,10 @@ class Handle_with_policy {
     static Bind bind;
 
     // Define type that is used for function matching
-    typedef typename ::boost::mpl::if_c<
+    typedef std::conditional_t<
          is_class_hierarchy,
            ::CGAL::Tag_true,
-           ::CGAL::Tag_false >::type
+           ::CGAL::Tag_false >
          Class_hierarchy;
 
     //! the internal representation, i.e., \c T plus a reference count
diff --git a/STL_Extension/include/CGAL/Named_function_parameters.h b/STL_Extension/include/CGAL/Named_function_parameters.h
index d0f1648f816e..7558aae88f25 100644
--- a/STL_Extension/include/CGAL/Named_function_parameters.h
+++ b/STL_Extension/include/CGAL/Named_function_parameters.h
@@ -19,7 +19,6 @@
 #include <CGAL/tags.h>
 #include <CGAL/STL_Extension/internal/mesh_option_classes.h>
 
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/has_xxx.hpp>
 
 #include <type_traits>
@@ -143,14 +142,14 @@ struct Lookup_named_param_def
   typedef typename internal_np::Get_param<typename NP::base, Query_tag>::type NP_type;
   typedef typename internal_np::Get_param<typename NP::base, Query_tag>::reference NP_reference;
 
-  typedef typename boost::mpl::if_<
-    std::is_same<NP_type, internal_np::Param_not_found>,
-    D, NP_type>::type
+  typedef std::conditional_t<
+    std::is_same_v<NP_type, internal_np::Param_not_found>,
+    D, NP_type>
   type;
 
-  typedef typename boost::mpl::if_<
-    std::is_same<NP_reference, internal_np::Param_not_found>,
-    D&, NP_reference>::type
+  typedef std::conditional_t<
+    std::is_same_v<NP_reference, internal_np::Param_not_found>,
+    D&, NP_reference>
   reference;
 };
 
diff --git a/STL_Extension/include/CGAL/transforming_iterator.h b/STL_Extension/include/CGAL/transforming_iterator.h
index bd94ad33c4fd..21d88e8f69cf 100644
--- a/STL_Extension/include/CGAL/transforming_iterator.h
+++ b/STL_Extension/include/CGAL/transforming_iterator.h
@@ -12,7 +12,6 @@
 #ifndef CGAL_TRANSFORMING_ITERATOR_H
 #define CGAL_TRANSFORMING_ITERATOR_H
 #include <boost/iterator/iterator_adaptor.hpp>
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/or.hpp>
 #include <CGAL/Default.h>
 #include <utility>
@@ -55,10 +54,8 @@ class transforming_iterator_helper
         typedef typename Default::Get<Val,std::remove_cv_t<std::remove_reference_t<reference_>>>::type value_type;
 
         // Crappy heuristic. If we have *it that returns a Weighted_point and F that returns a reference to the Point contained in the Weighted_point it takes as argument, we do NOT want the transformed iterator to return a reference to the temporary *it. On the other hand, if *it returns an int n, and F returns a reference to array[n] it is not so good to lose the reference. This probably should be done elsewhere and should at least be made optional...
-        typedef typename boost::mpl::if_<
-          boost::mpl::or_<std::is_reference<Iter_ref>,
-                          std::is_integral<Iter_ref> >,
-          reference_, value_type>::type reference;
+        typedef std::conditional_t<std::is_reference_v<Iter_ref> || std::is_integral_v<Iter_ref>,
+                                   reference_, value_type> reference;
 
         public:
         typedef boost::iterator_adaptor<
diff --git a/Skin_surface_3/include/CGAL/Skin_surface_base_3.h b/Skin_surface_3/include/CGAL/Skin_surface_base_3.h
index 6962b1ec8f21..528ea1e0e832 100644
--- a/Skin_surface_3/include/CGAL/Skin_surface_base_3.h
+++ b/Skin_surface_3/include/CGAL/Skin_surface_base_3.h
@@ -42,7 +42,6 @@
 
 #include <CGAL/STL_Extension/internal/Has_nested_type_Bare_point.h>
 
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/identity.hpp>
 
 namespace CGAL {
diff --git a/Spatial_searching/include/CGAL/Fuzzy_iso_box.h b/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
index 0b34898eff93..08cc1da0063c 100644
--- a/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
+++ b/Spatial_searching/include/CGAL/Fuzzy_iso_box.h
@@ -22,8 +22,6 @@
 #include <CGAL/Kd_tree_rectangle.h>
 #include <CGAL/Search_traits_adapter.h>
 
-#include <boost/mpl/if.hpp>
-
 #include <type_traits>
 
 
diff --git a/Spatial_searching/include/CGAL/Search_traits_adapter.h b/Spatial_searching/include/CGAL/Search_traits_adapter.h
index ff640dc639a4..7a518cf68eed 100644
--- a/Spatial_searching/include/CGAL/Search_traits_adapter.h
+++ b/Spatial_searching/include/CGAL/Search_traits_adapter.h
@@ -224,16 +224,16 @@ class Search_traits_adapter : public Base_traits{
 
   // Select type of iterator + construct class depending on whether
   // point map is lvalue or not
-  typedef typename boost::mpl::if_<
-              std::is_reference<typename boost::property_traits<PointPropertyMap>::reference>,
+  typedef std::conditional_t<
+              std::is_reference_v<typename boost::property_traits<PointPropertyMap>::reference>,
               typename Base::Cartesian_const_iterator_d,
-              No_lvalue_iterator>::type
+              No_lvalue_iterator>
     Cartesian_const_iterator_d;
 
-  typedef typename boost::mpl::if_<
-              std::is_reference<typename boost::property_traits<PointPropertyMap>::reference>,
+  typedef std::conditional_t<
+              std::is_reference_v<typename boost::property_traits<PointPropertyMap>::reference>,
               Construct_cartesian_const_iterator_d_lvalue,
-              Construct_cartesian_const_iterator_d_no_lvalue>::type
+              Construct_cartesian_const_iterator_d_no_lvalue>
     Construct_cartesian_const_iterator_d;
 
   struct Construct_iso_box_d: public Base::Construct_iso_box_d{
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_aux.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_aux.h
index a799eccda60b..30b1e25de59a 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_aux.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/Straight_skeleton_aux.h
@@ -20,7 +20,6 @@
 #include <CGAL/Polygon_with_holes_2.h>
 
 #include <boost/mpl/has_xxx.hpp>
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/or.hpp>
 #include <optional>
 
@@ -36,12 +35,10 @@ struct Has_inexact_constructions
 {
   typedef typename K::FT FT ;
 
-  typedef typename boost::mpl::if_< boost::mpl::or_< std::is_same<FT,double>
-                                                   , std::is_same<FT,Interval_nt_advanced>
-                                                   >
-                                  , Tag_true
-                                  , Tag_false
-                                  >::type type ;
+  typedef std::conditional_t< std::is_same_v<FT,double> || std::is_same_v<FT,Interval_nt_advanced>
+                              , Tag_true
+                              , Tag_false
+                              > type ;
 } ;
 
 template <class K>
diff --git a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
index 4ce20796d1ab..02b050f790ad 100644
--- a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
@@ -34,7 +34,6 @@
 #include <CGAL/Exact_rational.h>
 #include <CGAL/Kernel_23/internal/Has_boolean_tags.h>
 
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/has_xxx.hpp>
 #include <boost/iterator/filter_iterator.hpp>
 
@@ -96,9 +95,9 @@ namespace internal {
 
 template <typename K>
 struct Itag {
-  typedef typename boost::mpl::if_<typename Algebraic_structure_traits<typename K::FT>::Is_exact,
+  typedef std::conditional_t<(typename Algebraic_structure_traits<typename K::FT>::Is_exact)::value,
                                    Exact_intersections_tag,
-                                   Exact_predicates_tag>::type type;
+                                   Exact_predicates_tag> type;
 };
 
 } // namespace internal
diff --git a/Triangulation_2/include/CGAL/Regular_triangulation_2.h b/Triangulation_2/include/CGAL/Regular_triangulation_2.h
index f7e4a653060b..c3ab2223a0ad 100644
--- a/Triangulation_2/include/CGAL/Regular_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Regular_triangulation_2.h
@@ -23,7 +23,6 @@
 #include <CGAL/Object.h>
 #include <CGAL/STL_Extension/internal/Has_nested_type_Bare_point.h>
 
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/identity.hpp>
 #include <boost/utility/result_of.hpp>
 
diff --git a/Triangulation_2/include/CGAL/Triangulation_hierarchy_2.h b/Triangulation_2/include/CGAL/Triangulation_hierarchy_2.h
index 93e00b1680ff..295132483846 100644
--- a/Triangulation_2/include/CGAL/Triangulation_hierarchy_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_hierarchy_2.h
@@ -26,7 +26,6 @@
 #include <CGAL/Spatial_sort_traits_adapter_2.h>
 
 #include <boost/mpl/identity.hpp>
-#include <boost/mpl/if.hpp>
 #include <boost/property_map/function_property_map.hpp>
 #include <boost/random/linear_congruential.hpp>
 #include <boost/random/geometric_distribution.hpp>
diff --git a/Triangulation_3/include/CGAL/Regular_triangulation_3.h b/Triangulation_3/include/CGAL/Regular_triangulation_3.h
index aa58c124ed1f..7795840a2e6d 100644
--- a/Triangulation_3/include/CGAL/Regular_triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Regular_triangulation_3.h
@@ -54,7 +54,6 @@
 #include <CGAL/point_generators_3.h>
 #endif
 
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/identity.hpp>
 #include <boost/property_map/function_property_map.hpp>
 #include <boost/utility/result_of.hpp>
diff --git a/Triangulation_3/include/CGAL/Regular_triangulation_cell_base_with_weighted_circumcenter_3.h b/Triangulation_3/include/CGAL/Regular_triangulation_cell_base_with_weighted_circumcenter_3.h
index 3a73305b380e..f2c945342e8e 100644
--- a/Triangulation_3/include/CGAL/Regular_triangulation_cell_base_with_weighted_circumcenter_3.h
+++ b/Triangulation_3/include/CGAL/Regular_triangulation_cell_base_with_weighted_circumcenter_3.h
@@ -22,7 +22,6 @@
 #include <CGAL/assertions.h>
 #include <CGAL/Regular_triangulation_cell_base_3.h>
 
-#include <boost/mpl/if.hpp>
 #include <boost/mpl/identity.hpp>
 
 namespace CGAL {
diff --git a/Triangulation_3/include/CGAL/Triangulation_3.h b/Triangulation_3/include/CGAL/Triangulation_3.h
index 7b8ef9ab6c8a..fd4b530c7a88 100644
--- a/Triangulation_3/include/CGAL/Triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_3.h
@@ -48,7 +48,6 @@
 #include <boost/random/linear_congruential.hpp>
 #include <boost/random/uniform_smallint.hpp>
 #include <boost/random/variate_generator.hpp>
-#include <boost/mpl/if.hpp>
 #include <boost/property_map/function_property_map.hpp>
 #include <boost/unordered_map.hpp>
 #include <boost/utility/result_of.hpp>
diff --git a/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h b/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h
index 021e40e2ffef..c852a4bed75c 100644
--- a/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h
@@ -48,7 +48,6 @@
 #include <boost/iterator/zip_iterator.hpp>
 #include <boost/mpl/and.hpp>
 #include <boost/mpl/identity.hpp>
-#include <boost/mpl/if.hpp>
 
 #include <array>
 #include <CGAL/array.h>
diff --git a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
index 78b8822f5984..01f08ac186ce 100644
--- a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
+++ b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
@@ -25,7 +25,6 @@
 #include <CGAL/STL_Extension/internal/Has_nested_type_Bare_point.h>
 
 #include <boost/mpl/identity.hpp>
-#include <boost/mpl/if.hpp>
 
 #include <cassert>
 #include <iostream>
diff --git a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_parallel_triangulation_3.h b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_parallel_triangulation_3.h
index e93418c19cf1..20c4351bc498 100644
--- a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_parallel_triangulation_3.h
+++ b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_parallel_triangulation_3.h
@@ -16,7 +16,6 @@
 #include <iostream>
 #include <vector>
 
-#include <boost/mpl/if.hpp>
 
 template <typename Parallel_triangulation,
           typename WeightedTag = typename Parallel_triangulation::Weighted_tag>
diff --git a/Triangulation_3/test/Triangulation_3/test_regular_insert_range_with_info.cpp b/Triangulation_3/test/Triangulation_3/test_regular_insert_range_with_info.cpp
index e4f80d9149f0..c1b00d9aca9b 100644
--- a/Triangulation_3/test/Triangulation_3/test_regular_insert_range_with_info.cpp
+++ b/Triangulation_3/test/Triangulation_3/test_regular_insert_range_with_info.cpp
@@ -37,9 +37,9 @@ struct Tester
   void test_iterator_on_pair() const
   {
     typedef std::vector<std::pair<Weighted_point, unsigned> >              Container;
-    typedef typename boost::mpl::if_<boost::mpl::bool_<is_const>,
-                                     std::add_const_t<Container>,
-                                     Container>::type                      Cast_type;
+    typedef std::conditional_t<is_const,
+                               std::add_const_t<Container>,
+                               Container>                                  Cast_type;
 
     Container points;
     points.push_back(std::make_pair(Weighted_point(Bare_point(0.160385, 0.599679, 0.374932), -0.118572), 0));
@@ -90,9 +90,9 @@ struct Tester
   void test_zip_iterator() const
   {
     typedef std::vector<Weighted_point>                                   Container;
-    typedef typename boost::mpl::if_<boost::mpl::bool_<is_const>,
-                                     std::add_const_t<Container>,
-                                     Container >::type                    Cast_type;
+    typedef std::conditional_t<is_const,
+                               std::add_const_t<Container>,
+                               Container >                                Cast_type;
 
     Container points;
     points.push_back(Weighted_point(Bare_point(0,0,0),1));
@@ -156,9 +156,9 @@ struct Tester
   void test_transform_iterator() const
   {
     typedef std::vector< Weighted_point >                                   Container;
-    typedef typename boost::mpl::if_<boost::mpl::bool_<is_const>,
-                                     std::add_const_t<Container>,
-                                     Container >::type                      Cast_type;
+    typedef std::conditional_t<is_const,
+                               std::add_const_t<Container>,
+                               Container >                                  Cast_type;
 
     Container points;
     points.push_back(Weighted_point(Bare_point(0,0,0),1));

From 45f0c6665a29f2557545c1436731b45031d20dad Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Mon, 25 Sep 2023 10:50:29 +0200
Subject: [PATCH 0765/1398] Added clip support for tetrahedral meshes

---
 .../Polyhedron/resources/shader_c3t3.frag     | 29 +++++++++++++++----
 .../Polyhedron/resources/shader_c3t3.vert     | 24 +++++++++++++++
 .../resources/shader_c3t3_edges.frag          | 10 +++++++
 .../resources/shader_c3t3_edges.vert          | 24 +++++++++++++++
 4 files changed, 82 insertions(+), 5 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/resources/shader_c3t3.frag b/Polyhedron/demo/Polyhedron/resources/shader_c3t3.frag
index 27b255c5e1c6..9408f3d59327 100644
--- a/Polyhedron/demo/Polyhedron/resources/shader_c3t3.frag
+++ b/Polyhedron/demo/Polyhedron/resources/shader_c3t3.frag
@@ -2,6 +2,7 @@
 in vec4 color;
 in vec4 fP; 
 in vec3 fN; 
+in float dist[6];
 flat in vec2 subdomain_out;
 uniform vec4 light_pos;  
 uniform vec4 light_diff; 
@@ -10,6 +11,7 @@ uniform vec4 light_amb;
 uniform float spec_power ;
 uniform int is_two_side; 
 uniform bool is_selected;
+uniform bool is_clipbox_on;
 uniform float near;
 uniform float far;
 uniform float width;
@@ -28,7 +30,19 @@ float depth(float z)
   return (2 * near) / (far + near - z * (far - near));
 }
 
-void main(void) {
+bool compute_clip_visibility() {
+  if(is_clipbox_on)
+    return dist[0]>0.0 ||
+      dist[1]>0.0 ||
+      dist[2]>0.0 ||
+      dist[3]>0.0 ||
+      dist[4]>0.0 ||
+      dist[5]>0.0;
+  else
+    return false;
+}
+
+bool compute_filtering_visibility() {
   if(is_filterable)
   {
     uint domain1 = uint(subdomain_out.x);
@@ -37,10 +51,15 @@ void main(void) {
     uint i2 = domain2/25u;
     uint visible1 = uint(is_visible_bitset[i1]);
     uint visible2 = uint(is_visible_bitset[i2]);
-    if((visible1>>(domain1%25u))%2u == 0u && (visible2>>(domain2%25u))%2u == 0u)
-    {
-      discard;
-    }
+    return (visible1>>(domain1%25u))%2u == 0u && (visible2>>(domain2%25u))%2u == 0u;
+  }
+  else
+    return false;
+}
+
+void main(void) {
+  if (compute_clip_visibility() || compute_filtering_visibility()) {
+    discard;
   }
   float d = depth(gl_FragCoord.z);
   float test = texture(sampler, vec2(gl_FragCoord.x/width, gl_FragCoord.y/height)).r;
diff --git a/Polyhedron/demo/Polyhedron/resources/shader_c3t3.vert b/Polyhedron/demo/Polyhedron/resources/shader_c3t3.vert
index 2298a14b15cf..b7677129d668 100644
--- a/Polyhedron/demo/Polyhedron/resources/shader_c3t3.vert
+++ b/Polyhedron/demo/Polyhedron/resources/shader_c3t3.vert
@@ -12,13 +12,37 @@ uniform  float shrink_factor;
 out vec4 fP;
 out vec3 fN;
 out vec4 color;
+out float dist[6];
 flat out vec2 subdomain_out;
+uniform bool is_clipbox_on;
+uniform mat4 clipbox1;
+uniform mat4 clipbox2;
 uniform  float point_size;
+
+void compute_distances(void)
+{
+  for(int i=0; i<3; ++i)
+  {
+    dist[i]=
+    clipbox1[i][0]*vertex.x+
+    clipbox1[i][1]*vertex.y+
+    clipbox1[i][2]*vertex.z +
+    clipbox1[i][3];
+    dist[i+3]=
+    clipbox2[i][0]*vertex.x+
+    clipbox2[i][1]*vertex.y+
+    clipbox2[i][2]*vertex.z +
+    clipbox2[i][3];
+  }
+}
+
 void main(void)
 {
   subdomain_out = subdomain_in;
   gl_PointSize = point_size;
   color = vec4(colors, vertex.x * cutplane.x  + vertex.y * cutplane.y  + vertex.z * cutplane.z  +  cutplane.w);
+  if(is_clipbox_on)
+   compute_distances();
   fP = mv_matrix * vertex;
 
   mat3 norm_matrix_3;
diff --git a/Polyhedron/demo/Polyhedron/resources/shader_c3t3_edges.frag b/Polyhedron/demo/Polyhedron/resources/shader_c3t3_edges.frag
index c3fbb6bba004..d15d6e125122 100644
--- a/Polyhedron/demo/Polyhedron/resources/shader_c3t3_edges.frag
+++ b/Polyhedron/demo/Polyhedron/resources/shader_c3t3_edges.frag
@@ -1,12 +1,22 @@
 #version 150
 in vec4 color;
+in float dist[6];
 flat in vec2 subdomain_out;
+uniform bool is_clipbox_on;
 uniform bool is_surface;
 uniform vec4 is_visible_bitset;
 uniform bool is_filterable;
 out vec4 out_color;
 void main(void) 
 { 
+  if(is_clipbox_on)
+    if(dist[0]>0.0 ||
+      dist[1]>0.0 ||
+      dist[2]>0.0 ||
+      dist[3]>0.0 ||
+      dist[4]>0.0 ||
+      dist[5]>0.0)
+        discard;
   if(is_filterable)
   {
     uint domain1 = uint(subdomain_out.x);
diff --git a/Polyhedron/demo/Polyhedron/resources/shader_c3t3_edges.vert b/Polyhedron/demo/Polyhedron/resources/shader_c3t3_edges.vert
index 9d00649a829c..60f51ff758a9 100644
--- a/Polyhedron/demo/Polyhedron/resources/shader_c3t3_edges.vert
+++ b/Polyhedron/demo/Polyhedron/resources/shader_c3t3_edges.vert
@@ -5,12 +5,36 @@ in vec2 subdomain_in;
 uniform  mat4 mvp_matrix;
 uniform  vec4 cutplane;
 out  vec4 color; 
+out float dist[6];
 uniform  float point_size;
 flat out vec2 subdomain_out;
+uniform bool is_clipbox_on;
+uniform mat4 clipbox1;
+uniform mat4 clipbox2;
+
+void compute_distances(void)
+{
+  for(int i=0; i<3; ++i)
+  {
+    dist[i]=
+    clipbox1[i][0]*vertex.x+
+    clipbox1[i][1]*vertex.y+
+    clipbox1[i][2]*vertex.z +
+    clipbox1[i][3];
+    dist[i+3]=
+    clipbox2[i][0]*vertex.x+
+    clipbox2[i][1]*vertex.y+
+    clipbox2[i][2]*vertex.z +
+    clipbox2[i][3];
+  }
+}
+
 void main(void)
 {
   subdomain_out = subdomain_in;
   gl_PointSize = point_size;
   color = vec4(colors, vertex.x * cutplane.x  + vertex.y * cutplane.y  + vertex.z * cutplane.z  +  cutplane.w);
+  if(is_clipbox_on)
+   compute_distances();
   gl_Position = mvp_matrix * vertex;
 }

From da67575f3b66d7d48f6cb16a90af3c4fde471ef1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Lo=C3=AFc=20Bartoletti?=
 <lbartoletti@users.noreply.github.com>
Date: Wed, 20 Sep 2023 10:06:18 +0200
Subject: [PATCH 0766/1398] Fix general_polygon_example.png

The visibility zone is slightly offset on the original image. This version displays the correct zone.
---
 .../fig/general_polygon_example.png           | Bin 19759 -> 108727 bytes
 1 file changed, 0 insertions(+), 0 deletions(-)

diff --git a/Visibility_2/doc/Visibility_2/fig/general_polygon_example.png b/Visibility_2/doc/Visibility_2/fig/general_polygon_example.png
index 2f06e9a7b7406a143f6015510c736096e7fd9835..59c2cc63e99276b4dfa0c15fa268ea642e7a3ff0 100644
GIT binary patch
literal 108727
zcmeFZ^;^{8w>An0NGL6!q;$8E0>TX4N~g4R4BaIS(jeW^9YgmZjY@Y8-JS0T_xs)Z
zT<81)=ZEbzUYDrM=b2}%b+3D^buU7d6eM3_yum;~KzJ!F1yVskK!O0jjnGhmzX@uJ
z*h4^|M34r3{OpRj*BY9nI+6Zxe=Fj>yYDSnf{!w8j_{7t_gR>)Z<cg}a$0a+ZXbUD
zH5U3$Y5H+B)VCqxAe5dLbOqe#pBLPIG7-e_N<>PeWcLY*9J*gXmp;MuihrgwT~0bq
zF^xdY=5K2h?S;=5{yh2#Q&A%Q_sdCs`SGvQPJ$~g4&r~mq_)m*LVVHw?@Kft|NGd4
z8zR&7e}5MhW%eKL|L40Xh>EGhQGTw6|Mz$K1}cpH&lhNa`4Q1|(}}WT+5hL+cmf}u
z{m)w}!I5boPI|sFZU1?&FB))=7yo;Z|Gkm__{{$ge1zi*IsxKQ;m)U>`;1Ze0%yKT
zr!`ALOZv4Z1^hgt;2kcGpOKuXm`jA;uJe;~D+was;0WAkX>Nsq6=yMm(&Cy94s4XR
z1{Bl<XOv_>qR2ojiT{fw{6tX-G4<XYjiCTBGu)>8+slA)X!WitSy=_}PHSLMF<!lO
zC;g`|C3ZoQBx;f?n5(eKpWdIYdiJRxEf8De3f@?#gAV-rPa4YXlJ#ucrxS2=q9?Dr
z$%YTT<K;CvS!Yz(%J8-rMmEda3m4tT1wvadg#rBUKPn(InUt55bc46_ysu4Iv})1*
z6lQ)q9nB1`(D4kN9gqBkzFki>MgfGfk8!OoGH`f0QbY_gk2?1c+B46b?{ChpMqJv0
zYeoc~*NpO0DBhiY9s1#hb#bsDva-d{O{Fvl#CV;KfK2LBjFWOBeM~tGJorVQ+4Brr
zC?vD}3S)CrJ8<-F4nF4HNOHM!iKFMfy<wEdwIGEIGB7~GYw~-&jrMc_KP{0+y?gqi
zOGc#B)fL@7;m+tJQKUCNKHOGWY-p`Jb|kg&VJZq&Vf-odLhnU7n#@c+I<I(45*+>Z
zeuc<ZDh>|=#dfG^$78!0Eu>=_xQ0kFZC%Z$kJOjo%gb;SBb{ZZ+*7S7vFfWcLSi;j
ztkr%!Y-_kCo0``0q0tH@QP2IuLAwiooAWQ#2V$o<I(ackNy#9FAM@w*(UJuqZQz|G
z!hHj6YNd7ro^Dsk2-#nZDB_1ICQ(pScWkBP?(clrW4MT|V+_=gobT%Z(eY#^o`%DU
zN~yd1v!-St^p^XJx#P`L+Z+DPcLA3i&{OQOFyOGsc)(#9^>lUq9X1nTgNecA<II3*
zO*uWYpeT!uE23c)F@~Ejx0kNVa9QK|=Iwam0~$T)BY1CVZl4N5(6IDy@lwa<{`^%6
zCWdY=mKQGIP>#Uma!QtxJi%?p6;7p88fywh`KMI|r^Sn$RP@!ono*Fpb}BEaH2Rj+
z^QgzYZ7Gm&$K>!F$N9Qr+PaDRv~YQd7-s;x_c71enFfi_;cRTvF{9;zDqwPVRNyv1
zSs&4rrv1nHyekOGsb=S}zYN6xnr^+tm-I^~KhZQe?qaT7jWPQk<`qF9boQdneSB)$
zo=q(2mvi+78C&z7C0cOzfsi8BhoUvq+r=#N1XkRi{J^PyFyqkz?g3nPw5ZZn%Lw*j
z-Ru0@^|)wGuba>D%T8f-x3Z!?i(VDVr-o0ilh@K+eEHR7yDS-9_S_7~s6yR2qo1g$
z>gyloMtFwDJPNH{uDWScEZU1;z<7LrAyH4R`WM~L05q~5#noUr#g^tc!r#Bar7)&b
zh^AIR=*Qg#L7c3(eWw+Bi(~mf412tN0deW5D?6=Dmqgdxn`?M(mS+D=u`7?wRnezV
z?a9UBf%ld>-dX(@cFxErr6fUhL8k{sDhZ=C-tpqGXHn?tOm482^GRnGy_RX!%+2Z#
zY+~wSxF7hJgCg6z_D&P2V&<bipHSAf%tm}F%z%@nGB;*aMvPUxBoooUot?r71u+$C
z1jL9QM%}0b!BdJZwbl2dvix8EHIm2*$sor<oxkPG-d#XaI*{9ZZ{<q9bTe6I<D#hU
zqKSr?bzv_WyQcUfG>KOdSC(9irHN?i@xfiE@ra8a5)V7baIW|S>YQj@Efl$D<jX}C
ziMZ2*jO6%rLd*eRFxUffcVARlIm;7t8_7^I*mf=!#4}3#k}KzW&Hkg_W<g-y<FJ)Y
zKAt_^_n;i>&;$4CVnL+i)s*-1qDg1aYOqeA&BL8#rSq`th7?7KmYc5Prt9kMVSBXO
z=_V9SmxIgflKc}wQzKv=MNu($?o(_4h9W`?_ebe1Z%$R_J?!4s)zw2jgo!*<#X++m
z349J5)Q&;1;bZbYxG;U@FEZkw#<E1KRbI(FZiE;6+f0LRqes;vzQRu7qnXhzi*7L8
z@Jr(+7HgZ_hyPEEOye5R46QTrxmMCUTS=+|2sR(AT9V<sJGnU$KI^u>H(h&BJ!spN
zzVyJ^RdsLvb&#5XKae$bjqf_%ad4t+NSypSjXq*hA{yy3m*O7Ha<bGu<+HKP-hh@m
zp<gb5NMw;w7ok8nibmpdgkpxpgI6@(xt|X68g_p>FXv_Us8-o(aSUT1bSU>)Sm}0?
z6F!#fF?@~_RZkr=M4htL_w2Hw8!TH6F6v*b(1VnJHkN!5#SOo=OCN_~vbT)UoA__r
z{uiPE1TT``Z~=%>z&E2rvzMK8--Q|)N1gPpNU^n^;oYrZKkiCy%57O~ud_X8(Q@S{
z_qs!&x6ii2jy*=gJ7#0iIC@#CS2vEX`*!s8+i7REXsgMRVw3XHrljs9QX$tdr-)@|
z+0p3@9d$xPTr>c|P`*C-i74_;h$x3lp8{4Zo@!4H7!xNPJg_$8rdpxrRKn{-RP)Q?
z59CHyF8w``{O}`4mKi6U2sfJWyUc~biM^T8<w3ba0y8aJuwmz}LFZ`zm)qn0<ywA{
zUNN=1Ofeb{A&{wz5(*utk*LN*kxK*oz@5qO%GJFOhwa`EGHBt}m=23-Ys<O~@hNU{
zrEO;Kd}2X_r+K~2@H}~!r?Q~1`THv+-cBcT1&#ep5mA=tqvJ=>ih+re>hsw}dmO`C
ztGW7@Q+gh(rIKZ;x3k`?VBq=^fzY<P-r4yV+Ez$}_T2m!Sn^%gAG24h$jE{@t!Igj
zqJ2D<)oa|jKe`5BUk<2sO3yluT6fOC@93Qm_CB)A2HEjNOXc~dTX$4HpKQKxv?;E@
z(=i^g6qyn%Amb*K`x8o^v4y!%$z6sIJo4KUGhne2kp5@B4AIKmfHKGJzVDcy-MDBU
zuV5k^PCJZS2L})?v;Fm!3rOo)pOcgO+GsXfnt(Oi`?kM(vm^O&v^034G(RMTCPS}J
zZ99q+*xkqZ=^^}C>!Dd-EO|aRpMg~}mwCS_eIKvA&Mhq9<4NKGKI#V|0jvnhdXJXO
zQKeptp03)!#bsI}lBdGR%g$UPe%-xTMh6)}ujn?{t6ILV#5kXG`4BP4-ipau#MYC`
zPqQY<qXptp75((5Fxj&!<!USUS;knEO`=GtJFENJkfwmES2$(c^=4}0`J}ejO6kim
znIJT|7Xa{wDvu201K~l2$MLl~-=vcYa`zA{a`!7WX(E*5`Tg*XHJm}qnJt*yUQ7+C
z`t@=Tqkdn#NL#e|Pt0u^oalH#5KVK{`8l#eihDiWmY~z~S1M72g8ETj%&PfRefB4Y
zl)^NJFxdj>jC@U5fY(*gQf8BAw>33A0Zl}R@2^<!mRvl8Q$_oO?7Uq!@BBG*VfSho
zJ&7p$)MnV(E@EVSOvBQB;T`YVoQrVS=h|nFOKe$g9*gL@VPsT>`>xA=35{2)%nQds
zI*XWh8-wr46}DQi@H#z`jrE)+RIipEH<TD}fQOOF0w32%TKf_YDAN4i;u#P`aKR|F
z;k110yVea0E9IuYVeESJC~*R8D}6D!L$6Lm6^ZQT&Dwnv|BB!)Iunl<;4Rvq{74NC
z={-e*VHu7GO|5Ph`fQFkp=w|aD5L65FrP3a@_9;M-}q%TRJ7d`ry33+|7{L=cm;3+
zOW^5Mbfvpb)m;Y%x~uh)&{qsS!|Rg`jVeR1-6!a<&LN$p4~&(7pD3Lf5tB$KOfsng
zEL2Uh?Fub^hfHH6%9J8W)AT&9FwL*^7EAEUniZbH`n30m_je#ePN_vtVPk9@EHrn1
z{B{liEnhvr8DNPG2Xs%_Lm1IAz?5XK89mku?p^YG9idI+ep|8ilU!vZa@nxh*9^~@
zN;>E1ivmJ95hvlUc<5&=#tRE;wrtjypi~TV>CMXP1T+Pa{rQvc4DT;=ls5PD-1MnZ
z6!4|W*>#%;(4A9Wda@|a8^chYEmeWk6$m_>8u{lRAhJLPjmUCV41(_^(sT!n+4x50
zc-yb#TP|iT558w)oE%Y`S}JS}sF=;kh$`~tenqg9HA{n{DOR|XZBM3=WYDA|hzVkt
z%XffxsRXf>$0>xOgNSrg6i_Rs1lL2Gzt4%=^Z3;gT(YT`>x9B6eCC%7xGb(WqL!O{
zvYu$dH+dkitsnx*|JaR0$81W<e5Fx9*_?25_ePR_)Y9E1Z^EkC>LwPGBz$0hwvjPz
zW!hd(etV~meYFLe^!CkM0Ej8vl~fAUT099NmI7gz%bIf7j!bCO?DU>kKf@KUS-GDt
zRNs;lvc^t2Y`rAk98P^c!aNvFX5?0L*y&iy2GkE+fcayN|IGYDG%6%QfHjg%$-6VS
z5$V_=QpJS$WE%V(S?Yg9uM=OksQ6wTNs=tZd)96GCY-oy<=&<gs>Bd%{&TBXn-LPT
zX;Yiu#IfC|Ieq$7@*3$Gdb&$;=nqz?)4@FSYHsOalfLH!X5<gMer^s1t{?Pdi>|`B
zf3~<nmYbCuD>ez{;x+1fad%$fQ`Q)&`bEvE^lBBn>t6jD?z+@$hSGMDkctycaRz|e
zisTmGgO05Kc+-pb?WC};f8griRV06nSJ~X0m;*m(160d*rz%{?==`@$GOp0;i)tKe
z2>^!|MnqpYn%S27S8CxR;=gSUK__njeyyEmJ_=!x@-0(o(J9h_7Wp$8XRccZsbtFO
znMwrx@C(vHMIKgc&85v^WC*H^B(V+mCI)8Sih-xR*%F>IvTy)UO10t(9D1uxRp1DW
zNOdN<9VI1t7uZjg>n4l%c-zJfs8%>f1(qX4wuN+r0IW?SLW$_9Ipep2%ORaRj||@L
z#un+>F3ddWi|0PhW|?Vn;T=%Rl8LWYC1g|FJn7$bY`plUZ8yjoP4)T^q>VXN%Nk&e
zXS1kQpKYW#rNI~AdWOTM=SiL6J&@Wy(X5^@c0F@epV~2FI*6SgDPorC^<MaT9ls%U
z$-14a0zlY~t*82kTvqpAhWRE($?#Rj*4nyvZ>ENMomGQ&kVGl3Me~h@m*zo`)>}x#
z*sJk4_7(0&Z;aT``;Z{P1uGnz7AOJS`n)geG_V{$^vXMp<14_p1}T%s<lZwlwRRWT
zrEl~8T07}{PSNx2CCLo|zn~3=%WqD==bi!V<mHf*B!Gh<9hK-DOePZ%I=p^0CP!U9
zH=hn$N;~(xDn9*W3M!`;k2yth($TBj5;;DiF8QwD@|K*nu`>Wat>)bhI$1C)I<MK-
zWNbHc1<%^wZAYC~Wh5buhpAX!ccaJzJBm84&?UC~$NS&vDm@3F?o3uxY>NHO{=d5)
ze=8be1RCfWDYsC8-D}rdA;MBfTJ{K(nM}WLAG_x{JDGZ=3~u_`mA)$U`N}psi`7`~
zIJdL|Vy1Q+7Ue-w-+zPo49Ge!DLTZl%Q|y{lAx9Z7#mI6vRi10K$^k8qS!3OUxb|$
zqNU@Gs~}4}RUZ((9j2$CvqMIdk*y4-?~SCe;fAiA^b+a!>^CeOWKsyhmRx%<DpY5_
zvFR^QJ1$aonWfhtD+(QBXlV(I*REB@@vAj(iNQv2;-MOi>jKhwvClal{h6!W&r#Q-
znH*aRlY*&Z|G-c;FGmCqdq`|sRwU`%lF@A_3eDsGfxXn$H*|%<CmPyefTpz5)YLSe
z?FG&!_t@jSTYfHL*VVn1AidNv#g?Pd&sUU-P|aIXV#A6!+J416l<bBZTNDri7Cdq$
z@u+bqh3cgk1*1KHx^$&_F24*&b60wdBCdy*_MKCONfvxD7lWPZ``kOt+r!A(#!yQ1
zqFdVP0js}A0`8)59g^{scVCEh6cf26gV!5v{2L5=F@)~V{=B+v%v>cBYIvNhoJ~*`
zV7Hiz`*Nt#c&*jYmLUcZ8siq<Nwq8}KX!e}+I*Q_V0lZ#g~4DVgTg~ssY8M_d5{=1
zw-=X}ylITHf<Dd8zZvh;giNTk={iK)JmAUcfMVubkUagrTUbUz&UN@$)C{l@U2G+M
z5)4ukSh02h{M@BbB|F5h&DSt=L8TQ77l0!Ewu?GJoN%(P5j6u?J=@-NjFSrN!r|C_
zJd_NU>1ar_-&t*9S!sU!yLxOxsXC*krD`c{#CRkQ_VAlv-o~wY^M~cp?b74o{u@tZ
zE?3$zz$;&XfSiEycAw}85x(GMb)+QQf3=1svgwBDKi*6|sFu(M2Vh|DtnFy{0p+;o
z;x2)GSEznh=ED^^-Z43diZ<_$oydwEd5jWa*;mTHJsD+s36?^MojKs8jz1-t;<za5
zvZdr~lJ^5sm%q6n*)=WgcPE1y^;Rk2pxMu60Rx#>01F}J0U$C<d0X@!M3N&)6tf7p
zJY2)6`@X&zporr?XfSFVH13buwbW#?FF;kS-O>YyGG?38Ahi_DEN(cwb6X$ZzLD1U
z7h=%D5$!P^UKLf&FhR?UD3J%by~Tx<!1BNs)lh}@Hx0aEW{kw1fl+20hiUt(;re$u
zx*e>n?&?*_`v317$u!retm02)>Tf#7@b0kf)~1&;;l=Y1|LciNp>UY#cUA~Ld}kX~
z_%tQO+<N~b-{0*`i~JsNiML@Dp5bv$_;OuObLGYaLxJLlCEcirHa#cH5%9gvEQ^ep
zY{U3(&6Jy5ujZ@O@bSsXO$w^)Q)M7YNdy7j`I%#f3W!wv7+-V}a6gr`j*8lzU<vVc
zx0~kW!NM+w@=<A-4lOS}E!#7SxFU?~L27j?7o^0|XPAU~0ULw*V4mNRpWjH?5Alyo
zXwgFEH_>&8@M2muj{AX%ds$`_8xe9@*~GiV43X=@y=;J>{+=E!R;?=6Z6?GPxvLbk
zup<+`fo8pbf-PwPw&)41fjoxe*NMwvU&Ekt#1cjZ=lXEaxHfM}Zt0INRPN$+lmpr}
z<cZv0{Lw84bV{gb@boGsL3q<`t+!~|YcFskW>d!MXs`@dT7V+_ocRHw-$FOHe!ahy
z+(;c5MN*Pi!;AmQvM>1b&qylo=;4Nz{r5H?J|mKW>*zsqdU|@OOqSLv1N&We|1mt>
zWf5_1=omku-(G(yvlA_y>=VSOZ@kVl9g3_da?T8*-nU7PwWA46Or)lUOo$~#?Dxh?
zb643aqPG6=+K6F?M2C%OBFA0RCiR9Bt+D%DhYvRG@1_RShXFy606g?(52WP@A>z@K
z<B>~rpy5dP7(tch<5car0jk_uJ;hq6&%aqvnbnB9cE{gYEtK$G&NF{ks9W1l7v<6u
z18N_Jv>;1%SO_V#;{|@mnDqi_-`}{=6MyTCoq3%Mt|alcu|Fh1B&LDo0u_Tv?68~j
z-RJy$iya_HAW(&{1GOeQX4yZC_>MkJ+38GWa*))1moLKDD*f^@^{@Rx+{ZW`!RGdS
zGBYmt%e%pux57Rr(CHg3jF_V@fj^q&$7o6&Hb#|$*v3PjQ)q;SC+UQ$#Qd>8UhF+d
zcAn(#vOdF8C2U(HK)pD(*>i~`oo4h`Zpt3CYEPQL0<N125j~w8<zGP3A;!H6|7#C*
zKew27S@L?NUP_p(hn`1}0P`&2%e@IFGZTZ+9(CM5Mpk(3vw^yUj}F+P*rx(ONYib(
zgH91Y2?bIQ!o?G5*7h}Omn}*)&s*@DJToqj4%S|3b0tGm3u_J!`+_~pMl&L#MINRP
zd46BMo@D~a;%9&?X5;-ie#%=olm;r2Up-bs>5uxUqZ?Z%6-F+!&Ct9rk=X$Tad?O?
zG(t02Vw29Z&2o2`>LV$T;HX-btu%6OV}h-&)_lPZaihTx=5YJ{db;M;pw|jVFBnY%
z!Q*g3e*m@lL;q@q$3bU-d@2njAgFK+Wbhpzivh^_-2f`kkt5>cYR8IJ&c-jvPZKAs
zwUpi=N4t>R+|e^wAZC{o&kmW+Bo6P6TYQjpgd(*)oD14br7KeX^(1B`XjB@B`~c$z
z=<43Dffd<$>s^OAZEasyWGPxcaS*TGB5~JtVR|?fjP622??=mpBQ=pgYC{5<7>f+l
z>(*JvzW3DwSpajVl%8GlB*0uz>43U1IVK7q63JP}a+8fb(lyouf^qSwwr#ITcx}!E
zMURN*rbL>u#uB2dN1i`O3-!&`y;5d~|890vihQ@*o))-Spm;o@VCy}ZNYi2Ok@~|S
zL?T>ai^1ubPv@N#4+iK5rp>pINeH2c>y@TX%Q}XuYMEYYn_&!|*$JORw$XdJ9TwSj
zhm&9Q0TUw=NM=J3Rq44;%&r5tvuE7Dai7dJ2EVc=_%6!^MYe4@{>E+>kQCF2p3dti
zuE`*aV0PPNu;{aTEXkWy_b%MLbeV=t?_hXfyNyLmvdVGy%YY90HsALMlkp#WJ$F#`
zFXzQ(_p$jpZerlqtQ~QJiVUs&lvBYEoVc4QgbR0*4Q(5vCYE?aI%?sIV~54uAcIwa
zW6HO1sYg9^G(;&GXoMoWOuOt?f{3WZ0+@XEH0EsQZuNg~Bt-xGX~UWrj8!G|`uix-
zcFz*${yKk%q;qpd8L4B`Z;5QocOF2K8SachMh%JQcMdUMvyWi|rHb^fubC~cMPD?M
zd@Ar4+W-@Lz(dJG$6`<_%&ds3auJriZ})`>n|XO(=!M+>siQ)oLJ$=zg#GJ^-Mlr(
z`S`1nLJ-my@!Dp2d6~1`wl*+oBC}UzvYExC0xj*m6ZvGtHQB6+uDRuTu^OXw8X{E&
zf+2bqf0{UpvKWnu-P|WOuIC`}59N}3><x4rUbAlHJBcxTacqnIByBwohO+pI+Orp(
ztdWwHH%<fbj1LBb^_lA2*_bvY^SY3DG&w6EwnB9u23i5bAs`cLazPE&9!5qK(i{dD
zr)$ij+ZSj8Rm19STD79RuZt~)!qCX59rbKK75EwTmg(QV*&Kzw2^~YE>DCQ_aRFR0
z8%ZoX7QadAg*k>vj0L0O>8oecZESCt1hOrqoxaR?l~fuZzf#ybd2yQn4&&mT6*HSC
z?F+iJu(fqrJA3!;9n^zF-<$JeeMp9&=;ISNlLEL2B^4RqOB~AR$oc-it6UEC<kAHu
zq;-{)`e8jmu$Ky(#Xr>`Az51+U)DPLe|>@2%<5RV@%v9|@XiwZVV+YiAko`KjDU?0
zg4hOTs0=rDCZ*7S5#!hl<kD((%(3bw3&Jsk&i|q&A=D?;V0*Nvkj`x9sO+(DnaK*S
zZ4Fv@3(e+0fDQ&z+x@=nEfGfs9i;y3za}TjKs6N=CMoz-O?H%^dfx6ga5`=dQQIZ=
z+e_MgAa)X1&D(iN=ja_cf-k@>rVjCUf~ODKoxfTVr*gm%<i`XtEC~*)=WXRU(m^6d
zf~ZJ?vFy@mR`mi8_CKRnjoHZYe?h%C*taV(5RfmpGp;%f$|SUT7gLk(v;JL8?l*(`
z?d2itwOQIqrihjE!>d{<B>Yq$a~a<6&T{@o3y{?Az>b8Ufnd@H3gEC>2#mPZeAj5V
zB9^Jjak6ep+J}+<>wYY50BIvMe(Fy=RWBzT17$gok-N%kP6P+jr3niwqDguBt~22N
zaFG~7S{+y;QJIS@C|+p<(xwU?t_ZZd*{)Gu{s6mnoH0py+X+&OTrk^%@w+v(qWygZ
zBr)ArNqEeF1%Dv>$1sNDXgV=o9>amY$IG_kNZYH1Iwo<SZZvhd9oN_8HR&1P9<J9T
zMHo6>`(=%%BNRDMH}>DZ@U*mi&3gjN-8D~OS+aC~1!T0fGziWSAyy)Rl0KD)n1r6a
zclLor6f@h*>g7GyK3C!{xN&^isDq})F5@#)9Gn2-rjy`jP6BZ09_I+T*rgD>)o9ZF
z?PcR}9|?1@3N-yUr&iY&>xsR#_YWi$iYdF>h!6KQ`XGT;3Rc$FJye>3-J*P-SsgA~
zSs+!hQ>O{7`rV5xxYoa3Yz{-;l&IVOM9;om4#4JcIhe<2GqzNj(q_`a2Z(J5U=T{N
zSzt~wR*CFRJ5b`22TGB<1KOy4VXv6)T23|M+Q*9>Sl0*Badg-}k=RBV)tfAo;zUgA
zHf~`E9d*dm<_Y3NJ5kT4*{_XM75px7*te8UVSY=>)?`jzc!$AjHlDcGnYU*8<?^8W
z-CIbY$D$j2rS)>rF|A~<JGkN%kjfDOPeldgJp)qNn-m0Ee=4GgM*Fe3%=<mFS24NE
z56Wwu?;#uYRyNMxRQk?s_74u6t#_zaTsZbI;kjjX&xQpra?4PpssqGp*+VgHP6MO5
zU`Bt?6|mJhHk0D`tZzIk78ZY+7+w)k-AYn;5m-)@ml+H*M<w!Li#Q2<Lf!!;m*s5(
zvPDnrKNBRvm^Bkd;<O~EU0^^|uH2kZSF(1g{HhsmIR{cs4<ZjT#Fjbg3mV+;<u+sO
zYjU!sn)gHqB?jigMgu`&D7G>c29hCRP8CfF%0d#`D(I9c{VQ!AQ>)BGUJGD2hG}f#
zFMEyZh1KT6wr~_o!q4-%T<U(}`XB?Pr<C567w~isF}|wDnyNcMcYnv2Em<937@vPv
z=*v<749l&RH2bvAf0s-u*&3eV<&3|X)=W^<|8Z{?y*A&kz?xrucwhv}>%yk&y8yeP
zWKsAx?vUQuD&t?nSDA(S5V0iYc(W{GhaAaEWQR0vGc4hUE2GCQHnDA=KTiW!1Hc(k
z#id~Y!tt;m;@4lF0%eZCz=^8^oySLe?vyqDdLJ5tlQguhm+C4kipL4!+3}KW*mCK@
zBo%FVA7#0Ml|G?XaeUuAqQ<RwGZEKh@NPF|x70@7E-^%ke)TvY86ZG=Gf5xctBd`L
zWaW+h8$ALwhFZ;VS<N?&>yEi<LnB6XA+K=FJ%I$!$8NNtgiI&omqm)4A7Q|NW0vkj
z=zK80&6lDy?ZC34Sw?@@yI2;_a<kBSS>9nHYb(yRcu=f`Pr!}!X|*AJ*P422j&rr&
zI=*dFiC0V8!Sy<Uqd-0ra|APn{cqG5=OHQl@P}pj@pbe!mS_{`_AHfBIADf44JMhV
zmcUQk$_rboB$FHi6<Bd=oPt16PE#~57RK^V+PqB6nMzt9SFMd9(tCT;d0#fWd=GJX
zi^~l43yfxi&^hYO@yE5G72eAv;DnNP1YlS6`h%0E;>X;mcF!?VguR+l*CseLU(dKa
zjZ&fjRgnuscoqPoF$CmNd9})_dth|U%gb)5bj4Ca=Y8Q-nn)LQ?TNdv@OtX@Y?pU_
z8x>a}e>Nt>EPV*tPnzp^FR{f0%K)a_R4I~NPB^D*jTp@8?IA*NOQ(0O?>JOJP+n&K
zdFMIntBDHl4J8WZ2P4(;rgF51=RkSusx<ZC=@`K5x9+Rb{Os(kj<_eCKi3zeFaEvz
zlgfsr_&ZC5$ab}{KG#!4At0BeT*qEqbh2JHf^AWuDs1|+^+*x8YJ&qChFV+HAuPvE
z=ieM-yCC&$>u18Rs{$n#BEOrrfK(&1T1DoG_efDPKnT;rC2}>Yjep^;r72Uoz8I}C
z3U+ONOQFZ)VEm=R2qcUN3}N4RKHidy&CafUdwuLttp<XZ23uCT*D;By3uk=Lp{`=H
z@@9<~RZKT&5Nqpa?Clc~BQloXq|b28VV|P&5dT(;4>Irv#&Ggu{_6E$gB+YAY6FD#
z*0X`T<;^3}NGUuTXKci;-gp${Ds6mGY4Fm1Q>f64U|ptbK5LH?s!^4hLV07s?!uG3
z+wly$ysL{=_P$t60&ekf>*|Hp=lB-Q_j3)l!3i*sn?!;lF7ZpiamTZMS^^>Tm&PxP
zxKzKLeChtcMOVPO8GOWmPv;_JuxAqGavT^nD5r>PHlh`%s(6p|%e8Q-rcQ{cq%L?@
z_s5uOT~Rn3H#~`UEP5*eC(^}mC5U&qXkrwqKy+<bFrQlgo(e)U-i>aF*mBf`*?4=<
zywH>od7I+{zy~Uzh#|p=!Ftk;xFAJ;xFAks*VlV%K^Te2#;V2Ba)$-}?#cp>9EL{W
zjDBc9KOJc&-To|SI8L4yCz{8vk#Au%lrofXi6SV?mx5^(jg)Oi$jZ9FXLItxvl?yy
zUC<$)DWzBH9)xdYnwZ!vcOa%Y&wkDId8Vt3Oosq?6EcIbi8At=1YfW{OOC0S>0HX8
z;6dXv08vlpOjCrW9gMAnI58#WTFw_s9Msqq4to`a2V(-=unMmSDAk$#n-x-=+1^`6
zQ4;Qp3Ss3jKvoQp*`{sE)z9XyAPPHjX9MtfaP%K9Yxj3yMSn&eCd!~f@Q`7svqx_W
z$#^4g_F64rDIWaBBuV$1G1vAims%3;;MBlm;#$1bf*P_#6oB}fVIcIU<_-p;$M$oR
zD1X=?DaP9Ql>TMOng2wwI8^cxriMv&K2&dSqmk7=lDDZqYK{daz<k}XKJFrN#rLpQ
zt&Jm33S!AXfkj~k`|=eYpHSNc;5IoBM8oYU4cVyouO2R^jK*^w85&Xs-~Rct603nx
zQ1bYKyyk<NH;{!;sEaSM8&fLh-ZMMimID<E0w9n21Q1H4DP%e1<k0eRwj?5%4&Y3O
zn<o2vd!_vp(G<FGIs8iWE*2-j+ZeR;DQUR=xJ_2V!B*&3L&t@N+NZZ6bXe4H2K{OT
zY48_$^jpP<_RhvgvP-Pg%_gcdhU`UGKj&bcZt6ywWw?>g2+_ulLrK4{(NrUj@5%3Q
z>ee`*Nz5(!JbI;h96-Iz(CI>M12%M6U12=qO(|%9834`{Nf;4J3veb5L<~P^zt;8Z
z`<BxY@xZtYV2n9XvnKaq&sETLeb6HNluEWUh0+xpLznK)z5s)c*L_*z#>lIX{EJ*h
z2*R&;dXr&!(VtNDvH2rfZxU!HhA!^$)?2wBLYN+x&W+hJX=7Dp*7X|rVrEokvL|1z
zhf;a5eI9R@?srt@Y+#z2Q7uCd6kK!Cr$oUhy8%L`V?ivD*}(MK97?%5>c&ndM)s)r
z(f>NHD#o8WKkBl^+3;hiv160Z{SYM2rGBl9EYomG-`6!K(44?r`gw`=;5alFLs#j6
zMJx%HILw&lIRJgIqm6j6>9|lnQ1_i#HXZRbjCRmpL`?!{J0nk)YOV#23?%;I&R%o>
zzQISQ+d$~|;|bzYa+Jh?IQ#}^K}_NsM!hd;uFn1_E|^$R(7t6rnisC;8e?|SJ7;RI
z`H(*Koh^x(GL_M=(_gl7wF*8?IuqUCf>`BBK3DJbmK0Tm(HBudgiA8zG^ku<(Y-|1
zqoMg)f9-?o@`ICx!?+XM8*|mxe8c*NmkUaM(JRMl66<F`f7_tbALU^|?yPZia^Lll
zvMi(nnVvE`bs5{YnjPs}!I#}tZB!npR(xjWWHa3`2S^$&!(Mr$MNPos1TKu7F4p_B
z25*KZyH<D#(%sn%tDd1rHpNI0;$p$89O=hqF?e{1IyK3^J+&?H(lsiVQA@Q>W1DR=
zJ}EZ}*MZl$W)`E~7zG*NOx0DRk;^Er%{Q06f85HAzSEr_S!12uKK!R)p$0rY;K}0~
zkgsBwppJ!>AX^8VQqwvH1*ILUxoK0Nz9FqlR)JrCq8ls*8*C1_X`BwJ(cmvA%<_Gf
z=F@?QCn{~W{M61Wo}l1yUA}OP?*IvfgH~~(GI{WuT|CIZLRCY#8b{w)?Gt(HaZtUS
z!s-*kS@}DT`XWiZ-Zt#lzewE9vdw!2&hi6z=$l5ngm+J%N%wUqc$luk$x^+}dhWgF
zd5Qjc&FhGvYZ91U{$o^5s~GH~XE+1D&w!~Pk^apq(@YO^VE$tx5z<yH7fsOAR-zO4
zb-8R`R{{C;Ot_@4aZ8|U?K2YIgO2UOVX$9!Tw`>8QHWT%P;lw~8^EQeX@(Qy>+JaU
z3Xp27>ud9vRLp3A>0C6RELQXf8gBCVTZ+Hm+b%|wls64jh?&qaJip7vK{l}~<(jS-
zgKj#2&x{3h5}1QC*9yeY`MwOKOxG5@4h1!<=WCJkmb-++I;b)iK2+B`-q&V^_sNFP
zE*G2S;@Ucgy7B~1LU_sDj9C*|+K?c;-h9j`J}sz_H4)>`1nJ5&h8?=yh}sO-)leI~
zsby{)od!#DMkJ~%`~Q+F|3yUf_{A;LeW6O~c_FxT9hK=YH~Nwe@-V`w!!NdFC9b(O
zZCX}Rk~{zHC7_q2=$=qt3P?;;=*iL5o7fo-92tgN)QFO5F1!hS)yY6+maxo0U&KcZ
zL8;BdHach-ta8}+<}h3=&%GJE8x?wlh5BKThu8}<af7vC-X9=H4F_B-msvw7qpyd&
zAQ5Oh0*K(PH?4sQBDg<|kR}3<xS16{oD-0{t>Y$@7}Sw~qu4z?wkg7i+OAWhr{Bj1
zm1`JEB2(%gnMNiHU0dB<mtm(3*|({w*I9_cQr_NWX7$Xt+qDz*hWB8wiNX6y!;#7u
zM>t|W(%do9De^y~@M?jf>lS?$4Gq9Z3cA#&wC5#R7h$O}$cx%#nd4pZ#BTsXmZGj^
z5G8-K{wpIAemYQc<%l2-w4?pyLmUVOFC4U9>Iq%1$FcQ#g{HP{MJH6o>+CinbTDPt
zkeBbF*<b%owS%XNeB^N_wq_M&_<T}uku!Ep1rPnPyRehvIB~nzOz*a0P96h7w^wWK
z^E3Y$VxEWJeg(!WR1kqpoT_Y2&rPoXHZt1ZM*2z-JYm3J^<%y*b-qeS<PtinnkSe3
zmdS1_9PJ9=y}}q}PpsvQUsmk`&>(UJ8d6NL{R~l|zO7rD?_5fSGscvo1~QqljiP^x
zWd~k}yG=Q>k<SG)1T(IDr;!A0vf!D?#x=Ah(t_5&m*PNc9Y336ZtT@}g^kL+HdT%4
zb%!Jd+bx26#xwWWA7jTJte$d<{$H!A*XvVlntp+I8p%D$<sSUuUv-h`fEMoph|Oz5
z7kS4Q!K0!2^jXOg3lhxu`4lV3JYhWIoUqy;0N0ua7;ej5K}oAsuuL%1xSte5xa$ib
z5QPQBuJ$(vs9XZC?3?K!$22&Gb(W;&7O20`N4R2O^Ze?|MTL{iSU9w2Q6iG)C&*#@
zlLM`^eHbH@6?5wRDt}Yd*z^Hu@Vw9C{egwouO&*`+-^|T$`eYog(Q5${i%=SS;Vf_
zLM$&Y&xY>>Hfbz#_i#!rt)jB~ob4F!hG;z2o2XDBGhnkIdVEp~M1@f)Y4JEw8ZoB2
ze^{aQURjJ!%Wk5~N^+{}HJ#XV`>s6A>6*d?bltWNHzP(TKdBsTY;Ou?v1j^IIX3Zi
zZN{F5i>-WX5!_6((<s4}udlEK#E|Jwfm`ZfFxyZ;wn+2^n_qD?BsE(L-tN_m4<Jq=
zaSQ)diSHx&g*Ok;lPhds#U9WDlu#dTsY><EwLx8EA(G*2VSU$H{K-eSt7@zc&phGp
z=I1LS{#p+jnqeNzme{8W-0Q@rRd8aclNSeuI;OwVVY=6(zA94_QJYNCaX?ooil<1}
zm%X!ihb@zYM#>B%V<WKE<&(0--?z0A+HD-Q8_^+`A@rKU^T<yy*dMmT>wOc}4<%bW
z!=CGR)0Os<>)Vz7!M-_PkZJ9TQZsu0My1Hcwqq%T_lkXP3{2$(T1CZav_M?vppDtY
z)8f;St_{>UeJj+q3LeU|3}8(iOIZ1vGR8T<a+|=czS{nH+s>R3W6xys#Pk4#TDfVs
z1UkN7AH6{gAHJZ>9H6TN_*9+O1c3#sKzD6wKW7=KMemJ-U7H#f)qJf{dkK~a39lNo
zI=F;aeYZaclJ>ewm-|Iew_8j4$d`xfDT9eWqe)fDTS&mLL}{!4axGfqqR^%0<nZwN
zr?=i2;JO%3uFLp!;}fz)vhTT^wWXyayNxW9{vu(@TK%%@e8oX+0L=c^YvOqgTT;x5
zEtEZ=ffsBy^LuV=)`9pJ2z6yMg7+O!u3hfuje#v4?Ke`5<mC&~DF=Q3S}FAVHX|B}
zn^AO-H8g9ShWcu_W2HeS(vwQW$!tPp2AhgR00h)>z$rL8OH+Z6egX1r)nISCGMwUQ
zYnM1A{8h6dIz_sB57p@lCG8D;cBy5|7Kd1n=1TZ*2D==q_2OMzK<UXvnObDUV{{4Q
z%gOB?%XNyl;FOvAfgD@K@*jmsT>>V=n~zG2cQQ}{ep4FtxPt8y0x-)y-7%0Yq`bT&
zMAQgS&b^c1XCk6fN<zLeEJ(AStwrZubTtCAOSbhu+XdcqA9hMDT$!d-$4gel+Xq|<
zWHTeG>v}yuXxc3_mp*UIC=;xwa0o!xmPEU7_)uNAI~FuzDXuPx8O$tgVz;zVVt)*t
z;?F*vrQ!0rN7psDy%H1JSttvu%g;w4(uKtMSe-krJn;=VCBQq;wT=er(f(ri!83gp
zhX-Y<*04>=1jHoytB9KO=kN({-z&%}6sa1Uy>$N8Pn`sx{@T%gKlfUSUT}f3YupYi
zRD&GgX4!U=b?KJYh(A)lvDr<eQ^j&p;xfO*9fooqB(mJF3!RIw^JSmrHOOpv%H3OE
zV*d<%#q1c~pYAjX1i4wXhk`}Uouz*)-diMcV3L)A4D`Y5sgL3^?~s8Rr(G|xkz7P;
zKUCotri79IZ6E8(LnJT)Y3cL`FCTCkUu8b-?;dStY-G?TmC56e|HzYgY6?Nym~XTv
z)oIik`*xGATAnfHluPSH4D&e{oNjJ-PCDeetmp;WO2!s`c4xQKkokBAf4KBJ{Yeds
zBLEZ0r&X&dfDMMwlp6Q)1;^xFS*Yy>6ImUtbGWSR2)B+5ri#)nCUV#N<uk#YCohVN
z7=yM8M<g4s5q?WoNS4rlrR`Y-9|q&rq0Nsfp_JdaUf7wKg-`OBeKzkp`wEAS-~`||
z<*t`VIH$B|^F%$9(+5UJY)%(xf2C9sUOX*%;5FH^BhdmX*(BdqyAsC^qDtuuvhIBF
zEFk=oWp7<qFFSGd_^5rZb^gxs!~?w_a@m;2`3<sJ3f6$0B$-<?x~>hO6z*dHqY%s7
zF-CtfDn3CFk0%25hg#HdLcPr#K&#sF1Nr?Kh)mdXI^9_1GKk%?v#zWbZnCBR_chg6
zGLQiyHOmJQ&`9x-=qy`OTJ4~E_th^CZbu*Q6nWW8(g(dd&C{gykJ5}{Q@+g8%*7qM
z$0z#MS@JgVe>NJwm+HgRb7CsIJ}FV-|6X~yRxBg=am#Q8PbHK}<ySzmPiKNgtNXJP
z(yhiNMX%cQn)T<Im^N!QfCR+F0H}?fLlS`&un7{dD~195fts#^s0{rLyQzvPQ9+vW
z2_c(K2pVjk!Kabc)rv!aXx;`kHD8Uqz70WHuH8O88Z2WB6c5&MvSj#d$2G+aX|>*z
zklmVQq<XV0LDh!+N#Tc|qRZiPvm%4hNsFS3>4~H<&S6h1e>b=Nx+%Lk>jqV;5-3~@
z9na6666ha1-)hQ7;{mGU@!8nx)uxxcVlmvDM%Z91(xGT{z3<{jz1DE#%c)g&wm6qu
z|9O|o=pzauAIzfZFL|F()L-swYHsM1#Fw8$*ZDb;z1FEMS3j{@Qc5JPry<<$Ok`C~
zy9?6Xus`CXFXu&>i5c2a+$xRCzwhiY3;xr!4TzYPfZ4wKFY%?PI!e^{gfO1n8;;3)
z^@Zdo(1-gazhpeOPux~2f8ak=mDE6{Un4tdL+Ce}Y4`r&?)Gx*$3QdF7@45E&bbAT
zo){0M6P;zK2JYQ)u|Y7q(;mUcY(UoZl8{wTi%`H8?Nw%q{xeH1n2DEXG3`=DOi4xC
z8{5`%H7{eaA_6}nK!xHGA-emXYV0TS9_`>A%A63V49rb)lyB_?#K{S|_i53;nlNJT
zSYV#0MX!u|&`kE~rmkV-!uCU0A}E+7C-18VZ|vU64+NoX=5vXyf&ERP?7?V_Esc#g
z(I&vup7-c%2d=~b4E|%@c`PKtDNBs9F@-5Q;hRu+M)&>YlKyUV@Naq~7_drlki0rM
z49Yr2)2NN)=YE|#v_D&iSz|VOpuW5()b=xg%6x8L3zj%-kgK5=&zyuPe4Fy;dlZEz
z%kP7NOPRivK(;rmi9u{i8-RE%AabmV8oZ?30&u2D2r7(>7c<j)_TWj5;@~Eu%Z~@g
zOphteL`%<4HiS_K<KOYS9%bE%cV1Wm6#xRTut)%;mNVIo9I8&KP(Z1P&!N{d3E+x|
z(XUwAd%cGDE=myMnQ995u8nU$atRWAGhV<gHxRng4lo-HIwxGWvWdPcnCMKH2`T%_
zAF96nLI9<9ue-Q#FXO8hTO3%MO7MW8MjHvXe9j@!){8W}`Fon)t{lN%$YNFwD0l;c
zk`5enOQ)!(tc~?{#rO7746CivuUpQ3%j%}ed0>^5=^pVVsoql~;Rgb&+n=Denh~j+
zR_Vh_^>Zf{2SfHrpvS)gEFE3sI!(Z)4ldh**piNW%5z&`mpPuC0j?JG3Lo~Fr5XSY
zKCrM<-!0XE0Emgke-h<8;!PC}Y4!}~jkKw=Ge4)f2pTaB2_fwXlbl@ZLQ%i*o?Q5I
zkoT8J0Er#5NV^H?Cq;G*yhOmT*<yl;MZax+qYo54xFf=6aq0GH0Av6GNTozlVL2Vr
zOEBdX-pequ25uR{+p>YP8MDmZ1(&6LVq|K%bHrYnLKn>;A|z#2+jptVz6-*pLqDQ3
zg^!!!p!<SCDMo=&WMtFdqH=4lkkoLUFl{IT$F9fu$+d;2&~<THL%TINE-gxR?=c*_
zMcIPIVrp#T=f-g#aK&JeLuOu{S1|w3AHU{+)fbncbU~s{_|OHX`i0e`Bvyh9E-|pw
zy3qf62jgi}w3lzr{>ikqxp{7s{c`RSXtg3;&O0gwv`Bg6N3Dvd44bxEsHxQnKb{UJ
zJ6(XK=mc>>FS6=hqDeZS*=MLZe+$VuELO+o^5OqJro4<q1<!=>>x4^507ALEl<DT?
z=hta3x6&lD`)8QnNN(-%uLlstzmKx)um5p}4C8n~z9v$th3kh3G&C%akkl?f26@O=
z4z)zZswF2s=p1z5dD|uG6&JR>YpfP<+tR{UQ!&0OlKh6XgW;yHG;Xz!3KTLU<+a5^
zV1hV`1ZiXMg1OkZV2DACPLk1MDg85C#C0U|?o^4e$zf%=57#X0ZfwJ%Y>F!*Z}qeO
zCgj>Vk!E8)aDExh{vZ=AeDgCEdpbiFAG)))=gJDsig_v!ppXP!Tw)ZYi`ZIP_OIhO
zZG5&(+jLKz+J~0Xc?uzCf>@4kNtIGMs&#qnkUit?fLM;Pj=^#1dJ#j%eS2Rje|Eg7
zCa|I2$w2ZGFt{jlDQS2Se2dQ=*SK8WZgjhp5n^_{d=D_6SY~CW>advPu#FL%N&Xxb
z$UGpM(M$I8Y9+C>VZCBWY2=KVU;O>sA5aqAetjRa#>L?OfcSKKfKtP9xl45tWWa+q
zjX9y07%^m@j@vlM-cIUsw?@Hi(@pgCzD4d9S0E|Z5W2(l+}WQaTky+(=2iFM<2Um>
zvK1-RZJv2-LGi$DaKqwX(9D)%-vAX+!xz~oD(A`U)e!P(QL4oNFlKq@57kk@>_Ipq
zr`1A|<ohX2%?&MOvGeoZjQkyV*wVGtNDBA!C*Zgj;Yt=1ENpWq{u|cO56q$@`V`H=
zMaA*a+CZ-pxQmPmX1p2SL^j!P?x9!=-uO8{vW+HaeOj_*d`l`?$r|QQ_+mqCc&R}&
zh7%<y?c9NNnY)fxc)QD@DJ1n{ZXfjVLlxvQAgC96!drnOMhfUAud0R#ar^b}3Bode
zw`CL>n30nAEAX+mp2hk^sh(dtmHT{G17$tUDBn~nCD7s$vmmye6_*q?vR-k$@NOUv
z0@yAcFp}b*p8I=b?`Hus5ae!m=Q^CtJGP{Ib~k6HATBFQ-!;5oclr}mfbr^sQgjn5
zapYPP_}G8Wn&i6-(%d2wC3!%}Z>Q>HhPQabtNBS(eD}5d3~EEQeRu1F`|#3FAj;@>
zI(XgkvzZTP^g52i?+zd(v2`1E6-B3@EOOv%J5_(<O>v27ffbyZpAvTFu{%;|B@MH4
zbHEA?4`9qk;(UULOB1B(Kfz-g4zH)qB65>hG$60ND-EAf#fY0rBbF8E9q+uV@vBGa
zEfdMcv@)}uAudsG&8XP}lSFQOxA?WTBAL-0OPds+T6S0IiGdP6gn}wrABDRX>Hgxt
z*2nd!#7j>vH7#)E7Mp2?=$}QS$ss)PZKeK!9JDjZj#-#}dzs_cbaE?_%TKEX3h6tS
zpE_IW{-Xu3dG~tnaQ3{al_Hy&J|hbDMW*Wu7L^c1=sMz*b7ZTAi<KEkqaU(O<?Ub&
zT)o>J4yM+NXTw7k%f`c#rpy?kOgZShJ}vJYNFebXVqsRaOQyF}gqL}=>OONjA1!`-
zwR!y?*)K0T+QS!>NB+-PAOpLnsq0!^E-33Qprxw{8(1ICA@^jQefZ221nfS-%sPy$
zGux}i)nt50)Ekk91RT*byxo~|#sik^-tKkI#*&wozPxCpHVeuc;}j#ZxG3*TVaPdF
z;E}vA{Ecq5nj3w=zr(`K%*)nVU6csz!xt#g@&Xpy?AIcBZxjtG=5JB~X~ault#9fG
zT>2tR^by$~4@YQ#3NnB3B!{JV;}1KfwSc3Her-ID<=vbgowV+Q!r8zAPH47=$b2M$
z;mHZKmLTP(u*DKd46?)S?QV^Yfu9C^za#DTDD`el-h5I_-<3yDHdM8&F!1P3`kW+D
zH?MkFv2^H3e(iX747*K9#u+Wl)CPJ#l7I+^{v$FSA7Z$JM&QWoALSijeKBmeqJ0r}
z)&AqSWeb|Fl6#B&9ADcUW2Oj^w!Umrz2n}C&K2o2gWl&PZh`~$AG2#RDmpEuPAX}O
z;&~;l7=HU1%RWDFGk8VF3LQXCpRyStDGuNQRC%1I?joHn?-cSzGITdjXDuswwQXBB
zB!76EmcPSICI&2npPQB-i@TMCko!8GzodYxO1r^^%m$!lE_z43GmZOk3<8tffAO14
zu<wYIy!PLNsBbHG$tdUdhEc1mJx1!xNSq<%EEW-M*Hc^KTMSVVzwOZoc=5pk0iP`e
zO-Eai6ot<Hf!y3>60I)7;F3J;cKhbjRx+;#xzBO9{&MrueL2O4`Vrhd30Yio2;j{U
z>|Zt%k)y<XmFwH6te=#TfKY;IglD`aGE%k7q-za5efJ1RFml59?H;GPd2tIsQNShu
z^9zh)r2Km*hl40hqEZ+tnqbK<BN>xBR@Id7K}Y+yW*~Lu>J`4}>YvthK<YLp8UF<g
ziJ~>VuE|d@Tw@Wr*`gjw=Il0MxOy(NwywmF>z4~`3Xr8oUxbP3;{Qx!^EjTvWN%z5
z{>0C|tLS|a*EDjOg|Cm~plLhuX{34?6s4R=YPT?T*q83|AyjG0m!u$2Y=g>V7+i_*
zH@ftt^en2QUd8mW_a5<hEW(clcvVe)$Z#rkvh&VN`Q?7r=}gx1S&G;1dqxt}_0XM{
ztIVJuYs#!bMKb{-c^QsN;F`Zcy69S~Zo(Ka9w{zOUVFT$c<f4K)z;Yzm?H_0(1#vT
zsR8;iaFxS#P8?JR_p1GIl*h{Ufk1F+h1f2mr>+i3UQlKkp*@!x;>QX1<lK8DK$K#M
z`g@O{)8l>J+VQJVqs10l1>xI)anPKpPa4OPqVP2hxzF8k=r_^pSBOup`}`yFn`B?~
zbnqrIw9;wLYzE#^`n1X(g(EVzlnkt{fE70xP$R}RWIL`;*}KDF8Inz9&&M@T<>g-!
zr5mO4s`*6$0w)GBqSGGE6ol2%#g|D(&H};LaK}67IbPGrvtRJ(2fk}SOJfHJz?<E^
zk(|1zmV>f<0M~e!F^@*$K}H0C5rwUBWT*H^J2BKbF+d>*YvbLl4l(qr!2oto1_^yX
z4|-g6ot@%_AA%Vi&{m}S&`C=~_{m9gP4z1Nj1y}#vS%Bejgpx25in)tql8FKzoiaO
zFM2`ukD$AUh(G5wt$IPNKFOV0I07&=pZi_?VEb3;R7mH*7M1$aM&aM^4rO!=o)P3o
zDx!FPiTt*^4fZvFN0v2?^q2?q>`VfR{{;7*ugZm)&g7G2kE~kS&11jSKrDJ^xsLJt
z^v>D-4Z{_5WMxbm%~AA_(n*tZ8(BQ5p0MdV2fRZ0Ol&M^s`S%u7U;r_1kDupTapIY
z)*crDw{>htk-$%cnCj0jX_0qD>bw94eqraAA%mNI09xGkz@(Vot-j(WtuJT`oh+X%
z6&PouTKZgIjAS+w#BAC081CCF{*}sGFIcGFB1I{I@?%~&lchUDymVpV^KPx$m{Rn9
zkYZnt1HFLor1@plmyQv5UUwo&8v6s8_4V&rG^;_zAcL+ad1WJ&`Zsz!#5f)dol32p
zr!^uXpefG#EeX5_WNz|5S7~AW#{AhHxIsC*%sqd<!dE8LQ@_hOQzi^GWs5P`Y{&Cz
z{~xa2f~}5dTNVxO4#C|auyA*G65J)Yy9al72p%lByE_DThv4q+<Tm@9ec%1wKj^i3
z^q4hkRMiL+AJd>5i9t7_cFx{q#{1(n0GK!vb(=4H@vn?MUR$jHW(0L!jaqCHwBE<=
z#V6rL3tY6{bQ{XuqWOn^m>1$@v^}!oAOp}i;kB)-=uIcH&wk6Ykf;q<I!dC|hwQt`
z88LRGn3s39?^MD#?5Vna*w~!u0;P(FRLg2H#JE&wos;+`aF`cF4k{<<HZ(YAj*x$x
zJF(Vy*~M}WmE&tyGRvA&x73==rQ8#2ct5N!H9PDWfbw^M^9+DbczHO<;o)+A*Cz2?
zolA0?auWg8T<kOA*t(c&b5kd~hJq>Iyq?<5J~?`jWI!qK9mxSUe6J7JLad3-0SvW@
z_xSPG^LnOMk;PTpiOLK)$B-~v&R>^<siHr5&VDRTfb?l{DROT{7qWd*m`9Tde*or;
z<A`=oV$S=!Hp9u#6tb^XK#RE3a+GO;g@nB<9KhDRiyYaF8I{lA*vi;={S9z1*t(la
zNKME66*`1NE|J?z`O5^sD9z^~ZT72YqiEsh!eoDgQ`96jM^sCxoUsT=Vv<0K)msc_
zo`A%r4SMyYa7Kv2@e_(b`)7pDx{SGHo+4*yC@Bm%ZXC3ShljxU#x;WfrpK)J9vHyf
zeZ==%P!``RnuGVG;s`GxM9zE%@i6NDxDsFc5XF}LntQ~@cOLi|hb4HQ<&@>9EQx*D
zvNIvX(t^$FwvPtq)^hJaFfcIQurfr_8?FKO%6x_QRLl3%ex7}q^gniVo-n{J7@S<D
z|3$s2HkF>&MeZ~<nU+?g1uq_uoFI3-tY4g-p!r^^5MK}%W1$r*1Kop%fs0ZbGU}7Q
zrLL~-xs^VMHYRhjMYAQ==J1(kuyWp9cBH)HHt@+5l3L$j9>4mq*UI6dLovUh0wUfX
z=6ifQklTSov=%z{?Jt*AU`9(WndPFo-8@+1)8d8p2Ma`SCieg6bXqG3qSbUnCt{OJ
zl9@r>EC&~&PEM@0&08T6Rx8BZYdCyG+a%s-{ycyWxNJ5+xmMf{GN41L!ZUgGNn{5h
zlI#H(XunMJ<PTzRiG|NBM`p-k_yJ)roVSu}*VuA7ou3#gLeY?kokaty*R^O=9G!|K
zxREnKHfju>h(VP)<D-VMWdB#Wvo|xwWz_joIjHiL>87QL1zACT=nmw4BwI<{#Q&hP
z!iu`~+Xc-W^5X!e5#KZHMc<4Z(=!c1jS^aO9A#LlHVg!LCkb}$%IyXmu(Na<BmoV0
z0@ZB16=#y~249Tq1vS!@B<&g++0=!;Xw6YXortI3)Na#pjNI8IH(y8MJE8k#kE%wq
zu>~-%WL<o**mcC0`Fr|6^7!iXRy)dgV<uE{(Ba9Q^m3?yRt!*dty+wPh4PTlB&e8}
zoy9obn+g1{K0q6OF@w=}Ui&k+jj<<6bdQd*|Fmqzx!u03FUoaG>v~4la!3G!=*r4k
z;P1}OgUy~BS(g}uU5JmLJKCm6tK-#PJ5@8nj(5@Di(uEST$basv$q$C3#Z#ca@Ml%
zWEao*-t&F0!{f$u&1sVVyzQ*XtUIRWLMuY3<0H4q3y$uMtedX+$KTiq2gXsHieIla
zsYK+?jT5@_ATHj{_>>+?^HC7B#-9VfquGhU-|G41Hsg5~L&6k0P`<_Jz|5mHk>vnE
z*Pu9|28{<}@b3i9|44rx*9t&8Ic+GvzFwO){n=wHuI2}_X4;bPfDkW-L0q$?+|I*g
zAK%cAtI|i?`GuMsJV=F_RBhlzy1#P2jBpH;i`z}DLegQN`kj0Ib<rn}>5Lzphrb`b
zUo3cCcwnmQT-k7n!5vt-2&(eSN&a<m@k2(#%A)sNJ%I9Bpu*s$&QdPQIV;t6db0hM
z<b=_Z!gjMb4gYsz$lQej{VMciE5<;Z_n%Nj*#DQ|6)oQ##IVGhd@WJK8g7Jz;R`Uy
zo!&1$NEXy4Hm3aOC1G_3qVDwA$~4BjxDSHvDM37LGY6ABb{lKKVtl+2qOpiy?B^4f
z%nBxX#O!g;`yaZxh$27hZU-U%$t`Njih-wg#(J{p1}6&s@&<6kD8QH;&aH6sVqEMg
z-wYG=7~Mq#=r+_)g~kdx;8eEW9ey-6IX|x9VtCKFV8VvvAmi(b`~_yaX6<9t)Z{<M
z)9+5N_x+9Q_VwPeUGq3ViI*Z0B6E%UeR1tIf-LepBAREP*#?kd|JCpOU8{(i*z+Se
zyDd)R6vOZt_J}+f&p3GhR7>ano_%}w!nS1y2LME%He9Y~uc8%xJr|0$)WH(!E7*0t
zaR54*9VSR|My^b0a@OMwi}q4Al32Mx{JbER#d)~bu74~@(}&byLnw>QQ&?!RM7;&W
zb=78yypF+NzK+xm6a?9Zq1?Sb-K<~0EACui`i7SJHifuL6EcFc187X$NjwiSTnOaf
zS*p{L%7P6aY!A$npU(i>Y3N^iwtKA&kwto^V37&1O@|f&`<{R@z&Rr*Y9-67G)zSC
zeeb9v1YMXHdZ@K@NrOn6qsac6_8=wDK@ZDOVDYR}M|a^Tvv-V)-}U`Rq6qMrNAXVh
zD8_guxJCde3BWHl%%vU1i1Zr=H*DEQI0D>Bl$EW=bWOB47O)cgk7QQ2lkp!95M^BR
z2DqSJEo?nkk;vrItp3)ZoZ4?9iL!)QP8pFn^xV7HTGqIu5H<S}eg?HPuB8RqfZfnw
z)hQeT6}Xvg`%ZKUP_U8MpnFBw_lZY*z)a!t-;6j;4zNU)|HqufxYM|iB9UKLH>-y4
zx!g46vAv@iyEySB@d_GEui+Z00G&{(pMi%n{iX(467i)|aP^+@f8{kgZ%)+CPkd!M
zxDH>)Qnx%svCoQ4CdeH1->*}94CTr#0^Ss&SE8Ls(QwRw{^Y>;X<ZKzn#`bfuo&Fy
zg#Y>v`8lT7w`HHmiL2&tbpK+^){(<Zj8^oaRfufee|Qu8ZnO#EqG94~QwiW?q!NcA
z<c9ek3i=}IjvaOw;i6nVGap_>D9+bRgkh|2#=2G}gD{>!RHr^K{F@hlYE4D~atkD<
z@p;632dFo8A6)uScDe36NGdbAQgPHT%T(4;BMy3MJ^@3k4j2y7RkSHwL^;}loSTf~
z&f<%WaoRT?o43lK?y@Q|)X4gLb|eaJ1jtY*T(ex+-~LUF4}Pp7^^KpdVB?}7uFPS8
zB#)?B#f-=R!M~YsR%lQY+Jj?9tmfdnuBYAe>iTC*+zlIL!umom5kR60Pz>&1v>ws&
zBsjuM(skHK<hG6f0N!^H&;ZfvNi<f~z!CDhDeS-g4#?a{QccKY?>j;4Ib0J(dB@a$
zJ7$ogL?KTe14QmF;8@X7T~p#al>O+JriEdjfPwV(G`Q9*?xKg$@HV}W+fJxQ?GIWJ
zx7!1<X3iz(4{M99t<l>#B%DRZw~x+PNRb@dN*!k?T2+do&-XDw|LeYkq<=2=Sc;rA
zr9V6jr^vj+BZ4Zyc=9GE;6wHI`36R6ux;&DFDjs+z+c7jHJA~d9`M3R;lQ#({I67o
zm&xrfmPU(XAaR({djJ`_PR>-YZ_*fyulnPQ%c8EEAu!34<Q8oc`{naN7B!tFT|<)^
z#B+}#>x-yijT%aG*~EMQ$8|(~JR^Uw=Xs;$Qm|OZKC5icN~`0$-sEsHPCu1!EHWF@
zCq?OJjJ|ZQMzl5Mj-U&N$s=({<CJ+_#y)VoKtQ&&4g{MZ{<ys&0^z9B{Zh$3i6q0u
zOb*w&7aeY5H+t+Ne)j{M*EJ$hp^k)v^xzG^Z9#psFu$Ii56p|%X&8uCFacag?tq8#
z)yDNpuGAqNakO>gP(y|jzi>+#r2YG|@4vAlb7=yx;-gQl9e_t-oyG-@<TJ5vE`lUN
z7==t&-3mLhn5YooGSzR-9t7l}E>FMyI1D0W^jd>QNhoVJlRuhvu`U>f$*Q$o&#H_4
zfNYv6A!9lRVCs$@q)fLMb$4+F93D9wf#YtHvO-Tbzt`(o4|Zb3NpL?=`GQ{z%h+EC
z@m)tKW7h88r_`-!Vr!sD<JdLT($xi>t+JY1(tS|f!9(hYOFoQvAReHA+i$Cpba_;}
zYhM=p&JG^0euH-0J)u(dM;*VuQ$JsP^?hpEpg(WgNTsi8NB>}7UwFk=#edm;ysgH=
zq)Q1B1J&X&ghjw$8(E@U#8Xn{W2l|v52E$rW(N<9-_3mp))iA!O!Y0XZ^ru2oVXiv
zDupvr<Z<`si?_cu0y3RmqRJhD-2AD5L?IeAdkc#XAxz^1{r7VZ^{tX3j^@{-ui57a
zp9k)0Ezo!cXSKNLz}^L}%x?C_KeEDJ1ylaFwE}mm`EQ1_CDF2e@l+F|BbE!tvEc+w
zFpFL$zn`PR@79gB8*+_;67xOAGHX6rExe92WJLzIt$zj78v*#GLGtLj&bFDs6XQzp
zpMY!Iv07vP&EODk5C)aUO%u!ZPmpu|;l6!?ImPJW3Zg=JEs>?|nOi?u%WMA8W=|j&
zV1W<yq$LD_vjdcw`i*!2<N_~Pr(D1^hc-&5HE_V^iATPcLl2B^EXC22V`40-#h@RI
z|B4&Oy4;rS>IbX`ZE2sm)ah5p?_xL?7lk@|-iBPWb|xM8_*_F^ZASALbbC|OzyB1l
zarIy_jM3cQ8^`JryeDY!*g0e0HDZ=YtKDE{ls|6nbUsp|Ko5^-gY-QJh`)&lycPdY
zdjwU6AV^A=`GVi08!DUz8_pLt#)>BBxUIXqBMj+LHJ1CrOOE#Z31XZbpFqtlYuF@n
zvKDs(T<e2n8Q*Oip{N}JRB|RoSf;UTTbWGAo=4fAj<Qv=2QqkHt4hgDn@aAIIUFI8
zXaqiYN`U=va6^O7eydz2)?72}${}w{ocQc-1f0HZry3^;7)gFeX$H$p#b8}k+D*uu
z>(0vJkg=<QpwGODqn)sr)ARFNuDb}`Zk-R_I^N@MQ!_K+8uiquX?1__O)6c3VvM%G
z9itnP5KS1F(M5VVRSuRG<$%mmM22#%B}L3ApgR!XJC~&|{wGYuO-x(mrK7I!BS&Kn
z0#FL`Cnd~iG(n!4eD^(bvH(RA0|8C$x6_hu?G8D^IpT<~Sz1SdLeqBIDWK{eUZ$rY
zP4|<@3-Zral02H)*9+QbR*pyF2d<6oBG?w^656E*L%z0DuD&yR6Bhu-0Q1@A8V<lX
zX1uh{n7l8*YdCeA`_C0m2&fE{!UDDhcCbzr8Y?Q7u`wV*BId(U<fDqxq}nBRYNE23
zM(nU%A=BtNjNp{9*crv*_B3O+HNl%L^u-a!rb37!siMSOM_**<-aBfhfr`7!`f~=y
zp#5>Zhrfpw!-h$mq}ZVZVskFYpi7y`s%Jx3twjKkU7g3$SRo7J%pb6^k(gBGezg2j
zuH-Z=3Ih=A@92a<56vdqb@&Np3sCwdb7c_~l6a1godO2FHo5{DU@f{H07oWf+z!H+
z5a(NoG3VMb4U%duonMKWaVQ1dciL>(Q<fl}w|TKMb{_Hoti%t<n-ip;r~IE)SMSPi
zrMrEqtSx*gzHPdmtptC#i!z7aT%+D>)d+rp$iDUgEskA>OGfJrqZ;7x3xUANLWTVR
z?mFyHhO<nAITH8Rehp4T?&pLKZO!#o^Q~m})9KXs2<%J}N~1l?ad$N4_oWAN9;sV3
z-{+yFnjwQD)5@^qH7<`5F__PwSLpYH;e)IxkIBHjuGYDiRXy*_P8c|iAV6H7190j8
zneeQW?%KTA;PR=TkbOM?o~J=iL`Hudqx!HL0Fr3=>`7kj>CI63L{vVm3hQP*OSnwH
z^RTG@AzQyj{w?4332=MmGMvd@U`2l-K<^*c(S_CJoGB6IdUw(v%;sOGfqWLejg7Ou
z#SIg>L?M^Sc>C+{G$o2+2;_CXbF`^ly3KsZFdIGq+6iUB?K~Tp7dNE-r_UC3sW5w|
z<#iLi0Hda>_smoDo7F=OL!H+CuQlvn4!h2Uku3@hX8xNogv&A3E@8I0y(USkm2V<+
zP@D~)ixwSct(mvgjL>-Q?U8`wmGp`2z0{2V_+FicHi4=AXF1Wo<s~I>neb7>FGdk3
z&w-_+k!@S7l(|-qWNOeu>3$usIB?b2{?fXNiYN*^M-)E*Y94F2`V9;Ju5gkA0LmBL
ztsEix{vBFid@rZ;TrZhbzbM!JRq_sl7$>;3Mz>9G3Oz@UkLRz5JA?lJ;+N<m^{@CN
zMt3LO9*HQ#0;d}jJ~?M7p#R+127yz?vfVGK{h36_VTW3y<EE+WZG3#x5(Jyb)kzb8
z*75vjt47Ae1Q;(9bD39%6DUtF$2-`JE!hR3RRAopx#h}1e;67_tx2Ny6E*mySY;56
znK8~oNoQ#=dRVZmf|&CEmA?d9VJr#S?9Bc{TVZtvf7J!N1H4x!`u|oge)ZQqz0l_3
z^GOnF;(t`eH)I*{EOglSBD)!32P-S9zD#Z>oyx~`$cdCSw4^Sc@pl}G)ga2|+tO|t
z`$Dp>yUwVTn;(g5fUTSG;&hCZ=)_euHC}31zA#zFQ`r)j>^k!C2oRiQpSGh#JCmbr
zgwj%vcNeuikn7jyYCK2G;HEMQ2?~RrfZz@A58>`VUKzyup+!jXJnKbTprK`b&P>q7
zhkQn_m!b%uluZGgR4Ga$#QK;zTJz;+voo+itKDT~s-#&>Cgvqm{H&q5j`}qp0duM(
z*Ic-pEBKW;^0Wrn__!v8Qs!-E5KV9iL6%W{Wr}I|uS16=^a=AC6Io1ZUqdx+FAw+m
zu|bMvHh~@+En+w@iA5lKz}*e*-DibZE1@<1>wL?OFhDR8&ACj5kQu0!j?Dq-0QP{A
z=egGu1Qq!=E%Q>t%Yh9u3e9XVXdvY;6mGH;ArwwM9r&W2H%6z^;*J#cwR;=ZQcVR0
zpeyE!7o|vdQLX5l;w~|2D1%#nY|5%DCM*l1bskLtGJFPPM@5EUb$?})5f`&k=^V4-
zL7t+N0cv!3UjWld>?E{?z((N%5`pI2#b|v0PbL!-(S5`}F1$9JmP<c3Z|cAEb&FM@
z;Y7(3@p+K0lBv_OQ<CIBIO1+@2;O+q|Gp<9VkBvYkQ$Vg>aT+p=ZTX7T-spieNZ3~
zK!g%4t<EblM7QYvB~U!F)4xbvFjRy#_D4zC7iV$74I(4Bb#p<h`?i-6`l?NT7$W=m
z$^|0V`isJo@NNwN{YSGK>iUYHZf2GP1DgkOryjXg*+AJySjY#fb=X@%kGv^O7y8v{
zhR#dJ*Uk9(F!6_0x>2?=l|Bz@=V52$Eh#|zM37)H7dCYVip$I{XV2<!7#i;_%4y`y
zr6&#4$yQR|2jaJ4CWh}Vx!J&9^G`pJ%H5nYy}}%^E*95qAu@0d9RG?->c1j4U>W?k
z7Wm<bs{OAgirl4fGG!<AnWx!_`+A?uzB0XrAehds33uwWdjC>EE<*q%{*b6Zx#ce|
z$yzyb;dMExT7%YlS$)^p{1DRKi_qe!pnPWf7a(;jMLqwgz}=4nyKJ%Q)?`)#cm5&<
zo+FTMjaGdn@<_8ng8S6~cH4wpiVj>>{8X*p$8!}HBuzMw8xRtIX&t<Hoy-<&T6e|Q
z1Hy?k*rQhlkZOL8%{4oVNT$K5u&4ORDfYA=@;3Q+EQs)R9J>@~F9R}Zh%5qVT4&ov
zcp~kT0UDuPSqT)w0rHcY!vOkMKOM#2eKj;GwH-|KTn=?XmDm%17Ro*PR~oFY0FzEz
z<k5q>v7F2OBOpSIMsZtjh=KjO`(<TeexQ`eF0=Gw^f*4cvb?MrpRsv`#e2Ia1x`h0
z8!HW;`j<L!xW(0&&w9NMw3B(mC=BqM)9!90c$`ULE9S(!u(^@T%=04ZVpg?;2nV`>
zW@;U$p64u!nK=uIEwyW&_+=}z4n`pA*pzodWU!aO|74A|d)&MVPJ}oyWRZjK01`CL
z>|2+MbZVh^*0j2=mH+WNaS`0l5}y(n#`CEzKe|JAZIihq=OutXwUF5#A30T<SV6}B
z0i#Ip2ojlBt;}bz3T(+9UYU+T3d<Bf{0=0B#YdbCedN8kxy7DbZt+`rU`CYNCQl)~
z_u&4G@7Yj|Sl=FqyaE`D0o}2Cq>B+AS;!cE;M=M(tK?lE1xw_9FA{Xxm%FU;cn`Ik
zXJ6BM17|`j?>k)(O6V}xrAl>~uXtE{z+r4X%#fl$CQTkA8z+^q{JtOB1FO4Hn;N!P
z<Kl#=3|Q_E8oATNTh4TlTYk9NVNQ^x?HRR$mtt<<(bTuf28aWIDw!~2NqgOA<AhOE
z<}wJ7jATp=RE?pCb-(8yIQ);bX{p1jiFf?|+wSQ=H{n|4;hK=KO&7K8eTAE*7@S8H
zu@D^B(api8ukQo)sWp8wSP-{+^#&0G>K)JhssxGi)t8j@CU|Vn3P+CDf3*NDGZ|og
zPq;VZ4u|C{>?Af=ERsrqqGhw5Lk|3va32vAHM4wi&jc!*6*JHQN_Y^e%~nehlE&H>
zu!pU;ms8pHnCpD~+q|v^{Y>xsOX+u9wN|`fhtar4SyBsM?Gr&|$JS?nInI|F?C1&1
zXf%nF@o;J&^71c>X-u11uC??{f`Cc&E$wGTyXeV-S~M6h1#r#Y&F&WS@ct4b>({;K
ze{~N;n@U*AD@;6F6aUu!y>D>#h$$opOXr2<!P1e?nPQF^?jIlOxDY^u;MUQ|@c0?v
z_5HkYQ4yQr&booy&7>gO44Qa*pVV$se>mSKKvg&vD0=pARR{EZR*ODmu4islr41?m
zaqo5{kYkfKf8xn&0J&OJY&~>qIini+*D6?Z5%ntj<KA?9a0>gv!op1wkeEE5=;cpT
zKGu@N`uz~`w+)oxNYZE}lhOLTZPz4~0kkNpsfJadX5F?;7pSfJ0pSaHqS&o6c0sr-
z!;$`-60r-tzG^4Q7DF>de^kjYL^9iCK`~rM`l4hclc1dS;Y4csSkN=KtyI6uGLpX^
zl{1omDI=>LDr&+YeB=?@pm=K|;N;c;@;pmkn0<$f&|P+E(3oI#*Np8L(4n@&>qQQh
zBC7@y703NI^r4zqp*__usVManLNt}Cey?J~5%xKE@Y((<X38yaPNH*M&ly5kIu-u$
zn2R8)z`J2@ks>k`H-*b_$d)VHGb4mX>S#LLI`F-xVNox`K^&KQj6!jSh2@wqS_p&e
z7o09eKouwpA9hY+M&RvMd1@%%W79MfUmtS+cC9(_M_I7&p-2yWu!(A6?k8bk!tktd
z-0nD5MlpvgqDOC1OvVba8Wejiuu#HF&)NQAxx92LTPkM@rJ`f$@I3tLWpsP4@AfVE
zBmB#(lbw;HjBP~munecdwDbKt6b}2*I1aO2AtHWOM&n}9llQ=R@J&}YEBBCMQsBgJ
zV&m)G%$_A=3?`WTVGJg7R+lCj2|73O9Kjz8<69sWP;R}9z$^f@bxxR&TLu!*BFO_u
zmkT_o?-T7rSbVC{U{owBtV*v^Juw(4DQLnb)bVMr_JAaJl!Zi21p5-g72lv?aO(!b
z)(+Oz4of1o1FO!gE4i2PEuMs;@;6hmt|Z<ku=u5EgGV6YwxW`R*wz$XeO1x`LPZ+8
z1nqGdsH}&&+!@>qa`0sde~(xwC@A;mqoVn<5l`-OdxHZZ#=sU2Kf9PEwpacEwCE|e
z&@C5H!*YA*zn(9$h=K<)?%sR$-1J|y5V^|XmKdPZoOlr(7ujZ-SHg^E##6)RxCy0?
zGUvIdzanz2Cs!}I<w;g;Ewy{31}uMhlOAFRAhCeCl!ON%v#^-b13>4|f|yDbsnBJ}
z)G=zTqMnbe%prXk!PBSSbPAk1O(Q>r<HA@W?*dvp8q<l)lJf?tZK?zw`TgTE-v0Qn
zvr!bFK^6M9CS-1J0)dw`h^8`hJvT)EPX;w&Nyah#69>>z$JhQ--$v&%RCcSE%M9F-
zcW$cQaF`xNOj3ep%TKLlingIKH9wgpww3pJJ`|&(j_n!W!02`PyeUyA4ubC|HU~LY
zBC~_bM+4u4{5tsavwVaf;t0XgMcaiyJK)X6y~_=X5sMu%;R#W$eO6b5?Z*gn=phKJ
zF?2i6mCPO}koFCn)r?8_G`G@{msd^Z;!~O7)SvX5o?R~^b1Dssl_o7wzU2jcjnPku
zhfa(u%R%D|W)n$ev&MI<Z(zrc?Z@0;@sX93pY(pvRQ%F!-}I@%n&J%{!TrY{8N-A*
zSNOKgVB+H9$KP2L>?N<$W{;aBTG^tzr%8Xotxs?Lp0t#J{o0m1g0cZve`VT|o2X~F
zZYo&h!?L(_hhmZa-PuZJB526s<7Vv7mS3E|XtopSDZ;vX5%>tsnKnsoRR@1Ng|SYF
zgLlfB`o>~bhqqGUDhX+8$Npmg#{PW?xCkxqO7{(iC_$n{4H^7ok}e3(@-L@ymR#&Z
z_D)Gl8csU)hk%)rCiZzGB?7X7Rlpo|V6#q(SPsJ^eubk=1yzRQ3+Z=Splxo-jb5^;
zcIO~2>}xSI@MeL)`F~}6;~8<Exz9B8Vu)F_ZG%AJe?)w>Jkv?8<&~txPDYUWTfBVi
zEH2cfDT8Oqf;O|e8>7S>KSjAXJ*}5rNRxZI|E+KS0IAn>BSxSos{1|*D`F}fk_(~-
z@rWSSTqM<Bk^lUs;M#85zT{tEe#GQ_I5n3{K|BP`iY8|=g$A@6@{e}I>DT$AkDLUe
zCM`&MB@B)HtBy`N9ccn5?i_xn=`(ytSVRIX-fVQf+eIf1)28(!KkwI5loA(50dyYx
z@NY^=2k?DcrG7)i{<HD{sediWU5KdTYFf}QDT>6ccn=O|XZvGZ52U0#P+SqB$wIG|
z%@h!EoMT#D)*&46!B+B}>d;zfNJa|51{E=QghfJIf`DRdnZs*kyo>SEY^8!=fzwu1
z#qzvA4Ufj>EVWA543{W-%Ji&?V`RecheR!`K<~eLpeBMSYH__N?Zy>l3>a-e@QK~R
z?Uh!hyhRrNz8lr6k1iQ+<4cw6w3tT`FTdZcZx_U9<HRWcX*MVZoks>+`mp%V7R_2{
zs-8P`zGUoT5Mv$n?(W~U7N@HjSx`yqu;i~FmljH?iSi41^o4M`k+$#qzBkLtg%mCn
z4uQ}}Jmz?+Q>fe2FFe*<ka>oTcn};mI<XGex?u*@GH1kGaor_vlcBSn>he`eQoVQP
z6p}jX2lwDaba-DyQpp_I@gFFsN8%>ZVD-|2=0%`UcniH?MGo>vw;+E2-!`tPnvA!h
z4qN*D!QW3=8AtlI<ki41HHwIzr|@iKC1J{fC3W>|LCLBJPFL3E>9g|&g$ouI)^QAk
z|0h5^$cJ^%Eq6_oz)dxx&b6~_{57lK-!ZoTE?(=ZT^p2a>KB!jN^2CVi*<~Fsoc~a
z+YP9uGCT!!MCXUXh1p@1GBRgrGBdrd6rH|(8HF+q#$0l4wqxT4i5^_<bPb0kGMc;K
zsk#??>kYk1INi7V0%-cP00hQvAR|`giL7HWsIq5s0csHpI5dtwWec!(p=vbS=U$J>
zkeN~0?zhDqVZx0MIk&%~6;~qW)i*;fDz-AV#7r<5DiM|{71$0{k|+q?eCNvK-E>gz
zISIUuJa)ic$qxZ?`lr4bl9jNLj=)isWTvgn>x!sn7=tvaD=(ZxTE66iRuly;H|vFs
zgc2#V1l0e%m2}GPaxs~VV73DRMJ4RcEF9)a>Ko=K*T)e+$+?Js&B>XCoyx}SD*X_y
zy&ft0j>HXqL+@wMMjv`xfz?;ouoh5b1dGD=LQ6?a0Sm|34zEs_p+ptu!c)?dcRQ`@
zjhh9D7*3nIuL+CJ&LcM~b8ObaWepSQC|MRQjLi!j<E2dDYPE1^BZ3hZMUlHZU;of?
zJ+g@y8$h4aneWn(@H6TG#NhVR;@BoC%CRW8_J>&n!a^9W1QxKm(IKLnKmt)8APFjG
z?5?u%(ab2)^zgG-wmP`QcJFHlPkOye)!*v;*TUH%8%tO}{8?P}@{`nYGjni(?b79_
zLCtHypZE$IFkj2FOsQcpIyHnIR;z~Je|}}I+LI!|&#nfq>iS>p{EM<+eJ_C}ge!aB
z69A`h$(M-!5X31Z&kqhLe?62!270e9GJ8m+%p3XT^(bhkq$r!`k7;IFdHil#q4RQo
z<-1j(EGA?~whs`r^*7O9aFxuTYdef2rW#)QxbdPGNaoXrZ}RGz@!@Yjslp4(N}D58
z+sZwsP^@@zlGwTl*}6NIoXkG>zN(lUHo(1CO6fd<;>f+LaTV+PDr#X+XE*XlqFmLY
z<EGn`5)8aKhO&;EYg_SBSBm5!MG53yU^RrIMe#6OIAVXTFU8(*yJU<Xt{v$F;xY$F
z(Hm{+>r67<V)B50@fIAybg}S0O=099xlCz86<=k&{@Zy6?4!tLE1L;kzah@$-3wwN
z9G$`xY>kov6TK`OO)dtUVLI&0Uh05W@Js^E`&}ng5fW}0MNIk>p@*PlDeIE2h5IWo
zrBfpgISwSB1!*g*%Im9>$9>?=j~A*VD%2S=euo}FO&WVeuk{D~0dSZK+m|MP-q>qK
zjXXV4OBVje4hwFLVQU&rvzlbl;q@TK_8kYavJ$yaM~`-2!m$Vw22q+&dfk8I?HCm+
zMe&Fioao`aV0ZK@ABl$}WrG2PPxtq5O7D&cU9Kxe;q7E9-8&3ymQ+m+N@qQNk*C79
zm&6-~t3pn5kwp^z3PX7ISo%O16t%zPyE6L%3>G|duxyk7PGP5feqIR`@0L3pgD8$;
zrR|p6r;_{W2c)(#va|QzjLmQjTQMq*OdGzD8Q4-cQZgSr=L7acB49|L!a_qJ%Tq+H
zoe!Fg`sz{2$)?}Zs1Sbz`Bf8b;Fo{?rt@jY5Mjt-mfr?M^Qqq~ynBM{31aPnR1l*H
z9i{wdi_nRa$ex|`$eJD7!PAxtGRvQTXO%1OR_F1`+3q#(cK~#PqVIi|9Fg(j5~!<z
zU5>^j0?C%kE7I+J|6ACPVodHlD5-`+WZ|cT4IAiSB|#9meZSrGD3e?F`lR|D&7du9
z)poVfrZj8mGlf&8mTDIyYMv0gMTSC>kZA64(!CYiAY#Z|RXd+`t+F~?6KmdSNBrFM
z`sYFyB!$D;s&9Qsm3^vEMOM_$*`ADzHmi~DGsfY1qU!&=D>`M9t^(d30LSi-uG@O@
zbn3~AXDeT{kS;2K2pA8KobU<2p3qa`u#Gbz7~s<4xPMO@*lTKPT6%&qsvY!4h6NTj
zIrBhqp1@uJAou8g)h;nCY}UglBH1`bOo1a17S99Gw<@Hb5uM}r4D0Ef2i?{K6=D_Y
z`4?W7+8712O0f|WjjSSVD{^PKqBP7_dMEXr9mR@6!AG5~(y)GWK23V@-DjhoD-i(+
zu7%r^MUbiqsaFXk;WR88^T&I4fH)i_#sfnx7U}(&cxBDv3Me3N&sMRMUX2gnf<+=W
zO>(FMZ*!|EV;8W%Ea)vn%jP2h4YVrOC>!&??&jTaiCHnpneS-m+<{BD#uH(zcSY-}
zTxU_tG+$PVqflNt2Ge<35o9qMck8W`0wi*(*Jg%dS>Eelbt#Gdy%6X)KHW)+47vC-
z14qV63*ONWTzaWPAQ~6BkR*3lhupsk<Rk{5eK#@tqcM4ZzxFxY2(g$u63x|m3yfxs
zv_Qt;K!Vge2S>)6o911sh!^vcMNFlk)J-gP9k8yAsy`VmHeu1%JLwcQmRjteg?qok
zi1XnoJA_1F4M=}73L_1m*^ZbiJe_;msn!sYW>6=!44Dad^s&Jap_aiOKGLHWQaZ9%
z-AuUh?JsW$d25mSQv4?~WoqvogVbAHfUnq`-Q(I=)dAPY@gJizk~Tc>pEe|=OzgZQ
z2`4v^1k!}BUhj?0vsrO4$7v^ntU^R?$4q{XCObK6{DYO^{rYXM%J<Dm2Ax_RU4AzS
zl2L}0Dg-hHVIpX*ghEpvn>7k`2(6$rXog_DGapZM;#XFy<0GHLo+CYjKPy^mfpaA@
zg)@L-eS87bgd4-K>PB7YsH6N-hm(fnkck@Y50UoB=qR)CpSaBOvdSb0Aq<{%m~>1q
zkL3&)h434k9g%H~Z{fh=1r=$p^!n@P?NaZtevK97U-2chjXM@aS<s!Rd#PFKGe|6{
ze~sj>S&~k0S8D1NC1cS~@w+QKRGVK*1xYti`V1rIyk+i~W^1>x)t1{Zg2Q&7xf7&Y
zU!Hf3sG+GACvjy6zfqb*iO(pHrn!|pIKqJ)^_61?B2p`47GqW!e_>fnwm5p1PPTcQ
zg=Hi9C`_V-XPE|)xRj~61kx5)1?VXtv0C0LV;)&Gk$}_?V`jj0TlTA-b@^9eVK6=S
zEhtsaN)NsSV*R`?8#>tz0{k+7NFx+en5?92J00$D*$cMw-4m-hg^?lG>ZdzZuB@IY
zCK=b>ad|iEWP5ldsFRL1E0P4W{A;GF2e(n-9q0g!$ycNE{rTjBk5qQyc<`1s#^d~W
zJgSe!qgr{^f+02Vk<JJwoP8q0P9Pb2f0_g$S%-+#_x{ub!q3A+hxoPE<G^omDB9JL
zQMmDY-K)4H@R^nj<<ikVQ7WpcCP(1C1xkeHM@(JKdmKH|U!5jlPq$s*+H>8r!{^Fk
z49W%eMjQh8+N+G&^_1Z!=Y>rW+1yz4r*PP^ES5>Khu?i`qC(G{LwMnKYt3jtKlT}f
zfquzvsXDHqeORfboRh+6O_>_u{t+v3Xk2ZqY64cPqOJGNYC6_U9?O@&Y%fDZ$Uz9c
zkDXReZAA`h7$WjQ{0Kp?<h;4E-d0~F{KGABoHp4^RrCdkl}cTQ8>|jqZ-AcFELX8B
z7id;4_T2r-VtrBvGsZD{i(-e{m(BP2X24Ck<;IUiH2`vPLfl_!1V`7VsbbdY6WEa#
zdaX=UEG{cFK8N)m5|`7&gh{^ay>6RBx_VTgqg#<8WsNpj5WxmRR(DdkvIr&o>3BXa
zYx#lC&}eHd7-#@D%`!F`R~^pQhlsq&mQkM(o3SJEJofZdyL$&*{n8yfp3_IKX6BCE
zO;)~)rN7X%J`hCp_GZCOVJ#UhbhFPnh>BnjnB_d%TmJh->qIG&hl5l~yJ*f;Qe)L=
zNH{4CxpYvlQ4{dmoXKgIjh9mp%c46-KR9lrsqi<cQl(B50BEL*1y63G%f^0gBud<a
z|E^QJHUa;ux&=!ya45X9^8^1Tj#b}1bJ4WzVgM9^lGfn9(LP7znZi%~XP6t~MlXUz
zJvS`9^yhXmr<?t*@HD6W?cH+-tXwO^!mt(C+@WN@A;SKh*p85^)b-MK(f*wfwr}z+
zGw!u|toqt@2ga?px*==^0=8?-D*T19Bai(M34+Pel5F5eQ2_2hLab(dzl8l`Km+kh
zYX5Q1Yu#nhaH}^s6eM<Fjt)7d1lu{*9NwQ-U5yG*D;=e&1UtyF8I!y^18M5du%lbC
z7V7%ml)u{_zwCGNAVAd}7*4D$Ue44XSpv5Hyb6+%(rEj6eb4d5%jUdGcRFU<HNu}a
z$6c7Yta8b5b3ou;a5TGfXq$(3yEIzdyJ;ol5N*u2kJThVHc&Y-b54}L;DP9XPIinH
z<T1j>Jpn;lcj6oHAx%4xBnig{>;AYJuy0#G-qT&}_Ef>1r=F(=U*45lv44HM8VRe8
zW7eB{tz|7*R3jw~{i0mi_Xv<L(W!dr0T#3Ry|0V=2G3E;mKpqZ0<CvALBR-|`AZu(
z%9Rw(%LOqrElhmb-j;7`F@&m2?!`6xAfo*5VoJ1mjrfa4+`*q-N^h;;h`n#WHE^gr
z7vGw3Grn-Ukhijo;{nf^?sBs~IBtSsef>RUC2csp{c;k}{jyh(dN}{gfHm%FH_nL}
z<5u-)&Z+OXh06xLiN_2hB$_aveVB%lXqB0~I4GTFnY|_u3sHq>*Q1u5rt%jpfM7wd
ze5u1Vy<b!4DhWb4D3`6Dh~Ju49(M9$%W<au@rmyrPDG*ecs6ZP1u2|IKYV!@ZQlIj
z^_j1BC$vwExQZCEz^>N2fPqVan*e!lP+{;(V_H3Fm9=f(b4fU(IJv#~2U21acs3_Q
zivv@D7V+?}(LfH`7mmG(h=AW4u>y2gF734f9n5HP_j~NiG0sDcb{m~Js!-X$wL=CM
zQM@kMI~c#n9@y6xqFHB}`^&%-1EUr4bOMJ@pnC_*TCLjzhHL%!L2Y~4Y@?eJTTx|g
z{1e&H8@R*Xh#c}CesoS!lrfOQ4Xa4`*o#EVa~COEoa-k05=>zg>)$Tlf8{P&&|sXg
zPDq-Zx{VUuA0=$c=G^`lEv_dPYLsLMEFqB8cYjAGmc@MP*PN`*AA=5c8ElOz*f40i
z)dZW@L43P{C|Kfik^NN48~7IH2Q+jXTXkKRWHKk^B87pmG*)Ia1z`nL9$#jICNMPw
z)Jt%HS`)D29*pV$gMzXPI5%&xRgm6S`Dx*t(wvq9@twvyXEGd@+)2Rc)t>8QM>6))
zRqDNgxos?vHwOc3#Au+)<Un`HAmE>P9&7!eRo0p3C<(y9aACQph7G7K@?N`Vy#<IR
zVhGacr1iD|tTikR8B`#<TAQ%m>cX4Xn*I`)NduBc=erM<PNdobB2<-#sLdGzf@}w)
zEaVjq2`X{8&PofM6n^!iH0zQs*{n|2J$$wPXMyq^E`AJGAb8KmLq8zn$0jT{6>^f=
zXzalskA%USyDA6NKSZ%hpHE*@mY#F|J>|>|mCi}5DBrsj1LmiX{)(8SeaXH{ne=we
zoRPEn%N>XurcL^p1LEecf)Y*TY+@`3vU%>uP%IAKE^jX&K9-<}b@z*FKLyQ579Yu#
z5Uhue17@DtBE=zK*^HBjh@{BDCB^0yI1%S&_28zn%63^*I}V?DkQROFf-U>&6yBr=
z!B(}f+Ftg!w_aE+DnwmU*iREdMWqnr6KpWn32TTOfvWz-!|8m<LGeAK{<Ume+}jw5
zU;ZEH+23z|;5S-aY9pdO%jT8I9k635pmF5UsI|SjIfvi<x9nVvj)>47m__~=9A*(!
z`IXm$Ipt@Fn~|ilOt%3nb(-Ndz$sk*+tFew+2Q%d#u6@THp_1`(QlnFbP<Lt({CL;
zcmum9QE{yA@hUMY7NhkAywJ&FHJs&b<OQ?5pbH_p&Fw->EQJVeOmIKdY&f%WCpz#`
zO={yd)`t^#2e6?xwKj9>HhtTv5ABrs=n^wPWCE~78Dw)a8m3SQsE+hpR6R-@Bq>;t
zGzfK_`AJF6)HF3q>a~0yw_sFjTe48xXd9c_VGDCEO{8Wik_H_-lhL{9MC|j2P!-w~
zGVUD{6<QLezLEBBhjs5kTf2&mvTw$IKRwJ~vRc3&c5#BvRX!(GBBo0cQlmE?1Nqby
z0IBjh{g+#P$sCld={FAg)q(__&+hA}1{-68=`U+ior3>fZ<2g1j)q#jk3#@O&>`?=
zpC8)Kn!U+EjzJJ8#=ikOhdxgV{`(<8>nMj__dux|+7b-dK8RvrFsKz&utt5J2umAH
z!Ks6S4}c+bTno3;K20!e2!)G9VVH$<9i>x}!`2|H_V=Zno#z%ZD@a?EO?w<F+0%s%
zuEGnN(<Q@le*{Uo<VY6uR^2vN!-I(|60k-Mcz|Hc%ML&7d<Se`Tb(cG%0Fl5!F;tm
zy^FKwn1%`zWsXiW_Sps>PL~5&C%8mwi!Y_J{i87MfPz8(7&XCM-j=|SlLTh97msrr
z(;aPv604o$jtx2UxuG$IL9)vy>LJg~<<@}C<jH#n1_o$*8P7ms19B4XF_}YcDLy@1
zv$L-Ire!|84NmNKY}z6soP<zN6wXe}My@@RO`->onT)ghpGEt>f8hda!nbsC<e4W5
z?L$+3VRU0T&qEKY@mT+Qav<>jCwvw<`Wtu)4k-jBA6i4l+r4%(unX7WtpDWla3{9J
zE141|VBr32mD#Wt@^rmTJy@?QHFRz=DvJs!KxQ_0rfb>k&BwPCB>T^<HT{UbN$lg}
z4X@CPefR=_2UC4oqU2$5GeG`y-hQLdU>l>#)U|t3Bhy+8E#y}aY4hdGT#gt|D}~ti
zmHC6Jo>L7rm(t4~>LfWDqwyA97^?x<kJhuQ<Hsl7T8l{b^-_r(U<RnkYLMs3CUUpJ
zkcX3}k=J0j8P;<j+~YhExF&FQA1I{LU#V=i6#WaQAKZW+@WmiY=3vu3nDoU05|61$
z1Lj8%37PXm;(m5+3M?8kXw^$?d5p6!($MO`uTg;Q*HPi5#~!)wkaq(+Yj|{4EzWnM
z^)b8$Qer+>oer3}t9O%6iE)7$?SIlteU7GX`<pg=GQ<&&HNd<*3DHm!@z6~_r#ffB
zd-BBTyEN1^3w~yOEzS16X9A?{qSATA)6!@1q(735zwuDMU}3!|Ujc0FKw9Xks=99O
z!hn3%GZ`>=u{E!malg#v@QnD$k5C7{pKEacT2K^58d4P2hsIOq9OEFq5;TPi88cf<
z;W%f2r6d_};GA$c@a+_$JlHTP`BO?B|7G*T=E&$p|844q3SMPMP)xzZ*NDf*9TZ?3
zzE<%oN-WAnLk9y`O9LuJ$pf~1sLL}%289MG{MNC0Hc#M~Hk>8tzKUL5sL*D%oTI@?
zZDf_r&iL*6T*`n1G!QMVNY3uJ2xA3k7QJ4%{bs!|AI&2=NgoPtkyi@&P~ZlP$_>YQ
zLQ)W2LP4@!E7QANcR<I|yJKzkRAW;p2)oQFYg~ASVq<12!Ju40mTN=<k5QHTYtv=y
z=Np~pEnWa+q;J5%0XmODG8JbZh+bM(iA?fH$5Cd!FpOYWCt<4PyZs9JC9sIO0ltuO
z9@gD0&+34bW+U--F+D*7FC@4mP1XdaCz&g*e|l{cP^UZGFPi~iMF4zp>ccdS!)h9(
z#rl)~Y~*H)ST>*y86O+$X!i7EXE3_&c)m=vP3oWR+R9;BgY!p8AMyW+c>qDA%4J>c
zF<5*_2W63ph8T>ev%9n>2y_^tqLQT&{;v9cx=58ZOdqZc{;Oimp2lDK8Hvrh;u~!0
zSY1^+3s!7U8g6lAM6najL5o~0)nv>03O>_a;StTxJG%V|52V>5ECbgbzOgiZ{X*uB
z!RV8Hcz7WtZmZ95>lr`4F`@8#X8BV_x)B9TrNL&Pa$-d|PdH~5Ou@Mmgh11KH#puj
zqmK+=vumxNzuC9B_F1lnfduFY?J3*;s|67Ir#z{!PM!mkPLIY)2{2-fTAY&3;?L6Z
z7n1@nh-GROy~>LG!9_VfcmQT3IDGX6>|pMfJuu0di1Ck?Pw2Iowv>ccGLTDDY(M1B
ztlonT*-f%;8?-;}!42&kz<$EdN0FFx#xX}Q$OJ+go!-d<UdZ+dsT7LW!yY`=bda^-
znWsf3qQjYKbHSnx;xpN=Lr(5HcTK_x*s+ChS*X1GqYBso)E<@1uXydZ+idN8E+KSQ
zgSX3c?<=oO-R{w13b22LgU($ra?9jJs0$c6s3zhDrCY<t;&;E{9r%%jCOtYh@fz9l
zlFQH?IG+nIU&EK{Y6sup(|uz)vC;9^LxRp#Ma6S>97&#?0D_59uKxkHGJS)^O8$}A
zZjXbkP(T?_n2nN6H93UDx%R1OHZ5Urn6;m8-@UcLxx5Aq)sYYu(*9{LwTKa9^Hb(y
zWCihotso%Q)*@4dBLmZ=P~9gpIBWn)IS08;mtjA-N3nN5M)7?;2bIUkTuMunG-57l
zqqQM}$#M=VqPgEFsS`H{3XY|XD_}m;hkYb$id@8zFe_-xcYI#``{1oQQ{>5>>7+<c
zIj&{K!!f~F4kv(YI--^{mH7Kp(jDb1a%B}-7?*uu;dD9Db~;g8$Bb%iCrBI}nh6ab
z*GS80B8_&Sf3@O`sMAZ^&=^atk36XMcFQoaRc~qa0>PTf(p!2z9Ox=LJp&x^#S=l-
ziF*iZ2a>2oX0$CklY9fEImE){7NWQ}Vq|U;+y@3jF@&WRY+JS~jTYhRz$k^X(UX6p
z?rE==%f`yVzq;T?oFWik)Ps5W%Cj<tu~GpR7EU@e<fQagAepE*TsqZex&RI%fs@p#
z#(asyiNZ}fzzkV>-?rTlT`%+cN5t58mhvxH0#S6{1inEO@qJTlIZi|b`ob{vMAt*H
zQJ1px&+K7ZRMN5)v7<k2`BjJ%ss@u|)pCk}jP{^vvsmF>f#+Qqx#n|ZAb8n4)9L)_
zC)W|xkLP9V<M)9*bw0yQVG&6<!XlL?4E6GB>&uonGf|Nz1D5MLB*Y_NNK1L#l_}&m
zyZZr(N(r6vlv>dlpg%gEoHFrSbh<v<7jZqIYo&N^BJEmZ>B0KGX?@k4Wj0t?hkO-U
zr%17*WfJ(deAq?#_7xHv!TbcWfw=P9Pao+adr*0%FOH^#p`rt3-_OffnY{;Pfjg;=
zNvN$>kF)c|Jh8a=s$o-zke36y%!cK+pHj<(7~*hd1n+)^`V$9b{nvX~zXC(YGms7X
z!y>0k=Y4;vmg#R}cfBHMHSm0{h_NVatl1ef==<G3l7=BNWT7r|I3|M@5RQC<0ro_b
z%slnI2KZsGaI}+?yt54xl0a)49a6Ij;BngA{$=9Boj5hD0#WuMo7e;hUd4F@=r)yr
zm|Y@pY4MP;i1<0Uv`7*#nV($ic)~9Bf{b0;-!W6&k!thmlaVYiC>547me=579n!B_
z4)nTjk64-Q{#wc8`pY0mHjVeTKS4!I$>(rGteH+^`Dc4We_yVxka<x-YsD;KmEKAi
zL0+C|l@m$*YHT~by?*%;c=>!Epr+1YyA-(-W0w!RR@3#U8qps=M))#nG<B>IIQO=(
z@rKP|s}-rim*jkdHAJ2BBTpyQWV_<w8rT2r#Ug_GEtl7z`x85(rAX>zMS6}4Fhdnw
zt@vi8i@|J^j;Jv|KR<HY`w@Ms(lJK$MJb#o!3&lEn1}T<;^o`4&;X%keu5is)QL7N
zq8kZP4!ASv?|`c$j}7c-C{>B4^^)h=hUd4uFPf8nR`8;pFGk%#dqjXoU2@R*5HV-B
zAwoKZGZjm!itE>vGHG!bQrG36iF4RoYbcwkWTR0I(czum>7+5-0{P$ytu6JgXQ&wd
z#^e>Bn}4q?;@1=S?BH+>DN{e`D79W;BP5Z|HbnD_V)uE#_fd2flHW43g*qPtX3w9C
z(9Cr{&M2Msn`_IYF;x{DAKG!Tm_Te!Jn<|RlZb@PG)h+wkGj?wX~?J&_4GB=zHW-k
zqAXXu`%_wV4|CaQ3%22J+U9cN13-?Tx*x}q>DW&&Jmh_qlX6W~Ca-&I6P!o$z80q=
zB5Oc5o)cXHn(V&~SUy}ZLM>m=mBDWqJW`uo;hxsv51XPD?StdeW!5-**}Oj$c0mR9
zGW*gGuT}ZjptkD&JH{cHEyeP=iZnt@kjzV^@alR-30(4iyn-1qXUf4!OUGc)Uthl_
z25T&PdU!g>3H)uo8@TvGZipQmDg1*o3b$pY;k^Tw@$nvE2w&%38PDsxJr$0A8pHE)
z%tpRJ0rSwGW?UOpMnLp(bfDpN4Dkb%7JP-9BhcgDf^X+?f&V@E1Gj1-Co&Ccmg(P}
zho$erY1&VAFP<1iw$pie-(ZfDzXMh`g8jFeH`5&lM<I(LQ7(?`Ry9QFQ(!)Vn|G3%
zH-ti8px2yda~#H)ySl4<*Wrf<W@X}AjJW4lMo3({p69DB0W&@oW$q5!>3GxM1fLda
z%DnimIAKnb|E>waa1V^B0*y?o^g6EJ8lB&6P=VHRT|JFgH$spZG#6i=MrjX#F-~B)
zOBSZX4mK?eJOBF1PlmbfMH!*xw0!1GqV;E^!FtZi5!ouEiSh?#tLN390^S0@6@42P
zY!0V@c(H3TU<^+L7~<FmqubDp26aMej6g$=R~T~wvoW@9c-YY`&^v>2y@l8t5zN>M
zy}?G65|es;HHSmieZ3-w6uX#T8q}lZ>kXBaE2WzZIJ6;=%}`GkKB=k#QU(cHAa26(
z-xV=*?n|uxKNj)B7;Y-sl6=Sh8XZM9#E>lS6iW&L{P|?nkZ7KX=0O%pUZk~z)<*#H
z8|6uDk6nGNFOyAWwDF@qCSwP0_&7YzmJZ27r{?mgu-|G&Vgu7PWrnKMa1SYBk)5!>
zj6CP7@y$w&l+wj89MyGP$!)v#eE4p=G39*h@ra&J=-qF7z~y|*k%<KQ@0ap#9R7LF
zUd<)`>xb~o3V%7z3ZW+QB}93z_%*TG=bI5uO*J`agfiK?8w!89=%wGg@$Z{oi&K{f
zGo=*_tpLSvCXICS&IkdVe8QZ>Apx=|bAamsO)ftBwj;spvHBpJRhimj;R;O_ubNHQ
z>s}R-jk;w!%h{6tc6<Cmkz7)7iJHuQe`X|{E#bHz<d{*W)S)}}E$sE<PVB)3(h=SP
zJAjq;TyEI)_P8~M{aikBp-=7{U2x}UhFLLqS$h)OdB(^g6M`mo^rGL3qJW*o7!e&W
zU$@Kr7F)3OhQQo)h27T--F3I{M00op`~;EP3c&^JFnts;k-d^fF7CuE`KubQ$Bx<?
zH@rXDzUV!6%wKxY8PwVKUGEuUG9Zy{GV}5Od2XKb<RNvYHR^?)&KFdN8Bd;SP*>6n
z;P5@Fa@o6v?0xa$t!jnnvYMB%>9U!J|3}^OMosCeBfA)(T+`JJ@)ZW8>!NO7sQ$Vu
zuNXnI`-?)VNjVeU!RXEhqQ=$4=0<rVj{YB>uEDF)FI;C#wr$&P>X&V6vTfV0$)2pq
zc1><-vO8h2t^3Vg>)wChtabL@-`?;0ybmTPoe#4tiPMZ|tf27Gfpd<JzA4BkkQ3&-
zo%>&3O|w4BLW8$gZ07_u)P8s=rPR2aVzn9v2R@A$><qCmasBisII}NR_Y7}LPf$w*
zx^N=dZc63kC^DVSZF})J6P{<}u8UMMwX@Dztt?px6mynC%3kuEP7h2a!b-3yf$|<S
zW4Hz!FGKLA=y*2@TcHL+%f0R57k}Lr@l4IyIboR_%*qlv4D*5u9;^FUv+H^#VX?Rj
zqY73+c5zceHTWN+yu}sNVNy_9ke1wu$=#R*)wXpVFhECMd95ZK<t?Zu&>CD_9_vU3
zboI;P_?@lmX*iwUL1;gzPY=FFp6*#0Sp!DXmBruKoan`*ZqUKa8JOwfOSUyX27f2*
zc{%pn!p{)!4KxfLD)w7L>OW*ltA3QJd^u_%AOI<PLP#3+AIgyKM3t;4Y8i>@ur*Am
zB-pG|Gxj_?_^o`p`SI?^%U{l6DYXiLCwkh&`z8n=gFbHit|Iq2&+1dqJ5|i22%6&?
zQvPV*l_rGoA)5L%p8|x>$@EBtQRSsb=hXs{Kw+RY)zMJEQ{$VNaF&@&f1SJk75J|%
z_~foxAo{g4s0>GlfEh9-78#)PdUsq>H{^e~7^;$IJX@K%nlHYu&4%t?w@foe;I>BV
z_mD*-8Q!(~2w^DOdKNSU?$z@wwWpfGhqFVa(}Yg|Pe|n}*$egM9p1bzVZM)C4=dw!
zQ2TwzhSB><(htDZA%tH0w_9M(i1>kaQ6R(p97?V{^?K9Va_>&F53JlMaI*?ak@ur*
zrQI4UqzKX`MuRD*B#jw)7*(9=VL5p2Kpn^CcY1Q;oL~m~jC1Ow+AukoSTWFjn9JSk
zaz?!zo<aks@C17Fjd@tG!AVyXhG<kyPL9pz&dNPh{HC2ER6Ah1qt5^3V2~>XldLR_
z72ws+?wr_u#QmI?1t>JUb|x*YajFajI8GMdp~ppBq{Ovs<O=^_YuP>%ZZ(j*h6{hy
zE&q|^FPhc#<u${8ps&6M_Td7u;pAya`#uuX(4%HqBe)A?cQ%KX!=D>hzveMG{6KW|
z*<urpAQjjD;%<uyuSKs!z<FH!wh0p|Di}g5?w&Sx+?&Gy=hV%aSX7f4SA=8a#|FgE
z)K$qsp508&up9&Ah(G`P&q542c(n}w9^MmmGa>V8R$~E=fXoSV_^=G^(GT{&(pzMr
zLj!kgK&?-kUgE}#5AAa&h=9;*1mES(laVQA9i}>H-b962<huX<#}-0S36t9hRq})M
z3#17nyr@Fgd@NMC8Q+M0cPYdGiKp@LVqkc!fsq}5B_wyNbu3b?(xB40;^3i&ePgj2
zkDvDhsi4ca<kQnoB5Dm7x{C2&%kq%ci4-lm{2rkcuX;4@GA+4-ZYQl;#j44cdnLBc
z?%8!JsS~0<a4Du$^Kb-%+AGIquvZoE-+lm0R;MV}PY7~vjN;LO;{_#=5g@mqn4U$g
zkuYs)0k$L1vNIx5DhP@^Mtj5QTvA+${c%i0D8%<7tGHQeQZ{(d{9pnTu1u5jVE6Ek
zZNA*!c8i(A_~KtAn%^9BNRefa>>NU;pzZ!^A5Rv&du4h$>?T0_yMnU5-aPWdgT{DM
zrf+P<qqgzpvF~f)SDc;uwqPOHqzV`hdq{|n_l8xi68~~Tx<*S*`GWRb7wEz3Flx8R
z%R;`quTj~koC$d;qt|J&XqkXcQ0%c#W>YNbZ<voLFs1VWYvjWu`<4)94@B8}0hs7w
zKjpCnG#t7pnfLVWmfnpJC2gKu(l@7Aa`dumt3tWVrkyewR4q6UTWRYQegiaZd$PGS
zseY9GzOWfqrQ*_rd?-8Oez8<4kDzY}x^;$nh<ay>QT|O|E+2$p349(#S}{IQxSOAq
z>`wgzxd}gE?Jix|WAr>lfA=?`y)CQS8MGn^j|pS0PO9h<4)Pdzv9-_YM4)n7NM97Q
zh5ktvEm!#dP3~ywm8m21@S+DHITb%;YW({+=O|124usw6PpTH?tmEuCcvJowCEy~d
zR^q&EV7v_)9*7d=F7Q6YbEml}qg#NtK({1rzPW03PgjFeejOln+jUZwiK}Zr;TF7p
zBCy%aT}FD^2--voUdITXMOislS+Nfq%L_a`1Ueeo$wiYS{<ZuPB>pTL1vGwN+*5={
zFp-)e*z&lrHhW7uzGGgyzfR;!ts=xZx@}xPj0N%$^^Vl8r?ZyHZ*=gMurDHJ2_k0E
zLS{7+61ShhzrH52avIR(b9~qTi8VD`+v-&{;6^zHykyGano1TzxPgGyHeHISvNf*y
zuu&`FSeZf@=ii@0@bPx4LnIcT;EnnojprzKBlxglHlf46Kp9B9QCw$gfGX|HxWmt%
z(qf7zY|p5l@Ge`OUOGl97I9e4V4b%7m3%+R?3v((So)AQ4>a0N?*3=beV$1h)3)Xn
z^)&!;>o|~(kqE}re@qS4YMo$m{a*E(!+NxRW32&B8qqfVR>J#k`<2Dnrvqe$9&+KZ
zA$)<Yh~Sox*YUxl^FS1QL@BelBbrS5^0(J(KF%c$Rg9FHdTJM~%+aMIZfFR(3`Q9y
zBeY^m>Och*8vp6Te^vH$lYyEi)wlSfBu*L74!KeE-Q)|<5|;iz_%4-D_GKaYFj5o(
zPQ&#*myDC&@`>uZz+<2aVN_*{i%ni`5`PLGnVXE#7mH{u;nDC0enEIAkPz#%v{L^8
zBt(YnnSKN0N96VZjX%riGEG5bmG6%duVEyo=JN<7B7U>?X#0jrcY(9BIp`(i_bX6X
zq;jJb0k`&KV=-?G)sjJj_rvaP<l*iT0WoX4E_sb;ecg|i-8-dUxnWtu%y~*<E+pW1
zUw!XS!hxxwhRJgwH;dW$yTEU*DcFCHTBK&xS0Zy!6ErR)QbAz=)P4huAr;Yh$^6{g
zYlOL!P~l*|Rzklz_CB-Ckno{7EE~21KCY>1NwPL&f((@YMe{}eF?aioZZqjY1--g?
zDnnRV3^j;fV9(&G@=A`PB)ex-3#an?52>(LZe-|M{j}o>x#EOKu+0X5umhD$2ikKl
zbPrF*#FoIPz{V<n*cG3A=vkyhQ2FI@$%;m}D4p{Dmx0}coe74|h%pjhnBUS|!xgSm
zs7XJ36ylKGTEdvarF#G4?RD`5)OlCaJlmxfUz=TYdRwg=mh~_?HyjFlDh*n_3SQHe
zoC}L!GD0;?Q$>>Z%nK;S+*hVhrD>b2CbZrFLh>L^L8nREdFbrW@p5~1h&)Cor?)M0
zSVG;@o8n6`(%>Z``A!tQs#Kfl9d08h7~>BEevut_8s$UYpvB%O_RXI^EAS6Ubgw@8
zO`Pt}Vh+YWaax<7AzNFl6I;%GjGZ4%u7o&oM3~kR4rVHTt{=IAQw6g|B(@V?2HvF4
z(<V%2cS7O(&QZ|)OSkM7xb{uZpurd%h$*Q1bN&}E2@{iFHSyo5B+>ZLRE5(1Z5)jJ
zRURN?d}sHev$hz|1?bo-+4n}}POQaHVoHK9U+OyF91hO5PNQits3zF_=XHc+^0HRE
zY0K1R&KD?INXqrCBf^QvbBSMqkjnjr_ytw8{Z$z6M;cc!#@H=!ksVPr$B?zp1a`lG
z1@JU1swN0IGWE9st(JLY-BYDKirt65RE<a@Bt)K%nM%R#%JW@cgZ)52jSB?BmrywE
z$zA$diPv5VG}_ISl%$lEEGqZW+wTe|Cw(Y?(Fw4@Q}`W(eD0(TehDu9KzEm*Q2vL#
zR8s^!JMk}1jAxQBJ4P8T0W&7^nk-NcYds=2m%{JEq4yJhVsME4SLedO?c}HH*F{>S
z;YGLVMSPfXWcwE9lWSvf93^~wZoW>fg`dxoS6+^z0Gp}P>Lvi`)s51Pn`DO$vL+w*
zEZ+u7GtwC4EOHSovWyn|@hAP6!3{=;+SbU=iy>tnQxQA+1p-?|yZChbwZa;Ip0~ME
z{j+?_ff>nk?Y=uOP2SK3A930*>cs|Q!AYx&w3a$_Z1LB8r7H;{3V%~X_sxwzSbOi6
z^cvlc=l`5Z8*U}lxhei@>=b#FHW_GiH5j8y6DS>a`hzQ~s$^@kQmds6k;Sv8;OVCY
zD6^hGwU2wfzJ|*49rIwubTyg*x*ZWSq;AoGHi=%^Nj3$)P<AjqQbMsbT3j8=nhQ-U
zn|1fU1;&grXTSs4LN7zdbMPEx@CZuQpx=e1!Bht8!LJLN;p2h+i*Ih|JhxCoohwbv
z<s5#sA}=z7&%;nAaO&%Lu#Io$UDD<e!kHpWl~CmZ8ApQDW<y+-lEDVaZ2E3=sFFcS
za0V_~u-=hDHJPt3r}h6tmZvC(-L?a7l?~Kx&kLIFRdi(z=H}+Sr!`H;^iolTDBnSc
z^^>8B^YDBjLETs3V1!~V?G_9Wcf8)Tf(Zs!oz*+dQm9vAbP{u08)E34h~hYo!ePvO
zWx3>D<Nk`(FIH>A5aF>y21o@W$cfNbdf=JR+C*TQx_cEL&NwlS0T7cuDB<N_wQB5_
zHCJmW8W{vTFnWpjkg<$v`#VQql{GQ{t7Q06;E%KAd+VFa=Z4tM9|Eyp997Iuiq7tL
z%0A;}b{+P+clGtZs*hQ7sDGBUO|!y!8ovc+4qfuxH*fxNU2dv-Y-*Usv*lCSrwlR1
z{9{K#096*FdvC=|Il3Dq3L0s2i4P^b=nn;s4!qtcGx!%ou2y5-G;-K$UZ?AkHqiCh
zws=1Y@WyJugweU*K38CxWD8RzW86~FMe7GBwZ)`eIGIF1NVl$H`$A9|_N&3!wNRnH
z1W;t?yR+2L6olW~zZy@<oHvwhMr$wbN?_*sv18{4GF_e9)abTK(d9$M?9sYP09^0S
z!C#G;p_q02`0^aQiUX>qQcU-hAcP20dLz~$oSNo#WLJ1_GKV+bLteijB%XfIHQ_e|
z&digV)095og30W&FSl`^wh%v|R1mM4{FmiTH%}89S5rOd3a9IIA4m*%;mGXmRaEdN
zk-IkX?p)Un99!x`CbHC&Duzp9UCn1!PP6KeTgb87{Vw~J8-3QY!$}{Nii*xq&lS=V
z?wkDN%z>TjPhm$i+kcYUX)1S$(b)11PwU`Ip4$`I&;FsP&Zr%^2z+SPktq*+-3RTr
zA2iOBd7cz0g^vmQKAjb0nQEWooE}eA66(qPAS;9bsGFUoX%M5(b@$B#L)DTG3?&La
z%WPEzyg@#fw!$Kn7zX<o=rDLMo@c8+&vPrw8UHr>){^j#fOkZYe8-ahdD>BMX;=bO
z(1$KwKG&P+)c5N?8TK}kVADDb4!ddZo}i@kAsN8w(^+wrKR0NdhWoIpkv*xuv#d+`
zS%a<@j}N}i!@r@$-m*q$7iDF>2f@$2(^RL8L&a}FB#5N7#LgP)%+NTC2hq2X5QBOv
zn&$HZac_WCV*$xpAm@8)0bOtGC~8fe`neWXLPf)2#&TsxNRafAb^#!!q2I2%QORR)
z|8s9e{BM7b&T01*;P6LY*n@yXa4fYS@-mxb3kS9;Gjc?Kk}aZwq_2uAkTu9K;j51Y
z6#wNRAMqY-FznuI_8)&KYKLlA9hy*Lm`-=<)R6hB+i-X8B#|CAa}FIt801K0e63#i
z%P?M53->hRVmKj?d1SsQb8xwlN3+=>-rZht@MS4)$8iDjp|_;r<)X5Jkv?)(7fA`M
z!KZo`<!t1yiq>u(&lV)@e+Np9SNl`^I6|Wobnu28XU)?m8Q*f#lXyG_pmB`vPZp<7
zgzu;KVg6x1{|OMfGfD4A?2Wd+{YxzCepmxSAjaGdIgXM6?8gjhWuLrMj;GJs-T<nR
zcSIn9A;b#N=K6g{jN<CJ9J_rJ>&gohGpAD{*5WZ^5lhE@Bxp6A>z%F9{onTmUCmqo
zV+OBr=s%1p^5Rprst(!C5iMkma?!(To&CTkxf6zD=(-;~#84dm0n#;7>vFitTS1HU
zEr_313Jj_me5Y;F8aVtibR5%vz7g3JnGn9M1%uB5PX}_Nbe>OeHd`&lrJMm>tgBWr
zgP5a<%JunNi_6@Y%I*m+g@Gnbu!i7FmOKw+ECx@=1SH%ZWKP^gN$-EV+UXzU<SQSb
zFGFx3gbJHtlSkvfP*w>M7VijPuF36HgAd95OpY|_zsI<g?C(P<qk?BN&<rM*<BEwb
zno3Xl<vg)yQLS(+_DkP>Ob@0}jr+{6AKg|R&4k6E%p0tnBOyJY&`pNRLnmNx^!Sn>
zB2pkfj_I7=4CG8>YL>Hf<#`t2=o3HqfwyhCzIU#@8(;JtT}2N{GNbnIynR%*`GLGG
ztx7a*l?qxtphV<i$@#8O8^{+AoJ-yZfW^!-t*ktGJaIa4fc0+^HC&1Gb;xYc0d4<%
z%+xpz+3ZdbxkSRNi~O&xfwGgdZh-DT(_P8aJs++9jXA$UbDudQstQlAuI+N!5-Q`Z
zT~{V#qb`ZuF*ry}f-wW`Ex>FdJ-d!eNx(*2N?-bK#+oTD6J&P=ui#`cZJA3L<dt5K
zsvg9}NSDg_YUEET%bir_a#QcIx|QF(T->c6LQ8G7ku3(WCMNZ_D)&W5IXItTKg-0P
z&VwBJuC6_8=gj(9)hR-7$>GSuAfrM6z-&i0IFH(m@4aFovMH{khS5GKKk(yurPtqA
zaoIqN`4b@9Fn_L{72;3g>;SwcwE&&zZwd*w5;8m}tgu)W7&oxN_~ZJz{Fc(k#V|*5
zU~OA(JR82Vv2b4WJCAdV8idGF@-pfFV1^m7$or4AH1d>h%+|dn7K2&@Xm*Cjly1a;
z*)XnHKXT2T@&eY?3V0tRoL8ZI>J#>*nB;Hdl?xyANgw3l8}3@*!jzf#Z}SkePCD1Y
z(kpzb8Ybdy=4iqt8xuq>p!^r|@Y9wI23bH$=3p?Y7~Q#yBzf<guF~$qZ8bw%4KMUy
z$oFP{-0SoGQI8z+C7<9Q<c^QJ@xrJJ1C>D+3b7zPg_{qM=48`mLE=l4HM2f{e`X_t
zx6-stwIn%*g=ma(xui{%jq5WShFb}KTPczQ!-5TR*qjNT?0^M#gc@ls@EHEko}TZ>
z5IV4-Zdz?ULF6%Y{;F#UbUZd^I?Z^kryn83sjp^cuXQVTUE3!9r`y2hEy1~oKxd#~
zpgvm&X@0bmP%-x(LY?)(<@<aH0gA5pl;M;<mC6xZ6yzT2B|!^LgL?Z_EpCyf5U7PS
z4*_b0?9vp8m@y(^kWyP-h}b6)8E`U*$cz<|4d4h#Jdzut<2z1HYyd3<O0&4b$1yl|
zN^RZ$aRCP6{tFm8C`<Ck;gms7bk5VqWWz5}V6KUw5r+%6UK?ap5{KxoTx!JG46`io
zMp1kXXi=OriC<(d^P!c=rgmEe4!awM1?Yv(lTc9!sGpUeBiz@)>WL<LjjoIRquzY6
zunnCs{D33*bv;3Q;lpzUaO<S~5a|mqUpHp#xiN&ou^XnA<N8}RXd~Be1hMfcQol25
z`+-PRrAAD(7Zsec+|I5#=^UJc3ZZxk=nF|n&Dhre8?|p;#Iwu|j){p;&uMHGzp(K=
zbOj~2F}Yv?yXw+n{_}*YG-3Q^u3o3<zh`r-zH0FYUR>$?8q+%mVv2rla}nt_d&285
zcEulX`nsEo+L}`Fn)KpfCH+4Kv2gv?%&&Z^QLo0(0QRMQ%04ZeJ@snYw}iF2T;hYn
ztBBnj^#Ks~kEUbDrB+N@SBTTi{u4=9<@ZH=Ki{=7C(q;1mQ8*$cVKtFz9MUH^%BJJ
z=f`NY35HdXED!X#CE8F3lsoqH$1e*-mlJ1IW%FU86thpjYk!qx+0-3{SY0+*ASZ>&
zX^|Fb`!CO->ztcWyMa_g>=5flOYKAbKR^ugCj{uwTfkBo#>MBgN$?19U)}?prU?V5
zC_=--<ats>(^WnXh#&}erb7iCMPGt{FF6le<;VxXGk5;jwd#C>FwA>|pXqZ#?|j6K
z4o6rXI)xuNjv0_dfzFqAG0hM>ewrPNnCDCBAU6`1Iq0rq?XIH*5P1Cr+=;g!PqrOB
zm^81Tme|MQmvgG8i#s;$jUOCK9>)>)=Uv8&@aGLh1~`}==aKWU<)nXCg435+b2ST{
z@BsaK9KJC4W%qp%`X5P!y1soK%Yvl#uz4=Gl_$7gUW~Jhw*5z0=<0xI2e5LXC{aDM
z-1JlYkGiJ>t>PcDX#-BJl`@UORj&2SKu<piSm*12V)OSCj=o15*KNesjr}I;&kV6U
z{79l_I{uS4>A1(%f2>_Hl>&^R(J7?1qOzKLHDSVtm^&Y2Y0cU>@pE^pHRMhcv~{J*
z;0~BV7HYR>3G?@}`4k)ZK{0>4?a0!+gGJGH+8~&Dlux2}XeN>EXrCaq3%HTPY3@hY
z9{d|S>~ZYu7O>0m_(5a6p$+eqd@D^}u$psmaiO#Rs1Dl!cc&ug+&M~IfeLEXTo1|W
zmcNrn{}UbkX2^rPKMw~Qdzvfy$}#UHAziq?Q1su<5n!~iIV)KOe|uf6K<r}k-#Z{K
zl=lxua89knzBR7vo6BkVeR4cMe{s0?o!aOIZKhon9|!v4?Q$HK`;I-==S1@R+plUs
z?VzFELLVF++e)U49yyDGsT10;X12qbFLHHTrmSnK#i0qz7DllnC(~J%CRdSCsr8kP
zXvUjHcACU%qg|iCVkx3bwYVl~yBg0|QLg$n|Lb4(0BdzS3va1a8lGq!D=BrgeCs+g
zPV0Li@?c(zPM^WGOQ3x-51Q;k5%NWp9BjbK!$(+Q+0U}<{?Ti8A;rJt1?QxHNIlC`
zKlL;mjgcM#^=N)JgG^AL@gn>Dk66dI6{0V}0C@`-mx;N1etg@>h%5*V<x|+>3-Imq
z5y1d&t!J!IYzc($0>z^^&0NXNz3&&bgO<jwKl*B}d>PXBLbq{(7gTDaask9}6EB<v
z4C?RUWR_?$m&>qfC1#^QDGm_Gq;#@jL4hPsxjZ3R)T~bwG?v`)BZ0YRV}_S7BZ+)Y
zj)+WKkZlg`x~eRlx4{^LTlfJ#z)l3yoW^Y|hMUGjp=;aBKeCnfVgqvf0T;Qu1(D#3
z=g<M$+SF;nZlK7ciPI+<TqI(xbn@2c)J16%7dnLa&J<M6Y-8MdLBLBT{z3-}s9Rm(
z=2tJ^a1i-Vq%lO6Mln_p_~9)Gq(0%PRkCaU3Y}G+cPU+)uE94QNjG^I)k_CS`K)uL
zo2Q|H#Cdz0QpFfy7<Ipm0N_vfR*&LXdn1p@$)CsF$8-i)N?|1~{TX^FE6f$N@F6^n
zh|uGKAar8cR9u(sQ%Abt>Y|GUiNDf^XF;(ZZz;AX?R5!&zsvUQQS{I*;-E@y&<IB4
zIy5H0h*fq2`+dn{auBaHxCXL=;xCA6A<{FuCkcpEI2R~s{z{@f(~T$~(qI<agf8qW
z-;y`07Vf$A0zMRBQ1N56Yz*&Pu<!sdgZj3;>l}@bsr-_gTR8-{cz}M!{dPejbM$>U
z8_2TEryH;Ia}jhG1yms-kid5y03(f*B}uHG-1|-BsrvyCtRw>J525=8IbwK%p8-tu
zcHY17icDTY4@KJXEXd=MoM*hpN8jQs^I4z-<TccKW#T<+Z|du$b#sp-P!rTc4*x5S
zvl9IAQ_5QxV&~7vd!RpdD2zeaKq$+={`kMFPhGDKnRwYU4PdcC4CqSwOifFR;NqDx
z7ivZ=lK5oF%ngX5iI!LKQe-F!*o16Le?MJ)v4zONCJ}Yp#nyK8gA#E&i%lo$G&So&
zUhy;4vlFW1cq4il<bS|E`&@~3&!-1~ChZL|F9<Qg$3Z<@fkXU~^~M5;IAP2LO#%?~
zE5Z9Cbyt2PgTKa$?WFI7>v4j0;>@noH@}*k<+TG<19t<!lK{|lwENqTn^SsILg<rt
z0^B5eEyJ6j)5<@iR;;~OPaJ3M<|+If9jQ2`)X|gF?&E`q(`ql;II3d{Xi}82<~Vc+
za8iiuQsj>>wj{eXO)Qd$#78?P)t5s@1+Y6#XQ9)&341}&@|-!=@?@gZBKw?7=YLd=
zO-71|RvtCLW&l;;PsMj-KUH5l+XZ4@U~Dx3;_sh#MkUnxfX0gDAva!!bR>;2pMiAp
zc>o2&8V)e=d_t={)Jh;Wdd;y~e#Oo_%Z~dQ=^R@r5kN;N!d@DB(jbHSoy!&*V4D=x
zO|uyZ-`M)_aLPd6OWyvYTe%cgN;C$eG-New`kdDOqp2$E=wzwLr3k$@Sc=X!3;5|-
zyoK$k#7L!*-_Vy`FPCCN?j5t-K>eBg4ijVz1Ylh6zQ}kM>pgNf{cg`;^M4tmMLv_V
zwnjyM4S;%6dFoc-J=cenQeA!<S90x^lD$0RlsJnqZlMVwn)E1n`HIp@;Ec3k&}pK!
zp4#vdhS6B2rj$msjF4|wqU^HHQSlLgq{$E9e$j*HGC{UfV@BRQ#DRxcRA8DgKg{4M
z#bxLmW%+TWIO)taa}!9gVedEN5^6m0!GnRg1`{BHCgxYxHndNiBh*#SDiy%r*@LM)
zx3$~<l}y)HQ&a3sRx1x0AKD&nn{#2A%`EbkBTJ@sqjW8Df+qh>FJTrz$sCcCQh24F
zjkl|*11|VBcgySl%PM#6(@*f_FC$Pl5E4HUd-c4Uw7JIXV-Y^kbJd=>)BG8HIh1zO
zoe-kCL?7t~fKT&gB`wV1LlTd|7f68sTsP!ygH8Yf)U&f%hS$@56y0gx()PLGTe)e2
zID0W6(rl+sN6{%DaC&8MUiwwd_F3y0Z}^KDVADPgy?H59N0m%;g`uyH^F&a)RhGBX
zQJ9S-NCNv-1rbfSjR43I&13hETDXcPgFP^!b5OaMQ#OB^$ENH=@u6o$aA|3YTv>49
z(>hSwagEq^+hxy%lWUB(c>0z7hbo85vUsALp7Nuc`_n8Ap9@~dH$O5OgJc-?Qg8S6
zB66q|7CaD8)Npm@!&R)}(!xN1uO*g5Blhpk&3E`w2U5Dp`8%)3fz?B68$#7Qg6Uzu
zhY>*+fT{<M`j>kcH1nT)YaAEA3D)l=#+^4CD;AW`e2>k}o;@%$vF8to&etVP+|T;^
z#c&1>=;dU#+Vz8&2Th|W%SN0*-`!Mz3dJvkfFs%L^-ram7z51PG0Od@M4z{T97ZR#
zgAxZFD0HLIObX!8^MFp{B$Oz<YnW$$qxe(s=qr3v>_I%3{!TRE%MmP{cDf%Iy=)An
zZQ;E4lH(v%FKh{r{i44=OdM%93L@J6R!mDD-f@P-3cgjrNY_mnr_-qBs^g@##$35v
zjtIWZnxYfGfXR3Uk42$%1}l>cn*37pFx+5&ty$x}tKhe62{zH``JYY~Mq{Nv?AxDC
z0$IhA(2?>4$>&KUGb0n+GVFfKSW|CnLgX<Aw==(p8}vb8OZiHCwNKgTu|J7inYR0E
zr5TgXc1De+(4&bY1rsI#ET#V-Z6{m+(iT7zjd%X8$}79C$aj#2naqK~?W$kuU6bkE
zV_^2DY1I&<?8v=<z-s2Bk@ppSjLYQ@<F{Y&)}y}adD*P`PLiPho<M(?uMr7f3j&UI
zFO_;@9QznFA_6;@XH4ovW!U1}ofB|3nk^4GH(dG7lr5OmrD3lqz5e9OTPvS%xjjo?
ztRzS>_ZuO4WsIm;P_aR7Jbb^QZX9cctfuJ;ndN^JE!5MqJ987%eB0hOvn}tXJ?BLg
zLB@?VsK+vyO!RG-!H%eI_=2p3xXrQ_lj@sm?IvEfL{CC6elgCK6Gg#zdYpY8nn%Jz
z4SH=b84~57HoX?Lu)6^<yD_=`vlGc~$9kgD)Yp%@ofQ$G3dfiqH6zbTjm%$6Z>FyE
z;ppq`hQgZ&DajW9HzpIzr*xGe=lN`zb$YmBn5(>9ZGTU&yqXcfhJqmDC4$|#jlfDq
zcsjo2s5u+OdM*4#IG!_x#9C_4QIN^p14b~O2RpIwb&V4E*q&wo0y;MfXb4$$*fiQq
zJLh(PH=I_IbdegV>rJJd$O{AIwQDH5;|)C9fIxKa=HoA(N8nFBPf+UqCqpyl2ilUa
zA<RC-aG<<E9jBKagaw1l&F@CI<9N%g<ZxuAQ`elguzcl?N|ero3!fj4eLw_Ksx7H&
z=TfIj$3LqQqz!h98>$~tUNXsbSlHNmRn>K}i{iZ#`(jE&bICAYNzsdNDb9Vyl75bJ
zrjvP>sD_%*B(#zZMwQ9O<5DJG%ChnNw9CR-HhA6syWk1+Ut%v(efLe-PaG-u+!6e+
z)Bxe0@fN3MyrTqidjV#dnRez0YiSVe`1nf7!!$723nZWPD0@x`+FTK29ty`@h_Ua-
zmqSfQSQ_v>4=ibrL#eUZ247$E99~P+EooNMTJb>{TpnWiYBhjg({>g*iykry`y>}+
zS?~^)8P~f;>aJe*10o@1MiT8mE^;^<@nz$ZiDVpkl1+dx?K;8R{k-YCUv|u)OAhqh
zT;kQs55@t&@V@={M~>=3P0g2RLLS+D&Pv;`QI*)Fg#Z@ou~<F90UlDEl*k1MWVEtc
zdQ+4|#fb+TWu2^k|3~5Ag-HD%a7dQn{c-3g=Uv@){ns?g1l>wSJ$;3e7k}&M9Cm>e
z6Sx%#RU2}*n5pPb<yy?-#FUOR{?u-7qS3><xg06|^H;jE7DxgF2DJAT==Bwu2G8^O
zpG)=)9dc4>d2WQVYi&dG#O1|*Bl^g@orIPcnIb1uYlZQ1^GPqdE~z#=7J5W+qcm~F
zJK<;xs$p7cD>;h-6=Fp-G&HIp{9o==NM3!;l*EcDq=JAAmjcr?_z74Xp!3R}{C(d2
zXSIe!H%2ueI6`mz&v9tpYf`;hdaD>t5>aNf7xKVni5?%M&O6S-8n{J+EBt2Tb|HxP
zFJ)5rc?G`Bmc=eZ=;~G6#vqs6m6KeK{Sd4M+blaCy*(7(fLcZ^g)dct`5bYJ)O~ed
z^fCv|*>L5^%$I;5I(G;od?;0UUgstJo-g>|0jd>Slk`cFu2<v~U7P>DKcbGt?CWW2
zL(x~;H1~@zlC`_Rll9MpiNU-p?2MsHBzn*gwk1|w-W^oF&$p^;B6J>kQalodW3B?E
z$8X0eDB(fRW(BsDBwjn<et?1`l3$W!0q)Pg6W=1PCIUNUWTa{e2>bH`UaVUfEM(e;
z>e<nSvpl#&&Hx)TKs%@tG^M)Go;o#x7VW%-MH;O31-U9d$Xqf&KKqX5?pS~jC$S5G
zMd6vyoJwUbv1+Il1#kmnm;meIf{J8<$OM>Our~B@3nsY^_o|_b4Eq%Cs+pNxs2qyb
z_<FkZmelSkN|7Pv0pY|c9hAvU-X#s*=na4qM+4>C9p$bko4oP+ynjVNAYCt!51CzU
zmx*n8YGdy`NkiQ<y!P_LH^x(b%&k|;!nH=6GGMwcfI=IN0AyG(3m)P7z0Kf6nDBd8
zw0xh@wo&d=N@G5^LQQi1J4O;X40wo?Sz0E*NcbZIrAwHisOf0DYP%GPKPHFejJlQr
zM$}z%r1S}AmTg$Xt}Roxn_Cv8+kXO7298wl`i$UEL%^XIDOnoH<2UB~xK4b2dI^+E
z!<@0G3|Yqu9>V@F`X>fXcxZN&%-9*F>mTiwRZ}_wm!E;GXw}ghSqnF@4TOGyogX3a
z<+_W_RSe+OeO~~Yl2y*kZiv{4ApD|{mG7LXQvXquajY52(##uTtP)XtKfF*HT`JSL
zuGuF1dE-w|rS^t9t%uMve=DYa_^cLEK@Wua482!v7hB=BRa$zD)@@yKRYjw^dUDsO
z_tKpPGSIwx<2~ZJtfh<Gj(rSRo?yoJ4*)|7Pgd&tY;qLFA;19Ul9Y*BxS!I)MhIJ|
z5fZgB-%v`WUO`39WE8VH$u^x1oUj6}l5SC_X?uY0$S`^)FLLik4#^OX5$4cQwR*3*
zTnuQ!_N#ScQPxTML#0q%sk4WGvZ^U6ADf8yx^voGG$vpSF-gs50b!Ytb5nV&yAWU~
z&vNqeCCiL<0@ctGLh^(4%e%@7ZF1RfD-^1q5#ZJ~+`h74C?eQ32P=(dG--WTY}jrj
z2|ph;8#)vOY6R+#mf9{tG|pd5oeR*k1#ac+n$Aak#sVb&F4e+dGi}B&=P7bT<+582
zvSjEIBjjz+!hIhjB6H%|@}j_I()~lbyo_UQ2rR=g-1#_{tDiIuqjr)BDsPVig8@8x
zclP`OpIc1;S`-C3aus<8Gc)!9J`WBMJn3+E><=?)=tglk^ZrHnQ&_v!cgG{#xFtNz
z8!m;TOXy1%MRBP!wjA6@GgYQOOPiezZ{_qCOssIVdA{DM%Hs(?8$cz4S2`uXkE@hI
zHqKB~ddeEFl5cE++8L%AM0*1^=@*oKXuSddL<A3Y2EP(xTBSr6UC$A6kWag`j=WPY
zxxVZB4Y@{0Nov(mY51aUvvGHrTie~w@~Ja7LbBW-V#hYN(fe9yLShEOmM?b_^z_k{
z&fD?`M|pSC@j~?9NfBp2zw0ZI$HeA+v;PM@$%j@K=eIb3oYw^tWTX5A1k+z)M^ZXd
z1lv<YkMpE&rmWFtXO+_src4w(O@(KkR6dYXIKO2wyk;HHe4nCQB)!V)6O1#lOc)LN
zINA;F>xm)>)CaG(WZ7^Sx^fKS-rI<1G{V1cS&MUbk_RDVeoKH#MCVm(V$VYtklo|8
zx7e2}g(G<c#xNbK0$c|t(zG&pi%3a-bb2DbC45WxAzy(xAiV#hl0Zv6i;B)w0<}TQ
z>~Y>++j+9&>W(mE543J7w~nkGXbKCA%VB4h-jzAubk+SdV%R5{pR^!ERv30%rLJb)
zsCYeB%%fDkzLJvV3DO{<@PAMFdoB3o8QJHIorI;w6BkNCoCYK!a`=w|4A@<g9LoD^
zQ#i5y!>8lM(aNt(I8!-C55$PrOvBg-r^F?1MnTiBW0}E4RM~hIJ&bANP=_V$qBk@~
zln_bX&gfv{I6VAKIOL<`;u_I+KBUmK&hK9Gh#&KB(wNEG%HFM|l@Yv%l93&^TVvs7
z^-`Isk-IMh!~<gm?LcoEKB)uU#{=GC_1=I^lFF&DnhuCNY80&5mqZOE=0{mU{6E;I
zkFsw`+!Q_V0I+FcV<@y#QO1sMI$J$Rg#_vjJ!NB`cm;<~$kxue=BH+{>8=lBo|g!t
z!K>Ln$g{;j%1*G7iMv$@Z%MIyrz_TRwAWEiWsf$p3+ie$7^@D-Lhu!BG_F%o$X#P^
zD;<%A7@Ay+bl@l%MK7hrT&R=t1VdFRRj`6z5FcvapkG;<2$V{#5E5w={-dC#$t<N?
zPCn9IouV+E{A3Mw3Z*EC_lJg-7T^g;3`7)`bV8B*_xszPGhcn(@@&to`94kvby2D1
z^7k<mg}-6H%7)=(Qlw0AloW~Rnw-b)Bm`reDpZq)q1yjT4r6ADr)6~6$+mTn*j9@$
znUZWXp7^6=?0zQhOlKdY0Zaku;B&mJe<c+YrAXl6#{#B)oVfZqc^!xlo?+iWN%y>i
zKTlLq{2j2-90kwbXJ|8U&If`oHBFDhQ;knIP;A%S0H?+C#$6N|WBX-8?Uh$f#@+|w
zGreYF^T`L3coOYSV-eY0GQo#AefjQZL#XFQ31@<_GG(l|=M}i(<Rr1b`@hY9b#oTy
zZQw5Vy+|3)<nsOVxzQM)^b+6MCmMpBek4-;^lD8*ZwaeQU}7@TRz)P~{?}pyY?BsY
zryHjUzG)iH#JAP!&TT4KR&+BnQjQ54?-Dm9xLmSh5L-4G+m<k9l%^(-yZ(*~gV+rg
z3Y!Qx+RY9>Zr3W$O!)_+LQuhEHLZrqc8(^RQQ?s}r!YwxPR%!E8}5vQ@FXsrj{c}8
zC}JF^A){O%7+Mle=9$>hZG=~`yg&Ip9bCDcMcdo+8xJ|#H?+D-d9Ati4_-i`wu59O
za2$dio%!A-!P`i*Rhto(6*@^0MffHC)u`wZePi#gWsT}%YOWI#F-V%)(UPVrL*<v_
z>SiGI9t6Um>wpjvz`d4FdO-s&FU-BSow-owp9`K4CyfjYmCM`nd%!`a1~G36Px91t
zyN=zKUvC4VOZqdP5o8158%hh2o2<UfvZ=FT-j8kiw9e~A)AqeDWZ30p?mzJM_*=tM
zPN;(Tnzl#0De6QE@+q88nLhiaNIFrkpm$ve!CKV)KX`NNP^I??XJ|L_!*owa@9pVS
z0ozEw%Is37!^*ihLD)V&Byn-oOvbNy43zb)Z!+xO%BwE<X`WHHDEwMS_RRZ9Y7G~~
zsG4iljRQYn*S8IB{y9NAsA5^KKZ#s*^*;LcZE__^6iY~oQA$z4eK+vLL4&WZyU0ex
zQuaiuu1TR83^G|Za0Qd6_5R^{0lyzdD~(I--W#}V;GTc6FpVhIPxSrbl;7Y;eNo1}
zD!=nIT6@_SQ;<o()UvvD#rybR?b)gP;;Cw}WkuMYEMXOS=m>e>ByLbkHZV$x)n(=K
zs-QR#Q<tKoj$N~QxN_L(WQ>iVL|+q9D1A0&V;q9tx~w4m%lFg{QB}jZpoD(K0E_>E
zrdU)n6q=a&v425yx~`yDjrahmQI!nYpw?_hGDvMz*VXWj0{Fud@7UB}-rHmA)KD;9
zqz&AdSTMy<K5$2Qszk*g5WQyE0^V>Kd|VknoY|P-NO5?<&_PAmrfPH{PD93@0o(TY
z!odz)wkR@48oxt5#$-h2Z1B>l7iUYvlNm(iJX|_)LZs6>Q*fHqN8YA@frsJ*qIl}R
zUhTuG@sJlbgp6-648Dk83l#(it=#Dz-d~oV8Z`vc47ZT0`5y-IpFanJ_ugq+!qsUz
zr+aw?mq_MbBiOEB+VDbo60)I6dThql@SC$>=*Q>=^s(m_zn;x7$^~Twad8xu{JIAM
zVl)xKIVebPb2+-qS|3I>Aaq1MGmJ7fNRdYYXJI%Lp*v;#*xb;h4Zd5_gL5xC;zG-3
zxX+P=@L#DvCws4XX&{{s+4<tF(dVv3XL0#|R80}T2w!`tJ70LsI;o$IB?n(!4Jj1|
zekQm77-OBvP7ihLr3+p6M#M6A){d=4y|WE;78_M9J4LNN4EpUK<w91x5sf-!9jpG5
zEC(L%)4y>H)`c<La%hYHigYrRRr2+F5MjZ>it4P^tb5Z2-@;?p(^_N@^REhY55U`m
z_neHdQN#4;^m6Z1QLE%E27ATRTkh;VFmu;<(&MW2A}Z1MZY(%N$*JNAx0N6L3Tv7C
zZ)Irx9c{MJDx~|O3K#OUsTT5Nsbn=FARM~={?3w8gz&TkF+-UiE_@XE@3uNyX|#46
zbE%{tWvvx|D3oav#h%Lxo&7BMe1iqV*>*RwgjQLh@sO>(-TN{)`w4}O9AIu)m)0<z
z_h9@;XS6=?WQ0qpNWn&7F@nxJ)8-^5JB90Wy<d&w-$C--k6SPY90?g!ab+iuBgRdC
zD&dg#el43u7u6s(=z{25t7hRw%$saj$9yn5GSdD~<$*D%*k*rM2O~xzVUH)lhe0vz
zptV*NVL|#+Hr(mPT+I{Gg_$%7(HXJcUKymn7|EEeX88y)vcJT4>SP59NE6{AIIYJE
zVgiUk+vZyI#%(PJSWW;p)Ul2zF57cyw?CUi`66N9;>(aVU&wtmPm$Ja5gbMhS~cCf
zI?^HUpayrOpq3IfR^${}p3uiL6KQPVynw?{1k%vsc3?g8ujj85RPWE86Zzh3t^Zc)
zKr2tcliAS!ei5TT`}wE7N*1g!bpyw8&(#C;A2zP{DbeY)T2F<e(nXE~0zwgVu6vFX
z=LDU$wa{^l0*Oq;P^a5z6yuBB#N9`t$OUgqL#0|5KJfx)W>`=)gom8^bBNhrrvGe}
zXM)c8XTKUbbN8SPqfI62(G+zlLb>3HiaQ^(gXihAO@jqMg*yC~5p^<6v}BE+1Zq(;
zPPlIhVlL@v(jTK-P7Y!gO>*RDZv!{ZtHsvq;i@p`LAan}+3RZUQE`^UvFoaVe&DnX
z?$K(FD7UBaTfM}V5WY9o8fWv$MYHpeLUSV?)4TMGC3uNfWZ&RB3lpj9W`eg=tmIdA
z{9d-Yz1ke4qdU|g#_J?+<a0~~L=fwZ3w9)W3nv3;s(mnHA%{faA&~p*5S<9+@&8<a
z0STgxzV~xST6%if7#(xtiJ&x)n!%+hvsT6rH)qr(My}t%u_JhSWDsbT5fog7v>FyE
zR`RdWYDJnz2^)9TP0s$aY=1XzxdlaB*?M0+1iCNqy`Ts?;J!~8R|&I{291N6+(U$6
z!eM~mLIfeiT>^2*LPV1Yg-$kAwiD<|L{Q<-(^hNAsP^uC$ep@uu;vh9hO|}NVIC6#
zi4hJ1VcK44-+JL{s1_%V@(PUSiB(9|jd-ef!}-a>VX_@`x95$A5LSrpdyKg2E1mv6
z<;y6tNM1pC=2z^^pEK5dwOUMU*x(~NU4I-|(mZc`oS(e%ztvn>t0H0q#@3q^*A*Ww
z3?7(TCb6*zu|o|44A*OCpF0^jW7S2!ROC`AAq1S!hM&fw84F(}e{mDdb4;KHT7WwD
z#UF9JW6l(q)3B{>g6fKb2mBy790pa)=ou(R&HaHP4Q2yqEaPQ^2c;XKj3W2*sPwXj
zw%F|=XAU`#s{&AT9LO5AyNdD-!b8$$oct^!F`Wxq|NUGw@N~YZWHM3?&U-$lE<b4;
zln}@jC8uat+?0_;9lTx%X7FVS?K`|EM$(R(73o+rXNCLK#zd4jq=3uQFCxmMCY{8p
z_Ik~A@b25$7F>Qe!O`tks7^PcxDQB&0VMxX)7_BSoqNr}%X$^E>_1#YD(ytsdeX^f
zqev=H6`w~Cj7z+Nh-l`C15|YyDVG`0t~YtvvJ(N9=0>}R`(AT|#(j`0J&nlGEFLC9
zD<T8)KL{RLtrPA0Itja&9fK97>-!^+g&Gd)tl<J50ZFqu`Hn*WsUqnP3h1|#;Rs2&
zaOK<dB4sh0RP*gcl#8xZ5RRBa^E__bQGpNVfxzA0-;n9)cDC=S&yu*XDFwi5ngs1e
zK2Kq7%Blp)<kOz&zXa$y|7?j<L=(*|9CG!?{1WurtjppG$=LCcR^a|hL=E}t{y^`R
zEM61m$_Hb_CZXPVW#xA}3uQC=K|6<ms9sXT2~%GCA2@Z4YTiS|o^q+eR+i|DUoMQ_
zeDHd7u?Agck^w&BGu?zc`xZmmN8S(wlwh`+xETV=P>@cw3O?M>r9ebT$N{c^13I-*
z9!y_g7epn`9bV8zH-zA0TjuY;9V-CdfpI<TMkohKna5AUVFmOSAWhIOgTP{VMhAQu
zHihMwLdp<@G;RMrnFs6Zl1RVK;CQa1&Y^WfpTk4pS<H+>Ct#mvt`4m@BJ4&6@-_PW
z-E3$(kC<j!qxJ73(QT7#@b;~_<iz}dwFHeVcA+(ER63bKMF<;lU35Ik$opQHpG)x0
zjMQqD#x7eE?S9t{<6??=kn3YQDk{(S`C=6CZ0^##%i)wTo?8-dY&p4Af88RQ3hQ<w
z!z&twG1e{5I%<Yo=nNVi*me44O|Jw-$YFjz?C%<I6Gq)cLD<GCUZe}{Rp!6S{6&DK
zIe<${-`yRN!{UvI=dM>pr&9P)pSkzF6)*x;@#^7fSWg%_fCCITX;G!xD4=+d6!$Gi
zEw@BWe&XzC8p#@ThQ$n3NfwU2$DJnI9+qqojTp4Hqc@>D`RHqSxvttEk_Z#0mdi`A
zwySlhsnm4?zfvtgLE}m6a*IRG(uc~@%}Wp(5jWH?=4t%Vtz=9mT)OAs^3%e}V=L5H
zMWPGJ71@$#gSb;;*R`OO=%+c3{VSYj0-MpK-3Iy<2X{@Z$<d%qQ|6!D!Y1U!&yA=9
zA*q4oU7Itj0ICPWr7vCCZBh-3i`rXtB5$)eyWbCJ>~xJn*<)NbO;!vdS)HEpydFbm
zn<LRrAeJRlsq58ae|^jZBGhO%Lj22{TJs}szI)pi@{L5Ogw7T$Ow~vzeFN@DC<}S`
zeW>q9c<fMRcjn1trs*g%J}yLjQWM#l*$}Q4K@85?<0;i8EIYgn&3`F2ycUH1{_!Rq
zO)Q9b+}?&Oc!VQ-_zDLlF8euk9!(e7hv+mL?;r_h3fHQ*Uy}#1@dx2zYFS34pwks9
zVNIFb<nKgsEN<`!I)Jl<4(Y}Q@q`4`!(1}z#X9qRqG8YoM&JDGiK$jmtMxmr#;L2U
z9lr1JH6Gv7hd#Nvalve3X6cg#UlW6L94Qp*Q{(r5ig1w1Bl|CQ$b<utPG6<W^XS%!
z#79Ro^J6+&*4OGn9|GLv$WD2K3+ZpMZ03xZe<wTX4xHKS3&l#`lU_}y1*+`2huAZf
zmZ?@O^2*Xrp<E_`-P7ub-4%j@ot@6h-8RCnb9iD|JTXC!aBD4>p)pLpSTqKl6sDZK
zO7NW7*xs+<+Ziuwh!o=_!MW0*KMOB#K2UM`&w(Wd@t~tpzh)W7y&!CMd5!`3+NlNV
zyk14hw3Q;3!u8h3t(Zv|dAzOmocL0l#UM#`!BTTGx{HD<%1#gBxZSU#W&<IKjg`g7
znv*EBEb)V&Iu(8^%xZLbc$yiT#f-{7M7PjjIYVHaG*6)zK^~nL{zLbb7*Y|89cF&W
zE+=s0J;H@?0Vjm%a4-pG$McR(p!mnVkJldqM~lT8_-;{{BIxkJ1nUQD#9C&~Vr1A%
z+EF1Pf>Q+|B+t;X$*Fo#xw+(1+4uMnC|w9zMnVwJ&kQ>y33+YU$XyR*QbX|gfl02*
z>iu#LLZ_cgXRw&bs*wrBT1bDJKgDxsz{?9>GSJ$Y&<N=&hZ6$>VU0X{!3SFTFHU<k
znHrlUZS6X5_(v+&Q`^wT1k>Rh1d$7bBEAF?ie0ib+x-?grbz+mFmzCln|K@vwggRa
z0A-iRQjLyl{zXd9*~mOl(Px7H{dPZuBHz$zyUhHLWXQ$!jm}!72CpV-fE1i)a;pEr
z^q98%kr?9d@bBQpFrJV=rGf|YmrYjeWw#!*`ZssH-gg^}R!2blT(52%4g(Iwz$_(?
z2c5+5pRFncy{^Yv9(=ns{E1@!0UI}!3#KSF3<@S6{NseWN9Udl296RK)n=YkUwbJG
zvL&wJOIs7sfWT$VVA24H)q38j!F-aKYxZ|VsEB<F!J^nqdV1uc?88|A<jo-tnTREw
z3pQ3^g%ut)qju2Xpg5zBYE(EMLQ-mGY^G6Gys&@7?#osQtLFtQ;AxB1HY15#hU7$$
zJHfb8Nphxtb}nA6nFHJ44T_<V3WW>d4-q)=p4TG7A#cuSeuT`4Id$@y7E7C+8tX*f
zZ0tEOU-2LR+!1ZsHlC!)Eb6vpsX6077U}80?qW)pB}wbW-+Z9u_UnNb;(ye7&*{nG
zM%Qon7I@SK{Vm`b(41T^_kCzgGa*Tm@%JgE^t^=60n1-by_I$*swshqrKzrN{B*Tz
z-RaKW|Kwc8ES8H0CmR5Q@_^{16w={I=P#E%?So;P`e}Y?a#h%9wfuvJ*k=d&?Z}8g
z<*+_t%o#Jl(O~{purLU2zk=aE1SOw7E#rj3@C-lU{@r<fz7YN{j;i2Icz#oAFw4V@
z@c?wNB}fQ)(S%3!9Q5<i=38SWqPGuz^Yl)yar(GUZ{R%)z$`P*S(LzuKE5)GE<Iuf
zZ(SpE5zJPuBk_483>x8cBy;@Dj=7Ix^1E1n|KNa(#<LfF2pf}GT=BziALo#?uK^5j
z%z}k{NffI$Yy<LIu_k(;zJ71a<Fwipm<-^yr?(dqwKS&{aD+f+aX&0xTT3?^!{u3P
zr>+wZ>xdm%F^%1Q%6_K}+`+SJui|KJaR|T6`GoOhdF5(tv8k;w>BDoQ33&PyYM)_~
zh6f{Jo`B!2cZc+X)TyJ_`ycw+Zzt9G8F>mspCm>QTYLep@EvYtf$2BbQ(N#ENdR{n
zxnDLa(6qB)EXDeUl5K~ee;1_4--8!5-kX*coVi~MfHQzC+-vwU+k8~T^L6;nmtV$&
z>O|Fz%%ww?<CS!QPO6y>2sUYxX!&2aodK4Ar0R?<hfip0*n0c#Sdq8<M)gS3KNaJ;
zBvY=4Wo2mEc7T9E{OSe0K|rF?NOUDD2n})=?ka^7X@xSyRJEJ|CP%1dxNIVkkdL7C
zJ4B48OBdY6*_w++2N@kW1e8KEzFTCvNyL~hu3Tnq|F7SDBVn(fVaAm(E{B>+uk%ZX
z>X~z@4O;bEzYNra-rmHa_u&pJ<jT3tX~oQ<!%w_^7fb${WDqqOV4uo;{t|)IL-hU{
zKeBCP2<YPJ560?-RjUcf)dc0s$1xEsUmBZMt);<pdr1VIsZ+9h<D0n_njdC}Kj+Vj
z$RlWf`;L0D`x7iC+QX}Rfdx9_3dq?w?VJid`OLd&Z(ifu0imv4*<546*jmO~O_RGP
zb9meFc~MnZ<|~^2L(@6<RrbDLKf5No$+qj{$<~C)wr$%pxlXq2CS$T~+xBxluix|i
z8}`2UzOQSo^<FAPefyr3Xiy)9og8nrF`d2;1M0eBHFY%3t-q@WnubDgTj_<|NC%Wm
zZDP7B*%S!@D?k|SZBXHe+^IvupK&$h>;y&&Cq{=ENPyprYF#P(HQZ@PgT&N&yujnK
z_$nTh32KaGDk(*E{h(0>$=npC2tjWq&lhDtv_x#0Ha~Z-gPB%NaWNna1RDb9zW*MW
zy%aZ4`O8zY!HZ9)dhgn^f0S(Q60UbAiuQxMM&EgT(hGtk7;%L=Fh;H)-Vt>?>5)-g
z`$r&Q5RcRTPb(gqqUR+m-ms`B8Yd^g{@R_V?Oq}IaB3y9##ESk^I7HPB`;8x6-Wrd
zgOPwCocbFZ6Vu>kcQ7hCH8HV-$BW(k9g91@i)iT)7ld#Y3SZMktPz6fXuuC73Do|{
z%S+W`{ARa~8zz)HxHuY5)CS;+Dw%=^NC)fx<u5w-G^%$t-UW|L-YVTed(_9V%gS|{
zrLr_@8=nUhL<e0#Z5+=LAl|x`V;@=s0%D2Ud)+M&&pXbY2rb><gTCInX)fIaxZ?Z?
zCA&7mvK~?C=69)J;%l(KeY{+?`i~}pl$)A=Jg(x#I@_VB>^?H;8ljw}iE8;yiaMcC
z<wzQXptVrDOK`c+JELwpCUf_D{VKO?h{6+K#S6#(zcU5ezOqB|9XcyXwIOA=Z+gOl
zuynxJ+doSl9U=gpIn2iF60F9Q^zw2jSG1761v>eo_Bw{R_F6q<;+k@0;jni0{A>N6
z_us>iy09)*AN%G<rgrDzD;+vedd)u2!1ak_f*n0JSQA7KA1SsS1`X>%lZ|y00BmSk
zQ%UXiGT)}4v0kH}R2+3;BNKWg9nU(IUM1`_;EF^fEK9{^{;1*dI-wUU_`!gGDVR3V
zO-P}grGF|wxj?xdPHfNP^(X}Bi}V@|&J;wrjqGyQSr~%r`FU2mDXl+ob+R7$@&IAg
zp4laGl$5D$96!1gUhATZ-j|cb&}g6;nva=hKacL#xE`!?5T@&Vla?3o1E;=APJ_2{
zhix~AIreBpm&fZoSAH?lTscCzfmQ~Psf|5P6E$MFrUaGkrvM&eKP<Ja3(=J!y5%av
zq&AG@Ul~0ETZ;XNQ{90qjEi_XlxWcTq*-Lu19b~KX);*F1=0*>wM>kmCa75_U{*m7
zrg5tc=HDdZzx&F-h-28~pVJdCPMd&bMf`f%Y-);;%k>|}2@VfM#4$P?PnS-hcEz`s
z5vDd$l!o3<&(?}C7oZ)ifDc(HCg)Ki26gO>%pTD~*<)gjs;dz8{M{oKd9n+3IBOL$
zngl-8l~ro}G6vX$@7&EBIP>lmsMBi@%*PhMCFCnO9pat{H#g)Yh|dq)iv>uLNcuaX
zH*l5_4D+Oc_eU)zf{74TNnJb^IJBb}p46+gS`K*dzyG_d<)!;`rJ(P0pINdxFh5Yz
z;cX?HI@tt*wneg~{hOG871;=SX&X%l%4OoVhj+S7-Fd;$*YG=sLF$6MJMs_t^9S;}
zwW$Lmld^C%TOks!A!UmccOHhS1k18-;6u9UYGjRH?P}oaHzQw*trH+X0q>E=ay_@r
z<zRmqD_ps*4qwQYKc?JYyS98u-l6$2glGb=9d33}TjEI%Rec`8+<`REe3Y_1eD!F|
zH?@T;UP}SB*8YJj-~{n$`CO_RJwhXr^=OVRD~6RuuBOtAK_R=&nn;@`S;FU$VIc4u
z|2H<q@&>4kV;SV2vx29!4x0GmdjO-goe%5cWAEnk>mcm`1#}4makMlXe-&kEe)Snx
zBL*bS%dsBV%CV`D=2un|zF8^5yXuq8;8U7W9w%5q>{^NTU?_H#-|u?ex8gB(wIb>J
zDHpdoa9LCGD?sGqC&9?2luOil2f?Aa&Ys34wiD)TKryRVp{H^}&d<!o6T)v!nOOAt
z%1Zxu`QyAQ3L5%Ik89K}B{zNU2-f+{$f)Gr*|}_2gWD6ZWiz$dMs%Nf{aQh123kfk
z&dccp2$*OZo0w1owc3InR2h2rWM&K4`qac!Z~i;~{sD6@JG=fsZr~n^#kH;`%a`h)
zp$qTHaoSEUx`U=GgI2SrbmU?apW0h=TuQ_>+nj1v4x>;D7*m6QBJ{C^)IgmCy)B^U
zk!N>wI&U8NXKUcZB7pGu5-bk8vd>&Mynn77v8y{D((UVz?fmbq3{Pg$&{EdhZVy3D
zzSo5Ec?nZ?CQ8#vYFw^y$r&2WR;7cMnr_v1g8iP*z5q7#S=_jLu^JR)CF)n#auQn?
z({FN&BzM>+F#a`vAMs1kT@1(Ni*ZISKgs?(M?~6lo%v|tEl?iu{I_tQA6NeL+?18W
zy~fpV(LRwm-iZ{qY;eW5@6t-tV2UbxFnAAT#F8jkC?kXIuK-TY`QMPYPFsW9r0#k0
znO$jY2Q?snU_e05ZYnt(jL|5)0IwjrchXLI(vL3rVF0Dat^^7mHI~zfi3&OqGq2#?
zJw-qqkWy>dtFaEUO%=+`hifzZi3ySIr$#J<Q)sBZ!Evp(!`D7FD$QEnVYX6;Eruk8
zx;fZ}X1RWXtfXr{`+FAQbQatx+;Qt~Z#l@w!RY8(my=AH_tDOvKEiSB=k{Ck)Wpnq
z;QHW+-}!A<z>;>+JuXo*0P15k8G22)DRf5Rq2=$Rxdb<>rEnZc@A9b-^FwUI!BGpN
z0`&1eH1l<Rr<3{C#;~163Cxzb?Kr`6uGIN_rw2nqU<ZW0?gH_qx`v@*1=q6oi7AhR
zDZPhQ^I(*MsB+t}^|@9T;z4sQg8Q%qCRUN;Oqa3ZJVmJptXP@SaG=PN0DwaV-&g^e
zfmB+qA>gu+7Ot0wXf08e8tkf3aZ=p|opHJlEUVJ(UpfZL`t!|R9q1?A7(Y>uXx0Pg
z$N||zQA)m>FoASCtH%v*BCUhB>b3!Z1#OtjT~0Vq3nUdGdgHd-bzXD}=JcbeHYPzp
zanpGiEhTh@WKDFqKceOigIsnIw8G*nYAS?^5+2(Wiq+sP4LR2Ys9$)(p;Ln+a_|3s
zMOpuZW9{CNj3aFiLuyC#2flJN+kPnj^=IrSC~6`tp|g}s{G6Ifi#dgMX^WQE0qiVW
zqUiehbwRlNj3{;-0P;Fxwt~VkDlfdeh{}zPV2C*5B8G;7H2J!%5y~_OH@o!qx$Zfc
z4!&2cpu54IvkK-Is@3k<6hn}LFCzG;BhN-XUhX8+A>66Tk;&5+fvqE*@DYdxAgL1w
zfB-O+T2SO6QMNAEOV&|>B~@4V)~SWp+M1ztod`l@r(D!^c(R{&-D^DO`D#CFH}$(O
zA&WjxquBg%7sk_^W-jdaBBW1woB6v0H?2x783$oWDC!F3`pP4xt24lPoCp|tWzE7j
zjX$*pXAcgnZam)CJ8XD8HNVR+`|oBDhfx~9?sPC79N_qC!>(nwU5dz=yOeoKXOrd;
zdV0i4BM|9(LL+)ep;-9|0z*cIghgWpSSi=jaRK{G&6S1D(jL{gj~n=6^+q|wxHtds
zPOU}|NyIK+jdpmCN}af+v~)@Lyc(jF!*FCaA#V_E5U<ln=`ht0Jd~46%@Gb;RPI7a
zl<i5G^c^|3*FC0O`aMTbpl%ca9?Dsp)E-Ba)<|B3sy4#3`0w1!yk1|PIl&&mWV-{c
zfX+lPfYXu12^|ms8XNhYj%dOd$C-sE`^5j5!_^VK)@9bTy0v*CCg`VyzXy?Z-amOB
zFZmOCJ>W;b+zEybtHuThRrjT!p%y~^#!M@4K4i!pv&k89^`R4%WI1A9P_F^h%e?-O
zK?-_jGSGH}bFFyneVVS&TzJ$<YO##hWy~~wtNDc8(qAE*e7v~n?Wrr(!W)P~9#%dL
zfpB9oC)#{n^18qDM?AHlKsy+nCJ~_!WyO~kQwoPGN0WyT5{>dG7A=)t#8D%i)Ne4G
z=mWXIfLy7ZBN8KB_wbAk%3y%I(@=YwEd9-tM9?#;(;?#bU;%ae6v-6GAGEy$+<qsV
zmo|`5maKBqsc3wV2Nr1p4MHMf{SNaZhAgYfUHhIDw^cN+ze~j8#-m)k8qE%vU%yZ*
zv;tvw+=!H49WkY6zYzrL(7pb!Qo)#6E1PwhP5^v?YW?WQ;0h_}&Pv|@QEnH6ma7F1
z7ZUSA$jM@Y18ChsU1(VCDU*oXiu4WkOX1TTw)U=JITKWom6==Q16a+A#$!$KF>|Dk
zcDONxB@K#Qk3#4*^sSl$<hj#Ga>u50ZET<s<`0f$!Z#qA4zL+|`hcEv>NX<1+8%C)
z*0^l<cJ~+F)Ovm=L`f-Om{Kh%Kl`ubEygsxp^(~&2b|rsUQZvXsMWz8qbg~;3Z^;=
zjrZohvP)h!S8my@$5g@FIh5N*vLg5Aq}}U^P^!VUo5br{C}OTty|+8>SSzjF8D+Fv
z7SJeHKVddgx`T>*%{A?^Bd&4QYK=v)e7G*Qrq9az-+74*k7J)`qA>pCiL^-2UFu8q
zw(Y^?t%7c&;~ngHg7VeX<EFqp6Q){ChG)<pCub2`B?X8R^Fmgo^0=LEABgyUT3QlY
z$y^<KV*g*A!v8P11l7Iiu@I+T(Og-AIE$MWX(B3t31}C3X9MCrB-i*M18A}qsFLG-
zw#IctPwVVx0@ZjC+C%&SFZMo2B@eJkFxK0R#DQzSih?G*1!C}ILcQP%OfzhdCgZYk
z$J^EMUe$qOlRr30KK>P5()YyCe*8llhv!y$`Axp;KsoQsN3>9@^)1gxl@a^EFT}9_
zYAD#>3;+8U_HQV>2~YfOIdH);a~O9v=k#v5{<rryh~vgQQD2ftpgVp5lX)cg>8)I@
z0w1+mV`LvCv<y-QO$qADi~U|YUX9WI@zzepcWy(FAo6n`vAY{aVc3!79lyXWLV;q<
zWiPDsu(loSV0g0Rp<ZE3=8>Vx7kj<v)mPNku{mH8WEGH&c4>)IJJ->VCgxg%(6{M-
z&7?NgJ*!@xEk@>QdG}x5JY8B|sAiPWau0vFw2Y`(jn}0_v&q*xeBHYSl(YDnfq$|b
z&{E>$a`GUPJG|5668;WH{ejsOL76Iv9G_$p*$9@7YL+XJAc_BDfi(R|bBSLu?QG1o
z{$y|q0*61B-Q5D*`TW|f0QMyY$`NEW(4CE+3SB(mHF&WrJEBUPHd1RRoLT1yLPp*e
zqm!DEP{X?Zr=KkvZyjE+^iaU+ya?g*W}6P-Afk_H8rX_Jd(dd<j)PfIP6JOJv42ld
zz~f{!s0e0`J>e(>eU1CCD{ti3<*unzT|d0tfj=Ha75<bbZ)Pf`KSPQ3qh@BenE^L&
z*cVe=T%SH}eZOoD70yPMZEs+?mqA8;uND3^`6od64<udgr4J+k+#TY4-0$>X9=(*~
zu~SiXp{F$Lkc;P^RQ-teph3+}lQIYo=C0ds_ryH-zOQk;K;EmqlV>z0$)dx>8MYM|
zmVvZk5h1smBw{|0k}^u`Tou*n*uKT8eKikuF~0V%QZxhKx-XFL*C`40+BZ!dRvyqG
zG*=XhbB(33mp~mPdbMgu;KQxM2r!bpTjW{JBj@^fMgQ4o1?xWSSBfiyp+@g+6kdd_
zeT+Sf7PO!pt$pc<z@C#+KsHRG13P`<P^j>hr;1qM0@<`bJ$ebOhYm4*0=1GD9E>KH
zcQHJw-u-CyRa{BHu?+q1T$xkVVmMHH8ol?}AKksM*euuXo15s~fk|O=)Dzu#n+j&2
z%oKrYzV#?2<E{p_uhG~p(S`jsyOYzZoR9L-01x)h$D*+BfikVYa5SXF-YY|-1sWZ$
zi`Ag*2!y$G`mgawD(GVugKG?tEErGx=_0C(@iX9Q8X@2{dX7x^;#O?ZP*9iEqpapA
zhPH(kWsS9!P_oYE#2w^XhaZgx_S-%GChsRfE7_oP@islh$>>Q3<CUJn&w2RN4!9Jn
ztHAz?PZIa)Q5^eu3R;^&T?|))-Qi63=dZtLc5-}cqZ`*G)$?#{zBT4{m?laSy28+m
z`qnEu$uPK1$+|#{Ypii1=QPV)lvbr6{>6h6pxb56^}!o(bp#0r5~v`kZ8M^|yVKU7
z7y8Yl2tlw!B;Ldg(fJo;%LPAXmfkymS3|=<@~(M#p<ckP`5er;LvQ(Zo{aFz?VH<L
zTt#To22OAXLr`z<Rd30azoBLan^g!JN{ncnsN~E0O!QP^Ua|mB9<+%bhAU}MI~Kiq
zKyIASq<i5T+m$Zd-6}kD`UDR(XfXuVKCZx!l~W}~ub$y`H>@xPPMY-vY~1zik~$2K
z--rY90KN{20|`ZdgXld2Z{H=4n1Wf&#)CCmE!v_;g#E2!)_Xk4=cAq5$wpUyC$a^i
zQU7%M+d4zaJeV#`|IbU@e8{A)=V>JO=|Pc2$i4osAwjexN1DLcVaq78#|V_hE`=7+
znI`_hq7>VbS~au``k?HFP}h|i37tkbBUcC5aVwCm8mZkQo<W;K>{G~ddWFfRH3q4E
zzt%2})(O3%Dsxyml`T>Llol|z7d~^rAEuBnyTdy<V;ei}u!(9gf0IqYG*X`AAJ6>y
z#y~r}Gy<BG&Hv{GDEij<P6i^vxFg|v(8D0VX2o@%l?Scm@it?2@Y!gk{xR}6-FV@@
z-S9_29m&3P9u9fo-wDg%`Bd2Gf;unKL7kB-pa!qtj(ezvTX#9yiz)Ciri`<DMq7|w
z+Fj#<RGz7)Zf?E|l}~LN-jrolW;IxHIg2OO_eBivUJJXpw1U2`s@6(+i`zSWgskOl
zWw*3U%AEy*0kBwuV2j1)X(bisDiU~WKn6%^f;{i1OX+XW5U-jvZ-1y1|6S_bGdlD_
z0-Ry76R2z~qjW(PGS2+hJ&>oOZ2Dq#hj;jQ8k2<6KI(@f29(@!Y2@h8-~D~4Ue{UB
z1-xU2V(>hl-4?i7H`GdLU>OG0Mx}aoA}C`K#DrqYLWc4U1EXlRVMb+;h20_2*n^u@
z6$uaFkL8{$Lx+#Z-KCHyJYqrji#<3Px@7C*JW>Dnktan-ONW|Wg)rRIh|k@8WfloW
zQQ%2hVn#<XWR&xd-xu#sAq|i&P@WK{jmOCbOigtRS*od-s&ICQIEOUh1C4)l+g;!h
zZk_8ac61K9?LOaMWH4nlsCjwC|C^~aO5sTS?5mtKM1|a99AyQ>ot&obz0J;Y*0}hr
zg@*_KP==vvV_qT{6p({w!sgb6tf7UqJk!Kgy@BVg5F6+Y6BydA5NK<;_h-v~;dEqt
zeDkqg-5tC1b*!|YM6q2CSFy(8-{j$+)Oy~KbTF+r>$#rRvG^kqIrM`}j(Xsa<LB^3
zs1NL~>C7VtnH-S!T`(yrsZ=BJB>+}s3g}MS?f<x<*bU8uAUwQ;g*vRj&||k!Zz|o~
znAA|sTYPrHz2IL`+$l?itM(cMZ?IDT#FG1E;c~nT`=scFf7K0YNc@@gXq>AI$tZyL
z8QE@*sr{#8kOtiJK&wudm+0X%LFb<CDwkbPE4<xR>FJev8#5PU#zxfg<0z-gSW6I=
z`-WUYhfoDfu}!;HJ<m_bDMpQIYmDLhf?;G*Yl+@u<_qu+@)opw$j6`-W(;PhCgcXU
zdH`z|hc;6(-<(oqQaHXf`8AWNsiGOuX3x-*|MH^Q{%pH{fZB7AS89=tz^tyRS<2&q
z=!{K5&5Xm`%|_t+iq!w`SCUr9&CkB6*{vCp31DUB1+hGJ`0>ZqiB5QFy46H5$JtoA
zDj)Fxvn&-%9dY{}oS>6+Sq5WN%Iq#IN9kpO$tGPdU_lqAf2|zyvDq%{O8XN*o9T@>
z$@L@(OTd2McTq*1f4?GJ`<@K*)b|MEiwxb?=C@e75PCcp&Y99btwZ_uXeQ4tNrtKN
ziWcDPG>L87peeR|6PDN~;AF0Zdg`|mxQi38GGU|bSbIAN)@9c7Kz8J&qNXcqrNLab
zS!N<Q7*B<}YF7Fi&&VBh;$PlmAKkt2&xxhq-pBM}mXC@Oi6U>u&+Zpm^q1XVhAx-$
z1R$We$_*dnr%daHq#B_bAfA#s)XNmJXqC}%a3=o@{xw*2_a^}I(Sk%0Ht$|pJPZGZ
zR&rYs%wu;y3Bs8{6$6G`<ewQX-9Is>-Iv#l{NN>}Hr^Z^@dLI&A{fXiZ-FMwP7fl9
zSU;(^--wr$!|{Y|5KwL=-;@Td93Yod8nJf_(eKl{)el<|jGeP`y8VX&m_W+<G5j?K
z3X$thYkJ^%-@M}`*}*UqGc}GU?+eIZgaq9tuF27j`og<Ek3~C4#Or@=n3~A<4LUSB
zAyJ69F=2w4p@+U^yf@&}c)DVVF-^!llr1~&mY>lO8aJ(bDYRuuaKew)()Xjw@i2=q
z*SU2U&{dD@kRpuNg~^9ba|1cJ$pc~|G(!j2rr^(4ufcB3o7d%8+e2yTMs7?n_kWIk
z5xX^6fy-vvJ-huAD18HE>KBP&hAWd7YvNEhJ-x|aAMi?sX#%XU=mBwX{lO!Bqd>X>
zrq^oOUq=;a)UGjk+E>>fFQN@I*|bA`KEmLZCNhM4Zb-gwkMe>o^Lw2syi1hyrtVCq
z*cSh3RJA_Pyj;%fCOM|-|K+YbPse!8Q%0exRWDj%L&WbFC>GkSPhK_1en{zx!eF}w
zVcqPqsYPKa?ePNQ=or<YJy=3e;8Sq9r@^mP=k!IVvb~J5I4i&^)NNG-7ghXrk#NW@
z0k%h;WV<rmT@%~usF+rhB;?{^3x(1`PW$aMD#^LCRv`y}&ZdzgH}YfIEv~okK>gYa
zRzgl=>NKeY7*v8m1`ZWNCR9KCcUw}1%&cBNf*JxncZBol0WSLyMPj88^ONFq0M`dy
z*?_!4mEmnnI#KwGTMFiQqg8R4n2y$Kd5~!CjzsJR3v*8#uA%=cC`yG$CC2Xz?o!9?
zRPQ8qoiE7ekg```>_jpF5jHG>57zHo!EA7Z4Qp&(v(y1i1cl?{h}E<$Ylx%q)`j{H
z?O?3SNFN&ne$e;tvV!q#Wp~KKE9k$)ct-yeyR6;w{6xf4ZH)cmdY1PiXhue+;D;|#
z96q|e_5KwAvc?Nb)XwP!XDnpaezy3BHTn9V+st6SG1~`1PGlN-N7F0MKH~fE89`i6
zxY?{IRSmgCLe{>ar*S`F#C*T;7Jnlno#hW!chYqFE8dPfL%-DSz!{8|k8Q}(2NgXp
zoSJ8ItNo6MVvKQP!QXK&DS7n#KEnUcH{Bh7D$y)wKh+{o;@hzan+YuES$CZy)OxxG
z#W$gMmjCe4s|xB2=9>v@FJlPGU|GCa!qh*DcYbb)1h(@Ou;F6sN8!(;i3A;5$QCK3
zEiHOc%SH<de}T7bmsh~-wRHQU=lEg=%>9DTe4q&e-$}_bpLS!bTb1r1q=v2nePYUZ
zNnB9JeTD)K24tw4pq%G7R3`)B5&nHR4;r=*4HwI^?jQQafrh!>VE+u1mhPV|@jr&l
zKVAJt*vG|Eo{H)wL3zj|8V>3slOEZC#TNx+l2i?UnWN$P4h$lGr+ZMQ0zx9bUH*j?
z$ah5ER7!GO+~mSr5Sm1>T`T-c0sWY_Qn*aNBb9aqReigLAy;<-$e7EEl`ES<KoUi0
z!9+GM!9>1M?+~~{*)w<PmgFx`PK^rpN7nZIPP2^iTB|co!?|(U-cnesnyYOasK3&k
zr2txlIDX>O=k9f^bvlBu4m|vh&lkee2+uNL@kF&suKmAaFDTyvIkjuOdZ3oIo_ZI@
z)(pN5CLD4HvEaC@k*!+<mpz92OFzt*o3X=_OmZ~?x2*VYj)kuO&6nij9>FLTWCA#2
zO!KTYyB8@>F-xuCrhg0GCKaO`x6+vK2!EP%C3><Vp8844Z1G$!9D`@M$bgGOx&9gc
z`M45!)pqpV=k21!s^|~==cKiBj<6ck`bjcP)&~N$Vk9^+b`}!93MD|bgj^v=uwo$|
z{z<U%es?G)3sgTU^rOcg$<)-94oahkSnc~~8E|uXPz<<#4^<*Uts8s2Y!zDppKyTg
z7f~kWPJ_%QBSM*i?HjFJKxKToZ;pCxJwvw^DgRx$q1W@H{^)$y?C%8VZ}Q6TcsL3D
zEDP%f0XP{}uzeBFrB4z^L<Dgg?G2_A>PF)?-e0bI_delKhFJ%dDb17fKciG8^7fvn
zJnm*n`>+BxMB=R1F?|P+UeDIdzt9XQPEHt2mWSbLIsVCH_4};A4LrxJLnZxgkb8hy
z+-Ydoa>A%)e}dO*dqxcy^?m(8Az9HGM2GZB#HlHF5{FRBr!DN=d^F}vQ+o<Ro<#PY
zME0G@kr;$WLG@1io^1%%F$Ycb;-71GW7H}BeYQI$Ht5c0cWbc<uS(?_e!Af6U+U!K
z(pkXRENej3?$G`<I*S}Np$nb*1?R{8X?Q?Y!X>xnV|!nYNw&Lc5qXN{+N32peqJVg
z26P~m+rYRBdIloTAm0ACuL4-jmlihB>j&LMjYs3`%bF6unzslSfV3NSyyZiMQD1N|
zAOoms39(`!!zMy*QmTGi=Mq&dt!2My4qTT;rwI7TMp+w8)i}kIjbD<XL0DP_V>bB=
z3%bl|d0vB1Zu~w^8&n?a;mOqg9UnBfFFkezMqWCh=J};(Ht?@2IriB;iay^J;{0;r
z4uuuM(B*&c9fjO7OEQJ6B`Vqd)S1K|^mS?T|1mRb&+<OBwf9@78{~GnCYMx3wB!Y^
zUAZJ(xs0_B_f>tR&8aRfmT)|7EoY*mvnuRif<FD1rCn<fcx#-RqaOi%=lr{&R5%du
z+M(S_gEKYm1r7-lFWe1YP-n2?zy0`LD7KH((d=hS39;WpXJ?D_2_~X|%LQ9S%HBT$
zuf$$*_^Gz_8R<K@UP8Nh^dpc&4vh2-xXEEa&Y~)E7TeChNWucWdw*wb?LbRjlHOhp
z<&d(g^%vKXZPQW57TY?@QPHuniq~5j)s=1XiCJmrC^s!Rb5{bLrQ=1u@f2nw9SUxo
zmTOB)G?GS!a9C+aFv|DrY5RK3x-RdEr*+juv{szn#&U&_FSA9sR@_>%`XpRF{)@<!
zQYd%a2@^z}a0}a_e*^EAT#q%i_l<GTA(J0QQ`><ryOPOqt>b9IlsA@E{q=nzS3!y)
z(gNcv7MB&G!|g()N_Z&zm(jvNX7R{hKhTr!1IZ1rfk3=v$9fZ*nv1oTig@#E{)6>~
z*K)HS^)0`@I5<`q;<gb63eo1|b$|hMWvpi^LS)(?^~QbCb&tKj$McrBpV#3fH=F(p
zqw*pBZn%E>aCRD1_3A}eHNr~4B<<JRP~<?!JE+I8OIebq@yL}llM%c;xTq-^1=!?c
zUQZq{kaBl6%}btfc3cs-<&Gqq>K8i0y%qj;`GweQvl0%{?Yv7k8*Ye_T&SvY9f_s7
zFJ=nDA)NX?0770aC1X_>x`1NpY*EBtL4cGKUt2Ly2^0i_o=(W1cqollvsfsOx7Q&9
z^!e+zPCWb08|G=HaG?57BxL|uZGL^{#P=|6Vbr|0oAiej7bR+d!N|{0U*lu$zr1BF
z(!(opX>8~!Gl~{)+X|)PXuOe?V?K*B4=!y{0HXkQeB3s|`+gjao>-tsRQd_z%vm)|
zL6yT@dtdD@D<wUdf<la~_@0r@td))&!p`iIrtyHd3(0E2EydO-sGfbEKa-lv*_nZy
zllVMAF1xysqLaovNe$@4E~l^>Et51IyGzTCEB3YBrm{(TZnRu39Vi|8+F^8OB1vo3
z2JQ>JC%g!$Z<0vI&eZSO8&R?v!2nP#1>sKt((XwXEp)cgpKUyOadiOz(VuGr;6z6q
zAg&P+2sCb{60UG4oW~uTNoSUGsnh)5Cm<cj1#Wp>$+1=JJP3;U6`y>Q%5q*&vIO$5
z*Rl_klu;Hb<ze2%0UY;fl#j?Wz!oc8wl^bHXWFcZk%$1_?~Z(<<gpAjqx{7@Es+{k
z9@>pZ;KRj|2Qqd^6r%P?lw3xV@6yq4oVC9w0w$-c3R=T}ymnB|`$^X?FW*f?dXCD(
zSsZlUeiOKTyUclqf-vR#=^RdGXd06r;J{y4sh%h{imIA3XYcc!Nn%%K1KU~Xa<&LD
z+virA|LwfN162C*Iktwxe;4B^>!1B!o#1*gsFnFY%W;F5K>Sh87k##`Tk)hfXo>5+
zJC(-u;V9>SD9!(I&Ys3|0DgbMjlQJEhri|1fW>5<bxST~&||O2O7*Z<8t-=aaf2BU
z2S}$<l2jUsUAGD1v4di?qt3DdSqH*)9zwRA!?*9)oMbdlpxCnO##{;QjvNPV3-?Zi
zbFl>#vCbd+H9szx7{2%;S~g!%qH$^l^z}8vI4j)y4tT18tn9Zza}xeGR0X7>PYRF#
zQT;3Prrs&bme(mXJJL2sKR=v)5gsCB=RFTb+A`IYT7~$<qP1;EU?zC#0S_JbdkCbn
zP!F}PSI@$Y%z0})ubcj@e_i)Vjq++cV~YD#yr?IAt^Y>+@_uaDqv^Q8+Yqs%T4vzr
zty<_#^b*J^6rr?^FE68s<*9bB4%L|V6RwU5<xr}cXUTS@9vYPQlP=K9S4>Sw7ic}!
z&IOs6z|DdGCK7kE1-z$A6p1PO{?t$;QpYD^bYo^S2;dpA1h<U)ircp4bEwDFw{yrE
z(Nb|VQ<ro{`9a$Et7XCNgmz<XXQ~}6*Hh*N<*NeA318S)+UL^Xkp2?wIF%(KtOB8s
z#{RPBpq^2m3w;3&;TK(Ojma?1gl4iDFqcXr=dYrBtpsB7DJxh!wzE98<EIRUA4Q{j
zmO>lDIEcW{u)HPSGP?Umx~$1**`Kr@&BOb_0e7IRjve{(q46a!G>tEH%6Rj>VIq@T
zkybY`Q)=c6RE8Ym|Gq~|Cvgtsy}KSFa8BlV1QGxGg2eCCEb6!q$NSHm@32Z9LUA_3
zHnb{Un~TJp&Ean?;fz@&$ygzYFS+4d#y=SIz%Y8H{u1yi#I+(=4{H{EmqY?5*DKQx
zZK+UOcSt>h<*EFS;lkzfAr1!WNw#7DK7s3bn$l+b_;67vW|!s1PaC?oFo{lsa%4Ii
zwz%!CL=oVS5{Adqj;(LiunrfT<iFX!oS}S3ml-*wTbM>OmOO-@bCYgDc{w&mHlN;8
z;LQ^yP}e==dZdr~8a){6!fMNa>LX}842F~$#SzUR+e!D98)#xW$;)iy--uiO!gM_{
z)^%Li*H)|?EU)Afak(Bx)^s3CKET?YYx(1T?$)*sr>JaaVr4q&rW%5&#qbvI5gx@z
z6DddQzd|eG2|DC4G^VJaIR7HYJN_yfCXsKu86v0y^`!4(Oy4*>F5PSW_tN;G--Z19
zFkmSK)Z#UcM2Rg=@K1I6ALgj@*vd6Iihh(){m59Z&F)QS7uMO?jb|~~CbHNvq@hyu
zg#UU?g$@+{=fM4gJe<ySTi6afmJpXcvHH8%Rt&9pl3+jjyhQ%lLN$(*2SN5TzG8a6
z^b-YID?jJ;+gXx=!OpJzpCOc@-VOYJtbQ#sei?gsBK*qHP^Hc^+e}eB1%gWHamfTP
ziuXd&E)!vZ!>%`d|Ioz7f*8```l%!NIO#ndU2I8;KKOLtG9xaZ8{P4C#;!D=in5hD
zHKiv`y%_mPAF>e-23i^|H*YI>{>~|U$918|9u!BCUu)-ltJ}Sk_jsEyVn}O2Xa0Q9
z<$p{Sf9}7^9$sesW-Q#j=3pC7+FEXG?{e-SP<<(g>iZVc6Onm2z}WH*u391(XP)he
z*VbmgS5dP_&lzxP)f~EbkYq1;Bh=Chc{LQWH6_+2luyox+x3cBG6_}|8!9SkM>try
z{x6H1Mm=D%Q2XdXRj3xmPm(b6IAA?xn#qbLpL16*wVF5PxIJgv?-;A{auGRuG1X`Z
z%eMBdo@?1vn&7$SJoEtaQe>i}h{piA*FKgu;Gg}|RZG;&)oUG$CFRHb9?*Nha~*CI
zQ$Wc`BSkXNl=`Io){^Npsd0Z0M<0p^IdSseGDrMUbQfAZbE#G?NThZ9VfS8#Arqb?
ztr+*K%Wea(4l0~0zifL&43(l#5hA+ZMA{{TlPpJzbzHy@A^ZM=pDGMFqbH$O3bz`W
zfd6?z;9I$7d4c2?8X`{h&q;@oz=qWy(!OLxh$U22UM|z)^j^lC47+Foq(GY={O$${
z46igy7#n{<8`9Q{TzG)=`d~caU>PPiEo-VIAH<^<eR92z@{CLjAt(5gybna63i7@j
z4bubK{N_kcBiLn(DpPI0T>jYJ>#d2;^@HZ5v9kcLqKYMqGto!|v)WKFUPA#Zh1$cs
zYthDohZ;8BDgT`q#Qmu!23O@)k;^C?`f(}~-mf6vO;yO$60Jx++S`2zHOSMLcA%O=
zho*XkN_>eHBNWYT;lbT%llRTduwUoHqZWhC{dYY-TAX-+R|u-jCmOpBS27r6!tl$D
z*F4)y>**$0VjcGjgZnEX^#1Uzs5LusDQ`^XP8I@0Y=&MO`tJUe2|f{_`15cMpn7{c
zo~^Qere#8}IIJSqWHh9|H!03WM+}Hy#<$~mlGcLxFgu#EH)1ABqkyAEl|~)S7RMS#
z^nGqSNXM3zkGKrNh3WKT2JVM5A8*(Tp_x{J%L&jC`V`_3Du}Dl))YIpvlTnJ;;HxL
zt=qsjyrS-}EA096!ojk$G=YufCUkb(NA2SfeCdlB{pb?0SPwyP=uP2Y*3R42a9r+F
zLF7~1Jx(+Uj_)eDv16ux<rcRj{ei7?6(Zwc-Vgp+#ec@?EbBBu*7`y(OHozJ@N;j7
zScvHxQPf7X9{7@2&oXH-|MLIhz4z?Y-E&!$g`X#dF)z|Ts+K=*0MjcqZqH-y5#XmB
z%X=RSPzhlFcKobXqmS3jlcI`V*PUN9JIr8pnA#oT=r@Rh2+?J=e4WUT<bQ3_9yp*;
zrbo1<*CLdv$}AXhre+{b!uB3<PGH2X_n%8DRI1aW9GVCd(N<}GSH7}s_z02DJWEJ?
zVhuy?Cio`sj>P}TNTrO>9TgCg=tBz0aolcJYYP^g2=vOsHhr}Jo*78A744b+FmAxy
zAXiQL!g>ms=Eon$B3S!7%TuUX2#0^&g#snrLe*?|YRU_%L0=mw=Z&N^`p{8=gE|6W
zla0FGMc4Wvx&1&Kvg8h>uq0Bc-2qALzuU)WUn6R_>D2kW%l7`l{M8cz&(89g0z1?3
zWNWeINV3{^5?=xM*6X^o5##q^KRBId?C?eeasY>a#vEn)gAUfg-ra$|(OEN5gxKEn
zYenRK25CwJeLuwo4bY_|@3WvSwyewY(z(9I5`t7xmk8^%>5UZT$8yshP4yKo!d&r$
zM&5HNz06;Ma#aVBpDN?cQopvHfWNsMV$kMU=ZT2y$I?Kr6^zR~9+EY&Pa&%hjMHgM
z?2{VsCpV*e!8Kn2-0B`p1ErD~^m`1G$P<-duFVFi!2wle_l=&%ntp*;bqBL;G_jVe
z`1Th^FlfR2eCh5lvXH^Je8`W`!W{FT26WJa5kEEj@x)&_lj$TWR!3K*AGj*@)3*d_
z!pL$LCAYp>BC!2_vmz>Ep7=-(ufRof@)+$FBP@c@d@i~h8Xr2B-FdrkB%L}Dg;8hA
z_eq!k^LbANSj?9?{+`YU?4-e;d%|$Yi{xVbdDe&dHt5*dt|E^#gZuIB-~^3;2wGWv
zy63x|b)|8fc>3JuK{6c~YRdYl5W;|Dyi;I^N+3~*+YdUj1q^UqfYcm-JEJs1oKu>*
z6!{cCJz(e8{O==d1L}4Mpp7P#f-xl$Cf4LfHVs!Y$T39R_lHuS_Wx9FBs)cgN*ho(
z-I>2BE%d@RLr1!7Li={DK2EL_?}*||$AfQni9KhXAEhwHReC_WcH+o%5etp^%w#dy
zTH33f5YRv@{_yuXb{8IUdfH+*y5sUa3%xA`Gu8Ouh^h0fCRVf60Q&Q_rR92g&)MP1
zcaHTIBtFf3nYmo9ej}<rjh)PT%^h|P2DzK0knr5-FI#=dsN_8frzT!uu@5^#Yr2_+
z7Kvcz`=l*3hXPs1CDY#`>X>&G7yS33<;xm#<U$yBJ+M)&%dNC*;B@~T`(yr%`bM<5
zr3rLM)dI&{dA#7pK3lX^mB4~>y`MNL{LGct_NJfSpU;gT<c|*hq@0>~7I<-O>>w$j
zuDm}e<(BjkWx=V10LN!@j3Gdyu+h6HhyzQ|5umItnh|sS5xLOvQm|b2h)OobZ75%(
zOk=x&^``AUl)cs16KJMkpjy%VT<z-)_1y!1!J4~Y`&~c=0>1KQcpEv4#qyoq<6?!o
z5y*)t(O9j;h@X_zabsK1<h7Fv-WI7>=-)`?N@1KCrcSS3sl?GMhm-NsnBykZ7Bn~z
z)t5&Ju5y$p018lb=nT6--3ud%lm{a*4a++M9s+hwLZ{%rS>_xWPvF3TB8r$ZTbjGW
zf1d<HsyAQ^*Ox&StA{BiWr>P;EuM?yDE6i{2#4jqTJ3&^6%6Syh3c*av&u=%UaU(X
z?*fznrJlUw0n|9F0B^70n{=R&x)UPLj6+WDPjJ=L=EetS^x8RJNJf}~a^&;HoZ8lF
z>lj=|;_rU@o;>Ga#Jmblkv!Vibv)vW>965b5Lq@LnWM<p_^!|jKwUK%>PzDL$G+Fk
z@=(XTD;?Ekq~u2<!yk%dwna`zp$5%lS2!!S-mJ;FDG)U^l8CRl*NAp#G<mG9H5au(
z-xqmG=!>69E-kk&L)X{!8%T45CgRhJwcB{z4%;OEZ{4%IxJI?t^+w#!-k>KcGUI>!
zGP<zbWz1}4b@Eev@5zDUchWAK;yX$dyJZ<Qts+H0!CC#j_<VFBC~O%E<grV?lC?9T
zN{zFnXcTVAyk~W`I=}lI`itkF=X@tx8trg1JZJ!y<NL@7aJ`I&Mif*>6zJeAeD9cH
z2?jDs$n7kXCG4@{C{j}H+%Y*VL`zGAMdS~p3d3)VPD5-&p!Z6lLAj5@^&uub?~;@{
zd-RjQnTWyTOM1wjh_xf=X>-zb_GELyqWM}2EI!~P4^!GY<f`$#Pgi0!>wDpit~CyW
z0EOZ&b2a4qJYd}w_-6v7nA&kh&b257u<t0u*uGW{r$~chDo9#VxVA*d^iuH_A&5U-
zsAl^!)#;+S;!e~m)OUVMewU8>C|*EcX)#57UjolccgP6Lph@h$?nAV6{563=u#p11
zU~X$K7Uo1}<-sd!3rxf-QfVUHj-=KXS+Wy#oM<Yz-i;Q2-W_ARV42gZ7(nB&qA`^s
zhZWTx{6i9F5FwV4FN1D3xZ-3XWJ3+X#$H-s|8*|18u?`NoZ({!!6V4d-G!*CAgFGQ
zi{c#%;Rw|T3fnT!J|ncmy%j{AD=Bw<BQ@fh>_T902-o36Q<J76<i>DJ!PA~?{5IiL
zUxcOO0DJy*=$G>XVP;^?M1EY-Kk@uOFMxr6^6hJNFW|PKM&~vTWP|)K0*ZsP7tP$&
z$9MIPSko;C%WgK_mqhD7K;*t2`uPF7n_*q891xp*LahJ{82;{!)L`BnXF9gocY8pu
ztfCUMP@!S`_E;rd-RvXiJX*3ll#o4Mk`Y`C`I;Hl?>gEVw8fJ}Uit>_x;S4v(A63A
zS=3`er#Q-{+SSos^3u!p^um+wi8q{YU&8C-L;q;$<`smDA8{;B8n}OL=x#Xc+kkq#
z&|_PrB7wmrD>VZZM?VW2Cm#g3WWSOdI-RPh*hoYjrv%R;FCv%ZL?9sVU^!$XH()sp
zMkA|SCLYGOCwyePaAw|)AlpVTZ0La5N+le=1lAayuo4DtaSV5**w(fTVlB^>Q}SN`
zjO0`Oc%FCB3H7>RGdI-W09M-!f<d_*2urR6(C&`uWLSnw_sOgwC#u&3rE0^2{drU8
zIVIlXehkrEvykmKe{uo@cqfZNSr-ljVQP$T@RfMA0<Xsf|20*RDuf<5!*MIdO;O3y
zP_DbA(opPjHetR%@Opj?{Ll2w4>Emsbz=JY$D+xq@zGO86!;N-3`TB759TLlObAB+
znb57PV@@oZ41;uu6UMfO@Lsuu;v;fC#YF7LL}<7LnYkhO59i`_EOSx(wv_h|7>DJ#
z<$EAi&3mraig*Qv_J^+s)YhX}jFdC#on{M~$`3>I7`D%CUP-4Y9aCbBMY!6k19*59
zg3!r>L$Z!ozOHxrmm4h;A%4+oR1egfj{R33exPaxs^1v3SNr<>m}zr1Kln6XZ*^?_
z`h2_DPgLBw^7ls;7azL@5hU{p2cl+Yo!+1KNJIL8!UrY2I9J2O!%=Pg`0=!y(2V$V
zaZP2%-=pS92^Z{W?>j4N`a!;0BN&H1+NBRs;cnh!XV<lnMAif6-*!^oX=CGWqgsG$
zC7otXij4i{EQEj3yu88tw<r39O|Cj7e;})}_Wux6ebB1B_E@mkZ)aR`8xEQ)@DK^n
z!Vc&VI_fBA1tQYSBE?xtPaWanR4h{D7F_YBqPz`G>vy)Gx8b9K%!z2*o)|Qb)Jo`3
zT<uK<)@7MDUIkXaCAFRti(ta_JrTEDTd_CQiE2A+LFnv7q)e^GpS#QUfXCsPLH(T)
z*SFeXb;z71Y>}vfzYE763t+K(%Q?xT(J2Fq5>1Uzbu9CX1H3Nh?q<SIJ&@mMAR`&l
z*yC@D8@6b`bbTk}ZzeSKeUr~CfraB)Nre3D&lOkrC8;=)JOc}jpTC7`^v!!i;J@X|
z9uXulSM~K_UBATln(^ghMx2~v52WNugrYi~EO79u7Zqi|)mIi$l%Gy##FAkKk&#ZK
zdr2{fs$~>&C&Hg1p-LFpZ_ZA#o&x*%(dwcubsQa~<N-cH6$h>8RVV}?4e}%}eYxu*
zSBob+a_Qg7PeL+<_F`#GOkl_yDRNHAsMtiK<vSGa!c+6?(}=XO7-m@O+xy+r&6NMA
z>Ptkyo_<gxsQ5uN6zgoYiQen!GIq_bL;hEna!Z&MB9tqLo=?kVw_XbT{T(3I?LXfy
zyEMoyB&w2RX>!ZU>5yb!-pku&^{$*FFrW+3nUL*M1}W|<y-GE^EahAU@)dhB&7@+N
zz)O+UqEEJgF{x1(=&{8ow*Lr+_ti5KD2Q2-(VIH<x6ww%T?jrtVigWzVy{=o0K!T9
z(xuW8%yhWLZSY*0ggl<}rYTm;M6NhU18uzj9(j<L?(I&=F^AXz$C3;bUb3BWb$Ft5
z1Y$5nK3ZF6f2-0Fhv^ZWsUXR208Uqxk0xdJm`dEds*!jZ!fHf@S{Ta)^FT|9lR-+&
znLNHuMs1^E(^TUtQ^wi~aaa#fU=4OdlI)(Dz)$NAgYKNQvT3-sizDz`*Y#dTb}$;E
zvNBsxM*AsJg+{&m3T!4yY-tT5!Uk%$^M8O|R_jFuH8otyhpg0z4j%1oeh9!_A;a4P
zXFk*3DUiUQTrw^s@h90{iA9Z;uQ?`ghg7=tU5q=JWPe67N4(pQ++m|hl=W_<O|zr<
zhht9X<sRKUvMBEF4vBnOe=QE1X&o*`1xgWe!@~kZ?r4L!?Qqi!P3vjO1LWWa7%-yV
zRc5$jo<N$Lx^QLEzU#L}f<JwIO}M<LBJYl)4RA2-bSTJ!6+`@%9QK5ftyKT;=T9Ov
z<jc{F(Nn+umMf|;DIP(<SwIn4Xtte~ZlFn^0&)b^(yA8I;0U<n$|o$==nJibxbQL>
z7m?K2N?t`Vux}&OIW&&6gT<ZMsGjU1)I6+^n3rc>vy<(=c!$OboDX>Z?s$IZwI^)A
zOm}ix2$)1NP+5+ujZ29p#TrWk(hnA?<+CG$l|@s%T8zX|5S^Nofwji~AP~;}rtFTM
zxF0pBo?9QHSmpNICVqLKOes2IxcUyZa%6{-#7&X3dok>_q;s60ArY~mS*u@3f@D;b
zwB#v4Yt6xK%38iuFs3^#h~rZB5@ccvpCWLg*vwX1M2*vt8KpiL)0NRA4k<jPW!FxP
zS@sS{hl*=ErCEd)fv^Dbm|%j(-j8i|I?Uxmbt1>@+vepP|4hR-EL{W3CD<(#!uY)}
zr=8p)Y!nT`GugmDvvdr;Pu57s?un-uHZqU384=AsYLYHu<3UvK?D3XdkOfqZtf?QI
z6WBb80SXx20#K%uH5#hY?y%*5_rktW-yC3y*XS+LGKExvnhnPS>BotjkpBQ7wMrN9
zLEPgiRM(<R(f+3-kzi~{%MT(24$P!|oKFIBi8#rQM_*RQUH0dDRcf6{Q3t;GGR^YF
z<NUU+XG=1)Bzf?P*H%Nb9#_EIgD!b`D*QP<pgM<-dZ+oAO#DZv^0}<Th?0@ZwT$_o
zrQd!jwK=2@66;WVHR`$@jH*x!rFf3<eVUNLY|`-dlfC+ce09t%hXKAQ6k^8mv2-E^
zMZ77W>JMPM-YFG?jtVdJr73#nxG`@*p3i2#kNx7FiA@*x-T2X*YtP|CW+Je$Wz$PG
zkU4BJ1K?V|3w*d(!^r};s*u=%=rd_Nj`;{x;(IwovZ-{|O~?dX24{;^2!-jr>HG~Z
zcobKu@~T^p_m|ey%x@*`hvL8J!9kc0{QnZB`OsGdWSYp<BZf&ToWU-^GXy+>vSeOp
zW%n9;wJT(Fn5oC>@B-z`6Ht!n!%m=HBzjSJ^7qtDZtPr`4UD6HC!)yd-ZRv9G+d{|
zGnFGI3%;;ZWIn^cUzRo&GZ-BiuDzh)$mq&+qOL&PdwK0X<lqoi`L2uLjYw@&GH=2e
z>2g-4lkJTt2KNKDsZ_}sER;5ix5O0_i^x!eZRP_L*IY!jJG$g6ol+x7E0$PD?^ouM
zB>Q+{Mb~YZ7Ja6_VPlUcm<yZIxNw|bNb8>^NIAeC>~x9bL1TGa%IdCS#5f{8qlnYv
zHTjwzsDG5ORjeNHr}<$Ii2(pgb!iGERndxHrq|UB2PT~u169m!dzaqDx!&=;xa^nU
z<LPf`Hjl)pAnWoD4@_!<1T?0GBe6V~LPQcTR-fCdB~_0sM9VAqO5~CNyYO&pdiv6~
zSkHn`)fq*I=4?E0_n(MoaEbBupIveqdPHlYHZ=d9|GXoq%oaXTE<v;g!$@}H22x=m
zcwp&g^}yjn=fawQZTx24Xe{JqN$jTCFZfOjt{&si!RxZO>1;VrD%hAR>bkmBF0&Rq
z!fFAafU)FBp?r=Y(Ko?o61%noY#mU$n*mV$H8@`ZpU4+|;P2~c1xaavEO=03eLY*z
z-jMau)2EN*h+^B^jG_@!qWM@cjvXQ#wf#Pb?>ZY&vhDaiWXX}xPmxeCY|#nqK!h>u
zfalOCW}PL7+UX<RycjfvryGCi5LdjVgXN|dNY<JcSVb`hZiihtx|o7ZY7++@M4i>X
zaBFODA5=NC4kpud-y>97dkfgO3xzGa^VJ#mi~RHut>ua9yQ~5^&yNgtKj!j^QJwg(
zCYFFZ47qc@Irl#-DBIpaTC0SUQY}MbHmjnAT)mOoQILJ0Gtx2C_(G}`y^1BPGKCrS
zdXqIyb=T|ZKE=j#Atg~FMty*2TXuF2{E~_=TT1R^oL;Az`tZ&F<p(5lHEPyaj1P?}
zwVIGohS8oONTFm396V1A8kT5?(4A^&0BTUvNPTSJnryR>1p+2^nEEC*RJ-PS;5l4*
z0z1EG5Q^-w@s5jx3AaR|y<FRl`=kdDg7^+k+!q4JPW%e<`SXGjaIk$sX9`NT^I*;L
zI&EsOyYXyga45_i2JJ~heh4R}TbTH1)R~xNjkC3-6h0)M`H={axZ2+dJmiZk?QrfB
zUe3v6gh67u`@P=`Yl5P`QB^WTm{ELX!4j<0$gmbW(g_kMYx<wJI9PM{AaLQ3d5&+f
zFg~y4{`gJ%!$+ZRp<G;1R+>!q%S%yL;UU{ySCaW0Vg<Aq;aJmUgJO3OQx*(eaAYjO
zBdx!y&d*<55=l|8ln^=|Xw$zKNQ*{)D~R$8@jjlFK$plHvstc7$DII1c4nB8rNSv<
z(xRwDeE9&x%^=S~O+V9{-~0WGL}lj<)3f%&Kzyppz~z=skgx4(&s-%V!$x?X%cymP
ze;aIvtW^^3syOw0;9l#+WXW|)Y80kx$$F^KCr!ZvT%e+#TRH)SJhsU>u$;fZi(CK`
zp9Jxz;Nj&)hvS?)H>D-fos|A~BQ3@@=j_s$;38gg4=;oZ8_&4qsWj&2F6o05nU;=B
zHNnHus0{bs;Y>?uy@^1u>W^uOjg&Nm)p2X<x~c#!__lu8vq_mrIm{gkniEkbp)dJ^
z(njZ05l~J68nkEAhW>vvU4vhx(bmqkU6XCwoNT)$+d6sjG?U$A*JPh;*JRtazBBjU
z?|1%#_pH74+Ru70<;ic0UKqsnqUrj#=K{{g(!?A(OZp9JDO+?2t{85o_a49p?xjbw
z4`o6l$|C2lPR4k?;i}B>gX6N|CIX%pyQ1}{Hb1lHpoSvwJgV#v8LCmOejR=0LI!W9
zSHGYoIXtGj|9j#ih&ot3fiOIi$nYNGQh_)V&34a$nWRy@vD=K^+ebuyg)nVq%WQ7Q
zA&Uh@y@&;7AsqQSe#r4n#6|#1w!ni%Z1J?FJKkoln63{z<PV`^ix_yrX?432DBnab
zlg&IrZvh9CXV8Z#qQP&2jg1}s%ZfVe;B{1hHQ|xF8T@un&`0>T^+p)EsFGpv+mT>v
zpv2<vfiW1<4>Dp-Em?SzshnKrfEq$Jw*&J1w9M^kxD(olMm_g1eAo4|Mc*Cq$*-^$
zpIGivM`Kf8p{Hk(;qNcs_TC8dd+_AUDv+;mhd^<3+xJA$;g*>3fo&*+Z3%tFRzh_J
zx`=0v9{5eowunRf*|kl5&Syck@bLllxcbEIu$oom^4|WYNJQ-DF`FMMHVzo`HqS9L
zo+s*=hos9+rKnlu9r?Ee+FjE!a?kE-B?PeeR0saEh<uLUi#e;C$Al-+L1h8D30Nr=
zgP_pqhUGQfcW9X#^$c1p$BCntr9*j&&>Y-lnV1)%=QKK~z2^{?pghJ?+3BrL^O@>2
zm~c?3mHeTy+mV22Z0fb&W=iONL)SsJFg?8XDFj7VW2}NmM9RIg%sARjdm1hjGZy0m
z?#@(_vs=+cE`x#8+ZsS65s7!Gww%)(u%nYQbF^>KT3pSEAD25<)9j1b!2^1b6;*oe
zcvthkf5#dC`tqbMTlA^TZ{}%KRO<*m@+p_U(tFTo4@5u+MM+Wzo8$nvQbw#Uh{X-k
ztT$5mT^04bFbr%&Y>a7LXv7G_@c3*%hAjd|Ar$M%E0WXa$c7%@l?bW?%2qw89i5&G
z4y<>(@SR6FMmcin_n)nL=@(NU5*xZshg+?Er(UX)C+rNE$gT@pWyya%Hh24>Nko2-
zRCKTABPAZiroFiD70;RF{Jm=^r}-|w*$>`|GgdrT6LH)>RV9<iAeNonb=<KxJ<#J_
z<L)DFqOApCZ$<2f<*CdCkr{8UeeJ2i{Dg7Z7AGyWin8Q-{Ap%4#!%bnLG#4ykl?hs
z0SLVn?m^wWkeC)<fh!t1t0f-v5R&QLX4cM&=Lq&uEi2;AinQ3C3fN6GO2iskD(nr<
zMp*wLweedjCaGWSD7k|;VSfnv+k=-&BTyHDA0G=Di429j5n=%+PTpk$4)8uQG{$Cm
z6KZP^Zu@ON?|z$eF?4aCs~}<~Y$G+8Ud!eU3u1>{b?bV_`u7wv#SEzbkEbPuI%zuu
z4`~+lN2dIgFWS2NeXBq^U!KY)1HaQiVS>B?xA#p@G+s+LJsm7V)IhBv!&Sl+LJX@q
zrx3XczyZE~?0Nw;&*g4Nk&Dx`H@keU3Vk4GL?AA?bw8k@l_6>aNU0b?B5u7-djYz8
zL+WGaQzl`Gn9V*=;*Cbp^Lfl9?UQsv!-qLnS)^HDpppD~LMv2V1GRf40x|94TuyYa
z*->@S&HpZ!&8g@0^Ov-BQ&CaT)AbPP+}g_U`+n<qKZCkV{1nBMrEr4J!Qm8?TKZwF
zL9?<g)%a;0$)!_Q%Cm4u`{p#r66<-{H?9U+?Oja)7wKmiQj@TL7s;Xl2gdC|AW})a
z+CWd^TvRLUQcIn5g*<De3C4U;DBp~=KrnZ9h*g$jKnS0RdDpB%6i+_6oU>}VK@M+&
z0#+LzJo{gUPKcIW+6ST`9AoVG>W!FpmQT#n>XWF6bAh}LDTT9d>o9(LjS=mde*VjL
zSSXAy5Rr`NR899Qzn2UMB8NUGR*aVQCs4lh>BoJPAGFFIP|Sg7E$#<x#r(KW)zi4e
z4c?>zp7u9!Af9}jS@68F*64-771LD=82@j`I{B&!#DZF9cq5RL=tN`wD7u&tB^Uqk
zocys2Z8O|n|1rEOAG2bJWG7Is=?wCYkQIiQ|Do^wQ6%PZv%YtqA11OB!N}`tFpsaf
z_Kqe!X1f_}-Td#4kiXgU>4*#va+c=XlTp}5gK-{o*-4aFJJE^cS`y>slEqeAUd6A}
z)y8UX86)_DBV5o+mc=kL)L!wKv)Q+lDh6srlH*YBTBqAEZ^LzoAeE-RfZW2DxVvVR
zZwYwoh0KFdQPj8YJz_tkvpMMxC$j~#`Ra>weg)1B%N1;c4dm=qvVHCa&Ym1zj0{(x
zTBP@=TeUvx0BLSz*TyYf1Kcv?!1n$BmR%Zr`JKLK(zTXwIAT>z^QxvDKVcK_$eC*W
zNa%-n6kbu9R4Q!hoP8u+R*h1M2q_V<9zUX<6F%pG78sO$6RvAiUeNeMAZ3M9TS>Qa
zmaWc40oKMU!wqA_6=6%J0M>PTIIe(%n9m)nlit{~It;?MVV<c#xfA33rGNK(pIwba
zYYECwrHI)j2jaC<g(F<UDd5~eulExq+*%cA3U4;lt~}v`+3dC%s`ePF3pa&@H#=Wg
zdRj+ux7`#`%+)q)k4}&n_`(|W5rZ|oAOpFSQ2LkMtRD^(L#5paaSH#=u0N2GN!uQ@
z-Td$1a|0?p(=q~KuGGl2C^ECM*VYW)KF>NMGqE&Rgx_fVy92y5P13#`R_;;KlGRp1
zRD(;xM`%A9dd20D|0%}qgQ%`<qqab{(?L(hhK8Z`m|W*T^1;J%#iM?3&v<RWP=CLh
z=Y)(d#1{-OTqrroQZG>w0&VOKmHj`Strr558t7_MzdBABd}q(;_xQ=OlvK_QvuEMQ
z=JX(Ov>d=${IwN!EVT+Gj4LX15q8SPn8F0kNW`L#5o=K+^H6F+ack7iTE)-OhwzkB
zQGKWBL2ZV=c%rgr?JX{JgYvB7Os>2W(X_EDv<6!V46Ea|`YY&p!z*W#JBO{R#>XG<
z1mSV@WP4T27jG~<d^XJ+PgG-#wNHZrTELPaFlJtzXK3nNf2?{x7g6b49r>>X914xX
z#2IBH_4KF^xl@`9g8O=@G10rsmR=Nk9d7p_3EQtRSOMp-N)rQ%+vTg|jZLk3D=qY2
z#<+*J>n!wFbpKpv#N6$E9JFSkSd0iCs69BHJk8dWal2)YtG?88HfNsR`zqvvS#Cu<
z!#RXMQ>+#?eHjr>E{xw)jKS%SbzF}$$L^zVRW1~#qvJq_K2btGfIB1b4ogps;z(|N
zFR4*yF99Rooh=jXi%6P0NT4hGaySU=<Ax#kgpe9%?n719hwxmvT!}AmG=y(@+xD?P
zS|j~<IIpX)!->}W6ge9m52;WOdh;50C^f?F?Fo^$ccE6<``%++)r(8I!sZSNM;9eN
zmd+^dj0vlab3}Zw`E6Vv%w*j+{wqwINv}cHQtv0K@^<qq^D5IJ<Nep5SO{z6qrGCZ
ztpUgkb+D+>oO486;rPdm&yqjkActX@(k~wdNr`)!&T6}2F#~Z=F43)2$dR~$FBmYW
zSs`B_OSa3xoy^}++qYaIl7+I+;p#~mVkmx4gnr>Qmt!6B@O8&%K`(VdN0Ygte%Gye
zP*|CbA~r1F;H(A+KhX5;;IVTrmUUs5<v!!Fvowlm;vfx=a0*z&YCKX)6gg*?BZR2^
zEpyv_p21Oq{)p{4{O9_pnXiTC7=B7ZfZ=wnkzdP-P?2o>ph?SEJ}9#B#6qpuh1)#o
zjYaxq$D~zb6p5<kA4bK}5h6p9UgPS8k)%4YT&0f-qP1XkXS)&~Omq?>9*BhDrV2(r
zZobm|^?&8MxphsFyZ~iv)4_t>BGbh78I&w?L32WnV|^pg!2?W!(KLFPLZ8WxeUsn@
zzddA$+|-BW|Ee;eYZ6C>#wm`*R!j-`2J=e^i)LsPOO%GR(E8DIB(L9KIJb1C@d>jQ
zDz=V_m2G#H4VTfamwgqA%5SZh(kZhFrt#FXk7rkG&+{U3;+)?^IkIVKxed9g>GZqk
zW1x=6jaR9DH>5ySGMw)3r8DqoNT5Q{I}f#D2N!gp90$LB9p|{zxVw_EQ^v({r(SPU
zhu?EB&84~gc9v4fA2ysQqUXA23YFW#6laeq`}lwVJIohn4jJ)7&b=|f&SoTuFBoV6
z=wykDtIW#t<JwYwwNf_82Q>~hc6UK4HtcV#%I8Kq2=p1Y0iAv%$JS?6|5r^kM{8)J
zCf6cqswFvNxDY5E^agZZbV<2vFxK`7FvCh*E{4;}6kq7+H(?5juq2|$<uCKzP@ay1
zHVUO(NaJHJ@L>40set%d(fD<+t=QISJ~1##$R`ZI&o4KEM>Eod-Czml@jd&cp{v+h
z4;+EUcm_vNC-+)?r&VFAZW?7~u5R+RCk&`sfwk~8om~V|g15pSZ(9m2?+?&vygtkk
z32D*664d6vWK0lm&iiYYAf(slWuLeEhq=z5y&9cXS1G-$hMPezj8@7Tbc$ULSUYx7
zJ3~W<XgN5EM8DtHV7?0KqUu{EssQK0FP}_{b_L^q!23^wS1-N6`XUr10yjvWLfO3E
z_XJdVf4Q6t>pumL<n6?P%*S1W9Ko^)ayuBF#VWEW-jD(DYW&4;=G8hOybrtN>2ySn
zCMAso9-r{N{Ldu30w|&`6<@JOEmpC+2Pe6^gX`^hbgV@}t_Ic4#;X7&WM=*ietq71
ziQ3MG9k5A-)x{C+9ALx}^mHj6@*&2)fcO&mD=QceNEjqQSR{s8t>MOmTFIC~=)V&_
zZh@v;6~VuopU!uyWxob`QbEY?AVK=|&Geups!sqb(WUidGMNAZj-Mj#=iFa?%0Au~
z7UYZcH1HzFjDA4~-erN3>VdyAG$_rY^QoxplO|m<uQP}DT4d4I0h?f|Nnv~rFtrFT
z0JLoC(qa=^mS1<Vc?^3T;&4xJ7nLJj#luHXzwV^fjVm9Z)=(sDOW74^%QDbUCzh;W
zqHUi#xol0N*%Dq`<X0T(FJz1^94lXD<B}Qb>+F}Ubvm9DL84)dwZNf1`oiI9({70b
zqrRD{A(gvhAq;I~f=Ki}8uM{3o~=io$pOPh!7!;9qyAH;Kmamf<&vf^nnnfn1P=B@
zoSm3+wv}ww__)}r472nLO*svIwd705`LAM_d0_Rn+_YT=grb@#nk+)VRr=1YW{EuH
z68=`$EKLN;PJN5*!sC(1mL8+-4IfdpEfzLA6lT$*3-rZPFg<C?UeMrAl%q+d{qiUK
zStVrvg~Kr=DWjs=QLX9HB0gwytW@Z}wz&=BN#um^OKP8ser)M)PaMU}DjC*RoY&N~
zzt@2BO!e(YkD{}^M8cgvz`YShx9=e1#p8W6uKU83nKeyP8_<&*0c}_|nH^wE-9It-
zw;LIy%!W7$N<^|JpDN1A<bpd>g8sfBW&8&6fxClZ4k1;N?3ThPSuIB`md>>nD2-8O
z6I_lYB`0et!V!&uwfUG>1->U`JRsIBj<?XhJo$dDHoZ-9AC9VtT%mKrj0r8upf-p7
zP?!%sRna#CS~`jra~m+xzP@C@53pFo#pJfXsx^Q#2y-Qgb2_pKo0w2Ua6&2@q~IO*
zdEjZe`rs&I*~?v<ZL-G1Zl$VPqY7XWcVT#p55Urmw0+*pZF;=f)jOx$9V&C!T}hs=
zoaGK1fs`E*_zv<x*KT_xiulkrirc23G3zZnP79nPPV-y*+#VSS8hB+88F)N(Q~BdZ
zYHOQ*wf4lWm_b2c3)|O<r(rC!%l4z^dI7B_RfUBSAES5@4$=I<^#^!SQcSVD{0W{l
zbvZjAOWr*<u#*rupNA9F+G8V|W;m!#Cc)eX>uuGjsB>+Er`~uoIc=D&rgV`a&uQ^e
zqFPhZtAB9!LwO*ZDE*b%&p`4HOi?nl8ba)=Xu5uaI9e)hK$8=dQ5kC0eXg6h3*j~i
z^2F2G7TeIAGnqIFTQ~eu%XJ%6OL5D7HhKnUcUXbuzlW{S9^YeEBb7rFAxaBTvP(7?
z*AAKc=GS@CVZDU=r7S7+rAnH_{-6)aGpX0InEdz1|8oJXt#?5ST0uE-8rvm>Z07EU
zTad(@hTE0VM*`m%A;Q9Oz7(C7&UD99SWBABRM>|8hn3pS`-On9$y=EIOu^x|HP6+)
zr@J}9r+^_%6-8fnx=dDVIG%isG!1ikCAD(q^yOgVQY4hGyFsef2!H|!sD%tDYi1cN
zM{CLD9NLAVW*lKJyg+3QCMfeY6mJT+XLGoh-_j-u+Sr2C@=t;ba8I@iy&eaC$l;@j
zx!st???Vw@n}(s?ET34Q9?ebiG-u4_H(AgUI4T&6$A>M{7AN_N5;|Q!1cyYz4!;=N
ziH<qA`JK?IgZTEM16P^Z7v{3_^9%PrR-T0yez_gNAA=vh7H9A({L->1DyuUs+mhl}
z_DWTQ9?Ond&TBuSquT@sD%b`dI0_v)BA||TlGk*^X_TOnuCpuupcRuZzNS8~9^Wot
z@tPwHn-}U(@_-_;)SNS_)6fun#Ii`8BXkiYqL@C$PLJkJ_543tHTUyTplwYVXd@9^
z$Ty1R=!k<gL$%MAm#64zWfkGXblD>rM9RwoeweH95AjFvpeN|4PPvlCFn|ZaIkOoV
zf~({hNB*(gH0=Yj)i#dx{*BMBt2czTFHtlcavVMvgd587!F@$U0rW)RPXI5AkgwT5
zELQwrlk{29`3U3}xNgBHV?%P;DWo0RbPlImqdggq$BT6krG>m_&c6*^mpLk~9>%>8
z!U;`+;1`%gyoR>684wW2>;GgT|3+BNWj28ht8<I!GIn_>(acQ2>UhS;X#7EHPlwWH
z%LkYUXY&@~8ePhLuxJp$B;?FwvMOxPmt+FLgKWt(Kfds$U5l}kv2wx->9$Ve#2Hse
z7vAVmo!`DzY~N}E_k|&HAH(#LD5w3z2Q1v$QOx^Z9G-3zBGtUQK3?ddXG#38q{h>4
z)6^j6B8r^4?Pl@=g6_`v@Iqk?V=8Jugixh7A;(rrW{_G+=4#1&YK!z!C%Dm$$8;*E
zkIu$|QeHqT0y>dJPJVJ{1PM1$8mMS*Qy5E?22HVMV%~ShBj-Vf-zh6S0)#smU#;X2
zr-ZBJkdHb|okR+pBvzu%#~+x=&)PV|l>-OIQ7aZsg1bQ4uq}?+epmKu<DZurfd!nL
z@Q#iunGA15dHeUU-;14jXqP6at!!hML=}Sif?UE<;apn7``RD2yn=Hl$h_S&C}$`)
z1GqCCnLKN4L=!gxD@G|2U@q?9%vu5OOEYR+@uLc_z<tj{<>Zo&6hl(eNPm;3P~x05
zlDzRN2JBg6-2|q(%cZA1q^p}}fq6-O#7T04!Z2*@b)7Asjgm|Kj$8e4R)^-3>-Odq
z<i4<<d$62-%9Yy%!ULZfCkdwER}S-_&}8C?dNm<m^V<%>{xq9)BG6`m;Rt^~yxfz-
z^k{$JD2qIEBe=@fx!DP=O@f?iB8cH2Kj~SNt_An|l&OKhq-tO9v}2$;Do^*@&l7b}
zz-3AHY%^Y3Bq!eYo=cEZ<a>_^m*9qZ?aIR!zg?8dkCn(rZHrweh0jpy9K+z(%OG&C
zjaIb9O=nyf)bx-GA?dO!u+EoQ$<2=fR*NNX1A%RrHTP5dHMdPj@3)bX>xAZwK2$<i
z)dovz`G%S-@tp|UuqHq+OChD3P3<vjp}qX9XS6dxVWyxn(qnJUU18o_OJI`wXllEw
zmh6cE=Kc4-QUp6ME)ewJ+}6Gm4z;4|51ptgOQt{UvcW?P?53^8;r2zycvAe};ean&
zEGh;R0~1t5DP84&U&eb4sMYuJO(=_Z+%mF<_srwfJZ>Uatv<jhB9&o9<g*`K`;ht_
zcumn|xzrMi?N23%{SJ!2`ip^i><TV;E+>>=bvNGk_<;DlY9NkO-j5C;lmv!oa$|^g
zq6OZRPTYK&4PZnU#dez@<bF1P!PyP>(povinjtK?^)RL6<|?4GRZ|{P{f8e!cn|B}
z8dSQjbzmr68KzB1)Fymf&>2P}!1HF){T9d3Eq^8XxfqwlsB*G@ykhRr2E3%a<cR`{
z7u4l<Z>3G$PgDz}<&wp@oIc&C1`XXHecg#e+7Fq4xSx{}iJws7Ij&GgP$nYzt`)O?
z$InZpP4h@dtR>520%B|SN<)VXOFCNDjLNkcwh;dUkNHrVYcL4wQMWQ{nzln9t8}{V
z^aXG4<UwN>11J-|3&O^o=xE)V5tLaHO(G<-Gg?vIcZJSl((BP|deYGDa!E=uw2PR!
zHNhj&ze38m)Obo}YvcWuETdmG!b?}2jt{Q)DS+`rd8LF)c7*_tWm;iXDlK)!0y7C8
zVJF8N*F```Tk=;j+d(=~BN&5B!JtcnP;-OLH<^+q8^RHJwXCamT<1@Edr{dK-w$0w
zhP=t80#lLY6wj2G61qIPD|K36WU@)9g1o`z5k9x{7anvKGl0l0p8{DiIh15#9s&2W
zK~SSD1t>@$UfcK`!@a@G8&m$Ie{c!uBm=@M?zEp<cXTjMS)*le3HhgJyx0g)D2m%Q
z|Le-pc?OjGnpPrs7CcB@-qOKVO0-%{+oWTsnqE)Z^JxgDpDRY&(SiNY>=46*e_mUp
z?$iQW1KZ6r!PTrp8~SK2DXM&{0!$glKWbH~uKbL^D=n;N962Qyyecs$wpydf-oz+O
zKWzy-TVlhG81*M07*8*AIj+p*%8Q{w3Vq93^Z%Od`KuQR8rpHq|5otsj1B4+&3eS+
z#xsG^t7F*PkP03zc=sz_$Ogib!O*q`N${o{me{6C*xUY98w$D89EyMEXn4YBa-4SR
zJK>bjEj5YnmF{@@yY-s$JL7%r!=(t3VH=WY?nWQmRe2pAmn%Dnh+1twd(rv$MezMD
z#{2!=>$<N^ajDJ?wO<!t*|(?<3AWphjg`nA73y6E{kt&LI*{;3*%i&WRMW48wrQ+s
ztfz2QQSY9F?4~=8Tck1$QKQ&nDxKuFw06hdiI(RS5poT02omM+KQhJmh}pe((Q<q-
zbWZO&qcdN3jLN;!G#0o=f0*AyCy#TMB;KfsTN}aMNd6xB>9BJ>I!&$7^C#zhsi{vZ
z%K5=c$FUpNXWfr{z6smYW4M1ZwuyG)2wwR>RA+Dkyo*`VMy!avrmod)8(Guzn1O-K
zrk7I+6}vut`8(dNRB}X9DCx<d^3f8OL*_S3R$3M){9^nR^2AI&H)@Dr(NVtMN?p5%
zxxeZ!>Hkii%<-JIan0Zv-)-&HNH@sj-%hml{?0h%H(57aJ}}VRzz;MZsK!GwY#Jx<
z7`?*8<UG;f2;R_Nq&K6@1$yD)-M4!s%pA>l;Q2n{#RqH0_Y7|@Zns^lU%wJM^>u#w
ziQou5bAqgSb9I^>i9Ihjsx&&V=*AQk2%OhD0@_&61Jpmq+odmyK{Y=uNGqy>&Ozya
zKQb=xlRWW@Qci$Xt1Iv8jRIlE1}4Hhb~s>dEd$FL12xF^nF9+mdl&%{FzUh7T2zGP
z*O3c$M4<3Opzr|Ipz155B10ylLNkfY7&?jPxu2SU0n5Uz^ep7sb}y>h&UiL;0+=<n
zG<ACYsP!U-no<lBw+O&*I?&2%fm{0F2lXM!hr?tL?^90-HbSmsblp}9?hPJxTv}88
z8-F;Rr2>CE{iT6Sbf|t?;0BbRMw7y%@A=dAuYZ$o=f3(@CHQ)!fTKi>aOX^kQ;>m>
z6_M4tFsj#PfC#lxR(!t1P`+1<>CuWM+RGhD90RODOofc%P(OV0wpVv{sNbdT_wa<y
z?>xqzc$wVZDtfL+jSI*SjFzWVzEgV=l8wE`q694P1LMcQ_$@_1jxOc;4NJZ-q$0Rt
zurVXF28lg|cG}NrD)@Z+6D$^}rt>_*TS-vYQ^-@SoAVK0#%G9(D#VK0&aj6@$37|i
z#$moBrAEI}9IQJ>zf}C1gLD8jt%^<P{I~CreGpTWCLU`w%k+$8DKdjg$)C@Y{*3sw
zpus^q>0e-tesg%Y18(IdKT^J5j?DXDC)_@fL@C}CRKai~F)()ZaCfA{NDElSY+#PZ
zM<eA1llDsI6%W>Kv55n9^i;k3$7xeI7DN%LiXjUXRsLjVLdfFEJ6&#vZS%YYy_8UZ
zPw<#7V^#H6XKpNJ1F)p#>urK(Yptm6RWxY7qz2&CJoQJQE)QV)8<;)K-r9C#N?%5Q
zTGQiOM`l9VLird#HH=u=mdEqlB?OBv8>ePK{QFI$K<pKa_Kc`B%KNkZnJGWfqZno;
zF5Llk2#^je)p68*@vHc0!p2N(ZmTvSFIsYA?00I~xKO&3gOC+PsU%-yRz&}>W|5I6
zQ#q9^I&BKzzfLQfXZ{A8m4X+Y?XhIX7t%+1K<+oJ(Zb<p?xiJgX8Ui6dJfnj(Kc1I
zGCm8mptG$SQvFsFx?lwB#I|*l3vArAHrt2I#bZH>uteZ!>4Yy#-{3=d9`UU2JQ4{o
za}~MDer(@-M_FxlQic}{e4%Z#R>%kHLbk~=M*n$#tvzV}+-dC=PB`Y-2xB&EH$QM_
z-W^Ca>M70=Bx0$NwG94Y9Zpp*ab?|K%ONX0Et4!Z`UNN{2Od^jPOU8^?!`Y%9gsmJ
zs%?w#4fJaOLty3gQ*%noU{V)Kf3|O7u6|<CtgYxCmA>pMsC`>NMTaAj_+k!R#vJ|l
zYMJgF)>Etem1<BY=jTd{r`Kq@_&}Wka6hh8iil}al6`SHmD^1kU=G1wZfqkkWG*kK
zSsCdW<bzJs9O<$XM|!pSvAcaa58b|MZ6b5Zpt4degitdq>bTg$`!u@9+j7nO_JCJ;
z!5i|$>WwdKCY0L5El+mfDz@hehg<L&nQZO5iFgN=6v)B~nmFinb@K`o#!&hTJ#X=5
z>T7Or`aiVD`;vnQ7B}MHM=TUhCiZ2OH)+t*?x*Q+Z4X}1I<Mf}aPIX7?4`-rgE(sr
zL8q`eeSC&LQ@TPakvo*pu}FvzL5o_IiB^%k$gMDx2gF8$g%WL{!oL%z5DY<2sqs^a
zyU>WU;}pLnzGnzJS5{7O^=Jl@?esyU?_AiCSK*1A{=u3I&iM<VU``TYT5k9kR$dHU
z&3rw$JCewLp>+jKeuv3`Scr)drN;%>ZX5yq>hBP|Ug)9P#{tyqO%llM(`k6Bbo`}&
z<r-&R2F&pDww>-ynyq2GQ<qY**a;+0`wFRH?YOEBilejz!sKmQym%pc=34P2^<<iL
z$^);YFF$z86gVoj{1UoNSpU62*|^%>9kj~DY8rI@9lDAb0;JIR`#}!VejN_HsJcls
zV!u)OTB~#0j=Sb=vr%Ns>5?GSHDPO*6s912!av<ZGv=^1>vnnsBt#KYXslK+cE=jl
z`o4bZJXLoJmzlyj8-GE!<}}u~Ni4D{%O9>BB&K`d6qadM>J(7u&)K|Rog)u(^rMxs
zBh41HnX$jETM0w}YK#W%H27+zCRSwm7tuI%1|WsvQtd)1t8EDRA*b<Mjo`Q7NFY5a
z`lFyothC4u=1^L|NbBX6DqP6DShz(xkXqk|%(Nq!mvUX8<=HvvnCc;;+1tr#E}=Bu
z7y#>;<#hwZ;j4!5?eDCAcpQ3?LkIKYsRa?{vnkgEpVfZV#s%IO+2%PE99T7d@pL6m
zB;>F{LLufa-1t>8XTnuKH$C?p^`Ch)wjbaqoufjL6qWc6l+~pwvo-tPpYBK>{p~l7
zX9+YYmk;Hl>s2Whj|~ZvMhOU_c6>(_F^Dp2W8jJo|N9gRmBdx;uw>T0R{Lji_Dx}v
zyZP7yR8F9RI#3FRgN)B?h(M-;NT>hdzxdsF5lwye%6HF)ZFHn76#GcP1c}737AwD(
zUWaKv57(X_kK)NzhX4Yr<WZpBL1JJ2>YxznN4Zu>zN3dP{GAz`FL(`8Fqy+!2Vg=i
z216OymM5vlYmsBvW|L50#iKW+DSc^~A2M>aLCmGy=*jVkQ6s1oyC`M%s;y!RQEKZ(
z(|jK`lhteqnLab@X_d>s9Nf<4XY*i9T;aRn7??Zqp;aYl5d)X&e={N%l5iL3+it1$
z?+$F`cL<bY#Tr>@w7Wj5pE5g{FFTqmK|Pqvj-gUWA)~P_7!{u}8MpQK;HC=x#RqR<
zPO6*AjV|Gq>2SPTxacAf5PKJ3VQ=`~repwzkk*q`=jgAO`CM3+!<|`pOf06z3F7=c
zT7y(g6pSg5a8IXO4Ux%)#JkgU*p&h(krXh-V71Gq$@2530{Bna_<6e@(yV6Jj>$j8
zB06*6Agb{~Cd1_MrKhxg`yz<g&T9YWS@j7o1%8s<w4wC>^(3x)j2?4o@z76dI4@O;
z*jMZz-WRc#N$iw|F7|pMr+2;{3o;DfRLm$D{;lzMRE#|0TkIr;YCopwFFKW<j&Y*I
z;KraYbd!U*9kF0LaJF2(AXn5qHG6^9xeP()Yzn?UvNrU?N1+o!8wQ*1>+ZynGjFZg
z00Pwjp^z`-V0<UR<K}13)7fnTI{jVQB$Srx?w?+ytywW#<OnIG3GUXJ{gom}o?FE!
zkBeWz#b*`&dJ?FJ5aqy4vyu0eVcoN6{4nP=7pSi$G7K8*MBrFD-|!)V>3Pq_-3%ik
z6p~$;O=vMQDNusIYITl}eIEev53Yak>W)rKA7_q3_`aFL(Xythh=S1G;I=|VVll(J
zSHt1g_0QgoeAow%qwj{@T||ERmL@Wp+#qlM&`YNPJQ~*r^O!1maE-wg#FvxnEmEVN
zPA_JaOVS%Rifn=&1LWi-ge81179Xx~U|9^qY=?$ay<u4?h)Vj)YaL|50AFr0aoJ=g
z;3HJW@f#Qp?ta6{sVYyvuu|&U>GBN&G7I0@LU!-roMphvuDeG)CKp)65ty*i>9_k=
z-)UeIB*xr3Jlx$9TiL-E0e4i(a58}qT|R(hI$itaU<IJvO;>pMtP?)?@HGT&K|p(u
zHFZ&dl&?=TMbWj1)dbtmB|>_gKv`p+W2-f`SM(>yAvCyopksv!S^O-|{_|*q(V-;2
zHJEq^r*Eqofec;71Sy-SA$w-njklszg2_0)BL^H?QDnPe<I-mo@w0hx-(o(Er-em+
zr6M8G*^h9QRYt5kyoepYoW7__)ch7QlnA*mI!L}1tbT(9^xeE3fA{vIeD|4yWgFC(
z%989Ui>8^RwDP^mf9qBcw<}W*d970<2!_;jf9RFF`@pMi{f2Ct4<$#9O`;~hrRJoG
zEosSQKCIJ`^yy_U8qs&^ESj$eIlK%uE*e!h>a8Hit`XzM8`CAtrUyY;cU&t&PcKcr
zx1<H<`XF^ygQoC2I_GUVG9Y=U;KbLkp+8V6`Z7*B)O9@MIJE{HPf~YhTnM>Aj^T^?
zWg5wzGLqnYB^=eRwd|;;=@mN48#2)7p8aU9(pwJ^rZlCu3k=iLlNhc<@S@}XwK$|I
zCaAlBc9`v;eY5lAUG$?B-1ZeKGp|gfvytK6ho<br^*}UFMx7{UM{ESd@~zt;bZ70p
zL%~=VbEm<>+z;*jLFzPYIpQMsDBms`*~L8;ITmw;Bc`~C=DpXsH~mguE)w6PFYnA8
znEM#IB0PZVnYciL(OTmb@}AJ-u=uEpT@5>Ks4q&Saez_QD=xiRCoRXz&2CaqkQNgt
z@00IqIy*FI+XPhPSr5}T@`29eb`baR@j=Kdx|~vlzt|fqrUM(|zgX1JfAPO>0^u+q
zB<8sQ0ES36bta2^>3iW6miY5+jmj^6t2`JJq@(>5RaKP?=ece<)c`Z|V>ilP0>W?c
z&;10%Vek|`ljq&G_R)7`gK_UOCZ6>L?xf`t(Fp=-zLV6lCGC+)EenWjMS^P=)T*P}
zw{{SZvh$k;oj%aouj6O7#fsmLefG>KMxxhhksXzZ(dxwgc%*IfAc%4pfK^<In{88o
zosI&NfWpE0dUv*bJMM_J-Y%uGbq1ad)<CVSorW~lu&E3d4C5`Zj2}!<7so>#)S<dx
zyw80KKMduJ?$4L4)bV=J{xp~S5tc6zY1SJCuhZh3fAd5K3Vh&(CX!iew>033m%Xz1
z>S6N!53>MOjw+qWL7n2&GW8+#E1oX(QzCJ7m6A_C0nBGZHAhI-RNAvlEU_QqAD)Y_
zO=HC73Yf2`2krxEO32m-d$X^8>+nzCI1YcG8;I|_H*$0{n2%6V1#6^Yh!W&Y4u8rI
zA@SR=?hcshLqD)QgKa(%MXQu_EiJSO#W&bQzE{=PR+%gNulle)baugL=GcZI#P^(5
zOS`Z}|0sbtXNL(L45MdAj9!(FDoUhimcyVXru#};d+dnY`j^q0wPq@l2Nm>Z<NA2M
zTpeaW9Kuh-_n|41xzRbO5jbd+sfCXYeBYXQh#(DxlPS>f<CYG&S?I}u(pLm$=2*fU
zSp_-d)Y>l4@2mQ~-!GbP0fW=n%wdfD&bchCt<5htI+0;{s$Beq@&2S`+?D^gcEXDQ
z{wgJ@ij%*C57|rG*$txx)b)OO&kw_o8Dfhl;eAnkT7KKtCY-K#)M50w-lWH^T-Ph0
z^f(5deQh2Pj>q6z8E_HEyJ^qZnVFI6{iPzRENDcxtUfEmpt1)M4I!G(6;i-wN$Y>(
zQF*yRs=s1sHnpF+Et<(tTeN@;ci)MziJJTU2K%&jQ4d)plt#bcO3&^`y(8|+W7l7x
z^@#RY&WvJL#hE1cBrm<)M~!j?4qdix)QQVcki#Qd3@(c!b^ZJtuQnF1pXlP=R{}hl
zzBm?CK+-{^_=(PFm$VOkJJ*W9_cl>c90lFf8uVL5dn4ssPY(|+f8pFe1MQ&ta#{CS
zG@UP19mR11d73XZIq1ui57$ZYrwPaZZ-Q(w!IFh_{Sz<?HSV80OS9byU)o`^mSA`S
z4t+NN5i!J=`ThQhDPX-{H;vD&OHG@f7+YFtv2gEfs3!~kcYkFu*L-P&5Rt=<hO;Rw
z+8;t-{48(%Vg>k7Y%Lv>d${{_Eo&D1Z5Or1#^P?PA6myH+n(oTr~@dr*;pDze&r2D
zpWotlo||?hp#ZUr$YTMgNbLFACW*wbeoRo+5&*rgTAOc(FzfcGJAYKQ_|z}B^-6lE
z>GaJwgOcT$@8}d63kLTVlR5tiYNUU!*s0tiSAAjZ1GkA%<ris@Z)~X|q}s}kYBZ0<
zFxuBlZe&nO89O760{u?Y8AXwx<eCy};sN*VwT=@^)a;bO;{20Z$^WkTTxoEQ&G&1e
zFy$GFl$L|z5@YGjuD<JM+{~><Z3Y#YdxmT(2ynnM@mnD9cyAVLCyheOXUG@B1P<!~
z8;$n*kTQXRm`c)j$e9`ju2Nf#zue+@o4#C|WXv2EZy=iQTQhIDi^aL;-o`bQs{m?W
zd=n@f_}+49@xm3$x-p{4j}+@`8{~b3I4x7D*7jHXc-JS1WN*ijp|rPEK04<L@wE9x
zuzR`VBD7%74fkj&vB1B|)jd-y&#_)V?PvvV-g}SGKv}8S5o2%F7>X%(i<V<~Kpz-)
zrcgNcvAfJ1p2pVd@^bn8z5=F=Y_AP?-+84BPPyg%nSvCx4tGMqcn26uqJ$VhRs)`9
zxAixZku@C}w?wu=#s9tZ4}U>yJL@1T3-=c_G+;?Y7{tMn>LH{K!L6NM4`P>^f5VKS
ziZGdmbLw>n5lUsq2jK56)y3s0fvqdE;D0KC8A53JA(6;G;5~%-7<U4Oum^&{oZn6z
zY7IVRbOey4uR&5e<I_(u-S)rEh7W`-zDN;|AhFCni0O0ya*}7;y3*)9uj$Dp1$lZ{
zzw4T|NM_kC>QVmIM3^5)GYVDv8p3Dx2M6p(k{5_L?6G{{cNUIoq_U{FA?D8_*FK*;
z^(vnb;7FGTo*k8Qkh!k0{!J5@w04IS^9SUn0|GMV(gc0jVUP*JK#t4i&o}#{M;d~*
z6Qas6Sb#xT88DJn3;SwywQn0K0Ul-l?ay6wq8o1IxB}stw-^3c6w>RlYaQzm4U^b|
zf6aiqPzDd6gqE+zQgXypHc(!mAexgw9am7(k-fIiADvquygq_JAv*%EoTRnipoODf
zht^y&P>Cx@LC|;~id&#4F_qceURrNs^0aCgjDI*svtK3V%Z{XQUaT*j+K5znKvxMl
zVu6B?QXS8J<;7w0R|Ris(+gSF>o?mkl@W(Fi$|N!M$Qq~#GT~qG7#}esNEA6xQW7~
z5eM>nZ41b~jJ%F;CK)*#U`+#<&mpd@4j_S2j{bCWZQLtKncYoIIDy@yAQ=kGKcjFY
z!a<@&%<HG!gx!J!VR09ix)tR?P67Mc$u|y#lO?Obr6uKfn+=&7yZ>MwSqcbn#_V?R
z^O4j5XDprj32FCBHUx##0PxK7?+8v92%^x}MbTVXzv&xDwCn`SqN^eY2xMw&#gggi
zH8s^BQvZxml-dz2l|6ZI!%!8wGl5so#ER0!gElE2A$s-`HT_@4&^10*L(YORw`~>?
zSJ?&fIV&jS+1v7J4UP96@IpHgH~Q<&AZa}%w;N_+c#sqv@r%E<A(FnGo>DqjNN}o_
z-Rxov<A3=+B`)g4%rc!2JMbv^(k{M1#Yy$k3uDvpM&Xj>zRi9E>uCV8tr(#8LiJ1d
zAk*Mv{3~;S$ng|WBZv!?4(htw5ugi2n`K|M-F}%J3kz!tB&oL5j+Y}FdABf5u`(Ho
zKX|w^KXLf)Tf$8dJn^P5VN6+ts;nG#P`L%$?LZK|roDHVd0P?aSf&1xU;Y5@B#Rk%
zXkCg9G*6kPS}2X+=SoqlC_h&R<7eqKtpaSq6ghf47dU&{Z6i{n-9ZeHm{c&uLN33m
zeEfaXS@$FIcX+)pNCo~s7hqe|3iYgu5z?=|jclonFz|>S!7sI@H*pP;)<v>zz>e4Q
zX${@|f(Pfhhg_ro_jd-FpR{JzdSSaBwiVl$2KGC%WA4$0S?70NaMnGK!wM{&VgJbY
z_g$t!n-T_hHT$YtxTr^aKeJC@aOAS@1Ptl6#@?=Kl>!gUS!K=zE;~Z~E?Q-L2;&HO
zP(VIQDr$l&J6!j>EeCbV0~VPp+KV>-EgCxL;qLJRa`FMTCxT9s0yr7GzIZTj@0%#g
zBM^e$rMDj$>9WBMiK1WS8j-i2)n~(ar$W_Yr_##3G}tNx<^Bin!Ifrti4C?A6V3-L
z6`I~Hd=+(1z|PboV%vEjc_p>1w@Ketwd)uRh2<4yIlD$oHB)%$*8;j<^|#Of2LX!d
ze3p;(0KE9_dK|xQhJlndIL{Zbk}8sqbM&|3TQHSl`Jlz}lid-68tJSq7~f(@zGcTF
z7q-89?-Z9LT_T0?m#F+wU$gn|3(M-d&)n1ss=qaXPS>QnjW^`2mB@PBxTi4OY(i0G
zW`vq~8aVDbmc^>UXdUf<d0;2#5nuX)?)~LnU9AJ8V>IiFK<4#4)3NnlrqRsT{zpRL
zgr1~;hJ%`YMloN&e^!da`wem8nW|-awRL(u9Xe*(Oe$?^isfmIomKrE!ssrr$UJP_
zG>py$>F+p@8U7#%K?`X7hZ4_%h!2L;6BG+3l+^$tdN6hx1*j<D8R<i``-`f2Leno2
zi!X<O5*`;DuPi)zC&!y;ZIXl6&-p3liwL=qh(fOp9nYpJBoh~EAsbrFo_x=>+|N1W
z!TI;$6Tg@L7RGK?2Cg2D-g>(zak#&5{d!D2>-9pHa8FK7&bAoJ?y5N}7&}l1HU>rE
zD0C=!q<fq5K(CCyFPD_TZn@w85gAI!9ghT?KKHCR!|_`8z>Pp9ttJtq)+%P&00}`e
z1#@Bx{&!)!iGkm+*3aP#aSF?0#;IAbJqbv8SXjsIa(iv~#}W%b67o36kf}gt?m|I`
zQ8d7T6Bl_vS(Zuh$!7IdGcWuFJEPsF*fM)zu}Z3)Mi2cd0z<4+?tIL;T?ZDflt;-D
zeS~TWxAv-Cc|J?pGig{Wz<}7!@`;RM0pbXkF?12}VJ90ytLmvlk(ax#12z%;@5-Pd
zBjY&)^`V=KI>-xm-1l2sFhrb?>cPaMS&gTpVsOg5q8mnDOUoY9?`AA-3xO;o(_B+y
zt~ZrWU~19Lp67bW>mg=0!T~QP7i+EZ<)F~mP>}AMb0rbAP;h+KBv96}ldhH?`15sy
zch>l1uP4>PP2hC=eC@BuKcGS(76NN*q*q;Gu-qK`dXmS^bvpl+jM492Jq&@tw2oMY
z)k5|!5faH)E*m4Ew~@SFCHeEU5l`4`3IZ^Lmo{{FUYK?kt3o()<8rgsmULb6;tpFT
zX!xQGCPpxMhlNsuZsKQ-k62_w*iw6pSI{gM$zHEAU(R&X?jdt=-<*FF>9CY;9A4Eh
zRS!OH+HQZGn&y8Vchax1gpp(MQ{)e)_rb9!@oL5<3lEQW`1Z~?)KO74PsV2DeQd^W
z0F1k$Y7zb-{5LZ>7;*iMe~B;4OnA6XXG?YeyeE<|Va_R@%s17A@{aRjHtcRx>X|yT
zSJ`3l^@j&uiXRd^{{w9qm|>x@(pcWyS^UaZggYBlY(e)L_rY?UQU#@gpK{y)G3I9`
zC#|46NFcXBrds{*sqSdj8^u_Y7csP=G9y{CFK|cx%oLhwKew<6#NyKxd$m-;g&xd-
zkNQ72ESYasy?QSm(wElhA&VT?>nard?9XPA`8Y^LDg9VHoyrG2%RLZ#uY7yGPwEz3
z4l70Q>9uq0gwUd<o0h@sAWjHowTmG;4m{q&Qy<TkF=OjTbC<qmP_S~==$<ZTMMDrw
zXGgP76y}J=q7vg)XM(4I(WcWkKc25fUUt2rC=1;uMMF)(-XCN-X}MfKQ8fj9e$3<D
z01*JYA2$@{KhNFKhPXpr<Su_HT)dhGC~YV#{$~Y2i;#9LA01FTE6ait7m1xmQL2CS
zbbB;&Yx|F|(b4e^(&NEQS}6br#?joJO+4Wv>uM*EwqiZt&DCn=%axpvn4OT^15HqL
z9!z5eoY>Fc&rfcIL{UydMW<1*4su0{7-DY{7>9{Pu%U_h&Gn^alDsbB9lBeQ2G03`
z%jUG=UV;%f_kOhts*yhu=yzz}a`?wvo>c`KkDN*?I5fuOC&rUn%5HgFx4HjLA>?N)
zE>Ptjum^qk-*5bQjN#)pyv?Y~nK-7+1L=%P=fqc@(27Ha{=#4VE{v}}9(M!<`r!Rr
zeF*`Pih6;=5NqCTL^6P!Ea6r77p4DUGDAP#|1-EbN2!TABaC6?v4Ig2Qy)Pqs0>ku
zw5|J%vN=yv3O?`YJM$;>?pCOS2k<yqc}CUVL|A^u9IQ0=Vb3!+4Bdq)a@VNAn1&{n
zt~Fhb1Wq1&$*YJgz+3v3Kr7n3tcp7I;u_ZJ@%_z@qKk+X<74u@ZhtX-X|9d<q3Ilu
zt!tRL=z!M5<clc7eJ+;RN$}N4>j=ClY^TL{T=8jdj%(D2Rq0WC1?2`x(RM5a>?o|H
z#<-j0pS`L&kIjpWKWN9m37WA)7b{s3@|pLsCi3J+nu>v#r{nkJ0l((<AUnJ+jrLW?
z&T!O=zxIGE`JF);(rpkB*aNck)!4BD|0byQl3+gCa$qhe@^^%&Na;W0eJUCB_xW*!
z6D;U?{GV-YrQj#D1JMHj{N{}q7tl6sx7g6xuVUL>JJ?od|J^o$-h*NHFFdcE0XG<b
zpH@7dQCzrK1YKDHf>sguZGEMT7#Vmb3wSD1v>8ht`&X>_t-O1%_$q^hPfz@~-<6;Y
zg=!v<5HjK1VdcwGKH(ofq~84Qu23N#SQSb5+(wkHH-xZ|<fHXRJ*)_M!t9{J>R@An
zj$f+>R8o0X_2i@<>+N336J>N=xwi8RpbaF!G}o%a?Jg$fl_$N5l*%9}sS>!!npKd^
zFVB*>GC|wVyAlzQ4QzfIt0@Eyv%&WSkq<m6DXG!w5Y#RoBF8bE%2WprmH)sl&d2IN
zq=S~6hnRub!V-E*txoiIMNi%L32BhcG0K>cK6J${nST!f_D27He6MYldQS-U4~2mW
z4uvzgEett*zH(z^O@?3s+?AQS_;h;vc(|Kvk1HoD`&QmG(~uLxgCGxmdS}W{vT`G%
z@H3Ld-t1*UfmN@8Chn@bMhC*MKm6N~MikC_??goOv_m)w*df)d206A*A=uwi7f53_
z)JS0^)wFZ-+{Dxj7U9OZ0G*udh7F3het;RQo0}U>((Z5CyJx7Ng~9UNRY)ulR=KM%
z<HZ-F)-q6(kB!ZFpa0R$*0?@e6O8cotxB&E0YtV$N+XHjv$dYgidr=CLtb89mLFZ5
zkHXv<amnD<Qhz<-|982h$bv&)oe;LB0i(&9D1jW_7(NMi9Kx)99xn5efI3VolfP@w
z&b|p`D#Lle1=<a>QWJH+1*M9$?D5gas6B=f>b&?690a%giFiB|(X%F;H{kaV(+cZG
za3dIGD_IN{pvh49vni3Dc0@1DhN$BdI_>xw;HOfR%It@${g`d!&P88s*$|fGXJQ=t
zsj7E~>R$WrTEE`mk>!w&0GZOclF?+7c!f|ii9)xD$Cv2NwG1x1E0D&%a0C6|QT#T$
zGbcSAR4M6YGZ2d-jLKB`9FX+Y3L@Z!jPOwV)<&uPbauA3Ter_wAmE!WK@X;Yh|iT0
zbpL>W6cbNG@Lz%{m17@m^PnwU%RKGXE<lM0Iu=z5a;+cJ0|5-<QZ;@+@-ZgYFoJnq
zW@}7S>B%44nXh6S<manVO#|LG*yIjzgclm0$7}%`eFp!Ot-3$GRa5}YAp#Xk)-N0(
z?Lr_H6@wVe^Z-}x_CVo&D6Zp&BF@TyDZrs`Ds%evZ2TztH~0G%K_FszH?m3nJu6W)
z-kO;2Tn@10a|K{3K|@~x=X)>xbGB6{EI2hT*JMrILE(LX@mOU@7XED{@_isHLHHqE
zT@<p7qhy)I6O}`BZ*dibMb`S>+a~|R0KP~>n5;C|ct7u_n%3!Pv;$;0X2w0NwuWBj
z8o3r04QPf~6TW!-=L_(XVm<L;&|dVBYSyxaQ8XefoiBS4X(ML=o^Mn84u!yLN~8yV
z*6aVKyRVoqs)4}Z5Um5zOU-BSWAe>3w-weRMi&lkYpXB`1@=|)&(4vo5lZSwzF4Ky
z&KHcM%dEFy>}|Y(of$?H6goI1HQ7Y|Y0{+~`G%-HM6$$b3R7E+msvHW!5y84OzSFH
z>;GKRVl~UD(qn*G#dUV_{o;sGtX&L3JI7T>bcAy8RHbGd6<N<9E9m(<E|?5c?B?Yn
z;9|!hzFxQ-#@$-6*LV`l3dBC4#$;V&i&tgE(`fR(E8Sn*D3tpp+TNio{46PVJx*_8
zN`1iAGAV_Jv^bF$clswc{igDliv^NfyV2sm)vO~HE4$(}AvXp^2b*}%c-JmC5}_x>
z&FupjRx}x&Eb!txURg)lY|Ix~TGLw^F@xDarL!X)0wt^+jYO0)BvzRpGNMCWNQpc3
zQg!uPyeB*t11~dfCQc$qtNLEjx|v!_sUFbc4*ER{c5sz*AE=tAUZ(9u1p0VH%iv3E
zGS|Re1?M55M>^+dy!#qaL0f=!_<2i)hJ^M21;RWP56ek7+wC6DhBxF`3X}RR+wFP`
zzgWOk?pJW+qd@jD_aS$9J#{Q}Rw_022q|3<z350)z~{!oGKMGM#T^?r0j6arfmB;`
z9BFnO7&}B}jt&@dxD}+OOETx;A~pPnSWg?!k<AMAorRw0+S2KMSZi{>pr!$EjbEUc
zAJN02cSaFY@+D}~Z=b;#b{DC7vgs9p%-AcG_zBfw?ABr2`EyXgS-+l5-T?!Kuq7op
z`l0tr$zD(kn>gF;F3k)yQJ@!^*&%kfm~OMum9@Kc;37KQL;%c^Gg#)Wt;RPjKT{#b
z4T_e4$=vJtU&@e)I-y^PRS6r%=YfNmrHG5P2DtG9(3^(yh?E_v{z<ml5smD(t1<k1
z0aqOVhEHor=Jj+`A#faAa4of*cz%dkTRXdC*<9n0$8|5#2xP+ILT}E&A{hq|_CX*$
z$VqrGiswpXDhaw~n(C8`eS`kXB^ABR1IPyN=_=aNp~pdN!?7MWbFlec`15AHn!1sM
zipbJ@PgCo`nCF6U2MypFJ+rF6XMRF?(lhC>3*kAO3kp-fRt7Pc+-vphlu9KEgc$ln
zx*Qq%3=;}te>`;77AX>*jed*!$xVzle1syCd%g5gQdHWML}7y3hY6O|1J}_-k;eI9
z<^S|C6j7aQL9IZZrVe06V0B89)AM4h2?OKVZq7oaAhKU?yEju(Abqt~19gO4xfbJ5
zM@8_WJGWHf-lSz_4=c@YFM+e&g@sTcFR!xy;T-K=PW!3~GeQ5y)I0ds`F+8{!HI3V
z4H`GLlQy>P#<uOGZ5lg`ZM#9^#<p#p;C=GF@9%T(e~_K$?6udLnKdIK0*Oi{n6dPW
z8RCovT+0s4=f>Vt<TgY9pCTw8s-8LeVq38=Nw__$<`^@qPaI0~d35Apb>GV8l`NW~
z0!hNKLABd1J_~b_b%TZN3;HviVG)F$GLFn4abH?9WcWP1ppE+=#wS?B6At)?BMb)k
z{1yFRX#2_@i;gfO>-nq&ZwdO7mU5IkQ@7AAHSe7p!q|=p|1fQtkBGKv4jy?9+{YW&
zs>U<be=opMGdv+C*nE-!PY%ISEFax&;J;=zWxRzl{w;cByH=6>?6IHeF27ZV=Vtz7
zDHIO85ii80FHra2;e=jhB$Si&*Jm07nAsq(Bzs@?T$4u%QicWYSAsF9Bn<&yJk4rD
zNWrHADzj(+OeUV^Z}fTLn*BeJhOQ4HOPCIH@mF%fGPS&N?j!U_6^>M4wPsZB`(%@g
z$zwptKC+3H*mqp1*yyU7&iP}CuA%HZZcGl-#{xc>9OtJ1T^(7N&v*as#*xg*nm8b^
zcjvYuZpo$JUg<i|c_DO`-9@y_rQX$J1q8O}mg_j{_noMN$!~aY*QgW+Im5UP+Q)|O
z#Ny%O!HJo~B;=IEBE${Ff!`4;N-UZ2wyod|@YY70fP%0Q-tgMM|K3+#RW3@T*L+zG
zL15>=_ze1<_tk%{;JnY4Z6oiKdUr}{%aC82`?>leV-kZFRG94Hd=(jxOcwb6LKeKW
z3Z<e|?}G=s0^;OxT^J^VJaeFCJMMQ&v#Eno7JjN?6+zhB?(*eVG%88?;0a%Nc`&OO
z)F1$g6;RC6pYDyuVa5iKo$m7sX9>jRjRj1k1#k(4QSwT$NM`;rQaIZD%M+!2j$osI
zL)dvTL)L%Fx2>p7l-T&l@h()!pH>?>WJ91493Kn}%7-`AC}nMz=uSR%%Uce>D3+h0
zh~k~0j6oF7_3`?~`Q^mwK^9>1soLj8*$DEYtTgss=DLz3fU>APciXyAhm+vi3jLFS
z9Y86-)$ys{zNE8YFD6at+UqAjPBxBjU(&{FOLCJ5`ZPm%#Y9Wd{ST(7`cKkiE({69
z!-TkS5&wlIO5B(62;-~t3Fgg5#noa8-4`{^R#$>|#W9q={l}Fx2jvE@S}zWgKP9$5
zuS2*Xu(8F}$hRu=y;`ASv<7dCM3^`Be>fwnC5ctPU25&zHzW2F*j6)_aSUr46slI&
z*MQHC4&mPhL!D&s1KUA1Ox>6eYhV|uN<tp>ZyNa#`Gg3Hm!;#$MOK#lz<a=QZC+CX
z9x-^$qr}pki98I>W`$wT;WPPhNRmbcGZaDFuhZtnnB{w?1z=h@zE3wmqOY@X390i8
zseo7gzZnGVF=bKCG?Ak6y6o~12tZXy7H4wS=gNlu>t(c{rK?3BfP<fnX~_fRr9)ld
zPh$F?ktL{Z4LM<h$P1U!*e}&bGalie0dDuPbi+x#cR%(M`T)y^;ln^4J==gmYtx7v
zEKnx($vADIG$-96mIcDcLz$)Z8ojT_C!?F%(I)A4y?)Ek)h+}9Q@|3%wa{De56&)8
zM=&S6+cDfR2OIiJB}j)$Jttw%6>?k{+28k3MK;wZI?X+J8qRf$<{F1hfu$<@9Ngo>
zFtxJjU^rK<byU4)O@7UCEmShS+g}8{3wUpY2Lu^ni0~%HUkgo|mTLe-34qc#URJj3
z5w7^Zy$mA+vt9$hgo`1KinN7!BJ!{X!}8Q}3#0P}{^2RVyjLc%3@~GLaU;Sf$S{YZ
z$LyMmb9^nBE-j<NhdQvXw!BonIrC<GeL2^KUhuU3r4rmnr~+&dj7zad1?)pIG!_q^
z9-%>^x{L4n0Id^$K<1q@;;6*NP3SL`&_UD(Vnrim(R6w8RyU&Bs&pj({lJCQMgcd|
z7qmOK7O32}bBzl(l92XvQc(|Ix;ss4wPDt14paklkDZ>~6zAg?Iw|<R!#;;sLt^eL
zm}@DD*(|&xn)Y~~uf|i~-9JM?nnb7dq+bY*%U#zXxrX{ZIkM+~59_A{(kWm<5D;nE
z*a+qd?AgYr07Y*2dt^-0iW8F8-AQD+eWzA`|H#;wnj2MZe26RtwK=SnsZ;IPYppzH
z&Dba?ostNQL}gp52jIWYpJ~abxThBj1NpvsRR!JD#&WtUEzJ`Uj@a^{8XqKl_1Fmf
z2qd*`RA(#Z$WM8<WI*6We}v6Oqh&CDs<LWs$6#q@nXQKLGjV*Pbnv#`xUFW)z3N!H
z4j5y~`2%gUt{S;y@4f-<QQ174A>wOu`*X+H)oZusGj@b11Abj_+utr;Y(@%fH@U!~
z<qgOqcNmN*x}2973A7ZTymc*(Ql~S}XFEq1Hp?6E)Z-x2dB`G8K>fD!>x%7~e=~Bb
zaAZ#es2FL3u9J1#@z~_~lpdei7%Gu25JN>hfQ+}E6I>t-Mk$bEe<C}6LJ*9M9Ajhd
z^^Q@<rk<KQ6hS%K?EC4Cn*4pAFdlZ5$x$W?0(nX`5DtoscfIQ4Hic+&qjL+NLc9uR
znQpr?uSt6s%IrnP3o)CCWl3-Yr%BavqCU+EcMriEHH2<n(rnzZYS?r*#gXUKJskg1
z9p8`Z-jD0qm+n4|F>!{t*oAoY$(ckt8RdyvLUX?CoBTWU_aGuOvo-HS8CIj-_sG@M
zOvT9-<|tBc0;7Ej8}~mOwUFvaiufSvnAAxBiU-xjnSRwHw(Vi01S)@YK}y&C>oxQ&
z%RQML6&K~YMVsdPHE*KJF$eC9Eu-4=$Bb-J@aQ{wllo8Q-p(8wUGk5zFctwyQ^6Sj
z?#<H;v)t!tAhrHeyta8$%4ah~SY-Twbh}oBs`jg>+J1UwW_uTg>j&Nal*8>bumkF6
zDd!HL>wYLu3MiE_Vf}48{Iwf&lo#{ZW4qO9>dP+b`r)=(_rYl31c@QgzU!~pd6vn=
z-myWMPqhR^seYfdu~cMwABGBfT*17(N9)w`>{)crq1@7_QvZ=Ot>S*eyipw*ymmmq
znBp?7XFj*3K**}SPpoUOe|XSbM>Sg+8i3}6OaaRTN0S&tVB|l6`)j@b<lvM}K*g;M
zi<AzYBdmrSuGPygN6J{-f6t8}KU{}XL#97B3wm5^V0UBZe0}|RJf)F57W@ug#2@Ea
zIFiyPpstOE8xj!^_?!MVhcLJM|Iv%oWH$i27_RW&><#_YCZVMCy;gwYCtEy~Z2aKn
zJm)fZ<Lf(tf{)E&#1%R}btqb0=yxlu$JisOoTots6R5{fsJuoL7^xC~*6ekoI-2%~
z&VNSr$vksH2d-*4f=lXaCVlGD2)woNpNjl?`Na{Q4^j+jl?V?fjt{nqoR0E^#Li(D
zPV;#yZrEUh2jsU?FBBi!Dse4v*1}>TPGe&SaVX$2Xd5rW{W@{(_+cNObD7Ga73(4l
z^8%)9vSXR0FN^70UXL@jV9)LJB~vi@{+&S_4gdH2pZ=?kgCw7t+a4`@`$D=>mv5f>
z3*KvP^6S&Vegu@MxG9Tn+S8Po0OYS!qsvM22H5|h7ylE8@L!LzHNQR`tHmv)vRMQv
z&DGV_{YtDVQK4c>-2OdLQ1aR;ud<<BD9oGl^Ay_w8s%0_I1aNT<iHTc!NP_pfOgc!
zNOepya6j9d1aQ9^)G%mK^}sSuhJOHvAAO#$+$4(R@xlt8ExeG-r>C-<u508QjvrO4
zH-yoLoacIuVuM8@ns(LlonA;21#d|?%~1yT=v$3sB&|<|o;jqK8YGHM+@B{+kT0sB
z61C$>*iB&O;C-^V=X`eix?fE&O125aO1PN^TyaT1@JBk6D_~FF0U0o~-X@Ldkh&^9
zSH`0TWOeWFvb8K)hijzLhD(f83a&!xi>Zz<o(vlnTUF7|Nd0eu*=Y71w@FvUW*6Jv
zsie04Ns;vr|Dsp36F18G?DvH4rK7TuEC~te5Igc48}(T@A0+?V>GC&gCPreVV3u$Y
zM);w&;gJ*v^&nL-pG!6F3tY_L^P|6%QZcHV%*QCPfI)<2V35cSAl{z%N1yab)A2_&
z>tuEI<pHKcYp(-r>NU<qGl5St>Bl51@wxM!Ii88$IbU`}J{QTaZJY~t=?3ovZPe1O
z#B22-_gxEIn+*;;t85fapdlb-^J^yU3s+zft@*&rFNBW;D*xiAi)cj1KK}J<;pD-|
zIsO$D(_Z$)7(j*;<7ZDvk`_KDE9O7`0`5+ib)LnHC>^<M!gP`9`DCt`W`|e9u#ybj
zS^|X_i|rD7`}5UEwI)O9%b>iPaLx@In?75&X-5lllS02of!x4ML80*VZwQf*)MwDn
zmv1@b#=rRX1%j0N?1LD)kSXjLSLUp6xKn=c2-zMIOSbctnw*Y<h_gT$`lZIlaxI1^
zaEMTX(wD_qjJ1#jJRDzaXoH>awijk9@fw?~<5#t`-YNXM#zSQPHb@8AR|8f5Gm(-u
zST_R@?!Xv*dGC*8b;GOQI>@8L?Tv^j1L%>ngcEF+pB!yI-<H+<y|%8V;KxGD{AO@f
z-{QPq+U#QfYP=_4!CQFd|N34}AM-0nAMpU`O3ro(k-;(w^Tz=f<C8YvG1l;$`OLJo
z^Y^F7|AS#Dou?7d#rH@oHQU+kd#Q}h@#6vGzY*6S^PUUL5Jv#XtxfTbarY7ju8W-z
zsH*ddr!mZG!(EMjmaZ=~L^NQPR6`yM<f=~3_K&3?<u@kVRCI|fR^fAvT^q)f>G6PA
z@lzrCTFHIyR3~!~pdsU8Lkh3sH9R&uHMAB&KU)_HSd#k)zZlm|6h%Jh3}v^DFq+*(
ze7*Nd-~v%n6;GvP5H8-4%PWsSBZtmZ`KiQh&*_!<3{cqT_VQkS`CXKHpYfJ|OqGG~
z-l$?(9d@Qc73Fp-KuSXmEhGztNjz?blL^Ob2epX=!x}x^97YB1?e1;@VcJoVX(EJ!
z8wvv~Y+5D221N>F!_U`g>}FHC1k?k3`X8G?DcVqqy;a;Sn@c*Z$8&I-t|XG(cwv3&
zWuj5V>;|euQ+=}*A>7}IYhnX*KfB_8^gvZ0W^%_~?r<a?rk6Ukpm=66=j12xHd0td
zwy}5R8Rm8A*&Au=UcM&8Ub|+unztWRw}4rppz@aJChM<He+?<hGAQg#Ww|Bb-iH?m
zK+($hvS-W^gh4MmIE(~wAT1;F3k%;q-DS=B@0v8@%^#oy<l@OIw0SBA2uDFgBh8PE
z9GZ{5KL2|iJiiY%=m&6$?5pBT_HUS39$N^zN;<l_<xdEPY<xq8Iv@V01+amy`?Z}S
zLJqFeyE7r<DZBwTV1-ADAVf0193bn|xAK-UqbL?ZC_;JcG0XgGy4Uo%D?!n>Z;&S1
zbD5#l;lUG2n?#zc{|%7|<s7C_K1~$dQB4X{$r9Dx&1sG7&6$|L$0k%;)r$KXm#LKT
zD|e>Kj35)eIS<LHHTKWip#EUZZClM4fjW;V^r$IDc~7xp(?%wm;AbWg%=91h;`nJ2
zq2zHCS;(_Lc>95W0yo7K`KG`Q(P4Yx?mAcU0D+~j`!`)FUtGLMsCT%c<O>;K9?2WT
z<lNzD0BJC)G(tW&A#hJ@*SraP18lzoaR=Q~1u|-10{g<zirlcw=}nwsTs8(czbTv+
z1FSj|0wR0T6y0n=0QoIOUp#|YZG-(ft1gEF6u`M~VB@IwZSz9L*TLpOY*bUL3LCN&
z=hu(JJO5DBqQ-AyTF(xk2Q}LYPr}+<Lwh@;Ze0j<_PA@rN*L{rFSzwrRhQXPyEUG}
zzTvD^*K9kewqNncm#+rfdfr~Nq*!yJwjHy;qNah8%V<A({=_zN6jxICOCsT%(Uq|W
z1L3km@s8B>%!k_RVKxna^uQ#X)C<B>%bp4?3J9pWp~8~QEM@Fq2LBWMs8>t<GD;rf
zc$u;qbm%D=gCFR)Jz&%m1oLo^A75>|%(+<buZE}6)8^WvgybfwP&m3MAcv%sCbk^2
zVN?3gmQll4t4AIaodBHq${kz`fj1kc`ML0<0knD4f;Oo6L=yie5N-@Qh!OsSOBRd?
zO~I?NaHxpUhiiZx&UxBji6<oNHbGz0AY*}TW^SkfzN58XM#<&u_&)!}tIG5O`|A+{
zTPrYtDvmMzc+-hQEL^_t*8qn!WImM5faeTW3Uv?d2vWc<cI*(1C86jb(->RYeP1r5
z-gT#-mm6aQ)YYvQFN9PWt#bYJtwp+4t)yCc0IN|c!>(rHmM<U>1)O3L@IMzAbotTI
ztpQk_13((%ihmVQlM4h?0t50tt7%wawi12Qpgc!mWd4Zjs2bjCEFMf-BkOx!Vl@*3
z=|JkVUo)c=l95GM$a7^%bp--uVL$|BmE?g5`J|*8x@Lt7Cn(z?r|511m+n5Rxp+`|
zyoMHo$k;DOpA%hAg2zt56z<)o#GX|UW<>EuMHQ%LL4@3^j^z`J@c<)$A0bCDfgmg=
zy=RFw^x$Kx;Lh~LHI4O;QZ!kdR6MCbBwD7q#;QvoAWvI`p>7sjDUg7K)GFdDn}+1N
z_B)}0kULWNxXE^p6)@;)Dp+4}?ZNK>?8T_+@_*h2BwbrT*&7Ha^NRpt8IP-MDQcN?
zSYSXW)%>#)2PR*R0Z08(e9Z{IgRdc=KY6g#ZFbMHqwTvC*f5_q-PCEnk*I`u{%W$G
zn&u#A3~_UnB{Nqj)oJ=Hk%Bj@GKU3$i1bOZt`j>KoZbIqw~B6+9oRv_X9Tv_Hc^n2
z^5DH4T(UOLHUC8h=NxYoEdUiH*~S+ZFVtW()O}1i3h9Z6{r4kBC5E_CIPWjcQ&kJ!
z%A@|WUm`Pyu@l*;Zy9CV2abTC6JWjtP;TLYjlwJ_)8WLe3cWU5U{GQxl+TQM7ew5h
zEP8B);;F`I!(wo}jbaLy;7N`v2YeX0=`=s21P}WW)A)i_T|ajc>j2YsES+#76)HNc
zrS;0%Op+&=7>SI6=IhZ<v1hZ(^~CzKx(NpO2l~zXP?2y1Sdcj_Rx;LwCu9*)HBEuL
zNVt(0-i<JiDtEbXjZ-3gzEvOUgT)%Ob<y}j)*>n#+p>vNIx@D~0hCTvkEZjj%S^?3
zAm%Z`Lxt-nCjA_A;Ln_3@mz7)#-_83f!=JT?PH{hu@V=-`Ap+$<j0wg;=DKdRbb@l
zv7N<5=x07q(Wqypd^upWxnV$>HNV*>?3zsaqj037+;3+!wt;|_o|pUecm<&s)&9}#
z!`f`00%x6pjaGtY$Ml!q%xWA(CQpY`QgI`%Ma$uXlYkN=7z%1!e99b(i(02HaaAkI
z=Ic%pR50tzj5_TlUWd^(tKs>Y3BI5WCaK?p*)KFVXCv7XWx5iooI0&QLx`LY<HyiG
zcV3{AfC&VUuW;`Af!L%}4(?k#%J^S4Rqme^6`z%sO0c4|n?#M&sjph^!_DsUBTSPG
zrSy4L=Cqr2UE1MIdV(}qE#_WaTw!3M`70a%;OnRiqe~c*cVHrM9iXL|w9`JP1~Vzh
z0aLTQ9MNhX-Q*S>c}}EZ<gt162Z&*xAK?4*L7<H(y5d@U4-SZuir3yN9-EjL><NZb
zS%qniOw(vwq#!x?D}N&9-L29fBa~WYbF8egVTzbRk%N^mZ%KZ{g7P&}YiY2u2H)Xc
z56$S$&^Owl_59v+4*?8pJVIseQtfM7BW?jD4`NoF){vSLn@0SMuW*P>aI`KGj^tfX
zHC3Vu?9Z^=OSgY2#|5g{sKg2omRD+^IZbc=+<9k7y7m}7AP%ef@EfqemX*P}kNToU
zlX~`~WKqb9cOaTm-UY_WA7t1KIe%*3$_*#&1!Qx}2l;0iq>5;6>VPurtbC}*eGc35
z5u1F-8u293G;WbGB|nKSKr)uF;J1hA37P*hYgAN}vYWRk0wk~#&%+r=Y=F3zeS>u|
z;CJXd`f>||6`3Hy=df*!5!CR@3V^yf)TFt*qN$yW226~o#Gs9fqm?re#PhnF)^~EO
zo4!AQ%gT)Y3LyvaE)CO#BM6~0fKK8FHEq={*mfezNImbk+a<!J=guLYIdd5HL3w0&
z8{xS>js6})b&#|fTBNTVY7F2k%r+uj@u7vEf1g)8=8vOX#^BcdH7q%CTH2H7Sa<Q*
z)hQZO=zqjYi7uDN$CG@md8M^m*Ya(e`gs%0Ur}mm;>h#E!vwMRJM+NZkzOb)lM}$A
zmjsf9T4`pq-Mju$g*W-pcfoI?8?s!h4i-qiY9F>@b=VMo29h!~NE-ore-+XOs6A65
zx)z}xlKr0b!@Wt>^#7z`!BBaEFBo35=q^rVj{`Ye<ssZ(lV@raC{bmzJmAbHyomh_
zV2EL)FfIl*Xe0W}6uJqJ^SkvRi})Z7Acow-H{l^TY0%-7t>6lN2pCp%SI&1z%D)|N
zSg+!E*DmEU)S<ZPeGjcT1ydDWI}m%``6g=J0Zu3q-CD7tQaJ5%RQT+Mh@5yyw89!1
zIII`PbmPZ6Y%iW1SHvUN!?hY!`c^E?ir3j(t!u}+?`*8IoRUCRp)gV|1msVKLlyH5
z7Dp%+wrlF2c#%Y42gerOhmBw~;lHbZ2^Wjsvj;%M-Fb$FhL&uOK`3=TX-%!k56HUC
z0n`g#0Mw`G5MFsG4vu=f{4rVyBgvzRG;Qf*6orL;1xBfN4CK@b?|B?+0RxnQYaSEP
z*8)@BdJOFHXniP-QqwO(?H*w__+;pagSty5{wVX-^JJG_%~M8yXKrddZ$?1-Z5m;@
z_KCdco@3$hiEF`LC~CD*+U9o7$hnvl7mQ)rKw=2NgZS}L&Ls;n^U)K>!F^uOJuo-n
zrs`1%IO(3d+)WIiV&s8=Zym~Lfj8kK3%ND_n_7=h{PVQ%w>i|^0`;+(nb`v%Z%Ukr
zgZxT>cV3uor`+hl!^5-CWS@<^SiFOuL6%$?H(Ok{Hi?an$c|tm?&V&JISd(;Q_Lg_
zRwiI*pu~|DE$UW*TBrl#OCq<SUXytsbOr&oywE&$hWTXGAbhtEmHfKFNg!PqC2W|I
zuvq#4jh$$t<b1+#PEyf>OZUwKLF{z@Swty5_r5cAf(18EsRurkfx@0?3_oT#Z%&ec
zWwlVb%1@e5M&$-gC>pmURo%K7)Gl}%G|xfLfnCg<4^Y59hv46tEht$DvMs6iNi81z
z3zs#b?l3mGxo@kpDH#+Wq$Y#e>NAWztpDNm6b2<aJgrVUpq5qn2nO(Vc2dtBjE{@U
zt*+L<4u|jbz0m5jOL}4V-yfgYA^_f;u7HtlvlK250~#ak+`1C$&rruuHT9?ZugWmq
z6YX%0s|N%_V{6bB=nDt(-CCdpVho#Hwh$P29>~2g*Oq(-Z_0}$>t8>`CzZmlGWr&r
z_Ej7JL$%4>RG@W3{ixw0{I#vqq3H~6`5?9UnKQx|OyR*bXow)b;X1qd)7_cX>*74|
zcU+xajM?tWkDPi(lTx-a|EK_ktZ$y<bYH8Ai@SmO`$lda8E9$r*xG5mq|>01DPeZ{
zhn(|2ywB-CMc3iqD<<J}p?yyqPuBNBz>SvhoEb*CQ@we3TjoRKrjPbMuj060<2q0G
zRy(SN!A*#xR2By*{U*qdlq|QTr1r|EM(<A%H;L@Q%)cD)GeI&wK~WVy968H6ZJROE
zN-Fre?)P;5^1R1Whdc;#xLMsr!!rs%Mx$&K?&Ft_r~bq1ot7uATwUHmh0DoU*H;;2
zT=6>LI`MKEDa9b;tv$u_MO+wjzh@j?_ml80{#)EA>0?&^O<Zg|sE;jcqVQ)j$t~UX
z?O#)TPkfB9cmCyzgJky3#cz|3S?<%;$?LAQXst8DV*h5=RJ!t({%E71?_ln1H-&N=
zy)bGyw|1~^U4aov+=ZABx+9fD>*}>>SH^?wm9z<iV7j=NhaT|3TjZEvlHdQ=yf5`9
zqP63;6wFuM#qk<f*>=Xev$x0jVl>EG4ioQq-_+Rj<a#=ZnUKR*&##saAJI(;|0lZW
zfnu$-mACGmq(jFc3-!LAh|i6|uIt6EPE5derj;3msEL`d)8~P5bFh_uOJFq_X`8ca
zS$58BdC+SGFEw4k5yJr?L{wF|yZF0MFUq{Uq|z%V_Rb9XI-a-^X+k;)$8v_LS?E|;
z4-Aa3y!=dg4CCJ9Nw3w6Pb1;A)Oy4TkYU@Z2iw?i9#N{YWGpA??larLTuZ$Ycf><q
zV|pg3ngkVXKA%ThMtc8t_EDE(6V*;>Uu%sL19VhsvRn<?v@gF0Wzz2%3mR&LWqUwp
zfo(YL{E_S)fH11<nn6-Ft%tUnF1q_BbAN?K($Mhi0MP2DMLAzY06e#PO-Ij$Om`=D
ziv4V<+Q#rAV3S3*JrLUm^dA@bWH0c5o)UX+BHKR9KV`jBF|90}nSlP)BlGc8fRKnN
zeQWHOS{nRGEQChalr4U&|NZNkl8exbZk?gA;~sS)Zs_-PEY9Wh9aHE<Enz_keI|_#
zSVd)chI<afz92@+X9qe#L3e&c6>lTwHq~;03XZvY1xcee)6ru`+$j4_yuig>TD^J_
z3HpG3&+eddLS6T50U)PYMS$5nmSUSHk2IE5s7n2ypV&&g{kE+Qw9!e|>R~jnE-xVg
zGY~@n{pz>Ux91v~>8*F!CnFqmc5$V4N=Xid3fYPLK<4dNUR|5}^OQ&loLB99ndP}h
zu;MhrD7m5M@=wBC;?%mT!~Cw_`P>NaTeYZ8c*P1%AVc3V@@a1JkB_+y@t_CSNMG(Q
zyX^rhWI}F4mBMEj&z5B+ReW*vLNfX!FF^ykldEgGqr8Er<St8^;aY2@1_wUQu10*M
zankS~J50s0U&YJ-%}PQ>RIR)K3tIv6C;w{=n=$S1j1@xD+BoGD@0iYwPqO}pB->d@
z*IT81DCXQ8mZ$bM*#tiermG_e3OP(FGL)N-k2?pYV!90drLbLgcX#EIPtQZUDDInP
z6GguF$pgo(rkX<$&)LPal&9s83T8&oP-Gp)0~sLSNnjX^cWTa6>O})dF@q1kcZvC*
ziaYkwtYdKO0VsW;-P2h`Y0m7tU%ZjI)9>C(MMOf}5DmnALI|%&0!cA$fdoA-*G#gX
z?T=&bs~`4bi^XSAq|SiE{bDnL9!4*VIR?`JUB(G|NUIqu-Pd*D?u5Z-$sJpoFDp)t
zM7g@g^>gXcZ$Q8V+j+tPDto>9G{;aZY?MWo$^*&32v6>RNsUbS?7M?g!M<EJsk;zB
ze$?G@TW;w*pqDzdcNUye*ToukM#fiu2YB3b*+D-_{j`Q`>Y^bcWO>?;KnLzQWr`~n
zhUFq?%K$bB_AS4w$eJ@A<xzPvy3f~B@nZ4n4yM<~<-@qAAlJGNTNpAy5E66yBw&es
z8Sfw9e0gFta+TrQk^}?(T<3`sCCneFw=NOIJJANZRVGLF;Wwdpx+4jtd3{E$t#i+*
z{}9w4eZ((R(Fu=u6;SXftS=9-7^<{mF>AEHrCsj1W9zf#ik?*H!fI@1Ql@Gn{a4sd
z8?T+qkbAD<L9i6pPFTwbUYAklpiIo~lJmDK4^eIkO=MX0y5{x*u3wsZ{Sp?n;`XHv
zbNCAiOUzpZgF)wtY_LOg+oO%ved|_u^83BsEnAWh1{s4ML>=COCrs}@_BiVovD7`<
z;G=!tEf3h{&_+l}4zKu`8(Rf*jbwfgxr=!Az&fP40r2I0w<2jqsY{j{ZKJzF$0as&
z;4i?qqU4%nDpEDy#}?o%#Kf>&QMwOmG>m#t+$s4iu%u;zFLv1t7ct4bjnH9IDX<^%
zhUh@JU{Ts}1jCW%F-_jbs+9SAN(P1V(AbhprC%9Q1*ggh%LRCXd|)UW?^`6BlrG5r
zPRSh{$%JgZ*eY{IkuJ7yjtX5A*!D-;89Vj?R(8s`zN(EsT?;#1_MXyUBBwgm*sd-l
zre=tnx6$COxmW6R`t2l*=Zp6b&abOh1|K0jdUR_`PWvYf%MN^{Y*|TszF){@hh`m^
z4>3A20<AG4pTYf4^HMUNH1_XLn(f<pgFyfSO9$mKmMMbVXwXF#xHSqAE;&~Vdg$@3
z($x3m)S{v8g&y!+4te42J38=TU>b(T5OP@XXvd&^v;vsPE^wfo>j;&S$b|b&Zim_q
z<5MynIi&$;-?PnB^&?F_e+%^0XD_3<3wp&jdDKsz-FuT~Bg{G>q<uI%b{m)-?sAkO
zlzTjp9Nc3owU09%c^)t%#AJ_7UsW$H-1@nvA9b80mc`HnLV$3@hLVVvvDU7Z!ssYs
zHz-V(aFQB3awtlNdaNAR+}c{q_h`X~AFVf2GXIJc$YfJkdNgkjR*eCuOb%BF%zp=i
z>p$)SRyG-m9~+rOlxZTKUXAY<m@I7j*67D2cS$7|aAY}8hJ1H6Bd@g0%Mb+XpO4|D
zM&y?Bwy4W;iH&$=m5_WKJ^{xt42qJ5Ak(Pad)OSQ9MCqPIug{09i{gR_0$9BGc;h8
zE@c4^J4yAY0=C-EPbRO$*?D&6JnGEl{nAefV<_ay8nGquvV&*?de&*X@sjC{G^~9!
z805sr6!;~}79tkeB`pbH38#Dq(zdYd^pTQ!DiNTXeNmhf5Elkv#z9DExVbf^KFHCN
z3g~3`zdkmfHZETP@r%<Zse|Fhg7;>?#$>$5rg=X}RU75Rp1YW~=t?WT`$(H7j!+u>
zBpgE%IsyfD?nj1@0mX%gRtM~6zuqbq%gKTit}e{bn@eqU9msSs|0<=4{E&(GhG=W_
zM;Dwu|F`|2lNqdIUbCF7nd$0EIk?1z;}{8o{f#pEGf~4k*m7;v*sY-A#ro!E+5kSk
zOPUpa$65^MmBQcu$nIQd8j2R9nIdv(CVf?6&Y1t!jq@V$xt&;kGH?3)kBnIEOPr>7
z&{;(8Tr6<NI8G>ab|nVZv(6A*)_%9^jO$R#{(R;U`l|M+^5R|H_M&V*LSSKxWsUKK
zP5Zk=crmw&*|E$1^WrnIR+vuR!sjy%F1zL9Lb_LG@{QE3jD8s6<DCn74H}1SbbEVl
z^Jwuv;ed6j4ImJ@kHA7dpd`K{)W!fM30G1n1&@=d_kg#&8h$9#ApAC3Y~jX>VlTu0
zqtj=vymsGDob|Tx6(yO~<$8Fd=bTUyLjE8Ff33(L<=WVQTmD~qhVs6LW9scnFzKB*
ziT!wRYvsS|ePX+T+U73Mqd*2gVGBO){IvJ6ICb~+KURH(rXd$`-#AfK28rjupyv$b
z7mVR(`Dkg40Lh#+mrCB-v0TOg%Ztxy45F4x3jyMda_j3|xQ<C27rjo9;`gzg?p7!p
z<^&4a(1b2MZS+ImD52KTUDQWCgP4d5a+ZB-Koh}6Oob2wac!tvD-LK*c=qCUd*;}9
zp&KL7Io0?%8j&ZVN;czhd1no>K2CG^iGah%@D8fxdLc>aQc*s81DD{D4^z~cF9IK1
zlksD_7sKCO*a1k>eY>8Bf7_Q=LTjI|55CYUE-%#YH2gas1M_J*VLNv{?=q*q;@7Uv
z2Ulq9-oLkBuWTv^80di}AptmF?mmkD6Nemh_8#+9Eo@Qer*E|()n9LR%&*a$lw!Q^
zKVI(=V(NN!;=dZAdf19)uJ#4rnID^zFeo?<x-B^CG@+yp`q`xQ`eQ)yg^uHQdl)mi
zV9Ufz9}&WGku>UrI6#Irto$4KBX%zo$L597<841CR%uU!h}f6XMH>-X-}nnkf=8)5
zQzsZ@Vyx$+ld76MpD(HDTl8?EYPs|w$UxfNXYLg0#OGPSCaVonB9*V><rGnrc61r=
zu>=yl776P#`|x)ug-yhoO9bF#;&6BER$Ei8PRMxpYt}b|D-3q;Gl4UA)+x)spE(91
z^j{XL{_;<?n7naBK13GO+@;{dxvc^2<BLZhbEY*QciE_22boN8rM&nBy#8ia?$KCI
zk8VpMyX{aR(Bz3j3Ilq$bre!(?GIyHeKoai(I5%c$M*yEuDQ`*i>Gti^zcASZe_JK
z8|I-dcCt7{LmFTtq+*Hdo8#-?&2Aot7j4#^i78IC(5Sn98EBm`Rdx9?cok<sAhWt;
zA=oqiY?a7REMnw_FN4&lsjeK3`nN-b%Z$G_W5{Cp<Ri&N*B#fz&+KQAf#0K<ihws*
zkHbuPCjkq1eRjU6<pQry9!Ac=)<`lL_=i(=kG{nL>E-@d$I!_K$E1AP?HT~%8O`9C
zF3;)M`61&lKwz;EMPJF{eA%4mw%Y1?W}CKEo_)Gq)Z)!yrn&=<UX9CR5syxvXak?Z
z^L;HU1YLA<pwRcY88PX4VKjWb44!3kc$w8@(&NErRx_hxdbEn37SZ@CLN$9GhECT~
z)Rgxto`EYtL@g?b(&7`gjm<hDy-rjAl)lCG&z@w%;}K`YR4rRhrt!a!xXi_adCbGC
zIp>dAG)PgrZHimyN?rhI<_G}kY3uQAV}Ai@$m|IfBtok%sK5qjr5WS9*TjF~_#xAs
z*yx9Go*@bn?Q;y+dMY;vT4e(cCo3+~aykCm<AdPaD*xDbj}sulp2aLBd3U9ju}UK@
ziKZ|oUwEIU@sKDqgGAqKg;@92D%?=u(&7nSiCxmNBKq`n!0CqNa!u6b)Q9QyD!EBX
zw|<%^Z0w$js}7RBws+xj7B_L_S!(o{7lMA8&sfZfzT9@1(Cpix=1L8XAekEvXUETY
zwNzJ4Q3Y%*C5DOX?XhGFlZ^zWHOk18@8hV@-m&J;50NBtr~8kUzuK_#&U%D2t*op@
zXP~%N{nl66`_Y(z1NV(+G(-mgL!%&ug9Kr?L)Yt*wa?8zsSVwBvgZvre0Ix()SveN
znG^)}|2J$An(qy*q1Y<sr~YN>GpDK6z$%!irv`3wsNGKMevOftlqTp7zI$(351E5C
z9x7LOVHurU`X6cxfdHvSd>4w0Ok+NaJDl`2VKqBVL@mti!bSgl3hO51=qW42i1JiT
zo*I$O--Do8TX`{cZJN=yOYxKE-{`xkd}Dk4k4P^A=f}bE?Q!3ebuG;AQx{<ywWvdN
z${l|GjCl0t#^qQ?d%%#iJ?Zml+XH=;9$|Z-aSlxIrM_=#l459e_=50dl0-S9R2Bq0
zL8vhSz8FhWK3`ka<A6E&y7#v`lJ+IQAce7-3~byj+YjCxPRGV;yEl(?D%uWtRXEg%
zb;&xPTkjt&axNr1+6p4@%Iu<tVB1qn=;Fr4?tx!)*+ssCR>0uF$qITrSq4$ZGq)Y4
zg*dg3!vD6=Iels%>jqvy(XE-GyWfgT#K71#_Vb9=(?3|LIH02|f&30Z=DsMHSxr5}
z9kXynMaB59KeM_U=2s!(uEH!?ey1Q$S%;A2rVz0)%~{s6rw#59|I-#%B3k}omYh?!
z&g>NfDCOW}?e4w3;b}{vd_RzjG{xs6%Kdj(nm}I+X>7Gh*Yfgm<T~@Q&&*Q*PnZgW
zCj{WK@8RBQzLy92NzA$$2a6Wf%*J7t%!b}%s6{RJb!IrElu(kBp3>uYaMq{}X5|<g
z!m~?+$Rs{=XD!#?7#Pb%MASL1aMkmj{<+O`X+%s&>BsgT3MhWh2pa|_e}J1&bvcck
zV0)t6w?NDFTch3?Uq#Jk4x07sPHQLkb9=FOm^de8y=&HHn#rkR@$bN+3?i4%x2epu
zh}}+bia45PBTF0b^e3<Gc#cz5Qw#L_u?iy^9`U1eQ3_}i!SK?H!1om2aKPG#{=OAO
zHn2Lec4k{);l{MaHo+gPW7h(+pWz%=v$g7bzbYqawd!TVQ>b)v={H6q+eA5`ACDKv
zskiBe9)ZAHMMi0kW5a$F*|O9M%g%n~4FMtyIIir3-bW*eANBl2J60jtQbkC#Z!5f-
zp8AmY_GPE&Uf4|9T{U9~@>pd`>Bk&Oofq0504_zyId={Wmy;)r-I_f1N}5h+Mb~Uo
zZ}=B=5G?C{+&cA=t<y`q-lb#(gxFAsCKdT-zlX02AqhuFS0gTS@ORxqRG`%>b-zvN
z(qH(YE6oLy18oHQg{ta*-!n|uS+u0(>7myh24@>vbxdpC##7+~g!NoGYvnLtsV?Fm
zVGEFp!sod4TaFTp`&<2F$qdDP|I-3g7RTV(H8NhBxpV@C&?|Z=RF&rKv+0w#@N-;`
zfd%cHX@4IKVFX_dA)oGu11++AkXn%DjLpVTZBjaL`LZ(u<Gtg>zZLlvTV}>_*eWZ|
zapJ)I&AjxS?^$>{2ro|WK*3oQNyLSeXt|{wUJqL97!Rz<!FMHIv$*yYYpt`q84SrR
zT8|ms7gC>OWlOhaI;owJ%jBK4nV@2AdRq?_QxXk2Q&dzX0ZK8Y13Ku=lpsH4X}aNI
zS;_KJ;s|xMKblo1Owh`}V-w~*T$=lS#W~hJ8W?)GDvBE(SG?==o9yWEZS_OJ3f-E`
z#(Bjx-@#L!QFKA%&vL!vmh|?{Tkw;La4|$2q(Yevcu`l4`TW*!R{OTyPbJepcb!Yi
z_rk!yR{_mg=r+&_`1Tau{|V0w%im00)O^wUc!j57qD7bRvkr?s`CQz}%YM5!rf$dT
z$f_efw3xi(S6ijgI6QY-0wwjqiF?rcFF+$tNS_IW|Gw#QV}JZ`fC?iqO92HO4(@9J
zvv?=G9>(r~mOz!t??oSE+m#N1krw0eTauAyevj3?lJfFDgJk~5l{q8;HVi0ROnhbq
zFaKbr2zYaH<0%YoQdC>}QGq{(d|^k|u|0}xGn_p4rQzn6aRtIoK+O{jDcope@)HB4
z<+clgZBX=u{E=E66Ma)R`o)&3kk(6$gK72Sw5Kz0brXb<Pwur!EtW`EzJ3hjXjEK9
zuxu8IdDiDf7mfUT$qbx<l@v2O)C>Xegcz*76Uep7AzlXgh35$``g#EOsoCY%@u*Kq
zYFz570QzunCoXyT-}g&F&^#Vkv#aC!XFj6T-5)LFeYz|PrZo3lCPnOie)e&YIQ<ie
z#R~ZLP~BMezuP{=ejG>wH$J)gPJl$~L;6vx(A*dM_>C;?tCsZ+R2CfV^k$!Uk%@17
zWgl;+H8VR1dU$q+UJvaP7ERETid-bkqzQ+Y>m|*!32Ol$zinSX=m_m<%#AwqQCNvo
zQ4_saXiYc74|*_70@Egtz`vmh)%kjxoDf5tM6}vXoNsmNRmm_aw9h<v^M2jG>#)r<
zTVZqay^nt&I7WRxQ^F*OJ5h#y4VY7+fOsT$0K+Z;3XDS^%6~>*JkEQD*L!1a0w&Is
z(^2wa>gb#_ntI>6+xeRwPvva%_$^ihEVO<6bj}XY=&ty!Gf9GO$K4}^u1AR}Q6yvF
z(;fOg#E=M*dXnu>J?}bU>pK(ext<2^e#@+({zza(A}{hy5)n6R4bDK<gX1~-SH7_b
zNmOkhF_~h*as<uWGb&T_!6y|16Iqs^AU1r6Jimv0j$*dF@iv;!Y$3xF*DwLkIy78n
zeVe=A)^W~0U7X2M-{9UMweH1|-|zr}TCWLJzvsxbHp1LxQ~tgsLpm<><^v>y*qUR&
za;5I}_?&(4)bMCw_SiEMOivd3&e=&bWTzLS<JesEETzXA&Sc_z(7DJ-f0BkIKt*`}
zS`i(B5dk$_<QoFnA+<3J&I)~7_0;rPbR9Zd!W#LpY@+5xbgh*%hp{Ly(UV8E9@;(H
zpvh4MIf4ke9>k0NbmXuvFtJsdEz2oZR;aa!u4n)aIvRa-cC};|t7@;R+39~8#hEyn
z4upmyJg2ea1rOdOr@xNvs}Bdh1LKNLpJ?9i+aNb&XU1uCisQY6%`_uamh&05@61%y
zKA;o(2kbc2<=q_?WpjeJTIj7RH0%1>?=o)tkp$L~$qL!Bmr=d_xlDDojvcDV7%!;>
z@R*NIV2B1dQvSLS%%R^=fhK%Y{$heE2?a>q^*oW>Uay@;$v80!irfc}5>;(vk0T0-
z8brT^R}LNVVvkgIk-2888@rlAC+$OPEyfOgviW1Cq0n=F<_+bSb|?x-egY@z2kd|h
z?fNq4IJu$mktHx40}D4sOpE-D6PN||EBn%k%^<zJo5Ur$_p?b+K+@NrAf?OIGuuWn
zYabot-whDiv%h|m0#rd?e^MI(E1rN{<}cTtwpQTalg+BSaC5x<xy5-uzdC>OW89v{
zPyJ;*JWq8#Z`N1s(c;05t-PAmt=<bNbgK*8+^|5Q*H_1wBM;c&Hx``iJ6@~;5{1E1
z&JxY+HIlMr_kmi@%*|szQuVhztr?#hT%1(C@5$2<8F}!CNujJh4<79Tr()!zFqqiR
z-}Uml%=za~5eA<p2kuxuSl>b8Evx{7U|0cgh_4xV;BNWf3UlNVCqk?EDNlpWe@`A8
zBpB0t2#-VPZr7%&Mb0oS-L5}%tk0T=%kB?NwvVyT%v71g+v|%Xu*Dkeo$~J(Mq}pe
zuwcSPJ8%J&^sHmW`%hD!KHrjP*<$BEChwjwM}jnV(s1#X9UKZ!U+hI+`nqH|YC{><
zR+=C%Ls;91@1;U3&Ez5_)gK2oeCw!bbmc4mavY+y3THIk$855nfvAejPEOxO8trsc
zU0#g);vLg{wKdxoJ@T}GsJYGB8~-JRp2m%2Wnqa_!28bTiqHrgJ#VuT2J9aMzZa7W
zWVPV;%SQYYl!hgHC*nC4#g}d_R;a@&MW1<$8a1CXaOG2Sy?y;SO6pO+f<nrV56EEu
zB+{t>1YT9{@87>mn35X8U1bKq3y*Hz)>Vw|?4en|#>T%pYnz8=pk&I#oMF1GjD#T6
z2mF&CJeBCJkqe>{HbF--aKtGrbm@5(-0x2IgH<oM6Mm$7LsKKsrV#4DGQZ=2<M7Xp
ztU#K}|4;|(`DnBQCR9|e#yX^X5gs!~cA1%M$HSAIbcN9i{3neMCT)g_eUXbk0YYkJ
zM^>#H(N^o52d57q-|wBU!zb$Z-zH-ygh3~^{PO}{E%>Be{yXm5k2oQFc?YeUL2J%V
zyH(!zkz*iA%3T@gSLD}J6a>uf`nPZQQ0bW#2KLTobyNNImMSS!?D?k=`Rv6E@|Qa0
zCLI-8A-Ev#Le#m37$s?sL>DkBS;cCLOZuZU)_cVWd|B#bm=jG+b3Szl%zb>rQ>SU_
z{gKsiVbq0GeOj=%P;E$*gbfkxL%}e5ZE}_&o$>D&ifZRz{nuSHd0xbns1(NEv2c?l
z<>h$}4i4&5z&Wi)&wX_^WZuu-X2C_|yO<<UFcWfBCEg!|$y)f6(_I@Foa+lS`w4=j
z=7z2BX*i&m!Fe46gZSQFQU15*Yk+-`z|%A3*LAph0idoR!0Ckjm&M}4m6SylaYhcC
zHZ%1@-U<%4xd@U(yTEp{y)G5=Wcz@py^h<~Y~2$@or3#LqjhKloo#jH>3uaX2SIA4
zm+@T${l5nz1oeq^C<8lut$yLkDvW6Zy%1+upuTtHb4Btp#pP7ZlTTRM-iqcw8J~W$
zyf6XB0rU?4@4spI$Y+GqXcGMX4N?|eAMDCL9AGw`&p2VALt<F6f^@%2%B;;B_;;k^
z*iYt&G@sOt#56^RBH^XAc&T%@Cakb)D1H{u_gHdj-&<RclH?j2J6`K6<Rar$Z`orz
z5t!A!u(1p?p~E)0ohsc!^8oDST)UG{Jgg6RhK~JUhxuH@&A^<+!0--e(5j244<D>n
z8sL4DLw+H-<>UmM^#nYxz`x%8fop!~EsHU?w%IBCSiXL38c3_r6=qCtOa;#|8Md!=
z?dS6nJ2cMBF-{Y-q7#ZY%3*J2cj9tB(M+bXNOndB3s$;G8TusRF6)v{D*9ed;%uQV
zx9I#Lni?DD%8Lu!qu+N<R`BdcQ&@q3z-3^0-`)_||2MD9EHLfQKuNU=B|2^l_cq|u
zn9#4IxL)=tH(7_ttk{I;<E9wgRHxcYA%&zwSxcbRbBBSN72ZZQ+~$24&<!h(TUAQ>
z5hhncqUd*YU(L^fg4CKF+I~!(e^#fa*^)!}u|?R9DWRzu*ImJnkn7E~wq(ApS^^z;
z@DE9aTdu>;Uz21Tlgt-Qc&~9%Z_gT3JKV&wB6yJ=#!L}n76o-DdQo;=t%rk7x<O}}
zXL<qv{R<QnD$tz-?PdR2=gP?N@aX@cKTQVX`WG#-Q7X%Qul~}o0uC#6c}dKEZT@M|
z!-!B}m+E9|!KXDyY%5Mu?4)d7o~`5QLh~OEii<7zk@_CK*>1S?eCN&aBdT_Ssb%T}
zb=I@1ekd|@bs|(RaP9w*c$PAKXp^|+BSdMSYPj30y|W{kpaX9TwsP1Gp?i2aCu5~*
zPIRjOcga~(;<EQo0Ev_<5;ecniLq12oPDE;YmM4+EINd!$H*v&PZLS6-68J$jcN%`
zs%PxOL0pi$BG&tiCkz5yUJW*|HQX#`qS_zu_^h3#%ZIib2{WSa0cL+ANyn~-XFtQF
z+yl^$x&MsUZo+9Ko~C_T;a&B4pY;j{qlMG`ip8vdZ)dq|E_Aw>(_?+2wx{^ioC@z-
zJr`;f=)kDhfit8PQ|=s|Q|zpP4K$Nli1($(5qX??3A5h#>Iz=Ox2fq$Kh&bzp}IBD
zC5%KkBn?~`^}Tj&w=*d@4~`;v=`SoJqP5_8{Lg<NNg0YQVk*c=TEz|`Xdj}gkABa8
zA^pQ<X3(rY_i#LT)B;+qS*r75dcSX99H7P!3ie1NnH}hhZ3sF~zUi5GIfu&`)S1UR
zs@(x%psgP=Od`Ns7xRu)00!Vl^KGFO;jTKYJ(B`9IxF>kWcRq5><GMUYgRb8G5+d^
zyp=))V5UiJjV9=a9TT55e{!eRdkLdumvWi2h_P>a)%C7Yqvx#nWrdwFr=5(n!{3DE
z0dgNlTuGjBoWutK5lMq^b8hILx(V{msz9_}1l63XjnPJx3fVwC-W%dW6NJ)4D86S3
zk83!7%;`@tUE5w&8j)lcy@IeP08|nl`A|(Wvhdp8O;=BQaiaL?>p(QCO!EI7+{`%`
zJ9K2T_*=e7RE+I6(s#a3ZEJm)+Sj@^-$n6>hkvJSHBz#QNS*7|Pf7$@Q5{%TAVEQD
zA2mXrcSfVN-b;$yuhE_-gaN#(;%uP+;&kiA3tPDHD%-iyOI`)-c%-2xMM7OQs%Pr4
zqnD&VTlV<MK)LoUCzqWSCRGouI<r9>nVt^?g!Vq|!9i7W`XUKG2CC=sxo~@e8+dQy
zJQ1Jc%j8E%p^{(!Rrx#w&5`9b{Tbj{hMAb$YjVURt!gojD>F}x4@dF*Z&+hLD<}26
zQHmiIAbek(1q^s1X|g<ePokyHaiyMtEt8**tXmO%DOow&7iBHo)~e1m{C;PKnA4ur
zH8tZ{uFS8@f@do@GOg}|Q*O4^ycH-(MGb>L?0hdCQ>kiPy{JF2m3<eeLJbY=j`{)7
znW7ZX*%3}Y^w;G^6T@z&(8GL+G#x9V;`_#{D_$&N;O+59Y|6GT(Gl8M!tq*)^^mK*
zi_3qY(0dgmhn!DqELzsy#AUu&aUNK`7MPvYZN>3muwNE~Ov%nht1QmscBBL-WaALh
z3J<_7n>UF`Z|MVadf9ctZzT>M<1rOm^%>R}6fPAdf`1J%3rY}P#vGsr>%g(}nnSdE
z6Sw%Rq4UHj90J>#PrIs#O)`>pMV${03mzvPUGQq2t`}yrd6OF9dF`1GgY{bY{2ssE
zt+$nXmwQ9x@_+B3y6Rej!C<m(V5f95vV$c&yhEY}Zlnj%PWuQ@M_#;w&w=eqf(;fg
z8Gh4T>&T8u3tY(eyTok@vP8+lIiFS#>VM}K0qepU&CB=YfagO6|6X97x!Uu3Z}m(n
z(6T?T!!WeSJJ$2TC`}+HVY8&6TdDq^w7F>_&5`Ipk=Up*ULo3C3Yj{!61)=;hP>PM
z;5l5QtyDj=U+CkiR}Oat<0s{1LpiV;t!*-@K@&v^*ICiR)i=Rmq^3ObB3vF%KT}+_
zZ3TZ%XcI|2j5b&Jh>+1B5dDEA#^~tZz7Pa1uOx9!j=dG*d8|d6Wr2FAC0{@KEgO0L
zZKz}*6=z@4aNYa7qxqs2DRzWAy{I4r(}l61=r-g17YVfeF%bRm`&%8rveQ7+pzr1X
z9n>TNg6SI)Oe7A|Wh@{{!;W*KWkrXlFy%Tf`23md6TiZO<AZB*@pghGK73dJ#5T68
zs#?snmNj;<EySl%MTcFrp`(mIwQqEq(-bhj=)P&LwNmYw-Sj16optX`ASwPbh$l9n
z+QS1?S2vS(y_~MIYz_)VYe6lB!4rzzX!f*tXGv796Ii73xUR%Ap~v)g#ZMm$1^ATb
ztk#%>V>Is=PB+>tPKCskeSgQ)9m>*@+`ddU)RWF%zZVbS9m9meCc?&fW|4O^M@v7;
zdN;&kvls_ee7TWZuCq{J!;7c4+8;{~M<L>5pEY_}(yp-xB|febjVBz(U$(rBn%csZ
zOq}Da+hlHHy%b-q48_!C5OMtT7)VT7P#pajXST2ak*Gm#y?~Eh<i-{KVOXc3*DI>E
zp6TJ!whcq46{eMW)xc*1M%<n78cVtamB|QeKOelp*R!wo{@8ti(QL-q31s)rPxC2{
zJyP(TihHN)Y4A~Xcm_Tg?}WBi<fz0afMdui8NAv=Nc|2ri5D<`eoaGWJRn18#r^-<
zyXvr}+V@WkVIU%dp~OZRprn9E*C;7@sZmNO0;6M;got#gq{JAAASECnFdWT9X&DU?
zQX(-)1Na_9U$5);=kM=#*ZK3Do%_C@=lPsFKF@Oxj`|xO&DGQQd9^}#%A_g?;z7XK
z3N~%DZ+_K@PM(?aTg*z653H|Spk=9<z!)^S=Mg#M(it9RRSZ0}M$%S?jHU`jlKr$t
zaE;ls=(xFL?KVcfMp?EcZFRWvgM7Y#zM9yOrXRo6TZxTh&8iSR&x#r^z&6+_bX`}V
zF2e-FKC?I@3VRbCN?9|flD$s}b8qe|-spJ0P6!X>pI{5&lY{~tZWH8N%7VXL{-7rR
zATa*TcKDs$x4a2wR~B|w$8~n9QNuttNpici3@|ee3WXl=v$~a`r<#FsnYXJEXCmN4
z#CN(7Rici^)P<tz1gV@w`trnVsb>w0v`or?8hk1-f8De9Vjl0i<=EdC9BdKvZ9Yxf
zyNKl946Po5*b91DY&J2_+cJJPn}-<myb*iSLwl{K^jRd`Ge&E1F2}2onHDO5z#@pQ
zsPpy?vKrzL_$*0te)S*yp(2T*Ck7Qo&L#rO;-_zI%QEPB!NRLKldP6oR{6{f=|1K<
z3YbF>WjD{{RMoZ=U;eau?{3W{usB;x9-)OjrP^YL*$mI@^~stc-;?|uZXG|~HVgPs
z?d!pZ0TuzP)q4OA^nW?HU-Pqq?Rp=qSgv>xatuKwppt3(wF?buGeiq`zBwIK6)ThZ
zu0G99r6W*2dz8|3AWstjJQ1~cjwpVEe5<kIGHhNR&9=VTOc%3+o`!xeQ6jz0{Xm0^
zK1WSF{LPGp<JD+|g@n;QStSCLWvlvKI}=BAX(?s?KGW#k%(!{h$s42Gl&CRuOSCbp
zBF~ng>$5yrqvP-yu>#%J`b<ZGPUp6kc8Ry<5Jj^^CCuwcz6jra8ug!c_Inp44^Mh7
z3MyjpJ?tzyTW+3v=>vN|8DuxeFaQJL!i8A33a|;Qxp57dUn9W4P#YPoN`YMOt4_iU
zdH!CkEELR8^x1y1-U)V+w5oZ-UU_c3pXtlGS7;&F!|1pV(Yqvd&S?_$8X-Z5HA0^9
z$IJkVFjsNt$9Ag=6Qh%y(NN8Z%iod!%e{O$&3AcN3DjCO<`-mAhiuj*&m&VQhmYW)
z^ui61y<+~>4%g3==&eTT6c!?hFQK&ccGHzPtsCPQN|EJUcKwB7rJMXB1tMVycmb7E
zxJq|=j3Tz5M#F{w=K?`YWZq}jFH{sV{&R$isGVv4#O<(A0pLb;_`K|HF)E$N4WpKN
zk}z*^^QKF9ne){D)l(nv(!|HfP<6I%@2%Cv;X-?%4{pAxFe>Ul?Z}3DY-tu*aLb=j
zQm28+R)`~J=0Sw*yF47}^ZPRE`L9=c@2R(Pb_3l(waydt&PCfhvBC5x`>~^~Jp%SL
zl4L~U$VSGG@>-MNB(#Pq5E>yr9vBMfxyA|O@@!}Bq|VJ{<Xa(d_xBbvq|$CpgmgVI
zYmg3v_ppBttgKCWohRY84+M4`9vGj)K;(jBb~Z~raL`xiWeX|oZfHxUYpwg7T4IgI
z{Ph^<*6@2(W{x0dhX|0R){47a*%9JKHdQEvs65-Kp#pc*P|rM|VtX*s;6NvTu)$<I
z`n{PUD5RN^dL|<EW;g-v#}UJF+vY=fS)KS0leehz8RfRUbS$2Z*QO1o9AvexCh%=t
zru+p;uS7$$Jsn+O?M&EtyOI{F8rX|Ccs@*F`d(zMYg1%-tq_^n$SOrOzOh*7Iz6jD
z?2F60p?;!eZ`nxF#;BQAZ_wR{dL0&bm0reNREr!%MFRQ&#R6yEGXR09oDhD`rgFd=
z*zuMxaOS$(6h}mkFz(A03-@-Yop95bSv?!d6wvVfXIHt>V+}<$nxZ*>*ppNmn6Fhi
zxlgg044z{5hYP_aPBqrAqO~&)7zE6#IkvflQa3srRJet(*s<A;R(eIE*{6M9*;n=3
zO<zxSA}4F;jh`2A7dr=h!c4IzOHR_3n8w`FO^e(Nw+yEmHA4PV3-dYnY7Jn7j@qF9
zy&<>l!fIxJ{~jdK3AbAQ3X0ZVyn3z-|GkJY(A(QvXGq&T+*k&FPfdoizuJE69>Jea
z$){wu9HVy>_aLUzE-I3LipDO$({g*ELB+-?Pm?Qm<$XDYz8|PANp5KWT#87Yts`V3
z)>7&8H@A1vpu#kRuGB^ENW_tfx0)-VMW<N#TtBd6Nc%Jc`N-QotMP&iI#gHJ+th)E
z=&?ZEJQx!MQ+-%WiikLf72Nh7VV#PSl=r7(x-b>#8Ihgf*~=acX1Xv9Btk^H<8E!g
zN94OdTn8G(>`ua?dac_ty6<LpSFf!aFP&9*jFst-K_>jlx$^W~p}Eng-?d>&g`uAV
zpC#QDxXlQ%k@-NB9Kz;tahAz$pIrOi8Ekv|a8tx(PqjAiD=bZZ{|<2I9xY!tAyldL
zM*0*Jw3C0NuSU=~Xcvb}c@k|p`2+jCu<<GMRlmOiUSa3Tgx_MI{Ygr#VMD8tcHT!`
z9*`%x+R6i(n%98x=A)#fFecq=%_URMe~81G?RHpw4<ZzPk^_gFhig8gN*MlPjcFat
zPFNnYxw~1FbR+cT^Q|h3!EeL!D2l3(Y*o84@OVEbdGia(Wsv66xr}Stgc+lkzVlp{
z&zQIENRTKq-VMzqvS!aVs~<#a1z)439N#~46Ys`hw+#=OU(PDusrpbZQO$HU|E`sv
zqxwB!DYb~R^bJeuOLd>q0d|!^)Q7Q}W}k!okB_`8AWz~G0^_w>Ixl8BAtr$cBGN!t
zs@;jDt7hy0MLZqM0>x1_nq!J<Np|Q4%bDwG(VSm0Qx;xf1!$5-j=d>G0L1HM@(MeH
z-U^2|(`2|iIY{n0f{l@u%BJ`h`5;1e-O^fSH7<boO@F)p<etku6sR!V{~G%eIVlgF
zFR1GHj$W<EwLO8C_T<_awZP_+(||<LU3|TeR4*R9=Y;09nZ0uy!OD>MXSG^m`>pNt
zvU}QVp2Xqd3@?)rQ}Vketz#atKATTN1*eakoxV<g#Idtun-NmoP{+e}5asYKm*xtK
zhzsIwjR;BhIw&?d9)G@eKqC6INz*?Y{q`p8O0`qwI;eY10}Nk!U^M&Nrd{%HBmthS
z3u3Y(KC3)mMLJqnN5!}?r)h#JZNDXEuPpHZMmV1pnV6{C(Wyz8lhGv1wB?=SNKFb$
z)cqQ6=}<V=cbRGm=;w21C#7;VF8I{twX_~tpbY7P5yUIfNu^>@+^|vt^YJIVh6c%9
z`MO~2S>H44GvwTb*2qviN3C<zE=j;ce3ojTQTUdVcuEE%dn1FjLU}dY_*zDE-DIz#
zyV;3%0|WY_@>CgP-Ux??9;9zSQZ~4gq5l#;_z>d-(Y-F+d{0+H8h(+}2cj!G#pK59
z&f!r#RG)pYRe+O&sJ;j^M){#2`4yQBF6~ZQP;ZDAF3{PF=g8#;F2N8oqM3Hzs3pRt
zU<z5n8twdUmOP5S|4O##M~Scy9hr*HLz-#hmBJndAIfu80t}y5shi@^e3~oaySUv}
zR!z;lMvI?KGejmm#Q_q5H_B$M)>660Y%yNp!1pAZ_zNnprkr2|xL&2#P~!LlAKBEe
z)AUq@z^4j($TrtOjT~eTdfsai6dM_H#|EA#OoJ5ym6Rwh5KVYrA3o*NMn!y$FV#;T
zV__fnLFlWw{><?X@Y1{9a+rgakq2Kq_;{!|0M?wM0H1mT_sNtbtc5WtDya*fMh8vw
z)037Qvp|#mL{7)JU#JZP1B?`ENv7T`o@~|wweJRfG1E3tG;H0u;Fm%38z_Oi>Ua#?
z7rsGx=e>x}pvYeR^PJk&-5becw8aOT0mzJ$`%i=dH#UMZLwhRxJk`3g9)%_1D^Y35
z$~~v*0NyMqQueR{%>=HuEmhx^JvK7Wh9HP<!ro1cBA$^}JYcO*I`QpO?}>tVZXRwf
z=C5IvPJ79Be4+QvxD@Crsk5U(T^#tdWau-*q^)c{0!pMMsA6zitzqj~p=k8d_PJhV
zb?&?E6F&G&7*jBCG?33Ge5P9aFo+$X;kfeVt^9teTP!2iZd{_RUTbm{;&14*)0)Zb
z^?1as#3+b4%;KMBR1g+@@sSi~_ReznY!5#lYB&3Zz4s;K8eMhwgl6B$VY1A-5jXjl
zYB?>P#vwS)Nnkrpyy$@Xnmgc#bD$<QK?tb>o;@-$>RC;MlHoC4&{AOBHi1lwopkY}
zjai(U%=$+7EuSbH@`Ukedfu~J8M8B1Z`ng9_30aSui}@8(C082E8A2dWO6^#=7)f}
zZu|ogS$=TASogz(%?1Qgf4Io#GC<Z~)nh=n7dby{aRn+KyQ{HDD!)J#KqyfP%$>L)
z3A52IYgNlHRm=BnH&<$%VG4sD`5NWqk>Op;^?a{OD_I@UR^zu0W2G!{IoLop4+Cji
z<Mql7AmY%7H(fedZA<Ku_u_EbU-M~<@$8j514JMTDS||A6Q*^_Sb*=tbq&h&Yb~F?
z-*#S+xKQ_F)~-c|r@N;>42;9XccR;i>)L{ImAF1h&I&oI+wy-7jZ@sdYN!{;!MP<*
zC)O)ZowIlo<oMdQ!`yXxaagZu$(mQ>Ybc%jYV~la=Yp@Ba9v7$#DvfQH9Qe3<A%QU
zs~882C0M&jtW&~4l6Rm4?6OOkJs(|fsZ!AZ7hA5IKf7pw<9efMNQoMzG+MczZpMWm
zf2()RZee^ME-iBnptVpF^qwDMIRNK7iXkkLEA!2E*69mxP1z!ZlCUyf0!E3ymqw(b
z7>IA$g0UcnXvYP+{RA|rL}BRu3vG|0OIL{78@U@zbv!*#pN|5CNtE0`@ri5DQ0@0n
zAgmg}ZRVeMa1_vyBMzKgZa>w(4?o~OEj%qAyk=#;_ND|hIrVL+=+9f5$WLR_VmKY;
zLL3cma{}b5RbIY3zl{xKV8lV<5o>*JUZ}@dPX|7s-@tWb7!AcxA#xcVo#Rx^Q3Om5
zu>7;MRQ{D2NQNo`MgWgEIKKMxx)7RLfK_0@7JWolJHCK>9$~ebbPW>!H5H=iJeShq
zzzvH($^n$>M<F0f3Uqq9z+V}J$idR7;j_P&+)+h81o(4E`G>*Ve^e(2Hb80g)rm8o
zIi5d9rUU`3s??CI{0o0&2myBB^Z;P<N2U;(b6kKCL0`lrO#jMY0cayc-~Lxj;2t2c
zXjM?y`B#Q%K%4(e^`EJZCij1{3c!W`7T^(L{lBql<B)u*`;*~el?R>-_-U%@B3>$6
Gh5iq<Q)CVR

literal 19759
zcmZ5|c|6qL_dl8#L^HA^+b~4-tl24RmLf~Cju;Xulf7b?B9ahBgM_js8QY*Rk}&q{
zOYg`;wn8MT-+k%*`Fy{>?;jo>+<VWx_uO-y=XuV3y<T_ETA6UL9bsc&VBjz_HMC)1
zV2T4jd~hc4p9cabBET<3oQ=szhVmZ41@H&V+rZL*f#GEm`z~fb_?z{rsUwbofwL9*
zVQjxr<jKHb@y5*1z&6x%Ia{wN$1J!|;7;Z@W+fY?KDcsKcr?54q=j3Z+C2_VU1D=f
zuKsnYQGNHA!_0oLS0@xXH;o%I^({P{3}Vi+1Zo{0G0t?1iEa@(0GIDN%#Xda$;`B$
zgCnGO*~XzM{Lipc<QY31kql$GA*U-txRTc&o|l~a+=%O7VM0VPz)%c~s<3J6L9QcA
zjBtGh@V{mWDh>6w1ui8Pr6{AsY>D6N2uIQG{o5%@j0sK_yV%DK*Vh-oOP<N`xy-eE
zDTjeN*?4yW1w;K~rf<uS+4O9`$OuEw8A7$$7~v|G{|rBO;^X793`y>}Bp#)Bxr)s{
zngJGn=!A}rj;^l!^noLNqKpK}sr*4NIM{EL?8By=sa4(3uM9SbcV`$dJ-u1#CmEPZ
zSmUH4|LlB-{G1(f>-YNO(g3N%%MZcaMVJL%Ft?Gu?RKo*?vtX*8@D#ekHdyqP9fl6
zCoCUlF>w7{38uWxz;Zv^ZKn@E(@#WJzt{R{!w#n9HSf2A>!alGpL-uCa0%F@_p*rG
zK>bN;ve>crjcq0{P-(f4UalTvx-t8f!+It^AC0C3Hp~8L`;*X;{Fs57^;qKyfdO_M
zSy6Ihby}yvBi-LW**CyqLCH?!xdCyfLirVF=7npAZ@eo@n>)DrY6~kfG5;-FE9BE^
zZ*MQ21)l}fl~onS2Sep1M8&-{eE}!SK9b0b+ui>3$vvc^yQ%ZTqOZ#HOW9z%^|u#9
zV5o{l`<fD2fsv6HAL@da-%d3g{G?zR=eKRXt=uqnFP8=c(wf7BfWYXe&>%;<bmq)I
zJa)Q*<uxz-<NU}Z%Qt>JYKza1aGd(HXZhg#M_~6-Gh}Zk&U7BD++FP^)qV<iDElbZ
z+>_iS7ct%(qp!vU$Em$<gfk(|8n_p94jf%q7m3`R|2F$MU&h9m>@`)Ex1f@D5cCoW
zewG0wI(Wa0ZB4t9;UdGHMkXuIu1j>y?QFdmZqFB_9pya?Ez=Jy)2}ED2}7MtiQ=d|
zwm6H?x@W6*BlIX$Thm>wjTW$J`rLez5K?Q!fC-qQZX9Gn{P2D5$NL&>$4g0T;@07{
z%Mn%-2n<a1{fRm&`rtk|j{9<|rx=)|;iITgv|ak!%s8<#k8={F&m1KBFG}30nGCY;
z=ReZV2+n>Vde8`d-J<!<L{_*xNynEW=9S(>W})55qFA&A1h>yhT^>Qw%j&}TVW<bG
z&GFI`abmqWE{8EWI_|<N*wj9;!sYN=eAG$u_XRE3g`<iGqIH%F6Qw+C!xo~(bfuie
z3cLft>U_QkP|G@wRPAR%#2LCDhDBVMQ_PFAo=e+@U9Y1oT7=V0H=jIGWr8cu?qfpu
zBsSMeJEf(?i3L*{1DpNk5C8EGCOZkpNbkfbma4EP0_VBGdN11jOew!H_e(0&=Q2u%
z{K7IcK!lMHCZcc}Z2u9fMXSG+lh!?{nb2lGX;B?AcChxn8i68ld4Lao-Llyz%>-#A
zc#z0pKcF0<)2I|IjOl@s91IwkF2QNcEjc%bz#4ZL$;I&-v`b|s&o6@IU1VZH6p@;3
z>bftzFh&{$3n`MuO?#cU&KDPahvOvf<Yj_m7i0{v%Q5C23u^XrwF<}H!7u}pV1CyK
z#+sgVmw<0>+#HM(Yv3eW-Y)RA@-UUYNdi6=2YjqVyn-tLH~#pNVe%^$T8-6!vV(?m
ziLVOPIgR2Y3qyV7!Ml{m&Ly^Pf~B=Hk}+q(v2Wddfp}l)`-6;d!=n|#u!x_PV{u}_
zEVO6X0c8_4$stPsU<cR$0vu%`eN-#V&P<e=xdv2rR0n5?enzbkqwyR`JbEhEfl0VT
zTfq9wPSjYGqz>-IKE-oQNV-LC7zYf6Fm+dkZ~FZrBaIpl5@Q?2#H-*cQb`I(eImaA
zB1(Th%$e$M)$o#gZ}{uz4I0mZN4}&uMTg6pM>z2T@E^r%rwx-I?8BbQ-k?q0d(9+d
zL}b_hoQ8;sLNjimMhDq4#NuJXiX^_|oU#6B?sZg@Vub!I5+D-`<JMKu;Bc8CH>);e
zb><bxf~ZgvZ{RvT2dqLw&$8kXb~R4jU~N=zoF{?SlpcP$e3a_^xZCGA?2%-J41Dw9
z+i=6=ufX1n2b9(IIL(6)7<r?dEdZ<QuuWk8!<Agt;+>4-F!Vwuf6HB<vb)VTasX9N
zp`6o3(D848H{L|+kdqR_un7#*Mx(gMSO!=ia#R2oQRA|RH1Ytp;E<Z5G151`r~}8j
zZ9c0-oHcJoPtvOtNJyi5ijY%xJfofpNzQRxzFJa`f#Zhg`QH#e1buG1>3dQh8C@Z(
zx(H0V<?7WN1>T(ArW|Nsa;JdVNLe&1z&ES<ft)hM$611gM5A}D5mw>!t9RZ<DJnCA
zXl4Z41qYz@50~{DHgZv5*(j>O+g^ou;S!q+-CovA4`2iSe2J`!y4`aV?z<7qeqpIO
z6zY@0`VKhRcfIcfyy`Sc9H{B8xnVLlupJ5DxIquozwl9=<F!|B>o>uefIGEN47tsK
z?OgB(Cb!;f+z~=-?D~U6qQN5HokrD5YZ>pgw<PCiEFSj#<pswr@;-}1^ckWQf%!NH
zqT|JZA}z&q$j_|pZ#p69Uo1^oP-ofkU%?UQXoArp&3=yz!|4~8F+9tL#8SmWi3I)c
zFq@*v2*c#-EVS0CrSlFICF*KIaCDSn?6=uVaQ$Yy{zG6vTXiPfX5r0#M~uU<v3Px?
zB#70Aj<NxVo`&TSCbC}NbTCXV0DJQ<@ZJ;_)jk1Yqp~=P0Z)K&6<1b`>g1Vz*@ulu
z+Muz<T6^1}Y1#Z)D<@HC{CR_lLd$6$Yw=b_@+HxQOl8jUbhq1zwSF!?neovuF<?HM
z9zga1ARD-}{E6uc;i}Zh6x9WGSQWywq%#5??|H&qZPKi_%xl+fnv*~Y+&6FoE`>&@
z1Fd`xHsbEUHTzANg=4*DUv|<_G`mNM#;5cp@$<l6rzQog#U~iouc|u@Z)kEDmX-k5
zaKIcr!ir~ud!F@5iW3{-BqrVlIMiZl_rZ|h`0B0?3g(M?AO>vagD}#lQb=)PI3<U2
zhq1Ii@!#XNH9#2w6l>QJi}%!ZSMvv8z!PJSLnE=>!%zGXMN#^~cDx8MSV=_jU<la^
z2p=692f|CeeE1;YQb73Pt-baMEU=|JEv2<Uxa&lp5?o61fjqGLS<t*DqDV?l&2ilB
zvzyi?I8yLF!mx*2?}|G?TfCs6z-8bK3q{Wh9RGz+U@0z$r7_o^M%>2&o3$sqj{;LU
z?sN{A%A+zPC(&HI{s1r)&Ttd%V*p_5^~13o7pn)<P_(oo_pzsP58!Dff?U=G?-|L*
z4=iMM9q2nc9j~a4G1g?nZ@`pbEjhtdtvu6~eb_<v0p&uGl<wDzn1JD`>j#*Ste)^%
z4S#=A!{kcH(EJSe`VqE6`#_vzkr_0B!;n&WodYuu;>5fF%mfT5vv4%r7cnMksp-1J
zM(x9E12f@Zy(eX}88vo2c7w(_n;@nPLtyXh2W-U@<pk8teo`!+ThF~_N>oRg+!ez>
zU1Cf$LG|s&N0$g5wl-{qPMNepbFm<XW*ZV`UltsNs~Do35KE3&Jkm%-P?2;iIfwE@
zBl(349H%?n$jVfWc*h@r>lD|{i@UQAJE1V3JfgJpz3LEV_#*oSCPp4uXGvhFAyS8h
z_BIP3!tt_FU)aClgzL~dL0H5%>1&)=I46YZAR1{0l1hXz0i9XbnVCdkO0g4JYO1IA
zhS$UZOyW-$(oIkd@wr}q0MF0VX6HE04M<waKJ30n8#D`w3xH&oI;jJAW>#+2Xq~yk
zps@yM+7e*y34fblR*aQdM!jfmj(+h~(m6$Iv3MV?Jsy$c_{*<vK%d~4AmPITTRYU3
z-}zE3UP{|t4J)C8`~A^nRRBp3_c!ShMHuGV0{bv-kC)2(8a1|&u|YG4sV2uF|Hc9k
zA)|rM@W%028-8XaFDNWzW`?bRLkO{dNYF>aY>NZm#EJPHBzD&whc+DG$@_GPnVOX%
zA9PAz1YZe`P+QEH+Zq65xMeu@CfVRp0s{N=&J#z3sX?wEIKrfvzs;Heez{N8cW5H%
zN4rlKq7+Z*lcdcLp^drwZ#4TQ8iZr9&j7t1yUpc=I;(@90g_>}VCb#CMvePEc<dSr
zg8n9|SeS_o?gK2Z4WXVFw+7U8b3j>!$ibt+h$(M2RY8J-xLy*t5hvDpkobJRS+AfH
zQ7eoWv+}0zI@yHjbhLYKUXp-yLHs^!D}IBfW7U>@)0h~-lz##yEt)GiN#{Nf#@Y$~
z>&6`_(t{QR%7Kt+Hhck0r8F>puhA(1#IA*ZuH*(1D2(WV{qRO3eLKWbvA>NWckx`*
zSRYD9SveTcZyFr0e-37Qdm<~v5@}tK2hN_bL9?`^z_Ja9hxDJGhI5PMI;Smre49-Y
zaa2wG5u2KNO0K2I3o`86ShM{vjEFLdT$Y3=c1C}o6n`sj>w<ECySF!J@~7%2l;F79
zXN9wt$g_umU8`FgCf9QkIe38uss8c^VaD9IeE1XfAX}fOBugsKG>C<Uz5XCaV@I}l
z;Wiv+Ih^+#LF76MDCV%mU9ouE>oH*jAlTxw1jOF<G4UMg1Mb46;$oP51URt>;0oH`
zxYUI(RtJb*L?7JKmn+Fq$ums^Vhw@VF<Q}U4+16p&;Xv3)rT|sRn^$7t(BNK^?YMH
zv$;U)lKSiM1>P%H*XpnHV}hR;@`KbdR|Ba0+(4YzcVS57r8_rI_IvtN9fRZY?>u!%
z<SH^xYlCB(bimHSfgOGo*TLlvs#H0_aZ(03u^`LnjB!7sQE*?%W|fibWfV^L8!XJ@
z6Q%L+Cp-(b)Q_y|E)GjE<}Th~UXSBi$ZW_NV$U`q^7BBLomi5knP<AZhhAW7imb|N
z$iJ+%IU(vdYLq;6TFAO!b03yHaf9YMm^T-Tpr=1K|8N9#7DR(%pAR67jzEFRw0E*u
zJ8@z^K|}tGZ;ZYLQ(8&joj5Un06;HKhSQ0-XLsun^rJLW$qV9V%@Iq-A_mtAkVfMt
z{(3W|&1`8*k}!5iFv$RQ41WPI6VXq1r3Pq>WJc3)dI7n(z7t9RVqqLJA$j(Nbb|ky
zA@?PE)Yv`1SZno4w>A)%=~D@n2vdvPa@6R#!(n3aRo9#S4yWX3e0x(;7EYij#q>|!
zVYTH8!1*R<gGKMbNY`PXP{N?935fe>sdxjB(lXm>I2k6t<s^1Di|OFTS?%qX;W#^b
z-b-){^6<?vp-Lm}OG{B>&CnsFP82%9$p=+)@cM>KsvxKb>w&?WoJ2VbK%}$m?Hq0^
zI{51zanr%8*=l$jCLi5n!Uf*tx9nL$7%-g1ruz|JCC*+#EL{r08FOD+iyA{o=#W<}
ze3vx{6xD=*#~0wXM*?v1>bSkZa&{0}N2b;s!dS&;bc!mT$>q08UzxinHSm>@%r8~o
zO_w<Zk@tP@Pe;#Q0ctL$fxYVfRkFrbmhGl4!7<ao$7&H)!da`KYDJF|;}B7FssX_E
zOUu0>627j6KCO@9#lN-Hh%`*D0rsYd*1?r6*k1u0^;J#&oGP+N2fiu02n0XUb60x+
z0{!3{t3i8$28V<1?dB-`eE?23X(HAI+xzGr1Jo8WBYv|P5F=`IZ}uAGn%T*NSR1<!
zt1M>Ln{^Q@eT#)!HhMzk`7I`Y5NgMtfLJOF+}9UuRPTFC_`k)7GK3Gri(`z$;;)0`
z%?Hqjbp>7mWt~xf>m1U@F738Ma-7(&e<3T&_tuwkKFqMc$OQ*UJQn1A-!kH*26{pM
z129;#@K%;Rns)7k4LeL0pAJl|`+{_ysUApTHK4_w{=3+uGr9hD@;ufBrTeg2QUF9F
zZ`s?Rsm^zw_+U9;7uce8x*BW^lc)a;gyonoCIM)wAiva5ka_M)5UsR$!Ldv*lJRH4
z=>bg^2zr3!nf8lZKCWq9#@q|bQDdAS%C%=b{r>*8;>bmr3neM~sQ}&z*g@-h)EF^p
zgC;F`bIn+k)`47)zQd{laLD&XCDQ2UUQz>8@NxCQSh*<em1EX#V|3qLY4(3xYg!*}
z(E71{Iy|DZ@1ybQzG8j8z!qj_kVf@7?rJq4^?erhxL6L3JKERyOoE96MD0h#eul|8
z2Z@Ptz?BCaVlTQOuqJ1@W10n+T#5s~#fj<sOY0_w_z={|G|GaX6#h;O2qnjatqa!o
zVJ~tID983pjOUmTFOv^1%bDaZ10|Fn0Vj5=+3y|zfxy()G!l}oG#Pd|2o`?Mivwu{
zpkojOgQ1%)Ftx)NPT0Fy7le;4eDi%g7<aYVZyBTwX1$YbBi(Zn)XBR~7M|(h=^(A>
zm%1xOWhAR|EM)$Yyn6f0-;C5-yzhxLyNd)Qw+0Q;Mt;eg+YX|%Ie&fj>s<37Tj744
z5+^38m}GG(9GmUNeeA+*#lqav*+YlsLD+k5dm5TlTPbl2kVxEjH+fDWeWDP`x<Hvp
zr?fI>Z{#zfh0L98;giIjm#R8JVtr=-)e;Qf8>fm`$jqi+{dF5b|LJdfa0WRq4S=1r
zH?EfxSadsSvE=eeq8%yr?VNZYMY=Q|Y+`-sojOD;dbX?2esY21kV}oWLilN5v>dt8
zd2kk*xiZkum)BZcDsYSyLz?tubRS@b#W$;rxIadPUE&1%uI38g<4rM|?)y-1nnji8
z&)FFwIf)K*zJ*MupKFd^*r}5-X$!Mrcuo*09DNd?X@A~JoALwb`RnN&#ae&2@LJ>C
zUT|Py<Ir9jb*})m?`|F0t5g1?&1gGz)%vhCVITdwnRz&!-t-<pr(0UEw8QE-qII;m
z|E>l1HYF$QkoEF@1btl2bY}}W4<g&chg3*$4F`M%lpD^L)E=NZzgYI!4qz%;LuB^+
zZMyvbHR&>Cv$W(;2l&B!*bEF{ReYzvryCF#tA*q~804;lRoZBx!77(@pPBV8^_0}7
zz;QuG^IIBNb34y@{@Yad|26Hv5wM6(bAL!LQ!MHWnNyB-4qTY>9#54}7DlRn57kBh
z+MZC%&RWU_t>LPj?O{y$yYnhRB8;|S=^5kDLRSSoWMmY0Pn(yeufcJ0>3P|EV(<Q^
zb>{!HYQYf!IM#H4v0&`s88<$F?JO$4l2Ejt{)X&ZNd2^o&|^u^VZ6rww!1W-9HBq>
z2Tm>fU|iLg#$Zq}Vs`01Waf)fkqv^t((8^zvSI84P>(*Jj=D-(EO=-FEMP1s_e>`!
zfe2)evmmk6&z@kk;JKZoioM3L!D#dSroBsvR?9JP@`b@ZMF%EW%e44YJ;<_1#?I0p
z9lCPeSHzGw^ytnV4J2yv8T-*W$bo{7&)D#TJj_DShPAf@WWJ?JEQw<#40gdE|BjXq
zc0P70oUR`=E^I=qb|h@paiQQf=wrY3Myt%(90v&x)BDX6)Us}|s`k4KAJwuIU0m&v
z(6O3amgfO+1*Pwwgr<$lo{XpgXE$;0wY0SnbVNeWDXz2v@B219Y21=gq6wrZ<|VW~
z!Y{<t&Jf!3RIZE!faLx8DW?%wi95OcRxo(&0%4)_WcA<nXaA>t0(N%J-#CVAuQ@Ek
z(SZ%HSKf}9?<iWErT)GeR$v~a{s{?R2v^o!yUHJ`OY(XAj0>`{LxO4<aLVhDnXE*8
z59+@FdB_rG@~MewuOJdTR)U~c?uP9!11Gr{XUh$3@8C|kHbA^OZS$c!iWy?P5w(9O
zaK0PAH`sgTX(1S#;axnApxb;3TV)2qe{v-Mr!@^~6}ptnhNO#)h8-)(@;vaK2eMD@
z7!VeY6=BN{VR{Z^jrboz!8g_NZ*v7fU@$h(Cvy-`p8Z3#ATe4de!ZT9i7>GtEH?DF
zb@>0ZsxlP?zWY%m1KEOTjcZu?2B=}t%Xl$8W~7kkNEAF6w94<b(p@7#>%u6#m><*A
znpx|IKuu!*K@{(`;(6V|vi^5#88GdA?XeVb^kRYApPvJ4t~`;UKfYRAkS9stVWBrn
z!6vGcSO}D0_Ti~p(e5TMAA2ew!ct#cEPgKU|2kqzx{<u=fxNvh?K~4;OW}&3z(IPk
z^7c@Ga{Mpa>$$7_j>&4EtX1$$i7PKRm&+W;vpdL4p!lxaO@`WP#D9b3!yZ29HJ$M7
z$69+iP8b;&NSxXerM)L=`0XK>R{GpMnVlv6=ePXnQ5wUF#OELdH~V(<x!@kT@&<^Z
zHC&;ntGo8A!S+euUMJK4)2SVpRoq2tDB0XLJxx>fvN8(|$<kUSJ)kVvMyd)VXdH8u
zj!XcqjOK(NvNkMNxH4R9PttIou5xi_gxo{+`w37lyAiS~F^P3fCB=z}^~w)PzsGVC
zT@LV_zq3KZGnnh#2PX7kB*J>GZnFkyG+8?ItQ!F8L{EeGLguUfw40zZ+0~R#3$|3B
z84EhdI6Q?q2*?+J4yWeR!g)dI@^!`*SAcT;(?Za}?THCkL~!i|Q!@~>`((b$LW|&A
zHA>4Tg&hM$>;x4bu$7ffHd!;s!;OH4C%9kv^Ay%%<v9!L>?>Df%lD>`sQ^>#W8@7J
z#K=d#`j!EvNXDz9<LjDg%hYhqO991SQ=rl$k-|*SQ2x5<7Asvyeraxq+^QAuzqNaw
z$@-HOZwDi}A(LtjEH?{7KLTCD2t*1QR1ETi3R_%+!0&G&kKG!A(PTwPV6N1j=U?nO
z4P5{UMDl%9OFa_mV2I2}k9&1%BVXjzpWi!~w=?%)`4->E0f4I0J~whlvGC}m`LCit
z8}kT5ZpSN0)^lfcw?D-k)O{yQ6I7HGk|w7CK+s!%pe{xe-3Z;}V2pMz6lMc8r}PV6
zcH4tz^tu&5$3kJb!JmM*J`Q^a>I;Z)?Fb`)#Kr9ffVPgU`jG8;?Rx(0XZ{^9H14pZ
zEisyKU+5<R;A>y{5yIA<qtuTVC~;sfS>esHLx3FGeA1atfNIyt>M(e8Hb%<uu9U~P
zhTYt*46p;`dzoVn5B|5Pcz~qJ_hRCZMp!$ICdJPh?rLJ<j}NGo%<}+eX*+*l@`CKs
z((Ix@;fOc!Qk4arnYT3n_x1ZN;HE(cQ#lRR?>&B}X+MV3d(?pg*3yGrJ&!c9x78r;
z$wEpY=?nUxic-@d@I#ECfpB+A0*+VsDj#UhVU9-4`WWS?J?hoUi*Y?t1c-~q?N=Xe
zD@Nomt{B*A6n21aW42JYpHX9ia-?i#dm6blZG)!a{c@`T0iw-K9aF>-ZId%eY9_B!
z<F>|kMzY2QUdiB>+|))DXRx|3v7J|(n9bSYk#mFzn%^p@H{CDEI!8PwqS$retlFQ%
zrwIB}B;X-5+}LUmoGem%Kj&ncvVaz-X*EcH=B9(1E#1d4AVZW!f@UVg#q;SC6G-|&
z`+$BwXoJdFaB-j&##Pfjo!LCYi*GzP{ZE>c&Re|sZ<)x~oqVr;9yjR<l)hsA(!-U}
zIGnzl8V=QyUcJ$jK2z7d`<C;bRHZ{2nRR_5YHa?cnTd~3HBCWcFzG;B+AGJ1s(XqJ
z_s&C<M%sxPxTf3cg!P<Q4eMR0nJ1lNgfNhp+K!dqOXTYM@Q%yzw@kp$8vosms|MOC
ziGH;B`lNep@nJVNK>79EQgGxkDj+!dDX<oKk0nq@yj7BANz4H0>1re$UG5b4T37ta
zF9BN3=Dgd}PxC&RJmlFrz%tN9Hf>N~`TjcND(R`;tdR8^CuqF`jO$-}zS)K(Zd{lX
z_V*#>&yBeR*wYp-5;tg1>2<RaNI?2uai2;vcN_;r&p7GNNP3z8O}<6nPh4TFx@P!z
zZMs)o&p10~TJSAkLWZ^#3{+>t>vD%fu!b_7U2r2)5-5yurL-)G(dZdQ+vj`zUp~~h
zkmKUn)g(qE#biRK!N#jkWT!f8_)`7TRqwbNCSSGdLDOW^i7te&I+8!lGvM2E=lqjI
z^>*cjOm!rWY?LA&;l<ogQJ|yw4<qiod7WVda9!wF(EwjBy7vu!sM_`A5$cjs0ib**
zi%t0n6nL<af&@JH+Qm>q?z>Mr`3Ye<hBdK@3R6KjuNeIQ47};1D~ki_Q$5RwvA_IC
zkOMu5<?Jj4mL|nzou&+5506`Nq57S~plL6e<rXq8Cf{>CNCgpDl_#(Bh()z}o~g5)
zl_ah5EU#Jm<B$)(UduXVG*&qi#-@YRN?i{{c>Yp$mLjFBJ!HmRzPxWCv)b`Z6$@tg
zQpTs}V({R=H=GKiph#aYU5KE!Cp{Lp^5Ub3V2Sss5DJ{^B6fwjyXKw7#o)s?9gF~Z
zgG=L%1Ms}c^8!8jj7{0ubtPUZ<z!kuJGp4B`m)2eBvx<G9VJiolTR6YcwfHe6wyV>
zjDJ8`E4tJ90H6ttyNhS%*3^EK>~9c@7q^+4r`}knr^U(NypzeF$fJgi9J}eaHMcfo
z_0NciM2-E#fdS=36%K0IpnUNKBgB%e=hn!gu(f!$bUP1ya8PowynpQldUgJZ;+cJS
zLK_TFw3XT94cbasWtt(8{6zkb7&zA2mJzwDNm41cX|rtW%M({lUVr{>-Nz(cidLB;
z?3JMuNq*?y+x7@f-Z?9&L)I$wlR$!NZT2R(oxERE%c9qxuRp&FtgVaux%TbL(A>{n
zx81hLR6Dwx<W3`i_uj{D#@m@cZ*)s<^dU}R(n%MUPInte-!&5xatr+IT6>hbq&p7r
ze`zN(f`-5s4+Ws~;~VS>YAkGlY440UAM5I<Z`~jGRj1PWl=kteH%=zv@al!HbtfV(
zDZ521gS%ffk{IBnTofI`#JvM5b(&;wJ#>t(xU`h^Yv)6OkF(7@=8hCWBUGiW7?6)^
zC*GFs$J}qXakDI{)FnATQofy}cgr?ozP`$ycZ(!L@5djP!E&4edHIntMZbLzCGH<T
zg;?^Dnzi%1ZrbDFa=rYm(ou%b1K#0${FwXdb<w_{0EKuxdJvf4-7iJGJ2`jn)72-~
z0F9v94NKME_jm25f7p3-(74ALPEL6VE{-McD0b@;?K06;7thX}5WG0zAr>DO`!Jt6
z<YaMc{jg@VkdRQ<@GIm}zn2$5V^eCq3|w91{4<~p!sEva<@V9;85f(r(YK}>>fz!n
zFTYC%xOa6Md24vp7Wla<Y)4#6ICr^07`iRfu{S1u9~C=k4zJ~B^mrtFZ?<%nr&#}&
z%<msvJB3Y@9rw-8SAbVU{dgR?CRtf1=L8pH-qgPU6Y#fE{+Z<qAnMRFS&%5p63LA)
zyPoK=&k{%T;ygn_H<$A2e6c>wFNF2}tc`QrJ^yM0_a{5#{{8!(-rU?I%gELw>4akM
zGc06&zsF8+Op=Sfa1ybEx^Y(ox^IiQiVbahp?9lFjP_?%>qFY@HI*@253RGmm;u|8
z;TMCGxlX}UW3G}6esJkcUNubS!RzVWRN|tKn6$sJ;-r6${4<i|^+!J#d0tRb_~uTD
zq|UmoYsYCct)q`#a@elNXnb9V!-U%riPdn=VOv*V(b}G&$R%K_#&EVz!|s8L|GJfO
z9?W#2MejaX%kag7r|Bvp)}Cf0FGoK@Sm>y10v!`ZIVCZ^`!TltR;KiZQ&T-}N{-{*
z4k(WqojL$=3}gElys%h2&6hlM@mpVwn4IRX?d6EpHF5^Y{BV58Yf<P5>l7nq*!}jD
zzkXT>TIQR+9@5Boe0OXR*O2sU=40lPd)I}r-`%F9LNI3Z{~vSHALI<Wu5+hD1gt&h
zx4l%Hs>13D<#Z=b$*JGXip86B@;~2F2bo_hT%V|V9%CW^uchp>@6U5F;^u!&Ty`n`
z_+)K9aQ!T4F1(ho{E5k~pK+(V3)BH85pdkKLrXpkC5=%3S4P~KI#^zb^v56dI{u7v
z_&e$!{9{+;D1Y`zw^8h}Q^Qz3Ec?ij;WGjVy04!lV#(JcC~OR4h-}Z5Xl+KL0YChq
zkwH>D5ICUBSIb0oo`hL(fCTl>QK8#E!BZMiG#iWEs^$9a1X69?WZA{h*F$Ur${DI`
zROj@j!3k?GNef@L@BG$pT!>E#PGFt<({b}p)NmBXR((+3ag;&Pytc12WurzX?y02B
ztL43u#|U3qZ=294p-ej8Fa-3ij1@}l)TgcLEQjcsmz`^oMw@KP8Kkr%f3PGK1PFb)
zC1rfC-MZ=%Ax5w~N5}kwWPQ;+hi$@V%p3#vg}GnOOHu)ZUp^k~?%gJ|>NRD|{p}Do
zEWWGzo3Y!cM<CDRpU?S%pzBmsJ_JbsFYTM#0L~D31(V}TCVZ``zDCjbtvGcKJY}%e
z7w^c6xo@W2C~pgxa`F)ntn#{B5joBQ@=8(OZl?j2tkEZ$CqE8TFsR_+zvz7q^bn)1
zElGWiD`=_UNuh*&cE4v2QnmiGD`jxZG^?!RHLCy7Q=~?K6tI%YFz2kMy2-2?6)Rzk
z|1;lUgS;&$FWh0dE5&6*EX14K849FO-T~kSc`=k5UwH*?)93vEnP761AzAvFIUhF9
z(tPoGr~^;yem#5qHx6X-z3-nG6UG>AI>iVR7G~<0DUTCm;)A3D*9W-1p8cx!TO<3D
z9#Aws5_3wy&0r>;G$Kkfs%QeauXD=lk%qZG1GVxOZcV4p`tWvgO*jU8f0H8d1<91x
zJwx&z>GllRJW|px3=mW0VGpQ!_7r*WiNk~a@>myBgJPBzGJlA!QNq^K1;ccOLOIbz
z*I3I~ghg>U>Py|?@g;B@ts#jcXh<$!nFaw*X>zM6sLJc+&ZbWA^I6}oHvW0t!Tq#3
z`Y*Kl_#v>DI|CFk!Wh3@V{}oVc6za|N0(;O&+;a(>lDX=M_t{;#=E|+0585Lgy~_+
zLXA3JTaDy*8a}cSI(jE#>&#z+eK*+{dDbKpJokb`trRnX>kFAO*^g?iKc3!vBzM_A
z#cyIAIK4UE1e`~({S6nbh0OJ<HCGIX%8Vvy%J}K+BQ<41U%pjfPWit+G0FcsHS1@>
z<rKk#%T?NKTSycHTbQRvy5g;XGlyUkiRWJ1_&GW}X|G9k4(L%==bZ*mOk^F^C#DV_
zox}#diEwRB4{}LqEa>JsKk++t60N7HnI1$w9MXF}cZm}u&eM!Cby8HpdsnNOY&GQE
zK97%8mfI%9cGCmN>!D|C9)QfbqQ@>?QPL3jG2!Y|3AU@AQ3pgQz8KS@BoV!gW;EBs
z<u6t|k6|#=-YkYMH`3rZ>G!}EjE0}P)|3gPdQN1o4@!a!znffA)6g~tC9Ok~zuOV?
zUo^oS{WKwz#4&1mP-(dK(uma8ciu6hMO^jHoFu*7ujf|`#Q8Bo4#58X-kK0+^N+%V
zZ#;8St@N6T5k9yh)#K(IF#U-4+aFL7{+1c|HVc0YBvAUoucPG_r^UmLeT8R`lr3}y
zl)a;5U%0mkrYe^RrqX>~{2W6{+gtB9X=;oHkzu0zzYk@S&RKxRfeLdqpC7{9Z_PxF
zUON#mL`_!>*9H$_g%Y~Dol-m2KLF;z8qj+YzAk)$-HR1O$QgScKSy*28D>b5I9A}I
zp5QjB_!XW>sy#Zq5(z>~fai{gK5<JqVu#gM;~~mvxK{x=g<z6_PG9h5I7o~&ZE7mf
zXh3N_bKM-;(}Uv92K^}W0Z??v^6jN+a1WpOh=;6)0YxOT)2$S_MNTi((-|fiB%>1l
zYUhCaT6UmXmLVxa_tCbV^O0&Qfh#OZ&AbnjP*{CD9<<J<ex>6ZdH+c|J?;=F^MD&b
z`?mP8SVe=1n?>C^t?5CZZH~O!X{B|)NV*?8Zb7G?AGH4>s)I8mmJ!j-;*(fdTt<eU
zqsfT4v<mFb_>F6It#fp#L&3JJ3z_H6RtHsjOvm!sO}AgR0k-`~S(Q;<oyE!~qaEVw
z9SsMljr%~lAJQD&Amub%JQVlSfhoz<-Ctfk;>`3@7O--mV>0w9Q`TCFz?j3q3a>;@
zUeRU%v8;=~xuHt#vRp^}*xkb=ON2{j<Kz~_eBYSI!az6#f$*1ulKN_PKe%iJMTk1v
zebmO5bkt}Avxw8MX}&bm=fX4TOi5QMVI%KzctKD=HK(;B>8dq^iR&U^k7~>2I7`bO
z*s?Mwb{M;Jhkha#es&HBemt@Wl^_y66$ul<kg_F9O7xP^%HJ`1Cw4zc>LqJOy~C+#
z*nStg_PcTsE3e)_yWFl+;2jLBu02fEK64K>x`-}Lms{-BZP?vi?`r+{b)oR_?-{-(
z{T#amub#K}_7?QQmX;0xmiyiysB`dF5GI`Y{lS7_KhzkfbhpFF+o)cRxwAtJuGxZ1
z^^VuWL-Akc=YM2}Oeeq0o{y;c=nL{_Y8`x?C|#nh)dSY2=2m^mEQd{bt?aZcP7SLA
z+21c1s4(4{9DaO~_+bXH(f+H&UR~j4DH#O*u%6<$@M*wP=BfpPr(|zoYWxAn9y&ar
zymJjC7!+gx&a?#VBFM~@5Bte6$rF3I<McmBu-#h@uU+m#V(oK0+IE>aOZ@b0tGt%Q
zI^?PMw7m}*Nhomn(*tpaa(f2!Oq#GA&ty=sI9?f?;TeK4&Pgl6=3wv1t0&mvC}U18
zQ1v=s!GN$`2@3x~{*J3@pI!k$pZkqCu7rjCd0$RystZe?b&Gxh1y@A)pmzixJ;07q
zFLznbZ1WIU8sLOJt$Tb$LNL)eH)S=p&aLkGFi7j`(w7~GI|rg&W`RSA$HJA@vJ8$S
zG<g(t^Tld8|7W)sWp?D4gzij~UF*_xPHDZ(A0}U(Z6?q>M?W7AraUjM74-Yd=`@+C
z%KH)>FM;N)O745fh+HDWh5<UpzI~80w(p1xT^**$8tt;09^`CxUxxM$=eXZ;D_CAV
zHi2y+vz34R$WP6SE25LwS5Cvn#5Ha!qI(x$mG0eu1RZ~O=rkS6*8!3ec8PW+Ay(W(
ziSzgLAWbunfWE^SAT2k({6$Xjr?n?8nNyjQMcP+~ITOGmb?N;PNV<KD`^amr><cO9
z*uf4>(dKqqY}#vpD^8?L)UIB``?`dh_TE!mMfG{sb&uDUt($@r-Z;m6!6$wzem%oQ
zy-8OS>}1CQB*IgU&olfY+a`(9>J?tu=TdOMpt4RLO?a=trcIs0hP(o+)GAF&No2<<
z8&ph;R`w`#Y(pv&d)n{z^UEjqk?y>~Q~pPB>+yLHa`-XRs6OMmZnc^+bF;u>VA6aU
zFFG4={|A(?ITCnO2fls;KW<0Klv}J!akeKWf2R2!*$T?*c5`jOjC9ZNVHYKF>zx_k
zsh!qpO3U-5k{I{eDzE1TDXQQ!1sxP{!!>)jY`z9={0Lzdxzkrka{i8s$(}lp5plnd
zTZOD~UH+-4&bqua`8Mgo@sXm=M1RN2sh<9zi^)TppIzc#YYcOV0CcUW8$1%=0yZ~M
zIee@`6Kt;MS@BEPjkVv!F6xoj)_F5XBey{*8NSYgkEi<A)OtO4Oi=}@7c^I0f3I9W
z=~ulyMo!4jzsSmV^qkh$#kx!Ygn~Yuy!JG^qQF$A;hz$YO~3%cJXJfL{)47G+rVAo
z)EpFO;AxNAdM}p*@ewg_{M;WcTv#(mQ*FSLSIVAAEb?NzKdL!RRhFBlEOKE#X;fF<
z8POZSvX*tv(H-{#hEzx`JC`OfU0H6Oa+w=+aMn#7259=%z@9!;sxBv1?{5i+=&E-$
zD|aBuqyUiYmEcO>ootGf4ojH({OJ=)@2$k?-|EE{yu~*Px)p?T#;^}4WAWfN_Ek0I
zG{&AMfV?cXI4&_}b?;R5W05~UPJjAj^7>mF<B29tGoN{$DV_zFpK*#G8pF(g+x<qR
zov7J$XsW;QZKk`oD<fm`^UTcJP^r3}+pX=l6^|q3)s;GTvmWa@vT2{BV=oGWr?16n
zr)??Qa*J5;v4{Yl(6jHQs=uC}QcZAam{xsMU*52(&K!0+z00`Ci&5vg!|RY$yzSaV
z)6Lo5KfBkZs_eby4vLC|?PfGtSX~-s%Wp<M=FpV)EErky;u)wOe+;tI+WnU=9KQ^Y
zo@z~3O<B^(p3#+Bq+ac~TiTE$oc*h-DT~CjyuGd7<!C+0^CZpbd0?0^;q<1O7jOGh
z@#<H%ZXR1)df(JS8&>FX3!d8jIZy2BM$e|?j9sa6K-1b<{Wn1r6W{61Gdy#5%|G5U
zcjfo*RS{1k8NJG^Uky!KJD*a?k-tW8)?*)b=>ku9#@PRiekd_|(%aKRl@T05HNAPa
z%0{ZQ;Xb@y_+#LDp9*+DRp3hy9A{v+;@Ne?Y?Gw7kfTHzovz<$Xo}d41-CExdYZdq
zk98hAZrbe{jQkO+yuG~@srP3l;rjFGqOlv6T_#!T=Tv4!n&k7lK`IO|U(>%jlhzGM
z{>%f%C8I`vK_upuvSjBur5dkoDG{Xf`f**~)mOFGUhlN9v`6l?vutl~_j<kD(TDZE
zN6)IAZXK`_b5WZht$mP*tQdVPw&D&r&AUm9aBR}?au?!y?8K5cv|OTMgRtX(%XZ0y
ztx~RjB{u)}^<q;&AJGEtoAvqEyXTT!yyEL(?y5zGE#HCY6VXLIB!>cui4Ddtj+I>?
z;z|M?Kt!)>x6RazUb*9L@dauBM#xX%t7&fr39yXgmK$ui9MtG5f3Sm<RM=FI_nd=L
zvB`O4h+;p8(Pvmdjc&^d@syecF!%}(wdNC$+Yr$t%awNK3o`wKkRL?u$5$?eL_pI<
ze7<jtu`1~l3UJ&y)-k^_y&4@oml{r(3t@@)Z%pa}x|`Obyl2Jbp+;{8II7D+J&Vg5
zZ`dSN?5?=ycXb2u9=t3)951W)&`CUC-L$tcp->)Ug$y9~LjJ=)HKm$JI+oRgmTl4+
zJxfyH4AE=?+M~Oq+9oTu+sy^kmX$v6ydE+lyIgWrGpT~M;_e(EeBWt6dG%47G(p1y
zv6NF=_T5yezTq;LP3UP<w#j*`kcwnAbNA%{1(4*2ji@Ln&|XsgHygdO9aH+JTyXcO
zw_pQdgt_Z1vw`GlU4Z$LCovdKhq<2GvU5PvqHd&A=0kljTh@v@h)>_X(#lB<ozS6f
zb=cStPer?vy#OVfFW=e7EnsH4t4$58kICNi-+|sa@WfU_?=uhTl2AY@L?4VprcCrC
zE{i^Rhn6kW8ilz1nci;0TboNW^YhZBCI|V700lTP+X*MfN|U|(pS=`M*=bYg0S?o?
z9jDow@Xv|KWA>_eLt)I=WXqfFu5yx_h)_r<bWHaTRYWPSvPDl#q*sUho~l_#YTU=h
ztDZq6o19k*sj&Vhd0JkbMBoinuGz*P8Eu)QE(r&aJLE23SHIf0b^^u~M)1P1L<9v^
zEMogFm3C))27srFySRI#Y4T7ER;^!DqD$?=Uu8O`O<k*tc@7g^5XFI_wF`5kF2?m>
zv`gDwp90WF8)g$qn7hVu$p1H}Yc&M$HYqj)1nBPd#+n?(xU$w317Da5;y?ZnA0-V*
zRN9kx>31Mh2KPS8iOB(XLQcc;D|DY+2AHq-11efJMvLf!dkh(Qqej;N+qw!o7*L<<
zA%mmbQTnCOoL*O11Y81mi&sAG$tlE~#0cM>I51gh9HQ=T#t6S|g{n6>&m2<m-`rG_
z0@>L2;zy^6&!s=4?@Nu?DtBw@<d7G+t0$Qg%eC}YQ){%2KhR14)|;)CT~o7dD7Ox~
zy3qP-s;4PoK^JxhmKX8w#5LoxrOB5^0^VhO9@4CTesCd^9Zo)w|6x1(1M=9b;N?d=
zw&;%e0H^hYX?=Y(eqI<;Jk_!n^#*q#WBJUB)iC<KS=;pLHLdzjXSl;`?GgWI{a?@w
z5<x7B%h0ZH?BvGP+FOfFhZlbJguGsVwR&@vMej$8iO5ayE#lnBDEWo1*!1@^H^Lbh
z;YCLgQ)t;@tx;2wL`Cq#p6-;wQnHSBt(N4q1XgKxmR&s|XqeMxun%MZ>!$H6st<v$
z6ULZLwba)`nwg|(ueCk6D;h3aqCNS6w>$j<k#?m1i2`FicsH;JjTre?x|_B(d6E8B
z3HTYMKrv~$+vCDi1}{gnz6fk4obVLKq6KP?0-*)3Ae41|6lPXaDO5<=J<{bdp3Kt*
z-ZQw$bWMjkK#56YO1iPRG07~P%x+uxUCOolqe}b;r~)QZX&&`I-sCbO<`eaulPa#S
zxX<i*jX-G{sS#Q!8zD1wVfwY$f&%O`GHxE3-XrA49a_)<K~qjPlSFOh)Ms(Y!Id&8
zRz`Ro;%|?op^lbvl2PGvHT6`;i+I?T6E0;a9O(qFJw~t^ZothyaspOWkO(b1z>uhs
zIlVJ<Dh#}dcw65vse*gO{eSVZk#3MT9MxIBes%a|+VYR;Xi_cos3ika{>>BQLTNG4
z%kzj6$0l3snUYklLbD};*%lrsaOd3C{|xg8BRstdTqfW<bjmwiSgU7Re{!DgAV$qm
z=_cpdLMr;_u*qKlf&(a1IZGPv41P?g3u_?fiNnIth%U5jz1AqGNP`&M*6q~o3|68{
z)&8CG(X+nxh09NNyd~31ZE9Xa3}ARp{<nU7wdi>Vs!Z3a@0Ty{5yp$ON@BUc&7dn>
zTofT=eExb!#S=9*!Ii&jg|FY&pm~I|$i|<{HDa>Xrq0yIsD?qiXdN3|;3t3JgC|_l
z3(($=FJU$O22WVzRD+n9%MN7NXd3dh#CZ#oC{yqxZmd3cQbpW~d!ozU5(WQsMYUbO
z@$5aE(F>LrN-(<4B5-LvA=Z17X{f*dTF{uNS+8Hamebg`LfwRg9~Q+(CQUdr!#rp3
zt)HI9zM2MQ0!X;0_?a{(`)vIs-4gNcBx({ZoA+OYt=|UkA?9`Sxa5ifon(3av~s0-
z)bBmzJqn}hP{rzF?*2>u%eNrycc1W*(b~K*bxtH<L8nTJoiPaN=CNm;w&BpG;pB3&
z9*+wdIzAk*NjM>b&=&Z=z>~*oZ);0x%WP>L$6essFK#ynFntupSnr*_?L$a}pVw**
z-bmQ}xC=~6;dZk;6MnDVkkr%|+*(d*Qvk8%at9P^2w@|QgEqvrDqizGPI#jwst+w2
zuQh7(PqKHfd`aD27s}679^Szr(gRKv@X`cYc2dZqit+_A{<ks>#aH(84q9fW_Sl;L
zZQBd+^?6XUF|joJrxS<w@mJ7mTly!VWqe$5|8KR#?)u(-an#J>5?|iI5}Lt9O;N-Q
zl6QquZI9rCN7>E9mk;V`r+*OUJ_4$Ia55E>*=Q#FEEP@PkNELOKhETQ-M=y2mohmS
z26mLWdXTkr$9dB3Q+o89*3=LA%b%~FFhvP(r@1Lr;#rvx@Vz-^IPDka=sknLf<$r8
zTf7}D)O~F03t}LVaeq;*=66?jb|KhCkcH#(=kCX!4=GiZo@Npi#)z)CtGWiPXn-?!
zp4*Tg@ZlXas#qV`goj2DZr8;mR&BSnDw6}!o6(xe>RVYLMGLqx?EM9qumIlcvrK?B
z>QGNkw)C8NOk)=A&!kX3gRS8bQgtI9pSSQf>0x(5{j-duFLSE>O)<#<kW)44LQcgK
zXV_gh0jc8A@zJxV&ReK^TGXecN7b4TYqf|cBFBQ(7xOQ6XOJ2!f#nuv2fgp{cyycr
zAH*~*jF|>}sTu97pdLa3YoeQ@Wf*w}9j~odhQoh=+u(+nS9@i;`KlqTe<o?i0!SE9
zzDBxyEMb9eaXK~{>a|UQBD8fHh0+VHy3cUtV;l^4Ai>P;JJ;8B_&NkN|BcQO_|s?T
zbX`cz-+Ml!JN0<fdo2#s$}!y%#t82b*$wA_6-A)PMpdI9A^U+O8AT?`cc+_s(X>`z
zX^z`-bWUivqojZWyJWM6W|pYx`;*PBQ1hO#T^RbeM>Xy2xW<{NHWhTfKa=pD{Qufo
zasA{Z23QAW*=)*T^}NLvaFOuEkI0%4NXVG)I(U;=T#8um@WHknTiBI_OeEa~ow#)r
znoz^T^+9q}tjVbBzqmCIOw9=h)0llTV>bt{Aj-GrsGFew0phxZEWrK6Gz3ij^aDJ0
zh5&(#-sTmfnId$k!NAR{9GNc5fbn*asXBhp0tfIaDT-~UX$0+;p+)TJ>UMbwOim{2
zp^AnCXgs!H6Jh}ko}6m=Ta9y6=cD}{uR+&-QvMdqA3)1p4)T6sLTu0)-Cjr?Yew$}
zc9*(mcO?V)wm_?eV&<<HVVmF~et^?|BVidy@Ar>n=iHxPTPOL7z!N$56j?0b!plU4
zgoXQwFJ3M-XhXC9hYe=Dnw$i0z7iZ~1@kS3kN{n>JH{`6l}}O(*<*o~86+)8My<Ne
zf;EOo_8GfC?&`=Yc*yhm{{paWW%ZC0u&|W~uECuRXkp$ofoZXdE|Ad)`5pWEj_l2s
z`EMWW=~E~Xpo8u6Tfd&U2xH`-pqMgA-GeY@;f^c{1u7BXJ`83|^GP&&)Jy%|bX!?L
z(q}kpxI@L)=jb5KMbnngScRY859HVpi|dW+BM1~I3*u{<oP?qirT(sQOalsxW>^0F
zrJ%uN^qJP^d?490h~Cw$1ECnM`@r-*MmMmdn;qXK)nSu5R5gfQ$+GlrE2yhK2D`z2
zIhm^jI>;y!AJM@K{`G%@;p>|_Ik5ey=9Xq!Q#T-sS@`iJ5MBV*swww@_j1Svd;$a|
z-}SbSR^a5jA+T}E3fm}l0J0*gcVFMq3MV{oh)Dyg4+g`-K14lJf%%Gp#qye``4;Az
zi~_XYV_-F1-Tu&Ub4#{qc6=F7taqDBN0*=u)qb)?eC~b5NPxw@q=MIf1yNF14V6U^
zN#LYIWlLXl^rQWN_CaxW54WtcDU^?pV!yA)bLyiWfL{7h9NH^0$eNkG(5Uv+bb!{)
z0nH~sJa?UusUH~O{X3O4@y^=Ne8zYa&xDCG((3e06kpLB2lFpU2?cu+C!d`3NBG18
ziO*;Yef)e$6%rweP>mP5Jm!~IuYClx8GN{e8+-&pUcu2KM2QWEOy3h};}#I03Xo#5
z!#SUXh_e8$<(d1a1osW@^gkgo0xxYur`tn_@d&%mAFrPcR55a?Hqrh{IH9{9!Y;F9
z3Z(<uUh1KED}!8dU>On%CO5a9nT(c!M1U+_`wsVSkN4IVUf|vG2_QpVQA|yT`fM-b
zoFQk=2jWs8lwihkxJ2ozf({NBOKJt`7m#W}004Wg{wv|>AOXA|84k{KQRyR?;r(CG
z(rlZfZ$icyWXW-X9gk(LAeK|B7KJhAAdKm1!GWvIWe5mLiR>y|OgDkMJs+F?+YZ=T
zX}6>#3#fdBB=6IjaD@!(s_EAg;A;U{K(n9Xwwm0h(0-pd)!x$+TC?XfNCM`-F;_*B
zv>6%U57EGU1b4oXMs%omR@{q$38w?44=caB#0p-SBmoIi@A7mjR*-5CVFDFcwMDvA
z=3f~mLIt+W|H|Or;Yq4^qD3so`nfiqc<G;H(8=jEm?+~&M<XA2?cN-m(1q7mMqbbC
ziP|q52GZOzQme9h?L#nQkH&TA(-UX!fEl$X9ki)s|3NSOzk)vVmp6j17o3GqRP$n4
zD8Ugz8syjvSP`hY-geIQg}7)|zzrK^Aczs1WPf7S3=;c4sAU4M79u(tKZyk=!Q1#A
z;3O{cU+F;8fQvFE5r9oWA_OlZY!1RueMf)@Jg>_doV?=x-vZ8<77ix>9d<LmeHOfS
zuK-Sa$1%JEZ86ybZazYR3^b6jq&^VJ#)O!E1oq=XcUyxWg6bk>0m#L`zr$Vf6R6N<
zP_V#TrUiM;g)uXnn=`4O$#@fOVEV~GC)0vf+|Xw~Dq?^Tp7Z3rE|I@S)<4c+7YmlJ
zQ7GVLL%^7~jjf>%s6+s}5k``}gQ+V1?2IHClDrmV`&;hu5kJh)nIZd%@aCTr1^HSi
zm-})5mhN!Euckl0eF{2_Ng-YV0pRsQ>XJrF=mGF47JU@Hhi?$f*y@=a+`qdt*4E$u
z61M-)2YEhvHRS3pWfuI<q?cGXD8!uaaDk%<g1+RPIr=!{ZI>hks=)^!5MNP!LmuH@
zkZKmZm#W8p1>%;0=CDb}TG7zf*O2p=<2rj|tHzgdD3mXdBfcJMBZ0T+;e<mzp-?Ni
zL+rVlmTN${CUi8qmPL%v`uLfa<(?HnE~1#x)olkYsmnrg8hq?UAEk*`;~hMgR8g!&
zG^f+Up#}99GV_2B4Ire><ZiZYyhHna;j9UxP^O^?x3^ERLlYJpJv-|W{t2lT$THD5
z>3jt;l<(JbZ$aCvhrh2T3WpImrdkY1BMRz#X1%gc+C5*&2Ylp08tJaFY`blnZy7`>
z?j=ef(PU<wce6;+hMa0KgS1}gtv3A+S){$fONol0GZ*r^fG=pE{xQ*C-kb3{ixXus
zOGAgOF_iv+`O_<Jx0{BAUPA#v7k<BOlZS(A3Mf@X%qK_Hv~BdEm-POu&wx+tq~d)S
z0&zVXG_kjNE$0?^?%0!z$S!w~)TNVml^_j=OXhkW*V%yY6h>-Be49yBQ*a6BNzZXq
z@^*e&nzci`-LPGE09|+zyp_caw8{YcDS9>-8UQRFJRGxL;GO=ovC*gFC-&og#Vuv6
z`D5U-J$NcCUiMk6Fy_y0uS3Gn7_IyCfU?s;f4*}sJ@#I}gqC_$;(`C(%%x45zvdJa
zyn)Wn^!nY>c#!lXnxbzAo~ZkG${TRc^A=7?6~KpgCz@O=6x3Hw_sVjlqcQz~vv0ks
zKA1L89?Je{ShT6M^*Dk`Gxe88Ai)bP5BEL|gonep<eoh@8U4Pf{+oWK$2fx|G^m`=
z+;vlO(Lj!>eZ5H7)iPblW)vA))%`}pF_42a9HXdJ`SdXK0V4Ptam3Bz{yNm(8)rno
z4cV1v-n>uJo>p*-c-3SZon3zFdCXm~F~sF`x^BF<xlRM`7#v5tX6yo~3Y;FQ(_=iG
zaPw=+ON##YkFgE{?~bBIpbAMO;+JcRS;S%4+eVg!mnT2ANm_sVp7V&*ZU1g=$j@sh
zks}8>e@K-lc?a$9cscFRyGx^nOiWBxU+=73eJK-}?y~5ZS=E-VRvK%d?w#-Vi1`5D
zhZ?K)i&%Tw?RJqD;L{gid=Qgx!lgx|+Q96`KRunF=vLJl%4%&`beI|Ap`>%35hZ<V
z>@CkINV=ur9+WUJ%E2c225r{b^?rYgSM1Ug;*7O!SG(=lNg|HEHJiBIB}HzdhXEis
znYL#^sNCe{pB_I8^?ohXD|R*A=S*=SjD=^KVN9f2TNk<~Xys{|uSp(z3Sq#D!P0pL
z7ss_z%=j?r{=QDMSA~_D>Sru77G~`lBAz}3-ynjt4k){`+w|_ep1XsrWWfkDt@?oQ
zIH;EZ!!d*Vl~i)W9gklrzZv_gvRGE_v4@OShfl5z)QXU@YQ8hzY&~ynFO|Wwu2?%%
zuKTD{<Kp!GMC#rW`Z)1Vx`tBJl5P}0>-4(v)1kMVsNNb@>GA)Tm(FoX7;K1yU_`u$
zzxevuhjQK<?!Mz8XLjt*v<F3pxf0VPK&4iL!)6wrEw64q{d9MC`Eu{L=px%s*YAC}
ze&~8dYQEm|r7DN+yeU|c47N~#WtpLo>#FH2m$){2tUvk3BKE7_;S6t2;2}sltVhfY
z-O`*Z{Bm0ijPpPRufqavrbQQK?-Xx8q*E`KHr>em^kz<(_KkbpKIwE9txO4D=FzgV
z`=N(ASn+|@10Q-K_pE<ww!@dvGP-lcdz0)|8|`|{|5K}EK6}kP1<VHC&|I`jVZ+Nm
zTb&%uwxqtyvELNE?{x0%Ydr?#hF4ywfWv%;0Eb}O^k1>36wc^P(O?D#cC3KIjNJyt
zbHUNl7zNztx;3J!3{*}wIEVue63{#2198a$G2oUR(Dp1yAlos{W;kUl;lZV0QNI+p
z+Yc-nAj#Nit2EK!O;_YPh21UZeJ%o5in4~jf*3xF!()R_XX@TBC+`S@mfps(gIypH
z0X#y)*bbB^fYI9pbU{~-V=$Bp+%67s3NXzq=wLXs=7fX^u>J>eKm2E8b6QvT@VWS8
Q;2~!Wp00i_>zopr03T@3Hvj+t


From eb5c2816d500d99ebc2974f255cce82e50a153fc Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Mon, 25 Sep 2023 11:55:28 +0200
Subject: [PATCH 0767/1398] Adapted clip button to a toggle behaviour

---
 .../Plugins/PCA/Clipping_box_plugin.cpp       | 52 +++++++++++++++++--
 .../demo/Polyhedron/Scene_image_item.cpp      |  1 +
 2 files changed, 49 insertions(+), 4 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
index 062e993b175d..9753e4e2f11f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
@@ -64,10 +64,14 @@ public Q_SLOTS:
   void tab_change();
 private:
   bool eventFilter(QObject *, QEvent *);
+  bool process_event_clip_box(QEvent *);
+  bool process_event_clip_orthographic(QEvent *);
+  void do_clip(bool);
   QAction* actionClipbox;
   ClipWidget* dock_widget;
   Scene_edit_box_item* item;
   bool shift_pressing;
+  bool clipping;
   Selection_visualizer* visualizer;
 }; // end Clipping_box_plugin
 
@@ -96,6 +100,7 @@ void Clipping_box_plugin::init(QMainWindow* mainWindow, CGAL::Three::Scene_inter
           this, SLOT(connectNewViewer(QObject*)));
   visualizer = nullptr;
   shift_pressing = false;
+  clipping = false;
 }
 
 void Clipping_box_plugin::clipbox()
@@ -148,6 +153,25 @@ void Clipping_box_plugin::enableAction() {
 }
 
 void Clipping_box_plugin::clip(bool b)
+{
+  clipping = b;
+  if (b)
+  {
+    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+    {
+      v->installEventFilter(this);
+    }
+  }
+  else {
+    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+    {
+      v->removeEventFilter(this);
+    }
+  }
+  do_clip(b);
+}
+
+void Clipping_box_plugin::do_clip(bool b)
 {
   typedef CGAL::Epick Kernel;
   typedef CGAL::Polyhedron_3<Kernel> Mesh;
@@ -231,12 +255,20 @@ void Clipping_box_plugin::tab_change()
 
 }
 
-bool Clipping_box_plugin::eventFilter(QObject *, QEvent *event) {
-  static QImage background;
-  if (dock_widget->isHidden() || !(dock_widget->isActiveWindow()) || dock_widget->tabWidget->currentIndex() != 1
-      || (dock_widget->tabWidget->currentIndex() == 1 && !dock_widget->clipButton->isChecked()))
+bool Clipping_box_plugin::process_event_clip_box(QEvent *event)
+{
+  if (event->type() == QEvent::MouseButtonRelease)
+  {
+//    item->itemChanged();
+    do_clip(clipping);
     return false;
+  }
+  return false;
+}
 
+bool Clipping_box_plugin::process_event_clip_orthographic(QEvent *event)
+{
+  static QImage background;
   if(event->type() == QEvent::KeyPress || event->type() == QEvent::KeyRelease)
   {
     QKeyEvent *keyEvent = static_cast<QKeyEvent*>(event);
@@ -359,4 +391,16 @@ bool Clipping_box_plugin::eventFilter(QObject *, QEvent *event) {
   }
   return false;
 }
+
+bool Clipping_box_plugin::eventFilter(QObject *, QEvent *event) {
+  if (dock_widget->isHidden() || !dock_widget->isActiveWindow())
+    return false;
+  if (dock_widget->tabWidget->currentIndex() == 0 && dock_widget->pushButton->isChecked())
+    return process_event_clip_box(event);
+  else if (dock_widget->tabWidget->currentIndex() == 1 && dock_widget->clipButton->isChecked())
+    return process_event_clip_orthographic(event);
+  else
+    return false;
+
+}
 #include "Clipping_box_plugin.moc"
diff --git a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
index bdcf80a5091c..c5770c8adab5 100644
--- a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
@@ -756,6 +756,7 @@ void Scene_image_item::drawEdges(Viewer_interface *viewer) const
     getEdgeContainer(0)->setWidth(3.0f);
   }
   getEdgeContainer(0)->setColor(QColor(Qt::black));
+  getEdgeContainer(0)->setClipping(false);
   viewer->glDepthRangef(0.00001f, 0.99999f);
   getEdgeContainer(0)->draw(viewer, true);
   viewer->glDepthRangef(0.0f, 1.0f);

From 1d29a75c9a36cc7c0bb2f6867f99b4ecaa138416 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Mon, 25 Sep 2023 16:09:41 +0200
Subject: [PATCH 0768/1398] iformat/oformat are in CGAL::IO

The calls without the `IO::` namespace are deprecated.
---
 .../include/CGAL/Curved_kernel_via_analysis_2/Point_2.h   | 8 ++++----
 Mesh_2/include/CGAL/IO/File_poly.h                        | 2 +-
 Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h              | 4 ++--
 Point_set_processing_3/include/CGAL/IO/read_xyz_points.h  | 6 +++---
 Stream_support/include/CGAL/IO/PLY/PLY_reader.h           | 2 +-
 Stream_support/include/CGAL/IO/STL/STL_reader.h           | 2 +-
 Stream_support/include/CGAL/IO/VTK.h                      | 2 +-
 .../include/CGAL/Constrained_triangulation_2.h            | 2 +-
 .../internal/Polyline_constraint_hierarchy_2.h            | 8 ++++----
 9 files changed, 18 insertions(+), 18 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
index 789f24b841e4..f64c67b70eac 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
@@ -736,13 +736,13 @@ class Point_2 :
     swallow(is, '(');
 
     // read values
-    is >> iformat(rep._m_xy);
+    is >> IO::iformat(rep._m_xy);
     swallow(is, ',');
-    is >> iformat(rep._m_x);
+    is >> IO::iformat(rep._m_x);
     swallow(is, ',');
-    is >> iformat(rep._m_curve);
+    is >> IO::iformat(rep._m_curve);
     swallow(is, ',');
-    is >> iformat(rep._m_arcno);
+    is >> IO::iformat(rep._m_arcno);
     swallow(is, ',');
     is >> rep._m_location;
 
diff --git a/Mesh_2/include/CGAL/IO/File_poly.h b/Mesh_2/include/CGAL/IO/File_poly.h
index 9f3002c32f05..0c5704cae342 100644
--- a/Mesh_2/include/CGAL/IO/File_poly.h
+++ b/Mesh_2/include/CGAL/IO/File_poly.h
@@ -43,7 +43,7 @@ read_triangle_poly_file(CDT& t, std::istream &f,
     {
       unsigned int j;
       double x, y;
-      f >> j >> iformat(x) >> iformat(y);
+      f >> j >> IO::iformat(x) >> IO::iformat(y);
       Point p(x, y);
       skip_until_EOL(f); skip_comment_OFF(f);
       vertices[--j] = t.insert(p);
diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
index b4e2af503757..88a6e8ef555b 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_3.h
@@ -1148,9 +1148,9 @@ number_of_bad_elements_impl()
         const Subdomain mc_subdomain = this->r_oracle_.is_in_domain_object()(this->r_tr_.dual(mc));
 
         std::cerr << "*** Is in complex? c is marked in domain: " << this->r_c3t3_.is_in_complex(c)
-          << " / c is really in subdomain: " << oformat(c_subdomain)
+          << " / c is really in subdomain: " << IO::oformat(c_subdomain)
           << " / mc is marked in domain: " << this->r_c3t3_.is_in_complex(mc)
-          << " / mc is really in subdomain: " << oformat(mc_subdomain)
+          << " / mc is really in subdomain: " << IO::oformat(mc_subdomain)
           << std::endl;
 
 
diff --git a/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h b/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h
index b930b167d093..ba023110950f 100644
--- a/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h
@@ -134,15 +134,15 @@ bool read_XYZ(std::istream& is,
     {
       iss.clear();
       iss.str(line);
-      if (iss >> iformat(x) >> iformat(y) >> iformat(z))
+      if (iss >> IO::iformat(x) >> IO::iformat(y) >> IO::iformat(z))
       {
         Point point(x,y,z);
         Vector normal = CGAL::NULL_VECTOR;
         // ... + normal...
-        if (iss >> iformat(nx))
+        if (iss >> IO::iformat(nx))
         {
           // In case we could read one number, we expect that there are two more
-          if(iss >> iformat(ny) >> iformat(nz)){
+          if(iss >> IO::iformat(ny) >> IO::iformat(nz)){
             normal = Vector(nx,ny,nz);
           } else {
             std::cerr << "Error line " << lineNumber << " of file (incomplete normal coordinates)" << std::endl;
diff --git a/Stream_support/include/CGAL/IO/PLY/PLY_reader.h b/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
index a4a50bd36c8c..ee8b18ef59c0 100644
--- a/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
+++ b/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
@@ -201,7 +201,7 @@ class PLY_read_number
 
   void read_ascii(std::istream& stream, double& t) const
   {
-    if(!(stream >> iformat(t)))
+    if(!(stream >> IO::iformat(t)))
       stream.clear(std::ios::badbit);
   }
 
diff --git a/Stream_support/include/CGAL/IO/STL/STL_reader.h b/Stream_support/include/CGAL/IO/STL/STL_reader.h
index 16970596d098..a47872f44705 100644
--- a/Stream_support/include/CGAL/IO/STL/STL_reader.h
+++ b/Stream_support/include/CGAL/IO/STL/STL_reader.h
@@ -75,7 +75,7 @@ bool read_ASCII_facet(std::istream& is,
         return false;
       }
 
-      if(!(is >> iformat(x) >> iformat(y) >> iformat(z)))
+      if(!(is >> IO::iformat(x) >> IO::iformat(y) >> IO::iformat(z)))
       {
         if(verbose)
           std::cerr << "Error while reading point coordinates (premature end of file)" << std::endl;
diff --git a/Stream_support/include/CGAL/IO/VTK.h b/Stream_support/include/CGAL/IO/VTK.h
index 8878fde1523a..585cc9d96854 100644
--- a/Stream_support/include/CGAL/IO/VTK.h
+++ b/Stream_support/include/CGAL/IO/VTK.h
@@ -199,7 +199,7 @@ void write_soup_points_tag(std::ostream& os,
   {
     os << "\">\n";
     for(const Point& p : points)
-      os << oformat(p.x()) << " " << oformat(p.y()) << " " << oformat(p.z()) << " ";
+      os << IO::oformat(p.x()) << " " << IO::oformat(p.y()) << " " << IO::oformat(p.z()) << " ";
     os << "      </DataArray>\n";
   }
   os << "    </Points>\n";
diff --git a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
index 4ce20796d1ab..048b373187eb 100644
--- a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
@@ -623,7 +623,7 @@ insert_constraint(Vertex_handle  vaa, Vertex_handle vbb, OutputIterator out)
   auto display_vertex(Vertex_handle v) const {
     With_point_tag point_tag;
     using CGAL::IO::oformat;
-    return oformat(v, point_tag);
+    return IO::oformat(v, point_tag);
   }
 #endif // CGAL_CDT_2_DEBUG_INTERSECTIONS
 
diff --git a/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h b/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
index b8bcaac8f18a..21144872845c 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2/internal/Polyline_constraint_hierarchy_2.h
@@ -865,7 +865,7 @@ insert_constraint(T va, T vb){
   using CGAL::IO::oformat;
   std::cerr << CGAL::internal::cdt_2_indent_level
             << "C_hierachy.insert_constraint( "
-            << oformat(va) << ", " << oformat(vb) << ")\n";
+            << IO::oformat(va) << ", " << IO::oformat(vb) << ")\n";
 #endif // CGAL_CDT_2_DEBUG_INTERSECTIONS
   typename Sc_to_c_map::iterator scit = sc_to_c_map.find(he);
   if(scit == sc_to_c_map.end()){
@@ -900,7 +900,7 @@ insert_constraint_old_API(T va, T vb){
   using CGAL::IO::oformat;
   std::cerr << CGAL::internal::cdt_2_indent_level
             << "C_hierachy.insert_constraint_old_API( "
-            << oformat(va) << ", " << oformat(vb) << ")\n";
+            << IO::oformat(va) << ", " << IO::oformat(vb) << ")\n";
 #endif // CGAL_CDT_2_DEBUG_INTERSECTIONS
   typename Sc_to_c_map::iterator scit = sc_to_c_map.find(he);
   if(scit == sc_to_c_map.end()){
@@ -933,7 +933,7 @@ append_constraint(Constraint_id cid, T va, T vb){
   using CGAL::IO::oformat;
   std::cerr << CGAL::internal::cdt_2_indent_level
             << "C_hierachy.append_constraint( ..., "
-            << oformat(va) << ", " << oformat(vb) << ")\n";
+            << IO::oformat(va) << ", " << IO::oformat(vb) << ")\n";
 #endif // CGAL_CDT_2_DEBUG_INTERSECTIONS
   typename Sc_to_c_map::iterator scit = sc_to_c_map.find(he);
   if(scit == sc_to_c_map.end()){
@@ -1050,7 +1050,7 @@ add_Steiner(T va, T vb, T vc){
   using CGAL::IO::oformat;
   std::cerr << CGAL::internal::cdt_2_indent_level
             << "C_hierachy.add_Steinter( "
-            << oformat(va) << ", " << oformat(vb) << ", " << oformat(vc)
+            << IO::oformat(va) << ", " << IO::oformat(vb) << ", " << IO::oformat(vc)
             << ")\n";
 #endif // CGAL_CDT_2_DEBUG_INTERSECTIONS
   Context_list* hcl=nullptr;

From eadd12cdb0e5545494e78946403fb7649fb611a6 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 25 Sep 2023 15:14:43 +0100
Subject: [PATCH 0769/1398] reindent

---
 .../CGAL/Variational_shape_approximation.h    | 108 +++++++++---------
 1 file changed, 54 insertions(+), 54 deletions(-)

diff --git a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
index d24ecb93ffa5..13e2e29944b8 100644
--- a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
+++ b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
@@ -1904,64 +1904,64 @@ class Variational_shape_approximation {
       if_subdivide = true;
     }
     else {
-        FT dist_max(0.0);
-        Vector_3 chord_vec = vector_functor(pt_begin, pt_end);
-        const FT chord_len = CGAL::approximate_sqrt(chord_vec.squared_length());
-        bool degenerate_chord = false;
-        if (chord_len > FT(0.0)) {
-          Segment_3 seg(pt_begin, pt_end);
-            chord_vec = scale_functor(chord_vec, FT(1.0) / chord_len);
-            for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
-              //Vector_3 vec = vector_functor(pt_begin, m_vpoint_map[target(*citr, *m_ptm)]);
-              //vec = cross_product_functor(chord_vec, vec);
-              //const FT dist = CGAL::approximate_sqrt(vec.squared_length());
-              const FT dist = CGAL::approximate_sqrt(CGAL::squared_distance(m_vpoint_map[target(*citr, *m_ptm)], seg));
-                if (dist > dist_max) {
-                    chord_max = citr;
-                    dist_max = dist;
-                }
-            }
+      FT dist_max(0.0);
+      Vector_3 chord_vec = vector_functor(pt_begin, pt_end);
+      const FT chord_len = CGAL::approximate_sqrt(chord_vec.squared_length());
+      bool degenerate_chord = false;
+      if (chord_len > FT(0.0)) {
+        Segment_3 seg(pt_begin, pt_end);
+        chord_vec = scale_functor(chord_vec, FT(1.0) / chord_len);
+        for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
+          //Vector_3 vec = vector_functor(pt_begin, m_vpoint_map[target(*citr, *m_ptm)]);
+          //vec = cross_product_functor(chord_vec, vec);
+          //const FT dist = CGAL::approximate_sqrt(vec.squared_length());
+          const FT dist = CGAL::approximate_sqrt(CGAL::squared_distance(m_vpoint_map[target(*citr, *m_ptm)], seg));
+          if (dist > dist_max) {
+            chord_max = citr;
+            dist_max = dist;
+          }
         }
-        else {
-            degenerate_chord = true;
-            for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
-                const FT dist = CGAL::approximate_sqrt(CGAL::squared_distance(
-                    pt_begin, m_vpoint_map[target(*citr, *m_ptm)]));
-                if (dist > dist_max) {
-                    chord_max = citr;
-                    dist_max = dist;
-                }
-            }
+      }
+      else {
+        degenerate_chord = true;
+        for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
+          const FT dist = CGAL::approximate_sqrt(CGAL::squared_distance(
+                                                                        pt_begin, m_vpoint_map[target(*citr, *m_ptm)]));
+          if (dist > dist_max) {
+            chord_max = citr;
+            dist_max = dist;
+          }
         }
+      }
 
-        FT criterion = dist_max;
-        if (relative_to_chord && !degenerate_chord)
-            criterion /= chord_len;
-        else
-            criterion /= m_average_edge_length;
-
-        if (with_dihedral_angle) {
-            // suppose the proxy normal angle is acute
-            std::size_t px_left = get(m_fproxy_map, face(he_first, *m_ptm));
-            std::size_t px_right = px_left;
-            if (!CGAL::is_border(opposite(he_first, *m_ptm), *m_ptm))
-                px_right = get(m_fproxy_map, face(opposite(he_first, *m_ptm), *m_ptm));
-            FT norm_sin(1.0);
-            if (!CGAL::is_border(opposite(he_first, *m_ptm), *m_ptm)) {
-                Vector_3 vec = cross_product_functor(
-                    m_px_planes[px_left].normal, m_px_planes[px_right].normal);
-                norm_sin = CGAL::approximate_sqrt(vec.squared_length());
-            }
-            criterion *= norm_sin;
-        }
-        if (is_boundary) {
-            if (criterion > boundary_subdivision_ratio)
-                if_subdivide = true;
-        }
-        else {
-            if (criterion > subdivision_ratio)
-                if_subdivide = true;
+      FT criterion = dist_max;
+      if (relative_to_chord && !degenerate_chord)
+        criterion /= chord_len;
+      else
+        criterion /= m_average_edge_length;
+
+      if (with_dihedral_angle) {
+        // suppose the proxy normal angle is acute
+        std::size_t px_left = get(m_fproxy_map, face(he_first, *m_ptm));
+        std::size_t px_right = px_left;
+        if (!CGAL::is_border(opposite(he_first, *m_ptm), *m_ptm))
+          px_right = get(m_fproxy_map, face(opposite(he_first, *m_ptm), *m_ptm));
+        FT norm_sin(1.0);
+        if (!CGAL::is_border(opposite(he_first, *m_ptm), *m_ptm)) {
+          Vector_3 vec = cross_product_functor(
+                                               m_px_planes[px_left].normal, m_px_planes[px_right].normal);
+          norm_sin = CGAL::approximate_sqrt(vec.squared_length());
         }
+        criterion *= norm_sin;
+      }
+      if (is_boundary) {
+        if (criterion > boundary_subdivision_ratio)
+          if_subdivide = true;
+      }
+      else {
+        if (criterion > subdivision_ratio)
+          if_subdivide = true;
+      }
     }
     if (if_subdivide) {
       // subdivide at the most remote vertex

From ebdfddbf5b6aff091c6a725b82d667205b2dfdf5 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Mon, 25 Sep 2023 16:30:47 +0200
Subject: [PATCH 0770/1398] add a link to TBB

---
 Mesh_3/examples/Mesh_3/CMakeLists.txt | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Mesh_3/examples/Mesh_3/CMakeLists.txt b/Mesh_3/examples/Mesh_3/CMakeLists.txt
index 0b59088e04a2..31ab08db7e8e 100644
--- a/Mesh_3/examples/Mesh_3/CMakeLists.txt
+++ b/Mesh_3/examples/Mesh_3/CMakeLists.txt
@@ -198,6 +198,7 @@ if(CGAL_ACTIVATE_CONCURRENT_MESH_3 AND TARGET CGAL::TBB_support)
     target
     mesh_3D_image
     mesh_3D_weighted_image
+    mesh_3D_weighted_image_with_detection_of_features
     mesh_3D_image_variable_size
     mesh_3D_image_with_custom_initialization
     mesh_3D_gray_image_with_custom_initialization

From 0c090b80e2fab579cec0fc116edcd9797c3fc459 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Mon, 25 Sep 2023 17:13:56 +0200
Subject: [PATCH 0771/1398] Disabled tetrahedra clip plane when clipping box is
 active

---
 .../Polyhedron/Scene_triangulation_3_item.cpp | 100 +++++++++++++++++-
 .../Polyhedron/Scene_triangulation_3_item.h   |   4 +
 2 files changed, 100 insertions(+), 4 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
index 91e88fb6ae22..84f6daae4300 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
@@ -1,7 +1,9 @@
+#include "Scene.h"
 #include "config.h"
 #include "Scene_triangulation_3_item.h"
 #include "Scene_surface_mesh_item.h"
 #include "Scene_spheres_item.h"
+#include "Plugins/PCA/Scene_edit_box_item.h"
 
 #include <QVector>
 #include <QColor>
@@ -20,6 +22,7 @@
 #include <unordered_map>
 #include <bitset>
 
+#include <CGAL/Three/Scene_item.h>
 #include <CGAL/Three/Scene_interface.h>
 #include <CGAL/Three/Triangle_container.h>
 #include <CGAL/Three/Edge_container.h>
@@ -179,7 +182,15 @@ public :
     QVector4D cp = cgal_plane_to_vector4d(plane);
     getEdgeContainer(0)->setPlane(cp);
     getEdgeContainer(0)->setColor(QColor(Qt::black));
-    getEdgeContainer(0)->draw(viewer, true);
+    if (!cut_edges) {
+      bool clipping = getEdgeContainer(0)->getClipping();
+      getEdgeContainer(0)->setClipping(false);
+      getEdgeContainer(0)->draw(viewer, true);
+      getEdgeContainer(0)->setClipping(clipping);
+    }
+    else {
+      getEdgeContainer(0)->draw(viewer, true);
+    }
 
   }
 
@@ -278,6 +289,10 @@ public :
     m_alpha = a / 255.0f;
     redraw();
   }
+  void setCutEdges(bool b)
+  {
+    cut_edges = b;
+  }
 private:
 
   //contains the data
@@ -290,6 +305,8 @@ public :
   mutable bool is_fast;
   mutable QSlider* alphaSlider;
   mutable float m_alpha ;
+
+  bool cut_edges;
 }; //end of class Scene_triangle_item
 
 
@@ -436,6 +453,25 @@ struct Scene_triangulation_3_item_priv {
   Scene_spheres_item *spheres;
   std::vector<Tr::Vertex> tr_vertices;
   Scene_intersection_item *intersection;
+  void set_intersection_enabled(bool b)
+  {
+    if (intersection)
+      intersection->setVisible(b);
+  }
+  bool is_intersection_enabled()
+  {
+    if (intersection)
+      return intersection->visible();
+    else
+      return false;
+  }
+  bool is_item_clip_box(int id)
+  {
+    if(dynamic_cast<Scene_edit_box_item*>(CGAL::Three::Three::scene()->item(id)))
+      return true;
+    else
+      return false;
+  }
   bool spheres_are_shown;
   const Scene_item* data_item_;
   QPixmap histogram_;
@@ -497,6 +533,7 @@ struct Scene_triangulation_3_item_priv {
   bool show_tetrahedra;
   bool is_aabb_tree_built;
   bool last_intersection;
+  bool cut_edges;
 
   void push_normal(std::vector<float>& normals, const EPICK::Vector_3& n) const
   {
@@ -550,6 +587,14 @@ void Scene_triangulation_3_item::common_constructor(bool display_elements)
   {
     v->installEventFilter(this);
   }
+  for(int i = 0, end = scene->numberOfEntries();
+       i < end; ++i)
+  {
+    if (d->is_item_clip_box(i))
+      d->set_intersection_enabled(false);
+  }
+  connect(static_cast<Scene*>(CGAL::Three::Three::scene()), SIGNAL(newItem(int)), this, SLOT(check_new_item(int)));
+  connect(static_cast<Scene*>(CGAL::Three::Three::scene()), SIGNAL(indexErased(Scene_interface::Item_id)), this, SLOT(check_deleted_item(Scene_interface::Item_id)));
 }
 Scene_triangulation_3_item::Scene_triangulation_3_item(bool display_elements)
   : Scene_group_item("unnamed")
@@ -602,6 +647,20 @@ Scene_triangulation_3_item::data_item_destroyed()
   set_data_item(NULL);
 }
 
+void
+Scene_triangulation_3_item::check_new_item(int id)
+{
+  if (d->is_item_clip_box(id))
+    d->set_intersection_enabled(false);
+}
+
+void
+Scene_triangulation_3_item::check_deleted_item(Scene_interface::Item_id id)
+{
+  if (d->is_item_clip_box(id))
+    d->set_intersection_enabled(true);
+}
+
 const T3&
 Scene_triangulation_3_item::triangulation() const {
   return d->triangulation;
@@ -913,6 +972,8 @@ Scene_triangulation_3_item_priv::compute_color_map(const QColor& c)
 
 Geom_traits::Plane_3 Scene_triangulation_3_item::plane(CGAL::qglviewer::Vec offset) const
 {
+  if (!d->is_intersection_enabled())
+    return Geom_traits::Plane_3(1.0, 0.0, 0.0, std::numeric_limits<float>::max());
   const CGAL::qglviewer::Vec& pos = d->frame->position() - offset;
   const CGAL::qglviewer::Vec& n =
     d->frame->inverseTransformOf(CGAL::qglviewer::Vec(0.f, 0.f, 1.f));
@@ -1018,7 +1079,7 @@ void Scene_triangulation_3_item::draw(CGAL::Three::Viewer_interface* viewer) con
       d->spheres->setPlane(this->plane());
     }
   }
-  if(d->is_grid_shown)
+  if(d->is_grid_shown && d->is_intersection_enabled())
   {
 
     getEdgeContainer(Grid_edges)->setColor(QColor(Qt::black));
@@ -1026,7 +1087,11 @@ void Scene_triangulation_3_item::draw(CGAL::Three::Viewer_interface* viewer) con
     for (int i = 0; i<16; i++)
       f_mat.data()[i] = static_cast<float>(d->frame->matrix()[i]);
     getEdgeContainer(Grid_edges)->setFrameMatrix(f_mat);
+    // always draw plane (disable clipping)
+    bool clipping = getEdgeContainer(Grid_edges)->getClipping();
+    getEdgeContainer(Grid_edges)->setClipping(false);
     getEdgeContainer(Grid_edges)->draw(viewer, true);
+    getEdgeContainer(Grid_edges)->setClipping(clipping);
   }
 }
 
@@ -1056,14 +1121,18 @@ void Scene_triangulation_3_item::drawEdges(CGAL::Three::Viewer_interface* viewer
       computeElements();
       initializeBuffers(viewer);
     }
-    if(renderingMode() == Wireframe && d->is_grid_shown)
+    if(renderingMode() == Wireframe && d->is_grid_shown && d->is_intersection_enabled())
     {
      getEdgeContainer(Grid_edges)->setColor(QColor(Qt::black));
       QMatrix4x4 f_mat;
       for (int i = 0; i<16; i++)
         f_mat.data()[i] = static_cast<float>(d->frame->matrix()[i]);
       getEdgeContainer(Grid_edges)->setFrameMatrix(f_mat);
+      // always draw plane (disable clipping)
+      bool clipping = getEdgeContainer(Grid_edges)->getClipping();
+      getEdgeContainer(Grid_edges)->setClipping(false);
       getEdgeContainer(Grid_edges)->draw(viewer, true);
+      getEdgeContainer(Grid_edges)->setClipping(clipping);
     }
 
     QVector4D cp = cgal_plane_to_vector4d(this->plane());
@@ -1079,7 +1148,15 @@ void Scene_triangulation_3_item::drawEdges(CGAL::Three::Viewer_interface* viewer
     getEdgeContainer(T3_edges)->setPlane(cp);
     getEdgeContainer(T3_edges)->setIsSurface(is_surface());
     getEdgeContainer(T3_edges)->setColor(QColor(Qt::black));
-    getEdgeContainer(T3_edges)->draw(viewer, true);
+    if (!d->cut_edges) {
+      bool clipping = getEdgeContainer(T3_edges)->getClipping();
+      getEdgeContainer(T3_edges)->setClipping(false);
+      getEdgeContainer(T3_edges)->draw(viewer, true);
+      getEdgeContainer(T3_edges)->setClipping(clipping);
+    }
+    else {
+      getEdgeContainer(T3_edges)->draw(viewer, true);
+    }
 
     if(d->show_tetrahedra){
       if(!d->frame->isManipulated())
@@ -1217,6 +1294,14 @@ QMenu* Scene_triangulation_3_item::contextMenu()
               this, SLOT(show_spheres(bool)));
     }
 
+    QAction* actionToggleCutEdges =
+        menu->addAction(tr("Cut &edges"));
+    actionToggleCutEdges->setCheckable(true);
+    actionToggleCutEdges->setChecked(true);
+    actionToggleCutEdges->setObjectName("actionToggleCutEdges");
+    connect(actionToggleCutEdges, SIGNAL(toggled(bool)),
+            this, SLOT(set_cut_edge(bool)));
+
     menu->setProperty(prop_name, true);
   }
   return menu;
@@ -2081,5 +2166,12 @@ void Scene_triangulation_3_item::computeIntersection()
   }
 }
 
+void Scene_triangulation_3_item::set_cut_edge(bool b)
+{
+  d->cut_edges = b;
+  d->intersection->setCutEdges(b);
+  Q_EMIT redraw();
+}
+
 #include "Scene_triangulation_3_item.moc"
 
diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
index 8cd2b81bd126..33a2cd8f124b 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
@@ -121,6 +121,9 @@ using namespace CGAL::Three;
 
   void data_item_destroyed();
 
+  void check_new_item(int id);
+  void check_deleted_item(Scene_interface::Item_id id);
+
   void reset_spheres();
 
   void reset_intersection_item();
@@ -128,6 +131,7 @@ using namespace CGAL::Three;
   void show_grid(bool b);
   void show_spheres(bool b);
   void computeIntersection();
+  void set_cut_edge(bool b);
 
   virtual QPixmap graphicalToolTip() const Q_DECL_OVERRIDE;
 

From aad5976559a333bbbf4b3ddd8476c0404c03e831 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 25 Sep 2023 16:20:25 +0100
Subject: [PATCH 0772/1398] Change default

---
 .../include/CGAL/Variational_shape_approximation.h    | 11 ++++-------
 1 file changed, 4 insertions(+), 7 deletions(-)

diff --git a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
index 13e2e29944b8..ea3896cf1f60 100644
--- a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
+++ b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
@@ -799,7 +799,7 @@ class Variational_shape_approximation {
    *   \cgalParamNBegin{boundary_subdivision_ratio}
    *     \cgalParamDescription{the chord subdivision ratio threshold to the chord length or average edge length for boundary edges}
    *     \cgalParamType{`geom_traits::FT`}
-   *     \cgalParamDefault{`5.0`}
+   *     \cgalParamDefault{`subdivision_ratio`}
    *   \cgalParamNEnd
    *
    *   \cgalParamNBegin{relative_to_chord}
@@ -840,7 +840,7 @@ class Variational_shape_approximation {
     using parameters::choose_parameter;
 
     const FT subdivision_ratio = choose_parameter(get_parameter(np, internal_np::subdivision_ratio), FT(5.0));
-    const FT boundary_subdivision_ratio = choose_parameter(get_parameter(np, internal_np::boundary_subdivision_ratio), FT(5.0));
+    const FT boundary_subdivision_ratio = choose_parameter(get_parameter(np, internal_np::boundary_subdivision_ratio), subdivision_ratio);
     const bool relative_to_chord = choose_parameter(get_parameter(np, internal_np::relative_to_chord), false);
     const bool with_dihedral_angle = choose_parameter(get_parameter(np, internal_np::with_dihedral_angle), false);
     const bool optimize_anchor_location = choose_parameter(get_parameter(np, internal_np::optimize_anchor_location), true);
@@ -1912,9 +1912,6 @@ class Variational_shape_approximation {
         Segment_3 seg(pt_begin, pt_end);
         chord_vec = scale_functor(chord_vec, FT(1.0) / chord_len);
         for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
-          //Vector_3 vec = vector_functor(pt_begin, m_vpoint_map[target(*citr, *m_ptm)]);
-          //vec = cross_product_functor(chord_vec, vec);
-          //const FT dist = CGAL::approximate_sqrt(vec.squared_length());
           const FT dist = CGAL::approximate_sqrt(CGAL::squared_distance(m_vpoint_map[target(*citr, *m_ptm)], seg));
           if (dist > dist_max) {
             chord_max = citr;
@@ -1926,7 +1923,7 @@ class Variational_shape_approximation {
         degenerate_chord = true;
         for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
           const FT dist = CGAL::approximate_sqrt(CGAL::squared_distance(
-                                                                        pt_begin, m_vpoint_map[target(*citr, *m_ptm)]));
+            pt_begin, m_vpoint_map[target(*citr, *m_ptm)]));
           if (dist > dist_max) {
             chord_max = citr;
             dist_max = dist;
@@ -1949,7 +1946,7 @@ class Variational_shape_approximation {
         FT norm_sin(1.0);
         if (!CGAL::is_border(opposite(he_first, *m_ptm), *m_ptm)) {
           Vector_3 vec = cross_product_functor(
-                                               m_px_planes[px_left].normal, m_px_planes[px_right].normal);
+            m_px_planes[px_left].normal, m_px_planes[px_right].normal);
           norm_sin = CGAL::approximate_sqrt(vec.squared_length());
         }
         criterion *= norm_sin;

From dd36cae7ccd12996d2788f534fd77e2bcd1f57d8 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 25 Sep 2023 16:26:59 +0100
Subject: [PATCH 0773/1398] remove unused variable

---
 .../include/CGAL/Variational_shape_approximation.h               | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
index ea3896cf1f60..23cfab856f61 100644
--- a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
+++ b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
@@ -1910,7 +1910,6 @@ class Variational_shape_approximation {
       bool degenerate_chord = false;
       if (chord_len > FT(0.0)) {
         Segment_3 seg(pt_begin, pt_end);
-        chord_vec = scale_functor(chord_vec, FT(1.0) / chord_len);
         for (Boundary_chord_iterator citr = chord_begin; citr != chord_end; ++citr) {
           const FT dist = CGAL::approximate_sqrt(CGAL::squared_distance(m_vpoint_map[target(*citr, *m_ptm)], seg));
           if (dist > dist_max) {

From c5b2d4d00bfc1f11001f3a42aea122e4c3f02e45 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Tue, 26 Sep 2023 10:12:22 +0200
Subject: [PATCH 0774/1398] Added reset button on clip box

---
 .../Plugins/PCA/Clipping_box_plugin.cpp       |  6 +++
 .../Plugins/PCA/Clipping_box_widget.ui        | 37 +++++++++++++++++++
 .../Plugins/PCA/Scene_edit_box_item.cpp       | 21 +++++++++++
 .../Plugins/PCA/Scene_edit_box_item.h         |  1 +
 4 files changed, 65 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
index 9753e4e2f11f..251c461dd13c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
@@ -135,6 +135,12 @@ void Clipping_box_plugin::clipbox()
   });
   connect(dock_widget->tabWidget, &QTabWidget::currentChanged,
           this, &Clipping_box_plugin::tab_change);
+  connect(dock_widget->resetButton, &QPushButton::clicked,
+          this, [this]()
+  {
+    item->reset();
+    do_clip(true);
+  });
   item->setName("Clipping box");
   item->setRenderingMode(FlatPlusEdges);
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_widget.ui b/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_widget.ui
index 7c79e1421246..e0a2709e2fa8 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_widget.ui
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_widget.ui
@@ -65,6 +65,43 @@
           </item>
          </layout>
         </item>
+        <item>
+         <layout class="QHBoxLayout" name="horizontalLayout_6">
+          <item>
+           <spacer name="horizontalSpacer_6">
+            <property name="orientation">
+             <enum>Qt::Horizontal</enum>
+            </property>
+            <property name="sizeHint" stdset="0">
+             <size>
+              <width>40</width>
+              <height>20</height>
+             </size>
+            </property>
+           </spacer>
+          </item>
+          <item>
+           <widget class="QPushButton" name="resetButton">
+            <property name="text">
+             <string>Reset</string>
+            </property>
+           </widget>
+          </item>
+          <item>
+           <spacer name="horizontalSpacer_7">
+            <property name="orientation">
+             <enum>Qt::Horizontal</enum>
+            </property>
+            <property name="sizeHint" stdset="0">
+             <size>
+              <width>40</width>
+              <height>20</height>
+             </size>
+            </property>
+           </spacer>
+          </item>
+         </layout>
+        </item>
         <item>
          <spacer name="verticalSpacer_2">
           <property name="orientation">
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
index 6dea656ae705..cca910c37768 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
@@ -251,6 +251,22 @@ struct Scene_edit_box_item_priv{
   double applyX(int id, double x, double dirx);
   double applyY(int id, double y, double diry);
   double applyZ(int id, double z, double dirz);
+  void reset_vertices()
+  {
+    Scene_item::Bbox bb = scene->bbox();
+    float eps = 1.e-6;
+    pool[0] = bb.xmin()-eps; pool[3] = bb.xmax()+eps;
+    pool[1] = bb.ymin()-eps; pool[4] = bb.ymax()+eps;
+    pool[2] = bb.zmin()-eps; pool[5] = bb.zmax()+eps;
+    double x=(bb.xmin()+bb.xmax())/2;
+    double y=(bb.ymin()+bb.ymax())/2;
+    double z=(bb.zmin()+bb.zmax())/2;
+    center_ = CGAL::qglviewer::Vec(x,y,z);
+    relative_center_ = CGAL::qglviewer::Vec(0,0,0);
+    const CGAL::qglviewer::Vec offset = static_cast<CGAL::Three::Viewer_interface*>(CGAL::QGLViewer::QGLViewerPool().first())->offset();
+    frame->setPosition(center_+offset);
+    item->invalidateOpenGLBuffers();
+  }
   const Scene_interface* scene;
   Scene_edit_box_item* item;
   QPoint picked_pixel;
@@ -1307,3 +1323,8 @@ void Scene_edit_box_item::connectNewViewer(QObject *o)
     return;
   viewer->setMouseTracking(true);
 }
+
+void Scene_edit_box_item::reset()
+{
+  d->reset_vertices();
+}
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.h b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.h
index 4b95cc4fe739..4d8988955655 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.h
@@ -59,6 +59,7 @@ public Q_SLOTS:
     void highlight(CGAL::Three::Viewer_interface* viewer);
     void clearHL();
     void connectNewViewer(QObject* o);
+    void reset();
 protected:
     friend struct Scene_edit_box_item_priv;
     Scene_edit_box_item_priv* d;

From 384e7fad3865710adbc8af4ecc9910fab86d7799 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Tue, 26 Sep 2023 10:16:17 +0200
Subject: [PATCH 0775/1398] Added epsilon on clipping + try fix test undefined
 reference to Scene_edit_box_item

---
 .../demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp  | 9 +++++----
 .../demo/Polyhedron/Scene_triangulation_3_item.cpp       | 1 -
 Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h  | 1 +
 3 files changed, 6 insertions(+), 5 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
index cca910c37768..91bcde149bab 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
@@ -99,9 +99,10 @@ struct Scene_edit_box_item_priv{
     constraint.setRotationConstraintDirection(CGAL::qglviewer::Vec(.0,.0,.1));
     frame->setConstraint(&constraint);
     //create the sphere model
-    pool[0] = bb.xmin(); pool[3] = bb.xmax();
-    pool[1] = bb.ymin(); pool[4] = bb.ymax();
-    pool[2] = bb.zmin(); pool[5] = bb.zmax();
+    float eps = 1.e-3;
+    pool[0] = bb.xmin()-eps; pool[3] = bb.xmax()+eps;
+    pool[1] = bb.ymin()-eps; pool[4] = bb.ymax()+eps;
+    pool[2] = bb.zmin()-eps; pool[5] = bb.zmax()+eps;
 
     vertex_spheres.resize(0);
     normal_spheres.resize(0);
@@ -254,7 +255,7 @@ struct Scene_edit_box_item_priv{
   void reset_vertices()
   {
     Scene_item::Bbox bb = scene->bbox();
-    float eps = 1.e-6;
+    float eps = 1.e-3;
     pool[0] = bb.xmin()-eps; pool[3] = bb.xmax()+eps;
     pool[1] = bb.ymin()-eps; pool[4] = bb.ymax()+eps;
     pool[2] = bb.zmin()-eps; pool[5] = bb.zmax()+eps;
diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
index 84f6daae4300..7eee6f9c0941 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
@@ -3,7 +3,6 @@
 #include "Scene_triangulation_3_item.h"
 #include "Scene_surface_mesh_item.h"
 #include "Scene_spheres_item.h"
-#include "Plugins/PCA/Scene_edit_box_item.h"
 
 #include <QVector>
 #include <QColor>
diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
index 33a2cd8f124b..89f0e38d3d9f 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
@@ -2,6 +2,7 @@
 #define SCENE_TRIANGULATION_3_ITEM_H
 
 #include "Scene_triangulation_3_item_config.h"
+#include "Plugins/PCA/Scene_edit_box_item.h"
 #include "T3_type.h"
 
 #include <QVector>

From aa125fe1db50094568a95beb2026f780660cb4bb Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Tue, 26 Sep 2023 10:48:21 +0200
Subject: [PATCH 0776/1398] Quick fix : Made images draw surfaces even if they
 are inside

---
 Polyhedron/demo/Polyhedron/Scene_image_item.cpp | 10 +---------
 1 file changed, 1 insertion(+), 9 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
index bdcf80a5091c..3a2847dfba96 100644
--- a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
@@ -114,15 +114,7 @@ is_vertex_active(std::size_t i, std::size_t j, std::size_t k) const
   Word_type v7 = image_data(i    , j    , k-dz_);
   Word_type v8 = image_data(i    , j    , k  );
 
-  // don't draw interior vertices
-  if ( v1 != 0 && v2 != 0 && v3 != 0 && v4 != 0 &&
-       v5 != 0 && v6 != 0 && v7 != 0 && v8 != 0 )
-  {
-    return false;
-  }
-
-  return ( v1 != 0 || v2 != 0 || v3 != 0 || v4 != 0 ||
-           v5 != 0 || v6 != 0 || v7 != 0 || v8 != 0 );
+  return v1 != v2 || v1 != v3 || v1 != v4 || v1 != v5 || v1 != v6 || v1 != v7 || v1 != v8;
 }
 template <typename Word_type>
 const QColor&

From c8545e8f0605a82574810009082c809211a033e2 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Tue, 26 Sep 2023 12:14:52 +0200
Subject: [PATCH 0777/1398] Add link to scene_edit_box_item + small fix of
 triangulation_3 cut plane

---
 Polyhedron/demo/Polyhedron/CMakeLists.txt                 | 2 +-
 Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp | 8 ++++----
 Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h   | 1 -
 3 files changed, 5 insertions(+), 6 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/CMakeLists.txt b/Polyhedron/demo/Polyhedron/CMakeLists.txt
index 325a670e8096..ecab2ece7fd0 100644
--- a/Polyhedron/demo/Polyhedron/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/CMakeLists.txt
@@ -236,7 +236,7 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   add_item(scene_c3t3_item Scene_c3t3_item.cpp)
   target_link_libraries(
     scene_c3t3_item PUBLIC scene_triangulation_3_item
-    scene_surface_mesh_item scene_polygon_soup_item
+    scene_surface_mesh_item scene_polygon_soup_item scene_edit_box_item
     scene_basic_objects ${TBB_LIBRARIES})
 
   if(TARGET CGAL::TBB_support)
diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
index 7eee6f9c0941..04d0d44c58e3 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
@@ -3,6 +3,7 @@
 #include "Scene_triangulation_3_item.h"
 #include "Scene_surface_mesh_item.h"
 #include "Scene_spheres_item.h"
+#include "Plugins/PCA/Scene_edit_box_item.h"
 
 #include <QVector>
 #include <QColor>
@@ -456,13 +457,11 @@ struct Scene_triangulation_3_item_priv {
   {
     if (intersection)
       intersection->setVisible(b);
+    cut_plane_enabled = b;
   }
   bool is_intersection_enabled()
   {
-    if (intersection)
-      return intersection->visible();
-    else
-      return false;
+    return cut_plane_enabled;
   }
   bool is_item_clip_box(int id)
   {
@@ -530,6 +529,7 @@ struct Scene_triangulation_3_item_priv {
   boost::dynamic_bitset<> visible_subdomain;
   std::bitset<24> bs[4] = {16777215, 16777215, 16777215, 16777215};
   bool show_tetrahedra;
+  bool cut_plane_enabled;
   bool is_aabb_tree_built;
   bool last_intersection;
   bool cut_edges;
diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
index 89f0e38d3d9f..33a2cd8f124b 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
@@ -2,7 +2,6 @@
 #define SCENE_TRIANGULATION_3_ITEM_H
 
 #include "Scene_triangulation_3_item_config.h"
-#include "Plugins/PCA/Scene_edit_box_item.h"
 #include "T3_type.h"
 
 #include <QVector>

From 031594e0db5a22777728a103708455a28245360c Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Tue, 26 Sep 2023 12:23:52 +0200
Subject: [PATCH 0778/1398] Replaced Q_FOREACH with c++11 for each

---
 .../demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp       | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
index 251c461dd13c..a2dd4f791397 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
@@ -163,13 +163,13 @@ void Clipping_box_plugin::clip(bool b)
   clipping = b;
   if (b)
   {
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
     {
       v->installEventFilter(this);
     }
   }
   else {
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
     {
       v->removeEventFilter(this);
     }

From 98ba8b68e3c1e4487a6ae0f6dd7d9ee7202e4cbd Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Tue, 26 Sep 2023 12:38:34 +0200
Subject: [PATCH 0779/1398] Fix wrong linkage

---
 Polyhedron/demo/Polyhedron/CMakeLists.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/CMakeLists.txt b/Polyhedron/demo/Polyhedron/CMakeLists.txt
index ecab2ece7fd0..85c604688599 100644
--- a/Polyhedron/demo/Polyhedron/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/CMakeLists.txt
@@ -231,12 +231,12 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
   endmacro(add_item)
 
   add_item(scene_triangulation_3_item Scene_triangulation_3_item.cpp)
-  target_link_libraries(scene_triangulation_3_item PUBLIC scene_basic_objects)
+  target_link_libraries(scene_triangulation_3_item PUBLIC scene_basic_objects scene_edit_box_item)
 
   add_item(scene_c3t3_item Scene_c3t3_item.cpp)
   target_link_libraries(
     scene_c3t3_item PUBLIC scene_triangulation_3_item
-    scene_surface_mesh_item scene_polygon_soup_item scene_edit_box_item
+    scene_surface_mesh_item scene_polygon_soup_item
     scene_basic_objects ${TBB_LIBRARIES})
 
   if(TARGET CGAL::TBB_support)

From 595897e7c74ccc757a0b4889972119d5d0e0330b Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Tue, 26 Sep 2023 15:22:49 +0200
Subject: [PATCH 0780/1398] Factorized vtk image loading

---
 .../Plugins/Mesh_3/Io_image_plugin.cpp        | 68 +++++++++++--------
 1 file changed, 39 insertions(+), 29 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
index 32ec637c9210..8da04e3cc8e2 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
@@ -54,6 +54,7 @@
 #include <CGAL/IO/read_vtk_image_data.h>
 
 #include <vtkNew.h>
+#include <vtkSmartPointer.h>
 #include <vtkStringArray.h>
 #include <vtkImageData.h>
 #include <vtkXMLImageDataReader.h>
@@ -333,6 +334,8 @@ class Io_image_plugin :
   QString nameFilters() const override;
   bool canLoad(QFileInfo) const override;
   QList<Scene_item*> load(QFileInfo fileinfo, bool& ok, bool add_to_scene = true) override;
+  template <class vtkReader>
+  bool load_vtk_file(QFileInfo fileinfo, Image* image);
 
   bool canSave(const CGAL::Three::Scene_item*) override;
   bool save(QFileInfo fileinfo, QList<CGAL::Three::Scene_item*>& items ) override
@@ -1123,6 +1126,25 @@ void convert(Image* image)
   image->image()->wordKind = WK_FLOAT;
 }
 
+
+template <class vtkReader>
+bool
+Io_image_plugin::load_vtk_file(QFileInfo fileinfo, Image* image)
+{
+#ifdef CGAL_USE_VTK
+  vtkNew<vtkReader> reader;
+  reader->SetFileName(fileinfo.filePath().toUtf8());
+  reader->Update();
+  auto vtk_image = reader->GetOutput();
+  vtk_image->Print(std::cerr);
+  *image = CGAL::IO::read_vtk_image_data(vtk_image); // copy the image data
+  return true;
+#else
+  return false;
+#endif
+}
+
+
 QList<Scene_item*>
 Io_image_plugin::load(QFileInfo fileinfo, bool& ok, bool add_to_scene)
 {
@@ -1130,20 +1152,15 @@ Io_image_plugin::load(QFileInfo fileinfo, bool& ok, bool add_to_scene)
   QApplication::restoreOverrideCursor();
   Image* image = new Image;
 
+  QString warningMessage;
   // read a vti file
   if(fileinfo.suffix() == "vti")
   {
 #ifdef CGAL_USE_VTK
-    vtkNew<vtkXMLImageDataReader> reader;
-    reader->SetFileName(fileinfo.filePath().toUtf8());
-    reader->Update();
-    auto vtk_image = reader->GetOutput();
-    vtk_image->Print(std::cerr);
-    *image = CGAL::IO::read_vtk_image_data(vtk_image); // copy the image data
+    ok = load_vtk_file<vtkXMLImageDataReader>(fileinfo, image);
 #else
-    CGAL::Three::Three::warning("VTK is required to read VTI files");
-    delete image;
-    return QList<Scene_item*>();
+    ok = false;
+    warningMessage = "VTK is required to read VTI files";
 #endif
   }
 
@@ -1151,16 +1168,10 @@ Io_image_plugin::load(QFileInfo fileinfo, bool& ok, bool add_to_scene)
   else if(fileinfo.suffix() == "nrrd")
   {
 #ifdef CGAL_USE_VTK
-    vtkNew<vtkNrrdReader> reader;
-    reader->SetFileName(fileinfo.filePath().toUtf8());
-    reader->Update();
-    auto vtk_image = reader->GetOutput();
-    vtk_image->Print(std::cerr);
-    *image = CGAL::IO::read_vtk_image_data(vtk_image); // copy the image data
+    ok = load_vtk_file<vtkNrrdReader>(fileinfo, image);
 #else
-    CGAL::Three::Three::warning("VTK is required to read NRRD files");
-    delete image;
-    return QList<Scene_item*>();
+    ok = false;
+    warningMessage = "VTK is required to read NRRD files";
 #endif
   }
 
@@ -1170,16 +1181,10 @@ Io_image_plugin::load(QFileInfo fileinfo, bool& ok, bool add_to_scene)
         && fileinfo.fileName().endsWith(QString(".nii.gz"), Qt::CaseInsensitive)))
   {
 #ifdef CGAL_USE_VTK
-    vtkNew<vtkNIFTIImageReader> reader;
-    reader->SetFileName(fileinfo.filePath().toUtf8());
-    reader->Update();
-    auto vtk_image = reader->GetOutput();
-    vtk_image->Print(std::cerr);
-    *image = CGAL::IO::read_vtk_image_data(vtk_image); // copy the image data
+    ok = load_vtk_file<vtkNIFTIImageReader>(fileinfo, image);
 #else
-    CGAL::Three::Three::warning("VTK is required to read NIfTI files");
-    delete image;
-    return QList<Scene_item*>();
+    ok = false;
+    warningMessage = "VTK is required to read NifTI files";
 #endif
   }
 
@@ -1286,11 +1291,16 @@ Io_image_plugin::load(QFileInfo fileinfo, bool& ok, bool add_to_scene)
     if(!success)
     {
       ok = false;
-      delete image;
-      return QList<Scene_item*>();
     }
   }
 
+  if (!ok) {
+    if (warningMessage.length() > 0)
+        CGAL::Three::Three::warning(warningMessage);
+    delete image;
+    return QList<Scene_item*>();
+  }
+
   // Get display precision
   QDialog dialog;
   ui.setupUi(&dialog);

From 7edb061915f9a222171ae51079af2465651bc4fa Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Tue, 26 Sep 2023 15:44:30 +0200
Subject: [PATCH 0781/1398] Added dual contouring plugin from isosurfacing_3
 package

---
 .../Plugins/Isosurfacing_3/CMakeLists.txt     |   6 +
 .../Isosurfacing_3/Isosurface_3_plugin.cpp    | 369 ++++++++++++++++++
 2 files changed, 375 insertions(+)
 create mode 100644 Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/CMakeLists.txt
 create mode 100644 Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/CMakeLists.txt
new file mode 100644
index 000000000000..8707fb421bde
--- /dev/null
+++ b/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/CMakeLists.txt
@@ -0,0 +1,6 @@
+include(polyhedron_demo_macros)
+
+polyhedron_demo_plugin(isosurface_3_plugin Isosurface_3_plugin KEYWORDS
+                       Isosurface_3)
+target_link_libraries(
+  isosurface_3_plugin PUBLIC scene_polygon_soup_item scene_image_item )
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp
new file mode 100644
index 000000000000..4b25ab97f9a6
--- /dev/null
+++ b/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp
@@ -0,0 +1,369 @@
+#include <QElapsedTimer>
+#include <QApplication>
+#include <QAction>
+#include <QMainWindow>
+#include "Scene_polygon_soup_item.h"
+#include "Scene_image_item.h"
+#include "SMesh_type.h"
+#include "Image_type.h"
+
+#include <CGAL/Three/Polyhedron_demo_plugin_interface.h>
+#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+#include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
+
+using namespace CGAL::Three;
+class Polyhedron_demo_isosurface_3_plugin :
+  public QObject,
+  public Polyhedron_demo_plugin_interface
+{
+  Q_OBJECT
+  Q_INTERFACES(CGAL::Three::Polyhedron_demo_plugin_interface)
+  Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0")
+public:
+  void init(QMainWindow*mw,
+            Scene_interface* scene_interface,
+            Messages_interface*)
+  {
+    scene = scene_interface;
+    this->mw = mw;
+    QAction *actionDualLabel = new QAction("Dual contour label image", mw);
+    actionDualLabel->setProperty("subMenuName","Isosurface");
+    connect(actionDualLabel, SIGNAL(triggered()), this, SLOT(on_actionDualLabel_triggered()));
+    _actions << actionDualLabel;
+  }
+
+  QList<QAction*> actions()const {return _actions;}
+
+  bool applicable(QAction*) const {
+    return
+      qobject_cast<Scene_image_item*>(scene->item(scene->mainSelectionIndex()));
+  }
+
+public Q_SLOTS:
+  void on_actionDualLabel_triggered();
+private:
+  QList<QAction*> _actions;
+  Scene_interface* scene;
+  QMainWindow* mw;
+}; // end Polyhedron_demo_convex_hull_plugin
+
+class Polyhedron_demo_isosurface_3_plugin_helper {
+  typedef float Word_type;
+  typedef std::size_t vertex_descriptor;
+  typedef std::pair<Word_type, Word_type> surface_descriptor;
+
+  struct Mesh_quad {
+    typedef vertex_descriptor* iterator;
+    typedef const vertex_descriptor* const_iterator;
+
+    vertex_descriptor t[4];
+    surface_descriptor surface;
+
+    Mesh_quad() {}
+
+    Mesh_quad(const Mesh_quad & other) {
+      t[0] = other.t[0];
+      t[1] = other.t[1];
+      t[2] = other.t[2];
+      t[3] = other.t[3];
+      surface = other.surface;
+    }
+
+    Mesh_quad(vertex_descriptor v0, vertex_descriptor v1, vertex_descriptor v2, vertex_descriptor v3, Word_type val1, Word_type val2) {
+      if (val1 < val2) {
+        t[0] = v3;
+        t[1] = v2;
+        t[2] = v1;
+        t[3] = v0;
+        surface = std::make_pair(val1, val2);
+      }
+      else {
+        t[0] = v0;
+        t[1] = v1;
+        t[2] = v2;
+        t[3] = v3;
+        surface = std::make_pair(val2, val1);
+      }
+    }
+
+    std::size_t size() const {
+      return 4;
+    }
+
+    vertex_descriptor operator[](int i) const { return t[i]; }
+
+    iterator begin() { return &t[0]; }
+    const_iterator begin() const { return &t[0]; }
+    iterator end() { return &t[4]; }
+    const_iterator end() const { return &t[4]; }
+  };
+
+  struct Mesh
+  {
+    using Polygon = Mesh_quad;
+
+    std::vector<Point_3> vertices;
+    std::vector<Polygon> polygons;
+
+    vertex_descriptor add_vertex(EPICK::Point_3 p) {
+      vertices.push_back(p);
+      return vertices.size()-1;
+    }
+
+    void add_face(const Polygon & poly) {
+      polygons.push_back(Polygon(poly));
+    }
+
+    void add_face(vertex_descriptor v0, vertex_descriptor v1, vertex_descriptor v2, vertex_descriptor v3, Word_type val1, Word_type val2)
+    {
+      polygons.push_back(Polygon(v0, v1, v2, v3, val1, val2));
+    }
+  };
+
+public:
+  Polyhedron_demo_isosurface_3_plugin_helper(const Image* image)
+  {
+    image_ = image;
+  }
+
+  void dual_contouring_label_image()
+  {
+    int i,j,k;
+
+    float dx_ = 1.0;
+    float dy_ = 1.0;
+    float dz_ = 1.0;
+    double vx_ = image_->vx();
+    double vy_ = image_->vy();
+    double vz_ = image_->vz();
+    double tx_ = image_->tx();
+    double ty_ = image_->ty();
+    double tz_ = image_->tz();
+
+    int xdim_ = image_->xdim();
+    int ydim_ = image_->ydim();
+    int zdim_ = image_->zdim();
+    int xdim_p = xdim_+dx_;
+    int ydim_p = ydim_+dy_;
+    int zdim_p = zdim_+dz_;
+
+    std::map<std::size_t, vertex_descriptor> vertices;
+
+    for ( k = -dz_ ; k < zdim_ ; k+=dz_ )
+    {
+      for ( j = -dy_ ; j < ydim_ ; j+=dy_ )
+      {
+        for ( i = -dx_ ; i < xdim_ ; i+=dx_ )
+        {
+          const Word_type & v0 = image_data(i, j, k);
+
+          const Word_type & v1 = image_data(i+dx_, j, k);
+          const Word_type & v2 = image_data(i, j+dy_, k);
+          const Word_type & v3 = image_data(i, j, k+dz_);
+
+          const Word_type & v4 = image_data(i+dx_, j+dy_, k);
+          const Word_type & v5 = image_data(i, j+dy_, k+dz_);
+          const Word_type & v6 = image_data(i+dx_, j, k+dz_);
+
+          const Word_type & v7 = image_data(i+dx_, j+dy_, k+dz_);
+
+          // if one is different
+          if (v0 != v1 || v0 != v2 || v0 != v3 || v0 != v4 || v0 != v5 || v0 != v6 || v0 != v7) {
+            int ip = i+dx_;
+            int jp = j+dy_;
+            int kp = k+dz_;
+            int index = kp*ydim_p*xdim_p + jp*xdim_p + ip;
+            double di = i+0.5*dx_;
+            double dj = j+0.5*dy_;
+            double dk = k+0.5*dz_;
+            if (di < 0)
+              di = 0.0;
+            if (dj < 0)
+              dj = 0.0;
+            if (dk < 0)
+              dk = 0.0;
+            if (di > xdim_-dx_)
+              di = xdim_-1;
+            if (dj > ydim_-dy_)
+              dj = ydim_-1;
+            if (dk > zdim_-dz_)
+              dk = zdim_-1;
+            di = di * vx_ + tx_;
+            dj = dj * vy_ + ty_;
+            dk = dk * vz_ + tz_;
+
+            vertex_descriptor vertex_0 = mesh_.add_vertex(Point_3(di, dj, dk));
+            vertices.insert(std::make_pair(index, vertex_0));
+
+            // check x direction
+            if (v0 != v1)
+            {
+              vertex_descriptor vertex_1 = vertices.find(kp*ydim_p*xdim_p + j *xdim_p + ip)->second;
+              vertex_descriptor vertex_2 = vertices.find(k *ydim_p*xdim_p + j *xdim_p + ip)->second;
+              vertex_descriptor vertex_3 = vertices.find(k *ydim_p*xdim_p + jp*xdim_p + ip)->second;
+              mesh_.add_face(vertex_0, vertex_1, vertex_2, vertex_3, v0, v1);
+            }
+            // check y direction
+            if (v0 != v2)
+            {
+              vertex_descriptor vertex_1 = vertices.find(k *ydim_p*xdim_p + jp*xdim_p + ip)->second;
+              vertex_descriptor vertex_2 = vertices.find(k *ydim_p*xdim_p + jp*xdim_p + i )->second;
+              vertex_descriptor vertex_3 = vertices.find(kp*ydim_p*xdim_p + jp*xdim_p + i )->second;
+              mesh_.add_face(vertex_0, vertex_1, vertex_2, vertex_3, v0, v2);
+            }
+            // check z direction
+            if (v0 != v3)
+            {
+              vertex_descriptor vertex_1 = vertices.find(kp*ydim_p*xdim_p + jp*xdim_p + i )->second;
+              vertex_descriptor vertex_2 = vertices.find(kp*ydim_p*xdim_p + j *xdim_p + i )->second;
+              vertex_descriptor vertex_3 = vertices.find(kp*ydim_p*xdim_p + j *xdim_p + ip)->second;
+              mesh_.add_face(vertex_0, vertex_1, vertex_2, vertex_3, v0, v3);
+            }
+          }
+        }
+      }
+    }
+  }
+
+  void generate_polygon_soup(std::vector<Point_3> & vertices,
+                             std::vector<std::vector<std::size_t>> & polygons,
+                             std::vector<CGAL::IO::Color> & fcolors,
+                             std::vector<CGAL::IO::Color> & vcolors,
+                             const QColor & c)
+  {
+    vertices.clear();
+    polygons.clear();
+    fcolors.clear();
+    vcolors.clear();
+
+    const std::vector<Point_3> & m_vertices = mesh_.vertices;
+    const std::vector<Mesh_quad> & m_polygons = mesh_.polygons;
+    std::size_t polygon_size = m_polygons.size();
+
+    vertices.insert(vertices.begin(), m_vertices.begin(), m_vertices.end());
+
+    std::map<surface_descriptor, QColor> surface_color_map;
+    compute_color_map(surface_color_map, c);
+
+    fcolors.resize(polygon_size);
+    polygons.resize(polygon_size);
+    for (std::size_t i = 0; i < polygon_size; i++)
+    {
+      const Mesh_quad & quad = m_polygons[i];
+
+      std::vector<std::size_t> polygon;
+      polygon.resize(4);
+      polygon[0] = quad.t[0];
+      polygon[1] = quad.t[1];
+      polygon[2] = quad.t[2];
+      polygon[3] = quad.t[3];
+      polygons[i] = polygon;
+
+      const QColor & color = surface_color_map[quad.surface];
+      fcolors[i] = CGAL::IO::Color(color.red(), color.green(), color.blue());
+    }
+  }
+
+private:
+  Mesh mesh_;
+  const Image* image_;
+  int nb_surfaces;
+
+  Word_type image_data(std::size_t i, std::size_t j, std::size_t k)
+  {
+    if ( i>=0 && i<image_->xdim() && j>=0 && j<image_->ydim() && k>=0 && k<image_->zdim() )
+      return image_->value(i, j, k);
+    else
+      return 0;
+  }
+
+  void compute_color_map(std::map<surface_descriptor, QColor> & surface_color_map, const QColor & c)
+  {
+    // obtain and order all subdomains and surfaces
+    std::map<Word_type, QColor> subdomain_color_map;
+    for (const Mesh_quad& quad : mesh_.polygons) {
+      const surface_descriptor & surface = quad.surface;
+      subdomain_color_map[surface.first] = QColor();
+      subdomain_color_map[surface.second] = QColor();
+      surface_color_map[surface] = QColor();
+    }
+
+    // assign default color to each subdomains (same colors as images)
+    double nb_domains = subdomain_color_map.size();
+    double i = 0;
+    for (std::map<Word_type, QColor>::iterator it = subdomain_color_map.begin(),
+         end = subdomain_color_map.end(); it != end; ++it, i += 1.)
+    {
+      double hue = c.hueF() + 1. / nb_domains * i;
+      if (hue > 1) { hue -= 1.; }
+      it->second = QColor::fromHsvF(hue, c.saturationF(), c.valueF());
+    }
+
+    // assign color for each surfaces (use subdomain color if the surface is in contact with background)
+    nb_domains = surface_color_map.size();
+    i = 0;
+    double patch_hsv_value = fmod(c.valueF() + .5, 1.);
+    for (std::map<surface_descriptor, QColor>::iterator it = surface_color_map.begin(),
+         end = surface_color_map.end(); it != end; ++it, i += 1.)
+    {
+      QColor surface_color;
+      if (it->first.first == 0) {
+        surface_color = subdomain_color_map[it->first.second];
+      }
+      else {
+        double hue = c.hueF() + 1. / nb_domains * i;
+        if (hue > 1) { hue -= 1.; }
+        surface_color =  QColor::fromHsvF(hue, c.saturationF(), patch_hsv_value);
+      }
+
+      it->second = surface_color;
+    }
+  }
+};
+
+void Polyhedron_demo_isosurface_3_plugin::on_actionDualLabel_triggered()
+{
+  const CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
+
+  Scene_image_item* img_item =
+    qobject_cast<Scene_image_item*>(scene->item(index));
+
+  if( img_item )
+  {
+    // wait cursor
+    QApplication::setOverrideCursor(Qt::WaitCursor);
+
+    QElapsedTimer time;
+    time.start();
+    QElapsedTimer time_per_op;
+    time_per_op.start();
+    std::cout << "Dual contour label image...";
+
+    Polyhedron_demo_isosurface_3_plugin_helper helper(img_item->image());
+    helper.dual_contouring_label_image();
+
+    std::vector<Point_3> vertices;
+    std::vector<std::vector<std::size_t>> polygons;
+    std::vector<CGAL::IO::Color> fcolors;
+    std::vector<CGAL::IO::Color> vcolors;
+
+    helper.generate_polygon_soup(vertices, polygons, fcolors, vcolors, img_item->color());
+
+    std::cout << "ok (" << time.elapsed() << " ms)" << std::endl;
+
+    Scene_polygon_soup_item* new_item = new Scene_polygon_soup_item();
+    new_item->load(vertices, polygons, fcolors, vcolors);
+    new_item->setName(tr("%1 (surface)").arg(scene->item(index)->name()));
+    new_item->setColor(img_item->color());
+    new_item->setRenderingMode(FlatPlusEdges);
+    scene->addItem(new_item);
+
+
+    img_item->setVisible(false);
+
+    // default cursor
+    QApplication::restoreOverrideCursor();
+  }
+}
+
+#include "Isosurface_3_plugin.moc"

From a3ab2aa68eaf164f31f909af355a07f7585a6779 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Tue, 26 Sep 2023 15:57:05 +0200
Subject: [PATCH 0782/1398] Mooved templeted function load_vtk_file out of
 Io_image_plugin class

---
 .../Plugins/Mesh_3/Io_image_plugin.cpp        | 37 +++++++++----------
 1 file changed, 17 insertions(+), 20 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
index 8da04e3cc8e2..d1e98bfdf49c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
@@ -79,6 +79,23 @@
 #include <iostream>
 #include <locale>
 
+template <class vtkReader>
+bool
+load_vtk_file(QFileInfo fileinfo, Image* image)
+{
+#ifdef CGAL_USE_VTK
+    vtkNew<vtkReader> reader;
+    reader->SetFileName(fileinfo.filePath().toUtf8());
+    reader->Update();
+    auto vtk_image = reader->GetOutput();
+    vtk_image->Print(std::cerr);
+    *image = CGAL::IO::read_vtk_image_data(vtk_image); // copy the image data
+    return true;
+#else
+    return false;
+#endif
+}
+
 // Covariant return types don't work for scalar types and we cannot
 // have templates here, hence this unfortunate hack.
 
@@ -334,8 +351,6 @@ class Io_image_plugin :
   QString nameFilters() const override;
   bool canLoad(QFileInfo) const override;
   QList<Scene_item*> load(QFileInfo fileinfo, bool& ok, bool add_to_scene = true) override;
-  template <class vtkReader>
-  bool load_vtk_file(QFileInfo fileinfo, Image* image);
 
   bool canSave(const CGAL::Three::Scene_item*) override;
   bool save(QFileInfo fileinfo, QList<CGAL::Three::Scene_item*>& items ) override
@@ -1127,24 +1142,6 @@ void convert(Image* image)
 }
 
 
-template <class vtkReader>
-bool
-Io_image_plugin::load_vtk_file(QFileInfo fileinfo, Image* image)
-{
-#ifdef CGAL_USE_VTK
-  vtkNew<vtkReader> reader;
-  reader->SetFileName(fileinfo.filePath().toUtf8());
-  reader->Update();
-  auto vtk_image = reader->GetOutput();
-  vtk_image->Print(std::cerr);
-  *image = CGAL::IO::read_vtk_image_data(vtk_image); // copy the image data
-  return true;
-#else
-  return false;
-#endif
-}
-
-
 QList<Scene_item*>
 Io_image_plugin::load(QFileInfo fileinfo, bool& ok, bool add_to_scene)
 {

From c82f2a9d9c2c082f477b7d5e2af7f57e319e3acf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 27 Sep 2023 10:11:31 +0200
Subject: [PATCH 0783/1398] Update some variable names to reflect the
 genericity of the triangulation

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h |  9 +--
 .../internal/gate_priority_queue.h            | 16 ++---
 .../Alpha_wrap_3/internal/geometry_utils.h    | 62 +++++++++----------
 3 files changed, 44 insertions(+), 43 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index f2ad170c95e7..8f7b1f5efc9c 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -290,7 +290,7 @@ class Alpha_wrap_3
       extract_surface(output_mesh, ovpm, true /*tolerate non manifoldness*/);
 
 #ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
-      dump_triangulation_faces("intermediate_dt3.off", false /*only_boundary_faces*/);
+      dump_triangulation_faces("intermediate_tr.off", false /*only_boundary_faces*/);
       IO::write_polygon_mesh("intermediate.off", output_mesh,
                              CGAL::parameters::vertex_point_map(ovpm).stream_precision(17));
 #endif
@@ -350,7 +350,7 @@ class Alpha_wrap_3
 
  #ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
     IO::write_polygon_mesh("final.off", output_mesh, CGAL::parameters::stream_precision(17));
-    dump_triangulation_faces("final_dt3.off", false /*only_boundary_faces*/);
+    dump_triangulation_faces("final_tr.off", false /*only_boundary_faces*/);
  #endif
 #endif
 
@@ -643,7 +643,9 @@ class Alpha_wrap_3
   // and we fill the queue with the new parameters.
   bool initialize_from_existing_triangulation()
   {
-    std::cout << "restart from a DT of " << m_tr.number_of_cells() << " cells" << std::endl;
+#ifdef CGAL_AW3_DEBUG_INITIALIZATION
+    std::cout << "Restart from a DT of " << m_tr.number_of_cells() << " cells" << std::endl;
+#endif
 
     Real_timer t;
     t.start();
@@ -1050,7 +1052,6 @@ class Alpha_wrap_3
 public:
   // @speed some decent time may be spent constructing Facet (pairs) for no reason as it's always
   // just to grab the .first and .second as soon as it's constructed, and not due to API requirements
-  // e.g. from DT3
   Facet_queue_status facet_status(const Facet& f) const
   {
     CGAL_precondition(!m_tr.is_infinite(f));
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
index 824d27bc2c10..5e14a4d08ea1 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
@@ -28,11 +28,11 @@ namespace Alpha_wraps_3 {
 namespace internal {
 
 // Represents an alpha-traversable facet in the mutable priority queue
-template <typename DT3>
+template <typename Tr>
 class Gate
 {
-  using Facet = typename DT3::Facet;
-  using FT = typename DT3::Geom_traits::FT;
+  using Facet = typename Tr::Facet;
+  using FT = typename Tr::Geom_traits::FT;
 
 private:
   Facet m_facet;
@@ -65,24 +65,24 @@ class Gate
 
 struct Less_gate
 {
-  template <typename DT3>
-  bool operator()(const Gate<DT3>& a, const Gate<DT3>& b) const
+  template <typename Tr>
+  bool operator()(const Gate<Tr>& a, const Gate<Tr>& b) const
   {
     return a.priority() > b.priority();
   }
 };
 
-template <typename DT3>
+template <typename Tr>
 struct Gate_ID_PM
 {
-  using key_type = Gate<DT3>;
+  using key_type = Gate<Tr>;
   using value_type = std::size_t;
   using reference = std::size_t;
   using category = boost::readable_property_map_tag;
 
   inline friend value_type get(Gate_ID_PM, const key_type& k)
   {
-    using Facet = typename DT3::Facet;
+    using Facet = typename Tr::Facet;
 
     const Facet& f = k.facet();
     return (4 * f.first->time_stamp() + f.second);
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
index d3814d0f3b25..7d66cfd19f41 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
@@ -40,16 +40,16 @@ struct Orientation_of_circumcenter
   }
 };
 
-template <typename Dt>
+template <typename Tr>
 bool
-less_squared_radius_of_min_empty_sphere(typename Dt::Geom_traits::FT sq_alpha,
-                                        const typename Dt::Facet& fh,
-                                        const Dt& dt)
+less_squared_radius_of_min_empty_sphere(typename Tr::Geom_traits::FT sq_alpha,
+                                        const typename Tr::Facet& fh,
+                                        const Tr& tr)
 {
-  using Cell_handle = typename Dt::Cell_handle;
-  using Point = typename Dt::Point;
+  using Cell_handle = typename Tr::Cell_handle;
+  using Point = typename Tr::Point;
 
-  using CK = typename Dt::Geom_traits;
+  using CK = typename Tr::Geom_traits;
   using Exact_kernel = typename Exact_kernel_selector<CK>::Exact_kernel;
   using Approximate_kernel = Simple_cartesian<Interval_nt_advanced>;
   using C2A = Cartesian_converter<CK, Approximate_kernel>;
@@ -65,17 +65,17 @@ less_squared_radius_of_min_empty_sphere(typename Dt::Geom_traits::FT sq_alpha,
   const int ic = fh.second;
   const Cell_handle n = c->neighbor(ic);
 
-  const Point& p1 = dt.point(c, Dt::vertex_triple_index(ic,0));
-  const Point& p2 = dt.point(c, Dt::vertex_triple_index(ic,1));
-  const Point& p3 = dt.point(c, Dt::vertex_triple_index(ic,2));
+  const Point& p1 = tr.point(c, Tr::vertex_triple_index(ic,0));
+  const Point& p2 = tr.point(c, Tr::vertex_triple_index(ic,1));
+  const Point& p3 = tr.point(c, Tr::vertex_triple_index(ic,2));
 
   // This is not actually possible in the context of alpha wrapping, but keeping it for genericity
   // and because it does not cost anything.
-  if(dt.is_infinite(n))
+  if(tr.is_infinite(n))
   {
     Orientation ori = orientation_of_circumcenter(p1, p2, p3,
-                                                  dt.point(c, 0), dt.point(c, 1),
-                                                  dt.point(c, 2), dt.point(c, 3));
+                                                  tr.point(c, 0), tr.point(c, 1),
+                                                  tr.point(c, 2), tr.point(c, 3));
 
     if(ori == POSITIVE)
     {
@@ -84,18 +84,18 @@ less_squared_radius_of_min_empty_sphere(typename Dt::Geom_traits::FT sq_alpha,
     }
     else
     {
-      Comparison_result cr = compare_squared_radius(dt.point(c, 0), dt.point(c, 1),
-                                                    dt.point(c, 2), dt.point(c, 3),
+      Comparison_result cr = compare_squared_radius(tr.point(c, 0), tr.point(c, 1),
+                                                    tr.point(c, 2), tr.point(c, 3),
                                                     sq_alpha);
       return cr == LARGER;
     }
   }
 
-  if(dt.is_infinite(c))
+  if(tr.is_infinite(c))
   {
     Orientation ori = orientation_of_circumcenter(p1, p2, p3,
-                                                  dt.point(n, 0), dt.point(n, 1),
-                                                  dt.point(n, 2), dt.point(n, 3));
+                                                  tr.point(n, 0), tr.point(n, 1),
+                                                  tr.point(n, 2), tr.point(n, 3));
 
     if(ori == NEGATIVE)
     {
@@ -104,8 +104,8 @@ less_squared_radius_of_min_empty_sphere(typename Dt::Geom_traits::FT sq_alpha,
     }
     else
     {
-      Comparison_result cr = compare_squared_radius(dt.point(n, 0), dt.point(n, 1),
-                                                    dt.point(n, 2), dt.point(n, 3),
+      Comparison_result cr = compare_squared_radius(tr.point(n, 0), tr.point(n, 1),
+                                                    tr.point(n, 2), tr.point(n, 3),
                                                     sq_alpha);
       return cr == LARGER;
     }
@@ -113,40 +113,40 @@ less_squared_radius_of_min_empty_sphere(typename Dt::Geom_traits::FT sq_alpha,
 
   // both c and n are finite
   if(orientation_of_circumcenter(p1, p2, p3,
-                                 dt.point(c, 0), dt.point(c, 1), dt.point(c, 2), dt.point(c, 3)) !=
+                                 tr.point(c, 0), tr.point(c, 1), tr.point(c, 2), tr.point(c, 3)) !=
      orientation_of_circumcenter(p1, p2, p3,
-                                 dt.point(n, 0), dt.point(n, 1), dt.point(n, 2), dt.point(n, 3)))
+                                 tr.point(n, 0), tr.point(n, 1), tr.point(n, 2), tr.point(n, 3)))
   {
     Comparison_result cr = compare_squared_radius(p1, p2, p3, sq_alpha);
 #ifdef CGAL_AW3_DEBUG_TRAVERSABILITY
     std::cout << "dual crosses the face; CR: "
-              << typename Dt::Geom_traits().compute_squared_radius_3_object()(p1, p2, p3)
+              << typename Tr::Geom_traits().compute_squared_radius_3_object()(p1, p2, p3)
               << " sq alpha " << sq_alpha << std::endl;
 #endif
     return cr == LARGER;
   }
   else
   {
-    Comparison_result cr = compare_squared_radius(dt.point(c, 0), dt.point(c, 1),
-                                                  dt.point(c, 2), dt.point(c, 3),
+    Comparison_result cr = compare_squared_radius(tr.point(c, 0), tr.point(c, 1),
+                                                  tr.point(c, 2), tr.point(c, 3),
                                                   sq_alpha);
 #ifdef CGAL_AW3_DEBUG_TRAVERSABILITY
     std::cout << "dual does not cross the face; CR(c): "
-              << typename Dt::Geom_traits().compute_squared_radius_3_object()(dt.point(c, 0), dt.point(c, 1),
-                                                                              dt.point(c, 2), dt.point(c, 3))
+              << typename Tr::Geom_traits().compute_squared_radius_3_object()(tr.point(c, 0), tr.point(c, 1),
+                                                                              tr.point(c, 2), tr.point(c, 3))
               << " sq alpha " << sq_alpha << std::endl;
 #endif
 
     if(cr != LARGER)
       return false;
 
-    cr = compare_squared_radius(dt.point(n, 0), dt.point(n, 1),
-                                dt.point(n, 2), dt.point(n, 3),
+    cr = compare_squared_radius(tr.point(n, 0), tr.point(n, 1),
+                                tr.point(n, 2), tr.point(n, 3),
                                 sq_alpha);
 #ifdef CGAL_AW3_DEBUG_TRAVERSABILITY
     std::cout << "dual does not cross the face; CR(n): "
-              << typename Dt::Geom_traits().compute_squared_radius_3_object()(dt.point(n, 0), dt.point(n, 1),
-                                                                              dt.point(n, 2), dt.point(n, 3))
+              << typename Tr::Geom_traits().compute_squared_radius_3_object()(tr.point(n, 0), tr.point(n, 1),
+                                                                              tr.point(n, 2), tr.point(n, 3))
               << " sq alpha " << sq_alpha << std::endl;
 #endif
 

From 62bb2a58d098dc08076f2165d104670dfa65388a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 27 Sep 2023 10:13:39 +0200
Subject: [PATCH 0784/1398] Put the warnings outside of verbosity  macros (too
 important)

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h      | 14 +++++---------
 1 file changed, 5 insertions(+), 9 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 8f7b1f5efc9c..3ee6061d0d89 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1173,15 +1173,11 @@ class Alpha_wrap_3
       return false;
     }
 
-    if(resuming)
-    {
-      if(offset != m_offset)
-      {
-#ifdef CGAL_AW3_DEBUG
-        std::cerr << "Warning: resuming with a different offset!" << std::endl;
-#endif
-      }
-    }
+    if(resuming && alpha > m_alpha)
+      std::cerr << "Warning: resuming with an alpha greater than last iteration!" << std::endl;
+
+    if(resuming && offset != m_offset)
+      std::cerr << "Warning: resuming with a different offset!" << std::endl;
 
     m_alpha = FT(alpha);
     m_sq_alpha = square(m_alpha);

From bc8351f15678b90955a9d5c2a5cc4b0389b49642 Mon Sep 17 00:00:00 2001
From: Mael <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 27 Sep 2023 11:06:49 +0200
Subject: [PATCH 0785/1398] Fix typo

---
 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 6d544be058d6..639c9a3f4685 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1418,7 +1418,7 @@ class Alpha_wrap_3
                           squared_distance(m_dt.point(c, 0), m_dt.point(c, 2)),
                           squared_distance(m_dt.point(c, 0), m_dt.point(c, 3)),
                           squared_distance(m_dt.point(c, 1), m_dt.point(c, 2)),
-                          squared_distance(m_dt.point(c, 3), m_dt.point(c, 3)),
+                          squared_distance(m_dt.point(c, 1), m_dt.point(c, 3)),
                           squared_distance(m_dt.point(c, 2), m_dt.point(c, 3)) });
     };
 

From 92232c9295ed2f246ff3f20221f231021c3d4aa7 Mon Sep 17 00:00:00 2001
From: CCXXXI <ccxxxi@qq.com>
Date: Thu, 28 Sep 2023 12:53:05 +0800
Subject: [PATCH 0786/1398] fix a typo in Tutorial_hello_world.txt

---
 .../doc/Documentation/Tutorials/Tutorial_hello_world.txt        | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Documentation/doc/Documentation/Tutorials/Tutorial_hello_world.txt b/Documentation/doc/Documentation/Tutorials/Tutorial_hello_world.txt
index da30ca174ccf..a006447c79af 100644
--- a/Documentation/doc/Documentation/Tutorials/Tutorial_hello_world.txt
+++ b/Documentation/doc/Documentation/Tutorials/Tutorial_hello_world.txt
@@ -73,7 +73,7 @@ seems that the points are collinear, or perform a right turn.
 
 If you must ensure that your numbers get interpreted at their full precision
 you can use a \cgal kernel that performs exact predicates and
-extract constructions.
+exact constructions.
 
 \cgalExample{Kernel_23/exact.cpp}
 

From a72ccf2089be07f42913514d6267c5f32f413d0b Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 28 Sep 2023 15:04:35 +0200
Subject: [PATCH 0787/1398] Fix CMake error on Windows

https://cgal.geometryfactory.com/CGAL/testsuite/CGAL-6.0-Ic-73/Installation/TestReport_Christo_MSVC-2022-Preview-Release.gz
```
CMake Error at cmake/modules/CGAL_SetupGMP.cmake:73 (target_link_libraries):
  The plain signature for target_link_libraries has already been used with
  the target "test_gmp_mpfr_dll".  All uses of target_link_libraries with a
  target must be either all-keyword or all-plain.

  The uses of the plain signature are here:

   * test/Installation/CMakeLists.txt:54 (target_link_libraries)

Call Stack (most recent call first):
  test/Installation/CMakeLists.txt:55 (use_CGAL_GMP_support)
```
---
 Installation/test/Installation/CMakeLists.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Installation/test/Installation/CMakeLists.txt b/Installation/test/Installation/CMakeLists.txt
index db725c17645f..cf090c2d39ad 100644
--- a/Installation/test/Installation/CMakeLists.txt
+++ b/Installation/test/Installation/CMakeLists.txt
@@ -49,9 +49,9 @@ endif()
 
 if(WIN32 OR CMAKE_SYSTEM_NAME STREQUAL Windows)
   add_executable(display_dll_version_info display_dll_version_info.cpp)
-  target_link_libraries(display_dll_version_info version)
+  target_link_libraries(display_dll_version_info PRIVATE version)
   add_executable(test_gmp_mpfr_dll test_gmp_mpfr_dll.cpp)
-  target_link_libraries(test_gmp_mpfr_dll version)
+  target_link_libraries(test_gmp_mpfr_dll PRIVATE version)
   use_CGAL_GMP_support(test_gmp_mpfr_dll)
   CGAL_add_test(test_gmp_mpfr_dll)
   add_to_cached_list( CGAL_EXECUTABLE_TARGETS test_gmp_mpfr_dll )

From f324943fba613e48477f4fbc84afe07ec5e1f8f2 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Thu, 28 Sep 2023 17:16:03 +0200
Subject: [PATCH 0788/1398] Added item in dropdown for selected edges + Fixed
 logic tautology when selecting edges before mesh

---
 .../demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp     | 9 ++++++---
 1 file changed, 6 insertions(+), 3 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
index c17f4879f1dc..7c5d37c8f9ff 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
@@ -368,9 +368,9 @@ std::optional<QString> Mesh_3_plugin::get_items_or_return_error_string() const
   {
     auto poly_items_ptr = std::get_if<Polyhedral_mesh_items>(&items.value());
     auto image_items_ptr = std::get_if<Image_mesh_items>(&items.value());
-    if(poly_items_ptr && poly_items_ptr == nullptr)
+    if(poly_items_ptr != nullptr)
       poly_items_ptr->polylines_item = polylines_item;
-    else if(image_items_ptr && image_items_ptr == nullptr)
+    else if(image_items_ptr != nullptr )
       image_items_ptr->polylines_item = polylines_item;
   }
 
@@ -663,6 +663,8 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
         ui.protectEdges->addItem(boundary_only.first, v(boundary_only.second));
       } else
         ui.protectEdges->addItem(sharp_edges.first, v(sharp_edges.second));
+      if (polylines_item != nullptr)
+        ui.protectEdges->addItem(input_polylines.first, v(input_polylines.second));
     } else if (items->index() == IMAGE_MESH_ITEMS) {
       if (polylines_item != nullptr) {
         ui.protectEdges->addItem(input_polylines.first, QVariant::fromValue(input_polylines.second));
@@ -729,6 +731,7 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
   const auto pe_flags = ui.protectEdges->currentData().value<Protection_flags>();
   protect_borders = ui.protect->isChecked() && pe_flags.testFlag(BORDERS);
   protect_features = ui.protect->isChecked() && pe_flags.testFlag(FEATURES);
+  const bool protect_polylines = ui.protect->isChecked() && polylines_item != nullptr;
 
   const bool detect_connected_components = ui.detectComponents->isChecked();
   const int manifold = (ui.manifoldCheckBox->isChecked() ? 1 : 0) +
@@ -811,7 +814,7 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
     {
       thread = cgal_code_mesh_3(
         polyhedrons,
-        (polylines_item == nullptr) ? plc : polylines_item->polylines,
+        protect_polylines ? polylines_item->polylines : plc,
         bounding_polyhedron,
         item_name,
         angle,

From 28915280733428e573e1eb4b7c9a818318c81784 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Thu, 28 Sep 2023 19:21:49 +0200
Subject: [PATCH 0789/1398] Bug fix in drawing of interior faces when the outer
 boundary is pinched

---
 GraphicsView/include/CGAL/Buffer_for_vao.h | 32 ++++++++++++----------
 1 file changed, 17 insertions(+), 15 deletions(-)

diff --git a/GraphicsView/include/CGAL/Buffer_for_vao.h b/GraphicsView/include/CGAL/Buffer_for_vao.h
index fddd4a663ffb..8fda19879933 100644
--- a/GraphicsView/include/CGAL/Buffer_for_vao.h
+++ b/GraphicsView/include/CGAL/Buffer_for_vao.h
@@ -746,17 +746,24 @@ class Buffer_for_vao
         fit->info().is_process = false;
       }
       // (2.2) We check if the facet is external or internal
-      std::queue<typename CDT::Face_handle> face_queue;
+      std::queue<typename CDT::Face_handle> face_queue, faces_internal;
       typename CDT::Face_handle face_internal = nullptr;
       if (cdt.infinite_vertex()->face()!=nullptr)
-      { face_queue.push(cdt.infinite_vertex()->face()); }
+      {
+        typename CDT::Face_circulator
+          incident_faces(cdt.infinite_vertex()), end_incident_faces(incident_faces);
+        do
+        { face_queue.push(incident_faces); }
+        while(++incident_faces!=end_incident_faces);
+      }
+      // std::cout<<"# faces PUSHED "<<face_queue.size()<<std::endl;
       while(!face_queue.empty())
       {
-        typename CDT::Face_handle fh = face_queue.front();
+        typename CDT::Face_handle fh=face_queue.front();
         face_queue.pop();
         if(!fh->info().is_process)
         {
-          fh->info().is_process = true;
+          fh->info().is_process=true;
           for(int i=0; i<3; ++i)
           {
             if(!cdt.is_constrained(std::make_pair(fh, i)))
@@ -764,21 +771,16 @@ class Buffer_for_vao
               if (fh->neighbor(i)!=nullptr)
               { face_queue.push(fh->neighbor(i)); }
             }
-            else if (face_internal==nullptr)
-            {
-              face_internal = fh->neighbor(i);
-            }
+            else
+            { faces_internal.push(fh->neighbor(i)); }
           }
         }
       }
 
-      if ( face_internal!=nullptr )
-      { face_queue.push(face_internal); }
-
-      while(!face_queue.empty())
+      while(!faces_internal.empty())
       {
-        typename CDT::Face_handle fh = face_queue.front();
-        face_queue.pop();
+        typename CDT::Face_handle fh=faces_internal.front();
+        faces_internal.pop();
         if(!fh->info().is_process)
         {
           fh->info().is_process = true;
@@ -788,7 +790,7 @@ class Buffer_for_vao
             if(!cdt.is_constrained(std::make_pair(fh, i)))
             {
               if (fh->neighbor(i)!=nullptr)
-              { face_queue.push(fh->neighbor(i)); }
+              { faces_internal.push(fh->neighbor(i)); }
             }
           }
         }

From 685caf955d43580cdaba25fd1c35ca455f1d5626 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Fri, 29 Sep 2023 10:54:53 +0200
Subject: [PATCH 0790/1398] Renamed variable for clarity

---
 .../demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp      | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
index 7c5d37c8f9ff..a146afb007a0 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
@@ -778,7 +778,7 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
       sm_items.removeAll(make_not_null(bounding_sm_item));
     }
 
-    Scene_polylines_item::Polylines_container plc;
+    Scene_polylines_item::Polylines_container polylines_empty_container;
     SMesh* bounding_polyhedron = (bounding_sm_item == nullptr)
                                      ? nullptr
                                      : bounding_sm_item->polyhedron();
@@ -814,7 +814,7 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
     {
       thread = cgal_code_mesh_3(
         polyhedrons,
-        protect_polylines ? polylines_item->polylines : plc,
+        protect_polylines ? polylines_item->polylines : polylines_empty_container,
         bounding_polyhedron,
         item_name,
         angle,
@@ -881,11 +881,11 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
       ? image_item->image_weights()
       : nullptr;
 
-    Scene_polylines_item::Polylines_container plc;
+    Scene_polylines_item::Polylines_container polylines_empty_container;
 
     thread = cgal_code_mesh_3(
         pImage,
-        (img_polylines_item == nullptr) ? plc : img_polylines_item->polylines,
+        (img_polylines_item == nullptr) ? polylines_empty_container : img_polylines_item->polylines,
         angle,
         facets_sizing,
         facets_min_sizing,

From 00f167a8357ab5fe72fb22e0a547c5543f8f1d0c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 29 Sep 2023 11:02:47 +0200
Subject: [PATCH 0791/1398] Add benchmarking scripts

---
 .../benchmark/Alpha_wrap_3/CMakeLists.txt     |  15 +
 .../compute_performance_benchmark_data.py     |  61 ++++
 .../generate_performance_benchmark_charts.py  | 156 ++++++++++
 .../Performance/performance_benchmark.cpp     |  65 +++++
 .../Quality/compute_quality_benchmark_data.py |  54 ++++
 .../Alpha_wrap_3/Quality/distance_utils.h     | 151 ++++++++++
 .../generate_quality_benchmark_charts.py      | 182 ++++++++++++
 .../Quality/quality_benchmark.cpp             | 271 ++++++++++++++++++
 .../compute_robustness_benchmark_data.py      |  96 +++++++
 .../generate_robustness_benchmark_charts.py   | 154 ++++++++++
 .../Robustness/robustness_benchmark.cpp       | 106 +++++++
 .../benchmark/Alpha_wrap_3/benchmarking.sh    |  86 ++++++
 .../CGAL/Alpha_wrap_3/internal/validation.h}  |   0
 .../test_AW3_cavity_initializations.cpp       |   2 +-
 .../Alpha_wrap_3/test_AW3_manifoldness.cpp    |   2 +-
 .../Alpha_wrap_3/test_AW3_multiple_calls.cpp  |   2 +-
 .../Alpha_wrap_3/test_alpha_wrap_3_mesh.cpp   |   2 +-
 17 files changed, 1401 insertions(+), 4 deletions(-)
 create mode 100644 Alpha_wrap_3/benchmark/Alpha_wrap_3/CMakeLists.txt
 create mode 100644 Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/compute_performance_benchmark_data.py
 create mode 100644 Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/generate_performance_benchmark_charts.py
 create mode 100644 Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/performance_benchmark.cpp
 create mode 100644 Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/compute_quality_benchmark_data.py
 create mode 100644 Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/distance_utils.h
 create mode 100644 Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/generate_quality_benchmark_charts.py
 create mode 100644 Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/quality_benchmark.cpp
 create mode 100755 Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py
 create mode 100644 Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/generate_robustness_benchmark_charts.py
 create mode 100644 Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp
 create mode 100755 Alpha_wrap_3/benchmark/Alpha_wrap_3/benchmarking.sh
 rename Alpha_wrap_3/{test/Alpha_wrap_3/alpha_wrap_validation.h => include/CGAL/Alpha_wrap_3/internal/validation.h} (100%)

diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/CMakeLists.txt b/Alpha_wrap_3/benchmark/Alpha_wrap_3/CMakeLists.txt
new file mode 100644
index 000000000000..a9aa0d1d63cb
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/CMakeLists.txt
@@ -0,0 +1,15 @@
+# Created by the script cgal_create_cmake_script
+# This is the CMake script for compiling a CGAL application.
+
+cmake_minimum_required(VERSION 3.1...3.20)
+project(Alpha_wrap_3_Benchmark)
+
+find_package(CGAL REQUIRED)
+
+include_directories (BEFORE ../../include ./Quality ./Robustness) # AW3 includes
+include_directories (BEFORE ../../../CGAL-Patches/include)
+
+# create a target per cppfile
+create_single_source_cgal_program("Performance/performance_benchmark.cpp")
+create_single_source_cgal_program("Quality/quality_benchmark.cpp")
+create_single_source_cgal_program("Robustness/robustness_benchmark.cpp")
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/compute_performance_benchmark_data.py b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/compute_performance_benchmark_data.py
new file mode 100644
index 000000000000..86c57d351465
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/compute_performance_benchmark_data.py
@@ -0,0 +1,61 @@
+# Copyright (c) 2019-2023 Google LLC (USA).
+# All rights reserved.
+#
+# This file is part of CGAL (www.cgal.org).
+#
+# $URL$
+# $Id$
+# SPDX-License-Identifier: GPL-3.0-or-later
+#
+#
+# Author(s)     : Pierre Alliez
+#                 Michael Hemmer
+#                 Cedric Portaneri
+#
+#!/usr/bin/python
+
+import os, sys, subprocess, datetime, time, getopt
+
+def compute_performance_benchmark_data(execname, filename, alpha):
+
+ output = ""
+ cmd = ("/usr/bin/time", "-v",
+        execname, "-i",
+        filename, "-a", alpha)
+ proc = subprocess.Popen(
+     cmd,
+     stdout=subprocess.PIPE,
+     stderr=subprocess.PIPE,
+     start_new_session=True)
+
+ outs, errs = proc.communicate()
+ output = outs.decode("utf-8") + errs.decode("utf-8")
+
+ for output_line in output.split("\n"):
+   if "User time (seconds): " in output_line:
+     print(output_line[len("User time (seconds):  "):])
+     continue
+   if "Maximum resident set size (kbytes): " in output_line:
+     print(output_line[len("Maximum resident set size (kbytes):  "):])
+     continue
+
+def main(argv):
+  execname=""
+  filename=""
+  alpha=""
+  try:
+    opts, args = getopt.getopt(sys.argv[1:], 'e:i:a:')
+  except getopt.GetoptError:
+    sys.exit(2)
+  for opt, arg in opts:
+    if opt == "-e":
+      execname = arg
+    elif opt == "-i":
+      filename = arg
+    elif opt == "-a":
+      alpha = arg
+
+  compute_performance_benchmark_data(execname, filename, alpha)
+
+if __name__ == "__main__":
+  main(sys.argv[1:])
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/generate_performance_benchmark_charts.py b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/generate_performance_benchmark_charts.py
new file mode 100644
index 000000000000..445b69232778
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/generate_performance_benchmark_charts.py
@@ -0,0 +1,156 @@
+# Copyright (c) 2019-2023 Google LLC (USA).
+# All rights reserved.
+#
+# This file is part of CGAL (www.cgal.org).
+#
+# $URL$
+# $Id$
+# SPDX-License-Identifier: GPL-3.0-or-later
+#
+#
+# Author(s)     : Pierre Alliez
+#                 Michael Hemmer
+#                 Cedric Portaneri
+#
+#!/usr/bin/python
+
+import os, sys, subprocess, datetime, time, signal, getopt
+import numpy as np
+import matplotlib.pyplot as plt
+
+def main(argv):
+
+  inputdir=""
+  outputdir=""
+  commit_hash=""
+  alpha=""
+  do_diff=False
+  diffdir=""
+  diff_hash=""
+  try:
+    opts, args = getopt.getopt(sys.argv[1:], 'i:a:o:c:d:p:')
+  except getopt.GetoptError:
+    sys.exit(2)
+  for opt, arg in opts:
+    if opt == "-i":
+      inputdir = arg
+    elif opt == "-a":
+      alpha = arg
+    elif opt == "-o":
+      outputdir = arg
+    elif opt == "-c":
+      commit_hash = arg
+    elif opt == "-d":
+      diff_hash = arg
+      do_diff = True
+    elif opt == "-p":
+      diffdir = arg
+
+  all_metric = {
+      "Time_(second)" : {},
+      "Memory_Peak_(kbytes)" : {}}
+  num_input = 0
+  for filename in os.listdir(inputdir) :
+    new_path = os.path.join(inputdir,filename)
+    new_file = open(new_path)
+    is_empty_new = os.path.getsize(new_path) <= 1
+    if do_diff :
+      old_path = os.path.join(diffdir,filename)
+      old_file = open(old_path)
+      is_empty_old = os.path.getsize(old_path) <= 1
+      for key in all_metric:
+        if is_empty_new or is_empty_old :
+          new_val = 0.
+          old_val = 0.
+        else :
+          new_val = float(new_file.readline().rstrip('\n'))
+          old_val = float(old_file.readline().rstrip('\n'))
+        mesh_id = str(filename.split('.')[0])
+        all_metric[key][mesh_id] = [new_val, old_val]
+    else :
+      for key in all_metric:
+         if is_empty_new :
+           new_val = 0.
+         else :
+           new_val = float(new_file.readline().rstrip('\n'))
+         mesh_id = str(filename.split('.')[0])
+         all_metric[key][mesh_id] = [new_val, new_val]
+    num_input = num_input+1
+
+  # update .pdf chart
+  date_now = datetime.datetime.now()
+  date_for_filename = str(date_now.year) +"_"+ str(date_now.month) +"_"+ str(date_now.day) +"_"+ str(date_now.hour) +"h"+ str(date_now.minute) +"mn"
+  for key in all_metric:
+    goal = 0
+    num_el = range(len(all_metric[key]))
+    avg_diff_to_goal = 0.
+    avg = 0.
+    x1 = []
+    x2 = []
+    for value in all_metric[key].values() :
+      avg += value[0]
+      diff_to_goal = abs(value[1]-goal) - abs(value[0]-goal)
+      avg_diff_to_goal += diff_to_goal
+      x1.append(value[0])
+      x2.append(value[1])
+    avg_diff_to_goal /= float(len(all_metric[key]))
+    avg /= float(len(all_metric[key]))
+
+    plt.figure(figsize=(8,8))
+    if do_diff :
+      plt.hist(x2, bins=100, color='tab:green', alpha=0.5)
+    plt.hist(x1, bins=100, color='tab:blue', alpha=0.5)
+    plt.vlines(x = goal, ymin=plt.ylim()[0], ymax=plt.ylim()[1], linestyles='dashed')
+
+    title = ""
+    if do_diff :
+      title += "Diff between " + commit_hash + " and " + diff_hash + " on " + str(num_input) + " meshes from Thingi10K\nAlpha = Bbox diag length / " + alpha
+    else :
+      title += "Benchmarking on " + str(num_input) + " meshes from Thingi10K\nAlpha = Bbox diag length / " + alpha
+
+    avg_str = str(format(abs(avg), '.2f'))
+    if key == "Time_(second)" :
+      title += "\nIn average we spend " + avg_str + " seconds"
+    else :
+      title += "\nIn average we use up to " +  avg_str + " kbytes"
+
+    if do_diff and avg_diff_to_goal == 0. :
+      title += "\nNo change between the two commits"
+    elif do_diff :
+      avg_diff_str = str(format(abs(avg_diff_to_goal), '.2f'))
+      if key == "Time_(second)" :
+        if avg_diff_to_goal < 0 :
+          title += "\nIn average we get slower by "
+        else :
+          title += "\nIn average we get faster "
+        title += avg_diff_str + " seconds"
+      else :
+        if avg_diff_to_goal < 0 :
+          title += "\nIn average we use " +  avg_diff_str + " more"
+        else :
+          title += "\nIn average we use " +  avg_diff_str + " less"
+        title += " kbytes"
+
+    plt.title(title, fontsize=15)
+    plt.xlabel(key.replace("_"," "), fontsize=14)
+    plt.ylabel("# of meshes", fontsize=14)
+    plt.tick_params(axis="x", labelsize=9)
+    plt.tick_params(axis="y", labelsize=9)
+
+    chart_filename = ""
+    if do_diff :
+      chart_filename += "diff_"+commit_hash+"_"+diff_hash+"_"+key+"_"+date_for_filename+".pdf"
+    else :
+      chart_filename += "results_"+commit_hash+"_"+key+"_"+date_for_filename+".pdf"
+    chart_path = os.path.join(outputdir+"/charts",chart_filename)
+    if os.path.isfile(chart_path) :
+      os.remove(chart_path)
+    plt.savefig(chart_path, bbox_inches="tight")
+    plt.close()
+
+  print("pdf updated")
+
+  sys.exit()
+
+if __name__ == "__main__":
+  main(sys.argv[1:])
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/performance_benchmark.cpp b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/performance_benchmark.cpp
new file mode 100644
index 000000000000..207b4704635a
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/performance_benchmark.cpp
@@ -0,0 +1,65 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/alpha_wrap_3.h>
+
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <array>
+#include <iostream>
+#include <string>
+#include <vector>
+
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Point_3 = K::Point_3;
+using Vector_3 = K::Vector_3;
+
+using Mesh = CGAL::Surface_mesh<Point_3>;
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+int main(int argc, char** argv)
+{
+  const int argc_check = argc - 1;
+  const char* entry_name_ptr = nullptr;
+  double relative_alpha_ratio = 20., relative_offset_ratio = 600.;
+
+  for(int i=1; i<argc; ++i)
+  {
+    if(!strcmp("-i", argv[i]) && i < argc_check)
+      entry_name_ptr = argv[++i];
+    else if(!strcmp("-a", argv[i]) && i < argc_check)
+      relative_alpha_ratio = std::stod(argv[++i]);
+    else if(!strcmp("-d", argv[i]) && i < argc_check)
+      relative_offset_ratio = std::stod(argv[++i]);
+  }
+
+  if(argc < 3 || relative_alpha_ratio <= 0.)
+  {
+    std::cerr << "Error: bad input parameters." << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::vector<Point_3> points;
+  std::vector<std::array<std::size_t, 3> > faces;
+  if(!CGAL::IO::read_polygon_soup(entry_name_ptr, points, faces) || faces.empty())
+  {
+    std::cerr << "Error: Invalid input data." << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  CGAL::Bbox_3 bbox;
+  for(const Point_3& p : points)
+    bbox += p.bbox();
+
+  const double diag_length = std::sqrt(CGAL::square(bbox.xmax() - bbox.xmin()) +
+                                       CGAL::square(bbox.ymax() - bbox.ymin()) +
+                                       CGAL::square(bbox.zmax() - bbox.zmin()));
+  const double alpha = diag_length / relative_alpha_ratio;
+  const double offset = diag_length / relative_offset_ratio;
+
+  Mesh wrap;
+  CGAL::alpha_wrap_3(points, faces, alpha, offset, wrap);
+
+  return EXIT_SUCCESS;
+}
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/compute_quality_benchmark_data.py b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/compute_quality_benchmark_data.py
new file mode 100644
index 000000000000..3b996cb57490
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/compute_quality_benchmark_data.py
@@ -0,0 +1,54 @@
+# Copyright (c) 2019-2023 Google LLC (USA).
+# All rights reserved.
+#
+# This file is part of CGAL (www.cgal.org).
+#
+# $URL$
+# $Id$
+# SPDX-License-Identifier: GPL-3.0-or-later
+#
+#
+# Author(s)     : Pierre Alliez
+#                 Michael Hemmer
+#                 Cedric Portaneri
+#
+#!/usr/bin/python
+
+import os, sys, subprocess, datetime, time, getopt
+
+def compute_quality_benchmark_data(execname, filename, alpha):
+
+ output = ""
+ cmd = (execname, "-i",
+        filename, "-a", alpha)
+ proc = subprocess.Popen(
+     cmd,
+     stdout=subprocess.PIPE,
+     stderr=subprocess.PIPE,
+     start_new_session=True)
+
+ outs, errs = proc.communicate()
+ output = outs.decode("utf-8") + errs.decode("utf-8")
+
+ print(output)
+
+def main(argv):
+  execname=""
+  filename=""
+  alpha=""
+  try:
+    opts, args = getopt.getopt(sys.argv[1:], 'e:i:a:')
+  except getopt.GetoptError:
+    sys.exit(2)
+  for opt, arg in opts:
+    if opt == "-e":
+      execname = arg
+    elif opt == "-i":
+      filename = arg
+    elif opt == "-a":
+      alpha = arg
+
+  compute_quality_benchmark_data(execname, filename, alpha)
+
+if __name__ == "__main__":
+  main(sys.argv[1:])
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/distance_utils.h b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/distance_utils.h
new file mode 100644
index 000000000000..379573e9c90a
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/distance_utils.h
@@ -0,0 +1,151 @@
+// Copyright (c) 2019-2022 Google LLC (USA).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Pierre Alliez
+//                 Michael Hemmer
+//                 Cedric Portaneri
+
+#ifndef CGAL_ALPHA_WRAP_3_BENCHMARK_ALPHA_WRAP_3_QUALITY_DISTANCE_H_
+#define CGAL_ALPHA_WRAP_3_BENCHMARK_ALPHA_WRAP_3_QUALITY_DISTANCE_H_
+
+#include <CGAL/AABB_face_graph_triangle_primitive.h>
+#include <CGAL/AABB_traits.h>
+#include <CGAL/AABB_tree.h>
+#include <CGAL/bounding_box.h>
+#include <CGAL/Polygon_mesh_processing/bbox.h>
+#include <CGAL/Polygon_mesh_processing/distance.h>
+#include <CGAL/point_generators_3.h>
+#include <CGAL/Search_traits_3.h>
+
+namespace Aw3i {
+
+enum Distance_metric { HAUSDORFF = 0, MEAN = 1, RMS = 2 };
+
+template <typename Point, typename AABBTree>
+inline double approximate_hausdorff_distance(const std::vector<Point>& sample_points,
+                                             const AABBTree& tree,
+                                             Point& hint)
+{
+  double hdist = 0;
+  for(const Point& pt : sample_points)
+  {
+    hint = tree.closest_point(pt, hint);
+    auto dist = CGAL::squared_distance(hint, pt);
+    double d = CGAL::to_double(CGAL::approximate_sqrt(dist));
+    if(d > hdist)
+      hdist = d;
+  }
+
+  return hdist;
+}
+
+template <typename Point, typename AABBTree>
+inline double approximate_mean_distance(const std::vector<Point>& sample_points,
+                                        const AABBTree& tree,
+                                        Point& hint)
+{
+  double mdist = 0;
+  for(const Point& pt : sample_points)
+  {
+    hint = tree.closest_point(pt, hint);
+    auto dist = CGAL::squared_distance(hint, pt);
+    double d = CGAL::to_double(CGAL::approximate_sqrt(dist));
+    mdist += d;
+  }
+
+  return mdist / sample_points.size();
+}
+
+template <typename Point, typename AABBTree>
+inline double approximate_rms_distance(const std::vector<Point>& sample_points,
+                                       const AABBTree& tree,
+                                       Point& hint)
+{
+  double rmsdist = 0;
+  for(const Point& pt : sample_points)
+  {
+    hint = tree.closest_point(pt, hint);
+    auto dist = CGAL::squared_distance(hint, pt);
+    rmsdist += CGAL::to_double(dist);
+  }
+
+  return CGAL::to_double(CGAL::approximate_sqrt(rmsdist / sample_points.size()));
+}
+
+template <typename TriangleMesh>
+inline double approximate_distance(const TriangleMesh& tm1,
+                                   const TriangleMesh& tm2,
+                                   const Distance_metric& metric)
+{
+  using GT = typename CGAL::GetGeomTraits<TriangleMesh>::type;
+  using Point_3 = typename GT::Point_3;
+
+  using Primitive = CGAL::AABB_face_graph_triangle_primitive<TriangleMesh>;
+  using AABB_traits = CGAL::AABB_traits<GT, Primitive>;
+  using AABB_tree = CGAL::AABB_tree<AABB_traits>;
+
+  using CGAL::parameters::choose_parameter;
+  using CGAL::parameters::get_parameter;
+
+  std::vector<Point_3> original_sample_points;
+  CGAL::Polygon_mesh_processing::sample_triangle_mesh(tm1, std::back_inserter(original_sample_points),
+                                                      CGAL::parameters::all_default());
+
+  std::vector<Point_3> sample_points(std::begin(original_sample_points),
+                                     std::end(original_sample_points));
+  CGAL::spatial_sort(sample_points.begin(), sample_points.end());
+
+  AABB_tree tree(faces(tm2).first, faces(tm2).second, tm2);
+  tree.build();
+
+  auto vpm_2 = get(CGAL::vertex_point, tm2);
+  Point_3 hint = get(vpm_2, *vertices(tm2).first);
+
+  if(metric == HAUSDORFF)
+    return approximate_hausdorff_distance(sample_points, tree, hint);
+  else if(metric == MEAN)
+    return approximate_mean_distance(sample_points, tree, hint);
+  else if(metric == RMS)
+    return approximate_rms_distance(sample_points, tree, hint);
+  else
+    std::cerr << "Metric unknown\n" << std::endl;
+
+  return -1.0;
+}
+
+template <typename TriangleMesh>
+double get_longest_diag_bbox(const TriangleMesh& tm)
+{
+  CGAL::Bbox_3 bbox = CGAL::Polygon_mesh_processing::bbox(tm);
+  return std::sqrt(CGAL::square(bbox.xmax() - bbox.xmin()) +
+                   CGAL::square(bbox.ymax() - bbox.ymin()) +
+                   CGAL::square(bbox.zmax() - bbox.zmin()));
+}
+
+template <typename TriangleMesh>
+inline double approximate_distance_relative_to_bbox(const TriangleMesh& tm1,
+                                                    const TriangleMesh& tm2,
+                                                    const Distance_metric& metric)
+{
+  double longest_diag_length = get_longest_diag_bbox(tm1);
+  return approximate_distance(tm1, tm2, metric) / longest_diag_length;
+}
+
+template <typename TriangleMesh, typename FT>
+inline double approximate_distance_relative_to_bbox(const TriangleMesh& tm1,
+                                                    const TriangleMesh& tm2,
+                                                    const Distance_metric& metric,
+                                                    const FT& longest_diag_length)
+{
+  return approximate_distance(tm1, tm2, metric) / CGAL::to_double(longest_diag_length);
+}
+
+} // namespace Aw3i
+
+#endif // CGAL_CGAL_ALPHA_WRAP_3_BENCHMARK_ALPHA_WRAP_3_QUALITY_DISTANCE_H_
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/generate_quality_benchmark_charts.py b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/generate_quality_benchmark_charts.py
new file mode 100644
index 000000000000..0df5ed5e0f4e
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/generate_quality_benchmark_charts.py
@@ -0,0 +1,182 @@
+# Copyright (c) 2019-2023 Google LLC (USA).
+# All rights reserved.
+#
+# This file is part of CGAL (www.cgal.org).
+#
+# $URL$
+# $Id$
+# SPDX-License-Identifier: GPL-3.0-or-later
+#
+#
+# Author(s)     : Pierre Alliez
+#                 Michael Hemmer
+#                 Cedric Portaneri
+#
+#!/usr/bin/python
+
+import os, sys, subprocess, datetime, time, signal, getopt
+import numpy as np
+import matplotlib.pyplot as plt
+
+def main(argv):
+
+  inputdir=""
+  outputdir=""
+  commit_hash=""
+  alpha=""
+  do_diff=False
+  diffdir=""
+  diff_hash=""
+  try:
+    opts, args = getopt.getopt(sys.argv[1:], 'i:a:o:c:d:p:')
+  except getopt.GetoptError:
+    sys.exit(2)
+  for opt, arg in opts:
+    if opt == "-i":
+      inputdir = arg
+    elif opt == "-a":
+      alpha = arg
+    elif opt == "-o":
+      outputdir = arg
+    elif opt == "-c":
+      commit_hash = arg
+    elif opt == "-d":
+      diff_hash = arg
+      do_diff = True
+    elif opt == "-p":
+      diffdir = arg
+
+  all_metric = {
+      "Mean_Min_Angle_(degree)" : {},
+      "Mean_Max_Angle_(degree)" : {},
+      "Mean_Radius_Ratio" : {},
+      "Mean_Edge_Ratio" : {},
+      "Mean_Aspect_Ratio" : {},
+      "Complexity_(#_of_triangle)" : {},
+      "#_of_almost_degenerate_triangle" : {},
+      "Hausdorff_distance_output_to_input_(%_of_bbox_diag)" : {}}
+  num_input = 0
+  print("inputdir = ", inputdir)
+  for filename in os.listdir(inputdir) :
+    new_path = os.path.join(inputdir,filename)
+    new_file = open(new_path)
+    if do_diff :
+      old_path = os.path.join(diffdir,filename)
+      old_file = open(old_path)
+      is_empty_old = os.path.getsize(old_path) <= 1
+      for key in all_metric :
+        try :
+          new_val = float(new_file.readline().rstrip('\n'))
+          old_val = float(old_file.readline().rstrip('\n'))
+          mesh_id = str(filename.split('.')[0])
+          all_metric[key][mesh_id] = [new_val, old_val]
+        except ValueError:
+          pass
+    else :
+      for key in all_metric :
+        try :
+          new_val = float(new_file.readline().rstrip('\n'))
+          mesh_id = str(filename.split('.')[0])
+          all_metric[key][mesh_id] = [new_val, new_val]
+        except ValueError:
+          pass
+    num_input = num_input+1
+
+  # update .pdf chart
+  date_now = datetime.datetime.now()
+  date_for_filename = str(date_now.year) +"_"+ str(date_now.month) +"_"+ str(date_now.day) +"_"+ str(date_now.hour) +"h"+ str(date_now.minute) +"mn"
+  for key in all_metric:
+    goal = 0
+    if key == "Mean_Min_Angle_(degree)" or key == "Mean_Max_Angle_(degree)":
+      goal = 60
+    elif key == "Mean_Radius_Ratio" or key == "Mean_Edge_Ratio" or key == "Mean_Aspect_Ratio" :
+      goal = 1
+
+    num_el = range(len(all_metric[key]))
+    avg_diff_to_goal = 0.
+    avg = 0.
+    x1 = []
+    x2 = []
+    for value in all_metric[key].values() :
+      avg += value[0]
+      diff_to_goal = abs(value[1]-goal) - abs(value[0]-goal)
+      avg_diff_to_goal += diff_to_goal
+      x1.append(value[0])
+      x2.append(value[1])
+    avg_diff_to_goal /= float(len(all_metric[key]))
+    avg /= float(len(all_metric[key]))
+
+    plt.figure(figsize=(8,8))
+    if do_diff :
+      plt.hist(x2, bins=100, color='tab:green', alpha=0.5)
+    plt.hist(x1, bins=100, color='tab:blue', alpha=0.5)
+    plt.vlines(x = goal, ymin=plt.ylim()[0], ymax=plt.ylim()[1], linestyles='dashed')
+
+    title = ""
+    if do_diff :
+      title += "Diff between " + commit_hash + " and " + diff_hash + " on " + str(num_input) + " meshes from Thingi10K\nAlpha = Bbox diag length / " + alpha
+    else :
+      title += "Benchmarking on " + str(num_input) + " meshes from Thingi10K\nAlpha = Bbox diag length / " + alpha
+
+    avg_str = str(format(abs(avg), '.2f'))
+    if key == "Mean_Min_Angle_(degree)" or key == "Mean_Max_Angle_(degree)":
+      title += "\nIn average we have " + avg_str + "°"
+    elif key == "Mean_Radius_Ratio" or key == "Mean_Edge_Ratio" or key == "Mean_Aspect_Ratio" :
+      title += "\nIn average we have a ratio of " +  avg_str
+    elif key == "Hausdorff_distance_output_to_input_(%_of_bbox_diag)" :
+      title += "\nIn average we have a distance of " +  avg_str + "% of bbox diag"
+    elif key == "Complexity_(#_of_triangle)" or key == "#_of_almost_degenerate_triangle" :
+      title += "\nIn average we have " +  avg_str + " triangles"
+
+    if do_diff and avg_diff_to_goal == 0. :
+      title += "\nNo change between the two commits"
+    elif do_diff :
+      avg_diff_str = str(format(abs(avg_diff_to_goal), '.2f'))
+      if key == "Mean_Min_Angle_(degree)" or key == "Mean_Max_Angle_(degree)":
+        if avg_diff_to_goal < 0 :
+          title += "\nIn average we loose "
+        else :
+          title += "\nIn average we gain "
+        title += avg_diff_str + "° toward 60°"
+      elif key == "Mean_Radius_Ratio" or key == "Mean_Edge_Ratio" or key == "Mean_Aspect_Ratio" :
+        if avg_diff_to_goal < 0 :
+          title += "\nIn average we loose "
+        else :
+          title += "\nIn average we gain "
+        title += avg_diff_str + " of ratio toward 1"
+      elif key == "Hausdorff_distance_output_to_input_(%_of_bbox_diag)" :
+        if avg_diff_to_goal < 0 :
+          title += "\nIn average we increase by "
+        else :
+          title += "\nIn average we reduce by "
+        title += avg_diff_str + " the bbox ratio"
+      elif key == "Complexity_(#_of_triangle)" or key == "#_of_almost_degenerate_triangle" :
+        if avg_diff_to_goal < 0 :
+          title += "\nIn average we get " + avg_diff_str + " more"
+        else :
+          title += "\nIn average we get " +  avg_diff_str + " less"
+        title += " triangles"
+
+    plt.title(title, fontsize=15)
+    plt.xlabel(key.replace("_"," "), fontsize=14)
+    plt.ylabel("# of meshes", fontsize=14)
+    plt.tick_params(axis="x", labelsize=9)
+    plt.tick_params(axis="y", labelsize=9)
+
+    chart_filename = ""
+    if do_diff :
+      chart_filename += "diff_"+commit_hash+"_"+diff_hash+"_"+key+"_"+date_for_filename+".pdf"
+    else :
+      chart_filename += "results_"+commit_hash+"_"+key+"_"+date_for_filename+".pdf"
+    chart_path = os.path.join(outputdir+"/charts",chart_filename)
+    if os.path.isfile(chart_path) :
+      os.remove(chart_path)
+    plt.savefig(chart_path, bbox_inches="tight")
+    plt.close()
+
+  print("pdf updated")
+
+  sys.exit()
+
+if __name__ == "__main__":
+  main(sys.argv[1:])
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/quality_benchmark.cpp b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/quality_benchmark.cpp
new file mode 100644
index 000000000000..4565cca641a1
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/quality_benchmark.cpp
@@ -0,0 +1,271 @@
+#include <distance_utils.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/alpha_wrap_3.h>
+
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+
+#include <array>
+#include <cmath>
+#include <iostream>
+
+using Kernel = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Point_3 = Kernel::Point_3;
+using Vector_3 = Kernel::Vector_3;
+using Triangle_3 = Kernel::Triangle_3;
+using FT = Kernel::FT;
+
+using Mesh = CGAL::Surface_mesh<Point_3>;
+using face_descriptor = boost::graph_traits<Mesh>::face_descriptor;
+
+using Oracle = CGAL::Alpha_wraps_3::internal::Triangle_mesh_oracle<Kernel>;
+using Dt = CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle>::Triangulation;
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+std::array<FT, 3> triangle_angles(const Triangle_3& tr)
+{
+  FT sq_a = CGAL::squared_distance(tr[0], tr[1]);
+  FT sq_b = CGAL::squared_distance(tr[1], tr[2]);
+  FT sq_c = CGAL::squared_distance(tr[2], tr[0]);
+
+  FT two_ab = 2. * CGAL::sqrt(sq_a) * CGAL::sqrt(sq_b);
+  FT two_bc = 2. * CGAL::sqrt(sq_b) * CGAL::sqrt(sq_c);
+  FT two_ca = 2. * CGAL::sqrt(sq_c) * CGAL::sqrt(sq_a);
+
+  FT angle_a = (sq_b + sq_c - sq_a) / two_bc;
+  FT angle_b = (sq_c + sq_a - sq_b) / two_ca;
+  FT angle_c = (sq_a + sq_b - sq_c) / two_ab;
+  if(angle_a < -1.) angle_a = -1.;
+  if(angle_b < -1.) angle_b = -1.;
+  if(angle_c < -1.) angle_c = -1.;
+  if(angle_a > 1.) angle_a = 1.;
+  if(angle_b > 1.) angle_b = 1.;
+  if(angle_c > 1.) angle_c = 1.;
+  angle_a = std::acos(angle_a);
+  angle_b = std::acos(angle_b);
+  angle_c = std::acos(angle_c);
+
+  return {angle_a, angle_b, angle_c};
+}
+
+bool is_almost_degenerate(const Triangle_3& tr,
+                          double threshold)
+{
+  FT sq_area = tr.squared_area();
+  return (CGAL::sqrt(CGAL::to_double(sq_area)) < threshold);
+}
+
+auto surface_mesh_face_to_triangle(const face_descriptor fd,
+                                   const Mesh& sm)
+{
+  typename boost::graph_traits<Mesh>::halfedge_descriptor hd = halfedge(fd,sm);
+   return Triangle_3(sm.point(target(hd,sm)),
+                     sm.point(target(next(hd,sm),sm)),
+                     sm.point(target(next(next(hd,sm),sm),sm)));
+}
+
+double mean_min_angle(const Mesh& mesh)
+{
+  double mean_min_angle = 0.;
+  for(const face_descriptor f : faces(mesh))
+  {
+    const Triangle_3 tr = surface_mesh_face_to_triangle(f, mesh);
+    std::array<FT, 3> angles = triangle_angles(tr);
+
+    FT min_angle = std::min({angles[0], angles[1], angles[2]});
+
+    min_angle = min_angle * (180.0 / CGAL_PI);
+    mean_min_angle += min_angle;
+  }
+
+  mean_min_angle /= static_cast<double>(mesh.number_of_faces());
+  return mean_min_angle;
+}
+
+double mean_max_angle(const Mesh& mesh)
+{
+  double mean_max_angle = 0.;
+  for(const face_descriptor f : faces(mesh))
+  {
+    const Triangle_3 tr = surface_mesh_face_to_triangle(f, mesh);
+    std::array<FT, 3> angles = triangle_angles(tr);
+
+    FT max_angle = std::max({angles[0], angles[1], angles[2]});
+
+    max_angle = max_angle * (180.0 / CGAL_PI);
+    mean_max_angle += max_angle;
+  }
+
+  mean_max_angle /= static_cast<double>(mesh.number_of_faces());
+  return mean_max_angle;
+}
+
+double mean_radius_ratio(const Mesh& mesh,
+                         double degenerate_threshold)
+{
+  double mean_radius_ratio = 0.;
+  size_t num_almost_degenerate_tri = 0;
+  for(const face_descriptor f : faces(mesh))
+  {
+    const Triangle_3 tr = surface_mesh_face_to_triangle(f, mesh);
+    if(is_almost_degenerate(tr, degenerate_threshold))
+    {
+      ++num_almost_degenerate_tri;
+      continue;
+    }
+
+    FT circumsphere_radius = std::sqrt(CGAL::squared_radius(tr[0], tr[1], tr[2]));
+
+    FT a = std::sqrt(CGAL::squared_distance(tr[0], tr[1]));
+    FT b = std::sqrt(CGAL::squared_distance(tr[1], tr[2]));
+    FT c = std::sqrt(CGAL::squared_distance(tr[2], tr[0]));
+    FT s = 0.5 * (a + b + c);
+    FT inscribed_radius = std::sqrt((s * (s - a) * (s - b) * (s - c)) / s);
+    FT radius_ratio = circumsphere_radius / inscribed_radius;
+    radius_ratio /= 2.;  // normalized
+    mean_radius_ratio += radius_ratio;
+  }
+
+  mean_radius_ratio /= static_cast<double>(mesh.number_of_faces() - num_almost_degenerate_tri);
+  return mean_radius_ratio;
+}
+
+double mean_edge_ratio(const Mesh& mesh,
+                       double degenerate_threshold)
+{
+  double mean_edge_ratio = 0.;
+  size_t num_almost_degenerate_tri = 0;
+
+  for(const face_descriptor f : faces(mesh))
+  {
+    const Triangle_3 tr = surface_mesh_face_to_triangle(f, mesh);
+    if(is_almost_degenerate(tr, degenerate_threshold))
+    {
+      ++num_almost_degenerate_tri;
+      continue;
+    }
+
+    FT a = std::sqrt(CGAL::squared_distance(tr[0], tr[1]));
+    FT b = std::sqrt(CGAL::squared_distance(tr[1], tr[2]));
+    FT c = std::sqrt(CGAL::squared_distance(tr[2], tr[0]));
+    FT min_edge = std::min({a, b, c});
+    FT max_edge = std::max({a, b, c});
+    FT edge_ratio = max_edge / min_edge;
+
+    mean_edge_ratio += edge_ratio;
+  }
+
+  mean_edge_ratio /= static_cast<double>(mesh.number_of_faces() - num_almost_degenerate_tri);
+  return mean_edge_ratio;
+}
+
+double mean_aspect_ratio(const Mesh& mesh,
+                         double degenerate_threshold)
+{
+  double mean_aspect_ratio = 0.;
+  size_t num_almost_degenerate_tri = 0;
+  for(const face_descriptor f : faces(mesh))
+  {
+    const Triangle_3 tr = surface_mesh_face_to_triangle(f, mesh);
+    if(is_almost_degenerate(tr, degenerate_threshold))
+    {
+      ++num_almost_degenerate_tri;
+      continue;
+    }
+
+    FT a = std::sqrt(CGAL::squared_distance(tr[0], tr[1]));
+    FT b = std::sqrt(CGAL::squared_distance(tr[1], tr[2]));
+    FT c = std::sqrt(CGAL::squared_distance(tr[2], tr[0]));
+    FT s = 0.5 * (a + b + c);
+    FT inscribed_radius = std::sqrt((s * (s - a) * (s - b) * (s - c)) / s);
+    FT max_edge = std::max({a, b, c});
+    FT aspect_ratio = max_edge / inscribed_radius;
+    aspect_ratio /= (2. * std::sqrt(3.));  // normalized
+    mean_aspect_ratio += aspect_ratio;
+  }
+
+  mean_aspect_ratio /= static_cast<double>(mesh.number_of_faces() - num_almost_degenerate_tri);
+  return mean_aspect_ratio;
+}
+
+size_t num_almost_degenerate_tri(const Mesh& mesh,
+                                 double degenerate_threshold)
+{
+  size_t num_almost_degenerate_tri = 0;
+  for(const face_descriptor f : faces(mesh))
+  {
+    const Triangle_3 tr = surface_mesh_face_to_triangle(f, mesh);
+    if(is_almost_degenerate(tr, degenerate_threshold))
+    {
+      ++num_almost_degenerate_tri;
+    }
+  }
+  return num_almost_degenerate_tri;
+}
+
+int main(int argc, char** argv)
+{
+  const int argc_check = argc - 1;
+  char *entry_name_ptr = nullptr;
+  double relative_alpha_ratio = 20.;
+  double relative_offset_ratio = 600.;
+
+  for(int i=1; i<argc; ++i)
+  {
+    if(!strcmp("-i", argv[i]) && i < argc_check) {
+      entry_name_ptr = argv[++i];
+    } else if(!strcmp("-a", argv[i]) && i < argc_check) {
+      relative_alpha_ratio = std::stod(argv[++i]);
+    } else if(!strcmp("-d", argv[i]) && i < argc_check) {
+      relative_offset_ratio = std::stod(argv[++i]);
+    }
+  }
+
+  if(argc < 3 || relative_alpha_ratio <= 0.)
+  {
+    std::cerr << "Error: bad input parameters." << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  Mesh input_mesh;
+  if(!PMP::IO::read_polygon_mesh(entry_name_ptr, input_mesh) ||
+     is_empty(input_mesh) ||
+     !is_triangle_mesh(input_mesh))
+  {
+    return EXIT_FAILURE;
+  }
+
+  CGAL::Bbox_3 bbox = PMP::bbox(input_mesh);
+  const double diag_length = std::sqrt(CGAL::square(bbox.xmax() - bbox.xmin()) +
+                                       CGAL::square(bbox.ymax() - bbox.ymin()) +
+                                       CGAL::square(bbox.zmax() - bbox.zmin()));
+  const double alpha = diag_length / relative_alpha_ratio;
+  const double offset = diag_length / relative_offset_ratio;
+
+  Mesh wrap;
+  CGAL::alpha_wrap_3(input_mesh, alpha, offset, wrap);
+
+  double degenerate_threshold = 0.;
+  for(const face_descriptor f : faces(wrap))
+  {
+    const Triangle_3 tr = surface_mesh_face_to_triangle(f, wrap);
+    degenerate_threshold += CGAL::sqrt(CGAL::to_double(tr.squared_area()));
+  }
+
+  degenerate_threshold /= wrap.number_of_faces();
+  degenerate_threshold /= 1000;
+
+  std::cout << mean_min_angle(wrap) << "\n";
+  std::cout << mean_max_angle(wrap) << "\n";
+  std::cout << mean_radius_ratio(wrap, degenerate_threshold) << "\n";
+  std::cout << mean_edge_ratio(wrap, degenerate_threshold) << "\n";
+  std::cout << mean_aspect_ratio(wrap, degenerate_threshold) << "\n";
+  std::cout << wrap.number_of_faces() << "\n";
+  std::cout << num_almost_degenerate_tri(wrap, degenerate_threshold) << "\n";
+  std::cout << 100. * approximate_distance_relative_to_bbox(wrap, input_mesh, Aw3i::HAUSDORFF) << "\n";
+
+  return 0;
+}
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py
new file mode 100755
index 000000000000..9e5fead9f864
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py
@@ -0,0 +1,96 @@
+# Copyright (c) 2019-2023 Google LLC (USA).
+# All rights reserved.
+#
+# This file is part of CGAL (www.cgal.org).
+#
+# $URL$
+# $Id$
+# SPDX-License-Identifier: GPL-3.0-or-later
+#
+#
+# Author(s)     : Pierre Alliez
+#                 Michael Hemmer
+#                 Cedric Portaneri
+#
+#!/usr/bin/python
+
+import os, sys, subprocess, datetime, time, signal, getopt
+
+def signal_handler(signum, frame):
+  raise Exception("Timed out!")
+
+def compute_robustness_benchmark_data(execname, filename, alpha, max_time):
+
+  exit_codes = {
+   0 : "VALID_SOLID_OUTPUT",
+   1 : "OUTPUT_IS_NOT_TRIANGLE_MESH",
+   2 : "OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD",
+   3 : "OUTPUT_HAS_BORDERS",
+   4 : "OUTPUT_HAS_DEGENERATED_FACES",
+   5 : "OUTPUT_HAS_GEOMETRIC_SELF_INTERSECTIONS",
+   6 : "OUTPUT_DOES_NOT_BOUND_VOLUME",
+   7 : "OUTPUT_DOES_NOT_CONTAIN_INPUT",
+   8 : "OUTPUT_DISTANCE_IS_TOO_LARGE",
+   9 : "SIGSEGV",
+   10 : "SIGABRT",
+   11 : "SIGFPE",
+   12 : "TIMEOUT"
+  }
+
+  exit_code = 0
+  output = ""
+  cmd = ("/usr/bin/time", "-v",
+         execname, "-i",
+         filename, "-a", alpha)
+  proc = subprocess.Popen(
+      cmd,
+      stdout=subprocess.PIPE,
+      stderr=subprocess.PIPE,
+      start_new_session=True)
+
+  try:
+    outs, errs = proc.communicate(timeout=int(max_time))
+    exit_code = proc.returncode
+    output = outs.decode("utf-8") + errs.decode("utf-8")
+
+    for output_line in output.split("\n"):
+      if output_line == "Command terminated by signal 11":
+        exit_code = 9
+        continue
+      elif output_line == "Command terminated by signal 6":
+        exit_code = 10
+        continue
+      elif output_line == "Command terminated by signal 8":
+        exit_code = 11
+        continue
+
+  except subprocess.TimeoutExpired:
+    os.killpg(os.getpgid(proc.pid), signal.SIGTERM)
+    exit_code = 12
+    output = "process ran too long"
+
+  print(exit_codes[exit_code])
+
+def main(argv):
+  execname=""
+  filename=""
+  alpha=""
+  max_time=""
+  try:
+    opts, args = getopt.getopt(sys.argv[1:], 'e:i:a:t:')
+  except getopt.GetoptError:
+    sys.exit(2)
+  for opt, arg in opts:
+    if opt == "-e":
+      execname = arg
+    elif opt == "-i":
+      filename = arg
+    elif opt == "-a":
+      alpha = arg
+    elif opt == "-t":
+      max_time = arg
+
+  compute_robustness_benchmark_data(execname, filename, alpha, max_time)
+
+if __name__ == "__main__":
+  main(sys.argv[1:])
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/generate_robustness_benchmark_charts.py b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/generate_robustness_benchmark_charts.py
new file mode 100644
index 000000000000..da313069594f
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/generate_robustness_benchmark_charts.py
@@ -0,0 +1,154 @@
+# Copyright (c) 2019-2023 Google LLC (USA).
+# All rights reserved.
+#
+# This file is part of CGAL (www.cgal.org).
+#
+# $URL$
+# $Id$
+# SPDX-License-Identifier: GPL-3.0-or-later
+#
+#
+# Author(s)     : Pierre Alliez
+#                 Michael Hemmer
+#                 Cedric Portaneri
+#
+#!/usr/bin/python
+
+import os, sys, subprocess, datetime, time, signal, getopt
+import numpy as np
+import matplotlib.pyplot as plt
+
+def main(argv):
+
+  inputdir=""
+  outputdir=""
+  commit_hash=""
+  alpha=""
+  try:
+    opts, args = getopt.getopt(sys.argv[1:], 'i:a:o:c:')
+  except getopt.GetoptError:
+    sys.exit(2)
+  for opt, arg in opts:
+    if opt == "-i":
+      inputdir = arg
+    elif opt == "-a":
+      alpha = arg
+    elif opt == "-o":
+      outputdir = arg
+    elif opt == "-c":
+      commit_hash = arg
+
+  exit_codes = {
+   0 : "VALID_SOLID_OUTPUT",
+   1 : "OUTPUT_IS_NOT_TRIANGLE_MESH",
+   2 : "OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD",
+   3 : "OUTPUT_HAS_BORDERS",
+   4 : "OUTPUT_HAS_DEGENERATED_FACES",
+   5 : "OUTPUT_HAS_GEOMETRIC_SELF_INTERSECTIONS",
+   6 : "OUTPUT_DOES_NOT_BOUND_VOLUME",
+   7 : "OUTPUT_DOES_NOT_CONTAIN_INPUT",
+   8 : "OUTPUT_DISTANCE_IS_TOO_LARGE",
+   9 : "SIGSEGV",
+   10 : "SIGABRT",
+   11 : "SIGFPE",
+   12 : "TIMEOUT"
+  }
+
+  current_run_data = {
+   "VALID_SOLID_OUTPUT" : 0,
+   "OUTPUT_IS_NOT_TRIANGLE_MESH" : 0,
+   "OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD" : 0,
+   "OUTPUT_HAS_BORDERS" : 0,
+   "OUTPUT_HAS_DEGENERATED_FACES" : 0,
+   "OUTPUT_HAS_GEOMETRIC_SELF_INTERSECTIONS" : 0,
+   "OUTPUT_DOES_NOT_BOUND_VOLUME" : 0,
+   "OUTPUT_DOES_NOT_CONTAIN_INPUT" : 0,
+   "OUTPUT_DISTANCE_IS_TOO_LARGE" : 0,
+   "SIGSEGV" : 0,
+   "SIGABRT" : 0,
+   "SIGFPE" : 0,
+   "TIMEOUT" : 0
+  }
+
+  filenames_per_codes = {}
+  for key in current_run_data :
+   filenames_per_codes[key] = []
+
+  print("inputdir = ", inputdir)
+
+  num_input = 0
+  for filename in os.listdir(inputdir) :
+    print("filename = ", filename)
+
+    f = open(os.path.join(inputdir,filename))
+    status = f.readline().rstrip('\n');
+    current_run_data[status] += 1
+    filenames_per_codes[status].append(filename.rstrip('.log'))
+    num_input = num_input+1
+
+  # sort current_run_data by value
+  current_run_data = {k: v for k, v in sorted(current_run_data.items(), key=lambda item: item[1], reverse=True)}
+
+  # update chart data files
+  date_now = datetime.datetime.now()
+  date = str(date_now.year) +"-"+ str(date_now.month) +"-"+ str(date_now.day) +" "+ str(date_now.hour) +"h"+ str(date_now.minute) +"mn"
+
+  for key_filename in current_run_data:
+    f = open(os.path.join(outputdir+"/charts_data", key_filename+".txt"), "a+")
+    f.write(str(current_run_data[key_filename]) + " " + commit_hash + " " + date + "\n")
+
+  print("chart data updated")
+
+  # update .pdf chart
+  chart = plt.figure(figsize=(10, 7))
+  colormap = ["tab:blue","tab:orange","tab:green","tab:red","tab:purple","tab:brown","tab:pink","tab:gray","tab:olive","tab:cyan","b","palegreen", "peachpuff"]
+  plt.gca().set_prop_cycle('color', colormap)
+  plt.style.use('tableau-colorblind10')
+  for key_filename in current_run_data:
+
+    f = open(os.path.join(outputdir+"/charts_data", key_filename+".txt"), "r")
+    lines = f.readlines()
+    x_number_values = []
+    y_number_values = []
+    i = 0
+    for line in lines :
+      if i < (len(lines) - 10) :
+        i=i+1
+        continue
+
+      i=i+1
+      words = line.strip().split()
+      x_number_values.append(words[1]+"\n"+words[2]+"\n"+words[3])
+      y_number_values.append(int(words[0]))
+    plt.plot(x_number_values, y_number_values, marker='o', label=key_filename+": "+str(current_run_data[key_filename]))
+
+  plt.xlabel("Version", fontsize=14)
+  plt.ylabel("# of mesh", fontsize=14)
+  plt.tick_params(axis="both", labelsize=9)
+  plt.title("Benchmarking on " + str(num_input) + " meshes from Thingi10K\nAlpha = Bbox diag length / " + alpha, fontsize=15)
+  plt.legend(loc='lower left', bbox_to_anchor= (1.01, 0.58), ncol=1,
+  borderaxespad=0, frameon=False)
+
+  date_for_filename = str(date_now.year) +"-"+ str(date_now.month) +"-"+ str(date_now.day) +"-"+ str(date_now.hour) +"h"+ str(date_now.minute) +"mn"
+  chart_filename = os.path.join(outputdir+"/charts","benchmarking_version_"+commit_hash+"-"+date_for_filename+".pdf")
+  if os.path.isfile(chart_filename) :
+     os.remove(chart_filename)
+  chart.savefig(chart_filename, bbox_inches="tight")
+  plt.close(chart)
+
+  print("pdf updated")
+
+  # dump filenames per codes
+  log_dirname = os.path.join(outputdir, "log/"+commit_hash+"-"+date_for_filename)
+  if not os.path.exists(log_dirname):
+    os.mkdir(log_dirname)
+  for key in filenames_per_codes :
+   file = open(os.path.join(log_dirname, key+".txt"), "w+")
+   for filename in filenames_per_codes[key] :
+     file.write(filename + "\n")
+   file.close()
+
+  sys.exit()
+
+if __name__ == "__main__":
+  main(sys.argv[1:])
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp
new file mode 100644
index 000000000000..57f58b342bd5
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp
@@ -0,0 +1,106 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/alpha_wrap_3.h>
+#include <CGAL/Alpha_wrap_3/internal/validation.h>
+
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+
+using Kernel = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Point_3 = Kernel::Point_3;
+using Mesh = CGAL::Surface_mesh<Point_3>;
+
+namespace CGAL {
+namespace Alpha_wraps_3 {
+namespace internal {
+namespace {
+
+enum Robustness_benchmark_exit_code
+{
+  // Success
+  VALID_SOLID_OUTPUT = 0,
+
+  // Failure
+  OUTPUT_IS_NOT_TRIANGLE_MESH = 1,
+  OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD = 2,
+  OUTPUT_HAS_BORDERS = 3,
+  OUTPUT_HAS_DEGENERATED_FACES = 4,
+  OUTPUT_HAS_GEOMETRIC_SELF_INTERSECTIONS = 5,
+  OUTPUT_DOES_NOT_BOUND_VOLUME = 6,
+  OUTPUT_DOES_NOT_CONTAIN_INPUT = 7,
+  OUTPUT_DISTANCE_IS_TOO_LARGE = 8,
+};
+
+} // namespace
+} // namespace internal
+} // namespace Alpha_wraps_3
+} // namespace CGAL
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+namespace AW3i = CGAL::Alpha_wraps_3::internal;
+
+int main(int argc, char** argv)
+{
+  const int argc_check = argc - 1;
+  char* entry_name_ptr = nullptr;
+  double relative_alpha_ratio = 20.;
+  double relative_offset_ratio = 600.;
+
+  for(int i=1; i<argc; ++i)
+  {
+    if(!strcmp("-i", argv[i]) && i < argc_check) {
+      entry_name_ptr = argv[++i];
+    } else if(!strcmp("-a", argv[i]) && i < argc_check) {
+      relative_alpha_ratio = std::stod(argv[++i]);
+    } else if(!strcmp("-d", argv[i]) && i < argc_check) {
+      relative_offset_ratio = std::stod(argv[++i]);
+    }
+  }
+
+  if(argc < 3 || relative_alpha_ratio <= 0.)
+    return AW3i::VALID_SOLID_OUTPUT;
+
+  Mesh input_mesh;
+  if(!PMP::IO::read_polygon_mesh(entry_name_ptr, input_mesh) ||
+     is_empty(input_mesh) ||
+     !is_triangle_mesh(input_mesh))
+  {
+    return AW3i::VALID_SOLID_OUTPUT;
+  }
+
+  const CGAL::Bbox_3 bbox = PMP::bbox(input_mesh);
+  const double diag_length = std::sqrt(CGAL::square(bbox.xmax() - bbox.xmin()) +
+                                       CGAL::square(bbox.ymax() - bbox.ymin()) +
+                                       CGAL::square(bbox.zmax() - bbox.zmin()));
+  const double alpha = diag_length / relative_alpha_ratio;
+  const double offset = diag_length / relative_offset_ratio;
+
+  Mesh wrap;
+  alpha_wrap_3(input_mesh, alpha, offset, wrap);
+
+  if(!is_triangle_mesh(wrap))
+    return AW3i::OUTPUT_IS_NOT_TRIANGLE_MESH;
+
+  if(!is_closed(wrap))
+    return AW3i::OUTPUT_HAS_BORDERS;
+
+  if(AW3i::has_degenerated_faces(wrap))
+    return AW3i::OUTPUT_HAS_DEGENERATED_FACES;
+
+  if(AW3i::is_combinatorially_non_manifold(wrap))
+    return AW3i::OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD;
+
+  if(PMP::does_self_intersect(wrap))
+    return AW3i::OUTPUT_HAS_GEOMETRIC_SELF_INTERSECTIONS;
+
+  if(!PMP::does_bound_a_volume(wrap))
+    return AW3i::OUTPUT_DOES_NOT_BOUND_VOLUME;
+
+  if(!AW3i::is_outer_wrap_of_triangle_mesh(wrap, input_mesh))
+    return AW3i::OUTPUT_DOES_NOT_CONTAIN_INPUT;
+
+  if(!AW3i::has_expected_Hausdorff_distance(wrap, input_mesh, alpha, offset))
+     return AW3i::OUTPUT_DISTANCE_IS_TOO_LARGE;
+
+  return AW3i::VALID_SOLID_OUTPUT;
+}
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/benchmarking.sh b/Alpha_wrap_3/benchmark/Alpha_wrap_3/benchmarking.sh
new file mode 100755
index 000000000000..d6c74139c5a5
--- /dev/null
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/benchmarking.sh
@@ -0,0 +1,86 @@
+# Copyright (c) 2019-2023 Google LLC (USA).
+# All rights reserved.
+#
+# This file is part of the 3D Alpha Wrapping package, which is being prepared for
+# submission to CGAL (www.cgal.org).
+#
+# $URL$
+# $Id$
+# SPDX-License-Identifier: GPL-3.0-or-later
+#
+#
+# Author(s)     : Pierre Alliez
+#                 Michael Hemmer
+#                 Cedric Portaneri
+#                 Mael Rouxel-Labbé
+#
+
+#!/bin/bash
+
+# $1: directory containing the alpha wrap project
+# $2: directory containing the output results
+# $3: alpha value
+# $4: timeout value in seconds
+# $5: hash of the latest commit
+# $6: the input file path
+function compute_benchmark_data() {
+  filename=$(basename -- "$6")
+  filename="${filename%.*}"
+
+  python3 $1/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py \
+   -e $1/Alpha_wrap_3/benchmark/Alpha_wrap_3/build-release/robustness_benchmark -i $6 -a $3 -t $4 \
+   > $2/Robustness/results/$5/$filename.log
+
+  python3 $1/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/compute_performance_benchmark_data.py \
+   -e $1/Alpha_wrap_3/benchmark/Alpha_wrap_3/build-release/performance_benchmark -i $6 -a $3 \
+   > $2/Performance/results/$5/$filename.log
+
+  python3 $1/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/compute_quality_benchmark_data.py \
+   -e $1/Alpha_wrap_3/benchmark/Alpha_wrap_3/build-release/quality_benchmark -i $6 -a $3 \
+   > $2/Quality/results/$5/$filename.log
+}
+export -f compute_benchmark_data
+
+# $1: directory containing the alpha wrap project
+# $2: directory containing the input data folder
+# $3: directory containing the output results
+# $4: alpha value
+# $5: timeout value for robustness benchmark in seconds
+# $6: number of virtual thread used
+# $7: hash of the latest commit
+# $8: hash of a commit to perform the diff with latest
+cd $1
+
+mkdir -p $3/Robustness/results/$7
+mkdir -p $3/Performance/results/$7
+mkdir -p $3/Quality/results/$7
+mkdir -p $3/Robustness/charts_data
+mkdir -p $3/Performance/charts_data
+mkdir -p $3/Quality/charts_data
+mkdir -p $3/Robustness/charts
+mkdir -p $3/Performance/charts
+mkdir -p $3/Quality/charts
+mkdir -p $3/Robustness/log
+mkdir -p $3/Performance/log
+mkdir -p $3/Quality/log
+mkdir -p $3/charts
+
+find $2 -mindepth 1 | parallel -j$6 compute_benchmark_data $1 $3 $4 $5 $7 :::
+
+python3 $1/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/generate_robustness_benchmark_charts.py -i $3/Robustness/results/$7 -o $3/Robustness -a $4 -c $7
+
+if [ -z "$8" ]; then
+  python3 $1/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/generate_performance_benchmark_charts.py -i $3/Performance/results/$7 -o $3/Performance -a $4 -c $7;
+else
+  python3 $1/Alpha_wrap_3/benchmark/Alpha_wrap_3/Performance/generate_performance_benchmark_charts.py -i $3/Performance/results/$7 -o $3/Performance -a $4 -c $7 -p $3/Performance/results/$8 -d $8;
+fi
+
+if [ -z "$8" ]; then
+  python3 $1/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/generate_quality_benchmark_charts.py -i $3/Quality/results/$7 -o $3/Quality -a $4 -c $7;
+else
+  python3 $1/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/generate_quality_benchmark_charts.py -i $3/Quality/results/$7 -o $3/Quality -a $4 -c $7 -p $3/Quality/results/$8 -d $8;
+fi
+
+charts_path="$(ls "$3/Robustness/charts"/* -dArt | tail -n 1) $(ls "$3/Performance/charts"/* -dArt | tail -n 2) $(ls "$3/Quality/charts"/* -dArt | tail -n 9)"
+
+pdfjam --nup 2x6 $charts_path --outfile $3/charts/results_$7_$8_alpha_$4_$(date '+%Y-%m-%d_%H:%M:%S').pdf
diff --git a/Alpha_wrap_3/test/Alpha_wrap_3/alpha_wrap_validation.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/validation.h
similarity index 100%
rename from Alpha_wrap_3/test/Alpha_wrap_3/alpha_wrap_validation.h
rename to Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/validation.h
diff --git a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp
index d7567bab205b..1e37919756ab 100644
--- a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp
+++ b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp
@@ -6,7 +6,7 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <CGAL/alpha_wrap_3.h>
-#include "alpha_wrap_validation.h"
+#include <CGAL/Alpha_wrap_3/internal/validation.h>
 
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 
diff --git a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_manifoldness.cpp b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_manifoldness.cpp
index 638431e30567..189cc73fa2dc 100644
--- a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_manifoldness.cpp
+++ b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_manifoldness.cpp
@@ -5,7 +5,7 @@
 //#define CGAL_AW3_DEBUG_QUEUE
 
 #include <CGAL/alpha_wrap_3.h>
-#include "alpha_wrap_validation.h"
+#include <CGAL/Alpha_wrap_3/internal/validation.h>
 
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
diff --git a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp
index e2abc6f1f12f..a7abdf6674e5 100644
--- a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp
+++ b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp
@@ -4,7 +4,7 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <CGAL/alpha_wrap_3.h>
-#include "alpha_wrap_validation.h"
+#include <CGAL/Alpha_wrap_3/internal/validation.h>
 
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/IO/polygon_soup_io.h>
diff --git a/Alpha_wrap_3/test/Alpha_wrap_3/test_alpha_wrap_3_mesh.cpp b/Alpha_wrap_3/test/Alpha_wrap_3/test_alpha_wrap_3_mesh.cpp
index 470d48e40d44..e7a362fc7098 100644
--- a/Alpha_wrap_3/test/Alpha_wrap_3/test_alpha_wrap_3_mesh.cpp
+++ b/Alpha_wrap_3/test/Alpha_wrap_3/test_alpha_wrap_3_mesh.cpp
@@ -6,7 +6,7 @@
 //#define CGAL_AW3_DEBUG_QUEUE
 
 #include <CGAL/alpha_wrap_3.h>
-#include "alpha_wrap_validation.h"
+#include <CGAL/Alpha_wrap_3/internal/validation.h>
 
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>

From 53c89475a379a29e6516b0d93746653c4b255e28 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 29 Sep 2023 11:12:17 +0200
Subject: [PATCH 0792/1398] Rename a variable

---
 Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
index ffcedc7f1cbb..4e96d6c1116c 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
@@ -105,8 +105,8 @@ int main(int argc, char** argv)
 
   CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle> aw3(oracle);
 
-  Mesh output_mesh;
-  aw3(alpha, offset, output_mesh);
+  Mesh wrap;
+  aw3(alpha, offset, wrap);
 
   t.stop();
   std::cout << "Took " << t.time() << std::endl;
@@ -123,7 +123,7 @@ int main(int argc, char** argv)
   std::string output_name = ts_name + "_" + ss_name + "_"  + ps_name + "_" + std::to_string(static_cast<int>(relative_alpha))
                             + "_" + std::to_string(static_cast<int>(relative_offset)) + ".off";
   std::cout << "Writing to " << output_name << std::endl;
-  CGAL::IO::write_polygon_mesh(output_name, output_mesh, CGAL::parameters::stream_precision(17));
+  CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
 
   return EXIT_SUCCESS;
 }

From e3854f68e3269da5d3ecb472c0f1a69f5f78999c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 29 Sep 2023 11:12:31 +0200
Subject: [PATCH 0793/1398] Expose useful typedefs from Alpha_wrapper_3

---
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h     | 8 +++++---
 1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 3ee6061d0d89..3aaabefd94fc 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -124,8 +124,13 @@ class Alpha_wrap_3
   using Default_Tds = CGAL::Triangulation_data_structure_3<Default_Vb, Default_Cbt>;
   using Default_Triangulation = CGAL::Delaunay_triangulation_3<Default_Gt, Default_Tds, Fast_location>;
 
+public:
   using Triangulation = typename Default::Get<Triangulation_, Default_Triangulation>::type;
 
+  // Use the geom traits from the triangulation, and trust the (advanced) user that provided it
+  using Geom_traits = typename Triangulation::Geom_traits;
+
+private:
   using Cell_handle = typename Triangulation::Cell_handle;
   using Facet = typename Triangulation::Facet;
   using Vertex_handle = typename Triangulation::Vertex_handle;
@@ -134,9 +139,6 @@ class Alpha_wrap_3
   using Gate = internal::Gate<Triangulation>;
   using Alpha_PQ = Modifiable_priority_queue<Gate, Less_gate, Gate_ID_PM<Triangulation>, CGAL_BOOST_PAIRING_HEAP>;
 
-  // Use the geom traits from the triangulation, and trust the (advanced) user that provided it
-  using Geom_traits = typename Triangulation::Geom_traits;
-
   using FT = typename Geom_traits::FT;
   using Point_3 = typename Geom_traits::Point_3;
   using Vector_3 = typename Geom_traits::Vector_3;

From cfae913d77ec5e346aed9e5d3c90e3d591dea4ae Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 29 Sep 2023 11:13:31 +0200
Subject: [PATCH 0794/1398] Complete the sort functor in AW3's main queue

---
 .../internal/gate_priority_queue.h             | 18 ++++++++++++++++++
 1 file changed, 18 insertions(+)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
index 5e14a4d08ea1..a9bdd7e0491b 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
@@ -68,6 +68,24 @@ struct Less_gate
   template <typename Tr>
   bool operator()(const Gate<Tr>& a, const Gate<Tr>& b) const
   {
+    // If one is artificial and the other is not, give priority to the artificial facet
+    //
+    // The artificial facet are given highest priority because they need to be treated
+    // regardless of their circumradius. Treating them first allow the part that depends
+    // on alpha to be treated uniformly in a way: whatever the alpha, we'll do the same
+    // first treatmen
+    if(a.is_artificial_facet() != b.is_artificial_facet())
+      return a.is_artificial_facet();
+
+    if(a.priority() == b.priority())
+    {
+      // arbitrary, the sole purpose is to make it a total order for determinism
+      if(a.facet().first->time_stamp() == b.facet().first->time_stamp())
+        return a.facet().second < b.facet().second;
+
+      return a.facet().first->time_stamp() < b.facet().first->time_stamp();
+    }
+
     return a.priority() > b.priority();
   }
 };

From 7e2386f97e9d935bd61d3120736832eca3200f78 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 29 Sep 2023 11:14:42 +0200
Subject: [PATCH 0795/1398] Use the real circumradius value to sort the facets

Meaning, use the value that we compare against alpha, and not
simply the radius of the smallest circumscribing ball.

This strongly changes the order of the queue and thus thus results
are very different, but still the same (same guarantees, same
element quality, only a little bit more elements, etc.)

Also a massive, ~35% speed-up, that needs to be investigated.
---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 11 +--
 .../Alpha_wrap_3/internal/geometry_utils.h    | 74 +++++++++++++++++++
 2 files changed, 80 insertions(+), 5 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 3aaabefd94fc..14ad83cdbd36 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1131,17 +1131,16 @@ class Alpha_wrap_3
     if(status == IRRELEVANT)
       return false;
 
+    const FT sqr = smallest_squared_radius_3(f, m_tr);
+    m_queue.resize_and_push(Gate(f, sqr, (status == ARTIFICIAL_FACET)));
+
+#ifdef CGAL_AW3_DEBUG_QUEUE
     const Cell_handle ch = f.first;
     const int s = f.second;
     const Point_3& p0 = m_tr.point(ch, Triangulation::vertex_triple_index(s, 0));
     const Point_3& p1 = m_tr.point(ch, Triangulation::vertex_triple_index(s, 1));
     const Point_3& p2 = m_tr.point(ch, Triangulation::vertex_triple_index(s, 2));
 
-    // @todo should prob be the real value that we compare to alpha instead of squared_radius
-    const FT sqr = geom_traits().compute_squared_radius_3_object()(p0, p1, p2);
-    m_queue.resize_and_push(Gate(f, sqr, (status == ARTIFICIAL_FACET)));
-
-#ifdef CGAL_AW3_DEBUG_QUEUE
     static int gid = 0;
     std::cout << "Queue insertion #" << gid++ << "\n"
               << "  ch = " << &*ch << " (" << m_tr.is_infinite(ch) << ") " << "\n"
@@ -1151,6 +1150,8 @@ class Alpha_wrap_3
     std::cout << "  Artificiality: " << (status == ARTIFICIAL_FACET) << std::endl;
 #endif
 
+    CGAL_assertion(status == ARTIFICIAL_FACET || sqr >= m_sq_alpha);
+
     return true;
   }
 
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
index 7d66cfd19f41..f39a47012862 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
@@ -154,6 +154,80 @@ less_squared_radius_of_min_empty_sphere(typename Tr::Geom_traits::FT sq_alpha,
   }
 }
 
+template <typename Tr>
+bool
+smallest_squared_radius_3(const typename Tr::Facet& fh,
+                          const Tr& tr)
+{
+  using Cell_handle = typename Tr::Cell_handle;
+  using Point = typename Tr::Point;
+  using FT = typename Tr::Geom_traits::FT;
+
+  using CK = typename Tr::Geom_traits;
+  using Exact_kernel = typename Exact_kernel_selector<CK>::Exact_kernel;
+  using Approximate_kernel = Simple_cartesian<Interval_nt_advanced>;
+  using C2A = Cartesian_converter<CK, Approximate_kernel>;
+  using C2E = typename Exact_kernel_selector<CK>::C2E;
+
+  using Orientation_of_circumcenter = Filtered_predicate<Orientation_of_circumcenter<Exact_kernel>,
+                                                         Orientation_of_circumcenter<Approximate_kernel>,
+                                                         C2E, C2A>;
+
+  Orientation_of_circumcenter orientation_of_circumcenter;
+
+  auto squared_radius = tr.geom_traits().compute_squared_radius_3_object();
+
+  const Cell_handle c = fh.first;
+  const int ic = fh.second;
+  const Cell_handle n = c->neighbor(ic);
+
+  const Point& p1 = tr.point(c, Tr::vertex_triple_index(ic,0));
+  const Point& p2 = tr.point(c, Tr::vertex_triple_index(ic,1));
+  const Point& p3 = tr.point(c, Tr::vertex_triple_index(ic,2));
+
+  // This is not actually possible in the context of alpha wrapping, but keeping it for genericity
+  // and because it does not cost anything.
+  if(tr.is_infinite(n))
+  {
+    Orientation ori = orientation_of_circumcenter(p1, p2, p3,
+                                                  tr.point(c, 0), tr.point(c, 1),
+                                                  tr.point(c, 2), tr.point(c, 3));
+    if(ori == POSITIVE)
+      return squared_radius(p1, p2, p3);
+    else
+      return squared_radius(tr.point(c, 0), tr.point(c, 1), tr.point(c, 2), tr.point(c, 3));
+  }
+
+  if(tr.is_infinite(c))
+  {
+    Orientation ori = orientation_of_circumcenter(p1, p2, p3,
+                                                  tr.point(n, 0), tr.point(n, 1),
+                                                  tr.point(n, 2), tr.point(n, 3));
+    if(ori == NEGATIVE)
+      return squared_radius(p1, p2, p3);
+    else
+      return squared_radius(tr.point(n, 0), tr.point(n, 1), tr.point(n, 2), tr.point(n, 3));
+  }
+
+  // both c and n are finite
+  if(orientation_of_circumcenter(p1, p2, p3,
+                                 tr.point(c, 0), tr.point(c, 1), tr.point(c, 2), tr.point(c, 3)) !=
+     orientation_of_circumcenter(p1, p2, p3,
+                                 tr.point(n, 0), tr.point(n, 1), tr.point(n, 2), tr.point(n, 3)))
+  {
+    // Dual crosses the face
+    return squared_radius(p1, p2, p3);
+  }
+  else
+  {
+    // Dual does not crosses the face
+    FT cr = squared_radius(tr.point(c, 0), tr.point(c, 1), tr.point(c, 2), tr.point(c, 3));
+    FT cnr = squared_radius(tr.point(n, 0), tr.point(n, 1), tr.point(n, 2), tr.point(n, 3));
+    return (CGAL::min)(cr, cnr);
+  }
+}
+
+
 } // namespace internal
 } // namespace Alpha_wraps_3
 } // namespace CGAL

From be42e0fbe887abff709b4c18d5070b5261ad71ca Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 29 Sep 2023 11:19:39 +0200
Subject: [PATCH 0796/1398] Minor debug code cleaning

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 21 +++++++++++--------
 1 file changed, 12 insertions(+), 9 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 14ad83cdbd36..a7130c2a3774 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1228,8 +1228,10 @@ class Alpha_wrap_3
       CGAL_precondition(!m_tr.is_infinite(f));
 
       const Cell_handle ch = f.first;
-      const int id = f.second;
-      const Cell_handle neighbor = ch->neighbor(id);
+      const int s = f.second;
+      CGAL_precondition(ch->is_outside());
+
+      const Cell_handle neighbor = ch->neighbor(s);
 
 #ifdef CGAL_AW3_DEBUG_QUEUE
       static int fid = 0;
@@ -1237,10 +1239,11 @@ class Alpha_wrap_3
       std::cout << m_queue.size() << " facets in the queue" << std::endl;
       std::cout << "Face " << fid++ << "\n"
                 << "c = " << &*ch << " (" << m_tr.is_infinite(ch) << "), n = " << &*neighbor << " (" << m_tr.is_infinite(neighbor) << ")" << "\n"
-                << m_tr.point(ch, Triangulation::vertex_triple_index(id, 0)) << "\n"
-                << m_tr.point(ch, Triangulation::vertex_triple_index(id, 1)) << "\n"
-                << m_tr.point(ch, Triangulation::vertex_triple_index(id, 2)) << std::endl;
-      std::cout << "Priority: " << gate.priority() << std::endl;
+                << m_tr.point(ch, Triangulation::vertex_triple_index(s, 0)) << "\n"
+                << m_tr.point(ch, Triangulation::vertex_triple_index(s, 1)) << "\n"
+                << m_tr.point(ch, Triangulation::vertex_triple_index(s, 2)) << std::endl;
+      std::cout << "Artificiality: " << gate.is_artificial_facet() << std::endl;
+      std::cout << "Priority: " << gate.priority() << " (sq alpha: " << m_sq_alpha << ")" << std::endl;
 #endif
 
       visitor.before_facet_treatment(*this, gate);
@@ -1255,9 +1258,9 @@ class Alpha_wrap_3
       std::string face_name = "results/steps/face_" + std::to_string(static_cast<int>(i++)) + ".xyz";
       std::ofstream face_out(face_name);
       face_out.precision(17);
-      face_out << "3\n" << m_tr.point(ch, Triangulation::vertex_triple_index(id, 0)) << "\n"
-                        << m_tr.point(ch, Triangulation::vertex_triple_index(id, 1)) << "\n"
-                        << m_tr.point(ch, Triangulation::vertex_triple_index(id, 2)) << std::endl;
+      face_out << "3\n" << m_tr.point(ch, Triangulation::vertex_triple_index(s, 0)) << "\n"
+                        << m_tr.point(ch, Triangulation::vertex_triple_index(s, 1)) << "\n"
+                        << m_tr.point(ch, Triangulation::vertex_triple_index(s, 2)) << std::endl;
       face_out.close();
 #endif
 

From 8ccce4c536ea7c3e04f1a15d34e6ca362ae84bf9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 29 Sep 2023 11:19:52 +0200
Subject: [PATCH 0797/1398] Avoid one useless facet check

This doesn't bring any speed-up because it was a very fast exit
in push_facet(): the neighbor was necessarily outside (since we
come from it), and we are done.
---
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h      | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index a7130c2a3774..2174363240b6 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1355,15 +1355,16 @@ class Alpha_wrap_3
           }
         }
       }
-      else
+      else // no need for a Steiner point, carve through and continue
       {
         // tag neighbor as OUTSIDE
         neighbor->is_outside() = true;
 
         // for each finite facet of neighbor, push it to the queue
-        for(int i=0; i<4; ++i)
+        const int mi = m_tr.mirror_index(ch, s);
+        for(int i=1; i<4; ++i)
         {
-          const Facet neighbor_f = std::make_pair(neighbor, i);
+          const Facet neighbor_f = std::make_pair(neighbor, (mi+i)&3);
           push_facet(neighbor_f);
         }
       }

From 3e632ecb629ecf9ca40235316f7ab516d256ee56 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Fri, 29 Sep 2023 15:00:08 +0200
Subject: [PATCH 0798/1398] Add missing functions capacity and upper bound in
 dart_range for cmap and lcc with index.

---
 .../Combinatorial_map_storages_with_index.h   |  6 ++-
 ..._linear_cell_complex_storages_with_index.h | 38 ++++++++++---------
 2 files changed, 26 insertions(+), 18 deletions(-)

diff --git a/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h b/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h
index f1e3d62cbab7..2b2ecf811830 100644
--- a/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h
+++ b/Combinatorial_map/include/CGAL/Combinatorial_map_storages_with_index.h
@@ -148,6 +148,10 @@ namespace CGAL {
       { return mmap.mdarts.is_used(i); }
       bool owns(size_type i) const
       { return mmap.mdarts.owns(i); }
+      size_type capacity() const
+      { return mmap.mdarts.capacity(); }
+      size_type upper_bound() const
+      { return mmap.mdarts.upper_bound(); }
     private:
       Self & mmap;
     };
@@ -444,7 +448,7 @@ namespace CGAL {
         (mattribute_containers).upper_bound();
     }
 
-    protected:
+  protected:
     // Set the handle on the i th attribute
     template<unsigned int i>
     void basic_set_dart_attribute(Dart_descriptor dh,
diff --git a/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages_with_index.h b/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages_with_index.h
index 56010ad433ab..96b388fd1728 100644
--- a/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages_with_index.h
+++ b/Linear_cell_complex/include/CGAL/CMap_linear_cell_complex_storages_with_index.h
@@ -99,14 +99,14 @@ namespace CGAL {
     {};
     template<int i>
     struct Attribute_const_descriptor:
-        public Helper::template Attribute_const_descriptor<i>
+      public Helper::template Attribute_const_descriptor<i>
     {};
     template<int i>
     struct Attribute_range: public Helper::template Attribute_range<i>
     {};
     template<int i>
     struct Attribute_const_range:
-        public Helper::template Attribute_const_range<i>
+      public Helper::template Attribute_const_range<i>
     {};
 
     typedef typename Attribute_type<0>::type Vertex_attribute;
@@ -169,6 +169,10 @@ namespace CGAL {
       { return mmap.mdarts.is_used(i); }
       bool owns(size_type i) const
       { return mmap.mdarts.owns(i); }
+      size_type capacity() const
+      { return mmap.mdarts.capacity(); }
+      size_type upper_bound() const
+      { return mmap.mdarts.upper_bound(); }
     private:
       Self & mmap;
     };
@@ -202,7 +206,7 @@ namespace CGAL {
      *  @return true iff the map is empty.
      */
     bool is_empty() const
-    { return  darts().empty(); }
+    { return darts().empty(); }
 
     /// @return the number of darts.
     size_type number_of_darts() const
@@ -288,18 +292,18 @@ namespace CGAL {
     typename Attribute_descriptor<i>::type attribute(Dart_descriptor ADart)
     {
       static_assert(Helper::template Dimension_index<i>::value>=0,
-                        "attribute<i> called but i-attributes are disabled.");
+                     "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
-          (mdarts[ADart].mattribute_descriptors);
+        (mdarts[ADart].mattribute_descriptors);
     }
     template<unsigned int i>
     typename Attribute_const_descriptor<i>::type
     attribute(Dart_const_descriptor ADart) const
     {
       static_assert(Helper::template Dimension_index<i>::value>=0,
-                        "attribute<i> called but i-attributes are disabled.");
+                     "attribute<i> called but i-attributes are disabled.");
       return std::get<Helper::template Dimension_index<i>::value>
-          (mdarts[ADart].mattribute_descriptors);
+        (mdarts[ADart].mattribute_descriptors);
     }
 
     // Copy a given attribute
@@ -360,7 +364,7 @@ namespace CGAL {
     {
       CGAL_assertion( ah!=null_descriptor );
       return std::get<Helper::template Dimension_index<i>::value>
-          (mattribute_containers)[ah];
+        (mattribute_containers)[ah];
     }
     template<unsigned int i>
     const typename Attribute_type<i>::type&
@@ -368,7 +372,7 @@ namespace CGAL {
     {
       CGAL_assertion( ah!=null_descriptor );
       return std::get<Helper::template Dimension_index<i>::value>
-          (mattribute_containers)[ah];
+        (mattribute_containers)[ah];
     }
 
     // Get the dart of the given attribute
@@ -486,14 +490,14 @@ namespace CGAL {
                                   typename Attribute_descriptor<i>::type ah)
     {
       std::get<Helper::template Dimension_index<i>::value>
-          (mdarts[dh].mattribute_descriptors) = ah;
+        (mdarts[dh].mattribute_descriptors) = ah;
     }
 
     /** Link a dart with a given dart for a given dimension.
-       * @param adart the dart to link.
-       * @param adart2 the dart to link with.
-       * @param i the dimension.
-       */
+     * @param adart the dart to link.
+     * @param adart2 the dart to link with.
+     * @param i the dimension.
+     */
     template<unsigned int i>
     void dart_link_beta(Dart_descriptor adart, Dart_descriptor adart2)
     {
@@ -509,9 +513,9 @@ namespace CGAL {
     }
 
     /** Unlink a dart for a given dimension.
-       * @param adart a dart.
-       * @param i the dimension.
-       */
+     * @param adart a dart.
+     * @param i the dimension.
+     */
     template<unsigned int i>
     void dart_unlink_beta(Dart_descriptor adart)
     {

From 05e11d381f952251538a134bd114871b1eb90173 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 9 Aug 2021 17:32:43 +0200
Subject: [PATCH 0799/1398] add experimental function to refine a mesh along an
 isocurve

---
 .../internal/refine_mesh_at_isolevel.h        | 129 ++++++++++++++++++
 .../Polygon_mesh_processing/CMakeLists.txt    |   5 +
 .../test_geodesic_isolevel_refinement.cmd     |   1 +
 .../test_geodesic_isolevel_refinement.cpp     |  63 +++++++++
 4 files changed, 198 insertions(+)
 create mode 100644 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h
 create mode 100644 Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cmd
 create mode 100644 Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cpp

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h
new file mode 100644
index 000000000000..f4b0f7cc6497
--- /dev/null
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h
@@ -0,0 +1,129 @@
+// Copyright (c) 2021 GeometryFactory (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+//
+// Author(s)     : Sebastien Loriot
+
+#ifndef CGAL_POLYGON_MESH_PROCESSING_CLIP_H
+#define CGAL_POLYGON_MESH_PROCESSING_CLIP_H
+
+#include <CGAL/license/Polygon_mesh_processing/corefinement.h>
+
+#include <CGAL/boost/graph/named_params_helper.h>
+
+namespace CGAL {
+namespace Polygon_mesh_processing {
+namespace experimental {
+
+
+template <class PolygonMesh, class ValueMap, class NamedParameters>
+void refine_mesh_at_isolevel(PolygonMesh& pm,
+                             ValueMap value_map,
+                             typename boost::property_traits<ValueMap>::value_type isovalue,
+                             const NamedParameters& np)
+{
+  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor edge_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+
+  using parameters::choose_parameter;
+  using parameters::get_parameter;
+  using parameters::is_default_parameter;
+
+  typedef Static_boolean_property_map<edge_descriptor, false>  Default_ECM;
+  typedef typename internal_np::Lookup_named_param_def<internal_np::edge_is_constrained_t,
+                                                       NamedParameters,
+                                                       Default_ECM>::type       ECM;
+  typedef typename GetVertexPointMap < PolygonMesh, NamedParameters>::type VPM;
+
+  VPM vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
+                             get_property_map(vertex_point, pm));
+
+  ECM ecm = choose_parameter(get_parameter(np, internal_np::edge_is_constrained), Default_ECM());
+
+  std::unordered_map<face_descriptor, std::vector<halfedge_descriptor> > faces_to_split;
+  std::vector<edge_descriptor> to_split;
+  for (edge_descriptor e : edges(pm))
+  {
+    vertex_descriptor src = source(e, pm), tgt = target(e, pm);
+    if (get(value_map, src)==isovalue)
+    {
+      for (halfedge_descriptor h : halfedges_around_source(halfedge(e, pm), pm))
+      {
+        face_descriptor f = face(h, pm);
+        if (f!=boost::graph_traits<PolygonMesh>::null_face())
+          faces_to_split[f].push_back(opposite(h, pm));
+      }
+      continue;
+    }
+    if (get(value_map, tgt)==isovalue)
+    {
+      for (halfedge_descriptor h : halfedges_around_target(halfedge(e, pm), pm))
+      {
+        face_descriptor f = face(h, pm);
+        if (f!=boost::graph_traits<PolygonMesh>::null_face())
+          faces_to_split[f].push_back(h);
+      }
+      continue;
+    }
+    if ( (get(value_map, tgt) < isovalue) != (get(value_map, src) < isovalue) )
+    {
+      to_split.push_back(e);
+    }
+  }
+
+  for (edge_descriptor e : to_split)
+  {
+    vertex_descriptor src = source(e, pm), tgt = target(e, pm);
+    double ds = get(value_map, src);
+    double dt = get(value_map, tgt);
+    double alpha = (isovalue - dt) / (ds - dt);
+    halfedge_descriptor hnew = CGAL::Euler::split_edge(halfedge(e, pm), pm);
+    put(vpm, target(hnew, pm), barycenter(get(vpm,src), alpha, get(vpm, tgt), 1-alpha));
+    put(value_map,  target(hnew, pm) , isovalue);
+    face_descriptor f = face(hnew, pm);
+    if (f!=boost::graph_traits<PolygonMesh>::null_face())
+      faces_to_split[f].push_back(hnew);
+    hnew=pm.prev(opposite(hnew, pm));
+    f = face(hnew, pm);
+    if (f!=boost::graph_traits<PolygonMesh>::null_face())
+      faces_to_split[f].push_back(hnew);
+  }
+
+  for (const auto& p : faces_to_split)
+  {
+    if(p.second.size()!=2) continue;
+
+    std::pair<edge_descriptor ,bool> res = edge(target(p.second[0],pm),
+                                                target(p.second[1],pm), pm);
+    if (res.second)
+    {
+      // no split as the edge already exists (the two vertices are on the isolevel)
+      put(ecm, res.first, true);
+      continue;
+    }
+
+    halfedge_descriptor hnew = CGAL::Euler::split_face(p.second[0], p.second[1], pm);
+    put(ecm, edge(hnew, pm), true);
+  }
+}
+
+template <class PolygonMesh, class ValueMap>
+void refine_mesh_at_isolevel(PolygonMesh& pm,
+                             ValueMap value_map,
+                             typename boost::property_traits<ValueMap>::value_type iso_level)
+{
+  refine_mesh_at_isolevel(pm, value_map, iso_level, parameters::all_default());
+}
+
+} } } // end of CGAL::Polygon_mesh_processing::experimental
+
+
+#endif
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index eb9b98cbe593..6f5d1e7c7ce9 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -125,6 +125,11 @@ else()
   message(STATUS "NOTICE: Tests are not using Ceres.")
 endif()
 
+if (TARGET CGAL::Eigen3_support)
+  create_single_source_cgal_program("test_geodesic_isolevel_refinement.cpp")
+  target_link_libraries( test_geodesic_isolevel_refinement PUBLIC CGAL::Eigen3_support)
+endif()
+
 if(BUILD_TESTING)
   set_tests_properties(
     "execution   of  triangulate_hole_Polyhedron_3_no_delaunay_test"
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cmd b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cmd
new file mode 100644
index 000000000000..36105ee3a020
--- /dev/null
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cmd
@@ -0,0 +1 @@
+${CGAL_DATA_DIR}/meshes/elephant.off 0.001 0.01 0.05 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 10
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cpp
new file mode 100644
index 000000000000..a2098c63e3b9
--- /dev/null
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cpp
@@ -0,0 +1,63 @@
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h>
+
+#include <CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h>
+#include <CGAL/Polygon_mesh_processing/connected_components.h>
+
+#include <fstream>
+#include <iostream>
+
+typedef CGAL::Simple_cartesian<double>                       Kernel;
+typedef Kernel::Point_3                                      Point_3;
+typedef CGAL::Surface_mesh<Point_3>                          Triangle_mesh;
+
+typedef boost::graph_traits<Triangle_mesh>::vertex_descriptor vertex_descriptor;
+typedef boost::graph_traits<Triangle_mesh>::edge_descriptor edge_descriptor;
+
+typedef Triangle_mesh::Property_map<vertex_descriptor,double> Vertex_distance_map;
+typedef CGAL::Heat_method_3::Surface_mesh_geodesic_distances_3<Triangle_mesh> Heat_method;
+
+int main(int argc, char* argv[])
+{
+  const char* filename = argv[1];
+
+  Triangle_mesh tm;
+  if(!CGAL::IO::read_polygon_mesh(filename, tm) ||
+     CGAL::is_empty(tm) || !CGAL::is_triangle_mesh(tm))
+  {
+    std::cerr << "Invalid input file." << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  //property map for the distance values to the source set
+  Vertex_distance_map vertex_distance = tm.add_property_map<vertex_descriptor, double>("v:distance", 0).first;
+
+  Heat_method hm(tm);
+
+  //add the first vertex as the source set
+  vertex_descriptor s = *(vertices(tm).first);
+  hm.add_source(s);
+  hm.estimate_geodesic_distances(vertex_distance);
+
+  //property map for the constrained status of edges
+  auto ecm = tm.add_property_map<edge_descriptor, bool>("e:is_constrained", 0).first;
+
+
+  for (int i=2; i<argc; ++i)
+    CGAL::Polygon_mesh_processing::experimental::refine_mesh_at_isolevel(tm, vertex_distance, atof(argv[i]), CGAL::parameters::edge_is_constrained_map(ecm));
+
+  std::vector<Triangle_mesh> splitted;
+
+  CGAL::Polygon_mesh_processing::split_connected_components(tm, splitted, CGAL::parameters::edge_is_constrained_map(ecm));
+
+#ifdef CGAL_TEST_SUITE
+  assert(splitted.size() == 22);
+#else
+  for(std::size_t i=0; i<splitted.size(); ++i)
+    std::ofstream("out_"+std::to_string(i)+".off") << std::setprecision(17) << splitted[i];
+#endif
+
+  return 0;
+}

From e1dd8c8a5185db361ae0b4ddd657eb9f522885c9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sat, 30 Sep 2023 08:41:07 +0200
Subject: [PATCH 0800/1398] add doc

---
 .../internal/refine_mesh_at_isolevel.h        | 51 ++++++++++++++-----
 1 file changed, 37 insertions(+), 14 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h
index f4b0f7cc6497..8bb6502865f7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h
@@ -10,10 +10,10 @@
 //
 // Author(s)     : Sebastien Loriot
 
-#ifndef CGAL_POLYGON_MESH_PROCESSING_CLIP_H
-#define CGAL_POLYGON_MESH_PROCESSING_CLIP_H
+#ifndef CGAL_POLYGON_MESH_PROCESSING_REFINE_MESH_AT_ISOLEVEL_H
+#define CGAL_POLYGON_MESH_PROCESSING_REFINE_MESH_AT_ISOLEVEL_H
 
-#include <CGAL/license/Polygon_mesh_processing/corefinement.h>
+#include <CGAL/license/Polygon_mesh_processing/miscellaneous.h>
 
 #include <CGAL/boost/graph/named_params_helper.h>
 
@@ -21,12 +21,43 @@ namespace CGAL {
 namespace Polygon_mesh_processing {
 namespace experimental {
 
-
-template <class PolygonMesh, class ValueMap, class NamedParameters>
+/*! \ingroup PkgPolygonMeshProcessingRef
+ * Function object that computes the intersection of a plane with
+ * a triangulated surface mesh.
+ *
+ * @tparam PolygonMesh a model of the concepts `EdgeListGraph` and `FaceListGraph`
+ * @tparam ValueMap a model of the concept `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+ *                  as key type and with its value type being model of `LessThanComparable`.
+ * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters" for `pm`
+ *
+ * @param pm the polygon mesh to be refined
+ * @param value_map the property map containing value at each vertex for a given function defined over the mesh
+ * @param isovalue the value used to defined the cut locus of edges having their incident vertices associated with
+ *                 values respectively larger and smaller than `isovalue` in `value_map`
+ * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+ *
+ * \cgalNamedParamsBegin
+ *   \cgalParamNBegin{edge_is_constrained_map}
+ *     \cgalParamDescription{an ouput property map associating `true` to all new edges added by the cut, and false to input edges.
+ *     \cgalParamType{a class model of `WritablePropertyMap` with `boost::graph_traits<PolygonMesh>::%edge_descriptor`
+ *                    as key type and `bool` as value type}
+ *     \cgalParamDefault{No marks on edges will be put}
+ *   \cgalParamNBegin{vertex_point_map}
+ *     \cgalParamDescription{a property map associating points to the vertices of `pm`}
+ *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+ *                    as key type and `%Point_3` as value type}
+ *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pm)`}
+ *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
+ *                     must be available in `PolygonMesh`.}
+ *   \cgalParamNEnd
+ * \cgalNamedParamsEnd
+ *
+ */
+template <class PolygonMesh, class ValueMap, class NamedParameters = parameter::Default_named_parameters>
 void refine_mesh_at_isolevel(PolygonMesh& pm,
                              ValueMap value_map,
                              typename boost::property_traits<ValueMap>::value_type isovalue,
-                             const NamedParameters& np)
+                             const NamedParameters& np = parameters::default_values())
 {
   typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
   typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor edge_descriptor;
@@ -115,14 +146,6 @@ void refine_mesh_at_isolevel(PolygonMesh& pm,
   }
 }
 
-template <class PolygonMesh, class ValueMap>
-void refine_mesh_at_isolevel(PolygonMesh& pm,
-                             ValueMap value_map,
-                             typename boost::property_traits<ValueMap>::value_type iso_level)
-{
-  refine_mesh_at_isolevel(pm, value_map, iso_level, parameters::all_default());
-}
-
 } } } // end of CGAL::Polygon_mesh_processing::experimental
 
 

From 5f012f87464ab14cda32fb734a6384d61847120d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 2 Oct 2023 10:54:54 +0100
Subject: [PATCH 0801/1398] By default do the same thing for border edges

---
 .../include/CGAL/Variational_shape_approximation.h            | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
index 23cfab856f61..c6966ccaac01 100644
--- a/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
+++ b/Surface_mesh_approximation/include/CGAL/Variational_shape_approximation.h
@@ -824,7 +824,7 @@ class Variational_shape_approximation {
    *   \cgalParamNBegin{optimize_boundary_anchor_location}
    *     \cgalParamDescription{If `true`, optimize the anchor locations of boundary vertices}
    *     \cgalParamType{`Boolean`}
-   *     \cgalParamDefault{`true`}
+   *     \cgalParamDefault{`optimize_anchor_location`}
    *   \cgalParamNEnd
    *
    *   \cgalParamNBegin{pca_plane}
@@ -844,7 +844,7 @@ class Variational_shape_approximation {
     const bool relative_to_chord = choose_parameter(get_parameter(np, internal_np::relative_to_chord), false);
     const bool with_dihedral_angle = choose_parameter(get_parameter(np, internal_np::with_dihedral_angle), false);
     const bool optimize_anchor_location = choose_parameter(get_parameter(np, internal_np::optimize_anchor_location), true);
-    const bool optimize_boundary_anchor_location = choose_parameter(get_parameter(np, internal_np::optimize_boundary_anchor_location), true);
+    const bool optimize_boundary_anchor_location = choose_parameter(get_parameter(np, internal_np::optimize_boundary_anchor_location), optimize_anchor_location);
     const bool pca_plane = choose_parameter(get_parameter(np, internal_np::pca_plane), false);
 
     // compute averaged edge length, used in chord subdivision

From eacc3ab4d1c8eb17818d8caf33b87ae367e82206 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 2 Oct 2023 12:13:54 +0200
Subject: [PATCH 0802/1398] add missing typedef

---
 Mesh_3/include/CGAL/Mesh_vertex_base_3.h | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Mesh_3/include/CGAL/Mesh_vertex_base_3.h b/Mesh_3/include/CGAL/Mesh_vertex_base_3.h
index 2cf97e4bdc1e..46b09094e954 100644
--- a/Mesh_3/include/CGAL/Mesh_vertex_base_3.h
+++ b/Mesh_3/include/CGAL/Mesh_vertex_base_3.h
@@ -115,6 +115,7 @@ class Mesh_vertex_3
   // Types
   typedef Index_                      Index;
   typedef typename GT::FT             FT;
+  typedef typename Vb::Point          Point;
 
   // Constructor
   Mesh_vertex_3()
@@ -324,6 +325,7 @@ struct Mesh_vertex_base_3 {
 #endif
   using Vertex_handle = typename Triangulation_data_structure::Vertex_handle;
   using Cell_handle = typename Triangulation_data_structure::Cell_handle;
+  using Point = typename Vb::Point;
 
   template < class TDS3 >
   struct Rebind_TDS {

From c17841356a3228ff9509a6edc58bc22fee672071 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 2 Oct 2023 13:10:38 +0200
Subject: [PATCH 0803/1398] Minor error message tweak

---
 Alpha_wrap_3/examples/Alpha_wrap_3/point_set_wrap.cpp     | 2 +-
 Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp   | 2 +-
 Alpha_wrap_3/examples/Alpha_wrap_3/triangle_mesh_wrap.cpp | 2 +-
 Alpha_wrap_3/examples/Alpha_wrap_3/triangle_soup_wrap.cpp | 2 +-
 Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp    | 2 +-
 Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp   | 2 +-
 6 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/point_set_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/point_set_wrap.cpp
index 8742a2a20011..aeb47b80152e 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/point_set_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/point_set_wrap.cpp
@@ -23,7 +23,7 @@ int main(int argc, char** argv)
   Point_container points;
   if(!CGAL::IO::read_points(filename, std::back_inserter(points)) || points.empty())
   {
-    std::cerr << "Invalid input." << std::endl;
+    std::cerr << "Invalid input:" << filename << std::endl;
     return EXIT_FAILURE;
   }
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
index 600d533ee411..59010d1212ea 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
@@ -35,7 +35,7 @@ int main(int argc, char** argv)
   Mesh mesh;
   if(!PMP::IO::read_polygon_mesh(filename, mesh) || is_empty(mesh) || !is_triangle_mesh(mesh))
   {
-    std::cerr << "Invalid input." << std::endl;
+    std::cerr << "Invalid input:" << filename << std::endl;
     return EXIT_FAILURE;
   }
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_mesh_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_mesh_wrap.cpp
index 00e2e4fd9fc5..369cf375a6ff 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_mesh_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_mesh_wrap.cpp
@@ -25,7 +25,7 @@ int main(int argc, char** argv)
   Mesh mesh;
   if(!PMP::IO::read_polygon_mesh(filename, mesh) || is_empty(mesh) || !is_triangle_mesh(mesh))
   {
-    std::cerr << "Invalid input." << std::endl;
+    std::cerr << "Invalid input:" << filename << std::endl;
     return EXIT_FAILURE;
   }
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_soup_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_soup_wrap.cpp
index 626e3bdc3ba4..6e1321c302dd 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_soup_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_soup_wrap.cpp
@@ -30,7 +30,7 @@ int main(int argc, char** argv)
   std::vector<std::array<std::size_t, 3> > faces;
   if(!CGAL::IO::read_polygon_soup(filename, points, faces) || faces.empty())
   {
-    std::cerr << "Invalid input." << std::endl;
+    std::cerr << "Invalid input:" << filename << std::endl;
     return EXIT_FAILURE;
   }
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
index 113215b631a1..682cffac3390 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
@@ -70,7 +70,7 @@ int main(int argc, char** argv)
   Faces faces;
   if(!CGAL::IO::read_polygon_soup(filename, points, faces) || faces.empty())
   {
-    std::cerr << "Invalid input." << std::endl;
+    std::cerr << "Invalid input:" << filename << std::endl;
     return EXIT_FAILURE;
   }
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp
index 1c1d6c7b3d72..9de47aefbcd2 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp
@@ -25,7 +25,7 @@ int main(int argc, char** argv)
   if(!PMP::IO::read_polygon_mesh(filename, input) ||
      is_empty(input) || !is_triangle_mesh(input))
   {
-    std::cerr << "Invalid input." << std::endl;
+    std::cerr << "Invalid input:" << filename << std::endl;
     return EXIT_FAILURE;
   }
 

From 92cb998499571334451c7b6483e8d06f9d819d3d Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Mon, 2 Oct 2023 13:16:28 +0200
Subject: [PATCH 0804/1398] Diabled "Alpha slider" on edit box

---
 .../Plugins/PCA/Scene_edit_box_item.cpp           | 15 +++++++++++++++
 .../Polyhedron/Plugins/PCA/Scene_edit_box_item.h  |  1 +
 2 files changed, 16 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
index 91bcde149bab..b007fc612821 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
@@ -281,6 +281,7 @@ struct Scene_edit_box_item_priv{
 Scene_edit_box_item::Scene_edit_box_item()
 {
   d = nullptr;
+  contextMenu();
 }
 Scene_edit_box_item::Scene_edit_box_item(const Scene_interface *scene_interface)
 {
@@ -311,12 +312,26 @@ Scene_edit_box_item::Scene_edit_box_item(const Scene_interface *scene_interface)
                             : Vi::PROGRAM_NO_SELECTION,
                             false));
   }
+  contextMenu();
 }
 QString Scene_edit_box_item::toolTip() const {
 
   return QString();
 }
 
+
+QMenu* Scene_edit_box_item::contextMenu()
+{
+  // diasable "Alpha slider" in menu
+  QMenu* resMenu = Scene_item::contextMenu();
+  bool prop = property("menu_changed").toBool();
+  if(!prop)
+  {
+    setProperty("menu_changed", true);
+  }
+  return resMenu;
+}
+
 void Scene_edit_box_item::drawSpheres(Viewer_interface *viewer, const QMatrix4x4 f_matrix ) const
 {
   GLdouble d_mat[16];
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.h b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.h
index 4d8988955655..0d99b9ce08ed 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.h
@@ -33,6 +33,7 @@ class SCENE_EDIT_BOX_ITEM_EXPORT Scene_edit_box_item:
     }
 
     QString toolTip() const;
+    QMenu* contextMenu();
 
     bool eventFilter(QObject *, QEvent *);
     // Indicate if rendering mode is supported

From 9fa445f21754a1ac7923f2b5d190647ebd818dea Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 2 Oct 2023 13:13:40 +0200
Subject: [PATCH 0805/1398] Change nomenclature to clarify the different types
 of gate permissiveness

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 39 +++++++++++--------
 .../internal/gate_priority_queue.h            | 16 ++++----
 .../Alpha_wrap_3/Alpha_wrap_3_plugin.cpp      |  6 +--
 3 files changed, 33 insertions(+), 28 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 2174363240b6..7c9509b9185a 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -523,7 +523,7 @@ class Alpha_wrap_3
         continue;
       }
 
-      // Mark the seeds and icosahedron vertices as "artificial vertices" such that the facets
+      // Mark the seeds and icosahedron vertices as "scaffolding vertices" such that the facets
       // incident to these vertices are always traversable regardless of their circumcenter.
       // This is done because otherwise some cavities can appear on the mesh: non-traversable facets
       // with two vertices on the offset, and the third being a deeper inside seed / ico_seed.
@@ -592,11 +592,12 @@ class Alpha_wrap_3
       std::vector<Cell_handle> inc_cells;
       inc_cells.reserve(64);
       m_tr.incident_cells(seed_v, std::back_inserter(inc_cells));
+
       for(Cell_handle ch : inc_cells)
         ch->is_outside() = cavity_cell_outside_tag(ch);
     }
 
-    // Might as well go through the full triangulation since only seeds should have been inserted
+    // Should be cheap enough to go through the full triangulation as only seeds have been inserted
     for(Cell_handle ch : m_tr.all_cell_handles())
     {
       if(!ch->is_outside())
@@ -1027,21 +1028,24 @@ class Alpha_wrap_3
   }
 
 private:
+  // A permissive gate is a gate that we can traverse without checking its circumradius
   enum Facet_queue_status
   {
     IRRELEVANT = 0,
-    ARTIFICIAL_FACET,
+    HAS_INFINITE_NEIGHBOR, // the cell incident to the mirrored facet is infinite (permissive)
+    SCAFFOLDING, // incident to a SEED or BBOX vertex (permissive)
     TRAVERSABLE
   };
 
   inline const char* get_status_message(const Facet_queue_status status)
   {
-    constexpr std::size_t status_count = 3;
+    constexpr std::size_t status_count = 4;
 
     // Messages corresponding to Error_code list above. Must be kept in sync!
     static const char* message[status_count] = {
       "Irrelevant facet",
-      "Artificial facet",
+      "Facet incident to infinite neighbor",
+      "Facet with a bbox/seed vertex",
       "Traversable facet"
     };
 
@@ -1079,7 +1083,7 @@ class Alpha_wrap_3
 
     const Cell_handle nh = ch->neighbor(id);
     if(m_tr.is_infinite(nh))
-      return TRAVERSABLE;
+      return HAS_INFINITE_NEIGHBOR;
 
     if(nh->is_outside())
     {
@@ -1089,7 +1093,7 @@ class Alpha_wrap_3
       return IRRELEVANT;
     }
 
-    // push if facet is connected to artificial vertices
+    // push if facet is connected to scaffolding vertices
     for(int i=0; i<3; ++i)
     {
       const Vertex_handle vh = ch->vertex(Triangulation::vertex_triple_index(id, i));
@@ -1097,9 +1101,9 @@ class Alpha_wrap_3
          vh->type() == AW3i::Vertex_type:: SEED_VERTEX)
       {
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
-        std::cout << "artificial facet due to artificial vertex #" << i << std::endl;
+        std::cout << "Scaffolding facet due to vertex #" << i << std::endl;
 #endif
-        return ARTIFICIAL_FACET;
+        return SCAFFOLDING;
       }
     }
 
@@ -1132,7 +1136,8 @@ class Alpha_wrap_3
       return false;
 
     const FT sqr = smallest_squared_radius_3(f, m_tr);
-    m_queue.resize_and_push(Gate(f, sqr, (status == ARTIFICIAL_FACET)));
+    const bool is_permissive = (status == HAS_INFINITE_NEIGHBOR || status == SCAFFOLDING);
+    m_queue.resize_and_push(Gate(f, sqr, is_permissive));
 
 #ifdef CGAL_AW3_DEBUG_QUEUE
     const Cell_handle ch = f.first;
@@ -1147,10 +1152,10 @@ class Alpha_wrap_3
               << "\t" << p0 << "\n\t" << p1 << "\n\t" << p2 << std::endl;
     std::cout << "  Status: " << get_status_message(status) << std::endl;
     std::cout << "  SQR: " << sqr << std::endl;
-    std::cout << "  Artificiality: " << (status == ARTIFICIAL_FACET) << std::endl;
+    std::cout << "  Permissiveness: " << is_permissive << std::endl;
 #endif
 
-    CGAL_assertion(status == ARTIFICIAL_FACET || sqr >= m_sq_alpha);
+    CGAL_assertion(is_permissive || sqr >= m_sq_alpha);
 
     return true;
   }
@@ -1242,8 +1247,8 @@ class Alpha_wrap_3
                 << m_tr.point(ch, Triangulation::vertex_triple_index(s, 0)) << "\n"
                 << m_tr.point(ch, Triangulation::vertex_triple_index(s, 1)) << "\n"
                 << m_tr.point(ch, Triangulation::vertex_triple_index(s, 2)) << std::endl;
-      std::cout << "Artificiality: " << gate.is_artificial_facet() << std::endl;
       std::cout << "Priority: " << gate.priority() << " (sq alpha: " << m_sq_alpha << ")" << std::endl;
+      std::cout << "Permissiveness: " << gate.is_permissive_facet() << std::endl;
 #endif
 
       visitor.before_facet_treatment(*this, gate);
@@ -1547,7 +1552,7 @@ class Alpha_wrap_3
     }
 
     // Some lambdas for the comparer
-    auto has_artificial_vertex = [](Cell_handle c) -> bool
+    auto has_scaffolding_vertex = [](Cell_handle c) -> bool
     {
       for(int i=0; i<4; ++i)
       {
@@ -1625,9 +1630,9 @@ class Alpha_wrap_3
       // @todo give topmost priority to cells with > 1 non-manifold vertex?
       auto comparer = [&](Cell_handle l, Cell_handle r) -> bool
       {
-        if(has_artificial_vertex(l))
+        if(has_scaffolding_vertex(l))
           return false;
-        if(has_artificial_vertex(r))
+        if(has_scaffolding_vertex(r))
           return true;
 
         const int l_bf_count = count_boundary_facets(l, v);
@@ -1706,7 +1711,7 @@ class Alpha_wrap_3
 
       std::cout << "At Facet with VID " << get(Gate_ID_PM<Triangulation>(), current_gate) << "\n";
       std::cout << "\t" << p0 << "\n\t" << p1 << "\n\t" << p2 << "\n";
-      std::cout << "  Artificiality: " << current_gate.is_artificial_facet() << "\n";
+      std::cout << "  Permissiveness: " << current_gate.is_permissive_facet() << "\n";
       std::cout << "  SQR: " << sqr << "\n";
       std::cout << "  Priority " << current_gate.priority() << std::endl;
 
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
index a9bdd7e0491b..b091b2cabe24 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
@@ -37,17 +37,17 @@ class Gate
 private:
   Facet m_facet;
   FT m_priority; // circumsphere sq_radius
-  bool m_is_artificial_facet;
+  bool m_is_permissive_facet;
 
 public:
   // Constructors
   Gate(const Facet& facet,
        const FT& priority,
-       const bool is_artificial_facet)
+       const bool is_permissive_facet)
     :
       m_facet(facet),
       m_priority(priority),
-      m_is_artificial_facet(is_artificial_facet)
+      m_is_permissive_facet(is_permissive_facet)
   {
     CGAL_assertion(priority >= 0);
   }
@@ -60,7 +60,7 @@ class Gate
 public:
   const Facet& facet() const { return m_facet; }
   const FT& priority() const { return m_priority; }
-  bool is_artificial_facet() const { return m_is_artificial_facet; }
+  bool is_permissive_facet() const { return m_is_permissive_facet; }
 };
 
 struct Less_gate
@@ -68,14 +68,14 @@ struct Less_gate
   template <typename Tr>
   bool operator()(const Gate<Tr>& a, const Gate<Tr>& b) const
   {
-    // If one is artificial and the other is not, give priority to the artificial facet
+    // If one is permissive and the other is not, give priority to the permissive facet
     //
-    // The artificial facet are given highest priority because they need to be treated
+    // The permissive facet are given highest priority because they need to be treated
     // regardless of their circumradius. Treating them first allow the part that depends
     // on alpha to be treated uniformly in a way: whatever the alpha, we'll do the same
     // first treatmen
-    if(a.is_artificial_facet() != b.is_artificial_facet())
-      return a.is_artificial_facet();
+    if(a.is_permissive_facet() != b.is_permissive_facet())
+      return a.is_permissive_facet();
 
     if(a.priority() == b.priority())
     {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index a1b29fd5689d..e66d6c83dd3f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -113,10 +113,10 @@ struct Iterative_AW3_visualization_visitor
     if(!points || !faces || !fcolors || !vcolors)
       return;
 
-    // If the next top of the queue has vertices on the bbox, don't draw (as to avoid producing
+    // If the next top of the queue has vertices on the bbox, don't draw (try to avoid producing
     // spikes in the visualization)
 //    const auto& gate = wrapper.queue().top();
-//    if(wrapper.triangulation().number_of_vertices() > 500 && gate.is_artificial_facet())
+//    if(wrapper.triangulation().number_of_vertices() > 500 && gate.is_permissive_facet())
 //      return;
 
     // Skip some...
@@ -216,7 +216,7 @@ struct AW3_interrupter_visitor
   { }
 
   // Only overload this one because it gives a better state of the wrap (for other visitor calls,
-  // we often get tetrahedral spikes because there are artificial gates in the queue)
+  // we often get tetrahedral spikes because there are scaffolding gates in the queue)
   template <typename Wrapper, typename Point>
   void before_Steiner_point_insertion(const Wrapper& wrapper, const Point& p)
   {

From 1d79ab5023e81ba4725868ce91f638bdb399d8a2 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 2 Oct 2023 16:28:04 +0200
Subject: [PATCH 0806/1398] rename B_

---
 Mesh_3/include/CGAL/Mesh_3/mesh_standard_cell_criteria.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/include/CGAL/Mesh_3/mesh_standard_cell_criteria.h b/Mesh_3/include/CGAL/Mesh_3/mesh_standard_cell_criteria.h
index c5a148d78fa8..e9543925efbf 100644
--- a/Mesh_3/include/CGAL/Mesh_3/mesh_standard_cell_criteria.h
+++ b/Mesh_3/include/CGAL/Mesh_3/mesh_standard_cell_criteria.h
@@ -202,7 +202,7 @@ class Cell_uniform_size_criterion
     {
 #ifdef CGAL_MESH_3_DEBUG_FACET_CRITERIA
       std::cerr << "Cell too small (uniform size): sq_radius[" << size
-        << "] bound[" << B_ << "]\n";
+        << "] bound[" << sq_radius_bound_ << "]\n";
 #endif
       return Is_bad(Quality(sq_radius_bound_/size));
     }

From e8651b8a58f50774263118ccfe7dedabf7de104c Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 2 Oct 2023 16:30:21 +0200
Subject: [PATCH 0807/1398] add min_radius_bound member and accessor

---
 Mesh_3/include/CGAL/Mesh_facet_criteria_3.h | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
index ef69c9413d53..7043597f336b 100644
--- a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
@@ -25,6 +25,8 @@
 #include <CGAL/Mesh_facet_topology.h>
 #include <CGAL/Mesh_3/Is_mesh_domain_field_3.h>
 
+#include <optional>
+
 namespace CGAL {
 
 /*!
@@ -131,9 +133,13 @@ class Mesh_facet_criteria_3
                         const DistanceField& distance_bound,
                         const Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE,
                         const FT& min_radius_bound = 0.)
+    : min_radius_bound_(std::nullopt)
   {
     if (FT(0) != min_radius_bound)
+    {
       init_min_radius(min_radius_bound);
+      min_radius_bound_ = min_radius_bound;
+    }
 
     if ( FT(0) != angle_bound )
       init_aspect(angle_bound);
@@ -173,6 +179,10 @@ class Mesh_facet_criteria_3
     return topology_;
   }
 
+  std::optional<FT> min_radius_bound() const {
+    return min_radius_bound_;
+  }
+
 private:
   void init_aspect(const FT& angle_bound)
   {
@@ -242,6 +252,7 @@ class Mesh_facet_criteria_3
 private:
   Criteria criteria_;
   Mesh_facet_topology topology_;
+  std::optional<FT> min_radius_bound_;
 };  // end class Mesh_facet_criteria_3
 
 }  // end namespace CGAL

From 05b80838e7f62f46bb6e6a14830274835f304e66 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 2 Oct 2023 16:31:29 +0200
Subject: [PATCH 0808/1398] check min_size before inserting facets or edges in
 refinement queues

---
 .../CGAL/Mesh_3/Refine_facets_manifold_base.h | 61 +++++++++++++++----
 1 file changed, 48 insertions(+), 13 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
index c46dad7a808f..9f266793fc6a 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
@@ -95,6 +95,7 @@ class Refine_facets_manifold_base
   mutable bool m_bad_vertices_initialized;
   bool m_with_manifold_criterion;
   bool m_with_boundary;
+  std::optional<FT> m_facet_min_size;
 
 private:
   // computes and return an ordered pair of Vertex
@@ -141,7 +142,7 @@ class Refine_facets_manifold_base
     return this->r_tr_.min_squared_distance(fcenter, cp(wp)) - cw(wp);
   }
 
-  Facet
+  std::pair<Facet, FT>
   biggest_incident_facet_in_complex(const Vertex_handle v) const
   {
 #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS
@@ -195,10 +196,12 @@ class Refine_facets_manifold_base
               << std::endl;
 #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS
 
-    return biggest_facet;
+    return { biggest_facet, biggest_sq_dist };
   }
 
-  Facet biggest_incident_facet_in_complex(const Edge& arete) const {
+  std::pair<Facet, FT>
+  biggest_incident_facet_in_complex(const Edge& arete) const
+  {
     // Find the first facet in the incident facets
     // of the edge which is in the Complex
     // use the list of incident facets in the complex
@@ -239,7 +242,25 @@ class Refine_facets_manifold_base
               << biggest_sq_dist << std::endl;
 #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS
 
-    return biggest_facet;
+    return { biggest_facet, biggest_sq_dist };
+  }
+
+  bool biggest_incident_facet_is_smaller_than_min_size(const Edge& e) const
+  {
+    if(!m_facet_min_size)
+      return false;
+
+    const FT sq_dist = biggest_incident_facet_in_complex(e).second;
+    return (sq_dist < CGAL::square(*m_facet_min_size));
+  }
+
+  bool biggest_incident_facet_is_smaller_than_min_size(const Vertex_handle& v) const
+  {
+    if(!m_facet_min_size)
+      return false;
+
+    const FT sq_dist = biggest_incident_facet_in_complex(v).second;
+    return (sq_dist < CGAL::square(*m_facet_min_size));
   }
 
   ///////////////////////
@@ -324,6 +345,7 @@ class Refine_facets_manifold_base
     , m_bad_vertices_initialized(false)
     , m_with_manifold_criterion((mesh_topology & MANIFOLD_WITH_BOUNDARY) != 0)
     , m_with_boundary((mesh_topology & NO_BOUNDARY) == 0)
+    , m_facet_min_size(criteria.min_radius_bound())
   {
 #ifdef CGAL_MESH_3_DEBUG_CONSTRUCTORS
     std::cerr << "CONS: Refine_facets_manifold_base";
@@ -357,11 +379,14 @@ class Refine_facets_manifold_base
            ( (!m_with_boundary) &&
              (this->r_c3t3_.face_status(*eit) == C3t3::BOUNDARY) ) )
       {
+        if (biggest_incident_facet_is_smaller_than_min_size(*eit))
+          continue;
+
 #ifdef CGAL_LINKED_WITH_TBB
         // Parallel
         if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
         {
-          this->insert_bad_facet(biggest_incident_facet_in_complex(*eit),
+          this->insert_bad_facet(biggest_incident_facet_in_complex(*eit).first,
                                  typename Base::Quality());
         } else
 #endif // CGAL_LINKED_WITH_TBB
@@ -395,7 +420,11 @@ class Refine_facets_manifold_base
            end = this->r_tr_.finite_vertices_end();
          vit != end; ++vit)
     {
-      if( this->r_c3t3_.face_status(vit) == C3t3::SINGULAR ) {
+      if( this->r_c3t3_.face_status(vit) == C3t3::SINGULAR )
+      {
+        if(biggest_incident_facet_is_smaller_than_min_size(vit))
+          continue;
+
 #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS
         std::cerr << "m_bad_vertices.insert("
                   << this->r_tr_.point(vit) << ")\n";
@@ -404,7 +433,7 @@ class Refine_facets_manifold_base
         // Parallel
         if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
         {
-          this->insert_bad_facet(biggest_incident_facet_in_complex(vit),
+          this->insert_bad_facet(biggest_incident_facet_in_complex(vit).first,
                                  typename Base::Quality());
         } else
 #endif // CGAL_LINKED_WITH_TBB
@@ -489,7 +518,7 @@ class Refine_facets_manifold_base
                   << this->r_tr_.point(edgevv.second)
                   << "\n";
 #endif // CGAL_MESHES_DEBUG_REFINEMENT_POINTS
-        return biggest_incident_facet_in_complex(first_bad_edge);
+        return biggest_incident_facet_in_complex(first_bad_edge).first;
       } else {
         CGAL_assertion(!m_bad_vertices.empty());
         const Vertex_handle& v = *m_bad_vertices.begin();
@@ -506,7 +535,7 @@ class Refine_facets_manifold_base
           dump_c3t3(this->r_c3t3_, "dump-crash");
           CGAL_error_msg("this->r_c3t3_.face_status(v) != C3t3::SINGULAR");
         }
-        return biggest_incident_facet_in_complex(v);
+        return biggest_incident_facet_in_complex(v).first;
       }
     } //end Sequential
   }
@@ -568,11 +597,13 @@ class Refine_facets_manifold_base
                  (this->r_c3t3_.face_status(edge) == C3t3::BOUNDARY) )
                )
           {
+            if (biggest_incident_facet_is_smaller_than_min_size(edge))
+              continue;
 #ifdef CGAL_LINKED_WITH_TBB
             // Parallel
             if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
             {
-              this->insert_bad_facet(biggest_incident_facet_in_complex(edge),
+              this->insert_bad_facet(biggest_incident_facet_in_complex(edge).first,
                                      typename Base::Quality());
             } else
 #endif // CGAL_LINKED_WITH_TBB
@@ -616,6 +647,9 @@ class Refine_facets_manifold_base
            // !this->r_c3t3_.is_regular_or_boundary_for_vertices(*vit)
            )
       {
+        if(biggest_incident_facet_is_smaller_than_min_size(*vit))
+          continue;
+
 #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS
         std::cerr << "m_bad_vertices.insert("
                   << this->r_tr_.point(*vit) << ")\n";
@@ -624,7 +658,7 @@ class Refine_facets_manifold_base
         // Parallel
         if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
         {
-          this->insert_bad_facet(biggest_incident_facet_in_complex(*vit),
+          this->insert_bad_facet(biggest_incident_facet_in_complex(*vit).first,
                                  typename Base::Quality());
         } else
 #endif // CGAL_LINKED_WITH_TBB
@@ -635,7 +669,8 @@ class Refine_facets_manifold_base
     }
 
     if ( this->r_c3t3_.has_incident_facets_in_complex(v) &&
-         (this->r_c3t3_.face_status(v) == C3t3::SINGULAR)
+         (this->r_c3t3_.face_status(v) == C3t3::SINGULAR) &&
+          !biggest_incident_facet_is_smaller_than_min_size(v)
          // !this->r_c3t3_.is_regular_or_boundary_for_vertices(v)
          )
     {
@@ -647,7 +682,7 @@ class Refine_facets_manifold_base
       // Parallel
       if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
       {
-        this->insert_bad_facet(biggest_incident_facet_in_complex(v),
+        this->insert_bad_facet(biggest_incident_facet_in_complex(v).first,
                                typename Base::Quality());
       } else
 #endif // CGAL_LINKED_WITH_TBB

From 83b49e296b0324e4170ca7a4fad4c27717430c18 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 2 Oct 2023 15:40:51 +0100
Subject: [PATCH 0809/1398] Fix typos in the User Manual

---
 .../Surface_mesh_approximation/Surface_mesh_approximation.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Surface_mesh_approximation.txt b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Surface_mesh_approximation.txt
index 5a486de1ad1f..e2ea8e5b1b51 100644
--- a/Surface_mesh_approximation/doc/Surface_mesh_approximation/Surface_mesh_approximation.txt
+++ b/Surface_mesh_approximation/doc/Surface_mesh_approximation/Surface_mesh_approximation.txt
@@ -121,7 +121,7 @@ In order to approximate complex boundaries well, more anchors are generated by r
 \f[ d = d / input\_mesh\_average\_edge\_length. \f]
 Optionally, \f$ d \f$ can be measured as the ratio of the chord length:
 \f[ d = d / \Vert(\mathbf{a}, \mathbf{b})\Vert. \f]
-Also, we can add a dihedral angle weight \f$ sin(\mathbf{N}_i,\mathbf{N}_j) \f$ to the distance measurement, where \f$ \mathbf{N}_i,\mathbf{N}_j \f$ are the normals of the proxies separated by the chord \f$ (\mathbf{a}, \mathbf{b}) \f$. If the angle between proxy \f$ P_i \f$ and \f$ P_j \f$ is rather small, then a coarse approximation will do as it does not add geometric information on the shape. Trivial chords (less than 4 edges) are not subdivided if they are non-circular. In case of circular chords, additional anchors maybe added to maintain the topology even if they are trivial, as detailed in Section \ref sma_anchors_additional.
+Also, we can add a dihedral angle weight \f$ sin(\mathbf{N}_i,\mathbf{N}_j) \f$ to the distance measurement, where \f$ \mathbf{N}_i,\mathbf{N}_j \f$ are the normals of the proxies separated by the chord \f$ (\mathbf{a}, \mathbf{b}) \f$. If the angle between proxy \f$ P_i \f$ and \f$ P_j \f$ is rather small, then a coarse approximation will do as it does not add geometric information on the shape. Trivial chords (made of a single edge) are not subdivided. In case of circular chords, additional anchors may be added to maintain the topology, as detailed in Section \ref sma_anchors_additional.
 
 \cgalFigureBegin{chord, chord.jpg}
 Varying the chord error. From left to right: clustering partition, and meshing with decreasing absolute chord error 5, 3 and 1 without dihedral angle weight. The boundaries of the partition (red lines) are approximated with increasing accuracy.
@@ -132,7 +132,7 @@ Varying the chord error. From left to right: clustering partition, and meshing w
 For a boundary cycle without any anchor such as the hole depicted Figure \cgalFigureRef{operations}, we first add a starting anchor to the boundary. We then subdivide this circular chord to ensure that every boundary cycle has at least 2 anchors (i.e., every chord is connecting 2 different anchors, Figure \cgalFigureRef{anchors}). Finally, we add additional anchors to ensure that at least three anchor vertices are generated on every boundary cycle.
 
 \cgalFigureBegin{anchors, anchors.jpg}
-Adding anchors. From left to right: starting from a partition (grey) with a hole (while) and two encircled regions (green and blue), we add a starting anchor (orange disk) to the boundary cycle (red dash line) without any anchor (2nd), subdivide the circular chord (3rd, the number indicates the level of recursion) and add anchors to the boundary cycle with less than 2 anchors (4th, red dash lines).
+Adding anchors. From left to right: starting from a partition (grey) with a hole (white) and two encircled regions (green and blue), we add a starting anchor (orange disk) to the boundary cycle (red dash line) without any anchor (2nd), subdivide the circular chord (3rd, the number indicates the level of recursion) and add anchors to the boundary cycle with less than 2 anchors (4th, red dash lines).
 \cgalFigureEnd
 
 \subsubsection sma_triangulation Discrete Triangulation

From d46efd537fbb43c73687d11aa2ba54808113769c Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 2 Oct 2023 16:59:42 +0200
Subject: [PATCH 0810/1398] avoid computing twice the biggest incident facet

---
 .../CGAL/Mesh_3/Refine_facets_manifold_base.h | 59 ++++++++++---------
 1 file changed, 30 insertions(+), 29 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
index 9f266793fc6a..6eadbfac52f4 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
@@ -245,22 +245,17 @@ class Refine_facets_manifold_base
     return { biggest_facet, biggest_sq_dist };
   }
 
-  bool biggest_incident_facet_is_smaller_than_min_size(const Edge& e) const
+  bool is_smaller_than_min_size(const FT& sq_dist) const
   {
     if(!m_facet_min_size)
       return false;
-
-    const FT sq_dist = biggest_incident_facet_in_complex(e).second;
-    return (sq_dist < CGAL::square(*m_facet_min_size));
+    return sq_dist < CGAL::square(*m_facet_min_size);
   }
 
-  bool biggest_incident_facet_is_smaller_than_min_size(const Vertex_handle& v) const
+  template<typename T> //T may be Edge or Vertex_handle
+  bool biggest_incident_facet_is_smaller_than_min_size(const T& t) const
   {
-    if(!m_facet_min_size)
-      return false;
-
-    const FT sq_dist = biggest_incident_facet_in_complex(v).second;
-    return (sq_dist < CGAL::square(*m_facet_min_size));
+    return is_smaller_than_min_size(biggest_incident_facet_in_complex(t).second);
   }
 
   ///////////////////////
@@ -379,15 +374,15 @@ class Refine_facets_manifold_base
            ( (!m_with_boundary) &&
              (this->r_c3t3_.face_status(*eit) == C3t3::BOUNDARY) ) )
       {
-        if (biggest_incident_facet_is_smaller_than_min_size(*eit))
+        const auto [biggest_f, sq_dist] = biggest_incident_facet_in_complex(*eit);
+        if (is_smaller_than_min_size(sq_dist))
           continue;
 
 #ifdef CGAL_LINKED_WITH_TBB
         // Parallel
         if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
         {
-          this->insert_bad_facet(biggest_incident_facet_in_complex(*eit).first,
-                                 typename Base::Quality());
+          this->insert_bad_facet(biggest_f, typename Base::Quality());
         } else
 #endif // CGAL_LINKED_WITH_TBB
         { // Sequential
@@ -422,7 +417,8 @@ class Refine_facets_manifold_base
     {
       if( this->r_c3t3_.face_status(vit) == C3t3::SINGULAR )
       {
-        if(biggest_incident_facet_is_smaller_than_min_size(vit))
+        const auto [biggest_f, sq_dist] = biggest_incident_facet_in_complex(vit);
+        if (is_smaller_than_min_size(sq_dist))
           continue;
 
 #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS
@@ -433,8 +429,7 @@ class Refine_facets_manifold_base
         // Parallel
         if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
         {
-          this->insert_bad_facet(biggest_incident_facet_in_complex(vit).first,
-                                 typename Base::Quality());
+          this->insert_bad_facet(biggest_f, typename Base::Quality());
         } else
 #endif // CGAL_LINKED_WITH_TBB
         { // Sequential
@@ -597,15 +592,17 @@ class Refine_facets_manifold_base
                  (this->r_c3t3_.face_status(edge) == C3t3::BOUNDARY) )
                )
           {
-            if (biggest_incident_facet_is_smaller_than_min_size(edge))
+            const auto [biggest_f, sq_dist] = biggest_incident_facet_in_complex(edge);
+            if (is_smaller_than_min_size(sq_dist))
               continue;
+
 #ifdef CGAL_LINKED_WITH_TBB
             // Parallel
             if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
             {
-              this->insert_bad_facet(biggest_incident_facet_in_complex(edge).first,
-                                     typename Base::Quality());
-            } else
+              this->insert_bad_facet(biggest_f, typename Base::Quality());
+            }
+            else
 #endif // CGAL_LINKED_WITH_TBB
             { // Sequential
               m_bad_edges.insert(Bad_edge(edge_to_edgevv(edge),
@@ -647,7 +644,8 @@ class Refine_facets_manifold_base
            // !this->r_c3t3_.is_regular_or_boundary_for_vertices(*vit)
            )
       {
-        if(biggest_incident_facet_is_smaller_than_min_size(*vit))
+        const auto [biggest_f, sq_dist] = biggest_incident_facet_in_complex(*vit);
+        if (is_smaller_than_min_size(sq_dist))
           continue;
 
 #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS
@@ -658,9 +656,9 @@ class Refine_facets_manifold_base
         // Parallel
         if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
         {
-          this->insert_bad_facet(biggest_incident_facet_in_complex(*vit).first,
-                                 typename Base::Quality());
-        } else
+          this->insert_bad_facet(biggest_f, typename Base::Quality());
+        }
+        else
 #endif // CGAL_LINKED_WITH_TBB
         { // Sequential
           m_bad_vertices.insert(*vit);
@@ -669,11 +667,14 @@ class Refine_facets_manifold_base
     }
 
     if ( this->r_c3t3_.has_incident_facets_in_complex(v) &&
-         (this->r_c3t3_.face_status(v) == C3t3::SINGULAR) &&
-          !biggest_incident_facet_is_smaller_than_min_size(v)
+         (this->r_c3t3_.face_status(v) == C3t3::SINGULAR)
          // !this->r_c3t3_.is_regular_or_boundary_for_vertices(v)
          )
     {
+      const auto [biggest_f, sq_dist] = biggest_incident_facet_in_complex(v);
+      if (is_smaller_than_min_size(sq_dist))
+        return;
+
 #ifdef CGAL_MESHES_DEBUG_REFINEMENT_POINTS
       std::cerr << "m_bad_vertices.insert("
                 << this->r_tr_.point(v) << ")\n";
@@ -682,9 +683,9 @@ class Refine_facets_manifold_base
       // Parallel
       if (std::is_convertible<Concurrency_tag, Parallel_tag>::value)
       {
-        this->insert_bad_facet(biggest_incident_facet_in_complex(v).first,
-                               typename Base::Quality());
-      } else
+        this->insert_bad_facet(biggest_f, typename Base::Quality());
+      }
+      else
 #endif // CGAL_LINKED_WITH_TBB
       { // Sequential
         m_bad_vertices.insert(v);

From 7d12160e185cfe8b7cde24138d6e4372197ef626 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 3 Oct 2023 11:52:04 +0200
Subject: [PATCH 0811/1398] update doc

---
 .../PackageDescription.txt                    |  1 +
 .../Polygon_mesh_processing/CMakeLists.txt    |  2 +
 .../geodesic_isolevel_refinement.cpp}         | 33 +++++++++-----
 .../{internal => }/refine_mesh_at_isolevel.h  | 44 ++++++++++++-------
 .../Polygon_mesh_processing/CMakeLists.txt    |  5 ---
 .../test_geodesic_isolevel_refinement.cmd     |  1 -
 6 files changed, 51 insertions(+), 35 deletions(-)
 rename Polygon_mesh_processing/{test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cpp => examples/Polygon_mesh_processing/geodesic_isolevel_refinement.cpp} (65%)
 rename Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/{internal => }/refine_mesh_at_isolevel.h (79%)
 delete mode 100644 Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cmd

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index b17c41399d0b..1d17b286dc5c 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -258,6 +258,7 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - `CGAL::Polygon_mesh_processing::triangle()`
 - `CGAL::Polygon_mesh_processing::region_growing_of_planes_on_faces()`
 - `CGAL::Polygon_mesh_processing::detect_corners_of_regions()`
+- `CGAL::Polygon_mesh_processing::refine_mesh_at_isolevel()`
 
 \cgalCRPSection{I/O Functions}
 - \link PMP_IO_grp `CGAL::Polygon_mesh_processing::IO::read_polygon_mesh()`\endlink
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index c755ecf63e8e..0ad5f79a261b 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -73,6 +73,8 @@ if(TARGET CGAL::Eigen3_support)
   target_link_libraries(delaunay_remeshing_example PUBLIC CGAL::Eigen3_support)
   create_single_source_cgal_program("remesh_almost_planar_patches.cpp")
   target_link_libraries(remesh_almost_planar_patches PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("geodesic_isolevel_refinement.cpp")
+  target_link_libraries(geodesic_isolevel_refinement PUBLIC CGAL::Eigen3_support)
 else()
   message(STATUS "NOTICE: Examples that use Eigen will not be compiled.")
 endif()
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/geodesic_isolevel_refinement.cpp
similarity index 65%
rename from Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cpp
rename to Polygon_mesh_processing/examples/Polygon_mesh_processing/geodesic_isolevel_refinement.cpp
index a2098c63e3b9..76f97bf3dc66 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/geodesic_isolevel_refinement.cpp
@@ -3,7 +3,7 @@
 
 #include <CGAL/Heat_method_3/Surface_mesh_geodesic_distances_3.h>
 
-#include <CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h>
+#include <CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h>
 #include <CGAL/Polygon_mesh_processing/connected_components.h>
 
 #include <fstream>
@@ -21,7 +21,7 @@ typedef CGAL::Heat_method_3::Surface_mesh_geodesic_distances_3<Triangle_mesh> He
 
 int main(int argc, char* argv[])
 {
-  const char* filename = argv[1];
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/elephant.off");
 
   Triangle_mesh tm;
   if(!CGAL::IO::read_polygon_mesh(filename, tm) ||
@@ -31,33 +31,42 @@ int main(int argc, char* argv[])
     return EXIT_FAILURE;
   }
 
+  // default isovalues for cutting the mesh
+  std::vector<double> isovalues = {0.001, 0.01, 0.05, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 1, 10};
+
+  if (argc>2)
+  {
+    isovalues.clear();
+    for (int i=2; i<argc; ++i)
+      isovalues.push_back(atof(argv[i]));
+  }
+
   //property map for the distance values to the source set
   Vertex_distance_map vertex_distance = tm.add_property_map<vertex_descriptor, double>("v:distance", 0).first;
 
   Heat_method hm(tm);
 
-  //add the first vertex as the source set
+  //use heat method to compute approximated geodesic distances to the source vertex `s`
   vertex_descriptor s = *(vertices(tm).first);
   hm.add_source(s);
   hm.estimate_geodesic_distances(vertex_distance);
 
-  //property map for the constrained status of edges
+  // property map to flag new cut edge added in the mesh
   auto ecm = tm.add_property_map<edge_descriptor, bool>("e:is_constrained", 0).first;
 
+  // refine the mesh along isovalues
+  for (double isovalue : isovalues)
+    CGAL::Polygon_mesh_processing::refine_mesh_at_isolevel(tm, vertex_distance, isovalue, CGAL::parameters::edge_is_constrained_map(ecm));
 
-  for (int i=2; i<argc; ++i)
-    CGAL::Polygon_mesh_processing::experimental::refine_mesh_at_isolevel(tm, vertex_distance, atof(argv[i]), CGAL::parameters::edge_is_constrained_map(ecm));
-
+  // split the mesh in connected components bounded by the isocurves
   std::vector<Triangle_mesh> splitted;
-
   CGAL::Polygon_mesh_processing::split_connected_components(tm, splitted, CGAL::parameters::edge_is_constrained_map(ecm));
 
-#ifdef CGAL_TEST_SUITE
-  assert(splitted.size() == 22);
-#else
+  assert(argc!=1 || splitted.size() == 22);
+
+  // export each submesh in a file
   for(std::size_t i=0; i<splitted.size(); ++i)
     std::ofstream("out_"+std::to_string(i)+".off") << std::setprecision(17) << splitted[i];
-#endif
 
   return 0;
 }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
similarity index 79%
rename from Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h
rename to Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
index 8bb6502865f7..7e916fc76980 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
@@ -1,4 +1,4 @@
-// Copyright (c) 2021 GeometryFactory (France).
+// Copyright (c) 2021-2023 GeometryFactory (France).
 // All rights reserved.
 //
 // This file is part of CGAL (www.cgal.org).
@@ -19,29 +19,38 @@
 
 namespace CGAL {
 namespace Polygon_mesh_processing {
-namespace experimental {
 
-/*! \ingroup PkgPolygonMeshProcessingRef
- * Function object that computes the intersection of a plane with
- * a triangulated surface mesh.
+/*!
+ * \ingroup PkgPolygonMeshProcessingRef
+ *
+ * refines `pm` by adding new vertices on edges having their incident vertices associated with
+ * values respectively larger and smaller than `isovalue` in `value_map`.
+ * The placement of new vertices on edges will be done by linear interpolation
+ * using the aforementioned values.
+ * New vertices will be associated `isovalue` in `value_map` when created.
+ * Additionally new edges will be added by connecting new vertices created sharing
+ * a common incident face. Note that in case more that two new vertices are added
+ * on a face boundary, no edges will be created in that face.
  *
  * @tparam PolygonMesh a model of the concepts `EdgeListGraph` and `FaceListGraph`
- * @tparam ValueMap a model of the concept `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
- *                  as key type and with its value type being model of `LessThanComparable`.
+ * @tparam ValueMap a model of the concept `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+ *                  as key type and with its value type being the type of the coordinates of points associated with vertices
+ *                  in the vertex map provided to the `vertex_point_map()` named parameter.
  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters" for `pm`
  *
- * @param pm the polygon mesh to be refined
- * @param value_map the property map containing value at each vertex for a given function defined over the mesh
- * @param isovalue the value used to defined the cut locus of edges having their incident vertices associated with
- *                 values respectively larger and smaller than `isovalue` in `value_map`
+ * @param pm the polygon mesh to be refined.
+ * @param value_map the property map containing value at each vertex for a given function defined over the mesh.
+ * @param isovalue the value used to defined
  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
  *
  * \cgalNamedParamsBegin
  *   \cgalParamNBegin{edge_is_constrained_map}
- *     \cgalParamDescription{an ouput property map associating `true` to all new edges added by the cut, and false to input edges.
+ *     \cgalParamDescription{an ouput property map associating `true` to all new edges added by the cut, and false to input edges.}
  *     \cgalParamType{a class model of `WritablePropertyMap` with `boost::graph_traits<PolygonMesh>::%edge_descriptor`
  *                    as key type and `bool` as value type}
  *     \cgalParamDefault{No marks on edges will be put}
+ *   \cgalParamNEnd
+ *
  *   \cgalParamNBegin{vertex_point_map}
  *     \cgalParamDescription{a property map associating points to the vertices of `pm`}
  *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
@@ -53,7 +62,7 @@ namespace experimental {
  * \cgalNamedParamsEnd
  *
  */
-template <class PolygonMesh, class ValueMap, class NamedParameters = parameter::Default_named_parameters>
+template <class PolygonMesh, class ValueMap, class NamedParameters = parameters::Default_named_parameters>
 void refine_mesh_at_isolevel(PolygonMesh& pm,
                              ValueMap value_map,
                              typename boost::property_traits<ValueMap>::value_type isovalue,
@@ -63,6 +72,7 @@ void refine_mesh_at_isolevel(PolygonMesh& pm,
   typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor edge_descriptor;
   typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
   typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+  typedef typename boost::property_map<ValueMap>::value_type FT;
 
   using parameters::choose_parameter;
   using parameters::get_parameter;
@@ -113,9 +123,9 @@ void refine_mesh_at_isolevel(PolygonMesh& pm,
   for (edge_descriptor e : to_split)
   {
     vertex_descriptor src = source(e, pm), tgt = target(e, pm);
-    double ds = get(value_map, src);
-    double dt = get(value_map, tgt);
-    double alpha = (isovalue - dt) / (ds - dt);
+    FT ds = get(value_map, src);
+    FT dt = get(value_map, tgt);
+    FT alpha = (isovalue - dt) / (ds - dt);
     halfedge_descriptor hnew = CGAL::Euler::split_edge(halfedge(e, pm), pm);
     put(vpm, target(hnew, pm), barycenter(get(vpm,src), alpha, get(vpm, tgt), 1-alpha));
     put(value_map,  target(hnew, pm) , isovalue);
@@ -146,7 +156,7 @@ void refine_mesh_at_isolevel(PolygonMesh& pm,
   }
 }
 
-} } } // end of CGAL::Polygon_mesh_processing::experimental
+} } // end of CGAL::Polygon_mesh_processing
 
 
 #endif
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index 6f5d1e7c7ce9..eb9b98cbe593 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -125,11 +125,6 @@ else()
   message(STATUS "NOTICE: Tests are not using Ceres.")
 endif()
 
-if (TARGET CGAL::Eigen3_support)
-  create_single_source_cgal_program("test_geodesic_isolevel_refinement.cpp")
-  target_link_libraries( test_geodesic_isolevel_refinement PUBLIC CGAL::Eigen3_support)
-endif()
-
 if(BUILD_TESTING)
   set_tests_properties(
     "execution   of  triangulate_hole_Polyhedron_3_no_delaunay_test"
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cmd b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cmd
deleted file mode 100644
index 36105ee3a020..000000000000
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_geodesic_isolevel_refinement.cmd
+++ /dev/null
@@ -1 +0,0 @@
-${CGAL_DATA_DIR}/meshes/elephant.off 0.001 0.01 0.05 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 10

From 42b5aab4b170761f473d8464eea4bba75ee8d7cd Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 3 Oct 2023 11:18:58 +0200
Subject: [PATCH 0812/1398] Update
 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/refine_mesh_at_isolevel.h

---
 .../CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
index 7e916fc76980..8a649b15ead4 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
@@ -45,7 +45,7 @@ namespace Polygon_mesh_processing {
  *
  * \cgalNamedParamsBegin
  *   \cgalParamNBegin{edge_is_constrained_map}
- *     \cgalParamDescription{an ouput property map associating `true` to all new edges added by the cut, and false to input edges.}
+ *     \cgalParamDescription{an output property map associating `true` to all new edges added by the cut, and `false` to input edges.}
  *     \cgalParamType{a class model of `WritablePropertyMap` with `boost::graph_traits<PolygonMesh>::%edge_descriptor`
  *                    as key type and `bool` as value type}
  *     \cgalParamDefault{No marks on edges will be put}

From a5447a846b1734678c634fa4ed90617c06c5da46 Mon Sep 17 00:00:00 2001
From: Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
Date: Wed, 4 Oct 2023 07:59:01 +0200
Subject: [PATCH 0813/1398] Remove warning

---
 GraphicsView/include/CGAL/Buffer_for_vao.h | 1 -
 1 file changed, 1 deletion(-)

diff --git a/GraphicsView/include/CGAL/Buffer_for_vao.h b/GraphicsView/include/CGAL/Buffer_for_vao.h
index 8fda19879933..dde60abb832b 100644
--- a/GraphicsView/include/CGAL/Buffer_for_vao.h
+++ b/GraphicsView/include/CGAL/Buffer_for_vao.h
@@ -747,7 +747,6 @@ class Buffer_for_vao
       }
       // (2.2) We check if the facet is external or internal
       std::queue<typename CDT::Face_handle> face_queue, faces_internal;
-      typename CDT::Face_handle face_internal = nullptr;
       if (cdt.infinite_vertex()->face()!=nullptr)
       {
         typename CDT::Face_circulator

From 857de8b11082f463b3f9a46fd80a52150872738f Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Wed, 4 Oct 2023 11:21:02 +0200
Subject: [PATCH 0814/1398] Fixed warning

---
 .../demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp       | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
index b007fc612821..78493723e31d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
@@ -99,7 +99,7 @@ struct Scene_edit_box_item_priv{
     constraint.setRotationConstraintDirection(CGAL::qglviewer::Vec(.0,.0,.1));
     frame->setConstraint(&constraint);
     //create the sphere model
-    float eps = 1.e-3;
+    double eps = 1.e-3;
     pool[0] = bb.xmin()-eps; pool[3] = bb.xmax()+eps;
     pool[1] = bb.ymin()-eps; pool[4] = bb.ymax()+eps;
     pool[2] = bb.zmin()-eps; pool[5] = bb.zmax()+eps;
@@ -255,7 +255,7 @@ struct Scene_edit_box_item_priv{
   void reset_vertices()
   {
     Scene_item::Bbox bb = scene->bbox();
-    float eps = 1.e-3;
+    double eps = 1.e-3;
     pool[0] = bb.xmin()-eps; pool[3] = bb.xmax()+eps;
     pool[1] = bb.ymin()-eps; pool[4] = bb.ymax()+eps;
     pool[2] = bb.zmin()-eps; pool[5] = bb.zmax()+eps;

From ad5ae27c42ccf59683cd84a6ac52c6d6c6043d0a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 4 Oct 2023 22:49:06 +0200
Subject: [PATCH 0815/1398] Factorize code generating filenames out of examples

---
 .../Alpha_wrap_3/mixed_inputs_wrap.cpp        |  5 +++--
 .../examples/Alpha_wrap_3/output_helper.h     | 19 +++++++++++++++++++
 .../examples/Alpha_wrap_3/point_set_wrap.cpp  |  8 +++-----
 .../Alpha_wrap_3/successive_wraps.cpp         |  9 +++------
 .../Alpha_wrap_3/triangle_mesh_wrap.cpp       |  9 +++------
 .../Alpha_wrap_3/triangle_soup_wrap.cpp       |  9 +++------
 .../examples/Alpha_wrap_3/volumetric_wrap.cpp |  9 +++------
 .../Alpha_wrap_3/wrap_from_cavity.cpp         |  8 +++-----
 8 files changed, 40 insertions(+), 36 deletions(-)
 create mode 100644 Alpha_wrap_3/examples/Alpha_wrap_3/output_helper.h

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
index 4e96d6c1116c..fdba4de5f514 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
@@ -120,8 +120,9 @@ int main(int argc, char** argv)
   std::string ps_name = std::string(ps_filename);
   ps_name = ps_name.substr(ps_name.find_last_of("/") + 1, ps_name.length() - 1);
   ps_name = ps_name.substr(0, ps_name.find_last_of("."));
-  std::string output_name = ts_name + "_" + ss_name + "_"  + ps_name + "_" + std::to_string(static_cast<int>(relative_alpha))
-                            + "_" + std::to_string(static_cast<int>(relative_offset)) + ".off";
+  std::string output_name = ts_name + "_" + ss_name + "_"  + ps_name + "_"
+                                  + std::to_string(static_cast<int>(relative_alpha)) + "_"
+                                  + std::to_string(static_cast<int>(relative_offset)) + ".off";
   std::cout << "Writing to " << output_name << std::endl;
   CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/output_helper.h b/Alpha_wrap_3/examples/Alpha_wrap_3/output_helper.h
new file mode 100644
index 000000000000..3ce1155f4ef5
--- /dev/null
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/output_helper.h
@@ -0,0 +1,19 @@
+#ifndef CGAL_ALPHA_WRAP_3_EXAMPLES_OUTPUT_HELPER_H
+#define CGAL_ALPHA_WRAP_3_EXAMPLES_OUTPUT_HELPER_H
+
+#include <string>
+
+std::string generate_output_name(std::string input_name,
+                                 const double alpha,
+                                 const double offset)
+{
+  input_name = input_name.substr(input_name.find_last_of("/") + 1, input_name.length() - 1);
+  input_name = input_name.substr(0, input_name.find_last_of("."));
+  std::string output_name = input_name
+                            + "_" + std::to_string(static_cast<int>(alpha))
+                            + "_" + std::to_string(static_cast<int>(offset)) + ".off";
+
+  return output_name;
+}
+
+#endif // CGAL_ALPHA_WRAP_3_EXAMPLES_OUTPUT_HELPER_H
\ No newline at end of file
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/point_set_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/point_set_wrap.cpp
index aeb47b80152e..a602cf5c58bf 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/point_set_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/point_set_wrap.cpp
@@ -1,3 +1,5 @@
+#include "output_helper.h"
+
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Surface_mesh.h>
 
@@ -53,11 +55,7 @@ int main(int argc, char** argv)
   std::cout << "Took " << t.time() << " s." << std::endl;
 
   // Save the result
-  std::string input_name = std::string(filename);
-  input_name = input_name.substr(input_name.find_last_of("/") + 1, input_name.length() - 1);
-  input_name = input_name.substr(0, input_name.find_last_of("."));
-  std::string output_name = input_name + "_" + std::to_string(static_cast<int>(relative_alpha))
-                            + "_" + std::to_string(static_cast<int>(relative_offset)) + ".off";
+  const std::string output_name = generate_output_name(filename, relative_alpha, relative_offset);
   std::cout << "Writing to " << output_name << std::endl;
   CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
index 59010d1212ea..f9b35f88b1f7 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
@@ -1,5 +1,7 @@
 #define CGAL_AW3_TIMER
 
+#include "output_helper.h"
+
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Surface_mesh.h>
 
@@ -69,12 +71,7 @@ int main(int argc, char** argv)
     std::cout << "  Result: " << num_vertices(wrap) << " vertices, " << num_faces(wrap) << " faces" << std::endl;
     std::cout << "  Elapsed time: " << t.time() << " s." << std::endl;
 
-    std::string input_name = std::string(filename);
-    input_name = input_name.substr(input_name.find_last_of("/") + 1, input_name.length() - 1);
-    input_name = input_name.substr(0, input_name.find_last_of("."));
-    std::string output_name = input_name
-                              + "_" + std::to_string(static_cast<int>(relative_alphas[i]))
-                              + "_" + std::to_string(static_cast<int>(relative_offset)) + ".off";
+    const std::string output_name = generate_output_name(filename, relative_alphas[i], relative_offset);
     std::cout << "Writing to " << output_name << std::endl;
     CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_mesh_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_mesh_wrap.cpp
index 369cf375a6ff..d49534904461 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_mesh_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_mesh_wrap.cpp
@@ -1,3 +1,5 @@
+#include "output_helper.h"
+
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Surface_mesh.h>
 
@@ -56,12 +58,7 @@ int main(int argc, char** argv)
   std::cout << "Took " << t.time() << " s." << std::endl;
 
   // Save the result
-  std::string input_name = std::string(filename);
-  input_name = input_name.substr(input_name.find_last_of("/") + 1, input_name.length() - 1);
-  input_name = input_name.substr(0, input_name.find_last_of("."));
-  std::string output_name = input_name
-                            + "_" + std::to_string(static_cast<int>(relative_alpha))
-                            + "_" + std::to_string(static_cast<int>(relative_offset)) + ".off";
+  const std::string output_name = generate_output_name(filename, relative_alpha, relative_offset);
   std::cout << "Writing to " << output_name << std::endl;
   CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_soup_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_soup_wrap.cpp
index 6e1321c302dd..51e04974c28a 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_soup_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/triangle_soup_wrap.cpp
@@ -1,3 +1,5 @@
+#include "output_helper.h"
+
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Surface_mesh.h>
 
@@ -63,12 +65,7 @@ int main(int argc, char** argv)
   std::cout << "Took " << t.time() << " s." << std::endl;
 
   // Save the result
-  std::string input_name = std::string(filename);
-  input_name = input_name.substr(input_name.find_last_of("/") + 1, input_name.length() - 1);
-  input_name = input_name.substr(0, input_name.find_last_of("."));
-  std::string output_name = input_name
-                            + "_" + std::to_string(static_cast<int>(relative_alpha))
-                            + "_" + std::to_string(static_cast<int>(relative_offset)) + ".off";
+  const std::string output_name = generate_output_name(filename, relative_alpha, relative_offset);
   std::cout << "Writing to " << output_name << std::endl;
   CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
index 682cffac3390..3ac28de33022 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
@@ -1,3 +1,5 @@
+#include "output_helper.h"
+
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Surface_mesh.h>
 
@@ -113,12 +115,7 @@ int main(int argc, char** argv)
   auto dt = aw3.triangulation();
 
   // Save the result
-  std::string input_name = std::string(filename);
-  input_name = input_name.substr(input_name.find_last_of("/") + 1, input_name.length() - 1);
-  input_name = input_name.substr(0, input_name.find_last_of("."));
-  std::string output_name = input_name
-                            + "_" + std::to_string(static_cast<int>(relative_alpha))
-                            + "_" + std::to_string(static_cast<int>(relative_offset)) + ".off";
+  const std::string output_name = generate_output_name(filename, relative_alpha, relative_offset);
   std::cout << "Writing to " << output_name << std::endl;
   CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp
index 9de47aefbcd2..9422e4d969be 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp
@@ -1,3 +1,5 @@
+#include "output_helper.h"
+
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Surface_mesh.h>
 
@@ -64,11 +66,7 @@ int main(int argc, char** argv)
   std::cout << "Took " << t.time() << " s." << std::endl;
 
   // Save the result
-  std::string input_name = std::string(filename);
-  input_name = input_name.substr(input_name.find_last_of("/") + 1, input_name.length() - 1);
-  input_name = input_name.substr(0, input_name.find_last_of("."));
-  std::string output_name = input_name + "_cavity_" + std::to_string(static_cast<int>(relative_alpha))
-                            + "_" + std::to_string(static_cast<int>(relative_offset)) + ".off";
+  const std::string output_name = generate_output_name(filename, relative_alpha, relative_offset);
   std::cout << "Writing to " << output_name << std::endl;
   CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
 

From 660d6203308e7e32bbe37b0aea020f9a818459a7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 4 Oct 2023 22:52:32 +0200
Subject: [PATCH 0816/1398] Accelerate trees manually to avoid skewing timers
 in flood_fill()

If one day this becomes annoying because one wishes to call
oracle.add_XXX() multiple times AND it's a significant
runtime burden, we can just add a function add_XXXs()
with a single call of accelerate_distance_queries()
---
 .../include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h   | 6 ++++++
 .../CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h        | 6 ++++++
 .../CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h       | 6 ++++++
 .../CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h       | 6 ++++++
 4 files changed, 24 insertions(+)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
index 7bad2ff313d4..8ccbf049a33e 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
@@ -115,6 +115,12 @@ class Point_set_oracle
 
     this->tree().insert(std::next(std::cbegin(m_points), old_size), std::cend(m_points));
 
+    // Manually constructing it here purely for profiling reasons: if we keep the lazy approach,
+    // it will be done at the first treatment of a facet that needs a Steiner point.
+    // So if one wanted to bench the flood fill runtime, it would be skewed by the time it takes
+    // to accelerate the tree.
+    this->tree().accelerate_distance_queries();
+
     CGAL_postcondition(this->tree().size() == m_points.size());
   }
 };
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
index d02a9f9faaf8..08e76dc6f5d3 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
@@ -113,6 +113,12 @@ class Segment_soup_oracle
 #endif
     this->tree().insert(std::next(std::cbegin(m_segments), old_size), std::cend(m_segments));
 
+    // Manually constructing it here purely for profiling reasons: if we keep the lazy approach,
+    // it will be done at the first treatment of a facet that needs a Steiner point.
+    // So if one wanted to bench the flood fill runtime, it would be skewed by the time it takes
+    // to accelerate the tree.
+    this->tree().accelerate_distance_queries();
+
     CGAL_postcondition(this->tree().size() == m_segments.size());
   }
 };
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
index c87f82ac75fe..869c108693d2 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
@@ -164,6 +164,12 @@ class Triangle_mesh_oracle
       Splitter_base::split_and_insert_datum(tr, this->tree(), this->geom_traits());
     }
 
+    // Manually constructing it here purely for profiling reasons: if we keep the lazy approach,
+    // it will be done at the first treatment of a facet that needs a Steiner point.
+    // So if one wanted to bench the flood fill runtime, it would be skewed by the time it takes
+    // to accelerate the tree.
+    this->tree().accelerate_distance_queries();
+
 #ifdef CGAL_AW3_DEBUG
     std::cout << "Tree: " << this->tree().size() << " primitives (" << num_faces(tmesh) << " faces in input)" << std::endl;
 #endif
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
index 0a8f589fc2df..35966be46447 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
@@ -169,6 +169,12 @@ class Triangle_soup_oracle
       Splitter_base::split_and_insert_datum(tr, this->tree(), this->geom_traits());
     }
 
+    // Manually constructing it here purely for profiling reasons: if we keep the lazy approach,
+    // it will be done at the first treatment of a facet that needs a Steiner point.
+    // So if one wanted to bench the flood fill runtime, it would be skewed by the time it takes
+    // to accelerate the tree.
+    this->tree().accelerate_distance_queries();
+
 #ifdef CGAL_AW3_DEBUG
     std::cout << "Tree: " << this->tree().size() << " primitives (" << faces.size() << " faces in input)" << std::endl;
 #endif

From 88468764767950cda8daae96f5ab47885776afa4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 4 Oct 2023 22:54:06 +0200
Subject: [PATCH 0817/1398] Check for degenerate segments + add warnings

---
 .../internal/Segment_soup_oracle.h            | 20 +++++++++++++++++--
 .../internal/Triangle_mesh_oracle.h           |  5 +++++
 .../internal/Triangle_soup_oracle.h           | 10 ++++++++++
 3 files changed, 33 insertions(+), 2 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
index 08e76dc6f5d3..63f3532cf67e 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
@@ -40,7 +40,8 @@ struct SS_oracle_traits
 {
   using Geom_traits = Alpha_wrap_AABB_geom_traits<GT_>; // Wrap the kernel to add Ball_3 + custom Do_intersect_3
 
-  using Segments = std::vector<typename GT_::Segment_3>;
+  using Segment = typename GT_::Segment_3;
+  using Segments = std::vector<Segment>;
   using SR_iterator = typename Segments::const_iterator;
 
   using Primitive = AABB_primitive<SR_iterator,
@@ -68,6 +69,7 @@ class Segment_soup_oracle
   using Geom_traits = typename SSOT::Geom_traits;
 
 private:
+  using Segment = typename SSOT::Segment;
   using Segments = typename SSOT::Segments;
   using AABB_tree = typename SSOT::AABB_tree;
   using Oracle_base = AABB_tree_oracle<Geom_traits, AABB_tree, CGAL::Default, BaseOracle>;
@@ -105,8 +107,22 @@ class Segment_soup_oracle
       return;
     }
 
+    typename Geom_traits::Is_degenerate_3 is_degenerate = this->geom_traits().is_degenerate_3_object();
+
     const std::size_t old_size = m_segments.size();
-    m_segments.insert(std::cend(m_segments), std::cbegin(segments), std::cend(segments));
+
+    for(const Segment& s : segments)
+    {
+      if(is_degenerate(s))
+      {
+#ifdef CGAL_AW3_DEBUG
+        std::cerr << "Warning: ignoring degenerate segment " << s << std::endl;
+#endif
+        continue;
+      }
+
+      m_segments.push_back(s);
+    }
 
 #ifdef CGAL_AW3_DEBUG
     std::cout << "Insert into AABB tree (segments)..." << std::endl;
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
index 869c108693d2..ffd8326a44f6 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
@@ -153,7 +153,12 @@ class Triangle_mesh_oracle
     for(face_descriptor f : faces(tmesh))
     {
       if(Polygon_mesh_processing::is_degenerate_triangle_face(f, tmesh, np))
+      {
+#ifdef CGAL_AW3_DEBUG
+        std::cerr << "Warning: ignoring degenerate face " << f << std::endl;
+#endif
         continue;
+      }
 
       const Point_ref p0 = get(vpm, source(halfedge(f, tmesh), tmesh));
       const Point_ref p1 = get(vpm, target(halfedge(f, tmesh), tmesh));
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
index 35966be46447..27322a554e36 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
@@ -164,7 +164,12 @@ class Triangle_soup_oracle
 
       const Triangle_3 tr = triangle(p0, p1, p2);
       if(is_degenerate(tr))
+      {
+#ifdef CGAL_AW3_DEBUG
+        std::cerr << "Warning: ignoring degenerate face " << tr << std::endl;
+#endif
         continue;
+      }
 
       Splitter_base::split_and_insert_datum(tr, this->tree(), this->geom_traits());
     }
@@ -190,7 +195,12 @@ class Triangle_soup_oracle
     for(const Triangle_3& tr : triangles)
     {
       if(is_degenerate(tr))
+      {
+#ifdef CGAL_AW3_DEBUG
+        std::cerr << "Warning: ignoring degenerate triangle " << tr << std::endl;
+#endif
         continue;
+      }
 
       Splitter_base::split_and_insert_datum(tr, this->tree(), this->geom_traits());
     }

From 8e36b7b37e6dd2e14d55e3997d70d1ec3b0af26e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 5 Oct 2023 09:32:22 +0200
Subject: [PATCH 0818/1398] the map is either const or take by copy

---
 Property_map/include/CGAL/property_map.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Property_map/include/CGAL/property_map.h b/Property_map/include/CGAL/property_map.h
index 12fd06503fee..f1115cbf05a8 100644
--- a/Property_map/include/CGAL/property_map.h
+++ b/Property_map/include/CGAL/property_map.h
@@ -661,7 +661,7 @@ struct Boolean_property_map
     return pm.set_ptr->count(k) != 0;
   }
 
-  friend void put(Boolean_property_map<Set>& pm, const key_type& k, bool v)
+  friend void put(Boolean_property_map<Set> pm, const key_type& k, bool v)
   {
     CGAL_assertion(pm.set_ptr!=nullptr);
     if (v)

From d53d30a69b763ad489c0476b510aa664630c0f3c Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Thu, 5 Oct 2023 13:27:54 +0200
Subject: [PATCH 0819/1398] Defining a new resource directory to be used with
 doxygen master 1.10.0

Doxygen master 1.10.0 has support for the c++ concept of modules but as in the past doxygen used the term "modules" for the grouping of information (`commands like `\defgroup`, `\ingroup` etc.) an new term for the later has been introduced: Topics.
The introduction of the new term also has some influence on the generated files and file names.
The consequence of this is that part of CGAL documentation (i.e. the "Reference Manual") item didn't appear anymore in a.o. the treeview.
- creating a new setup
- adding the "topics" to the layout files as in the past the "modules" were.
- adjusting the "hack.js" where some manipulation of the TreeView is done and this had "modules" coded into it.
- adjusting the "header_packages.html" as this used the name "modules.js"
---
 Documentation/doc/CMakeLists.txt              |   2 +-
 .../doc/resources/1.10.0/BaseDoxyfile.in      | 813 ++++++++++++++++++
 .../doc/resources/1.10.0/CGAL_mathjax.js      |  35 +
 .../doc/resources/1.10.0/DoxygenLayout.xml    | 177 ++++
 .../resources/1.10.0/DoxygenLayoutPackage.xml | 178 ++++
 .../doc/resources/1.10.0/cgal_stylesheet.css  | 386 +++++++++
 .../doc/resources/1.10.0/footer.html          |  21 +
 Documentation/doc/resources/1.10.0/hacks.js   | 128 +++
 .../doc/resources/1.10.0/header.html          |  82 ++
 .../doc/resources/1.10.0/header_package.html  | 144 ++++
 .../doc/resources/1.10.0/menu_version.js      | 109 +++
 11 files changed, 2074 insertions(+), 1 deletion(-)
 create mode 100644 Documentation/doc/resources/1.10.0/BaseDoxyfile.in
 create mode 100644 Documentation/doc/resources/1.10.0/CGAL_mathjax.js
 create mode 100644 Documentation/doc/resources/1.10.0/DoxygenLayout.xml
 create mode 100644 Documentation/doc/resources/1.10.0/DoxygenLayoutPackage.xml
 create mode 100644 Documentation/doc/resources/1.10.0/cgal_stylesheet.css
 create mode 100644 Documentation/doc/resources/1.10.0/footer.html
 create mode 100644 Documentation/doc/resources/1.10.0/hacks.js
 create mode 100644 Documentation/doc/resources/1.10.0/header.html
 create mode 100644 Documentation/doc/resources/1.10.0/header_package.html
 create mode 100644 Documentation/doc/resources/1.10.0/menu_version.js

diff --git a/Documentation/doc/CMakeLists.txt b/Documentation/doc/CMakeLists.txt
index 481b1792c4fd..0e7ddd3b95af 100644
--- a/Documentation/doc/CMakeLists.txt
+++ b/Documentation/doc/CMakeLists.txt
@@ -263,7 +263,7 @@ set(CGAL_DOC_DXY_DIR "${CMAKE_BINARY_DIR}/doc_dxy")
 file(MAKE_DIRECTORY "${CGAL_DOC_DXY_DIR}")
 
 #Setting the resource directory depending on the version of doxygen
-set(CGAL_DOC_RESOURCE_DIR_DEFAULT "${CMAKE_CURRENT_LIST_DIR}/resources/1.9.6")
+set(CGAL_DOC_RESOURCE_DIR_DEFAULT "${CMAKE_CURRENT_LIST_DIR}/resources/1.10.0")
 
 #  first look if resources for the specific doxygen version is available, fallback
 #  on the default otherwise
diff --git a/Documentation/doc/resources/1.10.0/BaseDoxyfile.in b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
new file mode 100644
index 000000000000..7322b03d12e0
--- /dev/null
+++ b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
@@ -0,0 +1,813 @@
+# Doxyfile 1.9.6
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# Only the settings that are not the default ones are kept in this file
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           =
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = YES
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = YES
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = NO
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:^^"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". Note that you cannot put \n's in the value part of an alias
+# to insert newlines (in the resulting output). You can put ^^ in the value part
+# of an alias to insert a newline as if a physical newline was in the original
+# file. When you need a literal { or } or , in the value part of an alias you
+# have to escape them by means of a backslash (\), this can lead to conflicts
+# with the commands \{ and \} for these it is advised to use the version @{ and
+# @} or use a double escape (\\{ and \\})
+
+ALIASES                = "cgal=%CGAL" \
+                         "protocgal=C++gal" \
+                         "plageo=Plageo" \
+                         "stl=STL" \
+                         "gmp=GMP" \
+                         "gmpxx=GMPXX" \
+                         "iso=ISO" \
+                         "lisp=Lisp" \
+                         "ieee=IEEE" \
+                         "ascii=ASCII" \
+                         "exacus=Exacus" \
+                         "mpir=MPIR" \
+                         "mpfr=MPFR" \
+                         "leda=LEDA" \
+                         "gcc=GCC" \
+                         "dcel=DCEL" \
+                         "bgl=BGL" \
+                         "boost=Boost" \
+                         "gnu=GNU" \
+                         "ms=MS" \
+                         "qt=Qt" \
+                         "qt5=Qt5" \
+                         "eigen=Eigen" \
+                         "opengr=OpenGR" \
+                         "libpointmatcher=libpointmatcher" \
+                         "core=Core" \
+                         "mpfi=MPFI" \
+                         "ntl=NTL" \
+                         "pdb=PDB" \
+                         "esbtl=ESBTL" \
+                         "tbb=TBB" \
+                         "laslib=LASlib" \
+                         "opencv=OpenCV" \
+                         "tensorflow=TensorFlow" \
+                         "metis=METIS" \
+                         "zlib=zlib" \
+                         "ceres=Ceres" \
+                         "glpk=GLPK" \
+                         "scip=SCIP" \
+                         "osqp=OSQP" \
+                         "rs=RS" \
+                         "rs3=RS3" \
+                         "unix=Unix" \
+                         "api=API" \
+                         "vtk=VTK" \
+                         "visualstudio=Visual Studio" \
+                         "taucs=TAUCS" \
+                         "lapack=LAPACK" \
+                         "blas=BLAS" \
+                         "opennl=OpenNL" \
+                         "cpp=C++" \
+                         "cpp11=C++11" \
+                         "CC=C++" \
+                         "cgalExample{1}=<br><b>File</b> \ref \1 \include \1" \
+                         "cgalFigureAnchor{1}=\anchor fig__\1" \
+                         "cgalFigureRef{1}=\ref fig__\1" \
+                         "cgalFigureBegin{2}=\anchor fig__\1 ^^ \image html \2 ^^ \image latex \2 \"\" width=15cm ^^ \htmlonly[block] <div class=\"cgal_figure_caption\"> \endhtmlonly ^^ \ref fig__\1" \
+                         "cgalFigureBegin{3}=\anchor fig__\1 ^^  <CENTER> <TABLE border=0> <TR> <TD> \image html \2 ^^ \image latex \2 \"\" width=7.5cm ^^ </TD> <TD> \image html \3 ^^ \image latex \3 \"\" width=7.5cm ^^ </TD> </TR> </TABLE> </CENTER> \htmlonly[block] <div class=\"cgal_figure_caption\"> \endhtmlonly ^^ \ref fig__\1" \
+                         "cgalFigureBegin{4}=\anchor fig__\1 ^^  <CENTER> <TABLE border=0> <TR> <TD> \image html \2 ^^ \image latex \2 \"\" width=5cm ^^ </TD> <TD> \image html \3 ^^ \image latex \3 \"\" width=5cm ^^ </TD> <TD> \image html \4 ^^ \image latex \4 \"\" width=5cm ^^ </TD> </TR> </TABLE> </CENTER> \htmlonly[block] <div class=\"cgal_figure_caption\"> \endhtmlonly ^^ \ref fig__\1" \
+                         "cgalFigureBegin{5}=\anchor fig__\1 ^^  <CENTER> <TABLE border=0> <TR> <TD> \image html \2 ^^ \image latex \2 \"\" width=3.75cm ^^ </TD> <TD> \image html \3 ^^ \image latex \3 \"\" width=3.75cm ^^ </TD> <TD> \image html \4 ^^ \image latex \4 \"\" width=3.75cm ^^ </TD> <TD> \image html \5 ^^ \image latex \5 \"\" width=3.75cm ^^ </TD> </TR> </TABLE> </CENTER> \htmlonly[block] <div class=\"cgal_figure_caption\"> \endhtmlonly ^^ \ref fig__\1" \
+                         "cgalFigureBegin{6}=\anchor fig__\1 ^^  <CENTER> <TABLE border=0> <TR> <TD> \image html \2 ^^ \image latex \2 \"\" width=3cm ^^ </TD> <TD> \image html \3 ^^ \image latex \3 \"\" width=3cm ^^ </TD> <TD> \image html \4 ^^ \image latex \4 \"\" width=3cm ^^ </TD> <TD> \image html \5 ^^ \image latex \5 \"\" width=3cm ^^ </TD> <TD> \image html \6 ^^ \image latex \6 \"\" width=3cm ^^ </TD> </TR> </TABLE> </CENTER> \htmlonly[block] <div class=\"cgal_figure_caption\"> \endhtmlonly ^^ \ref fig__\1" \
+                         "cgalFigureBegin{7}=\anchor fig__\1 ^^  <CENTER> <TABLE border=0> <TR> <TD> \image html \2 ^^ \image latex \2 \"\" width=2.5cm ^^ </TD> <TD> \image html \3 ^^ \image latex \3 \"\" width=2.5cm ^^ </TD> <TD> \image html \4 ^^ \image latex \4 \"\" width=2.5cm ^^ </TD> <TD> \image html \5 ^^ \image latex \5 \"\" width=2.5cm ^^ </TD> <TD> \image html \6 ^^ \image latex \6 \"\" width=2.5cm ^^ </TD> <TD> \image html \7 ^^ \image latex \7 \"\" width=2.5cm ^^ </TD> </TR> </TABLE> </CENTER> \htmlonly[block] <div class=\"cgal_figure_caption\"> \endhtmlonly ^^ \ref fig__\1" \
+                         "cgalFigureBegin{8}=\anchor fig__\1 ^^  <CENTER> <TABLE border=0> <TR> <TD> \image html \2 ^^ \image latex \2 \"\" width=2.1cm ^^ </TD> <TD> \image html \3 ^^ \image latex \3 \"\" width=2.1cm ^^ </TD> <TD> \image html \4 ^^ \image latex \4 \"\" width=2.1cm ^^ </TD> <TD> \image html \5 ^^ \image latex \5 \"\" width=2.1cm ^^ </TD> <TD> \image html \6 ^^ \image latex \6 \"\" width=2.1cm ^^ </TD> <TD> \image html \7 ^^ \image latex \7 \"\" width=2.1cm ^^ </TD> <TD> \image html \8 ^^ \image latex \8 \"\" width=2.1cm ^^ </TD> </TR> </TABLE> </CENTER> \htmlonly[block] <div class=\"cgal_figure_caption\"> \endhtmlonly ^^ \ref fig__\1" \
+                         "cgalFigureBegin{9}=\anchor fig__\1 ^^  <CENTER> <TABLE border=0> <TR> <TD> \image html \2 ^^ \image latex \2 \"\" width=1.9cm ^^ </TD> <TD> \image html \3 ^^ \image latex \3 \"\" width=1.9cm ^^ </TD> <TD> \image html \4 ^^ \image latex \4 \"\" width=1.9cm ^^ </TD> <TD> \image html \5 ^^ \image latex \5 \"\" width=1.9cm ^^ </TD> <TD> \image html \6 ^^ \image latex \6 \"\" width=1.9cm ^^ </TD> <TD> \image html \7 ^^ \image latex \7 \"\" width=1.9cm ^^ </TD> <TD> \image html \8 ^^ \image latex \8 \"\" width=1.9cm ^^ </TD> <TD> \image html \9 ^^ \image latex \9 \"\" width=1.9cm ^^ </TD> </TR> </TABLE> </CENTER> \htmlonly[block] <div class=\"cgal_figure_caption\"> \endhtmlonly ^^ \ref fig__\1" \
+                         "cgalFigureBegin{10}=\anchor fig__\1 ^^ <CENTER> <TABLE border=0> <TR> <TD> \image html \2 ^^ \image latex \2 \"\" width=1.6cm ^^ </TD> <TD> \image html \3 ^^ \image latex \3 \"\" width=1.6cm ^^ </TD> <TD> \image html \4 ^^ \image latex \4 \"\" width=1.6cm ^^ </TD> <TD> \image html \5 ^^ \image latex \5 \"\" width=1.6cm ^^ </TD> <TD> \image html \6 ^^ \image latex \6 \"\" width=1.6cm ^^ </TD> <TD> \image html \7 ^^ \image latex \7 \"\" width=1.6cm ^^ </TD> <TD> \image html \8 ^^ \image latex \8 \"\" width=1.6cm ^^ </TD> <TD> \image html \9 ^^ \image latex \9 \"\" width=1.6cm ^^ </TD> <TD> \image html \10 ^^ \image latex \10 \"\" width=1.6cm ^^ </TD> </TR> </TABLE> </CENTER> \htmlonly[block] <div class=\"cgal_figure_caption\"> \endhtmlonly ^^ \ref fig__\1" \
+                         "cgalFigureEnd=\htmlonly[block] </div> \endhtmlonly <br>" \
+                         "cgalFigureCaptionBegin{1}=\htmlonly[block] <div class=\"cgal_figure_caption\"> \endhtmlonly \ref fig__\1" \
+                         "cgalFigureCaptionEnd=\htmlonly[block] </div> \endhtmlonly <br>" \
+                         "cgalConcept=\details <div id=\"CGALConcept\"></div>^^ \brief" \
+                         "cgalConceptNamespace=\details <div id=\"CGALConceptNS\"></div>^^ \brief" \
+                         "cgalRefines=Refines" \
+                         "cgalRefines{1}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd></dl>" \
+                         "cgalRefines{2}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd></dl>" \
+                         "cgalRefines{3}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd></dl>" \
+                         "cgalRefines{4}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd></dl>" \
+                         "cgalRefines{5}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd></dl>" \
+                         "cgalRefinesBare{1}=<dl><dt>@cgalRefines</dt><dd>\1</dd></dl>" \
+                         "cgalRefinesBare{2}=<dl><dt>@cgalRefines</dt><dd>@c \1</dd><dt></dt><dd>\2</dd></dl>" \
+                         "cgalModelsHeader=Is model of" \
+                         "cgalModels{1}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd></dl>" \
+                         "cgalModels{2}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd></dl>" \
+                         "cgalModels{3}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd></dl>" \
+                         "cgalModels{4}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd></dl>" \
+                         "cgalModels{5}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd></dl>" \
+                         "cgalModels{6}=<dl><dt>@cgalModelsHeader</dt><dd>@c \1</dd><dt></dt><dd>@c \2</dd><dt></dt><dd>@c \3</dd><dt></dt><dd>@c \4</dd><dt></dt><dd>@c \5</dd><dt></dt><dd>@c \6</dd></dl>" \
+                         "cgalModelsBareBegin=<dl><dt>@cgalModelsHeader</dt><dd></dd>" \
+                         "cgalModelsBareEnd=</dl>" \
+                         "cgalModelsBare{1}=<dt></dt><dd>\1</dd>" \
+                         "cgalGeneralizes=\xrefitem generalizes \"Generalizes\" \"Generalization Relationships\"" \
+                         "cgalHasModelsHeader=Has models" \
+                         "cgalHasModelsBegin=<dl><dt>@cgalHasModelsHeader</dt><dd></dd>" \
+                         "cgalHasModels{1}=<dt></dt><dd>`\1`</dd>" \
+                         "cgalHasModelsBare{1}=<dt></dt><dd>\1</dd>" \
+                         "cgalHasModelsEnd=</dl>" \
+                         "cgalDebugBegin=\htmlonly[block] <div class=\"CGALDebug\"> <div>Debugging Support</div> \endhtmlonly ^^" \
+                         "cgalDebugEnd=\htmlonly[block] </div> \endhtmlonly" \
+                         "cgalDebugFunction=This is a function for debugging purpose." \
+                         "cgalAdvancedBegin=^^ \htmlonly[block] <div class=\"CGALAdvanced\"> <div>Advanced</div> \endhtmlonly ^^" \
+                         "cgalAdvancedEnd=\noop ^^ \htmlonly[block] </div> \endhtmlonly" \
+                         "cgalAdvancedFunction=This is an advanced function." \
+                         "cgalAdvancedClass=This is an advanced class." \
+                         "cgalAdvancedType=This is an advanced type." \
+                         "cgalAdvancedConcept=This is an advanced concept." \
+                         "cgalRequiresCPP11=\warning This function requires a C++11 compiler." \
+                         "cgalPkgPicture{1}=<div class=\"PkgImage\"> ^^ \image html \1 ^^</div>" \
+                         "cgalPkgSummaryBegin=<div class=\"PkgSummary\">" \
+                         "cgalPkgSummaryEnd=</div>" \
+                         "cgalPkgShortInfoBegin=<div class=\"PkgShortInfo\">" \
+                         "cgalPkgShortInfoEnd=</div>" \
+                         "cgalPkgAuthor{1}=<div class=\"PkgAuthors\">\1</div>" \
+                         "cgalPkgAuthors{1}=\cgalPkgAuthor{\1}" \
+                         "cgalPkgDesc{1}=<div class=\"PkgDescription\">\1</div>" \
+                         "cgalPkgSince{1}=<B>Introduced in:</B> \cgal \1<BR>" \
+                         "cgalPkgDependsOn{1}=<B>Depends on:</B> \1 <BR>" \
+                         "cgalPkgLicense{1}=<B>License:</B> \1 <BR>" \
+                         "cgalPkgDemo{2}=<B>Windows demo:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
+                         "cgalPkgDemo{4}=<B>Windows demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
+                         "cgalPkgDemo{6}=<B>Windows demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\6\">\5</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
+                         "cgalPkgDescriptionEnd=" \
+                         "cgalModifBegin=\htmlonly <div class=\"CGALModification\"> \endhtmlonly \xrefitem Modification \"Modifications\" \"MODIFICATIONS\"" \
+                         "cgalModifEnd=\htmlonly </div> \endhtmlonly \latexonly END MODIFICATIONS \endlatexonly" \
+                         "cgalPkgBib{1}=<B>BibTeX:</B> <a href=\"../Manual/how_to_cite_cgal.html#\1-${CGAL_RELEASE_YEAR_ID}\">\1-${CGAL_RELEASE_YEAR_ID}</a><BR>" \
+                         "cgalFootnote{1}=<span class=\"footnote\">\1</span>" \
+                         "cgalFootnoteCode{1}=<tt style='display:inline'>\1</tt>" \
+                         "cgalAutoToc=\htmlonly[block] <div id=\"autotoc\" class=\"toc\"></div> \endhtmlonly" \
+                         "cgalTagTrue=\link CGAL::Tag_true `CGAL::Tag_true`\endlink" \
+                         "cgalTagFalse=\link CGAL::Tag_false `CGAL::Tag_false`\endlink" \
+                         "cgalHeading{1}= <B>\1</B><BR>" \
+                         "cgalClassifedRefPages=\htmlonly[block] <h2 class=\"groupheader\">Classified Reference Pages</h2> \endhtmlonly" \
+                         "cgalCRPSection{1}=<h2>\1</h2>" \
+                         "cgalCRPSubsection{1}=<h3>\1</h3>" \
+                         "cgalCite{1}=<!-- -->\cite \1" \
+                         "cgalPackageSection{2}=\htmlonly[block] <div style=\"background-color: #EEEDF2;\">\endhtmlonly \section \1 \2 ^^ \htmlonly[block] </div>\endhtmlonly" \
+                         "cgalNamedParamsBegin=<dl class=\"params\"><dt>Optional Named Parameters</dt><dd> <table class=\"params\">" \
+                         "cgalNamedParamsBegin{1}=<dl class=\"params\"><dt>\1</dt><dd> <table class=\"params\">" \
+                         "cgalNamedParamsEnd=</table> </dd> </dl>" \
+                         "cgalParamNBegin{1}=<tr><td class> \htmlonly[block] <button class=\"collapsible\">\endhtmlonly <b>\1</b> \htmlonly[block]</button> <div class=\"content\">\endhtmlonly<ul>" \
+                         "cgalParamDescription{1}=<li>\1</li>" \
+                         "cgalParamType{1}=<li><b>Type: </b>\1</li>" \
+                         "cgalParamDefault{1}=<li><b>%Default: </b>\1</li>" \
+                         "cgalParamExtra{1}=<li><b>Extra: </b>\1</li>" \
+                         "cgalParamNEnd=</ul> \htmlonly[block] </div> \endhtmlonly </td><td></td></tr>" \
+                         "cgalParamSectionBegin{1}=\cgalParamNBegin{\1}" \
+                         "cgalParamSectionEnd=\cgalParamNEnd" \
+                         "cgalParamPrecondition{1}=<li><b>Precondition: </b>\1</li>" \
+                         "cgalBigO{1}=\f$O(\1)\f$" \
+                         "cgalBigOLarge{1}=\f$O\left(\1\right)\f$" \
+                         "cgalInclude{1}=`#include<\1>`"
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, JavaScript,
+# Csharp (C#), C, C++, Lex, D, PHP, md (Markdown), Objective-C, Python, Slice,
+# VHDL, Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
+# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
+# tries to guess whether the code is fixed or free formatted code, this is the
+# default for Fortran type files). For instance to make doxygen treat .inc files
+# as Fortran files (default is PHP), and .f files as C (default is Fortran),
+# use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen. When specifying no_extension you should add
+# * to the FILE_PATTERNS.
+#
+# Note see also the list of default file extension mappings.
+
+EXTENSION_MAPPING      = txt=C++
+
+# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up
+# to that level are automatically included in the table of contents, even if
+# they do not have an id attribute.
+# Note: This feature currently applies only to Markdown headings.
+# Minimum value: 0, maximum value: 99, default value: 5.
+# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.
+
+TOC_INCLUDE_HEADINGS   = 0
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = YES
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = NO
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = YES
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = YES
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = NO
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = NO
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file. See also section "Changing the
+# layout of pages" for information.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            = ${CGAL_DOC_RESOURCE_DIR}/DoxygenLayoutPackage.xml
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also https://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         = ${CGAL_DOC_BIBLIO_DIR}/cgal_manual.bib \
+                         ${CGAL_DOC_BIBLIO_DIR}/geom.bib
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# Note the list of default checked file patterns might differ from the list of
+# default file extension mappings.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.l, *.cs, *.d, *.php, *.php4, *.php5, *.phtml,
+# *.inc, *.m, *.markdown, *.md, *.mm, *.dox (to be provided as doxygen C
+# comment), *.py, *.pyw, *.f90, *.f95, *.f03, *.f08, *.f18, *.f, *.for, *.vhd,
+# *.vhdl, *.ucf, *.qsf and *.ice.
+
+FILE_PATTERNS          = *.cpp \
+                         *.txt \
+                         *.md \
+                         *.h \
+                         *.hpp
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = YES
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# ANamespace::AClass, ANamespace::*Test
+
+EXCLUDE_SYMBOLS        = Tr \
+                         Vb \
+                         Cb \
+                         Fb \
+                         K \
+                         Traits \
+                         internal
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       = *.cpp \
+                         *.h
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            = ${CGAL_DOC_HEADER_PACKAGE}
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            = ${CGAL_DOC_RESOURCE_DIR}/footer.html
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = YES
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine tune the look of the index (see "Fine-tuning the output"). As an
+# example, the default style sheet generated by doxygen has an example that
+# shows how to put an image at the root of the tree instead of the PROJECT_NAME.
+# Since the tree basically has the same information as the tab index, you could
+# consider setting DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = YES
+
+# If the HTML_FORMULA_FORMAT option is set to svg, doxygen will use the pdf2svg
+# tool (see https://github.com/dawbarton/pdf2svg) or inkscape (see
+# https://inkscape.org) to generate formulas as SVG images instead of PNGs for
+# the HTML output. These images will generally look nicer at scaled resolutions.
+# Possible values are: png (the default) and svg (looks nicer but requires the
+# pdf2svg or inkscape tool).
+# The default value is: png.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FORMULA_FORMAT    = svg
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# https://www.mathjax.org) which uses client side JavaScript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = YES
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from https://www.mathjax.org before deployment. The default value is:
+# - in case of MathJax version 2: https://cdn.jsdelivr.net/npm/mathjax@2
+# - in case of MathJax version 3: https://cdn.jsdelivr.net/npm/mathjax@3
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+${CGAL_DOC_MATHJAX_LOCATION_FULL_OPTION_LINE}
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# for MathJax version 2 (see
+# https://docs.mathjax.org/en/v2.7-latest/tex.html#tex-and-latex-extensions):
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# For example for MathJax version 3 (see
+# http://docs.mathjax.org/en/latest/input/tex/extensions/index.html):
+# MATHJAX_EXTENSIONS = ams
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     = TeX/AMSmath \
+                         TeX/AMSsymbols
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see:
+# http://docs.mathjax.org/en/v2.7-latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       = ${CGAL_DOC_RESOURCE_DIR}/CGAL_mathjax.js
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = YES
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = YES
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             = DOXYGEN_RUNNING \
+                         "CGAL_NP_TEMPLATE_PARAMETERS=NamedParameters = CGAL::parameters::Default_named_parameters" \
+                         "CGAL_NP_CLASS=NamedParameters" \
+                         "CGAL_NP_TEMPLATE_PARAMETERS_1=NamedParameters1 = CGAL::parameters::Default_named_parameter" \
+                         "CGAL_NP_CLASS_1=NamedParameters1" \
+                         "CGAL_NP_TEMPLATE_PARAMETERS_2=NamedParameters2 = CGAL::parameters::Default_named_parameter" \
+                         "CGAL_NP_CLASS_2=NamedParameters2" \
+                         CGAL_DEPRECATED  \
+                         CGAL_DEPRECATED_MSG(name)=
+
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = NO
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to diagram generator tools
+#---------------------------------------------------------------------------
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# https://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: NO.
+
+HAVE_DOT               = YES
+
+# If the CLASS_GRAPH tag is set to YES or GRAPH or BUILTIN then doxygen will
+# generate a graph for each documented class showing the direct and indirect
+# inheritance relations. In case the CLASS_GRAPH tag is set to YES or GRAPH and
+# HAVE_DOT is enabled as well, then dot will be used to draw the graph. In case
+# the CLASS_GRAPH tag is set to YES and HAVE_DOT is disabled or if the
+# CLASS_GRAPH tag is set to BUILTIN, then the built-in generator will be used.
+# If the CLASS_GRAPH tag is set to TEXT the direct and indirect inheritance
+# relations will be shown as texts / links.
+# Possible values are: NO, YES, TEXT, GRAPH and BUILTIN.
+# The default value is: YES.
+
+CLASS_GRAPH            = TEXT
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = NO
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies. See also the chapter Grouping
+# in the manual.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = NO
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = YES
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = NO
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = NO
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = NO
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# https://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, jpg, gif, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = svg
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = YES
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# Note: This tag requires that UML_LOOK isn't set, i.e. the doxygen internal
+# graphical representation for inheritance and collaboration diagrams is used.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = NO
+
+# Flag available on in https://github.com/CGAL/doxygen/tree/release_1_9_6_patched
+# When the EXTRACT_ALL tag is set to YES and a member or class has no
+# documentation, no detailed section will be produced if the
+# NO_ADDITIONAL_DETAILS tag is set to YES. This tag has no effect if
+# the EXTRACT_ALL tag is set to NO.
+# The default value is: NO.
+${CGAL_OPT_NO_ADDITIONAL_DETAILS}
+
diff --git a/Documentation/doc/resources/1.10.0/CGAL_mathjax.js b/Documentation/doc/resources/1.10.0/CGAL_mathjax.js
new file mode 100644
index 000000000000..5ba6efa5bfbc
--- /dev/null
+++ b/Documentation/doc/resources/1.10.0/CGAL_mathjax.js
@@ -0,0 +1,35 @@
+//<![CDATA[
+MathJax.Hub.Config(
+{
+  TeX: {
+      Macros: {
+          qprel: [ "{\\gtreqless}", 0],
+          qpx: [ "{\\mathbf{x}}", 0],
+          qpl: [ "{\\mathbf{l}}", 0],
+          qpu: [ "{\\mathbf{u}}", 0],
+          qpc: [ "{\\mathbf{c}}", 0],
+          qpb: [ "{\\mathbf{b}}", 0],
+          qpy: [ "{\\mathbf{y}}", 0],
+          qpw: [ "{\\mathbf{w}}", 0],
+          qplambda: [ "{\\mathbf{\\lambda}}", 0],
+          ssWpoint: [ "{\\bf #1}", 1],
+          ssWeight: [ "{w_{#1}}", 1],
+          dabs: [ "{\\parallel\\! #1 \\!\\parallel}", 1],
+          E: [ "{\\mathrm{E}}", 0],
+          A: [ "{\\mathrm{A}}", 0],
+          R: [ "{\\mathrm{R}}", 0],
+          N: [ "{\\mathrm{N}}", 0],
+          Q: [ "{\\mathrm{Q}}", 0],
+          Z: [ "{\\mathrm{Z}}", 0],
+          ccSum: [ "{\\sum_{#1}^{#2}{#3}}", 3],
+          ccProd: [ "{\\prod_{#1}^{#2}{#3}}", 3],
+          pyr: [ "{\\operatorname{Pyr}}", 0],
+          aff: [ "{\\operatorname{aff}}", 0],
+          Ac: [ "{\\cal A}", 0],
+          Sc: [ "{\\cal S}", 0],
+      },
+      equationNumbers: { autoNumber: "AMS" }
+  }
+}
+);
+//]]>
diff --git a/Documentation/doc/resources/1.10.0/DoxygenLayout.xml b/Documentation/doc/resources/1.10.0/DoxygenLayout.xml
new file mode 100644
index 000000000000..57427a213842
--- /dev/null
+++ b/Documentation/doc/resources/1.10.0/DoxygenLayout.xml
@@ -0,0 +1,177 @@
+<doxygenlayout version="1.0">
+  <!-- Navigation index tabs for HTML output -->
+  <navindex>
+    <tab type="mainpage" visible="yes" title=""/>
+    <tab type="topics" visible="yes" title="" intro=""/>
+    <tab type="pages" visible="yes" title="" intro=""/>
+    <tab type="classlist" visible="no" title="Class and Concept List" intro="Here is the list of all concepts and classes of the CGAL Library. Classes are inside the namespace CGAL. Concepts are in the global namespace."/>
+    <tab type="examples" visible="no" title="" intro=""/>  
+    <!-- <tab type="user" url="@ref how_to_cite_cgal" title="Acknowledging CGAL"/> -->
+  </navindex>
+
+  <!-- Layout definition for a class page -->
+  <class>
+    <briefdescription visible="no"/>
+    <detaileddescription title=" "/>
+    <includes visible="$SHOW_INCLUDE_FILES"/>
+    <inheritancegraph visible="$CLASS_GRAPH"/>
+    <collaborationgraph visible="$COLLABORATION_GRAPH"/>
+    <allmemberslink visible="yes"/>
+    <memberdecl>
+      <nestedclasses visible="yes" title=""/>
+      <publictypes title=""/>
+      <publicslots title=""/>
+      <signals title=""/>
+      <publicmethods title=""/>
+      <publicstaticmethods title=""/>
+      <publicattributes title=""/>
+      <publicstaticattributes title=""/>
+      <protectedtypes title=""/>
+      <protectedslots title=""/>
+      <protectedmethods title=""/>
+      <protectedstaticmethods title=""/>
+      <protectedattributes title=""/>
+      <protectedstaticattributes title=""/>
+      <packagetypes title=""/>
+      <packagemethods title=""/>
+      <packagestaticmethods title=""/>
+      <packageattributes title=""/>
+      <packagestaticattributes title=""/>
+      <properties title=""/>
+      <events title=""/>
+      <privatetypes title=""/>
+      <privateslots title=""/>
+      <privatemethods title=""/>
+      <privatestaticmethods title=""/>
+      <privateattributes title=""/>
+      <privatestaticattributes title=""/>
+      <friends title=""/>
+      <related title="" subtitle=""/>
+      <membergroups visible="yes"/>
+    </memberdecl>
+
+    <memberdef>
+      <inlineclasses title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <constructors title=""/>
+      <functions title=""/>
+      <related title=""/>
+      <variables title=""/>
+      <properties title=""/>
+      <events title=""/>
+    </memberdef>
+    <usedfiles visible="$SHOW_USED_FILES"/>
+    <authorsection visible="yes"/>
+  </class>
+
+  <!-- Layout definition for a namespace page -->
+  <namespace>
+    <briefdescription visible="yes"/>
+    <memberdecl>
+      <nestednamespaces visible="yes" title=""/>
+      <classes visible="yes" title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <functions title=""/>
+      <variables title=""/>
+      <membergroups visible="yes"/>
+    </memberdecl>
+    <detaileddescription title=""/>
+    <memberdef>
+      <inlineclasses title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <functions title=""/>
+      <variables title=""/>
+    </memberdef>
+    <authorsection visible="yes"/>
+  </namespace>
+
+  <!-- Layout definition for a file page -->
+  <file>
+    <briefdescription visible="yes"/>
+    <includes visible="$SHOW_INCLUDE_FILES"/>
+    <includegraph visible="$INCLUDE_GRAPH"/>
+    <includedbygraph visible="$INCLUDED_BY_GRAPH"/>
+    <sourcelink visible="yes"/>
+    <memberdecl>
+      <classes visible="yes" title=""/>
+      <namespaces visible="yes" title=""/>
+      <defines title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <functions title=""/>
+      <variables title=""/>
+      <membergroups visible="yes"/>
+    </memberdecl>
+    <detaileddescription title=""/>
+    <memberdef>
+      <inlineclasses title=""/>
+      <defines title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <functions title=""/>
+      <variables title=""/>
+    </memberdef>
+    <authorsection/>
+  </file>
+
+  <!-- Layout definition for a group page -->
+  <group>
+    <detaileddescription title=" "/>
+    <authorsection visible="yes"/>
+    <groupgraph visible="$GROUP_GRAPHS"/>
+    <memberdef>
+      <pagedocs/>
+    </memberdef>
+    <memberdecl>
+      <nestedgroups visible="yes" title=""/>
+      <dirs visible="yes" title=""/>
+      <files visible="yes" title=""/>
+      <namespaces visible="yes" title=""/>
+      <classes visible="yes" title=""/>
+      <defines title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <enumvalues title=""/>
+      <functions title=""/>
+      <variables title=""/>
+      <signals title=""/>
+      <publicslots title=""/>
+      <protectedslots title=""/>
+      <privateslots title=""/>
+      <events title=""/>
+      <properties title=""/>
+      <friends title=""/>
+      <membergroups visible="yes"/>
+    </memberdecl>
+    <memberdef>
+      <inlineclasses title=""/>
+      <defines title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <enumvalues title=""/>
+      <functions title=""/>
+      <variables title=""/>
+      <signals title=""/>
+      <publicslots title=""/>
+      <protectedslots title=""/>
+      <privateslots title=""/>
+      <events title=""/>
+      <properties title=""/>
+      <friends title=""/>
+    </memberdef>
+  </group>
+
+  <!-- Layout definition for a directory page -->
+  <directory>
+    <briefdescription visible="yes"/>
+    <directorygraph visible="yes"/>
+    <memberdecl>
+      <dirs visible="yes"/>
+      <files visible="yes"/>
+    </memberdecl>
+    <detaileddescription title=""/>
+  </directory>
+</doxygenlayout>
diff --git a/Documentation/doc/resources/1.10.0/DoxygenLayoutPackage.xml b/Documentation/doc/resources/1.10.0/DoxygenLayoutPackage.xml
new file mode 100644
index 000000000000..85ceba943aad
--- /dev/null
+++ b/Documentation/doc/resources/1.10.0/DoxygenLayoutPackage.xml
@@ -0,0 +1,178 @@
+<doxygenlayout version="1.0">
+  <!-- Navigation index tabs for HTML output -->
+  <navindex>
+    <tab type="mainpage" visible="yes" title=""/>
+    <tab type="topics" visible="yes" title="Reference Manual" intro=""/>
+    <tab type="pages" visible="yes" title="Pages" intro=""/>
+    <tab type="classlist" visible="yes" title="Class and Concept List" intro="Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace."/>
+    <tab type="filelist" visible="yes" title="" intro=""/>
+    <tab type="examples" visible="yes" title="" intro=""/>  
+  </navindex>
+
+  <!-- Layout definition for a class page -->
+  <class>
+    <briefdescription visible="no"/>
+    <includes visible="$SHOW_INCLUDE_FILES"/>
+    <inheritancegraph visible="$CLASS_GRAPH"/>
+    <detaileddescription title="Definition"/>
+    <collaborationgraph visible="$COLLABORATION_GRAPH"/>
+    <allmemberslink visible="yes"/>
+    <memberdecl>
+      <nestedclasses visible="yes" title=""/>
+      <!-- Disable the naming of the public types group -->
+      <publictypes title=""/>
+      <publicslots title=""/>
+      <signals title=""/>
+      <publicmethods title=""/>
+      <publicstaticmethods title=""/>
+      <publicattributes title=""/>
+      <publicstaticattributes title=""/>
+      <protectedtypes title=""/>
+      <protectedslots title=""/>
+      <protectedmethods title=""/>
+      <protectedstaticmethods title=""/>
+      <protectedattributes title=""/>
+      <protectedstaticattributes title=""/>
+      <packagetypes title=""/>
+      <packagemethods title=""/>
+      <packagestaticmethods title=""/>
+      <packageattributes title=""/>
+      <packagestaticattributes title=""/>
+      <properties title=""/>
+      <events title=""/>
+      <privatetypes title=""/>
+      <privateslots title=""/>
+      <privatemethods title=""/>
+      <privatestaticmethods title=""/>
+      <privateattributes title=""/>
+      <privatestaticattributes title=""/>
+      <friends title=""/>
+      <related title="" subtitle=""/>
+      <membergroups visible="yes"/>
+    </memberdecl>
+
+    <memberdef>
+      <inlineclasses title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <constructors title=""/>
+      <functions title=""/>
+      <related title=""/>
+      <variables title=""/>
+      <properties title=""/>
+      <events title=""/>
+    </memberdef>
+    <usedfiles visible="$SHOW_USED_FILES"/>
+    <authorsection visible="yes"/>
+  </class>
+
+  <!-- Layout definition for a namespace page -->
+  <namespace>
+    <briefdescription visible="yes"/>
+    <memberdecl>
+      <nestednamespaces visible="yes" title=""/>
+      <classes visible="yes" title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <functions title=""/>
+      <variables title=""/>
+      <membergroups visible="yes"/>
+    </memberdecl>
+    <detaileddescription title="Definition"/>
+    <memberdef>
+      <inlineclasses title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <functions title=""/>
+      <variables title=""/>
+    </memberdef>
+    <authorsection visible="yes"/>
+  </namespace>
+
+  <!-- Layout definition for a file page -->
+  <file>
+    <briefdescription visible="yes"/>
+    <includes visible="$SHOW_INCLUDE_FILES"/>
+    <includegraph visible="$INCLUDE_GRAPH"/>
+    <includedbygraph visible="$INCLUDED_BY_GRAPH"/>
+    <sourcelink visible="yes"/>
+    <memberdecl>
+      <classes visible="yes" title=""/>
+      <namespaces visible="yes" title=""/>
+      <defines title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <functions title=""/>
+      <variables title=""/>
+      <membergroups visible="yes"/>
+    </memberdecl>
+    <detaileddescription title=""/>
+    <memberdef>
+      <inlineclasses title=""/>
+      <defines title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <functions title=""/>
+      <variables title=""/>
+    </memberdef>
+    <authorsection/>
+  </file>
+
+  <!-- Layout definition for a group page -->
+  <group>
+    <detaileddescription title=" "/>
+    <authorsection visible="yes"/>
+    <groupgraph visible="$GROUP_GRAPHS"/>
+    <memberdef>
+      <pagedocs/>
+    </memberdef>
+    <memberdecl>
+      <nestedgroups visible="yes" title=""/>
+      <dirs visible="yes" title=""/>
+      <files visible="yes" title=""/>
+      <namespaces visible="yes" title=""/>
+      <classes visible="yes" title=""/>
+      <defines title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <enumvalues title=""/>
+      <functions title=""/>
+      <variables title=""/>
+      <signals title=""/>
+      <publicslots title=""/>
+      <protectedslots title=""/>
+      <privateslots title=""/>
+      <events title=""/>
+      <properties title=""/>
+      <friends title=""/>
+      <membergroups visible="yes"/>
+    </memberdecl>
+    <memberdef>
+      <inlineclasses title=""/>
+      <defines title=""/>
+      <typedefs title=""/>
+      <enums title=""/>
+      <enumvalues title=""/>
+      <functions title=""/>
+      <variables title=""/>
+      <signals title=""/>
+      <publicslots title=""/>
+      <protectedslots title=""/>
+      <privateslots title=""/>
+      <events title=""/>
+      <properties title=""/>
+      <friends title=""/>
+    </memberdef>
+  </group>
+
+  <!-- Layout definition for a directory page -->
+  <directory>
+    <briefdescription visible="yes"/>
+    <directorygraph visible="yes"/>
+    <memberdecl>
+      <dirs visible="yes"/>
+      <files visible="yes"/>
+    </memberdecl>
+    <detaileddescription title=""/>
+  </directory>
+</doxygenlayout>
diff --git a/Documentation/doc/resources/1.10.0/cgal_stylesheet.css b/Documentation/doc/resources/1.10.0/cgal_stylesheet.css
new file mode 100644
index 000000000000..71fe3a10aff1
--- /dev/null
+++ b/Documentation/doc/resources/1.10.0/cgal_stylesheet.css
@@ -0,0 +1,386 @@
+body, table, div, p, dl {
+    font: Lucida Grande,sans-serif;
+}
+
+.textsc {
+    font-variant: small-caps;
+}
+
+#projectnumber {
+    display: none;
+}
+
+#back-nav {
+    border-bottom: 1px solid;
+    padding: 0.5em;
+    background-color: #FAF9FB;
+}
+
+#back-nav h2 {
+    display: inline;
+}
+
+#back-nav ul
+{
+    display: inline;
+    padding: 0;
+    margin: 0;
+}
+
+#back-nav li
+{
+    display: inline;
+    list-style-type: none;
+    padding-right: 20px;
+}
+
+.tparams .paramname {
+    font-weight: bold;
+    vertical-align: top;
+}
+
+h1 {
+    font-size: 180%;
+}
+
+h2 {
+    font-size: 120%;
+}
+
+
+.icon-namespace {
+    font-family: Arial, Helvetica;
+    font-weight: bold;
+    font-size: 12px;
+    height: 14px;
+    width: 16px;
+    display: inline-block;
+    background-color: #FF0000;
+    color: white;
+    text-align: center;
+    border-radius: 4px;
+    margin-left: 2px;
+    margin-right: 2px;
+}
+
+.icon-class {
+    font-family: Arial, Helvetica;
+    font-weight: bold;
+    font-size: 12px;
+    height: 14px;
+    width: 16px;
+    display: inline-block;
+    background-color: #0000FF;
+    color: white;
+    text-align: center;
+    border-radius: 4px;
+    margin-left: 2px;
+    margin-right: 2px;
+}
+
+.icon-concept {
+    font-family: Arial, Helvetica;
+    font-weight: bold;
+    font-size: 12px;
+    height: 14px;
+    width: 16px;
+    display: inline-block;
+    background-color: #67489A;
+    color: white;
+    text-align: center;
+    border-radius: 4px;
+    margin-left: 2px;
+    margin-right: 2px;
+}
+
+h1.groupheader {
+    font-size: 150%;
+}
+
+/* enable this to make sections more alike */
+/* h2.groupheader { */
+/*     border-bottom: none; */
+/*     color: black; */
+/*     font-size: 100%; */
+/*     font-weight: bold; */
+/*     margin-top: 1.75em; */
+/*     padding-bottom: 0; */
+/*     padding-top: 0; */
+/*     width: 100%; */
+/* } */
+
+a.el {
+    font-weight: normal;
+}
+
+.memproto a {
+    font-weight: bold;
+}
+
+.PkgSummary {
+    width: 60%;
+}
+
+.PkgShortInfo {
+    width: 20%;
+}
+
+.PkgSummary, .PkgShortInfo, .PkgImage, .PkgImage .image {
+    display:inline-block;
+    padding:5px;
+    vertical-align:middle;
+}
+
+.PkgAuthors {
+    font-style: italic;
+}
+
+.PkgDescription {
+    padding-top: 5px;
+    padding-bottom: 5px;
+    text-align: justify;
+}
+
+/* footnote support */
+
+blockquote sup {
+	position: absolute;
+	right: 3px;
+	top: 3px;
+}
+
+.footnote ol li:hover {
+	text-decoration: underline;
+}
+
+a.footnoteBackref, a.footnoteLink {
+	text-decoration: none;
+}
+
+ol.footnotesList {
+        margin: 0;
+	font-size: 0.8em;
+	padding-top: 5px;
+}
+
+ol.footnotesList > li {
+	text-indent: -1.5em;
+	padding-left: 1.5em;
+	vertical-align: top;
+}
+
+.footnoteBackReferenceGroup {
+	padding-right: 0.5em;
+}
+.footnoteBackref {
+	padding-right: 0.25em;
+}
+span.footnoteContent {
+
+}
+span.footnoteContent > p:first-child, span.footnoteContent > div:first-child { 
+	display: inline; 
+}
+span.footnoteContent p, span.footnoteContent div {
+	text-indent: 0em;
+}
+
+/* footnote support end */
+
+dl
+{
+        padding: 0 0 0 0;
+}
+
+dl.section, dl.hasModels, dl.debugs, dl.models, dl.refines, dl.requires
+{
+    margin-left: 0px;
+    padding-left: 0px;
+}
+
+dl.section dt a, dl.hasModels dt a, dl.debugs dt a, 
+dl.models dt a, dl.refines dt a, dl.advanced dt a, 
+dl.requires dt a, dl.todo dt a, dl.bug dt a, dl.test dt a
+{
+    font-weight: bold;
+    color: black;
+}
+
+div.toc {
+    width: auto;
+}
+
+.ui-resizable-e {
+    background-repeat: repeat-y;
+}
+
+div.cgal_figure_caption {
+	text-align: center;
+}
+
+div.cgal_video_caption {
+	text-align: center;
+}
+
+div.groupText {
+    font-style: none;
+}
+
+#projectname
+{
+    font: 200% Tahoma, Arial,sans-serif;
+}
+
+#titlearea {
+    background: white;
+}
+
+#MSearchResultsWindow {
+    z-index: 2;
+}
+
+dl.note, dl.warning, dl.attention,
+dl.pre, dl.post, dl.invariant, dl.deprecated,
+dl.todo, dl.test, dl.bug
+{
+  margin-left:-7px;
+  padding-left: 3px;
+}
+
+div.CGALAdvanced
+{
+  background:     #eeb;
+  border:         1px solid #9e9e7d;
+  box-shadow:     0.5ex 0.5ex #ccc;
+}
+div.CGALDebug
+{
+  background:     #c8a8d0;
+  border:         1px solid #846f8a;
+  box-shadow:     0.5ex 0.5ex #777;
+}
+dl.deprecated
+{
+  border-left:    4px solid;
+  border-color:   #505050;
+
+  background:     #d8c0a0;
+  border:         1px solid #94836e;
+  box-shadow:     0.5ex 0.5ex #aaa;
+}
+
+div.CGALAdvanced,
+div.CGALDebug,
+dl.deprecated
+{
+  border-radius:  1ex;
+  padding-top:    0.5ex;
+  padding-bottom: 0.25ex;
+  padding-left:   1ex;
+  padding-right:  1ex;
+  margin-bottom:  1ex;
+}
+
+div.CGALModification
+{
+  background:     #f85858;
+  border:         1px solid #000000;
+  box-shadow:     0.5ex 0.5ex #777;
+  border-radius:  1ex;
+  padding-top:    0.5ex;
+  padding-bottom: 0.25ex;
+  padding-left:   1ex;
+  padding-right:  1ex;
+  margin-bottom:  1ex;
+}
+
+.Modification
+{
+  background:     #f85858;
+  border:         0px;
+  padding-top:    0ex;
+  padding-bottom: 0ex;
+  padding-left:   0ex;
+  padding-right:  0ex;
+  margin-bottom:  0ex;
+}
+
+/* The first div in CGALAdvanced sections is the "Advanced" header */
+div.CGALAdvanced > div,
+div.CGALDebug > div,
+dl.deprecated > dt > b > a
+{
+  font-style:  italic;
+  font-weight: bold;
+}
+/* Everything else is noise and should stay in the normal font */
+div.CGALAdvanced > div ~ div,
+div.CGALDebug > div ~ div,
+dl.deprecated > dt ~ dt
+{
+  font-style:  normal;
+  font-weight: normal;
+}
+
+/* More indentation for the text body */
+div.CGALAdvanced > p,
+div.CGALDebug > p,
+dl.deprecated > dd
+{
+  margin-left:   0;
+  margin-top:    1ex;
+  margin-bottom: 1ex;
+  padding-left:  1em;
+  padding-right: 1em;
+}
+
+/* Adjust the top and bottom margins of div.fragment */
+div.fragment {
+    padding: 4px;
+    margin: 1em 4px 1em 4px;
+}
+
+/* Make summary smaller to avoid wrapping of classes and concepts */
+div.summary
+{
+  width: auto;
+}
+
+.collapsible {
+  background-color: white;
+  color: #602020;
+  cursor: pointer;
+  padding: 3px;
+  width: 100%;
+  border: none;
+  text-align: left;
+  outline: none;
+  font: 14px Roboto,sans-serif;
+  user-select: auto;
+}
+
+.active, .collapsible:hover {
+  background-color: white;
+}
+
+.collapsible:after {
+  content: '\25B6';
+  color: #7A93C5;
+  font-weight: bold;
+  float: left;
+  margin-left: -20px;
+  margin-right: 5px;
+}
+
+.active:after {
+  content: "\25BC";
+}
+
+.content {
+  padding: 0 18px;
+  color: black;
+  max-height: 0;
+  overflow: hidden;
+  transition: max-height 0.2s ease-out;
+  background-color: white;
+}
diff --git a/Documentation/doc/resources/1.10.0/footer.html b/Documentation/doc/resources/1.10.0/footer.html
new file mode 100644
index 000000000000..2ccc7cf39b81
--- /dev/null
+++ b/Documentation/doc/resources/1.10.0/footer.html
@@ -0,0 +1,21 @@
+<!-- HTML footer for doxygen 1.9.6-->
+<!-- start footer part -->
+<!-- The footer div is not part of the default but we require it to
+move the footer to the bottom of the page. -->
+<div id="footer">
+<!--BEGIN GENERATE_TREEVIEW-->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    $navpath
+    <li class="footer">$generatedby <a href="https://www.doxygen.org/index.html"><img class="footer" src="$relpath^doxygen.svg" width="104" height="31" alt="doxygen"/></a> $doxygenversion </li>
+  </ul>
+</div>
+<!--END GENERATE_TREEVIEW-->
+<!--BEGIN !GENERATE_TREEVIEW-->
+<hr class="footer"/><address class="footer"><small>
+$generatedby&#160;<a href="https://www.doxygen.org/index.html"><img class="footer" src="$relpath^doxygen.svg" width="104" height="31" alt="doxygen"/></a> $doxygenversion
+</small></address>
+<!--END !GENERATE_TREEVIEW-->
+</div>
+</body>
+</html>
diff --git a/Documentation/doc/resources/1.10.0/hacks.js b/Documentation/doc/resources/1.10.0/hacks.js
new file mode 100644
index 000000000000..a290b02cee8e
--- /dev/null
+++ b/Documentation/doc/resources/1.10.0/hacks.js
@@ -0,0 +1,128 @@
+function generate_autotoc() {
+    var toc = $("#autotoc").append('<ul></ul>');
+    if(toc.length > 0) { // an autotoc has been requested
+        toc = toc.find('ul');
+        var indices = new Array();
+        indices[0] = 0;
+        indices[1] = 0;
+        indices[2] = 0;
+
+        $("h1, h2, h3").each(function(i) {
+            var current = $(this);
+            var levelTag = current[0].tagName.charAt(1);
+            var cur_id = current.attr("id");
+
+            indices[levelTag-1]+=1;  
+            var prefix=indices[0];
+            if (levelTag >1) prefix+="."+indices[1];
+            if (levelTag >2) prefix+="."+indices[2];
+            current.html(prefix + "   " + current.html());
+            for(var l = levelTag; l < 3; ++l){
+                indices[l] = 0;
+            }
+
+            if(cur_id == undefined) {
+                current.attr('id', 'title' + i);
+                current.addClass('anchor');
+                toc.append("<li class='level" + levelTag + "'><a id='link" + i + "' href='#title" +
+                           i + "' title='" + current.prop("tagName") + "'>" + current.text() + "</a></li>");
+            } else {
+                toc.append("<li class='level" + levelTag + "'><a id='" + cur_id + "' href='#title" +
+                           i + "' title='" + current.prop("tagName") + "'>" + current.text() + "</a></li>");
+            }
+
+        });
+    }
+}
+
+// throw a stick at the topics array and hijack gotoNode
+// for our own evil purposes
+$(document).ready(function() {
+    if (typeof topics !== 'undefined') {
+        // topics has been loaded, that means we are inside the
+        // documentation of a package
+        NAVTREE[0][2][1][1] = topics[0][1];
+        NAVTREE[0][2][1][2] = topics[0][2];
+        // override gotoNode from navtree.js
+        gotoNode = function (o,subIndex,root,hash,relpath) {
+            var nti = navTreeSubIndices[subIndex][root+hash];
+            if (!nti)
+            {
+              nti = navTreeSubIndices[subIndex][root];
+            }
+            if(nti && (nti[0] === 1 && nti[0])) {
+                nti.splice(1, 1);
+            }
+            o.breadcrumbs = $.extend(true, [], nti ? nti : navTreeSubIndices[subIndex][root]);
+            if (!o.breadcrumbs && root!=NAVTREE[0][1]) { // fallback: show index
+                navTo(o,NAVTREE[0][1],"",relpath);
+                $('.item').removeClass('selected');
+                $('.item').removeAttr('id');
+            }
+            if (o.breadcrumbs) {
+                o.breadcrumbs.unshift(0); // add 0 for root node
+                showNode(o, o.node, 0, hash);
+            }
+        }
+    }
+    // set-up footnote generation
+    $("#doc-content").append('<ol id="autoFootnotes0" class="footnotesList"></ol>');
+    $("body").footnotes();
+    generate_autotoc();
+});
+
+
+/* 
+ * A jQuery plugin by Brian Holt that will search the selected blocks for 
+ * specially-defined footnote elements.	 If found, these elements will be 
+ * moved to a footnotes section and links to and from the footnotes will 
+ * be created.
+ *
+ * See http://www.planetholt.com/articles/jQuery-Footnotes	
+ * for full documentation.
+ *
+ * By default, footnotes will be found in SPANs with the footnote class,
+ * and in BLOCKQUOTEs with a TITLE attribute.
+ *
+ * Thanks to CSSNewbies.com for the general idea, which I have enhanced 
+ * and implemented with as a jQuery plugin.
+ * 
+ * Copyright 2008-2009 Brian Holt.	
+ * Licensed under the LGPL license. See 
+ * http://www.gnu.org/licenses/lgpl-3.0-standalone.html
+ * 
+ * Version 1.2.2
+ */
+(function(c){c.fn.footnotes=function(d){var e=c.extend({},c.fn.footnotes.defaults,d);return this.each(function(f){b("INFO: Building footnotes for "+(f+1)+"...",e.debugMode);c(e.footnotes,this).addClass(e.autoFootnoteClass);var h=(""===e.contentBlock)?c(this):c(e.contentBlock,this),g=e.orderedList?"<ol/>":"<ul/>";c("."+e.autoFootnoteClass).each(function(l){var t=-1,n=f+"-"+l,q=c(this),j,r,s,u,p,m,o,k;if(e.singleFootnoteDestination){j=c("#"+e.destination);if(0===j.length){b("INFO: No #autoFootnotes found; adding our own",e.debugMode);j=c(g).attr("id",e.destination).addClass("footnotesList").appendTo(h)}}else{j=c("#"+e.destination+f);if(0===j.length){b("INFO: No #autoFootnotes"+f+" found; adding our own for "+(f+1),e.debugMode);j=c(g).attr("id",e.destination+f).addClass("footnotesList").appendTo(h)}}q.removeClass(e.autoFootnoteClass);r=e.fnExtractFootnote(this);t=-1;n=f+"-"+l;j.find("li > .footnoteContent").each(function(i){var v=c(this);if(v.html()===r){t=i;s=c(v.parents("li").get(0));return false}});if(-1===t){u=c("<a/>").attr("href","#cite-text-"+n).attr("name","cite-ref-"+n).attr("id","cite-ref-"+n).attr("dir","ltr").attr("title",r).text("["+(j.find("li").length+1)+"]").addClass("footnoteLink");if(q.is(e.prependTags)){c("<sup/>").prependTo(this).append(u)}else{c("<sup/>").appendTo(this).append(u)}p=c("<li/>").attr("id","cite-text-"+n);m=c("<span/>").addClass("footnoteBackReferenceGroup").appendTo(p);c("<span/>").addClass("footnoteContent").html(r).appendTo(p);u=c("<a/>").text("^").attr("href","#cite-ref-"+n).addClass("footnoteBackref").prependTo(m);j.append(p)}else{n=f+"-"+t;m=c(c("li > .footnoteBackReferenceGroup",j).get(t));o=m.find(".footnoteBackref");k=o.length;if(0===o.length){b("ERROR: $backRefs.length == 0, which should have prevented this code path",e.debugMode)}else{if(1===o.length){c("<sup/>").text("^ ").addClass("footnoteBackref").prependTo(m);o.html("<sup>a</sup>");++k}u=c("<a/>").attr("href","#"+s.attr("id")).attr("name","cite-ref-"+n+"-"+o.length).attr("id","cite-ref-"+n+"-"+o.length).attr("title",r).text("["+(t+1)+"]").addClass("footnoteLink");if(q.is(e.prependTags)){c("<sup/>").prependTo(this).append(u)}else{c("<sup/>").appendTo(this).append(u)}u=c("<a/>").attr("href","#cite-ref-"+n+"-"+o.length).addClass("footnoteBackref");if(k>=26){b("WARN: multiple letter functionality is probably broken when more than 26 footnotes exist",e.debugMode)}u.prepend(String.fromCharCode((k)+96));c("<sup/>").appendTo(m).append(u)}}});b("INFO: Done building footnotes for "+(f+1),e.debugMode)})};c.fn.footnotes.version=function(){return"1.2.2"};c.fn.footnotes.defaults={footnotes:"blockquote[title],span.footnote,blockquote[cite]",prependTags:"blockquote",singleFootnoteDestination:false,destination:"autoFootnotes",contentBlock:".content",autoFootnoteClass:"autoFootnote",fnExtractFootnote:a,orderedList:true,debugMode:true};function b(e,d){if(d){if(window.console&&window.console.log){window.console.log(e)}}}function a(i){var j=c(i),e,f,h,g,d;if(j.is("span.footnote")){e=c(i).html();f=/^(?:(?:&nbsp;)|\s)*\(([\S\s]+)\)(?:(?:&nbsp;)|\s)*$/;h=e.match(f);if(h&&2===h.length){e=h[1]}j.empty()}else{if(j.is("blockquote[title]")){g=j.attr("cite");e=j.attr("title");if(""!==g){d=c("<a/>").attr("href",g);if(0===c(e).length){e=d.text(e)}else{e=d.text(g).wrap("<span/>").parent().append(": "+e);j.attr("title","")}}}else{if(j.is("blockquote[cite]")){g=j.attr("cite");e=c("<a/>").attr("href",g).text(g)}}}return e}})(jQuery);
+(function(){
+    if(window.location.href.includes("doc.cgal.org")){ 
+      var url='https://doc.cgal.org/latest/Manual/menu_version.js';
+      var script = document.createElement("script"); // Make a script DOM node
+      script.src = url; // Set it's src to the provided URL
+      document.head.appendChild(script);
+    }
+    else
+    {
+      var url='../Manual/menu_version.js';
+      var script = document.createElement("script"); // Make a script DOM node
+      script.src = url; // Set it's src to the provided URL
+      document.head.appendChild(script);
+    }
+})();
+
+$(document).ready(function() {
+    var coll = document.getElementsByClassName("collapsible");
+    var i;
+
+    for (i = 0; i < coll.length; i++) {
+        coll[i].addEventListener("click", function() {
+            this.classList.toggle("active");
+            var content = this.nextElementSibling;
+            if (content.style.maxHeight){
+              content.style.maxHeight = null;
+            } else {
+              content.style.maxHeight = content.scrollHeight + "px";
+            }
+        });
+    }
+});
diff --git a/Documentation/doc/resources/1.10.0/header.html b/Documentation/doc/resources/1.10.0/header.html
new file mode 100644
index 000000000000..3eb37d8b586f
--- /dev/null
+++ b/Documentation/doc/resources/1.10.0/header.html
@@ -0,0 +1,82 @@
+<!-- HTML header for doxygen 1.9.6-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="$langISO">
+<head>
+<link rel="icon" type="image/png" href="$relpath$../Manual/g-196x196-doc.png"/>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen $doxygenversion"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<!--BEGIN PROJECT_NAME--><title>$projectname: $title</title><!--END PROJECT_NAME-->
+<!--BEGIN !PROJECT_NAME--><title>$title</title><!--END !PROJECT_NAME-->
+<!-- <link href="$relpath^../Manual/tabs.css" rel="stylesheet" type="text/css"/> -->
+<!--BEGIN DISABLE_INDEX-->
+  <!--BEGIN FULL_SIDEBAR-->
+<script type="text/javascript">var page_layout=1;</script>
+  <!--END FULL_SIDEBAR-->
+<!--END DISABLE_INDEX-->
+<script type="text/javascript" src="$relpath^../Manual/jquery.js"></script>
+<script type="text/javascript" src="$relpath^../Manual/dynsections.js"></script>
+<script src="$relpath$../Manual/hacks.js" type="text/javascript"></script>
+$treeview
+$search
+$mathjax
+$darkmode
+<link href="$relpath^$stylesheet" rel="stylesheet" type="text/css" />
+<!-- This should probably be an extrastylesheet instead of hardcoded. -->
+<link href="$relpath$../Manual/cgal_stylesheet.css" rel="stylesheet" type="text/css" />
+$extrastylesheet
+</head>
+<body>
+<!--BEGIN DISABLE_INDEX-->
+  <!--BEGIN FULL_SIDEBAR-->
+<div id="side-nav" class="ui-resizable side-nav-resizable"><!-- do not remove this div, it is closed by doxygen! -->
+  <!--END FULL_SIDEBAR-->
+<!--END DISABLE_INDEX-->
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="back-nav">
+  <ul>
+    <li><a href="https://www.cgal.org/">cgal.org</a></li>
+    <li><a href="../Manual/index.html">Top</a></li>
+    <li><a href="../Manual/general_intro.html">Getting Started</a></li>
+    <li><a href="../Manual/tutorials.html">Tutorials</a></li>
+    <li><a href="../Manual/packages.html">Package Overview</a></li>
+    <li><a href="../Manual/how_to_cite_cgal.html">Acknowledging CGAL</a></li>
+  </ul>
+  $searchbox
+</div>
+
+<!--BEGIN TITLEAREA-->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <!--BEGIN PROJECT_LOGO-->
+  <td id="projectlogo"><img alt="Logo" src="$relpath^$projectlogo"/></td>
+  <!--END PROJECT_LOGO-->
+  <!--BEGIN PROJECT_NAME-->
+  <td id="projectalign">
+   <div id="projectname">$projectname<!--BEGIN PROJECT_NUMBER--><span id="projectnumber">&#160;$projectnumber</span><!--END PROJECT_NUMBER-->
+   </div>
+   <!--BEGIN PROJECT_BRIEF--><div id="projectbrief">$projectbrief</div><!--END PROJECT_BRIEF-->
+  </td>
+  <!--END PROJECT_NAME-->
+  <!--BEGIN !PROJECT_NAME-->
+   <!--BEGIN PROJECT_BRIEF-->
+    <div id="projectbrief">$projectbrief</div>
+    </td>
+   <!--END PROJECT_BRIEF-->
+  <!--END !PROJECT_NAME-->
+  <!--BEGIN DISABLE_INDEX-->
+  <!--BEGIN SEARCHENGINE-->
+  <!-- We disable the search box because we have added it in the
+  back-nav for stylistic reasons. -->
+  <!-- <td>$searchbox</td> -->
+  <!--END SEARCHENGINE-->
+  <!--END DISABLE_INDEX-->
+ </tr>
+ </tbody>
+</table>
+</div>
+<!--END TITLEAREA-->
+<!-- end header part -->
diff --git a/Documentation/doc/resources/1.10.0/header_package.html b/Documentation/doc/resources/1.10.0/header_package.html
new file mode 100644
index 000000000000..a5d20b59d6c5
--- /dev/null
+++ b/Documentation/doc/resources/1.10.0/header_package.html
@@ -0,0 +1,144 @@
+<!-- HTML header for doxygen 1.9.6-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="$langISO">
+<head>
+<link rel="icon" type="image/png" href="$relpath$../Manual/g-196x196-doc.png"/>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen $doxygenversion"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<!--BEGIN PROJECT_NAME--><title>$projectname: $title</title><!--END PROJECT_NAME-->
+<!--BEGIN !PROJECT_NAME--><title>$title</title><!--END !PROJECT_NAME-->
+<!-- <link href="$relpath^../Manual/tabs.css" rel="stylesheet" type="text/css"/> -->
+<!--BEGIN DISABLE_INDEX-->
+  <!--BEGIN FULL_SIDEBAR-->
+<script type="text/javascript">var page_layout=1;</script>
+  <!--END FULL_SIDEBAR-->
+<!--END DISABLE_INDEX-->
+<script type="text/javascript" src="$relpath^../Manual/jquery.js"></script>
+<script type="text/javascript" src="$relpath^../Manual/dynsections.js"></script>
+<script src="$relpath^../Manual/hacks.js" type="text/javascript"></script>
+<!-- Manually include treeview and search to avoid bloat and to fix
+     paths to the directory Manual . -->
+<!-- $.treeview -->
+<!-- $.search -->
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="$relpath^../Manual/resize.js"></script>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+  $(document).ready(initResizable);
+</script>
+<link href="$relpath^../Manual/search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="$relpath^../Manual/search/searchdata.js"></script>
+<script type="text/javascript" src="$relpath^../Manual/search/search.js"></script>
+<script type="text/javascript">
+  $(document).ready(function() { init_search(); });
+</script>
+<link href="$relpath^../Manual/search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../Manual/search/search.js"></script>
+<!-- Manually done below. -->
+<link href="$relpath^../Manual/$stylesheet" rel="stylesheet" type="text/css" />
+<!-- This should probably be an extrastylesheet instead of hardcoded. -->
+<link href="$relpath$../Manual/cgal_stylesheet.css" rel="stylesheet" type="text/css" />
+$mathjax
+$darkmode
+<script src="$relpath^topics.js" type="text/javascript"></script>
+$extrastylesheet
+</head>
+<body>
+<!--BEGIN DISABLE_INDEX-->
+  <!--BEGIN FULL_SIDEBAR-->
+<div id="side-nav" class="ui-resizable side-nav-resizable"><!-- do not remove this div, it is closed by doxygen! -->
+  <!--END FULL_SIDEBAR-->
+<!--END DISABLE_INDEX-->
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="back-nav">
+  <ul>
+    <li><a href="https://www.cgal.org/">cgal.org</a></li>
+    <li><a href="../Manual/index.html">Top</a></li>
+    <li><a href="../Manual/general_intro.html">Getting Started</a></li>
+    <li><a href="../Manual/tutorials.html">Tutorials</a></li>
+    <li><a href="../Manual/packages.html">Package Overview</a></li>
+    <li><a href="../Manual/how_to_cite_cgal.html">Acknowledging CGAL</a></li>
+  </ul>
+  <!-- In a package SEARCHENGINE = false, so we cannot use $searchbox
+       insertion. That's why we have to do it manually here. Notice
+       that we also take pngs from the Manual. -->
+  <div id="MSearchBox" class="MSearchBoxInactive">
+      <span class="left">
+         <span id="MSearchSelect"
+               onmouseover="return searchBox.OnSearchSelectShow()"
+               onmouseout="return searchBox.OnSearchSelectHide()">&#160;
+        </span>
+        <input type="text" id="MSearchField" value="" placeholder="Search" accesskey="S"
+               onfocus="searchBox.OnSearchFieldFocus(true)"
+               onblur="searchBox.OnSearchFieldFocus(false)"
+               onkeyup="searchBox.OnSearchFieldChange(event)"/>
+      </span>
+      <span class="right">
+            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="$relpath^../Manual/search/close.svg" alt=""/></a>
+      </span>
+  </div>
+
+</div>
+<!--BEGIN TITLEAREA-->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr id="projectrow">
+  <!--BEGIN PROJECT_LOGO-->
+  <td id="projectlogo"><img alt="Logo" src="$relpath^$projectlogo"/></td>
+  <!--END PROJECT_LOGO-->
+  <!--BEGIN PROJECT_NAME-->
+  <td id="projectalign">
+   <div id="projectname">$projectname<!--BEGIN PROJECT_NUMBER--><span id="projectnumber">&#160;$projectnumber</span><!--END PROJECT_NUMBER-->
+   </div>
+   <!--BEGIN PROJECT_BRIEF--><div id="projectbrief">$projectbrief</div><!--END PROJECT_BRIEF-->
+  </td>
+  <!--END PROJECT_NAME-->
+  <!--BEGIN !PROJECT_NAME-->
+   <!--BEGIN PROJECT_BRIEF-->
+    <div id="projectbrief">$projectbrief</div>
+    </td>
+   <!--END PROJECT_BRIEF-->
+  <!--END !PROJECT_NAME-->
+  <!--BEGIN DISABLE_INDEX-->
+  <!--BEGIN SEARCHENGINE-->
+  <!-- We disable the search box because we have added it in the
+  back-nav for stylistic reasons. -->
+  <!-- <td>$.searchbox</td> -->
+  <!--END SEARCHENGINE-->
+  <!--END DISABLE_INDEX-->
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- Code below is usually inserted by doxygen when SEARCHENGINE =
+     true. Notice that the path to the search directory is adjusted to
+     the top-level.-->
+<script type="text/javascript">
+var searchBox = new SearchBox("searchBox", "../Manual/search/",'.html');
+</script>
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<!--END TITLEAREA-->
+<!-- end header part -->
diff --git a/Documentation/doc/resources/1.10.0/menu_version.js b/Documentation/doc/resources/1.10.0/menu_version.js
new file mode 100644
index 000000000000..f3b20c2fe004
--- /dev/null
+++ b/Documentation/doc/resources/1.10.0/menu_version.js
@@ -0,0 +1,109 @@
+(function() {
+  'use strict';
+
+  var url_re =  /(cgal\.geometryfactory\.com\/CGAL\/doc\/|doc\.cgal\.org\/)(master|latest|(\d\.\d+|\d\.\d+\.\d+)(-beta\d)?)\//;
+  var url_local =  /.*\/doc_output\//;
+  var current_version_local = 'master'
+  var all_versions = [
+      'master',
+      '6.0-beta1',
+      '5.6',
+      'latest',
+      '5.5.2',
+      '5.4.4',
+      '5.3.2',
+      '5.2.4',
+      '5.1.5',
+      '5.0.4',
+      '4.14.3',
+      '4.13.2',
+      '4.12.2',
+      '4.11.3',
+      '4.10.2',
+      '4.9.1',
+      '4.8.2',
+      '4.7',
+      '4.6.3',
+      '4.5.2',
+      '4.4',
+      '4.3'
+  ];
+
+  function build_select(current_version) {
+    if( current_version == 'master') {
+      let top_elt = document.getElementById("top");
+
+      let first_element = top_elt.childNodes[0];
+      let new_div = document.createElement("p");
+      new_div.innerHTML = '⚠️ This documentation corresponds to the <a style="font-familly: monospace;" href="https://github.com/CGAL/cgal/tree/master">master</a> development branch of CGAL. It might diverge from the official releases.';
+      new_div.style.cssText = "background-color: #ff9800; margin: 1ex auto 1ex 1em; padding: 1ex; border-radius: 1ex; display: inline-block;"
+      let OK = top_elt.insertBefore(new_div, first_element);
+    }
+    var buf = ['<select>'];
+    $.each(all_versions, function(id) {
+      var version = all_versions[id];
+      buf.push('<option value="' + version + '"');
+      if (version == current_version) {
+        buf.push(' selected="selected">' + version);
+      } else {
+        buf.push('>' + version);
+      }
+      buf.push('</option>');
+    });
+    if ( !all_versions.includes(current_version)) {
+       buf.push('<option value="' + current_version + '"');
+       buf.push(' selected="selected">' + current_version);
+       buf.push('</option>');
+    }
+    buf.push('</select>');
+    return buf.join('');
+  }
+
+  function patch_url(url, new_version) {
+    if(url.includes("doc.cgal.org")||url.includes("cgal.geometryfactory.com")){
+      return url.replace(url_re, 'doc.cgal.org/' + new_version + '/');
+    }
+    else{
+      return url.replace(url_local, 'https://doc.cgal.org/' + new_version + '/');
+    }
+  }
+
+  function on_switch() {
+    var selected = $(this).children('option:selected').attr('value');
+    var url = window.location.href,
+        new_url = patch_url(url, selected);
+    if (new_url != url) {
+      window.location.href = new_url;
+    }
+  }
+
+  $(document).ready(function() {
+      var motherNode=$("#back-nav ul")[0];
+      var node = document.createElement("LI");
+      var spanNode = document.createElement("SPAN");
+      var titleNode =document.createTextNode("CGAL Version: ");
+      var textNode = document.createTextNode("x.y");
+      spanNode.setAttribute("class", "version_menu");
+      spanNode.appendChild(textNode);
+      node.appendChild(titleNode);
+      node.appendChild(spanNode);
+      motherNode.insertBefore(node, motherNode.firstChild);
+      $("#back-nav").css("padding-top", "0").css("padding-bottom", "0");
+      var match = url_re.exec(window.location.href);
+      if (match) {
+        var version = match[2];
+        var select = build_select(version);
+        spanNode.innerHTML=select;
+        $('.version_menu select').bind('change', on_switch);
+      }
+      else {
+        match = url_local.exec(window.location.href);
+        if (match) {
+          var version = current_version_local;
+          var select = build_select(version);
+          spanNode.innerHTML=select;
+          $('.version_menu select').bind('change', on_switch);
+        }
+     }
+  });
+})();

From 7727bb83648b050158c7392542b7986b6b834d74 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 5 Oct 2023 13:36:52 +0200
Subject: [PATCH 0820/1398] facet_min_size and cell_min_size disabled by
 default in the dialog

---
 .../Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp    | 14 ++++++++++++++
 1 file changed, 14 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
index c17f4879f1dc..8848ec208813 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
@@ -508,6 +508,11 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
           ui.facetMinSizing,
           SLOT(setEnabled(bool)));
 
+  connect(ui.noFacetMinSizing,
+          SIGNAL(toggled(bool)),
+          ui.sizingMinLabel,
+          SLOT(setEnabled(bool)));
+
   connect(
       ui.noAngle, SIGNAL(toggled(bool)), ui.facetAngle, SLOT(setEnabled(bool)));
 
@@ -521,6 +526,11 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
           ui.tetMinSizing,
           SLOT(setEnabled(bool)));
 
+  connect(ui.noTetMinSizing,
+          SIGNAL(toggled(bool)),
+          ui.tetMinSizingLabel,
+          SLOT(setEnabled(bool)));
+
   connect(ui.noTetShape,
           SIGNAL(toggled(bool)),
           ui.tetShape,
@@ -602,6 +612,8 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
                            diag); // max
   ui.facetSizing->setValue(facets_sizing);
   ui.facetMinSizing->setValue(facets_min_sizing);
+  ui.facetMinSizing->setEnabled(false);
+  ui.noFacetMinSizing->setChecked(false);
   ui.edgeSizing->setValue(edges_sizing);
   ui.edgeMinSizing->setValue(edges_min_sizing);
 
@@ -609,6 +621,8 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
                          diag);        // max
   ui.tetSizing->setValue(tets_sizing); // default value
   ui.tetMinSizing->setValue(tets_min_sizing);
+  ui.tetMinSizing->setEnabled(false);
+  ui.noTetMinSizing->setChecked(false);
 
   ui.approx->setRange(diag * 10e-7, // min
                       diag);        // max

From 85c53f203ddf9ee118e401e8dae11bb84c8bfa63 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 5 Oct 2023 14:33:47 +0200
Subject: [PATCH 0821/1398] Add a new function to the AW3 visitor: go_further()

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h  | 18 +++++++++++++-----
 1 file changed, 13 insertions(+), 5 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 7c9509b9185a..c103a4e4c41e 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -92,6 +92,9 @@ struct Wrapping_default_visitor
   template <typename AlphaWrapper>
   void on_flood_fill_begin(const AlphaWrapper&) { }
 
+  template <typename Wrapper>
+  constexpr bool go_further(const Wrapper& wrapper) { return true; }
+
   template <typename AlphaWrapper, typename Gate>
   void before_facet_treatment(const AlphaWrapper&, const Gate&) { }
 
@@ -1212,7 +1215,7 @@ class Alpha_wrap_3
   }
 
   template <typename Visitor>
-  void alpha_flood_fill(Visitor& visitor)
+  bool alpha_flood_fill(Visitor& visitor)
   {
 #ifdef CGAL_AW3_DEBUG
     std::cout << "> Flood fill..." << std::endl;
@@ -1251,10 +1254,6 @@ class Alpha_wrap_3
       std::cout << "Permissiveness: " << gate.is_permissive_facet() << std::endl;
 #endif
 
-      visitor.before_facet_treatment(*this, gate);
-
-      m_queue.pop();
-
 #ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
       static int i = 0;
       std::string step_name = "results/steps/step_" + std::to_string(static_cast<int>(i)) + ".off";
@@ -1269,6 +1268,13 @@ class Alpha_wrap_3
       face_out.close();
 #endif
 
+      if(!visitor.go_further(*this))
+        return false;
+
+      visitor.before_facet_treatment(*this, gate);
+
+      m_queue.pop();
+
       if(m_tr.is_infinite(neighbor))
       {
         neighbor->is_outside() = true;
@@ -1384,6 +1390,8 @@ class Alpha_wrap_3
     CGAL_postcondition_code(  if(!fit->first->is_outside()) f = m_tr.mirror_facet(f);)
     CGAL_postcondition(       facet_status(f) == IRRELEVANT);
     CGAL_postcondition_code(})
+
+    return true;
   }
 
 private:

From 3ff06d5099471c39a9e0c364138e38f7dc75634d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 5 Oct 2023 14:34:29 +0200
Subject: [PATCH 0822/1398] Fix return type of function returning smallest
 circumradius

---
 .../include/CGAL/Alpha_wrap_3/internal/geometry_utils.h         | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
index f39a47012862..991f9e48e25a 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
@@ -155,7 +155,7 @@ less_squared_radius_of_min_empty_sphere(typename Tr::Geom_traits::FT sq_alpha,
 }
 
 template <typename Tr>
-bool
+typename Tr::Geom_traits::FT
 smallest_squared_radius_3(const typename Tr::Facet& fh,
                           const Tr& tr)
 {

From 76add8023e6bec512e7cdb7f6e234fd6835f20ac Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 5 Oct 2023 14:35:42 +0200
Subject: [PATCH 0823/1398] Add debug code

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h |  2 +-
 .../Alpha_wrap_3/internal/geometry_utils.h    | 41 +++++++++++++++++--
 2 files changed, 38 insertions(+), 5 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index c103a4e4c41e..9792b828a610 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -671,7 +671,7 @@ class Alpha_wrap_3
     }
 
     t.stop();
-    std::cout << t.time() << " for scanning" << std::endl;
+    std::cout << t.time() << " for scanning a queue of size " << m_queue.size() << std::endl;
 
     return true;
   }
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
index 991f9e48e25a..7f5f60de701c 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/geometry_utils.h
@@ -61,6 +61,10 @@ less_squared_radius_of_min_empty_sphere(typename Tr::Geom_traits::FT sq_alpha,
 
   Orientation_of_circumcenter orientation_of_circumcenter;
 
+#ifdef CGAL_AW3_DEBUG_TRAVERSABILITY
+  std::cout << "Checking for traversability of facet" << std::endl;
+#endif
+
   const Cell_handle c = fh.first;
   const int ic = fh.second;
   const Cell_handle n = c->neighbor(ic);
@@ -73,6 +77,11 @@ less_squared_radius_of_min_empty_sphere(typename Tr::Geom_traits::FT sq_alpha,
   // and because it does not cost anything.
   if(tr.is_infinite(n))
   {
+#ifdef CGAL_AW3_DEBUG_TRAVERSABILITY
+    std::cerr << "Warning: computing less_squared_radius_of_min_empty_sphere() with an infinite neighbor?" << std::endl;
+#endif
+    CGAL_assertion(!tr.is_infinite(c));
+
     Orientation ori = orientation_of_circumcenter(p1, p2, p3,
                                                   tr.point(c, 0), tr.point(c, 1),
                                                   tr.point(c, 2), tr.point(c, 3));
@@ -97,6 +106,10 @@ less_squared_radius_of_min_empty_sphere(typename Tr::Geom_traits::FT sq_alpha,
                                                   tr.point(n, 0), tr.point(n, 1),
                                                   tr.point(n, 2), tr.point(n, 3));
 
+#ifdef CGAL_AW3_DEBUG_TRAVERSABILITY
+    std::cout << "Cell 'c' is infinite; Orientation: " << ori << std::endl;
+#endif
+
     if(ori == NEGATIVE)
     {
       Comparison_result cr = compare_squared_radius(p1, p2, p3, sq_alpha);
@@ -177,6 +190,12 @@ smallest_squared_radius_3(const typename Tr::Facet& fh,
 
   auto squared_radius = tr.geom_traits().compute_squared_radius_3_object();
 
+#ifdef CGAL_AW3_DEBUG_TRAVERSABILITY
+  std::cout << "Computing circumradius of facet" << std::endl;
+#endif
+
+  CGAL_precondition(!tr.is_infinite(fh));
+
   const Cell_handle c = fh.first;
   const int ic = fh.second;
   const Cell_handle n = c->neighbor(ic);
@@ -189,6 +208,8 @@ smallest_squared_radius_3(const typename Tr::Facet& fh,
   // and because it does not cost anything.
   if(tr.is_infinite(n))
   {
+    CGAL_assertion(!tr.is_infinite(c));
+
     Orientation ori = orientation_of_circumcenter(p1, p2, p3,
                                                   tr.point(c, 0), tr.point(c, 1),
                                                   tr.point(c, 2), tr.point(c, 3));
@@ -203,6 +224,11 @@ smallest_squared_radius_3(const typename Tr::Facet& fh,
     Orientation ori = orientation_of_circumcenter(p1, p2, p3,
                                                   tr.point(n, 0), tr.point(n, 1),
                                                   tr.point(n, 2), tr.point(n, 3));
+
+#ifdef CGAL_AW3_DEBUG_TRAVERSABILITY
+    std::cout << "Cell 'c' is infinite; Orientation: " << ori << std::endl;
+#endif
+
     if(ori == NEGATIVE)
       return squared_radius(p1, p2, p3);
     else
@@ -215,14 +241,21 @@ smallest_squared_radius_3(const typename Tr::Facet& fh,
      orientation_of_circumcenter(p1, p2, p3,
                                  tr.point(n, 0), tr.point(n, 1), tr.point(n, 2), tr.point(n, 3)))
   {
-    // Dual crosses the face
+#ifdef CGAL_AW3_DEBUG_TRAVERSABILITY
+    std::cout << "dual crosses the face; CR: " << squared_radius(p1, p2, p3) << std::endl;
+#endif
+
     return squared_radius(p1, p2, p3);
   }
   else
   {
-    // Dual does not crosses the face
-    FT cr = squared_radius(tr.point(c, 0), tr.point(c, 1), tr.point(c, 2), tr.point(c, 3));
-    FT cnr = squared_radius(tr.point(n, 0), tr.point(n, 1), tr.point(n, 2), tr.point(n, 3));
+    const FT cr = squared_radius(tr.point(c, 0), tr.point(c, 1), tr.point(c, 2), tr.point(c, 3));
+    const FT cnr = squared_radius(tr.point(n, 0), tr.point(n, 1), tr.point(n, 2), tr.point(n, 3));
+
+#ifdef CGAL_AW3_DEBUG_TRAVERSABILITY
+    std::cout << "dual does not cross the face; CR(c): " << cr << " CRn: " << cnr << std::endl;
+#endif
+
     return (CGAL::min)(cr, cnr);
   }
 }

From 3d71790cbcf9e94ea3184438f9256a6785ed6430 Mon Sep 17 00:00:00 2001
From: Mael <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 5 Oct 2023 14:56:25 +0200
Subject: [PATCH 0824/1398] Protect min/max with parentheses

Co-authored-by: Andreas Fabri <andreas.fabri@geometryfactory.com>
---
 .../test_edge_collapse_stability.cpp                          | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp
index f2efb2182448..1a6a2786c6db 100644
--- a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp
+++ b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp
@@ -44,8 +44,8 @@ int main(int argc, char** argv)
   CGAL::Iso_cuboid_3<Kernel> bbox(CGAL::Polygon_mesh_processing::bbox(mesh));
 
   // scale a bit the bounding box bbox, because the kernel is SC
-  bbox = { bbox.min() - 0.01 * (bbox.max() - bbox.min()),
-           bbox.max() + 0.01 * (bbox.max() - bbox.min()) };
+  bbox = { (bbox.min)() - 0.01 * ((bbox.max)() - (bbox.min)()),
+           (bbox.max)() + 0.01 * ((bbox.max)() - (bbox.min)()) };
 
   std::cout << "Bbox: " << bbox << std::endl;
 

From 40f5ac00232c4c495d1cee74be547bab2dc1dad3 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Thu, 5 Oct 2023 15:56:59 +0200
Subject: [PATCH 0825/1398] Fixed warnings + deleted unsused variables

---
 .../Isosurfacing_3/Isosurface_3_plugin.cpp    | 41 +++++++++----------
 1 file changed, 20 insertions(+), 21 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp
index 4b25ab97f9a6..4d75099eb53f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp
@@ -130,9 +130,9 @@ class Polyhedron_demo_isosurface_3_plugin_helper {
   {
     int i,j,k;
 
-    float dx_ = 1.0;
-    float dy_ = 1.0;
-    float dz_ = 1.0;
+    const int dx_ = 1;
+    const int dy_ = 1;
+    const int dz_ = 1;
     double vx_ = image_->vx();
     double vy_ = image_->vy();
     double vz_ = image_->vz();
@@ -140,12 +140,12 @@ class Polyhedron_demo_isosurface_3_plugin_helper {
     double ty_ = image_->ty();
     double tz_ = image_->tz();
 
-    int xdim_ = image_->xdim();
-    int ydim_ = image_->ydim();
-    int zdim_ = image_->zdim();
+    int xdim_ = static_cast<int>(image_->xdim());
+    int ydim_ = static_cast<int>(image_->ydim());
+    int zdim_ = static_cast<int>(image_->zdim());
     int xdim_p = xdim_+dx_;
     int ydim_p = ydim_+dy_;
-    int zdim_p = zdim_+dz_;
+    int xydim_p = ydim_p*xdim_p;
 
     std::map<std::size_t, vertex_descriptor> vertices;
 
@@ -169,10 +169,10 @@ class Polyhedron_demo_isosurface_3_plugin_helper {
 
           // if one is different
           if (v0 != v1 || v0 != v2 || v0 != v3 || v0 != v4 || v0 != v5 || v0 != v6 || v0 != v7) {
-            int ip = i+dx_;
-            int jp = j+dy_;
-            int kp = k+dz_;
-            int index = kp*ydim_p*xdim_p + jp*xdim_p + ip;
+            unsigned int ip = i+dx_;
+            unsigned int jp = j+dy_;
+            unsigned int kp = k+dz_;
+            unsigned int index = kp*xydim_p + jp*xdim_p + ip;
             double di = i+0.5*dx_;
             double dj = j+0.5*dy_;
             double dk = k+0.5*dz_;
@@ -198,25 +198,25 @@ class Polyhedron_demo_isosurface_3_plugin_helper {
             // check x direction
             if (v0 != v1)
             {
-              vertex_descriptor vertex_1 = vertices.find(kp*ydim_p*xdim_p + j *xdim_p + ip)->second;
-              vertex_descriptor vertex_2 = vertices.find(k *ydim_p*xdim_p + j *xdim_p + ip)->second;
-              vertex_descriptor vertex_3 = vertices.find(k *ydim_p*xdim_p + jp*xdim_p + ip)->second;
+              vertex_descriptor vertex_1 = vertices.find(kp*xydim_p + j *xdim_p + ip)->second;
+              vertex_descriptor vertex_2 = vertices.find(k *xydim_p + j *xdim_p + ip)->second;
+              vertex_descriptor vertex_3 = vertices.find(k *xydim_p + jp*xdim_p + ip)->second;
               mesh_.add_face(vertex_0, vertex_1, vertex_2, vertex_3, v0, v1);
             }
             // check y direction
             if (v0 != v2)
             {
-              vertex_descriptor vertex_1 = vertices.find(k *ydim_p*xdim_p + jp*xdim_p + ip)->second;
-              vertex_descriptor vertex_2 = vertices.find(k *ydim_p*xdim_p + jp*xdim_p + i )->second;
-              vertex_descriptor vertex_3 = vertices.find(kp*ydim_p*xdim_p + jp*xdim_p + i )->second;
+              vertex_descriptor vertex_1 = vertices.find(k *xydim_p + jp*xdim_p + ip)->second;
+              vertex_descriptor vertex_2 = vertices.find(k *xydim_p + jp*xdim_p + i )->second;
+              vertex_descriptor vertex_3 = vertices.find(kp*xydim_p + jp*xdim_p + i )->second;
               mesh_.add_face(vertex_0, vertex_1, vertex_2, vertex_3, v0, v2);
             }
             // check z direction
             if (v0 != v3)
             {
-              vertex_descriptor vertex_1 = vertices.find(kp*ydim_p*xdim_p + jp*xdim_p + i )->second;
-              vertex_descriptor vertex_2 = vertices.find(kp*ydim_p*xdim_p + j *xdim_p + i )->second;
-              vertex_descriptor vertex_3 = vertices.find(kp*ydim_p*xdim_p + j *xdim_p + ip)->second;
+              vertex_descriptor vertex_1 = vertices.find(kp*xydim_p + jp*xdim_p + i )->second;
+              vertex_descriptor vertex_2 = vertices.find(kp*xydim_p + j *xdim_p + i )->second;
+              vertex_descriptor vertex_3 = vertices.find(kp*xydim_p + j *xdim_p + ip)->second;
               mesh_.add_face(vertex_0, vertex_1, vertex_2, vertex_3, v0, v3);
             }
           }
@@ -267,7 +267,6 @@ class Polyhedron_demo_isosurface_3_plugin_helper {
 private:
   Mesh mesh_;
   const Image* image_;
-  int nb_surfaces;
 
   Word_type image_data(std::size_t i, std::size_t j, std::size_t k)
   {

From 7dc1f889e09a38a564b38813f75a8f6069238e15 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 6 Oct 2023 09:44:04 +0200
Subject: [PATCH 0826/1398] wip adding a test

---
 Mesh_3/test/Mesh_3/CMakeLists.txt             |  2 +
 ...ral_complex_with_manifold_and_min_size.cpp | 90 +++++++++++++++++++
 2 files changed, 92 insertions(+)
 create mode 100644 Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp

diff --git a/Mesh_3/test/Mesh_3/CMakeLists.txt b/Mesh_3/test/Mesh_3/CMakeLists.txt
index b0e9e250c27a..0580bc168a5d 100644
--- a/Mesh_3/test/Mesh_3/CMakeLists.txt
+++ b/Mesh_3/test/Mesh_3/CMakeLists.txt
@@ -39,6 +39,7 @@ endif()
 
 create_single_source_cgal_program( "test_meshing_implicit_function.cpp" )
 create_single_source_cgal_program( "test_meshing_polyhedral_complex.cpp" )
+create_single_source_cgal_program( "test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp")
 create_single_source_cgal_program( "test_meshing_polyhedron.cpp" )
 create_single_source_cgal_program( "test_meshing_polylines_only.cpp" )
 create_single_source_cgal_program( "test_meshing_polyhedron_with_features.cpp" )
@@ -81,6 +82,7 @@ foreach(target
     test_meshing_with_one_step
     test_min_edge_length
     test_min_size_criteria
+    test_meshing_polyhedral_complex_with_manifold_and_min_size
     )
   if(TARGET ${target})
     target_link_libraries(${target} PUBLIC CGAL::Eigen3_support)
diff --git a/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp b/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp
new file mode 100644
index 000000000000..13f5973d2929
--- /dev/null
+++ b/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp
@@ -0,0 +1,90 @@
+#define CGAL_MESH_3_VERBOSE 1
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
+#include <CGAL/Mesh_triangulation_3.h>
+#include <CGAL/Mesh_complex_3_in_triangulation_3.h>
+#include <CGAL/Mesh_criteria_3.h>
+
+#include <CGAL/Polyhedral_complex_mesh_domain_3.h>
+#include <CGAL/make_mesh_3.h>
+
+#include <cstdlib>
+#include <cassert>
+
+// Domain
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+typedef CGAL::Mesh_polyhedron_3<K>::type Polyhedron;
+typedef CGAL::Polyhedral_complex_mesh_domain_3<K> Mesh_domain;
+
+
+typedef CGAL::Sequential_tag Concurrency_tag;
+
+// Triangulation
+typedef CGAL::Mesh_triangulation_3<Mesh_domain,CGAL::Default,Concurrency_tag>::type Tr;
+
+typedef CGAL::Mesh_complex_3_in_triangulation_3<
+  Tr,Mesh_domain::Corner_index,Mesh_domain::Curve_index> C3t3;
+
+// Criteria
+typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
+
+namespace params = CGAL::parameters;
+
+const char* const filenames[] = {
+  "meshes/polyhedral_complex_of_spheres/Sphere1.off",
+  "meshes/polyhedral_complex_of_spheres/Sphere2.off",
+  "meshes/polyhedral_complex_of_spheres/Sphere3.off",
+  "meshes/polyhedral_complex_of_spheres/Intersection12.off",
+  "meshes/polyhedral_complex_of_spheres/Intersection23.off"
+};
+
+const std::pair<int, int> incident_subdomains[] = {
+  std::make_pair(1, 0),
+  std::make_pair(2, 0),
+  std::make_pair(3, 0),
+  std::make_pair(1, 2),
+  std::make_pair(3, 2)
+};
+
+int main()
+{
+  const std::size_t nb_patches = sizeof(filenames) / sizeof(const char*);
+  assert(sizeof(incident_subdomains) == nb_patches * sizeof(std::pair<int, int>));
+  std::vector<Polyhedron> patches(nb_patches);
+  for(std::size_t i = 0; i < nb_patches; ++i) {
+    std::ifstream input(CGAL::data_file_path(filenames[i]));
+    if(!(input >> patches[i])) {
+      std::cerr << "Error reading " << filenames[i] << " as a polyhedron!/n";
+      return EXIT_FAILURE;
+    }
+  }
+  // Create domain
+  Mesh_domain domain(patches.begin(), patches.end(),
+                     incident_subdomains, incident_subdomains+nb_patches);
+
+  // do not detect borders/features, otherwise the manifold criterion
+  // will have no effect, and the test will be useless
+  //domain.detect_borders();
+
+  // Mesh criteria
+  Mesh_criteria criteria(params::edge_size(1.0).edge_min_size(0.1)
+    .facet_distance(0.1)
+    .facet_min_size(0.01)
+    //.facet_topology(CGAL::FACET_VERTICES_ON_SAME_SURFACE_PATCH)
+    //.cell_radius_edge_ratio(3.)
+    );
+
+  // Mesh generation
+  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
+    params::no_perturb(), params::no_exude(),
+    params::manifold(),
+    params::mesh_3_dump());
+
+  // Output
+  std::ofstream medit_file("out.mesh");
+  CGAL::IO::write_MEDIT(medit_file, c3t3);
+  medit_file.close();
+
+  return EXIT_SUCCESS;
+}

From 2c0e04c4fd9055fdbb9cf090b5bde8b69f0378ed Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 6 Oct 2023 09:44:53 +0200
Subject: [PATCH 0827/1398] replace min_facet_size by squared version to avoid
 multiple redundant computations

---
 Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h | 8 ++++----
 Mesh_3/include/CGAL/Mesh_facet_criteria_3.h              | 6 ++++++
 2 files changed, 10 insertions(+), 4 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
index 6eadbfac52f4..e3c8bf0d4e5b 100644
--- a/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
+++ b/Mesh_3/include/CGAL/Mesh_3/Refine_facets_manifold_base.h
@@ -95,7 +95,7 @@ class Refine_facets_manifold_base
   mutable bool m_bad_vertices_initialized;
   bool m_with_manifold_criterion;
   bool m_with_boundary;
-  std::optional<FT> m_facet_min_size;
+  std::optional<FT> m_squared_facet_min_size ;
 
 private:
   // computes and return an ordered pair of Vertex
@@ -247,9 +247,9 @@ class Refine_facets_manifold_base
 
   bool is_smaller_than_min_size(const FT& sq_dist) const
   {
-    if(!m_facet_min_size)
+    if(!m_squared_facet_min_size )
       return false;
-    return sq_dist < CGAL::square(*m_facet_min_size);
+    return sq_dist < *m_squared_facet_min_size;
   }
 
   template<typename T> //T may be Edge or Vertex_handle
@@ -340,7 +340,7 @@ class Refine_facets_manifold_base
     , m_bad_vertices_initialized(false)
     , m_with_manifold_criterion((mesh_topology & MANIFOLD_WITH_BOUNDARY) != 0)
     , m_with_boundary((mesh_topology & NO_BOUNDARY) == 0)
-    , m_facet_min_size(criteria.min_radius_bound())
+    , m_squared_facet_min_size(criteria.squared_min_radius_bound())
   {
 #ifdef CGAL_MESH_3_DEBUG_CONSTRUCTORS
     std::cerr << "CONS: Refine_facets_manifold_base";
diff --git a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
index 7043597f336b..927083511ed1 100644
--- a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
@@ -182,6 +182,12 @@ class Mesh_facet_criteria_3
   std::optional<FT> min_radius_bound() const {
     return min_radius_bound_;
   }
+  std::optional<FT> squared_min_radius_bound() const {
+    if(min_radius_bound_)
+      return CGAL::square(*min_radius_bound_);
+    else
+      return std::nullopt;
+  }
 
 private:
   void init_aspect(const FT& angle_bound)

From a5d44aa80888df5450faf1f8b7c5a7e6e8efd9b4 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 6 Oct 2023 14:27:55 +0200
Subject: [PATCH 0828/1398] fix the random appearance of clip plane

For the `Scene_c3t3_item` (and probably `Scene_triangulation_item` as
well) most of the time the clip plane was not shown. This is because of
Boolean data member `cut_plane_enabled` that was not initialized.
---
 Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
index 04d0d44c58e3..610d29fd0149 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
@@ -576,6 +576,7 @@ void Scene_triangulation_3_item::common_constructor(bool display_elements)
 
   d->is_grid_shown = display_elements;
   d->show_tetrahedra = display_elements;
+  d->cut_plane_enabled = display_elements;
   d->last_intersection = !d->show_tetrahedra;
 
   setTriangleContainer(T3_faces, new Tc(Vi::PROGRAM_C3T3, false));

From abedd731a74592dde42507fbe3e81bad3289d6cd Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Fri, 6 Oct 2023 16:31:54 +0200
Subject: [PATCH 0829/1398] Fix warning (i, j and k can be negative)

---
 .../Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp   | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp
index 4d75099eb53f..975c8aac622d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp
@@ -268,7 +268,7 @@ class Polyhedron_demo_isosurface_3_plugin_helper {
   Mesh mesh_;
   const Image* image_;
 
-  Word_type image_data(std::size_t i, std::size_t j, std::size_t k)
+  Word_type image_data(int i, int j, int k)
   {
     if ( i>=0 && i<image_->xdim() && j>=0 && j<image_->ydim() && k>=0 && k<image_->zdim() )
       return image_->value(i, j, k);

From fb3623cfa90f95e0163ac454352dcf427ab6fddd Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Mon, 9 Oct 2023 05:10:30 +0200
Subject: [PATCH 0830/1398] Apply suggestions from code review

Co-authored-by: Andreas Fabri <andreas.fabri@geometryfactory.com>
---
 .../Polygon_mesh_processing/refine_mesh_at_isolevel.h     | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
index 8a649b15ead4..7a3b2c0765e5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
@@ -28,8 +28,8 @@ namespace Polygon_mesh_processing {
  * The placement of new vertices on edges will be done by linear interpolation
  * using the aforementioned values.
  * New vertices will be associated `isovalue` in `value_map` when created.
- * Additionally new edges will be added by connecting new vertices created sharing
- * a common incident face. Note that in case more that two new vertices are added
+ * Additionally, new edges will be added by connecting new vertices created sharing
+ * a common incident face. Note that in case more than two new vertices are added
  * on a face boundary, no edges will be created in that face.
  *
  * @tparam PolygonMesh a model of the concepts `EdgeListGraph` and `FaceListGraph`
@@ -39,7 +39,7 @@ namespace Polygon_mesh_processing {
  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters" for `pm`
  *
  * @param pm the polygon mesh to be refined.
- * @param value_map the property map containing value at each vertex for a given function defined over the mesh.
+ * @param value_map the property map containing a value at each vertex for a given function defined over the mesh.
  * @param isovalue the value used to defined
  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
  *
@@ -72,7 +72,7 @@ void refine_mesh_at_isolevel(PolygonMesh& pm,
   typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor edge_descriptor;
   typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
   typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
-  typedef typename boost::property_map<ValueMap>::value_type FT;
+  typedef typename boost::property_traits<ValueMap>::value_type FT;
 
   using parameters::choose_parameter;
   using parameters::get_parameter;

From 1c91f49cbdafc980f1e6f32a74fb24b98bf12fa8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 9 Oct 2023 05:14:38 +0200
Subject: [PATCH 0831/1398] update changes

---
 Installation/CHANGES.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 8ee04d38577d..ef51234bb6e7 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -52,6 +52,10 @@ Release date: October 2023
     `CGAL::Simplicial_mesh_cell_base_3`
     have been modified to enable passing a geometric traits and a custom cell base class.
 
+### [Polygon Mesh Processing](https://doc.cgal.org/6.0/Manual/packages.html#PkgPolygonMeshProcessing)
+- added the function `CGAL::Polygon_mesh_processing::refine_mesh_at_isolevel()` that refines a polygon mesh
+  along an isocurve.
+
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------
 

From 584771e6a752d45d4089e33bfc01cef98f584aea Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 9 Oct 2023 05:34:55 +0200
Subject: [PATCH 0832/1398] rename

---
 .../geodesic_isolevel_refinement.cpp                   | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/geodesic_isolevel_refinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/geodesic_isolevel_refinement.cpp
index 76f97bf3dc66..29f43453e87a 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/geodesic_isolevel_refinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/geodesic_isolevel_refinement.cpp
@@ -59,14 +59,14 @@ int main(int argc, char* argv[])
     CGAL::Polygon_mesh_processing::refine_mesh_at_isolevel(tm, vertex_distance, isovalue, CGAL::parameters::edge_is_constrained_map(ecm));
 
   // split the mesh in connected components bounded by the isocurves
-  std::vector<Triangle_mesh> splitted;
-  CGAL::Polygon_mesh_processing::split_connected_components(tm, splitted, CGAL::parameters::edge_is_constrained_map(ecm));
+  std::vector<Triangle_mesh> edges_split;
+  CGAL::Polygon_mesh_processing::split_connected_components(tm, edges_split, CGAL::parameters::edge_is_constrained_map(ecm));
 
-  assert(argc!=1 || splitted.size() == 22);
+  assert(argc!=1 || edges_split.size() == 22);
 
   // export each submesh in a file
-  for(std::size_t i=0; i<splitted.size(); ++i)
-    std::ofstream("out_"+std::to_string(i)+".off") << std::setprecision(17) << splitted[i];
+  for(std::size_t i=0; i<edges_split.size(); ++i)
+    std::ofstream("out_"+std::to_string(i)+".off") << std::setprecision(17) << edges_split[i];
 
   return 0;
 }

From df0e0ee9bb5b31c93918217b3843786076530206 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 9 Oct 2023 08:50:17 +0200
Subject: [PATCH 0833/1398] implement comments from review

---
 .../doc/Polygon_mesh_processing/Doxyfile.in   |  22 +-
 .../PackageDescription.txt                    |   8 -
 .../Polygon_mesh_processing.txt               |  58 +--
 .../interpolated_corrected_curvatures_PH.cpp  |  29 +-
 .../interpolated_corrected_curvatures_SM.cpp  |  36 +-
 ...terpolated_corrected_curvatures_vertex.cpp |  24 +-
 .../interpolated_corrected_curvatures.h       | 490 +-----------------
 ...test_interpolated_corrected_curvatures.cpp |  46 +-
 8 files changed, 87 insertions(+), 626 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
index 5cdf93414ac8..c2db3e16577f 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
@@ -23,17 +23,17 @@ EXCLUDE_SYMBOLS += experimental
 HTML_EXTRA_FILES           = ${CGAL_PACKAGE_DOC_DIR}/fig/selfintersections.jpg \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/mesh_smoothing.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/shape_smoothing.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.040000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.040000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.040000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.002000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.030000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.030000-0.002000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.040000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.040000-0.002000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.050000-0.000000.png\
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.050000-0.002000.png\
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.040000-0.000000.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.040000-0.000000.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.040000-0.000000.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.000000.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.002000.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.030000-0.000000.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.030000-0.002000.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.040000-0.000000.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.040000-0.002000.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.050000-0.000000.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.050000-0.002000.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_cheese.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_colors.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_rg_joint.png
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 83929a699818..0a1c08909eeb 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -213,15 +213,7 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - \link PMP_locate_grp Random Location Generation \endlink
 
 \cgalCRPSection{Corrected Curvatures}
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
 - `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature_one_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_one_vertex()`
-- `CGAL::Polygon_mesh_processing::Principal_curvatures_and_directions`
 
 \cgalCRPSection{Normal Computation Functions}
 - `CGAL::Polygon_mesh_processing::compute_face_normal()`
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index d81a1f6029e4..1f6249c0ee89 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -999,20 +999,9 @@ is divided by the interpolated area measure.
 The implementation is generic in terms of mesh data structure. It can be used on `Surface_mesh`,
 `Polyhedron_3` and other polygonal mesh structures based on the concept `FaceGraph`.
 
-These computations are performed using (on all vertices of the mesh):
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
-
-Where it is recommended to use the last function for computing multiple curvatures (for example: mean and
-Gaussian) as the implementation performs the shared computations only once, making it more efficient.
-
-Similarly, we can use the following functions to compute curvatures on a specific vertex:
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature_one_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
-- `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures_one_vertex()`
+These computations are performed using (on all vertices of the mesh) `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
+where function named parameters are use to select the curvatures (and possibly directions) to be computed. An overlay with the same named
+but accepting and accepting a given vertex is also available in case the computation should be done only for that vertex.
 
 \subsection ICCResults Results & Performance
 
@@ -1022,34 +1011,45 @@ First, \cgalFigureRef{icc_measures} first illustrates various curvature measure
 
 \cgalFigureAnchor{icc_measures}
 <center>
-<img src="bimba-mean0.040000-0.000000.png" style="max-width:20%;"/>
-<img src="bimba-gaussian0.040000-0.000000.png" style="max-width:20%;"/>
-<img src="bimba-dmin0.040000-0.000000.png" style="max-width:20%;"/>
-<img src="bimba-dmax0.040000-0.000000.png" style="max-width:20%;"/>
+<table border=0>
+<tr>
+<td><img src="bimba-mean0.040000-0.000000.png" style="width:100%;"/></td>
+<td><img src="bimba-gaussian0.040000-0.000000.png" style="width:100%;"/></td>
+<td><img src="bimba-dmin0.040000-0.000000.png" style="width:100%;"/></td>
+<td><img src="bimba-dmax0.040000-0.000000.png" style="width:100%;"/></td>
+</tr>
+<tr align="center"><td>(a)</td><td>(b)</td></tr>
+</table>
 </center>
+
+
 \cgalFigureCaptionBegin{icc_measures}
 Mean curvature, Gaussian curvature, minimal principal curvature direction and minimal principal curvature direction on a mesh (ball radius set to 0.04).
 \cgalFigureCaptionEnd
 
 \cgalFigureAnchor{icc_various_ball_radii}
 <center>
-<img src="bimba-mean0.020000-0.000000.png" style="max-width:10%;"/>
-<img src="bimba-mean0.030000-0.000000.png" style="max-width:10%;"/>
-<img src="bimba-mean0.040000-0.000000.png" style="max-width:10%;"/>
-<img src="bimba-mean0.050000-0.000000.png" style="max-width:10%;"/><br>
-<img src="bimba-mean0.020000-0.002000.png" style="max-width:10%;"/>
-<img src="bimba-mean0.030000-0.002000.png" style="max-width:10%;"/>
-<img src="bimba-mean0.040000-0.002000.png" style="max-width:10%;"/>
-<img src="bimba-mean0.050000-0.002000.png" style="max-width:10%;"/>
+<table border=0>
+<tr>
+<td><img src="bimba-mean0.020000-0.000000.png" style="width:100%;"/></td>
+<td><img src="bimba-mean0.030000-0.000000.png" style="width:100%;"/></td>
+<td><img src="bimba-mean0.040000-0.000000.png" style="width:100%;"/></td>
+<td><img src="bimba-mean0.050000-0.000000.png" style="width:100%;"/></td>
+</tr>
+<tr>
+<td><img src="bimba-mean0.020000-0.002000.png" style="width:100%;"/></td>
+<td><img src="bimba-mean0.030000-0.002000.png" style="width:100%;"/></td>
+<td><img src="bimba-mean0.040000-0.002000.png" style="width:100%;"/></td>
+<td><img src="bimba-mean0.050000-0.002000.png" style="width:100%;"/></td>
+</tr>
+<tr align="center"><td>(a)</td><td>(b)</td></tr>
+</table>
 </center>
 \cgalFigureCaptionBegin{icc_various_ball_radii}
 When changing the integration ball radius, we obtain a scale space of curvature measure that can be used to tackle possible noise in the input as illustrated in the second row (mean curvature only with fixed colormap ranges and ball radii in {0.02,0.03,0.04,0.05}).
 \cgalFigureCaptionEnd
 
 
-
-
-
 \ref BGLPropertyMaps are used to record the computed curvatures as shown in examples. In the following examples, for each property map, we associate
 a curvature value to each vertex.
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
index c93de26f26cc..09bc213068d1 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
@@ -28,6 +28,7 @@ int main(int argc, char* argv[])
     return EXIT_FAILURE;
   }
 
+  // define property map to store curvature value and directions
   boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
     mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron),
     Gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
@@ -36,29 +37,13 @@ int main(int argc, char* argv[])
     principal_curvatures_and_directions_map =
     get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), polyhedron);
 
-  PMP::interpolated_corrected_mean_curvature(polyhedron, mean_curvature_map);
-
-  PMP::interpolated_corrected_Gaussian_curvature(polyhedron, Gaussian_curvature_map);
-
-  PMP::interpolated_corrected_principal_curvatures_and_directions(polyhedron, principal_curvatures_and_directions_map);
-
-  // uncomment this to compute a curvature while specifying named parameters
-  // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)
-
-  /*std::unordered_map<vertex_descriptor, Epic_Kernel::Vector_3> vnm;
-
-  PMP::interpolated_corrected_mean_curvature(
-      polyhedron,
-      mean_curvature_map,
-      CGAL::parameters::ball_radius(0.5).vertex_normal_map(boost::make_assoc_property_map(vnm))
-  );*/
-
-  // This function can be used to compute multiple curvature types by specifiying them as named parameters
-  // This is more efficient than computing each one separately (shared computations).
-  PMP::interpolated_corrected_curvatures(
-    polyhedron,
+  PMP::interpolated_corrected_curvatures(polyhedron,
     CGAL::parameters::vertex_mean_curvature_map(mean_curvature_map)
-    .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map));
+                     .vertex_Gaussian_curvature_map(Gaussian_curvature_map)
+                     .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map)
+  // uncomment to use an expansion ball radius of 0.5 to estimate the curvatures
+  //                 .ball_radius(0.5)
+  );
 
   int i = 0;
   for (vertex_descriptor v : vertices(polyhedron))
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
index dae2ec0716ec..74a678ea0624 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
@@ -51,39 +51,15 @@ int main(int argc, char* argv[])
         Epic_kernel::Vector_3(0,0,0) });
   assert(created);
 
-  // user can call these fucntions to compute a specfic curvature type on each vertex.
-  // (Note: if no ball radius is specified, the measure expansion of each vertex happens by
-  // summing measures on faces adjacent to each vertex.)
-  PMP::interpolated_corrected_mean_curvature(smesh, mean_curvature_map);
-
-  PMP::interpolated_corrected_Gaussian_curvature(smesh, Gaussian_curvature_map);
-
-  PMP::interpolated_corrected_principal_curvatures_and_directions(smesh, principal_curvatures_and_directions_map);
-
-  // uncomment this to compute a curvature while specifying named parameters
-  // Example: an expansion ball radius of 0.5 and a vertex normals map (does not have to depend on positions)
-
-  /*Surface_Mesh::Property_map<vertex_descriptor, Epic_kernel::Vector_3> vnm;
-  boost::tie(vnm, created) = smesh.add_property_map<vertex_descriptor, Epic_kernel::Vector_3>(
-      "v:vnm", Epic_kernel::Vector_3(0, 0, 0)
-  );
-
-  assert(created);
-
-  PMP::interpolated_corrected_mean_curvature(
-      smesh,
-      mean_curvature_map,
-      CGAL::parameters::ball_radius(0.5).vertex_normal_map(vnm)
-  );*/
-
-  // This function can be used to compute multiple curvature types by specifiying them as named parameters
-  // This is more efficient than computing each one separately (shared computations).
-  PMP::interpolated_corrected_curvatures(
-    smesh,
+  PMP::interpolated_corrected_curvatures(smesh,
     CGAL::parameters::vertex_mean_curvature_map(mean_curvature_map)
-    .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map)
+                     .vertex_Gaussian_curvature_map(Gaussian_curvature_map)
+                     .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map)
+  // uncomment to use an expansion ball radius of 0.5 to estimate the curvatures
+  //                 .ball_radius(0.5)
   );
 
+
   for (vertex_descriptor v : vertices(smesh))
   {
     auto PC = principal_curvatures_and_directions_map[v];
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
index c6bef5faa740..bdcdba6b7fd0 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
@@ -30,26 +30,18 @@ int main(int argc, char* argv[])
   // loop over vertices and use vertex_descriptor to compute a curvature on one vertex
   for (vertex_descriptor v : vertices(smesh))
   {
-    double h = PMP::interpolated_corrected_mean_curvature_one_vertex(smesh, v);
-    double g = PMP::interpolated_corrected_Gaussian_curvature_one_vertex(smesh, v);
-    PMP::Principal_curvatures_and_directions<Epic_kernel> p =
-      PMP::interpolated_corrected_principal_curvatures_and_directions_one_vertex(smesh, v);
+    double h, g;
+    PMP::Principal_curvatures_and_directions<Epic_kernel> p;
+
+    PMP::interpolated_corrected_curvatures(v,
+      smesh,
+      CGAL::parameters::vertex_mean_curvature(std::ref(h))
+                       .vertex_Gaussian_curvature(std::ref(g))
+                       .vertex_principal_curvatures_and_directions(std::ref(p)));
 
     // we can also specify a ball radius for expansion and a user defined vertex normals map using
     // named parameters. Refer to interpolated_corrected_curvatures_SM.cpp to see example usage.
 
-    // Can also use interpolated_corrected_curvatures_one_vertex() to compute multiple curvatures
-    // on the vertex at the same time. This is more efficient than computing each one separately.
-    // The following commented lines show this (all mentioned named parameters work on it as well)
-    // we specify which curvatures we want to compute by passing pointers as named parameters
-    // as shown. These pointers are used for storing the result as well. in this example we
-    // selected mean and Gaussian curvatures
-    // PMP::interpolated_corrected_curvatures_one_vertex(
-    //   smesh,
-    //   v,
-    //   CGAL::parameters::vertex_mean_curvature(&h)
-    //   .vertex_Gaussian_curvature(&g)
-    // );
 
     std::cout << v.idx() << ": HC = " << h
       << ", GC = " << g << "\n"
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index b90d66cbde2e..c2c27b1733b2 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -1048,33 +1048,6 @@ class Interpolated_corrected_curvatures_computer
 *
 * \cgalNamedParamsBegin
 *
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Point_3` as value type.}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Vector_3` as value type.}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class.}
-*     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
-*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
-*   \cgalParamNEnd
-*
 *   \cgalParamNBegin{vertex_mean_curvature_map}
 *     \cgalParamDescription{a property map associating mean curvatures to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `WritablePropertyMap` with
@@ -1110,185 +1083,6 @@ class Interpolated_corrected_curvatures_computer
 *                     measures on faces around the vertex.}
 *   \cgalParamNEnd
 *
-* \cgalNamedParamsEnd
-*
-* @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_Gaussian_curvature()`
-* @see `interpolated_corrected_principal_curvatures_and_directions()`
-*/
-template<typename PolygonMesh,
-         typename NamedParameters = parameters::Default_named_parameters>
-void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
-                                       const NamedParameters& np = parameters::default_values())
-{
-  internal::Interpolated_corrected_curvatures_computer<PolygonMesh, NamedParameters>(pmesh, np);
-}
-
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* computes the interpolated corrected mean curvature across the mesh `pmesh`.
-*
-* \note This function depends on the \eigen 3.1 (or later) library.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam VertexCurvatureMap a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param vcm the vertex property map in which the computed mean curvatures are stored.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
-*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
-*
-* \cgalNamedParamsBegin
-*
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Point_3` as value type.}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Vector_3` as value type.}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class.}
-*     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
-*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the
-*                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball.}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex.}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @see `interpolated_corrected_Gaussian_curvature()`
-* @see `interpolated_corrected_principal_curvatures_and_directions()`
-* @see `interpolated_corrected_curvatures()`
-*/
-
-template<typename PolygonMesh, typename VertexCurvatureMap,
-         typename NamedParameters = parameters::Default_named_parameters>
-void interpolated_corrected_mean_curvature(const PolygonMesh& pmesh,
-                                           VertexCurvatureMap vcm,
-                                           const NamedParameters& np = parameters::default_values())
-{
-  interpolated_corrected_curvatures(pmesh, np.vertex_mean_curvature_map(vcm));
-}
-
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* computes the interpolated corrected Gaussian curvature across the mesh `pmesh`.
-*
-* \note This function depends on the \eigen 3.1 (or later) library.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam VertexCurvatureMap a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and `GT::FT` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param vcm the vertex property map in which the computed Gaussian curvatures are stored.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters".
-*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
-*
-* \cgalNamedParamsBegin
-*
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Point_3` as value type.}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `GT::ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Vector_3` as value type.}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class.}
-*     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
-*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the
-*                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball.}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex.}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_principal_curvatures_and_directions()`
-* @see `interpolated_corrected_curvatures()`
-*/
-template<typename PolygonMesh, typename VertexCurvatureMap,
-         typename NamedParameters = parameters::Default_named_parameters>
-void interpolated_corrected_Gaussian_curvature(const PolygonMesh& pmesh,
-                                               VertexCurvatureMap vcm,
-                                               const NamedParameters& np = parameters::default_values())
-{
-  interpolated_corrected_curvatures(pmesh, np.vertex_Gaussian_curvature_map(vcm));
-}
-
-/**
-* \ingroup PMP_corrected_curvatures_grp
-*
-* computes the interpolated corrected principal curvatures and directions across the mesh `pmesh`.
-*
-* \note This function depends on the \eigen 3.1 (or later) library.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam VertexCurvatureMap a model of `WritablePropertyMap` with
-* `boost::graph_traits<PolygonMesh>::%vertex_descriptor` as key type and
-* `Principal_curvatures_and_directions` as value type.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param vcm the vertex property map in which the computed principal curvatures and directions are stored.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
-*
-* \cgalNamedParamsBegin
-*
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
@@ -1316,33 +1110,20 @@ void interpolated_corrected_Gaussian_curvature(const PolygonMesh& pmesh,
 *     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the
-*                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball.}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex.}
-*   \cgalParamNEnd
-*
 * \cgalNamedParamsEnd
 *
 * @see `interpolated_corrected_mean_curvature()`
 * @see `interpolated_corrected_Gaussian_curvature()`
-* @see `interpolated_corrected_curvatures()`
+* @see `interpolated_corrected_principal_curvatures_and_directions()`
 */
-template<typename PolygonMesh, typename VertexCurvatureMap,
-typename NamedParameters = parameters::Default_named_parameters>
-void interpolated_corrected_principal_curvatures_and_directions(const PolygonMesh& pmesh,
-                                                                VertexCurvatureMap vcm,
-                                                                const NamedParameters& np = parameters::default_values())
+template<typename PolygonMesh,
+         typename  CGAL_NP_TEMPLATE_PARAMETERS>
+void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
+                                       const CGAL_NP_CLASS& np = parameters::default_values())
 {
-  interpolated_corrected_curvatures(pmesh, np.vertex_principal_curvatures_and_directions_map(vcm));
+  internal::Interpolated_corrected_curvatures_computer<PolygonMesh, CGAL_NP_CLASS>(pmesh, np);
 }
 
-
 /**
 * \ingroup PMP_corrected_curvatures_grp
 * computes the interpolated corrected curvatures at a vertex `v`.
@@ -1352,6 +1133,7 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 * \note This function depends on the \eigen 3.1 (or later) library.
 *
 * @tparam PolygonMesh a model of `FaceListGraph`.
+* @tparam VertexDescriptor must be convertible to `boost::graph_traits<PolygonMesh>::%vertex_descriptor`.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
 *
 * @param pmesh the polygon mesh.
@@ -1360,32 +1142,6 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 *        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *
 * \cgalNamedParamsBegin
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Point_3` as value type.}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Vector_3` as value type.}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class.}
-*     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
-*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
-*   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_mean_curvature}
 *     \cgalParamDescription{a reference to a scalar value to store the mean curvature at the vertex `v`.}
@@ -1412,120 +1168,10 @@ void interpolated_corrected_principal_curvatures_and_directions(const PolygonMes
 *                           inclusion ratio inside this ball.}
 *     \cgalParamType{`GT::FT`}
 *     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the epansion is then just a sum of
-*                     measures on faces around the vertex.}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @see `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
-* @see `CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature_one_vertex()`
-* @see `CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature_one_vertex()`
-* @see `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
-*/
-template<typename PolygonMesh,
-         typename NamedParameters = parameters::Default_named_parameters>
-void interpolated_corrected_curvatures_one_vertex(const PolygonMesh& pmesh,
-                                                  typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-                                                  const NamedParameters& np = parameters::default_values())
-{
-  internal::interpolated_corrected_curvatures_one_vertex(pmesh, v, np);
-}
-
-/**
-* \ingroup PMP_corrected_curvatures_grp
-* computes the interpolated corrected mean curvature at vertex `v` of mesh `pmesh`.
-*
-* \note This function depends on the \eigen 3.1 (or later) library.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param v the vertex of `pmesh` to compute the mean curvature at.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
-*
-* \cgalNamedParamsBegin
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Point_3` as value type.}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `GT::Vector_3` as value type.}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class.}
-*     \cgalParamType{a class model of `Kernel`.}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
-*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the
-*                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball.}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion is then just a sum of
 *                     measures on faces around the vertex.}
 *   \cgalParamNEnd
 *
-* \cgalNamedParamsEnd
-*
-* @return the interpolated corrected mean curvature at the vertex `v`.
-*
-* @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_Gaussian_curvature_one_vertex()`
-* @see `interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
-* @see `interpolated_corrected_curvatures_one_vertex()`
-*/
-
-template<typename PolygonMesh,
-         typename NamedParameters = parameters::Default_named_parameters>
-#ifdef DOXYGEN_RUNNING
-typename GT::FT
-#else
-typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
-#endif
-interpolated_corrected_mean_curvature_one_vertex(const PolygonMesh& pmesh,
-                                                 typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-                                                 const NamedParameters& np = parameters::default_values())
-{
-  typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT mean_curvature;
-  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_mean_curvature(std::ref(mean_curvature)));
-  return mean_curvature;
-}
-
-/**
-* \ingroup PMP_corrected_curvatures_grp
-* computes the interpolated corrected Gaussian curvature at vertex `v` of mesh `pmesh`.
-*
-* \note This function depends on the \eigen 3.1 (or later) library.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param v the vertex of `pmesh` to compute the Gaussian curvature at.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
-*
-* \cgalNamedParamsBegin
 *   \cgalParamNBegin{vertex_point_map}
 *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
 *     \cgalParamType{a class model of `ReadablePropertyMap` with
@@ -1548,125 +1194,21 @@ interpolated_corrected_mean_curvature_one_vertex(const PolygonMesh& pmesh,
 *
 *   \cgalParamNBegin{geom_traits}
 *     \cgalParamDescription{an instance of a geometric traits class.}
-*     \cgalParamType{a class model of `Kernel`.}
-*     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
-*     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the
-*                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball.}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex.}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* @return the interpolated corrected Gaussian curvature at the vertex `v`.
-*
-* @see `interpolated_corrected_Gaussian_curvature()`
-* @see `interpolated_corrected_mean_curvature_one_vertex()`
-* @see `interpolated_corrected_principal_curvatures_and_directions_one_vertex()`
-* @see `interpolated_corrected_curvatures_one_vertex()`
-*/
-
-template<typename PolygonMesh,
-  typename NamedParameters = parameters::Default_named_parameters>
-#ifdef DOXYGEN_RUNNING
-typename GT::FT
-#else
-typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
-#endif
-interpolated_corrected_Gaussian_curvature_one_vertex(const PolygonMesh& pmesh,
-                                                     typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-                                                     const NamedParameters& np = parameters::default_values())
-{
-  typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT gc;
-  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_Gaussian_curvature(std::ref(gc)));
-  return gc;
-}
-
-/**
-* \ingroup PMP_corrected_curvatures_grp
-* computes the interpolated corrected principal curvatures and directions at vertex `v` of mesh `pmesh`.
-*
-* \note This function depends on the \eigen 3.1 (or later) library.
-*
-* @tparam PolygonMesh a model of `FaceListGraph`.
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters".
-*
-* @param pmesh the polygon mesh.
-* @param v the vertex of `pmesh` to compute the principal curvatures and directions at.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-*        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
-*
-* \cgalNamedParamsBegin
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Point_3` as value type.}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for
-*                     `CGAL::vertex_point_t` must be available in `PolygonMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_normal_map}
-*     \cgalParamDescription{a property map associating normal vectors to the vertices of `pmesh`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with
-*                    `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `%Vector_3` as value type.}
-*     \cgalParamDefault{`get(dynamic_vertex_property_t<GT::Vector_3>(), pmesh)`.}
-*     \cgalParamExtra{If this parameter is omitted, vertex normals will be
-*                     computed using `compute_vertex_normals()`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class.}
-*     \cgalParamType{a class model of `Kernel`.}
+*     \cgalParamType{a class model of `Kernel`}
 *     \cgalParamDefault{a \cgal Kernel deduced from the point type, using `CGAL::Kernel_traits`.}
 *     \cgalParamExtra{The geometric traits class must be compatible with the vertex point type.}
 *   \cgalParamNEnd
 *
-*   \cgalParamNBegin{ball_radius}
-*     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures
-*                           by summing measures of faces inside a ball of this radius centered at the
-*                           vertex expanded from. The summed face measures are weighted by their
-*                           inclusion ratio inside this ball.}
-*     \cgalParamType{`GT::FT`}
-*     \cgalParamDefault{`-1`}
-*     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-*                     measures on faces around the vertex.}
-*   \cgalParamNEnd
 * \cgalNamedParamsEnd
-*
-* @return the interpolated corrected principal curvatures and directions at the vertex `v`.
-*
-* @see `interpolated_corrected_principal_curvatures_and_directions()`
-* @see `interpolated_corrected_mean_curvature_one_vertex()`
-* @see `interpolated_corrected_Gaussian_curvature_one_vertex()`
-* @see `interpolated_corrected_curvatures_one_vertex()`
 */
-
-template<typename PolygonMesh,
-         typename NamedParameters = parameters::Default_named_parameters>
-#ifdef DOXYGEN_RUNNING
-Principal_curvatures_and_directions<GT>
-#else
-Principal_curvatures_and_directions<typename GetGeomTraits<PolygonMesh, NamedParameters>::type>
-#endif
-interpolated_corrected_principal_curvatures_and_directions_one_vertex(const PolygonMesh& pmesh,
-                                                                      typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-                                                                      const NamedParameters& np = parameters::default_values())
+template<typename VertexDescriptor,
+         typename PolygonMesh,
+         typename CGAL_NP_TEMPLATE_PARAMETERS>
+void interpolated_corrected_curvatures(VertexDescriptor v,
+                                       const PolygonMesh& pmesh,
+                                       const CGAL_NP_CLASS& np = parameters::default_values())
 {
-  using GT=typename GetGeomTraits<PolygonMesh, NamedParameters>::type;
-  Principal_curvatures_and_directions<GT> pcd;
-  interpolated_corrected_curvatures_one_vertex(pmesh, v, np.vertex_principal_curvatures_and_directions(std::ref(pcd)));
-  return pcd;
+  internal::interpolated_corrected_curvatures_one_vertex(pmesh, v, np);
 }
 
 } // namespace Polygon_mesh_processing
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index 2f1af8adb106..c6a578c795a8 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -95,31 +95,14 @@ void test_average_curvatures(std::string mesh_path,
     <PolygonMesh, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
       principal_curvatures_and_directions_map =
         get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), pmesh);
-  // test_info.expansion_radius -> test if no radius is provided by user.
-  if (test_info.expansion_radius < 0) {
-    PMP::interpolated_corrected_mean_curvature(pmesh, mean_curvature_map);
-    PMP::interpolated_corrected_Gaussian_curvature(pmesh, gaussian_curvature_map);
-    PMP::interpolated_corrected_principal_curvatures_and_directions(pmesh, principal_curvatures_and_directions_map);
-  }
-  else {
-    PMP::interpolated_corrected_mean_curvature(
-      pmesh,
-      mean_curvature_map,
-      CGAL::parameters::ball_radius(test_info.expansion_radius)
-    );
-
-    PMP::interpolated_corrected_Gaussian_curvature(
-      pmesh,
-      gaussian_curvature_map,
-      CGAL::parameters::ball_radius(test_info.expansion_radius)
-    );
-
-    PMP::interpolated_corrected_principal_curvatures_and_directions(
-      pmesh,
-      principal_curvatures_and_directions_map,
-      CGAL::parameters::ball_radius(test_info.expansion_radius)
-    );
-  }
+
+  PMP::interpolated_corrected_curvatures(
+    pmesh,
+    CGAL::parameters::ball_radius(test_info.expansion_radius)
+    .vertex_mean_curvature_map(mean_curvature_map)
+    .vertex_Gaussian_curvature_map(gaussian_curvature_map)
+    .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map)
+  );
 
   Epic_kernel::FT mean_curvature_avg = 0, gaussian_curvature_avg = 0, principal_curvature_avg = 0;
 
@@ -139,15 +122,6 @@ void test_average_curvatures(std::string mesh_path,
   assert(passes_comparison(gaussian_curvature_avg, test_info.gaussian_curvature_avg, test_info.tolerance));
   assert(passes_comparison(principal_curvature_avg, test_info.principal_curvature_avg, test_info.tolerance));
 
-  // computing curvatures together from interpolated_corrected_curvatures()
-  PMP::interpolated_corrected_curvatures(
-    pmesh,
-    CGAL::parameters::ball_radius(test_info.expansion_radius)
-    .vertex_mean_curvature_map(mean_curvature_map)
-    .vertex_Gaussian_curvature_map(gaussian_curvature_map)
-    .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map)
-  );
-
   Epic_kernel::FT new_mean_curvature_avg = 0, new_Gaussian_curvature_avg = 0, new_principal_curvature_avg = 0;
 
   for (vertex_descriptor v : vertices(pmesh)) {
@@ -178,9 +152,9 @@ void test_average_curvatures(std::string mesh_path,
     PMP::Principal_curvatures_and_directions<Epic_kernel> p;
 
     for (vertex_descriptor v : vertices(pmesh)) {
-      PMP::interpolated_corrected_curvatures_one_vertex(
-        pmesh,
+      PMP::interpolated_corrected_curvatures(
         v,
+        pmesh,
         CGAL::parameters::vertex_Gaussian_curvature(std::ref(g))
         .vertex_mean_curvature(std::ref(h))
         .vertex_principal_curvatures_and_directions(std::ref(p))

From a193a1d8fb9a7efe5e5b92b2e588fcf1be93df65 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 9 Oct 2023 09:08:31 +0200
Subject: [PATCH 0834/1398] implement comments from review

---
 Installation/CHANGES.md                              |  4 ++--
 .../CGAL/Polygon_mesh_processing/autorefinement.h    | 12 ++++++------
 2 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index b361d15dec76..8748eda2db0a 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -39,8 +39,8 @@ Release date: October 2023
 
 -   Added the function
     `CGAL::Polygon_mesh_processing::autorefine_triangle_soup()` that refines a soup of triangles so that no pair of triangles intersects
-     (they can share an edge or a vertex). Also added, the function `autorefine()` operating directly on a triangle mesh and updating it
-     using the aforementioned function on triangle soup.
+     in their interiors. Also added, the function `autorefine()` operating directly on a triangle mesh and updating it
+     using the aforementioned function on a triangle soup.
 
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 884ce3477aa8..5b9cad98277d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1131,15 +1131,15 @@ void generate_subtriangles(std::size_t ti,
 * refines a soup of triangles so that no pair of triangles intersects.
 * Output triangles may share a common edge or a common vertex (but with the same indexed position in `points`).
 * Note that points in `soup_points` can only be added (intersection points) at the end of the container, with the initial order preserved.
-* Note that if `soup_points` contains two or more identical points and only the first copy (following the order in the `soup_points`)
+* Note that if `soup_points` contains two or more identical points then only the first copy (following the order in the `soup_points`)
 * will be used in `soup_triangles`.
-* `soup_triangles` will be updated to contain both the input triangles and the new subdivides triangles. Degenerate triangles will be removed.
+* `soup_triangles` will be updated to contain both the input triangles and the new subdivided triangles. Degenerate triangles will be removed.
 * Also triangles in `soup_triangles` will be triangles without intersection first, followed by triangles coming from a subdivision induced
 * by an intersection. The named parameter `visitor()` can be used to track
 *
 * @tparam PointRange a model of the concept `RandomAccessContainer`
 * whose value type is the point type
-* @tparam TriIdsRange a model of the concepts `RandomAccessContainer`, `BackInsertionSequence` and `Swappable`, whose
+* @tparam TriangleRange a model of the concepts `RandomAccessContainer`, `BackInsertionSequence` and `Swappable`, whose
 * value type is a model of the concept `RandomAccessContainer` whose value type is convertible to `std::size_t` and that
 * is constructible from an `std::initializer_list<std::size_t>` of size 3.
 * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
@@ -1174,9 +1174,9 @@ void generate_subtriangles(std::size_t ti,
 * \cgalNamedParamsEnd
 *
 */
-template <class PointRange, class TriIdsRange, class NamedParameters = parameters::Default_named_parameters>
+template <class PointRange, class TriangleRange, class NamedParameters = parameters::Default_named_parameters>
 void autorefine_triangle_soup(PointRange& soup_points,
-                              TriIdsRange& soup_triangles,
+                              TriangleRange& soup_triangles,
                               const NamedParameters& np = parameters::default_values())
 {
   using parameters::choose_parameter;
@@ -1507,7 +1507,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 #endif
   }
 
-  TriIdsRange soup_triangles_out;
+  TriangleRange soup_triangles_out;
   soup_triangles_out.reserve(soup_triangles.size()); // TODO: remove #deg tri?
 
   visitor.number_of_output_triangles(soup_triangles.size()+new_triangles.size());

From dbd706a3f43ced1af96095148ea4809c737316de Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 9 Oct 2023 09:14:05 +0200
Subject: [PATCH 0835/1398] remove remaining see also

---
 .../interpolated_corrected_curvatures.h                        | 3 ---
 1 file changed, 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index c2c27b1733b2..438bdaad2625 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -1112,9 +1112,6 @@ class Interpolated_corrected_curvatures_computer
 *
 * \cgalNamedParamsEnd
 *
-* @see `interpolated_corrected_mean_curvature()`
-* @see `interpolated_corrected_Gaussian_curvature()`
-* @see `interpolated_corrected_principal_curvatures_and_directions()`
 */
 template<typename PolygonMesh,
          typename  CGAL_NP_TEMPLATE_PARAMETERS>

From e69b1f8917da6051702a9b780fb3996f90afa658 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Mon, 9 Oct 2023 11:06:22 +0200
Subject: [PATCH 0836/1398] Correcting permanent redirect

Correcting permanent redirect
---
 Documentation/doc/biblio/cgal_manual.bib                      | 2 +-
 .../Stream_support/File_formats/Supported_file_formats.txt    | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib
index 38b745f67809..371192f94238 100644
--- a/Documentation/doc/biblio/cgal_manual.bib
+++ b/Documentation/doc/biblio/cgal_manual.bib
@@ -338,7 +338,7 @@ @misc{ cgal:b-ply-11
   ,title        = "{PLY} - Polygon File Format"
   ,howpublished = {Paul Bourke}
   ,year         = 2011
-  ,url          = "http://paulbourke.net/dataformats/ply/"
+  ,url          = "https://paulbourke.net/dataformats/ply/"
 }
 
 
diff --git a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
index 5ca36ae8a8c0..255e8c16a59e 100644
--- a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
+++ b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
@@ -192,7 +192,7 @@ The `PLY` file format, using the file extension `.ply`, is an \ascii or binary f
 conceived to store the data obtained during 3D scans. Objects are stored
 as a simple list of polygons and external properties can be stored.
 
-A precise specification of those formats is available <a href="http://paulbourke.net/dataformats/ply/">here</a>.
+A precise specification of those formats is available <a href="https://paulbourke.net/dataformats/ply/">here</a>.
 
 <table class="iotable">
   <tr>
@@ -327,7 +327,7 @@ of its coordinates and other properties. Only coordinates and normals are curren
 The `GOCAD` format, using the file extension `.ts`, is an \ascii file format
 that enables a range of primitive types to be imported into the GOCAD package.
 
-A precise specification of the format is available <a href="http://paulbourke.net/dataformats/gocad/gocad.pdf"> here</a>.
+A precise specification of the format is available <a href="https://paulbourke.net/dataformats/gocad/gocad.pdf"> here</a>.
 
 <table class="iotable">
   <tr>

From 7de4f442e8ff9067d0ea3637fa504d9528d5bfcc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 9 Oct 2023 12:12:31 +0200
Subject: [PATCH 0837/1398] Remove obsolete sort at every iteration

There was a need for sorting at every iteration when the sorting
used criteria which were changing with every iteration. This
is no longer the case after c7b9317.

Also make it deterministic.
---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 26 +++++++++----------
 1 file changed, 12 insertions(+), 14 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 639c9a3f4685..ba4635889b4b 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1440,15 +1440,17 @@ class Alpha_wrap_3
 
       // Prioritize:
       // - cells without bbox vertices
-      // - cells that already have a large number of boundary facets
       // - small cells when equal number of boundary facets
-      // @todo give topmost priority to cells with > 1 non-manifold vertex?
+      //
+      // Note that these are properties that do not depend on where the surface is, so we can
+      // sort once. However, if a criterion such as the number of inside cells were added,
+      // one would need to sort again after each modification of is_outside() statuses.
       auto comparer = [&](Cell_handle l, Cell_handle r) -> bool
       {
-        if(has_artificial_vertex(l))
-          return false;
-        if(has_artificial_vertex(r))
-          return true;
+        CGAL_precondition(!m_dt.is_infinite(l) && !m_dt.is_infinite(r));
+
+        if(has_artificial_vertex(l) != has_artificial_vertex(r))
+          return has_artificial_vertex(r);
 
         return sq_longest_edge(l) < sq_longest_edge(r);
       };
@@ -1457,17 +1459,13 @@ class Alpha_wrap_3
       inc_cells.reserve(64);
       m_dt.finite_incident_cells(v, std::back_inserter(inc_cells));
 
-#define CGAL_AW3_USE_BRUTE_FORCE_MUTABLE_PRIORITY_QUEUE
-#ifndef CGAL_AW3_USE_BRUTE_FORCE_MUTABLE_PRIORITY_QUEUE
-      std::sort(inc_cells.begin(), inc_cells.end(), comparer); // sort once
-#endif
+      // 'std::stable_sort' to have determinism without having to write something like:
+      //     if(longest_edge(l) == longest_edge(r)) return ...
+      // in the comparer. It's a small range, so the cost does not matter.
+      std::stable_sort(inc_cells.begin(), inc_cells.end(), comparer);
 
       for(auto cit=inc_cells.begin(), cend=inc_cells.end(); cit!=cend; ++cit)
       {
-#ifdef CGAL_AW3_USE_BRUTE_FORCE_MUTABLE_PRIORITY_QUEUE
-        // sort at every iteration since the number of boundary facets evolves
-        std::sort(cit, cend, comparer);
-#endif
         Cell_handle ic = *cit;
         CGAL_assertion(!m_dt.is_infinite(ic));
 

From d982ccbe0230cf2a3fa06f9625ea1fc78607c1fd Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Mon, 9 Oct 2023 13:09:46 +0200
Subject: [PATCH 0838/1398] Correcting stylesheet name

The name `stylesheet.css` is replaced by a better name `cgal_stylesheet.css` a while ago, but apparently these 2 files were not updated.
---
 Documentation/doc/scripts/generate_how_to_cite.py        | 2 +-
 Documentation/doc/scripts/html_output_post_processing.py | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Documentation/doc/scripts/generate_how_to_cite.py b/Documentation/doc/scripts/generate_how_to_cite.py
index 71e1c6258c90..a891edddebc6 100644
--- a/Documentation/doc/scripts/generate_how_to_cite.py
+++ b/Documentation/doc/scripts/generate_how_to_cite.py
@@ -85,7 +85,7 @@
 <link rel="icon" type="image/png" href="../Manual/g-196x196-doc.png"/>
 <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
 <meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<link href="stylesheet.css" rel="stylesheet" type="text/css" />
+<link href="cgal_stylesheet.css" rel="stylesheet" type="text/css" />
 <title>CGAL ${CGAL_CREATED_VERSION_NUM} - Manual: Acknowledging CGAL</title>
 </head>
 <body>
diff --git a/Documentation/doc/scripts/html_output_post_processing.py b/Documentation/doc/scripts/html_output_post_processing.py
index 9406785b508f..90e8547eb587 100755
--- a/Documentation/doc/scripts/html_output_post_processing.py
+++ b/Documentation/doc/scripts/html_output_post_processing.py
@@ -70,7 +70,7 @@ def clean_doc():
     duplicate_files=list(package_glob('./*/jquery.js'))
     duplicate_files.extend(package_glob('./*/dynsections.js'))
     duplicate_files.extend(package_glob('./*/resize.js'))
-    duplicate_files.extend(package_glob('./*/stylesheet.css'))
+    duplicate_files.extend(package_glob('./*/cgal_stylesheet.css'))
     # kill _all_, including the one in CGAL tabs.css files
     duplicate_files.extend(glob.glob('./*/tabs.css'))
     # left-over by doxygen?

From 2f1992f131dd107d4c7cd3251181afb92cee12fa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 9 Oct 2023 15:16:10 +0200
Subject: [PATCH 0839/1398] Add LIFO queue

But keep the old one, because we might need something sorted in the future.

Also it is needed to do interrupting, because the intermediate is really
ugly for a LIFO queue.
---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 72 +++++++++++++++----
 .../Alpha_wrap_triangulation_cell_base_3.h    | 27 ++++++-
 .../internal/gate_priority_queue.h            | 40 +++++++++++
 3 files changed, 124 insertions(+), 15 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 9792b828a610..08f09fcdd4ce 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -49,7 +49,9 @@
 #include <CGAL/boost/graph/named_params_helper.h>
 #include <CGAL/Default.h>
 #include <CGAL/Named_function_parameters.h>
-#include <CGAL/Modifiable_priority_queue.h>
+#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+ #include <CGAL/Modifiable_priority_queue.h>
+#endif
 #include <CGAL/Polygon_mesh_processing/bbox.h>
 #include <CGAL/Polygon_mesh_processing/measure.h>
 #include <CGAL/Polygon_mesh_processing/orientation.h>
@@ -140,7 +142,18 @@ class Alpha_wrap_3
   using Locate_type = typename Triangulation::Locate_type;
 
   using Gate = internal::Gate<Triangulation>;
+
+  // A sorted queue is a priority queue sorted by circumradius, and is experimentally much slower,
+  // but intermediate results are visually nice: somewhat uniform meshes.
+  //
+  // An unsorted queue is a LIFO queue, and is experimentally much faster (~35%),
+  // but intermediate results are not useful: a LIFO will mean carving is done very deep
+  // before than wide
+#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
   using Alpha_PQ = Modifiable_priority_queue<Gate, Less_gate, Gate_ID_PM<Triangulation>, CGAL_BOOST_PAIRING_HEAP>;
+#else
+  using Alpha_PQ = std::stack<Gate>;
+#endif
 
   using FT = typename Geom_traits::FT;
   using Point_3 = typename Geom_traits::Point_3;
@@ -166,20 +179,27 @@ class Alpha_wrap_3
 
 public:
   Alpha_wrap_3()
+#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+      // '4096' is an arbitrary, not-too-small value for the largest ID in queue initialization
     : m_queue(4096)
-  { }
-
-  Alpha_wrap_3(const Oracle& oracle)
-    : m_oracle(oracle),
-      m_tr(Geom_traits(oracle.geom_traits())),
-      // used to set up the initial MPQ, use some arbitrary not-too-small value
-      m_queue(4096)
+#endif
   {
     // Due to the Steiner point computation being a dichotomy, the algorithm is inherently inexact
     // and passing exact kernels is explicitly disabled to ensure no misunderstanding.
     static_assert(std::is_floating_point<FT>::value);
   }
 
+  Alpha_wrap_3(const Oracle& oracle)
+    :
+#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+      m_queue(4096),
+#endif
+      m_oracle(oracle),
+      m_tr(Geom_traits(oracle.geom_traits()))
+  {
+    static_assert(std::is_floating_point<FT>::value);
+  }
+
 public:
   const Geom_traits& geom_traits() const { return m_tr.geom_traits(); }
   Oracle& oracle() { return m_oracle; }
@@ -1130,17 +1150,23 @@ class Alpha_wrap_3
   {
     CGAL_precondition(f.first->is_outside());
 
+#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
     // skip if f is already in queue
     if(m_queue.contains_with_bounds_check(Gate(f)))
       return false;
+#endif
 
     const Facet_queue_status status = facet_status(f);
     if(status == IRRELEVANT)
       return false;
 
+#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
     const FT sqr = smallest_squared_radius_3(f, m_tr);
     const bool is_permissive = (status == HAS_INFINITE_NEIGHBOR || status == SCAFFOLDING);
     m_queue.resize_and_push(Gate(f, sqr, is_permissive));
+#else
+    m_queue.push(Gate(f, m_tr));
+#endif
 
 #ifdef CGAL_AW3_DEBUG_QUEUE
     const Cell_handle ch = f.first;
@@ -1154,11 +1180,13 @@ class Alpha_wrap_3
               << "  ch = " << &*ch << " (" << m_tr.is_infinite(ch) << ") " << "\n"
               << "\t" << p0 << "\n\t" << p1 << "\n\t" << p2 << std::endl;
     std::cout << "  Status: " << get_status_message(status) << std::endl;
+ #ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
     std::cout << "  SQR: " << sqr << std::endl;
     std::cout << "  Permissiveness: " << is_permissive << std::endl;
-#endif
 
     CGAL_assertion(is_permissive || sqr >= m_sq_alpha);
+ #endif // CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+#endif // CGAL_AW3_DEBUG_QUEUE
 
     return true;
   }
@@ -1195,7 +1223,11 @@ class Alpha_wrap_3
     m_offset = FT(offset);
     m_sq_offset = square(m_offset);
 
+#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
     m_queue.clear();
+#else
+    m_queue = { };
+#endif
 
     if(resuming)
     {
@@ -1232,6 +1264,15 @@ class Alpha_wrap_3
 
       // const& to something that will be popped, but safe as `ch` && `id` are extracted before the pop
       const Gate& gate = m_queue.top();
+
+#ifndef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+      if(gate.is_zombie())
+      {
+        m_queue.pop();
+        continue;
+      }
+#endif
+
       const Facet& f = gate.facet();
       CGAL_precondition(!m_tr.is_infinite(f));
 
@@ -1304,6 +1345,7 @@ class Alpha_wrap_3
                             std::back_inserter(boundary_facets),
                             std::back_inserter(conflict_zone));
 
+#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
         // Purge the queue of facets that will be deleted/modified by the Steiner point insertion,
         // and which might have been gates
         for(const Cell_handle& cch : conflict_zone)
@@ -1322,6 +1364,7 @@ class Alpha_wrap_3
           if(m_queue.contains_with_bounds_check(Gate(mf)))
             m_queue.erase(Gate(mf));
         }
+#endif
 
         visitor.before_Steiner_point_insertion(*this, steiner_point);
 
@@ -1715,18 +1758,23 @@ class Alpha_wrap_3
       const Point_3& p0 = m_tr.point(ch, Triangulation::vertex_triple_index(id, 0));
       const Point_3& p1 = m_tr.point(ch, Triangulation::vertex_triple_index(id, 1));
       const Point_3& p2 = m_tr.point(ch, Triangulation::vertex_triple_index(id, 2));
-      const FT sqr = geom_traits().compute_squared_radius_3_object()(p0, p1, p2);
 
-      std::cout << "At Facet with VID " << get(Gate_ID_PM<Triangulation>(), current_gate) << "\n";
+      std::cout << "Facet with VID " << get(Gate_ID_PM<Triangulation>(), current_gate) << "\n";
       std::cout << "\t" << p0 << "\n\t" << p1 << "\n\t" << p2 << "\n";
+
+#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
       std::cout << "  Permissiveness: " << current_gate.is_permissive_facet() << "\n";
-      std::cout << "  SQR: " << sqr << "\n";
+      std::cout << "  SQR: " << geom_traits().compute_squared_radius_3_object()(p0, p1, p2) << "\n";
       std::cout << "  Priority " << current_gate.priority() << std::endl;
 
       if(Less_gate()(current_gate, previous_top_gate))
         std::cerr << "Error: current gate has higher priority than the previous top" << std::endl;
 
       previous_top_gate = current_gate;
+#else
+      if(current_gate.is_zombie())
+        std::cout << "Gate is a zombie!" << std::endl;
+#endif
 
       m_queue.pop();
     }
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
index db1df61c8f65..b586d495f0d3 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
@@ -25,9 +25,6 @@ template < typename GT,
 class Alpha_wrap_triangulation_cell_base_3
   : public Cb
 {
-private:
-  bool outside = false;
-
 public:
   typedef typename Cb::Vertex_handle                   Vertex_handle;
   typedef typename Cb::Cell_handle                     Cell_handle;
@@ -39,6 +36,14 @@ class Alpha_wrap_triangulation_cell_base_3
     using Other = Alpha_wrap_triangulation_cell_base_3<GT, Cb2>;
   };
 
+private:
+  bool outside = false;
+
+#ifndef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+  unsigned int m_erase_counter;
+#endif
+
+public:
   Alpha_wrap_triangulation_cell_base_3()
     : Cb()
   {}
@@ -55,8 +60,24 @@ class Alpha_wrap_triangulation_cell_base_3
     : Cb(v0, v1, v2, v3, n0, n1, n2, n3)
   {}
 
+public:
   bool is_outside() const { return outside; }
   bool& is_outside() { return outside; }
+
+#ifndef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+  unsigned int erase_counter() const
+  {
+    return m_erase_counter;
+  }
+  void set_erase_counter(unsigned int c)
+  {
+    m_erase_counter = c;
+  }
+  void increment_erase_counter()
+  {
+    ++m_erase_counter;
+  }
+#endif
 };
 
 template <typename Cb>
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
index b091b2cabe24..f017f9be8cf4 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
@@ -27,6 +27,8 @@ namespace CGAL {
 namespace Alpha_wraps_3 {
 namespace internal {
 
+#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+
 // Represents an alpha-traversable facet in the mutable priority queue
 template <typename Tr>
 class Gate
@@ -90,6 +92,44 @@ struct Less_gate
   }
 };
 
+#else // CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+
+// Represents an alpha-traversable facet in the mutable priority queue
+template <typename Tr>
+class Gate
+{
+  using Facet = typename Tr::Facet;
+  using FT = typename Tr::Geom_traits::FT;
+
+private:
+  Facet m_facet, m_mirror_facet;
+  const unsigned int m_erase_counter_mem;
+  const unsigned int m_mirror_erase_counter_mem;
+
+public:
+  // Constructors
+  Gate(const Facet& facet,
+       const Tr& tr)
+    :
+      m_facet(facet),
+      m_mirror_facet(tr.mirror_facet(facet)),
+      m_erase_counter_mem(m_facet.first->erase_counter()),
+      m_mirror_erase_counter_mem(m_mirror_facet.first->erase_counter())
+  {
+  }
+
+public:
+  const Facet& facet() const { return m_facet; }
+
+  const bool is_zombie() const
+  {
+    return (m_facet.first->erase_counter() != m_erase_counter_mem) ||
+           (m_mirror_facet.first->erase_counter() != m_mirror_erase_counter_mem);
+  }
+};
+
+#endif // CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+
 template <typename Tr>
 struct Gate_ID_PM
 {

From 6f560fcdce5ef5f8f321d7b19d98960f08cddf17 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Mon, 9 Oct 2023 16:03:49 +0200
Subject: [PATCH 0840/1398] issue #7767 Problem with the documenation of Mesh_3

removing files that were removed by #7445 but reintroduced by #7395
---
 .../Mesh_3/CGAL/Polyhedral_mesh_domain_3.h    |  60 ----------
 .../Polyhedral_mesh_domain_with_features_3.h  | 105 ------------------
 2 files changed, 165 deletions(-)
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h
 delete mode 100644 Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h

diff --git a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h b/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h
deleted file mode 100644
index de4489b7cd78..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_3.h
+++ /dev/null
@@ -1,60 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-The class `Polyhedral_mesh_domain_3` implements
-a domain defined by a simplicial polyhedral surface.
-
-The input polyhedral surface must be free of intersection.
-It must include (at least) one closed connected component
-that defines the boundary of the domain to be meshed.
-Inside this bounding component,
-the input polyhedral surface may contain
-several other components (closed or not)
-that will be represented in the final mesh.
-This class is a model of the concept `MeshDomain_3`.
-
-\tparam Polyhedron stands for the type of the input polyhedral surface(s),
-model of `FaceListGraph`.
-
-\tparam IGT stands for a geometric traits class
-providing the types and functors required to implement
-the intersection tests and intersection computations
-for polyhedral boundary surfaces. This parameter has to be instantiated
-with a model of the concept `IntersectionGeometricTraits_3`.
-
-\cgalModels{MeshDomain_3}
-
-\sa `IntersectionGeometricTraits_3`
-\sa `CGAL::make_mesh_3()`.
-
-*/
-template< typename Polyhedron, typename IGT, typename TriangleAccessor >
-class Polyhedral_mesh_domain_3
-{
-public:
-
-/// \name Creation
-/// @{
-
-/*!
-Construction from a bounding polyhedral surface which must be closed, and free of intersections.
-The inside of `bounding_polyhedron` will be meshed.
-*/
-Polyhedral_mesh_domain_3(const Polyhedron& bounding_polyhedron);
-
-/*!
-Construction from a polyhedral surface, and a bounding polyhedral surface,.
-The first polyhedron must be entirely included inside `bounding_polyhedron`, which must be closed
-and free of intersections.
-Using this constructor allows to mesh a polyhedral surface which is not closed, or has holes.
-The inside of `bounding_polyhedron` will be meshed.
-*/
-Polyhedral_mesh_domain_3(const Polyhedron& polyhedron,
-                         const Polyhedron& bounding_polyhedron);
-
-/// @}
-
-}; /* end Polyhedral_mesh_domain_3 */
-} /* end namespace CGAL */
diff --git a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h b/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h
deleted file mode 100644
index 8951889d690c..000000000000
--- a/Mesh_3/doc/Mesh_3/CGAL/Polyhedral_mesh_domain_with_features_3.h
+++ /dev/null
@@ -1,105 +0,0 @@
-namespace CGAL {
-
-/*!
-\ingroup PkgMesh3Domains
-
-The class `Polyhedral_mesh_domain_with_features_3` implements a domain whose
-boundary is a simplicial polyhedral surface.
-This surface must be free of intersection.
-It can either be closed,
-included inside another polyhedral surface which is closed and free of intersection,
-or open. In the latter case, the meshing process will only take care of the quality
-of the 1D (features and boundaries) and 2D (surfaces) components of the mesh.
-
-It is a model of the concept `MeshDomainWithFeatures_3`. It also
-provides a member function to automatically detect sharp features and boundaries from
-the input polyhedral surface(s).
-
-\tparam IGT stands for a geometric traits class providing the types
-and functors required to implement the intersection tests and intersection computations
-for polyhedral boundary surfaces. This parameter has to be
-instantiated with a model of the concept `IntersectionGeometricTraits_3`.
-
-\cgalModels{MeshDomainWithFeatures_3}
-
-\sa `CGAL::Mesh_domain_with_polyline_features_3<MD>`
-\sa `CGAL::Polyhedral_mesh_domain_3<Polyhedron,IGT,TriangleAccessor>`
-\sa `CGAL::Mesh_polyhedron_3<IGT>`
-*/
-template< typename IGT >
-class Polyhedral_mesh_domain_with_features_3
-  : public CGAL::Mesh_domain_with_polyline_features_3<
-  CGAL::Polyhedral_mesh_domain_3< CGAL::Mesh_polyhedron_3<IGT>::type, IGT> >
- {
-public:
-
-/// \name Types
-/// @{
-
-/*!
-Numerical type.
-*/
-typedef unspecified_type FT;
-
-/// @}
-
-/// \name Creation
-/// @{
-
-/*!
-Constructs a `Polyhedral_mesh_domain_with_features_3` from a polyhedral surface of type `Polyhedron`.
-The only requirement on type `Polyhedron` is that `CGAL::Mesh_polyhedron_3<IGT>::%type` should
-be constructible from `Polyhedron`.
-No feature detection is done at this level. Note that a copy of `bounding_polyhedron` will be done.
-The polyhedron `bounding_polyhedron` has to be closed and free of intersections.
-Its interior of `bounding_polyhedron` will be meshed.
-*/
-template <typename Polyhedron>
-Polyhedral_mesh_domain_with_features_3(const Polyhedron& bounding_polyhedron);
-
-
-/*!
-Constructs a `Polyhedral_mesh_domain_with_features_3` from a polyhedral surface, and a bounding polyhedral surface.
-`CGAL::Mesh_polyhedron_3<IGT>::%type` should be constructible from `Polyhedron`.
-The first polyhedron should be entirely included inside `bounding_polyhedron`, which has to be closed
-and free of intersections.
-Using this constructor allows to mesh a polyhedral surface which is not closed, or has holes.
-The inside of `bounding_polyhedron` will be meshed.
-*/
-template <typename Polyhedron>
-Polyhedral_mesh_domain_with_features_3(const Polyhedron& polyhedron,
-                                       const Polyhedron& bounding_polyhedron);
-
-/*!
-\deprecated Constructs a `Polyhedral_mesh_domain_with_features_3` from an off file. No feature
-detection is done at this level. Users must read the file into a `Polyhedron_3` and call the
-constructor above.
-*/
-Polyhedral_mesh_domain_with_features_3(const std::string& filename);
-
-/// @}
-
-/// \name Operations
-/// @{
-
-/*!
-Detects sharp features and boundaries of the internal bounding polyhedron (and the potential internal polyhedron)
-and inserts them as features of the domain. `angle_bound` gives the maximum
-angle (in degrees) between the two normal vectors of adjacent triangles.
-For an edge of the polyhedron, if the angle between the two normal vectors of its
-incident facets is bigger than the given bound, then the edge is considered as
-a feature edge.
-*/
-void detect_features(FT angle_bound=60);
-
-
-/*!
-Detects border edges of the bounding polyhedron and inserts them as features of the domain.
-This function should be called alone only, and not before or after `detect_features()`.
-*/
-   void detect_borders();
-
-/// @}
-
-}; /* end Polyhedral_mesh_domain_with_features_3 */
-} /* end namespace CGAL */

From 758f0d773a7ed1db49cc6e6a69eb2a9f7aaaa156 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Mon, 9 Oct 2023 16:39:59 +0200
Subject: [PATCH 0841/1398] issue #7764 Reference to moka modeller

Setting correct path to documentation and source repository.
---
 Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt | 2 +-
 Generalized_map/doc/Generalized_map/Generalized_map.txt       | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
index 2867dc1c2f7c..05cd8ea54b80 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
@@ -562,7 +562,7 @@ Let <I>d0</I>\f$ \in \f$ <I>D</I> be a dart. Given <I>i</I>, 1 \f$ \leq \f$ <I>i
 
 \section Combinatorial_mapDesign Design and Implementation History
 
-The code of this package is inspired by Moka, a 3D topological modeler mainly developed by Fr&eacute;d&eacute;ric Vidil and Guillaume Damiand (<A HREF="https://moka-modeller.sourceforge.net/">https://moka-modeller.sourceforge.net/</A>). However, Moka was based on Generalized maps (and not Combinatorial maps), and the design was not \cgal "compatible". Thus, Guillaume Damiand started to develop a totally new package by mixing ideas taken from Moka with the design of the Halfedge data structure package of \cgal. Andreas Fabri and S&eacute;bastien Loriot contributed to the design, the coding, and to the documentation of the package, and Laurent Rineau helped for the design. Emma Michel contributed to the manual. Monique Teillaud and Bernd G&auml;rtner contributed to the manual by giving useful remarks, really numerous and detailed for Monique. Ken Arroyo Ohori contributed to the two reverse orientation functions.
+The code of this package is inspired by Moka, a 3D topological modeler mainly developed by Fr&eacute;d&eacute;ric Vidil and Guillaume Damiand (see for the documentation: https://projet.liris.cnrs.fr/moka/index.php and for the source repository: https://github.com/gdamiand/moka). However, Moka was based on Generalized maps (and not Combinatorial maps), and the design was not \cgal "compatible". Thus, Guillaume Damiand started to develop a totally new package by mixing ideas taken from Moka with the design of the Halfedge data structure package of \cgal. Andreas Fabri and S&eacute;bastien Loriot contributed to the design, the coding, and to the documentation of the package, and Laurent Rineau helped for the design. Emma Michel contributed to the manual. Monique Teillaud and Bernd G&auml;rtner contributed to the manual by giving useful remarks, really numerous and detailed for Monique. Ken Arroyo Ohori contributed to the two reverse orientation functions.
 
 */
 } /* namespace CGAL */
diff --git a/Generalized_map/doc/Generalized_map/Generalized_map.txt b/Generalized_map/doc/Generalized_map/Generalized_map.txt
index 04c4b9c30a8f..d69de9c3732d 100644
--- a/Generalized_map/doc/Generalized_map/Generalized_map.txt
+++ b/Generalized_map/doc/Generalized_map/Generalized_map.txt
@@ -571,7 +571,7 @@ Let <I>d0</I> \f$ \in \f$ <I>D</I> be a dart. Given <I>i</I>, 0 \f$ \leq \f$ <I>
 
 \section Generalized_mapDesign Design and Implementation History
 
-The code of this package followed the code of Combinatorial maps and was inspired by Moka, a 3D topological modeler that uses 3D generalized maps (<A HREF="https://moka-modeller.sourceforge.net/">https://moka-modeller.sourceforge.net/</A>).
+The code of this package followed the code of Combinatorial maps and was inspired by Moka, a 3D topological modeler that uses 3D generalized maps (see for the documentation: https://projet.liris.cnrs.fr/moka/index.php and for the source repository: https://github.com/gdamiand/moka).
 
 */
 } /* namespace CGAL */

From 5de032c88aa817b91b2af2d775ba98148bd320fc Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Mon, 9 Oct 2023 17:24:27 +0200
Subject: [PATCH 0842/1398] issue #7764 Reference to moka modeller

After review
---
 Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt | 2 +-
 Generalized_map/doc/Generalized_map/Generalized_map.txt       | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
index 05cd8ea54b80..1ea01c1d29ab 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
@@ -562,7 +562,7 @@ Let <I>d0</I>\f$ \in \f$ <I>D</I> be a dart. Given <I>i</I>, 1 \f$ \leq \f$ <I>i
 
 \section Combinatorial_mapDesign Design and Implementation History
 
-The code of this package is inspired by Moka, a 3D topological modeler mainly developed by Fr&eacute;d&eacute;ric Vidil and Guillaume Damiand (see for the documentation: https://projet.liris.cnrs.fr/moka/index.php and for the source repository: https://github.com/gdamiand/moka). However, Moka was based on Generalized maps (and not Combinatorial maps), and the design was not \cgal "compatible". Thus, Guillaume Damiand started to develop a totally new package by mixing ideas taken from Moka with the design of the Halfedge data structure package of \cgal. Andreas Fabri and S&eacute;bastien Loriot contributed to the design, the coding, and to the documentation of the package, and Laurent Rineau helped for the design. Emma Michel contributed to the manual. Monique Teillaud and Bernd G&auml;rtner contributed to the manual by giving useful remarks, really numerous and detailed for Monique. Ken Arroyo Ohori contributed to the two reverse orientation functions.
+The code of this package is inspired by Moka, a 3D topological modeler mainly developed by Fr&eacute;d&eacute;ric Vidil and Guillaume Damiand (see https://projet.liris.cnrs.fr/moka/index.php and https://github.com/gdamiand/moka). However, Moka was based on Generalized maps (and not Combinatorial maps), and the design was not \cgal "compatible". Thus, Guillaume Damiand started to develop a totally new package by mixing ideas taken from Moka with the design of the Halfedge data structure package of \cgal. Andreas Fabri and S&eacute;bastien Loriot contributed to the design, the coding, and to the documentation of the package, and Laurent Rineau helped for the design. Emma Michel contributed to the manual. Monique Teillaud and Bernd G&auml;rtner contributed to the manual by giving useful remarks, really numerous and detailed for Monique. Ken Arroyo Ohori contributed to the two reverse orientation functions.
 
 */
 } /* namespace CGAL */
diff --git a/Generalized_map/doc/Generalized_map/Generalized_map.txt b/Generalized_map/doc/Generalized_map/Generalized_map.txt
index d69de9c3732d..44143d90f4e7 100644
--- a/Generalized_map/doc/Generalized_map/Generalized_map.txt
+++ b/Generalized_map/doc/Generalized_map/Generalized_map.txt
@@ -571,7 +571,7 @@ Let <I>d0</I> \f$ \in \f$ <I>D</I> be a dart. Given <I>i</I>, 0 \f$ \leq \f$ <I>
 
 \section Generalized_mapDesign Design and Implementation History
 
-The code of this package followed the code of Combinatorial maps and was inspired by Moka, a 3D topological modeler that uses 3D generalized maps (see for the documentation: https://projet.liris.cnrs.fr/moka/index.php and for the source repository: https://github.com/gdamiand/moka).
+The code of this package followed the code of Combinatorial maps and was inspired by Moka, a 3D topological modeler that uses 3D generalized maps (see https://projet.liris.cnrs.fr/moka/index.php and https://github.com/gdamiand/moka).
 
 */
 } /* namespace CGAL */

From ad9c803ceb022f843eb58f44df430c26a7a49aa8 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Mon, 9 Oct 2023 18:49:37 +0200
Subject: [PATCH 0843/1398] Link to the 3mf specification

Correcting the link to the 3mf specification
---
 .../doc/Stream_support/File_formats/Supported_file_formats.txt  | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
index 5ca36ae8a8c0..1808e82a1b56 100644
--- a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
+++ b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
@@ -370,7 +370,7 @@ The `3MF`, using the file extension `.3mf`, is an open source file format create
 It is an XML-based format that aims to enhance the \ref IOStreamSTL by adding means to include
 extra information such as colors.
 
-A precise specification of the format is available at <a href="https://3mf.io/specification/">3mf.io</a>;
+A precise specification of the format is available at <a href="https://3mf.io/3mf-specification/">3mf.io</a>;
 note that only versions `1.x` are currently supported in \cgal.
 
 <table class="iotable">

From 7d2de68d1cf7665acaa415dcaffc507dccd9f15f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 9 Oct 2023 16:55:57 -0700
Subject: [PATCH 0844/1398] add missing include directive

---
 .../CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h       | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
index 7a3b2c0765e5..4e9082996e49 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
@@ -15,6 +15,7 @@
 
 #include <CGAL/license/Polygon_mesh_processing/miscellaneous.h>
 
+#include <CGAL/boost/graph/Euler_operations.h>
 #include <CGAL/boost/graph/named_params_helper.h>
 
 namespace CGAL {

From 5b67e30e8678cb3b84bf5e20bcbebb99a8d88934 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 9 Oct 2023 17:08:49 -0700
Subject: [PATCH 0845/1398] fix demo

---
 .../Polyhedron/Plugins/Display/Display_property_plugin.cpp    | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index e5baf54cfd7e..687cb6a92dfd 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -861,11 +861,11 @@ private Q_SLOTS:
 
     if (curvature_type == MEAN_CURVATURE)
     {
-      CGAL::Polygon_mesh_processing::interpolated_corrected_mean_curvature(*sm, vcurvature);
+      CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(*sm, CGAL::parameters::vertex_mean_curvature(vcurvature));
     }
     else if (curvature_type == GAUSSIAN_CURVATURE)
     {
-      CGAL::Polygon_mesh_processing::interpolated_corrected_Gaussian_curvature(*sm, vcurvature);
+      CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(*sm, CGAL::parameters::vertex_Gaussian_curvature(vcurvature));
     }
 
     displaySMProperty<vertex_descriptor>(tied_string, *sm);

From ffea30946f999afce6b8d918728dc49d87f36354 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 9 Oct 2023 18:55:33 -0700
Subject: [PATCH 0846/1398] fix the second demo plugin

---
 .../Interpolated_corrected_principal_curvatures_plugin.cpp    | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
index 8bb6a229967b..33250cf3e81a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Interpolated_corrected_principal_curvatures_plugin.cpp
@@ -75,10 +75,10 @@ void compute(SMesh* sMesh,
   assert(created);
 
 
-  PMP::interpolated_corrected_principal_curvatures_and_directions(
+  PMP::interpolated_corrected_curvatures(
     *sMesh,
-    principal_curvatures_and_directions_map,
     CGAL::parameters::ball_radius(0)
+                     .vertex_principal_curvatures_and_directions_map(principal_curvatures_and_directions_map)
   );
 
   double max_curvature_magnitude_on_mesh = 0;

From 0621c8d749d9d312efef56b0e71b48c0feb04f10 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Tue, 10 Oct 2023 09:57:47 +0200
Subject: [PATCH 0847/1398] issue #7774 Link to support funding of GUDHI
 project not found

Corrected link
---
 Triangulation/doc/Triangulation/Triangulation.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Triangulation/doc/Triangulation/Triangulation.txt b/Triangulation/doc/Triangulation/Triangulation.txt
index f3b7bca4c9c0..b239a2c05b0e 100644
--- a/Triangulation/doc/Triangulation/Triangulation.txt
+++ b/Triangulation/doc/Triangulation/Triangulation.txt
@@ -580,7 +580,7 @@ work by Samuel Hornus, Olivier Devillers and Clément Jamin. In 2017, Clément
 Jamin added the regular triangulations.
 
 Clément Jamin's work was supported by the
-<a href="https://cordis.europa.eu/project/rcn/111529/factsheet/en">Advanced Grant of the European Research Council GUDHI</a>
+<a href="https://cordis.europa.eu/project/id/339025">Advanced Grant of the European Research Council GUDHI</a>
 (Geometric Understanding in Higher Dimensions).
 
 

From 4e84efbb92c011839bfaa4e92dc31c5bc5924786 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Tue, 10 Oct 2023 10:22:36 +0200
Subject: [PATCH 0848/1398] issue #7765 Problem with Boost 1.54 and a non
 reachable ticket

CGAL as of version 5.6 requires Boost 1.66 or higher so the warning is not valid anymore
---
 Point_set_processing_3/include/CGAL/mst_orient_normals.h | 3 ---
 1 file changed, 3 deletions(-)

diff --git a/Point_set_processing_3/include/CGAL/mst_orient_normals.h b/Point_set_processing_3/include/CGAL/mst_orient_normals.h
index bc67439f053e..5536815e9f36 100644
--- a/Point_set_processing_3/include/CGAL/mst_orient_normals.h
+++ b/Point_set_processing_3/include/CGAL/mst_orient_normals.h
@@ -553,9 +553,6 @@ create_mst_graph(
    For this reason it should not be called on sorted containers.
    It is based on \cgalCite{cgal:hddms-srup-92}.
 
-   \warning This function may fail when Boost version 1.54 is used,
-   because of the following bug: https://svn.boost.org/trac/boost/ticket/9012
-
    \pre Normals must be unit vectors
    \pre `k >= 2`
 

From 930387e88f156cdf41497030687f4f8fb0351c4d Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Tue, 10 Oct 2023 10:45:59 +0200
Subject: [PATCH 0849/1398] issue #7770 Non existing link to the LASLib /
 LAStools

Corrected link.
---
 Documentation/doc/Documentation/Third_party.txt | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/Documentation/doc/Documentation/Third_party.txt b/Documentation/doc/Documentation/Third_party.txt
index d55d10c2cbef..bf37c13f4a30 100644
--- a/Documentation/doc/Documentation/Third_party.txt
+++ b/Documentation/doc/Documentation/Third_party.txt
@@ -238,9 +238,10 @@ in \cgal programs, the executables should be linked with the CMake
 imported target `CGAL::LASLIB_support` provided in
 `CGAL_LASLIB_support.cmake`.
 
-The \laslib web site is <a
-href="https://rapidlasso.com/lastools/">`https://rapidlasso.com/lastools/`</a>. \laslib
-is usually distributed along with LAStools: for simplicity, \cgal
+\laslib information can be obtained from
+<a href="https://lastools.github.io/">https://lastools.github.io/</a> and 
+<a href="https://rapidlasso.de/product-overview/">https://rapidlasso.de/product-overview/</a>.
+\laslib is usually distributed along with LAStools: for simplicity, \cgal
 provides <a href="https://github.com/CGAL/LAStools">a fork with a
 CMake based install procedure</a>.
 

From 90050dc5514fa69595923f1d87ee6f503e932765 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Tue, 10 Oct 2023 10:52:34 +0200
Subject: [PATCH 0850/1398] issue #7770 Non existing link to the LASLib /
 LAStools

Removed trailing space
---
 Documentation/doc/Documentation/Third_party.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Documentation/doc/Documentation/Third_party.txt b/Documentation/doc/Documentation/Third_party.txt
index bf37c13f4a30..ebeb3de7f629 100644
--- a/Documentation/doc/Documentation/Third_party.txt
+++ b/Documentation/doc/Documentation/Third_party.txt
@@ -239,7 +239,7 @@ imported target `CGAL::LASLIB_support` provided in
 `CGAL_LASLIB_support.cmake`.
 
 \laslib information can be obtained from
-<a href="https://lastools.github.io/">https://lastools.github.io/</a> and 
+<a href="https://lastools.github.io/">https://lastools.github.io/</a> and
 <a href="https://rapidlasso.de/product-overview/">https://rapidlasso.de/product-overview/</a>.
 \laslib is usually distributed along with LAStools: for simplicity, \cgal
 provides <a href="https://github.com/CGAL/LAStools">a fork with a

From 0e9da7ab960b4abebf6738547d260c3c5e0af5d1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 10 Oct 2023 12:19:44 +0200
Subject: [PATCH 0851/1398] Debug code and minor cleaning

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 117 +++++++++++-------
 .../internal/gate_priority_queue.h            |   4 +-
 2 files changed, 72 insertions(+), 49 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 08f09fcdd4ce..2764546c3181 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -175,6 +175,7 @@ class Alpha_wrap_3
   FT m_offset = FT(-1), m_sq_offset = FT(-1);
 
   Triangulation m_tr;
+
   Alpha_PQ m_queue;
 
 public:
@@ -250,24 +251,33 @@ class Alpha_wrap_3
     using parameters::get_parameter_reference;
     using parameters::choose_parameter;
 
+    //
     using OVPM = typename CGAL::GetVertexPointMap<OutputMesh, OutputNamedParameters>::type;
     OVPM ovpm = choose_parameter(get_parameter(out_np, internal_np::vertex_point),
                                  get_property_map(vertex_point, output_mesh));
 
-    typedef typename internal_np::Lookup_named_param_def <
-      internal_np::visitor_t,
-      InputNamedParameters,
-      Wrapping_default_visitor // default
-    >::reference                                                                 Visitor;
+    //
+    using Visitor = typename internal_np::Lookup_named_param_def<
+                      internal_np::visitor_t,
+                      InputNamedParameters,
+                      Wrapping_default_visitor // default
+                    >::reference;
 
     Wrapping_default_visitor default_visitor;
     Visitor visitor = choose_parameter(get_parameter_reference(in_np, internal_np::visitor), default_visitor);
 
-    std::vector<Point_3> no_seeds;
+    //
     using Seeds = typename internal_np::Lookup_named_param_def<
-                    internal_np::seed_points_t, InputNamedParameters, std::vector<Point_3> >::reference;
+                    internal_np::seed_points_t,
+                    InputNamedParameters,
+                    std::vector<Point_3> >::reference;
+
+    std::vector<Point_3> no_seeds;
     Seeds seeds = choose_parameter(get_parameter_reference(in_np, internal_np::seed_points), no_seeds);
 
+    // Whether or not some cells should be reflagged as "inside" after the refinement+carving loop
+    // as ended, as to ensure that the result is not only combinatorially manifold, but also
+    // geometrically manifold.
     const bool do_enforce_manifoldness = choose_parameter(get_parameter(in_np, internal_np::do_enforce_manifoldness), true);
 
     // This parameter enables avoiding recomputing the triangulation from scratch when wrapping
@@ -294,9 +304,16 @@ class Alpha_wrap_3
     if(!initialize(alpha, offset, seeds, resuming))
       return;
 
+#ifdef CGAL_AW3_TIMER
+    t.stop();
+    std::cout << "Initialization took: " << t.time() << " s." << std::endl;
+    t.reset();
+    t.start();
+#endif
+
 #ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
     extract_surface(output_mesh, ovpm, true /*tolerate non manifoldness*/);
-    CGAL::IO::write_polygon_mesh("initial_cavities.off", output_mesh,
+    CGAL::IO::write_polygon_mesh("starting_wrap.off", output_mesh,
                                  CGAL::parameters::vertex_point_map(ovpm).stream_precision(17));
 #endif
 
@@ -305,20 +322,20 @@ class Alpha_wrap_3
 #ifdef CGAL_AW3_TIMER
     t.stop();
     std::cout << "Flood filling took: " << t.time() << " s." << std::endl;
+    t.reset();
+    t.start();
 #endif
 
     if(do_enforce_manifoldness)
     {
-#ifdef CGAL_AW3_DEBUG_MANIFOLDNESS
-      std::cout << "> Make manifold..." << std::endl;
-
+#ifdef CGAL_AW3_DEBUG
       extract_surface(output_mesh, ovpm, true /*tolerate non manifoldness*/);
 
-#ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
-      dump_triangulation_faces("intermediate_tr.off", false /*only_boundary_faces*/);
-      IO::write_polygon_mesh("intermediate.off", output_mesh,
+ #ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
+      dump_triangulation_faces("carved_tr.off", false /*only_boundary_faces*/);
+      IO::write_polygon_mesh("carved_wrap.off", output_mesh,
                              CGAL::parameters::vertex_point_map(ovpm).stream_precision(17));
-#endif
+ #endif
 
       FT base_vol = 0;
       if(is_closed(output_mesh)) // might not be due to manifoldness
@@ -327,19 +344,16 @@ class Alpha_wrap_3
         std::cerr << "Warning: couldn't compute volume before manifoldness fixes (mesh is not closed)" << std::endl;
 #endif
 
-#ifdef CGAL_AW3_TIMER
-    t.reset();
-    t.start();
-#endif
-
       make_manifold();
 
 #ifdef CGAL_AW3_TIMER
       t.stop();
-      std::cout << "\nManifoldness post-processing took: " << t.time() << " s." << std::endl;
+      std::cout << "Manifoldness post-processing took: " << t.time() << " s." << std::endl;
+      t.reset();
+      t.start();
 #endif
 
-#ifdef CGAL_AW3_DEBUG_MANIFOLDNESS
+#ifdef CGAL_AW3_DEBUG
       if(!is_zero(base_vol))
       {
         extract_surface(output_mesh, ovpm, false /*do not tolerate non-manifoldness*/);
@@ -751,7 +765,7 @@ class Alpha_wrap_3
     if(faces.empty())
     {
 #ifdef CGAL_AW3_DEBUG
-      std::cout << "Empty wrap?..." << std::endl;
+      std::cerr << "Warning: empty wrap?..." << std::endl;
 #endif
       return;
     }
@@ -791,7 +805,8 @@ class Alpha_wrap_3
     std::vector<Point_3> points;
     std::vector<std::array<std::size_t, 3> > polygons;
 
-    // Explode the polygon soup into indepent triangles, and stitch back edge by edge by walking along the exterior
+    // Explode the polygon soup into indepent triangles, and stitch it back
+    // edge by edge by walking along the exterior
     std::map<Facet, std::size_t> facet_ids;
     std::size_t idx = 0;
 
@@ -817,10 +832,15 @@ class Alpha_wrap_3
       idx += 3;
     }
 
+#ifdef CGAL_AW3_DEBUG
+    std::cout << "\t" << points.size() << " points" << std::endl;
+    std::cout << "\t" << polygons.size() << " polygons" << std::endl;
+#endif
+
     if(polygons.empty())
     {
 #ifdef CGAL_AW3_DEBUG
-      std::cout << "Empty wrap?..." << std::endl;
+      std::cerr << "Warning: empty wrap?..." << std::endl;
 #endif
       return;
     }
@@ -1280,14 +1300,14 @@ class Alpha_wrap_3
       const int s = f.second;
       CGAL_precondition(ch->is_outside());
 
-      const Cell_handle neighbor = ch->neighbor(s);
+      const Cell_handle nh = ch->neighbor(s);
 
 #ifdef CGAL_AW3_DEBUG_QUEUE
       static int fid = 0;
       std::cout << m_tr.number_of_vertices() << " DT vertices" << std::endl;
       std::cout << m_queue.size() << " facets in the queue" << std::endl;
       std::cout << "Face " << fid++ << "\n"
-                << "c = " << &*ch << " (" << m_tr.is_infinite(ch) << "), n = " << &*neighbor << " (" << m_tr.is_infinite(neighbor) << ")" << "\n"
+                << "c = " << &*ch << " (" << m_tr.is_infinite(ch) << "), n = " << &*nh << " (" << m_tr.is_infinite(nh) << ")" << "\n"
                 << m_tr.point(ch, Triangulation::vertex_triple_index(s, 0)) << "\n"
                 << m_tr.point(ch, Triangulation::vertex_triple_index(s, 1)) << "\n"
                 << m_tr.point(ch, Triangulation::vertex_triple_index(s, 2)) << std::endl;
@@ -1316,14 +1336,14 @@ class Alpha_wrap_3
 
       m_queue.pop();
 
-      if(m_tr.is_infinite(neighbor))
+      if(m_tr.is_infinite(nh))
       {
-        neighbor->is_outside() = true;
+        nh->is_outside() = true;
         continue;
       }
 
       Point_3 steiner_point;
-      if(compute_steiner_point(ch, neighbor, steiner_point))
+      if(compute_steiner_point(ch, nh, steiner_point))
       {
 //        std::cout << CGAL::abs(CGAL::approximate_sqrt(m_oracle.squared_distance(steiner_point)) - m_offset)
 //                  << " vs " << 1e-2 * m_offset << std::endl;
@@ -1332,7 +1352,7 @@ class Alpha_wrap_3
         // locate cells that are going to be destroyed and remove their facet from the queue
         int li, lj = 0;
         Locate_type lt;
-        const Cell_handle conflict_cell = m_tr.locate(steiner_point, lt, li, lj, neighbor);
+        const Cell_handle conflict_cell = m_tr.locate(steiner_point, lt, li, lj, nh);
         CGAL_assertion(lt != Triangulation::VERTEX);
 
         // Using small vectors like in Triangulation_3 does not bring any runtime improvement
@@ -1379,10 +1399,10 @@ class Alpha_wrap_3
         std::vector<Cell_handle> new_cells;
         new_cells.reserve(32);
         m_tr.incident_cells(vh, std::back_inserter(new_cells));
-        for(const Cell_handle& ch : new_cells)
+        for(const Cell_handle& new_ch : new_cells)
         {
-          // std::cout << "new cell has time stamp " << ch->time_stamp() << std::endl;
-          ch->is_outside() = m_tr.is_infinite(ch);
+          // std::cout << "new cell has time stamp " << new_ch->time_stamp() << std::endl;
+          new_ch->is_outside() = m_tr.is_infinite(new_ch);
         }
 
         // Push all new boundary facets to the queue.
@@ -1390,19 +1410,19 @@ class Alpha_wrap_3
         // because we need to handle internal facets, infinite facets, and also more subtle changes
         // such as a new cell being marked inside which now creates a boundary
         // with its incident "outside" flagged cell.
-        for(Cell_handle ch : new_cells)
+        for(Cell_handle new_ch : new_cells)
         {
           for(int i=0; i<4; ++i)
           {
-            if(m_tr.is_infinite(ch, i))
+            if(m_tr.is_infinite(new_ch, i))
               continue;
 
-            const Cell_handle nh = ch->neighbor(i);
-            if(nh->is_outside() == ch->is_outside()) // not on the boundary
+            const Cell_handle new_nh = new_ch->neighbor(i);
+            if(new_nh->is_outside() == new_ch->is_outside()) // not on the boundary
               continue;
 
-            const Facet boundary_f = std::make_pair(ch, i);
-            if(ch->is_outside())
+            const Facet boundary_f = std::make_pair(new_ch, i);
+            if(new_ch->is_outside())
               push_facet(boundary_f);
             else
               push_facet(m_tr.mirror_facet(boundary_f));
@@ -1411,14 +1431,13 @@ class Alpha_wrap_3
       }
       else // no need for a Steiner point, carve through and continue
       {
-        // tag neighbor as OUTSIDE
-        neighbor->is_outside() = true;
+        nh->is_outside() = true;
 
         // for each finite facet of neighbor, push it to the queue
         const int mi = m_tr.mirror_index(ch, s);
         for(int i=1; i<4; ++i)
         {
-          const Facet neighbor_f = std::make_pair(neighbor, (mi+i)&3);
+          const Facet neighbor_f = std::make_pair(nh, (mi+i)&3);
           push_facet(neighbor_f);
         }
       }
@@ -1590,6 +1609,10 @@ class Alpha_wrap_3
   {
     namespace PMP = Polygon_mesh_processing;
 
+#ifdef CGAL_AW3_DEBUG
+    std::cout << "> Make manifold..." << std::endl;
+#endif
+
     // This seems more harmful than useful after the priority queue has been introduced since
     // it adds a lot of flat cells into the triangulation, which then get added to the mesh
     // during manifoldness fixing.
@@ -1802,17 +1825,17 @@ class Alpha_wrap_3
 
     for(auto fit=m_tr.finite_facets_begin(), fend=m_tr.finite_facets_end(); fit!=fend; ++fit)
     {
-      Cell_handle c = fit->first;
+      Cell_handle ch = fit->first;
       int s = fit->second;
 
-      Cell_handle nc = c->neighbor(s);
-      if(only_boundary_faces && (c->is_outside() == nc->is_outside()))
+      Cell_handle nh = ch->neighbor(s);
+      if(only_boundary_faces && (ch->is_outside() == nh->is_outside()))
         continue;
 
       std::array<std::size_t, 3> ids;
       for(std::size_t pos=0; pos<3; ++pos)
       {
-        Vertex_handle v = c->vertex((s+pos+1)&3);
+        Vertex_handle v = ch->vertex((s+pos+1)&3);
         auto insertion_res = vertex_to_id.emplace(v, nv);
         if(insertion_res.second)
         {
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
index f017f9be8cf4..9c29ac9e7226 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
@@ -74,8 +74,8 @@ struct Less_gate
     //
     // The permissive facet are given highest priority because they need to be treated
     // regardless of their circumradius. Treating them first allow the part that depends
-    // on alpha to be treated uniformly in a way: whatever the alpha, we'll do the same
-    // first treatmen
+    // on alpha to be treated uniformly in a way: whatever the alpha, all scaffolding faces
+    // will first be treated
     if(a.is_permissive_facet() != b.is_permissive_facet())
       return a.is_permissive_facet();
 

From 48d2057f40309e576a31a28564def43fee81e183 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 10 Oct 2023 12:58:14 +0200
Subject: [PATCH 0852/1398] Add a third type of cell label to distinguish
 relabeling for manifoldness

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 139 +++++++++++-------
 .../Alpha_wrap_triangulation_cell_base_3.h    |  19 ++-
 2 files changed, 102 insertions(+), 56 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 2764546c3181..f22fbfaa1f31 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -438,6 +438,20 @@ class Alpha_wrap_3
     return bbox;
   }
 
+private:
+  // The distinction between inside boundary and outside boundary is the presence of cells
+  // being flagged for manifoldness: inside boundary considers those outside, and outside
+  // boundary considers them inside.
+  bool is_on_inside_boundary(Cell_handle ch, Cell_handle nh) const
+  {
+    return (ch->is_inside() != nh->is_inside()); // one is INSIDE, the other is not
+  }
+
+  bool is_on_outside_boundary(Cell_handle ch, Cell_handle nh) const
+  {
+    return (ch->is_outside() != nh->is_outside()); // one is OUTSIDE, the other is not
+  }
+
 private:
   // Adjust the bbox & insert its corners to construct the starting triangulation
   void insert_bbox_corners()
@@ -465,20 +479,20 @@ class Alpha_wrap_3
   // - Cells whose circumcenter is in the offset volume are inside: this is because
   // we need to have outside cell circumcenters outside of the volume to ensure
   // that the refinement point is separated from the existing point set.
-  bool cavity_cell_outside_tag(const Cell_handle ch)
+  Cell_label cavity_cell_label(const Cell_handle ch)
   {
     CGAL_precondition(!m_tr.is_infinite(ch));
 
     const Tetrahedron_with_outside_info<Geom_traits> tet(ch, geom_traits());
     if(m_oracle.do_intersect(tet))
-      return false;
+      return Cell_label::INSIDE;
 
     const Point_3& ch_cc = circumcenter(ch);
     typename Geom_traits::Construct_ball_3 ball = geom_traits().construct_ball_3_object();
     const Ball_3 ch_cc_offset_ball = ball(ch_cc, m_sq_offset);
     const bool is_cc_in_offset = m_oracle.do_intersect(ch_cc_offset_ball);
 
-    return !is_cc_in_offset;
+    return is_cc_in_offset ? Cell_label::INSIDE : Cell_label::OUTSIDE;
   }
 
   // Create a cavity using seeds rather than starting from the infinity.
@@ -631,16 +645,17 @@ class Alpha_wrap_3
       m_tr.incident_cells(seed_v, std::back_inserter(inc_cells));
 
       for(Cell_handle ch : inc_cells)
-        ch->is_outside() = cavity_cell_outside_tag(ch);
+        ch->label() = cavity_cell_label(ch);
     }
 
     // Should be cheap enough to go through the full triangulation as only seeds have been inserted
     for(Cell_handle ch : m_tr.all_cell_handles())
     {
-      if(!ch->is_outside())
+      if(ch->is_inside())
         continue;
 
-      // When the algorithm starts from a manually dug hole, infinite cells are tagged "inside"
+      // When the algorithm starts from a manually dug hole, infinite cells are initialized
+      // as INSIDE such that they do not appear on the boundary
       CGAL_assertion(!m_tr.is_infinite(ch));
 
       for(int i=0; i<4; ++i)
@@ -666,19 +681,26 @@ class Alpha_wrap_3
     {
       if(m_tr.is_infinite(ch))
       {
-        ch->is_outside() = true;
+        ch->label() = Cell_label::OUTSIDE;
         const int inf_index = ch->index(m_tr.infinite_vertex());
         push_facet(std::make_pair(ch, inf_index));
       }
       else
       {
-        ch->is_outside() = false;
+        ch->label() = Cell_label::INSIDE;
       }
     }
 
     return true;
   }
 
+  void reset_manifold_labels()
+  {
+    for(Cell_handle ch : m_tr.all_cell_handles())
+      if(ch->label() == Cell_label::MANIFOLD)
+        ch->label() = Cell_label::OUTSIDE;
+  }
+
   // This function is used in the case of resumption of a previous run: m_tr is not cleared,
   // and we fill the queue with the new parameters.
   bool initialize_from_existing_triangulation()
@@ -692,7 +714,7 @@ class Alpha_wrap_3
 
     for(Cell_handle ch : m_tr.all_cell_handles())
     {
-      if(!ch->is_outside())
+      if(ch->is_inside())
         continue;
 
       for(int i=0; i<4; ++i)
@@ -711,9 +733,24 @@ class Alpha_wrap_3
   }
 
 private:
-  void extract_boundary(std::vector<Point_3>& points,
-                        std::vector<std::array<std::size_t, 3> >& faces) const
+  template <typename OutputMesh, typename OVPM>
+  void extract_manifold_surface(OutputMesh& output_mesh,
+                                OVPM ovpm) const
   {
+    namespace PMP = Polygon_mesh_processing;
+
+#ifdef CGAL_AW3_DEBUG
+    std::cout << "> Extract manifold wrap... ()" << std::endl;
+#endif
+
+    CGAL_assertion_code(for(Vertex_handle v : m_tr.finite_vertex_handles()))
+    CGAL_assertion(!is_non_manifold(v));
+
+    clear(output_mesh);
+
+    std::vector<Point_3> points;
+    std::vector<std::array<std::size_t, 3> > faces;
+
     std::unordered_map<Vertex_handle, std::size_t> vertex_to_id;
 
     for(auto fit=m_tr.all_facets_begin(), fend=m_tr.all_facets_end(); fit!=fend; ++fit)
@@ -725,7 +762,7 @@ class Alpha_wrap_3
       const Cell_handle ch = f.first;
       const int s = f.second;
       const Cell_handle nh = ch->neighbor(s);
-      if(ch->is_outside() == nh->is_outside())
+      if(!is_on_outside_boundary(ch, nh))
         continue;
 
       std::array<std::size_t, 3> ids;
@@ -741,27 +778,12 @@ class Alpha_wrap_3
 
       faces.emplace_back(std::array<std::size_t, 3>{ids[0], ids[1], ids[2]});
     }
-  }
-
-  template <typename OutputMesh, typename OVPM>
-  void extract_manifold_surface(OutputMesh& output_mesh,
-                                OVPM ovpm) const
-  {
-    namespace PMP = Polygon_mesh_processing;
 
 #ifdef CGAL_AW3_DEBUG
-    std::cout << "> Extract manifold wrap... ()" << std::endl;
+    std::cout << "\t" << points.size() << " points" << std::endl;
+    std::cout << "\t" << faces.size() << " faces" << std::endl;
 #endif
 
-    CGAL_assertion_code(for(Vertex_handle v : m_tr.finite_vertex_handles()))
-    CGAL_assertion(!is_non_manifold(v));
-
-    clear(output_mesh);
-
-    std::vector<Point_3> points;
-    std::vector<std::array<std::size_t, 3> > faces;
-    extract_boundary(points, faces);
-
     if(faces.empty())
     {
 #ifdef CGAL_AW3_DEBUG
@@ -787,8 +809,8 @@ class Alpha_wrap_3
   }
 
   template <typename OutputMesh, typename OVPM>
-  void extract_possibly_non_manifold_surface(OutputMesh& output_mesh,
-                                             OVPM ovpm) const
+  void extract_inside_boundary(OutputMesh& output_mesh,
+                               OVPM ovpm) const
   {
     namespace PMP = Polygon_mesh_processing;
 
@@ -810,16 +832,20 @@ class Alpha_wrap_3
     std::map<Facet, std::size_t> facet_ids;
     std::size_t idx = 0;
 
+    // Looks identical to the block in extract_manifold_surface(), but there are
+    // two significant differences:
+    // - Boundary considers MANIFOLD outside here
+    // - There is no attempt to re-use the same vertex in multiple faces
     for(auto fit=m_tr.finite_facets_begin(), fend=m_tr.finite_facets_end(); fit!=fend; ++fit)
     {
       Facet f = *fit;
-      if(!f.first->is_outside())
+      if(f.first->is_inside()) // need f.first to be OUTSIDE or MANIFOLD
         f = m_tr.mirror_facet(f);
 
       const Cell_handle ch = f.first;
       const int s = f.second;
       const Cell_handle nh = ch->neighbor(s);
-      if(ch->is_outside() == nh->is_outside())
+      if(!is_on_inside_boundary(ch, nh)) // MANIFOLD here is outside
         continue;
 
       facet_ids[f] = idx / 3;
@@ -858,13 +884,13 @@ class Alpha_wrap_3
     for(auto fit=m_tr.all_facets_begin(), fend=m_tr.all_facets_end(); fit!=fend; ++fit)
     {
       Facet f = *fit;
-      if(!f.first->is_outside())
+      if(f.first->is_inside()) // f.first must be MANIFOLD or OUTSIDE
         f = m_tr.mirror_facet(f);
 
       const Cell_handle ch = f.first;
       const int s = f.second;
       const Cell_handle nh = ch->neighbor(s);
-      if(ch->is_outside() == nh->is_outside())
+      if(!is_on_inside_boundary(ch, nh)) // MANIFOLD here is outside
         continue;
 
       put(face_to_facet, i2f[idx++], f);
@@ -877,7 +903,7 @@ class Alpha_wrap_3
     {
       const Facet& tr_f = get(face_to_facet, f);
       const Cell_handle ch = tr_f.first;
-      CGAL_assertion(ch->is_outside());
+      CGAL_assertion(!ch->is_inside()); // OUTSIDE or MANIFOLD
 
       for(halfedge_descriptor h : halfedges_around_face(halfedge(f, output_mesh), output_mesh))
       {
@@ -922,18 +948,18 @@ class Alpha_wrap_3
           third_vh = curr_ch->vertex(facet_third_id);
           curr_ch = curr_ch->neighbor(Triangulation::next_around_edge(i,j));
 
-          if(!curr_ch->is_outside())
+          if(curr_ch->is_inside())
             break;
         }
         while(curr_ch != start_ch);
 
         CGAL_assertion(curr_ch != start_ch);
-        CGAL_assertion(!curr_ch->is_outside());
+        CGAL_assertion(curr_ch->is_inside());
 
         const int opp_id = 6 - (curr_ch->index(s_vh) + curr_ch->index(t_vh) + curr_ch->index(third_vh));
         const Facet tr_f2 = m_tr.mirror_facet(Facet(curr_ch, opp_id));
         CGAL_assertion(facet_ids.count(Facet(curr_ch, opp_id)) == 0);
-        CGAL_assertion(tr_f2.first->is_outside());
+        CGAL_assertion(!tr_f2.first->is_inside());
         CGAL_assertion(tr_f2.first->neighbor(tr_f2.second) == curr_ch);
         CGAL_assertion(tr_f2.first->has_vertex(s_vh) && tr_f2.first->has_vertex(t_vh));
 
@@ -972,7 +998,7 @@ class Alpha_wrap_3
                        const bool tolerate_non_manifoldness = false) const
   {
     if(tolerate_non_manifoldness)
-      extract_possibly_non_manifold_surface(output_mesh, ovpm);
+      extract_inside_boundary(output_mesh, ovpm);
     else
       extract_manifold_surface(output_mesh, ovpm);
   }
@@ -1115,8 +1141,9 @@ class Alpha_wrap_3
     // skip if neighbor is OUTSIDE or infinite
     const Cell_handle ch = f.first;
     const int id = f.second;
+    CGAL_precondition(ch->label() == Cell_label::INSIDE || ch->label() == Cell_label::OUTSIDE);
 
-    if(!ch->is_outside())
+    if(!ch->is_outside()) // INSIDE or MANIFOLD
     {
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
       std::cout << "Facet is inside" << std::endl;
@@ -1125,6 +1152,8 @@ class Alpha_wrap_3
     }
 
     const Cell_handle nh = ch->neighbor(id);
+    CGAL_precondition(ch->label() == Cell_label::INSIDE || ch->label() == Cell_label::OUTSIDE);
+
     if(m_tr.is_infinite(nh))
       return HAS_INFINITE_NEIGHBOR;
 
@@ -1301,6 +1330,7 @@ class Alpha_wrap_3
       CGAL_precondition(ch->is_outside());
 
       const Cell_handle nh = ch->neighbor(s);
+      CGAL_precondition(nh->label() == Cell_label::INSIDE || nh->label() == Cell_label::OUTSIDE);
 
 #ifdef CGAL_AW3_DEBUG_QUEUE
       static int fid = 0;
@@ -1338,7 +1368,7 @@ class Alpha_wrap_3
 
       if(m_tr.is_infinite(nh))
       {
-        nh->is_outside() = true;
+        nh->label() = Cell_label::OUTSIDE;
         continue;
       }
 
@@ -1402,7 +1432,7 @@ class Alpha_wrap_3
         for(const Cell_handle& new_ch : new_cells)
         {
           // std::cout << "new cell has time stamp " << new_ch->time_stamp() << std::endl;
-          new_ch->is_outside() = m_tr.is_infinite(new_ch);
+          new_ch->label() = m_tr.is_infinite(new_ch) ? Cell_label::OUTSIDE : Cell_label::INSIDE;
         }
 
         // Push all new boundary facets to the queue.
@@ -1418,7 +1448,7 @@ class Alpha_wrap_3
               continue;
 
             const Cell_handle new_nh = new_ch->neighbor(i);
-            if(new_nh->is_outside() == new_ch->is_outside()) // not on the boundary
+            if(new_nh->label() == new_ch->label()) // not on a boundary
               continue;
 
             const Facet boundary_f = std::make_pair(new_ch, i);
@@ -1431,7 +1461,7 @@ class Alpha_wrap_3
       }
       else // no need for a Steiner point, carve through and continue
       {
-        nh->is_outside() = true;
+        nh->label() = Cell_label::OUTSIDE;
 
         // for each finite facet of neighbor, push it to the queue
         const int mi = m_tr.mirror_index(ch, s);
@@ -1447,9 +1477,10 @@ class Alpha_wrap_3
 
     // Check that no useful facet has been ignored
     CGAL_postcondition_code(for(auto fit=m_tr.finite_facets_begin(), fend=m_tr.finite_facets_end(); fit!=fend; ++fit) {)
-    CGAL_postcondition_code(  if(fit->first->is_outside() == fit->first->neighbor(fit->second)->is_outside()) continue;)
+    CGAL_postcondition_code(  Cell_handle ch = fit->first; Cell_handle nh = fit->first->neighbor(fit->second); )
+    CGAL_postcondition_code(  if(ch->label() == nh->label()) continue;)
     CGAL_postcondition_code(  Facet f = *fit;)
-    CGAL_postcondition_code(  if(!fit->first->is_outside()) f = m_tr.mirror_facet(f);)
+    CGAL_postcondition_code(  if(ch->is_inside()) f = m_tr.mirror_facet(f);)
     CGAL_postcondition(       facet_status(f) == IRRELEVANT);
     CGAL_postcondition_code(})
 
@@ -1481,7 +1512,7 @@ class Alpha_wrap_3
       if(ic->is_outside())
         outside_start = ic;
       else if(inside_start == Cell_handle())
-        inside_start = ic;
+        inside_start = ic; // can be INSIDE or MANIFOLD
     }
 
     // fully inside / outside
@@ -1513,8 +1544,10 @@ class Alpha_wrap_3
         CGAL_assertion(neigh_c->has_vertex(v));
 
         if(neigh_c->tds_data().processed() ||
-           neigh_c->is_outside() != curr_c->is_outside()) // do not cross the boundary
+           is_on_outside_boundary(neigh_c, curr_c)) // do not cross the boundary
+        {
           continue;
+        }
 
         cells_to_visit.push(neigh_c);
       }
@@ -1640,9 +1673,9 @@ class Alpha_wrap_3
       return false;
     };
 
-    auto is_on_boundary = [](Cell_handle c, int i) -> bool
+    auto is_on_boundary = [&](Cell_handle c, int i) -> bool
     {
-      return (c->is_outside() != c->neighbor(i)->is_outside());
+      return is_on_outside_boundary(c, c->neighbor(i));
     };
 
     auto count_boundary_facets = [&](Cell_handle c, Vertex_handle v) -> int
@@ -1736,7 +1769,7 @@ class Alpha_wrap_3
         CGAL_assertion(!m_tr.is_infinite(ic));
 
         // This is where new material is added
-        ic->is_outside() = false;
+        ic->label() = Cell_label::MANIFOLD;
 
 #ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
         static int i = 0;
@@ -1829,7 +1862,7 @@ class Alpha_wrap_3
       int s = fit->second;
 
       Cell_handle nh = ch->neighbor(s);
-      if(only_boundary_faces && (ch->is_outside() == nh->is_outside()))
+      if(only_boundary_faces && ch->label() == nh->label())
         continue;
 
       std::array<std::size_t, 3> ids;
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
index b586d495f0d3..f5636b798795 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
@@ -20,6 +20,16 @@ namespace CGAL {
 namespace Alpha_wraps_3 {
 namespace internal {
 
+enum class Cell_label
+{
+  // Cells that have been carved
+  OUTSIDE,
+  // Cells that have not yet been carved
+  INSIDE,
+  // OUTSIDE cells that have been labeled "inside" again as to make the result manifold
+  MANIFOLD
+};
+
 template < typename GT,
            typename Cb = CGAL::Delaunay_triangulation_cell_base_with_circumcenter_3<GT> >
 class Alpha_wrap_triangulation_cell_base_3
@@ -29,6 +39,7 @@ class Alpha_wrap_triangulation_cell_base_3
   typedef typename Cb::Vertex_handle                   Vertex_handle;
   typedef typename Cb::Cell_handle                     Cell_handle;
 
+public:
   template < typename TDS2 >
   struct Rebind_TDS
   {
@@ -37,7 +48,7 @@ class Alpha_wrap_triangulation_cell_base_3
   };
 
 private:
-  bool outside = false;
+  Cell_label m_label = Cell_label::INSIDE;
 
 #ifndef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
   unsigned int m_erase_counter;
@@ -61,8 +72,10 @@ class Alpha_wrap_triangulation_cell_base_3
   {}
 
 public:
-  bool is_outside() const { return outside; }
-  bool& is_outside() { return outside; }
+  Cell_label label() const { return m_label; }
+  Cell_label& label() { return m_label; }
+  bool is_inside() const { return m_label == Cell_label::INSIDE; }
+  bool is_outside() const { return m_label == Cell_label::OUTSIDE; }
 
 #ifndef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
   unsigned int erase_counter() const

From 49f26abd65fae1e9248bdbc7d22c91eb2c6137c4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 10 Oct 2023 13:15:01 +0200
Subject: [PATCH 0853/1398] enum > enum class

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 27 ++++++++++---------
 1 file changed, 14 insertions(+), 13 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index f22fbfaa1f31..a6244eef2edd 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1098,7 +1098,7 @@ class Alpha_wrap_3
 
 private:
   // A permissive gate is a gate that we can traverse without checking its circumradius
-  enum Facet_queue_status
+  enum class Facet_status
   {
     IRRELEVANT = 0,
     HAS_INFINITE_NEIGHBOR, // the cell incident to the mirrored facet is infinite (permissive)
@@ -1106,7 +1106,7 @@ class Alpha_wrap_3
     TRAVERSABLE
   };
 
-  inline const char* get_status_message(const Facet_queue_status status)
+  inline const char* get_status_message(const Facet_status status)
   {
     constexpr std::size_t status_count = 4;
 
@@ -1127,7 +1127,7 @@ class Alpha_wrap_3
 public:
   // @speed some decent time may be spent constructing Facet (pairs) for no reason as it's always
   // just to grab the .first and .second as soon as it's constructed, and not due to API requirements
-  Facet_queue_status facet_status(const Facet& f) const
+  Facet_status facet_status(const Facet& f) const
   {
     CGAL_precondition(!m_tr.is_infinite(f));
 
@@ -1148,21 +1148,21 @@ class Alpha_wrap_3
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
       std::cout << "Facet is inside" << std::endl;
 #endif
-      return IRRELEVANT;
+      return Facet_status::IRRELEVANT;
     }
 
     const Cell_handle nh = ch->neighbor(id);
     CGAL_precondition(ch->label() == Cell_label::INSIDE || ch->label() == Cell_label::OUTSIDE);
 
     if(m_tr.is_infinite(nh))
-      return HAS_INFINITE_NEIGHBOR;
+      return Facet_status::HAS_INFINITE_NEIGHBOR;
 
     if(nh->is_outside())
     {
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
       std::cout << "Neighbor already outside" << std::endl;
 #endif
-      return IRRELEVANT;
+      return Facet_status::IRRELEVANT;
     }
 
     // push if facet is connected to scaffolding vertices
@@ -1175,7 +1175,7 @@ class Alpha_wrap_3
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
         std::cout << "Scaffolding facet due to vertex #" << i << std::endl;
 #endif
-        return SCAFFOLDING;
+        return Facet_status::SCAFFOLDING;
       }
     }
 
@@ -1185,13 +1185,13 @@ class Alpha_wrap_3
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
       std::cout << "traversable" << std::endl;
 #endif
-      return TRAVERSABLE;
+      return Facet_status::TRAVERSABLE;
     }
 
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
     std::cout << "not traversable" << std::endl;
 #endif
-    return IRRELEVANT;
+    return Facet_status::IRRELEVANT;
   }
 
 private:
@@ -1205,13 +1205,14 @@ class Alpha_wrap_3
       return false;
 #endif
 
-    const Facet_queue_status status = facet_status(f);
-    if(status == IRRELEVANT)
+    const Facet_status status = facet_status(f);
+    if(status == Facet_status::IRRELEVANT)
       return false;
 
 #ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
     const FT sqr = smallest_squared_radius_3(f, m_tr);
-    const bool is_permissive = (status == HAS_INFINITE_NEIGHBOR || status == SCAFFOLDING);
+    const bool is_permissive = (status == Facet_status::HAS_INFINITE_NEIGHBOR ||
+                                status == Facet_status::SCAFFOLDING);
     m_queue.resize_and_push(Gate(f, sqr, is_permissive));
 #else
     m_queue.push(Gate(f, m_tr));
@@ -1481,7 +1482,7 @@ class Alpha_wrap_3
     CGAL_postcondition_code(  if(ch->label() == nh->label()) continue;)
     CGAL_postcondition_code(  Facet f = *fit;)
     CGAL_postcondition_code(  if(ch->is_inside()) f = m_tr.mirror_facet(f);)
-    CGAL_postcondition(       facet_status(f) == IRRELEVANT);
+    CGAL_postcondition(       facet_status(f) == Facet_status::IRRELEVANT);
     CGAL_postcondition_code(})
 
     return true;

From 67e1b32c21d6c98320af26e2319fa09d94ac1539 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 10 Oct 2023 13:22:20 +0200
Subject: [PATCH 0854/1398] Do not recompute the queue when resuming

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 65 ++++++++++++-------
 1 file changed, 42 insertions(+), 23 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index a6244eef2edd..beb2bc7708cf 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -281,18 +281,16 @@ class Alpha_wrap_3
     const bool do_enforce_manifoldness = choose_parameter(get_parameter(in_np, internal_np::do_enforce_manifoldness), true);
 
     // This parameter enables avoiding recomputing the triangulation from scratch when wrapping
-    // the same meshes for multiple values of alpha (and typically the same offset values).
-    //
+    // the same input for multiple values of alpha (and typically the same offset values).
     // /!\ Warning /!\
     //
-    // If this is enabled, the 3D triangulation will NEVER be cleared and re-initialized
-    // at launch. This means that the triangulation is NOT cleared, even when:
-    // - the triangulation is empty; you will get nothing.
+    // If this is enabled, the 3D triangulation will NOT be re-initialized
+    // at launch. This means that the triangulation is NOT cleared, even if:
     // - you use an alpha value that is greater than what was used in a previous run; you will
-    //   obtain a denser result than what you might expect.
+    //   obtain the same result as the last run.
     // - you use a different offset value between runs, you might then get points that are not
-    //   on the offset surface corresponding to your latter offset value.
-    const bool resuming = choose_parameter(get_parameter(in_np, internal_np::refine_triangulation), false);
+    //   on the offset surface corresponding to that corresponding to the latter offset value.
+    const bool refining = choose_parameter(get_parameter(in_np, internal_np::refine_triangulation), false);
 
 #ifdef CGAL_AW3_TIMER
     CGAL::Real_timer t;
@@ -301,7 +299,7 @@ class Alpha_wrap_3
 
     visitor.on_alpha_wrapping_begin(*this);
 
-    if(!initialize(alpha, offset, seeds, resuming))
+    if(!initialize(alpha, offset, seeds, refining))
       return;
 
 #ifdef CGAL_AW3_TIMER
@@ -368,13 +366,14 @@ class Alpha_wrap_3
         if(ratio > 1.1) // more than 10% extra volume
           std::cerr << "Warning: large increase of volume after manifoldness resolution" << std::endl;
       }
-#endif
-    } // do_enforce_manifoldness
 
-#ifdef CGAL_AW3_TIMER
-    t.reset();
-    t.start();
+      std::size_t nm_cells_counter = 0;
+      for(Cell_handle ch : m_tr.all_cell_handles())
+        if(ch->label() == Cell_label::MANIFOLD)
+          ++nm_cells_counter;
+      std::cout << "Number of added cells: " << nm_cells_counter << std::endl;
 #endif
+    }
 
     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
 
@@ -1246,12 +1245,19 @@ class Alpha_wrap_3
   bool initialize(const double alpha,
                   const double offset,
                   const SeedRange& seeds,
-                  const bool resuming = false)
+                  const bool refining)
   {
 #ifdef CGAL_AW3_DEBUG
     std::cout << "> Initialize..." << std::endl;
-    std::cout << "Alpha: " << alpha << std::endl;
-    std::cout << "Offset: " << offset << std::endl;
+#endif
+
+    const bool resuming = refining && (alpha == m_alpha) && (offset == m_offset);
+
+#ifdef CGAL_AW3_DEBUG
+    std::cout << "\tAlpha: " << alpha << std::endl;
+    std::cout << "\tOffset: " << offset << std::endl;
+    std::cout << "\tRefining? " << refining << std::endl;
+    std::cout << "\tResuming? " << resuming << std::endl;
 #endif
 
     if(!is_positive(alpha) || !is_positive(offset))
@@ -1262,31 +1268,44 @@ class Alpha_wrap_3
       return false;
     }
 
-    if(resuming && alpha > m_alpha)
-      std::cerr << "Warning: resuming with an alpha greater than last iteration!" << std::endl;
-
-    if(resuming && offset != m_offset)
-      std::cerr << "Warning: resuming with a different offset!" << std::endl;
+    if(refining && alpha > m_alpha)
+      std::cerr << "Warning: refining with an alpha greater than the last iteration's!" << std::endl;
+    if(refining && offset != m_offset)
+      std::cerr << "Warning: refining with a different offset value!" << std::endl;
 
     m_alpha = FT(alpha);
     m_sq_alpha = square(m_alpha);
     m_offset = FT(offset);
     m_sq_offset = square(m_offset);
 
+    // Resuming means that we do not need to re-initialize the queue: either we have finished
+    // and there is nothing to do, or the interruption was due to a user callback in the visitor,
+    // and we can resume with the current queue
+    if(resuming)
+    {
+      reset_manifold_labels();
+      return true;
+    }
+
 #ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
     m_queue.clear();
 #else
     m_queue = { };
 #endif
 
-    if(resuming)
+    if(refining)
     {
+      // If we are re-using the triangulation, change the label of the extra elements
+      // that we have added to ensure a manifold result back to external (MANIFOLD -> OUTSIDE)
+      reset_manifold_labels();
+
       return initialize_from_existing_triangulation();
     }
     else
     {
       m_tr.clear();
 
+
       insert_bbox_corners();
 
       if(seeds.empty())

From c19799aa59ae4e1cab686b5b00b9a245c9cb8e55 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 10 Oct 2023 13:23:05 +0200
Subject: [PATCH 0855/1398] Move "go_further()" check up

So it doesn't purge zombies or print gate info that would not be refined
---
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h       | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index beb2bc7708cf..d61ca129ae21 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1327,6 +1327,9 @@ class Alpha_wrap_3
     // Explore all finite cells that are reachable from one of the initial outside cells.
     while(!m_queue.empty())
     {
+      if(!visitor.go_further(*this))
+        return false;
+
 #ifdef CGAL_AW3_DEBUG_QUEUE_PP
       check_queue_sanity();
 #endif
@@ -1379,9 +1382,6 @@ class Alpha_wrap_3
       face_out.close();
 #endif
 
-      if(!visitor.go_further(*this))
-        return false;
-
       visitor.before_facet_treatment(*this, gate);
 
       m_queue.pop();

From c87be44a8b973c16185c7fa029d0492d0c3e82f6 Mon Sep 17 00:00:00 2001
From: Daniel Funke <daniel.funke@kit.edu>
Date: Tue, 10 Oct 2023 16:26:42 +0200
Subject: [PATCH 0856/1398] ipelet for nearest neighbor graph

---
 CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt |  1 +
 .../demo/CGAL_ipelets/lua/libCGAL_nng.lua     | 24 ++++++++
 CGAL_ipelets/demo/CGAL_ipelets/nng.cpp        | 60 +++++++++++++++++++
 3 files changed, 85 insertions(+)
 create mode 100644 CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua
 create mode 100644 CGAL_ipelets/demo/CGAL_ipelets/nng.cpp

diff --git a/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt b/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
index f017575dd855..394b7dcb464d 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
+++ b/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
@@ -65,6 +65,7 @@ if(IPE_FOUND AND IPE_VERSION)
   set(CGAL_IPELETS ${CGAL_IPELETS} mesh_2)
   set(CGAL_IPELETS ${CGAL_IPELETS} minkowski)
   set(CGAL_IPELETS ${CGAL_IPELETS} mst)
+  set(CGAL_IPELETS ${CGAL_IPELETS} nng)
   set(CGAL_IPELETS ${CGAL_IPELETS} multi_delaunay)
   set(CGAL_IPELETS ${CGAL_IPELETS} multi_regular)
   set(CGAL_IPELETS ${CGAL_IPELETS} partition)
diff --git a/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua b/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua
new file mode 100644
index 000000000000..8b106dff10da
--- /dev/null
+++ b/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua
@@ -0,0 +1,24 @@
+----------------------------------------------------------------------
+-- CGAL MST ipelet description
+----------------------------------------------------------------------
+
+label = "Nearest-neighbor graph"
+
+about = [[
+This ipelet is part of the CGAL_ipelet package. See www.cgal.org.
+]]
+
+-- this variable will store the C++ ipelet when it has been loaded
+ipelet = false
+
+function run(model, num)
+  if not ipelet then ipelet = assert(ipe.Ipelet(dllname)) end
+  model:runIpelet(methods[num].label, ipelet, num)
+end
+
+methods = {
+  { label="NNG" },
+  { label="Help" },
+}
+
+----------------------------------------------------------------------
diff --git a/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp b/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
new file mode 100644
index 000000000000..82f778572467
--- /dev/null
+++ b/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
@@ -0,0 +1,60 @@
+// Copyright (c) 2018 Inria
+// All rights reserved.
+//
+//
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Daniel Funke
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Delaunay_triangulation_2.h>
+#include <CGAL/nearest_neighbor_delaunay_2.h>
+#include <CGAL/CGAL_Ipelet_base.h>
+
+namespace CGAL_nng {
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
+typedef CGAL::Delaunay_triangulation_2<Kernel>              Triangulation;
+
+const std::string Slab[] = {
+  "NNG", "Help"
+};
+
+const std::string Hmsg[] = {
+  "Draw the nearest-neighbor graph of a set of points"
+};
+
+struct nngIpelet
+  : CGAL::Ipelet_base<Kernel, 2> {
+  nngIpelet() : CGAL::Ipelet_base<Kernel, 2>("Nearest-neighbor graph", Slab, Hmsg){}
+  void protected_run(int);
+};
+
+void nngIpelet::protected_run(int /*fn*/)
+{
+  std::list<Point_2> pt_list;
+
+  read_active_objects(
+    CGAL::dispatch_or_drop_output<Point_2>(
+      std::back_inserter(pt_list)
+    )
+  );
+
+  if (pt_list.empty()) {
+    print_error_message("No mark selected");
+    return;
+  }
+
+  Triangulation t(pt_list.begin(), pt_list.end());
+
+  for(auto v = t.finite_vertices_begin();
+       v != t.finite_vertices_end();
+       ++v){
+
+    auto nn = CGAL::nearest_neighbor(t, v);
+    draw_in_ipe(Kernel::Segment_2(v->point(), nn->point()));
+  }
+}
+}
+
+CGAL_IPELET(CGAL_nng::nngIpelet)

From 68789a58b8425ae074e306812cd09f7965c4b15a Mon Sep 17 00:00:00 2001
From: Daniel Funke <daniel.funke@kit.edu>
Date: Tue, 10 Oct 2023 16:39:06 +0200
Subject: [PATCH 0857/1398] fix description

---
 CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua b/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua
index 8b106dff10da..fc1f46791784 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua
+++ b/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua
@@ -1,5 +1,5 @@
 ----------------------------------------------------------------------
--- CGAL MST ipelet description
+-- CGAL NNG ipelet description
 ----------------------------------------------------------------------
 
 label = "Nearest-neighbor graph"

From 14a306dff40f92556ae0f4f6d4b946f347dfe967 Mon Sep 17 00:00:00 2001
From: Daniel Funke <daniel.funke@kit.edu>
Date: Tue, 10 Oct 2023 16:43:00 +0200
Subject: [PATCH 0858/1398] add doc

---
 CGAL_ipelets/doc/CGAL_ipelets/CGAL_ipelets.txt | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/CGAL_ipelets/doc/CGAL_ipelets/CGAL_ipelets.txt b/CGAL_ipelets/doc/CGAL_ipelets/CGAL_ipelets.txt
index 9cbfa8e64fce..3025dc111555 100644
--- a/CGAL_ipelets/doc/CGAL_ipelets/CGAL_ipelets.txt
+++ b/CGAL_ipelets/doc/CGAL_ipelets/CGAL_ipelets.txt
@@ -248,6 +248,9 @@ The Minkowski sum of the polygons with the circle is computed and drawn.
 The input selection must be a set of points. The Euclidean minimum spanning
 tree of the points is computed and drawn.
 
+\subsection nng_ipelet Nearest-neighbor graph
+The input selection must be a set of points. The nearest-neighbor graph of the points is computed and drawn.
+
 \subsection multi_delaunay_ipelet k Order Delaunay
 The input selection must be a set of points.
 The order k Voronoi diagram or its dual the order k Delaunay is drawn.

From 48406930ca38a2b826323690c943944b8f8d9e02 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Wed, 11 Oct 2023 10:39:04 +0200
Subject: [PATCH 0859/1398] Remove double defgroup definition

Remove double defgroup definition
---
 Number_types/doc/Number_types/PackageDescription.txt | 3 ---
 1 file changed, 3 deletions(-)

diff --git a/Number_types/doc/Number_types/PackageDescription.txt b/Number_types/doc/Number_types/PackageDescription.txt
index 430ee8ad3882..84bfd6debbdc 100644
--- a/Number_types/doc/Number_types/PackageDescription.txt
+++ b/Number_types/doc/Number_types/PackageDescription.txt
@@ -18,9 +18,6 @@
 /// \defgroup nt_cgal CGAL Number Types
 /// \ingroup PkgNumberTypesRef
 
-/// \defgroup nt_cgal CGAL Number Types
-/// \ingroup PkgNumberTypesRef
-
 /// \defgroup nt_rrational Relates Rational
 /// \ingroup PkgNumberTypesRef
 

From a60ff3628563754cff0c1406c56248ccd28eea29 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Wed, 11 Oct 2023 11:02:24 +0200
Subject: [PATCH 0860/1398] No need for workaround for boost before version
 1.47

CGAL requires boost 1.66 or higher since CGAL-5.6.
---
 .../internal/random-forest/common-libraries.hpp     | 13 +------------
 1 file changed, 1 insertion(+), 12 deletions(-)

diff --git a/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp b/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp
index 6d2ebb01acfc..c62a2cddfcae 100644
--- a/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp
+++ b/Classification/include/CGAL/Classification/ETHZ/internal/random-forest/common-libraries.hpp
@@ -34,11 +34,7 @@
 #include <boost/bind/bind.hpp>
 #include <boost/ptr_container/ptr_vector.hpp>
 #include <boost/random/mersenne_twister.hpp>
-#if BOOST_VERSION >= 104700
-#  include <boost/random/uniform_int_distribution.hpp>
-#else
-#  include <boost/random/uniform_int.hpp>
-#endif
+#include <boost/random/uniform_int_distribution.hpp>
 #include <boost/random/uniform_01.hpp>
 #include <boost/random/normal_distribution.hpp>
 #if defined(CGAL_LINKED_WITH_BOOST_IOSTREAMS) && defined(CGAL_LINKED_WITH_BOOST_SERIALIZATION)
@@ -65,17 +61,10 @@ inline void init_feature_class_data(FeatureClassDataFloat& /*data*/, int /*n_cla
 }
 typedef std::unordered_set<int> FeatureSet;
 
-#if BOOST_VERSION >= 104700
 typedef boost::random::uniform_int_distribution<> UniformIntDist;
 typedef boost::random::normal_distribution<> NormalDist;
 typedef boost::random::mt19937 RandomGen;
 typedef boost::random::uniform_01<> UnitDist;
-#else
-typedef boost::uniform_int<> UniformIntDist;
-typedef boost::normal_distribution<> NormalDist;
-typedef boost::uniform_01<> UnitDist;
-typedef boost::mt19937 RandomGen;
-#endif
 
 struct ForestParams {
     size_t n_classes;

From e03116953432a8b0376060ce0ea189926f87155b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 11 Oct 2023 16:50:48 +0200
Subject: [PATCH 0861/1398] Fix merge issue

---
 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index c851ef559bcf..646ec7951e87 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1765,7 +1765,7 @@ class Alpha_wrap_3
       // one would need to sort again after each modification of is_outside() statuses.
       auto comparer = [&](Cell_handle l, Cell_handle r) -> bool
       {
-        CGAL_precondition(!m_dt.is_infinite(l) && !m_dt.is_infinite(r));
+        CGAL_precondition(!m_tr.is_infinite(l) && !m_tr.is_infinite(r));
 
         if(has_scaffolding_vertex(l) != has_scaffolding_vertex(r))
           return has_scaffolding_vertex(r);

From 1066a9622f8595982b26475d0d75427f583af193 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 11 Oct 2023 16:51:09 +0200
Subject: [PATCH 0862/1398] Only flag outside cells during manifold enforcement

Otherwise, it creates holes if we reset manifold flags...
---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h        | 12 ++++++++----
 1 file changed, 8 insertions(+), 4 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 646ec7951e87..4543277de725 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1777,15 +1777,19 @@ class Alpha_wrap_3
       inc_cells.reserve(64);
       m_tr.finite_incident_cells(v, std::back_inserter(inc_cells));
 
+      std::vector<Cell_handle> finite_outside_inc_cells;
+      finite_outside_inc_cells.reserve(64);
+      std::copy_if(inc_cells.begin(), inc_cells.end(), std::back_inserter(finite_outside_inc_cells),
+                   [&](Cell_handle c) -> bool { return !m_tr.is_infinite(c) && c->is_outside(); });
+
       // 'std::stable_sort' to have determinism without having to write something like:
       //     if(longest_edge(l) == longest_edge(r)) return ...
       // in the comparer. It's a small range, so the cost does not matter.
-      std::stable_sort(inc_cells.begin(), inc_cells.end(), comparer);
+      std::stable_sort(finite_outside_inc_cells.begin(), finite_outside_inc_cells.end(), comparer);
 
-      for(auto cit=inc_cells.begin(), cend=inc_cells.end(); cit!=cend; ++cit)
+      for(Cell_handle ic : finite_outside_inc_cells)
       {
-        Cell_handle ic = *cit;
-        CGAL_assertion(!m_tr.is_infinite(ic));
+        CGAL_assertion(!m_tr.is_infinite(ic) && ic->is_outside());
 
         // This is where new material is added
         ic->label() = Cell_label::MANIFOLD;

From 9d367d2862fed6e97511d1596ac04410dbabae7e Mon Sep 17 00:00:00 2001
From: Daniel Funke <daniel.funke@kit.edu>
Date: Thu, 12 Oct 2023 09:49:23 +0200
Subject: [PATCH 0863/1398] Update CGAL_ipelets/demo/CGAL_ipelets/nng.cpp

Co-authored-by: Laurent Rineau <Laurent.Rineau@cgal.org>
---
 CGAL_ipelets/demo/CGAL_ipelets/nng.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp b/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
index 82f778572467..be43dc45fd7a 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
+++ b/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
@@ -1,4 +1,4 @@
-// Copyright (c) 2018 Inria
+// Copyright (c) 2023 Inria
 // All rights reserved.
 //
 //

From 98a5f2f490129dfb11a5de5d43a4e1088b2871b8 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 12 Oct 2023 16:41:25 +0200
Subject: [PATCH 0864/1398] fix reading of vtp files

---
 Stream_support/include/CGAL/IO/polygon_soup_io.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Stream_support/include/CGAL/IO/polygon_soup_io.h b/Stream_support/include/CGAL/IO/polygon_soup_io.h
index 098d088680bb..74229da797e2 100644
--- a/Stream_support/include/CGAL/IO/polygon_soup_io.h
+++ b/Stream_support/include/CGAL/IO/polygon_soup_io.h
@@ -100,7 +100,7 @@ bool read_polygon_soup(const std::string& fname,
   else if(ext == "ts")
     return read_GOCAD(fname, points, polygons, np);
 #ifdef CGAL_USE_VTK
-  else if(ext == "ts")
+  else if(ext == "vtp")
     return read_VTP(fname, points, polygons, np);
 #endif
 

From 4c2bbb812dd3b9436c4e5484a6af8912f829daba Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 12 Oct 2023 16:41:41 +0200
Subject: [PATCH 0865/1398] remove a fake dependency

---
 Polyhedron/demo/Polyhedron/TextRenderer.cpp | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/TextRenderer.cpp b/Polyhedron/demo/Polyhedron/TextRenderer.cpp
index 95dc18463717..a2a97ae45fbe 100644
--- a/Polyhedron/demo/Polyhedron/TextRenderer.cpp
+++ b/Polyhedron/demo/Polyhedron/TextRenderer.cpp
@@ -1,7 +1,6 @@
 #include <CGAL/Three/TextRenderer.h>
 #include <CGAL/Three/Scene_item.h>
 #include <CGAL/Three/Scene_print_item_interface.h>
-#include "Scene_polyhedron_selection_item.h"
 void TextRenderer::draw(CGAL::Three::Viewer_interface *viewer, const QVector3D& scaler)
 {
     QPainter *painter = viewer->getPainter();

From ff095fe31e02469aadf473eebf147861b36d8615 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 12 Oct 2023 16:50:08 +0200
Subject: [PATCH 0866/1398] fix loading of a polygon mesh from VTK

- fix a memory leak
- allow to read a polygon soup, in addition to surface meshes
---
 .../Polyhedron/Plugins/IO/VTK_io_plugin.cpp   | 20 ++++++++++++++++---
 1 file changed, 17 insertions(+), 3 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/VTK_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/VTK_io_plugin.cpp
index e35576fc98fe..bf3f4bf54e9f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/VTK_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/VTK_io_plugin.cpp
@@ -39,7 +39,8 @@
 #include <CGAL/IO/Complex_3_in_triangulation_3_to_vtk.h>
 #include <CGAL/SMDS_3/tet_soup_to_c3t3.h>
 #include <CGAL/IO/output_to_vtu.h>
-#include <CGAL/boost/graph/io.h>
+#include <CGAL/boost/graph/IO/VTK.h>
+#include <CGAL/IO/VTK.h>
 
 #include <vtkSmartPointer.h>
 #include <vtkDataSetReader.h>
@@ -352,10 +353,23 @@ class Polyhedron_demo_vtk_plugin :
 
     if(is_polygon_mesh)
     {
-      FaceGraph* poly = new FaceGraph();
+      auto poly = std::make_unique<FaceGraph>();
+      Scene_item* poly_item = nullptr;
       if (CGAL::IO::internal::vtkPointSet_to_polygon_mesh(data, *poly, CGAL::parameters::default_values()))
       {
-        Scene_facegraph_item* poly_item = new Scene_facegraph_item(poly);
+        poly_item = new Scene_facegraph_item(poly.release());
+      } else {
+        poly.reset(nullptr);
+        std::vector<Point_3> points;
+        std::vector<std::vector<std::size_t> > polygons;
+        if (CGAL::IO::internal::vtkPointSet_to_polygon_soup(data, points, polygons, CGAL::parameters::default_values()))
+        {
+          auto soup_item = new Scene_polygon_soup_item();
+          soup_item->load(points, polygons);
+          poly_item = soup_item;
+        }
+      }
+      if(poly_item) {
         if(group)
         {
           poly_item->setName(QString("%1_faces").arg(fileinfo.baseName()));

From 318258963fd8dd71179aedd8ad9d3c7a403d1c13 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 13 Oct 2023 10:53:11 +0200
Subject: [PATCH 0867/1398] Add a generic, empty collect_garbage(Graph)

---
 BGL/include/CGAL/boost/graph/helpers.h | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/BGL/include/CGAL/boost/graph/helpers.h b/BGL/include/CGAL/boost/graph/helpers.h
index 76135fd82a7c..43016f9889fb 100644
--- a/BGL/include/CGAL/boost/graph/helpers.h
+++ b/BGL/include/CGAL/boost/graph/helpers.h
@@ -953,6 +953,11 @@ void swap_edges(const typename boost::graph_traits<FaceGraph>::halfedge_descript
   if (fo2 != nf && halfedge(fo2, g)==oh2) set_halfedge(fo2, oh1, g);
 }
 
+template <typename Graph>
+void collect_garbage(Graph&)
+{
+  // nothing by default
+}
 
 } //end of internal namespace
 

From 205fcff14156cb097c1c515e49c81cf53883eb82 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 13 Oct 2023 10:53:56 +0200
Subject: [PATCH 0868/1398] Make seeds a member of the wrapper

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 29 ++++++++-----------
 1 file changed, 12 insertions(+), 17 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 4543277de725..c781319c07e5 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -167,6 +167,8 @@ class Alpha_wrap_3
   using SC_Iso_cuboid_3 = SC::Iso_cuboid_3;
   using SC2GT = Cartesian_converter<SC, Geom_traits>;
 
+  using Seeds = std::vector<Point_3>;
+
 protected:
   Oracle m_oracle;
   SC_Iso_cuboid_3 m_bbox;
@@ -174,6 +176,8 @@ class Alpha_wrap_3
   FT m_alpha = FT(-1), m_sq_alpha = FT(-1);
   FT m_offset = FT(-1), m_sq_offset = FT(-1);
 
+  Seeds m_seeds;
+
   Triangulation m_tr;
 
   Alpha_PQ m_queue;
@@ -267,13 +271,7 @@ class Alpha_wrap_3
     Visitor visitor = choose_parameter(get_parameter_reference(in_np, internal_np::visitor), default_visitor);
 
     //
-    using Seeds = typename internal_np::Lookup_named_param_def<
-                    internal_np::seed_points_t,
-                    InputNamedParameters,
-                    std::vector<Point_3> >::reference;
-
-    std::vector<Point_3> no_seeds;
-    Seeds seeds = choose_parameter(get_parameter_reference(in_np, internal_np::seed_points), no_seeds);
+    m_seeds = choose_parameter(get_parameter_reference(in_np, internal_np::seed_points), Seeds());
 
     // Whether or not some cells should be reflagged as "inside" after the refinement+carving loop
     // as ended, as to ensure that the result is not only combinatorially manifold, but also
@@ -299,7 +297,7 @@ class Alpha_wrap_3
 
     visitor.on_alpha_wrapping_begin(*this);
 
-    if(!initialize(alpha, offset, seeds, refining))
+    if(!initialize(alpha, offset, refining))
       return;
 
 #ifdef CGAL_AW3_TIMER
@@ -530,15 +528,14 @@ class Alpha_wrap_3
   //
   // Another way is to simply make faces incident to the seed always traversable, and then
   // we only have to ensure faces opposite of the seed are traversable (i.e., radius ~= 1.65 * alpha)
-  template <typename SeedRange>
-  bool initialize_with_cavities(const SeedRange& seeds)
+  bool initialize_with_cavities()
   {
 #ifdef CGAL_AW3_DEBUG_INITIALIZATION
     std::cout << "> Dig cavities" << std::endl;
-    std::cout << seeds.size() << " seed(s)" << std::endl;
+    std::cout << m_seeds.size() << " seed(s)" << std::endl;
 #endif
 
-    CGAL_precondition(!seeds.empty());
+    CGAL_precondition(!m_seeds.empty());
 
     // Get a double value approximating the scaling factors
 //    std::cout << sqrt(3) * sin(2pi / 5) << std::endl;
@@ -547,7 +544,7 @@ class Alpha_wrap_3
     Iso_cuboid_3 bbox = SC2GT()(m_bbox);
 
     std::vector<Vertex_handle> seed_vs;
-    for(const Point_3& seed_p : seeds)
+    for(const Point_3& seed_p : m_seeds)
     {
 #ifdef CGAL_AW3_DEBUG_INITIALIZATION
       std::cout << "Initialize from seed " << seed_p << std::endl;
@@ -1241,10 +1238,8 @@ class Alpha_wrap_3
   }
 
 private:
-  template <typename SeedRange>
   bool initialize(const double alpha,
                   const double offset,
-                  const SeedRange& seeds,
                   const bool refining)
   {
 #ifdef CGAL_AW3_DEBUG
@@ -1308,10 +1303,10 @@ class Alpha_wrap_3
 
       insert_bbox_corners();
 
-      if(seeds.empty())
+      if(m_seeds.empty())
         return initialize_from_infinity();
       else
-        return initialize_with_cavities(seeds);
+        return initialize_with_cavities();
     }
   }
 

From 91c679234bef76e6c3bcbbd7e9224a5456fcecbf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 13 Oct 2023 10:56:58 +0200
Subject: [PATCH 0869/1398] Rename the builder class

---
 .../benchmark/Alpha_wrap_3/Quality/quality_benchmark.cpp    | 2 +-
 Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp    | 2 +-
 Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp     | 2 +-
 Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp      | 2 +-
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h       | 6 +++---
 Alpha_wrap_3/include/CGAL/alpha_wrap_3.h                    | 6 +++---
 .../test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp   | 4 ++--
 Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp  | 2 +-
 .../Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp | 2 +-
 9 files changed, 14 insertions(+), 14 deletions(-)

diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/quality_benchmark.cpp b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/quality_benchmark.cpp
index 4565cca641a1..f8e54c488a49 100644
--- a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/quality_benchmark.cpp
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Quality/quality_benchmark.cpp
@@ -21,7 +21,7 @@ using Mesh = CGAL::Surface_mesh<Point_3>;
 using face_descriptor = boost::graph_traits<Mesh>::face_descriptor;
 
 using Oracle = CGAL::Alpha_wraps_3::internal::Triangle_mesh_oracle<Kernel>;
-using Dt = CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle>::Triangulation;
+using Dt = CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle>::Triangulation;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
index fdba4de5f514..90b488e0407c 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/mixed_inputs_wrap.cpp
@@ -103,7 +103,7 @@ int main(int argc, char** argv)
   oracle.add_segment_soup(segments, CGAL::parameters::default_values());
   oracle.add_point_set(ps_points, CGAL::parameters::default_values());
 
-  CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle> aw3(oracle);
+  CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle> aw3(oracle);
 
   Mesh wrap;
   aw3(alpha, offset, wrap);
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
index f9b35f88b1f7..f8533fb9cda9 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
@@ -110,7 +110,7 @@ int main(int argc, char** argv)
   t.reset();
 
   using Oracle = CGAL::Alpha_wraps_3::internal::Triangle_mesh_oracle<K>;
-  using Wrapper = CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle>;
+  using Wrapper = CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle>;
   Wrapper wrapper; // contains the triangulation that is being refined iteratively
 
   for(std::size_t i=0; i<relative_alphas.size(); ++i)
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
index 3ac28de33022..ddc6f765612b 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/volumetric_wrap.cpp
@@ -103,7 +103,7 @@ int main(int argc, char** argv)
   Oracle oracle(K{});
   oracle.add_triangle_soup(points, faces, CGAL::parameters::default_values());
 
-  CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle, Delaunay_triangulation> aw3(oracle);
+  CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle, Delaunay_triangulation> aw3(oracle);
   Mesh wrap;
   aw3(alpha, offset, wrap);
 
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index c781319c07e5..1f7a9fdcbebb 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -115,7 +115,7 @@ struct Wrapping_default_visitor
 
 template <typename Oracle_,
           typename Triangulation_ = CGAL::Default>
-class Alpha_wrap_3
+class Alpha_wrapper_3
 {
   using Oracle = Oracle_;
 
@@ -183,7 +183,7 @@ class Alpha_wrap_3
   Alpha_PQ m_queue;
 
 public:
-  Alpha_wrap_3()
+  Alpha_wrapper_3()
 #ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
       // '4096' is an arbitrary, not-too-small value for the largest ID in queue initialization
     : m_queue(4096)
@@ -194,7 +194,7 @@ class Alpha_wrap_3
     static_assert(std::is_floating_point<FT>::value);
   }
 
-  Alpha_wrap_3(const Oracle& oracle)
+  Alpha_wrapper_3(const Oracle& oracle)
     :
 #ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
       m_queue(4096),
diff --git a/Alpha_wrap_3/include/CGAL/alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/alpha_wrap_3.h
index 638c5fb9fa17..8be78675422e 100644
--- a/Alpha_wrap_3/include/CGAL/alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/alpha_wrap_3.h
@@ -105,7 +105,7 @@ void alpha_wrap_3(const PointRange& points,
   using NP_helper = Point_set_processing_3_np_helper<PointRange, InputNamedParameters>;
   using Geom_traits = typename NP_helper::Geom_traits;
   using Oracle = Alpha_wraps_3::internal::Triangle_soup_oracle<Geom_traits>;
-  using AW3 = Alpha_wraps_3::internal::Alpha_wrap_3<Oracle>;
+  using AW3 = Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle>;
 
   Geom_traits gt = choose_parameter<Geom_traits>(get_parameter(in_np, internal_np::geom_traits));
 
@@ -254,7 +254,7 @@ void alpha_wrap_3(const TriangleMesh& tmesh,
 
   using Geom_traits = typename GetGeomTraits<TriangleMesh, InputNamedParameters>::type;
   using Oracle = Alpha_wraps_3::internal::Triangle_mesh_oracle<Geom_traits>;
-  using AW3 = Alpha_wraps_3::internal::Alpha_wrap_3<Oracle>;
+  using AW3 = Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle>;
 
   Geom_traits gt = choose_parameter<Geom_traits>(get_parameter(in_np, internal_np::geom_traits));
 
@@ -350,7 +350,7 @@ void alpha_wrap_3(const PointRange& points,
   using NP_helper = Point_set_processing_3_np_helper<PointRange, InputNamedParameters>;
   using Geom_traits = typename NP_helper::Geom_traits;
   using Oracle = Alpha_wraps_3::internal::Point_set_oracle<Geom_traits>;
-  using AW3 = Alpha_wraps_3::internal::Alpha_wrap_3<Oracle>;
+  using AW3 = Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle>;
 
   Geom_traits gt = choose_parameter<Geom_traits>(get_parameter(in_np, internal_np::geom_traits));
 
diff --git a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp
index 847799522f2a..af94eecd25ae 100644
--- a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp
+++ b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_cavity_initializations.cpp
@@ -28,7 +28,7 @@ void generate_random_seeds(const Oracle& oracle,
                            Seeds& seeds,
                            CGAL::Random& r)
 {
-  const auto bbox = CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle>(oracle).construct_bbox(offset);
+  const auto bbox = CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle>(oracle).construct_bbox(offset);
   const double sq_offset = CGAL::square(offset);
 
   while(seeds.size() < 3)
@@ -70,7 +70,7 @@ void alpha_wrap_triangle_mesh(Mesh& input_mesh,
 
   Oracle oracle;
   oracle.add_triangle_mesh(input_mesh);
-  AW3::internal::Alpha_wrap_3<Oracle> aw3(oracle);
+  AW3::internal::Alpha_wrapper_3<Oracle> aw3(oracle);
 
   if(seeds.empty())
     generate_random_seeds(oracle, offset, seeds, r);
diff --git a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp
index 739d131189cf..35a954f17b20 100644
--- a/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp
+++ b/Alpha_wrap_3/test/Alpha_wrap_3/test_AW3_multiple_calls.cpp
@@ -53,7 +53,7 @@ void alpha_wrap_triangle_soup(Points& pr,
   // AW3
   Oracle oracle;
   oracle.add_triangle_soup(pr, fr);
-  AW3::internal::Alpha_wrap_3<Oracle> aw3(oracle);
+  AW3::internal::Alpha_wrapper_3<Oracle> aw3(oracle);
 
   Mesh wrap;
   aw3(alpha, offset, wrap, CGAL::parameters::do_enforce_manifoldness(false));
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index e66d6c83dd3f..0ff34cc54ec3 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -35,7 +35,7 @@
 using TS_Oracle = CGAL::Alpha_wraps_3::internal::Triangle_soup_oracle<Kernel>;
 using SS_Oracle = CGAL::Alpha_wraps_3::internal::Segment_soup_oracle<Kernel, TS_Oracle>;
 using Oracle = CGAL::Alpha_wraps_3::internal::Point_set_oracle<Kernel, SS_Oracle>;
-using Wrapper = CGAL::Alpha_wraps_3::internal::Alpha_wrap_3<Oracle>;
+using Wrapper = CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle>;
 
 // Here is the pipeline for the interruption box:
 // - The main window is connected to a wrapping thread, which performs the wrapping.

From 76aeec9805e66f163a1216f48bfca1b439ea0817 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 13 Oct 2023 10:59:29 +0200
Subject: [PATCH 0870/1398] Replace try-catch with go_further()

---
 .../Alpha_wrap_3/Alpha_wrap_3_plugin.cpp      | 49 ++++++-------------
 1 file changed, 16 insertions(+), 33 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index 0ff34cc54ec3..f40130dedb12 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -40,8 +40,8 @@ using Wrapper = CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle>;
 // Here is the pipeline for the interruption box:
 // - The main window is connected to a wrapping thread, which performs the wrapping.
 // - The wrapping has a visitor, AW3_interrupter_visitor, which has a shared_ptr to a Boolean
-// - When the user clicks the box, the Boolean is switched to *false*, and the visitor throws
-// - The wrapping thread catches the exception, and creates the wip mesh
+// - When the user clicks the box, the Boolean is switched to *false*
+// - The wrapping thread creates the wip mesh
 
 // Here is the pipeline for the iterative visualization:
 // - The main window is connected to a wrapping thread, which performs the wrapping.
@@ -201,9 +201,6 @@ struct Iterative_AW3_visualization_visitor
   }
 };
 
-// Use a throw to get out of the AW3 refinement loop
-class Out_of_patience_exception : public std::exception { };
-
 template <typename BaseVisitor>
 struct AW3_interrupter_visitor
   : BaseVisitor
@@ -215,15 +212,10 @@ struct AW3_interrupter_visitor
     : BaseVisitor(base)
   { }
 
-  // Only overload this one because it gives a better state of the wrap (for other visitor calls,
-  // we often get tetrahedral spikes because there are scaffolding gates in the queue)
-  template <typename Wrapper, typename Point>
-  void before_Steiner_point_insertion(const Wrapper& wrapper, const Point& p)
+  template <typename Wrapper>
+  constexpr bool go_further(const Wrapper& wrapper)
   {
-    if(*should_stop)
-      throw Out_of_patience_exception();
-
-    return BaseVisitor::before_Steiner_point_insertion(wrapper, p);
+    return !(*should_stop);
   }
 };
 
@@ -273,25 +265,14 @@ struct Wrapper_thread
     QElapsedTimer elapsed_timer;
     elapsed_timer.start();
 
-    // try-catch because the stop visitor currently uses a throw
-    try
-    {
-      wrapper(alpha, offset, wrap,
-              CGAL::parameters::do_enforce_manifoldness(enforce_manifoldness)
-                               .visitor(visitor));
+    wrapper(alpha, offset, wrap,
+            CGAL::parameters::do_enforce_manifoldness(enforce_manifoldness)
+                             .visitor(visitor));
 
+    if(wrapper.queue().empty())
       Q_EMIT done(this);
-    }
-    catch(const Out_of_patience_exception&)
-    {
-      if(enforce_manifoldness)
-        wrapper.make_manifold();
-
-      // extract the wrap in its current state
-      wrapper.extract_surface(wrap, CGAL::get(CGAL::vertex_point, wrap), !enforce_manifoldness);
-
+    else
       Q_EMIT interrupted(this);
-    }
 
     std::cout << "Wrapping took " << elapsed_timer.elapsed() / 1000. << "s" << std::endl;
   }
@@ -761,10 +742,6 @@ public Q_SLOTS:
       return;
     }
 
-    // Switch from 'wait' to 'busy'
-    QApplication::restoreOverrideCursor();
-    QApplication::setOverrideCursor(Qt::BusyCursor);
-
     Q_FOREACH(int index, this->scene->selectionIndices())
     {
       Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(this->scene->item(index));
@@ -824,6 +801,10 @@ public Q_SLOTS:
     // Create message box with stop button
     if(use_message_box)
     {
+      // Switch from 'wait' to 'busy'
+      QApplication::restoreOverrideCursor();
+      QApplication::setOverrideCursor(Qt::BusyCursor);
+
       m_message_box = new QMessageBox(QMessageBox::NoIcon,
                                      "Wrapping",
                                      "Wrapping in progress...",
@@ -841,6 +822,8 @@ public Q_SLOTS:
     }
 
     // Actual start
+    QApplication::setOverrideCursor(Qt::WaitCursor);
+
     wrapper_thread->start();
 
     CGAL::Three::Three::getMutex()->lock();

From 4aa796bcabd6c82feb583672caa9ce2062a18119 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Fri, 13 Oct 2023 17:43:15 +0200
Subject: [PATCH 0871/1398] Only use subdomain's color when meshing from
 labeled images

---
 .../Plugins/Mesh_3/Mesh_3_plugin.cpp          |  2 +
 .../Polyhedron/Scene_triangulation_3_item.cpp | 41 ++++++++++++-------
 .../Polyhedron/Scene_triangulation_3_item.h   |  1 +
 3 files changed, 29 insertions(+), 15 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
index c17f4879f1dc..fe38afcb8b93 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
@@ -1035,6 +1035,8 @@ treat_result(Scene_item& source_item,
                             float((bbox.ymin() + bbox.ymax())/2.f),
                             float((bbox.zmin() + bbox.zmax())/2.f));
 
+    bool input_is_labeled_img = dynamic_cast<Scene_image_item*>(&source_item) != nullptr;
+    result_item->setUseSubdomainColors(input_is_labeled_img);
     result_item->setColor(source_item.color());
     result_item->setRenderingMode(source_item.renderingMode());
     result_item->set_data_item(&source_item);
diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
index 91e88fb6ae22..b9df46a5418d 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
@@ -493,6 +493,7 @@ struct Scene_triangulation_3_item_priv {
   QVector<QColor> colors;
   QVector<QColor> colors_subdomains;
   boost::dynamic_bitset<> visible_subdomain;
+  bool use_subdomain_colors = false;
   std::bitset<24> bs[4] = {16777215, 16777215, 16777215, 16777215};
   bool show_tetrahedra;
   bool is_aabb_tree_built;
@@ -884,30 +885,34 @@ Scene_triangulation_3_item_priv::compute_color_map(const QColor& c)
 {
   typedef Indices::size_type size_type;
 
-  const size_type nb_domains = subdomain_indices_.size();
-  double i = 0;
-  for (Indices::iterator it = subdomain_indices_.begin(),
-         end = subdomain_indices_.end(); it != end; ++it, i += 1.)
-  {
-    double hue = c.hueF() + 1. / double(nb_domains) * i;
-    if (hue > 1) { hue -= 1.; }
-    colors_subdomains[*it] = QColor::fromHsvF(hue, c.saturationF(), c.valueF());
-  }
   const size_type nb_patch_indices = surface_patch_indices_.size();
-  i = 0;
-  double patch_hsv_value = fmod(c.valueF() + .5, 1.);
+  double i = 0;
+  double patch_hsv_value = use_subdomain_colors ? fmod(c.valueF() + .5, 1.) : c.valueF();
   for (Indices::iterator it = surface_patch_indices_.begin(),
-         end = surface_patch_indices_.end(); it != end; ++it, i += 1.)
+       end = surface_patch_indices_.end(); it != end; ++it, i += 1.)
   {
     double hue = c.hueF() + 1. / double(nb_patch_indices) * i;
     if (hue > 1) { hue -= 1.; }
     colors[*it] = QColor::fromHsvF(hue, c.saturationF(), patch_hsv_value);
   }
 
-  for (std::unordered_map<int, int>::iterator it = visible_surface_patch_to_subdomain.begin(),
-       end = visible_surface_patch_to_subdomain.end(); it != end; ++it)
+  if (use_subdomain_colors)
   {
-    colors[it->first] = colors_subdomains[it->second];
+    const size_type nb_domains = subdomain_indices_.size();
+    i = 0;
+    for (Indices::iterator it = subdomain_indices_.begin(),
+           end = subdomain_indices_.end(); it != end; ++it, i += 1.)
+    {
+      double hue = c.hueF() + 1. / double(nb_domains) * i;
+      if (hue > 1) { hue -= 1.; }
+      colors_subdomains[*it] = QColor::fromHsvF(hue, c.saturationF(), c.valueF());
+    }
+
+    for (std::unordered_map<int, int>::iterator it = visible_surface_patch_to_subdomain.begin(),
+         end = visible_surface_patch_to_subdomain.end(); it != end; ++it)
+    {
+      colors[it->first] = colors_subdomains[it->second];
+    }
   }
 }
 
@@ -1526,6 +1531,12 @@ Scene_triangulation_3_item::setColor(QColor c)
   }
 }
 
+void
+Scene_triangulation_3_item::setUseSubdomainColors(bool b)
+{
+  d->use_subdomain_colors = b;
+}
+
 void Scene_triangulation_3_item::show_grid(bool b)
 {
   d->is_grid_shown = b;
diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
index 8cd2b81bd126..a57bf3396d26 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
@@ -43,6 +43,7 @@ using namespace CGAL::Three;
 
 
   void setColor(QColor c) Q_DECL_OVERRIDE;
+  void setUseSubdomainColors(bool use_subdomain_colors);
 
   void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
 

From 8f3cc5c86bc4367ad0975585f40c8a7c017b0d0f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 16 Oct 2023 10:18:01 +0200
Subject: [PATCH 0872/1398] Simplify volume check in make_manifold()

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 82 ++++++++++---------
 1 file changed, 42 insertions(+), 40 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 1f7a9fdcbebb..a3976a7ab55c 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -324,53 +324,18 @@ class Alpha_wrapper_3
 
     if(do_enforce_manifoldness)
     {
-#ifdef CGAL_AW3_DEBUG
-      extract_surface(output_mesh, ovpm, true /*tolerate non manifoldness*/);
-
- #ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
-      dump_triangulation_faces("carved_tr.off", false /*only_boundary_faces*/);
-      IO::write_polygon_mesh("carved_wrap.off", output_mesh,
-                             CGAL::parameters::vertex_point_map(ovpm).stream_precision(17));
- #endif
+      make_manifold();
 
-      FT base_vol = 0;
-      if(is_closed(output_mesh)) // might not be due to manifoldness
-        base_vol = PMP::volume(output_mesh, CGAL::parameters::vertex_point_map(ovpm));
-      else
-        std::cerr << "Warning: couldn't compute volume before manifoldness fixes (mesh is not closed)" << std::endl;
+#ifdef CGAL_AW3_DEBUG_DUMP_INTERMEDIATE_WRAPS
+      dump_triangulation_faces("manifold_wrap.off", true /*only_boundary_faces*/);
 #endif
 
-      make_manifold();
-
 #ifdef CGAL_AW3_TIMER
       t.stop();
       std::cout << "Manifoldness post-processing took: " << t.time() << " s." << std::endl;
       t.reset();
       t.start();
 #endif
-
-#ifdef CGAL_AW3_DEBUG
-      if(!is_zero(base_vol))
-      {
-        extract_surface(output_mesh, ovpm, false /*do not tolerate non-manifoldness*/);
-
-        const FT manifold_vol = PMP::volume(output_mesh, CGAL::parameters::vertex_point_map(ovpm));
-        const FT ratio = manifold_vol / base_vol;
-
-        std::cout << "Volumes post-manifoldness fix:\n"
-                  << "before: " << base_vol << "\n"
-                  << "after:  " << manifold_vol << "\n"
-                  << "ratio:  " << ratio << std::endl;
-        if(ratio > 1.1) // more than 10% extra volume
-          std::cerr << "Warning: large increase of volume after manifoldness resolution" << std::endl;
-      }
-
-      std::size_t nm_cells_counter = 0;
-      for(Cell_handle ch : m_tr.all_cell_handles())
-        if(ch->label() == Cell_label::MANIFOLD)
-          ++nm_cells_counter;
-      std::cout << "Number of added cells: " << nm_cells_counter << std::endl;
-#endif
     }
 
     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
@@ -1655,10 +1620,26 @@ class Alpha_wrapper_3
   // Not the best complexity, but it's very cheap compared to the rest of the algorithm.
   void make_manifold()
   {
-    namespace PMP = Polygon_mesh_processing;
-
 #ifdef CGAL_AW3_DEBUG
     std::cout << "> Make manifold..." << std::endl;
+
+    auto wrap_volume = [&]()
+    {
+      FT vol = 0;
+      for(Cell_handle ch : m_tr.all_cell_handles())
+        if(!ch->is_outside())
+          vol += volume(m_tr.point(ch, 0), m_tr.point(ch, 1), m_tr.point(ch, 2), m_tr.point(ch, 3));
+
+      return vol;
+    };
+
+ #ifdef CGAL_AW3_DEBUG_DUMP_INTERMEDIATE_WRAPS
+    dump_triangulation_faces("carved_tr.off", true /*only_boundary_faces*/);
+ #endif
+
+    FT base_vol = wrap_volume();
+    if(!is_positive(base_vol))
+      std::cerr << "Warning: empty wrap?" << std::endl;
 #endif
 
     // This seems more harmful than useful after the priority queue has been introduced since
@@ -1813,6 +1794,27 @@ class Alpha_wrapper_3
 
     CGAL_assertion_code(for(Vertex_handle v : m_tr.finite_vertex_handles()))
     CGAL_assertion(!is_non_manifold(v));
+
+#ifdef CGAL_AW3_DEBUG
+    std::size_t nm_cells_counter = 0;
+    for(Cell_handle ch : m_tr.all_cell_handles())
+      if(ch->label() == Cell_label::MANIFOLD)
+        ++nm_cells_counter;
+    std::cout << "Number of added cells: " << nm_cells_counter << std::endl;
+
+    if(!is_zero(base_vol))
+    {
+      const FT manifold_vol = wrap_volume();
+      const FT ratio = manifold_vol / base_vol;
+
+      std::cout << "Volumes post-manifoldness fix:\n"
+                << "before: " << base_vol << "\n"
+                << "after:  " << manifold_vol << "\n"
+                << "ratio:  " << ratio << std::endl;
+      if(ratio > 1.1) // more than 10% extra volume
+        std::cerr << "Warning: large increase of volume after manifoldness resolution" << std::endl;
+    }
+#endif
   }
 
 private:

From b67b389d63f686ba2932a7abdcd8eb8a3d0cf34b Mon Sep 17 00:00:00 2001
From: Daniel Funke <daniel.funke@kit.edu>
Date: Mon, 16 Oct 2023 10:40:00 +0200
Subject: [PATCH 0873/1398] move to kNNG

---
 .../demo/CGAL_ipelets/lua/libCGAL_nng.lua     |  4 ++--
 CGAL_ipelets/demo/CGAL_ipelets/nng.cpp        | 23 +++++++++++++++----
 2 files changed, 21 insertions(+), 6 deletions(-)

diff --git a/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua b/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua
index fc1f46791784..f9207b9b5629 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua
+++ b/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua
@@ -2,7 +2,7 @@
 -- CGAL NNG ipelet description
 ----------------------------------------------------------------------
 
-label = "Nearest-neighbor graph"
+label = "k-nearest-neighbor graph"
 
 about = [[
 This ipelet is part of the CGAL_ipelet package. See www.cgal.org.
@@ -17,7 +17,7 @@ function run(model, num)
 end
 
 methods = {
-  { label="NNG" },
+  { label="kNNG" },
   { label="Help" },
 }
 
diff --git a/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp b/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
index be43dc45fd7a..896d74f138aa 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
+++ b/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
@@ -11,17 +11,19 @@
 #include <CGAL/nearest_neighbor_delaunay_2.h>
 #include <CGAL/CGAL_Ipelet_base.h>
 
+#include <boost/format.hpp>
+
 namespace CGAL_nng {
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
 typedef CGAL::Delaunay_triangulation_2<Kernel>              Triangulation;
 
 const std::string Slab[] = {
-  "NNG", "Help"
+  "kNNG", "Help"
 };
 
 const std::string Hmsg[] = {
-  "Draw the nearest-neighbor graph of a set of points"
+  "Draw the k-nearest-neighbor graph of a set of points"
 };
 
 struct nngIpelet
@@ -45,15 +47,28 @@ void nngIpelet::protected_run(int /*fn*/)
     return;
   }
 
+  int ret_val;
+  int kNeighbors=1;
+
+  boost::tie(ret_val,kNeighbors)=request_value_from_user<int>((boost::format("Number of nearest neighbors (default : k=%1%)") % kNeighbors).str() );
+  if (ret_val == -1) return;
+  if (ret_val == 0) kNeighbors=1;
+
   Triangulation t(pt_list.begin(), pt_list.end());
 
   for(auto v = t.finite_vertices_begin();
        v != t.finite_vertices_end();
        ++v){
 
-    auto nn = CGAL::nearest_neighbor(t, v);
-    draw_in_ipe(Kernel::Segment_2(v->point(), nn->point()));
+    std::vector<Triangulation::Vertex_handle> kNN;
+    CGAL::nearest_neighbors(t, v, kNeighbors+1, std::back_inserter(kNN)); // +1 as v itself counts as its nearest neigbhor for CGAL::nearest_neighbors
+
+    for(const auto & nn : kNN) {
+      draw_in_ipe(Kernel::Segment_2(v->point(), nn->point()));
+    }
   }
+
+  group_selected_objects_();
 }
 }
 

From 1ab5e1de4a3b9847bd4c5aaa26cfea08202f681f Mon Sep 17 00:00:00 2001
From: Daniel Funke <daniel.funke@kit.edu>
Date: Mon, 16 Oct 2023 10:51:41 +0200
Subject: [PATCH 0874/1398] don't draw self-loops and don't create an empty
 group object

---
 CGAL_ipelets/demo/CGAL_ipelets/nng.cpp | 11 +++++++++--
 1 file changed, 9 insertions(+), 2 deletions(-)

diff --git a/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp b/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
index 896d74f138aa..09f54ea620c1 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
+++ b/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
@@ -56,6 +56,7 @@ void nngIpelet::protected_run(int /*fn*/)
 
   Triangulation t(pt_list.begin(), pt_list.end());
 
+  bool edgesDrawn = false;
   for(auto v = t.finite_vertices_begin();
        v != t.finite_vertices_end();
        ++v){
@@ -64,11 +65,17 @@ void nngIpelet::protected_run(int /*fn*/)
     CGAL::nearest_neighbors(t, v, kNeighbors+1, std::back_inserter(kNN)); // +1 as v itself counts as its nearest neigbhor for CGAL::nearest_neighbors
 
     for(const auto & nn : kNN) {
-      draw_in_ipe(Kernel::Segment_2(v->point(), nn->point()));
+      if(v->point() != nn->point()) {
+        draw_in_ipe(Kernel::Segment_2(v->point(), nn->point()));
+        edgesDrawn = true;
+      }
     }
   }
 
-  group_selected_objects_();
+  if(edgesDrawn) {
+    group_selected_objects_();
+    // don't create an empty group if no edges are drawn
+  }
 }
 }
 

From f43c4ec58abeb6d05afc642bc53684ed3669381a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 16 Oct 2023 11:05:48 +0200
Subject: [PATCH 0875/1398] Minor example fix

---
 Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp
index 9422e4d969be..970bb583484f 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/wrap_from_cavity.cpp
@@ -33,7 +33,7 @@ int main(int argc, char** argv)
 
   std::cout << "Input: " << num_vertices(input) << " vertices, " << num_faces(input) << " faces" << std::endl;
 
-  const double relative_alpha = (argc > 2) ? std::stod(argv[2]) : 30.;
+  const double relative_alpha = (argc > 2) ? std::stod(argv[2]) : 40.;
   const double relative_offset = (argc > 3) ? std::stod(argv[3]) : 600.;
 
   // Compute the alpha and offset values
@@ -66,7 +66,11 @@ int main(int argc, char** argv)
   std::cout << "Took " << t.time() << " s." << std::endl;
 
   // Save the result
-  const std::string output_name = generate_output_name(filename, relative_alpha, relative_offset);
+  std::string input_name = std::string(filename);
+  input_name = input_name.substr(input_name.find_last_of("/") + 1, input_name.length() - 1);
+  input_name = input_name.substr(0, input_name.find_last_of("."));
+  std::string output_name = input_name + "_cavity_" + std::to_string(static_cast<int>(relative_alpha))
+                            + "_" + std::to_string(static_cast<int>(relative_offset)) + ".off";
   std::cout << "Writing to " << output_name << std::endl;
   CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
 

From da6b202869a0a80b3f312d92e51d3b07e712b7ff Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 16 Oct 2023 11:06:11 +0200
Subject: [PATCH 0876/1398] Add a function to purge inner (useless) CCs

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 102 ++++++++++++++++--
 1 file changed, 96 insertions(+), 6 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index a3976a7ab55c..a1f82e6e3bd4 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -307,14 +307,22 @@ class Alpha_wrapper_3
     t.start();
 #endif
 
-#ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
-    extract_surface(output_mesh, ovpm, true /*tolerate non manifoldness*/);
-    CGAL::IO::write_polygon_mesh("starting_wrap.off", output_mesh,
-                                 CGAL::parameters::vertex_point_map(ovpm).stream_precision(17));
+#ifdef CGAL_AW3_DEBUG_DUMP_INTERMEDIATE_WRAPS
+    dump_triangulation_faces("starting_wrap.off", true /*only_boundary_faces*/);
 #endif
 
     alpha_flood_fill(visitor);
 
+#ifdef CGAL_AW3_DEBUG_DUMP_INTERMEDIATE_WRAPS
+    dump_triangulation_faces("flood_filled_wrap.off", true /*only_boundary_faces*/);
+#endif
+
+    purge_inner_islands();
+
+#ifdef CGAL_AW3_DEBUG_DUMP_INTERMEDIATE_WRAPS
+    dump_triangulation_faces("purged_wrap.off", true /*only_boundary_faces*/);
+#endif
+
 #ifdef CGAL_AW3_TIMER
     t.stop();
     std::cout << "Flood filling took: " << t.time() << " s." << std::endl;
@@ -330,6 +338,12 @@ class Alpha_wrapper_3
       dump_triangulation_faces("manifold_wrap.off", true /*only_boundary_faces*/);
 #endif
 
+      purge_inner_islands();
+
+#ifdef CGAL_AW3_DEBUG_DUMP_INTERMEDIATE_WRAPS
+      dump_triangulation_faces("purged_manifold_wrap.off", true /*only_boundary_faces*/);
+#endif
+
 #ifdef CGAL_AW3_TIMER
       t.stop();
       std::cout << "Manifoldness post-processing took: " << t.time() << " s." << std::endl;
@@ -349,8 +363,8 @@ class Alpha_wrapper_3
     std::cout << "Alpha wrap vertices:  " << vertices(output_mesh).size() << std::endl;
     std::cout << "Alpha wrap faces:     " << faces(output_mesh).size() << std::endl;
 
- #ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
-    IO::write_polygon_mesh("final.off", output_mesh, CGAL::parameters::stream_precision(17));
+ #ifdef CGAL_AW3_DEBUG_DUMP_INTERMEDIATE_WRAPS
+    IO::write_polygon_mesh("final_wrap.off", output_mesh, CGAL::parameters::stream_precision(17));
     dump_triangulation_faces("final_tr.off", false /*only_boundary_faces*/);
  #endif
 #endif
@@ -1467,6 +1481,82 @@ class Alpha_wrapper_3
     return true;
   }
 
+  // Any outside cell that isn't reachable from infinity is a cavity that can
+  // be discarded. This also removes some difficult non-manifoldness onfigurations
+  std::size_t purge_inner_islands()
+  {
+#ifdef CGAL_AW3_DEBUG
+    std::cout << "> Purge inner islands..." << std::endl;
+#endif
+
+    std::size_t label_change_counter = 0;
+
+    std::stack<Cell_handle> cells_to_visit;
+
+    if(!m_seeds.empty())
+    {
+      for(const Point_3& seed : m_seeds)
+      {
+        Locate_type lt;
+        int li, lj;
+        Cell_handle ch = m_tr.locate(seed, lt, li, lj);
+
+        if(!ch->is_outside())
+        {
+          std::cerr << "Warning: cell containing seed is not outside?!" << std::endl;
+          continue;
+        }
+
+        cells_to_visit.push(ch);
+      }
+    }
+    else // typical flooding from outside
+    {
+      std::stack<Cell_handle> cells_to_visit;
+      cells_to_visit.push(m_tr.infinite_vertex()->cell());
+    }
+
+    while(!cells_to_visit.empty())
+    {
+      Cell_handle curr_c = cells_to_visit.top();
+      cells_to_visit.pop();
+
+      CGAL_assertion(curr_c->is_outside());
+
+      if(curr_c->tds_data().processed())
+        continue;
+      curr_c->tds_data().mark_processed();
+
+      for(int j=0; j<4; ++j)
+      {
+        Cell_handle neigh_c = curr_c->neighbor(j);
+        if(neigh_c->tds_data().processed() || !neigh_c->is_outside())
+          continue;
+
+        cells_to_visit.push(neigh_c);
+      }
+    }
+
+    for(Cell_handle ch : m_tr.all_cell_handles())
+    {
+      if(ch->tds_data().is_clear() && ch->is_outside())
+      {
+        ch->label() = Cell_label::INSIDE;
+        ++label_change_counter;
+      }
+    }
+
+    // reset the conflict flags
+    for(Cell_handle ch : m_tr.all_cell_handles())
+      ch->tds_data().clear();
+
+#ifdef CGAL_AW3_DEBUG
+    std::cout << label_change_counter << " label changes" << std::endl;
+#endif
+
+    return label_change_counter;
+  }
+
 private:
   bool is_non_manifold(Vertex_handle v) const
   {

From c19975bef7190e6b6940a7faf89dfcad6bdc17f7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 16 Oct 2023 11:06:36 +0200
Subject: [PATCH 0877/1398] Revert to the previous non-manifold extraction code

Neither are able to produce a closed, combinatorial manifold surface
100% of the time, so minimize the diff.
---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 270 ++++++------------
 1 file changed, 87 insertions(+), 183 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index a1f82e6e3bd4..8192dd063d36 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -708,6 +708,91 @@ class Alpha_wrapper_3
   }
 
 private:
+  // Manifoldness is tolerated while debugging and extracting at intermediate states
+  // Not the preferred way because it uses 3*nv storage
+  template <typename OutputMesh, typename OVPM>
+  void extract_possibly_non_manifold_surface(OutputMesh& output_mesh,
+                                             OVPM ovpm) const
+  {
+    namespace PMP = Polygon_mesh_processing;
+
+#ifdef CGAL_AW3_DEBUG
+    std::cout << "> Extract possibly non-manifold wrap... ()" << std::endl;
+#endif
+
+    clear(output_mesh);
+
+    CGAL_assertion_code(for(auto cit=m_tr.finite_cells_begin(), cend=m_tr.finite_cells_end(); cit!=cend; ++cit))
+    CGAL_assertion(cit->tds_data().is_clear());
+
+    for(auto cit=m_tr.finite_cells_begin(), cend=m_tr.finite_cells_end(); cit!=cend; ++cit)
+    {
+      Cell_handle seed = cit;
+      if(seed->is_outside() || seed->tds_data().processed())
+        continue;
+
+      std::queue<Cell_handle> to_visit;
+      to_visit.push(seed);
+
+      std::vector<Point_3> points;
+      std::vector<std::vector<size_t> > faces;
+      std::size_t idx = 0;
+
+      while(!to_visit.empty())
+      {
+        const Cell_handle cell = to_visit.front();
+        CGAL_assertion(!cell->is_outside() && !m_tr.is_infinite(cell));
+
+        to_visit.pop();
+
+        if(cell->tds_data().processed())
+          continue;
+
+        cell->tds_data().mark_processed();
+
+        for(int fid=0; fid<4; ++fid)
+        {
+          const Cell_handle neighbor = cell->neighbor(fid);
+          if(neighbor->is_outside())
+          {
+            // There shouldn't be any artificial vertex on the inside/outside boundary
+            // (past initialization)
+//            CGAL_assertion(cell->vertex((fid + 1)&3)->type() == AW3i::Vertex_type:: DEFAULT);
+//            CGAL_assertion(cell->vertex((fid + 2)&3)->type() == AW3i::Vertex_type:: DEFAULT);
+//            CGAL_assertion(cell->vertex((fid + 3)&3)->type() == AW3i::Vertex_type:: DEFAULT);
+
+            points.push_back(m_tr.point(cell, Triangulation::vertex_triple_index(fid, 0)));
+            points.push_back(m_tr.point(cell, Triangulation::vertex_triple_index(fid, 1)));
+            points.push_back(m_tr.point(cell, Triangulation::vertex_triple_index(fid, 2)));
+            faces.push_back({idx, idx + 1, idx + 2});
+            idx += 3;
+          }
+          else
+          {
+            to_visit.push(neighbor);
+          }
+        }
+      }
+
+      CGAL_assertion(PMP::is_polygon_soup_a_polygon_mesh(faces));
+      PMP::polygon_soup_to_polygon_mesh(points, faces, output_mesh,
+                                        CGAL::parameters::default_values(),
+                                        CGAL::parameters::vertex_point_map(ovpm));
+
+      PMP::stitch_borders(output_mesh, CGAL::parameters::vertex_point_map(ovpm));
+      CGAL_assertion(is_closed(output_mesh));
+    }
+
+    for(auto cit=m_tr.finite_cells_begin(), cend=m_tr.finite_cells_end(); cit!=cend; ++cit)
+      cit->tds_data().clear();
+
+    CGAL_postcondition(!is_empty(output_mesh));
+    CGAL_postcondition(is_valid_polygon_mesh(output_mesh));
+    CGAL_postcondition(is_closed(output_mesh));
+
+    PMP::orient_to_bound_a_volume(output_mesh, CGAL::parameters::vertex_point_map(ovpm));
+  }
+
   template <typename OutputMesh, typename OVPM>
   void extract_manifold_surface(OutputMesh& output_mesh,
                                 OVPM ovpm) const
@@ -781,189 +866,8 @@ class Alpha_wrapper_3
     CGAL_postcondition(is_valid_polygon_mesh(output_mesh));
     CGAL_postcondition(is_closed(output_mesh));
     CGAL_postcondition(PMP::does_bound_a_volume(output_mesh, CGAL::parameters::vertex_point_map(ovpm)));
-  }
-
-  template <typename OutputMesh, typename OVPM>
-  void extract_inside_boundary(OutputMesh& output_mesh,
-                               OVPM ovpm) const
-  {
-    namespace PMP = Polygon_mesh_processing;
-
-    using vertex_descriptor = typename boost::graph_traits<OutputMesh>::vertex_descriptor;
-    using halfedge_descriptor = typename boost::graph_traits<OutputMesh>::halfedge_descriptor;
-    using face_descriptor = typename boost::graph_traits<OutputMesh>::face_descriptor;
-
-#ifdef CGAL_AW3_DEBUG
-    std::cout << "> Extract possibly non-manifold wrap... ()" << std::endl;
-#endif
-
-    clear(output_mesh);
-
-    std::vector<Point_3> points;
-    std::vector<std::array<std::size_t, 3> > polygons;
-
-    // Explode the polygon soup into indepent triangles, and stitch it back
-    // edge by edge by walking along the exterior
-    std::map<Facet, std::size_t> facet_ids;
-    std::size_t idx = 0;
-
-    // Looks identical to the block in extract_manifold_surface(), but there are
-    // two significant differences:
-    // - Boundary considers MANIFOLD outside here
-    // - There is no attempt to re-use the same vertex in multiple faces
-    for(auto fit=m_tr.finite_facets_begin(), fend=m_tr.finite_facets_end(); fit!=fend; ++fit)
-    {
-      Facet f = *fit;
-      if(f.first->is_inside()) // need f.first to be OUTSIDE or MANIFOLD
-        f = m_tr.mirror_facet(f);
-
-      const Cell_handle ch = f.first;
-      const int s = f.second;
-      const Cell_handle nh = ch->neighbor(s);
-      if(!is_on_inside_boundary(ch, nh)) // MANIFOLD here is outside
-        continue;
 
-      facet_ids[f] = idx / 3;
-
-      points.push_back(m_tr.point(ch, Triangulation::vertex_triple_index(s, 0)));
-      points.push_back(m_tr.point(ch, Triangulation::vertex_triple_index(s, 1)));
-      points.push_back(m_tr.point(ch, Triangulation::vertex_triple_index(s, 2)));
-      polygons.push_back({idx, idx + 1, idx + 2});
-
-      idx += 3;
-    }
-
-#ifdef CGAL_AW3_DEBUG
-    std::cout << "\t" << points.size() << " points" << std::endl;
-    std::cout << "\t" << polygons.size() << " polygons" << std::endl;
-#endif
-
-    if(polygons.empty())
-    {
-#ifdef CGAL_AW3_DEBUG
-      std::cerr << "Warning: empty wrap?..." << std::endl;
-#endif
-      return;
-    }
-
-    CGAL_assertion(PMP::is_polygon_soup_a_polygon_mesh(polygons));
-
-    std::unordered_map<std::size_t, face_descriptor> i2f;
-    PMP::polygon_soup_to_polygon_mesh(points, polygons, output_mesh,
-                                      CGAL::parameters::polygon_to_face_output_iterator(std::inserter(i2f, i2f.end())),
-                                      CGAL::parameters::vertex_point_map(ovpm));
-
-    auto face_to_facet = get(CGAL::dynamic_face_property_t<Facet>(), output_mesh);
-
-    idx = 0;
-    for(auto fit=m_tr.all_facets_begin(), fend=m_tr.all_facets_end(); fit!=fend; ++fit)
-    {
-      Facet f = *fit;
-      if(f.first->is_inside()) // f.first must be MANIFOLD or OUTSIDE
-        f = m_tr.mirror_facet(f);
-
-      const Cell_handle ch = f.first;
-      const int s = f.second;
-      const Cell_handle nh = ch->neighbor(s);
-      if(!is_on_inside_boundary(ch, nh)) // MANIFOLD here is outside
-        continue;
-
-      put(face_to_facet, i2f[idx++], f);
-    }
-
-    // grab the stitchable halfedges
-    std::vector<std::pair<halfedge_descriptor, halfedge_descriptor> > to_stitch;
-
-    for(face_descriptor f : faces(output_mesh))
-    {
-      const Facet& tr_f = get(face_to_facet, f);
-      const Cell_handle ch = tr_f.first;
-      CGAL_assertion(!ch->is_inside()); // OUTSIDE or MANIFOLD
-
-      for(halfedge_descriptor h : halfedges_around_face(halfedge(f, output_mesh), output_mesh))
-      {
-        const vertex_descriptor sv = source(h, output_mesh);
-        const vertex_descriptor tv = target(h, output_mesh);
-
-        // only need the pair of halfedges once
-        if(get(ovpm, sv) > get(ovpm, tv))
-          continue;
-
-        // One could avoid these point comparisons by using the fact that we know that the graph
-        // has faces built in a specific order (through BGL::add_face()), but it's better to make
-        // this code more generic (and it is not very costly).
-        auto graph_descriptor_to_triangulation_handle = [&](const vertex_descriptor v)
-        {
-          const Point_3& p = get(ovpm, v);
-          for(int i=0; i<4; ++i)
-            if(ch->vertex(i)->point() == p)
-              return ch->vertex(i);
-
-          CGAL_assertion(false);
-          return Vertex_handle();
-        };
-
-        const Vertex_handle s_vh = graph_descriptor_to_triangulation_handle(sv);
-        const Vertex_handle t_vh = graph_descriptor_to_triangulation_handle(tv);
-        CGAL_assertion(get(ovpm, sv) == m_tr.point(s_vh));
-        CGAL_assertion(get(ovpm, tv) == m_tr.point(t_vh));
-
-        const int facet_third_id = 6 - (ch->index(s_vh) + ch->index(t_vh) + tr_f.second); // 0 + 1 + 2 + 3 = 6
-        Vertex_handle third_vh = ch->vertex(facet_third_id);
-
-        // walk around the edge (in the exterior of the wrap) till meeting an inside cell
-        Cell_handle start_ch = ch, curr_ch = ch;
-        do
-        {
-          const int i = curr_ch->index(s_vh);
-          const int j = curr_ch->index(t_vh);
-
-          // the facet is incident to the outside cell, and we walk in the exterior
-          const int facet_third_id = 6 - (curr_ch->index(s_vh) + curr_ch->index(t_vh) + curr_ch->index(third_vh));
-          third_vh = curr_ch->vertex(facet_third_id);
-          curr_ch = curr_ch->neighbor(Triangulation::next_around_edge(i,j));
-
-          if(curr_ch->is_inside())
-            break;
-        }
-        while(curr_ch != start_ch);
-
-        CGAL_assertion(curr_ch != start_ch);
-        CGAL_assertion(curr_ch->is_inside());
-
-        const int opp_id = 6 - (curr_ch->index(s_vh) + curr_ch->index(t_vh) + curr_ch->index(third_vh));
-        const Facet tr_f2 = m_tr.mirror_facet(Facet(curr_ch, opp_id));
-        CGAL_assertion(facet_ids.count(Facet(curr_ch, opp_id)) == 0);
-        CGAL_assertion(!tr_f2.first->is_inside());
-        CGAL_assertion(tr_f2.first->neighbor(tr_f2.second) == curr_ch);
-        CGAL_assertion(tr_f2.first->has_vertex(s_vh) && tr_f2.first->has_vertex(t_vh));
-
-        const face_descriptor f2 = i2f[facet_ids.at(tr_f2)];
-        halfedge_descriptor h2 = halfedge(f2, output_mesh), done = h2;
-        while(get(ovpm, target(h2, output_mesh)) != get(ovpm, source(h, output_mesh)))
-        {
-          h2 = next(h2, output_mesh);
-          CGAL_assertion(h2 != done);
-          if(h2 == done)
-            break;
-        }
-
-        CGAL_assertion(get(ovpm, source(h, output_mesh)) == get(ovpm, target(h2, output_mesh)));
-        CGAL_assertion(get(ovpm, target(h, output_mesh)) == get(ovpm, source(h2, output_mesh)));
-        CGAL_assertion(get(ovpm, target(next(h2, output_mesh), output_mesh)) == m_tr.point(third_vh));
-
-        to_stitch.emplace_back(opposite(h, output_mesh), opposite(h2, output_mesh));
-      }
-    }
-
-    PMP::internal::stitch_halfedge_range(to_stitch, output_mesh, ovpm);
-
-    collect_garbage(output_mesh);
-
-    CGAL_postcondition(!is_empty(output_mesh));
-    CGAL_postcondition(is_valid_polygon_mesh(output_mesh));
-    CGAL_postcondition(is_closed(output_mesh));
-    CGAL_postcondition(PMP::does_bound_a_volume(output_mesh, CGAL::parameters::vertex_point_map(ovpm)));
+    PMP::orient_to_bound_a_volume(output_mesh, CGAL::parameters::vertex_point_map(ovpm));
   }
 
 public:
@@ -973,7 +877,7 @@ class Alpha_wrapper_3
                        const bool tolerate_non_manifoldness = false) const
   {
     if(tolerate_non_manifoldness)
-      extract_inside_boundary(output_mesh, ovpm);
+      extract_possibly_non_manifold_surface(output_mesh, ovpm);
     else
       extract_manifold_surface(output_mesh, ovpm);
   }

From d08f9f8a17fc2a5c3952448ef9aabd586fd4d41f Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 16 Oct 2023 12:28:11 +0200
Subject: [PATCH 0878/1398] improve doc about subdomain_index 0 in tetrahedral
 remeshing examples

---
 .../tetrahedral_remeshing_example.cpp         |  7 ++-
 .../tetrahedral_remeshing_generate_input.h    | 38 +-----------
 ...tetrahedral_remeshing_of_one_subdomain.cpp | 60 ++++++++++++++-----
 3 files changed, 51 insertions(+), 54 deletions(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp
index dc67ae6fa67d..71bdfde1f648 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp
@@ -19,7 +19,12 @@ int main(int argc, char* argv[])
   const std::size_t nbv = (argc > 2) ? atoi(argv[2]) : 1000;
 
   Remeshing_triangulation tr;
-  CGAL::Tetrahedral_remeshing::generate_input_one_subdomain(nbv, tr);
+  CGAL::Tetrahedral_remeshing::insert_random_points_in_sphere(nbv, tr);
+
+  /// A subdomain index 0 is considered outside and is not remeshed
+  /// so we set finite cells to a non-zero `Subdomain_index`
+  for (auto cell : tr.finite_cell_handles())
+    cell->set_subdomain_index(1);
 
   CGAL::tetrahedral_isotropic_remeshing(tr, target_edge_length);
 
diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h
index f0a9180b6553..a3c32b7e5f95 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h
@@ -22,40 +22,9 @@ namespace CGAL
 namespace Tetrahedral_remeshing
 {
   template<typename Tr>
-  void generate_input_two_subdomains(const std::size_t& nbv, Tr& tr)
+  void insert_random_points_in_sphere(const std::size_t& nbv, Tr& tr)
   {
     CGAL::Random rng;
-
-    typedef typename Tr::Point Point;
-    typedef typename Tr::Cell_handle Cell_handle;
-
-    while (tr.number_of_vertices() < nbv)
-      tr.insert(Point(rng.get_double(-1., 1.), rng.get_double(-1., 1.), rng.get_double(-1., 1.)));
-
-    using P = typename Tr::Geom_traits::Point_3;
-    const typename Tr::Geom_traits::Plane_3
-      plane(P(0, 0, 0), P(0, 1, 0), P(0, 0, 1));
-
-    for (Cell_handle c : tr.finite_cell_handles())
-    {
-      if (plane.has_on_positive_side(
-        CGAL::centroid(P(c->vertex(0)->point()),
-                       P(c->vertex(1)->point()),
-                       P(c->vertex(2)->point()),
-                       P(c->vertex(3)->point()))))
-        c->set_subdomain_index(1);
-      else
-        c->set_subdomain_index(2);
-    }
-    assert(tr.is_valid(true));
-  }
-
-
-  template<typename Tr>
-  void generate_input_one_subdomain(const std::size_t nbv, Tr& tr)
-  {
-    CGAL::Random rng;
-
     typedef typename Tr::Point Point;
     std::vector<Point> pts;
     while (pts.size() < nbv)
@@ -67,11 +36,6 @@ namespace Tetrahedral_remeshing
       pts.push_back(Point(x, y, z));
     }
     tr.insert(pts.begin(), pts.end());
-
-    for (typename Tr::Cell_handle c : tr.finite_cell_handles())
-      c->set_subdomain_index(1);
-
-    assert(tr.is_valid(true));
   }
 
   template<typename Tr>
diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
index 097b7955fb55..eab60bb50d63 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
@@ -5,29 +5,22 @@
 
 #include "tetrahedral_remeshing_generate_input.h"
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
-
-typedef CGAL::Tetrahedral_remeshing::Remeshing_triangulation_3<K> Remeshing_triangulation;
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
 
+using Remeshing_triangulation = CGAL::Tetrahedral_remeshing::Remeshing_triangulation_3<K>;
+using Subdomain_index = Remeshing_triangulation::Tds::Cell::Subdomain_index;
 
 template<typename Tr>
 struct Cells_of_subdomain_pmap
 {
-private:
-  using Cell_handle = typename Tr::Cell_handle;
-
   const int m_subdomain;
 
 public:
-  using key_type = Cell_handle;
+  using key_type = typename Tr::Cell_handle;
   using value_type = bool;
   using reference = bool;
   using category = boost::read_write_property_map_tag;
 
-  Cells_of_subdomain_pmap(const int& subdomain)
-    : m_subdomain(subdomain)
-  {}
-
   friend value_type get(const Cells_of_subdomain_pmap& map,
                         const key_type& c)
   {
@@ -41,17 +34,52 @@ struct Cells_of_subdomain_pmap
   }
 };
 
+Subdomain_index subdomain_on_side_of_plane(const K::Point_3& p,
+                                           const K::Plane_3& plane)
+{
+  if (plane.has_on_positive_side(p))
+    return 1;
+  else
+    return 2;
+}
+
+K::Point_3 centroid(const Remeshing_triangulation::Cell_handle c)
+{
+  return CGAL::centroid(c->vertex(0)->point(),
+                        c->vertex(1)->point(),
+                        c->vertex(2)->point(),
+                        c->vertex(3)->point());
+}
+
 int main(int argc, char* argv[])
 {
-  const double target_edge_length = (argc > 1) ? atof(argv[1]) : 0.1;
+  const double target_edge_length = (argc > 1) ? atof(argv[1]) : 0.05;
   const std::size_t nbv = (argc > 2) ? atoi(argv[2]) : 1000;
 
+  /// Create a randomly generated triangulation of a sphere
   Remeshing_triangulation tr;
-  CGAL::Tetrahedral_remeshing::generate_input_two_subdomains(nbv, tr);
+  CGAL::Tetrahedral_remeshing::insert_random_points_in_sphere(nbv, tr);
+
+  /// A subdomain index 0 is considered outside and is not remeshed
+  /// so we set finite cells to a non-zero `Subdomain_index`
+  /// (depending on the side of the plane they are on)
+  const K::Plane_3 plane(0, 0, 1, 0);
+  for (auto cell : tr.finite_cell_handles())
+  {
+    const K::Point_3 cc = centroid(cell);
+    cell->set_subdomain_index(subdomain_on_side_of_plane(cc, plane));
+  }
+
+  std::ofstream os0("before_remeshing.mesh");
+  CGAL::IO::write_MEDIT(os0, tr);
+
+  /// Remesh only the cells of subdomain 2
+  CGAL::tetrahedral_isotropic_remeshing(tr, target_edge_length);// ,
+//      CGAL::parameters::cell_is_selected_map(
+//        Cells_of_subdomain_pmap<Remeshing_triangulation>{2}));
 
-  CGAL::tetrahedral_isotropic_remeshing(tr, target_edge_length,
-      CGAL::parameters::cell_is_selected_map(
-        Cells_of_subdomain_pmap<Remeshing_triangulation>(2)));
+  std::ofstream os("after_remeshing.mesh");
+  CGAL::IO::write_MEDIT(os, tr);
 
   return EXIT_SUCCESS;
 }

From 999959d737c9c071b0f1a2996f30bd1f1a0c14a1 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 16 Oct 2023 13:04:23 +0200
Subject: [PATCH 0879/1398] rename function

---
 .../Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp   | 2 +-
 .../tetrahedral_remeshing_generate_input.h                    | 2 +-
 .../tetrahedral_remeshing_of_one_subdomain.cpp                | 4 +++-
 3 files changed, 5 insertions(+), 3 deletions(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp
index 71bdfde1f648..87f7de8cf350 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp
@@ -19,7 +19,7 @@ int main(int argc, char* argv[])
   const std::size_t nbv = (argc > 2) ? atoi(argv[2]) : 1000;
 
   Remeshing_triangulation tr;
-  CGAL::Tetrahedral_remeshing::insert_random_points_in_sphere(nbv, tr);
+  CGAL::Tetrahedral_remeshing::insert_random_points_in_cube(nbv, tr);
 
   /// A subdomain index 0 is considered outside and is not remeshed
   /// so we set finite cells to a non-zero `Subdomain_index`
diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h
index a3c32b7e5f95..4087bcd68b55 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h
@@ -22,7 +22,7 @@ namespace CGAL
 namespace Tetrahedral_remeshing
 {
   template<typename Tr>
-  void insert_random_points_in_sphere(const std::size_t& nbv, Tr& tr)
+  void insert_random_points_in_cube(const std::size_t& nbv, Tr& tr)
   {
     CGAL::Random rng;
     typedef typename Tr::Point Point;
diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
index eab60bb50d63..25721d0b2119 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
@@ -1,3 +1,5 @@
+#define CGAL_DUMP_REMESHING_STEPS
+
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <CGAL/Tetrahedral_remeshing/Remeshing_triangulation_3.h>
@@ -58,7 +60,7 @@ int main(int argc, char* argv[])
 
   /// Create a randomly generated triangulation of a sphere
   Remeshing_triangulation tr;
-  CGAL::Tetrahedral_remeshing::insert_random_points_in_sphere(nbv, tr);
+  CGAL::Tetrahedral_remeshing::insert_random_points_in_cube(nbv, tr);
 
   /// A subdomain index 0 is considered outside and is not remeshed
   /// so we set finite cells to a non-zero `Subdomain_index`

From 68b85e72ff2a3608852b2e7a7f9bdd950e2ac3f3 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 16 Oct 2023 13:15:04 +0200
Subject: [PATCH 0880/1398] insert points on midplane to get a better quality
 mesh

---
 .../tetrahedral_remeshing_generate_input.h      | 17 +++++++++++++++++
 .../tetrahedral_remeshing_of_one_subdomain.cpp  |  5 ++++-
 2 files changed, 21 insertions(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h
index 4087bcd68b55..723227061756 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_generate_input.h
@@ -38,6 +38,23 @@ namespace Tetrahedral_remeshing
     tr.insert(pts.begin(), pts.end());
   }
 
+  template<typename Plane, typename Tr>
+  void insert_points_on_plane(const Plane& plane, const std::size_t& nbv, Tr& tr)
+  {
+    CGAL::Random rng;
+    typedef typename Tr::Point Point;
+    std::vector<Point> pts;
+    while (pts.size() < nbv)
+    {
+      const double x = rng.get_double(-1., 1.);
+      const double y = rng.get_double(-1., 1.);
+      const double z = rng.get_double(-1., 1.);
+
+      pts.push_back(plane.projection(Point(x, y, z)));
+    }
+    tr.insert(pts.begin(), pts.end());
+  }
+
   template<typename Tr>
   void add_edge(typename Tr::Vertex_handle v1,
     typename Tr::Vertex_handle v2,
diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
index 25721d0b2119..266e9a12964f 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
@@ -62,10 +62,13 @@ int main(int argc, char* argv[])
   Remeshing_triangulation tr;
   CGAL::Tetrahedral_remeshing::insert_random_points_in_cube(nbv, tr);
 
+  /// Use vertical plane to split the mesh into two subdomains
+  const K::Plane_3 plane(0, 0, 1, 0);
+  CGAL::Tetrahedral_remeshing::insert_points_on_plane(plane, 0.1*nbv, tr);
+
   /// A subdomain index 0 is considered outside and is not remeshed
   /// so we set finite cells to a non-zero `Subdomain_index`
   /// (depending on the side of the plane they are on)
-  const K::Plane_3 plane(0, 0, 1, 0);
   for (auto cell : tr.finite_cell_handles())
   {
     const K::Point_3 cc = centroid(cell);

From e5c84bf099158c5cb8c69a879b0a4325e1aaf875 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 16 Oct 2023 13:18:57 +0100
Subject: [PATCH 0881/1398] Triangulation_2:   Add some () to function names in
 the User Manual

---
 .../doc/Triangulation_2/Triangulation_2.txt            | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
index 249c5a0117de..f232f1afcc82 100644
--- a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
+++ b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
@@ -742,8 +742,8 @@ The class `Regular_triangulation_2<Traits, Tds>`
 is designed to maintain the
 regular triangulation of a set of \f$ 2d\f$ weighted points.
 It derives from the class `Triangulation_2<Traits, Tds>`.
-The functions `insert` and
-`remove` are overwritten to handle weighted points
+The functions `insert()` and
+`remove()` are overwritten to handle weighted points
 and maintain the regular
 property.
 The function `move()` is not
@@ -1184,7 +1184,7 @@ classes.
 
 The class `Triangulation_hierarchy_2<Tr>` inherits from the
 triangulation type passed as template parameter `Tr`.
-The `insert`, `move`, and `remove` member functions
+The `insert()`, `move()`, and `remove()` member functions
 are overwritten to update the data structure at each operation.
 The locate queries are also overwritten to take advantage of the data
 structure for a fast processing.
@@ -1327,7 +1327,7 @@ data structure.
 
 The most efficient method to insert (weighted) points in a
 Delaunay (or regular) triangulation is to provide an iterator
-range over (weighted) points to the insert function. However, an iterator range of
+range over (weighted) points to the `insert()` function. However, an iterator range of
 (weighted) points does not allow the user to set different information to each vertex.
 To solve this problem, in the case the vertex type of the triangulation
 is a model of the concept `TriangulationVertexBaseWithInfo_2`
@@ -1339,7 +1339,7 @@ of the corresponding point given in the range.
 \subsection Triangulation_2UsinganIteratorOverPairs Using an Iterator Over Pairs
 
 Each point and its information are gathered into a pair. We provide
-the `insert` function of the triangulation with a range of such pairs.
+the `insert()` function of the triangulation with a range of such pairs.
 \cgalExample{Triangulation_2/info_insert_with_pair_iterator_2.cpp}
 
 \subsection Triangulation_2UsingtheBoostZipIterator Using the Boost Zip Iterator

From 3d6e53f1e476e439e941658918423742b5c99d94 Mon Sep 17 00:00:00 2001
From: Daniel Funke <daniel.funke@kit.edu>
Date: Mon, 16 Oct 2023 15:02:24 +0200
Subject: [PATCH 0882/1398] more expressive name

---
 CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt                 | 2 +-
 .../{libCGAL_nng.lua => libCGAL_nearest_neighbor_graph.lua}   | 2 +-
 .../demo/CGAL_ipelets/{nng.cpp => nearest_neighbor_graph.cpp} | 4 ++--
 3 files changed, 4 insertions(+), 4 deletions(-)
 rename CGAL_ipelets/demo/CGAL_ipelets/lua/{libCGAL_nng.lua => libCGAL_nearest_neighbor_graph.lua} (93%)
 rename CGAL_ipelets/demo/CGAL_ipelets/{nng.cpp => nearest_neighbor_graph.cpp} (94%)

diff --git a/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt b/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
index 394b7dcb464d..5d3554f42a4f 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
+++ b/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
@@ -65,7 +65,7 @@ if(IPE_FOUND AND IPE_VERSION)
   set(CGAL_IPELETS ${CGAL_IPELETS} mesh_2)
   set(CGAL_IPELETS ${CGAL_IPELETS} minkowski)
   set(CGAL_IPELETS ${CGAL_IPELETS} mst)
-  set(CGAL_IPELETS ${CGAL_IPELETS} nng)
+  set(CGAL_IPELETS ${CGAL_IPELETS} nearest_neighbor_graph)
   set(CGAL_IPELETS ${CGAL_IPELETS} multi_delaunay)
   set(CGAL_IPELETS ${CGAL_IPELETS} multi_regular)
   set(CGAL_IPELETS ${CGAL_IPELETS} partition)
diff --git a/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua b/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nearest_neighbor_graph.lua
similarity index 93%
rename from CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua
rename to CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nearest_neighbor_graph.lua
index f9207b9b5629..b46e8c771ca1 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nng.lua
+++ b/CGAL_ipelets/demo/CGAL_ipelets/lua/libCGAL_nearest_neighbor_graph.lua
@@ -17,7 +17,7 @@ function run(model, num)
 end
 
 methods = {
-  { label="kNNG" },
+  { label="k-nearest-neighbor graph" },
   { label="Help" },
 }
 
diff --git a/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp b/CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp
similarity index 94%
rename from CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
rename to CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp
index 09f54ea620c1..dba78413f75d 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/nng.cpp
+++ b/CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp
@@ -19,7 +19,7 @@ typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
 typedef CGAL::Delaunay_triangulation_2<Kernel>              Triangulation;
 
 const std::string Slab[] = {
-  "kNNG", "Help"
+    "k-nearest-neighbor graph", "Help"
 };
 
 const std::string Hmsg[] = {
@@ -28,7 +28,7 @@ const std::string Hmsg[] = {
 
 struct nngIpelet
   : CGAL::Ipelet_base<Kernel, 2> {
-  nngIpelet() : CGAL::Ipelet_base<Kernel, 2>("Nearest-neighbor graph", Slab, Hmsg){}
+  nngIpelet() : CGAL::Ipelet_base<Kernel, 2>("k-nearest-neighbor graph", Slab, Hmsg){}
   void protected_run(int);
 };
 

From 68627f4fb0aec65723c29d558b45480e731a0106 Mon Sep 17 00:00:00 2001
From: Daniel Funke <daniel.funke@kit.edu>
Date: Mon, 16 Oct 2023 15:02:41 +0200
Subject: [PATCH 0883/1398] help message

---
 CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp | 8 +++++++-
 1 file changed, 7 insertions(+), 1 deletion(-)

diff --git a/CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp b/CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp
index dba78413f75d..32cec4460dd4 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp
+++ b/CGAL_ipelets/demo/CGAL_ipelets/nearest_neighbor_graph.cpp
@@ -32,8 +32,14 @@ struct nngIpelet
   void protected_run(int);
 };
 
-void nngIpelet::protected_run(int /*fn*/)
+void nngIpelet::protected_run(int fn)
 {
+
+  if(fn == 1){
+    show_help();
+    return;
+  }
+
   std::list<Point_2> pt_list;
 
   read_active_objects(

From 29846572e3fcd3eb7b59b19c7e78d07d879456b9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 16 Oct 2023 16:56:46 +0200
Subject: [PATCH 0884/1398] Increment erase counter for cells changing labels
 during flooding

Makes it easier to detect faces that no longer need
to be treated (zombies).
---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 28 +++++++++++++------
 .../Alpha_wrap_triangulation_cell_base_3.h    |  2 +-
 2 files changed, 20 insertions(+), 10 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 8192dd063d36..b4be5907d1cb 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -620,7 +620,7 @@ class Alpha_wrapper_3
       m_tr.incident_cells(seed_v, std::back_inserter(inc_cells));
 
       for(Cell_handle ch : inc_cells)
-        ch->label() = cavity_cell_label(ch);
+        ch->set_label(cavity_cell_label(ch));
     }
 
     // Should be cheap enough to go through the full triangulation as only seeds have been inserted
@@ -656,13 +656,13 @@ class Alpha_wrapper_3
     {
       if(m_tr.is_infinite(ch))
       {
-        ch->label() = Cell_label::OUTSIDE;
+        ch->set_label(Cell_label::OUTSIDE);
         const int inf_index = ch->index(m_tr.infinite_vertex());
         push_facet(std::make_pair(ch, inf_index));
       }
       else
       {
-        ch->label() = Cell_label::INSIDE;
+        ch->set_label(Cell_label::INSIDE);
       }
     }
 
@@ -671,9 +671,10 @@ class Alpha_wrapper_3
 
   void reset_manifold_labels()
   {
+    // No erase counter increment, or it will mess up with a possibly non-empty queue.
     for(Cell_handle ch : m_tr.all_cell_handles())
       if(ch->label() == Cell_label::MANIFOLD)
-        ch->label() = Cell_label::OUTSIDE;
+        ch->set_label(Cell_label::OUTSIDE);
   }
 
   // This function is used in the case of resumption of a previous run: m_tr is not cleared,
@@ -1266,7 +1267,10 @@ class Alpha_wrapper_3
 
       if(m_tr.is_infinite(nh))
       {
-        nh->label() = Cell_label::OUTSIDE;
+        nh->set_label(Cell_label::OUTSIDE);
+#ifndef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+        nh->increment_erase_counter();
+#endif
         continue;
       }
 
@@ -1330,7 +1334,7 @@ class Alpha_wrapper_3
         for(const Cell_handle& new_ch : new_cells)
         {
           // std::cout << "new cell has time stamp " << new_ch->time_stamp() << std::endl;
-          new_ch->label() = m_tr.is_infinite(new_ch) ? Cell_label::OUTSIDE : Cell_label::INSIDE;
+          new_ch->set_label(m_tr.is_infinite(new_ch) ? Cell_label::OUTSIDE : Cell_label::INSIDE);
         }
 
         // Push all new boundary facets to the queue.
@@ -1359,7 +1363,10 @@ class Alpha_wrapper_3
       }
       else // no need for a Steiner point, carve through and continue
       {
-        nh->label() = Cell_label::OUTSIDE;
+        nh->set_label(Cell_label::OUTSIDE);
+#ifndef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+        nh->increment_erase_counter();
+#endif
 
         // for each finite facet of neighbor, push it to the queue
         const int mi = m_tr.mirror_index(ch, s);
@@ -1445,7 +1452,10 @@ class Alpha_wrapper_3
     {
       if(ch->tds_data().is_clear() && ch->is_outside())
       {
-        ch->label() = Cell_label::INSIDE;
+        ch->set_label(Cell_label::INSIDE);
+#ifndef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+        ch->increment_erase_counter();
+#endif
         ++label_change_counter;
       }
     }
@@ -1762,7 +1772,7 @@ class Alpha_wrapper_3
         CGAL_assertion(!m_tr.is_infinite(ic) && ic->is_outside());
 
         // This is where new material is added
-        ic->label() = Cell_label::MANIFOLD;
+        ic->set_label(Cell_label::MANIFOLD);
 
 #ifdef CGAL_AW3_DEBUG_DUMP_EVERY_STEP
         static int i = 0;
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
index f5636b798795..efaeb82d330f 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_triangulation_cell_base_3.h
@@ -73,7 +73,7 @@ class Alpha_wrap_triangulation_cell_base_3
 
 public:
   Cell_label label() const { return m_label; }
-  Cell_label& label() { return m_label; }
+  void set_label(const Cell_label label) { m_label = label; }
   bool is_inside() const { return m_label == Cell_label::INSIDE; }
   bool is_outside() const { return m_label == Cell_label::OUTSIDE; }
 

From 8f409f03ffc856393e7d6d0b2d04b4ee570fce96 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 16 Oct 2023 16:57:45 +0200
Subject: [PATCH 0885/1398] Avoid producing a mesh with garbage in the
 non-manifold case

---
 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index b4be5907d1cb..a986e5c6a38a 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -792,6 +792,8 @@ class Alpha_wrapper_3
     CGAL_postcondition(is_closed(output_mesh));
 
     PMP::orient_to_bound_a_volume(output_mesh, CGAL::parameters::vertex_point_map(ovpm));
+
+    collect_garbage(output_mesh);
   }
 
   template <typename OutputMesh, typename OVPM>

From 00acf4f75203ea95dd628b8e65018b599b5f7d96 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 16 Oct 2023 16:58:17 +0200
Subject: [PATCH 0886/1398] Fix compilation after change of Facet_status to
 strong enum

---
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h        | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index a986e5c6a38a..fc580aa561ce 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1000,10 +1000,11 @@ class Alpha_wrapper_3
       "Traversable facet"
     };
 
-    if(status > status_count || status < 0)
+    const std::size_t status_id = static_cast<std::size_t>(status);
+    if(status_id > status_count || status_id < 0)
       return "Unknown status";
     else
-      return message[status];
+      return message[status_id];
   }
 
 public:

From 116bb2beb9a6fda4e055779fde54b9730a77bf43 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 16 Oct 2023 17:00:57 +0200
Subject: [PATCH 0887/1398] Fix shadowing variable

---
 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index fc580aa561ce..675e6e303944 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1426,7 +1426,6 @@ class Alpha_wrapper_3
     }
     else // typical flooding from outside
     {
-      std::stack<Cell_handle> cells_to_visit;
       cells_to_visit.push(m_tr.infinite_vertex()->cell());
     }
 

From 18154a758b5ad165d96b83ddb25717f4b093c7d7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 16 Oct 2023 17:02:05 +0200
Subject: [PATCH 0888/1398] Loop only finite faces in the volume computation

For outward wrapping
---
 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 675e6e303944..31870dd01470 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1632,7 +1632,7 @@ class Alpha_wrapper_3
     auto wrap_volume = [&]()
     {
       FT vol = 0;
-      for(Cell_handle ch : m_tr.all_cell_handles())
+      for(Cell_handle ch : m_tr.finite_cell_handles())
         if(!ch->is_outside())
           vol += volume(m_tr.point(ch, 0), m_tr.point(ch, 1), m_tr.point(ch, 2), m_tr.point(ch, 3));
 

From b1ffdb00e1196675950864a2a21f90f49c35fbc5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 16 Oct 2023 17:04:00 +0200
Subject: [PATCH 0889/1398] Add an example of pausing and restarting a wrapping
 process

---
 .../examples/Alpha_wrap_3/CMakeLists.txt      |   3 +-
 .../pause_and_resume_wrapping.cpp             | 164 ++++++++++++++++++
 2 files changed, 166 insertions(+), 1 deletion(-)
 create mode 100644 Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt b/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt
index 34674777b401..40187ca194cb 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/CMakeLists.txt
@@ -12,5 +12,6 @@ create_single_source_cgal_program("triangle_soup_wrap.cpp")
 create_single_source_cgal_program("point_set_wrap.cpp")
 create_single_source_cgal_program("wrap_from_cavity.cpp")
 create_single_source_cgal_program("mixed_inputs_wrap.cpp")
-create_single_source_cgal_program("successive_wraps.cpp")
 create_single_source_cgal_program("volumetric_wrap.cpp")
+create_single_source_cgal_program("successive_wraps.cpp")
+create_single_source_cgal_program("pause_and_resume_wrapping.cpp")
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp
new file mode 100644
index 000000000000..5663bce16847
--- /dev/null
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp
@@ -0,0 +1,164 @@
+// This example demonstrates how to interrupt the wrapping process before it has terminated,
+// and how to resume afterwards.
+//
+// -------------------------------- !! Warning !! --------------------------------------------------
+// By default, the wrap uses an unsorted LIFO queue of faces to refine. This means that
+// the intermediate result is not very useful because the algorithm carves deep and not wide
+// (somewhat like a DFS vs a BFS).
+//
+// The sorted queue option is enabled with the macro below to make the refinement algorithm
+// more uniform. The downside is that it is slower.
+// -------------------------------------------------------------------------------------------------
+#define CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+
+#include "output_helper.h"
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/alpha_wrap_3.h>
+#include <CGAL/IO/polygon_soup_io.h>
+#include <CGAL/Polygon_mesh_processing/measure.h>
+#include <CGAL/Random.h>
+#include <CGAL/Timer.h>
+
+#include <iostream>
+#include <string>
+
+namespace AW3 = CGAL::Alpha_wraps_3;
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Point_3 = K::Point_3;
+
+using Points = std::vector<Point_3>;
+using Polygon = std::array<std::size_t, 3>;
+using Polygons = std::vector<Polygon>;
+
+using Mesh = CGAL::Surface_mesh<Point_3>;
+using face_descriptor = boost::graph_traits<Mesh>::face_descriptor;
+
+struct Interrupter_visitor
+  : public AW3::internal::Wrapping_default_visitor
+{
+  using Base = AW3::internal::Wrapping_default_visitor;
+
+  CGAL::Real_timer timer;
+  double max_time = -1; // in seconds
+
+public:
+  void set_max_time(double t) { max_time = t; }
+
+public:
+  template <typename AlphaWrapper>
+  void on_flood_fill_begin(const AlphaWrapper&)
+  {
+    std::cout << "Starting timer..." << std::endl;
+    timer.start();
+  }
+
+  template <typename Wrapper>
+  bool go_further(const Wrapper&)
+  {
+    if(timer.time() > max_time)
+    {
+      timer.stop();
+      std::cout << "Paused after " << timer.time() << " s." << std::endl;
+      return false;
+    }
+
+    return true;
+  }
+};
+
+int main(int argc, char** argv)
+{
+  std::cout.precision(17);
+  std::cerr.precision(17);
+
+  CGAL::Random rng;
+  std::cout << "Random seed = " << rng.get_seed() << std::endl;
+
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/armadillo.off");
+
+  // = read the soup
+  Points points;
+  Polygons polygons;
+  if(!CGAL::IO::read_polygon_soup(filename, points, polygons) || polygons.empty())
+  {
+    std::cerr << "Invalid soup input: " << filename << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  std::cout << "Input: " << points.size() << " points, " << polygons.size() << " faces" << std::endl;
+
+  // Compute the alpha and offset values
+  const double relative_alpha = (argc > 2) ? std::stod(argv[2]) : rng.get_double(150., 200.);
+  const double relative_offset = (argc > 3) ? std::stod(argv[3]) : 600.;
+  std::cout << "relative_alpha = " << relative_alpha << std::endl;
+
+  CGAL::Bbox_3 bbox;
+  for(const Point_3& p : points)
+    bbox += p.bbox();
+
+  const double diag_length = std::sqrt(CGAL::square(bbox.xmax() - bbox.xmin()) +
+                                       CGAL::square(bbox.ymax() - bbox.ymin()) +
+                                       CGAL::square(bbox.zmax() - bbox.zmin()));
+
+  const double alpha = diag_length / relative_alpha;
+  const double offset = diag_length / relative_offset;
+
+  // Build the wrapper
+  using Oracle = CGAL::Alpha_wraps_3::internal::Triangle_soup_oracle<K>;
+  Oracle oracle(alpha);
+  oracle.add_triangle_soup(points, polygons, CGAL::parameters::default_values());
+  CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle> aw3(oracle);
+
+  // --- Launch the wrapping, and pause when the algorithm has spent 1s flooding
+  Interrupter_visitor interrupter;
+  interrupter.set_max_time(1.);
+
+  Mesh wrap;
+  aw3(alpha, offset, wrap, CGAL::parameters::visitor(interrupter));
+  std::cout << ">>> The current wrap has " << num_vertices(wrap) << " vertices" << std::endl;
+  CGAL::IO::write_polygon_mesh("stopped_1.off", wrap, CGAL::parameters::stream_precision(17));
+
+  // --- Restart from the previous state, and pause a bit further
+  interrupter.set_max_time(2.);
+  aw3(alpha, offset, wrap, CGAL::parameters::visitor(interrupter)
+                                            .refine_triangulation(true));
+  std::cout << ">>> The current wrap has " << num_vertices(wrap) << " vertices" << std::endl;
+  CGAL::IO::write_polygon_mesh("stopped_2.off", wrap, CGAL::parameters::stream_precision(17));
+
+  // --- Restart from the previous state, and let it finish
+  aw3(alpha, offset, wrap, CGAL::parameters::refine_triangulation(true));
+  std::cout << ">>> The final (resumed) wrap has " << num_vertices(wrap) << " vertices" << std::endl;
+  std::string output_name = generate_output_name(filename, relative_alpha, relative_offset);
+  std::cout << "Writing to " << "resumed_" + output_name << std::endl;
+  CGAL::IO::write_polygon_mesh("resumed_" + output_name, wrap, CGAL::parameters::stream_precision(17));
+
+  // --- Get the final wrap, in one go:
+  Mesh single_pass_wrap;
+  CGAL::alpha_wrap_3(points, polygons, alpha, offset, single_pass_wrap);
+  std::cout << ">>> The final (from scratch) wrap has " << num_vertices(single_pass_wrap) << " vertices" << std::endl;
+
+  output_name = generate_output_name(filename, relative_alpha, relative_offset);
+  std::cout << "Writing to " << output_name << std::endl;
+  CGAL::IO::write_polygon_mesh(output_name, single_pass_wrap, CGAL::parameters::stream_precision(17));
+
+  // --- Compare the results to ensure both approaches yield identical meshes
+  std::vector<std::pair<face_descriptor, face_descriptor> > common;
+  std::vector<face_descriptor> m1_only;
+  std::vector<face_descriptor> m2_only;
+  PMP::match_faces(wrap, single_pass_wrap,
+                   std::back_inserter(common),
+                   std::back_inserter(m1_only),
+                   std::back_inserter(m2_only));
+  if(!m1_only.empty() || !m2_only.empty())
+  {
+    std::cerr << "Error: The two wraps should have been identical!" << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  return EXIT_SUCCESS;
+}

From 021d1fe8bdec6ac00268d8726094c3c58ac10e6d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 16 Oct 2023 17:05:38 +0200
Subject: [PATCH 0890/1398] Use the sorted priority queue in the plugin

---
 .../Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp   | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index f40130dedb12..f9eba756bf83 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -9,6 +9,10 @@
 #include "Scene_polylines_item.h"
 #include "Scene_points_with_normal_item.h"
 
+// Since we want to do visualization and interruption, it's better to use the sorted priority queue,
+// even if it is slower
+#define CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+
 #include <CGAL/alpha_wrap_3.h>
 
 #include <QAction>

From ea970e6ef5d050790cb05d8933c79c3966fdb43f Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Tue, 17 Oct 2023 10:59:44 +0200
Subject: [PATCH 0891/1398] Defining a new resource directory to be used with
 doxygen master 1.10.0

Adding the, new, possibility for `HTML_COPY_CLIPBOARD`:
> If the `HTML_COPY_CLIPBOARD` tag is set to `YES` then doxygen will show an icon
> the top right of code and text fragments that allows the user to copy the contents to the clipboard (provided
> this is supported by the browser).
---
 Documentation/doc/resources/1.10.0/header.html         | 3 +++
 Documentation/doc/resources/1.10.0/header_package.html | 3 +++
 2 files changed, 6 insertions(+)

diff --git a/Documentation/doc/resources/1.10.0/header.html b/Documentation/doc/resources/1.10.0/header.html
index 3eb37d8b586f..32657f69fa5f 100644
--- a/Documentation/doc/resources/1.10.0/header.html
+++ b/Documentation/doc/resources/1.10.0/header.html
@@ -17,6 +17,9 @@
 <!--END DISABLE_INDEX-->
 <script type="text/javascript" src="$relpath^../Manual/jquery.js"></script>
 <script type="text/javascript" src="$relpath^../Manual/dynsections.js"></script>
+<!--BEGIN COPY_CLIPBOARD-->
+<script type="text/javascript" src="$relpath^clipboard.js"></script>
+<!--END COPY_CLIPBOARD-->
 <script src="$relpath$../Manual/hacks.js" type="text/javascript"></script>
 $treeview
 $search
diff --git a/Documentation/doc/resources/1.10.0/header_package.html b/Documentation/doc/resources/1.10.0/header_package.html
index a5d20b59d6c5..827e05a9663d 100644
--- a/Documentation/doc/resources/1.10.0/header_package.html
+++ b/Documentation/doc/resources/1.10.0/header_package.html
@@ -17,6 +17,9 @@
 <!--END DISABLE_INDEX-->
 <script type="text/javascript" src="$relpath^../Manual/jquery.js"></script>
 <script type="text/javascript" src="$relpath^../Manual/dynsections.js"></script>
+<!--BEGIN COPY_CLIPBOARD-->
+<script type="text/javascript" src="$relpath^clipboard.js"></script>
+<!--END COPY_CLIPBOARD-->
 <script src="$relpath^../Manual/hacks.js" type="text/javascript"></script>
 <!-- Manually include treeview and search to avoid bloat and to fix
      paths to the directory Manual . -->

From 847795ec00214884ec7c04ef6f6ad947d5ae937f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 17 Oct 2023 13:01:18 +0200
Subject: [PATCH 0892/1398] Hide cavity behind a named parameter

---
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 44 ++++++++++++-------
 .../internal/parameters_interface.h           |  1 +
 2 files changed, 30 insertions(+), 15 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 31870dd01470..98313249efda 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -278,6 +278,10 @@ class Alpha_wrapper_3
     // geometrically manifold.
     const bool do_enforce_manifoldness = choose_parameter(get_parameter(in_np, internal_np::do_enforce_manifoldness), true);
 
+    // Whether to keep pockets of OUTSIDE cells that are not connected to the exterior (or to the
+    // initial cavities, if used).
+    const bool keep_inner_ccs = choose_parameter(get_parameter(in_np, internal_np::keep_inner_connected_components), true);
+
     // This parameter enables avoiding recomputing the triangulation from scratch when wrapping
     // the same input for multiple values of alpha (and typically the same offset values).
     // /!\ Warning /!\
@@ -317,12 +321,6 @@ class Alpha_wrapper_3
     dump_triangulation_faces("flood_filled_wrap.off", true /*only_boundary_faces*/);
 #endif
 
-    purge_inner_islands();
-
-#ifdef CGAL_AW3_DEBUG_DUMP_INTERMEDIATE_WRAPS
-    dump_triangulation_faces("purged_wrap.off", true /*only_boundary_faces*/);
-#endif
-
 #ifdef CGAL_AW3_TIMER
     t.stop();
     std::cout << "Flood filling took: " << t.time() << " s." << std::endl;
@@ -338,12 +336,6 @@ class Alpha_wrapper_3
       dump_triangulation_faces("manifold_wrap.off", true /*only_boundary_faces*/);
 #endif
 
-      purge_inner_islands();
-
-#ifdef CGAL_AW3_DEBUG_DUMP_INTERMEDIATE_WRAPS
-      dump_triangulation_faces("purged_manifold_wrap.off", true /*only_boundary_faces*/);
-#endif
-
 #ifdef CGAL_AW3_TIMER
       t.stop();
       std::cout << "Manifoldness post-processing took: " << t.time() << " s." << std::endl;
@@ -352,6 +344,17 @@ class Alpha_wrapper_3
 #endif
     }
 
+    if(!keep_inner_ccs)
+    {
+      // We could purge *before* manifold enforcement, but making the mesh manifold is
+      // very cheap in most cases, so it is better to keep the code simpler.
+      purge_inner_connected_components();
+
+#ifdef CGAL_AW3_DEBUG_DUMP_INTERMEDIATE_WRAPS
+      dump_triangulation_faces("purged_wrap.off", true /*only_boundary_faces*/);
+#endif
+    }
+
     extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
 
 #ifdef CGAL_AW3_TIMER
@@ -1395,12 +1398,17 @@ class Alpha_wrapper_3
     return true;
   }
 
-  // Any outside cell that isn't reachable from infinity is a cavity that can
-  // be discarded. This also removes some difficult non-manifoldness onfigurations
-  std::size_t purge_inner_islands()
+  // Any outside cell that isn't reachable from infinity is a cavity that can be discarded.
+  std::size_t purge_inner_connected_components()
   {
 #ifdef CGAL_AW3_DEBUG
     std::cout << "> Purge inner islands..." << std::endl;
+
+    std::size_t pre_counter = 0;
+    for(Cell_handle ch : m_tr.all_cell_handles())
+      if(ch->is_outside())
+        ++pre_counter;
+    std::cout << pre_counter << " / " << m_tr.all_cell_handles().size() << " (pre purge)" << std::endl;
 #endif
 
     std::size_t label_change_counter = 0;
@@ -1467,6 +1475,12 @@ class Alpha_wrapper_3
       ch->tds_data().clear();
 
 #ifdef CGAL_AW3_DEBUG
+    std::size_t post_counter = 0;
+    for(Cell_handle ch : m_tr.all_cell_handles())
+      if(ch->is_outside())
+        ++post_counter;
+    std::cout << post_counter << " / " << m_tr.all_cell_handles().size() << " (pre purge)" << std::endl;
+
     std::cout << label_change_counter << " label changes" << std::endl;
 #endif
 
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index 435075df6e2a..a164053aabbc 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -238,6 +238,7 @@ CGAL_add_named_parameter(smooth_constrained_edges_t, smooth_constrained_edges, s
 CGAL_add_named_parameter(do_enforce_manifoldness_t, do_enforce_manifoldness, do_enforce_manifoldness)
 CGAL_add_named_parameter(seed_points_t, seed_points, seed_points)
 CGAL_add_named_parameter(refine_triangulation_t, refine_triangulation, refine_triangulation)
+CGAL_add_named_parameter(keep_inner_connected_components_t, keep_inner_connected_components, keep_inner_connected_components)
 
 // SMDS_3 parameters
 CGAL_add_named_parameter(surface_facets_t, surface_facets, surface_facets)

From d51d71a563f12269e7dbcf6835d1295a66d3bc2b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 17 Oct 2023 13:12:24 +0200
Subject: [PATCH 0893/1398] Misc minor improvements

---
 .../examples/Alpha_wrap_3/output_helper.h     |  2 +-
 .../pause_and_resume_wrapping.cpp             |  2 +-
 .../Alpha_wrap_3/successive_wraps.cpp         | 63 ++++++--------
 .../CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 82 +++++++++----------
 .../internal/gate_priority_queue.h            |  6 +-
 5 files changed, 70 insertions(+), 85 deletions(-)

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/output_helper.h b/Alpha_wrap_3/examples/Alpha_wrap_3/output_helper.h
index 3ce1155f4ef5..581ac82bff02 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/output_helper.h
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/output_helper.h
@@ -16,4 +16,4 @@ std::string generate_output_name(std::string input_name,
   return output_name;
 }
 
-#endif // CGAL_ALPHA_WRAP_3_EXAMPLES_OUTPUT_HELPER_H
\ No newline at end of file
+#endif // CGAL_ALPHA_WRAP_3_EXAMPLES_OUTPUT_HELPER_H
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp
index 5663bce16847..b22b21d817bc 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp
@@ -2,7 +2,7 @@
 // and how to resume afterwards.
 //
 // -------------------------------- !! Warning !! --------------------------------------------------
-// By default, the wrap uses an unsorted LIFO queue of faces to refine. This means that
+// By default, the wrapper uses an unsorted LIFO queue of faces to refine. This means that
 // the intermediate result is not very useful because the algorithm carves deep and not wide
 // (somewhat like a DFS vs a BFS).
 //
diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
index f8533fb9cda9..301aec46e2d5 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/successive_wraps.cpp
@@ -1,4 +1,21 @@
-#define CGAL_AW3_TIMER
+// In this example, we reuse the underlying triangulation of the previous state, and carve using
+// a new (smaller) alpha value. This enables considerable speed-up: the cumulated time taken
+// to run `n` successive instances of `{alpha_wrap(alpha_i)}_(i=1...n)` will be roughly equal
+// to the time taken to the single instance of alpha_wrap(alpha_n) from scratch.
+//
+// The speed-up increases with the number of intermediate results, and on the gap between
+// alpha values: if alpha_2 is close to alpha_1, practically no new computation are required,
+// and the speed-up is almost 100%.
+//
+// -------------------------------- !! Warning !! --------------------------------------------------
+// The result of:
+//   > alpha_wrap(alpha_1, ...)
+//   > alpha_wrap(alpha_2, ..., reuse)
+// is not exactly identical to calling directly:
+//   > alpha_wrap(alpha_2, ..., do_not_reuse)
+// because the queues are sorted slightly differently and the AABB tree is rebuilt differently
+// to optimize the runtime.
+// -------------------------------------------------------------------------------------------------
 
 #include "output_helper.h"
 
@@ -21,10 +38,6 @@ using Point_3 = K::Point_3;
 
 using Mesh = CGAL::Surface_mesh<Point_3>;
 
-// We want decreasing alphas, and these are relative ratios, so they need to be increasing
-const std::vector<FT> relative_alphas = { 1, 2/*50, 100, 150, 200, 250*/ };
-const FT relative_offset = 600;
-
 int main(int argc, char** argv)
 {
   std::cout.precision(17);
@@ -48,6 +61,10 @@ int main(int argc, char** argv)
                                        CGAL::square(bbox.ymax() - bbox.ymin()) +
                                        CGAL::square(bbox.zmax() - bbox.zmin()));
 
+  // We want decreasing alphas, and these are relative ratios, so they need to be increasing
+  const std::vector<FT> relative_alphas = { 1, 50, 100, 150, 200, 250 };
+  const FT relative_offset = 600;
+
   // ===============================================================================================
   // Naive approach:
 
@@ -64,17 +81,12 @@ int main(int argc, char** argv)
     std::cout << ">>> [" << i << "] alpha: " << alpha << " offset: " << offset << std::endl;
 
     Mesh wrap;
-    CGAL::alpha_wrap_3(mesh, alpha, offset, wrap,
-                       CGAL::parameters::do_enforce_manifoldness(false));
+    CGAL::alpha_wrap_3(mesh, alpha, offset, wrap);
 
     t.stop();
     std::cout << "  Result: " << num_vertices(wrap) << " vertices, " << num_faces(wrap) << " faces" << std::endl;
     std::cout << "  Elapsed time: " << t.time() << " s." << std::endl;
 
-    const std::string output_name = generate_output_name(filename, relative_alphas[i], relative_offset);
-    std::cout << "Writing to " << output_name << std::endl;
-    CGAL::IO::write_polygon_mesh(output_name, wrap, CGAL::parameters::stream_precision(17));
-
     total_time += t.time();
   }
 
@@ -82,29 +94,6 @@ int main(int argc, char** argv)
 
   // ===============================================================================================
   // Re-use approach
-  //
-  // Here, we restart from the triangulation of the previous state, and carve according
-  // to a (smaller) alpha value. This enables considerable speed-up: the cumulated time taken
-  // to run `n` successive instances of `{alpha_wrap(alpha_i)}_(i=1...n)` will be equal to the
-  // time taken to run alpha_wrap(alpha_n) from scratch.
-  //
-  // For example:
-  // naive:
-  //   alpha_wrap(alpha_1, ...) ---> 2s
-  //   alpha_wrap(alpha_2, ...) ---> 4s
-  //   alpha_wrap(alpha_3, ...) ---> 8s
-  // will become with reusability:
-  //   alpha_wrap(alpha_1, ..., reuse) ---> 2s
-  //   alpha_wrap(alpha_2, ..., reuse) ---> 2s // 2+2 = 4s = naive alpha_2
-  //   alpha_wrap(alpha_3, ..., reuse) ---> 4s // 2+2+4 = 8s = naive alpha_3
-  // Thus, if we care about the intermediate results, we save 6s (8s instead of 14s).
-  // The speed-up increases with the number of intermediate results, and if the alpha values
-  // are close.
-  //
-  // !! Warning !!
-  // The result of alpha_wrap(alpha_1, ...) followed by alpha_wrap(alpha_2, ...) with alpha_2
-  // smaller than alpha_1 is going to be close but NOT exactly equal to that produced by calling
-  // alpha_wrap(alpha_2, ...) directly.
 
   total_time = 0.;
   t.reset();
@@ -122,7 +111,7 @@ int main(int argc, char** argv)
     const double offset = diag_length / relative_offset;
     std::cout << ">>> [" << i << "] alpha: " << alpha << " offset: " << offset << std::endl;
 
-    // The triangle mesh oracle can be initialized with alpha to internally perform a split
+    // The triangle mesh oracle should be initialized with alpha to internally perform a split
     // of too-big facets while building the AABB Tree. This split in fact yields a significant
     // speed-up for meshes with elements that are large compared to alpha. This speed-up makes it
     // faster to re-build the AABB tree for every value of alpha than to use a non-optimized tree.
@@ -131,9 +120,7 @@ int main(int argc, char** argv)
     wrapper.oracle() = oracle;
 
     Mesh wrap;
-    wrapper(alpha, offset, wrap,
-            CGAL::parameters::do_enforce_manifoldness(false)
-                             .refine_triangulation((i != 0)));
+    wrapper(alpha, offset, wrap, CGAL::parameters::refine_triangulation((i != 0)));
 
     t.stop();
     std::cout << "  Result: " << num_vertices(wrap) << " vertices, " << num_faces(wrap) << " faces" << std::endl;
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 98313249efda..45834cd6b61f 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -125,7 +125,7 @@ class Alpha_wrapper_3
 
   using Default_Vb = Alpha_wrap_triangulation_vertex_base_3<Default_Gt>;
   using Default_Cb = Alpha_wrap_triangulation_cell_base_3<Default_Gt>;
-  using Default_Cbt = Cell_base_with_timestamp<Default_Cb>; // determinism
+  using Default_Cbt = Cell_base_with_timestamp<Default_Cb>; // for determinism
   using Default_Tds = CGAL::Triangulation_data_structure_3<Default_Vb, Default_Cbt>;
   using Default_Triangulation = CGAL::Delaunay_triangulation_3<Default_Gt, Default_Tds, Fast_location>;
 
@@ -143,12 +143,13 @@ class Alpha_wrapper_3
 
   using Gate = internal::Gate<Triangulation>;
 
-  // A sorted queue is a priority queue sorted by circumradius, and is experimentally much slower,
-  // but intermediate results are visually nice: somewhat uniform meshes.
+  // A sorted queue is a priority queue sorted by circumradius, and is experimentally significantly
+  // slower. However, intermediate results are usable: at each point of the algorithm, the wrap
+  // has a somewhat uniform mesh element size.
   //
   // An unsorted queue is a LIFO queue, and is experimentally much faster (~35%),
-  // but intermediate results are not useful: a LIFO will mean carving is done very deep
-  // before than wide
+  // but intermediate results are not useful: a LIFO carves deep before than wide,
+  // and can thus for example leave scaffolding faces till almost the end of the refinement.
 #ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
   using Alpha_PQ = Modifiable_priority_queue<Gate, Less_gate, Gate_ID_PM<Triangulation>, CGAL_BOOST_PAIRING_HEAP>;
 #else
@@ -270,7 +271,7 @@ class Alpha_wrapper_3
     Wrapping_default_visitor default_visitor;
     Visitor visitor = choose_parameter(get_parameter_reference(in_np, internal_np::visitor), default_visitor);
 
-    //
+    // Points used to create initial cavities
     m_seeds = choose_parameter(get_parameter_reference(in_np, internal_np::seed_points), Seeds());
 
     // Whether or not some cells should be reflagged as "inside" after the refinement+carving loop
@@ -278,16 +279,16 @@ class Alpha_wrapper_3
     // geometrically manifold.
     const bool do_enforce_manifoldness = choose_parameter(get_parameter(in_np, internal_np::do_enforce_manifoldness), true);
 
-    // Whether to keep pockets of OUTSIDE cells that are not connected to the exterior (or to the
+    // Whether to keep pockets of "outside" cells that are not connected to the exterior (or to the
     // initial cavities, if used).
     const bool keep_inner_ccs = choose_parameter(get_parameter(in_np, internal_np::keep_inner_connected_components), true);
 
     // This parameter enables avoiding recomputing the triangulation from scratch when wrapping
     // the same input for multiple values of alpha (and typically the same offset values).
-    // /!\ Warning /!\
     //
-    // If this is enabled, the 3D triangulation will NOT be re-initialized
-    // at launch. This means that the triangulation is NOT cleared, even if:
+    // /!\ Warning /!\
+    // If this is enabled, the 3D triangulation will NOT be re-initialized at launch.
+    // This means that the triangulation is NOT cleared, even if:
     // - you use an alpha value that is greater than what was used in a previous run; you will
     //   obtain the same result as the last run.
     // - you use a different offset value between runs, you might then get points that are not
@@ -423,12 +424,12 @@ class Alpha_wrapper_3
   // boundary considers them inside.
   bool is_on_inside_boundary(Cell_handle ch, Cell_handle nh) const
   {
-    return (ch->is_inside() != nh->is_inside()); // one is INSIDE, the other is not
+    return (ch->is_inside() != nh->is_inside()); // one is "inside", the other is not
   }
 
   bool is_on_outside_boundary(Cell_handle ch, Cell_handle nh) const
   {
-    return (ch->is_outside() != nh->is_outside()); // one is OUTSIDE, the other is not
+    return (ch->is_outside() != nh->is_outside()); // one is "outside", the other is not
   }
 
 private:
@@ -552,7 +553,7 @@ class Alpha_wrapper_3
         continue;
       }
 
-      // Mark the seeds and icosahedron vertices as "scaffolding vertices" such that the facets
+      // Mark the seeds and icosahedron vertices as "scaffolding" vertices such that the facets
       // incident to these vertices are always traversable regardless of their circumcenter.
       // This is done because otherwise some cavities can appear on the mesh: non-traversable facets
       // with two vertices on the offset, and the third being a deeper inside seed / ico_seed.
@@ -633,7 +634,7 @@ class Alpha_wrapper_3
         continue;
 
       // When the algorithm starts from a manually dug hole, infinite cells are initialized
-      // as INSIDE such that they do not appear on the boundary
+      // as "inside" such that they do not appear on the boundary
       CGAL_assertion(!m_tr.is_infinite(ch));
 
       for(int i=0; i<4; ++i)
@@ -651,7 +652,7 @@ class Alpha_wrapper_3
     return true;
   }
 
-  // tag all infinite cells OUTSIDE and all finite cells INSIDE
+  // tag all infinite cells "outside" and all finite cells "inside"
   // init queue with all convex hull facets
   bool initialize_from_infinity()
   {
@@ -688,9 +689,6 @@ class Alpha_wrapper_3
     std::cout << "Restart from a DT of " << m_tr.number_of_cells() << " cells" << std::endl;
 #endif
 
-    Real_timer t;
-    t.start();
-
     for(Cell_handle ch : m_tr.all_cell_handles())
     {
       if(ch->is_inside())
@@ -698,16 +696,12 @@ class Alpha_wrapper_3
 
       for(int i=0; i<4; ++i)
       {
-        if(ch->neighbor(i)->is_outside())
-          continue;
+        if(ch->neighbor(i)->is_inside())
+          push_facet(std::make_pair(ch, i));
 
-        push_facet(std::make_pair(ch, i));
       }
     }
 
-    t.stop();
-    std::cout << t.time() << " for scanning a queue of size " << m_queue.size() << std::endl;
-
     return true;
   }
 
@@ -751,7 +745,6 @@ class Alpha_wrapper_3
 
         if(cell->tds_data().processed())
           continue;
-
         cell->tds_data().mark_processed();
 
         for(int fid=0; fid<4; ++fid)
@@ -1024,12 +1017,12 @@ class Alpha_wrapper_3
               << m_tr.point(f.first, Triangulation::vertex_triple_index(f.second, 2)) << std::endl;
 #endif
 
-    // skip if neighbor is OUTSIDE or infinite
+    // skip if neighbor is "outside" or infinite
     const Cell_handle ch = f.first;
     const int id = f.second;
     CGAL_precondition(ch->label() == Cell_label::INSIDE || ch->label() == Cell_label::OUTSIDE);
 
-    if(!ch->is_outside()) // INSIDE or MANIFOLD
+    if(!ch->is_outside()) // "inside" or "manifold"
     {
 #ifdef CGAL_AW3_DEBUG_FACET_STATUS
       std::cout << "Facet is inside" << std::endl;
@@ -1168,6 +1161,10 @@ class Alpha_wrapper_3
     // and we can resume with the current queue
     if(resuming)
     {
+#ifdef CGAL_AW3_DEBUG
+      std::cout << "Resuming with a queue of size: " << m_queue.size() << std::endl;
+#endif
+
       reset_manifold_labels();
       return true;
     }
@@ -1181,7 +1178,7 @@ class Alpha_wrapper_3
     if(refining)
     {
       // If we are re-using the triangulation, change the label of the extra elements
-      // that we have added to ensure a manifold result back to external (MANIFOLD -> OUTSIDE)
+      // that we have added to ensure a manifold result back to external ("manifold" -> "outside")
       reset_manifold_labels();
 
       return initialize_from_existing_triangulation();
@@ -1190,7 +1187,6 @@ class Alpha_wrapper_3
     {
       m_tr.clear();
 
-
       insert_bbox_corners();
 
       if(m_seeds.empty())
@@ -1512,7 +1508,7 @@ class Alpha_wrapper_3
       if(ic->is_outside())
         outside_start = ic;
       else if(inside_start == Cell_handle())
-        inside_start = ic; // can be INSIDE or MANIFOLD
+        inside_start = ic; // can be "inside" or "manifold"
     }
 
     // fully inside / outside
@@ -1659,12 +1655,12 @@ class Alpha_wrapper_3
 
     FT base_vol = wrap_volume();
     if(!is_positive(base_vol))
-      std::cerr << "Warning: empty wrap?" << std::endl;
+      std::cerr << "Warning: wrap with non-positive volume?" << std::endl;
 #endif
 
-    // This seems more harmful than useful after the priority queue has been introduced since
-    // it adds a lot of flat cells into the triangulation, which then get added to the mesh
-    // during manifoldness fixing.
+    // This ends up more harmful than useful after the priority queue has been introduced since
+    // it usually results in a lot of flat cells into the triangulation, which then get added
+    // to the mesh during manifoldness fixing.
 //    remove_bbox_vertices();
 
     std::stack<Vertex_handle> non_manifold_vertices; // @todo sort somehow?
@@ -1694,8 +1690,8 @@ class Alpha_wrapper_3
       return false;
     };
 
-    // This seemed like a good idea, but in the end it can have strong cascading issues,
-    // whereas some cells with much lower volume would have solved the non-manifoldness.
+    // This originally seemed like a good idea, but in the end it can have strong cascading issues,
+    // whereas some cells with much smaller volume could have solved the non-manifoldness.
 //    auto is_on_boundary = [](Cell_handle c, int i) -> bool
 //    {
 //      return is_on_outside_boundary(c, c->neighbor(i));
@@ -1716,14 +1712,14 @@ class Alpha_wrapper_3
 //      return boundary_facets;
 //    };
 
-    // longest edge works better
+    // Experimentally, longest edge works better
 //    auto sq_circumradius = [&](Cell_handle c) -> FT
 //    {
 //      const Point_3& cc = circumcenter(c);
 //      return geom_traits().compute_squared_distance_3_object()(m_tr.point(c, 0), cc);
 //    };
 
-    // the reasoning behind using longest edge rather than volume is that we want to avoid
+    // The reasoning behind using longest edge rather than volume is that we want to avoid
     // spikes (which would have a small volume), and can often happen since we do not spend
     // any care on the quality of tetrahedra.
     auto sq_longest_edge = [&](Cell_handle c) -> FT
@@ -1756,9 +1752,9 @@ class Alpha_wrapper_3
       // - cells without bbox vertices
       // - small cells when equal number of boundary facets
       //
-      // Note that these are properties that do not depend on where the surface is, so we can
-      // sort once. However, if a criterion such as the number of inside cells were added,
-      // one would need to sort again after each modification of is_outside() statuses.
+      // Note that these are properties that do not depend on the cell labels, and so we only need
+      // to sort once. However, if a criterion such as the number of incident inside cells were added,
+      // we would need to sort after each modification of "inside"/"outside" labels.
       auto comparer = [&](Cell_handle l, Cell_handle r) -> bool
       {
         CGAL_precondition(!m_tr.is_infinite(l) && !m_tr.is_infinite(r));
@@ -1780,7 +1776,7 @@ class Alpha_wrapper_3
 
       // 'std::stable_sort' to have determinism without having to write something like:
       //     if(longest_edge(l) == longest_edge(r)) return ...
-      // in the comparer. It's a small range, so the cost does not matter.
+      // in the comparer. It's almost always a small range, so the extra cost does not matter.
       std::stable_sort(finite_outside_inc_cells.begin(), finite_outside_inc_cells.end(), comparer);
 
       for(Cell_handle ic : finite_outside_inc_cells)
@@ -1803,6 +1799,8 @@ class Alpha_wrapper_3
 
       CGAL_assertion(!is_non_manifold(v));
 
+      // Check if the new material has not created a non-manifold configuration.
+      // @speed this could be done on only the vertices of cells whose labels have changed.
       std::vector<Vertex_handle> adj_vertices;
       adj_vertices.reserve(64);
       m_tr.finite_adjacent_vertices(v, std::back_inserter(adj_vertices));
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
index 9c29ac9e7226..f7947f246a4b 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
@@ -70,12 +70,12 @@ struct Less_gate
   template <typename Tr>
   bool operator()(const Gate<Tr>& a, const Gate<Tr>& b) const
   {
-    // If one is permissive and the other is not, give priority to the permissive facet
+    // If one is permissive and the other is not, give priority to the permissive facet.
     //
     // The permissive facet are given highest priority because they need to be treated
     // regardless of their circumradius. Treating them first allow the part that depends
-    // on alpha to be treated uniformly in a way: whatever the alpha, all scaffolding faces
-    // will first be treated
+    // on alpha to be treated uniformly in a way: whatever the alpha, all permissive faces
+    // will first be treated.
     if(a.is_permissive_facet() != b.is_permissive_facet())
       return a.is_permissive_facet();
 

From b4188a50111eee89c08481b6408687af04d7004b Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Tue, 17 Oct 2023 15:02:16 +0200
Subject: [PATCH 0894/1398] Fix intersection not having color + Domains colors
 better follow item color

---
 .../demo/Polyhedron/Scene_image_item.cpp      |  2 +-
 .../Polyhedron/Scene_triangulation_3_item.cpp | 22 +++++++++----------
 2 files changed, 12 insertions(+), 12 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
index bdcf80a5091c..2b9b395a5802 100644
--- a/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_image_item.cpp
@@ -89,7 +89,7 @@ Image_accessor<Word_type>::Image_accessor(const Image& im, int dx, int dy, int d
   }
 
   const double nb_Colors = colors_.size()+1;
-  double i=1;
+  double i=0;
   const double starting_hue = default_color.hueF();
   for ( auto it = colors_.begin(),
        end = colors_.end() ; it != end ; ++it, i += 1.)
diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
index b9df46a5418d..65fe4345cdf4 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
@@ -886,7 +886,7 @@ Scene_triangulation_3_item_priv::compute_color_map(const QColor& c)
   typedef Indices::size_type size_type;
 
   const size_type nb_patch_indices = surface_patch_indices_.size();
-  double i = 0;
+  double i = -1;
   double patch_hsv_value = use_subdomain_colors ? fmod(c.valueF() + .5, 1.) : c.valueF();
   for (Indices::iterator it = surface_patch_indices_.begin(),
        end = surface_patch_indices_.end(); it != end; ++it, i += 1.)
@@ -896,18 +896,18 @@ Scene_triangulation_3_item_priv::compute_color_map(const QColor& c)
     colors[*it] = QColor::fromHsvF(hue, c.saturationF(), patch_hsv_value);
   }
 
-  if (use_subdomain_colors)
+  const size_type nb_domains = subdomain_indices_.size();
+  i = -1;
+  for (Indices::iterator it = subdomain_indices_.begin(),
+         end = subdomain_indices_.end(); it != end; ++it, i += 1.)
   {
-    const size_type nb_domains = subdomain_indices_.size();
-    i = 0;
-    for (Indices::iterator it = subdomain_indices_.begin(),
-           end = subdomain_indices_.end(); it != end; ++it, i += 1.)
-    {
-      double hue = c.hueF() + 1. / double(nb_domains) * i;
-      if (hue > 1) { hue -= 1.; }
-      colors_subdomains[*it] = QColor::fromHsvF(hue, c.saturationF(), c.valueF());
-    }
+    double hue = c.hueF() + 1. / double(nb_domains) * i;
+    if (hue > 1) { hue -= 1.; }
+    colors_subdomains[*it] = QColor::fromHsvF(hue, c.saturationF(), c.valueF());
+  }
 
+  if (use_subdomain_colors)
+  {
     for (std::unordered_map<int, int>::iterator it = visible_surface_patch_to_subdomain.begin(),
          end = visible_surface_patch_to_subdomain.end(); it != end; ++it)
     {

From c4e538b64ae6c7c910c60c4921155f1d0eda184a Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 17 Oct 2023 14:32:06 +0100
Subject: [PATCH 0895/1398] Fix PkgPolygonalSurfaceReconstruction

---
 .../include/CGAL/Polygonal_surface_reconstruction.h             | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction.h b/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction.h
index e78c2d390a65..fe183993b222 100644
--- a/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction.h
+++ b/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction.h
@@ -28,7 +28,7 @@
 namespace CGAL {
 
         /*!
-        \ingroup PkgPolygonalSurfaceReconstruction
+        \ingroup PkgPolygonalSurfaceReconstructionRef
 
         \brief
 

From ccf1ac0b59c4aeaf3a8901844075828401558285 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 17 Oct 2023 14:33:32 +0100
Subject: [PATCH 0896/1398] Fix PkgSurfaceMeshParameterization

---
 .../include/CGAL/surface_mesh_parameterization.h               | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/Surface_mesh_parameterization/include/CGAL/surface_mesh_parameterization.h b/Surface_mesh_parameterization/include/CGAL/surface_mesh_parameterization.h
index fb2cea903d8c..09980d6e6dd0 100644
--- a/Surface_mesh_parameterization/include/CGAL/surface_mesh_parameterization.h
+++ b/Surface_mesh_parameterization/include/CGAL/surface_mesh_parameterization.h
@@ -11,7 +11,7 @@
 // Author(s)     : Mael Rouxel-Labbé
 
 /**
-* \ingroup PkgSurfaceMeshParameterization
+* \ingroup PkgSurfaceMeshParameterizationRef
 * \file CGAL/surface_mesh_parameterization.h
 * Convenience header file including the headers for all
 * the free functions of this package.
@@ -34,4 +34,3 @@
 #include <CGAL/Surface_mesh_parameterization/Circular_border_parameterizer_3.h>
 #include <CGAL/Surface_mesh_parameterization/Square_border_parameterizer_3.h>
 #include <CGAL/Surface_mesh_parameterization/Two_vertices_parameterizer_3.h>
-

From fd4b4e070ad4da56aa32a9b6a13e184f5a43ab26 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 17 Oct 2023 14:45:45 +0100
Subject: [PATCH 0897/1398] Fix PkgMinkowskiSum2Ref

---
 .../doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h   | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h
index 58959c2fca5d..86488c197ce1 100644
--- a/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h
+++ b/Minkowski_sum_2/doc/Minkowski_sum_2/CGAL/Polygon_convex_decomposition_2.h
@@ -31,7 +31,7 @@ class Greene_convex_decomposition_2 {
 namespace CGAL {
 
 /*!
-\ingroup PkgMinkowskiSum2Classes
+\ingroup PkgMinkowskiSum2Ref
 
 The `Hertel_Mehlhorn_convex_decomposition_2` class implements the approximation algorithm of Hertel
 and Mehlhorn for decomposing a polygon into convex

From de477239b4de76e623b80b642a1a9e684838de79 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 17 Oct 2023 14:57:31 +0100
Subject: [PATCH 0898/1398] Fix AlgebraicFoundations

---
 .../doc/Algebraic_foundations/Concepts/ExplicitInteroperable.h | 3 +--
 .../doc/Algebraic_foundations/Concepts/Fraction.h              | 3 +--
 .../Algebraic_foundations/Concepts/FromDoubleConstructible.h   | 3 +--
 .../doc/Algebraic_foundations/Concepts/FromIntConstructible.h  | 3 +--
 .../doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h | 3 +--
 5 files changed, 5 insertions(+), 10 deletions(-)

diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ExplicitInteroperable.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ExplicitInteroperable.h
index c76784d0059a..1ebc78e8ce37 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ExplicitInteroperable.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ExplicitInteroperable.h
@@ -1,6 +1,6 @@
 
 /*!
-\ingroup PkgAlgebraicFoundationsInteroperabilityConcepts
+\ingroup PkgAlgebraicFoundationsAlgebraicStructuresConcepts
 \cgalConcept
 
 Two types `A` and `B` are a model of the `ExplicitInteroperable`
@@ -27,4 +27,3 @@ class ExplicitInteroperable {
 public:
 
 }; /* end ExplicitInteroperable */
-
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/Fraction.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/Fraction.h
index c250309555ca..0ba53cb6e022 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/Fraction.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/Fraction.h
@@ -1,6 +1,6 @@
 
 /*!
-\ingroup PkgAlgebraicFoundationsFractionsConcepts
+\ingroup PkgAlgebraicFoundationsAlgebraicStructuresConcepts
 \cgalConcept
 
 A type is considered as a `Fraction`, if there is a reasonable way to
@@ -17,4 +17,3 @@ class Fraction {
 public:
 
 }; /* end Fraction */
-
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromDoubleConstructible.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromDoubleConstructible.h
index 879d9b45ed38..6746fedcee23 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromDoubleConstructible.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromDoubleConstructible.h
@@ -1,6 +1,6 @@
 
 /*!
-\ingroup PkgAlgebraicFoundationsConcepts
+\ingroup PkgAlgebraicFoundationsAlgebraicStructuresConcepts
 \cgalConcept
 
 A model of the concept `FromDoubleConstructible` is required
@@ -27,4 +27,3 @@ FromDoubleConstructible(const double& d);
 /// @}
 
 }; /* end FromDoubleConstructible */
-
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
index 779b96188a71..dc23c29f649b 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/FromIntConstructible.h
@@ -1,6 +1,6 @@
 
 /*!
-\ingroup PkgAlgebraicFoundationsConcepts
+\ingroup PkgAlgebraicFoundationsAlgebraicStructuresConcepts
 \cgalConcept
 
 A model of the concept `FromIntConstructible` is required
@@ -28,4 +28,3 @@ FromIntConstructible(int& i);
 /// @}
 
 }; /* end FromIntConstructible */
-
diff --git a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h
index d7521aafcaab..a7c2f7389803 100644
--- a/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h
+++ b/Algebraic_foundations/doc/Algebraic_foundations/Concepts/ImplicitInteroperable.h
@@ -1,6 +1,6 @@
 
 /*!
-\ingroup PkgAlgebraicFoundationsInteroperabilityConcepts
+\ingroup PkgAlgebraicFoundationsAlgebraicStructuresConcepts
 \cgalConcept
 
 Two types `A` and `B` are a model of the concept
@@ -29,4 +29,3 @@ class ImplicitInteroperable {
 public:
 
 }; /* end ImplicitInteroperable */
-

From 9ffbfef2f889dca5ddd99a80656f7dd8ab342c14 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 17 Oct 2023 15:05:26 +0100
Subject: [PATCH 0899/1398] Fix PkgSolverInterface

---
 Solver_interface/include/CGAL/Eigen_sparse_matrix.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Solver_interface/include/CGAL/Eigen_sparse_matrix.h b/Solver_interface/include/CGAL/Eigen_sparse_matrix.h
index 2533f5fe8723..83622ad90581 100644
--- a/Solver_interface/include/CGAL/Eigen_sparse_matrix.h
+++ b/Solver_interface/include/CGAL/Eigen_sparse_matrix.h
@@ -298,7 +298,7 @@ struct Eigen_sparse_matrix
 
 
 /*!
-\ingroup PkgSolverInterfaceRefLS
+\ingroup PkgSolverInterfaceLS
 
 The class `Eigen_sparse_symmetric_matrix` is a wrapper around `Eigen` matrix type
 <a href="https://eigen.tuxfamily.org/dox/classEigen_1_1SparseMatrix.html">`Eigen::SparseMatrix` </a>

From fb4095a0547af215b2f60737493ea5e55cd7bad7 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 17 Oct 2023 15:18:55 +0100
Subject: [PATCH 0900/1398] Partial fix of Kernel_23

---
 Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_2.h    |  1 -
 Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_3.h    |  1 -
 Kernel_23/doc/Kernel_23/CGAL/aff_transformation_tags.h | 10 +++++-----
 3 files changed, 5 insertions(+), 7 deletions(-)

diff --git a/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_2.h b/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_2.h
index 1c0cb7a99315..bd9fd496af3a 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_2.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_2.h
@@ -1,7 +1,6 @@
 namespace CGAL {
 
 /*!
-\ingroup kernel_affine
 \ingroup kernel_classes2
 
 The class `Aff_transformation_2` represents two-dimensional affine transformations.
diff --git a/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_3.h b/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_3.h
index 1312f02689f1..5616b1646cc1 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_3.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Aff_transformation_3.h
@@ -2,7 +2,6 @@ namespace CGAL {
 
 /*!
 \ingroup kernel_classes3
-\ingroup kernel_affine
 
 The class `Aff_transformation_3` represents three-dimensional affine transformations.
 The general form of an affine transformation is based on a homogeneous
diff --git a/Kernel_23/doc/Kernel_23/CGAL/aff_transformation_tags.h b/Kernel_23/doc/Kernel_23/CGAL/aff_transformation_tags.h
index 544592977145..493edd292749 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/aff_transformation_tags.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/aff_transformation_tags.h
@@ -2,7 +2,7 @@
 namespace CGAL {
 
 /*!
-\ingroup kernel_affine
+\ingroup PkgKernel23Ref
 
 Tag class for affine transformations.
 
@@ -24,7 +24,7 @@ class Identity_transformation {
 namespace CGAL {
 
 /*!
-\ingroup kernel_affine
+\ingroup PkgKernel23Ref
 
 Tag class for affine transformations.
 
@@ -46,7 +46,7 @@ class Reflection {
 namespace CGAL {
 
 /*!
-\ingroup kernel_affine
+\ingroup PkgKernel23Ref
 
 Tag class for affine transformations.
 
@@ -68,7 +68,7 @@ class Rotation {
 namespace CGAL {
 
 /*!
-\ingroup kernel_affine
+\ingroup PkgKernel23Ref
 
 Tag class for affine transformations.
 
@@ -90,7 +90,7 @@ class Scaling {
 namespace CGAL {
 
 /*!
-\ingroup kernel_affine
+\ingroup PkgKernel23Ref
 
 Tag class for affine transformations.
 

From 0acea19e203746a3f4ec0b3d6ba69b8ef5255ca3 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 17 Oct 2023 15:30:57 +0100
Subject: [PATCH 0901/1398] Fix Kernel_23

---
 Kernel_23/doc/Kernel_23/CGAL/intersections.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Kernel_23/doc/Kernel_23/CGAL/intersections.h b/Kernel_23/doc/Kernel_23/CGAL/intersections.h
index 160bb35d7ebc..3670052bb6d5 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/intersections.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/intersections.h
@@ -12,7 +12,7 @@ function are available.
 
 /*!
 \addtogroup do_intersect_linear_grp
-\ingroup do_intersect
+\ingroup do_intersect_grp
 
 \sa `do_intersect_circular_grp`
 \sa `do_intersect_spherical_grp`
@@ -79,7 +79,7 @@ function are available.
 
 /*!
 \addtogroup intersection_linear_grp
-\ingroup intersection
+\ingroup intersection_grp
 
 */
 /// @{

From f753c8928c2608f13d1e21d632a7cccd03338bb7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 17 Oct 2023 17:15:13 +0200
Subject: [PATCH 0902/1398] Minor compilation fix

---
 .../include/CGAL/Alpha_wrap_3/internal/validation.h      | 9 ++++++++-
 1 file changed, 8 insertions(+), 1 deletion(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/validation.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/validation.h
index c9445c9e9c50..6d9a9191d5f4 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/validation.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/validation.h
@@ -117,7 +117,7 @@ bool has_expected_Hausdorff_distance(const TriangleMesh& wrap,
 
 template <typename TriangleMesh, typename NamedParameters = parameters::Default_named_parameters>
 bool is_valid_wrap(const TriangleMesh& wrap,
-                   const bool check_manifoldness = true,
+                   const bool check_manifoldness,
                    const NamedParameters& np = parameters::default_values())
 {
   namespace PMP = CGAL::Polygon_mesh_processing;
@@ -203,6 +203,13 @@ bool is_valid_wrap(const TriangleMesh& wrap,
   return true;
 }
 
+template <typename TriangleMesh, typename NamedParameters = parameters::Default_named_parameters>
+bool is_valid_wrap(const TriangleMesh& wrap,
+                   const NamedParameters& np = parameters::default_values())
+{
+  return is_valid_wrap(wrap, true /*consider manifoldness*/, np);
+}
+
 template <typename InputTriangleMesh, typename OutputTriangleMesh,
           typename InputNamedParameters = parameters::Default_named_parameters,
           typename OutputNamedParameters = parameters::Default_named_parameters>

From c7af977fd24d499ac28e1624ae28b166c3b0f51f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 18 Oct 2023 09:43:20 +0200
Subject: [PATCH 0903/1398] Add code in benchmarks to enable ignoring inputs
 that have degeneracies

---
 .../compute_robustness_benchmark_data.py      | 25 ++++++++---------
 .../generate_robustness_benchmark_charts.py   | 26 +++++++++---------
 .../Robustness/robustness_benchmark.cpp       | 27 +++++++++++--------
 3 files changed, 43 insertions(+), 35 deletions(-)

diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py
index 9e5fead9f864..9def2bb6cc16 100755
--- a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py
@@ -23,18 +23,19 @@ def compute_robustness_benchmark_data(execname, filename, alpha, max_time):
 
   exit_codes = {
    0 : "VALID_SOLID_OUTPUT",
-   1 : "OUTPUT_IS_NOT_TRIANGLE_MESH",
-   2 : "OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD",
-   3 : "OUTPUT_HAS_BORDERS",
-   4 : "OUTPUT_HAS_DEGENERATED_FACES",
-   5 : "OUTPUT_HAS_GEOMETRIC_SELF_INTERSECTIONS",
-   6 : "OUTPUT_DOES_NOT_BOUND_VOLUME",
-   7 : "OUTPUT_DOES_NOT_CONTAIN_INPUT",
-   8 : "OUTPUT_DISTANCE_IS_TOO_LARGE",
-   9 : "SIGSEGV",
-   10 : "SIGABRT",
-   11 : "SIGFPE",
-   12 : "TIMEOUT"
+   1 : "INPUT_IS_INVALID",
+   2 : "OUTPUT_IS_NOT_TRIANGLE_MESH",
+   3 : "OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD",
+   4 : "OUTPUT_HAS_BORDERS",
+   5 : "OUTPUT_HAS_DEGENERATED_FACES",
+   6 : "OUTPUT_HAS_GEOMETRIC_SELF_INTERSECTIONS",
+   7 : "OUTPUT_DOES_NOT_BOUND_VOLUME",
+   8 : "OUTPUT_DOES_NOT_CONTAIN_INPUT",
+   9 : "OUTPUT_DISTANCE_IS_TOO_LARGE",
+   10 : "SIGSEGV",
+   11 : "SIGABRT",
+   12 : "SIGFPE",
+   13 : "TIMEOUT"
   }
 
   exit_code = 0
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/generate_robustness_benchmark_charts.py b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/generate_robustness_benchmark_charts.py
index da313069594f..f9938d4fc7b6 100644
--- a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/generate_robustness_benchmark_charts.py
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/generate_robustness_benchmark_charts.py
@@ -40,22 +40,24 @@ def main(argv):
 
   exit_codes = {
    0 : "VALID_SOLID_OUTPUT",
-   1 : "OUTPUT_IS_NOT_TRIANGLE_MESH",
-   2 : "OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD",
-   3 : "OUTPUT_HAS_BORDERS",
-   4 : "OUTPUT_HAS_DEGENERATED_FACES",
-   5 : "OUTPUT_HAS_GEOMETRIC_SELF_INTERSECTIONS",
-   6 : "OUTPUT_DOES_NOT_BOUND_VOLUME",
-   7 : "OUTPUT_DOES_NOT_CONTAIN_INPUT",
-   8 : "OUTPUT_DISTANCE_IS_TOO_LARGE",
-   9 : "SIGSEGV",
-   10 : "SIGABRT",
-   11 : "SIGFPE",
-   12 : "TIMEOUT"
+   1 : "INPUT_IS_INVALID",
+   2 : "OUTPUT_IS_NOT_TRIANGLE_MESH",
+   3 : "OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD",
+   4 : "OUTPUT_HAS_BORDERS",
+   5 : "OUTPUT_HAS_DEGENERATED_FACES",
+   6 : "OUTPUT_HAS_GEOMETRIC_SELF_INTERSECTIONS",
+   7 : "OUTPUT_DOES_NOT_BOUND_VOLUME",
+   8 : "OUTPUT_DOES_NOT_CONTAIN_INPUT",
+   9 : "OUTPUT_DISTANCE_IS_TOO_LARGE",
+   10 : "SIGSEGV",
+   11 : "SIGABRT",
+   12 : "SIGFPE",
+   13 : "TIMEOUT"
   }
 
   current_run_data = {
    "VALID_SOLID_OUTPUT" : 0,
+   "INPUT_IS_INVALID" : 0,
    "OUTPUT_IS_NOT_TRIANGLE_MESH" : 0,
    "OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD" : 0,
    "OUTPUT_HAS_BORDERS" : 0,
diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp
index 57f58b342bd5..353e5569d1f9 100644
--- a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp
@@ -21,14 +21,15 @@ enum Robustness_benchmark_exit_code
   VALID_SOLID_OUTPUT = 0,
 
   // Failure
-  OUTPUT_IS_NOT_TRIANGLE_MESH = 1,
-  OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD = 2,
-  OUTPUT_HAS_BORDERS = 3,
-  OUTPUT_HAS_DEGENERATED_FACES = 4,
-  OUTPUT_HAS_GEOMETRIC_SELF_INTERSECTIONS = 5,
-  OUTPUT_DOES_NOT_BOUND_VOLUME = 6,
-  OUTPUT_DOES_NOT_CONTAIN_INPUT = 7,
-  OUTPUT_DISTANCE_IS_TOO_LARGE = 8,
+  INTPUT_IS_INVALID = 1,
+  OUTPUT_IS_NOT_TRIANGLE_MESH = 2,
+  OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD = 3,
+  OUTPUT_HAS_BORDERS = 4,
+  OUTPUT_HAS_DEGENERATED_FACES = 5,
+  OUTPUT_HAS_GEOMETRIC_SELF_INTERSECTIONS = 6,
+  OUTPUT_DOES_NOT_BOUND_VOLUME = 7,
+  OUTPUT_DOES_NOT_CONTAIN_INPUT = 8,
+  OUTPUT_DISTANCE_IS_TOO_LARGE = 9,
 };
 
 } // namespace
@@ -58,14 +59,18 @@ int main(int argc, char** argv)
   }
 
   if(argc < 3 || relative_alpha_ratio <= 0.)
-    return AW3i::VALID_SOLID_OUTPUT;
+    return AW3i::INTPUT_IS_INVALID;
 
   Mesh input_mesh;
   if(!PMP::IO::read_polygon_mesh(entry_name_ptr, input_mesh) ||
      is_empty(input_mesh) ||
-     !is_triangle_mesh(input_mesh))
+     !is_triangle_mesh(input_mesh)
+#ifndef CGAL_ALPHA_WRAP_3_TOLERATE_DEGENERACIES
+     || AW3i::has_degenerated_faces(input_mesh)
+#endif
+     )
   {
-    return AW3i::VALID_SOLID_OUTPUT;
+    return AW3i::INTPUT_IS_INVALID;
   }
 
   const CGAL::Bbox_3 bbox = PMP::bbox(input_mesh);

From e6b84d48513ab52a4b0b6d973509d03d22f251b3 Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Wed, 18 Oct 2023 10:19:23 +0200
Subject: [PATCH 0904/1398] typo

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 .../CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
index 4e9082996e49..8cd6dc4f6ccc 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
@@ -41,7 +41,7 @@ namespace Polygon_mesh_processing {
  *
  * @param pm the polygon mesh to be refined.
  * @param value_map the property map containing a value at each vertex for a given function defined over the mesh.
- * @param isovalue the value used to defined
+ * @param isovalue the value used to refine
  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
  *
  * \cgalNamedParamsBegin

From 2c19ffcd8bce9eef3a5a6a35189dfc5bc2358c19 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 18 Oct 2023 10:29:28 +0200
Subject: [PATCH 0905/1398] Add a warning

---
 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 45834cd6b61f..94694034cdd1 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -281,6 +281,9 @@ class Alpha_wrapper_3
 
     // Whether to keep pockets of "outside" cells that are not connected to the exterior (or to the
     // initial cavities, if used).
+    //
+    // /!\ Warning /!\
+    // If you refine or pause while removing pockets, you will get valid but different wraps.
     const bool keep_inner_ccs = choose_parameter(get_parameter(in_np, internal_np::keep_inner_connected_components), true);
 
     // This parameter enables avoiding recomputing the triangulation from scratch when wrapping

From 18e233c036feebe9bbc08c39653f39e910b5abea Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 18 Oct 2023 11:56:00 +0200
Subject: [PATCH 0906/1398] fix warnings

---
 .../Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp | 4 +++-
 .../demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp       | 2 +-
 2 files changed, 4 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp
index 975c8aac622d..3e33a22f83d7 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Isosurfacing_3/Isosurface_3_plugin.cpp
@@ -270,7 +270,9 @@ class Polyhedron_demo_isosurface_3_plugin_helper {
 
   Word_type image_data(int i, int j, int k)
   {
-    if ( i>=0 && i<image_->xdim() && j>=0 && j<image_->ydim() && k>=0 && k<image_->zdim() )
+    if ( i>=0 && static_cast<std::size_t>(i)<image_->xdim() &&
+         j>=0 && static_cast<std::size_t>(j)<image_->ydim() &&
+         k>=0 && static_cast<std::size_t>(k)<image_->zdim() )
       return image_->value(i, j, k);
     else
       return 0;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
index 78493723e31d..0c4e1956c7db 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
@@ -973,7 +973,7 @@ void Scene_edit_box_item_priv::remodel_box(const QVector3D &dir)
   Q_FOREACH(Scene_edit_box_item::vertex*  selected_vertex, selected_vertices )
   {
     int id = selected_vertex->id;
-    CGAL_assume(id<8);
+    CGAL_assume(id<8 && id >=0);
     *selected_vertex->x = applyX(id, last_pool[id][0], dir.x());
     *selected_vertex->y = applyY(id, last_pool[id][1], dir.y());
     *selected_vertex->z = applyZ(id, last_pool[id][2], dir.z());

From e9bdc2dd889cd13f1942e9df0db9ded505aa1860 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 19 Oct 2023 10:08:14 +0200
Subject: [PATCH 0907/1398] example cleaning

---
 .../tetrahedral_remeshing_of_one_subdomain.cpp     | 14 +++++---------
 1 file changed, 5 insertions(+), 9 deletions(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
index 266e9a12964f..aae9673430a5 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
@@ -1,5 +1,3 @@
-#define CGAL_DUMP_REMESHING_STEPS
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <CGAL/Tetrahedral_remeshing/Remeshing_triangulation_3.h>
@@ -75,15 +73,13 @@ int main(int argc, char* argv[])
     cell->set_subdomain_index(subdomain_on_side_of_plane(cc, plane));
   }
 
-  std::ofstream os0("before_remeshing.mesh");
-  CGAL::IO::write_MEDIT(os0, tr);
-
   /// Remesh only the cells of subdomain 2
-  CGAL::tetrahedral_isotropic_remeshing(tr, target_edge_length);// ,
-//      CGAL::parameters::cell_is_selected_map(
-//        Cells_of_subdomain_pmap<Remeshing_triangulation>{2}));
+  CGAL::tetrahedral_isotropic_remeshing(tr,
+      target_edge_length,
+      CGAL::parameters::cell_is_selected_map(
+        Cells_of_subdomain_pmap<Remeshing_triangulation>{2}));
 
-  std::ofstream os("after_remeshing.mesh");
+  std::ofstream os("out.mesh");
   CGAL::IO::write_MEDIT(os, tr);
 
   return EXIT_SUCCESS;

From b7eb266cb6e2e89da38286cf90c5c71268a5163a Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 19 Oct 2023 10:19:41 +0200
Subject: [PATCH 0908/1398] user manual - 0 subdomain

---
 .../doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt   | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
index 5ae7a8273737..0500556f0746 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
@@ -70,6 +70,10 @@ The only required parameter is a given target edge length that drives the remesh
 towards a high-quality tetrahedral mesh with improved dihedral angles, and a more
 uniform mesh, with edge lengths getting closer to the input parameter value.
 
+By default, the cells with a non-zero `Subdomain_index` are
+selected for remeshing. The cells with `Subdomain_index` equal to zero
+are ignored by the remeshing algorithm.
+
 \cgalExample{Tetrahedral_remeshing/tetrahedral_remeshing_example.cpp }
 
 
@@ -81,6 +85,10 @@ control on the remeshing process. In this example, a triangulation with two subd
 (defined by the `Subdomain_index` 2)
 of its subdomains is remeshed.
 
+Only the cells with a non-zero `Subdomain_index` will be remeshed.
+The named parameter `cell_is_selected_map` can be used to change this
+behavior.
+
 \cgalExample{Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp }
 
 

From c799051e2b56651cc1f77bcfb471d84ac79156b5 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 19 Oct 2023 11:13:28 +0200
Subject: [PATCH 0909/1398] add vertices() function for every dimension of
 simplex in T3

returns a std::array of vertices
---
 .../include/CGAL/Triangulation_3.h            | 28 +++++++++++++++++++
 1 file changed, 28 insertions(+)

diff --git a/Triangulation_3/include/CGAL/Triangulation_3.h b/Triangulation_3/include/CGAL/Triangulation_3.h
index 7b8ef9ab6c8a..3ea36ba23618 100644
--- a/Triangulation_3/include/CGAL/Triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_3.h
@@ -76,6 +76,7 @@
 #include <unordered_map>
 #include <utility>
 #include <stack>
+#include <array>
 
 #define CGAL_TRIANGULATION_3_USE_THE_4_POINTS_CONSTRUCTOR
 
@@ -1919,6 +1920,33 @@ class Triangulation_3
     return Points(points_begin(),points_end());
   }
 
+  /// Vertex ranges defining a simplex
+  std::array<Vertex_handle, 1> vertices(const Vertex_handle v) const
+  {
+    return std::array<Vertex_handle, 1>{v};
+  }
+  std::array<Vertex_handle, 2> vertices(const Edge& e) const
+  {
+    return std::array<Vertex_handle, 2>{
+             e.first->vertex(e.second),
+             e.first->vertex(e.third)};
+  }
+  std::array<Vertex_handle, 3> vertices(const Facet& f) const
+  {
+    return std::array<Vertex_handle, 3>{
+             f.first->vertex(vertex_triple_index(f.second, 0)),
+             f.first->vertex(vertex_triple_index(f.second, 1)),
+             f.first->vertex(vertex_triple_index(f.second, 2))};
+  }
+  std::array<Vertex_handle, 4> vertices(const Cell_handle c) const
+  {
+    return std::array<Vertex_handle, 4>{
+             c->vertex(0),
+             c->vertex(1),
+             c->vertex(2),
+             c->vertex(3)};
+  }
+
   // cells around an edge
   Cell_circulator incident_cells(const Edge& e) const
   {

From 152e473458840b7981dd538f602aefeadd279868 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 19 Oct 2023 11:13:47 +0200
Subject: [PATCH 0910/1398] test vertices() helper functions

---
 .../include/CGAL/_test_cls_iterator.h         | 35 +++++++++++++++++++
 .../include/CGAL/_test_cls_triangulation_3.h  | 10 +++++-
 2 files changed, 44 insertions(+), 1 deletion(-)

diff --git a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_iterator.h b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_iterator.h
index 7c6131620c50..54fd7dd79b63 100644
--- a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_iterator.h
+++ b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_iterator.h
@@ -268,4 +268,39 @@ _test_triangulation_iterator( const Triangulation &T )
   return(n-m+f-t);
 }
 
+template < class Triangulation >
+void
+_test_vertices_array(const Triangulation& tr)
+{
+  typedef typename Triangulation::Facet           Facet;
+  typedef typename Triangulation::Edge            Edge;
+  typedef typename Triangulation::Vertex_handle   Vertex_handle;
+  typedef typename Triangulation::Cell_handle     Cell_handle;
+
+  for (const Vertex_handle vh : tr.all_vertex_handles())
+  {
+    std::array<Vertex_handle, 1> vv = tr.vertices(vh);
+    assert(vv[0] == vh);
+  }
+  for (const Edge& e : tr.all_edges())
+  {
+    std::array<Vertex_handle, 2> vv = tr.vertices(e);
+    assert(vv[0] != vv[1]);
+  }
+  for (const Facet& f : tr.all_facets())
+  {
+    std::array<Vertex_handle, 3> vv = tr.vertices(f);
+    assert(vv[0] != vv[1]);
+    assert(vv[0] != vv[2]);
+    assert(vv[1] != vv[2]);
+  }
+  for (const Cell_handle c : tr.all_cell_handles())
+  {
+    std::array<Vertex_handle, 4> vv = tr.vertices(c);
+    assert(vv[0] != vv[1] && vv[0] != vv[2] && vv[0] != vv[3]);
+    assert(vv[1] != vv[2] && vv[1] != vv[3]);
+    assert(vv[2] != vv[3]);
+  }
+}
+
 #endif // CGAL_TEST_CLS_ITERATOR_C
diff --git a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_triangulation_3.h b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_triangulation_3.h
index 21c8ee2d9965..bfa1da519757 100644
--- a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_triangulation_3.h
+++ b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_triangulation_3.h
@@ -1031,23 +1031,31 @@ _test_cls_triangulation_3(const Triangulation &)
   Point p28(1,3,5);
   v0=T0_1.insert(p28);
 
-  std::cout << "    Testing Iterator   "<< std::endl;
+  std::cout << "    Testing Iterators and Ranges   "<< std::endl;
   _test_vertex_iterator(T0_1);
   _test_triangulation_iterator(T0_1);
+  _test_vertices_array(T0_1);
   _test_vertex_iterator(T0);
   _test_triangulation_iterator(T0);
+  _test_vertices_array(T0);
   _test_vertex_iterator(T2_0);
   _test_triangulation_iterator(T2_0);
+  _test_vertices_array(T2_0);
   _test_vertex_iterator(T1_0);
   _test_triangulation_iterator(T1_0);
+  _test_vertices_array(T1_0);
   _test_vertex_iterator(T3_1);
   _test_triangulation_iterator(T3_1);
+  _test_vertices_array(T3_1);
   _test_vertex_iterator(T3_0);
   _test_triangulation_iterator(T3_0);
+  _test_vertices_array(T3_0);
   _test_vertex_iterator(T3_2);
   _test_triangulation_iterator(T3_2);
+  _test_vertices_array(T3_2);
   _test_vertex_iterator(T3_3);
   _test_triangulation_iterator(T3_3);
+  _test_vertices_array(T3_3);
 
   std::cout << "    Testing Circulator  "<< std::endl;
   _test_circulator(T0);

From fbfcbe43d8793d9136a883693d9e7b4504bd5f62 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 19 Oct 2023 11:18:41 +0200
Subject: [PATCH 0911/1398] add documentation for the `vertices()` functions

---
 .../Triangulation_3/CGAL/Triangulation_3.h    | 20 +++++++++++++++++++
 1 file changed, 20 insertions(+)

diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
index 70a2830c48c0..c3e6d185732d 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
@@ -1303,6 +1303,26 @@ Finite_vertex_handles finite_vertex_handles() const;
 */
 Points points() const;
 
+/*!
+* returns an array of `Vertex_handle`s containing `v`
+*/
+std::array<Vertex_handle, 1> vertices(const Vertex_handle v) const;
+
+/*!
+* returns an array of `Vertex_handle`s containing the end-vertices of `e`
+*/
+std::array<Vertex_handle, 2> vertices(const Edge& e) const;
+
+/*!
+* returns an array of `Vertex_handle`s containing the vertices of `f`
+*/
+std::array<Vertex_handle, 3> vertices(const Facet& f) const;
+
+/*!
+* returns an array of `Vertex_handle`s containing the vertices of `c`
+*/
+std::array<Vertex_handle, 4> vertices(const Cell_handle c) const;
+
 /*!
   returns a range of iterators over the cells intersected by a line segment
 */

From 47e17d0a2c68b616c32cbadf69f81c1a51c38c7d Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 19 Oct 2023 11:53:56 +0200
Subject: [PATCH 0912/1398] remove vertices(vertex) that is useless

---
 Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h   | 5 -----
 Triangulation_3/include/CGAL/Triangulation_3.h               | 4 ----
 .../test/Triangulation_3/include/CGAL/_test_cls_iterator.h   | 5 -----
 3 files changed, 14 deletions(-)

diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
index c3e6d185732d..7222277125b6 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
@@ -1303,11 +1303,6 @@ Finite_vertex_handles finite_vertex_handles() const;
 */
 Points points() const;
 
-/*!
-* returns an array of `Vertex_handle`s containing `v`
-*/
-std::array<Vertex_handle, 1> vertices(const Vertex_handle v) const;
-
 /*!
 * returns an array of `Vertex_handle`s containing the end-vertices of `e`
 */
diff --git a/Triangulation_3/include/CGAL/Triangulation_3.h b/Triangulation_3/include/CGAL/Triangulation_3.h
index 3ea36ba23618..c5ee70bbc430 100644
--- a/Triangulation_3/include/CGAL/Triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_3.h
@@ -1921,10 +1921,6 @@ class Triangulation_3
   }
 
   /// Vertex ranges defining a simplex
-  std::array<Vertex_handle, 1> vertices(const Vertex_handle v) const
-  {
-    return std::array<Vertex_handle, 1>{v};
-  }
   std::array<Vertex_handle, 2> vertices(const Edge& e) const
   {
     return std::array<Vertex_handle, 2>{
diff --git a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_iterator.h b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_iterator.h
index 54fd7dd79b63..3569cee02d4c 100644
--- a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_iterator.h
+++ b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_iterator.h
@@ -277,11 +277,6 @@ _test_vertices_array(const Triangulation& tr)
   typedef typename Triangulation::Vertex_handle   Vertex_handle;
   typedef typename Triangulation::Cell_handle     Cell_handle;
 
-  for (const Vertex_handle vh : tr.all_vertex_handles())
-  {
-    std::array<Vertex_handle, 1> vv = tr.vertices(vh);
-    assert(vv[0] == vh);
-  }
   for (const Edge& e : tr.all_edges())
   {
     std::array<Vertex_handle, 2> vv = tr.vertices(e);

From b025214974d2070b70838d265f821619decdac13 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 19 Oct 2023 11:33:34 +0100
Subject: [PATCH 0913/1398] Remove dead code

---
 .../Power_side_of_oriented_power_sphere_3.h   | 172 +-----------------
 1 file changed, 1 insertion(+), 171 deletions(-)

diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
index d4621b756a54..4e7afd2b7ad0 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
@@ -371,7 +371,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
         if( max5 < aqx_rx ) max5 = aqx_rx;
         double max6 = CGAL::abs(qy_ry);
         if( max6 < apy_ry ) max6 = apy_ry;
-        if( (cmp != 0) )
+        //if( (cmp != 0) )
         {
             int int_tmp_result_FFWKCAA;
             double double_tmp_result;
@@ -412,176 +412,6 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
             }
             return static_cast<result_type>(cmp * int_tmp_result_FFWKCAA);
         }
-        int int_tmp_result_k60Ocge;
-        double RT_tmp_result_3SPBwDj = CGAL::determinant( dpx, dpz, dpt, dqx, dqz, dqt, drx, drz, drt );
-        lower_bound_1 = max1;
-        upper_bound_1 = max1;
-        if( (max7 < lower_bound_1) ) lower_bound_1 = max7;
-        if( (max2 < lower_bound_1) ) lower_bound_1 = max2;
-        //handwritten workaround to handle case where all weights are equal
-        //if( ((lower_bound_1 < 2.92391967062015793913e-74) || (max4 < 8.54930624023949352313e-148)) )
-        if( ((lower_bound_1 < 2.92391967062015793913e-74) || (max4 < 8.54930624023949352313e-148 && max4!=0)) )
-        {
-          CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-          return Base::operator()(p,q,r,t);
-        }
-        else
-        {
-            if( ((upper_bound_1 > 7.23700557733225980357e+75) || (max4 > 5.23742497263382350320e+151)) )
-            {
-              CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-              return Base::operator()(p,q,r,t);
-            }
-            eps = (3.04426660386257731823e-14 * ((max2 * max7) * (CGAL::max)( max4, (max1 * max1) )));
-            if( (RT_tmp_result_3SPBwDj > eps) )
-            {
-                int_tmp_result_k60Ocge = 1;
-            }
-            else
-            {
-                if( (RT_tmp_result_3SPBwDj < -eps) )
-                {
-                    int_tmp_result_k60Ocge = -1;
-                }
-                else
-                {
-                  CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-                  return Base::operator()(p,q,r,t);
-                }
-            }
-        }
-        cmp = int_tmp_result_k60Ocge;
-        double qz_rz = (qz - rz);
-        double pz_rz = (pz - rz);
-        double max8 = CGAL::abs(qz_rz);
-        double apz_rz =  CGAL::abs(pz_rz);
-        if( max8 < apz_rz ) max8 = apz_rz;
-        if( (cmp != 0) )
-        {
-            int int_tmp_result_k3Lzf6g;
-            double double_tmp_result_Gx4H;
-            double_tmp_result_Gx4H = ((px_rx * qz_rz) - (qx_rx * pz_rz));
-            lower_bound_1 = max5;
-            upper_bound_1 = max5;
-            if( (max8 < lower_bound_1) ) lower_bound_1 = max8;
-            else
-            {
-                if( (max8 > upper_bound_1) ) upper_bound_1 = max8;
-            }
-            if( (lower_bound_1 < 5.00368081960964690982e-147) )
-            {
-              CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-              return Base::operator()(p,q,r,t);
-            }
-            else
-            {
-                if( (upper_bound_1 > 7.23700557733225980357e+75) )
-                {
-                  CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-                  return Base::operator()(p,q,r,t);
-                }
-                eps = (8.88720573725927976811e-16 * (max5 * max8));
-                if( (double_tmp_result_Gx4H > eps) )
-                {
-                    int_tmp_result_k3Lzf6g = 1;
-                }
-                else
-                {
-                    if( (double_tmp_result_Gx4H < -eps) )
-                    {
-                        int_tmp_result_k3Lzf6g = -1;
-                    }
-                    else
-                    {
-                      CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-                      return Base::operator()(p,q,r,t);
-                    }
-                }
-            }
-            return static_cast<result_type>(cmp * int_tmp_result_k3Lzf6g);
-        }
-        int int_tmp_result_AvrrXBP;
-        double RT_tmp_result_feLwnHn = CGAL::determinant( dpy, dpz, dpt, dqy, dqz, dqt, dry, drz, drt );
-        lower_bound_1 = max1;
-        upper_bound_1 = max1;
-        if( (max7 < lower_bound_1) ) lower_bound_1 = max7;
-        if( (max3 < lower_bound_1) ) lower_bound_1 = max3;
-        //handwritten workaround to handle case where all weights are equal
-        //if( ((lower_bound_1 < 2.92391967062015793913e-74) || (max4 < 8.54930624023949352313e-148)) )
-        if( ((lower_bound_1 < 2.92391967062015793913e-74) || (max4 < 8.54930624023949352313e-148 && max4!=0)) )
-        {
-          CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-          return Base::operator()(p,q,r,t);
-        }
-        else
-        {
-            if( ((upper_bound_1 > 7.23700557733225980357e+75) || (max4 > 5.23742497263382350320e+151)) )
-            {
-              CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-              return Base::operator()(p,q,r,t);
-            }
-            eps = (3.04426660386257731823e-14 * ((max3 * max7) * (CGAL::max)( max4, (max1 * max1) )));
-            if( (RT_tmp_result_feLwnHn > eps) )
-            {
-                int_tmp_result_AvrrXBP = 1;
-            }
-            else
-            {
-                if( (RT_tmp_result_feLwnHn < -eps) )
-                {
-                    int_tmp_result_AvrrXBP = -1;
-                }
-                else
-                {
-                  CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-                  return Base::operator()(p,q,r,t);
-                }
-            }
-        }
-        cmp = int_tmp_result_AvrrXBP;
-        int int_tmp_result_agX3WsT;
-        double double_tmp_result_Dw20Kqh = ((py_ry * qz_rz) - (qy_ry * pz_rz));
-        lower_bound_1 = max8;
-        upper_bound_1 = max8;
-        if( (max6 < lower_bound_1) )
-        {
-            lower_bound_1 = max6;
-        }
-        else
-        {
-            if( (max6 > upper_bound_1) ) upper_bound_1 = max6;
-        }
-        if( (lower_bound_1 < 5.00368081960964690982e-147) )
-        {
-          CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-          return Base::operator()(p,q,r,t);
-        }
-        else
-        {
-            if( (upper_bound_1 > 7.23700557733225980357e+75) )
-            {
-              CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-              return Base::operator()(p,q,r,t);
-            }
-            eps = (8.88720573725927976811e-16 * (max6 * max8));
-            if( (double_tmp_result_Dw20Kqh > eps) )
-            {
-                int_tmp_result_agX3WsT = 1;
-            }
-            else
-            {
-                if( (double_tmp_result_Dw20Kqh < -eps) )
-                {
-                    int_tmp_result_agX3WsT = -1;
-                }
-                else
-                {
-                  CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-                  return Base::operator()(p,q,r,t);
-                }
-            }
-        }
-        return static_cast<result_type>(cmp * int_tmp_result_agX3WsT);
       }
       else
         return Base::operator()(p,q,r,t);

From c985988789d513f8dcfb36642ea5d1756406374d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 19 Oct 2023 11:35:37 +0100
Subject: [PATCH 0914/1398] Reindent

---
 .../Power_side_of_oriented_power_sphere_3.h   | 76 +++++++++----------
 1 file changed, 37 insertions(+), 39 deletions(-)

diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
index 4e7afd2b7ad0..9f0554bc9e19 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
@@ -371,47 +371,45 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
         if( max5 < aqx_rx ) max5 = aqx_rx;
         double max6 = CGAL::abs(qy_ry);
         if( max6 < apy_ry ) max6 = apy_ry;
-        //if( (cmp != 0) )
-        {
-            int int_tmp_result_FFWKCAA;
-            double double_tmp_result;
-            double_tmp_result = ((px_rx * qy_ry) - (qx_rx * py_ry));
-            lower_bound_1 = max5;
-            upper_bound_1 = max5;
-            if( (max6 < lower_bound_1) ) lower_bound_1 = max6;
-            else
-            {
-                if( (max6 > upper_bound_1) ) upper_bound_1 = max6;
-            }
-            if( (lower_bound_1 < 5.00368081960964690982e-147) )
-            {
-              CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-              return Base::operator()(p,q,r,t);
-            }
+
+        int int_tmp_result_FFWKCAA;
+        double double_tmp_result;
+        double_tmp_result = ((px_rx * qy_ry) - (qx_rx * py_ry));
+        lower_bound_1 = max5;
+        upper_bound_1 = max5;
+        if( (max6 < lower_bound_1) ) lower_bound_1 = max6;
+        else
+          {
+            if( (max6 > upper_bound_1) ) upper_bound_1 = max6;
+          }
+        if( (lower_bound_1 < 5.00368081960964690982e-147) )
+          {
+            CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
+            return Base::operator()(p,q,r,t);
+          }
+        else
+          {
+            if( (upper_bound_1 > 7.23700557733225980357e+75) )
+              {
+                CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
+                return Base::operator()(p,q,r,t);
+              }
+            double eps = (8.88720573725927976811e-16 * (max5 * max6));
+            if( (double_tmp_result > eps) ) int_tmp_result_FFWKCAA = 1;
             else
-            {
-                if( (upper_bound_1 > 7.23700557733225980357e+75) )
-                {
-                  CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-                  return Base::operator()(p,q,r,t);
-                }
-                double eps = (8.88720573725927976811e-16 * (max5 * max6));
-                if( (double_tmp_result > eps) ) int_tmp_result_FFWKCAA = 1;
+              {
+                if( (double_tmp_result < -eps) )
+                  {
+                    int_tmp_result_FFWKCAA = -1;
+                  }
                 else
-                {
-                    if( (double_tmp_result < -eps) )
-                    {
-                        int_tmp_result_FFWKCAA = -1;
-                    }
-                    else
-                    {
-                      CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
-                      return Base::operator()(p,q,r,t);
-                    }
-                }
-            }
-            return static_cast<result_type>(cmp * int_tmp_result_FFWKCAA);
-        }
+                  {
+                    CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
+                    return Base::operator()(p,q,r,t);
+                  }
+              }
+          }
+        return static_cast<result_type>(cmp * int_tmp_result_FFWKCAA);
       }
       else
         return Base::operator()(p,q,r,t);

From e28d44305e631dc9a3a46b0b6daeb5530ebedb71 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 19 Oct 2023 12:59:07 +0100
Subject: [PATCH 0915/1398] Replace hal related URLs

---
 Documentation/doc/biblio/cgal_manual.bib      |    162 +-
 Documentation/doc/biblio/geom.bib             | 217198 +++++++--------
 .../File_formats/Supported_file_formats.txt   |      2 +-
 3 files changed, 108681 insertions(+), 108681 deletions(-)

diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib
index 371192f94238..ce72340b8f58 100644
--- a/Documentation/doc/biblio/cgal_manual.bib
+++ b/Documentation/doc/biblio/cgal_manual.bib
@@ -100,7 +100,7 @@ @article{cgal:acyd-vtm-05
 , pages     = "617--625"
 , note = "SIGGRAPH '2005 Conference Proceedings"
 , volume = 24
-, url = "https://hal.inria.fr/inria-00226418"
+, url = "https://inria.hal.science/inria-00226418"
 , geombib = "not yet"
 }
 
@@ -157,7 +157,7 @@ @article{ cgal:bdpty-tc-02
 @ARTICLE{cgal:bdt-hdcvd-14,
    AUTHOR       = {Mikhail Bogdanov and Olivier Devillers and Monique Teillaud},
    JOURNAL      = {Journal of Computational Geometry},
-   NOTE         = {https://hal.inria.fr/hal-00961390},
+   NOTE         = {https://inria.hal.science/hal-00961390},
    PAGES        = {56--85},
    TITLE        = {Hyperbolic {Delaunay} complexes and {Voronoi} diagrams made practical},
    VOLUME       = {5},
@@ -243,7 +243,7 @@ @inproceedings{cgal:byb-mgmmi-09
 Boissonnat}
 ,   title     = {Mesh Generation from 3D Multi-material Images}
 ,   pages     = {283--290}
-, url = "https://hal.inria.fr/inria-00420228"
+, url = "https://inria.hal.science/inria-00420228"
 , x-international-audience = "yes"
 , x-proceedings = "yes"
 }
@@ -257,7 +257,7 @@ @article{cgal:-byb-fpdmgmmi-09
 , pages     = "1455-14645"
 , volume    = 28
 , year      = 2009
-, url = "https://hal.inria.fr/inria-00413248"
+, url = "https://inria.hal.science/inria-00413248"
 , x-international-audience = "yes"
 , x-editorial-board = "yes"
 }
@@ -361,7 +361,7 @@ @INPROCEEDINGS{ cgal:btv-dtosl-16
    TITLE        = {Delaunay triangulations on orientable surfaces of low genus},
    YEAR         = {2016},
    DOI          = {10.4230/LIPIcs.SoCG.2016.20},
-   URL          = {https://hal.inria.fr/hal-01276386}
+   URL          = {https://inria.hal.science/hal-01276386}
 }
 
 
@@ -402,7 +402,7 @@ @phdthesis{ cgal:c-tpsos-10
   ,school       = "Universit\'e de {Nice-Sophia Antipolis}"
   ,address      = "France"
   ,year         = 2010
-  ,url          = "https://tel.archives-ouvertes.fr/tel-00552215/"
+  ,url          = "https://theses.hal.science/tel-00552215/"
 }
 
 @inproceedings{cgal:ccplr-redtp-10,
@@ -539,13 +539,13 @@ @inproceedings{ cgal:csm-rdtnc-03
 @inproceedings{ cgal:ct-c3pt-09
 , title       = "Computing {3D} Periodic Triangulations"
 , author      = "Manuel Caroli and Monique Teillaud"
-, booktitle   =	"Proceedings 17th European Symposium on Algorithms"
-, nickname    =	"ESA'09"
+, booktitle   = "Proceedings 17th European Symposium on Algorithms"
+, nickname    = "ESA'09"
 , series      = "Lecture Notes in Computer Science"
 , year        = 2009
 , volume      = 5757
 , pages       = "37--48"
-, note         = "Full version available as INRIA Research Report 6823 \url{https://hal.inria.fr/inria-00356871}"
+, note         = "Full version available as INRIA Research Report 6823 \url{https://inria.hal.science/inria-00356871}"
 }
 
 @inproceedings{cgal:pt-rs-14,
@@ -729,7 +729,7 @@ @article{ cgal:dma-ipsm-02
 
 @article{cgal:dmsl-ssmrp-11,
   author = {Digne, Julie and Morel, Jean-Michel and Souzani, Charyar-Mehdi and
-	Lartigue, Claire},
+        Lartigue, Claire},
   title = {Scale Space Meshing of Raw Data Point Sets},
   journal = {Computer Graphics Forum},
   year = {2011},
@@ -741,13 +741,13 @@ @article{cgal:dmsl-ssmrp-11
 }
 
 @inproceedings{ cgal:dp-eegpd-03
-  , author =	"Olivier Devillers and Sylvain Pion"
-  , title =	"Efficient Exact Geometric Predicates for {Delaunay} Triangulations"
-  , booktitle =	"Proc. 5th Workshop Algorithm Eng. Exper."
-  , nickname =	"ALENEX '03"
-  , year =	2003
-  , pages =	"37--44"
-  , url   =     "https://hal.inria.fr/inria-00344517/"
+  , author =    "Olivier Devillers and Sylvain Pion"
+  , title =     "Efficient Exact Geometric Predicates for {Delaunay} Triangulations"
+  , booktitle = "Proc. 5th Workshop Algorithm Eng. Exper."
+  , nickname =  "ALENEX '03"
+  , year =      2003
+  , pages =     "37--44"
+  , url   =     "https://inria.hal.science/inria-00344517/"
 }
 
 @article{ cgal:dpt-wt-02
@@ -766,7 +766,7 @@ @inproceedings{ cgal:dt-pvr3d-03
   , author =      "Olivier Devillers and Monique Teillaud"
   , title =  "Perturbations and Vertex Removal in a {3D Delaunay} Triangulation"
   , booktitle =   "Proc. 14th ACM-SIAM Sympos. Discrete Algorithms (SODA)"
-  , url         = "https://hal.inria.fr/inria-00166710/"
+  , url         = "https://inria.hal.science/inria-00166710/"
   , year =    2003
   , pages = "313-319"
 }
@@ -778,7 +778,7 @@ @article{cgal:dt-pvrdr-06
 , volume      = 44
 , year        = 2011
 , pages       = "160--168"
-, url         = "https://hal.archives-ouvertes.fr/inria-00560388/"
+, url         = "https://theses.hal.science/inria-00560388/"
 , doi         = "10.1016/j.comgeo.2010.09.010"
 }
 
@@ -845,7 +845,7 @@ @phdthesis{ cgal:f-csapc-03
   ,school       = "Universit\'e de {Nice-Sophia Antipolis}"
   ,address      = "France"
   ,year         = 2003
-  ,url          = "https://tel.archives-ouvertes.fr/tel-00832487/"
+  ,url          = "https://theses.hal.science/tel-00832487/"
 }
 
 
@@ -1230,7 +1230,7 @@ @INPROCEEDINGS{cgal:it-idtbs-17
    TITLE        = {{Implementing Delaunay triangulations of the Bolza surface}},
    YEAR         = {2017},
    DOI          = {10.4230/LIPIcs.SoCG.2017.44},
-   URL          = {https://hal.inria.fr/hal-01568002},
+   URL          = {https://inria.hal.science/hal-01568002},
 }
 
 @inproceedings{cgal:j-lrsspp-19,
@@ -1261,13 +1261,13 @@ @incollection{ cgal:k-dat-96
 
 
 @InProceedings{ cgal:k-reisv-04,
-  author = 	 {Menelaos I. Karavelas},
-  title = 	 {A robust and efficient implementation for the segment
+  author =       {Menelaos I. Karavelas},
+  title =        {A robust and efficient implementation for the segment
                   {V}oronoi diagram},
   booktitle = {Proc. Internat. Symp. on Voronoi diagrams in Science
                   and Engineering (VD2004)},
-  pages = 	 {51--62},
-  year = 	 {2004}
+  pages =        {51--62},
+  year =         {2004}
 }
 
 @article{ cgal:k-rprnm-96
@@ -1599,12 +1599,12 @@ @article{cgal:mbrsh-raofw-11
 }
 
 @article{cgal:ml-cfsg-00
-, author =	"G. Medioni and M. Lee and C. Tang"
-, title =	"A Computational Framework for Segmentation and Grouping"
-, journal =	"Elsevier Science"
-, year =	2000
-, pages =	""
-, update =	"12.13 afabri"
+, author =      "G. Medioni and M. Lee and C. Tang"
+, title =       "A Computational Framework for Segmentation and Grouping"
+, journal =     "Elsevier Science"
+, year =        2000
+, pages =       ""
+, update =      "12.13 afabri"
 }
 
 @book{ cgal:m-cst-93
@@ -1887,28 +1887,28 @@ @article{ cgal:p-smrqt-01
 @article{cgal:btsag-asosr-16,
   TITLE = {{A Survey of Surface Reconstruction from Point Clouds}},
   AUTHOR = {Berger, Matthew and Tagliasacchi, Andrea and Seversky, Lee and Alliez, Pierre and Guennebaud, Gael and Levine, Joshua and Sharf, Andrei and Silva, Claudio},
-  URL = {https://hal.inria.fr/hal-01348404},
+  URL = {https://inria.hal.science/hal-01348404},
   JOURNAL = {{Computer Graphics Forum}},
   PUBLISHER = {{Wiley}},
   PAGES = {27},
   YEAR = {2016},
   DOI = {10.1111/cgf.12802},
-  PDF = {https://hal.inria.fr/hal-01348404/file/survey-author.pdf},
+  PDF = {https://inria.hal.science/hal-01348404/file/survey-author.pdf},
   HAL_ID = {hal-01348404},
   HAL_VERSION = {v2}
 }
 
 
 @TechReport{ cgal:pabl-cco-07,
-	author 	    = {Poudret, M. and Arnould, A. and Bertrand, Y. and Lienhardt, P.},
-	title 	    = {Cartes Combinatoires Ouvertes.},
-	institution = {Laboratoire SIC E.A. 4103},
-	number 	    = {2007-1},
-	month 	    = {October},
-	year 	    = {2007},
-	address     = {F-86962 Futuroscope Cedex, France},
-	type 	    = {Research Notes},
-	keywords    = {cartes combinatoires, demi-ar{\^e}te, ar{\^e}te radiale},
+        author      = {Poudret, M. and Arnould, A. and Bertrand, Y. and Lienhardt, P.},
+        title       = {Cartes Combinatoires Ouvertes.},
+        institution = {Laboratoire SIC E.A. 4103},
+        number      = {2007-1},
+        month       = {October},
+        year        = {2007},
+        address     = {F-86962 Futuroscope Cedex, France},
+        type        = {Research Notes},
+        keywords    = {cartes combinatoires, demi-ar{\^e}te, ar{\^e}te radiale},
 }
 
 @article{ cgal:pc-rdp-86
@@ -2293,7 +2293,7 @@ @article{cgal:twad-iropitmg-09
 , pages     = "75:1-75:9"
 , note = "SIGGRAPH '2009 Conference Proceedings"
 , volume = "28(3)"
-, url = "https://hal.inria.fr/inria-00359288"
+, url = "https://inria.hal.science/inria-00359288"
 , geombib = "not yet"
 , x-editorial-board = {yes}
 , x-proceedings = {yes}
@@ -2332,7 +2332,7 @@ @article{ cgal:v-et-95
   ,month        = jun
   ,pages        = {26--31}
   ,annote       = {Inlining vector expressions and parameter passing
-		     of expressions at compile time. Template Metaprograms.}
+                     of expressions at compile time. Template Metaprograms.}
   ,update       = "98.01 kettner"
 }
 
@@ -2354,7 +2354,7 @@ @article{ cgal:v-tm-95
   ,month        = may
   ,pages        = {36--43}
   ,annote       = {Prime numbers at compiler time, C++ programs at
-		     compile time, control structures, local variables.}
+                     compile time, control structures, local variables.}
   ,update       = "98.01 kettner"
 }
 
@@ -2422,7 +2422,7 @@ @incollection{ cgal:w-fvt-90
 @book{ cgal:w-impoo-94
   ,author       = {Josie Wernicke}
   ,title        = {The Inventor Mentor: Programming Object-Oriented
-		     3D Graphics with Open Inventor, Release 2}
+                     3D Graphics with Open Inventor, Release 2}
   ,publisher    = {Addison-Wesley}
   ,year         = 1994
   ,update       = "97.04 kettner"
@@ -2549,12 +2549,12 @@ @inproceedings{ cgal:ld-agrm-03
 }
 
 @InProceedings{cgal:k-vdc-06,
-  author = 	 {Menelaos I. Karavelas},
-  title = 	 {Voronoi diagrams in {\sc Cgal}},
+  author =       {Menelaos I. Karavelas},
+  title =        {Voronoi diagrams in {\sc Cgal}},
   booktitle = {22nd European Symposium on Computational Geometry},
-  pages = 	 {229--232},
-  year = 	 {2006},
-  address = 	 {Delphi, Greece},
+  pages =        {229--232},
+  year =         {2006},
+  address =      {Delphi, Greece},
 }
 
 @incollection{cgal:fhktww-a-07,
@@ -2607,27 +2607,27 @@ @misc{ cgal:asprs-lasf-13
 }
 
 @article{cgal:as-solri-92
-, author =	"F. Aurenhammer and O. Schwarzkopf"
-, title =	"A simple on-line randomized incremental algorithm for computing higher order {Voronoi} diagrams"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, year =	1992
-, pages =	"363--381"
-, keywords =	"Voronoi diagrams, geometric transforms, dynamization"
-, succeeds =	"as-solri-91"
-, update =	"93.09 aurenhammer, 93.05 schwarzkopf"
+, author =      "F. Aurenhammer and O. Schwarzkopf"
+, title =       "A simple on-line randomized incremental algorithm for computing higher order {Voronoi} diagrams"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, year =        1992
+, pages =       "363--381"
+, keywords =    "Voronoi diagrams, geometric transforms, dynamization"
+, succeeds =    "as-solri-91"
+, update =      "93.09 aurenhammer, 93.05 schwarzkopf"
 }
 
 @inproceedings{cgal:fy-okvd-01
-, author =	"Julia Fl{\"o}totto and Mariette Yvinec"
-, title =	"Order-$k$ {Voronoi} Diagrams"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"109--112"
-, update =	"01.04 icking"
+, author =      "Julia Fl{\"o}totto and Mariette Yvinec"
+, title =       "Order-$k$ {Voronoi} Diagrams"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "109--112"
+, update =      "01.04 icking"
 }
 
 @proceedings{cgal:jlm-isgp-98,
@@ -2768,7 +2768,7 @@ @article{cgta-kmpsy-08
 , volume      = "40"
 , number      = "1"
 , pages       = "61-78"
-, url =         "https://hal.inria.fr/inria-00344310/"
+, url =         "https://inria.hal.science/inria-00344310/"
 , doi = "10.1016/j.comgeo.2007.06.003"
 , x-international-audience = "yes"
 , x-editorial-board = "yes"
@@ -2788,7 +2788,7 @@ @inproceedings{geometrica-5986i
 , title =  "Complexity of {Delaunay} triangulation for points on lower-dimensional polyhedra"
 , booktitle =   "Proc. 18th ACM-SIAM Sympos. Discrete Algorithms"
 , nickname = "SODA"
-, url = "https://hal.inria.fr/inria-00182835/"
+, url = "https://inria.hal.science/inria-00182835/"
 , year =    2007
 , pages = "1106--1113"
 }
@@ -2856,14 +2856,14 @@ @PHDTHESIS{kerber-phd-09
 }
 
 @InCollection{grlr-sturm-habicht-98,
-  author = 	 {L.~Gonzalez-Vega and T.~Recio and H.~Lombardi and M.-F.~Roy},
-  title = 	 {Sturm-Habicht Sequences, Determinants and Real Roots of Univariate Polynomials},
-  booktitle = 	 {Quantifier Elimination and Cylindrical Algebraic Decomposition},
-  pages =	 {300--316},
-  publisher =	 {Springer},
-  year =	 1998,
-  editor =	 {B.F.~Caviness and J.R.~Johnson},
-  series =	 {Texts and Monographs in Symbolic Computation}
+  author =       {L.~Gonzalez-Vega and T.~Recio and H.~Lombardi and M.-F.~Roy},
+  title =        {Sturm-Habicht Sequences, Determinants and Real Roots of Univariate Polynomials},
+  booktitle =    {Quantifier Elimination and Cylindrical Algebraic Decomposition},
+  pages =        {300--316},
+  publisher =    {Springer},
+  year =         1998,
+  editor =       {B.F.~Caviness and J.R.~Johnson},
+  series =       {Texts and Monographs in Symbolic Computation}
 }
 
 @inproceedings{Sorkine2007AsRigidAs,
@@ -3213,14 +3213,14 @@ @article{karypis1998fast
 @techreport{frey:inria-00069921,
   TITLE = {{MEDIT : An interactive Mesh visualization Software}},
   AUTHOR = {Frey, Pascal},
-  URL = {https://hal.inria.fr/inria-00069921},
+  URL = {https://inria.hal.science/inria-00069921},
   NUMBER = {RT-0253},
   PAGES = {41},
   INSTITUTION = {{INRIA}},
   YEAR = {2001},
   MONTH = Dec,
   KEYWORDS = {MESH ; VISUALIZATION ; POST-PROCESSING},
-  PDF = {https://hal.inria.fr/inria-00069921/file/RT-0253.pdf},
+  PDF = {https://inria.hal.science/inria-00069921/file/RT-0253.pdf},
   HAL_ID = {inria-00069921},
   HAL_VERSION = {v1}
 }
diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib
index 969a1a79b5ba..28b9dae88623 100644
--- a/Documentation/doc/biblio/geom.bib
+++ b/Documentation/doc/biblio/geom.bib
@@ -7,886 +7,886 @@
 %
 
 @article{-eera-57
-, author =	"??"
-, title =	"ERA. {An} electronic reading automaton"
-, journal =	"Electronic Engineering"
-, volume =	"??"
-, month =	apr
-, year =	1957
-, pages =	"189--190"
-, update =	"98.07 bibrelex"
+, author =      "??"
+, title =       "ERA. {An} electronic reading automaton"
+, journal =     "Electronic Engineering"
+, volume =      "??"
+, month =       apr
+, year =        1957
+, pages =       "189--190"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{-akg-87
-, title =	"Algorithmen in der kombinatorischen {Geometrie}"
-, booktitle =	"Tagungsber. Math. Forschungsinst. Oberwolfach"
-, number =	5
-, year =	1987
-, pages =	"1--14a"
-, note =	"seminar abstracts"
-, update =	"97.11 icking, 95.05 korneenko"
+, title =       "Algorithmen in der kombinatorischen {Geometrie}"
+, booktitle =   "Tagungsber. Math. Forschungsinst. Oberwolfach"
+, number =      5
+, year =        1987
+, pages =       "1--14a"
+, note =        "seminar abstracts"
+, update =      "97.11 icking, 95.05 korneenko"
 }
 
 @manual{-arm-92
-, title =	"AutoCAD Reference Manual"
-, organization =	"Autodesk, Inc."
-, year =	1992
-, update =	"98.03 bibrelex"
+, title =       "AutoCAD Reference Manual"
+, organization =        "Autodesk, Inc."
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @incollection{-dg-87
-, title =	"Diskrete {Geometrie}"
-, booktitle =	"Tagungsber. Math. Forschungsinst. Oberwolfach"
-, number =	25
-, year =	1987
-, pages =	"1--18"
-, note =	"seminar abstracts"
-, update =	"97.11 icking, 95.05 korneenko"
+, title =       "Diskrete {Geometrie}"
+, booktitle =   "Tagungsber. Math. Forschungsinst. Oberwolfach"
+, number =      25
+, year =        1987
+, pages =       "1--18"
+, note =        "seminar abstracts"
+, update =      "97.11 icking, 95.05 korneenko"
 }
 
 @article{-fcp-91
-, title =	"Fast convex polygons"
-, journal =	"Doctor Dobbs J."
-, volume =	16
-, number =	3
-, year =	1991
-, pages =	"129--147"
-, keywords =	"convex polygon, rendering, computer graphics, implementation"
-, update =	"95.05 korneenko"
+, title =       "Fast convex polygons"
+, journal =     "Doctor Dobbs J."
+, volume =      16
+, number =      3
+, year =        1991
+, pages =       "129--147"
+, keywords =    "convex polygon, rendering, computer graphics, implementation"
+, update =      "95.05 korneenko"
 }
 
 @techreport{-gchpc-92
-, title =	"Grand challenges: {High} performance computing and communications"
-, type =	"Report"
-, institution =	"Committee in Physical, Mathematical, and Engineering Sciences. Federal Council for Science, Engineering, and Technology"
-, year =	1992
-, note =	"The FY 1992 U.S. Research and Development Program"
-, update =	"99.03 bibrelex, 98.07 bibrelex, 98.03 bibrelex"
+, title =       "Grand challenges: {High} performance computing and communications"
+, type =        "Report"
+, institution = "Committee in Physical, Mathematical, and Engineering Sciences. Federal Council for Science, Engineering, and Technology"
+, year =        1992
+, note =        "The FY 1992 U.S. Research and Development Program"
+, update =      "99.03 bibrelex, 98.07 bibrelex, 98.03 bibrelex"
 }
 
 @manual{-isbfp-85
-, title =	"IEEE Standard for binary floating point arithmetic, {ANSI}/{IEEE} Std $754-1985$"
-, publisher =	"IEEE Computer Society"
-, address =	"New York, NY"
-, year =	1985
-, note =	"Reprinted in SIGPLAN Notices, 22(2):9--25, 1987"
-, update =	"99.11 devillers, 98.07 bibrelex"
-, key =	"IEEE754"
+, title =       "IEEE Standard for binary floating point arithmetic, {ANSI}/{IEEE} Std $754-1985$"
+, publisher =   "IEEE Computer Society"
+, address =     "New York, NY"
+, year =        1985
+, note =        "Reprinted in SIGPLAN Notices, 22(2):9--25, 1987"
+, update =      "99.11 devillers, 98.07 bibrelex"
+, key = "IEEE754"
 }
 
 @manual{-i6um-96
-, title =	"IRIT $6.0$ User's Manual"
-, organization =	"Technion"
-, year =	1996
-, url =	"https://www.cs.technion.ac.il/~irit"
-, update =	"98.07 bibrelex"
+, title =       "IRIT $6.0$ User's Manual"
+, organization =        "Technion"
+, year =        1996
+, url = "https://www.cs.technion.ac.il/~irit"
+, update =      "98.07 bibrelex"
 }
 
 @manual{-mrm-83
-, title =	"{MACSYMA} Reference Manual"
-, organization =	"Lab. Comput. Sci., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1983
-, update =	"98.03 bibrelex"
+, title =       "{MACSYMA} Reference Manual"
+, organization =        "Lab. Comput. Sci., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1983
+, update =      "98.03 bibrelex"
 }
 
 @manual{-m4rm-85
-, title =	"Maple $4.0$ Reference Manual"
-, organization =	"Symbolic Computation Group, Univ. Waterloo"
-, address =	"Waterloo, Canada"
-, year =	1985
-, update =	"98.03 bibrelex"
+, title =       "Maple $4.0$ Reference Manual"
+, organization =        "Symbolic Computation Group, Univ. Waterloo"
+, address =     "Waterloo, Canada"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @manual{-mrg-92
-, title =	"{MATLAB} Reference Guide"
-, organization =	"The MathWorks, Inc."
-, address =	"Natick, MA"
-, year =	1992
-, update =	"98.03 bibrelex"
+, title =       "{MATLAB} Reference Guide"
+, organization =        "The MathWorks, Inc."
+, address =     "Natick, MA"
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @manual{-nwp-91
-, title =	"NURBS White Paper"
-, organization =	"Automotive Industry Action Group"
-, address =	"Southfield, MI"
-, year =	1991
-, update =	"98.07 bibrelex"
+, title =       "NURBS White Paper"
+, organization =        "Automotive Industry Action Group"
+, address =     "Southfield, MI"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @manual{-pltc-85
-, title =	"POSTSCRIPT Language Tutorial and Cookbook"
-, organization =	"Adobe Systems Incorporated"
-, year =	1985
-, update =	"98.03 bibrelex"
+, title =       "POSTSCRIPT Language Tutorial and Cookbook"
+, organization =        "Adobe Systems Incorporated"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @manual{-rurcp-88
-, title =	"Robface: {The} universal {Rob}-{Cad} programming interface"
-, organization =	"Technomatics, N. V."
-, year =	1988
-, update =	"98.07 bibrelex"
+, title =       "Robface: {The} universal {Rob}-{Cad} programming interface"
+, organization =        "Technomatics, N. V."
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @manual{-rpmv4-82
-, title =	"Romulus Programmers Manual: Version 4"
-, organization =	"Shape Data Ltd."
-, address =	"Cambridge, UK"
-, year =	1982
-, update =	"97.11 bibrelex"
+, title =       "Romulus Programmers Manual: Version 4"
+, organization =        "Shape Data Ltd."
+, address =     "Cambridge, UK"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @article{-sicp-90
-, title =	"Special issue: {Cutting} and packing"
-, journal =	"European J. Oper. Res."
-, volume =	44
-, number =	2
-, year =	1990
-, pages =	"134--299"
-, keywords =	"packing cutting"
-, update =	"95.05 korneenko"
+, title =       "Special issue: {Cutting} and packing"
+, journal =     "European J. Oper. Res."
+, volume =      44
+, number =      2
+, year =        1990
+, pages =       "134--299"
+, keywords =    "packing cutting"
+, update =      "95.05 korneenko"
 }
 
 @article{-sill-84
-, title =	"Special issue on legged locomotion"
-, journal =	"Internat. J. Robot. Res."
-, volume =	3
-, number =	2
-, year =	1984
-, update =	"97.11 bibrelex"
+, title =       "Special issue on legged locomotion"
+, journal =     "Internat. J. Robot. Res."
+, volume =      3
+, number =      2
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{-sill-90
-, title =	"Special issue on legged locomotion"
-, journal =	"Internat. J. Robot. Res."
-, volume =	9
-, number =	2
-, year =	1990
-, update =	"97.11 bibrelex"
+, title =       "Special issue on legged locomotion"
+, journal =     "Internat. J. Robot. Res."
+, volume =      9
+, number =      2
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @misc{-sp-
-, title =	"STEP on a page"
-, url =	"http://www.nist.gov/sc5/soap/"
-, update =	"98.07 bibrelex"
+, title =       "STEP on a page"
+, url = "http://www.nist.gov/sc5/soap/"
+, update =      "98.07 bibrelex"
 }
 
 @manual{-sis-89
-, title =	"Stereolithography interface specification"
-, organization =	"3D Systems, Inc."
-, address =	"Valencia, CA"
-, year =	1989
-, note =	"p/n 50065-S01-00"
-, update =	"98.07 bibrelex"
+, title =       "Stereolithography interface specification"
+, organization =        "3D Systems, Inc."
+, address =     "Valencia, CA"
+, year =        1989
+, note =        "p/n 50065-S01-00"
+, update =      "98.07 bibrelex"
 }
 
 @manual{-t1-78
-, title =	"TIPS-1"
-, organization =	"Inst. Precision Engg., Hokkaido Univ."
-, address =	"Sapporo, Japan"
-, year =	1978
-, update =	"97.11 bibrelex"
+, title =       "TIPS-1"
+, organization =        "Inst. Precision Engg., Hokkaido Univ."
+, address =     "Sapporo, Japan"
+, year =        1978
+, update =      "97.11 bibrelex"
 }
 
 @techreport{a-am3sa-91
-, author =	"C. Aarmstrong"
-, title =	"Abstraction and meshing of 3d stress analysis models"
-, type =	"Progress Report"
-, institution =	"SERC Directorate"
-, address =	"UK"
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "C. Aarmstrong"
+, title =       "Abstraction and meshing of 3d stress analysis models"
+, type =        "Progress Report"
+, institution = "SERC Directorate"
+, address =     "UK"
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @article{a-srcg-74
-, author =	"H. L. Abbott"
-, title =	"Some results in combinatorial geometry"
-, journal =	"Discrete Math."
-, volume =	9
-, year =	1974
-, pages =	"199--204"
-, update =	"97.11 bibrelex"
+, author =      "H. L. Abbott"
+, title =       "Some results in combinatorial geometry"
+, journal =     "Discrete Math."
+, volume =      9
+, year =        1974
+, pages =       "199--204"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{a-bigj-91
-, author =	"A. Abdullah"
-, title =	"Bottleneck identification in general junctions"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"26--28"
-, cites =	"ahu-dsa-83, aaghi-vdp-86, c-tsplt-90i, cw-oaimd-83, gm-osacv-87, ghlst-ltavs-87, h-ovgat-89, kkt-ptots-90i, l-prp-78, mz-lubgj-88, mt-fmvdb-83, ps-cgi-85, s-fmdbt-81, w-cvgnl-85, mz-rgj-89, p-orrc-81, ZZZ"
-, update =	"01.04 icking, 98.07 bibrelex"
+, author =      "A. Abdullah"
+, title =       "Bottleneck identification in general junctions"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "26--28"
+, cites =       "ahu-dsa-83, aaghi-vdp-86, c-tsplt-90i, cw-oaimd-83, gm-osacv-87, ghlst-ltavs-87, h-ovgat-89, kkt-ptots-90i, l-prp-78, mz-lubgj-88, mt-fmvdb-83, ps-cgi-85, s-fmdbt-81, w-cvgnl-85, mz-rgj-89, p-orrc-81, ZZZ"
+, update =      "01.04 icking, 98.07 bibrelex"
 }
 
 @incollection{aitt-pacvd-87
-, author =	"T. Abe and K. Inoue and J. Takanami and H. Taniguchi"
-, title =	"A parallel algorithm for the construction of {Voronoi} diagrams"
-, booktitle =	"Meet. Techn. Group on Automata and Languages, IECE Japan"
-, year =	1987
-, keywords =	"Voronoi diagram, parallel computation"
-, update =	"95.05 korneenko"
+, author =      "T. Abe and K. Inoue and J. Takanami and H. Taniguchi"
+, title =       "A parallel algorithm for the construction of {Voronoi} diagrams"
+, booktitle =   "Meet. Techn. Group on Automata and Languages, IECE Japan"
+, year =        1987
+, keywords =    "Voronoi diagram, parallel computation"
+, update =      "95.05 korneenko"
 }
 
 @article{am-castd-90
-, author =	"D. J. Abel and D. M. Mark"
-, title =	"A comparative analysis of some two-dimensional orderings"
-, journal =	"Intl. J. Geographic Information Systems"
-, volume =	4
-, year =	1990
-, pages =	"21--31"
-, update =	"97.07 agarwal"
+, author =      "D. J. Abel and D. M. Mark"
+, title =       "A comparative analysis of some two-dimensional orderings"
+, journal =     "Intl. J. Geographic Information Systems"
+, volume =      4
+, year =        1990
+, pages =       "21--31"
+, update =      "97.07 agarwal"
 }
 
 @article{as-dsabl-83
-, author =	"D. J. Abel and J. L. Smith"
-, title =	"A data structure and algorithm based on linear key for a rectangle retrieval problem"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	24
-, number =	1
-, year =	1983
-, pages =	"1--13"
-, keywords =	"searching, rectangle retrieval, orthogon, data structuring"
-, update =	"95.05 korneenko"
+, author =      "D. J. Abel and J. L. Smith"
+, title =       "A data structure and algorithm based on linear key for a rectangle retrieval problem"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      24
+, number =      1
+, year =        1983
+, pages =       "1--13"
+, keywords =    "searching, rectangle retrieval, orthogon, data structuring"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{a-dgpg-99
-, author =	"Manuel Abellanas"
-, title =	"{Delaunay} Graphs on a Prescribed Graph"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"101--103"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Manuel Abellanas"
+, title =       "{Delaunay} Graphs on a Prescribed Graph"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "101--103"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{aghhs-op-92
-, author =	"M. Abellanas and J. Garc{\'\i}a and G. Hern{\'a}ndez and F. Hurtado and O. Serra"
-, title =	"Onion polygonizations"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"127--131"
-, cites =	"acns-cfs-82, c-clps-85, ds-ppsp-88, h-lbocf-87, h-rsr-72, mr-ulbnm-90, nm-ocfhc-80, obw-cdnh-87, ps-cgi-85, t-cm-88, t-nrcgr-86, ZZZ"
-, update =	"98.07 bibrelex, 93.05 jones"
+, author =      "M. Abellanas and J. Garc{\'\i}a and G. Hern{\'a}ndez and F. Hurtado and O. Serra"
+, title =       "Onion polygonizations"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "127--131"
+, cites =       "acns-cfs-82, c-clps-85, ds-ppsp-88, h-lbocf-87, h-rsr-72, mr-ulbnm-90, nm-ocfhc-80, obw-cdnh-87, ps-cgi-85, t-cm-88, t-nrcgr-86, ZZZ"
+, update =      "98.07 bibrelex, 93.05 jones"
 }
 
 @article{aghhsu-up-93
-, author =	"M. Abellanas and J. Garc{\'\i}a and G. Hern{\'a}ndez and F. Hurtado and O. Serra and J. Urrutia"
-, title =	"Updating Polygonizations"
-, journal =	"Comput. Graph. Forum"
-, volume =	12
-, number =	3
-, year =	1993
-, pages =	"143--152"
-, update =	"98.11 bibrelex"
+, author =      "M. Abellanas and J. Garc{\'\i}a and G. Hern{\'a}ndez and F. Hurtado and O. Serra and J. Urrutia"
+, title =       "Updating Polygonizations"
+, journal =     "Comput. Graph. Forum"
+, volume =      12
+, number =      3
+, year =        1993
+, pages =       "143--152"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{agh-cg-94
-, author =	"M. Abellanas and J. Garc{\'\i}a-L{\'o}pez and F. Hurtado"
-, title =	"Consecutive Guards"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"393--398"
-, cites =	"o-agta-87, c-ctpg-75, f-spcwt-78, s-rrag-92, ll-ccagp-86, h-ragp-90, hkk-agtph-91, jl-agtls-93, ZZZ"
-, update =	"98.11 bibrelex, 97.11 icking, 94.09 jones"
+, author =      "M. Abellanas and J. Garc{\'\i}a-L{\'o}pez and F. Hurtado"
+, title =       "Consecutive Guards"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "393--398"
+, cites =       "o-agta-87, c-ctpg-75, f-spcwt-78, s-rrag-92, ll-ccagp-86, h-ragp-90, hkk-agtph-91, jl-agtls-93, ZZZ"
+, update =      "98.11 bibrelex, 97.11 icking, 94.09 jones"
 }
 
 @inproceedings{agrh-tsgs-94
-, author =	"Manuel Abellanas and Francisco G{\'o}mez and Ferran Hurtado and Pedro Ramos"
-, title =	"On the Tolerance of Some Geometric Structures"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"64--67"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Manuel Abellanas and Francisco G{\'o}mez and Ferran Hurtado and Pedro Ramos"
+, title =       "On the Tolerance of Some Geometric Structures"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "64--67"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @techreport{aghr-stdt-
-, author =	"M. Abellanas and F. G{\'o}mez and F. Hurtado and P. Ramos"
-, title =	"Structural Tolerance and {Delaunay} Triangulation"
-, type =	"Technical Report"
-, number =	"MA2-IR-93-11"
-, institution =	"Dept. Mat. Aplicada II, Univesitat Polit{\`e}cnica de Catalunya"
-, update =	"98.11 bibrelex"
+, author =      "M. Abellanas and F. G{\'o}mez and F. Hurtado and P. Ramos"
+, title =       "Structural Tolerance and {Delaunay} Triangulation"
+, type =        "Technical Report"
+, number =      "MA2-IR-93-11"
+, institution = "Dept. Mat. Aplicada II, Univesitat Polit{\`e}cnica de Catalunya"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{ahknu-cpcs-95
-, author =	"Manuel Abellanas and G. Hernandes and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
-, title =	"A Combinatorial Property of Convex Sets"
-, number =	176
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1995
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr176.pdf"
-, precedes =	"ahknu-cpcs-97"
-, update =	"01.04 icking, 99.07 bibrelex, 98.11 bibrelex"
+, author =      "Manuel Abellanas and G. Hernandes and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
+, title =       "A Combinatorial Property of Convex Sets"
+, number =      176
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1995
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr176.pdf"
+, precedes =    "ahknu-cpcs-97"
+, update =      "01.04 icking, 99.07 bibrelex, 98.11 bibrelex"
 }
 
 @article{ahknu-cpcs-97
-, author =	"Manuel Abellanas and G. Hernandes and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
-, title =	"A Combinatorial Property of Convex Sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	17
-, number =	3
-, year =	1997
-, pages =	"307--318"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr176.pdf"
-, succeeds =	"ahknu-cpcs-95"
-, update =	"01.04 icking, 99.07 bibrelex, 98.11 bibrelex"
+, author =      "Manuel Abellanas and G. Hernandes and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
+, title =       "A Combinatorial Property of Convex Sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      17
+, number =      3
+, year =        1997
+, pages =       "307--318"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr176.pdf"
+, succeeds =    "ahknu-cpcs-95"
+, update =      "01.04 icking, 99.07 bibrelex, 98.11 bibrelex"
 }
 
 @techreport{ahknu-vdcfc-95t
-, author =	"Manuel Abellanas and G. Hernandes and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
-, title =	"Voronoi-Diagrams and Containment of Families of Convex Sets on the Plane"
-, number =	173
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1995
-, precedes =	"ahknu-vdcfc-95"
-, update =	"99.07 bibrelex, 98.11 bibrelex"
+, author =      "Manuel Abellanas and G. Hernandes and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
+, title =       "Voronoi-Diagrams and Containment of Families of Convex Sets on the Plane"
+, number =      173
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1995
+, precedes =    "ahknu-vdcfc-95"
+, update =      "99.07 bibrelex, 98.11 bibrelex"
 }
 
 @inproceedings{ahknu-vdcfc-95
-, author =	"Manuel Abellanas and G. Hernandez and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
-, title =	"Voronoi Diagrams and Containment of Families of Convex Sets on the Plane"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"71--78"
-, keywords =	"convex distance functions"
-, succeeds =	"ahknu-vdcfc-95t"
-, cites =	"bl-cppe-90, bssu-crapb-89, cd-vdbcd-85, ehs-cttpt-88, f-ioco-88, hrw-sercc-89, h-nccp-89, iklm-cdf3s-93, kmm-ricav-93a, l-cnp-94, l-artcn-94, nu-crpcp-88, ssu-congo-88, u-poeg-89, ZZZ"
-, update =	"99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 95.09 mitchell"
+, author =      "Manuel Abellanas and G. Hernandez and Rolf Klein and V. Neumann-Lara and Jorge Urrutia"
+, title =       "Voronoi Diagrams and Containment of Families of Convex Sets on the Plane"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "71--78"
+, keywords =    "convex distance functions"
+, succeeds =    "ahknu-vdcfc-95t"
+, cites =       "bl-cppe-90, bssu-crapb-89, cd-vdbcd-85, ehs-cttpt-88, f-ioco-88, hrw-sercc-89, h-nccp-89, iklm-cdf3s-93, kmm-ricav-93a, l-cnp-94, l-artcn-94, nu-crpcp-88, ssu-congo-88, u-poeg-89, ZZZ"
+, update =      "99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 95.09 mitchell"
 }
 
 @techreport{ahiklmps-scso-01t
-, author =	"Manuel Abellanas and Ferran Hurtado and Christian Icking and Rolf Klein and Elmar Langetepe and Lihong Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n"
-, title =	"Smallest Color-Spanning Objects"
-, number =	283
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	2001
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr283.pdf"
-, precedes =	"ahiklmps-scso-01"
-, cites =	"aesw-emstb-91, aiks-fkpmd-91, dlss-sdakp-95, ddg-fsp-83, esz-cskec-94, ee-innfm-94, eorw-fmakg-92, es-blbda-95, go-copcg-95, gh-appcp-93, hks-uevsi-93, m-gofvc-94, m-ekpc-95, m-gspno-00, mnsw-cnnsq-00, ol-mcp-81, ps-cgi-85, sk-ekpsa-98, sa-dsstg-95, s-fkpse-92, ZZZ"
-, update =	"01.07 icking, 01.04 icking"
+, author =      "Manuel Abellanas and Ferran Hurtado and Christian Icking and Rolf Klein and Elmar Langetepe and Lihong Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n"
+, title =       "Smallest Color-Spanning Objects"
+, number =      283
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        2001
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr283.pdf"
+, precedes =    "ahiklmps-scso-01"
+, cites =       "aesw-emstb-91, aiks-fkpmd-91, dlss-sdakp-95, ddg-fsp-83, esz-cskec-94, ee-innfm-94, eorw-fmakg-92, es-blbda-95, go-copcg-95, gh-appcp-93, hks-uevsi-93, m-gofvc-94, m-ekpc-95, m-gspno-00, mnsw-cnnsq-00, ol-mcp-81, ps-cgi-85, sk-ekpsa-98, sa-dsstg-95, s-fkpse-92, ZZZ"
+, update =      "01.07 icking, 01.04 icking"
 }
 
 @inproceedings{ahiklmps-scso-01
-, author =	"Manuel Abellanas and Ferran Hurtado and Christian Icking and Rolf Klein and Elmar Langetepe and Lihong Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n"
-, title =	"Smallest Color-Spanning Objects"
-, booktitle =	"Proc. 9th Annu. European Sympos. Algorithms"
-, nickname =	"ESA 2001"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	2161
-, publisher =	"Springer-Verlag"
-, year =	2001
-, pages =	"278--289"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr283.pdf"
-, succeeds =	"ahiklmps-scso-01t"
-, update =	"02.03 icking, 01.07 icking"
+, author =      "Manuel Abellanas and Ferran Hurtado and Christian Icking and Rolf Klein and Elmar Langetepe and Lihong Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n"
+, title =       "Smallest Color-Spanning Objects"
+, booktitle =   "Proc. 9th Annu. European Sympos. Algorithms"
+, nickname =    "ESA 2001"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      2161
+, publisher =   "Springer-Verlag"
+, year =        2001
+, pages =       "278--289"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr283.pdf"
+, succeeds =    "ahiklmps-scso-01t"
+, update =      "02.03 icking, 01.07 icking"
 }
 
 @inproceedings{ahiklmps-fcvdr-01
-, author =	"Manuel Abellanas and Ferran Hurtado and Christian Icking and Rolf Klein and Elmar Langetepe and Lihong Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n"
-, title =	"The Farthest Color {Voronoi} Diagram and Related Problems"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"113--116"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ahiklmps-fcvdr-01.pdf"
-, cites =	"aesw-emstb-91, aiks-fkpmd-91, ak-vd-00, dlss-sdakp-95, ddg-fsp-83, ee-innfm-94, go-copcg-95, gh-appcp-93, hks-uevsi-93, m-lpltw-84, m-gspno-00, mnsw-cnnsq-00, ol-mcp-81, ps-cgi-85, sa-dsstg-95, w-sedbe-91a, ZZZ"
-, update =	"01.04 icking"
+, author =      "Manuel Abellanas and Ferran Hurtado and Christian Icking and Rolf Klein and Elmar Langetepe and Lihong Ma and Bel{\'e}n Palop and Vera Sacrist{\'a}n"
+, title =       "The Farthest Color {Voronoi} Diagram and Related Problems"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "113--116"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/ahiklmps-fcvdr-01.pdf"
+, cites =       "aesw-emstb-91, aiks-fkpmd-91, ak-vd-00, dlss-sdakp-95, ddg-fsp-83, ee-innfm-94, go-copcg-95, gh-appcp-93, hks-uevsi-93, m-lpltw-84, m-gspno-00, mnsw-cnnsq-00, ol-mcp-81, ps-cgi-85, sa-dsstg-95, w-sedbe-91a, ZZZ"
+, update =      "01.04 icking"
 }
 
 @inproceedings{ahr-tgs-94
-, author =	"M. Abellanas and F. Hurtado and P. Ramos"
-, title =	"Tolerance of Geometric Structures"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"250--255"
-, cites =	"aghhsu-up-93, aghr-stdt-, a-sdcgp-85, abmmrss-tsp-93, gss-egbra-89, gss-cscah-93, l-cbagd, lm-cschu-90, ms-tgmst-91, r-tegc, cegs-ablsp-89, ms-rcibt-88, lmr-pvdcb-93, v-plcpt-, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "M. Abellanas and F. Hurtado and P. Ramos"
+, title =       "Tolerance of Geometric Structures"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "250--255"
+, cites =       "aghhsu-up-93, aghr-stdt-, a-sdcgp-85, abmmrss-tsp-93, gss-egbra-89, gss-cscah-93, l-cbagd, lm-cschu-90, ms-tgmst-91, r-tegc, cegs-ablsp-89, ms-rcibt-88, lmr-pvdcb-93, v-plcpt-, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{ahr-rgwgt-95
-, author =	"M. Abellanas and F. Hurtado and P. A. Ramos"
-, title =	"Redrawing a Graph within a Geometric Tolerance"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"246--253"
-, keywords =	"graph drawing, Delaunay triangulation"
-, update =	"95.01 tamassia"
+, author =      "M. Abellanas and F. Hurtado and P. A. Ramos"
+, title =       "Redrawing a Graph within a Geometric Tolerance"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "246--253"
+, keywords =    "graph drawing, Delaunay triangulation"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{ar-vdisg-95
-, author =	"Manuel Abellanas and Eugenio Roanes-Lozano"
-, title =	"{Voronoi} Diagrams for Infinite Sets Generated by Consecutive Stretches"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"13--16"
-, update =	"00.03 bibrelex"
+, author =      "Manuel Abellanas and Eugenio Roanes-Lozano"
+, title =       "{Voronoi} Diagrams for Infinite Sets Generated by Consecutive Stretches"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "13--16"
+, update =      "00.03 bibrelex"
 }
 
 @techreport{ae-vgspu-91
-, author =	"J. Abello and {\"O}. E{\~g}ecio{\~g}lu"
-, title =	"Visibility graphs of staircase polygons with uniform step length"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1991
-, precedes =	"ae-vgspu-93"
-, update =	"98.07 bibrelex"
+, author =      "J. Abello and {\"O}. E{\~g}ecio{\~g}lu"
+, title =       "Visibility graphs of staircase polygons with uniform step length"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1991
+, precedes =    "ae-vgspu-93"
+, update =      "98.07 bibrelex"
 }
 
 @article{ae-vgspu-93
-, author =	"J. Abello and {\"O}. E{\~g}ecio{\~g}lu"
-, title =	"Visibility graphs of staircase polygons with uniform step length"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"27--37"
-, keywords =	"visibility graph, staircase polygon, orthogonal convex fan, uniform step length"
-, succeeds =	"ae-vgspu-91"
-, update =	"98.07 bibrelex, 96.09 devillers"
+, author =      "J. Abello and {\"O}. E{\~g}ecio{\~g}lu"
+, title =       "Visibility graphs of staircase polygons with uniform step length"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "27--37"
+, keywords =    "visibility graph, staircase polygon, orthogonal convex fan, uniform step length"
+, succeeds =    "ae-vgspu-91"
+, update =      "98.07 bibrelex, 96.09 devillers"
 }
 
 @techreport{aek-rvgsp-91
-, author =	"J. Abello and {\"O}. E{\~g}ecio{\~g}lu and K. Kumar"
-, title =	"Recognizing visibility graphs of staircase polygons"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "J. Abello and {\"O}. E{\~g}ecio{\~g}lu and K. Kumar"
+, title =       "Recognizing visibility graphs of staircase polygons"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @article{aesu-iopof-98
-, author =	"James Abello and Vladimir Estivill-Castro and Thomas Shermer and Jorge Urrutia"
-, title =	"Illumination of Orthogonal Polygons with Orthogonal Floodlights"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"25--38"
-, succeeds =	"aesu-iof-95"
-, update =	"98.11 devillers"
+, author =      "James Abello and Vladimir Estivill-Castro and Thomas Shermer and Jorge Urrutia"
+, title =       "Illumination of Orthogonal Polygons with Orthogonal Floodlights"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "25--38"
+, succeeds =    "aesu-iof-95"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{aesu-iof-95
-, author =	"James Abello and Vladimir Estivill-Castro and Thomas Shermer and Jorge Urrutia"
-, title =	"Illumination with Orthogonal Floodlights"
-, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1004
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"362--371"
-, precedes =	"aesu-iopof-98"
-, update =	"98.11 devillers, 98.07 bibrelex, 96.01 smid, 95.09 mitchell"
+, author =      "James Abello and Vladimir Estivill-Castro and Thomas Shermer and Jorge Urrutia"
+, title =       "Illumination with Orthogonal Floodlights"
+, booktitle =   "Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1004
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "362--371"
+, precedes =    "aesu-iopof-98"
+, update =      "98.11 devillers, 98.07 bibrelex, 96.01 smid, 95.09 mitchell"
 }
 
 @inproceedings{ak-vgom-95
-, author =	"J. Abello and K. Kumar"
-, title =	"Visibility Graphs and Oriented Matroids"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"147--158"
-, keywords =	"graph drawing, visibility"
-, update =	"95.01 tamassia"
+, author =      "J. Abello and K. Kumar"
+, title =       "Visibility Graphs and Oriented Matroids"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "147--158"
+, keywords =    "graph drawing, visibility"
+, update =      "95.01 tamassia"
 }
 
 @article{alp-vgsp-92
-, author =	"J. Abello and H. Lin and S. Pisupati"
-, title =	"On visibility graphs of simple polygons"
-, journal =	"Congr. Numer."
-, volume =	90
-, year =	1992
-, pages =	"119--128"
-, update =	"98.11 bibrelex"
+, author =      "J. Abello and H. Lin and S. Pisupati"
+, title =       "On visibility graphs of simple polygons"
+, journal =     "Congr. Numer."
+, volume =      90
+, year =        1992
+, pages =       "119--128"
+, update =      "98.11 bibrelex"
 }
 
 @book{ad-tg-80
-, author =	"H. Abelson and A. A. diSessa"
-, title =	"Turtle Geometry"
-, publisher =	"MIT Press"
-, address =	"Cambridge"
-, year =	1980
-, update =	"97.03 icking"
+, author =      "H. Abelson and A. A. diSessa"
+, title =       "Turtle Geometry"
+, publisher =   "MIT Press"
+, address =     "Cambridge"
+, year =        1980
+, update =      "97.03 icking"
 }
 
 @book{a-ca-80
-, author =	"O. Aberth"
-, title =	"Computable analysis"
-, publisher =	"McGraw-Hill"
-, address =	"New York"
-, year =	1980
-, update =	"98.11 bibrelex"
+, author =      "O. Aberth"
+, title =       "Computable analysis"
+, publisher =   "McGraw-Hill"
+, address =     "New York"
+, year =        1980
+, update =      "98.11 bibrelex"
 }
 
 @article{a-gph-88
-, author =	"S. Abhyankar"
-, title =	"Good Points of a Hypersurface"
-, journal =	"Adv. Math."
-, volume =	68
-, number =	2
-, year =	1988
-, pages =	"87--256"
-, update =	"97.11 bibrelex"
+, author =      "S. Abhyankar"
+, title =       "Good Points of a Hypersurface"
+, journal =     "Adv. Math."
+, volume =      68
+, number =      2
+, year =        1988
+, pages =       "87--256"
+, update =      "97.11 bibrelex"
 }
 
 @article{a-hragr-76
-, author =	"S. Abhyankar"
-, title =	"Historical Ramblings in Algebraic Geometry and Related Algebra"
-, journal =	"Amer. Math. Monthly"
-, volume =	83
-, number =	6
-, year =	1976
-, pages =	"409--448"
-, update =	"98.03 bibrelex"
+, author =      "S. Abhyankar"
+, title =       "Historical Ramblings in Algebraic Geometry and Related Algebra"
+, journal =     "Amer. Math. Monthly"
+, volume =      83
+, number =      6
+, year =        1976
+, pages =       "409--448"
+, update =      "98.03 bibrelex"
 }
 
 @article{ab-arpcs2-87
-, author =	"S. Abhyankar and C. Bajaj"
-, title =	"Automatic Rational Parameterization of Curves and Surfaces {II}: Cubics and Cubicoids"
-, journal =	"Comput. Aided Design"
-, volume =	19
-, number =	2
-, year =	1987
-, pages =	"499--502"
-, update =	"97.11 bibrelex"
+, author =      "S. Abhyankar and C. Bajaj"
+, title =       "Automatic Rational Parameterization of Curves and Surfaces {II}: Cubics and Cubicoids"
+, journal =     "Comput. Aided Design"
+, volume =      19
+, number =      2
+, year =        1987
+, pages =       "499--502"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ab-cac-89
-, author =	"S. Abhyankar and C. Bajaj"
-, title =	"Computations with Algebraic Curves"
-, booktitle =	"Proc. Internat. Sympos. on Symbolic and Algebraic Computation"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	358
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"279--284"
-, update =	"97.11 bibrelex"
+, author =      "S. Abhyankar and C. Bajaj"
+, title =       "Computations with Algebraic Curves"
+, booktitle =   "Proc. Internat. Sympos. on Symbolic and Algebraic Computation"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      358
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "279--284"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ab-arpcs3-86
-, author =	"S. Abhyankar and C. Bajal"
-, title =	"Automatic Rational Parameterization of Curves and Surfaces {III}: {Algebraic} Plane Curves"
-, type =	"Technical {Report}"
-, number =	"CSD-TR-619"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "S. Abhyankar and C. Bajal"
+, title =       "Automatic Rational Parameterization of Curves and Surfaces {III}: {Algebraic} Plane Curves"
+, type =        "Technical {Report}"
+, number =      "CSD-TR-619"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{a-asc-70
-, author =	"S. S. Abhyankar"
-, title =	"Algebraic space curves"
-, journal =	"Montreal Lecture Notes"
-, volume =	"??"
-, year =	1970
-, update =	"98.03 bibrelex"
+, author =      "S. S. Abhyankar"
+, title =       "Algebraic space curves"
+, journal =     "Montreal Lecture Notes"
+, volume =      "??"
+, year =        1970
+, update =      "98.03 bibrelex"
 }
 
 @article{ab-arpcs-87
-, author =	"S. S. Abhyankar and C. Bajaj"
-, title =	"Automatic rational parameterization of curves and surfaces {I}: conics and conicoids"
-, journal =	"Comput. Aided Design"
-, volume =	19
-, year =	1987
-, pages =	"11--14"
-, keywords =	"algebraic geometry, design of algorithms, computer graphics, CAD"
+, author =      "S. S. Abhyankar and C. Bajaj"
+, title =       "Automatic rational parameterization of curves and surfaces {I}: conics and conicoids"
+, journal =     "Comput. Aided Design"
+, volume =      19
+, year =        1987
+, pages =       "11--14"
+, keywords =    "algebraic geometry, design of algorithms, computer graphics, CAD"
 }
 
 @inproceedings{ac-iiac-89
-, author =	"S. S. Abhyankar and S. Chandrasekar"
-, title =	"Improper intersection of algebraic curves"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	10
+, author =      "S. S. Abhyankar and S. Chandrasekar"
+, title =       "Improper intersection of algebraic curves"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       10
 }
 
 @inproceedings{acc-dcbia-89
-, author =	"S. S. Abhyankar and S. Chandrasekar and V. Chandru"
-, title =	"Degree complexity bounds on the intersection of algebraic curves"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"88--93"
-, cites =	"a-asc-70, acc-iasc-88, acc-iiac-88, d-icds-86, g-mrtii-85, h-ac-85, as-tsbac-88, e-acg-87, cegsw-ccbac-88, sr-iag-49, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "S. S. Abhyankar and S. Chandrasekar and V. Chandru"
+, title =       "Degree complexity bounds on the intersection of algebraic curves"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "88--93"
+, cites =       "a-asc-70, acc-iasc-88, acc-iiac-88, d-icds-86, g-mrtii-85, h-ac-85, as-tsbac-88, e-acg-87, cegsw-ccbac-88, sr-iag-49, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{acc-iiac-88
-, author =	"S. S. Abhyankar and S. Chandrasekar and V. Chandru"
-, title =	"Improper intersection of algebraic curves"
-, number =	"CC-88-24"
-, institution =	"Purdue University"
-, month =	sep
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "S. S. Abhyankar and S. Chandrasekar and V. Chandru"
+, title =       "Improper intersection of algebraic curves"
+, number =      "CC-88-24"
+, institution = "Purdue University"
+, month =       sep
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @techreport{acc-iasc-88
-, author =	"S. S. Abhyankar and S. Chandrasekar and V. Chandru"
-, title =	"Intersection of algebraic space curves"
-, type =	"Technical {Report}"
-, number =	"CC-88-13"
-, institution =	"Dept. Math., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1988
-, precedes =	"acc-iasc-91"
-, update =	"95.05 korneenko"
+, author =      "S. S. Abhyankar and S. Chandrasekar and V. Chandru"
+, title =       "Intersection of algebraic space curves"
+, type =        "Technical {Report}"
+, number =      "CC-88-13"
+, institution = "Dept. Math., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1988
+, precedes =    "acc-iasc-91"
+, update =      "95.05 korneenko"
 }
 
 @article{acc-iasc-91
-, author =	"S. S. Abhyankar and S. Chandrasekar and V. Chandru"
-, title =	"Intersection of algebraic space curves"
-, journal =	"Discrete Appl. Math."
-, volume =	31
-, number =	2
-, year =	1991
-, pages =	"81--96"
-, keywords =	"algebraic curves, intersection"
-, succeeds =	"acc-iasc-88"
-, update =	"95.05 korneenko"
+, author =      "S. S. Abhyankar and S. Chandrasekar and V. Chandru"
+, title =       "Intersection of algebraic space curves"
+, journal =     "Discrete Appl. Math."
+, volume =      31
+, number =      2
+, year =        1991
+, pages =       "81--96"
+, keywords =    "algebraic curves, intersection"
+, succeeds =    "acc-iasc-88"
+, update =      "95.05 korneenko"
 }
 
 @article{a-pthlh-86
-, author =	"S. S. Abi-Ezzi"
-, title =	"The priority tree: {A} hidden-line / hidden-surface approach to ``{PHIGS}''"
-, journal =	"Comput. Graph. Forum"
-, volume =	5
-, number =	4
-, year =	1986
-, pages =	"283--289"
-, keywords =	"hidden line/surface elimination, priority tree"
-, update =	"95.05 korneenko"
+, author =      "S. S. Abi-Ezzi"
+, title =       "The priority tree: {A} hidden-line / hidden-surface approach to ``{PHIGS}''"
+, journal =     "Comput. Graph. Forum"
+, volume =      5
+, number =      4
+, year =        1986
+, pages =       "283--289"
+, keywords =    "hidden line/surface elimination, priority tree"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{as-tcshv-91
-, author =	"S. S. Abi-Ezzi and L. A. Shirman"
-, title =	"Tessellation of Curved Surfaces under Highly Varying Transformations"
-, editor =	"F. H. Post and W. Barth"
-, booktitle =	"Proc. Eurographics '91"
-, publisher =	"Elsevier Science"
-, address =	"Vienna, Austria"
-, month =	sep
-, year =	1991
-, pages =	"385--397"
-, update =	"93.09 held"
+, author =      "S. S. Abi-Ezzi and L. A. Shirman"
+, title =       "Tessellation of Curved Surfaces under Highly Varying Transformations"
+, editor =      "F. H. Post and W. Barth"
+, booktitle =   "Proc. Eurographics '91"
+, publisher =   "Elsevier Science"
+, address =     "Vienna, Austria"
+, month =       sep
+, year =        1991
+, pages =       "385--397"
+, update =      "93.09 held"
 }
 
 @incollection{abbkw-pdb-87
-, author =	"E. E. Abola and F. C. Bernstein and S. H. Bryant and T. F. Koetzle and J. Weng"
-, title =	"Protein data bank"
-, editor =	"F. H. Allen and G. Bergerhoff and R. Seivers"
-, booktitle =	"Crystallographic Databases: Information Content, Software Systems, Scientific Applications"
-, publisher =	"Data Comission of the International Union of Crystallography"
-, address =	"Bonn/Cambridge/Chester"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "E. E. Abola and F. C. Bernstein and S. H. Bryant and T. F. Koetzle and J. Weng"
+, title =       "Protein data bank"
+, editor =      "F. H. Allen and G. Bergerhoff and R. Seivers"
+, booktitle =   "Crystallographic Databases: Information Content, Software Systems, Scientific Applications"
+, publisher =   "Data Comission of the International Union of Crystallography"
+, address =     "Bonn/Cambridge/Chester"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{a-mcp-90
-, author =	"Karl Abrahamson"
-, title =	"On the Modality of Convex Polygons"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"409--419"
-, annote =	"Random convex polygon defined by hull of $n$ points
-		 from (1) uniform on disc and (2) 2d normal
-		 distribution. Expected modality shown to be
-		 $\Theta(\log h/\log\log h)$, where $h$ is expected
-		 number of hull vertices."
+, author =      "Karl Abrahamson"
+, title =       "On the Modality of Convex Polygons"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "409--419"
+, annote =      "Random convex polygon defined by hull of $n$ points
+                 from (1) uniform on disc and (2) 2d normal
+                 distribution. Expected modality shown to be
+                 $\Theta(\log h/\log\log h)$, where $h$ is expected
+                 number of hull vertices."
 }
 
 @article{adkp-sptca-89
-, author =	"K. Abrahamson and N. Dadoun and D. G. Kirkpatrick and T. Przytycka"
-, title =	"A Simple Parallel Tree Contraction Algorithm"
-, journal =	"J. Algorithms"
-, volume =	10
-, year =	1989
-, pages =	"287--302"
-, update =	"96.09 orourke"
+, author =      "K. Abrahamson and N. Dadoun and D. G. Kirkpatrick and T. Przytycka"
+, title =       "A Simple Parallel Tree Contraction Algorithm"
+, journal =     "J. Algorithms"
+, volume =      10
+, year =        1989
+, pages =       "287--302"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{a-cano-88
-, author =	"S. Abramowski"
-, title =	"Collision avoidance for nonrigid objects"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"168--179"
-, keywords =	"motion planning"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "S. Abramowski"
+, title =       "Collision avoidance for nonrigid objects"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "168--179"
+, keywords =    "motion planning"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @incollection{alm-mrkgp-89
-, author =	"S. Abramowski and B. Lang and H. M{\"u}ller"
-, title =	"Moving regular $k$-gons in contact"
-, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '88"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	344
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"229--242"
-, keywords =	"motion planning, contact, regular polygon"
-, update =	"98.07 smid, 97.11 bibrelex, 95.05 korneenko"
+, author =      "S. Abramowski and B. Lang and H. M{\"u}ller"
+, title =       "Moving regular $k$-gons in contact"
+, booktitle =   "Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '88"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      344
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "229--242"
+, keywords =    "motion planning, contact, regular polygon"
+, update =      "98.07 smid, 97.11 bibrelex, 95.05 korneenko"
 }
 
 @techreport{am-1dq3d-85
-, author =	"S. Abramowski and H. M{\"u}ller"
-, title =	"$1$-d queries in $3$-d space"
-, type =	"Report"
-, number =	"09/85"
-, institution =	"Fakult{\"a}t Inform., Univ. Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "S. Abramowski and H. M{\"u}ller"
+, title =       "$1$-d queries in $3$-d space"
+, type =        "Report"
+, number =      "09/85"
+, institution = "Fakult{\"a}t Inform., Univ. Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @article{am-cano-84
-, author =	"S. Abramowski and H. M{\"u}ller"
-, title =	"Collision Avoidance for Nonrigid Objects"
-, journal =	"Oper. Res."
-, volume =	32
-, year =	1984
-, pages =	"165--186"
-, update =	"93.09 milone+mitchell"
+, author =      "S. Abramowski and H. M{\"u}ller"
+, title =       "Collision Avoidance for Nonrigid Objects"
+, journal =     "Oper. Res."
+, volume =      32
+, year =        1984
+, pages =       "165--186"
+, update =      "93.09 milone+mitchell"
 }
 
 @book{am-gm-91
-, author =	"S. Abramowski and H. M{\"u}ller"
-, title =	"{Geometrisches} {Modellieren}"
-, publisher =	"BI-Wissenschaftsverlag"
-, address =	"Mannheim"
-, year =	1991
-, update =	"97.03 icking"
+, author =      "S. Abramowski and H. M{\"u}ller"
+, title =       "{Geometrisches} {Modellieren}"
+, publisher =   "BI-Wissenschaftsverlag"
+, address =     "Mannheim"
+, year =        1991
+, update =      "97.03 icking"
 }
 
 @incollection{am-sccvl-87
-, author =	"S. Abramowski and H. M{\"u}ller"
-, title =	"Searching connected components in very large grid graphs"
-, booktitle =	"Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '86"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	246
-, year =	1987
-, pages =	"118--130"
-, keywords =	"grid graph, motion planning, connected component"
-, update =	"97.11 bibrelex, 95.05 korneenko"
+, author =      "S. Abramowski and H. M{\"u}ller"
+, title =       "Searching connected components in very large grid graphs"
+, booktitle =   "Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '86"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      246
+, year =        1987
+, pages =       "118--130"
+, keywords =    "grid graph, motion planning, connected component"
+, update =      "97.11 bibrelex, 95.05 korneenko"
 }
 
 @article{ag-ftfcf-02
-, author =	"Aaron Abrams and Robert Shrist"
-, title =	"Finding Topology in a Factory: {Configuration} Spaces"
-, journal =	"Amer. Math. Monthly"
-, volume =	109
-, number =	2
-, year =	2002
-, pages =	"140--150"
-, comments =	"Several robots"
-, update =	"02.03 orourke"
+, author =      "Aaron Abrams and Robert Shrist"
+, title =       "Finding Topology in a Factory: {Configuration} Spaces"
+, journal =     "Amer. Math. Monthly"
+, volume =      109
+, number =      2
+, year =        2002
+, pages =       "140--150"
+, comments =    "Several robots"
+, update =      "02.03 orourke"
 }
 
 @article{abcptwz-gmisp-95
-, author =	"S. L. Abrams and L. Bardis and C. Chryssostomidis and N. M. Patrikalakis and S. T. Tuohy and F.-E. Wolter and J. Zhou"
-, title =	"The Geometric Modeling and Interrogation System Praxiteles"
-, journal =	"Journal of Ship Production"
-, volume =	11
-, number =	2
-, year =	1995
-, pages =	"116--131"
-, update =	"95.05 abrams"
+, author =      "S. L. Abrams and L. Bardis and C. Chryssostomidis and N. M. Patrikalakis and S. T. Tuohy and F.-E. Wolter and J. Zhou"
+, title =       "The Geometric Modeling and Interrogation System Praxiteles"
+, journal =     "Journal of Ship Production"
+, volume =      11
+, number =      2
+, year =        1995
+, pages =       "116--131"
+, update =      "95.05 abrams"
 }
 
 @article{a-zhadr-28
-, author =	"W. Ackermann"
-, title =	"Zum {Hilbertschen} {Aufbau} der reellen {Zahlen}"
-, journal =	"Mathematical Annals"
-, volume =	99
-, year =	1928
-, pages =	"118--133"
-, keywords =	"Ackermann function"
-, update =	"95.05 agarwal"
+, author =      "W. Ackermann"
+, title =       "Zum {Hilbertschen} {Aufbau} der reellen {Zahlen}"
+, journal =     "Mathematical Annals"
+, volume =      99
+, year =        1928
+, pages =       "118--133"
+, keywords =    "Ackermann function"
+, update =      "95.05 agarwal"
 }
 
 @article{ahs-itcp-89
-, author =	"D. M. Acketa and V. Hauk and D. Surla"
-, title =	"On the intersection of two convex polygons"
-, journal =	"Informatica"
-, volume =	13
-, number =	4
-, year =	1989
-, pages =	"52--57"
-, keywords =	"intersection, convex polygon"
-, update =	"95.05 korneenko"
+, author =      "D. M. Acketa and V. Hauk and D. Surla"
+, title =       "On the intersection of two convex polygons"
+, journal =     "Informatica"
+, volume =      13
+, number =      4
+, year =        1989
+, pages =       "52--57"
+, keywords =    "intersection, convex polygon"
+, update =      "95.05 korneenko"
 }
 
 @article{vk-mnecd-82a
-, author =	"D. M. Acketa and J. {\v Z}uni{\'c}"
-, title =	"On the maximal number of edges of convex digital polygons included into a square grid"
-, journal =	"Pocitace a umela inteligencia"
-, volume =	1
-, number =	6
-, month =	dec
-, year =	1982
-, pages =	"549--558"
-, update =	"98.07 bibrelex"
+, author =      "D. M. Acketa and J. {\v Z}uni{\'c}"
+, title =       "On the maximal number of edges of convex digital polygons included into a square grid"
+, journal =     "Pocitace a umela inteligencia"
+, volume =      1
+, number =      6
+, month =       dec
+, year =        1982
+, pages =       "549--558"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{az-mnecd-91
-, author =	"D. M. Acketa and J. {\v Z}uni{\'c}"
-, title =	"On the maximal number of edges of convex digital polygons included into a square grid"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"215--218"
-, cites =	"bl-ndsls-88, hw-itn-68, vk-mnecd-82a, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "D. M. Acketa and J. {\v Z}uni{\'c}"
+, title =       "On the maximal number of edges of convex digital polygons included into a square grid"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "215--218"
+, cites =       "bl-ndsls-88, hw-itn-68, vk-mnecd-82a, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{akss-icsac-97
-, author =	"Bruno Adam and Pierre Kauffmann and Dominique Schmitt and Jean-Claude Spehner"
-, title =	"An Increasing--Circle Sweep--Algorithm to Construct the {D}elaunay Diagram in the Plane"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"268--273"
-, update =	"97.11 jones"
+, author =      "Bruno Adam and Pierre Kauffmann and Dominique Schmitt and Jean-Claude Spehner"
+, title =       "An Increasing--Circle Sweep--Algorithm to Construct the {D}elaunay Diagram in the Plane"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "268--273"
+, update =      "97.11 jones"
 }
 
-%, number =	4
+%, number =     4
 @article{a-vlplc-96
-, author =	"Andrew Adamatzky"
-, title =	"Voronoi-Like Partition of a Lattice in Cellular Automata"
-, journal =	"Mathematical and Computer Modelling"
-, volume =	23
-, year =	1996
-, pages =	""
-, keywords =	"image processing, Voronoi diagram, cellular automata"
-, update =	"96.01 jones"
-, abstract =	"In this paper, we discuss an automata model for parallel
+, author =      "Andrew Adamatzky"
+, title =       "Voronoi-Like Partition of a Lattice in Cellular Automata"
+, journal =     "Mathematical and Computer Modelling"
+, volume =      23
+, year =        1996
+, pages =       ""
+, keywords =    "image processing, Voronoi diagram, cellular automata"
+, update =      "96.01 jones"
+, abstract =    "In this paper, we discuss an automata model for parallel
 approximation of the discrete Voronoi diagram. Given a subset of the $n$
 labeled nodes of a two-dimensional lattice of $m \times m$ nodes, we wish to
 construct a Voronoi cell for every given node, i.e., mark such nodes that form
@@ -902,90 +902,90 @@ @article{a-vlplc-96
 }
 
 @article{akv-gdssl-92
-, author =	"R. Adamec and M. Klazar and P. Valtr"
-, title =	"Generalized {Davenport}-{Schinzel} sequences with linear upper bound"
-, journal =	"Discrete Math."
-, volume =	108
-, year =	1992
-, pages =	"219--229"
-, update =	"95.05 agarwal"
+, author =      "R. Adamec and M. Klazar and P. Valtr"
+, title =       "Generalized {Davenport}-{Schinzel} sequences with linear upper bound"
+, journal =     "Discrete Math."
+, volume =      108
+, year =        1992
+, pages =       "219--229"
+, update =      "95.05 agarwal"
 }
 
 @article{aa-ntsrm-76
-, author =	"M. Adamowich and A. Albano"
-, title =	"Nesting twodimensional shapes in rectangular modules"
-, journal =	"Comput. Aided Design"
-, volume =	2
-, number =	1
-, year =	1976
-, pages =	"27--33"
-, keywords =	"packing"
-, update =	"95.05 korneenko"
+, author =      "M. Adamowich and A. Albano"
+, title =       "Nesting twodimensional shapes in rectangular modules"
+, journal =     "Comput. Aided Design"
+, volume =      2
+, number =      1
+, year =        1976
+, pages =       "27--33"
+, keywords =    "packing"
+, update =      "95.05 korneenko"
 }
 
 @article{as-mith3-91
-, author =	"C. Adams and W. Sherman"
-, title =	"Minimum ideal triangulations of hyperbolic $3$-manifolds"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"135--153"
+, author =      "C. Adams and W. Sherman"
+, title =       "Minimum ideal triangulations of hyperbolic $3$-manifolds"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "135--153"
 }
 
 @book{a-kb-94
-, author =	"C. C. Adams"
-, title =	"The Knot Book"
-, publisher =	"W. H. Freeman"
-, address =	"New York"
-, year =	1994
-, update =	"98.07 orourke, 97.11 bibrelex"
+, author =      "C. C. Adams"
+, title =       "The Knot Book"
+, publisher =   "W. H. Freeman"
+, address =     "New York"
+, year =        1994
+, update =      "98.07 orourke, 97.11 bibrelex"
 }
 
 @article{ab-cdcg-86
-, author =	"J. A. Adams and L. M. Billow"
-, title =	"Combining descriptive and computational geometry"
-, journal =	"CIME"
-, volume =	4
-, number =	6
-, year =	1986
-, pages =	"69--76"
-, keywords =	"descriptive geometry, three-dimensional"
-, update =	"95.05 korneenko"
+, author =      "J. A. Adams and L. M. Billow"
+, title =       "Combining descriptive and computational geometry"
+, journal =     "CIME"
+, volume =      4
+, number =      6
+, year =        1986
+, pages =       "69--76"
+, keywords =    "descriptive geometry, three-dimensional"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{agj-lcsr-00
-, author =	"Udo Adamy and Joachim Giesen and Matthias John"
-, title =	"The {$\lambda$}-Complex and Surface Reconstruction"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"14--17"
-, update =	"00.03 bibrelex"
+, author =      "Udo Adamy and Joachim Giesen and Matthias John"
+, title =       "The {$\lambda$}-Complex and Surface Reconstruction"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "14--17"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{as-ewcqc-98
-, author =	"Udo Adamy and Raimund Seidel"
-, title =	"On the Exact Worst Case Query Complexity of Planar Point Location"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"609--618"
-, update =	"99.07 bibrelex, 98.07 mitchell"
+, author =      "Udo Adamy and Raimund Seidel"
+, title =       "On the Exact Worst Case Query Complexity of Planar Point Location"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "609--618"
+, update =      "99.07 bibrelex, 98.07 mitchell"
 }
 
 @article{aos-mlcps-94
-, author =	"John Adegeest and Mark Overmars and Jack Snoeyink"
-, title =	"Minimum-link $C$-oriented paths: {Single}-source queries"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, number =	1
-, year =	1994
-, pages =	"39--51"
-, keywords =	"shortest path, link distance, rectilinear link distance"
-, update =	"98.03 mitchell, 96.09 devillers, 96.05 mitchell"
-, annote =	"They consider a set of obstacles given by $n$ line
+, author =      "John Adegeest and Mark Overmars and Jack Snoeyink"
+, title =       "Minimum-link $C$-oriented paths: {Single}-source queries"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, number =      1
+, year =        1994
+, pages =       "39--51"
+, keywords =    "shortest path, link distance, rectilinear link distance"
+, update =      "98.03 mitchell, 96.09 devillers, 96.05 mitchell"
+, annote =      "They consider a set of obstacles given by $n$ line
                   segments having disjoint interiors, and being at $c$
                   different fixed orientations.  For a fixed source
                   point, they build a data structure (SPM) of size
@@ -999,758 +999,758 @@ @article{aos-mlcps-94
 }
 
 @phdthesis{a-ap-71
-, author =	"I. Adler"
-, title =	"Abstract Polytopes"
-, school =	"Dept. Operations Research, Stanford University"
-, year =	1971
-, keywords =	"doctoral thesis"
-, update =	"97.03 gaertner+salinger"
+, author =      "I. Adler"
+, title =       "Abstract Polytopes"
+, school =      "Dept. Operations Research, Stanford University"
+, year =        1971
+, keywords =    "doctoral thesis"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{ab-palpa-92
-, author =	"I. Adler and P. A. Beling"
-, title =	"Polynomial algorithms for linear programming over the algebraic numbers"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"483--494"
+, author =      "I. Adler and P. A. Beling"
+, title =       "Polynomial algorithms for linear programming over the algebraic numbers"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "483--494"
 }
 
 @article{ad-mdap-74
-, author =	"I. Adler and G. B. Dantzig"
-, title =	"Maximum diameter of abstract polytopes"
-, journal =	"Math. Programming Studies"
-, volume =	1
-, year =	1974
-, pages =	"20--40"
-, update =	"97.03 gaertner+salinger"
+, author =      "I. Adler and G. B. Dantzig"
+, title =       "Maximum diameter of abstract polytopes"
+, journal =     "Math. Programming Studies"
+, volume =      1
+, year =        1974
+, pages =       "20--40"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{adm-eaaap-74
-, author =	"I. Adler and G. B. Dantzig and K. Murty"
-, title =	"Existence of A-avoiding a-paths in abstract polytopes"
-, journal =	"Math. Programming Studies"
-, volume =	1
-, year =	1974
-, pages =	"41--42"
-, update =	"97.03 gaertner+salinger"
+, author =      "I. Adler and G. B. Dantzig and K. Murty"
+, title =       "Existence of A-avoiding a-paths in abstract polytopes"
+, journal =     "Math. Programming Studies"
+, volume =      1
+, year =        1974
+, pages =       "41--42"
+, update =      "97.03 gaertner+salinger"
 }
 
 @techreport{aks-svsml-83
-, author =	"I. Adler and R. Karp and R. Shamir"
-, title =	"A simplex variant solving an $m \times d$ linear program in {$O(\min(m^{2},d^{2}))$} expected number of pivot steps"
-, type =	"Report"
-, number =	"UCB/CSD 83/158"
-, institution =	"Comput. Sci. Div., Univ. California"
-, address =	"Berkeley, CA"
-, year =	1983
+, author =      "I. Adler and R. Karp and R. Shamir"
+, title =       "A simplex variant solving an $m \times d$ linear program in {$O(\min(m^{2},d^{2}))$} expected number of pivot steps"
+, type =        "Report"
+, number =      "UCB/CSD 83/158"
+, institution = "Comput. Sci. Div., Univ. California"
+, address =     "Berkeley, CA"
+, year =        1983
 }
 
 @inproceedings{am-sawan-84
-, author =	"I. Adler and N. Megiddo"
-, title =	"A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"312--323"
-, precedes =	"am-sawan-85"
+, author =      "I. Adler and N. Megiddo"
+, title =       "A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "312--323"
+, precedes =    "am-sawan-85"
 }
 
 @article{am-sawan-85
-, author =	"I. Adler and N. Megiddo"
-, title =	"A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension"
-, journal =	"J. ACM"
-, volume =	32
-, year =	1985
-, pages =	"871--895"
-, keywords =	"average-case analysis, linear programming"
-, succeeds =	"am-sawan-84"
+, author =      "I. Adler and N. Megiddo"
+, title =       "A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension"
+, journal =     "J. ACM"
+, volume =      32
+, year =        1985
+, pages =       "871--895"
+, keywords =    "average-case analysis, linear programming"
+, succeeds =    "am-sawan-84"
 }
 
 @article{amt-nrbsa-84
-, author =	"I. Adler and N. Megiddo and M. J. Todd"
-, title =	"New results on the behavior of simplex algorithms"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	11
-, year =	1984
-, pages =	"378--382"
-, keywords =	"average-case analysis, linear programming"
+, author =      "I. Adler and N. Megiddo and M. J. Todd"
+, title =       "New results on the behavior of simplex algorithms"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      11
+, year =        1984
+, pages =       "378--382"
+, keywords =    "average-case analysis, linear programming"
 }
 
 @article{as-lmpap-76
-, author =	"I. Adler and R. Saigal"
-, title =	"Long monotone paths in abstract polytopes"
-, journal =	"Math. Oper. Res."
-, volume =	1
-, number =	1
-, year =	1976
-, pages =	"89--95"
-, update =	"97.03 gaertner+salinger"
+, author =      "I. Adler and R. Saigal"
+, title =       "Long monotone paths in abstract polytopes"
+, journal =     "Math. Oper. Res."
+, volume =      1
+, number =      1
+, year =        1976
+, pages =       "89--95"
+, update =      "97.03 gaertner+salinger"
 }
 
 @techreport{as-rssua-90
-, author =	"I. Adler and R. Shamir"
-, title =	"A randomization scheme for speeding up algorithms for linear and convex quadratic programming problems with a high constraints-to-variables ratio"
-, type =	"Technical {Report}"
-, number =	"21-90"
-, institution =	"Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, month =	may
-, year =	1990
-, update =	"98.03 bibrelex"
+, author =      "I. Adler and R. Shamir"
+, title =       "A randomization scheme for speeding up algorithms for linear and convex quadratic programming problems with a high constraints-to-variables ratio"
+, type =        "Technical {Report}"
+, number =      "21-90"
+, institution = "Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, month =       may
+, year =        1990
+, update =      "98.03 bibrelex"
 }
 
 @article{as-rssua-93
-, author =	"I. Adler and R. Shamir"
-, title =	"A randomization scheme for speeding up algorithms for linear and convex quadratic programming problems with a high constraints-to-variables ratio"
-, journal =	"Math. Prog."
-, volume =	61
-, year =	1993
-, pages =	"39--52"
-, update =	"97.03 clarkson"
+, author =      "I. Adler and R. Shamir"
+, title =       "A randomization scheme for speeding up algorithms for linear and convex quadratic programming problems with a high constraints-to-variables ratio"
+, journal =     "Math. Prog."
+, volume =      61
+, year =        1993
+, pages =       "39--52"
+, update =      "97.03 clarkson"
 }
 
 @inproceedings{abk-pslb-95
-, author =	"M. Adler and J. W. Byers and R. M. Karp"
-, title =	"Parallel sorting with limited bandwidth"
-, booktitle =	"Proc. 7th ACM Sympos. Parallel Algorithms Architect."
-, year =	1995
-, pages =	"129--136"
-, update =	"96.09 orourke"
+, author =      "M. Adler and J. W. Byers and R. M. Karp"
+, title =       "Parallel sorting with limited bandwidth"
+, booktitle =   "Proc. 7th ACM Sympos. Parallel Algorithms Architect."
+, year =        1995
+, pages =       "129--136"
+, update =      "96.09 orourke"
 }
 
 @article{as-rprs-92
-, author =	"F. Affentranger and R. Schneider"
-, title =	"Random projections of regular simplices"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"219--226"
+, author =      "F. Affentranger and R. Schneider"
+, title =       "Random projections of regular simplices"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "219--226"
 }
 
 @article{aw-churp-91
-, author =	"F. Affentranger and J. A. Wieacker"
-, title =	"On the convex hull of uniform random points in a simple $d$-polytope"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"291--305"
+, author =      "F. Affentranger and J. A. Wieacker"
+, title =       "On the convex hull of uniform random points in a simple $d$-polytope"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "291--305"
 }
 
 @inproceedings{asw-emstb-90
-, author =	"Pankaj Agarwal and Otfried Schwarzkopf and Emo Welzl"
-, title =	"Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	3
-, precedes =	"aesw-emstb-90"
-, update =	"01.04 icking, 00.03 bibrelex"
+, author =      "Pankaj Agarwal and Otfried Schwarzkopf and Emo Welzl"
+, title =       "Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       3
+, precedes =    "aesw-emstb-90"
+, update =      "01.04 icking, 00.03 bibrelex"
 }
 
 @inproceedings{a-dapal-89
-, author =	"Pankaj K. Agarwal"
-, title =	"A deterministic algorithm for partitioning arrangements of lines and its applications"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"11--22"
-, cites =	"a-pal1e-90, a-pal2a-90, a-rsoas-89, as-rbida-88, aks-scps-83, aegs-ibcmf-89, c-rcsi-86, c-prsig-87, c-tbsns-88, ce-oails-88, cf-dvrsi-88, cw-rsvdc-88, c-sdsno-84, c-narsc-87, c-arscg-88, cegsw-ccbac-88, cs-adpch-88, ctv-flvat-88i, csss-oss-88, e-acg-87, eghsssw-irals-89, egs-cmfal-88, egs-oplms-86, eos-calha-86, ew-cbtda-86, gos-ilsrs-88, hw-ensrq-86, ms-rcibt-88, m-cen-89, m-splcn-91, m-apcad-83, m-fppa1-88, ps-cgi-85, st-pplup-86, st-epdg-83, w-mksfs-86, w-pttco-88, w-enh-88, ZZZ"
-, update =	"98.03 bibrelex, 96.05 agarwal"
+, author =      "Pankaj K. Agarwal"
+, title =       "A deterministic algorithm for partitioning arrangements of lines and its applications"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "11--22"
+, cites =       "a-pal1e-90, a-pal2a-90, a-rsoas-89, as-rbida-88, aks-scps-83, aegs-ibcmf-89, c-rcsi-86, c-prsig-87, c-tbsns-88, ce-oails-88, cf-dvrsi-88, cw-rsvdc-88, c-sdsno-84, c-narsc-87, c-arscg-88, cegsw-ccbac-88, cs-adpch-88, ctv-flvat-88i, csss-oss-88, e-acg-87, eghsssw-irals-89, egs-cmfal-88, egs-oplms-86, eos-calha-86, ew-cbtda-86, gos-ilsrs-88, hw-ensrq-86, ms-rcibt-88, m-cen-89, m-splcn-91, m-apcad-83, m-fppa1-88, ps-cgi-85, st-pplup-86, st-epdg-83, w-mksfs-86, w-pttco-88, w-enh-88, ZZZ"
+, update =      "98.03 bibrelex, 96.05 agarwal"
 }
 
 @inproceedings{a-anspt-91
-, author =	"Pankaj K. Agarwal"
-, title =	"Applications of a new space partition technique"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, nickname =	"WADS '91"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, year =	1991
-, pages =	"379--392"
-, keywords =	"$d$-dimensional, ray tracing, hidden line/surface elimination, minimal spanning tree, space partition"
-, update =	"98.07 bibrelex, 97.11 bibrelex, 96.05 agarwal, 95.09 agarwal, 95.05 korneenko"
+, author =      "Pankaj K. Agarwal"
+, title =       "Applications of a new space partition technique"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, nickname =    "WADS '91"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, year =        1991
+, pages =       "379--392"
+, keywords =    "$d$-dimensional, ray tracing, hidden line/surface elimination, minimal spanning tree, space partition"
+, update =      "98.07 bibrelex, 97.11 bibrelex, 96.05 agarwal, 95.09 agarwal, 95.05 korneenko"
 }
 
 @mastersthesis{a-ga-85
-, author =	"Pankaj K. Agarwal"
-, title =	"Geometric algorithms"
-, type =	"M.{Sc}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. California"
-, address =	"Santa Barbara, CA"
-, year =	1985
-, note =	"Report TRCS 85-17"
-, keywords =	"master thesis"
-, update =	"96.05 agarwal, 93.05 jones"
+, author =      "Pankaj K. Agarwal"
+, title =       "Geometric algorithms"
+, type =        "M.{Sc}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. California"
+, address =     "Santa Barbara, CA"
+, year =        1985
+, note =        "Report TRCS 85-17"
+, keywords =    "master thesis"
+, update =      "96.05 agarwal, 93.05 jones"
 }
 
 @techreport{a-gpia-91t
-, author =	"Pankaj K. Agarwal"
-, title =	"Geometric partitioning and its applications"
-, type =	"Report"
-, number =	"CS-1991-27"
-, institution =	"Dept. Comput. Sci., Duke Univ."
-, address =	"Durham, NC"
-, year =	1991
-, keywords =	"random sampling, partition, arrangement, point location"
-, precedes =	"a-gpia-91i"
-, update =	"98.11 bibrelex, 96.05 agarwal, 94.01 smid"
+, author =      "Pankaj K. Agarwal"
+, title =       "Geometric partitioning and its applications"
+, type =        "Report"
+, number =      "CS-1991-27"
+, institution = "Dept. Comput. Sci., Duke Univ."
+, address =     "Durham, NC"
+, year =        1991
+, keywords =    "random sampling, partition, arrangement, point location"
+, precedes =    "a-gpia-91i"
+, update =      "98.11 bibrelex, 96.05 agarwal, 94.01 smid"
 }
 
 @incollection{a-gpia-91i
-, author =	"Pankaj K. Agarwal"
-, title =	"Geometric partitioning and its applications"
-, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
-, booktitle =	"Computational Geometry: Papers from the DIMACS Special Year"
-, publisher =	"American Mathematical Society"
-, year =	1991
-, keywords =	"random sampling, partition, arrangement, point location"
-, comments =	"survey paper --- cuttings, range search"
-, succeeds =	"a-gpia-91t"
-, update =	"98.11 bibrelex, 98.07 agarwal, 96.05 agarwal, 93.09 matousek"
+, author =      "Pankaj K. Agarwal"
+, title =       "Geometric partitioning and its applications"
+, editor =      "J. E. Goodman and R. Pollack and W. Steiger"
+, booktitle =   "Computational Geometry: Papers from the DIMACS Special Year"
+, publisher =   "American Mathematical Society"
+, year =        1991
+, keywords =    "random sampling, partition, arrangement, point location"
+, comments =    "survey paper --- cuttings, range search"
+, succeeds =    "a-gpia-91t"
+, update =      "98.11 bibrelex, 98.07 agarwal, 96.05 agarwal, 93.09 matousek"
 }
 
 @phdthesis{a-idaac-89
-, author =	"Pankaj K. Agarwal"
-, title =	"Intersection and decomposition algorithms for arrangements of curves in the plane"
-, school =	"Dept. Comput. Sci., New York Univ."
-, month =	aug
-, year =	1989
-, keywords =	"doctoral thesis"
-, update =	"98.07 agarwal, 98.03 mitchell, 97.11 bibrelex"
+, author =      "Pankaj K. Agarwal"
+, title =       "Intersection and decomposition algorithms for arrangements of curves in the plane"
+, school =      "Dept. Comput. Sci., New York Univ."
+, month =       aug
+, year =        1989
+, keywords =    "doctoral thesis"
+, update =      "98.07 agarwal, 98.03 mitchell, 97.11 bibrelex"
 }
 
 @book{a-idapa-91
-, author =	"Pankaj K. Agarwal"
-, title =	"Intersection and decomposition algorithms for planar arrangements"
-, publisher =	"Cambridge University Press"
-, address =	"New York, NY"
-, year =	1991
-, keywords =	"arrangement, partition, Davenport-Schinzel sequences"
-, update =	"96.05 agarwal"
+, author =      "Pankaj K. Agarwal"
+, title =       "Intersection and decomposition algorithms for planar arrangements"
+, publisher =   "Cambridge University Press"
+, address =     "New York, NY"
+, year =        1991
+, keywords =    "arrangement, partition, Davenport-Schinzel sequences"
+, update =      "96.05 agarwal"
 }
 
 @techreport{a-slp3d-93
-, author =	"Pankaj K. Agarwal"
-, title =	"On stabbing lines for polyhedra in $3$d"
-, type =	"Technical Report"
-, number =	"CS-1993-09"
-, institution =	"Department Computer Science, Duke University"
-, year =	1993
-, update =	"96.05 agarwal, 94.01 matousek"
+, author =      "Pankaj K. Agarwal"
+, title =       "On stabbing lines for polyhedra in $3$d"
+, type =        "Technical Report"
+, number =      "CS-1993-09"
+, institution = "Department Computer Science, Duke University"
+, year =        1993
+, update =      "96.05 agarwal, 94.01 matousek"
 }
 
 @article{a-slp3d-94
-, author =	"P. K. Agarwal"
-, title =	"On stabbing lines for polyhedra in $3$d"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"177--189"
-, update =	"96.09 devillers, 96.05 agarwal"
+, author =      "P. K. Agarwal"
+, title =       "On stabbing lines for polyhedra in $3$d"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "177--189"
+, update =      "96.09 devillers, 96.05 agarwal"
 }
 
 @article{a-pal1e-90
-, author =	"Pankaj K. Agarwal"
-, title =	"Partitioning arrangements of lines: {I}. {An} efficient deterministic algorithm"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"449--483"
-, keywords =	"deterministic partitioning, random sampling, arrangements of lines"
-, update =	"96.05 agarwal"
+, author =      "Pankaj K. Agarwal"
+, title =       "Partitioning arrangements of lines: {I}. {An} efficient deterministic algorithm"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "449--483"
+, keywords =    "deterministic partitioning, random sampling, arrangements of lines"
+, update =      "96.05 agarwal"
 }
 
 @article{a-pal2a-90
-, author =	"Pankaj K. Agarwal"
-, title =	"Partitioning arrangements of lines: {II}. {Applications}"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"533--573"
-, keywords =	"random sampling, arrangements, divide-and-conquer"
-, update =	"96.05 agarwal"
+, author =      "Pankaj K. Agarwal"
+, title =       "Partitioning arrangements of lines: {II}. {Applications}"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "533--573"
+, keywords =    "random sampling, arrangements, divide-and-conquer"
+, update =      "96.05 agarwal"
 }
 
 @techreport{a-rs-96
-, author =	"Pankaj K. Agarwal"
-, title =	"Range searching"
-, type =	"Report"
-, number =	"CS-1996-05"
-, institution =	"Dept. Comput. Sci., Duke Univ."
-, address =	"Durham, NC"
-, year =	1996
-, update =	"96.09 agarwal"
+, author =      "Pankaj K. Agarwal"
+, title =       "Range searching"
+, type =        "Report"
+, number =      "CS-1996-05"
+, institution = "Dept. Comput. Sci., Duke Univ."
+, address =     "Durham, NC"
+, year =        1996
+, update =      "96.09 agarwal"
 }
 
 @incollection{a-rs-97
-, author =	"Pankaj K. Agarwal"
-, title =	"Range searching"
-, chapter =	31
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"575--598"
-, update =	"98.07 agarwal, 98.03 mitchell, 97.11 orourke"
+, author =      "Pankaj K. Agarwal"
+, title =       "Range searching"
+, chapter =     31
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "575--598"
+, update =      "98.07 agarwal, 98.03 mitchell, 97.11 orourke"
 }
 
 @inproceedings{a-rsoas-89
-, author =	"Pankaj K. Agarwal"
-, title =	"Ray shooting and other applications of spanning trees with low stabbing number"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"315--325"
-, precedes =	"a-rsoas-92"
-, cites =	"a-dapal-89, a-pal1e-90, a-pal2a-90, a-rsoas-92, cw-rsvdc-88, c-tbsns-88, c-prsig-87, cg-vippg-85, cg-fc1ds-86, cg-fc2a-86, c-narsc-87, cegsw-ccbac-88, c-sssl-86, d-qbhle-86, de-ssio-87, dsst-mdsp-89, eg-tsa-89, egppss-acptc-88, eghsssw-irals-88, egs-cmfal-88, egs-oplms-86, eos-calha-86, ew-hrsls-86, ghlst-ltavs-87, gos-ilsrs-88t, gss-gmppt-88, gy-tsr-83, hw-ensrq-87, k-osps-83, m-wcohs-87, m-cen-89, m-splcn-91, pss-stsps-88, so-wcoac-86, st-pplup-86, w-pttco-88, ZZZ"
-, update =	"98.03 bibrelex, 96.05 agarwal, 95.05 korneenko"
+, author =      "Pankaj K. Agarwal"
+, title =       "Ray shooting and other applications of spanning trees with low stabbing number"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "315--325"
+, precedes =    "a-rsoas-92"
+, cites =       "a-dapal-89, a-pal1e-90, a-pal2a-90, a-rsoas-92, cw-rsvdc-88, c-tbsns-88, c-prsig-87, cg-vippg-85, cg-fc1ds-86, cg-fc2a-86, c-narsc-87, cegsw-ccbac-88, c-sssl-86, d-qbhle-86, de-ssio-87, dsst-mdsp-89, eg-tsa-89, egppss-acptc-88, eghsssw-irals-88, egs-cmfal-88, egs-oplms-86, eos-calha-86, ew-hrsls-86, ghlst-ltavs-87, gos-ilsrs-88t, gss-gmppt-88, gy-tsr-83, hw-ensrq-87, k-osps-83, m-wcohs-87, m-cen-89, m-splcn-91, pss-stsps-88, so-wcoac-86, st-pplup-86, w-pttco-88, ZZZ"
+, update =      "98.03 bibrelex, 96.05 agarwal, 95.05 korneenko"
 }
 
 @article{a-rsoas-92
-, author =	"Pankaj K. Agarwal"
-, title =	"Ray shooting and other applications of spanning trees with low stabbing number"
-, journal =	"SIAM J. Comput."
-, volume =	21
-, year =	1992
-, pages =	"540--570"
-, keywords =	"ray shooting, visibility, spanning trees, partition trees"
-, succeeds =	"a-rsoas-89"
-, update =	"96.05 agarwal, 95.05 korneenko"
+, author =      "Pankaj K. Agarwal"
+, title =       "Ray shooting and other applications of spanning trees with low stabbing number"
+, journal =     "SIAM J. Comput."
+, volume =      21
+, year =        1992
+, pages =       "540--570"
+, keywords =    "ray shooting, visibility, spanning trees, partition trees"
+, succeeds =    "a-rsoas-89"
+, update =      "96.05 agarwal, 95.05 korneenko"
 }
 
 % yes, "farthest"
 @inproceedings{aaakss-cefns-89
-, author =	"Pankaj K. Agarwal and A. Aggarwal and B. Aronov and S. R. Kosaraju and B. Schieber and Subhash Suri"
-, title =	"Computing external-farthest neighbors for a simple polygon"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	45
-, keywords =	"furthest neighbors, geodesic distance, simple polygon, diameter"
-, precedes =	"aaakss-cefns-91"
-, update =	"98.03 mitchell, 96.05 agarwal"
+, author =      "Pankaj K. Agarwal and A. Aggarwal and B. Aronov and S. R. Kosaraju and B. Schieber and Subhash Suri"
+, title =       "Computing external-farthest neighbors for a simple polygon"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       45
+, keywords =    "furthest neighbors, geodesic distance, simple polygon, diameter"
+, precedes =    "aaakss-cefns-91"
+, update =      "98.03 mitchell, 96.05 agarwal"
 }
 
 % yes, "farthest"
 @article{aaakss-cefns-91
-, author =	"Pankaj K. Agarwal and A. Aggarwal and B. Aronov and S. R. Kosaraju and B. Schieber and Subhash Suri"
-, title =	"Computing external farthest neighbors for a simple polygon"
-, journal =	"Discrete Appl. Math."
-, volume =	31
-, number =	2
-, year =	1991
-, pages =	"97--111"
-, keywords =	"furthest neighbors, geodesic distance, simple polygon, diameter"
-, succeeds =	"aaakss-cefns-89"
-, update =	"98.03 mitchell, 96.05 agarwal"
+, author =      "Pankaj K. Agarwal and A. Aggarwal and B. Aronov and S. R. Kosaraju and B. Schieber and Subhash Suri"
+, title =       "Computing external farthest neighbors for a simple polygon"
+, journal =     "Discrete Appl. Math."
+, volume =      31
+, number =      2
+, year =        1991
+, pages =       "97--111"
+, keywords =    "furthest neighbors, geodesic distance, simple polygon, diameter"
+, succeeds =    "aaakss-cefns-89"
+, update =      "98.03 mitchell, 96.05 agarwal"
 }
 
 @inproceedings{aaas-cvgbr-93
-, author =	"Pankaj K. Agarwal and N. Alon and B. Aronov and Subhash Suri"
-, title =	"Can visibility graphs be represented compactly?"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"338--347"
-, cites =	"ast-apsgo-94, as-pm-92, as-cldsp-90, c-tpca-82, c-lbors2-90, c-lbcpr-89, cegs-ablsp-94, cg-vippg-89, cr-ccpso-91, et-psant-41, f-lbcor-81, gm-osacv-91, hw-itn-79, ks-pgt-67, s-tfpgs-38, t-cgcbs-84, w-cvgnl-85, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex+mitchell, 96.05 agarwal, 93.09 jones"
+, author =      "Pankaj K. Agarwal and N. Alon and B. Aronov and Subhash Suri"
+, title =       "Can visibility graphs be represented compactly?"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "338--347"
+, cites =       "ast-apsgo-94, as-pm-92, as-cldsp-90, c-tpca-82, c-lbors2-90, c-lbcpr-89, cegs-ablsp-94, cg-vippg-89, cr-ccpso-91, et-psant-41, f-lbcor-81, gm-osacv-91, hw-itn-79, ks-pgt-67, s-tfpgs-38, t-cgcbs-84, w-cvgnl-85, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex+mitchell, 96.05 agarwal, 93.09 jones"
 }
 
 @article{aaas-cvgbr-94
-, author =	"Pankaj K. Agarwal and N. Alon and B. Aronov and Subhash Suri"
-, title =	"Can visibility graphs be represented compactly?"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"347--365"
-, update =	"98.03 mitchell, 96.05 agarwal, 95.01 smid"
+, author =      "Pankaj K. Agarwal and N. Alon and B. Aronov and Subhash Suri"
+, title =       "Can visibility graphs be represented compactly?"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "347--365"
+, update =      "98.03 mitchell, 96.05 agarwal, 95.01 smid"
 }
 
 @inproceedings{aaas-lpmpc-97
-, author =	"Pankaj K. Agarwal and Nina Amenta and Boris Aronov and Micha Sharir"
-, title =	"Largest placements and motion planning of a convex polygon"
-, editor =	"Jean-Paul Laumond and Mark Overmars"
-, booktitle =	"Algorithms for Robotic Motion and Manipulation"
-, nickname =	"WAFR '96"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1997
-, pages =	"143--154"
-, precedes =	"aas-mpcpp-97"
-, update =	"01.04 icking, 98.11 bibrelex, 98.07 agarwal, 97.11 aronov"
-, annote =	"Proc. 1996 Workshop on the Algorithmic Foundations of Robotics"
+, author =      "Pankaj K. Agarwal and Nina Amenta and Boris Aronov and Micha Sharir"
+, title =       "Largest placements and motion planning of a convex polygon"
+, editor =      "Jean-Paul Laumond and Mark Overmars"
+, booktitle =   "Algorithms for Robotic Motion and Manipulation"
+, nickname =    "WAFR '96"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1997
+, pages =       "143--154"
+, precedes =    "aas-mpcpp-97"
+, update =      "01.04 icking, 98.11 bibrelex, 98.07 agarwal, 97.11 aronov"
+, annote =      "Proc. 1996 Workshop on the Algorithmic Foundations of Robotics"
 }
 
 @article{aas-lpocp-98
-, author =	"Pankaj K. Agarwal and Nina Amenta and Micha Sharir"
-, title =	"Largest Placement of One Convex Polygon Inside Another"
-, journal =	"Discrete Comput. Geom."
-, succeeds =	"aas-mpcpp-97"
-, update =	"01.04 icking, 98.11 bibrelex, 97.11 bibrelex"
+, author =      "Pankaj K. Agarwal and Nina Amenta and Micha Sharir"
+, title =       "Largest Placement of One Convex Polygon Inside Another"
+, journal =     "Discrete Comput. Geom."
+, succeeds =    "aas-mpcpp-97"
+, update =      "01.04 icking, 98.11 bibrelex, 97.11 bibrelex"
 }
 
 @techreport{aas-pocpi-95
-, author =	"P. K. Agarwal and N. Amenta and Micha Sharir"
-, title =	"Placement of one convex polygon inside another"
-, type =	"Tech. {Report}"
-, number =	"CS-1995-29"
-, institution =	"Duke University"
-, year =	1995
-, keywords =	"collision detection, motion planning"
-, update =	"98.03 mitchell, 96.05 agarwal"
+, author =      "P. K. Agarwal and N. Amenta and Micha Sharir"
+, title =       "Placement of one convex polygon inside another"
+, type =        "Tech. {Report}"
+, number =      "CS-1995-29"
+, institution = "Duke University"
+, year =        1995
+, keywords =    "collision detection, motion planning"
+, update =      "98.03 mitchell, 96.05 agarwal"
 }
 
 @article{aas-pocpi-98
-, author =	"P. K. Agarwal and N. Amenta and M. Sharir"
-, title =	"Placement of one convex polygon inside another"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"95--104"
-, update =	"98.07 agarwal, 98.03 agarwal"
+, author =      "P. K. Agarwal and N. Amenta and M. Sharir"
+, title =       "Placement of one convex polygon inside another"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "95--104"
+, update =      "98.07 agarwal, 98.03 agarwal"
 }
 
 @inproceedings{aabv-iedpl-99
-, author =	"Pankaj K. Agarwal and Lars Arge and G. Brodal and Jeffrey S. Vitter"
-, title =	"I/O-efficient dynamic point location in monotone subdivisions"
-, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1999
-, pages =	"11--20"
-, update =	"99.03 agarwal"
+, author =      "Pankaj K. Agarwal and Lars Arge and G. Brodal and Jeffrey S. Vitter"
+, title =       "I/O-efficient dynamic point location in monotone subdivisions"
+, booktitle =   "Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1999
+, pages =       "11--20"
+, update =      "99.03 agarwal"
 }
 
 @inproceedings{aae-imp-00
-, author =	"P. K. Agarwal and L. Arge and J. Erickson"
-, title =	"Indexing moving points"
-, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
-, year =	2000
-, note =	"175--186"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "P. K. Agarwal and L. Arge and J. Erickson"
+, title =       "Indexing moving points"
+, booktitle =   "Proc. Annu. ACM Sympos. Principles Database Syst."
+, year =        2000
+, note =        "175--186"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{aaefv-eslc-98
-, author =	"P. K. Agarwal and L. Arge and J. Erickson and P. G. Franciosa and J. S. Vitter"
-, title =	"Efficient Searching with Linear Constraints"
-, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
-, year =	1998
-, note =	"to appear"
-, update =	"98.03 agarwal"
+, author =      "P. K. Agarwal and L. Arge and J. Erickson and P. G. Franciosa and J. S. Vitter"
+, title =       "Efficient Searching with Linear Constraints"
+, booktitle =   "Proc. Annu. ACM Sympos. Principles Database Syst."
+, year =        1998
+, note =        "to appear"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{aamvv-ieacl-98
-, author =	"Pankaj K. Agarwal and Lars Arge and T. M. Murali and Kasturi R. Varadarajan and Jeffrey S. Vitter"
-, title =	"{I/O}-Efficient Algorithms for Contour-Line Extraction and Planar Graph Blocking"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"117--126"
-, update =	"99.07 bibrelex, 98.07 mitchell"
+, author =      "Pankaj K. Agarwal and Lars Arge and T. M. Murali and Kasturi R. Varadarajan and Jeffrey S. Vitter"
+, title =       "{I/O}-Efficient Algorithms for Contour-Line Extraction and Planar Graph Blocking"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "117--126"
+, update =      "99.07 bibrelex, 98.07 mitchell"
 }
 
 @techreport{aa-cfi-89
-, author =	"Pankaj K. Agarwal and B. Aronov"
-, title =	"Counting facets and incidences"
-, type =	"Report"
-, number =	"90-38"
-, institution =	"DIMACS, Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1989
-, keywords =	"combinatorial geometry, combinatorial complexity, hyperplane arrangements, triangle arrangements"
-, precedes =	"aa-cfi-92"
-, update =	"96.05 agarwal"
+, author =      "Pankaj K. Agarwal and B. Aronov"
+, title =       "Counting facets and incidences"
+, type =        "Report"
+, number =      "90-38"
+, institution = "DIMACS, Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1989
+, keywords =    "combinatorial geometry, combinatorial complexity, hyperplane arrangements, triangle arrangements"
+, precedes =    "aa-cfi-92"
+, update =      "96.05 agarwal"
 }
 
 @article{aa-cfi-92
-, author =	"Pankaj K. Agarwal and B. Aronov"
-, title =	"Counting facets and incidences"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"359--369"
-, keywords =	"combinatorial geometry, combinatorial complexity, hyperplane arrangements, triangle arrangements"
-, succeeds =	"aa-cfi-89"
-, update =	"96.05 agarwal"
+, author =      "Pankaj K. Agarwal and B. Aronov"
+, title =       "Counting facets and incidences"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "359--369"
+, keywords =    "combinatorial geometry, combinatorial complexity, hyperplane arrangements, triangle arrangements"
+, succeeds =    "aa-cfi-89"
+, update =      "96.05 agarwal"
 }
 
 @article{aacs-lalsp-98
-, author =	"P. K. Agarwal and B. Aronov and T. M. Chan and M. Sharir"
-, title =	"On Levels in Arrangements of Lines, Segments, Planes, and Triangles"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"315--331"
-, update =	"98.07 agarwal+smid, 98.03 agarwal"
+, author =      "P. K. Agarwal and B. Aronov and T. M. Chan and M. Sharir"
+, title =       "On Levels in Arrangements of Lines, Segments, Planes, and Triangles"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "315--331"
+, update =      "98.07 agarwal+smid, 98.03 agarwal"
 }
 
 @inproceedings{aahs-aeamw-99
-, author =	"Pankaj K. Agarwal and Boris Aronov and Sariel Har-Peled and Micha Sharir"
-, title =	"Approximation and Exact Algorithms for Minimum-Width Annuli and Shells"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"380--389"
-, update =	"99.07 devillers"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Sariel Har-Peled and Micha Sharir"
+, title =       "Approximation and Exact Algorithms for Minimum-Width Annuli and Shells"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "380--389"
+, update =      "99.07 devillers"
 }
 
 @inproceedings{aaos-supa-90
-, author =	"Pankaj K. Agarwal and B. Aronov and J. O'Rourke and C. Schevon"
-, title =	"Star unfolding of a polytope with applications"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"251--263"
-, keywords =	"motion planning, shortest paths, polytopes, diameter, edge sequences, unfolding of polytopes"
-, precedes =	"aaos-supa-93"
-, update =	"98.03 orourke, 96.05 agarwal"
+, author =      "Pankaj K. Agarwal and B. Aronov and J. O'Rourke and C. Schevon"
+, title =       "Star unfolding of a polytope with applications"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "251--263"
+, keywords =    "motion planning, shortest paths, polytopes, diameter, edge sequences, unfolding of polytopes"
+, precedes =    "aaos-supa-93"
+, update =      "98.03 orourke, 96.05 agarwal"
 }
 
 @techreport{aaos-supa-93
-, author =	"Pankaj K. Agarwal and B. Aronov and J. O'Rourke and C. Schevon"
-, title =	"Star unfolding of a polytope with applications"
-, type =	"Technical {Report}"
-, number =	031
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA"
-, month =	jul
-, year =	1993
-, keywords =	"motion planning, shortest paths, polytopes, diameter, edge sequences, unfolding of polytopes"
-, succeeds =	"aaos-supa-90"
-, precedes =	"aaos-supa-97"
-, update =	"98.03 orourke, 96.05 agarwal, 95.01 smid, 94.01 orourke"
+, author =      "Pankaj K. Agarwal and B. Aronov and J. O'Rourke and C. Schevon"
+, title =       "Star unfolding of a polytope with applications"
+, type =        "Technical {Report}"
+, number =      031
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA"
+, month =       jul
+, year =        1993
+, keywords =    "motion planning, shortest paths, polytopes, diameter, edge sequences, unfolding of polytopes"
+, succeeds =    "aaos-supa-90"
+, precedes =    "aaos-supa-97"
+, update =      "98.03 orourke, 96.05 agarwal, 95.01 smid, 94.01 orourke"
 }
 
 % number = 6
 % month = dec
 @article{aaos-supa-97
-, author =	"Pankaj K. Agarwal and Boris Aronov and Joseph O'Rourke and Catherine A. Schevon"
-, title =	"Star Unfolding of a Polytope with Applications"
-, journal =	"SIAM J. Comput."
-, volume =	26
-, year =	1997
-, pages =	"1689--1713"
-, keywords =	"motion planning, shortest paths, polytopes, diameter, edge sequences, unfolding of polytopes"
-, succeeds =	"aaos-supa-93"
-, update =	"98.03 smid, 97.11 agarwal+orourke, 97.03 agarwal+orourke, 96.05 orourke"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Joseph O'Rourke and Catherine A. Schevon"
+, title =       "Star Unfolding of a Polytope with Applications"
+, journal =     "SIAM J. Comput."
+, volume =      26
+, year =        1997
+, pages =       "1689--1713"
+, keywords =    "motion planning, shortest paths, polytopes, diameter, edge sequences, unfolding of polytopes"
+, succeeds =    "aaos-supa-93"
+, update =      "98.03 smid, 97.11 agarwal+orourke, 97.03 agarwal+orourke, 96.05 orourke"
 }
 
 @techreport{aapps-qpghl-95
-, author =	"Pankaj K. Agarwal and Boris Aronov and Janos Pach and Richard Pollack and Micha Sharir"
-, title =	"Quasi-planar graphs have a linear number of edges"
-, type =	"Report"
-, number =	"CS-1995-30"
-, institution =	"Dept. Comput. Sci., Duke Univ."
-, address =	"Durham, NC"
-, year =	1996
-, precedes =	"aapps-qpghl-96"
-, update =	"98.11 bibrelex, 96.09 agarwal"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Janos Pach and Richard Pollack and Micha Sharir"
+, title =       "Quasi-planar graphs have a linear number of edges"
+, type =        "Report"
+, number =      "CS-1995-30"
+, institution = "Dept. Comput. Sci., Duke Univ."
+, address =     "Durham, NC"
+, year =        1996
+, precedes =    "aapps-qpghl-96"
+, update =      "98.11 bibrelex, 96.09 agarwal"
 }
 
 @inproceedings{aapps-qpghl-96
-, author =	"Pankaj K. Agarwal and Boris Aronov and Janos Pach and Richard Pollack and Micha Sharir"
-, title =	"Quasi-planar graphs have a linear number of edges"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"1--7"
-, succeeds =	"aapps-qpghl-95"
-, precedes =	"aapps-qpghl-97"
-, update =	"98.11 bibrelex, 97.11 aronov"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Janos Pach and Richard Pollack and Micha Sharir"
+, title =       "Quasi-planar graphs have a linear number of edges"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "1--7"
+, succeeds =    "aapps-qpghl-95"
+, precedes =    "aapps-qpghl-97"
+, update =      "98.11 bibrelex, 97.11 aronov"
 }
 
 @article{aapps-qpghl-97
-, author =	"Pankaj K. Agarwal and Boris Aronov and Janos Pach and Richard Pollack and Micha Sharir"
-, title =	"Quasi-planar graphs have a linear number of edges"
-, journal =	"Combinatorica"
-, volume =	17
-, year =	1997
-, pages =	"1--9"
-, succeeds =	"aapps-qpghl-96"
-, update =	"97.11 aronov"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Janos Pach and Richard Pollack and Micha Sharir"
+, title =       "Quasi-planar graphs have a linear number of edges"
+, journal =     "Combinatorica"
+, volume =      17
+, year =        1997
+, pages =       "1--9"
+, succeeds =    "aapps-qpghl-96"
+, update =      "97.11 aronov"
 }
 
 @inproceedings{aas-cefda-94
-, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
-, title =	"Computing Envelopes in Four Dimensions with Applications"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"348--358"
-, precedes =	"aas-cefda-97"
-, cites =	"am-rsps-93, am-rsss-92, ass-oleia-93, ast-apsgo-94, agps-rss-92, as-nvpt-93, as-tsbac-90, bdsty-arsol-92, bd-olrcu-93, cegs-ablsp-94, cegs-dwclp-93, cegss-cfals-93, cs-agpli-90, cksw-vdl3s-, cs-arscg-89, bds-lric-94, efnn-rauvd-89, es-vda-86, hs-nblet-93, hw-ensrq-87, ht-cws-85, m-apcad-83, ms-rsast-93, m-fppa-90, m-fppa2-91, pt-eplcs-92, hrr-araga-91, s-atubl-93, sa-dsstg-95, ZZZ"
-, update =	"98.03 bibrelex, 97.11 aronov, 96.05 agarwal, 94.09 jones, 94.01 jones"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
+, title =       "Computing Envelopes in Four Dimensions with Applications"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "348--358"
+, precedes =    "aas-cefda-97"
+, cites =       "am-rsps-93, am-rsss-92, ass-oleia-93, ast-apsgo-94, agps-rss-92, as-nvpt-93, as-tsbac-90, bdsty-arsol-92, bd-olrcu-93, cegs-ablsp-94, cegs-dwclp-93, cegss-cfals-93, cs-agpli-90, cksw-vdl3s-, cs-arscg-89, bds-lric-94, efnn-rauvd-89, es-vda-86, hs-nblet-93, hw-ensrq-87, ht-cws-85, m-apcad-83, ms-rsast-93, m-fppa-90, m-fppa2-91, pt-eplcs-92, hrr-araga-91, s-atubl-93, sa-dsstg-95, ZZZ"
+, update =      "98.03 bibrelex, 97.11 aronov, 96.05 agarwal, 94.09 jones, 94.01 jones"
 }
 
 % number = 6
 % month = dec
 @article{aas-cefda-97
-, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
-, title =	"Computing Envelopes in Four Dimensions with Applications"
-, journal =	"SIAM J. Comput."
-, volume =	26
-, year =	1997
-, pages =	"1714--1732"
-, succeeds =	"aas-cefda-94"
-, update =	"98.03 bibrelex, 97.11 aronov, 97.03 agarwal+orourke, 96.05 orourke"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
+, title =       "Computing Envelopes in Four Dimensions with Applications"
+, journal =     "SIAM J. Comput."
+, volume =      26
+, year =        1997
+, pages =       "1714--1732"
+, succeeds =    "aas-cefda-94"
+, update =      "98.03 bibrelex, 97.11 aronov, 97.03 agarwal+orourke, 96.05 orourke"
 }
 
 @inproceedings{aas-eaamw-00
-, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
-, title =	"Exact and approximation algorithms for minimum-width cylindrical shells"
-, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA"
-, year =	2000
-, pages =	"510--517"
-, update =	"00.03 agarwal+devillers"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
+, title =       "Exact and approximation algorithms for minimum-width cylindrical shells"
+, booktitle =   "Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA"
+, year =        2000
+, pages =       "510--517"
+, update =      "00.03 agarwal+devillers"
 }
 
 @article{aas-eaamw-01
-, author =	"P. K. Agarwal and B. Aronov and M. Sharir"
-, title =	"Exact and approximation algorithms for minimum-width cylindrical shells"
-, journal =	"Discrete Comput. Geom."
-, volume =	26
-, year =	2001
-, pages =	"307--320"
-, update =	"01.11 smid"
+, author =      "P. K. Agarwal and B. Aronov and M. Sharir"
+, title =       "Exact and approximation algorithms for minimum-width cylindrical shells"
+, journal =     "Discrete Comput. Geom."
+, volume =      26
+, year =        2001
+, pages =       "307--320"
+, update =      "01.11 smid"
 }
 
 @inproceedings{aas-ltbse-97
-, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
-, title =	"Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1997
-, pages =	"483--492"
-, precedes =	"aas-ltbse-99"
-, update =	"01.11 devillers+smid, 97.07 aronov, 97.03 agarwal+held, 96.09 agarwal, 96.05 agarwal"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
+, title =       "Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1997
+, pages =       "483--492"
+, precedes =    "aas-ltbse-99"
+, update =      "01.11 devillers+smid, 97.07 aronov, 97.03 agarwal+held, 96.09 agarwal, 96.05 agarwal"
 }
 
 @article{aas-ltbse-99
-, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
-, title =	"Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	21
-, year =	1999
-, pages =	"373--388"
-, succeeds =	"aas-ltbse-97"
-, update =	"01.11 devillers"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
+, title =       "Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      21
+, year =        1999
+, pages =       "373--388"
+, succeeds =    "aas-ltbse-97"
+, update =      "01.11 devillers"
 }
 
 @techreport{aas-mpcpp-97
-, author =	"Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
-, title =	"Motion planning for a convex polygon in a polygonal environment"
-, type =	"Tech. Report"
-, number =	"CS-1997-17"
-, institution =	"Department of Computer Science"
-, address =	"Duke University"
-, year =	1997
-, succeeds =	"aaas-lpmpc-97"
-, precedes =	"aas-lpocp-98"
-, update =	"01.04 icking, 98.11 bibrelex, 98.03 agarwal"
-, annote =	"Corrects and supersedes parts of \cite{aaas-lpmpc-97}"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Micha Sharir"
+, title =       "Motion planning for a convex polygon in a polygonal environment"
+, type =        "Tech. Report"
+, number =      "CS-1997-17"
+, institution = "Department of Computer Science"
+, address =     "Duke University"
+, year =        1997
+, succeeds =    "aaas-lpmpc-97"
+, precedes =    "aas-lpocp-98"
+, update =      "01.04 icking, 98.11 bibrelex, 98.03 agarwal"
+, annote =      "Corrects and supersedes parts of \cite{aaas-lpmpc-97}"
 }
 
 @article{aas-mpcpp-99
-, author =	"P. K. Agarwal and B. Aronov and M. Sharir"
-, title =	"Motion planning for a convex polygon in a polygonal environment"
-, journal =	"Discrete Comput. Geom."
-, volume =	22
-, year =	1999
-, pages =	"201--221"
-, update =	"01.11 smid, 98.11 aronov"
+, author =      "P. K. Agarwal and B. Aronov and M. Sharir"
+, title =       "Motion planning for a convex polygon in a polygonal environment"
+, journal =     "Discrete Comput. Geom."
+, volume =      22
+, year =        1999
+, pages =       "201--221"
+, update =      "01.11 smid, 98.11 aronov"
 }
 
 @inproceedings{aass-sdp-90
-, author =	"Pankaj K. Agarwal and B. Aronov and Micha Sharir and Subhash Suri"
-, title =	"Selecting distances in the plane"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"321--331"
-, keywords =	"selection problems, parametric search"
-, precedes =	"aass-sdp-93"
-, cites =	"bo-arcgi-79, bfprt-tbs-73, c-ntcos-85, cl-cpp-86, cegsw-ccbac-90, cs-arscg-89, c-sdsno-87, cv-dctao-86, e-acg-87, egppss-acptc-88, egs-oplms-86, lf-ppc-80, hs-ndssg-86, m-cha-90i, m-apcad-83, m-ptlp-85, ps-cgi-85, s-spcg-87, spp-fm-76, sv-fmmsp-81, tv-epba-85, tv-opatc-89t, v-pcp-75, v-spcs-83, y-cmstk-82, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 96.05 agarwal, 95.05 smid"
+, author =      "Pankaj K. Agarwal and B. Aronov and Micha Sharir and Subhash Suri"
+, title =       "Selecting distances in the plane"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "321--331"
+, keywords =    "selection problems, parametric search"
+, precedes =    "aass-sdp-93"
+, cites =       "bo-arcgi-79, bfprt-tbs-73, c-ntcos-85, cl-cpp-86, cegsw-ccbac-90, cs-arscg-89, c-sdsno-87, cv-dctao-86, e-acg-87, egppss-acptc-88, egs-oplms-86, lf-ppc-80, hs-ndssg-86, m-cha-90i, m-apcad-83, m-ptlp-85, ps-cgi-85, s-spcg-87, spp-fm-76, sv-fmmsp-81, tv-epba-85, tv-opatc-89t, v-pcp-75, v-spcs-83, y-cmstk-82, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 96.05 agarwal, 95.05 smid"
 }
 
 @article{aass-sdp-93
-, author =	"Pankaj K. Agarwal and B. Aronov and Micha Sharir and Subhash Suri"
-, title =	"Selecting distances in the plane"
-, journal =	"Algorithmica"
-, volume =	9
-, year =	1993
-, pages =	"495--514"
-, succeeds =	"aass-sdp-90"
-, update =	"98.03 mitchell, 96.05 agarwal, 94.01 matousek"
+, author =      "Pankaj K. Agarwal and B. Aronov and Micha Sharir and Subhash Suri"
+, title =       "Selecting distances in the plane"
+, journal =     "Algorithmica"
+, volume =      9
+, year =        1993
+, pages =       "495--514"
+, succeeds =    "aass-sdp-90"
+, update =      "98.03 mitchell, 96.05 agarwal, 94.01 matousek"
 }
 
 @inproceedings{aas-stl3d-95
-, author =	"Pankaj K. Agarwal and Boris Aronov and Subhash Suri"
-, title =	"Stabbing Triangulations by Lines in $3$D"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, publisher =	"ACM Press"
-, address =	"New York, NY, USA"
-, month =	jun
-, year =	1995
-, pages =	"267--276"
-, issn =	"0-89791-724-3"
-, keywords =	"ray shooting, contrained triangulation, tetrahedra"
-, cites =	"am-stl3s-95, as-tsbac-90, be-mgot-92i, b-ct-93, c-cpplb-84, ceg-ccc-89, cp-tncp-90, cs-bst-94, cw-qorss-89, dk-fdpi-82, dk-ladsc-85, e-t-91, hs-parss-95, m-ept-92, mms-qsrs-94, o-agta-87, rs-dt3dn-89, w-stlcn-92t, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex, 95.09 mitchell"
+, author =      "Pankaj K. Agarwal and Boris Aronov and Subhash Suri"
+, title =       "Stabbing Triangulations by Lines in $3$D"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, publisher =   "ACM Press"
+, address =     "New York, NY, USA"
+, month =       jun
+, year =        1995
+, pages =       "267--276"
+, issn =        "0-89791-724-3"
+, keywords =    "ray shooting, contrained triangulation, tetrahedra"
+, cites =       "am-stl3s-95, as-tsbac-90, be-mgot-92i, b-ct-93, c-cpplb-84, ceg-ccc-89, cp-tncp-90, cs-bst-94, cw-qorss-89, dk-fdpi-82, dk-ladsc-85, e-t-91, hs-parss-95, m-ept-92, mms-qsrs-94, o-agta-87, rs-dt3dn-89, w-stlcn-92t, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{abghz-dfstk-00
-, author =	"Pankaj K. Agarwal and J. Basch and L. J. Guibas and J. Hershberger and L. Zhang"
-, title =	"Deformable free space tiling for kinetic collision detection"
-, booktitle =	"Proc. 4th Workshop Algorithmic Found. Robot."
-, year =	2000
-, note =	"To appear"
-, update =	"00.03 agarwal"
+, author =      "Pankaj K. Agarwal and J. Basch and L. J. Guibas and J. Hershberger and L. Zhang"
+, title =       "Deformable free space tiling for kinetic collision detection"
+, booktitle =   "Proc. 4th Workshop Algorithmic Found. Robot."
+, year =        2000
+, note =        "To appear"
+, update =      "00.03 agarwal"
 }
 
 @inproceedings{abhs-egkda-96
-, author =	"P. K. Agarwal and M. de Berg and D. Halperin and Micha Sharir"
-, title =	"Efficient generation of {$k$}-directional assembly sequences"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"122--131"
-, keywords =	"depth order, translational motion, rotational motion, assembly planning, stack products, upper envelope searching, maximality"
-, update =	"98.03 mitchell, 96.09 agarwal+orourke, 96.01 mitchell"
+, author =      "P. K. Agarwal and M. de Berg and D. Halperin and Micha Sharir"
+, title =       "Efficient generation of {$k$}-directional assembly sequences"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "122--131"
+, keywords =    "depth order, translational motion, rotational motion, assembly planning, stack products, upper envelope searching, maximality"
+, update =      "98.03 mitchell, 96.09 agarwal+orourke, 96.01 mitchell"
 }
 
 @inproceedings{abms-claho-94
-, author =	"Pankaj K. Agarwal and M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"Constructing Levels in Arrangements and Higher Order {Voronoi} Diagrams"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"67--75"
-, cites =	"as-solri-92, as-pm-92, ass-sulbl-89, bdt-schov-93, ce-iacko-87, c-narsc-87, c-racpq-88, cs-arscg-89, csy-khrp-87, bds-lric-94, e-acg-87, erk-oalla-93, hw-ensrq-87, m-fppa2-91, m-lavd-91, m-cgitr-93, pss-ubnpk-92, s-ksacs-91, ZZZ"
-, update =	"98.11 bibrelex, 98.03 agarwal+bibrelex, 96.09 agarwal, 96.05 agarwal, 95.09 agarwal, 94.09 jones, 94.05 schwarzkopf, 94.01 jones"
+, author =      "Pankaj K. Agarwal and M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "Constructing Levels in Arrangements and Higher Order {Voronoi} Diagrams"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "67--75"
+, cites =       "as-solri-92, as-pm-92, ass-sulbl-89, bdt-schov-93, ce-iacko-87, c-narsc-87, c-racpq-88, cs-arscg-89, csy-khrp-87, bds-lric-94, e-acg-87, erk-oalla-93, hw-ensrq-87, m-fppa2-91, m-lavd-91, m-cgitr-93, pss-ubnpk-92, s-ksacs-91, ZZZ"
+, update =      "98.11 bibrelex, 98.03 agarwal+bibrelex, 96.09 agarwal, 96.05 agarwal, 95.09 agarwal, 94.09 jones, 94.05 schwarzkopf, 94.01 jones"
 }
 
 @article{abms-claho-98
-, author =	"P. K. Agarwal and M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"Constructing Levels in Arrangements and Higher Order {Voronoi} Diagrams"
-, journal =	"SIAM J. Comput."
-, volume =	27
-, year =	1998
-, pages =	"654--667"
-, update =	"98.07 smid, 98.03 agarwal"
+, author =      "P. K. Agarwal and M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "Constructing Levels in Arrangements and Higher Order {Voronoi} Diagrams"
+, journal =     "SIAM J. Comput."
+, volume =      27
+, year =        1998
+, pages =       "654--667"
+, update =      "98.07 smid, 98.03 agarwal"
 }
 
 @inproceedings{abs-osaup-99
-, author =	"Pankaj K. Agarwal and Binay K. Bhattacharya and Sandeep Sen"
-, title =	"Output-Sensitive Algorithms for Uniform Partitions of Points"
-, booktitle =	"Proc. 10th Intl. Sympos. Algorithms and Computation"
-, year =	1999
-, pages =	"??"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Pankaj K. Agarwal and Binay K. Bhattacharya and Sandeep Sen"
+, title =       "Output-Sensitive Algorithms for Uniform Partitions of Points"
+, booktitle =   "Proc. 10th Intl. Sympos. Algorithms and Computation"
+, year =        1999
+, pages =       "??"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{ablrsw-ccspc-98
-, author =	"Pankaj K. Agarwal and Therese Biedl and Sylvain Lazard and Steve Robbins and Subhash Suri and Sue Whitesides"
-, title =	"Curvature-Constrained Shortest Paths in a Convex Polygon"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"to appear"
-, update =	"98.03 mitchell"
+, author =      "Pankaj K. Agarwal and Therese Biedl and Sylvain Lazard and Steve Robbins and Subhash Suri and Sue Whitesides"
+, title =       "Curvature-Constrained Shortest Paths in a Convex Polygon"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "to appear"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{acr-icb-03
@@ -1762,79 +1762,79 @@ @inproceedings{acr-icb-03
 }
 
 @inproceedings{ad-aats-97
-, author =	"Pankaj K. Agarwal and Pavan K. Desikan"
-, title =	"An efficient algorithm for terrain simplification"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1997
-, pages =	"139--147"
-, update =	"01.04 smid, 97.03 agarwal, 96.09 agarwal"
+, author =      "Pankaj K. Agarwal and Pavan K. Desikan"
+, title =       "An efficient algorithm for terrain simplification"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1997
+, pages =       "139--147"
+, update =      "01.04 smid, 97.03 agarwal, 96.09 agarwal"
 }
 
 @inproceedings{ad-aalm-00
-, author =	"Pankaj K. Agarwal and P. K. Desikan"
-, title =	"Approximation algorithms for layered manufacturing"
-, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	2000
-, pages =	"528--537"
-, update =	"00.03 agarwal"
+, author =      "Pankaj K. Agarwal and P. K. Desikan"
+, title =       "Approximation algorithms for layered manufacturing"
+, booktitle =   "Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        2000
+, pages =       "528--537"
+, update =      "00.03 agarwal"
 }
 
 @inproceedings{aesw-emstb-90
-, author =	"Pankaj K. Agarwal and H. Edelsbrunner and O. Schwarzkopf and Emo Welzl"
-, title =	"Euclidean minimum spanning trees and bichromatic closest pairs"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"203--210"
-, succeeds =	"asw-emstb-90"
-, precedes =	"aesw-emstb-91"
-, cites =	"c-fetaa-84, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-oplms-86, es-hipac-90, gbt-srtgp-84, ps-cgi-85, pt-espl-89, s-chaop-81, st-pplup-86, s-lpchm-90, sh-cpp-75, v-famst-84, y-cmstk-82, ZZZ"
-, update =	"01.04 icking, 98.03 mitchell, 97.11 bibrelex, 96.05 agarwal"
+, author =      "Pankaj K. Agarwal and H. Edelsbrunner and O. Schwarzkopf and Emo Welzl"
+, title =       "Euclidean minimum spanning trees and bichromatic closest pairs"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "203--210"
+, succeeds =    "asw-emstb-90"
+, precedes =    "aesw-emstb-91"
+, cites =       "c-fetaa-84, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-oplms-86, es-hipac-90, gbt-srtgp-84, ps-cgi-85, pt-espl-89, s-chaop-81, st-pplup-86, s-lpchm-90, sh-cpp-75, v-famst-84, y-cmstk-82, ZZZ"
+, update =      "01.04 icking, 98.03 mitchell, 97.11 bibrelex, 96.05 agarwal"
 }
 
 @article{aesw-emstb-91
-, author =	"Pankaj K. Agarwal and H. Edelsbrunner and O. Schwarzkopf and Emo Welzl"
-, title =	"Euclidean minimum spanning trees and bichromatic closest pairs"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, number =	5
-, year =	1991
-, pages =	"407--422"
-, keywords =	"proximity, minimum spanning trees, random sampling, geometric graphs, Voronoi diagrams, three-dimensional, closest pairs, red-blue"
-, succeeds =	"aesw-emstb-90"
-, update =	"98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 93.05 schwarzkopf"
+, author =      "Pankaj K. Agarwal and H. Edelsbrunner and O. Schwarzkopf and Emo Welzl"
+, title =       "Euclidean minimum spanning trees and bichromatic closest pairs"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, number =      5
+, year =        1991
+, pages =       "407--422"
+, keywords =    "proximity, minimum spanning trees, random sampling, geometric graphs, Voronoi diagrams, three-dimensional, closest pairs, red-blue"
+, succeeds =    "aesw-emstb-90"
+, update =      "98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 93.05 schwarzkopf"
 }
 
 @inproceedings{aes-vdsl3-95
-, author =	"Pankaj K. Agarwal and Alon Efrat and Micha Sharir"
-, title =	"Vertical Decomposition of Shallow Levels in $3$-Dimensional Arrangements and Its Applications"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"39--50"
-, keywords =	"curved surfaces, range searching, nearest neighbor, segment center, bipartite matching, smallest stabbing disk, parametric search, convex distance functions"
-, cites =	"abms-claho-94, aest-cscpp-93, am-dhsrr-95, am-rsps-93, am-rsss-94, ass-oletd-95, ass-sulbl-89, abkks-emcmu-92, bcm-prsss-93, by-lotmc-94, cegs-sessr-89, c-narsc-87, cs-arscg-89, bgh-vdt3s-94, e-acg-87, es-vda-86, es-nlaps-96, e-demst-95, g-pvc-56, hs-nblet-94, hs-ndssg-86, hw-ensrq-87, ily-sccp-92, ls-pptmc-87, k-hmap-55, l-conm-76, l-tdvdl-80, ld-gvdp-81, ms-fmapp-91, m-aogdc-91, m-rph-92, ms-rscp-93, m-apcad-83, m-cgitr-93, s-atubl-94, sa-dsstg-95, t-mnlcf-92, v-ghm-89, v-pcp-75, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Pankaj K. Agarwal and Alon Efrat and Micha Sharir"
+, title =       "Vertical Decomposition of Shallow Levels in $3$-Dimensional Arrangements and Its Applications"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "39--50"
+, keywords =    "curved surfaces, range searching, nearest neighbor, segment center, bipartite matching, smallest stabbing disk, parametric search, convex distance functions"
+, cites =       "abms-claho-94, aest-cscpp-93, am-dhsrr-95, am-rsps-93, am-rsss-94, ass-oletd-95, ass-sulbl-89, abkks-emcmu-92, bcm-prsss-93, by-lotmc-94, cegs-sessr-89, c-narsc-87, cs-arscg-89, bgh-vdt3s-94, e-acg-87, es-vda-86, es-nlaps-96, e-demst-95, g-pvc-56, hs-nblet-94, hs-ndssg-86, hw-ensrq-87, ily-sccp-92, ls-pptmc-87, k-hmap-55, l-conm-76, l-tdvdl-80, ld-gvdp-81, ms-fmapp-91, m-aogdc-91, m-rph-92, ms-rscp-93, m-apcad-83, m-cgitr-93, s-atubl-94, sa-dsstg-95, t-mnlcf-92, v-ghm-89, v-pcp-75, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{aes-vdsl3-99
-, author =	"P. K. Agarwal and A. Efrat and M. Sharir"
-, title =	"Vertical decomposition of shallow levels in $3$-dimensional arrangements and its applications"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, year =	1999
-, pages =	"912--953"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "P. K. Agarwal and A. Efrat and M. Sharir"
+, title =       "Vertical decomposition of shallow levels in $3$-dimensional arrangements and its applications"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, year =        1999
+, pages =       "912--953"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @techreport{aest-cscpp-91
-, author =	"P. K. Agarwal and A. Efrat and Micha Sharir and S. Toledo"
-, title =	"Computing a segment center for a planar point set"
-, type =	"Manuscript"
-, number =	"DUKE--TR--1991--33"
-, institution =	"Department of Computer Science, Duke University"
-, year =	1991
-, url =	"ftp://ftp.cs.duke.edu/dist/techreport/1991/1991-33.ps.Z"
-, update =	"98.03 bibrelex+mitchell, 97.11 bibrelex"
-, abstract =	"\indent Given a set $S$ of $n$ points in the plane and
+, author =      "P. K. Agarwal and A. Efrat and Micha Sharir and S. Toledo"
+, title =       "Computing a segment center for a planar point set"
+, type =        "Manuscript"
+, number =      "DUKE--TR--1991--33"
+, institution = "Department of Computer Science, Duke University"
+, year =        1991
+, url = "ftp://ftp.cs.duke.edu/dist/techreport/1991/1991-33.ps.Z"
+, update =      "98.03 bibrelex+mitchell, 97.11 bibrelex"
+, abstract =    "\indent Given a set $S$ of $n$ points in the plane and
                  a segment $e$, a {\em center placement} of $e$ is a
                  placement (allowing translation and rotation) that
                  minimizes the maximum distance from $e$ to the points
@@ -1846,4528 +1846,4528 @@ @techreport{aest-cscpp-91
 }
 
 @article{aest-cscpp-93
-, author =	"Pankaj K. Agarwal and A. Efrat and Micha Sharir and S. Toledo"
-, title =	"Computing a Segment Center for a Planar Point Set"
-, journal =	"J. Algorithms"
-, volume =	15
-, number =	2
-, year =	1993
-, pages =	"314--323"
-, keywords =	"points, center, placement"
-, update =	"98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 93.09 efrat"
+, author =      "Pankaj K. Agarwal and A. Efrat and Micha Sharir and S. Toledo"
+, title =       "Computing a Segment Center for a Planar Point Set"
+, journal =     "J. Algorithms"
+, volume =      15
+, number =      2
+, year =        1993
+, pages =       "314--323"
+, keywords =    "points, center, placement"
+, update =      "98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 93.09 efrat"
 }
 
 @inproceedings{aegm-pkmst-98
-, author =	"Pankaj K. Agarwal and D. Eppstein and L. J. Guibas and M. Henzinger"
-, title =	"Parametric and kinetic minimum spanning trees"
-, booktitle =	"Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1998
-, pages =	"596--605"
-, update =	"99.03 agarwal"
+, author =      "Pankaj K. Agarwal and D. Eppstein and L. J. Guibas and M. Henzinger"
+, title =       "Parametric and kinetic minimum spanning trees"
+, booktitle =   "Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1998
+, pages =       "596--605"
+, update =      "99.03 agarwal"
 }
 
 @inproceedings{aem-dhsrg-92
-, author =	"Pankaj K. Agarwal and D. Eppstein and J. Matou{\v s}ek"
-, title =	"Dynamic half-space reporting, geometric optimization, and minimum spanning trees"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"80--89"
-, succeeds =	"am-dhsrr-91"
-, update =	"96.09 agarwal, 96.05 agarwal, 93.09 erickson"
+, author =      "Pankaj K. Agarwal and D. Eppstein and J. Matou{\v s}ek"
+, title =       "Dynamic half-space reporting, geometric optimization, and minimum spanning trees"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "80--89"
+, succeeds =    "am-dhsrr-91"
+, update =      "96.09 agarwal, 96.05 agarwal, 93.09 erickson"
 }
 
 @techreport{ae-rsir-97
-, author =	"Pankaj K. Agarwal and Jeff Erickson"
-, title =	"Geometric range searching and its relatives"
-, type =	"Tech.\ Report"
-, number =	"CS-1997-11"
-, institution =	"Department of Computer Science"
-, address =	"Duke University"
-, year =	1997
-, update =	"98.03 agarwal"
+, author =      "Pankaj K. Agarwal and Jeff Erickson"
+, title =       "Geometric range searching and its relatives"
+, type =        "Tech.\ Report"
+, number =      "CS-1997-11"
+, institution = "Department of Computer Science"
+, address =     "Duke University"
+, year =        1997
+, update =      "98.03 agarwal"
 }
 
 @incollection{ae-rsir-99
-, author =	"Pankaj K. Agarwal and Jeff Erickson"
-, title =	"Geometric range searching and its relatives"
-, editor =	"B. Chazelle and J. E. Goodman and R. Pollack"
-, booktitle =	"Advances in Discrete and Computational Geometry"
-, series =	"Contemporary Mathematics"
-, volume =	223
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1999
-, pages =	"1--56"
-, update =	"00.03 smid, 98.07 agarwal"
+, author =      "Pankaj K. Agarwal and Jeff Erickson"
+, title =       "Geometric range searching and its relatives"
+, editor =      "B. Chazelle and J. E. Goodman and R. Pollack"
+, booktitle =   "Advances in Discrete and Computational Geometry"
+, series =      "Contemporary Mathematics"
+, volume =      223
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1999
+, pages =       "1--56"
+, update =      "00.03 smid, 98.07 agarwal"
 }
 
 @unpublished{aeg-kbspr-97
-, author =	"P. K. Agarwal and J. Erickson and L. J. Guibas"
-, title =	"Kinetic binary space partitions in {$R^{3}$}"
-, year =	1997
-, note =	"In preparation"
-, update =	"98.07 bibrelex+mitchell"
+, author =      "P. K. Agarwal and J. Erickson and L. J. Guibas"
+, title =       "Kinetic binary space partitions in {$R^{3}$}"
+, year =        1997
+, note =        "In preparation"
+, update =      "98.07 bibrelex+mitchell"
 }
 
 @inproceedings{aeg-kbisd-98
-, author =	"Pankaj K. Agarwal and Jeff Erickson and Leonidas J. Guibas"
-, title =	"Kinetic {BSP}s for Intersecting Segments and Disjoint Triangles"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"107--116"
-, update =	"98.07 bibrelex, 98.03 agarwal"
+, author =      "Pankaj K. Agarwal and Jeff Erickson and Leonidas J. Guibas"
+, title =       "Kinetic {BSP}s for Intersecting Segments and Disjoint Triangles"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "107--116"
+, update =      "98.07 bibrelex, 98.03 agarwal"
 }
 
 @techreport{agkptv-argc-95
-, author =	"P. K. Agarwal and M. T. Goodrich and S. R. Kosaraju and F. P. Preparata and R. Tamassia and J. S. Vitter"
-, title =	"Applicable and Robust Geometric Computing"
-, type =	"Project Proposal (U. S. Army Research Office grant DAAH04-96-1-0013)"
-, institution =	"Center for Geometric Computing"
-, year =	1995
-, url =	"https://www.cs.brown.edu/cgc/"
-, update =	"98.07 bibrelex, 97.03 tamassia"
+, author =      "P. K. Agarwal and M. T. Goodrich and S. R. Kosaraju and F. P. Preparata and R. Tamassia and J. S. Vitter"
+, title =       "Applicable and Robust Geometric Computing"
+, type =        "Project Proposal (U. S. Army Research Office grant DAAH04-96-1-0013)"
+, institution = "Center for Geometric Computing"
+, year =        1995
+, url = "https://www.cs.brown.edu/cgc/"
+, update =      "98.07 bibrelex, 97.03 tamassia"
 }
 
 @inproceedings{agmv-bspfr-96
-, author =	"P. K. Agarwal and E. F. Grove and T. M. Murali and J. S. Vitter"
-, title =	"Binary Space Partitions for Fat Rectangles"
-, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
-, site =	"Burlington, VT"
-, month =	oct
-, year =	1996
-, pages =	"482--491"
-, update =	"98.07 bibrelex, 98.03 agarwal, 97.07 smid, 97.03 murali"
+, author =      "P. K. Agarwal and E. F. Grove and T. M. Murali and J. S. Vitter"
+, title =       "Binary Space Partitions for Fat Rectangles"
+, booktitle =   "Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
+, site =        "Burlington, VT"
+, month =       oct
+, year =        1996
+, pages =       "482--491"
+, update =      "98.07 bibrelex, 98.03 agarwal, 97.07 smid, 97.03 murali"
 }
 
 @article{agmv-bspfr-00
-, author =	"P. K. Agarwal and E. F. Grove and T. M. Murali and J. S. Vitter"
-, title =	"Binary Space Partitions for Fat Rectangles"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, year =	2000
-, pages =	"1422--1448"
-, update =	"00.11 smid"
+, author =      "P. K. Agarwal and E. F. Grove and T. M. Murali and J. S. Vitter"
+, title =       "Binary Space Partitions for Fat Rectangles"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, year =        2000
+, pages =       "1422--1448"
+, update =      "00.11 smid"
 }
 
 @techreport{agps-rss-92
-, author =	"P. K. Agarwal and L. Guibas and M. Pellegrini and M. Sharir"
-, title =	"Ray shooting among spheres"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1992
-, update =	"98.07 agarwal, 98.03 bibrelex"
+, author =      "P. K. Agarwal and L. Guibas and M. Pellegrini and M. Sharir"
+, title =       "Ray shooting among spheres"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1992
+, update =      "98.07 agarwal, 98.03 bibrelex"
 }
 
 @inproceedings{aghrs-cpdtc-00
-, author =	"Pankaj K. Agarwal and L. J. Guibas and S. Har-Peled and A. Rabinovitch and M. Sharir"
-, title =	"Computing the Penetration Depth of Two Convex Polytopes in 3D"
-, booktitle =	"Proc. 7th Scandanavian Workshop on Algorithmic Theory"
-, year =	2000
-, pages =	"??"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Pankaj K. Agarwal and L. J. Guibas and S. Har-Peled and A. Rabinovitch and M. Sharir"
+, title =       "Computing the Penetration Depth of Two Convex Polytopes in 3D"
+, booktitle =   "Proc. 7th Scandanavian Workshop on Algorithmic Theory"
+, year =        2000
+, pages =       "??"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{aghv-memps-97
-, author =	"Pankaj K. Agarwal and Leonidas J. Guibas and John Hershberger and Eric Veach"
-, title =	"Maintaining the extent of a moving point set"
-, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
-, nickname =	"WADS '97"
-, site =	"Halifax, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1272
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"31--44"
-, update =	"99.07 bibrelex, 98.03 agarwal"
+, author =      "Pankaj K. Agarwal and Leonidas J. Guibas and John Hershberger and Eric Veach"
+, title =       "Maintaining the extent of a moving point set"
+, booktitle =   "Proc. 5th Workshop Algorithms Data Struct."
+, nickname =    "WADS '97"
+, site =        "Halifax, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1272
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "31--44"
+, update =      "99.07 bibrelex, 98.03 agarwal"
 }
 
 @inproceedings{agmv-cskbs-97
-, author =	"Pankaj K. Agarwal and Leonidas J. Guibas and T. M. Murali and Jeffrey Scott Vitter"
-, title =	"Cylindrical Static and Kinetic Binary Space Partitions"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"39--48"
-, cites =	"aeg-kbspr-97, agmv-bspfr-96, as-sagp-94, a-iurbw-90, b-mpbsp-93, bgh-dsmd-97, c-mgdii-91, csm-nocpt-95, cgl-pgd-85, cf-nrtsg-89, cf-fopsg-92, c-sc3di-96, cs-arscg-89, b-lsbsp-95, e-acg-87, fkn-vsgpt-80, hw-ensrq-87, mm-aagtn-95, mf-csbra-97, nat-mbtyp-90, nt-abtrt-86, n-sismt-90, n-isgpt-92, py-ebsph-90, py-obspo-92, sbgs-sacgi-69, s-barga-93, t-vcdop-92, tn-sopub-87, t-obspa-90, ZZZ"
-, update =	"98.07 bibrelex, 97.07 agarwal+efrat"
+, author =      "Pankaj K. Agarwal and Leonidas J. Guibas and T. M. Murali and Jeffrey Scott Vitter"
+, title =       "Cylindrical Static and Kinetic Binary Space Partitions"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "39--48"
+, cites =       "aeg-kbspr-97, agmv-bspfr-96, as-sagp-94, a-iurbw-90, b-mpbsp-93, bgh-dsmd-97, c-mgdii-91, csm-nocpt-95, cgl-pgd-85, cf-nrtsg-89, cf-fopsg-92, c-sc3di-96, cs-arscg-89, b-lsbsp-95, e-acg-87, fkn-vsgpt-80, hw-ensrq-87, mm-aagtn-95, mf-csbra-97, nat-mbtyp-90, nt-abtrt-86, n-sismt-90, n-isgpt-92, py-ebsph-90, py-obspo-92, sbgs-sacgi-69, s-barga-93, t-vcdop-92, tn-sopub-87, t-obspa-90, ZZZ"
+, update =      "98.07 bibrelex, 97.07 agarwal+efrat"
 }
 
 @inproceedings{ahk-caspc-00
-, author =	"Pankaj K. Agarwal and S. Har-Peled and M. Karia"
-, title =	"Computing approximate shortest paths on convex polytopes"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"270--279"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Pankaj K. Agarwal and S. Har-Peled and M. Karia"
+, title =       "Computing approximate shortest paths on convex polytopes"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "270--279"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @techreport{ahsv-aspcp-96
-, author =	"Pankaj K. Agarwal and Sariel Har-Peled and Micha Sharir and Kasturi R. Varadarajan"
-, title =	"Approximate Shortest Paths on a Convex Polytope in Three Dimensions"
-, type =	"Report"
-, number =	"CS-1996-12"
-, institution =	"Dept. Comput. Sci., Duke Univ."
-, address =	"Durham, NC"
-, year =	1996
-, precedes =	"ahsv-aspcp-97"
-, update =	"98.03 mitchell, 96.09 agarwal"
+, author =      "Pankaj K. Agarwal and Sariel Har-Peled and Micha Sharir and Kasturi R. Varadarajan"
+, title =       "Approximate Shortest Paths on a Convex Polytope in Three Dimensions"
+, type =        "Report"
+, number =      "CS-1996-12"
+, institution = "Dept. Comput. Sci., Duke Univ."
+, address =     "Durham, NC"
+, year =        1996
+, precedes =    "ahsv-aspcp-97"
+, update =      "98.03 mitchell, 96.09 agarwal"
 }
 
 @article{ahsv-aspcp-97
-, author =	"P. K. Agarwal and S. Har-Peled and M. Sharir and K. R. Varadarajan"
-, title =	"Approximate Shortest Paths on a Convex Polytope in Three Dimensions"
-, journal =	"J. ACM"
-, volume =	44
-, year =	1997
-, pages =	"567--584"
-, succeeds =	"ahsv-aspcp-96"
-, update =	"98.03 mitchell"
+, author =      "P. K. Agarwal and S. Har-Peled and M. Sharir and K. R. Varadarajan"
+, title =       "Approximate Shortest Paths on a Convex Polytope in Three Dimensions"
+, journal =     "J. ACM"
+, volume =      44
+, year =        1997
+, pages =       "567--584"
+, succeeds =    "ahsv-aspcp-96"
+, update =      "98.03 mitchell"
 }
 
 @article{aks-cdofo-95
-, author =	"Pankaj K. Agarwal and M. Katz and Micha Sharir"
-, title =	"Computing depth orders for fat objects and related problems"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"187--206"
-, succeeds =	"aks-cdorp-94"
-, update =	"98.07 agarwal, 98.03 mitchell, 96.09 devillers"
+, author =      "Pankaj K. Agarwal and M. Katz and Micha Sharir"
+, title =       "Computing depth orders for fat objects and related problems"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "187--206"
+, succeeds =    "aks-cdorp-94"
+, update =      "98.07 agarwal, 98.03 mitchell, 96.09 devillers"
 }
 
 @inproceedings{aks-cdorp-94
-, author =	"Pankaj K. Agarwal and M. J. Katz and Micha Sharir"
-, title =	"Computing depth orders and related problems"
-, booktitle =	"Proc. 4th Scand. Workshop Algorithm Theory"
-, year =	1994
-, pages =	"1--12"
-, precedes =	"aks-cdorp-95"
-, update =	"98.03 mitchell, 97.11 katz, 96.09 devillers, 96.05 agarwal, 95.09 agarwal"
+, author =      "Pankaj K. Agarwal and M. J. Katz and Micha Sharir"
+, title =       "Computing depth orders and related problems"
+, booktitle =   "Proc. 4th Scand. Workshop Algorithm Theory"
+, year =        1994
+, pages =       "1--12"
+, precedes =    "aks-cdorp-95"
+, update =      "98.03 mitchell, 97.11 katz, 96.09 devillers, 96.05 agarwal, 95.09 agarwal"
 }
 
 @article{aks-cdorp-95
-, author =	"Pankaj K. Agarwal and M. J. Katz and Micha Sharir"
-, title =	"Computing depth orders and related problems"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"187--206"
-, succeeds =	"aks-cdorp-94"
-, update =	"98.03 mitchell, 97.11 katz, 97.03 agarwal"
+, author =      "Pankaj K. Agarwal and M. J. Katz and Micha Sharir"
+, title =       "Computing depth orders and related problems"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "187--206"
+, succeeds =    "aks-cdorp-94"
+, update =      "98.03 mitchell, 97.11 katz, 97.03 agarwal"
 }
 
 @book{akm-rap-98
-, title =	"Robotics: The Algorithmic Perspective"
-, editor =	"Pankaj K. Agarwal and L. E. Kavraki and M. T. Mason"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley"
-, year =	1998
-, update =	"99.03 agarwal"
+, title =       "Robotics: The Algorithmic Perspective"
+, editor =      "Pankaj K. Agarwal and L. E. Kavraki and M. T. Mason"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley"
+, year =        1998
+, update =      "99.03 agarwal"
 }
 
 @inproceedings{akksw-seahq-99
-, author =	"Pankaj K. Agarwal and Lars Knipping and Marc van Kreveld and Tycho Strijk and Alexander Wolf"
-, title =	"A Simple and Efficient Algorithm for High-Quality Line Labeling"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"93--96"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Pankaj K. Agarwal and Lars Knipping and Marc van Kreveld and Tycho Strijk and Alexander Wolf"
+, title =       "A Simple and Efficient Algorithm for High-Quality Line Labeling"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "93--96"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{ak-ccspi-93
-, author =	"Pankaj K. Agarwal and Marc van Kreveld"
-, title =	"Connected Component and Simple Polygon Intersection Searching"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"36--47"
-, update =	"93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "Pankaj K. Agarwal and Marc van Kreveld"
+, title =       "Connected Component and Simple Polygon Intersection Searching"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "36--47"
+, update =      "93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @techreport{ak-iplal-92t
-, author =	"Pankaj K. Agarwal and M. van Kreveld"
-, title =	"Implicit point location in arrangements of line segments, with an application to motion planning"
-, type =	"Report"
-, number =	"RUU-CS-92-15"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1992
-, precedes =	"ak-iplal-92i"
-, update =	"98.11 bibrelex, 96.05 agarwal, 94.05 schwarzkopf"
+, author =      "Pankaj K. Agarwal and M. van Kreveld"
+, title =       "Implicit point location in arrangements of line segments, with an application to motion planning"
+, type =        "Report"
+, number =      "RUU-CS-92-15"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1992
+, precedes =    "ak-iplal-92i"
+, update =      "98.11 bibrelex, 96.05 agarwal, 94.05 schwarzkopf"
 }
 
 @inproceedings{ak-iplal-92i
-, author =	"Pankaj K. Agarwal and M. van Kreveld"
-, title =	"Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning"
-, booktitle =	"Proc. 12th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, site =	"New Delhi, India"
-, year =	1992
-, succeeds =	"ak-iplal-92t"
-, update =	"98.11 bibrelex, 96.05 agarwal, 93.09 milone+mitchell"
+, author =      "Pankaj K. Agarwal and M. van Kreveld"
+, title =       "Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning"
+, booktitle =   "Proc. 12th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, site =        "New Delhi, India"
+, year =        1992
+, succeeds =    "ak-iplal-92t"
+, update =      "98.11 bibrelex, 96.05 agarwal, 93.09 milone+mitchell"
 }
 
 @article{ak-iplal-94
-, author =	"Pankaj K. Agarwal and M. van Kreveld"
-, title =	"Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"369--383"
-, keywords =	"point location, motion planning, arrangements"
-, update =	"97.03 schwarzkopf, 96.05 agarwal, 95.05 agarwal"
+, author =      "Pankaj K. Agarwal and M. van Kreveld"
+, title =       "Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "369--383"
+, keywords =    "point location, motion planning, arrangements"
+, update =      "97.03 schwarzkopf, 96.05 agarwal, 95.05 agarwal"
 }
 
 @article{ak-pccis-96
-, author =	"Pankaj K. Agarwal and Marc van Kreveld"
-, title =	"Polygon and connected component intersection searching"
-, journal =	"Algorithmica"
-, volume =	15
-, year =	1996
-, pages =	"626--660"
-, update =	"97.07 agarwal+smid"
+, author =      "Pankaj K. Agarwal and Marc van Kreveld"
+, title =       "Polygon and connected component intersection searching"
+, journal =     "Algorithmica"
+, volume =      15
+, year =        1996
+, pages =       "626--660"
+, update =      "97.07 agarwal+smid"
 }
 
 @techreport{ako-iqco-90
-, author =	"Pankaj K. Agarwal and M. van Kreveld and M. Overmars"
-, title =	"Intersection queries for curved objects"
-, type =	"Manuscript"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "Pankaj K. Agarwal and M. van Kreveld and M. Overmars"
+, title =       "Intersection queries for curved objects"
+, type =        "Manuscript"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ako-iqco-91
-, author =	"Pankaj K. Agarwal and M. van Kreveld and M. Overmars"
-, title =	"Intersection queries for curved objects"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"41--50"
-, keywords =	"range searching, partition trees, intersection"
-, precedes =	"ako-iqco-93"
-, cites =	"a-rsoas-89, a-dapal-89, ako-iqco-90, ass-sulbl-89, ahl-sqrpc-90, c-fsnaq-86, ceggss-rspug-90, cg-fc1ds-86, cg-fc2a-86, csw-qoubs-90, cw-qorss-89, de-ssio-87, dsst-mdsp-89, e-acg-87, ew-hrsls-86, gos-rsipl-89, hw-ensrq-87, koa-iqsd-90i, m-mcast-90, mw-gscpt-89, oss-slspt-90, s-ksacs-91, w-pr-82, ydep-psrq-89, ZZZ"
-, update =	"97.11 bibrelex, 96.05 agarwal, 95.05 korneenko, 94.05 devillers"
+, author =      "Pankaj K. Agarwal and M. van Kreveld and M. Overmars"
+, title =       "Intersection queries for curved objects"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "41--50"
+, keywords =    "range searching, partition trees, intersection"
+, precedes =    "ako-iqco-93"
+, cites =       "a-rsoas-89, a-dapal-89, ako-iqco-90, ass-sulbl-89, ahl-sqrpc-90, c-fsnaq-86, ceggss-rspug-90, cg-fc1ds-86, cg-fc2a-86, csw-qoubs-90, cw-qorss-89, de-ssio-87, dsst-mdsp-89, e-acg-87, ew-hrsls-86, gos-rsipl-89, hw-ensrq-87, koa-iqsd-90i, m-mcast-90, mw-gscpt-89, oss-slspt-90, s-ksacs-91, w-pr-82, ydep-psrq-89, ZZZ"
+, update =      "97.11 bibrelex, 96.05 agarwal, 95.05 korneenko, 94.05 devillers"
 }
 
 @article{ako-iqco-93
-, author =	"Pankaj K. Agarwal and M. van Kreveld and M. Overmars"
-, title =	"Intersection queries in curved objects"
-, journal =	"J. Algorithms"
-, volume =	15
-, number =	2
-, year =	1993
-, pages =	"229--266"
-, keywords =	"intersection, searching, curvilinear, ray shooting, partition trees, geometric transformations"
-, succeeds =	"ako-iqco-91"
-, update =	"96.05 agarwal, 95.05 korneenko, 94.01 smid"
+, author =      "Pankaj K. Agarwal and M. van Kreveld and M. Overmars"
+, title =       "Intersection queries in curved objects"
+, journal =     "J. Algorithms"
+, volume =      15
+, number =      2
+, year =        1993
+, pages =       "229--266"
+, keywords =    "intersection, searching, curvilinear, ray shooting, partition trees, geometric transformations"
+, succeeds =    "ako-iqco-91"
+, update =      "96.05 agarwal, 95.05 korneenko, 94.01 smid"
 }
 
 @inproceedings{aks-lpmis-97
-, author =	"Pankaj K. Agarwal and Mark van Kreveld and Subhash Suri"
-, title =	"Label Placement by Maximum Independent Set in Rectangles"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"233--238"
-, update =	"97.11 jones"
+, author =      "Pankaj K. Agarwal and Mark van Kreveld and Subhash Suri"
+, title =       "Label Placement by Maximum Independent Set in Rectangles"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "233--238"
+, update =      "97.11 jones"
 }
 
 @inproceedings{almr-npppd-97
-, author =	"P. K. Agarwal and J.-C. Latombe and R. Motwani and P. Raghavan"
-, title =	"Nonholonomic path planning for pushing a disk among obstacles"
-, booktitle =	"Intl. Conf. Robotics and Auto."
-, year =	1997
-, update =	"97.03 agarwal"
+, author =      "P. K. Agarwal and J.-C. Latombe and R. Motwani and P. Raghavan"
+, title =       "Nonholonomic path planning for pushing a disk among obstacles"
+, booktitle =   "Intl. Conf. Robotics and Auto."
+, year =        1997
+, update =      "97.03 agarwal"
 }
 
 @techreport{am-dhsrr-91
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
-, title =	"Dynamic Half-Space Range Reporting and Its Applications"
-, type =	"Tech. {Report}"
-, number =	"CS-1991-43"
-, institution =	"Duke University"
-, year =	1991
-, precedes =	"aem-dhsrg-92"
-, update =	"98.07 bibrelex, 96.05 agarwal, 93.09 erickson"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek"
+, title =       "Dynamic Half-Space Range Reporting and Its Applications"
+, type =        "Tech. {Report}"
+, number =      "CS-1991-43"
+, institution = "Duke University"
+, year =        1991
+, precedes =    "aem-dhsrg-92"
+, update =      "98.07 bibrelex, 96.05 agarwal, 93.09 erickson"
 }
 
 @article{am-dhsrr-95
-, author =	"P. K. Agarwal and J. Matou{\v s}ek"
-, title =	"Dynamic Half-Space Range Reporting and Its Applications"
-, journal =	"Algorithmica"
-, volume =	13
-, year =	1995
-, pages =	"325--345"
-, keywords =	"arrangements, cuttings, range-searching, dynamization"
-, update =	"96.09 agarwal, 96.05 pascucci"
+, author =      "P. K. Agarwal and J. Matou{\v s}ek"
+, title =       "Dynamic Half-Space Range Reporting and Its Applications"
+, journal =     "Algorithmica"
+, volume =      13
+, year =        1995
+, pages =       "325--345"
+, keywords =    "arrangements, cuttings, range-searching, dynamization"
+, update =      "96.09 agarwal, 96.05 pascucci"
 }
 
 @inproceedings{am-rsss-92
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
-, title =	"On range searching with semialgebraic sets"
-, booktitle =	"Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	629
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"1--13"
-, keywords =	"range search, partition tree, cutting, algebraic surface, semialgebraic set, Tarski cell"
-, precedes =	"am-rsss-94"
-, update =	"96.05 agarwal, 95.05 smid, 93.09 matousek"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek"
+, title =       "On range searching with semialgebraic sets"
+, booktitle =   "Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      629
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "1--13"
+, keywords =    "range search, partition tree, cutting, algebraic surface, semialgebraic set, Tarski cell"
+, precedes =    "am-rsss-94"
+, update =      "96.05 agarwal, 95.05 smid, 93.09 matousek"
 }
 
 @article{am-rsss-94
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
-, title =	"On range searching with semialgebraic sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	11
-, year =	1994
-, pages =	"393--418"
-, succeeds =	"am-rsss-92"
-, update =	"96.05 agarwal, 95.01 matousek"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek"
+, title =       "On range searching with semialgebraic sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      11
+, year =        1994
+, pages =       "393--418"
+, succeeds =    "am-rsss-92"
+, update =      "96.05 agarwal, 95.01 matousek"
 }
 
 @techreport{am-rsps-91
-, author =	"P. K. Agarwal and J. Matou{\v s}ek"
-, title =	"Ray shooting and parametric search"
-, type =	"Technical {Report}"
-, number =	"CS-1991-22"
-, institution =	"Dept. Comput. Sci., Duke Univ."
-, address =	"Durham, NC"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "P. K. Agarwal and J. Matou{\v s}ek"
+, title =       "Ray shooting and parametric search"
+, type =        "Technical {Report}"
+, number =      "CS-1991-22"
+, institution = "Dept. Comput. Sci., Duke Univ."
+, address =     "Durham, NC"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{am-rsps-92
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
-, title =	"Ray shooting and parametric search"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"517--526"
-, keywords =	"ray tracing, range search, intersection, partition trees"
-, update =	"96.09 agarwal, 96.05 agarwal"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek"
+, title =       "Ray shooting and parametric search"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "517--526"
+, keywords =    "ray tracing, range search, intersection, partition trees"
+, update =      "96.09 agarwal, 96.05 agarwal"
 }
 
 @article{am-rsps-93
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
-, title =	"Ray shooting and parametric search"
-, journal =	"SIAM J. Comput."
-, volume =	22
-, number =	4
-, year =	1993
-, pages =	"794--806"
-, succeeds =	"am-rsps-92"
-, update =	"97.11 bibrelex"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek"
+, title =       "Ray shooting and parametric search"
+, journal =     "SIAM J. Comput."
+, volume =      22
+, number =      4
+, year =        1993
+, pages =       "794--806"
+, succeeds =    "am-rsps-92"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{am-rng3d-91
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
-, title =	"Relative neighborhood graphs in $3$-d"
-, type =	"Report"
-, number =	"CS-1991-19"
-, institution =	"Dept. Comput. Sci., Duke Univ."
-, address =	"Durham, NC"
-, year =	1991
-, keywords =	"pattern recognition, geometric graphs"
-, precedes =	"am-rngtd-92i"
-, update =	"96.09 agarwal, 96.05 agarwal, 95.01 smid"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek"
+, title =       "Relative neighborhood graphs in $3$-d"
+, type =        "Report"
+, number =      "CS-1991-19"
+, institution = "Dept. Comput. Sci., Duke Univ."
+, address =     "Durham, NC"
+, year =        1991
+, keywords =    "pattern recognition, geometric graphs"
+, precedes =    "am-rngtd-92i"
+, update =      "96.09 agarwal, 96.05 agarwal, 95.01 smid"
 }
 
 @inproceedings{am-rngtd-92i
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
-, title =	"Relative neighborhood graphs in three dimensions"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"58--65"
-, keywords =	"pattern recognition, geometric graphs"
-, succeeds =	"am-rng3d-91"
-, precedes =	"am-rngtd-92a"
-, update =	"96.09 agarwal, 96.05 agarwal"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek"
+, title =       "Relative neighborhood graphs in three dimensions"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "58--65"
+, keywords =    "pattern recognition, geometric graphs"
+, succeeds =    "am-rng3d-91"
+, precedes =    "am-rngtd-92a"
+, update =      "96.09 agarwal, 96.05 agarwal"
 }
 
 @article{am-rngtd-92a
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek"
-, title =	"Relative neighborhood graphs in three dimensions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	1
-, year =	1992
-, pages =	"1--14"
-, keywords =	"pattern matching, geometric graphs, arrangements, random sampling, closest pairs"
-, succeeds =	"am-rngtd-92i"
-, update =	"96.09 agarwal, 96.05 agarwal, 95.05 korneenko"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek"
+, title =       "Relative neighborhood graphs in three dimensions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      1
+, year =        1992
+, pages =       "1--14"
+, keywords =    "pattern matching, geometric graphs, arrangements, random sampling, closest pairs"
+, succeeds =    "am-rngtd-92i"
+, update =      "96.09 agarwal, 96.05 agarwal, 95.05 korneenko"
 }
 
 @inproceedings{ams-cmfal-94
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"Computing Many Faces in Arrangements of Lines and Segments"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"76--84"
-, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-39.ps.gz"
-, precedes =	"ams-cmfal-98"
-, cites =	"a-pal2a-90, aegs-nemfl-92, bds-lric-94, c-talp-69, cegghss-rspug-91, cegss-cfals-93, cf-dvrsi-90, c-csfas-90, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-ccmfa-90, ew-mnemf-86, gs-caa-93, hs-parss-93, hw-ensrq-87, m-mdscg-84, m-fppa-90, m-fppa2-91, st-epdg-83, ZZZ"
-, update =	"98.07 mitchell, 98.03 bibrelex, 96.09 agarwal, 96.05 agarwal, 95.09 agarwal, 94.09 jones, 94.01 jones"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "Computing Many Faces in Arrangements of Lines and Segments"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "76--84"
+, url = "ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-39.ps.gz"
+, precedes =    "ams-cmfal-98"
+, cites =       "a-pal2a-90, aegs-nemfl-92, bds-lric-94, c-talp-69, cegghss-rspug-91, cegss-cfals-93, cf-dvrsi-90, c-csfas-90, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-ccmfa-90, ew-mnemf-86, gs-caa-93, hs-parss-93, hw-ensrq-87, m-mdscg-84, m-fppa-90, m-fppa2-91, st-epdg-83, ZZZ"
+, update =      "98.07 mitchell, 98.03 bibrelex, 96.09 agarwal, 96.05 agarwal, 95.09 agarwal, 94.09 jones, 94.01 jones"
 }
 
 @article{ams-cmfal-98
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"Computing Many Faces in Arrangements of Lines and Segments"
-, journal =	"SIAM J. Comput."
-, volume =	27
-, number =	2
-, year =	1998
-, pages =	"491--505"
-, succeeds =	"ams-cmfal-94"
-, update =	"98.07 bibrelex+mitchell, 98.03 agarwal"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "Computing Many Faces in Arrangements of Lines and Segments"
+, journal =     "SIAM J. Comput."
+, volume =      27
+, number =      2
+, year =        1998
+, pages =       "491--505"
+, succeeds =    "ams-cmfal-94"
+, update =      "98.07 bibrelex+mitchell, 98.03 agarwal"
 }
 
 @inproceedings{ams-fnmst-91
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek and Subhash Suri"
-, title =	"Farthest neighbors, maximum spanning trees and related problems in higher dimensions"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"105--116"
-, precedes =	"ams-fnmst-92"
-, update =	"98.03 mitchell, 96.09 agarwal, 96.05 agarwal"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek and Subhash Suri"
+, title =       "Farthest neighbors, maximum spanning trees and related problems in higher dimensions"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "105--116"
+, precedes =    "ams-fnmst-92"
+, update =      "98.03 mitchell, 96.09 agarwal, 96.05 agarwal"
 }
 
 @article{ams-fnmst-92
-, author =	"Pankaj K. Agarwal and J. Matou{\v s}ek and Subhash Suri"
-, title =	"Farthest neighbors, maximum spanning trees and related problems in higher dimensions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, number =	4
-, year =	1992
-, pages =	"189--201"
-, keywords =	"proximity, partition, maximal spanning tree, minimal spanning tree, $d$-dimensional, furthest neighbors, approximation, bichromatic"
-, succeeds =	"ams-fnmst-91"
-, update =	"98.03 mitchell, 96.09 agarwal, 96.05 agarwal+pascucci, 95.05 korneenko"
+, author =      "Pankaj K. Agarwal and J. Matou{\v s}ek and Subhash Suri"
+, title =       "Farthest neighbors, maximum spanning trees and related problems in higher dimensions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, number =      4
+, year =        1992
+, pages =       "189--201"
+, keywords =    "proximity, partition, maximal spanning tree, minimal spanning tree, $d$-dimensional, furthest neighbors, approximation, bichromatic"
+, succeeds =    "ams-fnmst-91"
+, update =      "98.03 mitchell, 96.09 agarwal, 96.05 agarwal+pascucci, 95.05 korneenko"
 }
 
 @inproceedings{amv-nacbs-98
-, author =	"Pankaj K. Agarwal and T. Murali and J. Vitter"
-, title =	"A new algorithm for constructing binary space partitions for orthogonal rectangles"
-, booktitle =	"Proc. European Sympos. Algortihms"
-, year =	1998
-, update =	"99.03 agarwal"
+, author =      "Pankaj K. Agarwal and T. Murali and J. Vitter"
+, title =       "A new algorithm for constructing binary space partitions for orthogonal rectangles"
+, booktitle =   "Proc. European Sympos. Algortihms"
+, year =        1998
+, update =      "99.03 agarwal"
 }
 
 @inproceedings{amv-ptcbs-97
-, author =	"Pankaj K. Agarwal and T. Murali and J. Vitter"
-, title =	"Practical techniques for constructing binary space partitions for orthogonal rectangles"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"382--384"
-, cites =	"agmv-bspfr-96, a-iurbw-90, fkn-vsgpt-80, py-obspo-92, sbgs-sacgi-69, t-vcdop-92, tn-sopub-87, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "Pankaj K. Agarwal and T. Murali and J. Vitter"
+, title =       "Practical techniques for constructing binary space partitions for orthogonal rectangles"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "382--384"
+, cites =       "agmv-bspfr-96, a-iurbw-90, fkn-vsgpt-80, py-obspo-92, sbgs-sacgi-69, t-vcdop-92, tn-sopub-87, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @article{aps-ccai-93
-, author =	"Pankaj K. Agarwal and M. Pellegrini and Micha Sharir"
-, title =	"Counting circular arc intersections"
-, journal =	"SIAM J. Comput."
-, volume =	22
-, number =	4
-, year =	1993
-, pages =	"778--793"
-, keywords =	"intersection, counting, circles, circular arc arrangement, point location, random sampling, partition trees, geometric transformations"
-, succeeds =	"as-ccai-91"
-, update =	"98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 94.01 matousek"
+, author =      "Pankaj K. Agarwal and M. Pellegrini and Micha Sharir"
+, title =       "Counting circular arc intersections"
+, journal =     "SIAM J. Comput."
+, volume =      22
+, number =      4
+, year =        1993
+, pages =       "778--793"
+, keywords =    "intersection, counting, circles, circular arc arrangement, point location, random sampling, partition trees, geometric transformations"
+, succeeds =    "as-ccai-91"
+, update =      "98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 94.01 matousek"
 }
 
 @inproceedings{ap-aapc-00
-, author =	"Pankaj K. Agarwal and Cecilia M. Procopiuc"
-, title =	"Approximation Algorithms for Projective Clustering"
-, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	2000
-, pages =	"538--547"
-, update =	"00.03 agarwal"
+, author =      "Pankaj K. Agarwal and Cecilia M. Procopiuc"
+, title =       "Approximation Algorithms for Projective Clustering"
+, booktitle =   "Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        2000
+, pages =       "538--547"
+, update =      "00.03 agarwal"
 }
 
 @inproceedings{ap-eaac-98
-, author =	"Pankaj K. Agarwal and Cecilia M. Procopiuc"
-, title =	"Exact and Approximation Algorithms for Clustering"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"658--667"
-, update =	"99.07 bibrelex, 98.07 mitchell, 98.03 agarwal"
+, author =      "Pankaj K. Agarwal and Cecilia M. Procopiuc"
+, title =       "Exact and Approximation Algorithms for Clustering"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "658--667"
+, update =      "99.07 bibrelex, 98.07 mitchell, 98.03 agarwal"
 }
 
 @inproceedings{art-mpscr-95
-, author =	"Pankaj K. Agarwal and P. Raghavan and H. Tamaki"
-, title =	"Motion planning for a steering-constrained robot through moderate obstacles"
-, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
-, year =	1995
-, pages =	"343--352"
-, update =	"96.05 agarwal, 95.09 agarwal+smid, 95.05 agarwal"
+, author =      "Pankaj K. Agarwal and P. Raghavan and H. Tamaki"
+, title =       "Motion planning for a steering-constrained robot through moderate obstacles"
+, booktitle =   "Proc. 27th Annu. ACM Sympos. Theory Comput."
+, year =        1995
+, pages =       "343--352"
+, update =      "96.05 agarwal, 95.09 agarwal+smid, 95.05 agarwal"
 }
 
 @techreport{ass-oleia-93
-, author =	"P. K. Agarwal and O. Schwarzkopf and M. Sharir"
-, title =	"The overlay of lower envelopes and its applications"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1993
-, update =	"98.07 agarwal, 98.03 bibrelex"
+, author =      "P. K. Agarwal and O. Schwarzkopf and M. Sharir"
+, title =       "The overlay of lower envelopes and its applications"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1993
+, update =      "98.07 agarwal, 98.03 bibrelex"
 }
 
 @article{ass-oleia-96
-, author =	"P. K. Agarwal and O. Schwarzkopf and Micha Sharir"
-, title =	"The overlay of lower envelopes and its applications"
-, journal =	"Discrete Comput. Geom."
-, volume =	15
-, year =	1996
-, pages =	"1--13"
-, update =	"98.03 mitchell, 96.05 smid"
+, author =      "P. K. Agarwal and O. Schwarzkopf and Micha Sharir"
+, title =       "The overlay of lower envelopes and its applications"
+, journal =     "Discrete Comput. Geom."
+, volume =      15
+, year =        1996
+, pages =       "1--13"
+, update =      "98.03 mitchell, 96.05 smid"
 }
 
 @techreport{ass-oletd-94
-, author =	"P. K. Agarwal and O. Schwarzkopf and M. Sharir"
-, title =	"The overlay of lower envelopes in three dimensions and its applications"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "P. K. Agarwal and O. Schwarzkopf and M. Sharir"
+, title =       "The overlay of lower envelopes in three dimensions and its applications"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ass-oletd-95
-, author =	"Pankaj K. Agarwal and Otfried Schwarzkopf and Micha Sharir"
-, title =	"The Overlay of Lower Envelopes in Three Dimensions and its Applications"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"182--189"
-, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-40.ps.gz"
-, keywords =	"curved surfaces"
-, cites =	"as-erasg-95, ass-sulbl-89, a-sdcgp-85, bd-olrcu-93, cgppsw-ctct-94, cegs-sessr-89, cs-arscg-89, bds-lric-94, e-acg-87, egs-ueplf-89, es-mnwsn-90, gpw-gtt-93, gpw-bngpi-94, hs-nblet-94, hs-atubs-95, hs-ndssg-86, hrr-araga-91, s-atubl-94, sa-dsstg-95, ZZZ"
-, update =	"98.03 bibrelex, 96.05 agarwal, 95.09 mitchell+schwarzkopf, 95.05 agarwal"
+, author =      "Pankaj K. Agarwal and Otfried Schwarzkopf and Micha Sharir"
+, title =       "The Overlay of Lower Envelopes in Three Dimensions and its Applications"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "182--189"
+, url = "ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-40.ps.gz"
+, keywords =    "curved surfaces"
+, cites =       "as-erasg-95, ass-sulbl-89, a-sdcgp-85, bd-olrcu-93, cgppsw-ctct-94, cegs-sessr-89, cs-arscg-89, bds-lric-94, e-acg-87, egs-ueplf-89, es-mnwsn-90, gpw-gtt-93, gpw-bngpi-94, hs-nblet-94, hs-atubs-95, hs-ndssg-86, hrr-araga-91, s-atubl-94, sa-dsstg-95, ZZZ"
+, update =      "98.03 bibrelex, 96.05 agarwal, 95.09 mitchell+schwarzkopf, 95.05 agarwal"
 }
 
 @article{as-smmck-96
-, author =	"Pankaj K. Agarwal and Sandeep Sen"
-, title =	"Selection in monotone matrices and computing $k$-th nearest neighbors"
-, journal =	"J. Algorithms"
-, volume =	20
-, year =	1996
-, pages =	"581--601"
-, update =	"96.09 agarwal"
+, author =      "Pankaj K. Agarwal and Sandeep Sen"
+, title =       "Selection in monotone matrices and computing $k$-th nearest neighbors"
+, journal =     "J. Algorithms"
+, volume =      20
+, year =        1996
+, pages =       "581--601"
+, update =      "96.09 agarwal"
 }
 
 @incollection{as-atgo-95
-, author =	"P. K. Agarwal and Micha Sharir"
-, title =	"Algorithmic techniques for geometric optimization"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1000
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"234--253"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "P. K. Agarwal and Micha Sharir"
+, title =       "Algorithmic techniques for geometric optimization"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1000
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "234--253"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{as-anps-91
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Applications of a new partitioning scheme"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"379--391"
-, keywords =	"random sampling, range searching, ray tracing, hidden line/surface elimination"
-, precedes =	"as-anspt-93"
-, update =	"98.03 mitchell, 97.11 bibrelex, 96.05 agarwal, 95.05 korneenko"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Applications of a new partitioning scheme"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "379--391"
+, keywords =    "random sampling, range searching, ray tracing, hidden line/surface elimination"
+, precedes =    "as-anspt-93"
+, update =      "98.03 mitchell, 97.11 bibrelex, 96.05 agarwal, 95.05 korneenko"
 }
 
 @techreport{as-anspt-91
-, author =	"P. K. Agarwal and Micha Sharir"
-, title =	"Applications of a New Space Partition Technique"
-, type =	"Manuscript"
-, year =	1991
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "P. K. Agarwal and Micha Sharir"
+, title =       "Applications of a New Space Partition Technique"
+, type =        "Manuscript"
+, year =        1991
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{as-anspt-93
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Applications of a new space-partitioning technique"
-, journal =	"Discrete Comput. Geom."
-, volume =	9
-, year =	1993
-, pages =	"11--38"
-, keywords =	"random sampling, range searching, ray tracing, hidden line/surface elimination, partition trees"
-, succeeds =	"as-anps-91"
-, update =	"98.03 mitchell, 97.11 bibrelex, 97.07 agarwal, 96.05 agarwal, 95.05 korneenko, 94.01 matousek"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Applications of a new space-partitioning technique"
+, journal =     "Discrete Comput. Geom."
+, volume =      9
+, year =        1993
+, pages =       "11--38"
+, keywords =    "random sampling, range searching, ray tracing, hidden line/surface elimination, partition trees"
+, succeeds =    "as-anps-91"
+, update =      "98.03 mitchell, 97.11 bibrelex, 97.07 agarwal, 96.05 agarwal, 95.05 korneenko, 94.01 matousek"
 }
 
 @incollection{as-aa-00,
-  author =	{Pankaj K. Agarwal and Micha Sharir},
-  title =	{Arrangements and Their Applications},
-  editor =	{J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia},
-  booktitle =	{Handbook of Computational Geometry},
-  publisher =	{Elsevier Science Publishers B.V. North-Holland},
-  address =	{Amsterdam},
-  year =	{2000}
-  pages =	{49--119},
-  update =	{00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell},
-  annote =	{Chapter 2 of su-hcg-00}
+  author =      {Pankaj K. Agarwal and Micha Sharir},
+  title =       {Arrangements and Their Applications},
+  editor =      {J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia},
+  booktitle =   {Handbook of Computational Geometry},
+  publisher =   {Elsevier Science Publishers B.V. North-Holland},
+  address =     {Amsterdam},
+  year =        {2000}
+  pages =       {49--119},
+  update =      {00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell},
+  annote =      {Chapter 2 of su-hcg-00}
 }
 
 @techreport{as-cssp-90
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Circle shooting in a simple polygon"
-, type =	"Technical {Report}"
-, number =	"90-56"
-, institution =	"DIMACS, Rutgers Univ."
-, year =	1990
-, update =	"98.03 mitchell, 96.05 agarwal, 95.01 smid, 93.09 milone+mitchell"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Circle shooting in a simple polygon"
+, type =        "Technical {Report}"
+, number =      "90-56"
+, institution = "DIMACS, Rutgers Univ."
+, year =        1990
+, update =      "98.03 mitchell, 96.05 agarwal, 95.01 smid, 93.09 milone+mitchell"
 }
 
 @article{as-cssp-93
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Circle shooting in a simple polygon"
-, journal =	"J. Algorithms"
-, volume =	14
-, year =	1993
-, pages =	"69--87"
-, succeeds =	"as-cssp-90"
-, update =	"98.03 mitchell, 96.05 agarwal, 95.01 smid, 94.05 matousek"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Circle shooting in a simple polygon"
+, journal =     "J. Algorithms"
+, volume =      14
+, year =        1993
+, pages =       "69--87"
+, succeeds =    "as-cssp-90"
+, update =      "98.03 mitchell, 96.05 agarwal, 95.01 smid, 94.05 matousek"
 }
 
 @article{as-cvspf-93
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Circular visibility of a simple polygon from a fixed point"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, month =	mar
-, year =	1993
-, pages =	"1--25"
-, keywords =	"visibility, simple polygon"
-, succeeds =	"as-cvspp-90"
-, update =	"98.11 bibrelex, 98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 94.05 sharir"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Circular visibility of a simple polygon from a fixed point"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, month =       mar
+, year =        1993
+, pages =       "1--25"
+, keywords =    "visibility, simple polygon"
+, succeeds =    "as-cvspp-90"
+, update =      "98.11 bibrelex, 98.03 mitchell, 96.05 agarwal, 95.05 korneenko, 94.05 sharir"
 }
 
 @techreport{as-cvspp-90
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Circular visibility of a simple polygon from a point"
-, type =	"Report"
-, number =	"90-61"
-, institution =	"DIMACS, Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1990
-, keywords =	"visibility, simple polygon"
-, precedes =	"as-cvspf-93"
-, update =	"98.03 mitchell, 96.05 agarwal, 95.05 korneenko"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Circular visibility of a simple polygon from a point"
+, type =        "Report"
+, number =      "90-61"
+, institution = "DIMACS, Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1990
+, keywords =    "visibility, simple polygon"
+, precedes =    "as-cvspf-93"
+, update =      "98.03 mitchell, 96.05 agarwal, 95.05 korneenko"
 }
 
 @techreport{as-cci-91
-, author =	"P. K. Agarwal and Micha Sharir"
-, title =	"Counting circular arc intersections"
-, type =	"Technical {Report}"
-, number =	"CS-1991-04"
-, institution =	"Dept. Comput. Sci., Duke Univ."
-, address =	"Durham, NC"
-, month =	jan
-, year =	1991
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "P. K. Agarwal and Micha Sharir"
+, title =       "Counting circular arc intersections"
+, type =        "Technical {Report}"
+, number =      "CS-1991-04"
+, institution = "Dept. Comput. Sci., Duke Univ."
+, address =     "Durham, NC"
+, month =       jan
+, year =        1991
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{as-ccai-91
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Counting circular arc intersections"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"10--20"
-, keywords =	"intersection, circles, random sampling"
-, cites =	"a-pal1e-90, a-pal2a-90, aass-sdp-90, as-cci-91, bo-arcgi-79, c-rcsi-86, ce-oails-88, cegs-sessr-89, cegs-ablsp-89, cs-agpli-90, csw-qoubs-90, c-narsc-87, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-oplms-86, gos-crial-89, hw-ensrq-87, m-cen-90, m-cha-90i, m-fppa1-88, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 96.05 agarwal"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Counting circular arc intersections"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "10--20"
+, keywords =    "intersection, circles, random sampling"
+, cites =       "a-pal1e-90, a-pal2a-90, aass-sdp-90, as-cci-91, bo-arcgi-79, c-rcsi-86, ce-oails-88, cegs-sessr-89, cegs-ablsp-89, cs-agpli-90, csw-qoubs-90, c-narsc-87, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-oplms-86, gos-crial-89, hw-ensrq-87, m-cen-90, m-cha-90i, m-fppa1-88, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 96.05 agarwal"
 }
 
 @incollection{as-dssga-00
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"{Davenport-Schinzel} Sequences and Their Geometric Applications"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"1--47"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 1 of su-hcg-00"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "{Davenport-Schinzel} Sequences and Their Geometric Applications"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "1--47"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 1 of su-hcg-00"
 }
 
 @techreport{as-eago-96
-, author =	"P. K. Agarwal and M. Sharir"
-, title =	"Efficient Algorithms for Geometric Optimization"
-, number =	"CS-1996-19"
-, institution =	"Dept. Computer Science, Duke University"
-, year =	1996
-, update =	"99.03 forrest, 98.11 bibrelex, 98.07 agarwal"
+, author =      "P. K. Agarwal and M. Sharir"
+, title =       "Efficient Algorithms for Geometric Optimization"
+, number =      "CS-1996-19"
+, institution = "Dept. Computer Science, Duke University"
+, year =        1996
+, update =      "99.03 forrest, 98.11 bibrelex, 98.07 agarwal"
 }
 
 @article{as-eago-98
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Efficient algorithms for geometric optimization"
-, journal =	"ACM Comput. Surv."
-, volume =	30
-, year =	1998
-, pages =	"412--458"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Efficient algorithms for geometric optimization"
+, journal =     "ACM Comput. Surv."
+, volume =      30
+, year =        1998
+, pages =       "412--458"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{as-erasg-95
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Efficient Randomized Algorithms for Some Geometric Optimization Problems"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"326--335"
-, keywords =	"vertical decompositions, width of point sets, minimum-width annulus, biggest stick problem"
-, cites =	"aas-cefda-94, ass-oletd-95, ast-apsgo-94, as-cldsp-90, bc-ossc-94, cegs-dwclp-93, cegs-sessr-89, cs-agpli-90, cegsw-ccbac-90, cs-arscg-89, dmn-rass-92, bds-lric-94, bgh-vdt3s-94, efnn-rauvd-89, hs-nblet-94, hw-ensrq-87, ht-cws-88, ks-osse-93, ks-ebago-93, m-roass-91, m-apcad-83, s-atubl-94, sa-dsstg-95, sj-wrspp-94, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Efficient Randomized Algorithms for Some Geometric Optimization Problems"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "326--335"
+, keywords =    "vertical decompositions, width of point sets, minimum-width annulus, biggest stick problem"
+, cites =       "aas-cefda-94, ass-oletd-95, ast-apsgo-94, as-cldsp-90, bc-ossc-94, cegs-dwclp-93, cegs-sessr-89, cs-agpli-90, cegsw-ccbac-90, cs-arscg-89, dmn-rass-92, bds-lric-94, bgh-vdt3s-94, efnn-rauvd-89, hs-nblet-94, hw-ensrq-87, ht-cws-88, ks-osse-93, ks-ebago-93, m-roass-91, m-apcad-83, s-atubl-94, sa-dsstg-95, sj-wrspp-94, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{as-erasg-96
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Efficient Randomized Algorithms for Some Geometric Optimization Problems"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, year =	1996
-, pages =	"317--337"
-, update =	"97.03 agarwal"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Efficient Randomized Algorithms for Some Geometric Optimization Problems"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, year =        1996
+, pages =       "317--337"
+, update =      "97.03 agarwal"
 }
 
 @inproceedings{as-mpbpo-99
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Motion planning of a ball amid polyhedral obstacles in three dimensions"
-, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1999
-, pages =	"21--30"
-, update =	"99.03 agarwal"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Motion planning of a ball amid polyhedral obstacles in three dimensions"
+, booktitle =   "Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1999
+, pages =       "21--30"
+, update =      "99.03 agarwal"
 }
 
 @unpublished{as-mpbas-98
-, author =	"P. K. Agarwal and M. Sharir"
-, title =	"Motion Planning of a Ball Amidst Segments in Three Dimensions"
-, year =	1998
-, note =	"unpublished manuscript"
-, update =	"98.03 agarwal"
+, author =      "P. K. Agarwal and M. Sharir"
+, title =       "Motion Planning of a Ball Amidst Segments in Three Dimensions"
+, year =        1998
+, note =        "unpublished manuscript"
+, update =      "98.03 agarwal"
 }
 
 @techreport{as-oldmw-90
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Off-line dynamic maintenance of the width of a planar point set"
-, type =	"Report"
-, number =	"90-64"
-, institution =	"DIMACS, Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1990
-, precedes =	"as-oldmw-91"
-, update =	"98.03 mitchell, 96.05 agarwal, 93.09 jones"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Off-line dynamic maintenance of the width of a planar point set"
+, type =        "Report"
+, number =      "90-64"
+, institution = "DIMACS, Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1990
+, precedes =    "as-oldmw-91"
+, update =      "98.03 mitchell, 96.05 agarwal, 93.09 jones"
 }
 
 @article{as-oldmw-91
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Off-line dynamic maintenance of the width of a planar point set"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, year =	1991
-, pages =	"65--78"
-, keywords =	"off-line problem, dynamization, width, convex hull"
-, succeeds =	"as-oldmw-90"
-, update =	"98.03 mitchell, 96.05 agarwal, 93.09 jones"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Off-line dynamic maintenance of the width of a planar point set"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, year =        1991
+, pages =       "65--78"
+, keywords =    "off-line problem, dynamization, width, convex hull"
+, succeeds =    "as-oldmw-90"
+, update =      "98.03 mitchell, 96.05 agarwal, 93.09 jones"
 }
 
 @inproceedings{as-nvpt-93
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"On the number of views of polyhedral terrains"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"55--60"
-, cites =	"bhok-sanvp-91, bd-agisr-90, cf-cvbtd-82, cs-vppt-89, c-agrv-85, gcs-ecrag-91, hs-nblet-93, kd-svm-76, pd-acag-86, pd-voag-90, s-atubl-93, s-nvapo-91, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 96.05 agarwal, 95.09 agarwal, 93.09 milone+mitchell"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "On the number of views of polyhedral terrains"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "55--60"
+, cites =       "bhok-sanvp-91, bd-agisr-90, cf-cvbtd-82, cs-vppt-89, c-agrv-85, gcs-ecrag-91, hs-nblet-93, kd-svm-76, pd-acag-86, pd-voag-90, s-atubl-93, s-nvapo-91, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 96.05 agarwal, 95.09 agarwal, 93.09 milone+mitchell"
 }
 
 @article{as-nvpt-94
-, author =	"P. K. Agarwal and Micha Sharir"
-, title =	"On the number of views of polyhedral terrains"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"177--182"
-, update =	"98.03 mitchell, 96.05 pocchiola, 95.09 agarwal, 93.09 milone+mitchell"
+, author =      "P. K. Agarwal and Micha Sharir"
+, title =       "On the number of views of polyhedral terrains"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "177--182"
+, update =      "98.03 mitchell, 96.05 pocchiola, 95.09 agarwal, 93.09 milone+mitchell"
 }
 
 @inproceedings{as-pckum-99
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Pipes, cigars, and kreplach: The union of {M}inkowski sums in three dimensions"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"143--153"
-, update =	"00.03 agarwal"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Pipes, cigars, and kreplach: The union of {M}inkowski sums in three dimensions"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "143--153"
+, update =      "00.03 agarwal"
 }
 
 @article{as-pckum-00
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Pipes, cigars, and kreplach: The union of {M}inkowski sums in three dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	24
-, number =	4
-, year =	2000
-, pages =	"645--685"
-, update =	"01.07 orourke"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Pipes, cigars, and kreplach: The union of {M}inkowski sums in three dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      24
+, number =      4
+, year =        2000
+, pages =       "645--685"
+, update =      "01.07 orourke"
 }
 
 @techreport{as-pglp-90
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Planar geometric location problems"
-, type =	"Report"
-, number =	"90-58"
-, institution =	"DIMACS, Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1990
-, precedes =	"as-pglpm-91"
-, update =	"98.03 mitchell, 96.05 agarwal, 93.09 jones"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Planar geometric location problems"
+, type =        "Report"
+, number =      "90-58"
+, institution = "DIMACS, Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1990
+, precedes =    "as-pglpm-91"
+, update =      "98.03 mitchell, 96.05 agarwal, 93.09 jones"
 }
 
 @article{as-pglp-94
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Planar geometric location problems"
-, journal =	"Algorithmica"
-, volume =	11
-, year =	1994
-, pages =	"185--195"
-, keywords =	"location problems, arrangements, width, parametric search techniques"
-, succeeds =	"as-pglpm-91"
-, update =	"98.03 mitchell, 97.03 devillers, 96.05 agarwal, 94.05 sharir"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Planar geometric location problems"
+, journal =     "Algorithmica"
+, volume =      11
+, year =        1994
+, pages =       "185--195"
+, keywords =    "location problems, arrangements, width, parametric search techniques"
+, succeeds =    "as-pglpm-91"
+, update =      "98.03 mitchell, 97.03 devillers, 96.05 agarwal, 94.05 sharir"
 }
 
 @inproceedings{as-pglpm-91
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Planar geometric location problems and maintaining the width of a planar set"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"449--458"
-, keywords =	"location problems, arrangements, width, parametric search techniques"
-, succeeds =	"as-pglp-90"
-, update =	"98.03 mitchell, 96.05 agarwal, 93.09 jones"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Planar geometric location problems and maintaining the width of a planar set"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "449--458"
+, keywords =    "location problems, arrangements, width, parametric search techniques"
+, succeeds =    "as-pglp-90"
+, update =      "98.03 mitchell, 96.05 agarwal, 93.09 jones"
 }
 
 @article{as-rsacp-96i
-, author =	"P. K. Agarwal and Micha Sharir"
-, title =	"Ray shooting amidst convex polygons in {2D}"
-, journal =	"J. Algorithms"
-, volume =	21
-, year =	1996
-, pages =	"508--519"
-, update =	"98.03 mitchell, 97.03 agarwal+pocchiola+smid, 96.09 agarwal, 96.05 agarwal"
+, author =      "P. K. Agarwal and Micha Sharir"
+, title =       "Ray shooting amidst convex polygons in {2D}"
+, journal =     "J. Algorithms"
+, volume =      21
+, year =        1996
+, pages =       "508--519"
+, update =      "98.03 mitchell, 97.03 agarwal+pocchiola+smid, 96.09 agarwal, 96.05 agarwal"
 }
 
 @article{as-rsacp-96ii
-, author =	"P. K. Agarwal and Micha Sharir"
-, title =	"Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, year =	1996
-, pages =	"100--116"
-, succeeds =	"as-rsacp-93"
-, update =	"98.03 mitchell, 96.05 smid"
+, author =      "P. K. Agarwal and Micha Sharir"
+, title =       "Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, pages =       "100--116"
+, succeeds =    "as-rsacp-93"
+, update =      "98.03 mitchell, 96.05 smid"
 }
 
 @inproceedings{as-rsacp-93
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Ray Shooting Amidst Convex Polytopes in Three Dimensions"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"260--270"
-, precedes =	"as-rsacp-96ii"
-, update =	"98.03 mitchell, 96.05 smid, 93.05 smid"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Ray Shooting Amidst Convex Polytopes in Three Dimensions"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "260--270"
+, precedes =    "as-rsacp-96ii"
+, update =      "98.03 mitchell, 96.05 smid, 93.05 smid"
 }
 
 @techreport{as-rbida-88t
-, author =	"P. K. Agarwal and M. Sharir"
-, title =	"Red-blue intersection detection algorithms, with applications to motion planning and collision detection"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1988
-, update =	"98.07 agarwal, 98.03 bibrelex"
+, author =      "P. K. Agarwal and M. Sharir"
+, title =       "Red-blue intersection detection algorithms, with applications to motion planning and collision detection"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1988
+, update =      "98.07 agarwal, 98.03 bibrelex"
 }
 
 @inproceedings{as-rbida-88
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Red-blue intersection detection algorithms, with applications to motion planning and collision detection"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"70--80"
-, keywords =	"motion planning, red-blue intersection"
-, precedes =	"as-rbida-90"
-, cites =	"as-rbida-88t, ass-sulbl-87, a-sdcgp-85, bo-arcgi-79, bk-cmpgm-87, c-fsram-85, cg-vippg-85, c-narsc-87, cegsw-ccbac-88t, c-dic-36, eghsssw-irals-88, egs-cmfal-88, ghlst-ltavs-87, gss-gmppt-88, hs-ndssg-86, hw-ensrq-87, klps-ujrcf-86, l-bc-61, my-mpacc-86, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 96.05 agarwal, 95.05 korneenko"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Red-blue intersection detection algorithms, with applications to motion planning and collision detection"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "70--80"
+, keywords =    "motion planning, red-blue intersection"
+, precedes =    "as-rbida-90"
+, cites =       "as-rbida-88t, ass-sulbl-87, a-sdcgp-85, bo-arcgi-79, bk-cmpgm-87, c-fsram-85, cg-vippg-85, c-narsc-87, cegsw-ccbac-88t, c-dic-36, eghsssw-irals-88, egs-cmfal-88, ghlst-ltavs-87, gss-gmppt-88, hs-ndssg-86, hw-ensrq-87, klps-ujrcf-86, l-bc-61, my-mpacc-86, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 96.05 agarwal, 95.05 korneenko"
 }
 
 @article{as-rbida-90
-, author =	"Pankaj K. Agarwal and Micha Sharir"
-, title =	"Red-blue intersection detection algorithms, with applications to motion planning and collision detection"
-, journal =	"SIAM J. Comput."
-, volume =	19
-, number =	2
-, year =	1990
-, pages =	"297--321"
-, keywords =	"intersection, motion planning, {Davenport}-{Schinzel} sequences, sweeping, red-blue, random sampling, ray shooting, curve arrangements"
-, succeeds =	"as-rbida-88"
-, update =	"98.03 mitchell, 96.05 agarwal, 95.05 korneenko"
+, author =      "Pankaj K. Agarwal and Micha Sharir"
+, title =       "Red-blue intersection detection algorithms, with applications to motion planning and collision detection"
+, journal =     "SIAM J. Comput."
+, volume =      19
+, number =      2
+, year =        1990
+, pages =       "297--321"
+, keywords =    "intersection, motion planning, {Davenport}-{Schinzel} sequences, sweeping, red-blue, random sampling, ray shooting, curve arrangements"
+, succeeds =    "as-rbida-88"
+, update =      "98.03 mitchell, 96.05 agarwal, 95.05 korneenko"
 }
 
 @techreport{ass-sulbl-87
-, author =	"P. K. Agarwal and M. Sharir and P. W. Shor"
-, title =	"Sharp upper and lower bounds on the length of general {Davenport}-{Schinzel} sequences"
-, number =	332
-, institution =	"Department of Computer Science, New York University"
-, year =	1987
-, update =	"98.07 agarwal, 98.03 bibrelex"
+, author =      "P. K. Agarwal and M. Sharir and P. W. Shor"
+, title =       "Sharp upper and lower bounds on the length of general {Davenport}-{Schinzel} sequences"
+, number =      332
+, institution = "Department of Computer Science, New York University"
+, year =        1987
+, update =      "98.07 agarwal, 98.03 bibrelex"
 }
 
 @techreport{ast-emst-93
-, author =	"P. K. Agarwal and Micha Sharir and S. Toledo"
-, title =	"An efficient multi-dimensional searching technique and its applications"
-, type =	"Tech. Report"
-, number =	"CS-1993-20"
-, institution =	"Dept. Comp. Sci."
-, address =	"Duke University"
-, year =	1993
-, update =	"98.03 mitchell, 96.05 agarwal"
+, author =      "P. K. Agarwal and Micha Sharir and S. Toledo"
+, title =       "An efficient multi-dimensional searching technique and its applications"
+, type =        "Tech. Report"
+, number =      "CS-1993-20"
+, institution = "Dept. Comp. Sci."
+, address =     "Duke University"
+, year =        1993
+, update =      "98.03 mitchell, 96.05 agarwal"
 }
 
 @inproceedings{ast-apsgo-92
-, author =	"Pankaj K. Agarwal and Micha Sharir and Sivan Toledo"
-, title =	"Applications of parametric searching in geometric optimization"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"72--82"
-, keywords =	"parametric search"
-, precedes =	"ast-apsgo-94"
-, update =	"96.01 aronov, 95.05 korneenko"
+, author =      "Pankaj K. Agarwal and Micha Sharir and Sivan Toledo"
+, title =       "Applications of parametric searching in geometric optimization"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "72--82"
+, keywords =    "parametric search"
+, precedes =    "ast-apsgo-94"
+, update =      "96.01 aronov, 95.05 korneenko"
 }
 
 @article{ast-apsgo-94
-, author =	"Pankaj K. Agarwal and Micha Sharir and S. Toledo"
-, title =	"Applications of parametric searching in geometric optimization"
-, journal =	"J. Algorithms"
-, volume =	17
-, year =	1994
-, pages =	"292--318"
-, keywords =	"parametric search"
-, succeeds =	"ast-apsgo-92"
-, update =	"98.03 mitchell, 96.05 agarwal, 96.01 aronov, 95.05 korneenko, 95.01 smid"
+, author =      "Pankaj K. Agarwal and Micha Sharir and S. Toledo"
+, title =       "Applications of parametric searching in geometric optimization"
+, journal =     "J. Algorithms"
+, volume =      17
+, year =        1994
+, pages =       "292--318"
+, keywords =    "parametric search"
+, succeeds =    "ast-apsgo-92"
+, update =      "98.03 mitchell, 96.05 agarwal, 96.01 aronov, 95.05 korneenko, 95.01 smid"
 }
 
 @inproceedings{asw-d2cp-97
-, author =	"Pankaj K. Agarwal and Micha Sharir and Emo Welzl"
-, title =	"The Discrete $2$-Center Problem"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"147--155"
-, cites =	"a-slp3d-94, aass-sdp-93, as-pglp-94, cegsw-ccbac-90, cs-arscg-89, e-fcptc-97, hs-ftp-91, jk-eaetc-94, ks-ebago-93, klps-ujrcf-86, m-apcad-83, ms-cscgl-84, r-dcikc-88a, s-nlap2-97, t-icbcl-88, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "Pankaj K. Agarwal and Micha Sharir and Emo Welzl"
+, title =       "The Discrete $2$-Center Problem"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "147--155"
+, cites =       "a-slp3d-94, aass-sdp-93, as-pglp-94, cegsw-ccbac-90, cs-arscg-89, e-fcptc-97, hs-ftp-91, jk-eaetc-94, ks-ebago-93, klps-ujrcf-86, m-apcad-83, ms-cscgl-84, r-dcikc-88a, s-nlap2-97, t-icbcl-88, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @article{ass-sulbl-89
-, author =	"Pankaj K. Agarwal and Micha Sharir and P. W.Shor"
-, title =	"Sharp upper and lower bounds on the length of general {Davenport}-{Schinzel} sequences"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	52
-, number =	2
-, year =	1989
-, pages =	"228--274"
-, keywords =	"Davenport-Schinzel sequences, Ackermann's function, combinatorial geometry"
-, update =	"98.07 agarwal, 98.03 mitchell, 96.05 agarwal, 95.05 korneenko"
+, author =      "Pankaj K. Agarwal and Micha Sharir and P. W.Shor"
+, title =       "Sharp upper and lower bounds on the length of general {Davenport}-{Schinzel} sequences"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      52
+, number =      2
+, year =        1989
+, pages =       "228--274"
+, keywords =    "Davenport-Schinzel sequences, Ackermann's function, combinatorial geometry"
+, update =      "98.07 agarwal, 98.03 mitchell, 96.05 agarwal, 95.05 korneenko"
 }
 
 @article{as-escrs-90
-, author =	"Pankaj K. Agarwal and M.-T. Shing"
-, title =	"Efficient special cases of rectilinear {Steiner} trees: Points on the boundary of a rectilinear rectangle"
-, journal =	"Networks"
-, volume =	20
-, year =	1990
-, pages =	"453--485"
-, keywords =	"Steiner trees"
-, update =	"98.11 bibrelex, 96.05 agarwal"
+, author =      "Pankaj K. Agarwal and M.-T. Shing"
+, title =       "Efficient special cases of rectilinear {Steiner} trees: Points on the boundary of a rectilinear rectangle"
+, journal =     "Networks"
+, volume =      20
+, year =        1990
+, pages =       "453--485"
+, keywords =    "Steiner trees"
+, update =      "98.11 bibrelex, 96.05 agarwal"
 }
 
 @inproceedings{as-sagp-94
-, author =	"Pankaj K. Agarwal and Subhash Suri"
-, title =	"Surface Approximation and Geometric Partitions"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"24--33"
-, keywords =	"triangulation, ray shooting"
-, update =	"95.01 mitchell"
+, author =      "Pankaj K. Agarwal and Subhash Suri"
+, title =       "Surface Approximation and Geometric Partitions"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "24--33"
+, keywords =    "triangulation, ray shooting"
+, update =      "95.01 mitchell"
 }
 
 @article{as-sagp-98
-, author =	"P. K. Agarwal and S. Suri"
-, title =	"Surface Approximation and Geometric Partitions"
-, journal =	"SIAM J. Comput."
-, volume =	27
-, year =	1998
-, pages =	"1016--1035"
-, update =	"01.04 smid"
+, author =      "P. K. Agarwal and S. Suri"
+, title =       "Surface Approximation and Geometric Partitions"
+, journal =     "SIAM J. Comput."
+, volume =      27
+, year =        1998
+, pages =       "1016--1035"
+, update =      "01.04 smid"
 }
 
 @article{av-eaapc-00
-, author =	"P. K. Agarwal and Kasturi R. Varadarajan"
-, title =	"Efficient algorithms for approximating polygonal chains"
-, journal =	"Discrete Comput. Geom."
-, volume =	23
-, year =	2000
-, pages =	"273--291"
-, update =	"01.11 smid, 00.03 agarwal"
+, author =      "P. K. Agarwal and Kasturi R. Varadarajan"
+, title =       "Efficient algorithms for approximating polygonal chains"
+, journal =     "Discrete Comput. Geom."
+, volume =      23
+, year =        2000
+, pages =       "273--291"
+, update =      "01.11 smid, 00.03 agarwal"
 }
 
 @article{af-wmsia-96
-, author =	"R. Agarwala and D. Fern\'{a}ndez-Baca"
-, title =	"Weighted multidimensional search and its applications to convex optimization"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, year =	1996
-, pages =	"83--99"
-, update =	"96.05 agarwal"
+, author =      "R. Agarwala and D. Fern\'{a}ndez-Baca"
+, title =       "Weighted multidimensional search and its applications to convex optimization"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, pages =       "83--99"
+, update =      "96.05 agarwal"
 }
 
 @article{a-lncg-88
-, author =	"A. Aggarwal"
-, title =	"Lecture Notes in Computational Geometry"
-, journal =	"MIT Reserch Seminar Series MIT/LCS/RSS"
-, volume =	3
-, month =	aug
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "A. Aggarwal"
+, title =       "Lecture Notes in Computational Geometry"
+, journal =     "MIT Reserch Seminar Series MIT/LCS/RSS"
+, volume =      3
+, month =       aug
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @article{a-obfma-86
-, author =	"A. Aggarwal"
-, title =	"Optimal bounds for finding maximum on array of processors with {$k$} global buses"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-35"
-, year =	1986
-, pages =	"62--64"
-, update =	"98.07 bibrelex"
+, author =      "A. Aggarwal"
+, title =       "Optimal bounds for finding maximum on array of processors with {$k$} global buses"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-35"
+, year =        1986
+, pages =       "62--64"
+, update =      "98.07 bibrelex"
 }
 
 @article{a-rtcg-89
-, author =	"A. Aggarwal"
-, title =	"Research topics in computational geometry"
-, journal =	"Bull. EATCS"
-, volume =	39
-, year =	1989
-, pages =	"388--408"
-, keywords =	"problem collection"
-, update =	"95.05 korneenko"
+, author =      "A. Aggarwal"
+, title =       "Research topics in computational geometry"
+, journal =     "Bull. EATCS"
+, volume =      39
+, year =        1989
+, pages =       "388--408"
+, keywords =    "problem collection"
+, update =      "95.05 korneenko"
 }
 
 @phdthesis{a-agpiv-84
-, author =	"Alok Aggarwal"
-, title =	"The art gallery problem: {Its} variations, applications, and algorithmic aspects"
-, school =	"Dept. of Comput. Sci., Johns Hopkins University"
-, address =	"Baltimore, MD"
-, year =	1984
-, keywords =	"visibility"
-, update =	"98.11 bibrelex, 98.03 smid, 97.11 orourke"
+, author =      "Alok Aggarwal"
+, title =       "The art gallery problem: {Its} variations, applications, and algorithmic aspects"
+, school =      "Dept. of Comput. Sci., Johns Hopkins University"
+, address =     "Baltimore, MD"
+, year =        1984
+, keywords =    "visibility"
+, update =      "98.11 bibrelex, 98.03 smid, 97.11 orourke"
 }
 
 @inproceedings{aacs-mhm-87
-, author =	"A. Aggarwal and B. Alpern and A. K. Chandra and M. Snir"
-, title =	"A model for hierarchical memory"
-, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '87"
-, year =	1987
-, pages =	"305--313"
-, update =	"98.07 bibrelex, 97.03 agarwal, 94.05 franciosa"
+, author =      "A. Aggarwal and B. Alpern and A. K. Chandra and M. Snir"
+, title =       "A model for hierarchical memory"
+, booktitle =   "Proc. 19th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '87"
+, year =        1987
+, pages =       "305--313"
+, update =      "98.07 bibrelex, 97.03 agarwal, 94.05 franciosa"
 }
 
 @inproceedings{abkks-emcmu-92
-, author =	"A. Aggarwal and A. Bar-Noy and S. Khuller and D. Kravets and B. Schieber"
-, title =	"Efficient minimum cost matching using quadrangle inequality"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"583--592"
-, update =	"98.03 bibrelex"
+, author =      "A. Aggarwal and A. Bar-Noy and S. Khuller and D. Kravets and B. Schieber"
+, title =       "Efficient minimum cost matching using quadrangle inequality"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "583--592"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{abosy-fmcnp-85
-, author =	"A. Aggarwal and H. Booth and J. O'Rourke and Subhash Suri and C. K. Yap"
-, title =	"Finding minimal convex nested polygons"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"296--304"
-, keywords =	"packing, visibility"
-, precedes =	"abosy-fmcnp-89"
-, cites =	"cy-psppo-84, da-frkec-84, db-ccppf-83, kl-fstcg-85, o-fmeb-84, so-fmnp-85t, t-sgprc-83, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "A. Aggarwal and H. Booth and J. O'Rourke and Subhash Suri and C. K. Yap"
+, title =       "Finding minimal convex nested polygons"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "296--304"
+, keywords =    "packing, visibility"
+, precedes =    "abosy-fmcnp-89"
+, cites =       "cy-psppo-84, da-frkec-84, db-ccppf-83, kl-fstcg-85, o-fmeb-84, so-fmnp-85t, t-sgprc-83, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{abosy-fmcnp-89
-, author =	"A. Aggarwal and H. Booth and J. O'Rourke and Subhash Suri and C. K. Yap"
-, title =	"Finding minimal convex nested polygons"
-, journal =	"Inform. Comput."
-, volume =	83
-, number =	1
-, month =	oct
-, year =	1989
-, pages =	"98--110"
-, keywords =	"packing, visibility, convex polygons, extremal figures"
-, succeeds =	"abosy-fmcnp-85"
-, update =	"98.03 mitchell, 95.05 korneenko"
+, author =      "A. Aggarwal and H. Booth and J. O'Rourke and Subhash Suri and C. K. Yap"
+, title =       "Finding minimal convex nested polygons"
+, journal =     "Inform. Comput."
+, volume =      83
+, number =      1
+, month =       oct
+, year =        1989
+, pages =       "98--110"
+, keywords =    "packing, visibility, convex polygons, extremal figures"
+, succeeds =    "abosy-fmcnp-85"
+, update =      "98.03 mitchell, 95.05 korneenko"
 }
 
 @inproceedings{ac-vma-88
-, author =	"A. Aggarwal and A. K. Chandra"
-, title =	"Virtual memory algorithms"
-, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
-, year =	1988
-, pages =	"173--185"
-, update =	"94.05 franciosa"
+, author =      "A. Aggarwal and A. K. Chandra"
+, title =       "Virtual memory algorithms"
+, booktitle =   "Proc. 20th Annu. ACM Sympos. Theory Comput."
+, year =        1988
+, pages =       "173--185"
+, update =      "94.05 franciosa"
 }
 
 @article{acs-ccp-90
-, author =	"A. Aggarwal and A. K. Chandra and M. Snir"
-, title =	"Communication Complexity of {PRAM}s"
-, journal =	"Theoret. Comput. Sci."
-, volume =	71
-, year =	1990
-, pages =	"3--28"
-, update =	"96.09 orourke"
+, author =      "A. Aggarwal and A. K. Chandra and M. Snir"
+, title =       "Communication Complexity of {PRAM}s"
+, journal =     "Theoret. Comput. Sci."
+, volume =      71
+, year =        1990
+, pages =       "3--28"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{acs-hmbt-87
-, author =	"A. Aggarwal and A. K. Chandra and M. Snir"
-, title =	"Hierarchical memory with block transfer"
-, booktitle =	"Proc. 28rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1987
-, pages =	"204--216"
-, update =	"94.05 franciosa"
+, author =      "A. Aggarwal and A. K. Chandra and M. Snir"
+, title =       "Hierarchical memory with block transfer"
+, booktitle =   "Proc. 28rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1987
+, pages =       "204--216"
+, update =      "94.05 franciosa"
 }
 
 @article{acy-macp-85
-, author =	"A. Aggarwal and J. S. Chang and C. K. Yap"
-, title =	"Minimum area circumscribing polygons"
-, journal =	"Visual Comput."
-, volume =	1
-, year =	1985
-, pages =	"112--117"
-, keywords =	"extremal figures, polygons"
-, update =	"95.05 korneenko"
+, author =      "A. Aggarwal and J. S. Chang and C. K. Yap"
+, title =       "Minimum area circumscribing polygons"
+, journal =     "Visual Comput."
+, volume =      1
+, year =        1985
+, pages =       "112--117"
+, keywords =    "extremal figures, polygons"
+, update =      "95.05 korneenko"
 }
 
 @techreport{ac-eapps-84
-, author =	"A. Aggarwal and Bernard Chazelle"
-, title =	"Efficient algorithm for partitioning a polygon into star-shaped polygons"
-, type =	"Report"
-, number =	"??"
-, institution =	"IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1984
-, update =	"98.03 mitchell"
+, author =      "A. Aggarwal and Bernard Chazelle"
+, title =       "Efficient algorithm for partitioning a polygon into star-shaped polygons"
+, type =        "Report"
+, number =      "??"
+, institution = "IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1984
+, update =      "98.03 mitchell"
 }
 
 @article{acgoy-pcg-88
-, author =	"A. Aggarwal and Bernard Chazelle and Leonidas J. Guibas and C. {\'O}'D{\'u}nlaing and C. Yap"
-, title =	"Parallel computational geometry"
-, journal =	"Algorithmica"
-, volume =	3
-, year =	1988
-, pages =	"293--327"
-, succeeds =	"acgoy-pcg-85"
-, update =	"98.03 mitchell"
+, author =      "A. Aggarwal and Bernard Chazelle and Leonidas J. Guibas and C. {\'O}'D{\'u}nlaing and C. Yap"
+, title =       "Parallel computational geometry"
+, journal =     "Algorithmica"
+, volume =      3
+, year =        1988
+, pages =       "293--327"
+, succeeds =    "acgoy-pcg-85"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{acgoy-pcg-85
-, author =	"A. Aggarwal and Bernard Chazelle and Leonidas J. Guibas and C. {\'O}'D{\'u}nlaing and C. K. Yap"
-, title =	"Parallel computational geometry"
-, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"468--477"
-, precedes =	"acgoy-pcg-88"
-, update =	"98.03 mitchell"
+, author =      "A. Aggarwal and Bernard Chazelle and Leonidas J. Guibas and C. {\'O}'D{\'u}nlaing and C. K. Yap"
+, title =       "Parallel computational geometry"
+, booktitle =   "Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "468--477"
+, precedes =    "acgoy-pcg-88"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ackms-amtsp-97
-, author =	"Alok Aggarwal and Don Coppersmith and Sanjeev Khanna and Rajeev Motwani and Baruch Schieber"
-, title =	"The Angular-Metric Traveling Salesman Problem"
-, booktitle =	"Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms"
-, site =	"New Orleans, Louisiana"
-, month =	jan
-, year =	1997
-, pages =	"221--229"
-, update =	"98.03 mitchell"
-, annote =	"An earlier version, titled 'The Angle-TSP Problem  and the
+, author =      "Alok Aggarwal and Don Coppersmith and Sanjeev Khanna and Rajeev Motwani and Baruch Schieber"
+, title =       "The Angular-Metric Traveling Salesman Problem"
+, booktitle =   "Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms"
+, site =        "New Orleans, Louisiana"
+, month =       jan
+, year =        1997
+, pages =       "221--229"
+, update =      "98.03 mitchell"
+, annote =      "An earlier version, titled 'The Angle-TSP Problem  and the
                   Weighted Linear Matroid Parity Problem' was accepted
                   to STOC96, but apparently was withdrawn, as it never
                   appeared there"
 }
 
 @article{ackms-amtsp-99
-, author =	"A. Aggarwal and D. Coppersmith and S. Khanna and R. Motwani and B. Schieber"
-, title =	"The angular-metric traveling salesman problem"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, year =	1999
-, pages =	"697--711"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "A. Aggarwal and D. Coppersmith and S. Khanna and R. Motwani and B. Schieber"
+, title =       "The angular-metric traveling salesman problem"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, year =        1999
+, pages =       "697--711"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @article{aert-otbsp-92
-, author =	"A. Aggarwal and H. Edelsbrunner and P. Raghavan and P. Tiwari"
-, title =	"Optimal Time Bounds for Some Proximity Problems in the Plane"
-, journal =	"Inform. Process. Lett."
-, volume =	42
-, number =	1
-, year =	1992
-, pages =	"55--60"
-, keywords =	"proximity, lower bounds"
-, update =	"95.05 korneenko, 93.09 held"
+, author =      "A. Aggarwal and H. Edelsbrunner and P. Raghavan and P. Tiwari"
+, title =       "Optimal Time Bounds for Some Proximity Problems in the Plane"
+, journal =     "Inform. Process. Lett."
+, volume =      42
+, number =      1
+, year =        1992
+, pages =       "55--60"
+, keywords =    "proximity, lower bounds"
+, update =      "95.05 korneenko, 93.09 held"
 }
 
 @incollection{ags-ccrpd-88
-, author =	"A. Aggarwal and S. K. Ghosh and R. K. Shyamasundar"
-, title =	"Computational complexity of restricted polygon decompositions"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"1--11"
-, keywords =	"polygons, decomposition, watchman problem"
-, update =	"95.05 korneenko"
+, author =      "A. Aggarwal and S. K. Ghosh and R. K. Shyamasundar"
+, title =       "Computational complexity of restricted polygon decompositions"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "1--11"
+, keywords =    "polygons, decomposition, watchman problem"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{agss-ltacv-87
-, author =	"A. Aggarwal and L. J. Guibas and J. Saxe and P. W. Shor"
-, title =	"A linear time algorithm for computing the {Voronoi} diagram of a convex polygon"
-, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
-, year =	1987
-, pages =	"39--45"
-, precedes =	"agss-ltacv-89"
-, update =	"01.07 devillers, 98.07 agarwal, 98.03 mitchell"
+, author =      "A. Aggarwal and L. J. Guibas and J. Saxe and P. W. Shor"
+, title =       "A linear time algorithm for computing the {Voronoi} diagram of a convex polygon"
+, booktitle =   "Proc. 19th Annu. ACM Sympos. Theory Comput."
+, year =        1987
+, pages =       "39--45"
+, precedes =    "agss-ltacv-89"
+, update =      "01.07 devillers, 98.07 agarwal, 98.03 mitchell"
 }
 
 @article{agss-ltacv-89
-, author =	"A. Aggarwal and L. J. Guibas and J. Saxe and P. W. Shor"
-, title =	"A linear-time algorithm for computing the {Voronoi} diagram of a convex polygon"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, number =	6
-, year =	1989
-, pages =	"591--604"
-, keywords =	"convex polygons, Voronoi diagram"
-, succeeds =	"agss-ltacv-87"
-, update =	"01.07 devillers, 98.03 mitchell, 95.05 korneenko"
+, author =      "A. Aggarwal and L. J. Guibas and J. Saxe and P. W. Shor"
+, title =       "A linear-time algorithm for computing the {Voronoi} diagram of a convex polygon"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, number =      6
+, year =        1989
+, pages =       "591--604"
+, keywords =    "convex polygons, Voronoi diagram"
+, succeeds =    "agss-ltacv-87"
+, update =      "01.07 devillers, 98.03 mitchell, 95.05 korneenko"
 }
 
 @inproceedings{ahl-sqrpc-90
-, author =	"A. Aggarwal and M. Hansen and T. Leighton"
-, title =	"Solving query-retrieval problems by compacting {Voronoi} diagrams"
-, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
-, year =	1990
-, pages =	"331--340"
-, keywords =	"Voronoi diagram, searching, separator, filtering search, probabilistic geometry"
-, comments =	"Submitted to J. ACM"
-, update =	"95.05 korneenko"
+, author =      "A. Aggarwal and M. Hansen and T. Leighton"
+, title =       "Solving query-retrieval problems by compacting {Voronoi} diagrams"
+, booktitle =   "Proc. 22nd Annu. ACM Sympos. Theory Comput."
+, year =        1990
+, pages =       "331--340"
+, keywords =    "Voronoi diagram, searching, separator, filtering search, probabilistic geometry"
+, comments =    "Submitted to J. ACM"
+, update =      "95.05 korneenko"
 }
 
 @article{ah-ccbpc-89
-, author =	"A. Aggarwal and M. Hawrylycz"
-, title =	"On computing the closest boundary point on the convex hull"
-, journal =	"Inform. Process. Lett."
-, volume =	31
-, year =	1989
-, pages =	"311--314"
-, keywords =	"proximity, points, convex hull, lower bound"
-, update =	"95.05 korneenko"
+, author =      "A. Aggarwal and M. Hawrylycz"
+, title =       "On computing the closest boundary point on the convex hull"
+, journal =     "Inform. Process. Lett."
+, volume =      31
+, year =        1989
+, pages =       "311--314"
+, keywords =    "proximity, points, convex hull, lower bound"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{aiks-fkpmd-89
-, author =	"A. Aggarwal and H. Imai and N. Katoh and Subhash Suri"
-, title =	"Finding $k$ points with minimum diameter and related problems"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"283--291"
-, precedes =	"aiks-fkpmd-91"
-, cites =	"agss-ltacv-87, as-facle-87, a-imtpr-72, abky-cabmm-88, ddg-fsp-83, h-ca-75, hs-ftp-89, ia-eaggs-86, l-knnvd-82, mos-fmrio-85, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "A. Aggarwal and H. Imai and N. Katoh and Subhash Suri"
+, title =       "Finding $k$ points with minimum diameter and related problems"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "283--291"
+, precedes =    "aiks-fkpmd-91"
+, cites =       "agss-ltacv-87, as-facle-87, a-imtpr-72, abky-cabmm-88, ddg-fsp-83, h-ca-75, hs-ftp-89, ia-eaggs-86, l-knnvd-82, mos-fmrio-85, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{aiks-fkpmd-91
-, author =	"A. Aggarwal and H. Imai and N. Katoh and Subhash Suri"
-, title =	"Finding $k$ points with minimum diameter and related problems"
-, journal =	"J. Algorithms"
-, volume =	12
-, year =	1991
-, pages =	"38--56"
-, succeeds =	"aiks-fkpmd-89"
-, update =	"98.03 mitchell"
+, author =      "A. Aggarwal and H. Imai and N. Katoh and Subhash Suri"
+, title =       "Finding $k$ points with minimum diameter and related problems"
+, journal =     "J. Algorithms"
+, volume =      12
+, year =        1991
+, pages =       "38--56"
+, succeeds =    "aiks-fkpmd-89"
+, update =      "98.03 mitchell"
 }
 
 @article{ak-agmsg-87
-, author =	"A. Aggarwal and M. M. Klawe"
-, title =	"Applications of generalized matrix searching to geometric algorithms"
-, journal =	"Discrete Appl. Math."
-, volume =	27
-, year =	1987
-, pages =	"3--23"
-, keywords =	"monotone matrix, proximity, polygons"
-, update =	"96.09 agarwal, 95.05 korneenko"
+, author =      "A. Aggarwal and M. M. Klawe"
+, title =       "Applications of generalized matrix searching to geometric algorithms"
+, journal =     "Discrete Appl. Math."
+, volume =      27
+, year =        1987
+, pages =       "3--23"
+, keywords =    "monotone matrix, proximity, polygons"
+, update =      "96.09 agarwal, 95.05 korneenko"
 }
 
 @article{akllw-lbapl-91
-, author =	"A. Aggarwal and M. M. Klawe and D. Lichtenstein and N. Linial and A. Wigderson"
-, title =	"A lower bound on the area of permutation layouts"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"241--255"
-, succeeds =	"akllw-mlge-85"
-, update =	"96.09 agarwal"
+, author =      "A. Aggarwal and M. M. Klawe and D. Lichtenstein and N. Linial and A. Wigderson"
+, title =       "A lower bound on the area of permutation layouts"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "241--255"
+, succeeds =    "akllw-mlge-85"
+, update =      "96.09 agarwal"
 }
 
 @inproceedings{akllw-mlge-85
-, author =	"A. Aggarwal and M. M. Klawe and D. Lichtenstein and N. Linial and A. Wigderson"
-, title =	"Multi-layer grid embeddings"
-, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"186--196"
-, precedes =	"akllw-lbapl-91"
-, update =	"96.09 agarwal"
+, author =      "A. Aggarwal and M. M. Klawe and D. Lichtenstein and N. Linial and A. Wigderson"
+, title =       "Multi-layer grid embeddings"
+, booktitle =   "Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "186--196"
+, precedes =    "akllw-lbapl-91"
+, update =      "96.09 agarwal"
 }
 
 @inproceedings{akmsw-gamsa-86
-, author =	"A. Aggarwal and M. M. Klawe and S. Moran and P. W. Shor and R. Wilber"
-, title =	"Geometric applications of a matrix searching algorithm"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"285--292"
-, precedes =	"akmsw-gamsa-87"
-, cites =	"acy-macp-85, am-fcmp-86, atb-mdcp-82, bddg-fep-85, dkssu-owbr-81, lp-annpc-78, mos-fmrio-85, p-scg-77, sd-sgslw-81, s-gc-75, sh-cpp-75, t-ccu-84, t-safnp-83, tb-gaufn-81, ZZZ"
-, update =	"98.07 agarwal, 98.03 bibrelex, 96.09 agarwal, 96.05 agarwal"
+, author =      "A. Aggarwal and M. M. Klawe and S. Moran and P. W. Shor and R. Wilber"
+, title =       "Geometric applications of a matrix searching algorithm"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "285--292"
+, precedes =    "akmsw-gamsa-87"
+, cites =       "acy-macp-85, am-fcmp-86, atb-mdcp-82, bddg-fep-85, dkssu-owbr-81, lp-annpc-78, mos-fmrio-85, p-scg-77, sd-sgslw-81, s-gc-75, sh-cpp-75, t-ccu-84, t-safnp-83, tb-gaufn-81, ZZZ"
+, update =      "98.07 agarwal, 98.03 bibrelex, 96.09 agarwal, 96.05 agarwal"
 }
 
 @article{akmsw-gamsa-87
-, author =	"A. Aggarwal and M. M. Klawe and S. Moran and P. W. Shor and R. Wilber"
-, title =	"Geometric applications of a matrix-searching algorithm"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"195--208"
-, keywords =	"polygons, furthest neighbors, convex polygons, routing"
-, succeeds =	"akmsw-gamsa-86"
-, update =	"98.07 agarwal, 96.09 agarwal, 96.05 agarwal, 95.05 korneenko"
+, author =      "A. Aggarwal and M. M. Klawe and S. Moran and P. W. Shor and R. Wilber"
+, title =       "Geometric applications of a matrix-searching algorithm"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "195--208"
+, keywords =    "polygons, furthest neighbors, convex polygons, routing"
+, succeeds =    "akmsw-gamsa-86"
+, update =      "98.07 agarwal, 96.09 agarwal, 96.05 agarwal, 95.05 korneenko"
 }
 
 @article{ak-ltafa-89
-, author =	"A. Aggarwal and D. Kravets"
-, title =	"A linear time algorithm for finding all farthest neighbors in a convex polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	31
-, number =	1
-, year =	1989
-, pages =	"17--20"
-, keywords =	"convex polygons, furthest neighbors"
-, update =	"95.05 korneenko"
+, author =      "A. Aggarwal and D. Kravets"
+, title =       "A linear time algorithm for finding all farthest neighbors in a convex polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      31
+, number =      1
+, year =        1989
+, pages =       "17--20"
+, keywords =    "convex polygons, furthest neighbors"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{akps-psgma-90
-, author =	"A. Aggarwal and D. Kravets and J. K. Park and S. Sen"
-, title =	"Parallel Searching in Generalized {Monge} Arrays with Applications"
-, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
-, year =	1990
-, pages =	"259--268"
-, update =	"96.09 orourke"
+, author =      "A. Aggarwal and D. Kravets and J. K. Park and S. Sen"
+, title =       "Parallel Searching in Generalized {Monge} Arrays with Applications"
+, booktitle =   "Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
+, year =        1990
+, pages =       "259--268"
+, update =      "96.09 orourke"
 }
 
 @article{am-fcmp-86
-, author =	"A. Aggarwal and R. Melville"
-, title =	"Fast computation of the modality of polygons"
-, journal =	"J. Algorithms"
-, volume =	7
-, number =	3
-, year =	1986
-, pages =	"369--381"
-, keywords =	"polygons, modality"
-, update =	"95.05 korneenko"
+, author =      "A. Aggarwal and R. Melville"
+, title =       "Fast computation of the modality of polygons"
+, journal =     "J. Algorithms"
+, volume =      7
+, number =      3
+, year =        1986
+, pages =       "369--381"
+, keywords =    "polygons, modality"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{amss-cmvvd-89
-, author =	"A. Aggarwal and S. Moran and P. W. Shor and Subhash Suri"
-, title =	"Computing the minimum visible vertex distance between two polygons"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"115--134"
-, keywords =	"proximity, visibility, polygons"
-, update =	"98.03 mitchell, 95.05 korneenko"
+, author =      "A. Aggarwal and S. Moran and P. W. Shor and Subhash Suri"
+, title =       "Computing the minimum visible vertex distance between two polygons"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "115--134"
+, keywords =    "proximity, visibility, polygons"
+, update =      "98.03 mitchell, 95.05 korneenko"
 }
 
 @inproceedings{ap-nsmma-88
-, author =	"A. Aggarwal and J. K. Park"
-, title =	"Notes on searching in multidimensional monotone arrays"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"497--512"
-, comments =	"To appear in J. Algorithms as two papers"
-, update =	"98.07 agarwal"
+, author =      "A. Aggarwal and J. K. Park"
+, title =       "Notes on searching in multidimensional monotone arrays"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "497--512"
+, comments =    "To appear in J. Algorithms as two papers"
+, update =      "98.07 agarwal"
 }
 
 @techreport{ap-psmma-89
-, author =	"A. Aggarwal and J. K. Park"
-, title =	"Parallel searching in Multidimensional Monotone Arrays"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "A. Aggarwal and J. K. Park"
+, title =       "Parallel searching in Multidimensional Monotone Arrays"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ap-ssmma-89
-, author =	"A. Aggarwal and J. K. Park"
-, title =	"Sequential searching multidimensional monotone arrays"
-, institution =	""
-, month =	jun
-, year =	1989
-, update =	"93.09 milone+mitchell"
+, author =      "A. Aggarwal and J. K. Park"
+, title =       "Sequential searching multidimensional monotone arrays"
+, institution = ""
+, month =       jun
+, year =        1989
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{ap-opsml-94
-, author =	"A. Aggarwal and C. G. Plaxton"
-, title =	"Optimal Parallel Sorting in Multi-Level Storage"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"659--668"
-, update =	"99.07 smid, 96.09 orourke"
+, author =      "A. Aggarwal and C. G. Plaxton"
+, title =       "Optimal Parallel Sorting in Multi-Level Storage"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "659--668"
+, update =      "99.07 smid, 96.09 orourke"
 }
 
 @techreport{art-lbcpr-87
-, author =	"A. Aggarwal and P. Raghavan and P. Tiwari"
-, title =	"Lower Bounds for Closest Pair and Related Problems in Simple Polygons"
-, number =	""
-, institution =	"IBM Thomas J. Watson Research Center"
-, address =	"Yorktown Heights, NY"
-, year =	1987
-, update =	"93.09 held"
+, author =      "A. Aggarwal and P. Raghavan and P. Tiwari"
+, title =       "Lower Bounds for Closest Pair and Related Problems in Simple Polygons"
+, number =      ""
+, institution = "IBM Thomas J. Watson Research Center"
+, address =     "Yorktown Heights, NY"
+, year =        1987
+, update =      "93.09 held"
 }
 
 @article{ar-ddsnn-91
-, author =	"A. Aggarwal and P. Raghawan"
-, title =	"Deferred data structures for the nearest-neighbor problem"
-, journal =	"Inform. Process. Lett."
-, volume =	40
-, number =	3
-, year =	1991
-, pages =	"119--122"
-, keywords =	"convex hull, Voronoi diagram, proximity, nearest neighbor, furthest neighbor, deferred data structures"
-, update =	"95.05 korneenko"
+, author =      "A. Aggarwal and P. Raghawan"
+, title =       "Deferred data structures for the nearest-neighbor problem"
+, journal =     "Inform. Process. Lett."
+, volume =      40
+, number =      3
+, year =        1991
+, pages =       "119--122"
+, keywords =    "convex hull, Voronoi diagram, proximity, nearest neighbor, furthest neighbor, deferred data structures"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{ast-fmwkl-93
-, author =	"A. Aggarwal and B. Schieber and T. Tokuyama"
-, title =	"Finding a minimum weight $k$-link path in graphs with {Monge} property and applications"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"189--197"
-, precedes =	"ast-fmwkl-94"
-, cites =	"akmsw-gamsa-87, ap-nsmma-88, at-ciqdp-93, a-dpi-91, blp-despp-92, bddg-fep-85, cegs-dwclp-92, c-sdsno-87, cl-flwsf-90, f-oatp-91, k-sltac-89, kk-altag-88, lh-llc-90, lp-pctow-91, ls-oldpa-91, m-apcad-83, v-pcp-75, w-oqms-91, ZZZ"
-, update =	"98.03 bibrelex, 95.05 korneenko, 93.09 jones"
+, author =      "A. Aggarwal and B. Schieber and T. Tokuyama"
+, title =       "Finding a minimum weight $k$-link path in graphs with {Monge} property and applications"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "189--197"
+, precedes =    "ast-fmwkl-94"
+, cites =       "akmsw-gamsa-87, ap-nsmma-88, at-ciqdp-93, a-dpi-91, blp-despp-92, bddg-fep-85, cegs-dwclp-92, c-sdsno-87, cl-flwsf-90, f-oatp-91, k-sltac-89, kk-altag-88, lh-llc-90, lp-pctow-91, ls-oldpa-91, m-apcad-83, v-pcp-75, w-oqms-91, ZZZ"
+, update =      "98.03 bibrelex, 95.05 korneenko, 93.09 jones"
 }
 
 @article{ast-fmwkl-94
-, author =	"A. Aggarwal and B. Schieber and T. Tokuyama"
-, title =	"Finding a minimum-weight $k$-link path in graphs with the concave {Monge} property and applications"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"263--280"
-, succeeds =	"ast-fmwkl-93"
-, update =	"95.05 korneenko, 95.01 smid"
+, author =      "A. Aggarwal and B. Schieber and T. Tokuyama"
+, title =       "Finding a minimum-weight $k$-link path in graphs with the concave {Monge} property and applications"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "263--280"
+, succeeds =    "ast-fmwkl-93"
+, update =      "95.05 korneenko, 95.01 smid"
 }
 
 @techreport{as-cldsp-89
-, author =	"A. Aggarwal and S. Suri"
-, title =	"Computing the longest diagonal of a simple polygon"
-, type =	"Research {Report}"
-, number =	"14775 (\#66232)"
-, institution =	"IBM"
-, month =	jul
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "A. Aggarwal and S. Suri"
+, title =       "Computing the longest diagonal of a simple polygon"
+, type =        "Research {Report}"
+, number =      "14775 (\#66232)"
+, institution = "IBM"
+, month =       jul
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @article{as-cldsp-90
-, author =	"A. Aggarwal and Subhash Suri"
-, title =	"Computing the longest diagonal of a simple polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	35
-, number =	1
-, year =	1990
-, pages =	"13--18"
-, keywords =	"polygon, diagonal"
-, update =	"98.03 mitchell, 95.05 korneenko, 95.01 smid"
+, author =      "A. Aggarwal and Subhash Suri"
+, title =       "Computing the longest diagonal of a simple polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      35
+, number =      1
+, year =        1990
+, pages =       "13--18"
+, keywords =    "polygon, diagonal"
+, update =      "98.03 mitchell, 95.05 korneenko, 95.01 smid"
 }
 
 @inproceedings{as-facle-87
-, author =	"A. Aggarwal and Subhash Suri"
-, title =	"Fast algorithms for computing the largest empty rectangle"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"278--290"
-, keywords =	"orthogon, extremal figures, empty rectangle"
-, cites =	"akmsw-gamsa-86, af-nfmer-86, cdl-cler-86, mos-fmrio-85, nhl-merp-84, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 95.05 korneenko"
+, author =      "A. Aggarwal and Subhash Suri"
+, title =       "Fast algorithms for computing the largest empty rectangle"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "278--290"
+, keywords =    "orthogon, extremal figures, empty rectangle"
+, cites =       "akmsw-gamsa-86, af-nfmer-86, cdl-cler-86, mos-fmrio-85, nhl-merp-84, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 95.05 korneenko"
 }
 
 @inproceedings{at-iatp-93
-, author =	"Alok Aggarwal and Takeshi Tokuyama"
-, title =	"An Improved Algorithm for the Traveler's Problem"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"476--485"
-, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Alok Aggarwal and Takeshi Tokuyama"
+, title =       "An Improved Algorithm for the Traveler's Problem"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "476--485"
+, update =      "98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{at-ciqdp-93
-, author =	"Alok Aggarwal and Takeshi Tokuyama"
-, title =	"Consecutive Interval Query and Dynamic Programming on Intervals"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"466--475"
-, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Alok Aggarwal and Takeshi Tokuyama"
+, title =       "Consecutive Interval Query and Dynamic Programming on Intervals"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "466--475"
+, update =      "98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @article{av-iocsr-88
-, author =	"A. Aggarwal and J. S. Vitter"
-, title =	"The input/output complexity of sorting and related problems"
-, journal =	"Commun. ACM"
-, volume =	31
-, year =	1988
-, pages =	"1116--1127"
-, update =	"94.05 devillers+franciosa, 93.09 milone+mitchell"
+, author =      "A. Aggarwal and J. S. Vitter"
+, title =       "The input/output complexity of sorting and related problems"
+, journal =     "Commun. ACM"
+, volume =      31
+, year =        1988
+, pages =       "1116--1127"
+, update =      "94.05 devillers+franciosa, 93.09 milone+mitchell"
 }
 
 @techreport{aw-cg-88
-, author =	"A. Aggarwal and J. Wein"
-, title =	"Computational geometry"
-, type =	"Report"
-, number =	"RSS-3"
-, institution =	"Lab. Comput. Sci., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1988
-, keywords =	"lecture notes"
-, annote =	"lecture notes for course 18.409"
+, author =      "A. Aggarwal and J. Wein"
+, title =       "Computational geometry"
+, type =        "Report"
+, number =      "RSS-3"
+, institution = "Lab. Comput. Sci., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1988
+, keywords =    "lecture notes"
+, annote =      "lecture notes for course 18.409"
 }
 
 @article{am-ssrsd-91
-, author =	"Michael E. Agishtein and Alexander A. Migdal"
-, title =	"Smooth Surface Reconstruction From Scattered Data Points"
-, journal =	"Comput. Graph. (UK)"
-, volume =	15
-, number =	1
-, year =	1991
-, pages =	"29--39"
-, keywords =	"triangulation, rational interpolation, surface smoothing, surface reconstruction"
-, update =	"96.09 devillers"
-, annote =	"Uses incremental flip algorithm. Extra point at
-		 infinity. Points are ordered by a plane filling fractal
-		 to speed point location. Extra points are added at cc
-		 centres until tris are small enough."
-, abstract =	"We describe here a new technique and a package for
-		 rapid reconstruction of smooth surfaces from scattered
-		 data points. This method is based on a fast recurrent
-		 algorithm for the Delaunay triangulation followed by
-		 rational interpolation inside triangles. Preprocessing
-		 of data includes sorting and takes N log(N) time.
-		 Afterwards the computational cost is a linear function
-		 of the amount of data. This technique enables a user to
-		 construct a surface of any class of smoothness and
-		 degree of convergence. Our package reconstructs
-		 surfaces that can be uniquely projected either on a
-		 plane or a plane or on a sphere. The graphical section
-		 of this package includes three dimensional
-		 transformations, shading, hidden surface removal,
-		 interactive adding points into triangulation by mouse,
-		 etc. The graphics has been implemented on Iris-4D,
-		 SUN-4 and IBM-5080. (Author abstract) 17 Refs."
+, author =      "Michael E. Agishtein and Alexander A. Migdal"
+, title =       "Smooth Surface Reconstruction From Scattered Data Points"
+, journal =     "Comput. Graph. (UK)"
+, volume =      15
+, number =      1
+, year =        1991
+, pages =       "29--39"
+, keywords =    "triangulation, rational interpolation, surface smoothing, surface reconstruction"
+, update =      "96.09 devillers"
+, annote =      "Uses incremental flip algorithm. Extra point at
+                 infinity. Points are ordered by a plane filling fractal
+                 to speed point location. Extra points are added at cc
+                 centres until tris are small enough."
+, abstract =    "We describe here a new technique and a package for
+                 rapid reconstruction of smooth surfaces from scattered
+                 data points. This method is based on a fast recurrent
+                 algorithm for the Delaunay triangulation followed by
+                 rational interpolation inside triangles. Preprocessing
+                 of data includes sorting and takes N log(N) time.
+                 Afterwards the computational cost is a linear function
+                 of the amount of data. This technique enables a user to
+                 construct a surface of any class of smoothness and
+                 degree of convergence. Our package reconstructs
+                 surfaces that can be uniquely projected either on a
+                 plane or a plane or on a sphere. The graphical section
+                 of this package includes three dimensional
+                 transformations, shading, hidden surface removal,
+                 interactive adding points into triangulation by mouse,
+                 etc. The graphics has been implemented on Iris-4D,
+                 SUN-4 and IBM-5080. (Author abstract) 17 Refs."
 }
 
 @article{a-rmli-54
-, author =	"S. Agmon"
-, title =	"The Relaxation Method for Linear Inequalities"
-, journal =	"Canad. J. Math."
-, volume =	6
-, year =	1954
-, pages =	"382--392"
-, update =	"97.11 bibrelex"
+, author =      "S. Agmon"
+, title =       "The Relaxation Method for Linear Inequalities"
+, journal =     "Canad. J. Math."
+, volume =      6
+, year =        1954
+, pages =       "382--392"
+, update =      "97.11 bibrelex"
 }
 
 @book{a-atfc-76
-, author =	"M. Agoston"
-, title =	"Algebraic Topology: A First Course"
-, series =	"Lecture Notes in Pure and Applied Mathematics"
-, publisher =	"Marcel Dekker"
-, address =	"New York, NY"
-, year =	1976
-, update =	"98.07 bibrelex"
+, author =      "M. Agoston"
+, title =       "Algebraic Topology: A First Course"
+, series =      "Lecture Notes in Pure and Applied Mathematics"
+, publisher =   "Marcel Dekker"
+, address =     "New York, NY"
+, year =        1976
+, update =      "98.07 bibrelex"
 }
 
 @book{a-at-76
-, author =	"M. K. Agoston"
-, title =	"Algebraic Topology"
-, publisher =	"Marcel Dekker Inc"
-, address =	"New York, NY"
-, year =	1976
-, update =	"98.07 bibrelex"
+, author =      "M. K. Agoston"
+, title =       "Algebraic Topology"
+, publisher =   "Marcel Dekker Inc"
+, address =     "New York, NY"
+, year =        1976
+, update =      "98.07 bibrelex"
 }
 
 @article{ar-prdag-94
-, author =	"Amitabh Agrawal and Aristides A. G. Requicha"
-, title =	"A paradigm for the robust design of algorithms for geometric modelling"
-, journal =	"Comput. Graph. Forum"
-, volume =	13
-, number =	3
-, year =	1994
-, pages =	"33--44"
-, note =	"Proc. EUROGRAPHICS '94"
-, keywords =	"geometric modeling, robustness, interval arithmetic, constructive solid geometry"
-, update =	"95.09 korneenko"
+, author =      "Amitabh Agrawal and Aristides A. G. Requicha"
+, title =       "A paradigm for the robust design of algorithms for geometric modelling"
+, journal =     "Comput. Graph. Forum"
+, volume =      13
+, number =      3
+, year =        1994
+, pages =       "33--44"
+, note =        "Proc. EUROGRAPHICS '94"
+, keywords =    "geometric modeling, robustness, interval arithmetic, constructive solid geometry"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{afs-esssd-93
-, author =	"R. Agrawal and C. Faloutsos and A. Swami"
-, title =	"Efficient similarity search in sequence databases"
-, booktitle =	"Proc. 4th Internat. Conf. Foundations of Data Organization and Algorithms"
-, nickname =	"FODO '93"
-, year =	1993
-, update =	"98.07 bibrelex"
+, author =      "R. Agrawal and C. Faloutsos and A. Swami"
+, title =       "Efficient similarity search in sequence databases"
+, booktitle =   "Proc. 4th Internat. Conf. Foundations of Data Organization and Algorithms"
+, nickname =    "FODO '93"
+, year =        1993
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{aggr-aschd-98
-, author =	"R. Agrawal and J. Gehrke and D. Gunopulos and P. Raghavan"
-, title =	"Automatic subspace clustering of high dimensional data for data mining applications"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1998
-, pages =	"94--105"
-, update =	"98.07 agarwal"
+, author =      "R. Agrawal and J. Gehrke and D. Gunopulos and P. Raghavan"
+, title =       "Automatic subspace clustering of high dimensional data for data mining applications"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1998
+, pages =       "94--105"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{ag-icdma-92
-, author =	"R. Agrawal and A. Ghosh and T. Imielinski and B. Iyer and A. Swami"
-, title =	"An Interval Classifier for Database Mining Applications"
-, booktitle =	"Proceedings of the 18th Conference on Very Large Databases"
-, publisher =	"Morgan Kauffman"
-, month =	aug
-, year =	1992
-, pages =	"560--573"
-, update =	"98.07 agarwal"
-, annote =	"marketing example; creates decision rules; compared
+, author =      "R. Agrawal and A. Ghosh and T. Imielinski and B. Iyer and A. Swami"
+, title =       "An Interval Classifier for Database Mining Applications"
+, booktitle =   "Proceedings of the 18th Conference on Very Large Databases"
+, publisher =   "Morgan Kauffman"
+, month =       aug
+, year =        1992
+, pages =       "560--573"
+, update =      "98.07 agarwal"
+, annote =      "marketing example; creates decision rules; compared
                  with CART and ID3; splits continuous values into weak
                  and strong intervals"
 }
 
 @inproceedings{alss-fsspn-95
-, author =	"R. Agrawal and K.-I. Lin and H. S. Sawhney and S. Shim"
-, title =	"Fast similarity search in the presence of noise, scaling and translation in time-series databases"
-, booktitle =	"Proc. 21st VLDB Conference"
-, year =	1995
-, pages =	"490--501"
-, update =	"98.07 bibrelex"
+, author =      "R. Agrawal and K.-I. Lin and H. S. Sawhney and S. Shim"
+, title =       "Fast similarity search in the presence of noise, scaling and translation in time-series databases"
+, booktitle =   "Proc. 21st VLDB Conference"
+, year =        1995
+, pages =       "490--501"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ael-dlptr-85
-, author =	"R. Aharoni and P. Erd{\H o}s and N. Linial"
-, title =	"Dual linear programs and the relationship between their optima"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
-, year =	1985
-, pages =	"476--482"
-, precedes =	"ael-dlptr-88"
+, author =      "R. Aharoni and P. Erd{\H o}s and N. Linial"
+, title =       "Dual linear programs and the relationship between their optima"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Theory Comput."
+, year =        1985
+, pages =       "476--482"
+, precedes =    "ael-dlptr-88"
 }
 
 @article{ael-dlptr-88
-, author =	"R. Aharoni and P. Erd{\H o}s and N. Linial"
-, title =	"Dual linear programs and the relationship between their optima"
-, journal =	"Combinatorica"
-, volume =	8
-, year =	1988
-, pages =	"13--20"
-, succeeds =	"ael-dlptr-85"
+, author =      "R. Aharoni and P. Erd{\H o}s and N. Linial"
+, title =       "Dual linear programs and the relationship between their optima"
+, journal =     "Combinatorica"
+, volume =      8
+, year =        1988
+, pages =       "13--20"
+, succeeds =    "ael-dlptr-85"
 }
 
 @incollection{ah-azube-89
-, author =	"U. Ahlfeld and H.-D. Hecker"
-, title =	"Algorithmen zur {Unimodalit\"at} {Bestimmung} einfacher {Polygone}"
-, booktitle =	"Wiss. Beitr{\"a}ge Martin-Luther-Univ. Halle-Wittenberg"
-, volume =	55
-, publisher =	"??"
-, address =	"Germany"
-, year =	1989
-, pages =	"139--146"
-, keywords =	"polygon, unimodal"
-, update =	"95.05 korneenko"
+, author =      "U. Ahlfeld and H.-D. Hecker"
+, title =       "Algorithmen zur {Unimodalit\"at} {Bestimmung} einfacher {Polygone}"
+, booktitle =   "Wiss. Beitr{\"a}ge Martin-Luther-Univ. Halle-Wittenberg"
+, volume =      55
+, publisher =   "??"
+, address =     "Germany"
+, year =        1989
+, pages =       "139--146"
+, keywords =    "polygon, unimodal"
+, update =      "95.05 korneenko"
 }
 
 @incollection{ah-ehep-91
-, author =	"U. Ahlfeld and H.-D. Hecker"
-, title =	"Eine {Hierarchie} einfacher {Polygone}"
-, booktitle =	"Wiss. Beitr{\"a}ge Martin-Luther-Univ. Halle-Wittenberg"
-, volume =	60
-, publisher =	"??"
-, address =	"Germany"
-, year =	1991
-, pages =	"45--56"
-, keywords =	"simple polygons, taxonomy"
-, update =	"95.05 korneenko"
+, author =      "U. Ahlfeld and H.-D. Hecker"
+, title =       "Eine {Hierarchie} einfacher {Polygone}"
+, booktitle =   "Wiss. Beitr{\"a}ge Martin-Luther-Univ. Halle-Wittenberg"
+, volume =      60
+, publisher =   "??"
+, address =     "Germany"
+, year =        1991
+, pages =       "45--56"
+, keywords =    "simple polygons, taxonomy"
+, update =      "95.05 korneenko"
 }
 
 @article{ah-mwgp-91
-, author =	"U. Ahlfeld and H.-D. Hecker"
-, title =	"Minimal watchman graphs in polygons"
-, journal =	"Research in Informatics"
-, volume =	4
-, publisher =	"Akademie-Verlag"
-, address =	"Berlin, Germany"
-, year =	1991
-, pages =	"126--130"
-, note =	"Geobild '91"
-, keywords =	"watchman problem, polygons, visibility"
-, update =	"95.05 korneenko"
+, author =      "U. Ahlfeld and H.-D. Hecker"
+, title =       "Minimal watchman graphs in polygons"
+, journal =     "Research in Informatics"
+, volume =      4
+, publisher =   "Akademie-Verlag"
+, address =     "Berlin, Germany"
+, year =        1991
+, pages =       "126--130"
+, note =        "Geobild '91"
+, keywords =    "watchman problem, polygons, visibility"
+, update =      "95.05 korneenko"
 }
 
 @article{ahh-suusm-88
-, author =	"U. Ahlfeld and H.-D. Hecker"
-, title =	"Strenge {Unimodalit\"at} und strenge monotonie einfacher {Polygone}"
-, journal =	"Wiss. Z. P{\"a}dagog. Hochschule ``K. W. F. Wander'', Dresden. Math. Naturwiss. R."
-, volume =	22
-, year =	1988
-, pages =	"29--33"
-, keywords =	"polygon, monotone, unimodal"
-, update =	"98.07 bibrelex, 95.05 korneenko"
+, author =      "U. Ahlfeld and H.-D. Hecker"
+, title =       "Strenge {Unimodalit\"at} und strenge monotonie einfacher {Polygone}"
+, journal =     "Wiss. Z. P{\"a}dagog. Hochschule ``K. W. F. Wander'', Dresden. Math. Naturwiss. R."
+, volume =      22
+, year =        1988
+, pages =       "29--33"
+, keywords =    "polygon, monotone, unimodal"
+, update =      "98.07 bibrelex, 95.05 korneenko"
 }
 
 @article{ah-ccsgs-92
-, author =	"U. Ahlfeld and H.-D. Hecker"
-, title =	"The computational complexity of some guard sets in polygons"
-, journal =	"J. Information Processing and Cybernetics"
-, volume =	28
-, number =	6
-, year =	1992
-, pages =	"331--342"
-, keywords =	"watchman problem, NP-completeness, polygons"
-, update =	"95.05 korneenko"
+, author =      "U. Ahlfeld and H.-D. Hecker"
+, title =       "The computational complexity of some guard sets in polygons"
+, journal =     "J. Information Processing and Cybernetics"
+, volume =      28
+, number =      6
+, year =        1992
+, pages =       "331--342"
+, keywords =    "watchman problem, NP-completeness, polygons"
+, update =      "95.05 korneenko"
 }
 
 @book{a-ca-66
-, author =	"L. V. Ahlfors"
-, title =	"Complex Analysis"
-, publisher =	"McGraw-Hill"
-, year =	1966
-, update =	"98.03 bibrelex"
+, author =      "L. V. Ahlfors"
+, title =       "Complex Analysis"
+, publisher =   "McGraw-Hill"
+, year =        1966
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{abbchms-soc-97
-, author =	"H.-K. Ahn and M. de Berg and P. Bose and S.-W. Cheng and D. Halperin and J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"Separating an Object from its Cast"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"221--230"
-, cites =	"abbgotwz-fds-93, b-gcamp-95, bbk-dcsp-94, bkt-fpm-93, bt-gcamp-94, ccw-pdmdd-93, e-cit-88, fm-gaim-93, g-oppws-93, gs-pmgsc-85, h-cgpm-91, h-gamp-97, ht-mdsoh-92, k-caplp-92, mgj-cfufp-96, m-ept-92, ms-tdctd-93, orsw-ipaw-95, ps-cgi-85, p-mrisf-87, rr-mcp-92, t-mss-85, wo-ich-81, wl-grama-94, ZZZ"
-, update =	"98.07 agarwal+bibrelex, 97.07 efrat"
+, author =      "H.-K. Ahn and M. de Berg and P. Bose and S.-W. Cheng and D. Halperin and J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "Separating an Object from its Cast"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "221--230"
+, cites =       "abbgotwz-fds-93, b-gcamp-95, bbk-dcsp-94, bkt-fpm-93, bt-gcamp-94, ccw-pdmdd-93, e-cit-88, fm-gaim-93, g-oppws-93, gs-pmgsc-85, h-cgpm-91, h-gamp-97, ht-mdsoh-92, k-caplp-92, mgj-cfufp-96, m-ept-92, ms-tdctd-93, orsw-ipaw-95, ps-cgi-85, p-mrisf-87, rr-mcp-92, t-mss-85, wo-ich-81, wl-grama-94, ZZZ"
+, update =      "98.07 agarwal+bibrelex, 97.07 efrat"
 }
 
 @inproceedings{acc-csed-98
-, author =	"H.-K. Ahn and S.-W. Cheng and O. Cheong"
-, title =	"Casting with skewed ejection direction"
-, booktitle =	"Proc. 9th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '98"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1533
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"139--148"
-, update =	"00.03 smid"
+, author =      "H.-K. Ahn and S.-W. Cheng and O. Cheong"
+, title =       "Casting with skewed ejection direction"
+, booktitle =   "Proc. 9th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '98"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1533
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "139--148"
+, update =      "00.03 smid"
 }
 
 @inproceedings{acmv-rpbcc-00
-, author =	"Hee-Kap Ahn and Otfried Cheong and Ji{\v r}{\'i} Matou{\v s}ek and Antoine Vigneron"
-, title =	"Reachability by Paths of Bounded Curvature in Convex Polygons"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"251--259"
-, update =	"00.11 jones"
+, author =      "Hee-Kap Ahn and Otfried Cheong and Ji{\v r}{\'i} Matou{\v s}ek and Antoine Vigneron"
+, title =       "Reachability by Paths of Bounded Curvature in Convex Polygons"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "251--259"
+, update =      "00.11 jones"
 }
 
 @inproceedings{acs-bcrrp-01
-, author =	"Hee-Kap Ahn and Otfried Cheong and Chan-Su Shin"
-, title =	"Bridging Convex Regions and Related Problems"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"53--56"
-, update =	"01.04 icking"
+, author =      "Hee-Kap Ahn and Otfried Cheong and Chan-Su Shin"
+, title =       "Bridging Convex Regions and Related Problems"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "53--56"
+, update =      "01.04 icking"
 }
 
 @article{af-panp-84
-, author =	"J. Ahn and H. Freeman"
-, title =	"A program for automatic name placement"
-, journal =	"Cartographica"
-, volume =	21
-, number =	"2--3"
-, year =	1984
-, pages =	"101--109"
-, update =	"97.07 agarwal"
+, author =      "J. Ahn and H. Freeman"
+, title =       "A program for automatic name placement"
+, journal =     "Cartographica"
+, volume =      21
+, number =      "2--3"
+, year =        1984
+, pages =       "101--109"
+, update =      "97.07 agarwal"
 }
 
 @incollection{a-afps-90
-, author =	"A. V. Aho"
-, title =	"Algorithms for finding patterns in strings"
-, booktitle =	"Algorithms and Complexity"
-, series =	"Handbook of Theoretical Computer Science"
-, volume =	"A"
-, publisher =	"Elsevier"
-, year =	1990
-, pages =	"255--400"
-, update =	"98.07 bibrelex"
+, author =      "A. V. Aho"
+, title =       "Algorithms for finding patterns in strings"
+, booktitle =   "Algorithms and Complexity"
+, series =      "Handbook of Theoretical Computer Science"
+, volume =      "A"
+, publisher =   "Elsevier"
+, year =        1990
+, pages =       "255--400"
+, update =      "98.07 bibrelex"
 }
 
 @article{agh-rstes-77
-, author =	"A. V. Aho and M. R. Garey and F. K. Hwang"
-, title =	"Rectilinear {Steiner} trees: efficient special case algorithms"
-, journal =	"Networks"
-, volume =	7
-, year =	1977
-, pages =	"37--58"
-, keywords =	"Steiner trees, $L_{1}$-metric"
-, update =	"95.05 korneenko"
+, author =      "A. V. Aho and M. R. Garey and F. K. Hwang"
+, title =       "Rectilinear {Steiner} trees: efficient special case algorithms"
+, journal =     "Networks"
+, volume =      7
+, year =        1977
+, pages =       "37--58"
+, keywords =    "Steiner trees, $L_{1}$-metric"
+, update =      "95.05 korneenko"
 }
 
 @book{ahu-dsa-83
-, author =	"A. V. Aho and J. E. Hopcroft and J. D. Ullman"
-, title =	"Data Structures and Algorithms"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1983
+, author =      "A. V. Aho and J. E. Hopcroft and J. D. Ullman"
+, title =       "Data Structures and Algorithms"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1983
 }
 
 @book{ahu-daca-74
-, author =	"A. V. Aho and J. E. Hopcroft and J. D. Ullman"
-, title =	"The Design and Analysis of Computer Algorithms"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1974
+, author =      "A. V. Aho and J. E. Hopcroft and J. D. Ullman"
+, title =       "The Design and Analysis of Computer Algorithms"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1974
 }
 
 @article{au-opmrw-79
-, author =	"A. V. Aho and J. D. Ullman"
-, title =	"Optimal partial-match retrieval when fields are independently specified"
-, journal =	"ACM Trans. Database Syst."
-, volume =	4
-, year =	1979
-, pages =	"168--179"
+, author =      "A. V. Aho and J. D. Ullman"
+, title =       "Optimal partial-match retrieval when fields are independently specified"
+, journal =     "ACM Trans. Database Syst."
+, volume =      4
+, year =        1979
+, pages =       "168--179"
 }
 
 @article{an-ormo-84
-, author =	"A. Ahuja and C. Nash"
-, title =	"Octree representation of moving objects"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	26
-, year =	1984
-, pages =	"207--216"
-, keywords =	"data structuring, octree"
-, update =	"95.05 korneenko"
+, author =      "A. Ahuja and C. Nash"
+, title =       "Octree representation of moving objects"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      26
+, year =        1984
+, pages =       "207--216"
+, keywords =    "data structuring, octree"
+, update =      "95.05 korneenko"
 }
 
 @article{ac-gcd-68
-, author =	"D. V. Ahuja and S. A. Coons"
-, title =	"Geometry for construction and display"
-, journal =	"IBM Syst. J."
-, volume =	7
-, year =	1968
-, pages =	"188--205"
+, author =      "D. V. Ahuja and S. A. Coons"
+, title =       "Geometry for construction and display"
+, journal =     "IBM Syst. J."
+, volume =      7
+, year =        1968
+, pages =       "188--205"
 }
 
 @inproceedings{a-dppuv-80
-, author =	"N. Ahuja"
-, title =	"Dot pattern processing using {Voronoi} polygons as neighborhoods"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
-, site =	"Miami Beach, FL"
-, year =	1980
-, pages =	"1122--1127"
-, precedes =	"a-dppuv-82"
+, author =      "N. Ahuja"
+, title =       "Dot pattern processing using {Voronoi} polygons as neighborhoods"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Pattern Recogn."
+, site =        "Miami Beach, FL"
+, year =        1980
+, pages =       "1122--1127"
+, precedes =    "a-dppuv-82"
 }
 
 @article{a-dppuv-82
-, author =	"N. Ahuja"
-, title =	"Dot pattern processing using {Voronoi} polygons as neighborhoods"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	4
-, year =	1982
-, pages =	"336--343"
-, succeeds =	"a-dppuv-80"
+, author =      "N. Ahuja"
+, title =       "Dot pattern processing using {Voronoi} polygons as neighborhoods"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      4
+, year =        1982
+, pages =       "336--343"
+, succeeds =    "a-dppuv-80"
 }
 
 @article{aas-iruvt-85
-, author =	"N. Ahuja and B. An and B. Schachter"
-, title =	"Image Representation Using {Voronoi} Tessellation"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	29
-, year =	1985
-, pages =	"286--295"
-, annote =	"Suggests using Voronoi cells as primitives to
-		 represent an image."
+, author =      "N. Ahuja and B. An and B. Schachter"
+, title =       "Image Representation Using {Voronoi} Tessellation"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      29
+, year =        1985
+, pages =       "286--295"
+, annote =      "Suggests using Voronoi cells as primitives to
+                 represent an image."
 }
 
 @inproceedings{acyb-idcat-80
-, author =	"N. Ahuja and R. T. Chien and R. Yen and N. Birdwell"
-, title =	"Interference detection and collision avoidance among three dimensional objects"
-, booktitle =	"Proc. 1st Nat. Conf. Artificial Intell."
-, site =	"Palo Alto, CA"
-, year =	1980
-, pages =	"44--48"
+, author =      "N. Ahuja and R. T. Chien and R. Yen and N. Birdwell"
+, title =       "Interference detection and collision avoidance among three dimensional objects"
+, booktitle =   "Proc. 1st Nat. Conf. Artificial Intell."
+, site =        "Palo Alto, CA"
+, year =        1980
+, pages =       "44--48"
 }
 
 @inproceedings{ah-amat-84
-, author =	"N. Ahuja and W. Hoff"
-, title =	"Augmented Medial Axis Transform"
-, booktitle =	"Proceedings of Workshop on Computer Vision, Representation and Control"
-, year =	1984
-, pages =	"251--256"
-, annote =	"Representation of 2D shape by MAT (overlapping
-		 blocks). AMAT adds adjacency info for blocks. Build
-		 from DT of block centres."
+, author =      "N. Ahuja and W. Hoff"
+, title =       "Augmented Medial Axis Transform"
+, booktitle =   "Proceedings of Workshop on Computer Vision, Representation and Control"
+, year =        1984
+, pages =       "251--256"
+, annote =      "Representation of 2D shape by MAT (overlapping
+                 blocks). AMAT adds adjacency info for blocks. Build
+                 from DT of block centres."
 }
 
 @article{as-mpabu-84
-, author =	"N. Ahuja and S. Swamy"
-, title =	"Multiprocessor pyramid architectures for bottom-up image analysis"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-6"
-, year =	1984
-, pages =	"463--474"
-, update =	"97.11 bibrelex"
+, author =      "N. Ahuja and S. Swamy"
+, title =       "Multiprocessor pyramid architectures for bottom-up image analysis"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-6"
+, year =        1984
+, pages =       "463--474"
+, update =      "97.11 bibrelex"
 }
 
 @article{av-gooso-89
-, author =	"N. Ahuja and J. Veenstra"
-, title =	"Generating Octrees from Object Silhouettes in orthographic views"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	11
-, year =	1989
-, pages =	"137--149"
-, update =	"98.11 bibrelex"
+, author =      "N. Ahuja and J. Veenstra"
+, title =       "Generating Octrees from Object Silhouettes in orthographic views"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      11
+, year =        1989
+, pages =       "137--149"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{amo-nf-90
-, author =	"R. K. Ahuja and T. L. Magnanti and J. B. Orlin"
-, title =	"Network Flows"
-, editor =	"G. L. Nemhauser and A. H. G. {Rinnooy Kan} and M. J. Todd"
-, booktitle =	"Optimization"
-, series =	"Handbooks in Operations Research and Management"
-, volume =	1
-, publisher =	"North-Holland"
-, year =	1990
-, pages =	"211--360"
-, update =	"97.11 bibrelex"
+, author =      "R. K. Ahuja and T. L. Magnanti and J. B. Orlin"
+, title =       "Network Flows"
+, editor =      "G. L. Nemhauser and A. H. G. {Rinnooy Kan} and M. J. Todd"
+, booktitle =   "Optimization"
+, series =      "Handbooks in Operations Research and Management"
+, volume =      1
+, publisher =   "North-Holland"
+, year =        1990
+, pages =       "211--360"
+, update =      "97.11 bibrelex"
 }
 
 @book{amo-nftaa-93
-, author =	"R. K. Ahuja and T. L. Magnanti and J. B. Orlin"
-, title =	"Network Flows: Theory, Algorithms, and Applications"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1993
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "R. K. Ahuja and T. L. Magnanti and J. B. Orlin"
+, title =       "Network Flows: Theory, Algorithms, and Applications"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1993
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @inproceedings{a-e01ss-98
-, author =	"Oswin Aichholzer"
-, title =	"Efficient \{0,1\}-String Searching Based on Pre-Clustering"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"11--13"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Oswin Aichholzer"
+, title =       "Efficient \{0,1\}-String Searching Based on Pre-Clustering"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "11--13"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{a-lpt-95
-, author =	"Oswin Aichholzer"
-, title =	"Local Properties of Triangulations"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"33--36"
-, update =	"00.03 bibrelex"
+, author =      "Oswin Aichholzer"
+, title =       "Local Properties of Triangulations"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "33--36"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{a-pt-97
-, author =	"Oswin Aichholzer"
-, title =	"The Path of a Triangulation"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"1--3"
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Oswin Aichholzer"
+, title =       "The Path of a Triangulation"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "1--3"
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{a-pt-99
-, author =	"Oswin Aichholzer"
-, title =	"The Path of a Triangulation"
-, booktitle =	"Proc. 15th Ann. Sympos. Comput. Geom."
-, nickname =	"SCG'99"
-, year =	1999
-, pages =	"14--23"
-, update =	"02.03 pocchiola"
+, author =      "Oswin Aichholzer"
+, title =       "The Path of a Triangulation"
+, booktitle =   "Proc. 15th Ann. Sympos. Comput. Geom."
+, nickname =    "SCG'99"
+, year =        1999
+, pages =       "14--23"
+, update =      "02.03 pocchiola"
 }
 
 @article{aaag-ntsp-95
-, author =	"O. Aichholzer and D. Alberts and F. Aurenhammer and B. G{\"a}rtner"
-, title =	"A Novel Type of Skeleton for Polygons"
-, journal =	"J. Universal Comput. Sci."
-, volume =	1
-, number =	12
-, year =	1995
-, pages =	"752--761"
-, update =	"97.03 gaertner+salinger"
+, author =      "O. Aichholzer and D. Alberts and F. Aurenhammer and B. G{\"a}rtner"
+, title =       "A Novel Type of Skeleton for Polygons"
+, journal =     "J. Universal Comput. Sci."
+, volume =      1
+, number =      12
+, year =        1995
+, pages =       "752--761"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{aah-fps-01
-, author =	"Oswin Aichholzer and Lyuba S. Alboul and Ferran Hurtado"
-, title =	"On Flips in Polyhedral Surfaces"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"27--30"
-, update =	"01.04 icking"
+, author =      "Oswin Aichholzer and Lyuba S. Alboul and Ferran Hurtado"
+, title =       "On Flips in Polyhedral Surfaces"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "27--30"
+, update =      "01.04 icking"
 }
 
 @inproceedings{aa-chh-94
-, author =	"Oswin Aichholzer and Franz Aurenhammer"
-, title =	"Classifying Hyperplanes in Hypercubes"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"53--57"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Oswin Aichholzer and Franz Aurenhammer"
+, title =       "Classifying Hyperplanes in Hypercubes"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "53--57"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @techreport{aa-skfgpf-95
-, author =	"O. Aichholzer and F. Aurenhammer"
-, title =	"Straight skeletons for general polygonal figures"
-, number =	432
-, institution =	"Inst. for Theor. Comput. Sci., Graz Univ. of Technology, Graz, Austria"
-, year =	1995
-, precedes =	"aa-ssgpf-96"
-, update =	"00.03 bibrelex"
+, author =      "O. Aichholzer and F. Aurenhammer"
+, title =       "Straight skeletons for general polygonal figures"
+, number =      432
+, institution = "Inst. for Theor. Comput. Sci., Graz Univ. of Technology, Graz, Austria"
+, year =        1995
+, precedes =    "aa-ssgpf-96"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{aa-ssgpf-96
-, author =	"Oswin Aichholzer and Franz Aurenhammer"
-, title =	"Straight skeletons for general polygonal figures in the plane"
-, booktitle =	"Proc. 2nd Ann. Internat. Conf. Computing and Combinatorics"
-, nickname =	"COCOON '96"
-, site =	"Hong Kong"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1090
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"117--126"
-, succeeds =	"aa-skfgpf-95"
-, update =	"00.11 smid, 00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
+, author =      "Oswin Aichholzer and Franz Aurenhammer"
+, title =       "Straight skeletons for general polygonal figures in the plane"
+, booktitle =   "Proc. 2nd Ann. Internat. Conf. Computing and Combinatorics"
+, nickname =    "COCOON '96"
+, site =        "Hong Kong"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1090
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "117--126"
+, succeeds =    "aa-skfgpf-95"
+, update =      "00.11 smid, 00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
 }
 
 @incollection{aa-ssgpf-98
-, author =	"O. Aichholzer and F. Aurenhammer"
-, title =	"Straight skeletons for general polygonal figures in the plane"
-, editor =	"P. Engel and H. Syta"
-, booktitle =	"Voronoi's Impact on Modern Science, Book 2"
-, publisher =	"Institute of Mathematics of the National Academy of Sciences of Ukraine"
-, address =	"Kyiv"
-, year =	1998
-, pages =	"7--21"
-, succeeds =	"aa-ssgpf-96"
-, update =	"00.11 smid"
+, author =      "O. Aichholzer and F. Aurenhammer"
+, title =       "Straight skeletons for general polygonal figures in the plane"
+, editor =      "P. Engel and H. Syta"
+, booktitle =   "Voronoi's Impact on Modern Science, Book 2"
+, publisher =   "Institute of Mathematics of the National Academy of Sciences of Ukraine"
+, address =     "Kyiv"
+, year =        1998
+, pages =       "7--21"
+, succeeds =    "aa-ssgpf-96"
+, update =      "00.11 smid"
 }
 
 @inproceedings{aaclmp-vddsd-97
-, author =	"O. Aichholzer and F. Aurenhammer and D. Chen and D. Lee and A. Mukhopadhyay and E. Papadopoulou"
-, title =	"Voronoi Diagrams for Direction-Sensitive Distances"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"418--420"
-, cites =	"ak-eama-87, cd-vdbcd-85, f-savd-87, ks-ossaf-85, k-cavd-89, ld-gvdp-81, mmp-dgp-87, mp-wrpfs-91, s-icpps-85, s-vdr-92, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "O. Aichholzer and F. Aurenhammer and D. Chen and D. Lee and A. Mukhopadhyay and E. Papadopoulou"
+, title =       "Voronoi Diagrams for Direction-Sensitive Distances"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "418--420"
+, cites =       "ak-eama-87, cd-vdbcd-85, f-savd-87, ks-ossaf-85, k-cavd-89, ld-gvdp-81, mmp-dgp-87, mp-wrpfs-91, s-icpps-85, s-vdr-92, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{aacktrx-tin-96
-, author =	"Oswin Aichholzer and Franz Aurenhammer and Siu-Wing Cheng and Naoki Katoh and Michael Taschwer and G{\"u}nter Rote and Yin-Feng Xu"
-, title =	"Triangulations Intersect Nicely"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, year =	1996
-, pages =	"339--359"
-, keywords =	"matching, minimum weight triangulation, greedy triangulation"
-, succeeds =	"aatr-tin-95, cx-cistp-95"
-, update =	"01.07 devillers, 97.03 rote"
-, abstract =	"We show that there is a matching between the edges of any two
-		triangulations of a planar point set such that an edge of one
-		triangulation is matched either to the identical edge in the other
-		triangulation or to an edge that crosses it. This theorem also
-		holds for the triangles of the triangulations and in general
-		independence systems. As an application we give some lower
-		bounds for the minimum weight triangulation which can be
-		computed in polynomial time by matching and network flow
-		techniques. We exhibit an easy-to-recognize class of point sets
-		for which the minimum-weight triangulation coincides with the
-		greedy triangulation."
+, author =      "Oswin Aichholzer and Franz Aurenhammer and Siu-Wing Cheng and Naoki Katoh and Michael Taschwer and G{\"u}nter Rote and Yin-Feng Xu"
+, title =       "Triangulations Intersect Nicely"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, year =        1996
+, pages =       "339--359"
+, keywords =    "matching, minimum weight triangulation, greedy triangulation"
+, succeeds =    "aatr-tin-95, cx-cistp-95"
+, update =      "01.07 devillers, 97.03 rote"
+, abstract =    "We show that there is a matching between the edges of any two
+                triangulations of a planar point set such that an edge of one
+                triangulation is matched either to the identical edge in the other
+                triangulation or to an edge that crosses it. This theorem also
+                holds for the triangles of the triangulations and in general
+                independence systems. As an application we give some lower
+                bounds for the minimum weight triangulation which can be
+                computed in polynomial time by matching and network flow
+                techniques. We exhibit an easy-to-recognize class of point sets
+                for which the minimum-weight triangulation coincides with the
+                greedy triangulation."
 }
 
 @article{aahk-tct-02
-, author =	"Oswin Aichholzer and Franz Aurenhammer and Ferran Hurtado and Hannes Krasser"
-, title =	"Towards compatible triangulations"
-, journal =	"Theoret. Comput. Sci."
-, volume =	"??"
-, year =	2002
-, pages =	"??--??"
-, url =	"http://www.cis.TUGraz.at/igi/oaich/publications.html"
-, succeeds =	"aak-ctps-01"
-, update =	"02.03 orourke"
+, author =      "Oswin Aichholzer and Franz Aurenhammer and Ferran Hurtado and Hannes Krasser"
+, title =       "Towards compatible triangulations"
+, journal =     "Theoret. Comput. Sci."
+, volume =      "??"
+, year =        2002
+, pages =       "??--??"
+, url = "http://www.cis.TUGraz.at/igi/oaich/publications.html"
+, succeeds =    "aak-ctps-01"
+, update =      "02.03 orourke"
 }
 
 @techreport{aaiklr-psac-97
-, author =	"Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
-, title =	"$\varphi$-Self-Approaching Curves"
-, number =	226
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1997
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr226.pdf"
-, precedes =	"aaiklr-gsac-98"
-, update =	"99.03 bibrelex, 98.07 icking"
+, author =      "Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
+, title =       "$\varphi$-Self-Approaching Curves"
+, number =      226
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1997
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr226.pdf"
+, precedes =    "aaiklr-gsac-98"
+, update =      "99.03 bibrelex, 98.07 icking"
 }
 
 @inproceedings{aaiklr-gsac-98
-, author =	"Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
-, title =	"Generalized Self-Approaching Curves"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"15--17"
-, succeeds =	"aaiklr-psac-97"
-, precedes =	"aaiklr-gsac-98p"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 bibrelex"
+, author =      "Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
+, title =       "Generalized Self-Approaching Curves"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "15--17"
+, succeeds =    "aaiklr-psac-97"
+, precedes =    "aaiklr-gsac-98p"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{aaiklr-gsac-98p
-, author =	"Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
-, title =	"Generalized Self-Approaching Curves"
-, booktitle =	"Proc. 9th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '98"
-, site =	"Taejon"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1533
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"317--326"
-, succeeds =	"aaiklr-gsac-98"
-, precedes =	"aaiklr-gsac-01"
-, update =	"01.04 icking, 99.03 bibrelex"
+, author =      "Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
+, title =       "Generalized Self-Approaching Curves"
+, booktitle =   "Proc. 9th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '98"
+, site =        "Taejon"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1533
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "317--326"
+, succeeds =    "aaiklr-gsac-98"
+, precedes =    "aaiklr-gsac-01"
+, update =      "01.04 icking, 99.03 bibrelex"
 }
 
 @article{aaiklr-gsac-01
-, author =	"Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
-, title =	"Generalized Self-Approaching Curves"
-, journal =	"Discrete Appl. Math."
-, volume =	109
-, year =	2001
-, pages =	"3--24"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr226.pdf"
-, succeeds =	"aaiklr-gsac-98p"
-, cites =	"admss-esstl-95, cfg-upg-90, ik-skpcs-95, ikl-sac-99, lc-tasso-99, lsksc-ncssu-97, ls-pinos-97, r-cic-94, rs-addce-91, ZZZ"
-, update =	"01.04 icking"
+, author =      "Oswin Aichholzer and Franz Aurenhammer and Christian Icking and Rolf Klein and Elmar Langetepe and G{\"u}nter Rote"
+, title =       "Generalized Self-Approaching Curves"
+, journal =     "Discrete Appl. Math."
+, volume =      109
+, year =        2001
+, pages =       "3--24"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr226.pdf"
+, succeeds =    "aaiklr-gsac-98p"
+, cites =       "admss-esstl-95, cfg-upg-90, ik-skpcs-95, ikl-sac-99, lc-tasso-99, lsksc-ncssu-97, ls-pinos-97, r-cic-94, rs-addce-91, ZZZ"
+, update =      "01.04 icking"
 }
 
 @inproceedings{aak-eotsp-01
-, author =	"Oswin Aichholzer and Franz Aurenhammer and Hannes Krasser"
-, title =	"Enumerating order types for small point sets with applications"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
-, year =	2001
-, pages =	"11--18"
-, update =	"01.11 pocchiola"
+, author =      "Oswin Aichholzer and Franz Aurenhammer and Hannes Krasser"
+, title =       "Enumerating order types for small point sets with applications"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Comput. Geom."
+, year =        2001
+, pages =       "11--18"
+, update =      "01.11 pocchiola"
 }
 
 @inproceedings{aak-ctps-01
-, author =	"Oswin Aichholzer and Franz Aurenhammer and Hannes Krasser"
-, title =	"On Compatible Triangulations of Point Sets"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"23--26"
-, update =	"01.04 icking"
+, author =      "Oswin Aichholzer and Franz Aurenhammer and Hannes Krasser"
+, title =       "On Compatible Triangulations of Point Sets"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "23--26"
+, update =      "01.04 icking"
 }
 
 @inproceedings{aarx-clgta-96
-, author =	"Oswin Aichholzer and Franz Aurenhammer and G{\"u}nter Rote and Yin-Feng Xu"
-, title =	"Constant-level greedy triangulations approximate the MWT well"
-, editor =	"Ding-Zhu Du and Xiang-Sun Zhang and Kan Cheng"
-, booktitle =	"Proc. Second Internat. Symp. Operations Research and its Applications, Guilin, China, December 11--13, 1996"
-, series =	"Lecture Notes in Operations Research"
-, volume =	2
-, publisher =	"World Publishing Corp."
-, address =	"Beijing"
-, year =	1996
-, pages =	"309--318"
-, precedes =	"aarx-clgta-97"
-, update =	"97.11 bibrelex, 97.03 rote"
+, author =      "Oswin Aichholzer and Franz Aurenhammer and G{\"u}nter Rote and Yin-Feng Xu"
+, title =       "Constant-level greedy triangulations approximate the MWT well"
+, editor =      "Ding-Zhu Du and Xiang-Sun Zhang and Kan Cheng"
+, booktitle =   "Proc. Second Internat. Symp. Operations Research and its Applications, Guilin, China, December 11--13, 1996"
+, series =      "Lecture Notes in Operations Research"
+, volume =      2
+, publisher =   "World Publishing Corp."
+, address =     "Beijing"
+, year =        1996
+, pages =       "309--318"
+, precedes =    "aarx-clgta-97"
+, update =      "97.11 bibrelex, 97.03 rote"
 }
 
 @inproceedings{aarx-clgta-97
-, author =	"Oswin Aichholzer and Franz Aurenhammer and G{\"u}nter Rote and Yin-Feng Xu"
-, title =	"Constant-level greedy triangulations approximate the {MWT} well"
-, booktitle =	"??"
-, journal =	"Journal of Combinatorial Optimization"
-, volume =	"2?"
-, year =	"1998?"
-, pages =	"??--??"
-, note =	"to appear"
-, succeeds =	"aarx-clgta-96"
-, update =	"98.07 rote, 98.03 mitchell, 97.03 rote"
-, abstract =	"Exploiting the concept of so-called light edges, we introduce
-		a new way of defining the greedy triangulation GT(S) of a point
-		set S.  It provides a decomposition of
-		GT(S) into levels, and the number of levels allows us to
-		bound the total edge length of GT(S). In particular, we show
-		|GT(S)| <= $3 \times 2^{k+1}$ |MWT(S)|, where k is the number of
-		levels and MWT(S) is the minimum-weight triangulation
-		of S. This constitutes the first non-trivial upper bound on
-		|GT(S)| for general points sets S."
+, author =      "Oswin Aichholzer and Franz Aurenhammer and G{\"u}nter Rote and Yin-Feng Xu"
+, title =       "Constant-level greedy triangulations approximate the {MWT} well"
+, booktitle =   "??"
+, journal =     "Journal of Combinatorial Optimization"
+, volume =      "2?"
+, year =        "1998?"
+, pages =       "??--??"
+, note =        "to appear"
+, succeeds =    "aarx-clgta-96"
+, update =      "98.07 rote, 98.03 mitchell, 97.03 rote"
+, abstract =    "Exploiting the concept of so-called light edges, we introduce
+                a new way of defining the greedy triangulation GT(S) of a point
+                set S.  It provides a decomposition of
+                GT(S) into levels, and the number of levels allows us to
+                bound the total edge length of GT(S). In particular, we show
+                |GT(S)| <= $3 \times 2^{k+1}$ |MWT(S)|, where k is the number of
+                levels and MWT(S) is the minimum-weight triangulation
+                of S. This constitutes the first non-trivial upper bound on
+                |GT(S)| for general points sets S."
 }
 
 @inproceedings{aatr-tin-95
-, author =	"Oswin Aichholzer and Franz Aurenhammer and Michael Taschwer and G{\"u}nter Rote"
-, title =	"Triangulations Intersect Nicely"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"220--229"
-, keywords =	"matching, minimum weight triangulation, greedy triangulation"
-, precedes =	"aacktrx-tin-96"
-, cites =	"b-gtic-79, cx-cistp-95, dfpn-stdt-88, ddmw-fgta-94, dds-saeid-92, dra-sltgt-95, e-atccd-90, gj-cigtn-79, g-segta-89, hk-nammb-73, k-csmwt-94, ll-fagt-92, l-esta-94, l-conm-76, l-scsi-77, t-dsna-83, w-eucdt-93, x-mwtpp-92, yxy-cdapp-94, ZZZ"
-, update =	"98.03 bibrelex, 97.03 rote, 95.09 mitchell"
+, author =      "Oswin Aichholzer and Franz Aurenhammer and Michael Taschwer and G{\"u}nter Rote"
+, title =       "Triangulations Intersect Nicely"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "220--229"
+, keywords =    "matching, minimum weight triangulation, greedy triangulation"
+, precedes =    "aacktrx-tin-96"
+, cites =       "b-gtic-79, cx-cistp-95, dfpn-stdt-88, ddmw-fgta-94, dds-saeid-92, dra-sltgt-95, e-atccd-90, gj-cigtn-79, g-segta-89, hk-nammb-73, k-csmwt-94, ll-fagt-92, l-esta-94, l-conm-76, l-scsi-77, t-dsna-83, w-eucdt-93, x-mwtpp-92, yxy-cdapp-94, ZZZ"
+, update =      "98.03 bibrelex, 97.03 rote, 95.09 mitchell"
 }
 
 @inproceedings{abdmss-lpuof-01
-, author =	"Oswin Aichholzer and David Bremner and Erik D. Demaine and Henk Meijer and Vera Sacrist{\'a}n and Michael Soss"
-, title =	"Long Proteins with Unique Optimal Foldings in the {H-P} Model"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"59--62"
-, update =	"01.04 icking"
+, author =      "Oswin Aichholzer and David Bremner and Erik D. Demaine and Henk Meijer and Vera Sacrist{\'a}n and Michael Soss"
+, title =       "Long Proteins with Unique Optimal Foldings in the {H-P} Model"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "59--62"
+, update =      "01.04 icking"
 }
 
 @inproceedings{acddemoprt-fp-00
-, author =	"Oswin Aichholzer and Carmen Cort{\'e}s and Erik D. Demaine and Vida Dujmovi{\'c} and Jeff Erickson and Henk Meijer and Mark Overmars and Bel\'en Palop and Suneeta Ramaswami and Godfried T. Toussaint"
-, title =	"Flipturning Polygons"
-, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom."
-, site =	"Tokyo, Japan"
-, series =	"Lecture Notes Comput. Sci."
-, month =	nov
-, year =	2000
-, note =	"To appear in \emph{Discrete Comput. Geom.}."
-, update =	"02.03 orourke"
+, author =      "Oswin Aichholzer and Carmen Cort{\'e}s and Erik D. Demaine and Vida Dujmovi{\'c} and Jeff Erickson and Henk Meijer and Mark Overmars and Bel\'en Palop and Suneeta Ramaswami and Godfried T. Toussaint"
+, title =       "Flipturning Polygons"
+, booktitle =   "Proc. Japan Conf. Discrete Comput. Geom."
+, site =        "Tokyo, Japan"
+, series =      "Lecture Notes Comput. Sci."
+, month =       nov
+, year =        2000
+, note =        "To appear in \emph{Discrete Comput. Geom.}."
+, update =      "02.03 orourke"
 }
 
 @article{adehost-rcp-01
-, author =	"O. Aichholzer and E. D. Demaine and J. Erickson and F. Hurtado and M. Overmars and M. Soss and G. T. Toussaint"
-, title =	"Reconfiguring convex polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	20
-, year =	2001
-, pages =	"85--95"
-, update =	"01.11 smid"
+, author =      "O. Aichholzer and E. D. Demaine and J. Erickson and F. Hurtado and M. Overmars and M. Soss and G. T. Toussaint"
+, title =       "Reconfiguring convex polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      20
+, year =        2001
+, pages =       "85--95"
+, update =      "01.11 smid"
 }
 
 @inproceedings{ah-eoncs-00
-, author =	"Oswin Aichholzer and Ferran Hurtado"
-, title =	"Edge Operations on Non-Crossing Spanning Trees"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"121--125"
-, update =	"00.03 bibrelex"
+, author =      "Oswin Aichholzer and Ferran Hurtado"
+, title =       "Edge Operations on Non-Crossing Spanning Trees"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "121--125"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{ar-ngta-96v
-, author =	"Oswin Aichholzer and G{\"u}nter Rote"
-, title =	"New Greedy Triangulation Algorithms"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"11--14"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Oswin Aichholzer and G{\"u}nter Rote"
+, title =       "New Greedy Triangulation Algorithms"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "11--14"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @book{az-pftb-98
-, author =	"M. Aigner and G. M. Ziegler"
-, title =	"Proofs from {THE} {BOOK}"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	1998
-, update =	"98.11 smid"
+, author =      "M. Aigner and G. M. Ziegler"
+, title =       "Proofs from {THE} {BOOK}"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        1998
+, update =      "98.11 smid"
 }
 
 @phdthesis{a-iurbw-90
-, author =	"John Milligan Airey"
-, title =	"Increasing Update Rates in the Building Walkthrough System with Automatic Model-space Subdivision and Potentially Visible Set Calculations"
-, school =	"Dept. of Computer Science, University of North Carolina, Chapel Hill"
-, year =	1990
-, keywords =	"doctoral thesis"
-, update =	"97.07 agarwal"
+, author =      "John Milligan Airey"
+, title =       "Increasing Update Rates in the Building Walkthrough System with Automatic Model-space Subdivision and Potentially Visible Set Calculations"
+, school =      "Dept. of Computer Science, University of North Carolina, Chapel Hill"
+, year =        1990
+, keywords =    "doctoral thesis"
+, update =      "97.07 agarwal"
 }
 
 @article{arb-tiriu-90
-, author =	"J. M. Airey and J. H. Rohlf and F. P. {Brooks, Jr.}"
-, title =	"Towards Image Realism with Interactive Update Rates in Complex Virtual Building Environments"
-, journal =	"ACM Siggraph Special Issue on 1990 Symposium on Interactive 3D Graphics"
-, volume =	24
-, number =	2
-, year =	1990
-, pages =	"41--50"
-, update =	"97.11 bibrelex"
+, author =      "J. M. Airey and J. H. Rohlf and F. P. {Brooks, Jr.}"
+, title =       "Towards Image Realism with Interactive Update Rates in Complex Virtual Building Environments"
+, journal =     "ACM Siggraph Special Issue on 1990 Symposium on Interactive 3D Graphics"
+, volume =      24
+, number =      2
+, year =        1990
+, pages =       "41--50"
+, update =      "97.11 bibrelex"
 }
 
 @article{ap-dpesa-88
-, author =	"V. G. Ajjanagadde and L. M. Patniak"
-, title =	"Design and performance evaluation of a systolic architecture for hidden surface removal"
-, journal =	"Comput. Graph. (UK)"
-, volume =	12
-, number =	1
-, year =	1988
-, pages =	"71--74"
-, keywords =	"hidden line/surface elimination, parallel computation"
-, update =	"95.05 korneenko"
+, author =      "V. G. Ajjanagadde and L. M. Patniak"
+, title =       "Design and performance evaluation of a systolic architecture for hidden surface removal"
+, journal =     "Comput. Graph. (UK)"
+, volume =      12
+, number =      1
+, year =        1988
+, pages =       "71--74"
+, keywords =    "hidden line/surface elimination, parallel computation"
+, update =      "95.05 korneenko"
 }
 
 @article{a-lbfpy-88
-, author =	"M. Ajtai"
-, title =	"A lower bound for finding predecessors in {Yao}'s cell probe model"
-, journal =	"Combinatorica"
-, volume =	8
-, number =	3
-, year =	1988
-, pages =	"235--247"
-, update =	"95.05 korneenko"
+, author =      "M. Ajtai"
+, title =       "A lower bound for finding predecessors in {Yao}'s cell probe model"
+, journal =     "Combinatorica"
+, volume =      8
+, number =      3
+, year =        1988
+, pages =       "235--247"
+, update =      "95.05 korneenko"
 }
 
 @article{acns-cfs-82
-, author =	"M. Ajtai and V. Chv{\'a}tal and M. Newborn and E. Szemer{\'e}di"
-, title =	"Crossing-free subgraphs"
-, journal =	"Ann. Discrete Math."
-, volume =	12
-, year =	1982
-, pages =	"9--12"
-, update =	"98.03 agarwal+bibrelex"
+, author =      "M. Ajtai and V. Chv{\'a}tal and M. Newborn and E. Szemer{\'e}di"
+, title =       "Crossing-free subgraphs"
+, journal =     "Ann. Discrete Math."
+, volume =      12
+, year =        1982
+, pages =       "9--12"
+, update =      "98.03 agarwal+bibrelex"
 }
 
 @inproceedings{akss-dsot-86
-, author =	"M. Ajtai and J. Koml{\'o}s and W. Steiger and E. Szemer{\'e}di"
-, title =	"Deterministic selection in {$O( \log \log n)$} time"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"188--195"
-, update =	"98.03 bibrelex"
+, author =      "M. Ajtai and J. Koml{\'o}s and W. Steiger and E. Szemer{\'e}di"
+, title =       "Deterministic selection in {$O( \log \log n)$} time"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "188--195"
+, update =      "98.03 bibrelex"
 }
 
 @article{akss-opshc-89
-, author =	"M. Ajtai and J. Komlos and W. L. Steiger and E. Szemeredi"
-, title =	"Optimal parallel selection has complexity $o(\log \log n)$"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	38
-, number =	1
-, year =	1989
-, pages =	"125--133"
-, keywords =	"parallel computation, selection, lower bound"
-, update =	"95.05 korneenko"
+, author =      "M. Ajtai and J. Komlos and W. L. Steiger and E. Szemeredi"
+, title =       "Optimal parallel selection has complexity $o(\log \log n)$"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      38
+, number =      1
+, year =        1989
+, pages =       "125--133"
+, keywords =    "parallel computation, selection, lower bound"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{aks-osn-83
-, author =	"M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di"
-, title =	"An {$O(n \log n)$} Sorting Network"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
-, year =	1983
-, pages =	"1--9"
-, update =	"98.03 bibrelex"
+, author =      "M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di"
+, title =       "An {$O(n \log n)$} Sorting Network"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Theory Comput."
+, year =        1983
+, pages =       "1--9"
+, update =      "98.03 bibrelex"
 }
 
 @article{aks-scps-83
-, author =	"M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di"
-, title =	"Sorting in $c\log n$ parallel steps"
-, journal =	"Combinatorica"
-, volume =	3
-, year =	1983
-, pages =	"1--19"
-, update =	"93.09 rote"
+, author =      "M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di"
+, title =       "Sorting in $c\log n$ parallel steps"
+, journal =     "Combinatorica"
+, volume =      3
+, year =        1983
+, pages =       "1--19"
+, update =      "93.09 rote"
 }
 
 @article{akt-om-84
-, author =	"M. Ajtai and J. Koml{\'o}s and G. Tusn{\'a}dy"
-, title =	"On optimal matchings"
-, journal =	"Combinatorica"
-, volume =	4
-, year =	1984
-, pages =	"259--264"
-, update =	"98.03 bibrelex"
+, author =      "M. Ajtai and J. Koml{\'o}s and G. Tusn{\'a}dy"
+, title =       "On optimal matchings"
+, journal =     "Combinatorica"
+, volume =      4
+, year =        1984
+, pages =       "259--264"
+, update =      "98.03 bibrelex"
 }
 
 @article{am-dptnp-96
-, author =	"M. Ajtai and N. Megiddo"
-, title =	"A Deterministic $Poly(\log \log N)$-Time $N$-Processor Algorithm for Linear Programming in Fixed Dimension"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, year =	1996
-, pages =	"1171--1195"
-, update =	"97.03 agarwal+smid"
+, author =      "M. Ajtai and N. Megiddo"
+, title =       "A Deterministic $Poly(\log \log N)$-Time $N$-Processor Algorithm for Linear Programming in Fixed Dimension"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, pages =       "1171--1195"
+, update =      "97.03 agarwal+smid"
 }
 
 @inproceedings{am-dptnp-92
-, author =	"M. Ajtai and N. Megiddo"
-, title =	"A Deterministic $Poly(\log \log N)$-Time $N$-Processor Algorithm for Linear Programming in Fixed Dimensions"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"327--338"
-, update =	"97.03 agarwal, 94.01 matousek, 93.09 milone+mitchell"
+, author =      "M. Ajtai and N. Megiddo"
+, title =       "A Deterministic $Poly(\log \log N)$-Time $N$-Processor Algorithm for Linear Programming in Fixed Dimensions"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "327--338"
+, update =      "97.03 agarwal, 94.01 matousek, 93.09 milone+mitchell"
 }
 
 @inproceedings{a-reg-93
-, author =	"Kurt Akeley"
-, title =	"Reality Engine Graphics"
-, booktitle =	"Proc. SIGGRAPH '93"
-, series =	"In {\em Comput. Graph.\/} Proceedings, Annual Conference Series"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"Addison-Wesley"
-, year =	1993
-, pages =	"109--116"
-, update =	"98.03 agarwal"
+, author =      "Kurt Akeley"
+, title =       "Reality Engine Graphics"
+, booktitle =   "Proc. SIGGRAPH '93"
+, series =      "In {\em Comput. Graph.\/} Proceedings, Annual Conference Series"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "Addison-Wesley"
+, year =        1993
+, pages =       "109--116"
+, update =      "98.03 agarwal"
 }
 
 @incollection{ahlm-spfoj-96
-, author =	"S. Akella and W. Huang and K. M. Lynch and M. T. Mason"
-, title =	"Sensorless parts feeding with a one joint robot"
-, editor =	"J.-P. Laumond and M. H. Overmars"
-, booktitle =	"Algorithms for Robotic Motion and Manipulation"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "S. Akella and W. Huang and K. M. Lynch and M. T. Mason"
+, title =       "Sensorless parts feeding with a one joint robot"
+, editor =      "J.-P. Laumond and M. H. Overmars"
+, booktitle =   "Algorithms for Robotic Motion and Manipulation"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{am-ppopp-92
-, author =	"S. Akella and M. T. Mason"
-, title =	"Posing polygonal objects in the plane by pushing"
-, booktitle =	"Proc. 9th IEEE Internat. Conf. Robot. Autom."
-, year =	1992
-, pages =	"2255--2268"
-, update =	"98.07 bibrelex"
+, author =      "S. Akella and M. T. Mason"
+, title =       "Posing polygonal objects in the plane by pushing"
+, booktitle =   "Proc. 9th IEEE Internat. Conf. Robot. Autom."
+, year =        1992
+, pages =       "2255--2268"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ahk-sgaan-87
-, author =	"S. B. Akers and D. Harel and B. Krishnamurthy"
-, title =	"The Star Graph: An Attractive Alternative to the {$n$}-cube"
-, booktitle =	"Proc. Int. Conf. on Parrallel Processing"
-, year =	1987
-, pages =	"393--400"
-, update =	"98.07 bibrelex"
+, author =      "S. B. Akers and D. Harel and B. Krishnamurthy"
+, title =       "The Star Graph: An Attractive Alternative to the {$n$}-cube"
+, booktitle =   "Proc. Int. Conf. on Parrallel Processing"
+, year =        1987
+, pages =       "393--400"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ak-gtmsi-86
-, author =	"S. B. Akers and B. Krishnamurthy"
-, title =	"A group theoretic model for symmetric interconnection networks"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, year =	1986
-, pages =	"216--223"
-, update =	"98.07 bibrelex"
+, author =      "S. B. Akers and B. Krishnamurthy"
+, title =       "A group theoretic model for symmetric interconnection networks"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, year =        1986
+, pages =       "216--223"
+, update =      "98.07 bibrelex"
 }
 
 @article{ak-gtmsi-38
-, author =	"S. B. Akers and B. Krishnamurthy"
-, title =	"A Group Theoretic Model for Symmetric Interconnection Networks"
-, journal =	"IEEE Trans. Comput."
-, volume =	38
-, number =	4
-, year =	1989
-, pages =	"555--566"
-, update =	"98.07 bibrelex"
+, author =      "S. B. Akers and B. Krishnamurthy"
+, title =       "A Group Theoretic Model for Symmetric Interconnection Networks"
+, journal =     "IEEE Trans. Comput."
+, volume =      38
+, number =      4
+, year =        1989
+, pages =       "555--566"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ak-ftsg-87
-, author =	"S. B. Akers and B. Krishnamurthy"
-, title =	"The fault tolerance of star graphs"
-, booktitle =	"Proc. 2nd International Conference on Supercomputing"
-, site =	"San Francisco, CA"
-, year =	1987
-, update =	"98.07 bibrelex"
+, author =      "S. B. Akers and B. Krishnamurthy"
+, title =       "The fault tolerance of star graphs"
+, booktitle =   "Proc. 2nd International Conference on Supercomputing"
+, site =        "San Francisco, CA"
+, year =        1987
+, update =      "98.07 bibrelex"
 }
 
 @article{a-mbiss-78
-, author =	"H. Akima"
-, title =	"A Method of Bivariate Interpolation on Smooth Surface Fitting for Irregularly Distributed Data Points"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	4
-, year =	1978
-, pages =	"148--159"
-, precedes =	"a-a526b-78"
-, update =	"98.03 bibrelex"
-, annote =	"Fits a 5th degree polynomial in each triangle. Uses
-		 DT. Incremental algorithm---adds points outside the
-		 convex hull."
+, author =      "H. Akima"
+, title =       "A Method of Bivariate Interpolation on Smooth Surface Fitting for Irregularly Distributed Data Points"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      4
+, year =        1978
+, pages =       "148--159"
+, precedes =    "a-a526b-78"
+, update =      "98.03 bibrelex"
+, annote =      "Fits a 5th degree polynomial in each triangle. Uses
+                 DT. Incremental algorithm---adds points outside the
+                 convex hull."
 }
 
 @article{a-a526b-78
-, author =	"H. Akima"
-, title =	"Algorithm 526: {Bivariate} interpolation and smooth surface fitting for irregularly distributed data points"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	4
-, number =	2
-, year =	1978
-, pages =	"160--164"
-, succeeds =	"a-mbiss-78"
-, update =	"98.03 bibrelex"
+, author =      "H. Akima"
+, title =       "Algorithm 526: {Bivariate} interpolation and smooth surface fitting for irregularly distributed data points"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      4
+, number =      2
+, year =        1978
+, pages =       "160--164"
+, succeeds =    "a-mbiss-78"
+, update =      "98.03 bibrelex"
 }
 
 @article{a-epdbi-84
-, author =	"H. Akima"
-, title =	"On estimating partial derivatives for bivariate interpolation of scattered data"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, number =	1
-, year =	1984
-, pages =	"41--52"
+, author =      "H. Akima"
+, title =       "On estimating partial derivatives for bivariate interpolation of scattered data"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, number =      1
+, year =        1984
+, pages =       "41--52"
 }
 
 @article{aa-wvp-88
-, author =	"I. Ya. Akimova and A. P. Akimov"
-, title =	"Weighted {Voronoi} Partitions"
-, journal =	"Soviet Journal of Computer and Systems Sciences (English translation of Tekhnicheskaya Kibernetika)"
-, volume =	26
-, number =	6
-, month =	nov
-, year =	1988
-, pages =	"75--80"
-, keywords =	"weighted euclidean metric, Voronoi partitions, Voronoi diagrams, geometrical problems, point set"
-, update =	"93.05 schwarzkopf"
-, annote =	"Multiplicative weights in $n$ dimensions. Incremental
-		 algorithm"
-, abstract =	"Weighted Voronoi partitions are proposed in this paper
-		 as a generalization of the Voronoi partition.
-		 Properties of such partitions are obtained, and an
-		 algorithm developed for their construction. Certain
-		 applied problems whose solution would benefit from the
-		 use of Voronoi diagrams are indicated. (Author
-		 abstract) 13 Refs."
+, author =      "I. Ya. Akimova and A. P. Akimov"
+, title =       "Weighted {Voronoi} Partitions"
+, journal =     "Soviet Journal of Computer and Systems Sciences (English translation of Tekhnicheskaya Kibernetika)"
+, volume =      26
+, number =      6
+, month =       nov
+, year =        1988
+, pages =       "75--80"
+, keywords =    "weighted euclidean metric, Voronoi partitions, Voronoi diagrams, geometrical problems, point set"
+, update =      "93.05 schwarzkopf"
+, annote =      "Multiplicative weights in $n$ dimensions. Incremental
+                 algorithm"
+, abstract =    "Weighted Voronoi partitions are proposed in this paper
+                 as a generalization of the Voronoi partition.
+                 Properties of such partitions are obtained, and an
+                 algorithm developed for their construction. Certain
+                 applied problems whose solution would benefit from the
+                 use of Voronoi diagrams are indicated. (Author
+                 abstract) 13 Refs."
 }
 
 @inproceedings{a-wtcdg-97
-, author =	"Jin Akiyama"
-, title =	"Why {Taro} Can Do Geometry"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	112
-, update =	"97.11 jones"
+, author =      "Jin Akiyama"
+, title =       "Why {Taro} Can Do Geometry"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       112
+, update =      "97.11 jones"
 }
 
 @inproceedings{aa-dsgh-89
-, author =	"J. Akiyama and N. Alon"
-, title =	"Disjoint simplices and geometric hypergraphs"
-, editor =	"G. S. Blum and R. L. Graham and J. Malkevitch"
-, booktitle =	"Combinatorial Mathematics; Proc. of the Third International Conference (New York, 1985)"
-, volume =	555
-, publisher =	"Annals of the New York Academy of Sciences"
-, year =	1989
-, pages =	"1--3"
-, update =	"97.03 schwarzkopf, 95.05 korneenko, 95.01 mitchell"
+, author =      "J. Akiyama and N. Alon"
+, title =       "Disjoint simplices and geometric hypergraphs"
+, editor =      "G. S. Blum and R. L. Graham and J. Malkevitch"
+, booktitle =   "Combinatorial Mathematics; Proc. of the Third International Conference (New York, 1985)"
+, volume =      555
+, publisher =   "Annals of the New York Academy of Sciences"
+, year =        1989
+, pages =       "1--3"
+, update =      "97.03 schwarzkopf, 95.05 korneenko, 95.01 mitchell"
 }
 
 @article{au-nbclp-90
-, author =	"J. Akiyama and J. Urrutia"
-, title =	"A note on balanced colouring of lattice points"
-, journal =	"Discrete Math."
-, volume =	83
-, number =	1
-, year =	1990
-, pages =	"123--126"
-, update =	"95.05 korneenko"
+, author =      "J. Akiyama and J. Urrutia"
+, title =       "A note on balanced colouring of lattice points"
+, journal =     "Discrete Math."
+, volume =      83
+, number =      1
+, year =        1990
+, pages =       "123--126"
+, update =      "95.05 korneenko"
 }
 
 @article{au-sapp-90
-, author =	"J. Akiyama and J. Urrutia"
-, title =	"Simple alternating path problem"
-, journal =	"Discrete Math."
-, volume =	84
-, number =	1
-, year =	1990
-, pages =	"101--103"
-, keywords =	"points, convex polygons, connect-the-dots problem"
-, update =	"95.05 korneenko"
+, author =      "J. Akiyama and J. Urrutia"
+, title =       "Simple alternating path problem"
+, journal =     "Discrete Math."
+, volume =      84
+, number =      1
+, year =        1990
+, pages =       "101--103"
+, keywords =    "points, convex polygons, connect-the-dots problem"
+, update =      "95.05 korneenko"
 }
 
 @article{ans-nchcp-80
-, author =	"T. Akiyama and T. Nishizeki and N. Saito"
-, title =	"{NP}-completeness of the {Hamiltonian} cycle problem for bipartite graphs"
-, journal =	"J. Inform. Process."
-, volume =	3
-, year =	1980
-, pages =	"73--76"
-, update =	"98.11 bibrelex"
+, author =      "T. Akiyama and T. Nishizeki and N. Saito"
+, title =       "{NP}-completeness of the {Hamiltonian} cycle problem for bipartite graphs"
+, journal =     "J. Inform. Process."
+, volume =      3
+, year =        1980
+, pages =       "73--76"
+, update =      "98.11 bibrelex"
 }
 
 @proceedings{adss-p4wad-95
-, title =	"Proc. 4th Workshop Algorithms Data Struct."
-, editor =	"S. Akl and F. Dehne and J.-R. Sack and N. Santoro"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, update =	"98.07 bibrelex, 97.11 sack"
+, title =       "Proc. 4th Workshop Algorithms Data Struct."
+, editor =      "S. Akl and F. Dehne and J.-R. Sack and N. Santoro"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, update =      "98.07 bibrelex, 97.11 sack"
 }
 
 @techreport{amr-pgg-88
-, author =	"S. Akl and H. Meijer and D. Rappaport"
-, title =	"Parallel geometry on a grid"
-, number =	"cisc 88--238"
-, institution =	"Dept. Computer Inf. Sci. Queen's Univ."
-, address =	"Kingston, Ontario, Canada"
-, year =	1988
-, keywords =	"parallel computations"
-, update =	"98.07 bibrelex, 95.05 korneenko"
+, author =      "S. Akl and H. Meijer and D. Rappaport"
+, title =       "Parallel geometry on a grid"
+, number =      "cisc 88--238"
+, institution = "Dept. Computer Inf. Sci. Queen's Univ."
+, address =     "Kingston, Ontario, Canada"
+, year =        1988
+, keywords =    "parallel computations"
+, update =      "98.07 bibrelex, 95.05 korneenko"
 }
 
 @article{a-ctpac-82
-, author =	"S. G. Akl"
-, title =	"A Constant-time Parallel Algorithm for Computing Convex Hulls"
-, journal =	"BIT"
-, volume =	22
-, year =	1982
-, pages =	"130--134"
-, keywords =	"parallel computations, convex hull"
-, update =	"95.05 korneenko, 93.09 held"
+, author =      "S. G. Akl"
+, title =       "A Constant-time Parallel Algorithm for Computing Convex Hulls"
+, journal =     "BIT"
+, volume =      22
+, year =        1982
+, pages =       "130--134"
+, keywords =    "parallel computations, convex hull"
+, update =      "95.05 korneenko, 93.09 held"
 }
 
 @article{a-nemts-83
-, author =	"S. G. Akl"
-, title =	"A note on {Euclidean} matchings, triangulations, and spanning trees"
-, journal =	"Journal of Combinatorics, Information and System Sciences"
-, volume =	8
-, number =	3
-, year =	1983
-, pages =	"169--174"
-, keywords =	"geometric graphs, triangulation, minimal spanning tree, matching"
-, update =	"95.05 korneenko, 95.01 mitchell, 95.01 mitchell"
+, author =      "S. G. Akl"
+, title =       "A note on {Euclidean} matchings, triangulations, and spanning trees"
+, journal =     "Journal of Combinatorics, Information and System Sciences"
+, volume =      8
+, number =      3
+, year =        1983
+, pages =       "169--174"
+, keywords =    "geometric graphs, triangulation, minimal spanning tree, matching"
+, update =      "95.05 korneenko, 95.01 mitchell, 95.01 mitchell"
 }
 
 @phdthesis{a-avats-78
-, author =	"S. G. Akl"
-, title =	"An analysis of various aspects of the traveling salesman problem"
-, type =	"Ph.{D}. Thesis"
-, school =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1978
-, keywords =	"doctoral thesis"
+, author =      "S. G. Akl"
+, title =       "An analysis of various aspects of the traveling salesman problem"
+, type =        "Ph.{D}. Thesis"
+, school =      "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1978
+, keywords =    "doctoral thesis"
 }
 
 @article{a-cgmap-78
-, author =	"S. G. Akl"
-, title =	"Comments on: {G}. {Manacher}, an application of pattern matching to a problem in geometrical complexity"
-, journal =	"Inform. Process. Lett."
-, volume =	7
-, number =	2
-, year =	1978
-, pages =	86
-, keywords =	"polygon similarity, affine maps"
-, succeeds =	"m-apmpg-76"
+, author =      "S. G. Akl"
+, title =       "Comments on: {G}. {Manacher}, an application of pattern matching to a problem in geometrical complexity"
+, journal =     "Inform. Process. Lett."
+, volume =      7
+, number =      2
+, year =        1978
+, pages =       86
+, keywords =    "polygon similarity, affine maps"
+, succeeds =    "m-apmpg-76"
 }
 
 @article{a-ccha-80
-, author =	"S. G. Akl"
-, title =	"Corrigendum on convex hull algorithms"
-, journal =	"Inform. Process. Lett."
-, volume =	10
-, number =	3
-, year =	1980
-, pages =	168
+, author =      "S. G. Akl"
+, title =       "Corrigendum on convex hull algorithms"
+, journal =     "Inform. Process. Lett."
+, volume =      10
+, number =      3
+, year =        1980
+, pages =       168
 }
 
 @techreport{a-mtodh-78
-, author =	"S. G. Akl"
-, title =	"On maximal triangulations, optimal drawings and {Hamilton} cycles"
-, type =	"Report"
-, number =	"78-67"
-, institution =	"Dept. Comput. Inform. Sci., Queen's Univ."
-, address =	"Kingston, ON"
-, year =	1978
+, author =      "S. G. Akl"
+, title =       "On maximal triangulations, optimal drawings and {Hamilton} cycles"
+, type =        "Report"
+, number =      "78-67"
+, institution = "Dept. Comput. Inform. Sci., Queen's Univ."
+, address =     "Kingston, ON"
+, year =        1978
 }
 
 @article{a-enono-81
-, author =	"S. G. Akl"
-, title =	"On the expected number of optimal and near-optimal solutions to the {Euclidean} travelling salesman problem"
-, journal =	"J. Comp. Math. Appl."
-, volume =	7
-, number =	4
-, year =	1981
-, pages =	"287--288"
-, update =	"95.05 korneenko"
+, author =      "S. G. Akl"
+, title =       "On the expected number of optimal and near-optimal solutions to the {Euclidean} travelling salesman problem"
+, journal =     "J. Comp. Math. Appl."
+, volume =      7
+, number =      4
+, year =        1981
+, pages =       "287--288"
+, update =      "95.05 korneenko"
 }
 
 @article{a-oacch-84
-, author =	"S. G. Akl"
-, title =	"Optimal algorithms for computing convex hulls and for sorting"
-, journal =	"Computing"
-, volume =	33
-, year =	1984
-, pages =	"1--11"
+, author =      "S. G. Akl"
+, title =       "Optimal algorithms for computing convex hulls and for sorting"
+, journal =     "Computing"
+, volume =      33
+, year =        1984
+, pages =       "1--11"
 }
 
 @incollection{a-opass-85
-, author =	"S. G. Akl"
-, title =	"Optimal parallel algorithms for selection, sorting and computing convex hulls"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"1--22"
+, author =      "S. G. Akl"
+, title =       "Optimal parallel algorithms for selection, sorting and computing convex hulls"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "1--22"
 }
 
 @book{a-psa-85
-, author =	"S. G. Akl"
-, title =	"Parallel Sorting Algorithms"
-, publisher =	"Academic Press"
-, address =	"Orlando, Florida"
-, year =	1985
-, isbn =	"0-12-047680-0"
-, update =	"98.07 bibrelex, 95.05 korneenko"
+, author =      "S. G. Akl"
+, title =       "Parallel Sorting Algorithms"
+, publisher =   "Academic Press"
+, address =     "Orlando, Florida"
+, year =        1985
+, isbn =        "0-12-047680-0"
+, update =      "98.07 bibrelex, 95.05 korneenko"
 }
 
 @book{a-dapa-89
-, author =	"S. G. Akl"
-, title =	"The Design and Analysis of Parallel Algorithms"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1989
-, update =	"96.09 orourke"
+, author =      "S. G. Akl"
+, title =       "The Design and Analysis of Parallel Algorithms"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1989
+, update =      "96.09 orourke"
 }
 
 @article{a-trcha-79
-, author =	"S. G. Akl"
-, title =	"Two remarks on a convex hull algorithm"
-, journal =	"Inform. Process. Lett."
-, volume =	8
-, number =	2
-, year =	1979
-, pages =	"108--109"
-, keywords =	"convex hull, counterclockwise test, angle test, geometrical primitives"
+, author =      "S. G. Akl"
+, title =       "Two remarks on a convex hull algorithm"
+, journal =     "Inform. Process. Lett."
+, volume =      8
+, number =      2
+, year =        1979
+, pages =       "108--109"
+, keywords =    "convex hull, counterclockwise test, angle test, geometrical primitives"
 }
 
 @book{al-pcg-93
-, author =	"S. G. Akl and K. A. Lyons"
-, title =	"Parallel Computational Geometry"
-, publisher =	"Prentice Hall"
-, year =	1993
-, update =	"97.03 schwarzkopf, 93.09 held"
+, author =      "S. G. Akl and K. A. Lyons"
+, title =       "Parallel Computational Geometry"
+, publisher =   "Prentice Hall"
+, year =        1993
+, update =      "97.03 schwarzkopf, 93.09 held"
 }
 
 @incollection{am-acba-81
-, author =	"S. G. Akl and H. Meijer"
-, title =	"On the average-case of ``bucketing'' algorithms"
-, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
-, year =	1981
-, pages =	"381--388"
-, precedes =	"am-acba-82"
-, update =	"95.05 korneenko"
+, author =      "S. G. Akl and H. Meijer"
+, title =       "On the average-case of ``bucketing'' algorithms"
+, booktitle =   "Proc. Allerton Conf. Commun. Control Comput."
+, year =        1981
+, pages =       "381--388"
+, precedes =    "am-acba-82"
+, update =      "95.05 korneenko"
 }
 
 @article{am-acba-82
-, author =	"S. G. Akl and H. Meijer"
-, title =	"On the average-case of ``bucketing'' algorithms"
-, journal =	"J. Algorithms"
-, volume =	3
-, number =	1
-, year =	1982
-, pages =	"9--13"
-, keywords =	"average-case analysis, bucketing"
-, succeeds =	"am-acba-81"
-, update =	"95.05 korneenko"
+, author =      "S. G. Akl and H. Meijer"
+, title =       "On the average-case of ``bucketing'' algorithms"
+, journal =     "J. Algorithms"
+, volume =      3
+, number =      1
+, year =        1982
+, pages =       "9--13"
+, keywords =    "average-case analysis, bucketing"
+, succeeds =    "am-acba-81"
+, update =      "95.05 korneenko"
 }
 
 @article{am-pbs-90
-, author =	"S. G. Akl and J. Meijer"
-, title =	"Parallel binary search"
-, journal =	"IEEE Trans. Parallel Distrib. Syst."
-, volume =	1
-, year =	1990
-, pages =	"247--250"
-, update =	"98.07 bibrelex"
+, author =      "S. G. Akl and J. Meijer"
+, title =       "Parallel binary search"
+, journal =     "IEEE Trans. Parallel Distrib. Syst."
+, volume =      1
+, year =        1990
+, pages =       "247--250"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{aqs-cvdsp-92
-, author =	"S. G. Akl and K. Qiu and I. Stojmenovi{\'c}"
-, title =	"Computing the {Voronoi} diagram on the star and pancake interconnection networks"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"353--358"
-, cites =	"ak-gtmsi-38, ahk-sgaan-87, ak-ftsg-87, jl-pgamc-90, lp-lppsi-77, ms-esasg-90, ps-cgi-85, aqs-dccgs-91t, l-cvdmc-85, qma-prspn-91, s-cgh-88, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. G. Akl and K. Qiu and I. Stojmenovi{\'c}"
+, title =       "Computing the {Voronoi} diagram on the star and pancake interconnection networks"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "353--358"
+, cites =       "ak-gtmsi-38, ahk-sgaan-87, ak-ftsg-87, jl-pgamc-90, lp-lppsi-77, ms-esasg-90, ps-cgi-85, aqs-dccgs-91t, l-cvdmc-85, qma-prspn-91, s-cgh-88, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{aqs-cgspn-91i
-, author =	"S. G. Akl and K. Qui and I. Stojmenovi{\'c}"
-, title =	"Computational geometry on the star and pancake networks"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"252--255"
-, update =	"98.07 bibrelex"
+, author =      "S. G. Akl and K. Qui and I. Stojmenovi{\'c}"
+, title =       "Computational geometry on the star and pancake networks"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "252--255"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{aqs-dccgs-91t
-, author =	"S. G. Akl and K. Qui and I. Stojmenovic"
-, title =	"Data Communication and Computational Geometry on the Star and Pancake Interconnection Networks"
-, type =	"Technical Report"
-, number =	"91-301"
-, institution =	"Dept. Comp and Info Sci, Queens's University"
-, month =	apr
-, year =	1991
-, precedes =	"aqs-cgspn-91i"
-, update =	"98.07 bibrelex"
+, author =      "S. G. Akl and K. Qui and I. Stojmenovic"
+, title =       "Data Communication and Computational Geometry on the Star and Pancake Interconnection Networks"
+, type =        "Technical Report"
+, number =      "91-301"
+, institution = "Dept. Comp and Info Sci, Queens's University"
+, month =       apr
+, year =        1991
+, precedes =    "aqs-cgspn-91i"
+, update =      "98.07 bibrelex"
 }
 
 @article{at-fcha-78
-, author =	"S. G. Akl and G. T. Toussaint"
-, title =	"A fast convex hull algorithm"
-, journal =	"Inform. Process. Lett."
-, volume =	7
-, number =	5
-, year =	1978
-, pages =	"219--222"
+, author =      "S. G. Akl and G. T. Toussaint"
+, title =       "A fast convex hull algorithm"
+, journal =     "Inform. Process. Lett."
+, volume =      7
+, number =      5
+, year =        1978
+, pages =       "219--222"
 }
 
 @article{at-aiacp-79
-, author =	"S. G. Akl and G. T. Toussaint"
-, title =	"Addendum to ``{An} improved algorithm to check for polygon similarity''"
-, journal =	"Inform. Process. Lett."
-, volume =	8
-, number =	3
-, year =	1979
-, pages =	"157--158"
-, succeeds =	"at-iacps-78"
+, author =      "S. G. Akl and G. T. Toussaint"
+, title =       "Addendum to ``{An} improved algorithm to check for polygon similarity''"
+, journal =     "Inform. Process. Lett."
+, volume =      8
+, number =      3
+, year =        1979
+, pages =       "157--158"
+, succeeds =    "at-iacps-78"
 }
 
 @article{at-iacps-78
-, author =	"S. G. Akl and G. T. Toussaint"
-, title =	"An improved algorithm to check for polygon similarity"
-, journal =	"Inform. Process. Lett."
-, volume =	7
-, year =	1978
-, pages =	"127--128"
-, precedes =	"at-aiacp-79"
+, author =      "S. G. Akl and G. T. Toussaint"
+, title =       "An improved algorithm to check for polygon similarity"
+, journal =     "Inform. Process. Lett."
+, volume =      7
+, year =        1978
+, pages =       "127--128"
+, precedes =    "at-aiacp-79"
 }
 
 @inproceedings{at-echap-78
-, author =	"S. G. Akl and G. T. Toussaint"
-, title =	"Efficient convex hull algorithms for pattern recognition applications"
-, booktitle =	"Proc. 4th IEEE Internat. Conf. Pattern Recogn."
-, site =	"Kyoto, Japan"
-, year =	1978
-, pages =	"483--487"
-, keywords =	"convex hull, simple polygon, average-case analysis, average size of convex hull, empirical analysis, Graham's scan"
+, author =      "S. G. Akl and G. T. Toussaint"
+, title =       "Efficient convex hull algorithms for pattern recognition applications"
+, booktitle =   "Proc. 4th IEEE Internat. Conf. Pattern Recogn."
+, site =        "Kyoto, Japan"
+, year =        1978
+, pages =       "483--487"
+, keywords =    "convex hull, simple polygon, average-case analysis, average size of convex hull, empirical analysis, Graham's scan"
 }
 
 @article{a-adomf-87
-, author =	"V. Akman"
-, title =	"An algorithm for determining an opaque minimal forest of a convex polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	24
-, number =	3
-, year =	1987
-, pages =	"193--198"
-, keywords =	"triangulation, Steiner trees, minimum spanning trees, visibility, convex polygon"
-, update =	"95.05 korneenko"
+, author =      "V. Akman"
+, title =       "An algorithm for determining an opaque minimal forest of a convex polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      24
+, number =      3
+, year =        1987
+, pages =       "193--198"
+, keywords =    "triangulation, Steiner trees, minimum spanning trees, visibility, convex polygon"
+, update =      "95.05 korneenko"
 }
 
 @incollection{a-ggar-88
-, author =	"V. Akman"
-, title =	"Geometry and graphics applied to robotics"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1988
-, pages =	"619--638"
-, update =	"99.11 bibrelex"
+, author =      "V. Akman"
+, title =       "Geometry and graphics applied to robotics"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1988
+, pages =       "619--638"
+, update =      "99.11 bibrelex"
 }
 
 @phdthesis{a-spapo-85
-, author =	"V. Akman"
-, title =	"Shortest Paths Avoiding Polyhedral Obstacles In 3-Dimensional {Euclidean} Space"
-, school =	"Computer and Systems Engineering, Rensselaer Polytechnic Institute"
-, address =	"Troy, NY"
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"93.09 milone+mitchell"
+, author =      "V. Akman"
+, title =       "Shortest Paths Avoiding Polyhedral Obstacles In 3-Dimensional {Euclidean} Space"
+, school =      "Computer and Systems Engineering, Rensselaer Polytechnic Institute"
+, address =     "Troy, NY"
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{a-sp825-83
-, author =	"V. Akman"
-, title =	"Solution to ``problem 82-5''"
-, journal =	"J. Algorithms"
-, volume =	4
-, year =	1983
-, pages =	"184--187"
-, keywords =	"triangulation, subdivision"
-, update =	"95.05 korneenko"
+, author =      "V. Akman"
+, title =       "Solution to ``problem 82-5''"
+, journal =     "J. Algorithms"
+, volume =      4
+, year =        1983
+, pages =       "184--187"
+, keywords =    "triangulation, subdivision"
+, update =      "95.05 korneenko"
 }
 
 @book{a-usppe-87
-, author =	"V. Akman"
-, title =	"Unobstructed Shortest Paths in Polyhedral Environments"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	251
-, publisher =	"Springer-Verlag"
-, year =	1987
-, keywords =	"book, polyhedra, motion planning"
-, update =	"93.09 franklin"
+, author =      "V. Akman"
+, title =       "Unobstructed Shortest Paths in Polyhedral Environments"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      251
+, publisher =   "Springer-Verlag"
+, year =        1987
+, keywords =    "book, polyhedra, motion planning"
+, update =      "93.09 franklin"
 }
 
 @article{af-qis-86
-, author =	"Varol Akman and Wm. Randolph Franklin"
-, title =	"On the Question `Is $\sum_1^n \sqrt{a_i}\le L ?$'"
-, journal =	"Bull. EATCS"
-, volume =	28
-, month =	feb
-, year =	1986
-, pages =	"16--20"
-, keywords =	"motion planning, complexity theory"
-, update =	"95.05 korneenko, 93.09 franklin"
+, author =      "Varol Akman and Wm. Randolph Franklin"
+, title =       "On the Question `Is $\sum_1^n \sqrt{a_i}\le L ?$'"
+, journal =     "Bull. EATCS"
+, volume =      28
+, month =       feb
+, year =        1986
+, pages =       "16--20"
+, keywords =    "motion planning, complexity theory"
+, update =      "95.05 korneenko, 93.09 franklin"
 }
 
 @article{af-rrkdt-89
-, author =	"Varol Akman and Wm. Randolph Franklin"
-, title =	"Ray Representation for K-d Trees"
-, journal =	"Pattern Recogn. Lett."
-, volume =	"??"
-, month =	nov
-, year =	1989
-, pages =	"315--320"
-, keywords =	"oct trees, measure, rays"
-, update =	"93.09 franklin"
+, author =      "Varol Akman and Wm. Randolph Franklin"
+, title =       "Ray Representation for K-d Trees"
+, journal =     "Pattern Recogn. Lett."
+, volume =      "??"
+, month =       nov
+, year =        1989
+, pages =       "315--320"
+, keywords =    "oct trees, measure, rays"
+, update =      "93.09 franklin"
 }
 
 @article{af-rorhp-89
-, author =	"Varol Akman and Wm. Randolph Franklin"
-, title =	"Representing Objects as Rays, or How to Pile up an Octree?"
-, journal =	"Computers and Graphics"
-, volume =	13
-, number =	3
-, year =	1989
-, pages =	"373--379"
-, keywords =	"oct trees, measure, polyhedra, rays"
-, update =	"93.09 franklin"
+, author =      "Varol Akman and Wm. Randolph Franklin"
+, title =       "Representing Objects as Rays, or How to Pile up an Octree?"
+, journal =     "Computers and Graphics"
+, volume =      13
+, number =      3
+, year =        1989
+, pages =       "373--379"
+, keywords =    "oct trees, measure, polyhedra, rays"
+, update =      "93.09 franklin"
 }
 
 @article{afkn-gcugd-89
-, author =	"V. Akman and Wm. Randolph Franklin and Mohan Kankanhalli and Chandrasekhar Narayanaswami"
-, title =	"Geometric Computing and the Uniform Grid Data Technique"
-, journal =	"Comput. Aided Design"
-, volume =	21
-, number =	7
-, year =	1989
-, pages =	"410--420"
-, keywords =	"intersection, CAD, grids"
-, update =	"94.05 akman, 93.09 franklin"
+, author =      "V. Akman and Wm. Randolph Franklin and Mohan Kankanhalli and Chandrasekhar Narayanaswami"
+, title =       "Geometric Computing and the Uniform Grid Data Technique"
+, journal =     "Comput. Aided Design"
+, volume =      21
+, number =      7
+, year =        1989
+, pages =       "410--420"
+, keywords =    "intersection, CAD, grids"
+, update =      "94.05 akman, 93.09 franklin"
 }
 
 @inproceedings{a-adgct-92
-, author =	"T. Akutsu"
-, title =	"Algorithms for Determining the Geometrical Congruity in Two and Three Dimensions"
-, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '92"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	650
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"279--288"
-, update =	"94.09 smid, 93.09 milone+mitchell"
+, author =      "T. Akutsu"
+, title =       "Algorithms for Determining the Geometrical Congruity in Two and Three Dimensions"
+, booktitle =   "Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '92"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      650
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "279--288"
+, update =      "94.09 smid, 93.09 milone+mitchell"
 }
 
 @article{a-dcpsd-98
-, author =	"Tatsuya Akutsu"
-, title =	"On Determining the Congruence of Point Sets in {$d$} Dimensions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, number =	4
-, year =	1998
-, pages =	"247--256"
-, succeeds =	"a-dcpsh-94"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Tatsuya Akutsu"
+, title =       "On Determining the Congruence of Point Sets in {$d$} Dimensions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, number =      4
+, year =        1998
+, pages =       "247--256"
+, succeeds =    "a-dcpsh-94"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{a-dcpsh-94
-, author =	"Tatsuya Akutsu"
-, title =	"On Determining the Congruity of Point Sets in Higher Dimensions"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"38--46"
-, precedes =	"a-dcpsd-98"
-, update =	"99.11 bibrelex, 98.03 mitchell, 97.11 bibrelex, 96.05 mitchell"
+, author =      "Tatsuya Akutsu"
+, title =       "On Determining the Congruity of Point Sets in Higher Dimensions"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "38--46"
+, precedes =    "a-dcpsd-98"
+, update =      "99.11 bibrelex, 98.03 mitchell, 97.11 bibrelex, 96.05 mitchell"
 }
 
 @inproceedings{a-ssaat-94
-, author =	"T. Akutsu"
-, title =	"Substructures search and alignment algorithms for three-dimensional protein structures"
-, booktitle =	"Proc. SIGAL-41"
-, year =	1994
-, pages =	"1--8"
-, update =	"98.07 bibrelex"
+, author =      "T. Akutsu"
+, title =       "Substructures search and alignment algorithms for three-dimensional protein structures"
+, booktitle =   "Proc. SIGAL-41"
+, year =        1994
+, pages =       "1--8"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{aahit-ssede-91
-, author =	"Tatsuya Akutsu and Yasukazu Aoki and Susumi Hasegawa and Hiroshi Imai and Takeshi Tokuyama"
-, title =	"The sum of smaller endpoint degree over edges of graphs and its. applications to geometric problems"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"145--148"
-, cites =	"ce-oails-88, cn-asla-85, e-acg-87, egppss-acptc-88, i-nfalt-83, m-fppa2-89, os-nrdca, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "Tatsuya Akutsu and Yasukazu Aoki and Susumi Hasegawa and Hiroshi Imai and Takeshi Tokuyama"
+, title =       "The sum of smaller endpoint degree over edges of graphs and its. applications to geometric problems"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "145--148"
+, cites =       "ce-oails-88, cn-asla-85, e-acg-87, egppss-acptc-88, i-nfalt-83, m-fppa2-89, os-nrdca, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ah-alcsl-94
-, author =	"T. Akutsu and M. M. Halldorsson"
-, title =	"On the Approximation of Largest Common Subtrees and Largest Common Point Sets"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"405--413"
-, update =	"99.11 bibrelex, 97.03 aronov, 96.05 mitchell"
+, author =      "T. Akutsu and M. M. Halldorsson"
+, title =       "On the Approximation of Largest Common Subtrees and Largest Common Point Sets"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "405--413"
+, update =      "99.11 bibrelex, 97.03 aronov, 96.05 mitchell"
 }
 
 @inproceedings{att-ddtps-97
-, author =	"T. Akutsu and H. Tamaki and T. Tokuyama"
-, title =	"Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Set"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"314--323"
-, cites =	"aass-sdp-93, a-ssaat-94, a-dcpsh-94, amww-cssgo-88, a-oagc-87, b-ghtda-81, cghkkk-gpmem-93, cegsw-ccbac-90, ee-scpg-94, e-sdnp-46, e-sdnpe-60, ep-sepg-71, gmo-pmagp-94, h-gaaps-93, hh-gicv-92, ir-cerrp-96, keb-pht-91, m-cag-, m-dddnp-52, mp-rdcg-93, m-hmcs-96, pa-cg-95, pt-gdfcp-96, s-nadcp-84, st-epdg-83, s-cnhep-97, vs-dctds-91, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "T. Akutsu and H. Tamaki and T. Tokuyama"
+, title =       "Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Set"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "314--323"
+, cites =       "aass-sdp-93, a-ssaat-94, a-dcpsh-94, amww-cssgo-88, a-oagc-87, b-ghtda-81, cghkkk-gpmem-93, cegsw-ccbac-90, ee-scpg-94, e-sdnp-46, e-sdnpe-60, ep-sepg-71, gmo-pmagp-94, h-gaaps-93, hh-gicv-92, ir-cerrp-96, keb-pht-91, m-cag-, m-dddnp-52, mp-rdcg-93, m-hmcs-96, pa-cg-95, pt-gdfcp-96, s-nadcp-84, st-epdg-83, s-cnhep-97, vs-dctds-91, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{aaa-apcbv-88
-, author =	"A. J. {Al-Khalili} and D. {Al-Khalili} and K. Ammar"
-, title =	"An algorithm for polygon conversion to boxes for {VLSI} layouts"
-, journal =	"Integration"
-, volume =	6
-, year =	1988
-, pages =	"291--308"
-, keywords =	"polygon, decomposition, orthogon"
-, update =	"95.05 korneenko"
+, author =      "A. J. {Al-Khalili} and D. {Al-Khalili} and K. Ammar"
+, title =       "An algorithm for polygon conversion to boxes for {VLSI} layouts"
+, journal =     "Integration"
+, volume =      6
+, year =        1988
+, pages =       "291--308"
+, keywords =    "polygon, decomposition, orthogon"
+, update =      "95.05 korneenko"
 }
 
 @article{apru-mptdp-91
-, author =	"F. {Al-Thukair} and A. Pelc and I. Rival and J. Urrutia"
-, title =	"Motion planning, two-directional point representations, and ordered sets"
-, journal =	"SIAM J. Discrete Math."
-, volume =	4
-, number =	2
-, year =	1991
-, pages =	"151--163"
-, keywords =	"motion planning"
-, update =	"95.05 korneenko"
+, author =      "F. {Al-Thukair} and A. Pelc and I. Rival and J. Urrutia"
+, title =       "Motion planning, two-directional point representations, and ordered sets"
+, journal =     "SIAM J. Discrete Math."
+, volume =      4
+, number =      2
+, year =        1991
+, pages =       "151--163"
+, keywords =    "motion planning"
+, update =      "95.05 korneenko"
 }
 
 @article{n-loviu-92
-, author =	"V. B. Nitya el al."
-, title =	"Linear octree by volume intersection using perspective silhouettes"
-, journal =	"Pattern Recogn. Lett."
-, volume =	"??"
-, year =	1992
-, pages =	"781--788"
-, update =	"98.11 bibrelex"
+, author =      "V. B. Nitya el al."
+, title =       "Linear octree by volume intersection using perspective silhouettes"
+, journal =     "Pattern Recogn. Lett."
+, volume =      "??"
+, year =        1992
+, pages =       "781--788"
+, update =      "98.11 bibrelex"
 }
 
 @article{a-dmbds-91
-, author =	"S. R. Ala"
-, title =	"Design methodology of boundary data structures"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	3
-, year =	1991
-, pages =	"207--226"
-, keywords =	"boundary data structures, optimization, symmetric data structure, winged edge, storage and access time"
+, author =      "S. R. Ala"
+, title =       "Design methodology of boundary data structures"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      3
+, year =        1991
+, pages =       "207--226"
+, keywords =    "boundary data structures, optimization, symmetric data structure, winged edge, storage and access time"
 }
 
 @article{a-pabds-92
-, author =	"S. R. Ala"
-, title =	"Performance anomalies in boundary data structures"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	12
-, number =	2
-, year =	1992
-, pages =	"49--58"
-, update =	"95.05 korneenko"
+, author =      "S. R. Ala"
+, title =       "Performance anomalies in boundary data structures"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      12
+, number =      2
+, year =        1992
+, pages =       "49--58"
+, update =      "95.05 korneenko"
 }
 
 @phdthesis{a-tddvd-91
-, author =	"G. Albers"
-, title =	"Three-Dimensional Dynamic {Voronoi} Diagrams"
-, school =	"University of W{\"u}rzburg"
-, month =	jul
-, year =	1991
-, note =	"in German"
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "G. Albers"
+, title =       "Three-Dimensional Dynamic {Voronoi} Diagrams"
+, school =      "University of W{\"u}rzburg"
+, month =       jul
+, year =        1991
+, note =        "in German"
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @article{agmr-vdmp-98
-, author =	"G. Albers and Leonidas J. Guibas and Joseph S. B. Mitchell and T. Roos"
-, title =	"Voronoi Diagrams of Moving Points"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"365--380"
-, keywords =	"Voronoi diagrams, Davenport-Schinzel sequences"
-, succeeds =	"gmr-vdmpp-92, ar-vdmph-92, gmr-vdmpp-91t"
-, update =	"99.11 bibrelex, 98.11 bibrelex+devillers, 98.03 mitchell"
+, author =      "G. Albers and Leonidas J. Guibas and Joseph S. B. Mitchell and T. Roos"
+, title =       "Voronoi Diagrams of Moving Points"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "365--380"
+, keywords =    "Voronoi diagrams, Davenport-Schinzel sequences"
+, succeeds =    "gmr-vdmpp-92, ar-vdmph-92, gmr-vdmpp-91t"
+, update =      "99.11 bibrelex, 98.11 bibrelex+devillers, 98.03 mitchell"
 }
 
 @inproceedings{ar-vdmph-92
-, author =	"G. Albers and T. Roos"
-, title =	"Voronoi diagrams of moving points in higher dimensional spaces"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '92"
-, site =	"Helsinki, Finland"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"399--409"
-, keywords =	"Voronoi diagrams, Davenport-Schinzel sequences"
-, precedes =	"agmr-vdmp-98"
-, update =	"99.07 bibrelex, 98.11 bibrelex+devillers, 98.03 mitchell"
+, author =      "G. Albers and T. Roos"
+, title =       "Voronoi diagrams of moving points in higher dimensional spaces"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '92"
+, site =        "Helsinki, Finland"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "399--409"
+, keywords =    "Voronoi diagrams, Davenport-Schinzel sequences"
+, precedes =    "agmr-vdmp-98"
+, update =      "99.07 bibrelex, 98.11 bibrelex+devillers, 98.03 mitchell"
 }
 
 @inproceedings{aks-eueo-99
-, author =	"Susanne Albers and Klaus Kursawe and Sven Schuierer"
-, title =	"Exploring Unknown Environments with Obstacles"
-, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '99"
-, site =	"Baltimore"
-, year =	1999
-, pages =	"842--843"
-, update =	"99.07 bibrelex, 99.03 bibrelex"
+, author =      "Susanne Albers and Klaus Kursawe and Sven Schuierer"
+, title =       "Exploring Unknown Environments with Obstacles"
+, booktitle =   "Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '99"
+, site =        "Baltimore"
+, year =        1999
+, pages =       "842--843"
+, update =      "99.07 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{agmn-allag-97
-, author =	"D. Alberts and C. Gutwenger and P. Mutzel and S. N{\"a}her"
-, title =	"{AGD-Library}: {A} Library of Algorithms for Graph Drawing"
-, booktitle =	"Proc. Workshop on Algorithm Engineering"
-, nickname =	"WAE '97"
-, site =	"Venice"
-, month =	sep
-, year =	1997
-, pages =	"112--123"
-, url =	"http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap12.ps.gz"
-, update =	"00.11 smid, 00.07 icking, 98.07 bibrelex+smid+vismara+vahrenhold, 98.03 mitchell"
+, author =      "D. Alberts and C. Gutwenger and P. Mutzel and S. N{\"a}her"
+, title =       "{AGD-Library}: {A} Library of Algorithms for Graph Drawing"
+, booktitle =   "Proc. Workshop on Algorithm Engineering"
+, nickname =    "WAE '97"
+, site =        "Venice"
+, month =       sep
+, year =        1997
+, pages =       "112--123"
+, url = "http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap12.ps.gz"
+, update =      "00.11 smid, 00.07 icking, 98.07 bibrelex+smid+vismara+vahrenhold, 98.03 mitchell"
 }
 
 @inproceedings{ah-acadg-95
-, author =	"D. Alberts and M. R. Henzinger"
-, title =	"Average Case Analysis of Dynamic Graph Algorithms"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"312--321"
-, update =	"97.03 gaertner+salinger"
+, author =      "D. Alberts and M. R. Henzinger"
+, title =       "Average Case Analysis of Dynamic Graph Algorithms"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "312--321"
+, update =      "97.03 gaertner+salinger"
 }
 
 @techreport{aho-srcp-90
-, author =	"M. Albertson and R. Haas and J. O'Rourke"
-, title =	"Some results on clamping a polygon"
-, number =	003
-, institution =	"Dept. Comput. Sci., Smith College"
-, year =	1990
-, keywords =	"robotics, gripping, clamping"
-, precedes =	"aho-srcp-95"
-, update =	"96.05 orourke, 94.01 orourke"
+, author =      "M. Albertson and R. Haas and J. O'Rourke"
+, title =       "Some results on clamping a polygon"
+, number =      003
+, institution = "Dept. Comput. Sci., Smith College"
+, year =        1990
+, keywords =    "robotics, gripping, clamping"
+, precedes =    "aho-srcp-95"
+, update =      "96.05 orourke, 94.01 orourke"
 }
 
 @article{aho-srcp-95
-, author =	"M. Albertson and R. Haas and J. O'Rourke"
-, title =	"Some results on clamping a polygon"
-, journal =	"Congr. Numer."
-, volume =	109
-, year =	1995
-, pages =	"33--50"
-, keywords =	"robotics, gripping, clamping"
-, succeeds =	"aho-srcp-90"
-, update =	"96.05 orourke"
+, author =      "M. Albertson and R. Haas and J. O'Rourke"
+, title =       "Some results on clamping a polygon"
+, journal =     "Congr. Numer."
+, volume =      109
+, year =        1995
+, pages =       "33--50"
+, keywords =    "robotics, gripping, clamping"
+, succeeds =    "aho-srcp-90"
+, update =      "96.05 orourke"
 }
 
 @article{ao-crs-81
-, author =	"M. Albertson and C. J. O'Keefe"
-, title =	"Covering regions by squares"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	2
-, number =	3
-, year =	1981
-, pages =	"240--243"
-, keywords =	"covering, orthogon"
-, update =	"95.05 korneenko"
+, author =      "M. Albertson and C. J. O'Keefe"
+, title =       "Covering regions by squares"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      2
+, number =      3
+, year =        1981
+, pages =       "240--243"
+, keywords =    "covering, orthogon"
+, update =      "95.05 korneenko"
 }
 
 @book{ah-dma-88
-, author =	"M. O. Albertson and J. P. Hutchinson"
-, title =	"Discrete Mathematics with Algorithms"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1988
+, author =      "M. O. Albertson and J. P. Hutchinson"
+, title =       "Discrete Mathematics with Algorithms"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1988
 }
 
 @inproceedings{a-hagcp-86
-, author =	"A. Albrecht"
-, title =	"On hardware algorithms for geometric computation problems"
-, booktitle =	"Proc. IFIP 10th World Comput. Congr., Dublin 1986, Amsterdam"
-, year =	1986
-, pages =	"989--994"
-, keywords =	"parallel computations, Delaunay triangulation, point location, diameter relative neighborhood graph"
-, update =	"95.05 korneenko"
+, author =      "A. Albrecht"
+, title =       "On hardware algorithms for geometric computation problems"
+, booktitle =   "Proc. IFIP 10th World Comput. Congr., Dublin 1986, Amsterdam"
+, year =        1986
+, pages =       "989--994"
+, keywords =    "parallel computations, Delaunay triangulation, point location, diameter relative neighborhood graph"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{a-ccpo-84
-, author =	"A. Albrecht"
-, title =	"On the circuit complexity of planar objects"
-, booktitle =	"Proc. 7th IEEE Internat. Conf. Pattern Recogn."
-, site =	"Montreal, PQ"
-, year =	1984
-, pages =	"468--470"
+, author =      "A. Albrecht"
+, title =       "On the circuit complexity of planar objects"
+, booktitle =   "Proc. 7th IEEE Internat. Conf. Pattern Recogn."
+, site =        "Montreal, PQ"
+, year =        1984
+, pages =       "468--470"
 }
 
 @techreport{a-vcsgc-84
-, author =	"A. Albrecht"
-, title =	"On the {VLSI} complexity of some geometrical computation problems"
-, type =	"Report"
-, number =	86
-, institution =	"Sektion Math., Humboldt Univ."
-, address =	"Berlin, West Germany"
-, year =	1984
+, author =      "A. Albrecht"
+, title =       "On the {VLSI} complexity of some geometrical computation problems"
+, type =        "Report"
+, number =      86
+, institution = "Sektion Math., Humboldt Univ."
+, address =     "Berlin, West Germany"
+, year =        1984
 }
 
 @book{az-igs-67
-, author =	"A. D. Aleksandrov and U. A. Zalgaller"
-, title =	"Intrinsic Geometry of Surfaces"
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1967
-, update =	"98.07 orourke"
+, author =      "A. D. Aleksandrov and U. A. Zalgaller"
+, title =       "Intrinsic Geometry of Surfaces"
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1967
+, update =      "98.07 orourke"
 }
 
 @inproceedings{alms-eaaws-98
-, author =	"Lyudmil Aleksandrov and Mark Lanthier and Anil Maheshwari and J{\"o}rg-R{\"u}diger Sack"
-, title =	"An {$\epsilon$}-Approximation Algorithm for Weighted Shortest Path Queries on Polyhedral Surfaces"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"19--21"
-, update =	"00.03 bibrelex, 98.07 bibrelex+mitchell, 98.03 mitchell"
+, author =      "Lyudmil Aleksandrov and Mark Lanthier and Anil Maheshwari and J{\"o}rg-R{\"u}diger Sack"
+, title =       "An {$\epsilon$}-Approximation Algorithm for Weighted Shortest Path Queries on Polyhedral Surfaces"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "19--21"
+, update =      "00.03 bibrelex, 98.07 bibrelex+mitchell, 98.03 mitchell"
 }
 
 @inproceedings{alms-eaaws-98b
-, author =	"L. Aleksandrov and M. Lanthier and A. Maheshwari and J.-R. Sack"
-, title =	"An {$\epsilon$}-Approximation Algorithm for Weighted Shortest Paths on Polyhedral Surfaces"
-, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '98"
-, site =	"Stockholm"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1432
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"11--22"
-, update =	"99.03 bibrelex, 98.07 mitchell"
+, author =      "L. Aleksandrov and M. Lanthier and A. Maheshwari and J.-R. Sack"
+, title =       "An {$\epsilon$}-Approximation Algorithm for Weighted Shortest Paths on Polyhedral Surfaces"
+, booktitle =   "Proc. 6th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '98"
+, site =        "Stockholm"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1432
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "11--22"
+, update =      "99.03 bibrelex, 98.07 mitchell"
 }
 
 @inproceedings{akllr-rwuts-79
-, author =	"R. Aleliunas and R. M. Karp and R. J. Lipton and L. Lov{\'a}sz and C. Rackoff"
-, title =	"Random walks, universal traversal sequences, and the complexity of maze problems"
-, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1979
-, pages =	"218--223"
+, author =      "R. Aleliunas and R. M. Karp and R. J. Lipton and L. Lov{\'a}sz and C. Rackoff"
+, title =       "Random walks, universal traversal sequences, and the complexity of maze problems"
+, booktitle =   "Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1979
+, pages =       "218--223"
 }
 
 @phdthesis{a-adral-88
-, author =	"Panagiotis Alevizos"
-, title =	"Arrangements de rayons: application {\`a} la reconstruction de formes planes"
-, type =	"Th{\`e}se de Doctorat en Sciences"
-, school =	"Uni\-ver\-sit{\'e} Paris-Sud"
-, address =	"Orsay, France"
-, year =	1988
-, keywords =	"doctoral thesis"
-, update =	"99.07 devillers, 93.09 rote, 93.05 jones"
+, author =      "Panagiotis Alevizos"
+, title =       "Arrangements de rayons: application {\`a} la reconstruction de formes planes"
+, type =        "Th{\`e}se de Doctorat en Sciences"
+, school =      "Uni\-ver\-sit{\'e} Paris-Sud"
+, address =     "Orsay, France"
+, year =        1988
+, keywords =    "doctoral thesis"
+, update =      "99.07 devillers, 93.09 rote, 93.05 jones"
 }
 
 @techreport{abst-oaccs-90
-, author =	"Panagiotis Alevizos and V. Bistiolas and D. Sofotassios and A. Tsakalidis"
-, title =	"An Optimal Algorithm for Computing the Closure of a Set of Planar Rectangles and Locked-Transaction Systems"
-, type =	"Technical {Report}"
-, number =	"90.11.33"
-, institution =	"Univ. of Patras"
-, address =	"Greece"
-, year =	1990
-, update =	"99.07 devillers, 93.09 milone+mitchell"
+, author =      "Panagiotis Alevizos and V. Bistiolas and D. Sofotassios and A. Tsakalidis"
+, title =       "An Optimal Algorithm for Computing the Closure of a Set of Planar Rectangles and Locked-Transaction Systems"
+, type =        "Technical {Report}"
+, number =      "90.11.33"
+, institution = "Univ. of Patras"
+, address =     "Greece"
+, year =        1990
+, update =      "99.07 devillers, 93.09 milone+mitchell"
 }
 
 @incollection{abp-oabcu-89
-, author =	"Panagiotis Alevizos and Jean-Daniel Boissonnat and Franco P. Preparata"
-, title =	"An optimal algorithm for the boundary of a cell in a union of rays"
-, booktitle =	"Geometry and Robotics"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	391
-, year =	1989
-, pages =	"247--274"
-, update =	"99.07 devillers, 97.11 bibrelex, 95.05 korneenko"
+, author =      "Panagiotis Alevizos and Jean-Daniel Boissonnat and Franco P. Preparata"
+, title =       "An optimal algorithm for the boundary of a cell in a union of rays"
+, booktitle =   "Geometry and Robotics"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      391
+, year =        1989
+, pages =       "247--274"
+, update =      "99.07 devillers, 97.11 bibrelex, 95.05 korneenko"
 }
 
 @article{abp-oabcu-90
-, author =	"Panagiotis Alevizos and Jean-Daniel Boissonnat and Franco P. Preparata"
-, title =	"An optimal algorithm for the boundary of a cell in a union of rays"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"573--590"
-, succeeds =	"abp-oabcu-89"
-, precedes =	"abp-oabcu-91"
-, update =	"99.07 devillers, 95.05 korneenko"
+, author =      "Panagiotis Alevizos and Jean-Daniel Boissonnat and Franco P. Preparata"
+, title =       "An optimal algorithm for the boundary of a cell in a union of rays"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "573--590"
+, succeeds =    "abp-oabcu-89"
+, precedes =    "abp-oabcu-91"
+, update =      "99.07 devillers, 95.05 korneenko"
 }
 
 @article{abp-oabcu-91
-, author =	"Panagiotis Alevizos and Jean-Daniel Boissonnat and Franco P. Preparata"
-, title =	"An optimal algorithm for the boundary of a cell in a union of rays: {C}orrigendum"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"292--293"
-, succeeds =	"abp-oabcu-90"
-, update =	"99.07 devillers, 95.09 agarwal"
+, author =      "Panagiotis Alevizos and Jean-Daniel Boissonnat and Franco P. Preparata"
+, title =       "An optimal algorithm for the boundary of a cell in a union of rays: {C}orrigendum"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "292--293"
+, succeeds =    "abp-oabcu-90"
+, update =      "99.07 devillers, 95.09 agarwal"
 }
 
 @inproceedings{abp-bur-89
-, author =	"Panagiotis Alevizos and Jean-Daniel Boissonnat and F. P. Preparata"
-, title =	"On the boundary of a union of rays"
-, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	349
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"72--83"
-, update =	"99.07 devillers"
+, author =      "Panagiotis Alevizos and Jean-Daniel Boissonnat and F. P. Preparata"
+, title =       "On the boundary of a union of rays"
+, booktitle =   "Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      349
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "72--83"
+, update =      "99.07 devillers"
 }
 
 @techreport{aby-oisra-89
-, author =	"Panagiotis Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
-, title =	"On the order induced by a set of rays, with application to the probing of non-convex polygons"
-, type =	"Manuscript"
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, year =	1989
-, keywords =	"robotics, probing, shape, worst-case analysis, rays, polygons, two-dimensional"
-, update =	"99.07 devillers"
+, author =      "Panagiotis Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
+, title =       "On the order induced by a set of rays, with application to the probing of non-convex polygons"
+, type =        "Manuscript"
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, year =        1989
+, keywords =    "robotics, probing, shape, worst-case analysis, rays, polygons, two-dimensional"
+, update =      "99.07 devillers"
 }
 
 @inproceedings{a-aorsd-98
-, author =	"Panagiotis D. Alevizos"
-, title =	"An Algorithm for Orthogonal Range Search in {$d\ge3$} Dimensions"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"23--25"
-, cites =	"cg-fc2a-86, ht-fafnc-84, ps-cgi-85, ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Panagiotis D. Alevizos"
+, title =       "An Algorithm for Orthogonal Range Search in {$d\ge3$} Dimensions"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "23--25"
+, cites =       "cg-fc2a-86, ht-fafnc-84, ps-cgi-85, ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{aby-ooacr-87
-, author =	"Panagiotis D. Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
-, title =	"An optimal {$O(n \log n)$} algorithm for contour reconstruction from rays"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"162--170"
-, precedes =	"aby-nccr-90"
-, cites =	"aes-solac-85, b-gstds-84, b-dscns-84, c-clps-85, cg-vippg-85, cy-sp-83, cr-tgsps-85, k-ss-73, l-egimv-85, o-uocd-86, ps-cgi-85, r-cscsl-87, rit-cscsl-86,"
-, update =	"99.07 devillers, 98.03 bibrelex, 93.09 milone+mitchell"
+, author =      "Panagiotis D. Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
+, title =       "An optimal {$O(n \log n)$} algorithm for contour reconstruction from rays"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "162--170"
+, precedes =    "aby-nccr-90"
+, cites =       "aes-solac-85, b-gstds-84, b-dscns-84, c-clps-85, cg-vippg-85, cy-sp-83, cr-tgsps-85, k-ss-73, l-egimv-85, o-uocd-86, ps-cgi-85, r-cscsl-87, rit-cscsl-86,"
+, update =      "99.07 devillers, 98.03 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{aby-nccr-90
-, author =	"Panagiotis D. Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
-, title =	"Non-convex contour reconstruction"
-, journal =	"J. Symbolic Comput."
-, volume =	10
-, year =	1990
-, pages =	"225--252"
-, keywords =	"reconstruction, shape, polygon, probing"
-, succeeds =	"aby-ooacr-87"
-, update =	"99.07 devillers, 95.05 korneenko, 93.09 milone+mitchell"
+, author =      "Panagiotis D. Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
+, title =       "Non-convex contour reconstruction"
+, journal =     "J. Symbolic Comput."
+, volume =      10
+, year =        1990
+, pages =       "225--252"
+, keywords =    "reconstruction, shape, polygon, probing"
+, succeeds =    "aby-ooacr-87"
+, update =      "99.07 devillers, 95.05 korneenko, 93.09 milone+mitchell"
 }
 
 @inproceedings{aby-pncp-89
-, author =	"Panagiotis D. Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
-, title =	"Probing non-convex polygons"
-, booktitle =	"Proc. 6th IEEE Internat. Conf. Robot. Autom."
-, year =	1989
-, pages =	"202--208"
-, update =	"99.07 devillers"
+, author =      "Panagiotis D. Alevizos and Jean-Daniel Boissonnat and Mariette Yvinec"
+, title =       "Probing non-convex polygons"
+, booktitle =   "Proc. 6th IEEE Internat. Conf. Robot. Autom."
+, year =        1989
+, pages =       "202--208"
+, update =      "99.07 devillers"
 }
 
 @incollection{abc-gdtud-97
-, author =	"J. R. Alexander and J. Beck and W. W. L. Chen"
-, title =	"Geometric discrepancy theory and uniform distribution"
-, chapter =	10
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"185--208"
-, update =	"97.11 orourke"
+, author =      "J. R. Alexander and J. Beck and W. W. L. Chen"
+, title =       "Geometric discrepancy theory and uniform distribution"
+, chapter =     10
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "185--208"
+, update =      "97.11 orourke"
 }
 
 @phdthesis{a-copmh-89
-, author =	"R. Alexander"
-, title =	"Construction of Optimal-Path Maps for Homogeneous-Cost-Region Path-Planning Problems"
-, type =	"Ph.{D}. Thesis"
-, school =	"Computer Science, U.S. Naval Postgraduate School"
-, address =	"Monterey, CA"
-, year =	1989
-, keywords =	"doctoral thesis"
+, author =      "R. Alexander"
+, title =       "Construction of Optimal-Path Maps for Homogeneous-Cost-Region Path-Planning Problems"
+, type =        "Ph.{D}. Thesis"
+, school =      "Computer Science, U.S. Naval Postgraduate School"
+, address =     "Monterey, CA"
+, year =        1989
+, keywords =    "doctoral thesis"
 }
 
 @article{a-gmtud-90
-, author =	"R. Alexander"
-, title =	"Geometric methods in the theory of uniform distribution"
-, journal =	"Combinatorica"
-, volume =	10
-, number =	2
-, year =	1990
-, pages =	"115--136"
-, update =	"93.09 matousek"
+, author =      "R. Alexander"
+, title =       "Geometric methods in the theory of uniform distribution"
+, journal =     "Combinatorica"
+, volume =      10
+, number =      2
+, year =        1990
+, pages =       "115--136"
+, update =      "93.09 matousek"
 }
 
 @article{a-lmtmc-85
-, author =	"R. Alexander"
-, title =	"Lipschitzian mappings and total mean curvature of polyhedral surfaces I"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	288
-, number =	2
-, year =	1985
-, pages =	"661--678"
-, update =	"98.07 bibrelex"
+, author =      "R. Alexander"
+, title =       "Lipschitzian mappings and total mean curvature of polyhedral surfaces I"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      288
+, number =      2
+, year =        1985
+, pages =       "661--678"
+, update =      "98.07 bibrelex"
 }
 
 @article{a-pnmsi-91
-, author =	"R. Alexander"
-, title =	"Principles of a new method in the study of irregularities of distribution"
-, journal =	"Invent. Math."
-, volume =	103
-, year =	1991
-, pages =	"279--296"
-, update =	"94.05 matousek"
+, author =      "R. Alexander"
+, title =       "Principles of a new method in the study of irregularities of distribution"
+, journal =     "Invent. Math."
+, volume =      103
+, year =        1991
+, pages =       "279--296"
+, update =      "94.05 matousek"
 }
 
 @techreport{ar-gpppo-89
-, author =	"R. Alexander and N. Rowe"
-, title =	"Geometrical Principles for Path Planning by Optimal-Path-Map Construction for Linear and Polygonal Homogeneous-Region Terrain"
-, institution =	"Computer Science, U.S. Naval Postgraduate School"
-, address =	"Monterey, CA"
-, year =	1989
+, author =      "R. Alexander and N. Rowe"
+, title =       "Geometrical Principles for Path Planning by Optimal-Path-Map Construction for Linear and Polygonal Homogeneous-Region Terrain"
+, institution = "Computer Science, U.S. Naval Postgraduate School"
+, address =     "Monterey, CA"
+, year =        1989
 }
 
 @inproceedings{ar-ppopm-90
-, author =	"R. Alexander and N. Rowe"
-, title =	"Path Planning by Optimal-Path-Map Construction for Homogeneous-Cost Two-Dimensional Regions"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1990
+, author =      "R. Alexander and N. Rowe"
+, title =       "Path Planning by Optimal-Path-Map Construction for Homogeneous-Cost Two-Dimensional Regions"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1990
 }
 
 @article{aw-aps-81
-, author =	"G. L. Alexanderson and J. E. Wetzel"
-, title =	"Arrangements of planes in space"
-, journal =	"Discrete Math."
-, volume =	34
-, year =	1981
-, pages =	"219--240"
-, update =	"98.07 agarwal, 98.03 agarwal"
+, author =      "G. L. Alexanderson and J. E. Wetzel"
+, title =       "Arrangements of planes in space"
+, journal =     "Discrete Math."
+, volume =      34
+, year =        1981
+, pages =       "219--240"
+, update =      "98.07 agarwal, 98.03 agarwal"
 }
 
 @article{aw-dpo-77
-, author =	"G. L. Alexanderson and J. E. Wetzel"
-, title =	"Dissections of a plane oval"
-, journal =	"Amer. Math. Monthly"
-, volume =	84
-, year =	1977
-, pages =	"442--449"
-, update =	"98.07 agarwal, 98.03 agarwal"
+, author =      "G. L. Alexanderson and J. E. Wetzel"
+, title =       "Dissections of a plane oval"
+, journal =     "Amer. Math. Monthly"
+, volume =      84
+, year =        1977
+, pages =       "442--449"
+, update =      "98.07 agarwal, 98.03 agarwal"
 }
 
 @article{aw-sps-78
-, author =	"G. L. Alexanderson and J. E. Wetzel"
-, title =	"Simple partitions of space"
-, journal =	"Math. Mag."
-, volume =	51
-, year =	1978
-, pages =	"220--225"
-, update =	"98.07 agarwal, 98.03 mitchell"
+, author =      "G. L. Alexanderson and J. E. Wetzel"
+, title =       "Simple partitions of space"
+, journal =     "Math. Mag."
+, volume =      51
+, year =        1978
+, pages =       "220--225"
+, update =      "98.07 agarwal, 98.03 mitchell"
 }
 
 @article{at-eserh-87
-, author =	"N. A. Alexandridis and P. D. Tsanakas"
-, title =	"An encoding scheme for the efficient representation of hierarchical image structures"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"199--206"
+, author =      "N. A. Alexandridis and P. D. Tsanakas"
+, title =       "An encoding scheme for the efficient representation of hierarchical image structures"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "199--206"
 }
 
 @book{ah-t1-35
-, author =	"P. Alexandroff and H. Hopf"
-, title =	"Topologie {I}"
-, series =	"Grundlehren der math"
-, volume =	45
-, publisher =	"Julius Springer"
-, address =	"Berlin, Germany"
-, year =	1935
+, author =      "P. Alexandroff and H. Hopf"
+, title =       "Topologie {I}"
+, series =      "Grundlehren der math"
+, volume =      45
+, publisher =   "Julius Springer"
+, address =     "Berlin, Germany"
+, year =        1935
 }
 
 @book{a-digdk-55
-, author =	"A. D. Alexandrov"
-, title =	"Die innere Geometrie der konvexen Fl{\"a}chen"
-, publisher =	"Akademie-Verlag"
-, address =	"Berlin, Germany"
-, year =	1955
-, update =	"97.11 bibrelex"
+, author =      "A. D. Alexandrov"
+, title =       "Die innere Geometrie der konvexen Fl{\"a}chen"
+, publisher =   "Akademie-Verlag"
+, address =     "Berlin, Germany"
+, year =        1955
+, update =      "97.11 bibrelex"
 }
 
 @book{a-kp-58
-, author =	"A. D. Alexandrov"
-, title =	"Konvexe Polyeder"
-, publisher =	"Akademie-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1958
+, author =      "A. D. Alexandrov"
+, title =       "Konvexe Polyeder"
+, publisher =   "Akademie-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1958
 }
 
 @techreport{abfhz-csbp-90
-, author =	"M. Alfaro and J. Brock and J. Foisy and N. Hodges and J. Zimba"
-, title =	"Compound soap bubbles in the plane"
-, type =	"SMALL {Geometry} {Group} {Report}"
-, institution =	"Williams College"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "M. Alfaro and J. Brock and J. Foisy and N. Hodges and J. Zimba"
+, title =       "Compound soap bubbles in the plane"
+, type =        "SMALL {Geometry} {Group} {Report}"
+, institution = "Williams College"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @article{achlkkmh-scmfe-90
-, author =	"M. Alfaro and M. Conger and K. Hodges and A. Levy and R. Kochar and L. Kuklinski and Z. Mahmood and K. von Haam"
-, title =	"Segments can meet in fours in energy-minimizing networks"
-, journal =	"J. Und. Math."
-, volume =	"??"
-, year =	1990
-, pages =	"9--20"
-, update =	"97.11 bibrelex"
+, author =      "M. Alfaro and M. Conger and K. Hodges and A. Levy and R. Kochar and L. Kuklinski and Z. Mahmood and K. von Haam"
+, title =       "Segments can meet in fours in energy-minimizing networks"
+, journal =     "J. Und. Math."
+, volume =      "??"
+, year =        1990
+, pages =       "9--20"
+, update =      "97.11 bibrelex"
 }
 
 @article{achlkkmh-sspmn-91
-, author =	"M. Alfaro and M. Conger and K. Hodges and A. Levy and R. Kochar and L. Kuklinski and Z. Mahmood and K. von Haam"
-, title =	"The structure of singularities in {$\Phi$}-minimizing networks in {$R^{2}$}"
-, journal =	"Pacific J. Math."
-, volume =	"??"
-, year =	1991
-, note =	"To appear"
-, update =	"97.11 bibrelex"
+, author =      "M. Alfaro and M. Conger and K. Hodges and A. Levy and R. Kochar and L. Kuklinski and Z. Mahmood and K. von Haam"
+, title =       "The structure of singularities in {$\Phi$}-minimizing networks in {$R^{2}$}"
+, journal =     "Pacific J. Math."
+, volume =      "??"
+, year =        1991
+, note =        "To appear"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{a-csmpp-87
-, author =	"P. Alfeld"
-, title =	"A case study of multivariate piecewise polynomials"
-, editor =	"G. Farin"
-, booktitle =	"Geometric Modeling: Algorithms and New Trends"
-, publisher =	"SIAM Publications"
-, year =	1987
-, pages =	"149--160"
-, update =	"98.07 bibrelex"
+, author =      "P. Alfeld"
+, title =       "A case study of multivariate piecewise polynomials"
+, editor =      "G. Farin"
+, booktitle =   "Geometric Modeling: Algorithms and New Trends"
+, publisher =   "SIAM Publications"
+, year =        1987
+, pages =       "149--160"
+, update =      "98.07 bibrelex"
 }
 
 @article{a-dcitd-84
-, author =	"P. Alfeld"
-, title =	"A discrete {$C^{1}$} interpolant for tetrahedral data"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, year =	1984
-, pages =	"5--16"
+, author =      "P. Alfeld"
+, title =       "A discrete {$C^{1}$} interpolant for tetrahedral data"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, year =        1984
+, pages =       "5--16"
 }
 
 @article{ab-tcit-84
-, author =	"P. Alfeld and R. E. Barnhill"
-, title =	"A transfinite {$C^{2}$} interpolant over triangles"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, number =	1
-, year =	1984
-, pages =	"17--39"
+, author =      "P. Alfeld and R. E. Barnhill"
+, title =       "A transfinite {$C^{2}$} interpolant over triangles"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, number =      1
+, year =        1984
+, pages =       "17--39"
 }
 
 @article{as-sru3d-96
-, author =	"M.-E. Algorri and F. Schmitt"
-, title =	"Surface Reconstruction from Unstructured 3D Data"
-, journal =	"Comput. Graph. Forum"
-, volume =	15
-, number =	1
-, month =	mar
-, year =	1996
-, pages =	"47--60"
-, update =	"96.05 held"
+, author =      "M.-E. Algorri and F. Schmitt"
+, title =       "Surface Reconstruction from Unstructured 3D Data"
+, journal =     "Comput. Graph. Forum"
+, volume =      15
+, number =      1
+, month =       mar
+, year =        1996
+, pages =       "47--60"
+, update =      "96.05 held"
 }
 
 @inproceedings{aknw-pmccp-93
-, author =	"F. Alizadeh and R. M. Karp and L. A. Newberg and D. K. Weisser"
-, title =	"Physical Mapping of Chromosomes: {A} Combinatorial Problem in Molecular Biology"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"371--381"
-, update =	"93.05 smid"
+, author =      "F. Alizadeh and R. M. Karp and L. A. Newberg and D. K. Weisser"
+, title =       "Physical Mapping of Chromosomes: {A} Combinatorial Problem in Molecular Biology"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "371--381"
+, update =      "93.05 smid"
 }
 
 @article{ad-dessl-95
-, author =	"S. Allen and D. Dutta"
-, title =	"Determination and evaluation of support structures in layered manufacturing"
-, journal =	"Journal of Design and Manufacturing"
-, volume =	5
-, year =	1995
-, pages =	"153--162"
-, update =	"97.11 smid"
+, author =      "S. Allen and D. Dutta"
+, title =       "Determination and evaluation of support structures in layered manufacturing"
+, journal =     "Journal of Design and Manufacturing"
+, volume =      5
+, year =        1995
+, pages =       "153--162"
+, update =      "97.11 smid"
 }
 
 @inproceedings{ad-wtclm-97
-, author =	"S. Allen and D. Dutta"
-, title =	"Wall thickness control in layered manufacturing"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"240--247"
-, cites =	"ad-dessl-95, kd-asplm-96, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "S. Allen and D. Dutta"
+, title =       "Wall thickness control in layered manufacturing"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "240--247"
+, cites =       "ad-dessl-95, kd-asplm-96, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{ad-wtclm-98
-, author =	"Seth Allen and Debasish Dutta"
-, title =	"Wall thickness control in layered manufacturing for surfaces with closed slices"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"223--238"
-, succeeds =	"ad-wtclm-97"
-, update =	"98.11 devillers"
+, author =      "Seth Allen and Debasish Dutta"
+, title =       "Wall thickness control in layered manufacturing for surfaces with closed slices"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "223--238"
+, succeeds =    "ad-wtclm-97"
+, update =      "98.11 devillers"
 }
 
 @article{a-ssag-46
-, author =	"C. B. Allendoerfer"
-, title =	"``{Slope}'' in solid analytic geometry"
-, journal =	"Amer. Math. Monthly"
-, volume =	53
-, year =	1946
-, pages =	"241--247"
+, author =      "C. B. Allendoerfer"
+, title =       "``{Slope}'' in solid analytic geometry"
+, journal =     "Amer. Math. Monthly"
+, volume =      53
+, year =        1946
+, pages =       "241--247"
 }
 
 @article{ag-aplai-87
-, author =	"E. Allgower and S. Gnutzmann"
-, title =	"An algorithm for piecewise linear approximation of an implicitly defined two-dimensional surfaces"
-, journal =	"SIAM J. Numer. Anal."
-, volume =	24
-, year =	1987
-, pages =	"452--469"
-, keywords =	"surface-approximation"
-, update =	"95.05 agarwal"
+, author =      "E. Allgower and S. Gnutzmann"
+, title =       "An algorithm for piecewise linear approximation of an implicitly defined two-dimensional surfaces"
+, journal =     "SIAM J. Numer. Anal."
+, volume =      24
+, year =        1987
+, pages =       "452--469"
+, keywords =    "surface-approximation"
+, update =      "95.05 agarwal"
 }
 
 @article{as-cvp-86
-, author =	"F. L. Allgower and P. H. Schmidt"
-, title =	"Computing volumes of polyhedra"
-, journal =	"Math. Comput."
-, volume =	46
-, number =	173
-, year =	1986
-, pages =	"171--174"
-, keywords =	"volume"
-, update =	"95.05 korneenko"
+, author =      "F. L. Allgower and P. H. Schmidt"
+, title =       "Computing volumes of polyhedra"
+, journal =     "Math. Comput."
+, volume =      46
+, number =      173
+, year =        1986
+, pages =       "171--174"
+, keywords =    "volume"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{ad-pcltt-01
-, author =	"Pierre Alliez and Mathieu Desbrun"
-, title =	"Progressive Compression for Lossless Transmission of Triangles Meshes"
-, booktitle =	"Siggraph 2001"
-, year =	2001
-, update =	"01.07 devillers"
+, author =      "Pierre Alliez and Mathieu Desbrun"
+, title =       "Progressive Compression for Lossless Transmission of Triangles Meshes"
+, booktitle =   "Siggraph 2001"
+, year =        2001
+, update =      "01.07 devillers"
 }
 
 @inproceedings{ads-rdppw-98
-, author =	"Pierre Alliez and Olivier Devillers and Jack Snoeyink"
-, title =	"Removing Degeneracies by Perturbing the Problem or the World"
-, booktitle =	"Proc. 10th Canad. Conf. Comput. Geom."
-, year =	1998
-, url =	"http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-alliez-removing.ps.gz"
-, precedes =	"ads-rdppw-00"
-, cites =	"ecs-ephgd-97, em-sstcd-90, kmm-ricav-93a, ms-getcc-88, y-gctsp-90, ZZZ"
-, update =	"00.03 devillers, 99.11 bibrelex, 99.07 devillers, 98.11 devillers"
-, annote =	"extended abstract"
+, author =      "Pierre Alliez and Olivier Devillers and Jack Snoeyink"
+, title =       "Removing Degeneracies by Perturbing the Problem or the World"
+, booktitle =   "Proc. 10th Canad. Conf. Comput. Geom."
+, year =        1998
+, url = "http://cgm.cs.mcgill.ca/cccg98/proceedings/cccg98-alliez-removing.ps.gz"
+, precedes =    "ads-rdppw-00"
+, cites =       "ecs-ephgd-97, em-sstcd-90, kmm-ricav-93a, ms-getcc-88, y-gctsp-90, ZZZ"
+, update =      "00.03 devillers, 99.11 bibrelex, 99.07 devillers, 98.11 devillers"
+, annote =      "extended abstract"
 }
 
 @article{ads-rdppw-00
-, author =	"Pierre Alliez and Olivier Devillers and Jack Snoeyink"
-, title =	"Removing Degeneracies by Perturbing the Problem or the World"
-, journal =	"Reliable Computing"
-, volume =	6
-, year =	2000
-, pages =	"61--79"
-, note =	"Special Issue on Computational Geometry, to appear"
-, url =	"https://hal.inria.fr/inria-00338566"
-, succeeds =	"ads-rdppw-98"
-, update =	"00.03 devillers"
-, abstract =	"We describe two problem-specific approaches to remove geometric degeneracies that we call {\it perturbing the problem} and {\it perturbing the world}. Using as our primary examples 2-d and 3-d Delaunay triangulation with Euclidean and polygonal metrics, we show that these approaches lead to relatively simple and efficient perturbations of the points that do not depend on a fixed ordering or index. Thus, they produce canonical output, which is important for producing test suites and verifiers for randomized or dynamic geometric algorithms."
+, author =      "Pierre Alliez and Olivier Devillers and Jack Snoeyink"
+, title =       "Removing Degeneracies by Perturbing the Problem or the World"
+, journal =     "Reliable Computing"
+, volume =      6
+, year =        2000
+, pages =       "61--79"
+, note =        "Special Issue on Computational Geometry, to appear"
+, url = "https://inria.hal.science/inria-00338566"
+, succeeds =    "ads-rdppw-98"
+, update =      "00.03 devillers"
+, abstract =    "We describe two problem-specific approaches to remove geometric degeneracies that we call {\it perturbing the problem} and {\it perturbing the world}. Using as our primary examples 2-d and 3-d Delaunay triangulation with Euclidean and polygonal metrics, we show that these approaches lead to relatively simple and efficient perturbations of the points that do not depend on a fixed ordering or index. Thus, they produce canonical output, which is important for producing test suites and verifiers for randomized or dynamic geometric algorithms."
 }
 
 @article{an-cchsp-87
-, author =	"D. C. S. Allison and M. T. Noga"
-, title =	"Computing the convex hull of a set of points"
-, journal =	"Computer Physics Commun."
-, volume =	43
-, number =	3
-, year =	1987
-, pages =	"381--386"
-, keywords =	"convex hull, points"
-, update =	"95.05 korneenko"
+, author =      "D. C. S. Allison and M. T. Noga"
+, title =       "Computing the convex hull of a set of points"
+, journal =     "Computer Physics Commun."
+, volume =      43
+, number =      3
+, year =        1987
+, pages =       "381--386"
+, keywords =    "convex hull, points"
+, update =      "95.05 korneenko"
 }
 
 @article{an-sptch-84
-, author =	"D. C. S. Allison and M. T. Noga"
-, title =	"Some performance tests of convex hull algorithms"
-, journal =	"BIT"
-, volume =	24
-, year =	1984
-, pages =	"2--13"
+, author =      "D. C. S. Allison and M. T. Noga"
+, title =       "Some performance tests of convex hull algorithms"
+, journal =     "BIT"
+, volume =      24
+, year =        1984
+, pages =       "2--13"
 }
 
 @article{an-ltsp-84
-, author =	"D. C. S. Allison and M. T. Noga"
-, title =	"The {$L_{1}$} {Traveling} {Salesman} {Problem}"
-, journal =	"Inform. Process. Lett."
-, volume =	18
-, number =	4
-, year =	1984
-, pages =	"195--199"
-, update =	"95.05 korneenko"
+, author =      "D. C. S. Allison and M. T. Noga"
+, title =       "The {$L_{1}$} {Traveling} {Salesman} {Problem}"
+, journal =     "Inform. Process. Lett."
+, volume =      18
+, number =      4
+, year =        1984
+, pages =       "195--199"
+, update =      "95.05 korneenko"
 }
 
 @book{ag-hpc-90
-, author =	"G. S. Almasi and A. Gottlieb"
-, title =	"Highly parallel computing"
-, publisher =	"Benjamin/Cummings"
-, address =	"Redwood City, California"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "G. S. Almasi and A. Gottlieb"
+, title =       "Highly parallel computing"
+, publisher =   "Benjamin/Cummings"
+, address =     "Redwood City, California"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @article{apk-evaag-89
-, author =	"H. M. Alnuweiri and V. K. {Prasanna Kumar}"
-, title =	"An efficient {VLSI} architecture with applications to geometric problems"
-, journal =	"Parallel Comput."
-, volume =	12
-, number =	1
-, year =	1989
-, pages =	"71--94"
-, keywords =	"parallel computations, convex hull, intersection, diameter, proximity"
-, update =	"95.05 korneenko"
+, author =      "H. M. Alnuweiri and V. K. {Prasanna Kumar}"
+, title =       "An efficient {VLSI} architecture with applications to geometric problems"
+, journal =     "Parallel Comput."
+, volume =      12
+, number =      1
+, year =        1989
+, pages =       "71--94"
+, keywords =    "parallel computations, convex hull, intersection, diameter, proximity"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{apk-ogafs-88
-, author =	"H. M. Alnuweiri and V. K. {Prasanna Kumar}"
-, title =	"Optimal geometric algorithms on fixed-size linear arrays and scan-line ..."
-, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
-, year =	1988
-, pages =	"931--936"
-, keywords =	"parallel computations, intersection, distance"
-, update =	"95.05 korneenko"
+, author =      "H. M. Alnuweiri and V. K. {Prasanna Kumar}"
+, title =       "Optimal geometric algorithms on fixed-size linear arrays and scan-line ..."
+, booktitle =   "Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
+, year =        1988
+, pages =       "931--936"
+, keywords =    "parallel computations, intersection, distance"
+, update =      "95.05 korneenko"
 }
 
 @article{awb-av-88
-, author =	"J. Aloimonos and I. Weiss and A. Bandyopadhyay"
-, title =	"Active vision"
-, journal =	"Internat. J. Comput. Vision"
-, volume =	2
-, year =	1988
-, pages =	"333--356"
-, update =	"98.07 bibrelex"
+, author =      "J. Aloimonos and I. Weiss and A. Bandyopadhyay"
+, title =       "Active vision"
+, journal =     "Internat. J. Comput. Vision"
+, volume =      2
+, year =        1988
+, pages =       "333--356"
+, update =      "98.07 bibrelex"
 }
 
 @article{a-egesr-86
-, author =	"N. Alon"
-, title =	"Eigenvalues, geometric expanders, sorting in rounds and {Ramsey} theory"
-, journal =	"Combinatorica"
-, volume =	6
-, year =	1986
-, pages =	"207--219"
-, update =	"98.03 bibrelex"
+, author =      "N. Alon"
+, title =       "Eigenvalues, geometric expanders, sorting in rounds and {Ramsey} theory"
+, journal =     "Combinatorica"
+, volume =      6
+, year =        1986
+, pages =       "207--219"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{a-esrsl-85
-, author =	"N. Alon"
-, title =	"Expanders, sorting in rounds and superconcentrators of limited depth"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
-, year =	1985
-, pages =	"98--102"
-, update =	"98.03 bibrelex"
+, author =      "N. Alon"
+, title =       "Expanders, sorting in rounds and superconcentrators of limited depth"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Theory Comput."
+, year =        1985
+, pages =       "98--102"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{a-tha-95
-, author =	"N. Alon"
-, title =	"Tools from Higher Algebra"
-, editor =	"R. L. Graham and M. Gr{\" o}tschel and L. Lov{\' a}sz"
-, booktitle =	"Handbook of Combinatorics"
-, publisher =	"Elsevier"
-, address =	"Amsterdam"
-, year =	1995
-, pages =	"1749--1783"
-, update =	"98.03 agarwal"
+, author =      "N. Alon"
+, title =       "Tools from Higher Algebra"
+, editor =      "R. L. Graham and M. Gr{\" o}tschel and L. Lov{\' a}sz"
+, booktitle =   "Handbook of Combinatorics"
+, publisher =   "Elsevier"
+, address =     "Amsterdam"
+, year =        1995
+, pages =       "1749--1783"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{aa-csstm-92
-, author =	"N. Alon and Y. Azar"
-, title =	"Comparison-sorting and selecting in totally monotone matrices"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"403--408"
+, author =      "N. Alon and Y. Azar"
+, title =       "Comparison-sorting and selecting in totally monotone matrices"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "403--408"
 }
 
 @article{aa-fam-89
-, author =	"N. Alon and Y. Azar"
-, title =	"Finding the approximate maximum"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, number =	2
-, year =	1989
-, pages =	"258--267"
-, update =	"95.05 korneenko"
+, author =      "N. Alon and Y. Azar"
+, title =       "Finding the approximate maximum"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, number =      2
+, year =        1989
+, pages =       "258--267"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{aa-olste-92
-, author =	"N. Alon and Y. Azar"
-, title =	"On-line {Steiner} trees in the {Euclidean} plane"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"337--343"
-, keywords =	"Steiner tree, points, on-line algorithms, competitive algorithms"
-, precedes =	"aa-olste-93"
-, cites =	"bm-tspkd-, bs-athet-80, cv-crcns-91, iw-dstp-91, gj-cigtn-79, m-gpinn-87, n-ps-82, rsl-ashts-77, st-aelup-85, w-spns-87, y-pctum-77, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 95.05 korneenko"
+, author =      "N. Alon and Y. Azar"
+, title =       "On-line {Steiner} trees in the {Euclidean} plane"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "337--343"
+, keywords =    "Steiner tree, points, on-line algorithms, competitive algorithms"
+, precedes =    "aa-olste-93"
+, cites =       "bm-tspkd-, bs-athet-80, cv-crcns-91, iw-dstp-91, gj-cigtn-79, m-gpinn-87, n-ps-82, rsl-ashts-77, st-aelup-85, w-spns-87, y-pctum-77, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 95.05 korneenko"
 }
 
 @article{aa-olste-93
-, author =	"N. Alon and Y. Azar"
-, title =	"On-line {Steiner} trees in the {Euclidean} plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"113--121"
-, keywords =	"Steiner tree, points, on-line algorithms, competitive algorithms"
-, succeeds =	"aa-olste-92"
-, cites =	"bm-tspkd-, bs-athet-80, cv-crcns-91, iw-dstp-91, gj-cigtn-79, m-gpinn-87, n-ps-82, rsl-ashts-77, st-aelup-85, w-spns-87, y-pctum-77, ZZZ"
-, update =	"98.03 mitchell"
+, author =      "N. Alon and Y. Azar"
+, title =       "On-line {Steiner} trees in the {Euclidean} plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "113--121"
+, keywords =    "Steiner tree, points, on-line algorithms, competitive algorithms"
+, succeeds =    "aa-olste-92"
+, cites =       "bm-tspkd-, bs-athet-80, cv-crcns-91, iw-dstp-91, gj-cigtn-79, m-gpinn-87, n-ps-82, rsl-ashts-77, st-aelup-85, w-spns-87, y-pctum-77, ZZZ"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{aa-pcaap-88
-, author =	"N. Alon and Y. Azar"
-, title =	"Parallel Comparison Algorithms for Approximation Problems"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"194--203"
-, update =	"98.03 bibrelex"
+, author =      "N. Alon and Y. Azar"
+, title =       "Parallel Comparison Algorithms for Approximation Problems"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "194--203"
+, update =      "98.03 bibrelex"
 }
 
 @article{abfk-pswen-92
-, author =	"N. Alon and I. B{\'a}r{\'a}ny and Z. F{\"u}redi and D. Kleitman"
-, title =	"Point selections and weak $\varepsilon$-nets for convex hulls"
-, journal =	"Combin., Probab. Comput."
-, volume =	1
-, number =	3
-, year =	1992
-, pages =	"189--200"
-, update =	"94.05 matousek"
+, author =      "N. Alon and I. B{\'a}r{\'a}ny and Z. F{\"u}redi and D. Kleitman"
+, title =       "Point selections and weak $\varepsilon$-nets for convex hulls"
+, journal =     "Combin., Probab. Comput."
+, volume =      1
+, number =      3
+, year =        1992
+, pages =       "189--200"
+, update =      "94.05 matousek"
 }
 
 @techreport{abfk-pswen-91
-, author =	"N. Alon and I. B{\'a}r{\'a}ny and Z. F{\"u}redi and D. J. Kleitman"
-, title =	"Point selections and weak $\varepsilon$-nets for convex hulls"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "N. Alon and I. B{\'a}r{\'a}ny and Z. F{\"u}redi and D. J. Kleitman"
+, title =       "Point selections and weak $\varepsilon$-nets for convex hulls"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @article{ae-degg-89
-, author =	"N. Alon and P. Erd{\H o}s"
-, title =	"Disjoint edges in geometric graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"287--290"
+, author =      "N. Alon and P. Erd{\H o}s"
+, title =       "Disjoint edges in geometric graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "287--290"
 }
 
 @article{afk-sppsb-85
-, author =	"N. Alon and Z. F{\"u}redi and M. Katchalski"
-, title =	"Separating pairs of points by standard boxes"
-, journal =	"European J. Combin."
-, volume =	6
-, number =	3
-, year =	1985
-, pages =	"205--210"
-, update =	"95.05 korneenko"
+, author =      "N. Alon and Z. F{\"u}redi and M. Katchalski"
+, title =       "Separating pairs of points by standard boxes"
+, journal =     "European J. Combin."
+, volume =      6
+, number =      3
+, year =        1985
+, pages =       "205--210"
+, update =      "95.05 korneenko"
 }
 
 @article{aghp-scakw-92
-, author =	"N. Alon and O. Goldreich and J. H{\aa}stad and R. Peralta"
-, title =	"Simple construction of almost $k$-wise independent random variables"
-, journal =	"Random Structures and Algorithms"
-, volume =	3
-, year =	1992
-, pages =	"289--304"
-, update =	"95.01 matousek"
+, author =      "N. Alon and O. Goldreich and J. H{\aa}stad and R. Peralta"
+, title =       "Simple construction of almost $k$-wise independent random variables"
+, journal =     "Random Structures and Algorithms"
+, volume =      3
+, year =        1992
+, pages =       "289--304"
+, update =      "95.01 matousek"
 }
 
 @article{ag-nssfs-86
-, author =	"N. Alon and E. Gy{\H o}ri"
-, title =	"The number of small semispaces of a finite set of points in the plane"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	41
-, year =	1986
-, pages =	"154--157"
-, update =	"95.09 agarwal, 94.09 bernal"
+, author =      "N. Alon and E. Gy{\H o}ri"
+, title =       "The number of small semispaces of a finite set of points in the plane"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      41
+, year =        1986
+, pages =       "154--157"
+, update =      "95.09 agarwal, 94.09 bernal"
 }
 
 @inproceedings{ahw-pgers-87
-, author =	"N. Alon and D. Haussler and Emo Welzl"
-, title =	"Partitioning and geometric embedding of range spaces of finite {Vapnik}-{Chervonenkis} dimension"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"331--340"
-, cites =	"a-esrsl-85, a-egesr-86, f-lbcso-81, h-ct-67, hw-ensrq-87, l-cpe-79, s-dfs-72, vc-ucrfe-71, w-pr-82, yy-gaddg-85, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "N. Alon and D. Haussler and Emo Welzl"
+, title =       "Partitioning and geometric embedding of range spaces of finite {Vapnik}-{Chervonenkis} dimension"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "331--340"
+, cites =       "a-esrsl-85, a-egesr-86, f-lbcso-81, h-ct-67, hw-ensrq-87, l-cpe-79, s-dfs-72, vc-ucrfe-71, w-pr-82, yy-gaddg-85, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{ak-spubt-85
-, author =	"N. Alon and G. Kalai"
-, title =	"A simple proof of the upper bound theorem"
-, journal =	"European J. Combin."
-, volume =	6
-, year =	1985
-, pages =	"211--214"
-, update =	"97.11 bibrelex"
+, author =      "N. Alon and G. Kalai"
+, title =       "A simple proof of the upper bound theorem"
+, journal =     "European J. Combin."
+, volume =      6
+, year =        1985
+, pages =       "211--214"
+, update =      "97.11 bibrelex"
 }
 
 @article{ak-bpn-95
-, author =	"N. Alon and G. Kalai"
-, title =	"Bounding the piercing number"
-, journal =	"Discrete Comput. Geom."
-, volume =	13
-, year =	1995
-, pages =	"245--256"
-, update =	"95.09 wenger"
+, author =      "N. Alon and G. Kalai"
+, title =       "Bounding the piercing number"
+, journal =     "Discrete Comput. Geom."
+, volume =      13
+, year =        1995
+, pages =       "245--256"
+, update =      "95.09 wenger"
 }
 
 @article{akp-cddsl-89
-, author =	"N. Alon and M. Katchalski and W. R. Pulleyblank"
-, title =	"Cutting disjoint disks by straight lines"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"239--243"
+, author =      "N. Alon and M. Katchalski and W. R. Pulleyblank"
+, title =       "Cutting disjoint disks by straight lines"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "239--243"
 }
 
 @article{akp-mscpr-89
-, author =	"N. Alon and M. Katchalski and W. R. Pulleyblank"
-, title =	"The maximum size of a convex polygon in a restricted set of points in the plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"245--251"
+, author =      "N. Alon and M. Katchalski and W. R. Pulleyblank"
+, title =       "The maximum size of a convex polygon in a restricted set of points in the plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "245--251"
 }
 
 @article{ak-pcs-92a
-, author =	"N. Alon and D. Kleitman"
-, title =	"Piercing convex sets and the {Hadwiger}--{Debrunner} $(p,q)$-problem"
-, journal =	"Adv. Math."
-, volume =	96
-, number =	1
-, year =	1992
-, pages =	"103--112"
-, succeeds =	"ak-pcs-92i"
-, update =	"95.09 wenger"
+, author =      "N. Alon and D. Kleitman"
+, title =       "Piercing convex sets and the {Hadwiger}--{Debrunner} $(p,q)$-problem"
+, journal =     "Adv. Math."
+, volume =      96
+, number =      1
+, year =        1992
+, pages =       "103--112"
+, succeeds =    "ak-pcs-92i"
+, update =      "95.09 wenger"
 }
 
 @article{ak-csspr-86
-, author =	"N. Alon and D. J. Kleitman"
-, title =	"Covering a square by small perimeter rectangles"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"1--7"
+, author =      "N. Alon and D. J. Kleitman"
+, title =       "Covering a square by small perimeter rectangles"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "1--7"
 }
 
 @inproceedings{ak-pcs-92i
-, author =	"N. Alon and D. J. Kleitman"
-, title =	"Piercing convex sets"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"157--160"
-, cites =	"abfk-pswen-92, ak-spubt-85, b-gct-82, dgk-htir-63, d-cp-72, e-ubtfc-85, e-hrctt-93, f-ipcfc-74, g-iss-59, g-lcg-74, hd-uevzh-57, hdk-cgp-64, h-umkkm-23, kl-pgr-79, k-ipcs-84, s-tlip-86, t-grt-66, w-uekgf-65, w-dcnfc-75, w-uhgs-85, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "N. Alon and D. J. Kleitman"
+, title =       "Piercing convex sets"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "157--160"
+, cites =       "abfk-pswen-92, ak-spubt-85, b-gct-82, dgk-htir-63, d-cp-72, e-ubtfc-85, e-hrctt-93, f-ipcfc-74, g-iss-59, g-lcg-74, hd-uevzh-57, hdk-cgp-64, h-umkkm-23, kl-pgr-79, k-ipcs-84, s-tlip-86, t-grt-66, w-uekgf-65, w-dcnfc-75, w-uhgs-85, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{am-plpfd-90
-, author =	"N. Alon and N. Megiddo"
-, title =	"Parallel linear programming in fixed dimension almost surely in constant time"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"574--582"
+, author =      "N. Alon and N. Megiddo"
+, title =       "Parallel linear programming in fixed dimension almost surely in constant time"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "574--582"
 }
 
 @article{ap-ieggs-86
-, author =	"N. Alon and M. A. Perles"
-, title =	"On the intersection of edges of a geometric graph by straight lines"
-, journal =	"Discrete Math."
-, volume =	60
-, year =	1986
-, pages =	"75--90"
-, keywords =	"intersection, geometric graphs"
-, update =	"95.05 korneenko"
+, author =      "N. Alon and M. A. Perles"
+, title =       "On the intersection of edges of a geometric graph by straight lines"
+, journal =     "Discrete Math."
+, volume =      60
+, year =        1986
+, pages =       "75--90"
+, keywords =    "intersection, geometric graphs"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{ars-lnccp-93
-, author =	"N. Alon and S. Rajagopalan and Subhash Suri"
-, title =	"Long non-crossing configurations in the plane"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"257--263"
-, cites =	"aa-dsgh-89, gj-cigtn-79, hs-asdch-92, kln-ncstl-91, l-pstp-83, llrs-tsp-85, pss-ubnpk-89, p-etspi-77, r-cscsl-87,"
-, update =	"98.03 bibrelex+mitchell, 93.09 jones"
+, author =      "N. Alon and S. Rajagopalan and Subhash Suri"
+, title =       "Long non-crossing configurations in the plane"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "257--263"
+, cites =       "aa-dsgh-89, gj-cigtn-79, hs-asdch-92, kln-ncstl-91, l-pstp-83, llrs-tsp-85, pss-ubnpk-89, p-etspi-77, r-cscsl-87,"
+, update =      "98.03 bibrelex+mitchell, 93.09 jones"
 }
 
 @techreport{as-opaol-87
-, author =	"N. Alon and B. Schieber"
-, title =	"Optimal preprocessing for answering on-line product queries"
-, number =	"TR 71/87"
-, institution =	"The Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "N. Alon and B. Schieber"
+, title =       "Optimal preprocessing for answering on-line product queries"
+, number =      "TR 71/87"
+, institution = "The Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{ast-ps-94
-, author =	"N. Alon and P. Seymour and R. Thomas"
-, title =	"Planar separators"
-, journal =	"SIAM J. Discrete Math."
-, volume =	2
-, number =	7
-, year =	1994
-, pages =	"184--193"
-, update =	"97.11 bibrelex"
+, author =      "N. Alon and P. Seymour and R. Thomas"
+, title =       "Planar separators"
+, journal =     "SIAM J. Discrete Math."
+, volume =      2
+, number =      7
+, year =        1994
+, pages =       "184--193"
+, update =      "97.11 bibrelex"
 }
 
 @book{as-pm-92
-, author =	"N. Alon and J. Spencer"
-, title =	"The {P}robabilistic {M}ethod"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1992
-, update =	"99.11 bibrelex, 98.11 bibrelex, 97.03 agarwal, 94.01 matousek, 93.09 matousek"
+, author =      "N. Alon and J. Spencer"
+, title =       "The {P}robabilistic {M}ethod"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1992
+, update =      "99.11 bibrelex, 98.11 bibrelex, 97.03 agarwal, 94.01 matousek, 93.09 matousek"
 }
 
 @article{agr-lmulb-92
-, author =	"Laurent Alonso and Arthur S. Goldstein and Edward M. Reingold"
-, title =	"'Lion and Man': Upper and Lower Bounds"
-, journal =	"ORSA J. Comput."
-, volume =	4
-, number =	4
-, year =	1992
-, pages =	"447--452"
-, update =	"98.03 mitchell"
-, annote =	"Special issue on computational geometry; J. Mitchell and
+, author =      "Laurent Alonso and Arthur S. Goldstein and Edward M. Reingold"
+, title =       "'Lion and Man': Upper and Lower Bounds"
+, journal =     "ORSA J. Comput."
+, volume =      4
+, number =      4
+, year =        1992
+, pages =       "447--452"
+, update =      "98.03 mitchell"
+, annote =      "Special issue on computational geometry; J. Mitchell and
                   J. Karel Lenstra, eds."
 }
 
 @inproceedings{aht-dismr-89
-, author =	"P. G. Alourdas and G. R. Hottel and S. T. Tuohy"
-, title =	"A Design and Interrogation System for Modeling with Rational Splines"
-, booktitle =	"Proc. 9th International Symposium on Offshore Mechanics and Arctic Engineering"
-, year =	1990
-, pages =	"555--565"
-, update =	"95.09 mitchell, 95.05 abrams"
+, author =      "P. G. Alourdas and G. R. Hottel and S. T. Tuohy"
+, title =       "A Design and Interrogation System for Modeling with Rational Splines"
+, booktitle =   "Proc. 9th International Symposium on Offshore Mechanics and Arctic Engineering"
+, year =        1990
+, pages =       "555--565"
+, update =      "95.09 mitchell, 95.05 abrams"
 }
 
 @inproceedings{acf-umh-90
-, author =	"B. Alpern and L. Carter and E. Feig"
-, title =	"Uniform Memory Hierarchies"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"600--608"
-, update =	"96.09 orourke"
+, author =      "B. Alpern and L. Carter and E. Feig"
+, title =       "Uniform Memory Hierarchies"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "600--608"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{ahrsz-iecc-90
-, author =	"B. Alpern and R. Hoover and B. Rosen and P. Sweeney and F. K. Zadeck"
-, title =	"Incremental Evaluation of Computational Circuits"
-, booktitle =	"Proc. ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"32--42"
-, keywords =	"dynamic algorithm"
-, update =	"96.01 tamassia"
+, author =      "B. Alpern and R. Hoover and B. Rosen and P. Sweeney and F. K. Zadeck"
+, title =       "Incremental Evaluation of Computational Circuits"
+, booktitle =   "Proc. ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "32--42"
+, keywords =    "dynamic algorithm"
+, update =      "96.01 tamassia"
 }
 
 @book{a-aac-78
-, title =	"Algorithmic Aspects of Combinatorics"
-, editor =	"Brian Alspach"
-, series =	"Ann. Discrete Math."
-, volume =	2
-, publisher =	"North-Holland"
-, address =	"Amsterdam"
-, year =	1978
-, update =	"01.04 icking, 97.11 bibrelex"
+, title =       "Algorithmic Aspects of Combinatorics"
+, editor =      "Brian Alspach"
+, series =      "Ann. Discrete Math."
+, volume =      2
+, publisher =   "North-Holland"
+, address =     "Amsterdam"
+, year =        1978
+, update =      "01.04 icking, 97.11 bibrelex"
 }
 
 @article{a-fshpi-96
-, author =	"M. H. Alsuwaiyel"
-, title =	"Finding a shortest {Hamiltonian} path inside a simple polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	59
-, year =	1996
-, pages =	"207--210"
-, update =	"98.11 devillers, 97.03 smid"
+, author =      "M. H. Alsuwaiyel"
+, title =       "Finding a shortest {Hamiltonian} path inside a simple polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      59
+, year =        1996
+, pages =       "207--210"
+, update =      "98.11 devillers, 97.03 smid"
 }
 
 @article{a-tasdp-97
-, author =	"M. H. Alsuwaiyel"
-, title =	"Two Algorithms for the Sum of Diameters Problem and a Related Problem"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"493--508"
-, update =	"98.11 devillers"
+, author =      "M. H. Alsuwaiyel"
+, title =       "Two Algorithms for the Sum of Diameters Problem and a Related Problem"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "493--508"
+, update =      "98.11 devillers"
 }
 
 @article{al-famlv-95
-, author =	"M. H. Alsuwaiyel and D. T. Lee"
-, title =	"Finding an approximate minimum-link visibility path inside a simple polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	55
-, number =	2
-, year =	1995
-, pages =	"75--79"
-, keywords =	"simple polygon, link distance, watchman routes, visibility, approximation, set cover"
-, update =	"95.09 mitchell"
-, annote =	"gives a correction to an approximation result claimed in al-mlvpi-93"
+, author =      "M. H. Alsuwaiyel and D. T. Lee"
+, title =       "Finding an approximate minimum-link visibility path inside a simple polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      55
+, number =      2
+, year =        1995
+, pages =       "75--79"
+, keywords =    "simple polygon, link distance, watchman routes, visibility, approximation, set cover"
+, update =      "95.09 mitchell"
+, annote =      "gives a correction to an approximation result claimed in al-mlvpi-93"
 }
 
 @article{al-mlvpi-93
-, author =	"M. H. Alsuwaiyel and D. T. Lee"
-, title =	"Minimal link visibility paths inside a simple polygon"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, number =	1
-, year =	1993
-, pages =	"1--25"
-, keywords =	"simple polygon, link distance, watchman route, NP-hardness, approximation, set cover"
-, update =	"95.09 mitchell, 95.05 korneenko"
-, annote =	"see al-famlv-95 for correction to the approximation algorithm result"
+, author =      "M. H. Alsuwaiyel and D. T. Lee"
+, title =       "Minimal link visibility paths inside a simple polygon"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, number =      1
+, year =        1993
+, pages =       "1--25"
+, keywords =    "simple polygon, link distance, watchman route, NP-hardness, approximation, set cover"
+, update =      "95.09 mitchell, 95.05 korneenko"
+, annote =      "see al-famlv-95 for correction to the approximation algorithm result"
 }
 
 @article{a-dprm-62
-, author =	"F. L. Alt"
-, title =	"Digital pattern recognition by moments"
-, journal =	"J. ACM"
-, volume =	9
-, year =	1962
-, pages =	"240--258"
+, author =      "F. L. Alt"
+, title =       "Digital pattern recognition by moments"
+, journal =     "J. ACM"
+, volume =      9
+, year =        1962
+, pages =       "240--258"
 }
 
 @article{a-cccaf-88
-, author =	"H. Alt"
-, title =	"Comparing the combinational complexities of arithmetic functions"
-, journal =	"J. ACM"
-, volume =	35
-, year =	1988
-, pages =	"447--460"
-, update =	"97.03 gaertner+salinger"
+, author =      "H. Alt"
+, title =       "Comparing the combinational complexities of arithmetic functions"
+, journal =     "J. ACM"
+, volume =      35
+, year =        1988
+, pages =       "447--460"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{a-gmpsm-97
-, author =	"Helmut Alt"
-, title =	"Geometric Methods in Pattern and Shape Matching"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	42
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Helmut Alt"
+, title =       "Geometric Methods in Pattern and Shape Matching"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       42
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{aar-msrp-94
-, author =	"H. Alt and O. Aichholzer and G{\"u}nter Rote"
-, title =	"Matching Shapes with a Reference Point"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"85--92"
-, succeeds =	"aar-msrp-94c"
-, precedes =	"aar-msrp-97"
-, cites =	"abb-amps-91, ag-chdhd-, ast-apsgo-92, b-azede-90, cghkkk-gpmem-93, cks-ocpad-94t, g-cp-67, h-gaaps-93, hs-adaps-92, hk-cmhdp-90, hks-uevsi-93, hkr-ciuhd-93, s-spcp-66, s-kkk-72, ZZZ"
-, update =	"00.11 smid, 00.07 icking, 98.03 bibrelex+mitchell, 97.03 rote, 94.09 jones, 94.01 jones"
+, author =      "H. Alt and O. Aichholzer and G{\"u}nter Rote"
+, title =       "Matching Shapes with a Reference Point"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "85--92"
+, succeeds =    "aar-msrp-94c"
+, precedes =    "aar-msrp-97"
+, cites =       "abb-amps-91, ag-chdhd-, ast-apsgo-92, b-azede-90, cghkkk-gpmem-93, cks-ocpad-94t, g-cp-67, h-gaaps-93, hs-adaps-92, hk-cmhdp-90, hks-uevsi-93, hkr-ciuhd-93, s-spcp-66, s-kkk-72, ZZZ"
+, update =      "00.11 smid, 00.07 icking, 98.03 bibrelex+mitchell, 97.03 rote, 94.09 jones, 94.01 jones"
 }
 
 @inproceedings{aar-msrp-94c
-, author =	"Helmut Alt and Oswin Aichholzer and G{\"u}nter Rote"
-, title =	"Matching Shapes with a Reference Point"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"81--84"
-, precedes =	"aar-msrp-94"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Helmut Alt and Oswin Aichholzer and G{\"u}nter Rote"
+, title =       "Matching Shapes with a Reference Point"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "81--84"
+, precedes =    "aar-msrp-94"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @article{aar-msrp-97
-, author =	"H. Alt and O. Aichholzer and G{\"u}nter Rote"
-, title =	"Matching Shapes with a Reference Point"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"349--363"
-, keywords =	"shape matching, Steiner point"
-, succeeds =	"aar-msrp-94"
-, update =	"98.07 rote, 98.03 mitchell, 97.03 rote"
-, abstract =	"For two given point sets, we present a very simple
-		(almost trivial) algorithm to translate one set so that the
-		Hausdorff distance between the two sets is not larger than a constant
-		factor times the minimum Hausdorff
-		distance which can be achieved in this way. The algorithm just matches
-		the so-called Steiner points of the two sets.
-		The focus of our paper is the general study of reference points (like
-		the Steiner point) and their properties with
-		respect to shape matching."
+, author =      "H. Alt and O. Aichholzer and G{\"u}nter Rote"
+, title =       "Matching Shapes with a Reference Point"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "349--363"
+, keywords =    "shape matching, Steiner point"
+, succeeds =    "aar-msrp-94"
+, update =      "98.07 rote, 98.03 mitchell, 97.03 rote"
+, abstract =    "For two given point sets, we present a very simple
+                (almost trivial) algorithm to translate one set so that the
+                Hausdorff distance between the two sets is not larger than a constant
+                factor times the minimum Hausdorff
+                distance which can be achieved in this way. The algorithm just matches
+                the so-called Steiner points of the two sets.
+                The focus of our paper is the general study of reference points (like
+                the Steiner point) and their properties with
+                respect to shape matching."
 }
 
 @inproceedings{ab-akp-90
-, author =	"Helmut Alt and Bernd Behrends"
-, title =	"{Approximative} {Kongruenz} von {Polygonen}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	4
-, update =	"00.03 bibrelex"
+, author =      "Helmut Alt and Bernd Behrends"
+, title =       "{Approximative} {Kongruenz} von {Polygonen}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       4
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{abb-amps-91
-, author =	"H. Alt and B. Behrends and J. Bl{\"o}mer"
-, title =	"Approximate matching of polygonal shapes"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"186--193"
-, keywords =	"matching, polygons, approximation"
-, precedes =	"abb-amps-95"
-, cites =	"abgw-acp-90, akmsw-mpnrc-91, amww-cssgo-88, ass-sulbl-89, a-ltahd-83, a-dcg-83, epss-lebfi-87, f-savd-87, g-nmccd-91, hk-cmhdp-90, m-tgis-82, s-udbde-88, y-oavds-87, ZZZ"
-, update =	"97.11 bibrelex, 95.09 mitchell"
+, author =      "H. Alt and B. Behrends and J. Bl{\"o}mer"
+, title =       "Approximate matching of polygonal shapes"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "186--193"
+, keywords =    "matching, polygons, approximation"
+, precedes =    "abb-amps-95"
+, cites =       "abgw-acp-90, akmsw-mpnrc-91, amww-cssgo-88, ass-sulbl-89, a-ltahd-83, a-dcg-83, epss-lebfi-87, f-savd-87, g-nmccd-91, hk-cmhdp-90, m-tgis-82, s-udbde-88, y-oavds-87, ZZZ"
+, update =      "97.11 bibrelex, 95.09 mitchell"
 }
 
 @article{abb-amps-95
-, author =	"H. Alt and B. Behrends and J. Bl{\"o}mer"
-, title =	"Approximate matching of polygonal shapes"
-, editor =	"Janos Csirik and Horst Bunke"
-, journal =	"Ann. Math. Artif. Intell."
-, volume =	13
-, year =	1995
-, pages =	"251--266"
-, keywords =	"matching, shape recognition, vision"
-, succeeds =	"abb-amps-91"
-, update =	"97.03 agarwal+smid, 95.09 mitchell"
+, author =      "H. Alt and B. Behrends and J. Bl{\"o}mer"
+, title =       "Approximate matching of polygonal shapes"
+, editor =      "Janos Csirik and Horst Bunke"
+, journal =     "Ann. Math. Artif. Intell."
+, volume =      13
+, year =        1995
+, pages =       "251--266"
+, keywords =    "matching, shape recognition, vision"
+, succeeds =    "abb-amps-91"
+, update =      "97.03 agarwal+smid, 95.09 mitchell"
 }
 
 @techreport{abgw-acp-
-, author =	"H. Alt and J. Bl{\"o}mer and M. Godau and H. Wagener"
-, title =	"Approximation of convex polygons"
-, institution =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
-, address =	"Berlin"
-, precedes =	"abgw-acp-90"
-, update =	"94.05 franciosa, 93.09 milone+mitchell"
+, author =      "H. Alt and J. Bl{\"o}mer and M. Godau and H. Wagener"
+, title =       "Approximation of convex polygons"
+, institution = "Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
+, address =     "Berlin"
+, precedes =    "abgw-acp-90"
+, update =      "94.05 franciosa, 93.09 milone+mitchell"
 }
 
 @inproceedings{abgw-acp-90
-, author =	"H. Alt and J. Bl{\"o}mer and M. Godau and H. Wagener"
-, title =	"Approximation of convex polygons"
-, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	443
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"703--716"
-, succeeds =	"abgw-acp-"
-, update =	"94.05 franciosa"
+, author =      "H. Alt and J. Bl{\"o}mer and M. Godau and H. Wagener"
+, title =       "Approximation of convex polygons"
+, booktitle =   "Proc. 17th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      443
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "703--716"
+, succeeds =    "abgw-acp-"
+, update =      "94.05 franciosa"
 }
 
 @article{abm-cmcmb-91
-, author =	"H. Alt and N. Blum and K. Mehlhorn"
-, title =	"Computing a Maximum Cardinality Matching of a Bipartite Graph in Time ${O}(n^{1.5} \sqrt{m/\log n})$"
-, journal =	"Inform. Process. Lett."
-, volume =	37
-, year =	1991
-, pages =	"237--240"
-, update =	"97.03 gaertner+salinger"
+, author =      "H. Alt and N. Blum and K. Mehlhorn"
+, title =       "Computing a Maximum Cardinality Matching of a Bipartite Graph in Time ${O}(n^{1.5} \sqrt{m/\log n})$"
+, journal =     "Inform. Process. Lett."
+, volume =      37
+, year =        1991
+, pages =       "237--240"
+, update =      "97.03 gaertner+salinger"
 }
 
 @book{acs-cg-95
-, title =	"Computational Geometry"
-, editor =	"Helmut Alt and Bernard Chazelle and Raimund Seidel"
-, series =	"Dagstuhl-Seminar-Report"
-, volume =	109
-, publisher =	"Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
-, address =	"Schloss Dagstuhl, Germany"
-, year =	1995
-, url =	"http://www.dagstuhl.de/DATA/Participants/9511.html"
-, update =	"01.04 icking"
+, title =       "Computational Geometry"
+, editor =      "Helmut Alt and Bernard Chazelle and Raimund Seidel"
+, series =      "Dagstuhl-Seminar-Report"
+, volume =      109
+, publisher =   "Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
+, address =     "Schloss Dagstuhl, Germany"
+, year =        1995
+, url = "http://www.dagstuhl.de/DATA/Participants/9511.html"
+, update =      "01.04 icking"
 }
 
 @book{acw-cg-93
-, title =	"Computational Geometry"
-, editor =	"Helmut Alt and Bernard Chazelle and Emo Welzl"
-, series =	"Dagstuhl-Seminar-Report"
-, volume =	59
-, publisher =	"Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
-, address =	"Schloss Dagstuhl, Germany"
-, year =	1993
-, url =	"http://www.dagstuhl.de/DATA/Seminars/93/"
-, update =	"01.07 icking"
+, title =       "Computational Geometry"
+, editor =      "Helmut Alt and Bernard Chazelle and Emo Welzl"
+, series =      "Dagstuhl-Seminar-Report"
+, volume =      59
+, publisher =   "Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
+, address =     "Schloss Dagstuhl, Germany"
+, year =        1993
+, url = "http://www.dagstuhl.de/DATA/Seminars/93/"
+, update =      "01.07 icking"
 }
 
 @inproceedings{afhn-psfks-98
-, author =	"Helmut Alt and Stefan Felsner and Ferran Hurtado and Marc Noy"
-, title =	"Point-Sets with few {$k$}-Sets"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"27--28"
-, note =	"To appear in Proc. 14th ACM Sympos. Comput. Geom."
-, update =	"00.03 bibrelex, 98.07 agarwal+bibrelex, 98.03 agarwal"
+, author =      "Helmut Alt and Stefan Felsner and Ferran Hurtado and Marc Noy"
+, title =       "Point-Sets with few {$k$}-Sets"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "27--28"
+, note =        "To appear in Proc. 14th ACM Sympos. Comput. Geom."
+, update =      "00.03 bibrelex, 98.07 agarwal+bibrelex, 98.03 agarwal"
 }
 
 @inproceedings{afkmnsu-ampcb-90
-, author =	"H. Alt and R. Fleischer and M. Kaufmann and K. Mehlhorn and S. N{\"a}her and S. Schirra and C. Uhrig"
-, title =	"Approximate motion planning and the complexity of the boundary of the union of simple geometric figures"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"281--289"
-, cites =	"egs-oplms-86, gss-gmppt-88, klps-ujrcf-86, ks-eapcf-85, ks-ampsc-88, lw-apcfp-79, ls-ipjc-85, ls-pptmc-87, s-dsstg-88, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "H. Alt and R. Fleischer and M. Kaufmann and K. Mehlhorn and S. N{\"a}her and S. Schirra and C. Uhrig"
+, title =       "Approximate motion planning and the complexity of the boundary of the union of simple geometric figures"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "281--289"
+, cites =       "egs-oplms-86, gss-gmppt-88, klps-ujrcf-86, ks-eapcf-85, ks-ampsc-88, lw-apcfp-79, ls-ipjc-85, ls-pptmc-87, s-dsstg-88, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{afkmnsu-ampcb-92
-, author =	"H. Alt and R. Fleischer and M. Kaufmann and K. Mehlhorn and S. N{\"a}her and S. Schirra and C. Uhrig"
-, title =	"Approximate motion planning and the complexity of the boundary of the union of simple geometric figures"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"391--406"
-, update =	"95.05 agarwal"
+, author =      "H. Alt and R. Fleischer and M. Kaufmann and K. Mehlhorn and S. N{\"a}her and S. Schirra and C. Uhrig"
+, title =       "Approximate motion planning and the complexity of the boundary of the union of simple geometric figures"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "391--406"
+, update =      "95.05 agarwal"
 }
 
 @inproceedings{afrw-mcsrs-96
-, author =	"H. Alt and U. Fuchs and G{\"u}nter Rote and G. Weber"
-, title =	"Matching convex shapes with respect to the symmetric difference"
-, booktitle =	"Algorithms --- Proc. 4th Annu. European Sympos. Algorithms"
-, nickname =	"ESA'96"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1136
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"320--333"
-, precedes =	"afrw-mcsrs-98"
-, update =	"98.07 rote"
+, author =      "H. Alt and U. Fuchs and G{\"u}nter Rote and G. Weber"
+, title =       "Matching convex shapes with respect to the symmetric difference"
+, booktitle =   "Algorithms --- Proc. 4th Annu. European Sympos. Algorithms"
+, nickname =    "ESA'96"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1136
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "320--333"
+, precedes =    "afrw-mcsrs-98"
+, update =      "98.07 rote"
 }
 
 @article{afrw-mcsrs-98
-, author =	"H. Alt and U. Fuchs and G. Rote and G. Weber"
-, title =	"Matching convex shapes with respect to the symmetric difference"
-, journal =	"Algorithmica"
-, volume =	21
-, year =	1998
-, pages =	"89--103"
-, succeeds =	"afrw-mcsrs-96"
-, cites =	"bdkst-cmotc-96"
-, update =	"98.07 rote"
-, abstract =	"This paper deals with questions from convex geometry related
+, author =      "H. Alt and U. Fuchs and G. Rote and G. Weber"
+, title =       "Matching convex shapes with respect to the symmetric difference"
+, journal =     "Algorithmica"
+, volume =      21
+, year =        1998
+, pages =       "89--103"
+, succeeds =    "afrw-mcsrs-96"
+, cites =       "bdkst-cmotc-96"
+, update =      "98.07 rote"
+, abstract =    "This paper deals with questions from convex geometry related
                  to shape matching.  In particular, we consider the problem of
                  moving one convex figure over another, minimizing the area of
                  their symmetric difference.  We show that if we just let the
@@ -6378,2059 +6378,2059 @@ @article{afrw-mcsrs-98
 }
 
 @inproceedings{afrw-rpsm-96
-, author =	"Helmut Alt and Ulrich Fuchs and G{\"u}nter Rote and Gerald Weber"
-, title =	"Reference Points for Shape Matching"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"73--74"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Helmut Alt and Ulrich Fuchs and G{\"u}nter Rote and Gerald Weber"
+, title =       "Reference Points for Shape Matching"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "73--74"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{agm-nscrc-92
-, author =	"H. Alt and V. Geffert and K. Mehlhorn"
-, title =	"Nondeterministic Space Complexity for the Recognition of Context-Free Languages"
-, journal =	"Inform. Process. Lett."
-, volume =	42
-, year =	1992
-, pages =	"25--27"
-, update =	"97.03 gaertner+salinger"
+, author =      "H. Alt and V. Geffert and K. Mehlhorn"
+, title =       "Nondeterministic Space Complexity for the Recognition of Context-Free Languages"
+, journal =     "Inform. Process. Lett."
+, volume =      42
+, year =        1992
+, pages =       "25--27"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{ag-cfdbt-95
-, author =	"H. Alt and M. Godau"
-, title =	"Computing the {Fr\'echet} distance between two polygonal curves"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"75--91"
-, keywords =	"Frechet distance, shape analysis, resemblance of curves, computational morphology"
-, succeeds =	"ag-mrpc-92"
-, update =	"96.09 devillers"
+, author =      "H. Alt and M. Godau"
+, title =       "Computing the {Fr\'echet} distance between two polygonal curves"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "75--91"
+, keywords =    "Frechet distance, shape analysis, resemblance of curves, computational morphology"
+, succeeds =    "ag-mrpc-92"
+, update =      "96.09 devillers"
 }
 
 @unpublished{ag-chdhd-
-, author =	"H. Alt and M. Godau"
-, title =	"Computing the {Hausdorff}-distance in higher dimensions"
-, note =	"In preparation"
-, update =	"98.03 bibrelex"
+, author =      "H. Alt and M. Godau"
+, title =       "Computing the {Hausdorff}-distance in higher dimensions"
+, note =        "In preparation"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ag-mrpc-92
-, author =	"H. Alt and M. Godau"
-, title =	"Measuring the resemblance of polygonal curves"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"102--109"
-, precedes =	"ag-cfdbt-95"
-, cites =	"abb-amps-91, abgw-acp-90, c-pms-88, clr-ia-90, e-cva-85, f-sqpdc-06, g-nmccd-91, g-fmpaa-91, gpy-mclmr-89, m-apcad-83, n-ccpwl-91, ZZZ"
-, update =	"97.11 bibrelex, 96.09 devillers"
+, author =      "H. Alt and M. Godau"
+, title =       "Measuring the resemblance of polygonal curves"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "102--109"
+, precedes =    "ag-cfdbt-95"
+, cites =       "abb-amps-91, abgw-acp-90, c-pms-88, clr-ia-90, e-cva-85, f-sqpdc-06, g-nmccd-91, g-fmpaa-91, gpy-mclmr-89, m-apcad-83, n-ccpwl-91, ZZZ"
+, update =      "97.11 bibrelex, 96.09 devillers"
 }
 
 @inproceedings{ag-mamrc-91
-, author =	"H. Alt and M. Godau"
-, title =	"Metrics and Algorithms for Measuring the Resemblance of Curves"
-, booktitle =	"Proc. 13th IMACS World Congress on Computation and Applied Mathematics"
-, year =	1991
-, pages =	"135--136"
-, update =	"97.03 gaertner+salinger"
+, author =      "H. Alt and M. Godau"
+, title =       "Metrics and Algorithms for Measuring the Resemblance of Curves"
+, booktitle =   "Proc. 13th IMACS World Congress on Computation and Applied Mathematics"
+, year =        1991
+, pages =       "135--136"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{agw-u3dvr-96
-, author =	"H. Alt and M. Godau and S. Whitesides"
-, title =	"Universal 3-Dimensional Visibility Representations for Graphs"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"8--19"
-, keywords =	"graph drawing, visibility, 3D"
-, precedes =	"agw-u3dvr-98"
-, update =	"99.11 bibrelex, 98.11 devillers+patrignani, 96.09 tamassia"
+, author =      "H. Alt and M. Godau and S. Whitesides"
+, title =       "Universal 3-Dimensional Visibility Representations for Graphs"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "8--19"
+, keywords =    "graph drawing, visibility, 3D"
+, precedes =    "agw-u3dvr-98"
+, update =      "99.11 bibrelex, 98.11 devillers+patrignani, 96.09 tamassia"
 }
 
 @article{agw-u3dvr-98
-, author =	"Helmut Alt and Michael Godau and Sue Whitesides"
-, title =	"Universal $3$-Dimensional Visibility Representations for Graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, year =	1998
-, pages =	"111--125"
-, note =	"(special issue on Graph Drawing, edited by G.~{Di Battista} and R.~Tamassia)"
-, keywords =	"graph drawing, visibility, 3D"
-, succeeds =	"agw-u3dvr-96"
-, update =	"99.11 bibrelex, 98.11 devillers+patrignani"
+, author =      "Helmut Alt and Michael Godau and Sue Whitesides"
+, title =       "Universal $3$-Dimensional Visibility Representations for Graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, year =        1998
+, pages =       "111--125"
+, note =        "(special issue on Graph Drawing, edited by G.~{Di Battista} and R.~Tamassia)"
+, keywords =    "graph drawing, visibility, 3D"
+, succeeds =    "agw-u3dvr-96"
+, update =      "99.11 bibrelex, 98.11 devillers+patrignani"
 }
 
 @incollection{ag-dgsmi-00
-, author =	"Helmut Alt and Leonidas J. Guibas"
-, title =	"Discrete Geometric Shapes: {Matching}, Interpolation, and Approximation"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"121--153"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell, 96.09 orourke"
-, annote =	"Chapter 3 of su-hcg-00"
+, author =      "Helmut Alt and Leonidas J. Guibas"
+, title =       "Discrete Geometric Shapes: {Matching}, Interpolation, and Approximation"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "121--153"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell, 96.09 orourke"
+, annote =      "Chapter 3 of su-hcg-00"
 }
 
 @inproceedings{ah-elnns-99
-, author =	"Helmut Alt and Ulrich Hoffmann"
-, title =	"Exact {$L_\infty$} Nearest Neighbor Search in High Dimensions"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"91--92"
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Helmut Alt and Ulrich Hoffmann"
+, title =       "Exact {$L_\infty$} Nearest Neighbor Search in High Dimensions"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "91--92"
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{ahs-cliir-95
-, author =	"Helmut Alt and David Hsu and Jack Snoeyink"
-, title =	"Computing the Largest Inscribed Isothetic Rectangle"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"67--72"
-, update =	"95.09 jones"
+, author =      "Helmut Alt and David Hsu and Jack Snoeyink"
+, title =       "Computing the Largest Inscribed Isothetic Rectangle"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "67--72"
+, update =      "95.09 jones"
 }
 
 @inproceedings{ak-msrsd
-, author =	"Helmut Alt and Christian Knauer"
-, title =	"Matching Shape with Respect to the Symmetric Difference"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"195--197"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Helmut Alt and Christian Knauer"
+, title =       "Matching Shape with Respect to the Symmetric Difference"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "195--197"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{akw-bfdhd-01
-, author =	"Helmut Alt and Christian Knauer and Carola Wenk"
-, title =	"Bounding the {Fr{\'e}chet} Distance by the {Hausdorff} Distance"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"166--169"
-, update =	"01.04 icking"
+, author =      "Helmut Alt and Christian Knauer and Carola Wenk"
+, title =       "Bounding the {Fr{\'e}chet} Distance by the {Hausdorff} Distance"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "166--169"
+, update =      "01.04 icking"
 }
 
 @article{am-sst-85
-, author =	"H. Alt and K. Mehlhorn"
-, title =	"Searching semisorted tables"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"840--848"
+, author =      "H. Alt and K. Mehlhorn"
+, title =       "Searching semisorted tables"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "840--848"
 }
 
 @article{amm-cpmr-81
-, author =	"H. Alt and K. Mehlhorn and J. I. Munro"
-, title =	"On the complexity of partial match retrieval"
-, journal =	"Mathematical Foundations of Computer Science"
-, volume =	"??"
-, year =	1981
-, pages =	"156--161"
-, update =	"97.11 bibrelex"
+, author =      "H. Alt and K. Mehlhorn and J. I. Munro"
+, title =       "On the complexity of partial match retrieval"
+, journal =     "Mathematical Foundations of Computer Science"
+, volume =      "??"
+, year =        1981
+, pages =       "156--161"
+, update =      "97.11 bibrelex"
 }
 
 @article{amm-pmrid-84
-, author =	"H. Alt and K. Mehlhorn and J. I. Munro"
-, title =	"Partial match retrieval in implicit data structures"
-, journal =	"Inform. Process. Lett."
-, volume =	19
-, year =	1984
-, pages =	"61--65"
+, author =      "H. Alt and K. Mehlhorn and J. I. Munro"
+, title =       "Partial match retrieval in implicit data structures"
+, journal =     "Inform. Process. Lett."
+, volume =      19
+, year =        1984
+, pages =       "61--65"
 }
 
 @inproceedings{amww-cssgo-87
-, author =	"H. Alt and K. Mehlhorn and H. Wagener and Emo Welzl"
-, title =	"Congruence, similarity and symmetries of geometric objects"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"308--315"
-, precedes =	"amww-cssgo-88"
-, cites =	"ahu-daca-74, a-cspf-84, a-sd-85, a-oagc-83, h-oafsp-86, m-dsa-84, m-tgis-82, m-ltalp-83, ps-cgi-85, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "H. Alt and K. Mehlhorn and H. Wagener and Emo Welzl"
+, title =       "Congruence, similarity and symmetries of geometric objects"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "308--315"
+, precedes =    "amww-cssgo-88"
+, cites =       "ahu-daca-74, a-cspf-84, a-sd-85, a-oagc-83, h-oafsp-86, m-dsa-84, m-tgis-82, m-ltalp-83, ps-cgi-85, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{amww-cssgo-88
-, author =	"H. Alt and K. Mehlhorn and H. Wagener and Emo Welzl"
-, title =	"Congruence, similarity and symmetries of geometric objects"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"237--256"
-, succeeds =	"amww-cssgo-87"
-, update =	"98.03 mitchell"
+, author =      "H. Alt and K. Mehlhorn and H. Wagener and Emo Welzl"
+, title =       "Congruence, similarity and symmetries of geometric objects"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "237--256"
+, succeeds =    "amww-cssgo-87"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{as-vdco-95
-, author =	"Helmut Alt and Otfried Schwarzkopf"
-, title =	"The {Voronoi} diagram of curved objects"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"89--97"
-, url =	"http://www.cs.uu.nl/~otfried/ps/as-vdco-95.ps.gz"
-, keywords =	"randomized incremental algorithm"
-, cites =	"a-vdsfg-91, bdsty-arsol-92, c-bvdcp-86, cs-arscg-89, k-avdta-88, k-cavd-89, kmm-ricav-93a, kw-vdbgm-88, ls-pptmc-87, mp-fitcp-78, m-fppa1-88, oy-rmpmd-85, obs-stcav-92, ps-cgi-85, s-barga-93, s-dg-69, y-oavds-87, ya-mpce-89, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell+schwarzkopf"
+, author =      "Helmut Alt and Otfried Schwarzkopf"
+, title =       "The {Voronoi} diagram of curved objects"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "89--97"
+, url = "http://www.cs.uu.nl/~otfried/ps/as-vdco-95.ps.gz"
+, keywords =    "randomized incremental algorithm"
+, cites =       "a-vdsfg-91, bdsty-arsol-92, c-bvdcp-86, cs-arscg-89, k-avdta-88, k-cavd-89, kmm-ricav-93a, kw-vdbgm-88, ls-pptmc-87, mp-fitcp-78, m-fppa1-88, oy-rmpmd-85, obs-stcav-92, ps-cgi-85, s-barga-93, s-dg-69, y-oavds-87, ya-mpce-89, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell+schwarzkopf"
 }
 
 @article{aw-vgoas-88
-, author =	"H. Alt and Emo Welzl"
-, title =	"Visibility graphs and obstacle-avoiding shortest paths"
-, journal =	"Zeitschrift f{\"u}r Operations Research"
-, volume =	32
-, year =	1988
-, pages =	"145--164"
-, update =	"98.03 mitchell"
+, author =      "H. Alt and Emo Welzl"
+, title =       "Visibility graphs and obstacle-avoiding shortest paths"
+, journal =     "Zeitschrift f{\"u}r Operations Research"
+, volume =      32
+, year =        1988
+, pages =       "145--164"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{aww-plabc-97
-, author =	"H. Alt and E. Welzl and B. Wolfers"
-, title =	"Piecewise Linear Approximation of B{\'e}zier-Curves"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"433--435"
-, cites =	"ag-cfdbt-95, b-pgs-78, f-cscag-93, fdfh-cgpp-90, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "H. Alt and E. Welzl and B. Wolfers"
+, title =       "Piecewise Linear Approximation of B{\'e}zier-Curves"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "433--435"
+, cites =       "ag-cfdbt-95, b-pgs-78, f-cscag-93, fdfh-cgpp-90, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @article{ay-aampt1-90
-, author =	"H. Alt and C. K. Yap"
-, title =	"Algorithmic aspect of motion planning: a tutorial, part 1"
-, journal =	"Algorithms Rev."
-, volume =	1
-, number =	1
-, year =	1990
-, pages =	"43--60"
-, keywords =	"motion planning, robotics, computational geometry, Voronoi diagrams, computational algebra"
-, update =	"93.09 jones"
+, author =      "H. Alt and C. K. Yap"
+, title =       "Algorithmic aspect of motion planning: a tutorial, part 1"
+, journal =     "Algorithms Rev."
+, volume =      1
+, number =      1
+, year =        1990
+, pages =       "43--60"
+, keywords =    "motion planning, robotics, computational geometry, Voronoi diagrams, computational algebra"
+, update =      "93.09 jones"
 }
 
 @article{ay-aampt2-90
-, author =	"H. Alt and C. K. Yap"
-, title =	"Algorithmic aspect of motion planning: a tutorial, part 2"
-, journal =	"Algorithms Rev."
-, volume =	1
-, number =	2
-, year =	1990
-, pages =	"61--77"
-, keywords =	"motion planning, robotics, computational geometry, Voronoi diagrams, computational algebra"
-, update =	"93.09 jones"
+, author =      "H. Alt and C. K. Yap"
+, title =       "Algorithmic aspect of motion planning: a tutorial, part 2"
+, journal =     "Algorithms Rev."
+, volume =      1
+, number =      2
+, year =        1990
+, pages =       "61--77"
+, keywords =    "motion planning, robotics, computational geometry, Voronoi diagrams, computational algebra"
+, update =      "93.09 jones"
 }
 
 @inproceedings{ay-aart-89
-, author =	"H. Alt and C. K. Yap"
-, title =	"Algorithmic Aspects of Robotics: a Tutorial"
-, booktitle =	"Proceedings SOFSEM `89"
-, year =	1989
-, pages =	"7--40"
-, update =	"97.03 gaertner+salinger"
+, author =      "H. Alt and C. K. Yap"
+, title =       "Algorithmic Aspects of Robotics: a Tutorial"
+, booktitle =   "Proceedings SOFSEM `89"
+, year =        1989
+, pages =       "7--40"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{am-pttbc-00
-, author =	"E. Althaus and K. Mehlhorn"
-, title =	"Polynomial time {TSP}-based curve reconstruction"
-, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '00"
-, month =	jan
-, year =	2000
-, pages =	"686--695"
-, update =	"00.03 orourke"
+, author =      "E. Althaus and K. Mehlhorn"
+, title =       "Polynomial time {TSP}-based curve reconstruction"
+, booktitle =   "Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '00"
+, month =       jan
+, year =        2000
+, pages =       "686--695"
+, update =      "00.03 orourke"
 }
 
 @inproceedings{amns-ecr-00
-, author =	"E. Althaus and K. Mehlhorn and S. N{\"a}her and S. Schirra"
-, title =	"Experiments on curve reconstruction"
-, booktitle =	"Proc. 2nd Workshop Algorithm Eng. Exper."
-, nickname =	"ALENEX '00"
-, month =	jan
-, year =	2000
-, pages =	"103--114"
-, update =	"00.03 orourke"
+, author =      "E. Althaus and K. Mehlhorn and S. N{\"a}her and S. Schirra"
+, title =       "Experiments on curve reconstruction"
+, booktitle =   "Proc. 2nd Workshop Algorithm Eng. Exper."
+, nickname =    "ALENEX '00"
+, month =       jan
+, year =        2000
+, pages =       "103--114"
+, update =      "00.03 orourke"
 }
 
 @article{a-aevcp-75
-, author =	"W. Altherr"
-, title =	"An algorithm for enumerating the vertices of a convex polyhedron"
-, journal =	"Computing"
-, volume =	15
-, year =	1975
-, pages =	"181--193"
+, author =      "W. Altherr"
+, title =       "An algorithm for enumerating the vertices of a convex polyhedron"
+, journal =     "Computing"
+, volume =      15
+, year =        1975
+, pages =       "181--193"
 }
 
 @article{a-orfms-88
-, author =	"I. Alth{\"o}fer"
-, title =	"On optimal realizations of finite metric spaces by graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"103--122"
+, author =      "I. Alth{\"o}fer"
+, title =       "On optimal realizations of finite metric spaces by graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "103--122"
 }
 
 @inproceedings{addj-gsswg-90
-, author =	"I. Alth{\"o}fer and G. Das and D. Dobkin and D. Joseph"
-, title =	"Generating Sparse Spanners for Weighted Graphs"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, year =	1990
-, pages =	"26--37"
-, update =	"98.03 smid, 97.11 bibrelex"
+, author =      "I. Alth{\"o}fer and G. Das and D. Dobkin and D. Joseph"
+, title =       "Generating Sparse Spanners for Weighted Graphs"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, year =        1990
+, pages =       "26--37"
+, update =      "98.03 smid, 97.11 bibrelex"
 }
 
 @article{addjs-sswg-93
-, author =	"I. Alth{\"o}fer and G. Das and D. P. Dobkin and D. Joseph and J. Soares"
-, title =	"On sparse spanners of weighted graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	9
-, year =	1993
-, pages =	"81--100"
-, update =	"94.05 smid"
+, author =      "I. Alth{\"o}fer and G. Das and D. P. Dobkin and D. Joseph and J. Soares"
+, title =       "On sparse spanners of weighted graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      9
+, year =        1993
+, pages =       "81--100"
+, update =      "94.05 smid"
 }
 
 @incollection{achllstu-mairp-81
-, author =	"M. D. Altschuler and Y. Censor and G. T. Hermann and A. Lent and R. M. Lewitt and S. N. Srihari and H. Tuy and J. K. Udupa"
-, title =	"Mathematical aspects of image reconstruction from projections"
-, editor =	"L. N. Kanal and A. Rosenfeld"
-, booktitle =	"Progress in pattern recognition"
-, volume =	1
-, publisher =	"North-Holland"
-, address =	"New-York, NY"
-, year =	1981
-, pages =	"323--375"
-, update =	"97.11 bibrelex"
+, author =      "M. D. Altschuler and Y. Censor and G. T. Hermann and A. Lent and R. M. Lewitt and S. N. Srihari and H. Tuy and J. K. Udupa"
+, title =       "Mathematical aspects of image reconstruction from projections"
+, editor =      "L. N. Kanal and A. Rosenfeld"
+, booktitle =   "Progress in pattern recognition"
+, volume =      1
+, publisher =   "North-Holland"
+, address =     "New-York, NY"
+, year =        1981
+, pages =       "323--375"
+, update =      "97.11 bibrelex"
 }
 
 @article{ab-wnpm2-86
-, author =	"A. Altshuler and U. Brehm"
-, title =	"The weakly neighborly polyhedral maps on the $2$-manifold with {Euler} characteristic $-1$"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"355--369"
+, author =      "A. Altshuler and U. Brehm"
+, title =       "The weakly neighborly polyhedral maps on the $2$-manifold with {Euler} characteristic $-1$"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "355--369"
 }
 
 @inproceedings{as-dchan-99
-, author =	"S. Aluru and F. E. Sevilgen"
-, title =	"Dynamic compressed hyperoctrees with application to the {N}-body problem"
-, booktitle =	"Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1738
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"21--33"
-, update =	"00.03 smid"
+, author =      "S. Aluru and F. E. Sevilgen"
+, title =       "Dynamic compressed hyperoctrees with application to the {N}-body problem"
+, booktitle =   "Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1738
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "21--33"
+, update =      "00.03 smid"
 }
 
 @article{a-rtc-84
-, author =	"J. Amanatides"
-, title =	"Ray Tracing with Cones"
-, journal =	"Comput. Graph."
-, volume =	18
-, number =	3
-, year =	1984
-, pages =	"129--135"
-, note =	"Proc. SIGGRAPH '84"
-, update =	"97.11 bibrelex"
+, author =      "J. Amanatides"
+, title =       "Ray Tracing with Cones"
+, journal =     "Comput. Graph."
+, volume =      18
+, number =      3
+, year =        1984
+, pages =       "129--135"
+, note =        "Proc. SIGGRAPH '84"
+, update =      "97.11 bibrelex"
 }
 
 @book{a-dgms-85
-, author =	"S. Amari"
-, title =	"Differential Geometrical Methods in Statistics"
-, series =	"Lecture Notes in Statistics"
-, volume =	28
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1985
-, update =	"98.07 bibrelex"
+, author =      "S. Amari"
+, title =       "Differential Geometrical Methods in Statistics"
+, series =      "Lecture Notes in Statistics"
+, volume =      28
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1985
+, update =      "98.07 bibrelex"
 }
 
 @article{a-dssp-94
-, author =	"N. Amato"
-, title =	"Determining the separation of simple polygons"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"457--474"
-, keywords =	"separation, simple polygon, parallel algorithm, sequential algorithm"
-, succeeds =	"a-oafss-93"
-, update =	"96.09 devillers"
+, author =      "N. Amato"
+, title =       "Determining the separation of simple polygons"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "457--474"
+, keywords =    "separation, simple polygon, parallel algorithm, sequential algorithm"
+, succeeds =    "a-oafss-93"
+, update =      "96.09 devillers"
 }
 
 @incollection{abdjv-oobp3-98
-, author =	"N. Amato and O. B. Bayazit and L. K. Dale and C. Jones and D. Vallejo"
-, title =	"{OBPRM}: An obstacle-based {PRM} for {3D} workspaces"
-, editor =	"P. K. Agarwal and L. E. Kavraki and M. Mason"
-, booktitle =	"Proc. Workshop Algorithmic Found. Robot."
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1998
-, note =	"To appear"
-, update =	"98.07 agarwal, 98.03 agarwal"
+, author =      "N. Amato and O. B. Bayazit and L. K. Dale and C. Jones and D. Vallejo"
+, title =       "{OBPRM}: An obstacle-based {PRM} for {3D} workspaces"
+, editor =      "P. K. Agarwal and L. E. Kavraki and M. Mason"
+, booktitle =   "Proc. Workshop Algorithmic Found. Robot."
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1998
+, note =        "To appear"
+, update =      "98.07 agarwal, 98.03 agarwal"
 }
 
 @inproceedings{a-oafss-93
-, author =	"Nancy M. Amato"
-, title =	"An Optimal Algorithm for Finding the Separation of Simple Polygons"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"48--59"
-, precedes =	"a-dssp-94"
-, update =	"96.09 devillers, 93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "Nancy M. Amato"
+, title =       "An Optimal Algorithm for Finding the Separation of Simple Polygons"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "48--59"
+, precedes =    "a-dssp-94"
+, update =      "96.09 devillers, 93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @article{agr-ratsp-01
-, author =	"Nancy M. Amato and Michael T. Goodrich and Edgar A. Ramos"
-, title =	"A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time"
-, journal =	"Discrete Comput. Geom."
-, volume =	26
-, number =	2
-, year =	2001
-, pages =	"245--265"
-, update =	"01.11 pocchiola+smid"
+, author =      "Nancy M. Amato and Michael T. Goodrich and Edgar A. Ramos"
+, title =       "A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time"
+, journal =     "Discrete Comput. Geom."
+, volume =      26
+, number =      2
+, year =        2001
+, pages =       "245--265"
+, update =      "01.11 pocchiola+smid"
 }
 
 @inproceedings{agr-cfssa-95
-, author =	"N. M. Amato and M. T. Goodrich and E. A. Ramos"
-, title =	"Computing faces in segment and simplex arrangements"
-, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
-, year =	1995
-, pages =	"672--682"
-, update =	"95.09 agarwal+smid"
+, author =      "N. M. Amato and M. T. Goodrich and E. A. Ramos"
+, title =       "Computing faces in segment and simplex arrangements"
+, booktitle =   "Proc. 27th Annu. ACM Sympos. Theory Comput."
+, year =        1995
+, pages =       "672--682"
+, update =      "95.09 agarwal+smid"
 }
 
 @inproceedings{agr-cacsd-00
-, author =	"N. M. Amato and M. T. Goodrich and E. A. Ramos"
-, title =	"Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling"
-, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '00"
-, year =	2000
-, pages =	"705--706"
-, update =	"00.11 smid"
+, author =      "N. M. Amato and M. T. Goodrich and E. A. Ramos"
+, title =       "Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling"
+, booktitle =   "Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '00"
+, year =        2000
+, pages =       "705--706"
+, update =      "00.11 smid"
 }
 
 @inproceedings{agr-lttsp-00
-, author =	"Nancy M. Amato and Michael T. Goodrich and Edgar A. Ramos"
-, title =	"Linear-Time Triangulation of a Simple Polygon Made Easier via Randomization"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"201--212"
-, update =	"00.11 jones"
+, author =      "Nancy M. Amato and Michael T. Goodrich and Edgar A. Ramos"
+, title =       "Linear-Time Triangulation of a Simple Polygon Made Easier via Randomization"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "201--212"
+, update =      "00.11 jones"
 }
 
 @inproceedings{agr-pahdc-94
-, author =	"N. M. Amato and M. T. Goodrich and E. A. Ramos"
-, title =	"Parallel algorithms for higher-dimensional convex hulls"
-, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1994
-, pages =	"683--694"
-, update =	"95.01 smid"
+, author =      "N. M. Amato and M. T. Goodrich and E. A. Ramos"
+, title =       "Parallel algorithms for higher-dimensional convex hulls"
+, booktitle =   "Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1994
+, pages =       "683--694"
+, update =      "95.01 smid"
 }
 
 @inproceedings{ap-np3dc-93
-, author =	"N. M. Amato and F. P. Preparata"
-, title =	"An {NC}$^1$ Parallel 3{D} convex hull algorithm"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"289--297"
-, cites =	"acgoy-pcg-88, ap-p3dch-92, c-pms-88, cz-opabd-90, c-pagp-80, dk-pcsh-89, dk-dsppu-90, kr-pasmm-90, pdw-npach-92, ph-chfsp-77, ps-cgi-85, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
+, author =      "N. M. Amato and F. P. Preparata"
+, title =       "An {NC}$^1$ Parallel 3{D} convex hull algorithm"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "289--297"
+, cites =       "acgoy-pcg-88, ap-p3dch-92, c-pms-88, cz-opabd-90, c-pagp-80, dk-pcsh-89, dk-dsppu-90, kr-pasmm-90, pdw-npach-92, ph-chfsp-77, ps-cgi-85, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
 }
 
 @article{ap-p3dch-92
-, author =	"N. M. Amato and F. P. Preparata"
-, title =	"The parallel 3{D} convex hull problem revisited"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	2
-, year =	1992
-, pages =	"163--173"
-, keywords =	"convex hull, parallel computation, PRAM, hierarchical representation"
+, author =      "N. M. Amato and F. P. Preparata"
+, title =       "The parallel 3{D} convex hull problem revisited"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      2
+, year =        1992
+, pages =       "163--173"
+, keywords =    "convex hull, parallel computation, PRAM, hierarchical representation"
 }
 
 @inproceedings{ar-cvddp-96
-, author =	"Nancy M. Amato and Edgar A. Ramos"
-, title =	"On Computing {Voronoi} Diagrams by Divide-Prune-and-Conquer"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"166--175"
-, cites =	"as-vdco-95, agr-pahdc-94, agr-cfssa-95, a-pdpaa-87, bcm-prsss-93, c-osrch-95, csy-oscpf-95, csy-pddpo-97, c-chdc-93, c-ochaa-93, cf-dvrsi-90, cs-arscg-89, dk-fdpi-83, e-acg-87, em-sstcd-90, es-itfwr-92, es-otatd-91, g-gpmee-93, goy-cvdsl-93, ks-upcha-86, k-cavd-89, m-aogdc-91, m-cha-91, m-ept-92, m-loq-93, m-lpltw-84, rs-oprat-92, s-chdch-86, s-sdlpc-91, sa-dsstg-95, s-fchff-85, y-gctsp-90, ZZZ"
-, update =	"98.07 bibrelex, 97.11 bibrelex, 96.05 efrat"
+, author =      "Nancy M. Amato and Edgar A. Ramos"
+, title =       "On Computing {Voronoi} Diagrams by Divide-Prune-and-Conquer"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "166--175"
+, cites =       "as-vdco-95, agr-pahdc-94, agr-cfssa-95, a-pdpaa-87, bcm-prsss-93, c-osrch-95, csy-oscpf-95, csy-pddpo-97, c-chdc-93, c-ochaa-93, cf-dvrsi-90, cs-arscg-89, dk-fdpi-83, e-acg-87, em-sstcd-90, es-itfwr-92, es-otatd-91, g-gpmee-93, goy-cvdsl-93, ks-upcha-86, k-cavd-89, m-aogdc-91, m-cha-91, m-ept-92, m-loq-93, m-lpltw-84, rs-oprat-92, s-chdch-86, s-sdlpc-91, sa-dsstg-95, s-fchff-85, y-gctsp-90, ZZZ"
+, update =      "98.07 bibrelex, 97.11 bibrelex, 96.05 efrat"
 }
 
 @article{a-cspcp-66
-, author =	"R. V. Ambarcumjam"
-, title =	"Convex subclusters of point clusters in the plane"
-, journal =	"Dokl. Acad. Nauk Armjan. SSR"
-, volume =	43
-, year =	1966
-, pages =	"12--14"
-, update =	"02.03 devillers"
+, author =      "R. V. Ambarcumjam"
+, title =       "Convex subclusters of point clusters in the plane"
+, journal =     "Dokl. Acad. Nauk Armjan. SSR"
+, volume =      43
+, year =        1966
+, pages =       "12--14"
+, update =      "02.03 devillers"
 }
 
 @inproceedings{a-bbhdn-94
-, author =	"N. Amenta"
-, title =	"Bounded Boxes, {Hausdorff} Distance, and a New Proof of an Interesting {Helly} Theorem"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"340--347"
-, cites =	"a-htglp-93, a-htglp-93t, abb-amps-91, ak-srtat-89, a-ltahd-83, cghkkk-gpmem-93, c-lvalp-88, dmr-fmaap-93, dgk-htir-63, e-hrctt-93, gm-csfs-61, hks-uevsi-91, l-htpuc-68, m-gofvc-94, msw-sblp-92, m-tphpu-73, s-lpchm-90, sw-cblpr-92, w-sedbe-91, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "N. Amenta"
+, title =       "Bounded Boxes, {Hausdorff} Distance, and a New Proof of an Interesting {Helly} Theorem"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "340--347"
+, cites =       "a-htglp-93, a-htglp-93t, abb-amps-91, ak-srtat-89, a-ltahd-83, cghkkk-gpmem-93, c-lvalp-88, dmr-fmaap-93, dgk-htir-63, e-hrctt-93, gm-csfs-61, hks-uevsi-91, l-htpuc-68, m-gofvc-94, msw-sblp-92, m-tphpu-73, s-lpchm-90, sw-cblpr-92, w-sedbe-91, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @incollection{a-cgs-97
-, author =	"N. Amenta"
-, title =	"Computational geometry software"
-, chapter =	52
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"951--960"
-, update =	"97.11 orourke"
+, author =      "N. Amenta"
+, title =       "Computational geometry software"
+, chapter =     52
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "951--960"
+, update =      "97.11 orourke"
 }
 
 @misc{a-dcgs-
-, author =	"Nina Amenta"
-, title =	"Directory of Computational Geometry Software"
-, url =	"https://www.geom.uiuc.edu/software/cglist/"
-, update =	"97.03 tamassia"
+, author =      "Nina Amenta"
+, title =       "Directory of Computational Geometry Software"
+, url = "https://www.geom.uiuc.edu/software/cglist/"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{a-fltao-92
-, author =	"N. Amenta"
-, title =	"Finding a line transversal of axial objects in three dimensions"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"66--71"
+, author =      "N. Amenta"
+, title =       "Finding a line transversal of axial objects in three dimensions"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "66--71"
 }
 
 @inproceedings{a-fpf-96
-, author =	"Nina Amenta"
-, title =	"Four-polytopes and a funeral"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"V1--V2"
-, cites =	"az-ssp-96, almp-gsgv-95, km-hgisa-72, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Nina Amenta"
+, title =       "Four-polytopes and a funeral"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "V1--V2"
+, cites =       "az-ssp-96, almp-gsgv-95, km-hgisa-72, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @phdthesis{a-htglp-93t
-, author =	"N. Amenta"
-, title =	"Helly Theorems and Generalized Linear Programming"
-, school =	"Geometry Center"
-, address =	"Minneapolis, MN"
-, year =	1993
-, note =	"Technical Report GCG61"
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "N. Amenta"
+, title =       "Helly Theorems and Generalized Linear Programming"
+, school =      "Geometry Center"
+, address =     "Minneapolis, MN"
+, year =        1993
+, note =        "Technical Report GCG61"
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{a-htglp-93
-, author =	"N. Amenta"
-, title =	"Helly theorems and generalized linear programming"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"63--72"
-, cites =	"a-fltao-92, ad-ahdsp-90, ah-cahti-91, agpw-tinhn-, cm-ltdao-93, c-lvalp-88, dgk-htir-63, d-cdnsm-92, d-mstia-86, d-ccpac-92, e-hrctt-93, ew-spdtl-89, gpw-gtt-93, gm-csfs-61, h-bchn-79, km-accvd-91, msw-sblp-92, m-ltalp-83, m-bsb-89, pr-rn-92, r-lie-89, s-lpchm-90, sw-cblpr-92, t-pgcct-89, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "N. Amenta"
+, title =       "Helly theorems and generalized linear programming"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "63--72"
+, cites =       "a-fltao-92, ad-ahdsp-90, ah-cahti-91, agpw-tinhn-, cm-ltdao-93, c-lvalp-88, dgk-htir-63, d-cdnsm-92, d-mstia-86, d-ccpac-92, e-hrctt-93, ew-spdtl-89, gpw-gtt-93, gm-csfs-61, h-bchn-79, km-accvd-91, msw-sblp-92, m-ltalp-83, m-bsb-89, pr-rn-92, r-lie-89, s-lpchm-90, sw-cblpr-92, t-pgcct-89, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{a-httgl-94
-, author =	"N. Amenta"
-, title =	"Helly-type theorems and generalized linear programming"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"241--261"
-, succeeds =	"a-htglp-93"
-, update =	"95.01 matousek+smid"
+, author =      "N. Amenta"
+, title =       "Helly-type theorems and generalized linear programming"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "241--261"
+, succeeds =    "a-htglp-93"
+, update =      "95.01 matousek+smid"
 }
 
 @inproceedings{a-ktpcs-96
-, author =	"N. Amenta"
-, title =	"$k$-{Transversals} of parallel convex sets"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"80--86"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "N. Amenta"
+, title =       "$k$-{Transversals} of parallel convex sets"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "80--86"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{ab-srvf-98
-, author =	"Nina Amenta and Marshall Bern"
-, title =	"Surface reconsruction by {Voronoi} filtering"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, site =	"Minneapolis"
-, year =	1998
-, pages =	"39--48"
-, precedes =	"ab-srvf-99"
-, update =	"00.03 devillers"
+, author =      "Nina Amenta and Marshall Bern"
+, title =       "Surface reconsruction by {Voronoi} filtering"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, site =        "Minneapolis"
+, year =        1998
+, pages =       "39--48"
+, precedes =    "ab-srvf-99"
+, update =      "00.03 devillers"
 }
 
 @article{ab-srvf-99
-, author =	"Nina Amenta and Marshall Bern"
-, title =	"Surface Reconstruction by {Voronoi} Filtering"
-, journal =	"Discrete Comput. Geom."
-, volume =	22
-, number =	4
-, year =	1999
-, pages =	"481--504"
-, succeeds =	"ab-srvf-98"
-, update =	"00.03 devillers, 99.11 held"
+, author =      "Nina Amenta and Marshall Bern"
+, title =       "Surface Reconstruction by {Voronoi} Filtering"
+, journal =     "Discrete Comput. Geom."
+, volume =      22
+, number =      4
+, year =        1999
+, pages =       "481--504"
+, succeeds =    "ab-srvf-98"
+, update =      "00.03 devillers, 99.11 held"
 }
 
 @inproceedings{abe-oppms-97
-, author =	"N. Amenta and M. Bern and D. Eppstein"
-, title =	"Optimal Point Placement for Mesh Smoothing"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, month =	jan
-, year =	1997
-, pages =	"528--537"
-, update =	"97.03 held"
+, author =      "N. Amenta and M. Bern and D. Eppstein"
+, title =       "Optimal Point Placement for Mesh Smoothing"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, month =       jan
+, year =        1997
+, pages =       "528--537"
+, update =      "97.03 held"
 }
 
 @techreport{abe-cbscc-97
-, author =	"N. Amenta and M. Bern and D. Eppstein"
-, title =	"The Crust and the $\beta$-Skeleton: Combinatorial Curve Reconst ruction"
-, type =	"Research {Report}"
-, institution =	"Xerox PARC"
-, year =	1997
-, precedes =	"abe-cbscc-98"
-, update =	"00.03 devillers, 98.03 devillers"
+, author =      "N. Amenta and M. Bern and D. Eppstein"
+, title =       "The Crust and the $\beta$-Skeleton: Combinatorial Curve Reconst ruction"
+, type =        "Research {Report}"
+, institution = "Xerox PARC"
+, year =        1997
+, precedes =    "abe-cbscc-98"
+, update =      "00.03 devillers, 98.03 devillers"
 }
 
 @article{abe-cbscc-98
-, author =	"Nina Amenta and Marshall Bern and David Eppstein"
-, title =	"The Crust and the $\beta$-Skeleton: Combinatorial Curve Reconstruction"
-, journal =	"Graphical Models and Image Processing"
-, volume =	60
-, year =	1998
-, pages =	"125--135"
-, url =	"http://www.geom.umn.edu/~nina/papers/crust.ps.gz"
-, comments =	"\url{http://www.geom.umn.edu/~nina/papers/crust.ps.gz}"
-, succeeds =	"abe-cbscc-97"
-, update =	"02.03 wenger, 00.03 devillers+orourke"
+, author =      "Nina Amenta and Marshall Bern and David Eppstein"
+, title =       "The Crust and the $\beta$-Skeleton: Combinatorial Curve Reconstruction"
+, journal =     "Graphical Models and Image Processing"
+, volume =      60
+, year =        1998
+, pages =       "125--135"
+, url = "http://www.geom.umn.edu/~nina/papers/crust.ps.gz"
+, comments =    "\url{http://www.geom.umn.edu/~nina/papers/crust.ps.gz}"
+, succeeds =    "abe-cbscc-97"
+, update =      "02.03 wenger, 00.03 devillers+orourke"
 }
 
 @article{abet-rdcp-00
-, author =	"N. Amenta and M. Bern and D. Eppstein and S.-H. Teng"
-, title =	"Regression Depth and Center Points"
-, journal =	"Discrete Comput. Geom."
-, volume =	23
-, year =	2000
-, pages =	"305--323"
-, update =	"01.11 smid"
+, author =      "N. Amenta and M. Bern and D. Eppstein and S.-H. Teng"
+, title =       "Regression Depth and Center Points"
+, journal =     "Discrete Comput. Geom."
+, volume =      23
+, year =        2000
+, pages =       "305--323"
+, update =      "01.11 smid"
 }
 
 @inproceedings{abk-nvbsr-98
-, author =	"N. Amenta and M. Bern and M. Kamvysselis"
-, title =	"A New {Voronoi}-Based Surface Reconstruction Algorithm"
-, booktitle =	"Proc. SIGGRAPH '98"
-, site =	"Orlando, FL"
-, series =	"Computer Graphics Proceedings, Annual Conference Series"
-, month =	jul
-, year =	1998
-, pages =	"415--412"
-, update =	"00.03 orourke, 98.11 held"
+, author =      "N. Amenta and M. Bern and M. Kamvysselis"
+, title =       "A New {Voronoi}-Based Surface Reconstruction Algorithm"
+, booktitle =   "Proc. SIGGRAPH '98"
+, site =        "Orlando, FL"
+, series =      "Computer Graphics Proceedings, Annual Conference Series"
+, month =       jul
+, year =        1998
+, pages =       "415--412"
+, update =      "00.03 orourke, 98.11 held"
 }
 
 @unpublished{ac-opdfh-99
-, author =	"N. Amenta and S. Choi"
-, title =	"One-pass {Delaunay} filtering for homeomorphic {3D} surface reconstruction"
-, year =	1999
-, note =	"Manuscript"
-, update =	"00.03 orourke"
+, author =      "N. Amenta and S. Choi"
+, title =       "One-pass {Delaunay} filtering for homeomorphic {3D} surface reconstruction"
+, year =        1999
+, note =        "Manuscript"
+, update =      "00.03 orourke"
 }
 
 % title page uses initials only
 @inproceedings{acdl-sahsr-00
-, author =	"N. Amenta and S. Choi and T. K. Dey and N. Leekha"
-, title =	"A Simple Algorithm for Homeomorphic Surface Reconstruction"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"213--222"
-, update =	"00.11 jones"
+, author =      "N. Amenta and S. Choi and T. K. Dey and N. Leekha"
+, title =       "A Simple Algorithm for Homeomorphic Surface Reconstruction"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "213--222"
+, update =      "00.11 jones"
 }
 
 @article{ack-pcubm-01
-, author =	"N. Amenta and S. Choi and R. K. Kolluri"
-, title =	"The power crust, unions of balls, and the medial axis transform"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"127--153"
-, update =	"01.11 smid"
+, author =      "N. Amenta and S. Choi and R. K. Kolluri"
+, title =       "The power crust, unions of balls, and the medial axis transform"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "127--153"
+, update =      "01.11 smid"
 }
 
 @inproceedings{ak-aeub-00
-, author =	"Nina Amenta and Ravi Krishna Kolluri"
-, title =	"Accurate and Efficient Unions of Balls"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"119--128"
-, update =	"00.11 jones"
+, author =      "Nina Amenta and Ravi Krishna Kolluri"
+, title =       "Accurate and Efficient Unions of Balls"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "119--128"
+, update =      "00.11 jones"
 }
 
 @article{ak-maub-01
-, author =	"N. Amenta and R. K. Kolluri"
-, title =	"The medial axis of a union of balls"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	20
-, year =	2001
-, pages =	"25--37"
-, update =	"01.11 smid"
+, author =      "N. Amenta and R. K. Kolluri"
+, title =       "The medial axis of a union of balls"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      20
+, year =        2001
+, pages =       "25--37"
+, update =      "01.11 smid"
 }
 
 @inproceedings{almp-gsgv-95
-, author =	"N. Amenta and S. Levy and T. Munzner and M. Philips"
-, title =	"Geomview: A System for Geometric Visualization"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C12--C13"
-, keywords =	"software, visualization"
-, cites =	"ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex, 95.09 mitchell"
+, author =      "N. Amenta and S. Levy and T. Munzner and M. Philips"
+, title =       "Geomview: A System for Geometric Visualization"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C12--C13"
+, keywords =    "software, visualization"
+, cites =       "ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{az-ssp-96
-, author =	"Nina Amenta and G{\"u}nter Ziegler"
-, title =	"Shadows and Slices of Polytopes"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"10--19"
-, cites =	"aaas-lpmpc-97, af-pachv-92, b-smpa-87, c-osrch-95, ceg-ccc-89, gz-rsakm-94, gs-capof-55, g-wccsv-83, g-csa-94, km-hgisa-72, m-loq-93, m-ccplp-80, pf-ctffc-95, pssbm-cffef-96, s-chdch-86, s-cpdoc-87, z-lp-94, ZZZ"
-, update =	"01.04 icking, 97.11 bibrelex, 96.05 efrat"
+, author =      "Nina Amenta and G{\"u}nter Ziegler"
+, title =       "Shadows and Slices of Polytopes"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "10--19"
+, cites =       "aaas-lpmpc-97, af-pachv-92, b-smpa-87, c-osrch-95, ceg-ccc-89, gz-rsakm-94, gs-capof-55, g-wccsv-83, g-csa-94, km-hgisa-72, m-loq-93, m-ccplp-80, pf-ctffc-95, pssbm-cffef-96, s-chdch-86, s-cpdoc-87, z-lp-94, ZZZ"
+, update =      "01.04 icking, 97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{ab-tdpia-92
-, author =	"A. Amir and G. Benson"
-, title =	"Two-dimensional periodicity and its applications"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"440--452"
+, author =      "A. Amir and G. Benson"
+, title =       "Two-dimensional periodicity and its applications"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "440--452"
 }
 
 @inproceedings{af-e2dam-91
-, author =	"A. Amir and M. Farach"
-, title =	"Efficient $2$-dimensional approximate matching of non-rectangular figures"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"212--223"
+, author =      "A. Amir and M. Farach"
+, title =       "Efficient $2$-dimensional approximate matching of non-rectangular figures"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "212--223"
 }
 
 @article{a-afccf-90
-, author =	"I. Amir"
-, title =	"Algorithms for finding the center of circular fiducials"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	49
-, year =	1990
-, pages =	"398--406"
-, update =	"98.11 bibrelex"
+, author =      "I. Amir"
+, title =       "Algorithms for finding the center of circular fiducials"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      49
+, year =        1990
+, pages =       "398--406"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{a-pmwt-90
-, author =	"Efthymios Anagnostou"
-, title =	"Progress in Minimum Weight Triangulation"
-, type =	"Technical Report 232/90"
-, institution =	"Department of Computer Science, University of Toronto"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "Efthymios Anagnostou"
+, title =       "Progress in Minimum Weight Triangulation"
+, type =        "Technical Report 232/90"
+, institution = "Department of Computer Science, University of Toronto"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @article{ac-ptimw-93
-, author =	"E. Anagnostou and D. Corneil"
-, title =	"Polynomial time instances of the minimum weight triangulation problem"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"247--259"
-, update =	"96.09 devillers"
+, author =      "E. Anagnostou and D. Corneil"
+, title =       "Polynomial time instances of the minimum weight triangulation problem"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "247--259"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{agp-tstd-90
-, author =	"E. G. Anagnostou and Leonidas J. Guibas and V. G. Polimenis"
-, title =	"Topological sweeping in three dimensions"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"310--317"
-, keywords =	"topological sweep, three-dimensional"
-, update =	"98.03 mitchell"
+, author =      "E. G. Anagnostou and Leonidas J. Guibas and V. G. Polimenis"
+, title =       "Topological sweeping in three dimensions"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "310--317"
+, keywords =    "topological sweep, three-dimensional"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{arrms-dgbb2-97
-, author =	"Brad Andalman and Kathy Ryall and Wheeler Ruml and Joe Marks and Stuart Shieber"
-, title =	"Design Gallery Browsers Based on {2D} and {3D} Graph Drawing"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"322--329"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Brad Andalman and Kathy Ryall and Wheeler Ruml and Joe Marks and Stuart Shieber"
+, title =       "Design Gallery Browsers Based on {2D} and {3D} Graph Drawing"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "322--329"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @book{a-caa-73
-, author =	"M. R. Anderberg"
-, title =	"Cluster Analysis for Applications"
-, publisher =	"Academic Press"
-, address =	"New York"
-, year =	1973
-, comments =	"Unchecked reference from PRNN"
-, update =	"98.07 agarwal"
+, author =      "M. R. Anderberg"
+, title =       "Cluster Analysis for Applications"
+, publisher =   "Academic Press"
+, address =     "New York"
+, year =        1973
+, comments =    "Unchecked reference from PRNN"
+, update =      "98.07 agarwal"
 }
 
 @article{a-readc-78
-, author =	"K. R. Anderson"
-, title =	"A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set"
-, journal =	"Inform. Process. Lett."
-, volume =	7
-, number =	1
-, year =	1978
-, pages =	"53--55"
-, update =	"97.11 bibrelex, 95.05 korneenko"
+, author =      "K. R. Anderson"
+, title =       "A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set"
+, journal =     "Inform. Process. Lett."
+, volume =      7
+, number =      1
+, year =        1978
+, pages =       "53--55"
+, update =      "97.11 bibrelex, 95.05 korneenko"
 }
 
 @article{aw-omht-96
-, author =	"L. Anderson and R. Wenger"
-, title =	"Oriented Matroids and Hyperplane Transversals"
-, journal =	"Adv. Math."
-, volume =	119
-, year =	1996
-, pages =	"117--125"
-, update =	"01.07 wenger"
+, author =      "L. Anderson and R. Wenger"
+, title =       "Oriented Matroids and Hyperplane Transversals"
+, journal =     "Adv. Math."
+, volume =      119
+, year =        1996
+, pages =       "117--125"
+, update =      "01.07 wenger"
 }
 
 @incollection{abb-paa-90
-, author =	"R. Anderson and P. Beame and E. Brisson"
-, title =	"Parallel algorithms for arrangements"
-, booktitle =	"ACM Sympos. Paral. Algorithms and Architectures"
-, year =	1990
-, pages =	"298--306"
-, keywords =	"parallel computations, arrangement"
-, update =	"95.09 agarwal+korneenko, 95.05 korneenko"
+, author =      "R. Anderson and P. Beame and E. Brisson"
+, title =       "Parallel algorithms for arrangements"
+, booktitle =   "ACM Sympos. Paral. Algorithms and Architectures"
+, year =        1990
+, pages =       "298--306"
+, keywords =    "parallel computations, arrangement"
+, update =      "95.09 agarwal+korneenko, 95.05 korneenko"
 }
 
 @article{abb-paa-96
-, author =	"Richard Anderson and Paul Beame and Erik Brisson"
-, title =	"Parallel Algorithms for Arrangements"
-, journal =	"Algorithmica"
-, volume =	15
-, year =	1996
-, pages =	"104--125"
-, update =	"98.03 agarwal"
+, author =      "Richard Anderson and Paul Beame and Erik Brisson"
+, title =       "Parallel Algorithms for Arrangements"
+, journal =     "Algorithmica"
+, volume =      15
+, year =        1996
+, pages =       "104--125"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{aks-oa1dt-90
-, author =	"R. Anderson and S. Kahan and M. Schlag"
-, title =	"An {$O(n \log n)$} algorithm for $1$-d tile compaction"
-, editor =	"M. Nagl"
-, booktitle =	"Graph-Theoretic Concepts in Computer Science"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	411
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"287--301"
-, update =	"98.03 bibrelex"
+, author =      "R. Anderson and S. Kahan and M. Schlag"
+, title =       "An {$O(n \log n)$} algorithm for $1$-d tile compaction"
+, editor =      "M. Nagl"
+, booktitle =   "Graph-Theoretic Concepts in Computer Science"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      411
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "287--301"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{am-dplr-88
-, author =	"R. Anderson and G. Miller"
-, title =	"Deterministic parallel list ranking"
-, booktitle =	"Proc. 3rd Aegean Workshop Computing"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	319
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"81--90"
-, update =	"97.11 bibrelex"
+, author =      "R. Anderson and G. Miller"
+, title =       "Deterministic parallel list ranking"
+, booktitle =   "Proc. 3rd Aegean Workshop Computing"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      319
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "81--90"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{a-palc-92
-, author =	"R. J. Anderson"
-, title =	"Primitives for asynchronous list compression"
-, booktitle =	"Proc. 4th ACM Sympos. Parallel Algorithms Architect."
-, year =	1992
-, pages =	"199--208"
-, update =	"96.09 orourke"
+, author =      "R. J. Anderson"
+, title =       "Primitives for asynchronous list compression"
+, booktitle =   "Proc. 4th ACM Sympos. Parallel Algorithms Architect."
+, year =        1992
+, pages =       "199--208"
+, update =      "96.09 orourke"
 }
 
 @article{amw-paabp-89
-, author =	"R. J. Anderson and E. W. Mayr and M. K. Warmuth"
-, title =	"Parallel approximation algorithms for bin packing"
-, journal =	"Inform. Comput."
-, volume =	82
-, year =	1989
-, pages =	"262--277"
-, update =	"96.09 orourke"
+, author =      "R. J. Anderson and E. W. Mayr and M. K. Warmuth"
+, title =       "Parallel approximation algorithms for bin packing"
+, journal =     "Inform. Comput."
+, volume =      82
+, year =        1989
+, pages =       "262--277"
+, update =      "96.09 orourke"
 }
 
 @article{am-dplr-91
-, author =	"R. J. Anderson and G. L. Miller"
-, title =	"An optimal algorithm for intersecting line segments in the plane"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"859--868"
-, update =	"98.07 bibrelex"
+, author =      "R. J. Anderson and G. L. Miller"
+, title =       "An optimal algorithm for intersecting line segments in the plane"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "859--868"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{aw-wfpau-91
-, author =	"R. J. Anderson and H. Woll"
-, title =	"Wait-free parallel algorithms for the union-find problem"
-, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
-, year =	1991
-, pages =	"370--380"
-, update =	"96.09 orourke"
+, author =      "R. J. Anderson and H. Woll"
+, title =       "Wait-free parallel algorithms for the union-find problem"
+, booktitle =   "Proc. 23rd Annu. ACM Sympos. Theory Comput."
+, year =        1991
+, pages =       "370--380"
+, update =      "96.09 orourke"
 }
 
 @article{ahnr-slt-98
-, author =	"Andersson and Hagerup and Nilsson and Raman"
-, title =	"Sorting in linear time?"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	57
-, year =	1998
-, pages =	"74--93"
-, keywords =	""
-, update =	"98.11 pocchiola"
+, author =      "Andersson and Hagerup and Nilsson and Raman"
+, title =       "Sorting in linear time?"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      57
+, year =        1998
+, pages =       "74--93"
+, keywords =    ""
+, update =      "98.11 pocchiola"
 }
 
 @inproceedings{ahhp-fms-94
-, author =	"Arne Andersson and Torben Hagerup and Johan H{\.a}astad and Ola Petersson"
-, title =	"Faster Multidimensional Searching"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	""
-, update =	"94.01 jones"
+, author =      "Arne Andersson and Torben Hagerup and Johan H{\.a}astad and Ola Petersson"
+, title =       "Faster Multidimensional Searching"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       ""
+, update =      "94.01 jones"
 }
 
 @article{aiko-bstao-90
-, author =	"Arne Andersson and Christian Icking and Rolf Klein and Thomas Ottmann"
-, title =	"Binary Search Trees of Almost Optimal Height"
-, journal =	"Acta Inform."
-, volume =	28
-, year =	1990
-, pages =	"165--178"
-, update =	"98.11 bibrelex"
+, author =      "Arne Andersson and Christian Icking and Rolf Klein and Thomas Ottmann"
+, title =       "Binary Search Trees of Almost Optimal Height"
+, journal =     "Acta Inform."
+, volume =      28
+, year =        1990
+, pages =       "165--178"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{amrt-sdarq-96
-, author =	"Arne Andersson and Peter Bro Miltersen and S{\o}ren Riis and Mikkel Thorup"
-, title =	"Static Dictionaries on {$\mathit{AC}^0$} {RAMs}: Query Time {$\Theta(\sqrt(\log n/\log \log n))$} is Necessary and Sufficient"
-, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1996
-, pages =	"441--450"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Arne Andersson and Peter Bro Miltersen and S{\o}ren Riis and Mikkel Thorup"
+, title =       "Static Dictionaries on {$\mathit{AC}^0$} {RAMs}: Query Time {$\Theta(\sqrt(\log n/\log \log n))$} is Necessary and Sufficient"
+, booktitle =   "Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1996
+, pages =       "441--450"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{as-drs-95
-, author =	"Arne Andersson and Kurt Swanson"
-, title =	"On the Difficulty of Range Searching"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"473--481"
-, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
+, author =      "Arne Andersson and Kurt Swanson"
+, title =       "On the Difficulty of Range Searching"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "473--481"
+, update =      "99.07 bibrelex, 96.01 smid, 95.05 mitchell"
 }
 
 @article{as-drs-97
-, author =	"A. Andersson and K. Swanson"
-, title =	"On the Difficulty of Range Searching"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"115--122"
-, update =	"98.03 smid"
+, author =      "A. Andersson and K. Swanson"
+, title =       "On the Difficulty of Range Searching"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "115--122"
+, update =      "98.03 smid"
 }
 
 @article{adps-pptpt-95
-, author =	"L.-E. Andersson and S. M. Dorney and T. J. Peters and N. F. Stewart"
-, title =	"Polyhedral Perturbations that Preserve Topological Form"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	12
-, number =	8
-, month =	dec
-, year =	1995
-, pages =	"785--799"
-, update =	"99.11 bibrelex, 97.07 held"
+, author =      "L.-E. Andersson and S. M. Dorney and T. J. Peters and N. F. Stewart"
+, title =       "Polyhedral Perturbations that Preserve Topological Form"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      12
+, number =      8
+, month =       dec
+, year =        1995
+, pages =       "785--799"
+, update =      "99.11 bibrelex, 97.07 held"
 }
 
 @article{as-eacs-01
-, author =	"M. V. A. Andrade and J. Stolfi"
-, title =	"Exact algorithms for circles on the sphere"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"267--290"
-, update =	"01.07 smid"
+, author =      "M. V. A. Andrade and J. Stolfi"
+, title =       "Exact algorithms for circles on the sphere"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "267--290"
+, update =      "01.07 smid"
 }
 
 @unpublished{a-srvg-89
-, author =	"T. Andrae"
-, title =	"Some results on visibility graphs"
-, year =	1989
-, note =	"Preprint"
-, precedes =	"a-srvg-92"
-, update =	"98.07 bibrelex"
+, author =      "T. Andrae"
+, title =       "Some results on visibility graphs"
+, year =        1989
+, note =        "Preprint"
+, precedes =    "a-srvg-92"
+, update =      "98.07 bibrelex"
 }
 
 @article{a-srvg-92
-, author =	"T. Andreae"
-, title =	"Some Results on Visibility Graphs"
-, journal =	"Discrete Appl. Math."
-, volume =	40
-, year =	1992
-, pages =	"5--17"
-, keywords =	"graph drawing"
-, succeeds =	"a-srvg-89"
-, update =	"98.07 bibrelex, 94.01 tamassia"
+, author =      "T. Andreae"
+, title =       "Some Results on Visibility Graphs"
+, journal =     "Discrete Appl. Math."
+, volume =      40
+, year =        1992
+, pages =       "5--17"
+, keywords =    "graph drawing"
+, succeeds =    "a-srvg-89"
+, update =      "98.07 bibrelex, 94.01 tamassia"
 }
 
 @article{a-cpls-70
-, author =	"E. M. Andreev"
-, title =	"On convex polyhedra in {Lobacevskii} space"
-, journal =	"Math. USSR Sbornik"
-, volume =	10
-, number =	3
-, year =	1970
-, pages =	"413--440"
-, update =	"97.11 bibrelex"
+, author =      "E. M. Andreev"
+, title =       "On convex polyhedra in {Lobacevskii} space"
+, journal =     "Math. USSR Sbornik"
+, volume =      10
+, number =      3
+, year =        1970
+, pages =       "413--440"
+, update =      "97.11 bibrelex"
 }
 
 @article{a-cpfvl-70
-, author =	"E. M. Andreev"
-, title =	"On convex polyhedra of finite volume in {Lobacevskii} space"
-, journal =	"Math. USSR Sbornik"
-, volume =	12
-, number =	2
-, year =	1970
-, pages =	"259--270"
-, update =	"97.11 bibrelex"
+, author =      "E. M. Andreev"
+, title =       "On convex polyhedra of finite volume in {Lobacevskii} space"
+, journal =     "Math. USSR Sbornik"
+, volume =      12
+, number =      2
+, year =        1970
+, pages =       "259--270"
+, update =      "97.11 bibrelex"
 }
 
 @article{a-acap-89
-, author =	"R. D. Andreev"
-, title =	"Algorithm for clipping arbitrary polygons"
-, journal =	"Comput. Graph. Forum"
-, volume =	8
-, number =	3
-, year =	1989
-, pages =	"183--191"
-, keywords =	"polygon, clipping"
-, update =	"95.05 korneenko"
+, author =      "R. D. Andreev"
+, title =       "Algorithm for clipping arbitrary polygons"
+, journal =     "Comput. Graph. Forum"
+, volume =      8
+, number =      3
+, year =        1989
+, pages =       "183--191"
+, keywords =    "polygon, clipping"
+, update =      "95.05 korneenko"
 }
 
 @article{a-aeach-79
-, author =	"A. M. Andrew"
-, title =	"Another efficient algorithm for convex hulls in two dimensions"
-, journal =	"Inform. Process. Lett."
-, volume =	9
-, number =	5
-, year =	1979
-, pages =	"216--219"
-, keywords =	"designing algorithms, convex hull, two-dimensional"
+, author =      "A. M. Andrew"
+, title =       "Another efficient algorithm for convex hulls in two dimensions"
+, journal =     "Inform. Process. Lett."
+, volume =      9
+, number =      5
+, year =        1979
+, pages =       "216--219"
+, keywords =    "designing algorithms, convex hull, two-dimensional"
 }
 
 @inproceedings{a-fcagi-94
-, author =	"D. S. Andrews"
-, title =	"Further comparison of algorithms for geometric intersection problems"
-, booktitle =	"Proc. 6th Internat. Sympos. Spatial Data Handling"
-, site =	"Edinburgh, UK"
-, year =	1994
-, pages =	"709--724"
-, update =	"98.03 bibrelex"
+, author =      "D. S. Andrews"
+, title =       "Further comparison of algorithms for geometric intersection problems"
+, booktitle =   "Proc. 6th Internat. Sympos. Spatial Data Handling"
+, site =        "Edinburgh, UK"
+, year =        1994
+, pages =       "709--724"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{as-gginc-95
-, author =	"D. Scott Andrews and Jack Snoeyink"
-, title =	"Geometry in {GIS} is not Combinatorial: {Segment} Intersection for Polygon Overlay"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C24--C25"
-, keywords =	""
-, cites =	"a-fcagi-94, bo-arcgi-79, c-stsar-94, f-eicld-89, fkn-vsgpt-80, o-tcg-93, ps-crrbs-94, p-csarg-90, s-dasds-90, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "D. Scott Andrews and Jack Snoeyink"
+, title =       "Geometry in {GIS} is not Combinatorial: {Segment} Intersection for Polygon Overlay"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C24--C25"
+, keywords =    ""
+, cites =       "a-fcagi-94, bo-arcgi-79, c-stsar-94, f-eicld-89, fkn-vsgpt-80, o-tcg-93, ps-crrbs-94, p-csarg-90, s-dasds-90, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{a-lbvsc-63
-, author =	"G. E. Andrews"
-, title =	"A lower bound for the volume of strictly convex bodies with many boundary lattice points"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	106
-, year =	1963
-, pages =	"270--279"
-, keywords =	"volume"
-, update =	"95.05 korneenko"
+, author =      "G. E. Andrews"
+, title =       "A lower bound for the volume of strictly convex bodies with many boundary lattice points"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      106
+, year =        1963
+, pages =       "270--279"
+, keywords =    "volume"
+, update =      "95.05 korneenko"
 }
 
 @book{a-imtpr-72
-, author =	"H. C. Andrews"
-, title =	"Introduction to Mathematical Techniques in Pattern Recognition"
-, publisher =	"Wiley-Interscience"
-, address =	"New York"
-, year =	1972
-, update =	"98.03 bibrelex"
+, author =      "H. C. Andrews"
+, title =       "Introduction to Mathematical Techniques in Pattern Recognition"
+, publisher =   "Wiley-Interscience"
+, address =     "New York"
+, year =        1972
+, update =      "98.03 bibrelex"
 }
 
 @article{al-pacag-95
-, author =	"M. Andrews and D. T. Lee"
-, title =	"Parallel algorithms on circular-arc graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"117--141"
-, update =	"96.09 devillers"
+, author =      "M. Andrews and D. T. Lee"
+, title =       "Parallel algorithms on circular-arc graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "117--141"
+, update =      "96.09 devillers"
 }
 
 @unpublished{aahsw-rksjf-98
-, author =	"Artur Andrzejak and Boris Aronov and Sariel Har-Peled and Raimund Seidel and Emo Welzl"
-, title =	"Results on $k$-sets and $j$-facets via continuous motion arguments"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"192--199"
-, update =	"98.11 aronov, 98.03 agarwal"
+, author =      "Artur Andrzejak and Boris Aronov and Sariel Har-Peled and Raimund Seidel and Emo Welzl"
+, title =       "Results on $k$-sets and $j$-facets via continuous motion arguments"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "192--199"
+, update =      "98.11 aronov, 98.03 agarwal"
 }
 
 @article{as-fqna-94
-, author =	"C. H. Ang and H. Samet"
-, title =	"A Fast Quadtree Normalization Algorithm"
-, journal =	"Pattern Recogn. Lett."
-, volume =	15
-, month =	jan
-, year =	1994
-, pages =	"57--63"
-, update =	"96.05 efrat"
+, author =      "C. H. Ang and H. Samet"
+, title =       "A Fast Quadtree Normalization Algorithm"
+, journal =     "Pattern Recogn. Lett."
+, volume =      15
+, month =       jan
+, year =        1994
+, pages =       "57--63"
+, update =      "96.05 efrat"
 }
 
 @incollection{as-ndpq-90
-, author =	"C. H. Ang and H. Samet"
-, title =	"Node distribution in a {PR} quadtree"
-, editor =	"A. Buchmann and O. G{\"u}nther and T. R. Smith and Y.-F. Wang"
-, booktitle =	"Design and Implementation of Large Spatial Databases"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	409
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"223--252"
-, update =	"99.11 bibrelex, 96.09 agarwal, 96.05 efrat"
+, author =      "C. H. Ang and H. Samet"
+, title =       "Node distribution in a {PR} quadtree"
+, editor =      "A. Buchmann and O. G{\"u}nther and T. R. Smith and Y.-F. Wang"
+, booktitle =   "Design and Implementation of Large Spatial Databases"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      409
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "223--252"
+, update =      "99.11 bibrelex, 96.09 agarwal, 96.05 efrat"
 }
 
 @article{ass-nreq-90
-, author =	"C. H. Ang and H. Samet and C. A. Shaffer"
-, title =	"A new region expansion for quadtrees"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	12
-, number =	7
-, month =	jul
-, year =	1990
-, pages =	"682--686"
-, note =	"(also Proceedings of the Third International
-		  Symposium on Spatial Data Handling, Sydney,
-		  Australia, August 1988, 19--37)"
-, update =	"96.05 efrat"
+, author =      "C. H. Ang and H. Samet and C. A. Shaffer"
+, title =       "A new region expansion for quadtrees"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      12
+, number =      7
+, month =       jul
+, year =        1990
+, pages =       "682--686"
+, note =        "(also Proceedings of the Third International
+                  Symposium on Spatial Data Handling, Sydney,
+                  Australia, August 1988, 19--37)"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{ap-sstvc-01
-, author =	"P. Angelier and M. Pocchiola"
-, title =	"A sum of squares theorem for visibility complexes"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
-, year =	2001
-, pages =	"302--311"
-, note =	""
-, update =	"01.11 pocchiola"
+, author =      "P. Angelier and M. Pocchiola"
+, title =       "A sum of squares theorem for visibility complexes"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Comput. Geom."
+, year =        2001
+, pages =       "302--311"
+, note =        ""
+, update =      "01.11 pocchiola"
 }
 
 @inproceedings{ap-ctvg-00
-, author =	"Pierre Angelier and Michel Pocchiola"
-, title =	"On Computing Tangent Visibility Graphs"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"108--111"
-, update =	"00.03 bibrelex"
+, author =      "Pierre Angelier and Michel Pocchiola"
+, title =       "On Computing Tangent Visibility Graphs"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "108--111"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{apr-tsm-99
-, author =	"Pierre Angelier and Michel Pocchiola and St{\'e}phane Rivi{\`e}re"
-, title =	"On the Topological Sweep Method"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	179
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Pierre Angelier and Michel Pocchiola and St{\'e}phane Rivi{\`e}re"
+, title =       "On the Topological Sweep Method"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       179
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{am-qtad2-86
-, author =	"Ian O. Angell and Richard E. M. Moore"
-, title =	"Quad-Tree Algorithm For Displaying a 2-Dimensional Slice Of An $n$-Dimensional Weighted {Voronoi} Tessellation"
-, booktitle =	"EUROGRAPHICS '86: Proceedings of the European Computer Graphics Conference and Exhibition --- The Computer Interface."
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1986
-, pages =	"19--27"
-, keywords =	"Voronoi tessellation, computational geometry"
-, annote =	"Multiplicative weights. Quadtree Method: find closest
-		 (weighted) point to square centre, then construct
-		 bisectors of this point with all others to see if any
-		 intersect square and subdivide if necessary."
-, abstract =	"A tessellation exists in N-dimensional Euclidean space
-		 which is best known either in purely 2-dimensional
-		 contexts or in the purely 3-dimensional --- often workers
-		 familiar with the one paying no regard to the other ---
-		 though the utility of this tessellation in 2-, 3- and
-		 even higher dimensions is vast. In 2-dimensions
-		 applications exist in fields as disparate as
-		 archaeology, astronomy, biology, economics, forestry,
-		 geography, metallurgy and virology, and in many other
-		 fields too. In 3-dimensions applications are equally
-		 varied: for example in anatomy, astronomy, botany,
-		 chemistry, crystallography, and stereology. It has
-		 major importance in the investigation of the structure
-		 of liquids, and in other aspects of physics.
-		 Applications in dimensions higher than three, although
-		 comparatively rare, do exist --- and might be greater if
-		 such tessellations were easier to calculate. 10 refs."
+, author =      "Ian O. Angell and Richard E. M. Moore"
+, title =       "Quad-Tree Algorithm For Displaying a 2-Dimensional Slice Of An $n$-Dimensional Weighted {Voronoi} Tessellation"
+, booktitle =   "EUROGRAPHICS '86: Proceedings of the European Computer Graphics Conference and Exhibition --- The Computer Interface."
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1986
+, pages =       "19--27"
+, keywords =    "Voronoi tessellation, computational geometry"
+, annote =      "Multiplicative weights. Quadtree Method: find closest
+                 (weighted) point to square centre, then construct
+                 bisectors of this point with all others to see if any
+                 intersect square and subdivide if necessary."
+, abstract =    "A tessellation exists in N-dimensional Euclidean space
+                 which is best known either in purely 2-dimensional
+                 contexts or in the purely 3-dimensional --- often workers
+                 familiar with the one paying no regard to the other ---
+                 though the utility of this tessellation in 2-, 3- and
+                 even higher dimensions is vast. In 2-dimensions
+                 applications exist in fields as disparate as
+                 archaeology, astronomy, biology, economics, forestry,
+                 geography, metallurgy and virology, and in many other
+                 fields too. In 3-dimensions applications are equally
+                 varied: for example in anatomy, astronomy, botany,
+                 chemistry, crystallography, and stereology. It has
+                 major importance in the investigation of the structure
+                 of liquids, and in other aspects of physics.
+                 Applications in dimensions higher than three, although
+                 comparatively rare, do exist --- and might be greater if
+                 such tessellations were easier to calculate. 10 refs."
 }
 
 @article{am-pdp-89
-, author =	"T. A. Angelov and I. S. Manoach"
-, title =	"A point-in-domain program"
-, journal =	"Adv. Eng. Softw."
-, volume =	11
-, number =	2
-, year =	1989
-, pages =	"99--106"
-, keywords =	"point location, implementation"
-, update =	"96.09 devillers, 95.05 korneenko"
+, author =      "T. A. Angelov and I. S. Manoach"
+, title =       "A point-in-domain program"
+, journal =     "Adv. Eng. Softw."
+, volume =      11
+, number =      2
+, year =        1989
+, pages =       "99--106"
+, keywords =    "point location, implementation"
+, update =      "96.09 devillers, 95.05 korneenko"
 }
 
 @article{av-fpahc-79
-, author =	"D. Angluin and L. G. Valiant"
-, title =	"Fast Probabilistic Algorithms for {Hamiltonian} Circuits and Matchings"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	18
-, year =	1979
-, pages =	"155--193"
-, update =	"98.03 bibrelex"
+, author =      "D. Angluin and L. G. Valiant"
+, title =       "Fast Probabilistic Algorithms for {Hamiltonian} Circuits and Matchings"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      18
+, year =        1979
+, pages =       "155--193"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{awz-rnrq-96
-, author =	"Dana Angluin and Jeffery Westbrook and Wenhong Zhu"
-, title =	"Robot Navigation with Range Queries"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '96"
-, site =	"Philadelphia, PA"
-, month =	may
-, year =	1996
-, pages =	"469--478"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "Dana Angluin and Jeffery Westbrook and Wenhong Zhu"
+, title =       "Robot Navigation with Range Queries"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '96"
+, site =        "Philadelphia, PA"
+, month =       may
+, year =        1996
+, pages =       "469--478"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{adf-efgrs-84
-, author =	"S. Ansaldi and L. {De Floriani} and B. Falcidieno"
-, title =	"Edge-face graph representation of solid objects"
-, booktitle =	"Poceedings of Workshop on Computer Vision, Representation and Control"
-, site =	"Annapolis, MD"
-, year =	1984
-, pages =	"164--169"
-, update =	"98.03 bibrelex"
+, author =      "S. Ansaldi and L. {De Floriani} and B. Falcidieno"
+, title =       "Edge-face graph representation of solid objects"
+, booktitle =   "Poceedings of Workshop on Computer Vision, Representation and Control"
+, site =        "Annapolis, MD"
+, year =        1984
+, pages =       "164--169"
+, update =      "98.03 bibrelex"
 }
 
 @article{adf-gmsou-85
-, author =	"S. Ansaldi and L. {De Floriani} and B. Falcidieno"
-, title =	"Geometric modeling of solid objects by using a face adjacency graph representation"
-, journal =	"Comput. Graph."
-, volume =	19
-, number =	3
-, year =	1985
-, pages =	"131--139"
-, note =	"Proc. SIGGRAPH '85"
+, author =      "S. Ansaldi and L. {De Floriani} and B. Falcidieno"
+, title =       "Geometric modeling of solid objects by using a face adjacency graph representation"
+, journal =     "Comput. Graph."
+, volume =      19
+, number =      3
+, year =        1985
+, pages =       "131--139"
+, note =        "Proc. SIGGRAPH '85"
 }
 
 @book{ab-clt-92
-, author =	"M. Anthony and N. Biggs"
-, title =	"Computational Learning Theory"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge"
-, year =	1992
-, update =	"95.05 agarwal"
+, author =      "M. Anthony and N. Biggs"
+, title =       "Computational Learning Theory"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge"
+, year =        1992
+, update =      "95.05 agarwal"
 }
 
 @article{a-slddf-21
-, author =	"L. Antoine"
-, title =	"Sur l'homeomorphisme de deux figures et de leurs voisinages"
-, journal =	"J. Math., Ser. 8"
-, volume =	4
-, year =	1921
-, pages =	"221--235"
-, update =	"98.07 bibrelex"
+, author =      "L. Antoine"
+, title =       "Sur l'homeomorphisme de deux figures et de leurs voisinages"
+, journal =     "J. Math., Ser. 8"
+, volume =      4
+, year =        1921
+, pages =       "221--235"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ag-iad5v-97
-, author =	"Fran{\c c}ois Anton and Christopher Gold"
-, title =	"An Iterative Algorithm for the Determination of {V}oronoi Vertices in Polygonal and Non--Polygonal Domains"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"257--262"
-, update =	"00.03 bibrelex, 97.11 jones"
+, author =      "Fran{\c c}ois Anton and Christopher Gold"
+, title =       "An Iterative Algorithm for the Determination of {V}oronoi Vertices in Polygonal and Non--Polygonal Domains"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "257--262"
+, update =      "00.03 bibrelex, 97.11 jones"
 }
 
 @inproceedings{am-dldme-00
-, author =	"Fran{\c c}ois Anton and Darka Mioc"
-, title =	"Dynamic {Laguerre} Diagrams Made Easy"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"10--13"
-, update =	"00.03 bibrelex"
+, author =      "Fran{\c c}ois Anton and Darka Mioc"
+, title =       "Dynamic {Laguerre} Diagrams Made Easy"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "10--13"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{asg-iadvv
-, author =	"Fran{\c c}ois Anton and Jack Snoeyink and Christopher Gold"
-, title =	"An Iterative Algorithm for the Determination of {Voronoi} Vertices in Polygonal and Non-Polygonal Domains on the Plane and the Sphere"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"33--35"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Fran{\c c}ois Anton and Jack Snoeyink and Christopher Gold"
+, title =       "An Iterative Algorithm for the Determination of {Voronoi} Vertices in Polygonal and Non-Polygonal Domains on the Plane and the Sphere"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "33--35"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{a-edsau-89
-, author =	"J.-I. Aoe"
-, title =	"An efficient digital search algorithm by using a double-array structure"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	15
-, number =	9
-, year =	1989
-, pages =	"1066--1077"
-, update =	"95.05 korneenko"
+, author =      "J.-I. Aoe"
+, title =       "An efficient digital search algorithm by using a double-array structure"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      15
+, number =      9
+, year =        1989
+, pages =       "1066--1077"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{a-pah-92
-, author =	"Y. Aoki"
-, title =	"Probing the arrangement of hyperplanes"
-, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
-, site =	"Kyoto, Japan"
-, year =	1992
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Y. Aoki"
+, title =       "Probing the arrangement of hyperplanes"
+, booktitle =   "Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
+, site =        "Kyoto, Japan"
+, year =        1992
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @phdthesis{a-ccra-93
-, author =	"Y. Aoki"
-, title =	"The combinatorial complexity of reconstructing arrangements"
-, school =	"Department of Information Science, University of Tokyo"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "Y. Aoki"
+, title =       "The combinatorial complexity of reconstructing arrangements"
+, school =      "Department of Information Science, University of Tokyo"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{aiir-pshlr-93
-, author =	"Yasukazu Aoki and Hiroshi Imai and Keiko Imai and David Rappaport"
-, title =	"Probing a Set of Hyperplanes by Lines and Related Problems"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"72--82"
-, update =	"93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "Yasukazu Aoki and Hiroshi Imai and Keiko Imai and David Rappaport"
+, title =       "Probing a Set of Hyperplanes by Lines and Related Problems"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "72--82"
+, update =      "93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @inproceedings{aiit-mlcop-90
-, author =	"H. Aonuma and H. Imai and K. Imai and T. Tokuyama"
-, title =	"Maximin location of convex objects in a polygon and related dynamic {Voronoi} diagrams"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"225--234"
-, cites =	"ass-sulbl-89, aik-vspca-89, a-sdcgp-85, ab-pptr-88, c-pcp-83, ck-plscc-89, f-fapct-85, f-savd-87, i-vdmp-89, isi-mgftc-89, ls-pptmc-87, s-pds-74, t-dmvdt-88, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "H. Aonuma and H. Imai and K. Imai and T. Tokuyama"
+, title =       "Maximin location of convex objects in a polygon and related dynamic {Voronoi} diagrams"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "225--234"
+, cites =       "ass-sulbl-89, aik-vspca-89, a-sdcgp-85, ab-pptr-88, c-pcp-83, ck-plscc-89, f-fapct-85, f-savd-87, i-vdmp-89, isi-mgftc-89, ls-pptmc-87, s-pds-74, t-dmvdt-88, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{aiit-mpcpr-90
-, author =	"H. Aonuma and H. Imai and K. Imai and T. Tokuyama"
-, title =	"Maximin polygon containment problems and related dynamic {Voronoi} diagrams"
-, journal =	"Surikaisekikenkyosho Kokyuroku"
-, volume =	731
-, year =	1990
-, pages =	"177--186"
-, note =	"Proc. Sympos. Algorithms and Comput. Complexity"
-, keywords =	"on-line algorithms, convex, location, Voronoi diagram"
-, update =	"98.07 bibrelex, 95.09 agarwal, 95.05 korneenko"
+, author =      "H. Aonuma and H. Imai and K. Imai and T. Tokuyama"
+, title =       "Maximin polygon containment problems and related dynamic {Voronoi} diagrams"
+, journal =     "Surikaisekikenkyosho Kokyuroku"
+, volume =      731
+, year =        1990
+, pages =       "177--186"
+, note =        "Proc. Sympos. Algorithms and Comput. Complexity"
+, keywords =    "on-line algorithms, convex, location, Voronoi diagram"
+, update =      "98.07 bibrelex, 95.09 agarwal, 95.05 korneenko"
 }
 
 @inproceedings{aik-vspca-89
-, author =	"H. Aonuma and H. Imai and Y. Kambayashi"
-, title =	"A Visual System of Placing Characters Appropriately in Multimedia Map Databases"
-, booktitle =	"Visual Database Systems"
-, publisher =	"North-Holland"
-, year =	1989
-, pages =	"525--546"
-, note =	"Proc. IFIP TC2/WG2.6 Working Conf. Visual Database Syst."
-, update =	"97.11 bibrelex"
+, author =      "H. Aonuma and H. Imai and Y. Kambayashi"
+, title =       "A Visual System of Placing Characters Appropriately in Multimedia Map Databases"
+, booktitle =   "Visual Database Systems"
+, publisher =   "North-Holland"
+, year =        1989
+, pages =       "525--546"
+, note =        "Proc. IFIP TC2/WG2.6 Working Conf. Visual Database Syst."
+, update =      "97.11 bibrelex"
 }
 
 @article{als-caged-86
-, author =	"F. Aoudja and M. Laborie and A. Saint-Paul"
-, title =	"{CASE}: Automatic Generation of Electrical Diagrams"
-, journal =	"Comput. Aided Design"
-, volume =	18
-, number =	7
-, year =	1986
-, pages =	"356--360"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "F. Aoudja and M. Laborie and A. Saint-Paul"
+, title =       "{CASE}: Automatic Generation of Electrical Diagrams"
+, journal =     "Comput. Aided Design"
+, volume =      18
+, number =      7
+, year =        1986
+, pages =       "356--360"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{a-iant-76
-, author =	"T. M. Apostol"
-, title =	"Introduction to Analytic Number Theory"
-, publisher =	"Springer-Verlag"
-, year =	1976
-, update =	"97.11 bibrelex"
+, author =      "T. M. Apostol"
+, title =       "Introduction to Analytic Number Theory"
+, publisher =   "Springer-Verlag"
+, year =        1976
+, update =      "97.11 bibrelex"
 }
 
 @article{aalm-epase-90
-, author =	"A. Apostolico and M. J. Atallah and L. L. Larmore and H. S. McFaddin"
-, title =	"Efficient parallel algorithms for string editing and related problems"
-, journal =	"SIAM J. Comput."
-, volume =	19
-, number =	5
-, year =	1990
-, pages =	"968--988"
-, update =	"98.11 bibrelex"
+, author =      "A. Apostolico and M. J. Atallah and L. L. Larmore and H. S. McFaddin"
+, title =       "Efficient parallel algorithms for string editing and related problems"
+, journal =     "SIAM J. Comput."
+, volume =      19
+, number =      5
+, year =        1990
+, pages =       "968--988"
+, update =      "98.11 bibrelex"
 }
 
 @article{ah-fmcca-88
-, author =	"A. Apostolico and S. E. Hambrusch"
-, title =	"Finding maximal cliques of circular-arc graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	26
-, number =	4
-, year =	1988
-, pages =	"209--215"
-, keywords =	"circular-arc graph, geometric graphs, clique"
-, update =	"95.05 korneenko"
+, author =      "A. Apostolico and S. E. Hambrusch"
+, title =       "Finding maximal cliques of circular-arc graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      26
+, number =      4
+, year =        1988
+, pages =       "209--215"
+, keywords =    "circular-arc graph, geometric graphs, clique"
+, update =      "95.05 korneenko"
 }
 
 @article{as-lce-73
-, author =	"G. Appa and C. Smith"
-, title =	"On {$L_{1}$} and {Chebyshev} estimation"
-, journal =	"Math. Program."
-, volume =	5
-, year =	1973
-, pages =	"73--87"
-, update =	"98.03 bibrelex"
+, author =      "G. Appa and C. Smith"
+, title =       "On {$L_{1}$} and {Chebyshev} estimation"
+, journal =     "Math. Program."
+, volume =      5
+, year =        1973
+, pages =       "73--87"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{a-nqimr-67
-, author =	"A. Appel"
-, title =	"The notion of quantitative invisibility and the machine rendering of solids"
-, booktitle =	"Proc. ACM National Conference"
-, year =	1967
-, pages =	"367--393"
-, update =	"98.03 bibrelex"
+, author =      "A. Appel"
+, title =       "The notion of quantitative invisibility and the machine rendering of solids"
+, booktitle =   "Proc. ACM National Conference"
+, year =        1967
+, pages =       "367--393"
+, update =      "98.03 bibrelex"
 }
 
 @article{aw-dtdch-76
-, author =	"A. Appel and P. M. Will"
-, title =	"Determining the three-dimensional convex hull of a polyhedron"
-, journal =	"IBM J. Res. Develop."
-, volume =	20
-, year =	1976
-, pages =	"590--611"
+, author =      "A. Appel and P. M. Will"
+, title =       "Determining the three-dimensional convex hull of a polyhedron"
+, journal =     "IBM J. Res. Develop."
+, volume =      20
+, year =        1976
+, pages =       "590--611"
 }
 
 @article{ah-epmfc-77
-, author =	"K. Appel and W. Haken"
-, title =	"Every planar map is four colourable, Part {I}: discharging"
-, journal =	"Illinois J. Math."
-, volume =	21
-, year =	1977
-, pages =	"429--490"
-, update =	"98.11 bibrelex"
+, author =      "K. Appel and W. Haken"
+, title =       "Every planar map is four colourable, Part {I}: discharging"
+, journal =     "Illinois J. Math."
+, volume =      21
+, year =        1977
+, pages =       "429--490"
+, update =      "98.11 bibrelex"
 }
 
 @book{a-tdmrt-41
-, author =	"P. Appell"
-, title =	"Trait{\'e} de M{\'e}canique Rationelle, Tome {I}: Statique, Dynamique du Point"
-, edition =	"6th"
-, publisher =	"Gauthier-Villars"
-, year =	1941
-, update =	"98.07 bibrelex"
+, author =      "P. Appell"
+, title =       "Trait{\'e} de M{\'e}canique Rationelle, Tome {I}: Statique, Dynamique du Point"
+, edition =     "6th"
+, publisher =   "Gauthier-Villars"
+, year =        1941
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ak-levtg-91
-, author =	"D. Applegate and R. Kannan"
-, title =	"Local expansion of vertex-transitive graphs and random generation in finite groups"
-, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
-, year =	1991
-, pages =	"164--174"
-, keywords =	"approximation, volume, convex"
+, author =      "D. Applegate and R. Kannan"
+, title =       "Local expansion of vertex-transitive graphs and random generation in finite groups"
+, booktitle =   "Proc. 23rd Annu. ACM Sympos. Theory Comput."
+, year =        1991
+, pages =       "164--174"
+, keywords =    "approximation, volume, convex"
 }
 
 @inproceedings{at-qdbt-00
-, author =	"Sigal Ar and Ayellet Tal"
-, title =	"Query Driven {BSP} Trees"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"81--84"
-, update =	"00.03 bibrelex"
+, author =      "Sigal Ar and Ayellet Tal"
+, title =       "Query Driven {BSP} Trees"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "81--84"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{as-rst-89
-, author =	"C. Aragon and R. Seidel"
-, title =	"Randomized search trees"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"540--545"
+, author =      "C. Aragon and R. Seidel"
+, title =       "Randomized search trees"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "540--545"
 }
 
 @article{ac-r1mp-83
-, author =	"J. Ar{\'a}oz and W. H. Cunningham"
-, title =	"Reductions to $1$-matching polyhedra"
-, journal =	"Networks"
-, volume =	13
-, year =	1983
-, pages =	"455--473"
+, author =      "J. Ar{\'a}oz and W. H. Cunningham"
+, title =       "Reductions to $1$-matching polyhedra"
+, journal =     "Networks"
+, volume =      13
+, year =        1983
+, pages =       "455--473"
 }
 
 @article{ac-cpdia-74
-, author =	"C. Arcelli and L. Cordella"
-, title =	"Concavity point detection by iterative arrays"
-, journal =	"Comput. Graph. Image Process."
-, volume =	3
-, year =	1974
-, pages =	"34--47"
+, author =      "C. Arcelli and L. Cordella"
+, title =       "Concavity point detection by iterative arrays"
+, journal =     "Comput. Graph. Image Process."
+, volume =      3
+, year =        1974
+, pages =       "34--47"
 }
 
 @article{al-cepp-71
-, author =	"C. Arcelli and S. Levialdi"
-, title =	"Concavity extraction by parallel processing"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	"SMC-1"
-, year =	1971
-, pages =	"394--396"
+, author =      "C. Arcelli and S. Levialdi"
+, title =       "Concavity extraction by parallel processing"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      "SMC-1"
+, year =        1971
+, pages =       "394--396"
 }
 
 @article{asdb-cvddp-86
-, author =	"C. Arcelli and G. {Sanniti di Baja}"
-, title =	"Computing {Voronoi} diagrams in digital pictures"
-, journal =	"Pattern Recogn. Lett."
-, volume =	4
-, number =	5
-, year =	1986
-, pages =	"383--389"
-, keywords =	"Voronoi diagram, digital geometry"
-, update =	"95.05 korneenko"
+, author =      "C. Arcelli and G. {Sanniti di Baja}"
+, title =       "Computing {Voronoi} diagrams in digital pictures"
+, journal =     "Pattern Recogn. Lett."
+, volume =      4
+, number =      5
+, year =        1986
+, pages =       "383--389"
+, keywords =    "Voronoi diagram, digital geometry"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{as-pcctb-78
-, author =	"C. Arcelli and G. {Sanniti di Baja}"
-, title =	"Polygonal covering and concavity tree of binary digital pictures"
-, editor =	"M. H. Hamza and S. G. Tzafestas"
-, booktitle =	"Proc. Internat. Sympos. Measurement \& Control"
-, nickname =	"MECO '78"
-, publisher =	"Panhellenic Society of Mechanical \& Electrical Engineers"
-, address =	"Athens"
-, year =	1978
-, pages =	"292--297"
-, update =	"95.05 korneenko"
+, author =      "C. Arcelli and G. {Sanniti di Baja}"
+, title =       "Polygonal covering and concavity tree of binary digital pictures"
+, editor =      "M. H. Hamza and S. G. Tzafestas"
+, booktitle =   "Proc. Internat. Sympos. Measurement \& Control"
+, nickname =    "MECO '78"
+, publisher =   "Panhellenic Society of Mechanical \& Electrical Engineers"
+, address =     "Athens"
+, year =        1978
+, pages =       "292--297"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{a-iacs-95
-, author =	"Eugen Ardeleanu"
-, title =	"Intersection Algorithms: A Comparative Study"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"43--46"
-, update =	"00.03 bibrelex"
+, author =      "Eugen Ardeleanu"
+, title =       "Intersection Algorithms: A Comparative Study"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "43--46"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{as-cmqou-94
-, author =	"W. G. Aref and H. Samet"
-, title =	"A Cost Model for Query Optimization Using R-Trees"
-, booktitle =	"Proceedings of the Second ACM Workshop on Geographic Information Systems"
-, site =	"Gaithersburg, Maryland"
-, month =	dec
-, year =	1994
-, pages =	"60--67"
-, update =	"96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "A Cost Model for Query Optimization Using R-Trees"
+, booktitle =   "Proceedings of the Second ACM Workshop on Geographic Information Systems"
+, site =        "Gaithersburg, Maryland"
+, month =       dec
+, year =        1994
+, pages =       "60--67"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{as-wrasd-95
-, author =	"W. G. Aref and H. Samet"
-, title =	"A Window Retrieval Algorithm for Spatial Databases Using Quadtrees"
-, booktitle =	"Proceedings of the Third ACM Workshop on Geographic Information Systems"
-, site =	"Baltimore"
-, month =	dec
-, year =	1995
-, pages =	"69--76"
-, update =	"96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "A Window Retrieval Algorithm for Spatial Databases Using Quadtrees"
+, booktitle =   "Proceedings of the Third ACM Workshop on Geographic Information Systems"
+, site =        "Baltimore"
+, month =       dec
+, year =        1995
+, pages =       "69--76"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{as-aimga-90
-, author =	"W. G. Aref and H. Samet"
-, title =	"An Approach to Information Management in Geographical Applications"
-, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
-, site =	"Zurich"
-, month =	jul
-, year =	1990
-, pages =	"589--598"
-, update =	"96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "An Approach to Information Management in Geographical Applications"
+, booktitle =   "Proc. 4th Internat. Sympos. Spatial Data Handling"
+, site =        "Zurich"
+, month =       jul
+, year =        1990
+, pages =       "589--598"
+, update =      "96.05 efrat"
 }
 
 @techreport{as-ewras-92
-, author =	"W. G. Aref and H. Samet"
-, title =	"An efficient window retrieval algorithm for spatial query processing"
-, type =	"Computer Science Department"
-, number =	"TR-2866"
-, institution =	"UMD"
-, address =	"College Park, MD"
-, month =	mar
-, year =	1992
-, update =	"96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "An efficient window retrieval algorithm for spatial query processing"
+, type =        "Computer Science Department"
+, number =      "TR-2866"
+, institution = "UMD"
+, address =     "College Park, MD"
+, month =       mar
+, year =        1992
+, update =      "96.05 efrat"
 }
 
 @article{as-dwmqb-93
-, author =	"W. G. Aref and H. Samet"
-, title =	"Decomposing a window into maximal quadtree blocks"
-, journal =	"Acta Inform."
-, volume =	"??"
-, year =	1993
-, note =	"(also University of Maryland Computer Science
+, author =      "W. G. Aref and H. Samet"
+, title =       "Decomposing a window into maximal quadtree blocks"
+, journal =     "Acta Inform."
+, volume =      "??"
+, year =        1993
+, note =        "(also University of Maryland Computer Science
                   TR-2771)"
-, update =	"96.05 efrat"
+, update =      "96.05 efrat"
 }
 
 @techreport{as-deups-93
-, author =	"W. G. Aref and H. Samet"
-, title =	"Duplicate Elimination using Proximity in Spatial Databases"
-, number =	"CS-3067"
-, institution =	"University of Maryland"
-, address =	"College Park, MD"
-, month =	may
-, year =	1993
-, update =	"96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "Duplicate Elimination using Proximity in Spatial Databases"
+, number =      "CS-3067"
+, institution = "University of Maryland"
+, address =     "College Park, MD"
+, month =       may
+, year =        1993
+, update =      "96.05 efrat"
 }
 
 @inproceedings{as-epwqp-90
-, author =	"W. G. Aref and H. Samet"
-, title =	"Efficient processing of window queries in the pyramid data structure"
-, booktitle =	"Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems"
-, nickname =	"PODS"
-, site =	"Nashville Tennessee"
-, month =	apr
-, year =	1990
-, pages =	"265--272"
-, note =	"(also in Proceedings of the Fifth Brazilian
-		  Symposium on Databases, Rio de Janeiro, Brazil,
-		  April 1990, 15--26)"
-, update =	"96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "Efficient processing of window queries in the pyramid data structure"
+, booktitle =   "Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems"
+, nickname =    "PODS"
+, site =        "Nashville Tennessee"
+, month =       apr
+, year =        1990
+, pages =       "265--272"
+, note =        "(also in Proceedings of the Fifth Brazilian
+                  Symposium on Databases, Rio de Janeiro, Brazil,
+                  April 1990, 15--26)"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{as-esfso-93
-, author =	"W. G. Aref and H. Samet"
-, title =	"Estimating Selectivity Factors of Spatial Operations"
-, booktitle =	"Optimization in Databases - 5th Int'l Workshop on Foundations of Models and Languages for Data and Objects"
-, site =	"Aigen, Austria"
-, month =	sep
-, year =	1993
-, pages =	"31--40"
-, note =	"(also tech report:  Informatik-Bericht 93/9
+, author =      "W. G. Aref and H. Samet"
+, title =       "Estimating Selectivity Factors of Spatial Operations"
+, booktitle =   "Optimization in Databases - 5th Int'l Workshop on Foundations of Models and Languages for Data and Objects"
+, site =        "Aigen, Austria"
+, month =       sep
+, year =        1993
+, pages =       "31--40"
+, note =        "(also tech report:  Informatik-Bericht 93/9
                    Technische Universitat Clausthal, Clausthal -
                    Zellerfeld)"
-, update =	"96.05 efrat"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{as-edso-91
-, author =	"W. G. Aref and H. Samet"
-, title =	"Extending a {DBMS} with spatial operations"
-, editor =	"O. G{\"u}nther and H. J. Schek"
-, booktitle =	"Proc. 2nd Sympos. Advances in Spatial Databases"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1991
-, pages =	"299--318"
-, note =	"(also Lecture Notes in Computer Science 525)"
-, update =	"96.09 agarwal, 96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "Extending a {DBMS} with spatial operations"
+, editor =      "O. G{\"u}nther and H. J. Schek"
+, booktitle =   "Proc. 2nd Sympos. Advances in Spatial Databases"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1991
+, pages =       "299--318"
+, note =        "(also Lecture Notes in Computer Science 525)"
+, update =      "96.09 agarwal, 96.05 efrat"
 }
 
 @inproceedings{as-hppds-94
-, author =	"W. G. Aref and H. Samet"
-, title =	"Hashing by Proximity to Process Duplicates in Spatial Databases"
-, booktitle =	"Proceedings of the Third International Conference on Information and Knowledge Management"
-, publisher =	"ACM Press"
-, address =	"Gaithersburg, Maryland"
-, month =	dec
-, year =	1994
-, pages =	"347--354"
-, update =	"96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "Hashing by Proximity to Process Duplicates in Spatial Databases"
+, booktitle =   "Proceedings of the Third International Conference on Information and Knowledge Management"
+, publisher =   "ACM Press"
+, address =     "Gaithersburg, Maryland"
+, month =       dec
+, year =        1994
+, pages =       "347--354"
+, update =      "96.05 efrat"
 }
 
 @incollection{as-lsfip-92
-, author =	"W. G. Aref and H. Samet"
-, title =	"Loading spatial features into the incomplete pyramid data structure"
-, editor =	"G. Gambosi and M. Scholl and H.-W. Six"
-, booktitle =	"?"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1992
-, pages =	"138--160"
-, update =	"96.09 agarwal, 96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "Loading spatial features into the incomplete pyramid data structure"
+, editor =      "G. Gambosi and M. Scholl and H.-W. Six"
+, booktitle =   "?"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1992
+, pages =       "138--160"
+, update =      "96.09 agarwal, 96.05 efrat"
 }
 
 @inproceedings{as-ossqp-91
-, author =	"W. G. Aref and H. Samet"
-, title =	"Optimization strategies for spatial query processing"
-, editor =	"G. Lohman"
-, booktitle =	"Proceedings of the Seventeenth International Conference on Very Large Data Bases"
-, site =	"Barcelona"
-, month =	sep
-, year =	1991
-, pages =	"81--90"
-, update =	"96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "Optimization strategies for spatial query processing"
+, editor =      "G. Lohman"
+, booktitle =   "Proceedings of the Seventeenth International Conference on Very Large Data Bases"
+, site =        "Barcelona"
+, month =       sep
+, year =        1991
+, pages =       "81--90"
+, update =      "96.05 efrat"
 }
 
 @article{as-pvoro-95
-, author =	"W. G. Aref and H. Samet"
-, title =	"Perspective viewing of objects Represented by Octrees"
-, journal =	"Comput. Graph. Forum"
-, volume =	14
-, number =	1
-, month =	mar
-, year =	1995
-, pages =	"59--66"
-, note =	"also University of Maryland Computer Science
+, author =      "W. G. Aref and H. Samet"
+, title =       "Perspective viewing of objects Represented by Octrees"
+, journal =     "Comput. Graph. Forum"
+, volume =      14
+, number =      1
+, month =       mar
+, year =        1995
+, pages =       "59--66"
+, note =        "also University of Maryland Computer Science
                   TR-2757"
-, update =	"96.05 efrat"
+, update =      "96.05 efrat"
 }
 
 @techreport{as-qsesj-93
-, author =	"W. G. Aref and Hanan Samet"
-, title =	"Query size estimation of spatial join"
-, number =	"MITL-TR 79-93"
-, institution =	"Matsushita Information Technology Laboratory"
-, address =	"2 Research Way, Princeton, NJ 08540-6628"
-, month =	dec
-, year =	1993
-, update =	"96.05 efrat"
+, author =      "W. G. Aref and Hanan Samet"
+, title =       "Query size estimation of spatial join"
+, number =      "MITL-TR 79-93"
+, institution = "Matsushita Information Technology Laboratory"
+, address =     "2 Research Way, Princeton, NJ 08540-6628"
+, month =       dec
+, year =        1993
+, update =      "96.05 efrat"
 }
 
 @inproceedings{as-sfr-94
-, author =	"W. G. Aref and H. Samet"
-, title =	"The Spatial Filter Revisited"
-, editor =	"T. C. Waugh and R. G. Healey"
-, booktitle =	"Proc. 6th Internat. Sympos. Spatial Data Handling"
-, site =	"Edinburgh, Scotland"
-, organization =	"International Geographical Union Comission on Geographic Information Systems, Association for Geographical Information"
-, month =	sep
-, year =	1994
-, pages =	"190--208"
-, update =	"96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "The Spatial Filter Revisited"
+, editor =      "T. C. Waugh and R. G. Healey"
+, booktitle =   "Proc. 6th Internat. Sympos. Spatial Data Handling"
+, site =        "Edinburgh, Scotland"
+, organization =        "International Geographical Union Comission on Geographic Information Systems, Association for Geographical Information"
+, month =       sep
+, year =        1994
+, pages =       "190--208"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{as-ursoy-92
-, author =	"W. G. Aref and H. Samet"
-, title =	"Uniquely reporting spatial objects: yet another operation for comparing spatial data structures"
-, booktitle =	"Proceedings of the fifth international symposium on spatial data handling"
-, site =	"Charleston, South Carolina"
-, month =	aug
-, year =	1992
-, pages =	"178--189"
-, update =	"96.05 efrat"
+, author =      "W. G. Aref and H. Samet"
+, title =       "Uniquely reporting spatial objects: yet another operation for comparing spatial data structures"
+, booktitle =   "Proceedings of the fifth international symposium on spatial data handling"
+, site =        "Charleston, South Carolina"
+, month =       aug
+, year =        1992
+, pages =       "178--189"
+, update =      "96.05 efrat"
 }
 
 @techreport{a-esdsp-94
-, author =	"L. Arge"
-, title =	"External-storage data structures for plane-sweep algorithms"
-, type =	"Technical {Report}"
-, number =	"RS-94-16"
-, institution =	"BRICS"
-, address =	"Aarhus Univ., Denmark"
-, year =	1994
-, update =	"95.01 devillers"
+, author =      "L. Arge"
+, title =       "External-storage data structures for plane-sweep algorithms"
+, type =        "Technical {Report}"
+, number =      "RS-94-16"
+, institution = "BRICS"
+, address =     "Aarhus Univ., Denmark"
+, year =        1994
+, update =      "95.01 devillers"
 }
 
 @inproceedings{a-btnto-95
-, author =	"L. Arge"
-, title =	"The {Buffer} {Tree}: A New Technique for Optimal {I/O}-Algorithms"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, number =	955
-, year =	1995
-, pages =	"334--345"
-, keywords =	"external memory algorithms, data structures"
-, update =	"99.07 bibrelex, 96.09 kreveld"
+, author =      "L. Arge"
+, title =       "The {Buffer} {Tree}: A New Technique for Optimal {I/O}-Algorithms"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, number =      955
+, year =        1995
+, pages =       "334--345"
+, keywords =    "external memory algorithms, data structures"
+, update =      "99.07 bibrelex, 96.09 kreveld"
 }
 
 @inproceedings{aprsv-tpiea-98
-, author =	"Lars Arge and Octavian Procopiuc and Sridhar Ramaswamy and Torsten Suel and Jeffrey Scott Vitter"
-, title =	"Theory and Practice of {I/O}-Efficient Algorithms for Multidimensional Batched Searching Problems"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"685--694"
-, update =	"99.07 bibrelex, 98.07 mitchell, 98.03 agarwal"
+, author =      "Lars Arge and Octavian Procopiuc and Sridhar Ramaswamy and Torsten Suel and Jeffrey Scott Vitter"
+, title =       "Theory and Practice of {I/O}-Efficient Algorithms for Multidimensional Batched Searching Problems"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "685--694"
+, update =      "99.07 bibrelex, 98.07 mitchell, 98.03 agarwal"
 }
 
 @inproceedings{av-ioedp-00
-, author =	"Lars Arge and Jan Vahrenhold"
-, title =	"{I/O}-Efficient Dynamic Planar Point Location"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"191--200"
-, update =	"00.11 jones"
+, author =      "Lars Arge and Jan Vahrenhold"
+, title =       "{I/O}-Efficient Dynamic Planar Point Location"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "191--200"
+, update =      "00.11 jones"
 }
 
 @inproceedings{avv-emapl-96
-, author =	"Lars Arge and Darren Erik Vengroff and Jeffrey Scott Vitter"
-, title =	"External-Memory Algorithms for Processing Line Segments in Georgraphic Information Systems"
-, booktitle =	"Algorithmica"
-, year =	"to appear"
-, note =	"special issue on cartography and geographic
-		  information systems. A shortened version appears in Proceedings of the
-		  3rd Annual European Symposium on Algorithms
-		  (ESA~'95), September~1995, published in Lecture
-		  Notes in Computer Science, Springer-Verlag, Berlin, 295--310"
-, update =	"97.03 murali"
+, author =      "Lars Arge and Darren Erik Vengroff and Jeffrey Scott Vitter"
+, title =       "External-Memory Algorithms for Processing Line Segments in Georgraphic Information Systems"
+, booktitle =   "Algorithmica"
+, year =        "to appear"
+, note =        "special issue on cartography and geographic
+                  information systems. A shortened version appears in Proceedings of the
+                  3rd Annual European Symposium on Algorithms
+                  (ESA~'95), September~1995, published in Lecture
+                  Notes in Computer Science, Springer-Verlag, Berlin, 295--310"
+, update =      "97.03 murali"
 }
 
 @inproceedings{av-oimem-96
-, author =	"L. Arge and J. S. Vitter"
-, title =	"Optimal Interval Management in External Memory"
-, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
-, site =	"Burlington, VT"
-, month =	oct
-, year =	1996
-, pages =	"560--569"
-, update =	"97.07 agarwal, 97.03 murali"
+, author =      "L. Arge and J. S. Vitter"
+, title =       "Optimal Interval Management in External Memory"
+, booktitle =   "Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
+, site =        "Burlington, VT"
+, month =       oct
+, year =        1996
+, pages =       "560--569"
+, update =      "97.07 agarwal, 97.03 murali"
 }
 
 @inproceedings{amz-sbme-94
-, author =	"S. Arikati and A. Maheshwari and C. Zaroliagis"
-, title =	"Saving Bits Made Easy"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"140--146"
-, cites =	"e-mpmis-65, fhkr-owpas-92, if-umtor-81, ir-mtard-84, knr-irg-88, ly-grp-82, nsv-rpamu-92, o-agta-87, n-edstf-61, s-epgg-90, l-ga-90, j-ipa-92, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "S. Arikati and A. Maheshwari and C. Zaroliagis"
+, title =       "Saving Bits Made Easy"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "140--146"
+, cites =       "e-mpmis-65, fhkr-owpas-92, if-umtor-81, ir-mtard-84, knr-irg-88, ly-grp-82, nsv-rpamu-92, o-agta-87, n-edstf-61, s-epgg-90, l-ga-90, j-ipa-92, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{accdsz-psasp-96
-, author =	"Srinivasa Rao Arikati and Danny Z. Chen and L. Paul Chew and Gautam Das and Michiel Smid and Christos D. Zaroliagis"
-, title =	"Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane"
-, editor =	"Josep D{\'\i}az and Maria Serna"
-, booktitle =	"Algorithms---ESA~'96, Fourth Annual European Symposium"
-, site =	"Barcelona, Spain"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1136
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"514--528"
-, issn =	"3-540-61680-2"
-, keywords =	"two-point shortest path queries, fixed orientations, geodesics"
-, update =	"00.03 smid, 99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 97.03 smid"
+, author =      "Srinivasa Rao Arikati and Danny Z. Chen and L. Paul Chew and Gautam Das and Michiel Smid and Christos D. Zaroliagis"
+, title =       "Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane"
+, editor =      "Josep D{\'\i}az and Maria Serna"
+, booktitle =   "Algorithms---ESA~'96, Fourth Annual European Symposium"
+, site =        "Barcelona, Spain"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1136
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "514--528"
+, issn =        "3-540-61680-2"
+, keywords =    "two-point shortest path queries, fixed orientations, geodesics"
+, update =      "00.03 smid, 99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 97.03 smid"
 }
 
 @techreport{am-accgp-90
-, author =	"E. Arkin and J. Mitchell"
-, title =	"Applications of combinatorics and computational geometry to pattern recognition"
-, type =	"Technical {Report}"
-, institution =	"Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1990
-, update =	"98.03 bibrelex"
+, author =      "E. Arkin and J. Mitchell"
+, title =       "Applications of combinatorics and computational geometry to pattern recognition"
+, type =        "Technical {Report}"
+, institution = "Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1990
+, update =      "98.03 bibrelex"
 }
 
 @techreport{a-bih-88
-, author =	"Esther M. Arkin"
-, title =	"Beautification is hard"
-, type =	"Technical {Report}"
-, number =	818
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1988
-, keywords =	"clustering"
-, update =	"98.03 mitchell"
+, author =      "Esther M. Arkin"
+, title =       "Beautification is hard"
+, type =        "Technical {Report}"
+, number =      818
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1988
+, keywords =    "clustering"
+, update =      "98.03 mitchell"
 }
 
 @techreport{abmmrss-tsp-93t
-, author =	"Esther M. Arkin and P. Belleville and Joseph S. B. Mitchell and D. M. Mount and K. Romanik and S. Salzberg and D. Souvaine"
-, title =	"Testing simple polygons"
-, number =	"TR-93-14"
-, institution =	"DIMACS"
-, month =	apr
-, year =	1993
-, precedes =	"abmmrss-tsp-93, abmmrss-tsp-97"
-, update =	"98.11 bibrelex"
+, author =      "Esther M. Arkin and P. Belleville and Joseph S. B. Mitchell and D. M. Mount and K. Romanik and S. Salzberg and D. Souvaine"
+, title =       "Testing simple polygons"
+, number =      "TR-93-14"
+, institution = "DIMACS"
+, month =       apr
+, year =        1993
+, precedes =    "abmmrss-tsp-93, abmmrss-tsp-97"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{abmmrss-tsp-93
-, author =	"Esther M. Arkin and P. Belleville and Joseph S. B. Mitchell and D. M. Mount and K. Romanik and S. Salzberg and D. Souvaine"
-, title =	"Testing simple polygons"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"387--392"
-, keywords =	"probing, point probes, testing, simple polygons"
-, succeeds =	"abmmrss-tsp-93t"
-, precedes =	"abmmrss-tsp-97"
-, cites =	"abmmrss-tsp-93t, bs-ppmih-93, cy-sp-87, k-rop-91, lr-eaiou-89t, m-acvpp-90, r-att-92, rs-tgo-90i, rs-tos-92, s-gp-88, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 96.09 romanik, 95.09 agarwal, 95.01 mitchell, 93.09 milone+mitchell"
+, author =      "Esther M. Arkin and P. Belleville and Joseph S. B. Mitchell and D. M. Mount and K. Romanik and S. Salzberg and D. Souvaine"
+, title =       "Testing simple polygons"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "387--392"
+, keywords =    "probing, point probes, testing, simple polygons"
+, succeeds =    "abmmrss-tsp-93t"
+, precedes =    "abmmrss-tsp-97"
+, cites =       "abmmrss-tsp-93t, bs-ppmih-93, cy-sp-87, k-rop-91, lr-eaiou-89t, m-acvpp-90, r-att-92, rs-tgo-90i, rs-tos-92, s-gp-88, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 96.09 romanik, 95.09 agarwal, 95.01 mitchell, 93.09 milone+mitchell"
 }
 
 @article{abmmrss-tsp-97
-, author =	"Esther M. Arkin and P. Belleville and Joseph S. B. Mitchell and D. M. Mount and K. Romanik and S. Salzberg and D. Souvaine"
-, title =	"Testing simple polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"97--114"
-, keywords =	"probing, point probes, testing, simple polygons"
-, succeeds =	"abmmrss-tsp-93t, abmmrss-tsp-93"
-, update =	"98.11 bibrelex"
+, author =      "Esther M. Arkin and P. Belleville and Joseph S. B. Mitchell and D. M. Mount and K. Romanik and S. Salzberg and D. Souvaine"
+, title =       "Testing simple polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "97--114"
+, keywords =    "probing, point probes, testing, simple polygons"
+, succeeds =    "abmmrss-tsp-93t, abmmrss-tsp-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{abfms-ftphwusr-01
-, author =	"E. M. Arkin and M. A. Bender and S. P. Fekete and J. S. B. Mitchell and M. Skutella"
-, title =	"The Freeze-Tag Problem: How to Wake Up a Swarm of Robots"
-, booktitle =	"Proc. 13th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	2002
-, note =	"To appear"
-, update =	"02.03 orourke"
+, author =      "E. M. Arkin and M. A. Bender and S. P. Fekete and J. S. B. Mitchell and M. Skutella"
+, title =       "The Freeze-Tag Problem: How to Wake Up a Swarm of Robots"
+, booktitle =   "Proc. 13th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        2002
+, note =        "To appear"
+, update =      "02.03 orourke"
 }
 
 @techreport{achkm-ecmcp-89
-, author =	"E. M. Arkin and L. P. Chew and D. P. Huttenlocher and K. Kedem and J. S. B. Mitchell"
-, title =	"An efficiently computable metric for comparing polygonal shapes"
-, type =	"Technical {Report}"
-, number =	"TR 89-1007"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	may
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "E. M. Arkin and L. P. Chew and D. P. Huttenlocher and K. Kedem and J. S. B. Mitchell"
+, title =       "An efficiently computable metric for comparing polygonal shapes"
+, type =        "Technical {Report}"
+, number =      "TR 89-1007"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       may
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{achkm-ecmcp-90
-, author =	"Esther M. Arkin and L. P. Chew and D. P. Huttenlocher and K. Kedem and Joseph S. B. Mitchell"
-, title =	"An efficiently computable metric for comparing polygonal shapes"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"129--137"
-, keywords =	"matching, shape, polygons"
-, update =	"98.03 mitchell"
+, author =      "Esther M. Arkin and L. P. Chew and D. P. Huttenlocher and K. Kedem and Joseph S. B. Mitchell"
+, title =       "An efficiently computable metric for comparing polygonal shapes"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "129--137"
+, keywords =    "matching, shape, polygons"
+, update =      "98.03 mitchell"
 }
 
 @article{achkm-ecmcp-91
-, author =	"Esther M. Arkin and L. P. Chew and D. P. Huttenlocher and K. Kedem and Joseph S. B. Mitchell"
-, title =	"An efficiently computable metric for comparing polygonal shapes"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	13
-, number =	3
-, year =	1991
-, pages =	"209--216"
-, keywords =	"polygon, distance, shape, similarity"
-, update =	"98.03 mitchell, 95.05 korneenko"
+, author =      "Esther M. Arkin and L. P. Chew and D. P. Huttenlocher and K. Kedem and Joseph S. B. Mitchell"
+, title =       "An efficiently computable metric for comparing polygonal shapes"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      13
+, number =      3
+, year =        1991
+, pages =       "209--216"
+, keywords =    "polygon, distance, shape, similarity"
+, update =      "98.03 mitchell, 95.05 korneenko"
 }
 
 @inproceedings{achmssy-omah-96
-, author =	"Esther M. Arkin and Y.-J. Chiang and Martin Held and Joseph S. B. Mitchell and V. Sacristan and Steven S. Skiena and T.-C. Yang"
-, title =	"On minimum-area hulls"
-, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1136
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"334--348"
-, precedes =	"achmssy-omah-98"
-, update =	"98.03 mitchell"
+, author =      "Esther M. Arkin and Y.-J. Chiang and Martin Held and Joseph S. B. Mitchell and V. Sacristan and Steven S. Skiena and T.-C. Yang"
+, title =       "On minimum-area hulls"
+, booktitle =   "Proc. 4th Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1136
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "334--348"
+, precedes =    "achmssy-omah-98"
+, update =      "98.03 mitchell"
 }
 
 @article{achmssy-omah-98
-, author =	"Esther M. Arkin and Y.-J. Chiang and Martin Held and Joseph S. B. Mitchell and V. Sacristan and Steven S. Skiena and T.-C. Yang"
-, title =	"On minimum-area hulls"
-, journal =	"Algorithmica"
-, volume =	21
-, year =	1998
-, pages =	"119--136"
-, succeeds =	"achmssy-omah-96"
-, update =	"01.07 devillers, 98.03 mitchell"
+, author =      "Esther M. Arkin and Y.-J. Chiang and Martin Held and Joseph S. B. Mitchell and V. Sacristan and Steven S. Skiena and T.-C. Yang"
+, title =       "On minimum-area hulls"
+, journal =     "Algorithmica"
+, volume =      21
+, year =        1998
+, pages =       "119--136"
+, succeeds =    "achmssy-omah-96"
+, update =      "01.07 devillers, 98.03 mitchell"
 }
 
 @inproceedings{acmsy-mst-97
-, author =	"Esther M. Arkin and Y.-J. Chiang and Joseph S. B. Mitchell and Steven S. Skiena and T. Yang"
-, title =	"On the Maximum Scatter {TSP}"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '97"
-, year =	1997
-, pages =	"211--220"
-, keywords =	"TSP, MAX TSP, bottleneck TSP, approximation algorithms"
-, update =	"98.03 mitchell"
+, author =      "Esther M. Arkin and Y.-J. Chiang and Joseph S. B. Mitchell and Steven S. Skiena and T. Yang"
+, title =       "On the Maximum Scatter {TSP}"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '97"
+, year =        1997
+, pages =       "211--220"
+, keywords =    "TSP, MAX TSP, bottleneck TSP, approximation algorithms"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{acm-mpoap-89
-, author =	"Esther M. Arkin and R. Connelly and Joseph S. B. Mitchell"
-, title =	"On monotone paths among obstacles, with applications to planning assemblies"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"334--343"
-, keywords =	"path planning, monotonicity, assembly, visibility, separability"
-, cites =	"cr-nlbtr-87, gm-osacv-87t, gh-ospqs-87, gy-tsr-80, ps-tspm-81, t-mss-85, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Esther M. Arkin and R. Connelly and Joseph S. B. Mitchell"
+, title =       "On monotone paths among obstacles, with applications to planning assemblies"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "334--343"
+, keywords =    "path planning, monotonicity, assembly, visibility, separability"
+, cites =       "cr-nlbtr-87, gm-osacv-87t, gh-ospqs-87, gy-tsr-80, ps-tspm-81, t-mss-85, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @techreport{afm-aalmm-97
-, author =	"Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
-, title =	"Approximation Algorithms for Lawn Mowing and Milling"
-, institution =	"Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
-, year =	1997
-, url =	"ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr97-255.ps.gz"
-, keywords =	"NC machining, covering, TSP, TSP with neighborhoods, approximation algorithms, NP-completeness, traveling salesman problem, shortest paths, watchman routes, lawn mowing, milling, NC machines; 68Q25, 68U05, 90C27, 90C28, 90C35"
-, succeeds =	"afm-lp-93,afm-aalm-95"
-, update =	"01.04 smid, 98.03 mitchell"
-, abstract =	"We study the problem of finding shortest tours/paths for ``lawn
+, author =      "Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
+, title =       "Approximation Algorithms for Lawn Mowing and Milling"
+, institution = "Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
+, year =        1997
+, url = "ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr97-255.ps.gz"
+, keywords =    "NC machining, covering, TSP, TSP with neighborhoods, approximation algorithms, NP-completeness, traveling salesman problem, shortest paths, watchman routes, lawn mowing, milling, NC machines; 68Q25, 68U05, 90C27, 90C28, 90C35"
+, succeeds =    "afm-lp-93,afm-aalm-95"
+, update =      "01.04 smid, 98.03 mitchell"
+, abstract =    "We study the problem of finding shortest tours/paths for ``lawn
 mowing'' and ``milling'' problems: Given a region in the plane, and
 given the shape of a ``cutter'' (typically, a circle or a square), find
 a shortest tour/path for the cutter such that every point within the
@@ -8452,663 +8452,663 @@ @techreport{afm-aalmm-97
 }
 
 @article{afm-aalmm-00
-, author =	"E. M. Arkin and S. P. Fekete and J. S. B. Mitchell"
-, title =	"Approximation algorithms for lawn mowing and milling"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	17
-, year =	2000
-, pages =	"25--50"
-, update =	"01.04 smid"
+, author =      "E. M. Arkin and S. P. Fekete and J. S. B. Mitchell"
+, title =       "Approximation algorithms for lawn mowing and milling"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      17
+, year =        2000
+, pages =       "25--50"
+, update =      "01.04 smid"
 }
 
 @techreport{afm-aalm-95
-, author =	"Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
-, title =	"Approximation algorithms for lawnmowing and milling"
-, type =	"Report"
-, institution =	"University at Stony Brook"
-, year =	1995
-, keywords =	"NC machining, covering, TSP, TSP with neighborhoods"
-, succeeds =	"afm-lp-93"
-, precedes =	"afm-aalmm-97"
-, update =	"98.03 mitchell, 97.11 bibrelex, 96.01 mitchell"
+, author =      "Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
+, title =       "Approximation algorithms for lawnmowing and milling"
+, type =        "Report"
+, institution = "University at Stony Brook"
+, year =        1995
+, keywords =    "NC machining, covering, TSP, TSP with neighborhoods"
+, succeeds =    "afm-lp-93"
+, precedes =    "afm-aalmm-97"
+, update =      "98.03 mitchell, 97.11 bibrelex, 96.01 mitchell"
 }
 
 @inproceedings{afm-lp-93
-, author =	"Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
-, title =	"The lawnmower problem"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"461--466"
-, precedes =	"afm-aalm-95,afm-aalmm-97"
-, cites =	"ah-aagcs-91, c-tsplt-91a, e-hpnrg-86, f-gtsp-92, f-ldead-72, h-cgpm-91, ips-hpgg-82, jp-cctsp-85, n-wrlv-92, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 96.01 mitchell"
+, author =      "Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
+, title =       "The lawnmower problem"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "461--466"
+, precedes =    "afm-aalm-95,afm-aalmm-97"
+, cites =       "ah-aagcs-91, c-tsplt-91a, e-hpnrg-86, f-gtsp-92, f-ldead-72, h-cgpm-91, ips-hpgg-82, jp-cctsp-85, n-wrlv-92, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 96.01 mitchell"
 }
 
 @inproceedings{afms-mpsms-01
-, author =	"Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell and Steven S. Skiena"
-, title =	"On the Manufacturability of Paperclips and Sheet Metal Structures"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"187--190"
-, update =	"01.04 icking"
+, author =      "Esther M. Arkin and S{\'a}ndor P. Fekete and Joseph S. B. Mitchell and Steven S. Skiena"
+, title =       "On the Manufacturability of Paperclips and Sheet Metal Structures"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "187--190"
+, update =      "01.04 icking"
 }
 
 @inproceedings{agmmps-ppdtg-93
-, author =	"Esther M. Arkin and Michael T. Goodrich and Joseph S. B. Mitchell and David Mount and Christine D. Piatko and Steven S. Skiena"
-, title =	"Point Probe Decision Trees for Geometric Concept Classes"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"95--106"
-, update =	"94.09 piatko, 93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "Esther M. Arkin and Michael T. Goodrich and Joseph S. B. Mitchell and David Mount and Christine D. Piatko and Steven S. Skiena"
+, title =       "Point Probe Decision Trees for Geometric Concept Classes"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "95--106"
+, update =      "94.09 piatko, 93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @inproceedings{ahkmn-astse-91
-, author =	"Esther M. Arkin and D. Halperin and K. Kedem and Joseph S. B. Mitchell and N. Naor"
-, title =	"Arrangements of segments that share endpoints: {Single} face results"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"324--333"
-, keywords =	"arrangements, segments, Davenport-Schinzel sequences, zone theorems"
-, comments =	"The proof of the Exposure Lemma, which results in bound of $O(h\alpha(h))$ on the
-		 single cell complexity, is in error.  A corrected proof is given in
-		 \cite{ahkmn-astse-94}, where the upper bound of $O(h \log h)$ is proved.
-		 There remains a gap between this and the lower bound of $\Omega(h\alpha(h))$."
-, precedes =	"ahkmn-astse-94"
-, cites =	"abp-oabcu-90, cegss-cfals-91, egs-ccmfa-90, gss-gmppt-89, l-cpe-79, m-csfal-90, mrw-mlpop-90, pss-stsps-88, ws-prnds-88, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 96.05 efrat, 95.01 mitchell, 95.01 mitchell"
+, author =      "Esther M. Arkin and D. Halperin and K. Kedem and Joseph S. B. Mitchell and N. Naor"
+, title =       "Arrangements of segments that share endpoints: {Single} face results"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "324--333"
+, keywords =    "arrangements, segments, Davenport-Schinzel sequences, zone theorems"
+, comments =    "The proof of the Exposure Lemma, which results in bound of $O(h\alpha(h))$ on the
+                 single cell complexity, is in error.  A corrected proof is given in
+                 \cite{ahkmn-astse-94}, where the upper bound of $O(h \log h)$ is proved.
+                 There remains a gap between this and the lower bound of $\Omega(h\alpha(h))$."
+, precedes =    "ahkmn-astse-94"
+, cites =       "abp-oabcu-90, cegss-cfals-91, egs-ccmfa-90, gss-gmppt-89, l-cpe-79, m-csfal-90, mrw-mlpop-90, pss-stsps-88, ws-prnds-88, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 96.05 efrat, 95.01 mitchell, 95.01 mitchell"
 }
 
 @techreport{ahkmn-astse-94
-, author =	"Esther M. Arkin and D. Halperin and K. Kedem and Joseph S. B. Mitchell and N. Naor"
-, title =	"Arrangements of segments that share endpoints: {Single} face results"
-, institution =	"SUNY Stony Brook"
-, year =	1994
-, keywords =	"arrangements, segments, Davenport-Schinzel sequences, zone theorems"
-, succeeds =	"ahkmn-astse-91"
-, update =	"98.03 mitchell, 95.01 mitchell, 95.01 mitchell"
+, author =      "Esther M. Arkin and D. Halperin and K. Kedem and Joseph S. B. Mitchell and N. Naor"
+, title =       "Arrangements of segments that share endpoints: {Single} face results"
+, institution = "SUNY Stony Brook"
+, year =        1994
+, keywords =    "arrangements, segments, Davenport-Schinzel sequences, zone theorems"
+, succeeds =    "ahkmn-astse-91"
+, update =      "98.03 mitchell, 95.01 mitchell, 95.01 mitchell"
 }
 
 @article{ahkmn-astse-95
-, author =	"Esther M. Arkin and D. Halperin and K. Kedem and Joseph S. B. Mitchell and N. Naor"
-, title =	"Arrangements of segments that share endpoints: {Single} face results"
-, journal =	"Discrete Comput. Geom."
-, volume =	13
-, year =	1995
-, pages =	"257--270"
-, succeeds =	"ahkmn-astse-94"
-, update =	"98.03 mitchell, 95.09 agarwal"
+, author =      "Esther M. Arkin and D. Halperin and K. Kedem and Joseph S. B. Mitchell and N. Naor"
+, title =       "Arrangements of segments that share endpoints: {Single} face results"
+, journal =     "Discrete Comput. Geom."
+, volume =      13
+, year =        1995
+, pages =       "257--270"
+, succeeds =    "ahkmn-astse-94"
+, update =      "98.03 mitchell, 95.09 agarwal"
 }
 
 @techreport{ah-aagcs-91
-, author =	"Esther M. Arkin and R. Hassin"
-, title =	"Approximation Algorithms for the Geometric Covering Salesman Problem"
-, type =	"Technical Report"
-, number =	968
-, institution =	"School of Operations Research and Industrial Engineering, Cornell University"
-, month =	jul
-, year =	1991
-, precedes =	"ah-aagcs-94"
-, update =	"98.11 bibrelex"
+, author =      "Esther M. Arkin and R. Hassin"
+, title =       "Approximation Algorithms for the Geometric Covering Salesman Problem"
+, type =        "Technical Report"
+, number =      968
+, institution = "School of Operations Research and Industrial Engineering, Cornell University"
+, month =       jul
+, year =        1991
+, precedes =    "ah-aagcs-94"
+, update =      "98.11 bibrelex"
 }
 
 @article{ah-aagcs-94
-, author =	"Esther M. Arkin and R. Hassin"
-, title =	"Approximation Algorithms for the Geometric Covering Salesman Problem"
-, journal =	"Discrete Appl. Math."
-, volume =	55
-, year =	1994
-, pages =	"197--218"
-, succeeds =	"ah-aagcs-91"
-, update =	"98.11 bibrelex, 98.03 mitchell, 96.09 devillers, 95.09 mitchell"
+, author =      "Esther M. Arkin and R. Hassin"
+, title =       "Approximation Algorithms for the Geometric Covering Salesman Problem"
+, journal =     "Discrete Appl. Math."
+, volume =      55
+, year =        1994
+, pages =       "197--218"
+, succeeds =    "ah-aagcs-91"
+, update =      "98.11 bibrelex, 98.03 mitchell, 96.09 devillers, 95.09 mitchell"
 }
 
 @unpublished{ahk-rdpn-94
-, author =	"Esther M. Arkin and R. Hassin and L. Klein"
-, title =	"Restricted Delivery Problems on a Network"
-, year =	1994
-, note =	"Manuscript"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, author =      "Esther M. Arkin and R. Hassin and L. Klein"
+, title =       "Restricted Delivery Problems on a Network"
+, year =        1994
+, note =        "Manuscript"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @inproceedings{ahm-madcg-95
-, author =	"Esther M. Arkin and Martin Held and Joseph S. B. Mitchell"
-, title =	"Manufacturing: {A}n application domain for computational geometry"
-, booktitle =	"First Regional Symposium on Manufacturing Science and Technology"
-, site =	"Stony Brook, NY"
-, month =	oct
-, year =	1995
-, pages =	"29--36"
-, update =	"00.11 smid, 00.07 icking, 98.03 mitchell, 96.01 mitchell"
+, author =      "Esther M. Arkin and Martin Held and Joseph S. B. Mitchell"
+, title =       "Manufacturing: {A}n application domain for computational geometry"
+, booktitle =   "First Regional Symposium on Manufacturing Science and Technology"
+, site =        "Stony Brook, NY"
+, month =       oct
+, year =        1995
+, pages =       "29--36"
+, update =      "00.11 smid, 00.07 icking, 98.03 mitchell, 96.01 mitchell"
 }
 
 @inproceedings{ahms-htfr-94
-, author =	"Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
-, title =	"Hamiltonian Triangulations for Fast Rendering"
-, editor =	"J. van Leeuwen"
-, booktitle =	"Algorithms -- ESA'94"
-, site =	"Utrecht, NL"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, month =	sep
-, year =	1994
-, pages =	"36--47"
-, keywords =	"triangulation, tri-strips, mesh generation, rendering, sequential triangulation, ribbons"
-, update =	"98.03 mitchell, 96.05 agarwal, 95.01 held"
+, author =      "Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
+, title =       "Hamiltonian Triangulations for Fast Rendering"
+, editor =      "J. van Leeuwen"
+, booktitle =   "Algorithms -- ESA'94"
+, site =        "Utrecht, NL"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, month =       sep
+, year =        1994
+, pages =       "36--47"
+, keywords =    "triangulation, tri-strips, mesh generation, rendering, sequential triangulation, ribbons"
+, update =      "98.03 mitchell, 96.05 agarwal, 95.01 held"
 }
 
 @article{ahms-htfr-96
-, author =	"Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
-, title =	"Hamiltonian Triangulations for Fast Rendering"
-, journal =	"Visual Comput."
-, volume =	12
-, number =	9
-, year =	1996
-, pages =	"429--444"
-, keywords =	"triangulation, tri-strips, mesh generation, rendering, sequential triangulation, ribbons"
-, succeeds =	"ahms-htfr-94"
-, update =	"98.03 mitchell, 97.11 held"
+, author =      "Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
+, title =       "Hamiltonian Triangulations for Fast Rendering"
+, journal =     "Visual Comput."
+, volume =      12
+, number =      9
+, year =        1996
+, pages =       "429--444"
+, keywords =    "triangulation, tri-strips, mesh generation, rendering, sequential triangulation, ribbons"
+, succeeds =    "ahms-htfr-94"
+, update =      "98.03 mitchell, 97.11 held"
 }
 
 @inproceedings{ahms-rppwm-95
-, author =	"Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
-, title =	"Recognizing Polygonal Parts from Width Measurements"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"199--204"
-, precedes =	"ahms-rppwm-98"
-, update =	"98.03 mitchell, 95.09 jones"
+, author =      "Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
+, title =       "Recognizing Polygonal Parts from Width Measurements"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "199--204"
+, precedes =    "ahms-rppwm-98"
+, update =      "98.03 mitchell, 95.09 jones"
 }
 
 @article{ahms-rppwm-98
-, author =	"Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
-, title =	"Recognizing Polygonal Parts from Width Measurements"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, number =	4
-, year =	1998
-, pages =	"237--246"
-, succeeds =	"ahms-rppwm-95"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Esther M. Arkin and Martin Held and Joseph S. B. Mitchell and Steven S. Skiena"
+, title =       "Recognizing Polygonal Parts from Width Measurements"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, number =      4
+, year =        1998
+, pages =       "237--246"
+, succeeds =    "ahms-rppwm-95"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @techreport{ahs-oprzp-95
-, author =	"Esther M. Arkin and Martin Held and C. L. Smith"
-, title =	"Optimization problems related to zigzag pocket machining"
-, type =	"Manuscript"
-, institution =	"Department of Applied Mathematics, SUNY Stony Brook, NY"
-, year =	1995
-, update =	"98.03 mitchell, 95.09 mitchell"
+, author =      "Esther M. Arkin and Martin Held and C. L. Smith"
+, title =       "Optimization problems related to zigzag pocket machining"
+, type =        "Manuscript"
+, institution = "Department of Applied Mathematics, SUNY Stony Brook, NY"
+, year =        1995
+, update =      "98.03 mitchell, 95.09 mitchell"
 }
 
 @inproceedings{ahs-oprzp-96
-, author =	"Esther M. Arkin and Martin Held and Christopher L. Smith"
-, title =	"Optimization problems related to zigzag pocket machining"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"419--428"
-, keywords =	"CAD, NC-machining, milling, lawnmower problem, retractions, approximation, NP-hardness"
-, update =	"96.09 agarwal, 96.01 mitchell"
+, author =      "Esther M. Arkin and Martin Held and Christopher L. Smith"
+, title =       "Optimization problems related to zigzag pocket machining"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "419--428"
+, keywords =    "CAD, NC-machining, milling, lawnmower problem, retractions, approximation, NP-hardness"
+, update =      "96.09 agarwal, 96.01 mitchell"
 }
 
 @inproceedings{ahs-oprzp-96c
-, author =	"Esther M. Arkin and Martin Held and Christopher L. Smith"
-, title =	"Optimization Problems Related to Zigzag Pocket Machining"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"109--111"
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Esther M. Arkin and Martin Held and Christopher L. Smith"
+, title =       "Optimization Problems Related to Zigzag Pocket Machining"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "109--111"
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{ahs-oprzp-00
-, author =	"E. M. Arkin and M. Held and C. L. Smith"
-, title =	"Optimization Problems Related to Zigzag Pocket Machining"
-, journal =	"Algorithmica"
-, volume =	26
-, number =	2
-, year =	2000
-, pages =	"197--236"
-, update =	"00.03 held"
+, author =      "E. M. Arkin and M. Held and C. L. Smith"
+, title =       "Optimization Problems Related to Zigzag Pocket Machining"
+, journal =     "Algorithmica"
+, volume =      26
+, number =      2
+, year =        2000
+, pages =       "197--236"
+, update =      "00.03 held"
 }
 
 @inproceedings{ahmss-00
-, author =	"E. M. Arkin and F. Hurtado and J. S. B. Mitchell and C. Seara and S. S. Skiena"
-, title =	"Some Separability Problems in the Plane"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"51--54"
-, update =	"00.03 bibrelex"
+, author =      "E. M. Arkin and F. Hurtado and J. S. B. Mitchell and C. Seara and S. S. Skiena"
+, title =       "Some Separability Problems in the Plane"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "51--54"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{akmsw-mpnrc-91
-, author =	"Esther M. Arkin and K. Kedem and Joseph S. B. Mitchell and J. Sprinzak and M. Werman"
-, title =	"Matching points into noise regions: combinatorial bounds and algorithms"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"42--51"
-, keywords =	"matching, similarity"
-, precedes =	"akmsw-mppdn-92"
-, update =	"98.03 mitchell"
+, author =      "Esther M. Arkin and K. Kedem and Joseph S. B. Mitchell and J. Sprinzak and M. Werman"
+, title =       "Matching points into noise regions: combinatorial bounds and algorithms"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "42--51"
+, keywords =    "matching, similarity"
+, precedes =    "akmsw-mppdn-92"
+, update =      "98.03 mitchell"
 }
 
 @article{akmsw-mppdn-92
-, author =	"Esther M. Arkin and K. Kedem and Joseph S. B. Mitchell and J. Sprinzak and M. Werman"
-, title =	"Matching points into pairwise-disjoint noise regions: combinatorial bounds and algorithms"
-, journal =	"ORSA J. Comput."
-, volume =	4
-, number =	4
-, year =	1992
-, pages =	"375--386"
-, keywords =	"matching, similarity"
-, succeeds =	"akmsw-mpnrc-91"
-, update =	"98.03 mitchell"
-, annote =	"Special issue on computational geometry; J. Mitchell and
+, author =      "Esther M. Arkin and K. Kedem and Joseph S. B. Mitchell and J. Sprinzak and M. Werman"
+, title =       "Matching points into pairwise-disjoint noise regions: combinatorial bounds and algorithms"
+, journal =     "ORSA J. Comput."
+, volume =      4
+, number =      4
+, year =        1992
+, pages =       "375--386"
+, keywords =    "matching, similarity"
+, succeeds =    "akmsw-mpnrc-91"
+, update =      "98.03 mitchell"
+, annote =      "Special issue on computational geometry; J. Mitchell and
                   J. Karel Lenstra, eds."
 }
 
 @inproceedings{akm-gkp-91
-, author =	"Esther M. Arkin and S. Khuller and Joseph S. B. Mitchell"
-, title =	"Geometric knapsack problems"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"165--176"
-, precedes =	"akm-gkp-93"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, author =      "Esther M. Arkin and S. Khuller and Joseph S. B. Mitchell"
+, title =       "Geometric knapsack problems"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "165--176"
+, precedes =    "akm-gkp-93"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @article{akm-gkp-93
-, author =	"Esther M. Arkin and S. Khuller and Joseph S. B. Mitchell"
-, title =	"Geometric knapsack problems"
-, journal =	"Algorithmica"
-, volume =	10
-, year =	1993
-, pages =	"399--427"
-, succeeds =	"akm-gkp-91"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, author =      "Esther M. Arkin and S. Khuller and Joseph S. B. Mitchell"
+, title =       "Geometric knapsack problems"
+, journal =     "Algorithmica"
+, volume =      10
+, year =        1993
+, pages =       "399--427"
+, succeeds =    "akm-gkp-91"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @inproceedings{akm-oep-89
-, author =	"Esther M. Arkin and S. Khuller and Joseph S. B. Mitchell"
-, title =	"Optimal enclosure problems"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	36
-, keywords =	"partitioning, enclosure, knapsack, optimization"
-, precedes =	"akm-gkp-93"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, author =      "Esther M. Arkin and S. Khuller and Joseph S. B. Mitchell"
+, title =       "Optimal enclosure problems"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       36
+, keywords =    "partitioning, enclosure, knapsack, optimization"
+, precedes =    "akm-gkp-93"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @inproceedings{ammrs-dtgm-93
-, author =	"Esther M. Arkin and H. Meijer and Joseph S. B. Mitchell and D. Rappaport and S. S. Skiena"
-, title =	"Decision trees for geometric models"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"369--378"
-, precedes =	"ammrs-dtgm-98"
-, cites =	"am-accgp-90, bs-ppmh-91, b-dscns-86, bgg-raor-88, bggm-p2trd-90, ce-oails-92, cd-mbrrv-86, fpp-hdpgg-90, e-acg-87, fs-hfb-89, fpt-opcpa-81, fntv-sltjs-90, g-obip-72, gl-trluo-84, g-agtpg-80, g-clcmb-86, gl-lopsi-87, hmrt-sjslt-86, hr-cobdt-76, j-aacp-74, js-mbpsc-92, l-pftu-82, lr-eaiou-94, m-dtd-82, p-cpav-91, s-irgp-92, ZZZ"
-, update =	"98.11 devillers, 98.07 devillers, 98.03 bibrelex+mitchell, 93.09 jones"
+, author =      "Esther M. Arkin and H. Meijer and Joseph S. B. Mitchell and D. Rappaport and S. S. Skiena"
+, title =       "Decision trees for geometric models"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "369--378"
+, precedes =    "ammrs-dtgm-98"
+, cites =       "am-accgp-90, bs-ppmh-91, b-dscns-86, bgg-raor-88, bggm-p2trd-90, ce-oails-92, cd-mbrrv-86, fpp-hdpgg-90, e-acg-87, fs-hfb-89, fpt-opcpa-81, fntv-sltjs-90, g-obip-72, gl-trluo-84, g-agtpg-80, g-clcmb-86, gl-lopsi-87, hmrt-sjslt-86, hr-cobdt-76, j-aacp-74, js-mbpsc-92, l-pftu-82, lr-eaiou-94, m-dtd-82, p-cpav-91, s-irgp-92, ZZZ"
+, update =      "98.11 devillers, 98.07 devillers, 98.03 bibrelex+mitchell, 93.09 jones"
 }
 
 @article{ammrs-dtgm-98
-, author =	"Esther M. Arkin and H. Meijer and Joseph S. B. Mitchell and D. Rappaport and S. S. Skiena"
-, title =	"Decision trees for geometric models"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"343--364"
-, succeeds =	"ammrs-dtgm-93"
-, update =	"98.11 devillers"
+, author =      "Esther M. Arkin and H. Meijer and Joseph S. B. Mitchell and D. Rappaport and S. S. Skiena"
+, title =       "Decision trees for geometric models"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "343--364"
+, succeeds =    "ammrs-dtgm-93"
+, update =      "98.11 devillers"
 }
 
 @techreport{am-ovasp-87
-, author =	"Esther M. Arkin and Joseph S. B. Mitchell"
-, title =	"An optimal visibility algorithm for a simple polygon with star-shaped holes"
-, type =	"Technical {Report}"
-, number =	746
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1987
-, keywords =	"visibility, hidden line/surface elimination, plane-sweep"
-, update =	"98.03 mitchell"
+, author =      "Esther M. Arkin and Joseph S. B. Mitchell"
+, title =       "An optimal visibility algorithm for a simple polygon with star-shaped holes"
+, type =        "Technical {Report}"
+, number =      746
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1987
+, keywords =    "visibility, hidden line/surface elimination, plane-sweep"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{amn-rcgno-98
-, author =	"Esther M. Arkin and Joseph S. B. Mitchell and Giri Narasimhan"
-, title =	"Resource-Constrained Geometric Network Optimization"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"307--316"
-, keywords =	"orienteering, generalized TSP, bank robber problem, approximation algorithms, guillotine subdivisions"
-, update =	"01.11 smid, 98.03 mitchell"
+, author =      "Esther M. Arkin and Joseph S. B. Mitchell and Giri Narasimhan"
+, title =       "Resource-Constrained Geometric Network Optimization"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "307--316"
+, keywords =    "orienteering, generalized TSP, bank robber problem, approximation algorithms, guillotine subdivisions"
+, update =      "01.11 smid, 98.03 mitchell"
 }
 
 @techreport{amp-mlwt-94
-, author =	"Esther M. Arkin and Joseph S. B. Mitchell and C. Piatko"
-, title =	"Minimum-link watchman tours"
-, type =	"Report"
-, institution =	"University at Stony Brook"
-, year =	1994
-, update =	"98.03 mitchell, 96.05 mitchell"
+, author =      "Esther M. Arkin and Joseph S. B. Mitchell and C. Piatko"
+, title =       "Minimum-link watchman tours"
+, type =        "Report"
+, institution = "University at Stony Brook"
+, year =        1994
+, update =      "98.03 mitchell, 96.05 mitchell"
 }
 
 @inproceedings{amp-bsppp-91
-, author =	"Esther M. Arkin and Joseph S. B. Mitchell and C. D. Piatko"
-, title =	"Bicriteria shortest path problems in the plane"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"153--156"
-, succeeds =	"amp-gbpp-90"
-, cites =	"aw-vgoas-88, amp-gbpp-90, cdrx-ckp-88, gj-cigtn-79, gm-osacv-87, h-bpp-80, l-conm-76, m-aaorp-90, mp-wrpfs-91, mrw-mlpop-90, s-ltaml-86, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Esther M. Arkin and Joseph S. B. Mitchell and C. D. Piatko"
+, title =       "Bicriteria shortest path problems in the plane"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "153--156"
+, succeeds =    "amp-gbpp-90"
+, cites =       "aw-vgoas-88, amp-gbpp-90, cdrx-ckp-88, gj-cigtn-79, gm-osacv-87, h-bpp-80, l-conm-76, m-aaorp-90, mp-wrpfs-91, mrw-mlpop-90, s-ltaml-86, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @unpublished{amp-gbpp-90
-, author =	"E. M. Arkin and J. S. B. Mitchell and C. D. Piatko"
-, title =	"Geometric Bicriteria Path Problems"
-, year =	1990
-, note =	"Manuscript in Preparation"
-, precedes =	"amp-bsppp-91"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "E. M. Arkin and J. S. B. Mitchell and C. D. Piatko"
+, title =       "Geometric Bicriteria Path Problems"
+, year =        1990
+, note =        "Manuscript in Preparation"
+, precedes =    "amp-bsppp-91"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{ams-ltlpq-95
-, author =	"Esther M. Arkin and Joseph S. B. Mitchell and Subhash Suri"
-, title =	"Logarithmic-time link path queries in a simple polygon"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, number =	4
-, year =	1995
-, pages =	"369--395"
-, keywords =	"link distance, shortest paths, geodesic paths"
-, succeeds =	"ams-olpqs-92"
-, update =	"98.03 mitchell, 96.01 mitchell"
+, author =      "Esther M. Arkin and Joseph S. B. Mitchell and Subhash Suri"
+, title =       "Logarithmic-time link path queries in a simple polygon"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, number =      4
+, year =        1995
+, pages =       "369--395"
+, keywords =    "link distance, shortest paths, geodesic paths"
+, succeeds =    "ams-olpqs-92"
+, update =      "98.03 mitchell, 96.01 mitchell"
 }
 
 @inproceedings{ams-olpqs-92
-, author =	"Esther M. Arkin and Joseph S. B. Mitchell and Subhash Suri"
-, title =	"Optimal link path queries in a simple polygon"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"269--279"
-, precedes =	"ams-ltlpq-95"
-, update =	"98.03 mitchell, 96.01 mitchell"
+, author =      "Esther M. Arkin and Joseph S. B. Mitchell and Subhash Suri"
+, title =       "Optimal link path queries in a simple polygon"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "269--279"
+, precedes =    "ams-ltlpq-95"
+, update =      "98.03 mitchell, 96.01 mitchell"
 }
 
 @techreport{amz-apmp-89
-, author =	"Esther M. Arkin and Joseph S. B. Mitchell and K. Zikan"
-, title =	"Algorithms for point matching problems"
-, type =	"Manuscript"
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1989
-, keywords =	"matching, computer vision"
-, update =	"98.03 mitchell"
+, author =      "Esther M. Arkin and Joseph S. B. Mitchell and K. Zikan"
+, title =       "Algorithms for point matching problems"
+, type =        "Manuscript"
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1989
+, keywords =    "matching, computer vision"
+, update =      "98.03 mitchell"
 }
 
 @article{am-anme-90
-, author =	"R. Arkin and R. R. Murphy"
-, title =	"Autonomous Navigation in a manufacturing environment"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	6
-, number =	4
-, year =	1990
-, pages =	"445--454"
-, update =	"93.09 milone+mitchell"
+, author =      "R. Arkin and R. R. Murphy"
+, title =       "Autonomous Navigation in a manufacturing environment"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      6
+, number =      4
+, year =        1990
+, pages =       "445--454"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{ate-plcsl-89
-, author =	"D. Armitage and J. I. Thakara and W. D. Eades"
-, title =	"Photoaddressed liquid crystal spatial light modulators"
-, journal =	"Appl. Optics"
-, volume =	28
-, number =	22
-, year =	1989
-, pages =	"4763--4771"
-, update =	"97.11 bibrelex"
+, author =      "D. Armitage and J. I. Thakara and W. D. Eades"
+, title =       "Photoaddressed liquid crystal spatial light modulators"
+, journal =     "Appl. Optics"
+, volume =      28
+, number =      22
+, year =        1989
+, pages =       "4763--4771"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ar-dsa-93
-, author =	"D. Armon and John Reif"
-, title =	"A Dynamic Separator Algorithm"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"107--118"
-, update =	"93.09 milone+mitchell"
+, author =      "D. Armon and John Reif"
+, title =       "A Dynamic Separator Algorithm"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "107--118"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{armldm-mmm-95
-, author =	"C. G. Armstrong and D. J. Robinson and R. M. McKeag and T. S. Li and S. J. Bridgett and R. J. Donaghy and C. A. McGleenan"
-, title =	"Medials for Meshing and More"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"277--289"
-, update =	"96.01 samitchell"
+, author =      "C. G. Armstrong and D. J. Robinson and R. M. McKeag and T. S. Li and S. J. Bridgett and R. J. Donaghy and C. A. McGleenan"
+, title =       "Medials for Meshing and More"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "277--289"
+, update =      "96.01 samitchell"
 }
 
 @phdthesis{a-sagni-82
-, author =	"G. T. Armstrong"
-, title =	"A Study of Automatic Generation of Non-Invasive Machine Paths from Geometric Models"
-, school =	"Univ. Leeds"
-, address =	"Leeds, UK"
-, month =	oct
-, year =	1982
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "G. T. Armstrong"
+, title =       "A Study of Automatic Generation of Non-Invasive Machine Paths from Geometric Models"
+, school =      "Univ. Leeds"
+, address =     "Leeds, UK"
+, month =       oct
+, year =        1982
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{acp-ncggm-84
-, author =	"G. T. Armstrong and G. C. Carey and A. de Pennington"
-, title =	"Numerical Code Generation from a Geometric Modeling System"
-, editor =	"M. S. Pickett and J. W. Boyse"
-, booktitle =	"Solid Modeling by Computers: {From} Theory to Applications"
-, publisher =	"Plenum Press"
-, address =	"Ne York, NY"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "G. T. Armstrong and G. C. Carey and A. de Pennington"
+, title =       "Numerical Code Generation from a Geometric Modeling System"
+, editor =      "M. S. Pickett and J. W. Boyse"
+, booktitle =   "Solid Modeling by Computers: {From} Theory to Applications"
+, publisher =   "Plenum Press"
+, address =     "Ne York, NY"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @book{a-bt-79
-, author =	"M. A. Armstrong"
-, title =	"Basic Topology"
-, publisher =	"McGraw-Hill"
-, address =	"London, UK"
-, year =	1979
-, update =	"97.11 bibrelex"
+, author =      "M. A. Armstrong"
+, title =       "Basic Topology"
+, publisher =   "McGraw-Hill"
+, address =     "London, UK"
+, year =        1979
+, update =      "97.11 bibrelex"
 }
 
 @article{acp-cfekt-87
-, author =	"S. Arnborg and D. G. Corneil and A. Proskurowski"
-, title =	"Complexity of finding embeddings in a $k$-tree"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	8
-, year =	1987
-, pages =	"277--284"
-, update =	"97.11 bibrelex"
+, author =      "S. Arnborg and D. G. Corneil and A. Proskurowski"
+, title =       "Complexity of finding embeddings in a $k$-tree"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      8
+, year =        1987
+, pages =       "277--284"
+, update =      "97.11 bibrelex"
 }
 
 @article{af-adrc-88
-, author =	"S. Arnborg and H. Feng"
-, title =	"Algebraic decomposition of regular curves"
-, journal =	"J. Symbolic Comput."
-, volume =	15
-, number =	1
-, year =	1988
-, pages =	"131--140"
-, keywords =	"polygons, algebraic geometry, curvilinear"
-, update =	"95.05 korneenko"
+, author =      "S. Arnborg and H. Feng"
+, title =       "Algebraic decomposition of regular curves"
+, journal =     "J. Symbolic Comput."
+, volume =      15
+, number =      1
+, year =        1988
+, pages =       "131--140"
+, keywords =    "polygons, algebraic geometry, curvilinear"
+, update =      "95.05 korneenko"
 }
 
 @article{ap-crp3t-86
-, author =	"S. Arnborg and A. Proskurowski"
-, title =	"Characterization and recognition of partial $3$-trees"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	7
-, year =	1986
-, pages =	"305--314"
-, update =	"97.11 bibrelex"
+, author =      "S. Arnborg and A. Proskurowski"
+, title =       "Characterization and recognition of partial $3$-trees"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      7
+, year =        1986
+, pages =       "305--314"
+, update =      "97.11 bibrelex"
 }
 
 @article{am-uvtps-84
-, author =	"D. B. Arnold and W. J. Milne"
-, title =	"The use of {Voronoi} tessellations in processing soil survey results"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	4
-, year =	1984
-, pages =	"22--28"
-, keywords =	"application, Voronoi diagrams, subdivision"
+, author =      "D. B. Arnold and W. J. Milne"
+, title =       "The use of {Voronoi} tessellations in processing soil survey results"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      4
+, year =        1984
+, pages =       "22--28"
+, keywords =    "application, Voronoi diagrams, subdivision"
 }
 
 @book{ag-jpl-96
-, author =	"K. Arnold and J. Gosling"
-, title =	"The Java Programming Language"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1996
-, update =	"98.07 tamassia"
+, author =      "K. Arnold and J. Gosling"
+, title =       "The Java Programming Language"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1996
+, update =      "98.07 tamassia"
 }
 
 @article{a-sicp-80
-, author =	"V. I. Arnold"
-, title =	"Statistics of integral convex polytopes"
-, journal =	"Functional Anal. Appl."
-, volume =	14
-, year =	1980
-, pages =	"1--3"
-, update =	"97.11 bibrelex"
+, author =      "V. I. Arnold"
+, title =       "Statistics of integral convex polytopes"
+, journal =     "Functional Anal. Appl."
+, volume =      14
+, year =        1980
+, pages =       "1--3"
+, update =      "97.11 bibrelex"
 }
 
 @article{a-bqera-88
-, author =	"D. Arnon"
-, title =	"A bibliography of quantifier elimination for real algebraic fields"
-, journal =	"J. Symbolic Comput."
-, volume =	5
-, year =	1988
-, pages =	"267--274"
-, keywords =	"algebraic geometry, bibliography"
-, update =	"95.05 korneenko"
+, author =      "D. Arnon"
+, title =       "A bibliography of quantifier elimination for real algebraic fields"
+, journal =     "J. Symbolic Comput."
+, volume =      5
+, year =        1988
+, pages =       "267--274"
+, keywords =    "algebraic geometry, bibliography"
+, update =      "95.05 korneenko"
 }
 
 @article{a-grla-88
-, author =	"D. Arnon"
-, title =	"Geometric reasoning with logic and algebra"
-, journal =	"Artif. Intell."
-, volume =	37
-, number =	1
-, year =	1988
-, pages =	"37--60"
-, keywords =	"algebraic geometry, geometric reasoning"
-, update =	"96.09 devillers, 95.05 korneenko"
+, author =      "D. Arnon"
+, title =       "Geometric reasoning with logic and algebra"
+, journal =     "Artif. Intell."
+, volume =      37
+, number =      1
+, year =        1988
+, pages =       "37--60"
+, keywords =    "algebraic geometry, geometric reasoning"
+, update =      "96.09 devillers, 95.05 korneenko"
 }
 
 @book{ab-arag-88
-, title =	"Algorithms in Real Algebraic Geometry"
-, editor =	"D. S. Arnon and B. Buchberger"
-, volume =	"5/1, 2"
-, publisher =	"??"
-, year =	1988
-, note =	"Special issue of the Journal of Symbolic Computation"
-, update =	"98.03 bibrelex"
+, title =       "Algorithms in Real Algebraic Geometry"
+, editor =      "D. S. Arnon and B. Buchberger"
+, volume =      "5/1, 2"
+, publisher =   "??"
+, year =        1988
+, note =        "Special issue of the Journal of Symbolic Computation"
+, update =      "98.03 bibrelex"
 }
 
 @article{acm-aacad-88
-, author =	"D. S. Arnon and G. E. Collins and S. {McCallum}"
-, title =	"An adjacency algorithm for cylindrical algebraic decomposition in three-dimensional space"
-, journal =	"J. Symbolic Comput."
-, volume =	5
-, number =	"1--2"
-, year =	1988
-, pages =	"163--187"
-, keywords =	"algebraic geometry, motion planning"
-, update =	"95.05 korneenko"
+, author =      "D. S. Arnon and G. E. Collins and S. {McCallum}"
+, title =       "An adjacency algorithm for cylindrical algebraic decomposition in three-dimensional space"
+, journal =     "J. Symbolic Comput."
+, volume =      5
+, number =      "1--2"
+, year =        1988
+, pages =       "163--187"
+, keywords =    "algebraic geometry, motion planning"
+, update =      "95.05 korneenko"
 }
 
 @article{acm-cad1b-84
-, author =	"D. S. Arnon and G. E. Collins and S. {McCallum}"
-, title =	"Cylindrical algebraic decomposition {I}: {The} basic algorithm"
-, journal =	"SIAM J. Comput."
-, volume =	13
-, number =	4
-, year =	1984
-, pages =	"865--877"
-, keywords =	"algebraic geometry, motion planning"
-, update =	"96.05 agarwal, 95.05 korneenko"
+, author =      "D. S. Arnon and G. E. Collins and S. {McCallum}"
+, title =       "Cylindrical algebraic decomposition {I}: {The} basic algorithm"
+, journal =     "SIAM J. Comput."
+, volume =      13
+, number =      4
+, year =        1984
+, pages =       "865--877"
+, keywords =    "algebraic geometry, motion planning"
+, update =      "96.05 agarwal, 95.05 korneenko"
 }
 
 @article{acm-cad2a-84
-, author =	"D. S. Arnon and G. E. Collins and S. {McCallum}"
-, title =	"Cylindrical algebraic decomposition {II}: {The} adjacency algorithm for the plane"
-, journal =	"SIAM J. Comput."
-, volume =	13
-, number =	4
-, year =	1984
-, pages =	"878--889"
-, keywords =	"algebraic geometry, motion planning"
-, update =	"97.03 agarwal, 95.05 korneenko"
+, author =      "D. S. Arnon and G. E. Collins and S. {McCallum}"
+, title =       "Cylindrical algebraic decomposition {II}: {The} adjacency algorithm for the plane"
+, journal =     "SIAM J. Comput."
+, volume =      13
+, number =      4
+, year =        1984
+, pages =       "878--889"
+, keywords =    "algebraic geometry, motion planning"
+, update =      "97.03 agarwal, 95.05 korneenko"
 }
 
 @unpublished{a-lbvdc-98
-, author =	"B. Aronov"
-, title =	"A lower bound on {Voronoi} diagram complexity"
-, year =	1998
-, note =	"unpublished manuscript"
-, update =	"98.03 agarwal"
+, author =      "B. Aronov"
+, title =       "A lower bound on {Voronoi} diagram complexity"
+, year =        1998
+, note =        "unpublished manuscript"
+, update =      "98.03 agarwal"
 }
 
 @phdthesis{a-caasd-89
-, author =	"B. Aronov"
-, title =	"Combinatorial and algorithmic analysis of space decomposition problems"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, month =	feb
-, year =	1989
-, keywords =	"doctoral thesis"
+, author =      "B. Aronov"
+, title =       "Combinatorial and algorithmic analysis of space decomposition problems"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, month =       feb
+, year =        1989
+, keywords =    "doctoral thesis"
 }
 
 @inproceedings{a-gvdps-87
-, author =	"B. Aronov"
-, title =	"On the geodesic {Voronoi} diagram of point sites in a simple polygon"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"39--49"
-, keywords =	"geodesic distance, Voronoi diagram, simple polygon, shortest path"
-, precedes =	"a-gvdps-89"
-, cites =	"a-pdpaa-83, aa-vdpsp-, ae-oacwv-84, sb-spbtc-85, c-tpca-82, cd-vdbcd-85, f-savd-86, ghlst-ltavs-86t, gjpt-tsp-78, gs-dfbt-78, iim-vdlgi-85, k-eccs-79, l-prp-78, l-tdvdl-80, lpsssstwy-clcsp-87, lp-esppr-84, ls-ippvd-87, lw-vdllm-80, osy-rnamp-83, ps-cgcsp-86, ps-cgi-85, sh-cpp-75, s-cldsp-86, s-cgdsp-86, t-oacrc-86, tv-otats-86, y-oavds-84, ZZZ"
-, update =	"98.03 bibrelex, 95.01 aronov"
+, author =      "B. Aronov"
+, title =       "On the geodesic {Voronoi} diagram of point sites in a simple polygon"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "39--49"
+, keywords =    "geodesic distance, Voronoi diagram, simple polygon, shortest path"
+, precedes =    "a-gvdps-89"
+, cites =       "a-pdpaa-83, aa-vdpsp-, ae-oacwv-84, sb-spbtc-85, c-tpca-82, cd-vdbcd-85, f-savd-86, ghlst-ltavs-86t, gjpt-tsp-78, gs-dfbt-78, iim-vdlgi-85, k-eccs-79, l-prp-78, l-tdvdl-80, lpsssstwy-clcsp-87, lp-esppr-84, ls-ippvd-87, lw-vdllm-80, osy-rnamp-83, ps-cgcsp-86, ps-cgi-85, sh-cpp-75, s-cldsp-86, s-cgdsp-86, t-oacrc-86, tv-otats-86, y-oavds-84, ZZZ"
+, update =      "98.03 bibrelex, 95.01 aronov"
 }
 
 @article{a-gvdps-89
-, author =	"Boris Aronov"
-, title =	"On the geodesic {Voronoi} diagram of point sites in a simple polygon"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"109--140"
-, keywords =	"geodesic distance, Voronoi diagram, simple polygon, shortest path"
-, succeeds =	"a-gvdps-87"
-, update =	"96.05 efrat, 95.01 aronov"
-, abstract =	"Given a simple polygon with $n$ sides in the plane
+, author =      "Boris Aronov"
+, title =       "On the geodesic {Voronoi} diagram of point sites in a simple polygon"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "109--140"
+, keywords =    "geodesic distance, Voronoi diagram, simple polygon, shortest path"
+, succeeds =    "a-gvdps-87"
+, update =      "96.05 efrat, 95.01 aronov"
+, abstract =    "Given a simple polygon with $n$ sides in the plane
 and a set of $k$ point ``sites'' in its interior or on the boundary,
 compute the Voronoi diagram of the set of sites using the internal
 ``geodesic'' distance inside the polygon as the metric. We describe an
@@ -9118,87 +9118,87 @@ @article{a-gvdps-89
 }
 
 @inproceedings{aas-lalsp-97
-, author =	"B. Aronov and P. Agarwal and M. Sharir"
-, title =	"On Levels in Arrangements of Lines, Segments, Planes, and Triangles"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"30--38"
-, precedes =	"aacs-lalsp-98"
-, cites =	"ag-nssfs-86, acegsw-ptphp-91, bfl-nhp-90, bs-enks-94, ceghss-shcp-94, c-blmat-93, cs-arscg-89, de-ctchp-94, e-acg-87, evw-cdpsh-94, elss-dgpps-73, gp-asotd-93, g-saco-80, g-bpstp-79, hs-dccap-91, hs-cdcca-94, hs-cpmfl-92, l-nhl-71, pa-cg-95, pss-ubnpk-92, s-ksacs-91, tt-hcpps-95, w-mksfs-86, ws-prnds-88, vz-ctpci-92, ZZZ"
-, update =	"98.07 bibrelex+smid, 98.03 mitchell, 97.07 efrat, 97.03 agarwal, 96.09 agarwal"
+, author =      "B. Aronov and P. Agarwal and M. Sharir"
+, title =       "On Levels in Arrangements of Lines, Segments, Planes, and Triangles"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "30--38"
+, precedes =    "aacs-lalsp-98"
+, cites =       "ag-nssfs-86, acegsw-ptphp-91, bfl-nhp-90, bs-enks-94, ceghss-shcp-94, c-blmat-93, cs-arscg-89, de-ctchp-94, e-acg-87, evw-cdpsh-94, elss-dgpps-73, gp-asotd-93, g-saco-80, g-bpstp-79, hs-dccap-91, hs-cdcca-94, hs-cpmfl-92, l-nhl-71, pa-cg-95, pss-ubnpk-92, s-ksacs-91, tt-hcpps-95, w-mksfs-86, ws-prnds-88, vz-ctpci-92, ZZZ"
+, update =      "98.07 bibrelex+smid, 98.03 mitchell, 97.07 efrat, 97.03 agarwal, 96.09 agarwal"
 }
 
 @inproceedings{abssv-mpmr-98
-, author =	"B. Aronov and M. de Berg and A. F. van der Stappen and O. \v{S}vestka and J. Vleugels"
-, title =	"Motion planning for multiple robots"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"374--382"
-, update =	"00.03 agarwal"
+, author =      "B. Aronov and M. de Berg and A. F. van der Stappen and O. \v{S}vestka and J. Vleugels"
+, title =       "Motion planning for multiple robots"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "374--382"
+, update =      "00.03 agarwal"
 }
 
 @article{advsv-mpmr-99
-, author =	"B. Aronov and M. de Berg and A. F. van der Stappen and P. {\v S}vestka and J. Vleugels"
-, title =	"Motion Planning for Multiple Robots"
-, journal =	"Discrete Comput. Geom."
-, volume =	22
-, number =	4
-, year =	1999
-, pages =	"505--525"
-, update =	"00.03 bibrelex, 99.11 held"
+, author =      "B. Aronov and M. de Berg and A. F. van der Stappen and P. {\v S}vestka and J. Vleugels"
+, title =       "Motion Planning for Multiple Robots"
+, journal =     "Discrete Comput. Geom."
+, volume =      22
+, number =      4
+, year =        1999
+, pages =       "505--525"
+, update =      "00.03 bibrelex, 99.11 held"
 }
 
 @unpublished{abe-acp-95
-, author =	"B. Aronov and M. Bern and D. Eppstein"
-, title =	"Arrangements of convex polytopes"
-, year =	1995
-, note =	"unpublished manuscript"
-, update =	"98.03 agarwal"
+, author =      "B. Aronov and M. Bern and D. Eppstein"
+, title =       "Arrangements of convex polytopes"
+, year =        1995
+, note =        "unpublished manuscript"
+, update =      "98.03 agarwal"
 }
 
 %, number =      1
 @article{abe-nm1st-94
-, author =	"B. Aronov and M. Bern and D. Eppstein"
-, title =	"On the Number of Minimal {1-Steiner} Trees"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"29--34"
-, update =	"98.03 aronov"
+, author =      "B. Aronov and M. Bern and D. Eppstein"
+, title =       "On the Number of Minimal {1-Steiner} Trees"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "29--34"
+, update =      "98.03 aronov"
 }
 
 @techreport{abe-ap1sp-91
-, author =	"B. Aronov and M. Bern and D. Epstein"
-, title =	"Arrangement of polytopes and the $1$-{Steiner} problem"
-, type =	"Preprint"
-, institution =	"??"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "B. Aronov and M. Bern and D. Epstein"
+, title =       "Arrangement of polytopes and the $1$-{Steiner} problem"
+, type =        "Preprint"
+, institution = "??"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{acegsw-ptphp-90
-, author =	"B. Aronov and Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and R. Wenger"
-, title =	"Points and triangles in the plane and halving planes in space"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"112--115"
-, keywords =	"combinatorial geometry, halving sets, $k$-sets"
-, precedes =	"acegsw-ptphp-91"
-, cites =	"ag-nssfs-86, a-pdpaa-87, b-gct-82, bfl-nhp-89, bf-ntccn-84, ceghss-sdash-90, cs-arscg-89, e-acg-87, ew-nlsfs-85, elss-dgpps-73, gp-nkssn-84, l-nhl-71, pss-ubnpk-89, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 95.01 aronov"
+, author =      "B. Aronov and Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and R. Wenger"
+, title =       "Points and triangles in the plane and halving planes in space"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "112--115"
+, keywords =    "combinatorial geometry, halving sets, $k$-sets"
+, precedes =    "acegsw-ptphp-91"
+, cites =       "ag-nssfs-86, a-pdpaa-87, b-gct-82, bfl-nhp-89, bf-ntccn-84, ceghss-sdash-90, cs-arscg-89, e-acg-87, ew-nlsfs-85, elss-dgpps-73, gp-nkssn-84, l-nhl-71, pss-ubnpk-89, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 95.01 aronov"
 }
 
 @article{acegsw-ptphp-91
-, author =	"Boris Aronov and Bernard Chazelle and Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Rephael Wenger"
-, title =	"Points and triangles in the plane and halving planes in space"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"435--442"
-, keywords =	"combinatorial geometry, halving sets, $k$-sets"
-, succeeds =	"acegsw-ptphp-90"
-, update =	"95.01 aronov"
-, abstract =	"We prove that for any set $S$ of $n$ points in the plane and
+, author =      "Boris Aronov and Bernard Chazelle and Herbert Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Rephael Wenger"
+, title =       "Points and triangles in the plane and halving planes in space"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "435--442"
+, keywords =    "combinatorial geometry, halving sets, $k$-sets"
+, succeeds =    "acegsw-ptphp-90"
+, update =      "95.01 aronov"
+, abstract =    "We prove that for any set $S$ of $n$ points in the plane and
   $n^{3-\alpha}$ triangles spanned by the points in $S$ there
   exists a point (not necessarily in $S$) contained in at least
   $n^{3-3\alpha} \over c \log^5n$ of the triangles.
@@ -9207,1871 +9207,1871 @@ @article{acegsw-ptphp-91
 }
 
 @inproceedings{addpp-vmr-96
-, author =	"Boris Aronov and Alan R. Davis and Tamal K. Dey and Sudebkumar P. Pal and D. Chithra Prasad"
-, title =	"Visibility with Multiple Reflections"
-, booktitle =	"Proc. 5th Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1097
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"284--295"
-, precedes =	"addpp-vmr-98"
-, update =	"99.11 bibrelex, 98.11 aronov, 96.09 aronov"
+, author =      "Boris Aronov and Alan R. Davis and Tamal K. Dey and Sudebkumar P. Pal and D. Chithra Prasad"
+, title =       "Visibility with Multiple Reflections"
+, booktitle =   "Proc. 5th Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1097
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "284--295"
+, precedes =    "addpp-vmr-98"
+, update =      "99.11 bibrelex, 98.11 aronov, 96.09 aronov"
 }
 
 %% Edited this from addpp-vmr in old version of geombib--was completely wrong!
 %% Yes, the names are abbreviated like that in DCG version. --BA
 @article{addpp-vmr-98
-, author =	"B. Aronov and A. R. Davis and T. K. Dey and S. P. Pal and D. C. Prasad"
-, title =	"Visibility with Multiple Reflections"
-, journal =	"Discrete Comput. Geom."
-, volume =	20
-, year =	1998
-, pages =	"61--78"
-, succeeds =	"addpp-vmr-96"
-, update =	"98.11 aronov, 98.03 agarwal+bibrelex, 97.11 aronov"
+, author =      "B. Aronov and A. R. Davis and T. K. Dey and S. P. Pal and D. C. Prasad"
+, title =       "Visibility with Multiple Reflections"
+, journal =     "Discrete Comput. Geom."
+, volume =      20
+, year =        1998
+, pages =       "61--78"
+, succeeds =    "addpp-vmr-96"
+, update =      "98.11 aronov, 98.03 agarwal+bibrelex, 97.11 aronov"
 }
 
 @article{addpp-vor-98
-, author =	"B. Aronov and A. R. Davis and T. K. Dey and S. P. Pal and D. C. Prasad"
-, title =	"Visibility with One Reflection"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"553--574"
-, succeeds =	"addpp-vr-95"
-, update =	"98.11 aronov+held, 97.11 aronov"
+, author =      "B. Aronov and A. R. Davis and T. K. Dey and S. P. Pal and D. C. Prasad"
+, title =       "Visibility with One Reflection"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "553--574"
+, succeeds =    "addpp-vr-95"
+, update =      "98.11 aronov+held, 97.11 aronov"
 }
 
 @inproceedings{addpp-vr-95
-, author =	"Boris Aronov and Alan R. Davis and Tamal K. Dey and Sudebkumar P. Pal and D. Chithra Prasad"
-, title =	"Visibility with Reflection"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"316--325"
-, keywords =	"mirrors"
-, precedes =	"addpp-vor-98"
-, cites =	"addpp-vmr-96, ak-frtrc-87, bo-arcgi-79, dpp-agpvr-95, ea-lacvp-81, fkn-vsgpt-80, ghlst-ltavs-87, g-bp-86, hv-splsp-49,  k-ealdp-89, kw-onupp-91, l-vsp-83, ll-ccagp-86, lpsssstwy-clcsp-88, o-agta-87, rty-ccrt-94, s-rrag-92, s-mlppr-87, s-sldps-90, ZZZ"
-, update =	"99.11 bibrelex, 98.11 aronov, 98.03 bibrelex, 95.09 mitchell"
+, author =      "Boris Aronov and Alan R. Davis and Tamal K. Dey and Sudebkumar P. Pal and D. Chithra Prasad"
+, title =       "Visibility with Reflection"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "316--325"
+, keywords =    "mirrors"
+, precedes =    "addpp-vor-98"
+, cites =       "addpp-vmr-96, ak-frtrc-87, bo-arcgi-79, dpp-agpvr-95, ea-lacvp-81, fkn-vsgpt-80, ghlst-ltavs-87, g-bp-86, hv-splsp-49,  k-ealdp-89, kw-onupp-91, l-vsp-83, ll-ccagp-86, lpsssstwy-clcsp-88, o-agta-87, rty-ccrt-94, s-rrag-92, s-mlppr-87, s-sldps-90, ZZZ"
+, update =      "99.11 bibrelex, 98.11 aronov, 98.03 bibrelex, 95.09 mitchell"
 }
 
 @techreport{aegs-ibcmf-89
-, author =	"B. Aronov and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"Improved bounds on the complexity of many faces in arrangements of segments"
-, type =	"Report"
-, number =	459
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, month =	jul
-, year =	1989
-, keywords =	"combinatorial geometry, combinatorial complexity, arrangements, complexity of faces, random sampling"
-, precedes =	"aegs-nemfl-90"
-, update =	"98.03 mitchell"
+, author =      "B. Aronov and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "Improved bounds on the complexity of many faces in arrangements of segments"
+, type =        "Report"
+, number =      459
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, month =       jul
+, year =        1989
+, keywords =    "combinatorial geometry, combinatorial complexity, arrangements, complexity of faces, random sampling"
+, precedes =    "aegs-nemfl-90"
+, update =      "98.03 mitchell"
 }
 
 @article{aegs-nemfl-92
-, author =	"B. Aronov and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"The number of edges of many faces in a line segment arrangement"
-, journal =	"Combinatorica"
-, volume =	12
-, number =	3
-, year =	1992
-, pages =	"261--274"
-, keywords =	"combinatorial geometry, combinatorial complexity, arrangements, complexity of faces, random sampling"
-, succeeds =	"aegs-nemfl-90"
-, update =	"98.03 mitchell, 97.11 aronov, 93.09 matousek"
+, author =      "B. Aronov and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "The number of edges of many faces in a line segment arrangement"
+, journal =     "Combinatorica"
+, volume =      12
+, number =      3
+, year =        1992
+, pages =       "261--274"
+, keywords =    "combinatorial geometry, combinatorial complexity, arrangements, complexity of faces, random sampling"
+, succeeds =    "aegs-nemfl-90"
+, update =      "98.03 mitchell, 97.11 aronov, 93.09 matousek"
 }
 
 @techreport{aegs-nemfl-90
-, author =	"B. Aronov and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"The number of edges of many faces in line segment arrangements"
-, type =	"Report"
-, number =	"90-46"
-, institution =	"DIMACS, Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, month =	jun
-, year =	1990
-, keywords =	"combinatorial geometry, combinatorial complexity, arrangements, complexity of faces, random sampling"
-, succeeds =	"aegs-ibcmf-89"
-, precedes =	"aegs-nemfl-92"
-, update =	"98.03 mitchell, 97.11 aronov"
+, author =      "B. Aronov and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "The number of edges of many faces in line segment arrangements"
+, type =        "Report"
+, number =      "90-46"
+, institution = "DIMACS, Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, month =       jun
+, year =        1990
+, keywords =    "combinatorial geometry, combinatorial complexity, arrangements, complexity of faces, random sampling"
+, succeeds =    "aegs-ibcmf-89"
+, precedes =    "aegs-nemfl-92"
+, update =      "98.03 mitchell, 97.11 aronov"
 }
 
 @inproceedings{aehs-nrvuj-98
-, author =	"Boris Aronov and Alon Efrat and Dan Halperin and Micha Sharir"
-, title =	"On the Number of Regular Vertices of the Union of {Jordan} Regions"
-, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '98"
-, site =	"Stockholm"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1432
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"322--334"
-, update =	"99.03 bibrelex, 98.07 mitchell"
+, author =      "Boris Aronov and Alon Efrat and Dan Halperin and Micha Sharir"
+, title =       "On the Number of Regular Vertices of the Union of {Jordan} Regions"
+, booktitle =   "Proc. 6th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '98"
+, site =        "Stockholm"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1432
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "322--334"
+, update =      "99.03 bibrelex, 98.07 mitchell"
 }
 
 @techreport{aes-sbnrv-97
-, author =	"Boris Aronov and Alon Efrat and Micha Sharir"
-, title =	"A Subquadratic Bound on the Number of Regular Vertices of the Union of {Jordan} Regions"
-, type =	"Manuscript"
-, institution =	"Tel Aviv University"
-, year =	1997
-, update =	"98.03 mitchell"
+, author =      "Boris Aronov and Alon Efrat and Micha Sharir"
+, title =       "A Subquadratic Bound on the Number of Regular Vertices of the Union of {Jordan} Regions"
+, type =        "Manuscript"
+, institution = "Tel Aviv University"
+, year =        1997
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{aegkkps-cf-91
-, author =	"B. Aronov and P. Erd{\H o}s and W. Goddard and D. J. Kleitman and M. Klugerman and J. Pach and L. J. Schulman"
-, title =	"Crossing families"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"351--356"
-, keywords =	"partition"
-, cites =	"ae-degg-89, cp-tttcc-90, e-acg-87, es-cpg-35, m-ept-91, r-ng-83, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "B. Aronov and P. Erd{\H o}s and W. Goddard and D. J. Kleitman and M. Klugerman and J. Pach and L. J. Schulman"
+, title =       "Crossing families"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "351--356"
+, keywords =    "partition"
+, cites =       "ae-degg-89, cp-tttcc-90, e-acg-87, es-cpg-35, m-ept-91, r-ng-83, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{aegkkps-cf-94
-, author =	"B. Aronov and P. Erd{\H o}s and W. Goddard and D. J. Kleitman and M. Klugerman and J. Pach and L. J. Schulman"
-, title =	"Crossing families"
-, journal =	"Combinatorica"
-, volume =	14
-, year =	1994
-, pages =	"127--134"
-, keywords =	"partition"
-, update =	"97.11 bibrelex"
+, author =      "B. Aronov and P. Erd{\H o}s and W. Goddard and D. J. Kleitman and M. Klugerman and J. Pach and L. J. Schulman"
+, title =       "Crossing families"
+, journal =     "Combinatorica"
+, volume =      14
+, year =        1994
+, pages =       "127--134"
+, keywords =    "partition"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{af-acrsm-97
-, author =	"B. Aronov and S. Fortune"
-, title =	"Average-Case Ray Shooting and Minimum Weight Triangulations"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"203--211"
-, cites =	"a-rs-97, aas-stl3d-95, am-rsss-94, as-anspt-93, be-aagp-97, c-aapts-91, e-acg-87, e-amwst-94, f-btapi-96, hs-parss-93, mms-qsrs-94, m-smga-92, o-cgc-94, s-ipgp-79, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "B. Aronov and S. Fortune"
+, title =       "Average-Case Ray Shooting and Minimum Weight Triangulations"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "203--211"
+, cites =       "a-rs-97, aas-stl3d-95, am-rsss-94, as-anspt-93, be-aagp-97, c-aapts-91, e-acg-87, e-amwst-94, f-btapi-96, hs-parss-93, mms-qsrs-94, m-smga-92, o-cgc-94, s-ipgp-79, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @unpublished{afw-msm-87
-, author =	"B. Aronov and S. Fortune and G. Wilfong"
-, title =	"Minimum speed motion"
-, year =	1987
-, note =	"??"
-, update =	"98.03 bibrelex"
+, author =      "B. Aronov and S. Fortune and G. Wilfong"
+, title =       "Minimum speed motion"
+, year =        1987
+, note =        "??"
+, update =      "98.03 bibrelex"
 }
 
 @article{afw-fsgvd-93
-, author =	"B. Aronov and S. J. Fortune and G. Wilfong"
-, title =	"Furthest-Site Geodesic {Voronoi} Diagram"
-, journal =	"Discrete Comput. Geom."
-, volume =	9
-, year =	1993
-, pages =	"217--255"
-, keywords =	"geodesic distance, simple polygon, Voronoi diagram"
-, succeeds =	"afw-fsgvd-88"
-, update =	"94.05 aronov"
-, abstract =	"We present an $O((n+k)\log(n+k))$ time, $O(n+k)$ space
+, author =      "B. Aronov and S. J. Fortune and G. Wilfong"
+, title =       "Furthest-Site Geodesic {Voronoi} Diagram"
+, journal =     "Discrete Comput. Geom."
+, volume =      9
+, year =        1993
+, pages =       "217--255"
+, keywords =    "geodesic distance, simple polygon, Voronoi diagram"
+, succeeds =    "afw-fsgvd-88"
+, update =      "94.05 aronov"
+, abstract =    "We present an $O((n+k)\log(n+k))$ time, $O(n+k)$ space
 algorithm for computing the furthest-site Voronoi diagram of $k$ point
 sites with respect to the geodesic metric within a simple $n$-sided polygon."
 }
 
 @inproceedings{afw-fsgvd-88
-, author =	"B. Aronov and S. J. Fortune and G. Wilfong"
-, title =	"The furthest-site geodesic {Voronoi} diagram"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"229--240"
-, keywords =	"geodesic distance, simple polygon, Voronoi diagram"
-, precedes =	"afw-fsgvd-93"
-, cites =	"a-gvdps-87, at-cgcsp-87, ghlst-ltavs-86, gjpt-tsp-78, lp-esppr-84, psr-cgcsp-89, ps-cgi-85, s-agfnp-87, t-oacrc-86, ZZZ"
-, update =	"98.03 bibrelex, 94.05 aronov"
+, author =      "B. Aronov and S. J. Fortune and G. Wilfong"
+, title =       "The furthest-site geodesic {Voronoi} diagram"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "229--240"
+, keywords =    "geodesic distance, simple polygon, Voronoi diagram"
+, precedes =    "afw-fsgvd-93"
+, cites =       "a-gvdps-87, at-cgcsp-87, ghlst-ltavs-86, gjpt-tsp-78, lp-esppr-84, psr-cgcsp-89, ps-cgi-85, s-agfnp-87, t-oacrc-86, ZZZ"
+, update =      "98.03 bibrelex, 94.05 aronov"
 }
 
 @unpublished{agpw-tinhn-
-, author =	"B. Aronov and J. E. Goodman and R. Pollack"
-, title =	"There is no {Hadwiger} number for line traversals in higher dimensions"
-, note =	"Unpublished Manuscript"
-, update =	"98.03 bibrelex"
+, author =      "B. Aronov and J. E. Goodman and R. Pollack"
+, title =       "There is no {Hadwiger} number for line traversals in higher dimensions"
+, note =        "Unpublished Manuscript"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{agpw-httht-00
-, author =	"Boris Aronov and Jacob E. Goodman and Richard Pollack and Rephael Wenger"
-, title =	"A {Helly}-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"57--63"
-, update =	"00.11 jones"
+, author =      "Boris Aronov and Jacob E. Goodman and Richard Pollack and Rephael Wenger"
+, title =       "A {Helly}-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "57--63"
+, update =      "00.11 jones"
 }
 
 % issue number 1
 @article{am-stl3s-95
-, author =	"B. Aronov and J. Matou{\v s}ek"
-, title =	"On stabbing triangles by lines in 3-space"
-, journal =	"Comment. Math. Univ. Carolinae"
-, volume =	36
-, year =	1995
-, pages =	"109--113"
-, update =	"98.03 bibrelex, 97.11 aronov"
+, author =      "B. Aronov and J. Matou{\v s}ek"
+, title =       "On stabbing triangles by lines in 3-space"
+, journal =     "Comment. Math. Univ. Carolinae"
+, volume =      36
+, year =        1995
+, pages =       "109--113"
+, update =      "98.03 bibrelex, 97.11 aronov"
 }
 
 @inproceedings{ams-sscch-91
-, author =	"B. Aronov and J. Matou{\v s}ek and Micha Sharir"
-, title =	"On the sum of squares of cell complexities in hyperplane arrangements"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"307--313"
-, keywords =	"combinatorial geometry, combinatorial complexity, arrangements, polytopes, hyperplanes"
-, comments =	"To appear in {\em Journal Combin. Theory Ser. A}"
-, cites =	"aa-cfi-89, as-tsbac-90, as-zasha-91, as-cscas-, cf-plh-91, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-cmcap-90, ess-npzta-, p-caasv-91, p-nrrsi-91, s-ksacs-91, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 96.09 agarwal"
+, author =      "B. Aronov and J. Matou{\v s}ek and Micha Sharir"
+, title =       "On the sum of squares of cell complexities in hyperplane arrangements"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "307--313"
+, keywords =    "combinatorial geometry, combinatorial complexity, arrangements, polytopes, hyperplanes"
+, comments =    "To appear in {\em Journal Combin. Theory Ser. A}"
+, cites =       "aa-cfi-89, as-tsbac-90, as-zasha-91, as-cscas-, cf-plh-91, cegsw-ccbac-90, cs-arscg-89, e-acg-87, egs-cmcap-90, ess-npzta-, p-caasv-91, p-nrrsi-91, s-ksacs-91, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 96.09 agarwal"
 }
 
 @article{ams-sscch-94
-, author =	"B. Aronov and J. Matou{\v s}ek and Micha Sharir"
-, title =	"On the sum of squares of cell complexities in hyperplane arrangements"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	65
-, year =	1994
-, pages =	"311--321"
-, update =	"98.03 mitchell, 97.11 bibrelex, 94.05 matousek"
+, author =      "B. Aronov and J. Matou{\v s}ek and Micha Sharir"
+, title =       "On the sum of squares of cell complexities in hyperplane arrangements"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      65
+, year =        1994
+, pages =       "311--321"
+, update =      "98.03 mitchell, 97.11 bibrelex, 94.05 matousek"
 }
 
 @article{anps-ipbah-93
-, author =	"B. Aronov and D. Q. Naiman and J. Pach and Micha Sharir"
-, title =	"An invariant property of balls in arrangements of hyperplanes"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"421--425"
-, update =	"98.03 mitchell, 97.11 bibrelex, 94.05 aronov+sharir"
+, author =      "B. Aronov and D. Q. Naiman and J. Pach and Micha Sharir"
+, title =       "An invariant property of balls in arrangements of hyperplanes"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "421--425"
+, update =      "98.03 mitchell, 97.11 bibrelex, 94.05 aronov+sharir"
 }
 
 @techreport{ao-ampps-87
-, author =	"B. Aronov and C. {\'O}'D{\'u}nlaing"
-, title =	"Analysis of the motion-planning problem for a simple two-link planar arm"
-, type =	"Report"
-, number =	314
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, month =	aug
-, year =	1987
-, keywords =	"motion planning, configuration space"
+, author =      "B. Aronov and C. {\'O}'D{\'u}nlaing"
+, title =       "Analysis of the motion-planning problem for a simple two-link planar arm"
+, type =        "Report"
+, number =      314
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, month =       aug
+, year =        1987
+, keywords =    "motion planning, configuration space"
 }
 
 @techreport{ao-nsu-91t
-, author =	"B. Aronov and J. O'Rourke"
-, title =	"Nonoverlap of the star unfolding"
-, type =	"Technical {Report}"
-, number =	002
-, institution =	"Smith College"
-, address =	"Northampton, MA"
-, month =	mar
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "B. Aronov and J. O'Rourke"
+, title =       "Nonoverlap of the star unfolding"
+, type =        "Technical {Report}"
+, number =      002
+, institution = "Smith College"
+, address =     "Northampton, MA"
+, month =       mar
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ao-nsu-91
-, author =	"B. Aronov and J. O'Rourke"
-, title =	"Nonoverlap of the star unfolding"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"105--114"
-, keywords =	"polytopes, shortest paths, Voronoi diagrams, edge sequences"
-, cites =	"ao-nsu-91t, aaos-supa-90, aaos-supa-93, a-digdk-55, a-kp-58, b-cs-58, ch-spp-90, k-ccl-67, p-egcs-73, ss-spps-86, ZZZ"
-, update =	"97.11 bibrelex, 93.05 orourke"
+, author =      "B. Aronov and J. O'Rourke"
+, title =       "Nonoverlap of the star unfolding"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "105--114"
+, keywords =    "polytopes, shortest paths, Voronoi diagrams, edge sequences"
+, cites =       "ao-nsu-91t, aaos-supa-90, aaos-supa-93, a-digdk-55, a-kp-58, b-cs-58, ch-spp-90, k-ccl-67, p-egcs-73, ss-spps-86, ZZZ"
+, update =      "97.11 bibrelex, 93.05 orourke"
 }
 
 @article{ao-nsu-92
-, author =	"B. Aronov and J. O'Rourke"
-, title =	"Nonoverlap of the star unfolding"
-, journal =	"Discrete Comput. Geom."
-, volume =	8
-, year =	1992
-, pages =	"219--250"
-, keywords =	"polytopes, shortest paths, Voronoi diagrams, edge sequences"
-, update =	"93.05 orourke"
+, author =      "B. Aronov and J. O'Rourke"
+, title =       "Nonoverlap of the star unfolding"
+, journal =     "Discrete Comput. Geom."
+, volume =      8
+, year =        1992
+, pages =       "219--250"
+, keywords =    "polytopes, shortest paths, Voronoi diagrams, edge sequences"
+, update =      "93.05 orourke"
 }
 
 @article{aps-zsha-93
-, author =	"B. Aronov and M. Pellegrini and Micha Sharir"
-, title =	"On the zone of a surface in a hyperplane arrangement"
-, journal =	"Discrete Comput. Geom."
-, volume =	9
-, number =	2
-, year =	1993
-, pages =	"177--186"
-, comments =	"zone of k-dim bounded degree algebraic variety in arrangement of n hyperplanes in d-space has roughly $n^{\lfloor (k+d)/2\rfloor}$ complexity (plus some extra logs)"
-, succeeds =	"as-zsha-91, p-zcdps-91"
-, update =	"98.03 mitchell, 95.09 aronov, 93.09 matousek"
+, author =      "B. Aronov and M. Pellegrini and Micha Sharir"
+, title =       "On the zone of a surface in a hyperplane arrangement"
+, journal =     "Discrete Comput. Geom."
+, volume =      9
+, number =      2
+, year =        1993
+, pages =       "177--186"
+, comments =    "zone of k-dim bounded degree algebraic variety in arrangement of n hyperplanes in d-space has roughly $n^{\lfloor (k+d)/2\rfloor}$ complexity (plus some extra logs)"
+, succeeds =    "as-zsha-91, p-zcdps-91"
+, update =      "98.03 mitchell, 95.09 aronov, 93.09 matousek"
 }
 
 @article{ass-ctsp-93
-, author =	"B. Aronov and R. Seidel and D. Souvaine"
-, title =	"On compatible triangulations of simple polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, number =	1
-, year =	1993
-, pages =	"27--35"
-, keywords =	"polygon, triagulation"
-, update =	"95.05 korneenko"
+, author =      "B. Aronov and R. Seidel and D. Souvaine"
+, title =       "On compatible triangulations of simple polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, number =      1
+, year =        1993
+, pages =       "27--35"
+, keywords =    "polygon, triagulation"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{as-car-92
-, author =	"B. Aronov and Micha Sharir"
-, title =	"Castles in the air revisited"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"146--156"
-, keywords =	"combinatorial geometry, combinatorial complexity, simplex arrangements, popularity, excess"
-, precedes =	"as-car-94"
-, cites =	"aa-cfi-89, ams-sscch-91, as-tsbac-90, as-zsha-91, cs-arscg-89, e-acg-87, egppss-acptc-92, egs-ccmfa-90, egs-cmcap-90, ess-ztha-93, gss-gmppt-89, h-cscca-91, hks-uevsi-91, ps-ueplf-89, ss-pmp2g-83, ss-tddsp-90, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 95.01 aronov, 93.05 smid"
-}
-
-%, number =	2
-%, month =	sep
+, author =      "B. Aronov and Micha Sharir"
+, title =       "Castles in the air revisited"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "146--156"
+, keywords =    "combinatorial geometry, combinatorial complexity, simplex arrangements, popularity, excess"
+, precedes =    "as-car-94"
+, cites =       "aa-cfi-89, ams-sscch-91, as-tsbac-90, as-zsha-91, cs-arscg-89, e-acg-87, egppss-acptc-92, egs-ccmfa-90, egs-cmcap-90, ess-ztha-93, gss-gmppt-89, h-cscca-91, hks-uevsi-91, ps-ueplf-89, ss-pmp2g-83, ss-tddsp-90, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 95.01 aronov, 93.05 smid"
+}
+
+%, number =     2
+%, month =      sep
 @article{as-car-94
-, author =	"B. Aronov and Micha Sharir"
-, title =	"Castles in the air revisited"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"119--150"
-, keywords =	"combinatorial geometry, combinatorial complexity, simplex arrangements, popularity, excess"
-, succeeds =	"as-car-92"
-, update =	"98.03 mitchell, 97.11 aronov, 95.01 aronov"
+, author =      "B. Aronov and Micha Sharir"
+, title =       "Castles in the air revisited"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "119--150"
+, keywords =    "combinatorial geometry, combinatorial complexity, simplex arrangements, popularity, excess"
+, succeeds =    "as-car-92"
+, update =      "98.03 mitchell, 97.11 aronov, 95.01 aronov"
 }
 
 @inproceedings{as-ccpsi-01
-, author =	"Boris Aronov and Micha Sharir"
-, title =	"Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"66--69"
-, update =	"01.04 icking"
+, author =      "Boris Aronov and Micha Sharir"
+, title =       "Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "66--69"
+, update =      "01.04 icking"
 }
 
 @unpublished{as-cscas-
-, author =	"B. Aronov and Micha Sharir"
-, title =	"On the complexity of a single cell in an arrangement of simplices in $d$-space"
-, note =	"In preparation"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "B. Aronov and Micha Sharir"
+, title =       "On the complexity of a single cell in an arrangement of simplices in $d$-space"
+, note =        "In preparation"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{as-cocat-91
-, author =	"B. Aronov and Micha Sharir"
-, title =	"On the complexity of one cell in an arrangement of triangles"
-, type =	"Manuscript"
-, year =	1991
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "B. Aronov and Micha Sharir"
+, title =       "On the complexity of one cell in an arrangement of triangles"
+, type =        "Manuscript"
+, year =        1991
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{as-zsha-91
-, author =	"B. Aronov and Micha Sharir"
-, title =	"On the zone of a surface in a hyperplane arrangement"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"13--19"
-, keywords =	"arrangements, hyperplanes"
-, precedes =	"aps-zsha-93"
-, update =	"98.03 mitchell, 95.09 aronov"
+, author =      "B. Aronov and Micha Sharir"
+, title =       "On the zone of a surface in a hyperplane arrangement"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "13--19"
+, keywords =    "arrangements, hyperplanes"
+, precedes =    "aps-zsha-93"
+, update =      "98.03 mitchell, 95.09 aronov"
 }
 
 @techreport{as-zasha-91
-, author =	"B. Aronov and Micha Sharir"
-, title =	"On the Zone of an Algebraic Surface in a Hyperplane Arrangement"
-, type =	"Manuscript"
-, year =	1991
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "B. Aronov and Micha Sharir"
+, title =       "On the Zone of an Algebraic Surface in a Hyperplane Arrangement"
+, type =        "Manuscript"
+, year =        1991
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{as-tmp3s-94
-, author =	"Boris Aronov and Micha Sharir"
-, title =	"On Translational Motion Planning in $3$-Space"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"21--30"
-, precedes =	"as-tmpcp-97"
-, cites =	"as-cecpp-94, as-tsbac-90, as-car-92, as-ucptd-93, bms-plpco-93, c-oaitd-92, cegss-cfals-93, cs-arscg-89, e-acg-87, egs-ueplf-89, gh-atfc-81, gks-ricdv-92, gs-ccrs-87, hy-cctbp-93, hs-actbn-93, klps-ujrcf-86, ms-eracu-91, m-mt-63, ps-ueplf-89, s-eappt-87, v-htiat-73, ZZZ"
-, update =	"98.03 bibrelex, 97.11 aronov, 94.09 jones, 94.01 jones"
+, author =      "Boris Aronov and Micha Sharir"
+, title =       "On Translational Motion Planning in $3$-Space"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "21--30"
+, precedes =    "as-tmpcp-97"
+, cites =       "as-cecpp-94, as-tsbac-90, as-car-92, as-ucptd-93, bms-plpco-93, c-oaitd-92, cegss-cfals-93, cs-arscg-89, e-acg-87, egs-ueplf-89, gh-atfc-81, gks-ricdv-92, gs-ccrs-87, hy-cctbp-93, hs-actbn-93, klps-ujrcf-86, ms-eracu-91, m-mt-63, ps-ueplf-89, s-eappt-87, v-htiat-73, ZZZ"
+, update =      "98.03 bibrelex, 97.11 aronov, 94.09 jones, 94.01 jones"
 }
 
 % number = 6
 % month = dec
 @article{as-tmpcp-97
-, author =	"Boris Aronov and Micha Sharir"
-, title =	"On Translational Motion Planning of a Convex Polyhedron in $3$-Space"
-, journal =	"SIAM J. Comput."
-, volume =	26
-, year =	1997
-, pages =	"1785--1803"
-, succeeds =	"as-tmp3s-94"
-, update =	"97.11 aronov"
+, author =      "Boris Aronov and Micha Sharir"
+, title =       "On Translational Motion Planning of a Convex Polyhedron in $3$-Space"
+, journal =     "SIAM J. Comput."
+, volume =      26
+, year =        1997
+, pages =       "1785--1803"
+, succeeds =    "as-tmp3s-94"
+, update =      "97.11 aronov"
 }
 
 @techreport{as-cecpp-94
-, author =	"B. Aronov and M. Sharir"
-, title =	"The common exterior of convex polygons in the plane"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "B. Aronov and M. Sharir"
+, title =       "The common exterior of convex polygons in the plane"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @article{as-cecpp-97
-, author =	"Boris Aronov and Micha Sharir"
-, title =	"The common exterior of convex polygons in the plane"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"139--149"
-, update =	"97.11 aronov"
+, author =      "Boris Aronov and Micha Sharir"
+, title =       "The common exterior of convex polygons in the plane"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "139--149"
+, update =      "97.11 aronov"
 }
 
 @inproceedings{as-ucptd-93
-, author =	"Boris Aronov and Micha Sharir"
-, title =	"The Union of Convex Polyhedra in Three Dimensions"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"518--527"
-, precedes =	"ast-ucptd-97"
-, update =	"98.07 bibrelex, 97.11 aronov, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Boris Aronov and Micha Sharir"
+, title =       "The Union of Convex Polyhedra in Three Dimensions"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "518--527"
+, precedes =    "ast-ucptd-97"
+, update =      "98.07 bibrelex, 97.11 aronov, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @techreport{as-tsbac-87
-, author =	"B. Aronov and M. Sharir"
-, title =	"Triangles in space, or building and analyzing castles in the air"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "B. Aronov and M. Sharir"
+, title =       "Triangles in space, or building and analyzing castles in the air"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{as-tsbac-88
-, author =	"B. Aronov and Micha Sharir"
-, title =	"Triangles in space or building (and analyzing) castles in the air"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"381--391"
-, keywords =	"three-dimensional, triangle arrangements"
-, precedes =	"as-tsbac-90"
-, cites =	"cgl-pgd-85, c-narsc-87, e-acg-87, egppss-acptc-88, egs-ueplf-87, egs-cmfal-88, egs-cmcap-88, eos-calha-86, ew-mnemf-86, hs-ndssg-86, hw-ensrq-87, ps-ueplf-87, pss-stsps-88, ss-cmpti-88, st-pplup-86, ws-prnds-88, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "B. Aronov and Micha Sharir"
+, title =       "Triangles in space or building (and analyzing) castles in the air"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "381--391"
+, keywords =    "three-dimensional, triangle arrangements"
+, precedes =    "as-tsbac-90"
+, cites =       "cgl-pgd-85, c-narsc-87, e-acg-87, egppss-acptc-88, egs-ueplf-87, egs-cmfal-88, egs-cmcap-88, eos-calha-86, ew-mnemf-86, hs-ndssg-86, hw-ensrq-87, ps-ueplf-87, pss-stsps-88, ss-cmpti-88, st-pplup-86, ws-prnds-88, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{as-tsbac-90
-, author =	"B. Aronov and Micha Sharir"
-, title =	"Triangles in space or building (and analyzing) castles in the air"
-, journal =	"Combinatorica"
-, volume =	10
-, number =	2
-, year =	1990
-, pages =	"137--173"
-, keywords =	"three-dimensional, triangle arrangements"
-, succeeds =	"as-tsbac-88"
-, update =	"98.03 mitchell"
+, author =      "B. Aronov and Micha Sharir"
+, title =       "Triangles in space or building (and analyzing) castles in the air"
+, journal =     "Combinatorica"
+, volume =      10
+, number =      2
+, year =        1990
+, pages =       "137--173"
+, keywords =    "three-dimensional, triangle arrangements"
+, succeeds =    "as-tsbac-88"
+, update =      "98.03 mitchell"
 }
 
 % number = 6
 % month = dec
 @article{ast-ucptd-97
-, author =	"Boris Aronov and Micha Sharir and Boaz Tagansky"
-, title =	"The Union of Convex Polyhedra in Three Dimensions"
-, journal =	"SIAM J. Comput."
-, volume =	26
-, year =	1997
-, pages =	"1670--1688"
-, succeeds =	"as-ucptd-93"
-, update =	"97.11 aronov"
+, author =      "Boris Aronov and Micha Sharir and Boaz Tagansky"
+, title =       "The Union of Convex Polyhedra in Three Dimensions"
+, journal =     "SIAM J. Comput."
+, volume =      26
+, year =        1997
+, pages =       "1670--1688"
+, succeeds =    "as-ucptd-93"
+, update =      "97.11 aronov"
 }
 
 @article{a-efslc-67
-, author =	"G. Aronsson"
-, title =	"Extensions of functions satisfying {Lipschitz} conditions"
-, journal =	"Arkiv f{\"o}r Matematik"
-, volume =	28
-, year =	1967
-, pages =	"551--561"
-, update =	"98.07 bibrelex"
+, author =      "G. Aronsson"
+, title =       "Extensions of functions satisfying {Lipschitz} conditions"
+, journal =     "Arkiv f{\"o}r Matematik"
+, volume =      28
+, year =        1967
+, pages =       "551--561"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{a-phfcd-94
-, author =	"Gunnar Aronsson"
-, title =	"On $p$-harmonic functions, convex duality and an asymptotic formula for injection mold filling"
-, type =	"Technical {Report}"
-, number =	"LiTH-MAT-R-94-27"
-, institution =	"Link{\"o}ping University"
-, month =	jun
-, year =	1994
-, keywords =	"injection molding, continuous Dijkstra, shortest paths, wavefront propagation"
-, update =	"96.05 mitchell"
+, author =      "Gunnar Aronsson"
+, title =       "On $p$-harmonic functions, convex duality and an asymptotic formula for injection mold filling"
+, type =        "Technical {Report}"
+, number =      "LiTH-MAT-R-94-27"
+, institution = "Link{\"o}ping University"
+, month =       jun
+, year =        1994
+, keywords =    "injection molding, continuous Dijkstra, shortest paths, wavefront propagation"
+, update =      "96.05 mitchell"
 }
 
 @techreport{a-spdfc-95
-, author =	"Gunnar Aronsson"
-, title =	"On some properties of a distance function and a connection to injection molding"
-, type =	"Technical {Report}"
-, number =	"LiTH-MAT-R-95-03"
-, institution =	"Link{\"o}ping University"
-, month =	jan
-, year =	1995
-, keywords =	"injection molding, continuous Dijkstra, geodesic metric, shortest paths, wavefront propagation"
-, update =	"96.05 mitchell"
+, author =      "Gunnar Aronsson"
+, title =       "On some properties of a distance function and a connection to injection molding"
+, type =        "Technical {Report}"
+, number =      "LiTH-MAT-R-95-03"
+, institution = "Link{\"o}ping University"
+, month =       jan
+, year =        1995
+, keywords =    "injection molding, continuous Dijkstra, geodesic metric, shortest paths, wavefront propagation"
+, update =      "96.05 mitchell"
 }
 
 @inproceedings{a-nltas-97
-, author =	"S. Arora"
-, title =	"Nearly Linear Time Approximation Schemes for {Euclidean} {TSP} and Other Geometric Problems"
-, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '97"
-, year =	1997
-, pages =	"554--563"
-, update =	"98.07 bibrelex, 98.03 agarwal+mitchell"
+, author =      "S. Arora"
+, title =       "Nearly Linear Time Approximation Schemes for {Euclidean} {TSP} and Other Geometric Problems"
+, booktitle =   "Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '97"
+, year =        1997
+, pages =       "554--563"
+, update =      "98.07 bibrelex, 98.03 agarwal+mitchell"
 }
 
 @article{a-ptase-98
-, author =	"Sanjeev Arora"
-, title =	"Polynomial time approximation schemes for {Euclidean} traveling salesman and other geometric problems"
-, journal =	"J. ACM"
-, volume =	45
-, number =	5
-, year =	1998
-, pages =	"753--782"
-, update =	"01.04 icking, 00.11 smid, 00.07 agarwal"
+, author =      "Sanjeev Arora"
+, title =       "Polynomial time approximation schemes for {Euclidean} traveling salesman and other geometric problems"
+, journal =     "J. ACM"
+, volume =      45
+, number =      5
+, year =        1998
+, pages =       "753--782"
+, update =      "01.04 icking, 00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{a-ptase-96
-, author =	"Sanjeev Arora"
-, title =	"Polynomial time approximation schemes for {Euclidean} {TSP} and other geometric problems"
-, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1996
-, pages =	"2--11"
-, update =	"01.04 icking, 97.03 agarwal, 96.05 agarwal"
+, author =      "Sanjeev Arora"
+, title =       "Polynomial time approximation schemes for {Euclidean} {TSP} and other geometric problems"
+, booktitle =   "Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1996
+, pages =       "2--11"
+, update =      "01.04 icking, 97.03 agarwal, 96.05 agarwal"
 }
 
 @inproceedings{abss-haolc-93
-, author =	"Sanjeev Arora and L. Babai and J. Stern and Z. Sweedyk"
-, title =	"The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"724--733"
-, update =	"01.04 icking, 98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Sanjeev Arora and L. Babai and J. Stern and Z. Sweedyk"
+, title =       "The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "724--733"
+, update =      "01.04 icking, 98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{agkkw-ptasw-98
-, author =	"Sanjeev Arora and Michelangelo Grigni and David Karger and Philip Klein and Andrzej Woloszyn"
-, title =	"A Polynomial-Time Approximation Scheme for Weighted Planar Graph {TSP}"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"33--41"
-, comments =	"running time {$n^{O(1/\epsilon^2)}$}"
-, update =	"99.07 bibrelex, 98.07 mitchell"
+, author =      "Sanjeev Arora and Michelangelo Grigni and David Karger and Philip Klein and Andrzej Woloszyn"
+, title =       "A Polynomial-Time Approximation Scheme for Weighted Planar Graph {TSP}"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "33--41"
+, comments =    "running time {$n^{O(1/\epsilon^2)}$}"
+, update =      "99.07 bibrelex, 98.07 mitchell"
 }
 
 @incollection{al-ha-97
-, author =	"Sanjeev Arora and Carsten Lund"
-, title =	"Hardness of approximations"
-, editor =	"D. S. Hochbaum"
-, booktitle =	"Approximation Algorithms for NP-Hard Problems"
-, publisher =	"PWS Publishing Company"
-, address =	"Boston, MA"
-, year =	1997
-, pages =	"399--446"
-, update =	"97.07 smid, 97.03 agarwal, 96.09 agarwal"
+, author =      "Sanjeev Arora and Carsten Lund"
+, title =       "Hardness of approximations"
+, editor =      "D. S. Hochbaum"
+, booktitle =   "Approximation Algorithms for NP-Hard Problems"
+, publisher =   "PWS Publishing Company"
+, address =     "Boston, MA"
+, year =        1997
+, pages =       "399--446"
+, update =      "97.07 smid, 97.03 agarwal, 96.09 agarwal"
 }
 
 @techreport{almss-iap-92
-, author =	"S. Arora and C. Lund and R. Motwani and M. Sudan and M. Szegedy"
-, title =	"On the Intractability of Approximation Problems"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "S. Arora and C. Lund and R. Motwani and M. Sudan and M. Szegedy"
+, title =       "On the Intractability of Approximation Problems"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{arr-asekm-98
-, author =	"Sanjeev Arora and Prabhakar Raghavan and Satish Rao"
-, title =	"Approximation schemes for {Euclidean} $k$-median and related problems"
-, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
-, year =	1998
-, pages =	"106--113"
-, update =	"01.04 icking, 98.07 agarwal"
+, author =      "Sanjeev Arora and Prabhakar Raghavan and Satish Rao"
+, title =       "Approximation schemes for {Euclidean} $k$-median and related problems"
+, booktitle =   "Proc. 30th Annu. ACM Sympos. Theory Comput."
+, year =        1998
+, pages =       "106--113"
+, update =      "01.04 icking, 98.07 agarwal"
 }
 
 @inproceedings{arr-ptase-98
-, author =	"S. Arora and P. Raghavan and S. Rao"
-, title =	"Polynomial time approximation schemes for the {Euclidean} {$k$}-medians problem"
-, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
-, year =	1998
-, pages =	"to appear"
-, update =	"98.03 mitchell"
+, author =      "S. Arora and P. Raghavan and S. Rao"
+, title =       "Polynomial time approximation schemes for the {Euclidean} {$k$}-medians problem"
+, booktitle =   "Proc. 30th Annu. ACM Sympos. Theory Comput."
+, year =        1998
+, pages =       "to appear"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ak-mdspl-89
-, author =	"D. Arqu{\`e}s and P. Koch"
-, title =	"Mod{\'e}lisation de solides par les pavages"
-, booktitle =	"Proc. of Pixim '89"
-, site =	"Paris, France"
-, month =	sep
-, year =	1989
-, pages =	"47--61"
-, update =	"98.07 bibrelex"
+, author =      "D. Arqu{\`e}s and P. Koch"
+, title =       "Mod{\'e}lisation de solides par les pavages"
+, booktitle =   "Proc. of Pixim '89"
+, site =        "Paris, France"
+, month =       sep
+, year =        1989
+, pages =       "47--61"
+, update =      "98.07 bibrelex"
 }
 
 @book{a-ocds-89
-, title =	"Optical Computing: Digital and Symbolic"
-, editor =	"R. Arrathoon"
-, publisher =	"Marcel Dekker, Inc."
-, year =	1989
-, keywords =	"angular resolution"
-, update =	"94.05 tamassia"
+, title =       "Optical Computing: Digital and Symbolic"
+, editor =      "R. Arrathoon"
+, publisher =   "Marcel Dekker, Inc."
+, year =        1989
+, keywords =    "angular resolution"
+, update =      "94.05 tamassia"
 }
 
 @book{as-dsdem-92
-, author =	"D. K. Arrowsmith and C. M. Smith"
-, title =	"Dynamical Systems. Differential Equations, Maps, and Chaotic Behavior"
-, publisher =	"Chapman and Hall"
-, address =	"London"
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "D. K. Arrowsmith and C. M. Smith"
+, title =       "Dynamical Systems. Differential Equations, Maps, and Chaotic Behavior"
+, publisher =   "Chapman and Hall"
+, address =     "London"
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @article{afh-tdie3-81
-, author =	"E. Artzy and G. Frieder and G. T. Herman"
-, title =	"The theory, design, implementation, and evaluation of $3$-d surface detection algorithms"
-, journal =	"Comput. Graph. Image Process."
-, volume =	15
-, year =	1981
-, pages =	"1--24"
+, author =      "E. Artzy and G. Frieder and G. T. Herman"
+, title =       "The theory, design, implementation, and evaluation of $3$-d surface detection algorithms"
+, journal =     "Comput. Graph. Image Process."
+, volume =      15
+, year =        1981
+, pages =       "1--24"
 }
 
 @article{ahb-lsft3-87
-, author =	"K. S. Arun and T. S. Huang and S. D. Blostein"
-, title =	"Least squares fitting of two $3$-d point sets"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-9"
-, number =	5
-, month =	sep
-, year =	1987
-, update =	"98.07 bibrelex"
+, author =      "K. S. Arun and T. S. Huang and S. D. Blostein"
+, title =       "Least squares fitting of two $3$-d point sets"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-9"
+, number =      5
+, month =       sep
+, year =        1987
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{akm-hrsss-93
-, author =	"V. Arvind and J. Kobler and M. Mundhenk"
-, title =	"Hausdorff reduction to sparse sets and to sets of high information content"
-, booktitle =	"Proc. 18th Internat. Sympos. Math. Found. Comput. Sci."
-, nickname =	"MFCS '93"
-, year =	1993
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "V. Arvind and J. Kobler and M. Mundhenk"
+, title =       "Hausdorff reduction to sparse sets and to sets of high information content"
+, booktitle =   "Proc. 18th Internat. Sympos. Math. Found. Comput. Sci."
+, nickname =    "MFCS '93"
+, year =        1993
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @book{a-gg2-91
-, title =	"Graphics Gems {II}"
-, editor =	"James Arvo"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1991
-, update =	"98.07 tamassia+vismara"
+, title =       "Graphics Gems {II}"
+, editor =      "James Arvo"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1991
+, update =      "98.07 tamassia+vismara"
 }
 
 @incollection{a-rrm-91
-, author =	"J. Arvo"
-, title =	"Random rotation matrics"
-, editor =	"J. Arvo"
-, booktitle =	"Graphics Gems II"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1991
-, pages =	"355--356"
-, update =	"97.07 orourke"
+, author =      "J. Arvo"
+, title =       "Random rotation matrics"
+, editor =      "J. Arvo"
+, booktitle =   "Graphics Gems II"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1991
+, pages =       "355--356"
+, update =      "97.07 orourke"
 }
 
 @article{a-ijpop-94
-, author =	"J. Arvo"
-, title =	"The irradiance {Jacobian} for partially occluded polyhedral sources"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1994
-, pages =	"343--350"
-, note =	"Proc. SIGGRAPH '94"
-, update =	"98.03 bibrelex"
+, author =      "J. Arvo"
+, title =       "The irradiance {Jacobian} for partially occluded polyhedral sources"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1994
+, pages =       "343--350"
+, note =        "Proc. SIGGRAPH '94"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ak-frtrc-87
-, author =	"J. Arvo and D. Kirk"
-, title =	"Fast ray tracing by ray classification"
-, editor =	"M. C. Stone"
-, booktitle =	"Proc. SIGGRAPH '87"
-, year =	1987
-, pages =	"55--63"
-, update =	"97.11 bibrelex"
+, author =      "J. Arvo and D. Kirk"
+, title =       "Fast ray tracing by ray classification"
+, editor =      "M. C. Stone"
+, booktitle =   "Proc. SIGGRAPH '87"
+, year =        1987
+, pages =       "55--63"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{aksm-agdss-85
-, author =	"A. Arya and A. Kumar and V. Swaminathan and A. Misra"
-, title =	"Automatic Generation of Digital System Schematic Diagrams"
-, booktitle =	"Proc. 22nd Design Autom. Conf."
-, year =	1985
-, pages =	"388--395"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "A. Arya and A. Kumar and V. Swaminathan and A. Misra"
+, title =       "Automatic Generation of Digital System Schematic Diagrams"
+, booktitle =   "Proc. 22nd Design Autom. Conf."
+, year =        1985
+, pages =       "388--395"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{acm-aamtm-98
-, author =	"Sunil Arya and Siu-Wing Cheng and David Mount"
-, title =	"Approximation Algorithms for Multiple-Tool Milling"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"to appear"
-, update =	"98.03 mitchell"
+, author =      "Sunil Arya and Siu-Wing Cheng and David Mount"
+, title =       "Approximation Algorithms for Multiple-Tool Milling"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "to appear"
+, update =      "98.03 mitchell"
 }
 
 @article{acm-aamtm-01
-, author =	"S. Arya and S.-W. Cheng and D. M. Mount"
-, title =	"Approximation Algorithm for Multiple-Tool Milling"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"339--372"
-, update =	"01.07 smid"
+, author =      "S. Arya and S.-W. Cheng and D. M. Mount"
+, title =       "Approximation Algorithm for Multiple-Tool Milling"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "339--372"
+, update =      "01.07 smid"
 }
 
 @inproceedings{admss-esstl-95
-, author =	"S. Arya and G. Das and D. M. Mount and J. S. Salowe and M. Smid"
-, title =	"Euclidean spanners: short, thin, and lanky"
-, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '95"
-, year =	1995
-, pages =	"489--498"
-, update =	"98.07 bibrelex, 97.03 agarwal, 95.09 smid"
+, author =      "S. Arya and G. Das and D. M. Mount and J. S. Salowe and M. Smid"
+, title =       "Euclidean spanners: short, thin, and lanky"
+, booktitle =   "Proc. 27th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '95"
+, year =        1995
+, pages =       "489--498"
+, update =      "98.07 bibrelex, 97.03 agarwal, 95.09 smid"
 }
 
 @inproceedings{amn-abenn-95
-, author =	"S. Arya and D. Mount and O. Narayan"
-, title =	"Accounting for Boundary Effects in Nearest Neighbor Searching"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"336--344"
-, keywords =	""
-, cites =	"am-annqf-93, am-afvq-93, amnsw-oaann-94, bo-ammse-78, b-mbstu-75, c-aacpq-94, c-aafnn-79, fbf-afbml-77, gg-vqsc-91, gt-smmp-60, r-oeapb-74, s-rnns-91, w-bires-71, ZZZ"
-, update =	"98.03 bibrelex, 96.05 agarwal, 95.09 mitchell"
+, author =      "S. Arya and D. Mount and O. Narayan"
+, title =       "Accounting for Boundary Effects in Nearest Neighbor Searching"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "336--344"
+, keywords =    ""
+, cites =       "am-annqf-93, am-afvq-93, amnsw-oaann-94, bo-ammse-78, b-mbstu-75, c-aacpq-94, c-aafnn-79, fbf-afbml-77, gg-vqsc-91, gt-smmp-60, r-oeapb-74, s-rnns-91, w-bires-71, ZZZ"
+, update =      "98.03 bibrelex, 96.05 agarwal, 95.09 mitchell"
 }
 
 @inproceedings{am-afvq-93
-, author =	"S. Arya and D. M. Mount"
-, title =	"Algorithms for Fast Vector Quantization"
-, booktitle =	"Data Compression Conference"
-, nickname =	"DCC '93"
-, publisher =	"IEEE Press"
-, year =	1993
-, pages =	"381--390"
-, update =	"95.09 agarwal, 94.05 smid, 93.09 milone+mitchell"
+, author =      "S. Arya and D. M. Mount"
+, title =       "Algorithms for Fast Vector Quantization"
+, booktitle =   "Data Compression Conference"
+, nickname =    "DCC '93"
+, publisher =   "IEEE Press"
+, year =        1993
+, pages =       "381--390"
+, update =      "95.09 agarwal, 94.05 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{am-annqf-93
-, author =	"S. Arya and D. M. Mount"
-, title =	"Approximate Nearest Neighbor Queries in Fixed Dimensions"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"271--280"
-, update =	"93.05 smid"
+, author =      "S. Arya and D. M. Mount"
+, title =       "Approximate Nearest Neighbor Queries in Fixed Dimensions"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "271--280"
+, update =      "93.05 smid"
 }
 
 @inproceedings{am-ars-95
-, author =	"Sunil Arya and David M. Mount"
-, title =	"Approximate Range Searching"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"172--181"
-, keywords =	"quadtrees, box decomposition trees"
-, cites =	"amnsw-oaann-94, b-kdtsp-90, bcp-hhihr-93, ck-dmdps-92, ck-adcpn-95, c-lbcpr-89, cw-qorss-89, c-faann-83, fm-rpdsa-85, m-rsehc-93, o-plfs-92, ps-cgi-85, s-dasds-90, v-oaann-89, ZZZ"
-, update =	"98.03 bibrelex, 96.05 agarwal, 95.09 mitchell"
+, author =      "Sunil Arya and David M. Mount"
+, title =       "Approximate Range Searching"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "172--181"
+, keywords =    "quadtrees, box decomposition trees"
+, cites =       "amnsw-oaann-94, b-kdtsp-90, bcp-hhihr-93, ck-dmdps-92, ck-adcpn-95, c-lbcpr-89, cw-qorss-89, c-faann-83, fm-rpdsa-85, m-rsehc-93, o-plfs-92, ps-cgi-85, s-dasds-90, v-oaann-89, ZZZ"
+, update =      "98.03 bibrelex, 96.05 agarwal, 95.09 mitchell"
 }
 
 @article{am-ars-00
-, author =	"S. Arya and D. M. Mount"
-, title =	"Approximate range searching"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	17
-, year =	2000
-, pages =	"135--152"
-, update =	"01.04 smid"
+, author =      "S. Arya and D. M. Mount"
+, title =       "Approximate range searching"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      17
+, year =        2000
+, pages =       "135--152"
+, update =      "01.04 smid"
 }
 
 @techreport{amn-abenn-94
-, author =	"S. Arya and D. M. Mount and O. Narayan"
-, title =	"Accounting for boundary effects in nearest neighbor searching"
-, type =	"Report"
-, number =	"MPI-I-94-159"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, update =	"95.01 smid"
+, author =      "S. Arya and D. M. Mount and O. Narayan"
+, title =       "Accounting for boundary effects in nearest neighbor searching"
+, type =        "Report"
+, number =      "MPI-I-94-159"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, update =      "95.01 smid"
 }
 
 @article{amn-abenn-96
-, author =	"S. Arya and D. M. Mount and O. Narayan"
-, title =	"Accounting for boundary effects in nearest-neighbor searching"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, year =	1996
-, pages =	"155--176"
-, update =	"97.03 smid"
+, author =      "S. Arya and D. M. Mount and O. Narayan"
+, title =       "Accounting for boundary effects in nearest-neighbor searching"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, year =        1996
+, pages =       "155--176"
+, update =      "97.03 smid"
 }
 
 @inproceedings{amnsw-oaann-94
-, author =	"S. Arya and D. M. Mount and N. S. Netanyahu and R. Silverman and A. Wu"
-, title =	"An optimal algorithm for approximate nearest neighbor searching"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"573--582"
-, update =	"94.05 smid"
+, author =      "S. Arya and D. M. Mount and N. S. Netanyahu and R. Silverman and A. Wu"
+, title =       "An optimal algorithm for approximate nearest neighbor searching"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "573--582"
+, update =      "94.05 smid"
 }
 
 @article{amnsw-oaann-98
-, author =	"S. Arya and D. M. Mount and N. S. Netanyahu and R. Silverman and A. Wu"
-, title =	"An optimal algorithm for approximate nearest neighbor searching in fixed dimensions"
-, journal =	"J. ACM"
-, volume =	45
-, year =	1998
-, pages =	"891--923"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "S. Arya and D. M. Mount and N. S. Netanyahu and R. Silverman and A. Wu"
+, title =       "An optimal algorithm for approximate nearest neighbor searching in fixed dimensions"
+, journal =     "J. ACM"
+, volume =      45
+, year =        1998
+, pages =       "891--923"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @techreport{ams-dagss-94
-, author =	"S. Arya and D. M. Mount and M. Smid"
-, title =	"Dynamic algorithms for geometric spanners of small diameter: randomized solutions"
-, type =	"Report"
-, number =	"MPI-I-94-156"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, update =	"95.01 smid"
+, author =      "S. Arya and D. M. Mount and M. Smid"
+, title =       "Dynamic algorithms for geometric spanners of small diameter: randomized solutions"
+, type =        "Report"
+, number =      "MPI-I-94-156"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, update =      "95.01 smid"
 }
 
 @article{ams-dagss-99
-, author =	"S. Arya and D. M. Mount and M. Smid"
-, title =	"Dynamic algorithms for geometric spanners of small diameter: {Randomized} solutions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, year =	1999
-, pages =	"91--107"
-, update =	"99.11 smid"
+, author =      "S. Arya and D. M. Mount and M. Smid"
+, title =       "Dynamic algorithms for geometric spanners of small diameter: {Randomized} solutions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, year =        1999
+, pages =       "91--107"
+, update =      "99.11 smid"
 }
 
 @inproceedings{ams-rdags-94
-, author =	"S. Arya and D. M. Mount and M. Smid"
-, title =	"Randomized and deterministic algorithms for geometric spanners of small diameter"
-, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1994
-, pages =	"703--712"
-, update =	"95.01 smid"
+, author =      "S. Arya and D. M. Mount and M. Smid"
+, title =       "Randomized and deterministic algorithms for geometric spanners of small diameter"
+, booktitle =   "Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1994
+, pages =       "703--712"
+, update =      "95.01 smid"
 }
 
 @techreport{as-ecbds-94t
-, author =	"S. Arya and M. Smid"
-, title =	"Efficient construction of a bounded degree spanner with low weight"
-, type =	"Report"
-, number =	"MPI-I-94-115"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, update =	"95.01 smid, 94.05 smid"
+, author =      "S. Arya and M. Smid"
+, title =       "Efficient construction of a bounded degree spanner with low weight"
+, type =        "Report"
+, number =      "MPI-I-94-115"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, update =      "95.01 smid, 94.05 smid"
 }
 
 @inproceedings{as-ecbds-94i
-, author =	"S. Arya and M. Smid"
-, title =	"Efficient construction of a bounded degree spanner with low weight"
-, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
-, nickname =	"ESA '94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"48--59"
-, precedes =	"as-ecbds-97"
-, update =	"97.03 smid, 95.01 smid"
+, author =      "S. Arya and M. Smid"
+, title =       "Efficient construction of a bounded degree spanner with low weight"
+, booktitle =   "Proc. 2nd Annu. European Sympos. Algorithms"
+, nickname =    "ESA '94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "48--59"
+, precedes =    "as-ecbds-97"
+, update =      "97.03 smid, 95.01 smid"
 }
 
 @article{as-ecbds-97
-, author =	"S. Arya and M. Smid"
-, title =	"Efficient construction of a bounded-degree spanner with low weight"
-, journal =	"Algorithmica"
-, volume =	17
-, year =	1997
-, pages =	"33--54"
-, succeeds =	"as-ecbds-94i"
-, update =	"97.03 smid"
+, author =      "S. Arya and M. Smid"
+, title =       "Efficient construction of a bounded-degree spanner with low weight"
+, journal =     "Algorithmica"
+, volume =      17
+, year =        1997
+, pages =       "33--54"
+, succeeds =    "as-ecbds-94i"
+, update =      "97.03 smid"
 }
 
 @article{ab-kawff-85
-, author =	"H. Asada and A. B. By"
-, title =	"Kinematic analysis of workpart fixturing for flexible assembly with automatically reconfigurable fixtures"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	"RA-1"
-, number =	2
-, month =	jun
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "H. Asada and A. B. By"
+, title =       "Kinematic analysis of workpart fixturing for flexible assembly with automatically reconfigurable fixtures"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      "RA-1"
+, number =      2
+, month =       jun
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @book{as-rac-86
-, author =	"H. Asada and J.-J. E. Slotine"
-, title =	"Robot Analysis and Control"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1986
-, update =	"99.11 bibrelex, 97.11 bibrelex"
+, author =      "H. Asada and J.-J. E. Slotine"
+, title =       "Robot Analysis and Control"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1986
+, update =      "99.11 bibrelex, 97.11 bibrelex"
 }
 
 @techreport{a-fafmw-90
-, author =	"T. Asano"
-, title =	"A faster algorithm for finding a maximum weight clique of a circular-arc graph"
-, number =	"90624--OR"
-, institution =	"??"
-, address =	"Bonn"
-, year =	1990
-, keywords =	"circular-arc graph"
-, update =	"98.07 bibrelex, 95.05 korneenko"
+, author =      "T. Asano"
+, title =       "A faster algorithm for finding a maximum weight clique of a circular-arc graph"
+, number =      "90624--OR"
+, institution = "??"
+, address =     "Bonn"
+, year =        1990
+, keywords =    "circular-arc graph"
+, update =      "98.07 bibrelex, 95.05 korneenko"
 }
 
 @techreport{a-oafmc-89
-, author =	"T. Asano"
-, title =	"An optimal algorithm for finding a minimal clique covering of a circular-arc graph"
-, number =	"89619--OR"
-, institution =	"??"
-, address =	"Bonn"
-, year =	1989
-, keywords =	"circular-arc graph"
-, update =	"98.07 bibrelex, 95.05 korneenko"
+, author =      "T. Asano"
+, title =       "An optimal algorithm for finding a minimal clique covering of a circular-arc graph"
+, number =      "89619--OR"
+, institution = "??"
+, address =     "Bonn"
+, year =        1989
+, keywords =    "circular-arc graph"
+, update =      "98.07 bibrelex, 95.05 korneenko"
 }
 
 @article{a-cg-87
-, author =	"T. Asano"
-, title =	"Computational geometry"
-, journal =	"J. Soc. Instrum. Control Eng."
-, volume =	26
-, number =	11
-, year =	1987
-, pages =	"985--994"
-, keywords =	"tutorial"
-, update =	"95.05 korneenko"
+, author =      "T. Asano"
+, title =       "Computational geometry"
+, journal =     "J. Soc. Instrum. Control Eng."
+, volume =      26
+, number =      11
+, year =        1987
+, pages =       "985--994"
+, keywords =    "tutorial"
+, update =      "95.05 korneenko"
 }
 
 @unpublished{a-eafvp
-, author =	"T. Asano"
-, title =	"Efficient algorithms for finding the visibility polygon for a polygonal region with holes"
-, note =	"Manuscript, University of California at Berkeley"
-, precedes =	"a-eafvp-85"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "T. Asano"
+, title =       "Efficient algorithms for finding the visibility polygon for a polygonal region with holes"
+, note =        "Manuscript, University of California at Berkeley"
+, precedes =    "a-eafvp-85"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{a-rcilw-94
-, author =	"T. Asano"
-, title =	"Reporting and Counting Intersections of Lines within a Polygon"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"652--659"
-, update =	"99.11 bibrelex, 97.03 aronov, 96.05 mitchell"
+, author =      "T. Asano"
+, title =       "Reporting and Counting Intersections of Lines within a Polygon"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "652--659"
+, update =      "99.11 bibrelex, 97.03 aronov, 96.05 mitchell"
 }
 
 @article{ackt-eaobi-01
-, author =	"T. Asano and D. Z. Chen and N. Katoh and T. Tokuyama"
-, title =	"Efficient algorithms for optimization-based image segmentation"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"145--166"
-, update =	"01.07 smid"
+, author =      "T. Asano and D. Z. Chen and N. Katoh and T. Tokuyama"
+, title =       "Efficient algorithms for optimization-based image segmentation"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "145--166"
+, update =      "01.07 smid"
 }
 
 @inproceedings{ak-nthld-93
-, author =	"T. Asano and N. Katoh"
-, title =	"Number theory helps line detection in digital images"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"313--322"
-, update =	"97.11 bibrelex"
+, author =      "T. Asano and N. Katoh"
+, title =       "Number theory helps line detection in digital images"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "313--322"
+, update =      "97.11 bibrelex"
 }
 
 @article{ak-vhtld-96
-, author =	"T. Asano and N. Katoh"
-, title =	"Variants for the {Hough} transform for line direction"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"231--252"
-, update =	"96.09 devillers"
+, author =      "T. Asano and N. Katoh"
+, title =       "Variants for the {Hough} transform for line direction"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "231--252"
+, update =      "96.09 devillers"
 }
 
 @article{akt-usdfc-94
-, author =	"T. Asano and N. Katoh and T. Tokuyama"
-, title =	"A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images"
-, journal =	"SIGAL Technical Report of Inform Process. Soc. Japan"
-, volume =	"AL38-7"
-, year =	1994
-, pages =	"49--56"
-, update =	"98.11 bibrelex"
+, author =      "T. Asano and N. Katoh and T. Tokuyama"
+, title =       "A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images"
+, journal =     "SIGAL Technical Report of Inform Process. Soc. Japan"
+, volume =      "AL38-7"
+, year =        1994
+, pages =       "49--56"
+, update =      "98.11 bibrelex"
 }
 
 @article{akt-usdfc-01
-, author =	"T. Asano and N. Katoh and T. Tokuyama"
-, title =	"A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	18
-, year =	2001
-, pages =	"73--93"
-, update =	"01.07 smid"
+, author =      "T. Asano and N. Katoh and T. Tokuyama"
+, title =       "A Unified Scheme for Detecting Fundamental Curves in Binary Edge Images"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      18
+, year =        2001
+, pages =       "73--93"
+, update =      "01.07 smid"
 }
 
 @inproceedings{arww-sfctu-95
-, author =	"T. Asano and T. Roos and P. Widmayer and Emo Welzl"
-, title =	"Space Filling Curves and Their Use in the Design of Geometric Data Structures"
-, booktitle =	"Proc. 2nd Latin Amer. Sympos. Theoret. Informatics"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	911
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"36--48"
-, update =	"98.03 mitchell, 97.03 gaertner+salinger"
+, author =      "T. Asano and T. Roos and P. Widmayer and Emo Welzl"
+, title =       "Space Filling Curves and Their Use in the Design of Geometric Data Structures"
+, booktitle =   "Proc. 2nd Latin Amer. Sympos. Theoret. Informatics"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      911
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "36--48"
+, update =      "98.03 mitchell, 97.03 gaertner+salinger"
 }
 
 @incollection{at-cpabg-93
-, author =	"T. Asano and T. Tokuyama"
-, title =	"Circuit Partitioning Algorithm Based on Geometry Model"
-, editor =	"M. Sarrafzadeh and D. T. Lee"
-, booktitle =	"Algorithmic Aspects of VLSI Layout"
-, series =	"Lecture Notes Series on Computing"
-, volume =	2
-, publisher =	"World Scientific"
-, year =	1993
-, pages =	"199--212"
-, update =	"98.11 bibrelex"
+, author =      "T. Asano and T. Tokuyama"
+, title =       "Circuit Partitioning Algorithm Based on Geometry Model"
+, editor =      "M. Sarrafzadeh and D. T. Lee"
+, booktitle =   "Algorithmic Aspects of VLSI Layout"
+, series =      "Lecture Notes Series on Computing"
+, volume =      2
+, publisher =   "World Scientific"
+, year =        1993
+, pages =       "199--212"
+, update =      "98.11 bibrelex"
 }
 
 @article{at-pcala-94
-, author =	"T. Asano and T. Tokuyama"
-, title =	"Partial construction of an arrangement of lines and its applications to optimal partitioning of bicromatic point set"
-, journal =	"Trans. (E) of IEICE of Japan"
-, volume =	"E77--A"
-, number =	4
-, month =	apr
-, year =	1994
-, update =	"97.03 pocchiola"
+, author =      "T. Asano and T. Tokuyama"
+, title =       "Partial construction of an arrangement of lines and its applications to optimal partitioning of bicromatic point set"
+, journal =     "Trans. (E) of IEICE of Japan"
+, volume =      "E77--A"
+, number =      4
+, month =       apr
+, year =        1994
+, update =      "97.03 pocchiola"
 }
 
 @inproceedings{at-twr-94
-, author =	"T. Asano and T. Tokuyama"
-, title =	"Topological Walk Revisited"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"1--6"
-, cites =	"akt-usdfc-94, at-pcala-94, at-appgm-93, at-cpabg-93, eg-tsa-89, m-ltalp-83, e-acg-87, agt-wat-94, erk-oalla-93, m-ltalp-83, bms-dgc-94, ykii-avoll-88, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "T. Asano and T. Tokuyama"
+, title =       "Topological Walk Revisited"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "1--6"
+, cites =       "akt-usdfc-94, at-pcala-94, at-appgm-93, at-cpabg-93, eg-tsa-89, m-ltalp-83, e-acg-87, agt-wat-94, erk-oalla-93, m-ltalp-83, bms-dgc-94, ykii-avoll-88, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{a-dpi-91
-, author =	"Ta. Asano"
-, title =	"Dynamic Programming on Intervals"
-, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"199--207"
-, precedes =	"a-dpi-93"
-, update =	"96.09 devillers, 96.05 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Ta. Asano"
+, title =       "Dynamic Programming on Intervals"
+, booktitle =   "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "199--207"
+, precedes =    "a-dpi-93"
+, update =      "96.09 devillers, 96.05 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{a-dpi-93
-, author =	"Ta. Asano"
-, title =	"Dynamic Programming on Intervals"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"323--330"
-, keywords =	"Circular-arc graph, clique, dynamic programming, interval graph, segment tree, sequential partition"
-, succeeds =	"a-dpi-91"
-, update =	"96.09 devillers"
+, author =      "Ta. Asano"
+, title =       "Dynamic Programming on Intervals"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "323--330"
+, keywords =    "Circular-arc graph, clique, dynamic programming, interval graph, segment tree, sequential partition"
+, succeeds =    "a-dpi-91"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{aa-mpprt-83
-, author =	"Ta. Asano and Te. Asano"
-, title =	"Minimum partition of polygonal regions into trapezoids"
-, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1983
-, pages =	"233--241"
-, precedes =	"aai-pprt-86"
+, author =      "Ta. Asano and Te. Asano"
+, title =       "Minimum partition of polygonal regions into trapezoids"
+, booktitle =   "Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1983
+, pages =       "233--241"
+, precedes =    "aai-pprt-86"
 }
 
 @inproceedings{aa-vdpsp-87
-, author =	"Ta. Asano and Te. Asano"
-, title =	"{Voronoi} diagram for points in a simple polygon"
-, editor =	"D. S. Johnson"
-, booktitle =	"Discrete Algorithms and Complexity"
-, series =	"Perspectives in Computing"
-, publisher =	"Academic Press"
-, year =	1987
-, pages =	"51--64"
-, update =	"98.03 mitchell, 97.11 bibrelex, 96.05 agarwal"
-, abstract =	"[For the entire collection see Zbl. 636.00011.] The
-		 authors present an algorithm for constructing the
-		 Voronoi diagram (Voronoi triangulation) for a set of n
-		 points in a simple polygon of m vertices. The
-		 complexity of the algorithm is O(mn + m log log m + n
-		 log n) time and O(m + n) space. This algorithm is based
-		 on the recent results of triangulating a simple polygon
-		 [see R. E. Tarjan and C. J. Van Wyk, Proc. 18th Annu.
-		 ACM Sympos. Theory of Computing, Berkeley, California, 380
-		 - 388 (1986); cf. SIAM J. Comput. 17, 143 - 178 (1988;
-		 Zbl. 637.68044)] and of finding shortest paths from a
-		 point to all the vertices of a simple polygon [see L.
-		 Guibas, J. Hershberger, D. Leven, Micha Sharir and R. E.
-		 Tarjan, Proc. 2nd ACM Sympos. Computational Geometry,
-		 Yorktown Heights, New York, 1 - 13 (1986)]. Some
-		 problems which can be efficiently solved with this
-		 algorithm are also specified"
+, author =      "Ta. Asano and Te. Asano"
+, title =       "{Voronoi} diagram for points in a simple polygon"
+, editor =      "D. S. Johnson"
+, booktitle =   "Discrete Algorithms and Complexity"
+, series =      "Perspectives in Computing"
+, publisher =   "Academic Press"
+, year =        1987
+, pages =       "51--64"
+, update =      "98.03 mitchell, 97.11 bibrelex, 96.05 agarwal"
+, abstract =    "[For the entire collection see Zbl. 636.00011.] The
+                 authors present an algorithm for constructing the
+                 Voronoi diagram (Voronoi triangulation) for a set of n
+                 points in a simple polygon of m vertices. The
+                 complexity of the algorithm is O(mn + m log log m + n
+                 log n) time and O(m + n) space. This algorithm is based
+                 on the recent results of triangulating a simple polygon
+                 [see R. E. Tarjan and C. J. Van Wyk, Proc. 18th Annu.
+                 ACM Sympos. Theory of Computing, Berkeley, California, 380
+                 - 388 (1986); cf. SIAM J. Comput. 17, 143 - 178 (1988;
+                 Zbl. 637.68044)] and of finding shortest paths from a
+                 point to all the vertices of a simple polygon [see L.
+                 Guibas, J. Hershberger, D. Leven, Micha Sharir and R. E.
+                 Tarjan, Proc. 2nd ACM Sympos. Computational Geometry,
+                 Yorktown Heights, New York, 1 - 13 (1986)]. Some
+                 problems which can be efficiently solved with this
+                 algorithm are also specified"
 }
 
 @article{aaghi-vdp-86
-, author =	"Ta. Asano and Te. Asano and Leonidas J. Guibas and J. Hershberger and H. Imai"
-, title =	"Visibility of disjoint polygons"
-, journal =	"Algorithmica"
-, volume =	1
-, year =	1986
-, pages =	"49--63"
-, keywords =	"design of algorithms, data structuring, visibility, path planning, geometric transformations, arrangements"
-, succeeds =	"aaghi-vpses-85"
-, update =	"98.03 mitchell"
+, author =      "Ta. Asano and Te. Asano and Leonidas J. Guibas and J. Hershberger and H. Imai"
+, title =       "Visibility of disjoint polygons"
+, journal =     "Algorithmica"
+, volume =      1
+, year =        1986
+, pages =       "49--63"
+, keywords =    "design of algorithms, data structuring, visibility, path planning, geometric transformations, arrangements"
+, succeeds =    "aaghi-vpses-85"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{aaghi-vpses-85
-, author =	"Ta. Asano and Te. Asano and Leonidas J. Guibas and J. Hershberger and H. Imai"
-, title =	"Visibility-polygon search and {Euclidean} shortest paths"
-, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"155--164"
-, precedes =	"aaghi-vdp-86"
-, update =	"98.03 mitchell"
-, annote =	"$O(n^2)$ time and space algorithm builds visibility
-		 graph of polygonal set. Hence $O(n^2)$ shortest path
-		 algorithm."
+, author =      "Ta. Asano and Te. Asano and Leonidas J. Guibas and J. Hershberger and H. Imai"
+, title =       "Visibility-polygon search and {Euclidean} shortest paths"
+, booktitle =   "Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "155--164"
+, precedes =    "aaghi-vdp-86"
+, update =      "98.03 mitchell"
+, annote =      "$O(n^2)$ time and space algorithm builds visibility
+                 graph of polygonal set. Hence $O(n^2)$ shortest path
+                 algorithm."
 }
 
 @article{aai-pprt-86
-, author =	"Ta. Asano and Te. Asano and H. Imai"
-, title =	"Partitioning a Polygonal Region into Trapezoids"
-, journal =	"J. ACM"
-, volume =	33
-, year =	1986
-, pages =	"290--312"
-, keywords =	"decomposition, approximation, dynamic programming, polygon triangulation"
-, succeeds =	"aa-mpprt-83"
-, update =	"93.09 held"
+, author =      "Ta. Asano and Te. Asano and H. Imai"
+, title =       "Partitioning a Polygonal Region into Trapezoids"
+, journal =     "J. ACM"
+, volume =      33
+, year =        1986
+, pages =       "290--312"
+, keywords =    "decomposition, approximation, dynamic programming, polygon triangulation"
+, succeeds =    "aa-mpprt-83"
+, update =      "93.09 held"
 }
 
 @article{aai-spbts-87
-, author =	"Ta. Asano and Te. Asano and H. Imai"
-, title =	"Shortest path between two simple polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	24
-, year =	1987
-, pages =	"285--288"
-, keywords =	"design of algorithms, path planning, geometric transformations, visibility, arrangements"
+, author =      "Ta. Asano and Te. Asano and H. Imai"
+, title =       "Shortest path between two simple polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      24
+, year =        1987
+, pages =       "285--288"
+, keywords =    "design of algorithms, path planning, geometric transformations, visibility, arrangements"
 }
 
 @article{aap-ptem-86
-, author =	"Ta. Asano and Te. Asano and R. Y. Pinter"
-, title =	"Polygon Triangulation: Efficiency and Minimality"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"221--231"
-, keywords =	"lower bounds, design of algorithms, triangulation"
-, update =	"93.09 held"
-, annote =	"Proves lower bound of $\Theta(n\log n)$ for
-		 triangulation of polygons with holes. Dynamic
-		 programming algorithm for minimum number triangulation
-		 where there is a fixed number of holes."
+, author =      "Ta. Asano and Te. Asano and R. Y. Pinter"
+, title =       "Polygon Triangulation: Efficiency and Minimality"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "221--231"
+, keywords =    "lower bounds, design of algorithms, triangulation"
+, update =      "93.09 held"
+, annote =      "Proves lower bound of $\Theta(n\log n)$ for
+                 triangulation of polygons with holes. Dynamic
+                 programming algorithm for minimum number triangulation
+                 where there is a fixed number of holes."
 }
 
 @incollection{aeiim-pubtc-85
-, author =	"Ta. Asano and M. Edahiro and H. Imai and M. Iri and K. Murota"
-, title =	"Practical use of bucketing techniques in computational geometry"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"153--195"
-, keywords =	"survey paper, implementing algorithms, optimization, bucketing, matchings, Voronoi diagrams, range search, point location, shortest paths, quad trees"
+, author =      "Ta. Asano and M. Edahiro and H. Imai and M. Iri and K. Murota"
+, title =       "Practical use of bucketing techniques in computational geometry"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "153--195"
+, keywords =    "survey paper, implementing algorithms, optimization, bucketing, matchings, Voronoi diagrams, range search, point location, shortest paths, quad trees"
 }
 
 @article{ah-ecp-83
-, author =	"Ta. Asano and T. Hirata"
-, title =	"Edge-contraction problems"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	26
-, year =	1983
-, pages =	"197--208"
-, keywords =	"NP-completeness, graph theory"
+, author =      "Ta. Asano and T. Hirata"
+, title =       "Edge-contraction problems"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      26
+, year =        1983
+, pages =       "197--208"
+, keywords =    "NP-completeness, graph theory"
 }
 
 @incollection{aso-cga-86
-, author =	"Ta. Asano and M. Sato and T. Ohtsuki"
-, title =	"Computational geometry algorithms"
-, editor =	"T. Ohtsuki"
-, booktitle =	"Layout Design and Verification"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1986
-, pages =	"295--347"
-, keywords =	"VLSI design, priority search trees, intersection, rectangles"
+, author =      "Ta. Asano and M. Sato and T. Ohtsuki"
+, title =       "Computational geometry algorithms"
+, editor =      "T. Ohtsuki"
+, booktitle =   "Layout Design and Verification"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1986
+, pages =       "295--347"
+, keywords =    "VLSI design, priority search trees, intersection, rectangles"
 }
 
 @techreport{a-ncabb-86
-, author =	"Te. Asano"
-, title =	"A new compaction algorithm for building block {LSI} using block packing technique"
-, type =	"Technical {Report}"
-, number =	"CAS85-158"
-, institution =	"IECE of Japan"
-, year =	1986
+, author =      "Te. Asano"
+, title =       "A new compaction algorithm for building block {LSI} using block packing technique"
+, type =        "Technical {Report}"
+, number =      "CAS85-158"
+, institution = "IECE of Japan"
+, year =        1986
 }
 
 @techreport{a-adild-86
-, author =	"Te. Asano"
-, title =	"Accuracy of digital images of lines and disks"
-, type =	"Technical {Report}"
-, number =	"COMP86-6"
-, institution =	"IECE of Japan"
-, year =	1986
-, keywords =	"design of algorithms, discrete geometry, convex hull, worst-case analysis"
+, author =      "Te. Asano"
+, title =       "Accuracy of digital images of lines and disks"
+, type =        "Technical {Report}"
+, number =      "COMP86-6"
+, institution = "IECE of Japan"
+, year =        1986
+, keywords =    "design of algorithms, discrete geometry, convex hull, worst-case analysis"
 }
 
 @article{a-aceam-86
-, author =	"Te. Asano"
-, title =	"An algorithm for computing every angle of movable separability of two polygons"
-, journal =	"Trans. IECE Japan"
-, volume =	"J69-A"
-, year =	1986
-, pages =	"1162--1165"
-, keywords =	"design of algorithms, visibility, convex hull, path planning"
-, comments =	"in Japanese"
+, author =      "Te. Asano"
+, title =       "An algorithm for computing every angle of movable separability of two polygons"
+, journal =     "Trans. IECE Japan"
+, volume =      "J69-A"
+, year =        1986
+, pages =       "1162--1165"
+, keywords =    "design of algorithms, visibility, convex hull, path planning"
+, comments =    "in Japanese"
 }
 
 @article{a-eackr-85
-, author =	"Te. Asano"
-, title =	"An efficient algorithm for computing the $k$-reachability region from a point"
-, journal =	"Trans. IECE Japan"
-, volume =	"E68"
-, year =	1985
-, pages =	"560--562"
-, keywords =	"design of algorithms, VLSI design, visibility, plane-sweep"
+, author =      "Te. Asano"
+, title =       "An efficient algorithm for computing the $k$-reachability region from a point"
+, journal =     "Trans. IECE Japan"
+, volume =      "E68"
+, year =        1985
+, pages =       "560--562"
+, keywords =    "design of algorithms, VLSI design, visibility, plane-sweep"
 }
 
 @inproceedings{a-eacrp-85
-, author =	"Te. Asano"
-, title =	"An efficient algorithm for computing the reachability polygon from a point: rectilinear case"
-, booktitle =	"Proc. ISCAS"
-, year =	1985
-, pages =	"1293--1296"
+, author =      "Te. Asano"
+, title =       "An efficient algorithm for computing the reachability polygon from a point: rectilinear case"
+, booktitle =   "Proc. ISCAS"
+, year =        1985
+, pages =       "1293--1296"
 }
 
 @article{a-eafrr-85
-, author =	"Te. Asano"
-, title =	"An efficient algorithm for finding the region reachable within $k$ bends"
-, journal =	"Trans. IECE Japan"
-, volume =	"E68"
-, year =	1985
-, pages =	"831--835"
-, keywords =	"design of algorithms, VLSI design, worst-case analysis, visibility"
+, author =      "Te. Asano"
+, title =       "An efficient algorithm for finding the region reachable within $k$ bends"
+, journal =     "Trans. IECE Japan"
+, volume =      "E68"
+, year =        1985
+, pages =       "831--835"
+, keywords =    "design of algorithms, VLSI design, worst-case analysis, visibility"
 }
 
 % also claimed pages = "557--559"
 % independent refce to 557--559. N.K.
 @article{a-eafvp-85
-, author =	"Te. Asano"
-, title =	"An efficient algorithm for finding the visibility polygon for a polygonal region with holes"
-, journal =	"Trans. IECE Japan"
-, volume =	"E68"
-, number =	9
-, year =	1985
-, pages =	"560--562"
-, keywords =	"design of algorithms, computer graphics, reporting, visibility, hidden line/surface elimination, plane-sweep"
-, succeeds =	"a-eafvp"
-, update =	"98.11 bibrelex, 95.05 korneenko"
+, author =      "Te. Asano"
+, title =       "An efficient algorithm for finding the visibility polygon for a polygonal region with holes"
+, journal =     "Trans. IECE Japan"
+, volume =      "E68"
+, number =      9
+, year =        1985
+, pages =       "560--562"
+, keywords =    "design of algorithms, computer graphics, reporting, visibility, hidden line/surface elimination, plane-sweep"
+, succeeds =    "a-eafvp"
+, update =      "98.11 bibrelex, 95.05 korneenko"
 }
 
 @article{a-dsptt-86
-, author =	"Te. Asano"
-, title =	"Dividing a simple polygon into two territories"
-, journal =	"Trans. IECE Japan"
-, volume =	"E69"
-, year =	1986
-, pages =	"521--523"
-, keywords =	"design of algorithms, visibility, decomposition, operations research"
+, author =      "Te. Asano"
+, title =       "Dividing a simple polygon into two territories"
+, journal =     "Trans. IECE Japan"
+, volume =      "E69"
+, year =        1986
+, pages =       "521--523"
+, keywords =    "design of algorithms, visibility, decomposition, operations research"
 }
 
 @article{a-gmpaa-88
-, author =	"Tetsuo Asano"
-, title =	"Generalized {Manhattan} path algorithm with applications"
-, journal =	"Comput. Aided Design"
-, volume =	7
-, number =	7
-, month =	jul
-, year =	1988
-, pages =	"797--804"
+, author =      "Tetsuo Asano"
+, title =       "Generalized {Manhattan} path algorithm with applications"
+, journal =     "Comput. Aided Design"
+, volume =      7
+, number =      7
+, month =       jul
+, year =        1988
+, pages =       "797--804"
 }
 
 @article{a-gcvpr-86
-, author =	"Te. Asano"
-, title =	"Generating and counting valid patterns in routes between two points"
-, journal =	"Graphs Combin."
-, volume =	2
-, year =	1986
-, pages =	"9--13"
-, keywords =	"counting, VLSI design, path planning"
+, author =      "Te. Asano"
+, title =       "Generating and counting valid patterns in routes between two points"
+, journal =     "Graphs Combin."
+, volume =      2
+, year =        1986
+, pages =       "9--13"
+, keywords =    "counting, VLSI design, path planning"
 }
 
 @article{a-mwprb-85
-, author =	"Te. Asano"
-, title =	"On minimum width packing of rectilinear blocks"
-, journal =	"Trans. IECE Japan"
-, volume =	"E68"
-, year =	1985
-, pages =	"647--649"
-, keywords =	"design of algorithms, plane-sweep, graph theory, VLSI design, packing"
+, author =      "Te. Asano"
+, title =       "On minimum width packing of rectilinear blocks"
+, journal =     "Trans. IECE Japan"
+, volume =      "E68"
+, year =        1985
+, pages =       "647--649"
+, keywords =    "design of algorithms, plane-sweep, graph theory, VLSI design, packing"
 }
 
 @article{a-pgr-82
-, author =	"Te. Asano"
-, title =	"Parallel global route"
-, journal =	"Japanese Journal"
-, volume =	23
-, year =	1982
-, pages =	"443--450"
+, author =      "Te. Asano"
+, title =       "Parallel global route"
+, journal =     "Japanese Journal"
+, volume =      23
+, year =        1982
+, pages =       "443--450"
 }
 
 @article{a-rsprs-86
-, author =	"Te. Asano"
-, title =	"Rectilinear shortest paths in a rectilinear simple polygon"
-, journal =	"Trans. IECE Japan"
-, volume =	"E69"
-, number =	6
-, year =	1986
-, pages =	"750--758"
-, keywords =	"design of algorithms, minimum spanning trees, decomposition, point location"
+, author =      "Te. Asano"
+, title =       "Rectilinear shortest paths in a rectilinear simple polygon"
+, journal =     "Trans. IECE Japan"
+, volume =      "E69"
+, number =      6
+, year =        1986
+, pages =       "750--758"
+, keywords =    "design of algorithms, minimum spanning trees, decomposition, point location"
 }
 
 @article{a-rbtp-82
-, author =	"Te. Asano"
-, title =	"Routes between two points"
-, journal =	"Japanese Journal"
-, volume =	23
-, year =	1982
-, pages =	"576--578"
+, author =      "Te. Asano"
+, title =       "Routes between two points"
+, journal =     "Japanese Journal"
+, volume =      23
+, year =        1982
+, pages =       "576--578"
 }
 
 @techreport{a-tlrpl-87
-, author =	"Te. Asano"
-, title =	"Two layer routing problem with large vias"
-, type =	"Technical {Report}"
-, number =	"CAS86-198"
-, institution =	"IECE of Japan"
-, year =	1987
-, keywords =	"design of algorithms, VLSI design, path planning, decomposition, plane-sweep, priority search trees, reporting, point location"
+, author =      "Te. Asano"
+, title =       "Two layer routing problem with large vias"
+, type =        "Technical {Report}"
+, number =      "CAS86-198"
+, institution = "IECE of Japan"
+, year =        1987
+, keywords =    "design of algorithms, VLSI design, path planning, decomposition, plane-sweep, priority search trees, reporting, point location"
 }
 
 @article{aao-pprmn-84
-, author =	"Te. Asano and Ta. Asano and Y. Ohsuga"
-, title =	"Partitioning a polygonal region into a minimum number of triangles"
-, journal =	"Trans. IECE Japan"
-, volume =	"E67"
-, number =	4
-, year =	1984
-, pages =	"232--233"
-, keywords =	"approximation, dynamic programming, triangulation"
+, author =      "Te. Asano and Ta. Asano and Y. Ohsuga"
+, title =       "Partitioning a polygonal region into a minimum number of triangles"
+, journal =     "Trans. IECE Japan"
+, volume =      "E67"
+, number =      4
+, year =        1984
+, pages =       "232--233"
+, keywords =    "approximation, dynamic programming, triangulation"
 }
 
 @inproceedings{abky-cabmm-88
-, author =	"Te. Asano and B. K. Bhattacharya and J. M. Keil and F. Yao"
-, title =	"Clustering algorithms based on minimum and maximum spanning trees"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"252--257"
-, keywords =	"cluster analysis, minimum spanning trees, diameter, partition"
-, cites =	"ahu-daca-74, a-dp-86, b-ccp-77, emprww-sls-82, g-asrp-75, h-ca-75, j-nccog-82, mt-pnadt-82, mpsy-cemst-88, ps-cgi-85, ZZZ"
-, update =	"98.07 agarwal, 98.03 bibrelex"
+, author =      "Te. Asano and B. K. Bhattacharya and J. M. Keil and F. Yao"
+, title =       "Clustering algorithms based on minimum and maximum spanning trees"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "252--257"
+, keywords =    "cluster analysis, minimum spanning trees, diameter, partition"
+, cites =       "ahu-daca-74, a-dp-86, b-ccp-77, emprww-sls-82, g-asrp-75, h-ca-75, j-nccog-82, mt-pnadt-82, mpsy-cemst-88, ps-cgi-85, ZZZ"
+, update =      "98.07 agarwal, 98.03 bibrelex"
 }
 
 @inproceedings{ackt-ptsis-96
-, author =	"Tetsuo Asano and Danny Z. Chen and Naoki Katoh and Takeshi Tokuyama"
-, title =	"Polynomial-time solutions to image segmentation"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"104--113"
-, keywords =	"separation, monotone chains, dynamic programming, probing, computer vision"
-, update =	"96.09 agarwal, 96.01 mitchell"
+, author =      "Tetsuo Asano and Danny Z. Chen and Naoki Katoh and Takeshi Tokuyama"
+, title =       "Polynomial-time solutions to image segmentation"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "104--113"
+, keywords =    "separation, monotone chains, dynamic programming, probing, computer vision"
+, update =      "96.09 agarwal, 96.01 mitchell"
 }
 
 @incollection{ags-vp-00
-, author =	"Tetsuo Asano and Subis K. Ghosh and Thomas C. Shermer"
-, title =	"Visibility in the Plane"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"829--876"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 19 of su-hcg-00"
+, author =      "Tetsuo Asano and Subis K. Ghosh and Thomas C. Shermer"
+, title =       "Visibility in the Plane"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "829--876"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 19 of su-hcg-00"
 }
 
 @inproceedings{agt-wat-91
-, author =	"Te. Asano and Leonidas J. Guibas and T. Tokuyama"
-, title =	"Walking on an arrangement topologically"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"297--306"
-, keywords =	"arrangements, lines"
-, cites =	"at-appgm-90, ce-oails-88, e-acg-87, eg-tsa-89, h-gt-72, m-ltalp-83, ow-nmcvg-88, ykii-avoll-88, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Te. Asano and Leonidas J. Guibas and T. Tokuyama"
+, title =       "Walking on an arrangement topologically"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "297--306"
+, keywords =    "arrangements, lines"
+, cites =       "at-appgm-90, ce-oails-88, e-acg-87, eg-tsa-89, h-gt-72, m-ltalp-83, ow-nmcvg-88, ykii-avoll-88, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{agt-wat-94
-, author =	"Te. Asano and Leonidas J. Guibas and T. Tokuyama"
-, title =	"Walking on an arrangement topologically"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"123--151"
-, keywords =	"arrangements, lines"
-, succeeds =	"agt-wat-91"
-, update =	"98.03 mitchell, 96.05 pocchiola"
+, author =      "Te. Asano and Leonidas J. Guibas and T. Tokuyama"
+, title =       "Walking on an arrangement topologically"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "123--151"
+, keywords =    "arrangements, lines"
+, succeeds =    "agt-wat-91"
+, update =      "98.03 mitchell, 96.05 pocchiola"
 }
 
 @inproceedings{ahpsss-sbcpp-90
-, author =	"Te. Asano and J. Hershberger and J. Pach and E. Sontag and D. Souvaine and S. Suri"
-, title =	"Separating bi-chromatic points by parallel lines"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"46--49"
-, cites =	"ahu-daca-74, b-cmp-88, bh-wsngv-89, b-lgc-74, s-sdbh-89, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Te. Asano and J. Hershberger and J. Pach and E. Sontag and D. Souvaine and S. Suri"
+, title =       "Separating bi-chromatic points by parallel lines"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "46--49"
+, cites =       "ahu-daca-74, b-cmp-88, bh-wsngv-89, b-lgc-74, s-sdbh-89, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{ahii-ulsag-90
-, author =	"Te. Asano and M. E. Houle and H. Imai and K. Imai"
-, title =	"A unified linear-space approach to geometric minimax problems"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"20--23"
-, cites =	"co-gpah-82, hk-cmhdp-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "Te. Asano and M. E. Houle and H. Imai and K. Imai"
+, title =       "A unified linear-space approach to geometric minimax problems"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "20--23"
+, cites =       "co-gpah-82, hk-cmhdp-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{aii-chppm-89
-, author =	"Te. Asano and H. Imai and K. Imai"
-, title =	"Clustering/hashing points in the plane with maxmin criteria"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	15
+, author =      "Te. Asano and H. Imai and K. Imai"
+, title =       "Clustering/hashing points in the plane with maxmin criteria"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       15
 }
 
 @inproceedings{aklr-oamcg-95
-, author =	"Tetsuo Asano and Naoki Katoh and Elena Lodi and Thomas Roos"
-, title =	"Optimal Approximation of Monotone Curves on a Grid"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"37--42"
-, update =	"95.09 jones"
+, author =      "Tetsuo Asano and Naoki Katoh and Elena Lodi and Thomas Roos"
+, title =       "Optimal Approximation of Monotone Curves on a Grid"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "37--42"
+, update =      "95.09 jones"
 }
 
 @inproceedings{aktt-cppkt-97
-, author =	"Te. Asano and N. Katoh and H. Tamaki and T. Tokuyama"
-, title =	"Covering points in the plane by $k$-tours: towards a polynomial time approximation scheme for general $k$"
-, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '97"
-, year =	1997
-, pages =	"275--283"
-, update =	"00.11 smid, 00.07 smid, 98.07 bibrelex, 98.03 smid"
+, author =      "Te. Asano and N. Katoh and H. Tamaki and T. Tokuyama"
+, title =       "Covering points in the plane by $k$-tours: towards a polynomial time approximation scheme for general $k$"
+, booktitle =   "Proc. 29th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '97"
+, year =        1997
+, pages =       "275--283"
+, update =      "00.11 smid, 00.07 smid, 98.07 bibrelex, 98.03 smid"
 }
 
 @inproceedings{aky-domr-96
-, author =	"Tetsuo Asano and David Kirkpatrick and Chee K. Yap"
-, title =	"$d_1$-Optimal Motion for a Rod"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"252--263"
-, cites =	"b-kpso-28, cr-nlbtr-87, csy-aesp3-94, irwy-spls-92, o-fslps-87, ps-oplmo-87, rty-ccrt-94, ss-pmp1c-83, s-npsap-89t, osy-gvdl-86, osy-gvdl-87, u-pmm-64, y-amp-87, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Tetsuo Asano and David Kirkpatrick and Chee K. Yap"
+, title =       "$d_1$-Optimal Motion for a Rod"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "252--263"
+, cites =       "b-kpso-28, cr-nlbtr-87, csy-aesp3-94, irwy-spls-92, o-fslps-87, ps-oplmo-87, rty-ccrt-94, ss-pmp1c-83, s-npsap-89t, osy-gvdl-86, osy-gvdl-87, u-pmm-64, y-amp-87, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @article{arrww-sfcdg-97
-, author =	"Tetsuo Asano and Desh Ranjan and Thomas Roos and Emo Welzl and Peter Widmayer"
-, title =	"Space-Filling Curves and Their Use in the Design of Geometric Data Structures"
-, journal =	"Theoret. Comput. Sci."
-, volume =	181
-, number =	1
-, month =	jul
-, year =	1997
-, pages =	"3--15"
-, update =	"98.03 mitchell"
+, author =      "Tetsuo Asano and Desh Ranjan and Thomas Roos and Emo Welzl and Peter Widmayer"
+, title =       "Space-Filling Curves and Their Use in the Design of Geometric Data Structures"
+, journal =     "Theoret. Comput. Sci."
+, volume =      181
+, number =      1
+, month =       jul
+, year =        1997
+, pages =       "3--15"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{at-appgm-90
-, author =	"Te. Asano and T. Tokuyama"
-, title =	"Algorithms for projecting points to give the most uniform distribution with application to hashing"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"300--309"
+, author =      "Te. Asano and T. Tokuyama"
+, title =       "Algorithms for projecting points to give the most uniform distribution with application to hashing"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "300--309"
 }
 
 @article{at-appgm-93
-, author =	"Te. Asano and T. Tokuyama"
-, title =	"Algorithms for projecting points to give the most uniform distribution with application to hashing"
-, journal =	"Algorithmica"
-, volume =	"??"
-, year =	1993
-, pages =	"572--590"
-, update =	"98.11 bibrelex"
+, author =      "Te. Asano and T. Tokuyama"
+, title =       "Algorithms for projecting points to give the most uniform distribution with application to hashing"
+, journal =     "Algorithmica"
+, volume =      "??"
+, year =        1993
+, pages =       "572--590"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{at-cpagm-91
-, author =	"Te. Asano and T. Tokuyama"
-, title =	"Circuit partitioning algorithms: graph model versus geometry model"
-, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"94--103"
+, author =      "Te. Asano and T. Tokuyama"
+, title =       "Circuit partitioning algorithms: graph model versus geometry model"
+, booktitle =   "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "94--103"
 }
 
 @incollection{at-cgcsp-87
-, author =	"Te. Asano and G. Toussaint"
-, title =	"Computing the Geodesic Center of a Simple Polygon"
-, editor =	"D. S. Johnson"
-, booktitle =	"Discrete Algorithms and Complexity"
-, series =	"Perspectives in Computing"
-, publisher =	"Academic Press"
-, year =	1987
-, pages =	"65--79"
-, update =	"97.11 bibrelex, 95.05 korneenko, 93.09 held"
+, author =      "Te. Asano and G. Toussaint"
+, title =       "Computing the Geodesic Center of a Simple Polygon"
+, editor =      "D. S. Johnson"
+, booktitle =   "Discrete Algorithms and Complexity"
+, series =      "Perspectives in Computing"
+, publisher =   "Academic Press"
+, year =        1987
+, pages =       "65--79"
+, update =      "97.11 bibrelex, 95.05 korneenko, 93.09 held"
 }
 
 @techreport{at-cgcsp-86
-, author =	"Te. Asano and G. T. Toussaint"
-, title =	"Computing the geodesic center of a simple polygon"
-, type =	"Technical {Report}"
-, number =	"COMP86-24"
-, institution =	"IECE of Japan"
-, year =	1986
+, author =      "Te. Asano and G. T. Toussaint"
+, title =       "Computing the geodesic center of a simple polygon"
+, type =        "Technical {Report}"
+, number =      "COMP86-24"
+, institution = "IECE of Japan"
+, year =        1986
 }
 
 @techreport{au-sacvp-86
-, author =	"Te. Asano and H. Umeo"
-, title =	"Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region"
-, type =	"Technical {Report}"
-, number =	"COMP86-7"
-, institution =	"IECE of Japan"
-, year =	1986
-, keywords =	"parallel computation, design of algorithms, visibility, triangulation"
-, precedes =	"au-sacvp-88"
+, author =      "Te. Asano and H. Umeo"
+, title =       "Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region"
+, type =        "Technical {Report}"
+, number =      "COMP86-7"
+, institution = "IECE of Japan"
+, year =        1986
+, keywords =    "parallel computation, design of algorithms, visibility, triangulation"
+, precedes =    "au-sacvp-88"
 }
 
 @inproceedings{au-sacvp-87
-, author =	"Te. Asano and H. Umeo"
-, title =	"Systolic Algorithms for Computing the Visibility Polygon and Triangulation of a Polygonal Region"
-, editor =	"A. Albrecht and H. Jung and K. Mehlhorn"
-, booktitle =	"Parallel Algorithms and Architectures"
-, publisher =	"Akademie-Verlag Berlin"
-, month =	may
-, year =	1987
-, pages =	"77--85"
-, update =	"93.09 held"
+, author =      "Te. Asano and H. Umeo"
+, title =       "Systolic Algorithms for Computing the Visibility Polygon and Triangulation of a Polygonal Region"
+, editor =      "A. Albrecht and H. Jung and K. Mehlhorn"
+, booktitle =   "Parallel Algorithms and Architectures"
+, publisher =   "Akademie-Verlag Berlin"
+, month =       may
+, year =        1987
+, pages =       "77--85"
+, update =      "93.09 held"
 }
 
 @article{au-sacvp-88
-, author =	"Te. Asano and H. Umeo"
-, title =	"Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region"
-, journal =	"Parallel Comput."
-, volume =	6
-, number =	2
-, year =	1988
-, pages =	"209--216"
-, succeeds =	"au-sacvp-86"
-, abstract =	"Many geometrical problems have been shown to require
-		 at least O(n log n) computer time in the worst case. A
-		 problem of this kind is the following: Given a
-		 polygonal domain with (polygonal) holes and a point q
-		 in its interior, find the vertices of the boundary that
-		 are visible from q. Since the problem is almost solved
-		 when the rays from q to the vertices are sorted
-		 according to their direction, it follows that one has
-		 the n log n-asymptotics. Now the computer time can be
-		 reduced to const. n, if O(n) processors are organized
-		 as a one-dimensional systolic array. Each processor
-		 cell needs only to communicate with its two neighbours.
-		 The communication links with the outside are located at
-		 the ends of the array. The essential step is the
-		 following. In each processor only an amount of
-		 information which is independent of n is needed. Also
-		 each vertex ``who is sent through the systolic array''
-		 may carry an amount of information which does not
-		 depend on n. It is described how this is possible.
-		 Another problem which fits into this framework is often
-		 encountered in CAD. Which part of a polygonal body is
-		 visible? A subdivision of a polygonal domain into a
-		 minimal set of triangles is also treated"
+, author =      "Te. Asano and H. Umeo"
+, title =       "Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region"
+, journal =     "Parallel Comput."
+, volume =      6
+, number =      2
+, year =        1988
+, pages =       "209--216"
+, succeeds =    "au-sacvp-86"
+, abstract =    "Many geometrical problems have been shown to require
+                 at least O(n log n) computer time in the worst case. A
+                 problem of this kind is the following: Given a
+                 polygonal domain with (polygonal) holes and a point q
+                 in its interior, find the vertices of the boundary that
+                 are visible from q. Since the problem is almost solved
+                 when the rays from q to the vertices are sorted
+                 according to their direction, it follows that one has
+                 the n log n-asymptotics. Now the computer time can be
+                 reduced to const. n, if O(n) processors are organized
+                 as a one-dimensional systolic array. Each processor
+                 cell needs only to communicate with its two neighbours.
+                 The communication links with the outside are located at
+                 the ends of the array. The essential step is the
+                 following. In each processor only an amount of
+                 information which is independent of n is needed. Also
+                 each vertex ``who is sent through the systolic array''
+                 may carry an amount of information which does not
+                 depend on n. It is described how this is possible.
+                 Another problem which fits into this framework is often
+                 encountered in CAD. Which part of a polygonal body is
+                 visible? A subdivision of a polygonal domain into a
+                 minimal set of triangles is also treated"
 }
 
 @incollection{abbgotwz-fds-93
-, author =	"B. Asberg and G. Blanco and P. Bose and J. Garcia-Lopez and M. Overmars and G. Toussaint and G. Wilfong and B. Zhu"
-, title =	"Feasibility of Design in Stereolithography"
-, booktitle =	"Proc. 13th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	761
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"228--237"
-, update =	"97.11 smid"
+, author =      "B. Asberg and G. Blanco and P. Bose and J. Garcia-Lopez and M. Overmars and G. Toussaint and G. Wilfong and B. Zhu"
+, title =       "Feasibility of Design in Stereolithography"
+, booktitle =   "Proc. 13th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      761
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "228--237"
+, update =      "97.11 smid"
 }
 
 @article{abbgotwz-fds-97
-, author =	"B. Asberg and G. Blanco and P. Bose and J. Garcia-Lopez and M. Overmars and G. Toussaint and G. Wilfong and B. Zhu"
-, title =	"Feasibility of Design in Stereolithography"
-, journal =	"Algorithmica"
-, volume =	19
-, number =	"1--2"
-, month =	sep
-, year =	1997
-, pages =	"61--83"
-, update =	"97.07 held"
+, author =      "B. Asberg and G. Blanco and P. Bose and J. Garcia-Lopez and M. Overmars and G. Toussaint and G. Wilfong and B. Zhu"
+, title =       "Feasibility of Design in Stereolithography"
+, journal =     "Algorithmica"
+, volume =      19
+, number =      "1--2"
+, month =       sep
+, year =        1997
+, pages =       "61--83"
+, update =      "97.07 held"
 }
 
 @incollection{am-iw81c-82
-, author =	"F. Aschim and B. M. Mostue"
-, title =	"{IFIP} {WG} 8.1 Case Solved Using {SYSDOC} and {SYSTEMATOR}"
-, editor =	"T. W. Olle and H. G. Sol and A. A. Verrijn-Stuart"
-, booktitle =	"Information Systems Design Methodologies: A Comparative Review"
-, publisher =	"North-Holland"
-, address =	"New York, NY"
-, year =	1982
-, pages =	"15--40"
-, keywords =	"graph drawing"
-, update =	"97.11 bibrelex, 93.09 tamassia"
+, author =      "F. Aschim and B. M. Mostue"
+, title =       "{IFIP} {WG} 8.1 Case Solved Using {SYSDOC} and {SYSTEMATOR}"
+, editor =      "T. W. Olle and H. G. Sol and A. A. Verrijn-Stuart"
+, booktitle =   "Information Systems Design Methodologies: A Comparative Review"
+, publisher =   "North-Holland"
+, address =     "New York, NY"
+, year =        1982
+, pages =       "15--40"
+, keywords =    "graph drawing"
+, update =      "97.11 bibrelex, 93.09 tamassia"
 }
 
 @incollection{abcw-cpdts-88
-, author =	"Peter Ash and Ethan Bolker and Henry Crapo and Walter Whiteley"
-, title =	"Convex Polyhedra, {Dirichlet} Tessellations, and Spider Webs"
-, chapter =	17
-, editor =	"Marjorie Senechal and George Fleck"
-, booktitle =	"Shaping Space: A Polyhedral Approach"
-, publisher =	"Birkh{\"a}user"
-, address =	"Boston, MA"
-, year =	1988
-, pages =	"231--250"
-, update =	"93.09 rote"
-, annote =	"Plane pictures of 3d convex polyhedra, plane sections
-		 of 3d Vds and flat spider webs under tension are all
-		 the same."
+, author =      "Peter Ash and Ethan Bolker and Henry Crapo and Walter Whiteley"
+, title =       "Convex Polyhedra, {Dirichlet} Tessellations, and Spider Webs"
+, chapter =     17
+, editor =      "Marjorie Senechal and George Fleck"
+, booktitle =   "Shaping Space: A Polyhedral Approach"
+, publisher =   "Birkh{\"a}user"
+, address =     "Boston, MA"
+, year =        1988
+, pages =       "231--250"
+, update =      "93.09 rote"
+, annote =      "Plane pictures of 3d convex polyhedra, plane sections
+                 of 3d Vds and flat spider webs under tension are all
+                 the same."
 }
 
 @article{ab-gdt-86
-, author =	"Peter F. Ash and Ethan D. Bolker"
-, title =	"Generalized {Dirichlet} Tessellations"
-, journal =	"Geom. Dedicata"
-, volume =	20
-, year =	1986
-, pages =	"209--243"
-, update =	"93.09 rote"
-, annote =	"Gives conditions for a planar tessellations to be a
-		 generalized Voronoi diagram. Generalized distance from
-		 a site is $\phi(|X-P|)+w(P)$ where $\phi$ is increasing."
+, author =      "Peter F. Ash and Ethan D. Bolker"
+, title =       "Generalized {Dirichlet} Tessellations"
+, journal =     "Geom. Dedicata"
+, volume =      20
+, year =        1986
+, pages =       "209--243"
+, update =      "93.09 rote"
+, annote =      "Gives conditions for a planar tessellations to be a
+                 generalized Voronoi diagram. Generalized distance from
+                 a site is $\phi(|X-P|)+w(P)$ where $\phi$ is increasing."
 }
 
 @article{ab-rdt-85
-, author =	"Peter F. Ash and Ethan D. Bolker"
-, title =	"Recognizing {Dirichlet} Tessellations"
-, journal =	"Geom. Dedicata"
-, volume =	19
-, year =	1985
-, pages =	"175--206"
-, keywords =	"Voronoi diagrams"
-, annote =	"Gives conditions for a planar tessellation to be a
-		 Voronoi diagram"
+, author =      "Peter F. Ash and Ethan D. Bolker"
+, title =       "Recognizing {Dirichlet} Tessellations"
+, journal =     "Geom. Dedicata"
+, volume =      19
+, year =        1985
+, pages =       "175--206"
+, keywords =    "Voronoi diagrams"
+, annote =      "Gives conditions for a planar tessellation to be a
+                 Voronoi diagram"
 }
 
 @techreport{a-brep-96
-, author =	"Ian Ashdown"
-, title =	"{B-REP96.TXT}"
-, institution =	"Ledalite Architectural Products"
-, address =	"Vancouver, BC"
-, month =	jan
-, year =	1996
-, url =	"http://www.ledalite.com/library/cgis.html"
-, keywords =	"bibliography, computer graphics, winged edge, edge-based boundary representations"
-, comments =	"A comprehensive bibliography of edge-based boundary
+, author =      "Ian Ashdown"
+, title =       "{B-REP96.TXT}"
+, institution = "Ledalite Architectural Products"
+, address =     "Vancouver, BC"
+, month =       jan
+, year =        1996
+, url = "http://www.ledalite.com/library/cgis.html"
+, keywords =    "bibliography, computer graphics, winged edge, edge-based boundary representations"
+, comments =    "A comprehensive bibliography of edge-based boundary
 representation (e.g., winged edge) papers, theses, articles, and books.
 39 references."
-, update =	"96.01 ashdown"
+, update =      "96.01 ashdown"
 }
 
 @techreport{a-cquan-96
-, author =	"Ian Ashdown"
-, title =	"{CQUANT96.TXT}"
-, institution =	"Ledalite Architectural Products"
-, address =	"Vancouver, BC"
-, month =	jan
-, year =	1996
-, url =	"http://www.ledalite.com/library/cgis.html"
-, keywords =	"bibliography, computer graphics, color quantization, dynamic palettes"
-, comments =	"A comprehensive bibliography of color quantization
+, author =      "Ian Ashdown"
+, title =       "{CQUANT96.TXT}"
+, institution = "Ledalite Architectural Products"
+, address =     "Vancouver, BC"
+, month =       jan
+, year =        1996
+, url = "http://www.ledalite.com/library/cgis.html"
+, keywords =    "bibliography, computer graphics, color quantization, dynamic palettes"
+, comments =    "A comprehensive bibliography of color quantization
 algorithms.  91 references."
-, update =	"96.01 ashdown"
+, update =      "96.01 ashdown"
 }
 
 @techreport{a-radbi-96
-, author =	"Ian Ashdown"
-, title =	"{RADBIB96.TXT}"
-, institution =	"Ledalite Architectural Products"
-, address =	"Vancouver, BC"
-, month =	jan
-, year =	1996
-, url =	"http://www.ledalite.com/library/rrt.html"
-, keywords =	"bibliography, computer graphics, radiosity, global illumination, form factors"
-, comments =	"A comprehensive bibliography of radiosity and related
+, author =      "Ian Ashdown"
+, title =       "{RADBIB96.TXT}"
+, institution = "Ledalite Architectural Products"
+, address =     "Vancouver, BC"
+, month =       jan
+, year =        1996
+, url = "http://www.ledalite.com/library/rrt.html"
+, keywords =    "bibliography, computer graphics, radiosity, global illumination, form factors"
+, comments =    "A comprehensive bibliography of radiosity and related
 global illumination papers, theses, articles, and books.  904 references."
-, update =	"96.05 jones, 96.01 ashdown"
+, update =      "96.05 jones, 96.01 ashdown"
 }
 
 @incollection{ah-afopb-87
-, author =	"J. Ashton and D. Hoang"
-, title =	"An algorithm for finding optimal paths between points while avoiding polyhedral obstacles"
-, booktitle =	"Towards 3 Generation Robotics. Proc. 3rd Internat. Conf. Adv. Robotics"
-, publisher =	"Springer"
-, address =	"France"
-, year =	1987
-, pages =	"307--312"
-, keywords =	"motion planning, polyhedra, three-dimensional"
-, update =	"95.05 korneenko"
+, author =      "J. Ashton and D. Hoang"
+, title =       "An algorithm for finding optimal paths between points while avoiding polyhedral obstacles"
+, booktitle =   "Towards 3 Generation Robotics. Proc. 3rd Internat. Conf. Adv. Robotics"
+, publisher =   "Springer"
+, address =     "France"
+, year =        1987
+, pages =       "307--312"
+, keywords =    "motion planning, polyhedra, three-dimensional"
+, update =      "95.05 korneenko"
 }
 
 @article{a-gttvmd-85
-, author =	"D. Asimov"
-, title =	"The {Grand Tour}: {A} tool for viewing multidimensional data"
-, journal =	"SIAM J. Sci. Statist. Comput."
-, volume =	6
-, year =	1985
-, pages =	"128--143"
-, update =	"97.07 orourke"
+, author =      "D. Asimov"
+, title =       "The {Grand Tour}: {A} tool for viewing multidimensional data"
+, journal =     "SIAM J. Sci. Statist. Comput."
+, volume =      6
+, year =        1985
+, pages =       "128--143"
+, update =      "97.07 orourke"
 }
 
 @article{ar-rg-78
-, author =	"L. Asimov and B. Roth"
-, title =	"The rigidity of graphs"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	245
-, year =	1978
-, pages =	"279--289"
-, keywords =	"rigidity"
-, update =	"95.05 korneenko"
+, author =      "L. Asimov and B. Roth"
+, title =       "The rigidity of graphs"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      245
+, year =        1978
+, pages =       "279--289"
+, keywords =    "rigidity"
+, update =      "95.05 korneenko"
 }
 
 @article{ar-rg2-79
-, author =	"L. Asimov and B. Roth"
-, title =	"The rigidity of graphs, 2"
-, journal =	"J. Math. Anal. Appl."
-, volume =	68
-, year =	1979
-, pages =	"171--190"
-, keywords =	"rigidity"
-, update =	"95.05 korneenko"
+, author =      "L. Asimov and B. Roth"
+, title =       "The rigidity of graphs, 2"
+, journal =     "J. Math. Anal. Appl."
+, volume =      68
+, year =        1979
+, pages =       "171--190"
+, keywords =    "rigidity"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{ah-wfdsa-90
-, author =	"J. Aspnes and M. Herlihy"
-, title =	"Wait-free data structures in the asynchronous {PRAM} model"
-, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
-, year =	1990
-, pages =	"340--349"
-, update =	"96.09 orourke"
+, author =      "J. Aspnes and M. Herlihy"
+, title =       "Wait-free data structures in the asynchronous {PRAM} model"
+, booktitle =   "Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
+, year =        1990
+, pages =       "340--349"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{as-ptass-79
-, author =	"B. Aspvall and Y. Shiloac"
-, title =	"A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality"
-, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1979
-, update =	"97.11 bibrelex"
+, author =      "B. Aspvall and Y. Shiloac"
+, title =       "A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality"
+, booktitle =   "Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1979
+, update =      "97.11 bibrelex"
 }
 
 @techreport{aa-vdpsp-
-, author =	"T. Assano and T. Assano"
-, title =	"Voronoi diagram for points in a simple polygon"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
-, update =	"98.03 bibrelex"
+, author =      "T. Assano and T. Assano"
+, title =       "Voronoi diagram for points in a simple polygon"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
+, update =      "98.03 bibrelex"
 }
 
 @article{a-ded-83
-, author =	"P. Assouad"
-, title =	"Densit\'e et dimension"
-, journal =	"Ann. Inst. Fourier, Grenoble"
-, volume =	3
-, year =	1983
-, pages =	"232--282"
-, update =	"96.09 orourke"
+, author =      "P. Assouad"
+, title =       "Densit\'e et dimension"
+, journal =     "Ann. Inst. Fourier, Grenoble"
+, volume =      3
+, year =        1983
+, pages =       "232--282"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{ac-proap-93i
-, author =	"M. Atallah and D. Chen"
-, title =	"On parallel rectilinear obstacle-avoiding paths"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"210--215"
-, precedes =	"ac-proap-93a"
-, cites =	"ap-nsmma-88, aalm-epase-90, ac-prspr-91, acg-cdctd-89, ak-eparm-91, b-pegae-74, c-pms-88, rlw-rsppr-89, em-osrqa-91, nllw-xchsx-83, ZZZ"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 96.09 devillers, 93.09 milone+mitchell"
+, author =      "M. Atallah and D. Chen"
+, title =       "On parallel rectilinear obstacle-avoiding paths"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "210--215"
+, precedes =    "ac-proap-93a"
+, cites =       "ap-nsmma-88, aalm-epase-90, ac-prspr-91, acg-cdctd-89, ak-eparm-91, b-pegae-74, c-pms-88, rlw-rsppr-89, em-osrqa-91, nllw-xchsx-83, ZZZ"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 96.09 devillers, 93.09 milone+mitchell"
 }
 
 @article{ac-proap-93a
-, author =	"M. Atallah and D. Chen"
-, title =	"On parallel rectilinear obstacle-avoiding paths"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"307--313"
-, succeeds =	"ac-proap-93i"
-, update =	"98.03 mitchell, 97.11 bibrelex, 96.09 devillers"
-, annote =	"They improve the results of \cite{ac-prspr-91}, to give
+, author =      "M. Atallah and D. Chen"
+, title =       "On parallel rectilinear obstacle-avoiding paths"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "307--313"
+, succeeds =    "ac-proap-93i"
+, update =      "98.03 mitchell, 97.11 bibrelex, 96.09 devillers"
+, annote =      "They improve the results of \cite{ac-prspr-91}, to give
 a CREW algorithm using $O(n^2/\log n)$ processors (versus
 earlier bound of $O(n^2)$), $O(\log^2 n)$ time,
 and $O(n^2)$ space (versus earlier bound of $O(n^2\log^2 n)$).
@@ -11081,1771 +11081,1771 @@ @article{ac-proap-93a
 }
 
 @incollection{a-fpams-90
-, author =	"M. J. Atallah"
-, title =	"A faster parallel algorithm for a matrix searching problem"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, year =	1990
-, pages =	"192--200"
-, keywords =	"matrix searching, parallel computation"
-, update =	"95.05 korneenko"
+, author =      "M. J. Atallah"
+, title =       "A faster parallel algorithm for a matrix searching problem"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, year =        1990
+, pages =       "192--200"
+, keywords =    "matrix searching, parallel computation"
+, update =      "95.05 korneenko"
 }
 
 @article{a-ltahd-83
-, author =	"M. J. Atallah"
-, title =	"A linear time algorithm for the {Hausdorff} distance between convex polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	17
-, year =	1983
-, pages =	"207--209"
+, author =      "M. J. Atallah"
+, title =       "A linear time algorithm for the {Hausdorff} distance between convex polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      17
+, year =        1983
+, pages =       "207--209"
 }
 
 @article{a-mpp-85
-, author =	"M. J. Atallah"
-, title =	"A matching problem in the plane"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	31
-, year =	1985
-, pages =	"63--70"
+, author =      "M. J. Atallah"
+, title =       "A matching problem in the plane"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      31
+, year =        1985
+, pages =       "63--70"
 }
 
 @article{a-cspf-84
-, author =	"M. J. Atallah"
-, title =	"Checking similarity of planar figures"
-, journal =	"Internat. J. Comput. Inform. Sci."
-, volume =	13
-, year =	1984
-, pages =	"279--290"
+, author =      "M. J. Atallah"
+, title =       "Checking similarity of planar figures"
+, journal =     "Internat. J. Comput. Inform. Sci."
+, volume =      13
+, year =        1984
+, pages =       "279--290"
 }
 
 @article{a-cchli-86
-, author =	"M. J. Atallah"
-, title =	"Computing the convex hull of line intersections"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"285--288"
+, author =      "M. J. Atallah"
+, title =       "Computing the convex hull of line intersections"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "285--288"
 }
 
 @inproceedings{a-dcg-83
-, author =	"M. J. Atallah"
-, title =	"Dynamic computational geometry"
-, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1983
-, pages =	"92--99"
-, precedes =	"a-sdcgp-85"
+, author =      "M. J. Atallah"
+, title =       "Dynamic computational geometry"
+, booktitle =   "Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1983
+, pages =       "92--99"
+, precedes =    "a-sdcgp-85"
 }
 
 @article{a-sd-85
-, author =	"M. J. Atallah"
-, title =	"On symmetry detection"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-34"
-, year =	1985
-, pages =	"663--666"
+, author =      "M. J. Atallah"
+, title =       "On symmetry detection"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-34"
+, year =        1985
+, pages =       "663--666"
 }
 
 @article{a-ptcg-92
-, author =	"M. J. Atallah"
-, title =	"Parallel techniques for computational geometry"
-, journal =	"Proc. IEEE"
-, volume =	80
-, number =	9
-, month =	sep
-, year =	1992
-, pages =	"1435--1448"
-, keywords =	"survey paper"
+, author =      "M. J. Atallah"
+, title =       "Parallel techniques for computational geometry"
+, journal =     "Proc. IEEE"
+, volume =      80
+, number =      9
+, month =       sep
+, year =        1992
+, pages =       "1435--1448"
+, keywords =    "survey paper"
 }
 
 @article{a-sdcgp-85
-, author =	"M. J. Atallah"
-, title =	"Some dynamic computational geometry problems"
-, journal =	"Comput. Math. Appl."
-, volume =	11
-, number =	12
-, year =	1985
-, pages =	"1171--1181"
-, succeeds =	"a-dcg-83"
-, update =	"98.11 bibrelex"
+, author =      "M. J. Atallah"
+, title =       "Some dynamic computational geometry problems"
+, journal =     "Comput. Math. Appl."
+, volume =      11
+, number =      12
+, year =        1985
+, pages =       "1171--1181"
+, succeeds =    "a-dcg-83"
+, update =      "98.11 bibrelex"
 }
 
 @article{ab-eact-87
-, author =	"M. J. Atallah and C. Bajaj"
-, title =	"Efficient algorithms for common transversals"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"87--91"
+, author =      "M. J. Atallah and C. Bajaj"
+, title =       "Efficient algorithms for common transversals"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "87--91"
 }
 
 @inproceedings{acg-pcgp-90
-, author =	"M. J. Atallah and P. Callahan and M. T. Goodrich"
-, title =	"{$P$}-complete geometric problems"
-, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
-, year =	1990
-, pages =	"317--326"
-, precedes =	"acg-pcgp-93"
-, update =	"96.09 devillers"
+, author =      "M. J. Atallah and P. Callahan and M. T. Goodrich"
+, title =       "{$P$}-complete geometric problems"
+, booktitle =   "Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
+, year =        1990
+, pages =       "317--326"
+, precedes =    "acg-pcgp-93"
+, update =      "96.09 devillers"
 }
 
 @article{acg-pcgp-93
-, author =	"M. J. Atallah and P. Callahan and M. T. Goodrich"
-, title =	"{$P$}-complete geometric problems"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"443--462"
-, keywords =	"computational geometry, complexity, P-completeness, parallel algorithms"
-, succeeds =	"acg-pcgp-90"
-, update =	"96.09 devillers"
+, author =      "M. J. Atallah and P. Callahan and M. T. Goodrich"
+, title =       "{$P$}-complete geometric problems"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "443--462"
+, keywords =    "computational geometry, complexity, P-completeness, parallel algorithms"
+, succeeds =    "acg-pcgp-90"
+, update =      "96.09 devillers"
 }
 
 @article{ac-opamc-89
-, author =	"M. J. Atallah and D. Z. Chen"
-, title =	"An optimal parallel algorithm for the minimum circle-cover problem"
-, journal =	"Inform. Process. Lett."
-, volume =	34
-, number =	4
-, year =	1989
-, pages =	"159--165"
-, update =	"96.09 orourke"
+, author =      "M. J. Atallah and D. Z. Chen"
+, title =       "An optimal parallel algorithm for the minimum circle-cover problem"
+, journal =     "Inform. Process. Lett."
+, volume =      34
+, number =      4
+, year =        1989
+, pages =       "159--165"
+, update =      "96.09 orourke"
 }
 
 @article{ac-caplc-95
-, author =	"M. J. Atallah and D. Z. Chen"
-, title =	"Computing the all-pairs longest chains in the plane"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"257--271"
-, keywords =	"computational geometry, CREW PRAM, increasing chains, longest paths, Monge matrices, parallel algorithms, sequential algorithms"
-, update =	"96.09 devillers"
+, author =      "M. J. Atallah and D. Z. Chen"
+, title =       "Computing the all-pairs longest chains in the plane"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "257--271"
+, keywords =    "computational geometry, CREW PRAM, increasing chains, longest paths, Monge matrices, parallel algorithms, sequential algorithms"
+, update =      "96.09 devillers"
 }
 
 @incollection{ac-dpcg-00
-, author =	"Mikhail J. Atallah and Danny Z. Chen"
-, title =	"Deterministic Parallel Computational Geometry"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"155--200"
-, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 4 of su-hcg-00"
+, author =      "Mikhail J. Atallah and Danny Z. Chen"
+, title =       "Deterministic Parallel Computational Geometry"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "155--200"
+, update =      "00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 4 of su-hcg-00"
 }
 
 @article{ac-crbrp-01
-, author =	"M. J. Atallah and D. Z. Chen"
-, title =	"On connecting red and blue rectilinear polygonal obstacles with nonintersecting monotone rectilinear paths"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"373--400"
-, update =	"01.11 smid"
+, author =      "M. J. Atallah and D. Z. Chen"
+, title =       "On connecting red and blue rectilinear polygonal obstacles with nonintersecting monotone rectilinear paths"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "373--400"
+, update =      "01.11 smid"
 }
 
 @inproceedings{ac-opavs-89
-, author =	"M. J. Atallah and D. Z. Chen"
-, title =	"Optimal parallel algorithm for visibility of a simple polygon from a p oint"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"114--123"
-, precedes =	"acw-opavs-91"
-, cites =	"acg-cdctd-87, ahu-daca-74, c-pms-88, cd-icott-87, ds-ehlec-85, ea-lacvp-81, g-fchsp-87, hs-et-55, krs-ppp-85a, l-vsp-83, lf-ppc-80, ps-cgi-85, w-opach-85, w-cvgnl-85, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "M. J. Atallah and D. Z. Chen"
+, title =       "Optimal parallel algorithm for visibility of a simple polygon from a p oint"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "114--123"
+, precedes =    "acw-opavs-91"
+, cites =       "acg-cdctd-87, ahu-daca-74, c-pms-88, cd-icott-87, ds-ehlec-85, ea-lacvp-81, g-fchsp-87, hs-et-55, krs-ppp-85a, l-vsp-83, lf-ppc-80, ps-cgi-85, w-opach-85, w-cvgnl-85, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{ac-pcg-94
-, author =	"M. J. Atallah and D. Z. Chen"
-, title =	"Parallel Computational Geometry"
-, editor =	"A. Y. Zomaya"
-, booktitle =	"Parallel Computations: Paradigms and Applications"
-, publisher =	"World Scientific Publishing"
-, year =	1994
-, pages =	""
-, update =	"96.09 orourke"
+, author =      "M. J. Atallah and D. Z. Chen"
+, title =       "Parallel Computational Geometry"
+, editor =      "A. Y. Zomaya"
+, booktitle =   "Parallel Computations: Paradigms and Applications"
+, publisher =   "World Scientific Publishing"
+, year =        1994
+, pages =       ""
+, update =      "96.09 orourke"
 }
 
 @article{ac-prspr-91
-, author =	"M. J. Atallah and D. Z. Chen"
-, title =	"Parallel rectilinear shortest paths with rectangular obstacles"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, number =	2
-, year =	1991
-, pages =	"79--113"
-, comments =	"They preprocess a set of $n$ disjoint axis-aligned rectangles (obstacles),
-		 within a rectilinearly convex polygon $P$,
-		 for 2-point shortest path queries (rectilinear shortest paths).
-		 The query time is $O(\log n)$, on one processor.
-		 The sequential preprocessing time is $O(n^2)$ (no space
-		 bounds seem to be stated explicitly).
-		 Their parallel (CREW) algorithms take time $O(\log^2 n)$,
-		 on either $O(n^2/\log^2 n)$, $O(n^2/\log n)$, or $O(n^2)$ processors,
-		 depending on whether 2, 1, or 0 of the points $\{s,t\}$ lie
-		 on the boundary of $P$."
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "M. J. Atallah and D. Z. Chen"
+, title =       "Parallel rectilinear shortest paths with rectangular obstacles"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, number =      2
+, year =        1991
+, pages =       "79--113"
+, comments =    "They preprocess a set of $n$ disjoint axis-aligned rectangles (obstacles),
+                 within a rectilinearly convex polygon $P$,
+                 for 2-point shortest path queries (rectilinear shortest paths).
+                 The query time is $O(\log n)$, on one processor.
+                 The sequential preprocessing time is $O(n^2)$ (no space
+                 bounds seem to be stated explicitly).
+                 Their parallel (CREW) algorithms take time $O(\log^2 n)$,
+                 on either $O(n^2/\log^2 n)$, $O(n^2/\log n)$, or $O(n^2)$ processors,
+                 depending on whether 2, 1, or 0 of the points $\{s,t\}$ lie
+                 on the boundary of $P$."
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{ack-palic-97
-, author =	"Mikhail J. Atallah and Danny Z. Chen and Kevin S. Klenk"
-, title =	"Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"59--64"
-, update =	"97.11 jones"
+, author =      "Mikhail J. Atallah and Danny Z. Chen and Kevin S. Klenk"
+, title =       "Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "59--64"
+, update =      "97.11 jones"
 }
 
 @article{acw-opavs-91
-, author =	"M. J. Atallah and D. Z. Chen and H. Wagener"
-, title =	"Optimal parallel algorithm for visibility of a simple polygon from a point"
-, journal =	"J. ACM"
-, volume =	38
-, year =	1991
-, pages =	"516--553"
-, succeeds =	"ac-opavs-89"
+, author =      "M. J. Atallah and D. Z. Chen and H. Wagener"
+, title =       "Optimal parallel algorithm for visibility of a simple polygon from a point"
+, journal =     "J. ACM"
+, volume =      38
+, year =        1991
+, pages =       "516--553"
+, succeeds =    "ac-opavs-89"
 }
 
 @inproceedings{acg-cdctd-87
-, author =	"M. J. Atallah and R. Cole and M. T. Goodrich"
-, title =	"Cascading divide-and-conquer: {A} technique for designing parallel algorithms"
-, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1987
-, pages =	"151--160"
-, keywords =	"cascading divide-and-conquer algorithm, parallel algorithms, concurrent-read- exclusive-write, parallel random-access machine"
-, precedes =	"acg-cdctd-89"
-, annote =	"Triangulation of a polygon using $O(\log n)$ time and
-		 $O(n)$ processors."
-, abstract =	"Techniques are presented for parallel
-		 divide-and-conquer, resulting in improved parallel
-		 algorithms for a number of problems, including
-		 intersection detection, trapezoidal decomposition
-		 (hence, polygon triangulation), and planar point
-		 location (hence, Voronoi diagram construction).
-		 Efficient parallel algorithms are also given for
-		 fractional cascading, three-dimensional maxima, two-set
-		 dominance counting, and visibility from a point. All of
-		 the algorithms run in O(log n) time with either a
-		 linear or sublinear number of processors in the
-		 concurrent-read- exclusive-write parallel random-access
-		 machine model. 20 refs."
+, author =      "M. J. Atallah and R. Cole and M. T. Goodrich"
+, title =       "Cascading divide-and-conquer: {A} technique for designing parallel algorithms"
+, booktitle =   "Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1987
+, pages =       "151--160"
+, keywords =    "cascading divide-and-conquer algorithm, parallel algorithms, concurrent-read- exclusive-write, parallel random-access machine"
+, precedes =    "acg-cdctd-89"
+, annote =      "Triangulation of a polygon using $O(\log n)$ time and
+                 $O(n)$ processors."
+, abstract =    "Techniques are presented for parallel
+                 divide-and-conquer, resulting in improved parallel
+                 algorithms for a number of problems, including
+                 intersection detection, trapezoidal decomposition
+                 (hence, polygon triangulation), and planar point
+                 location (hence, Voronoi diagram construction).
+                 Efficient parallel algorithms are also given for
+                 fractional cascading, three-dimensional maxima, two-set
+                 dominance counting, and visibility from a point. All of
+                 the algorithms run in O(log n) time with either a
+                 linear or sublinear number of processors in the
+                 concurrent-read- exclusive-write parallel random-access
+                 machine model. 20 refs."
 }
 
 @article{acg-cdctd-89
-, author =	"M. J. Atallah and R. Cole and M. T. Goodrich"
-, title =	"Cascading divide-and-conquer: {A} technique for designing parallel algorithms"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, number =	3
-, year =	1989
-, pages =	"499--532"
-, keywords =	"parallel computation, decomposition, range search, point location, visibility, domination, points, lines, divide-and-conquer, two-dimensional"
-, succeeds =	"acg-cdctd-87, ag-epsp-86i, ag-epsp-86t"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 milone+mitchell"
+, author =      "M. J. Atallah and R. Cole and M. T. Goodrich"
+, title =       "Cascading divide-and-conquer: {A} technique for designing parallel algorithms"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, number =      3
+, year =        1989
+, pages =       "499--532"
+, keywords =    "parallel computation, decomposition, range search, point location, visibility, domination, points, lines, divide-and-conquer, two-dimensional"
+, succeeds =    "acg-cdctd-87, ag-epsp-86i, ag-epsp-86t"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 93.09 milone+mitchell"
 }
 
 @techreport{acg-dctdp-87
-, author =	"M. J. Atallah and R. Cole and M. T. Goodrich"
-, title =	"Divide-and-Conquer: {A} Technique for Designing Parallel Algorithms"
-, type =	"Technical {Report}"
-, number =	665
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "M. J. Atallah and R. Cole and M. T. Goodrich"
+, title =       "Divide-and-Conquer: {A} Technique for Designing Parallel Algorithms"
+, type =        "Technical {Report}"
+, number =      665
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{admrt-mtids-91
-, author =	"M. J. Atallah and F. Dehne and R. Miller and A. Rau-Chaplin and J.-J. Tsay"
-, title =	"Multisearch techniques for implementing data structures on a mesh-connected computer"
-, booktitle =	"Proc. ACM Sympos. Parallel Algorithms Architect."
-, nickname =	"SPAA"
-, year =	1991
-, pages =	"204--214"
-, update =	"94.01 dehne"
+, author =      "M. J. Atallah and F. Dehne and R. Miller and A. Rau-Chaplin and J.-J. Tsay"
+, title =       "Multisearch techniques for implementing data structures on a mesh-connected computer"
+, booktitle =   "Proc. ACM Sympos. Parallel Algorithms Architect."
+, nickname =    "SPAA"
+, year =        1991
+, pages =       "204--214"
+, update =      "94.01 dehne"
 }
 
 @article{admrt-mtids-94
-, author =	"M. J. Atallah and F. Dehne and R. Miller and A. Rau-Chaplin and J.-J. Tsay"
-, title =	"Multisearch techniques for implementing data structures on a mesh-connected computer"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	"??"
-, year =	"1993/94"
-, comments =	"to appear"
-, update =	"94.01 dehne"
+, author =      "M. J. Atallah and F. Dehne and R. Miller and A. Rau-Chaplin and J.-J. Tsay"
+, title =       "Multisearch techniques for implementing data structures on a mesh-connected computer"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      "??"
+, year =        "1993/94"
+, comments =    "to appear"
+, update =      "94.01 dehne"
 }
 
 @techreport{af-mph-93
-, author =	"M. J. Atallah and A. Fabri"
-, title =	"On the Multisearching Problem for Hypercubes"
-, type =	"Research {Report}"
-, number =	1990
-, institution =	"INRIA"
-, address =	"BP93, 06902 Sophia-Antipolis, France"
-, month =	jun
-, year =	1993
-, url =	"https://hal.inria.fr/inria-00074682"
-, keywords =	"parallel algorithms, hypercube, multisearching, point location"
-, update =	"95.09 devillers, 95.01 devillers, 93.09 devillers+milone+mitchell"
+, author =      "M. J. Atallah and A. Fabri"
+, title =       "On the Multisearching Problem for Hypercubes"
+, type =        "Research {Report}"
+, number =      1990
+, institution = "INRIA"
+, address =     "BP93, 06902 Sophia-Antipolis, France"
+, month =       jun
+, year =        1993
+, url = "https://inria.hal.science/inria-00074682"
+, keywords =    "parallel algorithms, hypercube, multisearching, point location"
+, update =      "95.09 devillers, 95.01 devillers, 93.09 devillers+milone+mitchell"
 }
 
 @article{af-mph-96
-, author =	"M. J. Atallah and A. Fabri"
-, title =	"On the multisearching problem for hypercubes"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1996
-, pages =	"293--302"
-, update =	"96.05 smid"
+, author =      "M. J. Atallah and A. Fabri"
+, title =       "On the multisearching problem for hypercubes"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1996
+, pages =       "293--302"
+, update =      "96.05 smid"
 }
 
 @article{af-nfmer-86
-, author =	"M. J. Atallah and G. N. Frederickson"
-, title =	"A note on finding a maximum empty rectangle"
-, journal =	"Discrete Appl. Math."
-, volume =	13
-, number =	1
-, year =	1986
-, pages =	"87--91"
-, keywords =	"orthogon, empty rectangle, extremal figures"
-, update =	"97.03 smid, 95.05 korneenko"
+, author =      "M. J. Atallah and G. N. Frederickson"
+, title =       "A note on finding a maximum empty rectangle"
+, journal =     "Discrete Appl. Math."
+, volume =      13
+, number =      1
+, year =        1986
+, pages =       "87--91"
+, keywords =    "orthogon, empty rectangle, extremal figures"
+, update =      "97.03 smid, 95.05 korneenko"
 }
 
 @article{afk-seusp-88
-, author =	"M. J. Atallah and G. N. Frederickson and S. R. Kosaraju"
-, title =	"Sorting with efficient use of special-purpose sorters"
-, journal =	"ILP"
-, volume =	"??"
-, year =	1988
-, pages =	"13--15"
-, update =	"98.03 bibrelex"
+, author =      "M. J. Atallah and G. N. Frederickson and S. R. Kosaraju"
+, title =       "Sorting with efficient use of special-purpose sorters"
+, journal =     "ILP"
+, volume =      "??"
+, year =        1988
+, pages =       "13--15"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{ag-dpcg-93
-, author =	"M. J. Atallah and M. T. Goodrich"
-, title =	"Deterministic Parallel Computational Geometry"
-, editor =	"J. H. Reif"
-, booktitle =	"Synthesis of Parallel Algorithms"
-, publisher =	"Morgan Kaufmann Publishers"
-, year =	1993
-, pages =	"497--536"
-, update =	"96.09 orourke"
+, author =      "M. J. Atallah and M. T. Goodrich"
+, title =       "Deterministic Parallel Computational Geometry"
+, editor =      "J. H. Reif"
+, booktitle =   "Synthesis of Parallel Algorithms"
+, publisher =   "Morgan Kaufmann Publishers"
+, year =        1993
+, pages =       "497--536"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{ag-epsgp-85
-, author =	"M. J. Atallah and M. T. Goodrich"
-, title =	"Efficient Parallel Solutions to Geometric Problems"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, year =	1985
-, pages =	"411--417"
-, update =	"93.09 held"
+, author =      "M. J. Atallah and M. T. Goodrich"
+, title =       "Efficient Parallel Solutions to Geometric Problems"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, year =        1985
+, pages =       "411--417"
+, update =      "93.09 held"
 }
 
 @article{ag-epssg-86
-, author =	"M. J. Atallah and M. T. Goodrich"
-, title =	"Efficient parallel solutions to some geometric problems"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	3
-, year =	1986
-, pages =	"492--507"
-, keywords =	"parallel computation, convex hull, proximity, divide-and-conquer, points, two-dimensional"
+, author =      "M. J. Atallah and M. T. Goodrich"
+, title =       "Efficient parallel solutions to some geometric problems"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      3
+, year =        1986
+, pages =       "492--507"
+, keywords =    "parallel computation, convex hull, proximity, divide-and-conquer, points, two-dimensional"
 }
 
 @techreport{ag-epsp-86t
-, author =	"M. J. Atallah and M. T. Goodrich"
-, title =	"Efficient plane sweeping in parallel"
-, number =	"CSD-TR-563"
-, institution =	"Prude University, Computer Science"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "M. J. Atallah and M. T. Goodrich"
+, title =       "Efficient plane sweeping in parallel"
+, number =      "CSD-TR-563"
+, institution = "Prude University, Computer Science"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ag-epsp-86i
-, author =	"M. J. Atallah and M. T. Goodrich"
-, title =	"Efficient plane sweeping in parallel"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"216--225"
-, keywords =	"parallel computation, decomposition, range search, point location, triangulation, visibility, domination, points, lines, two-dimensional"
-, precedes =	"acg-cdctd-89"
-, cites =	"acgoy-pcg-85, ag-epsgp-85, ag-epsp-86t, aks-scps-83, bh-rmspm-85, ci-tpdc-83, c-iies-84, cg-fc1ds-86, c-pagp-80, eo-esrp-82, ea-lacvp-81, g-opaan-85, k-osps-83, krs-ppp-85, klp-fmsv-75, lp-cgs-84, lw-dsdrq-82, ol-mcp-81, sh-gip-76, v-pcp-75, ZZZ"
-, update =	"98.03 bibrelex, 93.09 milone+mitchell"
+, author =      "M. J. Atallah and M. T. Goodrich"
+, title =       "Efficient plane sweeping in parallel"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "216--225"
+, keywords =    "parallel computation, decomposition, range search, point location, triangulation, visibility, domination, points, lines, two-dimensional"
+, precedes =    "acg-cdctd-89"
+, cites =       "acgoy-pcg-85, ag-epsgp-85, ag-epsp-86t, aks-scps-83, bh-rmspm-85, ci-tpdc-83, c-iies-84, cg-fc1ds-86, c-pagp-80, eo-esrp-82, ea-lacvp-81, g-opaan-85, k-osps-83, krs-ppp-85, klp-fmsv-75, lp-cgs-84, lw-dsdrq-82, ol-mcp-81, sh-gip-76, v-pcp-75, ZZZ"
+, update =      "98.03 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{ag-pasft-86
-, author =	"M. J. Atallah and M. T. Goodrich"
-, title =	"Parallel algorithms for some functions of two convex polygons"
-, booktitle =	"Proc. 24th Allerton Conf. Commun. Control Comput."
-, year =	1986
-, pages =	"758--767"
-, keywords =	"parallel computation, convex hull, distance, polygons, convex, two-dimensional"
-, precedes =	"ag-pasft-88"
+, author =      "M. J. Atallah and M. T. Goodrich"
+, title =       "Parallel algorithms for some functions of two convex polygons"
+, booktitle =   "Proc. 24th Allerton Conf. Commun. Control Comput."
+, year =        1986
+, pages =       "758--767"
+, keywords =    "parallel computation, convex hull, distance, polygons, convex, two-dimensional"
+, precedes =    "ag-pasft-88"
 }
 
 @article{ag-pasft-88
-, author =	"M. J. Atallah and M. T. Goodrich"
-, title =	"Parallel algorithms for some functions of two convex polygons"
-, journal =	"Algorithmica"
-, volume =	3
-, year =	1988
-, pages =	"535--548"
-, keywords =	"parallel computation, convex hull, distance, polygons, convex, two-dimensional"
-, succeeds =	"ag-pasft-86"
+, author =      "M. J. Atallah and M. T. Goodrich"
+, title =       "Parallel algorithms for some functions of two convex polygons"
+, journal =     "Algorithmica"
+, volume =      3
+, year =        1988
+, pages =       "535--548"
+, keywords =    "parallel computation, convex hull, distance, polygons, convex, two-dimensional"
+, succeeds =    "ag-pasft-86"
 }
 
 @inproceedings{agr-bfttd-94
-, author =	"M. J. Atallah and M. T. Goodrich and K. Ramaiyer"
-, title =	"Biased Finger Trees and Three-Dimensional Layers of Maxima"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"150--159"
-, cites =	"ap-nsmma-88, ahu-dsa-83, bjm-dplgs-92i, bst-bst-85, bm-anrow-80, c-clps-85, ct-dtmpp-91, ct-dacg-92, cpt-uadpl-93, cj-nrdpl-90, ct-detta-91, c-sssl-86, clr-ia-90, e-acg-87, egs-oplms-86, eittwy-mmsfd-92, gt-dtdpl-91, gt-drssp-93, gmpr-nrll-77, gs-dfbt-78, hm-ndsrs-82, k-osps-83, k-ss-73, k-lssl-81, k-oricm-94, klp-fmsv-75, lp-lppsi-77, lp-cgs-84, m-ss-84, m-mdscg-84, mn-dfc-90, nr-bstbb-73, o-ddds-83, p-nappl-81, ps-cgi-85, pt-fdplm-89, pt-dpplo-90, st-pplup-86, st-dsdt-83, t-dsna-83, t-acc-85, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "M. J. Atallah and M. T. Goodrich and K. Ramaiyer"
+, title =       "Biased Finger Trees and Three-Dimensional Layers of Maxima"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "150--159"
+, cites =       "ap-nsmma-88, ahu-dsa-83, bjm-dplgs-92i, bst-bst-85, bm-anrow-80, c-clps-85, ct-dtmpp-91, ct-dacg-92, cpt-uadpl-93, cj-nrdpl-90, ct-detta-91, c-sssl-86, clr-ia-90, e-acg-87, egs-oplms-86, eittwy-mmsfd-92, gt-dtdpl-91, gt-drssp-93, gmpr-nrll-77, gs-dfbt-78, hm-ndsrs-82, k-osps-83, k-ss-73, k-lssl-81, k-oricm-94, klp-fmsv-75, lp-lppsi-77, lp-cgs-84, m-ss-84, m-mdscg-84, mn-dfc-90, nr-bstbb-73, o-ddds-83, p-nappl-81, ps-cgi-85, pt-fdplm-89, pt-dpplo-90, st-pplup-86, st-dsdt-83, t-dsna-83, t-acc-85, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @article{ah-aaaic-86
-, author =	"M. J. Atallah and S. Hambrusch"
-, title =	"An assignment algorithm with applications to integrated circuit layout"
-, journal =	"Discrete Appl. Math."
-, volume =	13
-, number =	1
-, year =	1986
-, pages =	"9--22"
-, keywords =	"geometric graphs"
-, update =	"95.05 korneenko"
+, author =      "M. J. Atallah and S. Hambrusch"
+, title =       "An assignment algorithm with applications to integrated circuit layout"
+, journal =     "Discrete Appl. Math."
+, volume =      13
+, number =      1
+, year =        1986
+, pages =       "9--22"
+, keywords =    "geometric graphs"
+, update =      "95.05 korneenko"
 }
 
 @article{ah-bmmd-87
-, author =	"M. J. Atallah and S. E. Hambrusch"
-, title =	"On bipartite matching of minimum density"
-, journal =	"J. Algorithms"
-, volume =	8
-, year =	1987
-, pages =	"480--502"
-, keywords =	"geometric graphs"
-, update =	"95.05 korneenko"
+, author =      "M. J. Atallah and S. E. Hambrusch"
+, title =       "On bipartite matching of minimum density"
+, journal =     "J. Algorithms"
+, volume =      8
+, year =        1987
+, pages =       "480--502"
+, keywords =    "geometric graphs"
+, update =      "95.05 korneenko"
 }
 
 @article{ak-gdmv-85
-, author =	"M. J. Atallah and S. R. Kosaraju"
-, title =	"A generalized dictionary machine for {VLSI}"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-34"
-, year =	1985
-, pages =	"151--155"
+, author =      "M. J. Atallah and S. R. Kosaraju"
+, title =       "A generalized dictionary machine for {VLSI}"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-34"
+, year =        1985
+, pages =       "151--155"
 }
 
 @techreport{ak-eama-87
-, author =	"M. J. Atallah and S. R. Kosaraju"
-, title =	"An efficient algorithm for maxdominance, with applications"
-, type =	"Report"
-, number =	"CSD-TR-641"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1987
-, precedes =	"ak-eama-89"
-, update =	"95.05 korneenko"
+, author =      "M. J. Atallah and S. R. Kosaraju"
+, title =       "An efficient algorithm for maxdominance, with applications"
+, type =        "Report"
+, number =      "CSD-TR-641"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1987
+, precedes =    "ak-eama-89"
+, update =      "95.05 korneenko"
 }
 
 @article{ak-eama-89
-, author =	"M. J. Atallah and S. R. Kosaraju"
-, title =	"An efficient algorithm for maxdominance, with applications"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"221--236"
-, keywords =	"dominance maxdominance"
-, succeeds =	"ak-eama-87"
-, update =	"95.05 korneenko"
+, author =      "M. J. Atallah and S. R. Kosaraju"
+, title =       "An efficient algorithm for maxdominance, with applications"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "221--236"
+, keywords =    "dominance maxdominance"
+, succeeds =    "ak-eama-87"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{ak-eparm-91
-, author =	"M. J. Atallah and S. R. Kosaraju"
-, title =	"An efficient parallel algorithm for the row minima of a totally monotone matrix"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, site =	"San Francisco, California"
-, year =	1991
-, pages =	"394--403"
-, note =	"accepted for publication in J. of Algorithms"
-, update =	"98.11 bibrelex"
-, annote =	"$O(\log n)$ time, $O(n)$ processors, EREW-PRAM model"
+, author =      "M. J. Atallah and S. R. Kosaraju"
+, title =       "An efficient parallel algorithm for the row minima of a totally monotone matrix"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, site =        "San Francisco, California"
+, year =        1991
+, pages =       "394--403"
+, note =        "accepted for publication in J. of Algorithms"
+, update =      "98.11 bibrelex"
+, annote =      "$O(\log n)$ time, $O(n)$ processors, EREW-PRAM model"
 }
 
 @inproceedings{ak-essmp-87
-, author =	"M. J. Atallah and S. R. Kosaraju"
-, title =	"Efficient solutions to some maxdominance problems"
-, booktitle =	"Proc. 1st Ann. Conf. Inform. Sci. Systems"
-, year =	1987
-, pages =	"600--610"
+, author =      "M. J. Atallah and S. R. Kosaraju"
+, title =       "Efficient solutions to some maxdominance problems"
+, booktitle =   "Proc. 1st Ann. Conf. Inform. Sci. Systems"
+, year =        1987
+, pages =       "600--610"
 }
 
 @article{ak-esstp-88
-, author =	"M. J. Atallah and S. R. Kosaraju"
-, title =	"Efficient solutions to some transportation problems with application to minimizing robot arm travel"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, number =	5
-, year =	1988
-, pages =	"849--869"
-, keywords =	"motion planning"
-, succeeds =	"ak-mrat-??"
-, update =	"95.05 korneenko"
+, author =      "M. J. Atallah and S. R. Kosaraju"
+, title =       "Efficient solutions to some transportation problems with application to minimizing robot arm travel"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, number =      5
+, year =        1988
+, pages =       "849--869"
+, keywords =    "motion planning"
+, succeeds =    "ak-mrat-??"
+, update =      "95.05 korneenko"
 }
 
 @techreport{ak-mrat-??
-, author =	"M. J. Atallah and S. R. Kosaraju"
-, title =	"Minimizing robot arm travel"
-, type =	"Technical {Report}"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	"??"
-, precedes =	"ak-esstp-88"
-, update =	"95.05 korneenko"
+, author =      "M. J. Atallah and S. R. Kosaraju"
+, title =       "Minimizing robot arm travel"
+, type =        "Technical {Report}"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        "??"
+, precedes =    "ak-esstp-88"
+, update =      "95.05 korneenko"
 }
 
 @misc{am-fddse-88
-, author =	"M. J. Atallah and J. Manning"
-, title =	"Fast Detection and Display of Symmetry in Embedded Planar Graphs"
-, institution =	"Department of Computer Science, Purdue University"
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. J. Atallah and J. Manning"
+, title =       "Fast Detection and Display of Symmetry in Embedded Planar Graphs"
+, institution = "Department of Computer Science, Purdue University"
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{arl-ltacs-91
-, author =	"M. J. Atallah and C. C. Ribeiro and S. Lifschitz"
-, title =	"A linear time algorithm for the computation of some distance functions between convex polygons"
-, journal =	"Rech. Oper."
-, volume =	25
-, number =	4
-, year =	1991
-, pages =	"413--424"
-, keywords =	"convex polygon, proximity, Hausdorf distance"
-, update =	"95.05 korneenko"
+, author =      "M. J. Atallah and C. C. Ribeiro and S. Lifschitz"
+, title =       "A linear time algorithm for the computation of some distance functions between convex polygons"
+, journal =     "Rech. Oper."
+, volume =      25
+, number =      4
+, year =        1991
+, pages =       "413--424"
+, keywords =    "convex polygon, proximity, Hausdorf distance"
+, update =      "95.05 korneenko"
 }
 
 @article{arl-csdfb-91
-, author =	"M. J. Atallah and C. C. Ribeiro and S. Lifschitz"
-, title =	"Computing some distance functions between polygons"
-, journal =	"Pattern Recogn."
-, volume =	24
-, number =	8
-, year =	1991
-, pages =	"775--782"
-, keywords =	"parallel computation, polygon, proximity, Hausdorf distance"
-, update =	"95.05 korneenko"
+, author =      "M. J. Atallah and C. C. Ribeiro and S. Lifschitz"
+, title =       "Computing some distance functions between polygons"
+, journal =     "Pattern Recogn."
+, volume =      24
+, number =      8
+, year =        1991
+, pages =       "775--782"
+, keywords =    "parallel computation, polygon, proximity, Hausdorf distance"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{at-pdgp-89
-, author =	"M. J. Atallah and J.-J. Tsay"
-, title =	"On the parallel-decomposability of geometric problems"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"104--113"
-, cites =	"av-iocsr-88, afk-seusp-88, bg-sos-87, b-mdc-80, c-cgsc-84, fj-csrxm-82, g-eptcg-87, g-odccm-84, jl-pgamc-90, ka-osbmc-88, lcw-occss-81, lp-cgs-84, mc-ivs-80, ms-mcacg-86, m-snuls-87, ps-cgi-85, scl-saeap-87, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "M. J. Atallah and J.-J. Tsay"
+, title =       "On the parallel-decomposability of geometric problems"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "104--113"
+, cites =       "av-iocsr-88, afk-seusp-88, bg-sos-87, b-mdc-80, c-cgsc-84, fj-csrxm-82, g-eptcg-87, g-odccm-84, jl-pgamc-90, ka-osbmc-88, lcw-occss-81, lp-cgs-84, mc-ivs-80, ms-mcacg-86, m-snuls-87, ps-cgi-85, scl-saeap-87, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{a-vgsls-96
-, author =	"Y. Atassi"
-, title =	"Visibility graph of a set of line sements: {A} dynamic sequential algorithm and its parallel version"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"246--251"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "Y. Atassi"
+, title =       "Visibility graph of a set of line sements: {A} dynamic sequential algorithm and its parallel version"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "246--251"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @techreport{am-otibe-85
-, author =	"A. Athavale and D. M. Mount"
-, title =	"Order type and isomyphism based on enclosing circles"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Maryland College Park"
-, address =	"College Park, MD"
-, year =	1985
+, author =      "A. Athavale and D. M. Mount"
+, title =       "Order type and isomyphism based on enclosing circles"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Maryland College Park"
+, address =     "College Park, MD"
+, year =        1985
 }
 
 @article{awg-psg-78
-, author =	"P. Atherton and K. Weiler and D. P. Greenberg"
-, title =	"Polygon shadow generation"
-, journal =	"Comput. Graph."
-, volume =	12
-, number =	3
-, year =	1978
-, pages =	"275--281"
-, note =	"Proc. SIGGRAPH '78"
+, author =      "P. Atherton and K. Weiler and D. P. Greenberg"
+, title =       "Polygon shadow generation"
+, journal =     "Comput. Graph."
+, volume =      12
+, number =      3
+, year =        1978
+, pages =       "275--281"
+, note =        "Proc. SIGGRAPH '78"
 }
 
 @book{an-bp-72
-, author =	"K. B. Athreya and P. E. Ney"
-, title =	"Branching processes"
-, publisher =	"Springer-Verlag"
-, year =	1972
-, update =	"97.11 bibrelex"
+, author =      "K. B. Athreya and P. E. Ney"
+, title =       "Branching processes"
+, publisher =   "Springer-Verlag"
+, year =        1972
+, update =      "97.11 bibrelex"
 }
 
 @article{agw-crhtn-85
-, author =	"H. H. Atkinson and I. Gargantini and T. R. S. Walsch"
-, title =	"Counting regions, holes and their nesting level in time proportional to the border"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	29
-, year =	1985
-, pages =	"196--215"
-, update =	"95.05 korneenko"
+, author =      "H. H. Atkinson and I. Gargantini and T. R. S. Walsch"
+, title =       "Counting regions, holes and their nesting level in time proportional to the border"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      29
+, year =        1985
+, pages =       "196--215"
+, update =      "95.05 korneenko"
 }
 
 @article{agw-fqo-86
-, author =	"H. H. Atkinson and I. Gargantini and T. R. S. Walsh"
-, title =	"Filling by quadrants or octants"
-, journal =	"Comput. Graph. Image Process."
-, volume =	33
-, year =	1986
-, pages =	"138--155"
-, update =	"98.07 bibrelex"
+, author =      "H. H. Atkinson and I. Gargantini and T. R. S. Walsh"
+, title =       "Filling by quadrants or octants"
+, journal =     "Comput. Graph. Image Process."
+, volume =      33
+, year =        1986
+, pages =       "138--155"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{a-oagc-83
-, author =	"M. D. Atkinson"
-, title =	"An Optimal Algorithm for Geometric Congruence"
-, type =	"Technical {Report}"
-, number =	"SCS-TR-31"
-, institution =	"Carleton Univ."
-, address =	"Ottawa, ON"
-, year =	1983
-, update =	"98.03 bibrelex"
+, author =      "M. D. Atkinson"
+, title =       "An Optimal Algorithm for Geometric Congruence"
+, type =        "Technical {Report}"
+, number =      "SCS-TR-31"
+, institution = "Carleton Univ."
+, address =     "Ottawa, ON"
+, year =        1983
+, update =      "98.03 bibrelex"
 }
 
 @article{a-oagc-87
-, author =	"M. D. Atkinson"
-, title =	"An optimal algorithm for geometrical congruence"
-, journal =	"J. Algorithms"
-, volume =	8
-, year =	1987
-, pages =	"159--172"
+, author =      "M. D. Atkinson"
+, title =       "An optimal algorithm for geometrical congruence"
+, journal =     "J. Algorithms"
+, volume =      8
+, year =        1987
+, pages =       "159--172"
 }
 
 @article{as-gbtr-92
-, author =	"M. D. Atkinson and J.-R. Sack"
-, title =	"Generating Binary Trees at Random"
-, journal =	"Inform. Process. Lett."
-, volume =	41
-, year =	1992
-, pages =	"21--23"
-, update =	"97.11 sack"
+, author =      "M. D. Atkinson and J.-R. Sack"
+, title =       "Generating Binary Trees at Random"
+, journal =     "Inform. Process. Lett."
+, volume =      41
+, year =        1992
+, pages =       "21--23"
+, update =      "97.11 sack"
 }
 
 @article{as-ugbtp-94
-, author =	"M. D. Atkinson and J.-R. Sack"
-, title =	"Uniform Generation of Binary Trees in Parallel"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	23
-, year =	1994
-, pages =	"101--103"
-, keywords =	"combinatorial objects; CREW-PRAM; generator; parallel algorithms; random-access storage; trees; unbiased random; uniform generation of binary trees"
-, update =	"98.03 bibrelex, 96.01 held"
+, author =      "M. D. Atkinson and J.-R. Sack"
+, title =       "Uniform Generation of Binary Trees in Parallel"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      23
+, year =        1994
+, pages =       "101--103"
+, keywords =    "combinatorial objects; CREW-PRAM; generator; parallel algorithms; random-access storage; trees; unbiased random; uniform generation of binary trees"
+, update =      "98.03 bibrelex, 96.01 held"
 }
 
 @article{as-ugfrh-94
-, author =	"M. D. Atkinson and J.-R. Sack"
-, title =	"Uniform Generation of Forests of Restricted Height"
-, journal =	"Inform. Process. Lett."
-, volume =	50
-, year =	1994
-, pages =	"323--327"
-, update =	"96.01 held"
+, author =      "M. D. Atkinson and J.-R. Sack"
+, title =       "Uniform Generation of Forests of Restricted Height"
+, journal =     "Inform. Process. Lett."
+, volume =      50
+, year =        1994
+, pages =       "323--327"
+, update =      "96.01 held"
 }
 
 @techreport{asss-moacp-85
-, author =	"M. D. Atkinson and J.-R. Sack and N. Santoro and Th. Strothotte"
-, title =	"Minmaxheaps, orderstatisticstrees and their application to the coursmarks problem"
-, institution =	"School of Computer Science, Carleton University"
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "M. D. Atkinson and J.-R. Sack and N. Santoro and Th. Strothotte"
+, title =       "Minmaxheaps, orderstatisticstrees and their application to the coursmarks problem"
+, institution = "School of Computer Science, Carleton University"
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{a-rrsru-97
-, author =	"D. Attali"
-, title =	"$R$-regular shape reconstruction from unorganized points"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"248--253"
-, cites =	"hddms-srup-92, o-pma3d-81, b-gstds-84, f-sdpvd-83, obw-cdnh-87, crg-uasgl-92, eks-sspp-83, em-tdas-94, r-mrpdt-90, s-iamm-82, ba-cscvd-92, b-cccda-94, a-segdv-95, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "D. Attali"
+, title =       "$R$-regular shape reconstruction from unorganized points"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "248--253"
+, cites =       "hddms-srup-92, o-pma3d-81, b-gstds-84, f-sdpvd-83, obw-cdnh-87, crg-uasgl-92, eks-sspp-83, em-tdas-94, r-mrpdt-90, s-iamm-82, ba-cscvd-92, b-cccda-94, a-segdv-95, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{a-rrsru-98
-, author =	"D. Attali"
-, title =	"$r$-regular shape reconstruction from unorganized points"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"239--247"
-, succeeds =	"a-rrsru-97"
-, update =	"98.11 devillers"
+, author =      "D. Attali"
+, title =       "$r$-regular shape reconstruction from unorganized points"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "239--247"
+, succeeds =    "a-rrsru-97"
+, update =      "98.11 devillers"
 }
 
 @phdthesis{a-segdv-95
-, author =	"D. Attali"
-, title =	"Squelettes et graphes de {Vorono{\"{\i}}} $2$-d et $3$-d"
-, school =	"Univ. Joseph Fourier"
-, address =	"Grenoble"
-, month =	oct
-, year =	1995
-, keywords =	"doctoral thesis"
-, update =	"98.11 devillers, 98.07 bibrelex"
+, author =      "D. Attali"
+, title =       "Squelettes et graphes de {Vorono{\"{\i}}} $2$-d et $3$-d"
+, school =      "Univ. Joseph Fourier"
+, address =     "Grenoble"
+, month =       oct
+, year =        1995
+, keywords =    "doctoral thesis"
+, update =      "98.11 devillers, 98.07 bibrelex"
 }
 
 @inproceedings{ab-lbcdt-02
-, author =	"Dominique Attali and Jean-Daniel Boissonnat"
-, title =	"Complexity of the {Delaunay} Triangulation of Points on Polyhedral Surfaces"
-, booktitle =	"Proc. 7th ACM Symposium on Solid Modeling and Applications"
-, year =	2002
-, pages =	""
-, update =	"02.03 devillers"
+, author =      "Dominique Attali and Jean-Daniel Boissonnat"
+, title =       "Complexity of the {Delaunay} Triangulation of Points on Polyhedral Surfaces"
+, booktitle =   "Proc. 7th ACM Symposium on Solid Modeling and Applications"
+, year =        2002
+, pages =       ""
+, update =      "02.03 devillers"
 }
 
 @article{al-dciss-01
-, author =	"D. Attali and J.-O. Lachaud"
-, title =	"Delaunay conforming iso-surface, skeleton extraction and noise removal"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"175--189"
-, update =	"01.11 smid"
+, author =      "D. Attali and J.-O. Lachaud"
+, title =       "Delaunay conforming iso-surface, skeleton extraction and noise removal"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "175--189"
+, update =      "01.11 smid"
 }
 
 @inproceedings{abwwy-sptt-96
-, author =	"J. W. Atwood and M. M. Burnett and R. A. Walpole and E. M. Wilcox and S. Yang"
-, title =	"Steering Programs via Time Travel"
-, booktitle =	"Proc. IEEE Symp. on Visual Languages"
-, year =	1996
-, update =	"97.03 tamassia"
+, author =      "J. W. Atwood and M. M. Burnett and R. A. Walpole and E. M. Wilcox and S. Yang"
+, title =       "Steering Programs via Time Travel"
+, booktitle =   "Proc. IEEE Symp. on Visual Languages"
+, year =        1996
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{a-ollrn-93
-, author =	"Peter Auer"
-, title =	"On-line Learning of Rectangles in Noisy Environments"
-, booktitle =	"Proc. 6th ACM Conf. Comput. Learning Theory"
-, nickname =	"COLT '93"
-, month =	jul
-, year =	1993
-, pages =	"??"
-, update =	"98.07 bibrelex, 93.09 milone+mitchell"
+, author =      "Peter Auer"
+, title =       "On-line Learning of Rectangles in Noisy Environments"
+, booktitle =   "Proc. 6th ACM Conf. Comput. Learning Theory"
+, nickname =    "COLT '93"
+, month =       jul
+, year =        1993
+, pages =       "??"
+, update =      "98.07 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{ah-hgrp-96
-, author =	"T. Auer and Martin Held"
-, title =	"Heuristics for the Generation of Random Polygons"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"38--43"
-, url =	"http://www.cosy.sbg.ac.at/~held/papers/cccg96.ps.gz"
-, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 agarwal, 96.09 held+mitchell"
+, author =      "T. Auer and Martin Held"
+, title =       "Heuristics for the Generation of Random Polygons"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "38--43"
+, url = "http://www.cosy.sbg.ac.at/~held/papers/cccg96.ps.gz"
+, update =      "98.11 bibrelex, 98.03 mitchell, 97.03 agarwal, 96.09 held+mitchell"
 }
 
 @article{as-srrgd-90
-, author =	"S. Auerbach and H. Schaeben"
-, title =	"Surface Representations Reproducing Given Digitized Contour Lines"
-, journal =	"Mathematical Geology"
-, volume =	22
-, number =	6
-, year =	1990
-, pages =	"723--742"
-, annote =	"Computes CDT of contour lines, with extra constraint
-		 that no triangle can have three vertices on same
-		 contour. (Extra constraint is done manually!)"
+, author =      "S. Auerbach and H. Schaeben"
+, title =       "Surface Representations Reproducing Given Digitized Contour Lines"
+, journal =     "Mathematical Geology"
+, volume =      22
+, number =      6
+, year =        1990
+, pages =       "723--742"
+, annote =      "Computes CDT of contour lines, with extra constraint
+                 that no triangle can have three vertices on same
+                 contour. (Extra constraint is done manually!)"
 }
 
 @article{ap-cvms-85
-, author =	"J. M. Augenbaum and C. S. Peskin"
-, title =	"On the Construction of the {Voronoi} Mesh on a Sphere"
-, journal =	"J. Comput. Phys."
-, volume =	59
-, year =	1985
-, pages =	"177--192"
-, annote =	"Joe iterative algorithm. Use for problems where mesh
-		 changes with time (but presumably not much)."
+, author =      "J. M. Augenbaum and C. S. Peskin"
+, title =       "On the Construction of the {Voronoi} Mesh on a Sphere"
+, journal =     "J. Comput. Phys."
+, volume =      59
+, year =        1985
+, pages =       "177--192"
+, annote =      "Joe iterative algorithm. Use for problems where mesh
+                 changes with time (but presumably not much)."
 }
 
 @inproceedings{app-anaop-96
-, author =	"V. Auletta and D. Parente and P. Persiano"
-, title =	"A new approach to optimal planning of robot motion on a tree with obstacles"
-, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1136
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"529--545"
-, update =	"97.03 smid"
+, author =      "V. Auletta and D. Parente and P. Persiano"
+, title =       "A new approach to optimal planning of robot motion on a tree with obstacles"
+, booktitle =   "Proc. 4th Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1136
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "529--545"
+, update =      "97.03 smid"
 }
 
 @book{as-cg-93
-, author =	"G{\"u}nter Aumann and Klaus Spitzm{\"u}ller"
-, title =	"Computerorientierte Geometrie"
-, publisher =	"BI-Wissenschaftsverlag"
-, address =	"Mannheim"
-, year =	1993
-, update =	"97.03 icking"
+, author =      "G{\"u}nter Aumann and Klaus Spitzm{\"u}ller"
+, title =       "Computerorientierte Geometrie"
+, publisher =   "BI-Wissenschaftsverlag"
+, address =     "Mannheim"
+, year =        1993
+, update =      "97.03 icking"
 }
 
 @inproceedings{akpr-heael-93
-, author =	"Y. Aumann and Z. M. Kedem and K. V. Palem and M. O. Rabin"
-, title =	"Highly efficient asynchronous execution of large-grained parallel programs"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1993
-, pages =	""
-, update =	"96.09 orourke"
+, author =      "Y. Aumann and Z. M. Kedem and K. V. Palem and M. O. Rabin"
+, title =       "Highly efficient asynchronous execution of large-grained parallel programs"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1993
+, pages =       ""
+, update =      "96.09 orourke"
 }
 
 @techreport{a-acps-88
-, author =	"L. J. Aupperle"
-, title =	"An algorithm for covering polygons with squares"
-, type =	"Draft"
-, institution =	"Dept. Comput. Sci., Princeton Univ."
-, month =	oct
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "L. J. Aupperle"
+, title =       "An algorithm for covering polygons with squares"
+, type =        "Draft"
+, institution = "Dept. Comput. Sci., Princeton Univ."
+, month =       oct
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{acko-cops-88
-, author =	"L. J. Aupperle and H. E. Conn and J. M. Keil and J. O'Rourke"
-, title =	"Covering orthogonal polygons with squares"
-, booktitle =	"Proc. 26th Allerton Conf. Commun. Control Comput."
-, month =	oct
-, year =	1988
-, pages =	"97--106"
-, keywords =	"covering, decomposition, polygons, NP-completeness, image processing, graph theory, squares, medial axis"
+, author =      "L. J. Aupperle and H. E. Conn and J. M. Keil and J. O'Rourke"
+, title =       "Covering orthogonal polygons with squares"
+, booktitle =   "Proc. 26th Allerton Conf. Commun. Control Comput."
+, month =       oct
+, year =        1988
+, pages =       "97--106"
+, keywords =    "covering, decomposition, polygons, NP-completeness, image processing, graph theory, squares, medial axis"
 }
 
 @article{ak-parep-89
-, author =	"L. J. Aupperle and J. M. Keil"
-, title =	"Polynomial algorithms for restricted {Euclidean} $p$-centre problems"
-, journal =	"Discrete Appl. Math."
-, volume =	23
-, year =	1989
-, pages =	"25--31"
-, keywords =	"lines, cluster analysis, dynamic programming, circles, optimization, operations research, facility location"
-, update =	"95.05 korneenko"
+, author =      "L. J. Aupperle and J. M. Keil"
+, title =       "Polynomial algorithms for restricted {Euclidean} $p$-centre problems"
+, journal =     "Discrete Appl. Math."
+, volume =      23
+, year =        1989
+, pages =       "25--31"
+, keywords =    "lines, cluster analysis, dynamic programming, circles, optimization, operations research, facility location"
+, update =      "95.05 korneenko"
 }
 
 @article{a-caecc-87
-, author =	"F. Aurenhammer"
-, title =	"A criterion for the affine equality of cell complexes in {$R^{d}$} and convex polyhedra in {$R^{d+1}$}"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"49--64"
-, keywords =	"discrete geometry, cell complexes, power diagrams, reciprocal figure, $d$-dimensional"
-, update =	"93.09 aurenhammer"
+, author =      "F. Aurenhammer"
+, title =       "A criterion for the affine equality of cell complexes in {$R^{d}$} and convex polyhedra in {$R^{d+1}$}"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "49--64"
+, keywords =    "discrete geometry, cell complexes, power diagrams, reciprocal figure, $d$-dimensional"
+, update =      "93.09 aurenhammer"
 }
 
 @inproceedings{a-ndrcv-86
-, author =	"F. Aurenhammer"
-, title =	"A new duality result concerning {Voronoi} diagrams"
-, booktitle =	"Proc. 13th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	226
-, publisher =	"Springer-Verlag"
-, year =	1986
-, pages =	"21--30"
-, keywords =	"design of algorithms, discrete geometry, duality, Voronoi diagrams, convex hull, worst-case analysis"
-, precedes =	"a-ndrcv-90"
+, author =      "F. Aurenhammer"
+, title =       "A new duality result concerning {Voronoi} diagrams"
+, booktitle =   "Proc. 13th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      226
+, publisher =   "Springer-Verlag"
+, year =        1986
+, pages =       "21--30"
+, keywords =    "design of algorithms, discrete geometry, duality, Voronoi diagrams, convex hull, worst-case analysis"
+, precedes =    "a-ndrcv-90"
 }
 
 @article{a-ndrcv-90
-, author =	"F. Aurenhammer"
-, title =	"A new duality result concerning {Voronoi} diagrams"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, number =	3
-, year =	1990
-, pages =	"243--254"
-, keywords =	"design of algorithms, discrete geometry, duality, Voronoi diagr ams, convex hull, worst-case analysis"
-, succeeds =	"a-ndrcv-86"
-, update =	"98.07 bibrelex"
+, author =      "F. Aurenhammer"
+, title =       "A new duality result concerning {Voronoi} diagrams"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, number =      3
+, year =        1990
+, pages =       "243--254"
+, keywords =    "design of algorithms, discrete geometry, duality, Voronoi diagr ams, convex hull, worst-case analysis"
+, succeeds =    "a-ndrcv-86"
+, update =      "98.07 bibrelex"
 }
 
 @article{a-rbgtv-90
-, author =	"F. Aurenhammer"
-, title =	"A relationship between {Gale} transforms and {Voronoi} diagrams"
-, journal =	"Discrete Appl. Math."
-, volume =	28
-, year =	1990
-, pages =	"83--91"
-, update =	"97.11 bibrelex, 95.05 korneenko"
+, author =      "F. Aurenhammer"
+, title =       "A relationship between {Gale} transforms and {Voronoi} diagrams"
+, journal =     "Discrete Appl. Math."
+, volume =      28
+, year =        1990
+, pages =       "83--91"
+, update =      "97.11 bibrelex, 95.05 korneenko"
 }
 
 @inproceedings{a-pvd-89
-, author =	"Franz Aurenhammer"
-, title =	"{Das} {Peeper's} {Voronoi}-{Diagramm}"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "Franz Aurenhammer"
+, title =       "{Das} {Peeper's} {Voronoi}-{Diagramm}"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @phdthesis{a-gvdgd-84
-, author =	"F. Aurenhammer"
-, title =	"Gewichtete {Voronoi} {Diagramme}: {Geometrische} {Deutung} und {Konstruktions}-{Algorithmen}"
-, type =	"Ph.{D}. Thesis"
-, school =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1984
-, note =	"Report B53"
-, keywords =	"doctoral thesis, discrete geometry, design of algorithms, geometric transformations, Voronoi diagrams, weighted, $d$-dimensional"
-, update =	"93.05 jones"
+, author =      "F. Aurenhammer"
+, title =       "Gewichtete {Voronoi} {Diagramme}: {Geometrische} {Deutung} und {Konstruktions}-{Algorithmen}"
+, type =        "Ph.{D}. Thesis"
+, school =      "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1984
+, note =        "Report B53"
+, keywords =    "doctoral thesis, discrete geometry, design of algorithms, geometric transformations, Voronoi diagrams, weighted, $d$-dimensional"
+, update =      "93.05 jones"
 }
 
 @article{a-iadbu-88
-, author =	"F. Aurenhammer"
-, title =	"Improved algorithms for discs and balls using power diagrams"
-, journal =	"J. Algorithms"
-, volume =	9
-, year =	1988
-, pages =	"151--161"
-, keywords =	"design of algorithms, computer graphics, robotics, intersection, volume, Voronoi diagrams, disks, balls"
+, author =      "F. Aurenhammer"
+, title =       "Improved algorithms for discs and balls using power diagrams"
+, journal =     "J. Algorithms"
+, volume =      9
+, year =        1988
+, pages =       "151--161"
+, keywords =    "design of algorithms, computer graphics, robotics, intersection, volume, Voronoi diagrams, disks, balls"
 }
 
 @inproceedings{a-jschc-87
-, author =	"F. Aurenhammer"
-, title =	"Jordan sorting via convex hulls of certain non-simple polygons"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"21--29"
-, keywords =	"design of algorithms, sorting, convex hull, non-simple polygons, trees, worst-case analysis"
-, cites =	"f-hgiit-76, r-ppdti-84, hmrt-sjslt-86, e-agc-, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "F. Aurenhammer"
+, title =       "Jordan sorting via convex hulls of certain non-simple polygons"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "21--29"
+, keywords =    "design of algorithms, sorting, convex hull, non-simple polygons, trees, worst-case analysis"
+, cites =       "f-hgiit-76, r-ppdti-84, hmrt-sjslt-86, e-agc-, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{a-lcpd-88
-, author =	"F. Aurenhammer"
-, title =	"Linear combinations from power domains"
-, journal =	"Geom. Dedicata"
-, volume =	28
-, year =	1988
-, pages =	"45--52"
-, keywords =	"power diagrams, convex combinations, $d$-dimensional"
-, update =	"93.09 aurenhammer"
+, author =      "F. Aurenhammer"
+, title =       "Linear combinations from power domains"
+, journal =     "Geom. Dedicata"
+, volume =      28
+, year =        1988
+, pages =       "45--52"
+, keywords =    "power diagrams, convex combinations, $d$-dimensional"
+, update =      "93.09 aurenhammer"
 }
 
 @article{a-olsts-88
-, author =	"F. Aurenhammer"
-, title =	"On-line sorting of twisted sequences in linear time"
-, journal =	"BIT"
-, volume =	28
-, year =	1988
-, pages =	"194--204"
-, keywords =	"design of algorithms, sorting, convex hull, arrangements, incrementation, worst-case analysis, lower bounds"
-, update =	"93.09 aurenhammer"
+, author =      "F. Aurenhammer"
+, title =       "On-line sorting of twisted sequences in linear time"
+, journal =     "BIT"
+, volume =      28
+, year =        1988
+, pages =       "194--204"
+, keywords =    "design of algorithms, sorting, convex hull, arrangements, incrementation, worst-case analysis, lower bounds"
+, update =      "93.09 aurenhammer"
 }
 
 @techreport{a-pdpaa-83
-, author =	"F. Aurenhammer"
-, title =	"Power Diagrams: {Properties}, Algorithms and Applications"
-, number =	"F120"
-, institution =	"Techn. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "F. Aurenhammer"
+, title =       "Power Diagrams: {Properties}, Algorithms and Applications"
+, number =      "F120"
+, institution = "Techn. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{a-pdpaa-87
-, author =	"F. Aurenhammer"
-, title =	"Power diagrams: properties, algorithms and applications"
-, journal =	"SIAM J. Comput."
-, volume =	16
-, year =	1987
-, pages =	"78--96"
-, keywords =	"discrete geometry, design of algorithms, geometric transformations, duality, Voronoi diagrams, convex hull, arrangements, $d$-dimensional, distance, weighted"
+, author =      "F. Aurenhammer"
+, title =       "Power diagrams: properties, algorithms and applications"
+, journal =     "SIAM J. Comput."
+, volume =      16
+, year =        1987
+, pages =       "78--96"
+, keywords =    "discrete geometry, design of algorithms, geometric transformations, duality, Voronoi diagrams, convex hull, arrangements, $d$-dimensional, distance, weighted"
 }
 
 @article{a-rpccc-87
-, author =	"F. Aurenhammer"
-, title =	"Recognising polytopical cell complexes and constructing projection polyhedra"
-, journal =	"J. Symbolic Comput."
-, volume =	3
-, year =	1987
-, pages =	"249--255"
-, keywords =	"design of algorithms, cell complexes, Voronoi diagrams, reciprocal figure, image processing, pattern recognition"
-, update =	"93.09 aurenhammer"
+, author =      "F. Aurenhammer"
+, title =       "Recognising polytopical cell complexes and constructing projection polyhedra"
+, journal =     "J. Symbolic Comput."
+, volume =      3
+, year =        1987
+, pages =       "249--255"
+, keywords =    "design of algorithms, cell complexes, Voronoi diagrams, reciprocal figure, image processing, pattern recognition"
+, update =      "93.09 aurenhammer"
 }
 
 @techreport{a-odwvd-83
-, author =	"F. Aurenhammer"
-, title =	"The one-dimensional weighted {Voronoi} diagram"
-, type =	"Report"
-, number =	"F 110, IIG"
-, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1983
-, precedes =	"a-odwvd-86"
+, author =      "F. Aurenhammer"
+, title =       "The one-dimensional weighted {Voronoi} diagram"
+, type =        "Report"
+, number =      "F 110, IIG"
+, institution = "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1983
+, precedes =    "a-odwvd-86"
 }
 
 @article{a-odwvd-86
-, author =	"F. Aurenhammer"
-, title =	"The one-dimensional weighted {Voronoi} diagram"
-, journal =	"Inform. Process. Lett."
-, volume =	22
-, year =	1986
-, pages =	"119--123"
-, keywords =	"design of algorithms, divide-and-conquer, plane-sweep, upper envelope, Voronoi diagrams, weighted"
-, succeeds =	"a-odwvd-83"
-, update =	"93.09 aurenhammer"
+, author =      "F. Aurenhammer"
+, title =       "The one-dimensional weighted {Voronoi} diagram"
+, journal =     "Inform. Process. Lett."
+, volume =      22
+, year =        1986
+, pages =       "119--123"
+, keywords =    "design of algorithms, divide-and-conquer, plane-sweep, upper envelope, Voronoi diagrams, weighted"
+, succeeds =    "a-odwvd-83"
+, update =      "93.09 aurenhammer"
 }
 
 @inproceedings{a-ugtcg-88
-, author =	"F. Aurenhammer"
-, title =	"Using {Gale} transforms in computational geometry"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"202--216"
-, keywords =	"geometric transform, convex hulls, scene analysis, $d$-dimensional"
-, precedes =	"a-ugtcg-91"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex, 98.07 bibrelex, 95.05 korneenko, 93.09 aurenhammer"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "F. Aurenhammer"
+, title =       "Using {Gale} transforms in computational geometry"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "202--216"
+, keywords =    "geometric transform, convex hulls, scene analysis, $d$-dimensional"
+, precedes =    "a-ugtcg-91"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex, 98.07 bibrelex, 95.05 korneenko, 93.09 aurenhammer"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @article{a-ugtcg-91
-, author =	"F. Aurenhammer"
-, title =	"Using {Gale} transforms in computational geometry"
-, journal =	"Math. Program."
-, volume =	"B 52"
-, year =	1991
-, pages =	"179--190"
-, keywords =	"geometric transform, convex hulls, scene analysis, $d$-dimensional"
-, succeeds =	"a-ugtcg-88"
-, update =	"95.05 korneenko, 93.09 aurenhammer"
+, author =      "F. Aurenhammer"
+, title =       "Using {Gale} transforms in computational geometry"
+, journal =     "Math. Program."
+, volume =      "B 52"
+, year =        1991
+, pages =       "179--190"
+, keywords =    "geometric transform, convex hulls, scene analysis, $d$-dimensional"
+, succeeds =    "a-ugtcg-88"
+, update =      "95.05 korneenko, 93.09 aurenhammer"
 }
 
 @techreport{a-vds-88
-, author =	"F. Aurenhammer"
-, title =	"{Voronoi} diagrams: a survey"
-, institution =	"Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "F. Aurenhammer"
+, title =       "{Voronoi} diagrams: a survey"
+, institution = "Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @techreport{a-vdsfg-90
-, author =	"F. Aurenhammer"
-, title =	"Voronoi diagrams: a survey of a fundamental geometric data structure"
-, type =	"Report"
-, number =	"B-90-09"
-, institution =	"Fachber. Math., Free Univ. Berlin"
-, address =	"Berlin, West Germany"
-, year =	1990
-, keywords =	"survey paper, Voronoi diagrams, Delaunay triangulations, arrangements, hyperplanes, plane sweep, divide-and-conquer, parallel computation, minimum spanning trees, cluster analysis, motion planning"
-, succeeds =	"a-vds-88"
-, precedes =	"a-vdsfg-91"
-, update =	"93.09 aurenhammer"
+, author =      "F. Aurenhammer"
+, title =       "Voronoi diagrams: a survey of a fundamental geometric data structure"
+, type =        "Report"
+, number =      "B-90-09"
+, institution = "Fachber. Math., Free Univ. Berlin"
+, address =     "Berlin, West Germany"
+, year =        1990
+, keywords =    "survey paper, Voronoi diagrams, Delaunay triangulations, arrangements, hyperplanes, plane sweep, divide-and-conquer, parallel computation, minimum spanning trees, cluster analysis, motion planning"
+, succeeds =    "a-vds-88"
+, precedes =    "a-vdsfg-91"
+, update =      "93.09 aurenhammer"
 }
 
 @article{a-vdsfg-91
-, author =	"F. Aurenhammer"
-, title =	"Voronoi diagrams: A survey of a fundamental geometric data structure"
-, journal =	"ACM Comput. Surv."
-, volume =	23
-, number =	3
-, month =	sep
-, year =	1991
-, pages =	"345--405"
-, keywords =	"survey paper, Voronoi diagrams, Delaunay triangulations, arrangements, hyperplanes, plane sweep, divide-and-conquer, parallel computation, minimum spanning trees, cluster analysis, motion planning"
-, succeeds =	"a-vdsfg-90"
-, update =	"98.11 bibrelex, 95.09 agarwal"
+, author =      "F. Aurenhammer"
+, title =       "Voronoi diagrams: A survey of a fundamental geometric data structure"
+, journal =     "ACM Comput. Surv."
+, volume =      23
+, number =      3
+, month =       sep
+, year =        1991
+, pages =       "345--405"
+, keywords =    "survey paper, Voronoi diagrams, Delaunay triangulations, arrangements, hyperplanes, plane sweep, divide-and-conquer, parallel computation, minimum spanning trees, cluster analysis, motion planning"
+, succeeds =    "a-vdsfg-90"
+, update =      "98.11 bibrelex, 95.09 agarwal"
 }
 
 @article{ae-oacwv-84
-, author =	"F. Aurenhammer and H. Edelsbrunner"
-, title =	"An optimal algorithm for constructing the weighted {Voronoi} diagram in the plane"
-, journal =	"Pattern Recogn."
-, volume =	17
-, year =	1984
-, pages =	"251--257"
-, keywords =	"combinatorial geometry, design of algorithms, construction, incrementation, geometric transformations, worst-case analysis, Voronoi diagrams, two-dimensional, three-dimensional, weighted"
-, annote =	"$O(n^2)$ algorithm (worst case optimal). Uses
-		 inversion to transform problem to constructing
-		 polyhedra in 3D. ``Add a point'' algorithm."
+, author =      "F. Aurenhammer and H. Edelsbrunner"
+, title =       "An optimal algorithm for constructing the weighted {Voronoi} diagram in the plane"
+, journal =     "Pattern Recogn."
+, volume =      17
+, year =        1984
+, pages =       "251--257"
+, keywords =    "combinatorial geometry, design of algorithms, construction, incrementation, geometric transformations, worst-case analysis, Voronoi diagrams, two-dimensional, three-dimensional, weighted"
+, annote =      "$O(n^2)$ algorithm (worst case optimal). Uses
+                 inversion to transform problem to constructing
+                 polyhedra in 3D. ``Add a point'' algorithm."
 }
 
 @article{afisw-fiepc-94
-, author =	"F. Aurenhammer and M. Formann and R. M. Idury and A. A. Sch{\"a}ffer and F. Wagner"
-, title =	"Faster Isometric Embedding in Products of Complete Graphs"
-, journal =	"Discrete Appl. Math."
-, volume =	17
-, year =	1994
-, pages =	"321--340"
-, update =	"97.03 gaertner+salinger"
+, author =      "F. Aurenhammer and M. Formann and R. M. Idury and A. A. Sch{\"a}ffer and F. Wagner"
+, title =       "Faster Isometric Embedding in Products of Complete Graphs"
+, journal =     "Discrete Appl. Math."
+, volume =      17
+, year =        1994
+, pages =       "321--340"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{ahi-fcpgl-90
-, author =	"F. Aurenhammer and J. Hagauer and W. Imrich"
-, title =	"Factoring Cartesian-product graphs at logarithmic cost per edge"
-, booktitle =	"Proc. MPC Conf. Integer Programming and Combinatorial Optimization"
-, site =	"Waterloo, ON"
-, year =	1990
-, pages =	"29--44"
-, update =	"97.03 gaertner+salinger"
+, author =      "F. Aurenhammer and J. Hagauer and W. Imrich"
+, title =       "Factoring Cartesian-product graphs at logarithmic cost per edge"
+, booktitle =   "Proc. MPC Conf. Integer Programming and Combinatorial Optimization"
+, site =        "Waterloo, ON"
+, year =        1990
+, pages =       "29--44"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{aha-lsp-92
-, author =	"Franz Aurenhammer and Friedrich Hoffmann and Boris Aronov"
-, title =	"Least-Squares Partitioning"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"55--57"
-, update =	"00.03 bibrelex"
+, author =      "Franz Aurenhammer and Friedrich Hoffmann and Boris Aronov"
+, title =       "Least-Squares Partitioning"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "55--57"
+, update =      "00.03 bibrelex"
 }
 
 @article{aha-mttlsc-98
-, author =	"Franz Aurenhammer and Friedrich Hoffmann and Boris Aronov"
-, title =	"Minkowski-type theorems and least-squares clustering"
-, journal =	"Algorithmica"
-, volume =	20
-, year =	1998
-, pages =	"61--76"
-, succeeds =	"aha-mttls-92"
-, update =	"98.03 aronov, 97.11 aronov"
+, author =      "Franz Aurenhammer and Friedrich Hoffmann and Boris Aronov"
+, title =       "Minkowski-type theorems and least-squares clustering"
+, journal =     "Algorithmica"
+, volume =      20
+, year =        1998
+, pages =       "61--76"
+, succeeds =    "aha-mttls-92"
+, update =      "98.03 aronov, 97.11 aronov"
 }
 
 @inproceedings{aha-mttls-92
-, author =	"F. Aurenhammer and F. Hoffmann and B. Aronov"
-, title =	"Minkowski-type theorems and least-squares partitioning"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"350--357"
-, keywords =	"optimization, least squares, power diagram, matching"
-, precedes =	"aha-mttlsc-98"
-, cites =	"am-dhsrr-91, a-vdsfg-91, a-caecc-87, b-colmm-82, e-fdmem-92, ft-fhtui-87, g-cp-67, l-conm-76, l-egimv-85, ol-mcp-81, t-dsna-83, tn-gamca-91, v-ghm-89, ZZZ"
-, update =	"98.07 bibrelex, 97.11 aronov+bibrelex"
+, author =      "F. Aurenhammer and F. Hoffmann and B. Aronov"
+, title =       "Minkowski-type theorems and least-squares partitioning"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "350--357"
+, keywords =    "optimization, least squares, power diagram, matching"
+, precedes =    "aha-mttlsc-98"
+, cites =       "am-dhsrr-91, a-vdsfg-91, a-caecc-87, b-colmm-82, e-fdmem-92, ft-fhtui-87, g-cp-67, l-conm-76, l-egimv-85, ol-mcp-81, t-dsna-83, tn-gamca-91, v-ghm-89, ZZZ"
+, update =      "98.07 bibrelex, 97.11 aronov+bibrelex"
 }
 
 @techreport{ai-grvd-86
-, author =	"F. Aurenhammer and H. Imai"
-, title =	"Geometric relations among {Voronoi} diagrams"
-, type =	"Technical {Report}"
-, number =	228
-, institution =	"Inst. Informationsverarb., Techn. Univ. Graz"
-, address =	"Graz, Autria"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "F. Aurenhammer and H. Imai"
+, title =       "Geometric relations among {Voronoi} diagrams"
+, type =        "Technical {Report}"
+, number =      228
+, institution = "Inst. Informationsverarb., Techn. Univ. Graz"
+, address =     "Graz, Autria"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ai-grvd-87
-, author =	"F. Aurenhammer and H. Imai"
-, title =	"Geometric relations among {Voronoi} diagrams"
-, booktitle =	"Proc. 4th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	247
-, publisher =	"Springer-Verlag"
-, year =	1987
-, pages =	"53--65"
-, keywords =	"design of algorithms, discrete geometry, Voronoi diagrams, distance, weighted"
-, precedes =	"ai-grvd-88"
+, author =      "F. Aurenhammer and H. Imai"
+, title =       "Geometric relations among {Voronoi} diagrams"
+, booktitle =   "Proc. 4th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      247
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "53--65"
+, keywords =    "design of algorithms, discrete geometry, Voronoi diagrams, distance, weighted"
+, precedes =    "ai-grvd-88"
 }
 
 @article{ai-grvd-88
-, author =	"F. Aurenhammer and H. Imai"
-, title =	"Geometric relations among {Voronoi} diagrams"
-, journal =	"Geom. Dedicata"
-, volume =	27
-, year =	1988
-, pages =	"65--75"
-, keywords =	"design of algorithms, discrete geometry, Voronoi diagrams, distance, weighted"
-, succeeds =	"ai-grvd-87"
-, update =	"93.09 aurenhammer"
+, author =      "F. Aurenhammer and H. Imai"
+, title =       "Geometric relations among {Voronoi} diagrams"
+, journal =     "Geom. Dedicata"
+, volume =      27
+, year =        1988
+, pages =       "65--75"
+, keywords =    "design of algorithms, discrete geometry, Voronoi diagrams, distance, weighted"
+, succeeds =    "ai-grvd-87"
+, update =      "93.09 aurenhammer"
 }
 
 @techreport{ak-vd-96
-, author =	"Franz Aurenhammer and Rolf Klein"
-, title =	"Voronoi Diagrams"
-, number =	198
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1996
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr198.pdf"
-, precedes =	"ak-vd-00"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex"
+, author =      "Franz Aurenhammer and Rolf Klein"
+, title =       "Voronoi Diagrams"
+, number =      198
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1996
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr198.pdf"
+, precedes =    "ak-vd-00"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex"
 }
 
 @incollection{ak-vd-00
-, author =	"Franz Aurenhammer and Rolf Klein"
-, title =	"Voronoi Diagrams"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"201--290"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr198.pdf"
-, succeeds =	"ak-vd-96"
-, cites =	"ahknu-vdcfc-95, abms-claho-94, aesw-emstb-91, agss-ltacv-89, ahl-sqrpc-90, aiks-fkpmd-91, a-dppuv-82, aaag-ntsp-95, aa-skfgpf-95, aacktrx-tin-96, a-nemts-83, as-vdco-95, ay-aampt1-90, ay-aampt2-90, ar-cvddp-96, a-gvdps-89, a-lbvdc-98, abky-cabmm-88, abcw-cpdts-88, ab-rdt-85, a-sdcgp-85, a-pdpaa-87, a-rpccc-87, a-iadbu-88, a-lcpd-88, a-ndrcv-90, a-vdsfg-91, ae-oacwv-84, aha-mttls-92, ai-grvd-88, as-solri-92, abi-cvus-88, br-rasas-90, bo-arcgi-79, bs-dcms-76, bwy-oetac-80, be-mgot-92i, beg-pgmg-94, b-bnvd, bt-gatuf-85, bmt-dppbp-96, bcdt-osc3d-91i, bdsty-arsol-92, bg-tdrcs-93, bsty-vdhdc-95, bt-rcdt-93, bh-cpcoe-88, b-rgsdd-89, b-vdch-79, b-gtfga-80, bms-hcvdl-94, b-gog-55, c-vmpmp-85, cd-svd-88, crw-gc-91, csy-oscpf-95, cdns-nsrgs-95, c-ochaa-93, ce-iacko-87, cgt-ecabs-95, cx-alesw-96, c-bvdcp-86, c-cdt-89, c-tapga-89, c-gqmgc-93,
-		cd-vdbcd-85, ckstw-vdl3s-95, csw-fmasp-95, c-wcanh-76, cms-mfdca-94, c-narsc-87, c-agmst-89, cms-frric-93, cs-arscg-89, cmrs-tspvd-93, cw-pspp-86, dj-wtacg-89, ds-oiti-89, bms-plpco-93, dfnp-stdt-91, d-eaclm-77, dk-savd-87, dk-bspwa-97, dn-cgacp-85, d-slsv-34, d-pp-44, d-rysoa-92, dv-cprac-77, dds-saeid-92, de-apphd-96, d-nhndt-87, d-tdt-90, d-fhcdt-92, d-udrdp-50, dl-cvdrp-91, ddg-fsp-83, dfs-dgaag-90, dl-pmtds-89, dl-msp-76, d-ec-83, d-fdcac-87, d-hdvdl-91, e-acg-87, e-atccd-90, e-ubids-95, egs-ueplf-89, egs-oplms-86, eks-sspp-83, em-tdas-94, eos-calha-86, es-vda-86, ess-ztha-93, es-itfwr-96, es-otatd-91, et-qtaml-93, et-ubcdt-93, etw-otama-92, ei-drmwc-79, f-sodt-90, f-iwatd-86, f-nsa2d-92, f-vddt-92, f-savd-87, gs-nsagv-69, gj-cigtn-79, g-3dmud-95, g-agt-85, grr-vdlsm-95, grss-sracp-95,
-		goy-cvdsl-93, gs-cdtp-78, gks-ricdv-92, gmr-vdmpp-92, gs-pmgsc-85, h-ca-75, h-rvdlp-92, h-gbitp-91, hkp-itnc-91, hn-sc-89, hns-psscp-88, h-pcprn-91, hks-uevsi-93, h-oarms-79, iklm-cdf3s-93, iki-awvdr-94, iss-nriac-92, j-3dtlt-89, j-ctddt-91, j-gspgm-91, jrz-ccdt-91, km-accvd-91, km-icdmc-92, kk-cdtmb-88, kg-cgwac-92, k-csmwt-94, ks-tpscv-93, k-eccs-79, k-ndot-80, k-osps-83, kr-fcm-85, k-cddvd-80, k-cavd-89, kl-ltrab-93, kl-fsc-95, kl-mpsp-95, kmm-ricav-93a, kw-vdbgm-88, k-sssgt-56, kl-fsacl-95, l-dtmmi-94, l-esta-94, l-scsi-77, l-vdlmh-94, l-ricsa-95, l-tdvdl-80, l-matps-82, l-knnvd-82, ld-gvdp-81, ll-gdtpg-86, lw-vdllm-80, lk-qgtam-96, l-ltcrn-94, msw-sblp-92, ms-pggrg-80, m-dtchn-84, mr-vdcdg-90, mks-cplvd-96, m-tdird-76, m-mnfcp-70, m-lpltw-84, mmo-cavd-91, m-zkav-93,
-		m-uuam-28, m-rcvdp-93, m-spop-93, mmp-dgp-87, ms-getcc-88, mp-fitcp-78, m-osclv-90, m-lavd-91, osy-gvdl-86, osy-gvdl-87, oy-rmpmd-85, oim-iimvd-84, obs-stcav-92, p-etspi-77, pl-ecgvd-95, p-kpudz-82, p-mrpdt-92, ps-cgi-85, p-scnsg-57, r-odtr-91, rr-oprav-94, r-aiv-94, r-mrpdt-90, r-tbvdm-93, rsl-ashts-77, st-pwvt-88, s-cvdhd-82, s-mplbc-85, s-chdch-86, s-nfhdv-87, s-cdtvd-88, s-sdlpc-91, s-barga-93, s-cg-78, sh-cpp-75, s-icpps-85, s-atubl-94, s-let-78, s-vidt-80, s-sagdt-91, s-facdt-87, s-mmdpsl-91a, sd-csdta-95, s-smane-92, si-cvdom-92, soi-toari-90, s-rngam-83, si-atpvd-86, t-otdt-93, too-natdv-83, t-gcvdm-86, t-rngfp-80, v-mstkd-88, v-sgagc-91, v-dmrsl-09, v-nadpc-08, w-eucdt-93, ws-oacdt-87, w-cnddt-81, w-sedbe-91a, www-sdpfo-87, y-cmstk-82, y-amp-87, y-oavds-87, zm-sdnah-91, ZZZ"
-, update =	"00.11 smid, 00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 bibrelex, 97.03 icking"
-, annote =	"Chapter 5 of su-hcg-00"
+, author =      "Franz Aurenhammer and Rolf Klein"
+, title =       "Voronoi Diagrams"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "201--290"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr198.pdf"
+, succeeds =    "ak-vd-96"
+, cites =       "ahknu-vdcfc-95, abms-claho-94, aesw-emstb-91, agss-ltacv-89, ahl-sqrpc-90, aiks-fkpmd-91, a-dppuv-82, aaag-ntsp-95, aa-skfgpf-95, aacktrx-tin-96, a-nemts-83, as-vdco-95, ay-aampt1-90, ay-aampt2-90, ar-cvddp-96, a-gvdps-89, a-lbvdc-98, abky-cabmm-88, abcw-cpdts-88, ab-rdt-85, a-sdcgp-85, a-pdpaa-87, a-rpccc-87, a-iadbu-88, a-lcpd-88, a-ndrcv-90, a-vdsfg-91, ae-oacwv-84, aha-mttls-92, ai-grvd-88, as-solri-92, abi-cvus-88, br-rasas-90, bo-arcgi-79, bs-dcms-76, bwy-oetac-80, be-mgot-92i, beg-pgmg-94, b-bnvd, bt-gatuf-85, bmt-dppbp-96, bcdt-osc3d-91i, bdsty-arsol-92, bg-tdrcs-93, bsty-vdhdc-95, bt-rcdt-93, bh-cpcoe-88, b-rgsdd-89, b-vdch-79, b-gtfga-80, bms-hcvdl-94, b-gog-55, c-vmpmp-85, cd-svd-88, crw-gc-91, csy-oscpf-95, cdns-nsrgs-95, c-ochaa-93, ce-iacko-87, cgt-ecabs-95, cx-alesw-96, c-bvdcp-86, c-cdt-89, c-tapga-89, c-gqmgc-93,
+                cd-vdbcd-85, ckstw-vdl3s-95, csw-fmasp-95, c-wcanh-76, cms-mfdca-94, c-narsc-87, c-agmst-89, cms-frric-93, cs-arscg-89, cmrs-tspvd-93, cw-pspp-86, dj-wtacg-89, ds-oiti-89, bms-plpco-93, dfnp-stdt-91, d-eaclm-77, dk-savd-87, dk-bspwa-97, dn-cgacp-85, d-slsv-34, d-pp-44, d-rysoa-92, dv-cprac-77, dds-saeid-92, de-apphd-96, d-nhndt-87, d-tdt-90, d-fhcdt-92, d-udrdp-50, dl-cvdrp-91, ddg-fsp-83, dfs-dgaag-90, dl-pmtds-89, dl-msp-76, d-ec-83, d-fdcac-87, d-hdvdl-91, e-acg-87, e-atccd-90, e-ubids-95, egs-ueplf-89, egs-oplms-86, eks-sspp-83, em-tdas-94, eos-calha-86, es-vda-86, ess-ztha-93, es-itfwr-96, es-otatd-91, et-qtaml-93, et-ubcdt-93, etw-otama-92, ei-drmwc-79, f-sodt-90, f-iwatd-86, f-nsa2d-92, f-vddt-92, f-savd-87, gs-nsagv-69, gj-cigtn-79, g-3dmud-95, g-agt-85, grr-vdlsm-95, grss-sracp-95,
+                goy-cvdsl-93, gs-cdtp-78, gks-ricdv-92, gmr-vdmpp-92, gs-pmgsc-85, h-ca-75, h-rvdlp-92, h-gbitp-91, hkp-itnc-91, hn-sc-89, hns-psscp-88, h-pcprn-91, hks-uevsi-93, h-oarms-79, iklm-cdf3s-93, iki-awvdr-94, iss-nriac-92, j-3dtlt-89, j-ctddt-91, j-gspgm-91, jrz-ccdt-91, km-accvd-91, km-icdmc-92, kk-cdtmb-88, kg-cgwac-92, k-csmwt-94, ks-tpscv-93, k-eccs-79, k-ndot-80, k-osps-83, kr-fcm-85, k-cddvd-80, k-cavd-89, kl-ltrab-93, kl-fsc-95, kl-mpsp-95, kmm-ricav-93a, kw-vdbgm-88, k-sssgt-56, kl-fsacl-95, l-dtmmi-94, l-esta-94, l-scsi-77, l-vdlmh-94, l-ricsa-95, l-tdvdl-80, l-matps-82, l-knnvd-82, ld-gvdp-81, ll-gdtpg-86, lw-vdllm-80, lk-qgtam-96, l-ltcrn-94, msw-sblp-92, ms-pggrg-80, m-dtchn-84, mr-vdcdg-90, mks-cplvd-96, m-tdird-76, m-mnfcp-70, m-lpltw-84, mmo-cavd-91, m-zkav-93,
+                m-uuam-28, m-rcvdp-93, m-spop-93, mmp-dgp-87, ms-getcc-88, mp-fitcp-78, m-osclv-90, m-lavd-91, osy-gvdl-86, osy-gvdl-87, oy-rmpmd-85, oim-iimvd-84, obs-stcav-92, p-etspi-77, pl-ecgvd-95, p-kpudz-82, p-mrpdt-92, ps-cgi-85, p-scnsg-57, r-odtr-91, rr-oprav-94, r-aiv-94, r-mrpdt-90, r-tbvdm-93, rsl-ashts-77, st-pwvt-88, s-cvdhd-82, s-mplbc-85, s-chdch-86, s-nfhdv-87, s-cdtvd-88, s-sdlpc-91, s-barga-93, s-cg-78, sh-cpp-75, s-icpps-85, s-atubl-94, s-let-78, s-vidt-80, s-sagdt-91, s-facdt-87, s-mmdpsl-91a, sd-csdta-95, s-smane-92, si-cvdom-92, soi-toari-90, s-rngam-83, si-atpvd-86, t-otdt-93, too-natdv-83, t-gcvdm-86, t-rngfp-80, v-mstkd-88, v-sgagc-91, v-dmrsl-09, v-nadpc-08, w-eucdt-93, ws-oacdt-87, w-cnddt-81, w-sedbe-91a, www-sdpfo-87, y-cmstk-82, y-amp-87, y-oavds-87, zm-sdnah-91, ZZZ"
+, update =      "00.11 smid, 00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 bibrelex, 97.03 icking"
+, annote =      "Chapter 5 of su-hcg-00"
 }
 
 @techreport{as-solri-91t
-, author =	"F. Aurenhammer and O. Schwarzkopf"
-, title =	"A Simple On-line Randomized Incremental Algorithm for Computing Higher Order {Voronoi} Diagrams"
-, type =	"Technical {Report}"
-, institution =	"Freie Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, year =	1991
-, precedes =	"as-solri-91"
-, update =	"00.03 bibrelex, 97.11 bibrelex"
+, author =      "F. Aurenhammer and O. Schwarzkopf"
+, title =       "A Simple On-line Randomized Incremental Algorithm for Computing Higher Order {Voronoi} Diagrams"
+, type =        "Technical {Report}"
+, institution = "Freie Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, year =        1991
+, precedes =    "as-solri-91"
+, update =      "00.03 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{as-solri-91
-, author =	"F. Aurenhammer and O. Schwarzkopf"
-, title =	"A simple on-line randomized incremental algorithm for computing higher order {Voronoi} diagrams"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"142--151"
-, keywords =	"Voronoi diagrams, geometric transforms, dynamization"
-, succeeds =	"as-solri-91t"
-, precedes =	"as-solri-92"
-, cites =	"aesw-emstb-90, agss-ltacv-89, a-ndrcv-90, a-pdpaa-87, as-solri-91t, bdsty-arsol-90, bdt-riach-, cegss-cfals-91, c-narsc-87, cs-arscg-89, dsst-mdsp-89, e-acg-87, gks-ricdv-90, l-knnvd-82, mmo-cavd-91, m-lavd-91, s-riads-91, s-lpchm-90, s-sfira-90, w-csedb-91, ZZZ"
-, update =	"00.03 bibrelex, 97.11 bibrelex, 93.09 aurenhammer"
+, author =      "F. Aurenhammer and O. Schwarzkopf"
+, title =       "A simple on-line randomized incremental algorithm for computing higher order {Voronoi} diagrams"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "142--151"
+, keywords =    "Voronoi diagrams, geometric transforms, dynamization"
+, succeeds =    "as-solri-91t"
+, precedes =    "as-solri-92"
+, cites =       "aesw-emstb-90, agss-ltacv-89, a-ndrcv-90, a-pdpaa-87, as-solri-91t, bdsty-arsol-90, bdt-riach-, cegss-cfals-91, c-narsc-87, cs-arscg-89, dsst-mdsp-89, e-acg-87, gks-ricdv-90, l-knnvd-82, mmo-cavd-91, m-lavd-91, s-riads-91, s-lpchm-90, s-sfira-90, w-csedb-91, ZZZ"
+, update =      "00.03 bibrelex, 97.11 bibrelex, 93.09 aurenhammer"
 }
 
 @article{as-solri-92
-, author =	"F. Aurenhammer and O. Schwarzkopf"
-, title =	"A simple on-line randomized incremental algorithm for computing higher order {Voronoi} diagrams"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, year =	1992
-, pages =	"363--381"
-, keywords =	"Voronoi diagrams, geometric transforms, dynamization"
-, succeeds =	"as-solri-91"
-, update =	"93.09 aurenhammer, 93.05 schwarzkopf"
+, author =      "F. Aurenhammer and O. Schwarzkopf"
+, title =       "A simple on-line randomized incremental algorithm for computing higher order {Voronoi} diagrams"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, year =        1992
+, pages =       "363--381"
+, keywords =    "Voronoi diagrams, geometric transforms, dynamization"
+, succeeds =    "as-solri-91"
+, update =      "93.09 aurenhammer, 93.05 schwarzkopf"
 }
 
 @article{as-pvd-91
-, author =	"F. Aurenhammer and G. St{\"o}ckl"
-, title =	"On the peeper's {Voronoi} diagram"
-, journal =	"SIGACT News"
-, volume =	22
-, number =	4
-, year =	1991
-, pages =	"50--59"
-, keywords =	"Voronoi diagrams, visibility, lower envelope"
-, update =	"93.09 aurenhammer"
+, author =      "F. Aurenhammer and G. St{\"o}ckl"
+, title =       "On the peeper's {Voronoi} diagram"
+, journal =     "SIGACT News"
+, volume =      22
+, number =      4
+, year =        1991
+, pages =       "50--59"
+, keywords =    "Voronoi diagrams, visibility, lower envelope"
+, update =      "93.09 aurenhammer"
 }
 
 @article{as-sslro-92
-, author =	"F. Aurenhammer and G. St{\"o}ckl"
-, title =	"Searching for segments with largest relative overlap"
-, journal =	"Inform. Process. Lett."
-, volume =	41
-, year =	1992
-, pages =	"103--108"
-, keywords =	"line segments, search structure, one-dimensional, two-dimensional"
-, update =	"93.09 aurenhammer+jones"
+, author =      "F. Aurenhammer and G. St{\"o}ckl"
+, title =       "Searching for segments with largest relative overlap"
+, journal =     "Inform. Process. Lett."
+, volume =      41
+, year =        1992
+, pages =       "103--108"
+, keywords =    "line segments, search structure, one-dimensional, two-dimensional"
+, update =      "93.09 aurenhammer+jones"
 }
 
 @inproceedings{asw-popfp-91
-, author =	"Franz Aurenhammer and Gerd St{\"o}ckl and Emo Welzl"
-, title =	"The post office problem for fuzzy point sets"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"1--11"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Franz Aurenhammer and Gerd St{\"o}ckl and Emo Welzl"
+, title =       "The post office problem for fuzzy point sets"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "1--11"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{aflst-caolt-95
-, author =	"Giorgio Ausiello and Esteban Feuerstein and Stefano Leonardi and Leen Stougie and Maurizio Talamo"
-, title =	"Competitive Algorithms for the On-line Traveling Salesman"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"206--217"
-, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
+, author =      "Giorgio Ausiello and Esteban Feuerstein and Stefano Leonardi and Leen Stougie and Maurizio Talamo"
+, title =       "Competitive Algorithms for the On-line Traveling Salesman"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "206--217"
+, update =      "99.07 bibrelex, 96.01 smid, 95.05 mitchell"
 }
 
 @inproceedings{aimn-iamlp-90
-, author =	"G. Ausiello and G. F. Italiano and A. Marchetti-Spac\-camela and U. Nanni"
-, title =	"Incremental Algorithms for Minimal Length Paths"
-, booktitle =	"Proc. ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"12--21"
-, update =	"94.01 tamassia"
+, author =      "G. Ausiello and G. F. Italiano and A. Marchetti-Spac\-camela and U. Nanni"
+, title =       "Incremental Algorithms for Minimal Length Paths"
+, booktitle =   "Proc. ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "12--21"
+, update =      "94.01 tamassia"
 }
 
 @article{ajd-cdans-97
-, author =	"S. P. Austin and R. B. Jerard and R. L. Drysdale"
-, title =	"Comparison of Discretization Algorithms for NURBS Surfaces With Application to Numerically Controlled Machining"
-, journal =	"Comput. Aided Design"
-, volume =	29
-, number =	1
-, month =	jan
-, year =	1997
-, pages =	"71--83"
-, update =	"97.11 held"
+, author =      "S. P. Austin and R. B. Jerard and R. L. Drysdale"
+, title =       "Comparison of Discretization Algorithms for NURBS Surfaces With Application to Numerically Controlled Machining"
+, journal =     "Comput. Aided Design"
+, volume =      29
+, number =      1
+, month =       jan
+, year =        1997
+, pages =       "71--83"
+, update =      "97.11 held"
 }
 
 @article{as-vswma-93
-, author =	"S. V. Avgustinovich and S. V. Sevast{\'\j}anov"
-, title =	"Vector Summation within Minimal Angle"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	5
-, month =	mar
-, year =	1993
-, pages =	"235--239"
-, update =	"93.09 held+milone+mitchell"
+, author =      "S. V. Avgustinovich and S. V. Sevast{\'\j}anov"
+, title =       "Vector Summation within Minimal Angle"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      5
+, month =       mar
+, year =        1993
+, pages =       "235--239"
+, update =      "93.09 held+milone+mitchell"
 }
 
 @inproceedings{as-ddsrs-81
-, author =	"Z. Aviad and E. Shamir"
-, title =	"A direct dynamic solution to range search and related problems for product regions"
-, booktitle =	"Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1981
-, pages =	"123--126"
-, keywords =	"orthogonal range queries, integer coordinates, multidimensional search"
+, author =      "Z. Aviad and E. Shamir"
+, title =       "A direct dynamic solution to range search and related problems for product regions"
+, booktitle =   "Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1981
+, pages =       "123--126"
+, keywords =    "orthogonal range queries, integer coordinates, multidimensional search"
 }
 
 @article{a-shwmp-83
-, author =	"D. Avis"
-, title =	"A survey of heuristics for the weighted matching problem"
-, journal =	"Networks"
-, volume =	13
-, year =	1983
-, pages =	"475--493"
-, keywords =	"heuristics, worst-case analysis, average-case analysis"
+, author =      "D. Avis"
+, title =       "A survey of heuristics for the weighted matching problem"
+, journal =     "Networks"
+, volume =      13
+, year =        1983
+, pages =       "475--493"
+, keywords =    "heuristics, worst-case analysis, average-case analysis"
 }
 
 @article{a-clbch-80
-, author =	"D. Avis"
-, title =	"Comments on a lower bound for convex hull determination"
-, journal =	"Inform. Process. Lett."
-, volume =	11
-, year =	1980
-, pages =	126
-, keywords =	"convex hull, lower bounds, linear decision trees"
+, author =      "D. Avis"
+, title =       "Comments on a lower bound for convex hull determination"
+, journal =     "Inform. Process. Lett."
+, volume =      11
+, year =        1980
+, pages =       126
+, keywords =    "convex hull, lower bounds, linear decision trees"
 }
 
 @article{a-dp-86
-, author =	"D. Avis"
-, title =	"Diameter partitioning"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"265--276"
-, keywords =	"planar point sets, partition, diameter"
+, author =      "D. Avis"
+, title =       "Diameter partitioning"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "265--276"
+, keywords =    "planar point sets, partition, diameter"
 }
 
 @article{a-grtwr-96
-, author =	"D. Avis"
-, title =	"Generating rooted triangulations without repetitions"
-, journal =	"Algorithmica"
-, volume =	16
-, year =	1996
-, pages =	"618--632"
-, update =	"97.03 smid"
+, author =      "D. Avis"
+, title =       "Generating rooted triangulations without repetitions"
+, journal =     "Algorithmica"
+, volume =      16
+, year =        1996
+, pages =       "618--632"
+, update =      "97.03 smid"
 }
 
 @inproceedings{a-lbgp-80
-, author =	"D. Avis"
-, title =	"Lower bounds for geometric problems"
-, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
-, year =	1980
-, pages =	"35--40"
-, keywords =	"lower bounds, linear decision trees, quadratic decision trees"
+, author =      "D. Avis"
+, title =       "Lower bounds for geometric problems"
+, booktitle =   "Proc. 18th Allerton Conf. Commun. Control Comput."
+, year =        1980
+, pages =       "35--40"
+, keywords =    "lower bounds, linear decision trees, quadratic decision trees"
 }
 
 @article{a-npps-84
-, author =	"D. Avis"
-, title =	"Non-partitionable point sets"
-, journal =	"Inform. Process. Lett."
-, volume =	19
-, year =	1984
-, pages =	"125--129"
-, keywords =	"discrete geometry, decomposition, range search"
+, author =      "D. Avis"
+, title =       "Non-partitionable point sets"
+, journal =     "Inform. Process. Lett."
+, volume =      19
+, year =        1984
+, pages =       "125--129"
+, keywords =    "discrete geometry, decomposition, range search"
 }
 
 @article{a-cfchs-82
-, author =	"D. Avis"
-, title =	"On the complexity of finding the convex hull of a set of points"
-, journal =	"Discrete Appl. Math."
-, volume =	4
-, year =	1982
-, pages =	"81--86"
-, keywords =	"convex hull, lower bounds, linear decision trees"
+, author =      "D. Avis"
+, title =       "On the complexity of finding the convex hull of a set of points"
+, journal =     "Discrete Appl. Math."
+, volume =      4
+, year =        1982
+, pages =       "81--86"
+, keywords =    "convex hull, lower bounds, linear decision trees"
 }
 
 @inproceedings{a-ppss-85
-, author =	"D. Avis"
-, title =	"On the partitionability of point sets in space"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"116--120"
-, keywords =	"point sets, partition, half spaces"
-, comments =	"some results appeared in a-spiag-85"
-, cites =	"k-ss-73, w-pr-82, y-3spia-83, de-ssio-84, a-npps-84, yb-cf-61, m-it-62, g-ncp-63, g-gcpnc-58, yy-gaddg-85, ZZZ"
-, update =	"97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "D. Avis"
+, title =       "On the partitionability of point sets in space"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "116--120"
+, keywords =    "point sets, partition, half spaces"
+, comments =    "some results appeared in a-spiag-85"
+, cites =       "k-ss-73, w-pr-82, y-3spia-83, de-ssio-84, a-npps-84, yb-cf-61, m-it-62, g-ncp-63, g-gcpnc-58, yy-gaddg-85, ZZZ"
+, update =      "97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 % ### alias "a-spiag-87"
 @inproceedings{a-spiag-85
-, author =	"D. Avis"
-, title =	"Space partitioning and its application to generalized retrieval problems"
-, booktitle =	"Proc. Internat. Conf. Found. Data Organization"
-, site =	"Kyoto, Japan"
-, year =	1985
-, pages =	"154--162"
-, keywords =	"searching, point sets, partition, half spaces"
-, update =	"95.05 korneenko"
+, author =      "D. Avis"
+, title =       "Space partitioning and its application to generalized retrieval problems"
+, booktitle =   "Proc. Internat. Conf. Found. Data Organization"
+, site =        "Kyoto, Japan"
+, year =        1985
+, pages =       "154--162"
+, keywords =    "searching, point sets, partition, half spaces"
+, update =      "95.05 korneenko"
 }
 
 % == "a-spiag-85"
 @inproceedings{a-spiag-87
-, author =	"D. Avis"
-, title =	"Space partitioning and its application to generalized retrieval problems"
-, booktitle =	"Proc. Internat. Conf. Found. Data Organization, 1985"
-, publisher =	"Plenum Press"
-, address =	"Kyoto, Japan"
-, year =	1987
-, pages =	"237--248"
-, keywords =	"searching, point sets, partition, half spaces"
-, update =	"95.05 korneenko"
+, author =      "D. Avis"
+, title =       "Space partitioning and its application to generalized retrieval problems"
+, booktitle =   "Proc. Internat. Conf. Found. Data Organization, 1985"
+, publisher =   "Plenum Press"
+, address =     "Kyoto, Japan"
+, year =        1987
+, pages =       "237--248"
+, keywords =    "searching, point sets, partition, half spaces"
+, update =      "95.05 korneenko"
 }
 
 @article{a-nfnfp-84
-, author =	"D. Avis"
-, title =	"The number of furthest neighbors of a finite planar set"
-, journal =	"Amer. Math. Monthly"
-, volume =	91
-, year =	1984
-, pages =	"417--420"
-, keywords =	"combinatorial geometry, proximity"
+, author =      "D. Avis"
+, title =       "The number of furthest neighbors of a finite planar set"
+, journal =     "Amer. Math. Monthly"
+, volume =      91
+, year =        1984
+, pages =       "417--420"
+, keywords =    "combinatorial geometry, proximity"
 }
 
 @article{a-wcbem-81
-, author =	"D. Avis"
-, title =	"Worst case bounds for the {Euclidean} matching problem"
-, journal =	"Comput. Math. Appl."
-, volume =	7
-, year =	1981
-, pages =	"251--257"
-, keywords =	"heuristics, worst-case analysis"
+, author =      "D. Avis"
+, title =       "Worst case bounds for the {Euclidean} matching problem"
+, journal =     "Comput. Math. Appl."
+, volume =      7
+, year =        1981
+, pages =       "251--257"
+, keywords =    "heuristics, worst-case analysis"
 }
 
 @inproceedings{abdeghz-umpca-93
-, author =	"D. Avis and B. Beresford-Smith and L. Devroye and H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and B. Zhu"
-, title =	"Unoriented {$\Theta$}-Maxima in the Plane"
-, booktitle =	"Proc. of the 16th Australian Conf. in Comp. Science"
-, site =	"Brisbane"
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "D. Avis and B. Beresford-Smith and L. Devroye and H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and B. Zhu"
+, title =       "Unoriented {$\Theta$}-Maxima in the Plane"
+, booktitle =   "Proc. of the 16th Australian Conf. in Comp. Science"
+, site =        "Brisbane"
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @article{abdeghz-utmp-98
-, author =	"D. Avis and B. Beresford-Smith and L. Devroye and H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and B. Zhu"
-, title =	"Unoriented {$\Theta$}-Maxima in the Plane: {Complexity} and Algorithms"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1998
-, pages =	"278--296"
-, update =	"99.07 smid"
+, author =      "D. Avis and B. Beresford-Smith and L. Devroye and H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and B. Zhu"
+, title =       "Unoriented {$\Theta$}-Maxima in the Plane: {Complexity} and Algorithms"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1998
+, pages =       "278--296"
+, update =      "99.07 smid"
 }
 
 @unpublished{abdeghz-ump2
-, author =	"D. Avis and B. Beresford-Smith and L. Devroye and H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and B. Zhu"
-, title =	"Unoriented {$\Theta$}-Maxima in the Plane {II}"
-, note =	"in preparation"
-, update =	"98.11 bibrelex"
+, author =      "D. Avis and B. Beresford-Smith and L. Devroye and H. ElGindy and E. Gu{\'e}vremont and F. Hurtado and B. Zhu"
+, title =       "Unoriented {$\Theta$}-Maxima in the Plane {II}"
+, note =        "in preparation"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{ab-acddv-83
-, author =	"David Avis and Binay K. Bhattacharya"
-, title =	"Algorithms for Computing $d$-dimensional {Voronoi} Diagrams and their Duals"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"159--180"
-, keywords =	"Voronoi diagrams, $d$-dimensional, linear programming"
-, update =	"01.04 icking"
+, author =      "David Avis and Binay K. Bhattacharya"
+, title =       "Algorithms for Computing $d$-dimensional {Voronoi} Diagrams and their Duals"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "159--180"
+, keywords =    "Voronoi diagrams, $d$-dimensional, linear programming"
+, update =      "01.04 icking"
 }
 
 @techreport{abi-cvus-87
-, author =	"D. Avis and B. K. Bhattacharya and H. Imai"
-, title =	"Computing the volume of the union of spheres"
-, type =	"Technical {Report}"
-, number =	"SOCS 87.3"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1987
-, precedes =	"abi-cvus-88"
+, author =      "D. Avis and B. K. Bhattacharya and H. Imai"
+, title =       "Computing the volume of the union of spheres"
+, type =        "Technical {Report}"
+, number =      "SOCS 87.3"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1987
+, precedes =    "abi-cvus-88"
 }
 
 @article{abi-cvus-88
-, author =	"D. Avis and B. K. Bhattacharya and H. Imai"
-, title =	"Computing the volume of the union of spheres"
-, journal =	"Visual Comput."
-, volume =	3
-, year =	1988
-, pages =	"323--328"
-, keywords =	"volume, spheres, Voronoi diagrams"
-, succeeds =	"abi-cvus-87"
+, author =      "D. Avis and B. K. Bhattacharya and H. Imai"
+, title =       "Computing the volume of the union of spheres"
+, journal =     "Visual Comput."
+, volume =      3
+, year =        1988
+, pages =       "323--328"
+, keywords =    "volume, spheres, Voronoi diagrams"
+, succeeds =    "abi-cvus-87"
 }
 
 @inproceedings{absstz-sacp-96
-, author =	"D. Avis and P. Bose and T. Shermer and J. Snoeyink and G. Toussaint and B. Zhu"
-, title =	"On the Sectional Area of Convex Polytopes"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"C11--C12"
-, cites =	"c-oaitd-92, cd-icott-87, bdkst-cmotc-96, dj-cccsp-73, k-cpvc-93, s-mv-93, s-labp-92, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "D. Avis and P. Bose and T. Shermer and J. Snoeyink and G. Toussaint and B. Zhu"
+, title =       "On the Sectional Area of Convex Polytopes"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "C11--C12"
+, cites =       "c-oaitd-92, cd-icott-87, bdkst-cmotc-96, dj-cccsp-73, k-cpvc-93, s-mv-93, s-labp-92, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{ab-hgach-95
-, author =	"David Avis and David Bremner"
-, title =	"How Good are Convex Hull Algorithms?"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"20--28"
-, keywords =	"vertex enumeration, pivoting"
-, cites =	"af-pachv-92, bdh-qach-93, bl-cacp-93, b-icp-83, cgaf-gstlm-94, ck-acp-70, c-ochaa-93, c-lp-83, cs-adpch-88, d-cvem-83, f-crmv0-, gkz-drmd-94, h-sretn-91, k-pptrl-74, km-hgisa-72, l-epcrn-88, lt-sptcc-91, l-rtp-91, mrtt-ddm-53, s-chaop-81, s-chdch-86, y-stgd-90, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "David Avis and David Bremner"
+, title =       "How Good are Convex Hull Algorithms?"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "20--28"
+, keywords =    "vertex enumeration, pivoting"
+, cites =       "af-pachv-92, bdh-qach-93, bl-cacp-93, b-icp-83, cgaf-gstlm-94, ck-acp-70, c-ochaa-93, c-lp-83, cs-adpch-88, d-cvem-83, f-crmv0-, gkz-drmd-94, h-sretn-91, k-pptrl-74, km-hgisa-72, l-epcrn-88, lt-sptcc-91, l-rtp-91, mrtt-ddm-53, s-chaop-81, s-chdch-86, y-stgd-90, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{abs-hgach-97
-, author =	"D. Avis and D. Bremner and R. Seidel"
-, title =	"How good are convex hull algorithms?"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"265--302"
-, update =	"97.07 devillers"
+, author =      "D. Avis and D. Bremner and R. Seidel"
+, title =       "How good are convex hull algorithms?"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "265--302"
+, update =      "97.07 devillers"
 }
 
 @article{ac-nbpr-78
-, author =	"D. Avis and V. Chv{\'a}tal"
-, title =	"Notes on {Bland's} pivoting rule"
-, journal =	"Math. Programming Study"
-, volume =	8
-, year =	1978
-, pages =	"24--34"
-, update =	"97.03 gaertner+salinger"
+, author =      "D. Avis and V. Chv{\'a}tal"
+, title =       "Notes on {Bland's} pivoting rule"
+, journal =     "Math. Programming Study"
+, volume =      8
+, year =        1978
+, pages =       "24--34"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{ads-paghe-88
-, author =	"D. Avis and B. Davis and J. M. Steele"
-, title =	"Probabilistic analysis of a greedy heuristic for {Euclidean} matching"
-, journal =	"Probab. Engin. Inform. Sci."
-, volume =	2
-, year =	1988
-, pages =	"143--156"
-, update =	"93.09 rote"
+, author =      "D. Avis and B. Davis and J. M. Steele"
+, title =       "Probabilistic analysis of a greedy heuristic for {Euclidean} matching"
+, journal =     "Probab. Engin. Inform. Sci."
+, volume =      2
+, year =        1988
+, pages =       "143--156"
+, update =      "93.09 rote"
 }
 
 @inproceedings{ad-lecmf-89
-, author =	"D. Avis and M. Deza"
-, title =	"{$L_{1}$} embeddability, complexity, and multicommodity flows"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	30
+, author =      "D. Avis and M. Deza"
+, title =       "{$L_{1}$} embeddability, complexity, and multicommodity flows"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       30
 }
 
 @techreport{ad-ahdsp-87
-, author =	"D. Avis and M. Doskas"
-, title =	"Algorithms for high dimensional stabbing problems"
-, type =	"Technical {Report}"
-, number =	"SOCS 87.2"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1987
-, precedes =	"ad-ahdsp-88"
+, author =      "D. Avis and M. Doskas"
+, title =       "Algorithms for high dimensional stabbing problems"
+, type =        "Technical {Report}"
+, number =      "SOCS 87.2"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1987
+, precedes =    "ad-ahdsp-88"
 }
 
 @incollection{ad-ahdsp-88
-, author =	"D. Avis and M. Doskas"
-, title =	"Algorithms for high dimensional stabbing problems"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"199--210"
-, keywords =	"transversals, hyperplanes, stabbing, polyhedra, linear programming"
-, succeeds =	"ad-ahdsp-87"
-, update =	"99.11 bibrelex"
+, author =      "D. Avis and M. Doskas"
+, title =       "Algorithms for high dimensional stabbing problems"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "199--210"
+, keywords =    "transversals, hyperplanes, stabbing, polyhedra, linear programming"
+, succeeds =    "ad-ahdsp-87"
+, update =      "99.11 bibrelex"
 }
 
 @article{ad-ahdsp-90
-, author =	"D. Avis and M. Doskas"
-, title =	"Algorithms for high dimensional stabbing problems"
-, journal =	"Discrete Appl. Math."
-, volume =	27
-, year =	1990
-, pages =	"59--62"
-, update =	"97.11 bibrelex"
+, author =      "D. Avis and M. Doskas"
+, title =       "Algorithms for high dimensional stabbing problems"
+, journal =     "Discrete Appl. Math."
+, volume =      27
+, year =        1990
+, pages =       "59--62"
+, update =      "97.11 bibrelex"
 }
 
 @article{ae-caps-83
-, author =	"D. Avis and H. ElGindy"
-, title =	"A combinatorial approach to polygon similarity"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	"IT-2"
-, year =	1983
-, pages =	"148--150"
-, keywords =	"polygons, similarity, pattern matching, visibility graphs"
+, author =      "D. Avis and H. ElGindy"
+, title =       "A combinatorial approach to polygon similarity"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      "IT-2"
+, year =        1983
+, pages =       "148--150"
+, keywords =    "polygons, similarity, pattern matching, visibility graphs"
 }
 
 @article{ae-tpss-87
-, author =	"D. Avis and H. ElGindy"
-, title =	"Triangulating point sets in space"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"99--111"
-, keywords =	"triangulation, decomposition, three-dimensional, $d$-dimensional, point sets"
-, succeeds =	"ae-tspss-86"
+, author =      "D. Avis and H. ElGindy"
+, title =       "Triangulating point sets in space"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "99--111"
+, keywords =    "triangulation, decomposition, three-dimensional, $d$-dimensional, point sets"
+, succeeds =    "ae-tspss-86"
 }
 
 @inproceedings{ae-tspss-86
-, author =	"D. Avis and H. ElGindy"
-, title =	"Triangulating simplicial point sets in space"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"133--141"
-, keywords =	"triangulation, decomposition, three-dimensional, $d$-dimensional, point sets"
-, precedes =	"ae-tpss-87"
-, cites =	"g-cp-67, ps-cgi-85, rs-tchnp-85, ph-chfsp-77, k-osps-83, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. Avis and H. ElGindy"
+, title =       "Triangulating simplicial point sets in space"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "133--141"
+, keywords =    "triangulation, decomposition, three-dimensional, $d$-dimensional, point sets"
+, precedes =    "ae-tpss-87"
+, cites =       "g-cp-67, ps-cgi-85, rs-tchnp-85, ph-chfsp-77, k-osps-83, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{aes-solac-85
-, author =	"D. Avis and H. ElGindy and R. Seidel"
-, title =	"Simple on-line algorithms for convex polygons"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"23--42"
-, keywords =	"convex hull, on-line, planar point sets, intersection, polygons"
-, annote =	"Maintains convex hull of $n$ points in $O(\log n)$
-		 time per insertion"
+, author =      "D. Avis and H. ElGindy and R. Seidel"
+, title =       "Simple on-line algorithms for convex polygons"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "23--42"
+, keywords =    "convex hull, on-line, planar point sets, intersection, polygons"
+, annote =      "Maintains convex hull of $n$ points in $O(\log n)$
+                 time per insertion"
 }
 
 @article{aep-dddsp-91
-, author =	"D. Avis and P. Erd{\H o}s and J. Pach"
-, title =	"Distinct distances determined by subsets of a point set in space"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, year =	1991
-, pages =	"1--11"
+, author =      "D. Avis and P. Erd{\H o}s and J. Pach"
+, title =       "Distinct distances determined by subsets of a point set in space"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, year =        1991
+, pages =       "1--11"
 }
 
 @article{aep-rds-88
-, author =	"D. Avis and P. Erd{\H o}s and J. Pach"
-, title =	"Repeated distances in the space"
-, journal =	"Graphs Combin."
-, volume =	4
-, year =	1988
-, pages =	"207--217"
-, keywords =	"combinatorial geometry, proximity"
+, author =      "D. Avis and P. Erd{\H o}s and J. Pach"
+, title =       "Repeated distances in the space"
+, journal =     "Graphs Combin."
+, volume =      4
+, year =        1988
+, pages =       "207--217"
+, keywords =    "combinatorial geometry, proximity"
 }
 
 @article{af-beals-91
-, author =	"D. Avis and K. Fukuda"
-, title =	"A basis enumeration algorithm for linear systems with geometric applications"
-, journal =	"Appl. Math. Lett."
-, volume =	4
-, number =	5
-, year =	1991
-, pages =	"39--42"
-, keywords =	"linear programing, convex hull, oriented matroid"
-, update =	"95.05 korneenko"
+, author =      "D. Avis and K. Fukuda"
+, title =       "A basis enumeration algorithm for linear systems with geometric applications"
+, journal =     "Appl. Math. Lett."
+, volume =      4
+, number =      5
+, year =        1991
+, pages =       "39--42"
+, keywords =    "linear programing, convex hull, oriented matroid"
+, update =      "95.05 korneenko"
 }
 
 @techreport{af-pachv-90
-, author =	"D. Avis and K. Fukuda"
-, title =	"A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra"
-, type =	"Technical {Report}"
-, number =	"B-237"
-, institution =	"Dept. of Information Science, Tokyo Institute of Technology"
-, address =	"Tokyo, Japan"
-, month =	nov
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "D. Avis and K. Fukuda"
+, title =       "A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra"
+, type =        "Technical {Report}"
+, number =      "B-237"
+, institution = "Dept. of Information Science, Tokyo Institute of Technology"
+, address =     "Tokyo, Japan"
+, month =       nov
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{af-pachv-91
-, author =	"D. Avis and K. Fukuda"
-, title =	"A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"98--104"
-, precedes =	"af-pachv-92"
-, cites =	"af-pachv-90, b-calp-77, ck-acp-70, c-lp-83, d-cvem-83, eos-calha-86, e-acg-87, eg-tsa-89, f-omp-82, fm-fccm-91, hiiry-owlll-90, mr-scmfa-80, mrtt-ddm-53, s-chdch-86, s-chaop-81, t-cccm-85, t-fccmo-87, t-lqpom-85, w-cefao-87, ZZZ"
-, update =	"97.11 bibrelex, 93.09 rote"
+, author =      "D. Avis and K. Fukuda"
+, title =       "A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "98--104"
+, precedes =    "af-pachv-92"
+, cites =       "af-pachv-90, b-calp-77, ck-acp-70, c-lp-83, d-cvem-83, eos-calha-86, e-acg-87, eg-tsa-89, f-omp-82, fm-fccm-91, hiiry-owlll-90, mr-scmfa-80, mrtt-ddm-53, s-chdch-86, s-chaop-81, t-cccm-85, t-fccmo-87, t-lqpom-85, w-cefao-87, ZZZ"
+, update =      "97.11 bibrelex, 93.09 rote"
 }
 
 @article{af-pachv-92
-, author =	"D. Avis and K. Fukuda"
-, title =	"A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra"
-, journal =	"Discrete Comput. Geom."
-, volume =	8
-, year =	1992
-, pages =	"295--313"
-, succeeds =	"af-pachv-91"
-, update =	"97.11 bibrelex"
+, author =      "D. Avis and K. Fukuda"
+, title =       "A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra"
+, journal =     "Discrete Comput. Geom."
+, volume =      8
+, year =        1992
+, pages =       "295--313"
+, succeeds =    "af-pachv-91"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{af-rse-92
-, author =	"D. Avis and K. Fukuda"
-, title =	"Reverse Search for Enumeration"
-, number =	"No.~92-5"
-, institution =	"Tsukuba University, Graduate School of Systems Management, Tokyo, Japan"
-, month =	apr
-, year =	1992
-, comments =	"generates all enumerations of triangulations, spanning trees, etc."
-, update =	"95.01 held"
+, author =      "D. Avis and K. Fukuda"
+, title =       "Reverse Search for Enumeration"
+, number =      "No.~92-5"
+, institution = "Tsukuba University, Graduate School of Systems Management, Tokyo, Japan"
+, month =       apr
+, year =        1992
+, comments =    "generates all enumerations of triangulations, spanning trees, etc."
+, update =      "95.01 held"
 }
 
 @article{af-rse-96
-, author =	"D. Avis and K. Fukuda"
-, title =	"Reverse search for enumeration"
-, journal =	"Discrete Appl. Math."
-, volume =	65
-, year =	1996
-, pages =	"21--46"
-, url =	"http://www.ifor.math.ethz.ch/staff/fukuda/fukuda.html"
-, update =	"98.03 houle, 97.03 pocchiola, 96.05 fukuda"
-, annote =	"Reverse search is a general exhaustive search technique
+, author =      "D. Avis and K. Fukuda"
+, title =       "Reverse search for enumeration"
+, journal =     "Discrete Appl. Math."
+, volume =      65
+, year =        1996
+, pages =       "21--46"
+, url = "http://www.ifor.math.ethz.ch/staff/fukuda/fukuda.html"
+, update =      "98.03 houle, 97.03 pocchiola, 96.05 fukuda"
+, annote =      "Reverse search is a general exhaustive search technique
 which came out of the new convex hull algorithm by the authors.
 This technique can be applied to many enumeration problems in computer
 science, operations research and geometry.
@@ -12853,266 +12853,266 @@ @article{af-rse-96
 }
 
 @article{ag-bkgfh-93
-, author =	"D. Avis and V. P. Grishukhin"
-, title =	"A Bound on the $k$-gonality of Facets of the Hypermetric Cone and Related Complexity Problems"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	5
-, month =	mar
-, year =	1993
-, pages =	"241--254"
-, update =	"93.09 held+milone+mitchell"
+, author =      "D. Avis and V. P. Grishukhin"
+, title =       "A Bound on the $k$-gonality of Facets of the Hypermetric Cone and Related Complexity Problems"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      5
+, month =       mar
+, year =        1993
+, pages =       "241--254"
+, update =      "93.09 held+milone+mitchell"
 }
 
 @article{agt-vbtes-86
-, author =	"D. Avis and T. Gum and G. Toussaint"
-, title =	"Visibility between two edges of a simple polygon"
-, journal =	"Visual Comput."
-, volume =	2
-, number =	6
-, month =	dec
-, year =	1986
-, pages =	"342--357"
-, keywords =	"weak edge visibility, polygons, convex hull, hidden line problems, Jordan sorting, geometric complexity"
+, author =      "D. Avis and T. Gum and G. Toussaint"
+, title =       "Visibility between two edges of a simple polygon"
+, journal =     "Visual Comput."
+, volume =      2
+, number =      6
+, month =       dec
+, year =        1986
+, pages =       "342--357"
+, keywords =    "weak edge visibility, polygons, convex hull, hidden line problems, Jordan sorting, geometric complexity"
 }
 
 @article{ah-rsig-82
-, author =	"D. Avis and J. Horton"
-, title =	"Remarks on the sphere of influence graphs"
-, journal =	"Ann. New York Acad. Sci."
-, volume =	440
-, year =	1982
-, pages =	"323--327"
-, keywords =	"proximity, geometric graphs"
-, update =	"95.05 korneenko"
+, author =      "D. Avis and J. Horton"
+, title =       "Remarks on the sphere of influence graphs"
+, journal =     "Ann. New York Acad. Sci."
+, volume =      440
+, year =        1982
+, pages =       "323--327"
+, keywords =    "proximity, geometric graphs"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{ah-cahti-91
-, author =	"D. Avis and M. E. Houle"
-, title =	"Computational aspects of {Helly}'s theorem and its relatives"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"11--14"
-, precedes =	"ah-cahti-95"
-, cites =	"dgk-htir-63, h-umkkm-23, h-tess-91, k-cscb-53, r-mkkde-21, v-etrec-39, ZZZ"
-, update =	"98.07 bibrelex, 96.09 devillers"
+, author =      "D. Avis and M. E. Houle"
+, title =       "Computational aspects of {Helly}'s theorem and its relatives"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "11--14"
+, precedes =    "ah-cahti-95"
+, cites =       "dgk-htir-63, h-umkkm-23, h-tess-91, k-cscb-53, r-mkkde-21, v-etrec-39, ZZZ"
+, update =      "98.07 bibrelex, 96.09 devillers"
 }
 
 @article{ah-cahti-95
-, author =	"D. Avis and M. E. Houle"
-, title =	"Computational aspects of {Helly}'s theorem and its relatives"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"357--367"
-, keywords =	"computational geometry, convexity, intersection, separation"
-, succeeds =	"ah-cahti-91"
-, update =	"96.09 devillers"
+, author =      "D. Avis and M. E. Houle"
+, title =       "Computational aspects of {Helly}'s theorem and its relatives"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "357--367"
+, keywords =    "computational geometry, convexity, intersection, separation"
+, succeeds =    "ah-cahti-91"
+, update =      "96.09 devillers"
 }
 
 @article{ai-lram-90
-, author =	"D. Avis and H. Imai"
-, title =	"Locating a robot with angle measurements"
-, journal =	"J. Symbolic Comput."
-, volume =	10
-, number =	"3--4"
-, year =	1990
-, pages =	"311--326"
-, update =	"95.05 korneenko"
+, author =      "D. Avis and H. Imai"
+, title =       "Locating a robot with angle measurements"
+, journal =     "J. Symbolic Comput."
+, volume =      10
+, number =      "3--4"
+, year =        1990
+, pages =       "311--326"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{ak-grtmd-96
-, author =	"D. Avis and C. M. Kong"
-, title =	"Generating rooted triangulations with minimum degree four"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"56--61"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "D. Avis and C. M. Kong"
+, title =       "Generating rooted triangulations with minimum degree four"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "56--61"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @incollection{ar-cmscp-88
-, author =	"D. Avis and D. Rappaport"
-, title =	"Computing monotone simple circuits in the plane"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"13--23"
+, author =      "D. Avis and D. Rappaport"
+, title =       "Computing monotone simple circuits in the plane"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "13--23"
 }
 
 @inproceedings{ar-clecs-85
-, author =	"D. Avis and D. Rappaport"
-, title =	"Computing the largest empty convex subset of a set of points"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"161--167"
-, keywords =	"planar point sets, convex subsets, discrete geometry"
-, precedes =	"deo-secp-88, deo-secp-90"
-, cites =	"ck-flcs-80, ea-lacvp-81, es-cpg-35, es-sepeg-60, e-peac-73, gp-gs-82, h-kfiep-78, h-snec7-83, m-rpdg-81, rt-slhla-83, s-pcg-77, ZZZ"
-, update =	"97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "D. Avis and D. Rappaport"
+, title =       "Computing the largest empty convex subset of a set of points"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "161--167"
+, keywords =    "planar point sets, convex subsets, discrete geometry"
+, precedes =    "deo-secp-88, deo-secp-90"
+, cites =       "ck-flcs-80, ea-lacvp-81, es-cpg-35, es-sepeg-60, e-peac-73, gp-gs-82, h-kfiep-78, h-snec7-83, m-rpdg-81, rt-slhla-83, s-pcg-77, ZZZ"
+, update =      "97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{arw-lbls-89
-, author =	"D. Avis and J.-M. Robert and R. Wenger"
-, title =	"Lower bounds for line stabbing"
-, journal =	"Inform. Process. Lett."
-, volume =	33
-, year =	1989
-, pages =	"59--62"
+, author =      "D. Avis and J.-M. Robert and R. Wenger"
+, title =       "Lower bounds for line stabbing"
+, journal =     "Inform. Process. Lett."
+, volume =      33
+, year =        1989
+, pages =       "59--62"
 }
 
 @article{at-eadps-81
-, author =	"D. Avis and G. T. Toussaint"
-, title =	"An efficient algorithm for decomposing a polygon into star-shaped polygons"
-, journal =	"Pattern Recogn."
-, volume =	13
-, year =	1981
-, pages =	"395--398"
-, keywords =	"decomposition, polygons, star-shaped, coloring"
-, annote =	"Uses Fisk's constructive proof of Chvatal's theorem:
-		 for every $n$-gon there is a decomposition into
-		 $\lfloor n/3 \rfloor$ star shaped pieces. Proceeds by
-		 colouring a triangulation with three colours."
+, author =      "D. Avis and G. T. Toussaint"
+, title =       "An efficient algorithm for decomposing a polygon into star-shaped polygons"
+, journal =     "Pattern Recogn."
+, volume =      13
+, year =        1981
+, pages =       "395--398"
+, keywords =    "decomposition, polygons, star-shaped, coloring"
+, annote =      "Uses Fisk's constructive proof of Chvatal's theorem:
+                 for every $n$-gon there is a decomposition into
+                 $\lfloor n/3 \rfloor$ star shaped pieces. Proceeds by
+                 colouring a triangulation with three colours."
 }
 
 @article{at-oadvp-81
-, author =	"D. Avis and G. T. Toussaint"
-, title =	"An optimal algorithm for determining the visibility of a polygon from an edge"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-30"
-, number =	12
-, year =	1981
-, pages =	"910--1014"
-, keywords =	"combinatorial geometry, design of algorithms, construction, incrementation, geometric transformations, worst-case analysis, Voronoi diagrams, two-dimensional, three-dimensional, weighted"
-, update =	"98.07 bibrelex"
+, author =      "D. Avis and G. T. Toussaint"
+, title =       "An optimal algorithm for determining the visibility of a polygon from an edge"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-30"
+, number =      12
+, year =        1981
+, pages =       "910--1014"
+, keywords =    "combinatorial geometry, design of algorithms, construction, incrementation, geometric transformations, worst-case analysis, Voronoi diagrams, two-dimensional, three-dimensional, weighted"
+, update =      "98.07 bibrelex"
 }
 
 @article{atb-mdcp-82
-, author =	"D. Avis and G. T. Toussaint and B. K. Bhattacharya"
-, title =	"On the multimodality of distances in convex polygons"
-, journal =	"Comput. Math. Appl."
-, volume =	8
-, year =	1982
-, pages =	"153--156"
-, keywords =	"discrete geometry, diameter, planar point sets"
+, author =      "D. Avis and G. T. Toussaint and B. K. Bhattacharya"
+, title =       "On the multimodality of distances in convex polygons"
+, journal =     "Comput. Math. Appl."
+, volume =      8
+, year =        1982
+, pages =       "153--156"
+, keywords =    "discrete geometry, diameter, planar point sets"
 }
 
 @inproceedings{aw-alts-87
-, author =	"D. Avis and R. Wenger"
-, title =	"Algorithms for line transversals in space"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"300--307"
-, precedes =	"aw-plts-88"
-, cites =	"a-dp-86, ad-ahdsp-87, b-mag-69, dgk-htir-63, es-mnwsn-87, e-ftssg-85, emprww-sls-82, et-eaide-85, gp-htthd-86, hdk-cgp-64, klz-gpcs-85, k-tsct-80, ps-cgi-85, w-ublo-86, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "D. Avis and R. Wenger"
+, title =       "Algorithms for line transversals in space"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "300--307"
+, precedes =    "aw-plts-88"
+, cites =       "a-dp-86, ad-ahdsp-87, b-mag-69, dgk-htir-63, es-mnwsn-87, e-ftssg-85, emprww-sls-82, et-eaide-85, gp-htthd-86, hdk-cgp-64, klz-gpcs-85, k-tsct-80, ps-cgi-85, w-ublo-86, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{aw-plts-88
-, author =	"D. Avis and R. Wenger"
-, title =	"Polyhedral line transversals in space"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"257--265"
-, succeeds =	"aw-alts-87"
+, author =      "D. Avis and R. Wenger"
+, title =       "Polyhedral line transversals in space"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "257--265"
+, succeeds =    "aw-alts-87"
 }
 
 @article{aw-plts-89
-, author =	"D. Avis and R. Wenger"
-, title =	"Polyhedral line traversals in space"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, update =	"98.11 bibrelex"
+, author =      "D. Avis and R. Wenger"
+, title =       "Polyhedral line traversals in space"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, update =      "98.11 bibrelex"
 }
 
 @article{ah-g-66
-, author =	"S. Avital and H. Hanani"
-, title =	"Graphs"
-, journal =	"Gilyonot Lematematika"
-, volume =	3
-, year =	1966
-, pages =	"2--8"
-, note =	"In Hebrew"
-, update =	"98.03 bibrelex"
+, author =      "S. Avital and H. Hanani"
+, title =       "Graphs"
+, journal =     "Gilyonot Lematematika"
+, volume =      3
+, year =        1966
+, pages =       "2--8"
+, note =        "In Hebrew"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{a-peddf-89
-, author =	"Francis Avnaim"
-, title =	"Placement et d{\'e}placement de formes rigides ou articul{\'e}es"
-, type =	"Th{\`e}se de Doctorat en Sciences"
-, school =	"Uni\-ver\-sit{\'e} de Franche-Comt{\'e}"
-, address =	"Besan\c{c}on, France"
-, year =	1989
-, keywords =	"doctoral thesis"
-, update =	"99.07 devillers, 93.09 rote, 93.05 jones"
+, author =      "Francis Avnaim"
+, title =       "Placement et d{\'e}placement de formes rigides ou articul{\'e}es"
+, type =        "Th{\`e}se de Doctorat en Sciences"
+, school =      "Uni\-ver\-sit{\'e} de Franche-Comt{\'e}"
+, address =     "Besan\c{c}on, France"
+, year =        1989
+, keywords =    "doctoral thesis"
+, update =      "99.07 devillers, 93.09 rote, 93.05 jones"
 }
 
 @incollection{ab-pptr-88
-, author =	"Francis Avnaim and Jean-Daniel Boissonnat"
-, title =	"Polygon placement under translation and rotation"
-, booktitle =	"Proc. 5th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	294
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"322--333"
-, update =	"99.07 devillers"
+, author =      "Francis Avnaim and Jean-Daniel Boissonnat"
+, title =       "Polygon placement under translation and rotation"
+, booktitle =   "Proc. 5th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      294
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "322--333"
+, update =      "99.07 devillers"
 }
 
 @article{ab-pptr-89
-, author =	"Francis Avnaim and Jean-Daniel Boissonnat"
-, title =	"Polygon placement under translation and rotation"
-, journal =	"RAIRO Inform. Theor."
-, volume =	23
-, year =	1989
-, pages =	"5--28"
-, update =	"99.07 devillers, 98.07 bibrelex, 95.05 korneenko, 95.01 devillers"
+, author =      "Francis Avnaim and Jean-Daniel Boissonnat"
+, title =       "Polygon placement under translation and rotation"
+, journal =     "RAIRO Inform. Theor."
+, volume =      23
+, year =        1989
+, pages =       "5--28"
+, update =      "99.07 devillers, 98.07 bibrelex, 95.05 korneenko, 95.01 devillers"
 }
 
 @inproceedings{ab-pempc-89
-, author =	"Francis Avnaim and Jean-Daniel Boissonnat"
-, title =	"Practical exact motion planning of a class of robots with three degrees of freedom"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	19
-, update =	"99.07 devillers"
+, author =      "Francis Avnaim and Jean-Daniel Boissonnat"
+, title =       "Practical exact motion planning of a class of robots with three degrees of freedom"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       19
+, update =      "99.07 devillers"
 }
 
 @inproceedings{ab-scsp-87
-, author =	"Francis Avnaim and Jean-Daniel Boissonnat"
-, title =	"Simultaneous containment of several polygons"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"242--250"
-, cites =	"b-srpcs-86, bfm-ipc-84, c-pcp-83, f-fapct-85, grs-kfcg-83, gs-ccrs-86, hm-ftprs-85, hmmn-sssic-84, ks-eapcf-85, oww-fabmo-85, ps-cgi-85, ss-pmp3c-82, ww-tsoab-86, y-cmsd-84, ZZZ"
-, update =	"99.07 devillers, 98.03 bibrelex"
+, author =      "Francis Avnaim and Jean-Daniel Boissonnat"
+, title =       "Simultaneous containment of several polygons"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "242--250"
+, cites =       "b-srpcs-86, bfm-ipc-84, c-pcp-83, f-fapct-85, grs-kfcg-83, gs-ccrs-86, hm-ftprs-85, hmmn-sssic-84, ks-eapcf-85, oww-fabmo-85, ps-cgi-85, ss-pmp3c-82, ww-tsoab-86, y-cmsd-84, ZZZ"
+, update =      "99.07 devillers, 98.03 bibrelex"
 }
 
 @techreport{ab-pcp1s-87
-, author =	"Francis Avnaim and Jean-Daniel Boissonnat"
-, title =	"The polygon containment problem: 1. Simultaneous containment under translation"
-, type =	"Technical {Report}"
-, number =	689
-, institution =	"INRIA Sophia-Antipolis"
-, month =	jun
-, year =	1987
-, update =	"99.07 devillers, 97.11 bibrelex"
+, author =      "Francis Avnaim and Jean-Daniel Boissonnat"
+, title =       "The polygon containment problem: 1. Simultaneous containment under translation"
+, type =        "Technical {Report}"
+, number =      689
+, institution = "INRIA Sophia-Antipolis"
+, month =       jun
+, year =        1987
+, update =      "99.07 devillers, 97.11 bibrelex"
 }
 
 @techreport{abdpy-esdus-94
-, author =	"Francis Avnaim and Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata and Mariette Yvinec"
-, title =	"Evaluating signs of determinants using single-precision arithmetic"
-, type =	"Research {Report}"
-, number =	2306
-, institution =	"INRIA"
-, address =	"BP93, 06902 Sophia-Antipolis, France"
-, year =	1994
-, precedes =	"abdpy-esdus-97"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
-, abstract =	"We propose a method to evaluate signs of $2\times 2$ and
+, author =      "Francis Avnaim and Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata and Mariette Yvinec"
+, title =       "Evaluating signs of determinants using single-precision arithmetic"
+, type =        "Research {Report}"
+, number =      2306
+, institution = "INRIA"
+, address =     "BP93, 06902 Sophia-Antipolis, France"
+, year =        1994
+, precedes =    "abdpy-esdus-97"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, abstract =    "We propose a method to evaluate signs of $2\times 2$ and
 $3\times 3$ determinants with $b$-bit integer entries using only $b$ and
 $(b+1)$-bit arithmetic respectively. This algorithm has numerous
 applications in geometric computation and provides a general and practical
@@ -13122,231 +13122,231 @@ @techreport{abdpy-esdus-94
 }
 
 @article{abdpy-esdus-97
-, author =	"Francis Avnaim and Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata and Mariette Yvinec"
-, title =	"Evaluating signs of determinants using single-precision arithmetic"
-, journal =	"Algorithmica"
-, volume =	17
-, number =	2
-, year =	1997
-, pages =	"111--132"
-, url =	"https://hal.inria.fr/inria-00090613"
-, succeeds =	"abdpy-esdus-94, abdpy-enmcs-95"
-, cites =	"bjmm-lsicg-93, c-sede-92, fm-nsala-91, f-nsa2d-92, f-smpst-89, fv-eeacg-93, gss-egbra-89, gy-frcg-86, hhk-rsops-89, kln-edtur-91, m-dpggt-89, m-vigau-88a, ps-cgi-85, si-gafpa-88, v-cca-79"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 98.07 tamassia, 97.11 bibrelex, 97.03 devillers"
-, abstract =	"We propose a method to evaluate signs of  $2\times 2$ and $3\times 3$ determinants with $b$-bit integer entries using only $b$ and $(b+1)$-bit arithmetic respectively. This algorithm has numerous applications in geometric computation and provides a general and practical approach to robustness.  The algorithm has been implemented and compared with other exact computation methods."
+, author =      "Francis Avnaim and Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata and Mariette Yvinec"
+, title =       "Evaluating signs of determinants using single-precision arithmetic"
+, journal =     "Algorithmica"
+, volume =      17
+, number =      2
+, year =        1997
+, pages =       "111--132"
+, url = "https://inria.hal.science/inria-00090613"
+, succeeds =    "abdpy-esdus-94, abdpy-enmcs-95"
+, cites =       "bjmm-lsicg-93, c-sede-92, fm-nsala-91, f-nsa2d-92, f-smpst-89, fv-eeacg-93, gss-egbra-89, gy-frcg-86, hhk-rsops-89, kln-edtur-91, m-dpggt-89, m-vigau-88a, ps-cgi-85, si-gafpa-88, v-cca-79"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 98.07 tamassia, 97.11 bibrelex, 97.03 devillers"
+, abstract =    "We propose a method to evaluate signs of  $2\times 2$ and $3\times 3$ determinants with $b$-bit integer entries using only $b$ and $(b+1)$-bit arithmetic respectively. This algorithm has numerous applications in geometric computation and provides a general and practical approach to robustness.  The algorithm has been implemented and compared with other exact computation methods."
 }
 
 @inproceedings{abdpy-enmcs-95
-, author =	"Francis Avnaim and Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata and Mariette Yvinec"
-, title =	"Evaluation of a new method to compute signs of determinants"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C16--C17"
-, url =	"https://hal.inria.fr/inria-00090613"
-, precedes =	"abdpy-esdus-97"
-, cites =	"ZZZ"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.03 bibrelex, 97.03 devillers, 96.01 devillers, 95.05 devillers"
+, author =      "Francis Avnaim and Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata and Mariette Yvinec"
+, title =       "Evaluation of a new method to compute signs of determinants"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C16--C17"
+, url = "https://inria.hal.science/inria-00090613"
+, precedes =    "abdpy-esdus-97"
+, cites =       "ZZZ"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.03 bibrelex, 97.03 devillers, 96.01 devillers, 95.05 devillers"
 }
 
 @inproceedings{abf-pempa-88
-, author =	"Francis Avnaim and Jean-Daniel Boissonnat and Bernard Faverjon"
-, title =	"A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Robot. Autom."
-, year =	1988
-, pages =	"1656--1661"
-, update =	"99.07 devillers"
+, author =      "Francis Avnaim and Jean-Daniel Boissonnat and Bernard Faverjon"
+, title =       "A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Robot. Autom."
+, year =        1988
+, pages =       "1656--1661"
+, update =      "99.07 devillers"
 }
 
 @incollection{abf-pempa-89
-, author =	"Francis Avnaim and Jean-Daniel Boissonnat and Bernard Faverjon"
-, title =	"A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	391
-, year =	1989
-, pages =	"67--86"
-, keywords =	"motion planning"
-, update =	"99.07 devillers, 95.05 korneenko"
+, author =      "Francis Avnaim and Jean-Daniel Boissonnat and Bernard Faverjon"
+, title =       "A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      391
+, year =        1989
+, pages =       "67--86"
+, keywords =    "motion planning"
+, update =      "99.07 devillers, 95.05 korneenko"
 }
 
 @incollection{ak-srtat-89
-, author =	"J. Avro and D. Kirk"
-, title =	"A survey of ray tracing acceleration techniques"
-, editor =	"A. Glassner"
-, booktitle =	"An Introduction to Ray Tracing"
-, publisher =	"Academic Press"
-, address =	"San Diego, CA"
-, year =	1989
-, pages =	"201--262"
-, isbn =	"0-12-286160-4"
-, update =	"98.11 bibrelex, 98.03 bibrelex+mitchell"
+, author =      "J. Avro and D. Kirk"
+, title =       "A survey of ray tracing acceleration techniques"
+, editor =      "A. Glassner"
+, booktitle =   "An Introduction to Ray Tracing"
+, publisher =   "Academic Press"
+, address =     "San Diego, CA"
+, year =        1989
+, pages =       "201--262"
+, isbn =        "0-12-286160-4"
+, update =      "98.11 bibrelex, 98.03 bibrelex+mitchell"
 }
 
 @article{a-cns-85
-, author =	"B. Awerbuch"
-, title =	"Complexity of network synchronization"
-, journal =	"J. ACM"
-, volume =	"??"
-, year =	1985
-, pages =	"804--823"
-, update =	"97.11 bibrelex"
+, author =      "B. Awerbuch"
+, title =       "Complexity of network synchronization"
+, journal =     "J. ACM"
+, volume =      "??"
+, year =        1985
+, pages =       "804--823"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{aabv-iagmw-94
-, author =	"B. Awerbuch and Y. Azar and A. Blum and S. Vempala"
-, title =	"Improved approximation guarantees for minimum-weight $k$-trees and prize-collecting salesmen"
-, number =	"CMU-CS-94-173"
-, institution =	"Dept. Computer Science, Carnegie-Mellon University"
-, address =	"Pittsburgh, PA, 15213"
-, month =	aug
-, year =	1994
-, update =	"95.01 mitchell"
+, author =      "B. Awerbuch and Y. Azar and A. Blum and S. Vempala"
+, title =       "Improved approximation guarantees for minimum-weight $k$-trees and prize-collecting salesmen"
+, number =      "CMU-CS-94-173"
+, institution = "Dept. Computer Science, Carnegie-Mellon University"
+, address =     "Pittsburgh, PA, 15213"
+, month =       aug
+, year =        1994
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{aabv-iagmw-95
-, author =	"B. Awerbuch and Y. Azar and A. Blum and S. Vempala"
-, title =	"Improved approximation guarantees for minimum-weight $k$-trees and prize-collecting salesmen"
-, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC 95"
-, year =	1995
-, pages =	"277--283"
-, succeeds =	"aabv-iagmw-94"
-, update =	"99.07 smid, 98.07 mitchell, 98.03 bibrelex"
+, author =      "B. Awerbuch and Y. Azar and A. Blum and S. Vempala"
+, title =       "Improved approximation guarantees for minimum-weight $k$-trees and prize-collecting salesmen"
+, booktitle =   "Proc. 27th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC 95"
+, year =        1995
+, pages =       "277--283"
+, succeeds =    "aabv-iagmw-94"
+, update =      "99.07 smid, 98.07 mitchell, 98.03 bibrelex"
 }
 
 @article{aabv-nagmw-98
-, author =	"B. Awerbuch and Y. Azar and A. Blum and S. Vempala"
-, title =	"New approximation guarantees for minimum-weight $k$-trees and prize-collecting salesmen"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1998
-, pages =	"254--262"
-, update =	"99.07 smid"
+, author =      "B. Awerbuch and Y. Azar and A. Blum and S. Vempala"
+, title =       "New approximation guarantees for minimum-weight $k$-trees and prize-collecting salesmen"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1998
+, pages =       "254--262"
+, update =      "99.07 smid"
 }
 
 @article{abcp-nltcs-98
-, author =	"B. Awerbuch and B. Berger and L. Cowen and D. Peleg"
-, title =	"Near-linear time construction of sparse neighborhood covers"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1998
-, pages =	"263--277"
-, update =	"99.07 smid"
+, author =      "B. Awerbuch and B. Berger and L. Cowen and D. Peleg"
+, title =       "Near-linear time construction of sparse neighborhood covers"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1998
+, pages =       "263--277"
+, update =      "99.07 smid"
 }
 
 @inproceedings{ap-sp-90
-, author =	"B. Awerbuch and D. Peleg"
-, title =	"Sparse partitions"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"503--513"
-, update =	"97.11 bibrelex"
+, author =      "B. Awerbuch and D. Peleg"
+, title =       "Sparse partitions"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "503--513"
+, update =      "97.11 bibrelex"
 }
 
 @book{a-avmrs-91
-, author =	"N. Ayache"
-, title =	"Artificial Vision for Mobile Robots: Stereo Vision and Multisensory Perception"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "N. Ayache"
+, title =       "Artificial Vision for Mobile Robots: Stereo Vision and Multisensory Perception"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @incollection{abcglms-stai3-90
-, author =	"N. Ayache and J. D. Boissonnat and L. Cohen and B. Geiger and J. Levy-Vehel and O. Monga and P. Sander"
-, title =	"Steps toward the automatic interpretation of 3{D} images"
-, editor =	"K. H. H{\"o}hne and H. Fuchs and S. M. Pizer"
-, booktitle =	"3D Imaging in Medicine"
-, series =	"NATO ASI"
-, volume =	"F60"
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"107--120"
-, update =	"93.09 devillers+rote"
+, author =      "N. Ayache and J. D. Boissonnat and L. Cohen and B. Geiger and J. Levy-Vehel and O. Monga and P. Sander"
+, title =       "Steps toward the automatic interpretation of 3{D} images"
+, editor =      "K. H. H{\"o}hne and H. Fuchs and S. M. Pizer"
+, booktitle =   "3D Imaging in Medicine"
+, series =      "NATO ASI"
+, volume =      "F60"
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "107--120"
+, update =      "93.09 devillers+rote"
 }
 
 @article{af-ersmg-87
-, author =	"N. Ayache and B. Faverjon"
-, title =	"Efficient registration of stereo by matching graph descriptors of edge segments"
-, journal =	"Internat. J. Comput Vision"
-, volume =	"??"
-, year =	1987
-, pages =	"107--131"
-, update =	"97.11 bibrelex"
+, author =      "N. Ayache and B. Faverjon"
+, title =       "Efficient registration of stereo by matching graph descriptors of edge segments"
+, journal =     "Internat. J. Comput Vision"
+, volume =      "??"
+, year =        1987
+, pages =       "107--131"
+, update =      "97.11 bibrelex"
 }
 
 @article{abjn-ormnd-85
-, author =	"D. Ayala and P. Brunet and R. Juan and I. Navazo"
-, title =	"Object representation by means of nominal division quadtrees"
-, journal =	"ACM Trans. Graph."
-, volume =	4
-, number =	1
-, year =	1985
-, pages =	"41--59"
+, author =      "D. Ayala and P. Brunet and R. Juan and I. Navazo"
+, title =       "Object representation by means of nominal division quadtrees"
+, journal =     "ACM Trans. Graph."
+, volume =      4
+, number =      1
+, year =        1985
+, pages =       "41--59"
 }
 
 @inproceedings{adfqr-ndstd-94
-, author =	"R. Ayala and E. Dom{\'\i}nguez and A. R. Franc{\'e}s and A. Quintero and J. Rubio"
-, title =	"{$N$}-Dimensional Separation Theorems in Digital Topology"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"29--32"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "R. Ayala and E. Dom{\'\i}nguez and A. R. Franc{\'e}s and A. Quintero and J. Rubio"
+, title =       "{$N$}-Dimensional Separation Theorems in Digital Topology"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "29--32"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{ai-patgt-97
-, author =	"Cavit Aydin and Doug Ierardi"
-, title =	"Partitioning Algorithms for Transportation Graphs and their Applications to Routing"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"245--250"
-, update =	"97.11 jones"
+, author =      "Cavit Aydin and Doug Ierardi"
+, title =       "Partitioning Algorithms for Transportation Graphs and their Applications to Routing"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "245--250"
+, update =      "97.11 jones"
 }
 
 @article{a-lbimt-94
-, author =	"Yossi Azar"
-, title =	"Lower Bounds for Insertion Methods for {TSP}"
-, journal =	"Combinatorics, Probability and Computing"
-, volume =	3
-, year =	1994
-, pages =	"285--292"
-, update =	"98.03 mitchell"
-, annote =	"See also \cite{bkp-naimy-94}; Bafna et al independently
+, author =      "Yossi Azar"
+, title =       "Lower Bounds for Insertion Methods for {TSP}"
+, journal =     "Combinatorics, Probability and Computing"
+, volume =      3
+, year =        1994
+, pages =       "285--292"
+, update =      "98.03 mitchell"
+, annote =      "See also \cite{bkp-naimy-94}; Bafna et al independently
                   discovered the same result."
 }
 
 @article{ae-tdp-97
-, author =	"Yossi Azar and Leah Epstein"
-, title =	"On Two Dimensional Packing"
-, journal =	"J. Algorithms"
-, volume =	25
-, number =	2
-, month =	nov
-, year =	1997
-, pages =	"290--310"
-, keywords =	"bin packing, rectangles, boxes, approximation algorithm"
-, update =	"98.03 mitchell"
+, author =      "Yossi Azar and Leah Epstein"
+, title =       "On Two Dimensional Packing"
+, journal =     "J. Algorithms"
+, volume =      25
+, number =      2
+, month =       nov
+, year =        1997
+, pages =       "290--310"
+, keywords =    "bin packing, rectangles, boxes, approximation algorithm"
+, update =      "98.03 mitchell"
 }
 
 @article{amm-cgcap-93
-, author =	"A. S. Azarenok and V. N. Martynchik and N. N. Metel'skii"
-, title =	"Computation of generalized convex approximations of planar geometric objects"
-, journal =	"Comp. Maths Math. Phys. (English translation of Zhurnal Vychislitelnoi Matematiki i Matematicheskoi Fiziki)"
-, volume =	33
-, number =	12
-, year =	1993
-, pages =	"1641--1651"
-, keywords =	"shape approximation, generalized convexity, visibility, isothetic domain, $S-$convex hull, $S-$convex approximation"
-, update =	"98.07 bibrelex, 95.01 korneenko"
-, annote =	"The author's notion of $S-$convex hull for an isothetic
+, author =      "A. S. Azarenok and V. N. Martynchik and N. N. Metel'skii"
+, title =       "Computation of generalized convex approximations of planar geometric objects"
+, journal =     "Comp. Maths Math. Phys. (English translation of Zhurnal Vychislitelnoi Matematiki i Matematicheskoi Fiziki)"
+, volume =      33
+, number =      12
+, year =        1993
+, pages =       "1641--1651"
+, keywords =    "shape approximation, generalized convexity, visibility, isothetic domain, $S-$convex hull, $S-$convex approximation"
+, update =      "98.07 bibrelex, 95.01 korneenko"
+, annote =      "The author's notion of $S-$convex hull for an isothetic
    domain is in other words the minimal externally isothetically visible
    hull. An $O(rn^3)$ time $O(rn^2)$ space algorithm for $r-$vertex
    $S-$convex approximation of miminal area of an $n-$vertex isothetic
    domain is given."
-, abstract =	"Using generalizations of the concept of convexity,
+, abstract =    "Using generalizations of the concept of convexity,
      a technique is described for approximating polygonal domains by
      simplifying their geometric shape. An algorithm of polynomial
      complexity is obtained for computing a generalized-convex
@@ -13358,831 +13358,831 @@ @article{amm-cgcap-93
 }
 
 @inproceedings{bw-acmrs-92
-, author =	"J. H. B{\/o}hn and M. J. Wozny"
-, title =	"Automatic {CAD}-model repair: {Shell}-closure"
-, booktitle =	"Proc. Sympos. on Solid Freeform Fabrication"
-, site =	"Austin, TX"
-, organization =	"Dept. Mech. Eng., Univ. Texas Austin"
-, year =	1992
-, pages =	"86--94"
-, update =	"98.07 bibrelex"
+, author =      "J. H. B{\/o}hn and M. J. Wozny"
+, title =       "Automatic {CAD}-model repair: {Shell}-closure"
+, booktitle =   "Proc. Sympos. on Solid Freeform Fabrication"
+, site =        "Austin, TX"
+, organization =        "Dept. Mech. Eng., Univ. Texas Austin"
+, year =        1992
+, pages =       "86--94"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bf-lamcp-88
-, author =	"L. Babai and P. Frankl"
-, title =	"Linear Algebra Methods in Combinatorics, Part {I}"
-, type =	"Technical {Report}"
-, institution =	"Univ. Chicago"
-, address =	"Chicago, IL"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "L. Babai and P. Frankl"
+, title =       "Linear Algebra Methods in Combinatorics, Part {I}"
+, type =        "Technical {Report}"
+, institution = "Univ. Chicago"
+, address =     "Chicago, IL"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @article{bjmadh-lcff-88
-, author =	"L. Babai and B. Just and F. {Meyer auf der Heide}"
-, title =	"On the limits of computations with the floor function"
-, journal =	"Inform. Comput."
-, volume =	78
-, number =	2
-, year =	1988
-, pages =	"99--108"
-, keywords =	"lower bounds, computational complexity"
-, update =	"95.05 korneenko"
+, author =      "L. Babai and B. Just and F. {Meyer auf der Heide}"
+, title =       "On the limits of computations with the floor function"
+, journal =     "Inform. Comput."
+, volume =      78
+, number =      2
+, year =        1988
+, pages =       "99--108"
+, keywords =    "lower bounds, computational complexity"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bsw-cplhp-97
-, author =	"Mark Babikov and Diane Souvaine and Rephael Wenger"
-, title =	"Constructing Piecewise Linear Homeomorphisms of Polygons with Holes"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"6--10"
-, update =	"97.11 jones"
+, author =      "Mark Babikov and Diane Souvaine and Rephael Wenger"
+, title =       "Constructing Piecewise Linear Homeomorphisms of Polygons with Holes"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "6--10"
+, update =      "97.11 jones"
 }
 
 @article{ba-acfem-76
-, author =	"I. Babuska and A. K. Aziz"
-, title =	"On the angle condition in the finite element method"
-, journal =	"SIAM J. Numer. Anal."
-, volume =	13
-, year =	1976
-, pages =	"214--227"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "I. Babuska and A. K. Aziz"
+, title =       "On the angle condition in the finite element method"
+, journal =     "SIAM J. Numer. Anal."
+, volume =      13
+, year =        1976
+, pages =       "214--227"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @article{bb-3drcg-78
-, author =	"N. Badler and R. Bajcsy"
-, title =	"$3$-d representation for computer graphics and computer vision"
-, journal =	"Comput. Graph. Image Process."
-, volume =	12
-, year =	1978
-, pages =	"153--160"
+, author =      "N. Badler and R. Bajcsy"
+, title =       "$3$-d representation for computer graphics and computer vision"
+, journal =     "Comput. Graph. Image Process."
+, volume =      12
+, year =        1978
+, pages =       "153--160"
 }
 
 @article{bsc-ctsv-99
-, author =	"N. Baek and S.-Y. Shin and K.-Y. Chwa"
-, title =	"On Computing Translational Swept Volumes"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, number =	3
-, month =	jun
-, year =	1999
-, pages =	"293--317"
-, update =	"99.07 held"
+, author =      "N. Baek and S.-Y. Shin and K.-Y. Chwa"
+, title =       "On Computing Translational Swept Volumes"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, number =      3
+, month =       jun
+, year =        1999
+, pages =       "293--317"
+, update =      "99.07 held"
 }
 
 @article{bsc-tdtsc-00
-, author =	"N. Baek and S.-Y. Shin and K.-Y. Chwa"
-, title =	"Three-dimensional topological sweep for computing rotational swept volumes of polyhedral objects"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, year =	2000
-, pages =	"131--156"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "N. Baek and S.-Y. Shin and K.-Y. Chwa"
+, title =       "Three-dimensional topological sweep for computing rotational swept volumes of polyhedral objects"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, year =        2000
+, pages =       "131--156"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @article{beh-gms-79
-, author =	"A. Baer and C. Eastman and M. Henrion"
-, title =	"Geometric Modeling: {A} Survey"
-, journal =	"CAD"
-, volume =	11
-, number =	5
-, month =	sep
-, year =	1979
-, pages =	"253--272"
-, update =	"97.11 bibrelex"
+, author =      "A. Baer and C. Eastman and M. Henrion"
+, title =       "Geometric Modeling: {A} Survey"
+, journal =     "CAD"
+, volume =      11
+, number =      5
+, month =       sep
+, year =        1979
+, pages =       "253--272"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{b-ssar-89
-, author =	"R. {Baeza-Yates}"
-, title =	"String searching algorthms revisited"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, year =	1989
-, pages =	"75--96"
-, keywords =	"searching, string matching"
-, update =	"95.05 korneenko"
+, author =      "R. {Baeza-Yates}"
+, title =       "String searching algorthms revisited"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, year =        1989
+, pages =       "75--96"
+, keywords =    "searching, string matching"
+, update =      "95.05 korneenko"
 }
 
 @article{bcr-sp-93
-, author =	"R. Baeza-Yates and J. Culberson and G. Rawlins"
-, title =	"Searching in the plane"
-, journal =	"Inform. Comput."
-, volume =	106
-, year =	1993
-, pages =	"234--252"
-, update =	"97.03 icking"
+, author =      "R. Baeza-Yates and J. Culberson and G. Rawlins"
+, title =       "Searching in the plane"
+, journal =     "Inform. Comput."
+, volume =      106
+, year =        1993
+, pages =       "234--252"
+, update =      "97.03 icking"
 }
 
 @incollection{br-fatdm-90
-, author =	"R. {Baeza-Yates} and M. Regnier"
-, title =	"Fast algorithms for two-dimensional and multiple pattern matching"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, year =	1990
-, pages =	"332--247"
-, keywords =	"searching, pattern matching"
-, update =	"95.05 korneenko"
+, author =      "R. {Baeza-Yates} and M. Regnier"
+, title =       "Fast algorithms for two-dimensional and multiple pattern matching"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, year =        1990
+, pages =       "332--247"
+, keywords =    "searching, pattern matching"
+, update =      "95.05 korneenko"
 }
 
 @article{bs-psp-95
-, author =	"R. {Baeza-Yates} and R. Schott"
-, title =	"Parallel searching in the plane"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"143--154"
-, update =	"96.09 devillers"
+, author =      "R. {Baeza-Yates} and R. Schott"
+, title =       "Parallel searching in the plane"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "143--154"
+, update =      "96.09 devillers"
 }
 
 @article{bkp-naimy-94
-, author =	"Vineet Bafna and Bala Kalyanasundaram and Kirk Pruhs"
-, title =	"Not All Insertion Methods Yield Constant Approximate Tours in the {Euclidean} Plane"
-, journal =	"Theoret. Comput. Sci."
-, volume =	125
-, year =	1994
-, pages =	"345--353"
-, update =	"98.03 mitchell"
-, annote =	"See also \cite{a-lbimt-94}; Azar independently
+, author =      "Vineet Bafna and Bala Kalyanasundaram and Kirk Pruhs"
+, title =       "Not All Insertion Methods Yield Constant Approximate Tours in the {Euclidean} Plane"
+, journal =     "Theoret. Comput. Sci."
+, volume =      125
+, year =        1994
+, pages =       "345--353"
+, update =      "98.03 mitchell"
+, annote =      "See also \cite{a-lbimt-94}; Azar independently
                   discovered the same result."
 }
 
 @article{b-bdce-86
-, author =	"V. Bagatelj"
-, title =	"On the balanced divide-and-conquer equation"
-, journal =	"Internat. J. Comput. Math."
-, volume =	19
-, number =	"3--4"
-, year =	1986
-, pages =	"259--266"
-, keywords =	"divide and conquer"
-, update =	"95.05 korneenko"
+, author =      "V. Bagatelj"
+, title =       "On the balanced divide-and-conquer equation"
+, journal =     "Internat. J. Comput. Math."
+, volume =      19
+, number =      "3--4"
+, year =        1986
+, pages =       "259--266"
+, keywords =    "divide and conquer"
+, update =      "95.05 korneenko"
 }
 
 @techreport{b-ip-??
-, author =	"F. Bagemihl"
-, title =	"On indecomposable polyhedra"
-, type =	"Report"
-, number =	"??"
-, institution =	"Univ. Rochester"
-, address =	"Rochester, NY"
-, year =	"??"
-, precedes =	"b-ip-48a"
-, update =	"98.11 bibrelex"
+, author =      "F. Bagemihl"
+, title =       "On indecomposable polyhedra"
+, type =        "Report"
+, number =      "??"
+, institution = "Univ. Rochester"
+, address =     "Rochester, NY"
+, year =        "??"
+, precedes =    "b-ip-48a"
+, update =      "98.11 bibrelex"
 }
 
 @article{b-ip-48a
-, author =	"F. Bagemihl"
-, title =	"On indecomposable polyhedra"
-, journal =	"Amer. Math. Monthly"
-, volume =	"??"
-, month =	sep
-, year =	1948
-, pages =	"411--413"
-, succeeds =	"b-ip-??"
-, update =	"98.11 bibrelex"
+, author =      "F. Bagemihl"
+, title =       "On indecomposable polyhedra"
+, journal =     "Amer. Math. Monthly"
+, volume =      "??"
+, month =       sep
+, year =        1948
+, pages =       "411--413"
+, succeeds =    "b-ip-??"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{bdegm-cvgls-97
-, author =	"J. Bagga and S. Dey and J. Emert and L. Gewali and J. McGrew"
-, title =	"Contracted Visibility Graphs of Line Segments"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"82--86"
-, update =	"97.11 jones"
+, author =      "J. Bagga and S. Dey and J. Emert and L. Gewali and J. McGrew"
+, title =       "Contracted Visibility Graphs of Line Segments"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "82--86"
+, update =      "97.11 jones"
 }
 
 @inproceedings{bgg-cipaf-96
-, author =	"J. Bagga and L. Gewali and D. Glasser"
-, title =	"The complexity of illuminating polygons by {$\alpha$}-flood-lights"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"337--342"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "J. Bagga and L. Gewali and D. Glasser"
+, title =       "The complexity of illuminating polygons by {$\alpha$}-flood-lights"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "337--342"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{bgn-vemeu-97
-, author =	"Jay Bagga and Laxmi Gewali and Simeon Ntafos"
-, title =	"Visibility Edges, Mixed Edges, and Unique Triangulation"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	11
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Jay Bagga and Laxmi Gewali and Simeon Ntafos"
+, title =       "Visibility Edges, Mixed Edges, and Unique Triangulation"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       11
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{b-phpmp-93
-, author =	"D. H. Bailey"
-, title =	"A Portable High Performance Multiprecision Package"
-, number =	"RNR-90-022"
-, institution =	"NASA Ames Res. Center"
-, month =	may
-, year =	1993
-, update =	"97.11 bibrelex"
+, author =      "D. H. Bailey"
+, title =       "A Portable High Performance Multiprecision Package"
+, number =      "RNR-90-022"
+, institution = "NASA Ames Res. Center"
+, month =       may
+, year =        1993
+, update =      "97.11 bibrelex"
 }
 
 @article{bc-chit-87
-, author =	"T. Bailey and J. Cowles"
-, title =	"A convex hull inclusion test"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	9
-, number =	2
-, year =	1987
-, pages =	"312--316"
-, keywords =	"convex hull, point location"
-, update =	"95.05 korneenko"
+, author =      "T. Bailey and J. Cowles"
+, title =       "A convex hull inclusion test"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      9
+, number =      2
+, year =        1987
+, pages =       "312--316"
+, keywords =    "convex hull, point location"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bbdmrs-mqr-90
-, author =	"J. Baillieul and R. Brockett and B. Donald and R. Murray and M. Raghavan and S. Sastry"
-, title =	"Mathematical questions in robotics"
-, type =	"Technical {Report}"
-, number =	"TR~90-1097"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	feb
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "J. Baillieul and R. Brockett and B. Donald and R. Murray and M. Raghavan and S. Sastry"
+, title =       "Mathematical questions in robotics"
+, type =        "Technical {Report}"
+, number =      "TR~90-1097"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       feb
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{b-bsdi-92
-, author =	"H. S. Baird"
-, title =	"Background structure in document images"
-, booktitle =	"Proc. of the IAPR 1992 Workshop on Syntactic and Structural Pattern Recognition"
-, year =	1992
-, pages =	"??"
-, keywords =	"maximal empty rectangles, OCR, optical character recognition"
-, update =	"95.01 mitchell"
+, author =      "H. S. Baird"
+, title =       "Background structure in document images"
+, booktitle =   "Proc. of the IAPR 1992 Workshop on Syntactic and Structural Pattern Recognition"
+, year =        1992
+, pages =       "??"
+, keywords =    "maximal empty rectangles, OCR, optical character recognition"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{b-falaa-77
-, author =	"H. S. Baird"
-, title =	"Fast algorithms for {LSI} artwork analysis"
-, booktitle =	"Proc. Design Autom. Conf."
-, year =	1977
-, pages =	"303--311"
-, precedes =	"b-falaa-78"
-, update =	"95.05 korneenko"
+, author =      "H. S. Baird"
+, title =       "Fast algorithms for {LSI} artwork analysis"
+, booktitle =   "Proc. Design Autom. Conf."
+, year =        1977
+, pages =       "303--311"
+, precedes =    "b-falaa-78"
+, update =      "95.05 korneenko"
 }
 
 @article{b-falaa-78
-, author =	"H. S. Baird"
-, title =	"Fast algorithms for {LSI} artwork analysis"
-, journal =	"J. Design Autom. Fault-Tolerant Comput."
-, volume =	2
-, number =	2
-, year =	1978
-, pages =	"179--209"
-, keywords =	", VLSI design, polygons, Boolean operations, isothetic"
-, succeeds =	"b-falaa-77"
-, update =	"95.05 korneenko"
+, author =      "H. S. Baird"
+, title =       "Fast algorithms for {LSI} artwork analysis"
+, journal =     "J. Design Autom. Fault-Tolerant Comput."
+, volume =      2
+, number =      2
+, year =        1978
+, pages =       "179--209"
+, keywords =    ", VLSI design, polygons, Boolean operations, isothetic"
+, succeeds =    "b-falaa-77"
+, update =      "95.05 korneenko"
 }
 
 @book{b-mbimu-84
-, author =	"H. S. Baird"
-, title =	"Model-Based Image Matching Using Location"
-, series =	"Distinguished Dissertation Series"
-, publisher =	"MIT Press"
-, year =	1984
+, author =      "H. S. Baird"
+, title =       "Model-Based Image Matching Using Location"
+, series =      "Distinguished Dissertation Series"
+, publisher =   "MIT Press"
+, year =        1984
 }
 
 @inproceedings{bjf-issdc-90
-, author =	"H. S. Baird and S. E. Jones and S. J. Fortune"
-, title =	"Image segmentation by shape-directed covers"
-, booktitle =	"Proc. of the Tenth International Conference on Pattern Recognition"
-, publisher =	"IEEE Computer Society"
-, year =	1990
-, pages =	"820--825"
-, keywords =	"maximal empty rectangles, OCR, optical character recognition"
-, update =	"95.01 mitchell"
+, author =      "H. S. Baird and S. E. Jones and S. J. Fortune"
+, title =       "Image segmentation by shape-directed covers"
+, booktitle =   "Proc. of the Tenth International Conference on Pattern Recognition"
+, publisher =   "IEEE Computer Society"
+, year =        1990
+, pages =       "820--825"
+, keywords =    "maximal empty rectangles, OCR, optical character recognition"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{br-tdarp-94
-, author =	"B. Bajaj and A. Royappa"
-, title =	"Triangulation and display of arbitrary rational parametric surfaces"
-, editor =	"R. Bergeron and A. Kaufman"
-, booktitle =	"IEEE Visualiuation '94 Conference"
-, publisher =	"IEEE"
-, year =	1994
-, update =	"98.07 bibrelex"
+, author =      "B. Bajaj and A. Royappa"
+, title =       "Triangulation and display of arbitrary rational parametric surfaces"
+, editor =      "R. Bergeron and A. Kaufman"
+, booktitle =   "IEEE Visualiuation '94 Conference"
+, publisher =   "IEEE"
+, year =        1994
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{b-epses-86
-, author =	"C. Bajaj"
-, title =	"An efficient parallel solution for {Euclidean} shortest paths in three dimensions"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"San Francisco, CA"
-, year =	1986
-, pages =	"1897--1900"
-, keywords =	"motion planning, elementary geometry, parallel computation, geodesic distance, numerical analysis, CAD, robotics"
+, author =      "C. Bajaj"
+, title =       "An efficient parallel solution for {Euclidean} shortest paths in three dimensions"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "San Francisco, CA"
+, year =        1986
+, pages =       "1897--1900"
+, keywords =    "motion planning, elementary geometry, parallel computation, geodesic distance, numerical analysis, CAD, robotics"
 }
 
 @inproceedings{b-agtam-85
-, author =	"C. Bajaj"
-, title =	"Applying {Galois} Theoretic Algebraic Methods to Geometric Optimization problems"
-, booktitle =	"SIAM Conf. on Geometric Modeling and Robotics"
-, site =	"Albany, NY"
-, month =	jul
-, year =	1985
-, update =	"93.09 milone+mitchell"
+, author =      "C. Bajaj"
+, title =       "Applying {Galois} Theoretic Algebraic Methods to Geometric Optimization problems"
+, booktitle =   "SIAM Conf. on Geometric Modeling and Robotics"
+, site =        "Albany, NY"
+, month =       jul
+, year =        1985
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{b-cgiv-96
-, author =	"C. Bajaj"
-, title =	"Computational geometry for interrogative visualization"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"99--100"
-, update =	"97.03 agarwal, 96.09 mitchell"
-, annote =	"Invited Lecture by C. Bajaj"
+, author =      "C. Bajaj"
+, title =       "Computational geometry for interrogative visualization"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "99--100"
+, update =      "97.03 agarwal, 96.09 mitchell"
+, annote =      "Invited Lecture by C. Bajaj"
 }
 
 @incollection{b-gmas-89
-, author =	"C. Bajaj"
-, title =	"Geometric Modeling with Algebraic Surfaces"
-, editor =	"D. Handscomb"
-, booktitle =	"The Mathematics of Surfaces III"
-, publisher =	"Oxford University Press"
-, year =	1989
-, pages =	"3--48"
-, update =	"97.11 bibrelex"
+, author =      "C. Bajaj"
+, title =       "Geometric Modeling with Algebraic Surfaces"
+, editor =      "D. Handscomb"
+, booktitle =   "The Mathematics of Surfaces III"
+, publisher =   "Oxford University Press"
+, year =        1989
+, pages =       "3--48"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{b-gocc-84
-, author =	"C. Bajaj"
-, title =	"Geometric optimization and computational complexity"
-, type =	"Technical {Report}"
-, number =	"TR~84-629"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1984
+, author =      "C. Bajaj"
+, title =       "Geometric optimization and computational complexity"
+, type =        "Technical {Report}"
+, number =      "TR~84-629"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1984
 }
 
 @inproceedings{b-goph-85
-, author =	"C. Bajaj"
-, title =	"Geometric Optimization and the Polynomial Hierarchy"
-, booktitle =	"Proc. 5th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, site =	"New Delhi, India"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	206
-, publisher =	"Springer-Verlag"
-, month =	dec
-, year =	1985
-, pages =	"176--195"
-, precedes =	"b-goph-87"
-, update =	"99.11 bibrelex, 96.05 pascucci, 95.05 korneenko, 93.09 milone+mitchell"
+, author =      "C. Bajaj"
+, title =       "Geometric Optimization and the Polynomial Hierarchy"
+, booktitle =   "Proc. 5th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, site =        "New Delhi, India"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      206
+, publisher =   "Springer-Verlag"
+, month =       dec
+, year =        1985
+, pages =       "176--195"
+, precedes =    "b-goph-87"
+, update =      "99.11 bibrelex, 96.05 pascucci, 95.05 korneenko, 93.09 milone+mitchell"
 }
 
 @article{b-goph-87
-, author =	"C. Bajaj"
-, title =	"Geometric optimization and the polynomial hierarchy"
-, journal =	"Theoret. Comput. Sci."
-, volume =	54
-, number =	1
-, year =	1987
-, pages =	"87--102"
-, keywords =	"optimization, facility location, computational complexity"
-, succeeds =	"b-goph-85"
-, update =	"95.05 korneenko"
+, author =      "C. Bajaj"
+, title =       "Geometric optimization and the polynomial hierarchy"
+, journal =     "Theoret. Comput. Sci."
+, volume =      54
+, number =      1
+, year =        1987
+, pages =       "87--102"
+, keywords =    "optimization, facility location, computational complexity"
+, succeeds =    "b-goph-85"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{b-lasgm-86
-, author =	"C. Bajaj"
-, title =	"Limitations to algorithm solvability: {Galois} methods and models of computation"
-, booktitle =	"Proc. ACM Sympos. Symbolic and Algebraic Computation"
-, year =	1986
-, pages =	"71--76"
-, keywords =	"discrete geometry, algebra, complexity theory, two-dimensional, three-dimensional, CAD, robotics"
+, author =      "C. Bajaj"
+, title =       "Limitations to algorithm solvability: {Galois} methods and models of computation"
+, booktitle =   "Proc. ACM Sympos. Symbolic and Algebraic Computation"
+, year =        1986
+, pages =       "71--76"
+, keywords =    "discrete geometry, algebra, complexity theory, two-dimensional, three-dimensional, CAD, robotics"
 }
 
 @techreport{b-lpiir-89
-, author =	"C. Bajaj"
-, title =	"Local Parameterization, Implicitazion and Inversion of Real Algebraic Curves"
-, type =	"Technical {Report}"
-, number =	"CSD-TR-863"
-, institution =	"Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1989
-, note =	"Also CAPO-89-9, Proc. AAECC-7 Conf."
-, update =	"97.11 bibrelex"
+, author =      "C. Bajaj"
+, title =       "Local Parameterization, Implicitazion and Inversion of Real Algebraic Curves"
+, type =        "Technical {Report}"
+, number =      "CSD-TR-863"
+, institution = "Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1989
+, note =        "Also CAPO-89-9, Proc. AAECC-7 Conf."
+, update =      "97.11 bibrelex"
 }
 
 @techreport{b-mgopa-84
-, author =	"C. Bajaj"
-, title =	"{MINSUM} geometric optimization problems are {$\delta_{2}^{P}$}-proper"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1984
-, comments =	"Updated invited version in \cite{b-goph-87}"
-, precedes =	"b-goph-87"
-, update =	"96.05 pascucci, 93.05 jones"
+, author =      "C. Bajaj"
+, title =       "{MINSUM} geometric optimization problems are {$\delta_{2}^{P}$}-proper"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1984
+, comments =    "Updated invited version in \cite{b-goph-87}"
+, precedes =    "b-goph-87"
+, update =      "96.05 pascucci, 93.05 jones"
 }
 
 @article{b-pgans-86
-, author =	"C. Bajaj"
-, title =	"Proving geometric algorithm non-solvability: {An} application of factoring polynomials"
-, journal =	"J. Symbolic Comput."
-, volume =	2
-, year =	1986
-, pages =	"99--102"
-, keywords =	"discrete geometry, algebra, complexity theory, two-dimensional, three-dimensional, CAD, robotics"
+, author =      "C. Bajaj"
+, title =       "Proving geometric algorithm non-solvability: {An} application of factoring polynomials"
+, journal =     "J. Symbolic Comput."
+, volume =      2
+, year =        1986
+, pages =       "99--102"
+, keywords =    "discrete geometry, algebra, complexity theory, two-dimensional, three-dimensional, CAD, robotics"
 }
 
 @inproceedings{b-rhd-90
-, author =	"C. Bajaj"
-, title =	"Rational Hypersurface Display"
-, booktitle =	"Proc. 1990 Sympos. Interactive 3D Graphics"
-, site =	"Snowbird, UT"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "C. Bajaj"
+, title =       "Rational Hypersurface Display"
+, booktitle =   "Proc. 1990 Sympos. Interactive 3D Graphics"
+, site =        "Snowbird, UT"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @techreport{b-rglao-84
-, author =	"C. Bajaj"
-, title =	"Reducibility among geometric location-allocation optimization problems"
-, type =	"Technical {Report}"
-, number =	"TR~84-607"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1984
-, keywords =	"discrete geometry, complexity theory, optimization, two-dimensional, three-dimensional, robotics"
+, author =      "C. Bajaj"
+, title =       "Reducibility among geometric location-allocation optimization problems"
+, type =        "Technical {Report}"
+, number =      "TR~84-607"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1984
+, keywords =    "discrete geometry, complexity theory, optimization, two-dimensional, three-dimensional, robotics"
 }
 
 @inproceedings{b-acspp-85
-, author =	"C. Bajaj"
-, title =	"The algebraic complexity of shortest paths in polyhedral spaces"
-, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
-, year =	1985
-, pages =	"510--517"
-, keywords =	"motion planning, geometry, algebra, complexity theory, three-dimensional, CAD, robotics"
+, author =      "C. Bajaj"
+, title =       "The algebraic complexity of shortest paths in polyhedral spaces"
+, booktitle =   "Proc. 23rd Allerton Conf. Commun. Control Comput."
+, year =        1985
+, pages =       "510--517"
+, keywords =    "motion planning, geometry, algebra, complexity theory, three-dimensional, CAD, robotics"
 }
 
 @article{b-adgop-88
-, author =	"C. Bajaj"
-, title =	"The algebraic degree of geometric optimization problems"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"177--191"
-, keywords =	"discrete geometry, algebra, complexity theory, optimization, two-dimensional, three-dimensional, CAD, robotics"
+, author =      "C. Bajaj"
+, title =       "The algebraic degree of geometric optimization problems"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "177--191"
+, keywords =    "discrete geometry, algebra, complexity theory, optimization, two-dimensional, three-dimensional, CAD, robotics"
 }
 
 @incollection{b-eacsg-93
-, author =	"C. Bajaj"
-, title =	"The Emergence of Algebraic Curves and Surfaces in Geometric Design"
-, editor =	"R. Martin"
-, booktitle =	"Directions in Geometric Computing"
-, publisher =	"Information Geometers Press"
-, year =	1993
-, pages =	"1--29"
-, update =	"96.05 pascucci"
+, author =      "C. Bajaj"
+, title =       "The Emergence of Algebraic Curves and Surfaces in Geometric Design"
+, editor =      "R. Martin"
+, booktitle =   "Directions in Geometric Computing"
+, publisher =   "Information Geometers Press"
+, year =        1993
+, pages =       "1--29"
+, update =      "96.05 pascucci"
 }
 
 @techreport{ba-aprcs-86
-, author =	"C. Bajaj and S. Abhyankar"
-, title =	"Automatic parameterization of rational curves and surfaces {II}: {Cubics} and cubicoids"
-, type =	"Report"
-, number =	"CSD-TR-592"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1986
-, keywords =	"algebraic geometry, design of algorithms, computer graphics, CAD"
-, update =	"93.05 jones"
+, author =      "C. Bajaj and S. Abhyankar"
+, title =       "Automatic parameterization of rational curves and surfaces {II}: {Cubics} and cubicoids"
+, type =        "Report"
+, number =      "CSD-TR-592"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1986
+, keywords =    "algebraic geometry, design of algorithms, computer graphics, CAD"
+, update =      "93.05 jones"
 }
 
 @incollection{bas-cpdp-95
-, author =	"C. Bajaj and V. Anupam and D. Schikore"
-, title =	"Custom Prosthesis Design and Prototyping"
-, chapter =	3
-, editor =	"Roy Rada and Claude Ghaoui"
-, booktitle =	"Multimedia Medical Education"
-, publisher =	"Intellect Books"
-, address =	"Oxford, England"
-, year =	1995
-, pages =	"39--47"
-, update =	"96.05 pascucci"
+, author =      "C. Bajaj and V. Anupam and D. Schikore"
+, title =       "Custom Prosthesis Design and Prototyping"
+, chapter =     3
+, editor =      "Roy Rada and Claude Ghaoui"
+, booktitle =   "Multimedia Medical Education"
+, publisher =   "Intellect Books"
+, address =     "Oxford, England"
+, year =        1995
+, pages =       "39--47"
+, update =      "96.05 pascucci"
 }
 
 @article{bbx-arssf-95
-, author =	"C. Bajaj and F. Bernardini and G. Xu"
-, title =	"Automatic reconstruction of surface and scalar fields from $3$d scans"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1995
-, pages =	"109--118"
-, note =	"Proc. SIGGRAPH'95"
-, update =	"98.07 bibrelex"
+, author =      "C. Bajaj and F. Bernardini and G. Xu"
+, title =       "Automatic reconstruction of surface and scalar fields from $3$d scans"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1995
+, pages =       "109--118"
+, note =        "Proc. SIGGRAPH'95"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bcgw-frpc-89
-, author =	"C. Bajaj and J. Canny and T. Garrity and J. Warren"
-, title =	"Factoring Rational Polynomials over the Complexes"
-, booktitle =	"Proc. Internat. Sympos. on Symbolic and Algebraic Computation"
-, year =	1989
-, pages =	"81--90"
-, update =	"97.11 bibrelex"
+, author =      "C. Bajaj and J. Canny and T. Garrity and J. Warren"
+, title =       "Factoring Rational Polynomials over the Complexes"
+, booktitle =   "Proc. Internat. Sympos. on Symbolic and Algebraic Computation"
+, year =        1989
+, pages =       "81--90"
+, update =      "97.11 bibrelex"
 }
 
 @article{bcx-mcap-95
-, author =	"C. Bajaj and J. Chen and G. Xu"
-, title =	"Modeling with cubic {A}-patches"
-, journal =	"ACM Trans. Graph."
-, volume =	14
-, number =	2
-, year =	1995
-, pages =	"103--133"
-, update =	"98.07 bibrelex"
+, author =      "C. Bajaj and J. Chen and G. Xu"
+, title =       "Modeling with cubic {A}-patches"
+, journal =     "ACM Trans. Graph."
+, volume =      14
+, number =      2
+, year =        1995
+, pages =       "103--133"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bd-cdpr-90
-, author =	"C. Bajaj and T. Dey"
-, title =	"Convex Decomposition of Polyhedra and Robustness"
-, type =	"Technical {Report}"
-, number =	"CSD-TR-990"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "C. Bajaj and T. Dey"
+, title =       "Convex Decomposition of Polyhedra and Robustness"
+, type =        "Technical {Report}"
+, number =      "CSD-TR-990"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @techreport{bd-cdsp-89
-, author =	"C. Bajaj and T. Dey"
-, title =	"Convex Decomposition of Simple Polyhedra"
-, number =	"CSD-TR-833"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, year =	1989
-, update =	"98.03 bibrelex"
+, author =      "C. Bajaj and T. Dey"
+, title =       "Convex Decomposition of Simple Polyhedra"
+, number =      "CSD-TR-833"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, year =        1989
+, update =      "98.03 bibrelex"
 }
 
 @article{bd-cdpr-92
-, author =	"C. Bajaj and T. K. Dey"
-, title =	"Convex decomposition of polyhedra and robustness"
-, journal =	"SIAM J. Comput."
-, volume =	21
-, year =	1992
-, pages =	"339--364"
+, author =      "C. Bajaj and T. K. Dey"
+, title =       "Convex decomposition of polyhedra and robustness"
+, journal =     "SIAM J. Comput."
+, volume =      21
+, year =        1992
+, pages =       "339--364"
 }
 
 @inproceedings{bd-pnr-89
-, author =	"C. Bajaj and T. K. Dey"
-, title =	"Polygon nesting and robustness"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, year =	1989
-, pages =	"33--40"
-, keywords =	"containment"
-, precedes =	"bd-pnr-90"
-, update =	"95.09 mitchell"
+, author =      "C. Bajaj and T. K. Dey"
+, title =       "Polygon nesting and robustness"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, year =        1989
+, pages =       "33--40"
+, keywords =    "containment"
+, precedes =    "bd-pnr-90"
+, update =      "95.09 mitchell"
 }
 
 @article{bd-pnr-90
-, author =	"C. Bajaj and T. K. Dey"
-, title =	"Polygon nesting and robustness"
-, journal =	"Inform. Process. Lett."
-, volume =	35
-, year =	1990
-, pages =	"23--32"
-, keywords =	"containment"
-, succeeds =	"bd-pnr-89"
-, update =	"95.09 mitchell, 93.09 dey"
+, author =      "C. Bajaj and T. K. Dey"
+, title =       "Polygon nesting and robustness"
+, journal =     "Inform. Process. Lett."
+, volume =      35
+, year =        1990
+, pages =       "23--32"
+, keywords =    "containment"
+, succeeds =    "bd-pnr-89"
+, update =      "95.09 mitchell, 93.09 dey"
 }
 
 @techreport{bgw-amer-88
-, author =	"C. Bajaj and T. Garrity and J. Warren"
-, title =	"Applications of multi-equational resultants"
-, type =	"Technical {Report}"
-, number =	826
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "C. Bajaj and T. Garrity and J. Warren"
+, title =       "Applications of multi-equational resultants"
+, type =        "Technical {Report}"
+, number =      826
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bhhl-tsi-87
-, author =	"C. Bajaj and C. M. Hoffmann and J. E. Hopcroft and R. E. Lynch"
-, title =	"Tracing surface intersections"
-, type =	"Report"
-, number =	"CSD-TR-728"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1987
+, author =      "C. Bajaj and C. M. Hoffmann and J. E. Hopcroft and R. E. Lynch"
+, title =       "Tracing surface intersections"
+, type =        "Report"
+, number =      "CSD-TR-728"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1987
 }
 
 @article{bi-cspia-92
-, author =	"C. Bajaj and I. Ihm"
-, title =	"$C^1$ Smoothing of Polyhedra with Implicit Algebraic Splines"
-, journal =	"Comput. Graph."
-, volume =	26
-, number =	2
-, year =	1992
-, pages =	"79--88"
-, note =	"Proc. SIGGRAPH '92"
-, update =	"96.09 devillers, 96.05 pascucci"
+, author =      "C. Bajaj and I. Ihm"
+, title =       "$C^1$ Smoothing of Polyhedra with Implicit Algebraic Splines"
+, journal =     "Comput. Graph."
+, volume =      26
+, number =      2
+, year =        1992
+, pages =       "79--88"
+, note =        "Proc. SIGGRAPH '92"
+, update =      "96.09 devillers, 96.05 pascucci"
 }
 
 @inproceedings{bk-gcso3-87
-, author =	"C. Bajaj and M. Kim"
-, title =	"Generation of Configuration Space Obstacles {III}: {The} Case of Moving Algebraic Curves"
-, booktitle =	"Proc. 4th IEEE Internat. Conf. Robot. Autom."
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "C. Bajaj and M. Kim"
+, title =       "Generation of Configuration Space Obstacles {III}: {The} Case of Moving Algebraic Curves"
+, booktitle =   "Proc. 4th IEEE Internat. Conf. Robot. Autom."
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @incollection{bkm-apgm-88
-, author =	"C. Bajaj and M.-S. Kim"
-, title =	"Algorithms for planar geometric models"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	317
-, year =	1988
-, pages =	"67--81"
-, keywords =	"curvilinear, convex hull, decomposition, motion planning"
-, update =	"95.05 korneenko"
+, author =      "C. Bajaj and M.-S. Kim"
+, title =       "Algorithms for planar geometric models"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      317
+, year =        1988
+, pages =       "67--81"
+, keywords =    "curvilinear, convex hull, decomposition, motion planning"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bk-cmpgm-87
-, author =	"C. Bajaj and M.-S. Kim"
-, title =	"Compliant motion planning with geometric models"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"171--180"
-, keywords =	"motion planning, algebraic geometry, design of algorithms, three-dimensional, CAD, robotics"
-, comments =	"full version appeared as Generation of configuration space obstacles:{II} The moving of algebraic surfaces, the internation journal of robotics research 9:1, feb 1990, 92-112"
-, cites =	"a-hragr-76, ab-arpcs-87, ba-aprcs-86, ab-arpcs3-86, aa-ntsrm-76, bk-gcso2-86, bk-gcso3-87, bfh-sam-86, bcl-casac-82, c-cdmp-84, c-cpplb-84, c-cmpr-71, d-etqti-08, c-dgcs-76, d-mpsdf-84, fa-spbsg-84, f-past-75, grs-kfcg-83, gs-ccrs-86, hh-gabr-86, hk-crcs-85, h-rv-86, kw-gcsmm-79, l-spcsa-83, lw-apcfp-79, lmt-asfms-84, mmp-dgp-85, m-fspcp-85, osb-spps-85, p-mmp-78, r-rrso-80, rv-smcsr-83, ss-pmp2g-83, ss-spps-84, th-otdp-84, u-cdacc-77, w-ac-78, y-amp-85, ZZZ"
-, update =	"98.03 bibrelex, 93.09 milone+mitchell"
+, author =      "C. Bajaj and M.-S. Kim"
+, title =       "Compliant motion planning with geometric models"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "171--180"
+, keywords =    "motion planning, algebraic geometry, design of algorithms, three-dimensional, CAD, robotics"
+, comments =    "full version appeared as Generation of configuration space obstacles:{II} The moving of algebraic surfaces, the internation journal of robotics research 9:1, feb 1990, 92-112"
+, cites =       "a-hragr-76, ab-arpcs-87, ba-aprcs-86, ab-arpcs3-86, aa-ntsrm-76, bk-gcso2-86, bk-gcso3-87, bfh-sam-86, bcl-casac-82, c-cdmp-84, c-cpplb-84, c-cmpr-71, d-etqti-08, c-dgcs-76, d-mpsdf-84, fa-spbsg-84, f-past-75, grs-kfcg-83, gs-ccrs-86, hh-gabr-86, hk-crcs-85, h-rv-86, kw-gcsmm-79, l-spcsa-83, lw-apcfp-79, lmt-asfms-84, mmp-dgp-85, m-fspcp-85, osb-spps-85, p-mmp-78, r-rrso-80, rv-smcsr-83, ss-pmp2g-83, ss-spps-84, th-otdp-84, u-cdacc-77, w-ac-78, y-amp-85, ZZZ"
+, update =      "98.03 bibrelex, 93.09 milone+mitchell"
 }
 
 @techreport{bk-choba-87
-, author =	"C. Bajaj and M. S. Kim"
-, title =	"Convex hull of objects bounded by algebraic curves"
-, type =	"Report"
-, number =	"CSD-TR-697"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1987
-, precedes =	"bk-choba-91"
+, author =      "C. Bajaj and M. S. Kim"
+, title =       "Convex hull of objects bounded by algebraic curves"
+, type =        "Report"
+, number =      "CSD-TR-697"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1987
+, precedes =    "bk-choba-91"
 }
 
 @article{bk-choba-91
-, author =	"C. Bajaj and M. S. Kim"
-, title =	"Convex hull of objects bounded by algebraic curves"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"533--553"
-, succeeds =	"bk-choba-87"
+, author =      "C. Bajaj and M. S. Kim"
+, title =       "Convex hull of objects bounded by algebraic curves"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "533--553"
+, succeeds =    "bk-choba-87"
 }
 
 @techreport{bk-gcso1-85
-, author =	"C. Bajaj and M.-S. Kim"
-, title =	"Generation of configuration space obstacles {I}: the case of a moving sphere"
-, type =	"Report"
-, number =	"CSD-TR-565"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1985
-, keywords =	"motion planning, algebraic geometry, design of algorithms, three-dimensional, CAD, robotics"
-, precedes =	"bkm-gcsoc-88"
-, update =	"95.05 korneenko"
+, author =      "C. Bajaj and M.-S. Kim"
+, title =       "Generation of configuration space obstacles {I}: the case of a moving sphere"
+, type =        "Report"
+, number =      "CSD-TR-565"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1985
+, keywords =    "motion planning, algebraic geometry, design of algorithms, three-dimensional, CAD, robotics"
+, precedes =    "bkm-gcsoc-88"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bk-gcso2-86
-, author =	"C. Bajaj and M. S. Kim"
-, title =	"Generation of configuration space obstacles {II}: the case of moving algebraic surfaces"
-, type =	"Report"
-, number =	"CSD-TR-586"
-, institution =	"Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1986
-, keywords =	"motion planning, algebraic geometry, design of algorithms, three-dimensional, CAD, robotics"
-, precedes =	"bk-gcsoc-89"
+, author =      "C. Bajaj and M. S. Kim"
+, title =       "Generation of configuration space obstacles {II}: the case of moving algebraic surfaces"
+, type =        "Report"
+, number =      "CSD-TR-586"
+, institution = "Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1986
+, keywords =    "motion planning, algebraic geometry, design of algorithms, three-dimensional, CAD, robotics"
+, precedes =    "bk-gcsoc-89"
 }
 
 @article{bk-gcsoc-89
-, author =	"C. Bajaj and M.-S. Kim"
-, title =	"Generation of configuration space obstacles: the case of moving algebraic surfaces"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"155--172"
-, succeeds =	"bk-gcso2-86"
+, author =      "C. Bajaj and M.-S. Kim"
+, title =       "Generation of configuration space obstacles: the case of moving algebraic surfaces"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "155--172"
+, succeeds =    "bk-gcso2-86"
 }
 
 @article{bkm-gcsoc-88
-, author =	"C. Bajaj and M.-S. Kim"
-, title =	"Generation of configuration-space obstacles: {The} case of moving sphere"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	4
-, number =	1
-, year =	1988
-, pages =	"94--99"
-, keywords =	"motion planning"
-, precedes =	"bk-gcso1-85"
-, update =	"95.05 korneenko"
+, author =      "C. Bajaj and M.-S. Kim"
+, title =       "Generation of configuration-space obstacles: {The} case of moving sphere"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      4
+, number =      1
+, year =        1988
+, pages =       "94--99"
+, keywords =    "motion planning"
+, precedes =    "bk-gcso1-85"
+, update =      "95.05 korneenko"
 }
 
 @article{bl-godc-89
-, author =	"C. Bajaj and M. Li"
-, title =	"Geometric optimization and {$D^P$}-completeness"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"3--13"
+, author =      "C. Bajaj and M. Li"
+, title =       "Geometric optimization and {$D^P$}-completeness"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "3--13"
 }
 
 @inproceedings{bl-dicp-83
-, author =	"C. Bajaj and M. Li"
-, title =	"On the duality of intersections and closest points"
-, booktitle =	"Proc. 21st Allerton Conf. Commun. Control Comput."
-, year =	1983
-, pages =	"459--461"
-, keywords =	"discrete geometry, design of algorithms, geometric transformations, computer graphics, CAD"
+, author =      "C. Bajaj and M. Li"
+, title =       "On the duality of intersections and closest points"
+, booktitle =   "Proc. 21st Allerton Conf. Commun. Control Comput."
+, year =        1983
+, pages =       "459--461"
+, keywords =    "discrete geometry, design of algorithms, geometric transformations, computer graphics, CAD"
 }
 
 @article{bm-gusp-88
-, author =	"C. Bajaj and T. T. Moh"
-, title =	"Generalized unfoldings for shortest paths"
-, journal =	"Internat. J. Robot. Res."
-, volume =	7
-, year =	1988
-, pages =	"71--76"
-, keywords =	"motion planning, elementary geometry, design of algorithms, geodesic distance, CAD, robotics"
-, succeeds =	"bm-guspe-85"
-, update =	"97.11 bibrelex"
+, author =      "C. Bajaj and T. T. Moh"
+, title =       "Generalized unfoldings for shortest paths"
+, journal =     "Internat. J. Robot. Res."
+, volume =      7
+, year =        1988
+, pages =       "71--76"
+, keywords =    "motion planning, elementary geometry, design of algorithms, geodesic distance, CAD, robotics"
+, succeeds =    "bm-guspe-85"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{bm-guspe-85
-, author =	"C. Bajaj and T. T. Moh"
-, title =	"Generalized Unfoldings for Shortest Paths in {Euclidean} 3-Space"
-, type =	"Technical {Report}"
-, number =	"CSD-TR-526"
-, institution =	"Department of Computer Science, Purdue University"
-, year =	1985
-, precedes =	"bm-gusp-88"
-, update =	"98.07 bibrelex, 93.09 milone+mitchell"
+, author =      "C. Bajaj and T. T. Moh"
+, title =       "Generalized Unfoldings for Shortest Paths in {Euclidean} 3-Space"
+, type =        "Technical {Report}"
+, number =      "CSD-TR-526"
+, institution = "Department of Computer Science, Purdue University"
+, year =        1985
+, precedes =    "bm-gusp-88"
+, update =      "98.07 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{br-frrpc-95
-, author =	"C. Bajaj and A. Royappa"
-, title =	"Finite representations of real parametric curves and surfaces"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"313--326"
-, keywords =	"real parametric curves and surfaces, varieties, computer graphics, projective domain transformations"
-, update =	"96.09 devillers"
+, author =      "C. Bajaj and A. Royappa"
+, title =       "Finite representations of real parametric curves and surfaces"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "313--326"
+, keywords =    "real parametric curves and surfaces, varieties, computer graphics, projective domain transformations"
+, update =      "96.09 devillers"
 }
 
 @techreport{br-gagt-90
-, author =	"C. Bajaj and A. Royappa"
-, title =	"The {GANITH} Algebraic Geometry Toolkit"
-, type =	"Technical {Report}"
-, number =	914
-, institution =	"Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1990
-, note =	"CAPO Report No. CER-89-21, Also to appear in DISCO 90"
-, update =	"97.11 bibrelex"
+, author =      "C. Bajaj and A. Royappa"
+, title =       "The {GANITH} Algebraic Geometry Toolkit"
+, type =        "Technical {Report}"
+, number =      914
+, institution = "Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1990
+, note =        "CAPO Report No. CER-89-21, Also to appear in DISCO 90"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bs-ebrtm-96
-, author =	"C. Bajaj and D. Schikore"
-, title =	"Error-bounded reduction of triangle meshes with multivariate data"
-, booktitle =	"Proc. SPIE Sympos. Visual Data Exploration and Analysis III"
-, month =	jan
-, year =	1996
-, pages =	"34--45"
-, update =	"98.07 bibrelex"
+, author =      "C. Bajaj and D. Schikore"
+, title =       "Error-bounded reduction of triangle meshes with multivariate data"
+, booktitle =   "Proc. SPIE Sympos. Visual Data Exploration and Analysis III"
+, month =       jan
+, year =        1996
+, pages =       "34--45"
+, update =      "98.07 bibrelex"
 }
 
 @article{bs-tpdse-98
-, author =	"C. Bajaj and D. Schikore"
-, title =	"Topology preserving data simplification with error bounds"
-, journal =	"Computers \& Graphics"
-, volume =	22
-, number =	1
-, year =	1998
-, pages =	"3--12"
-, update =	"02.03 wenger"
+, author =      "C. Bajaj and D. Schikore"
+, title =       "Topology preserving data simplification with error bounds"
+, journal =     "Computers \& Graphics"
+, volume =      22
+, number =      1
+, year =        1998
+, pages =       "3--12"
+, update =      "02.03 wenger"
 }
 
 @incollection{bx-crcsr-94
-, author =	"Chandrajit Bajaj and Guoliang Xu"
-, title =	"Converting a Rational Curve to a Standard Rational {Bernstein}-{B{\'e}zier} Representation"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"256--260"
-, keywords =	"Bezier curve, rational curve, NURB"
-, update =	"94.09 heckbert"
-, annote =	"Discusses a low-level operation on curves: conversion of a
+, author =      "Chandrajit Bajaj and Guoliang Xu"
+, title =       "Converting a Rational Curve to a Standard Rational {Bernstein}-{B{\'e}zier} Representation"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "256--260"
+, keywords =    "Bezier curve, rational curve, NURB"
+, update =      "94.09 heckbert"
+, annote =      "Discusses a low-level operation on curves: conversion of a
 rational piecewise polynomial curve into rational Bernstein-Bezier form, a
 commonly used type of non-uniform rational B-spline (NURB). Rational splines
 are useful because they allow conic curves to be represented exactly,
@@ -14190,1204 +14190,1204 @@ @incollection{bx-crcsr-94
 }
 
 @booklet{b-cmst-95
-, author =	"C. L. Bajaj"
-, title =	"Collaborative Multimedia \& Scientific Toolkits"
-, howpublished =	"Course Notes, Dept. Comp. Sci., Purdue Univ."
-, address =	"West Lafayette, Indiana"
-, year =	1996
-, update =	"98.07 tamassia"
+, author =      "C. L. Bajaj"
+, title =       "Collaborative Multimedia \& Scientific Toolkits"
+, howpublished =        "Course Notes, Dept. Comp. Sci., Purdue Univ."
+, address =     "West Lafayette, Indiana"
+, year =        1996
+, update =      "98.07 tamassia"
 }
 
 @inproceedings{b-gcavb-90
-, author =	"C. L. Bajaj"
-, title =	"Geometric computations with algebraic varieties of bounded degree"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"148--156"
-, cites =	"a-gph-88, ab-arpcs-87, ab-arpcs2-87, ab-cac-89, b-gmas-89, b-lpiir-89, b-rhd-90, bcgw-frpc-89, bhhl-tsi-87, br-gagt-90, b-gbamp-85, c-sagcp-88, c-gcp-88, ckl-sspef-89, c-te-48, cg-stssa-83, d-cag-79, f-it-84, gw-cipas-87, g-seppi-84, h-ag-77, h-tdaz-08, hy-prsts-87, hk-crcs-85i, jb-spaac-90, k-eidat-03, k-geatd-82, k-eukav-52, k-eukav-59, l-mmdiq-79, l-gbger-83, l-gprs-83, m-sfe-02, mm-cwpcs-82, mm-chf-83, oss-picpu-87, r-ccgfo-89, s-limha-85, sr-iag-49, s-fpavp-80, ss-pmp2g-83, ss-pcas-87, w-tbcav-87, zs-ca1-58, zs-ca2-58, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "C. L. Bajaj"
+, title =       "Geometric computations with algebraic varieties of bounded degree"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "148--156"
+, cites =       "a-gph-88, ab-arpcs-87, ab-arpcs2-87, ab-cac-89, b-gmas-89, b-lpiir-89, b-rhd-90, bcgw-frpc-89, bhhl-tsi-87, br-gagt-90, b-gbamp-85, c-sagcp-88, c-gcp-88, ckl-sspef-89, c-te-48, cg-stssa-83, d-cag-79, f-it-84, gw-cipas-87, g-seppi-84, h-ag-77, h-tdaz-08, hy-prsts-87, hk-crcs-85i, jb-spaac-90, k-eidat-03, k-geatd-82, k-eukav-52, k-eukav-59, l-mmdiq-79, l-gbger-83, l-gprs-83, m-sfe-02, mm-cwpcs-82, mm-chf-83, oss-picpu-87, r-ccgfo-89, s-limha-85, sr-iag-49, s-fpavp-80, ss-pmp2g-83, ss-pcas-87, w-tbcav-87, zs-ca1-58, zs-ca2-58, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{bbx-rsfsu-97
-, author =	"C. L. Bajaj and F. Bernadini and G. Xu"
-, title =	"Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data"
-, journal =	"Algorithmica"
-, volume =	19
-, number =	"1--2"
-, month =	sep
-, year =	1997
-, pages =	"243--261"
-, update =	"97.07 held"
+, author =      "C. L. Bajaj and F. Bernadini and G. Xu"
+, title =       "Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data"
+, journal =     "Algorithmica"
+, volume =      19
+, number =      "1--2"
+, month =       sep
+, year =        1997
+, pages =       "243--261"
+, update =      "97.07 held"
 }
 
 @inproceedings{bb-dvddt-90
-, author =	"C. L. Bajaj and W. J. Bouma"
-, title =	"Dynamic {Voronoi} diagrams and {Delaunay} triangulations"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"273--277"
-, cites =	"a-sdcgp-85, b-gmas-89, bgw-amer-88, c-fsram-84, e-acg-87, ow-dsp-84t, ps-cgi-85, rs-mppmo-85t, s-acvd-92, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "C. L. Bajaj and W. J. Bouma"
+, title =       "Dynamic {Voronoi} diagrams and {Delaunay} triangulations"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "273--277"
+, cites =       "a-sdcgp-85, b-gmas-89, bgw-amer-88, c-fsram-84, e-acg-87, ow-dsp-84t, ps-cgi-85, rs-mppmo-85t, s-acvd-92, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bcl-b3dtm-96
-, author =	"Chandrajit L. Bajaj and Edward J. Coyle and Kwun-Nan Lin"
-, title =	"Boundary and 3D triangular meshes from planar cross sections"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"169--178"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Chandrajit L. Bajaj and Edward J. Coyle and Kwun-Nan Lin"
+, title =       "Boundary and 3D triangular meshes from planar cross sections"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "169--178"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @incollection{bd-rdp-89
-, author =	"C. L. Bajaj and T. K. Dey"
-, title =	"Robust decompositions of polyhedra"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	405
-, year =	1989
-, pages =	"267--279"
-, keywords =	"polyhedron decomposition robust"
-, update =	"95.05 korneenko"
+, author =      "C. L. Bajaj and T. K. Dey"
+, title =       "Robust decompositions of polyhedra"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      405
+, year =        1989
+, pages =       "267--279"
+, keywords =    "polyhedron decomposition robust"
+, update =      "95.05 korneenko"
 }
 
 @incollection{be-sgm-97
-, author =	"C. L. Bajaj and S. Evans"
-, title =	"Splines and geometric modeling"
-, chapter =	45
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"833--850"
-, update =	"97.11 orourke"
+, author =      "C. L. Bajaj and S. Evans"
+, title =       "Splines and geometric modeling"
+, chapter =     45
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "833--850"
+, update =      "97.11 orourke"
 }
 
 @article{bhlh-tsi-88
-, author =	"C. L. Bajaj and C. M. Hoffman and R. E. Lynch and J. E. Hopcroft"
-, title =	"Tracing surface intersections"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	5
-, year =	1988
-, pages =	"285--307"
-, update =	"97.11 bibrelex"
+, author =      "C. L. Bajaj and C. M. Hoffman and R. E. Lynch and J. E. Hopcroft"
+, title =       "Tracing surface intersections"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      5
+, year =        1988
+, pages =       "285--307"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bi-hiura-89
-, author =	"C. L. Bajaj and I. Ihm"
-, title =	"Hermite interpolation using real algebraic surfaces"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"94--103"
-, cites =	"b-gmas-89, bhhl-tsi-87, d-pimcc-85, f-spm-86, hh-qbs-86, m-essle-73, ms-bsstv-85a, p-dlsfas-87, rr-crbsm-84, s-igubc-87, s-pasp-85, w-bqsqc-87, w-asmgc-86, w-bgm-87, ZZZ"
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "C. L. Bajaj and I. Ihm"
+, title =       "Hermite interpolation using real algebraic surfaces"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "94--103"
+, cites =       "b-gmas-89, bhhl-tsi-87, d-pimcc-85, f-spm-86, hh-qbs-86, m-essle-73, ms-bsstv-85a, p-dlsfas-87, rr-crbsm-84, s-igubc-87, s-pasp-85, w-bqsqc-87, w-asmgc-86, w-bgm-87, ZZZ"
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{bp-sccpa-96
-, author =	"Chandrajit L. Bajaj and Valerio Pascucci"
-, title =	"Splitting a Complex of Convex Polytopes in any Dimension"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"88--97"
-, cites =	"am-dhsrr-95, am-rsss-94, b-rgsdd-93, bd-cdpr-92, be-mgot-92i, c-oaitd-92, cd-icott-87, dk-fdpi-83, e-acg-87, em-sstcd-90, fm-nsala-91, g-cp-67, hk-prga-92, k-opcbf-95, l-ndgcm-94, lc-mchr3-87, lm-cschu-90, m-cgitr-93, m-rpm-93, m-rsehc-93, mhc-avcev-90, n-cgpt-93, nat-mbtyp-90, pbcf-dimsc-93, pfp-diccb-95, py-ebsph-90, s-lrapi-94, s-rcaic-94, t-cpos-92, tn-sopub-87, v-bimsp-91, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Chandrajit L. Bajaj and Valerio Pascucci"
+, title =       "Splitting a Complex of Convex Polytopes in any Dimension"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "88--97"
+, cites =       "am-dhsrr-95, am-rsss-94, b-rgsdd-93, bd-cdpr-92, be-mgot-92i, c-oaitd-92, cd-icott-87, dk-fdpi-83, e-acg-87, em-sstcd-90, fm-nsala-91, g-cp-67, hk-prga-92, k-opcbf-95, l-ndgcm-94, lc-mchr3-87, lm-cschu-90, m-cgitr-93, m-rpm-93, m-rsehc-93, mhc-avcev-90, n-cgpt-93, nat-mbtyp-90, pbcf-dimsc-93, pfp-diccb-95, py-ebsph-90, s-lrapi-94, s-rcaic-94, t-cpos-92, tn-sopub-87, v-bimsp-91, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{bps-fiii-96
-, author =	"C. L. Bajaj and V. Pascucci and D. R. Schikore"
-, title =	"Fast isocontouring for improved interactivity"
-, booktitle =	"Proc. 1996 IEEE Symposium on Volume Visualization"
-, site =	"San Francisco, CA"
-, month =	oct
-, year =	1996
-, pages =	"39--46"
-, update =	"98.07 bibrelex"
+, author =      "C. L. Bajaj and V. Pascucci and D. R. Schikore"
+, title =       "Fast isocontouring for improved interactivity"
+, booktitle =   "Proc. 1996 IEEE Symposium on Volume Visualization"
+, site =        "San Francisco, CA"
+, month =       oct
+, year =        1996
+, pages =       "39--46"
+, update =      "98.07 bibrelex"
 }
 
 @article{a-pfp-00
-, author =	"C. L. Bajaj and A. V. Royappa"
-, title =	"Parameterization in Finite Precision"
-, journal =	"Algorithmica"
-, volume =	27
-, number =	1
-, year =	2000
-, pages =	"100--114"
-, update =	"00.11 smid, 00.07 held"
+, author =      "C. L. Bajaj and A. V. Royappa"
+, title =       "Parameterization in Finite Precision"
+, journal =     "Algorithmica"
+, volume =      27
+, number =      1
+, year =        2000
+, pages =       "100--114"
+, update =      "00.11 smid, 00.07 held"
 }
 
 @article{b-ap-88
-, author =	"R. Bajcsy"
-, title =	"Active perception"
-, journal =	"Proc. IEEE"
-, volume =	76
-, number =	8
-, year =	1988
-, pages =	"996--1005"
-, update =	"98.07 bibrelex"
+, author =      "R. Bajcsy"
+, title =       "Active perception"
+, journal =     "Proc. IEEE"
+, volume =      76
+, number =      8
+, year =        1988
+, pages =       "996--1005"
+, update =      "98.07 bibrelex"
 }
 
 @article{bck-ccmdo-85
-, author =	"J. Bajon and M. Catto{\"e}n and S. D. Kim"
-, title =	"A concavity characterization method for digital objects"
-, journal =	"Signal Process."
-, volume =	9
-, year =	1985
-, pages =	"151--161"
+, author =      "J. Bajon and M. Catto{\"e}n and S. D. Kim"
+, title =       "A concavity characterization method for digital objects"
+, journal =     "Signal Process."
+, volume =      9
+, year =        1985
+, pages =       "151--161"
 }
 
 @inproceedings{b-spucp-85
-, author =	"B. Baker"
-, title =	"Shortest Paths With Unit Clearance Among Polygonal Obstacles"
-, booktitle =	"SIAM Conference on Geometric Modeling and Robotics"
-, site =	"Albany, NY"
-, month =	jul
-, year =	1985
-, update =	"93.09 milone+mitchell"
+, author =      "B. Baker"
+, title =       "Shortest Paths With Unit Clearance Among Polygonal Obstacles"
+, booktitle =   "SIAM Conference on Geometric Modeling and Robotics"
+, site =        "Albany, NY"
+, month =       jul
+, year =        1985
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{bfg-spmfh-85
-, author =	"B. Baker and S. Fortune and E. Grosse"
-, title =	"Stable prehension with a multi-fingered hand"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"St. Louis, Missouri"
-, year =	1985
-, update =	"98.11 bibrelex"
+, author =      "B. Baker and S. Fortune and E. Grosse"
+, title =       "Stable prehension with a multi-fingered hand"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "St. Louis, Missouri"
+, year =        1985
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{b-aancp-83
-, author =	"B. S. Baker"
-, title =	"Approximation algorithms for {NP}-complete problems on planar graphs"
-, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "B. S. Baker"
+, title =       "Approximation algorithms for {NP}-complete problems on planar graphs"
+, booktitle =   "Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{b-aancp-94
-, author =	"B. S. Baker"
-, title =	"Approximation algorithms for {NP}-complete problems on planar graphs"
-, journal =	"J. ACM"
-, volume =	41
-, year =	1994
-, pages =	"153--180"
-, update =	"97.07 agarwal"
+, author =      "B. S. Baker"
+, title =       "Approximation algorithms for {NP}-complete problems on planar graphs"
+, journal =     "J. ACM"
+, volume =      41
+, year =        1994
+, pages =       "153--180"
+, update =      "97.07 agarwal"
 }
 
 @article{bbk-5atdp-81
-, author =	"B. S. Baker and D. J. Brown and H. P. Katseff"
-, title =	"A $5/4$ algorithm for two-dimensional packing"
-, journal =	"J. Algorithms"
-, volume =	2
-, year =	1981
-, pages =	"348--368"
+, author =      "B. S. Baker and D. J. Brown and H. P. Katseff"
+, title =       "A $5/4$ algorithm for two-dimensional packing"
+, journal =     "J. Algorithms"
+, volume =      2
+, year =        1981
+, pages =       "348--368"
 }
 
 @article{bcr-optd-80
-, author =	"B. S. Baker and E. G. {Coffman, Jr.} and R. L. Rivest"
-, title =	"Orthogonal packings in two dimensions"
-, journal =	"SIAM J. Comput."
-, volume =	9
-, year =	1980
-, pages =	"846--855"
+, author =      "B. S. Baker and E. G. {Coffman, Jr.} and R. L. Rivest"
+, title =       "Orthogonal packings in two dimensions"
+, journal =     "SIAM J. Comput."
+, volume =      9
+, year =        1980
+, pages =       "846--855"
 }
 
 @inproceedings{bfg-sptf-85
-, author =	"B. S. Baker and S. J. Fortune and E. Grosse"
-, title =	"Stable prehension with three fingers"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
-, year =	1985
-, pages =	"114--120"
+, author =      "B. S. Baker and S. J. Fortune and E. Grosse"
+, title =       "Stable prehension with three fingers"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Theory Comput."
+, year =        1985
+, pages =       "114--120"
 }
 
 @inproceedings{bfm-ipc-84
-, author =	"B. S. Baker and S. J. Fortune and S. R. Mahaney"
-, title =	"Inspection by polygon containment"
-, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
-, year =	1984
-, pages =	"91--100"
-, keywords =	"polygons, containment"
-, update =	"95.05 korneenko"
+, author =      "B. S. Baker and S. J. Fortune and S. R. Mahaney"
+, title =       "Inspection by polygon containment"
+, booktitle =   "Proc. Allerton Conf. Commun. Control Comput."
+, year =        1984
+, pages =       "91--100"
+, keywords =    "polygons, containment"
+, update =      "95.05 korneenko"
 }
 
 @article{bfm-pct-86
-, author =	"B. S. Baker and S. J. Fortune and S. R. Mahaney"
-, title =	"Polygon containment under translation"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"532--548"
-, keywords =	"motion planning, polygons"
+, author =      "B. S. Baker and S. J. Fortune and S. R. Mahaney"
+, title =       "Polygon containment under translation"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "532--548"
+, keywords =    "motion planning, polygons"
 }
 
 @article{bgr-ntp-88
-, author =	"B. S. Baker and E. Grosse and C. S. Rafferty"
-, title =	"Nonobtuse triangulation of polygons"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"147--168"
+, author =      "B. S. Baker and E. Grosse and C. S. Rafferty"
+, title =       "Nonobtuse triangulation of polygons"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "147--168"
 }
 
 @article{bs-satdp-83
-, author =	"B. S. Baker and J. S. Schwarz"
-, title =	"Shelf algorithms for two-dimensional packing problems"
-, journal =	"SIAM J. Comput."
-, volume =	12
-, year =	1983
-, pages =	"508--525"
+, author =      "B. S. Baker and J. S. Schwarz"
+, title =       "Shelf algorithms for two-dimensional packing problems"
+, journal =     "SIAM J. Comput."
+, volume =      12
+, year =        1983
+, pages =       "508--525"
 }
 
 @article{b-cialc-94
-, author =	"Henry G. Baker"
-, title =	"Corrigenda: {Intersection} algorithms for lines and circles"
-, journal =	"ACM Trans. Graph."
-, volume =	13
-, number =	3
-, year =	1994
-, pages =	"308--310"
-, keywords =	"intersection, lines, circles"
-, comments =	"Correction to mst-ialc-89"
-, update =	"95.09 korneenko"
+, author =      "Henry G. Baker"
+, title =       "Corrigenda: {Intersection} algorithms for lines and circles"
+, journal =     "ACM Trans. Graph."
+, volume =      13
+, number =      3
+, year =        1994
+, pages =       "308--310"
+, keywords =    "intersection, lines, circles"
+, comments =    "Correction to mst-ialc-89"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{bb-deibs-81
-, author =	"H. H. Baker and T. O. Binford"
-, title =	"Depth from Edge and Intensity Bases Stereo"
-, booktitle =	"Proc. 7th Internat. Joint Conf. Artif. Intell."
-, site =	"Vancouver"
-, year =	1981
-, pages =	"631--636"
-, update =	"97.11 bibrelex"
+, author =      "H. H. Baker and T. O. Binford"
+, title =       "Depth from Edge and Intensity Bases Stereo"
+, booktitle =   "Proc. 7th Internat. Joint Conf. Artif. Intell."
+, site =        "Vancouver"
+, year =        1981
+, pages =       "631--636"
+, update =      "97.11 bibrelex"
 }
 
 @article{bclt-nmaaw-95
-, author =	"J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
-, title =	"A New Model for Algorithm Animation Over the {WWW}"
-, journal =	"ACM Comput. Surv."
-, volume =	27
-, number =	4
-, year =	1995
-, pages =	"568--572"
-, url =	"https://www.cs.brown.edu/cgc/papers/bclt-nmaaw-95.ps.gz"
-, keywords =	"algorithm animation, Java, Web, WWW, graph drawing, CGC, Brown"
-, update =	"97.03 tamassia, 96.09 tamassia"
+, author =      "J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
+, title =       "A New Model for Algorithm Animation Over the {WWW}"
+, journal =     "ACM Comput. Surv."
+, volume =      27
+, number =      4
+, year =        1995
+, pages =       "568--572"
+, url = "https://www.cs.brown.edu/cgc/papers/bclt-nmaaw-95.ps.gz"
+, keywords =    "algorithm animation, Java, Web, WWW, graph drawing, CGC, Brown"
+, update =      "97.03 tamassia, 96.09 tamassia"
 }
 
 @inproceedings{bclt-aawww-96
-, author =	"J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
-, title =	"Algorithm Animation Over the {World Wide Web}"
-, booktitle =	"Proc. Int. Workshop on Advanced Visual Interfaces"
-, nickname =	"AVI '96"
-, year =	1996
-, pages =	"203--212"
-, url =	"https://www.cs.brown.edu/cgc/papers/bclt-aawww-96.ps.gz"
-, keywords =	"algorithm animation, Java, Web, WWW, CGC, Brown"
-, update =	"97.03 tamassia, 96.09 tamassia"
+, author =      "J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
+, title =       "Algorithm Animation Over the {World Wide Web}"
+, booktitle =   "Proc. Int. Workshop on Advanced Visual Interfaces"
+, nickname =    "AVI '96"
+, year =        1996
+, pages =       "203--212"
+, url = "https://www.cs.brown.edu/cgc/papers/bclt-aawww-96.ps.gz"
+, keywords =    "algorithm animation, Java, Web, WWW, CGC, Brown"
+, update =      "97.03 tamassia, 96.09 tamassia"
 }
 
 @inproceedings{bclt-agaow-96
-, author =	"James E. Baker and Isabel F. Cruz and Giuseppe Liotta and Roberto Tamassia"
-, title =	"Animating Geometric Algorithms over the {Web}"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"C3--C4"
-, url =	"https://www.cs.brown.edu/cgc/papers/bclt-agaow-96.ps.gz"
-, keywords =	"algorithm animation, Java, Web, WWW, CGC, Brown"
-, cites =	"bclt-nmaaw-95, ZZZ"
-, update =	"97.11 bibrelex, 97.03 tamassia, 96.09 tamassia, 96.05 efrat"
+, author =      "James E. Baker and Isabel F. Cruz and Giuseppe Liotta and Roberto Tamassia"
+, title =       "Animating Geometric Algorithms over the {Web}"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "C3--C4"
+, url = "https://www.cs.brown.edu/cgc/papers/bclt-agaow-96.ps.gz"
+, keywords =    "algorithm animation, Java, Web, WWW, CGC, Brown"
+, cites =       "bclt-nmaaw-95, ZZZ"
+, update =      "97.11 bibrelex, 97.03 tamassia, 96.09 tamassia, 96.05 efrat"
 }
 
 @inproceedings{bclt-maas-96
-, author =	"J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
-, title =	"The {Mocha} Algorithm Animation System"
-, booktitle =	"Proc. Int. Workshop on Advanced Visual Interfaces"
-, nickname =	"AVI '96"
-, year =	1996
-, pages =	"248--250"
-, url =	"https://www.cs.brown.edu/cgc/papers/bclt-maas-96.ps.gz"
-, keywords =	"algorithm animation, Java, Web, WWW, CGC, Brown"
-, update =	"97.03 tamassia, 96.09 tamassia"
+, author =      "J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
+, title =       "The {Mocha} Algorithm Animation System"
+, booktitle =   "Proc. Int. Workshop on Advanced Visual Interfaces"
+, nickname =    "AVI '96"
+, year =        1996
+, pages =       "248--250"
+, url = "https://www.cs.brown.edu/cgc/papers/bclt-maas-96.ps.gz"
+, keywords =    "algorithm animation, Java, Web, WWW, CGC, Brown"
+, update =      "97.03 tamassia, 96.09 tamassia"
 }
 
 @article{bclt-vga-
-, author =	"J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
-, title =	"Visualizing Geometric Algorithms over the Web"
-, journal =	"Comput. Geom. Theory Appl."
-, note =	"to appear"
-, update =	"98.11 tamassia"
+, author =      "J. E. Baker and I. F. Cruz and G. Liotta and R. Tamassia"
+, title =       "Visualizing Geometric Algorithms over the Web"
+, journal =     "Comput. Geom. Theory Appl."
+, note =        "to appear"
+, update =      "98.11 tamassia"
 }
 
 @article{bfr-pod2-71
-, author =	"K. A. Baker and P. Fishburn and F. S. Roberts"
-, title =	"Partial orders of dimension 2"
-, journal =	"Networks"
-, volume =	2
-, year =	1971
-, pages =	"11--28"
-, keywords =	"graph drawing, planar, upward"
-, update =	"95.05 tamassia"
+, author =      "K. A. Baker and P. Fishburn and F. S. Roberts"
+, title =       "Partial orders of dimension 2"
+, journal =     "Networks"
+, volume =      2
+, year =        1971
+, pages =       "11--28"
+, keywords =    "graph drawing, planar, upward"
+, update =      "95.05 tamassia"
 }
 
 @inproceedings{b-tdmgt-87
-, author =	"T. Baker"
-, title =	"Three dimensional mesh generation by triangulation of arbitrary point sets"
-, booktitle =	"Proc. AIAA 8th Comput. Fluid Dynamics Conf."
-, year =	1987
-, pages =	"255--271"
-, keywords =	"triangulation, three-dimensional"
-, update =	"95.05 korneenko"
+, author =      "T. Baker"
+, title =       "Three dimensional mesh generation by triangulation of arbitrary point sets"
+, booktitle =   "Proc. AIAA 8th Comput. Fluid Dynamics Conf."
+, year =        1987
+, pages =       "255--271"
+, keywords =    "triangulation, three-dimensional"
+, update =      "95.05 korneenko"
 }
 
 @article{b-amgct-89
-, author =	"Timothy J. Baker"
-, title =	"Automatic Mesh Generation For Complex Three-Dimensional Regions Using a Constrained {Delaunay} Triangulation"
-, journal =	"Engineering with Computers (USA)"
-, volume =	5
-, number =	"3--4"
-, year =	1989
-, pages =	"161--175"
-, keywords =	"mesh generation, Delaunay triangulation"
-, update =	"00.11 smid, 00.07 icking, 96.09 devillers"
-, annote =	"Bowyer's algorithm. Constraints by fixing triangles.
-		 Uses octrees for point location in $O(\log n)$. Yet
-		 another proof that Bowyer's works. Uses $a/r$ for tetra
-		 quality."
-, abstract =	"This paper describes a method for generating
-		 tetrahedral meshes. The algorithm, based on the
-		 Delaunay triangulation, can treat objects of
-		 essentially arbitrary complexity. In order to preserve
-		 the surface triangulation of solid objects, it is
-		 necessary to override the Delaunay property and
-		 redefine the triangulation when points are introduced
-		 that are close to solid boundaries. Details of this
-		 constrained Delaunay algorithm are presented and an
-		 efficient implementation of the triangulation method is
-		 described. Techniques for controlling the distribution
-		 of mesh points and tetrahedron quality are also
-		 discussed. (Author abstract) 25 Refs."
+, author =      "Timothy J. Baker"
+, title =       "Automatic Mesh Generation For Complex Three-Dimensional Regions Using a Constrained {Delaunay} Triangulation"
+, journal =     "Engineering with Computers (USA)"
+, volume =      5
+, number =      "3--4"
+, year =        1989
+, pages =       "161--175"
+, keywords =    "mesh generation, Delaunay triangulation"
+, update =      "00.11 smid, 00.07 icking, 96.09 devillers"
+, annote =      "Bowyer's algorithm. Constraints by fixing triangles.
+                 Uses octrees for point location in $O(\log n)$. Yet
+                 another proof that Bowyer's works. Uses $a/r$ for tetra
+                 quality."
+, abstract =    "This paper describes a method for generating
+                 tetrahedral meshes. The algorithm, based on the
+                 Delaunay triangulation, can treat objects of
+                 essentially arbitrary complexity. In order to preserve
+                 the surface triangulation of solid objects, it is
+                 necessary to override the Delaunay property and
+                 redefine the triangulation when points are introduced
+                 that are close to solid boundaries. Details of this
+                 constrained Delaunay algorithm are presented and an
+                 efficient implementation of the triangulation method is
+                 described. Techniques for controlling the distribution
+                 of mesh points and tetrahedron quality are also
+                 discussed. (Author abstract) 25 Refs."
 }
 
 @article{b-srvmc-91
-, author =	"Timothy J. Baker"
-, title =	"Shape Reconstruction And Volume Meshing For Complex Solids"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	32
-, number =	4
-, month =	sep
-, year =	1991
-, pages =	"665--675"
-, keywords =	"shape reconstruction, volume meshing"
-, annote =	"An interior point is generated for each section
-		 vertex. This is placed on the line bisecting the corner
-		 $ABC$, at a distance $\min(AB,BC,d/3)$, where $d$ is
-		 the length of the segment from $B$ to where it first
-		 leaves the polygon. Dt of these points is constructed
-		 and the surface is the boundary between tetras
-		 containing only section vertices and the other
-		 tetras."
-, abstract =	"The reconstruction of a solid surface from a series of
-		 cross-sections and the generation of a volume mesh that
-		 conforms with a prescribed surface are issues that
-		 arise in numerous applications. We describe an approach
-		 to both these problems that is based on the generation
-		 of a tetrahedral mesh which automatically captures a
-		 triangulation of the surface points. A simple algorithm
-		 for introducing a set of interior points permits a
-		 simple partition of the volume mesh into two disjoint
-		 sets of tetrahedra such that one set determines the
-		 interior of the solid while the second determines the
-		 exterior. (Author abstract) 10 Refs."
+, author =      "Timothy J. Baker"
+, title =       "Shape Reconstruction And Volume Meshing For Complex Solids"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      32
+, number =      4
+, month =       sep
+, year =        1991
+, pages =       "665--675"
+, keywords =    "shape reconstruction, volume meshing"
+, annote =      "An interior point is generated for each section
+                 vertex. This is placed on the line bisecting the corner
+                 $ABC$, at a distance $\min(AB,BC,d/3)$, where $d$ is
+                 the length of the segment from $B$ to where it first
+                 leaves the polygon. Dt of these points is constructed
+                 and the surface is the boundary between tetras
+                 containing only section vertices and the other
+                 tetras."
+, abstract =    "The reconstruction of a solid surface from a series of
+                 cross-sections and the generation of a volume mesh that
+                 conforms with a prescribed surface are issues that
+                 arise in numerous applications. We describe an approach
+                 to both these problems that is based on the generation
+                 of a tetrahedral mesh which automatically captures a
+                 triangulation of the surface points. A simple algorithm
+                 for introducing a set of interior points permits a
+                 simple partition of the volume mesh into two disjoint
+                 sets of tetrahedra such that one set determines the
+                 interior of the solid while the second determines the
+                 exterior. (Author abstract) 10 Refs."
 }
 
 @article{blt-lir-91
-, author =	"E. Bakker and J. van Leeuwen and R. Tan"
-, title =	"Linear interval routing"
-, journal =	"Algorithms Rev."
-, volume =	2
-, number =	2
-, year =	1991
-, pages =	"45--61"
+, author =      "E. Bakker and J. van Leeuwen and R. Tan"
+, title =       "Linear interval routing"
+, journal =     "Algorithms Rev."
+, volume =      2
+, number =      2
+, year =        1991
+, pages =       "45--61"
 }
 
 @inproceedings{b-oafsi-95
-, author =	"Ivan J. Balaban"
-, title =	"An Optimal Algorithm for Finding Segment Intersections"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"211--219"
-, keywords =	""
-, cites =	"b-lbact-83, bo-arcgi-79, c-fsnaq-86, c-rcsi-86, ce-oails-92, cs-arscg-89, egs-oplms-86, l-dsorq-78, m-fppa1-88, ps-cgi-85, w-pr-82, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Ivan J. Balaban"
+, title =       "An Optimal Algorithm for Finding Segment Intersections"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "211--219"
+, keywords =    ""
+, cites =       "b-lbact-83, bo-arcgi-79, c-fsnaq-86, c-rcsi-86, ce-oails-92, cs-arscg-89, egs-oplms-86, l-dsorq-78, m-fppa1-88, ps-cgi-85, w-pr-82, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{bf-mp-93
-, author =	"E. Balas and M. Fischetti"
-, title =	"On the Monotonization of Polyhedra"
-, booktitle =	"Proc. 3rd IPCO Conference Integer Programming and Combinatorial Optimization"
-, site =	"Erice, Italy"
-, year =	1993
-, pages =	"??"
-, update =	"98.07 bibrelex, 93.09 milone+mitchell"
+, author =      "E. Balas and M. Fischetti"
+, title =       "On the Monotonization of Polyhedra"
+, booktitle =   "Proc. 3rd IPCO Conference Integer Programming and Combinatorial Optimization"
+, site =        "Erice, Italy"
+, year =        1993
+, pages =       "??"
+, update =      "98.07 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{bp-pmspb-83
-, author =	"E. Balas and W. Pulleyblank"
-, title =	"The perfectly matchable subgraph polytope of a bipartite graph"
-, journal =	"Networks"
-, volume =	13
-, year =	1983
-, pages =	"495--516"
+, author =      "E. Balas and W. Pulleyblank"
+, title =       "The perfectly matchable subgraph polytope of a bipartite graph"
+, journal =     "Networks"
+, volume =      13
+, year =        1983
+, pages =       "495--516"
 }
 
 @phdthesis{b-gmhsr-01
-, author =	"Sophie Balaven"
-, title =	"G\'en\'eration de maillages hybrides pour la simulation de r\'eservoirs p\'etroliers"
-, type =	"Th\`{e}se de doctorat en sciences"
-, school =	"Ecole des Mines, Paris"
-, address =	"France"
-, year =	2001
-, keywords =	"doctoral thesis"
-, update =	"02.03 devillers"
+, author =      "Sophie Balaven"
+, title =       "G\'en\'eration de maillages hybrides pour la simulation de r\'eservoirs p\'etroliers"
+, type =        "Th\`{e}se de doctorat en sciences"
+, school =      "Ecole des Mines, Paris"
+, address =     "France"
+, year =        2001
+, keywords =    "doctoral thesis"
+, update =      "02.03 devillers"
 }
 
 @incollection{bmb-pmmca-94
-, author =	"L. Balbes and S. Mascarella and D. Boyd"
-, title =	"A perspective of modern methods in computer-aided drug design"
-, editor =	"K. Lipkowitz and D. B. Boyd"
-, booktitle =	"Reviews in Computational Chemistry"
-, volume =	5
-, publisher =	"VCH Publishers"
-, year =	1994
-, pages =	"337--370"
-, update =	"98.07 bibrelex"
+, author =      "L. Balbes and S. Mascarella and D. Boyd"
+, title =       "A perspective of modern methods in computer-aided drug design"
+, editor =      "K. Lipkowitz and D. B. Boyd"
+, booktitle =   "Reviews in Computational Chemistry"
+, volume =      5
+, publisher =   "VCH Publishers"
+, year =        1994
+, pages =       "337--370"
+, update =      "98.07 bibrelex"
 }
 
 @article{bs-rmcso-91
-, author =	"R. Balbes and J. Siegel"
-, title =	"A Robust Method for Calculating the Simplicity and Orientation of Planar Polygons"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	8
-, number =	4
-, month =	oct
-, year =	1991
-, pages =	"327--335"
-, keywords =	"polygons"
-, update =	"95.05 held+korneenko"
+, author =      "R. Balbes and J. Siegel"
+, title =       "A Robust Method for Calculating the Simplicity and Orientation of Planar Polygons"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      8
+, number =      4
+, month =       oct
+, year =        1991
+, pages =       "327--335"
+, keywords =    "polygons"
+, update =      "95.05 held+korneenko"
 }
 
 @article{blt-capsi-92
-, author =	"J. Balc{\'a}zar and A. Lozano and J. Tor{\'a}n"
-, title =	"The complexity of algorithmic problems on succinct instances"
-, journal =	"Algorithms Rev."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"113--137"
+, author =      "J. Balc{\'a}zar and A. Lozano and J. Tor{\'a}n"
+, title =       "The complexity of algorithmic problems on succinct instances"
+, journal =     "Algorithms Rev."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "113--137"
 }
 
 @mastersthesis{b-amstg-90
-, author =	"D. F. Baldwin"
-, title =	"Algorithmic methods and software tools for the generation of mechanical assembly sequences"
-, type =	"M.{Sc}. Thesis"
-, school =	"Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1990
-, keywords =	"master thesis"
+, author =      "D. F. Baldwin"
+, title =       "Algorithmic methods and software tools for the generation of mechanical assembly sequences"
+, type =        "M.{Sc}. Thesis"
+, school =      "Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1990
+, keywords =    "master thesis"
 }
 
 @article{b-afavc-61
-, author =	"M. L. Balinsky"
-, title =	"An algorithm for finding all vertices of convex polyhedral sets"
-, journal =	"SIAM J. Appl. Math."
-, volume =	9
-, year =	1961
-, pages =	"72--88"
+, author =      "M. L. Balinsky"
+, title =       "An algorithm for finding all vertices of convex polyhedral sets"
+, journal =     "SIAM J. Appl. Math."
+, volume =      9
+, year =        1961
+, pages =       "72--88"
 }
 
 @article{b-ghtda-81
-, author =	"D. H. Ballard"
-, title =	"Generalizing the {Hough} transform to detect arbitrary shapes"
-, journal =	"Pattern Recogn."
-, volume =	13
-, year =	1981
-, pages =	"111--112"
-, update =	"96.09 orourke"
+, author =      "D. H. Ballard"
+, title =       "Generalizing the {Hough} transform to detect arbitrary shapes"
+, journal =     "Pattern Recogn."
+, volume =      13
+, year =        1981
+, pages =       "111--112"
+, update =      "96.09 orourke"
 }
 
 @article{b-sthrc-81
-, author =	"D. H. Ballard"
-, title =	"Strip trees: {A} hierarchical representation for curves"
-, journal =	"Commun. ACM"
-, volume =	24
-, number =	5
-, year =	1981
-, pages =	"310--321"
-, update =	"97.07 agarwal"
+, author =      "D. H. Ballard"
+, title =       "Strip trees: {A} hierarchical representation for curves"
+, journal =     "Commun. ACM"
+, volume =      24
+, number =      5
+, year =        1981
+, pages =       "310--321"
+, update =      "97.07 agarwal"
 }
 
 @book{bb-cv-82
-, author =	"D. H. Ballard and C. M. Brown"
-, title =	"Computer Vision"
-, publisher =	"Prentice Hall"
-, year =	1982
-, update =	"98.07 bibrelex"
+, author =      "D. H. Ballard and C. M. Brown"
+, title =       "Computer Vision"
+, publisher =   "Prentice Hall"
+, year =        1982
+, update =      "98.07 bibrelex"
 }
 
 @techreport{b-mpbsp-93
-, author =	"C. Ballieux"
-, title =	"Motion planning using binary space partitions"
-, number =	"Inf/src/93-25"
-, institution =	"Utrecht University"
-, year =	1993
-, update =	"98.07 bibrelex, 97.03 schwarzkopf"
+, author =      "C. Ballieux"
+, title =       "Motion planning using binary space partitions"
+, number =      "Inf/src/93-25"
+, institution = "Utrecht University"
+, year =        1993
+, update =      "98.07 bibrelex, 97.03 schwarzkopf"
 }
 
 @inproceedings{bb-chipd-91
-, author =	"A. Balog and I. B{\'a}r{\'a}ny"
-, title =	"On the convex hull of the integer points in a disc"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"162--165"
-, keywords =	"convex hull, grid"
-, cites =	"a-lbvsc-63, a-sicp-80, bhl-ipplb-92, c-lpc-63, chkm-ipp-92, c-vdabt-22, f-eidg-82, h-eslp-90, j-ugukk-25, ks-envci-84, s-racs-88, s-ipcs-85, s-nlpcc-74, v-nips-63, w-gimk-57, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "A. Balog and I. B{\'a}r{\'a}ny"
+, title =       "On the convex hull of the integer points in a disc"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "162--165"
+, keywords =    "convex hull, grid"
+, cites =       "a-lbvsc-63, a-sicp-80, bhl-ipplb-92, c-lpc-63, chkm-ipp-92, c-vdabt-22, f-eidg-82, h-eslp-90, j-ugukk-25, ks-envci-84, s-racs-88, s-ipcs-85, s-nlpcc-74, v-nips-63, w-gimk-57, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{bs-spbtc-88
-, author =	"A. Baltsan and Micha Sharir"
-, title =	"On the shortest paths between two convex polyhedra"
-, journal =	"J. ACM"
-, volume =	35
-, year =	1988
-, pages =	"267--287"
-, keywords =	"shortest paths, polyhedra, convex, $3$-dimensional"
-, succeeds =	"sb-spbtc-85"
-, update =	"98.03 mitchell"
+, author =      "A. Baltsan and Micha Sharir"
+, title =       "On the shortest paths between two convex polyhedra"
+, journal =     "J. ACM"
+, volume =      35
+, year =        1988
+, pages =       "267--287"
+, keywords =    "shortest paths, polyhedra, convex, $3$-dimensional"
+, succeeds =    "sb-spbtc-85"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{b-pichc-99
-, author =	"Helymar Balza-Gomez"
-, title =	"The Periodicity of Integral Convex Hulls for Conics in {$E^2$}"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"47--49"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Helymar Balza-Gomez"
+, title =       "The Periodicity of Integral Convex Hulls for Conics in {$E^2$}"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "47--49"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{b-cpcep-67
-, author =	"T. F. Banchoff"
-, title =	"Critical points and curvature for embedded polyhedra"
-, journal =	"J. Diff. Geom."
-, volume =	1
-, year =	1967
-, pages =	"245--256"
-, update =	"98.07 bibrelex"
+, author =      "T. F. Banchoff"
+, title =       "Critical points and curvature for embedded polyhedra"
+, journal =     "J. Diff. Geom."
+, volume =      1
+, year =        1967
+, pages =       "245--256"
+, update =      "98.07 bibrelex"
 }
 
 @article{bt-hftcp-75
-, author =	"T. F. Banchoff and F. Takens"
-, title =	"Height functions with three critical points"
-, journal =	"Illinois J. Math."
-, volume =	76
-, year =	1975
-, pages =	"326--335"
-, update =	"98.07 bibrelex"
+, author =      "T. F. Banchoff and F. Takens"
+, title =       "Height functions with three critical points"
+, journal =     "Illinois J. Math."
+, volume =      76
+, year =        1975
+, pages =       "326--335"
+, update =      "98.07 bibrelex"
 }
 
 @article{b-gmsa-74
-, author =	"F. Bancilhon"
-, title =	"A geometric model for stochastic automata"
-, journal =	"IEEE Trans. Comput."
-, volume =	23
-, number =	12
-, year =	1974
-, pages =	"1290--1299"
-, update =	"93.09 milone+mitchell"
+, author =      "F. Bancilhon"
+, title =       "A geometric model for stochastic automata"
+, journal =     "IEEE Trans. Comput."
+, volume =      23
+, number =      12
+, year =        1974
+, pages =       "1290--1299"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{bmr-pcnds-91
-, author =	"Saibal Banerjee and David Mount and Azriel Rosenfeld"
-, title =	"Pyramid Computation Of Neighbor Distance Statistics In Dot Patterns"
-, journal =	"CVGIP: Graph. Models Image Process."
-, volume =	53
-, number =	4
-, month =	jul
-, year =	1991
-, pages =	"373--381"
-, keywords =	"Voronoi neighbors"
-, abstract =	"This paper describes an algorithm for computing
-		 statistics of Voronoi neighbor distances in a dot
-		 pattern, using a cellular pyramid computer, in a
-		 logarithmic number of computational steps. Given a set
-		 of dots in a square region of the digital plane, the
-		 algorithm determines with high probability the Voronoi
-		 neighbors of the dots in the interior of the region and
-		 then computes statistics of the neighbor distances. An
-		 algorithm of this type may account for the ability of
-		 humans to perceive at a glance whether the dots in a
-		 pattern are randomly or regularly spaced, i.e., their
-		 neighbor distances have high or low variance. (Author
-		 abstract)"
+, author =      "Saibal Banerjee and David Mount and Azriel Rosenfeld"
+, title =       "Pyramid Computation Of Neighbor Distance Statistics In Dot Patterns"
+, journal =     "CVGIP: Graph. Models Image Process."
+, volume =      53
+, number =      4
+, month =       jul
+, year =        1991
+, pages =       "373--381"
+, keywords =    "Voronoi neighbors"
+, abstract =    "This paper describes an algorithm for computing
+                 statistics of Voronoi neighbor distances in a dot
+                 pattern, using a cellular pyramid computer, in a
+                 logarithmic number of computational steps. Given a set
+                 of dots in a square region of the digital plane, the
+                 algorithm determines with high probability the Voronoi
+                 neighbors of the dots in the interior of the region and
+                 then computes statistics of the neighbor distances. An
+                 algorithm of this type may account for the ability of
+                 humans to perceive at a glance whether the dots in a
+                 pattern are randomly or regularly spaced, i.e., their
+                 neighbor distances have high or low variance. (Author
+                 abstract)"
 }
 
 @manual{b-pug-90
-, author =	"R. E. Bank"
-, title =	"{PLTMG} User's Guide"
-, organization =	"SIAM"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "R. E. Bank"
+, title =       "{PLTMG} User's Guide"
+, organization =        "SIAM"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @article{br-qslg-89
-, author =	"P. G. Bao and J. G. Rokne"
-, title =	"Quadruple-step line generation"
-, journal =	"Computers and Graphics"
-, volume =	13
-, year =	1989
-, pages =	"461--469"
-, keywords =	"digital geometry, computer graphics, design of algorithms, approximation, incrementation, lines, two-dimensional, average-case analysis"
+, author =      "P. G. Bao and J. G. Rokne"
+, title =       "Quadruple-step line generation"
+, journal =     "Computers and Graphics"
+, volume =      13
+, year =        1989
+, pages =       "461--469"
+, keywords =    "digital geometry, computer graphics, design of algorithms, approximation, incrementation, lines, two-dimensional, average-case analysis"
 }
 
 @inproceedings{bbfy-olnr-92
-, author =	"E. Bar-Eli and P. Berman and A. Fiat and P. Yan"
-, title =	"On-line Navigation in a Room"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"237--249"
+, author =      "E. Bar-Eli and P. Berman and A. Fiat and P. Yan"
+, title =       "On-line Navigation in a Room"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "237--249"
 }
 
 @article{bbfy-olnr-94
-, author =	"E. Bar-Eli and P. Berman and A. Fiat and P. Yan"
-, title =	"Online Navigation in a Room"
-, journal =	"J. Algorithms"
-, volume =	17
-, year =	1994
-, pages =	"319--341"
-, update =	"95.01 smid"
+, author =      "E. Bar-Eli and P. Berman and A. Fiat and P. Yan"
+, title =       "Online Navigation in a Room"
+, journal =     "J. Algorithms"
+, volume =      17
+, year =        1994
+, pages =       "319--341"
+, update =      "95.01 smid"
 }
 
 @incollection{b-lotdp-90
-, author =	"G. Bar"
-, title =	"On the level-oriented two-dimensional packing with rotation of rectangles"
-, editor =	"R. Bodendiek and R. Henn"
-, booktitle =	"??"
-, publisher =	"Physica-Verlag"
-, address =	"Geidelberg"
-, year =	1990
-, pages =	"73--78"
-, keywords =	"packing, isothetic"
-, update =	"98.07 bibrelex, 95.05 korneenko"
+, author =      "G. Bar"
+, title =       "On the level-oriented two-dimensional packing with rotation of rectangles"
+, editor =      "R. Bodendiek and R. Henn"
+, booktitle =   "??"
+, publisher =   "Physica-Verlag"
+, address =     "Geidelberg"
+, year =        1990
+, pages =       "73--78"
+, keywords =    "packing, isothetic"
+, update =      "98.07 bibrelex, 95.05 korneenko"
 }
 
 @inproceedings{bi-rppt-93
-, author =	"G. B{\"a}r and C. Iturriaga"
-, title =	"Rectangle packing in polynomial time"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"455--460"
-, cites =	"cgjt-pblot-80, o-efo-83, wkc-fpgl-88, h-prf-88, dcl-cfdfb-89, wkc-oarbb-89, vt-ftcr-90, gj-cigtn-79, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "G. B{\"a}r and C. Iturriaga"
+, title =       "Rectangle packing in polynomial time"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "455--460"
+, cites =       "cgjt-pblot-80, o-efo-83, wkc-fpgl-88, h-prf-88, dcl-cfdfb-89, wkc-oarbb-89, vt-ftcr-90, gj-cigtn-79, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{bkp-hanc-93
-, author =	"J. Bar-Ilan and G. Kortsarz and D. Peleg"
-, title =	"How to allocate network centers"
-, journal =	"J. Algorithms"
-, volume =	15
-, number =	3
-, year =	1993
-, pages =	"385--415"
-, update =	"97.03 agarwal"
+, author =      "J. Bar-Ilan and G. Kortsarz and D. Peleg"
+, title =       "How to allocate network centers"
+, journal =     "J. Algorithms"
+, volume =      15
+, number =      3
+, year =        1993
+, pages =       "385--415"
+, update =      "97.03 agarwal"
 }
 
 @article{bb-ltacs-96
-, author =	"R. Bar-YeHuda and E. Ben-Hanoch"
-, title =	"A linear time algorithm for covering simple polygons with similar rectangles"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"79--102"
-, update =	"96.09 devillers"
+, author =      "R. Bar-YeHuda and E. Ben-Hanoch"
+, title =       "A linear time algorithm for covering simple polygons with similar rectangles"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "79--102"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{bb-otacs-90
-, author =	"R. Bar-YeHuda and E. Ben-Hanoch"
-, title =	"An ${O}(n \log^{*}n)$ time algorithm for covering simple polygons with squares"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"186--190"
-, keywords =	"polygons, covering"
-, cites =	"a-acps-88, acko-cops-88, ao-crs-81, be-lrtaw-85, c-ept-90, g-amcmc-72, hs-oiuqt-79, m-fmcbi-91, nt-vpspa-75, rk-dpp-82, si-ttids-86, sl-qcia-87, wbr-cgpma-86, ZZZ"
-, update =	"98.07 bibrelex, 96.09 devillers, 95.05 korneenko"
+, author =      "R. Bar-YeHuda and E. Ben-Hanoch"
+, title =       "An ${O}(n \log^{*}n)$ time algorithm for covering simple polygons with squares"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "186--190"
+, keywords =    "polygons, covering"
+, cites =       "a-acps-88, acko-cops-88, ao-crs-81, be-lrtaw-85, c-ept-90, g-amcmc-72, hs-oiuqt-79, m-fmcbi-91, nt-vpspa-75, rk-dpp-82, si-ttids-86, sl-qcia-87, wbr-cgpma-86, ZZZ"
+, update =      "98.07 bibrelex, 96.09 devillers, 95.05 korneenko"
 }
 
 @article{bc-tdjc-94
-, author =	"R. Bar-Yehuda and Bernard Chazelle"
-, title =	"Triangulating disjoint {Jordan} chains"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, number =	4
-, year =	1994
-, pages =	"475--481"
-, keywords =	"triangulation, polygons with holes, merging holes"
-, succeeds =	"cb-tsnis-92"
-, update =	"98.03 mitchell, 95.09 mitchell"
+, author =      "R. Bar-Yehuda and Bernard Chazelle"
+, title =       "Triangulating disjoint {Jordan} chains"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, number =      4
+, year =        1994
+, pages =       "475--481"
+, keywords =    "triangulation, polygons with holes, merging holes"
+, succeeds =    "cb-tsnis-92"
+, update =      "98.03 mitchell, 95.09 mitchell"
 }
 
 @inproceedings{bei-samcp-93
-, author =	"R. Bar-Yehuda and A. Efrat and A. Itai"
-, title =	"A simple algorithm for maintaining the center of a planar point-set"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"252--257"
-, succeeds =	"e-samcp-93"
-, cites =	"as-pglpm-91, bs-dsp1s-80, e-dtdlp-91, ks-tpscv-93, msw-sblp-92, m-ltalp-82, m-apcad-83, m-ss-84, ol-ddspy-81, ps-cgi-85, st-pplup-86, s-sacse-91, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "R. Bar-Yehuda and A. Efrat and A. Itai"
+, title =       "A simple algorithm for maintaining the center of a planar point-set"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "252--257"
+, succeeds =    "e-samcp-93"
+, cites =       "as-pglpm-91, bs-dsp1s-80, e-dtdlp-91, ks-tpscv-93, msw-sblp-92, m-ltalp-82, m-apcad-83, m-ss-84, ol-ddspy-81, ps-cgi-85, st-pplup-86, s-sacse-91, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{be-lrtaw-85
-, author =	"R. Bar-Yehuda and S. Even"
-, title =	"A local ratio theorem for approximating the weighted vertex cover problem"
-, journal =	"Ann. Discrete Math."
-, volume =	25
-, year =	1985
-, pages =	"27--46"
-, update =	"98.07 bibrelex"
+, author =      "R. Bar-Yehuda and S. Even"
+, title =       "A local ratio theorem for approximating the weighted vertex cover problem"
+, journal =     "Ann. Discrete Math."
+, volume =      25
+, year =        1985
+, pages =       "27--46"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{be-avcpg-82
-, author =	"R. Bar-Yehuda and S. Even"
-, title =	"On Approximating a Vertex Cover for Planar Graphs"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Theory Comput."
-, month =	may
-, year =	1982
-, pages =	"303--309"
-, update =	"98.07 bibrelex"
+, author =      "R. Bar-Yehuda and S. Even"
+, title =       "On Approximating a Vertex Cover for Planar Graphs"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Theory Comput."
+, month =       may
+, year =        1982
+, pages =       "303--309"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bfk-esrrt-??
-, author =	"R. Bar-Yehuda and J. A. Feldman and R. Kay"
-, title =	"Efficient 2-{SAT} related routing technique"
-, type =	"Report"
-, number =	830
-, institution =	"Dept. Comput. Sci., Technion ITT"
-, address =	"Haifa, Israel"
-, year =	"??"
-, keywords =	"wire routing, link distance"
-, comments =	"Given in Eilat Workshop, March 1995; submitted to Algorithmica"
-, update =	"95.09 mitchell"
+, author =      "R. Bar-Yehuda and J. A. Feldman and R. Kay"
+, title =       "Efficient 2-{SAT} related routing technique"
+, type =        "Report"
+, number =      830
+, institution = "Dept. Comput. Sci., Technion ITT"
+, address =     "Haifa, Israel"
+, year =        "??"
+, keywords =    "wire routing, link distance"
+, comments =    "Given in Eilat Workshop, March 1995; submitted to Algorithmica"
+, update =      "95.09 mitchell"
 }
 
 @unpublished{bf-bcnag-90
-, author =	"R. Bar-Yehuda and S. Fogel"
-, title =	"Better constructions and new applications of good splitters"
-, year =	1990
-, note =	"In preparation"
-, update =	"98.07 bibrelex"
+, author =      "R. Bar-Yehuda and S. Fogel"
+, title =       "Better constructions and new applications of good splitters"
+, year =        1990
+, note =        "In preparation"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bf-gsars-90
-, author =	"R. Bar-Yehuda and S. Fogel"
-, title =	"Good splitters with applications to ray shooting"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"81--84"
-, keywords =	"ray tracing, arrangements"
-, cites =	"a-dapal-89, a-rsoas-89, bf-bcnag-90, c-prsig-87, cg-vippg-89, cw-qorss-89, e-acg-87, eghsssw-irals-89, ew-hrsls-86, hw-ensrq-87, mw-gscpt-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "R. Bar-Yehuda and S. Fogel"
+, title =       "Good splitters with applications to ray shooting"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "81--84"
+, keywords =    "ray tracing, arrangements"
+, cites =       "a-dapal-89, a-rsoas-89, bf-bcnag-90, c-prsig-87, cg-vippg-89, cw-qorss-89, e-acg-87, eghsssw-irals-89, ew-hrsls-86, hw-ensrq-87, mw-gscpt-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bf-mskis-89
-, author =	"R. Bar-Yehuda and S. Fogel"
-, title =	"Maximal Sets of $k$-Increasing Subsequences with Applications to Counting Points in Triangles"
-, type =	"Technical {Report}"
-, institution =	"Technion IIT"
-, address =	"Haifa, Israel"
-, year =	1989
-, update =	"95.01 smid, 93.09 milone+mitchell"
+, author =      "R. Bar-Yehuda and S. Fogel"
+, title =       "Maximal Sets of $k$-Increasing Subsequences with Applications to Counting Points in Triangles"
+, type =        "Technical {Report}"
+, institution = "Technion IIT"
+, address =     "Haifa, Israel"
+, year =        1989
+, update =      "95.01 smid, 93.09 milone+mitchell"
 }
 
 @techreport{bf-psfms-90
-, author =	"R. Bar-Yehuda and S. Fogel"
-, title =	"Partitioning a sequence into few monotone subsequences"
-, type =	"Technical {Report}"
-, number =	640
-, institution =	"Technion IIT"
-, address =	"Haifa, Israel"
-, year =	1990
-, update =	"95.01 smid"
+, author =      "R. Bar-Yehuda and S. Fogel"
+, title =       "Partitioning a sequence into few monotone subsequences"
+, type =        "Technical {Report}"
+, number =      640
+, institution = "Technion IIT"
+, address =     "Haifa, Israel"
+, year =        1990
+, update =      "95.01 smid"
 }
 
 @techreport{bf-vrs-90
-, author =	"R. Bar-Yehuda and S. Fogel"
-, title =	"Variations on Ray Shooting"
-, type =	"Technical {Report}"
-, number =	639
-, institution =	"Technion IIT"
-, address =	"Haifa, Israel"
-, year =	1990
-, keywords =	"sheaf, ES-trees"
-, update =	"95.01 smid, 93.09 milone+mitchell"
+, author =      "R. Bar-Yehuda and S. Fogel"
+, title =       "Variations on Ray Shooting"
+, type =        "Technical {Report}"
+, number =      639
+, institution = "Technion IIT"
+, address =     "Haifa, Israel"
+, year =        1990
+, keywords =    "sheaf, ES-trees"
+, update =      "95.01 smid, 93.09 milone+mitchell"
 }
 
 @article{bf-vrs-94
-, author =	"R. Bar-Yehuda and S. Fogel"
-, title =	"Variations on Ray Shooting"
-, journal =	"Algorithmica"
-, volume =	11
-, year =	1994
-, pages =	"133--145"
-, succeeds =	"bf-vrs-90"
-, update =	"95.01 smid, 94.05 matousek"
+, author =      "R. Bar-Yehuda and S. Fogel"
+, title =       "Variations on Ray Shooting"
+, journal =     "Algorithmica"
+, volume =      11
+, year =        1994
+, pages =       "133--145"
+, succeeds =    "bf-vrs-90"
+, update =      "95.01 smid, 94.05 matousek"
 }
 
 @techreport{bg-tstpm-95
-, author =	"R. Bar-Yehuda and C. Gotsman"
-, title =	"Time/{Space} tradeoffs for polygon mesh rendering"
-, type =	"CIS Report"
-, number =	9515
-, institution =	"Dept. Comput. Sci., Technion ITT"
-, address =	"Haifa, Israel"
-, year =	1995
-, keywords =	"Hamiltonian triangulation, planar separator theorem, mesh generation"
-, precedes =	"bg-tstpm-96"
-, update =	"96.05 mitchell"
+, author =      "R. Bar-Yehuda and C. Gotsman"
+, title =       "Time/{Space} tradeoffs for polygon mesh rendering"
+, type =        "CIS Report"
+, number =      9515
+, institution = "Dept. Comput. Sci., Technion ITT"
+, address =     "Haifa, Israel"
+, year =        1995
+, keywords =    "Hamiltonian triangulation, planar separator theorem, mesh generation"
+, precedes =    "bg-tstpm-96"
+, update =      "96.05 mitchell"
 }
 
 @article{bg-tstpm-96
-, author =	"R. Bar-Yehuda and C. Gotsman"
-, title =	"Time/{Space} tradeoffs for polygon mesh rendering"
-, journal =	"ACM Trans. Graph."
-, volume =	15
-, number =	2
-, year =	1996
-, pages =	"141--152"
-, keywords =	"Hamiltonian triangulation, planar separator theorem, mesh generation"
-, succeeds =	"bg-tstpm-95"
-, update =	"96.05 mitchell"
+, author =      "R. Bar-Yehuda and C. Gotsman"
+, title =       "Time/{Space} tradeoffs for polygon mesh rendering"
+, journal =     "ACM Trans. Graph."
+, volume =      15
+, number =      2
+, year =        1996
+, pages =       "141--152"
+, keywords =    "Hamiltonian triangulation, planar separator theorem, mesh generation"
+, succeeds =    "bg-tstpm-95"
+, update =      "96.05 mitchell"
 }
 
 @techreport{bg-otamh-90
-, author =	"R. Bar-Yehuda and R. Grinwald"
-, title =	"An {$O(n+h^{1+\epsilon})$}-time algorithm to merge $h$ simple polygons"
-, institution =	"Technion IIT"
-, address =	"Haifa, Israel"
-, year =	1990
-, update =	"95.01 smid, 94.09 jones, 93.09 milone+mitchell"
+, author =      "R. Bar-Yehuda and R. Grinwald"
+, title =       "An {$O(n+h^{1+\epsilon})$}-time algorithm to merge $h$ simple polygons"
+, institution = "Technion IIT"
+, address =     "Haifa, Israel"
+, year =        1990
+, update =      "95.01 smid, 94.09 jones, 93.09 milone+mitchell"
 }
 
 @inproceedings{bg-tph-90
-, author =	"R. Bar-Yehuda and R. Grinwald"
-, title =	"Triangulating polygons with holes"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"112--115"
-, cites =	"c-ept-90, ci-tsc-84, ctv-flvat-88i, fm-tspep-84, gjpt-tsp-78, k-osps-83, tv-otats-88, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "R. Bar-Yehuda and R. Grinwald"
+, title =       "Triangulating polygons with holes"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "112--115"
+, cites =       "c-ept-90, ci-tsc-84, ctv-flvat-88i, fm-tspep-84, gjpt-tsp-78, k-osps-83, tv-otats-88, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{b-j-79
-, author =	"J. Baracs"
-, title =	"Juxtapositions"
-, journal =	"Structural Topology"
-, volume =	1
-, year =	1979
-, pages =	"59--72"
-, update =	"97.11 bibrelex"
+, author =      "J. Baracs"
+, title =       "Juxtapositions"
+, journal =     "Structural Topology"
+, volume =      1
+, year =        1979
+, pages =       "59--72"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-amdsn-89
-, author =	"D. Baraff"
-, title =	"Analytical methods for dynamic simulation of non-penetrating rigid bodies"
-, journal =	"Comput. Graph"
-, volume =	23
-, number =	3
-, year =	1989
-, pages =	"223--232"
-, note =	"Proc. SIGGRAPH '89"
-, update =	"98.03 bibrelex"
+, author =      "D. Baraff"
+, title =       "Analytical methods for dynamic simulation of non-penetrating rigid bodies"
+, journal =     "Comput. Graph"
+, volume =      23
+, number =      3
+, year =        1989
+, pages =       "223--232"
+, note =        "Proc. SIGGRAPH '89"
+, update =      "98.03 bibrelex"
 }
 
 @article{b-cscnp-90
-, author =	"D. Baraff"
-, title =	"Curved surfaces and coherence for non-penetrating rigid body simulation"
-, journal =	"Comput. Graph."
-, volume =	24
-, number =	4
-, year =	1990
-, pages =	"19--28"
-, update =	"98.07 bibrelex"
+, author =      "D. Baraff"
+, title =       "Curved surfaces and coherence for non-penetrating rigid body simulation"
+, journal =     "Comput. Graph."
+, volume =      24
+, number =      4
+, year =        1990
+, pages =       "19--28"
+, update =      "98.07 bibrelex"
 }
 
 @article{b-issrb-95
-, author =	"D. Baraff"
-, title =	"Interactive Simulation of Solid Rigid Bodies"
-, journal =	"CGA"
-, volume =	15
-, number =	3
-, month =	may
-, year =	1995
-, pages =	"63--75"
-, update =	"96.05 mitchell"
+, author =      "D. Baraff"
+, title =       "Interactive Simulation of Solid Rigid Bodies"
+, journal =     "CGA"
+, volume =      15
+, number =      3
+, month =       may
+, year =        1995
+, pages =       "63--75"
+, update =      "96.05 mitchell"
 }
 
 @article{bmk-mffac-97
-, author =	"D. Baraff and R. Matikalli and P. Khosla"
-, title =	"Minimal Fixturing of Frictionless Assemblies: Complexity and Algorithms"
-, journal =	"Algorithmica"
-, volume =	19
-, number =	"1--2"
-, month =	sep
-, year =	1997
-, pages =	"4--39"
-, update =	"97.07 held"
+, author =      "D. Baraff and R. Matikalli and P. Khosla"
+, title =       "Minimal Fixturing of Frictionless Assemblies: Complexity and Algorithms"
+, journal =     "Algorithmica"
+, volume =      19
+, number =      "1--2"
+, month =       sep
+, year =        1997
+, pages =       "4--39"
+, update =      "97.07 held"
 }
 
 @article{br-lbceo-87
-, author =	"R. Barakat and J. Reif"
-, title =	"Lower bounds on the computational efficiency of optical computing systems"
-, journal =	"Appl. Optics"
-, volume =	26
-, number =	6
-, year =	1987
-, pages =	"1015--1018"
-, update =	"97.11 bibrelex"
+, author =      "R. Barakat and J. Reif"
+, title =       "Lower bounds on the computational efficiency of optical computing systems"
+, journal =     "Appl. Optics"
+, volume =      26
+, number =      6
+, year =        1987
+, pages =       "1015--1018"
+, update =      "97.11 bibrelex"
 }
 
 @article{br-pcamm-87
-, author =	"R. Barakat and J. Reif"
-, title =	"Polynomial convolution algorithm for matrix multiplication with application for optical computing"
-, journal =	"Appl. Optics"
-, volume =	26
-, number =	14
-, year =	1987
-, pages =	"2707--2711"
-, update =	"97.11 bibrelex"
+, author =      "R. Barakat and J. Reif"
+, title =       "Polynomial convolution algorithm for matrix multiplication with application for optical computing"
+, journal =     "Appl. Optics"
+, volume =      26
+, number =      14
+, year =        1987
+, pages =       "2707--2711"
+, update =      "97.11 bibrelex"
 }
 
 @article{bv-nclp-92
-, author =	"I. B{\'a}r{\'a}nav and A. M. Vershik"
-, title =	"On the number of convex lattice polytopes"
-, journal =	"Geometric and Functional Analysis"
-, volume =	2
-, year =	1992
-, pages =	"381--393"
-, update =	"97.11 bibrelex"
+, author =      "I. B{\'a}r{\'a}nav and A. M. Vershik"
+, title =       "On the number of convex lattice polytopes"
+, journal =     "Geometric and Functional Analysis"
+, volume =      2
+, year =        1992
+, pages =       "381--393"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-gct-82
-, author =	"I. B{\'a}r{\'a}ny"
-, title =	"A generalization of {Carath{\'e}odory}'s theorem"
-, journal =	"Discrete Math."
-, volume =	40
-, year =	1982
-, pages =	"141--152"
-, update =	"97.11 bibrelex"
+, author =      "I. B{\'a}r{\'a}ny"
+, title =       "A generalization of {Carath{\'e}odory}'s theorem"
+, journal =     "Discrete Math."
+, volume =      40
+, year =        1982
+, pages =       "141--152"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{b-gcabt-93
-, author =	"I. B{\'a}r{\'a}ny"
-, title =	"Geometric and Combinatorial Applications of {Borsuk's} Theorem"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"235--249"
-, keywords =	"survey paper, discrete geometry, Borsuk's theorem, covering, ham-sandwich cuts"
-, update =	"93.09 erickson"
+, author =      "I. B{\'a}r{\'a}ny"
+, title =       "Geometric and Combinatorial Applications of {Borsuk's} Theorem"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "235--249"
+, keywords =    "survey paper, discrete geometry, Borsuk's theorem, covering, ham-sandwich cuts"
+, update =      "93.09 erickson"
 }
 
 @inproceedings{bf-cvid-86
-, author =	"I. B{\'a}r{\'a}ny and Z. F{\"u}redi"
-, title =	"Computing the volume is difficult"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"442--447"
-, precedes =	"bf-cvid-87"
+, author =      "I. B{\'a}r{\'a}ny and Z. F{\"u}redi"
+, title =       "Computing the volume is difficult"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "442--447"
+, precedes =    "bf-cvid-87"
 }
 
 @article{bf-cvid-87
-, author =	"I. B{\'a}r{\'a}ny and Z. F{\"u}redi"
-, title =	"Computing the volume is difficult"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"319--326"
-, keywords =	"approximation, volume, convex"
-, succeeds =	"bf-cvid-86"
+, author =      "I. B{\'a}r{\'a}ny and Z. F{\"u}redi"
+, title =       "Computing the volume is difficult"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "319--326"
+, keywords =    "approximation, volume, convex"
+, succeeds =    "bf-cvid-86"
 }
 
 @techreport{bf-eses-86
-, author =	"I. Barany and Z. Furedi"
-, title =	"Empty simplices in {Euclidean} space"
-, type =	"Technical {Report}"
-, number =	689
-, institution =	"Cornell Univ."
-, address =	"Ithaca, New York"
-, month =	mar
-, year =	1986
-, update =	"93.09 milone+mitchell"
+, author =      "I. Barany and Z. Furedi"
+, title =       "Empty simplices in {Euclidean} space"
+, type =        "Technical {Report}"
+, number =      689
+, institution = "Cornell Univ."
+, address =     "Ithaca, New York"
+, month =       mar
+, year =        1986
+, update =      "93.09 milone+mitchell"
 }
 
 @article{bf-eses-87
-, author =	"I. B{\'a}r{\'a}ny and Z. Furedi"
-, title =	"Empty simplices in {Euclidean} space"
-, journal =	"Canad. Math. Bull."
-, volume =	30
-, year =	1987
-, pages =	"436--445"
-, succeeds =	"bf-eses-86"
-, update =	"02.03 devillers"
+, author =      "I. B{\'a}r{\'a}ny and Z. Furedi"
+, title =       "Empty simplices in {Euclidean} space"
+, journal =     "Canad. Math. Bull."
+, volume =      30
+, year =        1987
+, pages =       "436--445"
+, succeeds =    "bf-eses-86"
+, update =      "02.03 devillers"
 }
 
 @inproceedings{bfl-nhp-89
-, author =	"I. B{\'a}r{\'a}ny and Z. F{\"u}redi and L. Lov{\'a}sz"
-, title =	"On the number of halving planes"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"140--144"
-, cites =	"b-gct-82, bf-eses-86, bf-ntccn-84, e-acg-87, e-epggg-64, elss-dgpps-73, es-sgh-83, fr-hdnj-84, km-etdpp-88, r-ert-68, t-grt-66, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "I. B{\'a}r{\'a}ny and Z. F{\"u}redi and L. Lov{\'a}sz"
+, title =       "On the number of halving planes"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "140--144"
+, cites =       "b-gct-82, bf-eses-86, bf-ntccn-84, e-acg-87, e-epggg-64, elss-dgpps-73, es-sgh-83, fr-hdnj-84, km-etdpp-88, r-ert-68, t-grt-66, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{bfl-nhp-90
-, author =	"I. B{\'a}r{\'a}ny and Z. F{\"u}redi and L. Lov{\'a}sz"
-, title =	"On the number of halving planes"
-, journal =	"Combinatorica"
-, volume =	10
-, year =	1990
-, pages =	"175--183"
-, succeeds =	"bfl-nhp-89"
-, update =	"95.05 agarwal"
+, author =      "I. B{\'a}r{\'a}ny and Z. F{\"u}redi and L. Lov{\'a}sz"
+, title =       "On the number of halving planes"
+, journal =     "Combinatorica"
+, volume =      10
+, year =        1990
+, pages =       "175--183"
+, succeeds =    "bfl-nhp-89"
+, update =      "95.05 agarwal"
 }
 
 @article{bhl-ipplb-92
-, author =	"I. B{\'a}r{\'a}ny and R. Howe and L. Lov{\'a}sz"
-, title =	"On integer points in polyhedra: A lower bound"
-, journal =	"Combinatorica"
-, volume =	12
-, year =	1992
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "I. B{\'a}r{\'a}ny and R. Howe and L. Lov{\'a}sz"
+, title =       "On integer points in polyhedra: A lower bound"
+, journal =     "Combinatorica"
+, volume =      12
+, year =        1992
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{bl-cppe-90
-, author =	"I. B{\'a}r{\'a}ny and D. G. Larman"
-, title =	"A combinatorial property of points and ellipsoids"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"375--382"
+, author =      "I. B{\'a}r{\'a}ny and D. G. Larman"
+, title =       "A combinatorial property of points and ellipsoids"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "375--382"
 }
 
 @article{bl-ceb-87
-, author =	"I. B{\'a}r{\'a}ny and J. Lehel"
-, title =	"Covering with {Euclidean} boxes"
-, journal =	"European J. Combin."
-, volume =	8
-, year =	1987
-, pages =	"113--119"
-, keywords =	"points, covering, isothetic"
-, update =	"96.09 devillers, 95.05 korneenko"
+, author =      "I. B{\'a}r{\'a}ny and J. Lehel"
+, title =       "Covering with {Euclidean} boxes"
+, journal =     "European J. Combin."
+, volume =      8
+, year =        1987
+, pages =       "113--119"
+, keywords =    "points, covering, isothetic"
+, update =      "96.09 devillers, 95.05 korneenko"
 }
 
 @article{bssu-crapb-89
-, author =	"I. B{\'a}r{\'a}ny and J. H. Schmerl and S. J. Sidney and J. Urrutia"
-, title =	"A combinatorial results abouts points and balls in {Euclidean} space"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"259--262"
+, author =      "I. B{\'a}r{\'a}ny and J. H. Schmerl and S. J. Sidney and J. Urrutia"
+, title =       "A combinatorial results abouts points and balls in {Euclidean} space"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "259--262"
 }
 
 @inproceedings{bs-enks-90
-, author =	"I. B{\'a}r{\'a}ny and W. Steiger"
-, title =	"On the expected number of $k$-sets"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"55--59"
-, cites =	"ag-nssfs-86, acegsw-ptphp-90, bfl-nhp-89, cp-hrsaa-86, c-narsc-87, cs-arscg-89, csy-khrp-87, e-acg-87, ew-nlsfs-85, elss-dgpps-73, gp-nkssn-84, l-nhl-71, pss-ubnpk-92, w-mksfs-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "I. B{\'a}r{\'a}ny and W. Steiger"
+, title =       "On the expected number of $k$-sets"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "55--59"
+, cites =       "ag-nssfs-86, acegsw-ptphp-90, bfl-nhp-89, cp-hrsaa-86, c-narsc-87, cs-arscg-89, csy-khrp-87, e-acg-87, ew-nlsfs-85, elss-dgpps-73, gp-nkssn-84, l-nhl-71, pss-ubnpk-92, w-mksfs-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{bs-enks-94
-, author =	"I. B{\'a}r{\'a}ny and W. Steiger"
-, title =	"On the expected number of $k$-sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	11
-, year =	1994
-, pages =	"243--263"
-, update =	"98.07 agarwal+bibrelex"
+, author =      "I. B{\'a}r{\'a}ny and W. Steiger"
+, title =       "On the expected number of $k$-sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      11
+, year =        1994
+, pages =       "243--263"
+, update =      "98.07 agarwal+bibrelex"
 }
 
 @article{bv-pfest-98
-, author =	"I. B{\'a}r{\'a}ny and P. Valtr"
-, title =	"A positive fraction {Erd{\H{o}}s-Szekeres} theorem"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"335--342"
-, update =	"02.03 devillers"
+, author =      "I. B{\'a}r{\'a}ny and P. Valtr"
+, title =       "A positive fraction {Erd{\H{o}}s-Szekeres} theorem"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "335--342"
+, update =      "02.03 devillers"
 }
 
 @article{bh-eshmp-95
-, author =	"M. Barbehenn and S. Hutchinson"
-, title =	"Efficient Search and Hierarchical Motion Planning by Dynamically Maintaining Single-Source Shortest Paths Trees"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	11
-, number =	2
-, month =	apr
-, year =	1995
-, pages =	"198--214"
-, update =	"96.01 held"
+, author =      "M. Barbehenn and S. Hutchinson"
+, title =       "Efficient Search and Hierarchical Motion Planning by Dynamically Maintaining Single-Source Shortest Paths Trees"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      11
+, number =      2
+, month =       apr
+, year =        1995
+, pages =       "198--214"
+, update =      "96.01 held"
 }
 
 @inproceedings{bh-rapp-93
-, author =	"B. Barber and M. Hirsch"
-, title =	"A robust algorithm for point in polyhedron"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"479--484"
-, cites =	"bh-ppida-92, cw-pi-90, gss-egbra-89, h-srsia-89, hhk-tirgc-88, ht-tdscp-89, k-cplp-66, lmr-eppa-84, m-maia-79, m-eat-84, t-smcua-80, f-pcg-93, k-dscpg-82, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "B. Barber and M. Hirsch"
+, title =       "A robust algorithm for point in polyhedron"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "479--484"
+, cites =       "bh-ppida-92, cw-pi-90, gss-egbra-89, h-srsia-89, hhk-tirgc-88, ht-tdscp-89, k-cplp-66, lmr-eppa-84, m-maia-79, m-eat-84, t-smcua-80, f-pcg-93, k-dscpg-82, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @phdthesis{b-cgida-93
-, author =	"C. B. Barber"
-, title =	"Computational geometry with imprecise data and arithmetic"
-, school =	"Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "C. B. Barber"
+, title =       "Computational geometry with imprecise data and arithmetic"
+, school =      "Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{bdh-qach-93
-, author =	"C. B. Barber and D. P. Dobkin and H. Huhdanpaa"
-, title =	"The {Quickhull} algorithm for convex hull"
-, type =	"Technical Report"
-, number =	"GCG53"
-, institution =	"Geometry Center, Univ. of Minnesota"
-, month =	jul
-, year =	1993
-, comments =	"code available from \url{ftp://geom.umn.edu/pub/qhull.tar.Z};
+, author =      "C. B. Barber and D. P. Dobkin and H. Huhdanpaa"
+, title =       "The {Quickhull} algorithm for convex hull"
+, type =        "Technical Report"
+, number =      "GCG53"
+, institution = "Geometry Center, Univ. of Minnesota"
+, month =       jul
+, year =        1993
+, comments =    "code available from \url{ftp://geom.umn.edu/pub/qhull.tar.Z};
 view results in $3$-d or $4$-d with
 \url{ftp://geom.umn.edu/pub/geomview/geomview-sgi.tar.Z}
 or \url{ftp://geom.umn.edu/pub/geomview/geomview-next.tar.Z}"
-, precedes =	"bdh-qach-96"
-, update =	"98.03 icking, 94.01 jones, 93.09 jones"
-, abstract =	"The convex hull of a set of points is the smallest convex
+, precedes =    "bdh-qach-96"
+, update =      "98.03 icking, 94.01 jones, 93.09 jones"
+, abstract =    "The convex hull of a set of points is the smallest convex
 set that contains the points.  This paper presents a convex hull algorithm
 that combines the $2$-d Quickhull algorithm with the general dimension
 Beneath-beyond algorithm.  It is similar to the randomized, incremental
@@ -15399,2193 +15399,2193 @@ @techreport{bdh-qach-93
 }
 
 @article{bdh-qach-96
-, author =	"C. Bradford Barber and David P. Dobkin and Hannu Huhdanpaa"
-, title =	"The {Quickhull} Algorithm for Convex Hulls"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	22
-, number =	4
-, month =	dec
-, year =	1996
-, pages =	"469--483"
-, succeeds =	"bdh-qach-93"
-, update =	"01.04 icking, 98.03 icking"
+, author =      "C. Bradford Barber and David P. Dobkin and Hannu Huhdanpaa"
+, title =       "The {Quickhull} Algorithm for Convex Hulls"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      22
+, number =      4
+, month =       dec
+, year =        1996
+, pages =       "469--483"
+, succeeds =    "bdh-qach-93"
+, update =      "01.04 icking, 98.03 icking"
 }
 
 @techreport{bh-ppida-92
-, author =	"C. B. Barber and M. D. Hirsch"
-, title =	"Point in polyhedron with imprecise data and arithmetic"
-, type =	"Technical Report"
-, number =	"GCG46"
-, institution =	"The Geometry Center"
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "C. B. Barber and M. D. Hirsch"
+, title =       "Point in polyhedron with imprecise data and arithmetic"
+, type =        "Technical Report"
+, number =      "GCG46"
+, institution = "The Geometry Center"
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @article{bjp-laics-92
-, author =	"L. Bardis and R. A. Jinkerson and N. M. Patrikalakis"
-, title =	"Localization for Automated Inspection of Curved Surfaces"
-, journal =	"International Journal of Offshore and Polar Engineering"
-, volume =	1
-, number =	3
-, year =	1992
-, pages =	"228--234"
-, update =	"95.05 abrams"
+, author =      "L. Bardis and R. A. Jinkerson and N. M. Patrikalakis"
+, title =       "Localization for Automated Inspection of Curved Surfaces"
+, journal =     "International Journal of Offshore and Polar Engineering"
+, volume =      1
+, number =      3
+, year =        1992
+, pages =       "228--234"
+, update =      "95.05 abrams"
 }
 
 @article{bp-acrbp-89
-, author =	"L. Bardis and N. M. Patrikalakis"
-, title =	"Approximate Conversion of Rational {B}-Spline Patches"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	6
-, number =	3
-, year =	1989
-, pages =	"189--204"
-, update =	"95.05 abrams"
+, author =      "L. Bardis and N. M. Patrikalakis"
+, title =       "Approximate Conversion of Rational {B}-Spline Patches"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      6
+, number =      3
+, year =        1989
+, pages =       "189--204"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{bp-brbs-89
-, author =	"L. Bardis and N. M. Patrikalakis"
-, title =	"Blending Rational {B}-Spline Surfaces"
-, booktitle =	"Proc. Eurographics '89"
-, year =	1989
-, pages =	"453--462"
-, update =	"95.05 abrams"
+, author =      "L. Bardis and N. M. Patrikalakis"
+, title =       "Blending Rational {B}-Spline Surfaces"
+, booktitle =   "Proc. Eurographics '89"
+, year =        1989
+, pages =       "453--462"
+, update =      "95.05 abrams"
 }
 
 @article{bp-sarb90
-, author =	"L. Bardis and N. M. Patrikalakis"
-, title =	"Surface Approximation with Rational {B}-Splines"
-, journal =	"Engineering with Computers"
-, volume =	6
-, number =	4
-, year =	1990
-, pages =	"223--235"
-, update =	"95.05 abrams"
+, author =      "L. Bardis and N. M. Patrikalakis"
+, title =       "Surface Approximation with Rational {B}-Splines"
+, journal =     "Engineering with Computers"
+, volume =      6
+, number =      4
+, year =        1990
+, pages =       "223--235"
+, update =      "95.05 abrams"
 }
 
 @article{b-csmpi-72
-, author =	"E. H. Bareiss"
-, title =	"Computational solution of matrix problems over an integral domain"
-, journal =	"J. Inst. Maths Applics"
-, volume =	10
-, year =	1972
-, pages =	"68--104"
-, update =	"98.03 bibrelex"
+, author =      "E. H. Bareiss"
+, title =       "Computational solution of matrix problems over an integral domain"
+, journal =     "J. Inst. Maths Applics"
+, volume =      10
+, year =        1972
+, pages =       "68--104"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{b-dapd-97
-, author =	"G. Barequet"
-, title =	"{DCEL}: {A} Polyhedral Database"
-, type =	"Research {Report}, under submission to {\it IJCGA}"
-, institution =	"Center for Geometric Computing"
-, address =	"Johns Hopkins Univ."
-, year =	1997
-, precedes =	"b-dpdpe-98"
-, update =	"98.11 devillers, 97.03 tamassia"
+, author =      "G. Barequet"
+, title =       "{DCEL}: {A} Polyhedral Database"
+, type =        "Research {Report}, under submission to {\it IJCGA}"
+, institution = "Center for Geometric Computing"
+, address =     "Johns Hopkins Univ."
+, year =        1997
+, precedes =    "b-dpdpe-98"
+, update =      "98.11 devillers, 97.03 tamassia"
 }
 
 @article{b-dpdpe-98
-, author =	"G. Barequet"
-, title =	"{DCEL}: A Polyhedral Database and Programming Environment"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"619--636"
-, succeeds =	"b-dapd-97"
-, update =	"98.11 devillers"
+, author =      "G. Barequet"
+, title =       "{DCEL}: A Polyhedral Database and Programming Environment"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "619--636"
+, succeeds =    "b-dapd-97"
+, update =      "98.11 devillers"
 }
 
 @article{b-ughrc-97
-, author =	"G. Barequet"
-, title =	"Using Geometric Hashing to Repair CAD Objects"
-, journal =	"IEEE Comput. Sci. \& Eng."
-, volume =	4
-, number =	4
-, month =	oct
-, year =	1997
-, pages =	"22--28"
-, update =	"98.07 held"
+, author =      "G. Barequet"
+, title =       "Using Geometric Hashing to Repair CAD Objects"
+, journal =     "IEEE Comput. Sci. \& Eng."
+, volume =      4
+, number =      4
+, month =       oct
+, year =        1997
+, pages =       "22--28"
+, update =      "98.07 held"
 }
 
 @inproceedings{bbdgt-ccgg-97
-, author =	"Gill Barequet and Stina S. Bridgeman and Christian A. Duncan and Michael T. Goodrich and Roberto Tamassia"
-, title =	"Classical Computational Geometry in {GeomNet}"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"412--414"
-, keywords =	"internet computing, format conversion, client-server, CGC, Brown"
-, cites =	"abdpy-enmcs-95, bclt-nmaaw-95, bclt-aawww-96, bclt-agaow-96, bclt-maas-96, bkmnsu-egcl-95, em-sstcd-90, fgkss-ckbgc-96, f-nsa2d-95, fm-nsala-91, gy-frcg-86, gm-rad-95, gss-egbra-89, hd-mgvia-00, hhk-tirgc-88, lpt-rpqiv-96, mn-lpcgc-95, m-dpggt-89, almp-gsgv-95, o-dcgal-96, y-gctsp-90, ZZZ"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 bibrelex, 97.07 efrat, 97.03 tamassia"
+, author =      "Gill Barequet and Stina S. Bridgeman and Christian A. Duncan and Michael T. Goodrich and Roberto Tamassia"
+, title =       "Classical Computational Geometry in {GeomNet}"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "412--414"
+, keywords =    "internet computing, format conversion, client-server, CGC, Brown"
+, cites =       "abdpy-enmcs-95, bclt-nmaaw-95, bclt-aawww-96, bclt-agaow-96, bclt-maas-96, bkmnsu-egcl-95, em-sstcd-90, fgkss-ckbgc-96, f-nsa2d-95, fm-nsala-91, gy-frcg-86, gm-rad-95, gss-egbra-89, hd-mgvia-00, hhk-tirgc-88, lpt-rpqiv-96, mn-lpcgc-95, m-dpggt-89, almp-gsgv-95, o-dcgal-96, y-gctsp-90, ZZZ"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 bibrelex, 97.07 efrat, 97.03 tamassia"
 }
 
 @article{bbdgt-ggcoi-99
-, author =	"Gill Barequet and Stina S. Bridgeman and Christian A. Duncan and Michael T. Goodrich and Roberto Tamassia"
-, title =	"{GeomNet:} Geometric Computing Over the Internet"
-, journal =	"IEEE Internet Computing"
-, volume =	3
-, number =	2
-, year =	1999
-, pages =	"21--29"
-, keywords =	"internet computing, format conversion, client-server, CGC, Brown"
-, update =	"01.11 smid, 98.11 tamassia"
+, author =      "Gill Barequet and Stina S. Bridgeman and Christian A. Duncan and Michael T. Goodrich and Roberto Tamassia"
+, title =       "{GeomNet:} Geometric Computing Over the Internet"
+, journal =     "IEEE Internet Computing"
+, volume =      3
+, number =      2
+, year =        1999
+, pages =       "21--29"
+, keywords =    "internet computing, format conversion, client-server, CGC, Brown"
+, update =      "01.11 smid, 98.11 tamassia"
 }
 
 @inproceedings{bbddg-aopdf-97
-, author =	"G. Barequet and A. Briggs and M. Dickerson and C. Dima and M. Goodrich"
-, title =	"Animating the Offset Polygon Distance Function"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"479--480"
-, keywords =	"video review"
-, cites =	"aaag-ntsp-95, aa-ssgpf-96, bbdg-opapp-, bdg-vdpod-, kn-lts-76, obs-stcav-92, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "G. Barequet and A. Briggs and M. Dickerson and C. Dima and M. Goodrich"
+, title =       "Animating the Offset Polygon Distance Function"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "479--480"
+, keywords =    "video review"
+, cites =       "aaag-ntsp-95, aa-ssgpf-96, bbdg-opapp-, bdg-vdpod-, kn-lts-76, obs-stcav-92, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @techreport{bbdg-opapp-
-, author =	"G. Barequet and A. Briggs and M. Dickerson and M. Goodrich"
-, title =	"Offset polygon annulus placement problems"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
-, update =	"98.07 bibrelex"
+, author =      "G. Barequet and A. Briggs and M. Dickerson and M. Goodrich"
+, title =       "Offset polygon annulus placement problems"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
+, update =      "98.07 bibrelex"
 }
 
 @article{bcgmt-bhrs3-96
-, author =	"G. Barequet and B. Chazelle and L. Guibas and J. Mitchell and A. Tal"
-, title =	"{BOXTREE}: {A} Hierarchical Representation for Surfaces in {3D}"
-, journal =	"Comput. Graph. Forum"
-, volume =	15
-, number =	3
-, month =	sep
-, year =	1996
-, pages =	"C387--C396, C484"
-, note =	"Proc.\ Eurographics'96"
-, keywords =	"Boxtree, Collision detection, Computational geometry, Data structures, Hierarchical systems, Octrees, Piecewise linear techniques, Ray shooting, Ray tracing, Surfaces, Three dimensional computer graphics"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "G. Barequet and B. Chazelle and L. Guibas and J. Mitchell and A. Tal"
+, title =       "{BOXTREE}: {A} Hierarchical Representation for Surfaces in {3D}"
+, journal =     "Comput. Graph. Forum"
+, volume =      15
+, number =      3
+, month =       sep
+, year =        1996
+, pages =       "C387--C396, C484"
+, note =        "Proc.\ Eurographics'96"
+, keywords =    "Boxtree, Collision detection, Computational geometry, Data structures, Hierarchical systems, Octrees, Piecewise linear techniques, Ray shooting, Ray tracing, Surfaces, Three dimensional computer graphics"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{bde-ttdp-96
-, author =	"Gill Barequet and Matthew Dickerson and David Eppstein"
-, title =	"On Triangulating Three-Dimensional Polygons"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"38--47"
-, cites =	"a-kb-94, be-mgot-92i, bs-fgbp-95, bs-plibp-96, c-tsplt-91a, e-t-91, eg-tsa-89, f-pc6ck-89, go-copcg-95, k-mtpd-80, rs-dttdn-92, s-tkwsd-90, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Gill Barequet and Matthew Dickerson and David Eppstein"
+, title =       "On Triangulating Three-Dimensional Polygons"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "38--47"
+, cites =       "a-kb-94, be-mgot-92i, bs-fgbp-95, bs-plibp-96, c-tsplt-91a, e-t-91, eg-tsa-89, f-pc6ck-89, go-copcg-95, k-mtpd-80, rs-dttdn-92, s-tkwsd-90, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @article{bde-ttdp-98
-, author =	"G. Barequet and M. Dickerson and D. Eppstein"
-, title =	"On Triangulating Three-dimensional Polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, number =	3
-, year =	1998
-, pages =	"155--170"
-, update =	"98.07 held"
+, author =      "G. Barequet and M. Dickerson and D. Eppstein"
+, title =       "On Triangulating Three-dimensional Polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, number =      3
+, year =        1998
+, pages =       "155--170"
+, update =      "98.07 held"
 }
 
 @techreport{bdg-vdpod-
-, author =	"G. Barequet and M. Dickerson and M. Goodrich"
-, title =	"Voronoi diagrams for polygon-offset distance functions"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
-, update =	"98.07 bibrelex"
+, author =      "G. Barequet and M. Dickerson and M. Goodrich"
+, title =       "Voronoi diagrams for polygon-offset distance functions"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bdp-tcpcm-95
-, author =	"Gill Barequet and Matthew Dickerson and Petru Pau"
-, title =	"Translating a Convex Polygon to Contain a Maximum Number of Points"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"61--66"
-, precedes =	"bdp-tcpcm-97"
-, update =	"98.03 mitchell, 95.09 jones"
+, author =      "Gill Barequet and Matthew Dickerson and Petru Pau"
+, title =       "Translating a Convex Polygon to Contain a Maximum Number of Points"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "61--66"
+, precedes =    "bdp-tcpcm-97"
+, update =      "98.03 mitchell, 95.09 jones"
 }
 
 @article{bdp-tcpcm-97
-, author =	"Gill Barequet and Matthew Dickerson and Petru Pau"
-, title =	"Translating a convex polygon to contain a maximum number of points"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, number =	4
-, year =	1997
-, pages =	"167--179"
-, succeeds =	"bdp-tcpcm-95"
-, update =	"98.03 mitchell"
+, author =      "Gill Barequet and Matthew Dickerson and Petru Pau"
+, title =       "Translating a convex polygon to contain a maximum number of points"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, number =      4
+, year =        1997
+, pages =       "167--179"
+, succeeds =    "bdp-tcpcm-95"
+, update =      "98.03 mitchell"
 }
 
 @article{bdk-rgtcr-98
-, author =	"G. Barequet and C. A. Duncan and S. Kumar"
-, title =	"RSVP: A Geometric Toolkit for Controlled Repair of Solid Models"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	4
-, number =	2
-, month =	apr
-, year =	1998
-, pages =	"162--177"
-, update =	"98.11 held"
+, author =      "G. Barequet and C. A. Duncan and S. Kumar"
+, title =       "RSVP: A Geometric Toolkit for Controlled Repair of Solid Models"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      4
+, number =      2
+, month =       apr
+, year =        1998
+, pages =       "162--177"
+, update =      "98.11 held"
 }
 
 @inproceedings{be-asrv-00b
-, author =	"Gill Barequet and Gershon Elber"
-, title =	"{$\alpha$}-Sectors of Rational Varieties"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"35--39"
-, update =	"00.03 bibrelex"
+, author =      "Gill Barequet and Gershon Elber"
+, title =       "{$\alpha$}-Sectors of Rational Varieties"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "35--39"
+, update =      "00.03 bibrelex"
 }
 
 @article{bh-pctmh-01
-, author =	"G. Barequet and S. Har-Peled"
-, title =	"Polygon containment and translational min-{Hausdorff}-distance between segment sets are {3SUM}-hard"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"465--474"
-, update =	"01.11 smid"
+, author =      "G. Barequet and S. Har-Peled"
+, title =       "Polygon containment and translational min-{Hausdorff}-distance between segment sets are {3SUM}-hard"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "465--474"
+, update =      "01.11 smid"
 }
 
 @inproceedings{bk-dfelm-97
-, author =	"G. Barequet and Y. Kaplan"
-, title =	"A data front end for layered manufacturing"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"231--239"
-, cites =	"-sis-89, b-dapd-97, bs-fgbp-95, bs-plibp-96, bw-acmrs-92, dm-otps-91, fd-ficg-82, g-cm-80, k-mtpd-80, ksl-pcdcv-97, md-sepct-93, mf-iicsf-96, sw-hdsac1-88, sh-ttsps-92, st-tsms-91, t-dsna-83, -rurcp-88, w-sve-96, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "G. Barequet and Y. Kaplan"
+, title =       "A data front end for layered manufacturing"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "231--239"
+, cites =       "-sis-89, b-dapd-97, bs-fgbp-95, bs-plibp-96, bw-acmrs-92, dm-otps-91, fd-ficg-82, g-cm-80, k-mtpd-80, ksl-pcdcv-97, md-sepct-93, mf-iicsf-96, sw-hdsac1-88, sh-ttsps-92, st-tsms-91, t-dsna-83, -rurcp-88, w-sve-96, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{bk-dfelm-98
-, author =	"G. Barequet and Y. Kaplan"
-, title =	"A Data Front-End for Layered Manufacturing"
-, journal =	"Comput. Aided Design"
-, volume =	30
-, number =	4
-, month =	apr
-, year =	1998
-, pages =	"231--243"
-, update =	"98.07 held"
+, author =      "G. Barequet and Y. Kaplan"
+, title =       "A Data Front-End for Layered Manufacturing"
+, journal =     "Comput. Aided Design"
+, volume =      30
+, number =      4
+, month =       apr
+, year =        1998
+, pages =       "231--243"
+, update =      "98.07 held"
 }
 
 @inproceedings{bk-rcm-97
-, author =	"G. Barequet and S. Kumar"
-, title =	"Repairing {CAD} Models"
-, booktitle =	"Proc. IEEE Visualization"
-, site =	"Phoenix, AZ"
-, year =	1997
-, pages =	"363--370"
-, update =	"98.03 mitchell"
+, author =      "G. Barequet and S. Kumar"
+, title =       "Repairing {CAD} Models"
+, booktitle =   "Proc. IEEE Visualization"
+, site =        "Phoenix, AZ"
+, year =        1997
+, pages =       "363--370"
+, update =      "98.03 mitchell"
 }
 
 @techreport{bs-fgbp-93
-, author =	"G. Barequet and M. Sharir"
-, title =	"Filling gaps in the boundary of a polyhedron"
-, type =	"Technical {Report}"
-, number =	"277/93"
-, institution =	"Dept. Comput. Sci., Tel Aviv Univ."
-, address =	"Tel Aviv, Israel"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "G. Barequet and M. Sharir"
+, title =       "Filling gaps in the boundary of a polyhedron"
+, type =        "Technical {Report}"
+, number =      "277/93"
+, institution = "Dept. Comput. Sci., Tel Aviv Univ."
+, address =     "Tel Aviv, Israel"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @article{bs-fgbp-95
-, author =	"G. Barequet and Micha Sharir"
-, title =	"Filling Gaps in the Boundary of a Polyhedron"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	12
-, year =	1995
-, pages =	"207--229"
-, update =	"98.03 mitchell, 97.11 bibrelex+held"
+, author =      "G. Barequet and Micha Sharir"
+, title =       "Filling Gaps in the Boundary of a Polyhedron"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      12
+, year =        1995
+, pages =       "207--229"
+, update =      "98.03 mitchell, 97.11 bibrelex+held"
 }
 
 @inproceedings{bs-psvmt-94
-, author =	"G. Barequet and Micha Sharir"
-, title =	"Partial surface and volume matching in three dimensions"
-, booktitle =	"Proc. 12th Annu. IAPR/IEEE Internat. Conf. Pattern Recogn."
-, site =	"Jerusalem, Israel"
-, volume =	2
-, year =	1994
-, pages =	"610--614"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "G. Barequet and Micha Sharir"
+, title =       "Partial surface and volume matching in three dimensions"
+, booktitle =   "Proc. 12th Annu. IAPR/IEEE Internat. Conf. Pattern Recogn."
+, site =        "Jerusalem, Israel"
+, volume =      2
+, year =        1994
+, pages =       "610--614"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{bs-psmud-96
-, author =	"Gill Barequet and Micha Sharir"
-, title =	"Partial Surface Matching by Using Directed Footprints"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"C9--C10"
-, cites =	"bj-tdor-85, bs-psvmt-94, cd-mbrrv-86, ksss-tdmbb-86, ss-ipoot-87, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Gill Barequet and Micha Sharir"
+, title =       "Partial Surface Matching by Using Directed Footprints"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "C9--C10"
+, cites =       "bj-tdor-85, bs-psvmt-94, cd-mbrrv-86, ksss-tdmbb-86, ss-ipoot-87, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{bs-plibp-94
-, author =	"G. Barequet and Micha Sharir"
-, title =	"Piecewise-Linear Interpolation between Polygonal Slices"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"93--102"
-, cites =	"bs-fgbp-93, bpccd-tdcrs-81, b-srpcs-88, bg-tdrcs-92, cs-cccld-78, cllct-tatdr-88, cclbwfodbt-avebp-80, epo-taasm-91, fku-osrpc-77, gd-ngtmp-82, g-tdmho-93, gos-rpps-93, gs-pmgsc-85, hmn-fsv-93, hw-imbmm-88, ksss-tdmbb-86, kf-fsr3d-88, ksf-sstsr-88, k-acstc-75, khw-3dcmu-91, k-mtpd-80, mss-sccbp-91, s-r3doc-89, ss-ipoot-87, s-sdbcd-81, sh-srsd-81, sp-cstir-87, sp-pgmbo-88, wa-srr3d-86, ww-srbsp-93, w-cm-90, zjh-scpc-87, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
+, author =      "G. Barequet and Micha Sharir"
+, title =       "Piecewise-Linear Interpolation between Polygonal Slices"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "93--102"
+, cites =       "bs-fgbp-93, bpccd-tdcrs-81, b-srpcs-88, bg-tdrcs-92, cs-cccld-78, cllct-tatdr-88, cclbwfodbt-avebp-80, epo-taasm-91, fku-osrpc-77, gd-ngtmp-82, g-tdmho-93, gos-rpps-93, gs-pmgsc-85, hmn-fsv-93, hw-imbmm-88, ksss-tdmbb-86, kf-fsr3d-88, ksf-sstsr-88, k-acstc-75, khw-3dcmu-91, k-mtpd-80, mss-sccbp-91, s-r3doc-89, ss-ipoot-87, s-sdbcd-81, sh-srsd-81, sp-cstir-87, sp-pgmbo-88, wa-srr3d-86, ww-srbsp-93, w-cm-90, zjh-scpc-87, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
 }
 
 @article{bs-plibp-96
-, author =	"G. Barequet and Micha Sharir"
-, title =	"Piecewise-linear interpolation between polygonal slices"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	63
-, year =	1996
-, note =	"in press."
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "G. Barequet and Micha Sharir"
+, title =       "Piecewise-linear interpolation between polygonal slices"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      63
+, year =        1996
+, note =        "in press."
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{bw-ocbtp-96
-, author =	"G. Barequet and B. Wolfers"
-, title =	"Optimizing a corridor between two polygons with an application to polyhedral interpolation"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"32--37"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "G. Barequet and B. Wolfers"
+, title =       "Optimizing a corridor between two polygons with an application to polyhedral interpolation"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "32--37"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{bml-ggpj-97
-, author =	"Naser S. Barghouti and John Mocenigo and Wenke Lee"
-, title =	"{\em Grappa}: A {GRAPh} {PAckage} in {Java}"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"336--343"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Naser S. Barghouti and John Mocenigo and Wenke Lee"
+, title =       "{\em Grappa}: A {GRAPh} {PAckage} in {Java}"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "336--343"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{bbr-ecit-85
-, author =	"M. Barnabei and A. Brini and G.-C. Rota"
-, title =	"On the exterior calculus of invariant theory"
-, journal =	"J. Algebra"
-, volume =	96
-, number =	1
-, year =	1985
-, pages =	"120--160"
-, update =	"98.03 bibrelex"
+, author =      "M. Barnabei and A. Brini and G.-C. Rota"
+, title =       "On the exterior calculus of invariant theory"
+, journal =     "J. Algebra"
+, volume =      96
+, number =      1
+, year =        1985
+, pages =       "120--160"
+, update =      "98.03 bibrelex"
 }
 
 @article{bs-dnapv-66
-, author =	"O. Barndorff-Nielsen and M. Sobel"
-, title =	"On the distribution of the number of admissible points in a vector sample"
-, journal =	"Theory Probab. Appl."
-, volume =	"XI"
-, number =	2
-, year =	1966
-, pages =	"249--269"
+, author =      "O. Barndorff-Nielsen and M. Sobel"
+, title =       "On the distribution of the number of admissible points in a vector sample"
+, journal =     "Theory Probab. Appl."
+, volume =      "XI"
+, number =      2
+, year =        1966
+, pages =       "249--269"
 }
 
 @book{bf-a2-83
-, author =	"M. Barner and F. Flohr"
-, title =	"Analysis II"
-, publisher =	"Walter de Gruyter"
-, address =	"Berlin"
-, year =	1983
-, update =	"00.03 bibrelex"
+, author =      "M. Barner and F. Flohr"
+, title =       "Analysis II"
+, publisher =   "Walter de Gruyter"
+, address =     "Berlin"
+, year =        1983
+, update =      "00.03 bibrelex"
 }
 
 @article{bh-hofca-86
-, author =	"J. Barnes and P. Hut"
-, title =	"A hierarchical {$O(n \log n)$} force-calculation algorithm"
-, journal =	"Nature"
-, volume =	324
-, number =	4
-, month =	dec
-, year =	1986
-, pages =	"446--449"
-, update =	"98.03 bibrelex"
+, author =      "J. Barnes and P. Hut"
+, title =       "A hierarchical {$O(n \log n)$} force-calculation algorithm"
+, journal =     "Nature"
+, volume =      324
+, number =      4
+, month =       dec
+, year =        1986
+, pages =       "446--449"
+, update =      "98.03 bibrelex"
 }
 
 @article{b-gc2ce-87
-, author =	"D. W. Barnette"
-, title =	"Generating closed $2$-cell embeddings in the torus and the projective plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"233--247"
+, author =      "D. W. Barnette"
+, title =       "Generating closed $2$-cell embeddings in the torus and the projective plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "233--247"
 }
 
 @article{b-pspcp-86
-, author =	"D. W. Barnette"
-, title =	"Preassigning the shape of projections of convex polytopes"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	42
-, year =	1986
-, pages =	"293--295"
-, keywords =	"three-dimensional, polytope, projection"
-, update =	"95.05 korneenko"
+, author =      "D. W. Barnette"
+, title =       "Preassigning the shape of projections of convex polytopes"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      42
+, year =        1986
+, pages =       "293--295"
+, keywords =    "three-dimensional, polytope, projection"
+, update =      "95.05 korneenko"
 }
 
 @article{b-wpt-90
-, author =	"D. W. Barnette"
-, title =	"{$W_V$} paths on the torus"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"603--608"
+, author =      "D. W. Barnette"
+, title =       "{$W_V$} paths on the torus"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "603--608"
 }
 
 @incollection{b-casrd-83
-, author =	"R. Barnhill"
-, title =	"Computer aided surface representation and design"
-, editor =	"R. Barnhill and W. Boehm"
-, booktitle =	"Surfaces in Computer-Aided Geometric Design"
-, publisher =	"North-Holland"
-, year =	1983
-, pages =	"1--24"
-, update =	"97.11 bibrelex"
+, author =      "R. Barnhill"
+, title =       "Computer aided surface representation and design"
+, editor =      "R. Barnhill and W. Boehm"
+, booktitle =   "Surfaces in Computer-Aided Geometric Design"
+, publisher =   "North-Holland"
+, year =        1983
+, pages =       "1--24"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-srds-83
-, author =	"R. E. Barnhill"
-, title =	"A Survey of the Representation and Design of Surfaces"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	"??"
-, month =	oct
-, year =	1983
-, pages =	"9--16"
-, annote =	"Suggests triangulation for basis of interpolation,
-		 using Little's minmax, rather than Delaunay
-		 Triangulation."
+, author =      "R. E. Barnhill"
+, title =       "A Survey of the Representation and Design of Surfaces"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      "??"
+, month =       oct
+, year =        1983
+, pages =       "9--16"
+, annote =      "Suggests triangulation for basis of interpolation,
+                 using Little's minmax, rather than Delaunay
+                 Triangulation."
 }
 
 @incollection{b-ras-77
-, author =	"R. E. Barnhill"
-, title =	"Representation and approximation of surfaces"
-, editor =	"J. R. Rice"
-, booktitle =	"Math. Software III"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1977
-, pages =	"69--120"
+, author =      "R. E. Barnhill"
+, title =       "Representation and approximation of surfaces"
+, editor =      "J. R. Rice"
+, booktitle =   "Math. Software III"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1977
+, pages =       "69--120"
 }
 
 @article{bbl-ntc-78
-, author =	"R. E. Barnhill and J. H. Brown and I. M. Lucewicz"
-, title =	"A new twist in CAGD"
-, journal =	"Comput. Graph. Image Process."
-, volume =	8
-, year =	1978
-, pages =	"78--79"
-, update =	"98.03 bibrelex"
+, author =      "R. E. Barnhill and J. H. Brown and I. M. Lucewicz"
+, title =       "A new twist in CAGD"
+, journal =     "Comput. Graph. Image Process."
+, volume =      8
+, year =        1978
+, pages =       "78--79"
+, update =      "98.03 bibrelex"
 }
 
 @article{bfjp-ssi-87
-, author =	"R. E. Barnhill and G. Farin and M. Jordan and B. R. Piper"
-, title =	"Surface/surface intersection"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	4
-, year =	1987
-, pages =	"3--16"
-, update =	"97.11 bibrelex"
+, author =      "R. E. Barnhill and G. Farin and M. Jordan and B. R. Piper"
+, title =       "Surface/surface intersection"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      4
+, year =        1987
+, pages =       "3--16"
+, update =      "97.11 bibrelex"
 }
 
 @article{bl-atc-84
-, author =	"R. E. Barnhill and F. F. Little"
-, title =	"Adaptive triangular cubatures"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, number =	1
-, year =	1984
-, pages =	"53--75"
+, author =      "R. E. Barnhill and F. F. Little"
+, title =       "Adaptive triangular cubatures"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, number =      1
+, year =        1984
+, pages =       "53--75"
 }
 
 @article{bl-tfds-84
-, author =	"R. E. Barnhill and F. F. Little"
-, title =	"Three- and four-dimensional surfaces"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, year =	1984
-, pages =	"77--102"
+, author =      "R. E. Barnhill and F. F. Little"
+, title =       "Three- and four-dimensional surfaces"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, year =        1984
+, pages =       "77--102"
 }
 
 @article{bo-sds-90
-, author =	"R. E. Barnhill and H. S. Ou"
-, title =	"Surfaces Defined on Surfaces"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	7
-, year =	1990
-, pages =	"323--336"
-, annote =	"Defines triangulation of a convex surface to be the
-		 same as the convex hull. Hull algorithm is gift
-		 wrapping."
+, author =      "R. E. Barnhill and H. S. Ou"
+, title =       "Surfaces Defined on Surfaces"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      7
+, year =        1990
+, pages =       "323--336"
+, annote =      "Defines triangulation of a convex surface to be the
+                 same as the convex hull. Hull algorithm is gift
+                 wrapping."
 }
 
 @book{br-cagd-74
-, author =	"R. E. Barnhill and R. F. Riesenfeld"
-, title =	"Computer aided geometric design"
-, publisher =	"Academic Press"
-, address =	"New York"
-, year =	1974
-, update =	"98.03 bibrelex"
+, author =      "R. E. Barnhill and R. F. Riesenfeld"
+, title =       "Computer aided geometric design"
+, publisher =   "Academic Press"
+, address =     "New York"
+, year =        1974
+, update =      "98.03 bibrelex"
 }
 
 @article{bgss-icfcm-96
-, author =	"D. Barnum and J. Greene and A. Smellie and P. Sprague"
-, title =	"Identification of common functional components among molecules"
-, journal =	"J.  Chem. Inf. Comput. Sci."
-, volume =	"??"
-, year =	1996
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "D. Barnum and J. Greene and A. Smellie and P. Sprague"
+, title =       "Identification of common functional components among molecules"
+, journal =     "J.  Chem. Inf. Comput. Sci."
+, volume =      "??"
+, year =        1996
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bjz-adrc-99
-, author =	"Ala Eddine Barouni and Ali Jaoua and Nejib Zaguia"
-, title =	"An Algorithm for Drawing a Ring Cover"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"157--159"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Ala Eddine Barouni and Ali Jaoua and Nejib Zaguia"
+, title =       "An Algorithm for Drawing a Ring Cover"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "157--159"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{bgs-apcme-80
-, author =	"R. C. Barr and T. M. Gallie and M. S. Spach"
-, title =	"Automated Production of Contour Maps for Electrophysiology"
-, journal =	"Computers in Biomedical Research"
-, volume =	13
-, year =	1980
-, pages =	"142--191"
-, annote =	"Constructs triangulation. Uses McLains circle
-		 criterion for $O(n^2)$ DT."
+, author =      "R. C. Barr and T. M. Gallie and M. S. Spach"
+, title =       "Automated Production of Contour Maps for Electrophysiology"
+, journal =     "Computers in Biomedical Research"
+, volume =      13
+, year =        1980
+, pages =       "142--191"
+, annote =      "Constructs triangulation. Uses McLains circle
+                 criterion for $O(n^2)$ DT."
 }
 
 @article{bkllmr-rsfpp-??
-, author =	"J. Barraquand and L. E. Kavraki and J.-C. Latombe and T.-Y. Li and R. Motwani and P. Raghavan"
-, title =	"A Random Sampling Framework for Path Planning in Large-Dimensional Configuration Spaces"
-, journal =	"Internat. J. Robot. Res."
-, volume =	"??"
-, year =	"??"
-, pages =	"to appear"
-, update =	"99.11 bibrelex, 98.03 mitchell"
+, author =      "J. Barraquand and L. E. Kavraki and J.-C. Latombe and T.-Y. Li and R. Motwani and P. Raghavan"
+, title =       "A Random Sampling Framework for Path Planning in Large-Dimensional Configuration Spaces"
+, journal =     "Internat. J. Robot. Res."
+, volume =      "??"
+, year =        "??"
+, pages =       "to appear"
+, update =      "99.11 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{bl-mcapp-90
-, author =	"J. Barraquand and J.-C. Latombe"
-, title =	"A Monte-Carlo Algorithm for Path Planning with Many Degrees of Freedom"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, month =	may
-, year =	1990
-, pages =	"1712--1717"
-, location =	"Cincinnati, Ohio"
-, update =	"02.03 orourke"
+, author =      "J. Barraquand and J.-C. Latombe"
+, title =       "A Monte-Carlo Algorithm for Path Planning with Many Degrees of Freedom"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, month =       may
+, year =        1990
+, pages =       "1712--1717"
+, location =    "Cincinnati, Ohio"
+, update =      "02.03 orourke"
 }
 
 @article{bl-nmrom-89
-, author =	"J. Barraquand and J.-C. Latombe"
-, title =	"Nonholonomic mobile robots and optimal maneuvering"
-, journal =	"Revue d'Intelligence artificielle"
-, volume =	3
-, year =	1989
-, pages =	"77--103"
-, update =	"97.11 bibrelex"
+, author =      "J. Barraquand and J.-C. Latombe"
+, title =       "Nonholonomic mobile robots and optimal maneuvering"
+, journal =     "Revue d'Intelligence artificielle"
+, volume =      3
+, year =        1989
+, pages =       "77--103"
+, update =      "97.11 bibrelex"
 }
 
 @article{bl-nmbmr-93
-, author =	"J. Barraquand and J.-C. Latombe"
-, title =	"Nonholonomic multi-body mobile robots: controllability and motion planning in the presence of obstacles"
-, journal =	"Algorithmica"
-, volume =	10
-, year =	1993
-, pages =	"121--155"
-, update =	"97.11 bibrelex"
+, author =      "J. Barraquand and J.-C. Latombe"
+, title =       "Nonholonomic multi-body mobile robots: controllability and motion planning in the presence of obstacles"
+, journal =     "Algorithmica"
+, volume =      10
+, year =        1993
+, pages =       "121--155"
+, update =      "97.11 bibrelex"
 }
 
 @article{bl-rmpdr-91
-, author =	"J. Barraquand and J.-C. Latombe"
-, title =	"Robot Motion Planning: A Distributed Representation Approach"
-, journal =	"Internat. J. Robot. Res."
-, volume =	10
-, year =	1991
-, pages =	"628--649"
-, update =	"97.03 schwarzkopf"
+, author =      "J. Barraquand and J.-C. Latombe"
+, title =       "Robot Motion Planning: A Distributed Representation Approach"
+, journal =     "Internat. J. Robot. Res."
+, volume =      10
+, year =        1991
+, pages =       "628--649"
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{b-cmsmp-96
-, author =	"Antonio Hern{\'a}ndez Barrera"
-, title =	"Computing the {Minkowski} Sum of Monotone Polygons"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"113--116"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Antonio Hern{\'a}ndez Barrera"
+, title =       "Computing the {Minkowski} Sum of Monotone Polygons"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "113--116"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{bv-hmrr-84
-, author =	"R. Barrera and A. M. Vazques"
-, title =	"A Hierarchical Method for Representing Relief"
-, booktitle =	"Proc. Pecora IX Symposium in Spatial Information Technologies for Remote Sensing Today and Tomorrow"
-, site =	"Sioux Falls, South Dakota"
-, month =	oct
-, year =	1984
-, pages =	"87--92"
-, update =	"98.11 bibrelex"
+, author =      "R. Barrera and A. M. Vazques"
+, title =       "A Hierarchical Method for Representing Relief"
+, booktitle =   "Proc. Pecora IX Symposium in Spatial Information Technologies for Remote Sensing Today and Tomorrow"
+, site =        "Sioux Falls, South Dakota"
+, month =       oct
+, year =        1984
+, pages =       "87--92"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{bgmrz-tsees-93
-, author =	"T. Barrera and J. Griffith and S. A. McKee and G. Robins and T. Zhang"
-, title =	"Toward a {Steiner} engine: {Enhanced} serial and parallel implementations of the iterated $1$-{Steiner} algorithm"
-, booktitle =	"Proc. Great Lakes Sympos. VLSI"
-, site =	"Kalamazoo, MI"
-, month =	mar
-, year =	1993
-, pages =	"90--94"
-, update =	"98.03 bibrelex"
+, author =      "T. Barrera and J. Griffith and S. A. McKee and G. Robins and T. Zhang"
+, title =       "Toward a {Steiner} engine: {Enhanced} serial and parallel implementations of the iterated $1$-{Steiner} algorithm"
+, booktitle =   "Proc. Great Lakes Sympos. VLSI"
+, site =        "Kalamazoo, MI"
+, month =       mar
+, year =        1993
+, pages =       "90--94"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bgrz-ngnos-93
-, author =	"T. Barrera and J. Griffith and G. Robins and T. Zhang"
-, title =	"Narrowing the gap: {Near}-optimal {Steiner} trees in polynomial time"
-, booktitle =	"Proc. IEEE Internat. ASIC Conf."
-, site =	"Rochester, NY"
-, month =	sep
-, year =	1993
-, pages =	"87--90"
-, update =	"98.03 bibrelex"
+, author =      "T. Barrera and J. Griffith and G. Robins and T. Zhang"
+, title =       "Narrowing the gap: {Near}-optimal {Steiner} trees in polynomial time"
+, booktitle =   "Proc. IEEE Internat. ASIC Conf."
+, site =        "Rochester, NY"
+, month =       sep
+, year =        1993
+, pages =       "87--90"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{bg-kiufd-94
-, author =	"Phillip Barry and Ron Goldman"
-, title =	"Knot Insertion Using Forward Differences"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"251--255"
-, keywords =	"curve subdivision"
-, update =	"94.09 heckbert"
-, annote =	"Describes a fast technique for subdivision of B-spline
+, author =      "Phillip Barry and Ron Goldman"
+, title =       "Knot Insertion Using Forward Differences"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "251--255"
+, keywords =    "curve subdivision"
+, update =      "94.09 heckbert"
+, annote =      "Describes a fast technique for subdivision of B-spline
 curves and surfaces. Subdivision is a fundamental operation in modeling and
 rendering. Contains pseudocode."
 }
 
 @article{bd-gcpct-89
-, author =	"B. A. Barsky and A. D. DeRose"
-, title =	"Geometric Continuity of Parametric Curves: Three Equivalent Characterizations"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	9
-, number =	6
-, month =	nov
-, year =	1989
-, pages =	"60--68"
-, update =	"93.09 held"
+, author =      "B. A. Barsky and A. D. DeRose"
+, title =       "Geometric Continuity of Parametric Curves: Three Equivalent Characterizations"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      9
+, number =      6
+, month =       nov
+, year =        1989
+, pages =       "60--68"
+, update =      "93.09 held"
 }
 
 @inproceedings{b-aamtm-98
-, author =	"Yair Bartal"
-, title =	"On Approximating Arbitrary Metrics by Tree Metrics"
-, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
-, year =	1998
-, pages =	"to appear"
-, update =	"98.03 mitchell"
+, author =      "Yair Bartal"
+, title =       "On Approximating Arbitrary Metrics by Tree Metrics"
+, booktitle =   "Proc. 30th Annu. ACM Sympos. Theory Comput."
+, year =        1998
+, pages =       "to appear"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{b-pamsi-96
-, author =	"Y. Bartal"
-, title =	"Probabilistic approximation of metric spaces and its algorithmic applications"
-, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1996
-, pages =	"184--193"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Y. Bartal"
+, title =       "Probabilistic approximation of metric spaces and its algorithmic applications"
+, booktitle =   "Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1996
+, pages =       "184--193"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @book{bbb-isucg-87
-, author =	"R. H. Bartels and J. C. Beatty and B. A. Barsky"
-, title =	"An introduction to splines for use in computer graphics and geometric modeling"
-, publisher =	"Morgan Kaufman"
-, address =	"Los Altos, CA"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "R. H. Bartels and J. C. Beatty and B. A. Barsky"
+, title =       "An introduction to splines for use in computer graphics and geometric modeling"
+, publisher =   "Morgan Kaufman"
+, address =     "Los Altos, CA"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{b-nacvh-91
-, author =	"Timothy J. Barth"
-, title =	"Numerical aspects of computing viscous high reynolds number flows on unstructured meshes"
-, booktitle =	"AIAA 29th Aerospace Sciences Meeting"
-, month =	jan
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "Timothy J. Barth"
+, title =       "Numerical aspects of computing viscous high reynolds number flows on unstructured meshes"
+, booktitle =   "AIAA 29th Aerospace Sciences Meeting"
+, month =       jan
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bh-ctbvg-99
-, author =	"Wilhelm Barth and Ernst Huber"
-, title =	"Computations with Tight Bounding Volumes for General Parametric Surfaces"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"123--127"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Wilhelm Barth and Ernst Huber"
+, title =       "Computations with Tight Bounding Volumes for General Parametric Surfaces"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "123--127"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{bp-fhbsc-83
-, author =	"J. J. {Bartholdi, III} and L. K. Platzman"
-, title =	"A fast heuristic based on spacefilling curves for minimum-weight matching in the plane"
-, journal =	"Inform. Process. Lett."
-, volume =	17
-, year =	1983
-, pages =	"177--180"
+, author =      "J. J. {Bartholdi, III} and L. K. Platzman"
+, title =       "A fast heuristic based on spacefilling curves for minimum-weight matching in the plane"
+, journal =     "Inform. Process. Lett."
+, volume =      17
+, year =        1983
+, pages =       "177--180"
 }
 
 @article{bp-optsh-82
-, author =	"J. J. {Bartholdi, III} and L. K. Platzman"
-, title =	"An {$O(n \log n)$} planar travelling salesman heuristic based on spacefilling curves"
-, journal =	"Oper. Res. Lett."
-, volume =	1
-, number =	4
-, year =	1982
-, pages =	"121--125"
-, keywords =	"travelling salesman problem, heuristic, routing, spacefilling curve, geometric graphs, optimization"
-, update =	"95.05 korneenko"
+, author =      "J. J. {Bartholdi, III} and L. K. Platzman"
+, title =       "An {$O(n \log n)$} planar travelling salesman heuristic based on spacefilling curves"
+, journal =     "Oper. Res. Lett."
+, volume =      1
+, number =      4
+, year =        1982
+, pages =       "121--125"
+, keywords =    "travelling salesman problem, heuristic, routing, spacefilling curve, geometric graphs, optimization"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bp-hbscc-84
-, author =	"J. J. {Bartholdi, III} and L. K. Platzman"
-, title =	"Heuristics based on spacefilling curves for combinatorial problems in the plane"
-, type =	"Report"
-, number =	"PDRC 84-08"
-, institution =	"School Indust. Syst. Engrg., Georgia Inst. Tech."
-, address =	"Atlanta, GA"
-, year =	1984
-, keywords =	"heuristics"
+, author =      "J. J. {Bartholdi, III} and L. K. Platzman"
+, title =       "Heuristics based on spacefilling curves for combinatorial problems in the plane"
+, type =        "Report"
+, number =      "PDRC 84-08"
+, institution = "School Indust. Syst. Engrg., Georgia Inst. Tech."
+, address =     "Atlanta, GA"
+, year =        1984
+, keywords =    "heuristics"
 }
 
 @article{bpcw-mtrsm-83
-, author =	"J. J. {Bartholdi, III} and L. K. Platzman and R. L. Collins and W. H. {Warden, III}"
-, title =	"A minimal technology routing system for meals on wheels"
-, journal =	"Interfaces"
-, volume =	13
-, number =	3
-, year =	1983
-, pages =	"1--8"
+, author =      "J. J. {Bartholdi, III} and L. K. Platzman and R. L. Collins and W. H. {Warden, III}"
+, title =       "A minimal technology routing system for meals on wheels"
+, journal =     "Interfaces"
+, volume =      13
+, number =      3
+, year =        1983
+, pages =       "1--8"
 }
 
 @techreport{bh-psafc-91
-, author =	"F. Bartling and K. Hinrichs"
-, title =	"A plane-sweep algorithm for finding a closest pair among convex planar objects"
-, type =	"Report"
-, number =	"91-03"
-, institution =	"Dept. Comput. Sci., Univ. Siegen"
-, address =	"Siegen, Germany"
-, year =	1991
-, precedes =	"bh-psafc-92"
+, author =      "F. Bartling and K. Hinrichs"
+, title =       "A plane-sweep algorithm for finding a closest pair among convex planar objects"
+, type =        "Report"
+, number =      "91-03"
+, institution = "Dept. Comput. Sci., Univ. Siegen"
+, address =     "Siegen, Germany"
+, year =        1991
+, precedes =    "bh-psafc-92"
 }
 
 @inproceedings{bh-psafc-92
-, author =	"F. Bartling and K. Hinrichs"
-, title =	"A plane-sweep algorithm for finding a closest pair among convex planar objects"
-, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	577
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"221--232"
-, succeeds =	"bh-psafc-91"
+, author =      "F. Bartling and K. Hinrichs"
+, title =       "A plane-sweep algorithm for finding a closest pair among convex planar objects"
+, booktitle =   "Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      577
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "221--232"
+, succeeds =    "bh-psafc-91"
 }
 
 @inproceedings{bh-psafc-92c
-, author =	"Frank Bartling and Klaus Hinrichs"
-, title =	"A Plane-Sweep Algorithm for Finding a Closest Pair Among Convex Planar Objects"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	91
-, update =	"00.03 bibrelex"
+, author =      "Frank Bartling and Klaus Hinrichs"
+, title =       "A Plane-Sweep Algorithm for Finding a Closest Pair Among Convex Planar Objects"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       91
+, update =      "00.03 bibrelex"
 }
 
 @techreport{bh-paask-90
-, author =	"F. Bartling and K. Hinrichs"
-, title =	"Probabilistic analysis of an algorithm for solving the $k$-dimensional all-nearest-neighbors problem by projection"
-, type =	"Report"
-, number =	"90-02"
-, institution =	"Dept. Comput. Sci., Univ. Siegen"
-, address =	"Siegen, West Germany"
-, year =	1990
+, author =      "F. Bartling and K. Hinrichs"
+, title =       "Probabilistic analysis of an algorithm for solving the $k$-dimensional all-nearest-neighbors problem by projection"
+, type =        "Report"
+, number =      "90-02"
+, institution = "Dept. Comput. Sci., Univ. Siegen"
+, address =     "Siegen, West Germany"
+, year =        1990
 }
 
 @article{bh-paask-91
-, author =	"F. Bartling and K. Hinrichs"
-, title =	"Probabilistic analysis of an algorithm for solving the $k$-dimensional all-nearest-neighbors problem by projection"
-, journal =	"BIT"
-, volume =	31
-, year =	1991
-, pages =	"558--565"
-, update =	"97.11 smid"
+, author =      "F. Bartling and K. Hinrichs"
+, title =       "Probabilistic analysis of an algorithm for solving the $k$-dimensional all-nearest-neighbors problem by projection"
+, journal =     "BIT"
+, volume =      31
+, year =        1991
+, pages =       "558--565"
+, update =      "97.11 smid"
 }
 
 @article{bp-hbscc-88
-, author =	"J. J. Bartoldi and L. K. Platzman"
-, title =	"Heuristics based on spacefilling curves for combinatorial problems in {Euclidean} space"
-, journal =	"Manage. Sci."
-, volume =	34
-, number =	3
-, year =	1988
-, pages =	"291--305"
-, keywords =	"optimization"
-, update =	"95.05 korneenko"
+, author =      "J. J. Bartoldi and L. K. Platzman"
+, title =       "Heuristics based on spacefilling curves for combinatorial problems in {Euclidean} space"
+, journal =     "Manage. Sci."
+, volume =      34
+, number =      3
+, year =        1988
+, pages =       "291--305"
+, keywords =    "optimization"
+, update =      "95.05 korneenko"
 }
 
 @article{bb-pp-80
-, author =	"E. E. Barton and I. Buchanan"
-, title =	"The polygon package"
-, journal =	"Comput. Aided Design"
-, volume =	12
-, year =	1980
-, pages =	"3--11"
+, author =      "E. E. Barton and I. Buchanan"
+, title =       "The polygon package"
+, journal =     "Comput. Aided Design"
+, volume =      12
+, year =        1980
+, pages =       "3--11"
 }
 
 @inproceedings{bmn-reisl-97
-, author =	"U. Bartuschka and K. Mehlhorn and S. N{\"a}her"
-, title =	"A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem"
-, booktitle =	"Proc. Workshop on Algorithm Engineering"
-, nickname =	"WAE '97"
-, site =	"Venice"
-, month =	sep
-, year =	1997
-, pages =	"124--135"
-, url =	"http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap13.ps.gz"
-, update =	"00.11 smid, 00.07 icking, 98.11 smid, 98.07 bibrelex+smid+vahrenhold+vismara, 98.03 mitchell"
+, author =      "U. Bartuschka and K. Mehlhorn and S. N{\"a}her"
+, title =       "A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection Problem"
+, booktitle =   "Proc. Workshop on Algorithm Engineering"
+, nickname =    "WAE '97"
+, site =        "Venice"
+, month =       sep
+, year =        1997
+, pages =       "124--135"
+, url = "http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap13.ps.gz"
+, update =      "00.11 smid, 00.07 icking, 98.11 smid, 98.07 bibrelex+smid+vahrenhold+vismara, 98.03 mitchell"
 }
 
 @article{bmh-oaocl-99
-, author =	"D. Bartz and M. Mei{\ss}ner and T. H{\"u}ttner"
-, title =	"OpenGL-assisted Occlusion Culling for Large Polygonal Models"
-, journal =	"Comput. \& Graphics"
-, volume =	23
-, number =	5
-, month =	oct
-, year =	1999
-, pages =	"667--679"
-, update =	"00.03 held"
+, author =      "D. Bartz and M. Mei{\ss}ner and T. H{\"u}ttner"
+, title =       "OpenGL-assisted Occlusion Culling for Large Polygonal Models"
+, journal =     "Comput. \& Graphics"
+, volume =      23
+, number =      5
+, month =       oct
+, year =        1999
+, pages =       "667--679"
+, update =      "00.03 held"
 }
 
 @article{bgv-srmpd-97
-, author =	"Rakesh D. Barve and Edward F. Grove and Jeffrey Scott Vitter"
-, title =	"Simple Randomized Mergesort on Parallel Disks"
-, journal =	"Parallel Comput."
-, volume =	23
-, number =	4
-, year =	1997
-, note =	"Special issue on parallel I/O.  An earlier version
-		  appears in Proc. of the 8th Annual
-		 ACM Symposium on Parallel Algorithms and
-		 Architectures (SPAA~'96), Padua, Italy, June 1996, 109--118"
-, update =	"97.03 murali"
+, author =      "Rakesh D. Barve and Edward F. Grove and Jeffrey Scott Vitter"
+, title =       "Simple Randomized Mergesort on Parallel Disks"
+, journal =     "Parallel Comput."
+, volume =      23
+, number =      4
+, year =        1997
+, note =        "Special issue on parallel I/O.  An earlier version
+                  appears in Proc. of the 8th Annual
+                 ACM Symposium on Parallel Algorithms and
+                 Architectures (SPAA~'96), Padua, Italy, June 1996, 109--118"
+, update =      "97.03 murali"
 }
 
 @inproceedings{bjww-ptamp-98
-, author =	"Alexander Barvinok and David S. Johnson and Gerhard J. Woeginger and Russell Woodroofe"
-, title =	"Polynomial Time Algorithms for Maximization Problems in Spaces with Polyhedral Norms"
-, booktitle =	"Sixth Conference on Integer Programming and Combinatorial Optimization"
-, nickname =	"IPCO Houston '98"
-, site =	"Rice University, Houston, TX"
-, month =	jun
-, year =	1998
-, pages =	"to appear"
-, update =	"98.03 mitchell"
+, author =      "Alexander Barvinok and David S. Johnson and Gerhard J. Woeginger and Russell Woodroofe"
+, title =       "Polynomial Time Algorithms for Maximization Problems in Spaces with Polyhedral Norms"
+, booktitle =   "Sixth Conference on Integer Programming and Combinatorial Optimization"
+, nickname =    "IPCO Houston '98"
+, site =        "Rice University, Houston, TX"
+, month =       jun
+, year =        1998
+, pages =       "to appear"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{b-ptaci-93
-, author =	"Alexander I. Barvinok"
-, title =	"A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the dimension is fixed"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"566--572"
-, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Alexander I. Barvinok"
+, title =       "A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the dimension is fixed"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "566--572"
+, update =      "98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{b-cei-91
-, author =	"Alexander I. Barvinok"
-, title =	"Computation of exponential integrals"
-, journal =	"Zap. Nauchn. Sem. LOMI"
-, volume =	192
-, number =	5
-, year =	1991
-, pages =	"149--163"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Alexander I. Barvinok"
+, title =       "Computation of exponential integrals"
+, journal =     "Zap. Nauchn. Sem. LOMI"
+, volume =      192
+, number =      5
+, year =        1991
+, pages =       "149--163"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{b-cvcip-92
-, author =	"Alexander I. Barvinok"
-, title =	"Computing the volume, counting integral points and exponential sums"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"161--170"
-, cites =	"b-cei-91, b-pedlp-88, gls-gaco-88, kb-ptacs-79, l-pvc-91, p-smfsp-80, s-ec-86, v-ctdah-87, vg-hfch-87, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Alexander I. Barvinok"
+, title =       "Computing the volume, counting integral points and exponential sums"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "161--170"
+, cites =       "b-cei-91, b-pedlp-88, gls-gaco-88, kb-ptacs-79, l-pvc-91, p-smfsp-80, s-ec-86, v-ctdah-87, vg-hfch-87, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{b-ighdp-95
-, author =	"Alexander I. Barvinok"
-, title =	"Integral geometry of higher-dimensional polytopes and the average case in combinatorial optimization"
-, booktitle =	"Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '95"
-, year =	1995
-, pages =	"To appear"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 95.09 mitchell"
+, author =      "Alexander I. Barvinok"
+, title =       "Integral geometry of higher-dimensional polytopes and the average case in combinatorial optimization"
+, booktitle =   "Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '95"
+, year =        1995
+, pages =       "To appear"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 95.09 mitchell"
 }
 
 @incollection{b-lplp-97
-, author =	"Alexander I. Barvinok"
-, title =	"Lattice points and lattice polytopes"
-, chapter =	7
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"133--152"
-, update =	"98.03 mitchell, 97.11 orourke"
+, author =      "Alexander I. Barvinok"
+, title =       "Lattice points and lattice polytopes"
+, chapter =     7
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "133--152"
+, update =      "98.03 mitchell, 97.11 orourke"
 }
 
 @article{b-tarts-96
-, author =	"Alexander I. Barvinok"
-, title =	"Two Algorithmic Results for the {TSP}"
-, journal =	"Math. Oper. Res."
-, volume =	21
-, year =	1996
-, pages =	"65--84"
-, keywords =	"MAX TSP, longest cycle, PTAS, approximation scheme"
-, update =	"98.03 mitchell"
+, author =      "Alexander I. Barvinok"
+, title =       "Two Algorithmic Results for the {TSP}"
+, journal =     "Math. Oper. Res."
+, volume =      21
+, year =        1996
+, pages =       "65--84"
+, keywords =    "MAX TSP, longest cycle, PTAS, approximation scheme"
+, update =      "98.03 mitchell"
 }
 
 @article{bb-msbdc-88
-, author =	"R. Barzel and A. H. Barr"
-, title =	"A modeling system based on dynamics constraints"
-, journal =	"Comput. Graph."
-, volume =	22
-, number =	4
-, year =	1988
-, pages =	"179--187"
-, note =	"Proc. SIGGRAPH '88"
-, update =	"98.03 bibrelex"
+, author =      "R. Barzel and A. H. Barr"
+, title =       "A modeling system based on dynamics constraints"
+, journal =     "Comput. Graph."
+, volume =      22
+, number =      4
+, year =        1988
+, pages =       "179--187"
+, note =        "Proc. SIGGRAPH '88"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bdiz-pacfm-97
-, author =	"J. Basch and H. Devarajan and P. Indyk and L. Zhang"
-, title =	"Probabilistic Analysis for Combinatorial Functions of Moving Points"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"442--444"
-, cites =	"a-sdcgp-85, bcl-fleta-90, bgh-dsmd-97, bgsz-pekds-97, cd-vdbcd-85, d-mirvc-83, d-kgaca-90, d-hdvdl-91, e-chrsp-65, gmr-vdmpp-92, kgs-fcdmm-97, kti-mmstl-95, ow-dsp-84, r-slcdn-70, rs-udkhv-63, s-chdch-86, ZZZ"
-, update =	"99.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
+, author =      "J. Basch and H. Devarajan and P. Indyk and L. Zhang"
+, title =       "Probabilistic Analysis for Combinatorial Functions of Moving Points"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "442--444"
+, cites =       "a-sdcgp-85, bcl-fleta-90, bgh-dsmd-97, bgsz-pekds-97, cd-vdbcd-85, d-mirvc-83, d-kgaca-90, d-hdvdl-91, e-chrsp-65, gmr-vdmpp-92, kgs-fcdmm-97, kti-mmstl-95, ow-dsp-84, r-slcdn-70, rs-udkhv-63, s-chdch-86, ZZZ"
+, update =      "99.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{bgh-dsmd-97
-, author =	"J. Basch and Leonidas J. Guibas and J. Hershberger"
-, title =	"Data Structures for Mobile Data"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1997
-, pages =	"747--756"
-, update =	"98.03 mitchell, 97.07 agarwal, 97.03 held"
+, author =      "J. Basch and Leonidas J. Guibas and J. Hershberger"
+, title =       "Data Structures for Mobile Data"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1997
+, pages =       "747--756"
+, update =      "98.03 mitchell, 97.07 agarwal, 97.03 held"
 }
 
 @inproceedings{bgr-sllsh-97
-, author =	"J. Basch and L. J. Guibas and G. Ramkumar"
-, title =	"Sweeping Lines and Line Segments with a Heap"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"469--472"
-, cites =	"bgh-dsmd-97, bgr-rrbit-96, bo-arcgi-79, elss-dgpps-73, ew-nlsfs-85, g-bpstp-79, h-fuenl-89, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "J. Basch and L. J. Guibas and G. Ramkumar"
+, title =       "Sweeping Lines and Line Segments with a Heap"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "469--472"
+, cites =       "bgh-dsmd-97, bgr-rrbit-96, bo-arcgi-79, elss-dgpps-73, ew-nlsfs-85, g-bpstp-79, h-fuenl-89, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @inproceedings{bgr-rrbit-96
-, author =	"J. Basch and Leonidas J. Guibas and G. D. Ramkumar"
-, title =	"Reporting red-blue intersections between two sets of connected line segments"
-, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1136
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"302--319"
-, update =	"98.03 mitchell, 97.03 smid"
+, author =      "J. Basch and Leonidas J. Guibas and G. D. Ramkumar"
+, title =       "Reporting red-blue intersections between two sets of connected line segments"
+, booktitle =   "Proc. 4th Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1136
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "302--319"
+, update =      "98.03 mitchell, 97.03 smid"
 }
 
 @unpublished{bgrr-pttc-
-, author =	"J. Basch and Leonidas J. Guibas and G. D. Ramkumar and L. Ramshaw"
-, title =	"Polyhedral tracings and their convolution"
-, note =	"Submitted"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "J. Basch and Leonidas J. Guibas and G. D. Ramkumar and L. Ramshaw"
+, title =       "Polyhedral tracings and their convolution"
+, note =        "Submitted"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{bgsz-pekds-97
-, author =	"J. Basch and L. J. Guibas and C. Silverstein and L. Zhang"
-, title =	"A practical evaluation of kinetic data structures"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"388--390"
-, cites =	"bdiz-pacfm-97, bgh-dsmd-97, gmr-vdmpp-92, ZZZ"
-, update =	"99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "J. Basch and L. J. Guibas and C. Silverstein and L. Zhang"
+, title =       "A practical evaluation of kinetic data structures"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "388--390"
+, cites =       "bdiz-pacfm-97, bgh-dsmd-97, gmr-vdmpp-92, ZZZ"
+, update =      "99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @inproceedings{bgz-ppmp-97
-, author =	"J. Basch and L. J. Guibas and L. Zhang"
-, title =	"Proximity Problems on Moving Points"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"344--351"
-, cites =	"ams-fnmst-92, as-rst-89, bdiz-pacfm-97, bgh-dsmd-97, bs-dsp1s-80, ggst-eamst-86, kgs-fcdmm-97, kkt-rltaf-95, kti-mmstl-95, m-mdscg-84, m-cgitr-93, o-ddds-83, s-mmdpsp-92a, st-dsdt-83, v-famst-84, wl-arrcd-85, y-cmstk-82, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "J. Basch and L. J. Guibas and L. Zhang"
+, title =       "Proximity Problems on Moving Points"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "344--351"
+, cites =       "ams-fnmst-92, as-rst-89, bdiz-pacfm-97, bgh-dsmd-97, bs-dsp1s-80, ggst-eamst-86, kgs-fcdmm-97, kkt-rltaf-95, kti-mmstl-95, m-mdscg-84, m-cgitr-93, o-ddds-83, s-mmdpsp-92a, st-dsdt-83, v-famst-84, wl-arrcd-85, y-cmstk-82, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @incollection{bd-cp-94
-, author =	"Gerard Bashein and Paul R. Detmer"
-, title =	"Centroid of a Polygon"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"3--6"
-, keywords =	"polygon area, polygon centroid"
-, update =	"94.09 heckbert"
-, annote =	"Gives formulas and code to find the centroid (center of
+, author =      "Gerard Bashein and Paul R. Detmer"
+, title =       "Centroid of a Polygon"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "3--6"
+, keywords =    "polygon area, polygon centroid"
+, update =      "94.09 heckbert"
+, annote =      "Gives formulas and code to find the centroid (center of
 mass) of a polygon. This is useful when simulating Newtonian dynamics.
 Contains C code."
 }
 
 @article{bs-fdmrc-67
-, author =	"L. J. Bass and S. R. Schubert"
-, title =	"On finding the disc of minimum radius containing a given set of points"
-, journal =	"Math. Comput."
-, volume =	12
-, year =	1967
-, pages =	"712--714"
+, author =      "L. J. Bass and S. R. Schubert"
+, title =       "On finding the disc of minimum radius containing a given set of points"
+, journal =     "Math. Comput."
+, volume =      12
+, year =        1967
+, pages =       "712--714"
 }
 
 @techreport{bh-fpsae-93
-, author =	"H. Bast and T. Hagerup"
-, title =	"Fast parallel space allocation, estimation and integer sorting"
-, type =	"Report"
-, number =	"MPI-I-93-123"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, update =	"97.11 bibrelex, 93.09 smid"
+, author =      "H. Bast and T. Hagerup"
+, title =       "Fast parallel space allocation, estimation and integer sorting"
+, type =        "Report"
+, number =      "MPI-I-93-123"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, update =      "97.11 bibrelex, 93.09 smid"
 }
 
 @article{bsss-or3dc-86
-, author =	"C. M. Bastuscheck and E. Schonberg and J. T. Schwartz and Micha Sharir"
-, title =	"Object recognition by $3$-dimensional curve matching"
-, journal =	"Internat. J. Intell. Syst."
-, volume =	1
-, year =	1986
-, pages =	"105--132"
-, keywords =	"computer vision, curves, matchings, three-dimensional"
-, update =	"98.03 mitchell"
+, author =      "C. M. Bastuscheck and E. Schonberg and J. T. Schwartz and Micha Sharir"
+, title =       "Object recognition by $3$-dimensional curve matching"
+, journal =     "Internat. J. Intell. Syst."
+, volume =      1
+, year =        1986
+, pages =       "105--132"
+, keywords =    "computer vision, curves, matchings, three-dimensional"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{b-sgtfp-88
-, author =	"M. Bastuscheck"
-, title =	"On the stability of grasping: three fingers and a planar polygon"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Robot. Autom."
-, year =	1988
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "M. Bastuscheck"
+, title =       "On the stability of grasping: three fingers and a planar polygon"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Robot. Autom."
+, year =        1988
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{b-bbnce-96
-, author =	"Saugata Basu"
-, title =	"On Bounding the {Betti} Numbers and Computing the {Euler} Characteristic of Semi-Algebraic Sets"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '96"
-, site =	"Philadelphia, PA"
-, month =	may
-, year =	1996
-, pages =	"408--417"
-, update =	"00.03 smid, 98.07 bibrelex, 98.03 mitchell"
+, author =      "Saugata Basu"
+, title =       "On Bounding the {Betti} Numbers and Computing the {Euler} Characteristic of Semi-Algebraic Sets"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '96"
+, site =        "Philadelphia, PA"
+, month =       may
+, year =        1996
+, pages =       "408--417"
+, update =      "00.03 smid, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @unpublished{b-ctcsc-98
-, author =	"S. Basu"
-, title =	"On the combinatorial and topological complexity of a single cell"
-, booktitle =	"Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1998
-, pages =	"606--616"
-, update =	"98.11 aronov, 98.07 agarwal"
+, author =      "S. Basu"
+, title =       "On the combinatorial and topological complexity of a single cell"
+, booktitle =   "Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1998
+, pages =       "606--616"
+, update =      "98.11 aronov, 98.07 agarwal"
 }
 
 @unpublished{bpr-ccsad-98
-, author =	"S. Basu and R. Pollack and M.-F. Roy"
-, title =	"Complexity of computing semi-algebraic descriptions of the connected components of a semi-algebraic set"
-, year =	1998
-, note =	"unpublished manuscript"
-, update =	"98.07 agarwal"
+, author =      "S. Basu and R. Pollack and M.-F. Roy"
+, title =       "Complexity of computing semi-algebraic descriptions of the connected components of a semi-algebraic set"
+, year =        1998
+, note =        "unpublished manuscript"
+, update =      "98.07 agarwal"
 }
 
-% , month =	may
+% , month =     may
 @inproceedings{bpr-crsas-96
-, author =	"Saugata Basu and Richard Pollack and Marie-Fran{\c{c}}oise Roy"
-, title =	"Computing Roadmaps of Semi-Algebraic Sets"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '96"
-, site =	"Philadelphia, PA"
-, year =	1996
-, pages =	"168--173"
-, update =	"98.07 bibrelex, 98.03 agarwal+mitchell"
+, author =      "Saugata Basu and Richard Pollack and Marie-Fran{\c{c}}oise Roy"
+, title =       "Computing Roadmaps of Semi-Algebraic Sets"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '96"
+, site =        "Philadelphia, PA"
+, year =        1996
+, pages =       "168--173"
+, update =      "98.07 bibrelex, 98.03 agarwal+mitchell"
 }
 
 @article{bpr-ocspm-97
-, author =	"S. Basu and R. Pollack and M.-F. Roy"
-, title =	"On Computing a Set of Points meeting every Semi-algebraically Connected Component of a Family of Polynomials on a Variety"
-, journal =	"J. Complexity"
-, volume =	13
-, year =	1997
-, pages =	"28--37"
-, update =	"98.03 agarwal"
+, author =      "S. Basu and R. Pollack and M.-F. Roy"
+, title =       "On Computing a Set of Points meeting every Semi-algebraically Connected Component of a Family of Polynomials on a Variety"
+, journal =     "J. Complexity"
+, volume =      13
+, year =        1997
+, pages =       "28--37"
+, update =      "98.03 agarwal"
 }
 
 @article{bpr-oncdf-94
-, author =	"S. Basu and R. Pollack and M.-F. Roy"
-, title =	"On the number of cells defined by a family of polynomials on a variety"
-, journal =	"Mathematika"
-, volume =	43
-, year =	1994
-, pages =	"120--126"
-, update =	"98.03 agarwal"
+, author =      "S. Basu and R. Pollack and M.-F. Roy"
+, title =       "On the number of cells defined by a family of polynomials on a variety"
+, journal =     "Mathematika"
+, volume =      43
+, year =        1994
+, pages =       "120--126"
+, update =      "98.03 agarwal"
 }
 
 @incollection{bpr-ncdfp-95
-, author =	"S. Basu and R. Pollack and M.-F. Roy"
-, title =	"On the number of cells defined by a family of polynomials on a variety"
-, editor =	"K. Y. Goldberg and D. Halperin and J.-C. Latombe and R. H. Wilson"
-, booktitle =	"Algorithmic Foundations of Robotics"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1995
-, update =	"98.07 agarwal, 98.03 bibrelex"
+, author =      "S. Basu and R. Pollack and M.-F. Roy"
+, title =       "On the number of cells defined by a family of polynomials on a variety"
+, editor =      "K. Y. Goldberg and D. Halperin and J.-C. Latombe and R. H. Wilson"
+, booktitle =   "Algorithmic Foundations of Robotics"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1995
+, update =      "98.07 agarwal, 98.03 bibrelex"
 }
 
 @article{b-hsdbu-80
-, author =	"B. G. Batchelor"
-, title =	"Hierarchial shape description based upon convex hulls of concavities"
-, journal =	"J. Cybern."
-, volume =	10
-, year =	1980
-, pages =	"205--210"
+, author =      "B. G. Batchelor"
+, title =       "Hierarchial shape description based upon convex hulls of concavities"
+, journal =     "J. Cybern."
+, volume =      10
+, year =        1980
+, pages =       "205--210"
 }
 
 @inproceedings{b-sduct-78
-, author =	"B. G. Batchelor"
-, title =	"Shape description using concavity trees"
-, editor =	"M. H. Hamza and S. G. Tzafestas"
-, booktitle =	"Proc. Internat. Sympos. Measurement \& Control"
-, nickname =	"MECO '78"
-, publisher =	"Panhellenic Society of Mechanical \& Electrical Engineers"
-, address =	"Athens"
-, year =	1978
-, pages =	"385--390"
+, author =      "B. G. Batchelor"
+, title =       "Shape description using concavity trees"
+, editor =      "M. H. Hamza and S. G. Tzafestas"
+, booktitle =   "Proc. Internat. Sympos. Measurement \& Control"
+, nickname =    "MECO '78"
+, publisher =   "Panhellenic Society of Mechanical \& Electrical Engineers"
+, address =     "Athens"
+, year =        1978
+, pages =       "385--390"
 }
 
 @article{b-sdlct-80
-, author =	"B. G. Batchelor"
-, title =	"Shape descriptors for labeling concavity trees"
-, journal =	"J. Cybern."
-, volume =	10
-, year =	1980
-, pages =	"233--237"
+, author =      "B. G. Batchelor"
+, title =       "Shape descriptors for labeling concavity trees"
+, journal =     "J. Cybern."
+, volume =      10
+, year =        1980
+, pages =       "233--237"
 }
 
 @article{b-tmfch-80
-, author =	"B. G. Batchelor"
-, title =	"Two methods for finding convex hulls of planar figures"
-, journal =	"Cybernet. Systems"
-, volume =	11
-, year =	1980
-, pages =	"105--113"
+, author =      "B. G. Batchelor"
+, title =       "Two methods for finding convex hulls of planar figures"
+, journal =     "Cybernet. Systems"
+, volume =      11
+, year =        1980
+, pages =       "105--113"
 }
 
 @article{b-uctsd-79
-, author =	"B. G. Batchelor"
-, title =	"Using concavity trees for shape description"
-, journal =	"IEEE J. Comput. Digital Techniques"
-, volume =	2
-, year =	1979
-, pages =	"157--168"
+, author =      "B. G. Batchelor"
+, title =       "Using concavity trees for shape description"
+, journal =     "IEEE J. Comput. Digital Techniques"
+, volume =      2
+, year =        1979
+, pages =       "157--168"
 }
 
 @inproceedings{b-snta-68
-, author =	"K. E. Batcher"
-, title =	"Sorting Networks and Their Applications"
-, booktitle =	"Proc. 1968 Spring Joint Computer Conf."
-, publisher =	"AFIPS Press"
-, address =	"Reston, VA"
-, year =	1968
-, pages =	"307--314"
-, update =	"96.09 orourke"
+, author =      "K. E. Batcher"
+, title =       "Sorting Networks and Their Applications"
+, booktitle =   "Proc. 1968 Spring Joint Computer Conf."
+, publisher =   "AFIPS Press"
+, address =     "Reston, VA"
+, year =        1968
+, pages =       "307--314"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{bhrz-pgrtc-97
-, author =	"C. Douglass Bateman and C. S. Helvig and Gabriel Robins and Alexander Zelikovsky"
-, title =	"Provably Good Routing Tree Construction with Multi-Port Terminals"
-, booktitle =	"Proc. ACM/SIGDA International Symposium on Physical Design"
-, site =	"Napa Valley, CA"
-, month =	apr
-, year =	1997
-, pages =	"??"
-, keywords =	"one-of-a-set TSP, group TSP, approximation algorithms"
-, update =	"98.03 mitchell"
+, author =      "C. Douglass Bateman and C. S. Helvig and Gabriel Robins and Alexander Zelikovsky"
+, title =       "Provably Good Routing Tree Construction with Multi-Port Terminals"
+, booktitle =   "Proc. ACM/SIGDA International Symposium on Physical Design"
+, site =        "Napa Valley, CA"
+, month =       apr
+, year =        1997
+, pages =       "??"
+, keywords =    "one-of-a-set TSP, group TSP, approximation algorithms"
+, update =      "98.03 mitchell"
 }
 
 @article{b-nccp-49
-, author =	"P. T. Bateman"
-, title =	"Note on the coefficients of the cyclotomic polynomial"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	55
-, year =	1949
-, pages =	"1180--1181"
-, update =	"97.11 bibrelex"
+, author =      "P. T. Bateman"
+, title =       "Note on the coefficients of the cyclotomic polynomial"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      55
+, year =        1949
+, pages =       "1180--1181"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bbdnnrt-alfia-86
-, author =	"C. Batini and P. Brunetti and G. {Di Battista} and P. Naggar and E. Nardelli and G. Richelli and R. Tamassia"
-, title =	"An Automatic Layout Facility and its Applications"
-, booktitle =	"Proc. Internat. Workshop on Software Engineering Environment"
-, publisher =	"China Academic Publishers"
-, address =	"Beijing, China"
-, year =	1986
-, pages =	"139--157"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "C. Batini and P. Brunetti and G. {Di Battista} and P. Naggar and E. Nardelli and G. Richelli and R. Tamassia"
+, title =       "An Automatic Layout Facility and its Applications"
+, booktitle =   "Proc. Internat. Workshop on Software Engineering Environment"
+, publisher =   "China Academic Publishers"
+, address =     "Beijing, China"
+, year =        1986
+, pages =       "139--157"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{bcn-cdder-92
-, author =	"C. Batini and S. Ceri and S. B. Navathe"
-, title =	"Conceptual Database Design, an Entity-Relationship Approach"
-, publisher =	"Benjamin Cummings"
-, year =	1992
-, update =	"95.01 tamassia"
+, author =      "C. Batini and S. Ceri and S. B. Navathe"
+, title =       "Conceptual Database Design, an Entity-Relationship Approach"
+, publisher =   "Benjamin Cummings"
+, year =        1992
+, update =      "95.01 tamassia"
 }
 
 @book{bf-mpbds-86
-, author =	"C. Batini and E. Fortunato"
-, title =	"Metodi per la Progettazione di Basi di Dati Statistici"
-, publisher =	"ISTAT"
-, year =	1986
-, update =	"95.01 tamassia"
+, author =      "C. Batini and E. Fortunato"
+, title =       "Metodi per la Progettazione di Basi di Dati Statistici"
+, publisher =   "ISTAT"
+, year =        1986
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{bfn-wigdp-85
-, author =	"C. Batini and L. Furlani and E. Nardelli"
-, title =	"What is a Good Diagram? {A} Pragmatic Approach"
-, booktitle =	"Proc. 4th Internat. Conf. on the Entity-Relationship Approach"
-, year =	1985
-, pages =	"312--319"
-, keywords =	"graph drawing"
-, update =	"98.07 vismara, 93.09 tamassia"
+, author =      "C. Batini and L. Furlani and E. Nardelli"
+, title =       "What is a Good Diagram? {A} Pragmatic Approach"
+, booktitle =   "Proc. 4th Internat. Conf. on the Entity-Relationship Approach"
+, year =        1985
+, pages =       "312--319"
+, keywords =    "graph drawing"
+, update =      "98.07 vismara, 93.09 tamassia"
 }
 
 @inproceedings{bntt-gtaal-84
-, author =	"C. Batini and E. Nardelli and M. Talamo and R. Tamassia"
-, title =	"A Graph Theoretic Approach to Aesthetic Layout of Information Systems Diagrams"
-, booktitle =	"Proc. 10th Internat. Workshop Graph-Theoret. Concepts Comput. Sci. (Berlin June 1984)"
-, publisher =	"Trauner Verlag"
-, address =	"Linz, Austria"
-, year =	1984
-, pages =	"9--18"
-, keywords =	"graph drawing"
-, update =	"94.05 smid, 93.09 tamassia"
+, author =      "C. Batini and E. Nardelli and M. Talamo and R. Tamassia"
+, title =       "A Graph Theoretic Approach to Aesthetic Layout of Information Systems Diagrams"
+, booktitle =   "Proc. 10th Internat. Workshop Graph-Theoret. Concepts Comput. Sci. (Berlin June 1984)"
+, publisher =   "Trauner Verlag"
+, address =     "Linz, Austria"
+, year =        1984
+, pages =       "9--18"
+, keywords =    "graph drawing"
+, update =      "94.05 smid, 93.09 tamassia"
 }
 
 @incollection{bntt-ggtcd-85
-, author =	"C. Batini and E. Nardelli and M. Talamo and R. Tamassia"
-, title =	"{GINCOD}: a Graphical Tool for Conceptual Design of Data Base Applications"
-, editor =	"A. Albano and V. De Antonellis and A. Di Leva"
-, booktitle =	"Computer Aided Data Base Design"
-, publisher =	"North-Holland"
-, address =	"New York, NY"
-, year =	1985
-, pages =	"33--51"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "C. Batini and E. Nardelli and M. Talamo and R. Tamassia"
+, title =       "{GINCOD}: a Graphical Tool for Conceptual Design of Data Base Applications"
+, editor =      "A. Albano and V. De Antonellis and A. Di Leva"
+, booktitle =   "Computer Aided Data Base Design"
+, publisher =   "North-Holland"
+, address =     "New York, NY"
+, year =        1985
+, pages =       "33--51"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{bnt-ladfd-86
-, author =	"C. Batini and E. Nardelli and R. Tamassia"
-, title =	"A Layout Algorithm for Data Flow Diagrams"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	"SE-12"
-, number =	4
-, year =	1986
-, pages =	"538--546"
-, keywords =	"graph drawing"
-, update =	"98.07 vismara, 93.09 tamassia"
+, author =      "C. Batini and E. Nardelli and R. Tamassia"
+, title =       "A Layout Algorithm for Data Flow Diagrams"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      "SE-12"
+, number =      4
+, year =        1986
+, pages =       "538--546"
+, keywords =    "graph drawing"
+, update =      "98.07 vismara, 93.09 tamassia"
 }
 
 @article{btt-caler-84
-, author =	"C. Batini and M. Talamo and R. Tamassia"
-, title =	"Computer Aided Layout of Entity-Relationship Diagrams"
-, journal =	"Journal of Systems and Software"
-, volume =	4
-, year =	1984
-, pages =	"163--173"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "C. Batini and M. Talamo and R. Tamassia"
+, title =       "Computer Aided Layout of Entity-Relationship Diagrams"
+, journal =     "Journal of Systems and Software"
+, volume =      4
+, year =        1984
+, pages =       "163--173"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{bpccd-tdcrs-81
-, author =	"S. Batnitzky and H. I. Price and P. N. Cook and L. T. Cook and S. J. {Dwyer, III}"
-, title =	"Three-dimensional computer reconstruction from surface contours for head {CT} examinations"
-, journal =	"J. Comput. Assisted Tomography"
-, volume =	5
-, year =	1981
-, pages =	"60--67"
-, update =	"98.03 bibrelex"
+, author =      "S. Batnitzky and H. I. Price and P. N. Cook and L. T. Cook and S. J. {Dwyer, III}"
+, title =       "Three-dimensional computer reconstruction from surface contours for head {CT} examinations"
+, journal =     "J. Comput. Assisted Tomography"
+, volume =      5
+, year =        1981
+, pages =       "60--67"
+, update =      "98.03 bibrelex"
 }
 
 @article{bgp-lfmma-89
-, author =	"R. Batta and A. Ghose and U. S. Palekar"
-, title =	"Locating facilities on the {Manhattan} metrics with arbitrary shaped barriers and convex forbidden regions"
-, journal =	"Transp. Sci."
-, volume =	23
-, number =	1
-, year =	1989
-, pages =	"26--36"
-, keywords =	"facility location, $L_1$-metrics"
-, update =	"95.05 korneenko"
+, author =      "R. Batta and A. Ghose and U. S. Palekar"
+, title =       "Locating facilities on the {Manhattan} metrics with arbitrary shaped barriers and convex forbidden regions"
+, journal =     "Transp. Sci."
+, volume =      23
+, number =      1
+, year =        1989
+, pages =       "26--36"
+, keywords =    "facility location, $L_1$-metrics"
+, update =      "95.05 korneenko"
 }
 
 @article{bl-adpsp-88
-, author =	"R. Batta and L. A. Leifer"
-, title =	"On the accuracy of demand point solutions to the planar {Manhattan} metric p-median problem with and without barriers to travel"
-, journal =	"Comput. Oper. Res."
-, volume =	15
-, number =	3
-, year =	1988
-, pages =	"253--262"
-, keywords =	"facility location, $L_1$-metrics"
-, update =	"95.05 korneenko"
+, author =      "R. Batta and L. A. Leifer"
+, title =       "On the accuracy of demand point solutions to the planar {Manhattan} metric p-median problem with and without barriers to travel"
+, journal =     "Comput. Oper. Res."
+, volume =      15
+, number =      3
+, year =        1988
+, pages =       "253--262"
+, keywords =    "facility location, $L_1$-metrics"
+, update =      "95.05 korneenko"
 }
 
 @article{b-solq-85
-, author =	"M. A. Bauer"
-, title =	"Set operations on linear quadtrees"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	29
-, year =	1985
-, pages =	"248--258"
+, author =      "M. A. Bauer"
+, title =       "Set operations on linear quadtrees"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      29
+, year =        1985
+, pages =       "248--258"
 }
 
 @inproceedings{bkkmnsu-osca-95
-, author =	"F. Bauern{\"o}ppel and E. Kranankis and D. Krizanc and A. Maheshwari and M. Noy and J.-R. Sack and J. Urrutia"
-, title =	"Optimal shooting: characterizations and applications"
-, booktitle =	"Proc. 22nd ICALP"
-, site =	"Szeged, Hungary"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	944
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"220--231"
-, update =	"99.11 bibrelex, 97.11 sack"
+, author =      "F. Bauern{\"o}ppel and E. Kranankis and D. Krizanc and A. Maheshwari and M. Noy and J.-R. Sack and J. Urrutia"
+, title =       "Optimal shooting: characterizations and applications"
+, booktitle =   "Proc. 22nd ICALP"
+, site =        "Szeged, Hungary"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      944
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "220--231"
+, update =      "99.11 bibrelex, 97.11 sack"
 }
 
 @article{bkkmsu-psgca-97
-, author =	"F. Bauern{\"o}ppel and E. Kranankis and D. Krizanc and A. Maheshwari and J.-R. Sack and J. Urrutia"
-, title =	"Planar stage graphs: characterization and applications"
-, journal =	"Theoret. Comput. Sci."
-, volume =	175
-, month =	apr
-, year =	1997
-, update =	"97.11 sack"
+, author =      "F. Bauern{\"o}ppel and E. Kranankis and D. Krizanc and A. Maheshwari and J.-R. Sack and J. Urrutia"
+, title =       "Planar stage graphs: characterization and applications"
+, journal =     "Theoret. Comput. Sci."
+, volume =      175
+, month =       apr
+, year =        1997
+, update =      "97.11 sack"
 }
 
 @article{bmsw-mruap-91
-, author =	"D. R. Baum and S. Mann and K. P. Smith and J. M. Winget"
-, title =	"Making Radiosity Usable: {Automatic} Preprocessing and Meshing Techniques for the Generation of Accurate Radiosity Solutions"
-, journal =	"Comput. Graph."
-, volume =	25
-, number =	4
-, year =	1991
-, pages =	"51--60"
-, note =	"Proc. SIGGRAPH '91"
-, keywords =	"triangulation, computer graphics"
-, update =	"95.05 korneenko"
+, author =      "D. R. Baum and S. Mann and K. P. Smith and J. M. Winget"
+, title =       "Making Radiosity Usable: {Automatic} Preprocessing and Meshing Techniques for the Generation of Accurate Radiosity Solutions"
+, journal =     "Comput. Graph."
+, volume =      25
+, number =      4
+, year =        1991
+, pages =       "51--60"
+, note =        "Proc. SIGGRAPH '91"
+, keywords =    "triangulation, computer graphics"
+, update =      "95.05 korneenko"
 }
 
 @article{b-luhs-90
-, author =	"E. B. Baum"
-, title =	"On learning a union of half spaces"
-, journal =	"J. Complexity"
-, volume =	6
-, number =	1
-, year =	1990
-, pages =	"67--101"
-, keywords =	"$d$-dimensional, halfspaces"
-, update =	"95.05 korneenko"
+, author =      "E. B. Baum"
+, title =       "On learning a union of half spaces"
+, journal =     "J. Complexity"
+, volume =      6
+, number =      1
+, year =        1990
+, pages =       "67--101"
+, keywords =    "$d$-dimensional, halfspaces"
+, update =      "95.05 korneenko"
 }
 
 @article{b-cmp-88
-, author =	"E. B. Baum"
-, title =	"On the capabilities of multilayer perceptrons"
-, journal =	"J. Complexity"
-, volume =	4
-, year =	1988
-, pages =	"19--25"
-, update =	"98.07 bibrelex"
+, author =      "E. B. Baum"
+, title =       "On the capabilities of multilayer perceptrons"
+, journal =     "J. Complexity"
+, volume =      4
+, year =        1988
+, pages =       "19--25"
+, update =      "98.07 bibrelex"
 }
 
 @article{bh-wsngv-89
-, author =	"E. B. Baum and D. Haussler"
-, title =	"What size net gives valid generalization?"
-, journal =	"Neural Computation"
-, volume =	1
-, year =	1989
-, pages =	"151--160"
-, update =	"98.07 bibrelex"
+, author =      "E. B. Baum and D. Haussler"
+, title =       "What size net gives valid generalization?"
+, journal =     "Neural Computation"
+, volume =      1
+, year =        1989
+, pages =       "151--160"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{b-prcv-75
-, author =	"B. G. Baumgart"
-, title =	"A polyhedron representation for computer vision"
-, booktitle =	"Proc. AFIPS Natl. Comput. Conf."
-, volume =	44
-, publisher =	"AFIPS Press, Alrington, Va."
-, year =	1975
-, pages =	"589--596"
-, update =	"98.07 bibrelex"
+, author =      "B. G. Baumgart"
+, title =       "A polyhedron representation for computer vision"
+, booktitle =   "Proc. AFIPS Natl. Comput. Conf."
+, volume =      44
+, publisher =   "AFIPS Press, Alrington, Va."
+, year =        1975
+, pages =       "589--596"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{b-gmcv-74
-, author =	"B. G. Baumgart"
-, title =	"Geometric Modeling for Computer Vision"
-, number =	"STAN-CS-74463"
-, institution =	"Dept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, month =	oct
-, year =	1974
-, update =	"97.11 bibrelex"
+, author =      "B. G. Baumgart"
+, title =       "Geometric Modeling for Computer Vision"
+, number =      "STAN-CS-74463"
+, institution = "Dept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, month =       oct
+, year =        1974
+, update =      "97.11 bibrelex"
 }
 
 @techreport{bjm-dplgs-92t
-, author =	"H. Baumgarten and H. Jung and K. Mehlhorn"
-, title =	"Dynamic point location in general subdivisions"
-, number =	"MPI-I-92-126"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
-, update =	"93.05 schwarzkopf"
+, author =      "H. Baumgarten and H. Jung and K. Mehlhorn"
+, title =       "Dynamic point location in general subdivisions"
+, number =      "MPI-I-92-126"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
+, update =      "93.05 schwarzkopf"
 }
 
 @inproceedings{bjm-dplgs-92
-, author =	"Hanna Baumgarten and Hermann Jung and Kurt Mehlhorn"
-, title =	"Dynamic Point Location in General Subdivisions"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"81--83"
-, update =	"00.03 bibrelex"
+, author =      "Hanna Baumgarten and Hermann Jung and Kurt Mehlhorn"
+, title =       "Dynamic Point Location in General Subdivisions"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "81--83"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{bjm-dplgs-92i
-, author =	"H. Baumgarten and H. Jung and K. Mehlhorn"
-, title =	"Dynamic point location in general subdivisions"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"250--258"
-, update =	"93.05 schwarzkopf"
+, author =      "H. Baumgarten and H. Jung and K. Mehlhorn"
+, title =       "Dynamic point location in general subdivisions"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "250--258"
+, update =      "93.05 schwarzkopf"
 }
 
 @article{bjm-dplgs-94
-, author =	"H. Baumgarten and H. Jung and K. Mehlhorn"
-, title =	"Dynamic point location in general subdivisions"
-, journal =	"J. Algorithms"
-, volume =	17
-, year =	1994
-, pages =	"342--380"
-, update =	"95.01 smid"
+, author =      "H. Baumgarten and H. Jung and K. Mehlhorn"
+, title =       "Dynamic point location in general subdivisions"
+, journal =     "J. Algorithms"
+, volume =      17
+, year =        1994
+, pages =       "342--380"
+, update =      "95.01 smid"
 }
 
 @inproceedings{bdm-tepa1-95
-, author =	"A. B{\"a}umker and W. Dittrich and F. {Meyer auf der Heide}"
-, title =	"Truly efficient parallel algorithms: $1$-optimal multisearch for an extension of the {BSP} model"
-, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
-, nickname =	"ESA"
-, year =	1995
-, pages =	"17--30"
-, update =	"96.09 orourke"
+, author =      "A. B{\"a}umker and W. Dittrich and F. {Meyer auf der Heide}"
+, title =       "Truly efficient parallel algorithms: $1$-optimal multisearch for an extension of the {BSP} model"
+, booktitle =   "Proc. 3rd Annu. European Sympos. Algorithms"
+, nickname =    "ESA"
+, year =        1995
+, pages =       "17--30"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{bdp-dcpm-96
-, author =	"A. B{\"a}umker and W. Dittrich and A. Pietracaprina"
-, title =	"The deterministic complexity of parallel multisearch"
-, booktitle =	"Proc. 1996 Scadanavian Workshop on Algorithmic Theory"
-, year =	1996
-, pages =	"to appear"
-, update =	"96.09 orourke"
+, author =      "A. B{\"a}umker and W. Dittrich and A. Pietracaprina"
+, title =       "The deterministic complexity of parallel multisearch"
+, booktitle =   "Proc. 1996 Scadanavian Workshop on Algorithmic Theory"
+, year =        1996
+, pages =       "to appear"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{by-kmafr-90
-, author =	"J. J. Bausch and K. Youcef-Toumi"
-, title =	"Kinematic methods for automated fixture reconfiguration planning"
-, booktitle =	"Proc. 7th IEEE Internat. Conf. Robot. Autom."
-, month =	may
-, year =	1990
-, update =	"98.03 bibrelex"
+, author =      "J. J. Bausch and K. Youcef-Toumi"
+, title =       "Kinematic methods for automated fixture reconfiguration planning"
+, booktitle =   "Proc. 7th IEEE Internat. Conf. Robot. Autom."
+, month =       may
+, year =        1990
+, update =      "98.03 bibrelex"
 }
 
 @incollection{bl-cacp-93
-, author =	"M. Bayer and C. Lee"
-, title =	"Combinatorial aspects of convex polytopes"
-, chapter =	"2.3"
-, editor =	"P. Gruber and J. Wills"
-, booktitle =	"Handbook of Convex Geometry"
-, publisher =	"North-Holland"
-, address =	"New York, NY"
-, year =	1993
-, pages =	"485--534"
-, update =	"98.03 bibrelex"
+, author =      "M. Bayer and C. Lee"
+, title =       "Combinatorial aspects of convex polytopes"
+, chapter =     "2.3"
+, editor =      "P. Gruber and J. Wills"
+, booktitle =   "Handbook of Convex Geometry"
+, publisher =   "North-Holland"
+, address =     "New York, NY"
+, year =        1993
+, pages =       "485--534"
+, update =      "98.03 bibrelex"
 }
 
 @article{bk-nip-91
-, author =	"M. M. Bayer and A. Klapper"
-, title =	"An new index for polytopes"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"33--47"
+, author =      "M. M. Bayer and A. Klapper"
+, title =       "An new index for polytopes"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "33--47"
 }
 
 @article{b-sbbtd-72
-, author =	"R. Bayer"
-, title =	"Symmetric binary B-trees: data structure and maintenace algorithms"
-, journal =	"Acta Inform."
-, volume =	1
-, year =	1972
-, pages =	"290--306"
-, update =	"97.11 bibrelex"
+, author =      "R. Bayer"
+, title =       "Symmetric binary B-trees: data structure and maintenace algorithms"
+, journal =     "Acta Inform."
+, volume =      1
+, year =        1972
+, pages =       "290--306"
+, update =      "97.11 bibrelex"
 }
 
 @article{bm-oloi-72
-, author =	"R. Bayer and {McCreight}"
-, title =	"Organization of large ordered indexes"
-, journal =	"Acta Inform."
-, volume =	1
-, year =	1972
-, pages =	"173--189"
-, keywords =	"data structuring"
-, update =	"95.05 korneenko"
+, author =      "R. Bayer and {McCreight}"
+, title =       "Organization of large ordered indexes"
+, journal =     "Acta Inform."
+, volume =      1
+, year =        1972
+, pages =       "173--189"
+, keywords =    "data structuring"
+, update =      "95.05 korneenko"
 }
 
 @incollection{btrv-svtbu-98
-, author =	"J. Bazik and R. Tamassia and S. P. Reiss and A. van Dam"
-, title =	"Software Visualization in Teaching at {Brown University}"
-, editor =	"J. Stasko and J. Domingue and M. H. Brown and B. A. Price"
-, booktitle =	"Software Visualization: Programming as a Multimedia Experience"
-, publisher =	"MIT Press"
-, year =	1998
-, pages =	"383--398"
-, keywords =	"software visualization, algorithm animation"
-, update =	"98.07 tamassia, 97.03 tamassia"
+, author =      "J. Bazik and R. Tamassia and S. P. Reiss and A. van Dam"
+, title =       "Software Visualization in Teaching at {Brown University}"
+, editor =      "J. Stasko and J. Domingue and M. H. Brown and B. A. Price"
+, booktitle =   "Software Visualization: Programming as a Multimedia Experience"
+, publisher =   "MIT Press"
+, year =        1998
+, pages =       "383--398"
+, keywords =    "software visualization, algorithm animation"
+, update =      "98.07 tamassia, 97.03 tamassia"
 }
 
 @inproceedings{bh-obdpc-87
-, author =	"P. Beame and J. Hastad"
-, title =	"Optimal bounds for decision problems on the {CRCW} {PRAM}"
-, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
-, year =	1987
-, pages =	"83--93"
-, update =	"98.03 bibrelex"
+, author =      "P. Beame and J. Hastad"
+, title =       "Optimal bounds for decision problems on the {CRCW} {PRAM}"
+, booktitle =   "Proc. 19th Annu. ACM Sympos. Theory Comput."
+, year =        1987
+, pages =       "83--93"
+, update =      "98.03 bibrelex"
 }
 
 @article{bh-obdpc-89
-, author =	"P. Beame and J. Hastad"
-, title =	"Optimal Bounds for Decision Problems on the {CRCW} {PRAM}"
-, journal =	"J. ACM"
-, volume =	36
-, number =	3
-, year =	1989
-, pages =	"643--670"
-, update =	"96.09 orourke"
+, author =      "P. Beame and J. Hastad"
+, title =       "Optimal Bounds for Decision Problems on the {CRCW} {PRAM}"
+, journal =     "J. ACM"
+, volume =      36
+, number =      3
+, year =        1989
+, pages =       "643--670"
+, update =      "96.09 orourke"
 }
 
 @book{b-gdg-83
-, author =	"A. F. Beardon"
-, title =	"The Geometry of Discrete Groups"
-, series =	"Graduate Texts in Mathematics"
-, publisher =	"Springer-Verlag"
-, year =	1983
+, author =      "A. F. Beardon"
+, title =       "The Geometry of Discrete Groups"
+, series =      "Graduate Texts in Mathematics"
+, publisher =   "Springer-Verlag"
+, year =        1983
 }
 
 @article{bhh-sptmp-59
-, author =	"J. Beardwood and J. H. Halton and J. M. Hammersley"
-, title =	"The shortest path through many points"
-, journal =	"Math. Proc. Camb. Phil. Soc."
-, volume =	55
-, year =	1959
-, pages =	"299--327"
-, update =	"97.11 bibrelex"
+, author =      "J. Beardwood and J. H. Halton and J. M. Hammersley"
+, title =       "The shortest path through many points"
+, journal =     "Math. Proc. Camb. Phil. Soc."
+, volume =      55
+, year =        1959
+, pages =       "299--327"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-aspg-84
-, author =	"J. E. Beasley"
-, title =	"An algorithm for the {Steiner} problem in graphs"
-, journal =	"Networks"
-, volume =	14
-, year =	1984
-, pages =	"147--159"
+, author =      "J. E. Beasley"
+, title =       "An algorithm for the {Steiner} problem in graphs"
+, journal =     "Networks"
+, volume =      14
+, year =        1984
+, pages =       "147--159"
 }
 
 @article{bn-toptp-91
-, author =	"D. Beauquier and M. Nivat"
-, title =	"On translating one polyomino to tile the plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"575--592"
-, succeeds =	"gn-tpot-90"
+, author =      "D. Beauquier and M. Nivat"
+, title =       "On translating one polyomino to tile the plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "575--592"
+, succeeds =    "gn-tpot-90"
 }
 
 @article{bnrr-tfptb-94
-, author =	"D. Beauquier and M. Nivat and E. Remila and M. Robson"
-, title =	"Tiling figures of the plane with two bars"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"1--25"
-, update =	"96.09 devillers"
+, author =      "D. Beauquier and M. Nivat and E. Remila and M. Robson"
+, title =       "Tiling figures of the plane with two bars"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "1--25"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{bbdl-tealf-91
-, author =	"M. Beccaria and P. Bertolazzi and G. {Di Battista} and G. Liotta"
-, title =	"A Tailorable and Extensible Automatic Layout Facility"
-, booktitle =	"Proc. IEEE Workshop on Visual Languages"
-, nickname =	"VL '91"
-, year =	1991
-, pages =	"68--73"
-, keywords =	"graph drawing"
-, update =	"98.07 bibrelex, 93.09 tamassia"
+, author =      "M. Beccaria and P. Bertolazzi and G. {Di Battista} and G. Liotta"
+, title =       "A Tailorable and Extensible Automatic Layout Facility"
+, booktitle =   "Proc. IEEE Workshop on Visual Languages"
+, nickname =    "VL '91"
+, year =        1991
+, pages =       "68--73"
+, keywords =    "graph drawing"
+, update =      "98.07 bibrelex, 93.09 tamassia"
 }
 
 @article{b-gisne-90
-, author =	"A. Beck"
-, title =	"Greed is (sometimes) not enough"
-, journal =	"Amer. Math. Monthly"
-, volume =	97
-, number =	4
-, year =	1990
-, pages =	"289--294"
-, keywords =	"optimization, covering"
-, update =	"95.05 korneenko"
+, author =      "A. Beck"
+, title =       "Greed is (sometimes) not enough"
+, journal =     "Amer. Math. Monthly"
+, volume =      97
+, number =      4
+, year =        1990
+, pages =       "289--294"
+, keywords =    "optimization, covering"
+, update =      "95.05 korneenko"
 }
 
 @article{b-srnpt-83
-, author =	"J. Beck"
-, title =	"On size {Ramsey} number of paths, trees, and circuits, {I}."
-, journal =	"J. Graph Theory"
-, volume =	7
-, year =	1983
-, pages =	"115--129"
-, update =	"97.11 bibrelex"
+, author =      "J. Beck"
+, title =       "On size {Ramsey} number of paths, trees, and circuits, {I}."
+, journal =     "J. Graph Theory"
+, volume =      7
+, year =        1983
+, pages =       "115--129"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-lppsp-83
-, author =	"J. Beck"
-, title =	"On the lattice property of the plane and some problems of {Dirac,} {Motzkin} and {Erd\H os} in combinatorial geometry"
-, journal =	"Combinatorica"
-, volume =	3
-, number =	"3--4"
-, year =	1983
-, pages =	"281--297"
-, keywords =	"discrete geometry, points, arrangements"
-, update =	"95.05 korneenko"
+, author =      "J. Beck"
+, title =       "On the lattice property of the plane and some problems of {Dirac,} {Motzkin} and {Erd\H os} in combinatorial geometry"
+, journal =     "Combinatorica"
+, volume =      3
+, number =      "3--4"
+, year =        1983
+, pages =       "281--297"
+, keywords =    "discrete geometry, points, arrangements"
+, update =      "95.05 korneenko"
 }
 
 @article{b-redis-81
-, author =	"J. Beck"
-, title =	"Roth's estimate on the discrepancy of integer sequences is nearly sharp"
-, journal =	"Combinatorica"
-, volume =	1
-, number =	4
-, year =	1981
-, pages =	"319--325"
-, update =	"94.05 matousek"
+, author =      "J. Beck"
+, title =       "Roth's estimate on the discrepancy of integer sequences is nearly sharp"
+, journal =     "Combinatorica"
+, volume =      1
+, number =      4
+, year =        1981
+, pages =       "319--325"
+, update =      "94.05 matousek"
 }
 
 @book{bc-id-87
-, author =	"J. Beck and W. Chen"
-, title =	"Irregularities of distribution"
-, publisher =	"Cambridge University Press"
-, year =	1987
-, update =	"93.09 matousek"
+, author =      "J. Beck and W. Chen"
+, title =       "Irregularities of distribution"
+, publisher =   "Cambridge University Press"
+, year =        1987
+, update =      "93.09 matousek"
 }
 
 @article{bfh-sam-86
-, author =	"J. Beck and R. Farouki and J. Hinds"
-, title =	"Surface Analysis Methods"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	"??"
-, year =	1986
-, pages =	"18--36"
-, update =	"98.03 bibrelex"
+, author =      "J. Beck and R. Farouki and J. Hinds"
+, title =       "Surface Analysis Methods"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      "??"
+, year =        1986
+, pages =       "18--36"
+, update =      "98.03 bibrelex"
 }
 
 @misc{bs-dt-
-, author =	"J. Beck and V. {S\'os}"
-, title =	"Discrepancy theory"
-, note =	"Chapter for {\em Handbook of Combinatorics}, to be
+, author =      "J. Beck and V. {S\'os}"
+, title =       "Discrepancy theory"
+, note =        "Chapter for {\em Handbook of Combinatorics}, to be
 published by North-Holland"
-, update =	"94.05 matousek"
+, update =      "94.05 matousek"
 }
 
 @techreport{bfglow-asotm-92
-, author =	"B. Becker and P. G. Franciosa and S. Gschwind and S. Leonardi and T. Ohler and P. Widmayer"
-, title =	"Approximating a set of objects by two minimum area rectangles"
-, type =	"Technical {Report}"
-, number =	"21.92"
-, institution =	"Dept. Inform. Sistem., Univ. Roma La Sapienza"
-, address =	"Rome, Italy"
-, year =	1992
-, update =	"97.03 smid, 95.05 franciosa, 94.09 franciosa, 93.05 smid"
+, author =      "B. Becker and P. G. Franciosa and S. Gschwind and S. Leonardi and T. Ohler and P. Widmayer"
+, title =       "Approximating a set of objects by two minimum area rectangles"
+, type =        "Technical {Report}"
+, number =      "21.92"
+, institution = "Dept. Inform. Sistem., Univ. Roma La Sapienza"
+, address =     "Rome, Italy"
+, year =        1992
+, update =      "97.03 smid, 95.05 franciosa, 94.09 franciosa, 93.05 smid"
 }
 
 @article{bfglow-esotm-96
-, author =	"B. Becker and P. G. Franciosa and S. Gschwind and S. Leonardi and T. Ohler and P. Widmayer"
-, title =	"Enclosing a set of objects by two minimum area rectangles"
-, journal =	"J. Algorithms"
-, volume =	21
-, year =	1996
-, pages =	"520--541"
-, update =	"97.03 smid"
+, author =      "B. Becker and P. G. Franciosa and S. Gschwind and S. Leonardi and T. Ohler and P. Widmayer"
+, title =       "Enclosing a set of objects by two minimum area rectangles"
+, journal =     "J. Algorithms"
+, volume =      21
+, year =        1996
+, pages =       "520--541"
+, update =      "97.03 smid"
 }
 
 @techreport{bfgotw-oaasr-91t
-, author =	"B. Becker and P. G. Franciosa and S. Gschwind and T. Ohler and G. Thiemt and P. Widmayer"
-, title =	"An optimal algorithm for approximating a set of rectangles by two minimum area rectangles"
-, type =	"Technical {Report}"
-, number =	35
-, institution =	"Inst. Inform., Univ. Freiburg"
-, address =	"Freiburg, Germany"
-, year =	1991
-, update =	"93.05 smid"
+, author =      "B. Becker and P. G. Franciosa and S. Gschwind and T. Ohler and G. Thiemt and P. Widmayer"
+, title =       "An optimal algorithm for approximating a set of rectangles by two minimum area rectangles"
+, type =        "Technical {Report}"
+, number =      35
+, institution = "Inst. Inform., Univ. Freiburg"
+, address =     "Freiburg, Germany"
+, year =        1991
+, update =      "93.05 smid"
 }
 
 @inproceedings{bfgotw-oaasr-91i
-, author =	"Bruno Becker and Paolo Giulio Franciosa and Stephan Gschwind and Thomas Ohler and Gerald Thiemt and Peter Widmayer"
-, title =	"An optimal algorithm for approximating a set of rectangles by two minimum area rectangles"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"13--25"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Bruno Becker and Paolo Giulio Franciosa and Stephan Gschwind and Thomas Ohler and Gerald Thiemt and Peter Widmayer"
+, title =       "An optimal algorithm for approximating a set of rectangles by two minimum area rectangles"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "13--25"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{bfgotw-embop-92
-, author =	"B. Becker and P. G. Franciosa and S. Gschwind and T. Ohler and G. Thiemt and P. Widmayer"
-, title =	"Enclosing many boxes by an optimal pair of boxes"
-, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	577
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"475--486"
+, author =      "B. Becker and P. G. Franciosa and S. Gschwind and T. Ohler and G. Thiemt and P. Widmayer"
+, title =       "Enclosing many boxes by an optimal pair of boxes"
+, booktitle =   "Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      577
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "475--486"
 }
 
 @techreport{bh-olpg-83
-, author =	"B. Becker and G. Hotz"
-, title =	"On the optimal layout of planar graphs"
-, type =	"Report"
-, number =	"SFB 124 B1"
-, institution =	"Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1983
+, author =      "B. Becker and G. Hotz"
+, title =       "On the optimal layout of planar graphs"
+, type =        "Report"
+, number =      "SFB 124 B1"
+, institution = "Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1983
 }
 
 @article{bh-olpgf-87
-, author =	"B. Becker and G. Hotz"
-, title =	"On The Optimal Layout of Planar Graphs with Fixed Boundary"
-, journal =	"SIAM J. Comput."
-, volume =	16
-, number =	5
-, year =	1987
-, pages =	"946--972"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "B. Becker and G. Hotz"
+, title =       "On The Optimal Layout of Planar Graphs with Fixed Boundary"
+, journal =     "SIAM J. Comput."
+, volume =      16
+, number =      5
+, year =        1987
+, pages =       "946--972"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{bo-lwbl-87
-, author =	"B. Becker and H. G. Osthof"
-, title =	"Layout with Wires of Balanced Length"
-, journal =	"Inform. Comput."
-, volume =	73
-, year =	1987
-, pages =	"45--58"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "B. Becker and H. G. Osthof"
+, title =       "Layout with Wires of Balanced Length"
+, journal =     "Inform. Comput."
+, volume =      73
+, year =        1987
+, pages =       "45--58"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{bo-lwbl-84
-, author =	"B. Becker and H. G. Osthof"
-, title =	"Layouts with wires of balanced length"
-, type =	"Report"
-, number =	"??"
-, institution =	"Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1984
+, author =      "B. Becker and H. G. Osthof"
+, title =       "Layouts with wires of balanced length"
+, type =        "Report"
+, number =      "??"
+, institution = "Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1984
 }
 
 @inproceedings{bsw-spsat-91
-, author =	"B. Becker and H. W. Six and P. Widmayer"
-, title =	"Spatial priority search: {An} access technique for scaleless maps"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1991
-, pages =	"128--138"
-, update =	"97.07 agarwal"
+, author =      "B. Becker and H. W. Six and P. Widmayer"
+, title =       "Spatial priority search: {An} access technique for scaleless maps"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1991
+, pages =       "128--138"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{bw-mvl-90
-, author =	"Bruno Becker and Peter Widmayer"
-, title =	"{Ma{\ss}stabsunabh{\"a}ngige} {Verwaltung} von {Landkarten}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	5
-, update =	"00.03 bibrelex"
+, author =      "Bruno Becker and Peter Widmayer"
+, title =       "{Ma{\ss}stabsunabh{\"a}ngige} {Verwaltung} von {Landkarten}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       5
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{bkss-rtera-90
-, author =	"N. Beckmann and H.-P. Kriegel and R. Schneider and B. Seeger"
-, title =	"The {R$^*$}-tree: {An} efficient and robust access method for points and rectangles"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1990
-, pages =	"322--331"
-, update =	"97.07 agarwal, 95.01 mitchell"
+, author =      "N. Beckmann and H.-P. Kriegel and R. Schneider and B. Seeger"
+, title =       "The {R$^*$}-tree: {An} efficient and robust access method for points and rectangles"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1990
+, pages =       "322--331"
+, update =      "97.07 agarwal, 95.01 mitchell"
 }
 
 @phdthesis{b-msvav-92
-, author =	"B. B. Bederson"
-, title =	"A miniature space-variant active vision system: {Cortex}-{I}"
-, school =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "B. B. Bederson"
+, title =       "A miniature space-variant active vision system: {Cortex}-{I}"
+, school =      "Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @book{bbf-fmg-86
-, author =	"Behnke and Bachmann and Fladt"
-, title =	"Fundamentals of mathematics, geometry"
-, volume =	1
-, publisher =	"MIT Press"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "Behnke and Bachmann and Fladt"
+, title =       "Fundamentals of mathematics, geometry"
+, volume =      1
+, publisher =   "MIT Press"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @article{b-udkuu-38
-, author =	"F. Behrend"
-, title =	"{\"U}ber die kleinste umbeschriebene und die gr{\"o}{\ss}te einbeschriebene {Ellipse} eines konvexen {Bereiches}"
-, journal =	"Math. Ann."
-, volume =	115
-, year =	1938
-, pages =	"379--411"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "F. Behrend"
+, title =       "{\"U}ber die kleinste umbeschriebene und die gr{\"o}{\ss}te einbeschriebene {Ellipse} eines konvexen {Bereiches}"
+, journal =     "Math. Ann."
+, volume =      115
+, year =        1938
+, pages =       "379--411"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @mastersthesis{b-azede-90
-, author =	"B. Behrends"
-, title =	"Algorithmen zur {Erkennung} der $\epsilon$-{Kongruenz} von {Punktmengen} und {Polygonen}"
-, school =	"Freie Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, year =	1990
-, note =	"Diploma Thesis"
-, keywords =	"master thesis"
-, update =	"97.11 bibrelex"
+, author =      "B. Behrends"
+, title =       "Algorithmen zur {Erkennung} der $\epsilon$-{Kongruenz} von {Punktmengen} und {Polygonen}"
+, school =      "Freie Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, year =        1990
+, note =        "Diploma Thesis"
+, keywords =    "master thesis"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{b-fs-94
-, author =	"Uwe Behrens"
-, title =	"Fence Shading"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"404--409"
-, keywords =	"Gouraud shading, Phong shading"
-, update =	"94.09 heckbert"
-, annote =	"Proposes an approach halfway between Gouraud shading and
+, author =      "Uwe Behrens"
+, title =       "Fence Shading"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "404--409"
+, keywords =    "Gouraud shading, Phong shading"
+, update =      "94.09 heckbert"
+, annote =      "Proposes an approach halfway between Gouraud shading and
 Phong shading: shade along the edges of the polygon, but interpolate across
 the interior. Contains pseudocode."
 }
 
 @inproceedings{bs-rptsa-90
-, author =	"I. Beichl and F. Sullivan"
-, title =	"A robust parallel triangulation and shelling algorithm"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"107--111"
-, cites =	"bm-sdcs-71, dk-rtdpm-78, s-chdch-86, s-imc-73, ygkm-mdidq-, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "I. Beichl and F. Sullivan"
+, title =       "A robust parallel triangulation and shelling algorithm"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "107--111"
+, cites =       "bm-sdcs-71, dk-rtdpm-78, s-chdch-86, s-imc-73, ygkm-mdidq-, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bg-sos-87
-, author =	"R. Beigel and J. Gill"
-, title =	"Sorting $n$ Objects with a $k$-sorter"
-, institution =	"The John Hopkins University"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "R. Beigel and J. Gill"
+, title =       "Sorting $n$ Objects with a $k$-sorter"
+, institution = "The John Hopkins University"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{b-onasc-89
-, author =	"W. Bein"
-, title =	"An ${O}(n\log n)$ algorithm for a special class of linear programs"
-, journal =	"Computing"
-, volume =	42
-, year =	1989
-, pages =	"309--313"
-, keywords =	"linear programming"
-, update =	"95.05 korneenko"
+, author =      "W. Bein"
+, title =       "An ${O}(n\log n)$ algorithm for a special class of linear programs"
+, journal =     "Computing"
+, volume =      42
+, year =        1989
+, pages =       "309--313"
+, keywords =    "linear programming"
+, update =      "95.05 korneenko"
 }
 
 @misc{blp-despp-92
-, author =	"W. Bein and L. Larmore and J. Park"
-, title =	"The $d$-edge shortest-path problem for a {Monge} graph"
-, year =	1992
-, note =	"Preprint"
-, update =	"98.03 bibrelex"
+, author =      "W. Bein and L. Larmore and J. Park"
+, title =       "The $d$-edge shortest-path problem for a {Monge} graph"
+, year =        1992
+, note =        "Preprint"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bs-ilmth-98
-, author =	"Ronald Beirouti and Jack Snoeyink"
-, title =	"Implementations of the LMT Heuristic for Minimum Weight Triangulations"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"96--105"
-, update =	"01.11 pocchiola"
+, author =      "Ronald Beirouti and Jack Snoeyink"
+, title =       "Implementations of the LMT Heuristic for Minimum Weight Triangulations"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "96--105"
+, update =      "01.11 pocchiola"
 }
 
 @article{b-tcil-77
-, author =	"D. E. Bell"
-, title =	"A theorem concerning integer lattice"
-, journal =	"Studies Appl. Math."
-, volume =	56
-, number =	2
-, year =	1977
-, pages =	"187--188"
-, keywords =	"discrete geometry, linear programming"
-, update =	"95.05 korneenko"
+, author =      "D. E. Bell"
+, title =       "A theorem concerning integer lattice"
+, journal =     "Studies Appl. Math."
+, volume =      56
+, number =      2
+, year =        1977
+, pages =       "187--188"
+, keywords =    "discrete geometry, linear programming"
+, update =      "95.05 korneenko"
 }
 
 @article{bhm-dghp-89
-, author =	"S. B. M. Bell and F. C. Hobroyd and D. C. Masa"
-, title =	"A digital geometry of hexagonal pixels"
-, journal =	"Image Vision Comput."
-, volume =	7
-, number =	3
-, year =	1989
-, pages =	"194--204"
-, keywords =	"digital geometry"
-, update =	"95.05 korneenko"
+, author =      "S. B. M. Bell and F. C. Hobroyd and D. C. Masa"
+, title =       "A digital geometry of hexagonal pixels"
+, journal =     "Image Vision Comput."
+, volume =      7
+, number =      3
+, year =        1989
+, pages =       "194--204"
+, keywords =    "digital geometry"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bglr-epcpa-93
-, author =	"M. Bellare and S. Goldwasser and C. Lund and A. Russel"
-, title =	"Efficient probabilistically checkable proofs and applications to approximation"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"294--304"
-, update =	"97.11 bibrelex"
+, author =      "M. Bellare and S. Goldwasser and C. Lund and A. Russel"
+, title =       "Efficient probabilistically checkable proofs and applications to approximation"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "294--304"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bs-inar-94
-, author =	"M. Bellare and M. Sudan"
-, title =	"Improved non-approximability results"
-, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	"184--193"
-, update =	"97.07 agarwal"
+, author =      "M. Bellare and M. Sudan"
+, title =       "Improved non-approximability results"
+, booktitle =   "Proc. 26th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       "184--193"
+, update =      "97.07 agarwal"
 }
 
 @mastersthesis{b-ctcsp-91
-, author =	"Patrice Belleville"
-, title =	"Computing two-covers of simple polygons"
-, school =	"School of Computer Science, McGill University"
-, year =	1991
-, keywords =	"master thesis"
+, author =      "Patrice Belleville"
+, title =       "Computing two-covers of simple polygons"
+, school =      "School of Computer Science, McGill University"
+, year =        1991
+, keywords =    "master thesis"
 }
 
 @inproceedings{b-cchd-95
-, author =	"Patrice Belleville"
-, title =	"Convex Covers in Higher Dimensions"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"145--150"
-, update =	"95.09 jones"
+, author =      "Patrice Belleville"
+, title =       "Convex Covers in Higher Dimensions"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "145--150"
+, update =      "95.09 jones"
 }
 
 @inproceedings{b-rbcct-93
-, author =	"P. Belleville"
-, title =	"On restricted boundary covers and convex three-covers"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"467--472"
-, cites =	"ghlst-ltavs-87, h-fvgsp-87, o-agta-87, s-rutcp-93, cr-cpih-88, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "P. Belleville"
+, title =       "On restricted boundary covers and convex three-covers"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "467--472"
+, cites =       "ghlst-ltavs-87, h-fvgsp-87, o-agta-87, s-rutcp-93, cr-cpih-88, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{b-ppmih-91
-, author =	"P. Belleville"
-, title =	"Probing polygons minimally is hard"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"50--53"
-, cites =	"gj-cigtn-79, l-aiorp-88, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. Belleville"
+, title =       "Probing polygons minimally is hard"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "50--53"
+, cites =       "gj-cigtn-79, l-aiorp-88, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{b-tgsp-92
-, author =	"P. Belleville"
-, title =	"Two-guarding simple polygons"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"103--108"
-, cites =	"b-ctcsp-91, ghlst-ltavs-87, h-fuenl-89, o-agta-87, s-rutcp-93, s-rrag-92, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. Belleville"
+, title =       "Two-guarding simple polygons"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "103--108"
+, cites =       "b-ctcsp-91, ghlst-ltavs-87, h-fuenl-89, o-agta-87, s-rutcp-93, s-rrag-92, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bbcuz-kgpp-94
-, author =	"P. Belleville and P. Bose and J. Czyzowicz and J. Urrutia and J. Zaks"
-, title =	"$k$-Guarding Polygons on the Plane"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"381--386"
-, cites =	"bglosu-fp-93, c-ctpg-75, cruz-grag, cru-ofipt-93, f-icd-77, f-spcwt-78, o-agta-87, fru-lsoso-92, h-mg-76, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "P. Belleville and P. Bose and J. Czyzowicz and J. Urrutia and J. Zaks"
+, title =       "$k$-Guarding Polygons on the Plane"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "381--386"
+, cites =       "bglosu-fp-93, c-ctpg-75, cruz-grag, cru-ofipt-93, f-icd-77, f-spcwt-78, o-agta-87, fru-lsoso-92, h-mg-76, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{bkms-cetaa-96
-, author =	"Patrice Belleville and Mark Keil and Michael McAllister and Jack Snoeyink"
-, title =	"On computing edges that are in all minimum-weight triangulations"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"V7--V8"
-, cites =	"aatr-tin-95, bde-danmw-96t, dm-ucsmw-96, k-mtpd-80, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Patrice Belleville and Mark Keil and Michael McAllister and Jack Snoeyink"
+, title =       "On computing edges that are in all minimum-weight triangulations"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "V7--V8"
+, cites =       "aatr-tin-95, bde-danmw-96t, dm-ucsmw-96, k-mtpd-80, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @techreport{bs-ppmh-91
-, author =	"P. Belleville and T. Shermer"
-, title =	"Probing polygons minimially is hard"
-, type =	"Technical {Report}"
-, number =	"91-12"
-, institution =	"Dept. Comput. Sci., Simon Fraser Univ."
-, address =	"Burnaby, BC"
-, month =	dec
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "P. Belleville and T. Shermer"
+, title =       "Probing polygons minimially is hard"
+, type =        "Technical {Report}"
+, number =      "91-12"
+, institution = "Dept. Comput. Sci., Simon Fraser Univ."
+, address =     "Burnaby, BC"
+, month =       dec
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @article{bs-ppmih-93
-, author =	"P. Belleville and T. C. Shermer"
-, title =	"Probing Polygons Minimally is Hard"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	5
-, month =	mar
-, year =	1993
-, pages =	"255--265"
-, update =	"93.09 held+milone+mitchell"
+, author =      "P. Belleville and T. C. Shermer"
+, title =       "Probing Polygons Minimally is Hard"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      5
+, month =       mar
+, year =        1993
+, pages =       "255--265"
+, update =      "93.09 held+milone+mitchell"
 }
 
 @book{b-dp-87
-, author =	"R. E. Bellman"
-, title =	"Dynamic Programming"
-, publisher =	"Princeton University Press"
-, address =	"Princeton, NJ"
-, year =	1987
+, author =      "R. E. Bellman"
+, title =       "Dynamic Programming"
+, publisher =   "Princeton University Press"
+, address =     "Princeton, NJ"
+, year =        1987
 }
 
 @article{br-cfssl-69
-, author =	"R. E. Bellman and R. S. Roth"
-, title =	"Curve fitting by segmented straight lines"
-, journal =	"American Statistical Association Journal"
-, volume =	64
-, year =	1969
-, pages =	"1079--1084"
-, update =	"96.09 orourke"
+, author =      "R. E. Bellman and R. S. Roth"
+, title =       "Curve fitting by segmented straight lines"
+, journal =     "American Statistical Association Journal"
+, volume =      64
+, year =        1969
+, pages =       "1079--1084"
+, update =      "96.09 orourke"
 }
 
 @book{br-matmm-86
-, author =	"R. E. Bellman and R. S. Roth"
-, title =	"Methods in Approximation: Techniques for Mathematical Modelling"
-, publisher =	"D.~Reidel Publishing Co."
-, address =	"Boston"
-, year =	1986
-, update =	"96.09 orourke"
+, author =      "R. E. Bellman and R. S. Roth"
+, title =       "Methods in Approximation: Techniques for Mathematical Modelling"
+, publisher =   "D.~Reidel Publishing Co."
+, address =     "Boston"
+, year =        1986
+, update =      "96.09 orourke"
 }
 
 @article{bbdr-msdtc-00
-, author =	"A. Below and U. Brehm and J. A. {De Loera} and J. Richter-Gebert"
-, title =	"Minimal simplicial dissections and triangulations of convex 3-polytopes"
-, journal =	"Discrete Comput. Geom."
-, volume =	24
-, year =	2000
-, pages =	"35--48"
-, update =	"01.04 orourke"
+, author =      "A. Below and U. Brehm and J. A. {De Loera} and J. Richter-Gebert"
+, title =       "Minimal simplicial dissections and triangulations of convex 3-polytopes"
+, journal =     "Discrete Comput. Geom."
+, volume =      24
+, year =        2000
+, pages =       "35--48"
+, update =      "01.04 orourke"
 }
 
 @unpublished{bdr-cfst-00
-, author =	"A. Below and J. A. {De Loera} and J. Richter-Gebert"
-, title =	"The complexity of finding small triangulations of convex 3-polytopes"
-, year =	2000
-, note =	"Manuscript. \url{http://www.inf.ethz.ch/personal/richter/}"
-, update =	"01.04 orourke"
+, author =      "A. Below and J. A. {De Loera} and J. Richter-Gebert"
+, title =       "The complexity of finding small triangulations of convex 3-polytopes"
+, year =        2000
+, note =        "Manuscript. \url{http://www.inf.ethz.ch/personal/richter/}"
+, update =      "01.04 orourke"
 }
 
 @article{bft-crup-01
-, author =	"A. Bemporad and K. Fukuda and F. D. Torrisi"
-, title =	"Convexity recognition of the union of polyhedra"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	18
-, year =	2001
-, pages =	"141--154"
-, update =	"01.07 smid"
+, author =      "A. Bemporad and K. Fukuda and F. D. Torrisi"
+, title =       "Convexity recognition of the union of polyhedra"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      18
+, year =        2001
+, pages =       "141--154"
+, update =      "01.07 smid"
 }
 
 @inproceedings{b-lbara-95
-, author =	"Amir M. Ben-Amram"
-, title =	"Lower Bounds on Algebraic Random Access Machines"
-, booktitle =	"Proc. 22nd Internat. Colloq. Automata Lang. Prog."
-, nickname =	"ICALP '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	944
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"360--371"
-, update =	"97.07 agarwal"
-, abstract =	"The method of proving lower bounds for decision
+, author =      "Amir M. Ben-Amram"
+, title =       "Lower Bounds on Algebraic Random Access Machines"
+, booktitle =   "Proc. 22nd Internat. Colloq. Automata Lang. Prog."
+, nickname =    "ICALP '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      944
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "360--371"
+, update =      "97.07 agarwal"
+, abstract =    "The method of proving lower bounds for decision
                  problems by topological component counting,
                  previously used with respect to algebraic computation
                  trees, is extended in this work to random access
@@ -17594,1363 +17594,1363 @@ @inproceedings{b-lbara-95
 }
 
 @article{b-wipm-95
-, author =	"Amir M. Ben-Amram"
-, title =	"What is a ``Pointer Machine''?"
-, journal =	"SIGACT News"
-, volume =	26
-, year =	1995
-, pages =	"88--95"
-, update =	"97.07 agarwal"
+, author =      "Amir M. Ben-Amram"
+, title =       "What is a ``Pointer Machine''?"
+, journal =     "SIGACT News"
+, volume =      26
+, year =        1995
+, pages =       "88--95"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{bbktw-prola-90
-, author =	"S. Ben-David and A. Borodin and R. Karp and G. Tardos and A. Wigderson"
-, title =	"On the Power of Randomization in On-Line Algorithms"
-, booktitle =	"Proc. 22th Annu. ACM Sympos. Theory Comput."
-, year =	1990
-, pages =	"379--386"
-, update =	"94.05 franciosa"
+, author =      "S. Ben-David and A. Borodin and R. Karp and G. Tardos and A. Wigderson"
+, title =       "On the Power of Randomization in On-Line Algorithms"
+, booktitle =   "Proc. 22th Annu. ACM Sympos. Theory Comput."
+, year =        1990
+, pages =       "379--386"
+, update =      "94.05 franciosa"
 }
 
 @inproceedings{bk-adspp-01
-, author =	"Boaz Ben-Moshe and Matthew J. Katz"
-, title =	"Approximating the Diameter of a Set of Points in the Presence of Rectangular Obstacles"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"154--157"
-, update =	"01.04 icking"
+, author =      "Boaz Ben-Moshe and Matthew J. Katz"
+, title =       "Approximating the Diameter of a Set of Points in the Presence of Rectangular Obstacles"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "154--157"
+, update =      "01.04 icking"
 }
 
 @article{bks-oflcs-00
-, author =	"B. Ben-Moshe and M. J. Katz and M. Segal"
-, title =	"Obnoxious facility location: complete service with minimal harm"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, year =	2000
-, pages =	"581--592"
-, update =	"01.04 smid"
+, author =      "B. Ben-Moshe and M. J. Katz and M. Segal"
+, title =       "Obnoxious facility location: complete service with minimal harm"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, year =        2000
+, pages =       "581--592"
+, update =      "01.04 smid"
 }
 
 @inproceedings{b-actcp-94
-, author =	"Michael Ben-Or"
-, title =	"Algebraic Computation Trees in Characteristic {$p>0$}"
-, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1994
-, pages =	"534--539"
-, update =	"97.03 agarwal"
+, author =      "Michael Ben-Or"
+, title =       "Algebraic Computation Trees in Characteristic {$p>0$}"
+, booktitle =   "Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1994
+, pages =       "534--539"
+, update =      "97.03 agarwal"
 }
 
 @inproceedings{b-lbact-83
-, author =	"M. Ben-Or"
-, title =	"Lower bounds for algebraic computation trees"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
-, year =	1983
-, pages =	"80--86"
+, author =      "M. Ben-Or"
+, title =       "Lower bounds for algebraic computation trees"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Theory Comput."
+, year =        1983
+, pages =       "80--86"
 }
 
 @article{bkr-ceag-86
-, author =	"M. Ben-Or and D. Kozen and J. H. Reif"
-, title =	"The complexity of elementary algebra and geometry"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	32
-, year =	1986
-, pages =	"251--264"
+, author =      "M. Ben-Or and D. Kozen and J. H. Reif"
+, title =       "The complexity of elementary algebra and geometry"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      32
+, year =        1986
+, pages =       "251--264"
 }
 
 @article{bs-cht-90
-, author =	"Ben-Tzvi and D. and M. B. Sandler"
-, title =	"A Combinatorial Hough Transform"
-, journal =	"Pattern Recogn. Lett."
-, volume =	"??"
-, number =	11
-, year =	1990
-, pages =	"167--174"
-, update =	"98.07 bibrelex"
+, author =      "Ben-Tzvi and D. and M. B. Sandler"
+, title =       "A Combinatorial Hough Transform"
+, journal =     "Pattern Recogn. Lett."
+, volume =      "??"
+, number =      11
+, year =        1990
+, pages =       "167--174"
+, update =      "98.07 bibrelex"
 }
 
 @article{bd-rstod-86
-, author =	"H. Bendelt and A. Dress"
-, title =	"Reconstructing the shape of a tree from observed dissimilarity data"
-, journal =	"Adv. Appl. Math."
-, volume =	7
-, year =	1986
-, pages =	"309--343"
-, update =	"97.11 bibrelex"
+, author =      "H. Bendelt and A. Dress"
+, title =       "Reconstructing the shape of a tree from observed dissimilarity data"
+, journal =     "Adv. Appl. Math."
+, volume =      7
+, year =        1986
+, pages =       "309--343"
+, update =      "97.11 bibrelex"
 }
 
 @book{bo-ammse-78
-, author =	"C. M. Bender and S. A. Orszag"
-, title =	"Advanced mathematical methods for scientists and engineers"
-, series =	"International Series in Pure and Applied Mathematics"
-, publisher =	"McGraw-Hill"
-, year =	1978
-, update =	"98.03 bibrelex"
+, author =      "C. M. Bender and S. A. Orszag"
+, title =       "Advanced mathematical methods for scientists and engineers"
+, series =      "International Series in Pure and Applied Mathematics"
+, publisher =   "McGraw-Hill"
+, year =        1978
+, update =      "98.03 bibrelex"
 }
 
 @article{b-ame-74
-, author =	"E. A. Bender"
-, title =	"Asymptotic methods in enumeration"
-, journal =	"SIAM Rev."
-, volume =	16
-, number =	4
-, month =	oct
-, year =	1974
-, pages =	"485--515"
-, update =	"97.11 bibrelex"
+, author =      "E. A. Bender"
+, title =       "Asymptotic methods in enumeration"
+, journal =     "SIAM Rev."
+, volume =      16
+, number =      4
+, month =       oct
+, year =        1974
+, pages =       "485--515"
+, update =      "97.11 bibrelex"
 }
 
 @article{bcm-anlcg-90
-, author =	"E. A. Bender and E. R. Candfield and B. D. McKay"
-, title =	"The asymptotic number of labeled connected graphs with a given number of vertices and edges"
-, journal =	"Random Structures and Algorithms"
-, volume =	1
-, number =	2
-, year =	1990
-, pages =	"127--169"
-, update =	"97.11 bibrelex"
+, author =      "E. A. Bender and E. R. Candfield and B. D. McKay"
+, title =       "The asymptotic number of labeled connected graphs with a given number of vertices and edges"
+, journal =     "Random Structures and Algorithms"
+, volume =      1
+, number =      2
+, year =        1990
+, pages =       "127--169"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bf-lpr-00
-, author =	"M. A. Bender and M. Farach-Colton"
-, title =	"The {LCA} problem revisited"
-, booktitle =	"Proceedings of the 4th Latin American Symposium on Theoretical Informatics"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1776
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	2000
-, pages =	"88--94"
-, update =	"01.11 smid"
+, author =      "M. A. Bender and M. Farach-Colton"
+, title =       "The {LCA} problem revisited"
+, booktitle =   "Proceedings of the 4th Latin American Symposium on Theoretical Informatics"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1776
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        2000
+, pages =       "88--94"
+, update =      "01.11 smid"
 }
 
 @article{blr-bnccr-91
-, author =	"R. Benedetti and F. Loeser and J. J. Risler"
-, title =	"Bounding the number of connected components of a real algebraic set"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"191--209"
+, author =      "R. Benedetti and F. Loeser and J. J. Risler"
+, title =       "Bounding the number of connected components of a real algebraic set"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "191--209"
 }
 
 @book{br-rasas-90
-, author =	"R. Benedetti and J.-J. Risler"
-, title =	"Real algebraic and semi-algebraic sets"
-, series =	"Actualit{\'e}s math{\'e}matiques"
-, publisher =	"Hermann"
-, address =	"Paris"
-, year =	1990
-, update =	"00.03 bibrelex"
+, author =      "R. Benedetti and J.-J. Risler"
+, title =       "Real algebraic and semi-algebraic sets"
+, series =      "Actualit{\'e}s math{\'e}matiques"
+, publisher =   "Hermann"
+, address =     "Paris"
+, year =        1990
+, update =      "00.03 bibrelex"
 }
 
 @article{bh-ospp-95
-, author =	"M. Benelli and R. Hassin"
-, title =	"Optimal separable partitioning in the plane"
-, journal =	"Discrete Appl. Math."
-, volume =	59
-, year =	1995
-, pages =	"215--224"
-, keywords =	"bipartition, clustering, separation, optimization, diameter, Weber problem, convex hull"
-, update =	"95.09 mitchell"
+, author =      "M. Benelli and R. Hassin"
+, title =       "Optimal separable partitioning in the plane"
+, journal =     "Discrete Appl. Math."
+, volume =      59
+, year =        1995
+, pages =       "215--224"
+, keywords =    "bipartition, clustering, separation, optimization, diameter, Weber problem, convex hull"
+, update =      "95.09 mitchell"
 }
 
 @article{bn-ciimc-64
-, author =	"B.-E. Bengtsson and S. Norbeck"
-, title =	"Construction of isarithms and isarithmic maps by computers"
-, journal =	"BIT"
-, volume =	4
-, year =	1964
-, pages =	"87--105"
+, author =      "B.-E. Bengtsson and S. Norbeck"
+, title =       "Construction of isarithms and isarithmic maps by computers"
+, journal =     "BIT"
+, volume =      4
+, year =        1964
+, pages =       "87--105"
 }
 
 @inproceedings{b-rbasv-90
-, author =	"Daniel Benninger"
-, title =	"{R-B{\"a}ume} und {Abfragen} auf skalarwertigen {Vektorkarten}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	6
-, update =	"00.03 bibrelex"
+, author =      "Daniel Benninger"
+, title =       "{R-B{\"a}ume} und {Abfragen} auf skalarwertigen {Vektorkarten}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       6
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{bc-arstp-92
-, author =	"I. Bennour and J. Cloutier"
-, title =	"Approximation of the rectilinear {Steiner} tree problem with neural networks"
-, booktitle =	"Canadian Conf. on VLSI"
-, site =	"Halifax"
-, month =	oct
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "I. Bennour and J. Cloutier"
+, title =       "Approximation of the rectilinear {Steiner} tree problem with neural networks"
+, booktitle =   "Canadian Conf. on VLSI"
+, site =        "Halifax"
+, month =       oct
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{bjmm-lsicg-93
-, author =	"M. Benouamer and P. Jaillon and D. Michelucci and J.-M. Moreau"
-, title =	"A lazy solution to imprecision in computational geometry"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"73--78"
-, cites =	"bo-arcgi-79, c-fadsi-88, d-reidt-92, em-sstcd-88, fv-eeacg-93, gy-frcg-86, gss-egbra-89, si-cvd10-89, j-leair-93, k-sa-81, m-rfqcd-87, m-vigau-88p, m-dpggt-89, ml-csche-89, m-ia-66, m-fhrsg-90, otu-nsga-87, ps-cgi-85, ss-ccsm-85, ce-oails-88t, hns-saann-88, k-rmrs-89, kln-edtur-89, m-mdscg-84, y-gctsp-88, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "M. Benouamer and P. Jaillon and D. Michelucci and J.-M. Moreau"
+, title =       "A lazy solution to imprecision in computational geometry"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "73--78"
+, cites =       "bo-arcgi-79, c-fadsi-88, d-reidt-92, em-sstcd-88, fv-eeacg-93, gy-frcg-86, gss-egbra-89, si-cvd10-89, j-leair-93, k-sa-81, m-rfqcd-87, m-vigau-88p, m-dpggt-89, ml-csche-89, m-ia-66, m-fhrsg-90, otu-nsga-87, ps-cgi-85, ss-ccsm-85, ce-oails-88t, hns-saann-88, k-rmrs-89, kln-edtur-89, m-mdscg-84, y-gctsp-88, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @incollection{bllr-achmd-86
-, author =	"M. Benson and R. Larntz and M. Lavine and R. Regal"
-, title =	"The application of convex hulls in multiple dimensions"
-, booktitle =	"Computer Sci. and Statistics: Proc. 18th Sympos. on the Interface"
-, year =	1986
-, pages =	"297--301"
-, keywords =	"convex hull"
-, update =	"95.09 agarwal, 95.05 korneenko"
+, author =      "M. Benson and R. Larntz and M. Lavine and R. Regal"
+, title =       "The application of convex hulls in multiple dimensions"
+, booktitle =   "Computer Sci. and Statistics: Proc. 18th Sympos. on the Interface"
+, year =        1986
+, pages =       "297--301"
+, keywords =    "convex hull"
+, update =      "95.09 agarwal, 95.05 korneenko"
 }
 
 @book{b-egc-66
-, author =	"R. V. Benson"
-, title =	"Euclidean Geometry and Convexity"
-, publisher =	"McGraw-Hill"
-, address =	"New York, NY"
-, year =	1966
-, update =	"97.03 schwarzkopf"
+, author =      "R. V. Benson"
+, title =       "Euclidean Geometry and Convexity"
+, publisher =   "McGraw-Hill"
+, address =     "New York, NY"
+, year =        1966
+, update =      "97.03 schwarzkopf"
 }
 
 @article{bst-bst-85
-, author =	"S. W. Bent and D. D. Sleator and R. E. Tarjan"
-, title =	"Biased Search Trees"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"545--568"
-, update =	"96.01 tamassia"
+, author =      "S. W. Bent and D. D. Sleator and R. E. Tarjan"
+, title =       "Biased Search Trees"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "545--568"
+, update =      "96.01 tamassia"
 }
 
 @unpublished{b-akrp-77
-, author =	"J. Bentley"
-, title =	"Algorithms for {Klee's} rectangle problems"
-, year =	1977
-, note =	"unpublished manuscript, Dept. of Computer Science, Carnegie-Mellon University"
-, update =	"98.11 bibrelex"
+, author =      "J. Bentley"
+, title =       "Algorithms for {Klee's} rectangle problems"
+, year =        1977
+, note =        "unpublished manuscript, Dept. of Computer Science, Carnegie-Mellon University"
+, update =      "98.11 bibrelex"
 }
 
 @article{b-csaad-84
-, author =	"J. L. Bentley"
-, title =	"A case study in applied algorithm design"
-, journal =	"Computer"
-, volume =	17
-, year =	1984
-, pages =	"75--88"
+, author =      "J. L. Bentley"
+, title =       "A case study in applied algorithm design"
+, journal =     "Computer"
+, volume =      17
+, year =        1984
+, pages =       "75--88"
 }
 
 @techreport{b-stfrn-75
-, author =	"J. L. Bentley"
-, title =	"A survey of techniques for fixed radius near neighbor searching"
-, type =	"Report"
-, number =	"STAN-CS-78-513"
-, institution =	"Dept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1975
+, author =      "J. L. Bentley"
+, title =       "A survey of techniques for fixed radius near neighbor searching"
+, type =        "Report"
+, number =      "STAN-CS-78-513"
+, institution = "Dept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1975
 }
 
 @techreport{b-amn-78
-, author =	"J. L. Bentley"
-, title =	"Algorithms for multivariate nonparametrics"
-, type =	"Report"
-, number =	"CMU-CS-78-147"
-, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1978
+, author =      "J. L. Bentley"
+, title =       "Algorithms for multivariate nonparametrics"
+, type =        "Report"
+, number =      "CMU-CS-78-147"
+, institution = "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1978
 }
 
 @article{b-dsp-79
-, author =	"J. L. Bentley"
-, title =	"Decomposable searching problems"
-, journal =	"Inform. Process. Lett."
-, volume =	8
-, year =	1979
-, pages =	"244--251"
+, author =      "J. L. Bentley"
+, title =       "Decomposable searching problems"
+, journal =     "Inform. Process. Lett."
+, volume =      8
+, year =        1979
+, pages =       "244--251"
 }
 
 @phdthesis{b-dcacp-76
-, author =	"J. L. Bentley"
-, title =	"Divide-and-conquer algorithms for closest point problems in multidimensional space"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. North Carolina"
-, address =	"Chapel Hill, NC"
-, year =	1976
-, note =	"Report TR-76-103"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "J. L. Bentley"
+, title =       "Divide-and-conquer algorithms for closest point problems in multidimensional space"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. North Carolina"
+, address =     "Chapel Hill, NC"
+, year =        1976
+, note =        "Report TR-76-103"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @inproceedings{b-etsh-90
-, author =	"J. L. Bentley"
-, title =	"Experiments on traveling salesman heuristics"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, site =	"San Francisco, CA"
-, month =	jan
-, year =	1990
-, pages =	"91--99"
-, update =	"98.07 bibrelex"
+, author =      "J. L. Bentley"
+, title =       "Experiments on traveling salesman heuristics"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, site =        "San Francisco, CA"
+, month =       jan
+, year =        1990
+, pages =       "91--99"
+, update =      "98.07 bibrelex"
 }
 
 @article{b-fagts-92
-, author =	"Jon Louis Bentley"
-, title =	"Fast Algorithms for Geometric Traveling Salesman Problems"
-, journal =	"ORSA J. Comput."
-, volume =	4
-, number =	4
-, year =	1992
-, pages =	"387--411"
-, update =	"98.03 mitchell"
-, annote =	"Special issue on computational geometry; J. Mitchell and
+, author =      "Jon Louis Bentley"
+, title =       "Fast Algorithms for Geometric Traveling Salesman Problems"
+, journal =     "ORSA J. Comput."
+, volume =      4
+, number =      4
+, year =        1992
+, pages =       "387--411"
+, update =      "98.03 mitchell"
+, annote =      "Special issue on computational geometry; J. Mitchell and
                   J. Karel Lenstra, eds."
 }
 
 @inproceedings{b-kdtsp-90
-, author =	"J. L. Bentley"
-, title =	"{$K$}-d trees for semidynamic point sets"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"187--197"
-, cites =	"ahu-daca-74, b-mbstu-75, b-etsh-90, b-fagts-92, bs-dcms-76, bwy-oetac-80, fr-etbs-75, fbf-afbml-77, lw-wcarp-77, m-mdscg-84, pb-wcann-80t, ps-cgi-85, s-a-88, s-rnnsk-88, s-cpl-86, z-tcg-78, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "J. L. Bentley"
+, title =       "{$K$}-d trees for semidynamic point sets"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "187--197"
+, cites =       "ahu-daca-74, b-mbstu-75, b-etsh-90, b-fagts-92, bs-dcms-76, bwy-oetac-80, fr-etbs-75, fbf-afbml-77, lw-wcarp-77, m-mdscg-84, pb-wcann-80t, ps-cgi-85, s-a-88, s-rnnsk-88, s-cpl-86, z-tcg-78, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-mbstd-79
-, author =	"J. L. Bentley"
-, title =	"Multidimensional binary search trees in database applications"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	"SE-5"
-, year =	1979
-, pages =	"333--340"
+, author =      "J. L. Bentley"
+, title =       "Multidimensional binary search trees in database applications"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      "SE-5"
+, year =        1979
+, pages =       "333--340"
 }
 
 @article{b-mbstu-75
-, author =	"J. L. Bentley"
-, title =	"Multidimensional binary search trees used for associative searching"
-, journal =	"Commun. ACM"
-, volume =	18
-, number =	9
-, month =	sep
-, year =	1975
-, pages =	"509--517"
-, update =	"98.11 bibrelex"
+, author =      "J. L. Bentley"
+, title =       "Multidimensional binary search trees used for associative searching"
+, journal =     "Commun. ACM"
+, volume =      18
+, number =      9
+, month =       sep
+, year =        1975
+, pages =       "509--517"
+, update =      "98.11 bibrelex"
 }
 
 @article{b-mdc-80
-, author =	"J. L. Bentley"
-, title =	"Multidimensional divide-and-conquer"
-, journal =	"Commun. ACM"
-, volume =	23
-, number =	4
-, year =	1980
-, pages =	"214--229"
-, succeeds =	"bs-dcms-76"
+, author =      "J. L. Bentley"
+, title =       "Multidimensional divide-and-conquer"
+, journal =     "Commun. ACM"
+, volume =      23
+, number =      4
+, year =        1980
+, pages =       "214--229"
+, succeeds =    "bs-dcms-76"
 }
 
 @article{b-pqrr-79
-, author =	"J. L. Bentley"
-, title =	"Priority queues with range restriction"
-, journal =	"Bull. EATCS"
-, volume =	9
-, year =	1979
-, pages =	"7--8"
+, author =      "J. L. Bentley"
+, title =       "Priority queues with range restriction"
+, journal =     "Bull. EATCS"
+, volume =      9
+, year =        1979
+, pages =       "7--8"
 }
 
 @book{b-pp-85
-, author =	"J. L. Bentley"
-, title =	"Programming Pearls"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1985
-, update =	"00.03 bibrelex"
+, author =      "J. L. Bentley"
+, title =       "Programming Pearls"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1985
+, update =      "00.03 bibrelex"
 }
 
 @techreport{b-skrp-77
-, author =	"J. L. Bentley"
-, title =	"Solutions to {Klee}'s rectangle problems"
-, type =	"Technical Report"
-, institution =	"Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1977
-, update =	"97.03 schwarzkopf"
+, author =      "J. L. Bentley"
+, title =       "Solutions to {Klee}'s rectangle problems"
+, type =        "Technical Report"
+, institution = "Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1977
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{b-scfga-81
-, author =	"J. L. Bentley"
-, title =	"Squeezing constant factors of geometric algorithms"
-, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
-, year =	1981
-, pages =	"11--20"
+, author =      "J. L. Bentley"
+, title =       "Squeezing constant factors of geometric algorithms"
+, booktitle =   "Proc. 19th Allerton Conf. Commun. Control Comput."
+, year =        1981
+, pages =       "11--20"
 }
 
 @article{bb-hpmrd-76
-, author =	"J. L. Bentley and W. A. Burkhard"
-, title =	"Heuristics for partial-match retrieval data base design"
-, journal =	"Inform. Process. Lett."
-, volume =	4
-, year =	1976
-, pages =	"132--135"
+, author =      "J. L. Bentley and W. A. Burkhard"
+, title =       "Heuristics for partial-match retrieval data base design"
+, journal =     "Inform. Process. Lett."
+, volume =      4
+, year =        1976
+, pages =       "132--135"
 }
 
 @inproceedings{bc-atipp-80
-, author =	"J. L. Bentley and W. Carruthers"
-, title =	"Algorithms for testing the inclusion of points in polygons"
-, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
-, year =	1980
-, pages =	"11--19"
+, author =      "J. L. Bentley and W. Carruthers"
+, title =       "Algorithms for testing the inclusion of points in polygons"
+, booktitle =   "Proc. 18th Allerton Conf. Commun. Control Comput."
+, year =        1980
+, pages =       "11--19"
 }
 
 @inproceedings{bcl-fleta-90
-, author =	"J. L. Bentley and K. L. Clarkson and D. B. Levine"
-, title =	"Fast linear expected-time algorithms for computing maxima and convex hulls"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"179--187"
+, author =      "J. L. Bentley and K. L. Clarkson and D. B. Levine"
+, title =       "Fast linear expected-time algorithms for computing maxima and convex hulls"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "179--187"
 }
 
 @techreport{bfpp-tpcg-80
-, author =	"J. L. Bentley and G. M. Faust and C. H. Papadimitriou and F. P. Preparata"
-, title =	"Two papers on computational geometry"
-, type =	"Report"
-, number =	"CMU-CS-80-109"
-, institution =	"Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1980
+, author =      "J. L. Bentley and G. M. Faust and C. H. Papadimitriou and F. P. Preparata"
+, title =       "Two papers on computational geometry"
+, type =        "Report"
+, number =      "CMU-CS-80-109"
+, institution = "Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1980
 }
 
 @article{bfp-aach-82
-, author =	"J. L. Bentley and G. M. Faust and F. P. Preparata"
-, title =	"Approximation algorithms for convex hulls"
-, journal =	"Commun. ACM"
-, volume =	25
-, year =	1982
-, pages =	"64--68"
-, keywords =	"designing algorithms, convex hull, approximation, two-dimensional, worst-case analysis"
-, annote =	"$O(n)$ time"
+, author =      "J. L. Bentley and G. M. Faust and F. P. Preparata"
+, title =       "Approximation algorithms for convex hulls"
+, journal =     "Commun. ACM"
+, volume =      25
+, year =        1982
+, pages =       "64--68"
+, keywords =    "designing algorithms, convex hull, approximation, two-dimensional, worst-case analysis"
+, annote =      "$O(n)$ time"
 }
 
 @article{bf-dsrs-79
-, author =	"J. L. Bentley and J. H. Friedman"
-, title =	"Data structures for range searching"
-, journal =	"ACM Comput. Surv."
-, volume =	11
-, year =	1979
-, pages =	"397--409"
+, author =      "J. L. Bentley and J. H. Friedman"
+, title =       "Data structures for range searching"
+, journal =     "ACM Comput. Surv."
+, volume =      11
+, year =        1979
+, pages =       "397--409"
 }
 
 @article{bf-facms-78
-, author =	"J. L. Bentley and J. H. Friedman"
-, title =	"Fast algorithms for constructing minimal spanning trees in coordinate spaces"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-27"
-, year =	1978
-, pages =	"97--105"
+, author =      "J. L. Bentley and J. H. Friedman"
+, title =       "Fast algorithms for constructing minimal spanning trees in coordinate spaces"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-27"
+, year =        1978
+, pages =       "97--105"
 }
 
 @inproceedings{bhh-fgavt-81
-, author =	"J. L. Bentley and D. Haken and R. W. Hon"
-, title =	"Fast geometric algorithms for {VLSI} tasks"
-, booktitle =	"Proc. Comput. Conf."
-, year =	1981
-, pages =	"88--92"
+, author =      "J. L. Bentley and D. Haken and R. W. Hon"
+, title =       "Fast geometric algorithms for {VLSI} tasks"
+, booktitle =   "Proc. Comput. Conf."
+, year =        1981
+, pages =       "88--92"
 }
 
 @article{bkv-eccm-91
-, author =	"J. L. Bentley and B. Kernigham and C. {Van Wyk}"
-, title =	"An elementary {C} cost model"
-, journal =	"UNIX Review"
-, volume =	9
-, number =	2
-, year =	1991
-, pages =	"38--48"
-, update =	"98.03 bibrelex"
+, author =      "J. L. Bentley and B. Kernigham and C. {Van Wyk}"
+, title =       "An elementary {C} cost model"
+, journal =     "UNIX Review"
+, volume =      9
+, number =      2
+, year =        1991
+, pages =       "38--48"
+, update =      "98.03 bibrelex"
 }
 
 @article{bkst-anmsv-78
-, author =	"J. L. Bentley and H. T. Kung and M. Schkolnick and C. D. Thompson"
-, title =	"On the average number of maxima in a set of vectors and applications"
-, journal =	"J. ACM"
-, volume =	25
-, year =	1978
-, pages =	"536--543"
+, author =      "J. L. Bentley and H. T. Kung and M. Schkolnick and C. D. Thompson"
+, title =       "On the average number of maxima in a set of vectors and applications"
+, journal =     "J. ACM"
+, volume =      25
+, year =        1978
+, pages =       "536--543"
 }
 
 @article{bm-nenns-79
-, author =	"J. L. Bentley and H. A. Maurer"
-, title =	"A note on {Euclidean} near neighbor searching in the plane"
-, journal =	"Inform. Process. Lett."
-, volume =	8
-, year =	1979
-, pages =	"133--136"
+, author =      "J. L. Bentley and H. A. Maurer"
+, title =       "A note on {Euclidean} near neighbor searching in the plane"
+, journal =     "Inform. Process. Lett."
+, volume =      8
+, year =        1979
+, pages =       "133--136"
 }
 
 @article{bm-ewcds-80
-, author =	"J. L. Bentley and H. A. Maurer"
-, title =	"Efficient worst-case data structures for range searching"
-, journal =	"Acta Inform."
-, volume =	13
-, year =	1980
-, pages =	"155--168"
+, author =      "J. L. Bentley and H. A. Maurer"
+, title =       "Efficient worst-case data structures for range searching"
+, journal =     "Acta Inform."
+, volume =      13
+, year =        1980
+, pages =       "155--168"
 }
 
 @incollection{bow-cmhds-83
-, author =	"Jon Louis Bentley and Thomas Ottmann and Peter Widmayer"
-, title =	"The Complexity of Manipulating Hierarchically Defined Sets of Rectangles"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"127--158"
-, keywords =	"isothetic, rectangles, data structuring"
-, succeeds =	"bo-cmhds-82"
-, update =	"01.04 icking, 95.05 korneenko"
+, author =      "Jon Louis Bentley and Thomas Ottmann and Peter Widmayer"
+, title =       "The Complexity of Manipulating Hierarchically Defined Sets of Rectangles"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "127--158"
+, keywords =    "isothetic, rectangles, data structuring"
+, succeeds =    "bo-cmhds-82"
+, update =      "01.04 icking, 95.05 korneenko"
 }
 
 @article{bo-arcgi-79
-, author =	"J. L. Bentley and T. A. Ottmann"
-, title =	"Algorithms for reporting and counting geometric intersections"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-28"
-, number =	9
-, month =	sep
-, year =	1979
-, pages =	"643--647"
-, precedes =	"b-carcg-81"
-, update =	"98.11 bibrelex"
+, author =      "J. L. Bentley and T. A. Ottmann"
+, title =       "Algorithms for reporting and counting geometric intersections"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-28"
+, number =      9
+, month =       sep
+, year =        1979
+, pages =       "643--647"
+, precedes =    "b-carcg-81"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{bo-cmhds-82
-, author =	"J. L. Bentley and T. A. Ottmann"
-, title =	"The complexity of manipulating hierarchically defined sets of rectangles"
-, booktitle =	"Proc. 10th Internat. Sympos. Math. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	118
-, publisher =	"Springer-Verlag"
-, year =	1982
-, pages =	"1--15"
-, precedes =	"bow-cmhds-83"
-, update =	"95.05 korneenko"
+, author =      "J. L. Bentley and T. A. Ottmann"
+, title =       "The complexity of manipulating hierarchically defined sets of rectangles"
+, booktitle =   "Proc. 10th Internat. Sympos. Math. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      118
+, publisher =   "Springer-Verlag"
+, year =        1982
+, pages =       "1--15"
+, precedes =    "bow-cmhds-83"
+, update =      "95.05 korneenko"
 }
 
 @article{bs-avs-79
-, author =	"J. L. Bentley and J. B. Saxe"
-, title =	"Algorithms on vector sets"
-, journal =	"SIGACT News"
-, volume =	11
-, year =	1979
-, pages =	"36--39"
+, author =      "J. L. Bentley and J. B. Saxe"
+, title =       "Algorithms on vector sets"
+, journal =     "SIGACT News"
+, volume =      11
+, year =        1979
+, pages =       "36--39"
 }
 
 @inproceedings{bs-athet-80
-, author =	"J. L. Bentley and J. B. Saxe"
-, title =	"An analysis of two heuristics for the {Euclidean} traveling salesman problem"
-, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
-, year =	1980
-, pages =	"41--49"
+, author =      "J. L. Bentley and J. B. Saxe"
+, title =       "An analysis of two heuristics for the {Euclidean} traveling salesman problem"
+, booktitle =   "Proc. 18th Allerton Conf. Commun. Control Comput."
+, year =        1980
+, pages =       "41--49"
 }
 
 @article{bs-dsp1s-80
-, author =	"J. L. Bentley and J. B. Saxe"
-, title =	"Decomposable searching problems {I}: {S}tatic-to-dynamic transformations"
-, journal =	"J. Algorithms"
-, volume =	1
-, year =	1980
-, pages =	"301--358"
-, succeeds =	"sb-tsdsd-79"
-, update =	"00.11 smid, 96.05 agarwal"
+, author =      "J. L. Bentley and J. B. Saxe"
+, title =       "Decomposable searching problems {I}: {S}tatic-to-dynamic transformations"
+, journal =     "J. Algorithms"
+, volume =      1
+, year =        1980
+, pages =       "301--358"
+, succeeds =    "sb-tsdsd-79"
+, update =      "00.11 smid, 96.05 agarwal"
 }
 
 @inproceedings{bs-pmsad-77
-, author =	"J. L. Bentley and M. I. Shamos"
-, title =	"A problem in multivariate statistics: algorithm, data structure, and applications"
-, booktitle =	"Proc. 15th Allerton Conf. Commun. Control Comput."
-, year =	1977
-, pages =	"193--201"
+, author =      "J. L. Bentley and M. I. Shamos"
+, title =       "A problem in multivariate statistics: algorithm, data structure, and applications"
+, booktitle =   "Proc. 15th Allerton Conf. Commun. Control Comput."
+, year =        1977
+, pages =       "193--201"
 }
 
 @article{bs-dclet-78
-, author =	"J. L. Bentley and M. I. Shamos"
-, title =	"Divide-and-conquer for linear expected time"
-, journal =	"Inform. Process. Lett."
-, volume =	7
-, year =	1978
-, pages =	"87--91"
+, author =      "J. L. Bentley and M. I. Shamos"
+, title =       "Divide-and-conquer for linear expected time"
+, journal =     "Inform. Process. Lett."
+, volume =      7
+, year =        1978
+, pages =       "87--91"
 }
 
 @inproceedings{bs-dcms-76
-, author =	"J. L. Bentley and M. I. Shamos"
-, title =	"Divide-and-conquer in multidimensional space"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Theory Comput."
-, year =	1976
-, pages =	"220--230"
-, precedes =	"b-mdc-80"
+, author =      "J. L. Bentley and M. I. Shamos"
+, title =       "Divide-and-conquer in multidimensional space"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Theory Comput."
+, year =        1976
+, pages =       "220--230"
+, precedes =    "b-mdc-80"
 }
 
 @article{bs-arsqt-75
-, author =	"J. L. Bentley and D. F. Stanat"
-, title =	"Analysis of range searches in quad trees"
-, journal =	"Inform. Process. Lett."
-, volume =	3
-, year =	1975
-, pages =	"170--173"
+, author =      "J. L. Bentley and D. F. Stanat"
+, title =       "Analysis of range searches in quad trees"
+, journal =     "Inform. Process. Lett."
+, volume =      3
+, year =        1975
+, pages =       "170--173"
 }
 
 @article{bsw-cffrn-77
-, author =	"J. L. Bentley and D. F. Stanat and E. H. {William, Jr.}"
-, title =	"The complexity of finding fixed-radius near neighbors"
-, journal =	"Inform. Process. Lett."
-, volume =	6
-, year =	1977
-, pages =	"209--212"
+, author =      "J. L. Bentley and D. F. Stanat and E. H. {William, Jr.}"
+, title =       "The complexity of finding fixed-radius near neighbors"
+, journal =     "Inform. Process. Lett."
+, volume =      6
+, year =        1977
+, pages =       "209--212"
 }
 
 @article{bwy-oetac-80
-, author =	"J. L. Bentley and B. W. Weide and A. C. Yao"
-, title =	"Optimal expected-time algorithms for closest-point problems"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	6
-, year =	1980
-, pages =	"563--580"
+, author =      "J. L. Bentley and B. W. Weide and A. C. Yao"
+, title =       "Optimal expected-time algorithms for closest-point problems"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      6
+, year =        1980
+, pages =       "563--580"
 }
 
 @article{bw-owcar-80
-, author =	"J. L. Bentley and D. Wood"
-, title =	"An optimal worst case algorithm for reporting intersections of rectangles"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-29"
-, year =	1980
-, pages =	"571--577"
+, author =      "J. L. Bentley and D. Wood"
+, title =       "An optimal worst case algorithm for reporting intersections of rectangles"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-29"
+, year =        1980
+, pages =       "571--577"
 }
 
 @inproceedings{bbmmt-hmgd-95
-, author =	"Steven Benzley and Ted D. Blacker and Scott A. Mitchell and Peter Murdoch and Timothy J. Tautges"
-, title =	"Hexahedral Mesh Generation via the Dual"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C4--C5"
-, cites =	"rt-gcphg-84, mbbm-cbmrc-, tmb-cbmrc-, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex, 95.09 mitchell"
+, author =      "Steven Benzley and Ted D. Blacker and Scott A. Mitchell and Peter Murdoch and Timothy J. Tautges"
+, title =       "Hexahedral Mesh Generation via the Dual"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C4--C5"
+, cites =       "rt-gcphg-84, mbbm-cbmrc-, tmb-cbmrc-, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{bpmcs-cahat-95
-, author =	"Steven E. Benzley and Ernest Perry and Karl Merkley and Brett Clark and Gregory D. Sjaardema"
-, title =	"A Comparison of All Hexagonal and All Tetrahedral Finite Element Meshes for Elastic and Elasto-plastic Analysis"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"179--192"
-, update =	"96.01 samitchell"
+, author =      "Steven E. Benzley and Ernest Perry and Karl Merkley and Brett Clark and Gregory D. Sjaardema"
+, title =       "A Comparison of All Hexagonal and All Tetrahedral Finite Element Meshes for Elastic and Elasto-plastic Analysis"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "179--192"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{bbbkk-fpssm-97
-, author =	"S. Berchtold and C. B{\"o}hm and B. Barunm{\"u}ller and D. A. Keim and H.-P. Kriegel"
-, title =	"Fast parallel similarity search in multimedia databases"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1997
-, pages =	"1--12"
-, update =	"97.07 agarwal"
+, author =      "S. Berchtold and C. B{\"o}hm and B. Barunm{\"u}ller and D. A. Keim and H.-P. Kriegel"
+, title =       "Fast parallel similarity search in multimedia databases"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1997
+, pages =       "1--12"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{bbkk-cmnns-97
-, author =	"S. Berchtold and C. B{\"o}hm and D. A. Keim and H.-P. Kriegel"
-, title =	"A cost model for nearest neighbor search in high-dimensional data space"
-, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
-, year =	1997
-, pages =	"78--86"
-, update =	"97.07 agarwal"
+, author =      "S. Berchtold and C. B{\"o}hm and D. A. Keim and H.-P. Kriegel"
+, title =       "A cost model for nearest neighbor search in high-dimensional data space"
+, booktitle =   "Proc. Annu. ACM Sympos. Principles Database Syst."
+, year =        1997
+, pages =       "78--86"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{bkk-xtish-96
-, author =	"S. Berchtold and D. A. Keim and H.-P. Kriegel"
-, title =	"The {X}-tree: {A}n index structure for higher dimensional data"
-, booktitle =	"Proc. 22th VLDB Conference"
-, year =	1996
-, pages =	"28--39"
-, update =	"97.07 agarwal"
+, author =      "S. Berchtold and D. A. Keim and H.-P. Kriegel"
+, title =       "The {X}-tree: {A}n index structure for higher dimensional data"
+, booktitle =   "Proc. 22th VLDB Conference"
+, year =        1996
+, pages =       "28--39"
+, update =      "97.07 agarwal"
 }
 
 @article{bl-ndsls-88
-, author =	"C. A. Berenstein and D. Lavine"
-, title =	"On the number of digital straight line segments"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	10
-, number =	6
-, year =	1988
-, pages =	"880--888"
-, keywords =	"digital geometry"
-, update =	"95.05 korneenko"
+, author =      "C. A. Berenstein and D. Lavine"
+, title =       "On the number of digital straight line segments"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      10
+, number =      6
+, year =        1988
+, pages =       "880--888"
+, keywords =    "digital geometry"
+, update =      "95.05 korneenko"
 }
 
 @article{bklo-gasra-87
-, author =	"C. A. Berenstein and L. N. Kanal And D. Lavine and E. Olson"
-, title =	"A geometric approach to subpixel registration accuracy"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	40
-, number =	3
-, year =	1987
-, pages =	"334--360"
-, update =	"98.11 bibrelex"
+, author =      "C. A. Berenstein and L. N. Kanal And D. Lavine and E. Olson"
+, title =       "A geometric approach to subpixel registration accuracy"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      40
+, number =      3
+, year =        1987
+, pages =       "334--360"
+, update =      "98.11 bibrelex"
 }
 
 @phdthesis{b-ipsap-84
-, author =	"G. B. Beretta"
-, title =	"An implementation of a plane-sweep algorithm on a personal computer"
-, type =	"Ph.{D}. Thesis"
-, school =	"Swiss Federal Inst. Tech."
-, address =	"Z{\"u}rich, Switzerland"
-, year =	1984
-, note =	"Report ETH 7538"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "G. B. Beretta"
+, title =       "An implementation of a plane-sweep algorithm on a personal computer"
+, type =        "Ph.{D}. Thesis"
+, school =      "Swiss Federal Inst. Tech."
+, address =     "Z{\"u}rich, Switzerland"
+, year =        1984
+, note =        "Report ETH 7538"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @inproceedings{bos-oppp-00
-, author =	"Robert-Paul Beretty and Mark H. Overmars and A. Frank van der Stappen"
-, title =	"Orienting Polyhedral Parts by Pushing"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"136--139"
-, update =	"00.03 bibrelex"
+, author =      "Robert-Paul Beretty and Mark H. Overmars and A. Frank van der Stappen"
+, title =       "Orienting Polyhedral Parts by Pushing"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "136--139"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{b-chpsd-93
-, author =	"M. de Berg"
-, title =	"Computing half-plane and strip discrepancy of planar point sets"
-, booktitle =	"Proc. 3rd Internat. Conf. on Comput. Graphics and Visualization Techniques"
-, year =	1993
-, pages =	"294--303"
-, keywords =	"discrepancy, algorithms, dynamic"
-, update =	"94.05 schwarzkopf"
+, author =      "M. de Berg"
+, title =       "Computing half-plane and strip discrepancy of planar point sets"
+, booktitle =   "Proc. 3rd Internat. Conf. on Comput. Graphics and Visualization Techniques"
+, year =        1993
+, pages =       "294--303"
+, keywords =    "discrepancy, algorithms, dynamic"
+, update =      "94.05 schwarzkopf"
 }
 
 @article{b-chpsd-96
-, author =	"M. de Berg"
-, title =	"Computing half-plane and strip discrepancy of planar point sets"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"69--83"
-, update =	"96.09 smid"
+, author =      "M. de Berg"
+, title =       "Computing half-plane and strip discrepancy of planar point sets"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "69--83"
+, update =      "96.09 smid"
 }
 
 @techreport{b-doshs-91
-, author =	"M. de Berg"
-, title =	"Dynamic output-sensitive hidden surface removal for $c$-oriented polyhedra"
-, type =	"Report"
-, number =	"RUU-CS-91-6"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1991
-, precedes =	"b-doshs-92"
-, update =	"94.05 schwarzkopf"
+, author =      "M. de Berg"
+, title =       "Dynamic output-sensitive hidden surface removal for $c$-oriented polyhedra"
+, type =        "Report"
+, number =      "RUU-CS-91-6"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1991
+, precedes =    "b-doshs-92"
+, update =      "94.05 schwarzkopf"
 }
 
 @article{b-doshs-92
-, author =	"M. de Berg"
-, title =	"Dynamic output-sensitive hidden surface removal for $c$-oriented polyhedra"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"119--140"
-, succeeds =	"b-doshs-91"
+, author =      "M. de Berg"
+, title =       "Dynamic output-sensitive hidden surface removal for $c$-oriented polyhedra"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "119--140"
+, succeeds =    "b-doshs-91"
 }
 
 @phdthesis{b-earsh-92
-, author =	"M. de Berg"
-, title =	"Efficient algorithms for ray shooting and hidden surface removal"
-, type =	"Ph.{D}. Dissertation"
-, school =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1992
-, keywords =	"doctoral thesis"
-, precedes =	"b-rsdoh-93"
-, update =	"94.05 schwarzkopf"
+, author =      "M. de Berg"
+, title =       "Efficient algorithms for ray shooting and hidden surface removal"
+, type =        "Ph.{D}. Dissertation"
+, school =      "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1992
+, keywords =    "doctoral thesis"
+, precedes =    "b-rsdoh-93"
+, update =      "94.05 schwarzkopf"
 }
 
 @inproceedings{b-ghsr-93
-, author =	"M. de Berg"
-, title =	"Generalized hidden surface removal"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"1--10"
-, precedes =	"b-ghsr-96"
-, cites =	"am-rsps-92, b-hsrr-90, c-tsplt-91a, cegs-lscaa-89, cg-vippg-89, bhosk-ershs-91, bo-hsrco-92, e-acg-87, gao-isost-90, go-nasch-87, ghlst-ltavs-87, hs-ndssg-86, kos-ehsro-92, ms-rcibt-88, m-wcohs-87, oy-nubkm-91, rs-eoshs-88i, ZZZ"
-, update =	"98.03 bibrelex, 96.09 devillers, 93.09 jones"
+, author =      "M. de Berg"
+, title =       "Generalized hidden surface removal"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "1--10"
+, precedes =    "b-ghsr-96"
+, cites =       "am-rsps-92, b-hsrr-90, c-tsplt-91a, cegs-lscaa-89, cg-vippg-89, bhosk-ershs-91, bo-hsrco-92, e-acg-87, gao-isost-90, go-nasch-87, ghlst-ltavs-87, hs-ndssg-86, kos-ehsro-92, ms-rcibt-88, m-wcohs-87, oy-nubkm-91, rs-eoshs-88i, ZZZ"
+, update =      "98.03 bibrelex, 96.09 devillers, 93.09 jones"
 }
 
 @article{b-ghsr-96
-, author =	"M. de Berg"
-, title =	"Generalized hidden surface removal"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1996
-, pages =	"249--276"
-, succeeds =	"b-ghsr-93"
-, update =	"96.09 devillers+held"
+, author =      "M. de Berg"
+, title =       "Generalized hidden surface removal"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1996
+, pages =       "249--276"
+, succeeds =    "b-ghsr-93"
+, update =      "96.09 devillers+held"
 }
 
 @inproceedings{b-lsbsp-95
-, author =	"Mark de Berg"
-, title =	"Linear Size Binary Space Partitions for Fat Objects"
-, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	979
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"252--263"
-, update =	"97.03 murali+schwarzkopf"
+, author =      "Mark de Berg"
+, title =       "Linear Size Binary Space Partitions for Fat Objects"
+, booktitle =   "Proc. 3rd Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      979
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "252--263"
+, update =      "97.03 murali+schwarzkopf"
 }
 
 @article{b-lsbsp-00
-, author =	"Mark de Berg"
-, title =	"Linear size binary space partitions for uncluttered scenes"
-, journal =	"Algorithmica"
-, volume =	28
-, year =	2000
-, pages =	"353--366"
-, update =	"02.03 cheong"
+, author =      "Mark de Berg"
+, title =       "Linear size binary space partitions for uncluttered scenes"
+, journal =     "Algorithmica"
+, volume =      28
+, year =        2000
+, pages =       "353--366"
+, update =      "02.03 cheong"
 }
 
 @techreport{d-rld-89
-, author =	"M. de Berg"
-, title =	"On Rectilinear Link Distance"
-, type =	"Technical Report"
-, number =	"RUU-CS-89-13"
-, institution =	"Dept. of Computer Science, Univ. of Utrecht"
-, year =	1989
-, precedes =	"b-rld-91"
-, update =	"98.07 bibrelex"
+, author =      "M. de Berg"
+, title =       "On Rectilinear Link Distance"
+, type =        "Technical Report"
+, number =      "RUU-CS-89-13"
+, institution = "Dept. of Computer Science, Univ. of Utrecht"
+, year =        1989
+, precedes =    "b-rld-91"
+, update =      "98.07 bibrelex"
 }
 
 @article{b-rld-91
-, author =	"M. de Berg"
-, title =	"On Rectilinear Link Distance"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, number =	1
-, month =	jul
-, year =	1991
-, pages =	"13--34"
-, keywords =	"motion planning, rectilinear paths, rectilinear polygons, linkdistance"
-, succeeds =	"d-rld-89"
-, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 held"
-, annote =	"He considers rectilinear paths in a rectilinear simple polygon.  In $O(n\log n)$
-		 preprocessing time and space, he builds a data structure that supports
-		 $O(\log n)$ time queries for distance between two points ($O(1)$ time between
-		 two polygon vertices).  He is actually searching for paths that are``smallest'' in
-		 that they are shortest simultaneously in rectilinear link distance and
-		 $L_1$ length (which is always possible).  See improvements to $O(n)$ time and
-		 space by Lingas, Maheshwari, and Sack~\cite{lms-parld-95} and
-		 Schuierer~\cite{s-odssr-96}."
+, author =      "M. de Berg"
+, title =       "On Rectilinear Link Distance"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, number =      1
+, month =       jul
+, year =        1991
+, pages =       "13--34"
+, keywords =    "motion planning, rectilinear paths, rectilinear polygons, linkdistance"
+, succeeds =    "d-rld-89"
+, update =      "98.07 bibrelex, 98.03 mitchell, 93.09 held"
+, annote =      "He considers rectilinear paths in a rectilinear simple polygon.  In $O(n\log n)$
+                 preprocessing time and space, he builds a data structure that supports
+                 $O(\log n)$ time queries for distance between two points ($O(1)$ time between
+                 two polygon vertices).  He is actually searching for paths that are``smallest'' in
+                 that they are shortest simultaneously in rectilinear link distance and
+                 $L_1$ length (which is always possible).  See improvements to $O(n)$ time and
+                 space by Lingas, Maheshwari, and Sack~\cite{lms-parld-95} and
+                 Schuierer~\cite{s-odssr-96}."
 }
 
 @book{b-rsdoh-93
-, author =	"M. de Berg"
-, title =	"Ray Shooting, Depth Orders and Hidden Surface Removal"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	703
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1993
-, keywords =	"book, ray shooting, depth orders, hidden surface removal, translation orders, graphics, data structures"
-, succeeds =	"b-earsh-92"
-, update =	"96.09 agarwal, 94.05 schwarzkopf"
+, author =      "M. de Berg"
+, title =       "Ray Shooting, Depth Orders and Hidden Surface Removal"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      703
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1993
+, keywords =    "book, ray shooting, depth orders, hidden surface removal, translation orders, graphics, data structures"
+, succeeds =    "b-earsh-92"
+, update =      "96.09 agarwal, 94.05 schwarzkopf"
 }
 
 @inproceedings{b-srpp-91
-, author =	"M. de Berg"
-, title =	"Shortest rectilinear path problems"
-, booktitle =	"Proc. 13th IMACS World Congress on Computation and Applied Mathematics"
-, year =	1991
-, pages =	"142--143"
-, keywords =	"motion planning, shortest paths"
+, author =      "M. de Berg"
+, title =       "Shortest rectilinear path problems"
+, booktitle =   "Proc. 13th IMACS World Congress on Computation and Applied Mathematics"
+, year =        1991
+, pages =       "142--143"
+, keywords =    "motion planning, shortest paths"
 }
 
 @inproceedings{b-tpahs-90
-, author =	"M. de Berg"
-, title =	"Translating polygons with applications to hidden surface removal"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"60--70"
+, author =      "M. de Berg"
+, title =       "Translating polygons with applications to hidden surface removal"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "60--70"
 }
 
 @inproceedings{b-tpwah-90
-, author =	"Mark de Berg"
-, title =	"Translating Polygons With Applications to Hidden Surface Removal"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	7
-, update =	"00.03 bibrelex"
+, author =      "Mark de Berg"
+, title =       "Translating Polygons With Applications to Hidden Surface Removal"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       7
+, update =      "00.03 bibrelex"
 }
 
 @article{b-tdcg-97
-, author =	"M. de Berg"
-, title =	"Trends and developments in computational geometry"
-, journal =	"Comput. Graph. Forum"
-, volume =	16
-, year =	1997
-, pages =	"3--30"
-, update =	"97.11 oostrum+smid"
+, author =      "M. de Berg"
+, title =       "Trends and developments in computational geometry"
+, journal =     "Comput. Graph. Forum"
+, volume =      16
+, year =        1997
+, pages =       "3--30"
+, update =      "97.11 oostrum+smid"
 }
 
 @inproceedings{bbbrw-ccmwa-97
-, author =	"M. de Berg and J. Bose and D. Bremner and S. Ramaswami and G. Wilfong"
-, title =	"Computing constrained minimum-width annuli of point sets"
-, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
-, nickname =	"WADS '97"
-, site =	"Halifax, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1272
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"3--16"
-, update =	"99.07 bibrelex, 97.11 oostrum"
+, author =      "M. de Berg and J. Bose and D. Bremner and S. Ramaswami and G. Wilfong"
+, title =       "Computing constrained minimum-width annuli of point sets"
+, booktitle =   "Proc. 5th Workshop Algorithms Data Struct."
+, nickname =    "WADS '97"
+, site =        "Halifax, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1272
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "3--16"
+, update =      "99.07 bibrelex, 97.11 oostrum"
 }
 
 @article{bbbrw-ccmwa-98
-, author =	"M. de Berg and P. Bose and D. Bremner and S. Ramaswami and G. Wilfong"
-, title =	"Computing Constrained Minimum-Width Annuli of Point Sets"
-, journal =	"Comput. Aided Design"
-, volume =	30
-, number =	4
-, month =	apr
-, year =	1998
-, pages =	"267--275"
-, update =	"98.07 held"
+, author =      "M. de Berg and P. Bose and D. Bremner and S. Ramaswami and G. Wilfong"
+, title =       "Computing Constrained Minimum-Width Annuli of Point Sets"
+, journal =     "Comput. Aided Design"
+, volume =      30
+, number =      4
+, month =       apr
+, year =        1998
+, pages =       "267--275"
+, update =      "98.07 held"
 }
 
 @inproceedings{bbdkogrsy-crtt-96
-, author =	"M. de Berg and P. Bose and K. Dobrint and M. van Kreveld and M. Overmars and M. de Groot and T. Roos and J. Snoeyink and S. Yu"
-, title =	"The complexity of rivers in triangulated terrains"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"325--330"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "M. de Berg and P. Bose and K. Dobrint and M. van Kreveld and M. Overmars and M. de Groot and T. Roos and J. Snoeyink and S. Yu"
+, title =       "The complexity of rivers in triangulated terrains"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "325--330"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @article{bcdkt-cmotc-98
-, author =	"Mark de Berg and Otfried Cheong and Olivier Devillers and Mark van Kreveld and Monique Teillaud"
-, title =	"Computing the Maximum Overlap of Two Convex Polygons Under Translations"
-, journal =	"Theory of Computing Systems"
-, volume =	31
-, year =	1998
-, pages =	"613--628"
-, url =	"https://hal.inria.fr/inria-00413175"
-, succeeds =	"bdkst-cmotc-96"
-, cites =	"ast-apsgo-92, abb-amps-91, ag-mrpc-92, absstz-sacp-96, ab-pptr-88, c-pcp-83, c-oaitd-92, c-chdc-93, cghkkk-gpmem-93, ck-cppop-93, f-fapct-85, fj-gsrsm-84, g-cp-67, h-ampac-92, hkk-dvdmh-92i, hks-uevsi-93, l-rmp-91, msw-aotp-93, pt-cocpc-92, scklps-gadss-86, v-aitco-95"
-, update =	"99.11 devillers, 99.07 devillers, 98.11 devillers"
-, abstract =	"Let $P$ be a convex polygon in the plane with $n$ vertices and let $Q$ be a convex polygon with $m$ vertices.  We prove that the maximum number of combinatorially distinct placements of $Q$ with respect to $P$ under translations is $O(n^2+m^2+\min(nm^2+n^2m))$, and we give an example showing that this bound is tight in the worst case.  Second, we present an $O((n+m)\log(n+m))$ algorithm for determining a translation of $Q$ that maximizes the area of overlap of $P$ and $Q$.  We also prove that the placement of $Q$ that makes the centroids of $Q$ and $P$ coincide realizes an overlap of at least $9/25$ of the maximum possible overlap.  As an upper bound, we show an example where the overlap in this placement is $4/9$ of the maximum possible overlap."
+, author =      "Mark de Berg and Otfried Cheong and Olivier Devillers and Mark van Kreveld and Monique Teillaud"
+, title =       "Computing the Maximum Overlap of Two Convex Polygons Under Translations"
+, journal =     "Theory of Computing Systems"
+, volume =      31
+, year =        1998
+, pages =       "613--628"
+, url = "https://inria.hal.science/inria-00413175"
+, succeeds =    "bdkst-cmotc-96"
+, cites =       "ast-apsgo-92, abb-amps-91, ag-mrpc-92, absstz-sacp-96, ab-pptr-88, c-pcp-83, c-oaitd-92, c-chdc-93, cghkkk-gpmem-93, ck-cppop-93, f-fapct-85, fj-gsrsm-84, g-cp-67, h-ampac-92, hkk-dvdmh-92i, hks-uevsi-93, l-rmp-91, msw-aotp-93, pt-cocpc-92, scklps-gadss-86, v-aitco-95"
+, update =      "99.11 devillers, 99.07 devillers, 98.11 devillers"
+, abstract =    "Let $P$ be a convex polygon in the plane with $n$ vertices and let $Q$ be a convex polygon with $m$ vertices.  We prove that the maximum number of combinatorially distinct placements of $Q$ with respect to $P$ under translations is $O(n^2+m^2+\min(nm^2+n^2m))$, and we give an example showing that this bound is tight in the worst case.  Second, we present an $O((n+m)\log(n+m))$ algorithm for determining a translation of $Q$ that maximizes the area of overlap of $P$ and $Q$.  We also prove that the placement of $Q$ that makes the centroids of $Q$ and $P$ coincide realizes an overlap of at least $9/25$ of the maximum possible overlap.  As an upper bound, we show an example where the overlap in this placement is $4/9$ of the maximum possible overlap."
 }
 
 @article{bdds-cscot-97
-, author =	"Mark de Berg and Olivier Devillers and Katrin Dobrindt and Otfried Schwarzkopf"
-, title =	"Computing a Single Cell in the Overlay of Two Simple Polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	63
-, number =	4
-, month =	aug
-, year =	1997
-, pages =	"215--219"
-, url =	"https://hal.inria.fr/inria-00413170"
-, succeeds =	"bdds-cscut-95"
-, cites =	"bds-lric-94, bdsty-arsol-92, cct-rpatd-92, cs-arscg-89, d-rysoa-92, gks-ricdv-92, gss-gmppt-89, m-cgitr-93, s-sfira-91"
-, update =	"99.11 devillers, 99.07 devillers, 98.11 devillers, 98.07 bibrelex, 98.03 mitchell, 97.11 oostrum"
-, abstract =	"This note combines the lazy randomized incremental construction scheme with the technique of ``connectivity acceleration'' to obtain an $O(n(\log^{\star}n)^2)$ time randomized algorithm to compute a single face in the overlay of two simple polygons in the plane."
+, author =      "Mark de Berg and Olivier Devillers and Katrin Dobrindt and Otfried Schwarzkopf"
+, title =       "Computing a Single Cell in the Overlay of Two Simple Polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      63
+, number =      4
+, month =       aug
+, year =        1997
+, pages =       "215--219"
+, url = "https://inria.hal.science/inria-00413170"
+, succeeds =    "bdds-cscut-95"
+, cites =       "bds-lric-94, bdsty-arsol-92, cct-rpatd-92, cs-arscg-89, d-rysoa-92, gks-ricdv-92, gss-gmppt-89, m-cgitr-93, s-sfira-91"
+, update =      "99.11 devillers, 99.07 devillers, 98.11 devillers, 98.07 bibrelex, 98.03 mitchell, 97.11 oostrum"
+, abstract =    "This note combines the lazy randomized incremental construction scheme with the technique of ``connectivity acceleration'' to obtain an $O(n(\log^{\star}n)^2)$ time randomized algorithm to compute a single face in the overlay of two simple polygons in the plane."
 }
 
 @techreport{bdds-cscut-95
-, author =	"Mark de Berg and Olivier Devillers and Katrin Dobrindt and Otfried Schwarzkopf"
-, title =	"Computing a single cell in the union of two simple polygons"
-, type =	"Research {Report}"
-, number =	2626
-, institution =	"INRIA"
-, address =	"BP93, 06902 Sophia-Antipolis, France"
-, year =	1995
-, precedes =	"bdds-cscot-97"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.11 devillers, 97.03 devillers, 96.01 devillers"
-, abstract =	"This note presents a non trivial combination of two techniques previously used with randomized incremental algorithms: the lazy cleaning scheme \cite{bds-lric-94} to maintain structures with `non local' definition and the $O(n\log^{\star}n)$ acceleration when some additional information about the data is known \cite{s-sfira-91,cct-rpatd-92,d-rysoa-92}.  Authors assume that the reader is somehow familiar with this techniques.
+, author =      "Mark de Berg and Olivier Devillers and Katrin Dobrindt and Otfried Schwarzkopf"
+, title =       "Computing a single cell in the union of two simple polygons"
+, type =        "Research {Report}"
+, number =      2626
+, institution = "INRIA"
+, address =     "BP93, 06902 Sophia-Antipolis, France"
+, year =        1995
+, precedes =    "bdds-cscot-97"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.11 devillers, 97.03 devillers, 96.01 devillers"
+, abstract =    "This note presents a non trivial combination of two techniques previously used with randomized incremental algorithms: the lazy cleaning scheme \cite{bds-lric-94} to maintain structures with `non local' definition and the $O(n\log^{\star}n)$ acceleration when some additional information about the data is known \cite{s-sfira-91,cct-rpatd-92,d-rysoa-92}.  Authors assume that the reader is somehow familiar with this techniques.
 If, we are interested in computing a single face in the intersection of two simple polygons, the two previous techniques can be used.  The lazy approach allows to compute a single face in an arrangement of line segments in expected time $O(n\alpha(n)\log n)$ but this technique do not exploit the organization of the segments in simple polygons.  The accelerated framework compute the whole intersection of the two simple polygon in $O(n\log^{\star}n+A)$ where $A=O(n^2)$ is the number of intersection points, and then the relevant connected component can be extracted easily in $O(n)$ time.  The two techniques can be combined to reach an algorithm whose expected time complexity is $O(n\log^{\star 2}n)$ which improve previous bounds above."
 }
 
 @inproceedings{bdkst-cmotc-96
-, author =	"Mark de Berg and Olivier Devillers and Marc van Kreveld and Otfried Schwarzkopf and Monique Teillaud"
-, title =	"Computing the maximum overlap of two convex polygons under translations"
-, booktitle =	"Proc. 7th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC'96"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1178
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"126--135"
-, precedes =	"bcdkt-cmotc-98"
-, update =	"98.11 devillers, 98.07 rote"
+, author =      "Mark de Berg and Olivier Devillers and Marc van Kreveld and Otfried Schwarzkopf and Monique Teillaud"
+, title =       "Computing the maximum overlap of two convex polygons under translations"
+, booktitle =   "Proc. 7th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC'96"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1178
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "126--135"
+, precedes =    "bcdkt-cmotc-98"
+, update =      "98.11 devillers, 98.07 rote"
 }
 
 @inproceedings{bd-ldt-95
-, author =	"Mark de Berg and Katrin Dobrindt"
-, title =	"On Levels of Detail in Terrains"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C26--C27"
-, keywords =	"Delaunay triangulation, surface simplification, decimation"
-, cites =	"dmp-htmsf-94, k-osps-83, l-cembt-91, ps-cgi-85, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Mark de Berg and Katrin Dobrindt"
+, title =       "On Levels of Detail in Terrains"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C26--C27"
+, keywords =    "Delaunay triangulation, surface simplification, decimation"
+, cites =       "dmp-htmsf-94, k-osps-83, l-cembt-91, ps-cgi-85, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @techreport{bds-lric-94t
-, author =	"M. de Berg and K. Dobrindt and O. Schwarzkopf"
-, title =	"On Lazy Randomized Incremental Construction"
-, type =	"Tech. {Report}"
-, number =	"UU-CS-1994-12"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, month =	mar
-, year =	1994
-, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-12.ps.gz"
-, keywords =	"vertical decomposition, trapezoidal map, point location"
-, comments =	"Full version of bds-lric-94"
-, update =	"95.01 schwarzkopf+smid, 94.05 schwarzkopf"
+, author =      "M. de Berg and K. Dobrindt and O. Schwarzkopf"
+, title =       "On Lazy Randomized Incremental Construction"
+, type =        "Tech. {Report}"
+, number =      "UU-CS-1994-12"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, month =       mar
+, year =        1994
+, url = "ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-12.ps.gz"
+, keywords =    "vertical decomposition, trapezoidal map, point location"
+, comments =    "Full version of bds-lric-94"
+, update =      "95.01 schwarzkopf+smid, 94.05 schwarzkopf"
 }
 
 @inproceedings{bds-lric-94
-, author =	"M. de Berg and K. Dobrindt and O. Schwarzkopf"
-, title =	"On Lazy Randomized Incremental Construction"
-, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	"105--114"
-, comments =	"Full and ftp-able version see bds-lric-94t."
-, update =	"95.01 smid, 94.05 schwarzkopf, 94.01 jones"
+, author =      "M. de Berg and K. Dobrindt and O. Schwarzkopf"
+, title =       "On Lazy Randomized Incremental Construction"
+, booktitle =   "Proc. 26th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       "105--114"
+, comments =    "Full and ftp-able version see bds-lric-94t."
+, update =      "95.01 smid, 94.05 schwarzkopf, 94.01 jones"
 }
 
-% also claimed, pages =	"161--186"
+% also claimed, pages = "161--186"
 @article{bds-lric-95
-, author =	"M. de Berg and K. Dobrindt and O. Schwarzkopf"
-, title =	"On lazy randomized incremental construction"
-, journal =	"Discrete Comput. Geom."
-, volume =	14
-, year =	1995
-, pages =	"261--286"
-, update =	"97.11 bibrelex+oostrum"
+, author =      "M. de Berg and K. Dobrindt and O. Schwarzkopf"
+, title =       "On lazy randomized incremental construction"
+, journal =     "Discrete Comput. Geom."
+, volume =      14
+, year =        1995
+, pages =       "261--286"
+, update =      "97.11 bibrelex+oostrum"
 }
 
 @article{bd-ldt-98
-, author =	"M. de Berg and K. T. G. Dobrindt"
-, title =	"On Levels of Details in Terrains"
-, journal =	"Graph. Models Image Process."
-, volume =	60
-, number =	1
-, month =	jan
-, year =	1998
-, pages =	"1--12"
-, succeeds =	"bd-ldt-95"
-, update =	"98.07 held"
+, author =      "M. de Berg and K. T. G. Dobrindt"
+, title =       "On Levels of Details in Terrains"
+, journal =     "Graph. Models Image Process."
+, volume =      60
+, number =      1
+, month =       jan
+, year =        1998
+, pages =       "1--12"
+, succeeds =    "bd-ldt-95"
+, update =      "98.07 held"
 }
 
 @techreport{bew-tqsp-91
-, author =	"M. de Berg and H. Everett and H. Wagener"
-, title =	"Translation queries for sets of polygons"
-, type =	"Report"
-, number =	"RUU-CS-91-30"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1991
-, keywords =	"convex hull, embedding, depth order"
-, update =	"94.05 schwarzkopf"
+, author =      "M. de Berg and H. Everett and H. Wagener"
+, title =       "Translation queries for sets of polygons"
+, type =        "Report"
+, number =      "RUU-CS-91-30"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1991
+, keywords =    "convex hull, embedding, depth order"
+, update =      "94.05 schwarzkopf"
 }
 
 @article{bew-tqsp-95
-, author =	"M. de Berg and H. Everett and H. Wagener"
-, title =	"Translation queries for sets of polygons"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"221--242"
-, keywords =	"convex hull, embedding, depth order"
-, succeeds =	"bew-tqsp-91"
-, update =	"96.05 pocchiola"
+, author =      "M. de Berg and H. Everett and H. Wagener"
+, title =       "Translation queries for sets of polygons"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "221--242"
+, keywords =    "convex hull, embedding, depth order"
+, succeeds =    "bew-tqsp-91"
+, update =      "96.05 pocchiola"
 }
 
 @inproceedings{bg-bspsc-94
-, author =	"Mark de Berg and Marko de Groot"
-, title =	"Binary Space Partitions for Sets of Cubes"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"85--88"
-, update =	"00.11 smid, 00.07 icking, 98.07 bibrelex, 94.05 schwarzkopf"
+, author =      "Mark de Berg and Marko de Groot"
+, title =       "Binary Space Partitions for Sets of Cubes"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "85--88"
+, update =      "00.11 smid, 00.07 icking, 98.07 bibrelex, 94.05 schwarzkopf"
 }
 
 @inproceedings{bgo-nrbsp-94
-, author =	"Mark de Berg and Marko de Groot and Mark Overmars"
-, title =	"New Results on Binary Space Partitions in the Plane"
-, booktitle =	"Proc. 4th Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	824
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"61--72"
-, precedes =	"bgo-nrbsp-97"
-, update =	"00.11 smid, 00.07 icking, 95.01 schwarzkopf+smid, 94.05 schwarzkopf"
+, author =      "Mark de Berg and Marko de Groot and Mark Overmars"
+, title =       "New Results on Binary Space Partitions in the Plane"
+, booktitle =   "Proc. 4th Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      824
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "61--72"
+, precedes =    "bgo-nrbsp-97"
+, update =      "00.11 smid, 00.07 icking, 95.01 schwarzkopf+smid, 94.05 schwarzkopf"
 }
 
 @article{bgo-nrbsp-97
-, author =	"Mark de Berg and Marko de Groot and Mark Overmars"
-, title =	"New Results on Binary Space Partitions in the Plane"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"317--333"
-, succeeds =	"bgo-nrbsp-94"
-, update =	"00.11 smid, 00.07 icking, 97.11 oostrum"
+, author =      "Mark de Berg and Marko de Groot and Mark Overmars"
+, title =       "New Results on Binary Space Partitions in the Plane"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "317--333"
+, succeeds =    "bgo-nrbsp-94"
+, update =      "00.11 smid, 00.07 icking, 97.11 oostrum"
 }
 
 @inproceedings{bgo-pbsp-93
-, author =	"M. de Berg and M. de Groot and M. Overmars"
-, title =	"Perfect binary space partitions"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"109--114"
-, precedes =	"bgo-pbsp-97"
-, cites =	"bos-cvdo-92, fkn-vsgpt-80, go-nhpcg-93, hs-asdch-90, ol-mcp-81, ow-nmcvg-88, py-ebsph-90, py-obspo-92, ZZZ"
-, update =	"98.11 bibrelex, 97.03 devillers, 93.09 milone+mitchell"
+, author =      "M. de Berg and M. de Groot and M. Overmars"
+, title =       "Perfect binary space partitions"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "109--114"
+, precedes =    "bgo-pbsp-97"
+, cites =       "bos-cvdo-92, fkn-vsgpt-80, go-nhpcg-93, hs-asdch-90, ol-mcp-81, ow-nmcvg-88, py-ebsph-90, py-obspo-92, ZZZ"
+, update =      "98.11 bibrelex, 97.03 devillers, 93.09 milone+mitchell"
 }
 
 @article{bgo-pbsp-97
-, author =	"M. de Berg and M. de Groot and M. Overmars"
-, title =	"Perfect binary space partitions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"81--91"
-, succeeds =	"bgo-pbsp-93"
-, update =	"97.03 devillers"
+, author =      "M. de Berg and M. de Groot and M. Overmars"
+, title =       "Perfect binary space partitions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "81--91"
+, succeeds =    "bgo-pbsp-93"
+, update =      "97.03 devillers"
 }
 
 @inproceedings{bghosst-rgdu-93
-, author =	"Mark de Berg and Leonidas Guibas and Dan Halperin and Mark Overmars and Otfried Schwarzkopf and Micha Sharir and Monique Teillaud"
-, title =	"Reaching a Goal with Directional Uncertainty"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"1--10"
-, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-09.ps.gz"
-, precedes =	"bghosst-rgdu-95"
-, update =	"98.07 bibrelex, 95.09 devillers, 94.05 devillers+schwarzkopf+sharir+smid, 93.09 milone+mitchell"
+, author =      "Mark de Berg and Leonidas Guibas and Dan Halperin and Mark Overmars and Otfried Schwarzkopf and Micha Sharir and Monique Teillaud"
+, title =       "Reaching a Goal with Directional Uncertainty"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "1--10"
+, url = "ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-09.ps.gz"
+, precedes =    "bghosst-rgdu-95"
+, update =      "98.07 bibrelex, 95.09 devillers, 94.05 devillers+schwarzkopf+sharir+smid, 93.09 milone+mitchell"
 }
 
 @article{bghosst-rgdu-95
-, author =	"Mark de Berg and Leonidas Guibas and Dan Halperin and Mark Overmars and Otfried Schwarzkopf and Micha Sharir and Monique Teillaud"
-, title =	"Reaching a Goal with Directional Uncertainty"
-, journal =	"Theoret. Comput. Sci."
-, volume =	140
-, year =	1995
-, pages =	"301--317"
-, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-09.ps.gz"
-, succeeds =	"bghosst-rgdu-93"
-, update =	"97.11 bibrelex, 95.09 devillers+schwarzkopf"
+, author =      "Mark de Berg and Leonidas Guibas and Dan Halperin and Mark Overmars and Otfried Schwarzkopf and Micha Sharir and Monique Teillaud"
+, title =       "Reaching a Goal with Directional Uncertainty"
+, journal =     "Theoret. Comput. Sci."
+, volume =      140
+, year =        1995
+, pages =       "301--317"
+, url = "ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-09.ps.gz"
+, succeeds =    "bghosst-rgdu-93"
+, update =      "97.11 bibrelex, 95.09 devillers+schwarzkopf"
 }
 
 @inproceedings{bgh-vdt3s-94
-, author =	"M. de Berg and Leonidas J. Guibas and D. Halperin"
-, title =	"Vertical Decompositions for Triangles in $3$-Space"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"1--10"
-, cites =	"ass-sulbl-89, as-tsbac-90, as-car-92, bo-arcgi-79, c-cpplb-84, c-ochan-91, ce-oails-92, cegs-sessr-89, cegs-lscaa-89, cf-dvrsi-90, cegsw-ccbac-90, c-racpq-88, cs-arscg-89, gt-dtdpl-91, gs-dfbt-78, gs-pmgsc-85, hs-nqbmp-93, hs-ndssg-84, hw-ensrq-87, h-fuenl-89, m-rsehc-92, m-hsrrm-91, m-rmstf-91, ps-cgi-85, pt-eplcs-92, s-atubl-93, t-dsna-83, ws-prnds-88, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
+, author =      "M. de Berg and Leonidas J. Guibas and D. Halperin"
+, title =       "Vertical Decompositions for Triangles in $3$-Space"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "1--10"
+, cites =       "ass-sulbl-89, as-tsbac-90, as-car-92, bo-arcgi-79, c-cpplb-84, c-ochan-91, ce-oails-92, cegs-sessr-89, cegs-lscaa-89, cf-dvrsi-90, cegsw-ccbac-90, c-racpq-88, cs-arscg-89, gt-dtdpl-91, gs-dfbt-78, gs-pmgsc-85, hs-nqbmp-93, hs-ndssg-84, hw-ensrq-87, h-fuenl-89, m-rsehc-92, m-hsrrm-91, m-rmstf-91, ps-cgi-85, pt-eplcs-92, s-atubl-93, t-dsna-83, ws-prnds-88, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
 }
 
 @article{bgh-vdt3s-96
-, author =	"M. de Berg and Leonidas J. Guibas and D. Halperin"
-, title =	"Vertical decompositions for triangles in $3$-space"
-, journal =	"Discrete Comput. Geom."
-, volume =	15
-, year =	1996
-, pages =	"35--61"
-, update =	"98.03 mitchell, 96.05 smid"
+, author =      "M. de Berg and Leonidas J. Guibas and D. Halperin"
+, title =       "Vertical decompositions for triangles in $3$-space"
+, journal =     "Discrete Comput. Geom."
+, volume =      15
+, year =        1996
+, pages =       "35--61"
+, update =      "98.03 mitchell, 96.05 smid"
 }
 
 @techreport{bhok-sanvp-91
-, author =	"M. de Berg and D. Halperin and M. Overmars and M. van Kreveld"
-, title =	"Sparse arrangements and the number of views of polyhedral scenes"
-, type =	"manuscript"
-, year =	1991
-, precedes =	"bhok-sanvp-92, bhok-sanvp-97"
-, update =	"98.11 bibrelex"
+, author =      "M. de Berg and D. Halperin and M. Overmars and M. van Kreveld"
+, title =       "Sparse arrangements and the number of views of polyhedral scenes"
+, type =        "manuscript"
+, year =        1991
+, precedes =    "bhok-sanvp-92, bhok-sanvp-97"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{bhok-sanvp-92
-, author =	"M. de Berg and D. Halperin and M. Overmars and M. van Kreveld"
-, title =	"Sparse arrangements and the number of views of polyhedral scenes"
-, type =	"Technical {Report}"
-, number =	"RUU-CS-92-24"
-, institution =	"Dept. Comput. Sci., Univ. Utrecht"
-, address =	"Utrecht, Netherlands"
-, year =	1992
-, succeeds =	"bhok-sanvp-91"
-, precedes =	"bhok-sanvp-97"
-, update =	"98.11 bibrelex, 97.07 devillers, 94.05 devillers+schwarzkopf, 93.09 milone+mitc hell"
+, author =      "M. de Berg and D. Halperin and M. Overmars and M. van Kreveld"
+, title =       "Sparse arrangements and the number of views of polyhedral scenes"
+, type =        "Technical {Report}"
+, number =      "RUU-CS-92-24"
+, institution = "Dept. Comput. Sci., Univ. Utrecht"
+, address =     "Utrecht, Netherlands"
+, year =        1992
+, succeeds =    "bhok-sanvp-91"
+, precedes =    "bhok-sanvp-97"
+, update =      "98.11 bibrelex, 97.07 devillers, 94.05 devillers+schwarzkopf, 93.09 milone+mitc hell"
 }
 
 @article{bhok-sanvp-97
-, author =	"M. de Berg and D. Halperin and M. Overmars and M. van Kreveld"
-, title =	"Sparse arrangements and the number of views of polyhedral scenes"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"175--195"
-, succeeds =	"bhok-sanvp-92,bhok-sanvp-91"
-, update =	"98.11 bibrelex, 97.07 devillers"
+, author =      "M. de Berg and D. Halperin and M. Overmars and M. van Kreveld"
+, title =       "Sparse arrangements and the number of views of polyhedral scenes"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "175--195"
+, succeeds =    "bhok-sanvp-92,bhok-sanvp-91"
+, update =      "98.11 bibrelex, 97.07 devillers"
 }
 
 @inproceedings{bhosk-ershs-91
-, author =	"M. de Berg and D. Halperin and M. Overmars and J. Snoeyink and M. van Kreveld"
-, title =	"Efficient ray shooting and hidden surface removal"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"21--30"
-, keywords =	"ray tracing, hidden surface removal, random sampling"
-, cites =	"as-anspt-91, ako-iqco-91, as-zasha-91, cegpsss-ccclr-90, cegs-lscaa-89, cg-vippg-89, csw-qoubs-90, cj-sersi-91, cs-vppt-89, bo-hsrap-90, de-ssio-87, dk-ladsc-85, e-acg-87, m-aodq-90, m-wcohs-87, os-oshsr-89, p-srs3d-90, p-nrrsi-91, sml-rtatp-88, s-pcg-88, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "M. de Berg and D. Halperin and M. Overmars and J. Snoeyink and M. van Kreveld"
+, title =       "Efficient ray shooting and hidden surface removal"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "21--30"
+, keywords =    "ray tracing, hidden surface removal, random sampling"
+, cites =       "as-anspt-91, ako-iqco-91, as-zasha-91, cegpsss-ccclr-90, cegs-lscaa-89, cg-vippg-89, csw-qoubs-90, cj-sersi-91, cs-vppt-89, bo-hsrap-90, de-ssio-87, dk-ladsc-85, e-acg-87, m-aodq-90, m-wcohs-87, os-oshsr-89, p-srs3d-90, p-nrrsi-91, sml-rtatp-88, s-pcg-88, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{bhosk-ershs-94
-, author =	"M. de Berg and D. Halperin and M. Overmars and J. Snoeyink and M. van Kreveld"
-, title =	"Efficient ray shooting and hidden surface removal"
-, journal =	"algo"
-, volume =	12
-, year =	1994
-, pages =	"30--53"
-, succeeds =	"bhosk-ershs-91"
+, author =      "M. de Berg and D. Halperin and M. Overmars and J. Snoeyink and M. van Kreveld"
+, title =       "Efficient ray shooting and hidden surface removal"
+, journal =     "algo"
+, volume =      12
+, year =        1994
+, pages =       "30--53"
+, succeeds =    "bhosk-ershs-91"
 }
 
 @inproceedings{bkosv-mmp-98
-, author =	"Mark de Berg and Matthew Katz and Mark Overmars and A. Frank van der Stappen and Jules Vleugels"
-, title =	"Models and Motion Planning"
-, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '98"
-, site =	"Stockholm"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1432
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"83--94"
-, update =	"99.03 bibrelex, 98.07 mitchell"
+, author =      "Mark de Berg and Matthew Katz and Mark Overmars and A. Frank van der Stappen and Jules Vleugels"
+, title =       "Models and Motion Planning"
+, booktitle =   "Proc. 6th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '98"
+, site =        "Stockholm"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1432
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "83--94"
+, update =      "99.03 bibrelex, 98.07 mitchell"
 }
 
 @inproceedings{bksv-rimga-97
-, author =	"M. de Berg and M. J. Katz and A. F. van der Stappen and J. Vleugels"
-, title =	"Realistic Input Models for Geometric Algorithms"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"294--303"
-, cites =	"aks-cdorp-95, am-rsss-92, afkmnsu-ampcb-92, cg-fc1ds-86, cg-ssvip-88, b-lsbsp-95, fpt-opcpa-81, lw-vdllm-80, mmpssw-ftdlm-91, mms-qsrs-94, os-rsplf-96, py-ebsph-90, ps-cgi-85, sv-rslde-96, s-mpafo-94, so-mpelo-95, k-fpfcu-93, v-ffrim-97, ZZZ"
-, update =	"99.03 bibrelex, 98.07 bibrelex, 97.11 katz, 97.07 efrat"
+, author =      "M. de Berg and M. J. Katz and A. F. van der Stappen and J. Vleugels"
+, title =       "Realistic Input Models for Geometric Algorithms"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "294--303"
+, cites =       "aks-cdorp-95, am-rsss-92, afkmnsu-ampcb-92, cg-fc1ds-86, cg-ssvip-88, b-lsbsp-95, fpt-opcpa-81, lw-vdllm-80, mmpssw-ftdlm-91, mms-qsrs-94, os-rsplf-96, py-ebsph-90, ps-cgi-85, sv-rslde-96, s-mpafo-94, so-mpelo-95, k-fpfcu-93, v-ffrim-97, ZZZ"
+, update =      "99.03 bibrelex, 98.07 bibrelex, 97.11 katz, 97.07 efrat"
 }
 
 @techreport{bk-rdlsn-93
-, author =	"M. de Berg and M. van Kreveld"
-, title =	"Rectilinear decompositions with low stabbing number"
-, type =	"Tech. {Report}"
-, number =	"RUU-CS-93-25"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1993
-, update =	"95.01 smid, 94.05 schwarzkopf"
+, author =      "M. de Berg and M. van Kreveld"
+, title =       "Rectilinear decompositions with low stabbing number"
+, type =        "Tech. {Report}"
+, number =      "RUU-CS-93-25"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1993
+, update =      "95.01 smid, 94.05 schwarzkopf"
 }
 
 @article{bk-rdlsn-94
-, author =	"M. de Berg and M. van Kreveld"
-, title =	"Rectilinear decompositions with low stabbing number"
-, journal =	"Inform. Process. Lett."
-, volume =	52
-, year =	1994
-, pages =	"215--221"
-, update =	"95.01 smid"
+, author =      "M. de Berg and M. van Kreveld"
+, title =       "Rectilinear decompositions with low stabbing number"
+, journal =     "Inform. Process. Lett."
+, volume =      52
+, year =        1994
+, pages =       "215--221"
+, update =      "95.01 smid"
 }
 
 @incollection{bk-tawfg-93
-, author =	"Mark de Berg and Marc van Kreveld"
-, title =	"Trekking in the Alps Without Freezing or Getting Tired"
-, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	726
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"121--132"
-, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-02.ps.gz"
-, update =	"94.05 schwarzkopf, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Mark de Berg and Marc van Kreveld"
+, title =       "Trekking in the Alps Without Freezing or Getting Tired"
+, booktitle =   "Proc. 1st Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      726
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "121--132"
+, url = "ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-02.ps.gz"
+, update =      "94.05 schwarzkopf, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{bk-tafgt-97
-, author =	"M. de Berg and M. van Kreveld"
-, title =	"Trekking in the alps without freezing or getting tired"
-, journal =	"Algorithmica"
-, volume =	18
-, year =	1997
-, pages =	"306--323"
-, update =	"97.11 oostrum"
+, author =      "M. de Berg and M. van Kreveld"
+, title =       "Trekking in the alps without freezing or getting tired"
+, journal =     "Algorithmica"
+, volume =      18
+, year =        1997
+, pages =       "306--323"
+, update =      "97.11 oostrum"
 }
 
 @inproceedings{bkn-spqrw-91
-, author =	"M. de Berg and M. van Kreveld and Bengt J. Nilsson"
-, title =	"Shortest path queries in rectilinear worlds of higher dimension"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"51--60"
-, cites =	"c-crmp-87, cr-nlbtr-87, c-tpca-82, c-tsplt-90i, cg-fc1ds-86, ch-spp-90, ckv-rsptp-87, b-rld-91, bkno-fsppo-90i, rlw-rsppr-89, d-ntpcg-59, k-ealdp-89, ll-fmrdp-81, l-prp-78, lp-esppr-84, lpsssstwy-clcsp-87, m-mdscg-84, m-oasrp-89, mmp-dgp-87, mrw-mlpop-90, os-cgd3p-89, rs-spesp-85, s-cg-78, ss-spps-86, s-mlppr-87, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "M. de Berg and M. van Kreveld and Bengt J. Nilsson"
+, title =       "Shortest path queries in rectilinear worlds of higher dimension"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "51--60"
+, cites =       "c-crmp-87, cr-nlbtr-87, c-tpca-82, c-tsplt-90i, cg-fc1ds-86, ch-spp-90, ckv-rsptp-87, b-rld-91, bkno-fsppo-90i, rlw-rsppr-89, d-ntpcg-59, k-ealdp-89, ll-fmrdp-81, l-prp-78, lp-esppr-84, lpsssstwy-clcsp-87, m-mdscg-84, m-oasrp-89, mmp-dgp-87, mrw-mlpop-90, os-cgd3p-89, rs-spesp-85, s-cg-78, ss-spps-86, s-mlppr-87, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{bkno-fsppo-90t
-, author =	"M. de Berg and M. van Kreveld and Bengt J. Nilsson and M. H. Overmars"
-, title =	"Finding shortest paths in the presence of orthogonal obstacles using a combined {$L_{1}$} and link metric"
-, type =	"Report"
-, number =	"RUU-CS-90-20"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1990
-, precedes =	"bkno-fsppo-90i"
-, update =	"98.07 bibrelex, 98.03 mitchell, 94.05 schwarzkopf"
+, author =      "M. de Berg and M. van Kreveld and Bengt J. Nilsson and M. H. Overmars"
+, title =       "Finding shortest paths in the presence of orthogonal obstacles using a combined {$L_{1}$} and link metric"
+, type =        "Report"
+, number =      "RUU-CS-90-20"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1990
+, precedes =    "bkno-fsppo-90i"
+, update =      "98.07 bibrelex, 98.03 mitchell, 94.05 schwarzkopf"
 }
 
 @inproceedings{bkno-fsppo-90i
-, author =	"M. de Berg and M. van Kreveld and Bengt J. Nilsson and M. H. Overmars"
-, title =	"Finding shortest paths in the presence of orthogonal obstacles using a combined {$L_{1}$} and link metric"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"213--224"
-, keywords =	"shortest paths, rectilinear paths, rectilinear obstacles, combined metric"
-, succeeds =	"bkno-fsppo-90t"
-, update =	"98.03 mitchell, 94.05 schwarzkopf"
-, annote =	"They consider rectilinear paths among $n$ axis-parallel
+, author =      "M. de Berg and M. van Kreveld and Bengt J. Nilsson and M. H. Overmars"
+, title =       "Finding shortest paths in the presence of orthogonal obstacles using a combined {$L_{1}$} and link metric"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "213--224"
+, keywords =    "shortest paths, rectilinear paths, rectilinear obstacles, combined metric"
+, succeeds =    "bkno-fsppo-90t"
+, update =      "98.03 mitchell, 94.05 schwarzkopf"
+, annote =      "They consider rectilinear paths among $n$ axis-parallel
 line segment obstacles (possibly crossing).  They preprocess in time
 $O(n^2)$, space $O(n\log n)$, for single-source shortest paths in
 query time $O(\log n)$.  Distance is measured in a combined metric:
@@ -18958,16 +18958,16 @@ @inproceedings{bkno-fsppo-90i
 }
 
 @article{bkno-spqrw-92
-, author =	"M. de Berg and M. van Kreveld and Bengt J. Nilsson and M. H. Overmars"
-, title =	"Shortest path queries in rectilinear worlds"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"287--309"
-, keywords =	"shortest paths, rectilinear paths, rectilinear obstacles, combined metric"
-, update =	"98.03 mitchell"
-, abstract =	"
+, author =      "M. de Berg and M. van Kreveld and Bengt J. Nilsson and M. H. Overmars"
+, title =       "Shortest path queries in rectilinear worlds"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "287--309"
+, keywords =    "shortest paths, rectilinear paths, rectilinear obstacles, combined metric"
+, update =      "98.03 mitchell"
+, abstract =    "
 In this paper, a data structure is given for two and higher
 dimensional shortest path queries.  For a set of $n$ axis-parallel
 rectangles in the plane, or boxes in $d$-space, and a fixed target, it
@@ -18986,1184 +18986,1184 @@ @article{bkno-spqrw-92
 }
 
 @article{bkoo-stses-97
-, author =	"M. de Berg and M. van Kreveld and R. van Oostrum and M. Overmars"
-, title =	"Simple traversal of a subdivision without extra storage"
-, journal =	"International Journal on Geographical Information Science"
-, volume =	11
-, year =	1997
-, pages =	"359--373"
-, update =	"97.11 oostrum"
+, author =      "M. de Berg and M. van Kreveld and R. van Oostrum and M. Overmars"
+, title =       "Simple traversal of a subdivision without extra storage"
+, journal =     "International Journal on Geographical Information Science"
+, volume =      11
+, year =        1997
+, pages =       "359--373"
+, update =      "97.11 oostrum"
 }
 
 @book{bkos-cgaa-97
-, author =	"Mark de Berg and Marc van Kreveld and Mark Overmars and Otfried Schwarzkopf"
-, title =	"Computational Geometry: Algorithms and Applications"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	1997
-, isbn =	"3-540-61270-X"
-, keywords =	"textbook"
-, update =	"98.03 agarwal+mitchell, 97.11 oostrum+orourke"
+, author =      "Mark de Berg and Marc van Kreveld and Mark Overmars and Otfried Schwarzkopf"
+, title =       "Computational Geometry: Algorithms and Applications"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        1997
+, isbn =        "3-540-61270-X"
+, keywords =    "textbook"
+, update =      "98.03 agarwal+mitchell, 97.11 oostrum+orourke"
 }
 
 @book{bkos-cgaa-00
-, author =	"Mark de Berg and Marc van Kreveld and Mark Overmars and Otfried Schwarzkopf"
-, title =	"Computational Geometry: Algorithms and Applications"
-, edition =	"2nd"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	2000
-, succeeds =	"bkos-cgaa-97"
-, update =	"01.04 vismara"
+, author =      "Mark de Berg and Marc van Kreveld and Mark Overmars and Otfried Schwarzkopf"
+, title =       "Computational Geometry: Algorithms and Applications"
+, edition =     "2nd"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        2000
+, succeeds =    "bkos-cgaa-97"
+, update =      "01.04 vismara"
 }
 
 @techreport{bkos-cge-95
-, author =	"M. de Berg and M. van Kreveld and M. Overmars and O. Schwarzkopf"
-, title =	"Computational Geometry by Example"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1995
-, update =	"97.11 bibrelex"
+, author =      "M. de Berg and M. van Kreveld and M. Overmars and O. Schwarzkopf"
+, title =       "Computational Geometry by Example"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1995
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bks-nass-95
-, author =	"M. de Berg and M. van Kreveld and S. Schirra"
-, title =	"A new approach to subdivision simplification"
-, booktitle =	"Proc. 12th Internat. Sympos. Comput.-Assist. Cartog."
-, year =	1995
-, pages =	"79--88"
-, keywords =	"line simplification, generalization"
-, update =	"96.09 kreveld"
+, author =      "M. de Berg and M. van Kreveld and S. Schirra"
+, title =       "A new approach to subdivision simplification"
+, booktitle =   "Proc. 12th Internat. Sympos. Comput.-Assist. Cartog."
+, year =        1995
+, pages =       "79--88"
+, keywords =    "line simplification, generalization"
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{bks-lsctp-95
-, author =	"M. de Berg and M. van Kreveld and S. Schirra"
-, title =	"Line simplification consistent with tag points"
-, booktitle =	"Proc. Auto-Carto 12"
-, year =	1995
-, note =	"to appear"
-, update =	"97.11 bibrelex"
+, author =      "M. de Berg and M. van Kreveld and S. Schirra"
+, title =       "Line simplification consistent with tag points"
+, booktitle =   "Proc. Auto-Carto 12"
+, year =        1995
+, note =        "to appear"
+, update =      "97.11 bibrelex"
 }
 
 @article{bkss-plzkf-96
-, author =	"M. de Berg and M. van Kreveld and O. Schwarzkopf and J. Snoeyink"
-, title =	"Point location in zones of $k$-flats in arrangements"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"131--143"
-, keywords =	"zones, arrangements, point location, many cells"
-, succeeds =	"bks-plzkf-91i"
-, update =	"96.09 devillers+kreveld"
+, author =      "M. de Berg and M. van Kreveld and O. Schwarzkopf and J. Snoeyink"
+, title =       "Point location in zones of $k$-flats in arrangements"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "131--143"
+, keywords =    "zones, arrangements, point location, many cells"
+, succeeds =    "bks-plzkf-91i"
+, update =      "96.09 devillers+kreveld"
 }
 
 @techreport{bks-plzkf-91t
-, author =	"M. de Berg and M. van Kreveld and J. Snoeyink"
-, title =	"Point location in zones of $k$-flats in arrangements"
-, type =	"Report"
-, number =	"RUU-CS-91-9"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1991
-, precedes =	"bks-plzkf-91i"
-, update =	"94.05 schwarzkopf"
+, author =      "M. de Berg and M. van Kreveld and J. Snoeyink"
+, title =       "Point location in zones of $k$-flats in arrangements"
+, type =        "Report"
+, number =      "RUU-CS-91-9"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1991
+, precedes =    "bks-plzkf-91i"
+, update =      "94.05 schwarzkopf"
 }
 
 @inproceedings{bks-plzkf-91i
-, author =	"M. de Berg and M. van Kreveld and J. Snoeyink"
-, title =	"Point location in zones of $k$-flats in arrangements"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"228--232"
-, succeeds =	"bks-plzkf-91t"
-, cites =	"bks-plzkf-91t, csw-qoubs-90, c-narsc-87, cs-arscg-89, e-acg-87, eos-calha-86, m-aodq-90, m-lpltw-84, hw-ensrq-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M. de Berg and M. van Kreveld and J. Snoeyink"
+, title =       "Point location in zones of $k$-flats in arrangements"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "228--232"
+, succeeds =    "bks-plzkf-91t"
+, cites =       "bks-plzkf-91t, csw-qoubs-90, c-narsc-87, cs-arscg-89, e-acg-87, eos-calha-86, m-aodq-90, m-lpltw-84, hw-ensrq-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bks-ttdpl-91
-, author =	"M. de Berg and M. van Kreveld and J. Snoeyink"
-, title =	"Two- and three-dimensional point location in rectangular subdivisions"
-, type =	"Report"
-, number =	"RUU-CS-91-29"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1991
-, precedes =	"bks-ttdpl-92"
-, update =	"94.05 schwarzkopf"
+, author =      "M. de Berg and M. van Kreveld and J. Snoeyink"
+, title =       "Two- and three-dimensional point location in rectangular subdivisions"
+, type =        "Report"
+, number =      "RUU-CS-91-29"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1991
+, precedes =    "bks-ttdpl-92"
+, update =      "94.05 schwarzkopf"
 }
 
 @inproceedings{bks-ttdpl-92
-, author =	"M. de Berg and M. van Kreveld and J. Snoeyink"
-, title =	"Two- and three-dimensional point location in rectangular subdivisions"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"352--363"
-, succeeds =	"bks-ttdpl-91"
-, precedes =	"bks-ttdpl-95"
-, update =	"95.05 smid"
+, author =      "M. de Berg and M. van Kreveld and J. Snoeyink"
+, title =       "Two- and three-dimensional point location in rectangular subdivisions"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "352--363"
+, succeeds =    "bks-ttdpl-91"
+, precedes =    "bks-ttdpl-95"
+, update =      "95.05 smid"
 }
 
 @article{bks-ttdpl-95
-, author =	"M. de Berg and M. van Kreveld and J. Snoeyink"
-, title =	"Two- and three-dimensional point location in rectangular subdivisions"
-, journal =	"J. Algorithms"
-, volume =	18
-, year =	1995
-, pages =	"256--277"
-, succeeds =	"bks-ttdpl-92"
-, update =	"95.05 smid"
+, author =      "M. de Berg and M. van Kreveld and J. Snoeyink"
+, title =       "Two- and three-dimensional point location in rectangular subdivisions"
+, journal =     "J. Algorithms"
+, volume =      18
+, year =        1995
+, pages =       "256--277"
+, succeeds =    "bks-ttdpl-92"
+, update =      "95.05 smid"
 }
 
 @inproceedings{bms-plpco-93
-, author =	"M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"Piecewise Linear Paths Among Convex Obstacles"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"505--514"
-, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1993/1993-20.ps.gz"
-, keywords =	"configuration space, motion planning, convex, robotics"
-, precedes =	"bms-plpco-95"
-, update =	"96.09 agarwal, 95.09 aronov, 94.05 devillers+schwarzkopf, 93.09 milone+mitchell, 93.05 schwarzkopf"
-, abstract =	"Let $B$ be a set of $n$ arbitrary (possibly intersecting)
-		convex obstacles in ${\bf R}^d$. It is shown that any
-		two points which can be connected by a path avoiding
-		the obstacles can also be connected by a path
-		consisting of $O(n^{(d-1)\lfloor{d/2+1}\rfloor})$
-		segments. The bound cannot be improved below
-		$\Omega(n^d)$. For disjoint obstacles, a $\Theta(n)$
-		bound is proved. By a well-known reduction, the
-		general case result also upper bounds the complexity
-		for a translational motion of an arbitrary convex
-		robot among convex obstacles.  In the planar case,
-		asymptotically tight bounds and efficient algorithms
-		are given."
+, author =      "M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "Piecewise Linear Paths Among Convex Obstacles"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "505--514"
+, url = "ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1993/1993-20.ps.gz"
+, keywords =    "configuration space, motion planning, convex, robotics"
+, precedes =    "bms-plpco-95"
+, update =      "96.09 agarwal, 95.09 aronov, 94.05 devillers+schwarzkopf, 93.09 milone+mitchell, 93.05 schwarzkopf"
+, abstract =    "Let $B$ be a set of $n$ arbitrary (possibly intersecting)
+                convex obstacles in ${\bf R}^d$. It is shown that any
+                two points which can be connected by a path avoiding
+                the obstacles can also be connected by a path
+                consisting of $O(n^{(d-1)\lfloor{d/2+1}\rfloor})$
+                segments. The bound cannot be improved below
+                $\Omega(n^d)$. For disjoint obstacles, a $\Theta(n)$
+                bound is proved. By a well-known reduction, the
+                general case result also upper bounds the complexity
+                for a translational motion of an arbitrary convex
+                robot among convex obstacles.  In the planar case,
+                asymptotically tight bounds and efficient algorithms
+                are given."
 }
 
 @article{bms-plpco-95
-, author =	"M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"Piecewise Linear Paths Among Convex Obstacles"
-, journal =	"Discrete Comput. Geom."
-, volume =	14
-, year =	1995
-, pages =	"9--29"
-, keywords =	"configuration space, motion planning, convex, robotics"
-, succeeds =	"bms-plpco-93"
-, update =	"96.09 agarwal, 95.09 aronov"
+, author =      "M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "Piecewise Linear Paths Among Convex Obstacles"
+, journal =     "Discrete Comput. Geom."
+, volume =      14
+, year =        1995
+, pages =       "9--29"
+, keywords =    "configuration space, motion planning, convex, robotics"
+, succeeds =    "bms-plpco-93"
+, update =      "96.09 agarwal, 95.09 aronov"
 }
 
 @inproceedings{bmow-cat-96
-, author =	"M. de Berg and H. Meijer and M. Overmars and G. Wilfong"
-, title =	"Computing the angularity tolerance"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"331--336"
-, precedes =	"bmow-cat-98"
-, update =	"98.11 devillers, 97.03 agarwal, 96.09 mitchell"
+, author =      "M. de Berg and H. Meijer and M. Overmars and G. Wilfong"
+, title =       "Computing the angularity tolerance"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "331--336"
+, precedes =    "bmow-cat-98"
+, update =      "98.11 devillers, 97.03 agarwal, 96.09 mitchell"
 }
 
 @article{bmow-cat-98
-, author =	"M. de Berg and H. Meijer and M. Overmars and G. Wilfong"
-, title =	"Computing the angularity tolerance"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"467--"
-, succeeds =	"bmow-cat-96"
-, update =	"98.11 devillers"
+, author =      "M. de Berg and H. Meijer and M. Overmars and G. Wilfong"
+, title =       "Computing the angularity tolerance"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "467--"
+, succeeds =    "bmow-cat-96"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{boo-stswe-96
-, author =	"Mark de Berg and Ren{\'e} van Oostrum and Mark Overmars"
-, title =	"Simple Traversal of a Subdivision Without Extra Storage"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"C5--C6"
-, cites =	"af-rse-92, bkos-cge-95, egs-oplms-86, fr-cfecp-94, gc-sontr-86, gcr-acmut-77, gm-tsocc-78, pm-aiecg-90, pm-tdds-90, ZZZ"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 96.05 efrat"
+, author =      "Mark de Berg and Ren{\'e} van Oostrum and Mark Overmars"
+, title =       "Simple Traversal of a Subdivision Without Extra Storage"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "C5--C6"
+, cites =       "af-rse-92, bkos-cge-95, egs-oplms-86, fr-cfecp-94, gc-sontr-86, gcr-acmut-77, gm-tsocc-78, pm-aiecg-90, pm-tdds-90, ZZZ"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 96.05 efrat"
 }
 
 @proceedings{bo-ewcg-92
-, title =	"Abstracts 8th European Workshop Comput. Geom."
-, editor =	"Mark de Berg and Mark Overmars"
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, volume =	"RUU-CS-92-10"
-, publisher =	"Utrecht University"
-, year =	1992
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 8th European Workshop Comput. Geom."
+, editor =      "Mark de Berg and Mark Overmars"
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, volume =      "RUU-CS-92-10"
+, publisher =   "Utrecht University"
+, year =        1992
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{bo-dpo-88
-, author =	"M. de Berg and M. Overmars"
-, title =	"Dominance in the presence of obstacles"
-, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '88"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	344
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"190--201"
-, keywords =	"domination, maximal elements, rectangular visibility"
+, author =      "M. de Berg and M. Overmars"
+, title =       "Dominance in the presence of obstacles"
+, booktitle =   "Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '88"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      344
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "190--201"
+, keywords =    "domination, maximal elements, rectangular visibility"
 }
 
 @article{bo-hsrco-92
-, author =	"M. de Berg and M. Overmars"
-, title =	"Hidden surface removal for $c$-oriented polyhedra"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, number =	5
-, year =	1992
-, pages =	"247--268"
-, keywords =	"hidden surface removal, $c$-oriented polyhedra, output-sensitive algorithms"
-, succeeds =	"bo-hsrap-90"
+, author =      "M. de Berg and M. Overmars"
+, title =       "Hidden surface removal for $c$-oriented polyhedra"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, number =      5
+, year =        1992
+, pages =       "247--268"
+, keywords =    "hidden surface removal, $c$-oriented polyhedra, output-sensitive algorithms"
+, succeeds =    "bo-hsrap-90"
 }
 
 @article{bok-fcbsb-90
-, author =	"M. de Berg and M. Overmars and M. van Kreveld"
-, title =	"Finding complete bipartite subgraphs in bipartite graphs"
-, journal =	"Algorithms Rev."
-, volume =	1
-, number =	2
-, year =	1990
-, pages =	"79--85"
+, author =      "M. de Berg and M. Overmars and M. van Kreveld"
+, title =       "Finding complete bipartite subgraphs in bipartite graphs"
+, journal =     "Algorithms Rev."
+, volume =      1
+, number =      2
+, year =        1990
+, pages =       "79--85"
 }
 
 @inproceedings{bos-cvdo-92
-, author =	"M. de Berg and M. Overmars and O. Schwarzkopf"
-, title =	"Computing and verifying depth orders"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"138--145"
-, keywords =	"hidden line/surface elimination, three-dimensional"
-, cites =	"am-rsps-91, am-dhsrr-91, as-anps-91, c-tsplt-90i, cegpsss-ccclr-90, csw-qoubs-90, b-doshs-91, bhosk-ershs-91, bo-hsrap-90, fkn-vsgpt-80, go-nasch-87, hb-cg-86, kos-ehsro-91, m-ept-91, n-tsott-86, os-oshsr-89, py-ebsph-90, pvy-osgpv-90, ZZZ"
-, update =	"97.11 bibrelex, 93.05 schwarzkopf"
+, author =      "M. de Berg and M. Overmars and O. Schwarzkopf"
+, title =       "Computing and verifying depth orders"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "138--145"
+, keywords =    "hidden line/surface elimination, three-dimensional"
+, cites =       "am-rsps-91, am-dhsrr-91, as-anps-91, c-tsplt-90i, cegpsss-ccclr-90, csw-qoubs-90, b-doshs-91, bhosk-ershs-91, bo-hsrap-90, fkn-vsgpt-80, go-nasch-87, hb-cg-86, kos-ehsro-91, m-ept-91, n-tsott-86, os-oshsr-89, py-ebsph-90, pvy-osgpv-90, ZZZ"
+, update =      "97.11 bibrelex, 93.05 schwarzkopf"
 }
 
 @article{bos-cvdo-94
-, author =	"M. de Berg and M. Overmars and O. Schwarzkopf"
-, title =	"Computing and verifying depth orders"
-, journal =	"sicomp"
-, volume =	23
-, year =	1994
-, pages =	"437--446"
-, succeeds =	"bos-cvdo-92"
-, update =	"95.01 matousek"
+, author =      "M. de Berg and M. Overmars and O. Schwarzkopf"
+, title =       "Computing and verifying depth orders"
+, journal =     "sicomp"
+, volume =      23
+, year =        1994
+, pages =       "437--446"
+, succeeds =    "bos-cvdo-92"
+, update =      "95.01 matousek"
 }
 
 @inproceedings{bo-hsrap-90
-, author =	"M. de Berg and M. H. Overmars"
-, title =	"Hidden surface removal for axis-parallel polyhedra"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"252--261"
-, keywords =	"hidden surface removal, ray tracing"
-, succeeds =	"bo-hsrco-90"
-, precedes =	"bo-hsrco-92"
+, author =      "M. de Berg and M. H. Overmars"
+, title =       "Hidden surface removal for axis-parallel polyhedra"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "252--261"
+, keywords =    "hidden surface removal, ray tracing"
+, succeeds =    "bo-hsrco-90"
+, precedes =    "bo-hsrco-92"
 }
 
 @techreport{bo-hsrco-90
-, author =	"M. de Berg and M. H. Overmars"
-, title =	"Hidden surface removal for $c$-oriented polyhedra"
-, type =	"Report"
-, number =	"RUU-CS-90-33"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1990
-, precedes =	"bo-hsrap-90"
-, update =	"94.05 schwarzkopf"
+, author =      "M. de Berg and M. H. Overmars"
+, title =       "Hidden surface removal for $c$-oriented polyhedra"
+, type =        "Report"
+, number =      "RUU-CS-90-33"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1990
+, precedes =    "bo-hsrap-90"
+, update =      "94.05 schwarzkopf"
 }
 
 @techreport{bs-ca-92
-, author =	"M. de Berg and O. Schwarzkopf"
-, title =	"Cuttings and applications"
-, type =	"Report"
-, number =	"RUU-CS-92-26"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, month =	aug
-, year =	1992
-, keywords =	"cuttings, random sampling, hopcroft's problem, counting intersections, point location"
-, precedes =	"bs-ca-95"
-, update =	"96.09 devillers, 94.05 schwarzkopf"
+, author =      "M. de Berg and O. Schwarzkopf"
+, title =       "Cuttings and applications"
+, type =        "Report"
+, number =      "RUU-CS-92-26"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, month =       aug
+, year =        1992
+, keywords =    "cuttings, random sampling, hopcroft's problem, counting intersections, point location"
+, precedes =    "bs-ca-95"
+, update =      "96.09 devillers, 94.05 schwarzkopf"
 }
 
 @article{bs-ca-95
-, author =	"M. de Berg and O. Schwarzkopf"
-, title =	"Cuttings and applications"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"343--355"
-, keywords =	"cuttings, random sampling, segment intersection counting, Hopcroft's problem, point location"
-, succeeds =	"bs-ca-92"
-, update =	"96.09 devillers"
+, author =      "M. de Berg and O. Schwarzkopf"
+, title =       "Cuttings and applications"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "343--355"
+, keywords =    "cuttings, random sampling, segment intersection counting, Hopcroft's problem, point location"
+, succeeds =    "bs-ca-92"
+, update =      "96.09 devillers"
 }
 
 @article{bco-gadp-92
-, author =	"M. T. de Berg and S. Carlsson and M. H. Overmars"
-, title =	"A general approach to dominance in the plane"
-, journal =	"J. Algorithms"
-, volume =	13
-, year =	1992
-, pages =	"274--296"
-, keywords =	"domination, rectangular visibility"
+, author =      "M. T. de Berg and S. Carlsson and M. H. Overmars"
+, title =       "A general approach to dominance in the plane"
+, journal =     "J. Algorithms"
+, volume =      13
+, year =        1992
+, pages =       "274--296"
+, keywords =    "domination, rectangular visibility"
 }
 
 @article{b-ttgt-57
-, author =	"B. Berge"
-, title =	"Two Theorems in Graph Theroy"
-, journal =	"Proc. Nat. Acad. Sci. USA"
-, volume =	43
-, year =	1957
-, pages =	"842--844"
-, update =	"97.11 bibrelex"
+, author =      "B. Berge"
+, title =       "Two Theorems in Graph Theroy"
+, journal =     "Proc. Nat. Acad. Sci. USA"
+, volume =      43
+, year =        1957
+, pages =       "842--844"
+, update =      "97.11 bibrelex"
 }
 
 @book{b-g-85
-, author =	"C. Berge"
-, title =	"Graphs"
-, publisher =	"North-Holland"
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "C. Berge"
+, title =       "Graphs"
+, publisher =   "North-Holland"
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @article{b-slcmd-58
-, author =	"C. Berge"
-, title =	"Sur le couplage maximum d'un graphe"
-, journal =	"C. R. Acad. Sciences, Paris"
-, volume =	247
-, year =	1958
-, pages =	"258--259"
-, update =	"98.07 bibrelex"
+, author =      "C. Berge"
+, title =       "Sur le couplage maximum d'un graphe"
+, journal =     "C. R. Acad. Sciences, Paris"
+, volume =      247
+, year =        1958
+, pages =       "258--259"
+, update =      "98.07 bibrelex"
 }
 
 @book{bc-tpg-84
-, title =	"Topics on Perfect Graphs"
-, editor =	"C. Berge and V. Chv{\'a}tal"
-, series =	"Ann. Discrete Math."
-, volume =	21
-, publisher =	"North-Holland"
-, year =	1984
-, update =	"98.11 bibrelex"
+, title =       "Topics on Perfect Graphs"
+, editor =      "C. Berge and V. Chv{\'a}tal"
+, series =      "Ann. Discrete Math."
+, volume =      21
+, publisher =   "North-Holland"
+, year =        1984
+, update =      "98.11 bibrelex"
 }
 
 @book{bpv-ocdat-84
-, author =	"P. Berge and Y. Pomeau and C. Vidal"
-, title =	"Order within Chaos: towards a Deterministic Approach to Turbulence"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1984
-, update =	"99.11 bibrelex, 98.11 bibrelex"
+, author =      "P. Berge and Y. Pomeau and C. Vidal"
+, title =       "Order within Chaos: towards a Deterministic Approach to Turbulence"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1984
+, update =      "99.11 bibrelex, 98.11 bibrelex"
 }
 
 @article{v-frgic-99
-, author =	"G. Van den Bergen"
-, title =	"A Fast Robust GJK Implementation for Collision Detection of Convex Objects"
-, journal =	"J. Graphics Tools"
-, volume =	4
-, number =	2
-, year =	1999
-, pages =	"7--25"
-, update =	"00.03 held"
+, author =      "G. Van den Bergen"
+, title =       "A Fast Robust GJK Implementation for Collision Detection of Convex Objects"
+, journal =     "J. Graphics Tools"
+, volume =      4
+, number =      2
+, year =        1999
+, pages =       "7--25"
+, update =      "00.03 held"
 }
 
 @inproceedings{bkl-rtdma-96
-, author =	"Bonnie Berger and Jon Kleinberg and Tom Leighton"
-, title =	"Reconstructing a Three-Dimensional Model with Arbitrary Errors"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '96"
-, site =	"Philadelphia, PA"
-, month =	may
-, year =	1996
-, pages =	"449--458"
-, update =	"00.03 smid, 98.07 bibrelex, 98.03 mitchell"
+, author =      "Bonnie Berger and Jon Kleinberg and Tom Leighton"
+, title =       "Reconstructing a Three-Dimensional Model with Arbitrary Errors"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '96"
+, site =        "Philadelphia, PA"
+, month =       may
+, year =        1996
+, pages =       "449--458"
+, update =      "00.03 smid, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @article{br-slwin-91
-, author =	"B. Berger and J. Rompel"
-, title =	"Simulating {$(\log^c n)$}-Wise Independence in {NC}"
-, journal =	"J. ACM"
-, volume =	38
-, number =	4
-, year =	1991
-, pages =	"1026--1046"
-, update =	"96.09 orourke"
+, author =      "B. Berger and J. Rompel"
+, title =       "Simulating {$(\log^c n)$}-Wise Independence in {NC}"
+, journal =     "J. ACM"
+, volume =      38
+, number =      4
+, year =        1991
+, pages =       "1026--1046"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{brs-enasc-89
-, author =	"B. Berger and J. Rompel and P. W. Shor"
-, title =	"Efficient {NC} algorithms for set cover with applications to learning and geometry"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, volume =	30
-, year =	1989
-, pages =	"54--59"
-, update =	"93.09 matousek"
+, author =      "B. Berger and J. Rompel and P. W. Shor"
+, title =       "Efficient {NC} algorithms for set cover with applications to learning and geometry"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, volume =      30
+, year =        1989
+, pages =       "54--59"
+, update =      "93.09 matousek"
 }
 
 @inproceedings{bs-aamas-90
-, author =	"B. Berger and P. Shor"
-, title =	"Approximation Algorithms for the Maximum Acyclic Subgraph Problem"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"236--243"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "B. Berger and P. Shor"
+, title =       "Approximation Algorithms for the Maximum Acyclic Subgraph Problem"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "236--243"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{b-g3cep-74
-, author =	"M. Berger"
-, title =	"G{\'e}om{\'e}trie 3. convexes et polytopes, poly{\`e}dres r{\'e}guliers, aires et volumes"
-, publisher =	"Fernand Nathan"
-, address =	"Paris"
-, year =	1974
-, update =	"94.05 devillers"
+, author =      "M. Berger"
+, title =       "G{\'e}om{\'e}trie 3. convexes et polytopes, poly{\`e}dres r{\'e}guliers, aires et volumes"
+, publisher =   "Fernand Nathan"
+, address =     "Paris"
+, year =        1974
+, update =      "94.05 devillers"
 }
 
 @book{b-g-77
-, author =	"M. Berger"
-, title =	"G{\'e}om{\'e}trie (vols. 1-5)"
-, publisher =	"Fernand Nathan"
-, address =	"Paris"
-, year =	1977
-, update =	"96.09 devillers"
+, author =      "M. Berger"
+, title =       "G{\'e}om{\'e}trie (vols. 1-5)"
+, publisher =   "Fernand Nathan"
+, address =     "Paris"
+, year =        1977
+, update =      "96.09 devillers"
 }
 
 @book{b-g-87
-, author =	"M. Berger"
-, title =	"Geometry (vols. 1-2)"
-, publisher =	"Springer-Verlag"
-, year =	1987
-, succeeds =	"b-g-77"
-, update =	"96.09 devillers"
+, author =      "M. Berger"
+, title =       "Geometry (vols. 1-2)"
+, publisher =   "Springer-Verlag"
+, year =        1987
+, succeeds =    "b-g-77"
+, update =      "96.09 devillers"
 }
 
 @book{bg-gd-72
-, author =	"M. Berger and B. Gostiaux"
-, title =	"G{\'e}om{\'e}trie diff{\'e}rentielle"
-, publisher =	"Armand Collin"
-, year =	1972
-, update =	"97.11 bibrelex"
+, author =      "M. Berger and B. Gostiaux"
+, title =       "G{\'e}om{\'e}trie diff{\'e}rentielle"
+, publisher =   "Armand Collin"
+, year =        1972
+, update =      "97.11 bibrelex"
 }
 
 @article{br-apcgg-91
-, author =	"M. Berger and I. Rigoutsos"
-, title =	"An algorithm for point clustering and grid generation"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	21
-, number =	5
-, year =	1991
-, pages =	"1278--1286"
-, update =	"98.07 agarwal"
+, author =      "M. Berger and I. Rigoutsos"
+, title =       "An algorithm for point clustering and grid generation"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      21
+, number =      5
+, year =        1991
+, pages =       "1278--1286"
+, update =      "98.07 agarwal"
 }
 
 @article{b-udp-66
-, author =	"R. Berger"
-, title =	"The undecidability of the domino problem"
-, journal =	"Memoirs Amer. Math. Soc."
-, volume =	66
-, year =	1966
-, update =	"97.11 bibrelex"
+, author =      "R. Berger"
+, title =       "The undecidability of the domino problem"
+, journal =     "Memoirs Amer. Math. Soc."
+, volume =      66
+, year =        1966
+, update =      "97.11 bibrelex"
 }
 
 @article{bsv-fpafc-96
-, author =	"O. Berkman and B. Schieber and U. Vishkin"
-, title =	"A fast parallel algorithm for finding the convex hull of a sorted point set"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"231--242"
-, update =	"96.09 devillers+orourke"
+, author =      "O. Berkman and B. Schieber and U. Vishkin"
+, title =       "A fast parallel algorithm for finding the convex hull of a sorted point set"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "231--242"
+, update =      "96.09 devillers+orourke"
 }
 
 @article{b-siec-69
-, author =	"E. R. Berlekamp"
-, title =	"On subsets with intersections of even cardinality"
-, journal =	"Canad. Math. Bull."
-, volume =	12
-, year =	1969
-, pages =	"363--366"
-, update =	"98.03 bibrelex"
+, author =      "E. R. Berlekamp"
+, title =       "On subsets with intersections of even cardinality"
+, journal =     "Canad. Math. Bull."
+, volume =      12
+, year =        1969
+, pages =       "363--366"
+, update =      "98.03 bibrelex"
 }
 
 @article{bh-vpius-70
-, author =	"J. D. Berman and K. Hanes"
-, title =	"Volumes of polyhedra inscribed in the unit sphere $E^3$"
-, journal =	"Mathematische Annalen"
-, volume =	188
-, year =	1970
-, pages =	"78--84"
-, update =	"97.11 bibrelex"
+, author =      "J. D. Berman and K. Hanes"
+, title =       "Volumes of polyhedra inscribed in the unit sphere $E^3$"
+, journal =     "Mathematische Annalen"
+, volume =      188
+, year =        1970
+, pages =       "78--84"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-lsbls-89
-, author =	"Mark Berman"
-, title =	"Large sample bias in least squares estimators of a circular arc center and its radius"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	45
-, year =	1989
-, pages =	"126--128"
-, update =	"97.03 agarwal"
+, author =      "Mark Berman"
+, title =       "Large sample bias in least squares estimators of a circular arc center and its radius"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      45
+, year =        1989
+, pages =       "126--128"
+, update =      "97.03 agarwal"
 }
 
 @incollection{b-olsn-98
-, author =	"Piotr Berman"
-, title =	"On-line Searching and Navigation"
-, editor =	"Amos Fiat and Gerhard Woeginger"
-, booktitle =	"Online Algorithms: The State of the Art"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1442
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"232--241"
-, comments =	"chapter 10 of fw-ola-98"
-, update =	"02.03 icking, 98.07 icking, 98.03 mitchell"
+, author =      "Piotr Berman"
+, title =       "On-line Searching and Navigation"
+, editor =      "Amos Fiat and Gerhard Woeginger"
+, booktitle =   "Online Algorithms: The State of the Art"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1442
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "232--241"
+, comments =    "chapter 10 of fw-ola-98"
+, update =      "02.03 icking, 98.07 icking, 98.03 mitchell"
 }
 
 @inproceedings{bbfkrs-rrna-96
-, author =	"Piotr Berman and Avrim Blum and Amos Fiat and Howard Karloff and Adi Rosen and Michael Saks"
-, title =	"Randomized robot navigation algorithms"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"75--84"
-, keywords =	"mobile robot, competitive ratio, shortest paths, randomized strategies, rectangular obstacles"
-, update =	"96.09 agarwal, 96.01 mitchell"
+, author =      "Piotr Berman and Avrim Blum and Amos Fiat and Howard Karloff and Adi Rosen and Michael Saks"
+, title =       "Randomized robot navigation algorithms"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "75--84"
+, keywords =    "mobile robot, competitive ratio, shortest paths, randomized strategies, rectangular obstacles"
+, update =      "96.09 agarwal, 96.01 mitchell"
 }
 
 @inproceedings{bd-arpcp-92
-, author =	"P. Berman and B. DasGupta"
-, title =	"Approximating the rectilinear polygon cover problems"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"229--235"
-, cites =	"ckss-crr-81, co-srrcp-87, cr-cpih-88, f-pgslh-89, fk-acrri-84, hk-nammb-73, l-pnrh-82, mc-ivs-80, os-snhpd-83, lllmp-tddo2-79, bd-rarpc-92, bs-caisp-92, l-ocopg-85, o-mdrp-82, almss-iap-92, l-bbpcp-88, m-ncscp-78, mrs-pgocc-88, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. Berman and B. DasGupta"
+, title =       "Approximating the rectilinear polygon cover problems"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "229--235"
+, cites =       "ckss-crr-81, co-srrcp-87, cr-cpih-88, f-pgslh-89, fk-acrri-84, hk-nammb-73, l-pnrh-82, mc-ivs-80, os-snhpd-83, lllmp-tddo2-79, bd-rarpc-92, bs-caisp-92, l-ocopg-85, o-mdrp-82, almss-iap-92, l-bbpcp-88, m-ncscp-78, mrs-pgocc-88, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bd-rarpc-92
-, author =	"P. Berman and B. DasGupta"
-, title =	"Results on Approximating of the Rectilinear Cover Problem"
-, type =	"Technical Report"
-, number =	"CS-92-07"
-, institution =	"Pennsylvania State University"
-, month =	apr
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "P. Berman and B. DasGupta"
+, title =       "Results on Approximating of the Rectilinear Cover Problem"
+, type =        "Technical Report"
+, number =      "CS-92-07"
+, institution = "Pennsylvania State University"
+, month =       apr
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bk-rnwco-94
-, author =	"Piotr Berman and M. Karpinski"
-, title =	"Randomized Navigation to a Wall through Convex Obstacles"
-, type =	"Technical Report"
-, number =	"85118-CS"
-, institution =	"Bonn University"
-, year =	1994
-, update =	"98.03 mitchell"
+, author =      "Piotr Berman and M. Karpinski"
+, title =       "Randomized Navigation to a Wall through Convex Obstacles"
+, type =        "Technical Report"
+, number =      "85118-CS"
+, institution = "Bonn University"
+, year =        1994
+, update =      "98.03 mitchell"
 }
 
 @article{bl-nopav-97
-, author =	"P. Berman and A. Lingas"
-, title =	"A nearly optimal parallel algorithm for the {Voronoi} diagram of a convex polygon"
-, journal =	"Theoret. Comput. Sci."
-, volume =	174
-, year =	1997
-, pages =	"193--202"
-, update =	"97.07 smid"
+, author =      "P. Berman and A. Lingas"
+, title =       "A nearly optimal parallel algorithm for the {Voronoi} diagram of a convex polygon"
+, journal =     "Theoret. Comput. Sci."
+, volume =      174
+, year =        1997
+, pages =       "193--202"
+, update =      "97.07 smid"
 }
 
 @inproceedings{br-iastp-92
-, author =	"P. Berman and V. Ramaiyer"
-, title =	"Improved approximations for the {Steiner} tree problem"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, month =	jan
-, year =	1992
-, pages =	"325--334"
-, update =	"98.07 bibrelex"
+, author =      "P. Berman and V. Ramaiyer"
+, title =       "Improved approximations for the {Steiner} tree problem"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, month =       jan
+, year =        1992
+, pages =       "325--334"
+, update =      "98.07 bibrelex"
 }
 
 @article{br-iastp-94
-, author =	"P. Berman and V. Ramaiyer"
-, title =	"Improved approximations for the {Steiner} tree problem"
-, journal =	"J. Algorithms"
-, volume =	17
-, year =	1994
-, pages =	"381--408"
-, update =	"95.01 smid"
+, author =      "P. Berman and V. Ramaiyer"
+, title =       "Improved approximations for the {Steiner} tree problem"
+, journal =     "J. Algorithms"
+, volume =      17
+, year =        1994
+, pages =       "381--408"
+, update =      "95.01 smid"
 }
 
 @article{bs-caisp-92
-, author =	"P. Berman and G. Schnitger"
-, title =	"On the complexity of approximating the Independent Set Problem"
-, journal =	"Inform. Comput."
-, volume =	96
-, number =	1
-, month =	jan
-, year =	1992
-, pages =	"77--94"
-, update =	"98.07 bibrelex"
+, author =      "P. Berman and G. Schnitger"
+, title =       "On the complexity of approximating the Independent Set Problem"
+, journal =     "Inform. Comput."
+, volume =      96
+, number =      1
+, month =       jan
+, year =        1992
+, pages =       "77--94"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{b-hg-78
-, author =	"J. C. Bermond"
-, title =	"Hamiltonian Graphs"
-, editor =	"L. W. Beineke and R. J. Wilson"
-, booktitle =	"Selected Topics in Graph Theory"
-, publisher =	"Academic Press"
-, address =	"London, UK"
-, year =	1978
-, update =	"98.03 bibrelex"
+, author =      "J. C. Bermond"
+, title =       "Hamiltonian Graphs"
+, editor =      "L. W. Beineke and R. J. Wilson"
+, booktitle =   "Selected Topics in Graph Theory"
+, publisher =   "Academic Press"
+, address =     "London, UK"
+, year =        1978
+, update =      "98.03 bibrelex"
 }
 
 @article{b-acpqh-93
-, author =	"M. Bern"
-, title =	"Approximate closest-point queries in high dimensions"
-, journal =	"Inform. Process. Lett."
-, volume =	45
-, year =	1993
-, pages =	"95--99"
-, update =	"93.05 smid"
+, author =      "M. Bern"
+, title =       "Approximate closest-point queries in high dimensions"
+, journal =     "Inform. Process. Lett."
+, volume =      45
+, year =        1993
+, pages =       "95--99"
+, update =      "93.05 smid"
 }
 
 @inproceedings{b-ct-93
-, author =	"M. Bern"
-, title =	"Compatible tetrahedralizations"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"281--288"
-, cites =	"agss-ltacv-89, ae-tpss-87, be-mgot-92t, c-cpplb-84, c-oaitd-92, cegs-dwclp-92, cp-tncp-90, de-iabns-93, dk-fdpi-82, dc-chtt-91, epw-tpstd-90, e-dtdlp-92, gp-cdpb-88, hs-cpmfl-92, k-osps-83, l-tsfpp-11, rs-dttdn-92, s-udzvd-28, g-vcem-77, h-fssp-81, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "M. Bern"
+, title =       "Compatible tetrahedralizations"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "281--288"
+, cites =       "agss-ltacv-89, ae-tpss-87, be-mgot-92t, c-cpplb-84, c-oaitd-92, cegs-dwclp-92, cp-tncp-90, de-iabns-93, dk-fdpi-82, dc-chtt-91, epw-tpstd-90, e-dtdlp-92, gp-cdpb-88, hs-cpmfl-92, k-osps-83, l-tsfpp-11, rs-dttdn-92, s-udzvd-28, g-vcem-77, h-fssp-81, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{b-feast-90
-, author =	"M. Bern"
-, title =	"Faster exact algorithms for {Steiner} trees in planar networks"
-, journal =	"Networks"
-, volume =	20
-, number =	1
-, year =	1990
-, pages =	"109--120"
-, keywords =	"Steiner tree"
-, update =	"95.05 korneenko"
+, author =      "M. Bern"
+, title =       "Faster exact algorithms for {Steiner} trees in planar networks"
+, journal =     "Networks"
+, volume =      20
+, number =      1
+, year =        1990
+, pages =       "109--120"
+, keywords =    "Steiner tree"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{b-hsrr-88
-, author =	"M. Bern"
-, title =	"Hidden surface removal for rectangles"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"183--192"
-, precedes =	"b-hsrr-90"
-, cites =	"cg-fc1ds-86, dsst-mdsp-86, e-ndrs-81, em-ioo-81, fmn-dgds-85, g-pahle-87i, gmpr-nrll-77, go-nasch-85, m-pst-81, m-wcohs-87, m-ceicw-86, ps-cgi-85, pvy-cavsi-88, st-pplup-86, ekz-diepq-77, wl-arrcd-85, ZZZ"
-, update =	"98.03 bibrelex, 95.05 franciosa"
+, author =      "M. Bern"
+, title =       "Hidden surface removal for rectangles"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "183--192"
+, precedes =    "b-hsrr-90"
+, cites =       "cg-fc1ds-86, dsst-mdsp-86, e-ndrs-81, em-ioo-81, fmn-dgds-85, g-pahle-87i, gmpr-nrll-77, go-nasch-85, m-pst-81, m-wcohs-87, m-ceicw-86, ps-cgi-85, pvy-cavsi-88, st-pplup-86, ekz-diepq-77, wl-arrcd-85, ZZZ"
+, update =      "98.03 bibrelex, 95.05 franciosa"
 }
 
 @article{b-hsrr-90
-, author =	"M. Bern"
-, title =	"Hidden surface removal for rectangles"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	40
-, year =	1990
-, pages =	"49--69"
-, succeeds =	"b-hsrr-88"
-, update =	"95.05 franciosa"
+, author =      "M. Bern"
+, title =       "Hidden surface removal for rectangles"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      40
+, year =        1990
+, pages =       "49--69"
+, succeeds =    "b-hsrr-88"
+, update =      "95.05 franciosa"
 }
 
 @incollection{b-t-97
-, author =	"M. Bern"
-, title =	"Triangulations"
-, chapter =	22
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"413--428"
-, update =	"97.11 orourke"
+, author =      "M. Bern"
+, title =       "Triangulations"
+, chapter =     22
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "413--428"
+, update =      "97.11 orourke"
 }
 
 @article{bb-psscs-91
-, author =	"M. Bern and D. Bienstock"
-, title =	"Polynomially solvable special cases of the {Steiner} tree problem in planar networks"
-, journal =	"Ann. Oper. Res."
-, volume =	33
-, number =	"1--4"
-, year =	1991
-, pages =	"405--418"
-, keywords =	"Steiner tree"
-, update =	"95.05 korneenko"
+, author =      "M. Bern and D. Bienstock"
+, title =       "Polynomially solvable special cases of the {Steiner} tree problem in planar networks"
+, journal =     "Ann. Oper. Res."
+, volume =      33
+, number =      "1--4"
+, year =        1991
+, pages =       "405--418"
+, keywords =    "Steiner tree"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bcer-dbmgh-93
-, author =	"M. Bern and L. P. Chew and D. Eppstein and J. Ruppert"
-, title =	"Dihedral Bounds for Mesh Generation in High Dimensions"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "M. Bern and L. P. Chew and D. Eppstein and J. Ruppert"
+, title =       "Dihedral Bounds for Mesh Generation in High Dimensions"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bcer-dbmgh-95
-, author =	"Marshall Bern and Paul Chew and David Eppstein and Jim Ruppert"
-, title =	"Dihedral Bounds for Mesh Generation in High Dimensions"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"189--196"
-, update =	"96.09 agarwal, 96.05 mitchell"
+, author =      "Marshall Bern and Paul Chew and David Eppstein and Jim Ruppert"
+, title =       "Dihedral Bounds for Mesh Generation in High Dimensions"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "189--196"
+, update =      "96.09 agarwal, 96.05 mitchell"
 }
 
 @inproceedings{bdeh-dpaomt-98
-, author =	"M. Bern and E. D. Demaine and D. Eppstein and B. Hayes"
-, title =	"A disk-packing algorithm for an origami magic trick"
-, booktitle =	"Proc. Internat. Conf. Fun with Algorithms"
-, site =	"Elba, Italy"
-, month =	jun
-, year =	1998
-, update =	"00.03 orourke"
+, author =      "M. Bern and E. D. Demaine and D. Eppstein and B. Hayes"
+, title =       "A disk-packing algorithm for an origami magic trick"
+, booktitle =   "Proc. Internat. Conf. Fun with Algorithms"
+, site =        "Elba, Italy"
+, month =       jun
+, year =        1998
+, update =      "00.03 orourke"
 }
 
 @inproceedings{bdek-up-99
-, author =	"M. Bern and E. D. Demaine and D. Eppstein and E. Kuo"
-, title =	"Ununfoldable Polyhedra"
-, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
-, year =	1999
-, pages =	"13--16"
-, note =	"Full version: https://arXiv.org/abs/cs/9908003/"
-, url =	"http://www.cs.ubc.ca/conferences/CCCG/elec_proc/elecproc.html"
-, update =	"01.11 orourke, 00.03 orourke"
+, author =      "M. Bern and E. D. Demaine and D. Eppstein and E. Kuo"
+, title =       "Ununfoldable Polyhedra"
+, booktitle =   "Proc. 11th Canad. Conf. Comput. Geom."
+, year =        1999
+, pages =       "13--16"
+, note =        "Full version: https://arXiv.org/abs/cs/9908003/"
+, url = "http://www.cs.ubc.ca/conferences/CCCG/elec_proc/elecproc.html"
+, update =      "01.11 orourke, 00.03 orourke"
 }
 
 @article{bdems-uptf-01
-, author =	"M. Bern and E. D. Demaine and D. Eppstein and E. Kuo and A. Mantler and J. Snoeyink"
-, title =	"Ununfoldable Polyhedra with Convex Faces"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	"??"
-, year =	2001
-, pages =	"?--?"
-, update =	"01.11 orourke, 01.04 orourke"
+, author =      "M. Bern and E. D. Demaine and D. Eppstein and E. Kuo and A. Mantler and J. Snoeyink"
+, title =       "Ununfoldable Polyhedra with Convex Faces"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      "??"
+, year =        2001
+, pages =       "?--?"
+, update =      "01.11 orourke, 01.04 orourke"
 }
 
 @inproceedings{bde-tpwla-92
-, author =	"M. Bern and D. Dobkin and D. Eppstein"
-, title =	"Triangulating polygons without large angles"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"222--231"
-, precedes =	"bde-tpwla-95"
-, cites =	"ba-acfem-76, bgr-ntp-88, b-casrd-83, beemt-eiot-92i, be-psntp-91, be-mgot-92i, beg-pgmg-90, et-ubcdt-92, etw-otama-90, e-amwt-92, gcr-acmut-77, g-eblit-75, ms-cinap-92, mv-qmgtd-92i, sdhk-lht-91, ZZZ"
-, update =	"97.11 bibrelex, 96.09 devillers"
+, author =      "M. Bern and D. Dobkin and D. Eppstein"
+, title =       "Triangulating polygons without large angles"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "222--231"
+, precedes =    "bde-tpwla-95"
+, cites =       "ba-acfem-76, bgr-ntp-88, b-casrd-83, beemt-eiot-92i, be-psntp-91, be-mgot-92i, beg-pgmg-90, et-ubcdt-92, etw-otama-90, e-amwt-92, gcr-acmut-77, g-eblit-75, ms-cinap-92, mv-qmgtd-92i, sdhk-lht-91, ZZZ"
+, update =      "97.11 bibrelex, 96.09 devillers"
 }
 
 @article{bde-tpwla-95
-, author =	"M. Bern and D. Dobkin and D. Eppstein"
-, title =	"Triangulating polygons without large angles"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"171--192"
-, keywords =	"computational geometry, mesh generation, triangulation, angle condition"
-, succeeds =	"bde-tpwla-92"
-, update =	"96.09 devillers"
+, author =      "M. Bern and D. Dobkin and D. Eppstein"
+, title =       "Triangulating polygons without large angles"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "171--192"
+, keywords =    "computational geometry, mesh generation, triangulation, angle condition"
+, succeeds =    "bde-tpwla-92"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{bdeg-vmpv-90
-, author =	"M. Bern and D. Dobkin and D. Eppstein and R. Grossman"
-, title =	"Visibility with a moving point of view"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"107--117"
-, update =	"95.01 smid"
+, author =      "M. Bern and D. Dobkin and D. Eppstein and R. Grossman"
+, title =       "Visibility with a moving point of view"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "107--117"
+, update =      "95.01 smid"
 }
 
 @article{bdeg-vmpv-94
-, author =	"M. Bern and D. Dobkin and D. Eppstein and R. Grossman"
-, title =	"Visibility with a moving point of view"
-, journal =	"Algorithmica"
-, volume =	11
-, year =	1994
-, pages =	"360--378"
-, keywords =	"visibility"
-, update =	"94.09 orourke"
+, author =      "M. Bern and D. Dobkin and D. Eppstein and R. Grossman"
+, title =       "Visibility with a moving point of view"
+, journal =     "Algorithmica"
+, volume =      11
+, year =        1994
+, pages =       "360--378"
+, keywords =    "visibility"
+, update =      "94.09 orourke"
 }
 
 @techreport{beemt-eiot-92t
-, author =	"M. Bern and H. Edelsbrunner and D. Eppstein and S. Mitchell and T. S. Tan"
-, title =	"Edge-insertion for optimal triangulations"
-, type =	"Tech. Report"
-, number =	"EDC UILU-ENG-92-1702"
-, institution =	"Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1992
-, precedes =	"beemt-eiot-93"
-, update =	"95.05 korneenko"
+, author =      "M. Bern and H. Edelsbrunner and D. Eppstein and S. Mitchell and T. S. Tan"
+, title =       "Edge-insertion for optimal triangulations"
+, type =        "Tech. Report"
+, number =      "EDC UILU-ENG-92-1702"
+, institution = "Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1992
+, precedes =    "beemt-eiot-93"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{beemt-eiot-92i
-, author =	"M. Bern and H. Edelsbrunner and D. Eppstein and S. Mitchell and T. S. Tan"
-, title =	"Edge-insertion for optimal triangulations"
-, booktitle =	"Proc. Latin Amer. Sympos. Theoret. Informatics"
-, nickname =	"LATIN '92"
-, site =	"Sao Paulo"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	583
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"46--60"
-, precedes =	"beemt-eiot-93"
-, update =	"99.11 bibrelex, 95.05 korneenko"
+, author =      "M. Bern and H. Edelsbrunner and D. Eppstein and S. Mitchell and T. S. Tan"
+, title =       "Edge-insertion for optimal triangulations"
+, booktitle =   "Proc. Latin Amer. Sympos. Theoret. Informatics"
+, nickname =    "LATIN '92"
+, site =        "Sao Paulo"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      583
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "46--60"
+, precedes =    "beemt-eiot-93"
+, update =      "99.11 bibrelex, 95.05 korneenko"
 }
 
 @article{beemt-eiot-93
-, author =	"M. Bern and H. Edelsbrunner and D. Eppstein and S. Mitchell and T. S. Tan"
-, title =	"Edge insertion for optimal triangulations"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, number =	1
-, year =	1993
-, pages =	"47--65"
-, keywords =	"points, triangulation"
-, succeeds =	"beemt-eiot-92t, beemt-eiot-92i"
-, update =	"95.05 korneenko"
+, author =      "M. Bern and H. Edelsbrunner and D. Eppstein and S. Mitchell and T. S. Tan"
+, title =       "Edge insertion for optimal triangulations"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, number =      1
+, year =        1993
+, pages =       "47--65"
+, keywords =    "points, triangulation"
+, succeeds =    "beemt-eiot-92t, beemt-eiot-92i"
+, update =      "95.05 korneenko"
 }
 
 @incollection{be-aagp-97
-, author =	"M. Bern and D. Eppstein"
-, title =	"Approximation algorithms for geometric problems"
-, editor =	"Dorit S. Hochbaum"
-, booktitle =	"Approximation Algorithms for NP-Hard Problems"
-, publisher =	"PWS Publishing Company"
-, address =	"Boston, MA"
-, year =	1997
-, pages =	"296--345"
-, succeeds =	"be-gaa-95"
-, update =	"98.07 agarwal, 97.11 bibrelex, 97.07 smid, 97.03 agarwal+held, 95.09 mitchell"
+, author =      "M. Bern and D. Eppstein"
+, title =       "Approximation algorithms for geometric problems"
+, editor =      "Dorit S. Hochbaum"
+, booktitle =   "Approximation Algorithms for NP-Hard Problems"
+, publisher =   "PWS Publishing Company"
+, address =     "Boston, MA"
+, year =        1997
+, pages =       "296--345"
+, succeeds =    "be-gaa-95"
+, update =      "98.07 agarwal, 97.11 bibrelex, 97.07 smid, 97.03 agarwal+held, 95.09 mitchell"
 }
 
 @misc{be-gaa-95
-, author =	"M. Bern and D. Eppstein"
-, title =	"Geometric approximation algorithms"
-, year =	1995
-, note =	"manuscript"
-, precedes =	"be-aagp-97"
-, update =	"97.11 bibrelex, 95.05 agarwal"
+, author =      "M. Bern and D. Eppstein"
+, title =       "Geometric approximation algorithms"
+, year =        1995
+, note =        "manuscript"
+, precedes =    "be-aagp-97"
+, update =      "97.11 bibrelex, 95.05 agarwal"
 }
 
 @techreport{be-mgot-92t
-, author =	"M. Bern and D. Eppstein"
-, title =	"Mesh generation and optimal triangulation"
-, type =	"Tech. Report"
-, number =	"CSL-92-1"
-, institution =	"Xerox PARC"
-, address =	"Palo Alto, CA"
-, year =	1992
-, precedes =	"be-mgot-92i"
+, author =      "M. Bern and D. Eppstein"
+, title =       "Mesh generation and optimal triangulation"
+, type =        "Tech. Report"
+, number =      "CSL-92-1"
+, institution = "Xerox PARC"
+, address =     "Palo Alto, CA"
+, year =        1992
+, precedes =    "be-mgot-92i"
 }
 
 @incollection{be-mgot-92i
-, author =	"M. Bern and D. Eppstein"
-, title =	"Mesh generation and optimal triangulation"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	1
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1992
-, pages =	"23--90"
-, keywords =	"survey paper, mesh generation, optimal triangulation, Steiner triangulation"
-, succeeds =	"be-mgot-92t"
-, precedes =	"be-mgot-95"
-, update =	"98.07 icking, 93.09 erickson"
+, author =      "M. Bern and D. Eppstein"
+, title =       "Mesh generation and optimal triangulation"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      1
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1992
+, pages =       "23--90"
+, keywords =    "survey paper, mesh generation, optimal triangulation, Steiner triangulation"
+, succeeds =    "be-mgot-92t"
+, precedes =    "be-mgot-95"
+, update =      "98.07 icking, 93.09 erickson"
 }
 
 @incollection{be-mgot-95
-, author =	"M. Bern and D. Eppstein"
-, title =	"Mesh generation and optimal triangulation"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1995
-, pages =	"47--123"
-, keywords =	"survey paper, mesh generation, optimal triangulation, Steiner triangulation"
-, succeeds =	"be-mgot-92i"
-, update =	"98.07 icking, 97.11 bibrelex, 97.03 pocchiola"
+, author =      "M. Bern and D. Eppstein"
+, title =       "Mesh generation and optimal triangulation"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1995
+, pages =       "47--123"
+, keywords =    "survey paper, mesh generation, optimal triangulation, Steiner triangulation"
+, succeeds =    "be-mgot-92i"
+, update =      "98.07 icking, 97.11 bibrelex, 97.03 pocchiola"
 }
 
 @inproceedings{be-mrd-00
-, author =	"Marshall Bern and David Eppstein"
-, title =	"Multivariate Regression Depth"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"315--321"
-, update =	"00.11 jones"
+, author =      "Marshall Bern and David Eppstein"
+, title =       "Multivariate Regression Depth"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "315--321"
+, update =      "00.11 jones"
 }
 
 @inproceedings{be-psntp-91
-, author =	"M. Bern and D. Eppstein"
-, title =	"Polynomial-size nonobtuse triangulation of polygons"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"342--350"
-, keywords =	"triangulation, polygons"
-, precedes =	"be-psntp-92"
-, cites =	"bgr-ntp-88, beg-pgmg-90, bg-dpd-91, c-cdt-87, etw-otama-90, e-fpdtm-90, f-cfemg-72, g-dpnet-84, ll-gdtpg-86, ls-tacdt-80, ms-getcc-88, sdhk-lht-91, s-let-78, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "M. Bern and D. Eppstein"
+, title =       "Polynomial-size nonobtuse triangulation of polygons"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "342--350"
+, keywords =    "triangulation, polygons"
+, precedes =    "be-psntp-92"
+, cites =       "bgr-ntp-88, beg-pgmg-90, bg-dpd-91, c-cdt-87, etw-otama-90, e-fpdtm-90, f-cfemg-72, g-dpnet-84, ll-gdtpg-86, ls-tacdt-80, ms-getcc-88, sdhk-lht-91, s-let-78, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{be-psntp-92
-, author =	"M. Bern and D. Eppstein"
-, title =	"Polynomial-size nonobtuse triangulation of polygons"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"241--255, 449--450"
-, keywords =	"mesh generation, triangulation, angle condition"
-, succeeds =	"be-psntp-91"
-, update =	"96.09 devillers"
+, author =      "M. Bern and D. Eppstein"
+, title =       "Polynomial-size nonobtuse triangulation of polygons"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "241--255, 449--450"
+, keywords =    "mesh generation, triangulation, angle condition"
+, succeeds =    "be-psntp-91"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{be-wcbsg-93
-, author =	"M. Bern and D. Eppstein"
-, title =	"Worst-case bounds for subadditive geometric graphs"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"183--188"
-, cites =	"akt-om-84, gp-smt-68, k-hlcet-89, s-rpmbp-85, s-lbrst-91, s-wcmrs-92, ss-piets-92, s-sefnl-81, s-pwcac-90, ss-wcgmu-90, ss-wcgrs-89, u-cav-92, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
+, author =      "M. Bern and D. Eppstein"
+, title =       "Worst-case bounds for subadditive geometric graphs"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "183--188"
+, cites =       "akt-om-84, gp-smt-68, k-hlcet-89, s-rpmbp-85, s-lbrst-91, s-wcmrs-92, ss-piets-92, s-sefnl-81, s-pwcac-90, ss-wcgmu-90, ss-wcgrs-89, u-cav-92, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
 }
 
 @misc{be-ecct-99
-, author =	"M. Bern and D. Eppstein and P. K. Agarwal and N. Amenta and P. Chew and T. Dey and D. P. Dobkin and H. Edelsbrunner and C. Grimm and L. J. Guibas and J. Harer and J. Hass and A. Hicks and C. K. Johnson and G. Lerman and D. Letscher and P. Plassmann and E. Sedgwick and J. Snoeyink and J. Weeks and C. Yap and D. Zorin"
-, title =	"Emerging Challenges in Computational Topology"
-, year =	1999
-, note =	"Report on an NSF Workshop on Computational Topology,
+, author =      "M. Bern and D. Eppstein and P. K. Agarwal and N. Amenta and P. Chew and T. Dey and D. P. Dobkin and H. Edelsbrunner and C. Grimm and L. J. Guibas and J. Harer and J. Hass and A. Hicks and C. K. Johnson and G. Lerman and D. Letscher and P. Plassmann and E. Sedgwick and J. Snoeyink and J. Weeks and C. Yap and D. Zorin"
+, title =       "Emerging Challenges in Computational Topology"
+, year =        1999
+, note =        "Report on an NSF Workshop on Computational Topology,
         June 11-12, Miami Beach, FL."
-, update =	"01.07 orourke"
+, update =      "01.07 orourke"
 }
 
 @inproceedings{beg-pgmg-90
-, author =	"M. Bern and D. Eppstein and J. Gilbert"
-, title =	"Provably good mesh generation"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"231--241"
-, keywords =	"VLSI design"
-, update =	"98.03 smid"
+, author =      "M. Bern and D. Eppstein and J. Gilbert"
+, title =       "Provably good mesh generation"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "231--241"
+, keywords =    "VLSI design"
+, update =      "98.03 smid"
 }
 
 @article{beg-pgmg-94
-, author =	"M. Bern and D. Eppstein and J. Gilbert"
-, title =	"Provably good mesh generation"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	48
-, year =	1994
-, pages =	"384--409"
-, update =	"98.03 smid"
+, author =      "M. Bern and D. Eppstein and J. Gilbert"
+, title =       "Provably good mesh generation"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      48
+, year =        1994
+, pages =       "384--409"
+, update =      "98.03 smid"
 }
 
 @inproceedings{beghs-cpaw-95
-, author =	"M. Bern and D. Eppstein and L. J. Guibas and J. Hershberger and S. Suri and J. Wolter"
-, title =	"The centroid of points with approximate weights"
-, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
-, nickname =	"ESA '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	979
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"460--472"
-, update =	"01.11 smid"
+, author =      "M. Bern and D. Eppstein and L. J. Guibas and J. Hershberger and S. Suri and J. Wolter"
+, title =       "The centroid of points with approximate weights"
+, booktitle =   "Proc. 3rd Annu. European Sympos. Algorithms"
+, nickname =    "ESA '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      979
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "460--472"
+, update =      "01.11 smid"
 }
 
 @incollection{bepy-htlp-91
-, author =	"M. Bern and D. Eppstein and P. Plassman and F. Yao"
-, title =	"Horizon theorems for lines and polygons"
-, editor =	"J. Goodman and R. Pollack and W. Steiger"
-, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
-, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
-, volume =	6
-, publisher =	"American Mathematical Society, Association for Computing Machinery"
-, address =	"Providence, RI"
-, year =	1991
-, pages =	"45--66"
-, keywords =	"arrangements, horizon, pseudo lines"
-, update =	"99.11 bibrelex, 95.09 agarwal"
+, author =      "M. Bern and D. Eppstein and P. Plassman and F. Yao"
+, title =       "Horizon theorems for lines and polygons"
+, editor =      "J. Goodman and R. Pollack and W. Steiger"
+, booktitle =   "Discrete and Computational Geometry: Papers from the DIMACS Special Year"
+, series =      "DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
+, volume =      6
+, publisher =   "American Mathematical Society, Association for Computing Machinery"
+, address =     "Providence, RI"
+, year =        1991
+, pages =       "45--66"
+, keywords =    "arrangements, horizon, pseudo lines"
+, update =      "99.11 bibrelex, 95.09 agarwal"
 }
 
 @inproceedings{bet-pcqqt-93
-, author =	"Marshall Bern and David Eppstein and Shan-Hua Teng"
-, title =	"Parallel Construction of Quadtrees and Quality Triangulations"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"188--199"
-, update =	"93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "Marshall Bern and David Eppstein and Shan-Hua Teng"
+, title =       "Parallel Construction of Quadtrees and Quality Triangulations"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "188--199"
+, update =      "93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @article{bet-pcqqt-99
-, author =	"M. Bern and D. Eppstein and S.-H. Teng"
-, title =	"Parallel Construction of Quadtrees and Quality Triangulations"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, number =	6
-, year =	1999
-, pages =	"517--532"
-, update =	"00.03 held"
+, author =      "M. Bern and D. Eppstein and S.-H. Teng"
+, title =       "Parallel Construction of Quadtrees and Quality Triangulations"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, number =      6
+, year =        1999
+, pages =       "517--532"
+, update =      "00.03 held"
 }
 
 @inproceedings{bey-eedt-91i
-, author =	"M. Bern and D. Eppstein and F. Yao"
-, title =	"The expected extremes in a {Delaunay} triangulation"
-, booktitle =	"Proc. 18th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	510
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"674--685"
+, author =      "M. Bern and D. Eppstein and F. Yao"
+, title =       "The expected extremes in a {Delaunay} triangulation"
+, booktitle =   "Proc. 18th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      510
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "674--685"
 }
 
 @article{bey-eedt-91a
-, author =	"M. Bern and D. Eppstein and F. Yao"
-, title =	"The expected extremes in a {Delaunay} triangulation"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, year =	1991
-, pages =	"79--91"
-, keywords =	"Delaunay triangulation, probabilistic analysis"
+, author =      "M. Bern and D. Eppstein and F. Yao"
+, title =       "The expected extremes in a {Delaunay} triangulation"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, year =        1991
+, pages =       "79--91"
+, keywords =    "Delaunay triangulation, probabilistic analysis"
 }
 
 @techreport{bg-dpd-91
-, author =	"M. Bern and J. Gilbert"
-, title =	"Drawing the planar dual"
-, type =	"Manuscript"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "M. Bern and J. Gilbert"
+, title =       "Drawing the planar dual"
+, type =        "Manuscript"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bgrs-olalc-90
-, author =	"M. Bern and D. Greene and A. Raghunathan and M. Sudan"
-, title =	"Online Algorithms for Locating Checkpoints"
-, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
-, year =	1990
-, pages =	"359--368"
-, update =	"95.01 smid, 93.09 milone+mitchell"
+, author =      "M. Bern and D. Greene and A. Raghunathan and M. Sudan"
+, title =       "Online Algorithms for Locating Checkpoints"
+, booktitle =   "Proc. 22nd Annu. ACM Sympos. Theory Comput."
+, year =        1990
+, pages =       "359--368"
+, update =      "95.01 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{bh-cfo-96
-, author =	"Marshall Bern and Barry Hayes"
-, title =	"The complexity of flat origami"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"175--183"
-, keywords =	"NP-hardness, crease patterns, flat folding, flat foldability"
-, update =	"96.09 agarwal, 96.01 mitchell"
+, author =      "Marshall Bern and Barry Hayes"
+, title =       "The complexity of flat origami"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "175--183"
+, keywords =    "NP-hardness, crease patterns, flat folding, flat foldability"
+, update =      "96.09 agarwal, 96.01 mitchell"
 }
 
 @inproceedings{bmr-lsntp-94
-, author =	"M. Bern and S. Mitchell and J. Ruppert"
-, title =	"Linear-Size Nonobtuse Triangulation of Polygons"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"221--230"
-, cites =	"agss-ltacv-89, ba-acfem-76, bgr-ntp-88, b-pug-90, bs-dsp1s-80, bcer-dbmgh-93, bde-tpwla-92, be-psntp-92, be-mgot-92t, beg-pgmg-90, c-ig-61, et-ubcdt-93, f-savd-87, goy-cvdsl-93, -mrg-92, ms-cinap-92, m-rtpsl-93, m-fctwm-94, m-pabst-93, mkf-arbam-92, ps-cgi-85, r-cag-61, r-nsaq2-93, sg-cmpbf-92, sf-afem-73, t-pssug-90, v-sfepw-93, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "M. Bern and S. Mitchell and J. Ruppert"
+, title =       "Linear-Size Nonobtuse Triangulation of Polygons"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "221--230"
+, cites =       "agss-ltacv-89, ba-acfem-76, bgr-ntp-88, b-pug-90, bs-dsp1s-80, bcer-dbmgh-93, bde-tpwla-92, be-psntp-92, be-mgot-92t, beg-pgmg-90, c-ig-61, et-ubcdt-93, f-savd-87, goy-cvdsl-93, -mrg-92, ms-cinap-92, m-rtpsl-93, m-fctwm-94, m-pabst-93, mkf-arbam-92, ps-cgi-85, r-cag-61, r-nsaq2-93, sg-cmpbf-92, sf-afem-73, t-pssug-90, v-sfepw-93, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @incollection{bp-mg-00
-, author =	"Marshall Bern and Paul Plassmann"
-, title =	"Mesh Generation"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"291--332"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 6 of su-hcg-00"
+, author =      "Marshall Bern and Paul Plassmann"
+, title =       "Mesh Generation"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "291--332"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 6 of su-hcg-00"
 }
 
 @inproceedings{bs-pdtcm-96
-, author =	"Marshall Bern and Amit Sahai"
-, title =	"Pushing Disks Together -- {The} Continuous-Motion Case"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '96"
-, year =	1996
-, pages =	"119--125"
-, update =	"00.03 smid, 98.07 bibrelex, 98.03 mitchell"
+, author =      "Marshall Bern and Amit Sahai"
+, title =       "Pushing Disks Together -- {The} Continuous-Motion Case"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '96"
+, year =        1996
+, pages =       "119--125"
+, update =      "00.03 smid, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @article{bs-pdtcm-98
-, author =	"Marshall Bern and Amit Sahai"
-, title =	"Pushing Disks Together -- {The} Continuous-Motion Case"
-, journal =	"Discrete Comput. Geom."
-, volume =	20
-, year =	1998
-, pages =	"499--514"
-, update =	"01.07 orourke"
+, author =      "Marshall Bern and Amit Sahai"
+, title =       "Pushing Disks Together -- {The} Continuous-Motion Case"
+, journal =     "Discrete Comput. Geom."
+, volume =      20
+, year =        1998
+, pages =       "499--514"
+, update =      "01.07 orourke"
 }
 
 @inproceedings{b-tprrs-86
-, author =	"M. W. Bern"
-, title =	"Two probabilistic results on rectilinear {Steiner} trees"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"433--441"
-, precedes =	"b-tprrs-88"
+, author =      "M. W. Bern"
+, title =       "Two probabilistic results on rectilinear {Steiner} trees"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "433--441"
+, precedes =    "b-tprrs-88"
 }
 
 @article{b-tprrs-88
-, author =	"M. W. Bern"
-, title =	"Two probabilistic results on rectilinear {Steiner} trees"
-, journal =	"Algorithmica"
-, volume =	3
-, year =	1988
-, pages =	"191--204"
-, succeeds =	"b-tprrs-86"
+, author =      "M. W. Bern"
+, title =       "Two probabilistic results on rectilinear {Steiner} trees"
+, journal =     "Algorithmica"
+, volume =      3
+, year =        1988
+, pages =       "191--204"
+, succeeds =    "b-tprrs-86"
 }
 
 @inproceedings{bkrs-fgatg-89
-, author =	"M. W. Bern and H. J. Karloff and P. Raghavan and B. Schieber"
-, title =	"Fast geometric approximation techniques and geometric embedding problems"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"292--301"
-, precedes =	"bkrs-fgatg-92"
-, cites =	"aa-pcaap-88, bfp-aach-82, bb-gweto-87, cf-shvd-88, c-wcanh-76, c-lat-84, ft-fhtui-87, ggj-sncgp-76, gj-cigtn-79, h-aagep-89, ll-wsisa-85, py-crstp-82, ps-cgi-85, s-a-83, sy-lbcft-76, v-ghm-88, v-amwmp-89, ekz-diepq-77, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "M. W. Bern and H. J. Karloff and P. Raghavan and B. Schieber"
+, title =       "Fast geometric approximation techniques and geometric embedding problems"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "292--301"
+, precedes =    "bkrs-fgatg-92"
+, cites =       "aa-pcaap-88, bfp-aach-82, bb-gweto-87, cf-shvd-88, c-wcanh-76, c-lat-84, ft-fhtui-87, ggj-sncgp-76, gj-cigtn-79, h-aagep-89, ll-wsisa-85, py-crstp-82, ps-cgi-85, s-a-83, sy-lbcft-76, v-ghm-88, v-amwmp-89, ekz-diepq-77, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{bkrs-fgatg-92
-, author =	"Marshall W. Bern and Howard J. Karloff and Prabhakar Raghavan and Baruch Schieber"
-, title =	"Fast Geometric Approximation Techniques and Geometric Embedding Problems"
-, journal =	"Theoret. Comput. Sci."
-, volume =	106
-, number =	2
-, month =	dec
-, year =	1992
-, pages =	"265--281"
-, succeeds =	"bkrs-fgatg-89"
-, update =	"98.03 mitchell"
+, author =      "Marshall W. Bern and Howard J. Karloff and Prabhakar Raghavan and Baruch Schieber"
+, title =       "Fast Geometric Approximation Techniques and Geometric Embedding Problems"
+, journal =     "Theoret. Comput. Sci."
+, volume =      106
+, number =      2
+, month =       dec
+, year =        1992
+, pages =       "265--281"
+, succeeds =    "bkrs-fgatg-89"
+, update =      "98.03 mitchell"
 }
 
 @techreport{b-el3dv-90
-, author =	"J. Bernal"
-, title =	"An Expected Linear 3-Dimensional {Voronoi} Diagram Algorithm"
-, number =	"NISTIR 4340"
-, institution =	"National Inst. of Standards and Technology"
-, address =	"Gaithersburg, MD"
-, month =	jun
-, year =	1990
-, keywords =	"Voronoi diagram, expected complexity, expected linear"
-, update =	"94.09 bernal"
-, abstract =	"Let S be a set of n sites chosen independently from
+, author =      "J. Bernal"
+, title =       "An Expected Linear 3-Dimensional {Voronoi} Diagram Algorithm"
+, number =      "NISTIR 4340"
+, institution = "National Inst. of Standards and Technology"
+, address =     "Gaithersburg, MD"
+, month =       jun
+, year =        1990
+, keywords =    "Voronoi diagram, expected complexity, expected linear"
+, update =      "94.09 bernal"
+, abstract =    "Let S be a set of n sites chosen independently from
                  a uniform distribution in a cube in 3-dimensional
                  Euclidean space. In this paper, an expected O(n)
                  algorithm for constructing the Voronoi diagram
@@ -20172,65 +20172,65 @@ @techreport{b-el3dv-90
 }
 
 @techreport{b-bnvd
-, author =	"J. Bernal"
-, title =	"Bibliographic notes on {Voronoi} diagrams"
-, institution =	"National Institute of Standards and Technology"
-, address =	"Gaithersburg, MD 20899"
-, year =	1992
-, update =	"00.03 bibrelex"
+, author =      "J. Bernal"
+, title =       "Bibliographic notes on {Voronoi} diagrams"
+, institution = "National Institute of Standards and Technology"
+, address =     "Gaithersburg, MD 20899"
+, year =        1992
+, update =      "00.03 bibrelex"
 }
 
 @techreport{b-cdtsc-88
-, author =	"J. Bernal"
-, title =	"Constructing {Delaunay} Triangulations For Sets Constrained By Line Segments"
-, number =	"NIST/TN-1252"
-, institution =	"Mathematical Analysis Div., National Inst. of Standards and Technology (NEL)"
-, address =	"Gaithersburg, MD"
-, month =	sep
-, year =	1988
-, keywords =	"Delaunay triangulations, ntiscomnbs"
-, abstract =	"In the paper, the authors propose a simple algorithm
-		 for constructing a Delaunay triangulation for a finite
-		 set of points in the plane constrained by a finite
-		 collection of line segments. The algorithm constructs
-		 first a Delaunay triangulation for the set, and then
-		 generates from it a sequence of triangulations as each
-		 line segment is incorporated into the previously
-		 obtained triangulation. An expected time analysis shows
-		 the algorithm to be linear if the number of line
-		 segments is kept constant."
+, author =      "J. Bernal"
+, title =       "Constructing {Delaunay} Triangulations For Sets Constrained By Line Segments"
+, number =      "NIST/TN-1252"
+, institution = "Mathematical Analysis Div., National Inst. of Standards and Technology (NEL)"
+, address =     "Gaithersburg, MD"
+, month =       sep
+, year =        1988
+, keywords =    "Delaunay triangulations, ntiscomnbs"
+, abstract =    "In the paper, the authors propose a simple algorithm
+                 for constructing a Delaunay triangulation for a finite
+                 set of points in the plane constrained by a finite
+                 collection of line segments. The algorithm constructs
+                 first a Delaunay triangulation for the set, and then
+                 generates from it a sequence of triangulations as each
+                 line segment is incorporated into the previously
+                 obtained triangulation. An expected time analysis shows
+                 the algorithm to be linear if the number of line
+                 segments is kept constant."
 }
 
 @techreport{b-eooac-87
-, author =	"J. Bernal"
-, title =	"Expected ${O}({N})$ And ${O}({N}^{4/3})$ Algorithms For Constructing {Voronoi} Diagrams In Two And Three Dimensions"
-, number =	"NBSIR-87/3679"
-, institution =	"National Bureau of Standards (NEL), Gaithersburg, MD. Mathematical Analysis Div."
-, month =	nov
-, year =	1987
-, keywords =	"Voronoi diagrams, computational geometry, computational complexity, two dimensional, three dimensional, ntiscomnbs"
-, abstract =	"Bentley, Weide and Yao have proposed an expected O(N)
-		 cell technique for computing Voronoi diagrams in two
-		 dimensions that does not generalize readily to three.
-		 In this paper their work is further developed and
-		 generalized to produce expected O(N) and O(N sup 4/3)
-		 algorithms for constructing Voronoi diagrams in two and
-		 three dimensions, respectively. Computational
-		 experience is presented for the algorithm in two
-		 dimensions."
+, author =      "J. Bernal"
+, title =       "Expected ${O}({N})$ And ${O}({N}^{4/3})$ Algorithms For Constructing {Voronoi} Diagrams In Two And Three Dimensions"
+, number =      "NBSIR-87/3679"
+, institution = "National Bureau of Standards (NEL), Gaithersburg, MD. Mathematical Analysis Div."
+, month =       nov
+, year =        1987
+, keywords =    "Voronoi diagrams, computational geometry, computational complexity, two dimensional, three dimensional, ntiscomnbs"
+, abstract =    "Bentley, Weide and Yao have proposed an expected O(N)
+                 cell technique for computing Voronoi diagrams in two
+                 dimensions that does not generalize readily to three.
+                 In this paper their work is further developed and
+                 generalized to produce expected O(N) and O(N sup 4/3)
+                 algorithms for constructing Voronoi diagrams in two and
+                 three dimensions, respectively. Computational
+                 experience is presented for the algorithm in two
+                 dimensions."
 }
 
 @techreport{b-ec3dv-90
-, author =	"J. Bernal"
-, title =	"On the Expected Complexity of the 3-Dimensional {Voronoi} Diagram"
-, number =	"NISTIR 4321"
-, institution =	"National Inst. of Standards and Technology"
-, address =	"Gaithersburg, MD"
-, month =	may
-, year =	1990
-, keywords =	"Voronoi diagram, expected complexity, expected linear"
-, update =	"94.09 bernal"
-, abstract =	"Let S be a set of n sites chosen independently from
+, author =      "J. Bernal"
+, title =       "On the Expected Complexity of the 3-Dimensional {Voronoi} Diagram"
+, number =      "NISTIR 4321"
+, institution = "National Inst. of Standards and Technology"
+, address =     "Gaithersburg, MD"
+, month =       may
+, year =        1990
+, keywords =    "Voronoi diagram, expected complexity, expected linear"
+, update =      "94.09 bernal"
+, abstract =    "Let S be a set of n sites chosen independently from
                  a uniform distribution in a cube in 3-dimensional
                  Euclidean space. In this paper, work by Bentley,
                  Weide and Yao is extended to show that the Voronoi
@@ -20242,223 +20242,223 @@ @techreport{b-ec3dv-90
 
 % ### title?
 @article{bf-2grph-67
-, author =	"J. D. Bernal and J. L. Finney"
-, title =	"{II}. Geometry of Random Packing of Hard Spheres"
-, journal =	"Discussions of the Faraday Society"
-, volume =	43
-, year =	1967
-, pages =	"62--69"
-, annote =	"VD (in 3D) used as model of liquid. Calc stats, number
-		 of neighbours, face distributions. Algorithm: $O(n^4)$
-		 all combinations of four centres near target point."
+, author =      "J. D. Bernal and J. L. Finney"
+, title =       "{II}. Geometry of Random Packing of Hard Spheres"
+, journal =     "Discussions of the Faraday Society"
+, volume =      43
+, year =        1967
+, pages =       "62--69"
+, annote =      "VD (in 3D) used as model of liquid. Calc stats, number
+                 of neighbours, face distributions. Algorithm: $O(n^4)$
+                 all combinations of four centres near target point."
 }
 
 @inproceedings{b-adg-81
-, author =	"M. A. Bernard"
-, title =	"On the Automated Drawing of Graphs"
-, booktitle =	"Proc. 3rd Caribbean Conf. on Combinatorics and Computing"
-, year =	1981
-, pages =	"43--55"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. A. Bernard"
+, title =       "On the Automated Drawing of Graphs"
+, booktitle =   "Proc. 3rd Caribbean Conf. on Combinatorics and Computing"
+, year =        1981
+, pages =       "43--55"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{bb-srmua-97t
-, author =	"F. Bernardini and C. Bajaj"
-, title =	"Sampling and reconstructing manifolds using alpha-shapes"
-, type =	"Technical {Report}"
-, number =	"CSD-TR-97-013"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1997
-, update =	"98.07 bibrelex"
+, author =      "F. Bernardini and C. Bajaj"
+, title =       "Sampling and reconstructing manifolds using alpha-shapes"
+, type =        "Technical {Report}"
+, number =      "CSD-TR-97-013"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1997
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bbcs-ar3dc-97
-, author =	"F. Bernardini and C. Bajaj and J. Chen and D. Schikore"
-, title =	"Automatic reconstruction of $3${D} {CAD} models from digital scans"
-, type =	"Technical {Report}"
-, number =	"CSD-TR-97-012"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1997
-, update =	"98.07 bibrelex"
+, author =      "F. Bernardini and C. Bajaj and J. Chen and D. Schikore"
+, title =       "Automatic reconstruction of $3${D} {CAD} models from digital scans"
+, type =        "Technical {Report}"
+, number =      "CSD-TR-97-012"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1997
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bbcs-tborm-97
-, author =	"F. Bernardini and C. Bajaj and J. Chen and D. Schikore"
-, title =	"Triangulation-Based Object Reconstruction Methods"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"481--484"
-, keywords =	"video review"
-, cites =	"bbx-arssf-95, bbx-rsfsu-97, bcx-mcap-95, bs-ebrtm-96, bb-srmua-97t, bbcs-ar3dc-97, b-gstds-84, em-tdas-94, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "F. Bernardini and C. Bajaj and J. Chen and D. Schikore"
+, title =       "Triangulation-Based Object Reconstruction Methods"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "481--484"
+, keywords =    "video review"
+, cites =       "bbx-arssf-95, bbx-rsfsu-97, bcx-mcap-95, bs-ebrtm-96, bb-srmua-97t, bbcs-ar3dc-97, b-gstds-84, em-tdas-94, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{bb-srmua-97
-, author =	"Fausto Bernardini and Chandrajit L. Bajaj"
-, title =	"Sampling and Reconstructing Manifolds Using Alpha--Shapes"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"193--198"
-, update =	"97.11 jones"
+, author =      "Fausto Bernardini and Chandrajit L. Bajaj"
+, title =       "Sampling and Reconstructing Manifolds Using Alpha--Shapes"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "193--198"
+, update =      "97.11 jones"
 }
 
 @article{bbcs-ar3dc-99
-, author =	"F. Bernardini and C. L. Bajaj and J. Chen and D. R. Schikore"
-, title =	"Automatic reconstruction of $3${D} {CAD} models from digital scans"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, year =	1999
-, pages =	"327--369"
-, update =	"00.03 smid"
+, author =      "F. Bernardini and C. L. Bajaj and J. Chen and D. R. Schikore"
+, title =       "Automatic reconstruction of $3${D} {CAD} models from digital scans"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, year =        1999
+, pages =       "327--369"
+, update =      "00.03 smid"
 }
 
 @inproceedings{bfp-cfcss-92
-, author =	"Fausto Bernardini and Vincenzo Ferrucci and Alberto Paoluzzi"
-, title =	"Computation of Free Configuration Space by Solid Modelling Techniques"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"13--16"
-, update =	"00.03 bibrelex"
+, author =      "Fausto Bernardini and Vincenzo Ferrucci and Alberto Paoluzzi"
+, title =       "Computation of Free Configuration Space by Solid Modelling Techniques"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "13--16"
+, update =      "00.03 bibrelex"
 }
 
 @article{bmrst-bpasr-99
-, author =	"F. Bernardini and J. Mittleman and H. Rushmeir and C. Silva and G. Taubin"
-, title =	"The ball-pivoting algorithm for surface reconstruction"
-, journal =	"IEEE Transactions on Visualization and Computer Graphics"
-, volume =	5
-, number =	4
-, year =	1999
-, pages =	""
-, update =	"01.07 devillers"
+, author =      "F. Bernardini and J. Mittleman and H. Rushmeir and C. Silva and G. Taubin"
+, title =       "The ball-pivoting algorithm for surface reconstruction"
+, journal =     "IEEE Transactions on Visualization and Computer Graphics"
+, volume =      5
+, number =      4
+, year =        1999
+, pages =       ""
+, update =      "01.07 devillers"
 }
 
 @article{bk-btg-79
-, author =	"F. Bernhart and P. C. Kainen"
-, title =	"The book thickness of a graph"
-, journal =	"J. Combin. Theory"
-, volume =	"Ser. B 27"
-, year =	1979
-, pages =	"320--331"
-, update =	"98.07 bibrelex"
+, author =      "F. Bernhart and P. C. Kainen"
+, title =       "The book thickness of a graph"
+, journal =     "J. Combin. Theory"
+, volume =      "Ser. B 27"
+, year =        1979
+, pages =       "320--331"
+, update =      "98.07 bibrelex"
 }
 
 @article{bkwmbrkst-pdbcb-77
-, author =	"F. C. Bernstein and T. F. Koetzle and G. J. B. Williams and E. F. {Meyer, Jr.} and M. D. Brice and J. R. Rodgers and O. Kennard and T. Shimanouchi and M. Tasumi"
-, title =	"The protein data bank: {A} computer based archival file for macromolecular structure"
-, journal =	"J. Molecular Biology"
-, volume =	112
-, year =	1977
-, pages =	"535--542"
-, update =	"98.03 bibrelex"
+, author =      "F. C. Bernstein and T. F. Koetzle and G. J. B. Williams and E. F. {Meyer, Jr.} and M. D. Brice and J. R. Rodgers and O. Kennard and T. Shimanouchi and M. Tasumi"
+, title =       "The protein data bank: {A} computer based archival file for macromolecular structure"
+, journal =     "J. Molecular Biology"
+, volume =      112
+, year =        1977
+, pages =       "535--542"
+, update =      "98.03 bibrelex"
 }
 
 @article{b-dscns-86
-, author =	"H. J. Bernstein"
-, title =	"Determining the shape of a convex $n$-sided polygon by using $2n+k$ tactile probes"
-, journal =	"Inform. Process. Lett."
-, volume =	22
-, year =	1986
-, pages =	"255--260"
+, author =      "H. J. Bernstein"
+, title =       "Determining the shape of a convex $n$-sided polygon by using $2n+k$ tactile probes"
+, journal =     "Inform. Process. Lett."
+, volume =      22
+, year =        1986
+, pages =       "255--260"
 }
 
 @techreport{b-dscns-84
-, author =	"H. J. Bernstein"
-, title =	"Determining the Shape of a Convex $n$-Sided Polygon Using $2n+k$ Tactile Probes"
-, type =	"Technical {Report}"
-, number =	125
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, month =	jun
-, year =	1984
-, note =	"Robotics Report No. 29"
-, update =	"98.03 bibrelex"
+, author =      "H. J. Bernstein"
+, title =       "Determining the Shape of a Convex $n$-Sided Polygon Using $2n+k$ Tactile Probes"
+, type =        "Technical {Report}"
+, number =      125
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, month =       jun
+, year =        1984
+, note =        "Robotics Report No. 29"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bgos-fdcpp-97
-, author =	"R.-P. Berretty and K. Goldberg and M. Overmars and F. Van der Stappen"
-, title =	"On fence design and the complexity of push plans for orienting parts"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"21--29"
-, cites =	"aks-cdorp-95, ahlm-spfoj-96, am-ppopp-92, afkmnsu-ampcb-92, bbg-smutv-95, bdm-ulbpv-96, bpg-cfpa-93, ci-copod-95, clr-ia-90, b-lsbsp-95, em-esm-88, g-oppws-93, kos-ehsro-92, lm-spmcp-96, m-mgpo-82, mpssw-ftdlm-94, n-aaadp-86, os-rsplf-96, ps-mpsw-88, ps-prmsw-88, rg-mapp-95, sgo-gecmp-96, sho-cfsrm-93, so-mpafo-94, wgpb-cadpf-96, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
+, author =      "R.-P. Berretty and K. Goldberg and M. Overmars and F. Van der Stappen"
+, title =       "On fence design and the complexity of push plans for orienting parts"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "21--29"
+, cites =       "aks-cdorp-95, ahlm-spfoj-96, am-ppopp-92, afkmnsu-ampcb-92, bbg-smutv-95, bdm-ulbpv-96, bpg-cfpa-93, ci-copod-95, clr-ia-90, b-lsbsp-95, em-esm-88, g-oppws-93, kos-ehsro-92, lm-spmcp-96, m-mgpo-82, mpssw-ftdlm-94, n-aaadp-86, os-rsplf-96, ps-mpsw-88, ps-prmsw-88, rg-mapp-95, sgo-gecmp-96, sho-cfsrm-93, so-mpafo-94, wgpb-cadpf-96, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
 }
 
 @article{bgos-cfdop-98
-, author =	"Robert-Paul Berretty and Ken Goldberg and Mark H. Overmars and A. Frank van der Stappen"
-, title =	"Computing fence designs for orienting parts"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"249--262"
-, succeeds =	"bgos-fdcpp-97"
-, update =	"98.11 devillers"
+, author =      "Robert-Paul Berretty and Ken Goldberg and Mark H. Overmars and A. Frank van der Stappen"
+, title =       "Computing fence designs for orienting parts"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "249--262"
+, succeeds =    "bgos-fdcpp-97"
+, update =      "98.11 devillers"
 }
 
 @techreport{bos-dmpld-97b
-, author =	"R.-P. Berretty and M. Overmars and A. F. van der Stappen"
-, title =	"Dynamic motion planning in low density environments"
-, type =	"Report"
-, number =	"UU-CS-1997-20"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1997
-, update =	"97.11 oostrum"
+, author =      "R.-P. Berretty and M. Overmars and A. F. van der Stappen"
+, title =       "Dynamic motion planning in low density environments"
+, type =        "Report"
+, number =      "UU-CS-1997-20"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1997
+, update =      "97.11 oostrum"
 }
 
 @inproceedings{bos-dmpld-97
-, author =	"R.-P. Berretty and M. Overmars and A. F. van der Stappen"
-, title =	"Dynamic motion planning in low obstacle density environments"
-, booktitle =	"Proc. Workshop Algorithms Data Struct."
-, nickname =	"WADS '97"
-, site =	"Halifax, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1272
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"3--16"
-, update =	"99.11 bibrelex, 99.07 bibrelex, 98.07 bibrelex+smid, 97.11 oostrum"
+, author =      "R.-P. Berretty and M. Overmars and A. F. van der Stappen"
+, title =       "Dynamic motion planning in low obstacle density environments"
+, booktitle =   "Proc. Workshop Algorithms Data Struct."
+, nickname =    "WADS '97"
+, site =        "Halifax, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1272
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "3--16"
+, update =      "99.11 bibrelex, 99.07 bibrelex, 98.07 bibrelex+smid, 97.11 oostrum"
 }
 
 @inproceedings{bdgss-gdml-97
-, author =	"Jonathan Berry and Nathaniel Dean and Mark Goldberg and Gregory Shannon and Steven Skiena"
-, title =	"Graph Drawing and Manipulation with {LINK}"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"425--437"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Jonathan Berry and Nathaniel Dean and Mark Goldberg and Gregory Shannon and Steven Skiena"
+, title =       "Graph Drawing and Manipulation with {LINK}"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "425--437"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @book{b-bmcai-93
-, author =	"Joseph K. Berry"
-, title =	"Beyond Mapping: Concepts, Algorithms, and Issues in GIS"
-, publisher =	"GIS World"
-, address =	"Fort Collins, CO"
-, year =	1993
-, isbn =	"0-9625063-6-2"
-, update =	"95.09 mitchell"
+, author =      "Joseph K. Berry"
+, title =       "Beyond Mapping: Concepts, Algorithms, and Issues in GIS"
+, publisher =   "GIS World"
+, address =     "Fort Collins, CO"
+, year =        1993
+, isbn =        "0-9625063-6-2"
+, update =      "95.09 mitchell"
 }
 
 @techreport{brv-ipam-89
-, author =	"Patrice Bertin and Didier Roncin and Jean Vuillemin"
-, title =	"Introduction to programmable active memories"
-, type =	"Research Report"
-, number =	3
-, institution =	"Digital Paris Research Laboratory"
-, month =	jun
-, year =	1989
-, update =	"98.11 bibrelex"
+, author =      "Patrice Bertin and Didier Roncin and Jean Vuillemin"
+, title =       "Introduction to programmable active memories"
+, type =        "Research Report"
+, number =      3
+, institution = "Digital Paris Research Laboratory"
+, month =       jun
+, year =        1989
+, update =      "98.11 bibrelex"
 }
 
 @article{bg-sfche-89
@@ -20471,538 +20471,538 @@ @article{bg-sfche-89
 }
 
 @techreport{bcdtt-hdspd-92t
-, author =	"P. Bertolazzi and R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
-, title =	"How to Draw a Series-Parallel Digraph"
-, type =	"Technical Report"
-, number =	"UTDCS-9-92"
-, institution =	"The University of Texas at Dallas"
-, year =	1992
-, succeeds =	"bcdtt-hdspd-92, bdtt-hdspd-91"
-, precedes =	"bcdtt-hdspd-94, bcdtt-hdspd-92"
-, update =	"98.11 bibrelex"
+, author =      "P. Bertolazzi and R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
+, title =       "How to Draw a Series-Parallel Digraph"
+, type =        "Technical Report"
+, number =      "UTDCS-9-92"
+, institution = "The University of Texas at Dallas"
+, year =        1992
+, succeeds =    "bcdtt-hdspd-92, bdtt-hdspd-91"
+, precedes =    "bcdtt-hdspd-94, bcdtt-hdspd-92"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{bcdtt-hdspd-92
-, author =	"P. Bertolazzi and R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
-, title =	"How to Draw a Series-Parallel Digraph"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"272--283"
-, keywords =	"graph drawing"
-, succeeds =	"bdtt-hdspd-91,bcdtt-hdspd-92t"
-, precedes =	"bcdtt-hdspd-94"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 tamassia"
+, author =      "P. Bertolazzi and R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
+, title =       "How to Draw a Series-Parallel Digraph"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "272--283"
+, keywords =    "graph drawing"
+, succeeds =    "bdtt-hdspd-91,bcdtt-hdspd-92t"
+, precedes =    "bcdtt-hdspd-94"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 93.09 tamassia"
 }
 
 @article{bcdtt-hdspd-94
-, author =	"P. Bertolazzi and R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
-, title =	"How to Draw a Series-Parallel Digraph"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"385--402"
-, keywords =	"graph drawing, planar, upward"
-, succeeds =	"bcdtt-hdspd-92, bdtt-hdspd-91, bcdtt-hdspd-92t"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 95.05 tamassia"
+, author =      "P. Bertolazzi and R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
+, title =       "How to Draw a Series-Parallel Digraph"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "385--402"
+, keywords =    "graph drawing, planar, upward"
+, succeeds =    "bcdtt-hdspd-92, bdtt-hdspd-91, bcdtt-hdspd-92t"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 95.05 tamassia"
 }
 
 @inproceedings{bd-udttd-91
-, author =	"P. Bertolazzi and G. {Di Battista}"
-, title =	"On upward drawing testing of triconnected digraphs"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"272--280"
-, keywords =	"graph drawing, planar graph representation"
-, cites =	"b-g-85, bl-tcopi-76, cnao-laepg-85, fr-dfscp-82, dlr-bgudp-90, dt-aprad-88, dt-ipt-89, dtt-arsdd-89, et-adgab-89, e-ga-79, ht-ept-74, hl-updss-91, jnr-dippl-87, k-fpos-87, kr-pl-75, lec-aptg-67, lp-mt-86, nc-pgta-88, p-plpg-76, ru-roptc-88, s-oamnf-80, t-eggmn-87, t-paog-89, tm-dpp-77, ZZZ"
-, update =	"97.11 bibrelex, 93.09 tamassia"
+, author =      "P. Bertolazzi and G. {Di Battista}"
+, title =       "On upward drawing testing of triconnected digraphs"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "272--280"
+, keywords =    "graph drawing, planar graph representation"
+, cites =       "b-g-85, bl-tcopi-76, cnao-laepg-85, fr-dfscp-82, dlr-bgudp-90, dt-aprad-88, dt-ipt-89, dtt-arsdd-89, et-adgab-89, e-ga-79, ht-ept-74, hl-updss-91, jnr-dippl-87, k-fpos-87, kr-pl-75, lec-aptg-67, lp-mt-86, nc-pgta-88, p-plpg-76, ru-roptc-88, s-oamnf-80, t-eggmn-87, t-paog-89, tm-dpp-77, ZZZ"
+, update =      "97.11 bibrelex, 93.09 tamassia"
 }
 
 @inproceedings{bdd-codmn-97
-, author =	"Paola Bertolazzi and Giuseppe {Di Battista} and Walter Didimo"
-, title =	"Computing Orthogonal Drawings with the Minimum Number of Bends"
-, editor =	"Frank Dehne and Andrew Rau-Chaplin and J{\"o}rg-R{\"u}diger Sack and Roberto Tamassia"
-, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
-, nickname =	"WADS '97"
-, site =	"Halifax, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1272
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"331--344"
-, update =	"99.07 bibrelex, 98.07 patrignani+tamassia+vismara"
+, author =      "Paola Bertolazzi and Giuseppe {Di Battista} and Walter Didimo"
+, title =       "Computing Orthogonal Drawings with the Minimum Number of Bends"
+, editor =      "Frank Dehne and Andrew Rau-Chaplin and J{\"o}rg-R{\"u}diger Sack and Roberto Tamassia"
+, booktitle =   "Proc. 5th Workshop Algorithms Data Struct."
+, nickname =    "WADS '97"
+, site =        "Halifax, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1272
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "331--344"
+, update =      "99.07 bibrelex, 98.07 patrignani+tamassia+vismara"
 }
 
 @inproceedings{bdd-qup-98
-, author =	"Paola Bertolazzi and Giuseppe {Di Battista} and Walter Didimo"
-, title =	"Quasi-Upward Planarity"
-, editor =	"S. H. Whitesides"
-, booktitle =	"Graph Drawing (Proc. GD '98)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1547
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"15--29"
-, keywords =	"graph drawing, upward"
-, update =	"99.03 patrignani"
+, author =      "Paola Bertolazzi and Giuseppe {Di Battista} and Walter Didimo"
+, title =       "Quasi-Upward Planarity"
+, editor =      "S. H. Whitesides"
+, booktitle =   "Graph Drawing (Proc. GD '98)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1547
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "15--29"
+, keywords =    "graph drawing, upward"
+, update =      "99.03 patrignani"
 }
 
 @techreport{bdl-pgd-92
-, author =	"P. Bertolazzi and G. {Di Battista} and G. Liotta"
-, title =	"Parametric Graph Drawing"
-, type =	"Technical Report"
-, number =	"6/67"
-, institution =	"IASI--CNR, Rome, Italy"
-, year =	1992
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia"
+, author =      "P. Bertolazzi and G. {Di Battista} and G. Liotta"
+, title =       "Parametric Graph Drawing"
+, type =        "Technical Report"
+, number =      "6/67"
+, institution = "IASI--CNR, Rome, Italy"
+, year =        1992
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia"
 }
 
 @article{bdl-pgd-95
-, author =	"P. Bertolazzi and G. {Di Battista} and G. Liotta"
-, title =	"Parametric Graph Drawing"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	21
-, number =	8
-, year =	1995
-, pages =	"662--673"
-, keywords =	"graph drawing, system"
-, update =	"96.01 liotta"
+, author =      "P. Bertolazzi and G. {Di Battista} and G. Liotta"
+, title =       "Parametric Graph Drawing"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      21
+, number =      8
+, year =        1995
+, pages =       "662--673"
+, keywords =    "graph drawing, system"
+, update =      "96.01 liotta"
 }
 
 @article{bdlm-udtd-94
-, author =	"P. Bertolazzi and G. {Di Battista} and G. Liotta and C. Mannino"
-, title =	"Upward Drawings of Triconnected Digraphs"
-, journal =	"Algorithmica"
-, volume =	6
-, number =	12
-, year =	1994
-, pages =	"476--497"
-, keywords =	"graph drawing, upward, planar"
-, update =	"96.01 liotta"
+, author =      "P. Bertolazzi and G. {Di Battista} and G. Liotta and C. Mannino"
+, title =       "Upward Drawings of Triconnected Digraphs"
+, journal =     "Algorithmica"
+, volume =      6
+, number =      12
+, year =        1994
+, pages =       "476--497"
+, keywords =    "graph drawing, upward, planar"
+, update =      "96.01 liotta"
 }
 
 @incollection{bdmt-oupts-93
-, author =	"P. Bertolazzi and G. {Di Battista} and C. Mannino and R. Tamassia"
-, title =	"Optimal Upward Planarity Testing of Single-Source Digraphs"
-, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	726
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"37--48"
-, update =	"94.01 smid+tamassia, 93.09 milone+mitchell"
+, author =      "P. Bertolazzi and G. {Di Battista} and C. Mannino and R. Tamassia"
+, title =       "Optimal Upward Planarity Testing of Single-Source Digraphs"
+, booktitle =   "Proc. 1st Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      726
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "37--48"
+, update =      "94.01 smid+tamassia, 93.09 milone+mitchell"
 }
 
 @article{bdmt-oupts-98
-, author =	"P. Bertolazzi and G. {Di Battista} and C. Mannino and R. Tamassia"
-, title =	"Optimal Upward Planarity Testing of Single-Source Digraphs"
-, journal =	"SIAM J. Comput."
-, volume =	27
-, number =	1
-, year =	1998
-, pages =	"132--169"
-, keywords =	"graph drawing, upward, planar"
-, update =	"98.07 tamassia"
+, author =      "P. Bertolazzi and G. {Di Battista} and C. Mannino and R. Tamassia"
+, title =       "Optimal Upward Planarity Testing of Single-Source Digraphs"
+, journal =     "SIAM J. Comput."
+, volume =      27
+, number =      1
+, year =        1998
+, pages =       "132--169"
+, keywords =    "graph drawing, upward, planar"
+, update =      "98.07 tamassia"
 }
 
 @misc{bdtt-hdspd-91
-, author =	"P. Bertolazzi and G. {Di Battista} and R. Tamassia and I. G. Tollis"
-, title =	"How to Draw a Series-Parallel Digraph"
-, year =	1991
-, note =	"manuscript"
-, precedes =	"bcdtt-hdspd-92, bcdtt-hdspd-94, bcdtt-hdspd-92t"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 97.11 bibrelex"
+, author =      "P. Bertolazzi and G. {Di Battista} and R. Tamassia and I. G. Tollis"
+, title =       "How to Draw a Series-Parallel Digraph"
+, year =        1991
+, note =        "manuscript"
+, precedes =    "bcdtt-hdspd-92, bcdtt-hdspd-94, bcdtt-hdspd-92t"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 97.11 bibrelex"
 }
 
 @incollection{bgs-pavpi-89
-, author =	"P. Bertolazzi and C. Guerra and S. Salza"
-, title =	"A parallel algorithm for the visibility problem inside a simple polygon"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	399
-, year =	1989
-, pages =	"65--71"
-, keywords =	"parallel computation, visibility"
-, update =	"95.05 korneenko"
+, author =      "P. Bertolazzi and C. Guerra and S. Salza"
+, title =       "A parallel algorithm for the visibility problem inside a simple polygon"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      399
+, year =        1989
+, pages =       "65--71"
+, keywords =    "parallel computation, visibility"
+, update =      "95.05 korneenko"
 }
 
 @article{bsg-pavpp-90
-, author =	"P. Bertolazzi and S. Salza and C. Guerra"
-, title =	"A parallel algorithm for the visibility problem from a point"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	9
-, number =	1
-, year =	1990
-, pages =	"11--14"
-, keywords =	"parallel computation, visibility"
-, update =	"95.09 korneenko, 95.05 korneenko"
+, author =      "P. Bertolazzi and S. Salza and C. Guerra"
+, title =       "A parallel algorithm for the visibility problem from a point"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      9
+, number =      1
+, year =        1990
+, pages =       "11--14"
+, keywords =    "parallel computation, visibility"
+, update =      "95.09 korneenko, 95.05 korneenko"
 }
 
 @inproceedings{bbd-ahc-93
-, author =	"M. Bertolotto and E. Bruzzone and L. {De Floriani}"
-, title =	"Acyclic hierarchical cell complexes"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"279--284"
-, cites =	"fp-htbmt-92, mrl-tdugg-91, w-vomp-92,"
-, update =	"98.11 bibrelex, 94.09 bernal, 93.09 milone+mitchell"
+, author =      "M. Bertolotto and E. Bruzzone and L. {De Floriani}"
+, title =       "Acyclic hierarchical cell complexes"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "279--284"
+, cites =       "fp-htbmt-92, mrl-tdugg-91, w-vomp-92,"
+, update =      "98.11 bibrelex, 94.09 bernal, 93.09 milone+mitchell"
 }
 
 @article{b-pccp-88
-, author =	"A. A. Bertossi"
-, title =	"Parallel circle-cover problem"
-, journal =	"Inform. Process. Lett."
-, volume =	27
-, year =	1988
-, pages =	"133--139"
-, keywords =	"parallel computation, circle, covering"
-, update =	"95.05 korneenko"
+, author =      "A. A. Bertossi"
+, title =       "Parallel circle-cover problem"
+, journal =     "Inform. Process. Lett."
+, volume =      27
+, year =        1988
+, pages =       "133--139"
+, keywords =    "parallel computation, circle, covering"
+, update =      "95.05 korneenko"
 }
 
 @article{bhl-ahp-00
-, author =	"C. Bertram-Kretzberg and T. Hofmeister and H. Lefmann"
-, title =	"An algorithm for {Heilbronn's} problem"
-, journal =	"SIAM J. Comput."
-, volume =	30
-, year =	2000
-, pages =	"383--390"
-, update =	"01.07 smid"
+, author =      "C. Bertram-Kretzberg and T. Hofmeister and H. Lefmann"
+, title =       "An algorithm for {Heilbronn's} problem"
+, journal =     "SIAM J. Comput."
+, volume =      30
+, year =        2000
+, pages =       "383--390"
+, update =      "01.07 smid"
 }
 
 @article{bd-asmbh-94
-, author =	"Y. Bertrand and J.-F. Dufourd"
-, title =	"Algebraic specification of a {3D}-Modeler Based on Hypermaps"
-, journal =	"CVGIP: Graph. Models Image Process."
-, volume =	56
-, year =	1994
-, pages =	"29--60"
-, update =	"00.11 smid, 00.07 devillers"
+, author =      "Y. Bertrand and J.-F. Dufourd"
+, title =       "Algebraic specification of a {3D}-Modeler Based on Hypermaps"
+, journal =     "CVGIP: Graph. Models Image Process."
+, volume =      56
+, year =        1994
+, pages =       "29--60"
+, update =      "00.11 smid, 00.07 devillers"
 }
 
 @book{b-colmm-82
-, author =	"D. P. Bertsekas"
-, title =	"Constrained Optimization and {Lagrange} Multiplier Methods"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "D. P. Bertsekas"
+, title =       "Constrained Optimization and {Lagrange} Multiplier Methods"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @book{bt-pdcnm-89
-, author =	"D. P. Bertsekas and J. N. Tsitsiklis"
-, title =	"Parallel and distributed Computation: {Numerical} Methods"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1989
-, update =	"98.03 bibrelex"
+, author =      "D. P. Bertsekas and J. N. Tsitsiklis"
+, title =       "Parallel and distributed Computation: {Numerical} Methods"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1989
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bg-ppcp-90
-, author =	"D. J. Bertsimas and M. X. Goemans"
-, title =	"On the parsimonious property of connectivity problems"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"388--396"
+, author =      "D. J. Bertsimas and M. X. Goemans"
+, title =       "On the parsimonious property of connectivity problems"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "388--396"
 }
 
 @article{b-wcesc-89
-, author =	"D. Bertzimas"
-, title =	"Worst-case examples for the spacefilling curve heuristics for the {Euclidean} {Travelling} {Salesman} {Problem}"
-, journal =	"Oper. Res. Lett."
-, volume =	8
-, number =	5
-, year =	1989
-, pages =	"241--244"
-, keywords =	"optimization"
-, update =	"97.11 icking, 95.05 korneenko"
+, author =      "D. Bertzimas"
+, title =       "Worst-case examples for the spacefilling curve heuristics for the {Euclidean} {Travelling} {Salesman} {Problem}"
+, journal =     "Oper. Res. Lett."
+, volume =      8
+, number =      5
+, year =        1989
+, pages =       "241--244"
+, keywords =    "optimization"
+, update =      "97.11 icking, 95.05 korneenko"
 }
 
 @article{b-sisal-74
-, author =	"J. Besag"
-, title =	"Spatial interaction and the statistical analysis of lattice systems"
-, journal =	"J. Roy. Statist. Soc. Ser. B"
-, volume =	36
-, year =	1974
-, pages =	"192--236"
+, author =      "J. Besag"
+, title =       "Spatial interaction and the statistical analysis of lattice systems"
+, journal =     "J. Roy. Statist. Soc. Ser. B"
+, volume =      36
+, year =        1974
+, pages =       "192--236"
 }
 
 @inproceedings{bc-mca-85
-, author =	"G. M. Beshers and R. H. Campbell"
-, title =	"Maintained and Constructor Attributes"
-, booktitle =	"Proc. ACM Symp. on Language Issues in Programming Environments"
-, year =	1985
-, pages =	"34--42"
-, update =	"96.01 tamassia"
+, author =      "G. M. Beshers and R. H. Campbell"
+, title =       "Maintained and Constructor Attributes"
+, booktitle =   "Proc. ACM Symp. on Language Issues in Programming Environments"
+, year =        1985
+, pages =       "34--42"
+, update =      "96.01 tamassia"
 }
 
 @article{b-kpso-28
-, author =	"A. S. Besicovitch"
-, title =	"On {Kakeya's} problem and a similar one"
-, journal =	"Mathematische Zeitschrift"
-, volume =	27
-, year =	1928
-, pages =	"312--320"
-, update =	"97.11 bibrelex"
+, author =      "A. S. Besicovitch"
+, title =       "On {Kakeya's} problem and a similar one"
+, journal =     "Mathematische Zeitschrift"
+, volume =      27
+, year =        1928
+, pages =       "312--320"
+, update =      "97.11 bibrelex"
 }
 
 @book{b-igs-85
-, author =	"N. M. Beskin"
-, title =	"Images of geometric solids"
-, publisher =	"Mir Publishers"
-, address =	"Moscow"
-, year =	1985
-, update =	"98.07 bibrelex"
+, author =      "N. M. Beskin"
+, title =       "Images of geometric solids"
+, publisher =   "Mir Publishers"
+, address =     "Moscow"
+, year =        1985
+, update =      "98.07 bibrelex"
 }
 
 @article{bj-tdor-85
-, author =	"P. J. Besl and R. C. Jain"
-, title =	"Three-dimensional object recognition"
-, journal =	"ACM Comput. Surv."
-, volume =	17
-, year =	1985
-, pages =	"75--154"
-, update =	"97.11 bibrelex"
+, author =      "P. J. Besl and R. C. Jain"
+, title =       "Three-dimensional object recognition"
+, journal =     "ACM Comput. Surv."
+, volume =      17
+, year =        1985
+, pages =       "75--154"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-eatdd-01
-, author =	"S. N. Bespamyathnikh"
-, title =	"An efficient algorithm for the three-dimensional diameter problem"
-, journal =	"Discrete Comput. Geom."
-, volume =	25
-, year =	2001
-, pages =	"235--255"
-, update =	"02.03 smid"
+, author =      "S. N. Bespamyathnikh"
+, title =       "An efficient algorithm for the three-dimensional diameter problem"
+, journal =     "Discrete Comput. Geom."
+, volume =      25
+, year =        2001
+, pages =       "235--255"
+, update =      "02.03 smid"
 }
 
 @techreport{b-cmstt-
-, author =	"S. N. Bespamyathnikh"
-, title =	"Constructing Minimum Spanning Trees in {$R^k_\infty$} and triangulation of the k-Cube"
-, type =	"manuscript"
-, update =	"02.03 smid, 98.11 bibrelex"
+, author =      "S. N. Bespamyathnikh"
+, title =       "Constructing Minimum Spanning Trees in {$R^k_\infty$} and triangulation of the k-Cube"
+, type =        "manuscript"
+, update =      "02.03 smid, 98.11 bibrelex"
 }
 
 @unpublished{b-eaet-00
-, author =	"Sergei Bespamyatnikh"
-, title =	"An Efficient Algorithm for Enumeration of Triangulations"
-, year =	2000
-, note =	"10th Annual Fall Workshop on Computational Geometry.
+, author =      "Sergei Bespamyatnikh"
+, title =       "An Efficient Algorithm for Enumeration of Triangulations"
+, year =        2000
+, note =        "10th Annual Fall Workshop on Computational Geometry.
           \url{http://www.cs.ubc.ca/~besp/cgw.ps.gz}"
-, update =	"01.11 pocchiola"
+, update =      "01.11 pocchiola"
 }
 
 @article{b-eatddp-00
-, author =	"S. Bespamyatnikh"
-, title =	"An Efficient Algorithm for the Three-Dimensional Diameter Problem"
-, journal =	"Discrete Comput. Geom."
-, volume =	25
-, number =	2
-, year =	2000
-, pages =	"235--255"
-, update =	"02.03 bespamyatnikh"
+, author =      "S. Bespamyatnikh"
+, title =       "An Efficient Algorithm for the Three-Dimensional Diameter Problem"
+, journal =     "Discrete Comput. Geom."
+, volume =      25
+, number =      2
+, year =        2000
+, pages =       "235--255"
+, update =      "02.03 bespamyatnikh"
 }
 
 @inproceedings{b-eaf2l-99
-, author =	"Sergei Bespamyatnikh"
-, title =	"Efficient Algorithm for Finding 2 Largest Empty Circles"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"37--38"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Sergei Bespamyatnikh"
+, title =       "Efficient Algorithm for Finding 2 Largest Empty Circles"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "37--38"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{bbkks-eacm-01
-, author =	"S. Bespamyatnikh and B. Bhattacharya and M. Keil and D. Kirkpatrick and M. Segal"
-, title =	"Efficient algorithms for centers and medians in interval and circular-arc graphs"
-, journal =	"Networks"
-, volume =	"??"
-, year =	2002
-, note =	"to appear"
-, update =	"02.03 bespamyatnikh"
+, author =      "S. Bespamyatnikh and B. Bhattacharya and M. Keil and D. Kirkpatrick and M. Segal"
+, title =       "Efficient algorithms for centers and medians in interval and circular-arc graphs"
+, journal =     "Networks"
+, volume =      "??"
+, year =        2002
+, note =        "to appear"
+, update =      "02.03 bespamyatnikh"
 }
 
 @article{bkst-oflvd-00
-, author =	"S. Bespamyatnikh and K. Kedem and M. Segal and A. Tamir"
-, title =	"Optimal facility location under various distance functions"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, year =	2000
-, pages =	"523--534"
-, update =	"01.04 smid"
+, author =      "S. Bespamyatnikh and K. Kedem and M. Segal and A. Tamir"
+, title =       "Optimal facility location under various distance functions"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, year =        2000
+, pages =       "523--534"
+, update =      "01.04 smid"
 }
 
 @article{bds-ghsces-00
-, author =	"S. Bespamyatnikh and D. Kirkpatrick and J. Snoeyink"
-, title =	"Generalizing Ham Sandwich Cuts to Equitable Subdivisions"
-, journal =	"Discrete Comput. Geom."
-, volume =	24
-, number =	4
-, year =	2000
-, pages =	"605--622"
-, update =	"02.03 bespamyatnikh"
+, author =      "S. Bespamyatnikh and D. Kirkpatrick and J. Snoeyink"
+, title =       "Generalizing Ham Sandwich Cuts to Equitable Subdivisions"
+, journal =     "Discrete Comput. Geom."
+, volume =      24
+, number =      4
+, year =        2000
+, pages =       "605--622"
+, update =      "02.03 bespamyatnikh"
 }
 
 @inproceedings{bs-cspta-97
-, author =	"Sergei Bespamyatnikh and Michael Segal"
-, title =	"Covering a Set of Points by Two Axis--Parallel Boxes"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"33--38"
-, update =	"97.11 jones"
+, author =      "Sergei Bespamyatnikh and Michael Segal"
+, title =       "Covering a Set of Points by Two Axis--Parallel Boxes"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "33--38"
+, update =      "97.11 jones"
 }
 
 @article{bs-qsvd-00
-, author =	"S. Bespamyatnikh and J. Snoeyink"
-, title =	"Queries with Segments in {Voronoi} Diagrams"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	16
-, number =	1
-, year =	2000
-, pages =	"23--33"
-, update =	"02.03 bespamyatnikh"
+, author =      "S. Bespamyatnikh and J. Snoeyink"
+, title =       "Queries with Segments in {Voronoi} Diagrams"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      16
+, number =      1
+, year =        2000
+, pages =       "23--33"
+, update =      "02.03 bespamyatnikh"
 }
 
 @inproceedings{b-eatdd-98
-, author =	"Sergei N. Bespamyatnikh"
-, title =	"An Efficient Algorithm for the Three-Dimensional Diameter Problem"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"137--146"
-, update =	"98.07 agarwal+mitchell"
+, author =      "Sergei N. Bespamyatnikh"
+, title =       "An Efficient Algorithm for the Three-Dimensional Diameter Problem"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "137--146"
+, update =      "98.07 agarwal+mitchell"
 }
 
 @inproceedings{b-oacpm-95
-, author =	"Sergei N. Bespamyatnikh"
-, title =	"An Optimal Algorithm for Closest Pair Maintenance"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"152--161"
-, keywords =	"dynamic closest pair"
-, cites =	"am-annqf-93, amnsw-oaann-94, b-lbact-83, bst-bst-85, bs-dcms-76, bet-pcqqt-93, b-rasdc-94, ck-dmdps-92, ck-adcpn-95, cpt-uadpl-93, ct-ccgtd-93, grss-rdsdc-93i, grss-sracp-93, ks-ntead-94, ls-ekcpo-92i, ps-cgi-85, s-sisie-91, sh-cpp-75, s-dsadc-93, ss-oaolc-92, sss-oaolc-92, st-dsdt-83, s-drpla-91, s-mmdpsl-91a, s-mmdpsp-92a, s-ntsdc-90, v-oaann-86, v-oaann-89, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Sergei N. Bespamyatnikh"
+, title =       "An Optimal Algorithm for Closest Pair Maintenance"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "152--161"
+, keywords =    "dynamic closest pair"
+, cites =       "am-annqf-93, amnsw-oaann-94, b-lbact-83, bst-bst-85, bs-dcms-76, bet-pcqqt-93, b-rasdc-94, ck-dmdps-92, ck-adcpn-95, cpt-uadpl-93, ct-ccgtd-93, grss-rdsdc-93i, grss-sracp-93, ks-ntead-94, ls-ekcpo-92i, ps-cgi-85, s-sisie-91, sh-cpp-75, s-dsadc-93, ss-oaolc-92, sss-oaolc-92, st-dsdt-83, s-drpla-91, s-mmdpsl-91a, s-mmdpsp-92a, s-ntsdc-90, v-oaann-86, v-oaann-89, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{b-oacpm-98
-, author =	"S. N. Bespamyatnikh"
-, title =	"An Optimal Algorithm for Closest-Pair Maintenance"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"175--195"
-, update =	"98.07 smid"
+, author =      "S. N. Bespamyatnikh"
+, title =       "An Optimal Algorithm for Closest-Pair Maintenance"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "175--195"
+, update =      "98.07 smid"
 }
 
 @inproceedings{b-oadpo-96
-, author =	"S. N. Bespamyatnikh"
-, title =	"An optimal algorithm for dynamic post-office problem in {$R^2_1$} and related problems"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"101--106"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "S. N. Bespamyatnikh"
+, title =       "An optimal algorithm for dynamic post-office problem in {$R^2_1$} and related problems"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "101--106"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{b-daans-96
-, author =	"S. N. Bespamyatnikh"
-, title =	"Dynamic algorithms for approximate neighbor searching"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"252--257"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "S. N. Bespamyatnikh"
+, title =       "Dynamic algorithms for approximate neighbor searching"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "252--257"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @article{b-ocmst-97
-, author =	"S. N. Bespamyatnikh"
-, title =	"On constructing minimum spanning trees in {$R^k_1$}"
-, journal =	"Algorithmica"
-, volume =	18
-, year =	1997
-, pages =	"524--529"
-, update =	"98.03 smid"
+, author =      "S. N. Bespamyatnikh"
+, title =       "On constructing minimum spanning trees in {$R^k_1$}"
+, journal =     "Algorithmica"
+, volume =      18
+, year =        1997
+, pages =       "524--529"
+, update =      "98.03 smid"
 }
 
 @inproceedings{b-rasdc-94
-, author =	"S. N. Bespamyatnikh"
-, title =	"The Region Approach for some Dynamic Closest-Point Problems"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"75--80"
-, keywords =	"region approach, dynamic maintenance, data structures"
-, cites =	"b-cmstt-, c-fadsi-88, gbt-srtgp-84, ks-ntead-, ls-ekcpo-92i, lw-dsdrq-82, s-eis-92, s-dsadc-93, s-mmdpsl-91a, s-mmdpsp-92a, s-ntsdc-90, w-mstpt-87, y-cmstk-82, hy-t-61, ZZZ"
-, update =	"98.11 bibrelex, 98.03 smid, 94.09 jones"
+, author =      "S. N. Bespamyatnikh"
+, title =       "The Region Approach for some Dynamic Closest-Point Problems"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "75--80"
+, keywords =    "region approach, dynamic maintenance, data structures"
+, cites =       "b-cmstt-, c-fadsi-88, gbt-srtgp-84, ks-ntead-, ls-ekcpo-92i, lw-dsdrq-82, s-eis-92, s-dsadc-93, s-mmdpsl-91a, s-mmdpsp-92a, s-ntsdc-90, w-mstpt-87, y-cmstk-82, hy-t-61, ZZZ"
+, update =      "98.11 bibrelex, 98.03 smid, 94.09 jones"
 }
 
 @inproceedings{brs-plue-93
-, author =	"Margrit Betke and Ronald L. Rivest and Mona Singh"
-, title =	"Piecemeal Learning of an Unknown Environment"
-, booktitle =	"Proc. 6th ACM Conf. Comput. Learning Theory"
-, nickname =	"COLT '93"
-, month =	jul
-, year =	1993
-, pages =	"277--286"
-, update =	"98.07 bibrelex, 97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "Margrit Betke and Ronald L. Rivest and Mona Singh"
+, title =       "Piecemeal Learning of an Unknown Environment"
+, booktitle =   "Proc. 6th ACM Conf. Comput. Learning Theory"
+, nickname =    "COLT '93"
+, month =       jul
+, year =        1993
+, pages =       "277--286"
+, update =      "98.07 bibrelex, 97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{brs-plue-95
-, author =	"Margrit Betke and Ronald L. Rivest and Mona Singh"
-, title =	"Piecemeal Learning of an Unknown Environment"
-, journal =	"Machine Learning"
-, volume =	18
-, number =	"2--3"
-, year =	1995
-, pages =	"231--254"
-, succeeds =	"brs-plue-93"
-, update =	"98.03 mitchell"
+, author =      "Margrit Betke and Ronald L. Rivest and Mona Singh"
+, title =       "Piecemeal Learning of an Unknown Environment"
+, journal =     "Machine Learning"
+, volume =      18
+, number =      "2--3"
+, year =        1995
+, pages =       "231--254"
+, succeeds =    "brs-plue-93"
+, update =      "98.03 mitchell"
 }
 
 @article{bm-lplp-85
-, author =	"V. Betke and P. {McMullen}"
-, title =	"Lattice points in lattice polyhedra"
-, journal =	"Monatsch. Math."
-, volume =	99
-, number =	4
-, year =	1985
-, pages =	"253--265"
-, keywords =	"discrete geometry, polyhedra"
-, update =	"95.05 korneenko"
+, author =      "V. Betke and P. {McMullen}"
+, title =       "Lattice points in lattice polyhedra"
+, journal =     "Monatsch. Math."
+, volume =      99
+, number =      4
+, year =        1985
+, pages =       "253--265"
+, keywords =    "discrete geometry, polyhedra"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bc-ap1sq-94
-, author =	"D. Beus and D. Crockett"
-, title =	"Automated production of $1:24,000$ scale quadrangle maps"
-, booktitle =	"Proc. 1994 ASPRS/ACSM Annual Convention and Exposition"
-, volume =	1
-, year =	1994
-, pages =	"94--99"
-, update =	"98.07 bibrelex"
+, author =      "D. Beus and D. Crockett"
+, title =       "Automated production of $1:24,000$ scale quadrangle maps"
+, booktitle =   "Proc. 1994 ASPRS/ACSM Annual Convention and Exposition"
+, volume =      1
+, year =        1994
+, pages =       "94--99"
+, update =      "98.07 bibrelex"
 }
 
 @article{be-dapch-90
-, author =	"H. Bez and J. Edwards"
-, title =	"Distributed algorithm for the planar convex hull problem"
-, journal =	"Comput. Aided Design"
-, volume =	22
-, number =	2
-, year =	1990
-, pages =	"81--86"
-, keywords =	"convex hull, parallel computation"
-, update =	"95.05 korneenko"
+, author =      "H. Bez and J. Edwards"
+, title =       "Distributed algorithm for the planar convex hull problem"
+, journal =     "Comput. Aided Design"
+, volume =      22
+, number =      2
+, year =        1990
+, pages =       "81--86"
+, keywords =    "convex hull, parallel computation"
+, update =      "95.05 korneenko"
 }
 
 @article{b-orect-97
-, author =	"Andras Bezdek"
-, title =	"On optimal route planning evading cubes in the three space"
-, journal =	"Beitr{\"a}ge zur Algebra und Geometrie"
-, volume =	"??"
-, year =	1997
-, update =	"98.11 bibrelex, 98.03 mitchell"
-, abstract =	"Let $\cal P$ be a finite arrangement of non-overlapping open
+, author =      "Andras Bezdek"
+, title =       "On optimal route planning evading cubes in the three space"
+, journal =     "Beitr{\"a}ge zur Algebra und Geometrie"
+, volume =      "??"
+, year =        1997
+, update =      "98.11 bibrelex, 98.03 mitchell"
+, abstract =    "Let $\cal P$ be a finite arrangement of non-overlapping open
 cubes with side-lengths not exceeding 1 in the $3$-dimensional
 euclidean space. Let $S$ and $T$ be two points lying outside
 the open cubes. Assume one needs to find a short path emanating
@@ -21016,2030 +21016,2030 @@ @article{b-orect-97
 }
 
 @article{b-ddcc-90
-, author =	"A. Bezdek"
-, title =	"On the density of dual circle coverings"
-, journal =	"Geom. Dedicata"
-, volume =	33
-, number =	2
-, year =	1990
-, pages =	"227--238"
-, keywords =	"arrangements of circles, Sylvester problem"
-, update =	"98.07 mitchell"
+, author =      "A. Bezdek"
+, title =       "On the density of dual circle coverings"
+, journal =     "Geom. Dedicata"
+, volume =      33
+, number =      2
+, year =        1990
+, pages =       "227--238"
+, keywords =    "arrangements of circles, Sylvester problem"
+, update =      "98.07 mitchell"
 }
 
 @article{bb-wiipt-86
-, author =	"A. Bezdek and K. Bezdek"
-, title =	"When it is possible to translate a convex polygon into another one?"
-, journal =	"Stud. Sci. Math. Hungary"
-, volume =	21
-, year =	1986
-, pages =	"337--342"
-, keywords =	"convex polygon, containment"
-, update =	"95.05 korneenko"
+, author =      "A. Bezdek and K. Bezdek"
+, title =       "When it is possible to translate a convex polygon into another one?"
+, journal =     "Stud. Sci. Math. Hungary"
+, volume =      21
+, year =        1986
+, pages =       "337--342"
+, keywords =    "convex polygon, containment"
+, update =      "95.05 korneenko"
 }
 
 @article{bbb-ipls-92
-, author =	"A. Bezdek and K. Bezdek and T. Bisztriczky"
-, title =	"On illumination in the plane by line segments"
-, journal =	"Geom. Dedicata"
-, volume =	41
-, number =	1
-, year =	1992
-, pages =	"39--50"
-, keywords =	"visibility"
-, update =	"95.05 korneenko"
+, author =      "A. Bezdek and K. Bezdek and T. Bisztriczky"
+, title =       "On illumination in the plane by line segments"
+, journal =     "Geom. Dedicata"
+, volume =      41
+, number =      1
+, year =        1992
+, pages =       "39--50"
+, keywords =    "visibility"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bbb-ktip-89
-, author =	"A. Bezdek and K. Bezdek and T. Bisztriczky"
-, title =	"On {Krasnosselsky}-type illumination problems"
-, type =	"Research Paper"
-, number =	676
-, institution =	"Univ. of Calgary"
-, address =	"Calgary, Canada"
-, month =	jul
-, year =	1989
-, update =	"93.09 milone+mitchell"
+, author =      "A. Bezdek and K. Bezdek and T. Bisztriczky"
+, title =       "On {Krasnosselsky}-type illumination problems"
+, type =        "Research Paper"
+, number =      676
+, institution = "Univ. of Calgary"
+, address =     "Calgary, Canada"
+, month =       jul
+, year =        1989
+, update =      "93.09 milone+mitchell"
 }
 
 @article{bbm-ipchf-91
-, author =	"A. Bezdek and K. Bezdek and E. Makai"
-, title =	"Interior points of the convex hull of few points in ${E}^d$"
-, journal =	"Monatsh. Math."
-, volume =	111
-, number =	3
-, year =	1991
-, pages =	"181--186"
-, keywords =	"convex hull, $d$-dimensional"
-, update =	"95.05 korneenko"
+, author =      "A. Bezdek and K. Bezdek and E. Makai"
+, title =       "Interior points of the convex hull of few points in ${E}^d$"
+, journal =     "Monatsh. Math."
+, volume =      111
+, number =      3
+, year =        1991
+, pages =       "181--186"
+, keywords =    "convex hull, $d$-dimensional"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bk-pmsgc-??
-, author =	"A. Bezdek and W. Kuperberg"
-, title =	"Placing and Moving Spheres in the Gaps of a Cylinder Packing"
-, type =	"Technical {Report}"
-, institution =	"Dept. of Math, Cornell Univ"
-, year =	"??"
-, keywords =	"cylinder packing, closeness, motion planning"
-, update =	"93.09 milone+mitchell"
+, author =      "A. Bezdek and W. Kuperberg"
+, title =       "Placing and Moving Spheres in the Gaps of a Cylinder Packing"
+, type =        "Technical {Report}"
+, institution = "Dept. of Math, Cornell Univ"
+, year =        "??"
+, keywords =    "cylinder packing, closeness, motion planning"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{bkm-mdspp-91
-, author =	"A. Bezdek and W. Kuperberg and E. Makai"
-, title =	"Maximum density space packing with parallel strings of spheres"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"277--283"
+, author =      "A. Bezdek and W. Kuperberg and E. Makai"
+, title =       "Maximum density space packing with parallel strings of spheres"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "277--283"
 }
 
 @incollection{b-hlcpr-93
-, author =	"K. Bezdek"
-, title =	"{Hadwiger}-{Levi}'s Covering Problem Revisited"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"199--233"
-, keywords =	"survey paper, discrete geometry, covering by homothets, illumination"
-, update =	"93.09 erickson"
+, author =      "K. Bezdek"
+, title =       "{Hadwiger}-{Levi}'s Covering Problem Revisited"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "199--233"
+, keywords =    "survey paper, discrete geometry, covering by homothets, illumination"
+, update =      "93.09 erickson"
 }
 
 @inproceedings{b-irubd-01
-, author =	"K{\'a}roly Bezdek"
-, title =	"Improving {Roger's} Upper Bound for the Density of Unit Ball Packings in {Euclidean} $d$-Space for all $d\ge 8$"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"191--194"
-, update =	"01.04 icking"
+, author =      "K{\'a}roly Bezdek"
+, title =       "Improving {Roger's} Upper Bound for the Density of Unit Ball Packings in {Euclidean} $d$-Space for all $d\ge 8$"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "191--194"
+, update =      "01.04 icking"
 }
 
 @article{b-pibcb-91
-, author =	"K. Bezdek"
-, title =	"The problem of illumination of the boundary of a convex body by affine subspaces"
-, journal =	"Mathematika"
-, volume =	38
-, number =	2
-, year =	1991
-, pages =	"362--375"
-, keywords =	"visibility, convex, polyhedra"
-, update =	"95.05 korneenko"
+, author =      "K. Bezdek"
+, title =       "The problem of illumination of the boundary of a convex body by affine subspaces"
+, journal =     "Mathematika"
+, volume =      38
+, number =      2
+, year =        1991
+, pages =       "362--375"
+, keywords =    "visibility, convex, polyhedra"
+, update =      "95.05 korneenko"
 }
 
 @article{bl-ecld-88
-, author =	"M. Bezem and J. van Leeuwen"
-, title =	"On estimating the complexity of logarithmic decompositions"
-, journal =	"Inform. Process. Lett."
-, volume =	26
-, number =	6
-, year =	1988
-, pages =	"321--324"
-, update =	"96.05 smid, 95.05 korneenko"
+, author =      "M. Bezem and J. van Leeuwen"
+, title =       "On estimating the complexity of logarithmic decompositions"
+, journal =     "Inform. Process. Lett."
+, volume =      26
+, number =      6
+, year =        1988
+, pages =       "321--324"
+, update =      "96.05 smid, 95.05 korneenko"
 }
 
 @book{b-ncma-72
-, author =	"P. Bezier"
-, title =	"Numerical Control - Mathematics and Aplications"
-, publisher =	"John Wiley \& Sons"
-, address =	"London, UK"
-, year =	1972
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "P. Bezier"
+, title =       "Numerical Control - Mathematics and Aplications"
+, publisher =   "John Wiley \& Sons"
+, address =     "London, UK"
+, year =        1972
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{bc-fsamn-96
-, author =	"J. Bhadury and R. Chandrasekaran"
-, title =	"Finding the set of all minimal nested convex polygons"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"26--31"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "J. Bhadury and R. Chandrasekaran"
+, title =       "Finding the set of all minimal nested convex polygons"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "26--31"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @article{bcmc-agpcn-97
-, author =	"J. Bhadury and V. Chandru and A. Maheshwari and R. Chandrasekaran"
-, title =	"Art Gallery Problems for Convex Nested Polygons"
-, journal =	"INFORMS J. Comput."
-, volume =	9
-, number =	1
-, year =	1997
-, pages =	"100--110"
-, update =	"98.03 mitchell"
+, author =      "J. Bhadury and V. Chandru and A. Maheshwari and R. Chandrasekaran"
+, title =       "Art Gallery Problems for Convex Nested Polygons"
+, journal =     "INFORMS J. Comput."
+, volume =      9
+, number =      1
+, year =        1997
+, pages =       "100--110"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{bbgossz-tovra-93
-, author =	"D. Bhagavathi and V. Bokka and H. Gurla and S. Olariu and J. L. Schwing and I. Stojmenovi{\'c} and J. Zhang"
-, title =	"Time-optimal visibility-related algorithms on meshes with multiple broadcasting"
-, booktitle =	"Proc. 1993 Internat. Conf. Application-Specific Array Processors, Venice, Italy"
-, nickname =	"ASAP"
-, month =	oct
-, year =	1993
-, pages =	"??"
-, keywords =	"parallel computation"
-, comments =	"to appear"
-, update =	"93.09 rote"
+, author =      "D. Bhagavathi and V. Bokka and H. Gurla and S. Olariu and J. L. Schwing and I. Stojmenovi{\'c} and J. Zhang"
+, title =       "Time-optimal visibility-related algorithms on meshes with multiple broadcasting"
+, booktitle =   "Proc. 1993 Internat. Conf. Application-Specific Array Processors, Venice, Italy"
+, nickname =    "ASAP"
+, month =       oct
+, year =        1993
+, pages =       "??"
+, keywords =    "parallel computation"
+, comments =    "to appear"
+, update =      "93.09 rote"
 }
 
 @inproceedings{blosz-fsamb-92
-, author =	"D. Bhagavathi and P. Looges and S. Olariu and J. L. Schwing and J. Zhang"
-, title =	"Fast selection algorithms on meshes with multiple broadcasting"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, site =	"St. Charles"
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "D. Bhagavathi and P. Looges and S. Olariu and J. L. Schwing and J. Zhang"
+, title =       "Fast selection algorithms on meshes with multiple broadcasting"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, site =        "St. Charles"
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bosswz-cpmmb-92
-, author =	"D. Bhagavathi and S. Olariu and J. L. Schwing and W. Shen and L. Wilson and J. Zhang"
-, title =	"Convexity problems on meshes with multiple broadcasting"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"365--370"
-, keywords =	"convex polygons, meshes with muliple broadcasting, diameter, enclosing rectangle, inscribed triangle, time-optimal algorithms, image processing, computer vision"
-, cites =	"cdr-ultbp-86, ds-gmmmc-79, dh-pcsa-73, fs-dmaer-75, l-ipaaa-92, l-spcsa-83, pl-pdavs-88, ps-cgi-85, rk-dpp-82, t-mss-85, ag-hpc-90, bb-cv-82, blosz-fsamb-92, bps-aamv-89, kr-icmmb-89, losz-sema-, l-cvdmc-85, ml-cascv-89, osz-tosam-92, p-cg-78, pr-apmb-87, v-mvavi-91, v-spa-91, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "D. Bhagavathi and S. Olariu and J. L. Schwing and W. Shen and L. Wilson and J. Zhang"
+, title =       "Convexity problems on meshes with multiple broadcasting"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "365--370"
+, keywords =    "convex polygons, meshes with muliple broadcasting, diameter, enclosing rectangle, inscribed triangle, time-optimal algorithms, image processing, computer vision"
+, cites =       "cdr-ultbp-86, ds-gmmmc-79, dh-pcsa-73, fs-dmaer-75, l-ipaaa-92, l-spcsa-83, pl-pdavs-88, ps-cgi-85, rk-dpp-82, t-mss-85, ag-hpc-90, bb-cv-82, blosz-fsamb-92, bps-aamv-89, kr-icmmb-89, losz-sema-, l-cvdmc-85, ml-cascv-89, osz-tosam-92, p-cg-78, pr-apmb-87, v-mvavi-91, v-spa-91, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bosw-tomsa-92t
-, author =	"D. Bhagavathi and S. Olariu and W. Shen and L. Wilson"
-, title =	"A time-optimal multiple search algorithm on enhanced meshes, with applications"
-, type =	"Technical Report"
-, number =	"TR-092-08"
-, institution =	"Department of Computer Science, Old Dominion University"
-, year =	1992
-, precedes =	"bosw-tomsa-92"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "D. Bhagavathi and S. Olariu and W. Shen and L. Wilson"
+, title =       "A time-optimal multiple search algorithm on enhanced meshes, with applications"
+, type =        "Technical Report"
+, number =      "TR-092-08"
+, institution = "Department of Computer Science, Old Dominion University"
+, year =        1992
+, precedes =    "bosw-tomsa-92"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{bosw-tomsa-92
-, author =	"D. Bhagavathi and S. Olariu and W. Shen and L. Wilson"
-, title =	"A time-optimal multiple search algorithm on enhanced meshes, with applications"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"359--364"
-, succeeds =	"bosw-tomsa-92t"
-, cites =	"l-ipaaa-92, tk-smcpc-77, a-obfma-86, am-pbs-90, bosw-tomsa-92t, b-fmapg-84, ml-cascv-89"
-, update =	"98.11 bibrelex"
+, author =      "D. Bhagavathi and S. Olariu and W. Shen and L. Wilson"
+, title =       "A time-optimal multiple search algorithm on enhanced meshes, with applications"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "359--364"
+, succeeds =    "bosw-tomsa-92t"
+, cites =       "l-ipaaa-92, tk-smcpc-77, a-obfma-86, am-pbs-90, bosw-tomsa-92t, b-fmapg-84, ml-cascv-89"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{bwc-ihd-00
-, author =	"Praveen Bhaniramka and Rephael Wenger and Roger Crawfis"
-, title =	"Isosurfacing in Higher Dimensions"
-, booktitle =	"Proceedings of Visualization 2000"
-, year =	2000
-, pages =	"267--273"
-, update =	"01.07 wenger"
+, author =      "Praveen Bhaniramka and Rephael Wenger and Roger Crawfis"
+, title =       "Isosurfacing in Higher Dimensions"
+, booktitle =   "Proceedings of Visualization 2000"
+, year =        2000
+, pages =       "267--273"
+, update =      "01.07 wenger"
 }
 
 @techreport{bpcj-vgdaa-95
-, author =	"S. Bhanji and H. C. Purchase and R. F. Cohen and M. James"
-, title =	"Validating Graph Drawing Aesthetics: A Pilot Study"
-, type =	"Technical Report"
-, number =	336
-, institution =	"University of Queensland, Department of Computer Science"
-, year =	1995
-, keywords =	"graph drawing, aesthetics, human-computer interaction"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "S. Bhanji and H. C. Purchase and R. F. Cohen and M. James"
+, title =       "Validating Graph Drawing Aesthetics: A Pilot Study"
+, type =        "Technical Report"
+, number =      336
+, institution = "University of Queensland, Department of Computer Science"
+, year =        1995
+, keywords =    "graph drawing, aesthetics, human-computer interaction"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @article{brw-pprrl-88
-, author =	"S. K. Bhaskar and A. Rosenfeld and A. Y. Wu"
-, title =	"Parallel processing of regions represented by linear quadtrees"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	42
-, number =	3
-, year =	1988
-, pages =	"371--380"
-, keywords =	"quad trees, parallel computations, digital geometry"
-, update =	"95.05 korneenko"
+, author =      "S. K. Bhaskar and A. Rosenfeld and A. Y. Wu"
+, title =       "Parallel processing of regions represented by linear quadtrees"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      42
+, number =      3
+, year =        1988
+, pages =       "371--380"
+, keywords =    "quad trees, parallel computations, digital geometry"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bnk-oplci-93
-, author =	"V. Bhaskaran and B. K. Natarajan and K. Konstantinides"
-, title =	"Optimal Piecewise-Linear Compression of Images"
-, booktitle =	"Data Compression Conference"
-, nickname =	"DCC '93"
-, publisher =	"IEEE Press"
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "V. Bhaskaran and B. K. Natarajan and K. Konstantinides"
+, title =       "Optimal Piecewise-Linear Compression of Images"
+, booktitle =   "Data Compression Conference"
+, nickname =    "DCC '93"
+, publisher =   "IEEE Press"
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @article{bs-lafrd-88
-, author =	"J. Bhasker and S. Sahni"
-, title =	"A linear algorithm to find a rectangular dual of a planar triangulated graph"
-, journal =	"Algorithmica"
-, volume =	3
-, year =	1988
-, pages =	"247--278"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Bhasker and S. Sahni"
+, title =       "A linear algorithm to find a rectangular dual of a planar triangulated graph"
+, journal =     "Algorithmica"
+, volume =      3
+, year =        1988
+, pages =       "247--278"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{b-iatdg-92
-, author =	"Dinesh Bhatia"
-, title =	"Improved algorithms for two dimensional grid routing"
-, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, year =	1992
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Dinesh Bhatia"
+, title =       "Improved algorithms for two dimensional grid routing"
+, booktitle =   "Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, year =        1992
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{bgks-flddf-98
-, author =	"Randeep Bhatia and Sudipto Guha and Samir Khuller and Yoram J. Sussmann"
-, title =	"Facility Location with Dynamic Distance Functions"
-, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '98"
-, site =	"Stockholm"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1432
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"23--34"
-, update =	"99.03 bibrelex, 98.07 mitchell"
+, author =      "Randeep Bhatia and Sudipto Guha and Samir Khuller and Yoram J. Sussmann"
+, title =       "Facility Location with Dynamic Distance Functions"
+, booktitle =   "Proc. 6th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '98"
+, site =        "Stockholm"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1432
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "23--34"
+, update =      "99.03 bibrelex, 98.07 mitchell"
 }
 
 @article{bl-tdfem-90
-, author =	"R. P. Bhatia and K. L. Lawrence"
-, title =	"Two-Dimensional Finite Element Mesh Generation Based On Stripwise Automatic Triangulation"
-, journal =	"Comput. Struct."
-, volume =	36
-, number =	2
-, year =	1990
-, pages =	"309--319"
-, keywords =	"two-dimensional finite element mesh, finite element mesh generation, stripwise automatic triangulation, central mesh generation, laplacian smoothing"
-, annote =	"Advancing front scheme. Tri that maximizes $A/P^2$ is
-		 chosen."
-, abstract =	"A new mesh generator, capable of discretizing
-		 arbitrary, two-dimensional, multiply connected domains
-		 into triangles with a prescribed spatial density, has
-		 been developed. The technique is based on stripwise
-		 automatic triangulation. The triangulation strategy has
-		 been enhanced using two heuristics. The first is a
-		 method to temporarily reorient a region before
-		 submitting it for generation. The second is a technique
-		 to find and repair 'omitted patches' near sharply
-		 curved boundaries. Despite employing a set of
-		 heuristics, the resulting scheme is versatile, robust,
-		 and demonstrates a near linear growth rate. (Author
-		 abstract) 17 Refs."
+, author =      "R. P. Bhatia and K. L. Lawrence"
+, title =       "Two-Dimensional Finite Element Mesh Generation Based On Stripwise Automatic Triangulation"
+, journal =     "Comput. Struct."
+, volume =      36
+, number =      2
+, year =        1990
+, pages =       "309--319"
+, keywords =    "two-dimensional finite element mesh, finite element mesh generation, stripwise automatic triangulation, central mesh generation, laplacian smoothing"
+, annote =      "Advancing front scheme. Tri that maximizes $A/P^2$ is
+                 chosen."
+, abstract =    "A new mesh generator, capable of discretizing
+                 arbitrary, two-dimensional, multiply connected domains
+                 into triangles with a prescribed spatial density, has
+                 been developed. The technique is based on stripwise
+                 automatic triangulation. The triangulation strategy has
+                 been enhanced using two heuristics. The first is a
+                 method to temporarily reorient a region before
+                 submitting it for generation. The second is a technique
+                 to find and repair 'omitted patches' near sharply
+                 curved boundaries. Despite employing a set of
+                 heuristics, the resulting scheme is versatile, robust,
+                 and demonstrates a near linear growth rate. (Author
+                 abstract) 17 Refs."
 }
 
 @inproceedings{bclr-ostm-86
-, author =	"S. Bhatt and F. Chung and F. Leighton and A. Rosenberg"
-, title =	"Optimal simulations of tree machines"
-, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1986
-, pages =	"274--282"
-, update =	"97.11 bibrelex"
+, author =      "S. Bhatt and F. Chung and F. Leighton and A. Rosenberg"
+, title =       "Optimal simulations of tree machines"
+, booktitle =   "Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1986
+, pages =       "274--282"
+, update =      "97.11 bibrelex"
 }
 
 @article{bc-cmwlv-87
-, author =	"S. Bhatt and S. Cosmadakis"
-, title =	"The Complexity of Minimizing Wire Lengths in {VLSI} Layouts"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"263--267"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "S. Bhatt and S. Cosmadakis"
+, title =       "The Complexity of Minimizing Wire Lengths in {VLSI} Layouts"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "263--267"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{bl-fsvgl-84
-, author =	"S. N. Bhatt and F. T. Leighton"
-, title =	"A framework for solving {VLSI} graph layout problems"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	28
-, year =	1984
-, pages =	"300--343"
-, succeeds =	"l-lsvwi-82"
+, author =      "S. N. Bhatt and F. T. Leighton"
+, title =       "A framework for solving {VLSI} graph layout problems"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      28
+, year =        1984
+, pages =       "300--343"
+, succeeds =    "l-lsvwi-82"
 }
 
 @techreport{b-acokv-83
-, author =	"B. Bhattacharya"
-, title =	"An algorithm for computing order $k$ {Voronoi} diagrams in the plane"
-, type =	"Report"
-, number =	"Tech. Rep. 83-9"
-, institution =	"Comput. Sci. Dept., Simon Fraser Univ."
-, year =	1983
-, update =	"94.09 bernal"
+, author =      "B. Bhattacharya"
+, title =       "An algorithm for computing order $k$ {Voronoi} diagrams in the plane"
+, type =        "Report"
+, number =      "Tech. Rep. 83-9"
+, institution = "Comput. Sci. Dept., Simon Fraser Univ."
+, year =        1983
+, update =      "94.09 bernal"
 }
 
 @techreport{b-wcach-82
-, author =	"B. Bhattacharya"
-, title =	"Worst-case analysis of a convex hull algorithm"
-, type =	"Report"
-, number =	"Tech. Rep."
-, institution =	"Comput. Sci. Dept., Simon Fraser Univ."
-, year =	1982
-, update =	"94.09 bernal"
+, author =      "B. Bhattacharya"
+, title =       "Worst-case analysis of a convex hull algorithm"
+, type =        "Report"
+, number =      "Tech. Rep."
+, institution = "Comput. Sci. Dept., Simon Fraser Univ."
+, year =        1982
+, update =      "94.09 bernal"
 }
 
 @article{bb-cobbt-01
-, author =	"Binay Bhattacharya and Robert Benkoczi"
-, title =	"On computing the optimal bridge between two convex polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	79
-, year =	2001
-, pages =	"215--221"
-, update =	"02.03 cheong"
+, author =      "Binay Bhattacharya and Robert Benkoczi"
+, title =       "On computing the optimal bridge between two convex polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      79
+, year =        2001
+, pages =       "215--221"
+, update =      "02.03 cheong"
 }
 
 @techreport{bcetsu-csts-90
-, author =	"B. Bhattacharya and J. Czyzowicz and P. Egyed and G. Toussaint and I. Stojmenovi{\'c} and J. Urrutia"
-, title =	"Computing Shortest Transversals of Sets"
-, type =	"Technical {Report}"
-, number =	"SOCS 90.23"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1990
-, update =	"97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "B. Bhattacharya and J. Czyzowicz and P. Egyed and G. Toussaint and I. Stojmenovi{\'c} and J. Urrutia"
+, title =       "Computing Shortest Transversals of Sets"
+, type =        "Technical {Report}"
+, number =      "SOCS 90.23"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1990
+, update =      "97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{bcetsu-csts-91
-, author =	"B. Bhattacharya and J. Czyzowicz and P. Egyed and G. Toussaint and I. Stojmenovi{\'c} and J. Urrutia"
-, title =	"Computing shortest transversals of sets"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"71--80"
-, keywords =	"stabbing"
-, precedes =	"bcetsu-csts-92"
-, cites =	"ab-eact-87, ad-ahdsp-90, arw-lbls-89, bl-dicp-83, bt-cst-90t, bet-csdix-, b-gtfga-80, dgk-htir-63, d-ltatt-84, e-cedbt-85, e-ftssg-85, eg-tsa-86, egs-ueplf-89, emprww-sls-82, ew-spdtl-89, ew-ospdc-91, gpw-gtt-91, h-fuenl-89, hiir-wolla-89, k-sades-91t, m-ltalp-83, mt-fmvdb-85, o-olafs-81, ol-mcp-81, s-cesl-85, v-cbrdf-87, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex, 97.11 bibrelex, 96.09 devillers"
+, author =      "B. Bhattacharya and J. Czyzowicz and P. Egyed and G. Toussaint and I. Stojmenovi{\'c} and J. Urrutia"
+, title =       "Computing shortest transversals of sets"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "71--80"
+, keywords =    "stabbing"
+, precedes =    "bcetsu-csts-92"
+, cites =       "ab-eact-87, ad-ahdsp-90, arw-lbls-89, bl-dicp-83, bt-cst-90t, bet-csdix-, b-gtfga-80, dgk-htir-63, d-ltatt-84, e-cedbt-85, e-ftssg-85, eg-tsa-86, egs-ueplf-89, emprww-sls-82, ew-spdtl-89, ew-ospdc-91, gpw-gtt-91, h-fuenl-89, hiir-wolla-89, k-sades-91t, m-ltalp-83, mt-fmvdb-85, o-olafs-81, ol-mcp-81, s-cesl-85, v-cbrdf-87, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex, 97.11 bibrelex, 96.09 devillers"
 }
 
 @article{bcetsu-csts-92
-, author =	"B. Bhattacharya and J. Czyzowicz and P. Egyed and G. Toussaint and I. Stojmenovi{\'c} and J. Urrutia"
-, title =	"Computing shortest transversals of sets"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	4
-, year =	1992
-, pages =	"417--442"
-, keywords =	"computational geometry, shortest transversal, envelope, butterfly polygon"
-, succeeds =	"bcetsu-csts-91"
-, update =	"96.09 devillers"
+, author =      "B. Bhattacharya and J. Czyzowicz and P. Egyed and G. Toussaint and I. Stojmenovi{\'c} and J. Urrutia"
+, title =       "Computing shortest transversals of sets"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      4
+, year =        1992
+, pages =       "417--442"
+, keywords =    "computational geometry, shortest transversal, envelope, butterfly polygon"
+, succeeds =    "bcetsu-csts-91"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{bet-cwb-91
-, author =	"B. Bhattacharya and P. Egyed and G. Toussaint"
-, title =	"Computing the wingspan of a butterfly"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"88--91"
-, cites =	"agt-vbtes-86, bkt-dsvp-89, bt-cst-91a, bcetsu-csts-91, cd-icott-87, dk-ladsc-85, e-cedbt-85, mt-fmvdb-85, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "B. Bhattacharya and P. Egyed and G. Toussaint"
+, title =       "Computing the wingspan of a butterfly"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "88--91"
+, cites =       "agt-vbtes-86, bkt-dsvp-89, bt-cst-91a, bcetsu-csts-91, cd-icott-87, dk-ladsc-85, e-cedbt-85, mt-fmvdb-85, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{be-bskpc-97
-, author =	"Binay Bhattacharya and Hossam ElGindy"
-, title =	"Biased Search and $k$--Point Clustering"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"141--146"
-, update =	"97.11 jones"
+, author =      "Binay Bhattacharya and Hossam ElGindy"
+, title =       "Biased Search and $k$--Point Clustering"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "141--146"
+, update =      "97.11 jones"
 }
 
 @article{bet-cdach-91
-, author =	"B. Bhattacharya and H. Everett and G. Toussaint"
-, title =	"A counterexample to a dynamic algorithm for convex hulls of line arrangements"
-, journal =	"Pattern Recogn. Lett."
-, volume =	12
-, number =	3
-, year =	1991
-, pages =	"145--147"
-, keywords =	"errata, convex hull"
-, update =	"95.05 korneenko"
+, author =      "B. Bhattacharya and H. Everett and G. Toussaint"
+, title =       "A counterexample to a dynamic algorithm for convex hulls of line arrangements"
+, journal =     "Pattern Recogn. Lett."
+, volume =      12
+, number =      3
+, year =        1991
+, pages =       "145--147"
+, keywords =    "errata, convex hull"
+, update =      "95.05 korneenko"
 }
 
 @article{bg-clvpr-01
-, author =	"B. Bhattacharya and S. K. Ghosh"
-, title =	"Characterizing {LR}-visibility polygons and related problems"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	18
-, year =	2001
-, pages =	"19--36"
-, update =	"01.04 smid"
+, author =      "B. Bhattacharya and S. K. Ghosh"
+, title =       "Characterizing {LR}-visibility polygons and related problems"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      18
+, year =        2001
+, pages =       "19--36"
+, update =      "01.04 smid"
 }
 
 @inproceedings{bkt-dsvp-89
-, author =	"B. Bhattacharya and D. G. Kirkpatrick and G. T. Toussaint"
-, title =	"Determining sector visibility of a polygon"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"247--254"
-, cites =	"ab-eact-87, aw-alts-87, aw-plts-88, at-oadvp-81, bl-dicp-83, b-lbact-83, e-ftssg-85, eow-gfcs-83, e-hdpa-85, emprww-sls-82, et-eaide-85, g-ct-58, hv-splsp-49, k-dwvsp-88, l-tcctc-80, ma-lafch-79, mt-rltcp-87, o-olafs-81, r-dcikc-88a, rs-sp-77, ss-oadwv-86, st-ccssp-88, ta-chapi-82, t-ccu-84a, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex"
+, author =      "B. Bhattacharya and D. G. Kirkpatrick and G. T. Toussaint"
+, title =       "Determining sector visibility of a polygon"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "247--254"
+, cites =       "ab-eact-87, aw-alts-87, aw-plts-88, at-oadvp-81, bl-dicp-83, b-lbact-83, e-ftssg-85, eow-gfcs-83, e-hdpa-85, emprww-sls-82, et-eaide-85, g-ct-58, hv-splsp-49, k-dwvsp-88, l-tcctc-80, ma-lafch-79, mt-rltcp-87, o-olafs-81, r-dcikc-88a, rs-sp-77, ss-oadwv-86, st-ccssp-88, ta-chapi-82, t-ccu-84a, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{bm-ltacm-01
-, author =	"Binay Bhattacharya and Asish Mukhopadhyay"
-, title =	"A Linear Time Algorithm for Computing the Minimum Perimeter Triangle Enclosing a Convex Polygon"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"43--47"
-, update =	"01.04 icking"
+, author =      "Binay Bhattacharya and Asish Mukhopadhyay"
+, title =       "A Linear Time Algorithm for Computing the Minimum Perimeter Triangle Enclosing a Convex Polygon"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "43--47"
+, update =      "01.04 icking"
 }
 
 @inproceedings{bs-psdsr-90
-, author =	"B. Bhattacharya and T. Shermer"
-, title =	"Polygonal separators and digital shape recognition"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"74--77"
-, cites =	"b-cspps-88, dr-clp-80, k-dcscp-82, ka-dd-84, na-dc-84, na-digp-85, na-ds-90, ol-mcp-81, t-stc-88, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "B. Bhattacharya and T. Shermer"
+, title =       "Polygonal separators and digital shape recognition"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "74--77"
+, cites =       "b-cspps-88, dr-clp-80, k-dcscp-82, ka-dd-84, na-dc-84, na-digp-85, na-ds-90, ol-mcp-81, t-stc-88, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bt-cmscs-89
-, author =	"B. Bhattacharya and G. Toussaint"
-, title =	"Computing minimal spanning covers of sets"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	24
+, author =      "B. Bhattacharya and G. Toussaint"
+, title =       "Computing minimal spanning covers of sets"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       24
 }
 
 @techreport{bt-cst-90t
-, author =	"B. Bhattacharya and G. Toussaint"
-, title =	"Computing shortest transversals"
-, number =	"SOCS 90.6"
-, institution =	"School of Computer Science, McGill University"
-, year =	1990
-, keywords =	"stabbing"
-, comments =	"revised April 1991"
+, author =      "B. Bhattacharya and G. Toussaint"
+, title =       "Computing shortest transversals"
+, number =      "SOCS 90.6"
+, institution = "School of Computer Science, McGill University"
+, year =        1990
+, keywords =    "stabbing"
+, comments =    "revised April 1991"
 }
 
 @inproceedings{bt-cst-91i
-, author =	"B. Bhattacharya and G. Toussaint"
-, title =	"Computing shortest transversals"
-, booktitle =	"Proc. 18th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	510
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"649--660"
-, keywords =	"stabbing"
-, update =	"93.09 rote"
+, author =      "B. Bhattacharya and G. Toussaint"
+, title =       "Computing shortest transversals"
+, booktitle =   "Proc. 18th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      510
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "649--660"
+, keywords =    "stabbing"
+, update =      "93.09 rote"
 }
 
 @article{bt-cst-91a
-, author =	"B. Bhattacharya and G. Toussaint"
-, title =	"Computing shortest transversals"
-, journal =	"Computing"
-, volume =	46
-, number =	3
-, year =	1991
-, pages =	"93--119"
-, keywords =	"stabbing, line fitting"
-, update =	"98.11 bibrelex, 93.09 rote"
-, annote =	"of $n$ given line segments in the plane in $O(n \log^2 n)$
-		 time, and related problems"
+, author =      "B. Bhattacharya and G. Toussaint"
+, title =       "Computing shortest transversals"
+, journal =     "Computing"
+, volume =      46
+, number =      3
+, year =        1991
+, pages =       "93--119"
+, keywords =    "stabbing, line fitting"
+, update =      "98.11 bibrelex, 93.09 rote"
+, annote =      "of $n$ given line segments in the plane in $O(n \log^2 n)$
+                 time, and related problems"
 }
 
 @inproceedings{b-eolca-88
-, author =	"B. K. Bhattacharya"
-, title =	"An efficient on-line {Chebyshov} approximation algorithm for a finite planar pointset"
-, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
-, volume =	1
-, year =	1988
-, pages =	"107--108"
-, keywords =	"line fitting, points, optimization"
-, update =	"95.05 korneenko"
+, author =      "B. K. Bhattacharya"
+, title =       "An efficient on-line {Chebyshov} approximation algorithm for a finite planar pointset"
+, booktitle =   "Proc. Allerton Conf. Commun. Control Comput."
+, volume =      1
+, year =        1988
+, pages =       "107--108"
+, keywords =    "line fitting, points, optimization"
+, update =      "95.05 korneenko"
 }
 
 @techreport{b-acgpr-82
-, author =	"B. K. Bhattacharya"
-, title =	"Application of computational geometry to pattern recognition problems"
-, type =	"Technical {Report}"
-, number =	"82-3"
-, institution =	"Dept. Comput. Sci., Simon Fraser Univ."
-, address =	"Burnaby, BC"
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "B. K. Bhattacharya"
+, title =       "Application of computational geometry to pattern recognition problems"
+, type =        "Technical {Report}"
+, number =      "82-3"
+, institution = "Dept. Comput. Sci., Simon Fraser Univ."
+, address =     "Burnaby, BC"
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{b-acgpr-80
-, author =	"B. K. Bhattacharya"
-, title =	"Applications of computational geometry to pattern recognition problems"
-, type =	"Ph.{D}. Thesis"
-, school =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1980
-, keywords =	"doctoral thesis"
+, author =      "B. K. Bhattacharya"
+, title =       "Applications of computational geometry to pattern recognition problems"
+, type =        "Ph.{D}. Thesis"
+, school =      "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1980
+, keywords =    "doctoral thesis"
 }
 
 @incollection{b-cspps-88
-, author =	"B. K. Bhattacharya"
-, title =	"Circular separability of planar point sets"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"25--39"
+, author =      "B. K. Bhattacharya"
+, title =       "Circular separability of planar point sets"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "25--39"
 }
 
 @inproceedings{b-uasls-91
-, author =	"Binay K. Bhattacharya"
-, title =	"Usefulness of Angle-Sweep over Line-Sweep"
-, booktitle =	"Proc. 11th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, site =	"New Delhi, India"
-, year =	1991
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Binay K. Bhattacharya"
+, title =       "Usefulness of Angle-Sweep over Line-Sweep"
+, booktitle =   "Proc. 11th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, site =        "New Delhi, India"
+, year =        1991
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{bet-csdix-
-, author =	"B. K. Bhattacharya and P. Egyed and G. T. Toussaint"
-, title =	"On computing shortest distances inside {X}-shaped polygons"
-, type =	"Manuscript"
-, update =	"97.11 bibrelex"
+, author =      "B. K. Bhattacharya and P. Egyed and G. T. Toussaint"
+, title =       "On computing shortest distances inside {X}-shaped polygons"
+, type =        "Manuscript"
+, update =      "97.11 bibrelex"
 }
 
 @article{be-nlcha-84
-, author =	"B. K. Bhattacharya and H. ElGindy"
-, title =	"A new linear convex hull algorithm for simple polygons"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	"IT-30"
-, year =	1984
-, pages =	"85--88"
+, author =      "B. K. Bhattacharya and H. ElGindy"
+, title =       "A new linear convex hull algorithm for simple polygons"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      "IT-30"
+, year =        1984
+, pages =       "85--88"
 }
 
 % not Mukhopadhayay (title page typo)
 @inproceedings{bjmr-oassi-91
-, author =	"B. K. Bhattacharya and S. Jadhav and A. Mukhopadhyay and J.-M. Robert"
-, title =	"Optimal algorithms for some smallest intersection radius problems"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"81--88"
-, keywords =	"prune and search, optimization"
-, cites =	"bt-cst-90t, bcetsu-csts-90, b-fihs-78, c-lpot-86, c-pcmce-85, d-ltatt-84, d-mstia-86, gs-spscp-89, hdk-cgp-64, hiir-wolla-89, m-ltalp-83, m-lpltw-84, s-cg-78, s-lpchm-90, s-qgs-57, s-pavsf-60, ZZZ"
-, update =	"97.11 bibrelex, 96.09 agarwal"
+, author =      "B. K. Bhattacharya and S. Jadhav and A. Mukhopadhyay and J.-M. Robert"
+, title =       "Optimal algorithms for some smallest intersection radius problems"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "81--88"
+, keywords =    "prune and search, optimization"
+, cites =       "bt-cst-90t, bcetsu-csts-90, b-fihs-78, c-lpot-86, c-pcmce-85, d-ltatt-84, d-mstia-86, gs-spscp-89, hdk-cgp-64, hiir-wolla-89, m-ltalp-83, m-lpltw-84, s-cg-78, s-lpchm-90, s-qgs-57, s-pavsf-60, ZZZ"
+, update =      "97.11 bibrelex, 96.09 agarwal"
 }
 
 @inproceedings{bm-cltcs-95
-, author =	"Binay K. Bhattacharya and Asish Mukhopadhyay"
-, title =	"Computing in Linear Time a Chord from which a Simple Polygon is Weakly Internally Visible"
-, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1004
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"22--31"
-, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
+, author =      "Binay K. Bhattacharya and Asish Mukhopadhyay"
+, title =       "Computing in Linear Time a Chord from which a Simple Polygon is Weakly Internally Visible"
+, booktitle =   "Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1004
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "22--31"
+, update =      "98.07 bibrelex, 96.01 smid, 95.09 mitchell"
 }
 
 @inproceedings{bmt-ltacs-91
-, author =	"B. K. Bhattacharya and A. Mukhopadhyay and G. T. Toussaint"
-, title =	"A linear time algorithm for computing the shortest line segment from which a polygon is weakly visible"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"412--424"
-, keywords =	"polygon, visibility"
+, author =      "B. K. Bhattacharya and A. Mukhopadhyay and G. T. Toussaint"
+, title =       "A linear time algorithm for computing the shortest line segment from which a polygon is weakly visible"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "412--424"
+, keywords =    "polygon, visibility"
 }
 
 @article{br-ccip-90
-, author =	"B. K. Bhattacharya and A. Rosenfeld"
-, title =	"Contour codes of isothetic polygons"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	50
-, number =	3
-, year =	1990
-, pages =	"353--363"
-, keywords =	"isothetic, shape"
-, update =	"95.05 korneenko"
+, author =      "B. K. Bhattacharya and A. Rosenfeld"
+, title =       "Contour codes of isothetic polygons"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      50
+, number =      3
+, year =        1990
+, pages =       "353--363"
+, keywords =    "isothetic, shape"
+, update =      "95.05 korneenko"
 }
 
 @article{bs-spoos-97
-, author =	"B. K. Bhattacharya and S. Sen"
-, title =	"On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm"
-, journal =	"J. Algorithms"
-, volume =	25
-, year =	1997
-, pages =	"177--193"
-, update =	"97.11 smid"
+, author =      "B. K. Bhattacharya and S. Sen"
+, title =       "On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm"
+, journal =     "J. Algorithms"
+, volume =      25
+, year =        1997
+, pages =       "177--193"
+, update =      "97.11 smid"
 }
 
 @article{bt-cdacp-82
-, author =	"B. K. Bhattacharya and G. T. Toussaint"
-, title =	"A counterexample to a diameter algorithm for convex polygons"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-4"
-, year =	1982
-, pages =	"306--309"
-, succeeds =	"st-fer-80"
-, precedes =	"st-ccdac-82"
+, author =      "B. K. Bhattacharya and G. T. Toussaint"
+, title =       "A counterexample to a diameter algorithm for convex polygons"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-4"
+, year =        1982
+, pages =       "306--309"
+, succeeds =    "st-fer-80"
+, precedes =    "st-ccdac-82"
 }
 
 @techreport{bt-ladts-86
-, author =	"B. K. Bhattacharya and G. T. Toussaint"
-, title =	"A linear algorithm for determining translation separability of two simple polygons"
-, type =	"Report"
-, number =	"SOCS-86.1"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1986
+, author =      "B. K. Bhattacharya and G. T. Toussaint"
+, title =       "A linear algorithm for determining translation separability of two simple polygons"
+, type =        "Report"
+, number =      "SOCS-86.1"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1986
 }
 
 @article{bt-eacmd-83
-, author =	"B. K. Bhattacharya and G. T. Toussaint"
-, title =	"Efficient algorithms for computing the maximum distance between two finite planar sets"
-, journal =	"J. Algorithms"
-, volume =	4
-, year =	1983
-, pages =	"121--136"
+, author =      "B. K. Bhattacharya and G. T. Toussaint"
+, title =       "Efficient algorithms for computing the maximum distance between two finite planar sets"
+, journal =     "J. Algorithms"
+, volume =      4
+, year =        1983
+, pages =       "121--136"
 }
 
 @article{bt-facdf-88
-, author =	"B. K. Bhattacharya and G. T. Toussaint"
-, title =	"Fast algorithms for computing the diameter of a finite planar set"
-, journal =	"Visual Comput."
-, volume =	3
-, year =	1988
-, pages =	"379--388"
+, author =      "B. K. Bhattacharya and G. T. Toussaint"
+, title =       "Fast algorithms for computing the diameter of a finite planar set"
+, journal =     "Visual Comput."
+, volume =      3
+, year =        1988
+, pages =       "379--388"
 }
 
 @incollection{bt-gatuf-85
-, author =	"B. K. Bhattacharya and G. T. Toussaint"
-, title =	"On geometric algorithms that use the furthest-point {Voronoi} diagram"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"43--61"
-, succeeds =	"tb-gatuf-81"
+, author =      "B. K. Bhattacharya and G. T. Toussaint"
+, title =       "On geometric algorithms that use the furthest-point {Voronoi} diagram"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "43--61"
+, succeeds =    "tb-gatuf-81"
 }
 
 @article{bt-tseio-83
-, author =	"B. K. Bhattacharya and G. T. Toussaint"
-, title =	"Time- and storage-efficient implementation of an optimal convex hull algorithm"
-, journal =	"Image Vision Comput."
-, volume =	1
-, year =	1983
-, pages =	"140--144"
+, author =      "B. K. Bhattacharya and G. T. Toussaint"
+, title =       "Time- and storage-efficient implementation of an optimal convex hull algorithm"
+, journal =     "Image Vision Comput."
+, volume =      1
+, year =        1983
+, pages =       "140--144"
 }
 
 @techreport{bz-stdfp-86
-, author =	"B. K. Bhattacharya and J. Zorbas"
-, title =	"Solving the two-dimensional findpath problem using a line-triangle representation of the robot"
-, type =	"Technical {Report}"
-, institution =	"School Comput. Sci., Simon Fraser Univ."
-, address =	"Burnaby, BC"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "B. K. Bhattacharya and J. Zorbas"
+, title =       "Solving the two-dimensional findpath problem using a line-triangle representation of the robot"
+, type =        "Technical {Report}"
+, institution = "School Comput. Sci., Simon Fraser Univ."
+, address =     "Burnaby, BC"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{bz-stdfp-88
-, author =	"B. K. Bhattacharya and J. Zorbas"
-, title =	"Solving the two-dimensional findpath problem using a line-triangle representation of the robot"
-, journal =	"J. Algorithms"
-, volume =	9
-, year =	1988
-, pages =	"449--469"
+, author =      "B. K. Bhattacharya and J. Zorbas"
+, title =       "Solving the two-dimensional findpath problem using a line-triangle representation of the robot"
+, journal =     "J. Algorithms"
+, volume =      9
+, year =        1988
+, pages =       "449--469"
 }
 
 @techreport{br-prttd-94
-, author =	"P. Bhattacharya and A. Rosenfeld"
-, title =	"Polygonal ribbons in two and three dimensions"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1994
-, keywords =	"ribbons, strips, orientability, twist, Hamiltonian triangulation"
-, update =	"95.09 mitchell"
+, author =      "P. Bhattacharya and A. Rosenfeld"
+, title =       "Polygonal ribbons in two and three dimensions"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1994
+, keywords =    "ribbons, strips, orientability, twist, Hamiltonian triangulation"
+, update =      "95.09 mitchell"
 }
 
 @article{b-sfctg-69
-, author =	"T. Bially"
-, title =	"Space-filling curves: Their generation and their application to bandwidth reduction"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	15
-, year =	1969
-, pages =	"658--664"
-, update =	"97.07 agarwal"
+, author =      "T. Bially"
+, title =       "Space-filling curves: Their generation and their application to bandwidth reduction"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      15
+, year =        1969
+, pages =       "658--664"
+, update =      "97.07 agarwal"
 }
 
 @article{bd-shc2c-91
-, author =	"A. Bialostocki and P. Dierker"
-, title =	"On simple {Hamiltonian} cycles in a 2-colored complete graph"
-, journal =	"Ars Combin."
-, volume =	21
-, year =	1991
-, pages =	"13--16"
-, update =	"97.11 bibrelex"
+, author =      "A. Bialostocki and P. Dierker"
+, title =       "On simple {Hamiltonian} cycles in a 2-colored complete graph"
+, journal =     "Ars Combin."
+, volume =      21
+, year =        1991
+, pages =       "13--16"
+, update =      "97.11 bibrelex"
 }
 
 @article{bl-rpsp-90
-, author =	"G. Bianchi and M. Longinetti"
-, title =	"Reconstructing plane sets from projections"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"223--242"
+, author =      "G. Bianchi and M. Longinetti"
+, title =       "Reconstructing plane sets from projections"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "223--242"
 }
 
 @article{bd-nstg-93
-, author =	"E. Bibelnieks and P. M. Dearing"
-, title =	"Neighborhood Subtree Tolerance Graphs"
-, journal =	"Discrete Appl. Math."
-, volume =	43
-, year =	1993
-, pages =	"13--26"
-, update =	"98.11 bibrelex"
+, author =      "E. Bibelnieks and P. M. Dearing"
+, title =       "Neighborhood Subtree Tolerance Graphs"
+, journal =     "Discrete Appl. Math."
+, volume =      43
+, year =        1993
+, pages =       "13--26"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{b-iod3g-96
-, author =	"T. Biedl"
-, title =	"Improved orthogonal drawings of 3-graphs"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"295--299"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "T. Biedl"
+, title =       "Improved orthogonal drawings of 3-graphs"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "295--299"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{b-oodcp-96
-, author =	"T. Biedl"
-, title =	"Optimal orthogonal drawings of connected plane graphs"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"306--311"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "T. Biedl"
+, title =       "Optimal orthogonal drawings of connected plane graphs"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "306--311"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{bddlloorstw-lupc3d-99
-, author =	"T. Biedl and E. Demaine and M. Demaine and S. Lazard and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and I. Streinu and G. Toussaint and S. Whitesides"
-, title =	"Locked and Unlocked Polygonal Chains in {3D}"
-, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '99"
-, month =	jan
-, year =	1999
-, pages =	"866--867"
-, note =	"Full version Smith Tech. Rep. 060, Oct. 1999;
-		LANL arXive cs.CG/9910009"
-, archive =	"XXX:cs.CG/9910009"
-, update =	"01.04 orourke, 00.03 orourke, 99.07 bibrelex, 99.03 orourke, 98.11 orourke"
+, author =      "T. Biedl and E. Demaine and M. Demaine and S. Lazard and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and I. Streinu and G. Toussaint and S. Whitesides"
+, title =       "Locked and Unlocked Polygonal Chains in {3D}"
+, booktitle =   "Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '99"
+, month =       jan
+, year =        1999
+, pages =       "866--867"
+, note =        "Full version Smith Tech. Rep. 060, Oct. 1999;
+                LANL arXive cs.CG/9910009"
+, archive =     "XXX:cs.CG/9910009"
+, update =      "01.04 orourke, 00.03 orourke, 99.07 bibrelex, 99.03 orourke, 98.11 orourke"
 }
 
 @article{bddlloorstw-lupc3d-01
-, author =	"T. Biedl and E. Demaine and M. Demaine and S. Lazard and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and I. Streinu and G. Toussaint and S. Whitesides"
-, title =	"Locked and Unlocked Polygonal Chains in {3D}"
-, journal =	"Discrete Comput. Geom."
-, volume =	26
-, number =	3
-, year =	2001
-, pages =	"269--282"
-, comments =	"Much detail left out; see full versions"
-, succeeds =	"bddlloorstw-lupc3d-99"
-, update =	"02.03 orourke"
+, author =      "T. Biedl and E. Demaine and M. Demaine and S. Lazard and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and I. Streinu and G. Toussaint and S. Whitesides"
+, title =       "Locked and Unlocked Polygonal Chains in {3D}"
+, journal =     "Discrete Comput. Geom."
+, volume =      26
+, number =      3
+, year =        2001
+, pages =       "269--282"
+, comments =    "Much detail left out; see full versions"
+, succeeds =    "bddlloorstw-lupc3d-99"
+, update =      "02.03 orourke"
 }
 
 @inproceedings{bddloorsw-orfltcl-98
-, author =	"T. Biedl and E. Demaine and M. Demaine and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and I. Streinu and G. T. Toussaint and S. Whitesides"
-, title =	"On Reconfiguring Tree Linkages: {T}rees Can Lock"
-, booktitle =	"Proc. 10th Canad. Conf. Comput. Geom."
-, year =	1998
-, pages =	"4--5"
-, note =	"Full version LANL arXive cs.CG/9910024;
-		to appear in {\em Discrete Math.}"
-, archive =	"XXX:cs.CG/9910024"
-, update =	"01.04 orourke, 00.03 orourke"
+, author =      "T. Biedl and E. Demaine and M. Demaine and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and I. Streinu and G. T. Toussaint and S. Whitesides"
+, title =       "On Reconfiguring Tree Linkages: {T}rees Can Lock"
+, booktitle =   "Proc. 10th Canad. Conf. Comput. Geom."
+, year =        1998
+, pages =       "4--5"
+, note =        "Full version LANL arXive cs.CG/9910024;
+                to appear in {\em Discrete Math.}"
+, archive =     "XXX:cs.CG/9910024"
+, update =      "01.04 orourke, 00.03 orourke"
 }
 
 @inproceedings{bddloorw-uscop-98
-, author =	"T. Biedl and E. Demaine and M. Demaine and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and S. Whitesides"
-, title =	"Unfolding Some Classes of Orthogonal Polyhedra"
-, booktitle =	"Proc. 10th Canad. Conf. Comput. Geom."
-, year =	1998
-, pages =	"70--71"
-, note =	"Fuller version in Elec. Proc.
-		http://cgm.cs.mcgill.ca/cccg98/proceedings/welcome.hml"
-, update =	"00.03 orourke"
+, author =      "T. Biedl and E. Demaine and M. Demaine and A. Lubiw and J. O'Rourke and M. Overmars and S. Robbins and S. Whitesides"
+, title =       "Unfolding Some Classes of Orthogonal Polyhedra"
+, booktitle =   "Proc. 10th Canad. Conf. Comput. Geom."
+, year =        1998
+, pages =       "70--71"
+, note =        "Fuller version in Elec. Proc.
+                http://cgm.cs.mcgill.ca/cccg98/proceedings/welcome.hml"
+, update =      "00.03 orourke"
 }
 
 @inproceedings{bk-bhogd-94
-, author =	"T. Biedl and G. Kant"
-, title =	"A Better Heuristic for Orthogonal Graph Drawings"
-, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
-, nickname =	"ESA '94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"24--35"
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia"
+, author =      "T. Biedl and G. Kant"
+, title =       "A Better Heuristic for Orthogonal Graph Drawings"
+, booktitle =   "Proc. 2nd Annu. European Sympos. Algorithms"
+, nickname =    "ESA '94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "24--35"
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia"
 }
 
 @article{bk-bhogd-98
-, author =	"T. Biedl and G. Kant"
-, title =	"A Better Heuristic for Orthogonal Graph Drawings"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, year =	1998
-, pages =	"159--180"
-, update =	"98.03 smid"
+, author =      "T. Biedl and G. Kant"
+, title =       "A Better Heuristic for Orthogonal Graph Drawings"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, year =        1998
+, pages =       "159--180"
+, update =      "98.03 smid"
 }
 
 @inproceedings{bls-wcnfp-99
-, author =	"Therese Biedl and Anna Lubiw and Julie Sun"
-, title =	"When Can a Net Fold to a Polyhedron?"
-, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
-, year =	1999
-, pages =	"1--4"
-, update =	"01.11 orourke"
+, author =      "Therese Biedl and Anna Lubiw and Julie Sun"
+, title =       "When Can a Net Fold to a Polyhedron?"
+, booktitle =   "Proc. 11th Canad. Conf. Comput. Geom."
+, year =        1999
+, pages =       "1--4"
+, update =      "01.11 orourke"
 }
 
 @inproceedings{bsww-o3dgd-97
-, author =	"T. Biedl and T. Shermer and S. Whitesides and S. Wismath"
-, title =	"Orthogonal $3$-{D} Graph Drawing"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"76--86"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "T. Biedl and T. Shermer and S. Whitesides and S. Wismath"
+, title =       "Orthogonal $3$-{D} Graph Drawing"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "76--86"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{b-h3ogd-95
-, author =	"T. C. Biedl"
-, title =	"Heuristics for {\em 3D}-orthogonal graph drawings"
-, booktitle =	"Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization"
-, year =	1995
-, pages =	"41--44"
-, keywords =	"graph drawing, 3D, orthogonal"
-, update =	"96.09 tamassia"
+, author =      "T. C. Biedl"
+, title =       "Heuristics for {\em 3D}-orthogonal graph drawings"
+, booktitle =   "Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization"
+, year =        1995
+, pages =       "41--44"
+, keywords =    "graph drawing, 3D, orthogonal"
+, update =      "96.09 tamassia"
 }
 
 @article{b-nlbod-98
-, author =	"Therese C. Biedl"
-, title =	"New Lower Bounds For Orthogonal Drawings"
-, journal =	"J. Graph Algorithms Appl."
-, volume =	2
-, number =	7
-, year =	1998
-, pages =	"1--31"
-, url =	"https://www.cs.brown.edu/publications/jgaa/accepted/98/Biedl98.2.7.ps.gz"
-, succeeds =	"b-nlbog-96"
-, update =	"00.03 vismara"
+, author =      "Therese C. Biedl"
+, title =       "New Lower Bounds For Orthogonal Drawings"
+, journal =     "J. Graph Algorithms Appl."
+, volume =      2
+, number =      7
+, year =        1998
+, pages =       "1--31"
+, url = "https://www.cs.brown.edu/publications/jgaa/accepted/98/Biedl98.2.7.ps.gz"
+, succeeds =    "b-nlbog-96"
+, update =      "00.03 vismara"
 }
 
 @inproceedings{b-nlbog-96
-, author =	"T. C. Biedl"
-, title =	"New Lower Bounds for Orthogonal Graph Drawings"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD~'95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"28--39"
-, update =	"99.03 vismara"
+, author =      "T. C. Biedl"
+, title =       "New Lower Bounds for Orthogonal Graph Drawings"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD~'95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "28--39"
+, update =      "99.03 vismara"
 }
 
 @article{b-rbsog-98
-, author =	"Therese C. Biedl"
-, title =	"Relating Bends and Size in Orthogonal Graph Drawings"
-, journal =	"Inform. Process. Lett."
-, volume =	65
-, year =	1998
-, pages =	"111--115"
-, keywords =	"graph drawing, orthogonal"
-, update =	"99.03 patrignani"
+, author =      "Therese C. Biedl"
+, title =       "Relating Bends and Size in Orthogonal Graph Drawings"
+, journal =     "Inform. Process. Lett."
+, volume =      65
+, year =        1998
+, pages =       "111--115"
+, keywords =    "graph drawing, orthogonal"
+, update =      "99.03 patrignani"
 }
 
 @techreport{bdlrs-cmp-99
-, author =	"T. C. Biedl and E. D. Demaine and S. Lazard and S. M. Robbins and M. A. Soss"
-, title =	"Convexifying Monotone Polygons"
-, number =	"CS-99-03"
-, institution =	"Univ. Waterloo, Ontario"
-, year =	1999
-, update =	"00.03 orourke"
+, author =      "T. C. Biedl and E. D. Demaine and S. Lazard and S. M. Robbins and M. A. Soss"
+, title =       "Convexifying Monotone Polygons"
+, number =      "CS-99-03"
+, institution = "Univ. Waterloo, Ontario"
+, year =        1999
+, update =      "00.03 orourke"
 }
 
 @inproceedings{bk-aesig-97
-, author =	"T. C. Biedl and M. Kaufmann"
-, title =	"Area-Efficient Static and Incremental Graph Darwings"
-, editor =	"R. Burkard and G. Woeginger"
-, booktitle =	"Algorithms (Proc. ESA~'97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1284
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"37--52"
-, update =	"98.07 vismara"
+, author =      "T. C. Biedl and M. Kaufmann"
+, title =       "Area-Efficient Static and Incremental Graph Darwings"
+, editor =      "R. Burkard and G. Woeginger"
+, booktitle =   "Algorithms (Proc. ESA~'97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1284
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "37--52"
+, update =      "98.07 vismara"
 }
 
 @inproceedings{bmt-tpmua-97
-, author =	"Therese C. Biedl and Brendan P. Madden and Ioannis G. Tollis"
-, title =	"The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"391--402"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Therese C. Biedl and Brendan P. Madden and Ioannis G. Tollis"
+, title =       "The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "391--402"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{bmt-tpmua-00
-, author =	"Therese C. Biedl and Brendan P. Madden and Ioannis G. Tollis"
-, title =	"The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, number =	6
-, year =	2000
-, pages =	"553--580"
-, succeeds =	"bmt-tpmua-97"
-, update =	"01.04 smid+vismara"
+, author =      "Therese C. Biedl and Brendan P. Madden and Ioannis G. Tollis"
+, title =       "The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, number =      6
+, year =        2000
+, pages =       "553--580"
+, succeeds =    "bmt-tpmua-97"
+, update =      "01.04 smid+vismara"
 }
 
 @techreport{bgg-raor-88
-, author =	"E. Bienenstock and D. Geman and S. Geman"
-, title =	"A relational approach in object recognition"
-, type =	"Technical {Report}"
-, institution =	"Brown Univ."
-, address =	"Providence, RI"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "E. Bienenstock and D. Geman and S. Geman"
+, title =       "A relational approach in object recognition"
+, type =        "Technical {Report}"
+, institution = "Brown Univ."
+, address =     "Providence, RI"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @techreport{bggm-p2trd-90
-, author =	"E. Bienenstock and D. Geman and S. Geman and D. E. McClure"
-, title =	"Phase {II} technical report, development of laser radar {ATR} algorithms"
-, type =	"Technical {Report}"
-, number =	"DAAL02-89-C-0081"
-, institution =	"CECOM Center for Night Vision and Electro-Optics"
-, month =	oct
-, year =	1990
-, update =	"98.03 bibrelex"
+, author =      "E. Bienenstock and D. Geman and S. Geman and D. E. McClure"
+, title =       "Phase {II} technical report, development of laser radar {ATR} algorithms"
+, type =        "Technical {Report}"
+, number =      "DAAL02-89-C-0081"
+, institution = "CECOM Center for Night Vision and Electro-Optics"
+, month =       oct
+, year =        1990
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{b-sphcn-90
-, author =	"D. Bienstock"
-, title =	"Some provably hard crossing number problems"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"253--260"
-, precedes =	"b-sphcn-91"
-, cites =	"bd-brcn-, eg-cnp-73, gj-cninc-83, gp-ccncp-80, gp-pgcsc-80, gp-ms-83, gp-sccca-84, gp-prpa-85, gp-taafp-86, gps-crotr-89, g-as-72, km-igs-94, l-civ-83, t-rdg-88, t-ttcn-70, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. Bienstock"
+, title =       "Some provably hard crossing number problems"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "253--260"
+, precedes =    "b-sphcn-91"
+, cites =       "bd-brcn-, eg-cnp-73, gj-cninc-83, gp-ccncp-80, gp-pgcsc-80, gp-ms-83, gp-sccca-84, gp-prpa-85, gp-taafp-86, gps-crotr-89, g-as-72, km-igs-94, l-civ-83, t-rdg-88, t-ttcn-70, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-sphcn-91
-, author =	"D. Bienstock"
-, title =	"Some provably hard crossing number problems"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"443--459"
-, succeeds =	"b-sphcn-90"
+, author =      "D. Bienstock"
+, title =       "Some provably hard crossing number problems"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "443--459"
+, succeeds =    "b-sphcn-90"
 }
 
 @unpublished{bd-brcn-
-, author =	"D. Bienstock and N. Dean"
-, title =	"Bounds on rectilinear crossing numbers"
-, note =	"Submitted"
-, update =	"97.11 bibrelex"
+, author =      "D. Bienstock and N. Dean"
+, title =       "Bounds on rectilinear crossing numbers"
+, note =        "Submitted"
+, update =      "97.11 bibrelex"
 }
 
 @article{bg-eps01-91
-, author =	"D. Bienstock and E. Gy{\H o}ri"
-, title =	"An Extremal Problem on Sparse 0-1 Matrices"
-, journal =	"SIAM J. Discrete Math."
-, volume =	4
-, year =	1991
-, pages =	"17--27"
-, update =	"95.09 agarwal, 93.09 milone+mitchell"
+, author =      "D. Bienstock and E. Gy{\H o}ri"
+, title =       "An Extremal Problem on Sparse 0-1 Matrices"
+, journal =     "SIAM J. Discrete Math."
+, volume =      4
+, year =        1991
+, pages =       "17--27"
+, update =      "95.09 agarwal, 93.09 milone+mitchell"
 }
 
 @article{bm-cepgm-90
-, author =	"D. Bienstock and C. L. Monma"
-, title =	"On the complexity of embedding planar graphs to minimize certain distance measures"
-, journal =	"Algorithmica"
-, volume =	5
-, number =	1
-, year =	1990
-, pages =	"93--109"
-, keywords =	"optimization, proximity"
-, update =	"95.05 korneenko"
+, author =      "D. Bienstock and C. L. Monma"
+, title =       "On the complexity of embedding planar graphs to minimize certain distance measures"
+, journal =     "Algorithmica"
+, volume =      5
+, number =      1
+, year =        1990
+, pages =       "93--109"
+, keywords =    "optimization, proximity"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bm-oerpg-??
-, author =	"D. Bienstock and C. L. Monma"
-, title =	"Optimal Enclosing Regions in Planar Graphs"
-, type =	"Manuscript"
-, year =	"??"
-, precedes =	"bm-oerpg-89"
-, update =	"95.05 korneenko, 93.09 milone+mitchell"
+, author =      "D. Bienstock and C. L. Monma"
+, title =       "Optimal Enclosing Regions in Planar Graphs"
+, type =        "Manuscript"
+, year =        "??"
+, precedes =    "bm-oerpg-89"
+, update =      "95.05 korneenko, 93.09 milone+mitchell"
 }
 
 @article{bm-oerpg-89
-, author =	"D. Bienstock and C. L. Monma"
-, title =	"Optimal enclosing regions in planar graphs"
-, journal =	"Networks"
-, volume =	19
-, number =	1
-, year =	1989
-, pages =	"79--94"
-, keywords =	""
-, succeeds =	"bm-oerpg-??"
-, update =	"95.05 korneenko"
+, author =      "D. Bienstock and C. L. Monma"
+, title =       "Optimal enclosing regions in planar graphs"
+, journal =     "Networks"
+, volume =      19
+, number =      1
+, year =        1989
+, pages =       "79--94"
+, keywords =    ""
+, succeeds =    "bm-oerpg-??"
+, update =      "95.05 korneenko"
 }
 
 @article{b-sdtd-90
-, author =	"Eric A. Bier"
-, title =	"Snap-Dragging in Three Dimensions"
-, journal =	"Computer Graphics"
-, volume =	24
-, number =	2
-, year =	1990
-, pages =	"193--204"
-, keywords =	"Methodology and Techniques, Interaction techniques, Scene composition, interactive design, geometric construction, constraint systems"
-, update =	"97.11 bibrelex, 95.05 schwarzkopf, 93.09 milone+mitchell"
+, author =      "Eric A. Bier"
+, title =       "Snap-Dragging in Three Dimensions"
+, journal =     "Computer Graphics"
+, volume =      24
+, number =      2
+, year =        1990
+, pages =       "193--204"
+, keywords =    "Methodology and Techniques, Interaction techniques, Scene composition, interactive design, geometric construction, constraint systems"
+, update =      "97.11 bibrelex, 95.05 schwarzkopf, 93.09 milone+mitchell"
 }
 
 @techreport{bs-ppht-??
-, author =	"E. A. Bier and K. R. {Sloan, Jr.}"
-, title =	"Pointing and placing with homogeneous transforms"
-, type =	"Report"
-, number =	"??"
-, institution =	"Architect. Mach. Group, Massachusetts Inst. Tech., Xerox Palo Alto Res. Center"
-, year =	"??"
+, author =      "E. A. Bier and K. R. {Sloan, Jr.}"
+, title =       "Pointing and placing with homogeneous transforms"
+, type =        "Report"
+, number =      "??"
+, institution = "Architect. Mach. Group, Massachusetts Inst. Tech., Xerox Palo Alto Res. Center"
+, year =        "??"
 }
 
 @inproceedings{b-rp-89
-, author =	"H. Bieri"
-, title =	"{Raster}-{Polyeder}"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "H. Bieri"
+, title =       "{Raster}-{Polyeder}"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @article{bn-rpsad-82
-, author =	"H. Bieri and W. Nef"
-, title =	"A recursive plane-sweep algorithm, determining all cells of a finite division of {$R^{d}$}"
-, journal =	"Computing"
-, volume =	28
-, year =	1982
-, pages =	"189--198"
+, author =      "H. Bieri and W. Nef"
+, title =       "A recursive plane-sweep algorithm, determining all cells of a finite division of {$R^{d}$}"
+, journal =     "Computing"
+, volume =      28
+, year =        1982
+, pages =       "189--198"
 }
 
 @article{bn-space-85
-, author =	"H. Bieri and W. Nef"
-, title =	"A sweep-plane algorithm for computing the {Euler} characteristic of polyhedra represented in boolean form"
-, journal =	"Computer"
-, volume =	34
-, number =	4
-, year =	1985
-, pages =	"287--302"
-, keywords =	"space sweep, polyhedra"
-, update =	"95.05 korneenko"
+, author =      "H. Bieri and W. Nef"
+, title =       "A sweep-plane algorithm for computing the {Euler} characteristic of polyhedra represented in boolean form"
+, journal =     "Computer"
+, volume =      34
+, number =      4
+, year =        1985
+, pages =       "287--302"
+, keywords =    "space sweep, polyhedra"
+, update =      "95.05 korneenko"
 }
 
 @article{bn-spacv-83
-, author =	"H. Bieri and W. Nef"
-, title =	"A sweep-plane algorithm for computing the volume of polyhedra represented in boolean form"
-, journal =	"Linear Algebra and its Applications"
-, volume =	"52--53"
-, year =	1983
-, pages =	"69--97"
+, author =      "H. Bieri and W. Nef"
+, title =       "A sweep-plane algorithm for computing the volume of polyhedra represented in boolean form"
+, journal =     "Linear Algebra and its Applications"
+, volume =      "52--53"
+, year =        1983
+, pages =       "69--97"
 }
 
 @article{bn-aecra-84
-, author =	"H. Bieri and W. Nef"
-, title =	"Algorithms for the {Euler} characteristic and related additive functionals of digital objects"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	28
-, year =	1984
-, pages =	"166--175"
+, author =      "H. Bieri and W. Nef"
+, title =       "Algorithms for the {Euler} characteristic and related additive functionals of digital objects"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      28
+, year =        1984
+, pages =       "166--175"
 }
 
 @inproceedings{bn-esodd-88
-, author =	"H. Bieri and W. Nef"
-, title =	"Elementary set operations with $d$-dimensional polyhedra"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"97--112"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "H. Bieri and W. Nef"
+, title =       "Elementary set operations with $d$-dimensional polyhedra"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "97--112"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @proceedings{bn-cgmaa-91
-, title =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, editor =	"H. Bieri and H. Noltemeier"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, update =	"00.03 bibrelex, 97.11 icking"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, title =       "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, editor =      "H. Bieri and H. Noltemeier"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, update =      "00.03 bibrelex, 97.11 icking"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{bs-olacs-91
-, author =	"Hanspeter Bieri and Peter-Michael Schmidt"
-, title =	"An on-line algorithm for constructing sweep planes in regular position"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"27--35"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Hanspeter Bieri and Peter-Michael Schmidt"
+, title =       "An on-line algorithm for constructing sweep planes in regular position"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "27--35"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{bs-ofmpi-92
-, author =	"Hanspeter Bieri and Peter-Michael Schmidt"
-, title =	"On the Orders of Finitely Many Points Induced by Rotational Sweeps"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"61--63"
-, update =	"00.03 bibrelex"
+, author =      "Hanspeter Bieri and Peter-Michael Schmidt"
+, title =       "On the Orders of Finitely Many Points Induced by Rotational Sweeps"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "61--63"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{bs-pgrsp-96
-, author =	"H. Bieri and P.-M. Schmidt"
-, title =	"On the permutations generated by rotational sweeps of planar point sets"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"179--184"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "H. Bieri and P.-M. Schmidt"
+, title =       "On the permutations generated by rotational sweeps of planar point sets"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "179--184"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{bs-rpgsp-93
-, author =	"Hanspeter Bieri and Peter-Michael Schmidt"
-, title =	"Recognizing Permutations Generated by Sweeps of Planar Point Sets"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"10--13"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
+, author =      "Hanspeter Bieri and Peter-Michael Schmidt"
+, title =       "Recognizing Permutations Generated by Sweeps of Planar Point Sets"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "10--13"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
 }
 
 @book{b-agt-74
-, author =	"N. Biggs"
-, title =	"Algebraic Graph Theory"
-, edition =	"1st"
-, publisher =	"Cambridge University Press"
-, year =	1974
-, update =	"97.11 bibrelex"
+, author =      "N. Biggs"
+, title =       "Algebraic Graph Theory"
+, edition =     "1st"
+, publisher =   "Cambridge University Press"
+, year =        1974
+, update =      "97.11 bibrelex"
 }
 
 @book{b-agt-93
-, author =	"N. Biggs"
-, title =	"Algebraic Graph Theory"
-, edition =	"2nd"
-, publisher =	"Cambridge University Press"
-, year =	1993
-, update =	"97.11 bibrelex, 95.01 matousek"
+, author =      "N. Biggs"
+, title =       "Algebraic Graph Theory"
+, edition =     "2nd"
+, publisher =   "Cambridge University Press"
+, year =        1993
+, update =      "97.11 bibrelex, 95.01 matousek"
 }
 
 @techreport{bn-absop-86
-, author =	"G. Bilardi and A. Nicolau"
-, title =	"Adaptive Bitonic Sorting: {An} Optimal Parallel Algorithm for Shared Memory Machines"
-, type =	"Technical {Report}"
-, number =	"86-769"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	aug
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "G. Bilardi and A. Nicolau"
+, title =       "Adaptive Bitonic Sorting: {An} Optimal Parallel Algorithm for Shared Memory Machines"
+, type =        "Technical {Report}"
+, number =      "86-769"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       aug
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{bn-absop-89
-, author =	"G. Bilardi and A. Nicolau"
-, title =	"Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines"
-, journal =	"Inform. Comput."
-, volume =	18
-, year =	1989
-, pages =	"216--228"
-, update =	"96.09 orourke"
+, author =      "G. Bilardi and A. Nicolau"
+, title =       "Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines"
+, journal =     "Inform. Comput."
+, volume =      18
+, year =        1989
+, pages =       "216--228"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{bp-mavno-84
-, author =	"G. Bilardi and F. P. Preparata"
-, title =	"A minimum area {VLSI} network for {$O(\log n)$} time sorting"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"64--70"
-, precedes =	"bp-mavno-85"
+, author =      "G. Bilardi and F. P. Preparata"
+, title =       "A minimum area {VLSI} network for {$O(\log n)$} time sorting"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "64--70"
+, precedes =    "bp-mavno-85"
 }
 
 @article{bp-mavno-85
-, author =	"G. Bilardi and F. P. Preparata"
-, title =	"A minimum area {VLSI} network for {$O(\log n)$} time sorting"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-34"
-, year =	1985
-, pages =	"336--343"
-, succeeds =	"bp-mavno-84"
+, author =      "G. Bilardi and F. P. Preparata"
+, title =       "A minimum area {VLSI} network for {$O(\log n)$} time sorting"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-34"
+, year =        1985
+, pages =       "336--343"
+, succeeds =    "bp-mavno-84"
 }
 
 @inproceedings{bp-lbptt-95
-, author =	"G. Bilardi and F. P. Preparata"
-, title =	"Lower bounds to processor-time tradeoffs under bounded-speed message propagation"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"1--12"
-, update =	"99.07 bibrelex, 98.07 bibrelex, 96.09 orourke"
+, author =      "G. Bilardi and F. P. Preparata"
+, title =       "Lower bounds to processor-time tradeoffs under bounded-speed message propagation"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "1--12"
+, update =      "99.07 bibrelex, 98.07 bibrelex, 96.09 orourke"
 }
 
 @techreport{bp-pangs-??
-, author =	"G. Bilardi and F. P. Preparata"
-, title =	"Probabilistic analysis of a new geometric searching technique"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
-, keywords =	"point location, probabilistic analysis"
+, author =      "G. Bilardi and F. P. Preparata"
+, title =       "Probabilistic analysis of a new geometric searching technique"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
+, keywords =    "point location, probabilistic analysis"
 }
 
 @incollection{bs-ovcdf-87
-, author =	"Gianfranco Bilardi and Majid Sarrafzadeh"
-, title =	"Optimal {VLSI} Circuits for the Discrete {Fourier} Transform"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Parallel and Distributed Computing"
-, series =	"Adv. Comput. Res."
-, volume =	4
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1987
-, pages =	"87--101"
-, update =	"01.04 icking"
+, author =      "Gianfranco Bilardi and Majid Sarrafzadeh"
+, title =       "Optimal {VLSI} Circuits for the Discrete {Fourier} Transform"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Parallel and Distributed Computing"
+, series =      "Adv. Comput. Res."
+, volume =      4
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1987
+, pages =       "87--101"
+, update =      "01.04 icking"
 }
 
 @article{b-htssg-88
-, author =	"L. Billera"
-, title =	"Homology theory of smooth splines: generic triangulations and a conjecture of {Strang}"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	310
-, year =	1988
-, pages =	"325--340"
-, update =	"98.07 bibrelex"
+, author =      "L. Billera"
+, title =       "Homology theory of smooth splines: generic triangulations and a conjecture of {Strang}"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      310
+, year =        1988
+, pages =       "325--340"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{bb-fnpc-97
-, author =	"L. J. Billera and A. Bj{\"o}rner"
-, title =	"Face numbers of polytopes and complexes"
-, chapter =	15
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"291--310"
-, update =	"97.11 orourke"
+, author =      "L. J. Billera and A. Bj{\"o}rner"
+, title =       "Face numbers of polytopes and complexes"
+, chapter =     15
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "291--310"
+, update =      "97.11 orourke"
 }
 
 @article{bfs-ccsp-90
-, author =	"L. J. Billera and P. Filliman and B. Sturmfels"
-, title =	"Constructions and Complexity of Secondary Polytopes"
-, journal =	"Adv. Math."
-, volume =	83
-, year =	1990
-, pages =	"155--179"
-, update =	"97.11 bibrelex"
+, author =      "L. J. Billera and P. Filliman and B. Sturmfels"
+, title =       "Constructions and Complexity of Secondary Polytopes"
+, journal =     "Adv. Math."
+, volume =      83
+, year =        1990
+, pages =       "155--179"
+, update =      "97.11 bibrelex"
 }
 
 @article{bl-psmcf-81
-, author =	"L. J. Billera and C. W. Lee"
-, title =	"A Proof of the Suffiency of {McMullen}'s Conditions for $f$-vectors of Simplicial Polytopes"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	31
-, number =	3
-, year =	1981
-, pages =	"237--255"
-, update =	"98.03 bibrelex"
+, author =      "L. J. Billera and C. W. Lee"
+, title =       "A Proof of the Suffiency of {McMullen}'s Conditions for $f$-vectors of Simplicial Polytopes"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      31
+, number =      3
+, year =        1981
+, pages =       "237--255"
+, update =      "98.03 bibrelex"
 }
 
 @article{bm-bsebs-87
-, author =	"L. J. Billera and K. E. Magurn"
-, title =	"Balanced subdivision and enumeration in balanced spheres"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"297--317"
+, author =      "L. J. Billera and K. E. Magurn"
+, title =       "Balanced subdivision and enumeration in balanced spheres"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "297--317"
 }
 
 @article{br-dsms-91
-, author =	"L. J. Billera and L. L. Rose"
-, title =	"A dimension series for multivariate splines"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"107--128"
+, author =      "L. J. Billera and L. L. Rose"
+, title =       "A dimension series for multivariate splines"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "107--128"
 }
 
 @incollection{b-sat3m-64
-, author =	"R. H. Bing"
-, title =	"Some aspects of the topology of $3$-manifolds related to the {Poincar\'e} conjecture"
-, booktitle =	"Lectures in Modern Mathematics"
-, volume =	2
-, publisher =	"John Wiley \& Sons"
-, year =	1964
-, pages =	"93--128"
-, keywords =	"triangulation, three-dimensional, shellability, topology"
-, update =	"99.11 bibrelex, 95.09 korneenko"
-, annote =	"possibly some other topics"
+, author =      "R. H. Bing"
+, title =       "Some aspects of the topology of $3$-manifolds related to the {Poincar\'e} conjecture"
+, booktitle =   "Lectures in Modern Mathematics"
+, volume =      2
+, publisher =   "John Wiley \& Sons"
+, year =        1964
+, pages =       "93--128"
+, keywords =    "triangulation, three-dimensional, shellability, topology"
+, update =      "99.11 bibrelex, 95.09 korneenko"
+, annote =      "possibly some other topics"
 }
 
 @book{bp-fa-94
-, author =	"D. Bini and V. Y. Pan"
-, title =	"Fundamental Algorithms"
-, series =	"Polynomial and Matrix Computations"
-, volume =	1
-, publisher =	"Birkh{\"a}user"
-, address =	"Boston, MA"
-, year =	1994
-, update =	"98.07 bibrelex"
+, author =      "D. Bini and V. Y. Pan"
+, title =       "Fundamental Algorithms"
+, series =      "Polynomial and Matrix Computations"
+, volume =      1
+, publisher =   "Birkh{\"a}user"
+, address =     "Boston, MA"
+, year =        1994
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bs-gwbev-89
-, author =	"B. Birgisson and G. Shannon"
-, title =	"GraphView: {A} Workstation-Based Environment for Viewing Graphs and Animating Graph Algorithms"
-, number =	295
-, institution =	"Department of Computer Science, Indiana University"
-, year =	1989
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "B. Birgisson and G. Shannon"
+, title =       "GraphView: {A} Workstation-Based Environment for Viewing Graphs and Animating Graph Algorithms"
+, number =      295
+, institution = "Department of Computer Science, Indiana University"
+, year =        1989
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @mastersthesis{b-lvpop-96
-, author =	"R. Birk"
-, title =	"L{\"o}sung von {Varianten} des {Post-Office-Problems} mit {Hilfe} von {Skip List Range Trees}"
-, type =	"Masters Thesis"
-, school =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1996
-, keywords =	"masters thesis"
-, update =	"96.09 smid"
+, author =      "R. Birk"
+, title =       "L{\"o}sung von {Varianten} des {Post-Office-Problems} mit {Hilfe} von {Skip List Range Trees}"
+, type =        "Masters Thesis"
+, school =      "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1996
+, keywords =    "masters thesis"
+, update =      "96.09 smid"
 }
 
 @inproceedings{bl-facgp-91
-, author =	"Y. Birk and J. B. Lotspiech"
-, title =	"A fast algorithm for connecting grid points to the boundary with nonintersecting straight lines"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"465--474"
+, author =      "Y. Birk and J. B. Lotspiech"
+, title =       "A fast algorithm for connecting grid points to the boundary with nonintersecting straight lines"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "465--474"
 }
 
 @book{bgm-sma-65
-, author =	"Birkhoff and Garret and S. {MacLane}"
-, title =	"A Survey of Modern Algebra"
-, edition =	"3rd"
-, publisher =	"MacMillan"
-, address =	"New York, NY"
-, year =	1965
-, update =	"97.11 bibrelex"
+, author =      "Birkhoff and Garret and S. {MacLane}"
+, title =       "A Survey of Modern Algebra"
+, edition =     "3rd"
+, publisher =   "MacMillan"
+, address =     "New York, NY"
+, year =        1965
+, update =      "97.11 bibrelex"
 }
 
 @book{bi-pl-67
-, author =	"G. Birkhoff"
-, title =	"Lattice Theory"
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1967
-, keywords =	"graph drawing, planar, upward, lattice"
-, update =	"95.05 tamassia"
+, author =      "G. Birkhoff"
+, title =       "Lattice Theory"
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1967
+, keywords =    "graph drawing, planar, upward, lattice"
+, update =      "95.05 tamassia"
 }
 
 @article{b-cgra-88
-, author =	"F. G. Bischoff"
-, title =	"Computational geometry for reactor applications"
-, journal =	"Trans. Amer. Nuclear Soc."
-, volume =	57
-, year =	1988
-, pages =	"112--113"
-, keywords =	"facility location"
-, update =	"95.05 korneenko"
+, author =      "F. G. Bischoff"
+, title =       "Computational geometry for reactor applications"
+, journal =     "Trans. Amer. Nuclear Soc."
+, volume =      57
+, year =        1988
+, pages =       "112--113"
+, keywords =    "facility location"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bm-carnd-95
-, author =	"P. Biscondi and J.-M. Moreau"
-, title =	"Computer-Aided Road Network Design"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"229--234"
-, update =	"95.09 jones"
+, author =      "P. Biscondi and J.-M. Moreau"
+, title =       "Computer-Aided Road Network Design"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "229--234"
+, update =      "95.09 jones"
 }
 
 @book{bb-ca-85
-, author =	"E. Bishop and D. Bridges"
-, title =	"Constructive Analysis"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "E. Bishop and D. Bridges"
+, title =       "Constructive Analysis"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @techreport{bst-cre-90
-, author =	"V. Bistiolas and D. Sofotassios and A. Tsakalidis"
-, title =	"Computing Rectangle Enclosures"
-, type =	"Technical {Report}"
-, number =	"90.12.3?"
-, institution =	"Univ. of Patras"
-, address =	"Greece"
-, year =	1990
-, precedes =	"bst-cre-93"
-, update =	"95.05 korneenko, 93.09 milone+mitchell"
+, author =      "V. Bistiolas and D. Sofotassios and A. Tsakalidis"
+, title =       "Computing Rectangle Enclosures"
+, type =        "Technical {Report}"
+, number =      "90.12.3?"
+, institution = "Univ. of Patras"
+, address =     "Greece"
+, year =        1990
+, precedes =    "bst-cre-93"
+, update =      "95.05 korneenko, 93.09 milone+mitchell"
 }
 
 @article{bst-cre-93
-, author =	"V. Bistiolas and D. Sofotassios and A. Tsakalidis"
-, title =	"Computing rectangle enclosures"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	6
-, year =	1993
-, pages =	"303--308"
-, keywords =	"isothetic, enclosure"
-, succeeds =	"bst-cre-90"
-, update =	"95.05 korneenko"
+, author =      "V. Bistiolas and D. Sofotassios and A. Tsakalidis"
+, title =       "Computing rectangle enclosures"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      6
+, year =        1993
+, pages =       "303--308"
+, keywords =    "isothetic, enclosure"
+, succeeds =    "bst-cre-90"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bst-pse-90
-, author =	"V. Bistiolas and D. Sofotassios and A. Tsakalidis"
-, title =	"On Point and Segment Enclosures"
-, type =	"Technical {Report}"
-, number =	"90.06.18"
-, institution =	"Univ. of Patras"
-, address =	"Greece"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "V. Bistiolas and D. Sofotassios and A. Tsakalidis"
+, title =       "On Point and Segment Enclosures"
+, type =        "Technical {Report}"
+, number =      "90.06.18"
+, institution = "Univ. of Patras"
+, address =     "Greece"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @article{bpp-rwcvp-98
-, author =	"Supriya Biswas and D. Chithra Prasad and Sudebkumar Prasant Pal"
-, title =	"Recognizing weakly convex visible polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"171--186"
-, update =	"98.11 devillers"
+, author =      "Supriya Biswas and D. Chithra Prasad and Sudebkumar Prasant Pal"
+, title =       "Recognizing weakly convex visible polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "171--186"
+, update =      "98.11 devillers"
 }
 
 @article{bt-gest-89
-, author =	"T. Bisztricky and G. Fejes T{\'o}th"
-, title =	"A generalization of the {Erd{\H{o}}s-Szekeres} theorem"
-, journal =	"J. Reine Angew. Math."
-, volume =	395
-, year =	1989
-, pages =	"167--170"
-, update =	"02.03 devillers"
+, author =      "T. Bisztricky and G. Fejes T{\'o}th"
+, title =       "A generalization of the {Erd{\H{o}}s-Szekeres} theorem"
+, journal =     "J. Reine Angew. Math."
+, volume =      395
+, year =        1989
+, pages =       "167--170"
+, update =      "02.03 devillers"
 }
 
 @book{bmsw-pacc-94
-, title =	"Polytopes: Abstract, Convex and Computational"
-, editor =	"T. Bisztriczky and P. McMullen and R. Schneider and A. Ivi\'c Weiss"
-, series =	"NATO ASI Series"
-, volume =	440
-, publisher =	"Kluwer Academic Publishers"
-, year =	1994
-, update =	"96.05 pocchiola"
+, title =       "Polytopes: Abstract, Convex and Computational"
+, editor =      "T. Bisztriczky and P. McMullen and R. Schneider and A. Ivi\'c Weiss"
+, series =      "NATO ASI Series"
+, volume =      440
+, publisher =   "Kluwer Academic Publishers"
+, year =        1994
+, update =      "96.05 pocchiola"
 }
 
 @article{bdhm-tps-84
-, author =	"D. Bitton and D. J. DeWitt and D. K. Hsiao and J. Menon"
-, title =	"A Taxonomy of Parallel Sorting"
-, journal =	"ACM Comput. Surv."
-, volume =	16
-, number =	3
-, year =	1984
-, pages =	"287--318"
-, update =	"96.09 orourke"
+, author =      "D. Bitton and D. J. DeWitt and D. K. Hsiao and J. Menon"
+, title =       "A Taxonomy of Parallel Sorting"
+, journal =     "ACM Comput. Surv."
+, volume =      16
+, number =      3
+, year =        1984
+, pages =       "287--318"
+, update =      "96.09 orourke"
 }
 
 @phdthesis{b-vagt-93
-, author =	"Iliana Bjorling-Sachs"
-, title =	"Variations on the Art Gallery Theorem"
-, school =	"Rutgers University"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "Iliana Bjorling-Sachs"
+, title =       "Variations on the Art Gallery Theorem"
+, school =      "Rutgers University"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{bs-tbegm-92t
-, author =	"Iliana Bjorling-Sachs and Diana L. Souvaine"
-, title =	"A Tight Bound for Edge Guards in Monotone Polygons"
-, type =	"Technical Report"
-, number =	"92-52"
-, institution =	"DIMACS, Rutgers University"
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "Iliana Bjorling-Sachs and Diana L. Souvaine"
+, title =       "A Tight Bound for Edge Guards in Monotone Polygons"
+, type =        "Technical Report"
+, number =      "92-52"
+, institution = "DIMACS, Rutgers University"
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @techreport{bs-tbgph-91
-, author =	"I. Bjorling-Sachs and D. L. Souvaine"
-, title =	"A tight bound for guarding polygons with holes"
-, type =	"Report"
-, number =	"LCSR-TR-165"
-, institution =	"Lab. Comput. Sci. Res., Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1991
-, keywords =	"visibility, point guards, art gallery, simple polygon with holes"
+, author =      "I. Bjorling-Sachs and D. L. Souvaine"
+, title =       "A tight bound for guarding polygons with holes"
+, type =        "Report"
+, number =      "LCSR-TR-165"
+, institution = "Lab. Comput. Sci. Res., Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1991
+, keywords =    "visibility, point guards, art gallery, simple polygon with holes"
 }
 
 @article{bs-eagpp-95
-, author =	"I. Bjorling-Sachs and D. L. Souvaine"
-, title =	"An efficient algorithm for guard placement in polygons with holes"
-, journal =	"Discrete Comput. Geom."
-, volume =	13
-, year =	1995
-, pages =	"77--109"
-, update =	"96.05 smid"
+, author =      "I. Bjorling-Sachs and D. L. Souvaine"
+, title =       "An efficient algorithm for guard placement in polygons with holes"
+, journal =     "Discrete Comput. Geom."
+, volume =      13
+, year =        1995
+, pages =       "77--109"
+, update =      "96.05 smid"
 }
 
 @inproceedings{bs-tbegm-92
-, author =	"I. Bjorling-Sachs and D. L. Souvaine"
-, title =	"Tight bounds for edge guards in monotone polygons and rectilinear monotone polygons"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"93--98"
-, cites =	"a-agpiv-84, c-ctpg-75, gjpt-tsp-78, o-agta-87, st-gprp-88, s-rrag-90, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "I. Bjorling-Sachs and D. L. Souvaine"
+, title =       "Tight bounds for edge guards in monotone polygons and rectilinear monotone polygons"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "93--98"
+, cites =       "a-agpiv-84, c-ctpg-75, gjpt-tsp-78, o-agta-87, st-gprp-88, s-rrag-90, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @incollection{b-tm-95
-, author =	"A. Bj{\"o}rner"
-, title =	"Topological Methods"
-, chapter =	34
-, editor =	"R. L. Graham and M. Gr{\"o}tschel and L. Lov{\'a}sz"
-, booktitle =	"Handbook of Combinatorics"
-, publisher =	"North-Holland"
-, address =	"Amsterdam"
-, year =	1995
-, pages =	"1819--1872"
-, update =	"00.03 agarwal"
+, author =      "A. Bj{\"o}rner"
+, title =       "Topological Methods"
+, chapter =     34
+, editor =      "R. L. Graham and M. Gr{\"o}tschel and L. Lov{\'a}sz"
+, booktitle =   "Handbook of Combinatorics"
+, publisher =   "North-Holland"
+, address =     "Amsterdam"
+, year =        1995
+, pages =       "1819--1872"
+, update =      "00.03 agarwal"
 }
 
 @article{bez-halr-90
-, author =	"A. Bj{\"o}rner and P. H. Edelman and G. M. Ziegler"
-, title =	"Hyperplane arrangements with a lattice of regions"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"263--288"
+, author =      "A. Bj{\"o}rner and P. H. Edelman and G. M. Ziegler"
+, title =       "Hyperplane arrangements with a lattice of regions"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "263--288"
 }
 
 @book{blwsz-om-93
-, author =	"A. Bj{\"o}rner and M. {Las Vergnas} and N. White and B. Sturmfels and G. M. Ziegler"
-, title =	"Oriented Matroids"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge"
-, year =	1993
-, update =	"98.11 bibrelex, 98.07 agarwal+bibrelex, 95.05 agarwal"
+, author =      "A. Bj{\"o}rner and M. {Las Vergnas} and N. White and B. Sturmfels and G. M. Ziegler"
+, title =       "Oriented Matroids"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge"
+, year =        1993
+, update =      "98.11 bibrelex, 98.07 agarwal+bibrelex, 95.05 agarwal"
 }
 
 @inproceedings{bly-ldtve-93
-, author =	"Anders Bj{\"o}rner and L{\'a}szl{\'o} Lov{\'a}sz and Andrew Chi-Chih Yao"
-, title =	"Linear decision trees: {V}olume estimates and topological bounds"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"170--177"
-, update =	"97.11 icking, 97.03 agarwal"
+, author =      "Anders Bj{\"o}rner and L{\'a}szl{\'o} Lov{\'a}sz and Andrew Chi-Chih Yao"
+, title =       "Linear decision trees: {V}olume estimates and topological bounds"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "170--177"
+, update =      "97.11 icking, 97.03 agarwal"
 }
 
 @article{bz-csca-92
-, author =	"A. Bj{\" o}rner and G. M. Ziegler"
-, title =	"Combinatorial stratification of complex arrangements"
-, journal =	"J. Amer. Math. Soc."
-, volume =	5
-, year =	1992
-, pages =	"105--149"
-, update =	"98.07 agarwal, 98.03 agarwal"
+, author =      "A. Bj{\" o}rner and G. M. Ziegler"
+, title =       "Combinatorial stratification of complex arrangements"
+, journal =     "J. Amer. Math. Soc."
+, volume =      5
+, year =        1992
+, pages =       "105--149"
+, update =      "98.07 agarwal, 98.03 agarwal"
 }
 
 @techreport{bw-imsep-84
-, author =	"P. E. Bjorstad and O. B. Widlund"
-, title =	"Iterative methods for the solution of elliptic problems on regions partitioned into substructures"
-, type =	"Report"
-, number =	"TR136"
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1984
+, author =      "P. E. Bjorstad and O. B. Widlund"
+, title =       "Iterative methods for the solution of elliptic problems on regions partitioned into substructures"
+, type =        "Report"
+, number =      "TR136"
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1984
 }
 
 @inproceedings{b-ct-96
-, author =	"Ted Blacker"
-, title =	"The cooper tool"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"13--29"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Ted Blacker"
+, title =       "The cooper tool"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "13--29"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @manual{bbehlmstwobclpwwt-cmgev-94
-, author =	"T. D. Blacker and W. J. Bohnhoff and T. L. Edwards and J. R. Hipp and R. R. Lober and S. A. Mitchell G. D. Sjaardema and T. J. Tautges and T. J. Wilson and W. R. Oakes and S. Benzley and J. C. Clements and L. Lopez-Buriek and S. Parker and M. Whitely and D. White and E. Trimble"
-, title =	"CUBIT mesh generation environment volume 1: users manual"
-, organization =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, month =	may
-, year =	1994
-, note =	"SAND94-1100"
-, update =	"01.07 devillers, 98.07 bibrelex"
+, author =      "T. D. Blacker and W. J. Bohnhoff and T. L. Edwards and J. R. Hipp and R. R. Lober and S. A. Mitchell G. D. Sjaardema and T. J. Tautges and T. J. Wilson and W. R. Oakes and S. Benzley and J. C. Clements and L. Lopez-Buriek and S. Parker and M. Whitely and D. White and E. Trimble"
+, title =       "CUBIT mesh generation environment volume 1: users manual"
+, organization =        "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, month =       may
+, year =        1994
+, note =        "SAND94-1100"
+, update =      "01.07 devillers, 98.07 bibrelex"
 }
 
 @article{bj-etb-84
-, author =	"C. E. Blair and R. G. Jeroslow"
-, title =	"Extension of a theorem of {Balas}"
-, journal =	"Discrete Appl. Math."
-, volume =	9
-, year =	1984
-, pages =	"11--26"
+, author =      "C. E. Blair and R. G. Jeroslow"
+, title =       "Extension of a theorem of {Balas}"
+, journal =     "Discrete Appl. Math."
+, volume =      9
+, year =        1984
+, pages =       "11--26"
 }
 
 @inproceedings{blhrs-iacv-96
-, author =	"Gregoria Blanco and Jes{\'u}s Garc{\'\i}a L{\'o}pez and Ferran Hurtado and Pedro Ramos and Vera Sacrist{\'a}n"
-, title =	"Incidence Angle Constrained Visibility"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"27--28"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Gregoria Blanco and Jes{\'u}s Garc{\'\i}a L{\'o}pez and Ferran Hurtado and Pedro Ramos and Vera Sacrist{\'a}n"
+, title =       "Incidence Angle Constrained Visibility"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "27--28"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{b-calp-77
-, author =	"R. G. Bland"
-, title =	"A combinatorial abstraction of linear programming"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	23
-, year =	1977
-, pages =	"33--57"
-, update =	"97.03 gaertner+salinger"
+, author =      "R. G. Bland"
+, title =       "A combinatorial abstraction of linear programming"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      23
+, year =        1977
+, pages =       "33--57"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{b-nfprs-77
-, author =	"R. G. Bland"
-, title =	"New finite pivoting rules for the simplex method"
-, journal =	"Math. Oper. Res."
-, volume =	2
-, year =	1977
-, pages =	"103--107"
-, update =	"97.03 gaertner+salinger"
+, author =      "R. G. Bland"
+, title =       "New finite pivoting rules for the simplex method"
+, journal =     "Math. Oper. Res."
+, volume =      2
+, year =        1977
+, pages =       "103--107"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{bv-om-78
-, author =	"R. G. Bland and M. {Las Vergnas}"
-, title =	"Orientability of Matroids"
-, journal =	"J. Combin. Theory"
-, volume =	23
-, year =	1978
-, pages =	"94--123"
-, update =	"98.11 bibrelex"
+, author =      "R. G. Bland and M. {Las Vergnas}"
+, title =       "Orientability of Matroids"
+, journal =     "J. Combin. Theory"
+, volume =      23
+, year =        1978
+, pages =       "94--123"
+, update =      "98.11 bibrelex"
 }
 
 @article{bd-glihf-93
-, author =	"J. Blaney and S. Dixon"
-, title =	"A good ligand is hard to find: {Automated} docking methods"
-, journal =	"Perspectives in Drug Discovery and Design"
-, volume =	1
-, year =	1993
-, pages =	"310--319"
-, update =	"98.07 bibrelex"
+, author =      "J. Blaney and S. Dixon"
+, title =       "A good ligand is hard to find: {Automated} docking methods"
+, journal =     "Perspectives in Drug Discovery and Design"
+, volume =      1
+, year =        1993
+, pages =       "310--319"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{buma-ggfdp-90
-, author =	"H. Blanken and A. Ubema and P. Meek and B. Akker"
-, title =	"The generalized grid file: description and performance aspects"
-, booktitle =	"Proc. IEEE Internat. Conf. Data Eng."
-, site =	"Los-Angeles, Calif."
-, year =	1990
-, pages =	"380--388"
-, keywords =	"data structuring"
-, update =	"95.05 korneenko"
+, author =      "H. Blanken and A. Ubema and P. Meek and B. Akker"
+, title =       "The generalized grid file: description and performance aspects"
+, booktitle =   "Proc. IEEE Internat. Conf. Data Eng."
+, site =        "Los-Angeles, Calif."
+, year =        1990
+, pages =       "380--388"
+, keywords =    "data structuring"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bg-eest-90
-, author =	"Gabriele Blankenagel and Ralf Hartmut G{\"u}ting"
-, title =	"{EST}: {Externe} {Segment} {Trees}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	8
-, update =	"00.03 bibrelex"
+, author =      "Gabriele Blankenagel and Ralf Hartmut G{\"u}ting"
+, title =       "{EST}: {Externe} {Segment} {Trees}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       8
+, update =      "00.03 bibrelex"
 }
 
 @techreport{bg-ieapr-87
-, author =	"G. Blankenagel and R. H. G{\"u}ting"
-, title =	"Internal and external algorithms for the points-in-regions problem: the inside join of geo-relational algebra"
-, type =	"Report"
-, number =	228
-, institution =	"Fachber. Inform., Univ. Dortmund"
-, address =	"Dortmund, West Germany"
-, year =	1987
-, precedes =	"bg-ieapr-88"
+, author =      "G. Blankenagel and R. H. G{\"u}ting"
+, title =       "Internal and external algorithms for the points-in-regions problem: the inside join of geo-relational algebra"
+, type =        "Report"
+, number =      228
+, institution = "Fachber. Inform., Univ. Dortmund"
+, address =     "Dortmund, West Germany"
+, year =        1987
+, precedes =    "bg-ieapr-88"
 }
 
 @inproceedings{bg-ieapr-88
-, author =	"G. Blankenagel and R. H. G{\"u}ting"
-, title =	"Internal and external algorithms for the points-in-regions problem: the inside join of geo-relational algebra"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"85--89"
-, comments =	"extended abstract"
-, succeeds =	"bg-ieapr-87"
-, precedes =	"bg-ieapr-90"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "G. Blankenagel and R. H. G{\"u}ting"
+, title =       "Internal and external algorithms for the points-in-regions problem: the inside join of geo-relational algebra"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "85--89"
+, comments =    "extended abstract"
+, succeeds =    "bg-ieapr-87"
+, precedes =    "bg-ieapr-90"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @article{bg-ieapr-90
-, author =	"G. Blankenagel and R. H. G{\"u}ting"
-, title =	"Internal and external algorithms for the points-in-regions problem: the inside join of geo-relational algebra"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"251--276"
-, succeeds =	"bg-ieapr-88"
+, author =      "G. Blankenagel and R. H. G{\"u}ting"
+, title =       "Internal and external algorithms for the points-in-regions problem: the inside join of geo-relational algebra"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "251--276"
+, succeeds =    "bg-ieapr-88"
 }
 
 @incollection{bps-aamv-89
-, author =	"W.-E. Blanz and D. Petkovic and J. L. C. Sanz"
-, title =	"Algorithms and Architectures for Machine Vision"
-, editor =	"C. H. Chen"
-, booktitle =	"Signal Processing Handbook"
-, publisher =	"M. Dekker"
-, address =	"New York"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "W.-E. Blanz and D. Petkovic and J. L. C. Sanz"
+, title =       "Algorithms and Architectures for Machine Vision"
+, editor =      "C. H. Chen"
+, booktitle =   "Signal Processing Handbook"
+, publisher =   "M. Dekker"
+, address =     "New York"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @book{b-kuk-16
-, author =	"W. Blaschke"
-, title =	"Kreis und {Kugel}"
-, publisher =	"??"
-, address =	"Leipzig"
-, year =	1916
-, update =	"98.07 bibrelex"
+, author =      "W. Blaschke"
+, title =       "Kreis und {Kugel}"
+, publisher =   "??"
+, address =     "Leipzig"
+, year =        1916
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bmt-dppbp-96
-, author =	"Guy Blelloch and Gary L. Miller and Dafna Talmor"
-, title =	"Developing a Practical Projection-Based Parallel {Delaunay} Algorithm"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"186--195"
-, cites =	"acgoy-pcg-88, bey-eedt-91a, bmt-pdti-94, bchsz-ipndp-94, bl-psgps-94, csy-oscpf-95, c-pagp-80, cgo-mftpe-90, dddfk-rp3dc-95, d-sdcac-86, es-otatd-91, gg-ptpch-91, gs-pmgsc-85, ks-upcha-86, lf-ppc-80, m-piadt-92, mttw-dbnmt-95, ol-mcp-81, ps-cgi-85, rs-pnrst-89, sh-cpp-75, s-epacp-94, sd-csdta-95, tsbp-dpatd-93, t-dmwhf-63, vvm-eetpa-92, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Guy Blelloch and Gary L. Miller and Dafna Talmor"
+, title =       "Developing a Practical Projection-Based Parallel {Delaunay} Algorithm"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "186--195"
+, cites =       "acgoy-pcg-88, bey-eedt-91a, bmt-pdti-94, bchsz-ipndp-94, bl-psgps-94, csy-oscpf-95, c-pagp-80, cgo-mftpe-90, dddfk-rp3dc-95, d-sdcac-86, es-otatd-91, gg-ptpch-91, gs-pmgsc-85, ks-upcha-86, lf-ppc-80, m-piadt-92, mttw-dbnmt-95, ol-mcp-81, ps-cgi-85, rs-pnrst-89, sh-cpp-75, s-epacp-94, sd-csdta-95, tsbp-dpatd-93, t-dmwhf-63, vvm-eetpa-92, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{bmt-pdti-94
-, author =	"G. Blelloch and G. L. Miller and D. Talmor"
-, title =	"Parallel {Delaunay} triangulation imlpementation"
-, booktitle =	"Proc. 4th MSI Workshop Comput. Geom."
-, month =	oct
-, year =	1994
-, update =	"97.11 bibrelex"
+, author =      "G. Blelloch and G. L. Miller and D. Talmor"
+, title =       "Parallel {Delaunay} triangulation imlpementation"
+, booktitle =   "Proc. 4th MSI Workshop Comput. Geom."
+, month =       oct
+, year =        1994
+, update =      "97.11 bibrelex"
 }
 
 @article{bchsz-ipndp-94
-, author =	"G. E. Blelloch and S. Chatterjee and J. C. Hardwick and J. Sipelstein and M. Zagha"
-, title =	"Implementation of a portable nested data-parallel language"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	21
-, number =	1
-, month =	apr
-, year =	1994
-, pages =	"4--14"
-, update =	"97.11 bibrelex"
+, author =      "G. E. Blelloch and S. Chatterjee and J. C. Hardwick and J. Sipelstein and M. Zagha"
+, title =       "Implementation of a portable nested data-parallel language"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      21
+, number =      1
+, month =       apr
+, year =        1994
+, pages =       "4--14"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{blmpsz-csacm-91
-, author =	"G. E. Blelloch and C. E. Leiserson and B. M. Maggs and C. G. Plaxton and S. J. Smith and M. Zagha"
-, title =	"A comparison of sorting algorithms for the connection machine {CM-2}"
-, booktitle =	"Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
-, year =	1991
-, pages =	"3--16"
-, update =	"96.09 orourke"
+, author =      "G. E. Blelloch and C. E. Leiserson and B. M. Maggs and C. G. Plaxton and S. J. Smith and M. Zagha"
+, title =       "A comparison of sorting algorithms for the connection machine {CM-2}"
+, booktitle =   "Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
+, year =        1991
+, pages =       "3--16"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{bl-psgps-88
-, author =	"G. E. Blelloch and J. Little"
-, title =	"Parallel solutions to geometric problems on the scan model of computation"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, volume =	3
-, year =	1988
-, pages =	"218--222"
-, keywords =	"parallel computation"
-, update =	"95.05 korneenko"
+, author =      "G. E. Blelloch and J. Little"
+, title =       "Parallel solutions to geometric problems on the scan model of computation"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, volume =      3
+, year =        1988
+, pages =       "218--222"
+, keywords =    "parallel computation"
+, update =      "95.05 korneenko"
 }
 
 @article{bl-psgps-94
-, author =	"G. E. Blelloch and J. J. Little"
-, title =	"Parallel solutions to geometric problems in the scan model of computation"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	48
-, number =	1
-, month =	feb
-, year =	1994
-, pages =	"90--115"
-, update =	"97.11 bibrelex"
+, author =      "G. E. Blelloch and J. J. Little"
+, title =       "Parallel solutions to geometric problems in the scan model of computation"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      48
+, number =      1
+, month =       feb
+, year =        1994
+, pages =       "90--115"
+, update =      "97.11 bibrelex"
 }
 
 @article{bmht-dippd-99
-, author =	"G. E. Blelloch and G. L. Miller and J. C. Hardwick and D. Talmor"
-, title =	"Design and Implementation of a Practical Parallel {Delaunay} Algorithm"
-, journal =	"Algorithmica"
-, volume =	24
-, number =	3
-, year =	1999
-, pages =	"243--269"
-, update =	"99.11 held"
+, author =      "G. E. Blelloch and G. L. Miller and J. C. Hardwick and D. Talmor"
+, title =       "Design and Implementation of a Practical Parallel {Delaunay} Algorithm"
+, journal =     "Algorithmica"
+, volume =      24
+, number =      3
+, year =        1999
+, pages =       "243--269"
+, update =      "99.11 held"
 }
 
 @phdthesis{b-cmda-92
-, author =	"C. Bliek"
-, title =	"Computer Methods for Design Automation"
-, type =	"Ph.{D}. Thesis"
-, school =	"Massachusetts Institute of Technology"
-, address =	"Cambridge, Massachusetts"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"95.05 abrams"
+, author =      "C. Bliek"
+, title =       "Computer Methods for Design Automation"
+, type =        "Ph.{D}. Thesis"
+, school =      "Massachusetts Institute of Technology"
+, address =     "Cambridge, Massachusetts"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "95.05 abrams"
 }
 
 @article{b-hflts-77
-, author =	"J. Blinn"
-, title =	"A homogeneous formulation for lines in three-space"
-, journal =	"Comput. Graph."
-, volume =	11
-, number =	2
-, year =	1977
-, pages =	"237--241"
-, note =	"Proc. SIGGRAPH '77"
+, author =      "J. Blinn"
+, title =       "A homogeneous formulation for lines in three-space"
+, journal =     "Comput. Graph."
+, volume =      11
+, number =      2
+, year =        1977
+, pages =       "237--241"
+, note =        "Proc. SIGGRAPH '77"
 }
 
 @techreport{b-mrsdh-
-, author =	"J. F. Blinn"
-, title =	"A Method for Removing Some Degeneracies in Hidden Line and Ray Tracing Calculations"
-, institution =	"Jet Propulsion Lab."
-, year =	"??"
-, update =	"98.03 bibrelex"
+, author =      "J. F. Blinn"
+, title =       "A Method for Removing Some Degeneracies in Hidden Line and Ray Tracing Calculations"
+, institution = "Jet Propulsion Lab."
+, year =        "??"
+, update =      "98.03 bibrelex"
 }
 
 @article{b-tdgpl-91
-, author =	"J. F. Blinn"
-, title =	"A trip down the graphics pipeline: {Line} clipping"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	11
-, number =	1
-, year =	1991
-, pages =	"98--105"
-, keywords =	"clipping"
-, update =	"95.05 korneenko"
+, author =      "J. F. Blinn"
+, title =       "A trip down the graphics pipeline: {Line} clipping"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      11
+, number =      1
+, year =        1991
+, pages =       "98--105"
+, keywords =    "clipping"
+, update =      "95.05 korneenko"
 }
 
 @article{b-cwbcb-89
-, author =	"E. D. Bloch"
-, title =	"Complexes whose boundaries cannot be pushed around"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"365--374"
+, author =      "E. D. Bloch"
+, title =       "Complexes whose boundaries cannot be pushed around"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "365--374"
 }
 
 @inproceedings{b-csrpt-91
-, author =	"J. Bl{\"o}mer"
-, title =	"Computing Sums of Radicals in Polynomial Time"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"670--677"
-, update =	"97.03 gaertner+salinger"
+, author =      "J. Bl{\"o}mer"
+, title =       "Computing Sums of Radicals in Polynomial Time"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "670--677"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{b-hdrnr-92
-, author =	"J. Bl{\"o}mer"
-, title =	"How to Denest {Ramanujan's} Nested Radicals"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"447--457"
-, update =	"97.03 gaertner+salinger"
+, author =      "J. Bl{\"o}mer"
+, title =       "How to Denest {Ramanujan's} Nested Radicals"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "447--457"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{br-olbds-89
-, author =	"P. A. Bloniarz and S. S. Ravi"
-, title =	"An $\Omega(n\log n)$ lower bound for decomposing a set of points into chains"
-, journal =	"Inform. Process. Lett."
-, volume =	31
-, year =	1989
-, pages =	"319--322"
-, keywords =	"lower bounds, points"
-, update =	"95.05 korneenko"
+, author =      "P. A. Bloniarz and S. S. Ravi"
+, title =       "An $\Omega(n\log n)$ lower bound for decomposing a set of points into chains"
+, journal =     "Inform. Process. Lett."
+, volume =      31
+, year =        1989
+, pages =       "319--322"
+, keywords =    "lower bounds, points"
+, update =      "95.05 korneenko"
 }
 
 @article{b-ctp-77
-, author =	"G. S. Bloom"
-, title =	"A counterexamlpe to a theorem of {Piccard}"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	22
-, year =	1977
-, pages =	"378--379"
-, update =	"97.11 bibrelex"
+, author =      "G. S. Bloom"
+, title =       "A counterexamlpe to a theorem of {Piccard}"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      22
+, year =        1977
+, pages =       "378--379"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{b-isp-94
-, author =	"Jules Bloomenthal"
-, title =	"An Implicit Surface Polygonizer"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"324--349"
-, keywords =	"iso-surface, marching cubes, polygonization"
-, update =	"94.09 heckbert"
-, annote =	"Gives code to polygonize an arbitrary implicit surface.
+, author =      "Jules Bloomenthal"
+, title =       "An Implicit Surface Polygonizer"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "324--349"
+, keywords =    "iso-surface, marching cubes, polygonization"
+, update =      "94.09 heckbert"
+, annote =      "Gives code to polygonize an arbitrary implicit surface.
 Polygonization is a common approach to implicit surface rendering and volume
 rendering. When combined with code for trilinear interpolation code, a
 program for polygonizing volume data can easily be constructed. The
@@ -23048,694 +23048,694 @@ @incollection{b-isp-94
 }
 
 @book{b-iis-97
-, title =	"Introduction to Implicit Surfaces"
-, editor =	"Jules Bloomenthal"
-, volume =	391
-, publisher =	"Morgan-Kaufmann"
-, year =	1997
-, update =	"00.03 devillers"
+, title =       "Introduction to Implicit Surfaces"
+, editor =      "Jules Bloomenthal"
+, volume =      391
+, publisher =   "Morgan-Kaufmann"
+, year =        1997
+, update =      "00.03 devillers"
 }
 
 @article{b-pis-88
-, author =	"J. Bloomenthal"
-, title =	"Polygonization of implicit surfaces"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	5
-, number =	4
-, year =	1988
-, pages =	"341--355"
-, keywords =	"surface fitting"
-, update =	"95.05 korneenko"
+, author =      "J. Bloomenthal"
+, title =       "Polygonization of implicit surfaces"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      5
+, number =      4
+, year =        1988
+, pages =       "341--355"
+, keywords =    "surface fitting"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bc-olaip-93
-, author =	"Avrim Blum and Prasad Chalasani"
-, title =	"An On-Line Algorithm for Improving Performance in Navigation"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"2--11"
-, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Avrim Blum and Prasad Chalasani"
+, title =       "An On-Line Algorithm for Improving Performance in Navigation"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "2--11"
+, update =      "98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{bc-oaipn-00
-, author =	"A. Blum and P. Chalasani"
-, title =	"An online algorithm for improving performance in navigation"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, year =	2000
-, pages =	"1907--1938"
-, update =	"01.04 smid"
+, author =      "A. Blum and P. Chalasani"
+, title =       "An online algorithm for improving performance in navigation"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, year =        2000
+, pages =       "1907--1938"
+, update =      "01.04 smid"
 }
 
 @inproceedings{bcv-cfakm-95
-, author =	"A. Blum and P. Chalasani and S. Vempala"
-, title =	"A constant-factor approximation for the $k$-{MST} problem in the plane"
-, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '95"
-, year =	1995
-, pages =	"294--302"
-, update =	"98.07 bibrelex, 97.03 agarwal, 96.01 smid, 95.09 mitchell"
+, author =      "A. Blum and P. Chalasani and S. Vempala"
+, title =       "A constant-factor approximation for the $k$-{MST} problem in the plane"
+, booktitle =   "Proc. 27th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '95"
+, year =        1995
+, pages =       "294--302"
+, update =      "98.07 bibrelex, 97.03 agarwal, 96.01 smid, 95.09 mitchell"
 }
 
 @inproceedings{bk-likhu-93
-, author =	"Avrim Blum and Ravi Kannan"
-, title =	"Learning an Intersection of $k$ Halfspaces Over a Uniform Distribution"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"312--320"
-, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid+tamassia, 93.09 milone+mitchell"
+, author =      "Avrim Blum and Ravi Kannan"
+, title =       "Learning an Intersection of $k$ Halfspaces Over a Uniform Distribution"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "312--320"
+, update =      "98.07 bibrelex, 97.03 agarwal, 94.01 smid+tamassia, 93.09 milone+mitchell"
 }
 
 @inproceedings{brs-nugt-91
-, author =	"A. Blum and P. Raghavan and B. Schieber"
-, title =	"Navigating in unfamiliar geometric terrain"
-, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
-, year =	1991
-, pages =	"494--503"
-, keywords =	"path planning, on-line"
-, comments =	"Computing Reviews 9111-0883"
-, succeeds =	"brs-nut-90, brs-nugt-97"
-, cites =	"py-spwm-89"
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "A. Blum and P. Raghavan and B. Schieber"
+, title =       "Navigating in unfamiliar geometric terrain"
+, booktitle =   "Proc. 23rd Annu. ACM Sympos. Theory Comput."
+, year =        1991
+, pages =       "494--503"
+, keywords =    "path planning, on-line"
+, comments =    "Computing Reviews 9111-0883"
+, succeeds =    "brs-nut-90, brs-nugt-97"
+, cites =       "py-spwm-89"
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @article{brs-nugt-97
-, author =	"A. Blum and P. Raghavan and B. Schieber"
-, title =	"Navigating in unfamiliar geometric terrain"
-, journal =	"SIAM J. Comput."
-, volume =	26
-, number =	1
-, month =	feb
-, year =	1997
-, pages =	"110--137"
-, succeeds =	"brs-nugt-91"
-, update =	"98.03 mitchell, 97.07 smid"
+, author =      "A. Blum and P. Raghavan and B. Schieber"
+, title =       "Navigating in unfamiliar geometric terrain"
+, journal =     "SIAM J. Comput."
+, volume =      26
+, number =      1
+, month =       feb
+, year =        1997
+, pages =       "110--137"
+, succeeds =    "brs-nugt-91"
+, update =      "98.03 mitchell, 97.07 smid"
 }
 
 @inproceedings{brs-nut-90
-, author =	"A. Blum and P. Raghavan and B. Schieber"
-, title =	"Navigating in Unfamiliar Terrain"
-, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
-, year =	1990
-, precedes =	"brs-nugt-91"
-, update =	"98.11 bibrelex"
+, author =      "A. Blum and P. Raghavan and B. Schieber"
+, title =       "Navigating in Unfamiliar Terrain"
+, booktitle =   "Proc. 22nd Annu. ACM Sympos. Theory Comput."
+, year =        1990
+, precedes =    "brs-nugt-91"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{br-t3nnn-88
-, author =	"A. Blum and R. Rivest"
-, title =	"Training a $3$-node neural network is {NP}-complete"
-, booktitle =	"Proc. 1st. Workshop Comput. Learning Th."
-, year =	1988
-, pages =	"9--18"
-, update =	"98.03 bibrelex"
+, author =      "A. Blum and R. Rivest"
+, title =       "Training a $3$-node neural network is {NP}-complete"
+, booktitle =   "Proc. 1st. Workshop Comput. Learning Th."
+, year =        1988
+, pages =       "9--18"
+, update =      "98.03 bibrelex"
 }
 
 @article{b-gb-74
-, author =	"H. Blum"
-, title =	"A Geometry for Biology"
-, journal =	"Math. Analysis of Fundamental Biological Phenomena"
-, volume =	231
-, number =	1
-, year =	1974
-, pages =	"19--30"
-, update =	"93.09 held"
+, author =      "H. Blum"
+, title =       "A Geometry for Biology"
+, journal =     "Math. Analysis of Fundamental Biological Phenomena"
+, volume =      231
+, number =      1
+, year =        1974
+, pages =       "19--30"
+, update =      "93.09 held"
 }
 
 @incollection{b-tends-67
-, author =	"H. Blum"
-, title =	"A transformation for extracting new descriptors of shape"
-, editor =	"W. Wathen-Dunn"
-, booktitle =	"Models for the Perception of Speech and Visual Form"
-, publisher =	"MIT Press"
-, year =	1967
-, pages =	"362--380"
-, update =	"96.09 orourke"
+, author =      "H. Blum"
+, title =       "A transformation for extracting new descriptors of shape"
+, editor =      "W. Wathen-Dunn"
+, booktitle =   "Models for the Perception of Speech and Visual Form"
+, publisher =   "MIT Press"
+, year =        1967
+, pages =       "362--380"
+, update =      "96.09 orourke"
 }
 
 @article{bss-tccrn-89
-, author =	"L. Blum and M. Shub and S. Smale"
-, title =	"On a theory of computation and complexity over the real numbers: {NP}-completeness, recursive functions and universal machines"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	21
-, number =	"1--46"
-, year =	1989
-, update =	"98.11 bibrelex"
+, author =      "L. Blum and M. Shub and S. Smale"
+, title =       "On a theory of computation and complexity over the real numbers: {NP}-completeness, recursive functions and universal machines"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      21
+, number =      "1--46"
+, year =        1989
+, update =      "98.11 bibrelex"
 }
 
 @article{bfprt-tbs-73
-, author =	"M. Blum and R. W. Floyd and V. Pratt and R. L. Rivest and R. E. Tarjan"
-, title =	"Time bounds for selection"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	7
-, year =	1973
-, pages =	"448--461"
-, update =	"97.11 bibrelex"
+, author =      "M. Blum and R. W. Floyd and V. Pratt and R. L. Rivest and R. E. Tarjan"
+, title =       "Time bounds for selection"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      7
+, year =        1973
+, pages =       "448--461"
+, update =      "97.11 bibrelex"
 }
 
 @article{bk-dpcw-95
-, author =	"Manuel Blum and Sampath Kannan"
-, title =	"Designing Programs that Check Their Work"
-, journal =	"J. ACM"
-, volume =	42
-, number =	1
-, month =	jan
-, year =	1995
-, pages =	"269--291"
-, update =	"97.03 tamassia"
+, author =      "Manuel Blum and Sampath Kannan"
+, title =       "Designing Programs that Check Their Work"
+, journal =     "J. ACM"
+, volume =      42
+, number =      1
+, month =       jan
+, year =        1995
+, pages =       "269--291"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{bk-ptctw-89
-, author =	"M. Blum and S. Kannan"
-, title =	"Programs that check their work"
-, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "M. Blum and S. Kannan"
+, title =       "Programs that check their work"
+, booktitle =   "Proc. 21st Annu. ACM Sympos. Theory Comput."
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bk-pcwma-78
-, author =	"M. Blum and D. Kozen"
-, title =	"On the power of the compass (or, why mazes are easier to search than graphs)"
-, booktitle =	"Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1978
-, pages =	"132--142"
+, author =      "M. Blum and D. Kozen"
+, title =       "On the power of the compass (or, why mazes are easier to search than graphs)"
+, booktitle =   "Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1978
+, pages =       "132--142"
 }
 
 @article{blr-stcan-93
-, author =	"Manuel Blum and Michael Luby and Ronitt Rubinfeld"
-, title =	"Self-Testing/Correcting with Applications to Numerical Problems"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	47
-, number =	3
-, year =	1993
-, pages =	"549--595"
-, succeeds =	"blr-scanp-90"
-, update =	"98.07 tamassia+vismara"
+, author =      "Manuel Blum and Michael Luby and Ronitt Rubinfeld"
+, title =       "Self-Testing/Correcting with Applications to Numerical Problems"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      47
+, number =      3
+, year =        1993
+, pages =       "549--595"
+, succeeds =    "blr-scanp-90"
+, update =      "98.07 tamassia+vismara"
 }
 
 @inproceedings{blr-scanp-90
-, author =	"M. Blum and M. Luby and R. Rubinfeld"
-, title =	"Selftesting/correcting with applications to numerical problems"
-, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
-, year =	1990
-, pages =	"73--83"
-, update =	"97.11 bibrelex"
+, author =      "M. Blum and M. Luby and R. Rubinfeld"
+, title =       "Selftesting/correcting with applications to numerical problems"
+, booktitle =   "Proc. 22nd Annu. ACM Sympos. Theory Comput."
+, year =        1990
+, pages =       "73--83"
+, update =      "97.11 bibrelex"
 }
 
 @article{bm-anrow-80
-, author =	"N. Blum and K. Mehlhorn"
-, title =	"On the average number of rebalancing operations in weight-balanced trees"
-, journal =	"Theoret. Comput. Sci."
-, volume =	11
-, year =	1980
-, pages =	"303--320"
-, update =	"98.03 bibrelex"
+, author =      "N. Blum and K. Mehlhorn"
+, title =       "On the average number of rebalancing operations in weight-balanced trees"
+, journal =     "Theoret. Comput. Sci."
+, volume =      11
+, year =        1980
+, pages =       "303--320"
+, update =      "98.03 bibrelex"
 }
 
 @book{bm-sg-70
-, author =	"L. M. Blumenthal and K. Menger"
-, title =	"Studies in Geometry"
-, publisher =	"W. H. Freeman"
-, address =	"San Francisco, CA"
-, year =	1970
+, author =      "L. M. Blumenthal and K. Menger"
+, title =       "Studies in Geometry"
+, publisher =   "W. H. Freeman"
+, address =     "San Francisco, CA"
+, year =        1970
 }
 
 @inproceedings{bbehw-clgcv-86
-, author =	"A. Blumer and A. Ehrenfeucht and D. Haussler and M. Warmuth"
-, title =	"Classifying learnable geometric concepts with Vapnik-Chervonenkis dimension"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "A. Blumer and A. Ehrenfeucht and D. Haussler and M. Warmuth"
+, title =       "Classifying learnable geometric concepts with Vapnik-Chervonenkis dimension"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @article{behw-clgcv-89
-, author =	"A. Blumer and A. Ehrenfeucht and D. Haussler and M. Warmuth"
-, title =	"Learnability and the {Vapnik}-{Chervonenkis} Dimension"
-, journal =	"J. ACM"
-, volume =	36
-, year =	1989
-, pages =	"929--965"
-, keywords =	"pattern recognition, probability theory, probabilistic geometry, approximation, separation, probabilistic analysis"
-, update =	"97.11 bibrelex"
+, author =      "A. Blumer and A. Ehrenfeucht and D. Haussler and M. Warmuth"
+, title =       "Learnability and the {Vapnik}-{Chervonenkis} Dimension"
+, journal =     "J. ACM"
+, volume =      36
+, year =        1989
+, pages =       "929--965"
+, keywords =    "pattern recognition, probability theory, probabilistic geometry, approximation, separation, probabilistic analysis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bgp-cdnsc-98
-, author =	"Marko Boben and Harald Gropp and Toma{\v z} Pisanski"
-, title =	"Computer Drawings of Non-Symmetric Configurations"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"37--40"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Marko Boben and Harald Gropp and Toma{\v z} Pisanski"
+, title =       "Computer Drawings of Non-Symmetric Configurations"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "37--40"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{bw-rphs-88
-, author =	"J. Bobowski and J. M. Wills"
-, title =	"Regular polyhedra with hidden symmetry"
-, journal =	"The Mathematical Intelligencer"
-, volume =	10
-, number =	11
-, year =	1988
-, pages =	"27--32"
-, update =	"98.07 bibrelex"
+, author =      "J. Bobowski and J. M. Wills"
+, title =       "Regular polyhedra with hidden symmetry"
+, journal =     "The Mathematical Intelligencer"
+, volume =      10
+, number =      11
+, year =        1988
+, pages =       "27--32"
+, update =      "98.07 bibrelex"
 }
 
 @article{bdg-tocrm-85
-, author =	"J. Bobrow and S. Dubowsky and J. Gibson"
-, title =	"Time-Optimal Control of Robot Manipulators"
-, journal =	"Internat. J. Robot. Res."
-, volume =	4
-, number =	3
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "J. Bobrow and S. Dubowsky and J. Gibson"
+, title =       "Time-Optimal Control of Robot Manipulators"
+, journal =     "Internat. J. Robot. Res."
+, volume =      4
+, number =      3
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bdg-ocrma-83
-, author =	"J. E. Bobrow and S. Dubowsky and J. S. Gibson"
-, title =	"On the Optimal Control of Robotic Manipulators with Actuator Constraints"
-, booktitle =	"Proc. ACC"
-, site =	"San Francisco, CA"
-, year =	1983
-, pages =	"782--787"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Bobrow and S. Dubowsky and J. S. Gibson"
+, title =       "On the Optimal Control of Robotic Manipulators with Actuator Constraints"
+, booktitle =   "Proc. ACC"
+, site =        "San Francisco, CA"
+, year =        1983
+, pages =       "782--787"
+, update =      "97.11 bibrelex"
 }
 
 @book{b-iha-07
-, author =	"Maxime Bocher"
-, title =	"Introduction to higher algebra"
-, publisher =	"Macmillan"
-, year =	1907
-, update =	"97.03 tamassia"
+, author =      "Maxime Bocher"
+, title =       "Introduction to higher algebra"
+, publisher =   "Macmillan"
+, year =        1907
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{bm-csdp-97
-, author =	"Daciana Bochis and Marisa Mazon"
-, title =	"Combinatorial Structure of {Dirichlet} Partitions"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"51--54"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 bibrelex"
+, author =      "Daciana Bochis and Marisa Mazon"
+, title =       "Combinatorial Structure of {Dirichlet} Partitions"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "51--54"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{bs-mnf3d-98
-, author =	"Daciana Bochis and Francisco Santos"
-, title =	"On the Maximal Number of Facets of 3-Dimensional {Dirichlet} Stereohedra"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"41--43"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 bibrelex"
+, author =      "Daciana Bochis and Francisco Santos"
+, title =       "On the Maximal Number of Facets of 3-Dimensional {Dirichlet} Stereohedra"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "41--43"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{bgr-sppta-95
-, author =	"D. F. Bochis and M. J. Gonz{\'a}lez-L{\'o}pez and T. Recio"
-, title =	"Simulation Program of the Path Tracking for Any Irredundant Planar Manipulator and the {6R} Manipulator"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"71--73"
-, update =	"00.03 bibrelex"
+, author =      "D. F. Bochis and M. J. Gonz{\'a}lez-L{\'o}pez and T. Recio"
+, title =       "Simulation Program of the Path Tracking for Any Irredundant Planar Manipulator and the {6R} Manipulator"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "71--73"
+, update =      "00.03 bibrelex"
 }
 
 @book{bcr-gar-87
-, author =	"J. Bochnak and M. Coste and M.-F. Roy"
-, title =	"G\'eom\'etrie Alg\'ebrique R\'eelle"
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg"
-, year =	1987
-, update =	"98.07 agarwal, 95.05 agarwal"
+, author =      "J. Bochnak and M. Coste and M.-F. Roy"
+, title =       "G\'eom\'etrie Alg\'ebrique R\'eelle"
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg"
+, year =        1987
+, update =      "98.07 agarwal, 95.05 agarwal"
 }
 
 @book{b-ak-74
-, author =	"H. H. Bock"
-, title =	"Automatische {Klassifikation}"
-, publisher =	"Vandenhoeck \& Ruprecht"
-, address =	"G{\"o}ttingen, West Germany"
-, year =	1974
-, update =	"98.07 bibrelex"
+, author =      "H. H. Bock"
+, title =       "Automatische {Klassifikation}"
+, publisher =   "Vandenhoeck \& Ruprecht"
+, address =     "G{\"o}ttingen, West Germany"
+, year =        1974
+, update =      "98.07 bibrelex"
 }
 
 @techreport{bl-app-89
-, author =	"L. Bodin and L. Levy"
-, title =	"The arc partitioning problem"
-, institution =	"College of Bus. and Mgmt., Univ. of Maryland at College Park"
-, month =	feb
-, year =	1989
-, update =	"93.09 milone+mitchell"
+, author =      "L. Bodin and L. Levy"
+, title =       "The arc partitioning problem"
+, institution = "College of Bus. and Mgmt., Univ. of Maryland at College Park"
+, month =       feb
+, year =        1989
+, update =      "93.09 milone+mitchell"
 }
 
 @article{bfk-scsmc-84
-, author =	"W. Boehm and G. Farin and J. Kahmann"
-, title =	"A survey of curve and surface methods in {CAGD}"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	1
-, number =	1
-, year =	1984
-, pages =	"1--60"
-, update =	"98.07 bibrelex"
+, author =      "W. Boehm and G. Farin and J. Kahmann"
+, title =       "A survey of curve and surface methods in {CAGD}"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      1
+, number =      1
+, year =        1984
+, pages =       "1--60"
+, update =      "98.07 bibrelex"
 }
 
 @article{b-siacs-91
-, author =	"E. Boender"
-, title =	"A survey of intersection algorithms for curved surfaces"
-, journal =	"Comput. Graph. (UK)"
-, volume =	15
-, number =	1
-, year =	1991
-, pages =	"109--115"
-, keywords =	"intersection, curvilinear, three-dimensional, survey"
-, update =	"95.05 korneenko"
+, author =      "E. Boender"
+, title =       "A survey of intersection algorithms for curved surfaces"
+, journal =     "Comput. Graph. (UK)"
+, volume =      15
+, number =      1
+, year =        1991
+, pages =       "109--115"
+, keywords =    "intersection, curvilinear, three-dimensional, survey"
+, update =      "95.05 korneenko"
 }
 
 @article{b-sdmsb-88
-, author =	"F. G. Boese"
-, title =	"Surface Drawing Made Simple -- But Not Too Simple"
-, journal =	"Comput. Aided Design"
-, volume =	20
-, number =	5
-, month =	jun
-, year =	1988
-, pages =	"249--258"
-, update =	"93.09 held"
+, author =      "F. G. Boese"
+, title =       "Surface Drawing Made Simple -- But Not Too Simple"
+, journal =     "Comput. Aided Design"
+, volume =      20
+, number =      5
+, month =       jun
+, year =        1988
+, pages =       "249--258"
+, update =      "93.09 held"
 }
 
 @article{bk-pmmm-84
-, author =	"T. B. Boffey and J. Karkazis"
-, title =	"$P$-medians and multi-medians"
-, journal =	"J. Oper. Res. Society"
-, volume =	35
-, number =	1
-, year =	1984
-, pages =	"57--64"
-, keywords =	"facility location"
-, update =	"95.05 korneenko"
+, author =      "T. B. Boffey and J. Karkazis"
+, title =       "$P$-medians and multi-medians"
+, journal =     "J. Oper. Res. Society"
+, volume =      35
+, number =      1
+, year =        1984
+, pages =       "57--64"
+, keywords =    "facility location"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bilf-putg-91
-, author =	"K. P. Bogart and G. Isaak and L. Langley and P. C. Fishburn"
-, title =	"Proper and Unit Tolerance Graphs"
-, type =	"Technical Report"
-, number =	"91-74"
-, institution =	"DIMACS"
-, month =	nov
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "K. P. Bogart and G. Isaak and L. Langley and P. C. Fishburn"
+, title =       "Proper and Unit Tolerance Graphs"
+, type =        "Technical Report"
+, number =      "91-74"
+, institution = "DIMACS"
+, month =       nov
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @techreport{bs-adssv-95
-, author =	"P. Bogdanovich and H. Samet"
-, title =	"The ATRee: A data structure to support very large scientific databases"
-, type =	"Computer Science Department"
-, number =	"CS-TR-3455"
-, institution =	"University of Maryland"
-, month =	mar
-, year =	1995
-, update =	"96.05 efrat"
+, author =      "P. Bogdanovich and H. Samet"
+, title =       "The ATRee: A data structure to support very large scientific databases"
+, type =        "Computer Science Department"
+, number =      "CS-TR-3455"
+, institution = "University of Maryland"
+, month =       mar
+, year =        1995
+, update =      "96.05 efrat"
 }
 
 @article{b-dgmnb-88
-, author =	"A. Bogomolny"
-, title =	"Digital geometry may not be discrete"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	43
-, number =	2
-, year =	1988
-, pages =	"205--220"
-, keywords =	"digital geometry"
-, update =	"95.05 korneenko"
+, author =      "A. Bogomolny"
+, title =       "Digital geometry may not be discrete"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      43
+, number =      2
+, year =        1988
+, pages =       "205--220"
+, keywords =    "digital geometry"
+, update =      "95.05 korneenko"
 }
 
 @techreport{b-smc-49
-, author =	"D. J. Bogue"
-, title =	"The structure of the metropolitan community"
-, type =	"Report"
-, number =	"??"
-, institution =	"Univ. Mich. Contributions Inst. Human Adjustment Social Sci."
-, address =	"Ann Arbor, MI"
-, year =	1949
+, author =      "D. J. Bogue"
+, title =       "The structure of the metropolitan community"
+, type =        "Report"
+, number =      "??"
+, institution = "Univ. Mich. Contributions Inst. Human Adjustment Social Sci."
+, address =     "Ann Arbor, MI"
+, year =        1949
 }
 
 @incollection{b-wdwnb-90
-, author =	"G. Bohlender"
-, title =	"What do we need beyond {IEEE}-arithmetics?"
-, booktitle =	"Computer Arithmetic and self-validating numerical methods"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1990
-, pages =	"1--32"
-, update =	"98.07 bibrelex"
+, author =      "G. Bohlender"
+, title =       "What do we need beyond {IEEE}-arithmetics?"
+, booktitle =   "Computer Arithmetic and self-validating numerical methods"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1990
+, pages =       "1--32"
+, update =      "98.07 bibrelex"
 }
 
 @book{bruw-pcmls-86
-, author =	"G. Bohlender and L. B. Rall and C. Ullrich and J. {Wolff von Gudenberg}"
-, title =	"{PASCAL-CS} - {A} Microcomputer Language for Scientific Computation"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "G. Bohlender and L. B. Rall and C. Ullrich and J. {Wolff von Gudenberg}"
+, title =       "{PASCAL-CS} - {A} Microcomputer Language for Scientific Computation"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{b-ansrt-90
-, author =	"J. B{\"o}hm"
-, title =	"Addendum to the note ``{Some} remarks on triangulating a $d$-cube''"
-, journal =	"Beitr. Algebra Geom."
-, volume =	30
-, year =	1990
-, pages =	"167--168"
-, keywords =	"$d$-dimensional, hypercube, triangulation"
-, update =	"95.05 korneenko"
+, author =      "J. B{\"o}hm"
+, title =       "Addendum to the note ``{Some} remarks on triangulating a $d$-cube''"
+, journal =     "Beitr. Algebra Geom."
+, volume =      30
+, year =        1990
+, pages =       "167--168"
+, keywords =    "$d$-dimensional, hypercube, triangulation"
+, update =      "95.05 korneenko"
 }
 
 @article{b-srtdc-89
-, author =	"J. B{\"o}hm"
-, title =	"Some remarks on triangulating a $d$-cube"
-, journal =	"Beitr. Algebra Geom."
-, volume =	29
-, year =	1989
-, pages =	"195--218"
-, keywords =	"$d$-dimensional, hypercube, triangulation"
-, update =	"95.05 korneenko"
+, author =      "J. B{\"o}hm"
+, title =       "Some remarks on triangulating a $d$-cube"
+, journal =     "Beitr. Algebra Geom."
+, volume =      29
+, year =        1989
+, pages =       "195--218"
+, keywords =    "$d$-dimensional, hypercube, triangulation"
+, update =      "95.05 korneenko"
 }
 
 @book{bs-dcmta-84
-, author =	"K. B{\"o}hmer and H. J. Stetter"
-, title =	"Defect correction methods, theory and applications"
-, publisher =	"Springer-Verlag"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "K. B{\"o}hmer and H. J. Stetter"
+, title =       "Defect correction methods, theory and applications"
+, publisher =   "Springer-Verlag"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bn-ucasa-90
-, author =	"K. Bohringer and F. {Newbery Paulisch}"
-, title =	"Using Constraints to Achieve Stability in Automatic Graph Layout Algorithms"
-, booktitle =	"Proc. ACM Conf. on Human Factors in Computing Systems"
-, nickname =	"CHI"
-, year =	1990
-, pages =	"43--51"
-, keywords =	"graph drawing"
-, update =	"98.07 vismara, 96.09 tamassia, 93.09 tamassia"
+, author =      "K. Bohringer and F. {Newbery Paulisch}"
+, title =       "Using Constraints to Achieve Stability in Automatic Graph Layout Algorithms"
+, booktitle =   "Proc. ACM Conf. on Human Factors in Computing Systems"
+, nickname =    "CHI"
+, year =        1990
+, pages =       "43--51"
+, keywords =    "graph drawing"
+, update =      "98.07 vismara, 96.09 tamassia, 93.09 tamassia"
 }
 
 @inproceedings{bbg-smutv-95
-, author =	"K.-F. B{\"o}hringer and V. Bhatt and K. Y. Goldberg"
-, title =	"Sensorless manipulation using transverse vibrations of a plate"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Nagoya, Japan"
-, year =	1995
-, pages =	"1989--1996"
-, update =	"98.07 bibrelex"
+, author =      "K.-F. B{\"o}hringer and V. Bhatt and K. Y. Goldberg"
+, title =       "Sensorless manipulation using transverse vibrations of a plate"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Nagoya, Japan"
+, year =        1995
+, pages =       "1989--1996"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bdh-abpfe-97
-, author =	"K.-F. B{\"o}hringer and B. Donald and D. Halperin"
-, title =	"The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"457--459"
-, cites =	"bbg-smutv-95, bdm-scsaa-96, bdm-ulbpv-96, do-hssp-90, e-acg-87, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "K.-F. B{\"o}hringer and B. Donald and D. Halperin"
+, title =       "The Area Bisectors of a Polygon and Force Equilibria in Programmable Vector Fields"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "457--459"
+, cites =       "bbg-smutv-95, bdm-scsaa-96, bdm-ulbpv-96, do-hssp-90, e-acg-87, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{bdm-scsaa-96
-, author =	"K.-F. B{\"o}hringer and B. R. Donald and N. C. MacDonald"
-, title =	"Single-crystal silicon actuator arrays for micro manipulation tasks"
-, booktitle =	"Proc. IEEE Workshop on Micro Electro Mechanical Systems"
-, nickname =	"MEMS"
-, site =	"San Diego, CA"
-, month =	feb
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "K.-F. B{\"o}hringer and B. R. Donald and N. C. MacDonald"
+, title =       "Single-crystal silicon actuator arrays for micro manipulation tasks"
+, booktitle =   "Proc. IEEE Workshop on Micro Electro Mechanical Systems"
+, nickname =    "MEMS"
+, site =        "San Diego, CA"
+, month =       feb
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @incollection{bdm-ulbpv-96
-, author =	"K.-F. B{\"o}hringer and B. R. Donald and N. C. MacDonald"
-, title =	"Upper and lower bounds for programmable vector fields with applications to {MEMS} and vibratory plate part feeders"
-, editor =	"J.-P. Laumond and M. H. Overmars"
-, booktitle =	"Algorithms for Robotic Motion and Manipulation"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1996
-, pages =	"255--276"
-, update =	"98.07 bibrelex"
+, author =      "K.-F. B{\"o}hringer and B. R. Donald and N. C. MacDonald"
+, title =       "Upper and lower bounds for programmable vector fields with applications to {MEMS} and vibratory plate part feeders"
+, editor =      "J.-P. Laumond and M. H. Overmars"
+, booktitle =   "Algorithms for Robotic Motion and Manipulation"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1996
+, pages =       "255--276"
+, update =      "98.07 bibrelex"
 }
 
 @article{b--94
-, author =	"Jean-Daniel Boissonnat"
-, title =	"??"
-, journal =	"J. Mol Graphics"
-, volume =	12
-, year =	1994
-, pages =	"61--62"
-, update =	"99.07 devillers, 98.03 bibrelex"
+, author =      "Jean-Daniel Boissonnat"
+, title =       "??"
+, journal =     "J. Mol Graphics"
+, volume =      12
+, year =        1994
+, pages =       "61--62"
+, update =      "99.07 devillers, 98.03 bibrelex"
 }
 
 @inproceedings{b-asmra-86
-, author =	"Jean-Daniel Boissonnat"
-, title =	"Automatic Solid Modeler For Robotics Applications"
-, booktitle =	"Robotics Research: Third International Symposium. MIT Press Series in Artificial Intelligence."
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1986
-, pages =	"65--72"
-, keywords =	"Delaunay triangulation, geometric shape representation, geometric solid modeler"
-, update =	"99.07 devillers"
-, annote =	"3D DT"
-, abstract =	"This paper discusses several applications of the
-		 Delaunay triangulation for shape representation and
-		 manipulation, in the context of robotics. This
-		 structure appears to be a useful tool in order to deal
-		 with points scattered over surfaces of objects.
-		 Reconstruction, matching and intersection problems are
-		 considered. (Author abstract) 12 refs."
+, author =      "Jean-Daniel Boissonnat"
+, title =       "Automatic Solid Modeler For Robotics Applications"
+, booktitle =   "Robotics Research: Third International Symposium. MIT Press Series in Artificial Intelligence."
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1986
+, pages =       "65--72"
+, keywords =    "Delaunay triangulation, geometric shape representation, geometric solid modeler"
+, update =      "99.07 devillers"
+, annote =      "3D DT"
+, abstract =    "This paper discusses several applications of the
+                 Delaunay triangulation for shape representation and
+                 manipulation, in the context of robotics. This
+                 structure appears to be a useful tool in order to deal
+                 with points scattered over surfaces of objects.
+                 Reconstruction, matching and intersection problems are
+                 considered. (Author abstract) 12 refs."
 }
 
 @article{b-gstds-84
-, author =	"Jean-Daniel Boissonnat"
-, title =	"Geometric structures for three-dimensional shape representation"
-, journal =	"ACM Trans. Graph."
-, volume =	3
-, number =	4
-, year =	1984
-, pages =	"266--286"
-, comments =	"further experimental results of the algorithm described in this article can be found in N. Ayache, J. D. Boissonnat, L. Cohen, B. Geiger, J. Levy-Vehel, O. Monga, P. Sander--Steps toward the Automatic Interpretation of 3D Images.  In 3D imaging in Medicine, vol F60 (1990)"
-, update =	"99.07 devillers, 98.07 devillers, 93.09 milone+mitchell"
+, author =      "Jean-Daniel Boissonnat"
+, title =       "Geometric structures for three-dimensional shape representation"
+, journal =     "ACM Trans. Graph."
+, volume =      3
+, number =      4
+, year =        1984
+, pages =       "266--286"
+, comments =    "further experimental results of the algorithm described in this article can be found in N. Ayache, J. D. Boissonnat, L. Cohen, B. Geiger, J. Levy-Vehel, O. Monga, P. Sander--Steps toward the Automatic Interpretation of 3D Images.  In 3D imaging in Medicine, vol F60 (1990)"
+, update =      "99.07 devillers, 98.07 devillers, 93.09 milone+mitchell"
 }
 
 @inproceedings{b-pagc-98
-, author =	"Jean-Daniel Boissonnat"
-, title =	"Predicate Arithmetic for Geometric Computing"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	3
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Jean-Daniel Boissonnat"
+, title =       "Predicate Arithmetic for Geometric Computing"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       3
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{b-rs-85
-, author =	"Jean-Daniel Boissonnat"
-, title =	"Reconstruction of solids"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"46--54"
-, comments =	"part of the results appeared in Geometric structures for 3D shape representation, ACM TOG, Vol 3, No. 4, Oct 84, pp266-286 and Shape Reconstruction for Planar Cross Sections, CGIP, Vol 44, pp 1-29 (1988) (good description on line)"
-, cites =	"s-fssd-76, o-pma3d-81, fku-osrpc-77, r-pc-64, s-cg-78, k-cddvd-80, b-gstds-84, ph-chfsp-77, bwy-oetac-80, s-iggp-76, gs-cdtp-78, b-cdt-81, h-tadpe-82, m-hpppp-70, ZZZ"
-, update =	"99.07 devillers, 97.11 bibrelex, 94.09 jones, 93.09 milone+mitchell"
+, author =      "Jean-Daniel Boissonnat"
+, title =       "Reconstruction of solids"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "46--54"
+, comments =    "part of the results appeared in Geometric structures for 3D shape representation, ACM TOG, Vol 3, No. 4, Oct 84, pp266-286 and Shape Reconstruction for Planar Cross Sections, CGIP, Vol 44, pp 1-29 (1988) (good description on line)"
+, cites =       "s-fssd-76, o-pma3d-81, fku-osrpc-77, r-pc-64, s-cg-78, k-cddvd-80, b-gstds-84, ph-chfsp-77, bwy-oetac-80, s-iggp-76, gs-cdtp-78, b-cdt-81, h-tadpe-82, m-hpppp-70, ZZZ"
+, update =      "99.07 devillers, 97.11 bibrelex, 94.09 jones, 93.09 milone+mitchell"
 }
 
 @inproceedings{b-r2d3d-84
-, author =	"Jean-Daniel Boissonnat"
-, title =	"Representing 2d And 3d Shapes With The {Delaunay} Triangulation"
-, booktitle =	"Proc. 7th IEEE Internat. Conf. Pattern Recogn."
-, publisher =	"IEEE"
-, address =	"New York, NY"
-, year =	1984
-, pages =	"745--748"
-, keywords =	"Delaunay triangulation, automatic modeling, 3d shapes, 2d shapes, computer vision"
-, update =	"99.07 devillers"
-, annote =	"3D DT. We eliminate tetras until all points are on
-		 boundary surface."
-, abstract =	"In order to represent and measure a 2-dimensional or a
-		 3-dimensional shape defined by a finite number of
-		 points on its boundary, the author proposes to use the
-		 Delaunay triangulation. It is shown that a good
-		 polyhedral approximation of the shape can be obtained
-		 and that a number of applications become
-		 straightforward. The Delaunay triangulation appears to
-		 be a useful tool in discrete curve and surface
-		 analysis. 2 refs."
+, author =      "Jean-Daniel Boissonnat"
+, title =       "Representing 2d And 3d Shapes With The {Delaunay} Triangulation"
+, booktitle =   "Proc. 7th IEEE Internat. Conf. Pattern Recogn."
+, publisher =   "IEEE"
+, address =     "New York, NY"
+, year =        1984
+, pages =       "745--748"
+, keywords =    "Delaunay triangulation, automatic modeling, 3d shapes, 2d shapes, computer vision"
+, update =      "99.07 devillers"
+, annote =      "3D DT. We eliminate tetras until all points are on
+                 boundary surface."
+, abstract =    "In order to represent and measure a 2-dimensional or a
+                 3-dimensional shape defined by a finite number of
+                 points on its boundary, the author proposes to use the
+                 Delaunay triangulation. It is shown that a good
+                 polyhedral approximation of the shape can be obtained
+                 and that a number of applications become
+                 straightforward. The Delaunay triangulation appears to
+                 be a useful tool in discrete curve and surface
+                 analysis. 2 refs."
 }
 
 @techreport{b-srpcs-86
-, author =	"Jean-Daniel Boissonnat"
-, title =	"Shape reconstruction from planar cross-sections"
-, type =	"Report"
-, number =	546
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, year =	1986
-, update =	"99.07 devillers, 98.03 bibrelex"
+, author =      "Jean-Daniel Boissonnat"
+, title =       "Shape reconstruction from planar cross-sections"
+, type =        "Report"
+, number =      546
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, year =        1986
+, update =      "99.07 devillers, 98.03 bibrelex"
 }
 
 @article{b-srpcs-88
-, author =	"Jean-Daniel Boissonnat"
-, title =	"Shape Reconstruction From Planar Cross-Sections"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	44
-, number =	1
-, month =	oct
-, year =	1988
-, pages =	"1--29"
-, keywords =	"shape reconstruction, planar cross sections, Delaunay triangulation, computational geometry"
-, update =	"99.07 devillers, 93.09 devillers"
-, annote =	"Computes the 3D DT between two contours (extra points
-		 are added to force the boundary---by repeatedly adding
-		 midpoints to edges not in DT) by merging DTs of each
-		 contour. Then tetras are eliminated so that each point
-		 is on the surface."
-, abstract =	"We propose a new solution to the problem of
-		 constructing a shape over a set of cross-sectional
-		 contours. We construct a volume whose boundary is a
-		 polyhedron with triangular faces intersecting the
-		 cutting planes along the given contours. This volume is
-		 obtained, slice by slice, by pruning the Delaunay
-		 triangulations formed between two adjacent cross
-		 sections. The Delaunay triangulation can be computed
-		 efficiently in this specific situation: an algorithm is
-		 presented that is optimal with respect to the input
-		 size and the output size and that only uses
-		 2-dimensional operations. The shape reconstruction
-		 method extracts, from that triangulation, a maximum
-		 solid with no singularity. It can handle the case where
-		 the number of contours varies from one cross section to
-		 the other and thus, can handle contour-defined objects
-		 which are branched and have holes. This algorithm has
-		 been fully implemented and tested on various examples;
-		 results on medical images are presented. (Author
-		 abstract) 28 Refs."
+, author =      "Jean-Daniel Boissonnat"
+, title =       "Shape Reconstruction From Planar Cross-Sections"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      44
+, number =      1
+, month =       oct
+, year =        1988
+, pages =       "1--29"
+, keywords =    "shape reconstruction, planar cross sections, Delaunay triangulation, computational geometry"
+, update =      "99.07 devillers, 93.09 devillers"
+, annote =      "Computes the 3D DT between two contours (extra points
+                 are added to force the boundary---by repeatedly adding
+                 midpoints to edges not in DT) by merging DTs of each
+                 contour. Then tetras are eliminated so that each point
+                 is on the surface."
+, abstract =    "We propose a new solution to the problem of
+                 constructing a shape over a set of cross-sectional
+                 contours. We construct a volume whose boundary is a
+                 polyhedron with triangular faces intersecting the
+                 cutting planes along the given contours. This volume is
+                 obtained, slice by slice, by pruning the Delaunay
+                 triangulations formed between two adjacent cross
+                 sections. The Delaunay triangulation can be computed
+                 efficiently in this specific situation: an algorithm is
+                 presented that is optimal with respect to the input
+                 size and the output size and that only uses
+                 2-dimensional operations. The shape reconstruction
+                 method extracts, from that triangulation, a maximum
+                 solid with no singularity. It can handle the case where
+                 the number of contours varies from one cross section to
+                 the other and thus, can handle contour-defined objects
+                 which are branched and have holes. This algorithm has
+                 been fully implemented and tested on various examples;
+                 results on medical images are presented. (Author
+                 abstract) 28 Refs."
 }
 
 @techreport{bb-arcto-94
-, author =	"J.-D. Boissonnat and X.-N. Bui"
-, title =	"Accessibility region for a car that only moves forwards along optimal paths"
-, type =	"Research Report"
-, number =	2181
-, institution =	"INRIA Sophia-Antipolis"
-, year =	1994
-, update =	"99.07 devillers, 98.03 mitchell, 97.11 bibrelex"
-, abstract =	"
+, author =      "J.-D. Boissonnat and X.-N. Bui"
+, title =       "Accessibility region for a car that only moves forwards along optimal paths"
+, type =        "Research Report"
+, number =      2181
+, institution = "INRIA Sophia-Antipolis"
+, year =        1994
+, update =      "99.07 devillers, 98.03 mitchell, 97.11 bibrelex"
+, abstract =    "
 In [BSBL93], the   synthesis problem    has  been solved    for  a
  non-holonomic car-like robot only allowed to move forwards in a plane.
  Here  we complete  the study  of this  mobile robot  by  computing the
@@ -23750,157 +23750,157 @@ @techreport{bb-arcto-94
 }
 
 @inproceedings{bc-cfssg-01
-, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals"
-, title =	"Coarse-to-fine surface simplification with geometric guarantees"
-, editor =	"A. Chalmers and T.-M. Rhyne"
-, booktitle =	"Eurographics'01"
-, publisher =	"Blackwell"
-, address =	"Manchester"
-, year =	2001
-, pages =	""
-, update =	"01.11 devillers, 01.07 devillers"
+, author =      "Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals"
+, title =       "Coarse-to-fine surface simplification with geometric guarantees"
+, editor =      "A. Chalmers and T.-M. Rhyne"
+, booktitle =   "Eurographics'01"
+, publisher =   "Blackwell"
+, address =     "Manchester"
+, year =        2001
+, pages =       ""
+, update =      "01.11 devillers, 01.07 devillers"
 }
 
 @article{bc-ncps-01
-, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals"
-, title =	"Natural Coordinates of Points on a Surface"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"155--173"
-, update =	"02.03 devillers"
+, author =      "Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals"
+, title =       "Natural Coordinates of Points on a Surface"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "155--173"
+, update =      "02.03 devillers"
 }
 
 @article{bc-nncps-01
-, author =	"J.-D. Boissonnat and F. Cazals"
-, title =	"Natural neighbor coordinates of points on a surface"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"155--173"
-, update =	"01.11 smid"
+, author =      "J.-D. Boissonnat and F. Cazals"
+, title =       "Natural neighbor coordinates of points on a surface"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "155--173"
+, update =      "01.11 smid"
 }
 
 @inproceedings{bc-ssrnn-00
-, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals"
-, title =	"Smooth surface reconstruction via natural neighbour interpolation of distance functions"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"223--232"
-, update =	"00.11 smid, 00.07 devillers, 00.03 devillers"
+, author =      "Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals"
+, title =       "Smooth surface reconstruction via natural neighbour interpolation of distance functions"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "223--232"
+, update =      "00.11 smid, 00.07 devillers, 00.03 devillers"
 }
 
 @inproceedings{bcddprty-pcet-99
-, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals and Frank Da and Olivier Devillers and Sylvain Pion and Fran{\c c}ois Rebufat and Monique Teillaud and Mariette Yvinec"
-, title =	"Programming with {CGAL}: The Example of Triangulations"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"421--423"
-, url =	"https://hal.inria.fr/inria-00348713/"
-, update =	"02.03 devillers, 00.03 bibrelex, 99.11 bibrelex, 99.07 devillers"
+, author =      "Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals and Frank Da and Olivier Devillers and Sylvain Pion and Fran{\c c}ois Rebufat and Monique Teillaud and Mariette Yvinec"
+, title =       "Programming with {CGAL}: The Example of Triangulations"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "421--423"
+, url = "https://inria.hal.science/inria-00348713/"
+, update =      "02.03 devillers, 00.03 bibrelex, 99.11 bibrelex, 99.07 devillers"
 }
 
 @inproceedings{bcf-2sdsm-00
-, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals and Julia Fl{\"o}totto"
-, title =	"2$D$-Structure Drawings of Similar Molecules"
-, editor =	"Joe Marks"
-, booktitle =	"Graph Drawing: 8th international symposium"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1984
-, publisher =	"Springer-Verlag"
-, year =	2000
-, pages =	"115--126"
-, update =	"01.11 devillers"
+, author =      "Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals and Julia Fl{\"o}totto"
+, title =       "2$D$-Structure Drawings of Similar Molecules"
+, editor =      "Joe Marks"
+, booktitle =   "Graph Drawing: 8th international symposium"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1984
+, publisher =   "Springer-Verlag"
+, year =        2000
+, pages =       "115--126"
+, update =      "01.11 devillers"
 }
 
 @inproceedings{bcn-ssr-99
-, author =	"Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals and St{\'e}phane Nullans"
-, title =	"Smooth Shape Reconstruction"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"63--68"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Jean-Daniel Boissonnat and Fr{\'e}d{\'e}ric Cazals and St{\'e}phane Nullans"
+, title =       "Smooth Shape Reconstruction"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "63--68"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{bcdkl-sppbd-99
-, author =	"Jean-Daniel Boissonnat and Andr\'e C\'er\'ezo and Elena Degtiariora-Kostova and Vladimir Kostov and Juliette Leblond"
-, title =	"Shortest plane paths with bounded derivative of the curvature"
-, journal =	"C. R. Acad. Sci."
-, volume =	"329-I"
-, year =	1999
-, pages =	"613--618"
-, succeeds =	"bcl-nspps-94"
-, update =	"99.11 devillers"
+, author =      "Jean-Daniel Boissonnat and Andr\'e C\'er\'ezo and Elena Degtiariora-Kostova and Vladimir Kostov and Juliette Leblond"
+, title =       "Shortest plane paths with bounded derivative of the curvature"
+, journal =     "C. R. Acad. Sci."
+, volume =      "329-I"
+, year =        1999
+, pages =       "613--618"
+, succeeds =    "bcl-nspps-94"
+, update =      "99.11 devillers"
 }
 
 @inproceedings{bcddy-acchs-92
-, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Jacqueline Duquesne and Mariette Yvinec"
-, title =	"An algorithm for constructing the convex hull of a set of spheres in dimension $d$"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"269--273"
-, precedes =	"bcddy-acchs-96"
-, cites =	"c-ochap-91, cs-arscg-89, bdsty-arsol-92, ms-cpubc-71, r-chada-92, ss-tddsp-90, ZZZ"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.07 devillers, 97.03 devillers, 96.01 devillers, 93.09 devillers"
+, author =      "Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Jacqueline Duquesne and Mariette Yvinec"
+, title =       "An algorithm for constructing the convex hull of a set of spheres in dimension $d$"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "269--273"
+, precedes =    "bcddy-acchs-96"
+, cites =       "c-ochap-91, cs-arscg-89, bdsty-arsol-92, ms-cpubc-71, r-chada-92, ss-tddsp-90, ZZZ"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.07 devillers, 97.03 devillers, 96.01 devillers, 93.09 devillers"
 }
 
 @article{bcddy-acchs-96
-, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Jacqueline Duquesne and Mariette Yvinec"
-, title =	"An algorithm for constructing the convex hull of a set of spheres in dimension $d$"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"123--130"
-, url =	"https://hal.inria.fr/inria-00413159"
-, succeeds =	"bcddy-acchs-92"
-, cites =	"r-chada-92, ss-tddsp-90, m-mnfcp-70, c-ochap-91, cs-arscg-89, s-sdlpc-91, bdsty-arsol-92"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.07 devillers"
-, abstract =	"We present an algorithm which computes the convex hull of a set of $n$ spheres i n dimension $d$ in time $O (n^{\lceil \frac{d}{2} \rceil}+n\log n)$.  It is worst-case optimal in three dimensions and in even dimensions.  The same method can also be used to compute the convex hull of a set of $n$ homo thetic convex objects of $E^d$. If the complexity of each object is constant, the time needed in the worst case is $O(n^{\lceil \frac{d}{2} \rceil}+n\log n)$."
+, author =      "Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Jacqueline Duquesne and Mariette Yvinec"
+, title =       "An algorithm for constructing the convex hull of a set of spheres in dimension $d$"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "123--130"
+, url = "https://inria.hal.science/inria-00413159"
+, succeeds =    "bcddy-acchs-92"
+, cites =       "r-chada-92, ss-tddsp-90, m-mnfcp-70, c-ochap-91, cs-arscg-89, s-sdlpc-91, bdsty-arsol-92"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 97.07 devillers"
+, abstract =    "We present an algorithm which computes the convex hull of a set of $n$ spheres i n dimension $d$ in time $O (n^{\lceil \frac{d}{2} \rceil}+n\log n)$.  It is worst-case optimal in three dimensions and in even dimensions.  The same method can also be used to compute the convex hull of a set of $n$ homo thetic convex objects of $E^d$. If the complexity of each object is constant, the time needed in the worst case is $O(n^{\lceil \frac{d}{2} \rceil}+n\log n)$."
 }
 
 @techreport{bcdt-osc3d-91t
-, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Monique Teillaud"
-, title =	"Output-sensitive construction of the $3$-d {Delaunay} triangulation of constrained sets of points"
-, type =	"Research {Report}"
-, number =	1415
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, month =	apr
-, year =	1991
-, keywords =	"Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography"
-, precedes =	"bcdt-osc3d-91i, bcdt-oscdt-96"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.05 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, author =      "Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Monique Teillaud"
+, title =       "Output-sensitive construction of the $3$-d {Delaunay} triangulation of constrained sets of points"
+, type =        "Research {Report}"
+, number =      1415
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, month =       apr
+, year =        1991
+, keywords =    "Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography"
+, precedes =    "bcdt-osc3d-91i, bcdt-oscdt-96"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.05 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
 }
 
 @inproceedings{bcdt-osc3d-91i
-, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Monique Teillaud"
-, title =	"Output-sensitive construction of the $3$-d {Delaunay} triangulation of constrained sets of points"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"110--113"
-, keywords =	"Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography"
-, succeeds =	"bcdt-osc3d-91t"
-, precedes =	"bcdt-oscdt-96"
-, cites =	"b-srpcs-88, bcdt-osc3d-91t, bdsty-olgag-91a, bm-sdcs-71, cs-arscg-89, e-acg-87, em-feptd-85, s-chdch-86, ZZZ"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.05 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, author =      "Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Monique Teillaud"
+, title =       "Output-sensitive construction of the $3$-d {Delaunay} triangulation of constrained sets of points"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "110--113"
+, keywords =    "Delaunay triangulation, Voronoi diagrams, output-sensitive algorithms, shape reconstructions, shelling, tomography"
+, succeeds =    "bcdt-osc3d-91t"
+, precedes =    "bcdt-oscdt-96"
+, cites =       "b-srpcs-88, bcdt-osc3d-91t, bdsty-olgag-91a, bm-sdcs-71, cs-arscg-89, e-acg-87, em-feptd-85, s-chdch-86, ZZZ"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.05 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
 }
 
 @article{bcdt-oscdt-96
-, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Monique Teillaud"
-, title =	"Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, number =	1
-, year =	1996
-, pages =	"1--14"
-, url =	"https://hal.inria.fr/hal-00795075"
-, succeeds =	"bcdt-osc3d-91t, bcdt-osc3d-91i"
-, cites =	"ps-cgi-85, e-acg-87, a-vdsfg-91, s-chdch-86, ms-loq-92, cs-arscg-89, bdsty-arsol-92, bcdt-osc3d-91i, bm-sdcs-71, bcdt-osc3d-94t, b-srpcs-88, a-pdpaa-87, c-ig-61, p-gcc-70, dmt-ssgtu-92i, gs-ccrs-87, eg-tsa-89, b-gdg-83"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.05 devillers"
-, abstract =	"In this paper, we propose an algorithm to compute the
+, author =      "Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Olivier Devillers and Monique Teillaud"
+, title =       "Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, number =      1
+, year =        1996
+, pages =       "1--14"
+, url = "https://inria.hal.science/hal-00795075"
+, succeeds =    "bcdt-osc3d-91t, bcdt-osc3d-91i"
+, cites =       "ps-cgi-85, e-acg-87, a-vdsfg-91, s-chdch-86, ms-loq-92, cs-arscg-89, bdsty-arsol-92, bcdt-osc3d-91i, bm-sdcs-71, bcdt-osc3d-94t, b-srpcs-88, a-pdpaa-87, c-ig-61, p-gcc-70, dmt-ssgtu-92i, gs-ccrs-87, eg-tsa-89, b-gdg-83"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.05 devillers"
+, abstract =    "In this paper, we propose an algorithm to compute the
 Delaunay triangulation of a set $S$ of {$n$} points in 3-dimensional
 space when the points lie in 2 planes.  The algorithm is
 output-sensitive and optimal with respect to the input and the output
@@ -23909,75 +23909,75 @@ @article{bcdt-oscdt-96
 }
 
 @inproceedings{bcd-acchs-92
-, author =	"J. D. Boissonnat and A. C{\'e}r{\'e}zo and J. Duquesne"
-, title =	"An Algorithm for Constructing the Convex Hull of a Set of Spheres in Three Dimensional Space"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"51--53"
-, update =	"01.07 devillers, 00.03 bibrelex"
+, author =      "J. D. Boissonnat and A. C{\'e}r{\'e}zo and J. Duquesne"
+, title =       "An Algorithm for Constructing the Convex Hull of a Set of Spheres in Three Dimensional Space"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "51--53"
+, update =      "01.07 devillers, 00.03 bibrelex"
 }
 
 @techreport{bcl-nspps-94
-, author =	"Jean-Daniel Boissonnat and Andr{\'e} C\'er\'ezo and Juliette Leblond"
-, title =	"A Note on Shortest Paths in the Plane Subject to a Constraint on the Derivative of the Curvature"
-, type =	"Rapport de recherche"
-, number =	2160
-, institution =	"INRIA"
-, year =	1994
-, precedes =	"bcdkl-sppbd-99"
-, update =	"99.11 devillers, 99.07 devillers, 98.03 mitchell"
+, author =      "Jean-Daniel Boissonnat and Andr{\'e} C\'er\'ezo and Juliette Leblond"
+, title =       "A Note on Shortest Paths in the Plane Subject to a Constraint on the Derivative of the Curvature"
+, type =        "Rapport de recherche"
+, number =      2160
+, institution = "INRIA"
+, year =        1994
+, precedes =    "bcdkl-sppbd-99"
+, update =      "99.11 devillers, 99.07 devillers, 98.03 mitchell"
 }
 
 @techreport{bcl-spbcp-91
-, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Juliette Leblond"
-, title =	"Shortest paths of bounded curvature in the plane"
-, type =	"Report"
-, number =	1503
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, month =	jul
-, year =	1991
-, precedes =	"bcl-spbcp-92"
-, update =	"99.07 devillers, 95.01 devillers, 93.09 rote"
+, author =      "Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Juliette Leblond"
+, title =       "Shortest paths of bounded curvature in the plane"
+, type =        "Report"
+, number =      1503
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, month =       jul
+, year =        1991
+, precedes =    "bcl-spbcp-92"
+, update =      "99.07 devillers, 95.01 devillers, 93.09 rote"
 }
 
 @inproceedings{bcl-spbcp-92
-, author =	"Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Juliette Leblond"
-, title =	"Shortest paths of bounded curvature in the plane"
-, booktitle =	"Proc. 9th IEEE Internat. Conf. Robot. Autom."
-, year =	1992
-, succeeds =	"bcl-spbcp-91"
-, precedes =	"bcl-spbcp-94"
-, update =	"99.07 devillers, 95.01 devillers, 93.09 rote"
+, author =      "Jean-Daniel Boissonnat and Andr{\'e} C{\'e}r{\'e}zo and Juliette Leblond"
+, title =       "Shortest paths of bounded curvature in the plane"
+, booktitle =   "Proc. 9th IEEE Internat. Conf. Robot. Autom."
+, year =        1992
+, succeeds =    "bcl-spbcp-91"
+, precedes =    "bcl-spbcp-94"
+, update =      "99.07 devillers, 95.01 devillers, 93.09 rote"
 }
 
 @article{bcl-spbcp-94
-, author =	"Jean-Daniel Boissonnat and Andr{\'e} C\'er\'ezo and Juliette Leblond"
-, title =	"Shortest paths of bounded curvature in the plane"
-, journal =	"Internat. J. Intell. Syst."
-, volume =	10
-, year =	1994
-, pages =	"1--16"
-, update =	"99.07 devillers, 95.01 devillers"
+, author =      "Jean-Daniel Boissonnat and Andr{\'e} C\'er\'ezo and Juliette Leblond"
+, title =       "Shortest paths of bounded curvature in the plane"
+, journal =     "Internat. J. Intell. Syst."
+, volume =      10
+, year =        1994
+, pages =       "1--16"
+, update =      "99.07 devillers, 95.01 devillers"
 }
 
 @inproceedings{bcdry-ctbc-94
-, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jean-Marc Robert and Mariette Yvinec"
-, title =	"Convex Tours of Bounded Curvature"
-, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
-, nickname =	"ESA '94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"254--265"
-, url =	"https://hal.inria.fr/hal-01179475"
-, precedes =	"bcdry-ctbc-99"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 98.03 mitchell, 97.03 devillers, 96.01 devillers, 95.05 agarwal"
-, abstract =	"
+, author =      "Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jean-Marc Robert and Mariette Yvinec"
+, title =       "Convex Tours of Bounded Curvature"
+, booktitle =   "Proc. 2nd Annu. European Sympos. Algorithms"
+, nickname =    "ESA '94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "254--265"
+, url = "https://inria.hal.science/hal-01179475"
+, precedes =    "bcdry-ctbc-99"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 98.03 mitchell, 97.03 devillers, 96.01 devillers, 95.05 agarwal"
+, abstract =    "
  We consider the  motion  planning problem  for a point  constrained to
  move along a  smooth (C1) closed (cycle)
  convex  path  of  bounded curvature.  The
@@ -23988,68 +23988,68 @@ @inproceedings{bcdry-ctbc-94
 }
 
 @article{bcdry-ctbc-99
-, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jean-Marc Robert and Mariette Yvinec"
-, title =	"Convex Tours of Bounded Curvature"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, year =	1999
-, pages =	"149--159"
-, url =	"https://hal.inria.fr/inria-00413181"
-, archive =	"XXX:cs.CG/9909004"
-, succeeds =	"bcdry-ctbc-94"
-, cites =	"agss-ltacv-89, dxcr-kmp-93, d-cmlca-57, fw-pcm-91, jc-pspmr-89, kslo-prpph-96, k-osps-83, l-rmp-91, o-mpic-87, o-ramp-92, os-plamp-94, p-masp-77, rs-mppmo-94, ss-ampr-90, w-mpav-88"
-, update =	"99.11 devillers+smid"
-, abstract =	"We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with $m$ vertices, containing an obstacle in a form of a simple polygon with $n$ vertices.  We present an $O(m+n)$ time algorithm finding the path, going around the obstacle, whose curvature is the smallest possible."
+, author =      "Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jean-Marc Robert and Mariette Yvinec"
+, title =       "Convex Tours of Bounded Curvature"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, year =        1999
+, pages =       "149--159"
+, url = "https://inria.hal.science/inria-00413181"
+, archive =     "XXX:cs.CG/9909004"
+, succeeds =    "bcdry-ctbc-94"
+, cites =       "agss-ltacv-89, dxcr-kmp-93, d-cmlca-57, fw-pcm-91, jc-pspmr-89, kslo-prpph-96, k-osps-83, l-rmp-91, o-mpic-87, o-ramp-92, os-plamp-94, p-masp-77, rs-mppmo-94, ss-ampr-90, w-mpav-88"
+, update =      "99.11 devillers+smid"
+, abstract =    "We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with $m$ vertices, containing an obstacle in a form of a simple polygon with $n$ vertices.  We present an $O(m+n)$ time algorithm finding the path, going around the obstacle, whose curvature is the smallest possible."
 }
 
 @techreport{bcduy-clcst-95
-, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jorge Urrutia and Mariette Yvinec"
-, title =	"Computing Largest Circles Separating Two Sets of Segments"
-, type =	"Research {Report}"
-, number =	2705
-, institution =	"INRIA"
-, address =	"BP93, 06902 Sophia-Antipolis, France"
-, year =	1995
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=2705"
-, update =	"99.07 devillers, 96.01 devillers"
-, abstract =	"A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An $\Theta(n \log  n)$ optimal algorithm is proposed to find all largest circles separating two given sets of line segments when line segments are allowed to meet only at their endpoints. This settles an open problem from a previous paper\cite{bcdy-csp-95}. In the general case, when line segments may intersect $\Omega(n^2)$ times, our algorithm can be adapted to work in $O(n \alpha(n) \log n)$ time and $O(n \alpha(n))$ space, where $\alpha(n)$ represents the extremely slowly growing inverse of Ackermann function."
+, author =      "Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jorge Urrutia and Mariette Yvinec"
+, title =       "Computing Largest Circles Separating Two Sets of Segments"
+, type =        "Research {Report}"
+, number =      2705
+, institution = "INRIA"
+, address =     "BP93, 06902 Sophia-Antipolis, France"
+, year =        1995
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=2705"
+, update =      "99.07 devillers, 96.01 devillers"
+, abstract =    "A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An $\Theta(n \log  n)$ optimal algorithm is proposed to find all largest circles separating two given sets of line segments when line segments are allowed to meet only at their endpoints. This settles an open problem from a previous paper\cite{bcdy-csp-95}. In the general case, when line segments may intersect $\Omega(n^2)$ times, our algorithm can be adapted to work in $O(n \alpha(n) \log n)$ time and $O(n \alpha(n))$ space, where $\alpha(n)$ represents the extremely slowly growing inverse of Ackermann function."
 }
 
 @inproceedings{bcduy-clcst-96
-, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jorge Urrutia and Mariette Yvinec"
-, title =	"Computing largest circles separating two sets of segments"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"173--178"
-, precedes =	"bcduy-clcst-00"
-, update =	"01.11 devillers, 99.07 devillers, 97.03 agarwal, 96.09 mitchell"
+, author =      "Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jorge Urrutia and Mariette Yvinec"
+, title =       "Computing largest circles separating two sets of segments"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "173--178"
+, precedes =    "bcduy-clcst-00"
+, update =      "01.11 devillers, 99.07 devillers, 97.03 agarwal, 96.09 mitchell"
 }
 
 @article{bcduy-clcst-00
-, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jorge Urrutia and Mariette Yvinec"
-, title =	"Computing Largest Circles Separating Two Sets of Segments"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, year =	2000
-, pages =	"41--54"
-, url =	"https://hal.inria.fr/inria-00338701"
-, archive =	"XXX/cs.CG/9909005"
-, succeeds =	"bcduy-clcst-96"
-, cites =	"abosy-fmcnp-89, b-cspps-88, bcdy-csp-95, bg-aoscf-95, cegss-cfals-93, dj-cmcnp-90, bds-lric-95, dk-ladsc-85, egs-cmcap-90, ep-mps-88, f-spcrd-86, ka-dd-84, k-eccs-79, k-osps-83, ld-gvdp-81, mt-cppna-85, m-lpltw-84, ms-sapo-95, m-idssp-92, okm-ccs-86"
-, update =	"01.11 devillers"
-, abstract =	"A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An $\Theta(n \log  n)$ optimal algorithm is proposed to find all largest circles separating two given sets of line segments when line segments are allowe d to meet only at their endpoints.  In the general case, when line segments may intersect $\Omega(n^2)$ times, our algorithm can be adapted to work in $O(n \alpha(n) \log n)$ time and $O(n \alpha(n))$ space, where $\alpha(n)$ represents the extremely slowly growing inverse of the Ackermann function."
+, author =      "Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Jorge Urrutia and Mariette Yvinec"
+, title =       "Computing Largest Circles Separating Two Sets of Segments"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, year =        2000
+, pages =       "41--54"
+, url = "https://inria.hal.science/inria-00338701"
+, archive =     "XXX/cs.CG/9909005"
+, succeeds =    "bcduy-clcst-96"
+, cites =       "abosy-fmcnp-89, b-cspps-88, bcdy-csp-95, bg-aoscf-95, cegss-cfals-93, dj-cmcnp-90, bds-lric-95, dk-ladsc-85, egs-cmcap-90, ep-mps-88, f-spcrd-86, ka-dd-84, k-eccs-79, k-osps-83, ld-gvdp-81, mt-cppna-85, m-lpltw-84, ms-sapo-95, m-idssp-92, okm-ccs-86"
+, update =      "01.11 devillers"
+, abstract =    "A circle $C$ separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An $\Theta(n \log  n)$ optimal algorithm is proposed to find all largest circles separating two given sets of line segments when line segments are allowe d to meet only at their endpoints.  In the general case, when line segments may intersect $\Omega(n^2)$ times, our algorithm can be adapted to work in $O(n \alpha(n) \log n)$ time and $O(n \alpha(n))$ space, where $\alpha(n)$ represents the extremely slowly growing inverse of the Ackermann function."
 }
 
 @inproceedings{bcdy-csp-95
-, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Mariette Yvinec"
-, title =	"Circular Separability of Polygons"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"273--281"
-, keywords =	"separation, containment, largest disk, Voronoi diagrams"
-, precedes =	"bcdy-csp-01"
-, update =	"01.11 devillers, 99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.09 agarwal, 96.05 mitchell, 96.01 devillers, 95.09 devillers, 95.01 devillers"
-, abstract =	"Two planar sets are circularly separable if there exists
+, author =      "Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Mariette Yvinec"
+, title =       "Circular Separability of Polygons"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "273--281"
+, keywords =    "separation, containment, largest disk, Voronoi diagrams"
+, precedes =    "bcdy-csp-01"
+, update =      "01.11 devillers, 99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.09 agarwal, 96.05 mitchell, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, abstract =    "Two planar sets are circularly separable if there exists
 a circle enclosing one of the set and whose open interior disk does not
 intersect the other set.  This paper studies two problems related to
 circular separability. A linear-time algorithm is proposed to decide if
@@ -24061,160 +24061,160 @@ @inproceedings{bcdy-csp-95
 }
 
 @article{bcdy-csp-01
-, author =	"Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Mariette Yvinec"
-, title =	"Circular Separability of Polygons"
-, journal =	"Algorithmica"
-, volume =	30
-, year =	2001
-, pages =	"67i--82"
-, url =	"http://link.springer.de/link/service/journals/00453/contents/00/10078/paper/10078.pdf"
-, archive =	"XXX/cs.CG/9909007"
-, succeeds =	"bcdy-csp-95"
-, cites =	"abosy-fmcnp-89, agss-ltacv-89, bcdry-ctbc-94, bg-aoscf-95, b-cspps-88, c-bvdcp-86, dj-cmcnp-90, dk-ladsc-85, ep-mps-88, f-spcrd-86, ka-dd-84, k-osps-83, l-sss-71, l-fchsp-83, m-lpltw-84, m-idssp-92, ms-sapo-95, okm-ccs-86"
-, update =	"01.11 devillers"
-, abstract =	"Two planar sets are circularly separable if there exists a circle enclosing one of the set and whose open interior disk does not intersect the other set.  This paper studies two problems related to circular separability. A linear-time algorithm is proposed to decide if two polygons are circularly separable. The algorithm outputs the smallest separating circle. The second problem asks for the largest circle included in a preprocessed, convex polygon, under some point and/or line constraints.  The resulting circle must contain the query points and it must lie in the halfplanes delimited by the query lines."
+, author =      "Jean-Daniel Boissonnat and Jurek Czyzowicz and Olivier Devillers and Mariette Yvinec"
+, title =       "Circular Separability of Polygons"
+, journal =     "Algorithmica"
+, volume =      30
+, year =        2001
+, pages =       "67i--82"
+, url = "http://link.springer.de/link/service/journals/00453/contents/00/10078/paper/10078.pdf"
+, archive =     "XXX/cs.CG/9909007"
+, succeeds =    "bcdy-csp-95"
+, cites =       "abosy-fmcnp-89, agss-ltacv-89, bcdry-ctbc-94, bg-aoscf-95, b-cspps-88, c-bvdcp-86, dj-cmcnp-90, dk-ladsc-85, ep-mps-88, f-spcrd-86, ka-dd-84, k-osps-83, l-sss-71, l-fchsp-83, m-lpltw-84, m-idssp-92, ms-sapo-95, okm-ccs-86"
+, update =      "01.11 devillers"
+, abstract =    "Two planar sets are circularly separable if there exists a circle enclosing one of the set and whose open interior disk does not intersect the other set.  This paper studies two problems related to circular separability. A linear-time algorithm is proposed to decide if two polygons are circularly separable. The algorithm outputs the smallest separating circle. The second problem asks for the largest circle included in a preprocessed, convex polygon, under some point and/or line constraints.  The resulting circle must contain the query points and it must lie in the halfplanes delimited by the query lines."
 }
 
 @inproceedings{bddp-mpsr-92
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and LeonBattista Donati and Franco P. Preparata"
-, title =	"Motion planning for a spider robot"
-, booktitle =	"Proc. 9th IEEE Internat. Conf. Robot. Autom."
-, year =	1992
-, pages =	"2321--2326"
-, keywords =	"motion planning, legged robot"
-, precedes =	"bddp-mplrs-95"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and LeonBattista Donati and Franco P. Preparata"
+, title =       "Motion planning for a spider robot"
+, booktitle =   "Proc. 9th IEEE Internat. Conf. Robot. Autom."
+, year =        1992
+, pages =       "2321--2326"
+, keywords =    "motion planning, legged robot"
+, precedes =    "bddp-mplrs-95"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
 }
 
 @article{bddp-mplrs-95
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and LeonBattista Donati and Franco P. Preparata"
-, title =	"Motion planning of legged robots: the spider robot problem"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, number =	"1--2"
-, year =	1995
-, pages =	"3--20"
-, url =	"https://hal.inria.fr/hal-00795083"
-, succeeds =	"bddp-mpsr-92,bddp-spsr-92"
-, cites =	"ps-cgi-85, l-knnvd-82, agss-ltacv-87, s-ksacs-91, hs-ompc-91, p-pplr-90, w-cvgnl-85, bdp-cu3ct-91"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers"
-, abstract =	"We consider the problem of planning motions of a simple legged robot called the spider robot. The robot is modelled as a point where all its legs are attached, and the footholds where the robot can securely place its feet consist of a set of $n$ points in the plane.  We show that the space $\cal F$ of admissible and stable placements of such robots has size $\Theta(n^2)$ and can be constructed in $O(n^2\log n)$ time and $O(n^2)$ space. Once $\cal F$ has been constructed, we can efficiently solve several problems related to motion planning."
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and LeonBattista Donati and Franco P. Preparata"
+, title =       "Motion planning of legged robots: the spider robot problem"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, number =      "1--2"
+, year =        1995
+, pages =       "3--20"
+, url = "https://inria.hal.science/hal-00795083"
+, succeeds =    "bddp-mpsr-92,bddp-spsr-92"
+, cites =       "ps-cgi-85, l-knnvd-82, agss-ltacv-87, s-ksacs-91, hs-ompc-91, p-pplr-90, w-cvgnl-85, bdp-cu3ct-91"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers"
+, abstract =    "We consider the problem of planning motions of a simple legged robot called the spider robot. The robot is modelled as a point where all its legs are attached, and the footholds where the robot can securely place its feet consist of a set of $n$ points in the plane.  We show that the space $\cal F$ of admissible and stable placements of such robots has size $\Theta(n^2)$ and can be constructed in $O(n^2\log n)$ time and $O(n^2)$ space. Once $\cal F$ has been constructed, we can efficiently solve several problems related to motion planning."
 }
 
 @inproceedings{bddp-spsr-92
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and LeonBattista Donati and Franco P. Preparata"
-, title =	"Stable placements of spider robots"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"242--250"
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1767"
-, keywords =	"motion planning, legged robot"
-, precedes =	"bddp-mplrs-95"
-, cites =	"agss-ltacv-89, bddp-mpsr-92, bdp-cu3ct-91, hs-ompc-91, hk-gsftq-91, hnku-agcqw-84, l-knnvd-82, ps-cgi-85, -sill-84, -sill-90, s-ksacs-91, ZZZ"
-, update =	"99.07 devillers, 97.11 bibrelex, 95.09 devillers, 95.01 devillers"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and LeonBattista Donati and Franco P. Preparata"
+, title =       "Stable placements of spider robots"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "242--250"
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1767"
+, keywords =    "motion planning, legged robot"
+, precedes =    "bddp-mplrs-95"
+, cites =       "agss-ltacv-89, bddp-mpsr-92, bdp-cu3ct-91, hs-ompc-91, hk-gsftq-91, hnku-agcqw-84, l-knnvd-82, ps-cgi-85, -sill-84, -sill-90, s-ksacs-91, ZZZ"
+, update =      "99.07 devillers, 97.11 bibrelex, 95.09 devillers, 95.01 devillers"
 }
 
 @inproceedings{bdl-srhdr-94c
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
-, title =	"From Spider Robots to Half-Disk Robots"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"62--63"
-, precedes =	"bdl-mplr-00"
-, update =	"01.11 devillers, 01.07 devillers, 00.11 smid, 00.07 icking"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
+, title =       "From Spider Robots to Half-Disk Robots"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "62--63"
+, precedes =    "bdl-mplr-00"
+, update =      "01.11 devillers, 01.07 devillers, 00.11 smid, 00.07 icking"
 }
 
 @inproceedings{bdl-srhdr-94
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
-, title =	"From Spider Robots to Half Disks Robots"
-, booktitle =	"Proc. 11th IEEE Internat. Conf. Robot. Autom."
-, year =	1994
-, pages =	"953--958"
-, succeeds =	"bdl-srhdr-94c"
-, precedes =	"bdl-mplr-00"
-, update =	"01.11 devillers, 00.11 smid, 00.07 icking, 99.07 devillers"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
+, title =       "From Spider Robots to Half Disks Robots"
+, booktitle =   "Proc. 11th IEEE Internat. Conf. Robot. Autom."
+, year =        1994
+, pages =       "953--958"
+, succeeds =    "bdl-srhdr-94c"
+, precedes =    "bdl-mplr-00"
+, update =      "01.11 devillers, 00.11 smid, 00.07 icking, 99.07 devillers"
 }
 
 @inproceedings{bdl-mplr-94
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
-, title =	"Motion Planning of Legged Robots"
-, booktitle =	"Proc. 1st Workshop Algorithmic Found. Robot."
-, publisher =	"A. K. Peters, Boston, MA"
-, year =	1994
-, precedes =	"bdl-mplr-00"
-, update =	"01.11 devillers, 00.11 smid, 00.07 icking, 99.07 devillers"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
+, title =       "Motion Planning of Legged Robots"
+, booktitle =   "Proc. 1st Workshop Algorithmic Found. Robot."
+, publisher =   "A. K. Peters, Boston, MA"
+, year =        1994
+, precedes =    "bdl-mplr-00"
+, update =      "01.11 devillers, 00.11 smid, 00.07 icking, 99.07 devillers"
 }
 
 @article{bdl-mplr-00
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
-, title =	"Motion Planning of Legged Robots"
-, journal =	"SIAM J. Comput."
-, volume =	30
-, year =	2000
-, pages =	"218--246"
-, url =	"https://hal.inria.fr/inria-00099289"
-, archive =	"XXX/cs.CG/9909006"
-, succeeds =	"bdl-mplr-94,bdl-srhdr-94,bdl-srhdr-94c"
-, cites =	"bddp-mplrs-95, dd-frspp-90, h-fuenl-89, ks-empac-90, kst-coksm-97, l-ptrmn-96, s-ksacs-91, ss-nempa-87, t-frnns-91"
-, update =	"01.11 devillers"
-, abstract =	"We study the problem of computing the free space $\cal F$ of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body.  The robot is subject to two constraints: each leg has a maximal extension $R$ (accessibility constraint) and the body of the robot must lie above the convex hull of its feet (stability constraint).  Moreover, the robot can only put its feet on some regions, called the foothold regions.  The free space $\cal F$ is the set of positions of the body of the robot such that there exists a set of accessible footholds for which the robot is stable.  We present an efficient algorithm that computes $\cal F$ in $O(n^2\log n)$ time using $O(n^2\alpha(n))$ space for $n$ discrete point footholds where $\alpha(n)$ is an extremely slowly growing function ($\alpha(n)\leq 3$ for any practical value of $n$).  We also present an algorithm for computing $\cal F$ when the foothold regions are pairwise disjoint polygons with $n$ edges in total.  This algorithm computes $\cal F$ in $O(n^2\alpha_8(n)\log n)$ time using $O(n^2\alpha_8(n))$ space ($\alpha_8(n)$ is also an extremely slowly growing function).  These results are close to optimal since $\Omega(n^2)$ is a lower bound for the size of~$\cal F$."
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Sylvain Lazard"
+, title =       "Motion Planning of Legged Robots"
+, journal =     "SIAM J. Comput."
+, volume =      30
+, year =        2000
+, pages =       "218--246"
+, url = "https://inria.hal.science/inria-00099289"
+, archive =     "XXX/cs.CG/9909006"
+, succeeds =    "bdl-mplr-94,bdl-srhdr-94,bdl-srhdr-94c"
+, cites =       "bddp-mplrs-95, dd-frspp-90, h-fuenl-89, ks-empac-90, kst-coksm-97, l-ptrmn-96, s-ksacs-91, ss-nempa-87, t-frnns-91"
+, update =      "01.11 devillers"
+, abstract =    "We study the problem of computing the free space $\cal F$ of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body.  The robot is subject to two constraints: each leg has a maximal extension $R$ (accessibility constraint) and the body of the robot must lie above the convex hull of its feet (stability constraint).  Moreover, the robot can only put its feet on some regions, called the foothold regions.  The free space $\cal F$ is the set of positions of the body of the robot such that there exists a set of accessible footholds for which the robot is stable.  We present an efficient algorithm that computes $\cal F$ in $O(n^2\log n)$ time using $O(n^2\alpha(n))$ space for $n$ discrete point footholds where $\alpha(n)$ is an extremely slowly growing function ($\alpha(n)\leq 3$ for any practical value of $n$).  We also present an algorithm for computing $\cal F$ when the foothold regions are pairwise disjoint polygons with $n$ edges in total.  This algorithm computes $\cal F$ in $O(n^2\alpha_8(n)\log n)$ time using $O(n^2\alpha_8(n))$ space ($\alpha_8(n)$ is also an extremely slowly growing function).  These results are close to optimal since $\Omega(n^2)$ is a lower bound for the size of~$\cal F$."
 }
 
 @techreport{bdp-cu3ct-90
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata"
-, title =	"Computing the Union of 3-colored triangles"
-, type =	"Technical {Report}"
-, number =	1293
-, institution =	"INRIA"
-, address =	"Sophia-Antipolis, France"
-, month =	oct
-, year =	1990
-, precedes =	"bdp-cu3ct-91"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 milone+mitchell"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata"
+, title =       "Computing the Union of 3-colored triangles"
+, type =        "Technical {Report}"
+, number =      1293
+, institution = "INRIA"
+, address =     "Sophia-Antipolis, France"
+, month =       oct
+, year =        1990
+, precedes =    "bdp-cu3ct-91"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 milone+mitchell"
 }
 
 @article{bdp-cu3ct-91
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata"
-, title =	"Computing the union of $3$-colored triangles"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	2
-, year =	1991
-, pages =	"187--196"
-, url =	"https://hal.inria.fr/inria-00167176"
-, keywords =	"convex hull, motion planning, legged robot"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
-, abstract =	"Given is a set $s$ of $n$ points, each colored with one of $k \geq 3$ colours. We say that a triangle defined by three points of $\cal s$ is 3-colored if its vertices have distinct colours.  We prove in this paper that the problem of constructing the boundary of the union $\cal ts$ of all such 3-colored triangles can be done in optimal $O(n \log n)$ time."
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Franco P. Preparata"
+, title =       "Computing the union of $3$-colored triangles"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      2
+, year =        1991
+, pages =       "187--196"
+, url = "https://inria.hal.science/inria-00167176"
+, keywords =    "convex hull, motion planning, legged robot"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, abstract =    "Given is a set $s$ of $n$ points, each colored with one of $k \geq 3$ colours. We say that a triangle defined by three points of $\cal s$ is 3-colored if its vertices have distinct colours.  We prove in this paper that the problem of constructing the boundary of the union $\cal ts$ of all such 3-colored triangles can be done in optimal $O(n \log n)$ time."
 }
 
 @techreport{bdsty-arsol-90
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
-, title =	"Applications of random sampling to on-line algorithms in computational geometry"
-, type =	"Technical {Report}"
-, number =	1285
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, year =	1990
-, succeeds =	"bt-hrodt-86"
-, precedes =	"bdsty-olgag-91i"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 milone+mitchell"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
+, title =       "Applications of random sampling to on-line algorithms in computational geometry"
+, type =        "Technical {Report}"
+, number =      1285
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, year =        1990
+, succeeds =    "bt-hrodt-86"
+, precedes =    "bdsty-olgag-91i"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 milone+mitchell"
 }
 
 @article{bdsty-arsol-92
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
-, title =	"Applications of random sampling to on-line algorithms in computational geometry"
-, journal =	"Discrete Comput. Geom."
-, volume =	8
-, year =	1992
-, pages =	"51--71"
-, url =	"https://hal.inria.fr/inria-00090675"
-, keywords =	"randomized algorithms, Delaunay triangulation, semi-dynamic algorithms, arrangement of line-segments"
-, succeeds =	"bdsty-olgag-91i"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
-, abstract =	"This paper presents a general framework for the design
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
+, title =       "Applications of random sampling to on-line algorithms in computational geometry"
+, journal =     "Discrete Comput. Geom."
+, volume =      8
+, year =        1992
+, pages =       "51--71"
+, url = "https://inria.hal.science/inria-00090675"
+, keywords =    "randomized algorithms, Delaunay triangulation, semi-dynamic algorithms, arrangement of line-segments"
+, succeeds =    "bdsty-olgag-91i"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, abstract =    "This paper presents a general framework for the design
 and randomized analysis of geometric algorithms.  These algorithms are
 on-line and the framework provides general bounds for their expected space
 and time complexities when averaging over all permutations of the input
@@ -24226,63 +24226,63 @@ @article{bdsty-arsol-92
 }
 
 @techreport{bdsty-olgag-90t
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
-, title =	"On-line geometric algorithms with good expected behaviours"
-, type =	"Technical Report"
-, number =	"INRIA 1285"
-, month =	aug
-, year =	1990
-, precedes =	"bdsty-olgag-91i, bdsty-olgag-91a"
-, update =	"99.07 devillers, 98.07 bibrelex"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
+, title =       "On-line geometric algorithms with good expected behaviours"
+, type =        "Technical Report"
+, number =      "INRIA 1285"
+, month =       aug
+, year =        1990
+, precedes =    "bdsty-olgag-91i, bdsty-olgag-91a"
+, update =      "99.07 devillers, 98.07 bibrelex"
 }
 
 @inproceedings{bdsty-olgag-91i
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
-, title =	"On-line geometric algorithms with good expected behaviours"
-, booktitle =	"Proc. 13th World Congress on Computation and Applied Math."
-, year =	1991
-, pages =	"137--139"
-, succeeds =	"bdsty-arsol-90"
-, precedes =	"bdsty-arsol-92"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
+, title =       "On-line geometric algorithms with good expected behaviours"
+, booktitle =   "Proc. 13th World Congress on Computation and Applied Math."
+, year =        1991
+, pages =       "137--139"
+, succeeds =    "bdsty-arsol-90"
+, precedes =    "bdsty-arsol-92"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
 }
 
 @article{bdsty-olgag-91a
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
-, title =	"On-line geometric algorithms with good expected behaviours"
-, journal =	"IMACS"
-, volume =	"??"
-, year =	1991
-, succeeds =	"bdsty-olgag-90t"
-, update =	"99.07 devillers, 98.07 bibrelex"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec"
+, title =       "On-line geometric algorithms with good expected behaviours"
+, journal =     "IMACS"
+, volume =      "??"
+, year =        1991
+, succeeds =    "bdsty-olgag-90t"
+, update =      "99.07 devillers, 98.07 bibrelex"
 }
 
 @techreport{bdt-dchov-90
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud"
-, title =	"A dynamic construction of higher-order {Voronoi} diagrams and its randomized analysis"
-, type =	"Technical {Report}"
-, number =	1207
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, year =	1990
-, keywords =	"randomized algorithms, higher order Voronoi diagrams, dynamic algorithms"
-, succeeds =	"bdt-olcho-90, bt-hrodt-86"
-, precedes =	"bdt-schov-93"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers+milone+mitchell"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud"
+, title =       "A dynamic construction of higher-order {Voronoi} diagrams and its randomized analysis"
+, type =        "Technical {Report}"
+, number =      1207
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, year =        1990
+, keywords =    "randomized algorithms, higher order Voronoi diagrams, dynamic algorithms"
+, succeeds =    "bdt-olcho-90, bt-hrodt-86"
+, precedes =    "bdt-schov-93"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers+milone+mitchell"
 }
 
 @article{bdt-schov-93
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud"
-, title =	"A semidynamic construction of higher-order {Voronoi} diagrams and its randomized analysis"
-, journal =	"Algorithmica"
-, volume =	9
-, year =	1993
-, pages =	"329--356"
-, url =	"https://hal.inria.fr/inria-00090668"
-, keywords =	"randomized algorithms, higher order Voronoi diagrams, dynamic algorithms"
-, succeeds =	"bdt-olcho-90"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers+schwarzkopf, 96.05 agarwal, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
-, abstract =	"The $k$-Delaunay tree extends the Delaunay tree
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud"
+, title =       "A semidynamic construction of higher-order {Voronoi} diagrams and its randomized analysis"
+, journal =     "Algorithmica"
+, volume =      9
+, year =        1993
+, pages =       "329--356"
+, url = "https://inria.hal.science/inria-00090668"
+, keywords =    "randomized algorithms, higher order Voronoi diagrams, dynamic algorithms"
+, succeeds =    "bdt-olcho-90"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers+schwarzkopf, 96.05 agarwal, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
+, abstract =    "The $k$-Delaunay tree extends the Delaunay tree
 introduced in \cite{bt-rcdt-93}.  It is a hierarchical data structure that
 allows the semi-dynamic construction of the higher order Voronoi diagrams
 of a finite set of $n$ points in any dimension.  In this paper, we prove
@@ -24294,26 +24294,26 @@ @article{bdt-schov-93
 }
 
 @inproceedings{bdt-olcho-90
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud"
-, title =	"An on-line construction of higher-order {Voronoi} diagrams and its randomized analysis"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"278--281"
-, comments =	"to appear in Algorithmica"
-, precedes =	"bdt-schov-93"
-, cites =	"agss-ltacv-89, bdsty-arsol-90, bdt-dchov-90, bt-hrodt-86, bt-rcdt-89, ce-iacko-85, c-narsc-87, cs-arscg-89, d-hdvdl-89, eos-calha-86, gks-ricdv-90, gs-cdtp-78, l-knnvd-82, mmo-cavd-90, m-lavd-91, m-orfv-89, sh-cpp-75, ZZZ"
-, update =	"99.11 bibrelex, 99.07 bibrelex+devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud"
+, title =       "An on-line construction of higher-order {Voronoi} diagrams and its randomized analysis"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "278--281"
+, comments =    "to appear in Algorithmica"
+, precedes =    "bdt-schov-93"
+, cites =       "agss-ltacv-89, bdsty-arsol-90, bdt-dchov-90, bt-hrodt-86, bt-rcdt-89, ce-iacko-85, c-narsc-87, cs-arscg-89, d-hdvdl-89, eos-calha-86, gks-ricdv-90, gs-cdtp-78, l-knnvd-82, mmo-cavd-90, m-lavd-91, m-orfv-89, sh-cpp-75, ZZZ"
+, update =      "99.11 bibrelex, 99.07 bibrelex+devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
 }
 
 @inproceedings{bdty-tcgal-00
-, author =	"Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud and Mariette Yvinec"
-, title =	"Triangulations in {CGAL}"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"11--18"
-, cites =	"bdh-qach-96, bd-asmbh-94, by-ag-98, b-rgsdd-93, bbp-iayed-98scg, cd-fsgr-00, boo-stswe-96, 9d-iirdt-98, dlpt-ccpps-98, fhhn-dipmc-99, gb-tdmae-97, g-ggmpa-96, gs-pmgsc-85, hkw-gapi2-99, k-ugpddsp-99, l-ndgcm-94, msz-frplw-96, m-rmstd-91, p-iaeia-99, ps-cgi-85, s-te2dq-96, s-rafpg-96, s-cgehdcd-98, v-gpccg-97"
-, update =	"01.07 devillers, 00.11 smid, 00.07 devillers"
-, abstract =	"This  paper
+, author =      "Jean-Daniel Boissonnat and Olivier Devillers and Monique Teillaud and Mariette Yvinec"
+, title =       "Triangulations in {CGAL}"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "11--18"
+, cites =       "bdh-qach-96, bd-asmbh-94, by-ag-98, b-rgsdd-93, bbp-iayed-98scg, cd-fsgr-00, boo-stswe-96, 9d-iirdt-98, dlpt-ccpps-98, fhhn-dipmc-99, gb-tdmae-97, g-ggmpa-96, gs-pmgsc-85, hkw-gapi2-99, k-ugpddsp-99, l-ndgcm-94, msz-frplw-96, m-rmstd-91, p-iaeia-99, ps-cgi-85, s-te2dq-96, s-rafpg-96, s-cgehdcd-98, v-gpccg-97"
+, update =      "01.07 devillers, 00.11 smid, 00.07 devillers"
+, abstract =    "This  paper
 presents  the main algorithmic and design choices that have been
 made
 to implement triangulations in
@@ -24321,183 +24321,183 @@ @inproceedings{bdty-tcgal-00
 }
 
 @article{bd-olcue-96
-, author =	"Jean-Daniel Boissonnat and Katrin Dobrindt"
-, title =	"On-line construction of the upper envelope of triangles and surface patches in three dimensions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1996
-, pages =	"303--320"
-, update =	"99.07 devillers, 98.07 agarwal, 98.03 agarwal, 96.05 smid"
+, author =      "Jean-Daniel Boissonnat and Katrin Dobrindt"
+, title =       "On-line construction of the upper envelope of triangles and surface patches in three dimensions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1996
+, pages =       "303--320"
+, update =      "99.07 devillers, 98.07 agarwal, 98.03 agarwal, 96.05 smid"
 }
 
 @techreport{bd-olrcu-93
-, author =	"Jean-Daniel Boissonnat and Katrin Dobrindt"
-, title =	"On-line randomized construction of the upper envelope of triangles and surface patches in {$R^{3}$}"
-, type =	"Manuscript"
-, number =	"Tech. Rep. 1878"
-, institution =	"INRIA, Sophia-Antipolis, France"
-, year =	1993
-, update =	"99.07 devillers, 98.07 agarwal, 98.03 bibrelex"
+, author =      "Jean-Daniel Boissonnat and Katrin Dobrindt"
+, title =       "On-line randomized construction of the upper envelope of triangles and surface patches in {$R^{3}$}"
+, type =        "Manuscript"
+, number =      "Tech. Rep. 1878"
+, institution = "INRIA, Sophia-Antipolis, France"
+, year =        1993
+, update =      "99.07 devillers, 98.07 agarwal, 98.03 bibrelex"
 }
 
 @inproceedings{bd-rcuet-92
-, author =	"Jean-Daniel Boissonnat and Katrin Dobrindt"
-, title =	"Randomized construction of the upper envelope of triangles in {$R^3$}"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"311--315"
-, cites =	"bdsty-arsol-92, cs-arscg-89, d-rysoa-92, e-ueplf-89, e-ueplf-89, m-eahsr-89, m-orfv-89, ps-ueplf-89, ss-tddsp-90, s-sfira-91, ZZZ"
-, update =	"99.07 devillers, 98.07 agarwal+bibrelex"
+, author =      "Jean-Daniel Boissonnat and Katrin Dobrindt"
+, title =       "Randomized construction of the upper envelope of triangles in {$R^3$}"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "311--315"
+, cites =       "bdsty-arsol-92, cs-arscg-89, d-rysoa-92, e-ueplf-89, e-ueplf-89, m-eahsr-89, m-orfv-89, ps-ueplf-89, ss-tddsp-90, s-sfira-91, ZZZ"
+, update =      "99.07 devillers, 98.07 agarwal+bibrelex"
 }
 
 @inproceedings{bdgm-gmpmr-95
-, author =	"Jean-Daniel Boissonnat and Katrin Dobrindt and Bernhard Geiger and Henri Michel"
-, title =	"A Global Motion Planner for a Mobile Robot on a Terrain"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C20--C21"
-, keywords =	""
-, cites =	"bg-tdrcs-93, w-pdtpu-93, egs-ueplf-89, l-rmp-91, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Jean-Daniel Boissonnat and Katrin Dobrindt and Bernhard Geiger and Henri Michel"
+, title =       "A Global Motion Planner for a Mobile Robot on a Terrain"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C20--C21"
+, keywords =    ""
+, cites =       "bg-tdrcs-93, w-pdtpu-93, egs-ueplf-89, l-rmp-91, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{bf-t3do-81
-, author =	"J.-D. Boissonnat and O. D. Faugeras"
-, title =	"Triangulation of $3$-d objects"
-, booktitle =	"Proc. 7th Internat. Joint Conf. Artif. Intell."
-, year =	1981
-, pages =	"658--660"
+, author =      "J.-D. Boissonnat and O. D. Faugeras"
+, title =       "Triangulation of $3$-d objects"
+, booktitle =   "Proc. 7th Internat. Joint Conf. Artif. Intell."
+, year =        1981
+, pages =       "658--660"
 }
 
 @techreport{bfl-rsddt-88t
-, author =	"J. D. Boissonnat and O. D. Faugeras and E. {Le Bras-Mehlman}"
-, title =	"Representing stereo data with the {Delaunay} triangulation"
-, type =	"Technical Report"
-, number =	788
-, institution =	"INRIA"
-, address =	"Domaine de Voluceau Rocquencourt, BP 105, 78153 Le Chesnay Cedex, France"
-, month =	feb
-, year =	1988
-, precedes =	"flb-rsddt-90, bfl-rsddt-88i"
-, update =	"98.07 bibrelex"
+, author =      "J. D. Boissonnat and O. D. Faugeras and E. {Le Bras-Mehlman}"
+, title =       "Representing stereo data with the {Delaunay} triangulation"
+, type =        "Technical Report"
+, number =      788
+, institution = "INRIA"
+, address =     "Domaine de Voluceau Rocquencourt, BP 105, 78153 Le Chesnay Cedex, France"
+, month =       feb
+, year =        1988
+, precedes =    "flb-rsddt-90, bfl-rsddt-88i"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bfl-rsddt-88i
-, author =	"J. D. Boissonnat and O. D. Faugeras and E. {Le Bras-Mehlman}"
-, title =	"Representing stereo data with the {Delaunay} triangulation"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Robot. Autom."
-, year =	1988
-, pages =	"24--29"
-, succeeds =	"bfl-rsddt-88t"
-, precedes =	"flb-rsddt-90"
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "J. D. Boissonnat and O. D. Faugeras and E. {Le Bras-Mehlman}"
+, title =       "Representing stereo data with the {Delaunay} triangulation"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Robot. Autom."
+, year =        1988
+, pages =       "24--29"
+, succeeds =    "bfl-rsddt-88t"
+, precedes =    "flb-rsddt-90"
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{bf-lcss-02
-, author =	"Jean-Daniel Boissonnat and Julia Fl{\"o}totto"
-, title =	"A local coordinate system on a surface"
-, booktitle =	"Proc. 7th ACM Symposium on Solid Modeling and Applications"
-, year =	2002
-, pages =	""
-, update =	"02.03 devillers"
+, author =      "Jean-Daniel Boissonnat and Julia Fl{\"o}totto"
+, title =       "A local coordinate system on a surface"
+, booktitle =   "Proc. 7th ACM Symposium on Solid Modeling and Applications"
+, year =        2002
+, pages =       ""
+, update =      "02.03 devillers"
 }
 
 @inproceedings{bg-3dsd-93
-, author =	"Jean-Daniel Boissonnat and Bernhard Geiger"
-, title =	"3D simulation of delivery"
-, editor =	"G. M. Nielson and D. Bergeron"
-, booktitle =	"Visualization 93"
-, publisher =	"IEEE Computer Society Press"
-, address =	"San Jose CA"
-, year =	1993
-, pages =	"416--419"
-, update =	"99.07 devillers, 94.05 devillers"
+, author =      "Jean-Daniel Boissonnat and Bernhard Geiger"
+, title =       "3D simulation of delivery"
+, editor =      "G. M. Nielson and D. Bergeron"
+, booktitle =   "Visualization 93"
+, publisher =   "IEEE Computer Society Press"
+, address =     "San Jose CA"
+, year =        1993
+, pages =       "416--419"
+, update =      "99.07 devillers, 94.05 devillers"
 }
 
 @techreport{bg-tdrcs-92
-, author =	"Jean-Daniel Boissonnat and Bernhard Geiger"
-, title =	"Three-dimensional reconstruction of complex shapes based on the {Delaunay} triangulation"
-, type =	"Report"
-, number =	1697
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, month =	apr
-, year =	1992
-, url =	"https://www-sop.inria.fr/cgi-bin/wais_ra_sophia?question=1697"
-, keywords =	"shape reconstruction, medical images, Delaunay triangulation"
-, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 93.09 held"
+, author =      "Jean-Daniel Boissonnat and Bernhard Geiger"
+, title =       "Three-dimensional reconstruction of complex shapes based on the {Delaunay} triangulation"
+, type =        "Report"
+, number =      1697
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, month =       apr
+, year =        1992
+, url = "https://www-sop.inria.fr/cgi-bin/wais_ra_sophia?question=1697"
+, keywords =    "shape reconstruction, medical images, Delaunay triangulation"
+, update =      "99.07 devillers, 95.09 devillers, 95.01 devillers, 93.09 held"
 }
 
 @inproceedings{bg-tdrcs-93
-, author =	"Jean-Daniel Boissonnat and Bernhard Geiger"
-, title =	"Three dimensional reconstruction of complex shapes based on the {Delaunay} triangulation"
-, editor =	"R. S. Acharya and D. B. Goldgof"
-, booktitle =	"Biomedical Image Processing and Biomedical Visualization"
-, volume =	1905
-, publisher =	"SPIE"
-, year =	1993
-, pages =	"964--975"
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1697"
-, succeeds =	"bg-tdrcs-92"
-, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
+, author =      "Jean-Daniel Boissonnat and Bernhard Geiger"
+, title =       "Three dimensional reconstruction of complex shapes based on the {Delaunay} triangulation"
+, editor =      "R. S. Acharya and D. B. Goldgof"
+, booktitle =   "Biomedical Image Processing and Biomedical Visualization"
+, volume =      1905
+, publisher =   "SPIE"
+, year =        1993
+, pages =       "964--975"
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1697"
+, succeeds =    "bg-tdrcs-92"
+, update =      "99.07 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
 }
 
 @inproceedings{bk-udtil-85
-, author =	"J.-D. Boissonnat and P. Kofakis"
-, title =	"Use of the {Delaunay} Triangulation for the Identification and the Localization of Objects"
-, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
-, year =	1985
-, pages =	"398--401"
-, annote =	"Uses skeleton of object foe rep. Computes
-		 approximation of the skeleton by connecting centres of
-		 adjacent triangles in DT."
+, author =      "J.-D. Boissonnat and P. Kofakis"
+, title =       "Use of the {Delaunay} Triangulation for the Identification and the Localization of Objects"
+, booktitle =   "Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
+, year =        1985
+, pages =       "398--401"
+, annote =      "Uses skeleton of object foe rep. Computes
+                 approximation of the skeleton by connecting centres of
+                 adjacent triangles in DT."
 }
 
 @inproceedings{blt-mosal-97
-, author =	"Jean-Daniel Boissonnat and Eelco de Lange and Monique Teillaud"
-, title =	"Minkowski operations for satellite antenna layout"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"67--76"
-, url =	"https://hal.inria.fr/inria-00073622z"
-, precedes =	"blt-smssa-98"
-, cites =	"ab-scsp-87, ab-pptr-89, abdpy-esdus-97, bdh-qach-93, dm-mtcae-95, gs-ccrs-87, lm-cancp-93, l-spcsa-83, ZZZ"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex+devillers, 97.07 efrat"
+, author =      "Jean-Daniel Boissonnat and Eelco de Lange and Monique Teillaud"
+, title =       "Minkowski operations for satellite antenna layout"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "67--76"
+, url = "https://inria.hal.science/inria-00073622z"
+, precedes =    "blt-smssa-98"
+, cites =       "ab-scsp-87, ab-pptr-89, abdpy-esdus-97, bdh-qach-93, dm-mtcae-95, gs-ccrs-87, lm-cancp-93, l-spcsa-83, ZZZ"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 bibrelex+devillers, 97.07 efrat"
 }
 
 @article{blt-smssa-98
-, author =	"Jean-Daniel Boissonnat and Eelco de Lange and Monique Teillaud"
-, title =	"Slicing {Minkowski} Sums for Satellite Antenna Layout"
-, journal =	"Comput. Aided Design"
-, volume =	30
-, number =	4
-, year =	1998
-, pages =	"255--265"
-, note =	"Special Issue on Computational Geometry and Computer-Aided Design and Manufacturing"
-, succeeds =	"blt-mosal-97"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers+held"
+, author =      "Jean-Daniel Boissonnat and Eelco de Lange and Monique Teillaud"
+, title =       "Slicing {Minkowski} Sums for Satellite Antenna Layout"
+, journal =     "Comput. Aided Design"
+, volume =      30
+, number =      4
+, year =        1998
+, pages =       "255--265"
+, note =        "Special Issue on Computational Geometry and Computer-Aided Design and Manufacturing"
+, succeeds =    "blt-mosal-97"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 devillers+held"
 }
 
 @proceedings{bl-gr-89
-, title =	"Proc. of the Workshop on Geometry and Robotics"
-, editor =	"J.-D. Boissonnat and J.-P. Laumond"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	391
-, publisher =	"Springer-Verlag"
-, year =	1989
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, title =       "Proc. of the Workshop on Geometry and Robotics"
+, editor =      "J.-D. Boissonnat and J.-P. Laumond"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      391
+, publisher =   "Springer-Verlag"
+, year =        1989
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{bl-ptacs-96
-, author =	"Jean-Daniel Boissonnat and Sylvain Lazard"
-, title =	"A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"242--251"
-, keywords =	"Non-holonomic robot, motion planning, shortest paths, mobile robot, computational geometry"
-, cites =	"art-mpscr-95, bl-nmrom-89, bl-nmbmr-93, bbf-fmg-86, bb-arcto-94, bcl-spbcp-94, bsbl-spsdn-94, cs-arscg-89, ds-cgcw-90, d-cmlca-57, fw-pcm-88, jc-pspmr-89, jlt-empnm-91, klps-ujrcf-86, l-fppcl-91, l-rmp-91, l-fcfst-87, ljtm-mpnmr-94, lc-nmp-92, nm-nppa-89, rs-opctg-90, st-sprsc-91, wa-aaccs-96, w-mpav-88, w-spav-89, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex, 96.05 efrat"
-, abstract =	"
+, author =      "Jean-Daniel Boissonnat and Sylvain Lazard"
+, title =       "A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "242--251"
+, keywords =    "Non-holonomic robot, motion planning, shortest paths, mobile robot, computational geometry"
+, cites =       "art-mpscr-95, bl-nmrom-89, bl-nmbmr-93, bbf-fmg-86, bb-arcto-94, bcl-spbcp-94, bsbl-spsdn-94, cs-arscg-89, ds-cgcw-90, d-cmlca-57, fw-pcm-88, jc-pspmr-89, jlt-empnm-91, klps-ujrcf-86, l-fppcl-91, l-rmp-91, l-fcfst-87, ljtm-mpnmr-94, lc-nmp-92, nm-nppa-89, rs-opctg-90, st-sprsc-91, wa-aaccs-96, w-mpav-88, w-spav-89, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex, 96.05 efrat"
+, abstract =    "
 In this paper, we consider the problem of computing a shortest path of
 bounded curvature amidst obstacles in the plane. More precisely, given
 prescribed initial and final configurations (i.e.  positions and
@@ -24510,2940 +24510,2940 @@ @inproceedings{bl-ptacs-96
 }
 
 @inproceedings{bl-chbc-96
-, author =	"Jean-Daniel Boissonnat and Sylvain Lazard"
-, title =	"Convex hulls of bounded curvature"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"14--19"
-, update =	"99.07 devillers, 97.03 agarwal, 96.09 mitchell"
+, author =      "Jean-Daniel Boissonnat and Sylvain Lazard"
+, title =       "Convex hulls of bounded curvature"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "14--19"
+, update =      "99.07 devillers, 97.03 agarwal, 96.09 mitchell"
 }
 
 @techreport{bp-rpsis-97
-, author =	"Jean-Daniel Boissonnat and Franco P. Preparata"
-, title =	"Robust Plane Sweep for Intersecting Segments"
-, type =	"Research {Report}"
-, number =	3270
-, institution =	"INRIA"
-, address =	"Sophia Antipolis"
-, month =	sep
-, year =	1997
-, update =	"99.11 devillers, 99.07 devillers, 98.11 ghali"
+, author =      "Jean-Daniel Boissonnat and Franco P. Preparata"
+, title =       "Robust Plane Sweep for Intersecting Segments"
+, type =        "Research {Report}"
+, number =      3270
+, institution = "INRIA"
+, address =     "Sophia Antipolis"
+, month =       sep
+, year =        1997
+, update =      "99.11 devillers, 99.07 devillers, 98.11 ghali"
 }
 
 @article{bp-rpsis-00
-, author =	"J.-D. Boissonnat and F. P. Preparata"
-, title =	"Robust Plane Sweep for Intersecting Segments"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, number =	5
-, year =	2000
-, pages =	"1401--1421"
-, update =	"00.11 smid, 00.07 vismara, 99.07 devillers, 98.11 tamassia"
+, author =      "J.-D. Boissonnat and F. P. Preparata"
+, title =       "Robust Plane Sweep for Intersecting Segments"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, number =      5
+, year =        2000
+, pages =       "1401--1421"
+, update =      "00.11 smid, 00.07 vismara, 99.07 devillers, 98.11 tamassia"
 }
 
 @inproceedings{bsty-vdhdc-95
-, author =	"Jean-Daniel Boissonnat and Micha Sharir and Boaz Tagansky and Mariette Yvinec"
-, title =	"Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"79--88"
-, keywords =	""
-, precedes =	"bsty-vdhdc-98"
-, cites =	"a-vdsfg-91, ckstw-vdl3s-95, cs-arscg-89, e-acg-87, es-vda-86, hs-nblet-94, klps-ujrcf-86, ls-ippvd-87, m-cgitr-93, o-cgc-94, ps-cgi-85, s-atubl-94, t-ntasa-95, ZZZ"
-, update =	"98.07 devillers, 98.03 bibrelex, 95.09 mitchell"
-}
-
-% also claimed, pages =	"485--519"
+, author =      "Jean-Daniel Boissonnat and Micha Sharir and Boaz Tagansky and Mariette Yvinec"
+, title =       "Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "79--88"
+, keywords =    ""
+, precedes =    "bsty-vdhdc-98"
+, cites =       "a-vdsfg-91, ckstw-vdl3s-95, cs-arscg-89, e-acg-87, es-vda-86, hs-nblet-94, klps-ujrcf-86, ls-ippvd-87, m-cgitr-93, o-cgc-94, ps-cgi-85, s-atubl-94, t-ntasa-95, ZZZ"
+, update =      "98.07 devillers, 98.03 bibrelex, 95.09 mitchell"
+}
+
+% also claimed, pages = "485--519"
 @article{bsty-vdhdc-98
-, author =	"Jean-Daniel Boissonnat and Micha Sharir and Boaz Tagansky and Mariette Yvinec"
-, title =	"Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, number =	4
-, year =	1998
-, pages =	"473--484"
-, succeeds =	"bsty-vdhdc-95"
-, update =	"99.07 devillers, 98.07 devillers+held"
+, author =      "Jean-Daniel Boissonnat and Micha Sharir and Boaz Tagansky and Mariette Yvinec"
+, title =       "Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, number =      4
+, year =        1998
+, pages =       "473--484"
+, succeeds =    "bsty-vdhdc-95"
+, update =      "99.07 devillers, 98.07 devillers+held"
 }
 
 % also claimed,  title =       "Line and curve segment intersection with restricted predicates"
 @inproceedings{bs-ealcs-99
-, author =	"J.-D. Boissonnat and J. Snoeyink"
-, title =	"Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"370--379"
-, precedes =	"bs-ealcs-00"
-, update =	"01.07 devillers, 99.07 devillers+vismara"
+, author =      "J.-D. Boissonnat and J. Snoeyink"
+, title =       "Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "370--379"
+, precedes =    "bs-ealcs-00"
+, update =      "01.07 devillers, 99.07 devillers+vismara"
 }
 
 @article{bs-ealcs-00
-, author =	"J.-D. Boissonnat and J. Snoeyink"
-, title =	"Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	16
-, number =	1
-, year =	2000
-, pages =	"35--52"
-, succeeds =	"bs-ealcs-99"
-, update =	"01.07 devillers, 00.11 smid, 00.07 vismara"
-, annote =	"Special Issue on the 1998 Workshop on Computational Geometry"
+, author =      "J.-D. Boissonnat and J. Snoeyink"
+, title =       "Efficient Algorithms for Line and Curve Segment Intersection Using Restricted Predicates"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      16
+, number =      1
+, year =        2000
+, pages =       "35--52"
+, succeeds =    "bs-ealcs-99"
+, update =      "01.07 devillers, 00.11 smid, 00.07 vismara"
+, annote =      "Special Issue on the 1998 Workshop on Computational Geometry"
 }
 
 @inproceedings{bt-hrodt-86
-, author =	"Jean-Daniel Boissonnat and Monique Teillaud"
-, title =	"A hierarchical representation of objects: {The} {Delaunay} tree"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"260--268"
-, precedes =	"bt-rcdt-89, bdt-dchov-90, bdsty-arsol-90"
-, cites =	"b-asmra-86, aes-solac-85, aeiim-pubtc-85, b-sthrc-81, b-gstds-84, b-srpcs-88, b-cdt-81, cg-vippg-85, dk-fdpi-83, es-vda-85, f-sdpvd-83, g-rssc-62, gs-cdtp-78, gs-pmgsc-85, k-osps-83, k-cddvd-80, ls-tacdt-80, m-iaeln-53, m-hpppp-70, ob-dtdos-79, ps-cgi-85, r-pc-64, s-qrhds-84, t-prgc-80, ZZZ"
-, update =	"99.07 devillers, 98.03 bibrelex, 93.09 milone+mitchell"
+, author =      "Jean-Daniel Boissonnat and Monique Teillaud"
+, title =       "A hierarchical representation of objects: {The} {Delaunay} tree"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "260--268"
+, precedes =    "bt-rcdt-89, bdt-dchov-90, bdsty-arsol-90"
+, cites =       "b-asmra-86, aes-solac-85, aeiim-pubtc-85, b-sthrc-81, b-gstds-84, b-srpcs-88, b-cdt-81, cg-vippg-85, dk-fdpi-83, es-vda-85, f-sdpvd-83, g-rssc-62, gs-cdtp-78, gs-pmgsc-85, k-osps-83, k-cddvd-80, ls-tacdt-80, m-iaeln-53, m-hpppp-70, ob-dtdos-79, ps-cgi-85, r-pc-64, s-qrhds-84, t-prgc-80, ZZZ"
+, update =      "99.07 devillers, 98.03 bibrelex, 93.09 milone+mitchell"
 }
 
 @techreport{bt-rcdt-89
-, author =	"Jean-Daniel Boissonnat and Monique Teillaud"
-, title =	"On the randomized construction of the {Delaunay} tree"
-, type =	"Technical {Report}"
-, number =	1140
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, year =	1989
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1140"
-, keywords =	"randomized algorithms, Delaunay triangulation, semi-dynamic algorithms"
-, succeeds =	"bt-hrodt-86"
-, precedes =	"bt-rcdt-93"
-, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
+, author =      "Jean-Daniel Boissonnat and Monique Teillaud"
+, title =       "On the randomized construction of the {Delaunay} tree"
+, type =        "Technical {Report}"
+, number =      1140
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, year =        1989
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1140"
+, keywords =    "randomized algorithms, Delaunay triangulation, semi-dynamic algorithms"
+, succeeds =    "bt-hrodt-86"
+, precedes =    "bt-rcdt-93"
+, update =      "99.07 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
 }
 
 @article{bt-rcdt-93
-, author =	"Jean-Daniel Boissonnat and Monique Teillaud"
-, title =	"On the randomized construction of the {Delaunay} tree"
-, journal =	"Theoret. Comput. Sci."
-, volume =	112
-, year =	1993
-, pages =	"339--354"
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1140"
-, keywords =	"randomized algorithms, Delaunay triangulation, semi-dynamic algorithms"
-, succeeds =	"bt-rcdt-89"
-, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
+, author =      "Jean-Daniel Boissonnat and Monique Teillaud"
+, title =       "On the randomized construction of the {Delaunay} tree"
+, journal =     "Theoret. Comput. Sci."
+, volume =      112
+, year =        1993
+, pages =       "339--354"
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1140"
+, keywords =    "randomized algorithms, Delaunay triangulation, semi-dynamic algorithms"
+, succeeds =    "bt-rcdt-89"
+, update =      "99.07 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
 }
 
 @techreport{bv-earic-99
-, author =	"Jean-Daniel Boissonnat and Antoine Vigneron"
-, title =	"Elementary Algorithms for Reporting Intersections of Curve Segments"
-, type =	"Rapport de recherche"
-, number =	3825
-, institution =	"INRIA"
-, year =	1999
-, cites =	"b-oafsi-95, bo-arcgi-79, bs-ealcs-99, bp-rpsis-, c-stsar-94, ce-oails-92, cs-arscg-89, afl-rracg-98, k-ah-92, lpt-rpqid-99, p-iaeia-99, ps-cgi-90, s-ri-99, y-tegc-97, y-rgc-97"
-, update =	"00.03 devillers"
-, abstract =	"We propose several
+, author =      "Jean-Daniel Boissonnat and Antoine Vigneron"
+, title =       "Elementary Algorithms for Reporting Intersections of Curve Segments"
+, type =        "Rapport de recherche"
+, number =      3825
+, institution = "INRIA"
+, year =        1999
+, cites =       "b-oafsi-95, bo-arcgi-79, bs-ealcs-99, bp-rpsis-, c-stsar-94, ce-oails-92, cs-arscg-89, afl-rracg-98, k-ah-92, lpt-rpqid-99, p-iaeia-99, ps-cgi-90, s-ri-99, y-tegc-97, y-rgc-97"
+, update =      "00.03 devillers"
+, abstract =    "We propose several
  algorithms to report the $k$ intersecting pairs among a set of $n$ curve segments. Apart from the intersection predicate, our algorithms only use two simple predicates: the predicate that compares the coordinates of two points and the predicate that says if a point is below, on, or above a segment. In particular, the predicates we use do not allow to count the number of intersection points nor to sort them, and the time complexity of our algorithms depends on the number of intersecting pairs, not on the number of intersection points (differently from the other non trivial algorithms). We present an algorithm for the red-blue variant of the problem where we have a set of blue segments and a set of red segments so that no two segments of the same set intersect. The time complexity is $O((n+k)\log n)$. This algorithm is then used to solve the general case in $O(n\sqrt{k}\log n)$ time. In the case of pseudo-segments (i.e. segments that intersect in at most one point) we propose a better algorithm whose time complexity is $O((k+n)\log n+ n\sqrt k)$. All our time complexity results are a log factor from optimal."
 }
 
 @article{bv-earic-02
-, author =	"Jean-Daniel Boissonnat and Antoine Vigneron"
-, title =	"Elementary Algorithms for Reporting Intersections of Curve Segments"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	21
-, year =	2002
-, pages =	"167--175"
-, update =	"02.03 devillers"
+, author =      "Jean-Daniel Boissonnat and Antoine Vigneron"
+, title =       "Elementary Algorithms for Reporting Intersections of Curve Segments"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      21
+, year =        2002
+, pages =       "167--175"
+, update =      "02.03 devillers"
 }
 
 @book{by-ag-98
-, author =	"Jean-Daniel Boissonnat and Mariette Yvinec"
-, title =	"Algorithmic Geometry"
-, publisher =	"Cambridge University Press"
-, address =	"UK"
-, year =	1998
-, note =	"Translated by Herv{\'e} Br{\"o}nnimann"
-, succeeds =	"by-ga-95"
-, update =	"99.11 devillers, 99.07 devillers, 99.03 bibrelex+devillers, 98.07 devillers"
-, annote =	"translated from {\cite{by-ga-95}} by Herv{\'e}  Br{\"o}nnimann"
+, author =      "Jean-Daniel Boissonnat and Mariette Yvinec"
+, title =       "Algorithmic Geometry"
+, publisher =   "Cambridge University Press"
+, address =     "UK"
+, year =        1998
+, note =        "Translated by Herv{\'e} Br{\"o}nnimann"
+, succeeds =    "by-ga-95"
+, update =      "99.11 devillers, 99.07 devillers, 99.03 bibrelex+devillers, 98.07 devillers"
+, annote =      "translated from {\cite{by-ga-95}} by Herv{\'e}  Br{\"o}nnimann"
 }
 
 @book{by-ga-95
-, author =	"Jean-Daniel Boissonnat and Mariette Yvinec"
-, title =	"G{\'e}om{\'e}trie Algorithmique"
-, publisher =	"Ediscience international"
-, address =	"Paris"
-, year =	1995
-, precedes =	"by-ag-98"
-, update =	"99.07 devillers, 99.03 bibrelex, 98.07 devillers, 96.01 devillers"
+, author =      "Jean-Daniel Boissonnat and Mariette Yvinec"
+, title =       "G{\'e}om{\'e}trie Algorithmique"
+, publisher =   "Ediscience international"
+, address =     "Paris"
+, year =        1995
+, precedes =    "by-ag-98"
+, update =      "99.07 devillers, 99.03 bibrelex, 98.07 devillers, 96.01 devillers"
 }
 
 @inproceedings{by-psncp-89
-, author =	"Jean-Daniel Boissonnat and Mariette Yvinec"
-, title =	"Probing a scene of non-convex polyhedra"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"237--246"
-, precedes =	"by-psncp-92"
-, cites =	"aby-ooacr-87, aby-pncp-89, b-dscns-86, cy-sp-87, dey-pcp-86, m-dsa-84, s-gp-88, ZZZ"
-, update =	"99.07 devillers, 98.03 bibrelex"
+, author =      "Jean-Daniel Boissonnat and Mariette Yvinec"
+, title =       "Probing a scene of non-convex polyhedra"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "237--246"
+, precedes =    "by-psncp-92"
+, cites =       "aby-ooacr-87, aby-pncp-89, b-dscns-86, cy-sp-87, dey-pcp-86, m-dsa-84, s-gp-88, ZZZ"
+, update =      "99.07 devillers, 98.03 bibrelex"
 }
 
 @article{by-psncp-92
-, author =	"Jean-Daniel Boissonnat and Mariette Yvinec"
-, title =	"Probing a scene of non-convex polyhedra"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"321--342"
-, keywords =	"geometric probing, polyhedral scenes"
-, succeeds =	"by-psncp-89"
-, update =	"99.07 devillers"
+, author =      "Jean-Daniel Boissonnat and Mariette Yvinec"
+, title =       "Probing a scene of non-convex polyhedra"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "321--342"
+, keywords =    "geometric probing, polyhedral scenes"
+, succeeds =    "by-psncp-89"
+, update =      "99.07 devillers"
 }
 
 @article{b-fmapg-84
-, author =	"S. H. Bokhari"
-, title =	"Finding maximum on an array processor with a global bus"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-33"
-, number =	2
-, month =	feb
-, year =	1984
-, pages =	"133--139"
-, update =	"98.07 bibrelex"
+, author =      "S. H. Bokhari"
+, title =       "Finding maximum on an array processor with a global bus"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-33"
+, number =      2
+, month =       feb
+, year =        1984
+, pages =       "133--139"
+, update =      "98.07 bibrelex"
 }
 
 @article{b-grwsi-89
-, author =	"J. Bokowski"
-, title =	"A geometric realization without self-intersections does exist for {Dyck}'s regular map"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"583--589"
+, author =      "J. Bokowski"
+, title =       "A geometric realization without self-intersections does exist for {Dyck}'s regular map"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "583--589"
 }
 
 @inproceedings{b-acsg2-87
-, author =	"J. Bokowski"
-, title =	"Aspects of computational synthetic geometry 2, {Combinatorial} complexes and their geometric realization, an algebraic approach"
-, booktitle =	"Comput. Aided Geom. Reasoning. Proc. INRIA Workshop"
-, volume =	1
-, year =	1987
-, pages =	"87--125"
-, keywords =	"matroids"
-, update =	"95.05 korneenko"
+, author =      "J. Bokowski"
+, title =       "Aspects of computational synthetic geometry 2, {Combinatorial} complexes and their geometric realization, an algebraic approach"
+, booktitle =   "Comput. Aided Geom. Reasoning. Proc. INRIA Workshop"
+, volume =      1
+, year =        1987
+, pages =       "87--125"
+, keywords =    "matroids"
+, update =      "95.05 korneenko"
 }
 
 @incollection{b-om-93
-, author =	"J. Bokowski"
-, title =	"Oriented Matroids"
-, chapter =	"2.5"
-, editor =	"Peter M. Gruber and J. M. Wills"
-, booktitle =	"Handbook of Convex Geometry"
-, volume =	"A"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1993
-, pages =	"555--602"
-, keywords =	"survey paper"
-, update =	"96.05 pocchiola"
+, author =      "J. Bokowski"
+, title =       "Oriented Matroids"
+, chapter =     "2.5"
+, editor =      "Peter M. Gruber and J. M. Wills"
+, booktitle =   "Handbook of Convex Geometry"
+, volume =      "A"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1993
+, pages =       "555--602"
+, keywords =    "survey paper"
+, update =      "96.05 pocchiola"
 }
 
 @techreport{b-omccg-87
-, author =	"J. Bokowski"
-, title =	"Oriented matroids and combinatorial convex geometry"
-, type =	"Report"
-, number =	"??"
-, institution =	"Tech. Hochschule Darmstadt"
-, address =	"Darmstadt, West Germany"
-, year =	1987
+, author =      "J. Bokowski"
+, title =       "Oriented matroids and combinatorial convex geometry"
+, type =        "Report"
+, number =      "??"
+, institution = "Tech. Hochschule Darmstadt"
+, address =     "Darmstadt, West Germany"
+, year =        1987
 }
 
 @article{brs-npcg-90
-, author =	"J. Bokowski and J. Richter and B. Sturmfels"
-, title =	"Nonrealizability proofs in computational geometry"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"333--350"
+, author =      "J. Bokowski and J. Richter and B. Sturmfels"
+, title =       "Nonrealizability proofs in computational geometry"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "333--350"
 }
 
 @article{bs-com-86
-, author =	"J. Bokowski and B. Sturmfels"
-, title =	"On the coordination of oriented matroids"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"293--306"
+, author =      "J. Bokowski and B. Sturmfels"
+, title =       "On the coordination of oriented matroids"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "293--306"
 }
 
 @article{b-koejk-36
-, author =	"G. Bol"
-, title =	"Zur kinematischen Ordnung ebener {Jorden}-Kurven"
-, journal =	"Abh. Math. Sem. Univ. Hamburg"
-, volume =	11
-, year =	1936
-, pages =	"394--408"
-, update =	"98.11 bibrelex"
+, author =      "G. Bol"
+, title =       "Zur kinematischen Ordnung ebener {Jorden}-Kurven"
+, journal =     "Abh. Math. Sem. Univ. Hamburg"
+, volume =      11
+, year =        1936
+, pages =       "394--408"
+, update =      "98.11 bibrelex"
 }
 
 @mastersthesis{b-scs-92
-, author =	"R. Boland"
-, title =	"Separating convex sets"
-, school =	"Carleton Univ."
-, address =	"Ottawa, Ontario, Canada"
-, year =	1992
-, keywords =	"master thesis"
-, update =	"98.07 bibrelex"
+, author =      "R. Boland"
+, title =       "Separating convex sets"
+, school =      "Carleton Univ."
+, address =     "Ottawa, Ontario, Canada"
+, year =        1992
+, keywords =    "master thesis"
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{bu-scpes-
-, author =	"R. Boland and J. Urrutia"
-, title =	"Separating collections of points in {Euclidean} space"
-, note =	"In preparation"
-, update =	"98.07 bibrelex"
+, author =      "R. Boland and J. Urrutia"
+, title =       "Separating collections of points in {Euclidean} space"
+, note =        "In preparation"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bu-sfpes-92
-, author =	"R. P. Boland and J. Urrutia"
-, title =	"Separating families of points in {Euclidean} spaces"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"6--10"
-, cites =	"akp-cddsl-89, a-ppss-85, a-npps-84, b-scs-92, b-dsudn-33, bu-scpes-, cruz-scsp-92, lms-hscr-92, m-ptlp-85, s-tt-79, t-sppcs-79, w-pr-82, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "R. P. Boland and J. Urrutia"
+, title =       "Separating families of points in {Euclidean} spaces"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "6--10"
+, cites =       "akp-cddsl-89, a-ppss-85, a-npps-84, b-scs-92, b-dsudn-33, bu-scpes-, cruz-scsp-92, lms-hscr-92, m-ptlp-85, s-tt-79, t-sppcs-79, w-pr-82, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @book{b-c-86
-, author =	"B. Bollob{\'a}s"
-, title =	"Combinatorics"
-, publisher =	"Cambridge University Press"
-, year =	1986
-, update =	"98.07 bibrelex"
+, author =      "B. Bollob{\'a}s"
+, title =       "Combinatorics"
+, publisher =   "Cambridge University Press"
+, year =        1986
+, update =      "98.07 bibrelex"
 }
 
 @book{b-egt-78
-, author =	"B. Bollob{\'a}s"
-, title =	"Extremal Graph Theory"
-, publisher =	"Academic Press"
-, address =	"New York"
-, year =	1978
-, update =	"98.03 icking, 97.11 bibrelex"
+, author =      "B. Bollob{\'a}s"
+, title =       "Extremal Graph Theory"
+, publisher =   "Academic Press"
+, address =     "New York"
+, year =        1978
+, update =      "98.03 icking, 97.11 bibrelex"
 }
 
 @book{b-gtic-79
-, author =	"B. Bollob{\'a}s"
-, title =	"Graph Theory; {An} Introductory Course"
-, publisher =	"Springer-Verlag"
-, year =	1979
-, update =	"98.03 bibrelex"
+, author =      "B. Bollob{\'a}s"
+, title =       "Graph Theory; {An} Introductory Course"
+, publisher =   "Springer-Verlag"
+, year =        1979
+, update =      "98.03 bibrelex"
 }
 
 @book{b-rg-85
-, author =	"B. Bollob{\'a}s"
-, title =	"Random Graphs"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1985
-, update =	"99.07 smid, 98.03 bibrelex"
+, author =      "B. Bollob{\'a}s"
+, title =       "Random Graphs"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1985
+, update =      "99.07 smid, 98.03 bibrelex"
 }
 
 @article{bb-gweto-87
-, author =	"B. Bollob{\'a}s and G. Brightwell"
-, title =	"Graphs whose every transitive orientation contains almost every relation"
-, journal =	"Israel J. Math."
-, volume =	59
-, year =	1987
-, pages =	"112--128"
-, update =	"98.03 bibrelex"
+, author =      "B. Bollob{\'a}s and G. Brightwell"
+, title =       "Graphs whose every transitive orientation contains almost every relation"
+, journal =     "Israel J. Math."
+, volume =      59
+, year =        1987
+, pages =       "112--128"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bdgm-tsspw-97
-, author =	"B. Bollob{\'a}s and G. Das and D. Gunopulos and H. Mannila"
-, title =	"Time-Series Similarity Problems and Well-Separated Geometric Sets"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"454--456"
-, cites =	"afs-esssd-93, alss-fsspn-95, a-afps-90, b-c-86, c-chdc-93, cw-qorss-89, dgm-fsts-96, frm-fsmts-94, jmm-sbq-95, sz-aqrld-96, wj-assr-96, yo-smi-96, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "B. Bollob{\'a}s and G. Das and D. Gunopulos and H. Mannila"
+, title =       "Time-Series Similarity Problems and Well-Separated Geometric Sets"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "454--456"
+, cites =       "afs-esssd-93, alss-fsspn-95, a-afps-90, b-c-86, c-chdc-93, cw-qorss-89, dgm-fsts-96, frm-fsmts-94, jmm-sbq-95, sz-aqrld-96, wj-assr-96, yo-smi-96, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{bm-tspkd-
-, author =	"B. Bollob{\'a}s and A. Meir"
-, title =	"A traveling salesman problem in the $k$-dimensional unit-cube"
-, journal =	"Oper. Res. Lett."
-, volume =	"??"
-, year =	"??"
-, note =	"To appear"
-, update =	"97.11 bibrelex"
+, author =      "B. Bollob{\'a}s and A. Meir"
+, title =       "A traveling salesman problem in the $k$-dimensional unit-cube"
+, journal =     "Oper. Res. Lett."
+, volume =      "??"
+, year =        "??"
+, note =        "To appear"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-orasr-81
-, author =	"A. Bolour"
-, title =	"Optimal retrieval algorithms for small region queries"
-, journal =	"SIAM J. Comput."
-, volume =	10
-, year =	1981
-, pages =	"721--741"
+, author =      "A. Bolour"
+, title =       "Optimal retrieval algorithms for small region queries"
+, journal =     "SIAM J. Comput."
+, volume =      10
+, year =        1981
+, pages =       "721--741"
 }
 
 @article{b-opmkh-79
-, author =	"A. Bolour"
-, title =	"Optimality properties of multiple-key hashing functions"
-, journal =	"J. ACM"
-, volume =	26
-, year =	1979
-, pages =	"196--210"
+, author =      "A. Bolour"
+, title =       "Optimality properties of multiple-key hashing functions"
+, journal =     "J. ACM"
+, volume =      26
+, year =        1979
+, pages =       "196--210"
 }
 
 @book{bg-rpcg-85
-, author =	"V. Boltjansky and I. T. Gohberg"
-, title =	"Results and Problems in Combinatorial Geometry"
-, publisher =	"Cambridge University Press"
-, address =	"New York, NY"
-, year =	1985
+, author =      "V. Boltjansky and I. T. Gohberg"
+, title =       "Results and Problems in Combinatorial Geometry"
+, publisher =   "Cambridge University Press"
+, address =     "New York, NY"
+, year =        1985
 }
 
 @article{b-lgc-74
-, author =	"E. Bombieri"
-, title =	"Le grand crible"
-, journal =	"Asterisque"
-, volume =	18
-, year =	1974
-, update =	"98.07 bibrelex"
+, author =      "E. Bombieri"
+, title =       "Le grand crible"
+, journal =     "Asterisque"
+, volume =      18
+, year =        1974
+, update =      "98.07 bibrelex"
 }
 
 @article{bk-sectp-88
-, author =	"F. Bonafatti and L. Kavazza"
-, title =	"{SECT}: {An} efficient coding technique for polygonal geographical data"
-, journal =	"Comput. Graph."
-, volume =	22
-, number =	"3--4"
-, year =	1988
-, pages =	"503--513"
-, keywords =	"data structuring, polygons"
-, update =	"95.05 korneenko"
+, author =      "F. Bonafatti and L. Kavazza"
+, title =       "{SECT}: {An} efficient coding technique for polygonal geographical data"
+, journal =     "Comput. Graph."
+, volume =      22
+, number =      "3--4"
+, year =        1988
+, pages =       "503--513"
+, keywords =    "data structuring, polygons"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bl-oavdr-89
-, author =	"C. R. Bonapace and C. Lo"
-, title =	"An {$O(n \log n)$} algorithm for {VLSI} design rule checking"
-, booktitle =	"Proc. 26th Design Autom. Conf."
-, year =	1989
-, pages =	"503--507"
-, update =	"98.07 bibrelex"
+, author =      "C. R. Bonapace and C. Lo"
+, title =       "An {$O(n \log n)$} algorithm for {VLSI} design rule checking"
+, booktitle =   "Proc. 26th Design Autom. Conf."
+, year =        1989
+, pages =       "503--507"
+, update =      "98.07 bibrelex"
 }
 
 @book{bm-gta-76
-, author =	"J. A. Bondy and U. S. R. Murty"
-, title =	"Graph Theory with Applications"
-, publisher =	"Macmillan"
-, address =	"London"
-, year =	1976
-, isbn =	"0-333-17791-6"
-, keywords =	"graph drawing"
-, comments =	"Also attributed to North-Holland, New York, NY"
-, update =	"97.11 bibrelex, 93.09 tamassia"
+, author =      "J. A. Bondy and U. S. R. Murty"
+, title =       "Graph Theory with Applications"
+, publisher =   "Macmillan"
+, address =     "London"
+, year =        1976
+, isbn =        "0-333-17791-6"
+, keywords =    "graph drawing"
+, comments =    "Also attributed to North-Holland, New York, NY"
+, update =      "97.11 bibrelex, 93.09 tamassia"
 }
 
 @article{bp-adtaa-91
-, author =	"J. Bonet and J. Peraire"
-, title =	"An alternating digital tree (ADT) algortihm for $3$D geometric searching and intersection problems"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	31
-, year =	1991
-, pages =	"1--17"
-, update =	"97.11 bibrelex"
+, author =      "J. Bonet and J. Peraire"
+, title =       "An alternating digital tree (ADT) algortihm for $3$D geometric searching and intersection problems"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      31
+, year =        1991
+, pages =       "1--17"
+, update =      "97.11 bibrelex"
 }
 
 @book{bf-tdkk-34
-, author =	"T. Bonnesen and W. Fenchel"
-, title =	"Theorie der konvexen {K{\"o}rper}"
-, publisher =	"J. Springer"
-, address =	"Berlin, Germany"
-, year =	1934
-, note =	"Reprinted Chelsea, New York, 1948"
-, update =	"97.11 bibrelex"
+, author =      "T. Bonnesen and W. Fenchel"
+, title =       "Theorie der konvexen {K{\"o}rper}"
+, publisher =   "J. Springer"
+, address =     "Berlin, Germany"
+, year =        1934
+, note =        "Reprinted Chelsea, New York, 1948"
+, update =      "97.11 bibrelex"
 }
 
 % ### uncertain journal
 @article{bk-gch-63
-, author =	"W. Bonnice and V. L. Klee"
-, title =	"The generation of convex hulls"
-, journal =	"Math. Ann."
-, volume =	152
-, year =	1963
-, pages =	"1--29"
-, keywords =	"convex hull"
-, update =	"95.05 korneenko"
+, author =      "W. Bonnice and V. L. Klee"
+, title =       "The generation of convex hulls"
+, journal =     "Math. Ann."
+, volume =      152
+, year =        1963
+, pages =       "1--29"
+, keywords =    "convex hull"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bkr-dcbws-95
-, author =	"A. Bookstein and S. T. Klein and T. Raita"
-, title =	"Detecting Content-Bearing Words by Serial Clustering"
-, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
-, year =	1995
-, pages =	"319--327"
-, update =	"98.07 agarwal"
+, author =      "A. Bookstein and S. T. Klein and T. Raita"
+, title =       "Detecting Content-Bearing Words by Serial Clustering"
+, booktitle =   "Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
+, year =        1995
+, pages =       "319--327"
+, update =      "98.07 agarwal"
 }
 
 @book{b-mtld-91
-, author =	"F. L. Bookstein"
-, title =	"Morphometric Tools for Landmark Data"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge"
-, year =	1991
-, update =	"93.05 orourke"
+, author =      "F. L. Bookstein"
+, title =       "Morphometric Tools for Landmark Data"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge"
+, year =        1991
+, update =      "93.05 orourke"
 }
 
 @article{b-ls-79
-, author =	"F. L. Bookstein"
-, title =	"The line skeleton"
-, journal =	"Comput. Graph. Image Process."
-, volume =	11
-, number =	2
-, month =	oct
-, year =	1979
-, pages =	"123--137"
-, keywords =	"algorithm; computer graphics; computer programming Subroutines; methodology, techniques, modeling, representation, graphic, algorithmic aspects, polygon"
-, update =	"98.07 bibrelex"
+, author =      "F. L. Bookstein"
+, title =       "The line skeleton"
+, journal =     "Comput. Graph. Image Process."
+, volume =      11
+, number =      2
+, month =       oct
+, year =        1979
+, pages =       "123--137"
+, keywords =    "algorithm; computer graphics; computer programming Subroutines; methodology, techniques, modeling, representation, graphic, algorithmic aspects, polygon"
+, update =      "98.07 bibrelex"
 }
 
 @book{b-mbssc-78
-, author =	"F. L. Bookstein"
-, title =	"The Measurement of Biological Shape and Shape Change"
-, series =	"Lecture Notes in Biomathematics"
-, volume =	24
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1978
-, update =	"96.09 agarwal, 93.05 orourke"
+, author =      "F. L. Bookstein"
+, title =       "The Measurement of Biological Shape and Shape Change"
+, series =      "Lecture Notes in Biomathematics"
+, volume =      24
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1978
+, update =      "96.09 agarwal, 93.05 orourke"
 }
 
 @book{b-pgs-78
-, author =	"C. de Boor"
-, title =	"A practical guide to splines"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1978
-, update =	"97.11 bibrelex"
+, author =      "C. de Boor"
+, title =       "A practical guide to splines"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1978
+, update =      "97.11 bibrelex"
 }
 
 @article{b-cbs-72
-, author =	"C. de Boor"
-, title =	"On Calculating with {B}-Splines"
-, journal =	"J. Approx. Theory"
-, volume =	6
-, year =	1972
-, pages =	"50--62"
-, update =	"97.11 bibrelex"
+, author =      "C. de Boor"
+, title =       "On Calculating with {B}-Splines"
+, journal =     "J. Approx. Theory"
+, volume =      6
+, year =        1972
+, pages =       "50--62"
+, update =      "97.11 bibrelex"
 }
 
 @article{bl-tcopi-76
-, author =	"K. Booth and G. Lueker"
-, title =	"Testing for the Consecutive Ones Property Interval Graphs and Graph Planarity Using {PQ}-Tree Algorithms"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	13
-, year =	1976
-, pages =	"335--379"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "K. Booth and G. Lueker"
+, title =       "Testing for the Consecutive Ones Property Interval Graphs and Graph Planarity Using {PQ}-Tree Algorithms"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      13
+, year =        1976
+, pages =       "335--379"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{b-affst-91
-, author =	"R. S. Booth"
-, title =	"Analytic formulas for full {Steiner} trees"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"69--82"
+, author =      "R. S. Booth"
+, title =       "Analytic formulas for full {Steiner} trees"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "69--82"
 }
 
 @article{b-srfp-91
-, author =	"R. S. Booth"
-, title =	"The {Steiner} ratio for five points"
-, journal =	"Ann. Oper. Res."
-, volume =	33
-, number =	"1--4"
-, year =	1991
-, pages =	"419--436"
-, keywords =	"Steiner tree"
-, update =	"95.05 korneenko"
+, author =      "R. S. Booth"
+, title =       "The {Steiner} ratio for five points"
+, journal =     "Ann. Oper. Res."
+, volume =      33
+, number =      "1--4"
+, year =        1991
+, pages =       "419--436"
+, keywords =    "Steiner tree"
+, update =      "95.05 korneenko"
 }
 
 @article{b-elprv-87
-, author =	"B. N. Boots"
-, title =	"Edge Length Properties Of Random {Voronoi} Polygons"
-, journal =	"Metallography"
-, volume =	20
-, number =	2
-, month =	may
-, year =	1987
-, pages =	"231--236"
-, keywords =	"edge length properties, random Voronoi polygons"
-, abstract =	"The author has previously suggested that the equations
-		 derived by Aboav for m//n, the average number of sides
-		 of cells contiguous to an n-sided cell in a planar
-		 tessellation, did not hold for a tessellation formed by
-		 random Voronoi polygons (i. e. , cells created by
-		 Dirichlet domains defined about a set of points located
-		 at random in the plane). The suggestion was supported
-		 by results derived either analytically or by Monte
-		 Carlo simulation relating to a random Voronoi polygon
-		 tessellation. These results included an estimate
-		 derived by Crain from a Monte Carlo simulation of
-		 46,000 polygons of E(l**2). This paper presents
-		 evidence which supports Aboav's speculation concerning
-		 Crain's results. However, the new result also indicates
-		 that a RVP tessellation is inconsistent with an
-		 equation. In addition, further information is presented
-		 which suggests that other estimates provided by Crain
-		 are inaccurate. 13 refs."
+, author =      "B. N. Boots"
+, title =       "Edge Length Properties Of Random {Voronoi} Polygons"
+, journal =     "Metallography"
+, volume =      20
+, number =      2
+, month =       may
+, year =        1987
+, pages =       "231--236"
+, keywords =    "edge length properties, random Voronoi polygons"
+, abstract =    "The author has previously suggested that the equations
+                 derived by Aboav for m//n, the average number of sides
+                 of cells contiguous to an n-sided cell in a planar
+                 tessellation, did not hold for a tessellation formed by
+                 random Voronoi polygons (i. e. , cells created by
+                 Dirichlet domains defined about a set of points located
+                 at random in the plane). The suggestion was supported
+                 by results derived either analytically or by Monte
+                 Carlo simulation relating to a random Voronoi polygon
+                 tessellation. These results included an estimate
+                 derived by Crain from a Monte Carlo simulation of
+                 46,000 polygons of E(l**2). This paper presents
+                 evidence which supports Aboav's speculation concerning
+                 Crain's results. However, the new result also indicates
+                 that a RVP tessellation is inconsistent with an
+                 equation. In addition, further information is presented
+                 which suggests that other estimates provided by Crain
+                 are inaccurate. 13 refs."
 }
 
 @article{b-mtp-87
-, author =	"B. N. Boots"
-, title =	"Modifying {Thiessen} Polygons"
-, journal =	"The Canadian Geographer"
-, volume =	31
-, number =	2
-, year =	1987
-, pages =	"160--169"
-, annote =	"Surveys use of VD for geographical analysis, and
-		 discusses weighted diagrams, and other metrics."
+, author =      "B. N. Boots"
+, title =       "Modifying {Thiessen} Polygons"
+, journal =     "The Canadian Geographer"
+, volume =      31
+, number =      2
+, year =        1987
+, pages =       "160--169"
+, annote =      "Surveys use of VD for geographical analysis, and
+                 discusses weighted diagrams, and other metrics."
 }
 
 % [a-vdsfg-91] claims it's Norwich, Conn.
 @book{b-vtp-89
-, author =	"B. N. Boots"
-, title =	"{Voronoi} ({Thiessen}) Polygons"
-, publisher =	"Geo Books"
-, address =	"Norwich, England"
-, year =	1989
-, update =	"93.09 rote"
+, author =      "B. N. Boots"
+, title =       "{Voronoi} ({Thiessen}) Polygons"
+, publisher =   "Geo Books"
+, address =     "Norwich, England"
+, year =        1989
+, update =      "93.09 rote"
 }
 
 @article{b-wtp-79
-, author =	"B. N. Boots"
-, title =	"Weighting {Thiessen} polygons"
-, journal =	"Econom. Geogr."
-, volume =	55
-, year =	1979
-, pages =	"248--259"
+, author =      "B. N. Boots"
+, title =       "Weighting {Thiessen} polygons"
+, journal =     "Econom. Geogr."
+, volume =      55
+, year =        1979
+, pages =       "248--259"
 }
 
 @article{bm-sarvp-83
-, author =	"B. N. Boots and D. J. Murdoch"
-, title =	"The Spatial Arrangement of Random {Voronoi} Polygons"
-, journal =	"Comput. Geosci."
-, volume =	9
-, number =	3
-, year =	1983
-, pages =	"351--365"
-, annote =	"Measures various quantities for random VD.
-		 Algorithm---incremental for each polygon---points in
-		 order of increasing distance"
+, author =      "B. N. Boots and D. J. Murdoch"
+, title =       "The Spatial Arrangement of Random {Voronoi} Polygons"
+, journal =     "Comput. Geosci."
+, volume =      9
+, number =      3
+, year =        1983
+, pages =       "351--365"
+, annote =      "Measures various quantities for random VD.
+                 Algorithm---incremental for each polygon---points in
+                 order of increasing distance"
 }
 
 @article{b-icchp-90
-, author =	"J. Boreddy"
-, title =	"An incremental computation of a convex hull of planar line intersections"
-, journal =	"Pattern Recogn. Lett."
-, volume =	11
-, number =	8
-, year =	1990
-, pages =	"541--543"
-, note =	"erratic"
-, keywords =	"convex hull, intersection, lines"
-, update =	"95.05 korneenko"
+, author =      "J. Boreddy"
+, title =       "An incremental computation of a convex hull of planar line intersections"
+, journal =     "Pattern Recogn. Lett."
+, volume =      11
+, number =      8
+, year =        1990
+, pages =       "541--543"
+, note =        "erratic"
+, keywords =    "convex hull, intersection, lines"
+, update =      "95.05 korneenko"
 }
 
 @article{bm-afps-89
-, author =	"J. Boreddy and R. N. Mukherjee"
-, title =	"An algorithm to find polygon similarity"
-, journal =	"Inform. Process. Lett."
-, volume =	33
-, number =	4
-, year =	1989
-, pages =	"205--206"
-, note =	"erratic"
-, keywords =	"polygons, similarity"
-, update =	"95.05 korneenko"
+, author =      "J. Boreddy and R. N. Mukherjee"
+, title =       "An algorithm to find polygon similarity"
+, journal =     "Inform. Process. Lett."
+, volume =      33
+, number =      4
+, year =        1989
+, pages =       "205--206"
+, note =        "erratic"
+, keywords =    "polygons, similarity"
+, update =      "95.05 korneenko"
 }
 
 @article{b-gdtnd-90
-, author =	"C. Borgers"
-, title =	"Generalized {Delaunay} Triangulations of Nonconvex Domains"
-, journal =	"Comput. Math. Appl."
-, volume =	20
-, number =	7
-, year =	1990
-, pages =	"45--49"
-, annote =	"Proof of switching construction for CDT. Algorithm
-		 triangulates constraint polygon (by $O(n^3)$ algorithm
-		 via search for triangle standing on boundary edge).
-		 Then compute DT in each triangle and finally do
-		 switchings until we converge on the CDT."
+, author =      "C. Borgers"
+, title =       "Generalized {Delaunay} Triangulations of Nonconvex Domains"
+, journal =     "Comput. Math. Appl."
+, volume =      20
+, number =      7
+, year =        1990
+, pages =       "45--49"
+, annote =      "Proof of switching construction for CDT. Algorithm
+                 triangulates constraint polygon (by $O(n^3)$ algorithm
+                 via search for triangle standing on boundary edge).
+                 Then compute DT in each triangle and finally do
+                 switchings until we converge on the CDT."
 }
 
 @book{b-smpa-87
-, author =	"K. H. Borgwardt"
-, title =	"The Simplex Method. A Probabilistic Analysis"
-, series =	"Algorithms and Combinatorics"
-, volume =	1
-, publisher =	"Springer-Verlag"
-, address =	"Berlin Heidelberg"
-, year =	1987
-, update =	"97.03 gaertner+salinger"
+, author =      "K. H. Borgwardt"
+, title =       "The Simplex Method. A Probabilistic Analysis"
+, series =      "Algorithms and Combinatorics"
+, volume =      1
+, publisher =   "Springer-Verlag"
+, address =     "Berlin Heidelberg"
+, year =        1987
+, update =      "97.03 gaertner+salinger"
 }
 
 @incollection{bgjr-cchep-91
-, author =	"K. H. Borgwardt and N. Gaffke and M. Junger and G. Reinelt"
-, title =	"Computing the convex hull in the {Euclidean} plane in linear expected time"
-, editor =	"P. Gritzman and B. Sturmfels"
-, booktitle =	"Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
-, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
-, volume =	4
-, publisher =	"AMS Press"
-, year =	1991
-, pages =	"91--107"
-, keywords =	"convex hull, expected-case analysis"
-, update =	"95.05 korneenko"
+, author =      "K. H. Borgwardt and N. Gaffke and M. Junger and G. Reinelt"
+, title =       "Computing the convex hull in the {Euclidean} plane in linear expected time"
+, editor =      "P. Gritzman and B. Sturmfels"
+, booktitle =   "Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
+, series =      "DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
+, volume =      4
+, publisher =   "AMS Press"
+, year =        1991
+, pages =       "91--107"
+, keywords =    "convex hull, expected-case analysis"
+, update =      "95.05 korneenko"
 }
 
 @phdthesis{b-tcosl-79
-, author =	"A. Borning"
-, title =	"Thinglab: {A} constraint-oriented simulation laboratory"
-, school =	"Dept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, month =	jul
-, year =	1979
-, note =	"Available as Technical Report STAN-CS-79-746"
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "A. Borning"
+, title =       "Thinglab: {A} constraint-oriented simulation laboratory"
+, school =      "Dept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, month =       jul
+, year =        1979
+, note =        "Available as Technical Report STAN-CS-79-746"
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{bh-rmspm-85
-, author =	"A. Borodin and J. E. Hopcroft"
-, title =	"Routing, merging, and sorting on parallel models of computation"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	30
-, number =	1
-, year =	1985
-, pages =	"130--145"
+, author =      "A. Borodin and J. E. Hopcroft"
+, title =       "Routing, merging, and sorting on parallel models of computation"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      30
+, number =      1
+, year =        1985
+, pages =       "130--145"
 }
 
 @inproceedings{bor-lbhdn-99
-, author =	"A. Borodin and R. Ostrovsky and Y. Rabani"
-, title =	"Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems"
-, booktitle =	"Proc. 31st Annu. ACM Sympos. Theory Comput."
-, year =	1999
-, pages =	"312--321"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "A. Borodin and R. Ostrovsky and Y. Rabani"
+, title =       "Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems"
+, booktitle =   "Proc. 31st Annu. ACM Sympos. Theory Comput."
+, year =        1999
+, pages =       "312--321"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{bor-saacp-99
-, author =	"A. Borodin and R. Ostrovsky and Y. Rabani"
-, title =	"Subquadratic Approximation Algorithms For Clustering Problems in High Dimensional Spaces"
-, booktitle =	"Proc. 31st Annu. ACM Sympos. Theory Comput."
-, year =	1999
-, pages =	"435--444"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "A. Borodin and R. Ostrovsky and Y. Rabani"
+, title =       "Subquadratic Approximation Algorithms For Clustering Problems in High Dimensional Spaces"
+, booktitle =   "Proc. 31st Annu. ACM Sympos. Theory Comput."
+, year =        1999
+, pages =       "435--444"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @article{bf-ntccn-84
-, author =	"E. Boros and Z. F{\"u}redi"
-, title =	"The number of triangles covering the center of an $n$-set"
-, journal =	"Geom. Dedicata"
-, volume =	17
-, year =	1984
-, pages =	"69--77"
-, update =	"97.11 bibrelex"
+, author =      "E. Boros and Z. F{\"u}redi"
+, title =       "The number of triangles covering the center of an $n$-set"
+, journal =     "Geom. Dedicata"
+, volume =      17
+, year =        1984
+, pages =       "69--77"
+, update =      "97.11 bibrelex"
 }
 
 @article{bfk-rsgd-89
-, author =	"E. Boros and Z. F{\"u}redi and L. M. Kelly"
-, title =	"On representing {Sylvester}-{Gallai} designs"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"345--348"
+, author =      "E. Boros and Z. F{\"u}redi and L. M. Kelly"
+, title =       "On representing {Sylvester}-{Gallai} designs"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "345--348"
 }
 
 @techreport{bh-cpcoe-88
-, author =	"E. Boros and P. L. Hammer"
-, title =	"On clustering problems with connected optima in {Euclidean} spaces"
-, type =	"Technical {Report}"
-, institution =	"RUTCOR, Ruters University"
-, address =	"New Brunswick, New Jersey"
-, month =	mar
-, year =	1988
-, update =	"93.09 milone+mitchell"
+, author =      "E. Boros and P. L. Hammer"
+, title =       "On clustering problems with connected optima in {Euclidean} spaces"
+, type =        "Technical {Report}"
+, institution = "RUTCOR, Ruters University"
+, address =     "New Brunswick, New Jersey"
+, month =       mar
+, year =        1988
+, update =      "93.09 milone+mitchell"
 }
 
 @article{bh-cpcoe-89
-, author =	"E. Boros and P. L. Hammer"
-, title =	"On clustering problems with connected optima in {Euclidean} spaces"
-, journal =	"Discrete Math."
-, volume =	75
-, year =	1989
-, pages =	"81--88"
-, update =	"98.03 bibrelex"
+, author =      "E. Boros and P. L. Hammer"
+, title =       "On clustering problems with connected optima in {Euclidean} spaces"
+, journal =     "Discrete Math."
+, volume =      75
+, year =        1989
+, pages =       "81--88"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bfg-utqmg-96
-, author =	"Houman Borouchaki and Pascal J. Frey and Paul Louis George"
-, title =	"Unstructured triangular-quadrilateral mesh generation application to surface meshing"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"229--242"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Houman Borouchaki and Pascal J. Frey and Paul Louis George"
+, title =       "Unstructured triangular-quadrilateral mesh generation application to surface meshing"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "229--242"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @inproceedings{bhsg-redbm-95
-, author =	"H. Borouchaki and F. Hecht and E. Saltel and P. L. George"
-, title =	"Reasonably Efficient {Delaunay} Based Mesh Generator in 3 Dimensions"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"3--14"
-, update =	"96.01 samitchell"
+, author =      "H. Borouchaki and F. Hecht and E. Saltel and P. L. George"
+, title =       "Reasonably Efficient {Delaunay} Based Mesh Generator in 3 Dimensions"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "3--14"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{bm-pcg-95
-, author =	"Ali R. Boroujerdi and Bernard M. E. Moret"
-, title =	"Persistence in Computational Geometry"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"241--246"
-, update =	"95.09 jones"
+, author =      "Ali R. Boroujerdi and Bernard M. E. Moret"
+, title =       "Persistence in Computational Geometry"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "241--246"
+, update =      "95.09 jones"
 }
 
 @article{brs-dot-92
-, author =	"J. Borowski and J. Richter-Gebert and W. Schindler"
-, title =	"On the distribution of order types"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, number =	3
-, year =	1992
-, pages =	"127--142"
-, keywords =	"chiritope, grassmanian, order type, oriented matroid, Monte-Carlo methods"
+, author =      "J. Borowski and J. Richter-Gebert and W. Schindler"
+, title =       "On the distribution of order types"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, number =      3
+, year =        1992
+, pages =       "127--142"
+, keywords =    "chiritope, grassmanian, order type, oriented matroid, Monte-Carlo methods"
 }
 
 @article{bb-dndo-91
-, author =	"P. Borrel and D. Bechmann"
-, title =	"Deformation of $n$-dimensional objects"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	4
-, year =	1991
-, pages =	"427--453"
+, author =      "P. Borrel and D. Bechmann"
+, title =       "Deformation of $n$-dimensional objects"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      4
+, year =        1991
+, pages =       "427--453"
 }
 
 @article{b-dsudn-33
-, author =	"K. Borsuk"
-, title =	"Drei {S{\"a}tze} {\"u}ber die $n$-dimensionale euklidische {Sph{\"a}re}"
-, journal =	"Fundam. Math."
-, volume =	20
-, year =	1933
-, update =	"98.07 bibrelex"
+, author =      "K. Borsuk"
+, title =       "Drei {S{\"a}tze} {\"u}ber die $n$-dimensionale euklidische {Sph{\"a}re}"
+, journal =     "Fundam. Math."
+, volume =      20
+, year =        1933
+, update =      "98.07 bibrelex"
 }
 
 @book{b-mag-69
-, author =	"K. Borsuk"
-, title =	"Multidimensional Analytic Geometry"
-, publisher =	"Polish Scientific Publishers"
-, address =	"Warsaw, Poland"
-, year =	1969
-, update =	"98.03 bibrelex"
+, author =      "K. Borsuk"
+, title =       "Multidimensional Analytic Geometry"
+, publisher =   "Polish Scientific Publishers"
+, address =     "Warsaw, Poland"
+, year =        1969
+, update =      "98.03 bibrelex"
 }
 
 @article{bm-sspig-90
-, author =	"P. Borwein and W. O. J. Moser"
-, title =	"A survey of {Sylvester}'s problem and its generalizations"
-, journal =	"Aequationes Math."
-, volume =	40
-, number =	"2--3"
-, year =	1990
-, pages =	"111--135"
-, keywords =	"survey"
-, update =	"95.05 korneenko"
+, author =      "P. Borwein and W. O. J. Moser"
+, title =       "A survey of {Sylvester}'s problem and its generalizations"
+, journal =     "Aequationes Math."
+, volume =      40
+, number =      "2--3"
+, year =        1990
+, pages =       "111--135"
+, keywords =    "survey"
+, update =      "95.05 korneenko"
 }
 
 @article{bh-ststr-88
-, author =	"J. M. Bosart and L. Huguet"
-, title =	"Shortest trees and {Steiner} trees with rectilinear distances ( paper in {Catalan} language)"
-, journal =	"Questiio"
-, volume =	12
-, number =	2
-, year =	1988
-, pages =	"159--174"
-, keywords =	"Steiner tree, minimal spanning tree, $L_1$-metric"
-, update =	"95.05 korneenko"
+, author =      "J. M. Bosart and L. Huguet"
+, title =       "Shortest trees and {Steiner} trees with rectilinear distances ( paper in {Catalan} language)"
+, journal =     "Questiio"
+, volume =      12
+, number =      2
+, year =        1988
+, pages =       "159--174"
+, keywords =    "Steiner tree, minimal spanning tree, $L_1$-metric"
+, update =      "95.05 korneenko"
 }
 
 @phdthesis{b-gcamp-95
-, author =	"P. Bose"
-, title =	"Geometric and Computational Aspects of Manufacturing Processes"
-, school =	"Dept. Comput. Sci., Univ. British Columbia"
-, address =	"Vancouver, BC"
-, year =	1995
-, note =	"UBC Tech. Rep 95-02"
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "P. Bose"
+, title =       "Geometric and Computational Aspects of Manufacturing Processes"
+, school =      "Dept. Comput. Sci., Univ. British Columbia"
+, address =     "Vancouver, BC"
+, year =        1995
+, note =        "UBC Tech. Rep 95-02"
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{b-eopgp-97
-, author =	"Prosenjit Bose"
-, title =	"On Embedding an Outer-Planar Graph in a Point Set"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"25--36"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Prosenjit Bose"
+, title =       "On Embedding an Outer-Planar Graph in a Point Set"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "25--36"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @techreport{bbk-dcsp-93
-, author =	"P. Bose and D. Bremner and M. van Kreveld"
-, title =	"Determining the Castability of Simple Polyhedra"
-, type =	"Technical {Report}"
-, number =	"SOCS 93.12"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "P. Bose and D. Bremner and M. van Kreveld"
+, title =       "Determining the Castability of Simple Polyhedra"
+, type =        "Technical {Report}"
+, number =      "SOCS 93.12"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bbk-dcsp-94
-, author =	"P. Bose and D. Bremner and M. van Kreveld"
-, title =	"Determining the Castability of Simple Polyhedra"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"123--131"
-, cites =	"am-rsps-92, as-anps-91, abbgotwz-fds-93, bbk-dcsp-93, bkt-fpm-93, bt-gcaim-93, csw-qoubs-90, dk-ladsc-85, e-acg-87, e-cit-88, fm-gaim-93, h-cgpm-91, m-ept-91, m-rsehc-92, ms-tdctd-93, m-ltalp-83, ps-cgi-85, p-mrisf-87, rr-mcp-92, r-dcikc-88a, wo-ich-81, w-imm-84, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "P. Bose and D. Bremner and M. van Kreveld"
+, title =       "Determining the Castability of Simple Polyhedra"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "123--131"
+, cites =       "am-rsps-92, as-anps-91, abbgotwz-fds-93, bbk-dcsp-93, bkt-fpm-93, bt-gcaim-93, csw-qoubs-90, dk-ladsc-85, e-acg-87, e-cit-88, fm-gaim-93, h-cgpm-91, m-ept-91, m-rsehc-92, ms-tdctd-93, m-ltalp-83, ps-cgi-85, p-mrisf-87, rr-mcp-92, r-dcikc-88a, wo-ich-81, w-imm-84, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @article{bbk-dcsp-97
-, author =	"P. Bose and D. Bremner and M. van Kreveld"
-, title =	"Determining the Castability of Simple Polyhedra"
-, journal =	"Algorithmica"
-, volume =	19
-, number =	"1--2"
-, month =	sep
-, year =	1997
-, pages =	"84--113"
-, update =	"97.07 held"
+, author =      "P. Bose and D. Bremner and M. van Kreveld"
+, title =       "Determining the Castability of Simple Polyhedra"
+, journal =     "Algorithmica"
+, volume =      19
+, number =      "1--2"
+, month =       sep
+, year =        1997
+, pages =       "84--113"
+, update =      "97.07 held"
 }
 
 @techreport{bbt-acpcb-
-, author =	"P. Bose and D. Bremner and G. Toussaint"
-, title =	"All convex polyhedra can be clamped with parallel jaw grippers"
-, institution =	"School of Computer Science, McGill University"
-, note =	"to appear"
-, succeeds =	"bbt-acpcb-94, bbt-acpcb-96"
-, update =	"98.11 bibrelex"
+, author =      "P. Bose and D. Bremner and G. Toussaint"
+, title =       "All convex polyhedra can be clamped with parallel jaw grippers"
+, institution = "School of Computer Science, McGill University"
+, note =        "to appear"
+, succeeds =    "bbt-acpcb-94, bbt-acpcb-96"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{bbt-acpcb-94
-, author =	"P. Bose and D. Bremner and G. Toussaint"
-, title =	"All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"344--349"
-, precedes =	"bbt-acpcb-96, bbt-acpcb-"
-, cites =	"aho-srcp-90, abbgotwz-fds-93, bfg-spmfh-85, bbt-acpcb-, c-cpo-93, csu-isp-91, gs-ccrs-87, ht-cws-88, mss-esmpg-87, mu-ifp-91, ps-cgi-85, s-dcah-84, sv-cp-89t, tm-ragum-94, b-gtfga-80, ZZZ"
-, update =	"98.11 bibrelex, 97.03 devillers+smid, 94.09 jones"
+, author =      "P. Bose and D. Bremner and G. Toussaint"
+, title =       "All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "344--349"
+, precedes =    "bbt-acpcb-96, bbt-acpcb-"
+, cites =       "aho-srcp-90, abbgotwz-fds-93, bfg-spmfh-85, bbt-acpcb-, c-cpo-93, csu-isp-91, gs-ccrs-87, ht-cws-88, mss-esmpg-87, mu-ifp-91, ps-cgi-85, s-dcah-84, sv-cp-89t, tm-ragum-94, b-gtfga-80, ZZZ"
+, update =      "98.11 bibrelex, 97.03 devillers+smid, 94.09 jones"
 }
 
 @article{bbt-acpcb-96
-, author =	"P. Bose and D. Bremner and G. Toussaint"
-, title =	"All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"291--302"
-, succeeds =	"bbt-acpcb-94"
-, precedes =	"bbt-acpcb-"
-, update =	"98.11 bibrelex, 97.03 devillers+smid"
+, author =      "P. Bose and D. Bremner and G. Toussaint"
+, title =       "All Convex Polyhedra Can Be Clamped with Parallel Jaw Grippers"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "291--302"
+, succeeds =    "bbt-acpcb-94"
+, precedes =    "bbt-acpcb-"
+, update =      "98.11 bibrelex, 97.03 devillers+smid"
 }
 
 @inproceedings{bckm-aptcc-00
-, author =	"P. Bose and J. Czyzowicz and E. Kranakis and A. Maheshwari"
-, title =	"Algorithms for packing two circles in a convex polygon"
-, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1763
-, publisher =	"Springer-Verlag"
-, year =	2000
-, pages =	"93--103"
-, update =	"01.07 smid"
+, author =      "P. Bose and J. Czyzowicz and E. Kranakis and A. Maheshwari"
+, title =       "Algorithms for packing two circles in a convex polygon"
+, booktitle =   "Proc. Japan Conf. Discrete Comput. Geom."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1763
+, publisher =   "Springer-Verlag"
+, year =        2000
+, pages =       "93--103"
+, update =      "01.07 smid"
 }
 
 @techreport{bdhs-rvg1k-96
-, author =	"P. Bose and A. Dean and J. Hutchinson and T. Shermer"
-, title =	"On rectangle visibility graphs {I}: $k$-trees and caterpillar forests"
-, institution =	"DIMACS and Simon Fraser University"
-, month =	may
-, year =	1996
-, keywords =	"visibility graphs"
-, update =	"96.09 orourke"
+, author =      "P. Bose and A. Dean and J. Hutchinson and T. Shermer"
+, title =       "On rectangle visibility graphs {I}: $k$-trees and caterpillar forests"
+, institution = "DIMACS and Simon Fraser University"
+, month =       may
+, year =        1996
+, keywords =    "visibility graphs"
+, update =      "96.09 orourke"
 }
 
 @techreport{bd-irgo-95
-, author =	"P. Bose and L. Devroye"
-, title =	"Intersections with random geometric objects"
-, institution =	"School of Computer Science, McGill University"
-, year =	1995
-, note =	"Manuscript"
-, update =	"97.11 bibrelex"
+, author =      "P. Bose and L. Devroye"
+, title =       "Intersections with random geometric objects"
+, institution = "School of Computer Science, McGill University"
+, year =        1995
+, note =        "Manuscript"
+, update =      "97.11 bibrelex"
 }
 
 @article{bd-irgo-98
-, author =	"Prosenjit Bose and Luc Devroye"
-, title =	"Intersections with random geometric objects"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"139--154"
-, succeeds =	"bd-irgo-95"
-, update =	"98.11 devillers"
+, author =      "Prosenjit Bose and Luc Devroye"
+, title =       "Intersections with random geometric objects"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "139--154"
+, succeeds =    "bd-irgo-95"
+, update =      "98.11 devillers"
 }
 
 @techreport{bde-danmw-96t
-, author =	"P. Bose and L. Devroye and W. Evans"
-, title =	"Diamonds are not a minimum weight triangulation's best friend"
-, type =	"Technical {Report}"
-, number =	"96-01"
-, institution =	"Dept. Comput. Sci., Univ. British Comumbia"
-, month =	jan
-, year =	1996
-, update =	"97.11 bibrelex"
+, author =      "P. Bose and L. Devroye and W. Evans"
+, title =       "Diamonds are not a minimum weight triangulation's best friend"
+, type =        "Technical {Report}"
+, number =      "96-01"
+, institution = "Dept. Comput. Sci., Univ. British Comumbia"
+, month =       jan
+, year =        1996
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bde-danmw-96
-, author =	"P. Bose and L. Devroye and W. Evans"
-, title =	"Diamonds are not a minimum weight triangulation's best friend"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"68--73"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "P. Bose and L. Devroye and W. Evans"
+, title =       "Diamonds are not a minimum weight triangulation's best friend"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "68--73"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{bdll-pcrt-95
-, author =	"P. Bose and G. {Di Battista} and W. Lenhart and G. Liotta"
-, title =	"Proximity Constraints and Representable Trees"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"340--351"
-, keywords =	"graph drawing, proximity, trees"
-, update =	"95.01 tamassia"
+, author =      "P. Bose and G. {Di Battista} and W. Lenhart and G. Liotta"
+, title =       "Proximity Constraints and Representable Trees"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "340--351"
+, keywords =    "graph drawing, proximity, trees"
+, update =      "95.01 tamassia"
 }
 
 @techreport{bdll-pcrt-96
-, author =	"P. Bose and G. {Di Battista} and W. Lenhart and G. Liotta"
-, title =	"Proximity Constraints and Representable Trees"
-, type =	"Technical Report"
-, number =	"RT-INF-9-96"
-, institution =	"Dip. Discipline Scientifiche, Sez. Informatica, Univ. Roma III"
-, year =	1996
-, url =	"https://www.cs.brown.edu/cgc/papers/bdll-pcrt-96.ps.gz"
-, keywords =	"graph drawing, proximity, CGC, Brown"
-, update =	"97.03 tamassia"
+, author =      "P. Bose and G. {Di Battista} and W. Lenhart and G. Liotta"
+, title =       "Proximity Constraints and Representable Trees"
+, type =        "Technical Report"
+, number =      "RT-INF-9-96"
+, institution = "Dip. Discipline Scientifiche, Sez. Informatica, Univ. Roma III"
+, year =        1996
+, url = "https://www.cs.brown.edu/cgc/papers/bdll-pcrt-96.ps.gz"
+, keywords =    "graph drawing, proximity, CGC, Brown"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{bekms-aspal-96
-, author =	"P. Bose and W. Evans and D. Kirkpatrick and M. McAllister and J . Snoeyink"
-, title =	"Approximating shortest paths in arrangements of lines"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"143--148"
-, update =	"98.03 mitchell, 96.09 mitchell"
-, annote =	"2-approximation in $O(n\log n)$ time"
+, author =      "P. Bose and W. Evans and D. Kirkpatrick and M. McAllister and J . Snoeyink"
+, title =       "Approximating shortest paths in arrangements of lines"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "143--148"
+, update =      "98.03 mitchell, 96.09 mitchell"
+, annote =      "2-approximation in $O(n\log n)$ time"
 }
 
 @incollection{beflmrsw-ovrg3d-94
-, author =	"P. Bose and H. Everett and S{\'a}ndor P. Fekete and A. Lubiw and H. Meijer and K. Romanik and T. Shermer and S. Whitesides"
-, title =	"On a Visibility Representation for Graphs in Three Dimensions"
-, editor =	"D. Avis and P. Bose"
-, booktitle =	"Snapshots in Computational and Discrete Geometry, Volume III"
-, publisher =	"McGill University"
-, month =	jul
-, year =	1994
-, pages =	"2--25"
-, note =	"McGill technical report SOCS-94.50"
-, keywords =	"graph drawing, visibility"
-, precedes =	"behflmrrswz-vrg3d-98"
-, update =	"98.07 rote, 98.03 mitchell, 97.03 rote, 96.09 romanik"
+, author =      "P. Bose and H. Everett and S{\'a}ndor P. Fekete and A. Lubiw and H. Meijer and K. Romanik and T. Shermer and S. Whitesides"
+, title =       "On a Visibility Representation for Graphs in Three Dimensions"
+, editor =      "D. Avis and P. Bose"
+, booktitle =   "Snapshots in Computational and Discrete Geometry, Volume III"
+, publisher =   "McGill University"
+, month =       jul
+, year =        1994
+, pages =       "2--25"
+, note =        "McGill technical report SOCS-94.50"
+, keywords =    "graph drawing, visibility"
+, precedes =    "behflmrrswz-vrg3d-98"
+, update =      "98.07 rote, 98.03 mitchell, 97.03 rote, 96.09 romanik"
 }
 
 @article{behflmrrswz-vrg3d-98
-, author =	"P. Bose and H. Everett and Michael E. Houle and S{\'a}ndor P. Fekete and A. Lubiw and H. Meijer and K. Romanik and G{\"u}nter Rote and T. Shermer and S. Whitesides and Christian Zelle"
-, title =	"A visibility representation for graphs in three dimensions"
-, journal =	"J. Graph Algorithms Appl."
-, volume =	2
-, number =	3
-, year =	1998
-, pages =	"1--16"
-, keywords =	"graph drawing, visibility"
-, succeeds =	"beflmrsw-ovrg3d-94, fhw-nrvrg-96"
-, update =	"98.07 rote, 98.03 mitchell, 97.11 orourke, 97.03 rote"
-, abstract =	"We propose a 3-dimensional visibility representation of graphs
-		in which vertices are mapped to horizontal axis-parallel
-		rectangles floating in 3-space, with edges represented by
-		vertical lines of sight. We apply an extension of the
-		{Erd\H os}-Szekeres Theorem in a geometric setting to obtain an
-		upper bound of 56 for size of the largest complete graph which
-		is representable. On the other hand, we construct a
-		representation of the complete graph with 22 vertices.
-		These are the best existing bounds."
+, author =      "P. Bose and H. Everett and Michael E. Houle and S{\'a}ndor P. Fekete and A. Lubiw and H. Meijer and K. Romanik and G{\"u}nter Rote and T. Shermer and S. Whitesides and Christian Zelle"
+, title =       "A visibility representation for graphs in three dimensions"
+, journal =     "J. Graph Algorithms Appl."
+, volume =      2
+, number =      3
+, year =        1998
+, pages =       "1--16"
+, keywords =    "graph drawing, visibility"
+, succeeds =    "beflmrsw-ovrg3d-94, fhw-nrvrg-96"
+, update =      "98.07 rote, 98.03 mitchell, 97.11 orourke, 97.03 rote"
+, abstract =    "We propose a 3-dimensional visibility representation of graphs
+                in which vertices are mapped to horizontal axis-parallel
+                rectangles floating in 3-space, with edges represented by
+                vertical lines of sight. We apply an extension of the
+                {Erd\H os}-Szekeres Theorem in a geometric setting to obtain an
+                upper bound of 56 for size of the largest complete graph which
+                is representable. On the other hand, we construct a
+                representation of the complete graph with 22 vertices.
+                These are the best existing bounds."
 }
 
 @inproceedings{bew-pag-98
-, author =	"P. Bose and H. Everett and S. K. Wismath"
-, title =	"Properties of Arragement Graphs"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"45--47"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "P. Bose and H. Everett and S. K. Wismath"
+, title =       "Properties of Arragement Graphs"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "45--47"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{bgrt-dnpos-96
-, author =	"Prosenjit Bose and Francisco Gomez and Pedro Ramos and Godfried T. Toussaint"
-, title =	"Drawing nice projections of objects in space"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"52--63"
-, update =	"98.07 orourke"
+, author =      "Prosenjit Bose and Francisco Gomez and Pedro Ramos and Godfried T. Toussaint"
+, title =       "Drawing nice projections of objects in space"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "52--63"
+, update =      "98.07 orourke"
 }
 
 @inproceedings{bglosu-fp-93
-, author =	"P. Bose and Leonidas J. Guibas and A. Lubiw and M. Overmars and D. Souvaine and J. Urrutia"
-, title =	"The floodlight problem"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"399--404"
-, precedes =	"bglosu-fp-97"
-, cites =	"cru-glmvg-89, cru-irtp-93, e-acg-87, o-agta-87, ps-cgi-85, bfprt-tbs-73, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 97.07 devillers, 93.09 milone+mitchell"
+, author =      "P. Bose and Leonidas J. Guibas and A. Lubiw and M. Overmars and D. Souvaine and J. Urrutia"
+, title =       "The floodlight problem"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "399--404"
+, precedes =    "bglosu-fp-97"
+, cites =       "cru-glmvg-89, cru-irtp-93, e-acg-87, o-agta-87, ps-cgi-85, bfprt-tbs-73, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 97.07 devillers, 93.09 milone+mitchell"
 }
 
 @article{bglosu-fp-97
-, author =	"P. Bose and Leonidas J. Guibas and A. Lubiw and M. Overmars and D. Souvaine and J. Urrutia"
-, title =	"The floodlight problem"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"153--163"
-, succeeds =	"bglosu-fp-93"
-, update =	"98.03 mitchell, 97.07 devillers"
+, author =      "P. Bose and Leonidas J. Guibas and A. Lubiw and M. Overmars and D. Souvaine and J. Urrutia"
+, title =       "The floodlight problem"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "153--163"
+, succeeds =    "bglosu-fp-93"
+, update =      "98.03 mitchell, 97.07 devillers"
 }
 
 @inproceedings{bht-esdls-94
-, author =	"P. Bose and M. E. Houle and G. Toussaint"
-, title =	"Every Set of Disjoint Line Segments Admits a Binary Tree"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"??"
-, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
+, author =      "P. Bose and M. E. Houle and G. Toussaint"
+, title =       "Every Set of Disjoint Line Segments Admits a Binary Tree"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "??"
+, update =      "99.11 bibrelex, 98.03 smid, 96.05 mitchell"
 }
 
 @article{bht-esdls-01
-, author =	"P. Bose and M. E. Houle and G. T. Toussaint"
-, title =	"Every Set of Disjoint Line Segments Admits a Binary Tree"
-, journal =	"Discrete Comput. Geom."
-, volume =	26
-, year =	2001
-, pages =	"387--410"
-, update =	"02.03 smid"
+, author =      "P. Bose and M. E. Houle and G. T. Toussaint"
+, title =       "Every Set of Disjoint Line Segments Admits a Binary Tree"
+, journal =     "Discrete Comput. Geom."
+, volume =      26
+, year =        2001
+, pages =       "387--410"
+, update =      "02.03 smid"
 }
 
 @inproceedings{bhot-aaop-95
-, author =	"Prosenjit Bose and Ferran Hurtado-Diaz and Elsa Oma{\~n}a-Pulido and Godfried Toussaint"
-, title =	"Aperture Angle Optimization Problems"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"73--78"
-, update =	"95.09 jones"
+, author =      "Prosenjit Bose and Ferran Hurtado-Diaz and Elsa Oma{\~n}a-Pulido and Godfried Toussaint"
+, title =       "Aperture Angle Optimization Problems"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "73--78"
+, update =      "95.09 jones"
 }
 
 @article{bhot-oaa-93
-, author =	"P. Bose and F. Hurtado and E. Oman{\~n}a and G. T. Toussaint"
-, title =	"Optimizaci{\'o}n del {\`a}ngulo de apertura"
-, journal =	"Actas del {IV} Encuentro Espan{\~n}ol de Geometr{\'i}a Computacional"
-, volume =	"??"
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "P. Bose and F. Hurtado and E. Oman{\~n}a and G. T. Toussaint"
+, title =       "Optimizaci{\'o}n del {\`a}ngulo de apertura"
+, journal =     "Actas del {IV} Encuentro Espan{\~n}ol de Geometr{\'i}a Computacional"
+, volume =      "??"
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @incollection{bjmo-kibvg-94
-, author =	"P. Bose and A. Josefczyk and J. Miller and J. O'Rourke"
-, title =	"{$K_{42}$} is a box visibility graph"
-, booktitle =	"Snapshots of Computational and Discrete Geometry"
-, volume =	3
-, publisher =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, month =	jul
-, year =	1994
-, pages =	"88--91"
-, note =	"Technical Report SOCS-94.50"
-, keywords =	"visibility graphs"
-, comments =	"Also Technical Report 035, Dept. Comput. Sci., Smith College"
-, update =	"94.09 orourke"
+, author =      "P. Bose and A. Josefczyk and J. Miller and J. O'Rourke"
+, title =       "{$K_{42}$} is a box visibility graph"
+, booktitle =   "Snapshots of Computational and Discrete Geometry"
+, volume =      3
+, publisher =   "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, month =       jul
+, year =        1994
+, pages =       "88--91"
+, note =        "Technical Report SOCS-94.50"
+, keywords =    "visibility graphs"
+, comments =    "Also Technical Report 035, Dept. Comput. Sci., Smith College"
+, update =      "94.09 orourke"
 }
 
 @inproceedings{bkl-eagis-96
-, author =	"P. Bose and D. Kirkpatrick and Z. Li"
-, title =	"Efficient algorithms for guarding or illuminating the surface of a polyhedral terrain"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"217--222"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "P. Bose and D. Kirkpatrick and Z. Li"
+, title =       "Efficient algorithms for guarding or illuminating the surface of a polyhedral terrain"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "217--222"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{bkt-fpm-93
-, author =	"Prosenjit Bose and Marc van Kreveld and Godfried Toussaint"
-, title =	"Filling Polyhedral Molds"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"210--221"
-, update =	"93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "Prosenjit Bose and Marc van Kreveld and Godfried Toussaint"
+, title =       "Filling Polyhedral Molds"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "210--221"
+, update =      "93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @article{bkt-fpm-98
-, author =	"P. Bose and M. van Kreveld and G. Toussaint"
-, title =	"Filling Polyhedral Molds"
-, journal =	"Comput. Aided Design"
-, volume =	30
-, number =	4
-, month =	apr
-, year =	1998
-, pages =	"245--254"
-, update =	"98.07 held"
+, author =      "P. Bose and M. van Kreveld and G. Toussaint"
+, title =       "Filling Polyhedral Molds"
+, journal =     "Comput. Aided Design"
+, volume =      30
+, number =      4
+, month =       apr
+, year =        1998
+, pages =       "245--254"
+, update =      "98.07 held"
 }
 
 @techreport{bll-cpt-93t
-, author =	"P. Bose and W. Lenhart and G. Liotta"
-, title =	"Characterizing proximity trees"
-, type =	"Technical Report"
-, number =	"SOCS 93.9"
-, institution =	"School of Computer Science, McGill University"
-, address =	"Montr{\'e}al, Quebec"
-, year =	1993
-, precedes =	"bll-cpt-93, bll-cpt-96"
-, update =	"98.11 bibrelex"
+, author =      "P. Bose and W. Lenhart and G. Liotta"
+, title =       "Characterizing proximity trees"
+, type =        "Technical Report"
+, number =      "SOCS 93.9"
+, institution = "School of Computer Science, McGill University"
+, address =     "Montr{\'e}al, Quebec"
+, year =        1993
+, precedes =    "bll-cpt-93, bll-cpt-96"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{bll-cpt-93
-, author =	"P. Bose and W. Lenhart and G. Liotta"
-, title =	"Characterizing proximity trees"
-, booktitle =	"Graph Drawing (Proc. GD '93)"
-, year =	1993
-, succeeds =	"bll-cpt-93t"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "P. Bose and W. Lenhart and G. Liotta"
+, title =       "Characterizing proximity trees"
+, booktitle =   "Graph Drawing (Proc. GD '93)"
+, year =        1993
+, succeeds =    "bll-cpt-93t"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{bll-cpt-96
-, author =	"P. Bose and W. Lenhart and G. Liotta"
-, title =	"Characterizing Proximity Trees"
-, journal =	"Algorithmica"
-, volume =	16
-, year =	1996
-, pages =	"83--110"
-, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
-, keywords =	"graph drawing, proximity"
-, succeeds =	"bll-cpt-93t"
-, update =	"98.11 bibrelex, 96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
+, author =      "P. Bose and W. Lenhart and G. Liotta"
+, title =       "Characterizing Proximity Trees"
+, journal =     "Algorithmica"
+, volume =      16
+, year =        1996
+, pages =       "83--110"
+, note =        "(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
+, keywords =    "graph drawing, proximity"
+, succeeds =    "bll-cpt-93t"
+, update =      "98.11 bibrelex, 96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
 }
 
 @inproceedings{blm-evqsp-92
-, author =	"P. Bose and A. Lubiw and J. I. Munro"
-, title =	"Efficient visibility queries in simple polygons"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"23--28"
-, cites =	"bm-gta-76, b-vsp-91, gmr-rlptd-92, k-osps-83, lp-lppsi-77, o-agta-87, p-nappl-81, ps-cgi-85, st-pplup-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. Bose and A. Lubiw and J. I. Munro"
+, title =       "Efficient visibility queries in simple polygons"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "23--28"
+, cites =       "bm-gta-76, b-vsp-91, gmr-rlptd-92, k-osps-83, lp-lppsi-77, o-agta-87, p-nappl-81, ps-cgi-85, st-pplup-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bmmm-gpp-01
-, author =	"Prosenjit Bose and Anil Maheshwari and Pat Morin and Jason Morrison"
-, title =	"The Grid Placement Problem"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"74--77"
-, update =	"01.04 icking"
+, author =      "Prosenjit Bose and Anil Maheshwari and Pat Morin and Jason Morrison"
+, title =       "The Grid Placement Problem"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "74--77"
+, update =      "01.04 icking"
 }
 
 @inproceedings{bm-ort-99
-, author =	"P. Bose and P. Morin"
-, title =	"Online routing in triangulations"
-, booktitle =	"Proc. 10th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '99"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1741
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"113--122"
-, update =	"00.03 smid"
+, author =      "P. Bose and P. Morin"
+, title =       "Online routing in triangulations"
+, booktitle =   "Proc. 10th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '99"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1741
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "113--122"
+, update =      "00.03 smid"
 }
 
 @inproceedings{brtt-ecqas-96
-, author =	"Prosenjit Bose and Suneeta Ramaswami and Godfried Toussaint and Alain Turki"
-, title =	"Experimental Comparison of Quadrangulation Algorithms for Sets of Points"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"39--40"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Prosenjit Bose and Suneeta Ramaswami and Godfried Toussaint and Alain Turki"
+, title =       "Experimental Comparison of Quadrangulation Algorithms for Sets of Points"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "39--40"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @techreport{bstz-gpt-92
-, author =	"P. Bose and T. Shermer and G. Toussaint and B. Zhu"
-, title =	"Guarding polyhedral terrains"
-, type =	"Technical Report"
-, number =	"SOCS-92.20"
-, institution =	"McGill University"
-, year =	1992
-, precedes =	"bstz-gpt-97"
-, update =	"98.11 bibrelex"
+, author =      "P. Bose and T. Shermer and G. Toussaint and B. Zhu"
+, title =       "Guarding polyhedral terrains"
+, type =        "Technical Report"
+, number =      "SOCS-92.20"
+, institution = "McGill University"
+, year =        1992
+, precedes =    "bstz-gpt-97"
+, update =      "98.11 bibrelex"
 }
 
 @article{bstz-gpt-97
-, author =	"P. Bose and T. Shermer and G. Toussaint and B. Zhu"
-, title =	"Guarding polyhedral terrains"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"173--185"
-, succeeds =	"bstz-gpt-92"
-, update =	"98.11 bibrelex, 97.03 devillers"
+, author =      "P. Bose and T. Shermer and G. Toussaint and B. Zhu"
+, title =       "Guarding polyhedral terrains"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "173--185"
+, succeeds =    "bstz-gpt-92"
+, update =      "98.11 bibrelex, 97.03 devillers"
 }
 
 @article{bt-cecqp-97
-, author =	"Prosenjit Bose and Godfried Toussaint"
-, title =	"Characterizing and Efficiently Computing Quadrangulations of Planar Point Sets"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	14
-, year =	1997
-, pages =	"763--785"
-, comments =	"See also \cite{ahms-htfr-96}, where some similar facts are
+, author =      "Prosenjit Bose and Godfried Toussaint"
+, title =       "Characterizing and Efficiently Computing Quadrangulations of Planar Point Sets"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      14
+, year =        1997
+, pages =       "763--785"
+, comments =    "See also \cite{ahms-htfr-96}, where some similar facts are
                   shown."
-, succeeds =	"bt-nqieo-95"
-, update =	"98.03 mitchell"
+, succeeds =    "bt-nqieo-95"
+, update =      "98.03 mitchell"
 }
 
 @techreport{bt-gcaim-92
-, author =	"P. Bose and G. Toussaint"
-, title =	"Geometric and computational aspects of injection molding"
-, type =	"Technical Report"
-, number =	"SOCS 92.16"
-, institution =	"School of Computer Science, McGill University"
-, address =	"Canada"
-, year =	1992
-, precedes =	"bt-gcaim-93"
-, update =	"98.11 bibrelex"
+, author =      "P. Bose and G. Toussaint"
+, title =       "Geometric and computational aspects of injection molding"
+, type =        "Technical Report"
+, number =      "SOCS 92.16"
+, institution = "School of Computer Science, McGill University"
+, address =     "Canada"
+, year =        1992
+, precedes =    "bt-gcaim-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{bt-gcaim-93
-, author =	"P. Bose and G. Toussaint"
-, title =	"Geometric and computational aspects of injection molding"
-, booktitle =	"Proc. 3rd. Internat. Conf. CAD Comput. Graph."
-, site =	"Beijing, China"
-, year =	1993
-, pages =	"237--242"
-, succeeds =	"bt-gcaim-92"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "P. Bose and G. Toussaint"
+, title =       "Geometric and computational aspects of injection molding"
+, booktitle =   "Proc. 3rd. Internat. Conf. CAD Comput. Graph."
+, site =        "Beijing, China"
+, year =        1993
+, pages =       "237--242"
+, succeeds =    "bt-gcaim-92"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{bt-gcamp-94
-, author =	"P. Bose and G. Toussaint"
-, title =	"Geometric and computational aspects of manufacturing processes"
-, journal =	"Comput. \& Graphics"
-, volume =	18
-, year =	1994
-, pages =	"487--497"
-, update =	"97.03 schwarzkopf"
+, author =      "P. Bose and G. Toussaint"
+, title =       "Geometric and computational aspects of manufacturing processes"
+, journal =     "Comput. \& Graphics"
+, volume =      18
+, year =        1994
+, pages =       "487--497"
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{bt-gtfb-93
-, author =	"Prosenjit Bose and Godfried Toussaint"
-, title =	"Growing a tree from its branches"
-, booktitle =	"Proc. First Pacific Conf. Computer Graphics Appl., Seoul, Korea, vol. 1"
-, volume =	1
-, publisher =	"World Scientific Publishing Co."
-, year =	1993
-, pages =	"90--99"
-, keywords =	"segments, points, minimal spanning tree, lower bounds"
-, update =	"96.05 smid, 95.09 korneenko"
-, annote =	"Non-crossing spanning tree for ends of disjoint plane segments,
+, author =      "Prosenjit Bose and Godfried Toussaint"
+, title =       "Growing a tree from its branches"
+, booktitle =   "Proc. First Pacific Conf. Computer Graphics Appl., Seoul, Korea, vol. 1"
+, volume =      1
+, publisher =   "World Scientific Publishing Co."
+, year =        1993
+, pages =       "90--99"
+, keywords =    "segments, points, minimal spanning tree, lower bounds"
+, update =      "96.05 smid, 95.09 korneenko"
+, annote =      "Non-crossing spanning tree for ends of disjoint plane segments,
   that includes these segments as its edges, in $\Omega(n \log n)$."
 }
 
 @inproceedings{bt-nqieo-95
-, author =	"Prosenjit Bose and Godfried Toussaint"
-, title =	"No Quadrangulation is Extremely Odd"
-, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1004
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"372--381"
-, precedes =	"bt-cecqp-97"
-, update =	"98.07 bibrelex, 98.03 mitchell, 96.01 smid, 95.09 mitchell"
+, author =      "Prosenjit Bose and Godfried Toussaint"
+, title =       "No Quadrangulation is Extremely Odd"
+, booktitle =   "Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1004
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "372--381"
+, precedes =    "bt-cecqp-97"
+, update =      "98.07 bibrelex, 98.03 mitchell, 96.01 smid, 95.09 mitchell"
 }
 
 @mastersthesis{b-vsp-91
-, author =	"Prosenjit K. Bose"
-, title =	"Visibility in simple polygons"
-, school =	"Department of Computer Science, University of Waterloo"
-, year =	1991
-, keywords =	"master thesis"
+, author =      "Prosenjit K. Bose"
+, title =       "Visibility in simple polygons"
+, school =      "Department of Computer Science, University of Waterloo"
+, year =        1991
+, keywords =    "master thesis"
 }
 
 @inproceedings{bh-pmamg-96
-, author =	"Frank J. Bossen and Paul S. Heckbert"
-, title =	"A pliant method for anisotropic mesh generation"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"63--74"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Frank J. Bossen and Paul S. Heckbert"
+, title =       "A pliant method for anisotropic mesh generation"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "63--74"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @inproceedings{b-cahs-93
-, author =	"R. A. Botafogo"
-, title =	"Cluster Analysis for Hypertext Systems"
-, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
-, year =	1993
-, pages =	"116--125"
-, keywords =	"Aggregation, Clustering, Structural analysis, Hypertext, Graph theory"
-, update =	"98.07 agarwal"
+, author =      "R. A. Botafogo"
+, title =       "Cluster Analysis for Hypertext Systems"
+, booktitle =   "Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
+, year =        1993
+, pages =       "116--125"
+, keywords =    "Aggregation, Clustering, Structural analysis, Hypertext, Graph theory"
+, update =      "98.07 agarwal"
 }
 
 @book{bt-dfat-82
-, author =	"R. Bott and L. W. Tu"
-, title =	"Differentiable forms in algebraic topology"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "R. Bott and L. W. Tu"
+, title =       "Differentiable forms in algebraic topology"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @article{bv-lsedn-77
-, author =	"O. Bottema and G. R. Veldkamp"
-, title =	"On the lines in space with equal distances to $n$ given points"
-, journal =	"Geom. Dedicata"
-, volume =	6
-, year =	1977
-, pages =	"121--129"
-, update =	"01.07 devillers"
+, author =      "O. Bottema and G. R. Veldkamp"
+, title =       "On the lines in space with equal distances to $n$ given points"
+, journal =     "Geom. Dedicata"
+, volume =      6
+, year =        1977
+, pages =       "121--129"
+, update =      "01.07 devillers"
 }
 
 @article{b-ihca-84
-, author =	"A. Boucher"
-, title =	"It's hard to color antirectangles"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	5
-, number =	2
-, year =	1984
-, pages =	"162--163"
-, keywords =	"isothetic"
-, update =	"95.05 korneenko"
+, author =      "A. Boucher"
+, title =       "It's hard to color antirectangles"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      5
+, number =      2
+, year =        1984
+, pages =       "162--163"
+, keywords =    "isothetic"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bfhcp-gcs-93
-, author =	"W. Bouma and I. Fudos and C. Hoffmann and J. Cai and R. Paige"
-, title =	"A geometric constraint solver"
-, type =	"Technical {Report}"
-, number =	"CSD-TR-93-054"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1993
-, update =	"98.07 bibrelex"
+, author =      "W. Bouma and I. Fudos and C. Hoffmann and J. Cai and R. Paige"
+, title =       "A geometric constraint solver"
+, type =        "Technical {Report}"
+, number =      "CSD-TR-93-054"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1993
+, update =      "98.07 bibrelex"
 }
 
 @incollection{bv-vbcd-95
-, author =	"W. Bouma and G. {Van{\v e}{\v c}ek Jr.}"
-, title =	"Velocity-based collision detection"
-, editor =	"A. Paeth"
-, booktitle =	"Graphics Gems V"
-, publisher =	"Academic Press"
-, year =	1995
-, update =	"98.07 bibrelex"
+, author =      "W. Bouma and G. {Van{\v e}{\v c}ek Jr.}"
+, title =       "Velocity-based collision detection"
+, editor =      "A. Paeth"
+, booktitle =   "Graphics Gems V"
+, publisher =   "Academic Press"
+, year =        1995
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bv-cdapb-91
-, author =	"W. J. Bouma and G. {Van{\v e}{\v c}ek Jr.}"
-, title =	"Collision Detection and Analysis in a Physically Based Simulation"
-, booktitle =	"Second Eurographics Workshop on Animation and Simulation"
-, year =	1991
-, update =	"95.01 mitchell"
+, author =      "W. J. Bouma and G. {Van{\v e}{\v c}ek Jr.}"
+, title =       "Collision Detection and Analysis in a Physically Based Simulation"
+, booktitle =   "Second Eurographics Workshop on Animation and Simulation"
+, year =        1991
+, update =      "95.01 mitchell"
 }
 
 @inbook{b-geadl-68
-, author =	"N. Bourbaki"
-, title =	"Groupes et alg{\`e}bres de Lie"
-, chapter =	"4, 5, 6"
-, publisher =	"Hermann"
-, address =	"Paris, France"
-, year =	1968
-, update =	"97.11 bibrelex"
+, author =      "N. Bourbaki"
+, title =       "Groupes et alg{\`e}bres de Lie"
+, chapter =     "4, 5, 6"
+, publisher =   "Hermann"
+, address =     "Paris, France"
+, year =        1968
+, update =      "97.11 bibrelex"
 }
 
 @article{bs-gtovl-89
-, author =	"N. G. Bourbakis and I. N. Savvides"
-, title =	"Geometric transformations for optimal {VLSI} layout placement"
-, journal =	"Microproc. and Microprogr."
-, volume =	25
-, number =	"1--4"
-, year =	1989
-, pages =	"163--170"
-, keywords =	"VLSI design, placement"
-, update =	"95.05 korneenko"
+, author =      "N. G. Bourbakis and I. N. Savvides"
+, title =       "Geometric transformations for optimal {VLSI} layout placement"
+, journal =     "Microproc. and Microprogr."
+, volume =      25
+, number =      "1--4"
+, year =        1989
+, pages =       "163--170"
+, keywords =    "VLSI design, placement"
+, update =      "95.05 korneenko"
 }
 
 @article{bl-abmss-93
-, author =	"J. Bourgain and Joram Lindenstrauss"
-, title =	"Approximating the ball by a {Minkowski} sum of segments with equal length"
-, journal =	"Discrete Comput. Geom."
-, volume =	9
-, year =	1993
-, pages =	"131--144"
-, update =	"96.05 ramkumar"
+, author =      "J. Bourgain and Joram Lindenstrauss"
+, title =       "Approximating the ball by a {Minkowski} sum of segments with equal length"
+, journal =     "Discrete Comput. Geom."
+, volume =      9
+, year =        1993
+, pages =       "131--144"
+, update =      "96.05 ramkumar"
 }
 
 %   is CAMS really the institution??
 @techreport{br-t-91
-, author =	"M. Bousset and P. Rosenstiehl"
-, title =	"Twist"
-, number =	"P.073"
-, institution =	"CAMS"
-, year =	1991
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. Bousset and P. Rosenstiehl"
+, title =       "Twist"
+, number =      "P.073"
+, institution = "CAMS"
+, year =        1991
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{bc-mgrfc-92
-, author =	"S. W. Bova and G. F. Carey"
-, title =	"Mesh generation/refinement using fractal concepts and iterated function systems"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	33
-, year =	1992
-, pages =	"287--305"
-, update =	"98.11 bibrelex"
+, author =      "S. W. Bova and G. F. Carey"
+, title =       "Mesh generation/refinement using fractal concepts and iterated function systems"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      33
+, year =        1992
+, pages =       "287--305"
+, update =      "98.11 bibrelex"
 }
 
 @article{b-cdt-81
-, author =	"A. Bowyer"
-, title =	"Computing {Dirichlet} Tessellations"
-, journal =	"Comput. J."
-, volume =	24
-, year =	1981
-, pages =	"162--166"
+, author =      "A. Bowyer"
+, title =       "Computing {Dirichlet} Tessellations"
+, journal =     "Comput. J."
+, volume =      24
+, year =        1981
+, pages =       "162--166"
 }
 
 @techreport{b-mpump-85
-, author =	"A. Bowyer"
-, title =	"Matching patterns using a modified procrustean algorithm"
-, type =	"Report"
-, number =	"??"
-, institution =	"School Engrg., Univ. Bath"
-, address =	"Bath, England"
-, year =	1985
+, author =      "A. Bowyer"
+, title =       "Matching patterns using a modified procrustean algorithm"
+, type =        "Report"
+, number =      "??"
+, institution = "School Engrg., Univ. Bath"
+, address =     "Bath, England"
+, year =        1985
 }
 
 @book{bw-pg-83
-, author =	"A. Bowyer and J. R. Woodwork"
-, title =	"A programmer's geometry"
-, publisher =	"Butterworths"
-, year =	1983
-, update =	"98.07 bibrelex, 95.05 korneenko"
+, author =      "A. Bowyer and J. R. Woodwork"
+, title =       "A programmer's geometry"
+, publisher =   "Butterworths"
+, year =        1983
+, update =      "98.07 bibrelex, 95.05 korneenko"
 }
 
 @article{bd-agisr-90
-, author =	"K. W. Bowyer and C. R. Dyer"
-, title =	"Aspect graphs: {An} introduction and survey of recent results"
-, journal =	"Int. J. of Imaging Systems and Technology"
-, volume =	2
-, year =	1990
-, pages =	"315--328"
-, update =	"98.03 agarwal"
+, author =      "K. W. Bowyer and C. R. Dyer"
+, title =       "Aspect graphs: {An} introduction and survey of recent results"
+, journal =     "Int. J. of Imaging Systems and Technology"
+, volume =      2
+, year =        1990
+, pages =       "315--328"
+, update =      "98.03 agarwal"
 }
 
 @article{bm-pccma-89
-, author =	"L. Boxer and R. Miller"
-, title =	"A parallel circle-cover minimization algorithm"
-, journal =	"Inform. Process. Lett."
-, volume =	32
-, number =	2
-, year =	1989
-, pages =	"57--60"
-, keywords =	"parallel computations, circles, covering, optimization"
-, update =	"95.05 korneenko"
+, author =      "L. Boxer and R. Miller"
+, title =       "A parallel circle-cover minimization algorithm"
+, journal =     "Inform. Process. Lett."
+, volume =      32
+, number =      2
+, year =        1989
+, pages =       "57--60"
+, keywords =    "parallel computations, circles, covering, optimization"
+, update =      "95.05 korneenko"
 }
 
 @article{bm-cip-90
-, author =	"L. Boxer and R. Miller"
-, title =	"Common intersection of polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	33
-, number =	5
-, year =	1990
-, pages =	"249--254"
-, keywords =	"convex polygons, intersection, parallel computations"
-, update =	"95.05 korneenko"
+, author =      "L. Boxer and R. Miller"
+, title =       "Common intersection of polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      33
+, number =      5
+, year =        1990
+, pages =       "249--254"
+, keywords =    "convex polygons, intersection, parallel computations"
+, update =      "95.05 korneenko"
 }
 
 @article{bm-ccipi-90
-, author =	"L. Boxer and R. Miller"
-, title =	"Corrigenda ``{Common} intersections of polygons, {Inf}.{Proc}.{Lett}. 33(1990) 249-254''"
-, journal =	"Inform. Process. Lett."
-, volume =	35
-, number =	1
-, year =	1990
-, pages =	53
-, keywords =	"convex polygons, intersection, parallel computations"
-, update =	"95.05 korneenko"
+, author =      "L. Boxer and R. Miller"
+, title =       "Corrigenda ``{Common} intersections of polygons, {Inf}.{Proc}.{Lett}. 33(1990) 249-254''"
+, journal =     "Inform. Process. Lett."
+, volume =      35
+, number =      1
+, year =        1990
+, pages =       53
+, keywords =    "convex polygons, intersection, parallel computations"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bm-dcgmh-88
-, author =	"L. Boxer and R. Miller"
-, title =	"Dynamic computational geometry on meshes and hypercubes"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, volume =	1
-, year =	1988
-, pages =	"323--330"
-, keywords =	"parallel computation, proximity, intersection, convex hull, diameter, containment"
-, update =	"95.05 korneenko"
+, author =      "L. Boxer and R. Miller"
+, title =       "Dynamic computational geometry on meshes and hypercubes"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, volume =      1
+, year =        1988
+, pages =       "323--330"
+, keywords =    "parallel computation, proximity, intersection, convex hull, diameter, containment"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bm-dcgpc-88
-, author =	"L. Boxer and R. Miller"
-, title =	"Dynamic computational geometry on parallel computers"
-, booktitle =	"Proc. Conf. Hypercube Concurr. Comput. Appl., Pasadena"
-, publisher =	"ACM Press"
-, year =	1988
-, pages =	"1212--1219"
-, keywords =	"parallel computation"
-, update =	"95.05 korneenko"
+, author =      "L. Boxer and R. Miller"
+, title =       "Dynamic computational geometry on parallel computers"
+, booktitle =   "Proc. Conf. Hypercube Concurr. Comput. Appl., Pasadena"
+, publisher =   "ACM Press"
+, year =        1988
+, pages =       "1212--1219"
+, keywords =    "parallel computation"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bm-pdcg-87
-, author =	"L. Boxer and R. Miller"
-, title =	"Parallel dynamic computational geometry"
-, type =	"Report"
-, number =	"87-11"
-, institution =	"Dept. Comput. Sci., SUNY-Buffalo"
-, year =	1987
-, update =	"96.09 orourke"
+, author =      "L. Boxer and R. Miller"
+, title =       "Parallel dynamic computational geometry"
+, type =        "Report"
+, number =      "87-11"
+, institution = "Dept. Comput. Sci., SUNY-Buffalo"
+, year =        1987
+, update =      "96.09 orourke"
 }
 
 @article{bm-pdcg-89
-, author =	"L. Boxer and R. Miller"
-, title =	"Parallel dynamic computational geometry"
-, journal =	"J. New Generation Comput. Syst."
-, volume =	2
-, number =	3
-, year =	1989
-, pages =	"227--246"
-, keywords =	"parallel computation"
-, update =	"95.05 korneenko"
+, author =      "L. Boxer and R. Miller"
+, title =       "Parallel dynamic computational geometry"
+, journal =     "J. New Generation Comput. Syst."
+, volume =      2
+, number =      3
+, year =        1989
+, pages =       "227--246"
+, keywords =    "parallel computation"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bddg-fep-82
-, author =	"J. E. Boyce and D. P. Dobkin and R. L. {Drysdale, III} and Leonidas J. Guibas"
-, title =	"Finding extremal polygons"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Theory Comput."
-, year =	1982
-, pages =	"282--289"
-, keywords =	"polygons, maximum, dynamic programming"
-, precedes =	"bddg-fep-85"
-, update =	"98.03 mitchell"
+, author =      "J. E. Boyce and D. P. Dobkin and R. L. {Drysdale, III} and Leonidas J. Guibas"
+, title =       "Finding extremal polygons"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Theory Comput."
+, year =        1982
+, pages =       "282--289"
+, keywords =    "polygons, maximum, dynamic programming"
+, precedes =    "bddg-fep-85"
+, update =      "98.03 mitchell"
 }
 
 @article{bddg-fep-85
-, author =	"J. E. Boyce and D. P. Dobkin and R. L. {Drysdale, III} and Leonidas J. Guibas"
-, title =	"Finding extremal polygons"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"134--147"
-, keywords =	"polygons, maximum, dynamic programming"
-, succeeds =	"bddg-fep-82"
-, update =	"98.03 mitchell"
+, author =      "J. E. Boyce and D. P. Dobkin and R. L. {Drysdale, III} and Leonidas J. Guibas"
+, title =       "Finding extremal polygons"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "134--147"
+, keywords =    "polygons, maximum, dynamic programming"
+, succeeds =    "bddg-fep-82"
+, update =      "98.03 mitchell"
 }
 
 @article{b-ipfst-77
-, author =	"W. M. Boyce"
-, title =	"An improved program for the full {Steiner} tree problem"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	3
-, year =	1977
-, pages =	"359--385"
+, author =      "W. M. Boyce"
+, title =       "An improved program for the full {Steiner} tree problem"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      3
+, year =        1977
+, pages =       "359--385"
 }
 
 @techreport{bs-s72iv-73
-, author =	"W. M. Boyce and J. E. Seery"
-, title =	"{STEINER} 72: {An} improved version of {Cockayne} and {Schiller}'s program {STEINER} for the minimal network problem"
-, type =	"Report"
-, number =	35
-, institution =	"Comput. Sci. Center, Bell Lab."
-, address =	"Murray Hill, NJ"
-, year =	1973
+, author =      "W. M. Boyce and J. E. Seery"
+, title =       "{STEINER} 72: {An} improved version of {Cockayne} and {Schiller}'s program {STEINER} for the minimal network problem"
+, type =        "Report"
+, number =      35
+, institution = "Comput. Sci. Center, Bell Lab."
+, address =     "Murray Hill, NJ"
+, year =        1973
 }
 
 @incollection{b-amm-90
-, author =	"D. B. Boyd"
-, title =	"Aspects of molecular modeling"
-, editor =	"K. Lipkowitz and D. B. Boyd"
-, booktitle =	"Reviews in Computational Chemistry"
-, volume =	1
-, publisher =	"VCH Publishers"
-, year =	1990
-, pages =	"321--351"
-, update =	"98.07 bibrelex"
+, author =      "D. B. Boyd"
+, title =       "Aspects of molecular modeling"
+, editor =      "K. Lipkowitz and D. B. Boyd"
+, booktitle =   "Reviews in Computational Chemistry"
+, volume =      1
+, publisher =   "VCH Publishers"
+, year =        1990
+, pages =       "321--351"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bp-ri-01
-, author =	"Edmond Boyer and Sylvain Petitjean"
-, title =	"Regular Interpolants"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"125--128"
-, update =	"01.04 icking"
+, author =      "Edmond Boyer and Sylvain Petitjean"
+, title =       "Regular Interpolants"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "125--128"
+, update =      "01.04 icking"
 }
 
 @article{bp-adiic-76
-, author =	"M. Boyer and L. Paquette"
-, title =	"An algorithm to decide if the intersection of convex polyhedral cones has a non empty interior"
-, journal =	"BIT"
-, volume =	16
-, year =	1976
-, pages =	"459--461"
+, author =      "M. Boyer and L. Paquette"
+, title =       "An algorithm to decide if the intersection of convex polyhedral cones has a non empty interior"
+, journal =     "BIT"
+, volume =      16
+, year =        1976
+, pages =       "459--461"
 }
 
 @article{bs-iftmo-92
-, author =	"M. Boyer and N. F. Stewart"
-, title =	"Imperfect-form tolerancing on manifold objects: a metric approach"
-, journal =	"Internat. J. Robot. Res."
-, volume =	11
-, number =	5
-, year =	1992
-, pages =	"482--490"
-, update =	"98.07 bibrelex"
+, author =      "M. Boyer and N. F. Stewart"
+, title =       "Imperfect-form tolerancing on manifold objects: a metric approach"
+, journal =     "Internat. J. Robot. Res."
+, volume =      11
+, number =      5
+, year =        1992
+, pages =       "482--490"
+, update =      "98.07 bibrelex"
 }
 
 @article{bs-msto-91
-, author =	"M. Boyer and N. F. Stewart"
-, title =	"Modeling spaces for toleranced objects"
-, journal =	"Internat. J. Robot. Res."
-, volume =	10
-, number =	5
-, year =	1991
-, pages =	"570--582"
-, update =	"98.07 bibrelex"
+, author =      "M. Boyer and N. F. Stewart"
+, title =       "Modeling spaces for toleranced objects"
+, journal =     "Internat. J. Robot. Res."
+, volume =      10
+, number =      5
+, year =        1991
+, pages =       "570--582"
+, update =      "98.07 bibrelex"
 }
 
 @book{b-hjfd-89
-, title =	"Handbook of Jig and Fixture Design"
-, editor =	"W. Boyes"
-, edition =	"2nd"
-, publisher =	"Society of Manufacturing Engineers"
-, year =	1989
-, update =	"98.03 bibrelex"
+, title =       "Handbook of Jig and Fixture Design"
+, editor =      "W. Boyes"
+, edition =     "2nd"
+, publisher =   "Society of Manufacturing Engineers"
+, year =        1989
+, update =      "98.03 bibrelex"
 }
 
 @article{b-idss-79
-, author =	"J. W. Boyse"
-, title =	"Interference detection among solids and surfaces"
-, journal =	"Commun. ACM"
-, volume =	22
-, year =	1979
-, pages =	"3--9"
+, author =      "J. W. Boyse"
+, title =       "Interference detection among solids and surfaces"
+, journal =     "Commun. ACM"
+, volume =      22
+, year =        1979
+, pages =       "3--9"
 }
 
 @article{bg-gimha-84
-, author =	"J. W. Boyse and J. E. Gilchrist"
-, title =	"GMSOLID interactive modeling for hull algorithms"
-, journal =	"BYTE"
-, volume =	"??"
-, year =	1984
-, pages =	"2--13"
-, update =	"98.03 bibrelex"
+, author =      "J. W. Boyse and J. E. Gilchrist"
+, title =       "GMSOLID interactive modeling for hull algorithms"
+, journal =     "BYTE"
+, volume =      "??"
+, year =        1984
+, pages =       "2--13"
+, update =      "98.03 bibrelex"
 }
 
 @unpublished{bkmt-nriqp-96
-, author =	"P. Bozanis and N. Ktsios and C. Makris and A. Tsakalidis"
-, title =	"New results on intersection query problems"
-, year =	1996
-, note =	"unpublished manuscript"
-, update =	"97.07 agarwal"
+, author =      "P. Bozanis and N. Ktsios and C. Makris and A. Tsakalidis"
+, title =       "New results on intersection query problems"
+, year =        1996
+, note =        "unpublished manuscript"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{bkmt-nubgi-95
-, author =	"P. Bozanis and N. Ktsios and C. Makris and A. Tsakalidis"
-, title =	"New upper bounds for generalized intersection searching problems"
-, booktitle =	"Proc. 22nd Inter. Colloq. Auto. Lang. and Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	944
-, year =	1995
-, pages =	"464--475"
-, update =	"97.07 agarwal"
+, author =      "P. Bozanis and N. Ktsios and C. Makris and A. Tsakalidis"
+, title =       "New upper bounds for generalized intersection searching problems"
+, booktitle =   "Proc. 22nd Inter. Colloq. Auto. Lang. and Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      944
+, year =        1995
+, pages =       "464--475"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{bs-vasoq-00
-, author =	"Franti{\v s}ek Brabec and Hanan Samet"
-, title =	"Visualizing and Animating Search Operations on Quadtrees on the Worldwide Web"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"70--76"
-, update =	"00.03 bibrelex"
+, author =      "Franti{\v s}ek Brabec and Hanan Samet"
+, title =       "Visualizing and Animating Search Operations on Quadtrees on the Worldwide Web"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "70--76"
+, update =      "00.03 bibrelex"
 }
 
 @techreport{bc-wenph-95
-, author =	"P. G. Bradford and V. Capoyleas"
-, title =	"Weak $\epsilon$-nets for points on a hypersphere"
-, type =	"Report"
-, number =	"MPI-I-95-1-029"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1995
-, precedes =	"bc-wenph-97"
-, update =	"98.07 smid, 96.01 smid"
+, author =      "P. G. Bradford and V. Capoyleas"
+, title =       "Weak $\epsilon$-nets for points on a hypersphere"
+, type =        "Report"
+, number =      "MPI-I-95-1-029"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1995
+, precedes =    "bc-wenph-97"
+, update =      "98.07 smid, 96.01 smid"
 }
 
 @article{bc-wenph-97
-, author =	"P. G. Bradford and V. Capoyleas"
-, title =	"Weak $\epsilon$-nets for points on a hypersphere"
-, journal =	"Discrete Comput. Geom."
-, volume =	18
-, year =	1997
-, pages =	"83--91"
-, succeeds =	"bc-wenph-95"
-, update =	"98.07 smid"
+, author =      "P. G. Bradford and V. Capoyleas"
+, title =       "Weak $\epsilon$-nets for points on a hypersphere"
+, journal =     "Discrete Comput. Geom."
+, volume =      18
+, year =        1997
+, pages =       "83--91"
+, succeeds =    "bc-wenph-95"
+, update =      "98.07 smid"
 }
 
 @techreport{bfs-ptowp-95
-, author =	"P. G. Bradford and R. Fleischer and M. Smid"
-, title =	"A polylog-time and $O(n \sqrt{\lg n})$-work parallel algorithm for finding the row minima in totally monotone matrices"
-, type =	"Report"
-, number =	"MPI-I-95-1-006"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1995
-, precedes =	"bfs-meptm-97"
-, update =	"97.07 smid, 95.05 smid"
+, author =      "P. G. Bradford and R. Fleischer and M. Smid"
+, title =       "A polylog-time and $O(n \sqrt{\lg n})$-work parallel algorithm for finding the row minima in totally monotone matrices"
+, type =        "Report"
+, number =      "MPI-I-95-1-006"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1995
+, precedes =    "bfs-meptm-97"
+, update =      "97.07 smid, 95.05 smid"
 }
 
 @article{bfs-meptm-97
-, author =	"P. G. Bradford and R. Fleischer and M. Smid"
-, title =	"More efficient parallel totally monotone matrix searching"
-, journal =	"J. Algorithms"
-, volume =	23
-, year =	1997
-, pages =	"386--400"
-, succeeds =	"bfs-ptowp-95"
-, update =	"97.07 smid"
+, author =      "P. G. Bradford and R. Fleischer and M. Smid"
+, title =       "More efficient parallel totally monotone matrix searching"
+, journal =     "J. Algorithms"
+, volume =      23
+, year =        1997
+, pages =       "386--400"
+, succeeds =    "bfs-ptowp-95"
+, update =      "97.07 smid"
 }
 
 @book{b-rmpc-82
-, title =	"Robot Motion: Planning and Control"
-, editor =	"M. Brady"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1982
-, update =	"97.11 bibrelex"
+, title =       "Robot Motion: Planning and Control"
+, editor =      "M. Brady"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @incollection{bb-vrfls-84
-, author =	"M. L. Brady and D. J. Brown"
-, title =	"VLSI Routing: {Four} Layers Suffice"
-, editor =	"Franco P. Preparata"
-, booktitle =	"VLSI Theory"
-, series =	"Adv. Comput. Res."
-, volume =	2
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1984
-, pages =	"245--257"
-, update =	"01.04 icking, 98.03 bibrelex"
+, author =      "M. L. Brady and D. J. Brown"
+, title =       "VLSI Routing: {Four} Layers Suffice"
+, editor =      "Franco P. Preparata"
+, booktitle =   "VLSI Theory"
+, series =      "Adv. Comput. Res."
+, volume =      2
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1984
+, pages =       "245--257"
+, update =      "01.04 icking, 98.03 bibrelex"
 }
 
 @article{b-sctdm-22
-, author =	"H. R. Brahana"
-, title =	"Systems of circuits on Two-dimensional manifolds"
-, journal =	"Annals of Math."
-, volume =	23
-, year =	1922
-, pages =	"144--168"
-, update =	"97.11 bibrelex"
+, author =      "H. R. Brahana"
+, title =       "Systems of circuits on Two-dimensional manifolds"
+, journal =     "Annals of Math."
+, volume =      23
+, year =        1922
+, pages =       "144--168"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{b-ngm-79
-, author =	"I. C. Braid"
-, title =	"Notes on a geometric modeller"
-, type =	"{CAD} {Group} {Document}"
-, number =	101
-, institution =	"Comput. Lab., Cambridge Univ."
-, address =	"Cambridge, England"
-, year =	1979
+, author =      "I. C. Braid"
+, title =       "Notes on a geometric modeller"
+, type =        "{CAD} {Group} {Document}"
+, number =      101
+, institution = "Comput. Lab., Cambridge Univ."
+, address =     "Cambridge, England"
+, year =        1979
 }
 
 @article{b-ssbmf-75
-, author =	"I. C. Braid"
-, title =	"The synthesis of solids bounded by many faces"
-, journal =	"Commun. ACM"
-, volume =	18
-, number =	4
-, year =	1975
-, pages =	"209--216"
+, author =      "I. C. Braid"
+, title =       "The synthesis of solids bounded by many faces"
+, journal =     "Commun. ACM"
+, volume =      18
+, number =      4
+, year =        1975
+, pages =       "209--216"
 }
 
 @incollection{bhs-swcpg-80
-, author =	"I. C. Braid and R. C. Hillyard and I. A. Stroud"
-, title =	"Step-wise construction of polyhedra in geometric modeling"
-, editor =	"K. W. Brodlie"
-, booktitle =	"Mathematical Methods in Computer Graphics and Design"
-, publisher =	"Academic Press"
-, address =	"London, England"
-, year =	1980
-, pages =	"123--141"
-, keywords =	"polyhedra, geometric modeling"
-, update =	"97.11 bibrelex, 95.05 korneenko"
+, author =      "I. C. Braid and R. C. Hillyard and I. A. Stroud"
+, title =       "Step-wise construction of polyhedra in geometric modeling"
+, editor =      "K. W. Brodlie"
+, booktitle =   "Mathematical Methods in Computer Graphics and Design"
+, publisher =   "Academic Press"
+, address =     "London, England"
+, year =        1980
+, pages =       "123--141"
+, keywords =    "polyhedra, geometric modeling"
+, update =      "97.11 bibrelex, 95.05 korneenko"
 }
 
 @inproceedings{b-dgdlg-95
-, author =	"F. J. Brandenburg"
-, title =	"Designing Graph Drawings by Layout Graph Grammars"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"416--427"
-, keywords =	"graph drawing, grammar"
-, update =	"95.01 tamassia"
+, author =      "F. J. Brandenburg"
+, title =       "Designing Graph Drawings by Layout Graph Grammars"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "416--427"
+, keywords =    "graph drawing, grammar"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{b-gc1cc-97
-, author =	"F. J. Brandenburg"
-, title =	"Graph Clustering {I}: Cycles of Cliques"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"158--168"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "F. J. Brandenburg"
+, title =       "Graph Clustering {I}: Cycles of Cliques"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "158--168"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @proceedings{b-gd-96
-, title =	"Graph Drawing (Proc. GD '95)"
-, editor =	"F. J. Brandenburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, keywords =	"graph drawing"
-, update =	"98.11 bibrelex, 98.07 bibrelex+vismara, 96.09 tamassia"
+, title =       "Graph Drawing (Proc. GD '95)"
+, editor =      "F. J. Brandenburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, keywords =    "graph drawing"
+, update =      "98.11 bibrelex, 98.07 bibrelex+vismara, 96.09 tamassia"
 }
 
 @techreport{b-ndgta-88
-, author =	"F. J. Brandenburg"
-, title =	"Nice Drawings of Graphs and Trees are Computationally Hard"
-, number =	"MIP-8820"
-, institution =	"Fakultat fur Mathematik und Informatik, Univ. Passau"
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia, 93.09 tamassia"
+, author =      "F. J. Brandenburg"
+, title =       "Nice Drawings of Graphs and Trees are Computationally Hard"
+, number =      "MIP-8820"
+, institution = "Fakultat fur Mathematik und Informatik, Univ. Passau"
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia, 93.09 tamassia"
 }
 
 @inproceedings{bhr-ecfdr-96
-, author =	"Franz J. Brandenburg and M. Himsolt and Christoph Rohrer"
-, title =	"An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"76--87"
-, keywords =	"graph drawing, experiments, straight-line"
-, update =	"98.07 vismara, 96.09 tamassia"
+, author =      "Franz J. Brandenburg and M. Himsolt and Christoph Rohrer"
+, title =       "An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "76--87"
+, keywords =    "graph drawing, experiments, straight-line"
+, update =      "98.07 vismara, 96.09 tamassia"
 }
 
 @techreport{bh-ncrmp-96
-, author =	"U. Brandes and D. Handke"
-, title =	"{NP}-completeness results for minimum planar spanners"
-, type =	"Technical Report"
-, number =	16
-, institution =	"Fakult{\"a}t f{\"u}r Mathematik und Informatik, Universit{\"a}t Konstanz"
-, address =	"Konstanz, Germany"
-, year =	1996
-, update =	"97.03 smid"
+, author =      "U. Brandes and D. Handke"
+, title =       "{NP}-completeness results for minimum planar spanners"
+, type =        "Technical Report"
+, number =      16
+, institution = "Fakult{\"a}t f{\"u}r Mathematik und Informatik, Universit{\"a}t Konstanz"
+, address =     "Konstanz, Germany"
+, year =        1996
+, update =      "97.03 smid"
 }
 
 @inproceedings{bw-bpdgl-97
-, author =	"Ulrik Brandes and Dorothea Wagner"
-, title =	"A Bayesian Paradigm for Dynamic Graph Layout"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"236--247"
-, keywords =	"graph drawing"
-, update =	"99.11 bibrelex, 98.07 patrignani+vismara"
+, author =      "Ulrik Brandes and Dorothea Wagner"
+, title =       "A Bayesian Paradigm for Dynamic Graph Layout"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "236--247"
+, keywords =    "graph drawing"
+, update =      "99.11 bibrelex, 98.07 patrignani+vismara"
 }
 
 @incollection{b-jnpbg-89
-, author =	"A. Brandstadt"
-, title =	"The jump number problem for biconvex graphs and rectangle covers of rectangular regions"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	380
-, year =	1989
-, pages =	"68--77"
-, keywords =	"isothetic, covering, rectangles"
-, update =	"95.05 korneenko"
+, author =      "A. Brandstadt"
+, title =       "The jump number problem for biconvex graphs and rectangle covers of rectangular regions"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      380
+, year =        1989
+, pages =       "68--77"
+, keywords =    "isothetic, covering, rectangles"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bcd-auhsm-95
-, author =	"A. Brandst{\"a}dt and V. D. Chepoi and F. F. Dragan"
-, title =	"The algorithmic use of hypertree structure and maximum neighbourhood orderings"
-, booktitle =	"Proc. 20th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	903
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"65--80"
-, update =	"99.11 bibrelex, 98.07 bibrelex"
+, author =      "A. Brandst{\"a}dt and V. D. Chepoi and F. F. Dragan"
+, title =       "The algorithmic use of hypertree structure and maximum neighbourhood orderings"
+, booktitle =   "Proc. 20th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      903
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "65--80"
+, update =      "99.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{b-cccda-94
-, author =	"J. W. Brandt"
-, title =	"Convergence and continuity criteria for discrete approximations of the continuous planar skeletons"
-, journal =	"CVGIP: Image Understanding"
-, volume =	59
-, number =	1
-, year =	1994
-, pages =	"116--124"
-, update =	"98.07 bibrelex"
+, author =      "J. W. Brandt"
+, title =       "Convergence and continuity criteria for discrete approximations of the continuous planar skeletons"
+, journal =     "CVGIP: Image Understanding"
+, volume =      59
+, number =      1
+, year =        1994
+, pages =       "116--124"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ba-cscsd-91
-, author =	"Jonathan W. Brandt and V. Ralph Algazi"
-, title =	"Computing a Stable, Connected Skeleton From Discrete Data"
-, booktitle =	"Proceedings of the 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition"
-, publisher =	"IEEE"
-, address =	"IEEE Service Center, Piscataway, NJ, USA (IEEE cat n 91CH2983-5)"
-, year =	1991
-, pages =	"666--667"
-, keywords =	"Voronoi diagram"
-, abstract =	"The relationship between the skeleton and the Voronoi
-		 diagram for the case of morphologically regular sets is
-		 described. Using the discrete-point Voronoi diagram, a
-		 practical algorithm is developed to compute an
-		 approximate skeleton of a continuous shape from sampled
-		 data. The analysis also yields a sampling criterion
-		 under which the approximation is stable. The algorithm
-		 is applied to a simple test image. 4 Refs."
+, author =      "Jonathan W. Brandt and V. Ralph Algazi"
+, title =       "Computing a Stable, Connected Skeleton From Discrete Data"
+, booktitle =   "Proceedings of the 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition"
+, publisher =   "IEEE"
+, address =     "IEEE Service Center, Piscataway, NJ, USA (IEEE cat n 91CH2983-5)"
+, year =        1991
+, pages =       "666--667"
+, keywords =    "Voronoi diagram"
+, abstract =    "The relationship between the skeleton and the Voronoi
+                 diagram for the case of morphologically regular sets is
+                 described. Using the discrete-point Voronoi diagram, a
+                 practical algorithm is developed to compute an
+                 approximate skeleton of a continuous shape from sampled
+                 data. The analysis also yields a sampling criterion
+                 under which the approximation is stable. The algorithm
+                 is applied to a simple test image. 4 Refs."
 }
 
 @article{ba-cscvd-92
-, author =	"J. W. Brandt and V. R. Algazi"
-, title =	"Continuous Skeleton Computation by {Voronoi} Diagram"
-, journal =	"CVGIP: Image Understanding"
-, volume =	55
-, number =	3
-, year =	1992
-, pages =	"329--338"
+, author =      "J. W. Brandt and V. R. Algazi"
+, title =       "Continuous Skeleton Computation by {Voronoi} Diagram"
+, journal =     "CVGIP: Image Understanding"
+, volume =      55
+, number =      3
+, year =        1992
+, pages =       "329--338"
 }
 
 @inproceedings{b-albhp-01
-, author =	"Peter Bra{\ss}"
-, title =	"Another Lower Bound for {Hopcroft's} Problem"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"70--73"
-, update =	"01.04 icking"
+, author =      "Peter Bra{\ss}"
+, title =       "Another Lower Bound for {Hopcroft's} Problem"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "70--73"
+, update =      "01.04 icking"
 }
 
 @article{b-edpns-96
-, author =	"P. Brass"
-, title =	"Erd{\H o}s distance problems in normed spaces"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"195--214"
-, update =	"96.09 devillers"
+, author =      "P. Brass"
+, title =       "Erd{\H o}s distance problems in normed spaces"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "195--214"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{b-aps-00
-, author =	"Peter Brass"
-, title =	"On the Approximation of Polygons by Subpolygons"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"59--61"
-, update =	"00.03 bibrelex"
+, author =      "Peter Brass"
+, title =       "On the Approximation of Polygons by Subpolygons"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "59--61"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{bk-tcddp-00a
-, author =	"Peter Bra{\ss} and Christian Knauer"
-, title =	"Testing the Congruence of $d$-Dimensional Point Sets"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"310--314"
-, update =	"00.11 jones"
+, author =      "Peter Bra{\ss} and Christian Knauer"
+, title =       "Testing the Congruence of $d$-Dimensional Point Sets"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "310--314"
+, update =      "00.11 jones"
 }
 
 @inproceedings{bk-tcddp-00e
-, author =	"Peter Bra{\ss} and Christian Knauer"
-, title =	"Testing the Congruence of {$d$}-Dimensional Point Sets"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"104--107"
-, update =	"00.03 bibrelex"
+, author =      "Peter Bra{\ss} and Christian Knauer"
+, title =       "Testing the Congruence of {$d$}-Dimensional Point Sets"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "104--107"
+, update =      "00.03 bibrelex"
 }
 
 @book{bb-atp-88
-, author =	"G. Brassard and P. Bratley"
-, title =	"Algorithmics: Theory and Practice"
-, publisher =	"Prentice Hall"
-, address =	"Enlewood Cliffs, NJ"
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "G. Brassard and P. Bratley"
+, title =       "Algorithmics: Theory and Practice"
+, publisher =   "Prentice Hall"
+, address =     "Enlewood Cliffs, NJ"
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @article{bf-asrvd-79
-, author =	"K. E. Brassel and R. Fegeas"
-, title =	"An algorithm for shading of regions on vector display devices"
-, journal =	"Comput. Graph."
-, volume =	13
-, number =	2
-, year =	1979
-, pages =	"126--133"
-, note =	"Proc. SIGGRAPH '79"
+, author =      "K. E. Brassel and R. Fegeas"
+, title =       "An algorithm for shading of regions on vector display devices"
+, journal =     "Comput. Graph."
+, volume =      13
+, number =      2
+, year =        1979
+, pages =       "126--133"
+, note =        "Proc. SIGGRAPH '79"
 }
 
 @article{br-pgtp-79
-, author =	"K. E. Brassel and D. Reif"
-, title =	"A procedure to generate {Thiessen} polygons"
-, journal =	"Geogr. Anal."
-, volume =	11
-, year =	1979
-, pages =	"289--303"
+, author =      "K. E. Brassel and D. Reif"
+, title =       "A procedure to generate {Thiessen} polygons"
+, journal =     "Geogr. Anal."
+, volume =      11
+, year =        1979
+, pages =       "289--303"
 }
 
 @article{bw-arfam-88
-, author =	"K. E. Brassel and R. Weibel"
-, title =	"A review and framework of automated map generalization"
-, journal =	"Intl. J. Geographic. Info. Systems"
-, volume =	2
-, number =	3
-, year =	1988
-, pages =	"229--244"
-, update =	"98.03 agarwal"
+, author =      "K. E. Brassel and R. Weibel"
+, title =       "A review and framework of automated map generalization"
+, journal =     "Intl. J. Geographic. Info. Systems"
+, volume =      2
+, number =      3
+, year =        1988
+, pages =       "229--244"
+, update =      "98.03 agarwal"
 }
 
 @article{bs-nmpde-95
-, author =	"J. Braun and M. Sambridge"
-, title =	"A numerical method for solving partial differential equations on highly irregular evolving grids"
-, journal =	"Nature"
-, volume =	376
-, year =	1995
-, pages =	"655--660"
-, keywords =	"Delaunay remeshing, finite element, natural neighbours"
-, update =	"95.09 sambridge"
-, annote =	"Lagrangian PDE solver using Delaunay remeshing and
+, author =      "J. Braun and M. Sambridge"
+, title =       "A numerical method for solving partial differential equations on highly irregular evolving grids"
+, journal =     "Nature"
+, volume =      376
+, year =        1995
+, pages =       "655--660"
+, keywords =    "Delaunay remeshing, finite element, natural neighbours"
+, update =      "95.09 sambridge"
+, annote =      "Lagrangian PDE solver using Delaunay remeshing and
 natural neighbour interpolation. Able to solve problems mixing fluids
 and solids on dynamically evolving grids without remeshing."
 }
 
 @article{bs-dlrna-94
-, author =	"J. Braun and M. S. Sambridge"
-, title =	"Dynamical {Lagrangian} Remeshing (DLR): A new algorithm for solving large strain deformation problems and its application to fault-propagation folding"
-, journal =	"Earth and Planet. Sci. Lett."
-, volume =	124
-, year =	1994
-, pages =	"211--220"
-, keywords =	"Delaunay remeshing, finite element"
-, update =	"94.09 sambridge"
+, author =      "J. Braun and M. S. Sambridge"
+, title =       "Dynamical {Lagrangian} Remeshing (DLR): A new algorithm for solving large strain deformation problems and its application to fault-propagation folding"
+, journal =     "Earth and Planet. Sci. Lett."
+, volume =      124
+, year =        1994
+, pages =       "211--220"
+, keywords =    "Delaunay remeshing, finite element"
+, update =      "94.09 sambridge"
 }
 
 @article{b-cvdks-82
-, author =	"M. Breen"
-, title =	"Clear visibility and the dimension of kernels of starshaped sets"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	85
-, year =	1982
-, pages =	"414--418"
-, update =	"98.07 bibrelex"
+, author =      "M. Breen"
+, title =       "Clear visibility and the dimension of kernels of starshaped sets"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      85
+, year =        1982
+, pages =       "414--418"
+, update =      "98.07 bibrelex"
 }
 
 @article{b-iubr-92
-, author =	"M. Breen"
-, title =	"Illumination for unions of boxes in {$R^d$}"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	116
-, number =	1
-, year =	1992
-, pages =	"197--202"
-, keywords =	"illumination, visibility, Helly"
+, author =      "M. Breen"
+, title =       "Illumination for unions of boxes in {$R^d$}"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      116
+, number =      1
+, year =        1992
+, pages =       "197--202"
+, keywords =    "illumination, visibility, Helly"
 }
 
 @article{b-kpccu-88
-, author =	"M. Breen"
-, title =	"$K$-partitions and a characterization for compact unions of $k$ starshaped sets"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	102
-, number =	3
-, year =	1988
-, pages =	"677--680"
-, keywords =	"starshaped"
-, update =	"95.05 korneenko"
+, author =      "M. Breen"
+, title =       "$K$-partitions and a characterization for compact unions of $k$ starshaped sets"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      102
+, number =      3
+, year =        1988
+, pages =       "677--680"
+, keywords =    "starshaped"
+, update =      "95.05 korneenko"
 }
 
 @article{bk-gdtmc-76
-, author =	"M. Breen and D. C. Kay"
-, title =	"General decomposition theorems for $m$-convex sets in the plane"
-, journal =	"Israel J. Math."
-, volume =	24
-, year =	1976
-, pages =	"217--233"
-, update =	"98.03 bibrelex"
+, author =      "M. Breen and D. C. Kay"
+, title =       "General decomposition theorems for $m$-convex sets in the plane"
+, journal =     "Israel J. Math."
+, volume =      24
+, year =        1976
+, pages =       "217--233"
+, update =      "98.03 bibrelex"
 }
 
 @article{bk-sapsr-82
-, author =	"U. Brehm and W. K{\"u}hnel"
-, title =	"Smooth approximation of polyhedral surfaces regarding curvatures"
-, journal =	"Geom. Dedicata"
-, volume =	12
-, year =	1982
-, pages =	"435--461"
+, author =      "U. Brehm and W. K{\"u}hnel"
+, title =       "Smooth approximation of polyhedral surfaces regarding curvatures"
+, journal =     "Geom. Dedicata"
+, volume =      12
+, year =        1982
+, pages =       "435--461"
 }
 
 @incollection{bs-pm-97
-, author =	"U. Brehm and E. Schulte"
-, title =	"Polyhedral maps"
-, chapter =	18
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"345--360"
-, update =	"97.11 orourke"
+, author =      "U. Brehm and E. Schulte"
+, title =       "Polyhedral maps"
+, chapter =     18
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "345--360"
+, update =      "97.11 orourke"
 }
 
 @incollection{bw-pm-93
-, author =	"U. Brehm and J. M. Wills"
-, title =	"Polyhedral Manifolds"
-, editor =	"P. M. Gruber and J. M. Wills"
-, booktitle =	"Handbook of Convex Geometry"
-, publisher =	"North-Holland"
-, year =	1993
-, update =	"99.11 bibrelex, 96.09 orourke"
+, author =      "U. Brehm and J. M. Wills"
+, title =       "Polyhedral Manifolds"
+, editor =      "P. M. Gruber and J. M. Wills"
+, booktitle =   "Handbook of Convex Geometry"
+, publisher =   "North-Holland"
+, year =        1993
+, update =      "99.11 bibrelex, 96.09 orourke"
 }
 
 @book{bfos-crt-84
-, author =	"L. Breiman and J. Friedman and R. Olshen and C. Stone"
-, title =	"Classification and Regression Trees"
-, publisher =	"Wadsworth International Group"
-, year =	1984
-, update =	"95.05 agarwal"
+, author =      "L. Breiman and J. Friedman and R. Olshen and C. Stone"
+, title =       "Classification and Regression Trees"
+, publisher =   "Wadsworth International Group"
+, year =        1984
+, update =      "95.05 agarwal"
 }
 
 @techreport{bs-parpv-92
-, author =	"David Bremmer and Thomas Shermer"
-, title =	"Properties and applications of restricted-orientation point visibility graphs"
-, type =	"manuscript"
-, institution =	"School of Computing Science, Simon Fraser University"
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "David Bremmer and Thomas Shermer"
+, title =       "Properties and applications of restricted-orientation point visibility graphs"
+, type =        "manuscript"
+, institution = "School of Computing Science, Simon Fraser University"
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{b-l2cof-94
-, author =	"D. Bremner"
-, title =	"Link-$2$-Convex One-Fillable Polygons are Starshaped"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"363--368"
-, cites =	"bt-gcaim-92, b-pvgro-93, bs-pvgro-93, cr-occop-89a, k-mchco-86, mrs-pgocc-89, r-erog-87, rw-rocs-91, mrs-copsp-89, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "D. Bremner"
+, title =       "Link-$2$-Convex One-Fillable Polygons are Starshaped"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "363--368"
+, cites =       "bt-gcaim-92, b-pvgro-93, bs-pvgro-93, cr-occop-89a, k-mchco-86, mrs-pgocc-89, r-erog-87, rw-rocs-91, mrs-copsp-89, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @mastersthesis{b-pvgro-93
-, author =	"David Bremner"
-, title =	"Point Visibility Graphs and Restricted-Orientation Polygon Covering"
-, type =	"M.{Sc}. Thesis"
-, school =	"School of Computing Science, Simon Fraser University"
-, address =	"Burnaby, BC"
-, month =	apr
-, year =	1993
-, keywords =	"master thesis"
-, update =	"94.05 bremner"
+, author =      "David Bremner"
+, title =       "Point Visibility Graphs and Restricted-Orientation Polygon Covering"
+, type =        "M.{Sc}. Thesis"
+, school =      "School of Computing Science, Simon Fraser University"
+, address =     "Burnaby, BC"
+, month =       apr
+, year =        1993
+, keywords =    "master thesis"
+, update =      "94.05 bremner"
 }
 
 @inproceedings{bfm-pdmvf-97
-, author =	"D. Bremner and K. Fukuda and M. Marzetta"
-, title =	"Primal-Dual Methods for Vertex and Facet Enumeration"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"49--56"
-, cites =	"af-pachv-92, b-icp-83, bmfn-psbzi-, ck-acp-70, c-lp-83, c-mosga-94, d-cvem-83, e-dum-91, flm-abalv-97, gk-csbpc-94, ic-lp-94, m-mnfcp-70, m-mdscg-84, s-ossac-86, s-fchff-85, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "D. Bremner and K. Fukuda and M. Marzetta"
+, title =       "Primal-Dual Methods for Vertex and Facet Enumeration"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "49--56"
+, cites =       "af-pachv-92, b-icp-83, bmfn-psbzi-, ck-acp-70, c-lp-83, c-mosga-94, d-cvem-83, e-dum-91, flm-abalv-97, gk-csbpc-94, ic-lp-94, m-mnfcp-70, m-mdscg-84, s-ossac-86, s-fchff-85, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @unpublished{bos-mpams-94
-, author =	"D. Bremner and J. O'Rourke and T. Shermer"
-, title =	"Motion planning amidst movable square blocks is {PSPACE} complete"
-, year =	1994
-, note =	"Draft, June"
-, update =	"94.09 orourke"
+, author =      "D. Bremner and J. O'Rourke and T. Shermer"
+, title =       "Motion planning amidst movable square blocks is {PSPACE} complete"
+, year =        1994
+, note =        "Draft, June"
+, update =      "94.09 orourke"
 }
 
 @techreport{bs-pvgro-93
-, author =	"David Bremner and Thomas Shermer"
-, title =	"Point Visibility Graphs and Restricted-Oriention Convex Cover"
-, type =	"Technical Report"
-, number =	"CMPT TR 93-07"
-, institution =	"School of Computing Science, Simon Fraser University"
-, year =	1993
-, update =	"94.05 bremner"
+, author =      "David Bremner and Thomas Shermer"
+, title =       "Point Visibility Graphs and Restricted-Oriention Convex Cover"
+, type =        "Technical Report"
+, number =      "CMPT TR 93-07"
+, institution = "School of Computing Science, Simon Fraser University"
+, year =        1993
+, update =      "94.05 bremner"
 }
 
 @phdthesis{b-afzef-71
-, author =	"R. Brent"
-, title =	"Algorithms for finding zeros and extrema of functions without calculating derivatives"
-, school =	"Stanford University"
-, address =	"Stanford, CA"
-, year =	1971
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "R. Brent"
+, title =       "Algorithms for finding zeros and extrema of functions without calculating derivatives"
+, school =      "Stanford University"
+, address =     "Stanford, CA"
+, year =        1971
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @article{b-fmpee-76
-, author =	"R. P. Brent"
-, title =	"Fast multiple-precision evaluation of elementary functions"
-, journal =	"J. ACM"
-, volume =	23
-, year =	1976
-, pages =	"242--251"
-, update =	"98.03 bibrelex"
+, author =      "R. P. Brent"
+, title =       "Fast multiple-precision evaluation of elementary functions"
+, journal =     "J. ACM"
+, volume =      23
+, year =        1976
+, pages =       "242--251"
+, update =      "98.03 bibrelex"
 }
 
 @article{b-pegae-74
-, author =	"R. P. Brent"
-, title =	"The Parallel Evaluation of General Arithmetic Expressions"
-, journal =	"J. ACM"
-, volume =	21
-, number =	2
-, year =	1974
-, pages =	"201--206"
-, update =	"96.09 orourke"
+, author =      "R. P. Brent"
+, title =       "The Parallel Evaluation of General Arithmetic Expressions"
+, journal =     "J. ACM"
+, volume =      21
+, number =      2
+, year =        1974
+, pages =       "201--206"
+, update =      "96.09 orourke"
 }
 
 @article{bk-abtl-80
-, author =	"R. P. Brent and H. T. Kung"
-, title =	"On the area of binary tree layouts"
-, journal =	"Inform. Process. Lett."
-, volume =	11
-, year =	1980
-, pages =	"521--534"
-, keywords =	"graph drawing"
-, update =	"94.01 tamassia"
+, author =      "R. P. Brent and H. T. Kung"
+, title =       "On the area of binary tree layouts"
+, journal =     "Inform. Process. Lett."
+, volume =      11
+, year =        1980
+, pages =       "521--534"
+, keywords =    "graph drawing"
+, update =      "94.01 tamassia"
 }
 
 @article{b-laidd-77
-, author =	"J. E. Bresenham"
-, title =	"A linear algorithm for incremental digital display of circular arcs"
-, journal =	"Commun. ACM"
-, volume =	20
-, year =	1977
-, pages =	"100--106"
+, author =      "J. E. Bresenham"
+, title =       "A linear algorithm for incremental digital display of circular arcs"
+, journal =     "Commun. ACM"
+, volume =      20
+, year =        1977
+, pages =       "100--106"
 }
 
 @article{b-accdp-65
-, author =	"J. E. Bresenham"
-, title =	"Algorithm for computer control of digital plotter"
-, journal =	"IBM Syst. J."
-, volume =	4
-, year =	1965
-, pages =	"25--30"
+, author =      "J. E. Bresenham"
+, title =       "Algorithm for computer control of digital plotter"
+, journal =     "IBM Syst. J."
+, volume =      4
+, year =        1965
+, pages =       "25--30"
 }
 
 @incollection{b-ailr-88
-, author =	"J. E. Bresenham"
-, title =	"Ambiguities in incremental line rastering"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1988
-, pages =	"329--358"
-, update =	"99.11 bibrelex"
+, author =      "J. E. Bresenham"
+, title =       "Ambiguities in incremental line rastering"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1988
+, pages =       "329--358"
+, update =      "99.11 bibrelex"
 }
 
 @article{bgdw-ltedt-95
-, author =	"H. Breu and J. Gil and D. Kirkpatrick and M. Werman"
-, title =	"Linear Time {Euclidean} Distance Transform and {Voronoi} Diagram Algorithms"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	17
-, year =	1995
-, pages =	"529--533"
-, update =	"96.01 werman"
+, author =      "H. Breu and J. Gil and D. Kirkpatrick and M. Werman"
+, title =       "Linear Time {Euclidean} Distance Transform and {Voronoi} Diagram Algorithms"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      17
+, year =        1995
+, pages =       "529--533"
+, update =      "96.01 werman"
 }
 
 @article{bk-udgrn-98
-, author =	"H. Breu and D. G. Kirkpatrick"
-, title =	"Unit Disk Graph Recognition is {NP}-hard"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, number =	"1--2"
-, year =	1998
-, pages =	"3--24"
-, note =	"(special issue on Geometric Representations of Graphs, edited by G. {Di Battista} and R. Tamassia)"
-, keywords =	"graph drawing, proximity, NP-hardness"
-, update =	"98.07 patrignani, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
+, author =      "H. Breu and D. G. Kirkpatrick"
+, title =       "Unit Disk Graph Recognition is {NP}-hard"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, number =      "1--2"
+, year =        1998
+, pages =       "3--24"
+, note =        "(special issue on Geometric Representations of Graphs, edited by G. {Di Battista} and R. Tamassia)"
+, keywords =    "graph drawing, proximity, NP-hardness"
+, update =      "98.07 patrignani, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
 }
 
 @inproceedings{bbdltv-trodo-99
-, author =	"Stina Bridgeman and Giuseppe Di Battista and Walter Didimo and Guiseppe Liotta and Roberto Tamassia and Luca Vismara"
-, title =	"Turn-Regularity and Optimal Drawings of Orthogonal Representations"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"161--164"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Stina Bridgeman and Giuseppe Di Battista and Walter Didimo and Guiseppe Liotta and Roberto Tamassia and Luca Vismara"
+, title =       "Turn-Regularity and Optimal Drawings of Orthogonal Representations"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "161--164"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{bddltv-ocor-98
-, author =	"Stina Bridgeman and Giuseppe {Di Battista} and Walter Didimo and Giuseppe Liotta and Roberto Tamassia and Luca Vismara"
-, title =	"Optimal Compaction of Orthogonal Representations"
-, booktitle =	"CGC Workshop on Geometric Computing"
-, year =	1998
-, url =	"https://www.cs.brown.edu/cgc/cgc98/"
-, keywords =	"graph drawing, planar, orthogonal"
-, update =	"98.11 tamassia"
+, author =      "Stina Bridgeman and Giuseppe {Di Battista} and Walter Didimo and Giuseppe Liotta and Roberto Tamassia and Luca Vismara"
+, title =       "Optimal Compaction of Orthogonal Representations"
+, booktitle =   "CGC Workshop on Geometric Computing"
+, year =        1998
+, url = "https://www.cs.brown.edu/cgc/cgc98/"
+, keywords =    "graph drawing, planar, orthogonal"
+, update =      "98.11 tamassia"
 }
 
 @article{bgt-gdtsw-99
-, author =	"Stina Bridgeman and Ashim Garg and Roberto Tamassia"
-, title =	"A Graph Drawing and Translation Service on the {World Wide Web}"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, number =	"4--5"
-, year =	1999
-, pages =	"419--446"
-, keywords =	"graph drawing, system"
-, succeeds =	"bgt-gdtsw-97"
-, update =	"00.03 vismara, 98.11 tamassia"
+, author =      "Stina Bridgeman and Ashim Garg and Roberto Tamassia"
+, title =       "A Graph Drawing and Translation Service on the {World Wide Web}"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, number =      "4--5"
+, year =        1999
+, pages =       "419--446"
+, keywords =    "graph drawing, system"
+, succeeds =    "bgt-gdtsw-97"
+, update =      "00.03 vismara, 98.11 tamassia"
 }
 
 @inproceedings{bgt-gdtsw-97
-, author =	"S. Bridgeman and A. Garg and R. Tamassia"
-, title =	"A Graph Drawing and Translation Service on the {WWW}"
-, editor =	"S. C. North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"45--52"
-, url =	"https://www.cs.brown.edu/cgc/papers/bgt-gdtsw-97.ps.gz"
-, keywords =	"graph drawing, system, WWW, orthogonal, planarization, CGC, Brown"
-, update =	"98.07 vismara, 97.03 tamassia"
+, author =      "S. Bridgeman and A. Garg and R. Tamassia"
+, title =       "A Graph Drawing and Translation Service on the {WWW}"
+, editor =      "S. C. North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "45--52"
+, url = "https://www.cs.brown.edu/cgc/papers/bgt-gdtsw-97.ps.gz"
+, keywords =    "graph drawing, system, WWW, orthogonal, planarization, CGC, Brown"
+, update =      "98.07 vismara, 97.03 tamassia"
 }
 
 @inproceedings{bt-dmiog-98
-, author =	"S. Bridgeman and R. Tamassia"
-, title =	"Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms"
-, booktitle =	"Proc. Graph Drawing '98"
-, publisher =	"Springer-Verlag"
-, note =	"to appear"
-, keywords =	"graph drawing, interactive, dynamic, system"
-, update =	"98.11 tamassia"
+, author =      "S. Bridgeman and R. Tamassia"
+, title =       "Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms"
+, booktitle =   "Proc. Graph Drawing '98"
+, publisher =   "Springer-Verlag"
+, note =        "to appear"
+, keywords =    "graph drawing, interactive, dynamic, system"
+, update =      "98.11 tamassia"
 }
 
 @article{bddltv-troad-00
-, author =	"S. S. Bridgeman and G. {Di Battista} and W. Didimo and G. Liotta and R. Tamassia and L. Vismara"
-, title =	"Turn-Regularity and Optimal Area Drawings of Orthogonal Representations"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	16
-, number =	1
-, year =	2000
-, pages =	"53--93"
-, succeeds =	"bddltv-ocor-98, bbdltv-trodo-99, bddltv-trpod-99"
-, update =	"00.11 smid, 00.07 vismara"
-, annote =	"Special Issue on the 1998 Workshop on Computational
+, author =      "S. S. Bridgeman and G. {Di Battista} and W. Didimo and G. Liotta and R. Tamassia and L. Vismara"
+, title =       "Turn-Regularity and Optimal Area Drawings of Orthogonal Representations"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      16
+, number =      1
+, year =        2000
+, pages =       "53--93"
+, succeeds =    "bddltv-ocor-98, bbdltv-trodo-99, bddltv-trpod-99"
+, update =      "00.11 smid, 00.07 vismara"
+, annote =      "Special Issue on the 1998 Workshop on Computational
                   Geometry"
 }
 
 @inproceedings{bddltv-trpod-99
-, author =	"S. S. Bridgeman and G. {Di Battista} and W. Didimo and G. Liotta and R. Tamassia and L. Vismara"
-, title =	"Turn-Regularity and Planar Orthogonal Drawings"
-, editor =	"J. Kratochv{\'\i}l"
-, booktitle =	"Graph Drawing"
-, nickname =	"GD '99"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1731
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"8--26"
-, precedes =	"bddltv-troad-99"
-, update =	"00.03 vismara"
+, author =      "S. S. Bridgeman and G. {Di Battista} and W. Didimo and G. Liotta and R. Tamassia and L. Vismara"
+, title =       "Turn-Regularity and Planar Orthogonal Drawings"
+, editor =      "J. Kratochv{\'\i}l"
+, booktitle =   "Graph Drawing"
+, nickname =    "GD '99"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1731
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "8--26"
+, precedes =    "bddltv-troad-99"
+, update =      "00.03 vismara"
 }
 
 @inproceedings{bfgtv-iaiog-97
-, author =	"Stina S. Bridgeman and Jody Fanto and Ashim Garg and Roberto Tamassia and Luca Vismara"
-, title =	"{InteractiveGiotto}: An Algorithm for Interactive Orthogonal Graph Drawing"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"303--308"
-, keywords =	"graph drawing"
-, update =	"99.11 bibrelex, 98.07 patrignani+tamassia+vismara"
+, author =      "Stina S. Bridgeman and Jody Fanto and Ashim Garg and Roberto Tamassia and Luca Vismara"
+, title =       "{InteractiveGiotto}: An Algorithm for Interactive Orthogonal Graph Drawing"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "303--308"
+, keywords =    "graph drawing"
+, update =      "99.11 bibrelex, 98.07 patrignani+tamassia+vismara"
 }
 
 @inproceedings{b-eaosp-89
-, author =	"A. J. Briggs"
-, title =	"An efficient algorithm for one-step planar compliant motion planning with uncertainty"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"187--196"
-, keywords =	"motion planning, compliant motion, uncertainty"
-, cites =	"aaghi-vdp-86, c-cfmp-89, cr-nlbtr-87, d-cpcmp-88, d-edrr-89, e-acg-87, e-mpu-84, e-ubfmp-86, lmt-asfms-84, l-spcsa-83, m-mgpo-82, m-apfmc-84, n-moo-86, np-psaig-82, w-ffcmf-77, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "A. J. Briggs"
+, title =       "An efficient algorithm for one-step planar compliant motion planning with uncertainty"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "187--196"
+, keywords =    "motion planning, compliant motion, uncertainty"
+, cites =       "aaghi-vdp-86, c-cfmp-89, cr-nlbtr-87, d-cpcmp-88, d-edrr-89, e-acg-87, e-mpu-84, e-ubfmp-86, lmt-asfms-84, l-spcsa-83, m-mgpo-82, m-apfmc-84, n-moo-86, np-psaig-82, w-ffcmf-77, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{bt-odcp-93
-, author =	"G. Brightwell and W. T. Trotter"
-, title =	"The Order Dimension of Convex Polytopes"
-, journal =	"SIAM J. Discrete Math."
-, volume =	6
-, number =	2
-, year =	1993
-, pages =	"230--245"
-, update =	"95.05 tamassia"
+, author =      "G. Brightwell and W. T. Trotter"
+, title =       "The Order Dimension of Convex Polytopes"
+, journal =     "SIAM J. Discrete Math."
+, volume =      6
+, number =      2
+, year =        1993
+, pages =       "230--245"
+, update =      "95.05 tamassia"
 }
 
 @techreport{bt-odpm-92
-, author =	"G. Brightwell and W. T. Trotter"
-, title =	"The Order Dimension of Planar Maps"
-, number =	"LSE--MPS--37"
-, institution =	"Dept. of Statistical and Mathematical Sciences, London School of Economics"
-, year =	1992
-, update =	"95.05 tamassia"
+, author =      "G. Brightwell and W. T. Trotter"
+, title =       "The Order Dimension of Planar Maps"
+, number =      "LSE--MPS--37"
+, institution = "Dept. of Statistical and Mathematical Sciences, London School of Economics"
+, year =        1992
+, update =      "95.05 tamassia"
 }
 
 @article{bft-bpcpc-95
-, author =	"G. R. Brightwell and S. Felsner and W. T. Trotter"
-, title =	"Balancing Pairs and the Cross Product Conjecture"
-, journal =	"Order"
-, volume =	12
-, year =	1995
-, pages =	"327--349"
-, update =	"97.03 gaertner+salinger"
+, author =      "G. R. Brightwell and S. Felsner and W. T. Trotter"
+, title =       "Balancing Pairs and the Cross Product Conjecture"
+, journal =     "Order"
+, volume =      12
+, year =        1995
+, pages =       "327--349"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{bs-rpg-93
-, author =	"G. R. Brightwell and E. R. Scheinerman"
-, title =	"Representations of Planar Graphs"
-, journal =	"SIAM J. Discrete Math."
-, volume =	6
-, number =	2
-, year =	1993
-, pages =	"214--229"
-, keywords =	"graph drawing, planar, straight-line, disk packing, coin graph"
-, update =	"95.05 tamassia"
+, author =      "G. R. Brightwell and E. R. Scheinerman"
+, title =       "Representations of Planar Graphs"
+, journal =     "SIAM J. Discrete Math."
+, volume =      6
+, number =      2
+, year =        1993
+, pages =       "214--229"
+, keywords =    "graph drawing, planar, straight-line, disk packing, coin graph"
+, update =      "95.05 tamassia"
 }
 
 @article{bt-odpm-97
-, author =	"Graham R. Brightwell and William T. Trotter"
-, title =	"The Order Dimension of Planar Maps"
-, journal =	"SIAM J. Discrete Math."
-, volume =	10
-, number =	4
-, year =	1997
-, pages =	"515--528"
-, update =	"98.07 tamassia+vismara"
+, author =      "Graham R. Brightwell and William T. Trotter"
+, title =       "The Order Dimension of Planar Maps"
+, journal =     "SIAM J. Discrete Math."
+, volume =      10
+, number =      4
+, year =        1997
+, pages =       "515--528"
+, update =      "98.07 tamassia+vismara"
 }
 
 @inproceedings{bk-igcsd-94
-, author =	"T. Brinkhoff and H.-P. Kriegel"
-, title =	"The Impact of Global Clusterings on Spatial Database Systems"
-, booktitle =	"Proceedings of the International Conference on Very Large Databases"
-, publisher =	"Morgan Kauffman"
-, month =	sep
-, year =	1994
-, pages =	"168--179"
-, update =	"98.07 agarwal"
+, author =      "T. Brinkhoff and H.-P. Kriegel"
+, title =       "The Impact of Global Clusterings on Spatial Database Systems"
+, booktitle =   "Proceedings of the International Conference on Very Large Databases"
+, publisher =   "Morgan Kauffman"
+, month =       sep
+, year =        1994
+, pages =       "168--179"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{bks-epsju-93
-, author =	"T. Brinkhoff and H.-P. Kriegel and B. Seeger"
-, title =	"Efficient Processing of Spatial Joins Using {R}-Trees"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1993
-, pages =	"237--246"
-, update =	"97.07 agarwal, 96.09 kreveld"
+, author =      "T. Brinkhoff and H.-P. Kriegel and B. Seeger"
+, title =       "Efficient Processing of Spatial Joins Using {R}-Trees"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1993
+, pages =       "237--246"
+, update =      "97.07 agarwal, 96.09 kreveld"
 }
 
 @inproceedings{bgh-cqpst-94
-, author =	"A. Brinkman and T. Graf and K. Hinrichs"
-, title =	"The colored quadrant priority search tree with an application to the all-nearest-foreign-neighbors problem"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"63--68"
-, cites =	"aert-otbsp-92, gh-appcp-93, gs-dfbt-78, hns-arsa2-92, iko-pstsm-88, k-racrn-88, lw-vdllm-80, m-pst-85, o-ncbbs-82, ow-ubtcl-89, ow-ad-93, ps-cgi-85, sh-cpp-75, t-dsna-83, v-oaann-89, clr-ia-90, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "A. Brinkman and T. Graf and K. Hinrichs"
+, title =       "The colored quadrant priority search tree with an application to the all-nearest-foreign-neighbors problem"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "63--68"
+, cites =       "aert-otbsp-92, gh-appcp-93, gs-dfbt-78, hns-arsa2-92, iko-pstsm-88, k-racrn-88, lw-vdllm-80, m-pst-85, o-ncbbs-82, ow-ubtcl-89, ow-ad-93, ps-cgi-85, sh-cpp-75, t-dsna-83, v-oaann-89, clr-ia-90, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @article{b-pedlp-88
-, author =	"M. Brion"
-, title =	"Points entires dans les poly{\`e}dres convexes"
-, journal =	"Annales Sci. {\'E}c. Norm. Sup., Ser IV"
-, volume =	21
-, number =	4
-, year =	1988
-, pages =	"653--663"
-, update =	"97.11 bibrelex"
+, author =      "M. Brion"
+, title =       "Points entires dans les poly{\`e}dres convexes"
+, journal =     "Annales Sci. {\'E}c. Norm. Sup., Ser IV"
+, volume =      21
+, number =      4
+, year =        1988
+, pages =       "653--663"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{b-rgsdt-88
-, author =	"E. Brisson"
-, title =	"Representing geometric structures in $d$ dimensions: Topology and order"
-, number =	"88-11-07"
-, institution =	"Dept. of Computer Science, Univ. of Washington"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "E. Brisson"
+, title =       "Representing geometric structures in $d$ dimensions: Topology and order"
+, number =      "88-11-07"
+, institution = "Dept. of Computer Science, Univ. of Washington"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{b-rgsdd-89
-, author =	"E. Brisson"
-, title =	"Representing geometric structures in $d$ dimensions: Topology and order"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"218--227"
-, cites =	"b-rgsdt-88, dl-pmtds-87, gs-pmgsc-85, lw-tcc-69, m-eat-84, m-tfc-75, ph-chfsp-77, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 95.09 agarwal"
+, author =      "E. Brisson"
+, title =       "Representing geometric structures in $d$ dimensions: Topology and order"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "218--227"
+, cites =       "b-rgsdt-88, dl-pmtds-87, gs-pmgsc-85, lw-tcc-69, m-eat-84, m-tfc-75, ph-chfsp-77, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 95.09 agarwal"
 }
 
 @article{b-rgsdd-93
-, author =	"E. Brisson"
-, title =	"Representing Geometric Structures in $d$ Dimensions: Topology and Order"
-, journal =	"Discrete Comput. Geom."
-, volume =	9
-, year =	1993
-, pages =	"387--426"
-, succeeds =	"b-rgsdd-89"
-, update =	"95.09 brisson"
+, author =      "E. Brisson"
+, title =       "Representing Geometric Structures in $d$ Dimensions: Topology and Order"
+, journal =     "Discrete Comput. Geom."
+, volume =      9
+, year =        1993
+, pages =       "387--426"
+, succeeds =    "b-rgsdd-89"
+, update =      "95.09 brisson"
 }
 
 @techreport{b-edrhu-87
-, author =	"D. Broch"
-, title =	"Enhancing the dexterity of a robot hand using controlled slip"
-, type =	"Technical {Report}"
-, number =	"MIT AI-TR-992"
-, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1987
-, update =	"98.07 bibrelex"
+, author =      "D. Broch"
+, title =       "Enhancing the dexterity of a robot hand using controlled slip"
+, type =        "Technical {Report}"
+, number =      "MIT AI-TR-992"
+, institution = "Artif. Intell. Lab., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1987
+, update =      "98.07 bibrelex"
 }
 
 @incollection{b-flerg-87
-, author =	"J. Brock"
-, title =	"Finding the largest empty rectangle on a grated surface"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	247
-, year =	1987
-, pages =	"66--75"
-, keywords =	"isothetic, empty rectangle"
-, update =	"95.05 korneenko"
+, author =      "J. Brock"
+, title =       "Finding the largest empty rectangle on a grated surface"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      247
+, year =        1987
+, pages =       "66--75"
+, keywords =    "isothetic, empty rectangle"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{bl-piss-99
-, author =	"Christoph Br{\"o}cker and Alejandro L{\'o}pez-Ortiz"
-, title =	"Position-Independent Street Searching"
-, booktitle =	"Proc. 6th Workshop Algorithms Data Struct."
-, nickname =	"WADS '99"
-, site =	"Vancouver, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1663
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"241--252"
-, update =	"00.03 bibrelex"
+, author =      "Christoph Br{\"o}cker and Alejandro L{\'o}pez-Ortiz"
+, title =       "Position-Independent Street Searching"
+, booktitle =   "Proc. 6th Workshop Algorithms Data Struct."
+, nickname =    "WADS '99"
+, site =        "Vancouver, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1663
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "241--252"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{bs-srsc-99
-, author =	"Christoph Br{\"o}cker and Sven Schuierer"
-, title =	"Searching Rectilinear Streets Completely"
-, booktitle =	"Proc. 6th Workshop Algorithms Data Struct."
-, nickname =	"WADS '99"
-, site =	"Vancouver, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1663
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"98--109"
-, update =	"00.03 bibrelex"
+, author =      "Christoph Br{\"o}cker and Sven Schuierer"
+, title =       "Searching Rectilinear Streets Completely"
+, booktitle =   "Proc. 6th Workshop Algorithms Data Struct."
+, nickname =    "WADS '99"
+, site =        "Vancouver, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1663
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "98--109"
+, update =      "00.03 bibrelex"
 }
 
 @incollection{bj-dpcho-00
-, author =	"Gerth St{\o}lting Brodal and Riko Jacob"
-, title =	"Dynamic Planar Convex Hull with Optimal Query Time and $O(\log n\cdot\log\log n)$ Update Time"
-, booktitle =	"Proc. 7th Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1851
-, publisher =	"Springer-Verlag"
-, year =	2000
-, pages =	"57--70"
-, update =	"01.07 orourke"
+, author =      "Gerth St{\o}lting Brodal and Riko Jacob"
+, title =       "Dynamic Planar Convex Hull with Optimal Query Time and $O(\log n\cdot\log\log n)$ Update Time"
+, booktitle =   "Proc. 7th Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1851
+, publisher =   "Springer-Verlag"
+, year =        2000
+, pages =       "57--70"
+, update =      "01.07 orourke"
 }
 
 @article{bdfru-wcrtr-95
-, author =	"A. Z. Broder and M. E. Dyer and A. M. Frieze and P. Raghavan and E. Upfal"
-, title =	"The worst-case running time of the random simplex algorithm is exponential in the height"
-, journal =	"Inform. Proc. Letters"
-, volume =	56
-, number =	2
-, year =	1995
-, pages =	"79--81"
-, update =	"97.03 gaertner+salinger"
+, author =      "A. Z. Broder and M. E. Dyer and A. M. Frieze and P. Raghavan and E. Upfal"
+, title =       "The worst-case running time of the random simplex algorithm is exponential in the height"
+, journal =     "Inform. Proc. Letters"
+, volume =      56
+, number =      2
+, year =        1995
+, pages =       "79--81"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{bpg-cfpa-93
-, author =	"M. Brokowski and M. A. Peskin and K. Goldberg"
-, title =	"Curved fences for part alignment"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Atlanta, GA"
-, volume =	3
-, year =	1993
-, pages =	"467--473"
-, update =	"98.07 bibrelex"
+, author =      "M. Brokowski and M. A. Peskin and K. Goldberg"
+, title =       "Curved fences for part alignment"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Atlanta, GA"
+, volume =      3
+, year =        1993
+, pages =       "467--473"
+, update =      "98.07 bibrelex"
 }
 
 @article{bk-facus-73
-, author =	"C. Bron and J. Kerbosch"
-, title =	"Finding all cliques of an undirected subgraph"
-, journal =	"Commun. ACM"
-, volume =	16
-, year =	1973
-, pages =	"575--577"
-, update =	"98.07 bibrelex"
+, author =      "C. Bron and J. Kerbosch"
+, title =       "Finding all cliques of an undirected subgraph"
+, journal =     "Commun. ACM"
+, volume =      16
+, year =        1973
+, pages =       "575--577"
+, update =      "98.07 bibrelex"
 }
 
 @proceedings{b-ewcg-99
-, title =	"Abstracts 15th European Workshop Comput. Geom."
-, editor =	"Herv{\'e} Br{\"o}nnimann"
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, isbn =	"2-7261-1139-4"
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 15th European Workshop Comput. Geom."
+, editor =      "Herv{\'e} Br{\"o}nnimann"
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, isbn =        "2-7261-1139-4"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{b-aops-94
-, author =	"Herv{\'e} Br{\"o}nnimann"
-, title =	"Almost Optimal Polyhedral Separators"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"393--394"
-, keywords =	"video review"
-, cites =	"bg-aoscf-94, d-ascg-90, dt-gascg-94, ms-saps-92, ZZZ"
-, update =	"99.07 devillers, 98.03 bibrelex, 94.09 jones"
+, author =      "Herv{\'e} Br{\"o}nnimann"
+, title =       "Almost Optimal Polyhedral Separators"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "393--394"
+, keywords =    "video review"
+, cites =       "bg-aoscf-94, d-ascg-90, dt-gascg-94, ms-saps-92, ZZZ"
+, update =      "99.07 devillers, 98.03 bibrelex, 94.09 jones"
 }
 
 @techreport{b-imhsh-94
-, author =	"Herv{\'e} Br{\"o}nnimann"
-, title =	"An implementation of {MIN} {HITTING} {SET} heuristics"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1994
-, update =	"99.07 devillers, 98.03 bibrelex"
+, author =      "Herv{\'e} Br{\"o}nnimann"
+, title =       "An implementation of {MIN} {HITTING} {SET} heuristics"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1994
+, update =      "99.07 devillers, 98.03 bibrelex"
 }
 
 @inproceedings{b-dchol-98
-, author =	"Herv{\'e} Br{\"o}nnimann"
-, title =	"Degenerate convex hulls on-line in any fixed dimension"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"249--258"
-, update =	"99.07 devillers, 98.11 devillers"
+, author =      "Herv{\'e} Br{\"o}nnimann"
+, title =       "Degenerate convex hulls on-line in any fixed dimension"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "249--258"
+, update =      "99.07 devillers, 98.11 devillers"
 }
 
 @phdthesis{b-dga-95
-, author =	"Herv{\'e} Br{\"o}nnimann"
-, title =	"Derandomization of Geometric Algorithms"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Princeton University"
-, address =	"Princeton, NJ"
-, month =	may
-, year =	1995
-, keywords =	"doctoral thesis"
-, update =	"99.07 devillers, 96.09 devillers"
+, author =      "Herv{\'e} Br{\"o}nnimann"
+, title =       "Derandomization of Geometric Algorithms"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Princeton University"
+, address =     "Princeton, NJ"
+, month =       may
+, year =        1995
+, keywords =    "doctoral thesis"
+, update =      "99.07 devillers, 96.09 devillers"
 }
 
 @inproceedings{bbp-iayea-98cg
-, author =	"Herv{\'e} Br{\"o}nnimann and Christoph Burnikel and Sylvain Pion"
-, title =	"Interval Arithmetic Yields Efficient Arithmetic Filters for Computational Geometry"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"49--54"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Herv{\'e} Br{\"o}nnimann and Christoph Burnikel and Sylvain Pion"
+, title =       "Interval Arithmetic Yields Efficient Arithmetic Filters for Computational Geometry"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "49--54"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{bbp-iayed-98scg
-, author =	"Herv{\'e} Br{\"o}nnimann and Christoph Burnikel and Sylvain Pion"
-, title =	"Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"165--174"
-, update =	"99.07 devillers, 98.07 tamassia"
+, author =      "Herv{\'e} Br{\"o}nnimann and Christoph Burnikel and Sylvain Pion"
+, title =       "Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "165--174"
+, update =      "99.07 devillers, 98.07 tamassia"
 }
 
 @inproceedings{bc-hhihr-92
-, author =	"Herv{\'e} Br{\"o}nnimann and Bernard Chazelle"
-, title =	"How hard is halfspace range searching?"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"271--275"
-, cites =	"as-anps-91, bfk-ictor-81, c-lbcpr-89, c-lbors1-90, c-lbors2-90, cr-ccpso-91, cr-lbcsr-92, csw-qoubs-90, cw-qorss-89, cs-arscg-89, cy-grp-84, ew-hrsls-86, elr-dlsrd-70, f-lbcor-81, f-lbcso-81, hw-ensrq-87, m-tnhl-52, m-rph-91, m-rsehc-91, m-dsa-84, s-iggp-76, w-pr-82, y-cmps-85, y-3spia-83, yy-gaddg-85, ZZZ"
-, update =	"99.07 devillers, 98.03 mitchell, 97.11 bibrelex"
+, author =      "Herv{\'e} Br{\"o}nnimann and Bernard Chazelle"
+, title =       "How hard is halfspace range searching?"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "271--275"
+, cites =       "as-anps-91, bfk-ictor-81, c-lbcpr-89, c-lbors1-90, c-lbors2-90, cr-ccpso-91, cr-lbcsr-92, csw-qoubs-90, cw-qorss-89, cs-arscg-89, cy-grp-84, ew-hrsls-86, elr-dlsrd-70, f-lbcor-81, f-lbcso-81, hw-ensrq-87, m-tnhl-52, m-rph-91, m-rsehc-91, m-dsa-84, s-iggp-76, w-pr-82, y-cmps-85, y-3spia-83, yy-gaddg-85, ZZZ"
+, update =      "99.07 devillers, 98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{bc-ossc-94
-, author =	"Herv{\'e} Br{\"o}nnimann and Bernard Chazelle"
-, title =	"Optimal Slope Selection Via Cuttings"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"99--103"
-, precedes =	"bc-ossc-98"
-, cites =	"aks-scps-83, bcm-prsss-93, c-chdc-93 , cegs-dwclp-92, cm-ltdao-93, csss-otass-89, dmn-rass-92, ks-osse-93, m-aogdc-91, m-roass-91, m-apcad-83, ZZZ"
-, update =	"99.07 devillers, 98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 94.09 jones"
+, author =      "Herv{\'e} Br{\"o}nnimann and Bernard Chazelle"
+, title =       "Optimal Slope Selection Via Cuttings"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "99--103"
+, precedes =    "bc-ossc-98"
+, cites =       "aks-scps-83, bcm-prsss-93, c-chdc-93 , cegs-dwclp-92, cm-ltdao-93, csss-otass-89, dmn-rass-92, ks-osse-93, m-aogdc-91, m-roass-91, m-apcad-83, ZZZ"
+, update =      "99.07 devillers, 98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 94.09 jones"
 }
 
 @article{bc-ossc-98
-, author =	"Herv{\'e} Br{\"o}nnimann and Bernard Chazelle"
-, title =	"Optimal Slope Selection Via Cuttings"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, number =	1
-, year =	1998
-, pages =	"23--29"
-, succeeds =	"bc-ossc-94"
-, update =	"99.07 devillers, 98.07 bibrelex+mitchell+smid, 98.03 mitchell"
+, author =      "Herv{\'e} Br{\"o}nnimann and Bernard Chazelle"
+, title =       "Optimal Slope Selection Via Cuttings"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, number =      1
+, year =        1998
+, pages =       "23--29"
+, succeeds =    "bc-ossc-94"
+, update =      "99.07 devillers, 98.07 bibrelex+mitchell+smid, 98.03 mitchell"
 }
 
 @inproceedings{bcm-prsss-93
-, author =	"Herv{\'e} Br{\"o}nnimann and Bernard Chazelle and Ji{\v r}{\'\i} Matou{\v s}ek"
-, title =	"Product Range Spaces, Sensitive Sampling, and Derandomization"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1993
-, pages =	"400--409"
-, keywords =	"approximations, epsilon-nets, derandomization, diameter computation, method of conditional probabilities, parametric search"
-, update =	"96.09 agarwal, 96.05 agarwal, 94.01 smid, 93.09 matousek+milone+mitchell"
+, author =      "Herv{\'e} Br{\"o}nnimann and Bernard Chazelle and Ji{\v r}{\'\i} Matou{\v s}ek"
+, title =       "Product Range Spaces, Sensitive Sampling, and Derandomization"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1993
+, pages =       "400--409"
+, keywords =    "approximations, epsilon-nets, derandomization, diameter computation, method of conditional probabilities, parametric search"
+, update =      "96.09 agarwal, 96.05 agarwal, 94.01 smid, 93.09 matousek+milone+mitchell"
 }
 
 @article{bcm-prsss-99
-, author =	"H. Br{\"o}nnimann and B. Chazelle and J. Matou{\v s}ek"
-, title =	"Product Range Spaces, Sensitive Sampling, and Derandomization"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1999
-, pages =	"1552--1575"
-, update =	"00.03 smid"
+, author =      "H. Br{\"o}nnimann and B. Chazelle and J. Matou{\v s}ek"
+, title =       "Product Range Spaces, Sensitive Sampling, and Derandomization"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1999
+, pages =       "1552--1575"
+, update =      "00.03 smid"
 }
 
 @article{bcp-hhihr-93
-, author =	"H. Br{\"o}nnimann and Bernard Chazelle and J. Pach"
-, title =	"How hard is halfspace range searching"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"143--155"
-, succeeds =	"bc-hhihr-92"
-, update =	"98.03 mitchell, 97.11 bibrelex, 94.01 matousek"
+, author =      "H. Br{\"o}nnimann and Bernard Chazelle and J. Pach"
+, title =       "How hard is halfspace range searching"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "143--155"
+, succeeds =    "bc-hhihr-92"
+, update =      "98.03 mitchell, 97.11 bibrelex, 94.01 matousek"
 }
 
 @techreport{bd-uubhq-99
-, author =	"Herv{\'e} Br{\"o}nnimann and Olivier Devillers"
-, title =	"The union of unit balls has quadratic complexity, even if they all contain the origin"
-, type =	"Rapport de recherche"
-, number =	3758
-, institution =	"INRIA"
-, year =	1999
-, archive =	"XXX:cs.CG/9907025"
-, cites =	"h-bevv-56, bcddy-acchs-96"
-, update =	"99.11 devillers"
-, abstract =	"We provide a lower bound construction showing that the union of unit balls in $R^3$ has quadratic complexity, even if they all contain the origin. This settles a conjecture of Sharir."
+, author =      "Herv{\'e} Br{\"o}nnimann and Olivier Devillers"
+, title =       "The union of unit balls has quadratic complexity, even if they all contain the origin"
+, type =        "Rapport de recherche"
+, number =      3758
+, institution = "INRIA"
+, year =        1999
+, archive =     "XXX:cs.CG/9907025"
+, cites =       "h-bevv-56, bcddy-acchs-96"
+, update =      "99.11 devillers"
+, abstract =    "We provide a lower bound construction showing that the union of unit balls in $R^3$ has quadratic complexity, even if they all contain the origin. This settles a conjecture of Sharir."
 }
 
 @inproceedings{beh-eeeafcs-05
@@ -27463,80 +27463,80 @@ @inproceedings{beh-eeeafcs-05
 }
 
 @inproceedings{bepp-cegpu-97
-, author =	"Herv{\'e} Br{\"o}nnimann and Ioannis Emiris and Victor Pan and Sylvain Pion"
-, title =	"Computing exact geometric predicates using modular arithmetic with single precision"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"174--182"
-, precedes =	"bepp-sdrns-99"
-, cites =	"ahu-daca-74, abdpy-enmcs-95, bp-fa-94, by-eeesd-97i, bcl-casac-82, bkmnsu-egcl-95, c-sede-92, clr-ia-90, em-sstcd-90, e-cicgd-98, ec-gard-95, f-nsa2d-92, fv-eeacg-93, fv-sayee-96, gkz-drmd-94, gl-mc-83, h-pargc-88, h-hsism-96, hhk-rsops-89, hp-asdmr-94, kkm-ebrgl-96, k-sa-81, l-chi-82, lmc-ecdde-94, pys-antcm-97, p-pcpgs-96, r-cpagt-95, s-rafpg-96, si-rtoia-94, wrg-csdsp-92, y-tegc-97, y-ecgtm-95, yd-ecp-95, ZZZ"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.11 icking, 97.07 efrat"
+, author =      "Herv{\'e} Br{\"o}nnimann and Ioannis Emiris and Victor Pan and Sylvain Pion"
+, title =       "Computing exact geometric predicates using modular arithmetic with single precision"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "174--182"
+, precedes =    "bepp-sdrns-99"
+, cites =       "ahu-daca-74, abdpy-enmcs-95, bp-fa-94, by-eeesd-97i, bcl-casac-82, bkmnsu-egcl-95, c-sede-92, clr-ia-90, em-sstcd-90, e-cicgd-98, ec-gard-95, f-nsa2d-92, fv-eeacg-93, fv-sayee-96, gkz-drmd-94, gl-mc-83, h-pargc-88, h-hsism-96, hhk-rsops-89, hp-asdmr-94, kkm-ebrgl-96, k-sa-81, l-chi-82, lmc-ecdde-94, pys-antcm-97, p-pcpgs-96, r-cpagt-95, s-rafpg-96, si-rtoia-94, wrg-csdsp-92, y-tegc-97, y-ecgtm-95, yd-ecp-95, ZZZ"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.11 icking, 97.07 efrat"
 }
 
 @article{bepp-sdrns-99
-, author =	"Herv{\'e} Br{\"o}nnimann and Ioannis Emiris and Victor Pan and Sylvain Pion"
-, title =	"Sign Determination in {R}esidue {N}umber {S}ystems"
-, journal =	"Theoret. Comput. Sci."
-, volume =	210
-, number =	1
-, year =	1999
-, pages =	"173--197"
-, note =	"Special Issue on Real Numbers and Computers"
-, url =	"https://hal.inria.fr/inria-00344324"
-, succeeds =	"bepp-cegpu-97"
-, update =	"99.07 devillers"
+, author =      "Herv{\'e} Br{\"o}nnimann and Ioannis Emiris and Victor Pan and Sylvain Pion"
+, title =       "Sign Determination in {R}esidue {N}umber {S}ystems"
+, journal =     "Theoret. Comput. Sci."
+, volume =      210
+, number =      1
+, year =        1999
+, pages =       "173--197"
+, note =        "Special Issue on Real Numbers and Computers"
+, url = "https://inria.hal.science/inria-00344324"
+, succeeds =    "bepp-cegpu-97"
+, update =      "99.07 devillers"
 }
 
 @inproceedings{bg-aoscf-94
-, author =	"H. Br{\"o}nnimann and M. T. Goodrich"
-, title =	"Almost Optimal Set Covers in Finite {VC}-Dimension"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"293--302"
-, cites =	"ammrs-dtgm-93, a-ded-83, b-luhs-90, bglr-epcpa-93, brs-enasc-89, br-t3nnn-88, behw-clgcv-89, b-imhsh-94, bcm-prsss-93, c-ochan-91, c-chdc-93, ceggs-ibwen-93, cf-dvrsi-90, cm-ltdao-93, cw-qorss-89, c-ghscp-79, c-lvalp-88, cs-arscg-89, c-apca-93, clr-ia-90, d-ascg-90, gj-cigtn-79, g-gpmee-93, hw-ensrq-87, h-aascv-82, hm-ascpp-85, j-aacp-74, k-racpc-72, kpw-atben-92, l-lqwia-87, l-roifc-75, ly-hamp-93, m-cen-90, m-aogdc-91, m-cha-91, m-rsehc-92, m-rph-92, msw-hnlls-90, mww-deabv-91, m-ept-92, ms-saps-92, s-dfs-72, vc-ucrfe-71, w-pttco-88, ZZZ"
-, update =	"98.03 bibrelex, 96.09 agarwal, 94.09 jones, 94.01 jones"
+, author =      "H. Br{\"o}nnimann and M. T. Goodrich"
+, title =       "Almost Optimal Set Covers in Finite {VC}-Dimension"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "293--302"
+, cites =       "ammrs-dtgm-93, a-ded-83, b-luhs-90, bglr-epcpa-93, brs-enasc-89, br-t3nnn-88, behw-clgcv-89, b-imhsh-94, bcm-prsss-93, c-ochan-91, c-chdc-93, ceggs-ibwen-93, cf-dvrsi-90, cm-ltdao-93, cw-qorss-89, c-ghscp-79, c-lvalp-88, cs-arscg-89, c-apca-93, clr-ia-90, d-ascg-90, gj-cigtn-79, g-gpmee-93, hw-ensrq-87, h-aascv-82, hm-ascpp-85, j-aacp-74, k-racpc-72, kpw-atben-92, l-lqwia-87, l-roifc-75, ly-hamp-93, m-cen-90, m-aogdc-91, m-cha-91, m-rsehc-92, m-rph-92, msw-hnlls-90, mww-deabv-91, m-ept-92, ms-saps-92, s-dfs-72, vc-ucrfe-71, w-pttco-88, ZZZ"
+, update =      "98.03 bibrelex, 96.09 agarwal, 94.09 jones, 94.01 jones"
 }
 
 @article{bg-aoscf-95
-, author =	"H. Br{\"o}nnimann and M. T. Goodrich"
-, title =	"Almost Optimal Set Covers in Finite {VC}-Dimension"
-, journal =	"Discrete Comput. Geom."
-, volume =	14
-, year =	1995
-, pages =	"263--279"
-, update =	"96.09 agarwal, 96.05 agarwal"
+, author =      "H. Br{\"o}nnimann and M. T. Goodrich"
+, title =       "Almost Optimal Set Covers in Finite {VC}-Dimension"
+, journal =     "Discrete Comput. Geom."
+, volume =      14
+, year =        1995
+, pages =       "263--279"
+, update =      "96.09 agarwal, 96.05 agarwal"
 }
 
 @misc{bikmm-oipcha-01
-, author =	"Herv{\'e} Br{\"o}nnimann and John Iacono and Jryki Katajainen and Pat Morin and Jason Morrison"
-, title =	"Optimal In-Place Planar Convex Hull Algorithms"
-, howpublished =	"11th Annual Fall Workshop on Computational Geometry"
-, year =	2001
-, note =	"\url{http://geometry.poly.edu/cgwpapers/}"
-, url =	"http://geometry.poly.edu/cgwpapers/hbr\_inplace.ps"
-, update =	"02.03 orourke"
+, author =      "Herv{\'e} Br{\"o}nnimann and John Iacono and Jryki Katajainen and Pat Morin and Jason Morrison"
+, title =       "Optimal In-Place Planar Convex Hull Algorithms"
+, howpublished =        "11th Annual Fall Workshop on Computational Geometry"
+, year =        2001
+, note =        "\url{http://geometry.poly.edu/cgwpapers/}"
+, url = "http://geometry.poly.edu/cgwpapers/hbr\_inplace.ps"
+, update =      "02.03 orourke"
 }
 
 @inproceedings{bp-ergc-97
-, author =	"Herv{\'e} Br{\"o}nnimann and Sylvain Pion"
-, title =	"Exact rounding for geometric constructions"
-, booktitle =	"GAMM/IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics"
-, year =	1997
-, pages =	""
-, url =	"https://hal.inria.fr/inria-00344403/"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.11 devillers"
+, author =      "Herv{\'e} Br{\"o}nnimann and Sylvain Pion"
+, title =       "Exact rounding for geometric constructions"
+, booktitle =   "GAMM/IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics"
+, year =        1997
+, pages =       ""
+, url = "https://inria.hal.science/inria-00344403/"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.11 devillers"
 }
 
 @techreport{by-cacas-96
-, author =	"Herv{\'e} Br{\"o}nnimann and Mariette Yvinec"
-, title =	"A complete analysis of {Clarkson}'s algorithm for safe determinant evaluation"
-, type =	"Research {Report}"
-, number =	3051
-, institution =	"INRIA"
-, year =	1996
-, url =	"http://www.inria.fr/rapports/sophia/RR-3051.html"
-, update =	"99.11 devillers, 99.07 devillers, 97.07 devillers"
-, abstract =	"In this paper, we give a complete and self-contained
+, author =      "Herv{\'e} Br{\"o}nnimann and Mariette Yvinec"
+, title =       "A complete analysis of {Clarkson}'s algorithm for safe determinant evaluation"
+, type =        "Research {Report}"
+, number =      3051
+, institution = "INRIA"
+, year =        1996
+, url = "http://www.inria.fr/rapports/sophia/RR-3051.html"
+, update =      "99.11 devillers, 99.07 devillers, 97.07 devillers"
+, abstract =    "In this paper, we give a complete and self-contained
 analysis of Clarkson's algorithm that performs safe and efficient
 determinant evaluation of an $n\times n$ matrix with integer
 coefficients that can be expressed with $b$ bits. Clarkson's original
@@ -27556,39 +27556,39 @@ @techreport{by-cacas-96
 }
 
 @inproceedings{by-eeesd-97i
-, author =	"Herv{\'e} Br{\"o}nnimann and Mariette Yvinec"
-, title =	"Efficient exact evaluation of signs of determinants"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"166--173"
-, precedes =	"by-eeesd-00"
-, cites =	"abdpy-esdus-94, abdpy-enmcs-95, bkmnsu-egcl-95, c-accgc-96, c-sede-92, dp-papaf-96, fm-cslas-67, f-nsa2d-92, fv-eeacg-93, hhk-tirgc-88, h-gsm-89, kln-edtur-91, lm-cschu-90, m-dpggt-89, s-rafpg-96, si-smsft-89, si-rtoia-94, y-tegc-93, yd-ecp-95, ZZZ"
-, update =	"00.03 devillers, 99.07 devillers, 98.07 bibrelex, 97.11 icking, 97.07 efrat"
+, author =      "Herv{\'e} Br{\"o}nnimann and Mariette Yvinec"
+, title =       "Efficient exact evaluation of signs of determinants"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "166--173"
+, precedes =    "by-eeesd-00"
+, cites =       "abdpy-esdus-94, abdpy-enmcs-95, bkmnsu-egcl-95, c-accgc-96, c-sede-92, dp-papaf-96, fm-cslas-67, f-nsa2d-92, fv-eeacg-93, hhk-tirgc-88, h-gsm-89, kln-edtur-91, lm-cschu-90, m-dpggt-89, s-rafpg-96, si-smsft-89, si-rtoia-94, y-tegc-93, yd-ecp-95, ZZZ"
+, update =      "00.03 devillers, 99.07 devillers, 98.07 bibrelex, 97.11 icking, 97.07 efrat"
 }
 
 @article{by-eeesd-00
-, author =	"Herv{\'e} Br{\"o}nnimann and Mariette Yvinec"
-, title =	"Efficient Exact Evaluation of Signs of Determinants"
-, journal =	"Algorithmica"
-, volume =	27
-, year =	2000
-, pages =	"21--56"
-, keywords =	"determinant, robustness, Clarkson, safe, lattice, exact arithmetic, precision"
-, succeeds =	"by-eeesd-97i"
-, cites =	"abdpy-esdus-94, abdpy-enmcs-95, bkmnsu-egcl-95, c-accgc-96, c-sede-92, dp-papaf-96, fm-cslas-67, f-nsa2d-92, fv-eeacg-93, hhk-tirgc-88, h-gsm-89, kln-edtur-91, lm-cschu-90, m-dpggt-89, s-rafpg-96, si-smsft-89, si-rtoia-94, y-tegc-93, yd-ecp-95, ZZZ"
-, update =	"00.03 devillers"
+, author =      "Herv{\'e} Br{\"o}nnimann and Mariette Yvinec"
+, title =       "Efficient Exact Evaluation of Signs of Determinants"
+, journal =     "Algorithmica"
+, volume =      27
+, year =        2000
+, pages =       "21--56"
+, keywords =    "determinant, robustness, Clarkson, safe, lattice, exact arithmetic, precision"
+, succeeds =    "by-eeesd-97i"
+, cites =       "abdpy-esdus-94, abdpy-enmcs-95, bkmnsu-egcl-95, c-accgc-96, c-sede-92, dp-papaf-96, fm-cslas-67, f-nsa2d-92, fv-eeacg-93, hhk-tirgc-88, h-gsm-89, kln-edtur-91, lm-cschu-90, m-dpggt-89, s-rafpg-96, si-smsft-89, si-rtoia-94, y-tegc-93, yd-ecp-95, ZZZ"
+, update =      "00.03 devillers"
 }
 
 @techreport{by-eeesd-97t
-, author =	"Herv{\'e}. Br{\"o}nnimann and Mariette Yvinec"
-, title =	"Efficient Exact Evaluation of Signs of Determinants"
-, type =	"Research {Report}"
-, number =	3140
-, institution =	"INRIA"
-, year =	1997
-, url =	"http://www.inria.fr/rapports/sophia/RR-3140.html"
-, update =	"99.07 devillers, 97.07 devillers"
-, abstract =	"This paper presents a theoretical and experimental study
+, author =      "Herv{\'e}. Br{\"o}nnimann and Mariette Yvinec"
+, title =       "Efficient Exact Evaluation of Signs of Determinants"
+, type =        "Research {Report}"
+, number =      3140
+, institution = "INRIA"
+, year =        1997
+, url = "http://www.inria.fr/rapports/sophia/RR-3140.html"
+, update =      "99.07 devillers, 97.07 devillers"
+, abstract =    "This paper presents a theoretical and experimental study
 on two different methods to evaluate the sign of a determinant with
 integer entries. The first one is a method based on the Gram-Schmidt
 orthogonalisation process which has been proposed by Clarkson. We review
@@ -27603,1020 +27603,1020 @@ @techreport{by-eeesd-97t
 }
 
 @book{b-icp-83
-, author =	"A. Br{\"o}nsted"
-, title =	"An Introduction to Convex Polytopes"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1983
+, author =      "A. Br{\"o}nsted"
+, title =       "An Introduction to Convex Polytopes"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1983
 }
 
 @book{bsmm-tdm-93
-, author =	"I. N. Bronstein and K. A. Semendjajew and G. Musiol and H. M{\"u}hlig"
-, title =	"Taschenbuch der Mathematik"
-, publisher =	"Harri Deutsch"
-, address =	"Frankfurt am Main"
-, year =	1993
-, update =	"00.03 bibrelex"
+, author =      "I. N. Bronstein and K. A. Semendjajew and G. Musiol and H. M{\"u}hlig"
+, title =       "Taschenbuch der Mathematik"
+, publisher =   "Harri Deutsch"
+, address =     "Frankfurt am Main"
+, year =        1993
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{bl-sacsf-83
-, author =	"R. Brooks and T. Lozano-P{\'e}rez"
-, title =	"A subdivision algorithm in configuration space for findpath with rotation"
-, booktitle =	"Proc. 8th Internat. Joint Conf. Artif. Intell."
-, site =	"Karlsruhe, West Germany"
-, month =	aug
-, year =	1983
-, update =	"98.03 bibrelex"
+, author =      "R. Brooks and T. Lozano-P{\'e}rez"
+, title =       "A subdivision algorithm in configuration space for findpath with rotation"
+, booktitle =   "Proc. 8th Internat. Joint Conf. Artif. Intell."
+, site =        "Karlsruhe, West Germany"
+, month =       aug
+, year =        1983
+, update =      "98.03 bibrelex"
 }
 
 @techreport{b-fppcr-82
-, author =	"R. A. Brooks"
-, title =	"Find-path for a {PUMA}-class robot"
-, type =	"Manuscript"
-, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1982
+, author =      "R. A. Brooks"
+, title =       "Find-path for a {PUMA}-class robot"
+, type =        "Manuscript"
+, institution = "Artif. Intell. Lab., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1982
 }
 
 @article{b-pcfmp-83
-, author =	"R. A. Brooks"
-, title =	"Planning Collision-Free Motions for Pick-and-Place Operations"
-, journal =	"Internat. J. Robot. Res."
-, volume =	4
-, year =	1983
-, pages =	"19--44"
-, update =	"93.09 milone+mitchell"
+, author =      "R. A. Brooks"
+, title =       "Planning Collision-Free Motions for Pick-and-Place Operations"
+, journal =     "Internat. J. Robot. Res."
+, volume =      4
+, year =        1983
+, pages =       "19--44"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{b-sfppg-83
-, author =	"R. A. Brooks"
-, title =	"Solving the Find-Path Problem by Good Representation of Free Space"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	13
-, number =	3
-, year =	1983
-, pages =	"190--197"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "R. A. Brooks"
+, title =       "Solving the Find-Path Problem by Good Representation of Free Space"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      13
+, number =      3
+, year =        1983
+, pages =       "190--197"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @techreport{bl-sacsf-82
-, author =	"R. A. Brooks and T. Lozano-P{\'e}rez"
-, title =	"A subdivision algorithm in configuration space for findpath with rotation"
-, type =	"Report"
-, number =	684
-, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1982
-, precedes =	"bl-sacsf-85"
-, update =	"95.05 korneenko"
+, author =      "R. A. Brooks and T. Lozano-P{\'e}rez"
+, title =       "A subdivision algorithm in configuration space for findpath with rotation"
+, type =        "Report"
+, number =      684
+, institution = "Artif. Intell. Lab., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1982
+, precedes =    "bl-sacsf-85"
+, update =      "95.05 korneenko"
 }
 
 @article{bl-sacsf-85
-, author =	"R. A. Brooks and T. Lozano-P{\'e}rez"
-, title =	"A subdivision algorithm in configuration space for findpath with rotation"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	15
-, number =	2
-, year =	1985
-, pages =	"224--233"
-, keywords =	"motion planning"
-, succeeds =	"bl-sacsf-82"
-, update =	"95.05 korneenko"
+, author =      "R. A. Brooks and T. Lozano-P{\'e}rez"
+, title =       "A subdivision algorithm in configuration space for findpath with rotation"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      15
+, number =      2
+, year =        1985
+, pages =       "224--233"
+, keywords =    "motion planning"
+, succeeds =    "bl-sacsf-82"
+, update =      "95.05 korneenko"
 }
 
 @phdthesis{b-appmt-91
-, author =	"R. Brost"
-, title =	"Analysis and planning of planar manipulation tasks"
-, school =	"Carnegie Mellon University"
-, year =	1991
-, note =	"Report CMU-CS-91-149"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "R. Brost"
+, title =       "Analysis and planning of planar manipulation tasks"
+, school =      "Carnegie Mellon University"
+, year =        1991
+, note =        "Report CMU-CS-91-149"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @inproceedings{b-agppu-86
-, author =	"R. Brost"
-, title =	"Automatic grasp planning in the presence of uncertainty"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"San Francisco, CA"
-, month =	apr
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "R. Brost"
+, title =       "Automatic grasp planning in the presence of uncertainty"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "San Francisco, CA"
+, month =       apr
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bg-casmf-94
-, author =	"R. C. Brost and K. Y. Goldberg"
-, title =	"A complete algorithm for synthesizing modular fixtures for polygonal parts"
-, booktitle =	"Proc. 11th IEEE Internat. Conf. Robot. Autom."
-, month =	may
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "R. C. Brost and K. Y. Goldberg"
+, title =       "A complete algorithm for synthesizing modular fixtures for polygonal parts"
+, booktitle =   "Proc. 11th IEEE Internat. Conf. Robot. Autom."
+, month =       may
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bm-gaprb-89
-, author =	"R. C. Brost and M. T. Mason"
-, title =	"Graphical Analysis of Planar Rigid Body Dynamics with Multiple Frictional Contacts"
-, booktitle =	"Proc. 5th Intl. Symp. on Robotics Research"
-, year =	1989
-, pages =	"367--374"
-, update =	"97.11 bibrelex"
+, author =      "R. C. Brost and M. T. Mason"
+, title =       "Graphical Analysis of Planar Rigid Body Dynamics with Multiple Frictional Contacts"
+, booktitle =   "Proc. 5th Intl. Symp. on Robotics Research"
+, year =        1989
+, pages =       "367--374"
+, update =      "97.11 bibrelex"
 }
 
 @article{bdf-cvp-78
-, author =	"W. Brostow and J. P. Dussault and B. L. Fox"
-, title =	"Construction of {Voronoi} polyhedra"
-, journal =	"J. Comput. Phys."
-, volume =	29
-, year =	1978
-, pages =	"81--92"
+, author =      "W. Brostow and J. P. Dussault and B. L. Fox"
+, title =       "Construction of {Voronoi} polyhedra"
+, journal =     "J. Comput. Phys."
+, volume =      29
+, year =        1978
+, pages =       "81--92"
 }
 
 @article{b-fodm-84
-, author =	"P. Brou"
-, title =	"Finding Objects in Depth Maps"
-, journal =	"Internat. J. Robot. Res."
-, volume =	"??"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "P. Brou"
+, title =       "Finding Objects in Depth Maps"
+, journal =     "Internat. J. Robot. Res."
+, volume =      "??"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{b-mp-66
-, author =	"U. A. Brousseau"
-, title =	"A mathematician's progress"
-, journal =	"Math. Teacher"
-, volume =	59
-, year =	1966
-, pages =	"722--727"
-, update =	"98.03 agarwal"
+, author =      "U. A. Brousseau"
+, title =       "A mathematician's progress"
+, journal =     "Math. Teacher"
+, volume =      59
+, year =        1966
+, pages =       "722--727"
+, update =      "98.03 agarwal"
 }
 
 @book{bcn-drg-89
-, author =	"A. E. Brouwer and A. M. Cohen and A. Neumaier"
-, title =	"Distance-regular graphs"
-, publisher =	"Springer-Verlag"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "A. E. Brouwer and A. M. Cohen and A. Neumaier"
+, title =       "Distance-regular graphs"
+, publisher =   "Springer-Verlag"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bv-p2p-79
-, author =	"C. M. Brown and H. B. Voelcker"
-, title =	"The {PADL}-2 project"
-, booktitle =	"Proc. 7th NSF Grantees' Conf. Product. Res. Tech."
-, site =	"Ithaca, NY"
-, year =	1979
-, pages =	"??"
+, author =      "C. M. Brown and H. B. Voelcker"
+, title =       "The {PADL}-2 project"
+, booktitle =   "Proc. 7th NSF Grantees' Conf. Product. Res. Tech."
+, site =        "Ithaca, NY"
+, year =        1979
+, pages =       "??"
 }
 
 @article{b-pdsa-65
-, author =	"G. S. Brown"
-, title =	"Point density in stems per acre"
-, journal =	"New Zealand Forestry Service Research Notes"
-, volume =	38
-, year =	1965
-, pages =	"1--11"
-, update =	"97.03 schwarzkopf"
+, author =      "G. S. Brown"
+, title =       "Point density in stems per acre"
+, journal =     "New Zealand Forestry Service Research Notes"
+, volume =      38
+, year =        1965
+, pages =       "1--11"
+, update =      "97.03 schwarzkopf"
 }
 
 @article{b-scaps-97
-, author =	"J. L. Brown"
-, title =	"Systems of coordinates associated with points scattered in the plane"
-, journal =	"Comput. Aided Design"
-, volume =	14
-, year =	1997
-, pages =	"547--559"
-, update =	"01.07 devillers"
+, author =      "J. L. Brown"
+, title =       "Systems of coordinates associated with points scattered in the plane"
+, journal =     "Comput. Aided Design"
+, volume =      14
+, year =        1997
+, pages =       "547--559"
+, update =      "01.07 devillers"
 }
 
 @article{b-vbddt-91
-, author =	"J. L. Brown"
-, title =	"Vertex Based Data Dependent Triangulations"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	8
-, year =	1991
-, pages =	"239--251"
-, annote =	"Cost of triangulation is sum of costs of nodes (node
-		 cost depends on the triangulation). Local optimizations
-		 to improve the cost. Reports good results using square
-		 of sums of angles between each adjacent facet and
-		 average normal at vertex."
+, author =      "J. L. Brown"
+, title =       "Vertex Based Data Dependent Triangulations"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      8
+, year =        1991
+, pages =       "239--251"
+, annote =      "Cost of triangulation is sum of costs of nodes (node
+                 cost depends on the triangulation). Local optimizations
+                 to improve the cost. Reports good results using square
+                 of sums of angles between each adjacent facet and
+                 average normal at vertex."
 }
 
 @article{b-carcg-81
-, author =	"K. Q. Brown"
-, title =	"Comments on ``{Algorithms} for reporting and counting geometric intersections''"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-30"
-, year =	1981
-, pages =	"147--148"
-, succeeds =	"bo-arcgi-79"
+, author =      "K. Q. Brown"
+, title =       "Comments on ``{Algorithms} for reporting and counting geometric intersections''"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-30"
+, year =        1981
+, pages =       "147--148"
+, succeeds =    "bo-arcgi-79"
 }
 
 @techreport{b-fihs-78
-, author =	"K. Q. Brown"
-, title =	"Fast intersection of half spaces"
-, type =	"Report"
-, number =	"CMU-CS-78-129"
-, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1978
+, author =      "K. Q. Brown"
+, title =       "Fast intersection of half spaces"
+, type =        "Report"
+, number =      "CMU-CS-78-129"
+, institution = "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1978
 }
 
 @phdthesis{b-gtfga-80
-, author =	"K. Q. Brown"
-, title =	"Geometric transforms for fast geometric algorithms"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1980
-, note =	"Report CMU-CS-80-101"
-, keywords =	"doctoral thesis, geometric transformations"
-, comments =	"UMI DA80-12772, 154 pp."
-, update =	"93.09 jones, 93.05 jones"
+, author =      "K. Q. Brown"
+, title =       "Geometric transforms for fast geometric algorithms"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1980
+, note =        "Report CMU-CS-80-101"
+, keywords =    "doctoral thesis, geometric transformations"
+, comments =    "UMI DA80-12772, 154 pp."
+, update =      "93.09 jones, 93.05 jones"
 }
 
 @article{b-vdch-79
-, author =	"K. Q. Brown"
-, title =	"Voronoi diagrams from convex hulls"
-, journal =	"Inform. Process. Lett."
-, volume =	9
-, number =	5
-, year =	1979
-, pages =	"223--228"
-, update =	"98.11 bibrelex"
+, author =      "K. Q. Brown"
+, title =       "Voronoi diagrams from convex hulls"
+, journal =     "Inform. Process. Lett."
+, volume =      9
+, number =      5
+, year =        1979
+, pages =       "223--228"
+, update =      "98.11 bibrelex"
 }
 
 @article{b-lfitm-62
-, author =	"M. Brown"
-, title =	"Locally flat imbeddings of topological manifolds"
-, journal =	"Ann. Math."
-, volume =	75
-, year =	1962
-, pages =	"331--341"
-, update =	"97.11 bibrelex"
+, author =      "M. Brown"
+, title =       "Locally flat imbeddings of topological manifolds"
+, journal =     "Ann. Math."
+, volume =      75
+, year =        1962
+, pages =       "331--341"
+, update =      "97.11 bibrelex"
 }
 
 @book{b-aa-87
-, author =	"M. H. Brown"
-, title =	"Algorithm Animation"
-, series =	"ACM Distinguished Dissertations Series"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "M. H. Brown"
+, title =       "Algorithm Animation"
+, series =      "ACM Distinguished Dissertations Series"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{b-eaub-88
-, author =	"M. H. Brown"
-, title =	"Exploring algorithms using Balsa-{II}"
-, journal =	"Computer"
-, volume =	21
-, number =	5
-, month =	may
-, year =	1988
-, pages =	"14--36"
-, update =	"98.11 bibrelex"
+, author =      "M. H. Brown"
+, title =       "Exploring algorithms using Balsa-{II}"
+, journal =     "Computer"
+, volume =      21
+, number =      5
+, month =       may
+, year =        1988
+, pages =       "14--36"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{b-1saf-93
-, author =	"M. H. Brown"
-, title =	"The $1992$ {SRC} animation festival"
-, booktitle =	"Proc. IEEE Sympos. on Visual Languages"
-, month =	aug
-, year =	1993
-, pages =	"116--123"
-, update =	"98.03 bibrelex"
+, author =      "M. H. Brown"
+, title =       "The $1992$ {SRC} animation festival"
+, booktitle =   "Proc. IEEE Sympos. on Visual Languages"
+, month =       aug
+, year =        1993
+, pages =       "116--123"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{b-zsaam-92
-, author =	"M. H. Brown"
-, title =	"Zeus: {A} system for algorithm animation and multi-view editing"
-, type =	"Technical {Report}"
-, number =	75
-, institution =	"Digital Systems Research Center"
-, address =	"Palo Alto, CA"
-, month =	feb
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "M. H. Brown"
+, title =       "Zeus: {A} system for algorithm animation and multi-view editing"
+, type =        "Technical {Report}"
+, number =      75
+, institution = "Digital Systems Research Center"
+, address =     "Palo Alto, CA"
+, month =       feb
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @article{b-zsaam-92a
-, author =	"M. H. Brown"
-, title =	"Zeus: {A} system for algorithm animation and multi-view editing"
-, journal =	"Comput. Graph."
-, volume =	18
-, number =	3
-, year =	1992
-, pages =	"177--186"
-, update =	"98.07 bibrelex"
+, author =      "M. H. Brown"
+, title =       "Zeus: {A} system for algorithm animation and multi-view editing"
+, journal =     "Comput. Graph."
+, volume =      18
+, number =      3
+, year =        1992
+, pages =       "177--186"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{b-zsaa-91
-, author =	"M. H. Brown"
-, title =	"Zeus: {A} system for algorithms animation"
-, booktitle =	"Proc. IEEE Workshop on Visual Languages"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "M. H. Brown"
+, title =       "Zeus: {A} system for algorithms animation"
+, booktitle =   "Proc. IEEE Workshop on Visual Languages"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @article{bh-csaa-92
-, author =	"M. H. Brown and J. Hershberger"
-, title =	"Color and sound in algorithms animation"
-, journal =	"IEEE Comput."
-, volume =	25
-, number =	12
-, year =	1992
-, pages =	"52--63"
-, update =	"98.03 bibrelex"
+, author =      "M. H. Brown and J. Hershberger"
+, title =       "Color and sound in algorithms animation"
+, journal =     "IEEE Comput."
+, volume =      25
+, number =      12
+, year =        1992
+, pages =       "52--63"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{bn-cat-96
-, author =	"M. H. Brown and M. A. Najork"
-, title =	"Collaborative Active Textbooks"
-, booktitle =	"IEEE Symp. on Visual Languages"
-, year =	1996
-, update =	"98.07 tamassia"
+, author =      "M. H. Brown and M. A. Najork"
+, title =       "Collaborative Active Textbooks"
+, booktitle =   "IEEE Symp. on Visual Languages"
+, year =        1996
+, update =      "98.07 tamassia"
 }
 
 @techreport{bn-catwb-96
-, author =	"M. H. Brown and M. A. Najork"
-, title =	"Collaborative active textbooks: {A} web-based algorithm animation system for an electronic classroom"
-, type =	"Research {Report}"
-, number =	142
-, institution =	"SRC"
-, month =	may
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "M. H. Brown and M. A. Najork"
+, title =       "Collaborative active textbooks: {A} web-based algorithm animation system for an electronic classroom"
+, type =        "Research {Report}"
+, number =      142
+, institution = "SRC"
+, month =       may
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @article{bs-taa-85
-, author =	"M. H. Brown and R. Sedgewick"
-, title =	"Techniques for algorithm animation"
-, journal =	"IEEE Softw."
-, volume =	2
-, number =	1
-, month =	jan
-, year =	1985
-, pages =	"28--39"
-, update =	"98.07 bibrelex"
+, author =      "M. H. Brown and R. Sedgewick"
+, title =       "Techniques for algorithm animation"
+, journal =     "IEEE Softw."
+, volume =      2
+, number =      1
+, month =       jan
+, year =        1985
+, pages =       "28--39"
+, update =      "98.07 bibrelex"
 }
 
 @article{bt-dadsr-80
-, author =	"M. R. Brown and R. E. Tarjan"
-, title =	"Design and analysis of a data structure for representing sorted lists"
-, journal =	"SIAM J. Comput."
-, volume =	9
-, year =	1980
-, pages =	"594--614"
-, update =	"97.11 bibrelex"
+, author =      "M. R. Brown and R. E. Tarjan"
+, title =       "Design and analysis of a data structure for representing sorted lists"
+, journal =     "SIAM J. Comput."
+, volume =      9
+, year =        1980
+, pages =       "594--614"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bg-ooldg-92
-, author =	"P. Brown and T. Gargiulo"
-, title =	"An Object Oriented Layout for Directed Graphs"
-, booktitle =	"Proc. IEEE Symposium on Assessment of Quality Software Development Tools"
-, month =	may
-, year =	1992
-, pages =	"??"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Brown and T. Gargiulo"
+, title =       "An Object Oriented Layout for Directed Graphs"
+, booktitle =   "Proc. IEEE Symposium on Assessment of Quality Software Development Tools"
+, month =       may
+, year =        1992
+, pages =       "??"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{b-bdn-87
-, author =	"D. Brownawell"
-, title =	"Bounds for the degrees in the {Nullstellensatz}"
-, journal =	"Annals of Math. Second Series"
-, volume =	126
-, number =	3
-, year =	1987
-, pages =	"577--591"
-, update =	"98.03 bibrelex"
+, author =      "D. Brownawell"
+, title =       "Bounds for the degrees in the {Nullstellensatz}"
+, journal =     "Annals of Math. Second Series"
+, volume =      126
+, number =      3
+, year =        1987
+, pages =       "577--591"
+, update =      "98.03 bibrelex"
 }
 
 @article{b-lpsl-86
-, author =	"D. R. K. Brownrigg"
-, title =	"Lattice partitions with a straight line"
-, journal =	"Canad. Math. Bull."
-, volume =	29
-, year =	1986
-, pages =	"287--294"
-, keywords =	"discrete geometry"
-, update =	"95.05 korneenko"
+, author =      "D. R. K. Brownrigg"
+, title =       "Lattice partitions with a straight line"
+, journal =     "Canad. Math. Bull."
+, volume =      29
+, year =        1986
+, pages =       "287--294"
+, keywords =    "discrete geometry"
+, update =      "95.05 korneenko"
 }
 
 @techreport{bdmpw-gas-87
-, author =	"A. Browyer and J. Davenport and P. Milne and J. Padget and A. Wallis"
-, title =	"A geometric algebra system"
-, type =	"Draft"
-, institution =	"Schools of Mechanical Engineering and Mathematical Sciences, Univ. Bath"
-, address =	"Bath, UK"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "A. Browyer and J. Davenport and P. Milne and J. Padget and A. Wallis"
+, title =       "A geometric algebra system"
+, type =        "Draft"
+, institution = "Schools of Mechanical Engineering and Mathematical Sciences, Univ. Bath"
+, address =     "Bath, UK"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @book{bg-cs2e-92
-, author =	"J. W. Bruce and P. J. Giblin"
-, title =	"Curves and Singularities (2nd edition)"
-, publisher =	"Cambridge University Press"
-, address =	"New York"
-, year =	1992
-, update =	"98.03 agarwal"
+, author =      "J. W. Bruce and P. J. Giblin"
+, title =       "Curves and Singularities (2nd edition)"
+, publisher =   "Cambridge University Press"
+, address =     "New York"
+, year =        1992
+, update =      "98.03 agarwal"
 }
 
 @article{b-asppg-87
-, author =	"M. W. Brucker"
-, title =	"Approximation of a set of points by points of a grid"
-, journal =	"Computer"
-, volume =	38
-, number =	4
-, year =	1987
-, pages =	"341--345"
-, keywords =	"discrete geometry, approximation, fitting"
-, update =	"95.05 korneenko"
+, author =      "M. W. Brucker"
+, title =       "Approximation of a set of points by points of a grid"
+, journal =     "Computer"
+, volume =      38
+, number =      4
+, year =        1987
+, pages =       "341--345"
+, keywords =    "discrete geometry, approximation, fitting"
+, update =      "95.05 korneenko"
 }
 
 @incollection{b-ccp-77
-, author =	"P. Brucker"
-, title =	"On the Complexity of Clustering Problems"
-, editor =	"R. Henn and B. Korte and W. Oletti"
-, booktitle =	"Optimizing and Operations Research"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1977
-, update =	"98.03 bibrelex"
+, author =      "P. Brucker"
+, title =       "On the Complexity of Clustering Problems"
+, editor =      "R. Henn and B. Korte and W. Oletti"
+, booktitle =   "Optimizing and Operations Research"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1977
+, update =      "98.03 bibrelex"
 }
 
 @article{bm-stip-88
-, author =	"P. Brucker and W. Meyer"
-, title =	"Scheduling two irregular polygons"
-, journal =	"Discrete Appl. Math."
-, volume =	20
-, number =	2
-, year =	1988
-, pages =	"91--100"
-, keywords =	"polygon, proximity, optimization"
-, update =	"95.05 korneenko"
+, author =      "P. Brucker and W. Meyer"
+, title =       "Scheduling two irregular polygons"
+, journal =     "Discrete Appl. Math."
+, volume =      20
+, number =      2
+, year =        1988
+, pages =       "91--100"
+, keywords =    "polygon, proximity, optimization"
+, update =      "95.05 korneenko"
 }
 
 @techreport{boo-dspir-91
-, author =	"A. Bruckstein and L. O'Gorman and A. Orlitsky"
-, title =	"Design of shapes for precise image registration"
-, type =	"Technical Report"
-, institution =	"AT\&T"
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "A. Bruckstein and L. O'Gorman and A. Orlitsky"
+, title =       "Design of shapes for precise image registration"
+, type =        "Technical Report"
+, institution = "AT\&T"
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @article{bn-dipcr-95
-, author =	"A. M. Bruckstein and A. N. Netravali"
-, title =	"On differential invariants of planar curves and recognizing partially occluded planar shapes"
-, journal =	"Ann. Math. Artif. Intell."
-, volume =	13
-, year =	1995
-, pages =	"227--250"
-, keywords =	"matching, shape recognition, vision"
-, update =	"98.07 bibrelex, 95.09 mitchell"
+, author =      "A. M. Bruckstein and A. N. Netravali"
+, title =       "On differential invariants of planar curves and recognizing partially occluded planar shapes"
+, journal =     "Ann. Math. Artif. Intell."
+, volume =      13
+, year =        1995
+, pages =       "227--250"
+, keywords =    "matching, shape recognition, vision"
+, update =      "98.07 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{b-agpc-88
-, author =	"B. Br{\"u}derlin"
-, title =	"Automatizing geometric proofs and constructions"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"232--252"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "B. Br{\"u}derlin"
+, title =       "Automatizing geometric proofs and constructions"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "232--252"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{b-rcga-90
-, author =	"Beat Br{\"u}derlin"
-, title =	"Robustness of Computational Geometry Algorithms"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	9
-, update =	"00.03 bibrelex"
+, author =      "Beat Br{\"u}derlin"
+, title =       "Robustness of Computational Geometry Algorithms"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       9
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{b-afvab-91
-, author =	"B. Bruenning"
-, title =	"Air Force Vulnerability Analyses from {BRL-CAD} models"
-, booktitle =	"Proc. BRL-CAD Symposium `91"
-, publisher =	"American Defense Preparadness Assoc."
-, address =	"Aberdeen Proving Ground, MD"
-, year =	1991
-, pages =	"1--13"
-, update =	"95.05 agarwal"
+, author =      "B. Bruenning"
+, title =       "Air Force Vulnerability Analyses from {BRL-CAD} models"
+, booktitle =   "Proc. BRL-CAD Symposium `91"
+, publisher =   "American Defense Preparadness Assoc."
+, address =     "Aberdeen Proving Ground, MD"
+, year =        1991
+, pages =       "1--13"
+, update =      "95.05 agarwal"
 }
 
 @misc{bw-dtnt-87
-, author =	"A. Bruggemann-Klein and D. Wood"
-, title =	"Drawing Trees Nicely with {TEX}"
-, institution =	"Department of Computer Science, University of Waterloo"
-, year =	1987
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "A. Bruggemann-Klein and D. Wood"
+, title =       "Drawing Trees Nicely with {TEX}"
+, institution = "Department of Computer Science, University of Waterloo"
+, year =        1987
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{bm-sdcs-71
-, author =	"H. Bruggesser and P. Mani"
-, title =	"Shellable decompositions of cells and spheres"
-, journal =	"Math. Scand."
-, volume =	29
-, year =	1971
-, pages =	"197--205"
+, author =      "H. Bruggesser and P. Mani"
+, title =       "Shellable decompositions of cells and spheres"
+, journal =     "Math. Scand."
+, volume =      29
+, year =        1971
+, pages =       "197--205"
 }
 
 @article{b-ttt-84
-, author =	"G. Br{\"u}gner"
-, title =	"Three-triangle-tangram"
-, journal =	"BIT"
-, volume =	24
-, year =	1984
-, pages =	"380--382"
+, author =      "G. Br{\"u}gner"
+, title =       "Three-triangle-tangram"
+, journal =     "BIT"
+, volume =      24
+, year =        1984
+, pages =       "380--382"
 }
 
 @book{b-navw-54
-, author =	"N. G. de Bruijn"
-, title =	"Nieuw Archief voor Wiskunde"
-, volume =	2
-, publisher =	"??"
-, year =	1954
-, update =	"98.03 bibrelex"
+, author =      "N. G. de Bruijn"
+, title =       "Nieuw Archief voor Wiskunde"
+, volume =      2
+, publisher =   "??"
+, year =        1954
+, update =      "98.03 bibrelex"
 }
 
 @incollection{b-p11a-55
-, author =	"N. G. de Bruijn"
-, title =	"Problems 17 and 18. Answers"
-, booktitle =	"Opgaven met de oplossingen"
-, volume =	20
-, publisher =	"??"
-, year =	1955
-, pages =	"19--20"
-, update =	"98.03 bibrelex"
+, author =      "N. G. de Bruijn"
+, title =       "Problems 17 and 18. Answers"
+, booktitle =   "Opgaven met de oplossingen"
+, volume =      20
+, publisher =   "??"
+, year =        1955
+, pages =       "19--20"
+, update =      "98.03 bibrelex"
 }
 
 @article{be-cp-48
-, author =	"N. G. de Bruin and P. Erd{\H o}s"
-, title =	"On a combinatorial problem"
-, journal =	"Proc. Konink. Nederl. Akad. Wetensch. Ser. A"
-, volume =	51
-, year =	1948
-, pages =	"1277--1279"
-, note =	"Indagationes Math. 10, 421-423"
-, update =	"98.03 bibrelex"
+, author =      "N. G. de Bruin and P. Erd{\H o}s"
+, title =       "On a combinatorial problem"
+, journal =     "Proc. Konink. Nederl. Akad. Wetensch. Ser. A"
+, volume =      51
+, year =        1948
+, pages =       "1277--1279"
+, note =        "Indagationes Math. 10, 421-423"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{b-sspds-91
-, author =	"A. M. Brukstein"
-, title =	"Self-similarity properties of digitized straight lines"
-, booktitle =	"Vision Geom.: Proc. AMS Spec. Sess. Hoboken, NJ 1989"
-, publisher =	"AMS Press"
-, year =	1991
-, pages =	"1--20"
-, keywords =	"digital geometry"
-, update =	"95.05 korneenko"
+, author =      "A. M. Brukstein"
+, title =       "Self-similarity properties of digitized straight lines"
+, booktitle =   "Vision Geom.: Proc. AMS Spec. Sess. Hoboken, NJ 1989"
+, publisher =   "AMS Press"
+, year =        1991
+, pages =       "1--20"
+, keywords =    "digital geometry"
+, update =      "95.05 korneenko"
 }
 
 @article{bn-srueo-90
-, author =	"P. Brunet and I. Navazo"
-, title =	"Solid representations using extended octrees"
-, journal =	"ACM Trans. Graph."
-, volume =	9
-, year =	1990
-, pages =	"170--197"
+, author =      "P. Brunet and I. Navazo"
+, title =       "Solid representations using extended octrees"
+, journal =     "ACM Trans. Graph."
+, volume =      9
+, year =        1990
+, pages =       "170--197"
 }
 
 @article{bmfn-psbzi-
-, author =	"A. Br{\"u}ngger and A. Marzetta and K. Fukuda and J. Nievergelt"
-, title =	"The parallel search bench {ZRAM} and its applications"
-, journal =	"Ann. Oper. Res."
-, volume =	"??"
-, year =	"??"
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "A. Br{\"u}ngger and A. Marzetta and K. Fukuda and J. Nievergelt"
+, title =       "The parallel search bench {ZRAM} and its applications"
+, journal =     "Ann. Oper. Res."
+, volume =      "??"
+, year =        "??"
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @article{bjy-sonop-91
-, author =	"D. Bruschi and D. Joseph and P. Young"
-, title =	"A structural overview of {NP} optimization problems"
-, journal =	"Algorithms Rev."
-, volume =	2
-, number =	1
-, year =	1991
-, pages =	"1--26"
+, author =      "D. Bruschi and D. Joseph and P. Young"
+, title =       "A structural overview of {NP} optimization problems"
+, journal =     "Algorithms Rev."
+, volume =      2
+, number =      1
+, year =        1991
+, pages =       "1--26"
 }
 
 @inproceedings{bf-fi3dg-96
-, author =	"I. Bru{\ss} and A. Frick"
-, title =	"Fast Interactive {3-D} Graph Visualization"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"99--110"
-, keywords =	"graph drawing, 3D, straight-line"
-, update =	"97.03 tamassia, 96.09 tamassia, 96.04 garg"
+, author =      "I. Bru{\ss} and A. Frick"
+, title =       "Fast Interactive {3-D} Graph Visualization"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "99--110"
+, keywords =    "graph drawing, 3D, straight-line"
+, update =      "97.03 tamassia, 96.09 tamassia, 96.04 garg"
 }
 
 @article{bd-tdsbt-90
-, author =	"Elisabetta Bruzzone and Leila {De Floriani}"
-, title =	"Two data structures for building tetrahedralizations"
-, journal =	"Visual Comput."
-, volume =	6
-, number =	5
-, month =	nov
-, year =	1990
-, pages =	"266--283"
-, keywords =	"solid modeling, decomposition models, tetrahedralization, Delaunay triangulation, data structures"
+, author =      "Elisabetta Bruzzone and Leila {De Floriani}"
+, title =       "Two data structures for building tetrahedralizations"
+, journal =     "Visual Comput."
+, volume =      6
+, number =      5
+, month =       nov
+, year =        1990
+, pages =       "266--283"
+, keywords =    "solid modeling, decomposition models, tetrahedralization, Delaunay triangulation, data structures"
 }
 
 @inproceedings{bdp-mtdt-89
-, author =	"Elisabetta Bruzzone and Leila {De Floriani} and Enrico Puppo"
-, title =	"Manipulating Three-Dimensional Triangulations"
-, editor =	"W. Litwin and H. Scheck"
-, booktitle =	"Foundations of Data Organization and Algorithms: 3rd International Conference, FODO 1989"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1989
-, update =	"96.09 agarwal"
-, annote =	"Describes data structure for representing 3D
-		 triangulations. Relationships VE, EV, EF, FE, FT, TF
-		 are explicitly represented and the others can be
-		 deduced from these in time proportional to the size of
-		 the output."
+, author =      "Elisabetta Bruzzone and Leila {De Floriani} and Enrico Puppo"
+, title =       "Manipulating Three-Dimensional Triangulations"
+, editor =      "W. Litwin and H. Scheck"
+, booktitle =   "Foundations of Data Organization and Algorithms: 3rd International Conference, FODO 1989"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1989
+, update =      "96.09 agarwal"
+, annote =      "Describes data structure for representing 3D
+                 triangulations. Relationships VE, EV, EF, FE, FT, TF
+                 are explicitly represented and the others can be
+                 deduced from these in time proportional to the size of
+                 the output."
 }
 
 @article{bs-ftmsb-85
-, author =	"R. Bryant and D. Singerman"
-, title =	"Foundations of the theory of maps on surfaces with boundaries"
-, journal =	"Quart. J. Math. Oxford"
-, volume =	2
-, number =	36
-, year =	1985
-, pages =	"17--41"
-, update =	"98.07 bibrelex"
+, author =      "R. Bryant and D. Singerman"
+, title =       "Foundations of the theory of maps on surfaces with boundaries"
+, journal =     "Quart. J. Math. Oxford"
+, volume =      2
+, number =      36
+, year =        1985
+, pages =       "17--41"
+, update =      "98.07 bibrelex"
 }
 
 @article{b-slrpg-89
-, author =	"V. W. Bryant"
-, title =	"Straight line representations of planar graphs"
-, journal =	"Elem. Math."
-, volume =	44
-, number =	3
-, year =	1989
-, pages =	"64--66"
-, keywords =	"geometric graphs"
-, update =	"95.05 korneenko"
+, author =      "V. W. Bryant"
+, title =       "Straight line representations of planar graphs"
+, journal =     "Elem. Math."
+, volume =      44
+, number =      3
+, year =        1989
+, pages =       "64--66"
+, keywords =    "geometric graphs"
+, update =      "95.05 korneenko"
 }
 
 @article{bz-trdpo-93
-, author =	"T. H. Brylawski and G. M. Ziegler"
-, title =	"Topological representation of dual pairs of oriented matroids"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"237--240"
-, update =	"96.05 pocchiola"
+, author =      "T. H. Brylawski and G. M. Ziegler"
+, title =       "Topological representation of dual pairs of oriented matroids"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "237--240"
+, update =      "96.05 pocchiola"
 }
 
 @article{b-omt-74
-, author =	"O. Bryngdahl"
-, title =	"Optical map transformations"
-, journal =	"Optics Commun."
-, volume =	10
-, number =	2
-, year =	1974
-, pages =	"164--168"
-, update =	"97.11 bibrelex"
+, author =      "O. Bryngdahl"
+, title =       "Optical map transformations"
+, journal =     "Optics Commun."
+, volume =      10
+, number =      2
+, year =        1974
+, pages =       "164--168"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-gto-74
-, author =	"O. Brynghdahl"
-, title =	"Geometrical transformations in optics"
-, journal =	"J. Optical Soc. Amer."
-, volume =	64
-, number =	8
-, year =	1974
-, pages =	"1092--1099"
-, update =	"97.11 bibrelex"
+, author =      "O. Brynghdahl"
+, title =       "Geometrical transformations in optics"
+, journal =     "J. Optical Soc. Amer."
+, volume =      64
+, number =      8
+, year =        1974
+, pages =       "1092--1099"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{bgmst-ntdfl-96
-, author =	"Nader Bshouty and Sally A. Goldman and H. David Mathias and Subhash Suri and Hisao Tamaki"
-, title =	"Noise-Tolerant Distribution-Free Learning of General Geometric Concepts"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '96"
-, site =	"Philadelphia, PA"
-, month =	may
-, year =	1996
-, pages =	"151--160"
-, update =	"00.03 smid, 98.07 bibrelex, 98.03 mitchell"
+, author =      "Nader Bshouty and Sally A. Goldman and H. David Mathias and Subhash Suri and Hisao Tamaki"
+, title =       "Noise-Tolerant Distribution-Free Learning of General Geometric Concepts"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '96"
+, site =        "Philadelphia, PA"
+, month =       may
+, year =        1996
+, pages =       "151--160"
+, update =      "00.03 smid, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @incollection{b-lbact-91
-, author =	"N. H. Bshouty"
-, title =	"Lower bounds for algebraic computation trees of functions with finite domains"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	497
-, year =	1991
-, pages =	"55--65"
-, keywords =	"lower bounds"
-, update =	"95.05 korneenko"
+, author =      "N. H. Bshouty"
+, title =       "Lower bounds for algebraic computation trees of functions with finite domains"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      497
+, year =        1991
+, pages =       "55--65"
+, keywords =    "lower bounds"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{b-amnlc-88
-, author =	"B. Buchberger"
-, title =	"Algebraic methods for non-linear computational geometry"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"81--82"
-, cites =	"ab-arag-88, acm-cad1b-84, b-eakfd-70, b-gbamp-85, b-agbnc-88, bck-amgr-88, c-qercf-75, e-acg-87, ps-cgi-85, r-da-50, w-bpmtp-84, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "B. Buchberger"
+, title =       "Algebraic methods for non-linear computational geometry"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "81--82"
+, cites =       "ab-arag-88, acm-cad1b-84, b-eakfd-70, b-gbamp-85, b-agbnc-88, bck-amgr-88, c-qercf-75, e-acg-87, ps-cgi-85, r-da-50, w-bpmtp-84, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{b-agbnc-88
-, author =	"B. Buchberger"
-, title =	"Applications of {Gr\"obner} bases in nonlinear computational geometry"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	296
-, year =	1988
-, pages =	"52--80"
-, keywords =	"algebraic geometry, motion planning"
-, update =	"95.05 korneenko"
+, author =      "B. Buchberger"
+, title =       "Applications of {Gr\"obner} bases in nonlinear computational geometry"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      296
+, year =        1988
+, pages =       "52--80"
+, keywords =    "algebraic geometry, motion planning"
+, update =      "95.05 korneenko"
 }
 
 @article{b-aklag-70
-, author =	"Bruno Buchberger"
-, title =	"Ein algorithmisches {Kriterium} f{\"u}r die {L{\"o}sbarkeit} eines algebraischen {Gleichungssystems}"
-, journal =	"Aequationes Mathematicae"
-, volume =	4
-, number =	3
-, year =	1970
-, pages =	"374--383"
-, update =	"00.03 bibrelex"
+, author =      "Bruno Buchberger"
+, title =       "Ein algorithmisches {Kriterium} f{\"u}r die {L{\"o}sbarkeit} eines algebraischen {Gleichungssystems}"
+, journal =     "Aequationes Mathematicae"
+, volume =      4
+, number =      3
+, year =        1970
+, pages =       "374--383"
+, update =      "00.03 bibrelex"
 }
 
 @article{b-eakfd-70
-, author =	"B. Buchberger"
-, title =	"Ein algorithmisches {Kriterium} f{\"u}r die {L{\"o}sbarkeit} eines algebraischen {Gleichungssystems}"
-, journal =	"Aequationes Math."
-, volume =	4
-, number =	3
-, year =	1970
-, pages =	"374--383"
-, update =	"98.03 bibrelex"
+, author =      "B. Buchberger"
+, title =       "Ein algorithmisches {Kriterium} f{\"u}r die {L{\"o}sbarkeit} eines algebraischen {Gleichungssystems}"
+, journal =     "Aequationes Math."
+, volume =      4
+, number =      3
+, year =        1970
+, pages =       "374--383"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{b-gbamp-85
-, author =	"B. Buchberger"
-, title =	"{Gr{\"o}bner} Bases: {An} Algorithmic Method in Polynomial Ideal Theory"
-, chapter =	6
-, editor =	"N. Bose"
-, booktitle =	"Multidimensional Systems Theory"
-, publisher =	"Reidel Publishing"
-, year =	1985
-, update =	"01.07 devillers, 97.11 bibrelex"
+, author =      "B. Buchberger"
+, title =       "{Gr{\"o}bner} Bases: {An} Algorithmic Method in Polynomial Ideal Theory"
+, chapter =     6
+, editor =      "N. Bose"
+, booktitle =   "Multidimensional Systems Theory"
+, publisher =   "Reidel Publishing"
+, year =        1985
+, update =      "01.07 devillers, 97.11 bibrelex"
 }
 
 @article{b-hbfcp-87
-, author =	"B. Buchberger"
-, title =	"History and basic features of the critical-pair/completion procedure"
-, journal =	"J. Symbolic Comput."
-, volume =	3
-, year =	1987
-, pages =	"3--38"
-, update =	"98.03 bibrelex"
+, author =      "B. Buchberger"
+, title =       "History and basic features of the critical-pair/completion procedure"
+, journal =     "J. Symbolic Comput."
+, volume =      3
+, year =        1987
+, pages =       "3--38"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{b-wcgbd-89
-, author =	"B. Buchberger"
-, title =	"What can {Gr{\"o}bner} bases do for computational geometry and robotics?"
-, editor =	"D. Kapur and J. L. Mundy"
-, booktitle =	"Geometric Reasoning"
-, publisher =	"MIT Press"
-, year =	1989
-, pages =	"415--447"
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "B. Buchberger"
+, title =       "What can {Gr{\"o}bner} bases do for computational geometry and robotics?"
+, editor =      "D. Kapur and J. L. Mundy"
+, booktitle =   "Geometric Reasoning"
+, publisher =   "MIT Press"
+, year =        1989
+, pages =       "415--447"
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @book{bcl-casac-82
-, title =	"Computer Algebra: Symbolic and Algebraic Computation"
-, editor =	"B. Buchberger and G. Collins and R. Loos"
-, series =	"Computing Supplementum"
-, volume =	4
-, edition =	"1st"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1982
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, title =       "Computer Algebra: Symbolic and Algebraic Computation"
+, editor =      "B. Buchberger and G. Collins and R. Loos"
+, series =      "Computing Supplementum"
+, volume =      4
+, edition =     "1st"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1982
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{bck-amgr-88
-, author =	"B. Buchberger and G. E. Collins and B. Kutzler"
-, title =	"Algebraic methods for geometric reasoning"
-, journal =	"Annu. Rev. Comput. Sci."
-, volume =	3
-, year =	1988
-, pages =	"85--119"
+, author =      "B. Buchberger and G. E. Collins and B. Kutzler"
+, title =       "Algebraic methods for geometric reasoning"
+, journal =     "Annu. Rev. Comput. Sci."
+, volume =      3
+, year =        1988
+, pages =       "85--119"
 }
 
 @book{bcla-casac-83
-, title =	"Computer Algebra: Symbolic and Algebraic Computation"
-, editor =	"B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
-, edition =	"2nd"
-, publisher =	"Springer-Verlag"
-, year =	1983
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, title =       "Computer Algebra: Symbolic and Algebraic Computation"
+, editor =      "B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
+, edition =     "2nd"
+, publisher =   "Springer-Verlag"
+, year =        1983
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @incollection{bl-as-83
-, author =	"B. Buchberger and R. Loos"
-, title =	"Algebraic simplification"
-, editor =	"B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
-, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
-, publisher =	"Springer-Verlag"
-, year =	1983
-, pages =	"11--43"
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "B. Buchberger and R. Loos"
+, title =       "Algebraic simplification"
+, editor =      "B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
+, booktitle =   "Computer Algebra: Symbolic and Algebraic Computation"
+, publisher =   "Springer-Verlag"
+, year =        1983
+, pages =       "11--43"
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @proceedings{bs-ewcg-95
-, title =	"Abstracts 11th European Workshop Comput. Geom."
-, editor =	"Bruno Buchberger and Sabine Stifter"
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 11th European Workshop Comput. Geom."
+, editor =      "Bruno Buchberger and Sabine Stifter"
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, update =      "00.03 bibrelex"
 }
 
 @incollection{be-ewcst-83
-, author =	"W. Bucher and H. Edelsbrunner"
-, title =	"On Expected- and Worst-Case Segment Trees"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"109--125"
-, keywords =	"data structuring, searching, segment trees, worst-case analysis, expected-case analysis, intervals"
-, update =	"01.04 icking"
+, author =      "W. Bucher and H. Edelsbrunner"
+, title =       "On Expected- and Worst-Case Segment Trees"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "109--125"
+, keywords =    "data structuring, searching, segment trees, worst-case analysis, expected-case analysis, intervals"
+, update =      "01.04 icking"
 }
 
 @article{bv-ev-76
-, author =	"Edwin Buchman and F. A. Valentine"
-, title =	"External visibility"
-, journal =	"Pacific J. Math."
-, volume =	64
-, number =	2
-, year =	1976
-, pages =	"333--340"
+, author =      "Edwin Buchman and F. A. Valentine"
+, title =       "External visibility"
+, journal =     "Pacific J. Math."
+, volume =      64
+, number =      2
+, year =        1976
+, pages =       "333--340"
 }
 
 @article{b-crach-86
-, author =	"C. Buchta"
-, title =	"On a conjecture of {R}. {E}. {Miles} about the convex hull of random points"
-, journal =	"Monatsch. Math."
-, volume =	102
-, year =	1986
-, pages =	"91--102"
-, keywords =	"convex hull, probabilistic geometry"
-, update =	"95.05 korneenko"
+, author =      "C. Buchta"
+, title =       "On a conjecture of {R}. {E}. {Miles} about the convex hull of random points"
+, journal =     "Monatsch. Math."
+, volume =      102
+, year =        1986
+, pages =       "91--102"
+, keywords =    "convex hull, probabilistic geometry"
+, update =      "95.05 korneenko"
 }
 
 @article{b-nsrsl-87
-, author =	"C. Buchta"
-, title =	"On nonnegative solutions of random systems of linear inequalities"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"85--95"
+, author =      "C. Buchta"
+, title =       "On nonnegative solutions of random systems of linear inequalities"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "85--95"
 }
 
 @article{b-anmsv-89
-, author =	"C. Buchta"
-, title =	"On the average number of maxima in a set of vectors"
-, journal =	"Inform. Process. Lett."
-, volume =	33
-, number =	2
-, year =	1989
-, pages =	"63--66"
-, keywords =	"probabilistic geometry"
-, update =	"95.05 korneenko"
+, author =      "C. Buchta"
+, title =       "On the average number of maxima in a set of vectors"
+, journal =     "Inform. Process. Lett."
+, volume =      33
+, number =      2
+, year =        1989
+, pages =       "63--66"
+, keywords =    "probabilistic geometry"
+, update =      "95.05 korneenko"
 }
 
 @article{b-ps-43
-, author =	"R. C. Buck"
-, title =	"Partition of space"
-, journal =	"Amer. Math. Monthly"
-, volume =	50
-, number =	9
-, year =	1943
-, pages =	"541--544"
-, keywords =	"arrangements, $d$-dimensional, partition"
-, update =	"95.05 korneenko"
+, author =      "R. C. Buck"
+, title =       "Partition of space"
+, journal =     "Amer. Math. Monthly"
+, volume =      50
+, number =      9
+, year =        1943
+, pages =       "541--544"
+, keywords =    "arrangements, $d$-dimensional, partition"
+, update =      "95.05 korneenko"
 }
 
 @inproceedings{b-dcac4-88
-, author =	"C. E. Buckley"
-, title =	"A divide-and-conquer algorithm for computing $4$-dimensional convex hulls"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"113--135"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "C. E. Buckley"
+, title =       "A divide-and-conquer algorithm for computing $4$-dimensional convex hulls"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "113--135"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{bl-pmcpp-85
-, author =	"C. E. Buckley and l. J. Leifer"
-, title =	"A proximity metric for continuum pah planning"
-, booktitle =	"Proc. 9th Internat. Conf. Artificial Intell."
-, year =	1985
-, pages =	"1096--1102"
-, update =	"98.07 bibrelex"
+, author =      "C. E. Buckley and l. J. Leifer"
+, title =       "A proximity metric for continuum pah planning"
+, booktitle =   "Proc. 9th Internat. Conf. Artificial Intell."
+, year =        1985
+, pages =       "1096--1102"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{b-ptcms-87
-, author =	"S. J. Buckley"
-, title =	"Planning and teaching compliant motion strategies"
-, school =	"Department of Electrical Engineering and Computer Science, MIT"
-, year =	1987
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "S. J. Buckley"
+, title =       "Planning and teaching compliant motion strategies"
+, school =      "Department of Electrical Engineering and Computer Science, MIT"
+, year =        1987
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{befl-evcpp-96
-, author =	"B. B{\"u}eler and A. Enge and K. Fukuda and H.-J. L{\"u}thi"
-, title =	"Exact Volume Computations for Polytopes: a Practical Study"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"57--64"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "B. B{\"u}eler and A. Enge and K. Fukuda and H.-J. L{\"u}thi"
+, title =       "Exact Volume Computations for Polytopes: a Practical Study"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "57--64"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{bh-amgfe-90
-, author =	"T. D. Bui and V. N. Hanh"
-, title =	"Automatic Mesh Generation for Finite-Element Analysis"
-, journal =	"Computing"
-, volume =	44
-, number =	4
-, year =	1990
-, pages =	"305--329"
-, annote =	"Your basic selection algorithm for triangulation."
+, author =      "T. D. Bui and V. N. Hanh"
+, title =       "Automatic Mesh Generation for Finite-Element Analysis"
+, journal =     "Computing"
+, volume =      44
+, number =      4
+, year =        1990
+, pages =       "305--329"
+, annote =      "Your basic selection algorithm for triangulation."
 }
 
 @phdthesis{b-ptrpn-94
-, author =	"X.-N. Bui"
-, title =	"Planification de trajectoire pour un robot polygonal non-holonome dans un environnement polygonal"
-, type =	"Th\`{e}se de doctorat en sciences"
-, school =	"{\'E}cole Nationale Sup\'erieure des Mines de Paris"
-, address =	"France"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"98.07 devillers"
+, author =      "X.-N. Bui"
+, title =       "Planification de trajectoire pour un robot polygonal non-holonome dans un environnement polygonal"
+, type =        "Th\`{e}se de doctorat en sciences"
+, school =      "{\'E}cole Nationale Sup\'erieure des Mines de Paris"
+, address =     "France"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "98.07 devillers"
 }
 
 @inproceedings{bsbl-spsdn-94
-, author =	"X.-N. Bui and P. Sou{\`e}res and J.-D. Boissonnat and J.-P. Laumond"
-, title =	"Shortest path synthesis for {Dubins} nonholonomic robot"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"San  Diego, CA"
-, year =	1994
-, pages =	"2--7"
-, update =	"97.11 bibrelex"
+, author =      "X.-N. Bui and P. Sou{\`e}res and J.-D. Boissonnat and J.-P. Laumond"
+, title =       "Shortest path synthesis for {Dubins} nonholonomic robot"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "San  Diego, CA"
+, year =        1994
+, pages =       "2--7"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{bsbl-spsnr-93
-, author =	"Xuan-Nam Bui and Philippe Soueres and Jean-Daniel Boissonnat and Jean-Paul Laumond"
-, title =	"The Shortest Path Synthesis for Non-holonomic Robots Moving Forwards"
-, type =	"Research {Report}"
-, number =	2153
-, institution =	"INRIA"
-, month =	dec
-, year =	1993
-, update =	"98.03 mitchell"
-, abstract =	"We calculate the partition
+, author =      "Xuan-Nam Bui and Philippe Soueres and Jean-Daniel Boissonnat and Jean-Paul Laumond"
+, title =       "The Shortest Path Synthesis for Non-holonomic Robots Moving Forwards"
+, type =        "Research {Report}"
+, number =      2153
+, institution = "INRIA"
+, month =       dec
+, year =        1993
+, update =      "98.03 mitchell"
+, abstract =    "We calculate the partition
  of the configuration space $I\!\!R^2 x S^1$
  of a car-like  robot, only moving forwards,  with respect  to the
  type of the  length optimal paths.  This kind  of robot is  subject to
@@ -28627,556 +28627,556 @@ @techreport{bsbl-spsnr-93
 }
 
 @article{bs-aulbr-66
-, author =	"R. Bulirsch and J. Stoer"
-, title =	"Asymptotic upper and lower bounds for results of extrapolation methods"
-, journal =	"Numer. Math."
-, volume =	8
-, year =	1966
-, pages =	"93--104"
-, update =	"98.07 bibrelex"
+, author =      "R. Bulirsch and J. Stoer"
+, title =       "Asymptotic upper and lower bounds for results of extrapolation methods"
+, journal =     "Numer. Math."
+, volume =      8
+, year =        1966
+, pages =       "93--104"
+, update =      "98.07 bibrelex"
 }
 
 @article{bs-nqe-67
-, author =	"R. Bulirsch and J. Stoer"
-, title =	"Numerical quadrature by extrapolation"
-, journal =	"Numer. Math."
-, volume =	9
-, year =	1967
-, pages =	"271--278"
-, update =	"98.07 bibrelex"
+, author =      "R. Bulirsch and J. Stoer"
+, title =       "Numerical quadrature by extrapolation"
+, journal =     "Numer. Math."
+, volume =      9
+, year =        1967
+, pages =       "271--278"
+, update =      "98.07 bibrelex"
 }
 
 @article{b-hs1-61
-, author =	"R. K. Bullough"
-, title =	"On homometric sets, 1"
-, journal =	"Acta Crystallogr."
-, volume =	14
-, year =	1961
-, pages =	"257--268"
-, keywords =	"reconstruction, points"
-, update =	"95.05 korneenko"
+, author =      "R. K. Bullough"
+, title =       "On homometric sets, 1"
+, journal =     "Acta Crystallogr."
+, volume =      14
+, year =        1961
+, pages =       "257--268"
+, keywords =    "reconstruction, points"
+, update =      "95.05 korneenko"
 }
 
 @article{b-hs2-64
-, author =	"R. K. Bullough"
-, title =	"On homometric sets, 2"
-, journal =	"Acta Crystallogr."
-, volume =	17
-, year =	1964
-, pages =	"295--308"
-, keywords =	"reconstruction, points"
-, update =	"95.05 korneenko"
+, author =      "R. K. Bullough"
+, title =       "On homometric sets, 2"
+, journal =     "Acta Crystallogr."
+, volume =      17
+, year =        1964
+, pages =       "295--308"
+, keywords =    "reconstruction, points"
+, update =      "95.05 korneenko"
 }
 
 @article{bsh-sgfgt-84
-, author =	"A. B{\"u}low-Olsen and N. R. {Sakevile Hamilton} and M. J. Hutchings"
-, title =	"A study of growth form in genets of {Trifolium repens L.} as affected by intra- and interplant contacts"
-, journal =	"Oecologia"
-, volume =	"??"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "A. B{\"u}low-Olsen and N. R. {Sakevile Hamilton} and M. J. Hutchings"
+, title =       "A study of growth form in genets of {Trifolium repens L.} as affected by intra- and interplant contacts"
+, journal =     "Oecologia"
+, volume =      "??"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @book{b-mpg-69
-, author =	"R. J. Bumcrot"
-, title =	"Modern Projective Geometry"
-, publisher =	"Holt, Rinehart \& Winston"
-, address =	"New York, NY"
-, year =	1969
-, update =	"97.11 bibrelex"
+, author =      "R. J. Bumcrot"
+, title =       "Modern Projective Geometry"
+, publisher =   "Holt, Rinehart \& Winston"
+, address =     "New York, NY"
+, year =        1969
+, update =      "97.11 bibrelex"
 }
 
 @book{bz-gi-88
-, author =	"Y. D. Burago and V. A. Zalgaller"
-, title =	"Geometric Inequalities"
-, publisher =	"Springer-Verlag"
-, year =	1988
-, note =	"Translated from the Russian"
-, update =	"97.11 bibrelex"
+, author =      "Y. D. Burago and V. A. Zalgaller"
+, title =       "Geometric Inequalities"
+, publisher =   "Springer-Verlag"
+, year =        1988
+, note =        "Translated from the Russian"
+, update =      "97.11 bibrelex"
 }
 
 @article{b-gafp-74
-, author =	"C. A. Burdet"
-, title =	"Generating all faces of a polyhedron"
-, journal =	"SIAM J. Appl. Math."
-, volume =	26
-, year =	1974
-, pages =	"479--489"
+, author =      "C. A. Burdet"
+, title =       "Generating all faces of a polyhedron"
+, journal =     "SIAM J. Appl. Math."
+, volume =      26
+, year =        1974
+, pages =       "479--489"
 }
 
 @book{bcs-act-96
-, author =	"Peter B{\"u}rgisser and Michael Clausen and M. Amin Shokrollahi"
-, title =	"Algebraic Complexity Theory"
-, series =	"Grundlehren der mathematischen Wissenschaften"
-, volume =	315
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	1996
-, isbn =	"0-387-60582-7"
-, update =	"97.07 agarwal+smid"
+, author =      "Peter B{\"u}rgisser and Michael Clausen and M. Amin Shokrollahi"
+, title =       "Algebraic Complexity Theory"
+, series =      "Grundlehren der mathematischen Wissenschaften"
+, volume =      315
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        1996
+, isbn =        "0-387-60582-7"
+, update =      "97.07 agarwal+smid"
 }
 
 @article{b-ospre-86
-, author =	"R. E. Burkard"
-, title =	"Optimal schedules for periodically recurring events"
-, journal =	"Discrete Appl. Math."
-, volume =	15
-, year =	1986
-, pages =	"167--180"
-, keywords =	"scheduling, convex polygons, regular polygons"
-, update =	"96.01 mitchell"
-, abstract =	"Place two regular polygons in a circle so as to minimize
-		the maximum separation between two vertices along the circle."
+, author =      "R. E. Burkard"
+, title =       "Optimal schedules for periodically recurring events"
+, journal =     "Discrete Appl. Math."
+, volume =      15
+, year =        1986
+, pages =       "167--180"
+, keywords =    "scheduling, convex polygons, regular polygons"
+, update =      "96.01 mitchell"
+, abstract =    "Place two regular polygons in a circle so as to minimize
+                the maximum separation between two vertices along the circle."
 }
 
 @article{bddvw-wsctsps-98
-, author =	"Rainer E. Burkard and Vladimir G. Deineko and Ren{\'e} van Dal and Jack A. A. van der Veen and Gerhard J. Woeginger"
-, title =	"Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey"
-, journal =	"SIAM Rev."
-, volume =	40
-, number =	3
-, year =	1998
-, pages =	"496 -- 546"
-, keywords =	"survey paper, traveling salesman problem, combinatorial optimization, polynomial time algorithm, computational complexity"
-, update =	"98.11 pocchiola"
-, abstract =	"The traveling salesman problem (TSP) belongs to the most basic, most important, and most investigated problems in combinatorial optimization. Although it is an ${\cal NP}$-hard problem, many of its special cases can be solved efficiently in polynomial time. We survey these special cases with emphasis on the results that have been obtained during the decade 1985--1995.  This survey complements an earlier survey from 1985 compiled by Gilmore, Lawler, and Shmoys [The Traveling Salesman Problem---A Guided Tour of Combinatorial Optimization, Wiley, Chichester, pp. 87--143]"
+, author =      "Rainer E. Burkard and Vladimir G. Deineko and Ren{\'e} van Dal and Jack A. A. van der Veen and Gerhard J. Woeginger"
+, title =       "Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey"
+, journal =     "SIAM Rev."
+, volume =      40
+, number =      3
+, year =        1998
+, pages =       "496 -- 546"
+, keywords =    "survey paper, traveling salesman problem, combinatorial optimization, polynomial time algorithm, computational complexity"
+, update =      "98.11 pocchiola"
+, abstract =    "The traveling salesman problem (TSP) belongs to the most basic, most important, and most investigated problems in combinatorial optimization. Although it is an ${\cal NP}$-hard problem, many of its special cases can be solved efficiently in polynomial time. We survey these special cases with emphasis on the results that have been obtained during the decade 1985--1995.  This survey complements an earlier survey from 1985 compiled by Gilmore, Lawler, and Shmoys [The Traveling Salesman Problem---A Guided Tour of Combinatorial Optimization, Wiley, Chichester, pp. 87--143]"
 }
 
 @article{bhr-saucf-91
-, author =	"R. E. Burkard and H. W. Hamacher and G{\"u}nter Rote"
-, title =	"Sandwich approximation of univariate convex functions with an application to separable convex programming"
-, journal =	"Naval Res. Logistics"
-, volume =	38
-, year =	1991
-, pages =	"911--924"
-, comments =	"final (modified) version of the techreport bhr-acfam-87"
-, cites =	"r-crsaa-90"
-, update =	"98.03 mitchell, 93.09 rote"
+, author =      "R. E. Burkard and H. W. Hamacher and G{\"u}nter Rote"
+, title =       "Sandwich approximation of univariate convex functions with an application to separable convex programming"
+, journal =     "Naval Res. Logistics"
+, volume =      38
+, year =        1991
+, pages =       "911--924"
+, comments =    "final (modified) version of the techreport bhr-acfam-87"
+, cites =       "r-crsaa-90"
+, update =      "98.03 mitchell, 93.09 rote"
 }
 
 @techreport{bkr-pmpo-95
-, author =	"Rainer E. Burkard and Bettina Klinz and R{\"u}diger Rudolf"
-, title =	"Perspectives of {Monge} Properties in Optimization"
-, type =	""
-, number =	2
-, institution =	"Spezialforschungsbereich F~003, Karl-Franzens-Universit{\"a}t Graz and Technische Universit{\"a}t Graz"
-, month =	aug
-, year =	1995
-, url =	"ftp://ftp.tu-graz.ac.at/pub/papers/math/sfb2.ps.gz"
-, update =	"01.04 icking"
+, author =      "Rainer E. Burkard and Bettina Klinz and R{\"u}diger Rudolf"
+, title =       "Perspectives of {Monge} Properties in Optimization"
+, type =        ""
+, number =      2
+, institution = "Spezialforschungsbereich F~003, Karl-Franzens-Universit{\"a}t Graz and Technische Universit{\"a}t Graz"
+, month =       aug
+, year =        1995
+, url = "ftp://ftp.tu-graz.ac.at/pub/papers/math/sfb2.ps.gz"
+, update =      "01.04 icking"
 }
 
 @article{bryy-spps-90
-, author =	"Rainer E. Burkard and G{\"u}nter Rote and En-Yu Yao and Zhong-Liang Yu"
-, title =	"Shortest Polygonal Paths in Space"
-, journal =	"Computing"
-, volume =	45
-, year =	1990
-, pages =	"51--68"
-, update =	"93.09 milone+mitchell+rote"
-, annote =	"For a given polygonal chain, find the shortest (open
-		 or closed) path that visits every segment of the chain in
-		 the given order."
+, author =      "Rainer E. Burkard and G{\"u}nter Rote and En-Yu Yao and Zhong-Liang Yu"
+, title =       "Shortest Polygonal Paths in Space"
+, journal =     "Computing"
+, volume =      45
+, year =        1990
+, pages =       "51--68"
+, update =      "93.09 milone+mitchell+rote"
+, annote =      "For a given polygonal chain, find the shortest (open
+                 or closed) path that visits every segment of the chain in
+                 the given order."
 }
 
 @techreport{b-aaipm-75
-, author =	"W. A. Burkhard"
-, title =	"Associative access and inversion and partial-match file designs"
-, type =	"Report"
-, number =	"TR-4"
-, institution =	"UCSD Comput. Sci. Division, Univ. California"
-, address =	"San Diego, La Jolla, CA"
-, year =	1975
+, author =      "W. A. Burkhard"
+, title =       "Associative access and inversion and partial-match file designs"
+, type =        "Report"
+, number =      "TR-4"
+, institution = "UCSD Comput. Sci. Division, Univ. California"
+, address =     "San Diego, La Jolla, CA"
+, year =        1975
 }
 
 @inproceedings{b-arthc-76
-, author =	"W. A. Burkhard"
-, title =	"Associative retrieval trie hash-coding"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Theory Comput."
-, year =	1976
-, pages =	"211--219"
-, precedes =	"b-arthc-77"
+, author =      "W. A. Burkhard"
+, title =       "Associative retrieval trie hash-coding"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Theory Comput."
+, year =        1976
+, pages =       "211--219"
+, precedes =    "b-arthc-77"
 }
 
 @article{b-arthc-77
-, author =	"W. A. Burkhard"
-, title =	"Associative retrieval trie hash-coding"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	15
-, year =	1977
-, pages =	"280--299"
-, succeeds =	"b-arthc-76"
+, author =      "W. A. Burkhard"
+, title =       "Associative retrieval trie hash-coding"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      15
+, year =        1977
+, pages =       "280--299"
+, succeeds =    "b-arthc-76"
 }
 
 @inproceedings{b-fdpmr-75
-, author =	"W. A. Burkhard"
-, title =	"File designs for partial-match retrieval"
-, booktitle =	"Proc. Conf. Inform. Sci. Systems"
-, publisher =	"Johns Hopkins Univ."
-, year =	1975
-, pages =	"351--353"
+, author =      "W. A. Burkhard"
+, title =       "File designs for partial-match retrieval"
+, booktitle =   "Proc. Conf. Inform. Sci. Systems"
+, publisher =   "Johns Hopkins Univ."
+, year =        1975
+, pages =       "351--353"
 }
 
 @article{b-htapm-76
-, author =	"W. A. Burkhard"
-, title =	"Hashing and trie algorithms for partial-match retrieval"
-, journal =	"ACM Trans. Database Syst."
-, volume =	1
-, year =	1976
-, pages =	"175--187"
+, author =      "W. A. Burkhard"
+, title =       "Hashing and trie algorithms for partial-match retrieval"
+, journal =     "ACM Trans. Database Syst."
+, volume =      1
+, year =        1976
+, pages =       "175--187"
 }
 
 @article{b-nupmf-77
-, author =	"W. A. Burkhard"
-, title =	"Non-uniform partial-match file designs"
-, journal =	"Theoret. Comput. Sci."
-, volume =	5
-, year =	1977
-, pages =	"1--23"
+, author =      "W. A. Burkhard"
+, title =       "Non-uniform partial-match file designs"
+, journal =     "Theoret. Comput. Sci."
+, volume =      5
+, year =        1977
+, pages =       "1--23"
 }
 
 @article{b-pmhcb-79
-, author =	"W. A. Burkhard"
-, title =	"Partial-match hash coding: benefits and redundancy"
-, journal =	"ACM Trans. Database Syst."
-, volume =	4
-, year =	1979
-, pages =	"228--239"
+, author =      "W. A. Burkhard"
+, title =       "Partial-match hash coding: benefits and redundancy"
+, journal =     "ACM Trans. Database Syst."
+, volume =      4
+, year =        1979
+, pages =       "228--239"
 }
 
 @inproceedings{b-pmqfd-75
-, author =	"W. A. Burkhard"
-, title =	"Partial-match queries and file designs"
-, booktitle =	"Proc. Internat. Conf. Very Large Databases"
-, year =	1975
-, pages =	"523--525"
+, author =      "W. A. Burkhard"
+, title =       "Partial-match queries and file designs"
+, booktitle =   "Proc. Internat. Conf. Very Large Databases"
+, year =        1975
+, pages =       "523--525"
 }
 
 @article{b-pmr-76
-, author =	"W. A. Burkhard"
-, title =	"Partial-match retrieval"
-, journal =	"BIT"
-, volume =	16
-, year =	1976
-, pages =	"13--31"
+, author =      "W. A. Burkhard"
+, title =       "Partial-match retrieval"
+, journal =     "BIT"
+, volume =      16
+, year =        1976
+, pages =       "13--31"
 }
 
 @techreport{b-pmrpb-75
-, author =	"W. A. Burkhard"
-, title =	"Partial match retrieval: performance bounds"
-, type =	"Report"
-, number =	"TR-3"
-, institution =	"UCSD Comput. Sci. Division, Univ. California"
-, address =	"San Diego, La Jolla, CA"
-, year =	1975
+, author =      "W. A. Burkhard"
+, title =       "Partial match retrieval: performance bounds"
+, type =        "Report"
+, number =      "TR-3"
+, institution = "UCSD Comput. Sci. Division, Univ. California"
+, address =     "San Diego, La Jolla, CA"
+, year =        1975
 }
 
 @article{bfk-ictor-81
-, author =	"W. A. Burkhard and M. L. Fredman and D. J. Kleitman"
-, title =	"Inherent complexity trade-offs for range query problems"
-, journal =	"Theoret. Comput. Sci."
-, volume =	16
-, year =	1981
-, pages =	"279--290"
+, author =      "W. A. Burkhard and M. L. Fredman and D. J. Kleitman"
+, title =       "Inherent complexity trade-offs for range query problems"
+, journal =     "Theoret. Comput. Sci."
+, volume =      16
+, year =        1981
+, pages =       "279--290"
 }
 
 @article{bk-sabmf-73
-, author =	"W. A. Burkhard and R. M. Keller"
-, title =	"Some approaches to best match file searching"
-, journal =	"Commun. ACM"
-, volume =	16
-, year =	1973
-, pages =	"230--236"
+, author =      "W. A. Burkhard and R. M. Keller"
+, title =       "Some approaches to best match file searching"
+, journal =     "Commun. ACM"
+, volume =      16
+, year =        1973
+, pages =       "230--236"
 }
 
 @phdthesis{b-ecvdl-96
-, author =	"C. Burnikel"
-, title =	"Exact Computation of {Voronoi} Diagrams and Line Segment Intersections"
-, type =	"Ph.{D} Thesis"
-, school =	"Universit{\"a}t des Saarlandes"
-, month =	mar
-, year =	1996
-, keywords =	"doctoral thesis"
-, update =	"96.09 devillers"
+, author =      "C. Burnikel"
+, title =       "Exact Computation of {Voronoi} Diagrams and Line Segment Intersections"
+, type =        "Ph.{D} Thesis"
+, school =      "Universit{\"a}t des Saarlandes"
+, month =       mar
+, year =        1996
+, keywords =    "doctoral thesis"
+, update =      "96.09 devillers"
 }
 
 @article{bfms-secsb-00
-, author =	"C. Burnikel and R. Fleischer and K. Mehlhorn and S. Schirra"
-, title =	"A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals"
-, journal =	"Algorithmica"
-, volume =	27
-, number =	1
-, year =	2000
-, pages =	"87--99"
-, update =	"00.11 smid, 00.07 held"
+, author =      "C. Burnikel and R. Fleischer and K. Mehlhorn and S. Schirra"
+, title =       "A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals"
+, journal =     "Algorithmica"
+, volume =      27
+, number =      1
+, year =        2000
+, pages =       "87--99"
+, update =      "00.11 smid, 00.07 held"
 }
 
 @inproceedings{bfms-secsb-97
-, author =	"C. Burnikel and R. Fleischer and K. Mehlhorn and S. Schirra"
-, title =	"A strong and easily computable separation bound for arithmetic expressions involving square roots"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1997
-, pages =	"702--709"
-, update =	"98.07 bibrelex"
+, author =      "C. Burnikel and R. Fleischer and K. Mehlhorn and S. Schirra"
+, title =       "A strong and easily computable separation bound for arithmetic expressions involving square roots"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1997
+, pages =       "702--709"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{bfms-eegcm-99
-, author =	"C. Burnikel and R. Fleischer and K. Mehlhorn and S. Schirra"
-, title =	"Efficient Exact Geometric Computation Made Easy"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"341--350"
-, update =	"00.03 vismara"
+, author =      "C. Burnikel and R. Fleischer and K. Mehlhorn and S. Schirra"
+, title =       "Efficient Exact Geometric Computation Made Easy"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "341--350"
+, update =      "00.03 vismara"
 }
 
 @article{bfs-egcc-01
-, author =	"C. Burnikel and S. Funke and M. Seel"
-, title =	"Exact Geometric Computation using Cascading"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"245--266"
-, update =	"01.07 smid"
+, author =      "C. Burnikel and S. Funke and M. Seel"
+, title =       "Exact Geometric Computation using Cascading"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "245--266"
+, update =      "01.07 smid"
 }
 
 @inproceedings{bfs-egpuc-98
-, author =	"C. Burnikel and S. Funke and M. Seel"
-, title =	"Exact Geometric Predicates using Cascaded Computation"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"175--183"
-, update =	"99.07 vismara, 98.07 tamassia"
+, author =      "C. Burnikel and S. Funke and M. Seel"
+, title =       "Exact Geometric Predicates using Cascaded Computation"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "175--183"
+, update =      "99.07 vismara, 98.07 tamassia"
 }
 
 @inproceedings{bkmnsu-egcl-95
-, author =	"Christoph Burnikel and Jochen K{\"o}nnemann and Kurt Mehlhorn and Stefan N{\"a}her and Stefan Schirra and Christian Uhrig"
-, title =	"Exact Geometric Computation in {LEDA}"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C18--C19"
-, url =	"http://www.mpi-sb.mpg.de/guide/staff/uhrig/leda.html"
-, keywords =	""
-, cites =	"bjmm-lsicg-93, bms-hcvdl-94, fv-eeacg-93, mn-lpcgc-95, m-mca-92, yd-ecp-95, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell, 95.05 agarwal+devillers"
+, author =      "Christoph Burnikel and Jochen K{\"o}nnemann and Kurt Mehlhorn and Stefan N{\"a}her and Stefan Schirra and Christian Uhrig"
+, title =       "Exact Geometric Computation in {LEDA}"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C18--C19"
+, url = "http://www.mpi-sb.mpg.de/guide/staff/uhrig/leda.html"
+, keywords =    ""
+, cites =       "bjmm-lsicg-93, bms-hcvdl-94, fv-eeacg-93, mn-lpcgc-95, m-mca-92, yd-ecp-95, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell, 95.05 agarwal+devillers"
 }
 
 @inproceedings{bms-hcvdl-94
-, author =	"C. Burnikel and K. Mehlhorn and S. Schirra"
-, title =	"How to Compute the {Voronoi} Diagram of Line Segments: Theoretical and Experimental Results"
-, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
-, nickname =	"ESA '94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"227--239"
-, update =	"95.01 smid"
+, author =      "C. Burnikel and K. Mehlhorn and S. Schirra"
+, title =       "How to Compute the {Voronoi} Diagram of Line Segments: Theoretical and Experimental Results"
+, booktitle =   "Proc. 2nd Annu. European Sympos. Algorithms"
+, nickname =    "ESA '94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "227--239"
+, update =      "95.01 smid"
 }
 
 @inproceedings{bms-dgc-94
-, author =	"C. Burnikel and K. Mehlhorn and S. Schirra"
-, title =	"On degeneracy in geometric computations"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"16--23"
-, update =	"95.01 matousek+smid"
+, author =      "C. Burnikel and K. Mehlhorn and S. Schirra"
+, title =       "On degeneracy in geometric computations"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "16--23"
+, update =      "95.01 matousek+smid"
 }
 
 @techreport{bms-lcrn-96
-, author =	"C. Burnikel and K. Mehlhorn and S. Schirra"
-, title =	"The {LEDA} class real number"
-, type =	"Technical {Report}"
-, number =	"MPI-I-96-1-001"
-, institution =	"Max-Planck Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, month =	jan
-, year =	1996
-, url =	"http://data.mpi-sb.mpg.de/internet/reports.nsf/NumberView/1996-1-001"
-, update =	"99.07 vismara, 98.07 bibrelex"
+, author =      "C. Burnikel and K. Mehlhorn and S. Schirra"
+, title =       "The {LEDA} class real number"
+, type =        "Technical {Report}"
+, number =      "MPI-I-96-1-001"
+, institution = "Max-Planck Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, month =       jan
+, year =        1996
+, url = "http://data.mpi-sb.mpg.de/internet/reports.nsf/NumberView/1996-1-001"
+, update =      "99.07 vismara, 98.07 bibrelex"
 }
 
 @incollection{b-grtgs-74
-, author =	"S. A. Burr"
-, title =	"Generalized {Ramsey} theory for graphs: a survey"
-, editor =	"R. Bari and F. Haray"
-, booktitle =	"Graphs Combin."
-, series =	"Lecture Notes Math."
-, volume =	406
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1974
-, pages =	"52--75"
-, update =	"97.11 bibrelex"
+, author =      "S. A. Burr"
+, title =       "Generalized {Ramsey} theory for graphs: a survey"
+, editor =      "R. Bari and F. Haray"
+, booktitle =   "Graphs Combin."
+, series =      "Lecture Notes Math."
+, volume =      406
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1974
+, pages =       "52--75"
+, update =      "97.11 bibrelex"
 }
 
 @article{bes-rtmcg-75
-, author =	"S. A. Burr and P. Erd{\H o}s and J. H. Spencer"
-, title =	"{Ramsey} theorems for multiple copies of graphs"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	209
-, year =	1975
-, pages =	"87--99"
-, update =	"97.11 bibrelex"
+, author =      "S. A. Burr and P. Erd{\H o}s and J. H. Spencer"
+, title =       "{Ramsey} theorems for multiple copies of graphs"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      209
+, year =        1975
+, pages =       "87--99"
+, update =      "97.11 bibrelex"
 }
 
 @article{bgs-op-74
-, author =	"S. A. Burr and B. Gr{\"u}nbaum and N. J. A. Sloane"
-, title =	"The orchard problem"
-, journal =	"Geometriae Dedicatia"
-, volume =	2
-, year =	1974
-, pages =	"397--424"
-, update =	"98.03 bibrelex"
+, author =      "S. A. Burr and B. Gr{\"u}nbaum and N. J. A. Sloane"
+, title =       "The orchard problem"
+, journal =     "Geometriae Dedicatia"
+, volume =      2
+, year =        1974
+, pages =       "397--424"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{brs-phpsd-87
-, author =	"R. Burridge and V. T. Rajan and J. T. Schwartz"
-, title =	"The peg-in-hole problem: {Statistics} and dynamics of nearly rigid bodies in frictional contact"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Raleigh, NC"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "R. Burridge and V. T. Rajan and J. T. Schwartz"
+, title =       "The peg-in-hole problem: {Statistics} and dynamics of nearly rigid bodies in frictional contact"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Raleigh, NC"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @book{b-pgisl-86
-, author =	"P. A. Burrough"
-, title =	"Principles of Geographical Information Systems for Land Resourses Assessment"
-, publisher =	"Oxford University Press"
-, address =	"New York"
-, year =	1986
-, update =	"96.09 kreveld"
+, author =      "P. A. Burrough"
+, title =       "Principles of Geographical Information Systems for Land Resourses Assessment"
+, publisher =   "Oxford University Press"
+, address =     "New York"
+, year =        1986
+, update =      "96.09 kreveld"
 }
 
 @article{bkk-cppt-84
-, author =	"F. W. Burton and V. J. Kollias and J. G. Kollias"
-, title =	"Consistency in point-in-polygon tests"
-, journal =	"Comput. J."
-, volume =	27
-, number =	4
-, year =	1984
-, pages =	"375--376"
+, author =      "F. W. Burton and V. J. Kollias and J. G. Kollias"
+, title =       "Consistency in point-in-polygon tests"
+, journal =     "Comput. J."
+, volume =      27
+, number =      4
+, year =        1984
+, pages =       "375--376"
 }
 
 @article{bp-ddnpp-79
-, author =	"G. R. Burton and G. B. Purdy"
-, title =	"The directions determined by $n$ points in the plane"
-, journal =	"J. London Math. Soc."
-, volume =	20
-, number =	2
-, year =	1979
-, pages =	"109--114"
-, update =	"97.11 bibrelex"
+, author =      "G. R. Burton and G. B. Purdy"
+, title =       "The directions determined by $n$ points in the plane"
+, journal =     "J. London Math. Soc."
+, volume =      20
+, number =      2
+, year =        1979
+, pages =       "109--114"
+, update =      "97.11 bibrelex"
 }
 
 @article{bs-hlah-82
-, author =	"R. P. Burton and D. R. Smith"
-, title =	"A hidden-line algorithm for hyperspace"
-, journal =	"SIAM J. Comput."
-, volume =	11
-, year =	1982
-, pages =	"71--80"
+, author =      "R. P. Burton and D. R. Smith"
+, title =       "A hidden-line algorithm for hyperspace"
+, journal =     "SIAM J. Comput."
+, volume =      11
+, year =        1982
+, pages =       "71--80"
 }
 
 @article{b-rmspp-77
-, author =	"W. Burton"
-, title =	"Representation of many-sided polygons and polygonal lines for rapid processing"
-, journal =	"Commun. ACM"
-, volume =	20
-, year =	1977
-, pages =	"166--171"
+, author =      "W. Burton"
+, title =       "Representation of many-sided polygons and polygonal lines for rapid processing"
+, journal =     "Commun. ACM"
+, volume =      20
+, year =        1977
+, pages =       "166--171"
 }
 
 @book{b-cs-58
-, author =	"H. Buseman"
-, title =	"Convex Surfaces"
-, publisher =	"Interscience Publishers"
-, address =	"New York, NY"
-, year =	1958
-, update =	"97.11 bibrelex"
+, author =      "H. Buseman"
+, title =       "Convex Surfaces"
+, publisher =   "Interscience Publishers"
+, address =     "New York, NY"
+, year =        1958
+, update =      "97.11 bibrelex"
 }
 
 @book{b-sdg-87
-, author =	"H. Busemann"
-, title =	"Spaces with distinguished Geodesics"
-, publisher =	"M. Dekker"
-, address =	"New York"
-, year =	1987
-, update =	"98.07 bibrelex"
+, author =      "H. Busemann"
+, title =       "Spaces with distinguished Geodesics"
+, publisher =   "M. Dekker"
+, address =     "New York"
+, year =        1987
+, update =      "98.07 bibrelex"
 }
 
 @book{b-gog-55
-, author =	"H. Busemann"
-, title =	"The Geometry of Geodesics"
-, publisher =	"Academic Press Inc."
-, address =	"New York"
-, year =	1955
-, update =	"00.03 bibrelex"
+, author =      "H. Busemann"
+, title =       "The Geometry of Geodesics"
+, publisher =   "Academic Press Inc."
+, address =     "New York"
+, year =        1955
+, update =      "00.03 bibrelex"
 }
 
 @book{bgsss-mcm-66
-, author =	"N. P. Buslenko and D. I. Golenko and I. M. Sobol and V. G. Sragovi{\v c} and J. A. {\v S}reider"
-, title =	"The {Monte} {Carlo} Method"
-, editor =	"J. A. Shrider"
-, publisher =	"Pergamon Press"
-, address =	"Oxford, UK"
-, year =	1966
-, update =	"98.03 bibrelex"
+, author =      "N. P. Buslenko and D. I. Golenko and I. M. Sobol and V. G. Sragovi{\v c} and J. A. {\v S}reider"
+, title =       "The {Monte} {Carlo} Method"
+, editor =      "J. A. Shrider"
+, publisher =   "Pergamon Press"
+, address =     "Oxford, UK"
+, year =        1966
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{by-lotmc-94
-, author =	"S. Buss and P. Yianilos"
-, title =	"Linear and {$O(n \log n)$} time minimum-cost matching algorithms for quasi-convex tours"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"65--76"
-, update =	"97.11 bibrelex"
+, author =      "S. Buss and P. Yianilos"
+, title =       "Linear and {$O(n \log n)$} time minimum-cost matching algorithms for quasi-convex tours"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "65--76"
+, update =      "97.11 bibrelex"
 }
 
 @article{by-lotmc-98
-, author =	"S. R. Buss and P. N. Yianilos"
-, title =	"Linear and {$O(n \log n)$} time minimum-cost matching algorithms for quasi-convex tours"
-, journal =	"SIAM J. Comput."
-, volume =	27
-, year =	1998
-, pages =	"170--201"
-, update =	"98.07 smid"
+, author =      "S. R. Buss and P. N. Yianilos"
+, title =       "Linear and {$O(n \log n)$} time minimum-cost matching algorithms for quasi-convex tours"
+, journal =     "SIAM J. Comput."
+, volume =      27
+, year =        1998
+, pages =       "170--201"
+, update =      "98.07 smid"
 }
 
 @inproceedings{bdltvv-gwspt-96
-, author =	"L. Buti and G. {Di Battista} and G. Liotta and E. Tassinari and F. Vargiu and L. Vismara"
-, title =	"{GD-W}orkbench: A System for Prototyping and Testing Graph Drawing Algorithms"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"111--122"
-, keywords =	"graph drawing, system"
-, update =	"00.03 vismara, 98.07 vismara, 96.09 tamassia"
+, author =      "L. Buti and G. {Di Battista} and G. Liotta and E. Tassinari and F. Vargiu and L. Vismara"
+, title =       "{GD-W}orkbench: A System for Prototyping and Testing Graph Drawing Algorithms"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "111--122"
+, keywords =    "graph drawing, system"
+, update =      "00.03 vismara, 98.07 vismara, 96.09 tamassia"
 }
 
 @inproceedings{bgjr-cdr-96
-, author =	"Geoffrey Butlin and Mark Gammon and Maritin Jones and John Rawlinson"
-, title =	"CAD data repair"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"7--12"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Geoffrey Butlin and Mark Gammon and Maritin Jones and John Rawlinson"
+, title =       "CAD data repair"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "7--12"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @article{b-tcl-85
-, author =	"B. Buttenfield"
-, title =	"Treatment of the Cartographic Line"
-, journal =	"Cartographica"
-, volume =	22
-, year =	1985
-, pages =	"1--26"
-, update =	"96.09 kreveld"
+, author =      "B. Buttenfield"
+, title =       "Treatment of the Cartographic Line"
+, journal =     "Cartographica"
+, volume =      22
+, year =        1985
+, pages =       "1--26"
+, update =      "96.09 kreveld"
 }
 
 @article{b-aahsf-71
@@ -29188,1666 +29188,1666 @@ @article{b-aahsf-71
 }
 
 @article{b-agtg1-76
-, author =	"A. Bykat"
-, title =	"Automatic generation of triangular grid: {I} --- subdivision of a general polygon into convex subregions; {II} --- triangulation of convex polygons"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	10
-, year =	1976
-, pages =	"1329--1342"
+, author =      "A. Bykat"
+, title =       "Automatic generation of triangular grid: {I} --- subdivision of a general polygon into convex subregions; {II} --- triangulation of convex polygons"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      10
+, year =        1976
+, pages =       "1329--1342"
 }
 
 @article{b-chfsp-78
-, author =	"A. Bykat"
-, title =	"Convex hull of a finite set of points in two dimensions"
-, journal =	"Inform. Process. Lett."
-, volume =	7
-, year =	1978
-, pages =	"296--298"
+, author =      "A. Bykat"
+, title =       "Convex hull of a finite set of points in two dimensions"
+, journal =     "Inform. Process. Lett."
+, volume =      7
+, year =        1978
+, pages =       "296--298"
 }
 
 @article{b-ps-79
-, author =	"A. Bykat"
-, title =	"On polygon similarity"
-, journal =	"Inform. Process. Lett."
-, volume =	9
-, year =	1979
-, pages =	"23--25"
+, author =      "A. Bykat"
+, title =       "On polygon similarity"
+, journal =     "Inform. Process. Lett."
+, volume =      9
+, year =        1979
+, pages =       "23--25"
 }
 
 @inproceedings{cgmm-dfglm-01
-, author =	"Jos{\'e} C{\'a}ceres and Clara I. Grima and Alberto M{\'a}rquez and Auxiliadora Moreno-Gonz{\'a}lez"
-, title =	"Dilation Free Graphs in {$L_1$}-Metric"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"178--182"
-, update =	"01.04 icking"
+, author =      "Jos{\'e} C{\'a}ceres and Clara I. Grima and Alberto M{\'a}rquez and Auxiliadora Moreno-Gonz{\'a}lez"
+, title =       "Dilation Free Graphs in {$L_1$}-Metric"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "178--182"
+, update =      "01.04 icking"
 }
 
 @inproceedings{cm-atm-99
-, author =	"Jos{\'e} C{\'a}ceres and Alberto M{\'a}rquez"
-, title =	"An Aperiodic Tiles Machine"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"55--57"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Jos{\'e} C{\'a}ceres and Alberto M{\'a}rquez"
+, title =       "An Aperiodic Tiles Machine"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "55--57"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{c-cepgu-93
-, author =	"Jiazhen Cai"
-, title =	"Counting Embeddings of Planar Graphs Using {DFS} Trees"
-, journal =	"SIAM J. Discrete Math."
-, volume =	6
-, year =	1993
-, pages =	"335--352"
-, keywords =	"graph drawing, DFS tree, planarization"
-, update =	"98.11 patrignani"
+, author =      "Jiazhen Cai"
+, title =       "Counting Embeddings of Planar Graphs Using {DFS} Trees"
+, journal =     "SIAM J. Discrete Math."
+, volume =      6
+, year =        1993
+, pages =       "335--352"
+, keywords =    "graph drawing, DFS tree, planarization"
+, update =      "98.11 patrignani"
 }
 
 @article{cht-otams-93
-, author =	"J. Cai and X. Han and R. E. Tarjan"
-, title =	"An ${O}(m \log n)$-time Algorithm for the Maximal Subgraph Problem"
-, journal =	"SIAM J. Comput."
-, volume =	22
-, year =	1993
-, pages =	"1142--1162"
-, keywords =	"graph drawing, planarization"
-, update =	"95.05 tamassia, 93.09 tamassia"
+, author =      "J. Cai and X. Han and R. E. Tarjan"
+, title =       "An ${O}(m \log n)$-time Algorithm for the Maximal Subgraph Problem"
+, journal =     "SIAM J. Comput."
+, volume =      22
+, year =        1993
+, pages =       "1142--1162"
+, keywords =    "graph drawing, planarization"
+, update =      "95.05 tamassia, 93.09 tamassia"
 }
 
 @inproceedings{ch-rdtps-94
-, author =	"J. Cai and M. D. Hirsch"
-, title =	"Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"172--180"
-, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
+, author =      "J. Cai and M. D. Hirsch"
+, title =       "Rotation Distance, Triangulations of Planar Surfaces and Hyperbolic Geometry"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "172--180"
+, update =      "99.11 bibrelex, 98.03 smid, 96.05 mitchell"
 }
 
 @inproceedings{c-apeg-96
-, author =	"L. Cai"
-, title =	"Algorithms on polygonal embeddings of graphs"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"300--305"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "L. Cai"
+, title =       "Algorithms on polygonal embeddings of graphs"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "300--305"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @misc{c-t2s-91
-, author =	"L. Cai"
-, title =	"Tree 2-Spanners"
-, year =	1991
-, note =	"manuscript, Simon Fraser University"
-, update =	"98.07 bibrelex"
+, author =      "L. Cai"
+, title =       "Tree 2-Spanners"
+, year =        1991
+, note =        "manuscript, Simon Fraser University"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ce-vgpr-95
-, author =	"Leizhen Cai and Hazel Everett"
-, title =	"Visibility Graphs of Polygonal Rings"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"157--161"
-, update =	"95.09 jones"
+, author =      "Leizhen Cai and Hazel Everett"
+, title =       "Visibility Graphs of Polygonal Rings"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "157--161"
+, update =      "95.09 jones"
 }
 
 @article{ck-cviis-97
-, author =	"L. Cai and J. M. Keil"
-, title =	"Computing Visibility Information in an Inaccurate Simple Polygon"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"515--538"
-, update =	"98.11 devillers"
+, author =      "L. Cai and J. M. Keil"
+, title =       "Computing Visibility Information in an Inaccurate Simple Polygon"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "515--538"
+, update =      "98.11 devillers"
 }
 
 @article{cxz-cobtcp-99
-, author =	"L. Cai and Y. Xu and B. Zhu"
-, title =	"Computing the Optimal Bridge between two Convex Polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	69
-, year =	1999
-, pages =	"127--130"
-, update =	"02.03 cheong"
+, author =      "L. Cai and Y. Xu and B. Zhu"
+, title =       "Computing the Optimal Bridge between two Convex Polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      69
+, year =        1999
+, pages =       "127--130"
+, update =      "02.03 cheong"
 }
 
 @article{ch-srpfc-68
-, author =	"L. Calabi and W. E. Hartnett"
-, title =	"Shape recognition, prairie fires, convex deficiencies and skeletons"
-, journal =	"Amer. Math. Monthly"
-, volume =	75
-, year =	1968
-, pages =	"335--342"
+, author =      "L. Calabi and W. E. Hartnett"
+, title =       "Shape recognition, prairie fires, convex deficiencies and skeletons"
+, journal =     "Amer. Math. Monthly"
+, volume =      75
+, year =        1968
+, pages =       "335--342"
 }
 
 @inproceedings{cm-tdlin-97
-, author =	"Tiziana Calamoneri and Annalisa Massini"
-, title =	"On Three-Dimensional Layout of Interconnection Networks"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"64--75"
-, keywords =	"graph drawing, 3D"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Tiziana Calamoneri and Annalisa Massini"
+, title =       "On Three-Dimensional Layout of Interconnection Networks"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "64--75"
+, keywords =    "graph drawing, 3D"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @techreport{cs-d234cg-96
-, author =	"T. Calamoneri and A. Sterbini"
-, title =	"Drawing $2$-, $3$- and $4$-colorable graphs in $O(n^2)$ volume"
-, type =	"report"
-, institution =	"Dept. of Computer Sci., Univ of Rome ``La Sapienza''"
-, year =	1996
-, keywords =	"graph drawing, straight-line, 3D"
-, precedes =	"cs-d234c-97"
-, update =	"98.07 patrignani, 96.09 tamassia"
+, author =      "T. Calamoneri and A. Sterbini"
+, title =       "Drawing $2$-, $3$- and $4$-colorable graphs in $O(n^2)$ volume"
+, type =        "report"
+, institution = "Dept. of Computer Sci., Univ of Rome ``La Sapienza''"
+, year =        1996
+, keywords =    "graph drawing, straight-line, 3D"
+, precedes =    "cs-d234c-97"
+, update =      "98.07 patrignani, 96.09 tamassia"
 }
 
 @inproceedings{cs-d234c-97
-, author =	"T. Calamoneri and A. Sterbini"
-, title =	"Drawing $2$-, $3$-, and $4$-Colorable Graphs in $O(n^2)$ Volume"
-, editor =	"S. North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"53--62"
-, keywords =	"graph drawing, straight-line, 3D"
-, succeeds =	"cs-d234cg-96"
-, update =	"98.07 patrignani"
+, author =      "T. Calamoneri and A. Sterbini"
+, title =       "Drawing $2$-, $3$-, and $4$-Colorable Graphs in $O(n^2)$ Volume"
+, editor =      "S. North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "53--62"
+, keywords =    "graph drawing, straight-line, 3D"
+, succeeds =    "cs-d234cg-96"
+, update =      "98.07 patrignani"
 }
 
 @inproceedings{cgg-oiprf-99
-, author =	"A. Calatayud and J. Garc{\'\i}a and F. G{\'o}mez"
-, title =	"Optimal Illumination of Points with a Restricted Flood-Light"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"87--90"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "A. Calatayud and J. Garc{\'\i}a and F. G{\'o}mez"
+, title =       "Optimal Illumination of Points with a Restricted Flood-Light"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "87--90"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{cgr-tbtta-95
-, author =	"Paul Callahan and Michael T. Goodrich and Kumar Ramaiyer"
-, title =	"Topology {B}-Trees and their Applications"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"381--392"
-, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
+, author =      "Paul Callahan and Michael T. Goodrich and Kumar Ramaiyer"
+, title =       "Topology {B}-Trees and their Applications"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "381--392"
+, update =      "99.07 bibrelex, 96.01 smid, 95.05 mitchell"
 }
 
 @phdthesis{c-dwhdt-95
-, author =	"P. B. Callahan"
-, title =	"Dealing with higher dimensions: the well-separated pair decomposition and its applications"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Johns Hopkins University"
-, address =	"Baltimore, Maryland"
-, year =	1995
-, keywords =	"doctoral thesis"
-, update =	"96.05 smid"
+, author =      "P. B. Callahan"
+, title =       "Dealing with higher dimensions: the well-separated pair decomposition and its applications"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Johns Hopkins University"
+, address =     "Baltimore, Maryland"
+, year =        1995
+, keywords =    "doctoral thesis"
+, update =      "96.05 smid"
 }
 
 @inproceedings{c-opann-93
-, author =	"Paul B. Callahan"
-, title =	"Optimal Parallel All-Nearest-Neighbors Using the Well-Seated Pair Decomposition"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"332--340"
-, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Paul B. Callahan"
+, title =       "Optimal Parallel All-Nearest-Neighbors Using the Well-Seated Pair Decomposition"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "332--340"
+, update =      "98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{ck-dmdps-92
-, author =	"P. B. Callahan and S. R. Kosaraju"
-, title =	"A decomposition of multi-dimensional point-sets with applications to $k$-nearest-neighbors and $n$-body potential fields"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"546--556"
-, keywords =	"well-separated pair decomposition"
-, update =	"93.09 rote"
+, author =      "P. B. Callahan and S. R. Kosaraju"
+, title =       "A decomposition of multi-dimensional point-sets with applications to $k$-nearest-neighbors and $n$-body potential fields"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "546--556"
+, keywords =    "well-separated pair decomposition"
+, update =      "93.09 rote"
 }
 
 @article{ck-dmpsa-95
-, author =	"P. B. Callahan and S. R. Kosaraju"
-, title =	"A decomposition of multidimensional point sets with applications to $k$-nearest-neighbors and $n$-body potential fields"
-, journal =	"J. ACM"
-, volume =	42
-, year =	1995
-, pages =	"67--90"
-, update =	"96.05 smid"
+, author =      "P. B. Callahan and S. R. Kosaraju"
+, title =       "A decomposition of multidimensional point sets with applications to $k$-nearest-neighbors and $n$-body potential fields"
+, journal =     "J. ACM"
+, volume =      42
+, year =        1995
+, pages =       "67--90"
+, update =      "96.05 smid"
 }
 
 @inproceedings{ck-adcpn-95
-, author =	"Paul B. Callahan and S. Rao Kosaraju"
-, title =	"Algorithms for Dynamic Closest-Pair and {$n$}-Body Potential Fields"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"263--272"
-, keywords =	"dynamic algorithms, closest pair, all nearest neighbors, fast multipole method"
-, update =	"96.09 agarwal, 96.05 mitchell"
+, author =      "Paul B. Callahan and S. Rao Kosaraju"
+, title =       "Algorithms for Dynamic Closest-Pair and {$n$}-Body Potential Fields"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "263--272"
+, keywords =    "dynamic algorithms, closest pair, all nearest neighbors, fast multipole method"
+, update =      "96.09 agarwal, 96.05 mitchell"
 }
 
 @inproceedings{ck-fasgg-93
-, author =	"P. B. Callahan and S. R. Kosaraju"
-, title =	"Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"291--300"
-, keywords =	"optimization, minimum spanning trees, spanner, well-separated pair decomposition"
-, cites =	"ck-dmdps-92"
-, update =	"93.09 rote, 93.05 smid"
+, author =      "P. B. Callahan and S. R. Kosaraju"
+, title =       "Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "291--300"
+, keywords =    "optimization, minimum spanning trees, spanner, well-separated pair decomposition"
+, cites =       "ck-dmdps-92"
+, update =      "93.09 rote, 93.05 smid"
 }
 
 @techreport{cs-mpssr-86
-, author =	"K. Cameron and H. Sachs"
-, title =	"Monotone Path Systems in Simple Regions"
-, type =	"Technical {Report}"
-, number =	86429
-, institution =	"Management Science Dept., University of Waterloo"
-, year =	1986
-, update =	"93.09 milone+mitchell"
+, author =      "K. Cameron and H. Sachs"
+, title =       "Monotone Path Systems in Simple Regions"
+, type =        "Technical {Report}"
+, number =      86429
+, institution = "Management Science Dept., University of Waterloo"
+, year =        1986
+, update =      "93.09 milone+mitchell"
 }
 
 @incollection{c-agg-83
-, author =	"P. J. Cameron"
-, title =	"Automorphism Groups of Graphs"
-, editor =	"B. Wilson"
-, booktitle =	"Selected Topics in Graph Theory"
-, publisher =	"Academic Press"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "P. J. Cameron"
+, title =       "Automorphism Groups of Graphs"
+, editor =      "B. Wilson"
+, booktitle =   "Selected Topics in Graph Theory"
+, publisher =   "Academic Press"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @techreport{c-eactc-??
-, author =	"S. Cameron"
-, title =	"An efficient algorithm for computing the translational configuration space obstacle of two convex polyhedra"
-, type =	"Report"
-, number =	"??"
-, institution =	"McDonnell Douglas Res. Lab."
-, year =	"??"
+, author =      "S. Cameron"
+, title =       "An efficient algorithm for computing the translational configuration space obstacle of two convex polyhedra"
+, type =        "Report"
+, number =      "??"
+, institution = "McDonnell Douglas Res. Lab."
+, year =        "??"
 }
 
 @article{c-cdfdi-90
-, author =	"S. Cameron"
-, title =	"Collision Detection by Four-Dimensional Intersection Testing"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	6
-, number =	3
-, year =	1990
-, pages =	"291--302"
-, update =	"95.01 mitchell"
+, author =      "S. Cameron"
+, title =       "Collision Detection by Four-Dimensional Intersection Testing"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      6
+, number =      3
+, year =        1990
+, pages =       "291--302"
+, update =      "95.01 mitchell"
 }
 
 @article{c-ebcsg-91
-, author =	"S. Cameron"
-, title =	"Efficient bounds in constructive solid geometry"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	11
-, number =	3
-, year =	1991
-, pages =	"68--74"
-, keywords =	"data structuring, geometric modeling, constructive solid geometry"
-, update =	"95.09 korneenko"
+, author =      "S. Cameron"
+, title =       "Efficient bounds in constructive solid geometry"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      11
+, number =      3
+, year =        1991
+, pages =       "68--74"
+, keywords =    "data structuring, geometric modeling, constructive solid geometry"
+, update =      "95.09 korneenko"
 }
 
 @article{cy-rmgbc-92
-, author =	"S. Cameron and C.-K. Yap"
-, title =	"Refinement methods for geometric bounds in constructive solid geometry"
-, journal =	"ACM Trans. Graph."
-, volume =	11
-, year =	1992
-, pages =	"12--39"
-, keywords =	"constituents, boolean algebra, simplification"
-, update =	"93.09 held"
+, author =      "S. Cameron and C.-K. Yap"
+, title =       "Refinement methods for geometric bounds in constructive solid geometry"
+, journal =     "ACM Trans. Graph."
+, volume =      11
+, year =        1992
+, pages =       "12--39"
+, keywords =    "constituents, boolean algebra, simplification"
+, update =      "93.09 held"
 }
 
 @inproceedings{cc-dmtdb-86
-, author =	"S. A. Cameron and R. K. Culley"
-, title =	"Determining the minimum translational distance between two convex polyhedra"
-, booktitle =	"Proc. of IEEE Inter. Conf. on Robotics and Automation"
-, year =	1986
-, pages =	"591--596"
-, keywords =	"GEOMOD OBSTACLE-AVOID COMPUTATIONAL-GEOMETRY 3D PROXIMITY INTERSECTION CONVEX"
-, update =	"98.07 bibrelex"
-, annote =	"An algorithm is described to determine the Minimal
-		 Translation Distance (MTD) between two polyhedra. One
-		 way in which this algorithm differs from others is that
-		 it will return a value other than zero if the two
-		 objects intersect. This value is the penetration
-		 distance and has a negative sign. -WCF"
+, author =      "S. A. Cameron and R. K. Culley"
+, title =       "Determining the minimum translational distance between two convex polyhedra"
+, booktitle =   "Proc. of IEEE Inter. Conf. on Robotics and Automation"
+, year =        1986
+, pages =       "591--596"
+, keywords =    "GEOMOD OBSTACLE-AVOID COMPUTATIONAL-GEOMETRY 3D PROXIMITY INTERSECTION CONVEX"
+, update =      "98.07 bibrelex"
+, annote =      "An algorithm is described to determine the Minimal
+                 Translation Distance (MTD) between two polyhedra. One
+                 way in which this algorithm differs from others is that
+                 it will return a value other than zero if the two
+                 objects intersect. This value is the penetration
+                 distance and has a negative sign. -WCF"
 }
 
 @article{cks-desrt-99
-, author =	"S. Campagna and L. Kobbelt and H.-P. Seidel"
-, title =	"Directed Edges --- A Scalable Representation for Triangle Meshes"
-, journal =	"J. Graphics Tools"
-, volume =	3
-, number =	4
-, year =	1999
-, pages =	"1--12"
-, update =	"00.03 held"
+, author =      "S. Campagna and L. Kobbelt and H.-P. Seidel"
+, title =       "Directed Edges --- A Scalable Representation for Triangle Meshes"
+, journal =     "J. Graphics Tools"
+, volume =      3
+, number =      4
+, year =        1999
+, pages =       "1--12"
+, update =      "00.03 held"
 }
 
 @phdthesis{c-mgdii-91
-, author =	"A. T. Campbell"
-, title =	"Modeling Global Diffuse Illumination for Image Synthesis"
-, school =	"Dept. Comput. Sci., Univ. Texas Austin"
-, address =	"Austin, TX"
-, year =	1991
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "A. T. Campbell"
+, title =       "Modeling Global Diffuse Illumination for Image Synthesis"
+, school =      "Dept. Comput. Sci., Univ. Texas Austin"
+, address =     "Austin, TX"
+, year =        1991
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{c-crsdr-85
-, author =	"D. Campbell"
-, title =	"The {Cornell} robot system design report"
-, type =	"Technical {Report}"
-, number =	"85-697"
-, institution =	"Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "D. Campbell"
+, title =       "The {Cornell} robot system design report"
+, type =        "Technical {Report}"
+, number =      "85-697"
+, institution = "Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @article{ch-mvg-91
-, author =	"D. Campbell and J. Higgins"
-, title =	"Minimal visibility graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	37
-, number =	1
-, year =	1991
-, pages =	"49--53"
-, keywords =	"visibility, geometric graphs, segments"
-, update =	"95.09 korneenko"
+, author =      "D. Campbell and J. Higgins"
+, title =       "Minimal visibility graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      37
+, number =      1
+, year =        1991
+, pages =       "49--53"
+, keywords =    "visibility, geometric graphs, segments"
+, update =      "95.09 korneenko"
 }
 
 @article{cf-amggdi-90
-, author =	"A. T. {Campbell III} and D. S. Fussell"
-, title =	"Adaptive Mesh Generation for Global Diffuse Illumination"
-, journal =	"Comput. Graph."
-, volume =	24
-, month =	aug
-, year =	1990
-, pages =	"155--164"
-, update =	"98.11 ghali"
+, author =      "A. T. {Campbell III} and D. S. Fussell"
+, title =       "Adaptive Mesh Generation for Global Diffuse Illumination"
+, journal =     "Comput. Graph."
+, volume =      24
+, month =       aug
+, year =        1990
+, pages =       "155--164"
+, update =      "98.11 ghali"
 }
 
 @techreport{cf-aaial-91
-, author =	"A. T. {Campbell III} and D. S. Fussell"
-, title =	"An Analytic Approach to Illumination with Area Light Sources"
-, type =	"Report"
-, number =	"TR--91--25"
-, institution =	"Department of Computer Sciences, University of Texas at Austin"
-, address =	"Austin, Texas"
-, month =	aug
-, year =	1991
-, update =	"99.03 forrest, 98.11 ghali"
+, author =      "A. T. {Campbell III} and D. S. Fussell"
+, title =       "An Analytic Approach to Illumination with Area Light Sources"
+, type =        "Report"
+, number =      "TR--91--25"
+, institution = "Department of Computer Sciences, University of Texas at Austin"
+, address =     "Austin, Texas"
+, month =       aug
+, year =        1991
+, update =      "99.03 forrest, 98.11 ghali"
 }
 
 @article{c-icdir-93
-, author =	"F. Can"
-, title =	"Incremental clustering for dynamic information retrieval"
-, journal =	"ACM Trans. Inform. Syst."
-, volume =	11
-, year =	1993
-, pages =	"143--164"
-, update =	"98.07 agarwal"
+, author =      "F. Can"
+, title =       "Incremental clustering for dynamic information retrieval"
+, journal =     "ACM Trans. Inform. Syst."
+, volume =      11
+, year =        1993
+, pages =       "143--164"
+, update =      "98.07 agarwal"
 }
 
 @incollection{cgh-snebc-89
-, author =	"L. Canaglia and A. Galligo and J. Heintz"
-, title =	"Some new effectivity bounds in computational geometry"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	357
-, year =	1989
-, pages =	"131--151"
-, keywords =	"algebraic geometry, motion planning, parallel computation"
-, update =	"95.09 korneenko"
+, author =      "L. Canaglia and A. Galligo and J. Heintz"
+, title =       "Some new effectivity bounds in computational geometry"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      357
+, year =        1989
+, pages =       "131--151"
+, keywords =    "algebraic geometry, motion planning, parallel computation"
+, update =      "95.09 korneenko"
 }
 
 @article{c-talp-69
-, author =	"R. Canham"
-, title =	"A theorem on arrangements of lines in the plane"
-, journal =	"Israel J. Math."
-, volume =	7
-, year =	1969
-, pages =	"393--397"
-, keywords =	"arrangements, complexity of faces"
+, author =      "R. Canham"
+, title =       "A theorem on arrangements of lines in the plane"
+, journal =     "Israel J. Math."
+, volume =      7
+, year =        1969
+, pages =       "393--397"
+, keywords =    "arrangements, complexity of faces"
 }
 
 @techreport{cgh-snebc-88
-, author =	"L. Caniglia and A. Galligo and J. Heintz"
-, title =	"Some new efficient bounds in computational geometry"
-, institution =	"Instituto Argentino de Mathem{\'a}tica"
-, address =	"Buenos Aires, Argentina"
-, year =	1988
-, note =	"Preliminary version"
-, update =	"98.03 bibrelex"
+, author =      "L. Caniglia and A. Galligo and J. Heintz"
+, title =       "Some new efficient bounds in computational geometry"
+, institution = "Instituto Argentino de Mathem{\'a}tica"
+, address =     "Buenos Aires, Argentina"
+, year =        1988
+, note =        "Preliminary version"
+, update =      "98.03 bibrelex"
 }
 
 @article{c-cgts-69
-, author =	"J. J. Cannon"
-, title =	"Computers in Group Theory: {A} Survey"
-, journal =	"Commun. ACM"
-, volume =	12
-, year =	1969
-, pages =	"3--12"
-, update =	"97.11 bibrelex"
+, author =      "J. J. Cannon"
+, title =       "Computers in Group Theory: {A} Survey"
+, journal =     "Commun. ACM"
+, volume =      12
+, year =        1969
+, pages =       "3--12"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{c-namrm-87
-, author =	"J. Canny"
-, title =	"A new algebraic method for robot motion planning and real geometry"
-, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1987
-, pages =	"39--48"
+, author =      "J. Canny"
+, title =       "A new algebraic method for robot motion planning and real geometry"
+, booktitle =   "Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1987
+, pages =       "39--48"
 }
 
 @inproceedings{c-vmpmp-85
-, author =	"J. Canny"
-, title =	"A {Voronoi} method for the piano-movers problem"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"St. Louis, MO"
-, year =	1985
-, pages =	"530--535"
+, author =      "J. Canny"
+, title =       "A {Voronoi} method for the piano-movers problem"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "St. Louis, MO"
+, year =        1985
+, pages =       "530--535"
 }
 
 @inproceedings{c-emscc-87
-, author =	"J. Canny"
-, title =	"An efficient method for skeletonizing the connected components of a semi-algebraic set"
-, booktitle =	"4th Computational Geometry Day"
-, organization =	"New York Univ."
-, month =	mar
-, year =	1987
-, note =	"Presented Talk"
-, update =	"98.03 bibrelex"
+, author =      "J. Canny"
+, title =       "An efficient method for skeletonizing the connected components of a semi-algebraic set"
+, booktitle =   "4th Computational Geometry Day"
+, organization =        "New York Univ."
+, month =       mar
+, year =        1987
+, note =        "Presented Talk"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{c-cdmp-84
-, author =	"J. Canny"
-, title =	"Collision Detection for Moving Polyhedra"
-, type =	"A. {I}. {Memo}"
-, number =	806
-, institution =	"Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "J. Canny"
+, title =       "Collision Detection for Moving Polyhedra"
+, type =        "A. {I}. {Memo}"
+, number =      806
+, institution = "Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @article{c-cdmp-86
-, author =	"John Canny"
-, title =	"Collision Detection for Moving Polyhedra"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-8"
-, number =	2
-, year =	1986
-, pages =	"200--209"
-, update =	"95.01 mitchell"
+, author =      "John Canny"
+, title =       "Collision Detection for Moving Polyhedra"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-8"
+, number =      2
+, year =        1986
+, pages =       "200--209"
+, update =      "95.01 mitchell"
 }
 
 @article{c-crgss-93
-, author =	"J. Canny"
-, title =	"Computing roadmaps in general semialgebraic sets"
-, journal =	"Comput. J."
-, volume =	36
-, year =	1993
-, pages =	"409--418"
-, update =	"98.07 agarwal, 95.05 agarwal"
+, author =      "J. Canny"
+, title =       "Computing roadmaps in general semialgebraic sets"
+, journal =     "Comput. J."
+, volume =      36
+, year =        1993
+, pages =       "409--418"
+, update =      "98.07 agarwal, 95.05 agarwal"
 }
 
 @inproceedings{c-crsas-91
-, author =	"J. Canny"
-, title =	"Computing roadmaps of semi-algebraic sets"
-, booktitle =	"Proc. 9th AAECC"
-, site =	"New Orleans"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "J. Canny"
+, title =       "Computing roadmaps of semi-algebraic sets"
+, booktitle =   "Proc. 9th AAECC"
+, site =        "New Orleans"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{c-crsas-86
-, author =	"J. Canny"
-, title =	"Constructing roadmaps of semi-algebraic sets"
-, booktitle =	"International Workshop on Geometric Reasoning"
-, site =	"Oxford University, England"
-, year =	1986
-, precedes =	"c-crsas-88"
-, update =	"95.09 korneenko"
+, author =      "J. Canny"
+, title =       "Constructing roadmaps of semi-algebraic sets"
+, booktitle =   "International Workshop on Geometric Reasoning"
+, site =        "Oxford University, England"
+, year =        1986
+, precedes =    "c-crsas-88"
+, update =      "95.09 korneenko"
 }
 
 @article{c-crsas-88
-, author =	"J. Canny"
-, title =	"Constructing roadmaps of semi-algebraic sets 1: {Completeness}"
-, journal =	"Artif. Intell."
-, volume =	37
-, year =	1988
-, pages =	"203--222"
-, keywords =	"motion planning, algebraic geometry"
-, succeeds =	"c-crsas-86"
-, update =	"96.09 devillers, 95.09 korneenko"
+, author =      "J. Canny"
+, title =       "Constructing roadmaps of semi-algebraic sets 1: {Completeness}"
+, journal =     "Artif. Intell."
+, volume =      37
+, year =        1988
+, pages =       "203--222"
+, keywords =    "motion planning, algebraic geometry"
+, succeeds =    "c-crsas-86"
+, update =      "96.09 devillers, 95.09 korneenko"
 }
 
 @inproceedings{c-gcp-88
-, author =	"J. Canny"
-, title =	"Generalized Characteristic Poynomials"
-, booktitle =	"Proc. ACM Sympos. Symbolic and Algebraic Computation"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "J. Canny"
+, title =       "Generalized Characteristic Poynomials"
+, booktitle =   "Proc. ACM Sympos. Symbolic and Algebraic Computation"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @article{c-iasde-93
-, author =	"J. Canny"
-, title =	"Improved algorithms for sign determination and existential quantifier elimination"
-, journal =	"Comput. J."
-, volume =	36
-, year =	1993
-, pages =	"504--514"
-, update =	"98.07 agarwal"
+, author =      "J. Canny"
+, title =       "Improved algorithms for sign determination and existential quantifier elimination"
+, journal =     "Comput. J."
+, volume =      36
+, year =        1993
+, pages =       "504--514"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{c-dcbp-84
-, author =	"J. Canny"
-, title =	"On detecting collision between polyhedra"
-, booktitle =	"Proc. ECAI"
-, year =	1984
-, pages =	"533--542"
-, update =	"98.03 bibrelex"
+, author =      "J. Canny"
+, title =       "On detecting collision between polyhedra"
+, booktitle =   "Proc. ECAI"
+, year =        1984
+, pages =       "533--542"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{c-sagcp-88
-, author =	"J. Canny"
-, title =	"Some algebraic and geometric computations in {PSPACE}"
-, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
-, year =	1988
-, pages =	"460--467"
-, update =	"98.07 agarwal"
+, author =      "J. Canny"
+, title =       "Some algebraic and geometric computations in {PSPACE}"
+, booktitle =   "Proc. 20th Annu. ACM Sympos. Theory Comput."
+, year =        1988
+, pages =       "460--467"
+, update =      "98.07 agarwal"
 }
 
 @book{c-crmp-87
-, author =	"J. Canny"
-, title =	"The Complexity of Robot Motion Planning"
-, series =	"ACM -- MIT Press Doctoral Dissertation Award Series"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1987
-, isbn =	"0-262-03136-1"
-, keywords =	"doctoral thesis"
-, comments =	"revised version of author's Ph.D. thesis, Electrical
-		 Engineering and Computer Science Dept., Massachusetts
-		 Inst. Tech. 1987"
-, update =	"97.11 bibrelex"
+, author =      "J. Canny"
+, title =       "The Complexity of Robot Motion Planning"
+, series =      "ACM -- MIT Press Doctoral Dissertation Award Series"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1987
+, isbn =        "0-262-03136-1"
+, keywords =    "doctoral thesis"
+, comments =    "revised version of author's Ph.D. thesis, Electrical
+                 Engineering and Computer Science Dept., Massachusetts
+                 Inst. Tech. 1987"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{cd-svd-87
-, author =	"J. Canny and B. R. Donald"
-, title =	"Simplified {Voronoi} diagrams"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"153--161"
-, precedes =	"cd-svd-88"
-, cites =	"c-cdmp-86, c-vmpmp-85, c-crsas-86, d-mpsdf-84, ld-gvdp-81, l-spcsa-83, lw-apcfp-79, osy-gvdl1-84, osy-gvdl2-84, oy-rmpmd-85, ss-pmp2g-82, sy-agar-87, w-esrav-57, y-cmsd-84, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "J. Canny and B. R. Donald"
+, title =       "Simplified {Voronoi} diagrams"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "153--161"
+, precedes =    "cd-svd-88"
+, cites =       "c-cdmp-86, c-vmpmp-85, c-crsas-86, d-mpsdf-84, ld-gvdp-81, l-spcsa-83, lw-apcfp-79, osy-gvdl1-84, osy-gvdl2-84, oy-rmpmd-85, ss-pmp2g-82, sy-agar-87, w-esrav-57, y-cmsd-84, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{cd-svd-88
-, author =	"J. Canny and B. R. Donald"
-, title =	"Simplified {Voronoi} diagrams"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"219--236"
-, succeeds =	"cd-svd-87"
+, author =      "J. Canny and B. R. Donald"
+, title =       "Simplified {Voronoi} diagrams"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "219--236"
+, succeeds =    "cd-svd-87"
 }
 
 @inproceedings{cdrx-ckp-88
-, author =	"J. Canny and B. R. Donald and J. Reif and P. Xavier"
-, title =	"On the complexity of kinodynamic planning"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, site =	"White Plains, NY"
-, year =	1988
-, pages =	"306--316"
-, precedes =	"dxcr-kmp-93"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "J. Canny and B. R. Donald and J. Reif and P. Xavier"
+, title =       "On the complexity of kinodynamic planning"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, site =        "White Plains, NY"
+, year =        1988
+, pages =       "306--316"
+, precedes =    "dxcr-kmp-93"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{cdr-rrmrg-92
-, author =	"J. Canny and B. R. Donald and E. K. Ressler"
-, title =	"A rational rotation method for robust geometric algorithms"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"251--260"
-, succeeds =	"cdr-rrmrg-91"
-, cites =	"ahu-daca-74, b-eaosp-89, bm-gaprb-89, c-cfmp-89, d-edrr-89, d-cpcmp-90, dp-mccrb-90, e-ubfmp-86, afw-fsgvd-88, hhk-tirgc-88, l-spcsa-83, l-rmp-91, lm-cschu-90, mn-fccrp-90i, ps-cgi-85, r-lent-64, s-bag-77, si-smsft-89, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "J. Canny and B. R. Donald and E. K. Ressler"
+, title =       "A rational rotation method for robust geometric algorithms"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "251--260"
+, succeeds =    "cdr-rrmrg-91"
+, cites =       "ahu-daca-74, b-eaosp-89, bm-gaprb-89, c-cfmp-89, d-edrr-89, d-cpcmp-90, dp-mccrb-90, e-ubfmp-86, afw-fsgvd-88, hhk-tirgc-88, l-spcsa-83, l-rmp-91, lm-cschu-90, mn-fccrp-90i, ps-cgi-85, r-lent-64, s-bag-77, si-smsft-89, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{cdr-rrmrg-91
-, author =	"J. Canny and B. R. Donald and G. Ressler"
-, title =	"A rational rotation method for robust geometric algorithms"
-, type =	"Technical {Report}"
-, number =	"TR~91-1247"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	dec
-, year =	1991
-, keywords =	"robustness"
-, comments =	"extended abstract"
-, precedes =	"cdr-rrmrg-92"
+, author =      "J. Canny and B. R. Donald and G. Ressler"
+, title =       "A rational rotation method for robust geometric algorithms"
+, type =        "Technical {Report}"
+, number =      "TR~91-1247"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       dec
+, year =        1991
+, keywords =    "robustness"
+, comments =    "extended abstract"
+, precedes =    "cdr-rrmrg-92"
 }
 
 @inproceedings{crr-eakpp-90
-, author =	"J. Canny and A. Rege and J. Reif"
-, title =	"An exact algorithm for kinodynamic planning in the plane"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"271--280"
-, precedes =	"crr-eakpp-91"
-, cites =	"bdg-ocrma-83, cdrx-ckp-88, cr-nlbtr-87, fw-pcm-88, h-dsmt-83, jc-pspmr-89, jhcp-pgnto-89, o-mpic-87, rt-akpul-89, r-ccgfo-89, sh-pmttr-84, s-obbtr-87, sd-gtomr-88, sm-mtcrm-85, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "J. Canny and A. Rege and J. Reif"
+, title =       "An exact algorithm for kinodynamic planning in the plane"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "271--280"
+, precedes =    "crr-eakpp-91"
+, cites =       "bdg-ocrma-83, cdrx-ckp-88, cr-nlbtr-87, fw-pcm-88, h-dsmt-83, jc-pspmr-89, jhcp-pgnto-89, o-mpic-87, rt-akpul-89, r-ccgfo-89, sh-pmttr-84, s-obbtr-87, sd-gtomr-88, sm-mtcrm-85, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{crr-eakpp-91
-, author =	"J. Canny and A. Rege and J. Reif"
-, title =	"An exact algorithm for kinodynamic planning in the plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"461--484"
-, succeeds =	"crr-eakpp-90"
+, author =      "J. Canny and A. Rege and J. Reif"
+, title =       "An exact algorithm for kinodynamic planning in the plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "461--484"
+, succeeds =    "crr-eakpp-90"
 }
 
 @inproceedings{cr-nlbtr-87
-, author =	"J. Canny and J. H. Reif"
-, title =	"New lower bound techniques for robot motion planning problems"
-, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1987
-, pages =	"49--60"
+, author =      "J. Canny and J. H. Reif"
+, title =       "New lower bound techniques for robot motion planning problems"
+, booktitle =   "Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1987
+, pages =       "49--60"
 }
 
 @inproceedings{c-isda-91
-, author =	"J. F. Canny"
-, title =	"An improved sign determination algorithm"
-, booktitle =	"Proc. 9th AAECC"
-, site =	"New Orleans"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "J. F. Canny"
+, title =       "An improved sign determination algorithm"
+, booktitle =   "Proc. 9th AAECC"
+, site =        "New Orleans"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{c-cfmp-89
-, author =	"J. F. Canny"
-, title =	"On the Computability of Fine-Motion Plans"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, publisher =	"IEEE Computer Society Press"
-, address =	"Scottsdale, Arizona"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "J. F. Canny"
+, title =       "On the Computability of Fine-Motion Plans"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, publisher =   "IEEE Computer Society Press"
+, address =     "Scottsdale, Arizona"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{cg-rirrr-94
-, author =	"J. F. Canny and K. Y. Goldberg"
-, title =	"RISC for Industrial Robotics: Recent Results and Open Problems"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"San Diego, CA"
-, month =	may
-, year =	1994
-, update =	"95.01 held"
+, author =      "J. F. Canny and K. Y. Goldberg"
+, title =       "RISC for Industrial Robotics: Recent Results and Open Problems"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "San Diego, CA"
+, month =       may
+, year =        1994
+, update =      "95.01 held"
 }
 
 @article{cgv-fccsa-92
-, author =	"John F. Canny and Dima Grigor{\'e}v and Nicolai Vorobjov"
-, title =	"Finding connected components of a semi-algebraic set in subexponential time"
-, journal =	"Appl. Algebra Emg. Commun. Comput."
-, volume =	2
-, year =	1992
-, pages =	"217--238"
-, update =	"98.07 agarwal"
+, author =      "John F. Canny and Dima Grigor{\'e}v and Nicolai Vorobjov"
+, title =       "Finding connected components of a semi-algebraic set in subexponential time"
+, journal =     "Appl. Algebra Emg. Commun. Comput."
+, volume =      2
+, year =        1992
+, pages =       "217--238"
+, update =      "98.07 agarwal"
 }
 
 @techreport{ckl-sspef-89
-, author =	"J. F. Canny and E. Kaltofen and Y. Lakshman"
-, title =	"Solving Systems of Polynomial Equations Faster"
-, type =	"Technical {Report}"
-, number =	"89-14"
-, institution =	"Dept. Comput. Sci., Rensselaer Polytech. Inst."
-, address =	"Troy, NY"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "J. F. Canny and E. Kaltofen and Y. Lakshman"
+, title =       "Solving Systems of Polynomial Equations Faster"
+, type =        "Technical {Report}"
+, number =      "89-14"
+, institution = "Dept. Comput. Sci., Rensselaer Polytech. Inst."
+, address =     "Troy, NY"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
-%, number =	"8"
+%, number =     "8"
 @article{cj-nepiu-98
-, author =	"J. Cantarella and H. Johnston"
-, title =	"Nontrivial embeddings of polygonal intervals and unknots in 3-space"
-, journal =	"J. Knot Theory Ramifications"
-, volume =	7
-, year =	1998
-, pages =	"1027--1039"
-, update =	"99.07 orourke"
+, author =      "J. Cantarella and H. Johnston"
+, title =       "Nontrivial embeddings of polygonal intervals and unknots in 3-space"
+, journal =     "J. Knot Theory Ramifications"
+, volume =      7
+, year =        1998
+, pages =       "1027--1039"
+, update =      "99.07 orourke"
 }
 
 @article{c-ocfpl-71
-, author =	"A. Cantoni"
-, title =	"Optimal curve fitting with piecewise linear functions"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-20"
-, year =	1971
-, pages =	"59--67"
-, update =	"98.07 bibrelex"
+, author =      "A. Cantoni"
+, title =       "Optimal curve fitting with piecewise linear functions"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-20"
+, year =        1971
+, pages =       "59--67"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{cgt-pumlp-96
-, author =	"F. Cao and J. R. Gilbert and S. H. Teng"
-, title =	"Partitioning Unstructured Meshes with Lines and Planes"
-, booktitle =	"9th Internat. Conf. Domain Decomposition"
-, year =	1996
-, note =	"submitted"
-, update =	"97.11 bibrelex"
+, author =      "F. Cao and J. R. Gilbert and S. H. Teng"
+, title =       "Partitioning Unstructured Meshes with Lines and Planes"
+, booktitle =   "9th Internat. Conf. Domain Decomposition"
+, year =        1996
+, note =        "submitted"
+, update =      "97.11 bibrelex"
 }
 
 @book{cm-ecgt-78
-, author =	"M. Capobianco and J. C. Molluzzo"
-, title =	"Examples and Counterexamples in Graph Theory"
-, publisher =	"North-Holland"
-, year =	1978
-, update =	"97.11 bibrelex"
+, author =      "M. Capobianco and J. C. Molluzzo"
+, title =       "Examples and Counterexamples in Graph Theory"
+, publisher =   "North-Holland"
+, year =        1978
+, update =      "97.11 bibrelex"
 }
 
 @article{c-cpo-93
-, author =	"V. Capoyleas"
-, title =	"Clamping of polygonal objects"
-, journal =	"Pattern Recogn. Lett."
-, volume =	14
-, year =	1993
-, pages =	"704--714"
-, update =	"95.01 smid"
+, author =      "V. Capoyleas"
+, title =       "Clamping of polygonal objects"
+, journal =     "Pattern Recogn. Lett."
+, volume =      14
+, year =        1993
+, pages =       "704--714"
+, update =      "95.01 smid"
 }
 
 @article{c-aidp-96
-, author =	"V. Capoyleas"
-, title =	"On the area of the intersection of disks in the plane"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"393--396"
-, update =	"97.03 devillers"
+, author =      "V. Capoyleas"
+, title =       "On the area of the intersection of disks in the plane"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "393--396"
+, update =      "97.03 devillers"
 }
 
 @article{cch-gngcb-96
-, author =	"V. Capoyleas and X. Chen and C. M. Hoffmann"
-, title =	"Generic naming in generative, constraint-based design"
-, journal =	"Comput. Aided Design"
-, volume =	28
-, number =	1
-, year =	1996
-, pages =	"17--26"
-, update =	"98.07 bibrelex"
+, author =      "V. Capoyleas and X. Chen and C. M. Hoffmann"
+, title =       "Generic naming in generative, constraint-based design"
+, journal =     "Comput. Aided Design"
+, volume =      28
+, number =      1
+, year =        1996
+, pages =       "17--26"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{cp-tttcc-90
-, author =	"V. Capoyleas and J. Pach"
-, title =	"A {Tur{\'a}n}-type theorem on chords of a convex polygon"
-, type =	"Technical {Report}"
-, number =	"90-30"
-, institution =	"DIMACS"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "V. Capoyleas and J. Pach"
+, title =       "A {Tur{\'a}n}-type theorem on chords of a convex polygon"
+, type =        "Technical {Report}"
+, number =      "90-30"
+, institution = "DIMACS"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{cp-ppsp-91
-, author =	"V. Capoyleas and J. Pach"
-, title =	"On the perimeter of a point set in the plane"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"54--57"
+, author =      "V. Capoyleas and J. Pach"
+, title =       "On the perimeter of a point set in the plane"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "54--57"
 }
 
 @inproceedings{crw-gc-90
-, author =	"V. Capoyleas and G. Rote and G. Woeginger"
-, title =	"Geometric clusterings"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"28--31"
-, succeeds =	"rw-gc-89"
-, precedes =	"crw-gc-91"
-, cites =	"abky-cabmm-88, a-pdpaa-87, bh-cpcoe-89, b-ak-74, crw-gc-91, d-pcpho-84, e-acg-87, ers-ccsno-90, e-anccp-82, hs-ftp-89, hs-ftp-91, iim-vdlgi-85, j-nccog-82, ms-cscgl-84, ms-ppgmm-91, s-tcg-81, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "V. Capoyleas and G. Rote and G. Woeginger"
+, title =       "Geometric clusterings"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "28--31"
+, succeeds =    "rw-gc-89"
+, precedes =    "crw-gc-91"
+, cites =       "abky-cabmm-88, a-pdpaa-87, bh-cpcoe-89, b-ak-74, crw-gc-91, d-pcpho-84, e-acg-87, ers-ccsno-90, e-anccp-82, hs-ftp-89, hs-ftp-91, iim-vdlgi-85, j-nccog-82, ms-cscgl-84, ms-ppgmm-91, s-tcg-81, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @article{crw-gc-91
-, author =	"V. Capoyleas and G{\"u}nter Rote and G. Woeginger"
-, title =	"Geometric clusterings"
-, journal =	"J. Algorithms"
-, volume =	12
-, year =	1991
-, pages =	"341--356"
-, keywords =	"cluster analysis"
-, succeeds =	"crw-gc-90, rw-gc-89"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 rote, 93.09 rote"
-, abstract =	"A k-clustering of a given set of points in the plane is
-		 a partition of the points into k subsets (clusters). For any
-		 fixed k, we can find a k-clustering which minimizes any monotone
-		 function of the diameters or the radii of the
-		 clusters in polynomial time. The algorithm is based on the
-		 fact that any two clusters in an optimal solution can
-		 be separated by a line."
+, author =      "V. Capoyleas and G{\"u}nter Rote and G. Woeginger"
+, title =       "Geometric clusterings"
+, journal =     "J. Algorithms"
+, volume =      12
+, year =        1991
+, pages =       "341--356"
+, keywords =    "cluster analysis"
+, succeeds =    "crw-gc-90, rw-gc-89"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.03 rote, 93.09 rote"
+, abstract =    "A k-clustering of a given set of points in the plane is
+                 a partition of the points into k subsets (clusters). For any
+                 fixed k, we can find a k-clustering which minimizes any monotone
+                 function of the diameters or the radii of the
+                 clusters in polynomial time. The algorithm is based on the
+                 fact that any two clusters in an optimal solution can
+                 be separated by a line."
 }
 
 @article{cgppsw-ctct-94
-, author =	"S. E. Cappell and J. E. Goodman and J. Pach and R. Pollack and Micha Sharir and R. Wenger"
-, title =	"Common tangents and common transversals"
-, journal =	"Adv. Math."
-, volume =	106
-, year =	1994
-, pages =	"198--215"
-, succeeds =	"cgppsw-ccht-90"
-, update =	"98.03 mitchell, 96.09 devillers, 95.09 wenger"
+, author =      "S. E. Cappell and J. E. Goodman and J. Pach and R. Pollack and Micha Sharir and R. Wenger"
+, title =       "Common tangents and common transversals"
+, journal =     "Adv. Math."
+, volume =      106
+, year =        1994
+, pages =       "198--215"
+, succeeds =    "cgppsw-ccht-90"
+, update =      "98.03 mitchell, 96.09 devillers, 95.09 wenger"
 }
 
 @inproceedings{cgppsw-ccht-90
-, author =	"S. E. Cappell and J. E. Goodman and J. Pach and R. Pollack and Micha Sharir and R. Wenger"
-, title =	"The combinatorial complexity of hyperplane transversals"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"83--91"
-, note =	"(A revised version, entitled ``Common tangents and common
-		 transversals,'' {\it Advance in Math.} 106 (1994), 198--215.)"
-, precedes =	"cgppsw-ctct-94"
-, cites =	"ab-eact-87, a-pdpaa-87, ad-ahdsp-90, blwsz-om-93, bf-tdkk-34, c-npbct-71, e-ftssg-85, e-acg-87, egs-ueplf-89, es-mnwsn-87, ew-spdtl-89, gp-ms-83, gp-htthd-88, hiir-wolla-89, klz-gpcs-85, ks-sbtat-77, m-tom-82, w-ubgpc-90, w-gpcc-90, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex, 95.09 wenger, 95.05 agarwal"
+, author =      "S. E. Cappell and J. E. Goodman and J. Pach and R. Pollack and Micha Sharir and R. Wenger"
+, title =       "The combinatorial complexity of hyperplane transversals"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "83--91"
+, note =        "(A revised version, entitled ``Common tangents and common
+                 transversals,'' {\it Advance in Math.} 106 (1994), 198--215.)"
+, precedes =    "cgppsw-ctct-94"
+, cites =       "ab-eact-87, a-pdpaa-87, ad-ahdsp-90, blwsz-om-93, bf-tdkk-34, c-npbct-71, e-ftssg-85, e-acg-87, egs-ueplf-89, es-mnwsn-87, ew-spdtl-89, gp-ms-83, gp-htthd-88, hiir-wolla-89, klz-gpcs-85, ks-sbtat-77, m-tom-82, w-ubgpc-90, w-gpcc-90, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex, 95.09 wenger, 95.05 agarwal"
 }
 
 % ### others?
 @article{c-mvor-87
-, author =	"V. Cappellini and others"
-, title =	"From multiple views to object recognition"
-, journal =	"IEEE Trans. Circuits Syst."
-, volume =	34
-, year =	1987
-, pages =	"1344--1350"
-, update =	"98.11 bibrelex"
+, author =      "V. Cappellini and others"
+, title =       "From multiple views to object recognition"
+, journal =     "IEEE Trans. Circuits Syst."
+, volume =      34
+, year =        1987
+, pages =       "1344--1350"
+, update =      "98.11 bibrelex"
 }
 
 @article{c-ud5df-11
-, author =	"C. Carath{\'e}odory"
-, title =	"{\"U}ber den {V}ariabilit{\"a}tsbereich der {F}ourierschen {K}onstanten von positiven harmonischen {F}unktionen"
-, journal =	"Rendiconto del Circolo Matematico di Palermo"
-, volume =	32
-, year =	1911
-, pages =	"193--217"
-, update =	"95.01 mitchell"
+, author =      "C. Carath{\'e}odory"
+, title =       "{\"U}ber den {V}ariabilit{\"a}tsbereich der {F}ourierschen {K}onstanten von positiven harmonischen {F}unktionen"
+, journal =     "Rendiconto del Circolo Matematico di Palermo"
+, volume =      32
+, year =        1911
+, pages =       "193--217"
+, update =      "95.01 mitchell"
 }
 
 @article{csw-cds2d-88
-, author =	"G. Carey and M. Sharna and K. Wang"
-, title =	"A class of data structures for $2$-d and $3$-d adaptive mesh refinements"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	26
-, year =	1988
-, pages =	"2607--2622"
-, update =	"97.11 bibrelex"
+, author =      "G. Carey and M. Sharna and K. Wang"
+, title =       "A class of data structures for $2$-d and $3$-d adaptive mesh refinements"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      26
+, year =        1988
+, pages =       "2607--2622"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{cc-hdsrs-??
-, author =	"I. Carlbom and I. Chakravaty"
-, title =	"A hierarchical data structure for representing the spatial decomposition of $3$-d objects"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
+, author =      "I. Carlbom and I. Chakravaty"
+, title =       "A hierarchical data structure for representing the spatial decomposition of $3$-d objects"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
 }
 
 @article{cp-gpvt-78
-, author =	"I. Carlbom and J. Paciorek"
-, title =	"Geometric projection and viewing transformations"
-, journal =	"ACM Comput. Surv."
-, volume =	10
-, year =	1978
-, pages =	"465--502"
+, author =      "I. Carlbom and J. Paciorek"
+, title =       "Geometric projection and viewing transformations"
+, journal =     "ACM Comput. Surv."
+, volume =      10
+, year =        1978
+, pages =       "465--502"
 }
 
 @inproceedings{cgrw-pgfip-94
-, author =	"B. Carlisle and K. Y. Goldberg and A. S. Rao and J. Wiegley"
-, title =	"A pivoting gripper for feeding industrial parts"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, month =	may
-, year =	1994
-, pages =	"1650--1655"
-, update =	"98.03 bibrelex"
+, author =      "B. Carlisle and K. Y. Goldberg and A. S. Rao and J. Wiegley"
+, title =       "A pivoting gripper for feeding industrial parts"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, month =       may
+, year =        1994
+, pages =       "1650--1655"
+, update =      "98.03 bibrelex"
 }
 
 @article{cr-sdspv-87
-, author =	"E. C. Carlson and R. A. Rutenbar"
-, title =	"A scanline data structure processor for {VLSI} geometry checking"
-, journal =	"IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
-, volume =	5
-, number =	5
-, year =	1987
-, pages =	"780--794"
-, keywords =	"data structuring, VLSI design, parallel computation"
-, update =	"95.09 korneenko"
+, author =      "E. C. Carlson and R. A. Rutenbar"
+, title =       "A scanline data structure processor for {VLSI} geometry checking"
+, journal =     "IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
+, volume =      5
+, number =      5
+, year =        1987
+, pages =       "780--794"
+, keywords =    "data structuring, VLSI design, parallel computation"
+, update =      "95.09 korneenko"
 }
 
 @article{c-ddehi-87
-, author =	"Svante Carlsson"
-, title =	"The Deap: a Double-Ended Heap to Implement Double-Ended Priority Queries"
-, journal =	"Inform. Process. Lett."
-, volume =	26
-, number =	1
-, year =	1987
-, pages =	"33--36"
-, keywords =	"data structuring"
-, update =	"99.07 bibrelex, 95.09 korneenko"
+, author =      "Svante Carlsson"
+, title =       "The Deap: a Double-Ended Heap to Implement Double-Ended Priority Queries"
+, journal =     "Inform. Process. Lett."
+, volume =      26
+, number =      1
+, year =        1987
+, pages =       "33--36"
+, keywords =    "data structuring"
+, update =      "99.07 bibrelex, 95.09 korneenko"
 }
 
 @article{ccs-ncdsd-89
-, author =	"Svante Carlsson and Jingsen Chen and Thomas Strothotte"
-, title =	"A Note on the Construction of the Data Structure ``Deap''"
-, journal =	"Inform. Process. Lett."
-, volume =	31
-, year =	1989
-, pages =	"315--317"
-, keywords =	"data structuring"
-, update =	"99.07 bibrelex, 95.09 korneenko"
+, author =      "Svante Carlsson and Jingsen Chen and Thomas Strothotte"
+, title =       "A Note on the Construction of the Data Structure ``Deap''"
+, journal =     "Inform. Process. Lett."
+, volume =      31
+, year =        1989
+, pages =       "315--317"
+, keywords =    "data structuring"
+, update =      "99.07 bibrelex, 95.09 korneenko"
 }
 
 @inproceedings{cj-cswps-95
-, author =	"Svante Carlsson and Hakan Jonsson"
-, title =	"Computing a Shortest Watchman Path in a Simple Polygon in Polynomial Time"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"122--134"
-, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
+, author =      "Svante Carlsson and Hakan Jonsson"
+, title =       "Computing a Shortest Watchman Path in a Simple Polygon in Polynomial Time"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "122--134"
+, update =      "99.07 bibrelex, 96.01 smid, 95.05 mitchell"
 }
 
 @inproceedings{cj-gt-93
-, author =	"Svante Carlsson and Hakan Jonsson"
-, title =	"Guarding a Treasury"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"85--90"
-, cites =	"b-vsp-91, ce-oails-92, dj-tag-92, ea-lacvp-81, h-ovgat-89, ll-cvpe-86, gmr-rlptd-92, o-agta-87, ps-cgi-85, c-ctpg-75, s-rrag-92, ZZZ"
-, update =	"01.04 icking, 99.07 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "Svante Carlsson and Hakan Jonsson"
+, title =       "Guarding a Treasury"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "85--90"
+, cites =       "b-vsp-91, ce-oails-92, dj-tag-92, ea-lacvp-81, h-ovgat-89, ll-cvpe-86, gmr-rlptd-92, o-agta-87, ps-cgi-85, c-ctpg-75, s-rrag-92, ZZZ"
+, update =      "01.04 icking, 99.07 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{cjn-fswrs-93
-, author =	"Svante Carlsson and Hakan Jonsson and Bengt J. Nilsson"
-, title =	"Finding the Shortest Watchman Route in a Simple Polygon"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"58--67"
-, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Svante Carlsson and Hakan Jonsson and Bengt J. Nilsson"
+, title =       "Finding the Shortest Watchman Route in a Simple Polygon"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "58--67"
+, update =      "98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @article{cjn-fswrs-99
-, author =	"S. Carlsson and H. Jonsson and B. J. Nilsson"
-, title =	"Finding the Shortest Watchman Route in a Simple Polygon"
-, journal =	"Discrete Comput. Geom."
-, volume =	22
-, number =	3
-, year =	1999
-, pages =	"377--402"
-, update =	"99.11 held"
+, author =      "S. Carlsson and H. Jonsson and B. J. Nilsson"
+, title =       "Finding the Shortest Watchman Route in a Simple Polygon"
+, journal =     "Discrete Comput. Geom."
+, volume =      22
+, number =      3
+, year =        1999
+, pages =       "377--402"
+, update =      "99.11 held"
 }
 
 @article{cn-cvpp-99
-, author =	"S. Carlsson and B. J. Nilsson"
-, title =	"Computing Vision Points in Polygons"
-, journal =	"Algorithmica"
-, volume =	24
-, year =	1999
-, pages =	"50--75"
-, update =	"00.03 bibrelex"
+, author =      "S. Carlsson and B. J. Nilsson"
+, title =       "Computing Vision Points in Polygons"
+, journal =     "Algorithmica"
+, volume =      24
+, year =        1999
+, pages =       "50--75"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{cnn-ogcmw-91
-, author =	"Svante Carlsson and Bengt J. Nilsson and Simeon Ntafos"
-, title =	"Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"367--378"
-, keywords =	"polygons, visibility"
-, precedes =	"cnn-ogcmw-93"
-, update =	"99.07 bibrelex, 98.03 mitchell, 96.09 devillers"
+, author =      "Svante Carlsson and Bengt J. Nilsson and Simeon Ntafos"
+, title =       "Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "367--378"
+, keywords =    "polygons, visibility"
+, precedes =    "cnn-ogcmw-93"
+, update =      "99.07 bibrelex, 98.03 mitchell, 96.09 devillers"
 }
 
 @article{cnn-ogcmw-93
-, author =	"Svante Carlsson and Bengt J. Nilsson and Simeon Ntafos"
-, title =	"Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"85--105"
-, keywords =	"Visibility, art gallery, watchman route, dynamic programming"
-, succeeds =	"cnn-ogcmw-91"
-, update =	"99.07 bibrelex, 98.03 mitchell, 96.09 devillers"
+, author =      "Svante Carlsson and Bengt J. Nilsson and Simeon Ntafos"
+, title =       "Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "85--105"
+, keywords =    "Visibility, art gallery, watchman route, dynamic programming"
+, succeeds =    "cnn-ogcmw-91"
+, update =      "99.07 bibrelex, 98.03 mitchell, 96.09 devillers"
 }
 
 @inproceedings{ck-mchlt-01
-, author =	"Paz Carmi and Matthew J. Katz"
-, title =	"Minimizing the Convex Hull via Local Transfers"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"105--108"
-, update =	"01.04 icking"
+, author =      "Paz Carmi and Matthew J. Katz"
+, title =       "Minimizing the Convex Hull via Local Transfers"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "105--108"
+, update =      "01.04 icking"
 }
 
 @book{c-dgcs-76
-, author =	"M. de Carmo"
-, title =	"Differential Geometry of Curves and Surfaces"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1976
-, update =	"98.03 bibrelex"
+, author =      "M. de Carmo"
+, title =       "Differential Geometry of Curves and Surfaces"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1976
+, update =      "98.03 bibrelex"
 }
 
 @article{c-dkhvn-70
-, author =	"H. Carnal"
-, title =	"Die konvexe {H{\"u}lle} von $n$ rotationssymmetrisch verteilten {Punkten}"
-, journal =	"Z. Wahrsch. Verw. Gebiete"
-, volume =	15
-, year =	1970
-, pages =	"168--176"
+, author =      "H. Carnal"
+, title =       "Die konvexe {H{\"u}lle} von $n$ rotationssymmetrisch verteilten {Punkten}"
+, journal =     "Z. Wahrsch. Verw. Gebiete"
+, volume =      15
+, year =        1970
+, pages =       "168--176"
 }
 
 @article{c-gesc96
-, author =	"Y. Caro"
-, title =	"On the generalized {Erd{\H{o}}s-Szekeres} conjecture"
-, journal =	"Discrete Math."
-, volume =	160
-, year =	1996
-, pages =	"229--233"
-, update =	"02.03 devillers"
+, author =      "Y. Caro"
+, title =       "On the generalized {Erd{\H{o}}s-Szekeres} conjecture"
+, journal =     "Discrete Math."
+, volume =      160
+, year =        1996
+, pages =       "229--233"
+, update =      "02.03 devillers"
 }
 
 @article{c-adhgc-80
-, author =	"M. J. Carpano"
-, title =	"Automatic Display of Hierarchized Graphs for Computer Aided Decision Analysis"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	"SMC-10"
-, number =	11
-, year =	1980
-, pages =	"705--715"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. J. Carpano"
+, title =       "Automatic Display of Hierarchized Graphs for Computer Aided Decision Analysis"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      "SMC-10"
+, number =      11
+, year =        1980
+, pages =       "705--715"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 %  what is this??
 @article{cd-adtgi-80
-, author =	"M. J. Carpano and M. Delarche"
-, title =	"Apport des Techniques Graphiques Interactives a l'Analyse Structurale de Systemes. {II}-Exemples de Realization et d'Application"
-, journal =	"RAIRO Sept. Anal. Cont. June"
-, volume =	"??"
-, year =	1980
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. J. Carpano and M. Delarche"
+, title =       "Apport des Techniques Graphiques Interactives a l'Analyse Structurale de Systemes. {II}-Exemples de Realization et d'Application"
+, journal =     "RAIRO Sept. Anal. Cont. June"
+, volume =      "??"
+, year =        1980
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{cms-sssa-01
-, author =	"Hamish Carr and Torsten M{\"o}ller and Jack Snoeyink"
-, title =	"Simplicial Subdivisions and Sampling Artifacts"
-, booktitle =	"Proceedings IEEE Visualization 2001"
-, year =	2001
-, pages =	"99--106"
-, update =	"02.03 wenger"
+, author =      "Hamish Carr and Torsten M{\"o}ller and Jack Snoeyink"
+, title =       "Simplicial Subdivisions and Sampling Artifacts"
+, booktitle =   "Proceedings IEEE Visualization 2001"
+, year =        2001
+, pages =       "99--106"
+, update =      "02.03 wenger"
 }
 
 @article{c-csma-87
-, author =	"L. Carstensen"
-, title =	"A comparison of simple mathematical approaches to spot symbols"
-, journal =	"Cartographica"
-, volume =	24
-, number =	3
-, year =	1987
-, pages =	"46--63"
-, update =	"97.07 agarwal"
+, author =      "L. Carstensen"
+, title =       "A comparison of simple mathematical approaches to spot symbols"
+, journal =     "Cartographica"
+, volume =      24
+, number =      3
+, year =        1987
+, pages =       "46--63"
+, update =      "97.07 agarwal"
 }
 
 @incollection{cc-pptus-95
-, author =	"P. C. P. Carvalho and P. R. Cavalcanti"
-, title =	"Point in polyhedron testing using spherical polygons"
-, editor =	"A. W. Paeth"
-, booktitle =	"Graphics Gems V"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1995
-, pages =	"42--54"
-, update =	"98.07 orourke, 98.03 orourke"
+, author =      "P. C. P. Carvalho and P. R. Cavalcanti"
+, title =       "Point in polyhedron testing using spherical polygons"
+, editor =      "A. W. Paeth"
+, booktitle =   "Graphics Gems V"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1995
+, pages =       "42--54"
+, update =      "98.07 orourke, 98.03 orourke"
 }
 
 @article{c-egssn-96
-, author =	"M. Casale"
-, title =	"Evaluating geometric sensitivities at singular and non-singular points of variational {CAD} models for design optimization"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"443--460"
-, update =	"97.03 devillers"
+, author =      "M. Casale"
+, title =       "Evaluating geometric sensitivities at singular and non-singular points of variational {CAD} models for design optimization"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "443--460"
+, update =      "97.03 devillers"
 }
 
 @book{c-ign-59
-, author =	"J. Cassels"
-, title =	"An Introduction to the Geometry of Numbers"
-, publisher =	"Springer-Verlag"
-, year =	1959
-, update =	"96.05 pocchiola"
+, author =      "J. Cassels"
+, title =       "An Introduction to the Geometry of Numbers"
+, publisher =   "Springer-Verlag"
+, year =        1959
+, update =      "96.05 pocchiola"
 }
 
 @inproceedings{csm-nocpt-95
-, author =	"T. Cassen and K. R. Subramanian and Z. Michalewicz"
-, title =	"Near-Optimal Construction of Partitioning Trees by Evolutionary Techniques"
-, booktitle =	"Proc. of Graphics Interface '95"
-, year =	1995
-, pages =	"263--271"
-, update =	"97.07 agarwal"
+, author =      "T. Cassen and K. R. Subramanian and Z. Michalewicz"
+, title =       "Near-Optimal Construction of Partitioning Trees by Evolutionary Techniques"
+, booktitle =   "Proc. of Graphics Interface '95"
+, year =        1995
+, pages =       "263--271"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{cu-slepg-96
-, author =	"N. Castaneda and J. Urrutia"
-, title =	"Straight line embeddings of planar graphs on point sets"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"312--318"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "N. Castaneda and J. Urrutia"
+, title =       "Straight line embeddings of planar graphs on point sets"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "312--318"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{chm-npaga-95
-, author =	"M. J. Castro-Diaz and F. Hecht and B. Mohammadi"
-, title =	"New Progress in Anisotropic Grid Adaptation for Inviscid and Viscid Flows Simulations"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"73--86"
-, update =	"96.01 samitchell"
+, author =      "M. J. Castro-Diaz and F. Hecht and B. Mohammadi"
+, title =       "New Progress in Anisotropic Grid Adaptation for Inviscid and Viscid Flows Simulations"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "73--86"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{ccdm-rdbrc-99
-, author =	"Natalia de Castro and Francisco Javier Cobos and Juan Carlos Dana and Alberto M{\'a}rquez"
-, title =	"Rectangular Duals and Box-Representation in the Cylinder"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"145--147"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Natalia de Castro and Francisco Javier Cobos and Juan Carlos Dana and Alberto M{\'a}rquez"
+, title =       "Rectangular Duals and Box-Representation in the Cylinder"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "145--147"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{c-ahcr-95
-, author =	"T. Catarci"
-, title =	"The Assignment Heuristic for Crossing Reduction"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	25
-, number =	3
-, year =	1995
-, pages =	"515--521"
-, succeeds =	"c-ahcrb-88"
-, update =	"98.07 vismara"
+, author =      "T. Catarci"
+, title =       "The Assignment Heuristic for Crossing Reduction"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      25
+, number =      3
+, year =        1995
+, pages =       "515--521"
+, succeeds =    "c-ahcrb-88"
+, update =      "98.07 vismara"
 }
 
 @inproceedings{c-ahcrb-88
-, author =	"T. Catarci"
-, title =	"The Assignment Heuristic for Crossing Reduction in Bipartite Graphs"
-, booktitle =	"Proc. 26th Allerton Conf. Commun. Control Comput."
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "T. Catarci"
+, title =       "The Assignment Heuristic for Crossing Reduction in Bipartite Graphs"
+, booktitle =   "Proc. 26th Allerton Conf. Commun. Control Comput."
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{c-sacdc-74
-, author =	"E. Catmull"
-, title =	"A Subdivision Algorithm for Computer Display of Curved Surfaces"
-, number =	"UTEC-CSC-74-133"
-, institution =	"Dept. Comput. Sci., Univ. Utah"
-, address =	"Salt Lake City"
-, year =	1974
-, update =	"97.11 bibrelex"
+, author =      "E. Catmull"
+, title =       "A Subdivision Algorithm for Computer Display of Curved Surfaces"
+, number =      "UTEC-CSC-74-133"
+, institution = "Dept. Comput. Sci., Univ. Utah"
+, address =     "Salt Lake City"
+, year =        1974
+, update =      "97.11 bibrelex"
 }
 
 @article{cc-rgbss-78
-, author =	"E. Catmull and J. Clark"
-, title =	"Recursively generated {B}-spline surfaces on arbitrary topological meshes"
-, journal =	"Comput. Aided Design"
-, volume =	10
-, year =	1978
-, pages =	"350--365"
+, author =      "E. Catmull and J. Clark"
+, title =       "Recursively generated {B}-spline surfaces on arbitrary topological meshes"
+, journal =     "Comput. Aided Design"
+, volume =      10
+, year =        1978
+, pages =       "350--365"
 }
 
 @article{c-spp-1813
-, author =	"Augustin L. Cauchy"
-, title =	"Sur les polygones et les poly{\`e}dres, seconde m{\'e}moire"
-, journal =	"J. {\'E}cole Polytechnique"
-, volume =	"XVIe Cahier, Tome IX"
-, year =	1813
-, pages =	"113--148"
-, note =	"OEuvres Compl{\`e}tes, IIe S{\`e}rie, Vol. 1, Paris, 1905, 26--38."
-, update =	"01.11 orourke"
+, author =      "Augustin L. Cauchy"
+, title =       "Sur les polygones et les poly{\`e}dres, seconde m{\'e}moire"
+, journal =     "J. {\'E}cole Polytechnique"
+, volume =      "XVIe Cahier, Tome IX"
+, year =        1813
+, pages =       "113--148"
+, note =        "OEuvres Compl{\`e}tes, IIe S{\`e}rie, Vol. 1, Paris, 1905, 26--38."
+, update =      "01.11 orourke"
 }
 
 @inproceedings{ca-hadla-86
-, author =	"H. J. Caulfield and M. A. G. Abushagur"
-, title =	"Hybrid analog-digital linear algebra processors"
-, booktitle =	"Proc. of SPIE"
-, volume =	634
-, year =	1986
-, pages =	"86--95"
-, update =	"98.07 bibrelex"
+, author =      "H. J. Caulfield and M. A. G. Abushagur"
+, title =       "Hybrid analog-digital linear algebra processors"
+, booktitle =   "Proc. of SPIE"
+, volume =      634
+, year =        1986
+, pages =       "86--95"
+, update =      "98.07 bibrelex"
 }
 
 @article{c-atapd-74
-, author =	"J. C. Cavendish"
-, title =	"Automatic triangulation of arbitrary planar domains for the finite element method"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	8
-, year =	1974
-, pages =	"679--696"
+, author =      "J. C. Cavendish"
+, title =       "Automatic triangulation of arbitrary planar domains for the finite element method"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      8
+, year =        1974
+, pages =       "679--696"
 }
 
 @article{cff-aatdf-85
-, author =	"J. C. Cavendish and D. A. Field and W. H. Frey"
-, title =	"An approach to automatic three-dimensional finite element mesh generation"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	21
-, year =	1985
-, pages =	"329--347"
+, author =      "J. C. Cavendish and D. A. Field and W. H. Frey"
+, title =       "An approach to automatic three-dimensional finite element mesh generation"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      21
+, year =        1985
+, pages =       "329--347"
 }
 
 @article{cfm-fbdfe-91
-, author =	"J. C. Cavendish and W. H. Frey and S. P. Marin"
-, title =	"Feature-Based Design And Finite Element Mesh Generation For Functional Surfaces"
-, journal =	"Advances in Engineering Software and Workstations"
-, volume =	13
-, number =	"5--6"
-, month =	sep
-, year =	1991
-, pages =	"226--237"
-, keywords =	"feature based design, finite element mesh generation, functional surfaces, Delaunay surface triangulation, surface modeling systems, downstream mesh generation"
-, annote =	"Watson's alg for tri. Constraint edges are forced by
-		 ensuring that no generated points falls in their
-		 circumcircles."
-, abstract =	"This paper describes an approach to feature-based
-		 design and feature-based mesh generation for
-		 multi-featured functional surfaces. Unlike standard
-		 free-form parametric surface representation where the
-		 parametric surface patch plays the key role in both
-		 surface design and finite element mesh generation, we
-		 propose an approach to these two tasks which proceeds
-		 from the level of a complete feature (for example, a
-		 pocket or channel). The result is a more direct method
-		 for modeling functional surface characteristics and a
-		 more efficient feature-based implementation of Delaunay
-		 surface triangulation. (Author abstract) 10 Refs."
+, author =      "J. C. Cavendish and W. H. Frey and S. P. Marin"
+, title =       "Feature-Based Design And Finite Element Mesh Generation For Functional Surfaces"
+, journal =     "Advances in Engineering Software and Workstations"
+, volume =      13
+, number =      "5--6"
+, month =       sep
+, year =        1991
+, pages =       "226--237"
+, keywords =    "feature based design, finite element mesh generation, functional surfaces, Delaunay surface triangulation, surface modeling systems, downstream mesh generation"
+, annote =      "Watson's alg for tri. Constraint edges are forced by
+                 ensuring that no generated points falls in their
+                 circumcircles."
+, abstract =    "This paper describes an approach to feature-based
+                 design and feature-based mesh generation for
+                 multi-featured functional surfaces. Unlike standard
+                 free-form parametric surface representation where the
+                 parametric surface patch plays the key role in both
+                 surface design and finite element mesh generation, we
+                 propose an approach to these two tasks which proceeds
+                 from the level of a complete feature (for example, a
+                 pocket or channel). The result is a more direct method
+                 for modeling functional surface characteristics and a
+                 more efficient feature-based implementation of Delaunay
+                 surface triangulation. (Author abstract) 10 Refs."
 }
 
 @article{c-te-48
-, author =	"A. Cayley"
-, title =	"On the Theory of Elimination"
-, journal =	"Cambridge and Dublin Math. J."
-, volume =	3
-, year =	1948
-, pages =	"116--120"
-, update =	"97.11 bibrelex"
+, author =      "A. Cayley"
+, title =       "On the Theory of Elimination"
+, journal =     "Cambridge and Dublin Math. J."
+, volume =      3
+, year =        1948
+, pages =       "116--120"
+, update =      "97.11 bibrelex"
 }
 
 @article{c-tggr-95
-, author =	"A. Cayley"
-, title =	"The Theory of Groups Graphical Representation"
-, journal =	"Math. Papers"
-, volume =	10
-, year =	1895
-, pages =	"26--28"
-, update =	"97.11 bibrelex"
+, author =      "A. Cayley"
+, title =       "The Theory of Groups Graphical Representation"
+, journal =     "Math. Papers"
+, volume =      10
+, year =        1895
+, pages =       "26--28"
+, update =      "97.11 bibrelex"
 }
 
 @article{c-cpoda-97
-, author =	"F. Cazals"
-, title =	"Combinatorial properties of one-dimensional arrangements"
-, journal =	"Experimental Math."
-, volume =	6
-, number =	1
-, year =	1997
-, update =	"98.07 bibrelex"
+, author =      "F. Cazals"
+, title =       "Combinatorial properties of one-dimensional arrangements"
+, journal =     "Experimental Math."
+, volume =      6
+, number =      1
+, year =        1997
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{c-ennsh-98
-, author =	"F. Cazals"
-, title =	"Effective nearest neighbors searching on the hyper-cube, with a pplications to molecular clustering"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"222--230"
-, update =	"98.11 devillers"
+, author =      "F. Cazals"
+, title =       "Effective nearest neighbors searching on the hyper-cube, with a pplications to molecular clustering"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "222--230"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{cdp-fchcn-95
-, author =	"F. Cazals and G. Drettakis and C. Puech"
-, title =	"Filtering, clustering and hierarchy construction: a new solution for ray-tracing complex scenes"
-, booktitle =	"EG'95"
-, site =	"Maastricht, Netherlands"
-, year =	1995
-, update =	"98.07 bibrelex"
+, author =      "F. Cazals and G. Drettakis and C. Puech"
+, title =       "Filtering, clustering and hierarchy construction: a new solution for ray-tracing complex scenes"
+, booktitle =   "EG'95"
+, site =        "Maastricht, Netherlands"
+, year =        1995
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{cp-blspd-97
-, author =	"F. Cazals and C. Puech"
-, title =	"Bucket-like space partitioning data structures with applications to ray tracing"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"11--20"
-, cites =	"a-fcagi-94, aeiim-pubtc-85, c-cpoda-97, cdp-fchcn-95, cs-sigte-97, bkos-cge-95, d-lnba-86, d-mddtd-88, glm-othsr-96, jl-rrt-92, ks-frtua-97, bwy-oetac-80, mms-qsrs-94, nhs-gfasm-84, o-cgc-94, ps-cgi-85, s-iggp-76, s-igbmf-93, sd-fbcve-95, sd-csdta-95, w-ltsbv-92, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "F. Cazals and C. Puech"
+, title =       "Bucket-like space partitioning data structures with applications to ray tracing"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "11--20"
+, cites =       "a-fcagi-94, aeiim-pubtc-85, c-cpoda-97, cdp-fchcn-95, cs-sigte-97, bkos-cge-95, d-lnba-86, d-mddtd-88, glm-othsr-96, jl-rrt-92, ks-frtua-97, bwy-oetac-80, mms-qsrs-94, nhs-gfasm-84, o-cgc-94, ps-cgi-85, s-iggp-76, s-igbmf-93, sd-fbcve-95, sd-csdta-95, w-ltsbv-92, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @unpublished{cs-sigte-97
-, author =	"F. Cazals and M. Sbert"
-, title =	"Some integral geometry tools to estimate the complexity of 3d scenes"
-, year =	1997
-, note =	"In preparation"
-, update =	"98.07 bibrelex"
+, author =      "F. Cazals and M. Sbert"
+, title =       "Some integral geometry tools to estimate the complexity of 3d scenes"
+, year =        1997
+, note =        "In preparation"
+, update =      "98.07 bibrelex"
 }
 
 @article{cd-fsgr-00
-, author =	"D. Cazier and J.-F. Dufourd"
-, title =	"A formal specification of geometric refinements"
-, journal =	"Visual Comput."
-, volume =	""
-, year =	2000
-, pages =	""
-, update =	"00.03 devillers"
+, author =      "D. Cazier and J.-F. Dufourd"
+, title =       "A formal specification of geometric refinements"
+, journal =     "Visual Comput."
+, volume =      ""
+, year =        2000
+, pages =       ""
+, update =      "00.03 devillers"
 }
 
 @inproceedings{cd-rsbps-95
-, author =	"David Cazier and Jean-Fran{\c c}ois Dufourd"
-, title =	"A Rewrite System to Build Planar Subdivisions"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"235--240"
-, update =	"00.03 bibrelex, 95.09 jones"
+, author =      "David Cazier and Jean-Fran{\c c}ois Dufourd"
+, title =       "A Rewrite System to Build Planar Subdivisions"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "235--240"
+, update =      "00.03 bibrelex, 95.09 jones"
 }
 
 @article{cgaf-gstlm-94
-, author =	"G. Ceder and G. Garbulsky and D. Avis and K. Fukuda"
-, title =	"Ground states of a ternany lattice model with nearest and next-nearest neighbor interactions"
-, journal =	"Physical Review B"
-, volume =	49
-, year =	1994
-, pages =	"1--7"
-, update =	"98.03 bibrelex"
+, author =      "G. Ceder and G. Garbulsky and D. Avis and K. Fukuda"
+, title =       "Ground states of a ternany lattice model with nearest and next-nearest neighbor interactions"
+, journal =     "Physical Review B"
+, volume =      49
+, year =        1994
+, pages =       "1--7"
+, update =      "98.03 bibrelex"
 }
 
 @article{css-mfcud-83
-, author =	"Z. J. Cendes and D. N. Shenton and H. Shahnasser"
-, title =	"Magnetic Field Computation using {Delaunay} Triangulation and Complementary Finite Element Methods"
-, journal =	"IEEE Trans. Magn."
-, volume =	"MAG-19"
-, number =	6
-, year =	1983
-, annote =	"Uses incremental switching algorithm. Triangles are
-		 refined by adding point at the centroid."
+, author =      "Z. J. Cendes and D. N. Shenton and H. Shahnasser"
+, title =       "Magnetic Field Computation using {Delaunay} Triangulation and Complementary Finite Element Methods"
+, journal =     "IEEE Trans. Magn."
+, volume =      "MAG-19"
+, number =      6
+, year =        1983
+, annote =      "Uses incremental switching algorithm. Triangles are
+                 refined by adding point at the centroid."
 }
 
 @techreport{b-dgs-70
-, author =	"Bureau of the Census"
-, title =	"The DIME Geocoding System"
-, type =	"Report"
-, number =	4
-, institution =	"U.S. Department of Commerce, Bureau of the Census"
-, address =	"Washington"
-, year =	1970
-, note =	"Census use Study"
-, update =	"98.11 bibrelex"
+, author =      "Bureau of the Census"
+, title =       "The DIME Geocoding System"
+, type =        "Report"
+, number =      4
+, institution = "U.S. Department of Commerce, Bureau of the Census"
+, address =     "Washington"
+, year =        1970
+, note =        "Census use Study"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ca-prfr-88
-, author =	"R. Chadha and D. Allison"
-, title =	"Partitioning rectilinear figures into rectangles"
-, booktitle =	"Proc. ACM Annu. Computer Sci. Conf."
-, year =	1988
-, pages =	"102--106"
-, keywords =	"partition, isothetic"
-, update =	"95.09 korneenko"
+, author =      "R. Chadha and D. Allison"
+, title =       "Partitioning rectilinear figures into rectangles"
+, booktitle =   "Proc. ACM Annu. Computer Sci. Conf."
+, year =        1988
+, pages =       "102--106"
+, keywords =    "partition, isothetic"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{ces-hmpmd-96
-, author =	"T. Chadzelek and J. Eckstein and E. Sch{\"o}mer"
-, title =	"Heuristic motion planning with many degrees of freedom"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"167--172"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "T. Chadzelek and J. Eckstein and E. Sch{\"o}mer"
+, title =       "Heuristic motion planning with many degrees of freedom"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "167--172"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{ces-hmpmo-96
-, author =	"T. Chadzelek and J. Eckstein and E. Sch{\"o}mer"
-, title =	"Heuristic motion planning with movable obstacles"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"131--136"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "T. Chadzelek and J. Eckstein and E. Sch{\"o}mer"
+, title =       "Heuristic motion planning with movable obstacles"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "131--136"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @mastersthesis{c-hbvf-95
-, author =	"Th. Chadzelek"
-, title =	"Heuristische {Bewegungsplanung} mit vielen {Freiheitsgraden}"
-, type =	"M.{Sc}. Thesis"
-, school =	"Dept. Comput. Sci., University Saarland"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1995
-, url =	"http://hamster.cs.uni-sb.de/~chadzele/publications/Diplom-Chadzelek.ps.Z"
-, keywords =	"master thesis, motion planning, collision detection, heuristic, quaternion"
-, update =	"95.09 chadzelek"
+, author =      "Th. Chadzelek"
+, title =       "Heuristische {Bewegungsplanung} mit vielen {Freiheitsgraden}"
+, type =        "M.{Sc}. Thesis"
+, school =      "Dept. Comput. Sci., University Saarland"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1995
+, url = "http://hamster.cs.uni-sb.de/~chadzele/publications/Diplom-Chadzelek.ps.Z"
+, keywords =    "master thesis, motion planning, collision detection, heuristic, quaternion"
+, update =      "95.09 chadzelek"
 }
 
 @techreport{c-hmpmd-95
-, author =	"Th. Chadzelek and G. Hotz and E. Sch{\"o}mer"
-, title =	"Heuristic Motion Planning with Many Degrees of Freedom"
-, type =	"Report"
-, number =	"95-08"
-, institution =	"Dept. Comput. Sci., University Saarland"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1995
-, url =	"http://hamster.cs.uni-sb.de/~chadzele/publications/TechReport.ps.gz"
-, keywords =	"motion planning, collision detection, heuristic, quaternion"
-, update =	"95.09 chadzelek"
+, author =      "Th. Chadzelek and G. Hotz and E. Sch{\"o}mer"
+, title =       "Heuristic Motion Planning with Many Degrees of Freedom"
+, type =        "Report"
+, number =      "95-08"
+, institution = "Dept. Comput. Sci., University Saarland"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1995
+, url = "http://hamster.cs.uni-sb.de/~chadzele/publications/TechReport.ps.gz"
+, keywords =    "motion planning, collision detection, heuristic, quaternion"
+, update =      "95.09 chadzelek"
 }
 
 @inproceedings{ck-tmaub-95
-, author =	"Soo-Won Chae and Jong-Soo Kim"
-, title =	"Tetrahedral Meshing Algorithm Using Basic Operators"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"305--319"
-, update =	"96.01 samitchell"
+, author =      "Soo-Won Chae and Jong-Soo Kim"
+, title =       "Tetrahedral Meshing Algorithm Using Basic Operators"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "305--319"
+, update =      "96.01 samitchell"
 }
 
 @article{ckss-crr-81
-, author =	"S. Chaiken and D. J. Kleitman and M. Saks and I. Shearer"
-, title =	"Covering regions by rectangles"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	2
-, number =	4
-, year =	1981
-, pages =	"394--410"
-, keywords =	"isothetic, covering"
-, update =	"95.09 korneenko"
+, author =      "S. Chaiken and D. J. Kleitman and M. Saks and I. Shearer"
+, title =       "Covering regions by rectangles"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      2
+, number =      4
+, year =        1981
+, pages =       "394--410"
+, keywords =    "isothetic, covering"
+, update =      "95.09 korneenko"
 }
 
 @article{cl-csptp-91
-, author =	"Don Chakerian and Dave Logothetti"
-, title =	"Cube Slices, Pictorial Triangles, and Probability"
-, journal =	"Math. Mag."
-, volume =	64
-, year =	1991
-, pages =	"219--241"
-, update =	"94.05 aich"
+, author =      "Don Chakerian and Dave Logothetti"
+, title =       "Cube Slices, Pictorial Triangles, and Probability"
+, journal =     "Math. Mag."
+, volume =      64
+, year =        1991
+, pages =       "219--241"
+, update =      "94.05 aich"
 }
 
 @article{cf-mpc-86
-, author =	"G. D. Chakerian and P. Filliman"
-, title =	"The Measures of the Projections of a Cube"
-, journal =	"Studia Scientiarum Mathematicum Hungarica"
-, volume =	21
-, year =	1986
-, pages =	"103--110"
-, update =	"94.05 aich"
+, author =      "G. D. Chakerian and P. Filliman"
+, title =       "The Measures of the Projections of a Cube"
+, journal =     "Studia Scientiarum Mathematicum Hungarica"
+, volume =      21
+, year =        1986
+, pages =       "103--110"
+, update =      "94.05 aich"
 }
 
 @article{cg-fpms-85
-, author =	"G. D. Chakerian and M. A. Ghandehari"
-, title =	"The {Fermat} problem in {Minkowski} space"
-, journal =	"Geom. Dedicata"
-, volume =	17
-, year =	1985
-, pages =	"227--238"
-, update =	"98.03 bibrelex"
+, author =      "G. D. Chakerian and M. A. Ghandehari"
+, title =       "The {Fermat} problem in {Minkowski} space"
+, journal =     "Geom. Dedicata"
+, volume =      17
+, year =        1985
+, pages =       "227--238"
+, update =      "98.03 bibrelex"
 }
 
 @article{cl-gep-71
-, author =	"G. D. Chakerian and L. H. Lange"
-, title =	"Geometric extremum problems"
-, journal =	"Math. Mag."
-, volume =	44
-, year =	1971
-, pages =	"57--69"
+, author =      "G. D. Chakerian and L. H. Lange"
+, title =       "Geometric extremum problems"
+, journal =     "Math. Mag."
+, volume =      44
+, year =        1971
+, pages =       "57--69"
 }
 
 @inproceedings{cf-cvbtd-82
-, author =	"I. Chakravarty and H. Freeman"
-, title =	"Characteristic views as a basis for three-demensional object recognition"
-, booktitle =	"Proc. SPIE: Robot Vision"
-, volume =	336
-, year =	1982
-, pages =	"37--45"
-, update =	"98.11 bibrelex"
+, author =      "I. Chakravarty and H. Freeman"
+, title =       "Characteristic views as a basis for three-demensional object recognition"
+, booktitle =   "Proc. SPIE: Robot Vision"
+, volume =      336
+, year =        1982
+, pages =       "37--45"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{cr-gaha-87
-, author =	"S. B. Chalasani and C. S. Raghavendra"
-, title =	"Geometric algorithms on a mesh architecture"
-, booktitle =	"Computer Architecture in Pattern Analysis and Machine Intelligence"
-, site =	"Seattle"
-, publisher =	"IEEE Computer Society"
-, month =	oct
-, year =	1987
-, pages =	"169--175"
-, keywords =	"parallel computation"
-, update =	"97.11 bibrelex, 95.09 korneenko"
+, author =      "S. B. Chalasani and C. S. Raghavendra"
+, title =       "Geometric algorithms on a mesh architecture"
+, booktitle =   "Computer Architecture in Pattern Analysis and Machine Intelligence"
+, site =        "Seattle"
+, publisher =   "IEEE Computer Society"
+, month =       oct
+, year =        1987
+, pages =       "169--175"
+, keywords =    "parallel computation"
+, update =      "97.11 bibrelex, 95.09 korneenko"
 }
 
 @article{cfk-fesrd-81
-, author =	"L. C. Chalmet and R. L. Francis and A. Kolen"
-, title =	"Finding efficient solutions for rectilinear distance location problems efficiently"
-, journal =	"European J. Oper. Res."
-, volume =	6
-, year =	1981
-, pages =	"117--124"
-, keywords =	"facility location, $L_1$-metric"
-, update =	"95.09 korneenko"
+, author =      "L. C. Chalmet and R. L. Francis and A. Kolen"
+, title =       "Finding efficient solutions for rectilinear distance location problems efficiently"
+, journal =     "European J. Oper. Res."
+, volume =      6
+, year =        1981
+, pages =       "117--124"
+, keywords =    "facility location, $L_1$-metric"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{cdlss-frceu-96
-, author =	"Bradford Chamberlain and Tony DeRose and Dana Lischinski and David Salesin and John Snyder"
-, title =	"Fast Rendering of Complex Environments Using a Spatial Hierarchy"
-, booktitle =	"Proceedings of Graphics Interface '96"
-, year =	1996
-, pages =	""
-, update =	"98.03 agarwal"
+, author =      "Bradford Chamberlain and Tony DeRose and Dana Lischinski and David Salesin and John Snyder"
+, title =       "Fast Rendering of Complex Environments Using a Spatial Hierarchy"
+, booktitle =   "Proceedings of Graphics Interface '96"
+, year =        1996
+, pages =       ""
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{cf-pasdp-91
-, author =	"I. W. Chan and D. K. Friesen"
-, title =	"Parallel algorithms for some dominance problems based on a {CREW} {PRAM}"
-, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"375--384"
-, precedes =	"cf-pasdp-93"
-, update =	"96.09 devillers"
+, author =      "I. W. Chan and D. K. Friesen"
+, title =       "Parallel algorithms for some dominance problems based on a {CREW} {PRAM}"
+, booktitle =   "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "375--384"
+, precedes =    "cf-pasdp-93"
+, update =      "96.09 devillers"
 }
 
 @article{cf-pasdp-93
-, author =	"I. W. Chan and D. K. Friesen"
-, title =	"Parallel algorithms for some dominance problems based on the {PRAM} model"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"367--382"
-, keywords =	"parallel algorithms, computational geometry, isothetic rectangles, direct dominance"
-, succeeds =	"cf-pasdp-91"
-, update =	"96.09 devillers"
+, author =      "I. W. Chan and D. K. Friesen"
+, title =       "Parallel algorithms for some dominance problems based on the {PRAM} model"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "367--382"
+, keywords =    "parallel algorithms, computational geometry, isothetic rectangles, direct dominance"
+, succeeds =    "cf-pasdp-91"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{cl-flwsf-90
-, author =	"K. Chan and T. Lam"
-, title =	"Finding least-weight subsequences with fewer processors"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"318--327"
-, update =	"98.03 bibrelex"
+, author =      "K. Chan and T. Lam"
+, title =       "Finding least-weight subsequences with fewer processors"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "318--327"
+, update =      "98.03 bibrelex"
 }
 
 @article{ct-hswes-88
-, author =	"K. C. Chan and S. T. Tan"
-, title =	"Hierarchical structure of winged-edge structure: $A$ conversion algorithm"
-, journal =	"Visual Comput."
-, volume =	4
-, year =	1988
-, pages =	"133--141"
-, keywords =	"data structuring"
-, update =	"95.09 korneenko"
+, author =      "K. C. Chan and S. T. Tan"
+, title =       "Hierarchical structure of winged-edge structure: $A$ conversion algorithm"
+, journal =     "Visual Comput."
+, volume =      4
+, year =        1988
+, pages =       "133--141"
+, keywords =    "data structuring"
+, update =      "95.09 korneenko"
 }
 
 @article{cl-olanu-93
-, author =	"K. F. Chan and T. W. Lam"
-, title =	"An on-line algorithm for navigating in unknown environment"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"227--244"
-, keywords =	"on-line algorithms, motion-planning, competitiveness, shortest paths, computational geometry"
-, succeeds =	"cl-olanu-91"
-, update =	"98.03 mitchell, 96.09 devillers"
-, annote =	"They consider on-line navigation among a disjoint set of
+, author =      "K. F. Chan and T. W. Lam"
+, title =       "An on-line algorithm for navigating in unknown environment"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "227--244"
+, keywords =    "on-line algorithms, motion-planning, competitiveness, shortest paths, computational geometry"
+, succeeds =    "cl-olanu-91"
+, update =      "98.03 mitchell, 96.09 devillers"
+, annote =      "They consider on-line navigation among a disjoint set of
                   non-aligned rectangular obstacles, having aspect
                   ratio at most $r$.  They give a strategy that has
                   competitive ratio $({r\over 2}+1)$, and show that
@@ -30855,2725 +30855,2725 @@ @article{cl-olanu-93
 }
 
 @inproceedings{cl-olanu-91
-, author =	"K. F. Chan and T. W. Lam"
-, title =	"An on-line algorithm for navigating in unknown terrain"
-, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"127--136"
-, precedes =	"cl-olanu-93"
-, update =	"96.09 devillers"
+, author =      "K. F. Chan and T. W. Lam"
+, title =       "An on-line algorithm for navigating in unknown terrain"
+, booktitle =   "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "127--136"
+, precedes =    "cl-olanu-93"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{cc-ompa-97
-, author =	"K. W. Chan and Francis Y. L. Chin"
-, title =	"Optimal Multiresolution Polygonal Approximation"
-, booktitle =	"Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
-, nickname =	"COCOON '97"
-, site =	"Shanghai, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1276
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"32--41"
-, update =	"99.11 bibrelex, 98.03 mitchell"
+, author =      "K. W. Chan and Francis Y. L. Chin"
+, title =       "Optimal Multiresolution Polygonal Approximation"
+, booktitle =   "Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
+, nickname =    "COCOON '97"
+, site =        "Shanghai, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1276
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "32--41"
+, update =      "99.11 bibrelex, 98.03 mitchell"
 }
 
 @article{c-nrdma-85
-, author =	"M. Y. Chan"
-, title =	"A note on redundant disk modulo allocation"
-, journal =	"Inform. Process. Lett."
-, volume =	20
-, year =	1985
-, pages =	"121--123"
+, author =      "M. Y. Chan"
+, title =       "A note on redundant disk modulo allocation"
+, journal =     "Inform. Process. Lett."
+, volume =      20
+, year =        1985
+, pages =       "121--123"
 }
 
 @inproceedings{c-stsar-94
-, author =	"T. M. Chan"
-, title =	"A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"263--268"
-, cites =	"a-fcagi-94, bo-arcgi-79, ce-oails-92, m--83, m-rlsi-81, ps-crrbs-93, e-ftssg-85, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "T. M. Chan"
+, title =       "A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "263--268"
+, cites =       "a-fcagi-94, bo-arcgi-79, ce-oails-92, m--83, m-rlsi-81, ps-crrbs-93, e-ftssg-85, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{c-annqr-97
-, author =	"Timothy M. Chan"
-, title =	"Approximate Nearest Neighbor Queries Revisited"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"352--358"
-, cites =	"aesw-emstb-91, am-rsps-93, am-annqf-93, am-ars-95, amnsw-oaann-94, amn-abenn-96, b-acpqh-93, ck-fasgg-93, c-oaitd-92, c-aacpq-94, ks-ntead-96, ms-rscp-93, ps-cgi-85, s-cmsga-91, v-sgagc-91, y-cmstk-82, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "Timothy M. Chan"
+, title =       "Approximate Nearest Neighbor Queries Revisited"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "352--358"
+, cites =       "aesw-emstb-91, am-rsps-93, am-annqf-93, am-ars-95, amnsw-oaann-94, amn-abenn-96, b-acpqh-93, ck-fasgg-93, c-oaitd-92, c-aacpq-94, ks-ntead-96, ms-rscp-93, ps-cgi-85, s-cmsga-91, v-sgagc-91, y-cmstk-82, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{c-adwse-00
-, author =	"Timothy M. Chan"
-, title =	"Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"300--309"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Timothy M. Chan"
+, title =       "Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "300--309"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{c-dpcho-99
-, author =	"Timothy M. Chan"
-, title =	"Dynamic planar convex hull operations in near-logarithmic amortized time"
-, booktitle =	"Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '99"
-, year =	1999
-, pages =	"92--99"
-, update =	"00.03 smid"
+, author =      "Timothy M. Chan"
+, title =       "Dynamic planar convex hull operations in near-logarithmic amortized time"
+, booktitle =   "Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '99"
+, year =        1999
+, pages =       "92--99"
+, update =      "00.03 smid"
 }
 
 @article{c-dpcho-01
-, author =	"T. M. Chan"
-, title =	"Dynamic planar convex hull operations in near-logarithmic amortized time"
-, journal =	"J. ACM"
-, volume =	48
-, year =	2001
-, pages =	"1--12"
-, update =	"01.07 smid"
+, author =      "T. M. Chan"
+, title =       "Dynamic planar convex hull operations in near-logarithmic amortized time"
+, journal =     "J. ACM"
+, volume =      48
+, year =        2001
+, pages =       "1--12"
+, update =      "01.07 smid"
 }
 
 @inproceedings{c-fdlpq-96
-, author =	"Timothy M. Chan"
-, title =	"Fixed-Dimensional Linear Programming Queries Made Easy"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"284--290"
-, cites =	"aes-vdsl3-95, am-rsps-93, am-dhsrr-95, as-erasg-95, ako-iqco-93, bcm-prsss-93, cg-fc2a-86, c-osrch-95, c-lvali-95, cm-ltdao-93, dk-dsppu-90, dmn-rass-91, esz-cskec-94, hw-ensrq-87, m-roass-91, m-ept-92, m-rph-92, m-loq-93, m-rsehc-93, m-grs-94, m-ekpc-95, m-gofvc-95, m-apcad-83, m-lpltw-84, ms-rscp-93, m-cgitr-93, p-slpab-90, s-sdlpc-91, st-ecdmp-95, sw-cblpr-92, t-mnlcf-92, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Timothy M. Chan"
+, title =       "Fixed-Dimensional Linear Programming Queries Made Easy"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "284--290"
+, cites =       "aes-vdsl3-95, am-rsps-93, am-dhsrr-95, as-erasg-95, ako-iqco-93, bcm-prsss-93, cg-fc2a-86, c-osrch-95, c-lvali-95, cm-ltdao-93, dk-dsppu-90, dmn-rass-91, esz-cskec-94, hw-ensrq-87, m-roass-91, m-ept-92, m-rph-92, m-loq-93, m-rsehc-93, m-grs-94, m-ekpc-95, m-gofvc-95, m-apcad-83, m-lpltw-84, ms-rscp-93, m-cgitr-93, p-slpab-90, s-sdlpc-91, st-ecdmp-95, sw-cblpr-92, t-mnlcf-92, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{c-garot-98
-, author =	"T. M. Chan"
-, title =	"Geometric Applications of a Randomized Optimization Technique"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"269--278"
-, update =	"98.07 agarwal"
+, author =      "T. M. Chan"
+, title =       "Geometric Applications of a Randomized Optimization Technique"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "269--278"
+, update =      "98.07 agarwal"
 }
 
 @article{c-garot-99
-, author =	"T. M. Chan"
-, title =	"Geometric Applications of a Randomized Optimization Technique"
-, journal =	"Discrete Comput. Geom."
-, volume =	22
-, number =	4
-, year =	1999
-, pages =	"547--567"
-, update =	"99.11 held"
+, author =      "T. M. Chan"
+, title =       "Geometric Applications of a Randomized Optimization Technique"
+, journal =     "Discrete Comput. Geom."
+, volume =      22
+, number =      4
+, year =        1999
+, pages =       "547--567"
+, update =      "99.11 held"
 }
 
 @article{c-mptca-99
-, author =	"T. M. Chan"
-, title =	"More planar two-center algorithms"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, year =	1999
-, pages =	"189--198"
-, update =	"99.11 smid"
+, author =      "T. M. Chan"
+, title =       "More planar two-center algorithms"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, year =        1999
+, pages =       "189--198"
+, update =      "99.11 smid"
 }
 
 @inproceedings{c-oesd-98
-, author =	"T. M. Chan"
-, title =	"On enumerating and selecting distances"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"279--286"
-, update =	"00.03 smid"
+, author =      "T. M. Chan"
+, title =       "On enumerating and selecting distances"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "279--286"
+, update =      "00.03 smid"
 }
 
 @article{c-oesd-01
-, author =	"T. M. Chan"
-, title =	"On enumerating and selecting distances"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"291--304"
-, update =	"01.07 smid"
+, author =      "T. M. Chan"
+, title =       "On enumerating and selecting distances"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "291--304"
+, update =      "01.07 smid"
 }
 
 @inproceedings{c-lac-00
-, author =	"Timothy M. Chan"
-, title =	"On Levels in Arrangements of Curves"
-, booktitle =	"Proc. 41th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS 2000"
-, year =	2000
-, pages =	"219--227"
-, update =	"01.11 pocchiola"
+, author =      "Timothy M. Chan"
+, title =       "On Levels in Arrangements of Curves"
+, booktitle =   "Proc. 41th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS 2000"
+, year =        2000
+, pages =       "219--227"
+, update =      "01.11 pocchiola"
 }
 
 @article{c-oosch-96
-, author =	"Timothy M. Chan"
-, title =	"Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, year =	1996
-, pages =	"361--368"
-, update =	"98.03 agarwal+smid"
+, author =      "Timothy M. Chan"
+, title =       "Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, year =        1996
+, pages =       "361--368"
+, update =      "98.03 agarwal+smid"
 }
 
 % also claimed, pages = "369--388"
 @article{c-osrch-96
-, author =	"Timothy M. Chan"
-, title =	"Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, year =	1996
-, pages =	"369--387"
-, update =	"98.03 agarwal+smid"
+, author =      "Timothy M. Chan"
+, title =       "Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, year =        1996
+, pages =       "369--387"
+, update =      "98.03 agarwal+smid"
 }
 
 @inproceedings{c-rshrr-98
-, author =	"T. M. Chan"
-, title =	"Random Sampling, Halfspace Range Reporting, and Construction of $(\le k)$-Levels in Three Dimensions"
-, booktitle =	"Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1998
-, pages =	"586--595"
-, update =	"99.03 agarwal"
+, author =      "T. M. Chan"
+, title =       "Random Sampling, Halfspace Range Reporting, and Construction of $(\le k)$-Levels in Three Dimensions"
+, booktitle =   "Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1998
+, pages =       "586--595"
+, update =      "99.03 agarwal"
 }
 
 @article{c-rshrr-00
-, author =	"T. M. Chan"
-, title =	"Random sampling, halfspace range reporting, and construction of $(\le k)$-levels in three dimensions"
-, journal =	"SIAM J. Comput."
-, volume =	30
-, year =	2000
-, pages =	"561--575"
-, update =	"01.07 smid"
+, author =      "T. M. Chan"
+, title =       "Random sampling, halfspace range reporting, and construction of $(\le k)$-levels in three dimensions"
+, journal =     "SIAM J. Comput."
+, volume =      30
+, year =        2000
+, pages =       "561--575"
+, update =      "01.07 smid"
 }
 
 @article{c-rcsiu-00
-, author =	"T. M. Chan"
-, title =	"Reporting curve segment intersections using restricted predicates"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	16
-, number =	4
-, year =	2000
-, pages =	"245--256"
-, update =	"01.07 devillers, 01.04 smid"
+, author =      "T. M. Chan"
+, title =       "Reporting curve segment intersections using restricted predicates"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      16
+, number =      4
+, year =        2000
+, pages =       "245--256"
+, update =      "01.07 devillers, 01.04 smid"
 }
 
 @inproceedings{cgkt-oaars-97
-, author =	"T. M. Chan and M. T. Goodrich and S. R. Kosaraju and R. Tamassia"
-, title =	"Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings"
-, editor =	"S. North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"63--75"
-, url =	"https://www.cs.brown.edu/cgc/papers/cgkt-oaars-97.ps.gz"
-, keywords =	"graph drawing, upward, tree, planar, straight-line, orthogonal, CGC, Brown"
-, update =	"98.07 agarwal, 98.03 smid, 97.11 bibrelex, 97.03 tamassia"
+, author =      "T. M. Chan and M. T. Goodrich and S. R. Kosaraju and R. Tamassia"
+, title =       "Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings"
+, editor =      "S. North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "63--75"
+, url = "https://www.cs.brown.edu/cgc/papers/cgkt-oaars-97.ps.gz"
+, keywords =    "graph drawing, upward, tree, planar, straight-line, orthogonal, CGC, Brown"
+, update =      "98.07 agarwal, 98.03 smid, 97.11 bibrelex, 97.03 tamassia"
 }
 
 @inproceedings{csy-oscpf-95
-, author =	"Timothy M. Chan and Jack Snoeyink and Chee-Keng Yap"
-, title =	"Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped {Voronoi} Diagrams in Three"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"282--291"
-, keywords =	"convex hulls, Voronoi diagram, ultimate convex hull algorithm"
-, update =	"96.09 agarwal, 96.05 mitchell"
+, author =      "Timothy M. Chan and Jack Snoeyink and Chee-Keng Yap"
+, title =       "Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped {Voronoi} Diagrams in Three"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "282--291"
+, keywords =    "convex hulls, Voronoi diagram, ultimate convex hull algorithm"
+, update =      "96.09 agarwal, 96.05 mitchell"
 }
 
 @article{csy-pddpo-97
-, author =	"T. M. Chan and J. Snoeyink and C. K. Yap"
-, title =	"Primal dividing and dual pruning: Output-sensitive construction of $4$-d polytopes and $3$-d {Voronoi} diagrams"
-, journal =	"Discrete Comput. Geom."
-, volume =	18
-, year =	1997
-, pages =	"433--454"
-, update =	"98.03 agarwal"
+, author =      "T. M. Chan and J. Snoeyink and C. K. Yap"
+, title =       "Primal dividing and dual pruning: Output-sensitive construction of $4$-d polytopes and $3$-d {Voronoi} diagrams"
+, journal =     "Discrete Comput. Geom."
+, volume =      18
+, year =        1997
+, pages =       "433--454"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{c-osrch-95
-, author =	"Timothy M. Y. Chan"
-, title =	"Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"10--19"
-, cites =	"am-rsps-92, bkst-anmsv-78, bs-dsp1s-80, csy-oscpf-95, c-clps-85, c-chdc-93, ck-acp-70, cm-dosch-92, c-mosga-94, cs-arscg-89, dk-fdpi-83, e-acg-87, es-otatd-91, em-sstcd-90, ew-cbtda-86, ec-eargd-92, g-eadch-72, j-ichfs-73, ks-upcha-86, m-loq-93, m-gofvc-94, ms-rscp-93, m-mnfcp-70, m-lpltw-84, m-osclv-90, m-cgitr-93, o-cgc-94, ol-mcp-81, ph-chfsp-77, ps-cgi-85, r-slcdn-70, r-dcikc-88a, s-chaop-81, s-chdch-86, sw-cblpr-92, s-fchff-85, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex, 97.11 bibrelex"
+, author =      "Timothy M. Y. Chan"
+, title =       "Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "10--19"
+, cites =       "am-rsps-92, bkst-anmsv-78, bs-dsp1s-80, csy-oscpf-95, c-clps-85, c-chdc-93, ck-acp-70, cm-dosch-92, c-mosga-94, cs-arscg-89, dk-fdpi-83, e-acg-87, es-otatd-91, em-sstcd-90, ew-cbtda-86, ec-eargd-92, g-eadch-72, j-ichfs-73, ks-upcha-86, m-loq-93, m-gofvc-94, ms-rscp-93, m-mnfcp-70, m-lpltw-84, m-osclv-90, m-cgitr-93, o-cgc-94, ol-mcp-81, ph-chfsp-77, ps-cgi-85, r-slcdn-70, r-dcikc-88a, s-chaop-81, s-chdch-86, sw-cblpr-92, s-fchff-85, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex, 97.11 bibrelex"
 }
 
 % ### What is it?
 @misc{c-lrfsf-??
-, author =	"W. K. Chan"
-, title =	"On the largest {RAT}-free subset of a finite set of points"
-, year =	"??"
-, pages =	"357--367"
-, keywords =	"triangle, points, extremal figures"
-, update =	"95.09 korneenko"
-, annote =	"RAT is right-angle triangle"
+, author =      "W. K. Chan"
+, title =       "On the largest {RAT}-free subset of a finite set of points"
+, year =        "??"
+, pages =       "357--367"
+, keywords =    "triangle, points, extremal figures"
+, update =      "95.09 korneenko"
+, annote =      "RAT is right-angle triangle"
 }
 
 @inproceedings{cc-apcmn-92
-, author =	"W. S. Chan and F. Chin"
-, title =	"Approximation of Polygonal Curves with Minimum Number of Line Segments"
-, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '92"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	650
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"378--387"
-, precedes =	"cc-apcmn-96"
-, update =	"96.09 devillers, 94.09 smid, 93.09 milone+mitchell"
+, author =      "W. S. Chan and F. Chin"
+, title =       "Approximation of Polygonal Curves with Minimum Number of Line Segments"
+, booktitle =   "Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '92"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      650
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "378--387"
+, precedes =    "cc-apcmn-96"
+, update =      "96.09 devillers, 94.09 smid, 93.09 milone+mitchell"
 }
 
 @article{cc-apcmn-96
-, author =	"W. S. Chan and F. Chin"
-, title =	"Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"59--77"
-, succeeds =	"cc-apcmn-92"
-, update =	"96.09 devillers"
+, author =      "W. S. Chan and F. Chin"
+, title =       "Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "59--77"
+, succeeds =    "cc-apcmn-92"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{cc-afodp-97
-, author =	"Wun-Tat Chan and Francis Y. L. Chin"
-, title =	"Algorithms for Finding Optimal Disjoint Paths Around a Rectangle"
-, booktitle =	"Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '97"
-, site =	"Singapore"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1350
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"314--323"
-, update =	"99.11 bibrelex, 99.03 bibrelex, 98.07 mitchell, 98.03 mitchell"
+, author =      "Wun-Tat Chan and Francis Y. L. Chin"
+, title =       "Algorithms for Finding Optimal Disjoint Paths Around a Rectangle"
+, booktitle =   "Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '97"
+, site =        "Singapore"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1350
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "314--323"
+, update =      "99.11 bibrelex, 99.03 bibrelex, 98.07 mitchell, 98.03 mitchell"
 }
 
 @inproceedings{cc-eafdp-97
-, author =	"W.-T. Chan and F. Y. L. Chin"
-, title =	"Efficient algorithms for finding disjoint paths in grids"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Alogrithms"
-, year =	1997
-, pages =	"454--463"
-, update =	"98.07 bibrelex"
+, author =      "W.-T. Chan and F. Y. L. Chin"
+, title =       "Efficient algorithms for finding disjoint paths in grids"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Alogrithms"
+, year =        1997
+, pages =       "454--463"
+, update =      "98.07 bibrelex"
 }
 
 @article{ck-acp-70
-, author =	"D. R. Chand and S. S. Kapur"
-, title =	"An algorithm for convex polytopes"
-, journal =	"J. ACM"
-, volume =	17
-, number =	1
-, month =	jan
-, year =	1970
-, pages =	"78--86"
-, update =	"98.11 bibrelex"
+, author =      "D. R. Chand and S. S. Kapur"
+, title =       "An algorithm for convex polytopes"
+, journal =     "J. ACM"
+, volume =      17
+, number =      1
+, month =       jan
+, year =        1970
+, pages =       "78--86"
+, update =      "98.11 bibrelex"
 }
 
 @article{chw-bpgcc-78
-, author =	"A. K. Chandra and D. S. Hirschberg and C. K. Wong"
-, title =	"Bin packing with geometric constraints in computer network design"
-, journal =	"Oper. Res."
-, volume =	26
-, number =	5
-, year =	1978
-, pages =	"760--772"
-, keywords =	"packing"
-, update =	"95.09 korneenko"
+, author =      "A. K. Chandra and D. S. Hirschberg and C. K. Wong"
+, title =       "Bin packing with geometric constraints in computer network design"
+, journal =     "Oper. Res."
+, volume =      26
+, number =      5
+, year =        1978
+, pages =       "760--772"
+, keywords =    "packing"
+, update =      "95.09 korneenko"
 }
 
 @article{c-cssmg-94
-, author =	"B. Chandra"
-, title =	"Constructing sparse spanners for most graphs in higher dimensions"
-, journal =	"Inform. Process. Lett."
-, volume =	51
-, year =	1994
-, pages =	"289--294"
-, update =	"95.01 smid"
+, author =      "B. Chandra"
+, title =       "Constructing sparse spanners for most graphs in higher dimensions"
+, journal =     "Inform. Process. Lett."
+, volume =      51
+, year =        1994
+, pages =       "289--294"
+, update =      "95.01 smid"
 }
 
 @inproceedings{cdns-nsrgs-92
-, author =	"B. Chandra and G. Das and G. Narasimhan and J. Soares"
-, title =	"New sparseness results on graph spanners"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"192--201"
-, precedes =	"cdns-nsrgs-95"
-, cites =	"addjs-sswg-93, a-cns-85, ap-sp-90, bd-rstod-86, bclr-ostm-86, b-egt-78, c-tipga-86, d-ascg-90, dj-wtacg-89, d-ntpcg-59, dfs-dgaag-90, k-aceg-88, kg-cgwac-92, ll-tapga-89, ps-gs-89, pu-osh-89, pu-tbser-88, r-cpscn-55, r-css-63, rs-addce-91, s-cmsga-91, s-aedsd-92, s-s-91, v-sgagc-91, v-mstkd-88, ZZZ"
-, update =	"97.11 bibrelex, 96.09 devillers, 94.05 smid"
+, author =      "B. Chandra and G. Das and G. Narasimhan and J. Soares"
+, title =       "New sparseness results on graph spanners"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "192--201"
+, precedes =    "cdns-nsrgs-95"
+, cites =       "addjs-sswg-93, a-cns-85, ap-sp-90, bd-rstod-86, bclr-ostm-86, b-egt-78, c-tipga-86, d-ascg-90, dj-wtacg-89, d-ntpcg-59, dfs-dgaag-90, k-aceg-88, kg-cgwac-92, ll-tapga-89, ps-gs-89, pu-osh-89, pu-tbser-88, r-cpscn-55, r-css-63, rs-addce-91, s-cmsga-91, s-aedsd-92, s-s-91, v-sgagc-91, v-mstkd-88, ZZZ"
+, update =      "97.11 bibrelex, 96.09 devillers, 94.05 smid"
 }
 
 @article{cdns-nsrgs-95
-, author =	"B. Chandra and G. Das and G. Narasimhan and J. Soares"
-, title =	"New sparseness results on graph spanners"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"125--144"
-, keywords =	"spanners, geometric graphs, greedy algorithm, transformational method, sparse spanners, euclidean graphs"
-, succeeds =	"cdns-nsrgs-92"
-, update =	"96.09 devillers"
+, author =      "B. Chandra and G. Das and G. Narasimhan and J. Soares"
+, title =       "New sparseness results on graph spanners"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "125--144"
+, keywords =    "spanners, geometric graphs, greedy algorithm, transformational method, sparse spanners, euclidean graphs"
+, succeeds =    "cdns-nsrgs-92"
+, update =      "96.09 devillers"
 }
 
 @article{ckt-nroko-99
-, author =	"B. Chandra and H. Karloff and C. Tovey"
-, title =	"New results on the old $k$-opt algorithm for the traveling salesman problem"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1999
-, pages =	"1998--2029"
-, update =	"00.03 smid"
+, author =      "B. Chandra and H. Karloff and C. Tovey"
+, title =       "New results on the old $k$-opt algorithm for the traveling salesman problem"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1999
+, pages =       "1998--2029"
+, update =      "00.03 smid"
 }
 
 @inproceedings{ckt-nroko-94
-, author =	"B. Chandra and H. Karloff and C. Tovey"
-, title =	"New results on the old $k$-opt algorithm for the {TSP}"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"150--159"
-, update =	"97.07 smid"
+, author =      "B. Chandra and H. Karloff and C. Tovey"
+, title =       "New results on the old $k$-opt algorithm for the {TSP}"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "150--159"
+, update =      "97.07 smid"
 }
 
 @techreport{cv-crcns-91
-, author =	"B. Chandra and S. Vishwanathan"
-, title =	"Constructing reliable communication networks of small weight on-line"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "B. Chandra and S. Vishwanathan"
+, title =       "Constructing reliable communication networks of small weight on-line"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @article{cm-paeet-92
-, author =	"S. Chandran and D. M. Mount"
-, title =	"A parallel algorithm for enclosed and enclosing triangles"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	2
-, year =	1992
-, pages =	"191--214"
-, keywords =	"minimum enclosures, convex polygons, parallel algorithms, rotating calipers"
-, update =	"93.05 jones"
+, author =      "S. Chandran and D. M. Mount"
+, title =       "A parallel algorithm for enclosed and enclosing triangles"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      2
+, year =        1992
+, pages =       "191--214"
+, keywords =    "minimum enclosures, convex polygons, parallel algorithms, rotating calipers"
+, update =      "93.05 jones"
 }
 
 @article{c-we1cp-82
-, author =	"R. Chandrasekaran"
-, title =	"The weighted {Euclidean} $1$-center problem"
-, journal =	"Oper. Res. Lett."
-, volume =	1
-, number =	3
-, year =	1982
-, pages =	"111--112"
-, keywords =	"facility location, $d$-dimensional, linear programming"
-, update =	"95.09 korneenko"
+, author =      "R. Chandrasekaran"
+, title =       "The weighted {Euclidean} $1$-center problem"
+, journal =     "Oper. Res. Lett."
+, volume =      1
+, number =      3
+, year =        1982
+, pages =       "111--112"
+, keywords =    "facility location, $d$-dimensional, linear programming"
+, update =      "95.09 korneenko"
 }
 
 @article{ct-aofwl-90
-, author =	"R. Chandrasekaran and A. Tamir"
-, title =	"Algebraic optimization: the {Fermat}-{Weber} location problem"
-, journal =	"Math. Program."
-, volume =	46
-, number =	2
-, year =	1990
-, pages =	"219--224"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "R. Chandrasekaran and A. Tamir"
+, title =       "Algebraic optimization: the {Fermat}-{Weber} location problem"
+, journal =     "Math. Program."
+, volume =      46
+, number =      2
+, year =        1990
+, pages =       "219--224"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @techreport{cd-cpo-87
-, author =	"V. Chandru and D. Dutta"
-, title =	"Composition of planar offsets"
-, type =	"Technical {Report}"
-, institution =	"Purdue Univ."
-, address =	"W. Lafayette, IN"
-, month =	jun
-, year =	1987
-, update =	"93.09 milone+mitchell"
+, author =      "V. Chandru and D. Dutta"
+, title =       "Composition of planar offsets"
+, type =        "Technical {Report}"
+, institution = "Purdue Univ."
+, address =     "W. Lafayette, IN"
+, month =       jun
+, year =        1987
+, update =      "93.09 milone+mitchell"
 }
 
 @article{cdh-gdc-89
-, author =	"V. Chandru and D. Dutta and C. Hoffmann"
-, title =	"On the geometry of Dupin cyclides"
-, journal =	"Visual Comput."
-, volume =	5
-, year =	1989
-, pages =	"227--290"
+, author =      "V. Chandru and D. Dutta and C. Hoffmann"
+, title =       "On the geometry of Dupin cyclides"
+, journal =     "Visual Comput."
+, volume =      5
+, year =        1989
+, pages =       "227--290"
 }
 
 @techreport{cgmrs-namlp-90
-, author =	"V. Chandru and S. K. Ghosh and A. Maheshwari and V. T. Rajan and S. Saluja"
-, title =	"{$NC$}-algorithms for minimum link path and related problems"
-, type =	"Technical {Report}"
-, number =	"CS-90/3"
-, institution =	"TATA inst."
-, address =	"Bombay, India"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "V. Chandru and S. K. Ghosh and A. Maheshwari and V. T. Rajan and S. Saluja"
+, title =       "{$NC$}-algorithms for minimum link path and related problems"
+, type =        "Technical {Report}"
+, number =      "CS-90/3"
+, institution = "TATA inst."
+, address =     "Bombay, India"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @article{cgmrs-namlp-95
-, author =	"V. Chandru and S. K. Ghosh and A. Maheshwari and V. T. Rajan and S. Saluja"
-, title =	"{$NC$}-algorithms for minimum link path and related problems"
-, journal =	"J. Algorithms"
-, volume =	19
-, year =	1995
-, pages =	"173--203"
-, update =	"97.03 smid"
+, author =      "V. Chandru and S. K. Ghosh and A. Maheshwari and V. T. Rajan and S. Saluja"
+, title =       "{$NC$}-algorithms for minimum link path and related problems"
+, journal =     "J. Algorithms"
+, volume =      19
+, year =        1995
+, pages =       "173--203"
+, update =      "97.03 smid"
 }
 
 @inproceedings{crs-mpc-90
-, author =	"V. Chandru and V. T. Rajan and R. Swaminathan"
-, title =	"Monotone pieces of chains"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"156--159"
-, cites =	"ll-ccmp-84, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "V. Chandru and V. T. Rajan and R. Swaminathan"
+, title =       "Monotone pieces of chains"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "156--159"
+, cites =       "ll-ccmp-84, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{crs-mpc-92
-, author =	"V. Chandru and V. T. Rajan and R. Swaminathan"
-, title =	"Monotone Pieces of Chains"
-, journal =	"ORSA J. Comput."
-, volume =	4
-, number =	4
-, year =	1992
-, pages =	"439--446"
-, succeeds =	"crs-mpc-90"
-, update =	"98.03 mitchell"
-, annote =	"Special issue on computational geometry; J. Mitchell and
+, author =      "V. Chandru and V. T. Rajan and R. Swaminathan"
+, title =       "Monotone Pieces of Chains"
+, journal =     "ORSA J. Comput."
+, volume =      4
+, number =      4
+, year =        1992
+, pages =       "439--446"
+, succeeds =    "crs-mpc-90"
+, update =      "98.03 mitchell"
+, annote =      "Special issue on computational geometry; J. Mitchell and
                   J. Karel Lenstra, eds."
 }
 
 @techreport{cs-hdcg-87
-, author =	"V. Chandru and R. Samuel"
-, title =	"How to draw a circumscribing gleichdick"
-, type =	"Technical {Report}"
-, number =	"CC-87-36"
-, institution =	"School Indust. Engrg., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1987
+, author =      "V. Chandru and R. Samuel"
+, title =       "How to draw a circumscribing gleichdick"
+, type =        "Technical {Report}"
+, number =      "CC-87-36"
+, institution = "School Indust. Engrg., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1987
 }
 
 @inproceedings{cv-chosp-91
-, author =	"V. Chandru and R. Venkataraman"
-, title =	"Circular hulls and orbiforms of simple polygons"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"433--440"
+, author =      "V. Chandru and R. Venkataraman"
+, title =       "Circular hulls and orbiforms of simple polygons"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "433--440"
 }
 
 @article{cld-sgcpm-82
-, author =	"C. C. Chang and R. C. T. Lee and M. W. Du"
-, title =	"Symbolic gray code as a perfect multiattribute hashing scheme for partial match queries"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	"SE-8"
-, year =	1982
-, pages =	"235--249"
+, author =      "C. C. Chang and R. C. T. Lee and M. W. Du"
+, title =       "Symbolic gray code as a perfect multiattribute hashing scheme for partial match queries"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      "SE-8"
+, year =        1982
+, pages =       "235--249"
 }
 
 @inproceedings{cy-wafi-97
-, author =	"E.-C. Chang and C. K. Yap"
-, title =	"A wavelet approach to foveating images"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"397--399"
-, cites =	"awb-av-88, b-ap-88, b-msvav-92, crd-isasv-96, hw-rffam-68, hw-srgoc-74, j-euimp-89, kg-ifics-96, r-svcvc-89, rs-dcsvv-90, s-dsvpm-77, s-smpsp-77, sgb-svavd-95, wbs-vbvct-92, ZZZ"
-, update =	"98.07 agarwal+bibrelex, 97.07 efrat"
+, author =      "E.-C. Chang and C. K. Yap"
+, title =       "A wavelet approach to foveating images"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "397--399"
+, cites =       "awb-av-88, b-ap-88, b-msvav-92, crd-isasv-96, hw-rffam-68, hw-srgoc-74, j-euimp-89, kg-ifics-96, r-svcvc-89, rs-dcsvv-90, s-dsvpm-77, s-smpsp-77, sgb-svavd-95, wbs-vbvct-92, ZZZ"
+, update =      "98.07 agarwal+bibrelex, 97.07 efrat"
 }
 
 @article{cst-nddds-92
-, author =	"F. R. K. Chang and E. Szemeredi and W. T. Trotter"
-, title =	"The number of different distances determined by a set of points in the {Euclidean} plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"1--11"
+, author =      "F. R. K. Chang and E. Szemeredi and W. T. Trotter"
+, title =       "The number of different distances determined by a set of points in the {Euclidean} plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "1--11"
 }
 
 @article{cgs-icmcm-89
-, author =	"G. Chang and W. Guida and W. Still"
-, title =	"An internal coordinate {Monte}-{Carlo} method for searching conformational space"
-, journal =	"J. Amer. Chem. Soc."
-, volume =	111
-, year =	1989
-, pages =	"4379--4386"
-, update =	"98.07 bibrelex"
+, author =      "G. Chang and W. Guida and W. Still"
+, title =       "An internal coordinate {Monte}-{Carlo} method for searching conformational space"
+, journal =     "J. Amer. Chem. Soc."
+, volume =      111
+, year =        1989
+, pages =       "4379--4386"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{cm-euleg-93
-, author =	"J. Chang and V. Milenkovic"
-, title =	"An experiment using {LN} for exact geometric computations"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"67--72"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation, exact arithmetic"
-, cites =	"m-cacau-89, dbs-gttd-92, fm-nsala-91, fv-eeacg-93, h-gsm-89, kln-edtur-91, m-vigau-88t, m-cacau-89, m-rfldd-90, m-rflp-89, fw-lnum-93, si-cvdom-89, f-pcg-93, ZZZ"
-, update =	"98.11 bibrelex, 97.03 daniels, 93.09 milone+mitchell"
+, author =      "J. Chang and V. Milenkovic"
+, title =       "An experiment using {LN} for exact geometric computations"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "67--72"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation, exact arithmetic"
+, cites =       "m-cacau-89, dbs-gttd-92, fm-nsala-91, fv-eeacg-93, h-gsm-89, kln-edtur-91, m-vigau-88t, m-cacau-89, m-rfldd-90, m-rflp-89, fw-lnum-93, si-cvdom-89, f-pcg-93, ZZZ"
+, update =      "98.11 bibrelex, 97.03 daniels, 93.09 milone+mitchell"
 }
 
 @article{cf-ekdtd-81
-, author =	"J. M. Chang and K. S. Fu"
-, title =	"Extended {$K$}-d tree database organization: a dynamic multiattribute clustering method"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	"SE-7"
-, year =	1981
-, pages =	"284--290"
+, author =      "J. M. Chang and K. S. Fu"
+, title =       "Extended {$K$}-d tree database organization: a dynamic multiattribute clustering method"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      "SE-7"
+, year =        1981
+, pages =       "284--290"
 }
 
 @techreport{c-pop-86
-, author =	"J. S. Chang"
-, title =	"Polygon optimization problems"
-, type =	"Report"
-, number =	240
-, institution =	"Comput. Sci. Div., New York Univ."
-, address =	"New York, NY"
-, year =	1986
+, author =      "J. S. Chang"
+, title =       "Polygon optimization problems"
+, type =        "Report"
+, number =      240
+, institution = "Comput. Sci. Div., New York Univ."
+, address =     "New York, NY"
+, year =        1986
 }
 
 @inproceedings{cy-psppo-84
-, author =	"J. S. Chang and C. K. Yap"
-, title =	"A polynomial solution for the potato-peeling and other polygon inclusion and enclosure problems"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1984
-, pages =	"408--416"
-, precedes =	"cy-psppp-86"
+, author =      "J. S. Chang and C. K. Yap"
+, title =       "A polynomial solution for the potato-peeling and other polygon inclusion and enclosure problems"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1984
+, pages =       "408--416"
+, precedes =    "cy-psppp-86"
 }
 
 @article{cy-psppp-86
-, author =	"J. S. Chang and C. K. Yap"
-, title =	"A polynomial solution for the potato-peeling problem"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"155--182"
-, succeeds =	"cy-psppo-84"
+, author =      "J. S. Chang and C. K. Yap"
+, title =       "A polynomial solution for the potato-peeling problem"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "155--182"
+, succeeds =    "cy-psppo-84"
 }
 
 @article{cht-oacov-90
-, author =	"Maw Shang Chang and Nen-Fu Huang and Chuan-Yi Tang"
-, title =	"An Optimal Algorithm For Constructing Oriented {Voronoi} Diagrams And Geographic Neighborhood Graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	35
-, number =	5
-, month =	aug
-, year =	1990
-, pages =	"255--260"
-, keywords =	"computational geometry, Voronoi diagrams, geographic neighborhood graphs"
-, update =	"97.07 smid"
-, annote =	"OVD is just a cdfVD with a wedge shaped distance
-		 function. Sweepline algorithm given."
-, abstract =	"Given n points on the plane, we propose an O(n log n)
-		 algorithm to construct the oriented Voronoi diagram and
-		 the geographic neighborhood graph of these n points. We
-		 also show that both problems have the same lower bound
-		 of Omega (n log n) and hence the proposed algorithm is
-		 optimal. (Author abstract) 4 Refs."
+, author =      "Maw Shang Chang and Nen-Fu Huang and Chuan-Yi Tang"
+, title =       "An Optimal Algorithm For Constructing Oriented {Voronoi} Diagrams And Geographic Neighborhood Graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      35
+, number =      5
+, month =       aug
+, year =        1990
+, pages =       "255--260"
+, keywords =    "computational geometry, Voronoi diagrams, geographic neighborhood graphs"
+, update =      "97.07 smid"
+, annote =      "OVD is just a cdfVD with a wedge shaped distance
+                 function. Sweepline algorithm given."
+, abstract =    "Given n points on the plane, we propose an O(n log n)
+                 algorithm to construct the oriented Voronoi diagram and
+                 the geographic neighborhood graph of these n points. We
+                 also show that both problems have the same lower bound
+                 of Omega (n log n) and hence the proposed algorithm is
+                 optimal. (Author abstract) 4 Refs."
 }
 
 @article{ctl-sebmp-92
-, author =	"M. S. Chang and C. Y. Tang and C. T. Lee"
-, title =	"Solving the {Euclidean} Bottleneck Matching Problem by $k$-Relative Neighborhood Graphs"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"177--194"
-, update =	"96.05 efrat"
+, author =      "M. S. Chang and C. Y. Tang and C. T. Lee"
+, title =       "Solving the {Euclidean} Bottleneck Matching Problem by $k$-Relative Neighborhood Graphs"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "177--194"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{ctl-20rng-90
-, author =	"M. S. Chang and C. Y. Tang and R. C. T. Lee"
-, title =	"$20$-relative neighborhood graphs are {Hamiltonian}"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"53--65"
+, author =      "M. S. Chang and C. Y. Tang and R. C. T. Lee"
+, title =       "$20$-relative neighborhood graphs are {Hamiltonian}"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "53--65"
 }
 
 @article{cl-fmsic-92
-, author =	"R. C. Chang and H. S. Lee"
-, title =	"Finding a maximal set of independent chords in a circle"
-, journal =	"Inform. Process. Lett."
-, volume =	41
-, number =	2
-, year =	1992
-, pages =	"99--102"
-, keywords =	"geometric graphs, polygons, decomposition"
-, update =	"95.09 korneenko"
+, author =      "R. C. Chang and H. S. Lee"
+, title =       "Finding a maximal set of independent chords in a circle"
+, journal =     "Inform. Process. Lett."
+, volume =      41
+, number =      2
+, year =        1992
+, pages =       "99--102"
+, keywords =    "geometric graphs, polygons, decomposition"
+, update =      "95.09 korneenko"
 }
 
 @article{cl-omsta-86
-, author =	"R. C. Chang and R. C. T. Lee"
-, title =	"An {$O(n \log n)$} minimal spanning tree algorithm for $n$ points in the plane"
-, journal =	"BIT"
-, volume =	26
-, year =	1986
-, pages =	"7--16"
-, annote =	"See \cite{sl-pdcms-88} for a discussion of lots of
-		 errors."
+, author =      "R. C. Chang and R. C. T. Lee"
+, title =       "An {$O(n \log n)$} minimal spanning tree algorithm for $n$ points in the plane"
+, journal =     "BIT"
+, volume =      26
+, year =        1986
+, pages =       "7--16"
+, annote =      "See \cite{sl-pdcms-88} for a discussion of lots of
+                 errors."
 }
 
 @article{cl-aldt-84
-, author =	"R. C. Chang and R. C. T. Lee"
-, title =	"On the average length of {Delaunay} triangulations"
-, journal =	"BIT"
-, volume =	24
-, year =	1984
-, pages =	"269--273"
+, author =      "R. C. Chang and R. C. T. Lee"
+, title =       "On the average length of {Delaunay} triangulations"
+, journal =     "BIT"
+, volume =      24
+, year =        1984
+, pages =       "269--273"
 }
 
 @article{cl-acpac-84
-, author =	"R. C. Chang and R. C. T. Lee"
-, title =	"The average-case performance analysis of a closest-pair problem"
-, journal =	"Internat. J. Comput. Math."
-, volume =	16
-, number =	2
-, year =	1984
-, pages =	"125--130"
-, keywords =	"proximity, average-case analysis"
-, update =	"95.09 korneenko"
+, author =      "R. C. Chang and R. C. T. Lee"
+, title =       "The average-case performance analysis of a closest-pair problem"
+, journal =     "Internat. J. Comput. Math."
+, volume =      16
+, number =      2
+, year =        1984
+, pages =       "125--130"
+, keywords =    "proximity, average-case analysis"
+, update =      "95.09 korneenko"
 }
 
 @book{cgglmw-fltim-92
-, author =	"B. W. Char and K. O. Geddes and G. H. Gonnet and B. L. Leong and M. B. Monagan and S. M. Watt"
-, title =	"First leaves: a tutorial introduction to Maple {V}"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1992
-, update =	"00.03 bibrelex"
+, author =      "B. W. Char and K. O. Geddes and G. H. Gonnet and B. L. Leong and M. B. Monagan and S. M. Watt"
+, title =       "First leaves: a tutorial introduction to Maple {V}"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1992
+, update =      "00.03 bibrelex"
 }
 
 @book{cgglmw-m5lrm-91
-, author =	"B. W. Char and K. O. Geddes and G. H. Gonnet and B. L. Leong and M. B. Monagan and S. M. Watt"
-, title =	"Maple {V} Language Reference Manual"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1991
-, update =	"98.11 bibrelex, 96.09 agarwal, 95.05 agarwal"
+, author =      "B. W. Char and K. O. Geddes and G. H. Gonnet and B. L. Leong and M. B. Monagan and S. M. Watt"
+, title =       "Maple {V} Language Reference Manual"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1991
+, update =      "98.11 bibrelex, 96.09 agarwal, 95.05 agarwal"
 }
 
 @book{cgglmw-mvlrm-91
-, author =	"Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet and Benton L. Leong and Micheal B. Monagan and Stephen M. Watt"
-, title =	"Maple V Language Reference Manual"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1991
-, update =	"00.03 bibrelex"
+, author =      "Bruce W. Char and Keith O. Geddes and Gaston H. Gonnet and Benton L. Leong and Micheal B. Monagan and Stephen M. Watt"
+, title =       "Maple V Language Reference Manual"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1991
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{ccfm-icdir-97
-, author =	"Moses Charikar and Chandra Chekuri and Tom{\'a}s Feder and Rajeev Motwani"
-, title =	"Incremental Clustering and Dynamic Information Retrieval"
-, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
-, year =	1997
-, pages =	"626--635"
-, update =	"98.07 agarwal+bibrelex"
+, author =      "Moses Charikar and Chandra Chekuri and Tom{\'a}s Feder and Rajeev Motwani"
+, title =       "Incremental Clustering and Dynamic Information Retrieval"
+, booktitle =   "Proc. 29th Annu. ACM Sympos. Theory Comput."
+, year =        1997
+, pages =       "626--635"
+, update =      "98.07 agarwal+bibrelex"
 }
 
 @inproceedings{ccgg-rvtda-98
-, author =	"M. Charikar and C. Chekuri and A. Goel and S. Guha"
-, title =	"Rounding via trees: {D}eterministic approximation algorithms for group {S}teiner trees and $k$-median"
-, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
-, year =	1998
-, pages =	"114--123"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "M. Charikar and C. Chekuri and A. Goel and S. Guha"
+, title =       "Rounding via trees: {D}eterministic approximation algorithms for group {S}teiner trees and $k$-median"
+, booktitle =   "Proc. 30th Annu. ACM Sympos. Theory Comput."
+, year =        1998
+, pages =       "114--123"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{cg-icafl-99
-, author =	"M. Charikar and S. Guha"
-, title =	"Improved combinatorial algorithms for facility location and $k$-median problems"
-, booktitle =	"Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1999
-, pages =	"378--388"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "M. Charikar and S. Guha"
+, title =       "Improved combinatorial algorithms for facility location and $k$-median problems"
+, booktitle =   "Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1999
+, pages =       "378--388"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{cgts-cfaak-99
-, author =	"M. Charikar and S. Guha and E. Tardos and D. Shmoys"
-, title =	"A constant-factor approximation algorithm for the $k$-median problem"
-, booktitle =	"Proc. 31st Annu. ACM Sympos. Theory Comput."
-, year =	1999
-, pages =	"1--10"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "M. Charikar and S. Guha and E. Tardos and D. Shmoys"
+, title =       "A constant-factor approximation algorithm for the $k$-median problem"
+, booktitle =   "Proc. 31st Annu. ACM Sympos. Theory Comput."
+, year =        1999
+, pages =       "1--10"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{chm-dsp-98
-, author =	"Moses Charikar and Dan Halperin and Rajeev Motwani"
-, title =	"The Dynamic Servers Problem"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"410--419"
-, keywords =	"minimum-length monotone subdivision, approximation algorithms"
-, update =	"99.07 bibrelex, 98.07 mitchell"
+, author =      "Moses Charikar and Dan Halperin and Rajeev Motwani"
+, title =       "The Dynamic Servers Problem"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "410--419"
+, keywords =    "minimum-length monotone subdivision, approximation algorithms"
+, update =      "99.07 bibrelex, 98.07 mitchell"
 }
 
 @article{c-odlp-52
-, author =	"A. Charnes"
-, title =	"Optimality and degeneracy in linear programming"
-, journal =	"Econometrica"
-, volume =	20
-, number =	2
-, year =	1952
-, pages =	"160--170"
-, update =	"98.03 bibrelex"
+, author =      "A. Charnes"
+, title =       "Optimality and degeneracy in linear programming"
+, journal =     "Econometrica"
+, volume =      20
+, number =      2
+, year =        1952
+, pages =       "160--170"
+, update =      "98.03 bibrelex"
 }
 
 @article{cg-pspca-84
-, author =	"P. Charrot and J. A. Gregory"
-, title =	"A pentagonal surface patch for computer aided geometric design"
-, journal =	"Comput. Aided Design"
-, volume =	1
-, year =	1984
-, pages =	"87--94"
-, update =	"98.03 bibrelex"
+, author =      "P. Charrot and J. A. Gregory"
+, title =       "A pentagonal surface patch for computer aided geometric design"
+, journal =     "Comput. Aided Design"
+, volume =      1
+, year =        1984
+, pages =       "87--94"
+, update =      "98.03 bibrelex"
 }
 
 @book{co-aagt-93
-, author =	"G. Chartrand and O. R. Oellermann"
-, title =	"Applied and Algorithmic Graph Theory"
-, publisher =	"McGraw-Hill"
-, address =	"New York"
-, year =	1993
+, author =      "G. Chartrand and O. R. Oellermann"
+, title =       "Applied and Algorithmic Graph Theory"
+, publisher =   "McGraw-Hill"
+, address =     "New York"
+, year =        1993
 }
 
 @inproceedings{c-dcgaa-89
-, author =	"J.-M. Chassery"
-, title =	"Discrete and computational geometric approaches applied to a problem of finite approximation"
-, booktitle =	"Proc. Scand. Conf. Image Anal."
-, site =	"Oulu, Finland"
-, volume =	2
-, year =	1989
-, pages =	"856--859"
-, keywords =	"convex, fitting, discrete geometry"
-, update =	"95.09 korneenko"
+, author =      "J.-M. Chassery"
+, title =       "Discrete and computational geometric approaches applied to a problem of finite approximation"
+, booktitle =   "Proc. Scand. Conf. Image Anal."
+, site =        "Oulu, Finland"
+, volume =      2
+, year =        1989
+, pages =       "856--859"
+, keywords =    "convex, fitting, discrete geometry"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{cg-ipcis-83
-, author =	"J. M. Chassery and C. Garbay"
-, title =	"Iterative process for colour image segmentation using a convexity criterion"
-, editor =	"A. Oosterline and A. G. Tescher"
-, booktitle =	"Applications of Digital Image Processing"
-, series =	"Proc. SPIE"
-, volume =	397
-, publisher =	"??"
-, year =	1983
-, pages =	"165--172"
+, author =      "J. M. Chassery and C. Garbay"
+, title =       "Iterative process for colour image segmentation using a convexity criterion"
+, editor =      "A. Oosterline and A. G. Tescher"
+, booktitle =   "Applications of Digital Image Processing"
+, series =      "Proc. SPIE"
+, volume =      397
+, publisher =   "??"
+, year =        1983
+, pages =       "165--172"
 }
 
 @inproceedings{cm-smvde-89
-, author =	"J.-M. Chassery and A. Montanvert"
-, title =	"Segmentation methods in a {Voronoi} diagram environment"
-, booktitle =	"Proc. Scand. Conf. Image Anal."
-, site =	"Oulu, Finland"
-, volume =	1
-, year =	1989
-, pages =	"408--415"
-, keywords =	"Voronoi diagram"
-, update =	"95.09 korneenko"
+, author =      "J.-M. Chassery and A. Montanvert"
+, title =       "Segmentation methods in a {Voronoi} diagram environment"
+, booktitle =   "Proc. Scand. Conf. Image Anal."
+, site =        "Oulu, Finland"
+, volume =      1
+, year =        1989
+, pages =       "408--415"
+, keywords =    "Voronoi diagram"
+, update =      "95.09 korneenko"
 }
 
 @article{cc-nfepm-90
-, author =	"S. Chatterjee and S. Chatterjee"
-, title =	"A note on finding extreme points in multivariare space"
-, journal =	"Comput. Statist. Data Anal."
-, volume =	10
-, number =	1
-, year =	1990
-, pages =	"87--92"
-, keywords =	"convex hull, $d$-dimensional, peeling, extremal points"
-, update =	"95.09 korneenko"
+, author =      "S. Chatterjee and S. Chatterjee"
+, title =       "A note on finding extreme points in multivariare space"
+, journal =     "Comput. Statist. Data Anal."
+, volume =      10
+, number =      1
+, year =        1990
+, pages =       "87--92"
+, keywords =    "convex hull, $d$-dimensional, peeling, extremal points"
+, update =      "95.09 korneenko"
 }
 
 @article{cd-kdcp-90
-, author =	"S. Chattopadhyay and P. Das"
-, title =	"The {$k$}-dense corridor problems"
-, journal =	"Pattern Recogn. Lett."
-, volume =	11
-, year =	1990
-, pages =	"463--469"
-, update =	"98.11 bibrelex"
+, author =      "S. Chattopadhyay and P. Das"
+, title =       "The {$k$}-dense corridor problems"
+, journal =     "Pattern Recogn. Lett."
+, volume =      11
+, year =        1990
+, pages =       "463--469"
+, update =      "98.11 bibrelex"
 }
 
 @article{cd-ctbtc-91
-, author =	"S. Chattopadhyay and P. P. Das"
-, title =	"Counting thin and bushy triangulations of convex polygons"
-, journal =	"Pattern Recogn. Lett."
-, volume =	12
-, year =	1991
-, pages =	"139--144"
-, update =	"95.09 korneenko, 93.09 milone+mitchell"
-, annote =	"Computes formulae for number of thin triangulations (2
-		 ears) and bushy triangulations (max ears) of a convex
-		 polygon."
+, author =      "S. Chattopadhyay and P. P. Das"
+, title =       "Counting thin and bushy triangulations of convex polygons"
+, journal =     "Pattern Recogn. Lett."
+, volume =      12
+, year =        1991
+, pages =       "139--144"
+, update =      "95.09 korneenko, 93.09 milone+mitchell"
+, annote =      "Computes formulae for number of thin triangulations (2
+                 ears) and bushy triangulations (max ears) of a convex
+                 polygon."
 }
 
 @inproceedings{c-fbfpf-98
-, author =	"Vasiliki Chatzi"
-, title =	"Finding Basis Functions for Pyramidal Finite Elements"
-, booktitle =	"CGC Workshop on Geometric Computing"
-, year =	1998
-, url =	"https://www.cs.brown.edu/cgc/cgc98/"
-, update =	"98.11 tamassia"
+, author =      "Vasiliki Chatzi"
+, title =       "Finding Basis Functions for Pyramidal Finite Elements"
+, booktitle =   "CGC Workshop on Geometric Computing"
+, year =        1998
+, url = "https://www.cs.brown.edu/cgc/cgc98/"
+, update =      "98.11 tamassia"
 }
 
 @article{c-fchdt-91
-, author =	"B. B. Chaudhuri"
-, title =	"Fuzzy convex hull determination in two-dimensional space"
-, journal =	"Pattern Recogn. Lett."
-, volume =	12
-, number =	10
-, year =	1991
-, pages =	"591--594"
-, keywords =	"convex hull"
-, update =	"95.09 korneenko"
+, author =      "B. B. Chaudhuri"
+, title =       "Fuzzy convex hull determination in two-dimensional space"
+, journal =     "Pattern Recogn. Lett."
+, volume =      12
+, number =      10
+, year =        1991
+, pages =       "591--594"
+, keywords =    "convex hull"
+, update =      "95.09 korneenko"
 }
 
 @article{c-ocfod-90
-, author =	"B. B. Chaudhuri"
-, title =	"Optimal circular fit to objects in two and hree dimensions"
-, journal =	"Pattern Recogn. Lett."
-, volume =	11
-, year =	1990
-, pages =	"571--574"
-, update =	"98.11 bibrelex"
+, author =      "B. B. Chaudhuri"
+, title =       "Optimal circular fit to objects in two and hree dimensions"
+, journal =     "Pattern Recogn. Lett."
+, volume =      11
+, year =        1990
+, pages =       "571--574"
+, update =      "98.11 bibrelex"
 }
 
 @article{ck-ocfwd-93
-, author =	"B. B. Chaudhuri and P. Kundu"
-, title =	"Optimum circular fit to weighted data in multi-dimensional space"
-, journal =	"Pattern Recogn. Lett."
-, volume =	14
-, year =	1993
-, pages =	"1--6"
-, update =	"98.11 bibrelex"
+, author =      "B. B. Chaudhuri and P. Kundu"
+, title =       "Optimum circular fit to weighted data in multi-dimensional space"
+, journal =     "Pattern Recogn. Lett."
+, volume =      14
+, year =        1993
+, pages =       "1--6"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{cn-lerps-99
-, author =	"J. Chaudhuri and S. C. Nandy"
-, title =	"Largest empty rectangle among a point set"
-, booktitle =	"Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1738
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"34--46"
-, update =	"00.03 smid"
+, author =      "J. Chaudhuri and S. C. Nandy"
+, title =       "Largest empty rectangle among a point set"
+, booktitle =   "Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1738
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "34--46"
+, update =      "00.03 smid"
 }
 
 @article{c-dpopp-83
-, author =	"Bernard Chazelle"
-, title =	"A decision procedure for optimal polyhedron partitioning"
-, journal =	"Inform. Process. Lett."
-, volume =	16
-, year =	1983
-, pages =	"75--78"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "A decision procedure for optimal polyhedron partitioning"
+, journal =     "Inform. Process. Lett."
+, volume =      16
+, year =        1983
+, pages =       "75--78"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{c-fdams-97
-, author =	"Bernard Chazelle"
-, title =	"A Faster Deterministic Algorithm for Minimum Spanning Trees"
-, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '97"
-, year =	1997
-, pages =	"To appear"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "A Faster Deterministic Algorithm for Minimum Spanning Trees"
+, booktitle =   "Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '97"
+, year =        1997
+, pages =       "To appear"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @techreport{c-fadsi-85
-, author =	"Bernard Chazelle"
-, title =	"A functional approach to data structures and its use in multidimensional searching"
-, type =	"Report"
-, number =	"CS-85-16"
-, institution =	"Comput. Sci. Dept., Brown Univ."
-, address =	"Providence, RI"
-, year =	1985
-, precedes =	"c-fadsi-88"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "A functional approach to data structures and its use in multidimensional searching"
+, type =        "Report"
+, number =      "CS-85-16"
+, institution = "Comput. Sci. Dept., Brown Univ."
+, address =     "Providence, RI"
+, year =        1985
+, precedes =    "c-fadsi-88"
+, update =      "98.03 mitchell"
 }
 
 @article{c-fadsi-88
-, author =	"Bernard Chazelle"
-, title =	"A functional approach to data structures and its use in multidimensional searching"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, number =	3
-, month =	jun
-, year =	1988
-, pages =	"427--462"
-, succeeds =	"c-fadsi-85"
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "A functional approach to data structures and its use in multidimensional searching"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, number =      3
+, month =       jun
+, year =        1988
+, pages =       "427--462"
+, succeeds =    "c-fadsi-85"
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @techreport{c-sptgd-93
-, author =	"Bernard Chazelle"
-, title =	"A Simple Proof Technique for Geometric Discrepancy"
-, institution =	"Princeton University"
-, month =	feb
-, year =	1993
-, comments =	"DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
-, update =	"93.09 milone+mitchell"
+, author =      "Bernard Chazelle"
+, title =       "A Simple Proof Technique for Geometric Discrepancy"
+, institution = "Princeton University"
+, month =       feb
+, year =        1993
+, comments =    "DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{c-salb-94
-, author =	"Bernard Chazelle"
-, title =	"A spectral approach to lower bounds"
-, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1994
-, pages =	"674--682"
-, update =	"98.03 mitchell, 95.01 matousek+smid"
+, author =      "Bernard Chazelle"
+, title =       "A spectral approach to lower bounds"
+, booktitle =   "Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1994
+, pages =       "674--682"
+, update =      "98.03 mitchell, 95.01 matousek+smid"
 }
 
 @article{c-salb-98
-, author =	"Bernard Chazelle"
-, title =	"A spectral approach to lower bounds with applications to geometric searching"
-, journal =	"SIAM J. Comput."
-, volume =	27
-, number =	2
-, year =	1998
-, pages =	"545--556"
-, update =	"98.11 pocchiola"
+, author =      "Bernard Chazelle"
+, title =       "A spectral approach to lower bounds with applications to geometric searching"
+, journal =     "SIAM J. Comput."
+, volume =      27
+, number =      2
+, year =        1998
+, pages =       "545--556"
+, update =      "98.11 pocchiola"
 }
 
 @inproceedings{c-tpca-82
-, author =	"Bernard Chazelle"
-, title =	"A theorem on polygon cutting with applications"
-, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1982
-, pages =	"339--349"
-, keywords =	"decomposition, polygons, divide-and-conquer, triangulation, visibility"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "A theorem on polygon cutting with applications"
+, booktitle =   "Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1982
+, pages =       "339--349"
+, keywords =    "decomposition, polygons, divide-and-conquer, triangulation, visibility"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{c-acdl-83
-, author =	"Bernard Chazelle"
-, title =	"Algorithms for computing depths and layers"
-, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
-, year =	1983
-, pages =	"427--436"
-, keywords =	"points, convex"
-, update =	"98.03 mitchell, 95.09 korneenko"
+, author =      "Bernard Chazelle"
+, title =       "Algorithms for computing depths and layers"
+, booktitle =   "Proc. Allerton Conf. Commun. Control Comput."
+, year =        1983
+, pages =       "427--436"
+, keywords =    "points, convex"
+, update =      "98.03 mitchell, 95.09 korneenko"
 }
 
 @article{c-asdii-88
-, author =	"Bernard Chazelle"
-, title =	"An algorithm for segment-dragging and its implementation"
-, journal =	"Algorithmica"
-, volume =	3
-, year =	1988
-, pages =	"205--221"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "An algorithm for segment-dragging and its implementation"
+, journal =     "Algorithmica"
+, volume =      3
+, year =        1988
+, pages =       "205--221"
+, update =      "98.03 mitchell"
 }
 
 @article{c-iafrn-83
-, author =	"Bernard Chazelle"
-, title =	"An improved algorithm for the fixed-radius neighbor problem"
-, journal =	"Inform. Process. Lett."
-, volume =	16
-, year =	1983
-, pages =	"193--198"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "An improved algorithm for the fixed-radius neighbor problem"
+, journal =     "Inform. Process. Lett."
+, volume =      16
+, year =        1983
+, pages =       "193--198"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{c-oaitd-89
-, author =	"Bernard Chazelle"
-, title =	"An optimal algorithm for intersecting three-dimensional convex polyhedra"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"586--591"
-, keywords =	"intersection, polyhedra, polytopes, duality, convex hulls, Voronoi diagrams"
-, precedes =	"c-oaitd-92"
-, update =	"98.03 mitchell, 93.09 devillers"
+, author =      "Bernard Chazelle"
+, title =       "An optimal algorithm for intersecting three-dimensional convex polyhedra"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "586--591"
+, keywords =    "intersection, polyhedra, polytopes, duality, convex hulls, Voronoi diagrams"
+, precedes =    "c-oaitd-92"
+, update =      "98.03 mitchell, 93.09 devillers"
 }
 
 @article{c-oaitd-92
-, author =	"Bernard Chazelle"
-, title =	"An optimal algorithm for intersecting three-dimensional convex polyhedra"
-, journal =	"SIAM J. Comput."
-, volume =	21
-, number =	4
-, year =	1992
-, pages =	"671--696"
-, succeeds =	"c-oaitd-89"
-, update =	"98.03 mitchell, 93.09 devillers"
+, author =      "Bernard Chazelle"
+, title =       "An optimal algorithm for intersecting three-dimensional convex polyhedra"
+, journal =     "SIAM J. Comput."
+, volume =      21
+, number =      4
+, year =        1992
+, pages =       "671--696"
+, succeeds =    "c-oaitd-89"
+, update =      "98.03 mitchell, 93.09 devillers"
 }
 
 @techreport{c-oaitd-89t
-, author =	"B. Chazelle"
-, title =	"An optimal algorithms for intersecting three-dimensional convex polyhedra"
-, type =	"Technical {Report}"
-, institution =	"Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1989
-, update =	"98.03 bibrelex"
+, author =      "B. Chazelle"
+, title =       "An optimal algorithms for intersecting three-dimensional convex polyhedra"
+, type =        "Technical {Report}"
+, institution = "Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1989
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{c-ochan-91
-, author =	"Bernard Chazelle"
-, title =	"An optimal convex hull algorithm and new results on cuttings"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"29--38"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "An optimal convex hull algorithm and new results on cuttings"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "29--38"
+, update =      "98.03 mitchell"
 }
 
 @techreport{c-ochap-91
-, author =	"Bernard Chazelle"
-, title =	"An optimal convex hull algorithm for point sets in any fixed dimension"
-, type =	"Technical {Report}"
-, number =	"CS-TR-336-91"
-, institution =	"Dept. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1991
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "An optimal convex hull algorithm for point sets in any fixed dimension"
+, type =        "Technical {Report}"
+, number =      "CS-TR-336-91"
+, institution = "Dept. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1991
+, update =      "98.03 mitchell"
 }
 
 @article{c-ochaa-93
-, author =	"Bernard Chazelle"
-, title =	"An optimal convex hull algorithm in any fixed dimension"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"377--409"
-, succeeds =	"c-ochan-91"
-, update =	"98.03 mitchell, 94.05 matousek"
+, author =      "Bernard Chazelle"
+, title =       "An optimal convex hull algorithm in any fixed dimension"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "377--409"
+, succeeds =    "c-ochan-91"
+, update =      "98.03 mitchell, 94.05 matousek"
 }
 
 @incollection{c-ads-87
-, author =	"Bernard Chazelle"
-, title =	"Approximation and decomposition of shapes"
-, editor =	"J. T. Schwartz and C.-K. Yap"
-, booktitle =	"Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
-, publisher =	"Lawrence Erlbaum Associates"
-, address =	"Hillsdale, NJ"
-, year =	1987
-, pages =	"145--185"
-, keywords =	"survey paper, polygons, two-dimensional, three-dimensional, approximation, decomposition, covering, partition, triangulation"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Approximation and decomposition of shapes"
+, editor =      "J. T. Schwartz and C.-K. Yap"
+, booktitle =   "Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
+, publisher =   "Lawrence Erlbaum Associates"
+, address =     "Hillsdale, NJ"
+, year =        1987
+, pages =       "145--185"
+, keywords =    "survey paper, polygons, two-dimensional, three-dimensional, approximation, decomposition, covering, partition, triangulation"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{c-cgr-94
-, author =	"Bernard Chazelle"
-, title =	"Computational Geometry: A Retrospective"
-, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	"75--94"
-, update =	"98.03 mitchell, 95.01 smid, 94.05 matousek"
+, author =      "Bernard Chazelle"
+, title =       "Computational Geometry: A Retrospective"
+, booktitle =   "Proc. 26th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       "75--94"
+, update =      "98.03 mitchell, 95.01 smid, 94.05 matousek"
 }
 
 @incollection{c-cgr-95
-, author =	"Bernard Chazelle"
-, title =	"Computational geometry: a retrospective"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, year =	1995
-, pages =	"22--46"
-, keywords =	"survey paper"
-, update =	"98.07 icking, 98.03 mitchell, 97.11 bibrelex, 97.03 pocchiola, 96.05 pocchiola"
+, author =      "Bernard Chazelle"
+, title =       "Computational geometry: a retrospective"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, year =        1995
+, pages =       "22--46"
+, keywords =    "survey paper"
+, update =      "98.07 icking, 98.03 mitchell, 97.11 bibrelex, 97.03 pocchiola, 96.05 pocchiola"
 }
 
 @phdthesis{c-cgc-79
-, author =	"Bernard Chazelle"
-, title =	"Computational geometry and convexity"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Yale Univ."
-, address =	"New Haven, CT"
-, year =	1979
-, note =	"Carnegie-Mellon Univ. Report CS-80-150"
-, keywords =	"doctoral thesis"
-, comments =	"UMI KRA81-10021, 313 pp."
-, update =	"98.03 mitchell, 93.09 jones, 93.05 jones"
+, author =      "Bernard Chazelle"
+, title =       "Computational geometry and convexity"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Yale Univ."
+, address =     "New Haven, CT"
+, year =        1979
+, note =        "Carnegie-Mellon Univ. Report CS-80-150"
+, keywords =    "doctoral thesis"
+, comments =    "UMI KRA81-10021, 313 pp."
+, update =      "98.03 mitchell, 93.09 jones, 93.05 jones"
 }
 
 @incollection{c-cggof-91
-, author =	"Bernard Chazelle"
-, title =	"Computational geometry for the gourmet: old fare and new dishes"
-, booktitle =	"Automata, Languages and Programming (Proc. 18th ICALP)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	510
-, year =	1991
-, pages =	"686--696"
-, update =	"98.03 mitchell, 97.03 aronov, 94.05 matousek"
+, author =      "Bernard Chazelle"
+, title =       "Computational geometry for the gourmet: old fare and new dishes"
+, booktitle =   "Automata, Languages and Programming (Proc. 18th ICALP)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      510
+, year =        1991
+, pages =       "686--696"
+, update =      "98.03 mitchell, 97.03 aronov, 94.05 matousek"
 }
 
 @article{c-cgsc-84
-, author =	"Bernard Chazelle"
-, title =	"Computational Geometry on a Systolic Chip"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-33"
-, number =	9
-, month =	sep
-, year =	1984
-, pages =	"774--785"
-, keywords =	"parallel computation, VLSI design"
-, update =	"98.03 mitchell, 93.09 held"
+, author =      "Bernard Chazelle"
+, title =       "Computational Geometry on a Systolic Chip"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-33"
+, number =      9
+, month =       sep
+, year =        1984
+, pages =       "774--785"
+, keywords =    "parallel computation, VLSI design"
+, update =      "98.03 mitchell, 93.09 held"
 }
 
 @inproceedings{c-cftvc-84
-, author =	"Bernard Chazelle"
-, title =	"Computing on a free tree via complexity preserving mappings"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1984
-, pages =	"358--368"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle"
+, title =       "Computing on a free tree via complexity preserving mappings"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1984
+, pages =       "358--368"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{c-cftcp-87
-, author =	"Bernard Chazelle"
-, title =	"Computing on a free tree via complexity-preserving mappings"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"337--361"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Computing on a free tree via complexity-preserving mappings"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "337--361"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{c-cdp-81
-, author =	"Bernard Chazelle"
-, title =	"Convex decompositions of polyhedra"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
-, year =	1981
-, pages =	"70--79"
-, precedes =	"c-cpplb-84"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Convex decompositions of polyhedra"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Theory Comput."
+, year =        1981
+, pages =       "70--79"
+, precedes =    "c-cpplb-84"
+, update =      "98.03 mitchell"
 }
 
 @article{c-cpplb-84
-, author =	"Bernard Chazelle"
-, title =	"Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm"
-, journal =	"SIAM J. Comput."
-, volume =	13
-, year =	1984
-, pages =	"488--507"
-, succeeds =	"c-cdp-81"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm"
+, journal =     "SIAM J. Comput."
+, volume =      13
+, year =        1984
+, pages =       "488--507"
+, succeeds =    "c-cdp-81"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{c-ccdga-84
-, author =	"Bernard Chazelle"
-, title =	"Criticality considerations in the design of geometric algorithms"
-, booktitle =	"Proc. 22nd Allerton Conf. Commun. Control Comput."
-, year =	1984
-, pages =	"71--80"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Criticality considerations in the design of geometric algorithms"
+, booktitle =   "Proc. 22nd Allerton Conf. Commun. Control Comput."
+, year =        1984
+, pages =       "71--80"
+, update =      "98.03 mitchell"
 }
 
 @techreport{c-chdc-91
-, author =	"Bernard Chazelle"
-, title =	"Cutting hyperplanes for divide-and-conquer"
-, type =	"Manuscript"
-, institution =	"Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1991
-, keywords =	"partition, divide-and-conquer, hyperplanes"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Cutting hyperplanes for divide-and-conquer"
+, type =        "Manuscript"
+, institution = "Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1991
+, keywords =    "partition, divide-and-conquer, hyperplanes"
+, update =      "98.03 mitchell"
 }
 
 @article{c-chdc-93
-, author =	"Bernard Chazelle"
-, title =	"Cutting hyperplanes for divide-and-conquer"
-, journal =	"Discrete Comput. Geom."
-, volume =	9
-, number =	2
-, year =	1993
-, pages =	"145--158"
-, keywords =	"partition, divide-and-conquer, hyperplanes"
-, succeeds =	"c-chdc-91"
-, update =	"98.03 mitchell, 93.09 matousek"
+, author =      "Bernard Chazelle"
+, title =       "Cutting hyperplanes for divide-and-conquer"
+, journal =     "Discrete Comput. Geom."
+, volume =      9
+, number =      2
+, year =        1993
+, pages =       "145--158"
+, keywords =    "partition, divide-and-conquer, hyperplanes"
+, succeeds =    "c-chdc-91"
+, update =      "98.03 mitchell, 93.09 matousek"
 }
 
 @techreport{c-ept-90
-, author =	"Bernard Chazelle"
-, title =	"Efficient Polygon Trinangulation"
-, number =	"CS-TR-249-90"
-, institution =	"Princeton Univ."
-, year =	1990
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle"
+, title =       "Efficient Polygon Trinangulation"
+, number =      "CS-TR-249-90"
+, institution = "Princeton Univ."
+, year =        1990
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{c-fsram-84
-, author =	"B. Chazelle"
-, title =	"Fast searching in a real algebraic manifold with applications to geometric complexity"
-, type =	"Technical {Report}"
-, number =	"84-13"
-, institution =	"Dept. Comput. Sci., Brown Univ."
-, address =	"Providence, RI"
-, year =	1984
-, update =	"98.07 bibrelex"
+, author =      "B. Chazelle"
+, title =       "Fast searching in a real algebraic manifold with applications to geometric complexity"
+, type =        "Technical {Report}"
+, number =      "84-13"
+, institution = "Dept. Comput. Sci., Brown Univ."
+, address =     "Providence, RI"
+, year =        1984
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{c-fsram-85
-, author =	"Bernard Chazelle"
-, title =	"Fast searching in a real algebraic manifold with applications to geometric complexity"
-, booktitle =	"Proc. Internat. Colloq. on Trees in Algebra and Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	185
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"145--156"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Fast searching in a real algebraic manifold with applications to geometric complexity"
+, booktitle =   "Proc. Internat. Colloq. on Trees in Algebra and Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      185
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "145--156"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{c-fsnaq-83
-, author =	"Bernard Chazelle"
-, title =	"Filtering search: {A} new approach to query-answering"
-, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1983
-, pages =	"122--132"
-, precedes =	"c-fsnaq-86"
-, update =	"98.03 mitchell, 97.07 agarwal"
+, author =      "Bernard Chazelle"
+, title =       "Filtering search: {A} new approach to query-answering"
+, booktitle =   "Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1983
+, pages =       "122--132"
+, precedes =    "c-fsnaq-86"
+, update =      "98.03 mitchell, 97.07 agarwal"
 }
 
 @article{c-fsnaq-86
-, author =	"Bernard Chazelle"
-, title =	"Filtering search: a new approach to query-answering"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"703--724"
-, succeeds =	"c-fsnaq-83"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle"
+, title =       "Filtering search: a new approach to query-answering"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "703--724"
+, succeeds =    "c-fsnaq-83"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{c-gcdm-99
-, author =	"Bernard Chazelle"
-, title =	"Geometric Complexity and the Discrepancy Method"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"21--23"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Bernard Chazelle"
+, title =       "Geometric Complexity and the Discrepancy Method"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "21--23"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{c-gdr-93
-, author =	"Bernard Chazelle"
-, title =	"Geometric Discrepancy Revisited"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"392--399"
-, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Geometric Discrepancy Revisited"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "392--399"
+, update =      "98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @incollection{c-hsh-83
-, author =	"Bernard Chazelle"
-, title =	"How to search in history"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	158
-, year =	1983
-, pages =	"52--63"
-, precedes =	"c-hsh-85"
-, update =	"98.03 mitchell, 95.09 korneenko"
+, author =      "Bernard Chazelle"
+, title =       "How to search in history"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      158
+, year =        1983
+, pages =       "52--63"
+, precedes =    "c-hsh-85"
+, update =      "98.03 mitchell, 95.09 korneenko"
 }
 
 @article{c-hsh-85
-, author =	"Bernard Chazelle"
-, title =	"How to search in history"
-, journal =	"Inform. Control"
-, volume =	64
-, year =	1985
-, pages =	"77--99"
-, keywords =	"data structuring, search, dynamizing"
-, succeeds =	"c-hsh-83"
-, update =	"98.03 mitchell, 95.09 korneenko"
+, author =      "Bernard Chazelle"
+, title =       "How to search in history"
+, journal =     "Inform. Control"
+, volume =      64
+, year =        1985
+, pages =       "77--99"
+, keywords =    "data structuring, search, dynamizing"
+, succeeds =    "c-hsh-83"
+, update =      "98.03 mitchell, 95.09 korneenko"
 }
 
 @inproceedings{c-iies-84
-, author =	"Bernard Chazelle"
-, title =	"Intersecting is easier than sorting"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"125--134"
-, precedes =	"c-rcsi-86"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Intersecting is easier than sorting"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "125--134"
+, precedes =    "c-rcsi-86"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{c-lbolr-95
-, author =	"Bernard Chazelle"
-, title =	"Lower bounds for off-line range searching"
-, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
-, year =	1995
-, pages =	"733--740"
-, update =	"98.03 mitchell, 95.09 smid"
+, author =      "Bernard Chazelle"
+, title =       "Lower bounds for off-line range searching"
+, booktitle =   "Proc. 27th Annu. ACM Sympos. Theory Comput."
+, year =        1995
+, pages =       "733--740"
+, update =      "98.03 mitchell, 95.09 smid"
 }
 
 @article{c-lbolr-97
-, author =	"B. Chazelle"
-, title =	"Lower bounds for off-line range searching"
-, journal =	"Discrete Comput. Geom."
-, volume =	17
-, number =	1
-, year =	1997
-, pages =	"53--66"
-, update =	"98.07 bibrelex"
+, author =      "B. Chazelle"
+, title =       "Lower bounds for off-line range searching"
+, journal =     "Discrete Comput. Geom."
+, volume =      17
+, number =      1
+, year =        1997
+, pages =       "53--66"
+, update =      "98.07 bibrelex"
 }
 
 @article{c-lbors1-90
-, author =	"Bernard Chazelle"
-, title =	"Lower bounds for orthogonal range searching, {I}: {T}he reporting case"
-, journal =	"J. ACM"
-, volume =	37
-, year =	1990
-, pages =	"200--212"
-, succeeds =	"c-lbcms-86"
-, precedes =	"c-lbors2-90"
-, update =	"98.03 mitchell, 97.07 agarwal"
+, author =      "Bernard Chazelle"
+, title =       "Lower bounds for orthogonal range searching, {I}: {T}he reporting case"
+, journal =     "J. ACM"
+, volume =      37
+, year =        1990
+, pages =       "200--212"
+, succeeds =    "c-lbcms-86"
+, precedes =    "c-lbors2-90"
+, update =      "98.03 mitchell, 97.07 agarwal"
 }
 
 @article{c-lbors2-90
-, author =	"Bernard Chazelle"
-, title =	"Lower bounds for orthogonal range searching, {II}: {T}he arithmetic model"
-, journal =	"J. ACM"
-, volume =	37
-, year =	1990
-, pages =	"439--463"
-, succeeds =	"c-lbors1-90"
-, update =	"98.03 mitchell, 97.07 agarwal"
+, author =      "Bernard Chazelle"
+, title =       "Lower bounds for orthogonal range searching, {II}: {T}he arithmetic model"
+, journal =     "J. ACM"
+, volume =      37
+, year =        1990
+, pages =       "439--463"
+, succeeds =    "c-lbors1-90"
+, update =      "98.03 mitchell, 97.07 agarwal"
 }
 
 @inproceedings{c-lbcms-86
-, author =	"Bernard Chazelle"
-, title =	"Lower bounds on the complexity of multidimensional searching"
-, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1986
-, pages =	"87--96"
-, precedes =	"c-lbors1-90"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Lower bounds on the complexity of multidimensional searching"
+, booktitle =   "Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1986
+, pages =       "87--96"
+, precedes =    "c-lbors1-90"
+, update =      "98.03 mitchell"
 }
 
 @article{c-lbcpr-89
-, author =	"Bernard Chazelle"
-, title =	"Lower bounds on the complexity of polytope range searching"
-, journal =	"J. Amer. Math. Soc."
-, volume =	2
-, year =	1989
-, pages =	"637--666"
-, keywords =	"simplex range searching, integral geometry, lower bounds"
-, succeeds =	"c-prsig-87"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Lower bounds on the complexity of polytope range searching"
+, journal =     "J. Amer. Math. Soc."
+, volume =      2
+, year =        1989
+, pages =       "637--666"
+, keywords =    "simplex range searching, integral geometry, lower bounds"
+, succeeds =    "c-prsig-87"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{c-ntcos-85
-, author =	"Bernard Chazelle"
-, title =	"New techniques for computing order statistics in {Euclidean} space"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"125--134"
-, precedes =	"c-stgsi-87"
-, cites =	"bs-dcms-76, bfprt-tbs-73, bddg-fep-82, cgl-pgd-83, cw-mvdbs-84, c-sssl-83, dl-msp-76, eos-calha-83, fj-csrxm-82, fj-fkppc-83, fj-gsrsm-84, gm-fsapo-79, h-acca-77, jm-sktex-78, mt-fmvdb-83, mtzc-oaktn-81, oamb-oafme-84, ph-chfsp-77, s-gspi-76, t-oacmv-83, y-cmstk-82, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "Bernard Chazelle"
+, title =       "New techniques for computing order statistics in {Euclidean} space"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "125--134"
+, precedes =    "c-stgsi-87"
+, cites =       "bs-dcms-76, bfprt-tbs-73, bddg-fep-82, cgl-pgd-83, cw-mvdbs-84, c-sssl-83, dl-msp-76, eos-calha-83, fj-csrxm-82, fj-fkppc-83, fj-gsrsm-84, gm-fsapo-79, h-acca-77, jm-sktex-78, mt-fmvdb-83, mtzc-oaktn-81, oamb-oafme-84, ph-chfsp-77, s-gspi-76, t-oacmv-83, y-cmstk-82, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{c-clps-85
-, author =	"Bernard Chazelle"
-, title =	"On the convex layers of a planar set"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	"IT-31"
-, number =	4
-, month =	jul
-, year =	1985
-, pages =	"509--517"
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "On the convex layers of a planar set"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      "IT-31"
+, number =      4
+, month =       jul
+, year =        1985
+, pages =       "509--517"
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{c-pt-90i
-, author =	"B. Chazelle"
-, title =	"Polygon Triangulation"
-, booktitle =	"Proceedings of FOCCS"
-, year =	1990
-, precedes =	"c-ept-90, c-tsplt-90t"
-, update =	"98.07 bibrelex"
+, author =      "B. Chazelle"
+, title =       "Polygon Triangulation"
+, booktitle =   "Proceedings of FOCCS"
+, year =        1990
+, precedes =    "c-ept-90, c-tsplt-90t"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{c-prsig-87
-, author =	"Bernard Chazelle"
-, title =	"Polytope range searching and integral geometry"
-, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1987
-, pages =	"1--10"
-, precedes =	"c-lbcpr-89"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Polytope range searching and integral geometry"
+, booktitle =   "Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1987
+, pages =       "1--10"
+, precedes =    "c-lbcpr-89"
+, update =      "98.03 mitchell"
 }
 
 @article{c-rcsi-86
-, author =	"Bernard Chazelle"
-, title =	"Reporting and counting segment intersections"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	32
-, year =	1986
-, pages =	"156--182"
-, succeeds =	"c-iies-84"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Reporting and counting segment intersections"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      32
+, year =        1986
+, pages =       "156--182"
+, succeeds =    "c-iies-84"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{c-sdssf-85
-, author =	"Bernard Chazelle"
-, title =	"Slimming down search structures: {A} functional approach to algorithm design"
-, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"165--174"
-, keywords =	"searching, data structuring"
-, update =	"98.03 mitchell, 95.09 korneenko"
+, author =      "Bernard Chazelle"
+, title =       "Slimming down search structures: {A} functional approach to algorithm design"
+, booktitle =   "Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "165--174"
+, keywords =    "searching, data structuring"
+, update =      "98.03 mitchell, 95.09 korneenko"
 }
 
 @article{c-stgsi-87
-, author =	"Bernard Chazelle"
-, title =	"Some techniques for geometric searching with implicit set representations"
-, journal =	"Acta Inform."
-, volume =	24
-, year =	1987
-, pages =	"565--582"
-, succeeds =	"c-ntcos-85"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Some techniques for geometric searching with implicit set representations"
+, journal =     "Acta Inform."
+, volume =      24
+, year =        1987
+, pages =       "565--582"
+, succeeds =    "c-ntcos-85"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @article{c-blbph-83
-, author =	"Bernard Chazelle"
-, title =	"The bottom-left bin-packing heuristic: an efficient implementation"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-32"
-, year =	1983
-, pages =	"697--707"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "The bottom-left bin-packing heuristic: an efficient implementation"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-32"
+, year =        1983
+, pages =       "697--707"
+, update =      "98.03 mitchell"
 }
 
 @incollection{c-pcp-83
-, author =	"Bernard Chazelle"
-, title =	"The Polygon Containment Problem"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"1--33"
-, update =	"01.04 icking, 98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "The Polygon Containment Problem"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "1--33"
+, update =      "01.04 icking, 98.03 mitchell"
 }
 
 @techreport{c-ptapv-82
-, author =	"Bernard Chazelle"
-, title =	"The power of triangulation: applications to problems of visibility and internal distance"
-, type =	"Report"
-, number =	"CMU-CS-82-121"
-, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1982
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "The power of triangulation: applications to problems of visibility and internal distance"
+, type =        "Report"
+, number =      "CMU-CS-82-121"
+, institution = "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1982
+, update =      "98.03 mitchell"
 }
 
 @techreport{c-tbsns-88
-, author =	"Bernard Chazelle"
-, title =	"Tight bounds on the stabbing number of spanning trees in {Euclidean} space"
-, type =	"Report"
-, number =	"CS-TR-155-88"
-, institution =	"Dept. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1988
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Tight bounds on the stabbing number of spanning trees in {Euclidean} space"
+, type =        "Report"
+, number =      "CS-TR-155-88"
+, institution = "Dept. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1988
+, update =      "98.03 mitchell"
 }
 
 @techreport{c-tsplt-90t
-, author =	"Bernard Chazelle"
-, title =	"Triangulating a simple polygon in linear time"
-, type =	"Technical {Report}"
-, number =	"CS-TR-264-90"
-, institution =	"Dept. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1990
-, succeeds =	"c-pt-90i"
-, precedes =	"c-tsplt-90i"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Triangulating a simple polygon in linear time"
+, type =        "Technical {Report}"
+, number =      "CS-TR-264-90"
+, institution = "Dept. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1990
+, succeeds =    "c-pt-90i"
+, precedes =    "c-tsplt-90i"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{c-tsplt-90i
-, author =	"Bernard Chazelle"
-, title =	"Triangulating a simple polygon in linear time"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"220--230"
-, succeeds =	"c-tsplt-90t"
-, precedes =	"c-tsplt-91a"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Triangulating a simple polygon in linear time"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "220--230"
+, succeeds =    "c-tsplt-90t"
+, precedes =    "c-tsplt-91a"
+, update =      "98.03 mitchell"
 }
 
 @article{c-tsplt-91a
-, author =	"Bernard Chazelle"
-, title =	"Triangulating a simple polygon in linear time"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, number =	5
-, year =	1991
-, pages =	"485--524"
-, succeeds =	"c-tsplt-90i"
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "Bernard Chazelle"
+, title =       "Triangulating a simple polygon in linear time"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, number =      5
+, year =        1991
+, pages =       "485--524"
+, succeeds =    "c-tsplt-90i"
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{c-vigt-82
-, author =	"Bernard Chazelle"
-, title =	"{VLSI} implementations of geometric tasks"
-, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
-, year =	1982
-, pages =	"615--624"
-, keywords =	"parallel computation"
-, update =	"98.03 mitchell, 95.09 korneenko"
+, author =      "Bernard Chazelle"
+, title =       "{VLSI} implementations of geometric tasks"
+, booktitle =   "Proc. Allerton Conf. Commun. Control Comput."
+, year =        1982
+, pages =       "615--624"
+, keywords =    "parallel computation"
+, update =      "98.03 mitchell, 95.09 korneenko"
 }
 
 @techreport{cb-tsnis-92
-, author =	"Bernard Chazelle and R. Bar-Yehuda"
-, title =	"Triangulating a set of non-intersecting and simple polygonal chains"
-, type =	"Technical {Report}"
-, year =	1992
-, keywords =	"simple polygons, visibility, triangulation"
-, precedes =	"bc-tdjc-94"
-, update =	"98.03 mitchell, 95.09 mitchell, 93.09 milone+mitchell"
+, author =      "Bernard Chazelle and R. Bar-Yehuda"
+, title =       "Triangulating a set of non-intersecting and simple polygonal chains"
+, type =        "Technical {Report}"
+, year =        1992
+, keywords =    "simple polygons, visibility, triangulation"
+, precedes =    "bc-tdjc-94"
+, update =      "98.03 mitchell, 95.09 mitchell, 93.09 milone+mitchell"
 }
 
 @techreport{ccpy-nubns-84
-, author =	"Bernard Chazelle and R. Cole and F. P. Preparata and C. K. Yap"
-, title =	"New upper bounds for neighbor searching"
-, number =	"CS-84-11"
-, institution =	"Brown Univ."
-, address =	"Providence, RI"
-, year =	1984
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and R. Cole and F. P. Preparata and C. K. Yap"
+, title =       "New upper bounds for neighbor searching"
+, number =      "CS-84-11"
+, institution = "Brown Univ."
+, address =     "Providence, RI"
+, year =        1984
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{ccpy-nubns-86
-, author =	"Bernard Chazelle and R. Cole and F. P. Preparata and C. K. Yap"
-, title =	"New upper bounds for neighbor searching"
-, journal =	"Inform. Control"
-, volume =	68
-, year =	1986
-, pages =	"105--124"
-, keywords =	"locus approach, reporting, subdivisions, points, circles"
-, succeeds =	"cp-hrsaa-85"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "Bernard Chazelle and R. Cole and F. P. Preparata and C. K. Yap"
+, title =       "New upper bounds for neighbor searching"
+, journal =     "Inform. Control"
+, volume =      68
+, year =        1986
+, pages =       "105--124"
+, keywords =    "locus approach, reporting, subdivisions, points, circles"
+, succeeds =    "cp-hrsaa-85"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @inproceedings{cdhmst-sdtlt-01
-, author =	"Bernard Chazelle and Olivier Devillers and Ferran Hurtado and Merc{\`e} Mora and Vera Sacrist{\'a}n and Monique Teillaud"
-, title =	"Splitting a {Delaunay} Triangulation in Linear Time"
-, booktitle =	"Proc. 9th. European Symposiun on Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	2161
-, publisher =	"Springer-Verlag"
-, year =	2001
-, pages =	"312--320"
-, update =	"01.11 devillers"
+, author =      "Bernard Chazelle and Olivier Devillers and Ferran Hurtado and Merc{\`e} Mora and Vera Sacrist{\'a}n and Monique Teillaud"
+, title =       "Splitting a {Delaunay} Triangulation in Linear Time"
+, booktitle =   "Proc. 9th. European Symposiun on Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      2161
+, publisher =   "Springer-Verlag"
+, year =        2001
+, pages =       "312--320"
+, update =      "01.11 devillers"
 }
 
 @article{cdst-spsde-97
-, author =	"Bernard Chazelle and D. Dobkin and N. Shouraboura and A. Tal"
-, title =	"Strategies for polyhedral surface decomposition: An experimental study"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"327--342"
-, succeeds =	"cdst-spsde-95"
-, update =	"98.03 mitchell, 97.07 devillers"
+, author =      "Bernard Chazelle and D. Dobkin and N. Shouraboura and A. Tal"
+, title =       "Strategies for polyhedral surface decomposition: An experimental study"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "327--342"
+, succeeds =    "cdst-spsde-95"
+, update =      "98.03 mitchell, 97.07 devillers"
 }
 
 @inproceedings{cd-dpicp-79
-, author =	"Bernard Chazelle and D. P. Dobkin"
-, title =	"Decomposing a polygon into its convex parts"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
-, year =	1979
-, pages =	"38--48"
-, precedes =	"cd-ocd-85"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and D. P. Dobkin"
+, title =       "Decomposing a polygon into its convex parts"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Theory Comput."
+, year =        1979
+, pages =       "38--48"
+, precedes =    "cd-ocd-85"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cd-diec-80
-, author =	"Bernard Chazelle and D. P. Dobkin"
-, title =	"Detection is easier than computation"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Theory Comput."
-, year =	1980
-, pages =	"146--153"
-, precedes =	"cd-icott-87"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and D. P. Dobkin"
+, title =       "Detection is easier than computation"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Theory Comput."
+, year =        1980
+, pages =       "146--153"
+, precedes =    "cd-icott-87"
+, update =      "98.03 mitchell"
 }
 
 @article{cd-icott-87
-, author =	"Bernard Chazelle and D. P. Dobkin"
-, title =	"Intersection of convex objects in two and three dimensions"
-, journal =	"J. ACM"
-, volume =	34
-, number =	1
-, month =	jan
-, year =	1987
-, pages =	"1--27"
-, keywords =	"polygons, polyhedra, intersection, detection"
-, succeeds =	"cd-diec-80"
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "Bernard Chazelle and D. P. Dobkin"
+, title =       "Intersection of convex objects in two and three dimensions"
+, journal =     "J. ACM"
+, volume =      34
+, number =      1
+, month =       jan
+, year =        1987
+, pages =       "1--27"
+, keywords =    "polygons, polyhedra, intersection, detection"
+, succeeds =    "cd-diec-80"
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @incollection{cd-ocd-85
-, author =	"Bernard Chazelle and D. P. Dobkin"
-, title =	"Optimal convex decompositions"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"63--133"
-, succeeds =	"cd-dpicp-79"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and D. P. Dobkin"
+, title =       "Optimal convex decompositions"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "63--133"
+, succeeds =    "cd-dpicp-79"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cdst-csd-95
-, author =	"Bernard Chazelle and David P. Dobkin and Nadia Shouraboura and Ayellet Tal"
-, title =	"Convex Surface Decomposition"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"V9--V10"
-, keywords =	"video review"
-, cites =	"cdst-spsde-95, dt-gascg-94, td-gsvga-94, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Bernard Chazelle and David P. Dobkin and Nadia Shouraboura and Ayellet Tal"
+, title =       "Convex Surface Decomposition"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "V9--V10"
+, keywords =    "video review"
+, cites =       "cdst-spsde-95, dt-gascg-94, td-gsvga-94, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{cdst-spsde-95
-, author =	"Bernard Chazelle and David P. Dobkin and Nadia Shouraboura and Ayellet Tal"
-, title =	"Strategies for Polyhedral Surface Decomposition: {An} Experimental Study"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"297--305"
-, keywords =	"convex surfaces"
-, precedes =	"cdst-spsde-97"
-, cites =	"as-tsbac-90, as-car-92, -arm-92, bd-cdpr-92, b-ct-93, be-mgot-92i, beg-pgmg-90, c-cpplb-84, cp-tncp-90, cp-dag-94, cp-dbnp-92, cs-bst-94, dk-fdpi-83, fkn-vsgpt-80, o-agta-87, mv-qmgtd-92i, rs-dttdn-92, sh-ffbtp-93, swfcb-immcb-93, ZZZ"
-, update =	"98.03 bibrelex, 97.07 devillers, 95.09 mitchell"
+, author =      "Bernard Chazelle and David P. Dobkin and Nadia Shouraboura and Ayellet Tal"
+, title =       "Strategies for Polyhedral Surface Decomposition: {An} Experimental Study"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "297--305"
+, keywords =    "convex surfaces"
+, precedes =    "cdst-spsde-97"
+, cites =       "as-tsbac-90, as-car-92, -arm-92, bd-cdpr-92, b-ct-93, be-mgot-92i, beg-pgmg-90, c-cpplb-84, cp-tncp-90, cp-dag-94, cp-dbnp-92, cs-bst-94, dk-fdpi-83, fkn-vsgpt-80, o-agta-87, mv-qmgtd-92i, rs-dttdn-92, sh-ffbtp-93, swfcb-immcb-93, ZZZ"
+, update =      "98.03 bibrelex, 97.07 devillers, 95.09 mitchell"
 }
 
 @inproceedings{cdl-cler-84
-, author =	"Bernard Chazelle and R. L. {Drysdale, III} and D. T. Lee"
-, title =	"Computing the largest empty rectangle"
-, booktitle =	"Proc. 1st Sympos. Theoret. Aspects Comput. Sci."
-, nickname =	"STACS '84"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	166
-, publisher =	"Springer-Verlag"
-, year =	1984
-, pages =	"43--54"
-, keywords =	"rectangles, Voronoi diagrams"
-, precedes =	"cdl-cler-86"
-, update =	"98.11 bibrelex, 98.03 mitchell, 93.09 drysdale"
+, author =      "Bernard Chazelle and R. L. {Drysdale, III} and D. T. Lee"
+, title =       "Computing the largest empty rectangle"
+, booktitle =   "Proc. 1st Sympos. Theoret. Aspects Comput. Sci."
+, nickname =    "STACS '84"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      166
+, publisher =   "Springer-Verlag"
+, year =        1984
+, pages =       "43--54"
+, keywords =    "rectangles, Voronoi diagrams"
+, precedes =    "cdl-cler-86"
+, update =      "98.11 bibrelex, 98.03 mitchell, 93.09 drysdale"
 }
 
 @article{cdl-cler-86
-, author =	"Bernard Chazelle and R. L. {Drysdale, III} and D. T. Lee"
-, title =	"Computing the largest empty rectangle"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"300--315"
-, keywords =	"rectangles, Voronoi diagrams"
-, succeeds =	"cdl-cler-84"
-, update =	"98.03 mitchell, 93.09 drysdale"
+, author =      "Bernard Chazelle and R. L. {Drysdale, III} and D. T. Lee"
+, title =       "Computing the largest empty rectangle"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "300--315"
+, keywords =    "rectangles, Voronoi diagrams"
+, succeeds =    "cdl-cler-84"
+, update =      "98.03 mitchell, 93.09 drysdale"
 }
 
 @techreport{ce-falsi-87
-, author =	"B. Chazelle and H. Edelsbrunner"
-, title =	"A fast algorithm for line segment intersection and its extensions"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "B. Chazelle and H. Edelsbrunner"
+, title =       "A fast algorithm for line segment intersection and its extensions"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ce-iacko-85
-, author =	"Bernard Chazelle and H. Edelsbrunner"
-, title =	"An improved algorithm for constructing $k$th-order {Voronoi} diagrams"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"228--234"
-, precedes =	"ce-iacko-87"
-, cites =	"b-vdch-79, cgl-pgd-83, csy-khrp-84, e-cestd-84, eos-calha-83, ew-cbtda-86, l-knnvd-82, ol-mcp-81, s-cg-78, sh-cpp-75, v-nadpc-08, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and H. Edelsbrunner"
+, title =       "An improved algorithm for constructing $k$th-order {Voronoi} diagrams"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "228--234"
+, precedes =    "ce-iacko-87"
+, cites =       "b-vdch-79, cgl-pgd-83, csy-khrp-84, e-cestd-84, eos-calha-83, ew-cbtda-86, l-knnvd-82, ol-mcp-81, s-cg-78, sh-cpp-75, v-nadpc-08, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{ce-iacko-87
-, author =	"Bernard Chazelle and H. Edelsbrunner"
-, title =	"An improved algorithm for constructing $k$th-order {Voronoi} diagrams"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-36"
-, year =	1987
-, pages =	"1349--1354"
-, keywords =	"discrete geometry, design of algorithms, construction, geometric transformations, repeated search, Voronoi diagrams, two-dimensional, three-dimensional"
-, succeeds =	"ce-iacko-85"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner"
+, title =       "An improved algorithm for constructing $k$th-order {Voronoi} diagrams"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-36"
+, year =        1987
+, pages =       "1349--1354"
+, keywords =    "discrete geometry, design of algorithms, construction, geometric transformations, repeated search, Voronoi diagrams, two-dimensional, three-dimensional"
+, succeeds =    "ce-iacko-85"
+, update =      "98.03 mitchell"
 }
 
 @techreport{ce-oails-88t
-, author =	"Bernard Chazelle and H. Edelsbrunner"
-, title =	"An optimal algorithm for intersecting line segments in the plane"
-, type =	"Technical {Report}"
-, number =	"UIUCDCS-R-1419"
-, institution =	"Dept. Comput. Sci., Univ. of Illinois"
-, address =	"Urbana, IL"
-, month =	mar
-, year =	1988
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and H. Edelsbrunner"
+, title =       "An optimal algorithm for intersecting line segments in the plane"
+, type =        "Technical {Report}"
+, number =      "UIUCDCS-R-1419"
+, institution = "Dept. Comput. Sci., Univ. of Illinois"
+, address =     "Urbana, IL"
+, month =       mar
+, year =        1988
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{ce-oails-88
-, author =	"Bernard Chazelle and H. Edelsbrunner"
-, title =	"An optimal algorithm for intersecting line segments in the plane"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"590--600"
-, keywords =	"intersection, topological sweep, segments"
-, precedes =	"ce-oails-92"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner"
+, title =       "An optimal algorithm for intersecting line segments in the plane"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "590--600"
+, keywords =    "intersection, topological sweep, segments"
+, precedes =    "ce-oails-92"
+, update =      "98.03 mitchell"
 }
 
 @article{ce-oails-92
-, author =	"Bernard Chazelle and H. Edelsbrunner"
-, title =	"An optimal algorithm for intersecting line segments in the plane"
-, journal =	"J. ACM"
-, volume =	39
-, number =	1
-, year =	1992
-, pages =	"1--54"
-, keywords =	"intersection, topological sweep, segments"
-, succeeds =	"ce-oails-88"
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner"
+, title =       "An optimal algorithm for intersecting line segments in the plane"
+, journal =     "J. ACM"
+, volume =      39
+, number =      1
+, year =        1992
+, pages =       "1--54"
+, keywords =    "intersection, topological sweep, segments"
+, succeeds =    "ce-oails-88"
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{ce-lsdst-86
-, author =	"Bernard Chazelle and H. Edelsbrunner"
-, title =	"Linear space data structures for two types of range search"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"293--302"
-, precedes =	"ce-lsdst-87"
-, cites =	"b-mdc-80, c-fsnaq-83, c-fadsi-85, ce-oscpr-85a, cg-fcdst-84, cgl-pgd-83, de-ssio-84, egs-oplms-86, ew-hrsls-83, gbt-srtgp-84, gs-pmgsc-83, k-osps-83, klp-fmsv-75, lt-apst-80, m-pst-81, mp-fitcp-78, ns-picg-79, w-pr-82, y-3spia-83, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner"
+, title =       "Linear space data structures for two types of range search"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "293--302"
+, precedes =    "ce-lsdst-87"
+, cites =       "b-mdc-80, c-fsnaq-83, c-fadsi-85, ce-oscpr-85a, cg-fcdst-84, cgl-pgd-83, de-ssio-84, egs-oplms-86, ew-hrsls-83, gbt-srtgp-84, gs-pmgsc-83, k-osps-83, klp-fmsv-75, lt-apst-80, m-pst-81, mp-fitcp-78, ns-picg-79, w-pr-82, y-3spia-83, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{ce-lsdst-87
-, author =	"Bernard Chazelle and H. Edelsbrunner"
-, title =	"Linear space data structures for two types of range search"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"113--126"
-, keywords =	"data structuring, reporting, domination, range search, point location, directed acyclic graphs, two-dimensional, three-dimensional"
-, succeeds =	"ce-lsdst-86"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner"
+, title =       "Linear space data structures for two types of range search"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "113--126"
+, keywords =    "data structuring, reporting, domination, range search, point location, directed acyclic graphs, two-dimensional, three-dimensional"
+, succeeds =    "ce-lsdst-86"
+, update =      "98.03 mitchell"
 }
 
 @incollection{ce-oscpr-85a
-, author =	"Bernard Chazelle and H. Edelsbrunner"
-, title =	"Optimal solutions for a class of point retrieval problems"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	194
-, year =	1985
-, pages =	"80--89"
-, update =	"98.03 mitchell, 95.09 korneenko"
+, author =      "Bernard Chazelle and H. Edelsbrunner"
+, title =       "Optimal solutions for a class of point retrieval problems"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      194
+, year =        1985
+, pages =       "80--89"
+, update =      "98.03 mitchell, 95.09 korneenko"
 }
 
 @article{ce-oscpr-85
-, author =	"Bernard Chazelle and H. Edelsbrunner"
-, title =	"Optimal solutions for a class of point retrieval problems"
-, journal =	"J. Symbolic Comput."
-, volume =	1
-, year =	1985
-, pages =	"47--56"
-, keywords =	"data structuring, reporting, range search, directed acyclic graphs, translates"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner"
+, title =       "Optimal solutions for a class of point retrieval problems"
+, journal =     "J. Symbolic Comput."
+, volume =      1
+, year =        1985
+, pages =       "47--56"
+, keywords =    "data structuring, reporting, range search, directed acyclic graphs, translates"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cegghss-rspug-91
-, author =	"Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and J. Hershberger and Micha Sharir and J. Snoeyink"
-, title =	"Ray shooting in polygons using geodesic triangulations"
-, booktitle =	"Proc. 18th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	510
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"661--673"
-, keywords =	"ray shooting, simple polygon, geodesics"
-, update =	"98.03 mitchell, 93.09 rote"
+, author =      "Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and J. Hershberger and Micha Sharir and J. Snoeyink"
+, title =       "Ray shooting in polygons using geodesic triangulations"
+, booktitle =   "Proc. 18th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      510
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "661--673"
+, keywords =    "ray shooting, simple polygon, geodesics"
+, update =      "98.03 mitchell, 93.09 rote"
 }
 
 @article{cegghss-rspug-94
-, author =	"Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and J. Hershberger and Micha Sharir and J. Snoeyink"
-, title =	"Ray shooting in polygons using geodesic triangulations"
-, journal =	"Algorithmica"
-, volume =	12
-, year =	1994
-, pages =	"54--68"
-, keywords =	"ray shooting, simple polygon, geodesics"
-, succeeds =	"cegghss-rspug-91"
-, update =	"98.03 mitchell, 96.05 pocchiola+ramkumar"
+, author =      "Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and J. Hershberger and Micha Sharir and J. Snoeyink"
+, title =       "Ray shooting in polygons using geodesic triangulations"
+, journal =     "Algorithmica"
+, volume =      12
+, year =        1994
+, pages =       "54--68"
+, keywords =    "ray shooting, simple polygon, geodesics"
+, succeeds =    "cegghss-rspug-91"
+, update =      "98.03 mitchell, 96.05 pocchiola+ramkumar"
 }
 
 @inproceedings{ceggs-ibwen-93
-, author =	"Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and Micha Sharir"
-, title =	"Improved Bounds on Weak $\epsilon$-Nets for Convex Sets"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '93"
-, year =	1993
-, pages =	"495--504"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 agarwal+gaertner+salinger, 93.09 milone+mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and Micha Sharir"
+, title =       "Improved Bounds on Weak $\epsilon$-Nets for Convex Sets"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '93"
+, year =        1993
+, pages =       "495--504"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.03 agarwal+gaertner+salinger, 93.09 milone+mitchell"
 }
 
 @techreport{ceggss-rspug-90
-, author =	"Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and Micha Sharir and J. Snoeyink"
-, title =	"Ray shooting in polygons using geodesic triangulations"
-, type =	"Manuscript"
-, year =	1990
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and Micha Sharir and J. Snoeyink"
+, title =       "Ray shooting in polygons using geodesic triangulations"
+, type =        "Manuscript"
+, year =        1990
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{ceggsw-ibwen-95
-, author =	"Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
-, title =	"Improved bounds on weak $\epsilon$-nets for convex sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	13
-, year =	1995
-, pages =	"1--15"
-, update =	"98.03 mitchell, 96.05 smid"
+, author =      "Bernard Chazelle and H. Edelsbrunner and M. Grigni and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
+, title =       "Improved bounds on weak $\epsilon$-nets for convex sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      13
+, year =        1995
+, pages =       "1--15"
+, update =      "98.03 mitchell, 96.05 smid"
 }
 
 @article{ceghss-shcp-94
-, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and J. Hershberger and R. Seidel and M. Sharir"
-, title =	"Selecting heavily covered points"
-, journal =	"SIAM J. Comput."
-, volume =	23
-, year =	1994
-, pages =	"1138--1151"
-, update =	"98.07 bibrelex"
+, author =      "B. Chazelle and H. Edelsbrunner and L. Guibas and J. Hershberger and R. Seidel and M. Sharir"
+, title =       "Selecting heavily covered points"
+, journal =     "SIAM J. Comput."
+, volume =      23
+, year =        1994
+, pages =       "1138--1151"
+, update =      "98.07 bibrelex"
 }
 
 @article{cegs-plrav-89
-, author =	"B. Chazelle and H. Edelsbrunner and L. Guibas and M. Sharir"
-, title =	"Point location in real-algebraic varieties and its applications"
-, journal =	"ICALP"
-, volume =	"??"
-, year =	1989
-, update =	"98.03 bibrelex"
+, author =      "B. Chazelle and H. Edelsbrunner and L. Guibas and M. Sharir"
+, title =       "Point location in real-algebraic varieties and its applications"
+, journal =     "ICALP"
+, volume =      "??"
+, year =        1989
+, update =      "98.03 bibrelex"
 }
 
 @article{ceg-ccc-89
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas"
-, title =	"The complexity of cutting complexes"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"139--181"
-, keywords =	"discrete geometry, optimization, visibility, cell complexes, arrangements, polytopes, convex, three-dimensional, directed acyclic graphs"
-, succeeds =	"ceg-cccp-87"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas"
+, title =       "The complexity of cutting complexes"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "139--181"
+, keywords =    "discrete geometry, optimization, visibility, cell complexes, arrangements, polytopes, convex, three-dimensional, directed acyclic graphs"
+, succeeds =    "ceg-cccp-87"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ceg-cccp-87
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas"
-, title =	"The complexity of cutting convex polytopes"
-, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
-, year =	1987
-, pages =	"66--76"
-, keywords =	"discrete geometry, optimization, visibility, cell complexes, arrangements, polytopes, convex, three-dimensional, directed acyclic graphs"
-, precedes =	"ceg-ccc-89"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas"
+, title =       "The complexity of cutting convex polytopes"
+, booktitle =   "Proc. 19th Annu. ACM Sympos. Theory Comput."
+, year =        1987
+, pages =       "66--76"
+, keywords =    "discrete geometry, optimization, visibility, cell complexes, arrangements, polytopes, convex, three-dimensional, directed acyclic graphs"
+, precedes =    "ceg-ccc-89"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ceghss-sdash-90
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and J. E. Hershberger and R. Seidel and Micha Sharir"
-, title =	"Slimming down by adding; selecting heavily covered points"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"116--127"
-, cites =	"cff-aatdf-85, acegsw-ptphp-90, d-slsv-34, dv-cprac-77, e-narip1-83, e-acg-87, em-sstcd-90, f-ldead-72, gs-nsagv-69, ht-fafnc-84, h-uzztu-53, ms-pggrg-80, ps-cgi-85, sf-afem-73, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and J. E. Hershberger and R. Seidel and Micha Sharir"
+, title =       "Slimming down by adding; selecting heavily covered points"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "116--127"
+, cites =       "cff-aatdf-85, acegsw-ptphp-90, d-slsv-34, dv-cprac-77, e-narip1-83, e-acg-87, em-sstcd-90, f-ldead-72, gs-nsagv-69, ht-fafnc-84, h-uzztu-53, ms-pggrg-80, ps-cgi-85, sf-afem-73, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{cegpsss-cccll-??
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
-, title =	"Counting and Cutting Cycles of Lines and Line Segments in Space"
-, type =	"Technical {Report}"
-, year =	"??"
-, keywords =	"discrete and computational geometry, three dimensions, hidden surface removal, depth sort, line segments, lines, cycles, incidences"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
+, title =       "Counting and Cutting Cycles of Lines and Line Segments in Space"
+, type =        "Technical {Report}"
+, year =        "??"
+, keywords =    "discrete and computational geometry, three dimensions, hidden surface removal, depth sort, line segments, lines, cycles, incidences"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @inproceedings{cegpsss-ccclr-90
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
-, title =	"Counting and cutting cycles of lines and rods in space"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"242--251"
-, keywords =	"arrangements of lines in 3D, Plucker coordinates, convex hulls"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
+, title =       "Counting and cutting cycles of lines and rods in space"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "242--251"
+, keywords =    "arrangements of lines in 3D, Plucker coordinates, convex hulls"
+, update =      "98.03 mitchell"
 }
 
 @article{cegpsss-ccclr-92
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
-, title =	"Counting and cutting cycles of lines and rods in space"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, year =	1992
-, pages =	"305--323"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
+, title =       "Counting and cutting cycles of lines and rods in space"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, year =        1992
+, pages =       "305--323"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cegs-sessr-89
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"A singly-exponential stratification scheme for real semi-algebraic varieties and its applications"
-, booktitle =	"Proc. 16th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	372
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"179--193"
-, keywords =	"cell decomposition, random sampling, triangulation"
-, precedes =	"cegs-sessr-91"
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "A singly-exponential stratification scheme for real semi-algebraic varieties and its applications"
+, booktitle =   "Proc. 16th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      372
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "179--193"
+, keywords =    "cell decomposition, random sampling, triangulation"
+, precedes =    "cegs-sessr-91"
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @article{cegs-sessr-91
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"A singly-exponential stratification scheme for real semi-algebraic varieties and its applications"
-, journal =	"Theoret. Comput. Sci."
-, volume =	84
-, year =	1991
-, pages =	"77--105"
-, keywords =	"cell decomposition, random sampling, triangulation"
-, succeeds =	"cegs-sessr-89"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "A singly-exponential stratification scheme for real semi-algebraic varieties and its applications"
+, journal =     "Theoret. Comput. Sci."
+, volume =      84
+, year =        1991
+, pages =       "77--105"
+, keywords =    "cell decomposition, random sampling, triangulation"
+, succeeds =    "cegs-sessr-89"
+, update =      "98.03 mitchell"
 }
 
 @techreport{cegs-ablsp-89
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"Algorithms for bichromatic line segment problems and polyhedral terrains"
-, type =	"Report"
-, number =	"UIUCDCS-R-90-1578"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1989
-, keywords =	"arrangements, terrains, intersection problems"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "Algorithms for bichromatic line segment problems and polyhedral terrains"
+, type =        "Report"
+, number =      "UIUCDCS-R-90-1578"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1989
+, keywords =    "arrangements, terrains, intersection problems"
+, update =      "98.03 mitchell"
 }
 
 @article{cegs-ablsp-94
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"Algorithms for bichromatic line segment problems and polyhedral terrains"
-, journal =	"Algorithmica"
-, volume =	11
-, year =	1994
-, pages =	"116--132"
-, succeeds =	"cegs-ablsp-89"
-, update =	"98.03 mitchell, 94.05 matousek+sharir"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "Algorithms for bichromatic line segment problems and polyhedral terrains"
+, journal =     "Algorithmica"
+, volume =      11
+, year =        1994
+, pages =       "116--132"
+, succeeds =    "cegs-ablsp-89"
+, update =      "98.03 mitchell, 94.05 matousek+sharir"
 }
 
 @inproceedings{cegs-dwclp-92
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"Diameter, width, closest line pair, and parametric searching"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"120--129"
-, cites =	"aass-sdp-90, aesw-emstb-91, aest-cscpp-91, am-rsps-92, as-pglp-90, ast-apsgo-92, aps-zsha-93, c-ochan-91, cegs-lscaa-89, cegs-sessr-89, cegs-ablsp-94, cs-arscg-89, c-sdsno-87, csss-otass-89, csy-khrp-87, dmn-rass-92, egs-oplms-86, hw-ensrq-87, ht-cws-85, k-osps-83, m-ept-91, m-roass-91, m-aogdc-91, m-ccpps-91, m-loq-93, m-apcad-83, ns-cpcps-90, sw-frmrl-92, t-epcp-91, v-pcp-75, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "Diameter, width, closest line pair, and parametric searching"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "120--129"
+, cites =       "aass-sdp-90, aesw-emstb-91, aest-cscpp-91, am-rsps-92, as-pglp-90, ast-apsgo-92, aps-zsha-93, c-ochan-91, cegs-lscaa-89, cegs-sessr-89, cegs-ablsp-94, cs-arscg-89, c-sdsno-87, csss-otass-89, csy-khrp-87, dmn-rass-92, egs-oplms-86, hw-ensrq-87, ht-cws-85, k-osps-83, m-ept-91, m-roass-91, m-aogdc-91, m-ccpps-91, m-loq-93, m-apcad-83, ns-cpcps-90, sw-frmrl-92, t-epcp-91, v-pcp-75, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{cegs-dwclp-93
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"Diameter, width, closest line pair and parametric searching"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"183--196"
-, succeeds =	"cegs-dwclp-92"
-, update =	"98.03 mitchell, 94.01 matousek"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "Diameter, width, closest line pair and parametric searching"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "183--196"
+, succeeds =    "cegs-dwclp-92"
+, update =      "98.03 mitchell, 94.01 matousek"
 }
 
 @inproceedings{cegs-lscaa-89
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"Lines in space: combinatorics, algorithms, and applications"
-, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
-, year =	1989
-, pages =	"382--393"
-, keywords =	"arrangements of lines in 3D, Plucker coordinates, random sampling, convex hulls"
-, update =	"98.03 mitchell, 97.11 bibrelex, 96.09 smid"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "Lines in space: combinatorics, algorithms, and applications"
+, booktitle =   "Proc. 21st Annu. ACM Sympos. Theory Comput."
+, year =        1989
+, pages =       "382--393"
+, keywords =    "arrangements of lines in 3D, Plucker coordinates, random sampling, convex hulls"
+, update =      "98.03 mitchell, 97.11 bibrelex, 96.09 smid"
 }
 
 @inproceedings{cegss-cfals-91
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and J. Snoeyink"
-, title =	"Computing a face in an arrangement of line segments"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"441--448"
-, keywords =	"arrangements, randomized incremental algorithm"
-, precedes =	"cegss-cfals-93"
-, update =	"98.03 mitchell, 94.05 aronov"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and J. Snoeyink"
+, title =       "Computing a face in an arrangement of line segments"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "441--448"
+, keywords =    "arrangements, randomized incremental algorithm"
+, precedes =    "cegss-cfals-93"
+, update =      "98.03 mitchell, 94.05 aronov"
 }
 
 @article{cegss-cfals-93
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and J. Snoeyink"
-, title =	"Computing a face in an arrangement of line segments and related problems"
-, journal =	"SIAM J. Comput."
-, volume =	22
-, year =	1993
-, pages =	"1286--1302"
-, succeeds =	"cegss-cfals-91"
-, update =	"98.03 mitchell, 95.09 agarwal, 94.05 sharir, 94.01 matousek"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and J. Snoeyink"
+, title =       "Computing a face in an arrangement of line segments and related problems"
+, journal =     "SIAM J. Comput."
+, volume =      22
+, year =        1993
+, pages =       "1286--1302"
+, succeeds =    "cegss-cfals-91"
+, update =      "98.03 mitchell, 95.09 agarwal, 94.05 sharir, 94.01 matousek"
 }
 
 @article{cegss-lsca-96
-, author =	"Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and J. Stolfi"
-, title =	"Lines in space: {C}ombinatorics and algorithms"
-, journal =	"Algorithmica"
-, volume =	15
-, year =	1996
-, pages =	"428--447"
-, update =	"98.03 mitchell, 97.03 agarwal, 96.09 smid"
+, author =      "Bernard Chazelle and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and J. Stolfi"
+, title =       "Lines in space: {C}ombinatorics and algorithms"
+, journal =     "Algorithmica"
+, volume =      15
+, year =        1996
+, pages =       "428--447"
+, update =      "98.03 mitchell, 97.03 agarwal, 96.09 smid"
 }
 
 @techreport{cf-dvrsi-88t
-, author =	"Bernard Chazelle and J. Friedman"
-, title =	"A deterministic view of random sampling and its use in geometry"
-, type =	"Report"
-, number =	"CS-TR-181-88"
-, institution =	"??"
-, year =	1988
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and J. Friedman"
+, title =       "A deterministic view of random sampling and its use in geometry"
+, type =        "Report"
+, number =      "CS-TR-181-88"
+, institution = "??"
+, year =        1988
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{cf-dvrsi-88
-, author =	"Bernard Chazelle and J. Friedman"
-, title =	"A deterministic view of random sampling and its use in geometry"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"539--549"
-, keywords =	"point location, range search, $d$-dimensional"
-, precedes =	"cf-dvrsi-90"
-, update =	"98.03 mitchell"
-, annote =	"derandomizes with polynomial overhead"
+, author =      "Bernard Chazelle and J. Friedman"
+, title =       "A deterministic view of random sampling and its use in geometry"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "539--549"
+, keywords =    "point location, range search, $d$-dimensional"
+, precedes =    "cf-dvrsi-90"
+, update =      "98.03 mitchell"
+, annote =      "derandomizes with polynomial overhead"
 }
 
 @article{cf-dvrsi-90
-, author =	"Bernard Chazelle and J. Friedman"
-, title =	"A deterministic view of random sampling and its use in geometry"
-, journal =	"Combinatorica"
-, volume =	10
-, number =	3
-, year =	1990
-, pages =	"229--249"
-, keywords =	"point location, range search, $d$-dimensional"
-, succeeds =	"cf-dvrsi-88"
-, update =	"98.03 mitchell"
-, annote =	"derandomizes with polynomial overhead"
+, author =      "Bernard Chazelle and J. Friedman"
+, title =       "A deterministic view of random sampling and its use in geometry"
+, journal =     "Combinatorica"
+, volume =      10
+, number =      3
+, year =        1990
+, pages =       "229--249"
+, keywords =    "point location, range search, $d$-dimensional"
+, succeeds =    "cf-dvrsi-88"
+, update =      "98.03 mitchell"
+, annote =      "derandomizes with polynomial overhead"
 }
 
 @techreport{cf-plh-91
-, author =	"Bernard Chazelle and J. Friedman"
-, title =	"Point location among hyperplanes"
-, type =	"Manuscript"
-, year =	1991
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and J. Friedman"
+, title =       "Point location among hyperplanes"
+, type =        "Manuscript"
+, year =        1991
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{cf-plhur-94
-, author =	"Bernard Chazelle and J. Friedman"
-, title =	"Point Location among Hyperplanes and Unidirectional Ray-Shooting"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"53--62"
-, update =	"98.03 mitchell, 97.11 bibrelex, 95.01 matousek+smid"
+, author =      "Bernard Chazelle and J. Friedman"
+, title =       "Point Location among Hyperplanes and Unidirectional Ray-Shooting"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "53--62"
+, update =      "98.03 mitchell, 97.11 bibrelex, 95.01 matousek+smid"
 }
 
 @inproceedings{cg-fc-85
-, author =	"Bernard Chazelle and Leonidas J. Guibas"
-, title =	"Fractional Cascading"
-, booktitle =	"Proc. Internat. Colloq. Automata Lang. Program."
-, year =	1985
-, note =	"To appear"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and Leonidas J. Guibas"
+, title =       "Fractional Cascading"
+, booktitle =   "Proc. Internat. Colloq. Automata Lang. Program."
+, year =        1985
+, note =        "To appear"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{cg-fcdst-84
-, author =	"Bernard Chazelle and Leonidas J. Guibas"
-, title =	"Fractional Cascading: {A} data structuring technique with geometric applications"
-, booktitle =	"Efficicent Algorithms Workshop"
-, site =	"Oberwolfach, Germany"
-, year =	1984
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and Leonidas J. Guibas"
+, title =       "Fractional Cascading: {A} data structuring technique with geometric applications"
+, booktitle =   "Efficicent Algorithms Workshop"
+, site =        "Oberwolfach, Germany"
+, year =        1984
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{cg-fc1ds-86
-, author =	"Bernard Chazelle and Leonidas J. Guibas"
-, title =	"Fractional cascading: {I}. {A} data structuring technique"
-, journal =	"Algorithmica"
-, volume =	1
-, number =	3
-, year =	1986
-, pages =	"133--162"
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "Bernard Chazelle and Leonidas J. Guibas"
+, title =       "Fractional cascading: {I}. {A} data structuring technique"
+, journal =     "Algorithmica"
+, volume =      1
+, number =      3
+, year =        1986
+, pages =       "133--162"
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @article{cg-fc2a-86
-, author =	"Bernard Chazelle and Leonidas J. Guibas"
-, title =	"Fractional cascading: {II}. {Applications}"
-, journal =	"Algorithmica"
-, volume =	1
-, year =	1986
-, pages =	"163--191"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and Leonidas J. Guibas"
+, title =       "Fractional cascading: {II}. {Applications}"
+, journal =     "Algorithmica"
+, volume =      1
+, year =        1986
+, pages =       "163--191"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cg-vippg-85
-, author =	"Bernard Chazelle and Leonidas J. Guibas"
-, title =	"Visibility and intersection problems in plane geometry"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"135--146"
-, precedes =	"cg-vippg-89"
-, cites =	"c-tpca-82, c-cftvc-84, cg-fcdst-84, e-eacwv-84, grs-kfcg-83, ll-cvpe-84, egs-oplms-84, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and Leonidas J. Guibas"
+, title =       "Visibility and intersection problems in plane geometry"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "135--146"
+, precedes =    "cg-vippg-89"
+, cites =       "c-tpca-82, c-cftvc-84, cg-fcdst-84, e-eacwv-84, grs-kfcg-83, ll-cvpe-84, egs-oplms-84, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{cg-vippg-88
-, author =	"Bernard Chazelle and Leonidas J. Guibas"
-, title =	"Visibility and Intersection Problems in Plane Geometry"
-, type =	"Report"
-, number =	"CS-TR-167-88"
-, institution =	"Princeton Univ."
-, year =	1988
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and Leonidas J. Guibas"
+, title =       "Visibility and Intersection Problems in Plane Geometry"
+, type =        "Report"
+, number =      "CS-TR-167-88"
+, institution = "Princeton Univ."
+, year =        1988
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{cg-vippg-89
-, author =	"Bernard Chazelle and Leonidas J. Guibas"
-, title =	"Visibility and intersection problems in plane geometry"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"551--581"
-, succeeds =	"cg-vippg-85"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and Leonidas J. Guibas"
+, title =       "Visibility and intersection problems in plane geometry"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "551--581"
+, succeeds =    "cg-vippg-85"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cgl-pgd-83
-, author =	"Bernard Chazelle and Leonidas J. Guibas and D. T. Lee"
-, title =	"The power of geometric duality"
-, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1983
-, pages =	"217--225"
-, precedes =	"cgl-pgd-85"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and Leonidas J. Guibas and D. T. Lee"
+, title =       "The power of geometric duality"
+, booktitle =   "Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1983
+, pages =       "217--225"
+, precedes =    "cgl-pgd-85"
+, update =      "98.03 mitchell"
 }
 
 @article{cgl-pgd-85
-, author =	"Bernard Chazelle and Leonidas J. Guibas and D. T. Lee"
-, title =	"The power of geometric duality"
-, journal =	"BIT"
-, volume =	25
-, year =	1985
-, pages =	"76--90"
-, succeeds =	"cgl-pgd-83"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and Leonidas J. Guibas and D. T. Lee"
+, title =       "The power of geometric duality"
+, journal =     "BIT"
+, volume =      25
+, year =        1985
+, pages =       "76--90"
+, succeeds =    "cgl-pgd-83"
+, update =      "98.03 mitchell"
 }
 
 @article{ci-cccdr-84
-, author =	"Bernard Chazelle and J. Incerpi"
-, title =	"Computing connected components of {$D$}-ranges"
-, journal =	"Bull. EATCS"
-, volume =	22
-, year =	1984
-, pages =	"9--11"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and J. Incerpi"
+, title =       "Computing connected components of {$D$}-ranges"
+, journal =     "Bull. EATCS"
+, volume =      22
+, year =        1984
+, pages =       "9--11"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ci-tpdc-83
-, author =	"Bernard Chazelle and J. Incerpi"
-, title =	"Triangulating a Polygon by Divide and Conquer"
-, booktitle =	"Proc. 21st Allerton Conf. Commun. Control Comput."
-, year =	1983
-, pages =	"447--456"
-, update =	"98.03 mitchell"
-, annote =	"$O(n\log s)$ divide and conquer algorithm for Vertical
-		 Decomposition of a polygon (obtained by drawing a
-		 vertical line through each vertex). $s$ is sinuosity
-		 (number of times polygon alternates twists in different
-		 directions.)"
+, author =      "Bernard Chazelle and J. Incerpi"
+, title =       "Triangulating a Polygon by Divide and Conquer"
+, booktitle =   "Proc. 21st Allerton Conf. Commun. Control Comput."
+, year =        1983
+, pages =       "447--456"
+, update =      "98.03 mitchell"
+, annote =      "$O(n\log s)$ divide and conquer algorithm for Vertical
+                 Decomposition of a polygon (obtained by drawing a
+                 vertical line through each vertex). $s$ is sinuosity
+                 (number of times polygon alternates twists in different
+                 directions.)"
 }
 
 @article{ci-tsc-84
-, author =	"Bernard Chazelle and J. Incerpi"
-, title =	"Triangulation and shape-complexity"
-, journal =	"ACM Trans. Graph."
-, volume =	3
-, number =	2
-, year =	1984
-, pages =	"135--152"
-, keywords =	"triangulation, polygons, simple, decomposition, divide-and-conquer"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and J. Incerpi"
+, title =       "Triangulation and shape-complexity"
+, journal =     "ACM Trans. Graph."
+, volume =      3
+, number =      2
+, year =        1984
+, pages =       "135--152"
+, keywords =    "triangulation, polygons, simple, decomposition, divide-and-conquer"
+, update =      "98.03 mitchell"
 }
 
 @article{cl-cpp-86
-, author =	"Bernard Chazelle and D. T. Lee"
-, title =	"On a circle placement problem"
-, journal =	"Computing"
-, volume =	36
-, year =	1986
-, pages =	"1--16"
-, update =	"98.03 mitchell, 95.09 agarwal"
+, author =      "Bernard Chazelle and D. T. Lee"
+, title =       "On a circle placement problem"
+, journal =     "Computing"
+, volume =      36
+, year =        1986
+, pages =       "1--16"
+, update =      "98.03 mitchell, 95.09 agarwal"
 }
 
 @inproceedings{cl-tbhd-00
-, author =	"Bernard Chazelle and Alexey Lvov"
-, title =	"A Trace Bound for the Hereditary Discrepancy"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"64--69"
-, update =	"00.11 jones"
+, author =      "Bernard Chazelle and Alexey Lvov"
+, title =       "A Trace Bound for the Hereditary Discrepancy"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "64--69"
+, update =      "00.11 jones"
 }
 
 @techreport{cm-dosch-92
-, author =	"Bernard Chazelle and J. Matou{\v s}ek"
-, title =	"Derandomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions"
-, institution =	"Dept. Comput. Sci., Princeton Univ."
-, year =	1992
-, precedes =	"cm-dosch-95"
-, update =	"98.03 mitchell, 96.09 agarwal+devillers"
+, author =      "Bernard Chazelle and J. Matou{\v s}ek"
+, title =       "Derandomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions"
+, institution = "Dept. Comput. Sci., Princeton Univ."
+, year =        1992
+, precedes =    "cm-dosch-95"
+, update =      "98.03 mitchell, 96.09 agarwal+devillers"
 }
 
 @article{cm-dosch-95
-, author =	"Bernard Chazelle and J. Matou{\v s}ek"
-, title =	"Derandomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"27--32"
-, succeeds =	"cm-dosch-92"
-, update =	"98.03 mitchell, 96.09 devillers+orourke"
+, author =      "Bernard Chazelle and J. Matou{\v s}ek"
+, title =       "Derandomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "27--32"
+, succeeds =    "cm-dosch-92"
+, update =      "98.03 mitchell, 96.09 devillers+orourke"
 }
 
 @inproceedings{cm-ltdao-93
-, author =	"Bernard Chazelle and J. Matou{\v s}ek"
-, title =	"On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"281--290"
-, update =	"98.03 mitchell, 96.09 agarwal, 93.05 smid"
+, author =      "Bernard Chazelle and J. Matou{\v s}ek"
+, title =       "On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "281--290"
+, update =      "98.03 mitchell, 96.09 agarwal, 93.05 smid"
 }
 
 @article{cm-ltdao-96
-, author =	"Bernard Chazelle and J. Matou{\v s}ek"
-, title =	"On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension"
-, journal =	"J. Algorithms"
-, volume =	21
-, year =	1996
-, pages =	"579--597"
-, update =	"98.03 mitchell, 97.03 agarwal+smid, 96.09 agarwal, 93.05 smid"
+, author =      "Bernard Chazelle and J. Matou{\v s}ek"
+, title =       "On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension"
+, journal =     "J. Algorithms"
+, volume =      21
+, year =        1996
+, pages =       "579--597"
+, update =      "98.03 mitchell, 97.03 agarwal+smid, 96.09 agarwal, 93.05 smid"
 }
 
 @inproceedings{cm-mcvrc-81
-, author =	"Bernard Chazelle and L. Monier"
-, title =	"A model of computation for {VLSI} with related complexity results"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
-, year =	1981
-, pages =	"318--325"
-, precedes =	"cm-mcvrc-85"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and L. Monier"
+, title =       "A model of computation for {VLSI} with related complexity results"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Theory Comput."
+, year =        1981
+, pages =       "318--325"
+, precedes =    "cm-mcvrc-85"
+, update =      "98.03 mitchell"
 }
 
 @article{cm-mcvrc-85
-, author =	"Bernard Chazelle and L. Monier"
-, title =	"A model of computation for {VLSI} with related complexity results"
-, journal =	"J. ACM"
-, volume =	32
-, year =	1985
-, pages =	"573--588"
-, succeeds =	"cm-mcvrc-81"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and L. Monier"
+, title =       "A model of computation for {VLSI} with related complexity results"
+, journal =     "J. ACM"
+, volume =      32
+, year =        1985
+, pages =       "573--588"
+, succeeds =    "cm-mcvrc-81"
+, update =      "98.03 mitchell"
 }
 
 @techreport{c-accgc-96
-, author =	"Bernard Chazelle and others"
-, title =	"Application Challenges to Computational Geometry: {CG} Impact Task Force Report"
-, type =	"Technical {Report}"
-, number =	"TR-521-96"
-, institution =	"Princeton Univ."
-, month =	apr
-, year =	1996
-, url =	"http://www.cs.princeton.edu/~chazelle/taskforce/CGreport.ps"
-, comments =	"Also at \url{http://www.cs.duke.edu/~jeffe/compgeom/taskforce.html}"
-, update =	"98.03 mitchell, 97.03 pocchiola+tamassia, 96.09 orourke"
+, author =      "Bernard Chazelle and others"
+, title =       "Application Challenges to Computational Geometry: {CG} Impact Task Force Report"
+, type =        "Technical {Report}"
+, number =      "TR-521-96"
+, institution = "Princeton Univ."
+, month =       apr
+, year =        1996
+, url = "http://www.cs.princeton.edu/~chazelle/taskforce/CGreport.ps"
+, comments =    "Also at \url{http://www.cs.duke.edu/~jeffe/compgeom/taskforce.html}"
+, update =      "98.03 mitchell, 97.03 pocchiola+tamassia, 96.09 orourke"
 }
 
 @incollection{c-accgc-99
-, author =	"Bernard Chazelle and others"
-, title =	"Application Challenges to Computational Geometry: {CG} Impact Task Force Report"
-, editor =	"B. Chazelle and J. E. Goodman and R. Pollack"
-, booktitle =	"Advances in Discrete and Computational Geometry"
-, series =	"Contemporary Mathematics"
-, volume =	223
-, publisher =	"American Mathematical Society"
-, address =	"Providence"
-, year =	1999
-, pages =	"407--463"
-, update =	"00.03 smid"
+, author =      "Bernard Chazelle and others"
+, title =       "Application Challenges to Computational Geometry: {CG} Impact Task Force Report"
+, editor =      "B. Chazelle and J. E. Goodman and R. Pollack"
+, booktitle =   "Advances in Discrete and Computational Geometry"
+, series =      "Contemporary Mathematics"
+, volume =      223
+, publisher =   "American Mathematical Society"
+, address =     "Providence"
+, year =        1999
+, pages =       "407--463"
+, update =      "00.03 smid"
 }
 
 @inproceedings{cosw-cds-84
-, author =	"Bernard Chazelle and T. Ottmann and E. Soisalon-Soininen and D. Wood"
-, title =	"The complexity and decidability of {${\rm SEPARATION}^{\rm TM}$}"
-, booktitle =	"Proc. 11th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	172
-, publisher =	"Springer-Verlag"
-, year =	1984
-, pages =	"119--127"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and T. Ottmann and E. Soisalon-Soininen and D. Wood"
+, title =       "The complexity and decidability of {${\rm SEPARATION}^{\rm TM}$}"
+, booktitle =   "Proc. 11th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      172
+, publisher =   "Springer-Verlag"
+, year =        1984
+, pages =       "119--127"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cp-dbnp-92
-, author =	"Bernard Chazelle and L. Palios"
-, title =	"Decomposing the boundary of a nonconvex polyhedron"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"364--375"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and L. Palios"
+, title =       "Decomposing the boundary of a nonconvex polyhedron"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "364--375"
+, update =      "98.03 mitchell"
 }
 
 @incollection{cp-dag-94
-, author =	"B. Chazelle and L. Palios"
-, title =	"Decomposition algorithms in geometry"
-, chapter =	27
-, editor =	"C. Bajaj"
-, booktitle =	"Algebraic Geometry and its Applications"
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"419--447"
-, update =	"98.03 bibrelex"
+, author =      "B. Chazelle and L. Palios"
+, title =       "Decomposition algorithms in geometry"
+, chapter =     27
+, editor =      "C. Bajaj"
+, booktitle =   "Algebraic Geometry and its Applications"
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "419--447"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{cp-tncp-89
-, author =	"Bernard Chazelle and L. Palios"
-, title =	"Triangulating a non-convex polytope"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"393--400"
-, precedes =	"cp-tncp-90"
-, cites =	"as-tsbac-88, b-tdmgt-87, bgr-ntp-88, b-prcv-75, c-namrm-87, c-cpplb-84, c-ads-87, cegs-plrav-89, c-qercf-75, dl-pmtds-87, eos-calha-86, fp-dpscf-75, gs-pmgsc-85, l-pnrh-82, m-dsa-84, mp-fitcp-78, o-agta-87, ps-cgi-85, p-aicad-86, s-dpcs-78, ss-pmp2g-83, s-scgmm-88, w-esrav-57, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Bernard Chazelle and L. Palios"
+, title =       "Triangulating a non-convex polytope"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "393--400"
+, precedes =    "cp-tncp-90"
+, cites =       "as-tsbac-88, b-tdmgt-87, bgr-ntp-88, b-prcv-75, c-namrm-87, c-cpplb-84, c-ads-87, cegs-plrav-89, c-qercf-75, dl-pmtds-87, eos-calha-86, fp-dpscf-75, gs-pmgsc-85, l-pnrh-82, m-dsa-84, mp-fitcp-78, o-agta-87, ps-cgi-85, p-aicad-86, s-dpcs-78, ss-pmp2g-83, s-scgmm-88, w-esrav-57, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{cp-tncp-90
-, author =	"Bernard Chazelle and L. Palios"
-, title =	"Triangulating a non-convex polytope"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"505--526"
-, succeeds =	"cp-tncp-89"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and L. Palios"
+, title =       "Triangulating a non-convex polytope"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "505--526"
+, succeeds =    "cp-tncp-89"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cp-hrsaa-85
-, author =	"Bernard Chazelle and F. P. Preparata"
-, title =	"Halfspace range search: {An} algorithmic application of $k$-sets"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"107--115"
-, precedes =	"cp-hrsaa-86, ccpy-nubns-86"
-, cites =	"bm-nenns-79, c-fsnaq-83, c-ccdga-84, ccpy-nubns-84, cgl-pgd-83, cy-grp-83, e-agc-, eos-calha-83, elss-dgpps-73, l-knnvd-82, ps-cgi-85, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "Bernard Chazelle and F. P. Preparata"
+, title =       "Halfspace range search: {An} algorithmic application of $k$-sets"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "107--115"
+, precedes =    "cp-hrsaa-86, ccpy-nubns-86"
+, cites =       "bm-nenns-79, c-fsnaq-83, c-ccdga-84, ccpy-nubns-84, cgl-pgd-83, cy-grp-83, e-agc-, eos-calha-83, elss-dgpps-73, l-knnvd-82, ps-cgi-85, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{cp-hrsaa-86
-, author =	"Bernard Chazelle and F. P. Preparata"
-, title =	"Halfspace range search: {An} algorithmic application of $k$-sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"83--93"
-, succeeds =	"cp-hrsaa-85"
-, update =	"98.07 agarwal, 98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and F. P. Preparata"
+, title =       "Halfspace range search: {An} algorithmic application of $k$-sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "83--93"
+, succeeds =    "cp-hrsaa-85"
+, update =      "98.07 agarwal, 98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{cr-cpsma-89
-, author =	"Bernard Chazelle and B. Rosenberg"
-, title =	"Computing partial sums in multidimensional arrays"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"131--139"
-, precedes =	"cr-ccpso-91"
-, cites =	"ass-sulbl-89, as-opaol-87, b-dsp-79, b-mdc-80, bm-ewcds-80, c-fsnaq-86, c-lbcms-86, cg-fc2a-86, c-fadsi-88, f-lbcor-81, hs-ndssg-86, l-dsorq-78, m-dsa-84, o-ddds-83, t-egbnl-75, t-cmncc-78, v-sttor-85, w-ndsor-85, wl-arrcd-85, w-lbdrq-86, y-sttoa-82, y-cmps-85, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Bernard Chazelle and B. Rosenberg"
+, title =       "Computing partial sums in multidimensional arrays"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "131--139"
+, precedes =    "cr-ccpso-91"
+, cites =       "ass-sulbl-89, as-opaol-87, b-dsp-79, b-mdc-80, bm-ewcds-80, c-fsnaq-86, c-lbcms-86, cg-fc2a-86, c-fadsi-88, f-lbcor-81, hs-ndssg-86, l-dsorq-78, m-dsa-84, o-ddds-83, t-egbnl-75, t-cmncc-78, v-sttor-85, w-ndsor-85, wl-arrcd-85, w-lbdrq-86, y-sttoa-82, y-cmps-85, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @incollection{cr-lbcsr-92
-, author =	"Bernard Chazelle and B. Rosenberg"
-, title =	"Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine"
-, booktitle =	"Proc. 19th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	623
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"439--449"
-, note =	"Also to appear in {\em Comput. Geom. Theory Appl.}"
-, update =	"98.03 mitchell, 94.01 smid, 93.09 matousek+milone+mitchell"
+, author =      "Bernard Chazelle and B. Rosenberg"
+, title =       "Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine"
+, booktitle =   "Proc. 19th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      623
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "439--449"
+, note =        "Also to appear in {\em Comput. Geom. Theory Appl.}"
+, update =      "98.03 mitchell, 94.01 smid, 93.09 matousek+milone+mitchell"
 }
 
 @article{cr-srrpm-96
-, author =	"Bernard Chazelle and B. Rosenberg"
-, title =	"Simplex range reporting on a pointer machine"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1996
-, pages =	"237--247"
-, update =	"98.03 mitchell, 96.09 devillers"
+, author =      "Bernard Chazelle and B. Rosenberg"
+, title =       "Simplex range reporting on a pointer machine"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1996
+, pages =       "237--247"
+, update =      "98.03 mitchell, 96.09 devillers"
 }
 
 @article{cr-ccpso-91
-, author =	"Bernard Chazelle and B. Rosenberg"
-, title =	"The complexity of computing partial sums off-line"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	1
-, year =	1991
-, pages =	"33--45"
-, keywords =	"partial sums, lower bounds, orthogonal range searching"
-, succeeds =	"cr-cpsma-89"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and B. Rosenberg"
+, title =       "The complexity of computing partial sums off-line"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      1
+, year =        1991
+, pages =       "33--45"
+, keywords =    "partial sums, lower bounds, orthogonal range searching"
+, succeeds =    "cr-cpsma-89"
+, update =      "98.03 mitchell"
 }
 
 @article{cs-agpli-90
-, author =	"Bernard Chazelle and Micha Sharir"
-, title =	"An algorithm for generalized point location and its application"
-, journal =	"J. Symbolic Comput."
-, volume =	10
-, year =	1990
-, pages =	"281--309"
-, keywords =	"algebraic varieties, point location, cylindrical algebraic decomposition"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and Micha Sharir"
+, title =       "An algorithm for generalized point location and its application"
+, journal =     "J. Symbolic Comput."
+, volume =      10
+, year =        1990
+, pages =       "281--309"
+, keywords =    "algebraic varieties, point location, cylindrical algebraic decomposition"
+, update =      "98.03 mitchell"
 }
 
 @techreport{cs-agpli-88
-, author =	"Bernard Chazelle and Micha Sharir"
-, title =	"An algorithm for generalized point location and its applications"
-, type =	"Technical {Report}"
-, number =	153
-, institution =	"Robotics Lab., Courant Inst. Math. Sci."
-, address =	"New York, NY"
-, month =	may
-, year =	1988
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and Micha Sharir"
+, title =       "An algorithm for generalized point location and its applications"
+, type =        "Technical {Report}"
+, number =      153
+, institution = "Robotics Lab., Courant Inst. Math. Sci."
+, address =     "New York, NY"
+, month =       may
+, year =        1988
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{csw-qoubs-90
-, author =	"Bernard Chazelle and Micha Sharir and Emo Welzl"
-, title =	"Quasi-optimal upper bounds for simplex range searching and new zone theorems"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"23--33"
-, cites =	"a-idaac-89, as-tsbac-88, c-lbcpr-89, cegs-sessr-89, cf-dvrsi-90, cp-tncp-89, cw-qorss-89, c-narsc-87, c-racpq-88, cegsw-ccbac-88, cs-arscg-89, c-sssl-86, cy-grp-84, e-acg-87, e-ueplf-89, eghsssw-irals-88, egs-ueplf-89, eos-calha-86, ew-hrsls-86, hw-ensrq-87, m-mdscg-84, ps-ueplf-89, py-prp-86, pss-stsps-88, w-pr-82, y-3spia-83, yy-gaddg-85, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Bernard Chazelle and Micha Sharir and Emo Welzl"
+, title =       "Quasi-optimal upper bounds for simplex range searching and new zone theorems"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "23--33"
+, cites =       "a-idaac-89, as-tsbac-88, c-lbcpr-89, cegs-sessr-89, cf-dvrsi-90, cp-tncp-89, cw-qorss-89, c-narsc-87, c-racpq-88, cegsw-ccbac-88, cs-arscg-89, c-sssl-86, cy-grp-84, e-acg-87, e-ueplf-89, eghsssw-irals-88, egs-ueplf-89, eos-calha-86, ew-hrsls-86, hw-ensrq-87, m-mdscg-84, ps-ueplf-89, py-prp-86, pss-stsps-88, w-pr-82, y-3spia-83, yy-gaddg-85, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{csw-qoubs-92
-, author =	"Bernard Chazelle and Micha Sharir and Emo Welzl"
-, title =	"Quasi-optimal upper bounds for simplex range searching and new zone theorems"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"407--429"
-, succeeds =	"csw-qoubs-90"
-, update =	"98.03 mitchell, 93.09 matousek"
+, author =      "Bernard Chazelle and Micha Sharir and Emo Welzl"
+, title =       "Quasi-optimal upper bounds for simplex range searching and new zone theorems"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "407--429"
+, succeeds =    "csw-qoubs-90"
+, update =      "98.03 mitchell, 93.09 matousek"
 }
 
 @inproceedings{cs-bst-94
-, author =	"Bernard Chazelle and N. Shouraboura"
-, title =	"Bounds on the Size of Tetrahedralizations"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"231--239"
-, cites =	"as-tsbac-90, as-ucptd-93, as-car-92, bd-cdpr-92, b-ct-93, c-cpplb-84, c-oaitd-92, cp-tncp-90, d-tcrpa-91, dk-fdpi-83, dl-pmtds-89, m-spai3-91, m-mdscg-84, m-cgitr-93, p-bcspi-93, rs-dttdn-92, s-udzvd-28, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
+, author =      "Bernard Chazelle and N. Shouraboura"
+, title =       "Bounds on the Size of Tetrahedralizations"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "231--239"
+, cites =       "as-tsbac-90, as-ucptd-93, as-car-92, bd-cdpr-92, b-ct-93, c-cpplb-84, c-oaitd-92, cp-tncp-90, d-tcrpa-91, dk-fdpi-83, dl-pmtds-89, m-spai3-91, m-mdscg-84, m-cgitr-93, p-bcspi-93, rs-dttdn-92, s-udzvd-28, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
 }
 
 @article{cw-qorss-89
-, author =	"Bernard Chazelle and Emo Welzl"
-, title =	"Quasi-optimal range searching in spaces of finite {VC}-dimension"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"467--489"
-, succeeds =	"cw-rsvdc-88"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and Emo Welzl"
+, title =       "Quasi-optimal range searching in spaces of finite {VC}-dimension"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "467--489"
+, succeeds =    "cw-rsvdc-88"
+, update =      "98.03 mitchell"
 }
 
 @techreport{cw-rsvdc-88
-, author =	"Bernard Chazelle and Emo Welzl"
-, title =	"Range searching and {VC}-dimension: a characterization of efficiency"
-, type =	"Report"
-, number =	"B-88-09"
-, institution =	"Fachber. Math., Free Univ. Berlin"
-, address =	"Berlin, West Germany"
-, month =	nov
-, year =	1988
-, precedes =	"cw-qorss-89"
-, update =	"98.03 mitchell"
+, author =      "Bernard Chazelle and Emo Welzl"
+, title =       "Range searching and {VC}-dimension: a characterization of efficiency"
+, type =        "Report"
+, number =      "B-88-09"
+, institution = "Fachber. Math., Free Univ. Berlin"
+, address =     "Berlin, West Germany"
+, month =       nov
+, year =        1988
+, precedes =    "cw-qorss-89"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cdgp-icms-2014
-, author =	{Panagiotis Cheilaris and Sandeep Kumar Dey and
+, author =      {Panagiotis Cheilaris and Sandeep Kumar Dey and
                  Maria Gabrani and Evanthia Papadopoulou}
-, title =	{Implementing the {L}$\infty$ segment {Voronoi} diagram
+, title =       {Implementing the {L}$\infty$ segment {Voronoi} diagram
                  in {CGAL} and an application in {VLSI} pattern analysis}
-, booktitle =	{Proc. 4th International Congress on Mathematical
+, booktitle =   {Proc. 4th International Congress on Mathematical
                  Software (ICMS)}
-, year =	2014
-, pages =	"198--205"
+, year =        2014
+, pages =       "198--205"
 }
 
 @article{cs-rpudr-83
-, author =	"O. Chein and L. Steinberg"
-, title =	"Routing past unions of disjoint rectilinear barriers"
-, journal =	"Networks"
-, volume =	13
-, number =	3
-, year =	1983
-, pages =	"389--398"
-, keywords =	"isothetic, routing, VLSI design"
-, update =	"95.09 korneenko"
+, author =      "O. Chein and L. Steinberg"
+, title =       "Routing past unions of disjoint rectilinear barriers"
+, journal =     "Networks"
+, volume =      13
+, number =      3
+, year =        1983
+, pages =       "389--398"
+, keywords =    "isothetic, routing, VLSI design"
+, update =      "95.09 korneenko"
 }
 
 @article{cld-patip-91
-, author =	"?. Chen and T. Ling and L. S. Davis"
-, title =	"Parallel algorithms for testing if a point is inside a closed curve"
-, journal =	"Pattern Recogn. Lett."
-, volume =	12
-, number =	2
-, year =	1991
-, pages =	"73--77"
-, keywords =	"point location, parallel computation, digital geometry"
-, update =	"95.09 korneenko"
+, author =      "?. Chen and T. Ling and L. S. Davis"
+, title =       "Parallel algorithms for testing if a point is inside a closed curve"
+, journal =     "Pattern Recogn. Lett."
+, volume =      12
+, number =      2
+, year =        1991
+, pages =       "73--77"
+, keywords =    "point location, parallel computation, digital geometry"
+, update =      "95.09 korneenko"
 }
 
 @article{cc-mpt-90
-, author =	"Chiuyuan Chen and Ruei-Chuan Chang"
-, title =	"On the Minimality of Polygon Triangulation"
-, journal =	"BIT"
-, volume =	30
-, year =	1990
-, pages =	"570--582"
-, annote =	"Triangulate polygon into minimum number of triangles.
-		 $O(n\log^2 n+DK^2)$. $D$ is maximum number of vertices
-		 on same line. $K$ is number of degenerate triangles."
+, author =      "Chiuyuan Chen and Ruei-Chuan Chang"
+, title =       "On the Minimality of Polygon Triangulation"
+, journal =     "BIT"
+, volume =      30
+, year =        1990
+, pages =       "570--582"
+, annote =      "Triangulate polygon into minimum number of triangles.
+                 $O(n\log^2 n+DK^2)$. $D$ is maximum number of vertices
+                 on same line. $K$ is number of degenerate triangles."
 }
 
 @article{c-cchsp-89
-, author =	"C.-L. Chen"
-, title =	"Computing the convex hull of a simple polygon"
-, journal =	"Pattern Recogn. Lett."
-, volume =	22
-, number =	5
-, year =	1989
-, pages =	"561--566"
-, note =	"erratic"
-, keywords =	"convex hull, simple, polygon"
-, update =	"95.09 korneenko"
+, author =      "C.-L. Chen"
+, title =       "Computing the convex hull of a simple polygon"
+, journal =     "Pattern Recogn. Lett."
+, volume =      22
+, number =      5
+, year =        1989
+, pages =       "561--566"
+, note =        "erratic"
+, keywords =    "convex hull, simple, polygon"
+, update =      "95.09 korneenko"
 }
 
 @article{c-egaep-95
-, author =	"D. Chen"
-, title =	"Efficient geometric algorithms on the {EREW PRAM}"
-, journal =	"IEEE Trans. Parallel Distrib. Syst."
-, volume =	6
-, number =	1
-, year =	1995
-, pages =	"41--47"
-, update =	"96.09 orourke"
+, author =      "D. Chen"
+, title =       "Efficient geometric algorithms on the {EREW PRAM}"
+, journal =     "IEEE Trans. Parallel Distrib. Syst."
+, volume =      6
+, number =      1
+, year =        1995
+, pages =       "41--47"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{c-opadw-92
-, author =	"D. Z. Chen"
-, title =	"An optimal parallel algorithm for detecting weak visibility of a simple polygon"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"63--72"
-, precedes =	"c-opadw-95"
-, cites =	"ag-pasft-88, at-oadvp-81, bmt-ltacs-91, cg-vippg-89, c-egaep-90, ckt-cgp-89, cg-opapp-88, g-fchsp-87, g-tpp-89, g-psppt-92, gsg-pmvsp-90, ghlst-ltavs-87, gmpsv-cwvpr-90t, hm-svpap-90, k-dwvsp-88, krs-ppp-85a, lf-ppc-80, ll-cvpe-84, lp-oafkp-79, ol-mcp-81, ps-cgi-85, ss-oadwv-90, t-ltass-86a, y-ptptc-88, ZZZ"
-, update =	"97.11 bibrelex, 96.09 devillers"
+, author =      "D. Z. Chen"
+, title =       "An optimal parallel algorithm for detecting weak visibility of a simple polygon"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "63--72"
+, precedes =    "c-opadw-95"
+, cites =       "ag-pasft-88, at-oadvp-81, bmt-ltacs-91, cg-vippg-89, c-egaep-90, ckt-cgp-89, cg-opapp-88, g-fchsp-87, g-tpp-89, g-psppt-92, gsg-pmvsp-90, ghlst-ltavs-87, gmpsv-cwvpr-90t, hm-svpap-90, k-dwvsp-88, krs-ppp-85a, lf-ppc-80, ll-cvpe-84, lp-oafkp-79, ol-mcp-81, ps-cgi-85, ss-oadwv-90, t-ltass-86a, y-ptptc-88, ZZZ"
+, update =      "97.11 bibrelex, 96.09 devillers"
 }
 
 @article{c-opadw-95
-, author =	"D. Z. Chen"
-, title =	"An optimal parallel algorithm for detecting weak visibility of a simple polygon"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"93--124"
-, keywords =	"computational geometry, CREW PRAM, parallel algorithms, simple polygons, weak visibility"
-, succeeds =	"c-opadw-92"
-, update =	"96.09 devillers"
+, author =      "D. Z. Chen"
+, title =       "An optimal parallel algorithm for detecting weak visibility of a simple polygon"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "93--124"
+, keywords =    "computational geometry, CREW PRAM, parallel algorithms, simple polygons, weak visibility"
+, succeeds =    "c-opadw-92"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{c-dwevp-94
-, author =	"D. Z. Chen"
-, title =	"Determining Weak External Visibility of Polygons in Parallel"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"375--380"
-, precedes =	"c-dwvpe-98"
-, cites =	"bcetsu-csts-91, bkt-dsvp-89, bt-cst-90t, c-ptpvr-92, c-egaep-90, c-opadw-92, c-ocswv-93, g-fchsp-87, ta-chapi-82, acw-opavs-91, bmt-ltacs-91, ZZZ"
-, update =	"98.11 bibrelex+devillers, 94.09 jones"
+, author =      "D. Z. Chen"
+, title =       "Determining Weak External Visibility of Polygons in Parallel"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "375--380"
+, precedes =    "c-dwvpe-98"
+, cites =       "bcetsu-csts-91, bkt-dsvp-89, bt-cst-90t, c-ptpvr-92, c-egaep-90, c-opadw-92, c-ocswv-93, g-fchsp-87, ta-chapi-82, acw-opavs-91, bmt-ltacs-91, ZZZ"
+, update =      "98.11 bibrelex+devillers, 94.09 jones"
 }
 
 @article{c-dwvpe-98
-, author =	"D. Z. Chen"
-, title =	"Determining Weak Visibility of a Polygon from an Edge in Parallel"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"277--304"
-, succeeds =	"c-dwevp-94"
-, update =	"98.11 devillers"
+, author =      "D. Z. Chen"
+, title =       "Determining Weak Visibility of a Polygon from an Edge in Parallel"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "277--304"
+, succeeds =    "c-dwevp-94"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{c-egaep-90
-, author =	"D. Z. Chen"
-, title =	"Efficient geometric algorithms in the {EREW}-{PRAM}"
-, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
-, year =	1990
-, pages =	"818--827"
-, keywords =	"parallel computation"
-, update =	"95.09 korneenko"
+, author =      "D. Z. Chen"
+, title =       "Efficient geometric algorithms in the {EREW}-{PRAM}"
+, booktitle =   "Proc. Allerton Conf. Commun. Control Comput."
+, year =        1990
+, pages =       "818--827"
+, keywords =    "parallel computation"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{c-apesp-95
-, author =	"Danny Z. Chen"
-, title =	"On the All-Pairs {Euclidean} Short Path Problem"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"292--301"
-, keywords =	"shortest paths among obstacles, two-point query, approximation algorithm"
-, update =	"98.03 mitchell, 96.09 agarwal, 96.05 mitchell"
-, abstract =	"
+, author =      "Danny Z. Chen"
+, title =       "On the All-Pairs {Euclidean} Short Path Problem"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "292--301"
+, keywords =    "shortest paths among obstacles, two-point query, approximation algorithm"
+, update =      "98.03 mitchell, 96.09 agarwal, 96.05 mitchell"
+, abstract =    "
 Given a set of polygonal obstacles of $n$ vertices in the plane,
 the problem of processing the all-pairs Euclidean {\em short} path
 queries is that of reporting an obstacle-avoiding path $P$ (or
@@ -33610,756 +33610,756 @@ @inproceedings{c-apesp-95
 }
 
 @techreport{c-ocswv-92
-, author =	"D. Z. Chen"
-, title =	"Optimally computing the shortest weakly visible subedge of a simple polygon"
-, type =	"Technical {Report}"
-, number =	"92-028"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, month =	may
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "D. Z. Chen"
+, title =       "Optimally computing the shortest weakly visible subedge of a simple polygon"
+, type =        "Technical {Report}"
+, number =      "92-028"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, month =       may
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{c-ocswv-93
-, author =	"Danny Z. Chen"
-, title =	"Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"323--332"
-, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Danny Z. Chen"
+, title =       "Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "323--332"
+, update =      "98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @article{c-ocswv-96
-, author =	"Danny Z. Chen"
-, title =	"Optimally computing the shortest weakly visible subedge of a simple polygon"
-, journal =	"J. Algorithms"
-, volume =	20
-, year =	1996
-, pages =	"459--478"
-, update =	"97.03 smid"
+, author =      "Danny Z. Chen"
+, title =       "Optimally computing the shortest weakly visible subedge of a simple polygon"
+, journal =     "J. Algorithms"
+, volume =      20
+, year =        1996
+, pages =       "459--478"
+, update =      "97.03 smid"
 }
 
 @techreport{c-ptpvr-92
-, author =	"D. Z. Chen"
-, title =	"Parallel techniques for paths, visibility, and related problems"
-, type =	"Technical Report"
-, number =	"92-051"
-, institution =	"Dept. of Computer Sciences, Purdue University"
-, month =	jul
-, year =	1992
-, note =	"Ph.D. Thesis"
-, update =	"98.11 bibrelex"
+, author =      "D. Z. Chen"
+, title =       "Parallel techniques for paths, visibility, and related problems"
+, type =        "Technical Report"
+, number =      "92-051"
+, institution = "Dept. of Computer Sciences, Purdue University"
+, month =       jul
+, year =        1992
+, note =        "Ph.D. Thesis"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ccwk-papss-96
-, author =	"D. Z. Chen and W. Chen and K. Wada and K. Kawaguchi"
-, title =	"Parallel algorithms for partitioning sorted sets and related problems"
-, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1136
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"234--245"
-, update =	"97.03 smid"
+, author =      "D. Z. Chen and W. Chen and K. Wada and K. Kawaguchi"
+, title =       "Parallel algorithms for partitioning sorted sets and related problems"
+, booktitle =   "Proc. 4th Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1136
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "234--245"
+, update =      "97.03 smid"
 }
 
 @inproceedings{cd-mvpmp-96
-, author =	"D. Z. Chen and O. Daescu"
-, title =	"Maintaining visibility of a polygon with a moving point of view"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"240--245"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "D. Z. Chen and O. Daescu"
+, title =       "Maintaining visibility of a polygon with a moving point of view"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "240--245"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{cdk-gpqp-97
-, author =	"Danny Z. Chen and Ovidiu Daescu and Kevin S. Klenk"
-, title =	"On Geometric Path Query Problems"
-, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
-, nickname =	"WADS '97"
-, site =	"Halifax, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1272
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"248--257"
-, update =	"99.07 bibrelex, 98.03 mitchell"
+, author =      "Danny Z. Chen and Ovidiu Daescu and Kevin S. Klenk"
+, title =       "On Geometric Path Query Problems"
+, booktitle =   "Proc. 5th Workshop Algorithms Data Struct."
+, nickname =    "WADS '97"
+, site =        "Halifax, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1272
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "248--257"
+, update =      "99.07 bibrelex, 98.03 mitchell"
 }
 
 @techreport{cds-lbcgs-96t
-, author =	"D. Z. Chen and G. Das and M. Smid"
-, title =	"Lower bounds for computing geometric spanners and approximate shortest paths"
-, type =	"Report"
-, number =	"TR 96-09"
-, institution =	"Department of Computer Science, King's College"
-, address =	"London, UK"
-, year =	1996
-, update =	"96.09 mitchell, 96.05 smid"
+, author =      "D. Z. Chen and G. Das and M. Smid"
+, title =       "Lower bounds for computing geometric spanners and approximate shortest paths"
+, type =        "Report"
+, number =      "TR 96-09"
+, institution = "Department of Computer Science, King's College"
+, address =     "London, UK"
+, year =        1996
+, update =      "96.09 mitchell, 96.05 smid"
 }
 
 @inproceedings{cds-lbcgs-96i
-, author =	"D. Z. Chen and G. Das and M. Smid"
-, title =	"Lower bounds for computing geometric spanners and approximate shortest paths"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"155--160"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "D. Z. Chen and G. Das and M. Smid"
+, title =       "Lower bounds for computing geometric spanners and approximate shortest paths"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "155--160"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @article{cds-lbcgs-01
-, author =	"D. Z. Chen and G. Das and M. Smid"
-, title =	"Lower bounds for computing geometric spanners and approximate shortest paths"
-, journal =	"Discrete Appl. Math."
-, volume =	110
-, year =	2001
-, pages =	"151--167"
-, update =	"01.07 smid"
+, author =      "D. Z. Chen and G. Das and M. Smid"
+, title =       "Lower bounds for computing geometric spanners and approximate shortest paths"
+, journal =     "Discrete Appl. Math."
+, volume =      110
+, year =        2001
+, pages =       "151--167"
+, update =      "01.07 smid"
 }
 
 @inproceedings{ceu-ogpmc-95
-, author =	"Danny Z. Chen and Vladimir Estivill-Castro and Jorge Urrutia"
-, title =	"Optimal Guarding of Polygons and Monotone Chains"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"133--138"
-, update =	"95.09 jones"
+, author =      "Danny Z. Chen and Vladimir Estivill-Castro and Jorge Urrutia"
+, title =       "Optimal Guarding of Polygons and Monotone Chains"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "133--138"
+, update =      "95.09 jones"
 }
 
 @inproceedings{cg-tspmo-93
-, author =	"Danny Z. Chen and Sumanta Guha"
-, title =	"Testing a Simple Polygon for Monotonicity Optimally in Parallel"
-, booktitle =	"Proc. 7th IEEE Internat. Parallel Process. Sympos."
-, publisher =	"IEEE Computer Society"
-, year =	1993
-, pages =	"326--330"
-, precedes =	"cg-tspmo-93a"
-, update =	"98.07 bibrelex, 98.03 mitchell, 94.05 devillers"
+, author =      "Danny Z. Chen and Sumanta Guha"
+, title =       "Testing a Simple Polygon for Monotonicity Optimally in Parallel"
+, booktitle =   "Proc. 7th IEEE Internat. Parallel Process. Sympos."
+, publisher =   "IEEE Computer Society"
+, year =        1993
+, pages =       "326--330"
+, precedes =    "cg-tspmo-93a"
+, update =      "98.07 bibrelex, 98.03 mitchell, 94.05 devillers"
 }
 
 @article{cg-tspmo-93a
-, author =	"Danny Z. Chen and Sumantha Guha"
-, title =	"Testing a Simple Polygon for Monotonicity Optimally in Parallel"
-, journal =	"Inform. Process. Lett."
-, volume =	47
-, number =	6
-, month =	oct
-, year =	1993
-, pages =	"325--331"
-, succeeds =	"cg-tspmo-93"
-, update =	"98.03 mitchell"
+, author =      "Danny Z. Chen and Sumantha Guha"
+, title =       "Testing a Simple Polygon for Monotonicity Optimally in Parallel"
+, journal =     "Inform. Process. Lett."
+, volume =      47
+, number =      6
+, month =       oct
+, year =        1993
+, pages =       "325--331"
+, succeeds =    "cg-tspmo-93"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ck-rspqr-95
-, author =	"Danny Z. Chen and Kevin S. Klenk"
-, title =	"Rectilinear Short Path Queries among Rectangular Obstacles"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"169--174"
-, update =	"95.09 jones"
+, author =      "Danny Z. Chen and Kevin S. Klenk"
+, title =       "Rectilinear Short Path Queries among Rectangular Obstacles"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "169--174"
+, update =      "95.09 jones"
 }
 
 @article{ck-rspqr-96
-, author =	"D. Z. Chen and K. S. Klenk"
-, title =	"Rectilinear Short Path Queries among Rectangular Obstacles"
-, journal =	"Inform. Process. Lett."
-, volume =	57
-, year =	1996
-, pages =	"313--319"
-, update =	"98.03 mitchell, 96.05 smid"
+, author =      "D. Z. Chen and K. S. Klenk"
+, title =       "Rectilinear Short Path Queries among Rectangular Obstacles"
+, journal =     "Inform. Process. Lett."
+, volume =      57
+, year =        1996
+, pages =       "313--319"
+, update =      "98.03 mitchell, 96.05 smid"
 }
 
 @inproceedings{ckt-spqwo-95
-, author =	"Danny Z. Chen and Kevin S. Klenk and Hung-Yi T. Tu"
-, title =	"Shortest Path Queries among Weighted Obstacles in the Rectilinear Plane"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"370--379"
-, keywords =	"weighted regions, rectilinear paths, all-pairs paths"
-, precedes =	"ckt-spqwo-96"
-, cites =	"akmsw-gamsa-87, ac-prspr-91, ac-proap-93a, cg-fc1ds-86, c-apesp-95, cpt-uadpl-93, ckv-rsptp-, ckv-rsptp-87, bkn-spqrw-91, rlw-rsppr-89, em-osrqa-94, ft-fhtui-87, gmmn-pp0wr-88, gt-drssp-93, gh-ospqs-87, ghlst-ltavs-87, h-ndssp-91, hs-ecesp-93, isn-spapr-94, k-rspqw-94, ll-fmrdp-81, lp-esppr-84, lyc-srpwo-91, m-naspo-88, m-oasrp-89, m-lsppo-92, m-spop-93, mp-wrpfs-91, ps-cgi-85, sr-spppo-94, w-cvgnl-85, w-ndiv-89, lyc-srpwo-91, wwsw-rspms-87, ycl-srpwr-90, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 95.09 mitchell"
+, author =      "Danny Z. Chen and Kevin S. Klenk and Hung-Yi T. Tu"
+, title =       "Shortest Path Queries among Weighted Obstacles in the Rectilinear Plane"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "370--379"
+, keywords =    "weighted regions, rectilinear paths, all-pairs paths"
+, precedes =    "ckt-spqwo-96"
+, cites =       "akmsw-gamsa-87, ac-prspr-91, ac-proap-93a, cg-fc1ds-86, c-apesp-95, cpt-uadpl-93, ckv-rsptp-, ckv-rsptp-87, bkn-spqrw-91, rlw-rsppr-89, em-osrqa-94, ft-fhtui-87, gmmn-pp0wr-88, gt-drssp-93, gh-ospqs-87, ghlst-ltavs-87, h-ndssp-91, hs-ecesp-93, isn-spapr-94, k-rspqw-94, ll-fmrdp-81, lp-esppr-84, lyc-srpwo-91, m-naspo-88, m-oasrp-89, m-lsppo-92, m-spop-93, mp-wrpfs-91, ps-cgi-85, sr-spppo-94, w-cvgnl-85, w-ndiv-89, lyc-srpwo-91, wwsw-rspms-87, ycl-srpwr-90, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 95.09 mitchell"
 }
 
 @techreport{ckt-spqwo-96
-, author =	"D. Z. Chen and K. S. Klenk and H.-Y. T. Tu"
-, title =	"Shortest path queries among weighted obstacles in the rectilinear plane"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1996
-, succeeds =	"ckt-spqwo-95"
-, update =	"00.11 smid, 98.07 bibrelex, 98.03 mitchell"
+, author =      "D. Z. Chen and K. S. Klenk and H.-Y. T. Tu"
+, title =       "Shortest path queries among weighted obstacles in the rectilinear plane"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1996
+, succeeds =    "ckt-spqwo-95"
+, update =      "00.11 smid, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @article{ckt-spqwo-00
-, author =	"D. Z. Chen and K. S. Klenk and H.-Y. T. Tu"
-, title =	"Shortest path queries among weighted obstacles in the rectilinear plane"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, year =	2000
-, pages =	"1223--1246"
-, update =	"00.11 smid"
+, author =      "D. Z. Chen and K. S. Klenk and H.-Y. T. Tu"
+, title =       "Shortest path queries among weighted obstacles in the rectilinear plane"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, year =        2000
+, pages =       "1223--1246"
+, update =      "00.11 smid"
 }
 
 @article{cx-edacs-01
-, author =	"D. Z. Chen and J. Xu"
-, title =	"An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	18
-, year =	2001
-, pages =	"155--166"
-, update =	"01.07 smid"
+, author =      "D. Z. Chen and J. Xu"
+, title =       "An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      18
+, year =        2001
+, pages =       "155--166"
+, update =      "01.07 smid"
 }
 
 @inproceedings{cx-tvlpp-98
-, author =	"Danny Z. Chen and Jinhui Xu"
-, title =	"Two-variable Linear Programming in Parallel"
-, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '98"
-, site =	"Stockholm"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1432
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"169--180"
-, update =	"99.03 bibrelex, 98.07 mitchell"
+, author =      "Danny Z. Chen and Jinhui Xu"
+, title =       "Two-variable Linear Programming in Parallel"
+, booktitle =   "Proc. 6th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '98"
+, site =        "Stockholm"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1432
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "169--180"
+, update =      "99.03 bibrelex, 98.07 mitchell"
 }
 
 @article{ccml-nsach-87
-, author =	"G. H. Chen and M.-S. Chern and R. C. T. Lee"
-, title =	"A new systolic algorithm for convex hull and half-plane intersection problems"
-, journal =	"BIT"
-, volume =	27
-, number =	2
-, year =	1987
-, pages =	"141--147"
-, keywords =	"parallel computation, convex hull, intersection, halfplanes"
-, update =	"95.09 korneenko"
+, author =      "G. H. Chen and M.-S. Chern and R. C. T. Lee"
+, title =       "A new systolic algorithm for convex hull and half-plane intersection problems"
+, journal =     "BIT"
+, volume =      27
+, number =      2
+, year =        1987
+, pages =       "141--147"
+, keywords =    "parallel computation, convex hull, intersection, halfplanes"
+, update =      "95.09 korneenko"
 }
 
 @article{ch-scmo-88
-, author =	"H. H. Chen and T. S. Huang"
-, title =	"A survey of construction and manipulation of octrees"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	43
-, year =	1988
-, pages =	"409--431"
-, keywords =	"survey, octree, data structuring"
-, update =	"95.09 korneenko"
+, author =      "H. H. Chen and T. S. Huang"
+, title =       "A survey of construction and manipulation of octrees"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      43
+, year =        1988
+, pages =       "409--431"
+, keywords =    "survey, octree, data structuring"
+, update =      "95.09 korneenko"
 }
 
 @article{ch-mmtdp-88
-, author =	"H. H. Chen and T. S. Huang"
-, title =	"Maximum matching of three-dimensional points for multiobject motion estimation"
-, journal =	"Pattern Recogn."
-, volume =	21
-, number =	2
-, year =	1988
-, pages =	"75--90"
-, keywords =	"pattern recognition, points, motion planning"
-, succeeds =	"ch-mmttd-86"
-, update =	"97.11 bibrelex, 95.09 korneenko"
+, author =      "H. H. Chen and T. S. Huang"
+, title =       "Maximum matching of three-dimensional points for multiobject motion estimation"
+, journal =     "Pattern Recogn."
+, volume =      21
+, number =      2
+, year =        1988
+, pages =       "75--90"
+, keywords =    "pattern recognition, points, motion planning"
+, succeeds =    "ch-mmttd-86"
+, update =      "97.11 bibrelex, 95.09 korneenko"
 }
 
 @inproceedings{ch-mmttd-86
-, author =	"H. H. Chen and T. S. Huang"
-, title =	"Maximum matching of two three-dimensional point sets"
-, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn."
-, year =	1986
-, pages =	"1048--1050"
-, precedes =	"ch-mmtdp-88"
-, update =	"95.09 korneenko"
+, author =      "H. H. Chen and T. S. Huang"
+, title =       "Maximum matching of two three-dimensional point sets"
+, booktitle =   "Proc. IEEE Internat. Conf. Pattern Recogn."
+, year =        1986
+, pages =       "1048--1050"
+, precedes =    "ch-mmtdp-88"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{ch-spp-90
-, author =	"J. Chen and Y. Han"
-, title =	"Shortest paths on a polyhedron"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"360--369"
-, precedes =	"ch-spp-96"
-, cites =	"aaos-supa-90, c-namrm-87, ch-sppp2-90, cr-nlbtr-87, d-ntpcg-59, gjpt-tsp-78, hct-faspe-89, k-osps-83, m-spppo-84, m-psp-86, mmp-dgp-87, m-fspcp-85, m-nspsp-86, osb-spps-84, p-nappl-81, rs-spesp-85, rs-dsppp-88, sh-cpp-75, so-nmesc-88, ss-spps-86, ZZZ"
-, update =	"98.07 bibrelex, 97.11 bibrelex, 96.09 devillers"
+, author =      "J. Chen and Y. Han"
+, title =       "Shortest paths on a polyhedron"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "360--369"
+, precedes =    "ch-spp-96"
+, cites =       "aaos-supa-90, c-namrm-87, ch-sppp2-90, cr-nlbtr-87, d-ntpcg-59, gjpt-tsp-78, hct-faspe-89, k-osps-83, m-spppo-84, m-psp-86, mmp-dgp-87, m-fspcp-85, m-nspsp-86, osb-spps-84, p-nappl-81, rs-spesp-85, rs-dsppp-88, sh-cpp-75, so-nmesc-88, ss-spps-86, ZZZ"
+, update =      "98.07 bibrelex, 97.11 bibrelex, 96.09 devillers"
 }
 
 @article{ch-spp-96
-, author =	"J. Chen and Y. Han"
-, title =	"Shortest paths on a polyhedron"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"127--144"
-, succeeds =	"ch-spp-90"
-, update =	"96.09 devillers"
+, author =      "J. Chen and Y. Han"
+, title =       "Shortest paths on a polyhedron"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "127--144"
+, succeeds =    "ch-spp-90"
+, update =      "96.09 devillers"
 }
 
 @techreport{ch-sppp2-90
-, author =	"J. Chen and Y. Han"
-, title =	"Shortest paths on a polyhedron, {Part} II: storing shortest paths"
-, type =	"Technical {Report}"
-, number =	"161-90"
-, institution =	"Comput. Sci. Dept., Univ. Kentucky"
-, address =	"Lexington, KY"
-, month =	feb
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "J. Chen and Y. Han"
+, title =       "Shortest paths on a polyhedron, {Part} II: storing shortest paths"
+, type =        "Technical {Report}"
+, number =      "161-90"
+, institution = "Comput. Sci. Dept., Univ. Kentucky"
+, address =     "Lexington, KY"
+, month =       feb
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 % Affiliation: Dept. Comput. Sci., Kentucky Univ., Lexington, KY, USA
 @inproceedings{ch-sspp-91
-, author =	"J. Chen and Y. Han"
-, title =	"Storing shortest paths for a polyhedron"
-, editor =	"F. Dehne and F. Fiala and W. W. Koczkodaj"
-, booktitle =	"Advances in Computing and Information --- ICCI '91 International Conference Proceedings"
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"169--80"
-, update =	"93.09 rote"
+, author =      "J. Chen and Y. Han"
+, title =       "Storing shortest paths for a polyhedron"
+, editor =      "F. Dehne and F. Fiala and W. W. Koczkodaj"
+, booktitle =   "Advances in Computing and Information --- ICCI '91 International Conference Proceedings"
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "169--80"
+, update =      "93.09 rote"
 }
 
 @inproceedings{ckk-cge-93
-, author =	"Jianer Chen and Saroja P. Kanchi and Arkady Kanevsky"
-, title =	"On the Complexity of Graph Embeddings"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"234--245"
-, update =	"93.09 milone+mitchell"
+, author =      "Jianer Chen and Saroja P. Kanchi and Arkady Kanevsky"
+, title =       "On the Complexity of Graph Embeddings"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "234--245"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{c-lpc-63
-, author =	"J. R. Chen"
-, title =	"The lattice points in a circle"
-, journal =	"Sci. Sinica"
-, volume =	12
-, year =	1963
-, pages =	"633--649"
-, update =	"97.11 bibrelex"
+, author =      "J. R. Chen"
+, title =       "The lattice points in a circle"
+, journal =     "Sci. Sinica"
+, volume =      12
+, year =        1963
+, pages =       "633--649"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{c-edpai-90
-, author =	"L. Chen"
-, title =	"Efficient deterministic parallel algorithms for integer sorting"
-, editor =	"S. G. Akl and F. Fiala and W. W. Koczkodaj"
-, booktitle =	"Advances in Computing and Information -- Proc. International Conference on Computing and Information"
-, year =	1990
-, pages =	"367--371"
-, update =	"98.07 bibrelex"
+, author =      "L. Chen"
+, title =       "Efficient deterministic parallel algorithms for integer sorting"
+, editor =      "S. G. Akl and F. Fiala and W. W. Koczkodaj"
+, booktitle =   "Advances in Computing and Information -- Proc. International Conference on Computing and Information"
+, year =        1990
+, pages =       "367--371"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{c-epasi-89
-, author =	"L. Chen"
-, title =	"Efficient parallel algorithms for several intersection graphs"
-, booktitle =	"Proc. IEEE Internat. Symp. Circuits and Systems"
-, volume =	2
-, year =	1989
-, pages =	"973--976"
-, keywords =	"geometric graphs, parallel computation, intersection"
-, update =	"95.09 korneenko"
+, author =      "L. Chen"
+, title =       "Efficient parallel algorithms for several intersection graphs"
+, booktitle =   "Proc. IEEE Internat. Symp. Circuits and Systems"
+, volume =      2
+, year =        1989
+, pages =       "973--976"
+, keywords =    "geometric graphs, parallel computation, intersection"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{c-epaca-90
-, author =	"L. Chen"
-, title =	"Efficient parallel algorithms on circular arcs"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"66--69"
-, cites =	"c-nacag-89, c-edpai-90, cy-ptcop-89, c-pms-88, cv-fopps-89, g-acag-74, k-pafmc-89, krs-ppp-85a, lf-ppc-80, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "L. Chen"
+, title =       "Efficient parallel algorithms on circular arcs"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "66--69"
+, cites =       "c-nacag-89, c-edpai-90, cy-ptcop-89, c-pms-88, cv-fopps-89, g-acag-74, k-pafmc-89, krs-ppp-85a, lf-ppc-80, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{c-nacag-89
-, author =	"L. Chen"
-, title =	"NC algorithms for circular-arc graphs"
-, editor =	"F. Dehne and J.-R. Sack and N. Santoro"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"291--302"
-, update =	"98.07 bibrelex"
+, author =      "L. Chen"
+, title =       "NC algorithms for circular-arc graphs"
+, editor =      "F. Dehne and J.-R. Sack and N. Santoro"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "291--302"
+, update =      "98.07 bibrelex"
 }
 
 @article{ccw-pdmdd-93
-, author =	"L. Chen and S. Chou and T. Woo"
-, title =	"Parting directions for mould and die design"
-, journal =	"Comput. Aided Design"
-, volume =	25
-, year =	1993
-, pages =	"762--768"
-, update =	"98.07 bibrelex"
+, author =      "L. Chen and S. Chou and T. Woo"
+, title =       "Parting directions for mould and die design"
+, journal =     "Comput. Aided Design"
+, volume =      25
+, year =        1993
+, pages =       "762--768"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{cy-ptcop-89
-, author =	"L. Chen and Y. Yesha"
-, title =	"Parallel testing for the consecutive ones property and transformable convex bipartite graphs and finding a maximum matching"
-, booktitle =	"Proc. 27th Allerton Conf. Commun. Control Comput."
-, site =	"Urbana, IL"
-, year =	1989
-, pages =	"756--765"
-, update =	"98.07 bibrelex"
+, author =      "L. Chen and Y. Yesha"
+, title =       "Parallel testing for the consecutive ones property and transformable convex bipartite graphs and finding a maximum matching"
+, booktitle =   "Proc. 27th Allerton Conf. Commun. Control Comput."
+, site =        "Urbana, IL"
+, year =        1989
+, pages =       "756--765"
+, update =      "98.07 bibrelex"
 }
 
 @article{cw-cgsaa-92
-, author =	"L.-L. Chen and T. C. Woo"
-, title =	"Computational geometry on the sphere with application to automated machining"
-, journal =	"Journal of Mechanical Design"
-, volume =	114
-, year =	1992
-, pages =	"288--295"
-, update =	"98.07 smid"
+, author =      "L.-L. Chen and T. C. Woo"
+, title =       "Computational geometry on the sphere with application to automated machining"
+, journal =     "Journal of Mechanical Design"
+, volume =      114
+, year =        1992
+, pages =       "288--295"
+, update =      "98.07 smid"
 }
 
 @inproceedings{ct-ecadc-87
-, author =	"M. Chen and P. Townsend"
-, title =	"Efficient and consistent algorithms for determining the containment of points in polygons and polyhedra"
-, editor =	"G. Marechal"
-, booktitle =	"EUROGRAPHICS '87"
-, publisher =	"North-Holland"
-, month =	aug
-, year =	1987
-, pages =	"423--437"
-, keywords =	"point location"
-, update =	"98.07 bibrelex, 95.09 korneenko"
+, author =      "M. Chen and P. Townsend"
+, title =       "Efficient and consistent algorithms for determining the containment of points in polygons and polyhedra"
+, editor =      "G. Marechal"
+, booktitle =   "EUROGRAPHICS '87"
+, publisher =   "North-Holland"
+, month =       aug
+, year =        1987
+, pages =       "423--437"
+, keywords =    "point location"
+, update =      "98.07 bibrelex, 95.09 korneenko"
 }
 
 @inproceedings{c-nastg-83
-, author =	"N.-P. Chen"
-, title =	"New algorithms for {Steiner} tree on graphs"
-, booktitle =	"IEEE Sympos. Circuits Systems"
-, year =	1983
-, pages =	"1217--1219"
+, author =      "N.-P. Chen"
+, title =       "New algorithms for {Steiner} tree on graphs"
+, booktitle =   "IEEE Sympos. Circuits Systems"
+, year =        1983
+, pages =       "1217--1219"
 }
 
 @article{chj-ololv-91
-, author =	"P.-C. Chen and P. Hansen and B. Jaumard"
-, title =	"On-line and off-line vertex enumeration by adjacency lists"
-, journal =	"Oper. Res. Lett."
-, volume =	10
-, year =	1991
-, pages =	"403--409"
-, update =	"97.11 bibrelex"
+, author =      "P.-C. Chen and P. Hansen and B. Jaumard"
+, title =       "On-line and off-line vertex enumeration by adjacency lists"
+, journal =     "Oper. Res. Lett."
+, volume =      10
+, year =        1991
+, pages =       "403--409"
+, update =      "97.11 bibrelex"
 }
 
 @article{c-irepr-90
-, author =	"S. E. Chen"
-, title =	"Incremental radiosity: An extension of progressive radiosity to an interactive image synthesis system"
-, journal =	"Comput. Graph."
-, volume =	24
-, number =	4
-, month =	aug
-, year =	1990
-, pages =	"135--144"
-, note =	"Proc. SIGGRAPH '90"
-, update =	"97.11 bibrelex"
+, author =      "S. E. Chen"
+, title =       "Incremental radiosity: An extension of progressive radiosity to an interactive image synthesis system"
+, journal =     "Comput. Graph."
+, volume =      24
+, number =      4
+, month =       aug
+, year =        1990
+, pages =       "135--144"
+, note =        "Proc. SIGGRAPH '90"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{cdwk-cscsp-97
-, author =	"Wei Chen and Xiao Wen Deng and Koichi Wada and Kimio Kawaguchi"
-, title =	"Constructing a Strongly Convex Superhull of Points"
-, booktitle =	"Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
-, nickname =	"COCOON '97"
-, site =	"Shanghai, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1276
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"42--51"
-, update =	"99.11 bibrelex, 98.11 bibrelex, 98.03 mitchell"
+, author =      "Wei Chen and Xiao Wen Deng and Koichi Wada and Kimio Kawaguchi"
+, title =       "Constructing a Strongly Convex Superhull of Points"
+, booktitle =   "Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
+, nickname =    "COCOON '97"
+, site =        "Shanghai, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1276
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "42--51"
+, update =      "99.11 bibrelex, 98.11 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{cwk-pracs-96
-, author =	"Wei Chen and Koichi Wada and Kimio Kawaguchi"
-, title =	"Parallel Robust Algorithms for Constructing Strongly Convex Hulls"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"133--140"
-, cites =	"acgoy-pcg-88, ds-rgnap-88, f-smpst-89, gr-epa-88, gy-frcg-86, gss-egbra-89, gss-cscah-93, h-pargc-89, lm-cschu-92, m-vigau-88a, m-cacau-89, m-dpggt-89, otu-nsga-87, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex, 96.05 efrat"
+, author =      "Wei Chen and Koichi Wada and Kimio Kawaguchi"
+, title =       "Parallel Robust Algorithms for Constructing Strongly Convex Hulls"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "133--140"
+, cites =       "acgoy-pcg-88, ds-rgnap-88, f-smpst-89, gr-epa-88, gy-frcg-86, gss-egbra-89, gss-cscah-93, h-pargc-89, lm-cschu-92, m-vigau-88a, m-cacau-89, m-dpggt-89, otu-nsga-87, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex, 96.05 efrat"
 }
 
 @article{cwkc-fchdp-98
-, author =	"Wei Chen and Koichi Wada and Kimio Kawaguchi and Danny Chen"
-, title =	"Finding the Convex Hull of Discs in Parallel"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"305--320"
-, update =	"98.11 devillers"
+, author =      "Wei Chen and Koichi Wada and Kimio Kawaguchi and Danny Chen"
+, title =       "Finding the Convex Hull of Discs in Parallel"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "305--320"
+, update =      "98.11 devillers"
 }
 
 @mastersthesis{c-rsbo-91
-, author =	"X. Chen"
-, title =	"Robust Solid Boolean Operations"
-, school =	"Agricultural and Mech. College, Louisiana State Univ., USA"
-, year =	1991
-, keywords =	"numerical precision, stability, robustness"
-, update =	"93.09 held"
+, author =      "X. Chen"
+, title =       "Robust Solid Boolean Operations"
+, school =      "Agricultural and Mech. College, Louisiana State Univ., USA"
+, year =        1991
+, keywords =    "numerical precision, stability, robustness"
+, update =      "93.09 held"
 }
 
 @article{ch-efbd-96
-, author =	"X. Chen and C. M. Hoffmann"
-, title =	"On editability of feature-based design"
-, journal =	"Comput. Aided Design"
-, volume =	27
-, number =	12
-, year =	1996
-, pages =	"905--914"
-, update =	"98.07 bibrelex"
+, author =      "X. Chen and C. M. Hoffmann"
+, title =       "On editability of feature-based design"
+, journal =     "Comput. Aided Design"
+, volume =      27
+, number =      12
+, year =        1996
+, pages =       "905--914"
+, update =      "98.07 bibrelex"
 }
 
 @article{cy-ptapc-89
-, author =	"Xiangping Chen and Daoning Ying"
-, title =	"Polygon Triangulation Algorithm As a Powerful Core Processor Of Plan-1"
-, journal =	"Comput. Graph. Forum"
-, volume =	8
-, number =	3
-, month =	sep
-, year =	1989
-, pages =	"193--198"
-, keywords =	"polygon triangulation, plan-i (production layout automation nucleus) system, non-self-intersecting polygon, triangular splitting algorithm, triangular- faceted structure, boundary representation"
-, annote =	"$O(n^2)$ search for an empty triangle on a particular
-		 edge. Hence an $O(n^3)$ algorithm."
-, abstract =	"A concise, complete and reliable algorithm for
-		 triangulating an arbitrary polygon is presented as a
-		 powerful core processor of PLAN-I (Production Layout
-		 Automation Nucleus) system. A polygon with inner loops
-		 is converted into a non-self-intersecting polygon (NIP)
-		 through adding 'Bridge Edges'. A triangular splitting
-		 algorithm for NIP is described and implemented. The
-		 program is about 300 lines in FORTRAN-77. Sweeping and
-		 local operations with respect to the triangular-faceted
-		 boundary representation are designed with the algorithm
-		 to improve functions of solid modeling in PLAN-I. The
-		 algorithm of triangulation can also be applied to
-		 Boolean operations and other issues. (Author abstract)
-		 9 Refs."
+, author =      "Xiangping Chen and Daoning Ying"
+, title =       "Polygon Triangulation Algorithm As a Powerful Core Processor Of Plan-1"
+, journal =     "Comput. Graph. Forum"
+, volume =      8
+, number =      3
+, month =       sep
+, year =        1989
+, pages =       "193--198"
+, keywords =    "polygon triangulation, plan-i (production layout automation nucleus) system, non-self-intersecting polygon, triangular splitting algorithm, triangular- faceted structure, boundary representation"
+, annote =      "$O(n^2)$ search for an empty triangle on a particular
+                 edge. Hence an $O(n^3)$ algorithm."
+, abstract =    "A concise, complete and reliable algorithm for
+                 triangulating an arbitrary polygon is presented as a
+                 powerful core processor of PLAN-I (Production Layout
+                 Automation Nucleus) system. A polygon with inner loops
+                 is converted into a non-self-intersecting polygon (NIP)
+                 through adding 'Bridge Edges'. A triangular splitting
+                 algorithm for NIP is described and implemented. The
+                 program is about 300 lines in FORTRAN-77. Sweeping and
+                 local operations with respect to the triangular-faceted
+                 boundary representation are designed with the algorithm
+                 to improve functions of solid modeling in PLAN-I. The
+                 algorithm of triangulation can also be applied to
+                 Boolean operations and other issues. (Author abstract)
+                 9 Refs."
 }
 
 @inproceedings{cs-frsoe-94
-, author =	"Y. Chen and T. R. Smith"
-, title =	"Finitely representable Spatial Objects and Efficient Computation"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"181--189"
-, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
+, author =      "Y. Chen and T. R. Smith"
+, title =       "Finitely representable Spatial Objects and Efficient Computation"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "181--189"
+, update =      "99.11 bibrelex, 98.03 smid, 96.05 mitchell"
 }
 
 @article{clc-saknn-92
-, author =	"Y.-A. Chen and Y.-L. Lin and L.-W. Chang"
-, title =	"A systolic algorithm for the k-nearest neighbors problem"
-, journal =	"IEEE Trans. Comput."
-, volume =	41
-, number =	1
-, year =	1992
-, pages =	"103--108"
-, keywords =	"proximity, parallel computation"
-, update =	"95.09 korneenko"
+, author =      "Y.-A. Chen and Y.-L. Lin and L.-W. Chang"
+, title =       "A systolic algorithm for the k-nearest neighbors problem"
+, journal =     "IEEE Trans. Comput."
+, volume =      41
+, number =      1
+, year =        1992
+, pages =       "103--108"
+, keywords =    "proximity, parallel computation"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{chil-pcrat-90
-, author =	"Y.-B. Chen and M. Hsieh and A. Inselberg and H. Q. Lee"
-, title =	"Planar conflict resolution for air traffic control"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"160--163"
-, cites =	"ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "Y.-B. Chen and M. Hsieh and A. Inselberg and H. Q. Lee"
+, title =       "Planar conflict resolution for air traffic control"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "160--163"
+, cites =       "ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ci-opodp-92
-, author =	"Y.-B. Chen and D. Ierardi"
-, title =	"Oblivious plans for orienting and distinguishing polygonal parts"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"204--209"
-, cites =	"gme-gsppp-91, g-oppws-93, mw-posfp-85, n-spadp-89, rg-rspid-91, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "Y.-B. Chen and D. Ierardi"
+, title =       "Oblivious plans for orienting and distinguishing polygonal parts"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "204--209"
+, cites =       "gme-gsppp-91, g-oppws-93, mw-posfp-85, n-spadp-89, rg-rspid-91, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{ci-omprp-
-, author =	"Y. B. Chen and D. Ierardi"
-, title =	"Optimal Motion Planning for a Rod in the Plane Subject to Acceleration and Velocity Constraints"
-, type =	"Technical {Report}"
-, institution =	"Univ. Southern California"
-, year =	"??"
-, note =	"In preparation"
-, update =	"98.03 bibrelex"
+, author =      "Y. B. Chen and D. Ierardi"
+, title =       "Optimal Motion Planning for a Rod in the Plane Subject to Acceleration and Velocity Constraints"
+, type =        "Technical {Report}"
+, institution = "Univ. Southern California"
+, year =        "??"
+, note =        "In preparation"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ci-omprp-92
-, author =	"Y. B. Chen and D. Ierardi"
-, title =	"Optimal Motion Planning for a Rod in the Plane Subject to Velocity Constraints"
-, type =	"Technical {Report}"
-, number =	"USC-CS-92-529"
-, institution =	"Univ. Southern California"
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "Y. B. Chen and D. Ierardi"
+, title =       "Optimal Motion Planning for a Rod in the Plane Subject to Velocity Constraints"
+, type =        "Technical {Report}"
+, number =      "USC-CS-92-529"
+, institution = "Univ. Southern California"
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ci-omprp-93
-, author =	"Y.-B. Chen and D. Ierardi"
-, title =	"Optimal motion planning for a rod in the plane subject to velocity constraints"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"143--152"
-, precedes =	"ci-totrp-97"
-, cites =	"cdrx-ckp-88, ci-omprp-92, ci-omprp-, d-upoml-85, g-mpmmm-73, g-meds-75, h-ei-17, h-cvoct-66, irwy-spls-91, l-rmp-91, ls-esmpa-85, o-mpic-87, rt-akpul-89, ss-pmp1c-83, u-pcv-60, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 93.09 jones"
+, author =      "Y.-B. Chen and D. Ierardi"
+, title =       "Optimal motion planning for a rod in the plane subject to velocity constraints"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "143--152"
+, precedes =    "ci-totrp-97"
+, cites =       "cdrx-ckp-88, ci-omprp-92, ci-omprp-, d-upoml-85, g-mpmmm-73, g-meds-75, h-ei-17, h-cvoct-66, irwy-spls-91, l-rmp-91, ls-esmpa-85, o-mpic-87, rt-akpul-89, ss-pmp1c-83, u-pcv-60, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 93.09 jones"
 }
 
 @article{ci-totrp-97
-, author =	"Y.-B. Chen and D. Ierardi"
-, title =	"Time-Optimal Trajectories of a Rod in the Plane Subject to Velocity Constraints"
-, journal =	"Algorithmica"
-, volume =	18
-, number =	2
-, month =	jun
-, year =	1997
-, pages =	"165--197"
-, succeeds =	"ci-omprp-93"
-, update =	"98.03 mitchell"
+, author =      "Y.-B. Chen and D. Ierardi"
+, title =       "Time-Optimal Trajectories of a Rod in the Plane Subject to Velocity Constraints"
+, journal =     "Algorithmica"
+, volume =      18
+, number =      2
+, month =       jun
+, year =        1997
+, pages =       "165--197"
+, succeeds =    "ci-omprp-93"
+, update =      "98.03 mitchell"
 }
 
 @article{ci-copod-95
-, author =	"Y.-B. Chen and D. J. Ierardi"
-, title =	"The complexity of oblivious plans for orienting and distinguishing polygonal parts"
-, journal =	"Algorithmica"
-, volume =	14
-, year =	1995
-, pages =	"367--397"
-, update =	"98.07 bibrelex"
+, author =      "Y.-B. Chen and D. J. Ierardi"
+, title =       "The complexity of oblivious plans for orienting and distinguishing polygonal parts"
+, journal =     "Algorithmica"
+, volume =      14
+, year =        1995
+, pages =       "367--397"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{c-sohpm-85
-, author =	"Y. C. Chen"
-, title =	"Set operations in hierarchical probe model"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Math. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1985
+, author =      "Y. C. Chen"
+, title =       "Set operations in hierarchical probe model"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Math. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1985
 }
 
-% also claimed pages =	"257--265"
+% also claimed pages =  "257--265"
 @article{cr-esppo-91
-, author =	"Y.-M. Chen and P. Ramanan"
-, title =	"Euclidean shortest path with presence of obstacles"
-, journal =	"Networks"
-, volume =	21
-, year =	1991
-, pages =	"257--267"
-, keywords =	"path planning"
-, update =	"93.09 milone+mitchell"
+, author =      "Y.-M. Chen and P. Ramanan"
+, title =       "Euclidean shortest path with presence of obstacles"
+, journal =     "Networks"
+, volume =      21
+, year =        1991
+, pages =       "257--267"
+, keywords =    "path planning"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{c-lutrp-93
-, author =	"Zhixiang Chen"
-, title =	"Learning Unions of Two Rectangles in the Plane with Equivalence Queries"
-, booktitle =	"Proc. 6th ACM Conf. Comput. Learning Theory"
-, nickname =	"COLT '93"
-, month =	jul
-, year =	1993
-, pages =	"??"
-, update =	"98.07 bibrelex, 93.09 milone+mitchell"
+, author =      "Zhixiang Chen"
+, title =       "Learning Unions of Two Rectangles in the Plane with Equivalence Queries"
+, booktitle =   "Proc. 6th ACM Conf. Comput. Learning Theory"
+, nickname =    "COLT '93"
+, month =       jul
+, year =        1993
+, pages =       "??"
+, update =      "98.07 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{cg-ssvip-88
-, author =	"Z. Chen and J. A. Guevara"
-, title =	"System selection of very important points ({VIP}) from digital terrain models for constructing triangular irregular networks"
-, booktitle =	"Proc. 8th Internat. Sympos. Comput. Assist. Cartography"
-, nickname =	"Auto-Carto"
-, year =	1988
-, pages =	"50--56"
-, update =	"98.07 bibrelex"
+, author =      "Z. Chen and J. A. Guevara"
+, title =       "System selection of very important points ({VIP}) from digital terrain models for constructing triangular irregular networks"
+, booktitle =   "Proc. 8th Internat. Sympos. Comput. Assist. Cartography"
+, nickname =    "Auto-Carto"
+, year =        1988
+, pages =       "50--56"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{chmsb-nrm-95
-, author =	"Z. Chen and A. T. Holle and B. M. E. Moret and J. Saia and A. Boroujerdi"
-, title =	"Network routing models applied to aircraft routing problems"
-, booktitle =	"Proc. Winter Simulation Conf."
-, year =	1995
-, pages =	"1200--1206"
-, update =	"98.03 moret"
+, author =      "Z. Chen and A. T. Holle and B. M. E. Moret and J. Saia and A. Boroujerdi"
+, title =       "Network routing models applied to aircraft routing problems"
+, booktitle =   "Proc. Winter Simulation Conf."
+, year =        1995
+, pages =       "1200--1206"
+, update =      "98.03 moret"
 }
 
 @inproceedings{ct-qrdt-86
-, author =	"Z. T. Chen and W. R. Tobler"
-, title =	"Quadtree Representation of Digital Terrain"
-, booktitle =	"Proc. Autocarto"
-, site =	"London"
-, year =	1986
-, pages =	"475--484"
-, update =	"98.11 bibrelex"
+, author =      "Z. T. Chen and W. R. Tobler"
+, title =       "Quadtree Representation of Digital Terrain"
+, booktitle =   "Proc. Autocarto"
+, site =        "London"
+, year =        1986
+, pages =       "475--484"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{cj-fiplp-86
-, author =	"Fuhua Cheng and Wein Chung Jiaan"
-, title =	"Finding the Intersection Points of a Line With a Polygon and its Applications"
-, booktitle =	"Proc. 14th ACM Annu. Computer Sci. Conf."
-, nickname =	"CSC '86"
-, site =	"Cincinnati"
-, year =	1986
-, pages =	"448--448"
-, keywords =	"intersection, polygon"
-, succeeds =	"clc-fiplp-85"
-, update =	"01.04 icking, 97.11 bibrelex, 95.09 korneenko"
+, author =      "Fuhua Cheng and Wein Chung Jiaan"
+, title =       "Finding the Intersection Points of a Line With a Polygon and its Applications"
+, booktitle =   "Proc. 14th ACM Annu. Computer Sci. Conf."
+, nickname =    "CSC '86"
+, site =        "Cincinnati"
+, year =        1986
+, pages =       "448--448"
+, keywords =    "intersection, polygon"
+, succeeds =    "clc-fiplp-85"
+, update =      "01.04 icking, 97.11 bibrelex, 95.09 korneenko"
 }
 
 @techreport{clc-fiplp-85
-, author =	"F. Cheng and J.-Y. Lu and H.-S. Chang"
-, title =	"Finding the intersection points of a line with a polygon and its applications"
-, type =	"Report"
-, number =	"??"
-, institution =	"Inst. Comput. Decision Sci., National Tsing Hua Univ."
-, address =	"Taiwan"
-, year =	1985
-, precedes =	"cj-fiplp-86"
-, update =	"95.09 korneenko"
+, author =      "F. Cheng and J.-Y. Lu and H.-S. Chang"
+, title =       "Finding the intersection points of a line with a polygon and its applications"
+, type =        "Report"
+, number =      "??"
+, institution = "Inst. Comput. Decision Sci., National Tsing Hua Univ."
+, address =     "Taiwan"
+, year =        1985
+, precedes =    "cj-fiplp-86"
+, update =      "95.09 korneenko"
 }
 
 @article{cef-ssd-01
-, author =	"H.-L. Cheng and H. Edelsbrunner and P. Fu"
-, title =	"Shape space from deformation"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"191--204"
-, update =	"01.11 smid"
+, author =      "H.-L. Cheng and H. Edelsbrunner and P. Fu"
+, title =       "Shape space from deformation"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "191--204"
+, update =      "01.11 smid"
 }
 
 @article{ccs-cspao-00
-, author =	"Q. Cheng and M. Chrobak and G. Sundaram"
-, title =	"Computing simple paths among obstacles"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	16
-, year =	2000
-, pages =	"223--233"
-, update =	"01.04 smid"
+, author =      "Q. Cheng and M. Chrobak and G. Sundaram"
+, title =       "Computing simple paths among obstacles"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      16
+, year =        2000
+, pages =       "223--233"
+, update =      "01.04 smid"
 }
 
 @inproceedings{c-stptb-97
-, author =	"Siu-Wing Cheng"
-, title =	"The {Steiner} Tree Problem for Terminals on the Boundary of a Rectilinear Polygon"
-, booktitle =	"Proc. of the DIMACS Workshop on Network Design: Connectivity and Facilities Location"
-, site =	"Princeton, NJ"
-, month =	apr
-, year =	1997
-, update =	"98.03 mitchell"
-, annote =	"Submitted to Theoretical Computer Science.  They give an
+, author =      "Siu-Wing Cheng"
+, title =       "The {Steiner} Tree Problem for Terminals on the Boundary of a Rectilinear Polygon"
+, booktitle =   "Proc. of the DIMACS Workshop on Network Design: Connectivity and Facilities Location"
+, site =        "Princeton, NJ"
+, month =       apr
+, year =        1997
+, update =      "98.03 mitchell"
+, annote =      "Submitted to Theoretical Computer Science.  They give an
                   $O(k^3n)$ algorithm for finding a min rectilinear
                   Steiner tree
                   for n points on the boundary of a rectilinear
@@ -34367,692 +34367,692 @@ @inproceedings{c-stptb-97
 }
 
 @inproceedings{c-wecml-94
-, author =	"S.-W. Cheng"
-, title =	"Widest Empty Corridor with Multiple Links and Right-Angle Turns"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"57--62"
-, cites =	"cd-kdcp-90, hm-fwecs-88, jp-wcp-93t, st-pplup-86, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "S.-W. Cheng"
+, title =       "Widest Empty Corridor with Multiple Links and Right-Angle Turns"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "57--62"
+, cites =       "cd-kdcp-90, hm-fwecs-88, jp-wcp-93t, st-pplup-86, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @article{c-welsc-96
-, author =	"S.-W. Cheng"
-, title =	"Widest empty {L}-shaped corridor"
-, journal =	"Inform. Process. Lett."
-, volume =	58
-, year =	1996
-, pages =	"277--283"
-, update =	"96.09 smid"
+, author =      "S.-W. Cheng"
+, title =       "Widest empty {L}-shaped corridor"
+, journal =     "Inform. Process. Lett."
+, volume =      58
+, year =        1996
+, pages =       "277--283"
+, update =      "96.09 smid"
 }
 
 @article{cefl-dapsd-01
-, author =	"S.-W. Cheng and H. Edelsbrunner and P. Fu and K.-P. Lam"
-, title =	"Design and analysis of planar shape deformation"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"205--218"
-, update =	"01.11 smid"
+, author =      "S.-W. Cheng and H. Edelsbrunner and P. Fu and K.-P. Lam"
+, title =       "Design and analysis of planar shape deformation"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "205--218"
+, update =      "01.11 smid"
 }
 
 @inproceedings{cgt-ecabs-95
-, author =	"Siu Wing Cheng and Mordecai J. Golin and Jeffrey C. F. Tsang"
-, title =	"Expected Case Analysis of $\Beta$-Skeletons with Applications to the Construction of Minimum-Weight Triangulations"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"279--284"
-, update =	"95.09 jones"
+, author =      "Siu Wing Cheng and Mordecai J. Golin and Jeffrey C. F. Tsang"
+, title =       "Expected Case Analysis of $\Beta$-Skeletons with Applications to the Construction of Minimum-Weight Triangulations"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "279--284"
+, update =      "95.09 jones"
 }
 
 @article{cj-arsis-92
-, author =	"S. W. Cheng and R. Janardan"
-, title =	"Algorithms for ray-shooting and intersection searching"
-, journal =	"J. Algorithms"
-, volume =	13
-, year =	1992
-, pages =	"670--692"
-, update =	"93.09 smid"
+, author =      "S. W. Cheng and R. Janardan"
+, title =       "Algorithms for ray-shooting and intersection searching"
+, journal =     "J. Algorithms"
+, volume =      13
+, year =        1992
+, pages =       "670--692"
+, update =      "93.09 smid"
 }
 
 @article{cj-edasg-90
-, author =	"S. W. Cheng and R. Janardan"
-, title =	"Efficient dynamic algorithms for some geometric intersection problems"
-, journal =	"Inform. Process. Lett."
-, volume =	36
-, year =	1990
-, pages =	"251--258"
+, author =      "S. W. Cheng and R. Janardan"
+, title =       "Efficient dynamic algorithms for some geometric intersection problems"
+, journal =     "Inform. Process. Lett."
+, volume =      36
+, year =        1990
+, pages =       "251--258"
 }
 
 @inproceedings{cj-emuil-90
-, author =	"S. W. Cheng and R. Janardan"
-, title =	"Efficient maintenance of the union intervals on a line, with applications"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"74--83"
-, precedes =	"cj-emuil-91"
+, author =      "S. W. Cheng and R. Janardan"
+, title =       "Efficient maintenance of the union intervals on a line, with applications"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "74--83"
+, precedes =    "cj-emuil-91"
 }
 
 @article{cj-emuil-91
-, author =	"S. W. Cheng and R. Janardan"
-, title =	"Efficient maintenance of the union intervals on a line, with applications"
-, journal =	"J. Algorithms"
-, volume =	12
-, year =	1991
-, pages =	"57--74"
-, succeeds =	"cj-emuil-90"
+, author =      "S. W. Cheng and R. Janardan"
+, title =       "Efficient maintenance of the union intervals on a line, with applications"
+, journal =     "J. Algorithms"
+, volume =      12
+, year =        1991
+, pages =       "57--74"
+, succeeds =    "cj-emuil-90"
 }
 
 @techreport{cj-nrdpp-90
-, author =	"S. W. Cheng and R. Janardan"
-, title =	"New Results on Dynamic Planar Point Location"
-, type =	"Technical {Report}"
-, number =	"TR 90-13"
-, institution =	"Dept. Comput. Sci., Univ. Minnesota"
-, address =	"Minneapolis, MN"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "S. W. Cheng and R. Janardan"
+, title =       "New Results on Dynamic Planar Point Location"
+, type =        "Technical {Report}"
+, number =      "TR 90-13"
+, institution = "Dept. Comput. Sci., Univ. Minnesota"
+, address =     "Minneapolis, MN"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @article{cj-nrdpp-92
-, author =	"S. W. Cheng and R. Janardan"
-, title =	"New results on dynamic planar point location"
-, journal =	"SIAM J. Comput."
-, volume =	21
-, year =	1992
-, pages =	"972--999"
-, keywords =	"point location, dynamization"
+, author =      "S. W. Cheng and R. Janardan"
+, title =       "New results on dynamic planar point location"
+, journal =     "SIAM J. Comput."
+, volume =      21
+, year =        1992
+, pages =       "972--999"
+, keywords =    "point location, dynamization"
 }
 
 @inproceedings{cj-nrdpl-90
-, author =	"S. W. Cheng and R. Janardan"
-, title =	"New results on dynamic point location"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"96--105"
-, keywords =	"point location, dynamization"
+, author =      "S. W. Cheng and R. Janardan"
+, title =       "New results on dynamic point location"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "96--105"
+, keywords =    "point location, dynamization"
 }
 
 @inproceedings{cj-sersi-91
-, author =	"S. W. Cheng and R. Janardan"
-, title =	"Space-efficient ray shooting and intersection searching: algorithms, dynamization and applications"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"7--16"
-, keywords =	"ray tracing, dynamization, spanning trees of low stabbing number"
+, author =      "S. W. Cheng and R. Janardan"
+, title =       "Space-efficient ray shooting and intersection searching: algorithms, dynamization and applications"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "7--16"
+, keywords =    "ray tracing, dynamization, spanning trees of low stabbing number"
 }
 
 @inproceedings{cl-qrsam-98
-, author =	"Siu-Wing Cheng and Kam-Hing Lee"
-, title =	"Quadtree Decomposition, {S}teiner Triangulation, and Ray Shooting"
-, booktitle =	"ISAAC: 9th Internat. Sympos. Algorithms Computation"
-, year =	1998
-, pages =	"367--376"
-, url =	"citeseer.nj.nec.com/cheng98quadtree.html"
-, update =	"01.07 orourke"
+, author =      "Siu-Wing Cheng and Kam-Hing Lee"
+, title =       "Quadtree Decomposition, {S}teiner Triangulation, and Ray Shooting"
+, booktitle =   "ISAAC: 9th Internat. Sympos. Algorithms Computation"
+, year =        1998
+, pages =       "367--376"
+, url = "citeseer.nj.nec.com/cheng98quadtree.html"
+, update =      "01.07 orourke"
 }
 
 @inproceedings{clw-orste-93
-, author =	"Siu-Wing Cheng and Andrew Lim and Ching-Ting Wu"
-, title =	"Optimal Rectilinear {Steiner} Tree for Extremal Point Sets"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"523--532"
-, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Siu-Wing Cheng and Andrew Lim and Ching-Ting Wu"
+, title =       "Optimal Rectilinear {Steiner} Tree for Extremal Point Sets"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "523--532"
+, update =      "98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{ct-facor-95
-, author =	"Siu-Wing Cheng and Chi-Keung Tang"
-, title =	"A Fast Algorithm for Computing Optimal Rectilinear {Steiner} Trees for Extremal Point Sets"
-, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1004
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"322--331"
-, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
+, author =      "Siu-Wing Cheng and Chi-Keung Tang"
+, title =       "A Fast Algorithm for Computing Optimal Rectilinear {Steiner} Trees for Extremal Point Sets"
+, booktitle =   "Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1004
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "322--331"
+, update =      "98.07 bibrelex, 96.01 smid, 95.09 mitchell"
 }
 
 @inproceedings{cx-alesw-96
-, author =	"Siu-Wing Cheng and Yin-Feng Xu"
-, title =	"Approaching the Largest $\beta$-Skeleton within a Minimum Weight Triangulation"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"196--203"
-, cites =	"aatr-tin-95, beemt-eiot-93, dmm-naefm-95, dg-aivib-70, e-acg-87, g-nrpt-79, gmi-hibef-90, hp-nrmwt-94, k-csmwt-94, kr-fcm-85, lk-qgtam-96, l-nhmwt-87, ph-hta-87, y-bsmwt-95, yxy-cdapp-94, y-cdcrc-75, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Siu-Wing Cheng and Yin-Feng Xu"
+, title =       "Approaching the Largest $\beta$-Skeleton within a Minimum Weight Triangulation"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "196--203"
+, cites =       "aatr-tin-95, beemt-eiot-93, dmm-naefm-95, dg-aivib-70, e-acg-87, g-nrpt-79, gmi-hibef-90, hp-nrmwt-94, k-csmwt-94, kr-fcm-85, lk-qgtam-96, l-nhmwt-87, ph-hta-87, y-bsmwt-95, yxy-cdapp-94, y-cdcrc-75, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{cx-cistp-95
-, author =	"Siu-Wing Cheng and Yin-Feng Xu"
-, title =	"Constrained independence systems and triangulations of planar point sets"
-, editor =	"Ding-Zhu Du and Ming Li"
-, booktitle =	"Proc. 1st Ann. Internat. Conf. Computing and Combinatorics"
-, nickname =	"COCOON '95"
-, site =	"Xi'an, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	959
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"275--291"
-, precedes =	"aacktrx-tin-96"
-, update =	"99.11 bibrelex, 97.03 rote"
+, author =      "Siu-Wing Cheng and Yin-Feng Xu"
+, title =       "Constrained independence systems and triangulations of planar point sets"
+, editor =      "Ding-Zhu Du and Ming Li"
+, booktitle =   "Proc. 1st Ann. Internat. Conf. Computing and Combinatorics"
+, nickname =    "COCOON '95"
+, site =        "Xi'an, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      959
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "275--291"
+, precedes =    "aacktrx-tin-96"
+, update =      "99.11 bibrelex, 97.03 rote"
 }
 
 @article{cfnwlm-moopb-95
-, author =	"W. Cheng and J. Y. H. Fu and A. Y. C. Nee and Y. S. Wong and H. T. Loh and T. Miyazawa"
-, title =	"Multi-objective optimization of part-building orientation in stereolithography"
-, journal =	"Rapid Prototyping Journal"
-, volume =	1
-, year =	1995
-, pages =	"12--23"
-, update =	"99.07 smid"
+, author =      "W. Cheng and J. Y. H. Fu and A. Y. C. Nee and Y. S. Wong and H. T. Loh and T. Miyazawa"
+, title =       "Multi-objective optimization of part-building orientation in stereolithography"
+, journal =     "Rapid Prototyping Journal"
+, volume =      1
+, year =        1995
+, pages =       "12--23"
+, update =      "99.07 smid"
 }
 
 @article{cik-nmicu-88
-, author =	"Y. Cheng and S. S. Iyengar and R. L. Kashyap"
-, title =	"A new method of image compression using irreducible cover of maximal rectangles"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	14
-, number =	5
-, year =	1988
-, pages =	"651--658"
-, keywords =	"isothetic, covering"
-, update =	"95.09 korneenko"
+, author =      "Y. Cheng and S. S. Iyengar and R. L. Kashyap"
+, title =       "A new method of image compression using irreducible cover of maximal rectangles"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      14
+, number =      5
+, year =        1988
+, pages =       "651--658"
+, keywords =    "isothetic, covering"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{cu-spcsw-95
-, author =	"Christian Chenier and Jorge Urrutia"
-, title =	"Shortest Paths in Convex and Simple Weighted Polygons"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"175--179"
-, update =	"95.09 jones"
+, author =      "Christian Chenier and Jorge Urrutia"
+, title =       "Shortest Paths in Convex and Simple Weighted Polygons"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "175--179"
+, update =      "95.09 jones"
 }
 
 @article{co-rpwdu-01
-, author =	"Otfried Cheong and Ren{\'e} van Oostrum"
-, title =	"Reaching a Polygon With Directional Uncertainty"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"197--214"
-, update =	"01.07 smid, 01.04 icking"
+, author =      "Otfried Cheong and Ren{\'e} van Oostrum"
+, title =       "Reaching a Polygon With Directional Uncertainty"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "197--214"
+, update =      "01.07 smid, 01.04 icking"
 }
 
 @article{ch-dspc2-90
-, author =	"C. Cherfils and F. Hermeline"
-, title =	"Diagonal Swap Procedures and Characterizations of 2{D}-{Delaunay} Triangulations"
-, journal =	"RAIRO-Mathematical Modelling And Numerical Analysis-Modelisation Mathematique Et Analyse Numerique"
-, volume =	24
-, number =	5
-, year =	1990
-, pages =	"613--625"
-, annote =	"Proves that Delaunay switchings converge to DT."
+, author =      "C. Cherfils and F. Hermeline"
+, title =       "Diagonal Swap Procedures and Characterizations of 2{D}-{Delaunay} Triangulations"
+, journal =     "RAIRO-Mathematical Modelling And Numerical Analysis-Modelisation Mathematique Et Analyse Numerique"
+, volume =      24
+, number =      5
+, year =        1990
+, pages =       "613--625"
+, annote =      "Proves that Delaunay switchings converge to DT."
 }
 
 @article{ct-fmst-76
-, author =	"D. Cheriton and R. E. Tarjan"
-, title =	"Finding minimum spanning trees"
-, journal =	"SIAM J. Comput."
-, volume =	5
-, year =	1976
-, pages =	"724--742"
+, author =      "D. Cheriton and R. E. Tarjan"
+, title =       "Finding minimum spanning trees"
+, journal =     "SIAM J. Comput."
+, volume =      5
+, year =        1976
+, pages =       "724--742"
 }
 
 @techreport{ct-apkvc-??
-, author =	"J. Cheriyan and R. Thurimella"
-, title =	"Algorithms for Parallel $k$-Vertex Connectivity and Sparse Certificates"
-, institution =	"Eng. and Theory Center, Cornell Univ."
-, address =	"Ithaca, New York"
-, year =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "J. Cheriyan and R. Thurimella"
+, title =       "Algorithms for Parallel $k$-Vertex Connectivity and Sparse Certificates"
+, institution = "Eng. and Theory Center, Cornell Univ."
+, address =     "Ithaca, New York"
+, year =        "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{c-afspm-86
-, author =	"B. Cherkassky"
-, title =	"An algorithm for finding shortest paths in a maze"
-, journal =	"Optimization"
-, volume =	17
-, number =	2
-, year =	1986
-, pages =	"237--242"
-, keywords =	"motion planning, shortest paths"
-, update =	"95.09 korneenko"
+, author =      "B. Cherkassky"
+, title =       "An algorithm for finding shortest paths in a maze"
+, journal =     "Optimization"
+, volume =      17
+, number =      2
+, year =        1986
+, pages =       "237--242"
+, keywords =    "motion planning, shortest paths"
+, update =      "95.09 korneenko"
 }
 
 @incollection{c-cses-67
-, author =	"S. S. Chern"
-, title =	"Curves and Surfaces in {E}ucidean Space"
-, editor =	"S. S. Chern"
-, booktitle =	"Studies in Global Geometry and Analaysis"
-, series =	"MAA Studies in Mathmatics"
-, volume =	4
-, publisher =	"Math. Assoc. Amer."
-, year =	1967
-, pages =	"16--56"
-, update =	"01.04 orourke"
+, author =      "S. S. Chern"
+, title =       "Curves and Surfaces in {E}ucidean Space"
+, editor =      "S. S. Chern"
+, booktitle =   "Studies in Global Geometry and Analaysis"
+, series =      "MAA Studies in Mathmatics"
+, volume =      4
+, publisher =   "Math. Assoc. Amer."
+, year =        1967
+, pages =       "16--56"
+, update =      "01.04 orourke"
 }
 
 @incollection{c-cses-89
-, author =	"S. S. Chern"
-, title =	"Curves and Surfaces in {E}ucidean Space"
-, editor =	"S. S. Chern"
-, booktitle =	"Global Differential Geometry"
-, series =	"Studies in Mathmatics"
-, volume =	27
-, publisher =	"Math. Assoc. Amer."
-, year =	1989
-, pages =	"99--139"
-, comments =	"Explains/extends s-usedkkk-21"
-, update =	"00.11 smid, 00.07 orourke"
+, author =      "S. S. Chern"
+, title =       "Curves and Surfaces in {E}ucidean Space"
+, editor =      "S. S. Chern"
+, booktitle =   "Global Differential Geometry"
+, series =      "Studies in Mathmatics"
+, volume =      27
+, publisher =   "Math. Assoc. Amer."
+, year =        1989
+, pages =       "99--139"
+, comments =    "Explains/extends s-usedkkk-21"
+, update =      "00.11 smid, 00.07 orourke"
 }
 
 @article{c-maeth-52
-, author =	"H. Chernoff"
-, title =	"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of the observations"
-, journal =	"Ann. Math. Statist."
-, volume =	23
-, year =	1952
-, pages =	"493--509"
-, update =	"96.09 orourke"
+, author =      "H. Chernoff"
+, title =       "A measure of asymptotic efficiency for tests of a hypothesis based on the sum of the observations"
+, journal =     "Ann. Math. Statist."
+, volume =      23
+, year =        1952
+, pages =       "493--509"
+, update =      "96.09 orourke"
 }
 
 @article{co-eacf-84
-, author =	"N. I. Chernov and G. A. Ososkov"
-, title =	"Effective algorithms for circle fitting"
-, journal =	"Comput. Phys. Comm."
-, volume =	33
-, year =	1984
-, pages =	"329--333"
-, keywords =	"facility location, optimization, fitting, center"
-, update =	"96.09 devillers, 95.09 korneenko"
+, author =      "N. I. Chernov and G. A. Ososkov"
+, title =       "Effective algorithms for circle fitting"
+, journal =     "Comput. Phys. Comm."
+, volume =      33
+, year =        1984
+, pages =       "329--333"
+, keywords =    "facility location, optimization, fitting, center"
+, update =      "96.09 devillers, 95.09 korneenko"
 }
 
 @article{cv-fas-92
-, author =	"Jean-Marie Chesneaux and Jean Vignes"
-, title =	"Les fondements de l'arithm{\'e}tique stochastique"
-, journal =	"Compte-rendus de l'acad{\'e}mie des Sciences, Paris"
-, volume =	307
-, year =	1992
-, pages =	"1435--1440"
-, update =	"00.03 devillers"
+, author =      "Jean-Marie Chesneaux and Jean Vignes"
+, title =       "Les fondements de l'arithm{\'e}tique stochastique"
+, journal =     "Compte-rendus de l'acad{\'e}mie des Sciences, Paris"
+, volume =      307
+, year =        1992
+, pages =       "1435--1440"
+, update =      "00.03 devillers"
 }
 
 @book{c-sm-61
-, author =	"N. Chetayav"
-, title =	"The stability of motion"
-, publisher =	"Pergamon Press"
-, address =	"New York, NY"
-, year =	1961
-, update =	"98.07 bibrelex"
+, author =      "N. Chetayav"
+, title =       "The stability of motion"
+, publisher =   "Pergamon Press"
+, address =     "New York, NY"
+, year =        1961
+, update =      "98.07 bibrelex"
 }
 
 @article{c-fnspp-91
-, author =	"D. Chetverikov"
-, title =	"Fast neighborhood search in planar point sets"
-, journal =	"Pattern Recogn. Lett."
-, volume =	12
-, number =	7
-, year =	1991
-, pages =	"409--412"
-, keywords =	"proximity, points, searching"
-, update =	"95.09 korneenko"
+, author =      "D. Chetverikov"
+, title =       "Fast neighborhood search in planar point sets"
+, journal =     "Pattern Recogn. Lett."
+, volume =      12
+, number =      7
+, year =        1991
+, pages =       "409--412"
+, keywords =    "proximity, points, searching"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{c-gqdm3-97
-, author =	"L. Chew"
-, title =	"Guaranteed quality {Delaunay} meshing in 3D"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"391--393"
-, cites =	"be-mgot-92i, beg-pgmg-94, c-gqtm-89, c-gqmgc-93, mv-qmgtd-92i, r-nsaq2-93, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "L. Chew"
+, title =       "Guaranteed quality {Delaunay} meshing in 3D"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "391--393"
+, cites =       "be-mgot-92i, beg-pgmg-94, c-gqtm-89, c-gqmgc-93, mv-qmgtd-92i, r-nsaq2-93, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @techreport{c-bvdcp-86
-, author =	"L. P. Chew"
-, title =	"Building {Voronoi} diagrams for convex polygons in linear expected time"
-, type =	"Technical Report"
-, number =	"PCS-TR90-147"
-, institution =	"Dept. Math. Comput. Sci., Dartmouth College"
-, address =	"Hanover, NH"
-, year =	1986
-, succeeds =	"c-bvdcp-86t"
-, update =	"98.11 bibrelex, 94.09 lambert, 93.09 devillers"
+, author =      "L. P. Chew"
+, title =       "Building {Voronoi} diagrams for convex polygons in linear expected time"
+, type =        "Technical Report"
+, number =      "PCS-TR90-147"
+, institution = "Dept. Math. Comput. Sci., Dartmouth College"
+, address =     "Hanover, NH"
+, year =        1986
+, succeeds =    "c-bvdcp-86t"
+, update =      "98.11 bibrelex, 94.09 lambert, 93.09 devillers"
 }
 
 @techreport{c-bvdcp-86t
-, author =	"L. P. Chew"
-, title =	"Building {Voronoi} diagrams for convex polygons in linear expected time"
-, type =	"manuscript"
-, year =	1986
-, precedes =	"c-bvdcp-86"
-, update =	"98.11 bibrelex"
+, author =      "L. P. Chew"
+, title =       "Building {Voronoi} diagrams for convex polygons in linear expected time"
+, type =        "manuscript"
+, year =        1986
+, precedes =    "c-bvdcp-86"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{c-cdt-87
-, author =	"L. P. Chew"
-, title =	"Constrained {Delaunay} triangulations"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"215--222"
-, precedes =	"c-cdt-89"
-, cites =	"cd-vdbcd-85, c-tipga-86, c-pgsge-, f-savd-86, k-eccs-79, l-prp-78, ls-tacdt-80, ps-cgi-85, y-oavds-84, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "L. P. Chew"
+, title =       "Constrained {Delaunay} triangulations"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "215--222"
+, precedes =    "c-cdt-89"
+, cites =       "cd-vdbcd-85, c-tipga-86, c-pgsge-, f-savd-86, k-eccs-79, l-prp-78, ls-tacdt-80, ps-cgi-85, y-oavds-84, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{c-cdt-89
-, author =	"L. P. Chew"
-, title =	"Constrained {Delaunay} triangulations"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"97--108"
-, succeeds =	"c-cdt-87"
+, author =      "L. P. Chew"
+, title =       "Constrained {Delaunay} triangulations"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "97--108"
+, succeeds =    "c-cdt-87"
 }
 
 @inproceedings{c-gqmgc-93
-, author =	"L. P. Chew"
-, title =	"Guaranteed-quality mesh generation for curved surfaces"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"274--280"
-, cites =	"r-nsaq2-92, be-mgot-92i, beg-pgmg-90, c-gqtm-89, mv-qmgtd-92i, ms-cinap-92, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "L. P. Chew"
+, title =       "Guaranteed-quality mesh generation for curved surfaces"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "274--280"
+, cites =       "r-nsaq2-92, be-mgot-92i, beg-pgmg-90, c-gqtm-89, mv-qmgtd-92i, ms-cinap-92, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @techreport{c-gqtm-89
-, author =	"L. P. Chew"
-, title =	"Guaranteed-quality triangular meshes"
-, type =	"Technical {Report}"
-, number =	"TR-89-983"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	apr
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "L. P. Chew"
+, title =       "Guaranteed-quality triangular meshes"
+, type =        "Technical {Report}"
+, number =      "TR-89-983"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       apr
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{c-nqblv-93
-, author =	"L. P. Chew"
-, title =	"Near-quadratic bounds for the {$L_1$} {Voronoi} diagram of moving points"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"364--369"
-, precedes =	"c-nqblv-97"
-, cites =	"ass-sulbl-89, a-vdsfg-91, cd-vdbcd-85, ck-plscc-89, ck-cppop-93, gmr-vdmpp-92, kti-mmstl-92, ZZZ"
-, update =	"98.11 bibrelex, 97.03 devillers, 93.09 milone+mitchell"
+, author =      "L. P. Chew"
+, title =       "Near-quadratic bounds for the {$L_1$} {Voronoi} diagram of moving points"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "364--369"
+, precedes =    "c-nqblv-97"
+, cites =       "ass-sulbl-89, a-vdsfg-91, cd-vdbcd-85, ck-plscc-89, ck-cppop-93, gmr-vdmpp-92, kti-mmstl-92, ZZZ"
+, update =      "98.11 bibrelex, 97.03 devillers, 93.09 milone+mitchell"
 }
 
 @article{c-nqblv-97
-, author =	"L. P. Chew"
-, title =	"Near-quadratic bounds for the {$L_1$} {Voronoi} diagram of moving points"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"73--80"
-, succeeds =	"c-nqblv-93"
-, update =	"97.03 devillers"
+, author =      "L. P. Chew"
+, title =       "Near-quadratic bounds for the {$L_1$} {Voronoi} diagram of moving points"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "73--80"
+, succeeds =    "c-nqblv-93"
+, update =      "97.03 devillers"
 }
 
 @techreport{c-pgsge-
-, author =	"L. P. Chew"
-, title =	"Planar Graphs and Sparse Graphs for Efficient Motion Planning in the Plane"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
-, update =	"98.03 bibrelex"
+, author =      "L. P. Chew"
+, title =       "Planar Graphs and Sparse Graphs for Efficient Motion Planning in the Plane"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{c-pspdo-85
-, author =	"L. P. Chew"
-, title =	"Planning the shortest path for a disc in {$O(n^{2} \log n)$} time"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"214--220"
+, author =      "L. P. Chew"
+, title =       "Planning the shortest path for a disc in {$O(n^{2} \log n)$} time"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "214--220"
 }
 
 @article{c-tapga-89
-, author =	"L. P. Chew"
-, title =	"There are planar graphs almost as good as the complete graph"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	39
-, year =	1989
-, pages =	"205--219"
-, succeeds =	"c-tipga-86"
+, author =      "L. P. Chew"
+, title =       "There are planar graphs almost as good as the complete graph"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      39
+, year =        1989
+, pages =       "205--219"
+, succeeds =    "c-tipga-86"
 }
 
 @inproceedings{c-tipga-86
-, author =	"L. P. Chew"
-, title =	"There is a planar graph almost as good as the complete graph"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"169--177"
-, precedes =	"c-tapga-89"
-, cites =	"aaghi-vpses-85, cd-vdbcd-85, h-oarms-79, ls-tacdt-80, p-aspmt-85, sh-cpp-75, s-spacp-85, ss-spps-84, w-cvgnl-85, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "L. P. Chew"
+, title =       "There is a planar graph almost as good as the complete graph"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "169--177"
+, precedes =    "c-tapga-89"
+, cites =       "aaghi-vpses-85, cd-vdbcd-85, h-oarms-79, ls-tacdt-80, p-aspmt-85, sh-cpp-75, s-spacp-85, ss-spps-84, w-cvgnl-85, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{cdek-gpmds-95
-, author =	"L. P. Chew and D. Dor and A. Efrat and K. Kedem"
-, title =	"Geometric pattern matching in $d$-dimensional space"
-, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	979
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"264--279"
-, update =	"97.03 agarwal, 96.09 agarwal, 96.05 agarwal"
+, author =      "L. P. Chew and D. Dor and A. Efrat and K. Kedem"
+, title =       "Geometric pattern matching in $d$-dimensional space"
+, booktitle =   "Proc. 2nd Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      979
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "264--279"
+, update =      "97.03 agarwal, 96.09 agarwal, 96.05 agarwal"
 }
 
 @inproceedings{cd-vdbcd-85
-, author =	"L. P. Chew and R. L. {Drysdale, III}"
-, title =	"Voronoi diagrams based on convex distance functions"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"235--244"
-, keywords =	"Voronoi diagrams, points, two-dimensional, $L_{1}$ metric, $L_{p}$ metric, $L_{\infty}$ metric"
-, cites =	"c-ign-59, cdl-cler-84, d-gvdgs-79, h-oarms-79, k-eccs-79, kn-lts-63, k-ss-73, l-csta-82, l-tdvdl-80, l-knnvd-82, lw-vdllm-80, osy-rnamp-83, sh-cpp-75, y-oavds-84, ZZZ"
-, update =	"97.11 bibrelex, 93.09 drysdale"
+, author =      "L. P. Chew and R. L. {Drysdale, III}"
+, title =       "Voronoi diagrams based on convex distance functions"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "235--244"
+, keywords =    "Voronoi diagrams, points, two-dimensional, $L_{1}$ metric, $L_{p}$ metric, $L_{\infty}$ metric"
+, cites =       "c-ign-59, cdl-cler-84, d-gvdgs-79, h-oarms-79, k-eccs-79, kn-lts-63, k-ss-73, l-csta-82, l-tdvdl-80, l-knnvd-82, lw-vdllm-80, osy-rnamp-83, sh-cpp-75, y-oavds-84, ZZZ"
+, update =      "97.11 bibrelex, 93.09 drysdale"
 }
 
 @techreport{cd-vdsle-84
-, author =	"L. P. Chew and R. L. {Drysdale, III}"
-, title =	"Voronoi Diagrams to Solve Largest Empty Oriented-Convex-Shape Problems"
-, type =	"Extended {Abstract}"
-, institution =	"Dept. Math. Comput. Sci., Dartmouth College"
-, address =	"Hanover, NH"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "L. P. Chew and R. L. {Drysdale, III}"
+, title =       "Voronoi Diagrams to Solve Largest Empty Oriented-Convex-Shape Problems"
+, type =        "Extended {Abstract}"
+, institution = "Dept. Math. Comput. Sci., Dartmouth College"
+, address =     "Hanover, NH"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{cf-shvd-88
-, author =	"L. P. Chew and S. Fortune"
-, title =	"Sorting helps for {Voronoi} diagrams"
-, booktitle =	"Proc. 13th Symposium on Mathematical Programming, Japan"
-, publisher =	""
-, year =	1988
-, pages =	""
-, update =	"93.09 devillers"
+, author =      "L. P. Chew and S. Fortune"
+, title =       "Sorting helps for {Voronoi} diagrams"
+, booktitle =   "Proc. 13th Symposium on Mathematical Programming, Japan"
+, publisher =   ""
+, year =        1988
+, pages =       ""
+, update =      "93.09 devillers"
 }
 
 @article{cf-shvd-97
-, author =	"L. P. Chew and S. Fortune"
-, title =	"Sorting helps for {Voronoi} diagrams"
-, journal =	"Algorithmica"
-, volume =	18
-, year =	1997
-, pages =	"217--228"
-, update =	"97.11 smid"
+, author =      "L. P. Chew and S. Fortune"
+, title =       "Sorting helps for {Voronoi} diagrams"
+, journal =     "Algorithmica"
+, volume =      18
+, year =        1997
+, pages =       "217--228"
+, update =      "97.11 smid"
 }
 
 @inproceedings{cghkkk-gpmem-93
-, author =	"L. P. Chew and M. T. Goodrich and D. P. Huttenlocher and K. Kedem and J. M. Kleinberg and D. Kravets"
-, title =	"Geometric pattern matching under {Euclidean} motion"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"151--156"
-, precedes =	"cghkkk-gpmem-97"
-, cites =	"ast-apsgo-92, abb-amps-91, ag-mrpc-92, amww-cssgo-88, aiit-mlcop-90, achkm-ecmcp-90, akmsw-mpnrc-91, ab-pptr-88, c-tsplt-91a, cegs-dwclp-92, c-sdsno-87, c-pms-88, csss-otass-89, clr-ia-90, e-acg-87, gjpt-tsp-78, gs-dfbt-78, hs-adaps-92, hks-uevsi-91, isi-mgftc-89, m-apcad-83, r-lbchd-93, ck-igpmp-92, hkk-dvdmh-92i, ps-cgi-85, t-dsna-83, ZZZ"
-, update =	"99.03 forrest, 98.11 bibrelex, 97.03 devillers, 94.01 rote, 93.09 milone+mitchell"
+, author =      "L. P. Chew and M. T. Goodrich and D. P. Huttenlocher and K. Kedem and J. M. Kleinberg and D. Kravets"
+, title =       "Geometric pattern matching under {Euclidean} motion"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "151--156"
+, precedes =    "cghkkk-gpmem-97"
+, cites =       "ast-apsgo-92, abb-amps-91, ag-mrpc-92, amww-cssgo-88, aiit-mlcop-90, achkm-ecmcp-90, akmsw-mpnrc-91, ab-pptr-88, c-tsplt-91a, cegs-dwclp-92, c-sdsno-87, c-pms-88, csss-otass-89, clr-ia-90, e-acg-87, gjpt-tsp-78, gs-dfbt-78, hs-adaps-92, hks-uevsi-91, isi-mgftc-89, m-apcad-83, r-lbchd-93, ck-igpmp-92, hkk-dvdmh-92i, ps-cgi-85, t-dsna-83, ZZZ"
+, update =      "99.03 forrest, 98.11 bibrelex, 97.03 devillers, 94.01 rote, 93.09 milone+mitchell"
 }
 
 @article{cghkkk-gpmem-97
-, author =	"L. P. Chew and M. T. Goodrich and D. P. Huttenlocher and K. Kedem and J. M. Kleinberg and D. Kravets"
-, title =	"Geometric pattern matching under {Euclidean} motion"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"113--124"
-, succeeds =	"cghkkk-gpmem-93"
-, update =	"97.03 devillers"
+, author =      "L. P. Chew and M. T. Goodrich and D. P. Huttenlocher and K. Kedem and J. M. Kleinberg and D. Kravets"
+, title =       "Geometric pattern matching under {Euclidean} motion"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "113--124"
+, succeeds =    "cghkkk-gpmem-93"
+, update =      "97.03 devillers"
 }
 
 @article{ck-cppop-93
-, author =	"L. P. Chew and K. Kedem"
-, title =	"A convex polygon among polygonal obstacles: {Placement} and high-clearance motion"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"59--89"
-, succeeds =	"ck-plscc-89"
-, update =	"96.09 devillers, 95.05 agarwal"
+, author =      "L. P. Chew and K. Kedem"
+, title =       "A convex polygon among polygonal obstacles: {Placement} and high-clearance motion"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "59--89"
+, succeeds =    "ck-plscc-89"
+, update =      "96.09 devillers, 95.05 agarwal"
 }
 
 @article{ck-glbmh-98
-, author =	"L. Paul Chew and Klara Kedem"
-, title =	"Getting around a lower bound for the minimum {Hausdorff} distance"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"197--202"
-, update =	"98.11 devillers"
+, author =      "L. Paul Chew and Klara Kedem"
+, title =       "Getting around a lower bound for the minimum {Hausdorff} distance"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "197--202"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{ck-hcmpc-89
-, author =	"L. P. Chew and K. Kedem"
-, title =	"High-clearance motion planning for a convex polygon among polygonal obstacles"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	20
-, succeeds =	"ck-hcmpc-90"
+, author =      "L. P. Chew and K. Kedem"
+, title =       "High-clearance motion planning for a convex polygon among polygonal obstacles"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       20
+, succeeds =    "ck-hcmpc-90"
 }
 
 @techreport{ck-hcmpc-90
-, author =	"L. P. Chew and K. Kedem"
-, title =	"High-clearance motion planning for a convex polygon among polygonal obstacles"
-, type =	"Technical {Report}"
-, number =	"184/90"
-, institution =	"Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
-, address =	"Tel-Aviv, Israel"
-, year =	1990
-, keywords =	"robotics, motion planning, Voronoi diagrams"
-, comments =	"Also Cornell Technical Report TR~90-1133"
-, precedes =	"ck-hcmpc-89"
+, author =      "L. P. Chew and K. Kedem"
+, title =       "High-clearance motion planning for a convex polygon among polygonal obstacles"
+, type =        "Technical {Report}"
+, number =      "184/90"
+, institution = "Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
+, address =     "Tel-Aviv, Israel"
+, year =        1990
+, keywords =    "robotics, motion planning, Voronoi diagrams"
+, comments =    "Also Cornell Technical Report TR~90-1133"
+, precedes =    "ck-hcmpc-89"
 }
 
 @inproceedings{ck-igpmp-92
-, author =	"L. P. Chew and K. Kedem"
-, title =	"Improvements on geometric pattern matching problems"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"318--325"
+, author =      "L. P. Chew and K. Kedem"
+, title =       "Improvements on geometric pattern matching problems"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "318--325"
 }
 
 @inproceedings{ck-plscc-89
-, author =	"L. P. Chew and K. Kedem"
-, title =	"Placing the largest similar copy of a convex polygon among polygonal obstacles"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"167--174"
-, precedes =	"ck-cppop-93"
-, cites =	"ab-pptr-88, ass-sulbl-89, a-dcg-83, cd-vdbcd-85, c-pcp-83, c-cdt-89, f-fapct-85, f-savd-87, ks-empac-90, ll-gdtpg-86, ls-pptmc-87, scklps-gadss-86, y-oavds-87, ZZZ"
-, update =	"98.03 bibrelex, 94.05 devillers"
+, author =      "L. P. Chew and K. Kedem"
+, title =       "Placing the largest similar copy of a convex polygon among polygonal obstacles"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "167--174"
+, precedes =    "ck-cppop-93"
+, cites =       "ab-pptr-88, ass-sulbl-89, a-dcg-83, cd-vdbcd-85, c-pcp-83, c-cdt-89, f-fapct-85, f-savd-87, ks-empac-90, ll-gdtpg-86, ls-pptmc-87, scklps-gadss-86, y-oavds-87, ZZZ"
+, update =      "98.03 bibrelex, 94.05 devillers"
 }
 
 @techreport{cks-ocpad-94t
-, author =	"L. P. Chew and K. Kedem and S. Schirra"
-, title =	"On characteristic points and approximate decision algorithms for the minimum {Hausdorff} distance"
-, type =	"Report"
-, number =	"MPI-I-94-150"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, update =	"95.01 smid"
+, author =      "L. P. Chew and K. Kedem and S. Schirra"
+, title =       "On characteristic points and approximate decision algorithms for the minimum {Hausdorff} distance"
+, type =        "Report"
+, number =      "MPI-I-94-150"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, update =      "95.01 smid"
 }
 
 @inproceedings{ckstw-vdl3s-95
-, author =	"L. Paul Chew and Klara Kedem and Micha Sharir and Boaz Tagansky and Emo Welzl"
-, title =	"Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"197--204"
-, precedes =	"ckstw-vdl3s-98"
-, update =	"00.03 bibrelex, 96.09 agarwal, 96.05 mitchell"
+, author =      "L. Paul Chew and Klara Kedem and Micha Sharir and Boaz Tagansky and Emo Welzl"
+, title =       "Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "197--204"
+, precedes =    "ckstw-vdl3s-98"
+, update =      "00.03 bibrelex, 96.09 agarwal, 96.05 mitchell"
 }
 
 @article{ckstw-vdl3s-98
-, author =	"L. Paul Chew and Klara Kedem and Micha Sharir and Boaz Tagansky and Emo Welzl"
-, title =	"{Voronoi} Diagrams of Lines in 3-Space under Polyhedral Convex Distance Functions"
-, journal =	"J. Algorithms"
-, volume =	29
-, number =	2
-, year =	1998
-, pages =	"238--255"
-, succeeds =	"ckstw-vdl3s-95"
-, update =	"00.03 bibrelex"
+, author =      "L. Paul Chew and Klara Kedem and Micha Sharir and Boaz Tagansky and Emo Welzl"
+, title =       "{Voronoi} Diagrams of Lines in 3-Space under Polyhedral Convex Distance Functions"
+, journal =     "J. Algorithms"
+, volume =      29
+, number =      2
+, year =        1998
+, pages =       "238--255"
+, succeeds =    "ckstw-vdl3s-95"
+, update =      "00.03 bibrelex"
 }
 
 @techreport{cf-shvd-91
-, author =	"P. Chew and S. Fortune"
-, title =	"Sorting Helps for {Voronoi} Diagrams"
-, type =	"Manuscript"
-, institution =	"AT\&T Bell Laboratories"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "P. Chew and S. Fortune"
+, title =       "Sorting Helps for {Voronoi} Diagrams"
+, type =        "Manuscript"
+, institution = "AT\&T Bell Laboratories"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{cc-rhesc-89
-, author =	"D. Chhajed and V. Chandru"
-, title =	"Rectilinear hull, efficient sets, convex hull: relationship and algorithms"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	37
+, author =      "D. Chhajed and V. Chandru"
+, title =       "Rectilinear hull, efficient sets, convex hull: relationship and algorithms"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       37
 }
 
 @inproceedings{c-mnrpd-88
-, author =	"G. C.-P. Chi"
-, title =	"Method for net representation with polygon decomposition"
-, booktitle =	"Proc. Internat. Conf. Computer-Aided Design"
-, year =	1988
-, pages =	"222--225"
-, keywords =	"polygon, decomposition"
-, update =	"95.09 korneenko"
+, author =      "G. C.-P. Chi"
+, title =       "Method for net representation with polygon decomposition"
+, booktitle =   "Proc. Internat. Conf. Computer-Aided Design"
+, year =        1988
+, pages =       "222--225"
+, keywords =    "polygon, decomposition"
+, update =      "95.09 korneenko"
 }
 
 @phdthesis{c-edt-92
-, author =	"C.-S. Chiang"
-, title =	"The {Euclidean} distance transform"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, month =	aug
-, year =	1992
-, note =	"Report CSD-TR 92-050"
-, keywords =	"doctoral thesis, geometric transformations, medial axis, two-dimensional, three-dimensional"
-, update =	"93.05 jones"
-, abstract =	"The medial-axis transform (MAT), also called skeleton, is a
+, author =      "C.-S. Chiang"
+, title =       "The {Euclidean} distance transform"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, month =       aug
+, year =        1992
+, note =        "Report CSD-TR 92-050"
+, keywords =    "doctoral thesis, geometric transformations, medial axis, two-dimensional, three-dimensional"
+, update =      "93.05 jones"
+, abstract =    "The medial-axis transform (MAT), also called skeleton, is a
 shape abstraction proposed by computer vision, and has a number of important
 engineering applications such as finite-element mesh generation.  The theory
 for the MAT of 2D solids is investigated.  We prove the uniqueness,
@@ -35063,1815 +35063,1815 @@ @phdthesis{c-edt-92
 }
 
 @article{c-epioe-98
-, author =	"Yi-Jen Chiang"
-, title =	"Experiments on the Practical {I/O} Efficiency of Geometric Algorithms: {Distribution} Sweep Versus Plane Sweep"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, number =	4
-, year =	1998
-, pages =	"211--236"
-, succeeds =	"c-epioe-95"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Yi-Jen Chiang"
+, title =       "Experiments on the Practical {I/O} Efficiency of Geometric Algorithms: {Distribution} Sweep Versus Plane Sweep"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, number =      4
+, year =        1998
+, pages =       "211--236"
+, succeeds =    "c-epioe-95"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{c-epioe-95
-, author =	"Yi-Jen Chiang"
-, title =	"Experiments on the Practical {I/O} Efficiency of Geometric Algorithms: {Distribution} Sweep vs. Plane Sweep"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"346--357"
-, precedes =	"c-epioe-98"
-, update =	"99.07 bibrelex, 98.03 mitchell, 96.01 smid, 95.05 mitchell"
+, author =      "Yi-Jen Chiang"
+, title =       "Experiments on the Practical {I/O} Efficiency of Geometric Algorithms: {Distribution} Sweep vs. Plane Sweep"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "346--357"
+, precedes =    "c-epioe-98"
+, update =      "99.07 bibrelex, 98.03 mitchell, 96.01 smid, 95.05 mitchell"
 }
 
 @inproceedings{cggtvv-emga-95
-, author =	"Y.-J. Chiang and M. T. Goodrich and E. F. Grove and R. Tamassia and D. E. Vengroff and J. S. Vitter"
-, title =	"External-Memory Graph Algorithms"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"139--149"
-, url =	"https://www.cs.brown.edu/cgc/papers/cggtvv-emga-95.ps.gz"
-, update =	"97.03 tamassia, 95.05 tamassia, 95.01 tamassia"
+, author =      "Y.-J. Chiang and M. T. Goodrich and E. F. Grove and R. Tamassia and D. E. Vengroff and J. S. Vitter"
+, title =       "External-Memory Graph Algorithms"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "139--149"
+, url = "https://www.cs.brown.edu/cgc/papers/cggtvv-emga-95.ps.gz"
+, update =      "97.03 tamassia, 95.05 tamassia, 95.01 tamassia"
 }
 
 @inproceedings{cklm-gacdr-97
-, author =	"Y.-J. Chiang and J. T. Klosowski and C. Lee and Joseph S. B. Mitchell"
-, title =	"Geometric Algorithms for Conflict Detection/Resolution in ATM"
-, booktitle =	"36th IEEE Conference on Decision and Control"
-, site =	"San Diego, CA"
-, month =	dec
-, year =	1997
-, pages =	"1835--1840"
-, keywords =	"air traffic control, conflict resolution, nearest neighbors"
-, update =	"98.03 mitchell"
+, author =      "Y.-J. Chiang and J. T. Klosowski and C. Lee and Joseph S. B. Mitchell"
+, title =       "Geometric Algorithms for Conflict Detection/Resolution in ATM"
+, booktitle =   "36th IEEE Conference on Decision and Control"
+, site =        "San Diego, CA"
+, month =       dec
+, year =        1997
+, pages =       "1835--1840"
+, keywords =    "air traffic control, conflict resolution, nearest neighbors"
+, update =      "98.03 mitchell"
 }
 
 @techreport{cm-tpesp-97
-, author =	"Yi-Jen Chiang and Joseph S. B. Mitchell"
-, title =	"Two-Point {Euclidean} Shortest Path Queries in the Plane"
-, type =	"Technical {Report}"
-, institution =	"University at Stony Brook"
-, year =	1997
-, keywords =	"all-pairs shortest paths, geodesic paths, point location, shortest path maps, visibility"
-, update =	"98.03 mitchell"
+, author =      "Yi-Jen Chiang and Joseph S. B. Mitchell"
+, title =       "Two-Point {Euclidean} Shortest Path Queries in the Plane"
+, type =        "Technical {Report}"
+, institution = "University at Stony Brook"
+, year =        1997
+, keywords =    "all-pairs shortest paths, geodesic paths, point location, shortest path maps, visibility"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cm-tpesp-98
-, author =	"Yi-Jen Chiang and Joseph S. B. Mitchell"
-, title =	"Two-Point {Euclidean} Shortest Path Queries in the Plane"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"55--57"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "Yi-Jen Chiang and Joseph S. B. Mitchell"
+, title =       "Two-Point {Euclidean} Shortest Path Queries in the Plane"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "55--57"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{cpt-uadpl-93
-, author =	"Y.-J. Chiang and F. P. Preparata and R. Tamassia"
-, title =	"A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"44--53"
-, precedes =	"cpt-uadpl-96"
-, update =	"96.05 smid, 93.05 smid"
+, author =      "Y.-J. Chiang and F. P. Preparata and R. Tamassia"
+, title =       "A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "44--53"
+, precedes =    "cpt-uadpl-96"
+, update =      "96.05 smid, 93.05 smid"
 }
 
 @article{cpt-uadpl-96
-, author =	"Y.-J. Chiang and F. P. Preparata and R. Tamassia"
-, title =	"A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, year =	1996
-, pages =	"207--233"
-, url =	"https://www.cs.brown.edu/cgc/papers/cpt-uadpl-96.ps.gz"
-, succeeds =	"cpt-uadpl-93"
-, update =	"97.03 tamassia, 96.05 smid, 95.01 tamassia"
+, author =      "Y.-J. Chiang and F. P. Preparata and R. Tamassia"
+, title =       "A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, pages =       "207--233"
+, url = "https://www.cs.brown.edu/cgc/papers/cpt-uadpl-96.ps.gz"
+, succeeds =    "cpt-uadpl-93"
+, update =      "97.03 tamassia, 96.05 smid, 95.01 tamassia"
 }
 
 @inproceedings{cs-ioie-97
-, author =	"Y.-J. Chiang and C. T. Silva"
-, title =	"{I/O} Optimal Isosurface Extraction"
-, booktitle =	"Proc. IEEE Visualization"
-, site =	"Phoenix, AZ"
-, year =	1997
-, pages =	"293--300"
-, update =	"98.03 mitchell"
+, author =      "Y.-J. Chiang and C. T. Silva"
+, title =       "{I/O} Optimal Isosurface Extraction"
+, booktitle =   "Proc. IEEE Visualization"
+, site =        "Phoenix, AZ"
+, year =        1997
+, pages =       "293--300"
+, update =      "98.03 mitchell"
 }
 
 @techreport{cs-ielsv-97
-, author =	"Y.-J. Chiang and C. T. Silva"
-, title =	"Isosurface Extraction in Large Scientific Visualization Applications Using the {I/O}-filter Technique"
-, type =	"Manuscript"
-, institution =	"University at Stony Brook"
-, month =	nov
-, year =	1997
-, update =	"98.03 mitchell"
+, author =      "Y.-J. Chiang and C. T. Silva"
+, title =       "Isosurface Extraction in Large Scientific Visualization Applications Using the {I/O}-filter Technique"
+, type =        "Manuscript"
+, institution = "University at Stony Brook"
+, month =       nov
+, year =        1997
+, update =      "98.03 mitchell"
 }
 
 @techreport{css-iocie-98
-, author =	"Yi-Jen Chiang and Claudio T. Silva and William Schroeder"
-, title =	"Interactive Out-of-Core Isosurface Extraction"
-, institution =	"University at Stony Brook"
-, year =	1998
-, comments =	"Submitted for publication"
-, update =	"98.07 mitchell"
+, author =      "Yi-Jen Chiang and Claudio T. Silva and William Schroeder"
+, title =       "Interactive Out-of-Core Isosurface Extraction"
+, institution = "University at Stony Brook"
+, year =        1998
+, comments =    "Submitted for publication"
+, update =      "98.07 mitchell"
 }
 
 @techreport{ct-dacg-91
-, author =	"Y.-J. Chiang and R. Tamassia"
-, title =	"Dynamic algorithms in computational geometry"
-, type =	"Report"
-, number =	"CS-91-24"
-, institution =	"Comput. Sci. Dept., Brown Univ."
-, address =	"Providence, RI"
-, year =	1991
-, keywords =	"survey paper"
+, author =      "Y.-J. Chiang and R. Tamassia"
+, title =       "Dynamic algorithms in computational geometry"
+, type =        "Report"
+, number =      "CS-91-24"
+, institution = "Comput. Sci. Dept., Brown Univ."
+, address =     "Providence, RI"
+, year =        1991
+, keywords =    "survey paper"
 }
 
 @article{ct-dacg-92
-, author =	"Y.-J. Chiang and R. Tamassia"
-, title =	"Dynamic algorithms in computational geometry"
-, journal =	"Proc. IEEE"
-, volume =	80
-, number =	9
-, month =	sep
-, year =	1992
-, pages =	"1412--1434"
-, keywords =	"survey paper"
+, author =      "Y.-J. Chiang and R. Tamassia"
+, title =       "Dynamic algorithms in computational geometry"
+, journal =     "Proc. IEEE"
+, volume =      80
+, number =      9
+, month =       sep
+, year =        1992
+, pages =       "1412--1434"
+, keywords =    "survey paper"
 }
 
 @inproceedings{ct-dtmpp-91
-, author =	"Y.-J. Chiang and R. Tamassia"
-, title =	"Dynamization of the trapezoid method for planar point location"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"61--70"
-, keywords =	"point location, subdivision, dynamizing data structures"
-, precedes =	"ct-dtmpp-92"
-, cites =	"bst-bst-85, cj-nrdpp-90, ct-dacg-91, egs-oplms-86, f-zepud-85, fmn-dgds-85, gt-dtdpl-91, k-osps-83, lp-lppsi-77, m-pst-85, m-dsa-84, ol-mcp-81, o-ddds-83, o-rssls-85, p-nappl-81, ps-cgi-85, pt-fdplm-89, pt-dpplo-90, st-pplup-86, t-irmdp-91, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "Y.-J. Chiang and R. Tamassia"
+, title =       "Dynamization of the trapezoid method for planar point location"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "61--70"
+, keywords =    "point location, subdivision, dynamizing data structures"
+, precedes =    "ct-dtmpp-92"
+, cites =       "bst-bst-85, cj-nrdpp-90, ct-dacg-91, egs-oplms-86, f-zepud-85, fmn-dgds-85, gt-dtdpl-91, k-osps-83, lp-lppsi-77, m-pst-85, m-dsa-84, ol-mcp-81, o-ddds-83, o-rssls-85, p-nappl-81, ps-cgi-85, pt-fdplm-89, pt-dpplo-90, st-pplup-86, t-irmdp-91, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{ct-dtmpp-92
-, author =	"Y.-J. Chiang and R. Tamassia"
-, title =	"Dynamization of the trapezoid method for planar point location in monotone subdivisions"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"311--333"
-, keywords =	"planar point location, dynamic data structures, monotone subdivision, analysis of algorithm"
-, succeeds =	"ct-dtmpp-91"
-, update =	"94.05 tamassia"
+, author =      "Y.-J. Chiang and R. Tamassia"
+, title =       "Dynamization of the trapezoid method for planar point location in monotone subdivisions"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "311--333"
+, keywords =    "planar point location, dynamic data structures, monotone subdivision, analysis of algorithm"
+, succeeds =    "ct-dtmpp-91"
+, update =      "94.05 tamassia"
 }
 
 @techreport{ct-ospml-94t
-, author =	"Y.-J. Chiang and R. Tamassia"
-, title =	"Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons in the Presence of Obstacles"
-, type =	"Report"
-, number =	"CS-94-03"
-, institution =	"Comput. Sci. Dept., Brown Univ."
-, address =	"Providence, RI"
-, year =	1994
-, update =	"94.05 tamassia"
+, author =      "Y.-J. Chiang and R. Tamassia"
+, title =       "Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons in the Presence of Obstacles"
+, type =        "Report"
+, number =      "CS-94-03"
+, institution = "Comput. Sci. Dept., Brown Univ."
+, address =     "Providence, RI"
+, year =        1994
+, update =      "94.05 tamassia"
 }
 
 @article{ct-ospml-97
-, author =	"Y.-J. Chiang and R. Tamassia"
-, title =	"Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"85--121"
-, url =	"https://www.cs.brown.edu/cgc/papers/ct-ospml-.ps.gz"
-, keywords =	"Shortest Path, Minimum-Link Path, dynamic algorithm, CGC, Brown"
-, succeeds =	"ct-ospml-94i"
-, update =	"98.07 mitchell, 97.11 bibrelex, 97.07 devillers, 97.03 tamassia, 96.09 tamassia, 95.01 tamassia"
+, author =      "Y.-J. Chiang and R. Tamassia"
+, title =       "Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "85--121"
+, url = "https://www.cs.brown.edu/cgc/papers/ct-ospml-.ps.gz"
+, keywords =    "Shortest Path, Minimum-Link Path, dynamic algorithm, CGC, Brown"
+, succeeds =    "ct-ospml-94i"
+, update =      "98.07 mitchell, 97.11 bibrelex, 97.07 devillers, 97.03 tamassia, 96.09 tamassia, 95.01 tamassia"
 }
 
 @inproceedings{ct-ospml-94i
-, author =	"Y.-J. Chiang and R. Tamassia"
-, title =	"Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles"
-, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
-, nickname =	"ESA '94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"266--277"
-, keywords =	"Shortest Path, Minimum-Link Path, dynamic algorithm"
-, update =	"95.01 tamassia"
+, author =      "Y.-J. Chiang and R. Tamassia"
+, title =       "Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles"
+, booktitle =   "Proc. 2nd Annu. European Sympos. Algorithms"
+, nickname =    "ESA '94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "266--277"
+, keywords =    "Shortest Path, Minimum-Link Path, dynamic algorithm"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{cnytf-ahmgs-96
-, author =	"N. Chiba and I. Nisbigaki and Y. Yamasbita and C. Takizawa and K. Fujisbiro"
-, title =	"Automatic hexahedral mesh generation system based on shape-recognition and boundary-fit method"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"281--290"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "N. Chiba and I. Nisbigaki and Y. Yamasbita and C. Takizawa and K. Fujisbiro"
+, title =       "Automatic hexahedral mesh generation system based on shape-recognition and boundary-fit method"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "281--290"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @inproceedings{cns-ampg-79
-, author =	"N. Chiba and I. Nishioka and I. Shirakawa"
-, title =	"An Algorithm of Maximal Planarization of Graphs"
-, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
-, year =	1979
-, pages =	"649--652"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "N. Chiba and I. Nishioka and I. Shirakawa"
+, title =       "An Algorithm of Maximal Planarization of Graphs"
+, booktitle =   "Proc. IEEE Internat. Sympos. on Circuits and Systems"
+, year =        1979
+, pages =       "649--652"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{cn-asla-85
-, author =	"N. Chiba and T. Nishizeki"
-, title =	"Arboricity and subgraph listing algorithms"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"210--223"
-, update =	"97.11 bibrelex"
+, author =      "N. Chiba and T. Nishizeki"
+, title =       "Arboricity and subgraph listing algorithms"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "210--223"
+, update =      "97.11 bibrelex"
 }
 
 @article{cn-hcpls-89
-, author =	"N. Chiba and T. Nishizeki"
-, title =	"The {Hamiltonian} cycle problem is linear-time solvable for 4-connected planar graphs"
-, journal =	"J. Algorithms"
-, volume =	10
-, number =	2
-, month =	jun
-, year =	1989
-, pages =	"187--211"
-, update =	"98.11 bibrelex"
+, author =      "N. Chiba and T. Nishizeki"
+, title =       "The {Hamiltonian} cycle problem is linear-time solvable for 4-connected planar graphs"
+, journal =     "J. Algorithms"
+, volume =      10
+, number =      2
+, month =       jun
+, year =        1989
+, pages =       "187--211"
+, update =      "98.11 bibrelex"
 }
 
 @article{cnao-laepg-85
-, author =	"N. Chiba and T. Nishizeki and S. Abe and T. Ozawa"
-, title =	"A Linear Algorithm for Embedding Planar Graphs Using {PQ}-Trees"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	30
-, number =	1
-, year =	1985
-, pages =	"54--76"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "N. Chiba and T. Nishizeki and S. Abe and T. Ozawa"
+, title =       "A Linear Algorithm for Embedding Planar Graphs Using {PQ}-Trees"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      30
+, number =      1
+, year =        1985
+, pages =       "54--76"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{cns-l5cap-81
-, author =	"N. Chiba and T. Nishizeki and N. Saito"
-, title =	"A linear $5$-coloring algorithm of planar graphs"
-, journal =	"J. Algorithms"
-, volume =	2
-, year =	1981
-, pages =	"317--327"
-, update =	"98.07 bibrelex"
+, author =      "N. Chiba and T. Nishizeki and N. Saito"
+, title =       "A linear $5$-coloring algorithm of planar graphs"
+, journal =     "J. Algorithms"
+, volume =      2
+, year =        1981
+, pages =       "317--327"
+, update =      "98.07 bibrelex"
 }
 
 @article{con-dpgn-85
-, author =	"N. Chiba and K. Onoguchi and T. Nishizeki"
-, title =	"Drawing Planar Graphs Nicely"
-, journal =	"Acta Inform."
-, volume =	22
-, year =	1985
-, pages =	"187--201"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "N. Chiba and K. Onoguchi and T. Nishizeki"
+, title =       "Drawing Planar Graphs Nicely"
+, journal =     "Acta Inform."
+, volume =      22
+, year =        1985
+, pages =       "187--201"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @incollection{cyn-lacdp-84
-, author =	"N. Chiba and T. Yamanouchi and T. Nishizeki"
-, title =	"Linear Algorithms for Convex Drawings of Planar Graphs"
-, editor =	"J. A. Bondy and U. S. R. Murty"
-, booktitle =	"Progress in Graph Theory"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1984
-, pages =	"153--173"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "N. Chiba and T. Yamanouchi and T. Nishizeki"
+, title =       "Linear Algorithms for Convex Drawings of Planar Graphs"
+, editor =      "J. A. Bondy and U. S. R. Murty"
+, booktitle =   "Progress in Graph Theory"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1984
+, pages =       "153--173"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{ca-mrsro-89
-, author =	"C. Chien and J. Aggarwal"
-, title =	"Model reconstruction and shape recognition from occluding contours"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	11
-, year =	1989
-, pages =	"372--389"
-, update =	"98.11 bibrelex"
+, author =      "C. Chien and J. Aggarwal"
+, title =       "Model reconstruction and shape recognition from occluding contours"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      11
+, year =        1989
+, pages =       "372--389"
+, update =      "98.11 bibrelex"
 }
 
 @article{ca-vsort-86
-, author =	"C. H. Chien and J. K. Aggarwal"
-, title =	"Volume/surface octrees for the representation of three-dimensional objects"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	36
-, year =	1986
-, pages =	"100--113"
-, update =	"98.11 bibrelex"
+, author =      "C. H. Chien and J. K. Aggarwal"
+, title =       "Volume/surface octrees for the representation of three-dimensional objects"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      36
+, year =        1986
+, pages =       "100--113"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{cs-sglb-95
-, author =	"Hank Chien and William Steiger"
-, title =	"Some Geometric Lower Bounds"
-, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1004
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"72--81"
-, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
+, author =      "Hank Chien and William Steiger"
+, title =       "Some Geometric Lower Bounds"
+, booktitle =   "Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1004
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "72--81"
+, update =      "98.07 bibrelex, 96.01 smid, 95.09 mitchell"
 }
 
 @article{csw-uacpc-85
-, author =	"F. Chin and J. Sampson and C. A. Wang"
-, title =	"A unifying approach for a class of problems in the computational geometry of polygons"
-, journal =	"Visual Comput."
-, volume =	1
-, year =	1985
-, pages =	"124--132"
+, author =      "F. Chin and J. Sampson and C. A. Wang"
+, title =       "A unifying approach for a class of problems in the computational geometry of polygons"
+, journal =     "Visual Comput."
+, volume =      1
+, year =        1985
+, pages =       "124--132"
 }
 
 @inproceedings{csw-fmasp-95
-, author =	"Francis Chin and Jack Snoeyink and Cao-An Wang"
-, title =	"Finding the Medial Axis of a Simple Polygon in Linear Time"
-, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1004
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"382--391"
-, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
+, author =      "Francis Chin and Jack Snoeyink and Cao-An Wang"
+, title =       "Finding the Medial Axis of a Simple Polygon in Linear Time"
+, booktitle =   "Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1004
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "382--391"
+, update =      "98.07 bibrelex, 96.01 smid, 95.09 mitchell"
 }
 
 @article{csw-fmasp-99
-, author =	"F. Chin and J. Snoeyink and C. A. Wang"
-, title =	"Finding the Medial Axis of a Simple Polygon in Linear Time"
-, journal =	"Discrete Comput. Geom."
-, volume =	21
-, number =	3
-, year =	1999
-, pages =	"405--420"
-, update =	"99.07 held"
+, author =      "F. Chin and J. Snoeyink and C. A. Wang"
+, title =       "Finding the Medial Axis of a Simple Polygon in Linear Time"
+, journal =     "Discrete Comput. Geom."
+, volume =      21
+, number =      3
+, year =        1999
+, pages =       "405--420"
+, update =      "99.07 held"
 }
 
 @article{cw-fcdtc-98
-, author =	"F. Chin and C. A. Wang"
-, title =	"Finding the constrained {Delaunay} triangulation and constrained {Voronoi} diagram of a simple polygon in linear time"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1998
-, pages =	"471--486"
-, update =	"99.07 smid"
+, author =      "F. Chin and C. A. Wang"
+, title =       "Finding the constrained {Delaunay} triangulation and constrained {Voronoi} diagram of a simple polygon in linear time"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1998
+, pages =       "471--486"
+, update =      "99.07 smid"
 }
 
 @article{cw-mvdbs-84
-, author =	"F. Chin and C. A. Wang"
-, title =	"Minimum vertex distance between separable convex polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	18
-, year =	1984
-, pages =	"41--45"
+, author =      "F. Chin and C. A. Wang"
+, title =       "Minimum vertex distance between separable convex polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      18
+, year =        1984
+, pages =       "41--45"
 }
 
 @article{cw-oaimd-83
-, author =	"F. Chin and C. A. Wang"
-, title =	"Optimal Algorithms for the Intersection and the Minimum Distance Problems between Planar Polygons"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-32"
-, number =	12
-, year =	1983
-, pages =	"1203--1207"
-, update =	"93.09 held"
+, author =      "F. Chin and C. A. Wang"
+, title =       "Optimal Algorithms for the Intersection and the Minimum Distance Problems between Planar Polygons"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-32"
+, number =      12
+, year =        1983
+, pages =       "1203--1207"
+, update =      "93.09 held"
 }
 
 @article{ckl-eicrs-84
-, author =	"F. Y. Chin and P. Kossowki and S. C. Loh"
-, title =	"Efficient interference control for range sum queries"
-, journal =	"Theoret. Comput. Sci."
-, volume =	32
-, year =	1984
-, pages =	"77--86"
+, author =      "F. Y. Chin and P. Kossowki and S. C. Loh"
+, title =       "Efficient interference control for range sum queries"
+, journal =     "Theoret. Comput. Sci."
+, volume =      32
+, year =        1984
+, pages =       "77--86"
 }
 
 @inproceedings{cw-dgtp3-95
-, author =	"Francis Y. Chin and Cao An Wang"
-, title =	"On the Difficulty of Greedy Tetrahedralization of Points in $3$-D"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"285--290"
-, update =	"95.09 jones"
+, author =      "Francis Y. Chin and Cao An Wang"
+, title =       "On the Difficulty of Greedy Tetrahedralization of Points in $3$-D"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "285--290"
+, update =      "95.09 jones"
 }
 
 @article{cf-fopsg-92
-, author =	"Norman Chin and Steven Feiner"
-, title =	"Fast object-precision shadow generation for areal light sources using {BSP} trees"
-, journal =	"Comput. Graph."
-, volume =	25
-, month =	mar
-, year =	1992
-, pages =	"21--30"
-, note =	"Proc. 1992 Sympos. Interactive 3D Graphics"
-, keywords =	"shadow volume, area light source, penumbra, umbra"
-, update =	"98.07 bibrelex, 97.07 agarwal"
+, author =      "Norman Chin and Steven Feiner"
+, title =       "Fast object-precision shadow generation for areal light sources using {BSP} trees"
+, journal =     "Comput. Graph."
+, volume =      25
+, month =       mar
+, year =        1992
+, pages =       "21--30"
+, note =        "Proc. 1992 Sympos. Interactive 3D Graphics"
+, keywords =    "shadow volume, area light source, penumbra, umbra"
+, update =      "98.07 bibrelex, 97.07 agarwal"
 }
 
 @inproceedings{cf-nrtsg-89
-, author =	"Norman Chin and Steven Feiner"
-, title =	"Near Real-Time Shadow Generation Using {BSP} Trees"
-, booktitle =	"Proc. SIGGRAPH '89"
-, volume =	23
-, number =	3
-, publisher =	"ACM SIGGRAPH"
-, address =	"New York"
-, month =	aug
-, year =	1989
-, pages =	"99--106"
-, update =	"98.11 bibrelex, 97.07 agarwal, 97.03 schwarzkopf"
+, author =      "Norman Chin and Steven Feiner"
+, title =       "Near Real-Time Shadow Generation Using {BSP} Trees"
+, booktitle =   "Proc. SIGGRAPH '89"
+, volume =      23
+, number =      3
+, publisher =   "ACM SIGGRAPH"
+, address =     "New York"
+, month =       aug
+, year =        1989
+, pages =       "99--106"
+, update =      "98.11 bibrelex, 97.07 agarwal, 97.03 schwarzkopf"
 }
 
 @article{cd-mbrrv-86
-, author =	"R. T. Chin and C. R. Dyer"
-, title =	"Model-based recognition in robot vision"
-, journal =	"ACM Comput. Surv."
-, volume =	18
-, year =	1986
-, pages =	"67--108"
-, update =	"97.11 bibrelex"
+, author =      "R. T. Chin and C. R. Dyer"
+, title =       "Model-based recognition in robot vision"
+, journal =     "ACM Comput. Surv."
+, volume =      18
+, year =        1986
+, pages =       "67--108"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{cn-owr-86
-, author =	"W. Chin and S. Ntafos"
-, title =	"Optimum watchman routes"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"24--33"
-, precedes =	"cn-owr-88"
-, cites =	"at-eadps-81, c-ctpg-75, cw-oaimd-83, e-cedbt-85, eow-sgrag-84, f-spcwt-78, gj-cigtn-79, gjpt-tsp-78, kkk-tgrfw-83, ll-ccagp-86, lp-esppr-84, ln-prpss-91, l-dprcq-85, o-aprag-83, o-gnfmg-83, p-etspi-77, s-oadrp-82, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "W. Chin and S. Ntafos"
+, title =       "Optimum watchman routes"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "24--33"
+, precedes =    "cn-owr-88"
+, cites =       "at-eadps-81, c-ctpg-75, cw-oaimd-83, e-cedbt-85, eow-sgrag-84, f-spcwt-78, gj-cigtn-79, gjpt-tsp-78, kkk-tgrfw-83, ll-ccagp-86, lp-esppr-84, ln-prpss-91, l-dprcq-85, o-aprag-83, o-gnfmg-83, p-etspi-77, s-oadrp-82, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{cn-owr-88
-, author =	"W. Chin and S. Ntafos"
-, title =	"Optimum watchman routes"
-, journal =	"Inform. Process. Lett."
-, volume =	28
-, year =	1988
-, pages =	"39--44"
-, succeeds =	"cn-owr-86"
-, precedes =	"cn-wrsp-91"
+, author =      "W. Chin and S. Ntafos"
+, title =       "Optimum watchman routes"
+, journal =     "Inform. Process. Lett."
+, volume =      28
+, year =        1988
+, pages =       "39--44"
+, succeeds =    "cn-owr-86"
+, precedes =    "cn-wrsp-91"
 }
 
 @article{cn-ozkr-89
-, author =	"W. Chin and S. Ntafos"
-, title =	"Optimum zoo-keeper routes"
-, journal =	"Congr. Numer."
-, volume =	"??"
-, year =	1989
-, update =	"98.11 bibrelex"
+, author =      "W. Chin and S. Ntafos"
+, title =       "Optimum zoo-keeper routes"
+, journal =     "Congr. Numer."
+, volume =      "??"
+, year =        1989
+, update =      "98.11 bibrelex"
 }
 
 @article{cn-ozr-87
-, author =	"W.-P. Chin and S. Ntafos"
-, title =	"Optimum zookeeper routes"
-, journal =	"Congr. Numer."
-, volume =	58
-, year =	1987
-, pages =	"257--266"
-, note =	"Combinatorics, Graph Theory and Computing. Proc. 20th South-East Conf., Boca Raton"
-, keywords =	"visibility"
-, update =	"95.09 korneenko"
+, author =      "W.-P. Chin and S. Ntafos"
+, title =       "Optimum zookeeper routes"
+, journal =     "Congr. Numer."
+, volume =      58
+, year =        1987
+, pages =       "257--266"
+, note =        "Combinatorics, Graph Theory and Computing. Proc. 20th South-East Conf., Boca Raton"
+, keywords =    "visibility"
+, update =      "95.09 korneenko"
 }
 
 @techreport{cn-swrsp-
-, author =	"W. P. Chin and S. Ntafos"
-, title =	"Shortest Watchman Routes in simple polygons"
-, type =	"Technical Report"
-, precedes =	"cn-wrsp-91, cn-wrsp-87"
-, update =	"98.11 bibrelex"
+, author =      "W. P. Chin and S. Ntafos"
+, title =       "Shortest Watchman Routes in simple polygons"
+, type =        "Technical Report"
+, precedes =    "cn-wrsp-91, cn-wrsp-87"
+, update =      "98.11 bibrelex"
 }
 
 @article{cn-wrsp-91
-, author =	"W.-P. Chin and S. Ntafos"
-, title =	"Shortest Watchman routes in simple polygons"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, number =	1
-, year =	1991
-, pages =	"9--31"
-, keywords =	"visibility"
-, succeeds =	"cn-owr-88, cn-swrsp-"
-, update =	"98.11 bibrelex"
+, author =      "W.-P. Chin and S. Ntafos"
+, title =       "Shortest Watchman routes in simple polygons"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, number =      1
+, year =        1991
+, pages =       "9--31"
+, keywords =    "visibility"
+, succeeds =    "cn-owr-88, cn-swrsp-"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{cn-wrsp-87
-, author =	"W. P. Chin and S. Ntafos"
-, title =	"Watchman routes in simple polygons"
-, type =	"Technical {Report}"
-, institution =	"Dept. Comput. Sci., Univ. Texas"
-, address =	"Dallas, TX"
-, year =	1987
-, succeeds =	"cn-swrsp-"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "W. P. Chin and S. Ntafos"
+, title =       "Watchman routes in simple polygons"
+, type =        "Technical {Report}"
+, institution = "Dept. Comput. Sci., Univ. Texas"
+, address =     "Dallas, TX"
+, year =        1987
+, succeeds =    "cn-swrsp-"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @techreport{ckt-cgp-89
-, author =	"Y. T. Ching and M. T. Ko and H. Y. Tu"
-, title =	"On the cruising guard problems"
-, type =	"Technical {Report}"
-, institution =	"Inst. Inform. Sci., Academia Sinica"
-, address =	"Taipei, Taiwan"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "Y. T. Ching and M. T. Ko and H. Y. Tu"
+, title =       "On the cruising guard problems"
+, type =        "Technical {Report}"
+, institution = "Inst. Inform. Sci., Academia Sinica"
+, address =     "Taipei, Taiwan"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @techreport{cl-fdsl-83
-, author =	"Y. T. Ching and D. T. Lee"
-, title =	"Finding the diameter of a set of lines"
-, type =	"Manuscript"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
-, address =	"Evanston, IL"
-, year =	1983
-, precedes =	"cl-fdsl-85"
-, update =	"95.09 korneenko"
+, author =      "Y. T. Ching and D. T. Lee"
+, title =       "Finding the diameter of a set of lines"
+, type =        "Manuscript"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
+, address =     "Evanston, IL"
+, year =        1983
+, precedes =    "cl-fdsl-85"
+, update =      "95.09 korneenko"
 }
 
 @article{cl-fdsl-85
-, author =	"Y. T. Ching and D. T. Lee"
-, title =	"Finding the diameter of a set of lines"
-, journal =	"Pattern Recogn. Lett."
-, volume =	18
-, number =	"3--4"
-, year =	1985
-, pages =	"249--255"
-, succeeds =	"cl-fdsl-83"
-, update =	"95.09 korneenko, 95.01 smid"
+, author =      "Y. T. Ching and D. T. Lee"
+, title =       "Finding the diameter of a set of lines"
+, journal =     "Pattern Recogn. Lett."
+, volume =      18
+, number =      "3--4"
+, year =        1985
+, pages =       "249--255"
+, succeeds =    "cl-fdsl-83"
+, update =      "95.09 korneenko, 95.01 smid"
 }
 
 @article{cms-ddds-90
-, author =	"Y.-T. Ching and K. Mehlhorn and M. Smid"
-, title =	"Dynamic deferred data structuring"
-, journal =	"Inform. Process. Lett."
-, volume =	35
-, number =	1
-, year =	1990
-, pages =	"37--40"
-, keywords =	"data structuring, deferred data structures"
-, update =	"00.03 smid, 95.09 korneenko"
+, author =      "Y.-T. Ching and K. Mehlhorn and M. Smid"
+, title =       "Dynamic deferred data structuring"
+, journal =     "Inform. Process. Lett."
+, volume =      35
+, number =      1
+, year =        1990
+, pages =       "37--40"
+, keywords =    "data structuring, deferred data structures"
+, update =      "00.03 smid, 95.09 korneenko"
 }
 
 @book{cs-fctgm-66
-, author =	"W. G. Chinn and N. E. Steenrod"
-, title =	"First Concepts of Topology: The Geometry of Mappings of Segments, Curves, Circles, and Disks"
-, publisher =	"Mathematical Association of America"
-, address =	"Washington, DC"
-, year =	1966
+, author =      "W. G. Chinn and N. E. Steenrod"
+, title =       "First Concepts of Topology: The Geometry of Mappings of Segments, Curves, Circles, and Disks"
+, publisher =   "Mathematical Association of America"
+, address =     "Washington, DC"
+, year =        1966
 }
 
 @inproceedings{cky-ommmu-88
-, author =	"A. E. Chiou and M. Khoshnevisan and P. Yeh"
-, title =	"Optical matrix-matrix multiplication using multicolor four-wave mixing"
-, booktitle =	"Proc. SPIE"
-, volume =	881
-, year =	1988
-, pages =	"250--257"
-, update =	"97.11 bibrelex"
+, author =      "A. E. Chiou and M. Khoshnevisan and P. Yeh"
+, title =       "Optical matrix-matrix multiplication using multicolor four-wave mixing"
+, booktitle =   "Proc. SPIE"
+, volume =      881
+, year =        1988
+, pages =       "250--257"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{cg-stssa-83
-, author =	"A. Chistov and d. Grigoryev"
-, title =	"Subexponential-Time Solving Systems of Algebraic Equations I"
-, type =	"Preprint"
-, number =	"E-9-83"
-, institution =	"Steklov Inst."
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "A. Chistov and d. Grigoryev"
+, title =       "Subexponential-Time Solving Systems of Algebraic Equations I"
+, type =        "Preprint"
+, number =      "E-9-83"
+, institution = "Steklov Inst."
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{cw-mpcp-90
-, author =	"J.-S. Chiu and J.-S. Wang"
-, title =	"Monotone polygon containment problem"
-, journal =	"J. Inform. Process."
-, volume =	13
-, number =	4
-, year =	1990
-, pages =	"486--493"
-, keywords =	"monotone polygon, containment"
-, update =	"95.09 korneenko"
+, author =      "J.-S. Chiu and J.-S. Wang"
+, title =       "Monotone polygon containment problem"
+, journal =     "J. Inform. Process."
+, volume =      13
+, number =      4
+, year =        1990
+, pages =       "486--493"
+, keywords =    "monotone polygon, containment"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{cw-mpcpu-89
-, author =	"J.-S. Chiu and J.-S. Wang"
-, title =	"Monotone polygon containment problems under translation"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, year =	1989
-, pages =	"123--130"
-, keywords =	"monotone polygons, rectilinear polygons, polygon containment"
-, update =	"95.09 mitchell"
+, author =      "J.-S. Chiu and J.-S. Wang"
+, title =       "Monotone polygon containment problems under translation"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, year =        1989
+, pages =       "123--130"
+, keywords =    "monotone polygons, rectilinear polygons, polygon containment"
+, update =      "95.09 mitchell"
 }
 
 @incollection{csw-mjs-94
-, author =	"Kenneth Chiu and Peter Shirley and Changyaw Wang"
-, title =	"Multi-Jittered Sampling"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"370--374"
-, keywords =	"antialiasing, jitter, stochastic sampling"
-, update =	"94.09 heckbert"
-, annote =	"Presents a new technique for high quality stochastic
+, author =      "Kenneth Chiu and Peter Shirley and Changyaw Wang"
+, title =       "Multi-Jittered Sampling"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "370--374"
+, keywords =    "antialiasing, jitter, stochastic sampling"
+, update =      "94.09 heckbert"
+, annote =      "Presents a new technique for high quality stochastic
 sampling. This is useful for antialiasing. Contains C code."
 }
 
 @inproceedings{ck-dsffs-83
-, author =	"H. Chiyokura and F. Kimura"
-, title =	"Design of Solids with free-form surfaces"
-, booktitle =	"Proc. Siggraph"
-, site =	"Detroit"
-, year =	1983
-, pages =	"289--298"
-, update =	"98.03 bibrelex"
+, author =      "H. Chiyokura and F. Kimura"
+, title =       "Design of Solids with free-form surfaces"
+, booktitle =   "Proc. Siggraph"
+, site =        "Detroit"
+, year =        1983
+, pages =       "289--298"
+, update =      "98.03 bibrelex"
 }
 
 @article{cdk-otigc-95
-, author =	"B. S. Chlebus and K. Diks and M. Kowaluk"
-, title =	"$O(\log\log n)$-time integer geometry on the CRCW PRAM"
-, journal =	"Algorithmica"
-, volume =	14
-, year =	1995
-, pages =	"52--69"
-, update =	"95.09 smid"
+, author =      "B. S. Chlebus and K. Diks and M. Kowaluk"
+, title =       "$O(\log\log n)$-time integer geometry on the CRCW PRAM"
+, journal =     "Algorithmica"
+, volume =      14
+, year =        1995
+, pages =       "52--69"
+, update =      "95.09 smid"
 }
 
 @article{cf-irtvc-99
-, author =	"F. S. Cho and D. Forsyth"
-, title =	"Interactive Ray Tracing with the Visibility Complex"
-, journal =	"Computers and Graphics (Special Issue on Visibility - Techniques and Applications)"
-, volume =	23
-, number =	5
-, year =	1999
-, pages =	"703--717"
-, update =	"01.04 pocchiola"
+, author =      "F. S. Cho and D. Forsyth"
+, title =       "Interactive Ray Tracing with the Visibility Complex"
+, journal =     "Computers and Graphics (Special Issue on Visibility - Techniques and Applications)"
+, volume =      23
+, number =      5
+, year =        1999
+, pages =       "703--717"
+, update =      "01.04 pocchiola"
 }
 
 @article{ckj-csatp-97
-, author =	"B. K. Choi and D. H. Kim and R. B. Jerard"
-, title =	"C-Space Approach to Tool-path Generation for Die and Mould Machining"
-, journal =	"Comput. Aided Design"
-, volume =	29
-, number =	9
-, month =	sep
-, year =	1997
-, pages =	"657--669"
-, update =	"97.11 held"
+, author =      "B. K. Choi and D. H. Kim and R. B. Jerard"
+, title =       "C-Space Approach to Tool-path Generation for Die and Mould Machining"
+, journal =     "Comput. Aided Design"
+, volume =      29
+, number =      9
+, month =       sep
+, year =        1997
+, pages =       "657--669"
+, update =      "97.11 held"
 }
 
 @article{csyl-tsd3d-88
-, author =	"B. K. Choi and H. Y. Shin and Y. I. Yoon and J. W. Lee"
-, title =	"Triangulation Of Scattered Data In 3d Space"
-, journal =	"Comput. Aided Design"
-, volume =	20
-, number =	5
-, month =	jun
-, year =	1988
-, pages =	"239--248"
-, keywords =	"three-dimensional triangulation procedure, Thiessen polygonization, optimal partitioning, surface interpolation, 3d space"
-, annote =	"Incremental algorithm for 3D triangulation. Points are
-		 sorted by angle from a particular point and then joined
-		 to all the visible points. Then switchings are done to
-		 insert constrained edges. (I don't see how this is
-		 possible, because of non-convex quads.) Switchings are
-		 then done to minimize the angle between adjacent
-		 triangles."
-, abstract =	"Triangular interpolants are widely used to construct
-		 smooth surfaces from scattered data in 3D. To apply
-		 smooth triangular interpolants, the input 3D points
-		 have to be triangulated. An algorithmic procedure for
-		 3D triangulation is presented. Relevant algorithms and
-		 datastructures are described in detail. Existing
-		 methods of 2D triangulation are based on Thiessen
-		 polygonization, which is an optimal partitioning of a
-		 geometric domain. To obtain an optimal triangular grid
-		 on the domain, the max-min angle criterion is
-		 frequently used. As there is no domain for 3D points, a
-		 new criterion called the smoothness criterion is
-		 proposed. (Edited author abstract). 15 Refs."
+, author =      "B. K. Choi and H. Y. Shin and Y. I. Yoon and J. W. Lee"
+, title =       "Triangulation Of Scattered Data In 3d Space"
+, journal =     "Comput. Aided Design"
+, volume =      20
+, number =      5
+, month =       jun
+, year =        1988
+, pages =       "239--248"
+, keywords =    "three-dimensional triangulation procedure, Thiessen polygonization, optimal partitioning, surface interpolation, 3d space"
+, annote =      "Incremental algorithm for 3D triangulation. Points are
+                 sorted by angle from a particular point and then joined
+                 to all the visible points. Then switchings are done to
+                 insert constrained edges. (I don't see how this is
+                 possible, because of non-convex quads.) Switchings are
+                 then done to minimize the angle between adjacent
+                 triangles."
+, abstract =    "Triangular interpolants are widely used to construct
+                 smooth surfaces from scattered data in 3D. To apply
+                 smooth triangular interpolants, the input 3D points
+                 have to be triangulated. An algorithmic procedure for
+                 3D triangulation is presented. Relevant algorithms and
+                 datastructures are described in detail. Existing
+                 methods of 2D triangulation are based on Thiessen
+                 polygonization, which is an optimal partitioning of a
+                 geometric domain. To obtain an optimal triangular grid
+                 on the domain, the max-min angle criterion is
+                 frequently used. As there is no domain for 3D points, a
+                 new criterion called the smoothness criterion is
+                 proposed. (Edited author abstract). 15 Refs."
 }
 
 @article{ccm-mtmat-97
-, author =	"Hyeong In Choi and Sung Woo Choi and Hwan Pyo Moon"
-, title =	"Mathematical theory of medial axis transform"
-, journal =	"Pacific Journal of Mathematics"
-, volume =	181
-, number =	1
-, year =	1997
-, pages =	"57--88"
-, update =	"01.07 devillers"
+, author =      "Hyeong In Choi and Sung Woo Choi and Hwan Pyo Moon"
+, title =       "Mathematical theory of medial axis transform"
+, journal =     "Pacific Journal of Mathematics"
+, volume =      181
+, number =      1
+, year =        1997
+, pages =       "57--88"
+, update =      "01.07 devillers"
 }
 
 @article{ccm-namat-97
-, author =	"H. I. Choi and S. W. Choi and H. P. Moon"
-, title =	"New Algorithm for Medial Axis Transform of Plane Domain"
-, journal =	"Graph. Models Image Process."
-, volume =	59
-, number =	6
-, month =	nov
-, year =	1997
-, pages =	"463--483"
-, update =	"98.07 held"
+, author =      "H. I. Choi and S. W. Choi and H. P. Moon"
+, title =       "New Algorithm for Medial Axis Transform of Plane Domain"
+, journal =     "Graph. Models Image Process."
+, volume =      59
+, number =      6
+, month =       nov
+, year =        1997
+, pages =       "463--483"
+, update =      "98.07 held"
 }
 
 @article{chmrw-matoc-99
-, author =	"H. I. Choi and C. Y. Han and H. P. Moon and K. H. Roh and N. S. Wee"
-, title =	"Medial Axis Transform and Offset Curves by {Minkowski} {Pythagorean} Hodograph Curves"
-, journal =	"Comput. Aided Design"
-, volume =	31
-, number =	1
-, month =	mar
-, year =	1999
-, pages =	"59--72"
-, update =	"99.07 held"
+, author =      "H. I. Choi and C. Y. Han and H. P. Moon and K. H. Roh and N. S. Wee"
+, title =       "Medial Axis Transform and Offset Curves by {Minkowski} {Pythagorean} Hodograph Curves"
+, journal =     "Comput. Aided Design"
+, volume =      31
+, number =      1
+, month =       mar
+, year =        1999
+, pages =       "59--72"
+, update =      "99.07 held"
 }
 
 @article{ck-stasr-92
-, author =	"H. K. Choi and C. M. Kyung"
-, title =	"A shadow-testing acceleration scheme for ray tracing"
-, journal =	"Comput. Aided Design"
-, volume =	24
-, number =	2
-, year =	1992
-, pages =	"93--104"
-, keywords =	"ray tracing, computer graphics"
-, update =	"95.09 korneenko"
+, author =      "H. K. Choi and C. M. Kyung"
+, title =       "A shadow-testing acceleration scheme for ray tracing"
+, journal =     "Comput. Aided Design"
+, volume =      24
+, number =      2
+, year =        1992
+, pages =       "93--104"
+, keywords =    "ray tracing, computer graphics"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{csy-aesp3-94
-, author =	"J. Choi and J. Sellen and C. K. Yap"
-, title =	"Approximate {Euclidean} Shortest Path in $3$-Space"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"41--48"
-, keywords =	"ray shooting, octrees, quadtress, simple cover complexity"
-, precedes =	"csy-aesp3-97"
-, cites =	"b-fmpee-76, cr-nlbtr-87, c-aaspm-87, egppss-acptc-92, l-vta-50, p-aspmt-85, hs-ecesp-93, y-tegc-93, y-fpaa-93, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex+mitchell, 95.09 agarwal, 94.09 jones, 94.01 jones"
+, author =      "J. Choi and J. Sellen and C. K. Yap"
+, title =       "Approximate {Euclidean} Shortest Path in $3$-Space"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "41--48"
+, keywords =    "ray shooting, octrees, quadtress, simple cover complexity"
+, precedes =    "csy-aesp3-97"
+, cites =       "b-fmpee-76, cr-nlbtr-87, c-aaspm-87, egppss-acptc-92, l-vta-50, p-aspmt-85, hs-ecesp-93, y-tegc-93, y-fpaa-93, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex+mitchell, 95.09 agarwal, 94.09 jones, 94.01 jones"
 }
 
 @article{csy-aesp3-97
-, author =	"J. Choi and J. Sellen and C. K. Yap"
-, title =	"Approximate {Euclidean} Shortest Paths in $3$-Space"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, number =	4
-, month =	aug
-, year =	1997
-, pages =	"271--295"
-, keywords =	"shortest paths, geodesics, approximation algorithm, bit complexity, precision"
-, succeeds =	"csy-aesp3-94"
-, update =	"98.03 mitchell"
-, annote =	"Special issue devoted to SoCG'94"
+, author =      "J. Choi and J. Sellen and C. K. Yap"
+, title =       "Approximate {Euclidean} Shortest Paths in $3$-Space"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, number =      4
+, month =       aug
+, year =        1997
+, pages =       "271--295"
+, keywords =    "shortest paths, geodesics, approximation algorithm, bit complexity, precision"
+, succeeds =    "csy-aesp3-94"
+, update =      "98.03 mitchell"
+, annote =      "Special issue devoted to SoCG'94"
 }
 
 @inproceedings{csy-psesp-95
-, author =	"Joonsoo Choi and J{\"u}rgen Sellen and Chee-Keng Yap"
-, title =	"Precision-Sensitive {Euclidean} Shortest Path in 3-Space"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"350--359"
-, keywords =	"bit complexity, shortest paths"
-, cites =	"b-earsh-92, b-hsrr-90, cr-nlbtr-87, csy-aesp3-94, g-cra-67, r-ccgfo-89, p-aspmt-85, p-cc-94, r-ca-70, ss-spps-86, vv-niedu-86, w-aep-65, y-tegc-93, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Joonsoo Choi and J{\"u}rgen Sellen and Chee-Keng Yap"
+, title =       "Precision-Sensitive {Euclidean} Shortest Path in 3-Space"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "350--359"
+, keywords =    "bit complexity, shortest paths"
+, cites =       "b-earsh-92, b-hsrr-90, cr-nlbtr-87, csy-aesp3-94, g-cra-67, r-ccgfo-89, p-aspmt-85, p-cc-94, r-ca-70, ss-spps-86, vv-niedu-86, w-aep-65, y-tegc-93, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{cy-mrgds-96
-, author =	"Joonsoo Choi and Chee-Keng Yap"
-, title =	"Monotonicity of Rectilinear Geodesics in $d$-Space"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"339--348"
-, cites =	"aaghi-vdp-86, ac-prspr-91, acm-mpoap-89, c-gphd-95, cy-rg3s-95, rlw-rsprb-85, rlw-rsppr-89, em-osrqa-94, hs-ecesp-93, lp-esppr-84, m-psp-86, mrw-mlpop-92, w-cvgnl-85, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Joonsoo Choi and Chee-Keng Yap"
+, title =       "Monotonicity of Rectilinear Geodesics in $d$-Space"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "339--348"
+, cites =       "aaghi-vdp-86, ac-prspr-91, acm-mpoap-89, c-gphd-95, cy-rg3s-95, rlw-rsprb-85, rlw-rsppr-89, em-osrqa-94, hs-ecesp-93, lp-esppr-84, m-psp-86, mrw-mlpop-92, w-cvgnl-85, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{cy-rg3s-95
-, author =	"Joonsoo Choi and Chee-Keng Yap"
-, title =	"Rectilinear Geodesics in 3-Space"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"380--389"
-, keywords =	"shortest paths, monotonicity, boxes"
-, cites =	"aaghi-vdp-86, ckv-rsptp-87, bkno-spqrw-92, rlw-rsppr-89, e-acg-87, em-osrqa-94, gm-osacv-91, hs-ecesp-93, l-tdvdl-80, m-wcohs-87, m-lsppo-92, w-cvgnl-85, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Joonsoo Choi and Chee-Keng Yap"
+, title =       "Rectilinear Geodesics in 3-Space"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "380--389"
+, keywords =    "shortest paths, monotonicity, boxes"
+, cites =       "aaghi-vdp-86, ckv-rsptp-87, bkno-spqrw-92, rlw-rsppr-89, e-acg-87, em-osrqa-94, gm-osacv-91, hs-ecesp-93, l-tdvdl-80, m-wcohs-87, m-lsppo-92, w-cvgnl-85, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @phdthesis{c-gphd-95
-, author =	"J. S. Choi"
-, title =	"Geodesic problems in high dimensions"
-, school =	"Courant Institute, New York University"
-, address =	"New York"
-, month =	jun
-, year =	1995
-, keywords =	"shortest paths"
-, update =	"96.05 mitchell"
+, author =      "J. S. Choi"
+, title =       "Geodesic problems in high dimensions"
+, school =      "Courant Institute, New York University"
+, address =     "New York"
+, month =       jun
+, year =        1995
+, keywords =    "shortest paths"
+, update =      "96.05 mitchell"
 }
 
 @mastersthesis{c-vpgr-92
-, author =	"S.-H. Choi"
-, title =	"Visibility Properties of Graphs and Their Recognition"
-, school =	"Department of Computer Science, Korea Advanced Institute of Science and Technology"
-, year =	1992
-, keywords =	"master thesis"
-, update =	"98.11 bibrelex"
+, author =      "S.-H. Choi"
+, title =       "Visibility Properties of Graphs and Their Recognition"
+, school =      "Department of Computer Science, Korea Advanced Institute of Science and Technology"
+, year =        1992
+, keywords =    "master thesis"
+, update =      "98.11 bibrelex"
 }
 
 @article{csc-crvgf-95
-, author =	"S. H. Choi and S. Y. Shin and K. Y. Chwa"
-, title =	"Characterizing and Recognizing the Visibility Graph of a Funnel-Shaped Polygon"
-, journal =	"Algorithmica"
-, volume =	14
-, year =	1995
-, pages =	"27--51"
-, update =	"95.09 smid"
+, author =      "S. H. Choi and S. Y. Shin and K. Y. Chwa"
+, title =       "Characterizing and Recognizing the Visibility Graph of a Funnel-Shaped Polygon"
+, journal =     "Algorithmica"
+, volume =      14
+, year =        1995
+, pages =       "27--51"
+, update =      "95.09 smid"
 }
 
 @inproceedings{csc-crvgf-92
-, author =	"S. H. Choi and S. Y. Shin and K. Y. Chwa"
-, title =	"Characterizing and Recognizing Visibility Graphs of Funnel-Shaped Polygons"
-, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '92"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	650
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"219--228"
-, update =	"94.09 smid, 94.01 choi, 93.09 milone+mitchell"
+, author =      "S. H. Choi and S. Y. Shin and K. Y. Chwa"
+, title =       "Characterizing and Recognizing Visibility Graphs of Funnel-Shaped Polygons"
+, booktitle =   "Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '92"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      650
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "219--228"
+, update =      "94.09 smid, 94.01 choi, 93.09 milone+mitchell"
 }
 
 @article{cp-htamp-94
-, author =	"Y.-K. Choi and K. H. Park"
-, title =	"A Heuristic Triangulation Algorithm for Multiple Planar Contours Using an Extended Double Branching Procedure"
-, journal =	"Visual Comput."
-, volume =	10
-, number =	7
-, year =	1994
-, pages =	"372--387"
-, update =	"96.01 held"
+, author =      "Y.-K. Choi and K. H. Park"
+, title =       "A Heuristic Triangulation Algorithm for Multiple Planar Contours Using an Extended Double Branching Procedure"
+, journal =     "Visual Comput."
+, volume =      10
+, number =      7
+, year =        1994
+, pages =       "372--387"
+, update =      "96.01 held"
 }
 
 @inproceedings{cr-gfsso-99
-, author =	"J. Chomicki and P. Z. Revesz"
-, title =	"A geometric framework for specifying spatiotemporal objects"
-, booktitle =	"Proc. 6th Intl. Workshop on Time Representation and Reasoning"
-, year =	1999
-, pages =	"41--46"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "J. Chomicki and P. Z. Revesz"
+, title =       "A geometric framework for specifying spatiotemporal objects"
+, booktitle =   "Proc. 6th Intl. Workshop on Time Representation and Reasoning"
+, year =        1999
+, pages =       "41--46"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{cl-fccot-93
-, author =	"K. W. Chong and T. W. Lam"
-, title =	"Finding connected components in $O(\log n \log \log n)$ time on the {EREW PRAM}"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"11--20"
-, update =	"96.09 orourke"
+, author =      "K. W. Chong and T. W. Lam"
+, title =       "Finding connected components in $O(\log n \log \log n)$ time on the {EREW PRAM}"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "11--20"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{ck-scisc-93
-, author =	"A. Chou and K. Ko"
-, title =	"Some Complexity Issues on the Simply Connected Regions of the Two-Dimensional Plane"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"??"
+, author =      "A. Chou and K. Ko"
+, title =       "Some Complexity Issues on the Simply Connected Regions of the Two-Dimensional Plane"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "??"
 }
 
 @phdthesis{c-ncmmt-89
-, author =	"J. J. Chou"
-, title =	"Numerical control milling machine toll path generation for regions bounded by free form curves and surfaces"
-, type =	"Ph.{D}. Thesis"
-, school =	"Univ. Utah"
-, year =	1989
-, keywords =	"doctoral thesis"
-, update =	"93.05 freimer"
+, author =      "J. J. Chou"
+, title =       "Numerical control milling machine toll path generation for regions bounded by free form curves and surfaces"
+, type =        "Ph.{D}. Thesis"
+, school =      "Univ. Utah"
+, year =        1989
+, keywords =    "doctoral thesis"
+, update =      "93.05 freimer"
 }
 
 @article{c-vdps-95
-, author =	"J. J. Chou"
-, title =	"Voronoi Diagrams for Planar Shapes"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	15
-, number =	2
-, month =	mar
-, year =	1995
-, pages =	"52--59"
-, update =	"96.01 held"
+, author =      "J. J. Chou"
+, title =       "Voronoi Diagrams for Planar Shapes"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      15
+, number =      2
+, month =       mar
+, year =        1995
+, pages =       "52--59"
+, update =      "96.01 held"
 }
 
 @article{c-opcrt-91
-, author =	"P. Chou"
-, title =	"Optimal partitioning for classification and regression trees"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	13
-, year =	1991
-, pages =	"340--354"
-, update =	"98.07 bibrelex, 96.09 agarwal"
+, author =      "P. Chou"
+, title =       "Optimal partitioning for classification and regression trees"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      13
+, year =        1991
+, pages =       "340--354"
+, update =      "98.07 bibrelex, 96.09 agarwal"
 }
 
 @book{c-mgtp-88
-, author =	"S.-C. Chou"
-, title =	"Mechanical Geometry Theorem Proving"
-, publisher =	"D. Reidel"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "S.-C. Chou"
+, title =       "Mechanical Geometry Theorem Proving"
+, publisher =   "D. Reidel"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @incollection{c-pegtu-84
-, author =	"S.-C. Chou"
-, title =	"Proving elementary geometry theorems using {Wu}'s algorithm"
-, booktitle =	"Contemporary Mathematics"
-, volume =	29
-, publisher =	"American Mathematical Society"
-, year =	1984
-, pages =	"243--286"
-, update =	"98.03 bibrelex"
+, author =      "S.-C. Chou"
+, title =       "Proving elementary geometry theorems using {Wu}'s algorithm"
+, booktitle =   "Contemporary Mathematics"
+, volume =      29
+, publisher =   "American Mathematical Society"
+, year =        1984
+, pages =       "243--286"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{cr-mpgt-92
-, author =	"S.-C. Chou and M. Rathi"
-, title =	"Machine proofs of geometry theorems"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	1
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1992
-, pages =	"91--115"
-, keywords =	"survey paper, machine proofs"
-, precedes =	"cr-mpgt-95"
-, update =	"98.07 icking, 93.09 erickson"
+, author =      "S.-C. Chou and M. Rathi"
+, title =       "Machine proofs of geometry theorems"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      1
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1992
+, pages =       "91--115"
+, keywords =    "survey paper, machine proofs"
+, precedes =    "cr-mpgt-95"
+, update =      "98.07 icking, 93.09 erickson"
 }
 
 @incollection{cr-mpgt-95
-, author =	"Shang-Ching Chou and Mahesh Rathi"
-, title =	"Machine Proofs of Geometry Theorems"
-, editor =	"Ding-Zhu Du and Frank Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1995
-, pages =	"124--148"
-, keywords =	"survey paper"
-, succeeds =	"h-dqgpg-92"
-, update =	"98.07 icking"
+, author =      "Shang-Ching Chou and Mahesh Rathi"
+, title =       "Machine Proofs of Geometry Theorems"
+, editor =      "Ding-Zhu Du and Frank Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1995
+, pages =       "124--148"
+, keywords =    "survey paper"
+, succeeds =    "h-dqgpg-92"
+, update =      "98.07 icking"
 }
 
 @article{ct-lsm3d-93
-, author =	"Sheng-Lin Chou and Wen-Hsiang Tsai"
-, title =	"Line segment matching for 3d computer vision using a new iteration scheme"
-, journal =	"Mach. Vison Appl."
-, volume =	6
-, year =	1993
-, pages =	"191--205"
-, update =	"97.11 bibrelex"
+, author =      "Sheng-Lin Chou and Wen-Hsiang Tsai"
+, title =       "Line segment matching for 3d computer vision using a new iteration scheme"
+, journal =     "Mach. Vison Appl."
+, volume =      6
+, year =        1993
+, pages =       "191--205"
+, update =      "97.11 bibrelex"
 }
 
 @article{cwcts-shio-94
-, author =	"S.-Y. Chou and T. C. Woo and L.-L. Chen and K. Tang and S. Y. S hin"
-, title =	"Scallop Hull and Its Offset"
-, journal =	"Comput. Aided Design"
-, volume =	26
-, number =	7
-, month =	jul
-, year =	1994
-, pages =	"537--542"
-, update =	"97.11 held"
+, author =      "S.-Y. Chou and T. C. Woo and L.-L. Chen and K. Tang and S. Y. S hin"
+, title =       "Scallop Hull and Its Offset"
+, journal =     "Comput. Aided Design"
+, volume =      26
+, number =      7
+, month =       jul
+, year =        1994
+, pages =       "537--542"
+, update =      "97.11 held"
 }
 
 @article{ccb-maacm-89
-, author =	"Y.-C. Chou and V. Chandru and M. M. Barash"
-, title =	"A mathematical approach to automatic configuration of machining fixtures: {Analysis} and synthesis"
-, journal =	"J. of Engineering for Industry"
-, volume =	111
-, month =	nov
-, year =	1989
-, update =	"98.03 bibrelex"
+, author =      "Y.-C. Chou and V. Chandru and M. M. Barash"
+, title =       "A mathematical approach to automatic configuration of machining fixtures: {Analysis} and synthesis"
+, journal =     "J. of Engineering for Industry"
+, volume =      111
+, month =       nov
+, year =        1989
+, update =      "98.03 bibrelex"
 }
 
 % ### What is it?
 @inproceedings{cm-pacms-87
-, author =	"S. Choudhury and M. Murty"
-, title =	"A parallel architecture for constructing the minimal spanning tree in {Euclidean} space"
-, booktitle =	"Tencon'87"
-, volume =	2
-, year =	1987
-, pages =	"793--795"
-, keywords =	"parallel computation, minimal spanning tree"
-, update =	"95.09 korneenko"
+, author =      "S. Choudhury and M. Murty"
+, title =       "A parallel architecture for constructing the minimal spanning tree in {Euclidean} space"
+, booktitle =   "Tencon'87"
+, volume =      2
+, year =        1987
+, pages =       "793--795"
+, keywords =    "parallel computation, minimal spanning tree"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{c-padch-81
-, author =	"A. L. Chow"
-, title =	"A parallel algorithm for determining convex hulls of sets of points in two dimensions"
-, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
-, year =	1981
-, pages =	"214--223"
+, author =      "A. L. Chow"
+, title =       "A parallel algorithm for determining convex hulls of sets of points in two dimensions"
+, booktitle =   "Proc. 19th Allerton Conf. Commun. Control Comput."
+, year =        1981
+, pages =       "214--223"
 }
 
 @inproceedings{c-ppari-81
-, author =	"A. L. Chow"
-, title =	"A Practical Parallel Algorithm for Reporting Intersections of Rectangles"
-, booktitle =	"IEEE Sympos. Parallel Processing"
-, year =	1981
-, pages =	"304--305"
-, update =	"93.09 held"
+, author =      "A. L. Chow"
+, title =       "A Practical Parallel Algorithm for Reporting Intersections of Rectangles"
+, booktitle =   "IEEE Sympos. Parallel Processing"
+, year =        1981
+, pages =       "304--305"
+, update =      "93.09 held"
 }
 
 @phdthesis{c-pagp-80
-, author =	"A. L. Chow"
-, title =	"Parallel algorithms for geometric problems"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1980
-, keywords =	"doctoral thesis"
-, comments =	"UMI KRA81-08465, 163 pp."
-, update =	"93.09 jones"
+, author =      "A. L. Chow"
+, title =       "Parallel algorithms for geometric problems"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1980
+, keywords =    "doctoral thesis"
+, comments =    "UMI KRA81-08465, 163 pp."
+, update =      "93.09 jones"
 }
 
 % March 29--April 3
 @inproceedings{c-ftcl-87
-, author =	"Albert H. J. Christensen"
-, title =	"Fitting a Triangulation to Contour Lines"
-, booktitle =	"Proceedings, AUTOCARTO 8"
-, site =	"Baltimore, MD"
-, year =	1987
-, pages =	"57--67"
-, annote =	"Constrained Delaunay triangulation of contours +
-		 medial axes of contours. This avoids the problem of a
-		 triangle with all three vertices on the same contour."
+, author =      "Albert H. J. Christensen"
+, title =       "Fitting a Triangulation to Contour Lines"
+, booktitle =   "Proceedings, AUTOCARTO 8"
+, site =        "Baltimore, MD"
+, year =        1987
+, pages =       "57--67"
+, annote =      "Constrained Delaunay triangulation of contours +
+                 medial axes of contours. This avoids the problem of a
+                 triangle with all three vertices on the same contour."
 }
 
 @article{c-kiikf-50
-, author =	"C. Christensen"
-, title =	"Kvadrat indskrevet i konveks figur"
-, journal =	"Matematisk Tiddskrifft B"
-, volume =	1950
-, year =	1950
-, pages =	"22--26"
-, update =	"98.07 bibrelex"
+, author =      "C. Christensen"
+, title =       "Kvadrat indskrevet i konveks figur"
+, journal =     "Matematisk Tiddskrifft B"
+, volume =      1950
+, year =        1950
+, pages =       "22--26"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{cfms-etavs-97
-, author =	"J. Christensen and S. Friedman and J. Marks and S. Shieber"
-, title =	"Empirical Testing of Algorithms for Variable-Sized Label Placement"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"415--417"
-, cites =	"cms-esapf-95, ecms-gcla-97, ww-pmla-97, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "J. Christensen and S. Friedman and J. Marks and S. Shieber"
+, title =       "Empirical Testing of Algorithms for Variable-Sized Label Placement"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "415--417"
+, cites =       "cms-esapf-95, ecms-gcla-97, ww-pmla-97, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{cms-aclp-93
-, author =	"J. Christensen and J. Marks and S. Shieber"
-, title =	"Algorithms for cartographics label placement"
-, booktitle =	"Proc. 1993 ASPRS/ACSM Annual Convention and Exposition"
-, volume =	1
-, year =	1993
-, pages =	"75--89"
-, update =	"98.07 bibrelex"
+, author =      "J. Christensen and J. Marks and S. Shieber"
+, title =       "Algorithms for cartographics label placement"
+, booktitle =   "Proc. 1993 ASPRS/ACSM Annual Convention and Exposition"
+, volume =      1
+, year =        1993
+, pages =       "75--89"
+, update =      "98.07 bibrelex"
 }
 
 @article{cms-esapf-95
-, author =	"J. Christensen and J. Marks and S. Shieber"
-, title =	"An empirical study of algorithms for point-feature label placement"
-, journal =	"ACM Trans. Graph."
-, volume =	14
-, year =	1995
-, pages =	"202--232"
-, update =	"97.07 agarwal"
+, author =      "J. Christensen and J. Marks and S. Shieber"
+, title =       "An empirical study of algorithms for point-feature label placement"
+, journal =     "ACM Trans. Graph."
+, volume =      14
+, year =        1995
+, pages =       "202--232"
+, update =      "97.07 agarwal"
 }
 
 @incollection{cms-ptlmd-94
-, author =	"Jon Christensen and Joe Marks and Stuart Shieber"
-, title =	"Placing Text Labels on Maps and Diagrams"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"497--504"
-, keywords =	"cartography, label placement, layout, relaxation, simulated annealing"
-, update =	"94.09 heckbert"
-, annote =	"Presents an algorithm to arrange text labels in a way that
+, author =      "Jon Christensen and Joe Marks and Stuart Shieber"
+, title =       "Placing Text Labels on Maps and Diagrams"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "497--504"
+, keywords =    "cartography, label placement, layout, relaxation, simulated annealing"
+, update =      "94.09 heckbert"
+, annote =      "Presents an algorithm to arrange text labels in a way that
 avoids overlap. This is useful in cartography."
 }
 
 @article{cs-cccld-78
-, author =	"N. N. Christiansen and T. W. Sederberg"
-, title =	"Conversion of complex contour line definitions into polygonal element mosaic"
-, journal =	"Comput. Graphics"
-, volume =	12
-, number =	2
-, year =	1978
-, pages =	"187--192"
-, keywords =	"computer graphics, contours, shape, polyhedra, surfaces, approximation"
-, update =	"95.09 korneenko"
+, author =      "N. N. Christiansen and T. W. Sederberg"
+, title =       "Conversion of complex contour line definitions into polygonal element mosaic"
+, journal =     "Comput. Graphics"
+, volume =      12
+, number =      2
+, year =        1978
+, pages =       "187--192"
+, keywords =    "computer graphics, contours, shape, polyhedra, surfaces, approximation"
+, update =      "95.09 korneenko"
 }
 
 @techreport{cjr-cdtsp-90
-, author =	"T. Christof and M. J{\"u}nger and G. Reinelt"
-, title =	"A complete description of the traveling salesman polytope on $8$ nodes"
-, type =	"Report"
-, number =	"249-1990"
-, institution =	"Institut f{\"u}r Mathematik, Universit{\"a}t Augsburg"
-, address =	"Augsburg, Germany"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "T. Christof and M. J{\"u}nger and G. Reinelt"
+, title =       "A complete description of the traveling salesman polytope on $8$ nodes"
+, type =        "Report"
+, number =      "249-1990"
+, institution = "Institut f{\"u}r Mathematik, Universit{\"a}t Augsburg"
+, address =     "Augsburg, Germany"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{c-wcanh-76
-, author =	"N. Christofides"
-, title =	"Worst-case analysis of a new heuristic for the traveling salesman problem"
-, editor =	"J. F. Traub"
-, booktitle =	"Sympos. on New Directions and Recent Results in Algorithms and Complexity"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1976
-, pages =	441
+, author =      "N. Christofides"
+, title =       "Worst-case analysis of a new heuristic for the traveling salesman problem"
+, editor =      "J. F. Traub"
+, booktitle =   "Sympos. on New Directions and Recent Results in Algorithms and Complexity"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1976
+, pages =       441
 }
 
 @misc{cdh-p5cpg-87
-, author =	"M. Chrobak and K. Diks and T. Hagerup"
-, title =	"Parallel $5$-colouring of planar graphs"
-, year =	1987
-, note =	"Preprint"
-, update =	"98.03 bibrelex"
+, author =      "M. Chrobak and K. Diks and T. Hagerup"
+, title =       "Parallel $5$-colouring of planar graphs"
+, year =        1987
+, note =        "Preprint"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{cgt-cdgtt-96
-, author =	"Marek Chrobak and Michael T. Goodrich and Roberto Tamassia"
-, title =	"Convex Drawings of Graphs in Two and Three Dimensions"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"319--328"
-, url =	"https://www.cs.brown.edu/cgc/papers/cgt-cdgtt-96.ps.gz"
-, keywords =	"graph drawing, straight-line, 3D, convex, CGC, Brown"
-, cites =	"a-lbvsc-63, bh-olpgf-87, bo-lwbl-87, con-dpgn-85, cyn-lacdp-84, ck-cgd3c-93, cn-mwgdp-95, cp-ltadp-95, celr-tdgd-95, c-re-82, cw-mmap-90, cw-sfmps-82, dg-caitd-95, fpp-sssfe-88, fpp-hdpgg-90, dett-adgab-94, dtt-arsdp-92, dtv-olcpt-95, ds-ltati-92, eg-dspg-96, esw-tkbtd-95, f-slrpg-48, fhhklsww-dgphr-93, gt-pdara-94, gt-anda-87, g-cp-67, hr-udfs-94, hrs-cchpc-92, ht-dgtc-73, ht-ept-74, hk-prga-92, jj-3dlrg-95, k-dpguc-96, k-dpgul-92, ls-cavg-92, ld-cpdt3-95, lrt-gnd-79, lt-apst-80, mp-arpg-94, m-orfdf-64, ps-cgi-85, r-3dvpi-95, r-e3vpi-95, s-epgg-90, st-ce3cp-92, s-cm-51, sr-vudtd-34, t-pdfip-80, t-prg-84, t-crg-60, t-hdg-63, w-mspp-82, ZZZ"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 97.03 tamassia, 96.09 tamassia"
+, author =      "Marek Chrobak and Michael T. Goodrich and Roberto Tamassia"
+, title =       "Convex Drawings of Graphs in Two and Three Dimensions"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "319--328"
+, url = "https://www.cs.brown.edu/cgc/papers/cgt-cdgtt-96.ps.gz"
+, keywords =    "graph drawing, straight-line, 3D, convex, CGC, Brown"
+, cites =       "a-lbvsc-63, bh-olpgf-87, bo-lwbl-87, con-dpgn-85, cyn-lacdp-84, ck-cgd3c-93, cn-mwgdp-95, cp-ltadp-95, celr-tdgd-95, c-re-82, cw-mmap-90, cw-sfmps-82, dg-caitd-95, fpp-sssfe-88, fpp-hdpgg-90, dett-adgab-94, dtt-arsdp-92, dtv-olcpt-95, ds-ltati-92, eg-dspg-96, esw-tkbtd-95, f-slrpg-48, fhhklsww-dgphr-93, gt-pdara-94, gt-anda-87, g-cp-67, hr-udfs-94, hrs-cchpc-92, ht-dgtc-73, ht-ept-74, hk-prga-92, jj-3dlrg-95, k-dpguc-96, k-dpgul-92, ls-cavg-92, ld-cpdt3-95, lrt-gnd-79, lt-apst-80, mp-arpg-94, m-orfdf-64, ps-cgi-85, r-3dvpi-95, r-e3vpi-95, s-epgg-90, st-ce3cp-92, s-cm-51, sr-vudtd-34, t-pdfip-80, t-prg-84, t-crg-60, t-hdg-63, w-mspp-82, ZZZ"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 97.03 tamassia, 96.09 tamassia"
 }
 
 @techreport{ck-cgd3c-93
-, author =	"M. Chrobak and G. Kant"
-, title =	"Convex grid drawings of 3-connected planar graphs"
-, type =	"Technical {Report}"
-, number =	"RUU-93-45"
-, institution =	"Dept. of Computer Sci., Utrecht Univ."
-, year =	1993
-, keywords =	"graph drawing, planar, convex, straight-line"
-, update =	"97.11 bibrelex, 96.09 tamassia"
+, author =      "M. Chrobak and G. Kant"
+, title =       "Convex grid drawings of 3-connected planar graphs"
+, type =        "Technical {Report}"
+, number =      "RUU-93-45"
+, institution = "Dept. of Computer Sci., Utrecht Univ."
+, year =        1993
+, keywords =    "graph drawing, planar, convex, straight-line"
+, update =      "97.11 bibrelex, 96.09 tamassia"
 }
 
 @article{ck-cgd3c-97
-, author =	"M. Chrobak and G. Kant"
-, title =	"Convex grid drawings of 3-connected planar graphs"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, number =	3
-, year =	1997
-, pages =	"211--223"
-, succeeds =	"ck-cgd3c-93"
-, update =	"98.07 tamassia, 97.07 devillers"
+, author =      "M. Chrobak and G. Kant"
+, title =       "Convex grid drawings of 3-connected planar graphs"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, number =      3
+, year =        1997
+, pages =       "211--223"
+, succeeds =    "ck-cgd3c-93"
+, update =      "98.07 tamassia, 97.07 devillers"
 }
 
 @techreport{cn-mwgd-94
-, author =	"M. Chrobak and S. Nakano"
-, title =	"Minimum-width grid drawings of plane graphs"
-, type =	"Technical {Report}"
-, number =	"UCR-CS-94-5"
-, institution =	"Dept.\ of Computer Sci., Univ.\ California, Riverside"
-, year =	1994
-, keywords =	"graph drawing, planar, straight-line"
-, update =	"96.09 tamassia"
+, author =      "M. Chrobak and S. Nakano"
+, title =       "Minimum-width grid drawings of plane graphs"
+, type =        "Technical {Report}"
+, number =      "UCR-CS-94-5"
+, institution = "Dept.\ of Computer Sci., Univ.\ California, Riverside"
+, year =        1994
+, keywords =    "graph drawing, planar, straight-line"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{cn-mwgdp-95
-, author =	"M. Chrobak and S. Nakano"
-, title =	"Minimum-Width Grid Drawings of Plane Graphs"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"104--110"
-, keywords =	"graph drawing, planar, straight-line"
-, update =	"95.01 tamassia"
+, author =      "M. Chrobak and S. Nakano"
+, title =       "Minimum-Width Grid Drawings of Plane Graphs"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "104--110"
+, keywords =    "graph drawing, planar, straight-line"
+, update =      "95.01 tamassia"
 }
 
 @article{cn-mwgdp-98
-, author =	"Marek Chrobak and Shin-ichi Nakano"
-, title =	"Minimum-Width Grid Drawings of Plane Graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	11
-, year =	1998
-, pages =	"29--54"
-, succeeds =	"cn-mwgd-94, cn-mwgdp-95"
-, update =	"99.11 bibrelex, 98.11 devillers+vismara"
+, author =      "Marek Chrobak and Shin-ichi Nakano"
+, title =       "Minimum-Width Grid Drawings of Plane Graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      11
+, year =        1998
+, pages =       "29--54"
+, succeeds =    "cn-mwgd-94, cn-mwgdp-95"
+, update =      "99.11 bibrelex, 98.11 devillers+vismara"
 }
 
 @article{cp-ltadp-95
-, author =	"M. Chrobak and T. Payne"
-, title =	"A linear-time algorithm for drawing planar graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	54
-, year =	1995
-, pages =	"241--246"
-, keywords =	"graph drawing"
-, succeeds =	"cp-ltadp-90"
-, update =	"96.09 tamassia"
+, author =      "M. Chrobak and T. Payne"
+, title =       "A linear-time algorithm for drawing planar graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      54
+, year =        1995
+, pages =       "241--246"
+, keywords =    "graph drawing"
+, succeeds =    "cp-ltadp-90"
+, update =      "96.09 tamassia"
 }
 
 @techreport{cp-ltadp-90
-, author =	"M. Chrobak and T. H. Payne"
-, title =	"A Linear Time Algorithm for Drawing a Planar Graph on a Grid"
-, number =	"UCR-CS-90-2"
-, institution =	"Dept. of Math. and Comput. Sci., Univ. California Riverside"
-, year =	1990
-, keywords =	"graph drawing"
-, precedes =	"cp-ltadp-95"
-, update =	"93.09 tamassia"
+, author =      "M. Chrobak and T. H. Payne"
+, title =       "A Linear Time Algorithm for Drawing a Planar Graph on a Grid"
+, number =      "UCR-CS-90-2"
+, institution = "Dept. of Math. and Comput. Sci., Univ. California Riverside"
+, year =        1990
+, keywords =    "graph drawing"
+, precedes =    "cp-ltadp-95"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{cs-ppisp-95
-, author =	"Marek Chrobak and G. Sundaram"
-, title =	"Paths among points inside a simple polygon"
-, booktitle =	"Proc. 5th MSI Stony Brook Workshop on Computational Geometry"
-, year =	1995
-, url =	"??"
-, update =	"96.05 mitchell"
+, author =      "Marek Chrobak and G. Sundaram"
+, title =       "Paths among points inside a simple polygon"
+, booktitle =   "Proc. 5th MSI Stony Brook Workshop on Computational Geometry"
+, year =        1995
+, url = "??"
+, update =      "96.05 mitchell"
 }
 
 @article{csk-dsufh-90
-, author =	"M. Chrobak and T. Szymacha and A. Krawczyk"
-, title =	"A data structure useful for finding {Hamiltonian} cycles"
-, journal =	"Theoret. Comput. Sci."
-, volume =	71
-, number =	3
-, year =	1990
-, pages =	"419--424"
-, keywords =	"data structuring"
-, update =	"95.09 korneenko"
+, author =      "M. Chrobak and T. Szymacha and A. Krawczyk"
+, title =       "A data structure useful for finding {Hamiltonian} cycles"
+, journal =     "Theoret. Comput. Sci."
+, volume =      71
+, number =      3
+, year =        1990
+, pages =       "419--424"
+, keywords =    "data structuring"
+, update =      "95.09 korneenko"
 }
 
 @phdthesis{c-sc3di-96
-, author =	"Yiorgos Chrysanthou"
-, title =	"Shadow Computation for 3D Interaction and Animation"
-, type =	"Ph.{D}. Thesis"
-, school =	"Queen Mary and Westfield College, University of London"
-, year =	1996
-, keywords =	"bsp trees, shadow, radiosity"
-, update =	"97.07 agarwal"
+, author =      "Yiorgos Chrysanthou"
+, title =       "Shadow Computation for 3D Interaction and Animation"
+, type =        "Ph.{D}. Thesis"
+, school =      "Queen Mary and Westfield College, University of London"
+, year =        1996
+, keywords =    "bsp trees, shadow, radiosity"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{c-caics-74
-, author =	"C. Chryssostomidis"
-, title =	"Computer Aided Interference Control and Space Reservation"
-, editor =	"Y. Fujita, K. Lind and T. J. Williams"
-, booktitle =	"Proc. IFIP/IFAC/JSNA Joint Conference on Computer Applications in the Automation of Shipyard Operation and Ship Design"
-, year =	1974
-, pages =	"507--513"
-, update =	"95.05 abrams"
+, author =      "C. Chryssostomidis"
+, title =       "Computer Aided Interference Control and Space Reservation"
+, editor =      "Y. Fujita, K. Lind and T. J. Williams"
+, booktitle =   "Proc. IFIP/IFAC/JSNA Joint Conference on Computer Applications in the Automation of Shipyard Operation and Ship Design"
+, year =        1974
+, pages =       "507--513"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{c-casde-76
-, author =	"C. Chryssostomidis"
-, title =	"Computer Aided Ship Design Education at the Massachusetts Institute of Technology"
-, editor =	"A. Jacobsson, F. Borgstr{\"o}m and T. J. Williams"
-, booktitle =	"Proc. IFIP/IFAC/SSI/City of Gothenburg Scandinavian Joint Conference on Computer Applications in the Automation of Shipyard Operation and Ship Design"
-, year =	1976
-, pages =	"65--71"
-, update =	"95.05 abrams"
+, author =      "C. Chryssostomidis"
+, title =       "Computer Aided Ship Design Education at the Massachusetts Institute of Technology"
+, editor =      "A. Jacobsson, F. Borgstr{\"o}m and T. J. Williams"
+, booktitle =   "Proc. IFIP/IFAC/SSI/City of Gothenburg Scandinavian Joint Conference on Computer Applications in the Automation of Shipyard Operation and Ship Design"
+, year =        1976
+, pages =       "65--71"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{cp-gmcad-87
-, author =	"C. Chryssostomidis and N. M. Patrikalakis"
-, title =	"Geometric Modeling in Computer Aided Design of Marine Systems"
-, booktitle =	"Proc. 3rd International Symposium on Practical Design of Ships and Mobile Units"
-, volume =	"II"
-, year =	1987
-, pages =	"861--870"
-, update =	"95.05 abrams"
+, author =      "C. Chryssostomidis and N. M. Patrikalakis"
+, title =       "Geometric Modeling in Computer Aided Design of Marine Systems"
+, booktitle =   "Proc. 3rd International Symposium on Practical Design of Ships and Mobile Units"
+, volume =      "II"
+, year =        1987
+, pages =       "861--870"
+, update =      "95.05 abrams"
 }
 
 @article{cp-gmica-88
-, author =	"C. Chryssostomidis and N. M. Patrikalakis"
-, title =	"Geometric Modeling Issues in Computer Aided Design of Marine Structures"
-, journal =	"Marine Technology Society Journal"
-, volume =	22
-, number =	2
-, year =	1988
-, pages =	"15--33"
-, update =	"95.05 abrams"
+, author =      "C. Chryssostomidis and N. M. Patrikalakis"
+, title =       "Geometric Modeling Issues in Computer Aided Design of Marine Structures"
+, journal =     "Marine Technology Society Journal"
+, volume =      22
+, number =      2
+, year =        1988
+, pages =       "15--33"
+, update =      "95.05 abrams"
 }
 
 % yes, 1885
 @article{c-pcmce-85
-, author =	"G. Chrystal"
-, title =	"On the problem to construct the minimal circle enclosing $n$ given points in the plane"
-, journal =	"Proc. Edinburgh Math. Soc."
-, volume =	3
-, year =	1885
-, pages =	"30--33"
-, note =	"pre-Shamos"
-, keywords =	"points, extremal figures, center"
-, update =	"95.09 korneenko"
+, author =      "G. Chrystal"
+, title =       "On the problem to construct the minimal circle enclosing $n$ given points in the plane"
+, journal =     "Proc. Edinburgh Math. Soc."
+, volume =      3
+, year =        1885
+, pages =       "30--33"
+, note =        "pre-Shamos"
+, keywords =    "points, extremal figures, center"
+, update =      "95.09 korneenko"
 }
 
 @techreport{ch-ccsns-90
-, author =	"J. H. Chuang and C. M. Hoffmann"
-, title =	"Curvature computations on surfaces in $n$-space"
-, number =	"90.2"
-, institution =	"ITC"
-, address =	"Trento, Italy"
-, month =	aug
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "J. H. Chuang and C. M. Hoffmann"
+, title =       "Curvature computations on surfaces in $n$-space"
+, number =      "90.2"
+, institution = "ITC"
+, address =     "Trento, Italy"
+, month =       aug
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @article{c-rsops-96
-, author =	"A. Chubarev"
-, title =	"Robust set operations on polyhedral solids: a fixed precision approach"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"187--204"
-, update =	"96.09 devillers"
+, author =      "A. Chubarev"
+, title =       "Robust set operations on polyhedral solids: a fixed precision approach"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "187--204"
+, update =      "96.09 devillers"
 }
 
 @book{c-mss-88
-, author =	"C. K. Chui"
-, title =	"Multivariate spline spaces"
-, publisher =	"Soc. for Industrial \& Applied Mathematics"
-, address =	"Philadelphia, PA"
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "C. K. Chui"
+, title =       "Multivariate spline spaces"
+, publisher =   "Soc. for Industrial \& Applied Mathematics"
+, address =     "Philadelphia, PA"
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @article{cgg-stc-89
-, author =	"F. Chung and M. Gardner and R. Graham"
-, title =	"Steiner trees on a checkerboard"
-, journal =	"Math. Mag."
-, volume =	62
-, number =	2
-, year =	1989
-, pages =	"83--96"
-, keywords =	"Steiner tree"
-, update =	"95.09 korneenko"
+, author =      "F. Chung and M. Gardner and R. Graham"
+, title =       "Steiner trees on a checkerboard"
+, journal =     "Math. Mag."
+, volume =      62
+, number =      2
+, year =        1989
+, pages =       "83--96"
+, keywords =    "Steiner tree"
+, update =      "95.09 korneenko"
 }
 
 @article{c-lat-84
-, author =	"F. R. K. Chung"
-, title =	"On linear arrangements of trees"
-, journal =	"Comput. Math. Appl."
-, volume =	10
-, year =	1984
-, pages =	"43--60"
-, update =	"98.03 bibrelex"
+, author =      "F. R. K. Chung"
+, title =       "On linear arrangements of trees"
+, journal =     "Comput. Math. Appl."
+, volume =      10
+, year =        1984
+, pages =       "43--60"
+, update =      "98.03 bibrelex"
 }
 
 @article{c-spirh-89
-, author =	"F. R. K. Chung"
-, title =	"Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"183--190"
+, author =      "F. R. K. Chung"
+, title =       "Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "183--190"
 }
 
 @article{cg-nbesm-85
-, author =	"F. R. K. Chung and R. L. Graham"
-, title =	"A new bound for {Euclidean} {Steiner} minimal trees"
-, journal =	"Ann. New York Acad. Sci."
-, volume =	440
-, year =	1985
-, pages =	"328--346"
-, keywords =	"Steiner tree"
-, update =	"96.09 devillers, 95.09 korneenko"
+, author =      "F. R. K. Chung and R. L. Graham"
+, title =       "A new bound for {Euclidean} {Steiner} minimal trees"
+, journal =     "Ann. New York Acad. Sci."
+, volume =      440
+, year =        1985
+, pages =       "328--346"
+, keywords =    "Steiner tree"
+, update =      "96.09 devillers, 95.09 korneenko"
 }
 
 @article{cg-stbps-81
-, author =	"F. R. K. Chung and R. L. Graham"
-, title =	"On {Steiner} trees for bounded point sets"
-, journal =	"Geom. Dedicata"
-, volume =	11
-, year =	1981
-, pages =	"353--361"
-, update =	"97.11 bibrelex"
+, author =      "F. R. K. Chung and R. L. Graham"
+, title =       "On {Steiner} trees for bounded point sets"
+, journal =     "Geom. Dedicata"
+, volume =      11
+, year =        1981
+, pages =       "353--361"
+, update =      "97.11 bibrelex"
 }
 
 @article{cg-stl-78
-, author =	"F. R. K. Chung and R. L. Graham"
-, title =	"Steiner trees for ladders"
-, journal =	"Ann. Discrete Math."
-, volume =	2
-, year =	1978
-, pages =	"173--200"
-, keywords =	"Steiner tree"
-, update =	"96.09 devillers, 95.09 korneenko"
+, author =      "F. R. K. Chung and R. L. Graham"
+, title =       "Steiner trees for ladders"
+, journal =     "Ann. Discrete Math."
+, volume =      2
+, year =        1978
+, pages =       "173--200"
+, keywords =    "Steiner tree"
+, update =      "96.09 devillers, 95.09 korneenko"
 }
 
 @article{ch-lmrst-79
-, author =	"F. R. K. Chung and F. K. Hwang"
-, title =	"The largest minimal rectilinear {Steiner} trees for a set of $n$ points enclosed in a rectangle with given perimeter"
-, journal =	"Networks"
-, volume =	9
-, year =	1979
-, pages =	"19--36"
-, update =	"97.11 bibrelex"
+, author =      "F. R. K. Chung and F. K. Hwang"
+, title =       "The largest minimal rectilinear {Steiner} trees for a set of $n$ points enclosed in a rectangle with given perimeter"
+, journal =     "Networks"
+, volume =      9
+, year =        1979
+, pages =       "19--36"
+, update =      "97.11 bibrelex"
 }
 
 @article{c-ctpg-75
-, author =	"V. Chv\'atal"
-, title =	"A combinatorial theorem in plane geometry"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	18
-, year =	1975
-, pages =	"39--41"
-, update =	"94.05 devillers"
+, author =      "V. Chv\'atal"
+, title =       "A combinatorial theorem in plane geometry"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      18
+, year =        1975
+, pages =       "39--41"
+, update =      "94.05 devillers"
 }
 
 @article{c-ghscp-79
-, author =	"V. Chv{\'a}tal"
-, title =	"A greedy heuristic for the set-covering problem"
-, journal =	"Math. Oper. Res."
-, volume =	4
-, year =	1979
-, pages =	"233--235"
-, keywords =	"approximation"
-, update =	"94.05 devillers"
+, author =      "V. Chv{\'a}tal"
+, title =       "A greedy heuristic for the set-covering problem"
+, journal =     "Math. Oper. Res."
+, volume =      4
+, year =        1979
+, pages =       "233--235"
+, keywords =    "approximation"
+, update =      "94.05 devillers"
 }
 
 @incollection{c-hc-85
-, author =	"V. Chvatal"
-, title =	"{Hamiltonian} Cycles"
-, booktitle =	"The Traveling Salesman Problem"
-, publisher =	"John Wiley \& Sons"
-, year =	1985
-, pages =	"403--429"
-, update =	"99.11 bibrelex, 98.11 bibrelex"
+, author =      "V. Chvatal"
+, title =       "{Hamiltonian} Cycles"
+, booktitle =   "The Traveling Salesman Problem"
+, publisher =   "John Wiley \& Sons"
+, year =        1985
+, pages =       "403--429"
+, update =      "99.11 bibrelex, 98.11 bibrelex"
 }
 
 @techreport{c-lnnas-92
-, author =	"V. Chv{\'a}tal"
-, title =	"Lecture Notes on the New {AKS} Sorting Network"
-, type =	"{Report}"
-, number =	"DCS-TR-294"
-, institution =	"Computer Science Dept., Rutgers University"
-, year =	1992
-, note =	"Available at
-	\url{ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-294.ps.Z}"
-, update =	"96.09 orourke"
+, author =      "V. Chv{\'a}tal"
+, title =       "Lecture Notes on the New {AKS} Sorting Network"
+, type =        "{Report}"
+, number =      "DCS-TR-294"
+, institution = "Computer Science Dept., Rutgers University"
+, year =        1992
+, note =        "Available at
+        \url{ftp://athos.rutgers.edu/pub/technical-reports/dcs-tr-294.ps.Z}"
+, update =      "96.09 orourke"
 }
 
 @book{c-lp-83
-, author =	"V. Chv{\'a}tal"
-, title =	"Linear Programming"
-, publisher =	"W. H. Freeman"
-, address =	"New York, NY"
-, year =	1983
+, author =      "V. Chv{\'a}tal"
+, title =       "Linear Programming"
+, publisher =   "W. H. Freeman"
+, address =     "New York, NY"
+, year =        1983
 }
 
 @article{c-tghc-73
-, author =	"V. Chv{\'a}tal"
-, title =	"Tough graphs and {Hamiltonian} circuits"
-, journal =	"Discrete Math."
-, volume =	5
-, number =	3
-, month =	jul
-, year =	1973
-, pages =	"215--228"
-, update =	"97.11 bibrelex"
+, author =      "V. Chv{\'a}tal"
+, title =       "Tough graphs and {Hamiltonian} circuits"
+, journal =     "Discrete Math."
+, volume =      5
+, number =      3
+, month =       jul
+, year =        1973
+, pages =       "215--228"
+, update =      "97.11 bibrelex"
 }
 
 @article{ck-flcs-80
-, author =	"V. Chv{\'a}tal and G. Klincsek"
-, title =	"Finding largest convex subsets"
-, journal =	"Congr. Numer."
-, volume =	29
-, year =	1980
-, pages =	"453--460"
-, note =	"Combinatorics, Graph Theory and Computing. Proc. South-East Conf., Boca Raton, vol. 2"
-, keywords =	"convex, extremal figures, peeling"
-, update =	"95.09 korneenko"
+, author =      "V. Chv{\'a}tal and G. Klincsek"
+, title =       "Finding largest convex subsets"
+, journal =     "Congr. Numer."
+, volume =      29
+, year =        1980
+, pages =       "453--460"
+, note =        "Combinatorics, Graph Theory and Computing. Proc. South-East Conf., Boca Raton, vol. 2"
+, keywords =    "convex, extremal figures, peeling"
+, update =      "95.09 korneenko"
 }
 
 @article{cs-mdld-90
-, author =	"S. Chynoweth and M. J. Sewell"
-, title =	"Mesh Duality and Legendre Duality"
-, journal =	"Proceedings Of The Royal Society Of London Series A-Mathematical And Physical Sciences"
-, volume =	428
-, number =	1875
-, year =	1990
-, pages =	"351--377"
-, annote =	"Another proof of mapping between convex hull on
-		 paraboloid and DT in k dimensions."
+, author =      "S. Chynoweth and M. J. Sewell"
+, title =       "Mesh Duality and Legendre Duality"
+, journal =     "Proceedings Of The Royal Society Of London Series A-Mathematical And Physical Sciences"
+, volume =      428
+, number =      1875
+, year =        1990
+, pages =       "351--377"
+, annote =      "Another proof of mapping between convex hull on
+                 paraboloid and DT in k dimensions."
 }
 
 @article{ck-drtdp-87
-, author =	"M. J. Cieselski and E. Kinnen"
-, title =	"Digraph relaxation for two-dimensional placement of {IC} blocks"
-, journal =	"IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
-, volume =	6
-, number =	1
-, year =	1987
-, pages =	"55--66"
-, keywords =	"geometric graphs, decomposition, placement, VLSI design, isothetic"
-, update =	"95.09 korneenko"
+, author =      "M. J. Cieselski and E. Kinnen"
+, title =       "Digraph relaxation for two-dimensional placement of {IC} blocks"
+, journal =     "IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
+, volume =      6
+, number =      1
+, year =        1987
+, pages =       "55--66"
+, keywords =    "geometric graphs, decomposition, placement, VLSI design, isothetic"
+, update =      "95.09 korneenko"
 }
 
 @article{c-fswpm-88
-, author =	"D. Cieslik"
-, title =	"The {Fermat}-{Steiner}-{Weber} problem in {Minkowski} spaces"
-, journal =	"Optimization"
-, volume =	19
-, number =	4
-, year =	1988
-, pages =	"485--489"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "D. Cieslik"
+, title =       "The {Fermat}-{Steiner}-{Weber} problem in {Minkowski} spaces"
+, journal =     "Optimization"
+, volume =      19
+, number =      4
+, year =        1988
+, pages =       "485--489"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @incollection{c-srbmp-90
-, author =	"D. Cieslik"
-, title =	"The {Steiner} ratio of {Banach}-{Minkowski} planes"
-, editor =	"R. Bodendiek"
-, booktitle =	"Contemporary Methods in Graph Theory"
-, publisher =	"BI-Wissenschaftsverlag"
-, address =	"Mannheim, Germany"
-, year =	1990
-, pages =	"231--248"
-, update =	"98.03 bibrelex"
+, author =      "D. Cieslik"
+, title =       "The {Steiner} ratio of {Banach}-{Minkowski} planes"
+, editor =      "R. Bodendiek"
+, booktitle =   "Contemporary Methods in Graph Theory"
+, publisher =   "BI-Wissenschaftsverlag"
+, address =     "Mannheim, Germany"
+, year =        1990
+, pages =       "231--248"
+, update =      "98.03 bibrelex"
 }
 
 @article{cgms-rtcat-00
-, author =	"P. Cignoni and F. Ganovelli and C. Montani and R. Scopigno"
-, title =	"Reconstruction of topologically correct and adaptive trilinear isosurfaces"
-, journal =	"Computers \& Graphics"
-, volume =	24
-, number =	3
-, year =	2000
-, pages =	"399--418"
-, update =	"02.03 wenger"
+, author =      "P. Cignoni and F. Ganovelli and C. Montani and R. Scopigno"
+, title =       "Reconstruction of topologically correct and adaptive trilinear isosurfaces"
+, journal =     "Computers \& Graphics"
+, volume =      24
+, number =      3
+, year =        2000
+, pages =       "399--418"
+, update =      "02.03 wenger"
 }
 
 @inproceedings{cmps-oieiv-96
-, author =	"P. Cignoni and C. Montani and E. Puppo and R. Scopigno"
-, title =	"Optimal isosurface extraction from irregular volume data"
-, booktitle =	"Proc. IEEE Symposium on Volume Visuatization"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "P. Cignoni and C. Montani and E. Puppo and R. Scopigno"
+, title =       "Optimal isosurface extraction from irregular volume data"
+, booktitle =   "Proc. IEEE Symposium on Volume Visuatization"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @incollection{cms-cmsa-98
-, author =	"P. Cignoni and C. Montani and R. Scopigno"
-, title =	"A Comparison of Mesh Simplification Algorithms"
-, booktitle =	"Computers \& Graphics"
-, volume =	22
-, publisher =	"Pergamon Press"
-, note =	"To appear;
+, author =      "P. Cignoni and C. Montani and R. Scopigno"
+, title =       "A Comparison of Mesh Simplification Algorithms"
+, booktitle =   "Computers \& Graphics"
+, volume =      22
+, publisher =   "Pergamon Press"
+, note =        "To appear;
                  \url{http://miles.cnuce.cnr.it/cg/bibliography.html}."
-, update =	"98.07 orourke"
+, update =      "98.07 orourke"
 }
 
 @article{cms-cmsa-98-b
-, author =	"P. Cignoni and C. Montani and R. Scopigno"
-, title =	"A Comparison of Mesh Simplification Algorithms"
-, journal =	"Comput. \& Graphics"
-, volume =	22
-, number =	1
-, year =	1998
-, pages =	"37--54"
-, update =	"02.03 wenger"
+, author =      "P. Cignoni and C. Montani and R. Scopigno"
+, title =       "A Comparison of Mesh Simplification Algorithms"
+, journal =     "Comput. \& Graphics"
+, volume =      22
+, number =      1
+, year =        1998
+, pages =       "37--54"
+, update =      "02.03 wenger"
 }
 
 @techreport{cms-mfdca-94
-, author =	"P. Cignoni and C. Montani and R. Scopigno"
-, title =	"A merge-first divide \& conquer algorithm for {$E^d$} {Delaunay} triangulations"
-, institution =	"Consiglio Nazionale delle Ricerche, Pisa, Italy"
-, year =	1994
-, update =	"00.03 bibrelex"
+, author =      "P. Cignoni and C. Montani and R. Scopigno"
+, title =       "A merge-first divide \& conquer algorithm for {$E^d$} {Delaunay} triangulations"
+, institution = "Consiglio Nazionale delle Ricerche, Pisa, Italy"
+, year =        1994
+, update =      "00.03 bibrelex"
 }
 
 @article{cms-tcpht-96
-, author =	"P. Cignoni and C. Montani and R. Scopigno"
-, title =	"Triangulating Convex Polygons Having T-Vertices"
-, journal =	"J. Graphics Tools"
-, volume =	1
-, number =	2
-, year =	1996
-, pages =	"1--4"
-, update =	"97.11 held"
+, author =      "P. Cignoni and C. Montani and R. Scopigno"
+, title =       "Triangulating Convex Polygons Having T-Vertices"
+, journal =     "J. Graphics Tools"
+, volume =      1
+, number =      2
+, year =        1996
+, pages =       "1--4"
+, update =      "97.11 held"
 }
 
 @inproceedings{c-actp-89
-, author =	"V. {\v C}ik"
-, title =	"The algorithm of constructing the triangulation of points"
-, booktitle =	"Po{\v c}ita{\v c}ova grafika'89. Zb. Konf."
-, site =	"Smolenice, Chech."
-, year =	1989
-, pages =	"26--30"
-, keywords =	"point-set triangulation"
-, update =	"95.09 korneenko"
+, author =      "V. {\v C}ik"
+, title =       "The algorithm of constructing the triangulation of points"
+, booktitle =   "Po{\v c}ita{\v c}ova grafika'89. Zb. Konf."
+, site =        "Smolenice, Chech."
+, year =        1989
+, pages =       "26--30"
+, keywords =    "point-set triangulation"
+, update =      "95.09 korneenko"
 }
 
 @article{c-fhccp-90
-, author =	"R. J. Cimikowski"
-, title =	"Finding {Hamiltonian} cycles in certain planar graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	35
-, year =	1990
-, pages =	"249--254"
-, keywords =	"geometric graphs, Delaunay triangulation"
-, update =	"95.09 korneenko"
+, author =      "R. J. Cimikowski"
+, title =       "Finding {Hamiltonian} cycles in certain planar graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      35
+, year =        1990
+, pages =       "249--254"
+, keywords =    "geometric graphs, Delaunay triangulation"
+, update =      "95.09 korneenko"
 }
 
 @article{c-psepg-92
-, author =	"R. J. Cimikowski"
-, title =	"Properties of some {Euclidian} proximity graphs"
-, journal =	"Pattern Recogn. Lett."
-, volume =	13
-, number =	6
-, month =	jun
-, year =	1992
-, pages =	"417--423"
-, update =	"98.11 bibrelex"
+, author =      "R. J. Cimikowski"
+, title =       "Properties of some {Euclidian} proximity graphs"
+, journal =     "Pattern Recogn. Lett."
+, volume =      13
+, number =      6
+, month =       jun
+, year =        1992
+, pages =       "417--423"
+, update =      "98.11 bibrelex"
 }
 
 @article{cd-epc3d-94
-, author =	"A. R. Clare and A. M. Day"
-, title =	"Experiments in the Parallel Computation of 3D Convex Hulls"
-, journal =	"Comput. Graph. Forum"
-, volume =	13
-, number =	1
-, month =	mar
-, year =	1994
-, pages =	"21--36"
-, update =	"96.01 held"
+, author =      "A. R. Clare and A. M. Day"
+, title =       "Experiments in the Parallel Computation of 3D Convex Hulls"
+, journal =     "Comput. Graph. Forum"
+, volume =      13
+, number =      1
+, month =       mar
+, year =        1994
+, pages =       "21--36"
+, update =      "96.01 held"
 }
 
 @article{ccj-udg-90
-, author =	"B. N. Clark and C. J. Colbourn and D. S. Johnson"
-, title =	"Unit disk graphs"
-, journal =	"Discrete Math."
-, volume =	86
-, number =	"1--3"
-, year =	1990
-, pages =	"165--178"
-, keywords =	"geometric graphs, computational complexity, disks"
-, update =	"95.09 korneenko"
+, author =      "B. N. Clark and C. J. Colbourn and D. S. Johnson"
+, title =       "Unit disk graphs"
+, journal =     "Discrete Math."
+, volume =      86
+, number =      "1--3"
+, year =        1990
+, pages =       "165--178"
+, keywords =    "geometric graphs, computational complexity, disks"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{cb-dedsn-96
-, author =	"Brett W. Clark and Steven E. Benzley"
-, title =	"Development and evaluation of a degenerate seven-node hexahedron finite element"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"321--331"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Brett W. Clark and Steven E. Benzley"
+, title =       "Development and evaluation of a degenerate seven-node hexahedron finite element"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "321--331"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @article{c-vgpg-80
-, author =	"J. Clark"
-, title =	"A ``VLSI'' geometry processor for graphics"
-, journal =	"Lambda"
-, volume =	1
-, number =	2
-, year =	1980
-, keywords =	"parallel computation, computer graphics"
-, update =	"95.09 korneenko"
+, author =      "J. Clark"
+, title =       "A ``VLSI'' geometry processor for graphics"
+, journal =     "Lambda"
+, volume =      1
+, number =      2
+, year =        1980
+, keywords =    "parallel computation, computer graphics"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{c-farps-79
-, author =	"J. H. Clark"
-, title =	"A fast algorithm for rendering parametric surfaces"
-, booktitle =	"Proc. SIGGRAPH '79"
-, year =	1979
-, pages =	"289--299"
-, update =	"97.11 bibrelex"
+, author =      "J. H. Clark"
+, title =       "A fast algorithm for rendering parametric surfaces"
+, booktitle =   "Proc. SIGGRAPH '79"
+, year =        1979
+, pages =       "289--299"
+, update =      "97.11 bibrelex"
 }
 
 @article{c-ds3d-76
-, author =	"J. H. Clark"
-, title =	"Designing surfaces in $3$-d"
-, journal =	"Commun. ACM"
-, volume =	19
-, year =	1976
-, pages =	"454--460"
+, author =      "J. H. Clark"
+, title =       "Designing surfaces in $3$-d"
+, journal =     "Commun. ACM"
+, volume =      19
+, year =        1976
+, pages =       "454--460"
 }
 
 @article{c-hgmvs-76
-, author =	"J. H. Clark"
-, title =	"Hierarchical geometric models for visible surface algorithms"
-, journal =	"Commun. ACM"
-, volume =	19
-, year =	1976
-, pages =	"547--554"
+, author =      "J. H. Clark"
+, title =       "Hierarchical geometric models for visible surface algorithms"
+, journal =     "Commun. ACM"
+, volume =      19
+, year =        1976
+, pages =       "547--554"
 }
 
 @techreport{c-pcsvc-78
-, author =	"J. H. Clark"
-, title =	"Parametric curves, surfaces and volumes in computer graphics and computer-aided geometric design"
-, type =	"Typescript"
-, institution =	"NASA Ames Res. Center"
-, year =	1978
+, author =      "J. H. Clark"
+, title =       "Parametric curves, surfaces and volumes in computer graphics and computer-aided geometric design"
+, type =        "Typescript"
+, institution = "NASA Ames Res. Center"
+, year =        1978
 }
 
 @article{c-gevgs-82
-, author =	"J. H. Clark"
-, title =	"The geometry engine: a {VLSI} geometric system for graphics"
-, journal =	"Comput. Graph."
-, volume =	16
-, number =	3
-, year =	1982
-, pages =	"127--133"
-, keywords =	"parallel computation, elementary geometry"
-, update =	"95.09 korneenko"
+, author =      "J. H. Clark"
+, title =       "The geometry engine: a {VLSI} geometric system for graphics"
+, journal =     "Comput. Graph."
+, volume =      16
+, number =      3
+, year =        1982
+, pages =       "127--133"
+, keywords =    "parallel computation, elementary geometry"
+, update =      "95.09 korneenko"
 }
 
 @book{c-acc-95
-, author =	"K. C. Clarke"
-, title =	"Analytical and Computer Cartography"
-, edition =	"2nd"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1995
-, update =	"97.03 schwarzkopf, 96.09 kreveld"
+, author =      "K. C. Clarke"
+, title =       "Analytical and Computer Cartography"
+, edition =     "2nd"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1995
+, update =      "97.03 schwarzkopf, 96.09 kreveld"
 }
 
 @techreport{c-csfas-90
-, author =	"K. Clarkson"
-, title =	"Computing a single face in arrangements of segments"
-, type =	"Unpublished Manuscript"
-, institution =	"??"
-, year =	1990
-, keywords =	"arrangements, randomized algorithms"
-, update =	"95.09 agarwal"
+, author =      "K. Clarkson"
+, title =       "Computing a single face in arrangements of segments"
+, type =        "Unpublished Manuscript"
+, institution = "??"
+, year =        1990
+, keywords =    "arrangements, randomized algorithms"
+, update =      "95.09 agarwal"
 }
 
 @article{cegsw-ccbac-90
-, author =	"K. Clarkson and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
-, title =	"Combinatorial complexity bounds for arrangements of curves and spheres"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"99--160"
-, keywords =	"arrangements, complexity of faces, combinatorial geometry"
-, succeeds =	"cegsw-ccbac-88"
-, update =	"98.03 mitchell"
+, author =      "K. Clarkson and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
+, title =       "Combinatorial complexity bounds for arrangements of curves and spheres"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "99--160"
+, keywords =    "arrangements, complexity of faces, combinatorial geometry"
+, succeeds =    "cegsw-ccbac-88"
+, update =      "98.03 mitchell"
 }
 
 @techreport{c-blmat-92
-, author =	"K. L. Clarkson"
-, title =	"A bound on local minima of arrangements that implies the upper bound theorem"
-, type =	"Manuscript"
-, year =	1992
-, comments =	"proves that the number of local minima of k-level in hyperplane arrangement is $O(k^{d-1})$, derives upper bound thm from it"
-, update =	"93.09 matousek"
+, author =      "K. L. Clarkson"
+, title =       "A bound on local minima of arrangements that implies the upper bound theorem"
+, type =        "Manuscript"
+, year =        1992
+, comments =    "proves that the number of local minima of k-level in hyperplane arrangement is $O(k^{d-1})$, derives upper bound thm from it"
+, update =      "93.09 matousek"
 }
 
 @article{c-blmat-93
-, author =	"K. L. Clarkson"
-, title =	"A bound on local minima of arrangements that implies the upper bound theorem"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"427--233"
-, url =	"http://cm.bell-labs.com/who/clarkson/kmins.html"
-, update =	"97.03 clarkson"
-, abstract =	"
+, author =      "K. L. Clarkson"
+, title =       "A bound on local minima of arrangements that implies the upper bound theorem"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "427--233"
+, url = "http://cm.bell-labs.com/who/clarkson/kmins.html"
+, update =      "97.03 clarkson"
+, abstract =    "
 This paper shows that the $i$-level of an arrangement of hyperplanes in
 $E^d$ has at most ${{i+d-1}\choose {d-1}}$ local minima.
 This bound follows from ideas previously used to prove bounds on $(\leq k)$-sets.
@@ -36884,761 +36884,761 @@ @article{c-blmat-93
 }
 
 @inproceedings{c-lvalp-88
-, author =	"K. L. Clarkson"
-, title =	"A {Las} {Vegas} algorithm for linear programming when the dimension is small"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"452--456"
-, url =	"http://netlib.bell-labs.com/netlib/att/cs/doc/88/2-lp2.ps"
-, keywords =	"convex, optimization, $d$-dimensional, design of algorithms, random sampling, expected-case analysis"
-, annote =	"finds smallest enclosing sphere of n points, d
-		 dimensions; expected time for n constraints, d
-		 variables is $O(d^{2}n)+(\lg(n/d^{2}))^{\lg
-		 d+2}O(d)^{d/2+O(1)}$"
+, author =      "K. L. Clarkson"
+, title =       "A {Las} {Vegas} algorithm for linear programming when the dimension is small"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "452--456"
+, url = "http://netlib.bell-labs.com/netlib/att/cs/doc/88/2-lp2.ps"
+, keywords =    "convex, optimization, $d$-dimensional, design of algorithms, random sampling, expected-case analysis"
+, annote =      "finds smallest enclosing sphere of n points, d
+                 dimensions; expected time for n constraints, d
+                 variables is $O(d^{2}n)+(\lg(n/d^{2}))^{\lg
+                 d+2}O(d)^{d/2+O(1)}$"
 }
 
 @inproceedings{c-papop-85
-, author =	"K. L. Clarkson"
-, title =	"A probabilistic algorithm for the post office problem"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
-, year =	1985
-, pages =	"175--184"
-, keywords =	"proximity, data structuring, probabilistic analysis, Voronoi diagrams, simplices"
-, precedes =	"c-racpq-88"
+, author =      "K. L. Clarkson"
+, title =       "A probabilistic algorithm for the post office problem"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Theory Comput."
+, year =        1985
+, pages =       "175--184"
+, keywords =    "proximity, data structuring, probabilistic analysis, Voronoi diagrams, simplices"
+, precedes =    "c-racpq-88"
 }
 
 @article{c-racpq-88
-, author =	"K. L. Clarkson"
-, title =	"A randomized algorithm for closest-point queries"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, year =	1988
-, pages =	"830--847"
-, keywords =	"proximity, data structuring, probabilistic analysis, Voronoi diagrams, simplices"
-, succeeds =	"c-papop-85"
+, author =      "K. L. Clarkson"
+, title =       "A randomized algorithm for closest-point queries"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, year =        1988
+, pages =       "830--847"
+, keywords =    "proximity, data structuring, probabilistic analysis, Voronoi diagrams, simplices"
+, succeeds =    "c-papop-85"
 }
 
 @inproceedings{c-apca-93
-, author =	"Kenneth L. Clarkson"
-, title =	"Algorithms for Polytope Covering and Approximation"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"246--252"
-, update =	"97.03 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "Kenneth L. Clarkson"
+, title =       "Algorithms for Polytope Covering and Approximation"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "246--252"
+, update =      "97.03 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @inproceedings{c-aacpq-94
-, author =	"K. L. Clarkson"
-, title =	"An Algorithm for Approximate Closest-Point Queries"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"160--164"
-, cites =	"am-annqf-93, amnsw-oaann-94, as-rssua-90, b-acpqh-93, c-lvalp-88, c-apca-93, d-mescs-74, p-slpab-90, s-sosl-, v-namcf-89, y-cmstk-82, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "K. L. Clarkson"
+, title =       "An Algorithm for Approximate Closest-Point Queries"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "160--164"
+, cites =       "am-annqf-93, amnsw-oaann-94, as-rssua-90, b-acpqh-93, c-lvalp-88, c-apca-93, d-mescs-74, p-slpab-90, s-sosl-, v-namcf-89, y-cmstk-82, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @article{c-agmst-89
-, author =	"K. L. Clarkson"
-, title =	"An algorithm for geometric minimum spanning trees requiring nearly linear expected time"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"461--469"
-, keywords =	"minimum spanning trees, approximation, $d$-dimensional, bucketing, expected-case analysis, geometric graphs"
-, succeeds =	"c-fetaa-84"
-, update =	"98.03 mitchell"
-, annote =	"He gives a nearly linear expected time algorithm for $n$
+, author =      "K. L. Clarkson"
+, title =       "An algorithm for geometric minimum spanning trees requiring nearly linear expected time"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "461--469"
+, keywords =    "minimum spanning trees, approximation, $d$-dimensional, bucketing, expected-case analysis, geometric graphs"
+, succeeds =    "c-fetaa-84"
+, update =      "98.03 mitchell"
+, annote =      "He gives a nearly linear expected time algorithm for $n$
                   points uniformly distributed in a $d$-cube; time is
                   $O(n\alpha(cn,n)$, with $c>6$.  See also
                   \cite{v-mstkd-88}"
 }
 
 @inproceedings{c-arscg-88
-, author =	"K. L. Clarkson"
-, title =	"Applications of random sampling in computational geometry, {II}"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"1--11"
-, precedes =	"cs-arscg-89"
-, cites =	"ag-nssfs-86, ahw-pgers-87, cegsw-ccbac-88, c-papop-85, c-narsc-87, cp-hrsaa-86, cs-adpch-88, csy-khrp-84, ctv-flvat-88i, e-acg-87, em-sstcd-88, es-pmc-74, gp-nkssn-84, hw-ensrq-87, ks-upcha-86, tv-otats-88, w-mksfs-86, y-gctsp-88, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "K. L. Clarkson"
+, title =       "Applications of random sampling in computational geometry, {II}"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "1--11"
+, precedes =    "cs-arscg-89"
+, cites =       "ag-nssfs-86, ahw-pgers-87, cegsw-ccbac-88, c-papop-85, c-narsc-87, cp-hrsaa-86, cs-adpch-88, csy-khrp-84, ctv-flvat-88i, e-acg-87, em-sstcd-88, es-pmc-74, gp-nkssn-84, hw-ensrq-87, ks-upcha-86, tv-otats-88, w-mksfs-86, y-gctsp-88, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{c-aapts-91
-, author =	"K. L. Clarkson"
-, title =	"Approximation algorithms for planar traveling salesman tours and minimum-length triangulations"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"17--23"
+, author =      "K. L. Clarkson"
+, title =       "Approximation algorithms for planar traveling salesman tours and minimum-length triangulations"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "17--23"
 }
 
 @inproceedings{c-aaspm-87
-, author =	"K. L. Clarkson"
-, title =	"Approximation algorithms for shortest path motion planning"
-, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
-, year =	1987
-, pages =	"56--65"
-, keywords =	"motion planning, approximation, two-dimensional, three-dimensional, Voronoi diagrams"
+, author =      "K. L. Clarkson"
+, title =       "Approximation algorithms for shortest path motion planning"
+, booktitle =   "Proc. 19th Annu. ACM Sympos. Theory Comput."
+, year =        1987
+, pages =       "56--65"
+, keywords =    "motion planning, approximation, two-dimensional, three-dimensional, Voronoi diagrams"
 }
 
 @inproceedings{c-faann-83
-, author =	"K. L. Clarkson"
-, title =	"Fast algorithms for the all nearest neighbors problem"
-, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1983
-, pages =	"226--232"
-, keywords =	"proximity, bucketing, approximation, probabilistic analysis"
+, author =      "K. L. Clarkson"
+, title =       "Fast algorithms for the all nearest neighbors problem"
+, booktitle =   "Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1983
+, pages =       "226--232"
+, keywords =    "proximity, bucketing, approximation, probabilistic analysis"
 }
 
 @inproceedings{c-fetaa-84
-, author =	"K. L. Clarkson"
-, title =	"Fast expected time and approximation algorithms for geometric minimum spanning trees"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"342--348"
-, keywords =	"minimum spanning trees, approximation, $d$-dimensional, bucketing, expected-case analysis, geometric graphs"
-, precedes =	"c-agmst-89"
+, author =      "K. L. Clarkson"
+, title =       "Fast expected time and approximation algorithms for geometric minimum spanning trees"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "342--348"
+, keywords =    "minimum spanning trees, approximation, $d$-dimensional, bucketing, expected-case analysis, geometric graphs"
+, precedes =    "c-agmst-89"
 }
 
 @inproceedings{c-farsc-86
-, author =	"K. L. Clarkson"
-, title =	"Further applications of random sampling to computational geometry"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"414--423"
-, precedes =	"c-narsc-87"
+, author =      "K. L. Clarkson"
+, title =       "Further applications of random sampling to computational geometry"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "414--423"
+, precedes =    "c-narsc-87"
 }
 
 @article{c-lvali-95
-, author =	"K. L. Clarkson"
-, title =	"{Las} {Vegas} algorithms for linear and integer programming"
-, journal =	"J. ACM"
-, volume =	42
-, year =	1995
-, pages =	"488--499"
-, keywords =	"convex, optimization, $d$-dimensional, random sampling"
-, update =	"96.05 agarwal"
+, author =      "K. L. Clarkson"
+, title =       "{Las} {Vegas} algorithms for linear and integer programming"
+, journal =     "J. ACM"
+, volume =      42
+, year =        1995
+, pages =       "488--499"
+, keywords =    "convex, optimization, $d$-dimensional, random sampling"
+, update =      "96.05 agarwal"
 }
 
 @techreport{c-lvali-89
-, author =	"K. L. Clarkson"
-, title =	"{Las} {Vegas} Algorithms for Linear and Integer Programming When the Dimension is Small"
-, type =	"Manuscript"
-, institution =	"??"
-, month =	oct
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "K. L. Clarkson"
+, title =       "{Las} {Vegas} Algorithms for Linear and Integer Programming When the Dimension is Small"
+, type =        "Manuscript"
+, institution = "??"
+, month =       oct
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @article{c-lpot-86
-, author =	"K. L. Clarkson"
-, title =	"Linear programming in {$O(n 3^{d^{2}})$} time"
-, journal =	"Inform. Process. Lett."
-, volume =	22
-, year =	1986
-, pages =	"21--24"
-, keywords =	"linear programming, $d$-dimensional, prune-and-search"
+, author =      "K. L. Clarkson"
+, title =       "Linear programming in {$O(n 3^{d^{2}})$} time"
+, journal =     "Inform. Process. Lett."
+, volume =      22
+, year =        1986
+, pages =       "21--24"
+, keywords =    "linear programming, $d$-dimensional, prune-and-search"
 }
 
 @inproceedings{c-mosga-94
-, author =	"K. L. Clarkson"
-, title =	"More output-sensitive geometric algorithms"
-, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1994
-, pages =	"695--702"
-, update =	"95.01 matousek+smid"
+, author =      "K. L. Clarkson"
+, title =       "More output-sensitive geometric algorithms"
+, booktitle =   "Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1994
+, pages =       "695--702"
+, update =      "95.01 matousek+smid"
 }
 
 @inproceedings{c-nnqms-97
-, author =	"K. L. Clarkson"
-, title =	"Nearest Neighbor Queries in Metric Spaces"
-, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '97"
-, year =	1997
-, pages =	"609--617"
-, update =	"98.07 bibrelex, 97.07 agarwal"
+, author =      "K. L. Clarkson"
+, title =       "Nearest Neighbor Queries in Metric Spaces"
+, booktitle =   "Proc. 29th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '97"
+, year =        1997
+, pages =       "609--617"
+, update =      "98.07 bibrelex, 97.07 agarwal"
 }
 
 @article{c-narsc-87
-, author =	"K. L. Clarkson"
-, title =	"New applications of random sampling in computational geometry"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"195--222"
-, keywords =	"combinatorial geometry, data structuring, reporting, searching, separation, range search, point location, probabilistic analysis, triangulations, $d$-dimensional"
-, succeeds =	"c-farsc-86"
+, author =      "K. L. Clarkson"
+, title =       "New applications of random sampling in computational geometry"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "195--222"
+, keywords =    "combinatorial geometry, data structuring, reporting, searching, separation, range search, point location, probabilistic analysis, triangulations, $d$-dimensional"
+, succeeds =    "c-farsc-86"
 }
 
 @incollection{c-rga-92
-, author =	"K. L. Clarkson"
-, title =	"Randomized geometric algorithms"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	1
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1992
-, pages =	"117--162"
-, keywords =	"survey paper, randomized algorithms, range spaces, VC dimension, incremental algorithms, $k$-sets, cuttings"
-, precedes =	"c-rga-95"
-, update =	"98.07 icking, 93.09 erickson"
+, author =      "K. L. Clarkson"
+, title =       "Randomized geometric algorithms"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      1
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1992
+, pages =       "117--162"
+, keywords =    "survey paper, randomized algorithms, range spaces, VC dimension, incremental algorithms, $k$-sets, cuttings"
+, precedes =    "c-rga-95"
+, update =      "98.07 icking, 93.09 erickson"
 }
 
 @incollection{c-rga-95
-, author =	"Kenneth L. Clarkson"
-, title =	"Randomized Geometric Algorithms"
-, editor =	"Ding-Zhu Du and Frank Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1995
-, pages =	"149--194"
-, keywords =	"survey paper, randomized algorithms, range spaces, VC dimension, incremental algorithms, $k$-sets, cuttings"
-, succeeds =	"c-rga-92"
-, update =	"98.07 icking"
+, author =      "Kenneth L. Clarkson"
+, title =       "Randomized Geometric Algorithms"
+, editor =      "Ding-Zhu Du and Frank Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1995
+, pages =       "149--194"
+, keywords =    "survey paper, randomized algorithms, range spaces, VC dimension, incremental algorithms, $k$-sets, cuttings"
+, succeeds =    "c-rga-92"
+, update =      "98.07 icking"
 }
 
 @inproceedings{c-sede-92
-, author =	"K. L. Clarkson"
-, title =	"Safe and effective determinant evaluation"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, month =	oct
-, year =	1992
-, pages =	"387--395"
-, update =	"98.11 bibrelex"
+, author =      "K. L. Clarkson"
+, title =       "Safe and effective determinant evaluation"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, month =       oct
+, year =        1992
+, pages =       "387--395"
+, update =      "98.11 bibrelex"
 }
 
 @article{cct-erpat-92
-, author =	"K. L. Clarkson and R. Cole and R. E. Tarjan"
-, title =	"Erratum: Randomized parallel algorithms for trapezoidal diagrams"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"341--343"
-, keywords =	"randomized, parallel, trapezoidal diagram, triangulation"
-, succeeds =	"cct-rpatd-92"
+, author =      "K. L. Clarkson and R. Cole and R. E. Tarjan"
+, title =       "Erratum: Randomized parallel algorithms for trapezoidal diagrams"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "341--343"
+, keywords =    "randomized, parallel, trapezoidal diagram, triangulation"
+, succeeds =    "cct-rpatd-92"
 }
 
 @inproceedings{cct-rpatd-91
-, author =	"K. L. Clarkson and R. Cole and R. E. Tarjan"
-, title =	"Randomized parallel algorithms for trapezoidal diagrams"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"152--161"
-, keywords =	"random sampling, polygon, triangulation"
-, precedes =	"cct-rpatd-92"
-, cites =	"acg-cdctd-89, am-dplr-88, ce-oails-88, c-tsplt-90i, ci-tsc-84, c-pms-88, cs-arscg-89, ctv-flvat-89, cv-dctao-86, e-acg-87, fm-tspep-84, g-ilspo-89, g-tpp-89, gsg-pmvsp-89, hjw-epcah-90, m-fppa1-88, rr-ostrp-89, s-sfira-90, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "K. L. Clarkson and R. Cole and R. E. Tarjan"
+, title =       "Randomized parallel algorithms for trapezoidal diagrams"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "152--161"
+, keywords =    "random sampling, polygon, triangulation"
+, precedes =    "cct-rpatd-92"
+, cites =       "acg-cdctd-89, am-dplr-88, ce-oails-88, c-tsplt-90i, ci-tsc-84, c-pms-88, cs-arscg-89, ctv-flvat-89, cv-dctao-86, e-acg-87, fm-tspep-84, g-ilspo-89, g-tpp-89, gsg-pmvsp-89, hjw-epcah-90, m-fppa1-88, rr-ostrp-89, s-sfira-90, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{cct-rpatd-92
-, author =	"K. L. Clarkson and R. Cole and R. E. Tarjan"
-, title =	"Randomized parallel algorithms for trapezoidal diagrams"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	2
-, year =	1992
-, pages =	"117--133"
-, keywords =	"randomized, parallel, trapezoidal diagram, triangulation"
-, succeeds =	"cct-rpatd-91"
-, precedes =	"cct-erpat-92"
+, author =      "K. L. Clarkson and R. Cole and R. E. Tarjan"
+, title =       "Randomized parallel algorithms for trapezoidal diagrams"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      2
+, year =        1992
+, pages =       "117--133"
+, keywords =    "randomized, parallel, trapezoidal diagram, triangulation"
+, succeeds =    "cct-rpatd-91"
+, precedes =    "cct-erpat-92"
 }
 
 @techreport{cegsw-ccbac-88t
-, author =	"K. L. Clarkson and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
-, title =	"Combinatorial Complexity Bounds and Arrangements of Curves and Surfaces"
-, type =	"Technical {Report}"
-, number =	"R88/1470"
-, institution =	"Univ. Illinois"
-, address =	"Urbana, IL"
-, month =	nov
-, year =	1988
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "K. L. Clarkson and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
+, title =       "Combinatorial Complexity Bounds and Arrangements of Curves and Surfaces"
+, type =        "Technical {Report}"
+, number =      "R88/1470"
+, institution = "Univ. Illinois"
+, address =     "Urbana, IL"
+, month =       nov
+, year =        1988
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{cegsw-ccbac-88
-, author =	"K. L. Clarkson and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
-, title =	"Combinatorial complexity bounds for arrangements of curves and surfaces"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"568--579"
-, keywords =	"discrete geometry, extremal problems, bipartite graphs, arrangements of curves and surfaces, triangulations, probabilistic counting, zones, Davenport-Schinzel sequences, counting distances"
-, precedes =	"cegsw-ccbac-90"
-, update =	"98.03 mitchell"
+, author =      "K. L. Clarkson and H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir and Emo Welzl"
+, title =       "Combinatorial complexity bounds for arrangements of curves and surfaces"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "568--579"
+, keywords =    "discrete geometry, extremal problems, bipartite graphs, arrangements of curves and surfaces, triangulations, probabilistic counting, zones, Davenport-Schinzel sequences, counting distances"
+, precedes =    "cegsw-ccbac-90"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cemst-acpir-93
-, author =	"K. L. Clarkson and D. Eppstein and G. L. Miller and C. Sturtivant and S.-H. Teng"
-, title =	"Approximating center points with iterated {Radon} points"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"91--98"
-, precedes =	"cemst-acpir-96"
-, cites =	"abfk-pswen-91, b-rg-85, c-lvalp-88, cm-ltdao-93, csy-khrp-87, dgk-htir-63, d-ltatt-84, e-acg-87, fmt-sbpdc-92, gmt-gampi-92, hw-ensrq-87, jm-ccfps-93, lrt-gnd-79, m-aogdc-91, m-ltalp-83, mt-cppd-90, mt-sttd-90, mttv-amp-92, mtv-ugags-91, mv-dgs-91, t-pssug-90, v-smfmf-84, vc-ucrfe-71, y-3spia-83, ZZZ"
-, update =	"98.03 bibrelex, 97.03 devillers, 93.09 jones"
+, author =      "K. L. Clarkson and D. Eppstein and G. L. Miller and C. Sturtivant and S.-H. Teng"
+, title =       "Approximating center points with iterated {Radon} points"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "91--98"
+, precedes =    "cemst-acpir-96"
+, cites =       "abfk-pswen-91, b-rg-85, c-lvalp-88, cm-ltdao-93, csy-khrp-87, dgk-htir-63, d-ltatt-84, e-acg-87, fmt-sbpdc-92, gmt-gampi-92, hw-ensrq-87, jm-ccfps-93, lrt-gnd-79, m-aogdc-91, m-ltalp-83, mt-cppd-90, mt-sttd-90, mttv-amp-92, mtv-ugags-91, mv-dgs-91, t-pssug-90, v-smfmf-84, vc-ucrfe-71, y-3spia-83, ZZZ"
+, update =      "98.03 bibrelex, 97.03 devillers, 93.09 jones"
 }
 
 @article{cemst-acpir-96
-, author =	"K. L. Clarkson and D. Eppstein and G. L. Miller and C. Sturtivant and S.-H. Teng"
-, title =	"Approximating center points with iterative {Radon} points"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"357--377"
-, succeeds =	"cemst-acpir-93"
-, update =	"97.03 devillers"
+, author =      "K. L. Clarkson and D. Eppstein and G. L. Miller and C. Sturtivant and S.-H. Teng"
+, title =       "Approximating center points with iterative {Radon} points"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "357--377"
+, succeeds =    "cemst-acpir-93"
+, update =      "97.03 devillers"
 }
 
 @unpublished{ckv-rsptp-
-, author =	"K. L. Clarkson and S. Kapoor and P. M. Vaida"
-, title =	"Rectilinear shortest paths through polygonal obstacles in {$O(n \log^{3/2}n$} time"
-, year =	"??"
-, note =	"Submitted for publication"
-, update =	"98.03 bibrelex"
+, author =      "K. L. Clarkson and S. Kapoor and P. M. Vaida"
+, title =       "Rectilinear shortest paths through polygonal obstacles in {$O(n \log^{3/2}n$} time"
+, year =        "??"
+, note =        "Submitted for publication"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ckv-rsptp-87
-, author =	"K. L. Clarkson and S. Kapoor and P. M. Vaidya"
-, title =	"Rectilinear shortest paths through polygonal obstacles in {$O(n (\log n)^{2})$} time"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"251--257"
-, cites =	"d-ntpcg-59, gs-canen-83, ll-fmrdp-81, lp-esppr-84, lw-apcfp-79, rlw-rsprb-85, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "K. L. Clarkson and S. Kapoor and P. M. Vaidya"
+, title =       "Rectilinear shortest paths through polygonal obstacles in {$O(n (\log n)^{2})$} time"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "251--257"
+, cites =       "d-ntpcg-59, gs-canen-83, ll-fmrdp-81, lp-esppr-84, lw-apcfp-79, rlw-rsprb-85, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{cms-frric-92t
-, author =	"K. L. Clarkson and K. Mehlhorn and R. Seidel"
-, title =	"Four results on randomized incremental constructions"
-, type =	"Report"
-, number =	"MPI-I-92-112"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
-, precedes =	"cms-frric-92i"
+, author =      "K. L. Clarkson and K. Mehlhorn and R. Seidel"
+, title =       "Four results on randomized incremental constructions"
+, type =        "Report"
+, number =      "MPI-I-92-112"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
+, precedes =    "cms-frric-92i"
 }
 
 @inproceedings{cms-frric-92i
-, author =	"K. L. Clarkson and K. Mehlhorn and R. Seidel"
-, title =	"Four results on randomized incremental constructions"
-, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	577
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"463--474"
-, succeeds =	"cms-frric-92t"
-, precedes =	"cms-frric-93"
-, update =	"99.11 bibrelex, 98.11 bibrelex, 94.05 devillers"
+, author =      "K. L. Clarkson and K. Mehlhorn and R. Seidel"
+, title =       "Four results on randomized incremental constructions"
+, booktitle =   "Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      577
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "463--474"
+, succeeds =    "cms-frric-92t"
+, precedes =    "cms-frric-93"
+, update =      "99.11 bibrelex, 98.11 bibrelex, 94.05 devillers"
 }
 
 @article{cms-frric-93
-, author =	"K. L. Clarkson and K. Mehlhorn and R. Seidel"
-, title =	"Four results on randomized incremental constructions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, number =	4
-, year =	1993
-, pages =	"185--212"
-, succeeds =	"cms-frric-92i"
-, update =	"94.05 devillers+schwarzkopf"
+, author =      "K. L. Clarkson and K. Mehlhorn and R. Seidel"
+, title =       "Four results on randomized incremental constructions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, number =      4
+, year =        1993
+, pages =       "185--212"
+, succeeds =    "cms-frric-92i"
+, update =      "94.05 devillers+schwarzkopf"
 }
 
 @inproceedings{cs-adpch-88
-, author =	"K. L. Clarkson and P. W. Shor"
-, title =	"Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"12--17"
-, keywords =	"random sampling, $k$-sets, convex hulls, diameter"
-, cites =	"c-bvdcp-86, c-arscg-88, e-acg-87, eks-sspp-83, eos-calha-86, h-bevv-56, ph-chfsp-77, ps-cgi-85, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "K. L. Clarkson and P. W. Shor"
+, title =       "Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "12--17"
+, keywords =    "random sampling, $k$-sets, convex hulls, diameter"
+, cites =       "c-bvdcp-86, c-arscg-88, e-acg-87, eks-sspp-83, eos-calha-86, h-bevv-56, ph-chfsp-77, ps-cgi-85, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{cs-arscg-89
-, author =	"K. L. Clarkson and P. W. Shor"
-, title =	"Applications of random sampling in computational geometry, {II}"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"387--421"
-, succeeds =	"c-arscg-88"
+, author =      "K. L. Clarkson and P. W. Shor"
+, title =       "Applications of random sampling in computational geometry, {II}"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "387--421"
+, succeeds =    "c-arscg-88"
 }
 
 @techreport{ctv-flvat-88t
-, author =	"K. L. Clarkson and R. E. Tarjan and C. J. {Van Wyk}"
-, title =	"A fast {Las} {Vegas} algorithm for triangulating a simple polygon"
-, type =	"Technical {Report}"
-, number =	"CS-TR-157-88"
-, institution =	"Dept. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1988
-, precedes =	"ctv-flvat-88i"
-, annote =	"$O(n \log^{*} n)$ expected time"
+, author =      "K. L. Clarkson and R. E. Tarjan and C. J. {Van Wyk}"
+, title =       "A fast {Las} {Vegas} algorithm for triangulating a simple polygon"
+, type =        "Technical {Report}"
+, number =      "CS-TR-157-88"
+, institution = "Dept. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1988
+, precedes =    "ctv-flvat-88i"
+, annote =      "$O(n \log^{*} n)$ expected time"
 }
 
 @inproceedings{ctv-flvat-88i
-, author =	"K. L. Clarkson and R. E. Tarjan and C. J. {Van Wyk}"
-, title =	"A fast {Las} {Vegas} algorithm for triangulating a simple polygon"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"18--22"
-, succeeds =	"ctv-flvat-88t"
-, precedes =	"ctv-flvat-89"
-, cites =	"c-narsc-87, c-arscg-88, ci-tsc-84, es-pmc-74, fm-tspep-84, gjpt-tsp-78, hw-ensrq-87, hmrt-sjslt-86, ps-cgi-85, r-pta-84, tv-otats-88, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
-, annote =	"$O(n \log^{*} n)$ expected time"
+, author =      "K. L. Clarkson and R. E. Tarjan and C. J. {Van Wyk}"
+, title =       "A fast {Las} {Vegas} algorithm for triangulating a simple polygon"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "18--22"
+, succeeds =    "ctv-flvat-88t"
+, precedes =    "ctv-flvat-89"
+, cites =       "c-narsc-87, c-arscg-88, ci-tsc-84, es-pmc-74, fm-tspep-84, gjpt-tsp-78, hw-ensrq-87, hmrt-sjslt-86, ps-cgi-85, r-pta-84, tv-otats-88, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
+, annote =      "$O(n \log^{*} n)$ expected time"
 }
 
 @article{ctv-flvat-89
-, author =	"K. L. Clarkson and R. E. Tarjan and C. J. {Van Wyk}"
-, title =	"A fast {Las} {Vegas} algorithm for triangulating a simple polygon"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"423--432"
-, keywords =	"triangulation, simple polygon, random sampling"
-, succeeds =	"ctv-flvat-88i"
-, update =	"97.03 schwarzkopf"
+, author =      "K. L. Clarkson and R. E. Tarjan and C. J. {Van Wyk}"
+, title =       "A fast {Las} {Vegas} algorithm for triangulating a simple polygon"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "423--432"
+, keywords =    "triangulation, simple polygon, random sampling"
+, succeeds =    "ctv-flvat-88i"
+, update =      "97.03 schwarzkopf"
 }
 
 @article{c-aafnn-79
-, author =	"J. G. Cleary"
-, title =	"Analysis of an algorithm for finding nearest neighbors in {Euclidean} space"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	5
-, year =	1979
-, pages =	"183--192"
+, author =      "J. G. Cleary"
+, title =       "Analysis of an algorithm for finding nearest neighbors in {Euclidean} space"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      5
+, year =        1979
+, pages =       "183--192"
 }
 
 @article{cwbv-mrt-86
-, author =	"J. G. Cleary and B. Wyvill and G. M. Birtwistle and R. Vatti"
-, title =	"Multiprocessor ray tracing"
-, journal =	"Comput. Graph. Forum"
-, volume =	5
-, year =	1986
-, pages =	"3--12"
+, author =      "J. G. Cleary and B. Wyvill and G. M. Birtwistle and R. Vatti"
+, title =       "Multiprocessor ray tracing"
+, journal =     "Comput. Graph. Forum"
+, volume =      5
+, year =        1986
+, pages =       "3--12"
 }
 
 @article{c-aafrt-88
-, author =	"J. L. Cleary"
-, title =	"Analysis of an algorithm for fast ray tracing using uniform space subdivision"
-, journal =	"Visual Comput."
-, volume =	4
-, number =	2
-, year =	1988
-, pages =	"65--83"
-, keywords =	"ray tracing, computer graphics"
-, update =	"95.09 korneenko"
+, author =      "J. L. Cleary"
+, title =       "Analysis of an algorithm for fast ray tracing using uniform space subdivision"
+, journal =     "Visual Comput."
+, volume =      4
+, number =      2
+, year =        1988
+, pages =       "65--83"
+, keywords =    "ray tracing, computer graphics"
+, update =      "95.09 korneenko"
 }
 
 @incollection{cot-liais-87
-, author =	"C. W. Clenshaw and F. W. J. Olver and P. R. Turner"
-, title =	"Level-index arithmetic: an introductory survey"
-, editor =	"P. R. Turner"
-, booktitle =	"Numerical Analysis and Parallel Processing"
-, series =	"Lecture Notes Math."
-, volume =	1397
-, publisher =	"Springer-Verlag"
-, year =	1987
-, pages =	"95--168"
-, update =	"98.11 bibrelex"
+, author =      "C. W. Clenshaw and F. W. J. Olver and P. R. Turner"
+, title =       "Level-index arithmetic: an introductory survey"
+, editor =      "P. R. Turner"
+, booktitle =   "Numerical Analysis and Parallel Processing"
+, series =      "Lecture Notes Math."
+, volume =      1397
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "95--168"
+, update =      "98.11 bibrelex"
 }
 
 @article{cr-c2dts-90
-, author =	"A. K. Cline and R. J. Renka"
-, title =	"A Constrained 2-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers"
-, journal =	"SIAM J. Numer. Anal."
-, volume =	27
-, number =	5
-, year =	1990
-, pages =	"1305--1321"
-, annote =	"Algorithm for CDT. Compute DT. Sequentially insert
-		 constraint edges. Uses selection algorithm to
-		 retriangulate resulting polygons in time $O(k^3)$ which
-		 seems rather pessimistic. ($k$ is number of triangles
-		 intersected by inserted edge.)"
-, abstract =	"A Delaunay triangulation of a set of nodes is a
-		 collection of triangles whose vertices are at the nodes
-		 and whose union fills the convex hull of the set of
-		 nodes. It also has several geometrical properties,
-		 making it useful for solving closest point problems.
-		 The generalization presented here allows the
-		 triangulation to cover nonconvex regions including
-		 those with holes. Although a variety of such
-		 generalizations are possible, the one presented here is
-		 shown to retain important closest point
-		 characteristics. Thus it is useful for determining
-		 shortest paths within planar regions with polygonal
-		 boundaries. (Author abstract) 11 Refs."
+, author =      "A. K. Cline and R. J. Renka"
+, title =       "A Constrained 2-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers"
+, journal =     "SIAM J. Numer. Anal."
+, volume =      27
+, number =      5
+, year =        1990
+, pages =       "1305--1321"
+, annote =      "Algorithm for CDT. Compute DT. Sequentially insert
+                 constraint edges. Uses selection algorithm to
+                 retriangulate resulting polygons in time $O(k^3)$ which
+                 seems rather pessimistic. ($k$ is number of triangles
+                 intersected by inserted edge.)"
+, abstract =    "A Delaunay triangulation of a set of nodes is a
+                 collection of triangles whose vertices are at the nodes
+                 and whose union fills the convex hull of the set of
+                 nodes. It also has several geometrical properties,
+                 making it useful for solving closest point problems.
+                 The generalization presented here allows the
+                 triangulation to cover nonconvex regions including
+                 those with holes. Although a variety of such
+                 generalizations are possible, the one presented here is
+                 shown to retain important closest point
+                 characteristics. Thus it is useful for determining
+                 shortest paths within planar regions with polygonal
+                 boundaries. (Author abstract) 11 Refs."
 }
 
 @techreport{cr-gdtsc-85
-, author =	"A. K. Cline and R. J. Renka"
-, title =	"A generalized {Delaunay} triangulation and the solution of closest node problems in the presence of barriers"
-, type =	"Report"
-, number =	"??"
-, institution =	"Univ. Texas Austin"
-, address =	"Austin, TX"
-, year =	1985
+, author =      "A. K. Cline and R. J. Renka"
+, title =       "A generalized {Delaunay} triangulation and the solution of closest node problems in the presence of barriers"
+, type =        "Report"
+, number =      "??"
+, institution = "Univ. Texas Austin"
+, address =     "Austin, TX"
+, year =        1985
 }
 
 @article{cr-semct-84
-, author =	"A. K. Cline and R. L. Renka"
-, title =	"A storage-efficient method for construction of a {Thiessen} triangulation"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, number =	1
-, year =	1984
-, pages =	"119--140"
+, author =      "A. K. Cline and R. L. Renka"
+, title =       "A storage-efficient method for construction of a {Thiessen} triangulation"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, number =      1
+, year =        1984
+, pages =       "119--140"
 }
 
 @article{cllct-tatdr-88
-, author =	"H. E. Cline and W. E. Lorensen and S. Ludke and C. R. Crawford and B. C. Teeter"
-, title =	"Two algorithms for the three-dimensional reconstruction of tomograms"
-, journal =	"Medical Physics"
-, volume =	15
-, year =	1988
-, pages =	"320--327"
-, update =	"98.03 bibrelex"
+, author =      "H. E. Cline and W. E. Lorensen and S. Ludke and C. R. Crawford and B. C. Teeter"
+, title =       "Two algorithms for the three-dimensional reconstruction of tomograms"
+, journal =     "Medical Physics"
+, volume =      15
+, year =        1988
+, pages =       "320--327"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{cb-tchos-93
-, author =	"J. Cloutier and I. Bennour"
-, title =	"Topological characterization of {Hwang's} optimal {Steiner} tree"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"157--162"
-, cites =	"gj-rstpi-77, ggj-ccsmt-77, h-sprd-66, h-smtrd-76, p-tncfs-92, s-rgrsm-91, as-escrs-90, bc-arstp-92, crs-ostan-90, hr-stp-92, rs-sphtr-91, p-cstp-88, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "J. Cloutier and I. Bennour"
+, title =       "Topological characterization of {Hwang's} optimal {Steiner} tree"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "157--162"
+, cites =       "gj-rstpi-77, ggj-ccsmt-77, h-sprd-66, h-smtrd-76, p-tncfs-92, s-rgrsm-91, as-escrs-90, bc-arstp-92, crs-ostan-90, hr-stp-92, rs-sphtr-91, p-cstp-88, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{cmwms-feps-93
-, author =	"R. du Cloux and G. P. J. F. M. Maas and A. J. H. Wachters and R. F. Milsom and K. J. Scott"
-, title =	"FASTERIX, an environment for {PCB} simulation"
-, booktitle =	"Proc. 11th Internat. Conf. on EMC"
-, site =	"Z{\"u}rich, Switzerland"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "R. du Cloux and G. P. J. F. M. Maas and A. J. H. Wachters and R. F. Milsom and K. J. Scott"
+, title =       "FASTERIX, an environment for {PCB} simulation"
+, booktitle =   "Proc. 11th Internat. Conf. on EMC"
+, site =        "Z{\"u}rich, Switzerland"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @article{cbb-scmrt-91
-, author =	"E. Clufff and R. Burton and W. A. Barrett"
-, title =	"A survey and characterization of multidimensional representation techniques"
-, journal =	"J. Imag. Technol."
-, volume =	17
-, number =	4
-, year =	1991
-, pages =	"142--153"
-, keywords =	"survey data structuring, $d$-dimensional"
-, update =	"95.09 korneenko"
+, author =      "E. Clufff and R. Burton and W. A. Barrett"
+, title =       "A survey and characterization of multidimensional representation techniques"
+, journal =     "J. Imag. Technol."
+, volume =      17
+, number =      4
+, year =        1991
+, pages =       "142--153"
+, keywords =    "survey data structuring, $d$-dimensional"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{cdgm-dsc-97
-, author =	"F. Javier Cobos and J. Carlos Dana and Clara I. Grima and Alberto Marquez"
-, title =	"Diameter of a Set on the Cylinder"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"164--168"
-, update =	"97.11 jones"
+, author =      "F. Javier Cobos and J. Carlos Dana and Clara I. Grima and Alberto Marquez"
+, title =       "Diameter of a Set on the Cylinder"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "164--168"
+, update =      "97.11 jones"
 }
 
 @inproceedings{cdgm-wcss-97
-, author =	"F. Javier Cobos and J. Carlos Dana and Clara I. Grima and Alberto Marquez"
-, title =	"The Width of a Convex Set on the Sphere."
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"159--163"
-, update =	"97.11 jones"
+, author =      "F. Javier Cobos and J. Carlos Dana and Clara I. Grima and Alberto Marquez"
+, title =       "The Width of a Convex Set on the Sphere."
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "159--163"
+, update =      "97.11 jones"
 }
 
 @techreport{co-pccl4d-99a
-, author =	"R. Cocan and J. O'Rourke"
-, title =	"Polygonal chains cannot lock in {4D}"
-, number =	063
-, institution =	"Smith College, Northampton, MA"
-, month =	jul
-, year =	1999
-, note =	"Full version LANL arXive cs.CG/9908005 (Revised Feb. 01);
+, author =      "R. Cocan and J. O'Rourke"
+, title =       "Polygonal chains cannot lock in {4D}"
+, number =      063
+, institution = "Smith College, Northampton, MA"
+, month =       jul
+, year =        1999
+, note =        "Full version LANL arXive cs.CG/9908005 (Revised Feb. 01);
                 to appear in {\em Comput. Geom. Theory Appl.}"
-, archive =	"XXX:cs.CG/9908005"
-, update =	"01.04 orourke, 00.03 orourke"
+, archive =     "XXX:cs.CG/9908005"
+, update =      "01.04 orourke, 00.03 orourke"
 }
 
 @inproceedings{co-pccl4d-99b
-, author =	"R. Cocan and J. O'Rourke"
-, title =	"Polygonal chains cannot lock in {4D}"
-, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
-, year =	1999
-, pages =	"5--8"
-, update =	"00.03 orourke"
+, author =      "R. Cocan and J. O'Rourke"
+, title =       "Polygonal chains cannot lock in {4D}"
+, booktitle =   "Proc. 11th Canad. Conf. Comput. Geom."
+, year =        1999
+, pages =       "5--8"
+, update =      "00.03 orourke"
 }
 
 @article{co-pccl4d-01
-, author =	"R. Cocan and J. O'Rourke"
-, title =	"Polygonal chains cannot lock in {4D}"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	20
-, year =	2001
-, pages =	"105--129"
-, succeeds =	"co-pccl4d-99a"
-, update =	"02.03 orourke"
+, author =      "R. Cocan and J. O'Rourke"
+, title =       "Polygonal chains cannot lock in {4D}"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      20
+, year =        2001
+, pages =       "105--129"
+, succeeds =    "co-pccl4d-99a"
+, update =      "02.03 orourke"
 }
 
 @article{c-cmlfs-69
-, author =	"E. J. Cockayne"
-, title =	"Computation of minimal length full {Steiner} trees on the vertices of a convex polygon"
-, journal =	"Math. Comput."
-, volume =	23
-, year =	1969
-, pages =	"521--531"
+, author =      "E. J. Cockayne"
+, title =       "Computation of minimal length full {Steiner} trees on the vertices of a convex polygon"
+, journal =     "Math. Comput."
+, volume =      23
+, year =        1969
+, pages =       "521--531"
 }
 
 @article{c-easmt-70
-, author =	"E. J. Cockayne"
-, title =	"On the efficiency of the algorithm for {Steiner} minimal trees"
-, journal =	"SIAM J. Appl. Math."
-, volume =	18
-, year =	1970
-, pages =	"150--159"
+, author =      "E. J. Cockayne"
+, title =       "On the efficiency of the algorithm for {Steiner} minimal trees"
+, journal =     "SIAM J. Appl. Math."
+, volume =      18
+, year =        1970
+, pages =       "150--159"
 }
 
 @article{c-sp-67
-, author =	"E. J. Cockayne"
-, title =	"On the {Steiner} problem"
-, journal =	"Canad. Math. Bull."
-, volume =	10
-, year =	1967
-, pages =	"431--450"
+, author =      "E. J. Cockayne"
+, title =       "On the {Steiner} problem"
+, journal =     "Canad. Math. Bull."
+, volume =      10
+, year =        1967
+, pages =       "431--450"
 }
 
 @article{ch-pmpsc-75
-, author =	"E. J. Cockayne and G. W. C. Hall"
-, title =	"Plane Motion of a Particle Subject to Curvature Constraints"
-, journal =	"SIAM J. Control"
-, volume =	13
-, number =	1
-, year =	1975
-, pages =	"197--220"
-, update =	"93.09 devillers"
+, author =      "E. J. Cockayne and G. W. C. Hall"
+, title =       "Plane Motion of a Particle Subject to Curvature Constraints"
+, journal =     "SIAM J. Control"
+, volume =      13
+, number =      1
+, year =        1975
+, pages =       "197--220"
+, update =      "93.09 devillers"
 }
 
 @article{ch-ecsmt-86
-, author =	"E. J. Cockayne and D. E. Hewgill"
-, title =	"Exact computation of {Steiner} minimal trees in the plane"
-, journal =	"Inform. Process. Lett."
-, volume =	22
-, number =	3
-, year =	1986
-, pages =	"151--156"
-, keywords =	"Steiner tree"
-, update =	"95.09 korneenko"
+, author =      "E. J. Cockayne and D. E. Hewgill"
+, title =       "Exact computation of {Steiner} minimal trees in the plane"
+, journal =     "Inform. Process. Lett."
+, volume =      22
+, number =      3
+, year =        1986
+, pages =       "151--156"
+, keywords =    "Steiner tree"
+, update =      "95.09 korneenko"
 }
 
 @article{ch-icpsm-92
-, author =	"E. J. Cockayne and D. E. Hewgill"
-, title =	"Improved computation of plane {Steiner} minimal trees"
-, journal =	"Algorithmica"
-, volume =	7
-, year =	1992
-, pages =	"219--229"
-, update =	"98.11 bibrelex"
+, author =      "E. J. Cockayne and D. E. Hewgill"
+, title =       "Improved computation of plane {Steiner} minimal trees"
+, journal =     "Algorithmica"
+, volume =      7
+, year =        1992
+, pages =       "219--229"
+, update =      "98.11 bibrelex"
 }
 
 @article{cm-spst-68
-, author =	"E. J. Cockayne and Z. A. Melzak"
-, title =	"On {Steiner}'s problem for set-terminals"
-, journal =	"Appl. Math."
-, volume =	26
-, year =	1968
-, pages =	"213--218"
+, author =      "E. J. Cockayne and Z. A. Melzak"
+, title =       "On {Steiner}'s problem for set-terminals"
+, journal =     "Appl. Math."
+, volume =      26
+, year =        1968
+, pages =       "213--218"
 }
 
 @inproceedings{cs-csmt-72
-, author =	"E. J. Cockayne and D. G. Schiller"
-, title =	"Computation of {Steiner} minimal trees"
-, editor =	"D. J. A. Welsh and D. R. Woodall"
-, booktitle =	"Combinatorics (Conference on Combinatorial Mathematics)"
-, publisher =	"Institute of Math. and its applications"
-, address =	"Southend-on-Sea, Essex, England"
-, year =	1972
-, pages =	"53--71"
+, author =      "E. J. Cockayne and D. G. Schiller"
+, title =       "Computation of {Steiner} minimal trees"
+, editor =      "D. J. A. Welsh and D. R. Woodall"
+, booktitle =   "Combinatorics (Conference on Combinatorial Mathematics)"
+, publisher =   "Institute of Math. and its applications"
+, address =     "Southend-on-Sea, Essex, England"
+, year =        1972
+, pages =       "53--71"
 }
 
 @book{c-pwpd-91
-, author =	"S. T. Coffin"
-, title =	"The Puzzling World of Polyhedral Dissections"
-, publisher =	"Oxford University Press"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "S. T. Coffin"
+, title =       "The Puzzling World of Polyhedral Dissections"
+, publisher =   "Oxford University Press"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @article{cgjt-pblot-80
-, author =	"E. G. Coffman and Jr. M. R. Garey and D. S. Johnson and R. E. Tarjan"
-, title =	"Performance Bounds for Level-Oriented two-dimensional Packing Algorithms"
-, journal =	"SIAM J. Comput."
-, volume =	9
-, year =	1980
-, pages =	"808--826"
-, update =	"98.11 bibrelex"
+, author =      "E. G. Coffman and Jr. M. R. Garey and D. S. Johnson and R. E. Tarjan"
+, title =       "Performance Bounds for Level-Oriented two-dimensional Packing Algorithms"
+, journal =     "SIAM J. Comput."
+, volume =      9
+, year =        1980
+, pages =       "808--826"
+, update =      "98.11 bibrelex"
 }
 
 @article{cg-ptmr-92
-, author =	"E. G. Coffman and E. N. Gilbert"
-, title =	"Paths Through a Maze of Rectangles"
-, journal =	"Networks"
-, volume =	22
-, number =	4
-, month =	jul
-, year =	1992
-, pages =	"349--367"
-, keywords =	"competitive analysis, shortest paths, on-line navigation"
-, update =	"98.03 mitchell"
+, author =      "E. G. Coffman and E. N. Gilbert"
+, title =       "Paths Through a Maze of Rectangles"
+, journal =     "Networks"
+, volume =      22
+, number =      4
+, month =       jul
+, year =        1992
+, pages =       "349--367"
+, keywords =    "competitive analysis, shortest paths, on-line navigation"
+, update =      "98.03 mitchell"
 }
 
 @article{cl-apspa-89
-, author =	"E. G. {Coffman, Jr.} and J. C. Lagarias"
-, title =	"Algorithms for packing squares: {A} probabilistic analysis"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, year =	1989
-, pages =	"166--185"
+, author =      "E. G. {Coffman, Jr.} and J. C. Lagarias"
+, title =       "Algorithms for packing squares: {A} probabilistic analysis"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, year =        1989
+, pages =       "166--185"
 }
 
 @article{cjs-spoum-91
-, author =	"E. G. {Coffman, Jr.} and P. W. Shor"
-, title =	"A simple proof of the ${O}(\sqrt{n}\log^{3/4}(n))$ upright matching bound"
-, journal =	"SIAM J. Discrete Math."
-, volume =	4
-, number =	1
-, year =	1991
-, pages =	"48--57"
-, keywords =	"points"
-, update =	"95.09 korneenko"
+, author =      "E. G. {Coffman, Jr.} and P. W. Shor"
+, title =       "A simple proof of the ${O}(\sqrt{n}\log^{3/4}(n))$ upright matching bound"
+, journal =     "SIAM J. Discrete Math."
+, volume =      4
+, number =      1
+, year =        1991
+, pages =       "48--57"
+, keywords =    "points"
+, update =      "95.09 korneenko"
 }
 
 @incollection{c-vta3d-94
-, author =	"Daniel Cohen"
-, title =	"Voxel Traversal along a 3{D} Line"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"366--369"
-, keywords =	"digital line drawing, grid traversal, ray tracing, scan conversion"
-, update =	"94.09 heckbert"
-, annote =	"Visits all the voxels along a 3D line segment with integer
+, author =      "Daniel Cohen"
+, title =       "Voxel Traversal along a 3{D} Line"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "366--369"
+, keywords =    "digital line drawing, grid traversal, ray tracing, scan conversion"
+, update =      "94.09 heckbert"
+, annote =      "Visits all the voxels along a 3D line segment with integer
 endpoints, something like a 3D Bresenham's algorithm. This code could be
 modified to take endpoints with fixed point coordinates. Then the algorithm
 could be very useful for ray tracing, when a uniform grid is being used as a
@@ -37647,2400 +37647,2400 @@ @incollection{c-vta3d-94
 }
 
 @article{c-nlbdt-87
-, author =	"E. Cohen"
-, title =	"A new local basis for designing with tensioned splines"
-, journal =	"ACM Trans. Graph."
-, volume =	6
-, year =	1987
-, pages =	"81--122"
+, author =      "E. Cohen"
+, title =       "A new local basis for designing with tensioned splines"
+, journal =     "ACM Trans. Graph."
+, volume =      6
+, year =        1987
+, pages =       "81--122"
 }
 
 @inproceedings{c-facts-93
-, author =	"E. Cohen"
-, title =	"Fast algorithms for constructing $t$-spanners and paths with stretch $t$"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "E. Cohen"
+, title =       "Fast algorithms for constructing $t$-spanners and paths with stretch $t$"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @article{c-facts-98
-, author =	"E. Cohen"
-, title =	"Fast algorithms for constructing $t$-spanners and paths with stretch $t$"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1998
-, pages =	"210--236"
-, update =	"99.07 smid"
+, author =      "E. Cohen"
+, title =       "Fast algorithms for constructing $t$-spanners and paths with stretch $t$"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1998
+, pages =       "210--236"
+, update =      "99.07 smid"
 }
 
 @article{clr-dbsst-80
-, author =	"E. Cohen and T. Lyche and R. Riesenfeld"
-, title =	"Discrete {B}-splines and subdivison techniques in computer-aided geometric design and computer graphics"
-, journal =	"Comput. Graph. Image Process."
-, volume =	14
-, number =	2
-, year =	1980
-, pages =	"87--110"
-, update =	"97.11 bibrelex"
+, author =      "E. Cohen and T. Lyche and R. Riesenfeld"
+, title =       "Discrete {B}-splines and subdivison techniques in computer-aided geometric design and computer graphics"
+, journal =     "Comput. Graph. Image Process."
+, volume =      14
+, number =      2
+, year =        1980
+, pages =       "87--110"
+, update =      "97.11 bibrelex"
 }
 
 @article{cls-adrs-85
-, author =	"E. Cohen and T. Lyche and L. L. Schumaker"
-, title =	"Algorithms for degree-raising of splines"
-, journal =	"ACM Trans. Graph."
-, volume =	4
-, year =	1985
-, pages =	"171--181"
+, author =      "E. Cohen and T. Lyche and L. L. Schumaker"
+, title =       "Algorithms for degree-raising of splines"
+, journal =     "ACM Trans. Graph."
+, volume =      4
+, year =        1985
+, pages =       "171--181"
 }
 
 @inproceedings{cm-ialit-91
-, author =	"E. Cohen and N. Megiddo"
-, title =	"Improved algorithms for linear inequalities with two variables per inequality"
-, booktitle =	"Proc. 23th Annu. ACM Sympos. Theory Comput."
-, year =	1991
-, pages =	"145--155"
-, keywords =	"linear programming, Monte Carlo"
-, update =	"95.09 korneenko"
+, author =      "E. Cohen and N. Megiddo"
+, title =       "Improved algorithms for linear inequalities with two variables per inequality"
+, booktitle =   "Proc. 23th Annu. ACM Sympos. Theory Comput."
+, year =        1991
+, pages =       "145--155"
+, keywords =    "linear programming, Monte Carlo"
+, update =      "95.09 korneenko"
 }
 
 @incollection{cm-mcffd-93
-, author =	"E. Cohen and N. Megiddo"
-, title =	"Maximizing concave functions in fixed dimension"
-, editor =	"P. Pardalos"
-, booktitle =	"Complexity in Numeric Computation"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1993
-, pages =	"74--87"
-, update =	"98.11 bibrelex, 96.09 agarwal, 96.05 agarwal"
+, author =      "E. Cohen and N. Megiddo"
+, title =       "Maximizing concave functions in fixed dimension"
+, editor =      "P. Pardalos"
+, booktitle =   "Complexity in Numeric Computation"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1993
+, pages =       "74--87"
+, update =      "98.11 bibrelex, 96.09 agarwal, 96.05 agarwal"
 }
 
 @inproceedings{cm-sptna-89
-, author =	"E. Cohen and N. Megiddo"
-, title =	"Strongly polynomial time and {NC} algorithms for detecting cycles in dynamic graphs"
-, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
-, year =	1989
-, pages =	"523--534"
-, update =	"97.11 bibrelex"
+, author =      "E. Cohen and N. Megiddo"
+, title =       "Strongly polynomial time and {NC} algorithms for detecting cycles in dynamic graphs"
+, booktitle =   "Proc. 21st Annu. ACM Sympos. Theory Comput."
+, year =        1989
+, pages =       "523--534"
+, update =      "97.11 bibrelex"
 }
 
 @article{ch-tadvc-79
-, author =	"J. Cohen and T. Hickey"
-, title =	"Two algorithms for determining volumes of convex polyhedra"
-, journal =	"J. ACM"
-, volume =	26
-, year =	1979
-, pages =	"401--414"
+, author =      "J. Cohen and T. Hickey"
+, title =       "Two algorithms for determining volumes of convex polyhedra"
+, journal =     "J. ACM"
+, volume =      26
+, year =        1979
+, pages =       "401--414"
 }
 
 @inproceedings{cmo-spmusm-97
-, author =	"J. Cohen and D. Manocha and M. Olano"
-, title =	"Simplifying polygonal models using successive mappings"
-, booktitle =	"Proc. IEEE Visualization '97"
-, year =	1997
-, pages =	"395--402"
-, update =	"98.07 orourke"
+, author =      "J. Cohen and D. Manocha and M. Olano"
+, title =       "Simplifying polygonal models using successive mappings"
+, booktitle =   "Proc. IEEE Visualization '97"
+, year =        1997
+, pages =       "395--402"
+, update =      "98.07 orourke"
 }
 
 @inproceedings{com-aps-98
-, author =	"J. Cohen and M. Olano and D. Manocha"
-, title =	"Appearance-Preserving Simplification"
-, booktitle =	"Proc. SIGGRAPH '98"
-, site =	"Orlando, FL"
-, series =	"Computer Graphics Proceedings, Annual Conference Series"
-, month =	jul
-, year =	1998
-, pages =	"115--122"
-, update =	"98.11 held"
+, author =      "J. Cohen and M. Olano and D. Manocha"
+, title =       "Appearance-Preserving Simplification"
+, booktitle =   "Proc. SIGGRAPH '98"
+, site =        "Orlando, FL"
+, series =      "Computer Graphics Proceedings, Annual Conference Series"
+, month =       jul
+, year =        1998
+, pages =       "115--122"
+, update =      "98.11 held"
 }
 
 @inproceedings{cvmtwabw-se-96
-, author =	"J. Cohen and A. Varshney and D. Manocha and G. Turk and H. Weber and Pankaj Agarwal and F. P. {Brooks, Jr.} and W. V. Wright"
-, title =	"Simplification Envelopes"
-, booktitle =	"Proceedings of SIGGRAPH '96 (New Orleans, LA, August 4--9, 1996)"
-, series =	"Computer Graphics Proceedings, Annual Conference Series"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"ACM Press"
-, month =	aug
-, year =	1996
-, pages =	"119--128"
-, update =	"98.03 agarwal+mitchell"
+, author =      "J. Cohen and A. Varshney and D. Manocha and G. Turk and H. Weber and Pankaj Agarwal and F. P. {Brooks, Jr.} and W. V. Wright"
+, title =       "Simplification Envelopes"
+, booktitle =   "Proceedings of SIGGRAPH '96 (New Orleans, LA, August 4--9, 1996)"
+, series =      "Computer Graphics Proceedings, Annual Conference Series"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "ACM Press"
+, month =       aug
+, year =        1996
+, pages =       "119--128"
+, update =      "98.03 agarwal+mitchell"
 }
 
 @inproceedings{clmp-ecdie-94
-, author =	"J. D. Cohen and M. C. Lin and D. Manocha and M. K. Ponamgi"
-, title =	"Exact Collision Detection for Interactive Environments"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"391--392"
-, keywords =	"video review"
-, cites =	"clmp-iecdl-94, l-ecdar-93, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones"
+, author =      "J. D. Cohen and M. C. Lin and D. Manocha and M. K. Ponamgi"
+, title =       "Exact Collision Detection for Interactive Environments"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "391--392"
+, keywords =    "video review"
+, cites =       "clmp-iecdl-94, l-ecdar-93, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones"
 }
 
 @inproceedings{clmp-iciec-95
-, author =	"J. D. Cohen and M. C. Lin and D. Manocha and M. K. Ponamgi"
-, title =	"I-COLLIDE: An Interactive and Exact Collision Detection System for Large-Scale Environments"
-, booktitle =	"Proc. ACM Interactive 3D Graphics Conf."
-, year =	1995
-, pages =	"189--196"
-, succeeds =	"clmp-iecdl-94"
-, update =	"96.05 klosowski, 96.01 held"
+, author =      "J. D. Cohen and M. C. Lin and D. Manocha and M. K. Ponamgi"
+, title =       "I-COLLIDE: An Interactive and Exact Collision Detection System for Large-Scale Environments"
+, booktitle =   "Proc. ACM Interactive 3D Graphics Conf."
+, year =        1995
+, pages =       "189--196"
+, succeeds =    "clmp-iecdl-94"
+, update =      "96.05 klosowski, 96.01 held"
 }
 
 @techreport{clmp-iecdl-94
-, author =	"J. D. Cohen and M. C. Lin and D. Manocha and M. K. Ponamgi"
-, title =	"Interactive and Exact Collision Detection for Large-Scaled Environments"
-, type =	"Technical {Report}"
-, number =	"TR94-005"
-, institution =	"Dept. Comput. Sci., Univ. North Carolina"
-, address =	"Chapel Hill, NC"
-, year =	1994
-, precedes =	"clmp-iciec-95"
-, update =	"96.05 klosowski"
+, author =      "J. D. Cohen and M. C. Lin and D. Manocha and M. K. Ponamgi"
+, title =       "Interactive and Exact Collision Detection for Large-Scaled Environments"
+, type =        "Technical {Report}"
+, number =      "TR94-005"
+, institution = "Dept. Comput. Sci., Univ. North Carolina"
+, address =     "Chapel Hill, NC"
+, year =        1994
+, precedes =    "clmp-iciec-95"
+, update =      "96.05 klosowski"
 }
 
 @article{cg-asgpf-83
-, author =	"M. Cohen and S. Grossberg"
-, title =	"Absolute stability of global pattern formation and parallel memory storage by competitive neural networks"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	13
-, year =	1983
-, pages =	"815--825"
-, update =	"98.07 bibrelex"
+, author =      "M. Cohen and S. Grossberg"
+, title =       "Absolute stability of global pattern formation and parallel memory storage by competitive neural networks"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      13
+, year =        1983
+, pages =       "815--825"
+, update =      "98.07 bibrelex"
 }
 
 @book{cw-rris-93
-, author =	"M. Cohen and J. Wallace"
-, title =	"Radiosity and Realistic Image Synthesis"
-, publisher =	"Academic Press"
-, year =	1993
-, update =	"96.05 pocchiola"
+, author =      "M. Cohen and J. Wallace"
+, title =       "Radiosity and Realistic Image Synthesis"
+, publisher =   "Academic Press"
+, year =        1993
+, update =      "96.05 pocchiola"
 }
 
 @article{cbwg-bbaer-86
-, author =	"M. F. Cohen and D. R. Baum and J. R. Wallace and D. P. Greenberg"
-, title =	"The back-buffer algorithm: An extension of the radiosity method to dynamic environments"
-, journal =	"Visual Comput."
-, volume =	2
-, number =	5
-, month =	sep
-, year =	1986
-, pages =	"298--306"
-, update =	"97.11 bibrelex"
+, author =      "M. F. Cohen and D. R. Baum and J. R. Wallace and D. P. Greenberg"
+, title =       "The back-buffer algorithm: An extension of the radiosity method to dynamic environments"
+, journal =     "Visual Comput."
+, volume =      2
+, number =      5
+, month =       sep
+, year =        1986
+, pages =       "298--306"
+, update =      "97.11 bibrelex"
 }
 
 @article{cg-hrsce-85
-, author =	"M. F. Cohen and D. P. Greenberg"
-, title =	"The hemicube: a radiosity solution for complex environments"
-, journal =	"Comput. Graph."
-, volume =	19
-, number =	3
-, year =	1985
-, pages =	"31--40"
-, note =	"Proc. SIGGRAPH '85"
-, update =	"98.03 bibrelex"
+, author =      "M. F. Cohen and D. P. Greenberg"
+, title =       "The hemicube: a radiosity solution for complex environments"
+, journal =     "Comput. Graph."
+, volume =      19
+, number =      3
+, year =        1985
+, pages =       "31--40"
+, note =        "Proc. SIGGRAPH '85"
+, update =      "98.03 bibrelex"
 }
 
 @article{cfhz-cvsov-98
-, author =	"D. Cohen-Or and G. Fibich and D. Halperin and E. Zadicario"
-, title =	"Conservative visibility and strong occlusion for viewspace partitioning of densely occluded scenes"
-, journal =	"Comput. Graph. Forum"
-, volume =	17
-, year =	1998
-, pages =	"C243--C253"
-, note =	"Eurographics '98"
-, update =	"98.11 halperin"
+, author =      "D. Cohen-Or and G. Fibich and D. Halperin and E. Zadicario"
+, title =       "Conservative visibility and strong occlusion for viewspace partitioning of densely occluded scenes"
+, journal =     "Comput. Graph. Forum"
+, volume =      17
+, year =        1998
+, pages =       "C243--C253"
+, note =        "Eurographics '98"
+, update =      "98.11 halperin"
 }
 
 @inproceedings{cdkt-rwods-93
-, author =	"R. F. Cohen and G. {Di Battista} and A. Kanevsky and R. Tamassia"
-, title =	"Reinventing the Wheel: an Optimal Data Structure for Connectivity Queries"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"194--200"
-, update =	"94.05 tamassia"
+, author =      "R. F. Cohen and G. {Di Battista} and A. Kanevsky and R. Tamassia"
+, title =       "Reinventing the Wheel: an Optimal Data Structure for Connectivity Queries"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "194--200"
+, update =      "94.05 tamassia"
 }
 
 @article{cdtt-dgdts-95
-, author =	"R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
-, title =	"Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar {$ST$}-Digraphs"
-, journal =	"SIAM J. Comput."
-, volume =	24
-, number =	5
-, year =	1995
-, pages =	"970--1001"
-, url =	"https://www.cs.brown.edu/cgc/papers/cdtt-dgdts-95.ps.gz"
-, keywords =	"graph drawing, dynamic, planar, trees, series-parallel"
-, succeeds =	"cdttb-fdgd-92"
-, update =	"97.03 tamassia, 96.09 tamassia, 95.09 tamassia, 95 tamassia"
+, author =      "R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis"
+, title =       "Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar {$ST$}-Digraphs"
+, journal =     "SIAM J. Comput."
+, volume =      24
+, number =      5
+, year =        1995
+, pages =       "970--1001"
+, url = "https://www.cs.brown.edu/cgc/papers/cdtt-dgdts-95.ps.gz"
+, keywords =    "graph drawing, dynamic, planar, trees, series-parallel"
+, succeeds =    "cdttb-fdgd-92"
+, update =      "97.03 tamassia, 96.09 tamassia, 95.09 tamassia, 95 tamassia"
 }
 
 @inproceedings{cdttb-fdgd-92
-, author =	"R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis and P. Bertolazzi"
-, title =	"A framework for dynamic graph drawing"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"261--270"
-, keywords =	"graph drawing"
-, cites =	"bst-bst-85, bd-udttd-91, bdtt-hdspd-91, cnao-laepg-85, ct-detta-91, dt-aprad-88, dt-ipt-89, dtt-arsdd-89, dlt-pepg-84, el-hddg-89, et-adgab-89, egs-oplms-86, eittwy-mmsfd-92, fhhklsww-dgphr-90i, fpp-hdpgg-90, gt-dtdpl-91, gy-tsr-83, hl-updss-91, lec-aptg-67, m-ddt-90, o-agta-87, pt-fdplm-89, rt-tdt-81, rt-rplbo-86, s-epgg-90, st-dsdt-83, stt-mvuhs-81, sr-cdtn-83, t-eggmn-87, t-ddspg-88, tp-dmpda-90, tt-uavrp-86, tt-pgelt-89, tt-trpg-89, tt-rgc-91, tv-ptcpl-91, t-paog-89, vtl-rspd-82, kw-wvgbr-89, ZZZ"
-, update =	"01.04 icking, 97.11 bibrelex, 93.09 tamassia"
+, author =      "R. F. Cohen and G. {Di Battista} and R. Tamassia and I. G. Tollis and P. Bertolazzi"
+, title =       "A framework for dynamic graph drawing"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "261--270"
+, keywords =    "graph drawing"
+, cites =       "bst-bst-85, bd-udttd-91, bdtt-hdspd-91, cnao-laepg-85, ct-detta-91, dt-aprad-88, dt-ipt-89, dtt-arsdd-89, dlt-pepg-84, el-hddg-89, et-adgab-89, egs-oplms-86, eittwy-mmsfd-92, fhhklsww-dgphr-90i, fpp-hdpgg-90, gt-dtdpl-91, gy-tsr-83, hl-updss-91, lec-aptg-67, m-ddt-90, o-agta-87, pt-fdplm-89, rt-tdt-81, rt-rplbo-86, s-epgg-90, st-dsdt-83, stt-mvuhs-81, sr-cdtn-83, t-eggmn-87, t-ddspg-88, tp-dmpda-90, tt-uavrp-86, tt-pgelt-89, tt-trpg-89, tt-rgc-91, tv-ptcpl-91, t-paog-89, vtl-rspd-82, kw-wvgbr-89, ZZZ"
+, update =      "01.04 icking, 97.11 bibrelex, 93.09 tamassia"
 }
 
 @inproceedings{celr-tdgd-95
-, author =	"R. F. Cohen and P. Eades and T. Lin and F. Ruskey"
-, title =	"Three-Dimensional Graph Drawing"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"1--11"
-, keywords =	"graph drawing, 3D"
-, precedes =	"celr-tdgd-96"
-, update =	"98.07 patrignani, 95.01 tamassia"
+, author =      "R. F. Cohen and P. Eades and T. Lin and F. Ruskey"
+, title =       "Three-Dimensional Graph Drawing"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "1--11"
+, keywords =    "graph drawing, 3D"
+, precedes =    "celr-tdgd-96"
+, update =      "98.07 patrignani, 95.01 tamassia"
 }
 
 @article{celr-tdgd-96
-, author =	"R. F. Cohen and P. Eades and T. Lin and F. Ruskey"
-, title =	"Three-Dimensional Graph Drawing"
-, journal =	"Algorithmica"
-, volume =	17
-, year =	1997
-, pages =	"199--208"
-, succeeds =	"celr-tdgd-95"
-, update =	"98.07 patrignani"
+, author =      "R. F. Cohen and P. Eades and T. Lin and F. Ruskey"
+, title =       "Three-Dimensional Graph Drawing"
+, journal =     "Algorithmica"
+, volume =      17
+, year =        1997
+, pages =       "199--208"
+, succeeds =    "celr-tdgd-95"
+, update =      "98.07 patrignani"
 }
 
 @inproceedings{cstv-daopb-93
-, author =	"R. F. Cohen and S. Sairam and R. Tamassia and J. S. Vitter"
-, title =	"Dynamic Algorithms for Optimization Problems in Bounded Tree-Width Graphs"
-, booktitle =	"Proc. of the Third Conference on Integer Programming and Combinatorial Optimization"
-, year =	1993
-, pages =	"99--112"
-, update =	"94.01 tamassia"
+, author =      "R. F. Cohen and S. Sairam and R. Tamassia and J. S. Vitter"
+, title =       "Dynamic Algorithms for Optimization Problems in Bounded Tree-Width Graphs"
+, booktitle =   "Proc. of the Third Conference on Integer Programming and Combinatorial Optimization"
+, year =        1993
+, pages =       "99--112"
+, update =      "94.01 tamassia"
 }
 
 @techreport{ct-cc-92
-, author =	"R. F. Cohen and R. Tamassia"
-, title =	"Combine and conquer"
-, type =	"Report"
-, number =	"CS-92-19"
-, institution =	"Comput. Sci. Dept., Brown Univ."
-, address =	"Providence, RI"
-, year =	1992
-, update =	"93.05 smid"
+, author =      "R. F. Cohen and R. Tamassia"
+, title =       "Combine and conquer"
+, type =        "Report"
+, number =      "CS-92-19"
+, institution = "Comput. Sci. Dept., Brown Univ."
+, address =     "Providence, RI"
+, year =        1992
+, update =      "93.05 smid"
 }
 
 @article{ct-cc-97
-, author =	"Robert F. Cohen and Roberto Tamassia"
-, title =	"Combine and Conquer"
-, journal =	"Algorithmica"
-, volume =	18
-, year =	1997
-, pages =	"342--362"
-, succeeds =	"ct-ccgtd-93"
-, update =	"98.07 tamassia"
+, author =      "Robert F. Cohen and Roberto Tamassia"
+, title =       "Combine and Conquer"
+, journal =     "Algorithmica"
+, volume =      18
+, year =        1997
+, pages =       "342--362"
+, succeeds =    "ct-ccgtd-93"
+, update =      "98.07 tamassia"
 }
 
 @incollection{ct-ccgtd-93
-, author =	"Robert F. Cohen and Roberto Tamassia"
-, title =	"Combine and Conquer: {A} General Technique for Dynamic Algorithms"
-, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	726
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"97--108"
-, update =	"94.01 smid, 93.09 milone+mitchell"
+, author =      "Robert F. Cohen and Roberto Tamassia"
+, title =       "Combine and Conquer: {A} General Technique for Dynamic Algorithms"
+, booktitle =   "Proc. 1st Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      726
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "97--108"
+, update =      "94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{ct-det-95
-, author =	"R. F. Cohen and R. Tamassia"
-, title =	"Dynamic Expression Trees"
-, journal =	"Algorithmica"
-, volume =	13
-, year =	1995
-, pages =	"245--265"
-, url =	"https://www.cs.brown.edu/cgc/papers/ct-det-95.ps.gz"
-, succeeds =	"ct-detta-91"
-, update =	"97.03 tamassia, 95.01 tamassia, 95.01 tamassia"
+, author =      "R. F. Cohen and R. Tamassia"
+, title =       "Dynamic Expression Trees"
+, journal =     "Algorithmica"
+, volume =      13
+, year =        1995
+, pages =       "245--265"
+, url = "https://www.cs.brown.edu/cgc/papers/ct-det-95.ps.gz"
+, succeeds =    "ct-detta-91"
+, update =      "97.03 tamassia, 95.01 tamassia, 95.01 tamassia"
 }
 
 @inproceedings{ct-detta-91
-, author =	"R. F. Cohen and R. Tamassia"
-, title =	"Dynamic Expression Trees and their Applications"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"52--61"
-, update =	"93.09 goodrich"
+, author =      "R. F. Cohen and R. Tamassia"
+, title =       "Dynamic Expression Trees and their Applications"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "52--61"
+, update =      "93.09 goodrich"
 }
 
 @inproceedings{cg-pmpps-97
-, author =	"S. D. Cohen and Leonidas J. Guibas"
-, title =	"Partial Matching of Planar Polylines Under Similarity Transformations"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, month =	jan
-, year =	1997
-, pages =	"777--786"
-, update =	"98.03 mitchell, 97.03 held"
+, author =      "S. D. Cohen and Leonidas J. Guibas"
+, title =       "Partial Matching of Planar Polylines Under Similarity Transformations"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, month =       jan
+, year =        1997
+, pages =       "777--786"
+, update =      "98.03 mitchell, 97.03 held"
 }
 
 @inproceedings{ccy-cdt3-02
-, author =	"David {Cohen-Steiner} and Eric {Colin de Verdi{\`e}re} and Mariette Yvinec"
-, title =	"Conforming {Delaunay} Triangulations in 3D"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Comput. Geom."
-, year =	2002
-, pages =	""
-, update =	"02.03 devillers"
+, author =      "David {Cohen-Steiner} and Eric {Colin de Verdi{\`e}re} and Mariette Yvinec"
+, title =       "Conforming {Delaunay} Triangulations in 3D"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Comput. Geom."
+, year =        2002
+, pages =       ""
+, update =      "02.03 devillers"
 }
 
 @article{crs-ostan-90
-, author =	"J. P. Cohoon and D. S. Richards and J. S. Salowe"
-, title =	"An optimal {Steiner} tree algorithm for a net whose terminals lie on the perimeter of a rectangle"
-, journal =	"IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
-, volume =	9
-, number =	4
-, year =	1990
-, pages =	"398--407"
-, keywords =	"Steiner tree"
-, update =	"98.11 bibrelex, 96.09 devillers, 95.09 korneenko"
+, author =      "J. P. Cohoon and D. S. Richards and J. S. Salowe"
+, title =       "An optimal {Steiner} tree algorithm for a net whose terminals lie on the perimeter of a rectangle"
+, journal =     "IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
+, volume =      9
+, number =      4
+, year =        1990
+, pages =       "398--407"
+, keywords =    "Steiner tree"
+, update =      "98.11 bibrelex, 96.09 devillers, 95.09 korneenko"
 }
 
 @inproceedings{crg-uasgl-92
-, author =	"A. C. F. Colchester and G. P. Robinson and L. D. Griffin"
-, title =	"A unified approach to the segmentation of grey-level and dot-pattern"
-, booktitle =	"Proc. 11th IEEE Internat. Conf. Pattern Recogn."
-, year =	1992
-, pages =	"319--322"
-, update =	"98.07 bibrelex"
+, author =      "A. C. F. Colchester and G. P. Robinson and L. D. Griffin"
+, title =       "A unified approach to the segmentation of grey-level and dot-pattern"
+, booktitle =   "Proc. 11th IEEE Internat. Conf. Pattern Recogn."
+, year =        1992
+, pages =       "319--322"
+, update =      "98.07 bibrelex"
 }
 
 @article{c-nsc-83
-, author =	"A. J. Cole"
-, title =	"A note on spacefilling curves"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	13
-, number =	12
-, year =	1983
-, pages =	"1181--1189"
-, update =	"95.09 korneenko"
+, author =      "A. J. Cole"
+, title =       "A note on spacefilling curves"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      13
+, number =      12
+, year =        1983
+, pages =       "1181--1189"
+, update =      "95.09 korneenko"
 }
 
 @article{c-oesa-87
-, author =	"R. Cole"
-, title =	"An optimally efficient selection algorithm"
-, journal =	"Inform. Process. Lett."
-, volume =	26
-, year =	1987
-, pages =	"295--299"
-, update =	"98.07 mitchell, 97.11 bibrelex"
+, author =      "R. Cole"
+, title =       "An optimally efficient selection algorithm"
+, journal =     "Inform. Process. Lett."
+, volume =      26
+, year =        1987
+, pages =       "295--299"
+, update =      "98.07 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{c-pms-86
-, author =	"R. Cole"
-, title =	"Parallel merge sort"
-, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1986
-, pages =	"511--516"
-, update =	"97.11 bibrelex"
+, author =      "R. Cole"
+, title =       "Parallel merge sort"
+, booktitle =   "Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1986
+, pages =       "511--516"
+, update =      "97.11 bibrelex"
 }
 
 @article{c-pms-88
-, author =	"R. Cole"
-, title =	"Parallel merge sort"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, number =	4
-, year =	1988
-, pages =	"770--785"
+, author =      "R. Cole"
+, title =       "Parallel merge sort"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, number =      4
+, year =        1988
+, pages =       "770--785"
 }
 
 @inproceedings{c-pps4d-85
-, author =	"R. Cole"
-, title =	"Partitioning point sets in $4$ dimensions"
-, booktitle =	"Proc. 12th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	194
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"111--119"
-, keywords =	"data structuring, $4$-dimensional, points, counting"
-, succeeds =	"c-ppsad-??"
-, precedes =	"c-ppsad-87"
+, author =      "R. Cole"
+, title =       "Partitioning point sets in $4$ dimensions"
+, booktitle =   "Proc. 12th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      194
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "111--119"
+, keywords =    "data structuring, $4$-dimensional, points, counting"
+, succeeds =    "c-ppsad-??"
+, precedes =    "c-ppsad-87"
 }
 
 @techreport{c-ppsad-??
-, author =	"R. Cole"
-, title =	"Partitioning point sets in arbitrary dimensions"
-, type =	"Report"
-, number =	184
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	"??"
-, keywords =	"data structuring, $d$-dimensional, points, counting"
-, precedes =	"c-pps4d-85"
+, author =      "R. Cole"
+, title =       "Partitioning point sets in arbitrary dimensions"
+, type =        "Report"
+, number =      184
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        "??"
+, keywords =    "data structuring, $d$-dimensional, points, counting"
+, precedes =    "c-pps4d-85"
 }
 
 @article{c-ppsad-87
-, author =	"R. Cole"
-, title =	"Partitioning point sets in arbitrary dimensions"
-, journal =	"Theoret. Comput. Sci."
-, volume =	49
-, year =	1987
-, pages =	"239--265"
-, keywords =	"data structuring, $d$-dimensional, points, counting"
-, succeeds =	"c-pps4d-85"
+, author =      "R. Cole"
+, title =       "Partitioning point sets in arbitrary dimensions"
+, journal =     "Theoret. Comput. Sci."
+, volume =      49
+, year =        1987
+, pages =       "239--265"
+, keywords =    "data structuring, $d$-dimensional, points, counting"
+, succeeds =    "c-pps4d-85"
 }
 
 @techreport{c-sssl-83
-, author =	"R. Cole"
-, title =	"Searching and storing similar lists"
-, type =	"Technical {Report}"
-, number =	88
-, institution =	"New York Univ."
-, month =	oct
-, year =	1983
-, precedes =	"c-sssl-86"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "R. Cole"
+, title =       "Searching and storing similar lists"
+, type =        "Technical {Report}"
+, number =      88
+, institution = "New York Univ."
+, month =       oct
+, year =        1983
+, precedes =    "c-sssl-86"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @article{c-sssl-86
-, author =	"R. Cole"
-, title =	"Searching and storing similar lists"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"202--220"
-, keywords =	"searching, data structuring, point location"
-, succeeds =	"c-sssl-83"
-, update =	"98.11 bibrelex"
+, author =      "R. Cole"
+, title =       "Searching and storing similar lists"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "202--220"
+, keywords =    "searching, data structuring, point location"
+, succeeds =    "c-sssl-83"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{c-sdsno-84
-, author =	"R. Cole"
-, title =	"Slowing down sorting networks to obtain faster sorting algorithms"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1984
-, pages =	"255--260"
-, keywords =	"parallel computation, network algorithms, sorting, searching, design of algorithms"
-, precedes =	"c-sdsno-87"
+, author =      "R. Cole"
+, title =       "Slowing down sorting networks to obtain faster sorting algorithms"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1984
+, pages =       "255--260"
+, keywords =    "parallel computation, network algorithms, sorting, searching, design of algorithms"
+, precedes =    "c-sdsno-87"
 }
 
 @article{c-sdsno-87
-, author =	"R. Cole"
-, title =	"Slowing down sorting networks to obtain faster sorting algorithms"
-, journal =	"J. ACM"
-, volume =	34
-, number =	1
-, year =	1987
-, pages =	"200--208"
-, succeeds =	"c-sdsno-84"
-, update =	"98.11 bibrelex"
+, author =      "R. Cole"
+, title =       "Slowing down sorting networks to obtain faster sorting algorithms"
+, journal =     "J. ACM"
+, volume =      34
+, number =      1
+, year =        1987
+, pages =       "200--208"
+, succeeds =    "c-sdsno-84"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{cg-opapp-88
-, author =	"R. Cole and M. T. Goodrich"
-, title =	"Optimal parallel algorithms for polygon and point-set problems"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"201--210"
-, precedes =	"cg-opapp-92"
-, cites =	"acgoy-pcg-85, acg-cdctd-87, ag-epssg-86, ag-pasft-88, bs-dcms-76, bn-absop-86, c-pagp-80, c-pms-86, g-eptcg-87, g-fchsp-87, grs-kfcg-83, krs-ppp-85, lf-ppc-80, lp-annpc-78, lp-oafkp-79, pm-finhs-79, s-gc-75, t-sgprc-83, w-opach-85, ZZZ"
-, update =	"98.03 bibrelex, 94.01 jones"
+, author =      "R. Cole and M. T. Goodrich"
+, title =       "Optimal parallel algorithms for polygon and point-set problems"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "201--210"
+, precedes =    "cg-opapp-92"
+, cites =       "acgoy-pcg-85, acg-cdctd-87, ag-epssg-86, ag-pasft-88, bs-dcms-76, bn-absop-86, c-pagp-80, c-pms-86, g-eptcg-87, g-fchsp-87, grs-kfcg-83, krs-ppp-85, lf-ppc-80, lp-annpc-78, lp-oafkp-79, pm-finhs-79, s-gc-75, t-sgprc-83, w-opach-85, ZZZ"
+, update =      "98.03 bibrelex, 94.01 jones"
 }
 
 @article{cg-opapp-92
-, author =	"R. Cole and M. T. Goodrich"
-, title =	"Optimal parallel algorithms for polygon and point-set problems"
-, journal =	"Algorithmica"
-, volume =	7
-, year =	1992
-, pages =	"3--23"
-, succeeds =	"cg-opapp-88"
-, update =	"94.01 jones"
+, author =      "R. Cole and M. T. Goodrich"
+, title =       "Optimal parallel algorithms for polygon and point-set problems"
+, journal =     "Algorithmica"
+, volume =      7
+, year =        1992
+, pages =       "3--23"
+, succeeds =    "cg-opapp-88"
+, update =      "94.01 jones"
 }
 
 @article{cgo-anodp-96
-, author =	"R. Cole and M. T. Goodrich and C. {\'O}'D{\'u}nlaing"
-, title =	"A Nearly Optimal Deterministic Parallel {Voronoi} Diagram Algorithm"
-, journal =	"Algorithmica"
-, volume =	16
-, year =	1996
-, pages =	"569--617"
-, update =	"97.03 smid"
+, author =      "R. Cole and M. T. Goodrich and C. {\'O}'D{\'u}nlaing"
+, title =       "A Nearly Optimal Deterministic Parallel {Voronoi} Diagram Algorithm"
+, journal =     "Algorithmica"
+, volume =      16
+, year =        1996
+, pages =       "569--617"
+, update =      "97.03 smid"
 }
 
 @inproceedings{cgo-mftpe-90
-, author =	"R. Cole and M. T. Goodrich and C. {\'O}'D{\'u}nlaing"
-, title =	"Merging free trees in parallel for efficient {Voronoi} diagram construction"
-, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	443
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"432--445"
+, author =      "R. Cole and M. T. Goodrich and C. {\'O}'D{\'u}nlaing"
+, title =       "Merging free trees in parallel for efficient {Voronoi} diagram construction"
+, booktitle =   "Proc. 17th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      443
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "432--445"
 }
 
 @article{csss-otass-89
-, author =	"R. Cole and J. Salowe and W. Steiger and E. Szemer{\'e}di"
-, title =	"An optimal-time algorithm for slope selection"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, number =	4
-, year =	1989
-, pages =	"792--810"
-, keywords =	"arrangements, $d$-dimensional, points, counting, parametric search technique"
-, update =	"98.11 bibrelex"
+, author =      "R. Cole and J. Salowe and W. Steiger and E. Szemer{\'e}di"
+, title =       "An optimal-time algorithm for slope selection"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, number =      4
+, year =        1989
+, pages =       "792--810"
+, keywords =    "arrangements, $d$-dimensional, points, counting, parametric search technique"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{csss-oss-88
-, author =	"R. Cole and J. Salowe and W. Steiger and E. Szemer{\'e}di"
-, title =	"Optimal slope selection"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	318
-, year =	1988
-, pages =	"133--146"
-, update =	"98.03 bibrelex"
+, author =      "R. Cole and J. Salowe and W. Steiger and E. Szemer{\'e}di"
+, title =       "Optimal slope selection"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      318
+, year =        1988
+, pages =       "133--146"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{cs-vppt-86
-, author =	"R. Cole and Micha Sharir"
-, title =	"Visibility problems for polyhedral terrains"
-, type =	"Technical {Report}"
-, number =	266
-, institution =	"??"
-, month =	dec
-, year =	1986
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "R. Cole and Micha Sharir"
+, title =       "Visibility problems for polyhedral terrains"
+, type =        "Technical {Report}"
+, number =      266
+, institution = "??"
+, month =       dec
+, year =        1986
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{cs-vppt-89
-, author =	"R. Cole and Micha Sharir"
-, title =	"Visibility problems for polyhedral terrains"
-, journal =	"J. Symbolic Comput."
-, volume =	7
-, year =	1989
-, pages =	"11--30"
-, keywords =	"locus approach, decomposition, searching, rays, visibility, three-dimensional, polyhedra, polyhedral terrain"
-, update =	"98.03 mitchell"
+, author =      "R. Cole and Micha Sharir"
+, title =       "Visibility problems for polyhedral terrains"
+, journal =     "J. Symbolic Comput."
+, volume =      7
+, year =        1989
+, pages =       "11--30"
+, keywords =    "locus approach, decomposition, searching, rays, visibility, three-dimensional, polyhedra, polyhedral terrain"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{csy-khrp-84
-, author =	"R. Cole and Micha Sharir and C. K. Yap"
-, title =	"On $k$-hulls and related problems"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"154--166"
-, precedes =	"csy-khrp-87"
-, update =	"98.03 mitchell"
+, author =      "R. Cole and Micha Sharir and C. K. Yap"
+, title =       "On $k$-hulls and related problems"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "154--166"
+, precedes =    "csy-khrp-87"
+, update =      "98.03 mitchell"
 }
 
 @article{csy-khrp-87
-, author =	"R. Cole and Micha Sharir and C. K. Yap"
-, title =	"On $k$-hulls and related problems"
-, journal =	"SIAM J. Comput."
-, volume =	16
-, year =	1987
-, pages =	"61--77"
-, keywords =	"design of algorithms, searching, two-dimensional, three-dimensional"
-, succeeds =	"csy-khrp-84"
-, update =	"98.03 mitchell"
+, author =      "R. Cole and Micha Sharir and C. K. Yap"
+, title =       "On $k$-hulls and related problems"
+, journal =     "SIAM J. Comput."
+, volume =      16
+, year =        1987
+, pages =       "61--77"
+, keywords =    "design of algorithms, searching, two-dimensional, three-dimensional"
+, succeeds =    "csy-khrp-84"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{cs-rreww-83
-, author =	"R. Cole and A. Siegel"
-, title =	"River routing every which way, but loose"
-, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
-, month =	nov
-, year =	1983
-, pages =	"112--121"
-, update =	"98.03 bibrelex"
+, author =      "R. Cole and A. Siegel"
+, title =       "River routing every which way, but loose"
+, booktitle =   "Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
+, month =       nov
+, year =        1983
+, pages =       "112--121"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{cs-rreww-84
-, author =	"R. Cole and A. Siegel"
-, title =	"River routing every which way, but loose"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1984
-, pages =	"65--73"
+, author =      "R. Cole and A. Siegel"
+, title =       "River routing every which way, but loose"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1984
+, pages =       "65--73"
 }
 
 @inproceedings{cv-aepsa-86
-, author =	"R. Cole and U. Vishkin"
-, title =	"Approximate and Exact Parallel Scheduling with Applications to List, Tree, and Graph Problems"
-, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1986
-, pages =	"478--491"
-, update =	"95.01 tamassia"
+, author =      "R. Cole and U. Vishkin"
+, title =       "Approximate and Exact Parallel Scheduling with Applications to List, Tree, and Graph Problems"
+, booktitle =   "Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1986
+, pages =       "478--491"
+, update =      "95.01 tamassia"
 }
 
 @article{cv-apsp1-88
-, author =	"R. Cole and U. Vishkin"
-, title =	"Approximate parallel scheduling, Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, number =	1
-, year =	1988
-, pages =	"128--142"
-, update =	"98.07 bibrelex, 96.09 orourke"
+, author =      "R. Cole and U. Vishkin"
+, title =       "Approximate parallel scheduling, Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, number =      1
+, year =        1988
+, pages =       "128--142"
+, update =      "98.07 bibrelex, 96.09 orourke"
 }
 
 @inproceedings{cv-dctac-86i
-, author =	"R. Cole and U. Vishkin"
-, title =	"Deterministic Coin Tossing and Accelerating Cascades: {Micro} and Macro Techniques for Designing Parallel Algorithms"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"206--219"
-, update =	"98.03 bibrelex"
+, author =      "R. Cole and U. Vishkin"
+, title =       "Deterministic Coin Tossing and Accelerating Cascades: {Micro} and Macro Techniques for Designing Parallel Algorithms"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "206--219"
+, update =      "98.03 bibrelex"
 }
 
 @article{cv-dctao-86
-, author =	"R. Cole and U. Vishkin"
-, title =	"Deterministic coin tossing with applications to optimal list ranking"
-, journal =	"Inform. Control"
-, volume =	1
-, year =	1986
-, pages =	"153--174"
-, update =	"97.11 bibrelex"
+, author =      "R. Cole and U. Vishkin"
+, title =       "Deterministic coin tossing with applications to optimal list ranking"
+, journal =     "Inform. Control"
+, volume =      1
+, year =        1986
+, pages =       "153--174"
+, update =      "97.11 bibrelex"
 }
 
 @article{cv-fopps-89
-, author =	"R. Cole and U. Vishkin"
-, title =	"Faster optimal parallel prefix sums and list ranking"
-, journal =	"Inform. Comput."
-, volume =	81
-, number =	3
-, month =	jun
-, year =	1989
-, pages =	"334--352"
-, update =	"98.07 bibrelex"
+, author =      "R. Cole and U. Vishkin"
+, title =       "Faster optimal parallel prefix sums and list ranking"
+, journal =     "Inform. Comput."
+, volume =      81
+, number =      3
+, month =       jun
+, year =        1989
+, pages =       "334--352"
+, update =      "98.07 bibrelex"
 }
 
 @article{cv-acdto-88
-, author =	"R. Cole and U. Vishkin"
-, title =	"The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time"
-, journal =	"Algorithmica"
-, volume =	3
-, year =	1988
-, pages =	"329--346"
-, update =	"97.11 bibrelex"
+, author =      "R. Cole and U. Vishkin"
+, title =       "The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time"
+, journal =     "Algorithmica"
+, volume =      3
+, year =        1988
+, pages =       "329--346"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{cy-grp-83
-, author =	"R. Cole and C. K. Yap"
-, title =	"Geometric retrieval problems"
-, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1983
-, pages =	"112--121"
-, precedes =	"cy-grp-84"
-, update =	"97.11 bibrelex"
+, author =      "R. Cole and C. K. Yap"
+, title =       "Geometric retrieval problems"
+, booktitle =   "Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1983
+, pages =       "112--121"
+, precedes =    "cy-grp-84"
+, update =      "97.11 bibrelex"
 }
 
 @article{cy-grp-84
-, author =	"R. Cole and C. K. Yap"
-, title =	"Geometric retrieval problems"
-, journal =	"Inform. Control"
-, volume =	63
-, year =	1984
-, pages =	"39--57"
-, keywords =	"locus approach, reporting, subdivisions, points"
-, succeeds =	"cy-grp-83"
-, update =	"97.11 bibrelex"
+, author =      "R. Cole and C. K. Yap"
+, title =       "Geometric retrieval problems"
+, journal =     "Inform. Control"
+, volume =      63
+, year =        1984
+, pages =       "39--57"
+, keywords =    "locus approach, reporting, subdivisions, points"
+, succeeds =    "cy-grp-83"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{cy-sp-83
-, author =	"R. Cole and C.-K. Yap"
-, title =	"Shape from Probing"
-, type =	"Technical {Report}"
-, number =	15
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, month =	dec
-, year =	1983
-, update =	"98.03 bibrelex"
+, author =      "R. Cole and C.-K. Yap"
+, title =       "Shape from Probing"
+, type =        "Technical {Report}"
+, number =      15
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, month =       dec
+, year =        1983
+, update =      "98.03 bibrelex"
 }
 
 @article{cy-sp-87
-, author =	"R. Cole and C. K. Yap"
-, title =	"Shape from probing"
-, journal =	"J. Algorithms"
-, volume =	8
-, number =	1
-, month =	mar
-, year =	1987
-, pages =	"19--38"
-, keywords =	"detection, probing, two-dimensional, worst-case analysis, lower bounds"
-, update =	"98.11 bibrelex"
+, author =      "R. Cole and C. K. Yap"
+, title =       "Shape from probing"
+, journal =     "J. Algorithms"
+, volume =      8
+, number =      1
+, month =       mar
+, year =        1987
+, pages =       "19--38"
+, keywords =    "detection, probing, two-dimensional, worst-case analysis, lower bounds"
+, update =      "98.11 bibrelex"
 }
 
 @article{cz-opabd-90
-, author =	"R. Cole and O. Zajicek"
-, title =	"An optimal parallel algorithm for building a data structure for planar point location"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	8
-, year =	1990
-, pages =	"280--285"
-, update =	"93.05 devillers"
+, author =      "R. Cole and O. Zajicek"
+, title =       "An optimal parallel algorithm for building a data structure for planar point location"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      8
+, year =        1990
+, pages =       "280--285"
+, update =      "93.05 devillers"
 }
 
 @inproceedings{cz-aiapm-89
-, author =	"R. Cole and O. Zajicek"
-, title =	"The {APRAM}: Incorporating asynchrony into the {PRAM} model"
-, booktitle =	"Proc. 1st ACM Sympos. Parallel Algorithms Architect."
-, year =	1989
-, pages =	"169--178"
-, update =	"96.09 orourke"
+, author =      "R. Cole and O. Zajicek"
+, title =       "The {APRAM}: Incorporating asynchrony into the {PRAM} model"
+, booktitle =   "Proc. 1st ACM Sympos. Parallel Algorithms Architect."
+, year =        1989
+, pages =       "169--178"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{cz-eaa-90
-, author =	"R. Cole and O. Zajicek"
-, title =	"The expected advantage of asynchrony"
-, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
-, year =	1990
-, pages =	"85--94"
-, update =	"96.09 orourke"
+, author =      "R. Cole and O. Zajicek"
+, title =       "The expected advantage of asynchrony"
+, booktitle =   "Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
+, year =        1990
+, pages =       "85--94"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{ca-isc-79
-, author =	"G. Coleman and H. Andrews"
-, title =	"Image Segmentation by Clustering"
-, booktitle =	"Proceedings of the IEEE."
-, year =	1979
-, pages =	"773--785"
-, update =	"98.07 agarwal"
+, author =      "G. Coleman and H. Andrews"
+, title =       "Image Segmentation by Clustering"
+, booktitle =   "Proceedings of the IEEE."
+, year =        1979
+, pages =       "773--785"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{cs-psrrs-01
-, author =	"Narcis Coll and Joan Antoni Sellar{\`e}s"
-, title =	"Planar Shape Reconstruction from Random Sections"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"121--124"
-, update =	"01.04 icking"
+, author =      "Narcis Coll and Joan Antoni Sellar{\`e}s"
+, title =       "Planar Shape Reconstruction from Random Sections"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "121--124"
+, update =      "01.04 icking"
 }
 
 @mastersthesis{c-vgump-91
-, author =	"P. Colley"
-, title =	"Visibility graphs of uni-monotone polygons"
-, school =	"Univ. Waterloo"
-, year =	1991
-, keywords =	"master thesis"
-, update =	"98.07 bibrelex"
+, author =      "P. Colley"
+, title =       "Visibility graphs of uni-monotone polygons"
+, school =      "Univ. Waterloo"
+, year =        1991
+, keywords =    "master thesis"
+, update =      "98.07 bibrelex"
 }
 
 @article{cls-vgt-97
-, author =	"P. Colley and A. Lubiw and J. Spinrad"
-, title =	"Visibility graphs of towers"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"161--172"
-, update =	"97.03 devillers"
+, author =      "P. Colley and A. Lubiw and J. Spinrad"
+, title =       "Visibility graphs of towers"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "161--172"
+, update =      "97.03 devillers"
 }
 
 @inproceedings{cmr-mlg-95
-, author =	"Paul Colley and Hank Meijer and David Rappaport"
-, title =	"Motivating Lazy Guards"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"121--126"
-, update =	"95.09 jones"
+, author =      "Paul Colley and Hank Meijer and David Rappaport"
+, title =       "Motivating Lazy Guards"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "121--126"
+, update =      "95.09 jones"
 }
 
 @techreport{cmr-onsps-94t
-, author =	"P. Colley and H. Meijer and D. Rappaport"
-, title =	"Optimal Nearly-Similar Polygon Stabbers of Convex Polygons"
-, type =	"Technical Report"
-, number =	"CISC-94-357"
-, institution =	"Queen's University"
-, year =	1994
-, precedes =	"cmr-onsps-94"
-, update =	"98.11 bibrelex"
+, author =      "P. Colley and H. Meijer and D. Rappaport"
+, title =       "Optimal Nearly-Similar Polygon Stabbers of Convex Polygons"
+, type =        "Technical Report"
+, number =      "CISC-94-357"
+, institution = "Queen's University"
+, year =        1994
+, precedes =    "cmr-onsps-94"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{cmr-onsps-94
-, author =	"P. Colley and H. Meijer and D. Rappaport"
-, title =	"Optimal Nearly-Similar Polygon Stabbers of Convex Polygons"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"269--274"
-, succeeds =	"cmr-onsps-94t"
-, cites =	"ab-eact-87, ad-ahdsp-87, bcetsu-csts-91, mkb-caocp-93, cmr-onsps-94t, e-acg-87, emprww-sls-82, ew-spdtl-89, gpw-gtt-91, mr-mpcpl-90, o-olafs-81, r-mptls-92, aw-plts-88, e-ftssg-85, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "P. Colley and H. Meijer and D. Rappaport"
+, title =       "Optimal Nearly-Similar Polygon Stabbers of Convex Polygons"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "269--274"
+, succeeds =    "cmr-onsps-94t"
+, cites =       "ab-eact-87, ad-ahdsp-87, bcetsu-csts-91, mkb-caocp-93, cmr-onsps-94t, e-acg-87, emprww-sls-82, ew-spdtl-89, gpw-gtt-91, mr-mpcpl-90, o-olafs-81, r-mptls-92, aw-plts-88, e-ftssg-85, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{c-rvgum-92
-, author =	"P. A. Colley"
-, title =	"Recognizing visibility graphs of uni-monotone polygons"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"29--34"
-, cites =	"ae-vgspu-91, aek-rvgsp-91, ahu-daca-74, c-vgump-91, e-vgr-90, ht-dgtc-73, ps-coac-82, o-agta-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. A. Colley"
+, title =       "Recognizing visibility graphs of uni-monotone polygons"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "29--34"
+, cites =       "ae-vgspu-91, aek-rvgsp-91, ahu-daca-74, c-vgump-91, e-vgr-90, ht-dgtc-73, ps-coac-82, o-agta-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{c-cmpr-71
-, author =	"G. Collins"
-, title =	"The Calculation of Multivariate Polynomial Resultants"
-, journal =	"J. ACM"
-, volume =	18
-, number =	4
-, year =	1971
-, pages =	"515--532"
-, update =	"98.03 bibrelex"
+, author =      "G. Collins"
+, title =       "The Calculation of Multivariate Polynomial Resultants"
+, journal =     "J. ACM"
+, volume =      18
+, number =      4
+, year =        1971
+, pages =       "515--532"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{c-qercf-75
-, author =	"G. E. Collins"
-, title =	"Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition"
-, booktitle =	"Proc. 2nd GI Conference on Automata Theory and Formal Languages"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	33
-, publisher =	"Springer-Verlag"
-, year =	1975
-, pages =	"134--183"
-, update =	"99.11 bibrelex, 98.03 bibrelex, 97.03 schwarzkopf, 96.09 agarwal, 93.09 rote"
+, author =      "G. E. Collins"
+, title =       "Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition"
+, booktitle =   "Proc. 2nd GI Conference on Automata Theory and Formal Languages"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      33
+, publisher =   "Springer-Verlag"
+, year =        1975
+, pages =       "134--183"
+, update =      "99.11 bibrelex, 98.03 bibrelex, 97.03 schwarzkopf, 96.09 agarwal, 93.09 rote"
 }
 
 @article{ch-mrsp-74
-, author =	"G. E. Collins and E. Horowitz"
-, title =	"The minimum root separation of a polynomial"
-, journal =	"Math. Comput."
-, volume =	28
-, year =	1974
-, pages =	"589--597"
-, update =	"98.03 bibrelex"
+, author =      "G. E. Collins and E. Horowitz"
+, title =       "The minimum root separation of a polynomial"
+, journal =     "Math. Comput."
+, volume =      28
+, year =        1974
+, pages =       "589--597"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{cl-rzp-82
-, author =	"G. E. Collins and R. Loos"
-, title =	"Real zeros of polynomials"
-, editor =	"B. Buchberger and G. E. Collins and R. Loos"
-, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1982
-, pages =	"83--94"
-, update =	"99.11 bibrelex, 97.11 bibrelex"
+, author =      "G. E. Collins and R. Loos"
+, title =       "Real zeros of polynomials"
+, editor =      "B. Buchberger and G. E. Collins and R. Loos"
+, booktitle =   "Computer Algebra: Symbolic and Algebraic Computation"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1982
+, pages =       "83--94"
+, update =      "99.11 bibrelex, 97.11 bibrelex"
 }
 
 @incollection{crd-isasv-96
-, author =	"C. Colombo and M. Rucci and P. Dario"
-, title =	"Integrating selective attention and space-variant sensing in machine vision"
-, editor =	"J. L. C. Sanz"
-, booktitle =	"Image Technology: Advances in Image Processing, Multimedia and Machine Vision"
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"109--128"
-, update =	"98.07 bibrelex"
+, author =      "C. Colombo and M. Rucci and P. Dario"
+, title =       "Integrating selective attention and space-variant sensing in machine vision"
+, editor =      "J. L. C. Sanz"
+, booktitle =   "Image Technology: Advances in Image Processing, Multimedia and Machine Vision"
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "109--128"
+, update =      "98.07 bibrelex"
 }
 
 @article{c-pditd-68
-, author =	"P. G. Comba"
-, title =	"A procedure for detecting intersections of three-dimensional objects"
-, journal =	"J. ACM"
-, volume =	15
-, year =	1968
-, pages =	"354--366"
+, author =      "P. G. Comba"
+, title =       "A procedure for detecting intersections of three-dimensional objects"
+, journal =     "J. ACM"
+, volume =      15
+, year =        1968
+, pages =       "354--366"
 }
 
 @article{c-ubt-79
-, author =	"D. Comer"
-, title =	"The ubiquitous {B-tree}"
-, journal =	"ACM Comput. Surv."
-, volume =	11
-, year =	1979
-, pages =	"121--137"
-, update =	"95.01 devillers"
+, author =      "D. Comer"
+, title =       "The ubiquitous {B-tree}"
+, journal =     "ACM Comput. Surv."
+, volume =      11
+, year =        1979
+, pages =       "121--137"
+, update =      "95.01 devillers"
 }
 
 @article{co-gpah-82
-, author =	"D. Comer and M. J. O'Donnell"
-, title =	"Geometric problems with applications to hashing"
-, journal =	"SIAM J. Comput."
-, volume =	11
-, year =	1982
-, pages =	"217--226"
+, author =      "D. Comer and M. J. O'Donnell"
+, title =       "Geometric problems with applications to hashing"
+, journal =     "SIAM J. Comput."
+, volume =      11
+, year =        1982
+, pages =       "217--226"
 }
 
 @phdthesis{c-emnr-89
-, author =	"M. A. Conger"
-, title =	"Energy-minimizing networks in {$R^{n}$}"
-, school =	"Williams College"
-, year =	1989
-, note =	"Honors thesis"
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "M. A. Conger"
+, title =       "Energy-minimizing networks in {$R^{n}$}"
+, school =      "Williams College"
+, year =        1989
+, note =        "Honors thesis"
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{c-spdp-90
-, author =	"H. Conn"
-, title =	"Some polygon decomposition problems"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1990
-, keywords =	"doctoral thesis"
-, update =	"96.09 orourke"
+, author =      "H. Conn"
+, title =       "Some polygon decomposition problems"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1990
+, keywords =    "doctoral thesis"
+, update =      "96.09 orourke"
 }
 
 @techreport{co-srrcp-87
-, author =	"H. Conn and J. O'Rourke"
-, title =	"Some restricted rectangle covering problems"
-, type =	"Technical {Report}"
-, number =	"JHU 87-13"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1987
-, keywords =	"covering, rectangles, NP-completeness"
-, precedes =	"co-srrcp-87i"
-, update =	"95.09 korneenko"
+, author =      "H. Conn and J. O'Rourke"
+, title =       "Some restricted rectangle covering problems"
+, type =        "Technical {Report}"
+, number =      "JHU 87-13"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1987
+, keywords =    "covering, rectangles, NP-completeness"
+, precedes =    "co-srrcp-87i"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{co-mwqot-90
-, author =	"H. E. Conn and J. O'Rourke"
-, title =	"Minimum weight quadrilaterization in {$O(n^{3} \log n)$} time"
-, booktitle =	"Proc. 28th Allerton Conf. Commun. Control Comput."
-, month =	oct
-, year =	1990
-, pages =	"788--797"
-, keywords =	"partitioning"
+, author =      "H. E. Conn and J. O'Rourke"
+, title =       "Minimum weight quadrilaterization in {$O(n^{3} \log n)$} time"
+, booktitle =   "Proc. 28th Allerton Conf. Commun. Control Comput."
+, month =       oct
+, year =        1990
+, pages =       "788--797"
+, keywords =    "partitioning"
 }
 
 @inproceedings{co-srrcp-87i
-, author =	"H. E. Conn and J. {O'Rourke}"
-, title =	"Some restricted rectangular covering problems"
-, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
-, year =	1987
-, pages =	"898--907"
-, keywords =	"covering, rectangles, NP-completeness, isothetic"
-, succeeds =	"co-srrcp-87"
-, update =	"95.09 korneenko"
+, author =      "H. E. Conn and J. {O'Rourke}"
+, title =       "Some restricted rectangular covering problems"
+, booktitle =   "Proc. Allerton Conf. Commun. Control Comput."
+, year =        1987
+, pages =       "898--907"
+, keywords =    "covering, rectangles, NP-completeness, isothetic"
+, succeeds =    "co-srrcp-87"
+, update =      "95.09 korneenko"
 }
 
 @article{c-npbct-71
-, author =	"R. Connelly"
-, title =	"A new proof of {Brown}'s Collaring Theorem"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	27
-, year =	1971
-, pages =	"180--182"
-, update =	"97.11 bibrelex"
+, author =      "R. Connelly"
+, title =       "A new proof of {Brown}'s Collaring Theorem"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      27
+, year =        1971
+, pages =       "180--182"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{c-ggr-91
-, author =	"R. Connelly"
-, title =	"On generic global rigidity"
-, editor =	"P. Gritzman and B. Sturmfels"
-, booktitle =	"Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
-, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
-, volume =	4
-, publisher =	"AMS Press"
-, year =	1991
-, pages =	"147--155"
-, keywords =	"geometric graphs, $d$-dimensional, rigidity"
-, update =	"95.09 korneenko"
+, author =      "R. Connelly"
+, title =       "On generic global rigidity"
+, editor =      "P. Gritzman and B. Sturmfels"
+, booktitle =   "Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
+, series =      "DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
+, volume =      4
+, publisher =   "AMS Press"
+, year =        1991
+, pages =       "147--155"
+, keywords =    "geometric graphs, $d$-dimensional, rigidity"
+, update =      "95.09 korneenko"
 }
 
 @article{c-re-82
-, author =	"R. Connelly"
-, title =	"Rigidity and Energy"
-, journal =	"Invent. Math."
-, volume =	66
-, year =	1982
-, pages =	"11--33"
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia"
+, author =      "R. Connelly"
+, title =       "Rigidity and Energy"
+, journal =     "Invent. Math."
+, volume =      66
+, year =        1982
+, pages =       "11--33"
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{cdr-epcbu-00
-, author =	"Robert Connelly and Erik D. Demaine and G{\"u}nter Rote"
-, title =	"Every Polygon Can Be Untangled"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"62--65"
-, update =	"00.03 bibrelex"
+, author =      "Robert Connelly and Erik D. Demaine and G{\"u}nter Rote"
+, title =       "Every Polygon Can Be Untangled"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "62--65"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{cdr-spacp-00
-, author =	"R. Connelly and E. D. Demaine and G. Rote"
-, title =	"Straightening polygonal arcs and convexifying polygonal cycles"
-, booktitle =	"Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS 2000"
-, site =	"Redondo Beach, California"
-, publisher =	"IEEE"
-, month =	nov
-, year =	2000
-, pages =	"432--442"
-, update =	"01.04 orourke+pocchiola"
+, author =      "R. Connelly and E. D. Demaine and G. Rote"
+, title =       "Straightening polygonal arcs and convexifying polygonal cycles"
+, booktitle =   "Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS 2000"
+, site =        "Redondo Beach, California"
+, publisher =   "IEEE"
+, month =       nov
+, year =        2000
+, pages =       "432--442"
+, update =      "01.04 orourke+pocchiola"
 }
 
 @techreport{cf-ctdci-91
-, author =	"R. Connelly and R. Freimer"
-, title =	"Covering a triangle with disks centered on its boundary"
-, type =	"Technical {Report}"
-, number =	"TR~91-1242"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	nov
-, year =	1991
-, keywords =	"covering, disks, triangles"
+, author =      "R. Connelly and R. Freimer"
+, title =       "Covering a triangle with disks centered on its boundary"
+, type =        "Technical {Report}"
+, number =      "TR~91-1242"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       nov
+, year =        1991
+, keywords =    "covering, disks, triangles"
 }
 
 @techreport{cw-sorps-90
-, author =	"R. Connelly and W. Whiteley"
-, title =	"Second-Order Rigidity and Pre-Stress Stability"
-, type =	"Technical {Report}"
-, institution =	"Dept. of Math, Cornell Univ"
-, month =	jan
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "R. Connelly and W. Whiteley"
+, title =       "Second-Order Rigidity and Pre-Stress Stability"
+, type =        "Technical {Report}"
+, institution = "Dept. of Math, Cornell Univ"
+, month =       jan
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @article{c-tr-92
-, author =	"J. F. Connett"
-, title =	"Trapped Reflections?"
-, journal =	"Amer. Math. Monthly"
-, volume =	99
-, year =	1992
-, pages =	"178--179"
-, update =	"01.04 orourke"
+, author =      "J. F. Connett"
+, title =       "Trapped Reflections?"
+, journal =     "Amer. Math. Monthly"
+, volume =      99
+, year =        1992
+, pages =       "178--179"
+, update =      "01.04 orourke"
 }
 
 @article{c-msr-96
-, author =	"M. Connolly"
-, title =	"Molecular surfaces: {A} review"
-, journal =	"Network Science"
-, volume =	"??"
-, year =	1996
-, url =	"http://www.awod.com/netsci/Issues/Apr96/feature1.html"
-, update =	"98.07 bibrelex"
+, author =      "M. Connolly"
+, title =       "Molecular surfaces: {A} review"
+, journal =     "Network Science"
+, volume =      "??"
+, year =        1996
+, url = "http://www.awod.com/netsci/Issues/Apr96/feature1.html"
+, update =      "98.07 bibrelex"
 }
 
 @article{c--85
-, author =	"M. L. Connolly"
-, title =	"??"
-, journal =	"J. Appl. Cryst."
-, volume =	18
-, year =	1985
-, pages =	"499--505"
-, update =	"98.03 bibrelex"
+, author =      "M. L. Connolly"
+, title =       "??"
+, journal =     "J. Appl. Cryst."
+, volume =      18
+, year =        1985
+, pages =       "499--505"
+, update =      "98.03 bibrelex"
 }
 
 @article{c--93
-, author =	"M. L. Connolly"
-, title =	"??"
-, journal =	"J. Mol. Graphics"
-, volume =	11
-, year =	1993
-, pages =	"139--141"
-, update =	"98.03 bibrelex"
+, author =      "M. L. Connolly"
+, title =       "??"
+, journal =     "J. Mol. Graphics"
+, volume =      11
+, year =        1993
+, pages =       "139--141"
+, update =      "98.03 bibrelex"
 }
 
 % ### or is it T. H. Connolly
 @article{c-amsc-83
-, author =	"M. L. Connolly"
-, title =	"Analytical molecular surface calculation"
-, journal =	"J. Appl. Cryst."
-, volume =	16
-, year =	1983
-, pages =	"548--558"
-, update =	"98.03 agarwal+bibrelex"
+, author =      "M. L. Connolly"
+, title =       "Analytical molecular surface calculation"
+, journal =     "J. Appl. Cryst."
+, volume =      16
+, year =        1983
+, pages =       "548--558"
+, update =      "98.03 agarwal+bibrelex"
 }
 
 @article{c-saspn-83
-, author =	"M. L. Connolly"
-, title =	"Solvent-accessible surfaces of proteins and nucleic acids"
-, journal =	"Science"
-, volume =	221
-, year =	1983
-, pages =	"709--713"
-, update =	"98.03 bibrelex"
+, author =      "M. L. Connolly"
+, title =       "Solvent-accessible surfaces of proteins and nucleic acids"
+, journal =     "Science"
+, volume =      221
+, year =        1983
+, pages =       "709--713"
+, update =      "98.03 bibrelex"
 }
 
 @article{c-mis-91
-, author =	"T. H. Connolly"
-, title =	"Molecular interstitial skeleton"
-, journal =	"Computer Chem."
-, volume =	15
-, year =	1991
-, pages =	"37--45"
-, update =	"98.03 agarwal"
+, author =      "T. H. Connolly"
+, title =       "Molecular interstitial skeleton"
+, journal =     "Computer Chem."
+, volume =      15
+, year =        1991
+, pages =       "37--45"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{c-lct-95
-, author =	"Joel Conraud"
-, title =	"Lazy Constrained Tetrahedralization"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"15--27"
-, update =	"96.01 samitchell"
+, author =      "Joel Conraud"
+, title =       "Lazy Constrained Tetrahedralization"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "15--27"
+, update =      "96.01 samitchell"
 }
 
 @article{cehmnrv-aahvs-94
-, author =	"M. P. Consens and F. C. Eigler and M. Z. Hasan and A. O. Mendelzon and E. G. Noik and A. G. Ryman and D. Vista"
-, title =	"Architecture and Applications of the {HY+} Visualization System"
-, journal =	"IBM Syst. J."
-, volume =	33
-, year =	1994
-, pages =	"458--476"
-, keywords =	"graph drawing, system"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "M. P. Consens and F. C. Eigler and M. Z. Hasan and A. O. Mendelzon and E. G. Noik and A. G. Ryman and D. Vista"
+, title =       "Architecture and Applications of the {HY+} Visualization System"
+, journal =     "IBM Syst. J."
+, volume =      33
+, year =        1994
+, pages =       "458--476"
+, keywords =    "graph drawing, system"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @inproceedings{cmr-vqss-92
-, author =	"M. P. Consens and A. O. Mendelzon and A. G. Ryman"
-, title =	"Visualizing and Querying Software Structures"
-, booktitle =	"Proc. 14th Intl. Conference on Software Engineering"
-, year =	1992
-, pages =	"138--156"
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "M. P. Consens and A. O. Mendelzon and A. G. Ryman"
+, title =       "Visualizing and Querying Software Structures"
+, booktitle =   "Proc. 14th Intl. Conference on Software Engineering"
+, year =        1992
+, pages =       "138--156"
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @book{cb-enaaa-80
-, author =	"S. D. Conte and C. de Boor"
-, title =	"Elementary Numerical Analysis: An Algorithmic Approach"
-, edition =	"3rd"
-, publisher =	"McGraw-Hill"
-, address =	"New York"
-, year =	1980
-, update =	"96.09 orourke"
+, author =      "S. D. Conte and C. de Boor"
+, title =       "Elementary Numerical Analysis: An Algorithmic Approach"
+, edition =     "3rd"
+, publisher =   "McGraw-Hill"
+, address =     "New York"
+, year =        1980
+, update =      "96.09 orourke"
 }
 
 @article{chs-plppgs-96
-, author =	"J. H. Conway and R. H. Hardin and N. J. A. Sloane"
-, title =	"Packing lines, planes, etc.: {Packings} in {Grassmannian} spaces"
-, journal =	"Experimental Math."
-, volume =	5
-, year =	1996
-, pages =	"139--159"
-, update =	"97.07 orourke"
+, author =      "J. H. Conway and R. H. Hardin and N. J. A. Sloane"
+, title =       "Packing lines, planes, etc.: {Packings} in {Grassmannian} spaces"
+, journal =     "Experimental Math."
+, volume =      5
+, year =        1996
+, pages =       "139--159"
+, update =      "97.07 orourke"
 }
 
 @book{cs-splg-88
-, author =	"J. H. Conway and N. J. A. Sloane"
-, title =	"Sphere Packings, Lattices and Groups"
-, edition =	"1st"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "J. H. Conway and N. J. A. Sloane"
+, title =       "Sphere Packings, Lattices and Groups"
+, edition =     "1st"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @book{cs-splg-93
-, author =	"J. H. Conway and N. J. A. Sloane"
-, title =	"Sphere Packings, Lattices and Groups"
-, edition =	"2nd"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1993
-, update =	"97.11 bibrelex, 97.07 orourke"
+, author =      "J. H. Conway and N. J. A. Sloane"
+, title =       "Sphere Packings, Lattices and Groups"
+, edition =     "2nd"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1993
+, update =      "97.11 bibrelex, 97.07 orourke"
 }
 
 @article{cclbwfodbt-avebp-80
-, author =	"L. T. Cook and P. N. Cook and K. R. Lee and S. Batnitzky and B. Y. S. Wong and S. L. Fritz and J. Ophir and S. J. {Dwyer, III} and L. R. Bigongiari and A. W. Tempelton"
-, title =	"An algorithm for volume estimation based on polyhedral approximation"
-, journal =	"IEEE Trans. Biomedical Engineering"
-, volume =	27
-, year =	1980
-, pages =	"493--500"
-, update =	"98.03 bibrelex"
+, author =      "L. T. Cook and P. N. Cook and K. R. Lee and S. Batnitzky and B. Y. S. Wong and S. L. Fritz and J. Ophir and S. J. {Dwyer, III} and L. R. Bigongiari and A. W. Tempelton"
+, title =       "An algorithm for volume estimation based on polyhedral approximation"
+, journal =     "IEEE Trans. Biomedical Engineering"
+, volume =      27
+, year =        1980
+, pages =       "493--500"
+, update =      "98.03 bibrelex"
 }
 
 @article{c-sscg-86
-, author =	"R. L. Cook"
-, title =	"Stochastic sampling in computer graphics"
-, journal =	"ACM Trans. Grpah."
-, volume =	5
-, year =	1986
-, pages =	"51--72"
-, update =	"98.03 bibrelex"
+, author =      "R. L. Cook"
+, title =       "Stochastic sampling in computer graphics"
+, journal =     "ACM Trans. Grpah."
+, volume =      5
+, year =        1986
+, pages =       "51--72"
+, update =      "98.03 bibrelex"
 }
 
 @article{cpc-drt-84
-, author =	"R. L. Cook and T. Porter and L. Carpenter"
-, title =	"Distributed ray tracing"
-, journal =	"Comput. Graph."
-, volume =	18
-, year =	1984
-, pages =	"137--145"
-, update =	"98.03 bibrelex"
+, author =      "R. L. Cook and T. Porter and L. Carpenter"
+, title =       "Distributed ray tracing"
+, journal =     "Comput. Graph."
+, volume =      18
+, year =        1984
+, pages =       "137--145"
+, update =      "98.03 bibrelex"
 }
 
 @article{cdr-ultbp-86
-, author =	"S. A. Cook and C. Dwork and R. Reischuk"
-, title =	"Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"87--97"
-, update =	"96.09 orourke"
+, author =      "S. A. Cook and C. Dwork and R. Reischuk"
+, title =       "Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "87--97"
+, update =      "96.09 orourke"
 }
 
 @article{chkm-ipp-92
-, author =	"W. Cook and M. Hartman and R. Kannan and C. McDiarmid"
-, title =	"On integer points in polyhedra"
-, journal =	"Combinatorica"
-, volume =	12
-, year =	1992
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "W. Cook and M. Hartman and R. Kannan and C. McDiarmid"
+, title =       "On integer points in polyhedra"
+, journal =     "Combinatorica"
+, volume =      12
+, year =        1992
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @techreport{crss-igbra-91
-, author =	"W. Cook and T. Rugherford and H. E. Scarf and D. Shallcross"
-, title =	"An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming"
-, number =	990
-, institution =	"Yale University"
-, month =	aug
-, year =	1991
-, note =	"Cowles Foundation Discussion Paper"
-, update =	"98.11 bibrelex"
+, author =      "W. Cook and T. Rugherford and H. E. Scarf and D. Shallcross"
+, title =       "An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming"
+, number =      990
+, institution = "Yale University"
+, month =       aug
+, year =        1991
+, note =        "Cowles Foundation Discussion Paper"
+, update =      "98.11 bibrelex"
 }
 
 @book{cf-hcc-67
-, author =	"G. E. Cooke and R. L. Finney"
-, title =	"Homology of cell complexes"
-, publisher =	"Princeton University Press"
-, year =	1967
-, update =	"98.03 bibrelex"
+, author =      "G. E. Cooke and R. L. Finney"
+, title =       "Homology of cell complexes"
+, publisher =   "Princeton University Press"
+, year =        1967
+, update =      "98.03 bibrelex"
 }
 
 @techreport{c-scads-67
-, author =	"S. A. Coons"
-, title =	"Surfaces for Computer Aided Design of Space Forms"
-, type =	"Technical {Report}"
-, number =	"MAC-TR-41"
-, institution =	"Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, month =	jun
-, year =	1967
-, update =	"98.03 bibrelex"
+, author =      "S. A. Coons"
+, title =       "Surfaces for Computer Aided Design of Space Forms"
+, type =        "Technical {Report}"
+, number =      "MAC-TR-41"
+, institution = "Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, month =       jun
+, year =        1967
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ct-stcos-96
-, author =	"S. Coorg and S. Teller"
-, title =	"A Spatially and Temporally Coherent Object Space Visibility Algorithm"
-, number =	"TM-546"
-, institution =	"Laboratory of Computer Science, MIT"
-, year =	1996
-, update =	"97.11 bibrelex"
+, author =      "S. Coorg and S. Teller"
+, title =       "A Spatially and Temporally Coherent Object Space Visibility Algorithm"
+, number =      "TM-546"
+, institution = "Laboratory of Computer Science, MIT"
+, year =        1996
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ct-rtocm-97
-, author =	"S. Coorg and S. Teller"
-, title =	"Real-time occlusion culling for models with large occluders"
-, booktitle =	"Proc. 1997 Sympos. Interactive 3D Graphics"
-, year =	1997
-, update =	"98.07 bibrelex"
+, author =      "S. Coorg and S. Teller"
+, title =       "Real-time occlusion culling for models with large occluders"
+, booktitle =   "Proc. 1997 Sympos. Interactive 3D Graphics"
+, year =        1997
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ct-tccv-96
-, author =	"Satyan Coorg and Seth Teller"
-, title =	"Temporally Coherent Conservative Visibility"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"78--87"
-, update =	"96.05 efrat"
+, author =      "Satyan Coorg and Seth Teller"
+, title =       "Temporally Coherent Conservative Visibility"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "78--87"
+, update =      "96.05 efrat"
 }
 
 @article{clw-epnib-79
-, author =	"D. Coppersmith and D. T. Lee and C. K. Wong"
-, title =	"An elementary proof of nonexistence of isometries between {$L_p$} and {$L_q$}"
-, journal =	"IBM J. Res. Develop."
-, volume =	23
-, number =	6
-, year =	1979
-, pages =	"696--699"
-, keywords =	"$L_p$-metric"
-, update =	"99.03 bibrelex, 95.09 korneenko"
+, author =      "D. Coppersmith and D. T. Lee and C. K. Wong"
+, title =       "An elementary proof of nonexistence of isometries between {$L_p$} and {$L_q$}"
+, journal =     "IBM J. Res. Develop."
+, volume =      23
+, number =      6
+, year =        1979
+, pages =       "696--699"
+, keywords =    "$L_p$-metric"
+, update =      "99.03 bibrelex, 95.09 korneenko"
 }
 
 @inproceedings{cw-mmap-87
-, author =	"D. Coppersmith and S. Winograd"
-, title =	"Matrix multiplication via arithmetic progressions"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Theory Comput."
-, year =	1987
-, pages =	"1--6"
-, update =	"97.11 bibrelex"
+, author =      "D. Coppersmith and S. Winograd"
+, title =       "Matrix multiplication via arithmetic progressions"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Theory Comput."
+, year =        1987
+, pages =       "1--6"
+, update =      "97.11 bibrelex"
 }
 
 @article{cw-mmap-90
-, author =	"D. Coppersmith and S. Winograd"
-, title =	"Matrix multiplication via arithmetic progressions"
-, journal =	"J. Symbolic Comput."
-, volume =	9
-, year =	1990
-, pages =	"251--280"
-, update =	"97.11 bibrelex"
+, author =      "D. Coppersmith and S. Winograd"
+, title =       "Matrix multiplication via arithmetic progressions"
+, journal =     "J. Symbolic Comput."
+, volume =      9
+, year =        1990
+, pages =       "251--280"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{cn-ifvda-85
-, author =	"A. J. Coppola and J. Nave"
-, title =	"Implementing a fast {Voronoi} diagram algorithm for theoretical experimentation"
-, type =	"Report"
-, number =	"??"
-, institution =	"Intel Corporation"
-, address =	"Hillsboro, NJ"
-, year =	1985
+, author =      "A. J. Coppola and J. Nave"
+, title =       "Implementing a fast {Voronoi} diagram algorithm for theoretical experimentation"
+, type =        "Report"
+, number =      "??"
+, institution = "Intel Corporation"
+, address =     "Hillsboro, NJ"
+, year =        1985
 }
 
 @inproceedings{cmr-avdsc-93
-, author =	"A. G. Corbalan and Marisa Mazon and Tomas Recio"
-, title =	"About {Voronoi} Diagrams For Strictly Convex Distances"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"17--22"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "A. G. Corbalan and Marisa Mazon and Tomas Recio"
+, title =       "About {Voronoi} Diagrams For Strictly Convex Distances"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "17--22"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @article{cmr-gbscd-96
-, author =	"A. G. Corbalan and M. Mazon and T. Recio"
-, title =	"Geometry of bisectors for strictly convex distances"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"45--58"
-, update =	"96.09 devillers"
+, author =      "A. G. Corbalan and M. Mazon and T. Recio"
+, title =       "Geometry of bisectors for strictly convex distances"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "45--58"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{cmrs-tspvd-93
-, author =	"A. G. Corbalan and M. Mazon and T. Recio and F. Santos"
-, title =	"On the topological shape of planar {Voronoi} diagrams"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"109--115"
-, cites =	"cmrs-tspvd-93c, ab-rdt-85, ab-gdt-86, cd-vdbcd-85, gs-pmgsc-85, k-cavd-89, k-tvs1-69, l-tdvdl-80, m-ddvec-92, ZZZ"
-, update =	"00.03 bibrelex, 98.03 bibrelex, 97.11 icking, 93.09 jones"
+, author =      "A. G. Corbalan and M. Mazon and T. Recio and F. Santos"
+, title =       "On the topological shape of planar {Voronoi} diagrams"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "109--115"
+, cites =       "cmrs-tspvd-93c, ab-rdt-85, ab-gdt-86, cd-vdbcd-85, gs-pmgsc-85, k-cavd-89, k-tvs1-69, l-tdvdl-80, m-ddvec-92, ZZZ"
+, update =      "00.03 bibrelex, 98.03 bibrelex, 97.11 icking, 93.09 jones"
 }
 
 @inproceedings{cmrs-tspvd-93c
-, author =	"A. G. Corbalan and Marisa Mazon and Tomas Recio and Francisco Santos"
-, title =	"On The Topological Shape Of Planar {Voronoi} Diagrams"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"23--25"
-, precedes =	"cmrs-tspvd-93"
-, cites =	"ab-rdt-85, ab-gdt-86, cd-vdbcd-85, gs-pmgsc-85, k-cavd-89, k-tvs1-69, l-tdvdl-80, m-ddvec-92, ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 98.03 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "A. G. Corbalan and Marisa Mazon and Tomas Recio and Francisco Santos"
+, title =       "On The Topological Shape Of Planar {Voronoi} Diagrams"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "23--25"
+, precedes =    "cmrs-tspvd-93"
+, cites =       "ab-rdt-85, ab-gdt-86, cd-vdbcd-85, gs-pmgsc-85, k-cavd-89, k-tvs1-69, l-tdvdl-80, m-ddvec-92, ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 98.03 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @techreport{c-tpc-79
-, author =	"J. Corbett"
-, title =	"Topological Principles in Cartography"
-, type =	"Technical {Paper}"
-, number =	48
-, institution =	"Bureau of the Census"
-, address =	"Washington, DC"
-, year =	1979
-, update =	"98.03 bibrelex"
+, author =      "J. Corbett"
+, title =       "Topological Principles in Cartography"
+, type =        "Technical {Paper}"
+, number =      48
+, institution = "Bureau of the Census"
+, address =     "Washington, DC"
+, year =        1979
+, update =      "98.03 bibrelex"
 }
 
 @article{cd-oapa-85
-, author =	"L. P. Cordella and G. Dettori"
-, title =	"An ${O}(n)$ algorithm for polygonal approximation"
-, journal =	"Pattern Recogn. Lett."
-, volume =	3
-, number =	2
-, year =	1985
-, pages =	"93--97"
-, keywords =	"polygon, fitting"
-, update =	"95.09 korneenko"
+, author =      "L. P. Cordella and G. Dettori"
+, title =       "An ${O}(n)$ algorithm for polygonal approximation"
+, journal =     "Pattern Recogn. Lett."
+, volume =      3
+, number =      2
+, year =        1985
+, pages =       "93--97"
+, keywords =    "polygon, fitting"
+, update =      "95.09 korneenko"
 }
 
 @article{cr-lpvgf-86
-, author =	"C. Cordes and K. B. Reid"
-, title =	"Largest polygons with vertices in a given finite set"
-, journal =	"Discrete Appl. Math."
-, volume =	14
-, number =	3
-, year =	1986
-, pages =	"255--262"
-, keywords =	"extremal figures, polygon, points"
-, update =	"95.09 korneenko"
+, author =      "C. Cordes and K. B. Reid"
+, title =       "Largest polygons with vertices in a given finite set"
+, journal =     "Discrete Appl. Math."
+, volume =      14
+, number =      3
+, year =        1986
+, pages =       "255--262"
+, keywords =    "extremal figures, polygon, points"
+, update =      "95.09 korneenko"
 }
 
 @article{c-omgs-83
-, author =	"R. Cordovil"
-, title =	"Oriented matroids and geometric sorting"
-, journal =	"Canad. Math. Bull."
-, volume =	26
-, number =	3
-, year =	1983
-, pages =	"51--354"
-, keywords =	"sorting, oriented matroids"
-, update =	"95.09 korneenko"
+, author =      "R. Cordovil"
+, title =       "Oriented matroids and geometric sorting"
+, journal =     "Canad. Math. Bull."
+, volume =      26
+, number =      3
+, year =        1983
+, pages =       "51--354"
+, keywords =    "sorting, oriented matroids"
+, update =      "95.09 korneenko"
 }
 
 @article{c-sutds-82
-, author =	"R. Cordovil"
-, title =	"Sur un th{\'e}oreme de s{\'e}paration des matroides orient{\'e}s de rang trois"
-, journal =	"Discrete Math."
-, volume =	40
-, year =	1982
-, pages =	"163--169"
-, update =	"97.11 bibrelex"
+, author =      "R. Cordovil"
+, title =       "Sur un th{\'e}oreme de s{\'e}paration des matroides orient{\'e}s de rang trois"
+, journal =     "Discrete Math."
+, volume =      40
+, year =        1982
+, pages =       "163--169"
+, update =      "97.11 bibrelex"
 }
 
 @article{c-ddnpp-83
-, author =	"R. Cordovil"
-, title =	"The directions determined by $n$ points in the plane: a matroidal generalization"
-, journal =	"Discrete Math."
-, volume =	43
-, year =	1983
-, pages =	"131--137"
-, update =	"97.11 bibrelex"
+, author =      "R. Cordovil"
+, title =       "The directions determined by $n$ points in the plane: a matroidal generalization"
+, journal =     "Discrete Math."
+, volume =      43
+, year =        1983
+, pages =       "131--137"
+, update =      "97.11 bibrelex"
 }
 
 @article{cdc-poaca-86
-, author =	"R. Cordovil and R. Dil{\~a}o and A. N. da Costa"
-, title =	"Periodic orbits for additive cellular automata"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"277--288"
+, author =      "R. Cordovil and R. Dil{\~a}o and A. N. da Costa"
+, title =       "Periodic orbits for additive cellular automata"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "277--288"
 }
 
 @article{clm-ermfm-82
-, author =	"R. Cordovil and M. {Las Vergnas} and A. Mandel"
-, title =	"Euler's relation, {M{\"o}bius} functions, and matroid identities"
-, journal =	"Geom. Dedicata"
-, volume =	12
-, year =	1982
-, pages =	"147--162"
+, author =      "R. Cordovil and M. {Las Vergnas} and A. Mandel"
+, title =       "Euler's relation, {M{\"o}bius} functions, and matroid identities"
+, journal =     "Geom. Dedicata"
+, volume =      12
+, year =        1982
+, pages =       "147--162"
 }
 
 @article{c-ucplg-75
-, author =	"R. Cori"
-, title =	"Un code pour les graphes planaires et ses applications"
-, journal =	"Ast{\'e}risque"
-, volume =	27
-, year =	1975
-, update =	"98.07 bibrelex"
+, author =      "R. Cori"
+, title =       "Un code pour les graphes planaires et ses applications"
+, journal =     "Ast{\'e}risque"
+, volume =      27
+, year =        1975
+, update =      "98.07 bibrelex"
 }
 
 @misc{cw-pi-90
-, author =	"B. T. Corkum and J. A. Wyllie"
-, title =	"Program for insidepolytope"
-, howpublished =	"Newsgroup comp.graphics"
-, year =	1990
-, note =	"Message 1990{O}ct3.121706.11932
-		 jarvis.csri.toronto.edu"
-, update =	"98.11 bibrelex"
+, author =      "B. T. Corkum and J. A. Wyllie"
+, title =       "Program for insidepolytope"
+, howpublished =        "Newsgroup comp.graphics"
+, year =        1990
+, note =        "Message 1990{O}ct3.121706.11932
+                 jarvis.csri.toronto.edu"
+, update =      "98.11 bibrelex"
 }
 
 @article{cghj-lwfm-93
-, author =	"Robert M. Corless and Gaston H. Gonnet and D. E. G. Hare and David J. Jeffrey"
-, title =	"{Lambert's} {W} function in {Maple}"
-, journal =	"The Maple Techical Newsletter"
-, volume =	"Issue 9"
-, year =	1993
-, pages =	"12--22"
-, update =	"00.03 bibrelex"
+, author =      "Robert M. Corless and Gaston H. Gonnet and D. E. G. Hare and David J. Jeffrey"
+, title =       "{Lambert's} {W} function in {Maple}"
+, journal =     "The Maple Techical Newsletter"
+, volume =      "Issue 9"
+, year =        1993
+, pages =       "12--22"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{c-atbpb-93
-, author =	"T. H. Cormen"
-, title =	"Asymptotically Tight Bounds for Performing {BMMC} Permutations on Parallel Disk Systems"
-, booktitle =	"Proc. 5th ACM Sympos. Parallel Algorithms Architect."
-, year =	1993
-, pages =	"130--139"
-, update =	"96.09 orourke"
+, author =      "T. H. Cormen"
+, title =       "Asymptotically Tight Bounds for Performing {BMMC} Permutations on Parallel Disk Systems"
+, booktitle =   "Proc. 5th ACM Sympos. Parallel Algorithms Architect."
+, year =        1993
+, pages =       "130--139"
+, update =      "96.09 orourke"
 }
 
 @article{c-fpda-93
-, author =	"T. H. Cormen"
-, title =	"Fast Permuting on Disk Arrays"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	17
-, year =	1993
-, pages =	"41--57"
-, update =	"96.09 orourke"
+, author =      "T. H. Cormen"
+, title =       "Fast Permuting on Disk Arrays"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      17
+, year =        1993
+, pages =       "41--57"
+, update =      "96.09 orourke"
 }
 
 @book{clr-ia-90
-, author =	"T. H. Cormen and C. E. Leiserson and R. L. Rivest"
-, title =	"Introduction to Algorithms"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1990
-, update =	"97.03 schwarzkopf, 93.09 tamassia"
+, author =      "T. H. Cormen and C. E. Leiserson and R. L. Rivest"
+, title =       "Introduction to Algorithms"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1990
+, update =      "97.03 schwarzkopf, 93.09 tamassia"
 }
 
 @book{clrs-ia-01
-, author =	"T. H. Cormen and C. E. Leiserson and R. L. Rivest and C. Stein", title = "Introduction to Algorithms"
-, edition =	"2nd"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	2001
-, update =	"01.11 smid"
+, author =      "T. H. Cormen and C. E. Leiserson and R. L. Rivest and C. Stein", title = "Introduction to Algorithms"
+, edition =     "2nd"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        2001
+, update =      "01.11 smid"
 }
 
 @article{cn-tbcts-78
-, author =	"G. Cornuejol and G. L. Nemhauser"
-, title =	"Tight bounds for {Christofides}' traveling salesman heuristic"
-, journal =	"Math. Program."
-, volume =	14
-, year =	1978
-, pages =	"116--121"
+, author =      "G. Cornuejol and G. L. Nemhauser"
+, title =       "Tight bounds for {Christofides}' traveling salesman heuristic"
+, journal =     "Math. Program."
+, volume =      14
+, year =        1978
+, pages =       "116--121"
 }
 
 @article{c-vdabt-22
-, author =	"J. G. von der Corput"
-, title =	"Versch{\"a}rfung der {Absch{\"a}tzung} beim {Teilerproblem}"
-, journal =	"Math. Annalen"
-, volume =	87
-, year =	1922
-, pages =	"39--65"
-, update =	"97.11 bibrelex"
+, author =      "J. G. von der Corput"
+, title =       "Versch{\"a}rfung der {Absch{\"a}tzung} beim {Teilerproblem}"
+, journal =     "Math. Annalen"
+, volume =      87
+, year =        1922
+, pages =       "39--65"
+, update =      "97.11 bibrelex"
 }
 
 @article{cc-fcdt-87
-, author =	"Y. Correc and E. Chapuis"
-, title =	"Fast Computation of {Delaunay} Triangulations"
-, journal =	"Adv. Eng. Softw."
-, volume =	9
-, number =	2
-, year =	1987
-, pages =	"77--83"
-, annote =	"Claims $O(n \log n)$ measured performance. Points are
-		 sorted by one coordinate and a Lawson style incremental
-		 algorithm is used. Triangle list is maintained in
-		 sorted by one coordinate of barycentre."
+, author =      "Y. Correc and E. Chapuis"
+, title =       "Fast Computation of {Delaunay} Triangulations"
+, journal =     "Adv. Eng. Softw."
+, volume =      9
+, number =      2
+, year =        1987
+, pages =       "77--83"
+, annote =      "Claims $O(n \log n)$ measured performance. Points are
+                 sorted by one coordinate and a Lawson style incremental
+                 algorithm is used. Triangle list is maintained in
+                 sorted by one coordinate of barycentre."
 }
 
 @inproceedings{cghmsv-ttpnp-01
-, author =	"Carmen Cort{\'e}s and Clara I. Grima and Ferran Hurtado and Alberto M{\'a}rquez and Francisco Santos and Jes{\'u}s Valenzuela"
-, title =	"Transforming Triangulations of Polygons on Non Planar Surfaces"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"31--34"
-, update =	"01.04 icking"
+, author =      "Carmen Cort{\'e}s and Clara I. Grima and Ferran Hurtado and Alberto M{\'a}rquez and Francisco Santos and Jes{\'u}s Valenzuela"
+, title =       "Transforming Triangulations of Polygons on Non Planar Surfaces"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "31--34"
+, update =      "01.04 icking"
 }
 
 @inproceedings{cgm-fetc-99
-, author =	"Carmen Cort{\'e}s and Clara I. Grima and Alberto M{\'a}rquez"
-, title =	"Flipping Edges in Triangulations on the Cylinder"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"77--79"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Carmen Cort{\'e}s and Clara I. Grima and Alberto M{\'a}rquez"
+, title =       "Flipping Edges in Triangulations on the Cylinder"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "77--79"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{chmn-efts-98
-, author =	"C. Cort{\'e}s and F. Hurtado and A. M{\'a}rquez and A. Nakamoto"
-, title =	"Edge Flipping on Triangulations of Surfaces"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"59--60"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "C. Cort{\'e}s and F. Hurtado and A. M{\'a}rquez and A. Nakamoto"
+, title =       "Edge Flipping on Triangulations of Surfaces"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "59--60"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{cj-ffdgt-85
-, author =	"M. Corthout and H. Jonkers"
-, title =	"A formal framework for discrete geometry: theory and graphics applications"
-, type =	"Report"
-, number =	"??"
-, institution =	"Philips Lab."
-, address =	"Briarcliff Manor, NY"
-, year =	1985
+, author =      "M. Corthout and H. Jonkers"
+, title =       "A formal framework for discrete geometry: theory and graphics applications"
+, type =        "Report"
+, number =      "??"
+, institution = "Philips Lab."
+, address =     "Briarcliff Manor, NY"
+, year =        1985
 }
 
 @article{cj-tdnpc-86
-, author =	"M. E. Corthout and H. B. M. Jonkers"
-, title =	"The transformational development of a new point containment algorithm"
-, journal =	"Philips J. Res. Devel."
-, volume =	41
-, year =	1986
-, pages =	"83--174"
-, keywords =	"point location"
-, update =	"95.09 korneenko"
+, author =      "M. E. Corthout and H. B. M. Jonkers"
+, title =       "The transformational development of a new point containment algorithm"
+, journal =     "Philips J. Res. Devel."
+, volume =      41
+, year =        1986
+, pages =       "83--174"
+, keywords =    "point location"
+, update =      "95.09 korneenko"
 }
 
 @incollection{c-vfgf-89
-, author =	"D. Cortolezzis"
-, title =	"The virtual floating grid file"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	381
-, year =	1989
-, pages =	"116--127"
-, keywords =	"data structuring"
-, update =	"95.09 korneenko"
+, author =      "D. Cortolezzis"
+, title =       "The virtual floating grid file"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      381
+, year =        1989
+, pages =       "116--127"
+, keywords =    "data structuring"
+, update =      "95.09 korneenko"
 }
 
 @article{cdf-csxy-89
-, author =	"M. Cosnard and J. Duprat and A. G. Ferreira"
-, title =	"Complexity of selection in $X+Y$"
-, journal =	"Theoret. Comput. Sci."
-, volume =	67
-, number =	1
-, year =	1989
-, pages =	"115--120"
-, keywords =	"lower bounds, searching"
-, update =	"95.09 korneenko"
+, author =      "M. Cosnard and J. Duprat and A. G. Ferreira"
+, title =       "Complexity of selection in $X+Y$"
+, journal =     "Theoret. Comput. Sci."
+, volume =      67
+, number =      1
+, year =        1989
+, pages =       "115--120"
+, keywords =    "lower bounds, searching"
+, update =      "95.09 korneenko"
 }
 
 @article{cdf-csxyo-90
-, author =	"M. Cosnard and J. Duprat and A. G. Ferreira"
-, title =	"The complexity of searching in $X+Y$ and other multisets"
-, journal =	"Inform. Process. Lett."
-, volume =	34
-, number =	2
-, year =	1990
-, pages =	"103--109"
-, keywords =	"lower bounds, searching"
-, update =	"95.09 korneenko"
+, author =      "M. Cosnard and J. Duprat and A. G. Ferreira"
+, title =       "The complexity of searching in $X+Y$ and other multisets"
+, journal =     "Inform. Process. Lett."
+, volume =      34
+, number =      2
+, year =        1990
+, pages =       "103--109"
+, keywords =    "lower bounds, searching"
+, update =      "95.09 korneenko"
 }
 
 @article{cr-tlcra-88
-, author =	"M. Cost and M. F. Roy"
-, title =	"Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets"
-, journal =	"J. Symbolic Comput."
-, volume =	5
-, year =	1988
-, pages =	"121--129"
-, update =	"98.03 bibrelex"
+, author =      "M. Cost and M. F. Roy"
+, title =       "Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets"
+, journal =     "J. Symbolic Comput."
+, volume =      5
+, year =        1988
+, pages =       "121--129"
+, update =      "98.03 bibrelex"
 }
 
 @article{cs-wnnal-93
-, author =	"S. Cost and S. Salzberg"
-, title =	"A weighted nearest neighbor algorithm for learning with symbolic features"
-, journal =	"Machine Learning"
-, volume =	10
-, year =	1993
-, pages =	"57--67"
-, update =	"97.07 agarwal"
+, author =      "S. Cost and S. Salzberg"
+, title =       "A weighted nearest neighbor algorithm for learning with symbolic features"
+, journal =     "Machine Learning"
+, volume =      10
+, year =        1993
+, pages =       "57--67"
+, update =      "97.07 agarwal"
 }
 
 @incollection{c-esg-89
-, author =	"M. Coste"
-, title =	"Effective semialgebraic geometry"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	391
-, year =	1989
-, pages =	"1--27"
-, keywords =	"algebraic geometry, motion planning"
-, update =	"95.09 korneenko"
+, author =      "M. Coste"
+, title =       "Effective semialgebraic geometry"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      391
+, year =        1989
+, pages =       "1--27"
+, keywords =    "algebraic geometry, motion planning"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{cs-smuvi-96
-, author =	"H. L. de Cougny and M. S. Shephard"
-, title =	"Surface meshing using vertex insertion"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"243--256"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "H. L. de Cougny and M. S. Shephard"
+, title =       "Surface meshing using vertex insertion"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "243--256"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @inproceedings{cl-dvg-91
-, author =	"C. Coullard and A. Lubiw"
-, title =	"Distance visibility graphs"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"289--296"
-, keywords =	"visibility, geometric graphs"
-, cites =	"acp-cfekt-87, ap-crp3t-86, c-tsplt-90i, ec-rvgsp-90, e-hdpa-85, g-rcvgs-88, h-fvgsp-87, ht-dgtc-73, o-agta-87, o-rcvg-90, ow-nmcvg-88, ps-cgi-85, rs-gm2aa-86, s-tpgep-80, t-ktgtc-89, ty-sltat-84, y-edp-81, y-stapl-79, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "C. Coullard and A. Lubiw"
+, title =       "Distance visibility graphs"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "289--296"
+, keywords =    "visibility, geometric graphs"
+, cites =       "acp-cfekt-87, ap-crp3t-86, c-tsplt-90i, ec-rvgsp-90, e-hdpa-85, g-rcvgs-88, h-fvgsp-87, ht-dgtc-73, o-agta-87, o-rcvg-90, ow-nmcvg-88, ps-cgi-85, rs-gm2aa-86, s-tpgep-80, t-ktgtc-89, ty-sltat-84, y-edp-81, y-stapl-79, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{cl-dvg-92
-, author =	"C. Coullard and A. Lubiw"
-, title =	"Distance visibility graphs"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	4
-, year =	1992
-, pages =	"349--362"
-, keywords =	"visibility, geometric graphs"
-, succeeds =	"cl-dvg-91"
-, update =	"98.11 bibrelex, 96.05 pocchiola"
+, author =      "C. Coullard and A. Lubiw"
+, title =       "Distance visibility graphs"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      4
+, year =        1992
+, pages =       "349--362"
+, keywords =    "visibility, geometric graphs"
+, succeeds =    "cl-dvg-91"
+, update =      "98.11 bibrelex, 96.05 pocchiola"
 }
 
 @article{cdm-ffepm-85
-, author =	"J. L. Coulomb and Y. {Du Terrail} and G. Meunier"
-, title =	"Flux3d: {A} Finite Element Package For Magnetic Computation"
-, journal =	"IEEE Trans. Magn."
-, volume =	"MAG-21"
-, number =	6
-, month =	nov
-, year =	1985
-, pages =	"2499--2502"
-, keywords =	"computer program flux3d"
-, annote =	"Uses 3D DT by insertion."
-, abstract =	"A finite element package for the computation of
-		 three-dimensional magnetostatic field is described. The
-		 finite element mesh is automatically built in two steps
-		 using a Delaunay tetrahedrization. In step 1, the user
-		 gives interactively a first set of nodes located on
-		 interfaces and boundaries, and the program computes a
-		 coarse tetrahedral mesh. In step 2, the program adds
-		 new nodes automatically to refine the initial mesh and
-		 regularizes it. The implemented finite element
-		 formulations use either scalar or vector potential. The
-		 postprocessor allows interactive computation and
-		 visualization of any local or global quantities given
-		 by closed formulas. 9 refs."
+, author =      "J. L. Coulomb and Y. {Du Terrail} and G. Meunier"
+, title =       "Flux3d: {A} Finite Element Package For Magnetic Computation"
+, journal =     "IEEE Trans. Magn."
+, volume =      "MAG-21"
+, number =      6
+, month =       nov
+, year =        1985
+, pages =       "2499--2502"
+, keywords =    "computer program flux3d"
+, annote =      "Uses 3D DT by insertion."
+, abstract =    "A finite element package for the computation of
+                 three-dimensional magnetostatic field is described. The
+                 finite element mesh is automatically built in two steps
+                 using a Delaunay tetrahedrization. In step 1, the user
+                 gives interactively a first set of nodes located on
+                 interfaces and boundaries, and the program computes a
+                 coarse tetrahedral mesh. In step 2, the program adds
+                 new nodes automatically to refine the initial mesh and
+                 regularizes it. The implemented finite element
+                 formulations use either scalar or vector potential. The
+                 postprocessor allows interactive computation and
+                 visualization of any local or global quantities given
+                 by closed formulas. 9 refs."
 }
 
 @book{c-dic-36
-, author =	"R. Courant"
-, title =	"Differential and integral calculus"
-, volume =	2
-, publisher =	"Interscience Publishers"
-, address =	"New York, NY"
-, year =	1936
-, update =	"98.03 bibrelex"
+, author =      "R. Courant"
+, title =       "Differential and integral calculus"
+, volume =      2
+, publisher =   "Interscience Publishers"
+, address =     "New York, NY"
+, year =        1936
+, update =      "98.03 bibrelex"
 }
 
 @article{cb-accwf-86
-, author =	"S. M. Courter and J. A. {Brewer III}"
-, title =	"Automated Conversion of Curvilinear Wire-Frame Models to Surface Boundary Models"
-, journal =	"Comput. Graph."
-, volume =	20
-, number =	4
-, month =	aug
-, year =	1986
-, pages =	"171--178"
-, note =	"Proc. SIGGRAPH '86"
-, update =	"98.03 bibrelex"
+, author =      "S. M. Courter and J. A. {Brewer III}"
+, title =       "Automated Conversion of Curvilinear Wire-Frame Models to Surface Boundary Models"
+, journal =     "Comput. Graph."
+, volume =      20
+, number =      4
+, month =       aug
+, year =        1986
+, pages =       "171--178"
+, note =        "Proc. SIGGRAPH '86"
+, update =      "98.03 bibrelex"
 }
 
 @article{ch-nnpc-67
-, author =	"T. M. Cover and P. E. Hart"
-, title =	"Nearest neighbor pattern classification"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	13
-, year =	1967
-, pages =	"21--27"
-, update =	"97.07 agarwal"
+, author =      "T. M. Cover and P. E. Hart"
+, title =       "Nearest neighbor pattern classification"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      13
+, year =        1967
+, pages =       "21--27"
+, update =      "97.07 agarwal"
 }
 
 @book{ct-eit-91
-, author =	"T. M. Cover and J. A. Thomas"
-, title =	"Elements of Information Theory"
-, publisher =	"Wiley-Interscience"
-, address =	"New York, NY"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "T. M. Cover and J. A. Thomas"
+, title =       "Elements of Information Theory"
+, publisher =   "Wiley-Interscience"
+, address =     "New York, NY"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @book{clo-iva-92
-, author =	"D. Cox and J. Little and D. {O'Shea}"
-, title =	"Ideals, Varieties, and Algorithms"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1992
-, keywords =	"book"
-, update =	"95.01 devillers"
+, author =      "D. Cox and J. Little and D. {O'Shea}"
+, title =       "Ideals, Varieties, and Algorithms"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1992
+, keywords =    "book"
+, update =      "95.01 devillers"
 }
 
 @techreport{cy-olmpm-89
-, author =	"J. Cox and C. Yap"
-, title =	"On-line motion planning: {Moving} a planar arm by probing an unknown environment"
-, type =	"Manuscript"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "J. Cox and C. Yap"
+, title =       "On-line motion planning: {Moving} a planar arm by probing an unknown environment"
+, type =        "Manuscript"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 % ### what is it?
 @techreport{ch-aldcs-88
-, author =	"M. G. Cox and P. M. Harris"
-, title =	"An algorithm for loop detection in cursive script recognition"
-, type =	"Report"
-, number =	120
-, institution =	"Div. Inf. Techn. and Comput., Nat. Phys. Lab."
-, year =	1988
-, pages =	"i--ii, 1--16"
-, keywords =	"intersection"
-, update =	"95.09 korneenko"
+, author =      "M. G. Cox and P. M. Harris"
+, title =       "An algorithm for loop detection in cursive script recognition"
+, type =        "Report"
+, number =      120
+, institution = "Div. Inf. Techn. and Comput., Nat. Phys. Lab."
+, year =        1988
+, pages =       "i--ii, 1--16"
+, keywords =    "intersection"
+, update =      "95.09 korneenko"
 }
 
 @article{cmmr-omcp-89
-, author =	"P. Cox and H. Maitre and M. Minoux and C. Ribeiro"
-, title =	"Optimal matching of convex polygons"
-, journal =	"Pattern Recogn. Lett."
-, volume =	9
-, number =	5
-, year =	1989
-, pages =	"327--334"
-, keywords =	"convex polygon, similarity"
-, update =	"95.09 korneenko"
+, author =      "P. Cox and H. Maitre and M. Minoux and C. Ribeiro"
+, title =       "Optimal matching of convex polygons"
+, journal =     "Pattern Recogn. Lett."
+, volume =      9
+, number =      5
+, year =        1989
+, pages =       "327--334"
+, keywords =    "convex polygon, similarity"
+, update =      "95.09 korneenko"
 }
 
 @article{c-czmpd-62
-, author =	"H. S. M. Coxeter"
-, title =	"A classification of zonohedra by means of projective diagrams"
-, journal =	"J. Math. Pure Appl."
-, volume =	41
-, year =	1962
-, pages =	"137--156"
-, update =	"94.05 devillers"
+, author =      "H. S. M. Coxeter"
+, title =       "A classification of zonohedra by means of projective diagrams"
+, journal =     "J. Math. Pure Appl."
+, volume =      41
+, year =        1962
+, pages =       "137--156"
+, update =      "94.05 devillers"
 }
 
 @book{c-ig-61
-, author =	"H. S. M. Coxeter"
-, title =	"Introduction to Geometry"
-, edition =	"1st"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1961
-, update =	"99.11 bibrelex"
+, author =      "H. S. M. Coxeter"
+, title =       "Introduction to Geometry"
+, edition =     "1st"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1961
+, update =      "99.11 bibrelex"
 }
 
 @book{c-ig-69
-, author =	"H. S. M. Coxeter"
-, title =	"Introduction to Geometry"
-, edition =	"2nd"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1969
-, update =	"98.11 bibrelex"
+, author =      "H. S. M. Coxeter"
+, title =       "Introduction to Geometry"
+, edition =     "2nd"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1969
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{c-ot-91
-, author =	"H. S. M. Coxeter"
-, title =	"Orthogonal trees"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"89--97"
-, cites =	"b-geadl-68, cs-splg-88, c-rp-73, c-rsrp-88, c-to-89, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "H. S. M. Coxeter"
+, title =       "Orthogonal trees"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "89--97"
+, cites =       "b-geadl-68, cs-splg-88, c-rp-73, c-rsrp-88, c-to-89, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{c-rsrp-88
-, author =	"H. S. M. Coxeter"
-, title =	"Regular and semi-regular polytopes, 3"
-, journal =	"Math. Z."
-, volume =	200
-, year =	1988
-, pages =	"3--45"
-, update =	"97.11 bibrelex"
+, author =      "H. S. M. Coxeter"
+, title =       "Regular and semi-regular polytopes, 3"
+, journal =     "Math. Z."
+, volume =      200
+, year =        1988
+, pages =       "3--45"
+, update =      "97.11 bibrelex"
 }
 
 @book{c-rcp-91
-, author =	"H. S. M. Coxeter"
-, title =	"Regular Complex Polytopes"
-, edition =	"2nd"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge, England"
-, year =	1991
+, author =      "H. S. M. Coxeter"
+, title =       "Regular Complex Polytopes"
+, edition =     "2nd"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge, England"
+, year =        1991
 }
 
 @book{c-rp-73
-, author =	"H. S. M. Coxeter"
-, title =	"Regular Polytopes"
-, edition =	"2nd"
-, publisher =	"Dover"
-, address =	"New York, NY"
-, year =	1973
+, author =      "H. S. M. Coxeter"
+, title =       "Regular Polytopes"
+, edition =     "2nd"
+, publisher =   "Dover"
+, address =     "New York, NY"
+, year =        1973
 }
 
 @article{c-sdcrg-50
-, author =	"H. S. M. Coxeter"
-, title =	"Self-Dual Configurations and Regular Graphs"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	56
-, year =	1950
-, pages =	"413--455"
-, update =	"97.11 bibrelex"
+, author =      "H. S. M. Coxeter"
+, title =       "Self-Dual Configurations and Regular Graphs"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      56
+, year =        1950
+, pages =       "413--455"
+, update =      "97.11 bibrelex"
 }
 
 @book{c-rpp-49
-, author =	"H. S. M. Coxeter"
-, title =	"The real projective plane"
-, publisher =	"McGraw-Hill"
-, year =	1949
-, update =	"98.03 bibrelex"
+, author =      "H. S. M. Coxeter"
+, title =       "The real projective plane"
+, publisher =   "McGraw-Hill"
+, year =        1949
+, update =      "98.03 bibrelex"
 }
 
 @article{c-to-89
-, author =	"H. S. M. Coxeter"
-, title =	"Trisecting an orthoscheme"
-, journal =	"Comput. Math. Appl."
-, volume =	17
-, year =	1989
-, pages =	"59--71"
-, update =	"97.11 bibrelex"
+, author =      "H. S. M. Coxeter"
+, title =       "Trisecting an orthoscheme"
+, journal =     "Comput. Math. Appl."
+, volume =      17
+, year =        1989
+, pages =       "59--71"
+, update =      "97.11 bibrelex"
 }
 
 @book{cfp-zsg-81
-, author =	"H. S. M. Coxeter and R. Frucht and D. L. Powers"
-, title =	"Zero Symmetric Graphs"
-, publisher =	"Academic Press"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "H. S. M. Coxeter and R. Frucht and D. L. Powers"
+, title =       "Zero Symmetric Graphs"
+, publisher =   "Academic Press"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @book{cg-gr-67
-, author =	"H. S. M. Coxeter and S. L. Greitzer"
-, title =	"Geometry Revisited"
-, publisher =	"Mathematical Association of America"
-, address =	"Washington, DC"
-, year =	1967
+, author =      "H. S. M. Coxeter and S. L. Greitzer"
+, title =       "Geometry Revisited"
+, publisher =   "Mathematical Association of America"
+, address =     "Washington, DC"
+, year =        1967
 }
 
 @book{cm-grdg-72
-, author =	"H. S. M. Coxeter and W. O. J. Moser"
-, title =	"Generators and Relations for Discrete Groups"
-, edition =	"3rd"
-, publisher =	"Springer-Verlag"
-, year =	1972
-, precedes =	"cm-grdg-80"
-, update =	"97.11 bibrelex"
+, author =      "H. S. M. Coxeter and W. O. J. Moser"
+, title =       "Generators and Relations for Discrete Groups"
+, edition =     "3rd"
+, publisher =   "Springer-Verlag"
+, year =        1972
+, precedes =    "cm-grdg-80"
+, update =      "97.11 bibrelex"
 }
 
 @book{cm-grdg-80
-, author =	"H. S. M. Coxeter and W. O. J. Moser"
-, title =	"Generators and Relations for Discrete Groups"
-, publisher =	"Springer-Verlag"
-, year =	1980
-, succeeds =	"cm-grdg-72"
-, update =	"97.11 bibrelex"
+, author =      "H. S. M. Coxeter and W. O. J. Moser"
+, title =       "Generators and Relations for Discrete Groups"
+, publisher =   "Springer-Verlag"
+, year =        1980
+, succeeds =    "cm-grdg-72"
+, update =      "97.11 bibrelex"
 }
 
 @article{c-mcsrv-72
-, author =	"I. K. Crain"
-, title =	"{Monte}-{Carlo} Simulation of the Random {Voronoi} Polygons: Preliminary Results"
-, journal =	"Search"
-, volume =	3
-, year =	1972
-, pages =	"220--221"
-, annote =	"Measures various statistics for random Voronoi
-		 polygons."
+, author =      "I. K. Crain"
+, title =       "{Monte}-{Carlo} Simulation of the Random {Voronoi} Polygons: Preliminary Results"
+, journal =     "Search"
+, volume =      3
+, year =        1972
+, pages =       "220--221"
+, annote =      "Measures various statistics for random Voronoi
+                 polygons."
 }
 
 @article{c-mcgrp-78
-, author =	"I. K. Crain"
-, title =	"The {Monte}-{Carlo} Generation of Random Polygons"
-, journal =	"Comput. Geosci."
-, volume =	4
-, year =	1978
-, pages =	"131--141"
-, annote =	"Statistics on 46000 random Voronoi polygons. Simple
-		 method to determine 1 polygon. Closest point gives
-		 initial side---intersection with all other bisectors
-		 gives endpoints. Then walk around boundary."
+, author =      "I. K. Crain"
+, title =       "The {Monte}-{Carlo} Generation of Random Polygons"
+, journal =     "Comput. Geosci."
+, volume =      4
+, year =        1978
+, pages =       "131--141"
+, annote =      "Statistics on 46000 random Voronoi polygons. Simple
+                 method to determine 1 polygon. Closest point gives
+                 initial side---intersection with all other bisectors
+                 gives endpoints. Then walk around boundary."
 }
 
 @techreport{c-llpqb-72
-, author =	"C. Crane"
-, title =	"Linear lists and priority queues as balanced binary trees"
-, type =	"Technical Report"
-, number =	"CS-72-259"
-, institution =	"Dept. of Computer Science, Stanford University"
-, address =	"CA"
-, year =	1972
-, update =	"98.11 bibrelex"
+, author =      "C. Crane"
+, title =       "Linear lists and priority queues as balanced binary trees"
+, type =        "Technical Report"
+, number =      "CS-72-259"
+, institution = "Dept. of Computer Science, Stanford University"
+, address =     "CA"
+, year =        1972
+, update =      "98.11 bibrelex"
 }
 
 @article{c-sr-79
-, author =	"H. Crapo"
-, title =	"Structural rigidity"
-, journal =	"Structural Topology"
-, volume =	1
-, year =	1979
-, pages =	"26--45"
-, update =	"97.11 bibrelex"
+, author =      "H. Crapo"
+, title =       "Structural rigidity"
+, journal =     "Structural Topology"
+, volume =      1
+, year =        1979
+, pages =       "26--45"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{chsww-scg-88
-, author =	"H. Crapo and T. F. Havel and B. Sturmfels and W. Whiteley and N. L. White"
-, title =	"Symbolic computations in geometry"
-, type =	"{IMA} {Preprint} {Series}"
-, number =	389
-, institution =	"Inst. Math. Appl., Univ. Minnesota"
-, address =	"Minneapolis, MN"
-, year =	1988
+, author =      "H. Crapo and T. F. Havel and B. Sturmfels and W. Whiteley and N. L. White"
+, title =       "Symbolic computations in geometry"
+, type =        "{IMA} {Preprint} {Series}"
+, number =      389
+, institution = "Inst. Math. Appl., Univ. Minnesota"
+, address =     "Minneapolis, MN"
+, year =        1988
 }
 
 @incollection{cl-hcdc-88
-, author =	"H. Crapo and J. P. Laumond"
-, title =	"{Hamiltonian} Cycles in {Delaunay} Complexes"
-, booktitle =	"??"
-, series =	"Lect. Notes in Comp. Sci."
-, volume =	1416
-, institution =	"LAAS/CNRS"
-, year =	1988
-, update =	"98.11 bibrelex"
+, author =      "H. Crapo and J. P. Laumond"
+, title =       "{Hamiltonian} Cycles in {Delaunay} Complexes"
+, booktitle =   "??"
+, series =      "Lect. Notes in Comp. Sci."
+, volume =      1416
+, institution = "LAAS/CNRS"
+, year =        1988
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{cl-hcdc-89
-, author =	"Henry Crapo and Jean-Paul Laumond"
-, title =	"{Hamiltonian} Cycles in {Delaunay} Complexes"
-, booktitle =	"Proc. of the Workshop on Geometry and Robotics"
-, site =	"Toulouse, France"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	391
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"292--305"
-, update =	"99.11 bibrelex, 98.11 bibrelex, 96.09 agarwal, 93.09 smid"
+, author =      "Henry Crapo and Jean-Paul Laumond"
+, title =       "{Hamiltonian} Cycles in {Delaunay} Complexes"
+, booktitle =   "Proc. of the Workshop on Geometry and Robotics"
+, site =        "Toulouse, France"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      391
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "292--305"
+, update =      "99.11 bibrelex, 98.11 bibrelex, 96.09 agarwal, 93.09 smid"
 }
 
 @inproceedings{cr-sagh-86
-, author =	"H. Crapo and J. Ryan"
-, title =	"Scene analysis and geometric homology"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"125--132"
-, cites =	"b-j-79, c-sr-79, cr-srls-86, cw-sfmps-82, c-gs-90, c-gs-66, drs-fctcm-74, dh-pcsa-73, dh-pcsa-73, h-dcaps-77, m-orfdf-64, s-msldp-81, t-rprbj-83, tw-rdgrs-84, w-rp-79, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "H. Crapo and J. Ryan"
+, title =       "Scene analysis and geometric homology"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "125--132"
+, cites =       "b-j-79, c-sr-79, cr-srls-86, cw-sfmps-82, c-gs-90, c-gs-66, drs-fctcm-74, dh-pcsa-73, dh-pcsa-73, h-dcaps-77, m-orfdf-64, s-msldp-81, t-rprbj-83, tw-rdgrs-84, w-rp-79, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{cr-srls-86
-, author =	"H. Crapo and J. Ryan"
-, title =	"Spatial realizations of linear scenes"
-, journal =	"Structural Topology"
-, volume =	13
-, year =	1986
-, pages =	"33--68"
+, author =      "H. Crapo and J. Ryan"
+, title =       "Spatial realizations of linear scenes"
+, journal =     "Structural Topology"
+, volume =      13
+, year =        1986
+, pages =       "33--68"
 }
 
 @techreport{cw-pspp-86
-, author =	"H. Crapo and W. Whiteley"
-, title =	"Plane stresses and projected polyhedra"
-, type =	"Technical {Report}"
-, institution =	"Univ. Montreal"
-, address =	"Montreal, PQ"
-, year =	1986
-, succeeds =	"w-tapp-86"
-, update =	"00.03 bibrelex, 93.09 milone+mitchell"
+, author =      "H. Crapo and W. Whiteley"
+, title =       "Plane stresses and projected polyhedra"
+, type =        "Technical {Report}"
+, institution = "Univ. Montreal"
+, address =     "Montreal, PQ"
+, year =        1986
+, succeeds =    "w-tapp-86"
+, update =      "00.03 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{cw-sfmps-82
-, author =	"H. Crapo and W. Whitely"
-, title =	"Statics of Frameworks and Motions of Panel Structures, a Projective Geometric Introduction"
-, journal =	"Structural Topology"
-, volume =	6
-, year =	1982
-, pages =	"42--82"
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia"
+, author =      "H. Crapo and W. Whitely"
+, title =       "Statics of Frameworks and Motions of Panel Structures, a Projective Geometric Introduction"
+, journal =     "Structural Topology"
+, volume =      6
+, year =        1982
+, pages =       "42--82"
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia"
 }
 
 @article{csy-smico-95
-, author =	"D. Crass and I. Suzuki and M. Yamashita"
-, title =	"Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"397--412"
-, keywords =	"geometry, visibility, search"
-, update =	"00.03 bibrelex, 96.09 devillers"
+, author =      "D. Crass and I. Suzuki and M. Yamashita"
+, title =       "Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "397--412"
+, keywords =    "geometry, visibility, search"
+, update =      "00.03 bibrelex, 96.09 devillers"
 }
 
 @inproceedings{cfmmr-remas-98
-, author =	"A. Crauser and P. Ferragina and K. Mehlhorn and U. Meyer and E. Ramos"
-, title =	"Randomized external-memory algorithms for some geometric problems"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"269--268"
-, update =	"99.03 agarwal"
+, author =      "A. Crauser and P. Ferragina and K. Mehlhorn and U. Meyer and E. Ramos"
+, title =       "Randomized external-memory algorithms for some geometric problems"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "269--268"
+, update =      "99.03 agarwal"
 }
 
 @article{cfmmr-remal-01
-, author =	"A. Crauser and P. Ferragina and K. Mehlhorn and U. Meyer and E. A. Ramos"
-, title =	"Randomized external-memory algorithms for line segment intersection and other geometric problems"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"305--337"
-, update =	"01.07 smid"
+, author =      "A. Crauser and P. Ferragina and K. Mehlhorn and U. Meyer and E. A. Ramos"
+, title =       "Randomized external-memory algorithms for line segment intersection and other geometric problems"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "305--337"
+, update =      "01.07 smid"
 }
 
 @inproceedings{c-agrv-85
-, author =	"C. Crawford"
-, title =	"Aspect graphs and robot vision"
-, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
-, year =	1985
-, pages =	"382--384"
-, update =	"98.11 bibrelex"
+, author =      "C. Crawford"
+, title =       "Aspect graphs and robot vision"
+, booktitle =   "Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
+, year =        1985
+, pages =       "382--384"
+, update =      "98.11 bibrelex"
 }
 
 @article{cl-slp-90a
-, author =	"J. Cremona and S. Landau"
-, title =	"Shrinking lattice polyhedra"
-, journal =	"SIAM J. Discrete Math."
-, volume =	3
-, number =	3
-, year =	1990
-, pages =	"338--348"
-, keywords =	"discrete geometry, $d$-dimensional, polyhedra, similarity"
-, succeeds =	"cl-slp-90i"
-, update =	"97.11 bibrelex, 95.09 korneenko"
+, author =      "J. Cremona and S. Landau"
+, title =       "Shrinking lattice polyhedra"
+, journal =     "SIAM J. Discrete Math."
+, volume =      3
+, number =      3
+, year =        1990
+, pages =       "338--348"
+, keywords =    "discrete geometry, $d$-dimensional, polyhedra, similarity"
+, succeeds =    "cl-slp-90i"
+, update =      "97.11 bibrelex, 95.09 korneenko"
 }
 
 @inproceedings{cl-slp-90i
-, author =	"J. Cremona and S. Landru"
-, title =	"Shrinking lattice polyhedra"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"188--193"
-, precedes =	"cl-slp-90a"
-, update =	"95.09 korneenko"
+, author =      "J. Cremona and S. Landru"
+, title =       "Shrinking lattice polyhedra"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "188--193"
+, precedes =    "cl-slp-90a"
+, update =      "95.09 korneenko"
 }
 
 @book{c-gs-90
-, author =	"L. Cremona"
-, title =	"Graphical Statics"
-, publisher =	"Oxford University Press"
-, address =	"London"
-, year =	1890
-, update =	"97.11 bibrelex"
+, author =      "L. Cremona"
+, title =       "Graphical Statics"
+, publisher =   "Oxford University Press"
+, address =     "London"
+, year =        1890
+, update =      "97.11 bibrelex"
 }
 
 @techreport{cdp-noaau-91
-, author =	"P. Crescenzi and G. {Di Battista} and A. Piperno"
-, title =	"A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees"
-, number =	"11.91"
-, institution =	"Dipartimento di Informatica e Sistemistica, Univ. di Roma ``La Sapienza''"
-, year =	1991
-, keywords =	"graph drawing"
-, precedes =	"cdp-noaau-92"
-, update =	"94.01 tamassia, 93.09 tamassia"
+, author =      "P. Crescenzi and G. {Di Battista} and A. Piperno"
+, title =       "A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees"
+, number =      "11.91"
+, institution = "Dipartimento di Informatica e Sistemistica, Univ. di Roma ``La Sapienza''"
+, year =        1991
+, keywords =    "graph drawing"
+, precedes =    "cdp-noaau-92"
+, update =      "94.01 tamassia, 93.09 tamassia"
 }
 
 @article{cdp-noaau-92
-, author =	"P. Crescenzi and G. {Di Battista} and A. Piperno"
-, title =	"A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, year =	1992
-, pages =	"187--200"
-, keywords =	"graph drawing"
-, succeeds =	"cdp-noaau-91"
-, update =	"94.01 tamassia"
+, author =      "P. Crescenzi and G. {Di Battista} and A. Piperno"
+, title =       "A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, year =        1992
+, pages =       "187--200"
+, keywords =    "graph drawing"
+, succeeds =    "cdp-noaau-91"
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{cp-mahvd-97
-, author =	"Pierluigi Crescenzi and Paolo Penna"
-, title =	"Minimum-Area $h$-$v$ Drawings of Complete Binary Trees"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"371--382"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Pierluigi Crescenzi and Paolo Penna"
+, title =       "Minimum-Area $h$-$v$ Drawings of Complete Binary Trees"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "371--382"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{cpp-lauda-98
-, author =	"P. Crescenzi and P. Penna and A. Piperno"
-, title =	"Linear-Area Upward Drawings of {AVL} Trees"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, year =	1998
-, pages =	"25--42"
-, note =	"(special issue on Graph Drawing, edited by G.~{Di Battista} and R.~Tamassia)"
-, succeeds =	"cp-oauda-95"
-, update =	"98.11 devillers+patrignani, 98.07 vismara"
+, author =      "P. Crescenzi and P. Penna and A. Piperno"
+, title =       "Linear-Area Upward Drawings of {AVL} Trees"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, year =        1998
+, pages =       "25--42"
+, note =        "(special issue on Graph Drawing, edited by G.~{Di Battista} and R.~Tamassia)"
+, succeeds =    "cp-oauda-95"
+, update =      "98.11 devillers+patrignani, 98.07 vismara"
 }
 
 @inproceedings{cp-oauda-95
-, author =	"P. Crescenzi and A. Piperno"
-, title =	"Optimal-Area Upward Drawings of {AVL} Trees"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"307--317"
-, keywords =	"graph drawing, planar, upward, trees"
-, update =	"95.01 tamassia"
+, author =      "P. Crescenzi and A. Piperno"
+, title =       "Optimal-Area Upward Drawings of {AVL} Trees"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "307--317"
+, keywords =    "graph drawing, planar, upward, trees"
+, update =      "95.01 tamassia"
 }
 
 @article{chs-gmolr-88
-, author =	"T. Creutzburg and A. H{\"u}bler and O. Sykora"
-, title =	"Geometric methods for on-line recognition of digital straight line segments"
-, journal =	"Computers Artif. Intel."
-, volume =	7
-, number =	3
-, year =	1988
-, pages =	"253--276"
-, keywords =	"digital geometry"
-, update =	"95.09 korneenko"
+, author =      "T. Creutzburg and A. H{\"u}bler and O. Sykora"
+, title =       "Geometric methods for on-line recognition of digital straight line segments"
+, journal =     "Computers Artif. Intel."
+, volume =      7
+, number =      3
+, year =        1988
+, pages =       "253--276"
+, keywords =    "digital geometry"
+, update =      "95.09 korneenko"
 }
 
 @book{ch-dgmc-88
-, author =	"G. Crippen and T. Havel"
-, title =	"Distance Geometry and Molecular Conformation"
-, publisher =	"Research Studies Press"
-, address =	"Letchworth, UK"
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "G. Crippen and T. Havel"
+, title =       "Distance Geometry and Molecular Conformation"
+, publisher =   "Research Studies Press"
+, address =     "Letchworth, UK"
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @book{ch-dgmc-88b
-, author =	"G. M. Crippen and T. F. Havel"
-, title =	"Distance Geometry and Molecular Conformation"
-, publisher =	"John Wiley \& Sons"
-, year =	1988
-, update =	"99.11 bibrelex, 98.11 orourke"
+, author =      "G. M. Crippen and T. F. Havel"
+, title =       "Distance Geometry and Molecular Conformation"
+, publisher =   "John Wiley \& Sons"
+, year =        1988
+, update =      "99.11 bibrelex, 98.11 orourke"
 }
 
 @book{cfg-upg-90
-, author =	"H. P. Croft and K. J. Falconer and R. K. Guy"
-, title =	"Unsolved Problems in Geometry"
-, publisher =	"Springer-Verlag"
-, year =	1990
+, author =      "H. P. Croft and K. J. Falconer and R. K. Guy"
+, title =       "Unsolved Problems in Geometry"
+, publisher =   "Springer-Verlag"
+, year =        1990
 }
 
 @inproceedings{c-vsanl-88
-, author =	"R. G. Cromley"
-, title =	"A Vertex Substitution Approach to Numerical Line Simplification"
-, booktitle =	"Proc. 3rd Internat. Sympos. Spatial Data Handling"
-, year =	1988
-, pages =	"57--64"
-, update =	"96.09 kreveld"
+, author =      "R. G. Cromley"
+, title =       "A Vertex Substitution Approach to Numerical Line Simplification"
+, booktitle =   "Proc. 3rd Internat. Sympos. Spatial Data Handling"
+, year =        1988
+, pages =       "57--64"
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{c-cbsut-87
-, author =	"R. G. Cromley"
-, title =	"Calculating Bisector Skeletons Using a {Thiessen} Data Structure"
-, booktitle =	"Proceedings, AUTOCARTO 8"
-, site =	"Baltimore, MD, March 29--April 3"
-, year =	1987
-, pages =	"719--724"
-, update =	"93.09 devillers"
-, annote =	"Vd of simple polygon. Selection algorithm."
+, author =      "R. G. Cromley"
+, title =       "Calculating Bisector Skeletons Using a {Thiessen} Data Structure"
+, booktitle =   "Proceedings, AUTOCARTO 8"
+, site =        "Baltimore, MD, March 29--April 3"
+, year =        1987
+, pages =       "719--724"
+, update =      "93.09 devillers"
+, annote =      "Vd of simple polygon. Selection algorithm."
 }
 
 @book{c-dc-92
-, author =	"R. G. Cromley"
-, title =	"Digital Cartography"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs"
-, year =	1992
-, update =	"96.09 kreveld"
+, author =      "R. G. Cromley"
+, title =       "Digital Cartography"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs"
+, year =        1992
+, update =      "96.09 kreveld"
 }
 
 @article{cg-pistd-85
-, author =	"R. G. Cromley and D. Grogan"
-, title =	"A Procedure for Identifying and Storing a {Thiessen} Diagram within a Convex Boundary"
-, journal =	"Geogr. Anal."
-, volume =	17
-, number =	2
-, month =	apr
-, year =	1985
-, pages =	"167--175"
-, update =	"93.09 devillers"
-, annote =	"Circumcircle algorithm. Only computes the part of the
-		 Vd within a convex polygon."
+, author =      "R. G. Cromley and D. Grogan"
+, title =       "A Procedure for Identifying and Storing a {Thiessen} Diagram within a Convex Boundary"
+, journal =     "Geogr. Anal."
+, volume =      17
+, number =      2
+, month =       apr
+, year =        1985
+, pages =       "167--175"
+, update =      "93.09 devillers"
+, annote =      "Circumcircle algorithm. Only computes the part of the
+                 Vd within a convex polygon."
 }
 
 @book{c-p-97
-, author =	"P. Cromwell"
-, title =	"Polyhedra"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge"
-, year =	1997
-, update =	"00.11 smid, 00.07 icking, 98.07 orourke"
+, author =      "P. Cromwell"
+, title =       "Polyhedra"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge"
+, year =        1997
+, update =      "00.11 smid, 00.07 icking, 98.07 orourke"
 }
 
 @incollection{c-eev-94
-, author =	"Robert L. Cromwell"
-, title =	"Efficient Eigenvalues for Visualization"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"193--198"
-, keywords =	"scatterplot, matrix of central moments"
-, update =	"94.09 heckbert"
-, annote =	"Answers the question: if I have a set of points in 3D,
+, author =      "Robert L. Cromwell"
+, title =       "Efficient Eigenvalues for Visualization"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "193--198"
+, keywords =    "scatterplot, matrix of central moments"
+, update =      "94.09 heckbert"
+, annote =      "Answers the question: if I have a set of points in 3D,
 from what direction should I view them to get the best view (minimizing
 bunching in the projection)? Solving this involves the eigenvalues of a 3x3
 matrix. Optimized formulas are given for computing the eigenvalues."
 }
 
 @article{cr-tbtdo-99
-, author =	"A. Crosnier and J. R. Rossignac"
-, title =	"Tribox Bounds for Three-Dimensional Objects"
-, journal =	"Comput. \& Graphics"
-, volume =	23
-, number =	3
-, month =	jun
-, year =	1999
-, pages =	"429--437"
-, update =	"00.03 held"
+, author =      "A. Crosnier and J. R. Rossignac"
+, title =       "Tribox Bounds for Three-Dimensional Objects"
+, journal =     "Comput. \& Graphics"
+, volume =      23
+, number =      3
+, month =       jun
+, year =        1999
+, pages =       "429--437"
+, update =      "00.03 held"
 }
 
 @article{c-sacg-77
-, author =	"F. C. Crow"
-, title =	"Shadow Algorithms for Computer Graphics"
-, journal =	"Comput. Graph."
-, volume =	11
-, number =	2
-, year =	1977
-, pages =	"242--248"
-, update =	"97.11 bibrelex"
+, author =      "F. C. Crow"
+, title =       "Shadow Algorithms for Computer Graphics"
+, journal =     "Comput. Graph."
+, volume =      11
+, number =      2
+, year =        1977
+, pages =       "242--248"
+, update =      "97.11 bibrelex"
 }
 
 @book{cf-ikt-65
-, author =	"R. H. Crowell and R. H. Fox"
-, title =	"Introduction to Knot Theory"
-, publisher =	"Blaisdell Publishing Co."
-, address =	"New York, NY"
-, year =	1965
-, update =	"97.11 bibrelex"
+, author =      "R. H. Crowell and R. H. Fox"
+, title =       "Introduction to Knot Theory"
+, publisher =   "Blaisdell Publishing Co."
+, address =     "New York, NY"
+, year =        1965
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{c-dvloo-92
-, author =	"I. F. Cruz"
-, title =	"{DOODLE}: A visual language for object-oriented databases"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1992
-, pages =	"71--80"
-, keywords =	"graph drawing"
-, update =	"97.07 agarwal, 94.01 tamassia"
+, author =      "I. F. Cruz"
+, title =       "{DOODLE}: A visual language for object-oriented databases"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1992
+, pages =       "71--80"
+, keywords =    "graph drawing"
+, update =      "97.07 agarwal, 94.01 tamassia"
 }
 
 @inproceedings{c-uvcld-93
-, author =	"I. F. Cruz"
-, title =	"Using a visual constraint language for data display specification"
-, editor =	"P. C. Kanellakis and J.-L. Lassez and V. Saraswat"
-, booktitle =	"First Workshop on Principles and Practice of Constraint Programming"
-, site =	"Newport, RI"
-, month =	apr
-, year =	1993
-, keywords =	"graph drawing"
-, update =	"94.01 tamassia"
+, author =      "I. F. Cruz"
+, title =       "Using a visual constraint language for data display specification"
+, editor =      "P. C. Kanellakis and J.-L. Lassez and V. Saraswat"
+, booktitle =   "First Workshop on Principles and Practice of Constraint Programming"
+, site =        "Newport, RI"
+, month =       apr
+, year =        1993
+, keywords =    "graph drawing"
+, update =      "94.01 tamassia"
 }
 
 % ### seems no way to do special issue cleanly?
@@ -40048,4270 +40048,4270 @@ @inproceedings{c-uvcld-93
 % bibtex article can, but can't have editor
 % hacks like {P. Eades, editors} break if printing trailing initials
 @book{ce-sigv-95
-, title =	"Special Issue on Graph Visualization"
-, editor =	"I. F. Cruz and P. Eades"
-, series =	"J. Visual Lang. Comput."
-, volume =	"6:3"
-, year =	1995
-, keywords =	"graph drawing, collection"
-, update =	"96.01 jones, 95.09 tamassia"
+, title =       "Special Issue on Graph Visualization"
+, editor =      "I. F. Cruz and P. Eades"
+, series =      "J. Visual Lang. Comput."
+, volume =      "6:3"
+, year =        1995
+, keywords =    "graph drawing, collection"
+, update =      "96.01 jones, 95.09 tamassia"
 }
 
 @inproceedings{cg-dgeet-95
-, author =	"I. F. Cruz and A. Garg"
-, title =	"Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"404--415"
-, keywords =	"graph drawing, planar, visual language, declarative"
-, update =	"95.01 tamassia"
+, author =      "I. F. Cruz and A. Garg"
+, title =       "Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "404--415"
+, keywords =    "graph drawing, planar, visual language, declarative"
+, update =      "95.01 tamassia"
 }
 
 @techreport{cgt-ecrvg-96
-, author =	"I. F. Cruz and A. Garg and R. Tamassia"
-, title =	"Efficient Constraint Resolution in Visual Graph Drawing"
-, type =	"Manuscript"
-, institution =	"Dept. of Computer Sci., Brown University"
-, year =	1996
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia"
+, author =      "I. F. Cruz and A. Garg and R. Tamassia"
+, title =       "Efficient Constraint Resolution in Visual Graph Drawing"
+, type =        "Manuscript"
+, institution = "Dept. of Computer Sci., Brown University"
+, year =        1996
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{ctv-vagd-93
-, author =	"I. F. Cruz and R. Tamassia and P. {Van Hentenryk}"
-, title =	"A Visual approach to graph drawing"
-, booktitle =	"Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
-, site =	"Paris, France"
-, month =	sep
-, year =	1993
-, keywords =	"graph drawing"
-, update =	"94.01 tamassia"
+, author =      "I. F. Cruz and R. Tamassia and P. {Van Hentenryk}"
+, title =       "A Visual approach to graph drawing"
+, booktitle =   "Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
+, site =        "Paris, France"
+, month =       sep
+, year =        1993
+, keywords =    "graph drawing"
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{ct-3gdsa-96
-, author =	"I. F. Cruz and J. P. Twarog"
-, title =	"3D Graph Drawing with Simulated Annealing"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"162--165"
-, keywords =	"graph drawing, straight-line, 3D"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "I. F. Cruz and J. P. Twarog"
+, title =       "3D Graph Drawing with Simulated Annealing"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "162--165"
+, keywords =    "graph drawing, straight-line, 3D"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @article{cr-cfhpe-84
-, author =	"J. Csima and T. A. Ralston"
-, title =	"Crossing-free {Hamiltonian} paths in {Euclidean} spaces"
-, journal =	"Ars Combin."
-, volume =	18
-, year =	1984
-, pages =	"87--97"
-, keywords =	"geometric graphs, TSP"
-, update =	"95.09 korneenko"
+, author =      "J. Csima and T. A. Ralston"
+, title =       "Crossing-free {Hamiltonian} paths in {Euclidean} spaces"
+, journal =     "Ars Combin."
+, volume =      18
+, year =        1984
+, pages =       "87--97"
+, keywords =    "geometric graphs, TSP"
+, update =      "95.09 korneenko"
 }
 
 @article{cf-dvbp-90
-, author =	"J. Csirik and J. B. Frenk"
-, title =	"A dual version of bin packing"
-, journal =	"Algorithms Rev."
-, volume =	1
-, number =	2
-, year =	1990
-, pages =	"87--95"
+, author =      "J. Csirik and J. B. Frenk"
+, title =       "A dual version of bin packing"
+, journal =     "Algorithms Rev."
+, volume =      1
+, number =      2
+, year =        1990
+, pages =       "87--95"
 }
 
 @article{cflz-mdbp-90
-, author =	"J. Csirik and J. B. G. Frenk and M. Labbe and S. Zhang"
-, title =	"On the multi-dimensional bin packing"
-, journal =	"Acta Cybern."
-, volume =	"??"
-, year =	1990
-, pages =	"361--369"
-, keywords =	"$d$-dimensional, packing, heuristics"
-, update =	"96.09 devillers, 95.09 korneenko"
+, author =      "J. Csirik and J. B. G. Frenk and M. Labbe and S. Zhang"
+, title =       "On the multi-dimensional bin packing"
+, journal =     "Acta Cybern."
+, volume =      "??"
+, year =        1990
+, pages =       "361--369"
+, keywords =    "$d$-dimensional, packing, heuristics"
+, update =      "96.09 devillers, 95.09 korneenko"
 }
 
 @article{ct-nagp-98
-, author =	"Gy{\"o}rgy Csizmadia and G. T{\'o}th"
-, title =	"Note on an Art Gallery Problem"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, number =	1
-, year =	1998
-, pages =	"47--55"
-, keywords =	"visibility"
-, update =	"98.07 bibrelex, 98.03 orourke, 96.09 orourke"
+, author =      "Gy{\"o}rgy Csizmadia and G. T{\'o}th"
+, title =       "Note on an Art Gallery Problem"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, number =      1
+, year =        1998
+, pages =       "47--55"
+, keywords =    "visibility"
+, update =      "98.07 bibrelex, 98.03 orourke, 96.09 orourke"
 }
 
 @inproceedings{cdjn-dcvdc-94
-, author =	"Lucian Cucu and Mircea Dragan and Tudor Jebelean and Viorel Negru"
-, title =	"Divide-and-Conquer {Voronoi} Diagram Construction"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"5--7"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Lucian Cucu and Mircea Dragan and Tudor Jebelean and Viorel Negru"
+, title =       "Divide-and-Conquer {Voronoi} Diagram Construction"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "5--7"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{cdjn-pi3dt-95
-, author =	"Lucian Cucu and Mircea Dragan and Tudor Jebelean and Viorel Negru"
-, title =	"Parallel Implementation of {3D} {Delaunay} Triangulation"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"25--28"
-, update =	"00.03 bibrelex"
+, author =      "Lucian Cucu and Mircea Dragan and Tudor Jebelean and Viorel Negru"
+, title =       "Parallel Implementation of {3D} {Delaunay} Triangulation"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "25--28"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{cdnm-tddtu-95
-, author =	"Lucian Cucu and Mircea Dragan and Viorel Negru and Dorin Mangu"
-, title =	"Three Dimensional {Delaunay} Triangulation Using an Uniform Grid"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"21--23"
-, update =	"00.03 bibrelex"
+, author =      "Lucian Cucu and Mircea Dragan and Viorel Negru and Dorin Mangu"
+, title =       "Three Dimensional {Delaunay} Triangulation Using an Uniform Grid"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "21--23"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{c-spc-99
-, author =	"J. Culberson"
-, title =	"Sokoban is {PSPACE}-complete"
-, editor =	"E. Lodi, L. Pagli, N. Santoro"
-, booktitle =	"Proc. Internat. Conf. Fun with Algorithms"
-, publisher =	"Carelton Scientific"
-, address =	"Elba, Italy"
-, month =	jun
-, year =	1998
-, pages =	"65--76"
-, update =	"00.03 orourke"
+, author =      "J. Culberson"
+, title =       "Sokoban is {PSPACE}-complete"
+, editor =      "E. Lodi, L. Pagli, N. Santoro"
+, booktitle =   "Proc. Internat. Conf. Fun with Algorithms"
+, publisher =   "Carelton Scientific"
+, address =     "Elba, Italy"
+, month =       jun
+, year =        1998
+, pages =       "65--76"
+, update =      "00.03 orourke"
 }
 
 @inproceedings{cr-tgsps-85
-, author =	"J. Culberson and G. J. E. Rawlins"
-, title =	"Turtlegons: generating simple polygons from sequences of angles"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"305--310"
-, cites =	"fm-nbkck-78, h-srlp-82, p-mccpi-80, s-rcg-84, sh-srppi-72, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "J. Culberson and G. J. E. Rawlins"
+, title =       "Turtlegons: generating simple polygons from sequences of angles"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "305--310"
+, cites =       "fm-nbkck-78, h-srlp-82, p-mccpi-80, s-rcg-84, sh-srppi-72, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{cr-uaopc-89
-, author =	"Joseph Culberson and Robert Reckhow"
-, title =	"A Unified Approach to Orthogonal Polygon Covering Problems via {Dent} Diagrams"
-, type =	"report"
-, number =	"TR 89-6"
-, institution =	"Department of Computing Science, University of Alberta"
-, address =	"Edmonton,  Alberta, Canada"
-, month =	feb
-, year =	1989
-, succeeds =	"cr-dduap-87"
-, precedes =	"cr-occop-89a"
-, update =	"98.07 bibrelex"
+, author =      "Joseph Culberson and Robert Reckhow"
+, title =       "A Unified Approach to Orthogonal Polygon Covering Problems via {Dent} Diagrams"
+, type =        "report"
+, number =      "TR 89-6"
+, institution = "Department of Computing Science, University of Alberta"
+, address =     "Edmonton,  Alberta, Canada"
+, month =       feb
+, year =        1989
+, succeeds =    "cr-dduap-87"
+, precedes =    "cr-occop-89a"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{cr-dduap-87
-, author =	"J. Culberson and R. Reckhow"
-, title =	"Dent Diagrams: {A} Unified Approach to Polygon Covering Problems"
-, institution =	"Dept. Comput. Sci., Univ. Alberta"
-, address =	"Edmonton, Alberta, Canada"
-, month =	jul
-, year =	1987
-, precedes =	"cr-uaopc-89"
-, update =	"98.07 bibrelex, 98.03 bibrelex"
+, author =      "J. Culberson and R. Reckhow"
+, title =       "Dent Diagrams: {A} Unified Approach to Polygon Covering Problems"
+, institution = "Dept. Comput. Sci., Univ. Alberta"
+, address =     "Edmonton, Alberta, Canada"
+, month =       jul
+, year =        1987
+, precedes =    "cr-uaopc-89"
+, update =      "98.07 bibrelex, 98.03 bibrelex"
 }
 
 @article{cr-occop-89a
-, author =	"J. Culberson and R. A. Reckhow"
-, title =	"Orthogonally convex coverings of orthogonal polygons without holes"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	39
-, year =	1989
-, pages =	"166--204"
-, succeeds =	"rc-csopm-87"
-, update =	"98.07 bibrelex"
+, author =      "J. Culberson and R. A. Reckhow"
+, title =       "Orthogonally convex coverings of orthogonal polygons without holes"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      39
+, year =        1989
+, pages =       "166--204"
+, succeeds =    "rc-csopm-87"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{cr-cpih-88
-, author =	"J. C. Culberson and R. A. Reckhow"
-, title =	"Covering polygons is hard"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"601--611"
-, keywords =	"complexity theory, covering, polygons, rectangles, NP-completeness, two-dimensional"
-, comments =	"Submitted J. Algorithms"
+, author =      "J. C. Culberson and R. A. Reckhow"
+, title =       "Covering polygons is hard"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "601--611"
+, keywords =    "complexity theory, covering, polygons, rectangles, NP-completeness, two-dimensional"
+, comments =    "Submitted J. Algorithms"
 }
 
 @article{cw-nstsm-82
-, author =	"K. Culik and D. Wood"
-, title =	"A note on some tree similarity measure"
-, journal =	"IPL"
-, volume =	15
-, year =	1982
-, pages =	"39--42"
-, update =	"98.03 bibrelex"
+, author =      "K. Culik and D. Wood"
+, title =       "A note on some tree similarity measure"
+, journal =     "IPL"
+, volume =      15
+, year =        1982
+, pages =       "39--42"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ckpssssv-ltrmp-93
-, author =	"D. E. Culler and R. M. Karp and D. A. Patterson and A. Sahay and K. E. Schauser and E. Santos and R. Subramonian and T. von Eicken"
-, title =	"{LogP}: Towards a Realistic Model of Parallel Computation"
-, booktitle =	"Proc. 4th ACM SIGPLAN Symp. on Princ. and Practice of Parallel Programming"
-, year =	1993
-, pages =	"1--12"
-, update =	"96.09 orourke"
+, author =      "D. E. Culler and R. M. Karp and D. A. Patterson and A. Sahay and K. E. Schauser and E. Santos and R. Subramonian and T. von Eicken"
+, title =       "{LogP}: Towards a Realistic Model of Parallel Computation"
+, booktitle =   "Proc. 4th ACM SIGPLAN Symp. on Princ. and Practice of Parallel Programming"
+, year =        1993
+, pages =       "1--12"
+, update =      "96.09 orourke"
 }
 
 @book{c-gs-66
-, author =	"C. Culmann"
-, title =	"Graphische Statik"
-, publisher =	"Mayer and Zeller"
-, address =	"Z{\"u}rich"
-, year =	1866
-, update =	"97.11 bibrelex"
+, author =      "C. Culmann"
+, title =       "Graphische Statik"
+, publisher =   "Mayer and Zeller"
+, address =     "Z{\"u}rich"
+, year =        1866
+, update =      "97.11 bibrelex"
 }
 
 @article{c-oarn-85
-, author =	"W. Cunningham"
-, title =	"Optimal attack and reinforcement of a network"
-, journal =	"J. ACM"
-, volume =	32
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "W. Cunningham"
+, title =       "Optimal attack and reinforcement of a network"
+, journal =     "J. ACM"
+, volume =      32
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{cy-gtbtt-92
-, author =	"W. Cunto and V. Yriarte"
-, title =	"{GKD}-trees: {Binary} trees that combine multi-dimensional data handling, node size and fringe reorganization"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"192--211"
+, author =      "W. Cunto and V. Yriarte"
+, title =       "{GKD}-trees: {Binary} trees that combine multi-dimensional data handling, node size and fringe reorganization"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "192--211"
 }
 
 @techreport{cbhh-sspes-87
-, author =	"J. E. Cuny and D. A. Bayley and J. W. Hagerman and A. A. Hough"
-, title =	"The Simple Simon Programming Environment: {A} Status Report"
-, number =	"87-22"
-, institution =	"Department of Computer and Information Science, University of Massachusetts"
-, month =	may
-, year =	1987
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. E. Cuny and D. A. Bayley and J. W. Hagerman and A. A. Hough"
+, title =       "The Simple Simon Programming Environment: {A} Status Report"
+, number =      "87-22"
+, institution = "Department of Computer and Information Science, University of Massachusetts"
+, month =       may
+, year =        1987
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{cr-wim-41
-, author =	"R. Curant and H. Robbins"
-, title =	"What is Mathematics?"
-, publisher =	"Oxford University Press"
-, year =	1941
-, update =	"97.11 bibrelex"
+, author =      "R. Curant and H. Robbins"
+, title =       "What is Mathematics?"
+, publisher =   "Oxford University Press"
+, year =        1941
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{cl-vmbcm-96
-, author =	"B. Curless and M. Levoy"
-, title =	"A volumetric method for building complex models from range images"
-, booktitle =	"Proc. SIGGRAPH 96"
-, year =	1996
-, pages =	"303--312"
-, update =	"00.03 devillers"
+, author =      "B. Curless and M. Levoy"
+, title =       "A volumetric method for building complex models from range images"
+, booktitle =   "Proc. SIGGRAPH 96"
+, year =        1996
+, pages =       "303--312"
+, update =      "00.03 devillers"
 }
 
 @article{cbc-ndlia-91
-, author =	"D. B. Curtis and R. P. Burton and D. M. Campbell"
-, title =	"An $n$-dimensional line intersection algorithm"
-, journal =	"J. Imag. Technol."
-, volume =	17
-, number =	4
-, year =	1991
-, pages =	"175--177"
-, keywords =	"$d$-dimensional, intersection"
-, update =	"95.09 korneenko"
+, author =      "D. B. Curtis and R. P. Burton and D. M. Campbell"
+, title =       "An $n$-dimensional line intersection algorithm"
+, journal =     "J. Imag. Technol."
+, volume =      17
+, number =      4
+, year =        1991
+, pages =       "175--177"
+, keywords =    "$d$-dimensional, intersection"
+, update =      "95.09 korneenko"
 }
 
 @article{cbc-pagnd-91
-, author =	"D. B. Curtis and R. P. Burton and D. M. Campbell"
-, title =	"Parallel axis geometry for $n$-dimensional computer graphics"
-, journal =	"J. Imag. Technol."
-, volume =	17
-, number =	4
-, year =	1991
-, pages =	"168--175"
-, keywords =	"$d$-dimensional, data structuring"
-, update =	"95.09 korneenko"
+, author =      "D. B. Curtis and R. P. Burton and D. M. Campbell"
+, title =       "Parallel axis geometry for $n$-dimensional computer graphics"
+, journal =     "J. Imag. Technol."
+, volume =      17
+, number =      4
+, year =        1991
+, pages =       "168--175"
+, keywords =    "$d$-dimensional, data structuring"
+, update =      "95.09 korneenko"
 }
 
 @book{c-rgfm-85
-, author =	"M. Cutkosky"
-, title =	"Robotic grasping and fine manipulation"
-, publisher =	"Kluwer Academic Publishers"
-, year =	1985
-, update =	"98.07 bibrelex"
+, author =      "M. Cutkosky"
+, title =       "Robotic grasping and fine manipulation"
+, publisher =   "Kluwer Academic Publishers"
+, year =        1985
+, update =      "98.07 bibrelex"
 }
 
 @article{clpp-odpfs-60
-, author =	"L. J. Cutrona and E. N. Leight and C. J. Palermo and L. J. Porcello"
-, title =	"Optical data processing and filtering systems"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	6
-, number =	3
-, month =	jun
-, year =	1960
-, pages =	"386--400"
-, update =	"97.11 bibrelex"
+, author =      "L. J. Cutrona and E. N. Leight and C. J. Palermo and L. J. Porcello"
+, title =       "Optical data processing and filtering systems"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      6
+, number =      3
+, month =       jun
+, year =        1960
+, pages =       "386--400"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ckp-citsg-93
-, author =	"D. R. Cutting and D. R. Karger and J. O. Pedersen"
-, title =	"Constant Interaction-Time Scatter/Gather Browsing of Very Large Document Collections"
-, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
-, year =	1993
-, pages =	"126--134"
-, update =	"98.07 agarwal"
+, author =      "D. R. Cutting and D. R. Karger and J. O. Pedersen"
+, title =       "Constant Interaction-Time Scatter/Gather Browsing of Very Large Document Collections"
+, booktitle =   "Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
+, year =        1993
+, pages =       "126--134"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{ckp-sgcba-92
-, author =	"D. R. Cutting and D. R. Karger and J. O. Pedersen and J. W. Tukey"
-, title =	"Scatter/Gather: {A} Cluster-Based Approach to Browsing Large Document Collections"
-, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
-, year =	1992
-, pages =	"318--329"
-, update =	"98.07 agarwal"
+, author =      "D. R. Cutting and D. R. Karger and J. O. Pedersen and J. W. Tukey"
+, title =       "Scatter/Gather: {A} Cluster-Based Approach to Browsing Large Document Collections"
+, booktitle =   "Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
+, year =        1992
+, pages =       "318--329"
+, update =      "98.07 agarwal"
 }
 
 @article{ckv-fhe-87
-, author =	"G. Cybenko and D. W. Krumme and K. N. Venkataraman"
-, title =	"Fixed Hypercube Embedding"
-, journal =	"Inf. Proc. Lett."
-, volume =	25
-, year =	1987
-, pages =	"35--39"
-, update =	"98.07 bibrelex"
+, author =      "G. Cybenko and D. W. Krumme and K. N. Venkataraman"
+, title =       "Fixed Hypercube Embedding"
+, journal =     "Inf. Proc. Lett."
+, volume =      25
+, year =        1987
+, pages =       "35--39"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{c-ebitu-94
-, author =	"Joseph M. Cychosz"
-, title =	"Efficient Binary Image Thinning Using Neighborhood Maps"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"465--473"
-, keywords =	"image skeleton, image filter"
-, update =	"94.09 heckbert"
-, annote =	"Provides fast code to thin a bitmap image and find its
+, author =      "Joseph M. Cychosz"
+, title =       "Efficient Binary Image Thinning Using Neighborhood Maps"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "465--473"
+, keywords =    "image skeleton, image filter"
+, update =      "94.09 heckbert"
+, annote =      "Provides fast code to thin a bitmap image and find its
 ``skeleton.'' Image thinning is used for pattern recognition. Contains C
 code."
 }
 
 @incollection{cw-irc-94
-, author =	"Joseph M. Cychosz and Warren N. {Waggenspack Jr.}"
-, title =	"Intersecting a Ray with a Cylinder"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"356--365"
-, keywords =	"quadric surface, ray tracing"
-, update =	"94.09 heckbert"
-, annote =	"Geometric method for intersecting a ray with a cylinder.
+, author =      "Joseph M. Cychosz and Warren N. {Waggenspack Jr.}"
+, title =       "Intersecting a Ray with a Cylinder"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "356--365"
+, keywords =    "quadric surface, ray tracing"
+, update =      "94.09 heckbert"
+, annote =      "Geometric method for intersecting a ray with a cylinder.
 Contains C code."
 }
 
 @inproceedings{cp-dsnlt-90
-, author =	"R. Cypher and C. G. Plaxton"
-, title =	"Deterministic sorting in nearly logarithmic time on the hypercupe and related computers"
-, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
-, year =	1990
-, pages =	"193--203"
-, update =	"98.03 bibrelex"
+, author =      "R. Cypher and C. G. Plaxton"
+, title =       "Deterministic sorting in nearly logarithmic time on the hypercupe and related computers"
+, booktitle =   "Proc. 22nd Annu. ACM Sympos. Theory Comput."
+, year =        1990
+, pages =       "193--203"
+, update =      "98.03 bibrelex"
 }
 
 @article{cs-cpasn-92
-, author =	"R. Cypher and J. L. C. Sanz"
-, title =	"Cubesort: A Parallel Algorithm for Sorting {$N$} Data Items with {$S$}-Sorters"
-, journal =	"J. Algorithms"
-, volume =	13
-, year =	1992
-, pages =	"211--234"
-, update =	"96.09 orourke"
+, author =      "R. Cypher and J. L. C. Sanz"
+, title =       "Cubesort: A Parallel Algorithm for Sorting {$N$} Data Items with {$S$}-Sorters"
+, journal =     "J. Algorithms"
+, volume =      13
+, year =        1992
+, pages =       "211--234"
+, update =      "96.09 orourke"
 }
 
 @article{cp-dsnlt-93
-, author =	"R. E. Cypher and C. G. Plaxton"
-, title =	"Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	47
-, year =	1993
-, pages =	"501--548"
-, update =	"98.03 bibrelex, 96.09 orourke"
+, author =      "R. E. Cypher and C. G. Plaxton"
+, title =       "Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      47
+, year =        1993
+, pages =       "501--548"
+, update =      "98.03 bibrelex, 96.09 orourke"
 }
 
 @inproceedings{c-pamcp-93
-, author =	"A. Czumaj"
-, title =	"Parallel algorithm for the matrix chain product and the optimal triangulation problems"
-, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	665
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"294--305"
-, update =	"93.05 smid"
+, author =      "A. Czumaj"
+, title =       "Parallel algorithm for the matrix chain product and the optimal triangulation problems"
+, booktitle =   "Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      665
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "294--305"
+, update =      "93.05 smid"
 }
 
 % see http://www.cs.auc.dk/icalp98/
 @inproceedings{cl-ptase-98
-, author =	"Artur Czumaj and Andrzej Lingas"
-, title =	"A Polynomial Time Approximation Scheme for {Euclidean} Minimum Cost {$k$}-Connectivity"
-, booktitle =	"Proc. 25th Internat. Colloq. Automata Lang. Prog."
-, nickname =	"ICALP '98"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	"??"
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"??"
-, update =	"98.03 mitchell"
-, annote =	"To appear, July 13-17 in Aalborg, Denmark"
+, author =      "Artur Czumaj and Andrzej Lingas"
+, title =       "A Polynomial Time Approximation Scheme for {Euclidean} Minimum Cost {$k$}-Connectivity"
+, booktitle =   "Proc. 25th Internat. Colloq. Automata Lang. Prog."
+, nickname =    "ICALP '98"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      "??"
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "??"
+, update =      "98.03 mitchell"
+, annote =      "To appear, July 13-17 in Aalborg, Denmark"
 }
 
 @techreport{csu-is-90
-, author =	"C. Czyzowicz and I. Stojmenovi{\'c} and J. Urrutia"
-, title =	"Immobilizing a shape"
-, number =	"rr 90/11-18"
-, institution =	"dept. d'informatique, univ. du qu{\'e}bec {\`a} hull"
-, year =	1990
-, precedes =	"csu-isp-91"
-, update =	"98.07 bibrelex"
+, author =      "C. Czyzowicz and I. Stojmenovi{\'c} and J. Urrutia"
+, title =       "Immobilizing a shape"
+, number =      "rr 90/11-18"
+, institution = "dept. d'informatique, univ. du qu{\'e}bec {\`a} hull"
+, year =        1990
+, precedes =    "csu-isp-91"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{csu-isp-91
-, author =	"C. Czyzowicz and I. Stojmenovi{\'c} and J. Urrutia"
-, title =	"Immobilizing a shape in the plane"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"41--45"
-, succeeds =	"csu-is-90"
-, cites =	"bfg-sptf-85, csu-is-90, e-acg-87, k-dwp-90, mnp-ogp-89, mss-esmpg-87, o-cgc9-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "C. Czyzowicz and I. Stojmenovi{\'c} and J. Urrutia"
+, title =       "Immobilizing a shape in the plane"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "41--45"
+, succeeds =    "csu-is-90"
+, cites =       "bfg-sptf-85, csu-is-90, e-acg-87, k-dwp-90, mnp-ogp-89, mss-esmpg-87, o-cgc9-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{c-ldfs-87
-, author =	"J. Czyzowicz"
-, title =	"Lattice Diagrams with Few Slopes"
-, number =	3
-, institution =	"Departement D'Informatique, University of Quebec at Hull"
-, year =	1987
-, keywords =	"graph drawing"
-, update =	"98.07 patrignani, 93.09 tamassia"
+, author =      "J. Czyzowicz"
+, title =       "Lattice Diagrams with Few Slopes"
+, number =      3
+, institution = "Departement D'Informatique, University of Quebec at Hull"
+, year =        1987
+, keywords =    "graph drawing"
+, update =      "98.07 patrignani, 93.09 tamassia"
 }
 
 @techreport{c-plsp-87
-, author =	"J. Czyzowicz"
-, title =	"Planar Lattices and the Slope Problem"
-, number =	4
-, institution =	"Departement D'Informatique, University of Quebec at Hull"
-, year =	1987
-, keywords =	"graph drawing"
-, update =	"98.07 patrignani, 93.09 tamassia"
+, author =      "J. Czyzowicz"
+, title =       "Planar Lattices and the Slope Problem"
+, number =      4
+, institution = "Departement D'Informatique, University of Quebec at Hull"
+, year =        1987
+, keywords =    "graph drawing"
+, update =      "98.07 patrignani, 93.09 tamassia"
 }
 
 @inproceedings{ceersstu-akp-91
-, author =	"J. Czyzowicz and P. Egyed and H. Everett and D. Rappaport and T. Shermer and D. Souvaine and G. Toussaint and J. Urrutia"
-, title =	"The aquarium keeper's problem"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, month =	jan
-, year =	1991
-, pages =	"459--464"
-, update =	"98.07 bibrelex"
+, author =      "J. Czyzowicz and P. Egyed and H. Everett and D. Rappaport and T. Shermer and D. Souvaine and G. Toussaint and J. Urrutia"
+, title =       "The aquarium keeper's problem"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, month =       jan
+, year =        1991
+, pages =       "459--464"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{cer-stpcba-94
-, author =	"J. Czyzowicz and H. Everett and J.-M. Robert"
-, title =	"Separating Translates in the Plane: Combinatorial Bounds and an Algorithm"
-, type =	"Report"
-, number =	"DIM-94-2"
-, institution =	"Universit\'e du Qu\'ebec \`a Chicoutimi"
-, address =	"Chicoutimi"
-, year =	1994
-, precedes =	"cer-stpcba-97"
-, update =	"98.11 devillers, 97.03 pocchiola"
+, author =      "J. Czyzowicz and H. Everett and J.-M. Robert"
+, title =       "Separating Translates in the Plane: Combinatorial Bounds and an Algorithm"
+, type =        "Report"
+, number =      "DIM-94-2"
+, institution = "Universit\'e du Qu\'ebec \`a Chicoutimi"
+, address =     "Chicoutimi"
+, year =        1994
+, precedes =    "cer-stpcba-97"
+, update =      "98.11 devillers, 97.03 pocchiola"
 }
 
 @article{cer-stpcba-97
-, author =	"J. Czyzowicz and H. Everett and J.-M. Robert"
-, title =	"Separating Translates in the Plane: Combinatorial Bounds and an Algorithm"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"551--562"
-, succeeds =	"cer-stpcba-94"
-, update =	"98.11 devillers"
+, author =      "J. Czyzowicz and H. Everett and J.-M. Robert"
+, title =       "Separating Translates in the Plane: Combinatorial Bounds and an Algorithm"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "551--562"
+, succeeds =    "cer-stpcba-94"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{chuz-peps-92
-, author =	"J. Czyzowicz and F. Hurtado and J. Urrutia and N. Zaguia"
-, title =	"On polygons enclosing point sets"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"132--136"
-, cites =	"e-acg-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "J. Czyzowicz and F. Hurtado and J. Urrutia and N. Zaguia"
+, title =       "On polygons enclosing point sets"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "132--136"
+, cites =       "e-acg-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ckku-drcig-97
-, author =	"Jurek Czyzowicz and Evangelos Kranakis and Danny Krizanc and Jorge Urrutia"
-, title =	"Discrete Realizations of Contact and Intersection Graphs"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"359--370"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Jurek Czyzowicz and Evangelos Kranakis and Danny Krizanc and Jorge Urrutia"
+, title =       "Discrete Realizations of Contact and Intersection Graphs"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "359--370"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{ckku-mlcni-96
-, author =	"J. Czyzowicz and E. Kranakis and D. Krizanc and J. Urrutia"
-, title =	"Maximal length common non-intersecting paths"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"185--189"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "J. Czyzowicz and E. Kranakis and D. Krizanc and J. Urrutia"
+, title =       "Maximal length common non-intersecting paths"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "185--189"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{cku-dttts-97
-, author =	"Jurek Czyzowicz and Evangelos Kranakis and Jorge Urrutia"
-, title =	"Domino Tilings and Two--by--Two Squares"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"25--32"
-, update =	"97.11 jones"
+, author =      "Jurek Czyzowicz and Evangelos Kranakis and Jorge Urrutia"
+, title =       "Domino Tilings and Two--by--Two Squares"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "25--32"
+, update =      "97.11 jones"
 }
 
 @techreport{cpr-dofs-87
-, author =	"J. Czyzowicz and A. Pelc and I. Rival"
-, title =	"Drawing Orders with Few Slopes"
-, number =	"TR-87-12"
-, institution =	"Department of Computer Science, University of Ottawa"
-, year =	1987
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Czyzowicz and A. Pelc and I. Rival"
+, title =       "Drawing Orders with Few Slopes"
+, number =      "TR-87-12"
+, institution = "Department of Computer Science, University of Ottawa"
+, year =        1987
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{cpr-poswt-87
-, author =	"J. Czyzowicz and A. Pelc and I. Rival"
-, title =	"Planar Ordered Sets of Width Two"
-, number =	"TR-87-31"
-, institution =	"Department of Computer Science, University of Ottawa"
-, year =	1987
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Czyzowicz and A. Pelc and I. Rival"
+, title =       "Planar Ordered Sets of Width Two"
+, number =      "TR-87-31"
+, institution = "Department of Computer Science, University of Ottawa"
+, year =        1987
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{cpru-cdfs-87
-, author =	"J. Czyzowicz and A. Pelc and I. Rival and J. Urrutia"
-, title =	"Crooked Diagrams with Few Slopes"
-, number =	"TR-87-26"
-, institution =	"Department of Computer Science, University of Ottawa"
-, year =	1987
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Czyzowicz and A. Pelc and I. Rival and J. Urrutia"
+, title =       "Crooked Diagrams with Few Slopes"
+, number =      "TR-87-26"
+, institution = "Department of Computer Science, University of Ottawa"
+, year =        1987
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{cru-glmfc-91
-, author =	"J. Czyzowicz and I. Rival and J. Urrutia"
-, title =	"Galleries and light matchings: {Fat} cooperative guards"
-, editor =	"R. A. Melter and A. Rosenfeld and P. Bhattacharya"
-, booktitle =	"Vision Geometry"
-, series =	"Contemporary Mathematics"
-, volume =	119
-, publisher =	"American Mathematical Society"
-, year =	1991
-, pages =	"21--28"
-, keywords =	"visibility, watchman problem"
-, update =	"99.11 bibrelex, 95.09 korneenko"
+, author =      "J. Czyzowicz and I. Rival and J. Urrutia"
+, title =       "Galleries and light matchings: {Fat} cooperative guards"
+, editor =      "R. A. Melter and A. Rosenfeld and P. Bhattacharya"
+, booktitle =   "Vision Geometry"
+, series =      "Contemporary Mathematics"
+, volume =      119
+, publisher =   "American Mathematical Society"
+, year =        1991
+, pages =       "21--28"
+, keywords =    "visibility, watchman problem"
+, update =      "99.11 bibrelex, 95.09 korneenko"
 }
 
 @inproceedings{cru-glmvg-89
-, author =	"J. Czyzowicz and I. Rival and J. Urrutia"
-, title =	"Galleries, light matchings and visibility graphs"
-, editor =	"F. Dehne and J.-R. Sack and N. Santoro"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"316--324"
-, update =	"99.11 bibrelex, 98.11 bibrelex"
+, author =      "J. Czyzowicz and I. Rival and J. Urrutia"
+, title =       "Galleries, light matchings and visibility graphs"
+, editor =      "F. Dehne and J.-R. Sack and N. Santoro"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "316--324"
+, update =      "99.11 bibrelex, 98.11 bibrelex"
 }
 
 @unpublished{crsuz-grag
-, author =	"J. Czyzowicz and E. Rivera-Campo and N. Santoro and J. Urrutia and J. Zaks"
-, title =	"Guarding rectangular art galleries"
-, note =	"to appear in Disc. Math."
-, succeeds =	"crsuz-grag-89"
-, update =	"99.07 bibrelex, 98.11 bibrelex"
+, author =      "J. Czyzowicz and E. Rivera-Campo and N. Santoro and J. Urrutia and J. Zaks"
+, title =       "Guarding rectangular art galleries"
+, note =        "to appear in Disc. Math."
+, succeeds =    "crsuz-grag-89"
+, update =      "99.07 bibrelex, 98.11 bibrelex"
 }
 
 @techreport{crsuz-grag-89
-, author =	"J. Czyzowicz and E. Rivera-Campo and N. Santoro and J. Urrutia and J. Zaks"
-, title =	"Guarding rectangular art galleries"
-, type =	"Technical Report"
-, number =	"89-27"
-, institution =	"Dept. Comput. Sci., Univ. of Ottawa"
-, year =	1989
-, note =	"to appear in {\em Discr. Applied Math.}"
-, precedes =	"crsuz-grag"
-, update =	"99.07 bibrelex, 98.11 bibrelex, 94.05 devillers"
+, author =      "J. Czyzowicz and E. Rivera-Campo and N. Santoro and J. Urrutia and J. Zaks"
+, title =       "Guarding rectangular art galleries"
+, type =        "Technical Report"
+, number =      "89-27"
+, institution = "Dept. Comput. Sci., Univ. of Ottawa"
+, year =        1989
+, note =        "to appear in {\em Discr. Applied Math.}"
+, precedes =    "crsuz-grag"
+, update =      "99.07 bibrelex, 98.11 bibrelex, 94.05 devillers"
 }
 
 @techreport{cru-irtp-89
-, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia"
-, title =	"Illuminating rectangles and triangles in the plane"
-, type =	"report"
-, number =	"TR-89-50"
-, institution =	"Department of Computer Science, University of Ottawa"
-, month =	dec
-, year =	1989
-, precedes =	"cru-irtp-93"
-, update =	"98.07 bibrelex"
+, author =      "J. Czyzowicz and E. Rivera-Campo and J. Urrutia"
+, title =       "Illuminating rectangles and triangles in the plane"
+, type =        "report"
+, number =      "TR-89-50"
+, institution = "Department of Computer Science, University of Ottawa"
+, month =       dec
+, year =        1989
+, precedes =    "cru-irtp-93"
+, update =      "98.07 bibrelex"
 }
 
 @article{cru-irtp-93
-, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia"
-, title =	"Illuminating rectangles and triangles in the plane"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	57
-, number =	1
-, year =	1993
-, pages =	"1--17"
-, succeeds =	"cru-irtp-89"
-, update =	"98.07 bibrelex, 94.05 devillers"
+, author =      "J. Czyzowicz and E. Rivera-Campo and J. Urrutia"
+, title =       "Illuminating rectangles and triangles in the plane"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      57
+, number =      1
+, year =        1993
+, pages =       "1--17"
+, succeeds =    "cru-irtp-89"
+, update =      "98.07 bibrelex, 94.05 devillers"
 }
 
 @inproceedings{cru-ofipt-93
-, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia"
-, title =	"Optimal floodlight illumination in polynomial time"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"393--398"
-, cites =	"bglosu-fp-93, c-ctpg-75, cru-irtp-93, crsuz-grag, f-icd-77, o-agta-87, ps-cgi-85, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "J. Czyzowicz and E. Rivera-Campo and J. Urrutia"
+, title =       "Optimal floodlight illumination in polynomial time"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "393--398"
+, cites =       "bglosu-fp-93, c-ctpg-75, cru-irtp-93, crsuz-grag, f-icd-77, o-agta-87, ps-cgi-85, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{cruz-gcs-90
-, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
-, title =	"Guarding convex sets"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"265--268"
-, note =	"to appear in {\em Graphs and Combinatorics}"
-, cites =	"b-slcmd-58, crsuz-grag-89, cru-irtp-93, cruz-ilcp-89, f-icd-77, o-agta-87, n-lbcmm-77, t-flg-47, uz-ics-89, ZZZ"
-, update =	"98.07 bibrelex, 94.05 devillers"
+, author =      "J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
+, title =       "Guarding convex sets"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "265--268"
+, note =        "to appear in {\em Graphs and Combinatorics}"
+, cites =       "b-slcmd-58, crsuz-grag-89, cru-irtp-93, cruz-ilcp-89, f-icd-77, o-agta-87, n-lbcmm-77, t-flg-47, uz-ics-89, ZZZ"
+, update =      "98.07 bibrelex, 94.05 devillers"
 }
 
 @techreport{cruz-igsp-90
-, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
-, title =	"Illuminating and guarding segments in the plane"
-, type =	"Technical Report"
-, number =	"RR 90/09-13"
-, institution =	"Dept. d'informatique, Univ. du Qu\'ebec \`a Hull"
-, year =	1990
-, note =	"to appear in {\em Geometriae Dedicata} [This is wrong!-JOR]"
-, update =	"98.03 orourke, 94.05 devillers"
+, author =      "J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
+, title =       "Illuminating and guarding segments in the plane"
+, type =        "Technical Report"
+, number =      "RR 90/09-13"
+, institution = "Dept. d'informatique, Univ. du Qu\'ebec \`a Hull"
+, year =        1990
+, note =        "to appear in {\em Geometriae Dedicata} [This is wrong!-JOR]"
+, update =      "98.03 orourke, 94.05 devillers"
 }
 
 @article{cruz-igsp-95
-, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
-, title =	"Illuminating and guarding segments in the plane"
-, journal =	"Discrete Math."
-, volume =	137
-, year =	1995
-, pages =	"147--153"
-, update =	"98.03 orourke"
+, author =      "J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
+, title =       "Illuminating and guarding segments in the plane"
+, journal =     "Discrete Math."
+, volume =      137
+, year =        1995
+, pages =       "147--153"
+, update =      "98.03 orourke"
 }
 
 @techreport{cruz-ilcp-89
-, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
-, title =	"Illuminating lines and circles in the plane"
-, type =	"Technical {Report}"
-, number =	"89-49"
-, institution =	"Univ. Ottawa"
-, address =	"Ottawa, Canada"
-, month =	dec
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
+, title =       "Illuminating lines and circles in the plane"
+, type =        "Technical {Report}"
+, number =      "89-49"
+, institution = "Univ. Ottawa"
+, address =     "Ottawa, Canada"
+, month =       dec
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @article{cruz-scsp-92
-, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
-, title =	"Separating convex sets in the plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"189--195"
-, succeeds =	"cruz-scsp-90"
+, author =      "J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
+, title =       "Separating convex sets in the plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "189--195"
+, succeeds =    "cruz-scsp-90"
 }
 
 @inproceedings{cruz-scsp-90
-, author =	"J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
-, title =	"Separating convex sets on the plane"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"50--54"
-, precedes =	"cruz-scsp-92"
-, cites =	"akp-cddsl-89, ers-ccsno-90, hk-spcs-90, t-sppcs-79, uz-ics-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "J. Czyzowicz and E. Rivera-Campo and J. Urrutia and J. Zaks"
+, title =       "Separating convex sets on the plane"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "50--54"
+, precedes =    "cruz-scsp-92"
+, cites =       "akp-cddsl-89, ers-ccsno-90, hk-spcs-90, t-sppcs-79, uz-ics-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{css-pip-96
-, author =	"J. Czyzowicz and I. Stojmenovic and T. Szymacha"
-, title =	"On a problem of immobilizing polygons"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"283--288"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "J. Czyzowicz and I. Stojmenovic and T. Szymacha"
+, title =       "On a problem of immobilizing polygons"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "283--288"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{csu-ip-91
-, author =	"J. Czyzowicz and I. Stojmenovi{\'c} and J. Urrutia"
-, title =	"Immobilizing a polytope"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"214--227"
-, keywords =	"polytopes"
+, author =      "J. Czyzowicz and I. Stojmenovi{\'c} and J. Urrutia"
+, title =       "Immobilizing a polytope"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "214--227"
+, keywords =    "polytopes"
 }
 
 @mastersthesis{d-hahsp-82
-, author =	"N. Dadoun"
-, title =	"Hierarchical Approaches to the Hidden Surface Problem"
-, school =	"Univ. British Columbia"
-, address =	"Vancouver, BC"
-, month =	dec
-, year =	1982
-, keywords =	"master thesis"
-, update =	"97.11 bibrelex"
+, author =      "N. Dadoun"
+, title =       "Hierarchical Approaches to the Hidden Surface Problem"
+, school =      "Univ. British Columbia"
+, address =     "Vancouver, BC"
+, month =       dec
+, year =        1982
+, keywords =    "master thesis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{dk-cssaa-89
-, author =	"N. Dadoun and D. G. Kirkpatrick"
-, title =	"Cooperative subdivision search algorithms with applications"
-, booktitle =	"Proc. 27th Allerton Conf. Commun. Control Comput."
-, year =	1989
-, pages =	"538--547"
-, update =	"93.05 devillers"
+, author =      "N. Dadoun and D. G. Kirkpatrick"
+, title =       "Cooperative subdivision search algorithms with applications"
+, booktitle =   "Proc. 27th Allerton Conf. Commun. Control Comput."
+, year =        1989
+, pages =       "538--547"
+, update =      "93.05 devillers"
 }
 
 @article{dk-pcsh-89
-, author =	"N. Dadoun and D. G. Kirkpatrick"
-, title =	"Parallel construction of subdivision hierarchies"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	39
-, year =	1989
-, pages =	"153--165"
-, succeeds =	"dk-ppess-87"
+, author =      "N. Dadoun and D. G. Kirkpatrick"
+, title =       "Parallel construction of subdivision hierarchies"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      39
+, year =        1989
+, pages =       "153--165"
+, succeeds =    "dk-ppess-87"
 }
 
 @inproceedings{dk-ppess-87
-, author =	"N. Dadoun and D. G. Kirkpatrick"
-, title =	"Parallel processing for efficient subdivision search"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"205--214"
-, keywords =	"parallel computation, graph theory, searching, point location, subdivisions"
-, precedes =	"dk-pcsh-89"
-, cites =	"acgoy-pcg-85, acgoy-pcg-88, ag-epsp-86i, cdh-p5cpg-87, cv-dctac-86i, dk-fdpi-82, dk-fdpi-83, dk-ladsc-85, dk-fappi-, eka-nplai-84, kw-fpami-84, k-osps-83, lm-bmcpg-78, l-spami-85, mr-ptcia-85, ph-chfsp-77, sh-cpp-75, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "N. Dadoun and D. G. Kirkpatrick"
+, title =       "Parallel processing for efficient subdivision search"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "205--214"
+, keywords =    "parallel computation, graph theory, searching, point location, subdivisions"
+, precedes =    "dk-pcsh-89"
+, cites =       "acgoy-pcg-85, acgoy-pcg-88, ag-epsp-86i, cdh-p5cpg-87, cv-dctac-86i, dk-fdpi-82, dk-fdpi-83, dk-ladsc-85, dk-fappi-, eka-nplai-84, kw-fpami-84, k-osps-83, lm-bmcpg-78, l-spami-85, mr-ptcia-85, ph-chfsp-77, sh-cpp-75, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{dkw-hahst-82
-, author =	"N. Dadoun and D. G. Kirkpatrick and J. P. Walsh"
-, title =	"Hierarchical approaches to hidden surface testing"
-, booktitle =	"Proc. Graphics Interface '82"
-, site =	"Toronto, ON"
-, year =	1982
-, pages =	"49--56"
-, keywords =	"data structuring, detection, visibility, hidden line/surface elimination, computer graphics"
+, author =      "N. Dadoun and D. G. Kirkpatrick and J. P. Walsh"
+, title =       "Hierarchical approaches to hidden surface testing"
+, booktitle =   "Proc. Graphics Interface '82"
+, site =        "Toronto, ON"
+, year =        1982
+, pages =       "49--56"
+, keywords =    "data structuring, detection, visibility, hidden line/surface elimination, computer graphics"
 }
 
 @techreport{dkw-hmbt-85
-, author =	"N. Dadoun and D. G. Kirkpatrick and J. P. Walsh"
-, title =	"Hierarchical Methods for Beam Tracing"
-, institution =	"??"
-, year =	1985
-, note =	"In Preparation"
-, update =	"97.11 bibrelex"
+, author =      "N. Dadoun and D. G. Kirkpatrick and J. P. Walsh"
+, title =       "Hierarchical Methods for Beam Tracing"
+, institution = "??"
+, year =        1985
+, note =        "In Preparation"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{dkw-gbt-85
-, author =	"N. Dadoun and D. G. Kirkpatrick and J. P. Walsh"
-, title =	"The geometry of beam tracing"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"55--61"
-, keywords =	"design of algorithms, computer graphics, intersection, hidden line/surface elimination, hierarchical representations"
-, cites =	"a-rtc-84, cd-diec-80, c-hgmvs-76, d-hahsp-82, dkw-hahst-82, dkw-hmbt-85, dk-fdpi-83, fkn-vsgpt-80, fag-nrtsd-83, g-ssfrt-84, hh-btpo-84, k-osps-83, ph-chfsp-77, r-rcms-82, rw-3drfr-80, sh-rpc-74, sss-cthsa-74, w-sdssr-79, wd-ddgsr-81, wd-wawwd-82, w-pcugr-80, wa-hsrup-77, w-iimsd-80, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "N. Dadoun and D. G. Kirkpatrick and J. P. Walsh"
+, title =       "The geometry of beam tracing"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "55--61"
+, keywords =    "design of algorithms, computer graphics, intersection, hidden line/surface elimination, hierarchical representations"
+, cites =       "a-rtc-84, cd-diec-80, c-hgmvs-76, d-hahsp-82, dkw-hahst-82, dkw-hmbt-85, dk-fdpi-83, fkn-vsgpt-80, fag-nrtsd-83, g-ssfrt-84, hh-btpo-84, k-osps-83, ph-chfsp-77, r-rcms-82, rw-3drfr-80, sh-rpc-74, sss-cthsa-74, w-sdssr-79, wd-ddgsr-81, wd-wawwd-82, w-pcugr-80, wa-hsrup-77, w-iimsd-80, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{d-fetow-01
-, author =	"Ovidiu Daescu"
-, title =	"From Experiments to Theory: Optimal Weighted Links"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"158--161"
-, update =	"01.04 icking"
+, author =      "Ovidiu Daescu"
+, title =       "From Experiments to Theory: Optimal Weighted Links"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "158--161"
+, update =      "01.04 icking"
 }
 
 @inproceedings{dlmv-ppglf-88
-, author =	"P. Dagum and M. Luby and M. Mihal and U. Vazirani"
-, title =	"Polytopes, permanents and graphs with large factors"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"412--421"
-, comments =	"To appear in Combinatorica as two papers"
+, author =      "P. Dagum and M. Luby and M. Mihal and U. Vazirani"
+, title =       "Polytopes, permanents and graphs with large factors"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "412--421"
+, comments =    "To appear in Combinatorica as two papers"
 }
 
 @book{dba-nm-74
-, author =	"G. Dahlquist and A. Bj{\"o}rk and N. Anderson"
-, title =	"Numerical Methods"
-, publisher =	"Prentice Hall"
-, year =	1974
-, update =	"97.11 bibrelex"
+, author =      "G. Dahlquist and A. Bj{\"o}rk and N. Anderson"
+, title =       "Numerical Methods"
+, publisher =   "Prentice Hall"
+, year =        1974
+, update =      "97.11 bibrelex"
 }
 
 @incollection{d-spqs-
-, author =	"W. Dahmen"
-, title =	"Smooth piecewise quadratic surfaces"
-, editor =	"T. Lyche and L. Schumaker"
-, booktitle =	"Mathematical Methods in CAGD"
-, publisher =	"??"
-, year =	"??"
-, update =	"98.07 bibrelex"
+, author =      "W. Dahmen"
+, title =       "Smooth piecewise quadratic surfaces"
+, editor =      "T. Lyche and L. Schumaker"
+, booktitle =   "Mathematical Methods in CAGD"
+, publisher =   "??"
+, year =        "??"
+, update =      "98.07 bibrelex"
 }
 
 @article{dak-rrdos-85
-, author =	"W.-M. Dai and Te. Asano and E. S. Kuh"
-, title =	"Routing region definition and ordering scheme for building block layout"
-, journal =	"IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
-, volume =	4
-, year =	1985
-, pages =	"189--197"
-, keywords =	"VLSI design, plane-sweep, design of algorithms, plane graph representation"
-, update =	"96.09 devillers"
+, author =      "W.-M. Dai and Te. Asano and E. S. Kuh"
+, title =       "Routing region definition and ordering scheme for building block layout"
+, journal =     "IEEE Trans. Comput.-Aided. Design Integr. Circuits Syst."
+, volume =      4
+, year =        1985
+, pages =       "189--197"
+, keywords =    "VLSI design, plane-sweep, design of algorithms, plane graph representation"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{dks-rrbs-91
-, author =	"W. W.-M. Dai and R. Kong and M. Sata"
-, title =	"Routability of a rubber-band sketch"
-, booktitle =	"Proc. 28th ACM-IEEE Design Automation Conf."
-, year =	1991
-, pages =	"45--48"
-, update =	"98.07 bibrelex"
+, author =      "W. W.-M. Dai and R. Kong and M. Sata"
+, title =       "Routability of a rubber-band sketch"
+, booktitle =   "Proc. 28th ACM-IEEE Design Automation Conf."
+, year =        1991
+, pages =       "45--48"
+, update =      "98.07 bibrelex"
 }
 
 @article{dkc-lmtsh-00
-, author =	"Y. Dai and N. Katoh and S.-W. Cheng"
-, title =	"{LMT}-skeleton heuristics for several classes of optimal triangulations"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	17
-, year =	2000
-, pages =	"51--68"
-, update =	"01.04 smid"
+, author =      "Y. Dai and N. Katoh and S.-W. Cheng"
+, title =       "{LMT}-skeleton heuristics for several classes of optimal triangulations"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      17
+, year =        2000
+, pages =       "51--68"
+, update =      "01.04 smid"
 }
 
 @inproceedings{delw-mmps-89
-, author =	"Paul Dale and Peter Eades and Xuemin Lin and Nicolas C. Wormald"
-, title =	"Measuring motion planning strategies"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	8
-, update =	"98.07 bibrelex"
+, author =      "Paul Dale and Peter Eades and Xuemin Lin and Nicolas C. Wormald"
+, title =       "Measuring motion planning strategies"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       8
+, update =      "98.07 bibrelex"
 }
 
 @article{d-gcpcg-89
-, author =	"P. Damaschke"
-, title =	"The {Hamiltonian} circuit problem for circle graphs is {NP}-complete"
-, journal =	"Inform. Process. Lett."
-, volume =	32
-, number =	1
-, year =	1989
-, pages =	"1--2"
-, keywords =	"geometric graphs, NP-completeness"
-, update =	"95.09 korneenko"
+, author =      "P. Damaschke"
+, title =       "The {Hamiltonian} circuit problem for circle graphs is {NP}-complete"
+, journal =     "Inform. Process. Lett."
+, volume =      32
+, number =      1
+, year =        1989
+, pages =       "1--2"
+, keywords =    "geometric graphs, NP-completeness"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{df-obpps-92p
-, author =	"F. d'Amore and P. G. Franciosa"
-, title =	"On the optimal binary plane partition for sets of isothetic rectangles"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"1--5"
-, precedes =	"df-obpps-92j"
-, cites =	"fkn-vsgpt-80, m-pst-85, py-bpahs-89, py-obspo-90t, ps-cgi-85, vw-rlsil-82, ZZZ"
-, update =	"98.07 bibrelex, 94.05 franciosa"
+, author =      "F. d'Amore and P. G. Franciosa"
+, title =       "On the optimal binary plane partition for sets of isothetic rectangles"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "1--5"
+, precedes =    "df-obpps-92j"
+, cites =       "fkn-vsgpt-80, m-pst-85, py-bpahs-89, py-obspo-90t, ps-cgi-85, vw-rlsil-82, ZZZ"
+, update =      "98.07 bibrelex, 94.05 franciosa"
 }
 
 @article{df-obpps-92j
-, author =	"F. d'Amore and P. G. Franciosa"
-, title =	"On the optimal binary plane partition for sets of isothetic rectangles"
-, journal =	"Inform. Process. Lett."
-, volume =	44
-, year =	1992
-, pages =	"255--259"
-, succeeds =	"df-obpps-92p"
-, update =	"94.05 franciosa"
+, author =      "F. d'Amore and P. G. Franciosa"
+, title =       "On the optimal binary plane partition for sets of isothetic rectangles"
+, journal =     "Inform. Process. Lett."
+, volume =      44
+, year =        1992
+, pages =       "255--259"
+, succeeds =    "df-obpps-92p"
+, update =      "94.05 franciosa"
 }
 
 @inproceedings{df-ssh-90
-, author =	"F. d'Amore and P. G. Franciosa"
-, title =	"Separating sets of hyperrectangles"
-, booktitle =	"Proc. 15th Internat. Sympos. Math. Found. Comput. Sci."
-, nickname =	"MFCS '90"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	452
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"165--172"
-, keywords =	"$d$-dimensional, hyperrectangle, separation"
-, precedes =	"df-ssh-93"
-, update =	"98.07 bibrelex, 97.11 bibrelex, 94.05 franciosa"
+, author =      "F. d'Amore and P. G. Franciosa"
+, title =       "Separating sets of hyperrectangles"
+, booktitle =   "Proc. 15th Internat. Sympos. Math. Found. Comput. Sci."
+, nickname =    "MFCS '90"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      452
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "165--172"
+, keywords =    "$d$-dimensional, hyperrectangle, separation"
+, precedes =    "df-ssh-93"
+, update =      "98.07 bibrelex, 97.11 bibrelex, 94.05 franciosa"
 }
 
 @article{df-ssh-93
-, author =	"F. d'Amore and P. G. Franciosa"
-, title =	"Separating sets of hyperrectangles"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, number =	2
-, year =	1993
-, pages =	"155--165"
-, keywords =	"rectangles, separator, binary space partition"
-, succeeds =	"df-ssh-90"
-, update =	"94.05 franciosa"
-, annote =	"Pictures are missing. They appeared on Internat. J. Comput.
-			Geom. Appl., volume 3, number 3, 1993, page 345"
+, author =      "F. d'Amore and P. G. Franciosa"
+, title =       "Separating sets of hyperrectangles"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, number =      2
+, year =        1993
+, pages =       "155--165"
+, keywords =    "rectangles, separator, binary space partition"
+, succeeds =    "df-ssh-90"
+, update =      "94.05 franciosa"
+, annote =      "Pictures are missing. They appeared on Internat. J. Comput.
+                        Geom. Appl., volume 3, number 3, 1993, page 345"
 }
 
 @inproceedings{afgt-mmbu-97
-, author =	"F. d'Amore and P. G. Franciosa and R. Giaccio and M. Talamo"
-, title =	"Maintaining Maxima under Boundary Updates"
-, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1203
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"100--109"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "F. d'Amore and P. G. Franciosa and R. Giaccio and M. Talamo"
+, title =       "Maintaining Maxima under Boundary Updates"
+, booktitle =   "Algorithms and Complexity (Proc. CIAC' 97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1203
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "100--109"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{afl-rracg-98
-, author =	"F. d'Amore and P. G. Franciosa and G. Liotta"
-, title =	"A Robust Region Approach to the Computation of Geometric Graphs"
-, editor =	"G. Bilardi and G. F. Italiano and A. Pietracaprina and G. Pucci"
-, booktitle =	"Algorithms -- ESA~'98"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1461
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"175--186"
-, succeeds =	"dfl-rcems-98"
-, update =	"99.07 vismara"
+, author =      "F. d'Amore and P. G. Franciosa and G. Liotta"
+, title =       "A Robust Region Approach to the Computation of Geometric Graphs"
+, editor =      "G. Bilardi and G. F. Italiano and A. Pietracaprina and G. Pucci"
+, booktitle =   "Algorithms -- ESA~'98"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1461
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "175--186"
+, succeeds =    "dfl-rcems-98"
+, update =      "99.07 vismara"
 }
 
 @inproceedings{dfl-rcems-98
-, author =	"Fabrizio d'Amore and Paolo G. Franciosa and Guiseppe Liotta"
-, title =	"Robust Computation of {Euclidean} Minimum Spanning Trees"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"29--31"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Fabrizio d'Amore and Paolo G. Franciosa and Guiseppe Liotta"
+, title =       "Robust Computation of {Euclidean} Minimum Spanning Trees"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "29--31"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{dghm-mrcgc-98
-, author =	"J. C. Dana and C. I. Grima and F. Hurtado and A. M{\'a}rquez"
-, title =	"More Results on Computational Geometry on the Cylinder"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"61--63"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "J. C. Dana and C. I. Grima and F. Hurtado and A. M{\'a}rquez"
+, title =       "More Results on Computational Geometry on the Cylinder"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "61--63"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{dgm-chnps-97
-, author =	"J. C. Dana and C. I. Grima and A. M{\'a}rquez"
-, title =	"Convex Hull in Non-Planar Surfaces"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"39--41"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "J. C. Dana and C. I. Grima and A. M{\'a}rquez"
+, title =       "Convex Hull in Non-Planar Surfaces"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "39--41"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{dk-rtdpm-78
-, author =	"J. Danaraj and V. Klee"
-, title =	"A representation of two-dimensional pseudo-manifolds and its use in the design of a linear time sheling algorithm"
-, journal =	"Ann. Discrete Math."
-, volume =	2
-, year =	1978
-, update =	"98.07 bibrelex"
+, author =      "J. Danaraj and V. Klee"
+, title =       "A representation of two-dimensional pseudo-manifolds and its use in the design of a linear time sheling algorithm"
+, journal =     "Ann. Discrete Math."
+, volume =      2
+, year =        1978
+, update =      "98.07 bibrelex"
 }
 
 @incollection{d-rddca-90
-, author =	"J. Dangermond"
-, title =	"A Review of Digital Data Commonly Available and some of the Practical Problems of Entering them into a GIS"
-, editor =	"D. J. Peuquet and D. F. Marble"
-, booktitle =	"Introductory Readings in Geographic Information Systems"
-, publisher =	"Tayler \& Francis"
-, address =	"London"
-, year =	1990
-, pages =	"222--232"
-, update =	"96.09 kreveld"
+, author =      "J. Dangermond"
+, title =       "A Review of Digital Data Commonly Available and some of the Practical Problems of Entering them into a GIS"
+, editor =      "D. J. Peuquet and D. F. Marble"
+, booktitle =   "Introductory Readings in Geographic Information Systems"
+, publisher =   "Tayler \& Francis"
+, address =     "London"
+, year =        1990
+, pages =       "222--232"
+, update =      "96.09 kreveld"
 }
 
 @phdthesis{d-canpa-95
-, author =	"K. Daniels"
-, title =	"Containment algorithms for nonconvex polygons with applications to layout"
-, type =	"Ph.{D}. Thesis"
-, school =	"Harvard University"
-, address =	"Cambridge, MA"
-, year =	1995
-, url =	"ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
-, keywords =	"doctoral thesis, concave, polygons, packing, nesting, placement, optimization, enclosure, Minkowski sum, configuration space"
-, comments =	"is also Harvard DAS TechReport number: 12-95"
-, update =	"97.03 daniels"
+, author =      "K. Daniels"
+, title =       "Containment algorithms for nonconvex polygons with applications to layout"
+, type =        "Ph.{D}. Thesis"
+, school =      "Harvard University"
+, address =     "Cambridge, MA"
+, year =        1995
+, url = "ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
+, keywords =    "doctoral thesis, concave, polygons, packing, nesting, placement, optimization, enclosure, Minkowski sum, configuration space"
+, comments =    "is also Harvard DAS TechReport number: 12-95"
+, update =      "97.03 daniels"
 }
 
 @inproceedings{dm-cbspu-96
-, author =	"K. Daniels and V. Milenkovic"
-, title =	"Column-based strip packing using ordered and compliant containment"
-, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
-, year =	1996
-, pages =	"33--38"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"layout, nesting, placement, Minkowski sum, configuration space"
-, comments =	"to appear in Lecture Notes in Computer Science; submitted to
-		  Internat. J. Comput. Geom. Appl."
-, update =	"97.03 daniels"
+, author =      "K. Daniels and V. Milenkovic"
+, title =       "Column-based strip packing using ordered and compliant containment"
+, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
+, year =        1996
+, pages =       "33--38"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "layout, nesting, placement, Minkowski sum, configuration space"
+, comments =    "to appear in Lecture Notes in Computer Science; submitted to
+                  Internat. J. Comput. Geom. Appl."
+, update =      "97.03 daniels"
 }
 
 @inproceedings{dm-lg-94
-, author =	"K. Daniels and V. Milenkovic"
-, title =	"Limited Gaps"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"225--230"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"layout, packing, nesting, placement, reachability, Minkowski sum, configuration space, decomposition"
-, cites =	"dmr-fmaap-93, f-savd-87, l-tdvdl-80, lm-ccp-93, ZZZ"
-, update =	"98.11 bibrelex, 97.03 daniels, 94.09 jones"
+, author =      "K. Daniels and V. Milenkovic"
+, title =       "Limited Gaps"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "225--230"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "layout, packing, nesting, placement, reachability, Minkowski sum, configuration space, decomposition"
+, cites =       "dmr-fmaap-93, f-savd-87, l-tdvdl-80, lm-ccp-93, ZZZ"
+, update =      "98.11 bibrelex, 97.03 daniels, 94.09 jones"
 }
 
 @inproceedings{dm-mtcae-95
-, author =	"Karen Daniels and Victor Milenkovic"
-, title =	"Multiple Translational Containment: {Approximate} and Exact Algorithms"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"205--214"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"packing, layout, placement, nesting, Minkowski sum, configuration space"
-, update =	"97.03 daniels, 96.09 agarwal, 96.05 mitchell"
+, author =      "Karen Daniels and Victor Milenkovic"
+, title =       "Multiple Translational Containment: {Approximate} and Exact Algorithms"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "205--214"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "packing, layout, placement, nesting, Minkowski sum, configuration space"
+, update =      "97.03 daniels, 96.09 agarwal, 96.05 mitchell"
 }
 
 @techreport{dml-mcm-94
-, author =	"K. Daniels and V. Milenkovic and Z. Li"
-, title =	"Multiple containment methods"
-, type =	"Technical {Report}"
-, number =	"12-94"
-, institution =	"Center for Research in Computing Technology, Division of Applied Sciences, Harvard University"
-, address =	"Cambridge, MA"
-, year =	1994
-, url =	"ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
-, keywords =	"polygons, concave, packing, layout, nesting, placement, mixed integer programming, Minkowski sum, configuration space"
-, update =	"97.03 daniels"
+, author =      "K. Daniels and V. Milenkovic and Z. Li"
+, title =       "Multiple containment methods"
+, type =        "Technical {Report}"
+, number =      "12-94"
+, institution = "Center for Research in Computing Technology, Division of Applied Sciences, Harvard University"
+, address =     "Cambridge, MA"
+, year =        1994
+, url = "ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
+, keywords =    "polygons, concave, packing, layout, nesting, placement, mixed integer programming, Minkowski sum, configuration space"
+, update =      "97.03 daniels"
 }
 
 @article{dmr-flaap-97
-, author =	"K. Daniels and V. Milenkovic and D. Roth"
-, title =	"Finding the largest area axis-parallel rectangle in a polygon"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"125--148"
-, url =	"http://www.cs.bc.edu/~daniels"
-, keywords =	"optimization, monotone matrices, polygons, inclusion"
-, succeeds =	"dmr-fmaap-93"
-, update =	"97.11 bibrelex, 97.03 daniels"
+, author =      "K. Daniels and V. Milenkovic and D. Roth"
+, title =       "Finding the largest area axis-parallel rectangle in a polygon"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "125--148"
+, url = "http://www.cs.bc.edu/~daniels"
+, keywords =    "optimization, monotone matrices, polygons, inclusion"
+, succeeds =    "dmr-fmaap-93"
+, update =      "97.11 bibrelex, 97.03 daniels"
 }
 
 @techreport{dmr-flrsc-95
-, author =	"K. Daniels and V. Milenkovic and D. Roth"
-, title =	"Finding the largest rectangle in several classes of polygons"
-, type =	"Technical {Report}"
-, number =	"22-95"
-, institution =	"Center for Research in Computing Technology, Division of Applied Sciences, Harvard University"
-, address =	"Cambridge, MA"
-, year =	1995
-, url =	"ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
-, keywords =	"optimization, monotone matrices, polygons, inclusion"
-, comments =	"to appear in Computational Geometry, Theory and
-		  Applications"
-, update =	"97.03 daniels"
+, author =      "K. Daniels and V. Milenkovic and D. Roth"
+, title =       "Finding the largest rectangle in several classes of polygons"
+, type =        "Technical {Report}"
+, number =      "22-95"
+, institution = "Center for Research in Computing Technology, Division of Applied Sciences, Harvard University"
+, address =     "Cambridge, MA"
+, year =        1995
+, url = "ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
+, keywords =    "optimization, monotone matrices, polygons, inclusion"
+, comments =    "to appear in Computational Geometry, Theory and
+                  Applications"
+, update =      "97.03 daniels"
 }
 
 @inproceedings{dmr-fmaap-93
-, author =	"K. Daniels and V. Milenkovic and D. Roth"
-, title =	"Finding the maximum area axis-parallel rectangle in a polygon"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"322--327"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"optimization, monotone matrices, polygons, inclusion"
-, precedes =	"dmr-flaap -97"
-, cites =	"akmsw-gamsa-87, as-facle-87, aw-cg-88, c-tsplt-90i, cdl-cler-86, kk-altag-90, mos-fmrio-85, mdl-amm-91, mdl-pcnpc-92, ow-rv-88, ps-cgi-85, srw-gsv-cccg-91, nhl-merp-84, wy-ocsp-88, ZZZ"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 97.03 daniels+devillers, 93.09 milone+mitchell"
+, author =      "K. Daniels and V. Milenkovic and D. Roth"
+, title =       "Finding the maximum area axis-parallel rectangle in a polygon"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "322--327"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "optimization, monotone matrices, polygons, inclusion"
+, precedes =    "dmr-flaap -97"
+, cites =       "akmsw-gamsa-87, as-facle-87, aw-cg-88, c-tsplt-90i, cdl-cler-86, kk-altag-90, mos-fmrio-85, mdl-amm-91, mdl-pcnpc-92, ow-rv-88, ps-cgi-85, srw-gsv-cccg-91, nhl-merp-84, wy-ocsp-88, ZZZ"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 97.03 daniels+devillers, 93.09 milone+mitchell"
 }
 
 @inproceedings{dm-dbstl-96
-, author =	"K. Daniels and V. J. Milenkovic"
-, title =	"Distance-based subdivision for translational {LP} containment"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"196--201"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"concave, polygons, decomposition"
-, update =	"97.03 agarwal+daniels, 96.09 mitchell"
+, author =      "K. Daniels and V. J. Milenkovic"
+, title =       "Distance-based subdivision for translational {LP} containment"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "196--201"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "concave, polygons, decomposition"
+, update =      "97.03 agarwal+daniels, 96.09 mitchell"
 }
 
 @article{dm-mtcp1-97
-, author =	"K. Daniels and V. J. Milenkovic"
-, title =	"Multiple Translational Containment, Part I: An Approximate Algorithm"
-, journal =	"Algorithmica"
-, volume =	19
-, number =	"1--2"
-, month =	sep
-, year =	1997
-, pages =	"148--182"
-, update =	"98.07 bibrelex, 97.07 held"
+, author =      "K. Daniels and V. J. Milenkovic"
+, title =       "Multiple Translational Containment, Part I: An Approximate Algorithm"
+, journal =     "Algorithmica"
+, volume =      19
+, number =      "1--2"
+, month =       sep
+, year =        1997
+, pages =       "148--182"
+, update =      "98.07 bibrelex, 97.07 held"
 }
 
 @article{d-ccs2c-52
-, author =	"M. E. Daniels"
-, title =	"The covering circle of a sample from $2$ circular normal distribution"
-, journal =	"Biometrika"
-, volume =	39
-, year =	1952
-, pages =	"137--143"
+, author =      "M. E. Daniels"
+, title =       "The covering circle of a sample from $2$ circular normal distribution"
+, journal =     "Biometrika"
+, volume =      39
+, year =        1952
+, pages =       "137--143"
 }
 
 @article{dt-edsar-90
-, author =	"H. H. Dannelongue and P. A. Tanguy"
-, title =	"Efficient Data-Structures for Adaptive Remeshing with the {FEM}"
-, journal =	"J. Comput. Phys."
-, volume =	91
-, number =	1
-, year =	1990
-, pages =	"94--109"
-, annote =	"Advancing front method. To build a new triangle on an
-		 edge, find closest point to the third vertex of an
-		 equilateral triangle. $x$ and $y$ binary trees are used
-		 to speed the search."
+, author =      "H. H. Dannelongue and P. A. Tanguy"
+, title =       "Efficient Data-Structures for Adaptive Remeshing with the {FEM}"
+, journal =     "J. Comput. Phys."
+, volume =      91
+, number =      1
+, year =        1990
+, pages =       "94--109"
+, annote =      "Advancing front method. To build a new triangle on an
+                 edge, find closest point to the third vertex of an
+                 equilateral triangle. $x$ and $y$ binary trees are used
+                 to speed the search."
 }
 
 @inproceedings{dh-favrt-92
-, author =	"John Danskin and Pat Hanrahan"
-, title =	"Fast Algorithms for Volume Ray Tracing"
-, booktitle =	"1992 Workshop on Volume Visualization"
-, year =	1992
-, pages =	"91--98"
-, update =	"98.03 agarwal"
+, author =      "John Danskin and Pat Hanrahan"
+, title =       "Fast Algorithms for Volume Ray Tracing"
+, booktitle =   "1992 Workshop on Volume Visualization"
+, year =        1992
+, pages =       "91--98"
+, update =      "98.03 agarwal"
 }
 
 @book{d-lpe-63
-, author =	"G. B. Dantzig"
-, title =	"Linear Programming and Extensions"
-, publisher =	"Princeton University Press"
-, address =	"Princeton, NJ"
-, year =	1963
+, author =      "G. B. Dantzig"
+, title =       "Linear Programming and Extensions"
+, publisher =   "Princeton University Press"
+, address =     "Princeton, NJ"
+, year =        1963
 }
 
 @article{dow-gsmml-55
-, author =	"G. B. Dantzig and A. Orden and P. Wolfe"
-, title =	"The generalized simplex method for minimizing a linear form under linear inequality restrictions"
-, journal =	"Pacific J. Math."
-, volume =	5
-, year =	1955
-, pages =	"183--195"
-, update =	"98.03 bibrelex"
+, author =      "G. B. Dantzig and A. Orden and P. Wolfe"
+, title =       "The generalized simplex method for minimizing a linear form under linear inequality restrictions"
+, journal =     "Pacific J. Math."
+, volume =      5
+, year =        1955
+, pages =       "183--195"
+, update =      "98.03 bibrelex"
 }
 
 @article{dg-ipbr-82
-, author =	"L. Danzer and B. Gr{\"u}nbaum"
-, title =	"Intersection properties of boxes in {$R^{n}$}"
-, journal =	"Combinatorica"
-, volume =	2
-, number =	3
-, year =	1982
-, pages =	"237--246"
-, update =	"97.11 bibrelex"
+, author =      "L. Danzer and B. Gr{\"u}nbaum"
+, title =       "Intersection properties of boxes in {$R^{n}$}"
+, journal =     "Combinatorica"
+, volume =      2
+, number =      3
+, year =        1982
+, pages =       "237--246"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{dgk-htir-63
-, author =	"Ludwig Danzer and Branko Gr{\"u}nbaum and Victor Klee"
-, title =	"Helly's Theorem and its Relatives"
-, booktitle =	"Convexity"
-, series =	"Proc. Symp. Pure Math."
-, volume =	7
-, publisher =	"American Mathematical Society"
-, address =	"Providence"
-, year =	1963
-, pages =	"101--180"
-, update =	"98.03 bibrelex, 95.09 wenger"
+, author =      "Ludwig Danzer and Branko Gr{\"u}nbaum and Victor Klee"
+, title =       "Helly's Theorem and its Relatives"
+, booktitle =   "Convexity"
+, series =      "Proc. Symp. Pure Math."
+, volume =      7
+, publisher =   "American Mathematical Society"
+, address =     "Providence"
+, year =        1963
+, pages =       "101--180"
+, update =      "98.03 bibrelex, 95.09 wenger"
 }
 
 @article{dll-udleu-57
-, author =	"L. Danzer and D. Laugwitz and H. Lenz"
-, title =	"{\"U}ber das {L{\"o}wnersche} {Ellipsoid} und sein {Analogon} unter den einem {Eik{\"o}rper} eingeschriebenen {Ellipsoiden}"
-, journal =	"Arch. Math."
-, volume =	8
-, year =	1957
-, pages =	"214--219"
-, update =	"97.11 bibrelex"
+, author =      "L. Danzer and D. Laugwitz and H. Lenz"
+, title =       "{\"U}ber das {L{\"o}wnersche} {Ellipsoid} und sein {Analogon} unter den einem {Eik{\"o}rper} eingeschriebenen {Ellipsoiden}"
+, journal =     "Arch. Math."
+, volume =      8
+, year =        1957
+, pages =       "214--219"
+, update =      "97.11 bibrelex"
 }
 
 % Bernierd June 1986
 @inproceedings{dhrt-cisgm-87
-, author =	"M. Dao and M. Habib and J. Richard and D. Tallot"
-, title =	"{CABRI} an Interactive System for Graph Manipulation"
-, editor =	"G. Tinhofer and G. Schmidt"
-, booktitle =	"Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	246
-, publisher =	"Springer-Verlag"
-, year =	1987
-, pages =	"58--67"
-, keywords =	"graph drawing"
-, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
+, author =      "M. Dao and M. Habib and J. Richard and D. Tallot"
+, title =       "{CABRI} an Interactive System for Graph Manipulation"
+, editor =      "G. Tinhofer and G. Schmidt"
+, booktitle =   "Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      246
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "58--67"
+, keywords =    "graph drawing"
+, update =      "99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
 }
 
 @article{dkn-pacps-87
-, author =	"F. Darema and S. Kirkpatrick and V. A. Norton"
-, title =	"Parallel algorithms for chip placement by simulated annealing"
-, journal =	"IBM J. Res. Develop."
-, volume =	31
-, year =	1987
-, pages =	"391--402"
+, author =      "F. Darema and S. Kirkpatrick and V. A. Norton"
+, title =       "Parallel algorithms for chip placement by simulated annealing"
+, journal =     "IBM J. Res. Develop."
+, volume =      31
+, year =        1987
+, pages =       "391--402"
 }
 
 @phdthesis{d-ascg-90
-, author =	"G. Das"
-, title =	"Approximation schemes in computational geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"University of Wisconsin"
-, year =	1990
-, keywords =	"doctoral thesis"
+, author =      "G. Das"
+, title =       "Approximation schemes in computational geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "University of Wisconsin"
+, year =        1990
+, keywords =    "doctoral thesis"
 }
 
 @inproceedings{d-vgcbd-97
-, author =	"Gautam Das"
-, title =	"The Visibility Graph Contains a Bounded-Degree Spanner"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"70--75"
-, update =	"97.11 jones"
+, author =      "Gautam Das"
+, title =       "The Visibility Graph Contains a Bounded-Degree Spanner"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "70--75"
+, update =      "97.11 jones"
 }
 
 @inproceedings{dg-caitd-95
-, author =	"Gautam Das and Michael T. Goodrich"
-, title =	"On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"74--85"
-, keywords =	"graph drawing, 3D, convex, polyhedron"
-, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell+tamassia"
+, author =      "Gautam Das and Michael T. Goodrich"
+, title =       "On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "74--85"
+, keywords =    "graph drawing, 3D, convex, polyhedron"
+, update =      "99.07 bibrelex, 96.01 smid, 95.05 mitchell+tamassia"
 }
 
 @techreport{dg-ocop3-97t
-, author =	"G. Das and M. T. Goodrich"
-, title =	"On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees"
-, type =	"Research {Report}"
-, institution =	"Center for Geometric Computing"
-, address =	"Johns Hopkins Univ."
-, year =	1997
-, update =	"98.03 smid, 97.03 tamassia"
+, author =      "G. Das and M. T. Goodrich"
+, title =       "On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees"
+, type =        "Research {Report}"
+, institution = "Center for Geometric Computing"
+, address =     "Johns Hopkins Univ."
+, year =        1997
+, update =      "98.03 smid, 97.03 tamassia"
 }
 
 @article{dg-ocop3-97a
-, author =	"G. Das and M. T. Goodrich"
-, title =	"On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"123--137"
-, update =	"98.03 smid"
+, author =      "G. Das and M. T. Goodrich"
+, title =       "On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "123--137"
+, update =      "98.03 smid"
 }
 
 @techreport{dgr-tdcgd-94
-, author =	"G. Das and M. T. Goodrich and K. Ramayier"
-, title =	"Three-Dimensional Convex Graph Drawing"
-, type =	"Technical {Report}"
-, institution =	"Dept. of Computer Sci., Johns Hopkins Univ."
-, year =	1994
-, keywords =	"graph drawing, 3D, convex, straight-line"
-, update =	"96.09 tamassia"
+, author =      "G. Das and M. T. Goodrich and K. Ramayier"
+, title =       "Three-Dimensional Convex Graph Drawing"
+, type =        "Technical {Report}"
+, institution = "Dept. of Computer Sci., Johns Hopkins Univ."
+, year =        1994
+, keywords =    "graph drawing, 3D, convex, straight-line"
+, update =      "96.09 tamassia"
 }
 
 @techreport{dgm-fsts-96
-, author =	"G. Das and D. Gunopulos and H. Mannila"
-, title =	"Finding similar time series"
-, institution =	"??"
-, year =	1996
-, note =	"Manuscript"
-, update =	"98.07 bibrelex"
+, author =      "G. Das and D. Gunopulos and H. Mannila"
+, title =       "Finding similar time series"
+, institution = "??"
+, year =        1996
+, note =        "Manuscript"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{dhn-fwvcp-93
-, author =	"G. Das and P. Heffernan and G. Narasimhan"
-, title =	"Finding all weakly-visible chords of a polygon in linear time"
-, type =	"Manuscript"
-, institution =	"Memphis State University"
-, year =	1993
-, precedes =	"dhn-fwvcp-94"
-, update =	"99.07 bibrelex, 98.03 bibrelex"
+, author =      "G. Das and P. Heffernan and G. Narasimhan"
+, title =       "Finding all weakly-visible chords of a polygon in linear time"
+, type =        "Manuscript"
+, institution = "Memphis State University"
+, year =        1993
+, precedes =    "dhn-fwvcp-94"
+, update =      "99.07 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{dhn-lvp-93
-, author =	"G. Das and P. Heffernan and G. Narasimhan"
-, title =	"{LR}-Visibility in Polygons"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"303--308"
-, precedes =	"dhn-lvp-97"
-, cites =	"at-oadvp-81, c-tsplt-91a, cg-vippg-89, dhn-fwvcp-93, ghlst-ltavs-87, h-oatgp-93, ik-tgp-91, k-dwvsp-88, ss-oadwv-90, tl-tgwsp-93, ZZZ"
-, update =	"98.11 bibrelex, 98.07 icking, 97.03 devillers, 93.09 milone+mitchell"
+, author =      "G. Das and P. Heffernan and G. Narasimhan"
+, title =       "{LR}-Visibility in Polygons"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "303--308"
+, precedes =    "dhn-lvp-97"
+, cites =       "at-oadvp-81, c-tsplt-91a, cg-vippg-89, dhn-fwvcp-93, ghlst-ltavs-87, h-oatgp-93, ik-tgp-91, k-dwvsp-88, ss-oadwv-90, tl-tgwsp-93, ZZZ"
+, update =      "98.11 bibrelex, 98.07 icking, 97.03 devillers, 93.09 milone+mitchell"
 }
 
 @article{dhn-lvp-97
-, author =	"G. Das and P. Heffernan and G. Narasimhan"
-, title =	"{LR}-Visibility in Polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"37--57"
-, succeeds =	"dhn-lvp-93"
-, update =	"98.07 icking, 97.03 devillers"
+, author =      "G. Das and P. Heffernan and G. Narasimhan"
+, title =       "{LR}-Visibility in Polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "37--57"
+, succeeds =    "dhn-lvp-93"
+, update =      "98.07 icking, 97.03 devillers"
 }
 
 @inproceedings{dhn-oss3d-93
-, author =	"G. Das and P. Heffernan and G. Narasimhan"
-, title =	"Optimally sparse spanners in $3$-dimensional {Euclidean} space"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"53--62"
-, cites =	"addjs-sswg-93, cdns-nsrgs-92, dj-wtacg-89, ll-tapga-89, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "G. Das and P. Heffernan and G. Narasimhan"
+, title =       "Optimally sparse spanners in $3$-dimensional {Euclidean} space"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "53--62"
+, cites =       "addjs-sswg-93, cdns-nsrgs-92, dj-wtacg-89, ll-tapga-89, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @inproceedings{dh-cd3so-93
-, author =	"Gautam Das and Paul J. Heffernan"
-, title =	"Constructing Degree-$3$ Spanners with other Sparseness Properties"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"11--20"
-, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Gautam Das and Paul J. Heffernan"
+, title =       "Constructing Degree-$3$ Spanners with other Sparseness Properties"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "11--20"
+, update =      "98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @article{dh-cd3so-96
-, author =	"G. Das and P. J. Heffernan"
-, title =	"Constructing degree-$3$ spanners with other sparseness properties"
-, journal =	"Internat. J. Found. Comput. Sci."
-, volume =	7
-, year =	1996
-, pages =	"121--135"
-, update =	"98.11 smid"
+, author =      "G. Das and P. J. Heffernan"
+, title =       "Constructing degree-$3$ spanners with other sparseness properties"
+, journal =     "Internat. J. Found. Comput. Sci."
+, volume =      7
+, year =        1996
+, pages =       "121--135"
+, update =      "98.11 smid"
 }
 
 @article{dhn-fwvcp-94
-, author =	"G. Das and P. J. Heffernan and G. Narasimhan"
-, title =	"Finding All Weakly-Visible Chords of a Polygon in Linear Time"
-, journal =	"Nordic J. Comput."
-, volume =	1
-, year =	1994
-, pages =	"433--457"
-, succeeds =	"dhn-fwvcp-93"
-, update =	"99.07 bibrelex, 98.11 smid, 95.05 smid"
+, author =      "G. Das and P. J. Heffernan and G. Narasimhan"
+, title =       "Finding All Weakly-Visible Chords of a Polygon in Linear Time"
+, journal =     "Nordic J. Comput."
+, volume =      1
+, year =        1994
+, pages =       "433--457"
+, succeeds =    "dhn-fwvcp-93"
+, update =      "99.07 bibrelex, 98.11 smid, 95.05 smid"
 }
 
 @inproceedings{dj-mvhpd-90
-, author =	"G. Das and D. Joseph"
-, title =	"Minimum vertex hulls for polyhedral domains"
-, booktitle =	"Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	415
-, publisher =	"Springer-Verlag"
-, year =	1990
-, precedes =	"dj-mvhpd-92"
-, update =	"95.01 mitchell"
+, author =      "G. Das and D. Joseph"
+, title =       "Minimum vertex hulls for polyhedral domains"
+, booktitle =   "Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      415
+, publisher =   "Springer-Verlag"
+, year =        1990
+, precedes =    "dj-mvhpd-92"
+, update =      "95.01 mitchell"
 }
 
 @article{dj-mvhpd-92
-, author =	"G. Das and D. Joseph"
-, title =	"Minimum vertex hulls for polyhedral domains"
-, journal =	"Theoret. Comput. Sci."
-, volume =	103
-, year =	1992
-, pages =	"107--135"
-, succeeds =	"dj-mvhpd-90"
-, update =	"95.01 mitchell, 95.01 mitchell"
+, author =      "G. Das and D. Joseph"
+, title =       "Minimum vertex hulls for polyhedral domains"
+, journal =     "Theoret. Comput. Sci."
+, volume =      103
+, year =        1992
+, pages =       "107--135"
+, succeeds =    "dj-mvhpd-90"
+, update =      "95.01 mitchell, 95.01 mitchell"
 }
 
 @inproceedings{dj-cmcnp-90
-, author =	"G. Das and D. Joseph"
-, title =	"The complexity of minimum convex nested polyhedra"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"296--301"
-, cites =	"abosy-fmcnp-85, cy-psppo-84, dj-mvhpd-90, kl-fstcg-85, l-pftu-82, o-cgc4-88, o-cgc5-88, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "G. Das and D. Joseph"
+, title =       "The complexity of minimum convex nested polyhedra"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "296--301"
+, cites =       "abosy-fmcnp-85, cy-psppo-84, dj-mvhpd-90, kl-fstcg-85, l-pftu-82, o-cgc4-88, o-cgc5-88, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{dj-wtacg-89
-, author =	"G. Das and D. Joseph"
-, title =	"Which Triangulations Approximate the Complete Graph?"
-, booktitle =	"Proc. International Symposium on Optimal Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	401
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"168--192"
-, update =	"00.03 smid, 96.05 smid"
-, abstract =	"It has been shown in the literature that the Delaunay
-		 triangulation and its variants are sparse
-		 approximations of the complete graph, in that the
-		 shortest distance between two sites within the
-		 triangulation is bounded by a constant multiple of
-		 their Euclidean separation. The present paper shows
-		 that other classical triangulation algorithms, such as
-		 the greedy triangulation, and more notably, the minimum
-		 weight triangulation, also approximate the complete
-		 graph in this sense. It also designs an algorithm for
-		 constructing extremely sparse (nontriangular) planar
-		 graphs that approximate the complete graph. It defines
-		 a sufficiency condition and shows that any Euclidean
-		 planar graph constructing algorithm which satisfies
-		 this condition always produces good approximations of
-		 the complete graph."
+, author =      "G. Das and D. Joseph"
+, title =       "Which Triangulations Approximate the Complete Graph?"
+, booktitle =   "Proc. International Symposium on Optimal Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      401
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "168--192"
+, update =      "00.03 smid, 96.05 smid"
+, abstract =    "It has been shown in the literature that the Delaunay
+                 triangulation and its variants are sparse
+                 approximations of the complete graph, in that the
+                 shortest distance between two sites within the
+                 triangulation is bounded by a constant multiple of
+                 their Euclidean separation. The present paper shows
+                 that other classical triangulation algorithms, such as
+                 the greedy triangulation, and more notably, the minimum
+                 weight triangulation, also approximate the complete
+                 graph in this sense. It also designs an algorithm for
+                 constructing extremely sparse (nontriangular) planar
+                 graphs that approximate the complete graph. It defines
+                 a sufficiency condition and shows that any Euclidean
+                 planar graph constructing algorithm which satisfies
+                 this condition always produces good approximations of
+                 the complete graph."
 }
 
 @techreport{dks-ocaet-96t
-, author =	"G. Das and S. Kapoor and M. Smid"
-, title =	"On the complexity of approximating {Euclidean} traveling salesman tours and minimum spanning trees"
-, type =	"Report"
-, number =	"TR 96-02"
-, institution =	"Department of Computer Science, King's College"
-, address =	"London, UK"
-, year =	1996
-, update =	"97.03 smid, 96.05 smid"
+, author =      "G. Das and S. Kapoor and M. Smid"
+, title =       "On the complexity of approximating {Euclidean} traveling salesman tours and minimum spanning trees"
+, type =        "Report"
+, number =      "TR 96-02"
+, institution = "Department of Computer Science, King's College"
+, address =     "London, UK"
+, year =        1996
+, update =      "97.03 smid, 96.05 smid"
 }
 
 @incollection{dks-ocaet-96i
-, author =	"G. Das and S. Kapoor and M. Smid"
-, title =	"On the complexity of approximating {Euclidean} traveling salesman tours and minimum spanning trees"
-, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1180
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"64--75"
-, update =	"97.03 smid"
+, author =      "G. Das and S. Kapoor and M. Smid"
+, title =       "On the complexity of approximating {Euclidean} traveling salesman tours and minimum spanning trees"
+, booktitle =   "Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1180
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "64--75"
+, update =      "97.03 smid"
 }
 
 @article{dks-ocaet-97
-, author =	"G. Das and S. Kapoor and M. Smid"
-, title =	"On the complexity of approximating {Euclidean} traveling salesman tours and minimum spanning trees"
-, journal =	"Algorithmica"
-, volume =	19
-, year =	1997
-, pages =	"447--460"
-, update =	"97.11 smid"
+, author =      "G. Das and S. Kapoor and M. Smid"
+, title =       "On the complexity of approximating {Euclidean} traveling salesman tours and minimum spanning trees"
+, journal =     "Algorithmica"
+, volume =      19
+, year =        1997
+, pages =       "447--460"
+, update =      "97.11 smid"
 }
 
 @inproceedings{dn-facse-94
-, author =	"G. Das and G. Narasimhan"
-, title =	"A Fast Algorithm for Constructing Sparse {Euclidean} Spanners"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"132--139"
-, cites =	"addjs-sswg-93, ap-sp-90, c-facts-93, cdns-nsrgs-95, dhn-oss3d-93, dh-cd3so-93, ll-tapga-89, s-cmsga-91, s-gs-92, v-sgagc-91, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "G. Das and G. Narasimhan"
+, title =       "A Fast Algorithm for Constructing Sparse {Euclidean} Spanners"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "132--139"
+, cites =       "addjs-sswg-93, ap-sp-90, c-facts-93, cdns-nsrgs-95, dhn-oss3d-93, dh-cd3so-93, ll-tapga-89, s-cmsga-91, s-gs-92, v-sgagc-91, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @article{dn-facse-97
-, author =	"G. Das and G. Narasimhan"
-, title =	"A Fast Algorithm for Constructing Sparse {Euclidean} Spanners"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"297--315"
-, update =	"98.07 smid"
+, author =      "G. Das and G. Narasimhan"
+, title =       "A Fast Algorithm for Constructing Sparse {Euclidean} Spanners"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "297--315"
+, update =      "98.07 smid"
 }
 
 @inproceedings{dn-gsld-91
-, author =	"G. Das and G. Narasimhan"
-, title =	"Geometric searching and link distances"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"261--272"
-, keywords =	"distance"
+, author =      "G. Das and G. Narasimhan"
+, title =       "Geometric searching and link distances"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "261--272"
+, keywords =    "distance"
 }
 
 @inproceedings{dn-oltas-94
-, author =	"G. Das and G. Narasimhan"
-, title =	"Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"259--266"
-, keywords =	"visibility"
-, cites =	"at-oadvp-81, bmt-ltacs-91, c-tsplt-91a, ghlst-ltavs-87, c-ocswv-92, cn-wrsp-91, dhn-lvp-93, dhn-fwvcp-93, dc-advsp-93, h-oatgp-93, ik-tgp-92, k-dwvsp-88, lp-oafkp-79, n-wrlv-92, o-cgc18-93, kv-swtwv-93, ss-oadwv-90, st-pplup-86, tl-tgwsp-93, ZZZ"
-, update =	"98.03 bibrelex, 94.09 orourke, 94.01 jones"
+, author =      "G. Das and G. Narasimhan"
+, title =       "Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "259--266"
+, keywords =    "visibility"
+, cites =       "at-oadvp-81, bmt-ltacs-91, c-tsplt-91a, ghlst-ltavs-87, c-ocswv-92, cn-wrsp-91, dhn-lvp-93, dhn-fwvcp-93, dc-advsp-93, h-oatgp-93, ik-tgp-92, k-dwvsp-88, lp-oafkp-79, n-wrlv-92, o-cgc18-93, kv-swtwv-93, ss-oadwv-90, st-pplup-86, tl-tgwsp-93, ZZZ"
+, update =      "98.03 bibrelex, 94.09 orourke, 94.01 jones"
 }
 
 @inproceedings{dn-schds-95
-, author =	"Gautam Das and Giri Narasimhan"
-, title =	"Short Cuts in Higher Dimensional Space"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"103--108"
-, update =	"95.09 jones"
+, author =      "Gautam Das and Giri Narasimhan"
+, title =       "Short Cuts in Higher Dimensional Space"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "103--108"
+, update =      "95.09 jones"
 }
 
 @inproceedings{dns-nwwme-95
-, author =	"Gautam Das and Giri Narasimhan and Jeffrey Salowe"
-, title =	"A New Way to Weigh Malnourished {Euclidean} Graphs"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"215--222"
-, keywords =	"Steiner trees, t-spanners"
-, update =	"96.09 agarwal, 96.05 mitchell"
+, author =      "Gautam Das and Giri Narasimhan and Jeffrey Salowe"
+, title =       "A New Way to Weigh Malnourished {Euclidean} Graphs"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "215--222"
+, keywords =    "Steiner trees, t-spanners"
+, update =      "96.09 agarwal, 96.05 mitchell"
 }
 
 @article{ds-lbagm-00
-, author =	"G. Das and M. Smid"
-, title =	"A lower bound for approximating the geometric minimum weight matching"
-, journal =	"Inform. Process. Lett."
-, volume =	74
-, year =	2000
-, pages =	"253--255"
-, update =	"01.04 smid"
+, author =      "G. Das and M. Smid"
+, title =       "A lower bound for approximating the geometric minimum weight matching"
+, journal =     "Inform. Process. Lett."
+, volume =      74
+, year =        2000
+, pages =       "253--255"
+, update =      "01.04 smid"
 }
 
 @inproceedings{d-cmpt-89
-, author =	"P. P. Das"
-, title =	"Characterization of metricity preserving transformations"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	31
+, author =      "P. P. Das"
+, title =       "Characterization of metricity preserving transformations"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       31
 }
 
 @article{dcc-dfdg-87
-, author =	"P. P. Das and P. P. Chakrabarti and B. N. Chatterji"
-, title =	"Distance functions in digital geometry"
-, journal =	"Inform. Sci."
-, volume =	42
-, number =	2
-, year =	1987
-, pages =	"113--136"
-, keywords =	"distance, digital geometry"
-, update =	"95.09 korneenko"
+, author =      "P. P. Das and P. P. Chakrabarti and B. N. Chatterji"
+, title =       "Distance functions in digital geometry"
+, journal =     "Inform. Sci."
+, volume =      42
+, number =      2
+, year =        1987
+, pages =       "113--136"
+, keywords =    "distance, digital geometry"
+, update =      "95.09 korneenko"
 }
 
 @article{dcc-gddg-87
-, author =	"P. P. Das and P. P. Chakrabarti and B. N. Chatterji"
-, title =	"Generalized distances in digital geometry"
-, journal =	"Inform. Sci."
-, volume =	42
-, year =	1987
-, pages =	"51--67"
+, author =      "P. P. Das and P. P. Chakrabarti and B. N. Chatterji"
+, title =       "Generalized distances in digital geometry"
+, journal =     "Inform. Sci."
+, volume =      42
+, year =        1987
+, pages =       "51--67"
 }
 
 @article{dc-hdg-90
-, author =	"P. P. Das and B. N. Chatterji"
-, title =	"Hyperplanes in digital geometry"
-, journal =	"Inform. Sci."
-, volume =	50
-, number =	1
-, year =	1990
-, pages =	"73--91"
-, keywords =	"digital geometry, hyperplanes, $d$-dimensional"
-, update =	"95.09 korneenko"
+, author =      "P. P. Das and B. N. Chatterji"
+, title =       "Hyperplanes in digital geometry"
+, journal =     "Inform. Sci."
+, volume =      50
+, number =      1
+, year =        1990
+, pages =       "73--91"
+, keywords =    "digital geometry, hyperplanes, $d$-dimensional"
+, update =      "95.09 korneenko"
 }
 
 @article{dvpm-sahsr-90
-, author =	"S. R. Das and P. Vaidya and L. Patniak and P. C. Mathias"
-, title =	"A systolic algorithm for hidden surface removal"
-, journal =	"Parallel Comput."
-, volume =	15
-, number =	"1--3"
-, year =	1990
-, pages =	"277--290"
-, keywords =	"parallel computation, hidden line/surface elimination"
-, update =	"95.09 korneenko"
+, author =      "S. R. Das and P. Vaidya and L. Patniak and P. C. Mathias"
+, title =       "A systolic algorithm for hidden surface removal"
+, journal =     "Parallel Comput."
+, volume =      15
+, number =      "1--3"
+, year =        1990
+, pages =       "277--290"
+, keywords =    "parallel computation, hidden line/surface elimination"
+, update =      "95.09 korneenko"
 }
 
 @article{dv-aamvn-89
-, author =	"B. Dasgupta and C. E. {Veni Madhavan}"
-, title =	"An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem"
-, journal =	"Inform. Process. Lett."
-, volume =	33
-, year =	1989
-, pages =	"35--44"
-, keywords =	"computational geometry, graphs, shortest paths"
-, update =	"94.09 lambert, 93.09 milone+mitchell"
+, author =      "B. Dasgupta and C. E. {Veni Madhavan}"
+, title =       "An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem"
+, journal =     "Inform. Process. Lett."
+, volume =      33
+, year =        1989
+, pages =       "35--44"
+, keywords =    "computational geometry, graphs, shortest paths"
+, update =      "94.09 lambert, 93.09 milone+mitchell"
 }
 
 @incollection{dcd-noaec-95
-, author =	"P. Dasgupta and P. P. Chakrabarti and S. C. DeSarkar"
-, title =	"A near optimal algorithm for the extended cow-path problem in the presence of relative errors"
-, booktitle =	"Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1026
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"22--36"
-, update =	"96.01 smid"
+, author =      "P. Dasgupta and P. P. Chakrabarti and S. C. DeSarkar"
+, title =       "A near optimal algorithm for the extended cow-path problem in the presence of relative errors"
+, booktitle =   "Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1026
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "22--36"
+, update =      "96.01 smid"
 }
 
 @incollection{dcd-ncaas-96
-, author =	"P. Dasgupta and P. P. Chakrabarti and S. C. DeSarkar"
-, title =	"A new competitive algorithm for agent searching in unknown streets"
-, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1180
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"147--155"
-, update =	"97.03 smid"
+, author =      "P. Dasgupta and P. P. Chakrabarti and S. C. DeSarkar"
+, title =       "A new competitive algorithm for agent searching in unknown streets"
+, booktitle =   "Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1180
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "147--155"
+, update =      "97.03 smid"
 }
 
 @techreport{dg-epjll-99
-, author =	"S. Dasgupta and A. Gupta"
-, title =	"An elementary proof of the {Johnson-Lindenstrauss} lemma"
-, number =	"TR-99-06"
-, institution =	"Intl. Comput. Sci. Inst."
-, address =	"Berkeley, CA"
-, year =	1999
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "S. Dasgupta and A. Gupta"
+, title =       "An elementary proof of the {Johnson-Lindenstrauss} lemma"
+, number =      "TR-99-06"
+, institution = "Intl. Comput. Sci. Inst."
+, address =     "Berkeley, CA"
+, year =        1999
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @book{d-ndl-95
-, title =	"Network and Discrete Location"
-, editor =	"Mark S. Daskin"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1995
-, isbn =	"0-471-01897-X"
-, update =	"99.11 bibrelex, 95.09 mitchell"
+, title =       "Network and Discrete Location"
+, editor =      "Mark S. Daskin"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1995
+, isbn =        "0-471-01897-X"
+, update =      "99.11 bibrelex, 95.09 mitchell"
 }
 
 @techreport{dgb-smgtd-85
-, author =	"N. N. Datar and U. G. Gujar and V. C. Bhavsar"
-, title =	"Some methods for generating three-dimensional objects"
-, type =	"Report"
-, number =	"??"
-, institution =	"School Comput. Sci., Univ. New Brunswick"
-, address =	"Fredericton, NB"
-, year =	1985
+, author =      "N. N. Datar and U. G. Gujar and V. C. Bhavsar"
+, title =       "Some methods for generating three-dimensional objects"
+, type =        "Report"
+, number =      "??"
+, institution = "School Comput. Sci., Univ. New Brunswick"
+, address =     "Fredericton, NB"
+, year =        1985
 }
 
 @article{d-ealrp-92
-, author =	"A. Datta"
-, title =	"Efficient algorithms for the largest rectangle problem"
-, journal =	"Inform. Sci."
-, volume =	64
-, year =	1992
-, pages =	"121--141"
-, update =	"93.09 datta"
+, author =      "A. Datta"
+, title =       "Efficient algorithms for the largest rectangle problem"
+, journal =     "Inform. Sci."
+, volume =      64
+, year =        1992
+, pages =       "121--141"
+, update =      "93.09 datta"
 }
 
 @inproceedings{d-epagk-94
-, author =	"A. Datta"
-, title =	"Efficient parallel algorithms for geometric $k$-clustering problems"
-, booktitle =	"Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	""
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	""
-, update =	"95.01 smid, 94.01 datta"
+, author =      "A. Datta"
+, title =       "Efficient parallel algorithms for geometric $k$-clustering problems"
+, booktitle =   "Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      ""
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       ""
+, update =      "95.01 smid, 94.01 datta"
 }
 
 @inproceedings{dhs-cspbg-95
-, author =	"Amitava Datta and Christoph A. Hipke and Sven Schuierer"
-, title =	"Competitive Searching in Polygons: {Beyond} Generalised Streets"
-, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1004
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"32--41"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 96.01 smid, 95.09 mitchell"
+, author =      "Amitava Datta and Christoph A. Hipke and Sven Schuierer"
+, title =       "Competitive Searching in Polygons: {Beyond} Generalised Streets"
+, booktitle =   "Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1004
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "32--41"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 96.01 smid, 95.09 mitchell"
 }
 
 @inproceedings{di-csgs-94
-, author =	"Amitava Datta and Christian Icking"
-, title =	"Competitive Searching in a Generalized Street"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"175--182"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr191.pdf"
-, precedes =	"di-csgs-95"
-, cites =	"bcr-sp-93, brs-nugt-91, dhn-lvp-93, dkp-hlue1-93, ik-tgp-92, k-wusbd-92, k-olssp-94, ls-ppspm-87, py-spwm-91, st-aelup-85, ZZZ"
-, update =	"00.03 bibrelex, 99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "Amitava Datta and Christian Icking"
+, title =       "Competitive Searching in a Generalized Street"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "175--182"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr191.pdf"
+, precedes =    "di-csgs-95"
+, cites =       "bcr-sp-93, brs-nugt-91, dhn-lvp-93, dkp-hlue1-93, ik-tgp-92, k-wusbd-92, k-olssp-94, ls-ppspm-87, py-spwm-91, st-aelup-85, ZZZ"
+, update =      "00.03 bibrelex, 99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @techreport{di-csgs-95
-, author =	"Amitava Datta and Christian Icking"
-, title =	"Competitive Searching in a Generalized Street"
-, number =	191
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1995
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr191.pdf"
-, succeeds =	"di-csgs-94"
-, precedes =	"di-csgs-99"
-, update =	"99.07 bibrelex, 98.11 bibrelex"
+, author =      "Amitava Datta and Christian Icking"
+, title =       "Competitive Searching in a Generalized Street"
+, number =      191
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1995
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr191.pdf"
+, succeeds =    "di-csgs-94"
+, precedes =    "di-csgs-99"
+, update =      "99.07 bibrelex, 98.11 bibrelex"
 }
 
 @article{di-csgs-99
-, author =	"Amitava Datta and Christian Icking"
-, title =	"Competitive Searching in a Generalized Street"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, year =	1999
-, pages =	"109--120"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr191.pdf"
-, succeeds =	"di-csgs-95"
-, cites =	"aks-eueo-99, bcr-sp-93, brs-nugt-97, dhn-lvp-97, dhs-cspbg-95, ds-mpupe-99, dkp-hlue1-98, drw-lrmt-98, gs-oolaw-97, gmr-rlp-97, hikk-cslp-97, hikk-pepns-98, ik-tgp-92, ik-csas-95, ik-skpcs-95, ikl-ocsws-99, ilss-ghtus-98, krt-sueor-96, knw-rlti-97, k-wusbd-92, k-olssp-94, lc-tasso-98, lsksc-ncssu-97, l-oltsb-96, ls-ghtus-95, ls-gsr-96, ls-wsf-96, ls-pinos-97, ls-lbsgs-98, ls-ppspm-87, py-spwm-91, s-ersls-97, ss-ossus-99, st-aelup-85, thl-tgwsp-98, ZZZ"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 99.07 bibrelex"
+, author =      "Amitava Datta and Christian Icking"
+, title =       "Competitive Searching in a Generalized Street"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, year =        1999
+, pages =       "109--120"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr191.pdf"
+, succeeds =    "di-csgs-95"
+, cites =       "aks-eueo-99, bcr-sp-93, brs-nugt-97, dhn-lvp-97, dhs-cspbg-95, ds-mpupe-99, dkp-hlue1-98, drw-lrmt-98, gs-oolaw-97, gmr-rlp-97, hikk-cslp-97, hikk-pepns-98, ik-tgp-92, ik-csas-95, ik-skpcs-95, ikl-ocsws-99, ilss-ghtus-98, krt-sueor-96, knw-rlti-97, k-wusbd-92, k-olssp-94, lc-tasso-98, lsksc-ncssu-97, l-oltsb-96, ls-ghtus-95, ls-gsr-96, ls-wsf-96, ls-pinos-97, ls-lbsgs-98, ls-ppspm-87, py-spwm-91, s-ersls-97, ss-ossus-99, st-aelup-85, thl-tgwsp-98, ZZZ"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{dk-eamer-91
-, author =	"A. Datta and K. Krithivasan"
-, title =	"An efficient algorithm for the maximum empty rectangle problem in three dimensions"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"78--83"
-, cites =	"as-facle-87, cdl-cler-86, d-ealrp-92, gno-faded-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "A. Datta and K. Krithivasan"
+, title =       "An efficient algorithm for the maximum empty rectangle problem in three dimensions"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "78--83"
+, cites =       "as-facle-87, cdl-cler-86, d-ealrp-92, gno-faded-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{dk-eamer-90
-, author =	"A. Datta and K. Krithivasan"
-, title =	"Efficient algorithms for the maximum empty rectangle problem in shared memory and other architectures"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, volume =	3
-, year =	1990
-, pages =	"344--345"
-, update =	"93.09 datta"
+, author =      "A. Datta and K. Krithivasan"
+, title =       "Efficient algorithms for the maximum empty rectangle problem in shared memory and other architectures"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, volume =      3
+, year =        1990
+, pages =       "344--345"
+, update =      "93.09 datta"
 }
 
 @inproceedings{dk-ppli-88
-, author =	"A. Datta and K. Krithivasan"
-, title =	"Path Planning with Local Information"
-, booktitle =	"Proc. Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, site =	"New Delhi, India"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	338
-, publisher =	"Springer-Verlag"
-, month =	dec
-, year =	1988
-, pages =	"108--121"
-, update =	"99.11 bibrelex, 95.01 smid, 93.09 datta"
+, author =      "A. Datta and K. Krithivasan"
+, title =       "Path Planning with Local Information"
+, booktitle =   "Proc. Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, site =        "New Delhi, India"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      338
+, publisher =   "Springer-Verlag"
+, month =       dec
+, year =        1988
+, pages =       "108--121"
+, update =      "99.11 bibrelex, 95.01 smid, 93.09 datta"
 }
 
 @inproceedings{dko-oaoss-97
-, author =	"A. Datta and K. Krithivasan and T. Ottmann"
-, title =	"An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons"
-, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1203
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	""
-, update =	"00.03 devillers, 98.03 mitchell"
+, author =      "A. Datta and K. Krithivasan and T. Ottmann"
+, title =       "An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons"
+, booktitle =   "Algorithms and Complexity (Proc. CIAC' 97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1203
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       ""
+, update =      "00.03 devillers, 98.03 mitchell"
 }
 
 @techreport{dlss-sdakp-93t
-, author =	"A. Datta and H. P. Lenhof and C. Schwarz and M. Smid"
-, title =	"Static and dynamic algorithms for $k$-point clustering problems"
-, type =	"Report"
-, number =	"MPI-I-93-108"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, update =	"93.05 smid"
+, author =      "A. Datta and H. P. Lenhof and C. Schwarz and M. Smid"
+, title =       "Static and dynamic algorithms for $k$-point clustering problems"
+, type =        "Report"
+, number =      "MPI-I-93-108"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, update =      "93.05 smid"
 }
 
 @inproceedings{dlss-sdakp-93i
-, author =	"A. Datta and H.-P. Lenhof and C. Schwarz and M. Smid"
-, title =	"Static and Dynamic Algorithms for $k$-Point Clustering Problems"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"265--276"
-, update =	"95.01 smid, 93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "A. Datta and H.-P. Lenhof and C. Schwarz and M. Smid"
+, title =       "Static and Dynamic Algorithms for $k$-Point Clustering Problems"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "265--276"
+, update =      "95.01 smid, 93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @article{dlss-sdakp-95
-, author =	"A. Datta and H.-P. Lenhof and C. Schwarz and M. Smid"
-, title =	"Static and dynamic algorithms for $k$-point clustering problems"
-, journal =	"J. Algorithms"
-, volume =	19
-, year =	1995
-, pages =	"474--503"
-, update =	"96.01 smid"
+, author =      "A. Datta and H.-P. Lenhof and C. Schwarz and M. Smid"
+, title =       "Static and dynamic algorithms for $k$-point clustering problems"
+, journal =     "J. Algorithms"
+, volume =      19
+, year =        1995
+, pages =       "474--503"
+, update =      "96.01 smid"
 }
 
 @inproceedings{dms-ocpad-93
-, author =	"A. Datta and A. Maheshwari and J.-R. Sack"
-, title =	"Optimal {CREW}-{PRAM} algorithms for direct dominance problems"
-, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
-, nickname =	"ESA '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	726
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"109--120"
-, update =	"95.01 smid, 94.01 smid, 93.09 datta+milone+mitchell"
+, author =      "A. Datta and A. Maheshwari and J.-R. Sack"
+, title =       "Optimal {CREW}-{PRAM} algorithms for direct dominance problems"
+, booktitle =   "Proc. 1st Annu. European Sympos. Algorithms"
+, nickname =    "ESA '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      726
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "109--120"
+, update =      "95.01 smid, 94.01 smid, 93.09 datta+milone+mitchell"
 }
 
 @article{dms-opadd-96
-, author =	"A. Datta and A. Maheshwari and J.-R. Sack"
-, title =	"Optimal Parallel Algorithms for Direct Dominance Problems"
-, journal =	"Nordic J. Comput."
-, volume =	3
-, year =	1996
-, pages =	"72--88"
-, update =	"97.11 sack"
+, author =      "A. Datta and A. Maheshwari and J.-R. Sack"
+, title =       "Optimal Parallel Algorithms for Direct Dominance Problems"
+, journal =     "Nordic J. Comput."
+, volume =      3
+, year =        1996
+, pages =       "72--88"
+, update =      "97.11 sack"
 }
 
 @inproceedings{dr-sleop-90
-, author =	"A. Datta and G. D. S. Ramkumar"
-, title =	"On some largest empty orthoconvex polygons in a point set"
-, booktitle =	"Proc. Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, site =	"Bangalore, India"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	472
-, publisher =	"Springer-Verlag"
-, month =	dec
-, year =	1990
-, pages =	"270--285"
-, update =	"98.07 smid, 93.09 datta"
+, author =      "A. Datta and G. D. S. Ramkumar"
+, title =       "On some largest empty orthoconvex polygons in a point set"
+, booktitle =   "Proc. Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, site =        "Bangalore, India"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      472
+, publisher =   "Springer-Verlag"
+, month =       dec
+, year =        1990
+, pages =       "270--285"
+, update =      "98.07 smid, 93.09 datta"
 }
 
 @inproceedings{ds-mpupe-99
-, author =	"Amitava Datta and Subbiah Soundaralakshmi"
-, title =	"Motion Planning in an Unknown Polygonal Environment with Bounded Performance Guarantee"
-, booktitle =	"Proc. 1999 IEEE Internat. Conf. Robot. Autom."
-, nickname =	"ICRA '99"
-, site =	"Detroit"
-, year =	1999
-, update =	"99.07 bibrelex"
+, author =      "Amitava Datta and Subbiah Soundaralakshmi"
+, title =       "Motion Planning in an Unknown Polygonal Environment with Bounded Performance Guarantee"
+, booktitle =   "Proc. 1999 IEEE Internat. Conf. Robot. Autom."
+, nickname =    "ICRA '99"
+, site =        "Detroit"
+, year =        1999
+, update =      "99.07 bibrelex"
 }
 
 @article{dsk-fspaf-90
-, author =	"A. Datta and R. Srikant and K. Krithivasan"
-, title =	"Fast sequential and parallel algorithms for finding the largest rectangle separating two sets"
-, journal =	"Internat. J. Comput. Math."
-, volume =	37
-, year =	1990
-, pages =	"49--61"
-, update =	"93.09 datta"
+, author =      "A. Datta and R. Srikant and K. Krithivasan"
+, title =       "Fast sequential and parallel algorithms for finding the largest rectangle separating two sets"
+, journal =     "Internat. J. Comput. Math."
+, volume =      37
+, year =        1990
+, pages =       "49--61"
+, update =      "93.09 datta"
 }
 
 @inproceedings{d-sgvdc-94
-, author =	"A. Dattasharma"
-, title =	"On the Size of a Generalized {Voronoi} Diagram for Convex Polyhedra in $d$ dimensions"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"357--362"
-, cites =	"dk-tmpcp-93, dk-avr3t-, d-sccgv-, ls-pptmc-87, ksd-ttute-92, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "A. Dattasharma"
+, title =       "On the Size of a Generalized {Voronoi} Diagram for Convex Polyhedra in $d$ dimensions"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "357--362"
+, cites =       "dk-tmpcp-93, dk-avr3t-, d-sccgv-, ls-pptmc-87, ksd-ttute-92, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{d-sqpgv-94
-, author =	"A. Dattasharma"
-, title =	"Some Qualitative Properties of a Generalized {Voronoi} Diagram for Convex Polyhedra in $d$ dimensions"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"134--139"
-, cites =	"ps-cgi-85, dk-tmpcp-93, dk-avr3t-, d-sccgv-, ls-pptmc-87, ksd-ttute-92, c-vmpmp-85, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "A. Dattasharma"
+, title =       "Some Qualitative Properties of a Generalized {Voronoi} Diagram for Convex Polyhedra in $d$ dimensions"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "134--139"
+, cites =       "ps-cgi-85, dk-tmpcp-93, dk-avr3t-, d-sccgv-, ls-pptmc-87, ksd-ttute-92, c-vmpmp-85, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @phdthesis{d-sccgv-
-, author =	"A. Dattasharma"
-, title =	"Structure and Computation of a Class of Generalized {Voronoi} Diagrams with application to Translational Motion Planning"
-, school =	"Dept. of Computer Science and Automation, Indian Institute of Science"
-, address =	"Bangalore, India"
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "A. Dattasharma"
+, title =       "Structure and Computation of a Class of Generalized {Voronoi} Diagrams with application to Translational Motion Planning"
+, school =      "Dept. of Computer Science and Automation, Indian Institute of Science"
+, address =     "Bangalore, India"
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{dk-tmpcp-93
-, author =	"A. Dattasharma and S. Keerthi"
-, title =	"Translational motion planning for a convex polyhedron in a 3D polyhedral world using an efficient and new roadmap"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"449--454"
-, cites =	"osy-gvdl-87, b-sfppg-83, ls-pptmc-87, cd-svd-88, s-aavd3-91, ksd-ttute-92, ls-pptmc-87, cd-svd-88, s-aavd3-91, c-vmpmp-85, dk-rvrtm-93, bms-plpco-93, m-lpltw-84, c-crmp-87, r-ca-70, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "A. Dattasharma and S. Keerthi"
+, title =       "Translational motion planning for a convex polyhedron in a 3D polyhedral world using an efficient and new roadmap"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "449--454"
+, cites =       "osy-gvdl-87, b-sfppg-83, ls-pptmc-87, cd-svd-88, s-aavd3-91, ksd-ttute-92, ls-pptmc-87, cd-svd-88, s-aavd3-91, c-vmpmp-85, dk-rvrtm-93, bms-plpco-93, m-lpltw-84, c-crmp-87, r-ca-70, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @unpublished{dk-avr3t-
-, author =	"A. Dattasharma and S. S. Keerthi"
-, title =	"An Augmented {Voronoi} Roadmap for {3D} Translational Motion Planning for a Convex Polyhedron Moving Amidst Convex Polyhedral Obstacles"
-, journal =	"Theoret. Comput. Sci."
-, note =	"to appear"
-, update =	"98.11 bibrelex"
+, author =      "A. Dattasharma and S. S. Keerthi"
+, title =       "An Augmented {Voronoi} Roadmap for {3D} Translational Motion Planning for a Convex Polyhedron Moving Amidst Convex Polyhedral Obstacles"
+, journal =     "Theoret. Comput. Sci."
+, note =        "to appear"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{dk-rvrtm-93
-, author =	"A. Dattasharma and S. S. Keerthi"
-, title =	"Rectilinear {Voronoi} like Roadmap for Translational Motion of a Convex Polyhedron Amidst Convex Polyhedra in a 3D {Euclidean} World"
-, type =	"Technical Report"
-, number =	"02-93"
-, institution =	"Indian Institute of Science"
-, month =	jun
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "A. Dattasharma and S. S. Keerthi"
+, title =       "Rectilinear {Voronoi} like Roadmap for Translational Motion of a Convex Polyhedron Amidst Convex Polyhedra in a 3D {Euclidean} World"
+, type =        "Technical Report"
+, number =      "02-93"
+, institution = "Indian Institute of Science"
+, month =       jun
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @article{d-cpcde-71
-, author =	"H. Davenport"
-, title =	"A combinatorial problem connected with differential equations {II}"
-, journal =	"Acta Arithmetica"
-, volume =	17
-, year =	1971
-, pages =	"363--372"
-, update =	"95.05 agarwal"
+, author =      "H. Davenport"
+, title =       "A combinatorial problem connected with differential equations {II}"
+, journal =     "Acta Arithmetica"
+, volume =      17
+, year =        1971
+, pages =       "363--372"
+, update =      "95.05 agarwal"
 }
 
 @book{d-haitn-83
-, author =	"H. Davenport"
-, title =	"The Higher Arithmetic: An Introduction to the Theory of Numbers"
-, publisher =	"Dover Publications"
-, address =	"New York"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "H. Davenport"
+, title =       "The Higher Arithmetic: An Introduction to the Theory of Numbers"
+, publisher =   "Dover Publications"
+, address =     "New York"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{ds-cpcde-65
-, author =	"H. Davenport and A. Schinzel"
-, title =	"A combinatorial problem connected with differential equations"
-, journal =	"Amer. J. Math."
-, volume =	87
-, year =	1965
-, pages =	"684--689"
-, keywords =	"Davenport-Schinzel sequences"
+, author =      "H. Davenport and A. Schinzel"
+, title =       "A combinatorial problem connected with differential equations"
+, journal =     "Amer. J. Math."
+, volume =      87
+, year =        1965
+, pages =       "684--689"
+, keywords =    "Davenport-Schinzel sequences"
 }
 
 @inproceedings{d-cag-79
-, author =	"J. Davenport"
-, title =	"The Computerization of Algebraic Geometry"
-, booktitle =	"Proc. Internat. Sympos. Symbolic Algebraic Comput."
-, volume =	72
-, publisher =	"Springer-Verlag"
-, year =	1979
-, pages =	"119--133"
-, update =	"97.11 bibrelex"
+, author =      "J. Davenport"
+, title =       "The Computerization of Algebraic Geometry"
+, booktitle =   "Proc. Internat. Sympos. Symbolic Algebraic Comput."
+, volume =      72
+, publisher =   "Springer-Verlag"
+, year =        1979
+, pages =       "119--133"
+, update =      "97.11 bibrelex"
 }
 
 @article{d-pmp-86
-, author =	"J. H. Davenport"
-, title =	"A ``piano movers'' problem"
-, journal =	"SIGSAM Bull."
-, volume =	20
-, number =	"1--2"
-, year =	1986
-, pages =	"15--17"
-, keywords =	"motion planning"
-, update =	"95.09 korneenko"
+, author =      "J. H. Davenport"
+, title =       "A ``piano movers'' problem"
+, journal =     "SIGSAM Bull."
+, volume =      20
+, number =      "1--2"
+, year =        1986
+, pages =       "15--17"
+, keywords =    "motion planning"
+, update =      "95.09 korneenko"
 }
 
 @book{dst-casaa-88
-, author =	"J. H. Davenport and Y. Siret and E. Tournier"
-, title =	"Computer Algebra: systems and algorithms for algebraic computation"
-, publisher =	"Acacdemic Press"
-, year =	1988
-, update =	"98.11 bibrelex"
+, author =      "J. H. Davenport and Y. Siret and E. Tournier"
+, title =       "Computer Algebra: systems and algorithms for algebraic computation"
+, publisher =   "Acacdemic Press"
+, year =        1988
+, update =      "98.11 bibrelex"
 }
 
 @book{d-os-70
-, author =	"H. A. David"
-, title =	"Order Statistics"
-, publisher =	"John Wiley \& Sons"
-, year =	1970
-, update =	"99.11 bibrelex, 98.07 bibrelex"
+, author =      "H. A. David"
+, title =       "Order Statistics"
+, publisher =   "John Wiley \& Sons"
+, year =        1970
+, update =      "99.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{dh-dgnus-96
-, author =	"Ron Davidson and David Harel"
-, title =	"Drawing Graphics Nicely Using Simulated Annealing"
-, journal =	"ACM Trans. Graph."
-, volume =	15
-, number =	4
-, year =	1996
-, pages =	"301--331"
-, keywords =	"graph drawing, straight-line, force-directed"
-, update =	"97.03 tamassia"
+, author =      "Ron Davidson and David Harel"
+, title =       "Drawing Graphics Nicely Using Simulated Annealing"
+, journal =     "ACM Trans. Graph."
+, volume =      15
+, number =      4
+, year =        1996
+, pages =       "301--331"
+, keywords =    "graph drawing, straight-line, force-directed"
+, update =      "97.03 tamassia"
 }
 
 @techreport{dh-dgnus-89
-, author =	"R. Davidson and D. Harel"
-, title =	"Drawing Graphs Nicely Using Simulated Annealing"
-, institution =	"Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot"
-, year =	1989
-, keywords =	"graph drawing"
-, update =	"95.05 smid+tamassia, 93.09 tamassia"
+, author =      "R. Davidson and D. Harel"
+, title =       "Drawing Graphs Nicely Using Simulated Annealing"
+, institution = "Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot"
+, year =        1989
+, keywords =    "graph drawing"
+, update =      "95.05 smid+tamassia, 93.09 tamassia"
 }
 
 @techreport{d-sfsos-84
-, author =	"E. Davis"
-, title =	"Shape and function of solid objects: some examples"
-, type =	"Report"
-, number =	"TR137"
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1984
+, author =      "E. Davis"
+, title =       "Shape and function of solid objects: some examples"
+, type =        "Report"
+, number =      "TR137"
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1984
 }
 
 @inproceedings{d-csppd-85
-, author =	"G. Davis"
-, title =	"Computing separating planes for a pair of disjoint polytopes"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"8--14"
-, cites =	"a-rmli-54, bgm-sma-65, b-mpg-69, c-lp-83, dh-pcsa-73, d-cvem-83, g-cpcli-51, g-spaph-82, g-rmssl-80, ns-picg-79, ph-chfsp-77, w-etcp-50, ZZZ"
-, update =	"97.11 bibrelex, 93.05 jones"
+, author =      "G. Davis"
+, title =       "Computing separating planes for a pair of disjoint polytopes"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "8--14"
+, cites =       "a-rmli-54, bgm-sma-65, b-mpg-69, c-lp-83, dh-pcsa-73, d-cvem-83, g-cpcli-51, g-spaph-82, g-rmssl-80, ns-picg-79, ph-chfsp-77, w-etcp-50, ZZZ"
+, update =      "97.11 bibrelex, 93.05 jones"
 }
 
 @book{dm-dasd-75
-, author =	"J. C. Davis and M. J. McCullagh"
-, title =	"Display and analysis of spatial data"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1975
-, update =	"99.11 bibrelex"
+, author =      "J. C. Davis and M. J. McCullagh"
+, title =       "Display and analysis of spatial data"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1975
+, update =      "99.11 bibrelex"
 }
 
 @article{db-cmsii-79
-, author =	"L. Davis and M. Benedikt"
-, title =	"Computational models of space: isovists and isovist fields"
-, journal =	"Comput. Graph. Image Process."
-, volume =	11
-, year =	1979
-, pages =	"49--72"
+, author =      "L. Davis and M. Benedikt"
+, title =       "Computational models of space: isovists and isovist fields"
+, journal =     "Comput. Graph. Image Process."
+, volume =      11
+, year =        1979
+, pages =       "49--72"
 }
 
 @book{d-ia-63
-, author =	"P. J. Davis"
-, title =	"Interpolation and Approximation"
-, publisher =	"Blaisdell Publishing Co."
-, address =	"New York"
-, year =	1963
-, update =	"96.09 orourke"
+, author =      "P. J. Davis"
+, title =       "Interpolation and Approximation"
+, publisher =   "Blaisdell Publishing Co."
+, address =     "New York"
+, year =        1963
+, update =      "96.09 orourke"
 }
 
 @book{dr-mni-75
-, author =	"P. J. Davis and P. Rabinivitz"
-, title =	"Methods of numerical integration"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1975
-, update =	"98.03 bibrelex"
+, author =      "P. J. Davis and P. Rabinivitz"
+, title =       "Methods of numerical integration"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1975
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{dd-nipdt-89
-, author =	"J. R. Davy and P. M. Dew"
-, title =	"A Note on Improving the Performance of {Delaunay} Triangulation"
-, booktitle =	"New Advances in Computer Graphics: Proceedings of Computer Graphics International '89"
-, publisher =	"Springer-Verlag"
-, address =	"Tokyo"
-, year =	1989
-, pages =	"209--226"
-, annote =	"Experiments on coarse grain parallel implementations
-		 of Guibas Stolfi divide and conquer algorithm."
+, author =      "J. R. Davy and P. M. Dew"
+, title =       "A Note on Improving the Performance of {Delaunay} Triangulation"
+, booktitle =   "New Advances in Computer Graphics: Proceedings of Computer Graphics International '89"
+, publisher =   "Springer-Verlag"
+, address =     "Tokyo"
+, year =        1989
+, pages =       "209--226"
+, annote =      "Experiments on coarse grain parallel implementations
+                 of Guibas Stolfi divide and conquer algorithm."
 }
 
 @article{d-rbwdo-84
-, author =	"R. J. Dawson"
-, title =	"On removing a ball without disturbing the others"
-, journal =	"Math. Mag."
-, volume =	57
-, year =	1984
-, pages =	"27--30"
+, author =      "R. J. Dawson"
+, title =       "On removing a ball without disturbing the others"
+, journal =     "Math. Mag."
+, volume =      57
+, year =        1984
+, pages =       "27--30"
 }
 
 @article{d-pchat-88
-, author =	"A. M. Day"
-, title =	"Planar convex hull algorithms in theory and practice"
-, journal =	"Comput. Graph. Forum"
-, volume =	7
-, number =	3
-, year =	1988
-, pages =	"177--193"
-, keywords =	"convex hull"
-, update =	"95.09 korneenko"
+, author =      "A. M. Day"
+, title =       "Planar convex hull algorithms in theory and practice"
+, journal =     "Comput. Graph. Forum"
+, volume =      7
+, number =      3
+, year =        1988
+, pages =       "177--193"
+, keywords =    "convex hull"
+, update =      "95.09 korneenko"
 }
 
 @article{d-i2dch-90
-, author =	"A. M. Day"
-, title =	"The Implementation of a 2{D} Convex Hull Algorithm Using Pertubation"
-, journal =	"Comput. Graph. Forum"
-, volume =	9
-, number =	4
-, month =	dec
-, year =	1990
-, pages =	"309--316"
-, update =	"93.09 held"
+, author =      "A. M. Day"
+, title =       "The Implementation of a 2{D} Convex Hull Algorithm Using Pertubation"
+, journal =     "Comput. Graph. Forum"
+, volume =      9
+, number =      4
+, month =       dec
+, year =        1990
+, pages =       "309--316"
+, update =      "93.09 held"
 }
 
 @article{d-iafch-90
-, author =	"A. M. Day"
-, title =	"The implementation of an algorithm to find the convex hull of a set of $3$-d points"
-, journal =	"ACM Trans. Graph."
-, volume =	9
-, number =	1
-, year =	1990
-, pages =	"105--132"
-, keywords =	"implementing algorithms, three-dimensional, convex hull, points"
-, cites =	"ph-chfsp-77"
-, update =	"93.09 held"
+, author =      "A. M. Day"
+, title =       "The implementation of an algorithm to find the convex hull of a set of $3$-d points"
+, journal =     "ACM Trans. Graph."
+, volume =      9
+, number =      1
+, year =        1990
+, pages =       "105--132"
+, keywords =    "implementing algorithms, three-dimensional, convex hull, points"
+, cites =       "ph-chfsp-77"
+, update =      "93.09 held"
 }
 
 @techreport{de-eaahc-83
-, author =	"W. H. E. Day and H. Edelsbrunner"
-, title =	"Efficient algorithms for agglomerative hierarchical clustering methods"
-, type =	"Report"
-, number =	"F122"
-, institution =	"Inst. Informationsverarb., Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1983
-, update =	"98.07 smid, 97.11 bibrelex"
+, author =      "W. H. E. Day and H. Edelsbrunner"
+, title =       "Efficient algorithms for agglomerative hierarchical clustering methods"
+, type =        "Report"
+, number =      "F122"
+, institution = "Inst. Informationsverarb., Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1983
+, update =      "98.07 smid, 97.11 bibrelex"
 }
 
 @article{de-eaahc-84
-, author =	"W. H. E. Day and H. Edelsbrunner"
-, title =	"Efficient algorithms for agglomerative hierarchical clustering methods"
-, journal =	"J. Classif."
-, volume =	1
-, year =	1984
-, pages =	"7--24"
-, keywords =	"design of algorithms, cluster analysis, discrete geometry, construction, packing, worst-case analysis"
+, author =      "W. H. E. Day and H. Edelsbrunner"
+, title =       "Efficient algorithms for agglomerative hierarchical clustering methods"
+, journal =     "J. Classif."
+, volume =      1
+, year =        1984
+, pages =       "7--24"
+, keywords =    "design of algorithms, cluster analysis, discrete geometry, construction, packing, worst-case analysis"
 }
 
 @article{de-ipllc-85
-, author =	"W. H. E. Day and H. Edelsbrunner"
-, title =	"Investigation of proportional link linkage clustering methods"
-, journal =	"J. Classif."
-, volume =	2
-, year =	1985
-, pages =	"239--254"
-, keywords =	"design of algorithms, cluster analysis, worst-case analysis"
+, author =      "W. H. E. Day and H. Edelsbrunner"
+, title =       "Investigation of proportional link linkage clustering methods"
+, journal =     "J. Classif."
+, volume =      2
+, year =        1985
+, pages =       "239--254"
+, keywords =    "design of algorithms, cluster analysis, worst-case analysis"
 }
 
 @article{d-otmgc-91
-, author =	"E. F. {D'Azevedo}"
-, title =	"Optimal triangular mesh generation by coordinate transformation"
-, journal =	"SIAM J. Sci. Statist. Comput."
-, volume =	12
-, number =	4
-, year =	1991
-, pages =	"755--786"
-, keywords =	"triangulation"
-, update =	"95.09 korneenko"
+, author =      "E. F. {D'Azevedo}"
+, title =       "Optimal triangular mesh generation by coordinate transformation"
+, journal =     "SIAM J. Sci. Statist. Comput."
+, volume =      12
+, number =      4
+, year =        1991
+, pages =       "755--786"
+, keywords =    "triangulation"
+, update =      "95.09 korneenko"
 }
 
 @article{ds-oiti-89
-, author =	"E. F. {D'Azevedo} and R. B. Simpson"
-, title =	"On optimal interpolation triangle incidences"
-, journal =	"SIAM J. Sci. Statist. Comput."
-, volume =	10
-, number =	6
-, year =	1989
-, pages =	"1063--1075"
-, keywords =	"Delaunay triangulation"
-, update =	"95.09 korneenko"
-, annote =	"What triangulation minimizes error if we are
-		 interpolating a convex quadratic function? First we
-		 scale so that contours of the function are turned from
-		 ellipses into circles. Error is proportional to area of
-		 minimum containing circle. Another proof that DT
-		 minimizes circumradii."
+, author =      "E. F. {D'Azevedo} and R. B. Simpson"
+, title =       "On optimal interpolation triangle incidences"
+, journal =     "SIAM J. Sci. Statist. Comput."
+, volume =      10
+, number =      6
+, year =        1989
+, pages =       "1063--1075"
+, keywords =    "Delaunay triangulation"
+, update =      "95.09 korneenko"
+, annote =      "What triangulation minimizes error if we are
+                 interpolating a convex quadratic function? First we
+                 scale so that contours of the function are turned from
+                 ellipses into circles. Error is proportional to area of
+                 minimum containing circle. Another proof that DT
+                 minimizes circumradii."
 }
 
 @inproceedings{d-gbaof-87
-, author =	"L. {De Floriani}"
-, title =	"A graph based approach to object feature recognition"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"100--109"
-, cites =	"adf-efgrs-84, adf-gmsou-85, bj-tdor-85, h-efitd-84, ht-dgtc-73, k-sccad-80, r-rrstm-80, s-adfbr-81, t-dfslg-72, w-ebdss-85, w-tsgm-86, w-fevd-82, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "L. {De Floriani}"
+, title =       "A graph based approach to object feature recognition"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "100--109"
+, cites =       "adf-efgrs-84, adf-gmsou-85, bj-tdor-85, h-efitd-84, ht-dgtc-73, k-sccad-80, r-rrstm-80, s-adfbr-81, t-dfslg-72, w-ebdss-85, w-tsgm-86, w-fevd-82, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{d-pdstb-89
-, author =	"L. {De Floriani}"
-, title =	"A Pyramidal Data Structure for Triangle-Based Surface Description"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	9
-, number =	2
-, month =	mar
-, year =	1989
-, pages =	"67--78"
-, update =	"97.03 agarwal, 95.09 korneenko, 93.09 held"
+, author =      "L. {De Floriani}"
+, title =       "A Pyramidal Data Structure for Triangle-Based Surface Description"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      9
+, number =      2
+, month =       mar
+, year =        1989
+, pages =       "67--78"
+, update =      "97.03 agarwal, 95.09 korneenko, 93.09 held"
 }
 
 @article{d-dseti-87
-, author =	"Leila {De Floriani}"
-, title =	"Data Structures for Encoding Triangulated Irregular Networks"
-, journal =	"Adv. Eng. Softw."
-, volume =	9
-, number =	3
-, year =	1987
-, pages =	"122--128"
-, annote =	"Describes some choices for data structures for
-		 representing a triangulation, and methods for
-		 point-location, edge-neighbour and vertex-neighbour
-		 problems."
+, author =      "Leila {De Floriani}"
+, title =       "Data Structures for Encoding Triangulated Irregular Networks"
+, journal =     "Adv. Eng. Softw."
+, volume =      9
+, number =      3
+, year =        1987
+, pages =       "122--128"
+, annote =      "Describes some choices for data structures for
+                 representing a triangulation, and methods for
+                 point-location, edge-neighbour and vertex-neighbour
+                 problems."
 }
 
 @article{d-srbtg-87
-, author =	"Leila {De Floriani}"
-, title =	"Surface representations based on triangular grids"
-, journal =	"Visual Comput."
-, volume =	3
-, number =	1
-, month =	feb
-, year =	1987
-, pages =	"27--50"
-, keywords =	"triangulation, trees, data structures"
+, author =      "Leila {De Floriani}"
+, title =       "Surface representations based on triangular grids"
+, journal =     "Visual Comput."
+, volume =      3
+, number =      1
+, month =       feb
+, year =        1987
+, pages =       "27--50"
+, keywords =    "triangulation, trees, data structures"
 }
 
 @article{df-hbmso-88
-, author =	"L. {De Floriani} and B. Falcidieno"
-, title =	"A hierarchical boundary model for solid object representation"
-, journal =	"ACM Trans. Graph."
-, volume =	7
-, year =	1988
-, pages =	"42--60"
+, author =      "L. {De Floriani} and B. Falcidieno"
+, title =       "A hierarchical boundary model for solid object representation"
+, journal =     "ACM Trans. Graph."
+, volume =      7
+, year =        1988
+, pages =       "42--60"
 }
 
 @article{dfnp-hssa-84
-, author =	"Leila {De Floriani} and Bianca Falcidieno and George Nagy and Caterina Pienovi"
-, title =	"Hierarchical Structure For Surface Approximation"
-, journal =	"Comput. Graph. (UK)"
-, volume =	8
-, number =	2
-, year =	1984
-, pages =	"183--193"
-, keywords =	"surface approximation, hierarchical triangulation, tree data structure, data points, structured graph representation"
-, update =	"96.09 devillers"
-, annote =	"3 way division into triangles."
-, abstract =	"Hierarchical triangulation is a method for point
-		 selection and surface representation where the surface
-		 is approximated at successively finer levels of detail
-		 by triangular patches whose projections in the
-		 horizontal plane are nested. A tree data structure for
-		 this representation can be constructed in O(n**2) worst
-		 case and O(n log n) average case time, where n is the
-		 number of data points considered. Efficient algorithms
-		 for approximation of the elevation of an arbitrary
-		 point, contour extraction, and conversion of the
-		 hierarchical structure into an ordinary triangulated
-		 irregular network, are demonstrated. The convergence
-		 and the optimality of the approximation and the
-		 relationship of the hierarchical triangulation to a
-		 structured graph representation are examined. 9 refs."
+, author =      "Leila {De Floriani} and Bianca Falcidieno and George Nagy and Caterina Pienovi"
+, title =       "Hierarchical Structure For Surface Approximation"
+, journal =     "Comput. Graph. (UK)"
+, volume =      8
+, number =      2
+, year =        1984
+, pages =       "183--193"
+, keywords =    "surface approximation, hierarchical triangulation, tree data structure, data points, structured graph representation"
+, update =      "96.09 devillers"
+, annote =      "3 way division into triangles."
+, abstract =    "Hierarchical triangulation is a method for point
+                 selection and surface representation where the surface
+                 is approximated at successively finer levels of detail
+                 by triangular patches whose projections in the
+                 horizontal plane are nested. A tree data structure for
+                 this representation can be constructed in O(n**2) worst
+                 case and O(n log n) average case time, where n is the
+                 number of data points considered. Efficient algorithms
+                 for approximation of the elevation of an arbitrary
+                 point, contour extraction, and conversion of the
+                 hierarchical structure into an ordinary triangulated
+                 irregular network, are demonstrated. The convergence
+                 and the optimality of the approximation and the
+                 relationship of the hierarchical triangulation to a
+                 structured graph representation are examined. 9 refs."
 }
 
 @article{dfnp-stdt-91
-, author =	"L. {De Floriani} and B. Falcidieno and G. Nagy and C. Pienovi"
-, title =	"On sorting triangles in a {Delaunay} tessellation"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"522--532"
+, author =      "L. {De Floriani} and B. Falcidieno and G. Nagy and C. Pienovi"
+, title =       "On sorting triangles in a {Delaunay} tessellation"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "522--532"
 }
 
 @techreport{dfnp-ptduv-89
-, author =	"L. {De Floriani} and B. Falcidieno and G. Nagy and C. Pienovi"
-, title =	"Polyhedral terrain description using visibility criteria"
-, number =	"17/89"
-, institution =	"CNR, Genova"
-, year =	1989
-, update =	"95.09 korneenko"
+, author =      "L. {De Floriani} and B. Falcidieno and G. Nagy and C. Pienovi"
+, title =       "Polyhedral terrain description using visibility criteria"
+, number =      "17/89"
+, institution = "CNR, Genova"
+, year =        1989
+, update =      "95.09 korneenko"
 }
 
 @article{dfp-dbrsd-85
-, author =	"L. {De Floriani} and B. Falcidieno and C. Pienovi"
-, title =	"{Delaunay}-based Representation of Surfaces Defined over Arbitrarily Shaped Domains"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	32
-, year =	1985
-, pages =	"127--140"
-, annote =	"CDT for surface fitting. Incremental algorithm. Points
-		 (where greatest error occurs) added until desired
-		 accuracy reached. ($O(N\log N)$) average, $O(N^2)$
-		 worst."
+, author =      "L. {De Floriani} and B. Falcidieno and C. Pienovi"
+, title =       "{Delaunay}-based Representation of Surfaces Defined over Arbitrarily Shaped Domains"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      32
+, year =        1985
+, pages =       "127--140"
+, annote =      "CDT for surface fitting. Incremental algorithm. Points
+                 (where greatest error occurs) added until desired
+                 accuracy reached. ($O(N\log N)$) average, $O(N^2)$
+                 worst."
 }
 
 @inproceedings{dfp-grhsm-84
-, author =	"L. {De Floriani} and B. Falcidieno and C. Pienovi"
-, title =	"Graph Representation Of a Hierarchical Surface Model"
-, booktitle =	"Proc. 7th IEEE Internat. Conf. Pattern Recogn."
-, publisher =	"IEEE"
-, address =	"New York, NY"
-, year =	1984
-, pages =	"1093--1096"
-, keywords =	"triangulation, hierarchical structures, surface models, graph representation"
-, annote =	"Nested triangulation for surface representation."
-, abstract =	"The paper describes a hierarchical structure for
-		 representing surfaces defined at arbitrarily
-		 distributed data points. The surface is approximated at
-		 increasing levels of accuracy by a network of
-		 triangular, planar faces whose projections in the plane
-		 are nested, which is called hierarchical triangulation.
-		 A dual representation of this triangulation as a
-		 vertex- structured graph is defined, and some basic
-		 properties of this representation are discussed.
-		 Algorithms for constructing a hierarchical
-		 triangulation and for converting it to its dual form
-		 are given. 12 refs."
+, author =      "L. {De Floriani} and B. Falcidieno and C. Pienovi"
+, title =       "Graph Representation Of a Hierarchical Surface Model"
+, booktitle =   "Proc. 7th IEEE Internat. Conf. Pattern Recogn."
+, publisher =   "IEEE"
+, address =     "New York, NY"
+, year =        1984
+, pages =       "1093--1096"
+, keywords =    "triangulation, hierarchical structures, surface models, graph representation"
+, annote =      "Nested triangulation for surface representation."
+, abstract =    "The paper describes a hierarchical structure for
+                 representing surfaces defined at arbitrarily
+                 distributed data points. The surface is approximated at
+                 increasing levels of accuracy by a network of
+                 triangular, planar faces whose projections in the plane
+                 are nested, which is called hierarchical triangulation.
+                 A dual representation of this triangulation as a
+                 vertex- structured graph is defined, and some basic
+                 properties of this representation are discussed.
+                 Algorithms for constructing a hierarchical
+                 triangulation and for converting it to its dual form
+                 are given. 12 refs."
 }
 
 @article{dfp-sgrht-89
-, author =	"L. {De Floriani} and B. Falcidieno and C. Pienovi"
-, title =	"Structured Graph Representation of a Hierarchical Triangulation"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	45
-, number =	2
-, month =	feb
-, year =	1989
-, pages =	"215--226"
-, keywords =	"hierarchical triangulation, structured graph representation, surface representation"
-, annote =	"Each triangle is split into three."
-, abstract =	"The problem of representing a 2 1/2-dimensional
-		 surface at variable degrees of accuracy is considered.
-		 A hierarchical model, called a hierarchical
-		 triangulation, is described which approximates a
-		 surface by a network of triangular, planar facets whose
-		 projections in the plane are nested. In the paper, a
-		 dual representation of such a triangulation in the form
-		 of a structured graph is defined and the fundamental
-		 properties of this representation are discussed. An
-		 algorithm for converting a hierarchical triangulation
-		 into its dual form is given. As an example of
-		 application, an algorithm is described for the
-		 conversion of the dual graph into the standard
-		 triangle-oriented structure used for encoding
-		 triangulated irregular networks. (Author abstract) 15
-		 Refs."
+, author =      "L. {De Floriani} and B. Falcidieno and C. Pienovi"
+, title =       "Structured Graph Representation of a Hierarchical Triangulation"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      45
+, number =      2
+, month =       feb
+, year =        1989
+, pages =       "215--226"
+, keywords =    "hierarchical triangulation, structured graph representation, surface representation"
+, annote =      "Each triangle is split into three."
+, abstract =    "The problem of representing a 2 1/2-dimensional
+                 surface at variable degrees of accuracy is considered.
+                 A hierarchical model, called a hierarchical
+                 triangulation, is described which approximates a
+                 surface by a network of triangular, planar facets whose
+                 projections in the plane are nested. In the paper, a
+                 dual representation of such a triangulation in the form
+                 of a structured graph is defined and the fundamental
+                 properties of this representation are discussed. An
+                 algorithm for converting a hierarchical triangulation
+                 into its dual form is given. As an example of
+                 application, an algorithm is described for the
+                 conversion of the dual graph into the standard
+                 triangle-oriented structure used for encoding
+                 triangulated irregular networks. (Author abstract) 15
+                 Refs."
 }
 
 @techreport{dfpn-stdt-88
-, author =	"L. {De Floriani} and B. Falcidieno and C. Pienovi and G. Nagy"
-, title =	"On sorting triangles in a {Delaunay} tessellation"
-, institution =	"Instituto per la Matematica Applicata, Consiglio Nazionale delle Richerche"
-, address =	"Genova, Italy"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "L. {De Floriani} and B. Falcidieno and C. Pienovi and G. Nagy"
+, title =       "On sorting triangles in a {Delaunay} tessellation"
+, institution = "Instituto per la Matematica Applicata, Consiglio Nazionale delle Richerche"
+, address =     "Genova, Italy"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @article{dm-hchtt-95
-, author =	"L. {De Floriani} and P. Magillo"
-, title =	"Horizon computation on a hierarchical triangulated terrain model"
-, journal =	"Visual Comput."
-, volume =	11
-, year =	1995
-, pages =	"134--149"
-, update =	"95.05 smid"
+, author =      "L. {De Floriani} and P. Magillo"
+, title =       "Horizon computation on a hierarchical triangulated terrain model"
+, journal =     "Visual Comput."
+, volume =      11
+, year =        1995
+, pages =       "134--149"
+, update =      "95.05 smid"
 }
 
 @incollection{dmp-acggi-00
-, author =	"Leila {de Floriani} and Paola Magillo and Enrico Puppo"
-, title =	"Applications of Computational Geometry to Geographic Information Systems"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"333--388"
-, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 7 of su-hcg-00"
+, author =      "Leila {de Floriani} and Paola Magillo and Enrico Puppo"
+, title =       "Applications of Computational Geometry to Geographic Information Systems"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "333--388"
+, update =      "00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 7 of su-hcg-00"
 }
 
 @inproceedings{dmp-htmsf-94
-, author =	"L. {De Floriani} and P. Marzano and E. Puppo"
-, title =	"Hierarchical terrain models: {Survey} and formalization"
-, booktitle =	"Proc. IEEE Sympos. Applied Comput."
-, year =	1994
-, pages =	"323--327"
-, update =	"98.03 bibrelex"
+, author =      "L. {De Floriani} and P. Marzano and E. Puppo"
+, title =       "Hierarchical terrain models: {Survey} and formalization"
+, booktitle =   "Proc. IEEE Sympos. Applied Comput."
+, year =        1994
+, pages =       "323--327"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{dn-tarod-89
-, author =	"L. {De Floriani} and G. Nagy"
-, title =	"Two algorithms for radial ordering of {Delaunay} triangles"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	40
+, author =      "L. {De Floriani} and G. Nagy"
+, title =       "Two algorithms for radial ordering of {Delaunay} triangles"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       40
 }
 
 @techreport{dn-vpts-88
-, author =	"L. {De Floriani} and G. Nagy"
-, title =	"Visibility problems on a topographic surface"
-, number =	59
-, institution =	"CNR, Genova"
-, year =	1988
-, update =	"95.09 korneenko"
+, author =      "L. {De Floriani} and G. Nagy"
+, title =       "Visibility problems on a topographic surface"
+, number =      59
+, institution = "CNR, Genova"
+, year =        1988
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{dnj-vcgsi-89
-, author =	"L. {De Floriani} and G. Nagy and P. Jeanne"
-, title =	"Visibility characteristics of grey-scale images"
-, booktitle =	"Fifth International Conference on Image Analysis and Processing"
-, site =	"Positano, Italy"
-, month =	sep
-, year =	1989
-, update =	"95.09 korneenko"
+, author =      "L. {De Floriani} and G. Nagy and P. Jeanne"
+, title =       "Visibility characteristics of grey-scale images"
+, booktitle =   "Fifth International Conference on Image Analysis and Processing"
+, site =        "Positano, Italy"
+, month =       sep
+, year =        1989
+, update =      "95.09 korneenko"
 }
 
 @techreport{dnn-vocsc-88
-, author =	"L. {De Floriani} and G. Nagy and H. Nair"
-, title =	"Visibility oriented criteria for surface characterization"
-, number =	"CGL-88-824"
-, institution =	"Rensselaer Polytechnic Institute"
-, year =	1988
-, update =	"95.09 korneenko"
+, author =      "L. {De Floriani} and G. Nagy and H. Nair"
+, title =       "Visibility oriented criteria for surface characterization"
+, number =      "CGL-88-824"
+, institution = "Rensselaer Polytechnic Institute"
+, year =        1988
+, update =      "95.09 korneenko"
 }
 
 @incollection{fp-htbmt-92
-, author =	"L. {De Floriani} and E. Puppo"
-, title =	"A hierarchical triangle-based model for terrain description"
-, booktitle =	"Theories and Methods of Spatio-Temporal Reasoning in Geographic Space"
-, publisher =	"??"
-, address =	"Pisa"
-, month =	sep
-, year =	1992
-, pages =	"236--251"
-, update =	"98.11 bibrelex"
+, author =      "L. {De Floriani} and E. Puppo"
+, title =       "A hierarchical triangle-based model for terrain description"
+, booktitle =   "Theories and Methods of Spatio-Temporal Reasoning in Geographic Space"
+, publisher =   "??"
+, address =     "Pisa"
+, month =       sep
+, year =        1992
+, pages =       "236--251"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{dp-scdta-89
-, author =	"L. {De Floriani} and E. Puppo"
-, title =	"A survey of constrained {Delaunay} triangulation algorithms for surface representaion"
-, editor =	"G. G. Pieroni"
-, booktitle =	"Issues on Machine Vision"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1989
-, pages =	"95--104"
-, update =	"94.09 bernal"
+, author =      "L. {De Floriani} and E. Puppo"
+, title =       "A survey of constrained {Delaunay} triangulation algorithms for surface representaion"
+, editor =      "G. G. Pieroni"
+, booktitle =   "Issues on Machine Vision"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1989
+, pages =       "95--104"
+, update =      "94.09 bernal"
 }
 
 @unpublished{dp-olacd-91
-, author =	"L. {De Floriani} and E. Puppo"
-, title =	"An on-line algorithm for constrained {Delaunay} triangulation"
-, month =	may
-, year =	1991
-, note =	"Unpublished manuscipts"
-, precedes =	"dp-olacd-92"
-, update =	"98.07 bibrelex"
+, author =      "L. {De Floriani} and E. Puppo"
+, title =       "An on-line algorithm for constrained {Delaunay} triangulation"
+, month =       may
+, year =        1991
+, note =        "Unpublished manuscipts"
+, precedes =    "dp-olacd-92"
+, update =      "98.07 bibrelex"
 }
 
 @article{dp-olacd-92
-, author =	"L. {De Floriani} and E. Puppo"
-, title =	"An on-line algorithm for constrained {Delaunay} triangulation"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	54
-, number =	3
-, year =	1992
-, pages =	"290--300"
-, succeeds =	"dp-olacd-91"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 95.09 mitchell"
-, annote =	"In this paper you will find the definition of a Constrained
-		 Delaunay Triangulation, some theorems and the pseudocode of
-		 the algorithms to program it. On-Line means that you can
-		 insert points and required edges in any order. With this
-		 algorithm you can update an old CDT without retriangulating
-		 the old data."
+, author =      "L. {De Floriani} and E. Puppo"
+, title =       "An on-line algorithm for constrained {Delaunay} triangulation"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      54
+, number =      3
+, year =        1992
+, pages =       "290--300"
+, succeeds =    "dp-olacd-91"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 95.09 mitchell"
+, annote =      "In this paper you will find the definition of a Constrained
+                 Delaunay Triangulation, some theorems and the pseudocode of
+                 the algorithms to program it. On-Line means that you can
+                 insert points and required edges in any order. With this
+                 algorithm you can update an old CDT without retriangulating
+                 the old data."
 }
 
 @inproceedings{dp-cdtms-88
-, author =	"Leila {De Floriani} and Enrico Puppo"
-, title =	"Constrained {Delaunay} Triangulation for Multiresolution Surface Description"
-, booktitle =	"Proc. Ninth IEEE International Conference on Pattern Recognition"
-, publisher =	"CS Press"
-, address =	"Los Alamitos, California"
-, year =	1988
-, pages =	"566--569"
-, annote =	"Incremental algorithm for the CDT. Point insertion is
-		 done by joining to vertices of the containing triangle,
-		 and then using switches. Segment insertion is done by
-		 deleting intersected triangles, triangulating the two
-		 resulting polygons (non-Delaunay) and switching on the
-		 resulting mess."
+, author =      "Leila {De Floriani} and Enrico Puppo"
+, title =       "Constrained {Delaunay} Triangulation for Multiresolution Surface Description"
+, booktitle =   "Proc. Ninth IEEE International Conference on Pattern Recognition"
+, publisher =   "CS Press"
+, address =     "Los Alamitos, California"
+, year =        1988
+, pages =       "566--569"
+, annote =      "Incremental algorithm for the CDT. Point insertion is
+                 done by joining to vertices of the containing triangle,
+                 and then using switches. Segment insertion is done by
+                 deleting intersected triangles, triangulating the two
+                 resulting polygons (non-Delaunay) and switching on the
+                 resulting mess."
 }
 
 @inproceedings{dw-vmdrc-00
-, author =	"Jes{\'u}s A. {De Loera} and Frederick J. Wicklin"
-, title =	"Viro's Method Disproves {Ragsdale}'s Conjecture: a Story"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"371--372"
-, keywords =	"video review"
-, update =	"00.11 jones"
+, author =      "Jes{\'u}s A. {De Loera} and Frederick J. Wicklin"
+, title =       "Viro's Method Disproves {Ragsdale}'s Conjecture: a Story"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "371--372"
+, keywords =    "video review"
+, update =      "00.11 jones"
 }
 
 @article{dd-esrpi-00
-, author =	"C. N. {De Meneses} and C. C. {De Souza}"
-, title =	"Exact solutions of rectangular partitions via integer programming"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, year =	2000
-, pages =	"477--522"
-, update =	"01.04 smid"
+, author =      "C. N. {De Meneses} and C. C. {De Souza}"
+, title =       "Exact solutions of rectangular partitions via integer programming"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, year =        2000
+, pages =       "477--522"
+, update =      "01.04 smid"
 }
 
 @article{dr-twcbp-90
-, author =	"C. C. {De Souza} and C. C. Ribeiro"
-, title =	"A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear {Steiner} tree problem"
-, journal =	"OR Spektrum"
-, volume =	12
-, year =	1990
-, pages =	"109--111"
-, keywords =	"Steiner tree, $L_{1}$ metric, heuristics"
-, update =	"95.09 korneenko"
+, author =      "C. C. {De Souza} and C. C. Ribeiro"
+, title =       "A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear {Steiner} tree problem"
+, journal =     "OR Spektrum"
+, volume =      12
+, year =        1990
+, pages =       "109--111"
+, keywords =    "Steiner tree, $L_{1}$ metric, heuristics"
+, update =      "95.09 korneenko"
 }
 
 @article{dr-hmrst-93
-, author =	"C. C. {De Souza} and C. C. Ribeiro"
-, title =	"Heuristics for the minimum rectilinear {Steiner} tree problem: new algorithms and a computational study"
-, journal =	"Discrete Appl. Math."
-, volume =	45
-, number =	3
-, year =	1993
-, pages =	"205--220"
-, keywords =	"Steiner tree, $L_{1}$ metric, heuristics"
-, update =	"95.09 korneenko"
+, author =      "C. C. {De Souza} and C. C. Ribeiro"
+, title =       "Heuristics for the minimum rectilinear {Steiner} tree problem: new algorithms and a computational study"
+, journal =     "Discrete Appl. Math."
+, volume =      45
+, number =      3
+, year =        1993
+, pages =       "205--220"
+, keywords =    "Steiner tree, $L_{1}$ metric, heuristics"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{dh-rvrbg-95
-, author =	"A. M. Dean and J. P. Hutchinson"
-, title =	"Rectangle-Visibility Representations of Bipartite Graphs"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"159--166"
-, keywords =	"graph drawing, visibility"
-, update =	"95.01 tamassia"
+, author =      "A. M. Dean and J. P. Hutchinson"
+, title =       "Rectangle-Visibility Representations of Bipartite Graphs"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "159--166"
+, keywords =    "graph drawing, visibility"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{dls-rphe-86
-, author =	"J. A. Dean and A. Lingas and J.-R. Sack"
-, title =	"Recognizing polygons: or how to eavesdrop"
-, booktitle =	"Proc. 24th Allerton Conf. Commun. Control Comput."
-, year =	1986
-, pages =	"324--333"
-, precedes =	"dls-rphs-88"
+, author =      "J. A. Dean and A. Lingas and J.-R. Sack"
+, title =       "Recognizing polygons: or how to eavesdrop"
+, booktitle =   "Proc. 24th Allerton Conf. Commun. Control Comput."
+, year =        1986
+, pages =       "324--333"
+, precedes =    "dls-rphs-88"
 }
 
 @article{dls-rphs-88
-, author =	"J. A. Dean and A. Lingas and J.-R. Sack"
-, title =	"Recognizing polygons, or how to spy"
-, journal =	"Visual Comput."
-, volume =	3
-, year =	1988
-, pages =	"344--355"
-, keywords =	"computer graphics, visibility, hidden line/surface elimination, polygons, two-dimensional"
-, succeeds =	"dls-rphe-86"
+, author =      "J. A. Dean and A. Lingas and J.-R. Sack"
+, title =       "Recognizing polygons, or how to spy"
+, journal =     "Visual Comput."
+, volume =      3
+, year =        1988
+, pages =       "344--355"
+, keywords =    "computer graphics, visibility, hidden line/surface elimination, polygons, two-dimensional"
+, succeeds =    "dls-rphe-86"
 }
 
 @inproceedings{ds-ehlec-85
-, author =	"J. A. Dean and J.-R. Sack"
-, title =	"Efficient hidden-line elimination by capturing winding information"
-, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
-, year =	1985
-, pages =	"496--505"
-, keywords =	"computer graphics, visibility, convex hull, hidden line/surface elimination, polygons, two-dimensional"
+, author =      "J. A. Dean and J.-R. Sack"
+, title =       "Efficient hidden-line elimination by capturing winding information"
+, booktitle =   "Proc. 23rd Allerton Conf. Commun. Control Comput."
+, year =        1985
+, pages =       "496--505"
+, keywords =    "computer graphics, visibility, convex hull, hidden line/surface elimination, polygons, two-dimensional"
 }
 
 @techreport{d-mes-90
-, author =	"N. Dean"
-, title =	"The Matching Extendability of Surfaces"
-, type =	"Technical {Report}"
-, number =	"90-14"
-, institution =	"DIMACS, Rutgers Univ."
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "N. Dean"
+, title =       "The Matching Extendability of Surfaces"
+, type =        "Technical {Report}"
+, number =      "90-14"
+, institution = "DIMACS, Rutgers Univ."
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{dmm-nigsn-??
-, author =	"N. Dean and M. Mevenkamp and C. Monma"
-, title =	"Netpad: {An} interactive graphics system for network modeling and optimization"
-, institution =	"Bellcore"
-, year =	"??"
-, keywords =	"user interface, graph algorithms, windows, graphics, networks, crossing number"
-, update =	"93.09 milone+mitchell"
+, author =      "N. Dean and M. Mevenkamp and C. Monma"
+, title =       "Netpad: {An} interactive graphics system for network modeling and optimization"
+, institution = "Bellcore"
+, year =        "??"
+, keywords =    "user interface, graph algorithms, windows, graphics, networks, crossing number"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{d-htrt-81
-, author =	"S. R. Deans"
-, title =	"Hough Transform from the {Radon} transform"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-3"
-, number =	2
-, month =	mar
-, year =	1981
-, pages =	"185--188"
-, update =	"97.11 bibrelex"
+, author =      "S. R. Deans"
+, title =       "Hough Transform from the {Radon} transform"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-3"
+, number =      2
+, month =       mar
+, year =        1981
+, pages =       "185--188"
+, update =      "97.11 bibrelex"
 }
 
 @article{d-lp-85
-, author =	"P. M. Dearing"
-, title =	"Location problems"
-, journal =	"Oper. Res. Lett."
-, volume =	4
-, number =	3
-, year =	1985
-, pages =	"95--98"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "P. M. Dearing"
+, title =       "Location problems"
+, journal =     "Oper. Res. Lett."
+, volume =      4
+, number =      3
+, year =        1985
+, pages =       "95--98"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @book{del-avceb-83
-, author =	"Donald P. DeBoer and Frederick T. Evers and Douglas Garfield Link"
-, title =	"Analysis of Variance: Comparative Examples, {BALANOVA}, {BMDP} and {SPSS}"
-, publisher =	"Social Science Computing Laboratory, University of Western Ontario"
-, address =	"London, Ontario, Canada"
-, year =	1983
-, isbn =	"0-7714-0427-1"
-, update =	"95.05 agarwal"
+, author =      "Donald P. DeBoer and Frederick T. Evers and Douglas Garfield Link"
+, title =       "Analysis of Variance: Comparative Examples, {BALANOVA}, {BMDP} and {SPSS}"
+, publisher =   "Social Science Computing Laboratory, University of Western Ontario"
+, address =     "London, Ontario, Canada"
+, year =        1983
+, isbn =        "0-7714-0427-1"
+, update =      "95.05 agarwal"
 }
 
 @article{d-httdb-70
-, author =	"H. Debrunner"
-, title =	"Helly type theorems derived from basic singular homology"
-, journal =	"Amer. Math. Monthly"
-, volume =	77
-, year =	1970
-, pages =	"375--380"
-, update =	"95.01 matousek"
+, author =      "H. Debrunner"
+, title =       "Helly type theorems derived from basic singular homology"
+, journal =     "Amer. Math. Monthly"
+, volume =      77
+, year =        1970
+, pages =       "375--380"
+, update =      "95.01 matousek"
 }
 
 @article{dm-cycys-86
-, author =	"H. E. Debrunner and P. Mani-Levitska"
-, title =	"Can you cover your shadows?"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"45--58"
+, author =      "H. E. Debrunner and P. Mani-Levitska"
+, title =       "Can you cover your shadows?"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "45--58"
 }
 
 @article{d-gc-95
-, author =	"Michael Deering"
-, title =	"Geometry compression"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1995
-, pages =	"13--20"
-, note =	"Proc. SIGGRAPH '95"
-, keywords =	"triangulation, surface approximation, computer graphics, hardware, graphics pipeline"
-, update =	"95.09 mitchell"
+, author =      "Michael Deering"
+, title =       "Geometry compression"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1995
+, pages =       "13--20"
+, note =        "Proc. SIGGRAPH '95"
+, keywords =    "triangulation, surface approximation, computer graphics, hardware, graphics pipeline"
+, update =      "95.09 mitchell"
 }
 
 @article{d-eaclm-77
-, author =	"D. Defays"
-, title =	"An efficient algorithm for a complete link method"
-, journal =	"Comput. J."
-, volume =	20
-, year =	1977
-, pages =	"364--366"
-, update =	"00.03 bibrelex"
+, author =      "D. Defays"
+, title =       "An efficient algorithm for a complete link method"
+, journal =     "Comput. J."
+, volume =      20
+, year =        1977
+, pages =       "364--366"
+, update =      "00.03 bibrelex"
 }
 
 @article{df-cabcc-74
-, author =	"V. U. Degtyar and M. Ya. Finkel'shteyn"
-, title =	"Classification algorithms based on construction of convex hulls of sets"
-, journal =	"Eng. Cybern."
-, volume =	12
-, year =	1974
-, pages =	"150--154"
-, update =	"96.01 korneenko"
+, author =      "V. U. Degtyar and M. Ya. Finkel'shteyn"
+, title =       "Classification algorithms based on construction of convex hulls of sets"
+, journal =     "Eng. Cybern."
+, volume =      12
+, year =        1974
+, pages =       "150--154"
+, update =      "96.01 korneenko"
 }
 
 @article{dz-sorpa-91
-, author =	"M. J. {DeHaemer, Jr.} and M. J. Zyda"
-, title =	"Simplification of objects rendered by Polygonal Approximations"
-, journal =	"Computers \& Graphics"
-, volume =	15
-, number =	2
-, year =	1991
-, pages =	"175--184"
-, keywords =	"surface approximation, simplification"
-, update =	"97.11 bibrelex, 95.01 mitchell"
+, author =      "M. J. {DeHaemer, Jr.} and M. J. Zyda"
+, title =       "Simplification of objects rendered by Polygonal Approximations"
+, journal =     "Computers \& Graphics"
+, volume =      15
+, number =      2
+, year =        1991
+, pages =       "175--184"
+, keywords =    "surface approximation, simplification"
+, update =      "97.11 bibrelex, 95.01 mitchell"
 }
 
 @article{d-tdkaz-12
-, author =	"M. Dehn"
-, title =	"Transformation der {Kurven} auf zweiseitigen {Fl{\"a}chen}"
-, journal =	"Math. Ann."
-, volume =	72
-, year =	1912
-, pages =	"413--421"
-, update =	"97.11 bibrelex"
+, author =      "M. Dehn"
+, title =       "Transformation der {Kurven} auf zweiseitigen {Fl{\"a}chen}"
+, journal =     "Math. Ann."
+, volume =      72
+, year =        1912
+, pages =       "413--421"
+, update =      "97.11 bibrelex"
 }
 
 @article{d-uudg-12
-, author =	"M. Dehn"
-, title =	"{\"U}ber unendliche diskontinuierliche {Gruppen}"
-, journal =	"Math. Ann."
-, volume =	71
-, number =	"104--116"
-, year =	1912
-, update =	"97.11 bibrelex"
+, author =      "M. Dehn"
+, title =       "{\"U}ber unendliche diskontinuierliche {Gruppen}"
+, journal =     "Math. Ann."
+, volume =      71
+, number =      "104--116"
+, year =        1912
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{d-odsal-85
-, author =	"F. Dehne"
-, title =	"A one dimensional systolic array for the largest empty rectangle problem"
-, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
-, year =	1985
-, pages =	"518--524"
-, update =	"94.01 dehne"
+, author =      "F. Dehne"
+, title =       "A one dimensional systolic array for the largest empty rectangle problem"
+, booktitle =   "Proc. Allerton Conf. Commun. Control Comput."
+, year =        1985
+, pages =       "518--524"
+, update =      "94.01 dehne"
 }
 
 @inproceedings{d-oacav-83
-, author =	"F. Dehne"
-, title =	"An ${O}(n^4)$ algorithm to construct all {Voronoi} diagrams for $k$ nearest neighbor searching in the {Euclidean} plane"
-, booktitle =	"Proc. Internat. Colloq. Automata Lang. Program."
-, year =	1983
-, pages =	""
-, update =	"94.01 dehne"
+, author =      "F. Dehne"
+, title =       "An ${O}(n^4)$ algorithm to construct all {Voronoi} diagrams for $k$ nearest neighbor searching in the {Euclidean} plane"
+, booktitle =   "Proc. Internat. Colloq. Automata Lang. Program."
+, year =        1983
+, pages =       ""
+, update =      "94.01 dehne"
 }
 
 @inproceedings{d-oacav-82
-, author =	"F. Dehne"
-, title =	"An optimal algorithm to construct all {Voronoi} diagrams for $k$ nearest neighbor searching in the {Euclidean} plane"
-, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
-, year =	1982
-, pages =	"85--93"
+, author =      "F. Dehne"
+, title =       "An optimal algorithm to construct all {Voronoi} diagrams for $k$ nearest neighbor searching in the {Euclidean} plane"
+, booktitle =   "Proc. 20th Allerton Conf. Commun. Control Comput."
+, year =        1982
+, pages =       "85--93"
 }
 
 @inproceedings{d-cgv-87
-, author =	"F. Dehne"
-, title =	"Computational geometry and VLSI"
-, booktitle =	"Proc. CompEuro Conference"
-, year =	1987
-, pages =	"870--875"
-, update =	"94.01 dehne"
+, author =      "F. Dehne"
+, title =       "Computational geometry and VLSI"
+, booktitle =   "Proc. CompEuro Conference"
+, year =        1987
+, pages =       "870--875"
+, update =      "94.01 dehne"
 }
 
 @inproceedings{d-cdvds-89
-, author =	"F. Dehne"
-, title =	"Computing digitized {Voronoi} diagrams on a systolic screen and applications to clustering"
-, booktitle =	"Proc. International Symposium on Optimal Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	401
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"14--24"
-, update =	"96.05 smid, 94.01 dehne"
+, author =      "F. Dehne"
+, title =       "Computing digitized {Voronoi} diagrams on a systolic screen and applications to clustering"
+, booktitle =   "Proc. International Symposium on Optimal Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      401
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "14--24"
+, update =      "96.05 smid, 94.01 dehne"
 }
 
 @article{d-clero-90
-, author =	"F. Dehne"
-, title =	"Computing the largest empty rectangle on one- and two-dimensional processor arrays"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	9
-, number =	1
-, year =	1990
-, pages =	"63--68"
-, update =	"94.01 dehne"
+, author =      "F. Dehne"
+, title =       "Computing the largest empty rectangle on one- and two-dimensional processor arrays"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      9
+, number =      1
+, year =        1990
+, pages =       "63--68"
+, update =      "94.01 dehne"
 }
 
 @article{d-oamee-86
-, author =	"F. Dehne"
-, title =	"$O(n^{1/2})$ algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computer"
-, journal =	"Inform. Process. Lett."
-, volume =	22
-, number =	6
-, year =	1986
-, pages =	"303--306"
-, update =	"94.01 dehne"
+, author =      "F. Dehne"
+, title =       "$O(n^{1/2})$ algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computer"
+, journal =     "Inform. Process. Lett."
+, volume =      22
+, number =      6
+, year =        1986
+, pages =       "303--306"
+, update =      "94.01 dehne"
 }
 
 @article{d-oc-86
-, author =	"Frank Dehne"
-, title =	"Optical clustering"
-, journal =	"Visual Comput."
-, volume =	2
-, number =	1
-, month =	jan
-, year =	1986
-, pages =	"39--43"
-, keywords =	"picture analysis"
+, author =      "Frank Dehne"
+, title =       "Optical clustering"
+, journal =     "Visual Comput."
+, volume =      2
+, number =      1
+, month =       jan
+, year =        1986
+, pages =       "39--43"
+, keywords =    "picture analysis"
 }
 
 @techreport{d-pcgcm-86
-, author =	"F. Dehne"
-, title =	"Parallel computational geometry and clustering methods"
-, type =	"Report"
-, number =	"SCS-TR-104"
-, institution =	"School Comput. Sci., Carleton Univ."
-, address =	"Ottawa, ON"
-, year =	1986
+, author =      "F. Dehne"
+, title =       "Parallel computational geometry and clustering methods"
+, type =        "Report"
+, number =      "SCS-TR-104"
+, institution = "School Comput. Sci., Carleton Univ."
+, address =     "Ottawa, ON"
+, year =        1986
 }
 
 @inproceedings{d-sgpmc-85
-, author =	"F. Dehne"
-, title =	"Solving geometric problems on mesh-connected and one-dimensional processor arrays"
-, booktitle =	"Proc. 11th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '85"
-, year =	1985
-, pages =	"43--59"
-, update =	"98.07 bibrelex, 94.01 dehne"
+, author =      "F. Dehne"
+, title =       "Solving geometric problems on mesh-connected and one-dimensional processor arrays"
+, booktitle =   "Proc. 11th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '85"
+, year =        1985
+, pages =       "43--59"
+, update =      "98.07 bibrelex, 94.01 dehne"
 }
 
 @article{d-svspm-88
-, author =	"F. Dehne"
-, title =	"Solving visibility and separability problems on a mesh of processors"
-, journal =	"Visual Comput."
-, volume =	3
-, year =	1988
-, pages =	"356--370"
-, keywords =	"parallel computation, polygons, two-dimensional"
+, author =      "F. Dehne"
+, title =       "Solving visibility and separability problems on a mesh of processors"
+, journal =     "Visual Comput."
+, volume =      3
+, year =        1988
+, pages =       "356--370"
+, keywords =    "parallel computation, polygons, two-dimensional"
 }
 
 @techreport{d-vdzbk-82
-, author =	"F. Dehne"
-, title =	"Voronoi-{Diagramme} zur {Bestimmung} $k$ n{\"a}chster {Nachbarn}"
-, type =	"Report"
-, number =	"??"
-, institution =	"Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
-, address =	"Aachen, West Germany"
-, year =	1982
+, author =      "F. Dehne"
+, title =       "Voronoi-{Diagramme} zur {Bestimmung} $k$ n{\"a}chster {Nachbarn}"
+, type =        "Report"
+, number =      "??"
+, institution = "Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
+, address =     "Aachen, West Germany"
+, year =        1982
 }
 
 @inproceedings{dddfk-rp3dc-95
-, author =	"F. Dehne and X. Deng and P. Dymond and A. Fabri and A. A. Khokhar"
-, title =	"A Randomized Parallel {3D} Convex Hull Algorithm for Coarse Grained Multicomputers"
-, booktitle =	"Proc. 7th ACM Sympos. Parallel Algorithms Architect."
-, year =	1995
-, pages =	"27--33"
-, update =	"98.11 kuehn, 96.09 orourke"
+, author =      "F. Dehne and X. Deng and P. Dymond and A. Fabri and A. A. Khokhar"
+, title =       "A Randomized Parallel {3D} Convex Hull Algorithm for Coarse Grained Multicomputers"
+, booktitle =   "Proc. 7th ACM Sympos. Parallel Algorithms Architect."
+, year =        1995
+, pages =       "27--33"
+, update =      "98.11 kuehn, 96.09 orourke"
 }
 
 @inproceedings{dds-opapc-93
-, author =	"F. Dehne and H. Djidjev and J.-R. Sack"
-, title =	"An Optimal {PRAM} Algorithm for Planar Convex Embedding"
-, booktitle =	"Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
-, year =	1993
-, pages =	"75--77"
-, keywords =	"graph drawing, convex, straight-line"
-, update =	"95.09 tamassia"
+, author =      "F. Dehne and H. Djidjev and J.-R. Sack"
+, title =       "An Optimal {PRAM} Algorithm for Planar Convex Embedding"
+, booktitle =   "Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
+, year =        1993
+, pages =       "75--77"
+, keywords =    "graph drawing, convex, straight-line"
+, update =      "95.09 tamassia"
 }
 
 @inproceedings{dfnrv-hcsh-92
-, author =	"F. Dehne and A. Fabri and M. Nassar and A. Rau-Chaplin and R. Valiveti"
-, title =	"Hyperoctree Construction from Slices on a Hypercube"
-, booktitle =	"Proc. 13th Allerton Conf. Commun. Control Comput."
-, year =	1992
-, pages =	"??"
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1752"
-, update =	"95.09 devillers, 95.01 devillers"
+, author =      "F. Dehne and A. Fabri and M. Nassar and A. Rau-Chaplin and R. Valiveti"
+, title =       "Hyperoctree Construction from Slices on a Hypercube"
+, booktitle =   "Proc. 13th Allerton Conf. Commun. Control Comput."
+, year =        1992
+, pages =       "??"
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1752"
+, update =      "95.09 devillers, 95.01 devillers"
 }
 
 @article{dfnr-cddhh-94
-, author =	"F. Dehne and A. Fabri and M. Nasser and A. Rau-Chaplin"
-, title =	"Construction of $d$-dimensional hyperoctrees on a hypercube multiprocessor"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	"??"
-, year =	"1993/94"
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1752"
-, comments =	"to appear"
-, update =	"95.09 devillers, 95.01 devillers, 94.01 dehne"
+, author =      "F. Dehne and A. Fabri and M. Nasser and A. Rau-Chaplin"
+, title =       "Construction of $d$-dimensional hyperoctrees on a hypercube multiprocessor"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      "??"
+, year =        "1993/94"
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1752"
+, comments =    "to appear"
+, update =      "95.09 devillers, 95.01 devillers, 94.01 dehne"
 }
 
 @techreport{dfr-dsdcg-
-, author =	"F. Dehne and A. Fabri and A. Rau-Chaplin"
-, title =	"Data structure decomposition for coarse grained multicomputers"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
-, update =	"98.03 bibrelex"
+, author =      "F. Dehne and A. Fabri and A. Rau-Chaplin"
+, title =       "Data structure decomposition for coarse grained multicomputers"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
+, update =      "98.03 bibrelex"
 }
 
 @article{dfr-spcgc-96
-, author =	"F. Dehne and A. Fabri and A. Rau-Chaplin"
-, title =	"Scalable parallel computational geometry for coarse grained multicomputers"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"379--400"
-, succeeds =	"dfr-spgac-93"
-, update =	"97.11 bibrelex, 97.03 devillers"
+, author =      "F. Dehne and A. Fabri and A. Rau-Chaplin"
+, title =       "Scalable parallel computational geometry for coarse grained multicomputers"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "379--400"
+, succeeds =    "dfr-spgac-93"
+, update =      "97.11 bibrelex, 97.03 devillers"
 }
 
 @inproceedings{dfr-spgac-93
-, author =	"F. Dehne and A. Fabri and A. Rau-Chaplin"
-, title =	"Scalable parallel geometric algorithms for coarse grained multicomputers"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"298--307"
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1819"
-, precedes =	"dfr-spcgc-96"
-, cites =	"at-pdgp-89, b-snta-68, b-skrp-77, bt-pdcnm-89, cp-dsnlt-90, -gchpc-92, gl-rrft-89, ds-tssp-87, dfr-dsdcg-, hs-ndssg-86, h-fuenl-89, l-ipaaa-92, ol-mcp-81, ps-cgi-85, rv-ltsls-87, lw-mprrd-81, ZZZ"
-, update =	"98.03 bibrelex, 97.03 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
+, author =      "F. Dehne and A. Fabri and A. Rau-Chaplin"
+, title =       "Scalable parallel geometric algorithms for coarse grained multicomputers"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "298--307"
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1819"
+, precedes =    "dfr-spcgc-96"
+, cites =       "at-pdgp-89, b-snta-68, b-skrp-77, bt-pdcnm-89, cp-dsnlt-90, -gchpc-92, gl-rrft-89, ds-tssp-87, dfr-dsdcg-, hs-ndssg-86, h-fuenl-89, l-ipaaa-92, ol-mcp-81, ps-cgi-85, rv-ltsls-87, lw-mprrd-81, ZZZ"
+, update =      "98.03 bibrelex, 97.03 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers"
 }
 
 @article{dfr-pbbfg-90
-, author =	"F. Dehne and A. Ferreira and A. Rau-Chaplin"
-, title =	"Parallel branch and bound on fine grained hypercube multiprocessors"
-, journal =	"Parallel Comput."
-, volume =	15
-, number =	""
-, year =	1990
-, pages =	"201--209"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and A. Ferreira and A. Rau-Chaplin"
+, title =       "Parallel branch and bound on fine grained hypercube multiprocessors"
+, journal =     "Parallel Comput."
+, volume =      15
+, number =      ""
+, year =        1990
+, pages =       "201--209"
+, update =      "94.01 dehne"
 }
 
 @inproceedings{dfr-pfchm-89
-, author =	"F. Dehne and A. Ferreira and A. Rau-Chaplin"
-, title =	"Parallel fractional cascading on a hypercube multiprocessor"
-, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
-, year =	1989
-, pages =	"1084--1093"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and A. Ferreira and A. Rau-Chaplin"
+, title =       "Parallel fractional cascading on a hypercube multiprocessor"
+, booktitle =   "Proc. Allerton Conf. Commun. Control Comput."
+, year =        1989
+, pages =       "1084--1093"
+, update =      "94.01 dehne"
 }
 
 @article{dfr-pfchm-92
-, author =	"F. Dehne and A. Ferreira and A. Rau-Chaplin"
-, title =	"Parallel fractional cascading on hypercube multiprocessors"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"141--167"
+, author =      "F. Dehne and A. Ferreira and A. Rau-Chaplin"
+, title =       "Parallel fractional cascading on hypercube multiprocessors"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "141--167"
 }
 
 @inproceedings{dfr-pppbq-91
-, author =	"F. Dehne and A. Ferreira and A. Rau-Chaplin"
-, title =	"Parallel processing of pointer based quadtrees"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, year =	1991
-, pages =	"255--262"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and A. Ferreira and A. Rau-Chaplin"
+, title =       "Parallel processing of pointer based quadtrees"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, year =        1991
+, pages =       "255--262"
+, update =      "94.01 dehne"
 }
 
 @inproceedings{df-ecgmd-89
-, author =	"F. Dehne and L. Ficocelli"
-, title =	"An efficient computational geometry method for detecting dotted lines in noisy images"
-, booktitle =	"Proc. Vision Interface '89"
-, year =	1989
-, pages =	"88--93"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and L. Ficocelli"
+, title =       "An efficient computational geometry method for detecting dotted lines in noisy images"
+, booktitle =   "Proc. Vision Interface '89"
+, year =        1989
+, pages =       "88--93"
+, update =      "94.01 dehne"
 }
 
 @article{df-ddlni-90
-, author =	"F. Dehne and L. Ficocelli"
-, title =	"Detecting dotted lines in noisy images"
-, journal =	"Comput. J."
-, volume =	33
-, number =	5
-, year =	1990
-, pages =	"424--428"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and L. Ficocelli"
+, title =       "Detecting dotted lines in noisy images"
+, journal =     "Comput. J."
+, volume =      33
+, number =      5
+, year =        1990
+, pages =       "424--428"
+, update =      "94.01 dehne"
 }
 
 @article{dfsv-apacg-94
-, author =	"F. Dehne and B. Flach and J.-R. Sack and N. Valiveti"
-, title =	"Analog Parallel Algorithms for Computational Geometry"
-, journal =	"Journal of Parallel Algorithms and Applications"
-, volume =	5
-, year =	1994
-, pages =	"1--14"
-, update =	"97.11 sack"
+, author =      "F. Dehne and B. Flach and J.-R. Sack and N. Valiveti"
+, title =       "Analog Parallel Algorithms for Computational Geometry"
+, journal =     "Journal of Parallel Algorithms and Applications"
+, volume =      5
+, year =        1994
+, pages =       "1--14"
+, update =      "97.11 sack"
 }
 
 @inproceedings{dfsv-apcg-92
-, author =	"F. Dehne and B. Flach and J.-R. Sack and N. Valiveti"
-, title =	"Analog parallel computational geometry"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"143--153"
-, cites =	"c-sm-61, cg-asgpf-83, gj-cigtn-79, h-ngrhc-84, ht-ncdop-85, ht-cncm-86, k-mtpd-80, lls-hobst-89, l-pnrh-82, lprs-melpr-82, l-tspp-77, m-avns-89, ps-cgi-85, s-ansiu-87, stw-annic-86, s-ansfp-90, sem-vainn-86, th-snona-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "F. Dehne and B. Flach and J.-R. Sack and N. Valiveti"
+, title =       "Analog parallel computational geometry"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "143--153"
+, cites =       "c-sm-61, cg-asgpf-83, gj-cigtn-79, h-ngrhc-84, ht-ncdop-85, ht-cncm-86, k-mtpd-80, lls-hobst-89, l-pnrh-82, lprs-melpr-82, l-tspp-77, m-avns-89, ps-cgi-85, s-ansiu-87, stw-annic-86, s-ansfp-90, sem-vainn-86, th-snona-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{dh-padkw-90
-, author =	"F. Dehne and S. E. Hambrusch"
-, title =	"Parallel algorithms for determining $k$-width-connectivity in binary images"
-, booktitle =	"Proc. 2nd IEEE Symposium on Parallel and Distributed Processing"
-, year =	1990
-, pages =	"488--496"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and S. E. Hambrusch"
+, title =       "Parallel algorithms for determining $k$-width-connectivity in binary images"
+, booktitle =   "Proc. 2nd IEEE Symposium on Parallel and Distributed Processing"
+, year =        1990
+, pages =       "488--496"
+, update =      "94.01 dehne"
 }
 
 @article{dh-padkw-91
-, author =	"F. Dehne and S. E. Hambrusch"
-, title =	"Parallel algorithms for determining $k$-width-connectivity in binary images"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	12
-, number =	1
-, year =	1991
-, pages =	"12--23"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and S. E. Hambrusch"
+, title =       "Parallel algorithms for determining $k$-width-connectivity in binary images"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      12
+, number =      1
+, year =        1991
+, pages =       "12--23"
+, update =      "94.01 dehne"
 }
 
 @inproceedings{dhs-ccsrm-89i
-, author =	"F. Dehne and A. Hassenklover and J.-R. Sack"
-, title =	"Computing the configuration space for a robot on a mesh-of-processors"
-, booktitle =	"Proc. 1989 Internat. Conf. Parallel Process."
-, site =	"Chicago"
-, volume =	3
-, year =	1989
-, pages =	"40--48"
-, update =	"97.11 sack"
+, author =      "F. Dehne and A. Hassenklover and J.-R. Sack"
+, title =       "Computing the configuration space for a robot on a mesh-of-processors"
+, booktitle =   "Proc. 1989 Internat. Conf. Parallel Process."
+, site =        "Chicago"
+, volume =      3
+, year =        1989
+, pages =       "40--48"
+, update =      "97.11 sack"
 }
 
 @article{dhs-ccsrm-89a
-, author =	"F. Dehne and A. Hassenklover and J.-R. Sack"
-, title =	"Computing the configuration space for a robot on a mesh-of-processors"
-, journal =	"Parallel Comput."
-, volume =	12
-, number =	2
-, year =	1989
-, pages =	"221--231"
-, keywords =	"motion planning, configuration space, parallel computations"
-, update =	"95.09 korneenko"
+, author =      "F. Dehne and A. Hassenklover and J.-R. Sack"
+, title =       "Computing the configuration space for a robot on a mesh-of-processors"
+, journal =     "Parallel Comput."
+, volume =      12
+, number =      2
+, year =        1989
+, pages =       "221--231"
+, keywords =    "motion planning, configuration space, parallel computations"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{dhss-pvmcp-87
-, author =	"F. Dehne and A. Hassenklover and J.-R. Sack and N. Santoro"
-, title =	"Parallel visibility on a mesh-connected parallel computer"
-, booktitle =	"Proc. International Conference on Parallel Processing and Applications"
-, year =	1987
-, pages =	"203--210"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and A. Hassenklover and J.-R. Sack and N. Santoro"
+, title =       "Parallel visibility on a mesh-connected parallel computer"
+, booktitle =   "Proc. International Conference on Parallel Processing and Applications"
+, year =        1987
+, pages =       "203--210"
+, update =      "94.01 dehne"
 }
 
 @article{dhss-cgass-91
-, author =	"F. Dehne and A.-L. Hassenklover and J.-R. Sack and N. Santoro"
-, title =	"Computational geometry algorithms for the systolic screen"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"734--761"
+, author =      "F. Dehne and A.-L. Hassenklover and J.-R. Sack and N. Santoro"
+, title =       "Computational geometry algorithms for the systolic screen"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "734--761"
 }
 
 @inproceedings{dkf-saipg-94
-, author =	"F. Dehne and C. Kenyon and A. Fabri"
-, title =	"Scalable and architecture independent parallel geometric algorithms with high probability optimal time"
-, booktitle =	"Proc. 6th IEEE Symp. on Parallel and Distributed Processing"
-, nickname =	"SPDP"
-, year =	1994
-, pages =	"586--593"
-, update =	"96.09 orourke"
+, author =      "F. Dehne and C. Kenyon and A. Fabri"
+, title =       "Scalable and architecture independent parallel geometric algorithms with high probability optimal time"
+, booktitle =   "Proc. 6th IEEE Symp. on Parallel and Distributed Processing"
+, nickname =    "SPDP"
+, year =        1994
+, pages =       "586--593"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{dk-savd-87
-, author =	"Frank Dehne and Rolf Klein"
-, title =	"A Sweepcircle Algorithm for {Voronoi} diagrams"
-, booktitle =	"Proc. 13th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '87"
-, series =	"Lecture Notes Comput. Sci."
-, publisher =	"Springer-Verlag"
-, year =	1987
-, pages =	"59--70"
-, update =	"99.07 bibrelex, 98.07 bibrelex, 94.01 dehne"
+, author =      "Frank Dehne and Rolf Klein"
+, title =       "A Sweepcircle Algorithm for {Voronoi} diagrams"
+, booktitle =   "Proc. 13th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '87"
+, series =      "Lecture Notes Comput. Sci."
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "59--70"
+, update =      "99.07 bibrelex, 98.07 bibrelex, 94.01 dehne"
 }
 
 @techreport{dk-oacvd-87
-, author =	"Frank Dehne and Rolf Klein"
-, title =	"An Optimal Algorithm for Computing the {Voronoi} Diagram on a Cone"
-, type =	"Report"
-, number =	"SCS-TR-122"
-, institution =	"School of Comput. Sci., Carleton Univ."
-, year =	1987
-, update =	"99.07 bibrelex, 94.09 bernal"
+, author =      "Frank Dehne and Rolf Klein"
+, title =       "An Optimal Algorithm for Computing the {Voronoi} Diagram on a Cone"
+, type =        "Report"
+, number =      "SCS-TR-122"
+, institution = "School of Comput. Sci., Carleton Univ."
+, year =        1987
+, update =      "99.07 bibrelex, 94.09 bernal"
 }
 
 @techreport{dk-bsbav-92
-, author =	"Frank Dehne and Rolf Klein"
-, title =	"``{The} {Big} {Sweep}'': On the Power of the Wavefront Approach to {Voronoi} Diagrams"
-, number =	136
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1992
-, succeeds =	"dk-bsbav-91"
-, precedes =	"dk-bspwa-94"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Frank Dehne and Rolf Klein"
+, title =       "``{The} {Big} {Sweep}'': On the Power of the Wavefront Approach to {Voronoi} Diagrams"
+, number =      136
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1992
+, succeeds =    "dk-bsbav-91"
+, precedes =    "dk-bspwa-94"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{dk-bspwa-94
-, author =	"Frank Dehne and Rolf Klein"
-, title =	"``{The} {Big} {Sweep}'': On the Power of the Wavefront Approach to {Voronoi} Diagrams"
-, booktitle =	"Proc. Internat. Sympos. Math. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	841
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"296--305"
-, succeeds =	"dk-bsbav-92"
-, precedes =	"dk-bspwa-97"
-, update =	"00.11 smid, 00.07 icking, 99.07 bibrelex, 98.11 bibrelex, 98.07 icking, 97.03 icking"
+, author =      "Frank Dehne and Rolf Klein"
+, title =       "``{The} {Big} {Sweep}'': On the Power of the Wavefront Approach to {Voronoi} Diagrams"
+, booktitle =   "Proc. Internat. Sympos. Math. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      841
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "296--305"
+, succeeds =    "dk-bsbav-92"
+, precedes =    "dk-bspwa-97"
+, update =      "00.11 smid, 00.07 icking, 99.07 bibrelex, 98.11 bibrelex, 98.07 icking, 97.03 icking"
 }
 
 @article{dk-bspwa-97
-, author =	"Frank Dehne and Rolf Klein"
-, title =	"``{The} {Big} {Sweep}'': On the Power of the Wavefront Approach to {Voronoi} Diagrams"
-, journal =	"Algorithmica"
-, volume =	17
-, number =	1
-, year =	1997
-, pages =	"19--32"
-, succeeds =	"dk-bspwa-94"
-, update =	"98.11 bibrelex+held"
+, author =      "Frank Dehne and Rolf Klein"
+, title =       "``{The} {Big} {Sweep}'': On the Power of the Wavefront Approach to {Voronoi} Diagrams"
+, journal =     "Algorithmica"
+, volume =      17
+, number =      1
+, year =        1997
+, pages =       "19--32"
+, succeeds =    "dk-bspwa-94"
+, update =      "98.11 bibrelex+held"
 }
 
 @techreport{dk-bsbav-91
-, author =	"Frank Dehne and Rolf Klein"
-, title =	"{The} {Big} {Sweep}: {The} Beachline Approach for {Voronoi} Diagrams in Nice Metrics"
-, type =	"Manuscript"
-, institution =	"FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1991
-, precedes =	"dk-bspwa-92"
-, update =	"00.11 smid, 00.07 icking, 99.07 bibrelex, 98.07 icking, 97.11 bibrelex"
+, author =      "Frank Dehne and Rolf Klein"
+, title =       "{The} {Big} {Sweep}: {The} Beachline Approach for {Voronoi} Diagrams in Nice Metrics"
+, type =        "Manuscript"
+, institution = "FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1991
+, precedes =    "dk-bspwa-92"
+, update =      "00.11 smid, 00.07 icking, 99.07 bibrelex, 98.07 icking, 97.11 bibrelex"
 }
 
 @article{dmr-ocmcc-91
-, author =	"Frank Dehne and Russ Miller and Andrew Rau-Chaplin"
-, title =	"Optical Clustering on a Mesh-Connected Computer"
-, journal =	"Internat. J. Parallel Program."
-, volume =	20
-, number =	6
-, year =	1991
-, update =	"98.07 icking, 94.01 dehne"
+, author =      "Frank Dehne and Russ Miller and Andrew Rau-Chaplin"
+, title =       "Optical Clustering on a Mesh-Connected Computer"
+, journal =     "Internat. J. Parallel Program."
+, volume =      20
+, number =      6
+, year =        1991
+, update =      "98.07 icking, 94.01 dehne"
 }
 
 @inproceedings{dn-cgacp-85
-, author =	"F. Dehne and H. Noltemeier"
-, title =	"A computational geometry approach to clustering problems"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"245--250"
+, author =      "F. Dehne and H. Noltemeier"
+, title =       "A computational geometry approach to clustering problems"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "245--250"
 }
 
 @inproceedings{dn-cgoal-85
-, author =	"F. Dehne and H. Noltemeier"
-, title =	"Clustering geometric objects and applications to layout problems"
-, booktitle =	"Proc. Computer Graphics Tokyo '85"
-, year =	1985
-, pages =	"35--40"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and H. Noltemeier"
+, title =       "Clustering geometric objects and applications to layout problems"
+, booktitle =   "Proc. Computer Graphics Tokyo '85"
+, year =        1985
+, pages =       "35--40"
+, update =      "94.01 dehne"
 }
 
 @article{dn-cmgoa-86
-, author =	"F. Dehne and H. Noltemeier"
-, title =	"Clustering methods for geometric objects and applications to design problems"
-, journal =	"Visual Comput."
-, volume =	2
-, number =	1
-, month =	jan
-, year =	1986
-, pages =	"31--38"
-, keywords =	"layout problems"
+, author =      "F. Dehne and H. Noltemeier"
+, title =       "Clustering methods for geometric objects and applications to design problems"
+, journal =     "Visual Comput."
+, volume =      2
+, number =      1
+, month =       jan
+, year =        1986
+, pages =       "31--38"
+, keywords =    "layout problems"
 }
 
 @article{dn-vtcp-87
-, author =	"F. Dehne and H. Noltemeier"
-, title =	"Voronoi trees and clustering problems"
-, journal =	"Inform. Syst."
-, volume =	12
-, number =	2
-, year =	1987
-, pages =	"171--175"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and H. Noltemeier"
+, title =       "Voronoi trees and clustering problems"
+, journal =     "Inform. Syst."
+, volume =      12
+, number =      2
+, year =        1987
+, pages =       "171--175"
+, update =      "94.01 dehne"
 }
 
 @inproceedings{dp-vabih-88
-, author =	"F. Dehne and Q. T. Pham"
-, title =	"Visibility algorithms for binary images on the hypercube and the perfect-shuffle computer"
-, booktitle =	"Proc. IFIP WG 10.3 Working Conf. on Parallel Processing"
-, year =	1988
-, pages =	"117--124"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and Q. T. Pham"
+, title =       "Visibility algorithms for binary images on the hypercube and the perfect-shuffle computer"
+, booktitle =   "Proc. IFIP WG 10.3 Working Conf. on Parallel Processing"
+, year =        1988
+, pages =       "117--124"
+, update =      "94.01 dehne"
 }
 
 @article{dps-ovabi-90
-, author =	"F. Dehne and Q. T. Pham and I. Stojmenovi{\'c}"
-, title =	"Optimal visibility algorithms for binary images on the hypercube"
-, journal =	"Internat. J. Parallel Program."
-, volume =	19
-, number =	3
-, year =	1990
-, pages =	"213--224"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and Q. T. Pham and I. Stojmenovi{\'c}"
+, title =       "Optimal visibility algorithms for binary images on the hypercube"
+, journal =     "Internat. J. Parallel Program."
+, volume =      19
+, number =      3
+, year =        1990
+, pages =       "213--224"
+, update =      "94.01 dehne"
 }
 
 @inproceedings{dps-ovabi-88
-, author =	"F. Dehne and Q. T. Pham and I. Stojmenovi{\'c}"
-, title =	"Optimal visibility algorithms for binary images on the hypercube --- preliminary version"
-, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
-, year =	1988
-, pages =	"1035--1036"
-, update =	"94.09 lambert, 94.01 dehne"
+, author =      "F. Dehne and Q. T. Pham and I. Stojmenovi{\'c}"
+, title =       "Optimal visibility algorithms for binary images on the hypercube --- preliminary version"
+, booktitle =   "Proc. Allerton Conf. Commun. Control Comput."
+, year =        1988
+, pages =       "1035--1036"
+, update =      "94.09 lambert, 94.01 dehne"
 }
 
 @inproceedings{dr-idshm-89
-, author =	"F. Dehne and A. Rau-Chaplin"
-, title =	"Implementing data structures on a hypercube multiprocessor and applications in parallel computational geometry"
-, booktitle =	"Proc. 15th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '89"
-, year =	1989
-, pages =	"316--329"
-, update =	"98.07 bibrelex, 94.01 dehne"
+, author =      "F. Dehne and A. Rau-Chaplin"
+, title =       "Implementing data structures on a hypercube multiprocessor and applications in parallel computational geometry"
+, booktitle =   "Proc. 15th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '89"
+, year =        1989
+, pages =       "316--329"
+, update =      "98.07 bibrelex, 94.01 dehne"
 }
 
 @article{dr-idshm-90
-, author =	"F. Dehne and A. Rau-Chaplin"
-, title =	"Implementing data structures on a hypercube multiprocessor and applications in parallel computational geometry"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	8
-, number =	4
-, year =	1990
-, pages =	"367--375"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and A. Rau-Chaplin"
+, title =       "Implementing data structures on a hypercube multiprocessor and applications in parallel computational geometry"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      8
+, number =      4
+, year =        1990
+, pages =       "367--375"
+, update =      "94.01 dehne"
 }
 
 @inproceedings{ds-spcga-88
-, author =	"F. Dehne and J.-R. Sack"
-, title =	"A survey of parallel computational geometry algorithms"
-, booktitle =	"Proc. International Workshop on Parallel Processing by Cellular Automata and Arrays"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	342
-, year =	1988
-, pages =	"73--88"
-, keywords =	"parallel computations, survey"
-, update =	"02.03 icking, 95.09 korneenko, 94.01 dehne"
+, author =      "F. Dehne and J.-R. Sack"
+, title =       "A survey of parallel computational geometry algorithms"
+, booktitle =   "Proc. International Workshop on Parallel Processing by Cellular Automata and Arrays"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      342
+, year =        1988
+, pages =       "73--88"
+, keywords =    "parallel computations, survey"
+, update =      "02.03 icking, 95.09 korneenko, 94.01 dehne"
 }
 
 @inproceedings{ds-sspts-87
-, author =	"F. Dehne and J.-R. Sack"
-, title =	"Separability of Sets of Polygons Through Single Translations"
-, booktitle =	"Proc WG'87"
-, site =	"Bernried, FRG"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	246
-, publisher =	"Springer-Verlag"
-, year =	1987
-, pages =	"237--251"
-, update =	"97.11 sack"
+, author =      "F. Dehne and J.-R. Sack"
+, title =       "Separability of Sets of Polygons Through Single Translations"
+, booktitle =   "Proc WG'87"
+, site =        "Bernried, FRG"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      246
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "237--251"
+, update =      "97.11 sack"
 }
 
 @inproceedings{ds-ssp-86
-, author =	"F. Dehne and J.-R. Sack"
-, title =	"Separabilty of sets of polygons"
-, booktitle =	"Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '86"
-, year =	1986
-, pages =	"237--251"
-, update =	"98.07 bibrelex, 94.01 dehne"
+, author =      "F. Dehne and J.-R. Sack"
+, title =       "Separabilty of sets of polygons"
+, booktitle =   "Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '86"
+, year =        1986
+, pages =       "237--251"
+, update =      "98.07 bibrelex, 94.01 dehne"
 }
 
 @article{ds-tssp-87
-, author =	"F. Dehne and J.-R. Sack"
-, title =	"Translation separability of sets of polygons"
-, journal =	"Visual Comput."
-, volume =	3
-, year =	1987
-, pages =	"227--235"
-, keywords =	"robotics, motion planning, detection, reporting, separation, path planning, segment trees, polygons, two-dimensional"
+, author =      "F. Dehne and J.-R. Sack"
+, title =       "Translation separability of sets of polygons"
+, journal =     "Visual Comput."
+, volume =      3
+, year =        1987
+, pages =       "227--235"
+, keywords =    "robotics, motion planning, detection, reporting, separation, path planning, segment trees, polygons, two-dimensional"
 }
 
 @inproceedings{dss-csshc-87
-, author =	"F. Dehne and J.-R. Sack and N. Santoro"
-, title =	"Computing on a systolic screen: hulls, contours and applications"
-, booktitle =	"Conf. Parallel Architectures Languages Europe"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	258
-, publisher =	"Springer-Verlag"
-, year =	1987
-, pages =	"121--133"
-, keywords =	"parallel computation, computer graphics, convex hull, polygons, two-dimensional"
+, author =      "F. Dehne and J.-R. Sack and N. Santoro"
+, title =       "Computing on a systolic screen: hulls, contours and applications"
+, booktitle =   "Conf. Parallel Architectures Languages Europe"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      258
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "121--133"
+, keywords =    "parallel computation, computer graphics, convex hull, polygons, two-dimensional"
 }
 
 @proceedings{dss-pwads-89
-, title =	"Proc. 1st Workshop on Algorithms Data Struct."
-, editor =	"F. Dehne and J.-R. Sack and N. Santoro"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, update =	"98.11 bibrelex, 97.11 sack"
+, title =       "Proc. 1st Workshop on Algorithms Data Struct."
+, editor =      "F. Dehne and J.-R. Sack and N. Santoro"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, update =      "98.11 bibrelex, 97.11 sack"
 }
 
 @proceedings{dss-p2wad-91
-, title =	"Proc. 2nd Workshop Algorithms Data Struct."
-, editor =	"F. Dehne and J.-R. Sack and N. Santoro"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, update =	"98.07 bibrelex, 97.11 sack"
+, title =       "Proc. 2nd Workshop Algorithms Data Struct."
+, editor =      "F. Dehne and J.-R. Sack and N. Santoro"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, update =      "98.07 bibrelex, 97.11 sack"
 }
 
 @proceedings{dssw-p3wad-93
-, title =	"Proc. 3rd Workshop on Algorithms and Data Structures"
-, editor =	"F. Dehne and J.-R. Sack and N. Santoro and S. Whitesides"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, update =	"97.11 sack"
+, title =       "Proc. 3rd Workshop on Algorithms and Data Structures"
+, editor =      "F. Dehne and J.-R. Sack and N. Santoro and S. Whitesides"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, update =      "97.11 sack"
 }
 
 @inproceedings{dss-nd3dc-88
-, author =	"F. Dehne and J. R. Sack and I. Stojmenovi{\'c}"
-, title =	"A note on determining the $3$-dimensional convex hull of a set of points on a mesh of processors"
-, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	318
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"154--162"
+, author =      "F. Dehne and J. R. Sack and I. Stojmenovi{\'c}"
+, title =       "A note on determining the $3$-dimensional convex hull of a set of points on a mesh of processors"
+, booktitle =   "Proc. 1st Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      318
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "154--162"
 }
 
 @article{ds-oaesp-88
-, author =	"F. Dehne and I. Stojmenovi{\'c}"
-, title =	"An ${O}(n)$ algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors"
-, journal =	"Inform. Process. Lett."
-, volume =	28
-, number =	2
-, year =	1988
-, pages =	"67--70"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and I. Stojmenovi{\'c}"
+, title =       "An ${O}(n)$ algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors"
+, journal =     "Inform. Process. Lett."
+, volume =      28
+, number =      2
+, year =        1988
+, pages =       "67--70"
+, update =      "94.01 dehne"
 }
 
 @inproceedings{ds-opses-87
-, author =	"F. Dehne and I. Stojmenovi{\'c}"
-, title =	"An optimal parallel solution to the ECDF searching problem for higher dimensions on a mesh-of-processors"
-, booktitle =	"Proc. Allerton Conf. Commun. Control Comput."
-, year =	1987
-, pages =	"660--661"
-, update =	"94.01 dehne"
+, author =      "F. Dehne and I. Stojmenovi{\'c}"
+, title =       "An optimal parallel solution to the ECDF searching problem for higher dimensions on a mesh-of-processors"
+, booktitle =   "Proc. Allerton Conf. Commun. Control Comput."
+, year =        1987
+, pages =       "660--661"
+, update =      "94.01 dehne"
 }
 
 @inproceedings{dt-cpasd-89
-, author =	"F. Dehne and R. Tamassia"
-, title =	"Cutting polygons to achieve separability, with dynamization"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	32
+, author =      "F. Dehne and R. Tamassia"
+, title =       "Cutting polygons to achieve separability, with dynamization"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       32
 }
 
 @techreport{ddr-chlts-92
-, author =	"V. G. De{\u\i}neko and Ren{\'e} van Dal and G{\"u}nter Rote"
-, title =	"The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case"
-, type =	"Report"
-, number =	233
-, institution =	"Inst. Math., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, month =	sep
-, year =	1992
-, precedes =	"ddr-chlts-94"
-, update =	"98.03 mitchell, 97.03 rote"
+, author =      "V. G. De{\u\i}neko and Ren{\'e} van Dal and G{\"u}nter Rote"
+, title =       "The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case"
+, type =        "Report"
+, number =      233
+, institution = "Inst. Math., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, month =       sep
+, year =        1992
+, precedes =    "ddr-chlts-94"
+, update =      "98.03 mitchell, 97.03 rote"
 }
 
 @article{ddr-chlts-94
-, author =	"V. G. De{\u\i}neko and Ren{\'e} van Dal and G{\"u}nter Rote"
-, title =	"The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case"
-, journal =	"Inform. Process. Lett."
-, volume =	51
-, year =	1994
-, pages =	"141--148"
-, succeeds =	"ddr-chlts-92"
-, cites =	"akmsw-gamsa-87, r-nltsp-92"
-, update =	"98.03 mitchell, 97.03 rote"
-, abstract =	"We solve the special case of the Euclidean Traveling
-		 Salesman Problem where $n-m$ cities lie on the boundary
-		 of the convex hull of all $n$ cities, and the other
-		 $m$ cities lie on a line segment inside this convex hull
-		 by an algorithm which needs $O(mn)$ time and $O(n)$ space."
+, author =      "V. G. De{\u\i}neko and Ren{\'e} van Dal and G{\"u}nter Rote"
+, title =       "The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case"
+, journal =     "Inform. Process. Lett."
+, volume =      51
+, year =        1994
+, pages =       "141--148"
+, succeeds =    "ddr-chlts-92"
+, cites =       "akmsw-gamsa-87, r-nltsp-92"
+, update =      "98.03 mitchell, 97.03 rote"
+, abstract =    "We solve the special case of the Euclidean Traveling
+                 Salesman Problem where $n-m$ cities lie on the boundary
+                 of the convex hull of all $n$ cities, and the other
+                 $m$ cities lie on a line segment inside this convex hull
+                 by an algorithm which needs $O(mn)$ time and $O(n)$ space."
 }
 
 @article{d-fptea-71
-, author =	"T. J. Dekker"
-, title =	"A floating-point technique for extending the available precision"
-, journal =	"Numerische Mathematik"
-, volume =	18
-, year =	1971
-, pages =	"224--242"
-, update =	"97.11 bibrelex"
+, author =      "T. J. Dekker"
+, title =       "A floating-point technique for extending the available precision"
+, journal =     "Numerische Mathematik"
+, volume =      18
+, year =        1971
+, pages =       "224--242"
+, update =      "97.11 bibrelex"
 }
 
 @article{d-argon-92
-, author =	"B. V. Dekster"
-, title =	"Assembling $r$-gons out of $n$ given segments"
-, journal =	"Math. Mag."
-, volume =	65
-, number =	1
-, month =	feb
-, year =	1992
-, pages =	"44--48"
-, update =	"98.07 bibrelex"
+, author =      "B. V. Dekster"
+, title =       "Assembling $r$-gons out of $n$ given segments"
+, journal =     "Math. Mag."
+, volume =      65
+, number =      1
+, month =       feb
+, year =        1992
+, pages =       "44--48"
+, update =      "98.07 bibrelex"
 }
 
 @article{d-uardr-80
-, author =	"C. Delannoy"
-, title =	"Un algorithme rapide de recherche de plus proches voisins"
-, journal =	"RAIRO Inform. Theor."
-, volume =	14
-, year =	1980
-, pages =	"275--286"
-, keywords =	"nearest neighbors"
-, update =	"95.09 korneenko"
+, author =      "C. Delannoy"
+, title =       "Un algorithme rapide de recherche de plus proches voisins"
+, journal =     "RAIRO Inform. Theor."
+, volume =      14
+, year =        1980
+, pages =       "275--286"
+, keywords =    "nearest neighbors"
+, update =      "95.09 korneenko"
 }
 
 @article{d-slsv-34
-, author =	"B. Delaunay"
-, title =	"Sur la sph{\`e}re vide. {A} la memoire de {Georges} {Voronoi}"
-, journal =	"Izv. Akad. Nauk SSSR, Otdelenie Matematicheskih i Estestvennyh Nauk"
-, volume =	7
-, year =	1934
-, pages =	"793--800"
-, keywords =	"Delaunay triangulation"
-, comments =	"Translated as Bull. Acad. Sci. USSR: Class. Sci. Math. Nat."
-, update =	"95.09 korneenko, 93.09 jones"
+, author =      "B. Delaunay"
+, title =       "Sur la sph{\`e}re vide. {A} la memoire de {Georges} {Voronoi}"
+, journal =     "Izv. Akad. Nauk SSSR, Otdelenie Matematicheskih i Estestvennyh Nauk"
+, volume =      7
+, year =        1934
+, pages =       "793--800"
+, keywords =    "Delaunay triangulation"
+, comments =    "Translated as Bull. Acad. Sci. USSR: Class. Sci. Math. Nat."
+, update =      "95.09 korneenko, 93.09 jones"
 }
 
 @inproceedings{de-iabns-93
-, author =	"C. J. A. Delfinado and H. Edelsbrunner"
-, title =	"An incremental algorithm for {Betti} numbers of simplicial complexes"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"232--239"
-, cites =	"ah-t1-35, b-ct-93, clr-ia-90, dc-cchtt-91, e-acg-87, e-was-92, eks-sspp-83, em-tdas-94, g-gsh-81, kb-ptacs-79, m-eat-84, r-iat-88, s-siec-61, ZZZ"
-, update =	"98.07 agarwal, 98.03 bibrelex, 93.09 jones"
+, author =      "C. J. A. Delfinado and H. Edelsbrunner"
+, title =       "An incremental algorithm for {Betti} numbers of simplicial complexes"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "232--239"
+, cites =       "ah-t1-35, b-ct-93, clr-ia-90, dc-cchtt-91, e-acg-87, e-was-92, eks-sspp-83, em-tdas-94, g-gsh-81, kb-ptacs-79, m-eat-84, r-iat-88, s-siec-61, ZZZ"
+, update =      "98.07 agarwal, 98.03 bibrelex, 93.09 jones"
 }
 
 @article{d-agtgp-90
-, author =	"K. Deljouie-Rakhshandeh"
-, title =	"An Approach to the Generation of Triangular Grids Possessing Few Obtuse Triangles"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	29
-, year =	1990
-, pages =	"1299--1321"
-, annote =	"Wants triangulation with very few obtuse angles.
-		 Combines ad-hoccery for node generation with switching
-		 rules. Also decomposes complex shape into convex
-		 pieces."
+, author =      "K. Deljouie-Rakhshandeh"
+, title =       "An Approach to the Generation of Triangular Grids Possessing Few Obtuse Triangles"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      29
+, year =        1990
+, pages =       "1299--1321"
+, annote =      "Wants triangulation with very few obtuse angles.
+                 Combines ad-hoccery for node generation with switching
+                 rules. Also decomposes complex shape into convex
+                 pieces."
 }
 
 @unpublished{dg-bop-01
-, author =	"Charles Delman and Gregory Galperin"
-, title =	"Billiards on polyhedra: {A} separation principle and a calculus for the number of trajectories"
-, year =	2001
-, note =	"Univ. Eastern Illinois"
-, update =	"01.04 orourke"
+, author =      "Charles Delman and Gregory Galperin"
+, title =       "Billiards on polyhedra: {A} separation principle and a calculus for the number of trajectories"
+, year =        2001
+, note =        "Univ. Eastern Illinois"
+, update =      "01.04 orourke"
 }
 
 @inproceedings{ddo-pp1an-00
-, author =	"E. D. Demain and M. L. Demaine and J. O'Rourke"
-, title =	"{PushPush} and {Push-1} are {NP}-hard in {2D}"
-, booktitle =	"Proc. 12th Canad. Conf. Comput. Geom."
-, site =	"New Brunswick"
-, month =	aug
-, year =	2000
-, pages =	"??--??"
-, url =	"https://www.science.smith.edu/~jorourke/papers.php"
-, cites =	"ddo-ppnph2d-00"
-, update =	"01.04 icking, 00.11 smid, 00.07 orourke"
+, author =      "E. D. Demain and M. L. Demaine and J. O'Rourke"
+, title =       "{PushPush} and {Push-1} are {NP}-hard in {2D}"
+, booktitle =   "Proc. 12th Canad. Conf. Comput. Geom."
+, site =        "New Brunswick"
+, month =       aug
+, year =        2000
+, pages =       "??--??"
+, url = "https://www.science.smith.edu/~jorourke/papers.php"
+, cites =       "ddo-ppnph2d-00"
+, update =      "01.04 icking, 00.11 smid, 00.07 orourke"
 }
 
 @techreport{ddo-ppnph2d-00
-, author =	"E. D. Demain and M. L. Demaine and J. O'Rourke"
-, title =	"{PushPush} is {NP}-hard in {2D}"
-, number =	065
-, institution =	"Smith College, Northampton, MA"
-, month =	jan
-, year =	2000
-, archive =	"XXX:cs.CG/0001019"
-, cites =	"os-ppnph3d-99"
-, update =	"00.03 orourke"
+, author =      "E. D. Demain and M. L. Demaine and J. O'Rourke"
+, title =       "{PushPush} is {NP}-hard in {2D}"
+, number =      065
+, institution = "Smith College, Northampton, MA"
+, month =       jan
+, year =        2000
+, archive =     "XXX:cs.CG/0001019"
+, cites =       "os-ppnph3d-99"
+, update =      "00.03 orourke"
 }
 
 @inproceedings{dlo-sil-01
-, author =	"Erik D. Demain and Stefan Langerman and Joseph O'Rourke"
-, title =	"Short Interlocked Linkages"
-, booktitle =	"Proc. 13th Canad. Conf. Comput. Geom."
-, site =	"Waterloo"
-, year =	2001
-, pages =	"??--??"
-, update =	"02.03 icking, 01.07 orourke"
+, author =      "Erik D. Demain and Stefan Langerman and Joseph O'Rourke"
+, title =       "Short Interlocked Linkages"
+, booktitle =   "Proc. 13th Canad. Conf. Comput. Geom."
+, site =        "Waterloo"
+, year =        2001
+, pages =       "??--??"
+, update =      "02.03 icking, 01.07 orourke"
 }
 
 @inproceedings{ddlop-mc-99
-, author =	"E. Demaine and M. Demaine and A. Lubiw and J. O'Rourke and I. Pashchenko"
-, title =	"Metamorphosis of the Cube"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"409--410"
-, note =	"Video and abstract"
-, update =	"00.03 orourke"
+, author =      "E. Demaine and M. Demaine and A. Lubiw and J. O'Rourke and I. Pashchenko"
+, title =       "Metamorphosis of the Cube"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "409--410"
+, note =        "Video and abstract"
+, update =      "00.03 orourke"
 }
 
 @article{do-cgc37-99
-, author =	"E. Demaine and J. O'Rourke"
-, title =	"Computational geometry column 37"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	"??"
-, year =	1999
-, pages =	"??--??"
-, note =	"Also in SIGACT News, 30(3):39--42 (1999), Issue 112; LANL XXX archive cs.CG/9908007"
-, archive =	"XXX:cs.CG/9908007"
-, update =	"00.03 orourke"
-, annote =	"Open problems from the 15th Annual ACM Symposium on Computational Geometry."
+, author =      "E. Demaine and J. O'Rourke"
+, title =       "Computational geometry column 37"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      "??"
+, year =        1999
+, pages =       "??--??"
+, note =        "Also in SIGACT News, 30(3):39--42 (1999), Issue 112; LANL XXX archive cs.CG/9908007"
+, archive =     "XXX:cs.CG/9908007"
+, update =      "00.03 orourke"
+, annote =      "Open problems from the 15th Annual ACM Symposium on Computational Geometry."
 }
 
 @article{ddk-pccs-01
-, author =	"E. D. Demaine and M. L. Demaine and C. S. Kaplan"
-, title =	"Polygons cuttable by a circular saw"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	20
-, year =	2001
-, pages =	"69--84"
-, update =	"01.11 smid"
+, author =      "E. D. Demaine and M. L. Demaine and C. S. Kaplan"
+, title =       "Polygons cuttable by a circular saw"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      20
+, year =        2001
+, pages =       "69--84"
+, update =      "01.11 smid"
 }
 
 @inproceedings{ddl-fcp-98
-, author =	"E. D. Demaine and M. L. Demaine and A. Lubiw"
-, title =	"Folding and Cutting Paper"
-, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom."
-, site =	"Tokyo, Japan"
-, series =	"Lecture Notes Comput. Sci."
-, publisher =	"Springer-Verlag"
-, year =	1998
-, url =	"http://ranran.cis.ibaraki.ac.jp/jcdcg98/jcdcg98.html"
-, update =	"99.11 bibrelex, 99.07 orourke"
+, author =      "E. D. Demaine and M. L. Demaine and A. Lubiw"
+, title =       "Folding and Cutting Paper"
+, booktitle =   "Proc. Japan Conf. Discrete Comput. Geom."
+, site =        "Tokyo, Japan"
+, series =      "Lecture Notes Comput. Sci."
+, publisher =   "Springer-Verlag"
+, year =        1998
+, url = "http://ranran.cis.ibaraki.ac.jp/jcdcg98/jcdcg98.html"
+, update =      "99.11 bibrelex, 99.07 orourke"
 }
 
 @inproceedings{ddl-foscs-99
-, author =	"E. D. Demaine and M. L. Demaine and A. Lubiw"
-, title =	"Folding and One Straight Cut Suffice"
-, booktitle =	"Proc. 10th Annu. ACM-SIAM Sympos. Discrete Alg."
-, nickname =	"SODA'99"
-, site =	"Baltimore, Maryland"
-, month =	jan
-, year =	1999
-, pages =	"891--892"
-, url =	"https://archive.siam.org/meetings/da99/"
-, update =	"99.07 orourke"
+, author =      "E. D. Demaine and M. L. Demaine and A. Lubiw"
+, title =       "Folding and One Straight Cut Suffice"
+, booktitle =   "Proc. 10th Annu. ACM-SIAM Sympos. Discrete Alg."
+, nickname =    "SODA'99"
+, site =        "Baltimore, Maryland"
+, month =       jan
+, year =        1999
+, pages =       "891--892"
+, url = "https://archive.siam.org/meetings/da99/"
+, update =      "99.07 orourke"
 }
 
 @inproceedings{ddao-efupp-00
-, author =	"E. D. Demaine and M. L. Demaine and A. Lubiw and J. O'Rourke"
-, title =	"Enumerating foldings and unfoldings between polygons and polytopes"
-, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '98"
-, site =	"Tokyo"
-, month =	dec
-, year =	2000
-, pages =	"9--12"
-, note =	"Revised version to appear in LNCS"
-, update =	"01.04 orourke"
+, author =      "E. D. Demaine and M. L. Demaine and A. Lubiw and J. O'Rourke"
+, title =       "Enumerating foldings and unfoldings between polygons and polytopes"
+, booktitle =   "Proc. Japan Conf. Discrete Comput. Geom. '98"
+, site =        "Tokyo"
+, month =       dec
+, year =        2000
+, pages =       "9--12"
+, note =        "Revised version to appear in LNCS"
+, update =      "01.04 orourke"
 }
 
 @inproceedings{ddlo-efupp-01
-, author =	"Erik D. Demaine and Martin L. Demaine and Anna Lubiw and Joseph O'Rourke"
-, title =	"Enumerating Foldings and Unfoldings between Polygons and Polytopes"
-, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '00"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	"??"
-, publisher =	"Springer-Verlag"
-, year =	2001
-, pages =	"??--??"
-, note =	"Tokyo, Nov. 2000, pp. 9--12."
-, succeeds =	"ddlo-ecerfu-00"
-, update =	"01.07 orourke"
+, author =      "Erik D. Demaine and Martin L. Demaine and Anna Lubiw and Joseph O'Rourke"
+, title =       "Enumerating Foldings and Unfoldings between Polygons and Polytopes"
+, booktitle =   "Proc. Japan Conf. Discrete Comput. Geom. '00"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      "??"
+, publisher =   "Springer-Verlag"
+, year =        2001
+, pages =       "??--??"
+, note =        "Tokyo, Nov. 2000, pp. 9--12."
+, succeeds =    "ddlo-ecerfu-00"
+, update =      "01.07 orourke"
 }
 
 @inproceedings{o-fucg-01
-, author =	"E. D. Demaine and M. L. Demaine and A. Lubiw and J. O'Rourke"
-, title =	"Enumerating foldings and unfoldings between polygons and polytopes"
-, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '98"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	"??"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	2001
-, pages =	"??--??"
-, note =	"To appear"
-, succeeds =	"ddao-efupp-00"
-, update =	"02.03 icking, 01.04 orourke"
+, author =      "E. D. Demaine and M. L. Demaine and A. Lubiw and J. O'Rourke"
+, title =       "Enumerating foldings and unfoldings between polygons and polytopes"
+, booktitle =   "Proc. Japan Conf. Discrete Comput. Geom. '98"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      "??"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        2001
+, pages =       "??--??"
+, note =        "To appear"
+, succeeds =    "ddao-efupp-00"
+, update =      "02.03 icking, 01.04 orourke"
 }
 
 @techreport{ddlo-ecerfu-00
-, author =	"E. D. Demaine and M. L. Demaine and A. Lubiw and J. O'Rourke"
-, title =	"Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes"
-, number =	069
-, institution =	"Smith College, Northampton, MA"
-, month =	jul
-, year =	2000
-, note =	"LANL ArXive cs.CG/0007019"
-, update =	"01.04 orourke"
+, author =      "E. D. Demaine and M. L. Demaine and A. Lubiw and J. O'Rourke"
+, title =       "Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes"
+, number =      069
+, institution = "Smith College, Northampton, MA"
+, month =       jul
+, year =        2000
+, note =        "LANL ArXive cs.CG/0007019"
+, update =      "01.04 orourke"
 }
 
 @inproceedings{ddm-ffswp-99
-, author =	"E. D. Demaine and M. L. Demaine and J. S. B. Mitchell"
-, title =	"Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, site =	"Miami Beach, Florida"
-, month =	jun
-, year =	1999
-, pages =	"105--114"
-, url =	"http://www.cs.miami.edu/events/SCG99"
-, update =	"99.07 orourke"
+, author =      "E. D. Demaine and M. L. Demaine and J. S. B. Mitchell"
+, title =       "Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, site =        "Miami Beach, Florida"
+, month =       jun
+, year =        1999
+, pages =       "105--114"
+, url = "http://www.cs.miami.edu/events/SCG99"
+, update =      "99.07 orourke"
 }
 
 @techreport{deeho-vusm-01
-, author =	"E. D. Demaine and D. Eppstein and J. Erickson and G. W. Hart and J. O'Rourke"
-, title =	"Vertex-Unfoldings of Simplicial Manifolds"
-, type =	"Technical {Report}"
-, number =	072
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA, USA"
-, month =	oct
-, year =	2001
-, url =	"https://arxiv.org/abs/cs/0110054"
-, succeeds =	"deeho-vusp-01"
-, update =	"01.11 orourke"
+, author =      "E. D. Demaine and D. Eppstein and J. Erickson and G. W. Hart and J. O'Rourke"
+, title =       "Vertex-Unfoldings of Simplicial Manifolds"
+, type =        "Technical {Report}"
+, number =      072
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA, USA"
+, month =       oct
+, year =        2001
+, url = "https://arxiv.org/abs/cs/0110054"
+, succeeds =    "deeho-vusp-01"
+, update =      "01.11 orourke"
 }
 
 @techreport{deeho-vusp-01
-, author =	"E. D. Demaine and D. Eppstein and J. Erickson and G. W. Hart and J. O'Rourke"
-, title =	"Vertex-Unfoldings of Simplicial Polyhedra"
-, type =	"Technical {Report}"
-, number =	071
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA, USA"
-, month =	jul
-, year =	2001
-, url =	"https://arXiv.org/abs/cs/0107023/"
-, update =	"01.11 orourke"
+, author =      "E. D. Demaine and D. Eppstein and J. Erickson and G. W. Hart and J. O'Rourke"
+, title =       "Vertex-Unfoldings of Simplicial Polyhedra"
+, type =        "Technical {Report}"
+, number =      071
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA, USA"
+, month =       jul
+, year =        2001
+, url = "https://arXiv.org/abs/cs/0107023/"
+, update =      "01.11 orourke"
 }
 
 @inproceedings{do-op99-01
-, author =	"Erik D. Demaine and Joseph O'Rourke"
-, title =	"Open Problems from {CCCG}'00"
-, booktitle =	"Proc. 13th Canad. Conf. Comput. Geom."
-, site =	"Waterloo"
-, year =	2001
-, pages =	"??--??"
-, update =	"02.03 icking, 01.07 orourke"
+, author =      "Erik D. Demaine and Joseph O'Rourke"
+, title =       "Open Problems from {CCCG}'00"
+, booktitle =   "Proc. 13th Canad. Conf. Comput. Geom."
+, site =        "Waterloo"
+, year =        2001
+, pages =       "??--??"
+, update =      "02.03 icking, 01.07 orourke"
 }
 
 @inproceedings{do-op99-00
-, author =	"Erik D. Demaine and J. O'Rourke"
-, title =	"Open Problems from {CCCG}'99"
-, booktitle =	"Proc. 12th Canad. Conf. Comput. Geom."
-, site =	"New Brunswick"
-, month =	aug
-, year =	2000
-, pages =	"269--272"
-, update =	"02.03 icking, 01.07 orourke"
+, author =      "Erik D. Demaine and J. O'Rourke"
+, title =       "Open Problems from {CCCG}'99"
+, booktitle =   "Proc. 12th Canad. Conf. Comput. Geom."
+, site =        "New Brunswick"
+, month =       aug
+, year =        2000
+, pages =       "269--272"
+, update =      "02.03 icking, 01.07 orourke"
 }
 
 @article{d-iw-86
-, author =	"H{\"u}seyin Demir"
-, title =	"Incircles within"
-, journal =	"Math. Mag."
-, volume =	59
-, year =	1986
-, pages =	"77--83"
-, update =	"98.11 bibrelex"
+, author =      "H{\"u}seyin Demir"
+, title =       "Incircles within"
+, journal =     "Math. Mag."
+, volume =      59
+, year =        1986
+, pages =       "77--83"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{d-eaavr-86
-, author =	"J. Demmel"
-, title =	"On Error Analysis in Arithmetic with Varying Relative Precision"
-, type =	"Technical {Report}"
-, number =	251
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, month =	oct
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "J. Demmel"
+, title =       "On Error Analysis in Arithmetic with Varying Relative Precision"
+, type =        "Technical {Report}"
+, number =      251
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, month =       oct
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{d-cdnsm-92
-, author =	"J. Demmel"
-, title =	"The componentwise distance to the nearest singular matrix"
-, journal =	"SIAM J. Matrix Anal. Appl."
-, volume =	13
-, number =	1
-, year =	1992
-, pages =	"10--19"
-, update =	"98.03 bibrelex"
+, author =      "J. Demmel"
+, title =       "The componentwise distance to the nearest singular matrix"
+, journal =     "SIAM J. Matrix Anal. Appl."
+, volume =      13
+, number =      1
+, year =        1992
+, pages =       "10--19"
+, update =      "98.03 bibrelex"
 }
 
 @article{ds-ppsp-88
-, author =	"L. Deneen and G. Shute"
-, title =	"Polygonizations of point sets in the plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"77--87"
-, keywords =	"counting, arrangements, star-shaped, two-dimensional, combinatorial geometry"
+, author =      "L. Deneen and G. Shute"
+, title =       "Polygonizations of point sets in the plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "77--87"
+, keywords =    "counting, arrangements, star-shaped, two-dimensional, combinatorial geometry"
 }
 
 @inproceedings{dd-upctg-90
-, author =	"L. L. Deneen and J. B. Dezell"
-, title =	"Using partitioning and clustering techniques to generate rectilinear {Steiner} trees"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"315--318"
-, cites =	"b-tprrs-88, ds-psars-89, dw-spg-72, jd-acd-88, dh-pcsa-73, ggj-ccsmt-77, gj-rstpi-77, h-oasrs-79, k-papat-77, ks-ppars-85, lw-vdllm-80, ps-cgi-85, r-fhars-89, s-harst-81, s-cg-78, sdt-opsal-91, sll-ohars-80, yw-ossaw-72, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "L. L. Deneen and J. B. Dezell"
+, title =       "Using partitioning and clustering techniques to generate rectilinear {Steiner} trees"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "315--318"
+, cites =       "b-tprrs-88, ds-psars-89, dw-spg-72, jd-acd-88, dh-pcsa-73, ggj-ccsmt-77, gj-rstpi-77, h-oasrs-79, k-papat-77, ks-ppars-85, lw-vdllm-80, ps-cgi-85, r-fhars-89, s-harst-81, s-cg-78, sdt-opsal-91, sll-ohars-80, yw-ossaw-72, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{dj-tag-92
-, author =	"L. L. Deneen and S. Joshi"
-, title =	"Treasures in an art gallery"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"17--22"
-, cites =	"at-oadvp-81, c-ctpg-75, ea-lacvp-81, js-clvpa-87, ll-ccagp-86, l-vsp-83, o-agta-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "L. L. Deneen and S. Joshi"
+, title =       "Treasures in an art gallery"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "17--22"
+, cites =       "at-oadvp-81, c-ctpg-75, ea-lacvp-81, js-clvpa-87, ll-ccagp-86, l-vsp-83, o-agta-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{ds-psars-89
-, author =	"L. L. Deneen and G. M. Shute"
-, title =	"A plane-sweep algorithm for rectilinear {Steiner} trees with deferred connections"
-, year =	1989
-, note =	"Unpublished Manuscript"
-, update =	"98.07 bibrelex"
+, author =      "L. L. Deneen and G. M. Shute"
+, title =       "A plane-sweep algorithm for rectilinear {Steiner} trees with deferred connections"
+, year =        1989
+, note =        "Unpublished Manuscript"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{dst-pfpoa-92
-, author =	"L. L. Deneen and G. M. Shute and C. D. Thomborson"
-, title =	"A probably fast, provably optimal algorithm for rectilinear {Steiner} trees"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"299--304"
-, cites =	"br-iastp-92, d-os-70, dw-spg-72, gj-rstpi-77, h-sprd-66, h-smtrd-76, k-fa-73, tds-crsmt-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "L. L. Deneen and G. M. Shute and C. D. Thomborson"
+, title =       "A probably fast, provably optimal algorithm for rectilinear {Steiner} trees"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "299--304"
+, cites =       "br-iastp-92, d-os-70, dw-spg-72, gj-rstpi-77, h-sprd-66, h-smtrd-76, k-fa-73, tds-crsmt-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{d-chacg-94
-, author =	"X. Deng"
-, title =	"A Convex Hull Algorithm on Course-Grained Multicomputer"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, year =	1994
-, pages =	"634--642"
-, update =	"98.07 bibrelex, 96.09 orourke"
+, author =      "X. Deng"
+, title =       "A Convex Hull Algorithm on Course-Grained Multicomputer"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, year =        1994
+, pages =       "634--642"
+, update =      "98.07 bibrelex, 96.09 orourke"
 }
 
 @article{d-opalp-90
-, author =	"X. Deng"
-, title =	"An optimal parallel algorithm for linear programming in the plane"
-, journal =	"Inform. Process. Lett."
-, volume =	35
-, year =	1990
-, pages =	"213--217"
-, keywords =	"parallel computations, linear programming, two-dimensional"
-, update =	"95.09 korneenko"
+, author =      "X. Deng"
+, title =       "An optimal parallel algorithm for linear programming in the plane"
+, journal =     "Inform. Process. Lett."
+, volume =      35
+, year =        1990
+, pages =       "213--217"
+, keywords =    "parallel computations, linear programming, two-dimensional"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{dkp-hlue-91
-, author =	"X. Deng and T. Kameda and C. Papadimitriou"
-, title =	"How to learn an unknown environment"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"298--303"
+, author =      "X. Deng and T. Kameda and C. Papadimitriou"
+, title =       "How to learn an unknown environment"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "298--303"
 }
 
 @article{dkp-hlue1-98
-, author =	"Xiaotie Deng and Tiko Kameda and Christos Papadimitriou"
-, title =	"How to Learn an Unknown Environment {I}: The Rectilinear Case"
-, journal =	"J. ACM"
-, volume =	45
-, number =	2
-, year =	1998
-, pages =	"215--245"
-, succeeds =	"dkp-hlue1-93"
-, update =	"98.11 bibrelex"
+, author =      "Xiaotie Deng and Tiko Kameda and Christos Papadimitriou"
+, title =       "How to Learn an Unknown Environment {I}: The Rectilinear Case"
+, journal =     "J. ACM"
+, volume =      45
+, number =      2
+, year =        1998
+, pages =       "215--245"
+, succeeds =    "dkp-hlue1-93"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{dkp-hlue1-93
-, author =	"Xiaotie Deng and Tiko Kameda and Christos H. Papadimitriou"
-, title =	"How to learn an unknown environment {I}: the rectilinear case"
-, number =	"CS-93-04"
-, institution =	"Department of Computer Science, York University"
-, address =	"Canada"
-, year =	1993
-, precedes =	"dkp-hlue1-98"
-, update =	"98.11 bibrelex, 97.03 icking"
+, author =      "Xiaotie Deng and Tiko Kameda and Christos H. Papadimitriou"
+, title =       "How to learn an unknown environment {I}: the rectilinear case"
+, number =      "CS-93-04"
+, institution = "Department of Computer Science, York University"
+, address =     "Canada"
+, year =        1993
+, precedes =    "dkp-hlue1-98"
+, update =      "98.11 bibrelex, 97.03 icking"
 }
 
 @inproceedings{dm-rmfpv-93
-, author =	"Xiaotie Deng and Andy Mirzaian"
-, title =	"Robot Mapping: {Foot}-prints vs Tokens"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"353--362"
-, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Xiaotie Deng and Andy Mirzaian"
+, title =       "Robot Mapping: {Foot}-prints vs Tokens"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "353--362"
+, update =      "98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{dfm-cddl-93
-, author =	"E. Dengler and M. Friedell and J. Marks"
-, title =	"Constraint-Driven Diagram Layout"
-, booktitle =	"Proc. IEEE Sympos. on Visual Languages"
-, nickname =	"VL '93"
-, year =	1993
-, pages =	"330--335"
-, keywords =	"graph drawing, constraints"
-, update =	"95.09 agarwal, 95.05 tamassia, 95.01 tamassia"
+, author =      "E. Dengler and M. Friedell and J. Marks"
+, title =       "Constraint-Driven Diagram Layout"
+, booktitle =   "Proc. IEEE Sympos. on Visual Languages"
+, nickname =    "VL '93"
+, year =        1993
+, pages =       "330--335"
+, keywords =    "graph drawing, constraints"
+, update =      "95.09 agarwal, 95.05 tamassia, 95.01 tamassia"
 }
 
 @inproceedings{ds-etpip-97
-, author =	"Markus Denny and Christian Sohler"
-, title =	"Encoding a Triangulation as a Permutation of its Point Set"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"39--43"
-, update =	"97.11 jones"
+, author =      "Markus Denny and Christian Sohler"
+, title =       "Encoding a Triangulation as a Permutation of its Point Set"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "39--43"
+, update =      "97.11 jones"
 }
 
 @article{d-nhtpa-76
-, author =	"N. Deo"
-, title =	"Note on {Hopcroft} and {Tarjan}'s planarity algorithm"
-, journal =	"J. ACM"
-, volume =	23
-, year =	1976
-, pages =	"74--75"
-, keywords =	"graph drawing"
-, update =	"97.11 bibrelex, 93.09 tamassia"
+, author =      "N. Deo"
+, title =       "Note on {Hopcroft} and {Tarjan}'s planarity algorithm"
+, journal =     "J. ACM"
+, volume =      23
+, year =        1976
+, pages =       "74--75"
+, keywords =    "graph drawing"
+, update =      "97.11 bibrelex, 93.09 tamassia"
 }
 
 @article{dp-spata-84
-, author =	"N. Deo and C.-Y. Pany"
-, title =	"Shortest-path algorithms: taxonomy and annotation"
-, journal =	"Networks"
-, volume =	14
-, year =	1984
-, pages =	"275--323"
+, author =      "N. Deo and C.-Y. Pany"
+, title =       "Shortest-path algorithms: taxonomy and annotation"
+, journal =     "Networks"
+, volume =      14
+, year =        1984
+, pages =       "275--323"
 }
 
 @inproceedings{dko-fliet-87
-, author =	"A. DePano and Y. Ke and J. O'Rourke"
-, title =	"Finding largest inscribed equilateral triangles and squares"
-, booktitle =	"Proc. 25th Allerton Conf. Commun. Control Comput."
-, month =	oct
-, year =	1987
-, pages =	"869--878"
-, keywords =	"two-dimensional, inscribed, regular polygons, maximal area, optimization"
-, comments =	"submitted to Internat. J. Comput. Geom. Appl."
+, author =      "A. DePano and Y. Ke and J. O'Rourke"
+, title =       "Finding largest inscribed equilateral triangles and squares"
+, booktitle =   "Proc. 25th Allerton Conf. Commun. Control Comput."
+, month =       oct
+, year =        1987
+, pages =       "869--878"
+, keywords =    "two-dimensional, inscribed, regular polygons, maximal area, optimization"
+, comments =    "submitted to Internat. J. Comput. Geom. Appl."
 }
 
 @incollection{d-bret-88
-, author =	"N. A. A. {DePano}"
-, title =	"Best regular enclosures of triangles"
-, booktitle =	"IEEE SOUTHEASTCON, 1988, Knoxville"
-, year =	1988
-, pages =	"368--372"
-, keywords =	"triangles, enclosure"
-, update =	"95.09 korneenko"
+, author =      "N. A. A. {DePano}"
+, title =       "Best regular enclosures of triangles"
+, booktitle =   "IEEE SOUTHEASTCON, 1988, Knoxville"
+, year =        1988
+, pages =       "368--372"
+, keywords =    "triangles, enclosure"
+, update =      "95.09 korneenko"
 }
 
 @phdthesis{d-paope-87
-, author =	"N. A. A. {DePano}"
-, title =	"Polygon approximation with optimized polygonal enclosures: applications and algorithms"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, year =	1987
-, keywords =	"polygons, approximation, enclosure, doctoral thesis"
-, update =	"97.11 bibrelex, 95.09 korneenko"
+, author =      "N. A. A. {DePano}"
+, title =       "Polygon approximation with optimized polygonal enclosures: applications and algorithms"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Johns Hopkins Univ."
+, year =        1987
+, keywords =    "polygons, approximation, enclosure, doctoral thesis"
+, update =      "97.11 bibrelex, 95.09 korneenko"
 }
 
 @inproceedings{da-frkec-84
-, author =	"N. A. A. DePano and A. Aggarwal"
-, title =	"Finding restricted $k$-envelopes for convex polygons"
-, booktitle =	"Proc. 22nd Allerton Conf. Commun. Control Comput."
-, year =	1984
-, pages =	"81--90"
+, author =      "N. A. A. DePano and A. Aggarwal"
+, title =       "Finding restricted $k$-envelopes for convex polygons"
+, booktitle =   "Proc. 22nd Allerton Conf. Commun. Control Comput."
+, year =        1984
+, pages =       "81--90"
 }
 
 @inproceedings{dbkl-apecg-90
-, author =	"N. Adlai A. DePano and Farinaz D. Boudreau and Philip Katner and Brian Li"
-, title =	"Algorithmic Paradigms. Examples In Computational Geometry {II}"
-, booktitle =	"21st SIGCSE Technical Symposium on Computer Science Education"
-, publisher =	"ACM"
-, address =	"Fort Collins Computer Center, Fort Collins, CO"
-, year =	1990
-, pages =	"186--191"
-, keywords =	"computational geometry, algorithmic paradigms"
-, annote =	"Generates random polygons by taking convex hull of $M$
-		 points from uniform distribution over circle. Use these
-		 to test if minimum area and minimum perimeter enclosing
-		 rectangles are different."
-, abstract =	"We discuss two problems from the relatively new field
-		 of computational geometry to illustrate two advanced
-		 notions in algorithm design and analysis. One problem
-		 deals with the triangulation of convex polygons while
-		 the other delves into minimum enclosing rectangles. Our
-		 work continues with the objective set forth in an
-		 earlier paper of a similar title. (Author abstract) 11
-		 Refs."
+, author =      "N. Adlai A. DePano and Farinaz D. Boudreau and Philip Katner and Brian Li"
+, title =       "Algorithmic Paradigms. Examples In Computational Geometry {II}"
+, booktitle =   "21st SIGCSE Technical Symposium on Computer Science Education"
+, publisher =   "ACM"
+, address =     "Fort Collins Computer Center, Fort Collins, CO"
+, year =        1990
+, pages =       "186--191"
+, keywords =    "computational geometry, algorithmic paradigms"
+, annote =      "Generates random polygons by taking convex hull of $M$
+                 points from uniform distribution over circle. Use these
+                 to test if minimum area and minimum perimeter enclosing
+                 rectangles are different."
+, abstract =    "We discuss two problems from the relatively new field
+                 of computational geometry to illustrate two advanced
+                 notions in algorithm design and analysis. One problem
+                 deals with the triangulation of convex polygons while
+                 the other delves into minimum enclosing rectangles. Our
+                 work continues with the objective set forth in an
+                 earlier paper of a similar title. (Author abstract) 11
+                 Refs."
 }
 
 @inproceedings{d-gpcfa-89
-, author =	"A. D. DeRose"
-, title =	"Geometric Programming: {A} Coordinate-Free Approach"
-, booktitle =	"Theory and Practice of Geometric Modeling"
-, publisher =	"Springer-Verlag"
-, address =	"Blaubeuren, FRG (Oct 1988)"
-, year =	1989
-, pages =	""
-, update =	"93.09 held"
+, author =      "A. D. DeRose"
+, title =       "Geometric Programming: {A} Coordinate-Free Approach"
+, booktitle =   "Theory and Practice of Geometric Modeling"
+, publisher =   "Springer-Verlag"
+, address =     "Blaubeuren, FRG (Oct 1988)"
+, year =        1989
+, pages =       ""
+, update =      "93.09 held"
 }
 
 @phdthesis{d-pimcc-85
-, author =	"T. DeRose"
-, title =	"Geometric Continuity: A parameterization independent measure of continuity for computer aided design"
-, school =	"Computer Science, Unioversity of California, Berkeley"
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "T. DeRose"
+, title =       "Geometric Continuity: A parameterization independent measure of continuity for computer aided design"
+, school =      "Computer Science, Unioversity of California, Berkeley"
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{dlw-masat-93
-, author =	"T. D. DeRose and M. Lounsbery and J. Warren"
-, title =	"Multiresolution Analysis for Surface of Arbitrary Topological Type"
-, type =	"Report"
-, number =	"93-10-05"
-, institution =	"Department of Computer Science, University of Washington"
-, address =	"Seattle, WA"
-, year =	1993
-, update =	"95.01 mitchell"
+, author =      "T. D. DeRose and M. Lounsbery and J. Warren"
+, title =       "Multiresolution Analysis for Surface of Arbitrary Topological Type"
+, type =        "Report"
+, number =      "93-10-05"
+, institution = "Department of Computer Science, University of Washington"
+, address =     "Seattle, WA"
+, year =        1993
+, update =      "95.01 mitchell"
 }
 
 @techreport{d-spclr-94
-, author =	"G. Desaulniers"
-, title =	"On Shortest Paths for a Car-Like Robot Maneuvering Around Obstacles"
-, type =	"Les Cahiers du GERAD"
-, number =	"G-94-35"
-, institution =	"Ecole des Hautes Etudes Commerciales"
-, address =	"Montreal, Canada"
-, year =	1994
-, update =	"98.03 mitchell"
+, author =      "G. Desaulniers"
+, title =       "On Shortest Paths for a Car-Like Robot Maneuvering Around Obstacles"
+, type =        "Les Cahiers du GERAD"
+, number =      "G-94-35"
+, institution = "Ecole des Hautes Etudes Commerciales"
+, address =     "Montreal, Canada"
+, year =        1994
+, update =      "98.03 mitchell"
 }
 
 @article{ds-rnmgc-
-, author =	"H. Desaulniers and N. F. Steward"
-, title =	"Robustness of numerical methods in geometric computation when problem data is uncertain"
-, journal =	"CAD"
-, volume =	25
-, number =	9
-, year =	"??"
-, pages =	"539--545"
-, update =	"98.07 bibrelex"
+, author =      "H. Desaulniers and N. F. Steward"
+, title =       "Robustness of numerical methods in geometric computation when problem data is uncertain"
+, journal =     "CAD"
+, volume =      25
+, number =      9
+, year =        "??"
+, pages =       "539--545"
+, update =      "98.07 bibrelex"
 }
 
 @article{ds-embrr-92
-, author =	"H. Desaulniers and N. F. Stewart"
-, title =	"An extension of manifold boudary representations to the $r$-sets"
-, journal =	"ACM Trans. Graph."
-, volume =	11
-, number =	1
-, month =	jan
-, year =	1992
-, pages =	"40--60"
-, update =	"98.07 bibrelex"
+, author =      "H. Desaulniers and N. F. Stewart"
+, title =       "An extension of manifold boudary representations to the $r$-sets"
+, journal =     "ACM Trans. Graph."
+, volume =      11
+, number =      1
+, month =       jan
+, year =        1992
+, pages =       "40--60"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{ds-beafp-93
-, author =	"H. Desaulniers and N. F. Stewart"
-, title =	"Backward error analysis for floating-point operations on rectilinear $r$-sets"
-, type =	"Technical {Report}"
-, number =	816
-, institution =	"Univ. Montreal"
-, year =	1993
-, keywords =	"Computer-aided design."
-, update =	"98.07 bibrelex"
+, author =      "H. Desaulniers and N. F. Stewart"
+, title =       "Backward error analysis for floating-point operations on rectilinear $r$-sets"
+, type =        "Technical {Report}"
+, number =      816
+, institution = "Univ. Montreal"
+, year =        1993
+, keywords =    "Computer-aided design."
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ds-qrrs-92
-, author =	"H. Desaulniers and N. F. Stewart"
-, title =	"Quasi-rectilinear $r$-sets"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"52--58"
-, cites =	"r-mmrso-79, r-rrstm-80, rv-smcsr-83, m-ism-88, -isbfp-85, g-rssm-87, h-gsm-89, s-drpga-90, s-rsasf-91, ds-embrr-92, lth-csgpo-86, w-restr-88, m-rfldd-90, hhk-rsops-89, hk-prga-89, mn-fccrp-90i, r-cirfd-89, m-vigau-88p, w-aedfd-34, m-erf-34, a-efslc-67, l-tsas-64, ds-beafp-93, w-aep-65, k-sa-69, bs-msto-91, bs-iftmo-92, s-scctf-92, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "H. Desaulniers and N. F. Stewart"
+, title =       "Quasi-rectilinear $r$-sets"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "52--58"
+, cites =       "r-mmrso-79, r-rrstm-80, rv-smcsr-83, m-ism-88, -isbfp-85, g-rssm-87, h-gsm-89, s-drpga-90, s-rsasf-91, ds-embrr-92, lth-csgpo-86, w-restr-88, m-rfldd-90, hhk-rsops-89, hk-prga-89, mn-fccrp-90i, r-cirfd-89, m-vigau-88p, w-aedfd-34, m-erf-34, a-efslc-67, l-tsas-64, ds-beafp-93, w-aep-65, k-sa-69, bs-msto-91, bs-iftmo-92, s-scctf-92, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @book{d-pp-44
-, author =	"R. Descartes"
-, title =	"Principia Philosophiae"
-, publisher =	"Ludovicus Elzevirius"
-, address =	"Amsterdam"
-, year =	1644
-, update =	"00.03 bibrelex"
+, author =      "R. Descartes"
+, title =       "Principia Philosophiae"
+, publisher =   "Ludovicus Elzevirius"
+, address =     "Amsterdam"
+, year =        1644
+, update =      "00.03 bibrelex"
 }
 
 @phdthesis{d-tq-96
-, author =	"P. Desnogu{\`e}s"
-, title =	"Triangulations et quadriques"
-, type =	"Th\`{e}se de doctorat en sciences"
-, school =	"Universit\'e de Nice-Sophia Antipolis"
-, address =	"France"
-, year =	1996
-, url =	"https://hal.inria.fr/tel-00771335"
-, keywords =	"doctoral thesis"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers"
+, author =      "P. Desnogu{\`e}s"
+, title =       "Triangulations et quadriques"
+, type =        "Th\`{e}se de doctorat en sciences"
+, school =      "Universit\'e de Nice-Sophia Antipolis"
+, address =     "France"
+, year =        1996
+, url = "https://inria.hal.science/tel-00771335"
+, keywords =    "doctoral thesis"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 devillers"
 }
 
 @inproceedings{dd-lothp-95
-, author =	"Pascal Desnogu{\`e}s and Olivier Devillers"
-, title =	"A Locally Optimal Triangulation of the Hyperbolic Paraboloid"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"49--54"
-, url =	"https://hal.inria.fr/inria-00413229"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 jones"
+, author =      "Pascal Desnogu{\`e}s and Olivier Devillers"
+, title =       "A Locally Optimal Triangulation of the Hyperbolic Paraboloid"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "49--54"
+, url = "https://inria.hal.science/inria-00413229"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 jones"
 }
 
 @inproceedings{dlm-mlrca-93
-, author =	"A. Dessmark and A. Lingas and A. Maheshwari"
-, title =	"Multi-list ranking: complexity and applications"
-, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	665
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"306--316"
-, update =	"93.05 smid"
+, author =      "A. Dessmark and A. Lingas and A. Maheshwari"
+, title =       "Multi-list ranking: complexity and applications"
+, booktitle =   "Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      665
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "306--316"
+, update =      "93.05 smid"
 }
 
 @article{d-rrpa-86
-, author =	"G. Dettori"
-, title =	"Recent results in polygonal approximation"
-, journal =	"Adv. Modell. Simul."
-, volume =	6
-, number =	2
-, year =	1986
-, pages =	"35--57"
-, keywords =	"polygons, approximation"
-, update =	"95.09 korneenko"
+, author =      "G. Dettori"
+, title =       "Recent results in polygonal approximation"
+, journal =     "Adv. Modell. Simul."
+, volume =      6
+, number =      2
+, year =        1986
+, pages =       "35--57"
+, keywords =    "polygons, approximation"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{d-ctdvc-84
-, author =	"F. D{\'e}vai"
-, title =	"Complexity of two-dimensional visibility computations"
-, booktitle =	"Proc. 3rd European Conference on CAD'CAM and Computer Graphics"
-, site =	"Paris, France"
-, volume =	"827--841"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "F. D{\'e}vai"
+, title =       "Complexity of two-dimensional visibility computations"
+, booktitle =   "Proc. 3rd European Conference on CAD'CAM and Computer Graphics"
+, site =        "Paris, France"
+, volume =      "827--841"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{d-cvc-81
-, author =	"F. D{\'e}vai"
-, title =	"Complexity of visibility computations"
-, school =	"University of Budapest"
-, address =	"Budapest, Hungary"
-, year =	1981
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "F. D{\'e}vai"
+, title =       "Complexity of visibility computations"
+, school =      "University of Budapest"
+, address =     "Budapest, Hungary"
+, year =        1981
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{d-qbhle-86
-, author =	"F. D{\'e}vai"
-, title =	"Quadratic bounds for hidden line elimination"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"269--275"
-, keywords =	"hidden line/surface elimination"
-, cites =	"a-nqimr-67, b-lbact-83, bm-gta-76, cgl-pgd-83, d-cvc-81, d-ctdvc-84, eos-calha-83t, f-cgpractice-85, f-ltehs-80, fw-ccmb-78, gm-ahle-69, hc-gi-52, l-shlpc-70, n-flsah-85, s-tsbhl-81, sss-cthsa-74, wa-hsrup-77, w-cvgnl-85, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "F. D{\'e}vai"
+, title =       "Quadratic bounds for hidden line elimination"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "269--275"
+, keywords =    "hidden line/surface elimination"
+, cites =       "a-nqimr-67, b-lbact-83, bm-gta-76, cgl-pgd-83, d-cvc-81, d-ctdvc-84, eos-calha-83t, f-cgpractice-85, f-ltehs-80, fw-ccmb-78, gm-ahle-69, hc-gi-52, l-shlpc-70, n-flsah-85, s-tsbhl-81, sss-cthsa-74, wa-hsrup-77, w-cvgnl-85, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{ds-cchfs-79
-, author =	"F. D{\'e}vai and T. Szendr{\'e}nyi"
-, title =	"Comments on convex hull of a finite set of points in two dimensions"
-, journal =	"Inform. Process. Lett."
-, volume =	9
-, year =	1979
-, pages =	"141--142"
+, author =      "F. D{\'e}vai and T. Szendr{\'e}nyi"
+, title =       "Comments on convex hull of a finite set of points in two dimensions"
+, journal =     "Inform. Process. Lett."
+, volume =      9
+, year =        1979
+, pages =       "141--142"
 }
 
 @book{d-icds-86
-, author =	"R. L. Devaney"
-, title =	"Introduction to Chaotic Dynamical Systems"
-, publisher =	"Benjamin Cummins"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "R. L. Devaney"
+, title =       "Introduction to Chaotic Dynamical Systems"
+, publisher =   "Benjamin Cummins"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{dd-idamd-82
-, author =	"P. A. Devijver and M. Dekesel"
-, title =	"Insert and delete algorithms for maintaining dynamic {Delaunay} triangulations"
-, journal =	"Pattern Recogn. Lett."
-, volume =	1
-, year =	1982
-, pages =	"73--77"
-, update =	"93.05 freimer"
+, author =      "P. A. Devijver and M. Dekesel"
+, title =       "Insert and delete algorithms for maintaining dynamic {Delaunay} triangulations"
+, journal =     "Pattern Recogn. Lett."
+, volume =      1
+, year =        1982
+, pages =       "73--77"
+, update =      "93.05 freimer"
 }
 
 @book{dk-prsa-82
-, author =	"P. A. Devijver and J. Kittler"
-, title =	"Pattern Recognition: {A} Statistical Approach"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1982
-, update =	"97.03 schwarzkopf"
+, author =      "P. A. Devijver and J. Kittler"
+, title =       "Pattern Recognition: {A} Statistical Approach"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1982
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{dm-cdtcp-82
-, author =	"P. A. Devijver and S. Maybank"
-, title =	"On the computation of the {Delaunay} triangulation of a convex polygon"
-, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
-, year =	1982
-, pages =	"420--422"
-, update =	"94.09 lambert"
+, author =      "P. A. Devijver and S. Maybank"
+, title =       "On the computation of the {Delaunay} triangulation of a convex polygon"
+, booktitle =   "Proc. 6th IEEE Internat. Conf. Pattern Recogn."
+, year =        1982
+, pages =       "420--422"
+, update =      "94.09 lambert"
 }
 
 @article{d-ircg-96
-, author =	"Olivier Devillers"
-, title =	"An introduction to randomization in computational geometry"
-, journal =	"Theoret. Comput. Sci."
-, volume =	157
-, year =	1996
-, pages =	"35--52"
-, url =	"https://hal.inria.fr/inria-00167202"
-, cites =	"as-solri-92, bd-rcuet-92, bdsty-arsol-92, bdt-schov-93, bt-hrodt-86, bt-rcdt-93, prisme-by-ga-95, ce-oails-92, cegss-cfals-93, c-ochaa-93, c-narsc-87, cms-frric-93, cs-arscg-89, prisme-2626, bds-lric-94, d-rysoa-92, dg-dbppl-93, dmt-fddtl-92, dty-dlals-92, dy-rchyd-93, gks-ricdv-92, ms-dplah-91, m-lavd-91, m-rmstd-91, m-rmstf-91, m-rmstl-91, m-cgitr-93, ol-mcp-81, ps-cgi-85, p-slpab-90, s-dmgsm-91, s-dmcpr-92, s-sfira-91, t-tdrac-93"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.05 smid, 96.01 devillers"
-, abstract =	"This paper is not a complete survey on randomized algorithms in computational geometry, but an introduction to this subject providing intuitions and references.  In a first time, some basic ideas are illustrated by the sorting problem, and in a second time few results on computational geometry are briefly explained."
+, author =      "Olivier Devillers"
+, title =       "An introduction to randomization in computational geometry"
+, journal =     "Theoret. Comput. Sci."
+, volume =      157
+, year =        1996
+, pages =       "35--52"
+, url = "https://inria.hal.science/inria-00167202"
+, cites =       "as-solri-92, bd-rcuet-92, bdsty-arsol-92, bdt-schov-93, bt-hrodt-86, bt-rcdt-93, prisme-by-ga-95, ce-oails-92, cegss-cfals-93, c-ochaa-93, c-narsc-87, cms-frric-93, cs-arscg-89, prisme-2626, bds-lric-94, d-rysoa-92, dg-dbppl-93, dmt-fddtl-92, dty-dlals-92, dy-rchyd-93, gks-ricdv-92, ms-dplah-91, m-lavd-91, m-rmstd-91, m-rmstf-91, m-rmstl-91, m-cgitr-93, ol-mcp-81, ps-cgi-85, p-slpab-90, s-dmgsm-91, s-dmcpr-92, s-sfira-91, t-tdrac-93"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.05 smid, 96.01 devillers"
+, abstract =    "This paper is not a complete survey on randomized algorithms in computational geometry, but an introduction to this subject providing intuitions and references.  In a first time, some basic ideas are illustrated by the sorting problem, and in a second time few results on computational geometry are briefly explained."
 }
 
 @inproceedings{d-cgdc-96
-, author =	"O. Devillers"
-, title =	"Computational geometry and discrete computations"
-, booktitle =	"Proc. 6th Discrete Geometry for Computer Imagery conf."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1176
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"317--324"
-, note =	"(invited paper)"
-, update =	"02.03 devillers"
+, author =      "O. Devillers"
+, title =       "Computational geometry and discrete computations"
+, booktitle =   "Proc. 6th Discrete Geometry for Computer Imagery conf."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1176
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "317--324"
+, note =        "(invited paper)"
+, update =      "02.03 devillers"
 }
 
 @inproceedings{d-iirdt-98
-, author =	"Olivier Devillers"
-, title =	"Improved incremental randomized {Delaunay} triangulation"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"106--115"
-, url =	"https://hal.inria.fr/hal-01179446"
-, archive =	"XXX:cs.CG/9907024"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 98.11 devillers"
-, abstract =	"We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, and small memory occupation. The location structure is organized into several levels. The lowest level just consists of the triangulation, then each level contains the triangulation of a small sample of the levels below. Point location is done by marching in a triangulation to determine the nearest neighbor of the query at that level, then the march restarts from that neighbor at the level below. Using a small sample (3 {\%}) allows a small memory occupation; the march and the use of the nearest neighbor to change levels quickly locate the query."
+, author =      "Olivier Devillers"
+, title =       "Improved incremental randomized {Delaunay} triangulation"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "106--115"
+, url = "https://inria.hal.science/hal-01179446"
+, archive =     "XXX:cs.CG/9907024"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 98.11 devillers"
+, abstract =    "We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, and small memory occupation. The location structure is organized into several levels. The lowest level just consists of the triangulation, then each level contains the triangulation of a small sample of the levels below. Point location is done by marching in a triangulation to determine the nearest neighbor of the query at that level, then the march restarts from that neighbor at the level below. Using a small sample (3 {\%}) allows a small memory occupation; the march and the use of the nearest neighbor to change levels quickly locate the query."
 }
 
 @phdthesis{d-mddtd-88
-, author =	"Olivier Devillers"
-, title =	"M{\'e}thodes d'optimisation du trac{\'e} de rayon"
-, school =	"Universit{\'e} Paris Sud"
-, address =	"Paris, France"
-, year =	1988
-, keywords =	"doctoral thesis"
-, update =	"99.07 devillers, 98.07 bibrelex"
+, author =      "Olivier Devillers"
+, title =       "M{\'e}thodes d'optimisation du trac{\'e} de rayon"
+, school =      "Universit{\'e} Paris Sud"
+, address =     "Paris, France"
+, year =        1988
+, keywords =    "doctoral thesis"
+, update =      "99.07 devillers, 98.07 bibrelex"
 }
 
 @techreport{d-ddt-98
-, author =	"Olivier Devillers"
-, title =	"On Deletion in {Delaunay} Triangulation"
-, type =	"Research {Report}"
-, number =	3451
-, institution =	"INRIA"
-, year =	1998
-, precedes =	"d-ddt-99"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.11 devillers"
-, abstract =	"This paper present how space of spheres and shelling can be used to delete efficiently a point from d-dimensional triangulation.  In 2-dimension, if k is the degree of the deleted vertex, the complexity is $O(k\log k)$, but we notice that this number apply only to low cost operations; time consuming computations are done only a linear number of times.  This algorithm can be viewed as a variation of Heller algorithm which is popular in the geographic information system community. Unfortunately Heller algorithm is false as explained in this paper."
+, author =      "Olivier Devillers"
+, title =       "On Deletion in {Delaunay} Triangulation"
+, type =        "Research {Report}"
+, number =      3451
+, institution = "INRIA"
+, year =        1998
+, precedes =    "d-ddt-99"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.11 devillers"
+, abstract =    "This paper present how space of spheres and shelling can be used to delete efficiently a point from d-dimensional triangulation.  In 2-dimension, if k is the degree of the deleted vertex, the complexity is $O(k\log k)$, but we notice that this number apply only to low cost operations; time consuming computations are done only a linear number of times.  This algorithm can be viewed as a variation of Heller algorithm which is popular in the geographic information system community. Unfortunately Heller algorithm is false as explained in this paper."
 }
 
 @techreport{d-vrtdd-09
@@ -44323,38 +44323,38 @@ @techreport{d-vrtdd-09
 ,  year        = 2009
 ,  type        = "Research Report"
 ,  number      = 7104
-,  url         = "https://hal.inria.fr/inria-00433107/"
+,  url         = "https://inria.hal.science/inria-00433107/"
 }
 
 @inproceedings{d-ddt-99
-, author =	"Olivier Devillers"
-, title =	"On Deletion in {Delaunay} Triangulation"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"181--188"
-, url =	"https://hal.inria.fr/hal-01179435"
-, archive =	"XXX:cs.CG/9907023"
-, succeeds =	"d-ddt-98"
-, cites =	"agss-ltacv-89, a-pdpaa-87, bbp-iayed-98scg, bd-irgo-95, bm-sdcs-71, c-bvdcp-86, ads-rdppw-98, d-iirdt-98, dmt-ssgtu-92i, dp-papaf-98, es-itfwr-96, gs-cdtp-78, h-taatm-90, l-tdam-97, m-smdnt-93, msz-frplw-96, obs-stcav-92, p-gcc-70, s-chdch-86, s-nmpgc-98"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers"
-, abstract =	"This paper present how space of spheres and shelling can be used to delete efficiently a point from d-dimensional triangulation. In 2-dimension, if k is the degree of the deleted vertex, the complexity is $O(k\log k)$, but we notice that this number apply only to low cost operations; time consuming computations are done only a linear number of times. This algorithm can be viewed as a variation of Heller algorithm which is popular in the geographic information system community. Unfortunately Heller algorithm is false as explained in this paper."
+, author =      "Olivier Devillers"
+, title =       "On Deletion in {Delaunay} Triangulation"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "181--188"
+, url = "https://inria.hal.science/hal-01179435"
+, archive =     "XXX:cs.CG/9907023"
+, succeeds =    "d-ddt-98"
+, cites =       "agss-ltacv-89, a-pdpaa-87, bbp-iayed-98scg, bd-irgo-95, bm-sdcs-71, c-bvdcp-86, ads-rdppw-98, d-iirdt-98, dmt-ssgtu-92i, dp-papaf-98, es-itfwr-96, gs-cdtp-78, h-taatm-90, l-tdam-97, m-smdnt-93, msz-frplw-96, obs-stcav-92, p-gcc-70, s-chdch-86, s-nmpgc-98"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers"
+, abstract =    "This paper present how space of spheres and shelling can be used to delete efficiently a point from d-dimensional triangulation. In 2-dimension, if k is the degree of the deleted vertex, the complexity is $O(k\log k)$, but we notice that this number apply only to low cost operations; time consuming computations are done only a linear number of times. This algorithm can be viewed as a variation of Heller algorithm which is popular in the geographic information system community. Unfortunately Heller algorithm is false as explained in this paper."
 }
 
 % also claimed pages = "621--635"
 @article{d-rysoa-92
-, author =	"Olivier Devillers"
-, title =	"Randomization yields simple {$O(n \log^{*} n)$} algorithms for difficult {$\Omega(n)$} problems"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	1
-, year =	1992
-, pages =	"97--111"
-, url =	"https://hal.inria.fr/inria-00167206"
-, archive =	"XXX:cs.CG/9810007"
-, keywords =	"randomized algorithms, Delaunay triangulation, skeleton, medial axis, minimum spanning tree, simple polygon"
-, succeeds =	"d-sroa-91"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
-, abstract =	"We use here the results on the influence graph
+, author =      "Olivier Devillers"
+, title =       "Randomization yields simple {$O(n \log^{*} n)$} algorithms for difficult {$\Omega(n)$} problems"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      1
+, year =        1992
+, pages =       "97--111"
+, url = "https://inria.hal.science/inria-00167206"
+, archive =     "XXX:cs.CG/9810007"
+, keywords =    "randomized algorithms, Delaunay triangulation, skeleton, medial axis, minimum spanning tree, simple polygon"
+, succeeds =    "d-sroa-91"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, abstract =    "We use here the results on the influence graph
 \cite{bdsty-arsol-92} to adapt them for particular cases where additional
 information is available.  In some cases, it is possible to improve the
 expected randomized complexity of algorithms from $O(n\log n)$ to
@@ -44365,56 +44365,56 @@ @article{d-rysoa-92
 }
 
 @techreport{d-reidt-92
-, author =	"Olivier Devillers"
-, title =	"Robust and efficient implementation of the {Delaunay} tree"
-, type =	"Report"
-, number =	1619
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, year =	1992
-, keywords =	"randomized algorithms, Delaunay triangulation, practical issue, degenerate cases"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, author =      "Olivier Devillers"
+, title =       "Robust and efficient implementation of the {Delaunay} tree"
+, type =        "Report"
+, number =      1619
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, year =        1992
+, keywords =    "randomized algorithms, Delaunay triangulation, practical issue, degenerate cases"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
 }
 
 @inproceedings{d-sroa-91
-, author =	"Olivier Devillers"
-, title =	"Simple randomized {$O(n \log^{*} n)$} algorithms"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"141--144"
-, keywords =	"randomized algorithms, Delaunay triangulation, skeleton, medial axis, minimum spanning tree, simple polygon"
-, precedes =	"d-rysoa-92"
-, cites =	"agss-ltacv-89, bdsty-olgag-91a, c-tsplt-90i, cs-arscg-89, s-sfira-90, ZZZ"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, author =      "Olivier Devillers"
+, title =       "Simple randomized {$O(n \log^{*} n)$} algorithms"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "141--144"
+, keywords =    "randomized algorithms, Delaunay triangulation, skeleton, medial axis, minimum spanning tree, simple polygon"
+, precedes =    "d-rysoa-92"
+, cites =       "agss-ltacv-89, bdsty-olgag-91a, c-tsplt-90i, cs-arscg-89, s-sfira-90, ZZZ"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
 }
 
 @techreport{d-scspa-90
-, author =	"Olivier Devillers"
-, title =	"Simultaneous containment of several polygons: analysis of the contact configurations"
-, type =	"Report"
-, number =	1179
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, year =	1990
-, keywords =	"polygon placement, contact configurations"
-, precedes =	"d-scspa-93"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
+, author =      "Olivier Devillers"
+, title =       "Simultaneous containment of several polygons: analysis of the contact configurations"
+, type =        "Report"
+, number =      1179
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, year =        1990
+, keywords =    "polygon placement, contact configurations"
+, precedes =    "d-scspa-93"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
 }
 
 @article{d-scspa-93
-, author =	"Olivier Devillers"
-, title =	"Simultaneous containment of several polygons: analysis of the contact configurations"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, number =	4
-, year =	1993
-, pages =	"429--442"
-, url =	"http://www-sop.inria.fr/prisme/publis/d-scspa-93.ps.gz"
-, keywords =	"motion planning, polygon containment, robotics"
-, succeeds =	"d-scspa-90"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
-, abstract =	"The main concern of this paper is the detection of double
+, author =      "Olivier Devillers"
+, title =       "Simultaneous containment of several polygons: analysis of the contact configurations"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, number =      4
+, year =        1993
+, pages =       "429--442"
+, url = "http://www-sop.inria.fr/prisme/publis/d-scspa-93.ps.gz"
+, keywords =    "motion planning, polygon containment, robotics"
+, succeeds =    "d-scspa-90"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
+, abstract =    "The main concern of this paper is the detection of double
 contact configurations for some polygons moving in translation in a
 polygonal environment.  We first establish some general properties about
 such configurations and give conditions of existence of double contacts
@@ -44429,16 +44429,16 @@ @article{d-scspa-93
 }
 
 @inproceedings{df-sabls-93
-, author =	"Olivier Devillers and Andreas Fabri"
-, title =	"Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, year =	1993
-, pages =	"277--288"
-, precedes =	"df-sabls-96"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers+milone+mitchell+smid, 93.05 jones"
-, abstract =	"We present output-sensitive scalable parallel algorithms
+, author =      "Olivier Devillers and Andreas Fabri"
+, title =       "Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, year =        1993
+, pages =       "277--288"
+, precedes =    "df-sabls-96"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.09 devillers+milone+mitchell+smid, 93.05 jones"
+, abstract =    "We present output-sensitive scalable parallel algorithms
 for bichromatic line segment intersection problems for the Coarse Grained
 Multicomputer model.  Under the assumption that $n\geq p^2$, where $n$ is
 the number of line segments and $p$ the number of processors, we obtain an
@@ -44451,17 +44451,17 @@ @inproceedings{df-sabls-93
 }
 
 @article{df-sabls-96
-, author =	"Olivier Devillers and Andreas Fabri"
-, title =	"Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"487--506"
-, url =	"http://www-sop.inria.fr/prisme/publis/df-sabls-96.ps.gz"
-, succeeds =	"df-sabls-93"
-, cites =	"adh-cgaiaccl-93, b-sna-68, bt-pdcnm-89, cegs-ablsp-89, cp-dsnlthrc-90, dfr-spgac-93, gsg-pmvsppsp-92, grand-ch, gl-rrft-89, l-ipaa-92, ps-crrbsi-92, ps-cgi-85, rv-ltslsn-87"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers"
-, abstract =	"We present output-sensitive scalable parallel algorithms
+, author =      "Olivier Devillers and Andreas Fabri"
+, title =       "Scalable algorithms for bichromatic line segment intersection problems on coarse grained multicomputers"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "487--506"
+, url = "http://www-sop.inria.fr/prisme/publis/df-sabls-96.ps.gz"
+, succeeds =    "df-sabls-93"
+, cites =       "adh-cgaiaccl-93, b-sna-68, bt-pdcnm-89, cegs-ablsp-89, cp-dsnlthrc-90, dfr-spgac-93, gsg-pmvsppsp-92, grand-ch, gl-rrft-89, l-ipaa-92, ps-crrbsi-92, ps-cgi-85, rv-ltslsn-87"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 97.03 devillers"
+, abstract =    "We present output-sensitive scalable parallel algorithms
 for bichromatic line segment intersection problems for the Coarse Grained
 Multicomputer model.  Under the assumption that $n\geq p^2$, where $n$ is
 the number of line segments and $p$ the number of processors, we obtain an
@@ -44474,359 +44474,359 @@ @article{df-sabls-96
 }
 
 @inproceedings{dfmt-amafe-00
-, author =	"Olivier Devillers and Alexandra Fronville and Bernard Mourrain and Monique Teillaud"
-, title =	"Algebraic methods and arithmetic filtering for exact predicates on circle arcs"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"139--147"
-, cites =	"bp-rpsis-97, bs-ealcs-99, bv-earic-99, svy-crm-99, clo-iva-92, lpt-rpqid-99, p-gacg-99p-iaeia-99, y-tegc-97, y-fpaa-00"
-, update =	"02.03 devillers, 00.11 smid, 00.07 devillers, 00.03 devillers"
-, abstract =	"The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae of two intersection points of circle arcs, which is known to be a difficult predicate involved in the computation of arrangements of circle arcs. We present an algorithm for deciding the $x$-order of intersections from the signs of the coefficients of a polynomial, obtained by a general approach based on resultants. This method allows the use of efficient arithmetic and filtering techniques leading to fast implementation as shown by the experimental results."
+, author =      "Olivier Devillers and Alexandra Fronville and Bernard Mourrain and Monique Teillaud"
+, title =       "Algebraic methods and arithmetic filtering for exact predicates on circle arcs"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "139--147"
+, cites =       "bp-rpsis-97, bs-ealcs-99, bv-earic-99, svy-crm-99, clo-iva-92, lpt-rpqid-99, p-gacg-99p-iaeia-99, y-tegc-97, y-fpaa-00"
+, update =      "02.03 devillers, 00.11 smid, 00.07 devillers, 00.03 devillers"
+, abstract =    "The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae of two intersection points of circle arcs, which is known to be a difficult predicate involved in the computation of arrangements of circle arcs. We present an algorithm for deciding the $x$-order of intersections from the signs of the coefficients of a polynomial, obtained by a general approach based on resultants. This method allows the use of efficient arithmetic and filtering techniques leading to fast implementation as shown by the experimental results."
 }
 
 @inproceedings{dfmt-amafe-00i
-, author =	"Olivier Devillers and Alexandra Fronville and Bernard Mourrain and Monique Teillaud"
-, title =	"Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"117--120"
-, update =	"02.03 devillers, 00.03 bibrelex"
+, author =      "Olivier Devillers and Alexandra Fronville and Bernard Mourrain and Monique Teillaud"
+, title =       "Algebraic Methods and Arithmetic Filtering for Exact Predicates on Circle Arcs"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "117--120"
+, update =      "02.03 devillers, 00.03 bibrelex"
 }
 
 @techreport{dg-cgtp-99
-, author =	"Olivier Devillers and Pierre-Marie Gandoin"
-, title =	"Compression g\'eom\'etrique pour une transmission progressive"
-, type =	"Rapport de recherche"
-, number =	3766
-, institution =	"INRIA"
-, year =	1999
-, url =	"http://www-sop.inria.fr/prisme/biblio/"
-, archive =	"XXX:cs.CG/9909018"
-, cites =	"bb-srmua-97, bg-tdrcs-93, sk-ltrdt-97"
-, update =	"99.11 devillers"
-, abstract =	"The compression of geometric structures is a relatively new field of data compression. Since about 1995, several articles have dealt with the coding of meshes, using for most of them the following approach: the vertices of the mesh are coded in an order such that it contains partially the topology of the mesh. In the same time, some simple rules attempt to predict the position of the current vertex from the positions of its neighbours that have been previously coded. In this article, we describe a compression algorithm whose principle is completely different: the order of the vertices is used to compress their coordinates, and then the topology of the mesh is reconstructed from the vertices. This algorithm, particularly suited for terrain models, achieves compression factors that are slightly greater than those of the currently available algorithms, and moreover, it allows progressive and interactive transmission of the meshes."
+, author =      "Olivier Devillers and Pierre-Marie Gandoin"
+, title =       "Compression g\'eom\'etrique pour une transmission progressive"
+, type =        "Rapport de recherche"
+, number =      3766
+, institution = "INRIA"
+, year =        1999
+, url = "http://www-sop.inria.fr/prisme/biblio/"
+, archive =     "XXX:cs.CG/9909018"
+, cites =       "bb-srmua-97, bg-tdrcs-93, sk-ltrdt-97"
+, update =      "99.11 devillers"
+, abstract =    "The compression of geometric structures is a relatively new field of data compression. Since about 1995, several articles have dealt with the coding of meshes, using for most of them the following approach: the vertices of the mesh are coded in an order such that it contains partially the topology of the mesh. In the same time, some simple rules attempt to predict the position of the current vertex from the positions of its neighbours that have been previously coded. In this article, we describe a compression algorithm whose principle is completely different: the order of the vertices is used to compress their coordinates, and then the topology of the mesh is reconstructed from the vertices. This algorithm, particularly suited for terrain models, achieves compression factors that are slightly greater than those of the currently available algorithms, and moreover, it allows progressive and interactive transmission of the meshes."
 }
 
 @inproceedings{dg-cgit-00
-, author =	"Olivier Devillers and Pierre-Marie Gandoin"
-, title =	"Geometric Compression for Interactive Transmission"
-, booktitle =	"Proc. of IEEE Visualization 2000"
-, year =	2000
-, pages =	"319--326"
-, update =	"01.11 devillers"
+, author =      "Olivier Devillers and Pierre-Marie Gandoin"
+, title =       "Geometric Compression for Interactive Transmission"
+, booktitle =   "Proc. of IEEE Visualization 2000"
+, year =        2000
+, pages =       "319--326"
+, update =      "01.11 devillers"
 }
 
 @inproceedings{dg-dbppl-93
-, author =	"Olivier Devillers and Mordecai Golin"
-, title =	"Dog Bites Postman: {Point} Location in the Moving {Voronoi} Diagram and Related Problems"
-, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
-, nickname =	"ESA '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	726
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"133--144"
-, keywords =	"Voronoi, Delaunay, moving points, randomized algorithms, dynamic algorithms, localisation"
-, precedes =	"dg-dbppl-98"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers+smid, 94.01 smid, 93.09 devillers+milone+mitchell"
+, author =      "Olivier Devillers and Mordecai Golin"
+, title =       "Dog Bites Postman: {Point} Location in the Moving {Voronoi} Diagram and Related Problems"
+, booktitle =   "Proc. 1st Annu. European Sympos. Algorithms"
+, nickname =    "ESA '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      726
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "133--144"
+, keywords =    "Voronoi, Delaunay, moving points, randomized algorithms, dynamic algorithms, localisation"
+, precedes =    "dg-dbppl-98"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers+smid, 94.01 smid, 93.09 devillers+milone+mitchell"
 }
 
 @article{dg-dbppl-98
-, author =	"Olivier Devillers and Mordecai Golin"
-, title =	"Dog Bites Postman: Point Location in the Moving {Voronoi} Diagram and Related Problems"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"321--342"
-, url =	"http://www-sop.inria.fr/prisme/publis/dg-dbppl.ps.gz"
-, succeeds =	"dg-dbppl-93"
-, cites =	"ar-vdmph-92, a-vdsfg-91, bdsty-arsol-92, bt-rcdt-93, c-bvdcp-86, cms-frric-92i, cs-arscg-89, d-rysoa-92, dg-dbppl-93, dmt-fddtl-92, dty-dlals-92, egs-oplms-86, fl-vdmpp-91, gt-dtdpl-91, gmr-vdmpp-91, gks-ricdv-92, iklm-cdf3s-93, m-rmstd-91, ms-dplah-91, p-pplr-90, r-dvd-91, r-vdds-92, rn-dvdmp-91, s-dmgsm-91, s-barga-91, s-vdr-92"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 98.07 devillers"
-, abstract =	"In this paper, we discuss two variations of the two-dimensional post-office problem that arise when the post-offices are $n$ postmen moving  with constant velocities.  The first variation addresses the question: given a point $q_0$ and time $t_0$ who is the nearest postman to $q_0$ at  time $t_0?$ We present a randomized incremental data structure that answers the query in expected $O(\log^2 n)$ time.  The second variation views a query point as a dog searching for a postman to bite and finds the  postman that a dog running with speed $v_d$ could reach first.  While it is quite straightforward to design a data structure for the first problem, designing one for the second appears more difficult.  We show that if the dog is quicker than all of the postmen then there is a nice correspondence between the problems. This correspondence will permit us to use the data structure developed for the first problem to solve the second one in $O(\log^2 n)$ time as well.  The proposed structure is semi-dynamic, that is the set of postmen can be modified by inserting new postmen. A fully dynamic structure that also supports deletions can be obtained, but in that case the query time becomes  $O(\log^3 n)$."
+, author =      "Olivier Devillers and Mordecai Golin"
+, title =       "Dog Bites Postman: Point Location in the Moving {Voronoi} Diagram and Related Problems"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "321--342"
+, url = "http://www-sop.inria.fr/prisme/publis/dg-dbppl.ps.gz"
+, succeeds =    "dg-dbppl-93"
+, cites =       "ar-vdmph-92, a-vdsfg-91, bdsty-arsol-92, bt-rcdt-93, c-bvdcp-86, cms-frric-92i, cs-arscg-89, d-rysoa-92, dg-dbppl-93, dmt-fddtl-92, dty-dlals-92, egs-oplms-86, fl-vdmpp-91, gt-dtdpl-91, gmr-vdmpp-91, gks-ricdv-92, iklm-cdf3s-93, m-rmstd-91, ms-dplah-91, p-pplr-90, r-dvd-91, r-vdds-92, rn-dvdmp-91, s-dmgsm-91, s-barga-91, s-vdr-92"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 98.07 devillers"
+, abstract =    "In this paper, we discuss two variations of the two-dimensional post-office problem that arise when the post-offices are $n$ postmen moving  with constant velocities.  The first variation addresses the question: given a point $q_0$ and time $t_0$ who is the nearest postman to $q_0$ at  time $t_0?$ We present a randomized incremental data structure that answers the query in expected $O(\log^2 n)$ time.  The second variation views a query point as a dog searching for a postman to bite and finds the  postman that a dog running with speed $v_d$ could reach first.  While it is quite straightforward to design a data structure for the first problem, designing one for the second appears more difficult.  We show that if the dog is quicker than all of the postmen then there is a nice correspondence between the problems. This correspondence will permit us to use the data structure developed for the first problem to solve the second one in $O(\log^2 n)$ time as well.  The proposed structure is semi-dynamic, that is the set of postmen can be modified by inserting new postmen. A fully dynamic structure that also supports deletions can be obtained, but in that case the query time becomes  $O(\log^3 n)$."
 }
 
 @inproceedings{dg-iafch-94
-, author =	"Olivier Devillers and Mordecai Golin"
-, title =	"Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"153--158"
-, precedes =	"dg-iafch-95"
-, cites =	"a-sdcgp-85, bcddy-acchs-92, r-chada-92, ZZZ"
-, update =	"00.03 bibrelex, 99.07 devillers, 98.11 bibrelex, 96.01 devillers, 94.09 jones"
+, author =      "Olivier Devillers and Mordecai Golin"
+, title =       "Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "153--158"
+, precedes =    "dg-iafch-95"
+, cites =       "a-sdcgp-85, bcddy-acchs-92, r-chada-92, ZZZ"
+, update =      "00.03 bibrelex, 99.07 devillers, 98.11 bibrelex, 96.01 devillers, 94.09 jones"
 }
 
 @article{dg-iafch-95
-, author =	"Olivier Devillers and Mordecai Golin"
-, title =	"Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas"
-, journal =	"Inform. Process. Lett."
-, volume =	56
-, number =	3
-, year =	1995
-, pages =	"157--164"
-, url =	"https://hal.inria.fr/inria-00074391"
-, succeeds =	"dg-iafch-94"
-, cites =	"a-dcgp-85, bcddy-acchs-92, r-chada-92"
-, update =	"99.11 devillers, 99.07 devillers, 96.01 devillers"
-, abstract =	"The existing $O(n \log n)$ algorithms for finding the convex hulls of circles and the lower envelope of parabolas follow the divide-and-conquer paradigm.  The difficulty with developing incremental algorithms for these problems is that the introduction of a new circle or parabola can cause $\Theta(n)$ structural changes, leading to $\Theta(n^2)$ total structural changes during the running of the algorithm.  In this note we examine the geometry of these problems and show that, if the circles or parabolas are first sorted by appropriate parameters before constructing the  convex hull or  lower envelope incrementally, then each new addition may cause at most 3 changes in an amortized sense.  These observations are then used to develop $O(n \log n)$ incremental algorithms for these problems."
+, author =      "Olivier Devillers and Mordecai Golin"
+, title =       "Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas"
+, journal =     "Inform. Process. Lett."
+, volume =      56
+, number =      3
+, year =        1995
+, pages =       "157--164"
+, url = "https://inria.hal.science/inria-00074391"
+, succeeds =    "dg-iafch-94"
+, cites =       "a-dcgp-85, bcddy-acchs-92, r-chada-92"
+, update =      "99.11 devillers, 99.07 devillers, 96.01 devillers"
+, abstract =    "The existing $O(n \log n)$ algorithms for finding the convex hulls of circles and the lower envelope of parabolas follow the divide-and-conquer paradigm.  The difficulty with developing incremental algorithms for these problems is that the introduction of a new circle or parabola can cause $\Theta(n)$ structural changes, leading to $\Theta(n^2)$ total structural changes during the running of the algorithm.  In this note we examine the geometry of these problems and show that, if the circles or parabolas are first sorted by appropriate parameters before constructing the  convex hull or  lower envelope incrementally, then each new addition may cause at most 3 changes in an amortized sense.  These observations are then used to develop $O(n \log n)$ incremental algorithms for these problems."
 }
 
 @article{dgks-qvdmp-96
-, author =	"Olivier Devillers and Mordecai Golin and Klara Kedem and Stefan Schirra"
-, title =	"Queries on {Voronoi} Diagrams of Moving Points"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"315--327"
-, url =	"https://dx.doi.org/10.1016/0925-7721(95)00053-4"
-, succeeds =	"dgks-rdqvd-94i"
-, cites =	"ar-vdmph-92, c-sssl-86, dg-dbppl-93, dsst-mdsp-89, fl-vdmpp-91, gt-dtdpl-91, gks-ricdv-92, gmr-vdmpp-91, m-apcad-83, r-vdds-90, r-dvd-91, rn-dvdmp-91, st-pplup-86, sa-dsstg-95, s-vdr-92"
-, update =	"99.11 devillers, 99.07 devillers, 97.03 devillers+smid"
-, abstract =	"Suppose we are given $n$ moving postmen described by their motion equations $p_i(t) = s_i + v_it,$ $i=1,\ldots, n$, where $s_i \in R^2$ is the position of the $i$'th postman at time $t=0$, and $v_i \in R^2$ is his velocity.  The problem we address is how to preprocess the postmen data so as to be able to efficiently answer two types of nearest-neighbor queries.  The first one asks ``who is the nearest postman at time $t_q$ to a dog located at point $s_q$. In the second type a query dog is located at point $s_q$ at time $t_q$, its speed is $v_q>|v_i|$ (for all $i=1, \ldots , n$), and we want to know which postman the dog can catch first.    The first type of query is relatively simple to address, the second type at first seems much more complicated.  We show that the problems are very closely related, with  efficient solutions to the first type of query leading to efficient solutions to the second.  We then present two solutions to these problems, with tradeoff between preprocessing time and query time.  Both solutions use deterministic data structures."
+, author =      "Olivier Devillers and Mordecai Golin and Klara Kedem and Stefan Schirra"
+, title =       "Queries on {Voronoi} Diagrams of Moving Points"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "315--327"
+, url = "https://dx.doi.org/10.1016/0925-7721(95)00053-4"
+, succeeds =    "dgks-rdqvd-94i"
+, cites =       "ar-vdmph-92, c-sssl-86, dg-dbppl-93, dsst-mdsp-89, fl-vdmpp-91, gt-dtdpl-91, gks-ricdv-92, gmr-vdmpp-91, m-apcad-83, r-vdds-90, r-dvd-91, rn-dvdmp-91, st-pplup-86, sa-dsstg-95, s-vdr-92"
+, update =      "99.11 devillers, 99.07 devillers, 97.03 devillers+smid"
+, abstract =    "Suppose we are given $n$ moving postmen described by their motion equations $p_i(t) = s_i + v_it,$ $i=1,\ldots, n$, where $s_i \in R^2$ is the position of the $i$'th postman at time $t=0$, and $v_i \in R^2$ is his velocity.  The problem we address is how to preprocess the postmen data so as to be able to efficiently answer two types of nearest-neighbor queries.  The first one asks ``who is the nearest postman at time $t_q$ to a dog located at point $s_q$. In the second type a query dog is located at point $s_q$ at time $t_q$, its speed is $v_q>|v_i|$ (for all $i=1, \ldots , n$), and we want to know which postman the dog can catch first.    The first type of query is relatively simple to address, the second type at first seems much more complicated.  We show that the problems are very closely related, with  efficient solutions to the first type of query leading to efficient solutions to the second.  We then present two solutions to these problems, with tradeoff between preprocessing time and query time.  Both solutions use deterministic data structures."
 }
 
 @techreport{dgks-rdqvd-94t
-, author =	"Olivier Devillers and Mordecai Golin and Klara Kedem and Stefan Schirra"
-, title =	"Revenge of the Dog: Queries on {Voronoi} Diagrams of Moving Points"
-, type =	"Report"
-, number =	"MPI-I-94-149"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, note =	"also INRIA-2329"
-, precedes =	"dgks-rdqvd-94i"
-, update =	"99.07 devillers, 97.03 devillers, 95.01 smid"
+, author =      "Olivier Devillers and Mordecai Golin and Klara Kedem and Stefan Schirra"
+, title =       "Revenge of the Dog: Queries on {Voronoi} Diagrams of Moving Points"
+, type =        "Report"
+, number =      "MPI-I-94-149"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, note =        "also INRIA-2329"
+, precedes =    "dgks-rdqvd-94i"
+, update =      "99.07 devillers, 97.03 devillers, 95.01 smid"
 }
 
 @inproceedings{dgks-rdqvd-94i
-, author =	"Olivier Devillers and Mordecai Golin and K. Kedem and S. Schirra"
-, title =	"Revenge of the Dog: Queries on {Voronoi} Diagrams of Moving Points"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"122--127"
-, succeeds =	"dgks-rdqvd-94t"
-, precedes =	"dgks-qvdmp-96"
-, cites =	"c-sssl-86, dg-dbppl-93, dsst-mdsp-89, fl-vdmpp-91, gks-ricdv-92, gmr-vdmpp-92, gt-dtdpl-91, m-apcad-83, st-pplup-86, ZZZ"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.11 bibrelex, 97.03 devillers+smid, 95.01 smid, 94.09 jones"
+, author =      "Olivier Devillers and Mordecai Golin and K. Kedem and S. Schirra"
+, title =       "Revenge of the Dog: Queries on {Voronoi} Diagrams of Moving Points"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "122--127"
+, succeeds =    "dgks-rdqvd-94t"
+, precedes =    "dgks-qvdmp-96"
+, cites =       "c-sssl-86, dg-dbppl-93, dsst-mdsp-89, fl-vdmpp-91, gks-ricdv-92, gmr-vdmpp-92, gt-dtdpl-91, m-apcad-83, st-pplup-86, ZZZ"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.11 bibrelex, 97.03 devillers+smid, 95.01 smid, 94.09 jones"
 }
 
 @article{dg-sb-01
-, author =	"Olivier Devillers and Philippe Guigue"
-, title =	"The shuffling buffer"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"555--572"
-, update =	"02.03 devillers"
+, author =      "Olivier Devillers and Philippe Guigue"
+, title =       "The shuffling buffer"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "555--572"
+, update =      "02.03 devillers"
 }
 
 @article{dk-olbps-99
-, author =	"Olivier Devillers and Matthew Katz"
-, title =	"Optimal Line Bipartitions of Point Sets"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, year =	1999
-, pages =	"39--51"
-, url =	"https://dx.doi.org/10.1142/S0218195999000042"
-, succeeds =	"dk-olbps-96"
-, cites =	"as-pglp-94, abky-cabmm-88, a-dp-86, cms-frric-93, gks-sgsop-95, hr-tcpp-93, hs-ftp-91, jk-eaetc-94, k-iagoe-95, ks-ebago-93, mw-fobpp-91, ms-ppgmm-91, ol-mcp-81, ps-cgi-85, rww-obps-92, s-nlap2-96"
-, update =	"99.11 devillers, 99.07 devillers, 99.03 devillers, 97.11 katz"
-, abstract =	"Let $S$ be a set of $n$ points in the plane.  We study the following problem: Partition $S$ by a line into two subsets $S_a$ and $S_b$ such that $max\{f(S_a), f(S_b)\}$ is minimal, where $f$ is any monotone function defined over $2^S$.  We first present a solution to the case where the points in $S$ are the vertices of a convex polygon and apply it to some common cases --- $f(S')$ is the perimeter, area, or width of the convex hull of $S' \subseteq S$ --- to obtain linear solutions (or $O(n\log n)$ solutions if the convex hull of $S$ is not given) to the corresponding problems.  This solution is based on an efficient procedure for finding a minimal entry in matrices of some special type, which we believe is of independent interest.  For the general case we present a linear space solution which is in some sense output sensitive. It yields solutions to the perimeter and area cases that are never slower and often faster than the best previous solutions."
+, author =      "Olivier Devillers and Matthew Katz"
+, title =       "Optimal Line Bipartitions of Point Sets"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, year =        1999
+, pages =       "39--51"
+, url = "https://dx.doi.org/10.1142/S0218195999000042"
+, succeeds =    "dk-olbps-96"
+, cites =       "as-pglp-94, abky-cabmm-88, a-dp-86, cms-frric-93, gks-sgsop-95, hr-tcpp-93, hs-ftp-91, jk-eaetc-94, k-iagoe-95, ks-ebago-93, mw-fobpp-91, ms-ppgmm-91, ol-mcp-81, ps-cgi-85, rww-obps-92, s-nlap2-96"
+, update =      "99.11 devillers, 99.07 devillers, 99.03 devillers, 97.11 katz"
+, abstract =    "Let $S$ be a set of $n$ points in the plane.  We study the following problem: Partition $S$ by a line into two subsets $S_a$ and $S_b$ such that $max\{f(S_a), f(S_b)\}$ is minimal, where $f$ is any monotone function defined over $2^S$.  We first present a solution to the case where the points in $S$ are the vertices of a convex polygon and apply it to some common cases --- $f(S')$ is the perimeter, area, or width of the convex hull of $S' \subseteq S$ --- to obtain linear solutions (or $O(n\log n)$ solutions if the convex hull of $S$ is not given) to the corresponding problems.  This solution is based on an efficient procedure for finding a minimal entry in matrices of some special type, which we believe is of independent interest.  For the general case we present a linear space solution which is in some sense output sensitive. It yields solutions to the perimeter and area cases that are never slower and often faster than the best previous solutions."
 }
 
 @inproceedings{dk-olbps-96
-, author =	"Olivier Devillers and Matthew J. Katz"
-, title =	"Optimal line bipartitions of point sets"
-, booktitle =	"Proc. 7th Annu. Internat. Sympos. Algorithms Comput."
-, year =	1996
-, pages =	"45--54"
-, precedes =	"dk-olbps-99"
-, update =	"99.07 devillers, 99.03 devillers, 97.11 katz"
+, author =      "Olivier Devillers and Matthew J. Katz"
+, title =       "Optimal line bipartitions of point sets"
+, booktitle =   "Proc. 7th Annu. Internat. Sympos. Algorithms Comput."
+, year =        1996
+, pages =       "45--54"
+, precedes =    "dk-olbps-99"
+, update =      "99.07 devillers, 99.03 devillers, 97.11 katz"
 }
 
 @inproceedings{dlpt-ccpps-97
-, author =	"Olivier Devillers and Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
-, title =	"Checking the Convexity of Polytopes and the Planarity of Subdivisions"
-, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
-, nickname =	"WADS '97"
-, site =	"Halifax, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1272
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"186--199"
-, precedes =	"dlpt-ccpps-98"
-, update =	"99.07 bibrelex, 99.03 devillers, 98.07 tamassia+vismara"
+, author =      "Olivier Devillers and Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
+, title =       "Checking the Convexity of Polytopes and the Planarity of Subdivisions"
+, booktitle =   "Proc. 5th Workshop Algorithms Data Struct."
+, nickname =    "WADS '97"
+, site =        "Halifax, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1272
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "186--199"
+, precedes =    "dlpt-ccpps-98"
+, update =      "99.07 bibrelex, 99.03 devillers, 98.07 tamassia+vismara"
 }
 
 @article{dlpt-ccpps-98
-, author =	"Olivier Devillers and Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
-, title =	"Checking the Convexity of Polytopes and the Planarity of Subdivisions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	11
-, year =	1998
-, pages =	"187--208"
-, url =	"https://dx.doi.org/10.1016/S0925-7721(98)00039-X"
-, keywords =	"graph drawing, planar, straight-line, checking"
-, succeeds =	"dlpt-ccpps-97"
-, cites =	"-dcgs-, bbdgt-ccgg-97, bo-arcgi-79, bk-dpcw-95, b-ecvdl-96, c-tsplt-91a, dtv-olcpt-95, dtv-olcpt-95t, dv-aptg-96, f-slrpg-48, glm-othsr-96, h-gt-72, ht-ept-74, k-eops-88, ll-abgtc-87, lpt-rpqid-97, lpt-rpqid-99, mn-cgs-96, mnssssu-cgpvg-96, mnssssu-cgpvg-97, swm-ccr-95, y-tegc-97"
-, update =	"99.11 devillers, 99.03 devillers, 98.11 tamassia"
-, abstract =	"This paper considers the problem of verifying the correctness of geometric structures. In particular, we design simple optimal checkers for convex polytopes in two and higher dimensions, and for various types of planar subdivisions, such as triangulations, Delaunay triangulations, and convex subdivisions. Their performance is analyzed also in terms of the algorithmic degree, which characterizes the arithmetic precision required."
+, author =      "Olivier Devillers and Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
+, title =       "Checking the Convexity of Polytopes and the Planarity of Subdivisions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      11
+, year =        1998
+, pages =       "187--208"
+, url = "https://dx.doi.org/10.1016/S0925-7721(98)00039-X"
+, keywords =    "graph drawing, planar, straight-line, checking"
+, succeeds =    "dlpt-ccpps-97"
+, cites =       "-dcgs-, bbdgt-ccgg-97, bo-arcgi-79, bk-dpcw-95, b-ecvdl-96, c-tsplt-91a, dtv-olcpt-95, dtv-olcpt-95t, dv-aptg-96, f-slrpg-48, glm-othsr-96, h-gt-72, ht-ept-74, k-eops-88, ll-abgtc-87, lpt-rpqid-97, lpt-rpqid-99, mn-cgs-96, mnssssu-cgpvg-96, mnssssu-cgpvg-97, swm-ccr-95, y-tegc-97"
+, update =      "99.11 devillers, 99.03 devillers, 98.11 tamassia"
+, abstract =    "This paper considers the problem of verifying the correctness of geometric structures. In particular, we design simple optimal checkers for convex polytopes in two and higher dimensions, and for various types of planar subdivisions, such as triangulations, Delaunay triangulations, and convex subdivisions. Their performance is analyzed also in terms of the algorithmic degree, which characterizes the arithmetic precision required."
 }
 
 @techreport{dmt-fddtl-91t
-, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
-, title =	"Fully dynamic {Delaunay} triangulation in logarithmic expected time per operation"
-, type =	"Technical Report"
-, number =	1349
-, institution =	"INRIA"
-, year =	1991
-, succeeds =	"dmt-fddtl-92"
-, precedes =	"dmt-fddtl-91"
-, update =	"99.07 devillers, 98.11 bibrelex"
+, author =      "Olivier Devillers and Stefan Meiser and Monique Teillaud"
+, title =       "Fully dynamic {Delaunay} triangulation in logarithmic expected time per operation"
+, type =        "Technical Report"
+, number =      1349
+, institution = "INRIA"
+, year =        1991
+, succeeds =    "dmt-fddtl-92"
+, precedes =    "dmt-fddtl-91"
+, update =      "99.07 devillers, 98.11 bibrelex"
 }
 
 @inproceedings{dmt-fddtl-91
-, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
-, title =	"Fully dynamic {Delaunay} triangulation in logarithmic expected time per operation"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"42--53"
-, keywords =	"randomized algorithms, Delaunay triangulation, dynamizing datastructures"
-, succeeds =	"dmt-fddtl-91t"
-, precedes =	"dmt-fddtl-92"
-, update =	"02.03 icking, 99.11 bibrelex, 99.07 devillers, 98.11 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, author =      "Olivier Devillers and Stefan Meiser and Monique Teillaud"
+, title =       "Fully dynamic {Delaunay} triangulation in logarithmic expected time per operation"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "42--53"
+, keywords =    "randomized algorithms, Delaunay triangulation, dynamizing datastructures"
+, succeeds =    "dmt-fddtl-91t"
+, precedes =    "dmt-fddtl-92"
+, update =      "02.03 icking, 99.11 bibrelex, 99.07 devillers, 98.11 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
 }
 
 @article{dmt-fddtl-92
-, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
-, title =	"Fully dynamic {Delaunay} triangulation in logarithmic expected time per operation"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	2
-, year =	1992
-, pages =	"55--80"
-, url =	"http://www-sop.inria.fr/prisme/publis/dmt-fddtl-92.ps.gz"
-, keywords =	"randomized algorithms, Delaunay triangulation, dynamizing datastructures"
-, succeeds =	"dmt-fddtl-91"
-, precedes =	"dmt-fddtl-91t"
-, update =	"02.03 icking, 99.11 bibrelex, 99.07 devillers, 98.11 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
-, abstract =	"The Delaunay Tree is a hierarchical data structure that has been introduced in \cite{bt-hrodt-86} and analyzed in\cite{bt-rcdt-93,bdsty-arsol-92}.  For a given set of sites  in the planeand an order of insertion for these sites, the Delaunay Tree stores allthe successive Delaunay triangulations.  As proved before, the DelaunayTree allows the insertion of a site in logarithmic expected time andlinear expected space, when the insertion sequence is randomized.  In thispaper, we describe an algorithm maintaining the Delaunay Tree underinsertions and deletions of sites.  This can be done in $O(\log n)$expected time for an insertion and $O(\log\log n)$ expected time for adeletion, where $n$ is the number of sites currently present in thestrucuture.  For deletions, by expected time, we mean averaging over allalready inserted sites for the choice of the deleted sites.  The algorithmhas been effectively coded and experimental results are given."
+, author =      "Olivier Devillers and Stefan Meiser and Monique Teillaud"
+, title =       "Fully dynamic {Delaunay} triangulation in logarithmic expected time per operation"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      2
+, year =        1992
+, pages =       "55--80"
+, url = "http://www-sop.inria.fr/prisme/publis/dmt-fddtl-92.ps.gz"
+, keywords =    "randomized algorithms, Delaunay triangulation, dynamizing datastructures"
+, succeeds =    "dmt-fddtl-91"
+, precedes =    "dmt-fddtl-91t"
+, update =      "02.03 icking, 99.11 bibrelex, 99.07 devillers, 98.11 bibrelex, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, abstract =    "The Delaunay Tree is a hierarchical data structure that has been introduced in \cite{bt-hrodt-86} and analyzed in\cite{bt-rcdt-93,bdsty-arsol-92}.  For a given set of sites  in the planeand an order of insertion for these sites, the Delaunay Tree stores allthe successive Delaunay triangulations.  As proved before, the DelaunayTree allows the insertion of a site in logarithmic expected time andlinear expected space, when the insertion sequence is randomized.  In thispaper, we describe an algorithm maintaining the Delaunay Tree underinsertions and deletions of sites.  This can be done in $O(\log n)$expected time for an insertion and $O(\log\log n)$ expected time for adeletion, where $n$ is the number of sites currently present in thestrucuture.  For deletions, by expected time, we mean averaging over allalready inserted sites for the choice of the deleted sites.  The algorithmhas been effectively coded and experimental results are given."
 }
 
 @techreport{dmt-ssgtu-92t
-, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
-, title =	"The space of spheres, a geometric tool to unify duality results on {Voronoi} diagrams"
-, type =	"Report"
-, number =	1620
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, year =	1992
-, precedes =	"dmt-ssgtu-92i"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, author =      "Olivier Devillers and Stefan Meiser and Monique Teillaud"
+, title =       "The space of spheres, a geometric tool to unify duality results on {Voronoi} diagrams"
+, type =        "Report"
+, number =      1620
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, year =        1992
+, precedes =    "dmt-ssgtu-92i"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
 }
 
 @inproceedings{dmt-ssgtu-92
-, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
-, title =	"The Space of Spheres, a Geometric Tool to Unify Duality Results on {Voronoi} Diagrams"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"45--49"
-, update =	"00.03 bibrelex"
+, author =      "Olivier Devillers and Stefan Meiser and Monique Teillaud"
+, title =       "The Space of Spheres, a Geometric Tool to Unify Duality Results on {Voronoi} Diagrams"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "45--49"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{dmt-ssgtu-92i
-, author =	"Olivier Devillers and Stefan Meiser and Monique Teillaud"
-, title =	"The space of spheres, a geometric tool to unify duality results on {Voronoi} diagrams"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"263--268"
-, keywords =	"duality results, generalized Voronoi diagrams, geometric transforms, upper/lower envelopes"
-, succeeds =	"dmt-ssgtu-92t"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.05 smid"
+, author =      "Olivier Devillers and Stefan Meiser and Monique Teillaud"
+, title =       "The space of spheres, a geometric tool to unify duality results on {Voronoi} diagrams"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "263--268"
+, keywords =    "duality results, generalized Voronoi diagrams, geometric transforms, upper/lower envelopes"
+, succeeds =    "dmt-ssgtu-92t"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers, 93.05 smid"
 }
 
 @inproceedings{dm-gvvge-92
-, author =	"Olivier Devillers and Naji Mouawad"
-, title =	"Guarding vertices versus guarding edges in a simple polygon"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"99--102"
-, cites =	"c-ctpg-75, ll-ccagp-86, ea-lacvp-81, gj-cigtn-79, o-agta-87, ZZZ"
-, update =	"99.07 devillers, 98.07 bibrelex"
+, author =      "Olivier Devillers and Naji Mouawad"
+, title =       "Guarding vertices versus guarding edges in a simple polygon"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "99--102"
+, cites =       "c-ctpg-75, ll-ccagp-86, ea-lacvp-81, gj-cigtn-79, o-agta-87, ZZZ"
+, update =      "99.07 devillers, 98.07 bibrelex"
 }
 
 @article{dm-focoh-99
-, author =	"Olivier Devillers and Asish Mukhopadhyay"
-, title =	"Finding an ordinary conic and an ordinary hyperplane"
-, journal =	"Nordic J. Comput."
-, volume =	6
-, year =	1999
-, pages =	"422--428"
-, url =	"http://www-sop.inria.fr/prisme/biblio/"
-, archive =	"XXX/cs.CG/9909017"
-, succeeds =	"dm-focm-98"
-, update =	"00.03 devillers"
+, author =      "Olivier Devillers and Asish Mukhopadhyay"
+, title =       "Finding an ordinary conic and an ordinary hyperplane"
+, journal =     "Nordic J. Comput."
+, volume =      6
+, year =        1999
+, pages =       "422--428"
+, url = "http://www-sop.inria.fr/prisme/biblio/"
+, archive =     "XXX/cs.CG/9909017"
+, succeeds =    "dm-focm-98"
+, update =      "00.03 devillers"
 }
 
 @techreport{dm-focm-98
-, author =	"Olivier Devillers and Asish Mukhopadhyay"
-, title =	"Finding an ordinary conic and more"
-, type =	"Research {Report}"
-, number =	3517
-, institution =	"INRIA"
-, year =	1998
-, url =	"http://www-sop.inria.fr/prisme/biblio/"
-, archive =	"XXX:cs.CG/9909017"
-, precedes =	"dm-focoh-99"
-, update =	"00.03 devillers, 99.11 devillers"
-, abstract =	"Given a finite set of non-collinear points in the plane there exists a line that passes through exactly two points. Such a line is called an {\em ordinary line}. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et al.  In this note we extend this result in two directions. We first show how to use this algorithm to compute an {\em ordinary conic}, that is, a conic passing through exactly five points, assuming that all the points do not lie onthe same conic. Our proof of existence and the consequent algorithm is simpler than previous ones. We also show how to compute an ordinary hyperplane in three and higher dimensions."
+, author =      "Olivier Devillers and Asish Mukhopadhyay"
+, title =       "Finding an ordinary conic and more"
+, type =        "Research {Report}"
+, number =      3517
+, institution = "INRIA"
+, year =        1998
+, url = "http://www-sop.inria.fr/prisme/biblio/"
+, archive =     "XXX:cs.CG/9909017"
+, precedes =    "dm-focoh-99"
+, update =      "00.03 devillers, 99.11 devillers"
+, abstract =    "Given a finite set of non-collinear points in the plane there exists a line that passes through exactly two points. Such a line is called an {\em ordinary line}. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et al.  In this note we extend this result in two directions. We first show how to use this algorithm to compute an {\em ordinary conic}, that is, a conic passing through exactly five points, assuming that all the points do not lie onthe same conic. Our proof of existence and the consequent algorithm is simpler than previous ones. We also show how to compute an ordinary hyperplane in three and higher dimensions."
 }
 
 @inproceedings{dpt-wt-01
-, author =	"Olivier Devillers and Sylvain Pion and Monique Teillaud"
-, title =	"Walking in a triangulation"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
-, year =	2001
-, pages =	"106--114"
-, update =	"01.07 devillers"
+, author =      "Olivier Devillers and Sylvain Pion and Monique Teillaud"
+, title =       "Walking in a triangulation"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Comput. Geom."
+, year =        2001
+, pages =       "106--114"
+, update =      "01.07 devillers"
 }
 
 @techreport{dp-papaf-96
-, author =	"Olivier Devillers and Franco P. Preparata"
-, title =	"A Probabilistic Analysis of the Power of Arithmetic Filters"
-, type =	"Technical Report"
-, number =	"CS-96-27"
-, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
-, year =	1996
-, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-27.ps.Z"
-, keywords =	"arithmetic filter, robustness, probabilistic analysis, geometric predicate, CGC, Brown"
-, precedes =	"dp-papaf-98"
-, update =	"99.11 devillers, 99.07 devillers, 97.07 devillers, 97.03 tamassia"
+, author =      "Olivier Devillers and Franco P. Preparata"
+, title =       "A Probabilistic Analysis of the Power of Arithmetic Filters"
+, type =        "Technical Report"
+, number =      "CS-96-27"
+, institution = "Center for Geometric Computing, Dept. Computer Science, Brown Univ."
+, year =        1996
+, url = "ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-27.ps.Z"
+, keywords =    "arithmetic filter, robustness, probabilistic analysis, geometric predicate, CGC, Brown"
+, precedes =    "dp-papaf-98"
+, update =      "99.11 devillers, 99.07 devillers, 97.07 devillers, 97.03 tamassia"
 }
 
 @article{dp-papaf-98
-, author =	"Olivier Devillers and Franco P. Preparata"
-, title =	"A probabilistic analysis of the power of arithmetic filters"
-, journal =	"Discrete Comput. Geom."
-, volume =	20
-, year =	1998
-, pages =	"523--547"
-, url =	"https://hal.inria.fr/inria-00090653"
-, archive =	"XXX:cs.CG/9907029"
-, succeeds =	"dp-papaf-96"
-, cites =	"b-g-87, bkmnsu-egcl-95, bms-hcvdl-94, fv-eeacg-93, lpt-rpqiv-96, mn-iga-94, y-tegc-97"
-, update =	"99.11 bibrelex+devillers, 99.07 devillers, 98.11 devillers+tamassia, 97.07 devillers"
-, abstract =	"The assumption of real-number arithmetic, which is at the
+, author =      "Olivier Devillers and Franco P. Preparata"
+, title =       "A probabilistic analysis of the power of arithmetic filters"
+, journal =     "Discrete Comput. Geom."
+, volume =      20
+, year =        1998
+, pages =       "523--547"
+, url = "https://inria.hal.science/inria-00090653"
+, archive =     "XXX:cs.CG/9907029"
+, succeeds =    "dp-papaf-96"
+, cites =       "b-g-87, bkmnsu-egcl-95, bms-hcvdl-94, fv-eeacg-93, lpt-rpqiv-96, mn-iga-94, y-tegc-97"
+, update =      "99.11 bibrelex+devillers, 99.07 devillers, 98.11 devillers+tamassia, 97.07 devillers"
+, abstract =    "The assumption of real-number arithmetic, which is at the
 basis of conventional geometric algorithms, has been seriously
 challenged in recent years, since digital computers do not exhibit such
 capability.  A geometric predicate  usually consists of evaluating the
@@ -44855,1563 +44855,1563 @@ @article{dp-papaf-98
 }
 
 @inproceedings{dp-ecncp-00
-, author =	"Olivier Devillers and Franco P. Preparata"
-, title =	"Evaluating the cylindricity of a nominally cylindrical point set"
-, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA"
-, year =	2000
-, pages =	"518--527"
-, update =	"00.03 devillers"
+, author =      "Olivier Devillers and Franco P. Preparata"
+, title =       "Evaluating the cylindricity of a nominally cylindrical point set"
+, booktitle =   "Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA"
+, year =        2000
+, pages =       "518--527"
+, update =      "00.03 devillers"
 }
 
 @inproceedings{dp-frafg-99i
-, author =	"Olivier Devillers and Franco P. Preparata"
-, title =	"Further Results on Arithmetic Filters for Geometric Predicates"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"113--116"
-, archive =	"XXX:cs.CG/9907028"
-, precedes =	"dp-frafg-99a"
-, update =	"00.03 bibrelex, 99.11 devillers, 99.07 bibrelex"
+, author =      "Olivier Devillers and Franco P. Preparata"
+, title =       "Further Results on Arithmetic Filters for Geometric Predicates"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "113--116"
+, archive =     "XXX:cs.CG/9907028"
+, precedes =    "dp-frafg-99a"
+, update =      "00.03 bibrelex, 99.11 devillers, 99.07 bibrelex"
 }
 
 @article{dp-frafg-99a
-, author =	"Olivier Devillers and Franco P. Preparata"
-, title =	"Further Results on Arithmetic Filters for Geometric Predicates"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, year =	1999
-, pages =	"141--148"
-, url =	"https://www.sciencedirect.com/science/article/pii/S0925772199000115"
-, archive =	"XXX:cs.CG/9907028"
-, succeeds =	"dp-frafg-99i"
-, cites =	"dp-papaf-98"
-, update =	"00.03 devillers, 99.11 devillers"
-, abstract =	"An efficient technique to solve precision problems consists in using exact computations.  For geometric predicates, using systematically expensive exact computations can be avoided by the use of filters.  The predicate is first evaluated using rounding computations, and an error estimation gives a certificate of the validity of the result.  In this note, we studies the statistical efficiency of filters for cosphericity predicate with an assumption of regular distribution of the points. We prove that the expected value of the polynomial corresponding to the in sphere test is greater than $\epsilon$ with probability $O(\epsilon \log \frac{1}{\epsilon})$ improving the results of a previous paper \cite{dp-papaf-98}."
+, author =      "Olivier Devillers and Franco P. Preparata"
+, title =       "Further Results on Arithmetic Filters for Geometric Predicates"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, year =        1999
+, pages =       "141--148"
+, url = "https://www.sciencedirect.com/science/article/pii/S0925772199000115"
+, archive =     "XXX:cs.CG/9907028"
+, succeeds =    "dp-frafg-99i"
+, cites =       "dp-papaf-98"
+, update =      "00.03 devillers, 99.11 devillers"
+, abstract =    "An efficient technique to solve precision problems consists in using exact computations.  For geometric predicates, using systematically expensive exact computations can be avoided by the use of filters.  The predicate is first evaluated using rounding computations, and an error estimation gives a certificate of the validity of the result.  In this note, we studies the statistical efficiency of filters for cosphericity predicate with an assumption of regular distribution of the points. We prove that the expected value of the polynomial corresponding to the in sphere test is greater than $\epsilon$ with probability $O(\epsilon \log \frac{1}{\epsilon})$ improving the results of a previous paper \cite{dp-papaf-98}."
 }
 
 @article{dty-dlals-92
-, author =	"Olivier Devillers and Monique Teillaud and Mariette Yvinec"
-, title =	"Dynamic location in an arrangement of line segments in the plane"
-, journal =	"Algorithms Rev."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"89--103"
-, keywords =	"randomized algorithms, arrangement of line-segments, dynamizing data structures"
-, update =	"99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
+, author =      "Olivier Devillers and Monique Teillaud and Mariette Yvinec"
+, title =       "Dynamic location in an arrangement of line segments in the plane"
+, journal =     "Algorithms Rev."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "89--103"
+, keywords =    "randomized algorithms, arrangement of line-segments, dynamizing data structures"
+, update =      "99.11 bibrelex, 99.07 devillers, 97.03 devillers, 96.01 devillers, 95.09 devillers, 95.01 devillers"
 }
 
 @article{dw-sddsm-89
-, author =	"M. P. Devine and D. Wood"
-, title =	"{SEPARATION} in $d$ dimensions, or strip mining in asteroid fields"
-, journal =	"Comput. Graph."
-, volume =	13
-, year =	1989
-, pages =	"329--336"
+, author =      "M. P. Devine and D. Wood"
+, title =       "{SEPARATION} in $d$ dimensions, or strip mining in asteroid fields"
+, journal =     "Comput. Graph."
+, volume =      13
+, year =        1989
+, pages =       "329--336"
 }
 
 @book{d-lnba-86
-, author =	"L. Devroye"
-, title =	"Lecture Notes on Bucket Algorithms"
-, publisher =	"Birkh{\"a}user Verlag"
-, address =	"Boston, MA"
-, year =	1986
-, keywords =	"book"
+, author =      "L. Devroye"
+, title =       "Lecture Notes on Bucket Algorithms"
+, publisher =   "Birkh{\"a}user Verlag"
+, address =     "Boston, MA"
+, year =        1986
+, keywords =    "book"
 }
 
 @article{d-essgc-88
-, author =	"L. Devroye"
-, title =	"On the expected size of some graphs in computational geometry"
-, journal =	"Comput. Math. Appl."
-, volume =	15
-, year =	1988
-, pages =	"53--64"
+, author =      "L. Devroye"
+, title =       "On the expected size of some graphs in computational geometry"
+, journal =     "Comput. Math. Appl."
+, volume =      15
+, year =        1988
+, pages =       "53--64"
 }
 
 @article{d-oenpr-91
-, author =	"L. Devroye"
-, title =	"On the oscillation of the expected number of points on a random convex hull"
-, journal =	"Statistics and Probability Letters"
-, volume =	11
-, year =	1991
-, pages =	"281--286"
+, author =      "L. Devroye"
+, title =       "On the oscillation of the expected number of points on a random convex hull"
+, journal =     "Statistics and Probability Letters"
+, volume =      11
+, year =        1991
+, pages =       "281--286"
 }
 
 @article{des-grih-93
-, author =	"Luc Devroye and P. Epstein and J.-R. Sack"
-, title =	"On Generating Random Intervals and Hyperrectangles"
-, journal =	"J. Computat. Graph. Statistics"
-, volume =	2
-, number =	3
-, year =	1993
-, pages =	"291--307"
-, update =	"96.01 held"
+, author =      "Luc Devroye and P. Epstein and J.-R. Sack"
+, title =       "On Generating Random Intervals and Hyperrectangles"
+, journal =     "J. Computat. Graph. Statistics"
+, volume =      2
+, number =      3
+, year =        1993
+, pages =       "291--307"
+, update =      "96.01 held"
 }
 
 @article{dl-arddq-90
-, author =	"L. Devroye and L. Laforest"
-, title =	"An analysis of random $d$-dimensional quadtrees"
-, journal =	"SIAM J. Comput."
-, volume =	19
-, year =	1990
-, pages =	"821--832"
+, author =      "L. Devroye and L. Laforest"
+, title =       "An analysis of random $d$-dimensional quadtrees"
+, journal =     "SIAM J. Comput."
+, volume =      19
+, year =        1990
+, pages =       "821--832"
 }
 
 @article{dmz-npldt-98
-, author =	"Luc Devroye and Ernst Peter M{\"u}cke and Binhai Zhu"
-, title =	"A Note on Point Location in {Delaunay} Triangulations of Random Points"
-, journal =	"Algorithmica"
-, volume =	22
-, year =	1998
-, pages =	"477--482"
-, comments =	"replaces the old, wrong entry dmz-npldt-95"
-, update =	"99.03 bibrelex, 97.11 bibrelex"
+, author =      "Luc Devroye and Ernst Peter M{\"u}cke and Binhai Zhu"
+, title =       "A Note on Point Location in {Delaunay} Triangulations of Random Points"
+, journal =     "Algorithmica"
+, volume =      22
+, year =        1998
+, pages =       "477--482"
+, comments =    "replaces the old, wrong entry dmz-npldt-95"
+, update =      "99.03 bibrelex, 97.11 bibrelex"
 }
 
 @incollection{dw-nnmd-82
-, author =	"L. Devroye and T. J. Wagner"
-, title =	"Nearest neighbor methods in discrimination"
-, editor =	"P. R. Krishnan and L. N. Kanal"
-, booktitle =	"Handbook of Statistics"
-, volume =	2
-, publisher =	"North-Holland"
-, year =	1982
-, update =	"97.07 agarwal"
+, author =      "L. Devroye and T. J. Wagner"
+, title =       "Nearest neighbor methods in discrimination"
+, editor =      "P. R. Krishnan and L. N. Kanal"
+, booktitle =   "Handbook of Statistics"
+, volume =      2
+, publisher =   "North-Holland"
+, year =        1982
+, update =      "97.07 agarwal"
 }
 
 @article{dz-irls-94
-, author =	"L. Devroye and B. Zhu"
-, title =	"Intersections of random line segments"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"261--274"
-, keywords =	"probabilistic analysis, computational geometry, intersections of line segments, asymptotic analysis, algorithmic complexity, incidence graph"
-, update =	"96.09 devillers"
+, author =      "L. Devroye and B. Zhu"
+, title =       "Intersections of random line segments"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "261--274"
+, keywords =    "probabilistic analysis, computational geometry, intersections of line segments, asymptotic analysis, algorithmic complexity, incidence graph"
+, update =      "96.09 devillers"
 }
 
 @article{d-nfchm-80
-, author =	"L. P. Devroye"
-, title =	"A note on finding convex hulls via maximal vectors"
-, journal =	"Inform. Process. Lett."
-, volume =	11
-, year =	1980
-, pages =	"53--56"
+, author =      "L. P. Devroye"
+, title =       "A note on finding convex hulls via maximal vectors"
+, journal =     "Inform. Process. Lett."
+, volume =      11
+, year =        1980
+, pages =       "53--56"
 }
 
 @article{d-netrc-85
-, author =	"L. P. Devroye"
-, title =	"A note on the expected time required to construct the outer layer"
-, journal =	"Inform. Process. Lett."
-, volume =	20
-, year =	1985
-, pages =	"255--257"
+, author =      "L. P. Devroye"
+, title =       "A note on the expected time required to construct the outer layer"
+, journal =     "Inform. Process. Lett."
+, volume =      20
+, year =        1985
+, pages =       "255--257"
 }
 
 @incollection{d-etaac-85
-, author =	"L. P. Devroye"
-, title =	"Expected time analysis of algorithms in computational geometry"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"135--151"
+, author =      "L. P. Devroye"
+, title =       "Expected time analysis of algorithms in computational geometry"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "135--151"
 }
 
 @article{d-hracc-81
-, author =	"L. P. Devroye"
-, title =	"How to reduce the average complexity of convex hull finding algorithms"
-, journal =	"Comput. Math. Appl."
-, volume =	7
-, year =	1981
-, pages =	"299--308"
+, author =      "L. P. Devroye"
+, title =       "How to reduce the average complexity of convex hull finding algorithms"
+, journal =     "Comput. Math. Appl."
+, volume =      7
+, year =        1981
+, pages =       "299--308"
 }
 
 @article{d-mirvc-83
-, author =	"L. P. Devroye"
-, title =	"Moment inequalities for random variables in computational geometry"
-, journal =	"Computing"
-, volume =	30
-, year =	1983
-, pages =	"111--119"
+, author =      "L. P. Devroye"
+, title =       "Moment inequalities for random variables in computational geometry"
+, journal =     "Computing"
+, volume =      30
+, year =        1983
+, pages =       "111--119"
 }
 
 @article{d-acsba-81
-, author =	"L. P. Devroye"
-, title =	"On the average complexity of some bucketing algorithms"
-, journal =	"Comput. Math. Appl."
-, volume =	7
-, year =	1981
-, pages =	"407--412"
+, author =      "L. P. Devroye"
+, title =       "On the average complexity of some bucketing algorithms"
+, journal =     "Comput. Math. Appl."
+, volume =      7
+, year =        1981
+, pages =       "407--412"
 }
 
 @article{d-cgrch-82
-, author =	"L. P. Devroye"
-, title =	"On the computer generation of random convex hulls"
-, journal =	"Comput. Math. Appl."
-, volume =	8
-, year =	1982
-, pages =	"1--13"
+, author =      "L. P. Devroye"
+, title =       "On the computer generation of random convex hulls"
+, journal =     "Comput. Math. Appl."
+, volume =      8
+, year =        1982
+, pages =       "1--13"
 }
 
 @inproceedings{d-rratb-81
-, author =	"L. P. Devroye"
-, title =	"Recent results on the average time behavior of some algorithms in computational geometry"
-, booktitle =	"Proc. 13th Sympos. Interface: Comput. Sci. Statist."
-, year =	1981
-, pages =	"76--82"
+, author =      "L. P. Devroye"
+, title =       "Recent results on the average time behavior of some algorithms in computational geometry"
+, booktitle =   "Proc. 13th Sympos. Interface: Comput. Sci. Statist."
+, year =        1981
+, pages =       "76--82"
 }
 
 @techreport{d-srats-81
-, author =	"L. P. Devroye"
-, title =	"Some results on the average time for sorting and searching in {$R^{2}$}"
-, type =	"Report"
-, number =	"??"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1981
+, author =      "L. P. Devroye"
+, title =       "Some results on the average time for sorting and searching in {$R^{2}$}"
+, type =        "Report"
+, number =      "??"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1981
 }
 
 @article{dt-nleta-81
-, author =	"L. P. Devroye and G. T. Toussaint"
-, title =	"A note on linear expected time algorithms for finding convex hulls"
-, journal =	"Computing"
-, volume =	26
-, year =	1981
-, pages =	"361--366"
-, succeeds =	"dt-eafch-78"
+, author =      "L. P. Devroye and G. T. Toussaint"
+, title =       "A note on linear expected time algorithms for finding convex hulls"
+, journal =     "Computing"
+, volume =      26
+, year =        1981
+, pages =       "361--366"
+, succeeds =    "dt-eafch-78"
 }
 
 @techreport{dt-eafch-78
-, author =	"L. P. Devroye and G. T. Toussaint"
-, title =	"Elimination algorithms for finding convex hulls in linear expected running time with radial densities"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1978
-, precedes =	"dt-nleta-81"
+, author =      "L. P. Devroye and G. T. Toussaint"
+, title =       "Elimination algorithms for finding convex hulls in linear expected running time with radial densities"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1978
+, precedes =    "dt-nleta-81"
 }
 
 @techreport{d-cnnst-77
-, author =	"A. K. Dewdney"
-, title =	"Complexity of nearest neighbour searching in three and higher dimensions"
-, type =	"Report"
-, number =	28
-, institution =	"Dept. Comput. Sci., Univ. Western Ontario"
-, address =	"London, ON"
-, year =	1977
+, author =      "A. K. Dewdney"
+, title =       "Complexity of nearest neighbour searching in three and higher dimensions"
+, type =        "Report"
+, number =      28
+, institution = "Dept. Comput. Sci., Univ. Western Ontario"
+, address =     "London, ON"
+, year =        1977
 }
 
 @article{d-ege3s-77
-, author =	"A. K. Dewdney"
-, title =	"Embedding graphs in {Euclidean} $3$-space"
-, journal =	"Amer. Math. Monthly"
-, volume =	84
-, year =	1977
-, pages =	"372--373"
+, author =      "A. K. Dewdney"
+, title =       "Embedding graphs in {Euclidean} $3$-space"
+, journal =     "Amer. Math. Monthly"
+, volume =      84
+, year =        1977
+, pages =       "372--373"
 }
 
 @article{d-egtds-80
-, author =	"A. K. Dewdney"
-, title =	"Embedding graphs in three-dimensional space"
-, journal =	"Ars Combin."
-, volume =	9
-, year =	1980
-, pages =	"77--90"
-, update =	"95.09 korneenko"
+, author =      "A. K. Dewdney"
+, title =       "Embedding graphs in three-dimensional space"
+, journal =     "Ars Combin."
+, volume =      9
+, year =        1980
+, pages =       "77--90"
+, update =      "95.09 korneenko"
 }
 
 @article{d-edg-80
-, author =	"A. K. Dewdney"
-, title =	"The embedding dimension of a graph"
-, journal =	"Ars Combin."
-, volume =	9
-, year =	1980
-, pages =	"77--90"
+, author =      "A. K. Dewdney"
+, title =       "The embedding dimension of a graph"
+, journal =     "Ars Combin."
+, volume =      9
+, year =        1980
+, pages =       "77--90"
 }
 
 @article{dv-cprac-77
-, author =	"A. K. Dewdney and J. K. Vranch"
-, title =	"A convex partition of {$R^{3}$} with applications to {Crum}'s problem and {Knuth}'s post-office problem"
-, journal =	"Utilitas Math."
-, volume =	12
-, year =	1977
-, pages =	"193--199"
-, keywords =	"Voronoi diagram, proximity, searching"
-, update =	"97.11 bibrelex"
+, author =      "A. K. Dewdney and J. K. Vranch"
+, title =       "A convex partition of {$R^{3}$} with applications to {Crum}'s problem and {Knuth}'s post-office problem"
+, journal =     "Utilitas Math."
+, volume =      12
+, year =        1977
+, pages =       "193--199"
+, keywords =    "Voronoi diagram, proximity, searching"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{dvw-chtma-95
-, author =	"Don Dewhirst and Sreedhar Vangavolu and Harley Wattrick"
-, title =	"The Combination of Hexahedral and Tetrahedral Meshing Algorithms"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"291--304"
-, update =	"96.01 samitchell"
+, author =      "Don Dewhirst and Sreedhar Vangavolu and Harley Wattrick"
+, title =       "The Combination of Hexahedral and Tetrahedral Meshing Algorithms"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "291--304"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{dbs-gttd-91
-, author =	"T. Dey and C. Bajaj and K. Sugihara"
-, title =	"On Good Triangulations in Three Dimensions"
-, booktitle =	"Proc. Symposium on Solid Modeling and CAD/CAM Applications"
-, organization =	"ACM/SIGGRAPH"
-, month =	jun
-, year =	1991
-, note =	"To appear"
-, update =	"97.11 bibrelex"
+, author =      "T. Dey and C. Bajaj and K. Sugihara"
+, title =       "On Good Triangulations in Three Dimensions"
+, booktitle =   "Proc. Symposium on Solid Modeling and CAD/CAM Applications"
+, organization =        "ACM/SIGGRAPH"
+, month =       jun
+, year =        1991
+, note =        "To appear"
+, update =      "97.11 bibrelex"
 }
 
 @article{degn-tpec-98
-, author =	"Tamal Dey and Herbert Edelsbrunner and Sumanta Guha and Dmitry Nekhayev"
-, title =	"Topology preserving edge contraction. Geometric combinatorics"
-, journal =	"Publ. Inst. Math. (Beograd) (N.S.)"
-, volume =	66
-, year =	1999
-, pages =	"23--45"
-, update =	"01.07 wenger"
+, author =      "Tamal Dey and Herbert Edelsbrunner and Sumanta Guha and Dmitry Nekhayev"
+, title =       "Topology preserving edge contraction. Geometric combinatorics"
+, journal =     "Publ. Inst. Math. (Beograd) (N.S.)"
+, volume =      66
+, year =        1999
+, pages =       "23--45"
+, update =      "01.07 wenger"
 }
 
 @techreport{dp-epgh-94
-, author =	"T. Dey and J. Pach"
-, title =	"Extremal problems for geometric hypergraphs"
-, type =	"Manuscipt"
-, institution =	"??"
-, year =	1994
-, note =	"In preparation"
-, update =	"98.03 bibrelex"
+, author =      "T. Dey and J. Pach"
+, title =       "Extremal problems for geometric hypergraphs"
+, type =        "Manuscipt"
+, institution = "??"
+, year =        1994
+, note =        "In preparation"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{d-ntcpd-93
-, author =	"T. K. Dey"
-, title =	"A new technique to compute polygonal schema for 2-manifolds and null-homotopy detection"
-, type =	"manuscript"
-, year =	1993
-, precedes =	"ds-ntcps-94, d-ntcps-94"
-, update =	"98.11 bibrelex"
+, author =      "T. K. Dey"
+, title =       "A new technique to compute polygonal schema for 2-manifolds and null-homotopy detection"
+, type =        "manuscript"
+, year =        1993
+, precedes =    "ds-ntcps-94, d-ntcps-94"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{d-ntcps-94
-, author =	"T. K. Dey"
-, title =	"A New Technique to Compute Polygonal Schema for $2$-Manifolds with Application to Null-Homotopy Detection"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"277--284"
-, succeeds =	"d-ntcpd-93"
-, cites =	"ds-ntcps-94, de-iabns-93, g-gsh-77, hs-aacsl-91, my-chthu-88, s-dcc-92, s-tacg-90, s-ctcgt-80, v-kfdp-89, vy-cccs-90, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "T. K. Dey"
+, title =       "A New Technique to Compute Polygonal Schema for $2$-Manifolds with Application to Null-Homotopy Detection"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "277--284"
+, succeeds =    "d-ntcpd-93"
+, cites =       "ds-ntcps-94, de-iabns-93, g-gsh-77, hs-aacsl-91, my-chthu-88, s-dcc-92, s-tacg-90, s-ctcgt-80, v-kfdp-89, vy-cccs-90, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @phdthesis{d-dptd-91
-, author =	"T. K. Dey"
-, title =	"Decompositions of polyhedra in three dimensions"
-, school =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1991
-, note =	"Technical Report CSD-TR-91-056"
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "T. K. Dey"
+, title =       "Decompositions of polyhedra in three dimensions"
+, school =      "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1991
+, note =        "Technical Report CSD-TR-91-056"
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{d-gtp-90
-, author =	"T. K. Dey"
-, title =	"Good triangulations in the plane"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"102--106"
-, cites =	"ba-acfem-76, bgr-ntp-88, c-gqtm-89, e-stdac-89, f-cfemg-72, ll-gdtpg-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "T. K. Dey"
+, title =       "Good triangulations in the plane"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "102--106"
+, cites =       "ba-acfem-76, bgr-ntp-88, c-gqtm-89, e-stdac-89, f-cfemg-72, ll-gdtpg-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{d-ibkkl-97
-, author =	"T. K. Dey"
-, title =	"Improved Bounds for {$k$-Sets} and {$k$-th} levels"
-, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '97"
-, year =	1997
-, pages =	"156--161"
-, update =	"98.07 agarwal+bibrelex, 98.03 agarwal+mitchell"
+, author =      "T. K. Dey"
+, title =       "Improved Bounds for {$k$-Sets} and {$k$-th} levels"
+, booktitle =   "Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '97"
+, year =        1997
+, pages =       "156--161"
+, update =      "98.07 agarwal+bibrelex, 98.03 agarwal+mitchell"
 }
 
 @article{d-ibpks-98
-, author =	"T. K. Dey"
-, title =	"Improved bounds on planar $k$-sets and related problems"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"373--382"
-, update =	"98.07 agarwal"
+, author =      "T. K. Dey"
+, title =       "Improved bounds on planar $k$-sets and related problems"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "373--382"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{d-ctdd-92
-, author =	"T. K. Dey"
-, title =	"On counting triangulations in $d$ dimensions"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"280--285"
-, precedes =	"d-ctdd-93"
-, cites =	"acns-cfs-82, de-cschh-92, gp-ubcpr-86, k-mts-88, s-ubccr-75, ZZZ"
-, update =	"98.07 agarwal+bibrelex, 96.09 devillers"
+, author =      "T. K. Dey"
+, title =       "On counting triangulations in $d$ dimensions"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "280--285"
+, precedes =    "d-ctdd-93"
+, cites =       "acns-cfs-82, de-cschh-92, gp-ubcpr-86, k-mts-88, s-ubccr-75, ZZZ"
+, update =      "98.07 agarwal+bibrelex, 96.09 devillers"
 }
 
 @article{d-ctdd-93
-, author =	"T. K. Dey"
-, title =	"On counting triangulations in $d$ dimensions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"315--325"
-, succeeds =	"d-ctdd-92"
-, update =	"98.07 agarwal, 96.09 devillers"
+, author =      "T. K. Dey"
+, title =       "On counting triangulations in $d$ dimensions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "315--325"
+, succeeds =    "d-ctdd-92"
+, update =      "98.07 agarwal, 96.09 devillers"
 }
 
 @inproceedings{d-oadnh-93
-, author =	"T. K. Dey"
-, title =	"Optimal algorithms to detect null-homologous cycles on $2$-manifolds"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"273--278"
-, precedes =	"d-oadnh-97"
-, cites =	"d-ntcpd-93, de-iabns-93, m-ati-77, m-eat-84, s-dcc-92, s-tacg-90, vy-cccs-90, ZZZ"
-, update =	"98.11 bibrelex, 98.07 agarwal, 97.07 devillers, 93.09 milone+mitchell"
+, author =      "T. K. Dey"
+, title =       "Optimal algorithms to detect null-homologous cycles on $2$-manifolds"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "273--278"
+, precedes =    "d-oadnh-97"
+, cites =       "d-ntcpd-93, de-iabns-93, m-ati-77, m-eat-84, s-dcc-92, s-tacg-90, vy-cccs-90, ZZZ"
+, update =      "98.11 bibrelex, 98.07 agarwal, 97.07 devillers, 93.09 milone+mitchell"
 }
 
 @article{d-oadnh-97
-, author =	"T. K. Dey"
-, title =	"Optimal algorithms to detect null-homologous cycles on $2$-manifolds"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"167--174"
-, succeeds =	"d-oadnh-93"
-, update =	"98.07 agarwal, 97.07 devillers"
+, author =      "T. K. Dey"
+, title =       "Optimal algorithms to detect null-homologous cycles on $2$-manifolds"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "167--174"
+, succeeds =    "d-oadnh-93"
+, update =      "98.07 agarwal, 97.07 devillers"
 }
 
 @inproceedings{d-tcrpa-91
-, author =	"T. K. Dey"
-, title =	"Triangulation and {CSG} representation of polyhedra with arbitrary genus"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"364--372"
-, keywords =	"polyhedron"
-, cites =	"bd-pnr-90, bd-cdpr-90, c-cpplb-84, cp-tncp-90, dbs-gttd-91, dghs-eafcr-88, egs-ccmfa-90, e-acg-87, egppss-acptc-88, k-rmrs-89, py-ebsph-90, p-hresr-84, rs-dt3dn-89, ZZZ"
-, update =	"98.07 agarwal+bibrelex, 97.11 bibrelex"
+, author =      "T. K. Dey"
+, title =       "Triangulation and {CSG} representation of polyhedra with arbitrary genus"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "364--372"
+, keywords =    "polyhedron"
+, cites =       "bd-pnr-90, bd-cdpr-90, c-cpplb-84, cp-tncp-90, dbs-gttd-91, dghs-eafcr-88, egs-ccmfa-90, e-acg-87, egppss-acptc-88, k-rmrs-89, py-ebsph-90, p-hresr-84, rs-dt3dn-89, ZZZ"
+, update =      "98.07 agarwal+bibrelex, 97.11 bibrelex"
 }
 
 @article{dbs-gttd-92
-, author =	"T. K. Dey and C. L. Bajaj and K. Sugihara"
-, title =	"On good triangulations in three dimensions"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	1
-, year =	1992
-, pages =	"75--95"
-, keywords =	"Delaunay triangulation, mesh generation"
+, author =      "T. K. Dey and C. L. Bajaj and K. Sugihara"
+, title =       "On good triangulations in three dimensions"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      1
+, year =        1992
+, pages =       "75--95"
+, keywords =    "Delaunay triangulation, mesh generation"
 }
 
 @inproceedings{ddg-thc-94
-, author =	"T. K. Dey and M. B. Dillencourt and S. K. Ghosh"
-, title =	"Triangulating with High Connectivity"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"339--343"
-, precedes =	"ddgc-thc-97"
-, cites =	"c-clps-85, dett-adgab-93t, d-hcptn-90, l-cpt-90, ys-fpgdc-93, ZZZ"
-, update =	"98.11 bibrelex, 97.07 devillers, 94.09 jones"
+, author =      "T. K. Dey and M. B. Dillencourt and S. K. Ghosh"
+, title =       "Triangulating with High Connectivity"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "339--343"
+, precedes =    "ddgc-thc-97"
+, cites =       "c-clps-85, dett-adgab-93t, d-hcptn-90, l-cpt-90, ys-fpgdc-93, ZZZ"
+, update =      "98.11 bibrelex, 97.07 devillers, 94.09 jones"
 }
 
 @article{ddgc-thc-97
-, author =	"T. K. Dey and M. B. Dillencourt and S. K. Ghosh and J. Cahill"
-, title =	"Triangulating with High Connectivity"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"39--56"
-, succeeds =	"ddg-thc-94"
-, update =	"97.07 devillers"
+, author =      "T. K. Dey and M. B. Dillencourt and S. K. Ghosh and J. Cahill"
+, title =       "Triangulating with High Connectivity"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "39--56"
+, succeeds =    "ddg-thc-94"
+, update =      "97.07 devillers"
 }
 
 @techreport{de-cschh-92
-, author =	"T. K. Dey and H. Edelsbrunner"
-, title =	"Counting simplex crossings and halving hyerplanes"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "T. K. Dey and H. Edelsbrunner"
+, title =       "Counting simplex crossings and halving hyerplanes"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{de-ctchp-93
-, author =	"T. K. Dey and H. Edelsbrunner"
-, title =	"Counting triangle crossings and halving planes"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"270--273"
-, cites =	"acns-cfs-82, abfk-pswen-91, acegsw-ptphp-91, bfl-nhp-89, e-acg-87, e-ibith-91, elss-dgpps-73, r-mkkde-21, vz-ctpci-92, ZZZ"
-, update =	"98.03 bibrelex, 95.01 smid, 93.09 jones"
+, author =      "T. K. Dey and H. Edelsbrunner"
+, title =       "Counting triangle crossings and halving planes"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "270--273"
+, cites =       "acns-cfs-82, abfk-pswen-91, acegsw-ptphp-91, bfl-nhp-89, e-acg-87, e-ibith-91, elss-dgpps-73, r-mkkde-21, vz-ctpci-92, ZZZ"
+, update =      "98.03 bibrelex, 95.01 smid, 93.09 jones"
 }
 
 @article{de-ctchp-94
-, author =	"T. K. Dey and H. Edelsbrunner"
-, title =	"Counting triangle crossings and halving planes"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"281--289"
-, update =	"95.01 smid"
+, author =      "T. K. Dey and H. Edelsbrunner"
+, title =       "Counting triangle crossings and halving planes"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "281--289"
+, update =      "95.01 smid"
 }
 
 @inproceedings{deg-ct-99
-, author =	"Tamal K. Dey and Herbert Edelsbrunner and Sumanta Guha"
-, title =	"Computational topology"
-, editor =	"Bernard Chazelle and Jacob E. Goodman and Richard Pollack"
-, booktitle =	"Advances in Discrete and Computational Geometry - Proc. 1996 AMS-IMS-SIAM Joint Summer Research Conf. Discrete and Computational Geometry: Ten Years Later"
-, series =	"Contemporary Mathematics"
-, number =	223
-, publisher =	"American Mathematical Society"
-, year =	1999
-, pages =	"109--143"
-, update =	"01.07 devillers"
+, author =      "Tamal K. Dey and Herbert Edelsbrunner and Sumanta Guha"
+, title =       "Computational topology"
+, editor =      "Bernard Chazelle and Jacob E. Goodman and Richard Pollack"
+, booktitle =   "Advances in Discrete and Computational Geometry - Proc. 1996 AMS-IMS-SIAM Joint Summer Research Conf. Discrete and Computational Geometry: Ten Years Later"
+, series =      "Contemporary Mathematics"
+, number =      223
+, publisher =   "American Mathematical Society"
+, year =        1999
+, pages =       "109--143"
+, update =      "01.07 devillers"
 }
 
 @inproceedings{dfr-sralt-01
-, author =	"Tamal K. Dey and Stefan Funke and Edgar A. Ramos"
-, title =	"Surface Reconstruction in Almost Linear Time under Locally Uniform Sampling"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"129--132"
-, update =	"01.04 icking"
+, author =      "Tamal K. Dey and Stefan Funke and Edgar A. Ramos"
+, title =       "Surface Reconstruction in Almost Linear Time under Locally Uniform Sampling"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "129--132"
+, update =      "01.04 icking"
 }
 
 @inproceedings{dg-amsce-96
-, author =	"Tamal K. Dey and Sumanta Guha"
-, title =	"Algorithms for Manifolds and Simplicial Complexes in {Euclidean} 3-Space"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '96"
-, site =	"Philadelphia, PA"
-, month =	may
-, year =	1996
-, pages =	"398--407"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Tamal K. Dey and Sumanta Guha"
+, title =       "Algorithms for Manifolds and Simplicial Complexes in {Euclidean} 3-Space"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '96"
+, site =        "Philadelphia, PA"
+, month =       may
+, year =        1996
+, pages =       "398--407"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{dg-oacs-95
-, author =	"Tamal K. Dey and Sumanta Guha"
-, title =	"Optimal algorithms for curves on surfaces"
-, booktitle =	"Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '95"
-, site =	"Milwaukee, Wisconsin"
-, year =	1995
-, pages =	"266--274"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 95.09 mitchell"
-, annote =	"To appear in JCSS, with new title: Transforming Curves on Surfaces"
+, author =      "Tamal K. Dey and Sumanta Guha"
+, title =       "Optimal algorithms for curves on surfaces"
+, booktitle =   "Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '95"
+, site =        "Milwaukee, Wisconsin"
+, year =        1995
+, pages =       "266--274"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 95.09 mitchell"
+, annote =      "To appear in JCSS, with new title: Transforming Curves on Surfaces"
 }
 
 @inproceedings{dk-spacr-99
-, author =	"T. K. Dey and P. Kumar"
-, title =	"A simple provable algorithm for curve reconstruction"
-, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '99"
-, month =	jan
-, year =	1999
-, pages =	"893--894"
-, update =	"00.03 orourke"
+, author =      "T. K. Dey and P. Kumar"
+, title =       "A simple provable algorithm for curve reconstruction"
+, booktitle =   "Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '99"
+, month =       jan
+, year =        1999
+, pages =       "893--894"
+, update =      "00.03 orourke"
 }
 
 @unpublished{dl-srs-99
-, author =	"T. K. Dey and N. Leekha"
-, title =	"Surface reconstruction simplified"
-, month =	dec
-, year =	1999
-, note =	"Manuscript"
-, update =	"00.03 orourke"
+, author =      "T. K. Dey and N. Leekha"
+, title =       "Surface reconstruction simplified"
+, month =       dec
+, year =        1999
+, note =        "Manuscript"
+, update =      "00.03 orourke"
 }
 
 @inproceedings{dmr-crcdgr-99
-, author =	"T. K. Dey and K. Mehlhorn and E. A. Ramos"
-, title =	"Curve reconstruction: {C}onnecting dots with good reason"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"197--206"
-, update =	"00.03 orourke"
+, author =      "T. K. Dey and K. Mehlhorn and E. A. Ramos"
+, title =       "Curve reconstruction: {C}onnecting dots with good reason"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "197--206"
+, update =      "00.03 orourke"
 }
 
 @article{dmr-crcdg-00
-, author =	"T. K. Dey and K. Mehlhorn and E. A. Ramos"
-, title =	"Curve reconstruction: {Connecting} dots with good reason"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	15
-, year =	2000
-, pages =	"229--244"
-, succeeds =	"ekns-ddsfo-97"
-, update =	"00.03 smid"
+, author =      "T. K. Dey and K. Mehlhorn and E. A. Ramos"
+, title =       "Curve reconstruction: {Connecting} dots with good reason"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      15
+, year =        2000
+, pages =       "229--244"
+, succeeds =    "ekns-ddsfo-97"
+, update =      "00.03 smid"
 }
 
 @unpublished{dpp-agpvr-95
-, author =	"T. K. Dey and S. P. Pal and D. C. Prasad"
-, title =	"Art gallery problems for visibility with reflection"
-, year =	1995
-, note =	"In preparation"
-, update =	"98.03 bibrelex"
+, author =      "T. K. Dey and S. P. Pal and D. C. Prasad"
+, title =       "Art gallery problems for visibility with reflection"
+, year =        1995
+, note =        "In preparation"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ds-ntcps-94
-, author =	"T. K. Dey and H. Schipper"
-, title =	"A new technique to compute polygonal schema for $2$-manifolds with application to null-homotopy detection"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1994
-, succeeds =	"d-ntcpd-93"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "T. K. Dey and H. Schipper"
+, title =       "A new technique to compute polygonal schema for $2$-manifolds with application to null-homotopy detection"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1994
+, succeeds =    "d-ntcpd-93"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{ds-nscr-95
-, author =	"Tamal K. Dey and Nimish R. Shah"
-, title =	"On the Number of Simplicial Complexes in {$\Re^d$}"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"31--36"
-, update =	"95.09 jones"
+, author =      "Tamal K. Dey and Nimish R. Shah"
+, title =       "On the Number of Simplicial Complexes in {$\Re^d$}"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "31--36"
+, update =      "95.09 jones"
 }
 
 @article{dsb-dttdf-92
-, author =	"T. K. Dey and K. Sugihara and C. L. Bajaj"
-, title =	"Delaunay triangulations in three dimensions with finite precision arithmetic"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	9
-, year =	1992
-, pages =	"457--470"
-, keywords =	"Delaunay triangulation, robustness"
-, update =	"93.09 dey"
+, author =      "T. K. Dey and K. Sugihara and C. L. Bajaj"
+, title =       "Delaunay triangulations in three dimensions with finite precision arithmetic"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      9
+, year =        1992
+, pages =       "457--470"
+, keywords =    "Delaunay triangulation, robustness"
+, update =      "93.09 dey"
 }
 
 @inproceedings{dw-rcsc-00
-, author =	"Tamal K. Dey and Rephael Wenger"
-, title =	"Reconstructing Curves with Sharp Corners"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"233--241"
-, update =	"00.11 jones"
+, author =      "Tamal K. Dey and Rephael Wenger"
+, title =       "Reconstructing Curves with Sharp Corners"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "233--241"
+, update =      "00.11 jones"
 }
 
 @article{dw-rcsc-01
-, author =	"T. K. Dey and R. Wenger"
-, title =	"Reconstructing Curves with Sharp Corners"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"89--99"
-, update =	"01.11 smid"
+, author =      "T. K. Dey and R. Wenger"
+, title =       "Reconstructing Curves with Sharp Corners"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "89--99"
+, update =      "01.11 smid"
 }
 
 @article{df-sd-86
-, author =	"M. Deza and P. Frankl"
-, title =	"On squashed designs"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"379--390"
+, author =      "M. Deza and P. Frankl"
+, title =       "On squashed designs"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "379--390"
 }
 
 @inproceedings{do-mpams-92
-, author =	"A. Dhagat and J. O'Rourke"
-, title =	"Motion planning amidst movable square blocks"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"188--191"
-, keywords =	"motion planning"
-, cites =	"w-mppmo-91, ZZZ"
-, update =	"00.03 orourke, 98.07 bibrelex"
-, abstract =	"Proves that planning motion for a robot who can
-		push square blocks, when some blocks are moveable and
-		others immobile, is NP-hard.  The paper erroneously claims
-		to establish NP-completeness but never establishes
-		membership in NP.  Subsequently the result was
-		strengthened in bos-mpams-94 to PSPACE hard."
+, author =      "A. Dhagat and J. O'Rourke"
+, title =       "Motion planning amidst movable square blocks"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "188--191"
+, keywords =    "motion planning"
+, cites =       "w-mppmo-91, ZZZ"
+, update =      "00.03 orourke, 98.07 bibrelex"
+, abstract =    "Proves that planning motion for a robot who can
+                push square blocks, when some blocks are moveable and
+                others immobile, is NP-hard.  The paper erroneously claims
+                to establish NP-completeness but never establishes
+                membership in NP.  Subsequently the result was
+                strengthened in bos-mpams-94 to PSPACE hard."
 }
 
 @article{dj-cccsp-73
-, author =	"S. W. Dharmadhikari and K. Jogdeo"
-, title =	"A characterization of convexity and central symmetry for planar polygonal sets"
-, journal =	"Israel J. Math."
-, volume =	15
-, year =	1973
-, pages =	"356--366"
-, update =	"97.11 bibrelex"
+, author =      "S. W. Dharmadhikari and K. Jogdeo"
+, title =       "A characterization of convexity and central symmetry for planar polygonal sets"
+, journal =     "Israel J. Math."
+, volume =      15
+, year =        1973
+, pages =       "356--366"
+, update =      "97.11 bibrelex"
 }
 
 @proceedings{d-gd-97
-, title =	"Graph Drawing (Proc. GD '97)"
-, editor =	"G. {Di Battista}"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, keywords =	"graph drawing, collection"
-, update =	"99.07 vismara, 98.11 bibrelex, 98.07 patrignani+tamassia+vismara"
+, title =       "Graph Drawing (Proc. GD '97)"
+, editor =      "G. {Di Battista}"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, keywords =    "graph drawing, collection"
+, update =      "99.07 vismara, 98.11 bibrelex, 98.07 patrignani+tamassia+vismara"
 }
 
 @proceedings{defrt-gd93p-93
-, title =	"Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
-, editor =	"G. {Di Battista} and P. Eades and H. de Fraysseix and P. Rosenstiehl and R. Tamassia"
-, year =	1993
-, url =	"ftp://ftp.cs.brown.edu/pub/gd94/gd-92-93/gd93-v2.ps.Z"
-, keywords =	"graph drawing, collection"
-, update =	"98.11 bibrelex, 98.07 vismara, 95.09 tamassia, 94.05 schwarzkopf, 94.01 tamassia, 95 tamassia"
+, title =       "Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
+, editor =      "G. {Di Battista} and P. Eades and H. de Fraysseix and P. Rosenstiehl and R. Tamassia"
+, year =        1993
+, url = "ftp://ftp.cs.brown.edu/pub/gd94/gd-92-93/gd93-v2.ps.Z"
+, keywords =    "graph drawing, collection"
+, update =      "98.11 bibrelex, 98.07 vismara, 95.09 tamassia, 94.05 schwarzkopf, 94.01 tamassia, 95 tamassia"
 }
 
 @techreport{dett-adgab-93
-, author =	"G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
-, title =	"Algorithms for drawing graphs: an annotated bibliography"
-, type =	"Preprint"
-, number =	""
-, institution =	"Dept. Comput. Sci., Brown Univ."
-, address =	"Providence, RI"
-, month =	nov
-, year =	1993
-, note =	"Preliminary version available via anonymous {\tt ftp} from
-		{\tt wilma.cs.brown.edu}, {\tt gdbiblio.tex.Z} and
-		{\tt gdbiblio.ps.Z} in {\tt /pub/papers/compgeo}."
-, keywords =	"graph drawing, graph theory, computer graphics, bibliography"
-, succeeds =	"et-adgab-89, dett-adgab-93t"
-, precedes =	"dett-adgab-94"
-, update =	"98.11 bibrelex, 95.01 smid, 94.01 tamassia"
+, author =      "G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
+, title =       "Algorithms for drawing graphs: an annotated bibliography"
+, type =        "Preprint"
+, number =      ""
+, institution = "Dept. Comput. Sci., Brown Univ."
+, address =     "Providence, RI"
+, month =       nov
+, year =        1993
+, note =        "Preliminary version available via anonymous {\tt ftp} from
+                {\tt wilma.cs.brown.edu}, {\tt gdbiblio.tex.Z} and
+                {\tt gdbiblio.ps.Z} in {\tt /pub/papers/compgeo}."
+, keywords =    "graph drawing, graph theory, computer graphics, bibliography"
+, succeeds =    "et-adgab-89, dett-adgab-93t"
+, precedes =    "dett-adgab-94"
+, update =      "98.11 bibrelex, 95.01 smid, 94.01 tamassia"
 }
 
 @techreport{dett-adgab-93t
-, author =	"G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
-, title =	"Algorithms for drawing graphs: an annotated bibliography"
-, type =	"manuscript"
-, month =	jun
-, year =	1993
-, precedes =	"dett-adgab-93, dett-adgab-94"
-, update =	"98.11 bibrelex"
+, author =      "G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
+, title =       "Algorithms for drawing graphs: an annotated bibliography"
+, type =        "manuscript"
+, month =       jun
+, year =        1993
+, precedes =    "dett-adgab-93, dett-adgab-94"
+, update =      "98.11 bibrelex"
 }
 
-%, number =	5
+%, number =     5
 @article{dett-adgab-94
-, author =	"G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
-, title =	"Algorithms for drawing graphs: an annotated bibliography"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"235--282"
-, keywords =	"graph drawing, graph theory, computer graphics, bibliography"
-, succeeds =	"dett-adgab-93, dett-adgab-93t"
-, update =	"98.11 bibrelex, 95.01 smid+tamassia"
+, author =      "G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
+, title =       "Algorithms for drawing graphs: an annotated bibliography"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "235--282"
+, keywords =    "graph drawing, graph theory, computer graphics, bibliography"
+, succeeds =    "dett-adgab-93, dett-adgab-93t"
+, update =      "98.11 bibrelex, 95.01 smid+tamassia"
 }
 
 @book{dett-gd-99
-, author =	"G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
-, title =	"Graph Drawing"
-, publisher =	"Prentice Hall"
-, address =	"Upper Saddle River, NJ"
-, year =	1999
-, keywords =	"graph drawing"
-, update =	"98.11 vismara, 98.07 tamassia"
+, author =      "G. {Di Battista} and P. Eades and R. Tamassia and I. G. Tollis"
+, title =       "Graph Drawing"
+, publisher =   "Prentice Hall"
+, address =     "Upper Saddle River, NJ"
+, year =        1999
+, keywords =    "graph drawing"
+, update =      "98.11 vismara, 98.07 tamassia"
 }
 
 @techreport{dglpttvv-ddage-96
-, author =	"G. {Di Battista} and A. Garg and G. Liotta and A. Parise and R. Tamassia and E. Tassinari and F. Vargiu and L. Vismara"
-, title =	"Drawing Directed Acyclic Graphs: An Experimental Study"
-, type =	"Technical Report"
-, number =	"CS-96-24"
-, institution =	"Center for Geometric Computing, Dept. Comput. Sci., Brown Univ."
-, month =	oct
-, year =	1996
-, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-24.ps.Z"
-, keywords =	"graph drawing, upward, experiments, CGC, Brown"
-, update =	"98.07 vismara, 97.11 bibrelex, 97.03 tamassia"
+, author =      "G. {Di Battista} and A. Garg and G. Liotta and A. Parise and R. Tamassia and E. Tassinari and F. Vargiu and L. Vismara"
+, title =       "Drawing Directed Acyclic Graphs: An Experimental Study"
+, type =        "Technical Report"
+, number =      "CS-96-24"
+, institution = "Center for Geometric Computing, Dept. Comput. Sci., Brown Univ."
+, month =       oct
+, year =        1996
+, url = "ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-24.ps.Z"
+, keywords =    "graph drawing, upward, experiments, CGC, Brown"
+, update =      "98.07 vismara, 97.11 bibrelex, 97.03 tamassia"
 }
 
 @inproceedings{dglpttvv-ddage-97
-, author =	"G. {Di Battista} and A. Garg and G. Liotta and A. Parise and R. Tamassia and E. Tassinari and F. Vargiu and L. Vismara"
-, title =	"Drawing Directed Acyclic Graphs: An Experimental Study"
-, editor =	"S. North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"76--91"
-, url =	"https://www.cs.brown.edu/cgc/papers/dglpttvv-ddges-97.ps.gz"
-, keywords =	"graph drawing, upward, experiments, CGC, Brown"
-, update =	"98.07 patrignani+tamassia+vismara, 97.11 bibrelex, 97.03 tamassia"
+, author =      "G. {Di Battista} and A. Garg and G. Liotta and A. Parise and R. Tamassia and E. Tassinari and F. Vargiu and L. Vismara"
+, title =       "Drawing Directed Acyclic Graphs: An Experimental Study"
+, editor =      "S. North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "76--91"
+, url = "https://www.cs.brown.edu/cgc/papers/dglpttvv-ddges-97.ps.gz"
+, keywords =    "graph drawing, upward, experiments, CGC, Brown"
+, update =      "98.07 patrignani+tamassia+vismara, 97.11 bibrelex, 97.03 tamassia"
 }
 
 @article{dglpttvv-ddage-00
-, author =	"Giuseppe {Di Battista} and Ashim Garg and Giuseppe Liotta and Armando Parise and Roberto Tamassia and Emanuele Tassinari and Francesco Vargiu and Luca Vismara"
-, title =	"Drawing Directed Acyclic Graphs: An Experimental Study"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, number =	6
-, year =	2000
-, pages =	"623--648"
-, succeeds =	"dglpttvv-ddage-96, dglpttvv-ddage-97"
-, update =	"01.04 vismara"
+, author =      "Giuseppe {Di Battista} and Ashim Garg and Giuseppe Liotta and Armando Parise and Roberto Tamassia and Emanuele Tassinari and Francesco Vargiu and Luca Vismara"
+, title =       "Drawing Directed Acyclic Graphs: An Experimental Study"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, number =      6
+, year =        2000
+, pages =       "623--648"
+, succeeds =    "dglpttvv-ddage-96, dglpttvv-ddage-97"
+, update =      "01.04 vismara"
 }
 
 @unpublished{dglttv-ecfgd-96
-, author =	"G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu"
-, title =	"An Experimental Comparison of Four Graph Drawing Algorithms"
-, type =	"Manuscript"
-, institution =	"Dept. of Computer Sci., Brown University"
-, year =	1996
-, url =	"https://www.cs.brown.edu/cgc/papers/dglttv-ecfgd-96.ps.gz"
-, keywords =	"graph drawing, experiments, orthogonal"
-, precedes =	"dglttv-ecfgd-97"
-, update =	"97.03 tamassia, 96.09 tamassia"
-}
-
-% also claimed, pages =	"303--326"
+, author =      "G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu"
+, title =       "An Experimental Comparison of Four Graph Drawing Algorithms"
+, type =        "Manuscript"
+, institution = "Dept. of Computer Sci., Brown University"
+, year =        1996
+, url = "https://www.cs.brown.edu/cgc/papers/dglttv-ecfgd-96.ps.gz"
+, keywords =    "graph drawing, experiments, orthogonal"
+, precedes =    "dglttv-ecfgd-97"
+, update =      "97.03 tamassia, 96.09 tamassia"
+}
+
+% also claimed, pages = "303--326"
 @article{dglttv-ecfgd-97
-, author =	"G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu"
-, title =	"An Experimental Comparison of Four Graph Drawing Algorithms"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"303--325"
-, url =	"https://www.cs.brown.edu/cgc/papers/dglttv-ecfgd-96.ps.gz"
-, keywords =	"graph drawing, experiments, orthogonal, CGC, Brown"
-, succeeds =	"dglttv-ecfgd-96"
-, update =	"98.07 patrignani+tamassia+vismara, 97.07 devillers, 97.03 tamassia, 96.09 tamassia"
+, author =      "G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu"
+, title =       "An Experimental Comparison of Four Graph Drawing Algorithms"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "303--325"
+, url = "https://www.cs.brown.edu/cgc/papers/dglttv-ecfgd-96.ps.gz"
+, keywords =    "graph drawing, experiments, orthogonal, CGC, Brown"
+, succeeds =    "dglttv-ecfgd-96"
+, update =      "98.07 patrignani+tamassia+vismara, 97.07 devillers, 97.03 tamassia, 96.09 tamassia"
 }
 
 @inproceedings{dglttv-ectgd-95
-, author =	"G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu"
-, title =	"An Experimental Comparison of Three Graph Drawing Algorithms"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"306--315"
-, url =	"https://www.cs.brown.edu/cgc/papers/dglttv-ectgd-95.ps.gz"
-, keywords =	"graph drawing, experiments, orthogonal"
-, cites =	"bcn-cdder-92, bfn-wigdp-85, bnt-ladfd-86, bbdl-tealf-91, bk-bhogd-94, con-dpgn-85, cp-ltadp-90, celr-tdgd-95, dh-dgnus-89, fpp-sssfe-88, fr-scpdt-84, dett-adgab-94, dgst-ads-90, dlv-sorod-93, dlt-pepg-84, eg-rpdfb-94, eg-glbdb-95, fr-gdfdp-91, gs-ssa-79, gnv-dptdd-88, h-celag-94, h-ggpig-95, jemwdt-npgda-91, jm-mpsne-96, k-vaor-89, kk-adgug-89, k-dpgul-92, k-adpg-93, k-mcvr-93, kb-pgap-92, l-aeglv-80, lmp-sbeac-94, lmps-trm1b-90, lms-gtrre-91, lms-la3be-93, nt-fapsd-84, pt-iabod-95, r-nmdpg-87, rt-rplbo-86, s-mncpe-84, stt-mvuhs-81, t-eggmn-87, tdb-agdrd-88, tt-uavrp-86, tt-pgelt-89, tt-gd-95, t-dgds-88, t-hdg-63, v-ucvc-81, w-npagt-90, w-cblsg-85, w-dpg-82, ZZZ"
-, update =	"01.04 icking, 98.11 bibrelex, 98.03 bibrelex, 97.03 tamassia, 96.09 tamassia, 95.05 tamassia"
+, author =      "G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu"
+, title =       "An Experimental Comparison of Three Graph Drawing Algorithms"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "306--315"
+, url = "https://www.cs.brown.edu/cgc/papers/dglttv-ectgd-95.ps.gz"
+, keywords =    "graph drawing, experiments, orthogonal"
+, cites =       "bcn-cdder-92, bfn-wigdp-85, bnt-ladfd-86, bbdl-tealf-91, bk-bhogd-94, con-dpgn-85, cp-ltadp-90, celr-tdgd-95, dh-dgnus-89, fpp-sssfe-88, fr-scpdt-84, dett-adgab-94, dgst-ads-90, dlv-sorod-93, dlt-pepg-84, eg-rpdfb-94, eg-glbdb-95, fr-gdfdp-91, gs-ssa-79, gnv-dptdd-88, h-celag-94, h-ggpig-95, jemwdt-npgda-91, jm-mpsne-96, k-vaor-89, kk-adgug-89, k-dpgul-92, k-adpg-93, k-mcvr-93, kb-pgap-92, l-aeglv-80, lmp-sbeac-94, lmps-trm1b-90, lms-gtrre-91, lms-la3be-93, nt-fapsd-84, pt-iabod-95, r-nmdpg-87, rt-rplbo-86, s-mncpe-84, stt-mvuhs-81, t-eggmn-87, tdb-agdrd-88, tt-uavrp-86, tt-pgelt-89, tt-gd-95, t-dgds-88, t-hdg-63, v-ucvc-81, w-npagt-90, w-cblsg-85, w-dpg-82, ZZZ"
+, update =      "01.04 icking, 98.11 bibrelex, 98.03 bibrelex, 97.03 tamassia, 96.09 tamassia, 95.05 tamassia"
 }
 
 @techreport{dglttvv-ddges-96
-, author =	"G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu and L. Vismara"
-, title =	"Drawing Directed Graphs: An Experimental Study"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Brown Univ."
-, year =	1996
-, keywords =	"graph drawing, experiments, upward"
-, update =	"98.07 vismara, 96.09 tamassia"
+, author =      "G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and E. Tassinari and F. Vargiu and L. Vismara"
+, title =       "Drawing Directed Graphs: An Experimental Study"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Brown Univ."
+, year =        1996
+, keywords =    "graph drawing, experiments, upward"
+, update =      "98.07 vismara, 96.09 tamassia"
 }
 
 @inproceedings{dgst-ads-90
-, author =	"G. {Di Battista} and A. Giammarco and G. Santucci and R. Tamassia"
-, title =	"The Architecture of {Diagram} {Server}"
-, booktitle =	"Proc. IEEE Workshop on Visual Languages"
-, nickname =	"VL '90"
-, year =	1990
-, pages =	"60--65"
-, keywords =	"graph drawing"
-, update =	"98.07 bibrelex, 95.05 tamassia, 93.09 tamassia"
+, author =      "G. {Di Battista} and A. Giammarco and G. Santucci and R. Tamassia"
+, title =       "The Architecture of {Diagram} {Server}"
+, booktitle =   "Proc. IEEE Workshop on Visual Languages"
+, nickname =    "VL '90"
+, year =        1990
+, pages =       "60--65"
+, keywords =    "graph drawing"
+, update =      "98.07 bibrelex, 95.05 tamassia, 93.09 tamassia"
 }
 
 @inproceedings{dll-pds-95
-, author =	"G. {Di Battista} and W. Lenhart and G. Liotta"
-, title =	"Proximity Drawability: a Survey"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"328--339"
-, keywords =	"graph drawing, proximity, survey"
-, update =	"95.01 tamassia"
+, author =      "G. {Di Battista} and W. Lenhart and G. Liotta"
+, title =       "Proximity Drawability: a Survey"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "328--339"
+, keywords =    "graph drawing, proximity, survey"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{dl-upcfm-98
-, author =	"G. {Di Battista} and G. Liotta"
-, title =	"Upward Planarity Checking: ``{F}aces Are More than Polygons''"
-, editor =	"S. H. Whitesides"
-, booktitle =	"Graph Drawing (Proc. GD~'98)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1547
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"72--86"
-, update =	"99.07 vismara, 99.03 patrignani+vismara, 98.11 vismara"
+, author =      "G. {Di Battista} and G. Liotta"
+, title =       "Upward Planarity Checking: ``{F}aces Are More than Polygons''"
+, editor =      "S. H. Whitesides"
+, booktitle =   "Graph Drawing (Proc. GD~'98)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1547
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "72--86"
+, update =      "99.07 vismara, 99.03 patrignani+vismara, 98.11 vismara"
 }
 
 @inproceedings{dlsv-ds-92
-, author =	"G. {Di Battista} and G. Liotta and M. Strani and F. Vargiu"
-, title =	"{Diagram} {Server}"
-, booktitle =	"Proc. Advanced Visual Interfaces"
-, series =	"World Scientific Series in Computer Science"
-, volume =	36
-, year =	1992
-, pages =	"415--417"
-, keywords =	"graph drawing"
-, update =	"95.05 tamassia, 94.01 tamassia, 93.09 tamassia"
+, author =      "G. {Di Battista} and G. Liotta and M. Strani and F. Vargiu"
+, title =       "{Diagram} {Server}"
+, booktitle =   "Proc. Advanced Visual Interfaces"
+, series =      "World Scientific Series in Computer Science"
+, volume =      36
+, year =        1992
+, pages =       "415--417"
+, keywords =    "graph drawing"
+, update =      "95.05 tamassia, 94.01 tamassia, 93.09 tamassia"
 }
 
 @article{dlv-ds-95
-, author =	"G. {Di Battista} and G. Liotta and F. Vargiu"
-, title =	"{Diagram Server}"
-, journal =	"J. Visual Lang. Comput."
-, volume =	6
-, number =	3
-, year =	1995
-, pages =	"275--298"
-, note =	"(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
-, keywords =	"graph drawing, system"
-, update =	"96.09 tamassia, 95.09 agarwal+devillers, 95.05 tamassia"
+, author =      "G. {Di Battista} and G. Liotta and F. Vargiu"
+, title =       "{Diagram Server}"
+, journal =     "J. Visual Lang. Comput."
+, volume =      6
+, number =      3
+, year =        1995
+, pages =       "275--298"
+, note =        "(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
+, keywords =    "graph drawing, system"
+, update =      "96.09 tamassia, 95.09 agarwal+devillers, 95.05 tamassia"
 }
 
 @article{dlv-sood-98
-, author =	"G. {Di Battista} and G. Liotta and F. Vargiu"
-, title =	"Spirality and Optimal Orthogonal Drawings"
-, journal =	"SIAM J. Comput."
-, volume =	27
-, number =	6
-, year =	1998
-, pages =	"1764--1811"
-, succeeds =	"dlv-sorod-93,lvd-odmnb-94"
-, update =	"99.03 vismara"
+, author =      "G. {Di Battista} and G. Liotta and F. Vargiu"
+, title =       "Spirality and Optimal Orthogonal Drawings"
+, journal =     "SIAM J. Comput."
+, volume =      27
+, number =      6
+, year =        1998
+, pages =       "1764--1811"
+, succeeds =    "dlv-sorod-93,lvd-odmnb-94"
+, update =      "99.03 vismara"
 }
 
 @inproceedings{dlv-sorod-93
-, author =	"G. {Di Battista} and G. Liotta and F. Vargiu"
-, title =	"Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and $3$-Planar Graphs"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"151--162"
-, update =	"99.11 bibrelex, 94.05 tamassia"
+, author =      "G. {Di Battista} and G. Liotta and F. Vargiu"
+, title =       "Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and $3$-Planar Graphs"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "151--162"
+, update =      "99.11 bibrelex, 94.05 tamassia"
 }
 
 @inproceedings{dlw-swp-96
-, author =	"G. {Di Battista} and G. Liotta and S. H. Whitesides"
-, title =	"The Strength of Weak Proximity"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, nickname =	"GD '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"178--189"
-, url =	"https://www.cs.brown.edu/cgc/papers/dlw-swp-96.ps.gz"
-, keywords =	"graph drawing"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 97.03 tamassia, 96.09 tamassia"
+, author =      "G. {Di Battista} and G. Liotta and S. H. Whitesides"
+, title =       "The Strength of Weak Proximity"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, nickname =    "GD '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "178--189"
+, url = "https://www.cs.brown.edu/cgc/papers/dlw-swp-96.ps.gz"
+, keywords =    "graph drawing"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 97.03 tamassia, 96.09 tamassia"
 }
 
 @article{dlr-bgudp-90
-, author =	"G. {Di Battista} and W. P. Liu and I. Rival"
-, title =	"Bipartite Graphs Upward Drawings and Planarity"
-, journal =	"Inform. Process. Lett."
-, volume =	36
-, year =	1990
-, pages =	"317--322"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "G. {Di Battista} and W. P. Liu and I. Rival"
+, title =       "Bipartite Graphs Upward Drawings and Planarity"
+, journal =     "Inform. Process. Lett."
+, volume =      36
+, year =        1990
+, pages =       "317--322"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{dm-ntgds-99
-, title =	"New Trends in Graph Drawing: Special Issue on Selected Papers from the 1997 {S}ymposium on {G}raph {D}rawing"
-, editor =	"Giuseppe {Di Battista} and Petra Mutzel"
-, journal =	"J. Graph Algorithms Appl."
-, volume =	"3:4"
-, year =	1999
-, url =	"https://www.cs.brown.edu/publications/jgaa/papers.html"
-, update =	"00.03 vismara"
+, title =       "New Trends in Graph Drawing: Special Issue on Selected Papers from the 1997 {S}ymposium on {G}raph {D}rawing"
+, editor =      "Giuseppe {Di Battista} and Petra Mutzel"
+, journal =     "J. Graph Algorithms Appl."
+, volume =      "3:4"
+, year =        1999
+, url = "https://www.cs.brown.edu/publications/jgaa/papers.html"
+, update =      "00.03 vismara"
 }
 
 @book{dm-spgd-
-, title =	"Special Issue on Selected Papers from the 1997 Symposium on Graph Drawing"
-, editor =	"G. {Di Battista} and P. Mutzel"
-, series =	"J. Graph Algorithms Appl."
-, note =	"To appear"
-, keywords =	"graph drawing, collection"
-, update =	"98.11 tamassia"
+, title =       "Special Issue on Selected Papers from the 1997 Symposium on Graph Drawing"
+, editor =      "G. {Di Battista} and P. Mutzel"
+, series =      "J. Graph Algorithms Appl."
+, note =        "To appear"
+, keywords =    "graph drawing, collection"
+, update =      "98.11 tamassia"
 }
 
 % Bernierd June 1986
 @inproceedings{dn-atphg-87
-, author =	"G. {Di Battista} and E. Nardelli"
-, title =	"An Algorithm for Testing Planarity of Hierarchical Graphs"
-, editor =	"G. Tinhofer and G. Schmidt"
-, booktitle =	"Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	246
-, publisher =	"Springer-Verlag"
-, year =	1987
-, pages =	"277--289"
-, keywords =	"graph drawing"
-, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
+, author =      "G. {Di Battista} and E. Nardelli"
+, title =       "An Algorithm for Testing Planarity of Hierarchical Graphs"
+, editor =      "G. Tinhofer and G. Schmidt"
+, booktitle =   "Proc. 12th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      246
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "277--289"
+, keywords =    "graph drawing"
+, update =      "99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
 }
 
 @article{dn-hpt-88
-, author =	"G. {Di Battista} and E. Nardelli"
-, title =	"Hierarchies and Planarity Theory"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	18
-, number =	6
-, year =	1988
-, pages =	"1035--1046"
-, keywords =	"graph drawing upward planar"
-, update =	"95.05 tamassia, 93.09 tamassia"
+, author =      "G. {Di Battista} and E. Nardelli"
+, title =       "Hierarchies and Planarity Theory"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      18
+, number =      6
+, year =        1988
+, pages =       "1035--1046"
+, keywords =    "graph drawing upward planar"
+, update =      "95.05 tamassia, 93.09 tamassia"
 }
 
 @inproceedings{dpv-spa3d-98
-, author =	"Giuseppe {Di Battista} and Maurizio Patrignani and Francesco Vargiu"
-, title =	"A {Split \& Push} Approach to {3D} Orthogonal Drawing"
-, editor =	"S. H. Whitesides"
-, booktitle =	"Graph Drawing (Proc. GD '98)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1547
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"87--101"
-, keywords =	"graph drawing, orthogonal, three-dimensional"
-, update =	"99.03 patrignani"
+, author =      "Giuseppe {Di Battista} and Maurizio Patrignani and Francesco Vargiu"
+, title =       "A {Split \& Push} Approach to {3D} Orthogonal Drawing"
+, editor =      "S. H. Whitesides"
+, booktitle =   "Graph Drawing (Proc. GD '98)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1547
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "87--101"
+, keywords =    "graph drawing, orthogonal, three-dimensional"
+, update =      "99.03 patrignani"
 }
 
 @inproceedings{dptt-alpdx-89
-, author =	"G. {Di Battista} and E. Pietrosanti and R. Tamassia and I. G. Tollis"
-, title =	"Automatic Layout of {PERT} Diagrams with {XPERT}"
-, booktitle =	"Proc. IEEE Workshop on Visual Languages"
-, nickname =	"VL '89"
-, year =	1989
-, pages =	"171--176"
-, keywords =	"graph drawing"
-, update =	"98.07 bibrelex, 93.09 tamassia"
+, author =      "G. {Di Battista} and E. Pietrosanti and R. Tamassia and I. G. Tollis"
+, title =       "Automatic Layout of {PERT} Diagrams with {XPERT}"
+, booktitle =   "Proc. IEEE Workshop on Visual Languages"
+, nickname =    "VL '89"
+, year =        1989
+, pages =       "171--176"
+, keywords =    "graph drawing"
+, update =      "98.07 bibrelex, 93.09 tamassia"
 }
 
 @article{dt-aprad-88
-, author =	"G. {Di Battista} and R. Tamassia"
-, title =	"Algorithms for Plane Representations of Acyclic Digraphs"
-, journal =	"Theoret. Comput. Sci."
-, volume =	61
-, year =	1988
-, pages =	"175--198"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia"
+, title =       "Algorithms for Plane Representations of Acyclic Digraphs"
+, journal =     "Theoret. Comput. Sci."
+, volume =      61
+, year =        1988
+, pages =       "175--198"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{dt-igsda-86
-, author =	"G. {Di Battista} and R. Tamassia"
-, title =	"An Integrated Graphic System for Designing and Accessing Statistical Data Bases"
-, booktitle =	"Proc. 7th Sympos. on Computational Statistics"
-, nickname =	"COMPSTAT 1986"
-, publisher =	"Physica-Verlag"
-, year =	1986
-, pages =	"231--236"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia"
+, title =       "An Integrated Graphic System for Designing and Accessing Statistical Data Bases"
+, booktitle =   "Proc. 7th Sympos. on Computational Statistics"
+, nickname =    "COMPSTAT 1986"
+, publisher =   "Physica-Verlag"
+, year =        1986
+, pages =       "231--236"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{dt-ipt-89
-, author =	"G. {Di Battista} and R. Tamassia"
-, title =	"Incremental Planarity Testing"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"436--441"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia"
+, title =       "Incremental Planarity Testing"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "436--441"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{dt-olgas-90
-, author =	"G. {Di Battista} and R. Tamassia"
-, title =	"On-Line Graph Algorithms with {SPQR}-Trees"
-, editor =	"M. S. Paterson"
-, booktitle =	"Automata, Languages and Programming (Proc. 17th ICALP)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	443
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"598--611"
-, update =	"98.07 tamassia+vismara, 95.05 tamassia, 94.01 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia"
+, title =       "On-Line Graph Algorithms with {SPQR}-Trees"
+, editor =      "M. S. Paterson"
+, booktitle =   "Automata, Languages and Programming (Proc. 17th ICALP)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      443
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "598--611"
+, update =      "98.07 tamassia+vismara, 95.05 tamassia, 94.01 tamassia"
 }
 
 @techreport{dt-olmtc-92
-, author =	"G. {Di Battista} and R. Tamassia"
-, title =	"On-Line Maintenance of Triconnected Components with {SPQR}-Trees"
-, type =	"Report"
-, number =	"CS-92-40"
-, institution =	"Comput. Sci. Dept., Brown Univ."
-, address =	"Providence, RI"
-, year =	1992
-, note =	"Submitted for publication."
-, succeeds =	"dt-olgas-90"
-, update =	"95.05 tamassia, 94.05 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia"
+, title =       "On-Line Maintenance of Triconnected Components with {SPQR}-Trees"
+, type =        "Report"
+, number =      "CS-92-40"
+, institution = "Comput. Sci. Dept., Brown Univ."
+, address =     "Providence, RI"
+, year =        1992
+, note =        "Submitted for publication."
+, succeeds =    "dt-olgas-90"
+, update =      "95.05 tamassia, 94.05 tamassia"
 }
 
 @article{dt-olmtc-96
-, author =	"G. {Di Battista} and R. Tamassia"
-, title =	"On-Line Maintenance of Triconnected Components with {SPQR}-Trees"
-, journal =	"Algorithmica"
-, volume =	15
-, year =	1996
-, pages =	"302--318"
-, succeeds =	"dt-olgas-90, dt-olmtc-92"
-, update =	"98.07 vismara, 97.11 bibrelex, 97.03 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia"
+, title =       "On-Line Maintenance of Triconnected Components with {SPQR}-Trees"
+, journal =     "Algorithmica"
+, volume =      15
+, year =        1996
+, pages =       "302--318"
+, succeeds =    "dt-olgas-90, dt-olmtc-92"
+, update =      "98.07 vismara, 97.11 bibrelex, 97.03 tamassia"
 }
 
 @techreport{dt-olpt-92
-, author =	"G. {Di Battista} and R. Tamassia"
-, title =	"On-Line Planarity Testing"
-, type =	"Report"
-, number =	"CS-92-39"
-, institution =	"Comput. Sci. Dept., Brown Univ."
-, address =	"Providence, RI"
-, year =	1992
-, succeeds =	"dt-ipt-89"
-, precedes =	"dt-olpt-96"
-, update =	"97.03 smid, 94.05 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia"
+, title =       "On-Line Planarity Testing"
+, type =        "Report"
+, number =      "CS-92-39"
+, institution = "Comput. Sci. Dept., Brown Univ."
+, address =     "Providence, RI"
+, year =        1992
+, succeeds =    "dt-ipt-89"
+, precedes =    "dt-olpt-96"
+, update =      "97.03 smid, 94.05 tamassia"
 }
 
 @article{dt-olpt-96
-, author =	"G. {Di Battista} and R. Tamassia"
-, title =	"On-Line Planarity Testing"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, year =	1996
-, pages =	"956--997"
-, keywords =	"graph drawing"
-, succeeds =	"dt-ipt-89, dt-olpt-92"
-, update =	"97.03 smid+tamassia, 95.01 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia"
+, title =       "On-Line Planarity Testing"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, pages =       "956--997"
+, keywords =    "graph drawing"
+, succeeds =    "dt-ipt-89, dt-olpt-92"
+, update =      "97.03 smid+tamassia, 95.01 tamassia"
 }
 
 @book{dt-sigrg-98
-, title =	"Special Issue on Geometric Representations of Graphs"
-, editor =	"G. {Di Battista} and R. Tamassia"
-, series =	"Comput. Geom. Theory Appl."
-, volume =	"9:1--2"
-, year =	1998
-, keywords =	"graph drawing, collection"
-, update =	"98.07 vismara, 95.09 tamassia"
+, title =       "Special Issue on Geometric Representations of Graphs"
+, editor =      "G. {Di Battista} and R. Tamassia"
+, series =      "Comput. Geom. Theory Appl."
+, volume =      "9:1--2"
+, year =        1998
+, keywords =    "graph drawing, collection"
+, update =      "98.07 vismara, 95.09 tamassia"
 }
 
 @book{dt-sigd-96
-, title =	"Special Issue on Graph Drawing"
-, editor =	"G. {Di Battista} and R. Tamassia"
-, series =	"Algorithmica"
-, volume =	"16:1"
-, year =	1996
-, keywords =	"graph drawing, collection"
-, update =	"98.07 vismara, 95.09 tamassia"
+, title =       "Special Issue on Graph Drawing"
+, editor =      "G. {Di Battista} and R. Tamassia"
+, series =      "Algorithmica"
+, volume =      "16:1"
+, year =        1996
+, keywords =    "graph drawing, collection"
+, update =      "98.07 vismara, 95.09 tamassia"
 }
 
 @inproceedings{dtt-arsdd-89
-, author =	"G. {Di Battista} and R. Tamassia and I. G. Tollis"
-, title =	"Area requirement and symmetry display in drawing graphs"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"51--60"
-, keywords =	"graph drawing"
-, cites =	"con-dpgn-85, cnao-laepg-85, cp-ltadp-90, dt-aprad-88, dlt-pepg-84, e-hgd-84, et-adgab-89, f-slrpg-48, fpp-sssfe-88, gy-tsr-83, ht-ept-74, hp-callc-79, k-vrrpd-75, kr-pl-75, k-fpos-87, lec-aptg-67, lns-mdg-85, ma-fddso-86, ma-fddst-88, r-nmdpg-87, rt-tdt-81, ru-roptc-88, rt-rplbo-86, s-epgg-90, s-cm-51, sr-vudtd-34, s-mncpe-84, sr-cdtn-83, tt-uavrp-86, t-eggmn-87, tt-eepgl-87, tdb-agdrd-88, t-hdg-63, w-bzv-36, w-dpg-82, ZZZ"
-, update =	"01.04 icking, 98.03 bibrelex, 93.09 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia and I. G. Tollis"
+, title =       "Area requirement and symmetry display in drawing graphs"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "51--60"
+, keywords =    "graph drawing"
+, cites =       "con-dpgn-85, cnao-laepg-85, cp-ltadp-90, dt-aprad-88, dlt-pepg-84, e-hgd-84, et-adgab-89, f-slrpg-48, fpp-sssfe-88, gy-tsr-83, ht-ept-74, hp-callc-79, k-vrrpd-75, kr-pl-75, k-fpos-87, lec-aptg-67, lns-mdg-85, ma-fddso-86, ma-fddst-88, r-nmdpg-87, rt-tdt-81, ru-roptc-88, rt-rplbo-86, s-epgg-90, s-cm-51, sr-vudtd-34, s-mncpe-84, sr-cdtn-83, tt-uavrp-86, t-eggmn-87, tt-eepgl-87, tdb-agdrd-88, t-hdg-63, w-bzv-36, w-dpg-82, ZZZ"
+, update =      "01.04 icking, 98.03 bibrelex, 93.09 tamassia"
 }
 
 @article{dtt-arsdp-92
-, author =	"G. {Di Battista} and R. Tamassia and I. G. Tollis"
-, title =	"Area Requirement and Symmetry Display of Planar Upward Drawings"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, number =	4
-, year =	1992
-, pages =	"381--401"
-, keywords =	"graph drawing"
-, update =	"98.11 bibrelex, 93.09 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia and I. G. Tollis"
+, title =       "Area Requirement and Symmetry Display of Planar Upward Drawings"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, number =      4
+, year =        1992
+, pages =       "381--401"
+, keywords =    "graph drawing"
+, update =      "98.11 bibrelex, 93.09 tamassia"
 }
 
 @article{dtt-cvrg-92
-, author =	"G. {Di Battista} and R. Tamassia and I. G. Tollis"
-, title =	"Constrained Visibility Representations of Graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	41
-, year =	1992
-, pages =	"1--7"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia and I. G. Tollis"
+, title =       "Constrained Visibility Representations of Graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      41
+, year =        1992
+, pages =       "1--7"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{dtt-pdad-88
-, author =	"G. {Di Battista} and R. Tamassia and I. G. Tollis"
-, title =	"On planar drawings of acyclic digraphs"
-, type =	"Report"
-, number =	"UTDCS 7-88"
-, institution =	"Comput. Sci. Program., Univ. Texas Dallas"
-, address =	"Richardson, TX"
-, year =	1988
+, author =      "G. {Di Battista} and R. Tamassia and I. G. Tollis"
+, title =       "On planar drawings of acyclic digraphs"
+, type =        "Report"
+, number =      "UTDCS 7-88"
+, institution = "Comput. Sci. Program., Univ. Texas Dallas"
+, address =     "Richardson, TX"
+, year =        1988
 }
 
 @techreport{dtv-olcpt-95t
-, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
-, title =	"On-Line Convex Planarity Testing"
-, type =	"Technical Report"
-, number =	"CS-95-26"
-, institution =	"Dept. Comput. Sci., Brown Univ."
-, month =	aug
-, year =	1995
-, url =	"ftp://ftp.cs.brown.edu/pub/techreports/95/cs95-26.ps.Z"
-, update =	"98.07 vismara, 97.03 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia and L. Vismara"
+, title =       "On-Line Convex Planarity Testing"
+, type =        "Technical Report"
+, number =      "CS-95-26"
+, institution = "Dept. Comput. Sci., Brown Univ."
+, month =       aug
+, year =        1995
+, url = "ftp://ftp.cs.brown.edu/pub/techreports/95/cs95-26.ps.Z"
+, update =      "98.07 vismara, 97.03 tamassia"
 }
 
 @inproceedings{dtv-olcpt-95
-, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
-, title =	"On-Line Convex Planarity Testing"
-, booktitle =	"Graph-Theoretic Concepts in Computer Science (Proc. WG '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	903
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"242--255"
-, keywords =	"graph drawing"
-, update =	"98.07 vismara, 94.05 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia and L. Vismara"
+, title =       "On-Line Convex Planarity Testing"
+, booktitle =   "Graph-Theoretic Concepts in Computer Science (Proc. WG '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      903
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "242--255"
+, keywords =    "graph drawing"
+, update =      "98.07 vismara, 94.05 tamassia"
 }
 
 @techreport{dtv-osrdp-96t
-, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
-, title =	"Output-Sensitive Reporting of Disjoint Paths"
-, type =	"Technical Report"
-, number =	"CS-96-25"
-, institution =	"Dept. Computer Science, Brown Univ."
-, month =	aug
-, year =	1996
-, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-25.ps.Z"
-, update =	"98.07 vismara"
+, author =      "G. {Di Battista} and R. Tamassia and L. Vismara"
+, title =       "Output-Sensitive Reporting of Disjoint Paths"
+, type =        "Technical Report"
+, number =      "CS-96-25"
+, institution = "Dept. Computer Science, Brown Univ."
+, month =       aug
+, year =        1996
+, url = "ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-25.ps.Z"
+, update =      "98.07 vismara"
 }
 
 @inproceedings{dtv-osrdp-96i
-, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
-, title =	"Output-Sensitive Reporting of Disjoint Paths"
-, booktitle =	"Proc. 2nd Ann. Internat. Conf. Computing and Combinatorics"
-, nickname =	"COCOON '96"
-, site =	"Hong Kong"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1090
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"81--91"
-, url =	"https://www.cs.brown.edu/cgc/papers/dtv-osrdp-96.ps.gz"
-, update =	"99.11 bibrelex, 98.07 vismara, 97.03 tamassia"
+, author =      "G. {Di Battista} and R. Tamassia and L. Vismara"
+, title =       "Output-Sensitive Reporting of Disjoint Paths"
+, booktitle =   "Proc. 2nd Ann. Internat. Conf. Computing and Combinatorics"
+, nickname =    "COCOON '96"
+, site =        "Hong Kong"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1090
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "81--91"
+, url = "https://www.cs.brown.edu/cgc/papers/dtv-osrdp-96.ps.gz"
+, update =      "99.11 bibrelex, 98.07 vismara, 97.03 tamassia"
 }
 
 @article{dtv-osrdp-99
-, author =	"G. {Di Battista} and R. Tamassia and L. Vismara"
-, title =	"Output-Sensitive Reporting of Disjoint Paths"
-, journal =	"Algorithmica"
-, volume =	23
-, number =	4
-, year =	1999
-, pages =	"302--340"
-, succeeds =	"dtv-osrdp-96i, dtv-osrdp-96t"
-, update =	"99.03 vismara, 98.11 tamassia"
-, annote =	"Special Issue of Selected Papers from the 2nd Annual International Computing and Combinatorics Conference"
+, author =      "G. {Di Battista} and R. Tamassia and L. Vismara"
+, title =       "Output-Sensitive Reporting of Disjoint Paths"
+, journal =     "Algorithmica"
+, volume =      23
+, number =      4
+, year =        1999
+, pages =       "302--340"
+, succeeds =    "dtv-osrdp-96i, dtv-osrdp-96t"
+, update =      "99.03 vismara, 98.11 tamassia"
+, annote =      "Special Issue of Selected Papers from the 2nd Annual International Computing and Combinatorics Conference"
 }
 
 @inproceedings{dv-aptg-93
-, author =	"G. {Di Battista} and L. Vismara"
-, title =	"Angles of Planar Triangular Graphs"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '93"
-, year =	1993
-, pages =	"431--437"
-, keywords =	"graph drawing"
-, update =	"98.07 bibrelex, 97.03 agarwal, 93.09 milone+mitchell+tamassia"
+, author =      "G. {Di Battista} and L. Vismara"
+, title =       "Angles of Planar Triangular Graphs"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '93"
+, year =        1993
+, pages =       "431--437"
+, keywords =    "graph drawing"
+, update =      "98.07 bibrelex, 97.03 agarwal, 93.09 milone+mitchell+tamassia"
 }
 
 @article{dv-aptg-96
-, author =	"G. {Di Battista} and L. Vismara"
-, title =	"Angles of Planar Triangular Graphs"
-, journal =	"SIAM J. Discrete Math."
-, volume =	9
-, number =	3
-, year =	1996
-, pages =	"349--359"
-, update =	"97.03 tamassia"
+, author =      "G. {Di Battista} and L. Vismara"
+, title =       "Angles of Planar Triangular Graphs"
+, journal =     "SIAM J. Discrete Math."
+, volume =      9
+, number =      3
+, year =        1996
+, pages =       "349--359"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{dm-dfich-86
-, author =	"V. {Di Gesu} and M. C. Maccarone"
-, title =	"Description of fuzzy images by convex hull technique"
-, booktitle =	"Proc. 8th IEEE Internat. Conf. Pattern Recogn."
-, year =	1986
-, pages =	"1276--1278"
+, author =      "V. {Di Gesu} and M. C. Maccarone"
+, title =       "Description of fuzzy images by convex hull technique"
+, booktitle =   "Proc. 8th IEEE Internat. Conf. Pattern Recogn."
+, year =        1986
+, pages =       "1276--1278"
 }
 
 @inproceedings{d-islas-94
-, author =	"Mario Dias"
-, title =	"Intersection of Straight Lines with Algebraic Surfaces in {NC-SAVE}"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"38--40"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Mario Dias"
+, title =       "Intersection of Straight Lines with Algebraic Surfaces in {NC-SAVE}"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "38--40"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{do-accac-89
-, author =	"M. D{\'\i}az and J. O'Rourke"
-, title =	"Algorithms for computing the center of area of a convex polygon"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	46
+, author =      "M. D{\'\i}az and J. O'Rourke"
+, title =       "Algorithms for computing the center of area of a convex polygon"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       46
 }
 
 @article{do-accac-94
-, author =	"M. D{\'\i}az and J. O'Rourke"
-, title =	"Algorithms for computing the center of area of a convex polygon"
-, journal =	"Visual Comput."
-, volume =	10
-, year =	1994
-, pages =	"432--442"
-, keywords =	"convexity, centerpoints"
-, succeeds =	"do-accac-89"
-, update =	"95.01 smid"
+, author =      "M. D{\'\i}az and J. O'Rourke"
+, title =       "Algorithms for computing the center of area of a convex polygon"
+, journal =     "Visual Comput."
+, volume =      10
+, year =        1994
+, pages =       "432--442"
+, keywords =    "convexity, centerpoints"
+, succeeds =    "do-accac-89"
+, update =      "95.01 smid"
 }
 
 @incollection{do-cccp-91
-, author =	"M. D{\'\i}az and J. O'Rourke"
-, title =	"Chord center for convex polygons"
-, editor =	"B. Melter and A. Rosenfeld and P. Bhattacharyai"
-, booktitle =	"Computational Vision"
-, publisher =	"American Mathematical Society"
-, year =	1991
-, pages =	"29--44"
-, keywords =	"convexity, centerpoints"
-, update =	"94.01 orourke"
+, author =      "M. D{\'\i}az and J. O'Rourke"
+, title =       "Chord center for convex polygons"
+, editor =      "B. Melter and A. Rosenfeld and P. Bhattacharyai"
+, booktitle =   "Computational Vision"
+, publisher =   "American Mathematical Society"
+, year =        1991
+, pages =       "29--44"
+, keywords =    "convexity, centerpoints"
+, update =      "94.01 orourke"
 }
 
 @inproceedings{do-ccap-89
-, author =	"M. D{\'\i}az and J. O'Rourke"
-, title =	"Computing the center of area of a polygon"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"171--182"
-, keywords =	"convexity, centerpoints"
-, update =	"95.01 smid, 94.01 smid"
+, author =      "M. D{\'\i}az and J. O'Rourke"
+, title =       "Computing the center of area of a polygon"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "171--182"
+, keywords =    "convexity, centerpoints"
+, update =      "95.01 smid, 94.01 smid"
 }
 
 @techreport{do-ccasp-89
-, author =	"M. D{\'\i}az and J. O'Rourke"
-, title =	"Computing the center of area of a simple polygon"
-, type =	"Technical {Report}"
-, number =	"89-03"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1989
-, keywords =	"convexity, centerpoints"
-, update =	"95.01 smid"
+, author =      "M. D{\'\i}az and J. O'Rourke"
+, title =       "Computing the center of area of a simple polygon"
+, type =        "Technical {Report}"
+, number =      "89-03"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1989
+, keywords =    "convexity, centerpoints"
+, update =      "95.01 smid"
 }
 
 @inproceedings{do-hssp-90
-, author =	"M. D{\'\i}az and J. O'Rourke"
-, title =	"Ham-sandwich sectioning of polygons"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"282--286"
-, keywords =	"convexity, centerpoints, ham-sandwich"
-, cites =	"do-hssp-90t, e-acg-87, eos-calha-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M. D{\'\i}az and J. O'Rourke"
+, title =       "Ham-sandwich sectioning of polygons"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "282--286"
+, keywords =    "convexity, centerpoints, ham-sandwich"
+, cites =       "do-hssp-90t, e-acg-87, eos-calha-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{do-hssp-90t
-, author =	"M. G. D{\'\i}az and J. O'Rourke"
-, title =	"Ham-sandwich sectioning of polygons"
-, type =	"Technical {Report}"
-, institution =	"Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1990
-, note =	"In preparation"
-, update =	"98.07 bibrelex"
+, author =      "M. G. D{\'\i}az and J. O'Rourke"
+, title =       "Ham-sandwich sectioning of polygons"
+, type =        "Technical {Report}"
+, institution = "Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1990
+, note =        "In preparation"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{dm-fnalm-94
-, author =	"M. Dickerson and M. Montague"
-, title =	"Fast new algorithms for locally minimum triangulations - and a platform for testing them"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "M. Dickerson and M. Montague"
+, title =       "Fast new algorithms for locally minimum triangulations - and a platform for testing them"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ds-opcpm-96
-, author =	"Matthew Dickerson and Daniel Scharstein"
-, title =	"Optimal placement of convex polygons to maximize point containment"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"114--121"
-, keywords =	"motion planning, polygon containment, arrangements, output-sensitive algorithms, bucketing"
-, update =	"96.09 agarwal, 96.01 mitchell"
+, author =      "Matthew Dickerson and Daniel Scharstein"
+, title =       "Optimal placement of convex polygons to maximize point containment"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "114--121"
+, keywords =    "motion planning, polygon containment, arrangements, output-sensitive algorithms, bucketing"
+, update =      "96.09 agarwal, 96.01 mitchell"
 }
 
 @article{ds-opcpm-98
-, author =	"Matthew Dickerson and Daniel Scharstein"
-, title =	"Optimal placement of convex polygons to maximize point containment"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	11
-, year =	1998
-, pages =	"1--16"
-, succeeds =	"ds-opcpm-96"
-, update =	"98.11 devillers"
+, author =      "Matthew Dickerson and Daniel Scharstein"
+, title =       "Optimal placement of convex polygons to maximize point containment"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      11
+, year =        1998
+, pages =       "1--16"
+, succeeds =    "ds-opcpm-96"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{ds-rdocp-96
-, author =	"Matthew Dickerson and Daniel Scharstein"
-, title =	"The rotation diagram and optimal containing placements of a convex polygon"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"V9--V10"
-, cites =	"ds-opcpm-96, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Matthew Dickerson and Daniel Scharstein"
+, title =       "The rotation diagram and optimal containing placements of a convex polygon"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "V9--V10"
+, cites =       "ds-opcpm-96, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{d-rlegt-92
-, author =	"M. T. Dickerson"
-, title =	"Rank of the longest edge in the greedy triangulation"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"182--187"
-, cites =	"dd-frnns-90, dd-ekdnp-91, g-nrpt-79, g-segta-89, k-ndot-80, ll-abgtc-87, l-abigt-86, l-tspp-77, mz-ngndt-79, ps-cgi-85, mz-pmhfa-83, r-slcdn-70, s-sisie-91, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M. T. Dickerson"
+, title =       "Rank of the longest edge in the greedy triangulation"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "182--187"
+, cites =       "dd-frnns-90, dd-ekdnp-91, g-nrpt-79, g-segta-89, k-ndot-80, ll-abgtc-87, l-abigt-86, l-tspp-77, mz-ngndt-79, ps-cgi-85, mz-pmhfa-83, r-slcdn-70, s-sisie-91, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{dd-ekdnp-91
-, author =	"M. T. Dickerson and R. L. Drysdale"
-, title =	"Enumerating $k$ distances for $n$ points in the plane"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"234--238"
-, keywords =	"Delaunay triangulation, proximity, enumeration"
-, precedes =	"dds-saeid-92"
-, cites =	"aass-sdp-90, bfprt-tbs-73, c-ntcos-85, dd-frnns-90, s-mmdpsl-90t, sh-cpp-75, y-cmstk-82, ZZZ"
-, update =	"97.11 bibrelex, 93.09 drysdale"
+, author =      "M. T. Dickerson and R. L. Drysdale"
+, title =       "Enumerating $k$ distances for $n$ points in the plane"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "234--238"
+, keywords =    "Delaunay triangulation, proximity, enumeration"
+, precedes =    "dds-saeid-92"
+, cites =       "aass-sdp-90, bfprt-tbs-73, c-ntcos-85, dd-frnns-90, s-mmdpsl-90t, sh-cpp-75, y-cmstk-82, ZZZ"
+, update =      "97.11 bibrelex, 93.09 drysdale"
 }
 
 @article{dds-saeid-92
-, author =	"M. T. Dickerson and R. L. Drysdale and J. R. Sack"
-, title =	"Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"221--239"
-, keywords =	"enumeration, selection, Delaunay triangulation, nearest neighbors"
-, succeeds =	"dd-ekdnp-91"
-, update =	"94.01 smid"
+, author =      "M. T. Dickerson and R. L. Drysdale and J. R. Sack"
+, title =       "Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "221--239"
+, keywords =    "enumeration, selection, Delaunay triangulation, nearest neighbors"
+, succeeds =    "dd-ekdnp-91"
+, update =      "94.01 smid"
 }
 
 @inproceedings{ddmw-fgta-94
-, author =	"M. T. Dickerson and R. L. S. Drysdale and S. A. McElfresh and Emo Welzl"
-, title =	"Fast Greedy Triangulation Algorithms"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"211--220"
-, cites =	"agss-ltacv-89, bsw-cffrn-77, c-cdt-87, cl-aldt-84, dfsv-apcg-92, d-rlegt-92, dd-frnns-90, dds-saeid-92, dg-aivib-70, g-nrpt-79, g-segta-89, hp-nrmwt-92, k-ndot-80, k-mtpd-80, ll-gdtpg-86, ls-ekcpo-92i, l-olbng-87, ll-abgtc-87, ll-fagt-92, ll-gtamw-92, l-gdtan-86, l-abigt-86, l-nhmwt-87, l-gtcbe-89, l-tspp-77, mz-ngndt-79, mz-pmhfa-83, ph-hta-87, ps-cgi-85, s-eis-92, w-eucdt-93, wa-srr3d-86, ws-oacdt-87, y-cdcrc-75, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
+, author =      "M. T. Dickerson and R. L. S. Drysdale and S. A. McElfresh and Emo Welzl"
+, title =       "Fast Greedy Triangulation Algorithms"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "211--220"
+, cites =       "agss-ltacv-89, bsw-cffrn-77, c-cdt-87, cl-aldt-84, dfsv-apcg-92, d-rlegt-92, dd-frnns-90, dds-saeid-92, dg-aivib-70, g-nrpt-79, g-segta-89, hp-nrmwt-92, k-ndot-80, k-mtpd-80, ll-gdtpg-86, ls-ekcpo-92i, l-olbng-87, ll-abgtc-87, ll-fagt-92, ll-gtamw-92, l-gdtan-86, l-abigt-86, l-nhmwt-87, l-gtcbe-89, l-tspp-77, mz-ngndt-79, mz-pmhfa-83, ph-hta-87, ps-cgi-85, s-eis-92, w-eucdt-93, wa-srr3d-86, ws-oacdt-87, y-cdcrc-75, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
 }
 
 @article{dd-frnns-90
-, author =	"M. T. Dickerson and R. S. Drysdale"
-, title =	"Fixed-radius near neighbor search algorithms for points and segments"
-, journal =	"Inform. Process. Lett."
-, volume =	35
-, year =	1990
-, pages =	"269--273"
-, keywords =	"near neighbor search, Delaunay triangulation"
-, update =	"93.09 drysdale"
+, author =      "M. T. Dickerson and R. S. Drysdale"
+, title =       "Fixed-radius near neighbor search algorithms for points and segments"
+, journal =     "Inform. Process. Lett."
+, volume =      35
+, year =        1990
+, pages =       "269--273"
+, keywords =    "near neighbor search, Delaunay triangulation"
+, update =      "93.09 drysdale"
 }
 
 @article{de-apphd-96
-, author =	"M. T. Dickerson and D. Eppstein"
-, title =	"Algorithms for proximity problems in higher dimensions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1996
-, pages =	"277--291"
-, update =	"96.05 smid"
+, author =      "M. T. Dickerson and D. Eppstein"
+, title =       "Algorithms for proximity problems in higher dimensions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1996
+, pages =       "277--291"
+, update =      "96.05 smid"
 }
 
 @inproceedings{dmm-naefm-95
-, author =	"Matthew T. Dickerson and Scott A. McElfresh and Mark H. Montague"
-, title =	"New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"238--247"
-, keywords =	"greedy triangulation, experimental"
-, cites =	"bs-plibp-94, bsw-cffrn-77, ddmw-fgta-94, dm-fnalm-94, dra-sltgt-95, g-nrpt-79, g-segta-89, hp-nrmwt-94, k-mtpd-80, ll-fagt-92, l-nhmwt-87, l-gtcbe-89, l-tspp-77, mz-ngndt-79, mz-pmhfa-83, o-cgc-94, w-eucdt-93, w-oagts-94, wa-srr3d-86, y-cdcrc-75, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 97.03 schwarzkopf, 95.09 mitchell"
+, author =      "Matthew T. Dickerson and Scott A. McElfresh and Mark H. Montague"
+, title =       "New Algorithms and Empirical Findings on Minimum Weight Triangulation Heuristics"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "238--247"
+, keywords =    "greedy triangulation, experimental"
+, cites =       "bs-plibp-94, bsw-cffrn-77, ddmw-fgta-94, dm-fnalm-94, dra-sltgt-95, g-nrpt-79, g-segta-89, hp-nrmwt-94, k-mtpd-80, ll-fagt-92, l-nhmwt-87, l-gtcbe-89, l-tspp-77, mz-ngndt-79, mz-pmhfa-83, o-cgc-94, w-eucdt-93, w-oagts-94, wa-srr3d-86, y-cdcrc-75, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 97.03 schwarzkopf, 95.09 mitchell"
 }
 
 @inproceedings{dm-ucsmw-96
-, author =	"Matthew T. Dickerson and Mark H. Montague"
-, title =	"A (Usually?) Connected Subgraph of the Minimum Weight Triangulation"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"204--213"
-, cites =	"aatr-tin-95, cx-alesw-96, cgt-ecabs-95, cn-asla-85, dj-wtacg-89, ddmw-fgta-94, dmm-naefm-95, eorw-fmakg-92, gj-cigtn-79, g-nrpt-79, k-csmwt-94, k-mtpd-80, yxy-cdapp-94, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Matthew T. Dickerson and Mark H. Montague"
+, title =       "A (Usually?) Connected Subgraph of the Minimum Weight Triangulation"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "204--213"
+, cites =       "aatr-tin-95, cx-alesw-96, cgt-ecabs-95, cn-asla-85, dj-wtacg-89, ddmw-fgta-94, dmm-naefm-95, eorw-fmakg-92, gj-cigtn-79, g-nrpt-79, k-csmwt-94, k-mtpd-80, yxy-cdapp-94, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{ds-ekldn-92
-, author =	"M. T. Dickerson and J. Shugart"
-, title =	"Enumerating $k$ longest distances for $n$ points in the plane"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"137--142"
-, cites =	"aass-sdp-90, bey-eedt-91a, bfprt-tbs-73, c-ntcos-85, c-mcsrv-72, dd-ekdnp-91, d-hdvdl-91, ki-fkbdn-91, mz-pmhfa-83, ps-cgi-85, s-lisps-89, s-sisie-91, sh-cpp-75, y-cmstk-82, yb-cf-61, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M. T. Dickerson and J. Shugart"
+, title =       "Enumerating $k$ longest distances for $n$ points in the plane"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "137--142"
+, cites =       "aass-sdp-90, bey-eedt-91a, bfprt-tbs-73, c-ntcos-85, c-mcsrv-72, dd-ekdnp-91, d-hdvdl-91, ki-fkbdn-91, mz-pmhfa-83, ps-cgi-85, s-lisps-89, s-sisie-91, sh-cpp-75, y-cmstk-82, yb-cf-61, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{dl-gitco-97
-, author =	"Walter Didimo and Antonio Leonforte"
-, title =	"{GRID}: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"309--315"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Walter Didimo and Antonio Leonforte"
+, title =       "{GRID}: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "309--315"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{dl-codve-98
-, author =	"W. Didimo and G. Liotta"
-, title =	"Computing Orthogonal Drawings in a Variable Embedding Setting"
-, editor =	"K.-Y. Chwa and O. H. Ibarra"
-, booktitle =	"Algorithms and Computation (Proc. ISAAC~'98)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1533
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"79--88"
-, update =	"00.03 vismara, 99.03 vismara"
+, author =      "W. Didimo and G. Liotta"
+, title =       "Computing Orthogonal Drawings in a Variable Embedding Setting"
+, editor =      "K.-Y. Chwa and O. H. Ibarra"
+, booktitle =   "Algorithms and Computation (Proc. ISAAC~'98)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1533
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "79--88"
+, update =      "00.03 vismara, 99.03 vismara"
 }
 
 @article{dk-rpipt-91
-, author =	"V. J. Dielissen and A. Kaldewaij"
-, title =	"Rectangular partition is polynomial in two dimensions but {NP}-complete in three"
-, journal =	"Inform. Process. Lett."
-, volume =	38
-, year =	1991
-, pages =	"1--6"
-, update =	"94.09 franciosa"
-, abstract =	"The inherent computational complexity of polygon
+, author =      "V. J. Dielissen and A. Kaldewaij"
+, title =       "Rectangular partition is polynomial in two dimensions but {NP}-complete in three"
+, journal =     "Inform. Process. Lett."
+, volume =      38
+, year =        1991
+, pages =       "1--6"
+, update =      "94.09 franciosa"
+, abstract =    "The inherent computational complexity of polygon
 decomposition problems is of importance in the field of
 computational geometry. For one of these problems it is shown that
 the three dimensional version is NP-complete whereas its two
@@ -46420,2172 +46420,2172 @@ @article{dk-rpipt-91
 }
 
 @book{d-csfs-93
-, author =	"P. Dierckx"
-, title =	"Curve and Surface Fitting with Splines"
-, publisher =	"Clarendon Press"
-, address =	"New York"
-, year =	1993
-, update =	"96.09 orourke"
+, author =      "P. Dierckx"
+, title =       "Curve and Surface Fitting with Splines"
+, publisher =   "Clarendon Press"
+, address =     "New York"
+, year =        1993
+, update =      "96.09 orourke"
 }
 
 @article{bdv-snest-91
-, author =	"A. Bialostocki, P. Dierken and B. Voxman"
-, title =	"Some notes on the {Erd{\H{o}}s-Szekeres} theorem"
-, journal =	"Discrete Math."
-, volume =	91
-, year =	1991
-, pages =	"231--238"
-, update =	"02.03 devillers"
+, author =      "A. Bialostocki, P. Dierken and B. Voxman"
+, title =       "Some notes on the {Erd{\H{o}}s-Szekeres} theorem"
+, journal =     "Discrete Math."
+, volume =      91
+, year =        1991
+, pages =       "231--238"
+, update =      "02.03 devillers"
 }
 
 @article{d-sppt-87
-, author =	"R. Diestel"
-, title =	"A separating property of planar triangulations"
-, journal =	"J. Graph Theory"
-, volume =	11
-, number =	1
-, year =	1987
-, pages =	"43--52"
-, keywords =	"triangulation"
-, update =	"95.09 korneenko"
+, author =      "R. Diestel"
+, title =       "A separating property of planar triangulations"
+, journal =     "J. Graph Theory"
+, volume =      11
+, number =      1
+, year =        1987
+, pages =       "43--52"
+, keywords =    "triangulation"
+, update =      "95.09 korneenko"
 }
 
 @article{dnsg-toosp-89
-, author =	"W. C. Dietrich and L. R. Nackman and C. J. Sundaresan and F. Gracer"
-, title =	"{TGMS}: {An} object-oriented system for programming geometry"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	19
-, number =	10
-, year =	1989
-, pages =	"978--1013"
-, keywords =	"implementation"
-, update =	"95.09 korneenko"
+, author =      "W. C. Dietrich and L. R. Nackman and C. J. Sundaresan and F. Gracer"
+, title =       "{TGMS}: {An} object-oriented system for programming geometry"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      19
+, number =      10
+, year =        1989
+, pages =       "978--1013"
+, keywords =    "implementation"
+, update =      "95.09 korneenko"
 }
 
 @phdthesis{d-iga-84
-, author =	"P. Dietz"
-, title =	"Intersection graph algorithms"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1984
-, note =	"Technical Report TR 84-628"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "P. Dietz"
+, title =       "Intersection graph algorithms"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1984
+, note =        "Technical Report TR 84-628"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @incollection{d-fpa-89
-, author =	"P. F. Dietz"
-, title =	"Fully persistent arrays"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, year =	1989
-, pages =	"67--74"
-, keywords =	"data structuring, persistent"
-, update =	"97.11 smid, 95.09 korneenko"
+, author =      "P. F. Dietz"
+, title =       "Fully persistent arrays"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, year =        1989
+, pages =       "67--74"
+, keywords =    "data structuring, persistent"
+, update =      "97.11 smid, 95.09 korneenko"
 }
 
 @incollection{dr-par-91
-, author =	"P. F. Dietz and R. Raman"
-, title =	"Persistence, amortization and randomization"
-, booktitle =	"Proc. ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"78--88"
-, keywords =	"data structuring, persistent, probabilistic analysis, amortized analysis"
-, update =	"95.09 korneenko"
+, author =      "P. F. Dietz and R. Raman"
+, title =       "Persistence, amortization and randomization"
+, booktitle =   "Proc. ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "78--88"
+, keywords =    "data structuring, persistent, probabilistic analysis, amortized analysis"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{ds-tamol-87
-, author =	"P. F. Dietz and D. D. Sleator"
-, title =	"Two Algorithms for Maintaining Order in a List"
-, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
-, year =	1987
-, pages =	"365--372"
-, update =	"95.05 tamassia"
+, author =      "P. F. Dietz and D. D. Sleator"
+, title =       "Two Algorithms for Maintaining Order in a List"
+, booktitle =   "Proc. 19th Annu. ACM Sympos. Theory Comput."
+, year =        1987
+, pages =       "365--372"
+, update =      "95.05 tamassia"
 }
 
 @article{d-lbss-89
-, author =	"M. Dietzfelbinger"
-, title =	"Lower Bounds for Sorting of Sums"
-, journal =	"Theoret. Comput. Sci."
-, volume =	66
-, year =	1989
-, pages =	"137--155"
-, keywords =	"lower bounds, comparison trees, sorting {$X+Y$}"
-, update =	"93.09 erickson"
+, author =      "M. Dietzfelbinger"
+, title =       "Lower Bounds for Sorting of Sums"
+, journal =     "Theoret. Comput. Sci."
+, volume =      66
+, year =        1989
+, pages =       "137--155"
+, keywords =    "lower bounds, comparison trees, sorting {$X+Y$}"
+, update =      "93.09 erickson"
 }
 
 @inproceedings{dgmp-phfr-92
-, author =	"M. Dietzfelbinger and J. Gil and Y. Matias and N. Pippenger"
-, title =	"Polynomial hash functions are reliable"
-, booktitle =	"ICALP"
-, month =	jul
-, year =	1992
-, pages =	"235--246"
-, update =	"98.11 bibrelex"
+, author =      "M. Dietzfelbinger and J. Gil and Y. Matias and N. Pippenger"
+, title =       "Polynomial hash functions are reliable"
+, booktitle =   "ICALP"
+, month =       jul
+, year =        1992
+, pages =       "235--246"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{dhkp-rracp-93
-, author =	"M. Dietzfelbinger and T. Hagerup and J. Katajainen and M. Penttonen"
-, title =	"A reliable randomized algorithm for the closest-pair problem"
-, type =	"Report"
-, number =	513
-, institution =	"Dept. Comput. Sci., Univ. Dortmund"
-, address =	"Dortmund, Germany"
-, year =	1993
-, update =	"94.05 smid"
+, author =      "M. Dietzfelbinger and T. Hagerup and J. Katajainen and M. Penttonen"
+, title =       "A reliable randomized algorithm for the closest-pair problem"
+, type =        "Report"
+, number =      513
+, institution = "Dept. Comput. Sci., Univ. Dortmund"
+, address =     "Dortmund, Germany"
+, year =        1993
+, update =      "94.05 smid"
 }
 
 @article{dhkp-rracp-97
-, author =	"M. Dietzfelbinger and T. Hagerup and J. Katajainen and M. Penttonen"
-, title =	"A reliable randomized algorithm for the closest-pair problem"
-, journal =	"J. Algorithms"
-, volume =	25
-, year =	1997
-, pages =	"19--51"
-, update =	"97.11 smid"
+, author =      "M. Dietzfelbinger and T. Hagerup and J. Katajainen and M. Penttonen"
+, title =       "A reliable randomized algorithm for the closest-pair problem"
+, journal =     "J. Algorithms"
+, volume =      25
+, year =        1997
+, pages =       "19--51"
+, update =      "97.11 smid"
 }
 
 @inproceedings{dkmmrt-dphul-88
-, author =	"M. Dietzfelbinger and A. Karlin and K. Mehlhorn and F. {Meyer auf der Heide} and H. Rohnert and R. E. Tarjan"
-, title =	"Dynamic perfect hashing --- upper and lower bounds"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"524--531"
-, update =	"93.09 erickson"
+, author =      "M. Dietzfelbinger and A. Karlin and K. Mehlhorn and F. {Meyer auf der Heide} and H. Rohnert and R. E. Tarjan"
+, title =       "Dynamic perfect hashing --- upper and lower bounds"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "524--531"
+, update =      "93.09 erickson"
 }
 
 @article{dkmmrt-dphul-94
-, author =	"M. Dietzfelbinger and A. Karlin and K. Mehlhorn and F. {Meyer auf der Heide} and H. Rohnert and R. E. Tarjan"
-, title =	"Dynamic perfect hashing: upper and lower bounds"
-, journal =	"SIAM J. Comput."
-, volume =	23
-, year =	1994
-, pages =	"738--761"
-, update =	"98.03 smid"
+, author =      "M. Dietzfelbinger and A. Karlin and K. Mehlhorn and F. {Meyer auf der Heide} and H. Rohnert and R. E. Tarjan"
+, title =       "Dynamic perfect hashing: upper and lower bounds"
+, journal =     "SIAM J. Comput."
+, volume =      23
+, year =        1994
+, pages =       "738--761"
+, update =      "98.03 smid"
 }
 
 @misc{dm-tlbai-86
-, author =	"M. Dietzfelbinger and W. Maass"
-, title =	"Two lower bound arguments with inaccessible numbers"
-, year =	1986
-, pages =	"163--183"
-, keywords =	"lower bounds"
-, update =	"95.09 korneenko"
+, author =      "M. Dietzfelbinger and W. Maass"
+, title =       "Two lower bound arguments with inaccessible numbers"
+, year =        1986
+, pages =       "163--183"
+, keywords =    "lower bounds"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{dm-nuchf-90
-, author =	"M. Dietzfelbinger and F. {Meyer auf der Heide}"
-, title =	"A new universal class of hash functions and dynamic hashing in real time"
-, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	443
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"6--19"
-, update =	"99.11 bibrelex, 98.11 bibrelex"
+, author =      "M. Dietzfelbinger and F. {Meyer auf der Heide}"
+, title =       "A new universal class of hash functions and dynamic hashing in real time"
+, booktitle =   "Proc. 17th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      443
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "6--19"
+, update =      "99.11 bibrelex, 98.11 bibrelex"
 }
 
 @inproceedings{dm-sesms-93
-, author =	"M. Dietzfelbinger and F. {Meyer auf der Heide}"
-, title =	"Simple, Efficient Shared Memory Simulations"
-, booktitle =	"Proc. 5th ACM Sympos. Parallel Algorithms Architect."
-, year =	1993
-, pages =	"110--119"
-, update =	"96.09 orourke"
+, author =      "M. Dietzfelbinger and F. {Meyer auf der Heide}"
+, title =       "Simple, Efficient Shared Memory Simulations"
+, booktitle =   "Proc. 5th ACM Sympos. Parallel Algorithms Architect."
+, year =        1993
+, pages =       "110--119"
+, update =      "96.09 orourke"
 }
 
 % yes, "connexion"
 @article{d-ntpcg-59
-, author =	"E. W. Dijkstra"
-, title =	"A Note on Two Problems in Connexion with Graphs"
-, journal =	"Numerische Mathematik"
-, volume =	1
-, year =	1959
-, pages =	"269--271"
-, update =	"93.09 rote"
+, author =      "E. W. Dijkstra"
+, title =       "A Note on Two Problems in Connexion with Graphs"
+, journal =     "Numerische Mathematik"
+, volume =      1
+, year =        1959
+, pages =       "269--271"
+, update =      "93.09 rote"
 }
 
 @incollection{d-pchtd-77
-, author =	"E. W. Dijkstra"
-, title =	"The problem of the convex hull in three dimensions"
-, chapter =	24
-, editor =	"E. W. Dijkstra"
-, booktitle =	"A Discipline of Programming"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1977
-, pages =	"168--191"
+, author =      "E. W. Dijkstra"
+, title =       "The problem of the convex hull in three dimensions"
+, chapter =     24
+, editor =      "E. W. Dijkstra"
+, booktitle =   "A Discipline of Programming"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1977
+, pages =       "168--191"
 }
 
 @inproceedings{ddsv-espgt-88
-, author =	"K. Diks and H. N. Dijdjev and O. Sykora and I. Vrto"
-, title =	"Edge separators for planar graphs and their applications"
-, booktitle =	"Proc. 13th Internat. Sympos. Math. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	324
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"280--290"
-, update =	"98.03 bibrelex"
+, author =      "K. Diks and H. N. Dijdjev and O. Sykora and I. Vrto"
+, title =       "Edge separators for planar graphs and their applications"
+, booktitle =   "Proc. 13th Internat. Sympos. Math. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      324
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "280--290"
+, update =      "98.03 bibrelex"
 }
 
 @article{d-fpfnh-93
-, author =	"K. Dill"
-, title =	"Folding proteins: {Finding} a needle in a haystack"
-, journal =	"Current Opinion in Structural Biology"
-, volume =	3
-, year =	1993
-, pages =	"99--103"
-, update =	"98.07 bibrelex"
+, author =      "K. Dill"
+, title =       "Folding proteins: {Finding} a needle in a haystack"
+, journal =     "Current Opinion in Structural Biology"
+, volume =      3
+, year =        1993
+, pages =       "99--103"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{d-nhndt-86
-, author =	"M. Dillencourt"
-, title =	"A non-{Hamiltonian}, nondegenerate {Delaunay} Triangulation"
-, type =	"Technical {Report}"
-, number =	"CS-TR-1732"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "M. Dillencourt"
+, title =       "A non-{Hamiltonian}, nondegenerate {Delaunay} Triangulation"
+, type =        "Technical {Report}"
+, number =      "CS-TR-1732"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @techreport{d-tdt-87t
-, author =	"M. Dillencourt"
-, title =	"Toughness and {Delaunay} Triangulations"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1987
-, note =	"In preparation"
-, update =	"98.03 bibrelex"
+, author =      "M. Dillencourt"
+, title =       "Toughness and {Delaunay} Triangulations"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1987
+, note =        "In preparation"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{dms-mnitp-93
-, author =	"M. Dillencourt and D. M. Mount and A. Saalfeld"
-, title =	"On the maximum number of intersections of two polyhedra in $2$ and $3$ dimensions"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"49--54"
-, cites =	"fdfh-cgpp-90, ps-cgi-85, ZZZ"
-, update =	"98.11 bibrelex, 95.09 agarwal, 93.09 milone+mitchell"
+, author =      "M. Dillencourt and D. M. Mount and A. Saalfeld"
+, title =       "On the maximum number of intersections of two polyhedra in $2$ and $3$ dimensions"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "49--54"
+, cites =       "fdfh-cgpp-90, ps-cgi-85, ZZZ"
+, update =      "98.11 bibrelex, 95.09 agarwal, 93.09 milone+mitchell"
 }
 
 @article{d-nhndt-87
-, author =	"M. B. Dillencourt"
-, title =	"A non-{Hamiltonian}, nondegenerate {Delaunay} triangulation"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"149--151"
+, author =      "M. B. Dillencourt"
+, title =       "A non-{Hamiltonian}, nondegenerate {Delaunay} triangulation"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "149--151"
 }
 
 @techreport{d-ubsei-87
-, author =	"M. B. Dillencourt"
-, title =	"An upper bound on the shortness exponent of inscribable polytopes"
-, type =	"Report"
-, number =	"CS-TR-1868"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1987
+, author =      "M. B. Dillencourt"
+, title =       "An upper bound on the shortness exponent of inscribable polytopes"
+, type =        "Report"
+, number =      "CS-TR-1868"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1987
 }
 
 @article{d-ubsei-89
-, author =	"M. B. Dillencourt"
-, title =	"An upper bound on the shortness exponent of inscribable polytopes"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	46
-, number =	1
-, month =	feb
-, year =	1989
-, pages =	"66--83"
-, update =	"98.11 bibrelex"
+, author =      "M. B. Dillencourt"
+, title =       "An upper bound on the shortness exponent of inscribable polytopes"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      46
+, number =      1
+, month =       feb
+, year =        1989
+, pages =       "66--83"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{d-fhcdt-92
-, author =	"M. B. Dillencourt"
-, title =	"Finding {Hamiltonian} cycles in {Delaunay} triangulations is {NP}-complete"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"223--228"
+, author =      "M. B. Dillencourt"
+, title =       "Finding {Hamiltonian} cycles in {Delaunay} triangulations is {NP}-complete"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "223--228"
 }
 
 @techreport{d-gtpaidt-88
-, author =	"M. B. Dillencourt"
-, title =	"Graph-Theoretical Properties of Algorithms Involving {D}elaunay Triangulations"
-, number =	"CS-TR-2059"
-, institution =	"Institute for Advanced Computer Studies, University of Maryland"
-, year =	1988
-, update =	"98.07 tamassia+vismara"
+, author =      "M. B. Dillencourt"
+, title =       "Graph-Theoretical Properties of Algorithms Involving {D}elaunay Triangulations"
+, number =      "CS-TR-2059"
+, institution = "Institute for Advanced Computer Studies, University of Maryland"
+, year =        1988
+, update =      "98.07 tamassia+vismara"
 }
 
 @article{d-hcptn-90
-, author =	"M. B. Dillencourt"
-, title =	"Hamiltonian cycles in planar triangulations with no separating triangles"
-, journal =	"J. Graph Theory"
-, volume =	14
-, number =	1
-, year =	1990
-, pages =	"31--49"
-, update =	"98.11 bibrelex"
+, author =      "M. B. Dillencourt"
+, title =       "Hamiltonian cycles in planar triangulations with no separating triangles"
+, journal =     "J. Graph Theory"
+, volume =      14
+, number =      1
+, year =        1990
+, pages =       "31--49"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{d-psoth-
-, author =	"M. B. Dillencourt"
-, title =	"Polytopes of small order and their {Hamiltonian} properties"
-, type =	"Technical {Report}"
-, institution =	"Univ. California"
-, address =	"Irvine, CA"
-, year =	"??"
-, update =	"97.11 bibrelex"
+, author =      "M. B. Dillencourt"
+, title =       "Polytopes of small order and their {Hamiltonian} properties"
+, type =        "Technical {Report}"
+, institution = "Univ. California"
+, address =     "Irvine, CA"
+, year =        "??"
+, update =      "97.11 bibrelex"
 }
 
 @article{d-rdt-90
-, author =	"M. B. Dillencourt"
-, title =	"Realizability of {Delaunay} triangulations"
-, journal =	"Inform. Process. Lett."
-, volume =	33
-, number =	6
-, month =	feb
-, year =	1990
-, pages =	"283--287"
-, update =	"98.11 bibrelex"
+, author =      "M. B. Dillencourt"
+, title =       "Realizability of {Delaunay} triangulations"
+, journal =     "Inform. Process. Lett."
+, volume =      33
+, number =      6
+, month =       feb
+, year =        1990
+, pages =       "283--287"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{d-tdt-87
-, author =	"M. B. Dillencourt"
-, title =	"Toughness and {Delaunay} triangulations"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, site =	"Waterloo, ON"
-, year =	1987
-, pages =	"186--194"
-, precedes =	"d-tdt-90"
-, cites =	"b-hg-78, b-gstds-84, b-vdch-79, c-tghc-73, d-slsv-34, d-tscan-87, d-nhndt-86, d-tdt-87t, es-vda-85, h-gt-69, k-tscan-83, obw-cdnh-84, ps-cgi-85, s-cg-78, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "M. B. Dillencourt"
+, title =       "Toughness and {Delaunay} triangulations"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, site =        "Waterloo, ON"
+, year =        1987
+, pages =       "186--194"
+, precedes =    "d-tdt-90"
+, cites =       "b-hg-78, b-gstds-84, b-vdch-79, c-tghc-73, d-slsv-34, d-tscan-87, d-nhndt-86, d-tdt-87t, es-vda-85, h-gt-69, k-tscan-83, obw-cdnh-84, ps-cgi-85, s-cg-78, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{d-tdt-90
-, author =	"M. B. Dillencourt"
-, title =	"Toughness and {Delaunay} triangulations"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"575--601"
-, succeeds =	"d-tdt-87"
+, author =      "M. B. Dillencourt"
+, title =       "Toughness and {Delaunay} triangulations"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "575--601"
+, succeeds =    "d-tdt-87"
 }
 
 @article{d-tscan-87
-, author =	"M. B. Dillencourt"
-, title =	"Traveling salesman cycles are not always subgraphs of {Delaunay} triangulations or of minimum weight triangulations"
-, journal =	"Inform. Process. Lett."
-, volume =	24
-, year =	1987
-, pages =	"339--342"
+, author =      "M. B. Dillencourt"
+, title =       "Traveling salesman cycles are not always subgraphs of {Delaunay} triangulations or of minimum weight triangulations"
+, journal =     "Inform. Process. Lett."
+, volume =      24
+, year =        1987
+, pages =       "339--342"
 }
 
 @techreport{dmn-rass-90
-, author =	"M. B. Dillencourt and D. M. Mount and N. S. Netanyahu"
-, title =	"A randomized algorithm for slope selection"
-, type =	"report"
-, number =	"CS-TR-2431"
-, institution =	"University of Maryland"
-, address =	"College Park, MD"
-, month =	mar
-, year =	1990
-, precedes =	"dmn-rass-91, dmn-rass-92"
-, update =	"98.07 bibrelex"
+, author =      "M. B. Dillencourt and D. M. Mount and N. S. Netanyahu"
+, title =       "A randomized algorithm for slope selection"
+, type =        "report"
+, number =      "CS-TR-2431"
+, institution = "University of Maryland"
+, address =     "College Park, MD"
+, month =       mar
+, year =        1990
+, precedes =    "dmn-rass-91, dmn-rass-92"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{dmn-rass-91
-, author =	"M. B. Dillencourt and D. M. Mount and N. S. Netanyahu"
-, title =	"A randomized algorithm for slope selection"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"135--140"
-, succeeds =	"dmn-rass-90"
-, cites =	"ahu-daca-74, b-etsh-90, csss-otass-89, dba-nm-74, dmn-rass-90, dh-nbp-83, em-sstcd-90, es-cmsrl-90, iky-ltall-89, m-ltalp-83, r-msr-84, s-gspi-76, ss-tseal-87, t-mlpra1-50, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "M. B. Dillencourt and D. M. Mount and N. S. Netanyahu"
+, title =       "A randomized algorithm for slope selection"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "135--140"
+, succeeds =    "dmn-rass-90"
+, cites =       "ahu-daca-74, b-etsh-90, csss-otass-89, dba-nm-74, dmn-rass-90, dh-nbp-83, em-sstcd-90, es-cmsrl-90, iky-ltall-89, m-ltalp-83, r-msr-84, s-gspi-76, ss-tseal-87, t-mlpra1-50, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{dmn-rass-92
-, author =	"M. B. Dillencourt and D. M. Mount and N. S. Netanyahu"
-, title =	"A randomized algorithm for slope selection"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, year =	1992
-, pages =	"1--27"
-, keywords =	"slope selection, randomized algorithm, Theil Sen estimator, line fitting, robust estimation"
-, succeeds =	"dmn-rass-90, dmn-rass-91"
-, update =	"98.07 bibrelex"
+, author =      "M. B. Dillencourt and D. M. Mount and N. S. Netanyahu"
+, title =       "A randomized algorithm for slope selection"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, year =        1992
+, pages =       "1--27"
+, keywords =    "slope selection, randomized algorithm, Theil Sen estimator, line fitting, robust estimation"
+, succeeds =    "dmn-rass-90, dmn-rass-91"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{drs-csdtp-91
-, author =	"M. B. Dillencourt and I. Rivin and W. D. Smith"
-, title =	"Combinatorial structure of {Delaunay} triangulations of the plane"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "M. B. Dillencourt and I. Rivin and W. D. Smith"
+, title =       "Combinatorial structure of {Delaunay} triangulations of the plane"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ds-erbms-88
-, author =	"M. B. Dillencourt and H. Samet."
-, title =	"Extracting Region Boundaries from Maps Stored as Linear Quadtrees"
-, booktitle =	"Proc. 3rd Internat. Sympos. Spatial Data Handling"
-, site =	"Sydney, Australia"
-, month =	aug
-, year =	1988
-, pages =	"65--77"
-, update =	"96.05 efrat"
+, author =      "M. B. Dillencourt and H. Samet."
+, title =       "Extracting Region Boundaries from Maps Stored as Linear Quadtrees"
+, booktitle =   "Proc. 3rd Internat. Sympos. Spatial Data Handling"
+, site =        "Sydney, Australia"
+, month =       aug
+, year =        1988
+, pages =       "65--77"
+, update =      "96.05 efrat"
 }
 
 @article{ds-utseb-96
-, author =	"M. B. Dillencourt and H. Samet"
-, title =	"Using Topological Sweep To Extract the Boundaries of Regions in Maps Represented by Region Quadtrees"
-, journal =	"Algorithmica"
-, volume =	15
-, number =	1
-, month =	jan
-, year =	1996
-, pages =	"82--102"
-, update =	"96.05 efrat"
+, author =      "M. B. Dillencourt and H. Samet"
+, title =       "Using Topological Sweep To Extract the Boundaries of Regions in Maps Represented by Region Quadtrees"
+, journal =     "Algorithmica"
+, volume =      15
+, number =      1
+, month =       jan
+, year =        1996
+, pages =       "82--102"
+, update =      "96.05 efrat"
 }
 
 @article{dst-gaccl-92
-, author =	"M. B. Dillencourt and H. Samet and M. Tamminen"
-, title =	"A general approach to connected--component labeling for arbitrary image representations"
-, journal =	"J. ACM"
-, volume =	39
-, number =	2
-, month =	apr
-, year =	1992
-, pages =	"253--280"
-, comments =	"also Corrigendum, Journal of the ACM 39:4 (October 1992), 985;
-	University of Maryland Computer Science TR-2303"
-, update =	"96.05 efrat"
+, author =      "M. B. Dillencourt and H. Samet and M. Tamminen"
+, title =       "A general approach to connected--component labeling for arbitrary image representations"
+, journal =     "J. ACM"
+, volume =      39
+, number =      2
+, month =       apr
+, year =        1992
+, pages =       "253--280"
+, comments =    "also Corrigendum, Journal of the ACM 39:4 (October 1992), 985;
+        University of Maryland Computer Science TR-2303"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{ds-ltati-92
-, author =	"M. B. Dillencourt and W. D. Smith"
-, title =	"A linear-time algorithm for testing the inscribability of trivalent polyhedra"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"177--185"
-, precedes =	"ds-ltati-95"
-, cites =	"b-vdch-79, c-tghc-73, cfg-upg-90, d-psoth-, d-tdt-90, drs-csdtp-91, ds-gtpig-, e-acg-87, f-dpsds-82, g-cp-67, gs-spp-87, hrs-cchpc-92, nc-pgta-88, ps-cgi-85, r-giph3-, r-ciph3-92, rs-ig-91, s-ptadi-92, s-sedag-81, ZZZ"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 96.09 devillers"
+, author =      "M. B. Dillencourt and W. D. Smith"
+, title =       "A linear-time algorithm for testing the inscribability of trivalent polyhedra"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "177--185"
+, precedes =    "ds-ltati-95"
+, cites =       "b-vdch-79, c-tghc-73, cfg-upg-90, d-psoth-, d-tdt-90, drs-csdtp-91, ds-gtpig-, e-acg-87, f-dpsds-82, g-cp-67, gs-spp-87, hrs-cchpc-92, nc-pgta-88, ps-cgi-85, r-giph3-, r-ciph3-92, rs-ig-91, s-ptadi-92, s-sedag-81, ZZZ"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 96.09 devillers"
 }
 
 @article{ds-ltati-95
-, author =	"M. B. Dillencourt and W. D. Smith"
-, title =	"A linear-time algorithm for testing the inscribability of trivalent polyhedra"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"21--36"
-, keywords =	"inscribability, polyhedra, toughness, planar graphs, Delaunay triangulation"
-, succeeds =	"ds-ltati-92"
-, update =	"96.09 devillers"
+, author =      "M. B. Dillencourt and W. D. Smith"
+, title =       "A linear-time algorithm for testing the inscribability of trivalent polyhedra"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "21--36"
+, keywords =    "inscribability, polyhedra, toughness, planar graphs, Delaunay triangulation"
+, succeeds =    "ds-ltati-92"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{ds-smrdd-93
-, author =	"M. B. Dillencourt and W. D. Smith"
-, title =	"A Simple Method for Resolving Degeneracies in {Delaunay} Triangulation"
-, booktitle =	"Proc. 20th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	700
-, publisher =	"Springer-Verlag"
-, month =	jul
-, year =	1993
-, pages =	"177--188"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell+rote"
+, author =      "M. B. Dillencourt and W. D. Smith"
+, title =       "A Simple Method for Resolving Degeneracies in {Delaunay} Triangulation"
+, booktitle =   "Proc. 20th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      700
+, publisher =   "Springer-Verlag"
+, month =       jul
+, year =        1993
+, pages =       "177--188"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell+rote"
 }
 
 @inproceedings{ds-gtcid-94
-, author =	"M. B. Dillencourt and W. D. Smith"
-, title =	"Graph-Theoretical Conditions for Inscribability and {Delaunay}Realizability"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"287--292"
-, cites =	"a-vdsfg-91, bll-cpt-93t, bm-gta-76, b-vdch-79, cn-hcpls-89, c-tghc-73, c-psepg-92, cl-hcdc-89, d-ubsei-89, d-rdt-90, d-tdt-90, d-fhcdt-92, ds-ltati-92, ds-smrdd-93, e-acg-87, e-dnng-92, e-hcsc-73, f-dpsds-82, g-cp-67, hr-cccph-93, hrs-cchpc-92, js-niqpr-91, ls-mogar-93, ms-tgmst-91, o-cgc2-87, py-nng-92, ps-cgi-85, r-ciph3-92, r-ahvfl-92, r-giph3-, rs-iphdd-91, rs-ig-91, s-sedag-81, t-pihhg-76, t-tppg-83, t-tpg-56, t-bhcpg-77, c-ig-69, gmr-vdmpp-92, ZZZ"
-, update =	"99.11 bibrelex, 98.11 bibrelex, 94.09 jones"
+, author =      "M. B. Dillencourt and W. D. Smith"
+, title =       "Graph-Theoretical Conditions for Inscribability and {Delaunay}Realizability"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "287--292"
+, cites =       "a-vdsfg-91, bll-cpt-93t, bm-gta-76, b-vdch-79, cn-hcpls-89, c-tghc-73, c-psepg-92, cl-hcdc-89, d-ubsei-89, d-rdt-90, d-tdt-90, d-fhcdt-92, ds-ltati-92, ds-smrdd-93, e-acg-87, e-dnng-92, e-hcsc-73, f-dpsds-82, g-cp-67, hr-cccph-93, hrs-cchpc-92, js-niqpr-91, ls-mogar-93, ms-tgmst-91, o-cgc2-87, py-nng-92, ps-cgi-85, r-ciph3-92, r-ahvfl-92, r-giph3-, rs-iphdd-91, rs-ig-91, s-sedag-81, t-pihhg-76, t-tppg-83, t-tpg-56, t-bhcpg-77, c-ig-69, gmr-vdmpp-92, ZZZ"
+, update =      "99.11 bibrelex, 98.11 bibrelex, 94.09 jones"
 }
 
 @techreport{ds-gtpig-
-, author =	"M. B. Dillencourt and W. D. Smith"
-, title =	"Graph-theoretical properties of inscribable graphs"
-, type =	"Technical {Report}"
-, institution =	"Univ. California"
-, address =	"Irvine, CA"
-, year =	"??"
-, update =	"97.11 bibrelex"
+, author =      "M. B. Dillencourt and W. D. Smith"
+, title =       "Graph-theoretical properties of inscribable graphs"
+, type =        "Technical {Report}"
+, institution = "Univ. California"
+, address =     "Irvine, CA"
+, year =        "??"
+, update =      "97.11 bibrelex"
 }
 
 @article{d-dtpos-50
-, author =	"R. P. Dilworth"
-, title =	"A decomposition theorem for partially ordered sets"
-, journal =	"Annals of Math."
-, volume =	51
-, year =	1950
-, pages =	"161--166"
-, update =	"97.11 bibrelex"
+, author =      "R. P. Dilworth"
+, title =       "A decomposition theorem for partially ordered sets"
+, journal =     "Annals of Math."
+, volume =      51
+, year =        1950
+, pages =       "161--166"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{di-rms-85
-, author =	"B. Dimsdale and A. Inselberg"
-, title =	"Representing multidimensional surfaces"
-, type =	"Report"
-, number =	"??"
-, institution =	"IBM Sci. Center"
-, address =	"Los Angeles, CA"
-, year =	1985
+, author =      "B. Dimsdale and A. Inselberg"
+, title =       "Representing multidimensional surfaces"
+, type =        "Report"
+, number =      "??"
+, institution = "IBM Sci. Center"
+, address =     "Los Angeles, CA"
+, year =        1985
 }
 
 @article{dm-fadds-90
-, author =	"C. Ding and P. Mateti"
-, title =	"A Framework for the Automated Drawing of Data Structure Diagrams"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	"SE-16"
-, number =	5
-, year =	1990
-, pages =	"543--557"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "C. Ding and P. Mateti"
+, title =       "A Framework for the Automated Drawing of Data Structure Diagrams"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      "SE-16"
+, number =      5
+, year =        1990
+, pages =       "543--557"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{dsw-bvcnh-
-, author =	"G. Ding and P. Seymour and P. Winkler"
-, title =	"Bounding the vertex cover number of a hypergraph"
-, journal =	"Combinatorica"
-, volume =	"??"
-, year =	"??"
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "G. Ding and P. Seymour and P. Winkler"
+, title =       "Bounding the vertex cover number of a hypergraph"
+, journal =     "Combinatorica"
+, volume =      "??"
+, year =        "??"
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @article{dr-alpac-87
-, author =	"R. Ding and J. R. Reay"
-, title =	"Areas of lattice polygons applied to computer graphics"
-, journal =	"Zastos. Math. (Poland)"
-, volume =	19
-, number =	"3--4"
-, year =	1987
-, pages =	"547--556"
-, keywords =	"polygons, area, discrete geometry"
-, update =	"95.09 korneenko"
+, author =      "R. Ding and J. R. Reay"
+, title =       "Areas of lattice polygons applied to computer graphics"
+, journal =     "Zastos. Math. (Poland)"
+, volume =      19
+, number =      "3--4"
+, year =        1987
+, pages =       "547--556"
+, keywords =    "polygons, area, discrete geometry"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{dw-kdhem-93
-, author =	"Y. Ding and M. A. Weiss"
-, title =	"The $k$-D Heap: An Efficient Multi-Dimensional Priority Queue"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, year =	1993
-, pages =	"302--313"
-, update =	"93.09 smid, 93.05 jones"
+, author =      "Y. Ding and M. A. Weiss"
+, title =       "The $k$-D Heap: An Efficient Multi-Dimensional Priority Queue"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, year =        1993
+, pages =       "302--313"
+, update =      "93.09 smid, 93.05 jones"
 }
 
 @article{d-aspmf-70
-, author =	"E. A. Dinitz"
-, title =	"Algorithm for solution of a problem of maximum flow in a network with power estimation"
-, journal =	"Soviet Math. Dokl."
-, volume =	"??"
-, year =	1970
-, pages =	"248--264"
-, update =	"97.11 bibrelex"
+, author =      "E. A. Dinitz"
+, title =       "Algorithm for solution of a problem of maximum flow in a network with power estimation"
+, journal =     "Soviet Math. Dokl."
+, volume =      "??"
+, year =        1970
+, pages =       "248--264"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{dv-ccvsg-94
-, author =	"Ye. Dinitz and A. Vainshtein"
-, title =	"The Connectivity Carcass of a Vertex Subset in a Graph and its Incremental Maintenance"
-, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	"716--725"
-, update =	"95.05 tamassia"
+, author =      "Ye. Dinitz and A. Vainshtein"
+, title =       "The Connectivity Carcass of a Vertex Subset in a Graph and its Incremental Maintenance"
+, booktitle =   "Proc. 26th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       "716--725"
+, update =      "95.05 tamassia"
 }
 
 @article{d-udrdp-50
-, author =	"G. L. Dirichlet"
-, title =	"{\"U}ber die {Reduktion} der positiven quadratischen {Formen} mit drei unbestimmten ganzen {Zahlen}"
-, journal =	"J. Reine Angew. Math."
-, volume =	40
-, year =	1850
-, pages =	"209--227"
-, keywords =	"Voronoi diagrams"
-, update =	"00.03 bibrelex, 93.09 held"
-, annote =	"Voronoi diagrams used for the first time"
+, author =      "G. L. Dirichlet"
+, title =       "{\"U}ber die {Reduktion} der positiven quadratischen {Formen} mit drei unbestimmten ganzen {Zahlen}"
+, journal =     "J. Reine Angew. Math."
+, volume =      40
+, year =        1850
+, pages =       "209--227"
+, keywords =    "Voronoi diagrams"
+, update =      "00.03 bibrelex, 93.09 held"
+, annote =      "Voronoi diagrams used for the first time"
 }
 
 @article{do-lbsri-85
-, author =	"E. Dittert and M. J. {O'Donnell}"
-, title =	"Lower bounds for sorting with realistic instruction sets"
-, journal =	"IEEE Trans. Comput."
-, volume =	34
-, year =	1985
-, pages =	"311--317"
-, keywords =	"lower bounds"
-, update =	"95.09 korneenko"
+, author =      "E. Dittert and M. J. {O'Donnell}"
+, title =       "Lower bounds for sorting with realistic instruction sets"
+, journal =     "IEEE Trans. Comput."
+, volume =      34
+, year =        1985
+, pages =       "311--317"
+, keywords =    "lower bounds"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{dr-ctmep-96
-, author =	"A. A. Diwan and S. Rane and S. Seshadri and S. Sudarshan"
-, title =	"Clustering Techniques for Minimizing External Path Length."
-, booktitle =	"Proceedings of the International Conference on Very Large Databases"
-, publisher =	"Morgan Kauffman"
-, year =	1996
-, update =	"98.07 agarwal"
+, author =      "A. A. Diwan and S. Rane and S. Seshadri and S. Sudarshan"
+, title =       "Clustering Techniques for Minimizing External Path Length."
+, booktitle =   "Proceedings of the International Conference on Very Large Databases"
+, publisher =   "Morgan Kauffman"
+, year =        1996
+, update =      "98.07 agarwal"
 }
 
 @article{dk-ebsrs-88
-, author =	"T. I. Dix and D. H. Kieronska"
-, title =	"Errors between sites in restriction site mapping"
-, journal =	"Comput. Appl. Biol. Sci."
-, volume =	4
-, number =	1
-, year =	1988
-, pages =	"117--123"
-, update =	"97.11 bibrelex"
+, author =      "T. I. Dix and D. H. Kieronska"
+, title =       "Errors between sites in restriction site mapping"
+, journal =     "Comput. Appl. Biol. Sci."
+, volume =      4
+, number =      1
+, year =        1988
+, pages =       "117--123"
+, update =      "97.11 bibrelex"
 }
 
 @article{d-etqti-08
-, author =	"A. Dixon"
-, title =	"The Eliminant of Three Quantics in Two Independent Variables"
-, journal =	"Proc. London Math. Soc."
-, volume =	2
-, number =	6
-, year =	1908
-, pages =	"468--478"
-, update =	"98.03 bibrelex"
+, author =      "A. Dixon"
+, title =       "The Eliminant of Three Quantics in Two Independent Variables"
+, journal =     "Proc. London Math. Soc."
+, volume =      2
+, number =      6
+, year =        1908
+, pages =       "468--478"
+, update =      "98.03 bibrelex"
 }
 
 @article{dkw-dsatg-94
-, author =	"A. R. Dixon and G. H. Kirby and D. P. M. Wills"
-, title =	"A Data Structure for Artificial Terrain Generation"
-, journal =	"Comput. Graph. Forum"
-, volume =	13
-, number =	1
-, month =	mar
-, year =	1994
-, pages =	"37--48"
-, update =	"96.01 held"
+, author =      "A. R. Dixon and G. H. Kirby and D. P. M. Wills"
+, title =       "A Data Structure for Artificial Terrain Generation"
+, journal =     "Comput. Graph. Forum"
+, volume =      13
+, number =      1
+, month =       mar
+, year =        1994
+, pages =       "37--48"
+, update =      "96.01 held"
 }
 
 @inproceedings{dl-cvdrp-91
-, author =	"H. Djidjev and A. Lingas"
-, title =	"On computing the {Voronoi} diagram for restricted planar figures"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"54--64"
-, keywords =	"Voronoi diagram, Delaunay triangulation, simple polygon, histogram"
-, precedes =	"dl-cvdsp-95"
-, update =	"96.09 devillers"
+, author =      "H. Djidjev and A. Lingas"
+, title =       "On computing the {Voronoi} diagram for restricted planar figures"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "54--64"
+, keywords =    "Voronoi diagram, Delaunay triangulation, simple polygon, histogram"
+, precedes =    "dl-cvdsp-95"
+, update =      "96.09 devillers"
 }
 
 @article{dl-cvdsp-95
-, author =	"H. Djidjev and A. Lingas"
-, title =	"On computing {Voronoi} diagrams for sorted point sets"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"327--337"
-, keywords =	"Voronoi diagram, Delaunay triangulation, monotone histogram, tine complexity"
-, succeeds =	"dl-cvdrp-91"
-, update =	"96.09 devillers"
+, author =      "H. Djidjev and A. Lingas"
+, title =       "On computing {Voronoi} diagrams for sorted point sets"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "327--337"
+, keywords =    "Voronoi diagram, Delaunay triangulation, monotone histogram, tine complexity"
+, succeeds =    "dl-cvdrp-91"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{d-lamps-95
-, author =	"H. N. Djidjev"
-, title =	"A Linear Algorithm for the Maximal Planar Subgraph Problem"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"369--380"
-, keywords =	"graph drawing, planarization"
-, update =	"99.07 bibrelex, 95.05 tamassia"
+, author =      "H. N. Djidjev"
+, title =       "A Linear Algorithm for the Maximal Planar Subgraph Problem"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "369--380"
+, keywords =    "graph drawing, planarization"
+, update =      "99.07 bibrelex, 95.05 tamassia"
 }
 
 @inproceedings{d-dgcp-95
-, author =	"H. N. Djidjev"
-, title =	"On Drawing a Graph Convexly in the Plane"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"76--83"
-, keywords =	"graph drawing, planar, straight-line"
-, update =	"95.01 tamassia"
+, author =      "H. N. Djidjev"
+, title =       "On Drawing a Graph Convexly in the Plane"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "76--83"
+, keywords =    "graph drawing, planar, straight-line"
+, update =      "95.01 tamassia"
 }
 
 @article{d-pppg-82
-, author =	"H. N. Djidjev"
-, title =	"On the problem of partitioning planar graphs"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	3
-, number =	2
-, year =	1982
-, pages =	"229--240"
-, update =	"97.11 bibrelex"
+, author =      "H. N. Djidjev"
+, title =       "On the problem of partitioning planar graphs"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      3
+, number =      2
+, year =        1982
+, pages =       "229--240"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{dls-oaclc-88
-, author =	"H. N. Djidjev and A. Lingas and J. Sack"
-, title =	"An {$O(n\log n)$} algorithm for computing the link center of a simple polygon"
-, number =	"SCS-TR-148"
-, institution =	"School of Computer Science, Carleton University"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "H. N. Djidjev and A. Lingas and J. Sack"
+, title =       "An {$O(n\log n)$} algorithm for computing the link center of a simple polygon"
+, number =      "SCS-TR-148"
+, institution = "School of Computer Science, Carleton University"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{dls-oaclc-89
-, author =	"H. N. Djidjev and A. Lingas and J. Sack"
-, title =	"An {$O(n\log n)$} algorithm for computing the link center of a simple polygon"
-, editor =	"B. Monien and R. Cori"
-, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	349
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"96--107"
-, keywords =	"link distance"
+, author =      "H. N. Djidjev and A. Lingas and J. Sack"
+, title =       "An {$O(n\log n)$} algorithm for computing the link center of a simple polygon"
+, editor =      "B. Monien and R. Cori"
+, booktitle =   "Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      349
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "96--107"
+, keywords =    "link distance"
 }
 
 @article{dls-oaclc-92
-, author =	"H. N. Djidjev and A. Lingas and J. Sack"
-, title =	"An {$O(n\log n)$} algorithm for computing the link center of a simple polygon"
-, journal =	"Discrete Comput. Geom."
-, volume =	8
-, number =	2
-, year =	1992
-, pages =	"131--152"
-, keywords =	"visibility"
-, update =	"94.09 orourke"
+, author =      "H. N. Djidjev and A. Lingas and J. Sack"
+, title =       "An {$O(n\log n)$} algorithm for computing the link center of a simple polygon"
+, journal =     "Discrete Comput. Geom."
+, volume =      8
+, number =      2
+, year =        1992
+, pages =       "131--152"
+, keywords =    "visibility"
+, update =      "94.09 orourke"
 }
 
 @inproceedings{dpz-cspdp-91
-, author =	"H. N. Djidjev and G. E. Pantziou and C. D. Zaroliagis"
-, title =	"Computing Shortest Paths and Distances in Planar Graphs"
-, booktitle =	"Proc. 18th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	510
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"327--338"
-, keywords =	"Dijkstra, on-line"
-, update =	"93.09 rote"
+, author =      "H. N. Djidjev and G. E. Pantziou and C. D. Zaroliagis"
+, title =       "Computing Shortest Paths and Distances in Planar Graphs"
+, booktitle =   "Proc. 18th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      510
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "327--338"
+, keywords =    "Dijkstra, on-line"
+, update =      "93.09 rote"
 }
 
 @inproceedings{dbs-gacpp-00
-, author =	"Martin Dlouh{\'y} and Franti{\v s}ek Brabec and Petr {\v S}vestka"
-, title =	"A Genetic Approach to the Cleaning Path Planning Problem"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"126--131"
-, update =	"00.03 bibrelex"
+, author =      "Martin Dlouh{\'y} and Franti{\v s}ek Brabec and Petr {\v S}vestka"
+, title =       "A Genetic Approach to the Cleaning Path Planning Problem"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "126--131"
+, update =      "00.03 bibrelex"
 }
 
 @techreport{de-opstt-84
-, author =	"D. Dobkin and H. Edelsbrunner"
-, title =	"Organizing point sets in two and three dimensions"
-, type =	"Tech.\ Report"
-, number =	"F130"
-, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1984
-, update =	"97.07 agarwal"
+, author =      "D. Dobkin and H. Edelsbrunner"
+, title =       "Organizing point sets in two and three dimensions"
+, type =        "Tech.\ Report"
+, number =      "F130"
+, institution = "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1984
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{de-cd-93
-, author =	"D. Dobkin and D. Eppstein"
-, title =	"Computing the discrepancy"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"47--52"
-, cites =	"bc-id-87, cpc-drt-84, dm-redsp-93, eg-tsa-89, g-irt-89, h-ecqsp-60, hs-ompc-91, k-re-86, n-med-71, ol-mcp-81, oy-nubkm-91, r-id-54, s-id7-72, w-cildp-71, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "D. Dobkin and D. Eppstein"
+, title =       "Computing the discrepancy"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "47--52"
+, cites =       "bc-id-87, cpc-drt-84, dm-redsp-93, eg-tsa-89, g-irt-89, h-ecqsp-60, hs-ompc-91, k-re-86, n-med-71, ol-mcp-81, oy-nubkm-91, r-id-54, s-id7-72, w-cildp-71, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{dhks-cidp-93
-, author =	"D. Dobkin and J. Hershberger and D. Kirkpatrick and Subhash Suri"
-, title =	"Computing the intersection-depth of polyhedra"
-, journal =	"Algorithmica"
-, volume =	9
-, year =	1993
-, pages =	"518--533"
-, update =	"98.03 mitchell, 96.05 ramkumar"
+, author =      "D. Dobkin and J. Hershberger and D. Kirkpatrick and Subhash Suri"
+, title =       "Computing the intersection-depth of polyhedra"
+, journal =     "Algorithmica"
+, volume =      9
+, year =        1993
+, pages =       "518--533"
+, update =      "98.03 mitchell, 96.05 ramkumar"
 }
 
 @inproceedings{dhks-isccd-90
-, author =	"D. Dobkin and J. Hershberger and D. Kirkpatrick and Subhash Suri"
-, title =	"Implicitly searching convolutions and computing depth of collision"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"165--180"
-, update =	"98.03 mitchell"
+, author =      "D. Dobkin and J. Hershberger and D. Kirkpatrick and Subhash Suri"
+, title =       "Implicitly searching convolutions and computing depth of collision"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "165--180"
+, update =      "98.03 mitchell"
 }
 
 @article{dlr-lpils-79
-, author =	"D. Dobkin and R. J. Lipton and S. Reiss"
-, title =	"Linear programming is log-space hard for {$P$}"
-, journal =	"Inform. Process. Lett."
-, volume =	8
-, year =	1979
-, pages =	"96--97"
+, author =      "D. Dobkin and R. J. Lipton and S. Reiss"
+, title =       "Linear programming is log-space hard for {$P$}"
+, journal =     "Inform. Process. Lett."
+, volume =      8
+, year =        1979
+, pages =       "96--97"
 }
 
 @inproceedings{dm-redsp-93
-, author =	"D. Dobkin and D. Mitchell"
-, title =	"Random-edge discrepancy of supersampling patterns"
-, booktitle =	"Graphics Interface '93"
-, year =	1993
-, keywords =	"discrepancy"
-, update =	"97.03 schwarzkopf"
+, author =      "D. Dobkin and D. Mitchell"
+, title =       "Random-edge discrepancy of supersampling patterns"
+, booktitle =   "Graphics Interface '93"
+, year =        1993
+, keywords =    "discrepancy"
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{dnt-vmss3-90
-, author =	"D. Dobkin and S. North and N. Thurston"
-, title =	"A viewer for Mathematical structures and surfaces in 3D"
-, booktitle =	"Sympos. on Interactive 3D Graphics"
-, month =	may
-, year =	1990
-, pages =	"141--142"
-, update =	"99.03 forrest, 98.11 bibrelex"
+, author =      "D. Dobkin and S. North and N. Thurston"
+, title =       "A viewer for Mathematical structures and surfaces in 3D"
+, booktitle =   "Sympos. on Interactive 3D Graphics"
+, month =       may
+, year =        1990
+, pages =       "141--142"
+, update =      "99.03 forrest, 98.11 bibrelex"
 }
 
 @techreport{dnt-sug-??
-, author =	"D. Dobkin and S. North and N. Thurston"
-, title =	"Salem User's Guide"
-, year =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "D. Dobkin and S. North and N. Thurston"
+, title =       "Salem User's Guide"
+, year =        "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{ds-dcmdf-89
-, author =	"D. Dobkin and Subhash Suri"
-, title =	"Dynamically computing the maxima of decomposable functions, with applications"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"488--493"
-, keywords =	"semi-online model, dynamization, amortized analysis"
-, precedes =	"ds-mge-91"
-, update =	"98.03 mitchell"
+, author =      "D. Dobkin and Subhash Suri"
+, title =       "Dynamically computing the maxima of decomposable functions, with applications"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "488--493"
+, keywords =    "semi-online model, dynamization, amortized analysis"
+, precedes =    "ds-mge-91"
+, update =      "98.03 mitchell"
 }
 
 @article{ds-mge-91
-, author =	"D. Dobkin and Subhash Suri"
-, title =	"Maintenance of geometric extrema"
-, journal =	"J. ACM"
-, volume =	38
-, year =	1991
-, pages =	"275--298"
-, keywords =	"semi-online model, dynamization, amortized analysis"
-, succeeds =	"ds-dcmdf-89"
-, update =	"98.03 mitchell"
+, author =      "D. Dobkin and Subhash Suri"
+, title =       "Maintenance of geometric extrema"
+, journal =     "J. ACM"
+, volume =      38
+, year =        1991
+, pages =       "275--298"
+, keywords =    "semi-online model, dynamization, amortized analysis"
+, succeeds =    "ds-dcmdf-89"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{dt-buph-93
-, author =	"D. Dobkin and A. Tal"
-, title =	"Building and using polyhedral hierarchies"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	394
-, keywords =	"video review"
-, cites =	"dk-ladsc-85, dk-dsppu-90, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "D. Dobkin and A. Tal"
+, title =       "Building and using polyhedral hierarchies"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       394
+, keywords =    "video review"
+, cites =       "dk-ladsc-85, dk-dsppu-90, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @inproceedings{dt-gascg-94
-, author =	"D. Dobkin and A. Tel"
-, title =	"GASP - an Animation System for Computational Geometry"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"243--249"
-, cites =	"-pltc-85, b-aa-87, b-eaub-88, b-zsaam-92a, bs-taa-85, ce-oails-92, dk-ladsc-85, dk-dsppu-90, dnt-vmss3-90, dt-buph-93, ekkmns-wcg-94, l-dpslu-86, mn-lledt-89, r-mdbp-91, s-mdbp-93, s-a-88, s-iipg-92, s-votcb-93, ss-otcbt-93, s-ptppm-90, s-tfsaa-90, tcd-njlsm-92, s-raplg-91t, ZZZ"
-, update =	"99.11 bibrelex, 99.03 forrest, 98.11 bibrelex, 94.09 jones"
+, author =      "D. Dobkin and A. Tel"
+, title =       "GASP - an Animation System for Computational Geometry"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "243--249"
+, cites =       "-pltc-85, b-aa-87, b-eaub-88, b-zsaam-92a, bs-taa-85, ce-oails-92, dk-ladsc-85, dk-dsppu-90, dnt-vmss3-90, dt-buph-93, ekkmns-wcg-94, l-dpslu-86, mn-lledt-89, r-mdbp-91, s-mdbp-93, s-a-88, s-iipg-92, s-votcb-93, ss-otcbt-93, s-ptppm-90, s-tfsaa-90, tcd-njlsm-92, s-raplg-91t, ZZZ"
+, update =      "99.11 bibrelex, 99.03 forrest, 98.11 bibrelex, 94.09 jones"
 }
 
 @article{dltw-ctpla-90
-, author =	"D. A. Dobkin and Silvio V. F. Levy and William P. Thurston and Allan R. Wilks"
-, title =	"Contour Tracing by Piecewise Linear Approximations"
-, journal =	"ACM Trans. Graph."
-, volume =	9
-, number =	4
-, month =	oct
-, year =	1990
-, pages =	"389--423"
-, annote =	"Algorithm for contour of a function that can be
-		 computed at any point. Space is (regularly)
-		 triangulated and a linear approximation is used on each
-		 simplex. Three goodness of triangle measures are
-		 considered: Minimize the number of triangles crossed by
-		 a random line (In 2D this is same as shortest
-		 diagonal). Minimize ratio of circum and in spheres.
-		 Minimize condition number of covariance matrix of a
-		 random point, uniformly distributed in a circle. (Ratio
-		 between largest and smallest eigenvalues.)"
+, author =      "D. A. Dobkin and Silvio V. F. Levy and William P. Thurston and Allan R. Wilks"
+, title =       "Contour Tracing by Piecewise Linear Approximations"
+, journal =     "ACM Trans. Graph."
+, volume =      9
+, number =      4
+, month =       oct
+, year =        1990
+, pages =       "389--423"
+, annote =      "Algorithm for contour of a function that can be
+                 computed at any point. Space is (regularly)
+                 triangulated and a linear approximation is used on each
+                 simplex. Three goodness of triangle measures are
+                 considered: Minimize the number of triangles crossed by
+                 a random line (In 2D this is same as shortest
+                 diagonal). Minimize ratio of circum and in spheres.
+                 Minimize condition number of covariance matrix of a
+                 random point, uniformly distributed in a circle. (Ratio
+                 between largest and smallest eigenvalues.)"
 }
 
 @article{d-cgcg-92
-, author =	"D. P. Dobkin"
-, title =	"Computational Geometry and Computer Graphics"
-, journal =	"Proc. IEEE"
-, volume =	80
-, number =	9
-, month =	sep
-, year =	1992
-, pages =	"1400--1411"
-, update =	"93.09 goodrich+held"
+, author =      "D. P. Dobkin"
+, title =       "Computational Geometry and Computer Graphics"
+, journal =     "Proc. IEEE"
+, volume =      80
+, number =      9
+, month =       sep
+, year =        1992
+, pages =       "1400--1411"
+, update =      "93.09 goodrich+held"
 }
 
 @incollection{d-cgtn-88
-, author =	"D. P. Dobkin"
-, title =	"Computational geometry: then and now"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"71--109"
-, keywords =	"survey paper, convex hull, design of algorithms"
-, update =	"99.11 bibrelex"
+, author =      "D. P. Dobkin"
+, title =       "Computational geometry: then and now"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "71--109"
+, keywords =    "survey paper, convex hull, design of algorithms"
+, update =      "99.11 bibrelex"
 }
 
 @techreport{d-kslcg-78
-, author =	"D. P. Dobkin"
-, title =	"Keyword structures in a language for computer geometry"
-, type =	"Report"
-, number =	"TM 78-1271-9"
-, institution =	"Bell Lab."
-, address =	"Murray Hill, NJ"
-, year =	1978
+, author =      "D. P. Dobkin"
+, title =       "Keyword structures in a language for computer geometry"
+, type =        "Report"
+, number =      "TM 78-1271-9"
+, institution = "Bell Lab."
+, address =     "Murray Hill, NJ"
+, year =        1978
 }
 
 @techreport{d-vag-??
-, author =	"D. P. Dobkin"
-, title =	"{VLSI}, algorithms and graphics"
-, type =	"Report"
-, number =	"??"
-, institution =	"Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	"??"
+, author =      "D. P. Dobkin"
+, title =       "{VLSI}, algorithms and graphics"
+, type =        "Report"
+, number =      "??"
+, institution = "Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        "??"
 }
 
 @incollection{ddg-fsp-83
-, author =	"David P. Dobkin and Robert L. {Drysdale, III} and Leonidas J. Guibas"
-, title =	"Finding Smallest Polygons"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"181--214"
-, keywords =	"optimization, smallest perimeter, convex polygon, $k$-gon, Voronoi diagrams, dynamic programming"
-, update =	"01.04 icking, 98.03 mitchell"
+, author =      "David P. Dobkin and Robert L. {Drysdale, III} and Leonidas J. Guibas"
+, title =       "Finding Smallest Polygons"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "181--214"
+, keywords =    "optimization, smallest perimeter, convex polygon, $k$-gon, Voronoi diagrams, dynamic programming"
+, update =      "01.04 icking, 98.03 mitchell"
 }
 
 @inproceedings{de-hstai-84
-, author =	"D. P. Dobkin and H. Edelsbrunner"
-, title =	"Ham-sandwich theorems applied to intersection problems"
-, booktitle =	"Proc. 10th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '84"
-, year =	1984
-, pages =	"88--99"
-, keywords =	"data structuring, discrete geometry, combinatorial geometry, partition, range search, trees, two-dimensional, three-dimensional"
-, update =	"98.07 bibrelex"
+, author =      "D. P. Dobkin and H. Edelsbrunner"
+, title =       "Ham-sandwich theorems applied to intersection problems"
+, booktitle =   "Proc. 10th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '84"
+, year =        1984
+, pages =       "88--99"
+, keywords =    "data structuring, discrete geometry, combinatorial geometry, partition, range search, trees, two-dimensional, three-dimensional"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{de-ssio-84
-, author =	"D. P. Dobkin and H. Edelsbrunner"
-, title =	"Space searching for intersecting objects"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1984
-, pages =	"387--392"
-, precedes =	"de-ssio-87"
+, author =      "D. P. Dobkin and H. Edelsbrunner"
+, title =       "Space searching for intersecting objects"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1984
+, pages =       "387--392"
+, precedes =    "de-ssio-87"
 }
 
 @article{de-ssio-87
-, author =	"D. P. Dobkin and H. Edelsbrunner"
-, title =	"Space searching for intersecting objects"
-, journal =	"J. Algorithms"
-, volume =	8
-, year =	1987
-, pages =	"348--361"
-, keywords =	"data structuring, discrete geometry, searching, intersection, partition, range search, geometric transformations, trees, two-dimensional, three-dimensional"
-, succeeds =	"de-ssio-84"
+, author =      "D. P. Dobkin and H. Edelsbrunner"
+, title =       "Space searching for intersecting objects"
+, journal =     "J. Algorithms"
+, volume =      8
+, year =        1987
+, pages =       "348--361"
+, keywords =    "data structuring, discrete geometry, searching, intersection, partition, range search, geometric transformations, trees, two-dimensional, three-dimensional"
+, succeeds =    "de-ssio-84"
 }
 
 @inproceedings{deo-secp-88
-, author =	"D. P. Dobkin and H. Edelsbrunner and M. H. Overmars"
-, title =	"Searching for empty convex polygons"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"224--228"
-, succeeds =	"ar-clecs-85"
-, precedes =	"deo-secp-90"
-, cites =	"ar-clecs-85, bf-eses-86, cgl-pgd-85, eg-tsa-86, eos-calha-86, e-cpgnt-79, h-kfiep-78, h-fvgsp-87, h-snec7-83, klp-fmsv-75, osv-swec6-88, ZZZ"
-, update =	"98.03 bibrelex, 93.09 milone+mitchell"
+, author =      "D. P. Dobkin and H. Edelsbrunner and M. H. Overmars"
+, title =       "Searching for empty convex polygons"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "224--228"
+, succeeds =    "ar-clecs-85"
+, precedes =    "deo-secp-90"
+, cites =       "ar-clecs-85, bf-eses-86, cgl-pgd-85, eg-tsa-86, eos-calha-86, e-cpgnt-79, h-kfiep-78, h-fvgsp-87, h-snec7-83, klp-fmsv-75, osv-swec6-88, ZZZ"
+, update =      "98.03 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{deo-secp-90
-, author =	"D. P. Dobkin and H. Edelsbrunner and M. H. Overmars"
-, title =	"Searching for empty convex polygons"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"561--571"
-, succeeds =	"deo-secp-88, ar-clecs-85"
-, update =	"93.09 milone+mitchell"
+, author =      "D. P. Dobkin and H. Edelsbrunner and M. H. Overmars"
+, title =       "Searching for empty convex polygons"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "561--571"
+, succeeds =    "deo-secp-88, ar-clecs-85"
+, update =      "93.09 milone+mitchell"
 }
 
 @unpublished{dey-3spa-84
-, author =	"D. P. Dobkin and H. Edelsbrunner and F. Yao"
-, title =	"A 3-space partition and its applications"
-, year =	1984
-, note =	"manuscript"
-, update =	"97.11 bibrelex"
+, author =      "D. P. Dobkin and H. Edelsbrunner and F. Yao"
+, title =       "A 3-space partition and its applications"
+, year =        1984
+, note =        "manuscript"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{dey-pcp-86
-, author =	"D. P. Dobkin and H. Edelsbrunner and C. K. Yap"
-, title =	"Probing convex polytopes"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"424--432"
-, keywords =	"discrete geometry, robotics, probing, worst-case analysis, polytopes, convex, $d$-dimensional"
-, comments =	"To appear in Autonomous Robot Vehicles, Cox and
-		 Wilfong, ed."
+, author =      "D. P. Dobkin and H. Edelsbrunner and C. K. Yap"
+, title =       "Probing convex polytopes"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "424--432"
+, keywords =    "discrete geometry, robotics, probing, worst-case analysis, polytopes, convex, $d$-dimensional"
+, comments =    "To appear in Autonomous Robot Vehicles, Cox and
+                 Wilfong, ed."
 }
 
 @inproceedings{dfs-dgaag-87
-, author =	"D. P. Dobkin and S. J. Friedman and K. J. Supowit"
-, title =	"Delaunay graphs are almost as good as complete graphs"
-, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1987
-, pages =	"20--26"
-, precedes =	"dfs-dgaag-90"
+, author =      "D. P. Dobkin and S. J. Friedman and K. J. Supowit"
+, title =       "Delaunay graphs are almost as good as complete graphs"
+, booktitle =   "Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1987
+, pages =       "20--26"
+, precedes =    "dfs-dgaag-90"
 }
 
 @article{dfs-dgaag-90
-, author =	"D. P. Dobkin and S. J. Friedman and K. J. Supowit"
-, title =	"Delaunay graphs are almost as good as complete graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"399--407"
-, succeeds =	"dfs-dgaag-87"
+, author =      "D. P. Dobkin and S. J. Friedman and K. J. Supowit"
+, title =       "Delaunay graphs are almost as good as complete graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "399--407"
+, succeeds =    "dfs-dgaag-87"
 }
 
 @inproceedings{dgkn-igper-97
-, author =	"David P. Dobkin and Emden R. Gansner and Eleftherios Koutsofios and Stephen C. North"
-, title =	"Implementing a General-Purpose Edge Router"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"262--271"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "David P. Dobkin and Emden R. Gansner and Eleftherios Koutsofios and Stephen C. North"
+, title =       "Implementing a General-Purpose Edge Router"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "262--271"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{dghs-eafcr-93
-, author =	"D. P. Dobkin and L. Guibas and J. Hershberger and J. Snoeyink"
-, title =	"An efficient algorithm for finding the {CSG} representation of a simple polygon"
-, journal =	"Algorithmica"
-, volume =	10
-, year =	1993
-, pages =	"1--23"
-, update =	"98.07 agarwal, 98.03 bibrelex"
+, author =      "D. P. Dobkin and L. Guibas and J. Hershberger and J. Snoeyink"
+, title =       "An efficient algorithm for finding the {CSG} representation of a simple polygon"
+, journal =     "Algorithmica"
+, volume =      10
+, year =        1993
+, pages =       "1--23"
+, update =      "98.07 agarwal, 98.03 bibrelex"
 }
 
 @article{dghs-eafcr-88
-, author =	"D. P. Dobkin and Leonidas J. Guibas and J. Hershberger and J. Snoeyink"
-, title =	"An efficient algorithm for finding the {CSG} representation of a simple polygon"
-, journal =	"Comput. Graph."
-, volume =	22
-, number =	4
-, year =	1988
-, pages =	"31--40"
-, note =	"Proc. SIGGRAPH '88"
-, update =	"98.07 agarwal, 98.03 mitchell, 96.09 devillers+orourke, 93.09 goodrich"
+, author =      "D. P. Dobkin and Leonidas J. Guibas and J. Hershberger and J. Snoeyink"
+, title =       "An efficient algorithm for finding the {CSG} representation of a simple polygon"
+, journal =     "Comput. Graph."
+, volume =      22
+, number =      4
+, year =        1988
+, pages =       "31--40"
+, note =        "Proc. SIGGRAPH '88"
+, update =      "98.07 agarwal, 98.03 mitchell, 96.09 devillers+orourke, 93.09 goodrich"
 }
 
 @techreport{dg-crd-94t
-, author =	"D. P. Dobkin and D. Gunopulos"
-, title =	"Computing the rectangle discrepancy"
-, type =	"Technical {Report}"
-, number =	"443-94"
-, institution =	"Dept. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "D. P. Dobkin and D. Gunopulos"
+, title =       "Computing the rectangle discrepancy"
+, type =        "Technical {Report}"
+, number =      "443-94"
+, institution = "Dept. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{dg-crd-94
-, author =	"D. P. Dobkin and D. Gunopulos"
-, title =	"Computing the Rectangle Discrepancy"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"385--386"
-, keywords =	"video review"
-, cites =	"de-cd-93, dg-crd-94t, td-gsfag-94, m-eapls-94, p-ortap-79, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones"
+, author =      "D. P. Dobkin and D. Gunopulos"
+, title =       "Computing the Rectangle Discrepancy"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "385--386"
+, keywords =    "video review"
+, cites =       "de-cd-93, dg-crd-94t, td-gsfag-94, m-eapls-94, p-ortap-79, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones"
 }
 
 @article{dk-ladsc-85
-, author =	"D. P. Dobkin and D. G. Kirkpatrick"
-, title =	"A linear algorithm for determining the separation of convex polyhedra"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	"381--392"
-, keywords =	"design of algorithms, construction, separation, convex, polyhedra, hierarchical representations"
+, author =      "D. P. Dobkin and D. G. Kirkpatrick"
+, title =       "A linear algorithm for determining the separation of convex polyhedra"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "381--392"
+, keywords =    "design of algorithms, construction, separation, convex, polyhedra, hierarchical representations"
 }
 
 @inproceedings{dk-dsppu-90
-, author =	"D. P. Dobkin and D. G. Kirkpatrick"
-, title =	"Determining the separation of preprocessed polyhedra -- a unified approach"
-, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	443
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"400--413"
-, update =	"97.11 bibrelex"
+, author =      "D. P. Dobkin and D. G. Kirkpatrick"
+, title =       "Determining the separation of preprocessed polyhedra -- a unified approach"
+, booktitle =   "Proc. 17th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      443
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "400--413"
+, update =      "97.11 bibrelex"
 }
 
 @misc{dk-fappi-
-, author =	"D. P. Dobkin and D. G. Kirkpatrick"
-, title =	"Fast Algorithms for Preprocessed Polyhedral Intersection Detection"
-, precedes =	"dk-fdpi-82, dk-fdpi-83"
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "D. P. Dobkin and D. G. Kirkpatrick"
+, title =       "Fast Algorithms for Preprocessed Polyhedral Intersection Detection"
+, precedes =    "dk-fdpi-82, dk-fdpi-83"
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{dk-fdpi-82
-, author =	"D. P. Dobkin and D. G. Kirkpatrick"
-, title =	"Fast detection of polyhedral intersection"
-, booktitle =	"Proc. 9th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	140
-, publisher =	"Springer-Verlag"
-, year =	1982
-, pages =	"154--165"
-, keywords =	"design of algorithms, data structuring, detection, intersection, polyhedra, three-dimensional, convex, hierarchical representations"
-, succeeds =	"dk-fappi-"
-, precedes =	"dk-fdpi-83"
-, update =	"98.03 bibrelex"
+, author =      "D. P. Dobkin and D. G. Kirkpatrick"
+, title =       "Fast detection of polyhedral intersection"
+, booktitle =   "Proc. 9th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      140
+, publisher =   "Springer-Verlag"
+, year =        1982
+, pages =       "154--165"
+, keywords =    "design of algorithms, data structuring, detection, intersection, polyhedra, three-dimensional, convex, hierarchical representations"
+, succeeds =    "dk-fappi-"
+, precedes =    "dk-fdpi-83"
+, update =      "98.03 bibrelex"
 }
 
 @article{dk-fdpi-83
-, author =	"D. P. Dobkin and D. G. Kirkpatrick"
-, title =	"Fast detection of polyhedral intersection"
-, journal =	"Theoret. Comput. Sci."
-, volume =	27
-, number =	3
-, month =	dec
-, year =	1983
-, pages =	"241--253"
-, keywords =	"design of algorithms, data structuring, detection, intersection, polyhedra, three-dimensional, convex, hierarchical representations"
-, succeeds =	"dk-fappi-, dk-fdpi-82"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "D. P. Dobkin and D. G. Kirkpatrick"
+, title =       "Fast detection of polyhedral intersection"
+, journal =     "Theoret. Comput. Sci."
+, volume =      27
+, number =      3
+, month =       dec
+, year =        1983
+, pages =       "241--253"
+, keywords =    "design of algorithms, data structuring, detection, intersection, polyhedra, three-dimensional, convex, hierarchical representations"
+, succeeds =    "dk-fappi-, dk-fdpi-82"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{dl-pmtds-87
-, author =	"D. P. Dobkin and M. J. Laszlo"
-, title =	"Primitives for the manipulation of three-dimensional subdivisions"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"86--99"
-, keywords =	"data structuring"
-, precedes =	"dl-pmtds-89"
-, cites =	"ab-acddv-83, b-prcv-75, b-acgpr-82, b-vdch-79, bhs-swcpg-80, c-cpplb-84, cd-diec-80, ck-acp-70, ew-gmueo-79, gs-pmgsc-85, jb-iaem-87, l-dsmtd-87, w-vt-??, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "D. P. Dobkin and M. J. Laszlo"
+, title =       "Primitives for the manipulation of three-dimensional subdivisions"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "86--99"
+, keywords =    "data structuring"
+, precedes =    "dl-pmtds-89"
+, cites =       "ab-acddv-83, b-prcv-75, b-acgpr-82, b-vdch-79, bhs-swcpg-80, c-cpplb-84, cd-diec-80, ck-acp-70, ew-gmueo-79, gs-pmgsc-85, jb-iaem-87, l-dsmtd-87, w-vt-??, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{dl-pmtds-89
-, author =	"D. P. Dobkin and M. J. Laszlo"
-, title =	"Primitives for the manipulation of three-dimensional subdivisions"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"3--32"
-, succeeds =	"dl-pmtds-87"
+, author =      "D. P. Dobkin and M. J. Laszlo"
+, title =       "Primitives for the manipulation of three-dimensional subdivisions"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "3--32"
+, succeeds =    "dl-pmtds-87"
 }
 
 @article{dl-msp-76
-, author =	"D. P. Dobkin and R. J. Lipton"
-, title =	"Multidimensional searching problems"
-, journal =	"SIAM J. Comput."
-, volume =	5
-, year =	1976
-, pages =	"181--186"
+, author =      "D. P. Dobkin and R. J. Lipton"
+, title =       "Multidimensional searching problems"
+, journal =     "SIAM J. Comput."
+, volume =      5
+, year =        1976
+, pages =       "181--186"
 }
 
 @article{dl-ccvsp-79
-, author =	"D. P. Dobkin and R. J. Lipton"
-, title =	"On the complexity of computations under varying sets of primitives"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	18
-, year =	1979
-, pages =	"86--91"
+, author =      "D. P. Dobkin and R. J. Lipton"
+, title =       "On the complexity of computations under varying sets of primitives"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      18
+, year =        1979
+, pages =       "86--91"
 }
 
 @techreport{dl-cslp-76
-, author =	"D. P. Dobkin and R. J. Lipton"
-, title =	"The complexity of searching lines in the plane"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Yale Univ."
-, address =	"New Haven, CT"
-, year =	1976
+, author =      "D. P. Dobkin and R. J. Lipton"
+, title =       "The complexity of searching lines in the plane"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Yale Univ."
+, address =     "New Haven, CT"
+, year =        1976
 }
 
 @techreport{dlr-eg-76
-, author =	"D. P. Dobkin and R. J. Lipton and S. P. Reiss"
-, title =	"Excursions into geometry"
-, type =	"Report"
-, number =	71
-, institution =	"Dept. Comput. Sci., Yale Univ."
-, address =	"New Haven, CT"
-, year =	1976
+, author =      "D. P. Dobkin and R. J. Lipton and S. P. Reiss"
+, title =       "Excursions into geometry"
+, type =        "Report"
+, number =      71
+, institution = "Dept. Comput. Sci., Yale Univ."
+, address =     "New Haven, CT"
+, year =        1976
 }
 
 @inproceedings{dm-eup-80
-, author =	"D. P. Dobkin and J. I. Munro"
-, title =	"Efficient Uses of the Past"
-, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1980
-, pages =	"200--206"
-, precedes =	"dm-eup-85"
-, annote =	"Data structure to keep track of history of a data
-		 structure. Basically adds $\log t$ space and time by
-		 keeping $\log t$ history lists."
+, author =      "D. P. Dobkin and J. I. Munro"
+, title =       "Efficient Uses of the Past"
+, booktitle =   "Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1980
+, pages =       "200--206"
+, precedes =    "dm-eup-85"
+, annote =      "Data structure to keep track of history of a data
+                 structure. Basically adds $\log t$ space and time by
+                 keeping $\log t$ history lists."
 }
 
 @article{dm-eup-85
-, author =	"D. P. Dobkin and J. I. Munro"
-, title =	"Efficient uses of the past"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	"455--465"
-, succeeds =	"dm-eup-80"
+, author =      "D. P. Dobkin and J. I. Munro"
+, title =       "Efficient uses of the past"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "455--465"
+, succeeds =    "dm-eup-80"
 }
 
 @article{dr-clp-80
-, author =	"D. P. Dobkin and S. P. Reiss"
-, title =	"The complexity of linear programming"
-, journal =	"Theoret. Comput. Sci."
-, volume =	11
-, year =	1980
-, pages =	"1--18"
+, author =      "D. P. Dobkin and S. P. Reiss"
+, title =       "The complexity of linear programming"
+, journal =     "Theoret. Comput. Sci."
+, volume =      11
+, year =        1980
+, pages =       "1--18"
 }
 
 @article{ds-acgtr-89
-, author =	"D. P. Dobkin and D. Silver"
-, title =	"Applied computational geometry: {Towards} robust solutions of basic problems"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	40
-, number =	1
-, year =	1989
-, pages =	"70--87"
-, succeeds =	"ds-rgnap-88"
-, update =	"98.07 tamassia"
+, author =      "D. P. Dobkin and D. Silver"
+, title =       "Applied computational geometry: {Towards} robust solutions of basic problems"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      40
+, number =      1
+, year =        1989
+, pages =       "70--87"
+, succeeds =    "ds-rgnap-88"
+, update =      "98.07 tamassia"
 }
 
 @inproceedings{ds-rgnap-88
-, author =	"D. P. Dobkin and D. Silver"
-, title =	"Recipes for geometry and numerical analysis, {Part} {I}: an empirical study"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"93--105"
-, precedes =	"ds-acgtr-89"
-, cites =	"d-eaavr-86, fv-sappm-85, f-cgpractice-85, f-gcest-88, gy-frcg-86, hhk-rsops-87, kj-pdwtl-87, km-fpraa-83, km-catp-81, mk-impgo-84, m-mddlp-79, ms-rcibt-88, mm-sscep-73, m-vigau-86, mw-srama-80, m-ia-66, otu-nsga-87, r-cnebf-82, ss-ccsm-85, s-ggna-88, v-inc-78, v-nmevr-78, vl-eac-74, w-reap-63, ZZZ"
-, update =	"99.11 bibrelex, 99.03 forrest, 98.03 bibrelex"
+, author =      "D. P. Dobkin and D. Silver"
+, title =       "Recipes for geometry and numerical analysis, {Part} {I}: an empirical study"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "93--105"
+, precedes =    "ds-acgtr-89"
+, cites =       "d-eaavr-86, fv-sappm-85, f-cgpractice-85, f-gcest-88, gy-frcg-86, hhk-rsops-87, kj-pdwtl-87, km-fpraa-83, km-catp-81, mk-impgo-84, m-mddlp-79, ms-rcibt-88, mm-sscep-73, m-vigau-86, mw-srama-80, m-ia-66, otu-nsga-87, r-cnebf-82, ss-ccsm-85, s-ggna-88, v-inc-78, v-nmevr-78, vl-eac-74, w-reap-63, ZZZ"
+, update =      "99.11 bibrelex, 99.03 forrest, 98.03 bibrelex"
 }
 
 @inproceedings{ds-gmmmc-79
-, author =	"D. P. Dobkin and L. Snyder"
-, title =	"On a general method for maximizing and minimizing among certain geometric problems"
-, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1979
-, pages =	"9--17"
+, author =      "D. P. Dobkin and L. Snyder"
+, title =       "On a general method for maximizing and minimizing among certain geometric problems"
+, booktitle =   "Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1979
+, pages =       "9--17"
 }
 
 @incollection{ds-cgug-87
-, author =	"D. P. Dobkin and D. L. Souvaine"
-, title =	"Computational geometry: a user's guide"
-, editor =	"J. T. Schwartz and C.-K. Yap"
-, booktitle =	"Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
-, publisher =	"Lawrence Erlbaum Associates"
-, address =	"Hillsdale, NJ"
-, year =	1987
-, pages =	"43--93"
-, keywords =	"survey paper, design of algorithms, convex hull, point location, intersection, binary search, divide-and-conquer, geometric transformations, dynamizing data structures"
+, author =      "D. P. Dobkin and D. L. Souvaine"
+, title =       "Computational geometry: a user's guide"
+, editor =      "J. T. Schwartz and C.-K. Yap"
+, booktitle =   "Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
+, publisher =   "Lawrence Erlbaum Associates"
+, address =     "Hillsdale, NJ"
+, year =        1987
+, pages =       "43--93"
+, keywords =    "survey paper, design of algorithms, convex hull, point location, intersection, binary search, divide-and-conquer, geometric transformations, dynamizing data structures"
 }
 
 @article{ds-cgcw-90
-, author =	"D. P. Dobkin and D. L. Souvaine"
-, title =	"Computational geometry in a curved world"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"421--457"
-, keywords =	"design of algorithms, intersection, convex, monotone, simple, curved polygon, splinegon"
-, succeeds =	"s-cgcw-86"
+, author =      "D. P. Dobkin and D. L. Souvaine"
+, title =       "Computational geometry in a curved world"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "421--457"
+, keywords =    "design of algorithms, intersection, convex, monotone, simple, curved polygon, splinegon"
+, succeeds =    "s-cgcw-86"
 }
 
 @article{ds-dicop-91
-, author =	"D. P. Dobkin and D. L. Souvaine"
-, title =	"Detecting the intersection of convex objects in the plane"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	8
-, year =	1991
-, pages =	"181--200"
-, keywords =	"design of algorithms, intersection, convex, polygon, splinegon"
+, author =      "D. P. Dobkin and D. L. Souvaine"
+, title =       "Detecting the intersection of convex objects in the plane"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      8
+, year =        1991
+, pages =       "181--200"
+, keywords =    "design of algorithms, intersection, convex, polygon, splinegon"
 }
 
 @techreport{dsv-diss-86
-, author =	"D. P. Dobkin and D. L. Souvaine and C. J. {Van Wyk}"
-, title =	"Decomposition and intersection of simple splinegons"
-, type =	"Report"
-, number =	"CS-TR-051-86"
-, institution =	"Dept. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1986
-, keywords =	"design of algorithms, decomposition, intersection, simple, curved polygon, splinegon"
-, precedes =	"dsv-diss-88"
+, author =      "D. P. Dobkin and D. L. Souvaine and C. J. {Van Wyk}"
+, title =       "Decomposition and intersection of simple splinegons"
+, type =        "Report"
+, number =      "CS-TR-051-86"
+, institution = "Dept. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1986
+, keywords =    "design of algorithms, decomposition, intersection, simple, curved polygon, splinegon"
+, precedes =    "dsv-diss-88"
 }
 
 @article{dsv-diss-88
-, author =	"D. P. Dobkin and D. L. Souvaine and C. J. {Van Wyk}"
-, title =	"Decomposition and intersection of simple splinegons"
-, journal =	"Algorithmica"
-, volume =	3
-, year =	1988
-, pages =	"473--486"
-, keywords =	"design of algorithms, decomposition, intersection, simple, curved polygon, splinegon"
-, succeeds =	"dsv-diss-86"
+, author =      "D. P. Dobkin and D. L. Souvaine and C. J. {Van Wyk}"
+, title =       "Decomposition and intersection of simple splinegons"
+, journal =     "Algorithmica"
+, volume =      3
+, year =        1988
+, pages =       "473--486"
+, keywords =    "design of algorithms, decomposition, intersection, simple, curved polygon, splinegon"
+, succeeds =    "dsv-diss-86"
 }
 
 @inproceedings{dt-esrla-01
-, author =	"David P. Dobkin and Ayellet Tal"
-, title =	"Efficient and Small Representation of Line Arrangements with Applications"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
-, year =	2001
-, pages =	"293--301"
-, update =	"01.11 pocchiola"
+, author =      "David P. Dobkin and Ayellet Tal"
+, title =       "Efficient and Small Representation of Line Arrangements with Applications"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Comput. Geom."
+, year =        2001
+, pages =       "293--301"
+, update =      "01.11 pocchiola"
 }
 
 @incollection{dt-cg-97
-, author =	"D. P. Dobkin and S. Teller"
-, title =	"Computer graphics"
-, chapter =	42
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"779--796"
-, update =	"98.07 agarwal, 97.11 orourke"
+, author =      "D. P. Dobkin and S. Teller"
+, title =       "Computer graphics"
+, chapter =     42
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "779--796"
+, update =      "98.07 agarwal, 97.11 orourke"
 }
 
 @mastersthesis{d-afp-90
-, author =	"Katrin Dobrindt"
-, title =	"Algorithmen f{\"u}r {Polyeder}"
-, school =	"Fachbereich Informatik, Universit{\"a}t Saarbr{\"u}cken"
-, address =	"Saarbr{\"u}cken, Germany"
-, month =	may
-, year =	1990
-, keywords =	"master thesis"
-, update =	"99.07 devillers, 97.11 bibrelex"
+, author =      "Katrin Dobrindt"
+, title =       "Algorithmen f{\"u}r {Polyeder}"
+, school =      "Fachbereich Informatik, Universit{\"a}t Saarbr{\"u}cken"
+, address =     "Saarbr{\"u}cken, Germany"
+, month =       may
+, year =        1990
+, keywords =    "master thesis"
+, update =      "99.07 devillers, 97.11 bibrelex"
 }
 
 @phdthesis{d-adraa-94
-, author =	"Katrin Dobrindt"
-, title =	"Algorithmes Dynamiques Randomis{\'e}s pour les Arrangements: Application \`a la Planification de Trajectoires"
-, type =	"Th{\`e}se de Doctorat en Sciences"
-, school =	"Ecole des Mines de Paris"
-, address =	"Paris"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"99.07 devillers, 96.01 devillers, 95.09 agarwal"
+, author =      "Katrin Dobrindt"
+, title =       "Algorithmes Dynamiques Randomis{\'e}s pour les Arrangements: Application \`a la Planification de Trajectoires"
+, type =        "Th{\`e}se de Doctorat en Sciences"
+, school =      "Ecole des Mines de Paris"
+, address =     "Paris"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "99.07 devillers, 96.01 devillers, 95.09 agarwal"
 }
 
 @techreport{dmy-ceaig-93t
-, author =	"Katrin Dobrindt and Kurt Mehlhorn and Mariette Yvinec"
-, title =	"A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron"
-, type =	"Report"
-, number =	"MPI-I-93-140"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, update =	"99.07 devillers, 94.01 smid"
+, author =      "Katrin Dobrindt and Kurt Mehlhorn and Mariette Yvinec"
+, title =       "A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron"
+, type =        "Report"
+, number =      "MPI-I-93-140"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, update =      "99.07 devillers, 94.01 smid"
 }
 
 @inproceedings{dmy-ceaig-93
-, author =	"Katrin Dobrindt and Kurt Mehlhorn and Mariette Yvinec"
-, title =	"A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, year =	1993
-, pages =	"314--324"
-, update =	"99.07 devillers, 93.09 devillers+milone+mitchell+smid, 93.05 jones"
+, author =      "Katrin Dobrindt and Kurt Mehlhorn and Mariette Yvinec"
+, title =       "A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, year =        1993
+, pages =       "314--324"
+, update =      "99.07 devillers, 93.09 devillers+milone+mitchell+smid, 93.05 jones"
 }
 
 @inproceedings{dy-rchyd-93
-, author =	"Katrin Dobrindt and Mariette Yvinec"
-, title =	"Remembering conflicts in history yields dynamic algorithms"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"21--30"
-, update =	"99.07 devillers, 98.07 bibrelex, 94.05 devillers+smid"
+, author =      "Katrin Dobrindt and Mariette Yvinec"
+, title =       "Remembering conflicts in history yields dynamic algorithms"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "21--30"
+, update =      "99.07 devillers, 98.07 bibrelex, 94.05 devillers+smid"
 }
 
 @article{dm-lblds-74
-, author =	"A. Dobson and S. Macdonald"
-, title =	"Lower bounds for lengths of {Davenport}-{Schinzel} sequences"
-, journal =	"Utilitas Math."
-, volume =	6
-, year =	1974
-, pages =	"251--257"
-, update =	"95.05 agarwal"
+, author =      "A. Dobson and S. Macdonald"
+, title =       "Lower bounds for lengths of {Davenport}-{Schinzel} sequences"
+, journal =     "Utilitas Math."
+, volume =      6
+, year =        1974
+, pages =       "251--257"
+, update =      "95.05 agarwal"
 }
 
 @article{dt-dtoeo-81
-, author =	"L. J. Doctor and J. G. Toborg"
-, title =	"Display techniques for octree-encoded objects"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	1
-, number =	3
-, month =	jul
-, year =	1981
-, pages =	"29--38"
-, update =	"97.11 bibrelex"
+, author =      "L. J. Doctor and J. G. Toborg"
+, title =       "Display techniques for octree-encoded objects"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      1
+, number =      3
+, month =       jul
+, year =        1981
+, pages =       "29--38"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{dmmmz-mlig-97
-, author =	"S. Doddi and M. Marathe and A. Mirzaian and B. Moret and B. Zhu"
-, title =	"Map labeling and its generalization"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1997
-, pages =	"148--157"
-, update =	"97.07 agarwal"
+, author =      "S. Doddi and M. Marathe and A. Mirzaian and B. Moret and B. Zhu"
+, title =       "Map labeling and its generalization"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1997
+, pages =       "148--157"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{dmm-pslsp-00
-, author =	"Srinivas Doddi and Madhav V. Marathe and Bernard M. E. Moret"
-, title =	"Point Set Labeling with Specified Positions"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"182--190"
-, update =	"00.11 jones"
+, author =      "Srinivas Doddi and Madhav V. Marathe and Bernard M. E. Moret"
+, title =       "Point Set Labeling with Specified Positions"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "182--190"
+, update =      "00.11 jones"
 }
 
 @book{d-egt-72
-, author =	"C. W. Dodge"
-, title =	"Euclidean geometry and transformations"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1972
+, author =      "C. W. Dodge"
+, title =       "Euclidean geometry and transformations"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1972
 }
 
 @inproceedings{d-civc3-96
-, author =	"D. Dodson"
-, title =	"{COMAIDE}: Information Visualization using Cooperative {3D} Diagram Layout"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"190--201"
-, keywords =	"graph drawing, 3D"
-, update =	"98.07 patrignani"
+, author =      "D. Dodson"
+, title =       "{COMAIDE}: Information Visualization using Cooperative {3D} Diagram Layout"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "190--201"
+, keywords =    "graph drawing, 3D"
+, update =      "98.07 patrignani"
 }
 
 @inproceedings{dhs-ievaa-97
-, author =	"J. Doellner and K. Hinrichs and H. Spiegel"
-, title =	"An interactive environment for visualizing and animating algorithms"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"409--411"
-, cites =	"bw-rphs-88, dh-vrsto-95, dh-oo3dm-97, d-oo3dm-96, es-vda-86, f-savd-87, hss-uccli-94, nb-o3dhl-95, o-cgc-94, o-ttt-94, m-ioopt-93, td-vga-95, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "J. Doellner and K. Hinrichs and H. Spiegel"
+, title =       "An interactive environment for visualizing and animating algorithms"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "409--411"
+, cites =       "bw-rphs-88, dh-vrsto-95, dh-oo3dm-97, d-oo3dm-96, es-vda-86, f-savd-87, hss-uccli-94, nb-o3dhl-95, o-cgc-94, o-ttt-94, m-ioopt-93, td-vga-95, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{df-rbsdm-92
-, author =	"J. S. Doerschler and H. Freeman"
-, title =	"A rule-based system for dense-Map name placement"
-, journal =	"Commun. ACM"
-, volume =	35
-, year =	1992
-, pages =	"68--79"
-, update =	"97.07 agarwal"
+, author =      "J. S. Doerschler and H. Freeman"
+, title =       "A rule-based system for dense-Map name placement"
+, journal =     "Commun. ACM"
+, volume =      35
+, year =        1992
+, pages =       "68--79"
+, update =      "97.07 agarwal"
 }
 
 @article{dc-advsp-93
-, author =	"Jeong-In Doh and Kyung-Yong Chwa"
-, title =	"An algorithm for determining visibility of a simple polygon from an internal line segment"
-, journal =	"J. Algorithms"
-, volume =	14
-, year =	1993
-, pages =	"139--168"
-, update =	"94.01 choi, 93.09 milone+mitchell"
+, author =      "Jeong-In Doh and Kyung-Yong Chwa"
+, title =       "An algorithm for determining visibility of a simple polygon from an internal line segment"
+, journal =     "J. Algorithms"
+, volume =      14
+, year =        1993
+, pages =       "139--168"
+, update =      "94.01 choi, 93.09 milone+mitchell"
 }
 
 @article{dc-vpoot-88
-, author =	"Jeong-In Doh and Kyung-Yong Chwa"
-, title =	"Visibility problems for orthogonal objects in two or three dimensions"
-, journal =	"Visual Comput."
-, volume =	4
-, number =	2
-, month =	jul
-, year =	1988
-, pages =	"84--97"
-, keywords =	"hidden line/surface elimination"
+, author =      "Jeong-In Doh and Kyung-Yong Chwa"
+, title =       "Visibility problems for orthogonal objects in two or three dimensions"
+, journal =     "Visual Comput."
+, volume =      4
+, number =      2
+, month =       jul
+, year =        1988
+, pages =       "84--97"
+, keywords =    "hidden line/surface elimination"
 }
 
 @article{d-fibsr-85
-, author =	"T. Dokken"
-, title =	"Finding intersections of {B}-spline represented geometric entities using recursive subdivsion techniques"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	2
-, year =	1985
-, pages =	"189--195"
-, update =	"97.11 bibrelex"
+, author =      "T. Dokken"
+, title =       "Finding intersections of {B}-spline represented geometric entities using recursive subdivsion techniques"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      2
+, year =        1985
+, pages =       "189--195"
+, update =      "97.11 bibrelex"
 }
 
 @article{dwms-mltnu-91
-, author =	"J. Dolan and R. Weiss and {MacGregor} and J. Smith"
-, title =	"Minimal length tree networks on the unit circle"
-, journal =	"Ann. Oper. Res."
-, volume =	33
-, number =	"1--4"
-, year =	1991
-, pages =	"503--535"
-, keywords =	"proximity, Steiner tree, minimal spanning tree, Voronoi diagram, Delaunay triangulation, heuristics"
-, update =	"95.09 korneenko"
+, author =      "J. Dolan and R. Weiss and {MacGregor} and J. Smith"
+, title =       "Minimal length tree networks on the unit circle"
+, journal =     "Ann. Oper. Res."
+, volume =      33
+, number =      "1--4"
+, year =        1991
+, pages =       "503--535"
+, keywords =    "proximity, Steiner tree, minimal spanning tree, Voronoi diagram, Delaunay triangulation, heuristics"
+, update =      "95.09 korneenko"
 }
 
 @techreport{dm-otps-91
-, author =	"A. Dolenc and I. M{\"a}kel{\"a}"
-, title =	"Optimized triangulation of parametric surfaces"
-, type =	"Technical {Report}"
-, number =	"TKO-B74"
-, institution =	"Helsinki University of Technology"
-, address =	"Helsinki, Finland"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "A. Dolenc and I. M{\"a}kel{\"a}"
+, title =       "Optimized triangulation of parametric surfaces"
+, type =        "Technical {Report}"
+, number =      "TKO-B74"
+, institution = "Helsinki University of Technology"
+, address =     "Helsinki, Finland"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @article{dkssu-oasa-82
-, author =	"D. Dolev and K. Karplus and A. Siegel and A. Strong and J. D. Ullman"
-, title =	"Optimal algorithms for structural assembly"
-, journal =	"{VLSI} Design"
-, volume =	3
-, year =	1982
-, pages =	"38--43"
-, succeeds =	"dkssu-owbr-81"
+, author =      "D. Dolev and K. Karplus and A. Siegel and A. Strong and J. D. Ullman"
+, title =       "Optimal algorithms for structural assembly"
+, journal =     "{VLSI} Design"
+, volume =      3
+, year =        1982
+, pages =       "38--43"
+, succeeds =    "dkssu-owbr-81"
 }
 
 @inproceedings{dkssu-owbr-81
-, author =	"D. Dolev and K. Karplus and A. Siegel and A. Strong and J. D. Ullman"
-, title =	"Optimal wiring between rectangles"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
-, year =	1981
-, pages =	"312--317"
-, precedes =	"dkssu-oasa-82"
+, author =      "D. Dolev and K. Karplus and A. Siegel and A. Strong and J. D. Ullman"
+, title =       "Optimal wiring between rectangles"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Theory Comput."
+, year =        1981
+, pages =       "312--317"
+, precedes =    "dkssu-oasa-82"
 }
 
 @incollection{dlt-pepg-84
-, author =	"D. Dolev and F. T. Leighton and H. Trickey"
-, title =	"Planar Embedding of Planar Graphs"
-, editor =	"Franco P. Preparata"
-, booktitle =	"VLSI Theory"
-, series =	"Adv. Comput. Res."
-, volume =	2
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1984
-, pages =	"147--161"
-, keywords =	"graph drawing"
-, update =	"01.04 icking, 98.07 vismara, 93.09 tamassia"
+, author =      "D. Dolev and F. T. Leighton and H. Trickey"
+, title =       "Planar Embedding of Planar Graphs"
+, editor =      "Franco P. Preparata"
+, booktitle =   "VLSI Theory"
+, series =      "Adv. Comput. Res."
+, volume =      2
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1984
+, pages =       "147--161"
+, keywords =    "graph drawing"
+, update =      "01.04 icking, 98.07 vismara, 93.09 tamassia"
 }
 
 @techreport{dt-laepg-81
-, author =	"D. Dolev and H. Trickey"
-, title =	"On linear area embedding of planar graphs"
-, type =	"report"
-, number =	"cs--81--876"
-, institution =	"Stanford Univ."
-, year =	1981
-, keywords =	"plane graph representation, triangulation, area, discrete geometry, NP-completeness"
-, update =	"98.07 bibrelex, 95.09 korneenko"
+, author =      "D. Dolev and H. Trickey"
+, title =       "On linear area embedding of planar graphs"
+, type =        "report"
+, number =      "cs--81--876"
+, institution = "Stanford Univ."
+, year =        1981
+, keywords =    "plane graph representation, triangulation, area, discrete geometry, NP-completeness"
+, update =      "98.07 bibrelex, 95.09 korneenko"
 }
 
 @phdthesis{d-oo3dm-96
-, author =	"J. D{\"o}llner"
-, title =	"Object-oriented $3$d modeling, animation and interaction"
-, school =	"Universit{\"a}t M{\"u}nster"
-, address =	"M{\"u}nster, Germany"
-, year =	1996
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "J. D{\"o}llner"
+, title =       "Object-oriented $3$d modeling, animation and interaction"
+, school =      "Universit{\"a}t M{\"u}nster"
+, address =     "M{\"u}nster, Germany"
+, year =        1996
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @article{dh-oo3dm-97
-, author =	"J. D{\"o}llner and K. Hinrichs"
-, title =	"Object-oriented $3$d modeling, animation and interaction"
-, journal =	"J. Visualization and Comput. Animation"
-, volume =	8
-, number =	1
-, year =	1997
-, pages =	"33--64"
-, update =	"98.07 bibrelex"
+, author =      "J. D{\"o}llner and K. Hinrichs"
+, title =       "Object-oriented $3$d modeling, animation and interaction"
+, journal =     "J. Visualization and Comput. Animation"
+, volume =      8
+, number =      1
+, year =        1997
+, pages =       "33--64"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{dh-vrsto-95
-, author =	"J. D{\"o}llner and K. Hinrichs"
-, title =	"The virtual rendering system - {A} toolkit for object oriented $3$D rendering"
-, booktitle =	"EduGraphics/ComputGraphics, Combined Proceedings"
-, year =	1995
-, pages =	"309--318"
-, update =	"98.07 bibrelex"
+, author =      "J. D{\"o}llner and K. Hinrichs"
+, title =       "The virtual rendering system - {A} toolkit for object oriented $3$D rendering"
+, booktitle =   "EduGraphics/ComputGraphics, Combined Proceedings"
+, year =        1995
+, pages =       "309--318"
+, update =      "98.07 bibrelex"
 }
 
 @article{d-cp-72
-, author =	"V. L. Dol'nikov"
-, title =	"A coloring problem"
-, journal =	"Siberian Math. J."
-, volume =	13
-, year =	1972
-, pages =	"886--894"
-, update =	"97.11 bibrelex"
+, author =      "V. L. Dol'nikov"
+, title =       "A coloring problem"
+, journal =     "Siberian Math. J."
+, volume =      13
+, year =        1972
+, pages =       "886--894"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{dg-patcp-91
-, author =	"Salvador Dominguez and Oliver G{\"u}nther"
-, title =	"Performance analysis of three curve presentation schemes"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"37--56"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Salvador Dominguez and Oliver G{\"u}nther"
+, title =       "Performance analysis of three curve presentation schemes"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "37--56"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{dmbrm-dram-96
-, author =	"R. J. Donaghy and W. McCune and S. J. Bridgett and C. G. Armstrong and D. J. Robinson and R. M. McKeag"
-, title =	"Dimensional reduction of analysis models"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"307--320"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "R. J. Donaghy and W. McCune and S. J. Bridgett and C. G. Armstrong and D. J. Robinson and R. M. McKeag"
+, title =       "Dimensional reduction of analysis models"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "307--320"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @techreport{dx-pgaao-90t
-, author =	"B. Donald and P. Xavier"
-, title =	"Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators"
-, type =	"Technical {Report}"
-, number =	"TR-1095"
-, institution =	"Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "B. Donald and P. Xavier"
+, title =       "Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators"
+, type =        "Technical {Report}"
+, number =      "TR-1095"
+, institution = "Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 % paper and info from Donald's web site:
 @article{dx-pgaao-95
-, author =	"B. Donald and P. Xavier"
-, title =	"Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators"
-, journal =	"Algorithmica"
-, volume =	14
-, number =	6
-, year =	1995
-, pages =	"480--530"
-, succeeds =	"dx-pgaao-90"
-, cites =	"as-rac-86, bdg-tocrm-85, b-rmpc-82, c-cdmp-86, d-samps-87, cdrx-ckp-88, cr-nlbtr-87, dx-pgaao-89, dx-nokpr-89, dx-pgaao-90t, fw-pcm-88, gl-mc-83, hp-brd-89, h-dsmt-83t, jc-pspmr-89, jhcp-pgnto-89i, l-spcsa-83, o-mpic-86, p-aspmt-85, ps-coac-82, pt-ipct-86, rt-akpul-89, sh-pmttr-85, s-obbtr-87, sd-gtomr-88, ss-rtoct-85, ss-tocm-86, w-mpav-88, y-amp-87, ZZZ"
-, update =	"98.03 mitchell"
+, author =      "B. Donald and P. Xavier"
+, title =       "Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators"
+, journal =     "Algorithmica"
+, volume =      14
+, number =      6
+, year =        1995
+, pages =       "480--530"
+, succeeds =    "dx-pgaao-90"
+, cites =       "as-rac-86, bdg-tocrm-85, b-rmpc-82, c-cdmp-86, d-samps-87, cdrx-ckp-88, cr-nlbtr-87, dx-pgaao-89, dx-nokpr-89, dx-pgaao-90t, fw-pcm-88, gl-mc-83, hp-brd-89, h-dsmt-83t, jc-pspmr-89, jhcp-pgnto-89i, l-spcsa-83, o-mpic-86, p-aspmt-85, ps-coac-82, pt-ipct-86, rt-akpul-89, sh-pmttr-85, s-obbtr-87, sd-gtomr-88, ss-rtoct-85, ss-tocm-86, w-mpav-88, y-amp-87, ZZZ"
+, update =      "98.03 mitchell"
 }
 
 @article{d-gaedr-88
-, author =	"B. R. Donald"
-, title =	"A geometric approach to error detection and recovery for robot motion planning with uncertainty"
-, journal =	"Artif. Intell."
-, volume =	37
-, number =	"1--3"
-, year =	1988
-, pages =	"223--271"
-, keywords =	"compliance, motion planning"
+, author =      "B. R. Donald"
+, title =       "A geometric approach to error detection and recovery for robot motion planning with uncertainty"
+, journal =     "Artif. Intell."
+, volume =      37
+, number =      "1--3"
+, year =        1988
+, pages =       "223--271"
+, keywords =    "compliance, motion planning"
 }
 
 @article{d-samps-87
-, author =	"B. R. Donald"
-, title =	"A search algorithm for motion planning with six degrees of freedom"
-, journal =	"Artif. Intell."
-, volume =	31
-, number =	3
-, year =	1987
-, pages =	"295--353"
-, keywords =	"motion planning"
+, author =      "B. R. Donald"
+, title =       "A search algorithm for motion planning with six degrees of freedom"
+, journal =     "Artif. Intell."
+, volume =      31
+, number =      3
+, year =        1987
+, pages =       "295--353"
+, keywords =    "motion planning"
 }
 
 @inproceedings{d-tedrr-86
-, author =	"B. R. Donald"
-, title =	"A theory of error detection and recovery for robot motion planning with uncertainty"
-, booktitle =	"International Workshop on Geometric Reasoning"
-, site =	"Oxford, UK"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "B. R. Donald"
+, title =       "A theory of error detection and recovery for robot motion planning with uncertainty"
+, booktitle =   "International Workshop on Geometric Reasoning"
+, site =        "Oxford, UK"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @techreport{d-edrrm-87
-, author =	"B. R. Donald"
-, title =	"Error detection and recovery for robot motion planning with uncertainty"
-, institution =	"Artificial Intelligence Laboratory, MIT"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "B. R. Donald"
+, title =       "Error detection and recovery for robot motion planning with uncertainty"
+, institution = "Artificial Intelligence Laboratory, MIT"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @book{d-edrr-89
-, author =	"B. R. Donald"
-, title =	"Error Detection and Recovery in Robotics"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	336
-, publisher =	"Springer-Verlag"
-, year =	1989
-, keywords =	"doctoral thesis"
-, comments =	"revised version of author's thesis, Massachusetts
-		 Inst. Tech. 1987"
+, author =      "B. R. Donald"
+, title =       "Error Detection and Recovery in Robotics"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      336
+, publisher =   "Springer-Verlag"
+, year =        1989
+, keywords =    "doctoral thesis"
+, comments =    "revised version of author's thesis, Massachusetts
+                 Inst. Tech. 1987"
 }
 
 @inproceedings{d-mpsdf-85
-, author =	"B. R. Donald"
-, title =	"On motion planning with six degrees of freedom: solving the intersection problems in configuration space"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1985
-, pages =	"536--541"
+, author =      "B. R. Donald"
+, title =       "On motion planning with six degrees of freedom: solving the intersection problems in configuration space"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1985
+, pages =       "536--541"
 }
 
 @inproceedings{d-pmsed-88
-, author =	"B. R. Donald"
-, title =	"Planning multi-step error detection and recovery strategies"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1988
-, pages =	"892--897"
-, precedes =	"d-pmsed-90"
+, author =      "B. R. Donald"
+, title =       "Planning multi-step error detection and recovery strategies"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1988
+, pages =       "892--897"
+, precedes =    "d-pmsed-90"
 }
 
 @article{d-pmsed-90
-, author =	"B. R. Donald"
-, title =	"Planning multi-step error detection and recovery strategies"
-, journal =	"Internat. J. Robot. Res."
-, volume =	9
-, year =	1990
-, pages =	"3--60"
-, keywords =	"compliance, motion planning"
-, succeeds =	"d-pmsed-88"
+, author =      "B. R. Donald"
+, title =       "Planning multi-step error detection and recovery strategies"
+, journal =     "Internat. J. Robot. Res."
+, volume =      9
+, year =        1990
+, pages =       "3--60"
+, keywords =    "compliance, motion planning"
+, succeeds =    "d-pmsed-88"
 }
 
 @inproceedings{d-rmpug-86
-, author =	"B. R. Donald"
-, title =	"Robot motion planning with uncertainty in the geometric models of the robot and environment: a formal framework for error detection and recovery"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1986
-, pages =	"1588--1593"
+, author =      "B. R. Donald"
+, title =       "Robot motion planning with uncertainty in the geometric models of the robot and environment: a formal framework for error detection and recovery"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1986
+, pages =       "1588--1593"
 }
 
 @inproceedings{d-cpcmp-88
-, author =	"B. R. Donald"
-, title =	"The complexity of planar compliant motion planning under uncertainty"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"309--318"
-, precedes =	"d-cpcmp-90"
-, cites =	"bk-cmpgm-87, bl-sacsf-83, b-rmpc-82, b-agppu-86, b-ptcms-87, brs-phpsd-87, c-namrm-87, cd-svd-87, cd-svd-88, cr-nlbtr-87, ad-tg-80, d-samps-87, d-rmpug-86, d-tedrr-86, d-edrrm-87, d-gaedr-88, d-ttlrp-87, e-ubfmp-86, em-esm-86, g-cdta-87, hw-moc-86, k-ernmp-87, k-grsmo-85, l-spcsa-83, l-rp-83, lmt-asfms-84, l-cmpue-86, m-cfccc-81, m-apfmc-84, n-moo-86, n-aaadp-86, osy-gvdl1-84, osy-gvdl2-84, oy-rmpmd-85, hss-pgcrm-87, sy-agar-87, t-smcpt-76, y-cmsd-84, y-amp-87, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "B. R. Donald"
+, title =       "The complexity of planar compliant motion planning under uncertainty"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "309--318"
+, precedes =    "d-cpcmp-90"
+, cites =       "bk-cmpgm-87, bl-sacsf-83, b-rmpc-82, b-agppu-86, b-ptcms-87, brs-phpsd-87, c-namrm-87, cd-svd-87, cd-svd-88, cr-nlbtr-87, ad-tg-80, d-samps-87, d-rmpug-86, d-tedrr-86, d-edrrm-87, d-gaedr-88, d-ttlrp-87, e-ubfmp-86, em-esm-86, g-cdta-87, hw-moc-86, k-ernmp-87, k-grsmo-85, l-spcsa-83, l-rp-83, lmt-asfms-84, l-cmpue-86, m-cfccc-81, m-apfmc-84, n-moo-86, n-aaadp-86, osy-gvdl1-84, osy-gvdl2-84, oy-rmpmd-85, hss-pgcrm-87, sy-agar-87, t-smcpt-76, y-cmsd-84, y-amp-87, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{d-cpcmp-90
-, author =	"B. R. Donald"
-, title =	"The complexity of planar compliant motion planning under uncertainty"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"353--382"
-, succeeds =	"d-cpcmp-88"
+, author =      "B. R. Donald"
+, title =       "The complexity of planar compliant motion planning under uncertainty"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "353--382"
+, succeeds =    "d-cpcmp-88"
 }
 
 @inproceedings{d-mpasd-83
-, author =	"B. R. Donald"
-, title =	"The mover's problem in automated structural design"
-, booktitle =	"Proc. Harvard Computer Graphics Conference"
-, year =	1983
-, pages =	"??"
+, author =      "B. R. Donald"
+, title =       "The mover's problem in automated structural design"
+, booktitle =   "Proc. Harvard Computer Graphics Conference"
+, year =        1983
+, pages =       "??"
 }
 
 @techreport{d-ttlrp-87
-, author =	"B. R. Donald"
-, title =	"Towards task-level robot programming"
-, type =	"Technical {Report}"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "B. R. Donald"
+, title =       "Towards task-level robot programming"
+, type =        "Technical {Report}"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{dbb-r-90
-, author =	"B. R. Donald and J. Baillieul and R. Brockett"
-, title =	"Robotics"
-, booktitle =	"Symposia in Applied Mathematics"
-, volume =	41
-, year =	1990
-, pages =	"??"
-, update =	"97.11 bibrelex"
+, author =      "B. R. Donald and J. Baillieul and R. Brockett"
+, title =       "Robotics"
+, booktitle =   "Symposia in Applied Mathematics"
+, volume =      41
+, year =        1990
+, pages =       "??"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{dc-chtt-91
-, author =	"B. R. Donald and D. R. Chang"
-, title =	"On computing the homology type of a triangulation"
-, type =	"Technical {Report}"
-, number =	"TR-91-1183"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "B. R. Donald and D. R. Chang"
+, title =       "On computing the homology type of a triangulation"
+, type =        "Technical {Report}"
+, number =      "TR-91-1183"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{dc-cchtt-91
-, author =	"B. R. Donald and D. R. Chang"
-, title =	"On the complexity of computing the homology type of a triangulation"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"650--662"
+, author =      "B. R. Donald and D. R. Chang"
+, title =       "On the complexity of computing the homology type of a triangulation"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "650--662"
 }
 
 @inproceedings{dj-sitdp-91
-, author =	"B. R. Donald and J. Jennings"
-, title =	"Sensor interpretation and task-directed planning using perceptual equivalence classes"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1991
-, pages =	"190--197"
+, author =      "B. R. Donald and J. Jennings"
+, title =       "Sensor interpretation and task-directed planning using perceptual equivalence classes"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1991
+, pages =       "190--197"
 }
 
 @inproceedings{djc-tevac-89
-, author =	"B. R. Donald and J. Jennings and D. Campbell"
-, title =	"Towards experimental verification of an automated compliant motion planner based on a geometric theory of error detection and recovery"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1989
-, pages =	"632--637"
+, author =      "B. R. Donald and J. Jennings and D. Campbell"
+, title =       "Towards experimental verification of an automated compliant motion planner based on a geometric theory of error detection and recovery"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1989
+, pages =       "632--637"
 }
 
 @article{dlrg-rtrmp-90
-, author =	"B. R. Donald and J. Lengyel and M. Reichert and D. Greenberg"
-, title =	"Real-time robot motion planning using rasterizing computer graphics hardware"
-, journal =	"Comput. Graph."
-, volume =	24
-, number =	4
-, year =	1990
-, pages =	"327--335"
-, note =	"Proc. SIGGRAPH '90"
+, author =      "B. R. Donald and J. Lengyel and M. Reichert and D. Greenberg"
+, title =       "Real-time robot motion planning using rasterizing computer graphics hardware"
+, journal =     "Comput. Graph."
+, volume =      24
+, number =      4
+, year =        1990
+, pages =       "327--335"
+, note =        "Proc. SIGGRAPH '90"
 }
 
 @inproceedings{dp-mccrb-90
-, author =	"B. R. Donald and D. K. Pai"
-, title =	"On the motion of compliantly-connected rigid bodies in contact: a system for analyzing designs for assembly"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1990
-, pages =	"1756--1762"
-, keywords =	"motion planning, compliance"
+, author =      "B. R. Donald and D. K. Pai"
+, title =       "On the motion of compliantly-connected rigid bodies in contact: a system for analyzing designs for assembly"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1990
+, pages =       "1756--1762"
+, keywords =    "motion planning, compliance"
 }
 
 @inproceedings{dx-pgaao-89
-, author =	"B. R. Donald and P. Xavier"
-, title =	"A provably good approximation algorithm for optimal-time trajectory planning"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1989
-, pages =	"958--963"
-, keywords =	"motion planning"
+, author =      "B. R. Donald and P. Xavier"
+, title =       "A provably good approximation algorithm for optimal-time trajectory planning"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1989
+, pages =       "958--963"
+, keywords =    "motion planning"
 }
 
 @inproceedings{dx-nokpr-89
-, author =	"B. R. Donald and P. Xavier"
-, title =	"Near-optimal kinodynamic planning for robots with coupled dynamics bounds"
-, booktitle =	"Proc. 4th IEEE International Symposium on Intelligent Control"
-, year =	1989
-, pages =	"??"
-, keywords =	"motion planning"
+, author =      "B. R. Donald and P. Xavier"
+, title =       "Near-optimal kinodynamic planning for robots with coupled dynamics bounds"
+, booktitle =   "Proc. 4th IEEE International Symposium on Intelligent Control"
+, year =        1989
+, pages =       "??"
+, keywords =    "motion planning"
 }
 
 @inproceedings{dx-tstob-91
-, author =	"B. R. Donald and P. Xavier"
-, title =	"Time-safety trade-offs and a bang-bang algorithm for kinodynamic planning"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1991
-, pages =	"525--527"
-, keywords =	"motion planning"
+, author =      "B. R. Donald and P. Xavier"
+, title =       "Time-safety trade-offs and a bang-bang algorithm for kinodynamic planning"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1991
+, pages =       "525--527"
+, keywords =    "motion planning"
 }
 
 % paper and info from Donald's web site:
 @article{dxcr-kmp-93
-, author =	"B. R. Donald and P. Xavier and J. Canny and J. Reif"
-, title =	"Kinodynamic Motion Planning"
-, journal =	"J. ACM"
-, volume =	40
-, number =	5
-, month =	nov
-, year =	1993
-, pages =	"1048--1066"
-, succeeds =	"cdrx-ckp-88"
-, update =	"98.03 mitchell"
+, author =      "B. R. Donald and P. Xavier and J. Canny and J. Reif"
+, title =       "Kinodynamic Motion Planning"
+, journal =     "J. ACM"
+, volume =      40
+, number =      5
+, month =       nov
+, year =        1993
+, pages =       "1048--1066"
+, succeeds =    "cdrx-ckp-88"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{dx-pgaao-90
-, author =	"B. R. Donald and P. G. Xavier"
-, title =	"Provably good approximation algorithms for optimal kinodynamic planning for {Cartesian} robots and open chain manipulators"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"290--300"
-, precedes =	"dx-pgaao-95"
-, cites =	"as-rac-86, bdg-tocrm-85, b-rmpc-82, c-cdmp-86, d-samps-87, cdrx-ckp-88, cr-nlbtr-87, dx-pgaao-89, dx-nokpr-89, dx-pgaao-90t, fw-pcm-88, gl-mc-83, hp-brd-89, h-dsmt-83t, jc-pspmr-89, jhcp-pgnto-89i, l-spcsa-83, o-mpic-86, p-aspmt-85, ps-coac-82, pt-ipct-86, rt-akpul-89, sh-pmttr-85, s-obbtr-87, sd-gtomr-88, ss-rtoct-85, ss-tocm-86, w-mpav-88, y-amp-87, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex"
+, author =      "B. R. Donald and P. G. Xavier"
+, title =       "Provably good approximation algorithms for optimal kinodynamic planning for {Cartesian} robots and open chain manipulators"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "290--300"
+, precedes =    "dx-pgaao-95"
+, cites =       "as-rac-86, bdg-tocrm-85, b-rmpc-82, c-cdmp-86, d-samps-87, cdrx-ckp-88, cr-nlbtr-87, dx-pgaao-89, dx-nokpr-89, dx-pgaao-90t, fw-pcm-88, gl-mc-83, hp-brd-89, h-dsmt-83t, jc-pspmr-89, jhcp-pgnto-89i, l-spcsa-83, o-mpic-86, p-aspmt-85, ps-coac-82, pt-ipct-86, rt-akpul-89, sh-pmttr-85, s-obbtr-87, sd-gtomr-88, ss-rtoct-85, ss-tocm-86, w-mpav-88, y-amp-87, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{d-mpsdf-84
-, author =	"R. B. Donald"
-, title =	"Motion Planning with Six Degrees of Freedom"
-, number =	"AI-TR-791"
-, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "R. B. Donald"
+, title =       "Motion Planning with Six Degrees of Freedom"
+, number =      "AI-TR-791"
+, institution = "Artif. Intell. Lab., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{dw-eabmo-83
-, author =	"W. E. Donath and C. K. Wong"
-, title =	"An efficient algorithm for boolean mask operations"
-, booktitle =	"Internat. Conf. Computer Design"
-, year =	1983
-, pages =	"358--360"
-, keywords =	"polygons, Boolean operations"
-, update =	"95.09 korneenko"
+, author =      "W. E. Donath and C. K. Wong"
+, title =       "An efficient algorithm for boolean mask operations"
+, booktitle =   "Internat. Conf. Computer Design"
+, year =        1983
+, pages =       "358--360"
+, keywords =    "polygons, Boolean operations"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{dcl-cfdfb-89
-, author =	"S. Dong and J. Cong and C. L. Liu"
-, title =	"Constraint Floorplan Design for Flexible Blocks"
-, booktitle =	"IEEE Int. Conf. on Computer-Aided Design"
-, year =	1989
-, pages =	"488--491"
-, update =	"98.11 bibrelex"
+, author =      "S. Dong and J. Cong and C. L. Liu"
+, title =       "Constraint Floorplan Design for Flexible Blocks"
+, booktitle =   "IEEE Int. Conf. on Computer-Aided Design"
+, year =        1989
+, pages =       "488--491"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{dmss-imt3d-94
-, author =	"W. P. Dong and E. Mainsah and P. F. Sullivan and K. F. Stout"
-, title =	"Instruments and Measurement Techniques of 3-Dimensional Surface Topography"
-, editor =	"K. F. Stout"
-, booktitle =	"Three-Dimensional Surface Topography: Measurement, Interpretation and Applications"
-, publisher =	"Penton Press"
-, address =	"Bristol, Penn."
-, year =	1994
-, update =	"96.09 orourke"
+, author =      "W. P. Dong and E. Mainsah and P. F. Sullivan and K. F. Stout"
+, title =       "Instruments and Measurement Techniques of 3-Dimensional Surface Topography"
+, editor =      "K. F. Stout"
+, booktitle =   "Three-Dimensional Surface Topography: Measurement, Interpretation and Applications"
+, publisher =   "Penton Press"
+, address =     "Bristol, Penn."
+, year =        1994
+, update =      "96.09 orourke"
 }
 
 @article{dw-mgvfs-91
-, author =	"X. Dong and M. J. Wozny"
-, title =	"A method for generating volumetric features from surface features"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	3
-, year =	1991
-, pages =	"281--297"
-, keywords =	"computer aided design, computer aided manufacturing, geometric modeling, feature extraction"
+, author =      "X. Dong and M. J. Wozny"
+, title =       "A method for generating volumetric features from surface features"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      3
+, year =        1991
+, pages =       "281--297"
+, keywords =    "computer aided design, computer aided manufacturing, geometric modeling, feature extraction"
 }
 
 @book{dmbs-lug-79
-, author =	"J. J. Dongarra and C. B. Moler and J. R. Bunch and G. W. Stewart"
-, title =	"{LINPACK} Users' Guide"
-, publisher =	"SIAM Press"
-, address =	"Philadelphia, PA"
-, year =	1979
-, update =	"95.05 agarwal"
+, author =      "J. J. Dongarra and C. B. Moler and J. R. Bunch and G. W. Stewart"
+, title =       "{LINPACK} Users' Guide"
+, publisher =   "SIAM Press"
+, address =     "Philadelphia, PA"
+, year =        1979
+, update =      "95.05 agarwal"
 }
 
 @incollection{dh-nbp-83
-, author =	"D. L. Donoho and P. J. Huber"
-, title =	"The notion of breakdown point"
-, editor =	"P. J. Bickel and K. Doksun and J. L. Hodges"
-, booktitle =	"A Festschrift for Erich L. Lehmann"
-, publisher =	"Wadsworth International Group"
-, address =	"Belmont, CA"
-, year =	1983
-, pages =	"157--184"
-, update =	"98.07 bibrelex"
+, author =      "D. L. Donoho and P. J. Huber"
+, title =       "The notion of breakdown point"
+, editor =      "P. J. Bickel and K. Doksun and J. L. Hodges"
+, booktitle =   "A Festschrift for Erich L. Lehmann"
+, publisher =   "Wadsworth International Group"
+, address =     "Belmont, CA"
+, year =        1983
+, pages =       "157--184"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{do-npbr-01
-, author =	"Melody Donoso and Joseph O'Rourke"
-, title =	"Nonorthogonal Polyhedra Built from Rectangles"
-, type =	"Technical {Report}"
-, number =	073
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA, USA"
-, month =	oct
-, year =	2001
-, url =	"https://arXiv.org/abs/cs/0110059/"
-, comments =	"Answers a question posed in bls-wcnfp-99"
-, update =	"01.11 orourke"
+, author =      "Melody Donoso and Joseph O'Rourke"
+, title =       "Nonorthogonal Polyhedra Built from Rectangles"
+, type =        "Technical {Report}"
+, number =      073
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA, USA"
+, month =       oct
+, year =        2001
+, url = "https://arXiv.org/abs/cs/0110059/"
+, comments =    "Answers a question posed in bls-wcnfp-99"
+, update =      "01.11 orourke"
 }
 
 @incollection{dh-docfc-94
-, author =	"Walt Donovan and Tim Van Hook"
-, title =	"Direct Outcode Calculation for Faster Clip Testing"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"125--131"
-, keywords =	"IEEE floating point arithmetic, line clipping"
-, update =	"94.09 heckbert"
-, annote =	"A clever optimization of clip testing that exploits the
+, author =      "Walt Donovan and Tim Van Hook"
+, title =       "Direct Outcode Calculation for Faster Clip Testing"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "125--131"
+, keywords =    "IEEE floating point arithmetic, line clipping"
+, update =      "94.09 heckbert"
+, annote =      "A clever optimization of clip testing that exploits the
 properties of IEEE floating point format. Techniques are described to
 compute the ``outcodes'' needed for line clipping using only integer
 arithmetic. Contains C code."
 }
 
 @article{ds-brdsn-78
-, author =	"D. Doo and M. Sabin"
-, title =	"Behaviour of recursive division surfaces near extraordinary points"
-, journal =	"Comput. Aided Design"
-, volume =	10
-, year =	1978
-, pages =	"356--360"
+, author =      "D. Doo and M. Sabin"
+, title =       "Behaviour of recursive division surfaces near extraordinary points"
+, journal =     "Comput. Aided Design"
+, volume =      10
+, year =        1978
+, pages =       "356--360"
 }
 
 @inproceedings{d-sasdi-78
-, author =	"D. H. Doo"
-, title =	"A subdivision algorithm for smoothing down irregularly shaped polyhedrons"
-, booktitle =	"Proc. IEEE Internat. Conf. Techniques Comput.-Aided Design"
-, year =	1978
-, pages =	"157--165"
+, author =      "D. H. Doo"
+, title =       "A subdivision algorithm for smoothing down irregularly shaped polyhedrons"
+, booktitle =   "Proc. IEEE Internat. Conf. Techniques Comput.-Aided Design"
+, year =        1978
+, pages =       "157--165"
 }
 
 @unpublished{dz-sompp-99
-, author =	"D. Dor and U. Zwick"
-, title =	"Sokaban and other motion planning problems"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, year =	1999
-, url =	"http://www.math.tau.ac.il/~ddorit/"
-, update =	"00.03 orourke"
+, author =      "D. Dor and U. Zwick"
+, title =       "Sokaban and other motion planning problems"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, year =        1999
+, url = "http://www.math.tau.ac.il/~ddorit/"
+, update =      "00.03 orourke"
 }
 
 @inproceedings{dlpw-stmas-97
-, author =	"Carsten Dorgerloh and Jens L{\"u}ssem and Morakot Pilouk and J{\"u}rgen Wirtgen"
-, title =	"Some Tools for Modeling and Analysis of Surfaces"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"263--267"
-, update =	"97.11 jones"
+, author =      "Carsten Dorgerloh and Jens L{\"u}ssem and Morakot Pilouk and J{\"u}rgen Wirtgen"
+, title =       "Some Tools for Modeling and Analysis of Surfaces"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "263--267"
+, update =      "97.11 jones"
 }
 
 @article{db-ccppf-83
-, author =	"D. Dori and M. Ben-Bassat"
-, title =	"Circumscribing a Convex Polygon by a Polygon of Fewer Sides with Minimal Area Addition"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	24
-, year =	1983
-, pages =	"131--159"
-, keywords =	"polygons, extremal figures, area"
-, update =	"95.09 korneenko, 93.09 held"
-, annote =	"erratic"
+, author =      "D. Dori and M. Ben-Bassat"
+, title =       "Circumscribing a Convex Polygon by a Polygon of Fewer Sides with Minimal Area Addition"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      24
+, year =        1983
+, pages =       "131--159"
+, keywords =    "polygons, extremal figures, area"
+, update =      "95.09 korneenko, 93.09 held"
+, annote =      "erratic"
 }
 
 @article{db-enccf-84
-, author =	"D. Dori and M. Ben-Bassat"
-, title =	"Efficient nesting of congruent convex figures"
-, journal =	"Commun. ACM"
-, volume =	27
-, year =	1984
-, pages =	"228--235"
+, author =      "D. Dori and M. Ben-Bassat"
+, title =       "Efficient nesting of congruent convex figures"
+, journal =     "Commun. ACM"
+, volume =      27
+, year =        1984
+, pages =       "228--235"
 }
 
 @article{d-mdcm-93
-, author =	"D. Dorling"
-, title =	"Map design for census mapping"
-, journal =	"The Geographic J."
-, volume =	30
-, year =	1993
-, pages =	"167--179"
-, update =	"98.03 bibrelex"
+, author =      "D. Dorling"
+, title =       "Map design for census mapping"
+, journal =     "The Geographic J."
+, volume =      30
+, year =        1993
+, pages =       "167--179"
+, update =      "98.03 bibrelex"
 }
 
 @article{d-naplc-90
-, author =	"M. Dorr"
-, title =	"A new approach to parametric line clipping"
-, journal =	"Computers \& Graphics"
-, volume =	14
-, number =	"3--4"
-, year =	1990
-, pages =	"449--464"
-, keywords =	"polygons, clipping"
-, update =	"95.09 korneenko"
+, author =      "M. Dorr"
+, title =       "A new approach to parametric line clipping"
+, journal =     "Computers \& Graphics"
+, volume =      14
+, number =      "3--4"
+, year =        1990
+, pages =       "449--464"
+, keywords =    "polygons, clipping"
+, update =      "95.09 korneenko"
 }
 
 @article{d-dslsp-89
-, author =	"L. Dorst"
-, title =	"Discrete straight line segments: parameters, primitives and properties"
-, journal =	"Math. Res."
-, volume =	51
-, year =	1989
-, pages =	"11--18"
-, note =	"Proc. Geobild '89"
-, keywords =	"digital geometry"
-, update =	"95.09 korneenko"
+, author =      "L. Dorst"
+, title =       "Discrete straight line segments: parameters, primitives and properties"
+, journal =     "Math. Res."
+, volume =      51
+, year =        1989
+, pages =       "11--18"
+, note =        "Proc. Geobild '89"
+, keywords =    "digital geometry"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{dmt-grppp-89
-, author =	"L. Dorst and I. Mandhyan and K. Trovato"
-, title =	"Geometrical representation of path planning problems"
-, booktitle =	"Proc. 2nd International Conference on Intelligent Autonomous Systems"
-, month =	dec
-, year =	1989
-, update =	"96.05 efrat, 93.09 milone+mitchell"
-, abstract =	"The path planning problem for arbitrary devices is first and
+, author =      "L. Dorst and I. Mandhyan and K. Trovato"
+, title =       "Geometrical representation of path planning problems"
+, booktitle =   "Proc. 2nd International Conference on Intelligent Autonomous Systems"
+, month =       dec
+, year =        1989
+, update =      "96.05 efrat, 93.09 milone+mitchell"
+, abstract =    "The path planning problem for arbitrary devices is first and
 foremost a geometrical problem.  For the field of control theory, advanced
 mathematical techniques have been developed to describe and use geometrical
 structure.  In this paper we use the notions of the flow of vector fields and
@@ -48598,879 +48598,879 @@ @inproceedings{dmt-grppp-89
 }
 
 @article{ds-drsl-84
-, author =	"L. Dorst and A. W. M. Smeulders"
-, title =	"Discrete representation of straight lines"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	6
-, year =	1984
-, pages =	"450--463"
-, keywords =	"digital geometry"
-, update =	"95.09 korneenko"
+, author =      "L. Dorst and A. W. M. Smeulders"
+, title =       "Discrete representation of straight lines"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      6
+, year =        1984
+, pages =       "450--463"
+, keywords =    "digital geometry"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{ds-dslsp-91
-, author =	"L. Dorst and A. W. M. Smeulders"
-, title =	"Discrete straight line segments: parameters, primitives and properties"
-, booktitle =	"Vision Geom.: Proc. AMS Spec. Sess. Hoboken, NJ 1989. Providence, R.I."
-, year =	1991
-, pages =	"45--62"
-, keywords =	"digital geometry"
-, update =	"95.09 korneenko"
+, author =      "L. Dorst and A. W. M. Smeulders"
+, title =       "Discrete straight line segments: parameters, primitives and properties"
+, booktitle =   "Vision Geom.: Proc. AMS Spec. Sess. Hoboken, NJ 1989. Providence, R.I."
+, year =        1991
+, pages =       "45--62"
+, keywords =    "digital geometry"
+, update =      "95.09 korneenko"
 }
 
 @techreport{d-soshs-91
-, author =	"S. E. Dorward"
-, title =	"A survey of object-space hidden surface removal"
-, type =	"Technical Memorandum"
-, number =	"11271-911009-11TM"
-, institution =	"AT\&T Bell Laboratories, Murray Hill, NJ"
-, year =	1991
-, precedes =	"d-soshs-94"
-, update =	"99.07 smid"
+, author =      "S. E. Dorward"
+, title =       "A survey of object-space hidden surface removal"
+, type =        "Technical Memorandum"
+, number =      "11271-911009-11TM"
+, institution = "AT\&T Bell Laboratories, Murray Hill, NJ"
+, year =        1991
+, precedes =    "d-soshs-94"
+, update =      "99.07 smid"
 }
 
 @article{d-soshs-94
-, author =	"S. E. Dorward"
-, title =	"A survey of object-space hidden surface removal"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"325--362"
-, succeeds =	"d-soshs-91"
-, update =	"95.01 orourke"
+, author =      "S. E. Dorward"
+, title =       "A survey of object-space hidden surface removal"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "325--362"
+, succeeds =    "d-soshs-91"
+, update =      "95.01 orourke"
 }
 
 @article{drs-fctcm-74
-, author =	"P. Doubilet and G.-C. Rota and J. Stein"
-, title =	"On the foundations of combinatorial theory: ix, combinatorial methods in invariant theory"
-, journal =	"Studies in Applied Math"
-, volume =	53
-, year =	1974
-, pages =	"185--216"
-, update =	"97.11 bibrelex"
+, author =      "P. Doubilet and G.-C. Rota and J. Stein"
+, title =       "On the foundations of combinatorial theory: ix, combinatorial methods in invariant theory"
+, journal =     "Studies in Applied Math"
+, volume =      53
+, year =        1974
+, pages =       "185--216"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{d-cvmar-94
-, author =	"Jean-Fran{\c c}ois Dou{\'e}"
-, title =	"{C}++ Vector and Matrix Algebra Routines"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"534--557"
-, keywords =	"vector algebra, transformation, ray tracing"
-, update =	"94.09 heckbert"
-, annote =	"A C++ subroutine library for 2D, 3D, and 4D vector and
+, author =      "Jean-Fran{\c c}ois Dou{\'e}"
+, title =       "{C}++ Vector and Matrix Algebra Routines"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "534--557"
+, keywords =    "vector algebra, transformation, ray tracing"
+, update =      "94.09 heckbert"
+, annote =      "A C++ subroutine library for 2D, 3D, and 4D vector and
 matrix operations. Contains C++ code. The Floppy disk that comes with the
 book and the FTP collection contain a simple ray tracer written using the
 library."
 }
 
 @article{dcn-accac-85
-, author =	"J. A. Dougenik and N. R. Chrisman and D. R. Niemeyer"
-, title =	"An algorithm to construct continuous area cartograms"
-, journal =	"Professional Geographer"
-, volume =	37
-, year =	1985
-, pages =	"75--81"
-, update =	"98.03 bibrelex"
+, author =      "J. A. Dougenik and N. R. Chrisman and D. R. Niemeyer"
+, title =       "An algorithm to construct continuous area cartograms"
+, journal =     "Professional Geographer"
+, volume =      37
+, year =        1985
+, pages =       "75--81"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{d-lcpgi-93
-, author =	"David H. Douglas"
-, title =	"Least Cost Path in Geographic Information Systems"
-, type =	"Research Note No. 61"
-, institution =	"Department of Geography, University of Ottawa"
-, address =	"Ottawa, Ontario"
-, month =	aug
-, year =	1993
-, keywords =	"shortest paths, weighted region problem, GIS, Snell's Law"
-, update =	"98.03 mitchell"
-, annote =	"paper was submitted to a journal. Has it appeared??"
+, author =      "David H. Douglas"
+, title =       "Least Cost Path in Geographic Information Systems"
+, type =        "Research Note No. 61"
+, institution = "Department of Geography, University of Ottawa"
+, address =     "Ottawa, Ontario"
+, month =       aug
+, year =        1993
+, keywords =    "shortest paths, weighted region problem, GIS, Snell's Law"
+, update =      "98.03 mitchell"
+, annote =      "paper was submitted to a journal. Has it appeared??"
 }
 
 @article{d-vcpcp-72
-, author =	"David H. Douglas"
-, title =	"Viewblock: A Computer Program for Constructing Perspective View Block Diagrams"
-, journal =	"Revue de Geographie de Montreal"
-, volume =	"XXVI"
-, number =	1
-, month =	jan
-, year =	1972
-, pages =	"102--104"
-, update =	"93.09 franklin"
+, author =      "David H. Douglas"
+, title =       "Viewblock: A Computer Program for Constructing Perspective View Block Diagrams"
+, journal =     "Revue de Geographie de Montreal"
+, volume =      "XXVI"
+, number =      1
+, month =       jan
+, year =        1972
+, pages =       "102--104"
+, update =      "93.09 franklin"
 }
 
 % ### check: vol. 13, pp. 167--184
 @article{dp-arnpr-73
-, author =	"David H. Douglas and Thomas K. Peucker"
-, title =	"Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature"
-, journal =	"Canadian Cartographer"
-, volume =	10
-, number =	2
-, month =	dec
-, year =	1973
-, pages =	"112--122"
-, update =	"95.09 korneenko, 93.09 franklin"
+, author =      "David H. Douglas and Thomas K. Peucker"
+, title =       "Algorithms for the Reduction of the Number of Points Required to Represent a Digitized Line or Its Caricature"
+, journal =     "Canadian Cartographer"
+, volume =      10
+, number =      2
+, month =       dec
+, year =        1973
+, pages =       "112--122"
+, update =      "95.09 korneenko, 93.09 franklin"
 }
 
 @article{dd-pp-92
-, author =	"K. A. Dowsland and W. B. Dowsland"
-, title =	"Packing problems"
-, journal =	"European J. Oper. Res."
-, volume =	56
-, year =	1992
-, pages =	"2--14"
-, update =	"98.07 bibrelex"
+, author =      "K. A. Dowsland and W. B. Dowsland"
+, title =       "Packing problems"
+, journal =     "European J. Oper. Res."
+, volume =      56
+, year =        1992
+, pages =       "2--14"
+, update =      "98.07 bibrelex"
 }
 
 @article{dd-sdai-96
-, author =	"John Doyle and Thomas Dean and others"
-, title =	"Strategic Directions in Artificial Intelligence"
-, journal =	"ACM Comput. Surv."
-, volume =	28
-, number =	4
-, year =	1996
-, update =	"97.03 tamassia"
+, author =      "John Doyle and Thomas Dean and others"
+, title =       "Strategic Directions in Artificial Intelligence"
+, journal =     "ACM Comput. Surv."
+, volume =      28
+, number =      4
+, year =        1996
+, update =      "97.03 tamassia"
 }
 
 @techreport{dbd-fshp-79
-, author =	"J. Dozier and J. Bruno and P. Downey"
-, title =	"A faster solution to the horizon problem"
-, type =	"Report"
-, number =	"TR-CSL-7907"
-, institution =	"Comput. Syst. Lab., Univ. California"
-, address =	"Santa Barbara, CA"
-, year =	1979
+, author =      "J. Dozier and J. Bruno and P. Downey"
+, title =       "A faster solution to the horizon problem"
+, type =        "Report"
+, number =      "TR-CSL-7907"
+, institution = "Comput. Syst. Lab., Univ. California"
+, address =     "Santa Barbara, CA"
+, year =        1979
 }
 
 @inproceedings{db-dcghs-94
-, author =	"F. F. Dragan and A. Brandst{\"a}dt"
-, title =	"Dominating cliques in graphs with hypertree structure"
-, booktitle =	"Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	775
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"735--746"
-, update =	"98.07 bibrelex"
+, author =      "F. F. Dragan and A. Brandst{\"a}dt"
+, title =       "Dominating cliques in graphs with hypertree structure"
+, booktitle =   "Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      775
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "735--746"
+, update =      "98.07 bibrelex"
 }
 
 @article{dm-cblnm-97
-, author =	"D. Dragomatz and S. Mann"
-, title =	"A Classified Bibliography of Literature on {NC} Milling Path Generation"
-, journal =	"Comput. Aided Design"
-, volume =	29
-, number =	3
-, month =	mar
-, year =	1997
-, pages =	"239--247"
-, update =	"97.07 held"
+, author =      "D. Dragomatz and S. Mann"
+, title =       "A Classified Bibliography of Literature on {NC} Milling Path Generation"
+, journal =     "Comput. Aided Design"
+, volume =      29
+, number =      3
+, month =       mar
+, year =        1997
+, pages =       "239--247"
+, update =      "97.07 held"
 }
 
 @techreport{d-ec-83
-, author =	"J.-M. Drappier"
-, title =	"Enveloppes Convexes"
-, institution =	"Centre CPAO, ENSTA Palaiseau"
-, year =	1983
-, comments =	"Survey about convex hull algorithms in 2D and experimental results, in french"
-, update =	"97.03 icking"
+, author =      "J.-M. Drappier"
+, title =       "Enveloppes Convexes"
+, institution = "Centre CPAO, ENSTA Palaiseau"
+, year =        1983
+, comments =    "Survey about convex hull algorithms in 2D and experimental results, in french"
+, update =      "97.03 icking"
 }
 
 @book{d-sagd-64
-, author =	"A. Dresden"
-, title =	"Solid Analytic Geometry and Determinants"
-, publisher =	"Dover"
-, address =	"New York, NY"
-, year =	1964
-, update =	"98.03 bibrelex"
+, author =      "A. Dresden"
+, title =       "Solid Analytic Geometry and Determinants"
+, publisher =   "Dover"
+, address =     "New York, NY"
+, year =        1964
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{df-fsaal-94
-, author =	"G. Drettakis and E. Fiume"
-, title =	"A fast shadow algorithm for area light sources using back projection"
-, editor =	"A. Glassner"
-, booktitle =	"Proc. SIGGRAPH '94"
-, site =	"Orlando, FL"
-, publisher =	"ACM Press"
-, month =	jul
-, year =	1994
-, pages =	"223--230"
-, update =	"98.07 bibrelex"
+, author =      "G. Drettakis and E. Fiume"
+, title =       "A fast shadow algorithm for area light sources using back projection"
+, editor =      "A. Glassner"
+, booktitle =   "Proc. SIGGRAPH '94"
+, site =        "Orlando, FL"
+, publisher =   "ACM Press"
+, month =       jul
+, year =        1994
+, pages =       "223--230"
+, update =      "98.07 bibrelex"
 }
 
 @article{dw-spg-72
-, author =	"S. E. Dreyfus and R. A. Wagner"
-, title =	"The {Steiner} problem in graphs"
-, journal =	"Networks"
-, volume =	1
-, year =	1972
-, pages =	"195--207"
-, update =	"98.07 bibrelex"
+, author =      "S. E. Dreyfus and R. A. Wagner"
+, title =       "The {Steiner} problem in graphs"
+, journal =     "Networks"
+, volume =      1
+, year =        1972
+, pages =       "195--207"
+, update =      "98.07 bibrelex"
 }
 
 @article{d-clstf-82
-, author =	"Z. Drezner"
-, title =	"Competitive location strategies for two facilities"
-, journal =	"Region. Sci. Urban Econ."
-, volume =	12
-, year =	1982
-, pages =	"485--493"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "Z. Drezner"
+, title =       "Competitive location strategies for two facilities"
+, journal =     "Region. Sci. Urban Econ."
+, volume =      12
+, year =        1982
+, pages =       "485--493"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @article{d-cpcp-89
-, author =	"Z. Drezner"
-, title =	"Conditional $p$-centre problems"
-, journal =	"Transp. Sci."
-, volume =	23
-, number =	1
-, year =	1989
-, pages =	"51--53"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "Z. Drezner"
+, title =       "Conditional $p$-centre problems"
+, journal =     "Transp. Sci."
+, volume =      23
+, number =      1
+, year =        1989
+, pages =       "51--53"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @book{d-fl-95
-, title =	"Facility Location"
-, editor =	"Z. Drezner"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1995
-, update =	"96.05 agarwal"
+, title =       "Facility Location"
+, editor =      "Z. Drezner"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1995
+, update =      "96.05 agarwal"
 }
 
 @article{d-mmsas-88
-, author =	"Z. Drezner"
-, title =	"Maximizing the minimum sight angle of a set of shapes"
-, journal =	"IIE Trans."
-, volume =	20
-, number =	2
-, year =	1988
-, pages =	"194--200"
-, keywords =	"optimization"
-, update =	"95.09 korneenko"
+, author =      "Z. Drezner"
+, title =       "Maximizing the minimum sight angle of a set of shapes"
+, journal =     "IIE Trans."
+, volume =      20
+, number =      2
+, year =        1988
+, pages =       "194--200"
+, keywords =    "optimization"
+, update =      "95.09 korneenko"
 }
 
 @article{d-m1cp-81
-, author =	"Z. Drezner"
-, title =	"On a modified $1$-center problem"
-, journal =	"Manage. Sci."
-, volume =	27
-, year =	1981
-, pages =	"838--851"
+, author =      "Z. Drezner"
+, title =       "On a modified $1$-center problem"
+, journal =     "Manage. Sci."
+, volume =      27
+, year =        1981
+, pages =       "838--851"
 }
 
 @article{d-rpcp-87
-, author =	"Z. Drezner"
-, title =	"On the rectangular $p$-center problem"
-, journal =	"Naval Res. Logist. Q."
-, volume =	34
-, year =	1987
-, pages =	"229--234"
-, keywords =	"facility location, $l_1$-metric"
-, update =	"95.09 korneenko"
+, author =      "Z. Drezner"
+, title =       "On the rectangular $p$-center problem"
+, journal =     "Naval Res. Logist. Q."
+, volume =      34
+, year =        1987
+, pages =       "229--234"
+, keywords =    "facility location, $l_1$-metric"
+, update =      "95.09 korneenko"
 }
 
 @article{d-pcp-86
-, author =	"Z. Drezner"
-, title =	"The $p$-center problem"
-, journal =	"European J. Oper. Res."
-, volume =	26
-, number =	2
-, year =	1986
-, pages =	"312--313"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "Z. Drezner"
+, title =       "The $p$-center problem"
+, journal =     "European J. Oper. Res."
+, volume =      26
+, number =      2
+, year =        1986
+, pages =       "312--313"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @article{d-pcpho-84
-, author =	"Z. Drezner"
-, title =	"The $p$-centre problems --- {Heuristic} and optimal algorithms"
-, journal =	"J. Oper. Res. Soc."
-, volume =	35
-, year =	1984
-, pages =	"741--748"
-, keywords =	"facility location"
-, update =	"96.05 agarwal"
+, author =      "Z. Drezner"
+, title =       "The $p$-centre problems --- {Heuristic} and optimal algorithms"
+, journal =     "J. Oper. Res. Soc."
+, volume =      35
+, year =        1984
+, pages =       "741--748"
+, keywords =    "facility location"
+, update =      "96.05 agarwal"
 }
 
 @article{d-ptctm-84
-, author =	"Z. Drezner"
-, title =	"The planar two-center and two-median problem"
-, journal =	"Transp. Sci."
-, volume =	18
-, year =	1984
-, pages =	"351--361"
-, keywords =	"facility location"
-, update =	"96.05 agarwal"
+, author =      "Z. Drezner"
+, title =       "The planar two-center and two-median problem"
+, journal =     "Transp. Sci."
+, volume =      18
+, year =        1984
+, pages =       "351--361"
+, keywords =    "facility location"
+, update =      "96.05 agarwal"
 }
 
 @article{dmw-flpld-91
-, author =	"Z. Drezner and A. Mehrez and G. O. Wesolowsky"
-, title =	"The facility location problems with limited distances"
-, journal =	"Transp. Sci."
-, volume =	25
-, year =	1992
-, pages =	"183--187"
-, keywords =	"facility location"
-, update =	"96.05 agarwal"
+, author =      "Z. Drezner and A. Mehrez and G. O. Wesolowsky"
+, title =       "The facility location problems with limited distances"
+, journal =     "Transp. Sci."
+, volume =      25
+, year =        1992
+, pages =       "183--187"
+, keywords =    "facility location"
+, update =      "96.05 agarwal"
 }
 
 @article{ds-ceha1-87
-, author =	"Z. Drezner and S. Shelah"
-, title =	"On the complexity of the {Elzinga-Hearn} algorithm for the $1$-center problem"
-, journal =	"Math. Oper. Res."
-, volume =	12
-, number =	2
-, year =	1987
-, pages =	"255--261"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "Z. Drezner and S. Shelah"
+, title =       "On the complexity of the {Elzinga-Hearn} algorithm for the $1$-center problem"
+, journal =     "Math. Oper. Res."
+, volume =      12
+, number =      2
+, year =        1987
+, pages =       "255--261"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @article{dw-lor-89
-, author =	"Z. Drezner and G. O. Wesolowski"
-, title =	"Location of an obnoxious route"
-, journal =	"J. Oper. Res. Society"
-, volume =	40
-, number =	11
-, year =	1989
-, pages =	"1011--1018"
-, keywords =	"facility location, points, convex polygon"
-, update =	"95.09 korneenko"
+, author =      "Z. Drezner and G. O. Wesolowski"
+, title =       "Location of an obnoxious route"
+, journal =     "J. Oper. Res. Society"
+, volume =      40
+, number =      11
+, year =        1989
+, pages =       "1011--1018"
+, keywords =    "facility location, points, convex polygon"
+, update =      "95.09 korneenko"
 }
 
 @article{dw-lmof-??
-, author =	"Z. Drezner and G. O. Wesolowsky"
-, title =	"Location of multiple obnoxious facilities"
-, year =	"??"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "Z. Drezner and G. O. Wesolowsky"
+, title =       "Location of multiple obnoxious facilities"
+, year =        "??"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @article{dw-mmflp-83
-, author =	"Z. Drezner and G. O. Wesolowsky"
-, title =	"Minmax and maxmin facility location problems on a sphere"
-, journal =	"Naval Res. Logist. Q."
-, volume =	30
-, year =	1983
-, pages =	"305--312"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "Z. Drezner and G. O. Wesolowsky"
+, title =       "Minmax and maxmin facility location problems on a sphere"
+, journal =     "Naval Res. Logist. Q."
+, volume =      30
+, year =        1983
+, pages =       "305--312"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @article{dgrt-rhafh-88
-, author =	"J. R. Driscoll and H. N. Gabow and R. Shrairaman and R. E. Tarjan"
-, title =	"Relaxed heaps: {An} alternative to {Fibonacci} heaps with applications to parallel computation."
-, journal =	"Commun. ACM"
-, volume =	31
-, year =	1988
-, pages =	"1343--1354"
-, keywords =	"shortest paths, Dijkstra, priority queue"
-, update =	"96.05 mitchell"
+, author =      "J. R. Driscoll and H. N. Gabow and R. Shrairaman and R. E. Tarjan"
+, title =       "Relaxed heaps: {An} alternative to {Fibonacci} heaps with applications to parallel computation."
+, journal =     "Commun. ACM"
+, volume =      31
+, year =        1988
+, pages =       "1343--1354"
+, keywords =    "shortest paths, Dijkstra, priority queue"
+, update =      "96.05 mitchell"
 }
 
 @article{dsst-mdsp-89
-, author =	"J. R. Driscoll and N. Sarnak and D. D. Sleator and R. E. Tarjan"
-, title =	"Making data structures persistent"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	38
-, year =	1989
-, pages =	"86--124"
+, author =      "J. R. Driscoll and N. Sarnak and D. D. Sleator and R. E. Tarjan"
+, title =       "Making data structures persistent"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      38
+, year =        1989
+, pages =       "86--124"
 }
 
 @inproceedings{dsst-mdsp-86
-, author =	"J. R. Driscoll and N. Sarnak and S. Sleator and R. E. Tarjan"
-, title =	"Making Data Structures Persistent"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"109--121"
-, update =	"98.03 bibrelex"
+, author =      "J. R. Driscoll and N. Sarnak and S. Sleator and R. E. Tarjan"
+, title =       "Making Data Structures Persistent"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "109--121"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{dms-idpmw-98
-, author =	"R. L. Drysdale and Scott McElfresh and Jack Scott Snoeyink"
-, title =	"An Improved Diamond Property for Minimum-Weight Triangulations"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"65--67"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "R. L. Drysdale and Scott McElfresh and Jack Scott Snoeyink"
+, title =       "An Improved Diamond Property for Minimum-Weight Triangulations"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "65--67"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{dq-ivw5a-94
-, author =	"R. L. Drysdale and J. Quinn"
-, title =	"Intersecting Vectors with 5-Axis Machine Toll Movements"
-, booktitle =	"Proc. 1995 NSF Design and Manufacturing Grantees Conference"
-, year =	1994
-, pages =	"201--202"
-, update =	"97.03 gaertner+salinger"
+, author =      "R. L. Drysdale and J. Quinn"
+, title =       "Intersecting Vectors with 5-Axis Machine Toll Movements"
+, booktitle =   "Proc. 1995 NSF Design and Manufacturing Grantees Conference"
+, year =        1994
+, pages =       "201--202"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{d-pacdt-90
-, author =	"R. L. {Drysdale, III}"
-, title =	"A practical algorithm for computing the {Delaunay} triangulation for convex distance functions"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"159--168"
-, keywords =	"Delaunay triangulation, $L_{1}$ metric, $L_{p}$ metric, $L_{\infty}$ metric, divide-and-conquer, points"
-, update =	"93.09 drysdale"
+, author =      "R. L. {Drysdale, III}"
+, title =       "A practical algorithm for computing the {Delaunay} triangulation for convex distance functions"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "159--168"
+, keywords =    "Delaunay triangulation, $L_{1}$ metric, $L_{p}$ metric, $L_{\infty}$ metric, divide-and-conquer, points"
+, update =      "93.09 drysdale"
 }
 
 @phdthesis{d-gvdgs-79
-, author =	"R. L. {Drysdale, III}"
-, title =	"Generalized {Voronoi} Diagrams and Geometric Searching"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1979
-, note =	"Report STAN-CS-79-705"
-, keywords =	"two-dimensional, doctoral thesis, Voronoi diagrams, line segments"
-, update =	"93.05 jones"
+, author =      "R. L. {Drysdale, III}"
+, title =       "Generalized {Voronoi} Diagrams and Geometric Searching"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1979
+, note =        "Report STAN-CS-79-705"
+, keywords =    "two-dimensional, doctoral thesis, Voronoi diagrams, line segments"
+, update =      "93.05 jones"
 }
 
 @article{dj-nlbma-89
-, author =	"R. L. {Drysdale, III} and J. W. Jaromczyk"
-, title =	"A note on lower bounds for the maximum area and maximum perimeter $k$-gon problems"
-, journal =	"Inform. Process. Lett."
-, volume =	32
-, year =	1989
-, pages =	"301--303"
-, keywords =	"lower bounds, polygons"
-, update =	"93.09 drysdale"
+, author =      "R. L. {Drysdale, III} and J. W. Jaromczyk"
+, title =       "A note on lower bounds for the maximum area and maximum perimeter $k$-gon problems"
+, journal =     "Inform. Process. Lett."
+, volume =      32
+, year =        1989
+, pages =       "301--303"
+, keywords =    "lower bounds, polygons"
+, update =      "93.09 drysdale"
 }
 
 @inproceedings{dj-dsnm-87
-, author =	"R. L. {Drysdale, III} and R. B. Jerard"
-, title =	"Discrete simulation of {NC} machining"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"126--135"
-, keywords =	"CAD, approximation, simulation"
-, precedes =	"djsh-dsnm-89"
-, cites =	"a-sagni-82, acp-ncggm-84, b-ncma-72, c-scads-67, c-gqtm-89, fp-cgdm-79, fd-ficg-82, gr-bscs-74, gz-cccad-84, g-orncm-86, hv-esavp-82, kms-spafa-85, jdh-ucgtd-87, jhd-sncms-86, m-snct-73, og-cgvnc-85, rv-smhsc-82, ra-mecg-76, sjw-cadcs-82, t-rtps-86, vh-rsmmp-81, zb-cstsm-86, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "R. L. {Drysdale, III} and R. B. Jerard"
+, title =       "Discrete simulation of {NC} machining"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "126--135"
+, keywords =    "CAD, approximation, simulation"
+, precedes =    "djsh-dsnm-89"
+, cites =       "a-sagni-82, acp-ncggm-84, b-ncma-72, c-scads-67, c-gqtm-89, fp-cgdm-79, fd-ficg-82, gr-bscs-74, gz-cccad-84, g-orncm-86, hv-esavp-82, kms-spafa-85, jdh-ucgtd-87, jhd-sncms-86, m-snct-73, og-cgvnc-85, rv-smhsc-82, ra-mecg-76, sjw-cadcs-82, t-rtps-86, vh-rsmmp-81, zb-cstsm-86, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{djsh-dsnm-89
-, author =	"R. L. {Drysdale, III} and R. B. Jerard and B. Schaudt and K. Hauck"
-, title =	"Discrete simulation of {NC} machining"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"33--60"
-, keywords =	"CAD, approximation, simulation"
-, succeeds =	"dj-dsnm-87"
-, update =	"93.09 drysdale"
+, author =      "R. L. {Drysdale, III} and R. B. Jerard and B. Schaudt and K. Hauck"
+, title =       "Discrete simulation of {NC} machining"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "33--60"
+, keywords =    "CAD, approximation, simulation"
+, succeeds =    "dj-dsnm-87"
+, update =      "93.09 drysdale"
 }
 
 @inproceedings{dl-gvdp-78
-, author =	"R. L. {Drysdale, III} and D. T. Lee"
-, title =	"Generalized {Voronoi} diagrams in the plane"
-, booktitle =	"Proc. 16th Allerton Conf. Commun. Control Comput."
-, year =	1978
-, pages =	"833--842"
-, precedes =	"ld-gvdp-81"
-, update =	"93.09 drysdale"
+, author =      "R. L. {Drysdale, III} and D. T. Lee"
+, title =       "Generalized {Voronoi} diagrams in the plane"
+, booktitle =   "Proc. 16th Allerton Conf. Commun. Control Comput."
+, year =        1978
+, pages =       "833--842"
+, precedes =    "ld-gvdp-81"
+, update =      "93.09 drysdale"
 }
 
 @techreport{dra-sltgt-95
-, author =	"Robert L. Scot Drysdale and G{\"u}nter Rote and Oswin Aichholzer"
-, title =	"A simple linear time greedy triangulation algorithm for uniformly distributed points"
-, number =	"IIG-408"
-, institution =	"Institutes for Information Processing, Technische Universit{\"a}t Graz"
-, month =	feb
-, year =	1995
-, url =	"http://www.tu-graz.ac.at/Rote"
-, update =	"98.07 bibrelex, 97.03 rote"
-, abstract =	"We present a simple, practical algorithm that computes the
-		greedy triangulation of a set of n points in the plane in
-		expected time O(n) and space O(n), for n points drawn
-		independently from a uniform distribution over some fixed
-		convex shape."
+, author =      "Robert L. Scot Drysdale and G{\"u}nter Rote and Oswin Aichholzer"
+, title =       "A simple linear time greedy triangulation algorithm for uniformly distributed points"
+, number =      "IIG-408"
+, institution = "Institutes for Information Processing, Technische Universit{\"a}t Graz"
+, month =       feb
+, year =        1995
+, url = "http://www.tu-graz.ac.at/Rote"
+, update =      "98.07 bibrelex, 97.03 rote"
+, abstract =    "We present a simple, practical algorithm that computes the
+                greedy triangulation of a set of n points in the plane in
+                expected time O(n) and space O(n), for n points drawn
+                independently from a uniform distribution over some fixed
+                convex shape."
 }
 
 @inproceedings{d-scpps-92
-, author =	"S. Drysdale"
-, title =	"Solving closest-point problems by searching the {Delaunay} diagram"
-, booktitle =	"Proc. 2nd MSI Workshop Comput. Geom."
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "S. Drysdale"
+, title =       "Solving closest-point problems by searching the {Delaunay} diagram"
+, booktitle =   "Proc. 2nd MSI Workshop Comput. Geom."
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @article{dz-hmlrp-90
-, author =	"D. Du and Y. Zhang"
-, title =	"On heuristics for minimum length rectilinear partitions"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"111--128"
+, author =      "D. Du and Y. Zhang"
+, title =       "On heuristics for minimum length rectilinear partitions"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "111--128"
 }
 
 @article{d-src-91
-, author =	"D.-Z. Du"
-, title =	"On {Steiner} ratio conjectures"
-, journal =	"Ann. Oper. Res."
-, volume =	33
-, number =	"1--4"
-, year =	1991
-, pages =	"437--449"
-, keywords =	"Steiner tree"
-, update =	"95.09 korneenko"
+, author =      "D.-Z. Du"
+, title =       "On {Steiner} ratio conjectures"
+, journal =     "Ann. Oper. Res."
+, volume =      33
+, number =      "1--4"
+, year =        1991
+, pages =       "437--449"
+, keywords =    "Steiner tree"
+, update =      "95.09 korneenko"
 }
 
 @techreport{dc-11hme-85
-, author =	"D.-Z. Du and Y.-M. Chen"
-, title =	"An ``$11$''-heuristic for minimum edge length rectangular partitions of rectilinear figures"
-, type =	"Report"
-, number =	"??"
-, institution =	"Math. Sci. Res. Inst., Univ. California"
-, address =	"Berkeley, CA"
-, year =	1985
-, precedes =	"dc-fhmel-86"
-, update =	"98.07 bibrelex"
+, author =      "D.-Z. Du and Y.-M. Chen"
+, title =       "An ``$11$''-heuristic for minimum edge length rectangular partitions of rectilinear figures"
+, type =        "Report"
+, number =      "??"
+, institution = "Math. Sci. Res. Inst., Univ. California"
+, address =     "Berkeley, CA"
+, year =        1985
+, precedes =    "dc-fhmel-86"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{dc-fhmel-86
-, author =	"D.-Z. Du and Y.-M. Chen"
-, title =	"On Fast Heuristics for Minimum Edge Length Rectangular Partition"
-, type =	"Technical {Report}"
-, number =	"MSRI-03618-86"
-, institution =	"Math. Sci. Res. Inst., Univ. California"
-, address =	"Berkeley, CA"
-, month =	feb
-, year =	1986
-, succeeds =	"dc-11hme-85"
-, precedes =	""
-, update =	"98.07 bibrelex"
+, author =      "D.-Z. Du and Y.-M. Chen"
+, title =       "On Fast Heuristics for Minimum Edge Length Rectangular Partition"
+, type =        "Technical {Report}"
+, number =      "MSRI-03618-86"
+, institution = "Math. Sci. Res. Inst., Univ. California"
+, address =     "Berkeley, CA"
+, month =       feb
+, year =        1986
+, succeeds =    "dc-11hme-85"
+, precedes =    ""
+, update =      "98.07 bibrelex"
 }
 
 @article{dgglw-mstnp-
-, author =	"D. Z. Du and B. Gao and R. L. Graham and Z.-C. Liu and P.-J. Wan"
-, title =	"Minimum {Steiner} trees in normed planes"
-, journal =	"Discrete Comput. Geom."
-, volume =	"??"
-, year =	"??"
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "D. Z. Du and B. Gao and R. L. Graham and Z.-C. Liu and P.-J. Wan"
+, title =       "Minimum {Steiner} trees in normed planes"
+, journal =     "Discrete Comput. Geom."
+, volume =      "??"
+, year =        "??"
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{dh-sasrp-95
-, author =	"Ding-Zhu Du and Frank Hwang"
-, title =	"The State of Art on {Steiner} Ratio Problems"
-, editor =	"Ding-Zhu Du and Frank Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1995
-, pages =	"195--224"
-, keywords =	"survey paper"
-, succeeds =	"dh-sasrp-92"
-, update =	"98.07 icking"
+, author =      "Ding-Zhu Du and Frank Hwang"
+, title =       "The State of Art on {Steiner} Ratio Problems"
+, editor =      "Ding-Zhu Du and Frank Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1995
+, pages =       "195--224"
+, keywords =    "survey paper"
+, succeeds =    "dh-sasrp-92"
+, update =      "98.07 icking"
 }
 
 % does it end on 135 or 136 ??  check page numbers
 @article{dh-pgpcs-92
-, author =	"D.-Z. Du and F. K. Hwang"
-, title =	"A proof of {Gilbert}-{Pollak}'s conjecture on the {Steiner} ratio"
-, journal =	"Algorithmica"
-, volume =	7
-, year =	1992
-, pages =	"121--135"
-, keywords =	"Steiner tree, minimal spanning tree"
-, update =	"98.03 mitchell, 97.07 smid"
+, author =      "D.-Z. Du and F. K. Hwang"
+, title =       "A proof of {Gilbert}-{Pollak}'s conjecture on the {Steiner} ratio"
+, journal =     "Algorithmica"
+, volume =      7
+, year =        1992
+, pages =       "121--135"
+, keywords =    "Steiner tree, minimal spanning tree"
+, update =      "98.03 mitchell, 97.07 smid"
 }
 
 @inproceedings{dh-aplbs-90
-, author =	"D.-Z. Du and F. K. Hwang"
-, title =	"An approach for proving lower bounds: solution of {Gilbert}-{Pollak} conjecture on {Steiner} ratio"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"76--85"
-, keywords =	"Steiner trees"
+, author =      "D.-Z. Du and F. K. Hwang"
+, title =       "An approach for proving lower bounds: solution of {Gilbert}-{Pollak} conjecture on {Steiner} ratio"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "76--85"
+, keywords =    "Steiner trees"
 }
 
 @book{dh-ceg-92
-, title =	"Computing in {Euclidean} Geometry"
-, editor =	"Ding-Zhu Du and Frank K. Hwang"
-, series =	"Lecture Notes Series on Computing"
-, volume =	1
-, edition =	"1st"
-, publisher =	"World Scientific"
-, year =	1992
-, comments =	"8 chapters, survey articles"
-, precedes =	"dh-ceg-95"
-, update =	"98.07 icking"
+, title =       "Computing in {Euclidean} Geometry"
+, editor =      "Ding-Zhu Du and Frank K. Hwang"
+, series =      "Lecture Notes Series on Computing"
+, volume =      1
+, edition =     "1st"
+, publisher =   "World Scientific"
+, year =        1992
+, comments =    "8 chapters, survey articles"
+, precedes =    "dh-ceg-95"
+, update =      "98.07 icking"
 }
 
 @book{dh-ceg-95
-, title =	"Computing in {Euclidean} Geometry"
-, editor =	"Ding-Zhu Du and Frank K. Hwang"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, year =	1995
-, comments =	"11 chapters, xiii + 492 pages, survey articles,
-		 contains h-dqgpg-95, c-cgr-95, be-mgot-95, cr-mpgt-95, c-rga-95, dh-sasrp-95, f-vddt-95, hv-gcsr2-95, s-pftbs-95, sw-cgtnd-95, and yd-ecp-95"
-, succeeds =	"dh-ceg-92"
-, update =	"98.07 icking, 97.11 bibrelex, 96.05 pocchiola"
+, title =       "Computing in {Euclidean} Geometry"
+, editor =      "Ding-Zhu Du and Frank K. Hwang"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, year =        1995
+, comments =    "11 chapters, xiii + 492 pages, survey articles,
+                 contains h-dqgpg-95, c-cgr-95, be-mgot-95, cr-mpgt-95, c-rga-95, dh-sasrp-95, f-vddt-95, hv-gcsr2-95, s-pftbs-95, sw-cgtnd-95, and yd-ecp-95"
+, succeeds =    "dh-ceg-92"
+, update =      "98.07 icking, 97.11 bibrelex, 96.05 pocchiola"
 }
 
 @article{dh-rspns-92
-, author =	"D. Z. Du and F. K. Hwang"
-, title =	"Reducing the {Steiner} problem in a normed space"
-, journal =	"SIAM J. Comput."
-, volume =	21
-, year =	1992
-, pages =	"1001--1007"
-, update =	"98.03 bibrelex"
+, author =      "D. Z. Du and F. K. Hwang"
+, title =       "Reducing the {Steiner} problem in a normed space"
+, journal =     "SIAM J. Comput."
+, volume =      21
+, year =        1992
+, pages =       "1001--1007"
+, update =      "98.03 bibrelex"
 }
 
 @article{dh-smtbw-87
-, author =	"D.-Z. Du and F. K. Hwang"
-, title =	"Steiner minimal trees for bar waves"
-, journal =	"Acta Math. Appl. Sinica"
-, volume =	"ser.3"
-, year =	1987
-, pages =	"246--256"
-, keywords =	"Steiner tree"
-, update =	"95.09 korneenko"
+, author =      "D.-Z. Du and F. K. Hwang"
+, title =       "Steiner minimal trees for bar waves"
+, journal =     "Acta Math. Appl. Sinica"
+, volume =      "ser.3"
+, year =        1987
+, pages =       "246--256"
+, keywords =    "Steiner tree"
+, update =      "95.09 korneenko"
 }
 
 @incollection{dh-sasrp-92
-, author =	"D.-Z. Du and F. K. Hwang"
-, title =	"The state of art on {Steiner} ratio problems"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	1
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1992
-, pages =	"163--191"
-, keywords =	"survey paper, Steiner ratio proof"
-, precedes =	"dh-sasrp-95"
-, update =	"98.07 icking, 93.09 erickson"
+, author =      "D.-Z. Du and F. K. Hwang"
+, title =       "The state of art on {Steiner} ratio problems"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      1
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1992
+, pages =       "163--191"
+, keywords =    "survey paper, Steiner ratio proof"
+, precedes =    "dh-sasrp-95"
+, update =      "98.07 icking, 93.09 erickson"
 }
 
 @article{dh-srcgp-90
-, author =	"D. Z. Du and F. K. Hwang"
-, title =	"The {Steiner} ratio conjecture of {Gilbert} and {Pollak} is true"
-, journal =	"Proc. Nat. Acad. Sci. USA"
-, volume =	87
-, number =	23
-, year =	1990
-, pages =	"9464--9466"
-, keywords =	"Steiner tree, minimal spanning tree"
-, update =	"95.09 korneenko"
+, author =      "D. Z. Du and F. K. Hwang"
+, title =       "The {Steiner} ratio conjecture of {Gilbert} and {Pollak} is true"
+, journal =     "Proc. Nat. Acad. Sci. USA"
+, volume =      87
+, number =      23
+, year =        1990
+, pages =       "9464--9466"
+, keywords =    "Steiner tree, minimal spanning tree"
+, update =      "95.09 korneenko"
 }
 
 @article{dhst-smtsf-87
-, author =	"D. Z. Du and F. K. Hwang and G. D. Song and G. Y. Ting"
-, title =	"Steiner minimal trees on sets of four points"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"401--414"
+, author =      "D. Z. Du and F. K. Hwang and G. D. Song and G. Y. Ting"
+, title =       "Steiner minimal trees on sets of four points"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "401--414"
 }
 
 @article{dhw-smtrp-87
-, author =	"D. Z. Du and F. K. Hwang and J. F. Weng"
-, title =	"Steiner minimal trees for regular polygons"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"65--84"
+, author =      "D. Z. Du and F. K. Hwang and J. F. Weng"
+, title =       "Steiner minimal trees for regular polygons"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "65--84"
 }
 
 @article{dhw-smtzz-83
-, author =	"D.-Z. Du and F. K. Hwang and J. F. Weng"
-, title =	"Steiner minimal trees on zig-zag line"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	228
-, year =	1983
-, pages =	"149--156"
-, keywords =	"Steiner tree"
-, update =	"95.09 korneenko"
+, author =      "D.-Z. Du and F. K. Hwang and J. F. Weng"
+, title =       "Steiner minimal trees on zig-zag line"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      228
+, year =        1983
+, pages =       "149--156"
+, keywords =    "Steiner tree"
+, update =      "95.09 korneenko"
 }
 
 @article{dhwc-smtpc-85
-, author =	"D.-Z. Du and F. K. Hwang and J. F. Weng and S. C. Chao"
-, title =	"Steiner minimal trees for points on a circle"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	95
-, year =	1985
-, pages =	"613--618"
-, keywords =	"Steiner tree"
-, update =	"95.09 korneenko"
+, author =      "D.-Z. Du and F. K. Hwang and J. F. Weng and S. C. Chao"
+, title =       "Steiner minimal trees for points on a circle"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      95
+, year =        1985
+, pages =       "613--618"
+, keywords =    "Steiner tree"
+, update =      "95.09 korneenko"
 }
 
 @article{dk-drmm-90
-, author =	"D. Z. Du and D. J. Kleitman"
-, title =	"Diameter and radius in the {Manhattan} metric"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"351--356"
+, author =      "D. Z. Du and D. J. Kleitman"
+, title =       "Diameter and radius in the {Manhattan} metric"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "351--356"
 }
 
 @techreport{dps-melgr-86
-, author =	"D.-Z. Du and L.-Q. Pan and M.-T. Shing"
-, title =	"Minimum edge length guillotine rectangular partition"
-, type =	"Report"
-, number =	"02418-86"
-, institution =	"Math. Sci. Res. Inst., Univ. California"
-, address =	"Berkeley, CA"
-, year =	1986
-, update =	"95.01 mitchell"
+, author =      "D.-Z. Du and L.-Q. Pan and M.-T. Shing"
+, title =       "Minimum edge length guillotine rectangular partition"
+, type =        "Report"
+, number =      "02418-86"
+, institution = "Math. Sci. Res. Inst., Univ. California"
+, address =     "Berkeley, CA"
+, year =        1986
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{dzf-bhesm-91
-, author =	"D.-Z. Du and Y. Zhang and Q. Feng"
-, title =	"On better heuristic for {Euclidean} {Steiner} minimum trees"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"431--439"
+, author =      "D.-Z. Du and Y. Zhang and Q. Feng"
+, title =       "On better heuristic for {Euclidean} {Steiner} minimum trees"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "431--439"
 }
 
 @techreport{d-smbgb-87
-, author =	"T. Dub{\'e}"
-, title =	"A survey of methods for bounding {Gr{\"o}bner} bases"
-, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, month =	feb
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "T. Dub{\'e}"
+, title =       "A survey of methods for bounding {Gr{\"o}bner} bases"
+, institution = "Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, month =       feb
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{d-drqor-93
-, author =	"T. Dub{\'e}"
-, title =	"Dominance range-query: the one-reporting case"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"208--217"
-, cites =	"b-mbstu-75, b-mdc-80, bm-ewcds-80, b-gbamp-85, b-hbfcp-87, bfk-ictor-81, c-fsnaq-83, c-lbors1-90, c-lbors2-90, fb-qtdsr-74, f-lbcor-81, lw-wcarp-77, lw-dsdrq-82, m-mdscg-84, o-ddds-83, ps-cgi-85, w-ndsor-85, wl-arrcd-85, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "T. Dub{\'e}"
+, title =       "Dominance range-query: the one-reporting case"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "208--217"
+, cites =       "b-mbstu-75, b-mdc-80, bm-ewcds-80, b-gbamp-85, b-hbfcp-87, bfk-ictor-81, c-fsnaq-83, c-lbors1-90, c-lbors2-90, fb-qtdsr-74, f-lbcor-81, lw-wcarp-77, lw-dsdrq-82, m-mdscg-84, o-ddds-83, ps-cgi-85, w-ndsor-85, wl-arrcd-85, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @techreport{dmy-aobgn-86
-, author =	"T. Dub{\'e} and B. Mishra and C. K. Yap"
-, title =	"Admissible orderings and bounds on {Gr{\"o}bner} normal form algorithm"
-, type =	"Technical {Report}"
-, number =	258
-, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, month =	dec
-, year =	1986
-, note =	"Robotics Report 88"
-, update =	"98.03 bibrelex"
+, author =      "T. Dub{\'e} and B. Mishra and C. K. Yap"
+, title =       "Admissible orderings and bounds on {Gr{\"o}bner} normal form algorithm"
+, type =        "Technical {Report}"
+, number =      258
+, institution = "Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, month =       dec
+, year =        1986
+, note =        "Robotics Report 88"
+, update =      "98.03 bibrelex"
 }
 
 @unpublished{dy-biecg-93
-, author =	"Thomas Dub{\'e} and Chee Yap"
-, title =	"A basis for implementing exact computational geometry"
-, month =	aug
-, year =	1993
-, note =	"to appear"
-, update =	"98.11 bibrelex"
+, author =      "Thomas Dub{\'e} and Chee Yap"
+, title =       "A basis for implementing exact computational geometry"
+, month =       aug
+, year =        1993
+, note =        "to appear"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{dj-cmeda-80
-, author =	"Dubes and Jain"
-, title =	"Clustering methodologies in exploratory data analysis"
-, editor =	"M. C. Yovites"
-, booktitle =	"Asvances in Computers"
-, volume =	19
-, publisher =	"??"
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "Dubes and Jain"
+, title =       "Clustering methodologies in exploratory data analysis"
+, editor =      "M. C. Yovites"
+, booktitle =   "Asvances in Computers"
+, volume =      19
+, publisher =   "??"
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @article{d-cmlca-57
-, author =	"L. E. Dubins"
-, title =	"On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents"
-, journal =	"Amer. J. Math."
-, volume =	79
-, year =	1957
-, pages =	"497--516"
+, author =      "L. E. Dubins"
+, title =       "On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents"
+, journal =     "Amer. J. Math."
+, volume =      79
+, year =        1957
+, pages =       "497--516"
 }
 
 @article{d-oafmo-88
-, author =	"P. Dublish"
-, title =	"An $O(n^3)$ algorithm for finding the minimal opaque forest of a convex polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	29
-, year =	1988
-, pages =	"275--276"
-, keywords =	"polygons, visibility"
-, update =	"95.09 korneenko"
+, author =      "P. Dublish"
+, title =       "An $O(n^3)$ algorithm for finding the minimal opaque forest of a convex polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      29
+, year =        1988
+, pages =       "275--276"
+, keywords =    "polygons, visibility"
+, update =      "95.09 korneenko"
 }
 
 @incollection{d-upoml-85
-, author =	"V. A. Dubovitskij"
-, title =	"The {Ulam} Problem of Optimal Motion of Line Segments"
-, booktitle =	"Optimization Software"
-, publisher =	"??"
-, address =	"New York, NY"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "V. A. Dubovitskij"
+, title =       "The {Ulam} Problem of Optimal Motion of Line Segments"
+, booktitle =   "Optimization Software"
+, publisher =   "??"
+, address =     "New York, NY"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @book{dnf-mg-79
-, author =	"B. Dubrovin and S. Novikov and A. Fomenko"
-, title =	"Modern Geometry"
-, publisher =	"??"
-, address =	"Moscow"
-, year =	1979
-, update =	"98.07 bibrelex"
+, author =      "B. Dubrovin and S. Novikov and A. Fomenko"
+, title =       "Modern Geometry"
+, publisher =   "??"
+, address =     "Moscow"
+, year =        1979
+, update =      "98.07 bibrelex"
 }
 
 @book{dfn-mgma-84
-, author =	"B. A. Dubrovin and A. T. Fomenko and S. P. Novikov"
-, title =	"Modern Geometry - {Methods} and Applications"
-, publisher =	"Springer-Verlag"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "B. A. Dubrovin and A. T. Fomenko and S. P. Novikov"
+, title =       "Modern Geometry - {Methods} and Applications"
+, publisher =   "Springer-Verlag"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{dms-pcmsd-97
-, author =	"D. Dubrule and P. Morin and J.-R. Sack"
-, title =	"A Parallel Cartographic Modelling System: design, implementation and performance"
-, booktitle =	"Proc. GIS'97"
-, site =	"Vancouver"
-, year =	1997
-, pages =	"16--20"
-, update =	"97.11 sack"
+, author =      "D. Dubrule and P. Morin and J.-R. Sack"
+, title =       "A Parallel Cartographic Modelling System: design, implementation and performance"
+, booktitle =   "Proc. GIS'97"
+, site =        "Vancouver"
+, year =        1997
+, pages =       "16--20"
+, update =      "97.11 sack"
 }
 
 @article{dmr-cmc-92
-, author =	"Carolyn K. Duby and Scott Meyers and Steven P. Reiss"
-, title =	"{CCEL}: a metalanguage for {C}++"
-, journal =	"Proc. Second Usenix C++ Conference"
-, volume =	"??"
-, month =	aug
-, year =	1992
-, update =	"97.03 tamassia"
+, author =      "Carolyn K. Duby and Scott Meyers and Steven P. Reiss"
+, title =       "{CCEL}: a metalanguage for {C}++"
+, journal =     "Proc. Second Usenix C++ Conference"
+, volume =      "??"
+, month =       aug
+, year =        1992
+, update =      "97.03 tamassia"
 }
 
 @article{dhvm-rpgvl-83
-, author =	"P. Duchet and Y. Hamidoune and M. Las Vergnas and H. Meyniel"
-, title =	"Representing a Planar Graph by Vertical Lines Joining Different Levels"
-, journal =	"Discrete Math."
-, volume =	46
-, year =	1983
-, pages =	"319--321"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Duchet and Y. Hamidoune and M. Las Vergnas and H. Meyniel"
+, title =       "Representing a Planar Graph by Vertical Lines Joining Different Levels"
+, journal =     "Discrete Math."
+, volume =      46
+, year =        1983
+, pages =       "319--321"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @Article{d-osa-00,
@@ -49483,1144 +49483,1144 @@ @Article{d-osa-00
 }
 
 @book{dh-pcsa-73
-, author =	"R. O. Duda and P. E. Hart"
-, title =	"Pattern Classification and Scene Analysis"
-, publisher =	"Wiley-Interscience"
-, address =	"New York"
-, year =	1973
-, update =	"97.07 agarwal"
+, author =      "R. O. Duda and P. E. Hart"
+, title =       "Pattern Classification and Scene Analysis"
+, publisher =   "Wiley-Interscience"
+, address =     "New York"
+, year =        1973
+, update =      "97.07 agarwal"
 }
 
 @article{dh-uhtdl-72
-, author =	"R. O. Duda and P. E. Hart"
-, title =	"Use of the {Hough} transform to detect lines and curves in pictures"
-, journal =	"Commun. ACM"
-, volume =	15
-, month =	jan
-, year =	1972
-, pages =	"11--15"
-, update =	"96.09 orourke"
+, author =      "R. O. Duda and P. E. Hart"
+, title =       "Use of the {Hough} transform to detect lines and curves in pictures"
+, journal =     "Commun. ACM"
+, volume =      15
+, month =       jan
+, year =        1972
+, pages =       "11--15"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{drw-lrmt-95
-, author =	"Gregory Dudek and Kathleen Romanik and Sue Whitesides"
-, title =	"Localizing a Robot with Minimum Travel"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"437--446"
-, keywords =	"visibility polygons, localization, on-line"
-, precedes =	"drw-lrmt-98"
-, update =	"98.07 mitchell, 96.09 agarwal+romanik, 96.05 mitchell"
+, author =      "Gregory Dudek and Kathleen Romanik and Sue Whitesides"
+, title =       "Localizing a Robot with Minimum Travel"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "437--446"
+, keywords =    "visibility polygons, localization, on-line"
+, precedes =    "drw-lrmt-98"
+, update =      "98.07 mitchell, 96.09 agarwal+romanik, 96.05 mitchell"
 }
 
 @article{drw-lrmt-98
-, author =	"Gregory Dudek and Kathleen Romanik and Sue Whitesides"
-, title =	"Localizing a Robot with Minimum Travel"
-, journal =	"SIAM J. Comput."
-, volume =	27
-, number =	2
-, month =	apr
-, year =	1998
-, pages =	"583--604"
-, keywords =	"visibility polygons, localization, on-line"
-, succeeds =	"drw-lrmt-95"
-, update =	"98.07 mitchell"
+, author =      "Gregory Dudek and Kathleen Romanik and Sue Whitesides"
+, title =       "Localizing a Robot with Minimum Travel"
+, journal =     "SIAM J. Comput."
+, volume =      27
+, number =      2
+, month =       apr
+, year =        1998
+, pages =       "583--604"
+, keywords =    "visibility polygons, localization, on-line"
+, succeeds =    "drw-lrmt-95"
+, update =      "98.07 mitchell"
 }
 
 @article{d-brdnc-79
-, author =	"R. M. Dudley"
-, title =	"Balls in {$R^{k}$} do not cut all subsets of $k+2$ points"
-, journal =	"Adv. Math."
-, volume =	31
-, year =	1979
-, pages =	"306--308"
-, update =	"98.03 bibrelex"
+, author =      "R. M. Dudley"
+, title =       "Balls in {$R^{k}$} do not cut all subsets of $k+2$ points"
+, journal =     "Adv. Math."
+, volume =      31
+, year =        1979
+, pages =       "306--308"
+, update =      "98.03 bibrelex"
 }
 
 @article{d-cltem-78
-, author =	"R. M. Dudley"
-, title =	"Central limit theorems for empirical measures"
-, journal =	"Ann. Probab."
-, volume =	"??"
-, year =	1978
-, pages =	"899--929"
-, update =	"97.11 bibrelex"
+, author =      "R. M. Dudley"
+, title =       "Central limit theorems for empirical measures"
+, journal =     "Ann. Probab."
+, volume =      "??"
+, year =        1978
+, pages =       "899--929"
+, update =      "97.11 bibrelex"
 }
 
 @article{d-mescs-74
-, author =	"R. M. Dudley"
-, title =	"Metric entropy of some classes of sets with differentiable boundaries"
-, journal =	"J. Approx. Theory"
-, volume =	10
-, year =	1974
-, pages =	"227--236"
-, update =	"98.03 bibrelex"
+, author =      "R. M. Dudley"
+, title =       "Metric entropy of some classes of sets with differentiable boundaries"
+, journal =     "J. Approx. Theory"
+, volume =      10
+, year =        1974
+, pages =       "227--236"
+, update =      "98.03 bibrelex"
 }
 
 @article{d-lbfgw-91
-, author =	"R. J. Duffin"
-, title =	"Lines of best fit by graphics and the {Wald} line"
-, journal =	"Amer. Math. Monthly"
-, volume =	98
-, number =	9
-, year =	1991
-, pages =	"835--840"
-, keywords =	"linear programming, fitting"
-, update =	"95.09 korneenko"
+, author =      "R. J. Duffin"
+, title =       "Lines of best fit by graphics and the {Wald} line"
+, journal =     "Amer. Math. Monthly"
+, volume =      98
+, number =      9
+, year =        1991
+, pages =       "835--840"
+, keywords =    "linear programming, fitting"
+, update =      "95.09 korneenko"
 }
 
 @article{d-ppsfe-00
-, author =	"A. Dumitrescu"
-, title =	"Planar point sets with few empty convex polygons"
-, journal =	"Studia Sci. Math. Hungar"
-, volume =	36
-, year =	2000
-, pages =	""
-, update =	"02.03 devillers"
+, author =      "A. Dumitrescu"
+, title =       "Planar point sets with few empty convex polygons"
+, journal =     "Studia Sci. Math. Hungar"
+, volume =      36
+, year =        2000
+, pages =       ""
+, update =      "02.03 devillers"
 }
 
 @article{dgpw-etp-01
-, author =	"A. Dumitrescu and B. G{\"a}rtner and S. Pedroni and E. Welzl"
-, title =	"Enumerating triangulation paths"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	20
-, year =	2001
-, pages =	"3--12"
-, update =	"01.11 smid"
+, author =      "A. Dumitrescu and B. G{\"a}rtner and S. Pedroni and E. Welzl"
+, title =       "Enumerating triangulation paths"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      20
+, year =        2001
+, pages =       "3--12"
+, update =      "01.11 smid"
 }
 
 @article{dk-mcpps-01
-, author =	"A. Dumitrescu and R. Kaye"
-, title =	"Matching colored points in the plane: {Some} new results"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"69--85"
-, update =	"01.07 smid"
+, author =      "A. Dumitrescu and R. Kaye"
+, title =       "Matching colored points in the plane: {Some} new results"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "69--85"
+, update =      "01.07 smid"
 }
 
 @inproceedings{dm-aatnp-01
-, author =	"A. Dumitrescu and J. S. B. Mitchell"
-, title =	"Approximation algorithms for {TSP} with Neighborhoods in the plane"
-, booktitle =	"Proc. 12th Symp. on Discrete Algorithms"
-, year =	2001
-, pages =	"38--46"
-, update =	"02.03 cheong"
+, author =      "A. Dumitrescu and J. S. B. Mitchell"
+, title =       "Approximation algorithms for {TSP} with Neighborhoods in the plane"
+, booktitle =   "Proc. 12th Symp. on Discrete Algorithms"
+, year =        2001
+, pages =       "38--46"
+, update =      "02.03 cheong"
 }
 
 @article{do--93
-, author =	"B. S. Duncan and A. J. Olson"
-, title =	"??"
-, journal =	"Biopolymers"
-, volume =	33
-, year =	1993
-, pages =	"219--229"
-, update =	"98.03 bibrelex"
+, author =      "B. S. Duncan and A. J. Olson"
+, title =       "??"
+, journal =     "Biopolymers"
+, volume =      33
+, year =        1993
+, pages =       "219--229"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{d-bart-99
-, author =	"C. A. Duncan"
-, title =	"Balanced Aspect Ratio Trees"
-, type =	"Ph.{D}. Thesis"
-, school =	"Department of Computer Science, Johns Hopkins University"
-, address =	"Baltimore, Maryland"
-, year =	1999
-, keywords =	"doctoral thesis"
-, update =	"01.11 smid"
+, author =      "C. A. Duncan"
+, title =       "Balanced Aspect Ratio Trees"
+, type =        "Ph.{D}. Thesis"
+, school =      "Department of Computer Science, Johns Hopkins University"
+, address =     "Baltimore, Maryland"
+, year =        1999
+, keywords =    "doctoral thesis"
+, update =      "01.11 smid"
 }
 
 @inproceedings{dgk-bartc-99
-, author =	"C. A. Duncan and M. T. Goodrich and S. Kobourov"
-, title =	"Balanced aspect ratio trees: combining the advantages of k-d trees and octrees"
-, booktitle =	"Proc. 10th Annu. ACM-SIAM Sympos. Discrete Alg."
-, nickname =	"SODA'99"
-, site =	"Baltimore, Maryland"
-, year =	1999
-, pages =	"300--309"
-, update =	"00.11 smid"
+, author =      "C. A. Duncan and M. T. Goodrich and S. Kobourov"
+, title =       "Balanced aspect ratio trees: combining the advantages of k-d trees and octrees"
+, booktitle =   "Proc. 10th Annu. ACM-SIAM Sympos. Discrete Alg."
+, nickname =    "SODA'99"
+, site =        "Baltimore, Maryland"
+, year =        1999
+, pages =       "300--309"
+, update =      "00.11 smid"
 }
 
 @article{dgk-bartc-01
-, author =	"C. A. Duncan and M. T. Goodrich and S. Kobourov"
-, title =	"Balanced aspect ratio trees: combining the advantages of k-d trees and octrees"
-, journal =	"J. Algorithms"
-, volume =	38
-, year =	2001
-, pages =	"303--333"
-, update =	"01.11 smid"
+, author =      "C. A. Duncan and M. T. Goodrich and S. Kobourov"
+, title =       "Balanced aspect ratio trees: combining the advantages of k-d trees and octrees"
+, journal =     "J. Algorithms"
+, volume =      38
+, year =        2001
+, pages =       "303--333"
+, update =      "01.11 smid"
 }
 
 @inproceedings{dgr-eaoac-97
-, author =	"C. A. Duncan and M. T. Goodrich and E. A. Ramos"
-, title =	"Efficient Approximation and Optimization Algorithms for Computational Metrology"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1997
-, pages =	"121--130"
-, update =	"97.03 held+tamassia"
+, author =      "C. A. Duncan and M. T. Goodrich and E. A. Ramos"
+, title =       "Efficient Approximation and Optimization Algorithms for Computational Metrology"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1997
+, pages =       "121--130"
+, update =      "97.03 held+tamassia"
 }
 
 @inproceedings{d-qpmdb-81
-, author =	"M. R. Dunlavey"
-, title =	"Query performance of a many-dimensional best-match algorithm"
-, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
-, year =	1981
-, pages =	"389--396"
+, author =      "M. R. Dunlavey"
+, title =       "Query performance of a many-dimensional best-match algorithm"
+, booktitle =   "Proc. 19th Allerton Conf. Commun. Control Comput."
+, year =        1981
+, pages =       "389--396"
 }
 
 @article{dg-aivib-70
-, author =	"R. D. D{\"u}ppe and H. J. Gottschalk"
-, title =	"Automatische {Interpolation} von {Isolinien} bei willk{\"u}erlich verteilten {St{\"u}tzpunkten}"
-, journal =	"Allgemeine Vermessungsnachrichten"
-, volume =	77
-, year =	1970
-, pages =	"423--426"
+, author =      "R. D. D{\"u}ppe and H. J. Gottschalk"
+, title =       "Automatische {Interpolation} von {Isolinien} bei willk{\"u}erlich verteilten {St{\"u}tzpunkten}"
+, journal =     "Allgemeine Vermessungsnachrichten"
+, volume =      77
+, year =        1970
+, pages =       "423--426"
 }
 
 @misc{d-q3d-94
-, author =	"E. Durand"
-, title =	"Quasitiler 3.0 documentation"
-, year =	1994
-, url =	"http://www.geom.uiuc.edu/apps/quasitiler/about.html"
-, update =	"97.11 bibrelex"
+, author =      "E. Durand"
+, title =       "Quasitiler 3.0 documentation"
+, year =        1994
+, url = "http://www.geom.uiuc.edu/apps/quasitiler/about.html"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ddp-tvsap-97
-, author =	"F. Durand and G. Drettakis and C. Peuch"
-, title =	"The visibility skeleton: {A} powerful and efficient multi-purpose global visibility tool"
-, booktitle =	"SIGGRAPH 97 Conference Proceedings"
-, series =	"Annual Conference Series"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"Addison-Wesley"
-, year =	1997
-, pages =	"89--100"
-, update =	"98.03 agarwal"
+, author =      "F. Durand and G. Drettakis and C. Peuch"
+, title =       "The visibility skeleton: {A} powerful and efficient multi-purpose global visibility tool"
+, booktitle =   "SIGGRAPH 97 Conference Proceedings"
+, series =      "Annual Conference Series"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "Addison-Wesley"
+, year =        1997
+, pages =       "89--100"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{ddp-3dvmv-97
-, author =	"F. Durand and G. Drettakis and C. Puech"
-, title =	"{3D} Visibility made visibly simple: {An} introduction to the Visibility Skeleton"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"475--476"
-, keywords =	"video review"
-, cites =	"ddp-3dvcn-96, ddp-tvsap-97, df-fsaal-94, dorp-rfmvs-96, dp-vcmvs-95, gm-cagld-90, pd-voag-90, p-srs3d-90, pv-vc-96, sg-fcsbu-94, t-caals-92, ZZZ"
-, update =	"98.07 bibrelex, 97.11 orourke, 97.07 efrat"
+, author =      "F. Durand and G. Drettakis and C. Puech"
+, title =       "{3D} Visibility made visibly simple: {An} introduction to the Visibility Skeleton"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "475--476"
+, keywords =    "video review"
+, cites =       "ddp-3dvcn-96, ddp-tvsap-97, df-fsaal-94, dorp-rfmvs-96, dp-vcmvs-95, gm-cagld-90, pd-voag-90, p-srs3d-90, pv-vc-96, sg-fcsbu-94, t-caals-92, ZZZ"
+, update =      "98.07 bibrelex, 97.11 orourke, 97.07 efrat"
 }
 
 @article{ddp-fahrgv-99
-, author =	"F. Durand and G. Drettakis and C. Puech"
-, title =	"Fast and accurate hierarchical radiosity using global visibility"
-, journal =	"ACM Trans. Graph."
-, volume =	18
-, number =	2
-, year =	1999
-, pages =	"128--170"
-, keywords =	"discontinuity meshing, form factor calculation, global illumination, global visibility, hierarchical radiosity, hierarchical triangulation, perception"
-, update =	"01.04 pocchiola"
+, author =      "F. Durand and G. Drettakis and C. Puech"
+, title =       "Fast and accurate hierarchical radiosity using global visibility"
+, journal =     "ACM Trans. Graph."
+, volume =      18
+, number =      2
+, year =        1999
+, pages =       "128--170"
+, keywords =    "discontinuity meshing, form factor calculation, global illumination, global visibility, hierarchical radiosity, hierarchical triangulation, perception"
+, update =      "01.04 pocchiola"
 }
 
 @inproceedings{ddp-3dvcn-96
-, author =	"F. Durand and G. Drettakis and C. Puech"
-, title =	"The $3$d visibility complex, a new approach to the problems of accurate visibility"
-, booktitle =	"Proc. EUROGRAPHICS '96"
-, site =	"Porto, Portugal"
-, publisher =	"Springer-Verlag"
-, month =	jun
-, year =	1996
-, pages =	"245--257"
-, update =	"98.07 bibrelex"
+, author =      "F. Durand and G. Drettakis and C. Puech"
+, title =       "The $3$d visibility complex, a new approach to the problems of accurate visibility"
+, booktitle =   "Proc. EUROGRAPHICS '96"
+, site =        "Porto, Portugal"
+, publisher =   "Springer-Verlag"
+, month =       jun
+, year =        1996
+, pages =       "245--257"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ddp-3dvcu-97
-, author =	"Fr\'edo Durand and George Drettakis and Claude Puech"
-, title =	"The {3D} Visibility Complex: a Unified Data--Structure for Global Visibility of Scenes of Polygons and Smooth Objects"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"153--158"
-, update =	"97.11 jones"
+, author =      "Fr\'edo Durand and George Drettakis and Claude Puech"
+, title =       "The {3D} Visibility Complex: a Unified Data--Structure for Global Visibility of Scenes of Polygons and Smooth Objects"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "153--158"
+, update =      "97.11 jones"
 }
 
 @inproceedings{d-3dvs-98
-, author =	"Fr{\'e}do Durand and George Drettakis and Claude Puech"
-, title =	"The {3D} Visibility Skeleton"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"69--71"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Fr{\'e}do Durand and George Drettakis and Claude Puech"
+, title =       "The {3D} Visibility Skeleton"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "69--71"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{dorp-rfmvs-96
-, author =	"Fr{\'e}do Durand and Rachel Orti and St{\'e}phane Rivei{\`e}re and Claude Puech"
-, title =	"Radiosity in flatland made visibly simple"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"V11--V12"
-, cites =	"c-irepr-90, sgg-rrde-90, cbwg-bbaer-86, dp-vcmvs-95, h-sgiua-91, h-rf-92, pv-vc-93, pv-cvgpt-95, dorp-rdsfv-96, rodp-uvcrc-96, sp-rgi-94, r-tsvcp-95, th-gvaic-93, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Fr{\'e}do Durand and Rachel Orti and St{\'e}phane Rivei{\`e}re and Claude Puech"
+, title =       "Radiosity in flatland made visibly simple"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "V11--V12"
+, cites =       "c-irepr-90, sgg-rrde-90, cbwg-bbaer-86, dp-vcmvs-95, h-sgiua-91, h-rf-92, pv-vc-93, pv-cvgpt-95, dorp-rdsfv-96, rodp-uvcrc-96, sp-rgi-94, r-tsvcp-95, th-gvaic-93, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{dorp-rdsfv-96
-, author =	"F. Durand and R. Orti and S. Rivi{\`e}re and C. Puech"
-, title =	"Radiosity for dynamic scenes in flatland with the visibility complex"
-, booktitle =	"Eurographics '96"
-, year =	1996
-, note =	"Submitted"
-, update =	"97.11 bibrelex"
+, author =      "F. Durand and R. Orti and S. Rivi{\`e}re and C. Puech"
+, title =       "Radiosity for dynamic scenes in flatland with the visibility complex"
+, booktitle =   "Eurographics '96"
+, year =        1996
+, note =        "Submitted"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{dp-vcmvs-95
-, author =	"Fredo Durand and Claude Puech"
-, title =	"The Visibility Complex Made Visibly Simple"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"V2"
-, keywords =	"video review"
-, cites =	"pv-vc-93, r-cddcd-93, cg-vippg-89, cgl-pgd-85, gm-osacv-91, ow-nmcvg-88, p-gfr-90, v-vddsv-90, v-dmvg-91, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Fredo Durand and Claude Puech"
+, title =       "The Visibility Complex Made Visibly Simple"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "V2"
+, keywords =    "video review"
+, cites =       "pv-vc-93, r-cddcd-93, cg-vippg-89, cgl-pgd-85, gm-osacv-91, ow-nmcvg-88, p-gfr-90, v-vddsv-90, v-dmvg-91, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @book{d-pm-1528
-, author =	"Albrecht D{\"u}rer"
-, title =	"The painter's manual: a manual of measurement of lines, areas, and solids by means of compass and ruler assembled by Albrecht D{\"u}rer for the use of all lovers of art with appropriate illustrations arranged to be printed in the year MDXXV"
-, publisher =	"New York: Abaris Books, 1977"
-, year =	1538
-, note =	"Translated and with a commentary by Walter L. Strauss"
-, comments =	"Found by Marty Demaine.
-		Contains unfoldings of convex polyhedra."
-, update =	"00.03 orourke"
+, author =      "Albrecht D{\"u}rer"
+, title =       "The painter's manual: a manual of measurement of lines, areas, and solids by means of compass and ruler assembled by Albrecht D{\"u}rer for the use of all lovers of art with appropriate illustrations arranged to be printed in the year MDXXV"
+, publisher =   "New York: Abaris Books, 1977"
+, year =        1538
+, note =        "Translated and with a commentary by Walter L. Strauss"
+, comments =    "Found by Marty Demaine.
+                Contains unfoldings of convex polyhedra."
+, update =      "00.03 orourke"
 }
 
 @article{d-pofwp-90
-, author =	"R. Durier"
-, title =	"On {Pareto} optima, the {Fermat}-{Weber} problem, and polyhedral ..."
-, journal =	"Math. Program."
-, volume =	47
-, number =	1
-, year =	1990
-, pages =	"65--80"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "R. Durier"
+, title =       "On {Pareto} optima, the {Fermat}-{Weber} problem, and polyhedral ..."
+, journal =     "Math. Program."
+, volume =      47
+, number =      1
+, year =        1990
+, pages =       "65--80"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @article{dm-gpfwp-85
-, author =	"R. Durier and C. Michelot"
-, title =	"Geometrical properties of the {Fermat-Weber} problem"
-, journal =	"European J. Oper. Res."
-, volume =	20
-, number =	3
-, year =	1985
-, pages =	"332--343"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "R. Durier and C. Michelot"
+, title =       "Geometrical properties of the {Fermat-Weber} problem"
+, journal =     "European J. Oper. Res."
+, volume =      20
+, number =      3
+, year =        1985
+, pages =       "332--343"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{d-cugr-86
-, author =	"H. Durrant-Whyte"
-, title =	"Concerning Uncertain Geometry in Robotics"
-, booktitle =	"International Workshop on Geometric Reasoning"
-, site =	"Oxford, UK"
-, month =	jul
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "H. Durrant-Whyte"
+, title =       "Concerning Uncertain Geometry in Robotics"
+, booktitle =   "International Workshop on Geometric Reasoning"
+, site =        "Oxford, UK"
+, month =       jul
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{d-ugr-88
-, author =	"H. F. Durrant-Whyte"
-, title =	"Uncertain geometry in robotics"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	4
-, number =	1
-, year =	1988
-, pages =	"23--31"
-, update =	"95.09 korneenko"
+, author =      "H. F. Durrant-Whyte"
+, title =       "Uncertain geometry in robotics"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      4
+, number =      1
+, year =        1988
+, pages =       "23--31"
+, update =      "95.09 korneenko"
 }
 
 @incollection{dk-ipgmi-89
-, author =	"M. D{\"u}rst and T. L. Kunii"
-, title =	"Integrated polytrees: a generalized model for the integration of spatial decomposition and boundary representation"
-, editor =	"W. S. Strasser and H.-P. Seidel"
-, booktitle =	"Theory and Practice of Geometric Modelling"
-, year =	1989
-, pages =	"329--348"
-, keywords =	"data structuring, polygons"
-, update =	"95.09 korneenko"
+, author =      "M. D{\"u}rst and T. L. Kunii"
+, title =       "Integrated polytrees: a generalized model for the integration of spatial decomposition and boundary representation"
+, editor =      "W. S. Strasser and H.-P. Seidel"
+, booktitle =   "Theory and Practice of Geometric Modelling"
+, year =        1989
+, pages =       "329--348"
+, keywords =    "data structuring, polygons"
+, update =      "95.09 korneenko"
 }
 
 @article{d-armc-88
-, author =	"M. J. D{\"u}rst"
-, title =	"Additional reference to {M}arching {C}ubes"
-, journal =	"Comput. Graph."
-, volume =	22
-, number =	4
-, year =	1988
-, pages =	"72--73"
-, update =	"01.07 wenger"
+, author =      "M. J. D{\"u}rst"
+, title =       "Additional reference to {M}arching {C}ubes"
+, journal =     "Comput. Graph."
+, volume =      22
+, number =      4
+, year =        1988
+, pages =       "72--73"
+, update =      "01.07 wenger"
 }
 
 @inproceedings{d-vpwmb-93
-, author =	"Martin J. D{\"u}rst"
-, title =	"On vertices and polyhedra without minimal boolean formulae"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"44--47"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Martin J. D{\"u}rst"
+, title =       "On vertices and polyhedra without minimal boolean formulae"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "44--47"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @inproceedings{d-pdcbe-91
-, author =	"Martin J. D{\"u}rst"
-, title =	"Preclassification and delayed classification of boundary entities in arbitrary dimensions"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"57--69"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Martin J. D{\"u}rst"
+, title =       "Preclassification and delayed classification of boundary entities in arbitrary dimensions"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "57--69"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{dk-vcuch-89
-, author =	"M. J. D{\"u}rst and T. L. Kunii"
-, title =	"Vertex classification using the convex hull on a sphere"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, year =	1989
-, pages =	"25--32"
-, keywords =	"point-in-polyhedron, point location, Peterson-style boolean formula"
-, update =	"95.09 mitchell"
+, author =      "M. J. D{\"u}rst and T. L. Kunii"
+, title =       "Vertex classification using the convex hull on a sphere"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, year =        1989
+, pages =       "25--32"
+, keywords =    "point-in-polyhedron, point location, Peterson-style boolean formula"
+, update =      "95.09 mitchell"
 }
 
 @article{dm-pos-41
-, author =	"B. Dushnik and E. W. Miller"
-, title =	"Partially Ordered Sets"
-, journal =	"Amer. J. Math."
-, volume =	63
-, year =	1941
-, pages =	"600--610"
-, update =	"94.05 franciosa"
+, author =      "B. Dushnik and E. W. Miller"
+, title =       "Partially Ordered Sets"
+, journal =     "Amer. J. Math."
+, volume =      63
+, year =        1941
+, pages =       "600--610"
+, update =      "94.05 franciosa"
 }
 
 @article{dc-gscml-89
-, author =	"D. Dutta and P. K. Chaudhuri"
-, title =	"Geometrical solution for a constrained minimax location problem"
-, journal =	"Asia-Pacif. J. Oper. Res."
-, volume =	6
-, number =	2
-, year =	1989
-, pages =	"148--157"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "D. Dutta and P. K. Chaudhuri"
+, title =       "Geometrical solution for a constrained minimax location problem"
+, journal =     "Asia-Pacif. J. Oper. Res."
+, volume =      6
+, number =      2
+, year =        1989
+, pages =       "148--157"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @article{dh-ssco-93
-, author =	"D. Dutta and C. Hoffmann"
-, title =	"On the skeleton of simple {CSG} objects"
-, journal =	"ASME J. Mech. Design"
-, volume =	115
-, year =	1993
-, pages =	"87--94"
-, update =	"98.07 bibrelex"
+, author =      "D. Dutta and C. Hoffmann"
+, title =       "On the skeleton of simple {CSG} objects"
+, journal =     "ASME J. Mech. Design"
+, volume =      115
+, year =        1993
+, pages =       "87--94"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{dh-gisco-90
-, author =	"D. Dutta and C. M. Hoffmann"
-, title =	"A Geometric Investigation of the Skeleton of {CSG} Objects"
-, booktitle =	"Proc. ASME Conf. Design Automation"
-, site =	"Chicago, IL, USA"
-, year =	1990
-, pages =	""
-, update =	"93.09 held"
+, author =      "D. Dutta and C. M. Hoffmann"
+, title =       "A Geometric Investigation of the Skeleton of {CSG} Objects"
+, booktitle =   "Proc. ASME Conf. Design Automation"
+, site =        "Chicago, IL, USA"
+, year =        1990
+, pages =       ""
+, update =      "93.09 held"
 }
 
 @article{d-fecld-81
-, author =	"G. Dutton"
-, title =	"Fractal enhancement of cartographic line detail"
-, journal =	"Amer. Cartogr."
-, volume =	8
-, year =	1981
-, pages =	"23--40"
-, keywords =	"implementing algorithms, computer graphics, cartography, algebraic geometry, fractals, construction, similarity, shape, boundary representation, curves"
+, author =      "G. Dutton"
+, title =       "Fractal enhancement of cartographic line detail"
+, journal =     "Amer. Cartogr."
+, volume =      8
+, year =        1981
+, pages =       "23--40"
+, keywords =    "implementing algorithms, computer graphics, cartography, algebraic geometry, fractals, construction, similarity, shape, boundary representation, curves"
 }
 
 @article{d-gmpr-84
-, author =	"G. Dutton"
-, title =	"Geodesic modelling of planetary relief"
-, journal =	"Cartographica"
-, volume =	21
-, year =	1984
-, pages =	"188--207"
-, keywords =	"data structuring, terrain modelling, construction, approximation, geodesics, locus approach, implicit data structures, triangulations, polyhedra"
+, author =      "G. Dutton"
+, title =       "Geodesic modelling of planetary relief"
+, journal =     "Cartographica"
+, volume =      21
+, year =        1984
+, pages =       "188--207"
+, keywords =    "data structuring, terrain modelling, construction, approximation, geodesics, locus approach, implicit data structures, triangulations, polyhedra"
 }
 
 @inproceedings{dm-epigd-80
-, author =	"G. Dutton and S. Morehouse"
-, title =	"Extraction of polygonal information from gridded data"
-, booktitle =	"Proc. 4th Internat. Sympos. Comput.-Assist. Cartog."
-, site =	"Falls Church, VA"
-, year =	1980
-, pages =	"320--327"
-, keywords =	"implementing algorithms, image processing, cartography, construction, shape, contours, polygonal chains, topological, curves"
-, update =	"93.05 freimer"
+, author =      "G. Dutton and S. Morehouse"
+, title =       "Extraction of polygonal information from gridded data"
+, booktitle =   "Proc. 4th Internat. Sympos. Comput.-Assist. Cartog."
+, site =        "Falls Church, VA"
+, year =        1980
+, pages =       "320--327"
+, keywords =    "implementing algorithms, image processing, cartography, construction, shape, contours, polygonal chains, topological, curves"
+, update =      "93.05 freimer"
 }
 
 @inproceedings{dhw-csma-93
-, author =	"C. Dwork and M. Herlihy and O. Waarts"
-, title =	"Contention in Shared Memory Algorithms"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"174--183"
-, update =	"96.09 orourke"
+, author =      "C. Dwork and M. Herlihy and O. Waarts"
+, title =       "Contention in Shared Memory Algorithms"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "174--183"
+, update =      "96.09 orourke"
 }
 
 @article{d-chsss-91
-, author =	"R. Dwyer"
-, title =	"Convex hulls of samples from spherically symmetric distributions"
-, journal =	"Discrete Appl. Math."
-, volume =	31
-, number =	2
-, year =	1991
-, pages =	"113--132"
-, keywords =	"convex hull, probabilistic analysis"
-, update =	"95.09 korneenko"
+, author =      "R. Dwyer"
+, title =       "Convex hulls of samples from spherically symmetric distributions"
+, journal =     "Discrete Appl. Math."
+, volume =      31
+, number =      2
+, year =        1991
+, pages =       "113--132"
+, keywords =    "convex hull, probabilistic analysis"
+, update =      "95.09 korneenko"
 }
 
 @article{d-mmb-93
-, author =	"R. Dwyer"
-, title =	"Maximal and minimal balls"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"261--275"
-, update =	"96.09 devillers"
+, author =      "R. Dwyer"
+, title =       "Maximal and minimal balls"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "261--275"
+, update =      "96.09 devillers"
 }
 
 @article{d-chrpp-88
-, author =	"R. Dwyer"
-, title =	"On the convex hull of random points in a polytope"
-, journal =	"J. Appl. Probab."
-, volume =	25
-, number =	4
-, year =	1988
-, pages =	"688--699"
-, keywords =	"convex hull, probabilistic analysis"
-, update =	"95.09 korneenko"
+, author =      "R. Dwyer"
+, title =       "On the convex hull of random points in a polytope"
+, journal =     "J. Appl. Probab."
+, volume =      25
+, number =      4
+, year =        1988
+, pages =       "688--699"
+, keywords =    "convex hull, probabilistic analysis"
+, update =      "95.09 korneenko"
 }
 
 @article{d-enkfv-93
-, author =	"R. Dwyer"
-, title =	"The expected number of $k$-faces of a {Voronoi} diagram"
-, journal =	"Internat. J. Comput. Math."
-, volume =	26
-, number =	5
-, year =	1993
-, pages =	"13--21"
-, keywords =	"$d$-dimensional, Voronoi diagram"
-, update =	"95.09 korneenko"
+, author =      "R. Dwyer"
+, title =       "The expected number of $k$-faces of a {Voronoi} diagram"
+, journal =     "Internat. J. Comput. Math."
+, volume =      26
+, number =      5
+, year =        1993
+, pages =       "13--21"
+, keywords =    "$d$-dimensional, Voronoi diagram"
+, update =      "95.09 korneenko"
 }
 
 @article{d-essig-95
-, author =	"R. Dwyer"
-, title =	"The expected size of the sphere-of-influence graph"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"155--164"
-, update =	"96.09 devillers"
+, author =      "R. Dwyer"
+, title =       "The expected size of the sphere-of-influence graph"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "155--164"
+, update =      "96.09 devillers"
 }
 
 @article{de-mee-96
-, author =	"R. Dwyer and W. Eddy"
-, title =	"Maximal empty ellipsoids"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"169--186"
-, update =	"96.09 devillers"
+, author =      "R. Dwyer and W. Eddy"
+, title =       "Maximal empty ellipsoids"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "169--186"
+, update =      "96.09 devillers"
 }
 
 @article{d-fdcac-87
-, author =	"R. A. Dwyer"
-, title =	"A faster divide-and-conquer algorithm for constructing {Delaunay} triangulations"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"137--151"
-, succeeds =	"d-sdcac-86"
+, author =      "R. A. Dwyer"
+, title =       "A faster divide-and-conquer algorithm for constructing {Delaunay} triangulations"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "137--151"
+, succeeds =    "d-sdcac-86"
 }
 
 @inproceedings{d-sdcac-86
-, author =	"R. A. Dwyer"
-, title =	"A simple divide-and-conquer algorithm for computing {Delaunay} triangulations in {$O(n \log\log n)$} expected time"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"276--284"
-, precedes =	"d-fdcac-87"
-, cites =	"bwy-oetac-80, f-savd-86, gs-pmgsc-85, h-oarms-79, l-tdvdl-80, ls-tacdt-80, lw-vdllm-80, m-dtchn-84, oim-iimvd-84, s-let-78, gs-cdtp-78, s-cg-78, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "R. A. Dwyer"
+, title =       "A simple divide-and-conquer algorithm for computing {Delaunay} triangulations in {$O(n \log\log n)$} expected time"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "276--284"
+, precedes =    "d-fdcac-87"
+, cites =       "bwy-oetac-80, f-savd-86, gs-pmgsc-85, h-oarms-79, l-tdvdl-80, ls-tacdt-80, lw-vdllm-80, m-dtchn-84, oim-iimvd-84, s-let-78, gs-cdtp-78, s-cg-78, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{d-acaac-88
-, author =	"R. A. Dwyer"
-, title =	"Average-case analysis of algorithms for convex hulls and {Voronoi} diagrams"
-, type =	"Ph.{D}. Thesis"
-, school =	"Comput. Sci. Dept., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1988
-, note =	"Report CMU-CS-88-132"
-, keywords =	"doctoral thesis"
-, update =	"95.01 smid"
+, author =      "R. A. Dwyer"
+, title =       "Average-case analysis of algorithms for convex hulls and {Voronoi} diagrams"
+, type =        "Ph.{D}. Thesis"
+, school =      "Comput. Sci. Dept., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1988
+, note =        "Report CMU-CS-88-132"
+, keywords =    "doctoral thesis"
+, update =      "95.01 smid"
 }
 
 @inproceedings{d-chpss-89
-, author =	"R. A. Dwyer"
-, title =	"Convex hulls of points from spherically symmetric distributions"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	2
+, author =      "R. A. Dwyer"
+, title =       "Convex hulls of points from spherically symmetric distributions"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       2
 }
 
 @inproceedings{d-hdvdl-89
-, author =	"R. A. Dwyer"
-, title =	"Higher-dimensional {Voronoi} diagrams in linear expected time"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"326--333"
-, precedes =	"d-hdvdl-91"
-, cites =	"ab-acddv-83, b-wcach-82, b-cdt-81, b-gtfga-80, bdf-cvp-78, ck-acp-70, d-fdcac-87, d-chrpp-88, e-chrsp-65, f-pcvp-79, g-rssc-62, m-dtchn-84, m-iaeln-53, m-irs-71, r-slcdn-70, s-cvdhd-82, s-nfhdv-87, s-chdch-86, s-fchff-85, too-natdv-83, t-pala-11, v-nadpc-08, w-cnddt-81, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "R. A. Dwyer"
+, title =       "Higher-dimensional {Voronoi} diagrams in linear expected time"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "326--333"
+, precedes =    "d-hdvdl-91"
+, cites =       "ab-acddv-83, b-wcach-82, b-cdt-81, b-gtfga-80, bdf-cvp-78, ck-acp-70, d-fdcac-87, d-chrpp-88, e-chrsp-65, f-pcvp-79, g-rssc-62, m-dtchn-84, m-iaeln-53, m-irs-71, r-slcdn-70, s-cvdhd-82, s-nfhdv-87, s-chdch-86, s-fchff-85, too-natdv-83, t-pala-11, v-nadpc-08, w-cnddt-81, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{d-hdvdl-91
-, author =	"R. A. Dwyer"
-, title =	"Higher-dimensional {Voronoi} diagrams in linear expected time"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"343--367"
-, succeeds =	"d-hdvdl-89"
+, author =      "R. A. Dwyer"
+, title =       "Higher-dimensional {Voronoi} diagrams in linear expected time"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "343--367"
+, succeeds =    "d-hdvdl-89"
 }
 
 @article{d-kgaca-90
-, author =	"R. A. Dwyer"
-, title =	"Kinder, gentler average-case analysis for convex hulls and maximal vectors"
-, journal =	"SIGACT News"
-, volume =	21
-, number =	2
-, year =	1990
-, pages =	"64--71"
-, keywords =	"probabilistic analysis, expected-case analysis, convex hull, $d$-dimensional"
+, author =      "R. A. Dwyer"
+, title =       "Kinder, gentler average-case analysis for convex hulls and maximal vectors"
+, journal =     "SIGACT News"
+, volume =      21
+, number =      2
+, year =        1990
+, pages =       "64--71"
+, keywords =    "probabilistic analysis, expected-case analysis, convex hull, $d$-dimensional"
 }
 
 @inproceedings{d-lvgwi-90
-, author =	"R. A. Dwyer"
-, title =	"Las {Vegas} gift-wrapping is twice as fast"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"261--264"
-, cites =	"ck-acp-70, s-fchff-85, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "R. A. Dwyer"
+, title =       "Las {Vegas} gift-wrapping is twice as fast"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "261--264"
+, cites =       "ck-acp-70, s-fchff-85, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{d-vdchr-00
-, author =	"R. A. Dwyer"
-, title =	"{Voronoi} diagrams and convex hulls of random moving points"
-, journal =	"Discrete Comput. Geom."
-, volume =	23
-, year =	2000
-, pages =	"343--365"
-, update =	"01.11 smid"
+, author =      "R. A. Dwyer"
+, title =       "{Voronoi} diagrams and convex hulls of random moving points"
+, journal =     "Discrete Comput. Geom."
+, volume =      23
+, year =        2000
+, pages =       "343--365"
+, update =      "01.11 smid"
 }
 
 @article{d-vdrlf-97
-, author =	"R. A. Dwyer"
-, title =	"{Voronoi} diagrams of random lines and flats"
-, journal =	"Discrete Comput. Geom."
-, volume =	17
-, year =	1997
-, pages =	"123--136"
-, update =	"98.03 agarwal"
+, author =      "R. A. Dwyer"
+, title =       "{Voronoi} diagrams of random lines and flats"
+, journal =     "Discrete Comput. Geom."
+, volume =      17
+, year =        1997
+, pages =       "123--136"
+, update =      "98.03 agarwal"
 }
 
 @article{d-tcpp-90
-, author =	"H. Dyckhoff"
-, title =	"A typology of cutting and packing problems"
-, journal =	"European J. Oper. Res."
-, volume =	44
-, number =	2
-, year =	1990
-, pages =	"145--160"
-, keywords =	"packing, covering"
-, update =	"95.09 korneenko"
+, author =      "H. Dyckhoff"
+, title =       "A typology of cutting and packing problems"
+, journal =     "European J. Oper. Res."
+, volume =      44
+, number =      2
+, year =        1990
+, pages =       "145--160"
+, keywords =    "packing, covering"
+, update =      "95.09 korneenko"
 }
 
 @article{d-fpacp-80
-, author =	"C. R. Dyer"
-, title =	"A fast parallel algorithm for the closest pair problem"
-, journal =	"Inform. Process. Lett."
-, volume =	11
-, year =	1980
-, pages =	"49--52"
+, author =      "C. R. Dyer"
+, title =       "A fast parallel algorithm for the closest pair problem"
+, journal =     "Inform. Process. Lett."
+, volume =      11
+, year =        1980
+, pages =       "49--52"
 }
 
 @article{d-cenii-80
-, author =	"C. R. Dyer"
-, title =	"Computing the {Euler} number of an image from its quadtree"
-, journal =	"Comput. Graph. Image Process."
-, volume =	13
-, year =	1980
-, pages =	"270--276"
+, author =      "C. R. Dyer"
+, title =       "Computing the {Euler} number of an image from its quadtree"
+, journal =     "Comput. Graph. Image Process."
+, volume =      13
+, year =        1980
+, pages =       "270--276"
 }
 
 @article{d-seq-82
-, author =	"C. R. Dyer"
-, title =	"The space efficiency of quadtrees"
-, journal =	"Comput. Graph. Image Process."
-, volume =	19
-, year =	1982
-, pages =	"335--348"
+, author =      "C. R. Dyer"
+, title =       "The space efficiency of quadtrees"
+, journal =     "Comput. Graph. Image Process."
+, volume =      19
+, year =        1982
+, pages =       "335--348"
 }
 
 @article{drs-rrbcq-80
-, author =	"C. R. Dyer and A. Rosenfeld and H. Samet"
-, title =	"Region representation: boundary codes from quadtrees"
-, journal =	"Commun. ACM"
-, volume =	23
-, year =	1980
-, pages =	"171--179"
+, author =      "C. R. Dyer and A. Rosenfeld and H. Samet"
+, title =       "Region representation: boundary codes from quadtrees"
+, journal =     "Commun. ACM"
+, volume =      23
+, year =        1980
+, pages =       "171--179"
 }
 
 @incollection{df-cvcbc-91
-, author =	"Martin Dyer and Alan Frieze"
-, title =	"Computing the volume of convex bodies: {A} case where randomness provably helps"
-, editor =	"B. Bollob{\' a}s"
-, booktitle =	"Probabilistic Combinatorics and Its Applications"
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1991
-, pages =	"123--169"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Martin Dyer and Alan Frieze"
+, title =       "Computing the volume of convex bodies: {A} case where randomness provably helps"
+, editor =      "B. Bollob{\' a}s"
+, booktitle =   "Probabilistic Combinatorics and Its Applications"
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1991
+, pages =       "123--169"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @incollection{dm-lpld-97
-, author =	"M. Dyer and N. Megiddo"
-, title =	"Linear programming in low dimensions"
-, chapter =	38
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"699--710"
-, update =	"97.11 orourke"
+, author =      "M. Dyer and N. Megiddo"
+, title =       "Linear programming in low dimensions"
+, chapter =     38
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "699--710"
+, update =      "97.11 orourke"
 }
 
 @inproceedings{d-ccpac-92
-, author =	"M. E. Dyer"
-, title =	"A class of convex programs with applications to computational geometry"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"9--15"
-, cites =	"c-sagcp-88, c-lpot-86, c-lvalp-88, dk-ladsc-85, d-mstia-86, gls-gaco-88, j-ba1-85, m-lpltw-84, m-bsb-89, m-mpta-86, p-mse-84, r-fpade-88, sw-cblpr-92, w-sedbe-91a, ZZZ"
-, update =	"97.11 bibrelex, 97.03 agarwal"
+, author =      "M. E. Dyer"
+, title =       "A class of convex programs with applications to computational geometry"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "9--15"
+, cites =       "c-sagcp-88, c-lpot-86, c-lvalp-88, dk-ladsc-85, d-mstia-86, gls-gaco-88, j-ba1-85, m-lpltw-84, m-bsb-89, m-mpta-86, p-mse-84, r-fpade-88, sw-cblpr-92, w-sedbe-91a, ZZZ"
+, update =      "97.11 bibrelex, 97.03 agarwal"
 }
 
 @incollection{d-gatcl-83
-, author =	"Martin E. Dyer"
-, title =	"A Geometric Approach to Two-Constraint Linear Programming with Generalized Upper Bounds"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"79--90"
-, keywords =	"linear programming"
-, update =	"01.04 icking, 95.09 korneenko"
+, author =      "Martin E. Dyer"
+, title =       "A Geometric Approach to Two-Constraint Linear Programming with Generalized Upper Bounds"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "79--90"
+, keywords =    "linear programming"
+, update =      "01.04 icking, 95.09 korneenko"
 }
 
 @techreport{d-ltalp-82
-, author =	"M. E. Dyer"
-, title =	"A linear time algorithm for locating a point in the intersection of $2$-polyhedra"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Math. Statist., Teesside Polytech."
-, address =	"Middlesbrough, England"
-, year =	1982
+, author =      "M. E. Dyer"
+, title =       "A linear time algorithm for locating a point in the intersection of $2$-polyhedra"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Math. Statist., Teesside Polytech."
+, address =     "Middlesbrough, England"
+, year =        1982
 }
 
 @inproceedings{d-palpf-95
-, author =	"Martin E. Dyer"
-, title =	"A Parallel Algorithm for Linear Programming in Fixed Dimension"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"345--349"
-, keywords =	""
-, cites =	"akss-dsot-86, am-dptnp-92, am-plpfd-90, bh-obdpc-87, cm-ltdao-93, c-lvalp-88, c-lpot-86, c-pms-88, d-opalp-90, d-mstia-86, g-gpmee-93, kr-pasmm-90, m-lpltw-84, v-pcp-75, ZZZ"
-, update =	"98.03 bibrelex, 97.03 agarwal, 95.09 mitchell"
+, author =      "Martin E. Dyer"
+, title =       "A Parallel Algorithm for Linear Programming in Fixed Dimension"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "345--349"
+, keywords =    ""
+, cites =       "akss-dsot-86, am-dptnp-92, am-plpfd-90, bh-obdpc-87, cm-ltdao-93, c-lvalp-88, c-lpot-86, c-pms-88, d-opalp-90, d-mstia-86, g-gpmee-93, kr-pasmm-90, m-lpltw-84, v-pcp-75, ZZZ"
+, update =      "98.03 bibrelex, 97.03 agarwal, 95.09 mitchell"
 }
 
 @techreport{d-soai3-80
-, author =	"M. E. Dyer"
-, title =	"A simplified {$O(n \log n)$} algorithm for the intersection of $3$-polyhedra"
-, type =	"Report"
-, number =	"TPMR 80-5"
-, institution =	"Dept. Math. Statist., Teesside Polytech."
-, address =	"Middlesbrough, England"
-, year =	1980
+, author =      "M. E. Dyer"
+, title =       "A simplified {$O(n \log n)$} algorithm for the intersection of $3$-polyhedra"
+, type =        "Report"
+, number =      "TPMR 80-5"
+, institution = "Dept. Math. Statist., Teesside Polytech."
+, address =     "Middlesbrough, England"
+, year =        1980
 }
 
 @techreport{d-onamc-81
-, author =	"M. E. Dyer"
-, title =	"An $O(n)$ algorithm for multiple-choice knapsack linear program"
-, type =	"report"
-, institution =	"Math Dept. Teesside Polytechnic."
-, address =	"Middlesbrough, England"
-, year =	1981
-, keywords =	"prune and search, linear programming"
-, update =	"95.09 korneenko"
+, author =      "M. E. Dyer"
+, title =       "An $O(n)$ algorithm for multiple-choice knapsack linear program"
+, type =        "report"
+, institution = "Math Dept. Teesside Polytechnic."
+, address =     "Middlesbrough, England"
+, year =        1981
+, keywords =    "prune and search, linear programming"
+, update =      "95.09 korneenko"
 }
 
 @article{d-ltatt-84
-, author =	"M. E. Dyer"
-, title =	"Linear time algorithms for two- and three-variable linear programs"
-, journal =	"SIAM J. Comput."
-, volume =	13
-, year =	1984
-, pages =	"31--45"
-, keywords =	"linear programming"
+, author =      "M. E. Dyer"
+, title =       "Linear time algorithms for two- and three-variable linear programs"
+, journal =     "SIAM J. Comput."
+, volume =      13
+, year =        1984
+, pages =       "31--45"
+, keywords =    "linear programming"
 }
 
 @article{d-mstia-86
-, author =	"M. E. Dyer"
-, title =	"On a multidimensional search technique and its application to the {Euclidean} one-centre problem"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"725--738"
-, update =	"96.09 agarwal"
+, author =      "M. E. Dyer"
+, title =       "On a multidimensional search technique and its application to the {Euclidean} one-centre problem"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "725--738"
+, update =      "96.09 agarwal"
 }
 
 @article{d-clpp-91
-, author =	"M. E. Dyer"
-, title =	"On counting lattice points in polyhedra"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"695--707"
-, update =	"97.03 agarwal"
+, author =      "M. E. Dyer"
+, title =       "On counting lattice points in polyhedra"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "695--707"
+, update =      "97.03 agarwal"
 }
 
 @article{d-cvem-83
-, author =	"M. E. Dyer"
-, title =	"The complexity of vertex enumeration methods"
-, journal =	"Math. Oper. Res."
-, volume =	8
-, year =	1983
-, pages =	"381--402"
-, keywords =	"linear programming, convex hull"
-, update =	"95.09 korneenko"
+, author =      "M. E. Dyer"
+, title =       "The complexity of vertex enumeration methods"
+, journal =     "Math. Oper. Res."
+, volume =      8
+, year =        1983
+, pages =       "381--402"
+, keywords =    "linear programming, convex hull"
+, update =      "95.09 korneenko"
 }
 
 @techreport{d-tvlpa-82
-, author =	"M. E. Dyer"
-, title =	"Two-variable linear programs are solvable in linear time"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Math. Statist., Teesside Polytech."
-, address =	"Middlesbrough, England"
-, year =	1982
+, author =      "M. E. Dyer"
+, title =       "Two-variable linear programs are solvable in linear time"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Math. Statist., Teesside Polytech."
+, address =     "Middlesbrough, England"
+, year =        1982
 }
 
 @article{df-ccv-88
-, author =	"M. E. Dyer and A. Frieze"
-, title =	"On the complexity of computing volume"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, year =	1988
-, pages =	"967--975"
-, keywords =	"volume, convex, complexity theory"
-, update =	"97.03 agarwal"
+, author =      "M. E. Dyer and A. Frieze"
+, title =       "On the complexity of computing volume"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, year =        1988
+, pages =       "967--975"
+, keywords =    "volume, convex, complexity theory"
+, update =      "97.03 agarwal"
 }
 
 @article{df-p3inc-86
-, author =	"M. E. Dyer and A. Frieze"
-, title =	"Planar $3${DM} is {NP}-complete"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"174--184"
-, update =	"97.03 agarwal"
+, author =      "M. E. Dyer and A. Frieze"
+, title =       "Planar $3${DM} is {NP}-complete"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "174--184"
+, update =      "97.03 agarwal"
 }
 
 @inproceedings{dfk-rptaa-89
-, author =	"M. E. Dyer and A. Frieze and R. Kannan"
-, title =	"A random polynomial time algorithm for approximating the volume of convex bodies"
-, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
-, year =	1989
-, pages =	"375--381"
-, keywords =	"approximation, volume, convex"
-, precedes =	"dfk-rptaa-91"
-, update =	"97.03 agarwal"
+, author =      "M. E. Dyer and A. Frieze and R. Kannan"
+, title =       "A random polynomial time algorithm for approximating the volume of convex bodies"
+, booktitle =   "Proc. 21st Annu. ACM Sympos. Theory Comput."
+, year =        1989
+, pages =       "375--381"
+, keywords =    "approximation, volume, convex"
+, precedes =    "dfk-rptaa-91"
+, update =      "97.03 agarwal"
 }
 
 @article{dfk-rptaa-91
-, author =	"M. E. Dyer and A. Frieze and R. Kannan"
-, title =	"A random polynomial time algorithm for approximating the volume of convex bodies"
-, journal =	"J. ACM"
-, volume =	38
-, year =	1991
-, pages =	"1--17"
-, keywords =	"approximation, volume, convex"
-, succeeds =	"dfk-rptaa-89"
-, update =	"97.03 agarwal"
+, author =      "M. E. Dyer and A. Frieze and R. Kannan"
+, title =       "A random polynomial time algorithm for approximating the volume of convex bodies"
+, journal =     "J. ACM"
+, volume =      38
+, year =        1991
+, pages =       "1--17"
+, keywords =    "approximation, volume, convex"
+, succeeds =    "dfk-rptaa-89"
+, update =      "97.03 agarwal"
 }
 
 @article{df-pamwe-84
-, author =	"M. E. Dyer and A. M. Frieze"
-, title =	"A partitioning algorithm for minimum weighted {Euclidean} matching"
-, journal =	"Inform. Process. Lett."
-, volume =	18
-, year =	1984
-, pages =	"59--62"
+, author =      "M. E. Dyer and A. M. Frieze"
+, title =       "A partitioning algorithm for minimum weighted {Euclidean} matching"
+, journal =     "Inform. Process. Lett."
+, volume =      18
+, year =        1984
+, pages =       "59--62"
 }
 
 @article{df-rafdl-89
-, author =	"M. E. Dyer and A. M. Frieze"
-, title =	"A randomized algorithm for fixed-dimension linear programming"
-, journal =	"Math. Program."
-, volume =	44
-, number =	2
-, year =	1989
-, pages =	"203--212"
-, keywords =	"linear programming, Las Vegas, $d$-dimensional"
-, update =	"96.09 agarwal, 95.09 korneenko"
+, author =      "M. E. Dyer and A. M. Frieze"
+, title =       "A randomized algorithm for fixed-dimension linear programming"
+, journal =     "Math. Program."
+, volume =      44
+, number =      2
+, year =        1989
+, pages =       "203--212"
+, keywords =    "linear programming, Las Vegas, $d$-dimensional"
+, update =      "96.09 agarwal, 95.09 korneenko"
 }
 
 @techreport{df-rafdl-87
-, author =	"M. E. Dyer and A. M. Frieze"
-, title =	"A Randomized Algorithm for Fixed-Dimensional Linear Programming"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "M. E. Dyer and A. M. Frieze"
+, title =       "A Randomized Algorithm for Fixed-Dimensional Linear Programming"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @article{df-shpcp-85
-, author =	"M. E. Dyer and A. M. Frieze"
-, title =	"A simple heuristic for the $p$-centre problem"
-, journal =	"Oper. Res. Lett."
-, volume =	3
-, year =	1985
-, pages =	"285--288"
-, keywords =	"facility location"
-, update =	"95.09 korneenko"
+, author =      "M. E. Dyer and A. M. Frieze"
+, title =       "A simple heuristic for the $p$-centre problem"
+, journal =     "Oper. Res. Lett."
+, volume =      3
+, year =        1985
+, pages =       "285--288"
+, keywords =    "facility location"
+, update =      "95.09 korneenko"
 }
 
 @article{dfm-phtgm-84
-, author =	"M. E. Dyer and A. M. Frieze and C. J. H. McDiarmid"
-, title =	"Partitioning heuristics for two geometric maximization problems"
-, journal =	"Oper. Res. Lett."
-, volume =	3
-, year =	1984
-, pages =	"267--270"
-, keywords =	"heuristics"
+, author =      "M. E. Dyer and A. M. Frieze and C. J. H. McDiarmid"
+, title =       "Partitioning heuristics for two geometric maximization problems"
+, journal =     "Oper. Res. Lett."
+, volume =      3
+, year =        1984
+, pages =       "267--270"
+, keywords =    "heuristics"
 }
 
 @techreport{dgh-ccmv-94
-, author =	"M. E. Dyer and P. Gritzmann and A. Hufnagel"
-, title =	"On the complexity of computing mixed volumes"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "M. E. Dyer and P. Gritzmann and A. Hufnagel"
+, title =       "On the complexity of computing mixed volumes"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @article{dp-adaep-77
-, author =	"M. E. Dyer and L. G. Proll"
-, title =	"An algorithm for determining all extreme points of a convex polytope"
-, journal =	"Math. Program."
-, volume =	12
-, year =	1977
-, pages =	"81--96"
+, author =      "M. E. Dyer and L. G. Proll"
+, title =       "An algorithm for determining all extreme points of a convex polytope"
+, journal =     "Math. Program."
+, volume =      12
+, year =        1977
+, pages =       "81--96"
 }
 
 @inproceedings{dm-bcpo-89
-, author =	"P. C. Dykstra and M. J. Muuss"
-, title =	"The {BRL}-{CAD} Package: An Overview"
-, booktitle =	"Proc. BRL-CAD Symposium '89"
-, site =	"Aberdeen Proving Ground, Maryland"
-, year =	1989
-, pages =	"1--9"
-, update =	"93.09 goodrich"
+, author =      "P. C. Dykstra and M. J. Muuss"
+, title =       "The {BRL}-{CAD} Package: An Overview"
+, booktitle =   "Proc. BRL-CAD Symposium '89"
+, site =        "Aberdeen Proving Ground, Maryland"
+, year =        1989
+, pages =       "1--9"
+, update =      "93.09 goodrich"
 }
 
 @inproceedings{dc-hcpc-80
-, author =	"P. W. Dymon and S. A. Cook"
-, title =	"Hardware Complexity and Parallel Comuting"
-, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1980
-, pages =	"360--372"
-, update =	"98.03 bibrelex"
+, author =      "P. W. Dymon and S. A. Cook"
+, title =       "Hardware Complexity and Parallel Comuting"
+, booktitle =   "Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1980
+, pages =       "360--372"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{dlr-acddt-90
-, author =	"N. Dyn and D. Levin and S. Rippa"
-, title =	"Algorithms for the Construction of Data Dependent Triangulations"
-, editor =	"J. C. Mason and M. G. Cox"
-, booktitle =	"Algorithms for Approximation II"
-, publisher =	"Chapman and Hall"
-, address =	"London"
-, year =	1990
-, pages =	"185--192"
+, author =      "N. Dyn and D. Levin and S. Rippa"
+, title =       "Algorithms for the Construction of Data Dependent Triangulations"
+, editor =      "J. C. Mason and M. G. Cox"
+, booktitle =   "Algorithms for Approximation II"
+, publisher =   "Chapman and Hall"
+, address =     "London"
+, year =        1990
+, pages =       "185--192"
 }
 
 @article{dlr-ddtpl-90
-, author =	"Nira Dyn and David Levin and Samuel Rippa"
-, title =	"Data Dependent Triangulations for Piecewise Linear Interpolation"
-, journal =	"IMA Journal of Numerical Analysis"
-, volume =	10
-, year =	1990
-, pages =	"137--154"
-, annote =	"Triangulation for fitting a surface over 3d data.
-		 Choose triangulation that depends on the 3d data rather
-		 than its projection to 2d. LOT based on minimizing the
-		 angle between adjacent triangles."
+, author =      "Nira Dyn and David Levin and Samuel Rippa"
+, title =       "Data Dependent Triangulations for Piecewise Linear Interpolation"
+, journal =     "IMA Journal of Numerical Analysis"
+, volume =      10
+, year =        1990
+, pages =       "137--154"
+, annote =      "Triangulation for fitting a surface over 3d data.
+                 Choose triangulation that depends on the 3d data rather
+                 than its projection to 2d. LOT based on minimizing the
+                 angle between adjacent triangles."
 }
 
 @article{e-hgd-84
-, author =	"P. Eades"
-, title =	"A Heuristic for Graph Drawing"
-, journal =	"Congr. Numer."
-, volume =	42
-, year =	1984
-, pages =	"149--160"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Eades"
+, title =       "A Heuristic for Graph Drawing"
+, journal =     "Congr. Numer."
+, volume =      42
+, year =        1984
+, pages =       "149--160"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{e-ciddg-89
-, author =	"P. Eades"
-, title =	"Complexity Issues in Drawing Directed Graphs"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, month =	nov
-, year =	1989
-, pages =	"9--15"
-, keywords =	"graph drawing"
-, update =	"95.09 mitchell, 93.09 tamassia"
+, author =      "P. Eades"
+, title =       "Complexity Issues in Drawing Directed Graphs"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, month =       nov
+, year =        1989
+, pages =       "9--15"
+, keywords =    "graph drawing"
+, update =      "95.09 mitchell, 93.09 tamassia"
 }
 
 @incollection{e-sfa-88
-, author =	"P. Eades"
-, title =	"Symmetry finding algorithms"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"41--51"
+, author =      "P. Eades"
+, title =       "Symmetry finding algorithms"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "41--51"
 }
 
 @inproceedings{ech-oagdw-97
-, author =	"Peter Eades and Robert F. Cohen and Mao Lin Huang"
-, title =	"Online Animated Graph Drawing for Web Navigation"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"330--335"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Peter Eades and Robert F. Cohen and Mao Lin Huang"
+, title =       "Online Animated Graph Drawing for Web Navigation"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "330--335"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{ef-dcgog-97
-, author =	"Peter Eades and {Qing-Wen} Feng"
-, title =	"Drawing Clustered Graphs on an Orthogonal Grid"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"146--157"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Peter Eades and {Qing-Wen} Feng"
+, title =       "Drawing Clustered Graphs on an Orthogonal Grid"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "146--157"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{efk-ssdga-88
-, author =	"P. Eades and I. Fogg and D. Kelly"
-, title =	"{SPREMB}: a System for Developing Graph Algorithms"
-, journal =	"Congr. Numer."
-, volume =	66
-, year =	1988
-, pages =	"123--140"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Eades and I. Fogg and D. Kelly"
+, title =       "{SPREMB}: a System for Developing Graph Algorithms"
+, journal =     "Congr. Numer."
+, volume =      66
+, year =        1988
+, pages =       "123--140"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @incollection{efg-ehimw-82
-, author =	"P. Eades and L. Foulds and J. Giffin"
-, title =	"An Efficient Heuristic for Identifying a Maximal Weight Planar Subgraph"
-, booktitle =	"Combinatorial Mathematics IX"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	952
-, publisher =	"Springer-Verlag"
-, year =	1982
-, pages =	"239--251"
-, keywords =	"graph drawing"
-, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
+, author =      "P. Eades and L. Foulds and J. Giffin"
+, title =       "An Efficient Heuristic for Identifying a Maximal Weight Planar Subgraph"
+, booktitle =   "Combinatorial Mathematics IX"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      952
+, publisher =   "Springer-Verlag"
+, year =        1982
+, pages =       "239--251"
+, keywords =    "graph drawing"
+, update =      "99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
 }
 
 @inproceedings{eg-dspg-96
-, author =	"P. Eades and P. Garvan"
-, title =	"Drawing Stressed Planar Graphs in Three Dimensions"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	""
-, keywords =	"graph drawing, 3D, convex, straight-line"
-, update =	"96.09 tamassia"
+, author =      "P. Eades and P. Garvan"
+, title =       "Drawing Stressed Planar Graphs in Three Dimensions"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       ""
+, keywords =    "graph drawing, 3D, convex, straight-line"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{ehw-fbvtd-97
-, author =	"Peter Eades and Michael E. Houle and Richard Webber"
-, title =	"Finding the Best Viewpoints for Three-Dimensional Graph Drawings"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"87--98"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Peter Eades and Michael E. Houle and Richard Webber"
+, title =       "Finding the Best Viewpoints for Three-Dimensional Graph Drawings"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "87--98"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{ek-hrc2l-86
-, author =	"P. Eades and D. Kelly"
-, title =	"Heuristics for Reducing Crossings in 2-Layered Networks"
-, journal =	"Ars Combin."
-, volume =	"21.A"
-, year =	1986
-, pages =	"89--98"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Eades and D. Kelly"
+, title =       "Heuristics for Reducing Crossings in 2-Layered Networks"
+, journal =     "Ars Combin."
+, volume =      "21.A"
+, year =        1986
+, pages =       "89--98"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 
@@ -50639,3550 +50639,3550 @@ @article{eksw-eecaccc-06
 }
 
 @inproceedings{elms-pmmd-91
-, author =	"P. Eades and W. Lai and K. Misue and K. Sugiyama"
-, title =	"Preserving the Mental Map of a Diagram"
-, booktitle =	"Proceedings of Compugraphics 91"
-, year =	1991
-, pages =	"24--33"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Eades and W. Lai and K. Misue and K. Sugiyama"
+, title =       "Preserving the Mental Map of a Diagram"
+, booktitle =   "Proceedings of Compugraphics 91"
+, year =        1991
+, pages =       "24--33"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{el-adaal-93
-, author =	"P. Eades and T. Lin"
-, title =	"Algorithmic and Declarative Approaches to Aesthetic Layout"
-, booktitle =	"Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
-, site =	"Paris, France"
-, month =	sep
-, year =	1993
-, keywords =	"graph drawing"
-, update =	"94.01 tamassia"
+, author =      "P. Eades and T. Lin"
+, title =       "Algorithmic and Declarative Approaches to Aesthetic Layout"
+, booktitle =   "Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
+, site =        "Paris, France"
+, month =       sep
+, year =        1993
+, keywords =    "graph drawing"
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{ell-mshvd-92
-, author =	"P. Eades and T. Lin and X. Lin"
-, title =	"Minimum Size h-v Drawings"
-, booktitle =	"Proc. Advanced Visual Interfaces"
-, series =	"World Scientific Series in Computer Science"
-, volume =	36
-, year =	1992
-, pages =	"386--394"
-, keywords =	"graph drawing"
-, update =	"94.01 tamassia, 93.09 tamassia"
+, author =      "P. Eades and T. Lin and X. Lin"
+, title =       "Minimum Size h-v Drawings"
+, booktitle =   "Proc. Advanced Visual Interfaces"
+, series =      "World Scientific Series in Computer Science"
+, volume =      36
+, year =        1992
+, pages =       "386--394"
+, keywords =    "graph drawing"
+, update =      "94.01 tamassia, 93.09 tamassia"
 }
 
 %    xxx = Key Centre for Software Technology,
 @techreport{ell-ttdc-90
-, author =	"P. Eades and T. Lin and X. Lin"
-, title =	"Two Tree Drawing Conventions"
-, number =	174
-, institution =	"Department of Computer Science, University of Queensland"
-, year =	1990
-, keywords =	"graph drawing"
-, precedes =	"ell-ttdc-93"
-, update =	"97.03 rote, 96.09 devillers, 93.09 tamassia"
+, author =      "P. Eades and T. Lin and X. Lin"
+, title =       "Two Tree Drawing Conventions"
+, number =      174
+, institution = "Department of Computer Science, University of Queensland"
+, year =        1990
+, keywords =    "graph drawing"
+, precedes =    "ell-ttdc-93"
+, update =      "97.03 rote, 96.09 devillers, 93.09 tamassia"
 }
 
 @article{ell-ttdc-93
-, author =	"P. Eades and T. Lin and X. Lin"
-, title =	"Two Tree Drawing Conventions"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"133--153"
-, keywords =	"layout, tree drawing, dynamic programming, classical convention, tip-over convention, NP-hardness"
-, succeeds =	"ell-ttdc-90"
-, update =	"96.09 devillers"
+, author =      "P. Eades and T. Lin and X. Lin"
+, title =       "Two Tree Drawing Conventions"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "133--153"
+, keywords =    "layout, tree drawing, dynamic programming, classical convention, tip-over convention, NP-hardness"
+, succeeds =    "ell-ttdc-90"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{el-hddg-89
-, author =	"P. Eades and X. Lin"
-, title =	"How to Draw a Directed Graph"
-, booktitle =	"Proc. IEEE Workshop on Visual Languages"
-, nickname =	"VL '89"
-, year =	1989
-, pages =	"13--17"
-, keywords =	"graph drawing"
-, update =	"98.07 bibrelex, 95.05 tamassia, 93.09 tamassia"
+, author =      "P. Eades and X. Lin"
+, title =       "How to Draw a Directed Graph"
+, booktitle =   "Proc. IEEE Workshop on Visual Languages"
+, nickname =    "VL '89"
+, year =        1989
+, pages =       "13--17"
+, keywords =    "graph drawing"
+, update =      "98.07 bibrelex, 95.05 tamassia, 93.09 tamassia"
 }
 
 @inproceedings{el-nlapd-91
-, author =	"P. Eades and X. Lin"
-, title =	"Notes on the Layer Assignment Problem for Drawing Directed Graphs"
-, booktitle =	"ACSC 14: Proceedings of the 14th Australian Computer Science Conference"
-, year =	1991
-, pages =	"26.1--26.10"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Eades and X. Lin"
+, title =       "Notes on the Layer Assignment Problem for Drawing Directed Graphs"
+, booktitle =   "ACSC 14: Proceedings of the 14th Australian Computer Science Conference"
+, year =        1991
+, pages =       "26.1--26.10"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{elm-msgd-90
-, author =	"P. Eades and X. Lin and B. D. McKay"
-, title =	"Models for symmetric graph drawing"
-, type =	"Manuscript"
-, institution =	"Univ. Queensland"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "P. Eades and X. Lin and B. D. McKay"
+, title =       "Models for symmetric graph drawing"
+, type =        "Manuscript"
+, institution = "Univ. Queensland"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{elt-nadhg-90
-, author =	"P. Eades and X. Lin and R. Tamassia"
-, title =	"A new approach for drawing a hierarchical graph"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"143--146"
-, precedes =	"elt-adhg-92, elt-adhg-96"
-, cites =	"bm-gta-76, dn-atphg-87, cpru-cdfs-87, el-hddg-89, elm-msgd-90, et-adgab-89, ew-ecdbg-, gnv-dptdd-88, gj-cninc-83, lrt-gnd-79, m-ed2lh-88, rdmmst-bdg-87, s-cagd-87, stt-mvuhs-81, t-eggmn-87, t-hdg-63, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. Eades and X. Lin and R. Tamassia"
+, title =       "A new approach for drawing a hierarchical graph"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "143--146"
+, precedes =    "elt-adhg-92, elt-adhg-96"
+, cites =       "bm-gta-76, dn-atphg-87, cpru-cdfs-87, el-hddg-89, elm-msgd-90, et-adgab-89, ew-ecdbg-, gnv-dptdd-88, gj-cninc-83, lrt-gnd-79, m-ed2lh-88, rdmmst-bdg-87, s-cagd-87, stt-mvuhs-81, t-eggmn-87, t-hdg-63, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @misc{elt-adhg-92
-, author =	"P. Eades and X. Lin and R. Tamassia"
-, title =	"An Algorithm for Drawing a Hierarchical Graph"
-, year =	1992
-, keywords =	"graph drawing"
-, succeeds =	"elt-nadhg-90"
-, precedes =	"elt-adhg-96"
-, update =	"98.03 bibrelex, 96.09 devillers, 93.09 tamassia"
+, author =      "P. Eades and X. Lin and R. Tamassia"
+, title =       "An Algorithm for Drawing a Hierarchical Graph"
+, year =        1992
+, keywords =    "graph drawing"
+, succeeds =    "elt-nadhg-90"
+, precedes =    "elt-adhg-96"
+, update =      "98.03 bibrelex, 96.09 devillers, 93.09 tamassia"
 }
 
 @article{elt-adhg-96
-, author =	"P. Eades and X. Lin and R. Tamassia"
-, title =	"An Algorithm for Drawing a Hierarchical Graph"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"145--156"
-, url =	"https://www.cs.brown.edu/cgc/papers/elt-adhg-96.ps.gz"
-, succeeds =	"elt-adhg-92"
-, update =	"97.03 tamassia, 96.09 devillers"
+, author =      "P. Eades and X. Lin and R. Tamassia"
+, title =       "An Algorithm for Drawing a Hierarchical Graph"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "145--156"
+, url = "https://www.cs.brown.edu/cgc/papers/elt-adhg-96.ps.gz"
+, succeeds =    "elt-adhg-92"
+, update =      "97.03 tamassia, 96.09 devillers"
 }
 
 @techreport{elw-pgmpt-90
-, author =	"Peter Eades and Xuemin Lin and Nicolas C. Wormald"
-, title =	"Performance Guarantees for Motion Planning with Temporal Uncertainty"
-, number =	173
-, institution =	"Dept. of Computer Science, Univ. of Queensland"
-, address =	"St. Lucia, Queensland, Australia"
-, year =	1990
-, precedes =	"elw-pgmpt-93"
-, update =	"98.11 bibrelex, 98.07 bibrelex+icking, 98.03 icking+mitchell"
+, author =      "Peter Eades and Xuemin Lin and Nicolas C. Wormald"
+, title =       "Performance Guarantees for Motion Planning with Temporal Uncertainty"
+, number =      173
+, institution = "Dept. of Computer Science, Univ. of Queensland"
+, address =     "St. Lucia, Queensland, Australia"
+, year =        1990
+, precedes =    "elw-pgmpt-93"
+, update =      "98.11 bibrelex, 98.07 bibrelex+icking, 98.03 icking+mitchell"
 }
 
 @article{elw-pgmpt-93
-, author =	"Peter Eades and Xuemin Lin and Nicolas C. Wormald"
-, title =	"Performance Guarantees for Motion Planning with Temporal Uncertainty"
-, journal =	"Australian Computer Journal"
-, volume =	25
-, number =	1
-, year =	1993
-, pages =	"21--28"
-, succeeds =	"elw-pgmpt-90"
-, update =	"98.03 icking+mitchell"
+, author =      "Peter Eades and Xuemin Lin and Nicolas C. Wormald"
+, title =       "Performance Guarantees for Motion Planning with Temporal Uncertainty"
+, journal =     "Australian Computer Journal"
+, volume =      25
+, number =      1
+, year =        1993
+, pages =       "21--28"
+, succeeds =    "elw-pgmpt-90"
+, update =      "98.03 icking+mitchell"
 }
 
 @inproceedings{em-gdcr-95
-, author =	"P. Eades and J. Marks"
-, title =	"Graph Drawing Contest Report"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"143--146"
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia"
+, author =      "P. Eades and J. Marks"
+, title =       "Graph Drawing Contest Report"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "143--146"
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{emn-gdcr-97
-, author =	"Peter Eades and Joe Marks and Stephen North"
-, title =	"Graph-Drawing Contest Report"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"438--445"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Peter Eades and Joe Marks and Stephen North"
+, title =       "Graph-Drawing Contest Report"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "438--445"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{emw-ecp-86
-, author =	"P. Eades and B. McKay and N. Wormald"
-, title =	"On an Edge Crossing Problem"
-, booktitle =	"Proc. 9th Australian Computer Science Conference"
-, year =	1986
-, pages =	"327--334"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Eades and B. McKay and N. Wormald"
+, title =       "On an Edge Crossing Problem"
+, booktitle =   "Proc. 9th Australian Computer Science Conference"
+, year =        1986
+, pages =       "327--334"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{er-ccmsp-93
-, author =	"P. Eades and D. Rappaport"
-, title =	"The complexity of computing minimum separating polygons"
-, journal =	"Pattern Recogn. Lett."
-, volume =	14
-, year =	1993
-, pages =	"715--718"
-, update =	"98.03 bibrelex+mitchell, 93.09 milone+mitchell"
+, author =      "P. Eades and D. Rappaport"
+, title =       "The complexity of computing minimum separating polygons"
+, journal =     "Pattern Recogn. Lett."
+, volume =      14
+, year =        1993
+, pages =       "715--718"
+, update =      "98.03 bibrelex+mitchell, 93.09 milone+mitchell"
 }
 
 @article{esw-tkbtd-96
-, author =	"P. Eades and C. Stirk and S. Whitesides"
-, title =	"The Techniques of {Kolmogorov} and {Bardzin} for Three Dimensional Orthogonal Graph Drawings"
-, journal =	"Inform. Process. Lett."
-, volume =	60
-, year =	1996
-, pages =	"97--103"
-, keywords =	"graph drawing, orthogonal, 3D"
-, update =	"98.11 tamassia"
+, author =      "P. Eades and C. Stirk and S. Whitesides"
+, title =       "The Techniques of {Kolmogorov} and {Bardzin} for Three Dimensional Orthogonal Graph Drawings"
+, journal =     "Inform. Process. Lett."
+, volume =      60
+, year =        1996
+, pages =       "97--103"
+, keywords =    "graph drawing, orthogonal, 3D"
+, update =      "98.11 tamassia"
 }
 
 @techreport{esw-tkbtd-95
-, author =	"P. Eades and C. Stirk and S. Whitesides"
-, title =	"The Techniques of {Komolgorov} and {Bardzin} for Three Dimensional Orthogonal Graph Drawings"
-, type =	"Manuscript"
-, institution =	"Dept. of Computer Sci., Univ. of Newcastle"
-, year =	1995
-, keywords =	"graph drawing"
-, update =	"98.07 bibrelex, 96.09 tamassia"
+, author =      "P. Eades and C. Stirk and S. Whitesides"
+, title =       "The Techniques of {Komolgorov} and {Bardzin} for Three Dimensional Orthogonal Graph Drawings"
+, type =        "Manuscript"
+, institution = "Dept. of Computer Sci., Univ. of Newcastle"
+, year =        1995
+, keywords =    "graph drawing"
+, update =      "98.07 bibrelex, 96.09 tamassia"
 }
 
 @article{es-hddg-91
-, author =	"P. Eades and K. Sugiyama"
-, title =	"How to Draw a Directed Graph"
-, journal =	"J. Inform. Process."
-, volume =	13
-, year =	1991
-, pages =	"424--437"
-, keywords =	"graph drawing"
-, update =	"98.07 tamassia, 93.09 tamassia"
+, author =      "P. Eades and K. Sugiyama"
+, title =       "How to Draw a Directed Graph"
+, journal =     "J. Inform. Process."
+, volume =      13
+, year =        1991
+, pages =       "424--437"
+, keywords =    "graph drawing"
+, update =      "98.07 tamassia, 93.09 tamassia"
 }
 
 @inproceedings{esw-tatdo-97
-, author =	"P. Eades and A. Symvonis and S. Whitesides"
-, title =	"Two Algorithms for Three Dimensional Orthogonal Graph Drawing"
-, editor =	"S. North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"139--154"
-, keywords =	"graph drawing, 3D, orthogonal"
-, update =	"98.07 patrignani"
+, author =      "P. Eades and A. Symvonis and S. Whitesides"
+, title =       "Two Algorithms for Three Dimensional Orthogonal Graph Drawing"
+, editor =      "S. North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "139--154"
+, keywords =    "graph drawing, 3D, orthogonal"
+, update =      "98.07 patrignani"
 }
 
 @techreport{et-aagda-87
-, author =	"P. Eades and R. Tamassia"
-, title =	"Algorithms for automatic graph drawing: an annotated bibliography"
-, type =	"Report"
-, number =	82
-, institution =	"Department of Computer Science, University of Queensland"
-, address =	"St. Lucia, Queensland, Australia"
-, year =	1987
-, keywords =	"graph drawing"
-, precedes =	"et-adgab-89"
-, update =	"93.09 tamassia"
+, author =      "P. Eades and R. Tamassia"
+, title =       "Algorithms for automatic graph drawing: an annotated bibliography"
+, type =        "Report"
+, number =      82
+, institution = "Department of Computer Science, University of Queensland"
+, address =     "St. Lucia, Queensland, Australia"
+, year =        1987
+, keywords =    "graph drawing"
+, precedes =    "et-adgab-89"
+, update =      "93.09 tamassia"
 }
 
 @techreport{et-adgab-89
-, author =	"P. Eades and R. Tamassia"
-, title =	"Algorithms for Drawing Graphs: An Annotated Bibliography"
-, type =	"Report"
-, number =	"CS-09-89"
-, institution =	"Department of Computer Science, Brown University"
-, address =	"Providence, RI"
-, month =	feb
-, year =	1989
-, keywords =	"graph drawing, graph theory, computer graphics, bibliography"
-, succeeds =	"et-aagda-87"
-, precedes =	"dett-adgab-93"
-, update =	"93.09 jones+milone+mitchell+tamassia, 93.05 jones"
-, annote =	"``lists about 180 papers, both theoretical and
-		 application oriented''"
+, author =      "P. Eades and R. Tamassia"
+, title =       "Algorithms for Drawing Graphs: An Annotated Bibliography"
+, type =        "Report"
+, number =      "CS-09-89"
+, institution = "Department of Computer Science, Brown University"
+, address =     "Providence, RI"
+, month =       feb
+, year =        1989
+, keywords =    "graph drawing, graph theory, computer graphics, bibliography"
+, succeeds =    "et-aagda-87"
+, precedes =    "dett-adgab-93"
+, update =      "93.09 jones+milone+mitchell+tamassia, 93.05 jones"
+, annote =      "``lists about 180 papers, both theoretical and
+                 application oriented''"
 }
 
 @article{ew-dgtl-94
-, author =	"P. Eades and S. Whitesides"
-, title =	"Drawing Graphs in Two Layers"
-, journal =	"Theoret. Comput. Sci."
-, volume =	131
-, number =	2
-, year =	1994
-, pages =	"361--374"
-, update =	"98.07 vismara"
+, author =      "P. Eades and S. Whitesides"
+, title =       "Drawing Graphs in Two Layers"
+, journal =     "Theoret. Comput. Sci."
+, volume =      131
+, number =      2
+, year =        1994
+, pages =       "361--374"
+, update =      "98.07 vismara"
 }
 
 @inproceedings{ew-rpems-94
-, author =	"P. Eades and S. Whitesides"
-, title =	"The Realization Problem for {Euclidean} Minimum Spanning Trees is {NP}-Hard"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"49--56"
-, keywords =	"graph drawing, proximity, NP-hardness"
-, cites =	"bll-cpt-93, b-ndgta-88, ds-ltati-92, ds-smrdd-93, e-dft-92, gj-cigtn-79, i-dtg-90, mrh-dcaal-91, ms-tgmst-91, rt-tdt-81, s-rrddl-84, v-ucvc-81, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "P. Eades and S. Whitesides"
+, title =       "The Realization Problem for {Euclidean} Minimum Spanning Trees is {NP}-Hard"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "49--56"
+, keywords =    "graph drawing, proximity, NP-hardness"
+, cites =       "bll-cpt-93, b-ndgta-88, ds-ltati-92, ds-smrdd-93, e-dft-92, gj-cigtn-79, i-dtg-90, mrh-dcaal-91, ms-tgmst-91, rt-tdt-81, s-rrddl-84, v-ucvc-81, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @article{ew-rpems-96
-, author =	"P. Eades and S. Whitesides"
-, title =	"The Realization Problem for {Euclidean} Minimum Spanning Trees is {NP}-hard"
-, journal =	"Algorithmica"
-, volume =	16
-, year =	1996
-, pages =	"60--82"
-, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
-, keywords =	"graph drawing, proximity, NP-hardness"
-, succeeds =	"ew-rpems-94"
-, update =	"96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
+, author =      "P. Eades and S. Whitesides"
+, title =       "The Realization Problem for {Euclidean} Minimum Spanning Trees is {NP}-hard"
+, journal =     "Algorithmica"
+, volume =      16
+, year =        1996
+, pages =       "60--82"
+, note =        "(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
+, keywords =    "graph drawing, proximity, NP-hardness"
+, succeeds =    "ew-rpems-94"
+, update =      "96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
 }
 
 @techreport{ew-ecdbg-
-, author =	"P. Eades and N. Wormald"
-, title =	"Edge Crossings in Drawings of Bipartite Graphs"
-, number =	108
-, institution =	"Department of Computer Science, University of Queensland"
-, note =	"to appear in Algorithmica"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Eades and N. Wormald"
+, title =       "Edge Crossings in Drawings of Bipartite Graphs"
+, number =      108
+, institution = "Department of Computer Science, University of Queensland"
+, note =        "to appear in Algorithmica"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{ew-felgd-90
-, author =	"P. Eades and N. Wormald"
-, title =	"Fixed Edge Length Graph Drawing is {NP}-hard"
-, journal =	"Discrete Appl. Math."
-, volume =	28
-, year =	1990
-, pages =	"111--134"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Eades and N. Wormald"
+, title =       "Fixed Edge Length Graph Drawing is {NP}-hard"
+, journal =     "Discrete Appl. Math."
+, volume =      28
+, year =        1990
+, pages =       "111--134"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{ew-mhd2l-86
-, author =	"P. Eades and N. Wormald"
-, title =	"The Median Heuristic for Drawing 2-Layered Networks"
-, number =	69
-, institution =	"Department of Computer Science, University of Queensland"
-, year =	1986
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Eades and N. Wormald"
+, title =       "The Median Heuristic for Drawing 2-Layered Networks"
+, number =      69
+, institution = "Department of Computer Science, University of Queensland"
+, year =        1986
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{ew-ecdbg-94
-, author =	"P. Eades and N. C. Wormald"
-, title =	"Edge Crossings in Drawings of Bipartite Graphs"
-, journal =	"Algorithmica"
-, volume =	11
-, number =	4
-, year =	1994
-, pages =	"379--403"
-, keywords =	"graph drawing, NP-complete, crossings, bipartite, layered"
-, succeeds =	"ew-ecdbg-"
-, update =	"98.07 tamassia+vismara"
+, author =      "P. Eades and N. C. Wormald"
+, title =       "Edge Crossings in Drawings of Bipartite Graphs"
+, journal =     "Algorithmica"
+, volume =      11
+, number =      4
+, year =        1994
+, pages =       "379--403"
+, keywords =    "graph drawing, NP-complete, crossings, bipartite, layered"
+, succeeds =    "ew-ecdbg-"
+, update =      "98.07 tamassia+vismara"
 }
 
 @article{e-dft-92
-, author =	"P. D. Eades"
-, title =	"Drawing Free Trees"
-, journal =	"Bulletin of the Institute for Combinatorics and its Applications"
-, volume =	5
-, year =	1992
-, pages =	"10--36"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. D. Eades"
+, title =       "Drawing Free Trees"
+, journal =     "Bulletin of the Institute for Combinatorics and its Applications"
+, volume =      5
+, year =        1992
+, pages =       "10--36"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{e-tfcgc-88
-, title =	"Theoretical Foundations of Computer Graphics and {CAD}"
-, editor =	"R. A. Earnshaw"
-, series =	"NATA ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1988
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, title =       "Theoretical Foundations of Computer Graphics and {CAD}"
+, editor =      "R. A. Earnshaw"
+, series =      "NATA ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1988
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{e-obsnn-81
-, author =	"C. M. Eastman"
-, title =	"Optimal bucket size for nearest neighbor searching in $k$-d trees"
-, journal =	"Inform. Process. Lett."
-, volume =	12
-, year =	1981
-, pages =	"165--167"
+, author =      "C. M. Eastman"
+, title =       "Optimal bucket size for nearest neighbor searching in $k$-d trees"
+, journal =     "Inform. Process. Lett."
+, volume =      12
+, year =        1981
+, pages =       "165--167"
 }
 
 @article{e-rsp-70
-, author =	"C. M. Eastman"
-, title =	"Representations for space planing"
-, journal =	"Commun. ACM"
-, volume =	13
-, year =	1970
-, pages =	"242--250"
-, update =	"97.11 bibrelex"
+, author =      "C. M. Eastman"
+, title =       "Representations for space planing"
+, journal =     "Commun. ACM"
+, volume =      13
+, year =        1970
+, pages =       "242--250"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ew-gmueo-79
-, author =	"C. M. Eastman and K. Weiler"
-, title =	"Geometric modeling using the {Euler} operator"
-, type =	"Research {Report}"
-, number =	78
-, institution =	"Institute of Physical Planning, Carnegie Mellon Univ."
-, address =	"Pittsburgh, PA"
-, month =	feb
-, year =	1979
-, update =	"98.03 bibrelex"
+, author =      "C. M. Eastman and K. Weiler"
+, title =       "Geometric modeling using the {Euler} operator"
+, type =        "Research {Report}"
+, number =      78
+, institution = "Institute of Physical Planning, Carnegie Mellon Univ."
+, address =     "Pittsburgh, PA"
+, month =       feb
+, year =        1979
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ey-eafui-72
-, author =	"C. M. Eastman and C. I. Yessios"
-, title =	"An Efficient Algorithm for Finding the Union, Intersection, and Differences of Spatial Domains"
-, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, month =	sep
-, year =	1972
-, update =	"98.03 bibrelex"
+, author =      "C. M. Eastman and C. I. Yessios"
+, title =       "An Efficient Algorithm for Finding the Union, Intersection, and Differences of Spatial Domains"
+, institution = "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, month =       sep
+, year =        1972
+, update =      "98.03 bibrelex"
 }
 
 @article{ez-psnns-82
-, author =	"C. M. Eastman and M. Zemankova"
-, title =	"Partially specified nearest neighbor searches using $k$-d trees"
-, journal =	"Inform. Process. Lett."
-, volume =	15
-, year =	1982
-, pages =	"53--56"
+, author =      "C. M. Eastman and M. Zemankova"
+, title =       "Partially specified nearest neighbor searches using $k$-d trees"
+, journal =     "Inform. Process. Lett."
+, volume =      15
+, year =        1982
+, pages =       "53--56"
 }
 
 @inproceedings{efnn-rauvd-89
-, author =	"H. Ebara and N. Fukuyama and H. Nakano and Y. Nakanishi"
-, title =	"Roundness algorithms using the {Voronoi} diagrams"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	41
+, author =      "H. Ebara and N. Fukuyama and H. Nakano and Y. Nakanishi"
+, title =       "Roundness algorithms using the {Voronoi} diagrams"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       41
 }
 
 @techreport{enn-ptafr-85
-, author =	"H. Ebara and H. Nakano and Y. Nakanishi"
-, title =	"A polynomial-time algorithm to find the roundness"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Commun. Engrg., Osaka Univ."
-, year =	1985
+, author =      "H. Ebara and H. Nakano and Y. Nakanishi"
+, title =       "A polynomial-time algorithm to find the roundness"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Commun. Engrg., Osaka Univ."
+, year =        1985
 }
 
 @article{e-ubtfc-85
-, author =	"J. Eckhoff"
-, title =	"An upper bound theorem for families of convex sets"
-, journal =	"Geom. Dedicata"
-, volume =	19
-, year =	1985
-, pages =	"217--227"
-, update =	"97.11 bibrelex"
+, author =      "J. Eckhoff"
+, title =       "An upper bound theorem for families of convex sets"
+, journal =     "Geom. Dedicata"
+, volume =      19
+, year =        1985
+, pages =       "217--227"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{e-hrctt-93
-, author =	"J. Eckhoff"
-, title =	"Helly, {Radon} and {Carath\'eodory} type theorems"
-, booktitle =	"Handbook of Convex Geometry"
-, publisher =	"North-Holland"
-, year =	1993
-, pages =	"389--448"
-, update =	"95.09 wenger, 95.01 matousek"
+, author =      "J. Eckhoff"
+, title =       "Helly, {Radon} and {Carath\'eodory} type theorems"
+, booktitle =   "Handbook of Convex Geometry"
+, publisher =   "North-Holland"
+, year =        1993
+, pages =       "389--448"
+, update =      "95.09 wenger, 95.01 matousek"
 }
 
 @incollection{e-rt-79
-, author =	"J. Eckhoff"
-, title =	"{Radon's} theorem"
-, editor =	"J. T{\"o}lke and J. M. Wills"
-, booktitle =	"Contributions to Geometry"
-, publisher =	"Birkh{\"a}user"
-, year =	1979
-, pages =	"164--185"
-, update =	"98.03 bibrelex"
+, author =      "J. Eckhoff"
+, title =       "{Radon's} theorem"
+, editor =      "J. T{\"o}lke and J. M. Wills"
+, booktitle =   "Contributions to Geometry"
+, publisher =   "Birkh{\"a}user"
+, year =        1979
+, pages =       "164--185"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{esg-cgcra-00
-, author =	"Ilya Eckstein and Vitaly Surazhsky and Craig Gotsman"
-, title =	"Compatible Geometries by Convex Representations with Applications to Computer Graphics"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"45--46"
-, update =	"00.03 bibrelex"
+, author =      "Ilya Eckstein and Vitaly Surazhsky and Craig Gotsman"
+, title =       "Compatible Geometries by Convex Representations with Applications to Computer Graphics"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "45--46"
+, update =      "00.03 bibrelex"
 }
 
 @mastersthesis{e-hbr-94
-, author =	"J. Eckstein"
-, title =	"Heuristische {Bewegungsplanungsstrategien} im {$IR^3$}"
-, type =	"M.{Sc}. Thesis"
-, school =	"Dept. Comput. Sci., University Saarland"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, url =	"http://hamster.cs.uni-sb.de/~eckstein/publications/Diplom-Eckstein.ps.Z"
-, keywords =	"master thesis, motion planning, collision detection, heuristic"
-, update =	"95.09 chadzelek"
+, author =      "J. Eckstein"
+, title =       "Heuristische {Bewegungsplanungsstrategien} im {$IR^3$}"
+, type =        "M.{Sc}. Thesis"
+, school =      "Dept. Comput. Sci., University Saarland"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, url = "http://hamster.cs.uni-sb.de/~eckstein/publications/Diplom-Eckstein.ps.Z"
+, keywords =    "master thesis, motion planning, collision detection, heuristic"
+, update =      "95.09 chadzelek"
 }
 
 @techreport{ehs-hbr-95
-, author =	"J. Eckstein and G. Hotz and E. Sch{\"o}mer"
-, title =	"Heuristische {Bewegungsplanungsstrategien} im {$IR^3$}"
-, type =	"Report"
-, number =	"95-05"
-, institution =	"Dept. Comput. Sci., University Saarland"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1995
-, url =	"http://hamster.cs.uni-sb.de/~eckstein/publications/FB14-95-05.ps.Z"
-, keywords =	"motion planning, collision detection, heuristic"
-, update =	"95.09 chadzelek"
+, author =      "J. Eckstein and G. Hotz and E. Sch{\"o}mer"
+, title =       "Heuristische {Bewegungsplanungsstrategien} im {$IR^3$}"
+, type =        "Report"
+, number =      "95-05"
+, institution = "Dept. Comput. Sci., University Saarland"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1995
+, url = "http://hamster.cs.uni-sb.de/~eckstein/publications/FB14-95-05.ps.Z"
+, keywords =    "motion planning, collision detection, heuristic"
+, update =      "95.09 chadzelek"
 }
 
 @article{epo-taasm-91
-, author =	"A. B. Ecoule and F. C. Peyrin and C. L. Odet"
-, title =	"A triangulation algorithm for arbitrary shaped multiple planar contours"
-, journal =	"ACM Trans. Graph."
-, volume =	10
-, number =	2
-, year =	1991
-, pages =	"182--199"
-, keywords =	"polygons, triangulation, contours, surfaces"
-, update =	"95.09 korneenko"
+, author =      "A. B. Ecoule and F. C. Peyrin and C. L. Odet"
+, title =       "A triangulation algorithm for arbitrary shaped multiple planar contours"
+, journal =     "ACM Trans. Graph."
+, volume =      10
+, number =      2
+, year =        1991
+, pages =       "182--199"
+, keywords =    "polygons, triangulation, contours, surfaces"
+, update =      "95.09 korneenko"
 }
 
 @book{c-mangg-91
-, author =	"J. E. Castillo (ed)"
-, title =	"Mathematical Aspects of Numerical Grid Generation"
-, publisher =	"Soc. for Industrial and Applied Math."
-, address =	"Philadelphia"
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "J. E. Castillo (ed)"
+, title =       "Mathematical Aspects of Numerical Grid Generation"
+, publisher =   "Soc. for Industrial and Applied Math."
+, address =     "Philadelphia"
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 % inexact booktitle
 @inproceedings{e-nbtai-88
-, author =	"M. Edahiro"
-, title =	"A new bucketing technique for automatic/interactive layout design"
-, editor =	"Carlo Sequin"
-, booktitle =	"Proc. Conf. VLSI '87"
-, year =	1988
-, pages =	"391--401"
-, keywords =	"bucketing, isothetic, VLSI design"
-, update =	"95.09 korneenko"
+, author =      "M. Edahiro"
+, title =       "A new bucketing technique for automatic/interactive layout design"
+, editor =      "Carlo Sequin"
+, booktitle =   "Proc. Conf. VLSI '87"
+, year =        1988
+, pages =       "391--401"
+, keywords =    "bucketing, isothetic, VLSI design"
+, update =      "95.09 korneenko"
 }
 
 @techreport{eia-arspi-??
-, author =	"M. Edahiro and M. Iri and Ta. Asano"
-, title =	"An algorithm for the range-search problem and its practical efficiency"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
+, author =      "M. Edahiro and M. Iri and Ta. Asano"
+, title =       "An algorithm for the range-search problem and its practical efficiency"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
 }
 
 @article{eka-nplai-84
-, author =	"M. Edahiro and I. Kokubo and T. Asano"
-, title =	"A New Point-Location Algorithm and its Practical Efficiency --- {C}omparison with Existing Algorithms"
-, journal =	"ACM Trans. Graph."
-, volume =	3
-, number =	2
-, year =	1984
-, pages =	"86--109"
-, keywords =	"point location, bucketing, implementing algorithms"
-, update =	"98.07 tamassia"
+, author =      "M. Edahiro and I. Kokubo and T. Asano"
+, title =       "A New Point-Location Algorithm and its Practical Efficiency --- {C}omparison with Existing Algorithms"
+, journal =     "ACM Trans. Graph."
+, volume =      3
+, number =      2
+, year =        1984
+, pages =       "86--109"
+, keywords =    "point location, bucketing, implementing algorithms"
+, update =      "98.07 tamassia"
 }
 
 @inproceedings{etha-baosi-87
-, author =	"M. Edahiro and K. Tanaka and R. Hoshino and Ta. Asano"
-, title =	"A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"258--267"
-, precedes =	"etha-baosi-89"
-, cites =	"aeiim-pubtc-85, c-fsnaq-86, egs-oplms-86, m-pst-85, vw-rlsil-82, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "M. Edahiro and K. Tanaka and R. Hoshino and Ta. Asano"
+, title =       "A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "258--267"
+, precedes =    "etha-baosi-89"
+, cites =       "aeiim-pubtc-85, c-fsnaq-86, egs-oplms-86, m-pst-85, vw-rlsil-82, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{etha-baosi-89
-, author =	"M. Edahiro and K. Tanaka and R. Hoshino and Ta. Asano"
-, title =	"A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"61--76"
-, succeeds =	"etha-baosi-87"
+, author =      "M. Edahiro and K. Tanaka and R. Hoshino and Ta. Asano"
+, title =       "A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "61--76"
+, succeeds =    "etha-baosi-87"
 }
 
 @article{e-nchap-77
-, author =	"W. F. Eddy"
-, title =	"A new convex hull algorithm for planar sets"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	3
-, year =	1977
-, pages =	"398--403 and 411--412"
-, keywords =	"design of algorithms, convex hull, two-dimensional, expected-case analysis"
-, annote =	"$O(n)$ time"
+, author =      "W. F. Eddy"
+, title =       "A new convex hull algorithm for planar sets"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      3
+, year =        1977
+, pages =       "398--403 and 411--412"
+, keywords =    "design of algorithms, convex hull, two-dimensional, expected-case analysis"
+, annote =      "$O(n)$ time"
 }
 
 @article{e-a523c-77
-, author =	"W. F. Eddy"
-, title =	"Algorithm 523 {CONVEX}: {A} new convex hull algorithm for planar sets"
-, journal =	"Collected Algorithms from ACM"
-, volume =	"??"
-, year =	1977
-, pages =	"523p1--523p6"
-, keywords =	"convex hull, points"
-, update =	"95.09 korneenko"
+, author =      "W. F. Eddy"
+, title =       "Algorithm 523 {CONVEX}: {A} new convex hull algorithm for planar sets"
+, journal =     "Collected Algorithms from ACM"
+, volume =      "??"
+, year =        1977
+, pages =       "523p1--523p6"
+, keywords =    "convex hull, points"
+, update =      "95.09 korneenko"
 }
 
 % inexact booktitle
 @inproceedings{e-chp-82
-, author =	"W. F. Eddy"
-, title =	"Convex hull peeling"
-, booktitle =	"Proc. Sympos. on Computational Statistics, Part 1"
-, year =	1982
-, pages =	"42--47"
-, keywords =	"convex hull, pointset, peeling"
-, update =	"95.09 korneenko"
+, author =      "W. F. Eddy"
+, title =       "Convex hull peeling"
+, booktitle =   "Proc. Sympos. on Computational Statistics, Part 1"
+, year =        1982
+, pages =       "42--47"
+, keywords =    "convex hull, pointset, peeling"
+, update =      "95.09 korneenko"
 }
 
 % not a journal, according to Math Reviews or INSPEC serials lists
 @inproceedings{e-dmsc-80
-, author =	"W. F. Eddy"
-, title =	"Discrete methods for statistical computation"
-, booktitle =	"Proc. Statist. Comput. Sec., Amer. Statist. Assoc."
-, year =	1980
-, pages =	"27--31"
+, author =      "W. F. Eddy"
+, title =       "Discrete methods for statistical computation"
+, booktitle =   "Proc. Statist. Comput. Sec., Amer. Statist. Assoc."
+, year =        1980
+, pages =       "27--31"
 }
 
 @article{e-dchgs-80
-, author =	"W. F. Eddy"
-, title =	"Distribution of the convex hull of a {Gaussian} sample"
-, journal =	"J. Appl. Probab."
-, volume =	17
-, number =	3
-, year =	1980
-, pages =	"686--695"
-, keywords =	"convex hull, probabilistic geometry"
-, update =	"95.09 korneenko"
+, author =      "W. F. Eddy"
+, title =       "Distribution of the convex hull of a {Gaussian} sample"
+, journal =     "J. Appl. Probab."
+, volume =      17
+, number =      3
+, year =        1980
+, pages =       "686--695"
+, keywords =    "convex hull, probabilistic geometry"
+, update =      "95.09 korneenko"
 }
 
 @article{eg-bt-87
-, author =	"P. Edelman and C. Greene"
-, title =	"Balanced tableaux"
-, journal =	"Adv. Math."
-, volume =	63
-, year =	1987
-, pages =	"42--99"
-, update =	"97.11 bibrelex"
+, author =      "P. Edelman and C. Greene"
+, title =       "Balanced tableaux"
+, journal =     "Adv. Math."
+, volume =      63
+, year =        1987
+, pages =       "42--99"
+, update =      "97.11 bibrelex"
 }
 
 @article{eg-ccytb-84
-, author =	"P. Edelman and C. Greene"
-, title =	"Combinatorial correspondences for Young tableaux, balanced tableaux, and maximal chains in the {Bruhat} order of $S_n$"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	34
-, year =	1984
-, note =	"Combinatorics and Algebra, Contemporary Math."
-, update =	"98.11 bibrelex"
+, author =      "P. Edelman and C. Greene"
+, title =       "Combinatorial correspondences for Young tableaux, balanced tableaux, and maximal chains in the {Bruhat} order of $S_n$"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      34
+, year =        1984
+, note =        "Combinatorics and Algebra, Contemporary Math."
+, update =      "98.11 bibrelex"
 }
 
 @book{e-gtmg-01
-, author =	"E. Edelsbrunner"
-, title =	"Geometry and Topology for Mesh Generation"
-, publisher =	"Cambridge"
-, year =	2001
-, note =	""
-, update =	"02.03 pocchiola"
+, author =      "E. Edelsbrunner"
+, title =       "Geometry and Topology for Mesh Generation"
+, publisher =   "Cambridge"
+, year =        2001
+, note =        ""
+, update =      "02.03 pocchiola"
 }
 
 @article{e-narip1-83
-, author =	"H. Edelsbrunner"
-, title =	"A new approach to rectangle intersections, {Part} {I}"
-, journal =	"Internat. J. Comput. Math."
-, volume =	13
-, year =	1983
-, pages =	"209--219"
-, keywords =	"data structuring, searching, reporting, dynamizing data structures, interval trees, worst-case analysis, intervals, one-dimensional"
+, author =      "H. Edelsbrunner"
+, title =       "A new approach to rectangle intersections, {Part} {I}"
+, journal =     "Internat. J. Comput. Math."
+, volume =      13
+, year =        1983
+, pages =       "209--219"
+, keywords =    "data structuring, searching, reporting, dynamizing data structures, interval trees, worst-case analysis, intervals, one-dimensional"
 }
 
 @article{e-narip2-83
-, author =	"H. Edelsbrunner"
-, title =	"A new approach to rectangle intersections, {Part} {II}"
-, journal =	"Internat. J. Comput. Math."
-, volume =	13
-, year =	1983
-, pages =	"221--229"
-, keywords =	"design of algorithms, reporting, intersection, plane-sweep, repeated search, interval trees, intervals, rectangles, two-dimensional"
+, author =      "H. Edelsbrunner"
+, title =       "A new approach to rectangle intersections, {Part} {II}"
+, journal =     "Internat. J. Comput. Math."
+, volume =      13
+, year =        1983
+, pages =       "221--229"
+, keywords =    "design of algorithms, reporting, intersection, plane-sweep, repeated search, interval trees, intervals, rectangles, two-dimensional"
 }
 
 @article{e-ndrs-81
-, author =	"H. Edelsbrunner"
-, title =	"A note on dynamic range searching"
-, journal =	"Bull. EATCS"
-, volume =	15
-, year =	1981
-, pages =	"34--40"
-, keywords =	"data structuring, searching, reporting, range search, range trees, priority search trees, points, hyperrectangles, $d$-dimensional"
+, author =      "H. Edelsbrunner"
+, title =       "A note on dynamic range searching"
+, journal =     "Bull. EATCS"
+, volume =      15
+, year =        1981
+, pages =       "34--40"
+, keywords =    "data structuring, searching, reporting, range search, range trees, priority search trees, points, hyperrectangles, $d$-dimensional"
 }
 
 @techreport{e-adncp-95
-, author =	"H. Edelsbrunner"
-, title =	"Algebraic decomposition of non-convex polyhedra"
-, number =	"UIUCDCS-R-95-1928"
-, institution =	"University of Illinois at Urbana-Champaign"
-, month =	aug
-, year =	1995
-, update =	"96.05 ramkumar"
+, author =      "H. Edelsbrunner"
+, title =       "Algebraic decomposition of non-convex polyhedra"
+, number =      "UIUCDCS-R-95-1928"
+, institution = "University of Illinois at Urbana-Champaign"
+, month =       aug
+, year =        1995
+, update =      "96.05 ramkumar"
 }
 
 @inproceedings{e-adnp-95
-, author =	"Herbert Edelsbrunner"
-, title =	"Algebraic decomposition of non-convex polyhedra"
-, booktitle =	"Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '95"
-, year =	1995
-, pages =	"248--257"
-, update =	"98.07 bibrelex, 97.07 smid, 97.03 agarwal, 95.09 mitchell"
+, author =      "Herbert Edelsbrunner"
+, title =       "Algebraic decomposition of non-convex polyhedra"
+, booktitle =   "Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '95"
+, year =        1995
+, pages =       "248--257"
+, update =      "98.07 bibrelex, 97.07 smid, 97.03 agarwal, 95.09 mitchell"
 }
 
 @book{e-acg-87
-, author =	"H. Edelsbrunner"
-, title =	"Algorithms in Combinatorial Geometry"
-, series =	"EATCS Monographs on Theoretical Computer Science"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg, West Germany"
-, year =	1987
-, keywords =	"design of algorithms, discrete geometry, book"
-, update =	"93.09 erickson"
+, author =      "H. Edelsbrunner"
+, title =       "Algorithms in Combinatorial Geometry"
+, series =      "EATCS Monographs on Theoretical Computer Science"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg, West Germany"
+, year =        1987
+, keywords =    "design of algorithms, discrete geometry, book"
+, update =      "93.09 erickson"
 }
 
 @inproceedings{e-atccd-89
-, author =	"H. Edelsbrunner"
-, title =	"An acyclicity theorem for cell complexes in $d$ dimensions"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"145--151"
-, precedes =	"e-atccd-90"
-, cites =	"a-pdpaa-87, c-hsh-85, d-slsv-34, e-acg-87, eks-sspp-83, dfpn-stdt-88, fd-ficg-82, fkn-vsgpt-80, v-nadpc-07, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "H. Edelsbrunner"
+, title =       "An acyclicity theorem for cell complexes in $d$ dimensions"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "145--151"
+, precedes =    "e-atccd-90"
+, cites =       "a-pdpaa-87, c-hsh-85, d-slsv-34, e-acg-87, eks-sspp-83, dfpn-stdt-88, fd-ficg-82, fkn-vsgpt-80, v-nadpc-07, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{e-atccd-90
-, author =	"H. Edelsbrunner"
-, title =	"An acyclicity theorem for cell complexes in $d$ dimensions"
-, journal =	"Combinatorica"
-, volume =	10
-, number =	3
-, year =	1990
-, pages =	"251--260"
-, succeeds =	"e-atccd-89"
-, update =	"98.11 bibrelex"
+, author =      "H. Edelsbrunner"
+, title =       "An acyclicity theorem for cell complexes in $d$ dimensions"
+, journal =     "Combinatorica"
+, volume =      10
+, number =      3
+, year =        1990
+, pages =       "251--260"
+, succeeds =    "e-atccd-89"
+, update =      "98.11 bibrelex"
 }
 
 @book{e-agc-
-, author =	"H. Edelsbrunner"
-, title =	"Arrangements and geometric computations"
-, publisher =	"??"
-, year =	"??"
-, note =	"Forthcoming book"
-, update =	"97.11 bibrelex"
+, author =      "H. Edelsbrunner"
+, title =       "Arrangements and geometric computations"
+, publisher =   "??"
+, year =        "??"
+, note =        "Forthcoming book"
+, update =      "97.11 bibrelex"
 }
 
 @article{e-cedbt-85
-, author =	"H. Edelsbrunner"
-, title =	"Computing the extreme distances between two convex polygons"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	"213--224"
-, keywords =	"design of algorithms, binary search, lower bounds, distance, polygons, convex, two-dimensional"
+, author =      "H. Edelsbrunner"
+, title =       "Computing the extreme distances between two convex polygons"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "213--224"
+, keywords =    "design of algorithms, binary search, lower bounds, distance, polygons, convex, two-dimensional"
 }
 
 @techreport{e-cestd-84
-, author =	"H. Edelsbrunner"
-, title =	"Constructing edge-skeletons in three dimensions with applications to power diagrams and dissecting three-dimensional point-sets"
-, number =	"F140"
-, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "H. Edelsbrunner"
+, title =       "Constructing edge-skeletons in three dimensions with applications to power diagrams and dissecting three-dimensional point-sets"
+, number =      "F140"
+, institution = "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{e-dssd-98
-, author =	"H. Edelsbrunner"
-, title =	"Deformable smooth surface design"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"to appear"
-, update =	"98.03 agarwal"
+, author =      "H. Edelsbrunner"
+, title =       "Deformable smooth surface design"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "to appear"
+, update =      "98.03 agarwal"
 }
 
 @techreport{e-ddsoi-80
-, author =	"H. Edelsbrunner"
-, title =	"Dynamic data structures for orthogonal intersection queries"
-, type =	"Report"
-, number =	"F59"
-, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1980
-, keywords =	"data structuring, searching, intersection, dynamizing data structures, range trees, segment trees, interval trees, hyperrectangles, $d$-dimensional"
+, author =      "H. Edelsbrunner"
+, title =       "Dynamic data structures for orthogonal intersection queries"
+, type =        "Report"
+, number =      "F59"
+, institution = "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1980
+, keywords =    "data structuring, searching, intersection, dynamizing data structures, range trees, segment trees, interval trees, hyperrectangles, $d$-dimensional"
 }
 
 @article{e-esaa-86
-, author =	"H. Edelsbrunner"
-, title =	"Edge-skeletons in arrangements with applications"
-, journal =	"Algorithmica"
-, volume =	1
-, year =	1986
-, pages =	"93--109"
-, keywords =	"design of algorithms, implementing algorithms, combinatorial geometry, construction, repeated search, graph traversal, geometric transformations, planes, three-dimensional"
+, author =      "H. Edelsbrunner"
+, title =       "Edge-skeletons in arrangements with applications"
+, journal =     "Algorithmica"
+, volume =      1
+, year =        1986
+, pages =       "93--109"
+, keywords =    "design of algorithms, implementing algorithms, combinatorial geometry, construction, repeated search, graph traversal, geometric transformations, planes, three-dimensional"
 }
 
 @article{e-ftssg-85
-, author =	"H. Edelsbrunner"
-, title =	"Finding transversals for sets of simple geometric figures"
-, journal =	"Theoret. Comput. Sci."
-, volume =	35
-, year =	1985
-, pages =	"55--69"
-, keywords =	"design of algorithms, combinatorial geometry, detection, intersection, convex hull, linear programming, geometric transformations, translates, homothets"
+, author =      "H. Edelsbrunner"
+, title =       "Finding transversals for sets of simple geometric figures"
+, journal =     "Theoret. Comput. Sci."
+, volume =      35
+, year =        1985
+, pages =       "55--69"
+, keywords =    "design of algorithms, combinatorial geometry, detection, intersection, convex hull, linear programming, geometric transformations, translates, homothets"
 }
 
 @incollection{e-ga-93
-, author =	"H. Edelsbrunner"
-, title =	"Geometric algorithms"
-, chapter =	"2.9"
-, editor =	"Peter M. Gruber and J. M. Wills"
-, booktitle =	"Handbook of Convex Geometry"
-, volume =	"A"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1993
-, pages =	"699--735"
-, keywords =	"survey paper"
-, update =	"93.09 rote"
+, author =      "H. Edelsbrunner"
+, title =       "Geometric algorithms"
+, chapter =     "2.9"
+, editor =      "Peter M. Gruber and J. M. Wills"
+, booktitle =   "Handbook of Convex Geometry"
+, volume =      "A"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1993
+, pages =       "699--735"
+, keywords =    "survey paper"
+, update =      "93.09 rote"
 }
 
 @inproceedings{e-gscg-88
-, author =	"H. Edelsbrunner"
-, title =	"Geometric structures in computational geometry"
-, booktitle =	"Proc. 15th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	317
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"201--213"
-, keywords =	"arrangements"
+, author =      "H. Edelsbrunner"
+, title =       "Geometric structures in computational geometry"
+, booktitle =   "Proc. 15th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      317
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "201--213"
+, keywords =    "arrangements"
 }
 
 @article{e-gatcg-87
-, author =	"H. Edelsbrunner"
-, title =	"Geometrics and algorithmics: a tutorial in computational geometry"
-, journal =	"Bull. EATCS"
-, volume =	32
-, year =	1987
-, pages =	"118--142"
-, keywords =	"convex hull, range search, tutorial"
+, author =      "H. Edelsbrunner"
+, title =       "Geometrics and algorithmics: a tutorial in computational geometry"
+, journal =     "Bull. EATCS"
+, volume =      32
+, year =        1987
+, pages =       "118--142"
+, keywords =    "convex hull, range search, tutorial"
 }
 
 @incollection{e-gmb-98
-, author =	"H. Edelsbrunner"
-, title =	"Geometry of modeling biomolecules"
-, editor =	"P. K. Agarwal and L. E. Kavraki and M. Mason"
-, booktitle =	"Proc. Workshop Algorithmic Found. Robot."
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1998
-, note =	"to appear"
-, update =	"98.07 agarwal, 98.03 agarwal"
+, author =      "H. Edelsbrunner"
+, title =       "Geometry of modeling biomolecules"
+, editor =      "P. K. Agarwal and L. E. Kavraki and M. Mason"
+, booktitle =   "Proc. Workshop Algorithmic Found. Robot."
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1998
+, note =        "to appear"
+, update =      "98.07 agarwal, 98.03 agarwal"
 }
 
 @phdthesis{e-ipcg-82
-, author =	"H. Edelsbrunner"
-, title =	"Intersection problems in computational geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1982
-, note =	"Report F93"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "H. Edelsbrunner"
+, title =       "Intersection problems in computational geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1982
+, note =        "Report F93"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @inproceedings{e-kpkmc-84
-, author =	"H. Edelsbrunner"
-, title =	"Key-problems and key-methods in computational geometry"
-, booktitle =	"Proc. 1st Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	166
-, publisher =	"Springer-Verlag"
-, year =	1984
-, pages =	"1--13"
-, keywords =	"survey paper"
+, author =      "H. Edelsbrunner"
+, title =       "Key-problems and key-methods in computational geometry"
+, booktitle =   "Proc. 1st Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      166
+, publisher =   "Springer-Verlag"
+, year =        1984
+, pages =       "1--13"
+, keywords =    "survey paper"
 }
 
 @incollection{e-lscr-91
-, author =	"H. Edelsbrunner"
-, title =	"Lines in space: a collection of results"
-, booktitle =	"??"
-, series =	"DIMACS Series Discrete. Math. Theoret. Computer Sci."
-, volume =	6
-, year =	1991
-, pages =	"77--93"
-, keywords =	"$3$-dimensional, lines, arrangement, survey, weaving, incidence, intersection, envelope, terrain"
-, update =	"95.09 korneenko"
+, author =      "H. Edelsbrunner"
+, title =       "Lines in space: a collection of results"
+, booktitle =   "??"
+, series =      "DIMACS Series Discrete. Math. Theoret. Computer Sci."
+, volume =      6
+, year =        1991
+, pages =       "77--93"
+, keywords =    "$3$-dimensional, lines, arrangement, survey, weaving, incidence, intersection, envelope, terrain"
+, update =      "95.09 korneenko"
 }
 
 @techreport{e-mdppp-87
-, author =	"H. Edelsbrunner"
-, title =	"Minimum diameter partitioning of a planar point set in quadratic time"
-, type =	"Report"
-, number =	"UIUCDCS-R-87-1378"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1987
-, keywords =	"partition, stabbing, optimization, diameter, divide-and-conquer, worst-case analysis"
+, author =      "H. Edelsbrunner"
+, title =       "Minimum diameter partitioning of a planar point set in quadratic time"
+, type =        "Report"
+, number =      "UIUCDCS-R-87-1378"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1987
+, keywords =    "partition, stabbing, optimization, diameter, divide-and-conquer, worst-case analysis"
 }
 
 @inproceedings{e-msctg-94
-, author =	"H. Edelsbrunner"
-, title =	"Modeling with Simplicial Complexes: {Topology}, Geometry, and Algorithms"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"36--44"
-, keywords =	"solid modeling, combinatorial topology, grid generation, simplicial complexes, nerves, Voronoi cells, Delaunay simplicial complexes"
-, cites =	"as-dsdem-92, e-ubids-93, ef-msfdv-94, em-sstcd-90, es-tts-94, fku-osrpc-77, gghkk-vcem-89, g-gsh-81, lr-ipses-71, l-slfde-45, m-eat-84, pbcf-dimsc-93, r-avpps-77, ss-codmf-90, v-nadpc-07, y-stgd-90, c-mangg-91, d-slsv-34, ZZZ"
-, update =	"98.11 bibrelex, 95.09 agarwal, 94.09 jones"
+, author =      "H. Edelsbrunner"
+, title =       "Modeling with Simplicial Complexes: {Topology}, Geometry, and Algorithms"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "36--44"
+, keywords =    "solid modeling, combinatorial topology, grid generation, simplicial complexes, nerves, Voronoi cells, Delaunay simplicial complexes"
+, cites =       "as-dsdem-92, e-ubids-93, ef-msfdv-94, em-sstcd-90, es-tts-94, fku-osrpc-77, gghkk-vcem-89, g-gsh-81, lr-ipses-71, l-slfde-45, m-eat-84, pbcf-dimsc-93, r-avpps-77, ss-codmf-90, v-nadpc-07, y-stgd-90, c-mangg-91, d-slsv-34, ZZZ"
+, update =      "98.11 bibrelex, 95.09 agarwal, 94.09 jones"
 }
 
 @incollection{e-neibd-83
-, author =	"H. Edelsbrunner"
-, title =	"Neue {Entwicklungen} im {Bereich} {Datenstrukturen}"
-, editor =	"H. A. Maurer"
-, booktitle =	"{\"U}berblicke Informationsverarbeitung"
-, publisher =	"BI Wissenschaftsverlag"
-, year =	1983
-, pages =	"55--109"
-, keywords =	"survey paper"
+, author =      "H. Edelsbrunner"
+, title =       "Neue {Entwicklungen} im {Bereich} {Datenstrukturen}"
+, editor =      "H. A. Maurer"
+, booktitle =   "{\"U}berblicke Informationsverarbeitung"
+, publisher =   "BI Wissenschaftsverlag"
+, year =        1983
+, pages =       "55--109"
+, keywords =    "survey paper"
 }
 
 @techreport{e-cedbt-82
-, author =	"H. Edelsbrunner"
-, title =	"On Computing the Extreme Distance between Two Convex Polygons"
-, number =	"F96"
-, institution =	"Inst. Informationsverarb.,  Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "H. Edelsbrunner"
+, title =       "On Computing the Extreme Distance between Two Convex Polygons"
+, number =      "F96"
+, institution = "Inst. Informationsverarb.,  Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @techreport{e-oddsp-78
-, author =	"H. Edelsbrunner"
-, title =	"Optimizing the dynamization of decomposable searching problems"
-, type =	"Report"
-, number =	"F35"
-, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1978
-, keywords =	"data structuring, searching, dynamizing data structures"
+, author =      "H. Edelsbrunner"
+, title =       "Optimizing the dynamization of decomposable searching problems"
+, type =        "Report"
+, number =      "F35"
+, institution = "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1978
+, keywords =    "data structuring, searching, dynamizing data structures"
 }
 
 @article{e-pppcg-85
-, author =	"H. Edelsbrunner"
-, title =	"{P103}-{P110}: {Problems} in computational geometry and combinatorial geometry"
-, journal =	"Bull. EATCS"
-, volume =	26
-, year =	1985
-, pages =	239
-, keywords =	"problem collection"
+, author =      "H. Edelsbrunner"
+, title =       "{P103}-{P110}: {Problems} in computational geometry and combinatorial geometry"
+, journal =     "Bull. EATCS"
+, volume =      26
+, year =        1985
+, pages =       239
+, keywords =    "problem collection"
 }
 
 @inproceedings{e-p33-87
-, author =	"H. Edelsbrunner"
-, title =	"Problem $3-3$"
-, booktitle =	"The 1986/87 Computational Geometry Days at Courant-Problems and Solutions"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "H. Edelsbrunner"
+, title =       "Problem $3-3$"
+, booktitle =   "The 1986/87 Computational Geometry Days at Courant-Problems and Solutions"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{e-pp-83
-, author =	"H. Edelsbrunner"
-, title =	"Problem {P}36"
-, journal =	"Bull. EATCS"
-, volume =	21
-, month =	oct
-, year =	1983
-, pages =	195
-, update =	"97.11 bibrelex"
+, author =      "H. Edelsbrunner"
+, title =       "Problem {P}36"
+, journal =     "Bull. EATCS"
+, volume =      21
+, month =       oct
+, year =        1983
+, pages =       195
+, update =      "97.11 bibrelex"
 }
 
 @article{e-rigom-81
-, author =	"H. Edelsbrunner"
-, title =	"Reporting intersections of geometric objects by means of covering rectangles"
-, journal =	"Bull. EATCS"
-, volume =	13
-, year =	1981
-, pages =	"7--11"
-, keywords =	"combinatorial geometry, reporting, intersection, plane-sweep, space-sweep, trees, worst-case analysis, hyperrectangles"
+, author =      "H. Edelsbrunner"
+, title =       "Reporting intersections of geometric objects by means of covering rectangles"
+, journal =     "Bull. EATCS"
+, volume =      13
+, year =        1981
+, pages =       "7--11"
+, keywords =    "combinatorial geometry, reporting, intersection, plane-sweep, space-sweep, trees, worst-case analysis, hyperrectangles"
 }
 
 @inproceedings{e-srdc-98
-, author =	"Herbert Edelsbrunner"
-, title =	"Shape Reconstruction with the {D}elaunay complex"
-, booktitle =	"LATIN'98: Theoretical Informatics"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1380
-, year =	1998
-, pages =	"119--132"
-, update =	"02.03 wenger"
+, author =      "Herbert Edelsbrunner"
+, title =       "Shape Reconstruction with the {D}elaunay complex"
+, booktitle =   "LATIN'98: Theoretical Informatics"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1380
+, year =        1998
+, pages =       "119--132"
+, update =      "02.03 wenger"
 }
 
 @incollection{e-ssmss-95
-, author =	"H. Edelsbrunner"
-, title =	"Smooth surfaces for multi-scale shape representation"
-, booktitle =	"Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1026
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"391--412"
-, update =	"96.01 smid"
+, author =      "H. Edelsbrunner"
+, title =       "Smooth surfaces for multi-scale shape representation"
+, booktitle =   "Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1026
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "391--412"
+, update =      "96.01 smid"
 }
 
 @inproceedings{e-ssmss-96
-, author =	"Herbert Edelsbrunner"
-, title =	"Smooth Surfaces for Multi-Scale Shape Representation"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	25
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Herbert Edelsbrunner"
+, title =       "Smooth Surfaces for Multi-Scale Shape Representation"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       25
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{e-stdac-89
-, author =	"H. Edelsbrunner"
-, title =	"Spatial triangulations with dihedral angle conditions"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, year =	1989
-, pages =	"83--89"
-, keywords =	"mesh generation, Delaunay triangulation, non-obtuse dihedral angles, KJ-triangulations"
-, update =	"95.09 mitchell"
+, author =      "H. Edelsbrunner"
+, title =       "Spatial triangulations with dihedral angle conditions"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, year =        1989
+, pages =       "83--89"
+, keywords =    "mesh generation, Delaunay triangulation, non-obtuse dihedral angles, KJ-triangulations"
+, update =      "95.09 mitchell"
 }
 
 @article{e-cgc1-87
-, author =	"H. Edelsbrunner"
-, title =	"The computational geometry column"
-, journal =	"Bull. EATCS"
-, volume =	31
-, year =	1987
-, pages =	"111--114"
-, keywords =	"column, bibliography"
-, annote =	"Announcement of community bibliography."
+, author =      "H. Edelsbrunner"
+, title =       "The computational geometry column"
+, journal =     "Bull. EATCS"
+, volume =      31
+, year =        1987
+, pages =       "111--114"
+, keywords =    "column, bibliography"
+, annote =      "Announcement of community bibliography."
 }
 
 @article{e-cgc2-87
-, author =	"H. Edelsbrunner"
-, title =	"The computational geometry column"
-, journal =	"Bull. EATCS"
-, volume =	33
-, year =	1987
-, pages =	"23--24"
-, keywords =	"column"
-, annote =	"Geometry conferences, journals, and books."
+, author =      "H. Edelsbrunner"
+, title =       "The computational geometry column"
+, journal =     "Bull. EATCS"
+, volume =      33
+, year =        1987
+, pages =       "23--24"
+, keywords =    "column"
+, annote =      "Geometry conferences, journals, and books."
 }
 
 @article{e-cgc3-88
-, author =	"H. Edelsbrunner"
-, title =	"The computational geometry column"
-, journal =	"Bull. EATCS"
-, volume =	34
-, year =	1988
-, pages =	"32--39"
-, keywords =	"column, complexity classes"
-, annote =	"``The disease of the $log$-factor.''"
+, author =      "H. Edelsbrunner"
+, title =       "The computational geometry column"
+, journal =     "Bull. EATCS"
+, volume =      34
+, year =        1988
+, pages =       "32--39"
+, keywords =    "column, complexity classes"
+, annote =      "``The disease of the $log$-factor.''"
 }
 
 @article{e-cgc4-88
-, author =	"H. Edelsbrunner"
-, title =	"The computational geometry column"
-, journal =	"Bull. EATCS"
-, volume =	35
-, year =	1988
-, pages =	"66--68"
-, keywords =	"column"
-, annote =	"Preview of 4th Annu. ACM Sympos.; robustness and
-		 randomization."
+, author =      "H. Edelsbrunner"
+, title =       "The computational geometry column"
+, journal =     "Bull. EATCS"
+, volume =      35
+, year =        1988
+, pages =       "66--68"
+, keywords =    "column"
+, annote =      "Preview of 4th Annu. ACM Sympos.; robustness and
+                 randomization."
 }
 
 @article{e-cgc5-89
-, author =	"H. Edelsbrunner"
-, title =	"The computational geometry column"
-, journal =	"Bull. EATCS"
-, volume =	37
-, year =	1989
-, pages =	"109--116"
-, keywords =	"column, tutorial"
-, annote =	"Geometric algorithms for the classroom."
+, author =      "H. Edelsbrunner"
+, title =       "The computational geometry column"
+, journal =     "Bull. EATCS"
+, volume =      37
+, year =        1989
+, pages =       "109--116"
+, keywords =    "column, tutorial"
+, annote =      "Geometric algorithms for the classroom."
 }
 
 @article{e-cgc6-89
-, author =	"H. Edelsbrunner"
-, title =	"The computational geometry column"
-, journal =	"Bull. EATCS"
-, volume =	38
-, year =	1989
-, pages =	"74--78"
-, keywords =	"column"
-, annote =	"Orphan results: non-obtuse triangulations and stabbing
-		 planar triangles."
+, author =      "H. Edelsbrunner"
+, title =       "The computational geometry column"
+, journal =     "Bull. EATCS"
+, volume =      38
+, year =        1989
+, pages =       "74--78"
+, keywords =    "column"
+, annote =      "Orphan results: non-obtuse triangulations and stabbing
+                 planar triangles."
 }
 
 @article{e-cgc7-90
-, author =	"H. Edelsbrunner"
-, title =	"The computational geometry column"
-, journal =	"Bull. EATCS"
-, volume =	40
-, year =	1990
-, pages =	"164--167"
-, keywords =	"column"
-, annote =	"Computational geometry research in Japan."
+, author =      "H. Edelsbrunner"
+, title =       "The computational geometry column"
+, journal =     "Bull. EATCS"
+, volume =      40
+, year =        1990
+, pages =       "164--167"
+, keywords =    "column"
+, annote =      "Computational geometry research in Japan."
 }
 
 @article{e-cgc8-90
-, author =	"H. Edelsbrunner"
-, title =	"The computational geometry column"
-, journal =	"Bull. EATCS"
-, volume =	42
-, year =	1990
-, pages =	"132--134"
-, keywords =	"column"
-, annote =	"Reviews of 6th Annu. ACM Sympos. and 2nd Canad.
-		 Conf."
+, author =      "H. Edelsbrunner"
+, title =       "The computational geometry column"
+, journal =     "Bull. EATCS"
+, volume =      42
+, year =        1990
+, pages =       "132--134"
+, keywords =    "column"
+, annote =      "Reviews of 6th Annu. ACM Sympos. and 2nd Canad.
+                 Conf."
 }
 
 @inproceedings{e-ubids-93
-, author =	"H. Edelsbrunner"
-, title =	"The union of balls and its dual shape"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"218--231"
-, cites =	"ah-t1-35, a-iadbu-88, abi-cvus-88, bm-sdcs-71, c-amsc-83, clr-ia-90, d-slsv-34, de-iabns-93, d-udrdp-50, dc-cchtt-91, e-acg-87, e-was-92, efm-ias-93, eks-sspp-83, em-sstcd-90, em-tdas-92, es-itfwr-92, f-nmc-71, g-cp-67, h-uzztu-53, kb-ptacs-79, m-htcsc-67, m-eat-84, nw-iebii-92, r-avpps-77, v-nadpc-07, w-sltdd-52, w-tl-62, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "H. Edelsbrunner"
+, title =       "The union of balls and its dual shape"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "218--231"
+, cites =       "ah-t1-35, a-iadbu-88, abi-cvus-88, bm-sdcs-71, c-amsc-83, clr-ia-90, d-slsv-34, de-iabns-93, d-udrdp-50, dc-cchtt-91, e-acg-87, e-was-92, efm-ias-93, eks-sspp-83, em-sstcd-90, em-tdas-92, es-itfwr-92, f-nmc-71, g-cp-67, h-uzztu-53, kb-ptacs-79, m-htcsc-67, m-eat-84, nw-iebii-92, r-avpps-77, v-nadpc-07, w-sltdd-52, w-tl-62, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{e-ubids-95
-, author =	"H. Edelsbrunner"
-, title =	"The union of balls and its dual shape"
-, journal =	"Discrete Comput. Geom."
-, volume =	13
-, year =	1995
-, pages =	"415--440"
-, update =	"98.03 agarwal"
+, author =      "H. Edelsbrunner"
+, title =       "The union of balls and its dual shape"
+, journal =     "Discrete Comput. Geom."
+, volume =      13
+, year =        1995
+, pages =       "415--440"
+, update =      "98.03 agarwal"
 }
 
 @article{e-ueplf-89
-, author =	"H. Edelsbrunner"
-, title =	"The upper envelope of piecewise linear functions: {T}ight complexity bounds in higher dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"337--343"
-, keywords =	"upper/lower envelope, arrangement of simplices"
-, update =	"98.03 agarwal"
+, author =      "H. Edelsbrunner"
+, title =       "The upper envelope of piecewise linear functions: {T}ight complexity bounds in higher dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "337--343"
+, keywords =    "upper/lower envelope, arrangement of simplices"
+, update =      "98.03 agarwal"
 }
 
 @techreport{e-t-91
-, author =	"H. Edelsbrunner"
-, title =	"Triangulations"
-, number =	"CS497"
-, institution =	"UIUC"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "H. Edelsbrunner"
+, title =       "Triangulations"
+, number =      "CS497"
+, institution = "UIUC"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @techreport{e-was-92
-, author =	"H. Edelsbrunner"
-, title =	"Weighted alpha shapes"
-, type =	"Technical {Report}"
-, number =	"UIUCDCS-R-92-1760"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "H. Edelsbrunner"
+, title =       "Weighted alpha shapes"
+, type =        "Technical {Report}"
+, number =      "UIUCDCS-R-92-1760"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{effl-mpvp-95
-, author =	"H. Edelsbrunner and M. Facello and P. Fu and J. Liang"
-, title =	"Measuring proteins and voids in proteins"
-, booktitle =	"Proc. 28th Ann. Hawaii Internat. Conf. System Sciences"
-, series =	"Biotechnology Computing"
-, volume =	"V"
-, year =	1995
-, pages =	"256--264"
-, update =	"98.03 agarwal"
+, author =      "H. Edelsbrunner and M. Facello and P. Fu and J. Liang"
+, title =       "Measuring proteins and voids in proteins"
+, booktitle =   "Proc. 28th Ann. Hawaii Internat. Conf. System Sciences"
+, series =      "Biotechnology Computing"
+, volume =      "V"
+, year =        1995
+, pages =       "256--264"
+, update =      "98.03 agarwal"
 }
 
 @techreport{efl-dcpm-95
-, author =	"H. Edelsbrunner and M. Facello and J. Liang"
-, title =	"On the definition and the construction of pockets in macromolecules"
-, type =	"Tech.\ Report"
-, number =	"IULU-ENG-95-1736"
-, institution =	"Department of Computer Science"
-, address =	"University of Illinois at Urbana-Champaign"
-, year =	1995
-, update =	"98.03 agarwal"
+, author =      "H. Edelsbrunner and M. Facello and J. Liang"
+, title =       "On the definition and the construction of pockets in macromolecules"
+, type =        "Tech.\ Report"
+, number =      "IULU-ENG-95-1736"
+, institution = "Department of Computer Science"
+, address =     "University of Illinois at Urbana-Champaign"
+, year =        1995
+, update =      "98.03 agarwal"
 }
 
 @article{efl-dcpm-98
-, author =	"H. Edelsbrunner and M. Facello and J. Liang"
-, title =	"On the definition and the construction of pockets in macromolecules"
-, journal =	"Discrete Appl. Math."
-, volume =	88
-, year =	1998
-, pages =	"83--102"
-, update =	"00.03 smid"
+, author =      "H. Edelsbrunner and M. Facello and J. Liang"
+, title =       "On the definition and the construction of pockets in macromolecules"
+, journal =     "Discrete Appl. Math."
+, volume =      88
+, year =        1998
+, pages =       "83--102"
+, update =      "00.03 smid"
 }
 
 @techreport{ef-msfdv-94
-, author =	"H. Edelsbrunner and P. Fu"
-, title =	"Measuring space filling diagrams and voids"
-, type =	"Report"
-, number =	"UIUC-BI-MB-94-01"
-, institution =	"Beckman Institute, Univ. Illinois"
-, address =	"Urbana"
-, year =	1994
-, update =	"98.11 bibrelex"
+, author =      "H. Edelsbrunner and P. Fu"
+, title =       "Measuring space filling diagrams and voids"
+, type =        "Report"
+, number =      "UIUC-BI-MB-94-01"
+, institution = "Beckman Institute, Univ. Illinois"
+, address =     "Urbana"
+, year =        1994
+, update =      "98.11 bibrelex"
 }
 
 @misc{efm-ias-93
-, author =	"H. Edelsbrunner and P. Fu and E. P. M{\"u}cke"
-, title =	"An introduction to alpha shapes"
-, year =	1993
-, note =	"In preparation"
-, update =	"98.03 bibrelex"
+, author =      "H. Edelsbrunner and P. Fu and E. P. M{\"u}cke"
+, title =       "An introduction to alpha shapes"
+, year =        1993
+, note =        "In preparation"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{eg-tsa-86
-, author =	"H. Edelsbrunner and Leonidas J. Guibas"
-, title =	"Topologically sweeping an arrangement"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"389--403"
-, keywords =	"design of algorithms, combinatorial geometry, plane-sweep, dynamic programming, amortized analysis, arrangements, two-dimensional, $d$-dimensional"
-, precedes =	"eg-tsa-89"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas"
+, title =       "Topologically sweeping an arrangement"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "389--403"
+, keywords =    "design of algorithms, combinatorial geometry, plane-sweep, dynamic programming, amortized analysis, arrangements, two-dimensional, $d$-dimensional"
+, precedes =    "eg-tsa-89"
+, update =      "98.03 mitchell"
 }
 
 @article{eg-tsa-89
-, author =	"H. Edelsbrunner and Leonidas J. Guibas"
-, title =	"Topologically sweeping an arrangement"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	38
-, year =	1989
-, pages =	"165--194"
-, note =	"Corrigendum in 42 (1991), 249--251"
-, keywords =	"design of algorithms, combinatorial geometry, plane-sweep, dynamic programming, amortized analysis, arrangements, two-dimensional, $d$-dimensional"
-, succeeds =	"eg-tsa-86"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas"
+, title =       "Topologically sweeping an arrangement"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      38
+, year =        1989
+, pages =       "165--194"
+, note =        "Corrigendum in 42 (1991), 249--251"
+, keywords =    "design of algorithms, combinatorial geometry, plane-sweep, dynamic programming, amortized analysis, arrangements, two-dimensional, $d$-dimensional"
+, succeeds =    "eg-tsa-86"
+, update =      "98.03 mitchell"
 }
 
 @article{eghppsss-ajati-89
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and J. Pach and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
-, title =	"Arrangements of {Jordan} arcs with three intersections per pair"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"523--539"
-, succeeds =	"eghppsss-ajati-88"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and J. Pach and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
+, title =       "Arrangements of {Jordan} arcs with three intersections per pair"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "523--539"
+, succeeds =    "eghppsss-ajati-88"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{eghppsss-ajati-88
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and J. Pach and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
-, title =	"On arrangements of {Jordan} arcs with three intersections per pair"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"258--265"
-, precedes =	"eghppsss-ajati-89"
-, cites =	"a-dcg-83, e-acg-87, gss-gmppt-88, hs-ndssg-86, klps-ujrcf-86, m-ati-77, pss-stsps-86, s-alubl-87, s-at-66, s-irs-81, ws-prnds-88, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and J. Pach and R. Pollack and R. Seidel and Micha Sharir and J. Snoeyink"
+, title =       "On arrangements of {Jordan} arcs with three intersections per pair"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "258--265"
+, precedes =    "eghppsss-ajati-89"
+, cites =       "a-dcg-83, e-acg-87, gss-gmppt-88, hs-ndssg-86, klps-ujrcf-86, m-ati-77, pss-stsps-86, s-alubl-87, s-at-66, s-irs-81, ws-prnds-88, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @inproceedings{eghsssw-irals-88
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and R. Seidel and Micha Sharir and J. Snoeyink and Emo Welzl"
-, title =	"Implicitly representing arrangements of lines or segments"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"56--69"
-, precedes =	"eghsssw-irals-89"
-, cites =	"as-tsbac-87, bo-arcgi-79, b-gtfga-80, ce-falsi-87, cg-vippg-85, cg-fc2a-86, cgl-pgd-85, c-narsc-87, e-acg-87, egppss-acptc-88, egs-oplms-86, egs-cmfal-88, eos-calha-86, ew-hrsls-86, gh-ospqs-87, ghs-btdsc-88, gos-ilsrs-88, hw-ensrq-87, k-osps-83, klps-ujrcf-86, k-ss-73, ol-mcp-81, ps-cgi-85, sh-gip-76, st-pplup-86, w-pttco-88, w-pr-82, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and R. Seidel and Micha Sharir and J. Snoeyink and Emo Welzl"
+, title =       "Implicitly representing arrangements of lines or segments"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "56--69"
+, precedes =    "eghsssw-irals-89"
+, cites =       "as-tsbac-87, bo-arcgi-79, b-gtfga-80, ce-falsi-87, cg-vippg-85, cg-fc2a-86, cgl-pgd-85, c-narsc-87, e-acg-87, egppss-acptc-88, egs-oplms-86, egs-cmfal-88, eos-calha-86, ew-hrsls-86, gh-ospqs-87, ghs-btdsc-88, gos-ilsrs-88, hw-ensrq-87, k-osps-83, klps-ujrcf-86, k-ss-73, ol-mcp-81, ps-cgi-85, sh-gip-76, st-pplup-86, w-pttco-88, w-pr-82, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{eghsssw-irals-89
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and R. Seidel and Micha Sharir and J. Snoeyink and Emo Welzl"
-, title =	"Implicitly representing arrangements of lines or segments"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"433--466"
-, succeeds =	"eghsssw-irals-88"
-, update =	"98.03 mitchell, 94.01 rote"
-, annote =	"the bridge tree data structure used in this paper is replaced
-		 by an improved data structure of ghs-citds-91"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and J. Hershberger and R. Seidel and Micha Sharir and J. Snoeyink and Emo Welzl"
+, title =       "Implicitly representing arrangements of lines or segments"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "433--466"
+, succeeds =    "eghsssw-irals-88"
+, update =      "98.03 mitchell, 94.01 rote"
+, annote =      "the bridge tree data structure used in this paper is replaced
+                 by an improved data structure of ghs-citds-91"
 }
 
 @inproceedings{egppss-acptc-88
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Pach and R. Pollack and R. Seidel and Micha Sharir"
-, title =	"Arrangements of curves in the plane: {Topology}, combinatorics, and algorithms"
-, booktitle =	"Proc. 15th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	317
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"214--229"
-, keywords =	"combinatorial geometry, construction, incrementation, arrangements, curves, two-dimensional"
-, precedes =	"egppss-acptc-92"
-, update =	"98.03 mitchell, 95.09 agarwal"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and J. Pach and R. Pollack and R. Seidel and Micha Sharir"
+, title =       "Arrangements of curves in the plane: {Topology}, combinatorics, and algorithms"
+, booktitle =   "Proc. 15th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      317
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "214--229"
+, keywords =    "combinatorial geometry, construction, incrementation, arrangements, curves, two-dimensional"
+, precedes =    "egppss-acptc-92"
+, update =      "98.03 mitchell, 95.09 agarwal"
 }
 
 @article{egppss-acptc-92
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Pach and R. Pollack and R. Seidel and Micha Sharir"
-, title =	"Arrangements of curves in the plane: {Topology}, combinatorics, and algorithms"
-, journal =	"Theoret. Comput. Sci."
-, volume =	92
-, year =	1992
-, pages =	"319--336"
-, keywords =	"combinatorial geometry, construction, incrementation, arrangements, curves, two-dimensional"
-, succeeds =	"egppss-acptc-88"
-, update =	"98.03 mitchell, 95.09 agarwal"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and J. Pach and R. Pollack and R. Seidel and Micha Sharir"
+, title =       "Arrangements of curves in the plane: {Topology}, combinatorics, and algorithms"
+, journal =     "Theoret. Comput. Sci."
+, volume =      92
+, year =        1992
+, pages =       "319--336"
+, keywords =    "combinatorial geometry, construction, incrementation, arrangements, curves, two-dimensional"
+, succeeds =    "egppss-acptc-88"
+, update =      "98.03 mitchell, 95.09 agarwal"
 }
 
 @article{egs-ccmfa-90
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"The complexity and construction of many faces in arrangements of lines and of segments"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"161--196"
-, succeeds =	"egs-cmfal-88"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "The complexity and construction of many faces in arrangements of lines and of segments"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "161--196"
+, succeeds =    "egs-cmfal-88"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{egs-cmcap-88
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"The complexity of many cells in arrangements of planes and related problems"
-, booktitle =	"Proc. Int. Conf. Mathematical Prog."
-, site =	"Tokyo, Japan"
-, year =	1988
-, pages =	147
-, update =	"98.03 mitchell, 94.05 sharir"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "The complexity of many cells in arrangements of planes and related problems"
+, booktitle =   "Proc. Int. Conf. Mathematical Prog."
+, site =        "Tokyo, Japan"
+, year =        1988
+, pages =       147
+, update =      "98.03 mitchell, 94.05 sharir"
 }
 
 @article{egs-cmcap-90
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"The complexity of many cells in arrangements of planes and related problems"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"197--216"
-, keywords =	"arrangements, complexity of faces, divide-and-conquer"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "The complexity of many cells in arrangements of planes and related problems"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "197--216"
+, keywords =    "arrangements, complexity of faces, divide-and-conquer"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{egs-cmfal-88
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"The complexity of many faces in arrangements of lines and of segments"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"44--55"
-, precedes =	"egs-ccmfa-90"
-, cites =	"c-talp-69, cd-icott-87, c-narsc-87, cegsw-ccbac-88t, csy-khrp-87, e-acg-87, egs-cmcap-88, es-mnwsn-90, ew-mnemf-86, ew-hrsls-86, g-cp-67, gos-rsipl-89, gss-gmppt-88, hs-ndssg-86, hw-ensrq-87, o-spc-86, pss-stsps-88, ps-cgi-85, sml-rtatp-88, st-epdg-83, ws-prnds-88, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "The complexity of many faces in arrangements of lines and of segments"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "44--55"
+, precedes =    "egs-ccmfa-90"
+, cites =       "c-talp-69, cd-icott-87, c-narsc-87, cegsw-ccbac-88t, csy-khrp-87, e-acg-87, egs-cmcap-88, es-mnwsn-90, ew-mnemf-86, ew-hrsls-86, g-cp-67, gos-rsipl-89, gss-gmppt-88, hs-ndssg-86, hw-ensrq-87, o-spc-86, pss-stsps-88, ps-cgi-85, sml-rtatp-88, st-epdg-83, ws-prnds-88, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @techreport{egs-ueplf-87
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications"
-, type =	"Technical {Report}"
-, number =	"UIUCDCDS-R-87-1390"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, month =	nov
-, year =	1987
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications"
+, type =        "Technical {Report}"
+, number =      "UIUCDCDS-R-87-1390"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, month =       nov
+, year =        1987
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{egs-ueplf-89
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
-, title =	"The upper envelope of piecewise linear functions: algorithms and applications"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"311--336"
-, keywords =	"upper/lower envelope, arrangement of simplices"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and Micha Sharir"
+, title =       "The upper envelope of piecewise linear functions: algorithms and applications"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "311--336"
+, keywords =    "upper/lower envelope, arrangement of simplices"
+, update =      "98.03 mitchell"
 }
 
 @article{egs-oplms-86
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Stolfi"
-, title =	"Optimal point location in a monotone subdivision"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, number =	2
-, year =	1986
-, pages =	"317--340"
-, keywords =	"data structuring, searching, point location, binary search, directed acyclic graphs, subdivisions, two-dimensional"
-, update =	"98.07 tamassia, 98.03 mitchell"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and J. Stolfi"
+, title =       "Optimal point location in a monotone subdivision"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, number =      2
+, year =        1986
+, pages =       "317--340"
+, keywords =    "data structuring, searching, point location, binary search, directed acyclic graphs, subdivisions, two-dimensional"
+, update =      "98.07 tamassia, 98.03 mitchell"
 }
 
 @techreport{egs-oplms-84
-, author =	"H. Edelsbrunner and Leonidas J. Guibas and J. Stolfi"
-, title =	"Optimal point location in monotone subdivisions"
-, type =	"Technical {Report}"
-, number =	2
-, institution =	"DEC/SRC"
-, year =	1984
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "H. Edelsbrunner and Leonidas J. Guibas and J. Stolfi"
+, title =       "Optimal point location in monotone subdivisions"
+, type =        "Technical {Report}"
+, number =      2
+, institution = "DEC/SRC"
+, year =        1984
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{eh-lbnud-88
-, author =	"H. Edelsbrunner and P. Hajnal"
-, title =	"A lower bound on the number of unit distances between the vertices of a convex polygon"
-, type =	"Report"
-, number =	"UIUCDCS-R-88-1412"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1988
+, author =      "H. Edelsbrunner and P. Hajnal"
+, title =       "A lower bound on the number of unit distances between the vertices of a convex polygon"
+, type =        "Report"
+, number =      "UIUCDCS-R-88-1412"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1988
 }
 
 @article{eh-lbnud-91
-, author =	"H. Edelsbrunner and P. Hajnal"
-, title =	"A lower bound on the number of unit distances between the vertices of a convex polygon"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	56
-, year =	1991
-, pages =	"312--316"
-, update =	"98.03 agarwal"
+, author =      "H. Edelsbrunner and P. Hajnal"
+, title =       "A lower bound on the number of unit distances between the vertices of a convex polygon"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      56
+, year =        1991
+, pages =       "312--316"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{ehz-hmcpl-01
-, author =	"Herbert Edelsbrunner and John Harer and Alfra Zomorodian"
-, title =	"Hierarchical {M}orse Complexes for Piecewise Linear 2-Manifolds"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
-, year =	2001
-, pages =	"70--79"
-, update =	"02.03 wenger"
+, author =      "Herbert Edelsbrunner and John Harer and Alfra Zomorodian"
+, title =       "Hierarchical {M}orse Complexes for Piecewise Linear 2-Manifolds"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Comput. Geom."
+, year =        2001
+, pages =       "70--79"
+, update =      "02.03 wenger"
 }
 
 @article{ehh-rpldd-86
-, author =	"H. Edelsbrunner and G. Haring and D. Hilbert"
-, title =	"Rectangular point location in $d$ dimensions with applications"
-, journal =	"Comput. J."
-, volume =	29
-, year =	1986
-, pages =	"76--82"
-, keywords =	"data structuring, searching, point location, interval trees, hyperrectangles, $d$-dimensional"
+, author =      "H. Edelsbrunner and G. Haring and D. Hilbert"
+, title =       "Rectangular point location in $d$ dimensions with applications"
+, journal =     "Comput. J."
+, volume =      29
+, year =        1986
+, pages =       "76--82"
+, keywords =    "data structuring, searching, point location, interval trees, hyperrectangles, $d$-dimensional"
 }
 
 @techreport{ehs-cttpt-88
-, author =	"H. Edelsbrunner and N. Hasan and X. J. Shen"
-, title =	"Circles through two points that always enclose many points"
-, type =	"Report"
-, number =	"UIUCDCS-R-88-1400"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1988
+, author =      "H. Edelsbrunner and N. Hasan and X. J. Shen"
+, title =       "Circles through two points that always enclose many points"
+, type =        "Report"
+, number =      "UIUCDCS-R-88-1400"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1988
 }
 
 @article{eh-cctda-86
-, author =	"H. Edelsbrunner and D. Haussler"
-, title =	"The complexity of cells in three-dimensional arrangements"
-, journal =	"Discrete Math."
-, volume =	60
-, year =	1986
-, pages =	"139--146"
-, keywords =	"combinatorial geometry, $3$-dimensional, lines, arrangement"
-, update =	"95.09 korneenko"
+, author =      "H. Edelsbrunner and D. Haussler"
+, title =       "The complexity of cells in three-dimensional arrangements"
+, journal =     "Discrete Math."
+, volume =      60
+, year =        1986
+, pages =       "139--146"
+, keywords =    "combinatorial geometry, $3$-dimensional, lines, arrangement"
+, update =      "95.09 korneenko"
 }
 
 @techreport{eh-dsptt-84
-, author =	"H. Edelsbrunner and F. Huber"
-, title =	"Dissecting sets of points in two and three dimensions"
-, type =	"Report"
-, number =	"F138"
-, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1984
-, keywords =	"data structuring, discrete geometry, range search, trees, partition, cell complexes, two-dimensional, three-dimensional"
+, author =      "H. Edelsbrunner and F. Huber"
+, title =       "Dissecting sets of points in two and three dimensions"
+, type =        "Report"
+, number =      "F138"
+, institution = "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1984
+, keywords =    "data structuring, discrete geometry, range search, trees, partition, cell complexes, two-dimensional, three-dimensional"
 }
 
 @techreport{ej-hocys-86
-, author =	"H. Edelsbrunner and J. W. Jaromczyk"
-, title =	"How often can you see yourself in a convex configuration of mirrors?"
-, type =	"Report"
-, number =	"UIUCDCS-R-86-1256"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1986
+, author =      "H. Edelsbrunner and J. W. Jaromczyk"
+, title =       "How often can you see yourself in a convex configuration of mirrors?"
+, type =        "Report"
+, number =      "UIUCDCS-R-86-1256"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1986
 }
 
 @inproceedings{ejps-pcoas-91
-, author =	"H. Edelsbrunner and J. W. Jaromczyk and J. W. Penny and G. {\'S}wi{\c a}tek"
-, title =	"Primal canoes: optimal arrangements of segments"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"224--227"
-, cites =	"e-acg-87, ejs-ccidw-89, elss-dgpps-73, emprww-sls-82, es-mnwsn-90, ew-nlsfs-85, js-rfccg-91, klz-gpcs-85, pss-ubnpk-89, ZZZ"
-, update =	"98.11 aronov, 98.07 bibrelex"
+, author =      "H. Edelsbrunner and J. W. Jaromczyk and J. W. Penny and G. {\'S}wi{\c a}tek"
+, title =       "Primal canoes: optimal arrangements of segments"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "224--227"
+, cites =       "e-acg-87, ejs-ccidw-89, elss-dgpps-73, emprww-sls-82, es-mnwsn-90, ew-nlsfs-85, js-rfccg-91, klz-gpcs-85, pss-ubnpk-89, ZZZ"
+, update =      "98.11 aronov, 98.07 bibrelex"
 }
 
 @misc{ejs-ccidw-89
-, author =	"H. Edelsbrunner and J. W. Jaromczyk and G. {\'S}wi{\c a}tek"
-, title =	"The complexity of the common intersection of $n$ double wedges"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "H. Edelsbrunner and J. W. Jaromczyk and G. {\'S}wi{\c a}tek"
+, title =       "The complexity of the common intersection of $n$ double wedges"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @article{ekm-pis-82
-, author =	"H. Edelsbrunner and D. G. Kirkpatrick and H. A. Maurer"
-, title =	"Polygonal intersection searching"
-, journal =	"Inform. Process. Lett."
-, volume =	14
-, year =	1982
-, pages =	"74--79"
-, keywords =	"data structuring, reporting, intersection, range search, geometric transformations, points, line segments, polygons"
+, author =      "H. Edelsbrunner and D. G. Kirkpatrick and H. A. Maurer"
+, title =       "Polygonal intersection searching"
+, journal =     "Inform. Process. Lett."
+, volume =      14
+, year =        1982
+, pages =       "74--79"
+, keywords =    "data structuring, reporting, intersection, range search, geometric transformations, points, line segments, polygons"
 }
 
 @article{eks-sspp-83
-, author =	"H. Edelsbrunner and D. G. Kirkpatrick and R. Seidel"
-, title =	"On the shape of a set of points in the plane"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	"IT-29"
-, year =	1983
-, pages =	"551--559"
-, keywords =	"design of algorithms, discrete geometry, construction, interval trees, subdivisions, Voronoi diagrams, shape, disks"
+, author =      "H. Edelsbrunner and D. G. Kirkpatrick and R. Seidel"
+, title =       "On the shape of a set of points in the plane"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      "IT-29"
+, year =        1983
+, pages =       "551--559"
+, keywords =    "design of algorithms, discrete geometry, construction, interval trees, subdivisions, Voronoi diagrams, shape, disks"
 }
 
 @techreport{el-mdsab-83
-, author =	"H. Edelsbrunner and J. van Leeuwen"
-, title =	"Multidimensional data structures and algorithms: a bibliography"
-, type =	"Report"
-, number =	"F104"
-, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1983
-, keywords =	"bibliography"
+, author =      "H. Edelsbrunner and J. van Leeuwen"
+, title =       "Multidimensional data structures and algorithms: a bibliography"
+, type =        "Report"
+, number =      "F104"
+, institution = "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1983
+, keywords =    "bibliography"
 }
 
 @article{elow-cccsr-84
-, author =	"H. Edelsbrunner and J. van Leeuwen and T. Ottmann and D. Wood"
-, title =	"Computing the connected components of simple rectilinear geometrical objects in $d$-space"
-, journal =	"RAIRO Inform. Theor."
-, volume =	18
-, year =	1984
-, pages =	"171--183"
-, keywords =	"design of algorithms, construction, plane-sweep, priority search trees, worst-case analysis, rectangles, hyperrectangles, connected, two-dimensional, $d$-dimensional"
+, author =      "H. Edelsbrunner and J. van Leeuwen and T. Ottmann and D. Wood"
+, title =       "Computing the connected components of simple rectilinear geometrical objects in $d$-space"
+, journal =     "RAIRO Inform. Theor."
+, volume =      18
+, year =        1984
+, pages =       "171--183"
+, keywords =    "design of algorithms, construction, plane-sweep, priority search trees, worst-case analysis, rectangles, hyperrectangles, connected, two-dimensional, $d$-dimensional"
 }
 
 @inproceedings{elz-tps-00
-, author =	"Herbert Edelsbrunner and D. Letscher and Alfra Zomorodian"
-, title =	"Topological Persistence and Simplification"
-, booktitle =	"Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	2000
-, pages =	"454--463"
-, update =	"02.03 wenger"
+, author =      "Herbert Edelsbrunner and D. Letscher and Alfra Zomorodian"
+, title =       "Topological Persistence and Simplification"
+, booktitle =   "Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        2000
+, pages =       "454--463"
+, update =      "02.03 wenger"
 }
 
 @article{em-sosgr-81
-, author =	"H. Edelsbrunner and H. A. Maurer"
-, title =	"A space-optimal solution of general region location"
-, journal =	"Theoret. Comput. Sci."
-, volume =	16
-, year =	1981
-, pages =	"329--336"
-, keywords =	"data structuring, searching, point location, interval trees"
+, author =      "H. Edelsbrunner and H. A. Maurer"
+, title =       "A space-optimal solution of general region location"
+, journal =     "Theoret. Comput. Sci."
+, volume =      16
+, year =        1981
+, pages =       "329--336"
+, keywords =    "data structuring, searching, point location, interval trees"
 }
 
 @article{em-feptd-85
-, author =	"H. Edelsbrunner and H. A. Maurer"
-, title =	"Finding extreme points in three dimensions and solving the post-office problem in the plane"
-, journal =	"Inform. Process. Lett."
-, volume =	21
-, year =	1985
-, pages =	"39--47"
-, keywords =	"data structuring, searching, point location, convex hull, geometric transformations, directed acyclic graphs, polytopes, convex, three-dimensional"
+, author =      "H. Edelsbrunner and H. A. Maurer"
+, title =       "Finding extreme points in three dimensions and solving the post-office problem in the plane"
+, journal =     "Inform. Process. Lett."
+, volume =      21
+, year =        1985
+, pages =       "39--47"
+, keywords =    "data structuring, searching, point location, convex hull, geometric transformations, directed acyclic graphs, polytopes, convex, three-dimensional"
 }
 
 @article{em-ioo-81
-, author =	"H. Edelsbrunner and H. A. Maurer"
-, title =	"On the intersection of orthogonal objects"
-, journal =	"Inform. Process. Lett."
-, volume =	13
-, year =	1981
-, pages =	"177--181"
-, keywords =	"data structuring, searching, intersection, range trees, segment trees, interval trees, hyperrectangles, $d$-dimensional"
+, author =      "H. Edelsbrunner and H. A. Maurer"
+, title =       "On the intersection of orthogonal objects"
+, journal =     "Inform. Process. Lett."
+, volume =      13
+, year =        1981
+, pages =       "177--181"
+, keywords =    "data structuring, searching, intersection, range trees, segment trees, interval trees, hyperrectangles, $d$-dimensional"
 }
 
 @article{emprww-sls-82
-, author =	"H. Edelsbrunner and H. A. Maurer and F. P. Preparata and A. L. Rosenberg and Emo Welzl and D. Wood"
-, title =	"Stabbing line segments"
-, journal =	"BIT"
-, volume =	22
-, year =	1982
-, pages =	"274--281"
-, keywords =	"design of algorithms, combinatorial geometry, construction, intersection, plane-sweep, divide-and-conquer, geometric transformations, line segments, two-dimensional, worst-case analysis"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and H. A. Maurer and F. P. Preparata and A. L. Rosenberg and Emo Welzl and D. Wood"
+, title =       "Stabbing line segments"
+, journal =     "BIT"
+, volume =      22
+, year =        1982
+, pages =       "274--281"
+, keywords =    "design of algorithms, combinatorial geometry, construction, intersection, plane-sweep, divide-and-conquer, geometric transformations, line segments, two-dimensional, worst-case analysis"
+, update =      "98.03 mitchell"
 }
 
 @techreport{em-sstcd-87
-, author =	"H. Edelsbrunner and E. P. M{\"u}cke"
-, title =	"Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms"
-, type =	"Technical {Report}"
-, number =	"UIUCDCD-R-87-1393"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana-Champaign, IL"
-, month =	dec
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "H. Edelsbrunner and E. P. M{\"u}cke"
+, title =       "Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms"
+, type =        "Technical {Report}"
+, number =      "UIUCDCD-R-87-1393"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana-Champaign, IL"
+, month =       dec
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{em-sstcd-88
-, author =	"H. Edelsbrunner and E. P. M{\"u}cke"
-, title =	"Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"118--133"
-, precedes =	"em-sstcd-90"
-, cites =	"ahu-daca-74, ai-grvd-86, c-odlp-52, c-lp-83, ck-flcs-80, d-lpe-63, dow-gsmml-55, e-esaa-86, e-acg-87, eg-tsa-86, ew-chsct-86, f-cgpractice-85, gp-ms-83, gs-pmgsc-85, gl-mc-83, k-sa-69, m-emzed-85, ph-chfsp-77, ps-cgi-85, s-chaop-81, s-scpvd-82, s-chdch-86, y-stgd-87, y-gctsp-88, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "H. Edelsbrunner and E. P. M{\"u}cke"
+, title =       "Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "118--133"
+, precedes =    "em-sstcd-90"
+, cites =       "ahu-daca-74, ai-grvd-86, c-odlp-52, c-lp-83, ck-flcs-80, d-lpe-63, dow-gsmml-55, e-esaa-86, e-acg-87, eg-tsa-86, ew-chsct-86, f-cgpractice-85, gp-ms-83, gs-pmgsc-85, gl-mc-83, k-sa-69, m-emzed-85, ph-chfsp-77, ps-cgi-85, s-chaop-81, s-scpvd-82, s-chdch-86, y-stgd-87, y-gctsp-88, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{em-sstcd-90
-, author =	"H. Edelsbrunner and E. P. M{\"u}cke"
-, title =	"Simulation of simplicity: {A} technique to cope with degenerate cases in geometric algorithms"
-, journal =	"ACM Trans. Graph."
-, volume =	9
-, number =	1
-, year =	1990
-, pages =	"66--104"
-, succeeds =	"em-sstcd-88"
-, update =	"98.07 agarwal+tamassia"
+, author =      "H. Edelsbrunner and E. P. M{\"u}cke"
+, title =       "Simulation of simplicity: {A} technique to cope with degenerate cases in geometric algorithms"
+, journal =     "ACM Trans. Graph."
+, volume =      9
+, number =      1
+, year =        1990
+, pages =       "66--104"
+, succeeds =    "em-sstcd-88"
+, update =      "98.07 agarwal+tamassia"
 }
 
 @techreport{em-tdas-92
-, author =	"H. Edelsbrunner and E. P. M{\"u}cke"
-, title =	"Three-dimensional alpha shapes"
-, type =	"Manuscript"
-, number =	"UIUCDCS-R-92-1734"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana-Champaign, IL"
-, year =	1992
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "H. Edelsbrunner and E. P. M{\"u}cke"
+, title =       "Three-dimensional alpha shapes"
+, type =        "Manuscript"
+, number =      "UIUCDCS-R-92-1734"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana-Champaign, IL"
+, year =        1992
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{em-tdas-94
-, author =	"H. Edelsbrunner and E. P. M{\"u}cke"
-, title =	"Three-dimensional Alpha Shapes"
-, journal =	"ACM Trans. Graph."
-, volume =	13
-, number =	1
-, month =	jan
-, year =	1994
-, pages =	"43--72"
-, comments =	"Software in \url{ftp://cs.uiuc.edu/pub/edels/geometry/alpha-2.1a.tar.Z}"
-, update =	"94.09 orourke"
+, author =      "H. Edelsbrunner and E. P. M{\"u}cke"
+, title =       "Three-dimensional Alpha Shapes"
+, journal =     "ACM Trans. Graph."
+, volume =      13
+, number =      1
+, month =       jan
+, year =        1994
+, pages =       "43--72"
+, comments =    "Software in \url{ftp://cs.uiuc.edu/pub/edels/geometry/alpha-2.1a.tar.Z}"
+, update =      "94.09 orourke"
 }
 
 @techreport{eos-calha-83t
-, author =	"H. Edelsbrunner and J. O'Rourke and R. Seidel"
-, title =	"Constructing arrangements of lines and hyperplanes with applications"
-, type =	"Report"
-, number =	"F123"
-, institution =	"Inst. Informationsverarb., Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "H. Edelsbrunner and J. O'Rourke and R. Seidel"
+, title =       "Constructing arrangements of lines and hyperplanes with applications"
+, type =        "Report"
+, number =      "F123"
+, institution = "Inst. Informationsverarb., Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{eos-calha-83
-, author =	"H. Edelsbrunner and J. O'Rourke and R. Seidel"
-, title =	"Constructing arrangements of lines and hyperplanes with applications"
-, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1983
-, pages =	"83--91"
-, precedes =	"eos-calha-86"
-, update =	"97.11 bibrelex"
+, author =      "H. Edelsbrunner and J. O'Rourke and R. Seidel"
+, title =       "Constructing arrangements of lines and hyperplanes with applications"
+, booktitle =   "Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1983
+, pages =       "83--91"
+, precedes =    "eos-calha-86"
+, update =      "97.11 bibrelex"
 }
 
 @article{eos-calha-86
-, author =	"H. Edelsbrunner and J. O'Rourke and R. Seidel"
-, title =	"Constructing arrangements of lines and hyperplanes with applications"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"341--363"
-, keywords =	"design of algorithms, combinatorial geometry, construction, incrementation, geometric transformations, incidence graph, arrangements, $d$-dimensional"
-, comments =	"buggy proof fixed in \cite{ess-ztha-91}"
-, succeeds =	"eos-calha-83"
+, author =      "H. Edelsbrunner and J. O'Rourke and R. Seidel"
+, title =       "Constructing arrangements of lines and hyperplanes with applications"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "341--363"
+, keywords =    "design of algorithms, combinatorial geometry, construction, incrementation, geometric transformations, incidence graph, arrangements, $d$-dimensional"
+, comments =    "buggy proof fixed in \cite{ess-ztha-91}"
+, succeeds =    "eos-calha-83"
 }
 
 @article{eow-sgrag-84
-, author =	"H. Edelsbrunner and J. O'Rourke and Emo Welzl"
-, title =	"Stationing guards in rectilinear art galleries"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	27
-, year =	1984
-, pages =	"167--176"
-, keywords =	"design of algorithms, construction, decomposition, visibility, subdivisions, polygons, $c$-oriented, two-dimensional"
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "H. Edelsbrunner and J. O'Rourke and Emo Welzl"
+, title =       "Stationing guards in rectilinear art galleries"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      27
+, year =        1984
+, pages =       "167--176"
+, keywords =    "design of algorithms, construction, decomposition, visibility, subdivisions, polygons, $c$-oriented, two-dimensional"
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @article{eo-bdsds-85
-, author =	"H. Edelsbrunner and M. H. Overmars"
-, title =	"Batched dynamic solutions to decomposable searching problems"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	"515--542"
-, keywords =	"design of algorithms, construction, reporting, divide-and-conquer, range trees, segment trees, $d$-dimensional"
+, author =      "H. Edelsbrunner and M. H. Overmars"
+, title =       "Batched dynamic solutions to decomposable searching problems"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "515--542"
+, keywords =    "design of algorithms, construction, reporting, divide-and-conquer, range trees, segment trees, $d$-dimensional"
 }
 
 @article{eo-esrp-82
-, author =	"H. Edelsbrunner and M. H. Overmars"
-, title =	"On the equivalence of some rectangle problems"
-, journal =	"Inform. Process. Lett."
-, volume =	14
-, year =	1982
-, pages =	"124--127"
-, keywords =	"reporting, counting, range search, geometric transformations, lower bounds, intervals, one-dimensional, two-dimensional"
+, author =      "H. Edelsbrunner and M. H. Overmars"
+, title =       "On the equivalence of some rectangle problems"
+, journal =     "Inform. Process. Lett."
+, volume =      14
+, year =        1982
+, pages =       "124--127"
+, keywords =    "reporting, counting, range search, geometric transformations, lower bounds, intervals, one-dimensional, two-dimensional"
 }
 
 @article{eo-zrrd-87
-, author =	"H. Edelsbrunner and M. H. Overmars"
-, title =	"Zooming by repeated range detection"
-, journal =	"Inform. Process. Lett."
-, volume =	24
-, year =	1987
-, pages =	"413--417"
-, keywords =	"data structuring, computer graphics, reporting, range search, repeated search, trees, line segments, rectangles, two-dimensional"
+, author =      "H. Edelsbrunner and M. H. Overmars"
+, title =       "Zooming by repeated range detection"
+, journal =     "Inform. Process. Lett."
+, volume =      24
+, year =        1987
+, pages =       "413--417"
+, keywords =    "data structuring, computer graphics, reporting, range search, repeated search, trees, line segments, rectangles, two-dimensional"
 }
 
 @techreport{eos-smcga-84t
-, author =	"H. Edelsbrunner and M. H. Overmars and R. Seidel"
-, title =	"Some methods of computational geometry applied to computer graphics"
-, type =	"report"
-, number =	"F-117"
-, institution =	"Technical University of Graz"
-, month =	jun
-, year =	1983
-, precedes =	"eos-smcga-84a"
-, update =	"98.07 bibrelex"
+, author =      "H. Edelsbrunner and M. H. Overmars and R. Seidel"
+, title =       "Some methods of computational geometry applied to computer graphics"
+, type =        "report"
+, number =      "F-117"
+, institution = "Technical University of Graz"
+, month =       jun
+, year =        1983
+, precedes =    "eos-smcga-84a"
+, update =      "98.07 bibrelex"
 }
 
 @article{eos-smcga-84a
-, author =	"H. Edelsbrunner and M. H. Overmars and R. Seidel"
-, title =	"Some methods of computational geometry applied to computer graphics"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	28
-, year =	1984
-, pages =	"92--108"
-, keywords =	"data structuring, computer graphics, construction, searching, point location, range search, trees, subdivisions, two-dimensional"
-, succeeds =	"eos-smcga-84t"
-, update =	"98.07 bibrelex"
+, author =      "H. Edelsbrunner and M. H. Overmars and R. Seidel"
+, title =       "Some methods of computational geometry applied to computer graphics"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      28
+, year =        1984
+, pages =       "92--108"
+, keywords =    "data structuring, computer graphics, construction, searching, point location, range search, trees, subdivisions, two-dimensional"
+, succeeds =    "eos-smcga-84t"
+, update =      "98.07 bibrelex"
 }
 
 @article{eowbhf-rivc-90
-, author =	"H. Edelsbrunner and M. H. Overmars and Emo Welzl and Ben-Arroyo and I. Hartman and J. A. Feldman"
-, title =	"Ranking intervals under visibility constraints"
-, journal =	"Internat. J. Comput. Math."
-, volume =	34
-, number =	"3--4"
-, year =	1990
-, pages =	"129--144"
-, update =	"98.03 mitchell, 95.09 korneenko"
+, author =      "H. Edelsbrunner and M. H. Overmars and Emo Welzl and Ben-Arroyo and I. Hartman and J. A. Feldman"
+, title =       "Ranking intervals under visibility constraints"
+, journal =     "Internat. J. Comput. Math."
+, volume =      34
+, number =      "3--4"
+, year =        1990
+, pages =       "129--144"
+, update =      "98.03 mitchell, 95.09 korneenko"
 }
 
 @incollection{eow-gfcs-83
-, author =	"Herbert Edelsbrunner and Mark H. Overmars and Derick Wood"
-, title =	"Graphics in {Flatland}: {A} Case Study"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"35--59"
-, keywords =	"design of algorithms, computer graphics, visibility, plane-sweep, trees, two-dimensional"
-, update =	"01.04 icking"
+, author =      "Herbert Edelsbrunner and Mark H. Overmars and Derick Wood"
+, title =       "Graphics in {Flatland}: {A} Case Study"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "35--59"
+, keywords =    "design of algorithms, computer graphics, visibility, plane-sweep, trees, two-dimensional"
+, update =      "01.04 icking"
 }
 
 @inproceedings{epss-lebfi-87
-, author =	"H. Edelsbrunner and J. Pach and J. T. Schwartz and Micha Sharir"
-, title =	"On the lower envelope of bivariate functions and its applications"
-, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1987
-, pages =	"27--37"
-, keywords =	"discrete geometry, Davenport-Schinzel sequences, polyhedra, convex, arrangements, divide-and-conquer, hidden line/surface elimination, Voronoi diagrams, stabbing"
-, comments =	"In three journal papers: \cite{ps-ueplf-89},
-		 \cite{e-ueplf-89}, \cite{egs-ueplf-89}"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and J. Pach and J. T. Schwartz and Micha Sharir"
+, title =       "On the lower envelope of bivariate functions and its applications"
+, booktitle =   "Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1987
+, pages =       "27--37"
+, keywords =    "discrete geometry, Davenport-Schinzel sequences, polyhedra, convex, arrangements, divide-and-conquer, hidden line/surface elimination, Voronoi diagrams, stabbing"
+, comments =    "In three journal papers: \cite{ps-ueplf-89},
+                 \cite{e-ueplf-89}, \cite{egs-ueplf-89}"
+, update =      "98.03 mitchell"
 }
 
 @article{ep-mps-88
-, author =	"H. Edelsbrunner and F. P. Preparata"
-, title =	"Minimum polygonal separation"
-, journal =	"Inform. Comput."
-, volume =	77
-, year =	1988
-, pages =	"218--232"
-, keywords =	"design of algorithms, construction, separation, prune-and-search, polygons, convex, two-dimensional"
-, update =	"93.05 orourke"
+, author =      "H. Edelsbrunner and F. P. Preparata"
+, title =       "Minimum polygonal separation"
+, journal =     "Inform. Comput."
+, volume =      77
+, year =        1988
+, pages =       "218--232"
+, keywords =    "design of algorithms, construction, separation, prune-and-search, polygons, convex, two-dimensional"
+, update =      "93.05 orourke"
 }
 
 @techreport{epw-tpstd-86
-, author =	"H. Edelsbrunner and F. P. Preparata and D. B. West"
-, title =	"Tetrahedrizing point sets in three dimensions"
-, type =	"Report"
-, number =	"UIUCDCS-R-86-1310"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1986
-, keywords =	"design of algorithms, combinatorial geometry, construction, decomposition, incrementation, cell complexes, Voronoi diagrams, points, tetrahedra, three-dimensional"
-, precedes =	"epw-tpstd-90"
+, author =      "H. Edelsbrunner and F. P. Preparata and D. B. West"
+, title =       "Tetrahedrizing point sets in three dimensions"
+, type =        "Report"
+, number =      "UIUCDCS-R-86-1310"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1986
+, keywords =    "design of algorithms, combinatorial geometry, construction, decomposition, incrementation, cell complexes, Voronoi diagrams, points, tetrahedra, three-dimensional"
+, precedes =    "epw-tpstd-90"
 }
 
 @article{epw-tpstd-90
-, author =	"H. Edelsbrunner and F. P. Preparata and D. B. West"
-, title =	"Tetrahedrizing Point Sets in Three Dimensions"
-, journal =	"J. Symbolic Comput."
-, volume =	10
-, number =	"3--4"
-, year =	1990
-, pages =	"335--347"
-, succeeds =	"epw-tpstd-86"
-, update =	"97.11 bibrelex"
+, author =      "H. Edelsbrunner and F. P. Preparata and D. B. West"
+, title =       "Tetrahedrizing Point Sets in Three Dimensions"
+, journal =     "J. Symbolic Comput."
+, volume =      10
+, number =      "3--4"
+, year =        1990
+, pages =       "335--347"
+, succeeds =    "epw-tpstd-86"
+, update =      "97.11 bibrelex"
 }
 
 @article{ers-ccsno-90
-, author =	"H. Edelsbrunner and A. D. Robison and X. Shen"
-, title =	"Covering convex sets with non-overlapping polygons"
-, journal =	"Discrete Math."
-, volume =	81
-, year =	1990
-, pages =	"153--164"
-, comments =	"replaces the techreport ers-ccsno-87"
-, update =	"93.09 rote"
+, author =      "H. Edelsbrunner and A. D. Robison and X. Shen"
+, title =       "Covering convex sets with non-overlapping polygons"
+, journal =     "Discrete Math."
+, volume =      81
+, year =        1990
+, pages =       "153--164"
+, comments =    "replaces the techreport ers-ccsno-87"
+, update =      "93.09 rote"
 }
 
 @inproceedings{erw-tncst-87
-, author =	"H. Edelsbrunner and G{\"u}nter Rote and Emo Welzl"
-, title =	"Testing the necklace condition for shortest tours and optimal factors in the plane"
-, booktitle =	"Proc. 14th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	267
-, publisher =	"Springer-Verlag"
-, year =	1987
-, pages =	"364--375"
-, precedes =	"erw-tncst-89"
-, update =	"98.03 mitchell, 93.09 rote"
+, author =      "H. Edelsbrunner and G{\"u}nter Rote and Emo Welzl"
+, title =       "Testing the necklace condition for shortest tours and optimal factors in the plane"
+, booktitle =   "Proc. 14th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      267
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "364--375"
+, precedes =    "erw-tncst-89"
+, update =      "98.03 mitchell, 93.09 rote"
 }
 
 @article{erw-tncst-89
-, author =	"H. Edelsbrunner and G{\"u}nter Rote and Emo Welzl"
-, title =	"Testing the necklace condition for shortest tours and optimal factors in the plane"
-, journal =	"Theoret. Comput. Sci."
-, volume =	66
-, year =	1989
-, pages =	"157--180"
-, keywords =	"combinatorial geometry, operations research, construction, linear programming, geometric graphs, traveling salesman tours, matchings, points, two-dimensional, cluster analysis"
-, succeeds =	"erw-tncst-87"
-, update =	"98.03 mitchell, 93.09 rote"
+, author =      "H. Edelsbrunner and G{\"u}nter Rote and Emo Welzl"
+, title =       "Testing the necklace condition for shortest tours and optimal factors in the plane"
+, journal =     "Theoret. Comput. Sci."
+, volume =      66
+, year =        1989
+, pages =       "157--180"
+, keywords =    "combinatorial geometry, operations research, construction, linear programming, geometric graphs, traveling salesman tours, matchings, points, two-dimensional, cluster analysis"
+, succeeds =    "erw-tncst-87"
+, update =      "98.03 mitchell, 93.09 rote"
 }
 
 @inproceedings{es-vda-85
-, author =	"H. Edelsbrunner and R. Seidel"
-, title =	"Voronoi diagrams and arrangements"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"251--263"
-, precedes =	"es-vda-86"
-, cites =	"a-pdpaa-83, ab-gdt-86, ae-oacwv-84, b-acokv-83, b-cdt-81, b-fihs-78, b-vdch-79, b-gtfga-80, cd-vdsle-84, cy-grp-83, d-oacav-82, d-gvdgs-79, e-agc-, eos-calha-83, ew-nlsfs-82, elss-dgpps-73, g-ah-71, g-as-72, iim-vdlgi-85, k-eccs-79, l-fknnp-76, l-tdvdl-80, ld-gvdp-81, lw-vdllm-80, m-mnfcp-70, m-tom-82, p-kpudz-82, ph-chfsp-77, pm-finhs-79, s-chaop-81, sh-cpp-75, ls-ippvd-87, w-cnddt-81, y-oavds-84, z-fuafc-75, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "H. Edelsbrunner and R. Seidel"
+, title =       "Voronoi diagrams and arrangements"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "251--263"
+, precedes =    "es-vda-86"
+, cites =       "a-pdpaa-83, ab-gdt-86, ae-oacwv-84, b-acokv-83, b-cdt-81, b-fihs-78, b-vdch-79, b-gtfga-80, cd-vdsle-84, cy-grp-83, d-oacav-82, d-gvdgs-79, e-agc-, eos-calha-83, ew-nlsfs-82, elss-dgpps-73, g-ah-71, g-as-72, iim-vdlgi-85, k-eccs-79, l-fknnp-76, l-tdvdl-80, ld-gvdp-81, lw-vdllm-80, m-mnfcp-70, m-tom-82, p-kpudz-82, ph-chfsp-77, pm-finhs-79, s-chaop-81, sh-cpp-75, ls-ippvd-87, w-cnddt-81, y-oavds-84, z-fuafc-75, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{es-vda-86
-, author =	"H. Edelsbrunner and R. Seidel"
-, title =	"Voronoi diagrams and arrangements"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"25--44"
-, keywords =	"discrete geometry, geometric transformations, cell complexes, arrangements, Voronoi diagrams, hyperplanes, spheres, $d$-dimensional"
-, succeeds =	"es-vda-85"
+, author =      "H. Edelsbrunner and R. Seidel"
+, title =       "Voronoi diagrams and arrangements"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "25--44"
+, keywords =    "discrete geometry, geometric transformations, cell complexes, arrangements, Voronoi diagrams, hyperplanes, spheres, $d$-dimensional"
+, succeeds =    "es-vda-85"
 }
 
 @unpublished{ess-npzta-
-, author =	"H. Edelsbrunner and R. Seidel and Micha Sharir"
-, title =	"New proofs of the zone theorem for arrangements of hyperplanes"
-, note =	"In preparation"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "H. Edelsbrunner and R. Seidel and Micha Sharir"
+, title =       "New proofs of the zone theorem for arrangements of hyperplanes"
+, note =        "In preparation"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @incollection{ess-ztha-91
-, author =	"H. Edelsbrunner and R. Seidel and Micha Sharir"
-, title =	"On the zone theorem for hyperplane arrangements"
-, editor =	"H. Maurer"
-, booktitle =	"New Results and New Trends in Computer Science"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	555
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"108--123"
-, comments =	"Fixes bug in original proof \cite{eos-calha-86}"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and R. Seidel and Micha Sharir"
+, title =       "On the zone theorem for hyperplane arrangements"
+, editor =      "H. Maurer"
+, booktitle =   "New Results and New Trends in Computer Science"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      555
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "108--123"
+, comments =    "Fixes bug in original proof \cite{eos-calha-86}"
+, update =      "98.03 mitchell"
 }
 
 @article{ess-ztha-93
-, author =	"H. Edelsbrunner and R. Seidel and Micha Sharir"
-, title =	"On the zone theorem for hyperplane arrangements"
-, journal =	"SIAM J. Comput."
-, volume =	22
-, number =	2
-, year =	1993
-, pages =	"418--429"
-, comments =	"Fixes bug in original proof \cite{eos-calha-86}"
-, succeeds =	"ess-ztha-91"
-, update =	"98.03 mitchell, 96.05 agarwal, 95.09 agarwal+devillers, 93.09 erickson+matousek+rote"
+, author =      "H. Edelsbrunner and R. Seidel and Micha Sharir"
+, title =       "On the zone theorem for hyperplane arrangements"
+, journal =     "SIAM J. Comput."
+, volume =      22
+, number =      2
+, year =        1993
+, pages =       "418--429"
+, comments =    "Fixes bug in original proof \cite{eos-calha-86}"
+, succeeds =    "ess-ztha-91"
+, update =      "98.03 mitchell, 96.05 agarwal, 95.09 agarwal+devillers, 93.09 erickson+matousek+rote"
 }
 
 @inproceedings{es-itfwr-92
-, author =	"H. Edelsbrunner and N. R. Shah"
-, title =	"Incremental topological flipping works for regular triangulations"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"43--52"
-, cites =	"a-pdpaa-87, a-vdsfg-91, bm-sdcs-71, cs-arscg-89, d-slsv-34, e-acg-87, e-atccd-90, eks-sspp-83, em-sstcd-90, em-tdas-92, gks-ricdv-90, j-3dtlt-89, j-ctddt-91, l-gtgac-72, l-scsi-77, l-pndt-86, l-rtp-91, ps-cgi-85, r-mkkde-21, r-odtr-91, s-udzvd-28, s-chdch-86, v-nadpc-07, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "H. Edelsbrunner and N. R. Shah"
+, title =       "Incremental topological flipping works for regular triangulations"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "43--52"
+, cites =       "a-pdpaa-87, a-vdsfg-91, bm-sdcs-71, cs-arscg-89, d-slsv-34, e-acg-87, e-atccd-90, eks-sspp-83, em-sstcd-90, em-tdas-92, gks-ricdv-90, j-3dtlt-89, j-ctddt-91, l-gtgac-72, l-scsi-77, l-pndt-86, l-rtp-91, ps-cgi-85, r-mkkde-21, r-odtr-91, s-udzvd-28, s-chdch-86, v-nadpc-07, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{es-itfwr-96
-, author =	"H. Edelsbrunner and N. R. Shah"
-, title =	"Incremental topological flipping works for regular triangulations"
-, journal =	"Algorithmica"
-, volume =	15
-, year =	1996
-, pages =	"223--241"
-, update =	"96.05 smid"
+, author =      "H. Edelsbrunner and N. R. Shah"
+, title =       "Incremental topological flipping works for regular triangulations"
+, journal =     "Algorithmica"
+, volume =      15
+, year =        1996
+, pages =       "223--241"
+, update =      "96.05 smid"
 }
 
 @inproceedings{es-tts-94
-, author =	"H. Edelsbrunner and N. R. Shah"
-, title =	"Triangulating Topological Spaces"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"285--292"
-, precedes =	"es-tts-97"
-, cites =	"b-sat3m-64, bt-dfat-82, b-rgsdd-93, c-gqmgc-93, cf-hcc-67, d-slsv-34, e-acg-87, e-ubids-93, em-sstcd-90, gp-dt-74, h-dt-76, ks-sts-93, l-slfde-45, lw-tcc-69, ms-chrfm-, m-tfc-75, m-eat-84, ps-cgi-85, r-iat-88, rs-iplt-72, sf-afem-73, v-nadpc-07, w-tl-62, y-stgd-90, ZZZ"
-, update =	"00.03 devillers, 98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "H. Edelsbrunner and N. R. Shah"
+, title =       "Triangulating Topological Spaces"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "285--292"
+, precedes =    "es-tts-97"
+, cites =       "b-sat3m-64, bt-dfat-82, b-rgsdd-93, c-gqmgc-93, cf-hcc-67, d-slsv-34, e-acg-87, e-ubids-93, em-sstcd-90, gp-dt-74, h-dt-76, ks-sts-93, l-slfde-45, lw-tcc-69, ms-chrfm-, m-tfc-75, m-eat-84, ps-cgi-85, r-iat-88, rs-iplt-72, sf-afem-73, v-nadpc-07, w-tl-62, y-stgd-90, ZZZ"
+, update =      "00.03 devillers, 98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @article{es-tts-97
-, author =	"H. Edelsbrunner and N. R. Shah"
-, title =	"Triangulating Topological Spaces"
-, journal =	"Int. J. on Comp. Geom."
-, volume =	7
-, year =	1997
-, pages =	"365--378"
-, succeeds =	"es-tts-94"
-, update =	"00.03 devillers"
+, author =      "H. Edelsbrunner and N. R. Shah"
+, title =       "Triangulating Topological Spaces"
+, journal =     "Int. J. on Comp. Geom."
+, volume =      7
+, year =        1997
+, pages =       "365--378"
+, succeeds =    "es-tts-94"
+, update =      "00.03 devillers"
 }
 
 @inproceedings{es-hipac-90
-, author =	"H. Edelsbrunner and Micha Sharir"
-, title =	"A hyperplane incidence problem with applications to counting distances"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"419--428"
-, precedes =	"es-hipac-91"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Micha Sharir"
+, title =       "A hyperplane incidence problem with applications to counting distances"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "419--428"
+, precedes =    "es-hipac-91"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{es-hipac-91
-, author =	"H. Edelsbrunner and Micha Sharir"
-, title =	"A hyperplane incidence problem with applications to counting distances"
-, editor =	"P. Gritzman and B. Sturmfels"
-, booktitle =	"Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
-, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
-, volume =	4
-, publisher =	"AMS Press"
-, address =	"Providence, RI"
-, year =	1991
-, pages =	"253--263"
-, succeeds =	"es-hipac-90"
-, update =	"98.07 agarwal, 98.03 mitchell, 93.09 erickson"
+, author =      "H. Edelsbrunner and Micha Sharir"
+, title =       "A hyperplane incidence problem with applications to counting distances"
+, editor =      "P. Gritzman and B. Sturmfels"
+, booktitle =   "Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
+, series =      "DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
+, volume =      4
+, publisher =   "AMS Press"
+, address =     "Providence, RI"
+, year =        1991
+, pages =       "253--263"
+, succeeds =    "es-hipac-90"
+, update =      "98.07 agarwal, 98.03 mitchell, 93.09 erickson"
 }
 
 @techreport{es-mnwsn-87
-, author =	"H. Edelsbrunner and Micha Sharir"
-, title =	"The maximum number of ways to stab $n$ convex non-intersecting sets in the plane is $2n-2$"
-, type =	"Report"
-, number =	281
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1987
-, keywords =	"combinatorial geometry, stabbing, convex, Davenport-Schinzel sequences, divide-and-conquer"
-, precedes =	"es-mnwsn-90"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Micha Sharir"
+, title =       "The maximum number of ways to stab $n$ convex non-intersecting sets in the plane is $2n-2$"
+, type =        "Report"
+, number =      281
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1987
+, keywords =    "combinatorial geometry, stabbing, convex, Davenport-Schinzel sequences, divide-and-conquer"
+, precedes =    "es-mnwsn-90"
+, update =      "98.03 mitchell"
 }
 
 @article{es-mnwsn-90
-, author =	"Herbert Edelsbrunner and Micha Sharir"
-, title =	"The maximum number of ways to stab $n$ convex non-intersecting sets in the plane is $2n-2$"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"35--42"
-, keywords =	"combinatorial geometry, stabbing, convex, Davenport-Schinzel sequences, divide-and-conquer"
-, succeeds =	"es-mnwsn-87"
-, update =	"98.11 aronov+bibrelex, 98.03 mitchell"
+, author =      "Herbert Edelsbrunner and Micha Sharir"
+, title =       "The maximum number of ways to stab $n$ convex non-intersecting sets in the plane is $2n-2$"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "35--42"
+, keywords =    "combinatorial geometry, stabbing, convex, Davenport-Schinzel sequences, divide-and-conquer"
+, succeeds =    "es-mnwsn-87"
+, update =      "98.11 aronov+bibrelex, 98.03 mitchell"
 }
 
 @article{es-otatd-91
-, author =	"H. Edelsbrunner and W. Shi"
-, title =	"An {$O(n \log^{2} h)$} time algorithm for the three-dimensional convex hull problem"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"259--277"
+, author =      "H. Edelsbrunner and W. Shi"
+, title =       "An {$O(n \log^{2} h)$} time algorithm for the three-dimensional convex hull problem"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "259--277"
 }
 
 @article{es-nfnpp-?
-, author =	"H. Edelsbrunner and Steven S. Skiena"
-, title =	"On the number of furthest neighbour pairs in a point set"
-, journal =	"Amer. Math. Monthly"
-, volume =	"?"
-, year =	"?"
-, pages =	"?"
-, keywords =	"pointset, furthest pair"
-, succeeds =	"es-nfnpp-86"
-, update =	"98.03 mitchell, 95.09 korneenko"
+, author =      "H. Edelsbrunner and Steven S. Skiena"
+, title =       "On the number of furthest neighbour pairs in a point set"
+, journal =     "Amer. Math. Monthly"
+, volume =      "?"
+, year =        "?"
+, pages =       "?"
+, keywords =    "pointset, furthest pair"
+, succeeds =    "es-nfnpp-86"
+, update =      "98.03 mitchell, 95.09 korneenko"
 }
 
 @techreport{es-nfnpp-86
-, author =	"H. Edelsbrunner and Steven S. Skiena"
-, title =	"On the number of furthest neighbour pairs in a point set"
-, type =	"Report"
-, number =	"UIUCDCS-R-86-1312"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1986
-, precedes =	"es-nfnpp-?"
-, update =	"98.03 mitchell, 95.09 korneenko"
+, author =      "H. Edelsbrunner and Steven S. Skiena"
+, title =       "On the number of furthest neighbour pairs in a point set"
+, type =        "Report"
+, number =      "UIUCDCS-R-86-1312"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1986
+, precedes =    "es-nfnpp-?"
+, update =      "98.03 mitchell, 95.09 korneenko"
 }
 
 @techreport{es-pcpxr-86
-, author =	"H. Edelsbrunner and Steven S. Skiena"
-, title =	"Probing convex polygons with $x$-rays"
-, type =	"Report"
-, number =	"UIUCDCS-R-86-1306"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1986
-, keywords =	"discrete geometry, robotics, probing, worst-case analysis, polygons, convex, two-dimensional"
-, precedes =	"es-pcpxr-88"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Steven S. Skiena"
+, title =       "Probing convex polygons with $x$-rays"
+, type =        "Report"
+, number =      "UIUCDCS-R-86-1306"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1986
+, keywords =    "discrete geometry, robotics, probing, worst-case analysis, polygons, convex, two-dimensional"
+, precedes =    "es-pcpxr-88"
+, update =      "98.03 mitchell"
 }
 
 @article{es-pcpxr-88
-, author =	"H. Edelsbrunner and Steven S. Skiena"
-, title =	"Probing convex polygons with $x$-rays"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, year =	1988
-, pages =	"870--882"
-, keywords =	"discrete geometry, robotics, probing, worst-case analysis, polygons, convex, two-dimensional"
-, succeeds =	"es-pcpxr-86"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Steven S. Skiena"
+, title =       "Probing convex polygons with $x$-rays"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, year =        1988
+, pages =       "870--882"
+, keywords =    "discrete geometry, robotics, probing, worst-case analysis, polygons, convex, two-dimensional"
+, succeeds =    "es-pcpxr-86"
+, update =      "98.03 mitchell"
 }
 
 @article{es-cmsrl-90
-, author =	"H. Edelsbrunner and D. L. Souvaine"
-, title =	"Computing median-of-squares regression lines and guided topological sweep"
-, journal =	"J. Amer. Statist. Assoc."
-, volume =	85
-, year =	1990
-, pages =	"115--119"
-, keywords =	"statistics, optimization, plane-sweep, topological sweep, geometric transformations, binary search, points, lines"
+, author =      "H. Edelsbrunner and D. L. Souvaine"
+, title =       "Computing median-of-squares regression lines and guided topological sweep"
+, journal =     "J. Amer. Statist. Assoc."
+, volume =      85
+, year =        1990
+, pages =       "115--119"
+, keywords =    "statistics, optimization, plane-sweep, topological sweep, geometric transformations, binary search, points, lines"
 }
 
 @article{es-nepfp-86
-, author =	"H. Edelsbrunner and G. St{\"o}ckl"
-, title =	"The number of extreme pairs of finite point sets in {Euclidean} spaces"
-, journal =	"J. Combin. Theory"
-, volume =	43
-, number =	2
-, year =	1986
-, pages =	"344--349"
-, keywords =	"points, combinatorial geometry"
-, update =	"95.09 korneenko"
+, author =      "H. Edelsbrunner and G. St{\"o}ckl"
+, title =       "The number of extreme pairs of finite point sets in {Euclidean} spaces"
+, journal =     "J. Combin. Theory"
+, volume =      43
+, number =      2
+, year =        1986
+, pages =       "344--349"
+, keywords =    "points, combinatorial geometry"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{et-qtaml-91
-, author =	"H. Edelsbrunner and T. S. Tan"
-, title =	"A quadratic time algorithm for the minmax length triangulation"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"414--423"
-, precedes =	"et-qtaml-93"
-, update =	"93.09 rote"
+, author =      "H. Edelsbrunner and T. S. Tan"
+, title =       "A quadratic time algorithm for the minmax length triangulation"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "414--423"
+, precedes =    "et-qtaml-93"
+, update =      "93.09 rote"
 }
 
 @article{et-qtaml-93
-, author =	"H. Edelsbrunner and T. S. Tan"
-, title =	"A quadratic time algorithm for the minmax length triangulation"
-, journal =	"SIAM J. Comput."
-, volume =	22
-, year =	1993
-, pages =	"527--551"
-, succeeds =	"et-qtaml-91"
-, update =	"93.09 rote"
+, author =      "H. Edelsbrunner and T. S. Tan"
+, title =       "A quadratic time algorithm for the minmax length triangulation"
+, journal =     "SIAM J. Comput."
+, volume =      22
+, year =        1993
+, pages =       "527--551"
+, succeeds =    "et-qtaml-91"
+, update =      "93.09 rote"
 }
 
 @inproceedings{et-ubcdt-92
-, author =	"H. Edelsbrunner and T. S. Tan"
-, title =	"An upper bound for conforming {Delaunay} triangulations"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"53--62"
-, succeeds =	"et-ubcdt-93"
-, cites =	"beg-pgmg-90, be-psntp-91, bfl-rsddt-88i, b-srpcs-88, c-atapd-74, clr-ia-90, ds-oiti-89, d-slsv-34, e-acg-87, ea-lacvp-81, f-savd-87, gks-ricdv-90, gs-pmgsc-85, js-clvpa-87, l-scsi-77, l-vsp-83, ll-gdtpg-86, ns-ppdtp-91, o-tavc-91, ps-cgi-85, r-odtr-91, r-mrpdt-90, s-der-91, s-cdtvd-88, s-let-78, sf-afem-73, v-nadpc-08, ZZZ"
-, update =	"98.07 bibrelex, 97.11 bibrelex, 95.09 korneenko"
+, author =      "H. Edelsbrunner and T. S. Tan"
+, title =       "An upper bound for conforming {Delaunay} triangulations"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "53--62"
+, succeeds =    "et-ubcdt-93"
+, cites =       "beg-pgmg-90, be-psntp-91, bfl-rsddt-88i, b-srpcs-88, c-atapd-74, clr-ia-90, ds-oiti-89, d-slsv-34, e-acg-87, ea-lacvp-81, f-savd-87, gks-ricdv-90, gs-pmgsc-85, js-clvpa-87, l-scsi-77, l-vsp-83, ll-gdtpg-86, ns-ppdtp-91, o-tavc-91, ps-cgi-85, r-odtr-91, r-mrpdt-90, s-der-91, s-cdtvd-88, s-let-78, sf-afem-73, v-nadpc-08, ZZZ"
+, update =      "98.07 bibrelex, 97.11 bibrelex, 95.09 korneenko"
 }
 
 @article{et-ubcdt-93
-, author =	"H. Edelsbrunner and T. S. Tan"
-, title =	"An upper bound for conforming {Delaunay} triangulations"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, number =	2
-, year =	1993
-, pages =	"197--213"
-, update =	"95.09 korneenko"
+, author =      "H. Edelsbrunner and T. S. Tan"
+, title =       "An upper bound for conforming {Delaunay} triangulations"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, number =      2
+, year =        1993
+, pages =       "197--213"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{etw-otama-90
-, author =	"H. Edelsbrunner and T. S. Tan and R. Waupotitsch"
-, title =	"An {$O(n^{2} \log n)$} time algorithm for the minmax angle triangulation"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"44--52"
-, cites =	"ahu-daca-74, ba-acfem-76, c-atapd-74, d-slsv-34, e-acg-87, f-savd-87, gs-pmgsc-85, h-ep-82, k-mtpd-80, l-gtgac-72, l-scsi-77, ll-gdtpg-86, ph-hta-87, ps-pqat-77, ps-cgi-85, s-cdtvd-88, sh-cpp-75, s-let-78, sf-afem-73, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "H. Edelsbrunner and T. S. Tan and R. Waupotitsch"
+, title =       "An {$O(n^{2} \log n)$} time algorithm for the minmax angle triangulation"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "44--52"
+, cites =       "ahu-daca-74, ba-acfem-76, c-atapd-74, d-slsv-34, e-acg-87, f-savd-87, gs-pmgsc-85, h-ep-82, k-mtpd-80, l-gtgac-72, l-scsi-77, ll-gdtpg-86, ph-hta-87, ps-pqat-77, ps-cgi-85, s-cdtvd-88, sh-cpp-75, s-let-78, sf-afem-73, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{etw-otama-92
-, author =	"Herbert Edelsbrunner and Tiow Seng Tan and Roman Waupotitsch"
-, title =	"${O}({N}^2 \log {N})$ Time Algorithm For The Minmax Angle Triangulation"
-, journal =	"SIAM J. Sci. Statist. Comput."
-, volume =	13
-, number =	4
-, month =	jul
-, year =	1992
-, pages =	"994--1008"
-, succeeds =	"etw-otama-90"
-, annote =	"Basically a generalization of switching. If we can't
-		 improve the worst triangle by a switching look for a an
-		 edge splitting the largest angle that crosses several
-		 edges."
+, author =      "Herbert Edelsbrunner and Tiow Seng Tan and Roman Waupotitsch"
+, title =       "${O}({N}^2 \log {N})$ Time Algorithm For The Minmax Angle Triangulation"
+, journal =     "SIAM J. Sci. Statist. Comput."
+, volume =      13
+, number =      4
+, month =       jul
+, year =        1992
+, pages =       "994--1008"
+, succeeds =    "etw-otama-90"
+, annote =      "Basically a generalization of switching. If we can't
+                 improve the worst triangle by a switching look for a an
+                 edge splitting the largest angle that crosses several
+                 edges."
 }
 
 @inproceedings{evw-cdpsh-94
-, author =	"H. Edelsbrunner and P. Valtr and Emo Welzl"
-, title =	"Cutting Dense Point Sets in Half"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"203--210"
-, cites =	"a-gmtud-90, akp-mscpr-89, ap-ieggs-86, acegsw-ptphp-91, bfl-nhp-89, c-sscg-86, cp-hrsaa-86, csy-khrp-87, de-ctchp-93, e-ibith-91, ew-nlsfs-85, ew-cbtda-86, elss-dgpps-73, gps-crotr-89, gps-iscir-90, l-nhl-71, pss-ubnpk-92, r-n3sfp-93, s-iggp-76, v-ppsbr-94, v-cis7h-92, vz-ctpci-92, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
+, author =      "H. Edelsbrunner and P. Valtr and Emo Welzl"
+, title =       "Cutting Dense Point Sets in Half"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "203--210"
+, cites =       "a-gmtud-90, akp-mscpr-89, ap-ieggs-86, acegsw-ptphp-91, bfl-nhp-89, c-sscg-86, cp-hrsaa-86, csy-khrp-87, de-ctchp-93, e-ibith-91, ew-nlsfs-85, ew-cbtda-86, elss-dgpps-73, gps-crotr-89, gps-iscir-90, l-nhl-71, pss-ubnpk-92, r-n3sfp-93, s-iggp-76, v-ppsbr-94, v-cis7h-92, vz-ctpci-92, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
 }
 
 @article{evw-cdpsh-97
-, author =	"H. Edelsbrunner and P. Valtr and Emo Welzl"
-, title =	"Cutting Dense Point Sets in Half"
-, journal =	"Discrete Comput. Geom."
-, volume =	17
-, year =	1997
-, pages =	"243--255"
-, update =	"98.07 agarwal"
+, author =      "H. Edelsbrunner and P. Valtr and Emo Welzl"
+, title =       "Cutting Dense Point Sets in Half"
+, journal =     "Discrete Comput. Geom."
+, volume =      17
+, year =        1997
+, pages =       "243--255"
+, update =      "98.07 agarwal"
 }
 
 @article{evl-madsb-80
-, author =	"H. Edelsbrunner and J. {van Leeuwen}"
-, title =	"Multidimensional algorithms and data structures (bibliography)"
-, journal =	"Bull. EATCS"
-, volume =	11
-, year =	1980
-, pages =	"46--74"
-, keywords =	"searching, data structuring, $d$-dimensional"
-, update =	"95.09 korneenko"
+, author =      "H. Edelsbrunner and J. {van Leeuwen}"
+, title =       "Multidimensional algorithms and data structures (bibliography)"
+, journal =     "Bull. EATCS"
+, volume =      11
+, year =        1980
+, pages =       "46--74"
+, keywords =    "searching, data structuring, $d$-dimensional"
+, update =      "95.09 korneenko"
 }
 
 @article{ew-cac-97
-, author =	"H. Edelsbrunner and E. Waupotitsch"
-, title =	"A combinatorial approach to cartograms"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"343--360"
-, succeeds =	"ew-cac-95"
-, update =	"97.07 devillers"
+, author =      "H. Edelsbrunner and E. Waupotitsch"
+, title =       "A combinatorial approach to cartograms"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "343--360"
+, succeeds =    "ew-cac-95"
+, update =      "97.07 devillers"
 }
 
 @inproceedings{ew-cac-95
-, author =	"Herbert Edelsbrunner and Roman Waupotitsch"
-, title =	"A Combinatorial Approach to Cartograms"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"98--108"
-, keywords =	"topology, homeomorphism"
-, precedes =	"ew-cac-97"
-, cites =	"clr-ia-90, d-mdcm-93, dcn-accac-85, g-gsh-81, gl-mc-89, gw-hcg-93a, gw-hcg-93b, m-mdscg-84, m-eat-84, s-t-93, t-ctud-73, t-aciho-88, wg-plrsm-85, ZZZ"
-, update =	"98.03 bibrelex, 97.07 devillers, 95.09 mitchell"
+, author =      "Herbert Edelsbrunner and Roman Waupotitsch"
+, title =       "A Combinatorial Approach to Cartograms"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "98--108"
+, keywords =    "topology, homeomorphism"
+, precedes =    "ew-cac-97"
+, cites =       "clr-ia-90, d-mdcm-93, dcn-accac-85, g-gsh-81, gl-mc-89, gw-hcg-93a, gw-hcg-93b, m-mdscg-84, m-eat-84, s-t-93, t-ctud-73, t-aciho-88, wg-plrsm-85, ZZZ"
+, update =      "98.03 bibrelex, 97.07 devillers, 95.09 mitchell"
 }
 
 @article{ew-chsct-86
-, author =	"H. Edelsbrunner and R. Waupotitsch"
-, title =	"Computing a ham-sandwich cut in two dimensions"
-, journal =	"J. Symbolic Comput."
-, volume =	2
-, year =	1986
-, pages =	"171--178"
-, keywords =	"design of algorithms, construction, partition, prune-and-search, geometric transformations, worst-case analysis, points, lines, two-dimensional"
+, author =      "H. Edelsbrunner and R. Waupotitsch"
+, title =       "Computing a ham-sandwich cut in two dimensions"
+, journal =     "J. Symbolic Comput."
+, volume =      2
+, year =        1986
+, pages =       "171--178"
+, keywords =    "design of algorithms, construction, partition, prune-and-search, geometric transformations, worst-case analysis, points, lines, two-dimensional"
 }
 
 @article{ew-cbtda-86
-, author =	"H. Edelsbrunner and Emo Welzl"
-, title =	"Constructing belts in two-dimensional arrangements with applications"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"271--284"
-, keywords =	"design of algorithms, combinatorial geometry, plane-sweep, repeated search, arrangements, two-dimensional, counting, approximation, range search, arrangements"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Emo Welzl"
+, title =       "Constructing belts in two-dimensional arrangements with applications"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "271--284"
+, keywords =    "design of algorithms, combinatorial geometry, plane-sweep, repeated search, arrangements, two-dimensional, counting, approximation, range search, arrangements"
+, update =      "98.03 mitchell"
 }
 
 @techreport{ew-hre-82
-, author =	"H. Edelsbrunner and Emo Welzl"
-, title =	"Halfplanar range estimation"
-, type =	"Report"
-, number =	"F98"
-, institution =	"Inst. Informationsverarb., Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1982
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "H. Edelsbrunner and Emo Welzl"
+, title =       "Halfplanar range estimation"
+, type =        "Report"
+, number =      "F98"
+, institution = "Inst. Informationsverarb., Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1982
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{ew-hrsls-83
-, author =	"H. Edelsbrunner and Emo Welzl"
-, title =	"Halfplanar range search in linear space and {$O(n^{0.695})$} query time"
-, type =	"Report"
-, number =	"F111"
-, institution =	"Inst. Informationsverarb., Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1983
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "H. Edelsbrunner and Emo Welzl"
+, title =       "Halfplanar range search in linear space and {$O(n^{0.695})$} query time"
+, type =        "Report"
+, number =      "F111"
+, institution = "Inst. Informationsverarb., Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1983
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{ew-hrsls-86
-, author =	"H. Edelsbrunner and Emo Welzl"
-, title =	"Halfplanar range search in linear space and {$O(n^{0.695})$} query time"
-, journal =	"Inform. Process. Lett."
-, volume =	23
-, year =	1986
-, pages =	"289--293"
-, keywords =	"data structuring, discrete geometry, searching, partition, range search, trees, subdivisions, two-dimensional, reporting, counting"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Emo Welzl"
+, title =       "Halfplanar range search in linear space and {$O(n^{0.695})$} query time"
+, journal =     "Inform. Process. Lett."
+, volume =      23
+, year =        1986
+, pages =       "289--293"
+, keywords =    "data structuring, discrete geometry, searching, partition, range search, trees, subdivisions, two-dimensional, reporting, counting"
+, update =      "98.03 mitchell"
 }
 
 @incollection{ew-mesla-84
-, author =	"H. Edelsbrunner and Emo Welzl"
-, title =	"Monotone edge sequences in line arrangements, with applications"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	176
-, year =	1984
-, pages =	"265--273"
-, keywords =	"lines, arrangement"
-, update =	"98.03 mitchell, 95.09 korneenko"
+, author =      "H. Edelsbrunner and Emo Welzl"
+, title =       "Monotone edge sequences in line arrangements, with applications"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      176
+, year =        1984
+, pages =       "265--273"
+, keywords =    "lines, arrangement"
+, update =      "98.03 mitchell, 95.09 korneenko"
 }
 
 @article{ew-mnemf-86
-, author =	"H. Edelsbrunner and Emo Welzl"
-, title =	"On the maximal number of edges of many faces in an arrangement"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	41
-, year =	1986
-, pages =	"159--166"
-, keywords =	"arrangements, complexity of faces"
-, update =	"98.03 mitchell"
+, author =      "H. Edelsbrunner and Emo Welzl"
+, title =       "On the maximal number of edges of many faces in an arrangement"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      41
+, year =        1986
+, pages =       "159--166"
+, keywords =    "arrangements, complexity of faces"
+, update =      "98.03 mitchell"
 }
 
 @incollection{ew-nessp-83
-, author =	"H. Edelsbrunner and Emo Welzl"
-, title =	"On the number of equal-sized semispaces of a set of points in the plane"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	154
-, year =	1983
-, pages =	"182--187"
-, keywords =	"points, combinatorial geometry"
-, update =	"98.03 mitchell, 95.09 korneenko"
+, author =      "H. Edelsbrunner and Emo Welzl"
+, title =       "On the number of equal-sized semispaces of a set of points in the plane"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      154
+, year =        1983
+, pages =       "182--187"
+, keywords =    "points, combinatorial geometry"
+, update =      "98.03 mitchell, 95.09 korneenko"
 }
 
 @techreport{ew-nlsfs-82
-, author =	"H. Edelsbrunner and Emo Welzl"
-, title =	"On the number of line-separations of a finite set in the plane"
-, type =	"Report"
-, number =	"F97"
-, institution =	"Inst. Informationsverarb., Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1982
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "H. Edelsbrunner and Emo Welzl"
+, title =       "On the number of line-separations of a finite set in the plane"
+, type =        "Report"
+, number =      "F97"
+, institution = "Inst. Informationsverarb., Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1982
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{ew-nlsfs-85
-, author =	"H. Edelsbrunner and Emo Welzl"
-, title =	"On the number of line separations of a finite set in the plane"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	40
-, year =	1985
-, pages =	"15--29"
-, update =	"98.03 agarwal+mitchell"
+, author =      "H. Edelsbrunner and Emo Welzl"
+, title =       "On the number of line separations of a finite set in the plane"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      40
+, year =        1985
+, pages =       "15--29"
+, update =      "98.03 agarwal+mitchell"
 }
 
 @inproceedings{e-dum-91
-, author =	"J. Edmonds"
-, title =	"Decomposition using {Minkowski}"
-, booktitle =	"Abstracts of the 14th Internat. Sympos. on Mathematical Programming"
-, site =	"Amsterdam, Netherlands"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "J. Edmonds"
+, title =       "Decomposition using {Minkowski}"
+, booktitle =   "Abstracts of the 14th Internat. Sympos. on Mathematical Programming"
+, site =        "Amsterdam, Netherlands"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @article{e-mmpv-65
-, author =	"J. Edmonds"
-, title =	"Maximum matching and a polyhedron with (0,1) vertices"
-, journal =	"J. Res. National Bureau of Standards"
-, volume =	"??"
-, year =	1965
-, pages =	"125--130"
-, update =	"98.03 bibrelex"
+, author =      "J. Edmonds"
+, title =       "Maximum matching and a polyhedron with (0,1) vertices"
+, journal =     "J. Res. National Bureau of Standards"
+, volume =      "??"
+, year =        1965
+, pages =       "125--130"
+, update =      "98.03 bibrelex"
 }
 
 @article{e-mpmis-65
-, author =	"J. Edmonds"
-, title =	"Minimum partition of a matroid into independent sets"
-, journal =	"Research of th NBS"
-, volume =	69
-, year =	1965
-, pages =	"67--72"
-, update =	"01.07 devillers, 98.11 bibrelex"
+, author =      "J. Edmonds"
+, title =       "Minimum partition of a matroid into independent sets"
+, journal =     "Research of th NBS"
+, volume =      69
+, year =        1965
+, pages =       "67--72"
+, update =      "01.07 devillers, 98.11 bibrelex"
 }
 
 @article{e-sdrla-67
-, author =	"J. Edmonds"
-, title =	"Systems of distinct representatives and linear algebra"
-, journal =	"J. Res. National Bureau of Standards"
-, volume =	71
-, number =	"B"
-, year =	1967
-, pages =	"241--245"
-, update =	"98.07 bibrelex"
+, author =      "J. Edmonds"
+, title =       "Systems of distinct representatives and linear algebra"
+, journal =     "J. Res. National Bureau of Standards"
+, volume =      71
+, number =      "B"
+, year =        1967
+, pages =       "241--245"
+, update =      "98.07 bibrelex"
 }
 
 @article{ek-tiaen-72
-, author =	"J. Edmonds and R. M. Karp"
-, title =	"Theoretical improvements in algorithmic efficiency for network flow problems"
-, journal =	"J. ACM"
-, volume =	19
-, year =	1972
-, pages =	"248--264"
-, update =	"97.11 bibrelex"
+, author =      "J. Edmonds and R. M. Karp"
+, title =       "Theoretical improvements in algorithmic efficiency for network flow problems"
+, journal =     "J. ACM"
+, volume =      19
+, year =        1972
+, pages =       "248--264"
+, update =      "97.11 bibrelex"
 }
 
 @article{e-crps-60
-, author =	"R. Edmonds"
-, title =	"A combinatorial representation for polyhedral surfaces"
-, journal =	"Notices Amer. Math. Soc."
-, volume =	7
-, year =	1960
-, pages =	646
+, author =      "R. Edmonds"
+, title =       "A combinatorial representation for polyhedral surfaces"
+, journal =     "Notices Amer. Math. Soc."
+, volume =      7
+, year =        1960
+, pages =       646
 }
 
 @article{ecms-gcla-97
-, author =	"S. Edmondson and J. Christensen and J. Marks and S. M. Schieber"
-, title =	"A general cartographic labeling algorithm"
-, journal =	"Cartographica"
-, volume =	"??"
-, year =	1997
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "S. Edmondson and J. Christensen and J. Marks and S. M. Schieber"
+, title =       "A general cartographic labeling algorithm"
+, journal =     "Cartographica"
+, volume =      "??"
+, year =        1997
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @book{ep-cag-86
-, author =	"C. H. {Edwards, Jr.} and D. E. Penny"
-, title =	"Calculus and Analytic Geometry"
-, edition =	"2nd"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1986
+, author =      "C. H. {Edwards, Jr.} and D. E. Penny"
+, title =       "Calculus and Analytic Geometry"
+, edition =     "2nd"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1986
 }
 
 @article{e-ltawm-93
-, author =	"P. Effernan"
-, title =	"Linear time algorithms for weakly monotone polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"121--137"
-, update =	"96.09 devillers"
+, author =      "P. Effernan"
+, title =       "Linear time algorithms for weakly monotone polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "121--137"
+, update =      "96.09 devillers"
 }
 
 @mastersthesis{e-samcp-93
-, author =	"A. Efrat"
-, title =	"A simple algorithm for maintaining the center of a planar point set"
-, school =	"Technion IIT"
-, address =	"Haifa, Israel"
-, year =	1993
-, keywords =	"master thesis"
-, precedes =	"bei-samcp-93"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "A. Efrat"
+, title =       "A simple algorithm for maintaining the center of a planar point set"
+, school =      "Technion IIT"
+, address =     "Haifa, Israel"
+, year =        1993
+, keywords =    "master thesis"
+, precedes =    "bei-samcp-93"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @unpublished{e-famps-95
-, author =	"A. Efrat"
-, title =	"Finding approximate matching of points and segments under translation"
-, year =	1995
-, note =	"Unpublished manuscript"
-, update =	"95.09 agarwal"
+, author =      "A. Efrat"
+, title =       "Finding approximate matching of points and segments under translation"
+, year =        1995
+, note =        "Unpublished manuscript"
+, update =      "95.09 agarwal"
 }
 
 @inproceedings{eg-siruc-93
-, author =	"A. Efrat and C. Gotsman"
-, title =	"Subpixel image registration using circular fiducials"
-, booktitle =	"Proc. 2nd Israel Sympos. Theory Computing and Systems"
-, year =	1993
-, pages =	"48--47"
-, precedes =	"eg-siruc-94"
-, update =	"96.09 devillers, 93.09 efrat"
+, author =      "A. Efrat and C. Gotsman"
+, title =       "Subpixel image registration using circular fiducials"
+, booktitle =   "Proc. 2nd Israel Sympos. Theory Computing and Systems"
+, year =        1993
+, pages =       "48--47"
+, precedes =    "eg-siruc-94"
+, update =      "96.09 devillers, 93.09 efrat"
 }
 
 @article{eg-siruc-94
-, author =	"A. Efrat and C. Gotsman"
-, title =	"Subpixel image registration using circular fiducials"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"403--422"
-, keywords =	"computer vision, registration, fiducials, lattice geometry, number theory"
-, succeeds =	"eg-siruc-93"
-, update =	"98.07 rote, 96.09 devillers"
+, author =      "A. Efrat and C. Gotsman"
+, title =       "Subpixel image registration using circular fiducials"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "403--422"
+, keywords =    "computer vision, registration, fiducials, lattice geometry, number theory"
+, succeeds =    "eg-siruc-93"
+, update =      "98.07 rote, 96.09 devillers"
 }
 
 @inproceedings{eh-fcmfc-98
-, author =	"Alon Efrat and Sariel Har-Peled"
-, title =	"Fly Cheaply: {On} the Minimum Fuel-Consumption Problem"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"to appear"
-, update =	"98.03 mitchell"
+, author =      "Alon Efrat and Sariel Har-Peled"
+, title =       "Fly Cheaply: {On} the Minimum Fuel-Consumption Problem"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "to appear"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ehks-cspre-00
-, author =	"Alon Efrat and Frank Hoffmann and Klaus Kriegel and Christof Schultz"
-, title =	"Covering Simple Polygonal Regions by Ellipses"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"89--92"
-, update =	"00.03 bibrelex"
+, author =      "Alon Efrat and Frank Hoffmann and Klaus Kriegel and Christof Schultz"
+, title =       "Covering Simple Polygonal Regions by Ellipses"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "89--92"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{ei-ibmrp-96
-, author =	"Alon Efrat and Alon Itai"
-, title =	"Improvements on Bottleneck Matching and Related Problems Using Geometry"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"301--310"
-, cites =	"aass-sdp-93, aes-vdsl3-95, am-rsps-93, aks-scps-83, abb-amps-91, amww-cssgo-88, akmsw-mpnrc-91, amnsw-oaann-94, b-ttgt-57, by-lotmc-94, ctl-sebmp-92, ck-igpmp-92, cdek-gpmds-95, cghkkk-gpmem-93, c-sdsno-87, d-aspmf-70, egs-oplms-86, ek-tiaen-72, esz-cskec-94, e-famps-95, fj-gsrsm-84, hs-adaps-92, h-gaaps-93, hs-asdch-90, hs-ftp-91, hk-nammb-73, hk-cmhdp-90, hks-uevsi-93, ia-eaggs-86, k-ecbmf-73, k-iagoe-95, k-hmap-55, l-conm-76, lp-mt-86, m-apcad-83, t-dsna-83, v-ghm-88, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Alon Efrat and Alon Itai"
+, title =       "Improvements on Bottleneck Matching and Related Problems Using Geometry"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "301--310"
+, cites =       "aass-sdp-93, aes-vdsl3-95, am-rsps-93, aks-scps-83, abb-amps-91, amww-cssgo-88, akmsw-mpnrc-91, amnsw-oaann-94, b-ttgt-57, by-lotmc-94, ctl-sebmp-92, ck-igpmp-92, cdek-gpmds-95, cghkkk-gpmem-93, c-sdsno-87, d-aspmf-70, egs-oplms-86, ek-tiaen-72, esz-cskec-94, e-famps-95, fj-gsrsm-84, hs-adaps-92, h-gaaps-93, hs-asdch-90, hs-ftp-91, hk-nammb-73, hk-cmhdp-90, hks-uevsi-93, ia-eaggs-86, k-ecbmf-73, k-iagoe-95, k-hmap-55, l-conm-76, lp-mt-86, m-apcad-83, t-dsna-83, v-ghm-88, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @unpublished{ei-ibmrp-97
-, author =	"A. Efrat and A. Itai and M. J. Katz"
-, title =	"Improvements on Bottleneck Matching and Related Problems Using Geometry"
-, year =	1997
-, note =	"Unpublished manuscript"
-, succeeds =	"ei-ibmrp-96"
-, update =	"97.11 katz"
+, author =      "A. Efrat and A. Itai and M. J. Katz"
+, title =       "Improvements on Bottleneck Matching and Related Problems Using Geometry"
+, year =        1997
+, note =        "Unpublished manuscript"
+, succeeds =    "ei-ibmrp-96"
+, update =      "97.11 katz"
 }
 
 @inproceedings{ek-cfbmg-96
-, author =	"A. Efrat and M. J. Katz"
-, title =	"Computing Fair and Bottleneck Matchings in Geometric Graphs"
-, booktitle =	"Proc. 7th Annu. Internat. Sympos. Algorithms Comput."
-, year =	1996
-, pages =	"115--125"
-, update =	"97.11 katz"
+, author =      "A. Efrat and M. J. Katz"
+, title =       "Computing Fair and Bottleneck Matchings in Geometric Graphs"
+, booktitle =   "Proc. 7th Annu. Internat. Sympos. Algorithms Comput."
+, year =        1996
+, pages =       "115--125"
+, update =      "97.11 katz"
 }
 
 @unpublished{ek-ebmhd-97
-, author =	"A. Efrat and M. J. Katz"
-, title =	"Euclidean Bottleneck Matching in Higher Dimensions"
-, year =	1997
-, note =	"Unpublished manuscript"
-, update =	"97.11 katz"
+, author =      "A. Efrat and M. J. Katz"
+, title =       "Euclidean Bottleneck Matching in Higher Dimensions"
+, year =        1997
+, note =        "Unpublished manuscript"
+, update =      "97.11 katz"
 }
 
 @inproceedings{ekns-ddsfo-97
-, author =	"A. Efrat and M. J. Katz and F. Nielsen and M. Sharir"
-, title =	"Dynamic Data Structures for Fat Objects and Their Applications"
-, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
-, nickname =	"WADS '97"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1272
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"297--306"
-, precedes =	"ekns-ddsfo-00"
-, update =	"00.03 smid, 98.03 bibrelex+mitchell, 97.11 katz, 97.07 agarwal"
+, author =      "A. Efrat and M. J. Katz and F. Nielsen and M. Sharir"
+, title =       "Dynamic Data Structures for Fat Objects and Their Applications"
+, booktitle =   "Proc. 5th Workshop Algorithms Data Struct."
+, nickname =    "WADS '97"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1272
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "297--306"
+, precedes =    "ekns-ddsfo-00"
+, update =      "00.03 smid, 98.03 bibrelex+mitchell, 97.11 katz, 97.07 agarwal"
 }
 
 @article{ekns-ddsfo-00
-, author =	"A. Efrat and M. J. Katz and F. Nielsen and M. Sharir"
-, title =	"Dynamic data structures for fat objects and their applications"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	15
-, year =	2000
-, pages =	"215--227"
-, succeeds =	"ekns-ddsfo-97"
-, update =	"00.03 smid"
+, author =      "A. Efrat and M. J. Katz and F. Nielsen and M. Sharir"
+, title =       "Dynamic data structures for fat objects and their applications"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      15
+, year =        2000
+, pages =       "215--227"
+, succeeds =    "ekns-ddsfo-97"
+, update =      "00.03 smid"
 }
 
 @inproceedings{els-fmcsh-93
-, author =	"A. Efrat and M. Lindenbaum and Micha Sharir"
-, title =	"Finding maximally consistent sets of halfspaces"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"432--436"
-, cites =	"boo-dspir-91, bklo-gasra-87, ce-oails-92, cs-arscg-89, csy-khrp-87, dk-fdpi-83, e-acg-87, ew-cbtda-86, eg-siruc-93, es-blbda-93t, lb-rpdcd-, m-lpltw-84, m-fppa-90, m-lavd-91, o-olafs-81, pss-ubnpk-92, s-ksacs-91, sd-ddcps-91, w-mksfs-86, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 94.01 matousek, 93.09 milone+mitchell"
+, author =      "A. Efrat and M. Lindenbaum and Micha Sharir"
+, title =       "Finding maximally consistent sets of halfspaces"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "432--436"
+, cites =       "boo-dspir-91, bklo-gasra-87, ce-oails-92, cs-arscg-89, csy-khrp-87, dk-fdpi-83, e-acg-87, ew-cbtda-86, eg-siruc-93, es-blbda-93t, lb-rpdcd-, m-lpltw-84, m-fppa-90, m-lavd-91, o-olafs-81, pss-ubnpk-92, s-ksacs-91, sd-ddcps-91, w-mksfs-86, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 94.01 matousek, 93.09 milone+mitchell"
 }
 
 @techreport{ers-ufwsc-
-, author =	"A. Efrat and G{\"u}nter Rote and Micha Sharir"
-, title =	"On the union of fat wedges and separating a collection of segments by a line"
-, type =	"manuscript"
-, precedes =	"ers-ufwsc-93a, ers-ufwsc-93b"
-, update =	"98.11 bibrelex"
+, author =      "A. Efrat and G{\"u}nter Rote and Micha Sharir"
+, title =       "On the union of fat wedges and separating a collection of segments by a line"
+, type =        "manuscript"
+, precedes =    "ers-ufwsc-93a, ers-ufwsc-93b"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ers-ufwsc-93a
-, author =	"A. Efrat and G{\"u}nter Rote and Micha Sharir"
-, title =	"On the union of fat wedges and separating a collection of segments by a line"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"115--120"
-, succeeds =	"ers-ufwsc-"
-, precedes =	"ers-ufwsc-93b"
-, cites =	"afkmnsu-ampcb-90, abp-oabcu-90, ce-oails-92, cs-arscg-89, e-acg-87, egs-ccmfa-90, es-blbda-93, fmp-csua-90, go-nhpcg-93t, gm-osacv-91, h-fuenl-89, k-fpfcu-93t, ms-ericu-91, m-fppa-90, mpssw-ftdlm-94, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex, 97.03 rote, 96.09 devillers, 94.05 sharir, 93.09 milone+mitchell+rote"
+, author =      "A. Efrat and G{\"u}nter Rote and Micha Sharir"
+, title =       "On the union of fat wedges and separating a collection of segments by a line"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "115--120"
+, succeeds =    "ers-ufwsc-"
+, precedes =    "ers-ufwsc-93b"
+, cites =       "afkmnsu-ampcb-90, abp-oabcu-90, ce-oails-92, cs-arscg-89, e-acg-87, egs-ccmfa-90, es-blbda-93, fmp-csua-90, go-nhpcg-93t, gm-osacv-91, h-fuenl-89, k-fpfcu-93t, ms-ericu-91, m-fppa-90, mpssw-ftdlm-94, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex, 97.03 rote, 96.09 devillers, 94.05 sharir, 93.09 milone+mitchell+rote"
 }
 
 @article{ers-ufwsc-93b
-, author =	"A. Efrat and G{\"u}nter Rote and Micha Sharir"
-, title =	"On the union of fat wedges and separating a collection of segments by a line"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"277--288"
-, succeeds =	"ers-ufwsc-93a, ers-ufwsc-"
-, cites =	"mpssw-ftdlm-94"
-, update =	"98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex, 97.03 rote"
-, abstract =	"We call a line $l$ a separator for a set $S$ of objects in
-		the plane if $l$ avoids all the objects and
-		partitions $S$ into two nonempty subsets, one consisting
-		of objects lying above $l$ and the
-		other of objects lying below $l$. We present an
-		$O(n log n)$-time algorithm for
-		finding a separator line for a set of $n$ segments, provided
-		the ratio between the diameter of the set of segments and
-		the length of the smallest segment is bounded.
-		No subquadratic algorithms are known for the general case.
-		Our algorithm is based on the recent results of
-		Matousek, Pach, Sharir, Sifrony, and Welzl (1994) concerning
-		the union of fat triangles, but we also include an analysis
-		which improves the bounds obtained by Matousek et al."
+, author =      "A. Efrat and G{\"u}nter Rote and Micha Sharir"
+, title =       "On the union of fat wedges and separating a collection of segments by a line"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "277--288"
+, succeeds =    "ers-ufwsc-93a, ers-ufwsc-"
+, cites =       "mpssw-ftdlm-94"
+, update =      "98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex, 97.03 rote"
+, abstract =    "We call a line $l$ a separator for a set $S$ of objects in
+                the plane if $l$ avoids all the objects and
+                partitions $S$ into two nonempty subsets, one consisting
+                of objects lying above $l$ and the
+                other of objects lying below $l$. We present an
+                $O(n log n)$-time algorithm for
+                finding a separator line for a set of $n$ segments, provided
+                the ratio between the diameter of the set of segments and
+                the length of the smallest segment is bounded.
+                No subquadratic algorithms are known for the general case.
+                Our algorithm is based on the recent results of
+                Matousek, Pach, Sharir, Sifrony, and Welzl (1994) concerning
+                the union of fat triangles, but we also include an analysis
+                which improves the bounds obtained by Matousek et al."
 }
 
 @inproceedings{es-nlaps-94
-, author =	"A. Efrat and Micha Sharir"
-, title =	"A near-linear algorithm for the planar segment center problem"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"87--97"
-, update =	"98.03 mitchell, 94.05 sharir"
+, author =      "A. Efrat and Micha Sharir"
+, title =       "A near-linear algorithm for the planar segment center problem"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "87--97"
+, update =      "98.03 mitchell, 94.05 sharir"
 }
 
 @article{es-nlaps-96
-, author =	"A. Efrat and Micha Sharir"
-, title =	"A near-linear algorithm for the planar segment center problem"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, year =	1996
-, pages =	"239--257"
-, update =	"98.03 mitchell, 97.03 agarwal"
+, author =      "A. Efrat and Micha Sharir"
+, title =       "A near-linear algorithm for the planar segment center problem"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, year =        1996
+, pages =       "239--257"
+, update =      "98.03 mitchell, 97.03 agarwal"
 }
 
 @inproceedings{es-cufop-97
-, author =	"A. Efrat and M. Sharir"
-, title =	"On the Complexity of the Union of Fat Objects in the Plane"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"104--112"
-, cites =	"aks-cdorp-95, cs-arscg-89, esz-cskec-94, hs-atubs-95, k-3vrs2-??, kos-ehsro-92, klps-ujrcf-86, lps-ctc-95, mpssw-ftdlm-94, ps-rivbu-97, s-ksacs-91, s-atubl-94, s-mpafo-94, k-fpfcu-93, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "A. Efrat and M. Sharir"
+, title =       "On the Complexity of the Union of Fat Objects in the Plane"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "104--112"
+, cites =       "aks-cdorp-95, cs-arscg-89, esz-cskec-94, hs-atubs-95, k-3vrs2-??, kos-ehsro-92, klps-ujrcf-86, lps-ctc-95, mpssw-ftdlm-94, ps-rivbu-97, s-ksacs-91, s-atubl-94, s-mpafo-94, k-fpfcu-93, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @article{es-cufop-00
-, author =	"A. Efrat and M. Sharir"
-, title =	"On the Complexity of the Union of Fat Objects in the Plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	23
-, year =	2000
-, pages =	"171--189"
-, update =	"01.07 orourke"
+, author =      "A. Efrat and M. Sharir"
+, title =       "On the Complexity of the Union of Fat Objects in the Plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      23
+, year =        2000
+, pages =       "171--189"
+, update =      "01.07 orourke"
 }
 
 @techreport{esz-cskec-93t
-, author =	"A. Efrat and Micha Sharir and A. Ziv"
-, title =	"Computing the Smallest $k$-Enclosing Circle and Related Problems"
-, type =	"Report"
-, number =	"CIS-9309"
-, institution =	"Faculty of Computer Science, Technion - IIT"
-, address =	"Haifa, Israel"
-, year =	1993
-, update =	"98.03 mitchell, 93.05 efrat"
+, author =      "A. Efrat and Micha Sharir and A. Ziv"
+, title =       "Computing the Smallest $k$-Enclosing Circle and Related Problems"
+, type =        "Report"
+, number =      "CIS-9309"
+, institution = "Faculty of Computer Science, Technion - IIT"
+, address =     "Haifa, Israel"
+, year =        1993
+, update =      "98.03 mitchell, 93.05 efrat"
 }
 
 @inproceedings{esz-cskec-93i
-, author =	"A. Efrat and Micha Sharir and A. Ziv"
-, title =	"Computing the Smallest $k$-Enclosing Circle and Related Problems"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"325--336"
-, precedes =	"esz-cskec-94"
-, update =	"98.03 mitchell, 96.09 agarwal+devillers, 96.05 agarwal, 93.09 smid, 93.05 jones"
+, author =      "A. Efrat and Micha Sharir and A. Ziv"
+, title =       "Computing the Smallest $k$-Enclosing Circle and Related Problems"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "325--336"
+, precedes =    "esz-cskec-94"
+, update =      "98.03 mitchell, 96.09 agarwal+devillers, 96.05 agarwal, 93.09 smid, 93.05 jones"
 }
 
 @article{esz-cskec-94
-, author =	"A. Efrat and Micha Sharir and A. Ziv"
-, title =	"Computing the Smallest $k$-Enclosing Circle and Related Problems"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"119--136"
-, succeeds =	"esz-cskec-93i"
-, update =	"98.03 mitchell, 96.09 devillers"
+, author =      "A. Efrat and Micha Sharir and A. Ziv"
+, title =       "Computing the Smallest $k$-Enclosing Circle and Related Problems"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "119--136"
+, succeeds =    "esz-cskec-93i"
+, update =      "98.03 mitchell, 96.09 devillers"
 }
 
 @article{e-chrsp-65
-, author =	"B. Efron"
-, title =	"The convex hull of a random set of points"
-, journal =	"Biometrika"
-, volume =	52
-, number =	3
-, year =	1965
-, pages =	"331--343"
+, author =      "B. Efron"
+, title =       "The convex hull of a random set of points"
+, journal =     "Biometrika"
+, volume =      52
+, number =      3
+, year =        1965
+, pages =       "331--343"
 }
 
 @article{e-ptnna-67
-, author =	"B. Efron"
-, title =	"The problem of the two nearest neighbors (abstract)"
-, journal =	"Ann. Math. Statist."
-, volume =	38
-, year =	1967
-, pages =	298
+, author =      "B. Efron"
+, title =       "The problem of the two nearest neighbors (abstract)"
+, journal =     "Ann. Math. Statist."
+, volume =      38
+, year =        1967
+, pages =       298
 }
 
 @article{eg-cipsc-96
-, author =	"{\"O}. E{\u{g}}ecio{\u{g}}lu and T. Gonzalez"
-, title =	"A computationally intractable problem on simplicial complexes"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"85--98"
-, update =	"97.07 devillers"
+, author =      "{\"O}. E{\u{g}}ecio{\u{g}}lu and T. Gonzalez"
+, title =       "A computationally intractable problem on simplicial complexes"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "85--98"
+, update =      "97.07 devillers"
 }
 
 @article{ek-adspe-89
-, author =	"O. Egecioglu and B. Kalantari"
-, title =	"Approximating the diameter of a set of points in the {Euclidean} space"
-, journal =	"Inform. Process. Lett."
-, volume =	32
-, year =	1989
-, pages =	"205--211"
-, keywords =	"approximation, diameter, points, $d$-dimensional"
-, update =	"95.09 korneenko"
+, author =      "O. Egecioglu and B. Kalantari"
+, title =       "Approximating the diameter of a set of points in the {Euclidean} space"
+, journal =     "Inform. Process. Lett."
+, volume =      32
+, year =        1989
+, pages =       "205--211"
+, keywords =    "approximation, diameter, points, $d$-dimensional"
+, update =      "95.09 korneenko"
 }
 
 @article{esb-agtuo-95
-, author =	"D. Eggert and L. Stark and K. Bowyer"
-, title =	"Aspect graphs and their use in object recognition"
-, journal =	"Ann. Math. Artif. Intell."
-, volume =	13
-, year =	1995
-, pages =	"347--376"
-, keywords =	"matching, shape recognition, vision"
-, update =	"98.07 bibrelex, 95.09 mitchell"
+, author =      "D. Eggert and L. Stark and K. Bowyer"
+, title =       "Aspect graphs and their use in object recognition"
+, journal =     "Ann. Math. Artif. Intell."
+, volume =      13
+, year =        1995
+, pages =       "347--376"
+, keywords =    "matching, shape recognition, vision"
+, update =      "98.07 bibrelex, 95.09 mitchell"
 }
 
 @book{e-c-58
-, author =	"H. G. Eggleston"
-, title =	"Convexity"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge, England"
-, year =	1958
+, author =      "H. G. Eggleston"
+, title =       "Convexity"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge, England"
+, year =        1958
 }
 
 @article{e-rdg-86
-, author =	"R. B. Eggleton"
-, title =	"Rectilinear Drawings of Graphs"
-, journal =	"Utilitas Math."
-, volume =	29
-, year =	1986
-, pages =	"146--172"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. B. Eggleton"
+, title =       "Rectilinear Drawings of Graphs"
+, journal =     "Utilitas Math."
+, volume =      29
+, year =        1986
+, pages =       "146--172"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{ek-iodc-90
-, author =	"V. M. Egorov and E. G. Kostov"
-, title =	"Integrated optical digital computers"
-, journal =	"Appl. Optics"
-, volume =	29
-, number =	8
-, year =	1990
-, pages =	"1178--1185"
-, update =	"98.03 bibrelex"
+, author =      "V. M. Egorov and E. G. Kostov"
+, title =       "Integrated optical digital computers"
+, journal =     "Appl. Optics"
+, volume =      29
+, number =      8
+, year =        1990
+, pages =       "1178--1185"
+, update =      "98.03 bibrelex"
 }
 
 @article{e-hsrpc-88
-, author =	"P. Egyed"
-, title =	"Hidden-surface removal in polyhedral cross-sections"
-, journal =	"Visual Comput."
-, volume =	3
-, year =	1988
-, pages =	"329--343"
-, keywords =	"hidden line/surface elimination"
-, succeeds =	"e-trpah-88"
+, author =      "P. Egyed"
+, title =       "Hidden-surface removal in polyhedral cross-sections"
+, journal =     "Visual Comput."
+, volume =      3
+, year =        1988
+, pages =       "329--343"
+, keywords =    "hidden line/surface elimination"
+, succeeds =    "e-trpah-88"
 }
 
 @inproceedings{e-trpah-88
-, author =	"P. Egyed"
-, title =	"Theoretical results on the priority approach to hidden-surface removal"
-, booktitle =	"Proc. Graphics Interface '88"
-, year =	1988
-, pages =	"236--245"
-, precedes =	"e-hsrpc-88"
+, author =      "P. Egyed"
+, title =       "Theoretical results on the priority approach to hidden-surface removal"
+, booktitle =   "Proc. Graphics Interface '88"
+, year =        1988
+, pages =       "236--245"
+, precedes =    "e-hsrpc-88"
 }
 
 @inproceedings{ew-ospdc-89
-, author =	"P. Egyed and R. Wenger"
-, title =	"Ordered stabbing of pairwise disjoint convex sets in linear time"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	23
-, succeeds =	"ew-ospdc-91"
-, update =	"95.09 korneenko"
+, author =      "P. Egyed and R. Wenger"
+, title =       "Ordered stabbing of pairwise disjoint convex sets in linear time"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       23
+, succeeds =    "ew-ospdc-91"
+, update =      "95.09 korneenko"
 }
 
 @article{ew-ospdc-91
-, author =	"P. Egyed and R. Wenger"
-, title =	"Ordered stabbing of pairwise disjoint convex sets in linear time"
-, journal =	"Discrete Appl. Math."
-, volume =	31
-, number =	2
-, year =	1991
-, pages =	"133--140"
-, keywords =	"stabbing convex line transversal"
-, precedes =	"ew-ospdc-89"
-, update =	"95.09 korneenko"
+, author =      "P. Egyed and R. Wenger"
+, title =       "Ordered stabbing of pairwise disjoint convex sets in linear time"
+, journal =     "Discrete Appl. Math."
+, volume =      31
+, number =      2
+, year =        1991
+, pages =       "133--140"
+, keywords =    "stabbing convex line transversal"
+, precedes =    "ew-ospdc-89"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{ew-spdtl-89
-, author =	"P. Egyed and R. Wenger"
-, title =	"Stabbing pairwise-disjoint translates in linear time"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"364--369"
-, cites =	"ahu-daca-74, ab-eact-87, ad-ahdsp-87, arw-lbls-89, d-ltatt-84, e-ftssg-85, e-acg-87, egs-ueplf-87, emprww-sls-82, es-mnwsn-87, hdk-cgp-64, h-fuenl-89, k-cgct-86, kll-gpct-86, kll-gpdt-87, klz-gpcs-85, ks-upcha-86, l-tcctc-80, m-ltalp-83, m-lpltw-84, o-olafs-81, ps-cgi-85, s-ossac-86, t-pgcct-89, w-ghtti-90, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "P. Egyed and R. Wenger"
+, title =       "Stabbing pairwise-disjoint translates in linear time"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "364--369"
+, cites =       "ahu-daca-74, ab-eact-87, ad-ahdsp-87, arw-lbls-89, d-ltatt-84, e-ftssg-85, e-acg-87, egs-ueplf-87, emprww-sls-82, es-mnwsn-87, hdk-cgp-64, h-fuenl-89, k-cgct-86, kll-gpct-86, kll-gpdt-87, klz-gpcs-85, ks-upcha-86, l-tcctc-80, m-ltalp-83, m-lpltw-84, o-olafs-81, ps-cgi-85, s-ossac-86, t-pgcct-89, w-ghtti-90, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{e-sap-80
-, author =	"E. Ehrhart"
-, title =	"Solution to Advanced Problems"
-, journal =	"Amer. Math. Monthly"
-, volume =	87
-, number =	10
-, month =	dec
-, year =	1980
-, pages =	826
-, update =	"98.11 bibrelex"
+, author =      "E. Ehrhart"
+, title =       "Solution to Advanced Problems"
+, journal =     "Amer. Math. Monthly"
+, volume =      87
+, number =      10
+, month =       dec
+, year =        1980
+, pages =       826
+, update =      "98.11 bibrelex"
 }
 
 @article{eet-igcp-76
-, author =	"C. Ehrlich and S. Even and R. E. Tarjan"
-, title =	"Intersection graphs of curves in the plane"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	21
-, number =	1
-, year =	1976
-, pages =	"8--20"
-, keywords =	"intersection graph, curves, graph"
-, update =	"95.09 korneenko"
+, author =      "C. Ehrlich and S. Even and R. E. Tarjan"
+, title =       "Intersection graphs of curves in the plane"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      21
+, number =      1
+, year =        1976
+, pages =       "8--20"
+, keywords =    "intersection graph, curves, graph"
+, update =      "95.09 korneenko"
 }
 
 @article{ei-drmwc-79
-, author =	"P. E. Ehrlich and H.-C. {Im Hof}"
-, title =	"Dirichlet regions in manifolds without conjugate points"
-, journal =	"Comment. Math. Helvetici"
-, volume =	54
-, year =	1979
-, pages =	"642--658"
-, update =	"94.09 bernal"
+, author =      "P. E. Ehrlich and H.-C. {Im Hof}"
+, title =       "Dirichlet regions in manifolds without conjugate points"
+, journal =     "Comment. Math. Helvetici"
+, volume =      54
+, year =        1979
+, pages =       "642--658"
+, update =      "94.09 bernal"
 }
 
 @article{ek-iatdp-89
-, author =	"N. Eichhorn and H. Kieselwetter"
-, title =	"{INTEGER} analysis of two-dimensional polygonal objects"
-, journal =	"Computing"
-, volume =	42
-, number =	1
-, year =	1989
-, pages =	"1--16"
-, update =	"95.09 korneenko"
+, author =      "N. Eichhorn and H. Kieselwetter"
+, title =       "{INTEGER} analysis of two-dimensional polygonal objects"
+, journal =     "Computing"
+, volume =      42
+, number =      1
+, year =        1989
+, pages =       "1--16"
+, update =      "95.09 korneenko"
 }
 
 @article{ed-copht-83
-, author =	"G. Eichman and B. Z. Dong"
-, title =	"Coherent optical production of the {Hough} Transform"
-, journal =	"Appl. Optics"
-, volume =	22
-, number =	6
-, year =	1983
-, pages =	"830--834"
-, update =	"97.11 bibrelex"
+, author =      "G. Eichman and B. Z. Dong"
+, title =       "Coherent optical production of the {Hough} Transform"
+, journal =     "Appl. Optics"
+, volume =      22
+, number =      6
+, year =        1983
+, pages =       "830--834"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{e-sifd-94
-, author =	"Paul H. C. Eilers"
-, title =	"Smoothing and Interpolation with Finite Differences"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"241--250"
-, keywords =	"data smoothing, curve smoothing"
-, update =	"94.09 heckbert"
-, annote =	"Gives simple techniques for smoothing a set of uniformly
+, author =      "Paul H. C. Eilers"
+, title =       "Smoothing and Interpolation with Finite Differences"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "241--250"
+, keywords =    "data smoothing, curve smoothing"
+, update =      "94.09 heckbert"
+, annote =      "Gives simple techniques for smoothing a set of uniformly
 spaced samples. This can be used to remove noise from input data. Contains C
 code."
 }
 
 @article{ea--93
-, author =	"F. Eisenhaber and P. J. Argos"
-, title =	"??"
-, journal =	"J. Comp. Chem."
-, volume =	14
-, number =	11
-, year =	1993
-, pages =	"1272--1280"
-, update =	"98.03 bibrelex"
+, author =      "F. Eisenhaber and P. J. Argos"
+, title =       "??"
+, journal =     "J. Comp. Chem."
+, volume =      14
+, number =      11
+, year =        1993
+, pages =       "1272--1280"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{e-vasud-93
-, author =	"Rudolf Eisenst{\"o}ck"
-, title =	"Visualization of Algebraic Surfaces Using the {Dexel} Model"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"48--51"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Rudolf Eisenst{\"o}ck"
+, title =       "Visualization of Algebraic Surfaces Using the {Dexel} Model"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "48--51"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @article{es-mters-76
-, author =	"M. Eisner and D. Severance"
-, title =	"Mathematical techniques for efficient record segmentation in large shared databases"
-, journal =	"J. ACM"
-, volume =	23
-, year =	1976
-, pages =	"619--635"
-, update =	"96.05 agarwal"
+, author =      "M. Eisner and D. Severance"
+, title =       "Mathematical techniques for efficient record segmentation in large shared databases"
+, journal =     "J. ACM"
+, volume =      23
+, year =        1976
+, pages =       "619--635"
+, update =      "96.05 agarwal"
 }
 
 @incollection{e-fli-94
-, author =	"Steven Eker"
-, title =	"Faster Linear Interpolation"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"526--533"
-, keywords =	"line drawing, Gouraud shading, integer arithmetic, image resampling"
-, update =	"94.09 heckbert"
-, annote =	"Gives optimized code for generic linear interpolation.
+, author =      "Steven Eker"
+, title =       "Faster Linear Interpolation"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "526--533"
+, keywords =    "line drawing, Gouraud shading, integer arithmetic, image resampling"
+, update =      "94.09 heckbert"
+, annote =      "Gives optimized code for generic linear interpolation.
 This is most useful for assembler language programming of graphics
 operations such as Gouraud shading and image scaling. Contains C code."
 }
 
 @inproceedings{ehlmrw-ddbg-93
-, author =	"H. El-Gindy and M. Houle and W. Lenhart and Miller and D. Rappaport and S. Whitesides"
-, title =	"Dominance drawings of bipartite graphs"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"187--191"
-, cites =	"bcdtt-hdspd-92, bl-tcopi-76, dm-pos-41, et-adgab-89, g-agtpg-80, h-dpos-51, k-vrrpd-75, k-3ipos-77, ple-togip-71, t-dapsg, dtt-arsdp-92, y-cpodp-82, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "H. El-Gindy and M. Houle and W. Lenhart and Miller and D. Rappaport and S. Whitesides"
+, title =       "Dominance drawings of bipartite graphs"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "187--191"
+, cites =       "bcdtt-hdspd-92, bl-tcopi-76, dm-pos-41, et-adgab-89, g-agtpg-80, h-dpos-51, k-vrrpd-75, k-3ipos-77, ple-togip-71, t-dapsg, dtt-arsdp-92, y-cpodp-82, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{ev-tspve-98
-, author =	"J. El-Sana and A. Varshney"
-, title =	"Topology Simplification for Polygonal Virtual Environments"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	4
-, number =	2
-, month =	apr
-, year =	1998
-, pages =	"133--144"
-, update =	"98.11 held"
+, author =      "J. El-Sana and A. Varshney"
+, title =       "Topology Simplification for Polygonal Virtual Environments"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      4
+, number =      2
+, month =       apr
+, year =        1998
+, pages =       "133--144"
+, update =      "98.11 held"
 }
 
 @article{es-cvdpu-90
-, author =	"M. Elbaz and J.-C. Spehner"
-, title =	"Construction of {Voronoi} Diagrams in the Plane by using Maps"
-, journal =	"Theoret. Comput. Sci."
-, volume =	77
-, number =	3
-, year =	1990
-, pages =	"331--343"
-, annote =	"Basic d\&c algorithm for DT ala Guibas Stolfi. Only
-		 difference is that it uses DCEL as data structure (it
-		 calls this maps), and omits diagonals in cyclic
-		 quads."
-, abstract =	"An algorithm by Guibas and Stolfi (1985) constructs,
-		 for a finite set S of n sites in the plane, a
-		 triangulation T(S) of S that strictly refines the
-		 Delaunay diagram Del(S) when there exists a circle
-		 passing through at least four points of S and none of
-		 the sites is contained in its interior. For this
-		 triangulation T(S) there exist isometries T such that
-		 T(T(S)) does not equal T(T(S). The Voronoi diagram
-		 Vor(S) is the straight-line dual of Del(S) and the
-		 substitution of T(S) into Del(S) leads to needless
-		 calculus, indeed to the creation of imaginary vertices
-		 for Vor(S). We present here a variant of the Guibas and
-		 Stolfi algorithm that determines, with the same
-		 complexity, Del(S) and not a triangulation, and uses a
-		 simpler data structure. We also give approximation
-		 tests of collinearity and cocircularity so that for any
-		 similitude T of the plane, Del(T(S)) equals T(Del(S)).
-		 (Author abstract) 15 Refs."
+, author =      "M. Elbaz and J.-C. Spehner"
+, title =       "Construction of {Voronoi} Diagrams in the Plane by using Maps"
+, journal =     "Theoret. Comput. Sci."
+, volume =      77
+, number =      3
+, year =        1990
+, pages =       "331--343"
+, annote =      "Basic d\&c algorithm for DT ala Guibas Stolfi. Only
+                 difference is that it uses DCEL as data structure (it
+                 calls this maps), and omits diagonals in cyclic
+                 quads."
+, abstract =    "An algorithm by Guibas and Stolfi (1985) constructs,
+                 for a finite set S of n sites in the plane, a
+                 triangulation T(S) of S that strictly refines the
+                 Delaunay diagram Del(S) when there exists a circle
+                 passing through at least four points of S and none of
+                 the sites is contained in its interior. For this
+                 triangulation T(S) there exist isometries T such that
+                 T(T(S)) does not equal T(T(S). The Voronoi diagram
+                 Vor(S) is the straight-line dual of Del(S) and the
+                 substitution of T(S) into Del(S) leads to needless
+                 calculus, indeed to the creation of imaginary vertices
+                 for Vor(S). We present here a variant of the Guibas and
+                 Stolfi algorithm that determines, with the same
+                 complexity, Del(S) and not a triangulation, and uses a
+                 simpler data structure. We also give approximation
+                 tests of collinearity and cocircularity so that for any
+                 similitude T of the plane, Del(T(S)) equals T(Del(S)).
+                 (Author abstract) 15 Refs."
 }
 
 @article{ec-ebvdo-91
-, author =	"G. Elber and E. Cohen"
-, title =	"Error bounded variable distance offset operator for free form curves and surfaces"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	1
-, year =	1991
-, pages =	"67--78"
-, keywords =	"curve, surface, NURBS, offset"
+, author =      "G. Elber and E. Cohen"
+, title =       "Error bounded variable distance offset operator for free form curves and surfaces"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      1
+, year =        1991
+, pages =       "67--78"
+, keywords =    "curve, surface, NURBS, offset"
 }
 
 @techreport{ek-bsfrs-96
-, author =	"G. Elber and M. S. Kim"
-, title =	"The bisector surface of freedom rational space curves"
-, type =	"Technical {Report}"
-, number =	"CIS 9619"
-, institution =	"Dept. Comput. Sci., Technion"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "G. Elber and M. S. Kim"
+, title =       "The bisector surface of freedom rational space curves"
+, type =        "Technical {Report}"
+, number =      "CIS 9619"
+, institution = "Dept. Comput. Sci., Technion"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ek-bsfrs-97
-, author =	"G. Elber and M.-S. Kim"
-, title =	"The Bisector Surface of Freeform Rational Space Curves"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"473--474"
-, keywords =	"video review"
-, cites =	"dh-ssco-93, ek-bsfrs-96, fj-bpppc-94, fj-cpccc-94, h-dpsi-90, hv-eescs-91, -i6um-96, spb-amat3-96, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "G. Elber and M.-S. Kim"
+, title =       "The Bisector Surface of Freeform Rational Space Curves"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "473--474"
+, keywords =    "video review"
+, cites =       "dh-ssco-93, ek-bsfrs-96, fj-bpppc-94, fj-cpccc-94, h-dpsi-90, hv-eescs-91, -i6um-96, spb-amat3-96, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{e-giccv-86
-, author =	"G. Elekes"
-, title =	"A geometric inequality and the complexity of computing the volume"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"289--292"
-, keywords =	"approximation, volume, convex"
+, author =      "G. Elekes"
+, title =       "A geometric inequality and the complexity of computing the volume"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "289--292"
+, keywords =    "approximation, volume, convex"
 }
 
 @article{e-nppcd-84
-, author =	"G. Elekes"
-, title =	"$N$ points in the plane can determine $n^3/2$ unit circles"
-, journal =	"Combinatorica"
-, volume =	4
-, number =	"2--3"
-, year =	1984
-, pages =	131
-, keywords =	"points, circle, combinatorial geometry"
-, update =	"95.09 korneenko"
+, author =      "G. Elekes"
+, title =       "$N$ points in the plane can determine $n^3/2$ unit circles"
+, journal =     "Combinatorica"
+, volume =      4
+, number =      "2--3"
+, year =        1984
+, pages =       131
+, keywords =    "points, circle, combinatorial geometry"
+, update =      "95.09 korneenko"
 }
 
 @incollection{ee-scpg-94
-, author =	"G. Elekes and P. Erd{\H o}s"
-, title =	"Similar configurations and pseudo grids"
-, booktitle =	"Intuitive Geometry"
-, series =	"Colloq. MAth. Sco. Janos Bolyai"
-, volume =	63
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1994
-, pages =	"85--104"
-, update =	"98.07 bibrelex"
+, author =      "G. Elekes and P. Erd{\H o}s"
+, title =       "Similar configurations and pseudo grids"
+, booktitle =   "Intuitive Geometry"
+, series =      "Colloq. MAth. Sco. Janos Bolyai"
+, volume =      63
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1994
+, pages =       "85--104"
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{ee-scpps-
-, author =	"G. Elekes and P. Erd{\H o}s"
-, title =	"Similar Configurations in Planar Point Sets"
-, note =	"?"
-, update =	"97.11 bibrelex"
+, author =      "G. Elekes and P. Erd{\H o}s"
+, title =       "Similar Configurations in Planar Point Sets"
+, note =        "?"
+, update =      "97.11 bibrelex"
 }
 
 @article{e-cutm-79
-, author =	"M. H. Elfick"
-, title =	"Contouring by Use of a Triangular Mesh"
-, journal =	"The Cartographic Journal"
-, volume =	16
-, number =	1
-, year =	1979
-, pages =	"24--29"
-, annote =	"DT by circumcircle algorithm. Points are ordered by
-		 $x$ coordinate to limit search. Forced edges are dealt
-		 with by extra points."
+, author =      "M. H. Elfick"
+, title =       "Contouring by Use of a Triangular Mesh"
+, journal =     "The Cartographic Journal"
+, volume =      16
+, number =      1
+, year =        1979
+, pages =       "24--29"
+, annote =      "DT by circumcircle algorithm. Points are ordered by
+                 $x$ coordinate to limit search. Forced edges are dealt
+                 with by extra points."
 }
 
 @techreport{e-paspp-86
-, author =	"H. ElGindy"
-, title =	"A parallel algorithm for the shortest path problem in monotone polygons"
-, type =	"Report"
-, number =	"MC-CIS-86-49"
-, institution =	"Dept. Comput. Inform. Sci., Univ. Pennsylvania"
-, address =	"Philadelphia, PA"
-, month =	may
-, year =	1986
-, update =	"93.09 held"
+, author =      "H. ElGindy"
+, title =       "A parallel algorithm for the shortest path problem in monotone polygons"
+, type =        "Report"
+, number =      "MC-CIS-86-49"
+, institution = "Dept. Comput. Inform. Sci., Univ. Pennsylvania"
+, address =     "Philadelphia, PA"
+, month =       may
+, year =        1986
+, update =      "93.09 held"
 }
 
 @unpublished{e-patsp-86
-, author =	"H. ElGindy"
-, title =	"A Parallel Algorithm for Triangulating Simplicial Point Sets in Space with Optimal Speed-up"
-, month =	apr
-, year =	1986
-, note =	"(Manuscript)"
-, succeeds =	"e-patsp-86-c"
-, update =	"95.09 korneenko, 93.09 held"
+, author =      "H. ElGindy"
+, title =       "A Parallel Algorithm for Triangulating Simplicial Point Sets in Space with Optimal Speed-up"
+, month =       apr
+, year =        1986
+, note =        "(Manuscript)"
+, succeeds =    "e-patsp-86-c"
+, update =      "95.09 korneenko, 93.09 held"
 }
 
 @inproceedings{e-patsp-86-c
-, author =	"H. ElGindy"
-, title =	"A parallel algorithm for triangulating simplicial point sets in space with optimal speedup"
-, booktitle =	"Proc. 24th Allerton Conf. Commun. Control Comput."
-, year =	1986
-, pages =	"768--776"
-, keywords =	"parallel computations, $3$-dimensional, triangulation"
-, precedes =	"e-patsp-86"
-, update =	"95.09 korneenko"
+, author =      "H. ElGindy"
+, title =       "A parallel algorithm for triangulating simplicial point sets in space with optimal speedup"
+, booktitle =   "Proc. 24th Allerton Conf. Commun. Control Comput."
+, year =        1986
+, pages =       "768--776"
+, keywords =    "parallel computations, $3$-dimensional, triangulation"
+, precedes =    "e-patsp-86"
+, update =      "95.09 korneenko"
 }
 
 @techreport{e-eacwv-84
-, author =	"H. ElGindy"
-, title =	"An efficient algorithm for computing the weak visibility polygon from an edge in simple polygons"
-, type =	"Manuscript"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1984
+, author =      "H. ElGindy"
+, title =       "An efficient algorithm for computing the weak visibility polygon from an edge in simple polygons"
+, type =        "Manuscript"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1984
 }
 
 @article{e-ospat-86
-, author =	"H. ElGindy"
-, title =	"An optimal speedup parallel algorithm for triangulating simplicial point sets in space"
-, journal =	"Internat. J. Parallel Process."
-, volume =	15
-, year =	1986
-, pages =	"389--398"
-, keywords =	"parallel computations, $3$-dimensional, triangulation"
-, update =	"95.09 korneenko"
-, abstract =	"Zbl. Math. Vol. 681 no. 68069"
+, author =      "H. ElGindy"
+, title =       "An optimal speedup parallel algorithm for triangulating simplicial point sets in space"
+, journal =     "Internat. J. Parallel Process."
+, volume =      15
+, year =        1986
+, pages =       "389--398"
+, keywords =    "parallel computations, $3$-dimensional, triangulation"
+, update =      "95.09 korneenko"
+, abstract =    "Zbl. Math. Vol. 681 no. 68069"
 }
 
 @techreport{e-omtch-81
-, author =	"H. ElGindy"
-, title =	"One more time: a convex hull algorithm for simple polygons"
-, type =	"Internal {Report}"
-, number =	""
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1981
-, update =	"94.05 devillers"
+, author =      "H. ElGindy"
+, title =       "One more time: a convex hull algorithm for simple polygons"
+, type =        "Internal {Report}"
+, number =      ""
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1981
+, update =      "94.05 devillers"
 }
 
 @inproceedings{e-opatc-89
-, author =	"H. ElGindy"
-, title =	"Optimal parallel algorithms for triangulating certain classes of polygons"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, year =	1989
-, pages =	"131--135"
-, keywords =	"star-shaped, edge visible, monotone, radially monotone, polygons"
-, update =	"95.09 mitchell"
+, author =      "H. ElGindy"
+, title =       "Optimal parallel algorithms for triangulating certain classes of polygons"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, year =        1989
+, pages =       "131--135"
+, keywords =    "star-shaped, edge visible, monotone, radially monotone, polygons"
+, update =      "95.09 mitchell"
 }
 
 @article{ea-lacvp-81
-, author =	"H. ElGindy and D. Avis"
-, title =	"A linear algorithm for computing the visibility polygon from a point"
-, journal =	"J. Algorithms"
-, volume =	2
-, year =	1981
-, pages =	"186--197"
-, keywords =	"polygons, visibility, visibility graphs"
+, author =      "H. ElGindy and D. Avis"
+, title =       "A linear algorithm for computing the visibility polygon from a point"
+, journal =     "J. Algorithms"
+, volume =      2
+, year =        1981
+, pages =       "186--197"
+, keywords =    "polygons, visibility, visibility graphs"
 }
 
 @article{eat-atdhl-83
-, author =	"H. ElGindy and D. Avis and G. T. Toussaint"
-, title =	"Applications of a two-dimensional hidden-line algorithm to other geometric problems"
-, journal =	"Computing"
-, volume =	31
-, year =	1983
-, pages =	"191--202"
-, keywords =	"visibility, polygons, triangulation, convex hull"
+, author =      "H. ElGindy and D. Avis and G. T. Toussaint"
+, title =       "Applications of a two-dimensional hidden-line algorithm to other geometric problems"
+, journal =     "Computing"
+, volume =      31
+, year =        1983
+, pages =       "191--202"
+, keywords =    "visibility, polygons, triangulation, convex hull"
 }
 
 @techreport{eg-paspp-87
-, author =	"H. ElGindy and M. T. Goodrich"
-, title =	"Parallel algorithms for shortest path problems in polygons"
-, type =	"Report"
-, number =	"MS-CIS-87-20"
-, institution =	"Dept. Comput. Inform. Sci., Univ. Pennsylvania"
-, address =	"Philadelphia, PA"
-, year =	1987
-, precedes =	"eg-paspp-88"
+, author =      "H. ElGindy and M. T. Goodrich"
+, title =       "Parallel algorithms for shortest path problems in polygons"
+, type =        "Report"
+, number =      "MS-CIS-87-20"
+, institution = "Dept. Comput. Inform. Sci., Univ. Pennsylvania"
+, address =     "Philadelphia, PA"
+, year =        1987
+, precedes =    "eg-paspp-88"
 }
 
 @article{eg-paspp-88
-, author =	"H. ElGindy and M. T. Goodrich"
-, title =	"Parallel algorithms for shortest path problems in polygons"
-, journal =	"Visual Comput."
-, volume =	3
-, year =	1988
-, pages =	"371--378"
-, keywords =	"parallel computation, geodesic distance, polygons, simple, divide-and-conquer, two-dimensional"
-, succeeds =	"eg-paspp-87"
+, author =      "H. ElGindy and M. T. Goodrich"
+, title =       "Parallel algorithms for shortest path problems in polygons"
+, journal =     "Visual Comput."
+, volume =      3
+, year =        1988
+, pages =       "371--378"
+, keywords =    "parallel computation, geodesic distance, polygons, simple, divide-and-conquer, two-dimensional"
+, succeeds =    "eg-paspp-87"
 }
 
 @article{ek-eacmp-92
-, author =	"H. ElGindy and J. M. Keil"
-, title =	"Efficient algorithms for the capacitated $1$-median problem"
-, journal =	"ORSA J. Comput."
-, volume =	4
-, number =	4
-, year =	1992
-, pages =	"418--425"
-, update =	"98.03 mitchell, 96.05 agarwal"
-, annote =	"Special issue on computational geometry; J. Mitchell and
+, author =      "H. ElGindy and J. M. Keil"
+, title =       "Efficient algorithms for the capacitated $1$-median problem"
+, journal =     "ORSA J. Comput."
+, volume =      4
+, number =      4
+, year =        1992
+, pages =       "418--425"
+, update =      "98.03 mitchell, 96.05 agarwal"
+, annote =      "Special issue on computational geometry; J. Mitchell and
                   J. Karel Lenstra, eds."
 }
 
 @inproceedings{ellmw-rridg-95
-, author =	"H. ElGindy and G. Liotta and A. Lubiw and H. Meijer and S. H. Whitesides"
-, title =	"Recognizing Rectangle of Influence Drawable Graphs"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"352--363"
-, keywords =	"graph drawing, proximity"
-, update =	"95.01 tamassia"
+, author =      "H. ElGindy and G. Liotta and A. Lubiw and H. Meijer and S. H. Whitesides"
+, title =       "Recognizing Rectangle of Influence Drawable Graphs"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "352--363"
+, keywords =    "graph drawing, proximity"
+, update =      "95.01 tamassia"
 }
 
 @techreport{em-osrqa-91
-, author =	"H. ElGindy and P. Mitra"
-, title =	"Orthogonal shortest route queries among axis parallel rectangular obstacles"
-, number =	"SOCS 91.07"
-, month =	jul
-, year =	1991
-, keywords =	"shortest path, parallel algorithm, computational geometry"
-, precedes =	"em-osrqa-94"
-, update =	"98.11 bibrelex, 96.09 devillers, 93.09 milone+mitchell"
+, author =      "H. ElGindy and P. Mitra"
+, title =       "Orthogonal shortest route queries among axis parallel rectangular obstacles"
+, number =      "SOCS 91.07"
+, month =       jul
+, year =        1991
+, keywords =    "shortest path, parallel algorithm, computational geometry"
+, precedes =    "em-osrqa-94"
+, update =      "98.11 bibrelex, 96.09 devillers, 93.09 milone+mitchell"
 }
 
 @article{em-osrqa-94
-, author =	"H. ElGindy and P. Mitra"
-, title =	"Orthogonal shortest route queries among axis parallel rectangular obstacles"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"3--24"
-, keywords =	"shortest path, parallel algorithm, computational geometry"
-, succeeds =	"em-osrqa-91"
-, update =	"98.11 bibrelex, 98.03 mitchell, 96.09 devillers"
+, author =      "H. ElGindy and P. Mitra"
+, title =       "Orthogonal shortest route queries among axis parallel rectangular obstacles"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "3--24"
+, keywords =    "shortest path, parallel algorithm, computational geometry"
+, succeeds =    "em-osrqa-91"
+, update =      "98.11 bibrelex, 98.03 mitchell, 96.09 devillers"
 }
 
 @inproceedings{et-lvdis-88
-, author =	"H. ElGindy and G. T. Toussaint"
-, title =	"Link {Voronoi} diagrams inside a simple polygon with applications"
-, booktitle =	"Internat. Symp. Math. Progr. Tokyo"
-, year =	1988
-, keywords =	"Voronoi diagram, polygons, link distance"
-, update =	"95.09 korneenko"
+, author =      "H. ElGindy and G. T. Toussaint"
+, title =       "Link {Voronoi} diagrams inside a simple polygon with applications"
+, booktitle =   "Internat. Symp. Math. Progr. Tokyo"
+, year =        1988
+, keywords =    "Voronoi diagram, polygons, link distance"
+, update =      "95.09 korneenko"
 }
 
 @article{et-gpprl-89
-, author =	"Hossam ElGindy and Godfried T. Toussaint"
-, title =	"On geodesic properties of polygons relevant to linear time triangulation"
-, journal =	"Visual Comput."
-, volume =	5
-, number =	"1--2"
-, year =	1989
-, pages =	"68--74"
-, abstract =	"The paper provides a contribution to the problem of
-		 finding optimal (linear time) algorithm for
-		 triangulating simple polygons. Two new classes of
-		 polygons, called palm polygons and crab polygons are
-		 introduced. The class of palm polygons contains many
-		 known classes of polygons for which linear time
-		 triangulation algorithms are known and a linear time
-		 algorithm for triangulating palm polygons is presented.
-		 The class of crab polygons is shown to contain all
-		 classes of polygons for which linear time triangulation
-		 algorithms are known up to now. However, the problem of
-		 linear time identification and triangulation of crab
-		 polygons remains open"
+, author =      "Hossam ElGindy and Godfried T. Toussaint"
+, title =       "On geodesic properties of polygons relevant to linear time triangulation"
+, journal =     "Visual Comput."
+, volume =      5
+, number =      "1--2"
+, year =        1989
+, pages =       "68--74"
+, abstract =    "The paper provides a contribution to the problem of
+                 finding optimal (linear time) algorithm for
+                 triangulating simple polygons. Two new classes of
+                 polygons, called palm polygons and crab polygons are
+                 introduced. The class of palm polygons contains many
+                 known classes of polygons for which linear time
+                 triangulation algorithms are known and a linear time
+                 algorithm for triangulating palm polygons is presented.
+                 The class of crab polygons is shown to contain all
+                 classes of polygons for which linear time triangulation
+                 algorithms are known up to now. However, the problem of
+                 linear time identification and triangulation of crab
+                 polygons remains open"
 }
 
 @incollection{et-tpplt-88
-, author =	"H. ElGindy and G. T. Toussaint"
-, title =	"On triangulating palm polygons in linear time"
-, editor =	"N. Magnenat-Thalmann and D. Thalmann"
-, booktitle =	"New Trends in Computer Graphics"
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"308--317"
-, keywords =	"polygons, triangulation"
-, update =	"97.03 schwarzkopf, 95.09 korneenko"
+, author =      "H. ElGindy and G. T. Toussaint"
+, title =       "On triangulating palm polygons in linear time"
+, editor =      "N. Magnenat-Thalmann and D. Thalmann"
+, booktitle =   "New Trends in Computer Graphics"
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "308--317"
+, keywords =    "polygons, triangulation"
+, update =      "97.03 schwarzkopf, 95.09 korneenko"
 }
 
 @phdthesis{e-hdpa-85
-, author =	"H. A. ElGindy"
-, title =	"Hierarchical Decomposition of Polygons with Applications"
-, school =	"School of Computer Science, McGill University"
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"93.09 milone+mitchell"
+, author =      "H. A. ElGindy"
+, title =       "Hierarchical Decomposition of Polygons with Applications"
+, school =      "School of Computer Science, McGill University"
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "93.09 milone+mitchell"
 }
 
 @incollection{et-crnds-88
-, author =	"H. A. ElGindy and G. T. Toussaint"
-, title =	"Computing the relative neighbor decomposition of a simple polygon"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"53--70"
+, author =      "H. A. ElGindy and G. T. Toussaint"
+, title =       "Computing the relative neighbor decomposition of a simple polygon"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "53--70"
 }
 
 @inproceedings{et-eaide-85
-, author =	"Hossam A. ElGindy and Godfried T. Toussaint"
-, title =	"Efficient Algorithms For Inserting And Deleting Edges From Triangulations"
-, booktitle =	"Proceedings, Foundations of Data Organization."
-, publisher =	"Organizing Committee of the Int Conference on Foundations of Data Organization"
-, address =	"Jpn"
-, year =	1985
-, pages =	"163--169"
-, keywords =	"line segments, triangulations, geometric complexity"
-, abstract =	"We address the problem of edge-updating a
-		 triangulation of a point set efficiently. Given a
-		 suitable representation of the triangulation of a
-		 finite set P, how can one construct a triangulation of
-		 P union left brace 1 right brace for some line segment
-		 1 (insertion problem), or how can one construct a
-		 triangulation of P - left brace p,q right brace where p
-		 and q are points in P that are connected by an edge in
-		 the triangulation (deletion problem). (Author abstract)
-		 13 refs."
+, author =      "Hossam A. ElGindy and Godfried T. Toussaint"
+, title =       "Efficient Algorithms For Inserting And Deleting Edges From Triangulations"
+, booktitle =   "Proceedings, Foundations of Data Organization."
+, publisher =   "Organizing Committee of the Int Conference on Foundations of Data Organization"
+, address =     "Jpn"
+, year =        1985
+, pages =       "163--169"
+, keywords =    "line segments, triangulations, geometric complexity"
+, abstract =    "We address the problem of edge-updating a
+                 triangulation of a point set efficiently. Given a
+                 suitable representation of the triangulation of a
+                 finite set P, how can one construct a triangulation of
+                 P union left brace 1 right brace for some line segment
+                 1 (insertion problem), or how can one construct a
+                 triangulation of P - left brace p,q right brace where p
+                 and q are points in P that are connected by an edge in
+                 the triangulation (deletion problem). (Author abstract)
+                 13 refs."
 }
 
 @inproceedings{et-cut-87
-, author =	"Hossam A. ElGindy and Godfried T. Toussaint"
-, title =	"On Computing and Updating Triangulations"
-, editor =	"S. P. Ghosh and Y. Kanbayashi and K. Tanaka"
-, booktitle =	"Proc. Internat. Conf. Found. Data Organization"
-, publisher =	"Plenum Press"
-, address =	"New York"
-, year =	1987
-, pages =	"249--262"
-, update =	"98.11 bibrelex"
-, annote =	"$O(n \log n)$ algorithm for triangulation of a set of
-		 line segments, and algorithms for inserting and
-		 deleting from a set of line segments."
+, author =      "Hossam A. ElGindy and Godfried T. Toussaint"
+, title =       "On Computing and Updating Triangulations"
+, editor =      "S. P. Ghosh and Y. Kanbayashi and K. Tanaka"
+, booktitle =   "Proc. Internat. Conf. Found. Data Organization"
+, publisher =   "Plenum Press"
+, address =     "New York"
+, year =        1987
+, pages =       "249--262"
+, update =      "98.11 bibrelex"
+, annote =      "$O(n \log n)$ algorithm for triangulation of a set of
+                 line segments, and algorithms for inserting and
+                 deleting from a set of line segments."
 }
 
 @techreport{et-tls-84
-, author =	"H. A. ElGindy and G. T. Toussaint"
-, title =	"On Triangulations of Line Segments"
-, number =	"SOCS 84.9"
-, institution =	"McGill University"
-, year =	1984
-, annote =	"Algorithms for constructing and modifying {\em a\/} triangulation of line segments."
+, author =      "H. A. ElGindy and G. T. Toussaint"
+, title =       "On Triangulations of Line Segments"
+, number =      "SOCS 84.9"
+, institution = "McGill University"
+, year =        1984
+, annote =      "Algorithms for constructing and modifying {\em a\/} triangulation of line segments."
 }
 
 @book{e-cit-88
-, author =	"R. Elliott"
-, title =	"Cast iron technology"
-, publisher =	"Butterworths"
-, address =	"London, UK"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "R. Elliott"
+, title =       "Cast iron technology"
+, publisher =   "Butterworths"
+, address =     "London, UK"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @techreport{el-dssm-??
-, author =	"R. J. Elliott and M. E. Lesk"
-, title =	"Data structures for street maps"
-, year =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "R. J. Elliott and M. E. Lesk"
+, title =       "Data structures for street maps"
+, year =        "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{el-rfsmc-??
-, author =	"R. J. Elliott and M. E. Lesk"
-, title =	"Route finding in street maps by computers and people"
-, year =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "R. J. Elliott and M. E. Lesk"
+, title =       "Route finding in street maps by computers and people"
+, year =        "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{ekltmmv-rcerr-91
-, author =	"J. L. Ellis and G. Kedem and T. C. Lyerly and D. G. Thielman and R. J. Marisa and J. P. Menon and H. B. Voelcker"
-, title =	"The ray casting engine and ray representations: a technical summary"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	4
-, year =	1991
-, pages =	"347--380"
-, keywords =	"mechanical CAD CAM, solid modeling, parallel computation, ray representation"
+, author =      "J. L. Ellis and G. Kedem and T. C. Lyerly and D. G. Thielman and R. J. Marisa and J. P. Menon and H. B. Voelcker"
+, title =       "The ray casting engine and ray representations: a technical summary"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      4
+, year =        1991
+, pages =       "347--380"
+, keywords =    "mechanical CAD CAM, solid modeling, parallel computation, ray representation"
 }
 
 @article{ee-nsnpa-76
-, author =	"J. R. Ellis and M. Eden"
-, title =	"On the number of sides necessary for polygonal approximation of black-and-white figures in a plane"
-, journal =	"Inform. Control"
-, volume =	30
-, year =	1976
-, pages =	"169--186"
-, keywords =	"polygons, fitting"
-, update =	"95.09 korneenko"
+, author =      "J. R. Ellis and M. Eden"
+, title =       "On the number of sides necessary for polygonal approximation of black-and-white figures in a plane"
+, journal =     "Inform. Control"
+, volume =      30
+, year =        1976
+, pages =       "169--186"
+, keywords =    "polygons, fitting"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{e-atdrp-87
-, author =	"R. E. Ellis"
-, title =	"Acquiring tactile data for the recognition of planar objects"
-, booktitle =	"Proc. Internat. Conf. Robots Autom."
-, volume =	3
-, year =	1987
-, pages =	"1799--1805"
-, keywords =	"probing, shape"
-, update =	"95.09 korneenko"
+, author =      "R. E. Ellis"
+, title =       "Acquiring tactile data for the recognition of planar objects"
+, booktitle =   "Proc. Internat. Conf. Robots Autom."
+, volume =      3
+, year =        1987
+, pages =       "1799--1805"
+, keywords =    "probing, shape"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{el-enmrt-92
-, author =	"H. Elter and P. Lienhardt"
-, title =	"Extension of the notion of map for the representation of the topology of cellular complexes"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"65--70"
-, cites =	"adf-gmsou-85, ak-mdspl-89, b-prcv-75, b-rgsdd-89, dl-pmtds-87, e-acg-87, el-ascac-, fp-ebemp-91, fp-cst-90, gs-pmgsc-85, l-sndsn-89, l-tmbrc-91, m-ism-88, ro-sdimp-89i, s-ebrtd-89, s-mmp-91, w-ebdss-85, w-redst-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "H. Elter and P. Lienhardt"
+, title =       "Extension of the notion of map for the representation of the topology of cellular complexes"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "65--70"
+, cites =       "adf-gmsou-85, ak-mdspl-89, b-prcv-75, b-rgsdd-89, dl-pmtds-87, e-acg-87, el-ascac-, fp-ebemp-91, fp-cst-90, gs-pmgsc-85, l-sndsn-89, l-tmbrc-91, m-ism-88, ro-sdimp-89i, s-ebrtd-89, s-mmp-91, w-ebdss-85, w-redst-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{el-ascac-
-, author =	"H. Elter and P. Lienhardt"
-, title =	"Form abstract simplicial complexes to abstract cellular complexes: construction of combinatorial models"
-, type =	"Research {Report}"
-, institution =	"Dept. Comput. Sci., Louis Pasteur Univ."
-, address =	"Strasbourg, France"
-, year =	"??"
-, update =	"98.07 bibrelex"
+, author =      "H. Elter and P. Lienhardt"
+, title =       "Form abstract simplicial complexes to abstract cellular complexes: construction of combinatorial models"
+, type =        "Research {Report}"
+, institution = "Dept. Comput. Sci., Louis Pasteur Univ."
+, address =     "Strasbourg, France"
+, year =        "??"
+, update =      "98.07 bibrelex"
 }
 
 @article{eh-mcsp-72
-, author =	"J. Elzinga and D. Hearn"
-, title =	"The minimum covering sphere problem"
-, journal =	"Manage. Sci."
-, volume =	19
-, year =	1972
-, pages =	"96--104"
-, keywords =	"facility location, optimization, points, sphere"
-, update =	"95.09 korneenko"
+, author =      "J. Elzinga and D. Hearn"
+, title =       "The minimum covering sphere problem"
+, journal =     "Manage. Sci."
+, volume =      19
+, year =        1972
+, pages =       "96--104"
+, keywords =    "facility location, optimization, points, sphere"
+, update =      "95.09 korneenko"
 }
 
 @article{eh-msccp-74
-, author =	"J. Elzinga and D. Hearn"
-, title =	"The minimum sphere covering a convex polyhedron"
-, journal =	"Naval Res. Logist. Quart."
-, volume =	21
-, year =	1974
-, pages =	"715--718"
+, author =      "J. Elzinga and D. Hearn"
+, title =       "The minimum sphere covering a convex polyhedron"
+, journal =     "Naval Res. Logist. Quart."
+, volume =      21
+, year =        1974
+, pages =       "715--718"
 }
 
 @article{eh-gssml-72
-, author =	"J. Elzinga and D. W. Hearn"
-, title =	"Geometrical solutions to some minimax location problems"
-, journal =	"Transp. Sci."
-, volume =	6
-, year =	1972
-, pages =	"379--394"
-, keywords =	"optimization, facility location, minmax"
-, update =	"95.09 korneenko"
+, author =      "J. Elzinga and D. W. Hearn"
+, title =       "Geometrical solutions to some minimax location problems"
+, journal =     "Transp. Sci."
+, volume =      6
+, year =        1972
+, pages =       "379--394"
+, keywords =    "optimization, facility location, minmax"
+, update =      "95.09 korneenko"
 }
 
 @article{e-mccp-15
-, author =	"A. Emch"
-, title =	"On the medians of a closed convex polygon"
-, journal =	"Amer. J. Math."
-, volume =	37
-, year =	1915
-, pages =	"19--28"
-, update =	"98.07 bibrelex"
+, author =      "A. Emch"
+, title =       "On the medians of a closed convex polygon"
+, journal =     "Amer. J. Math."
+, volume =      37
+, year =        1915
+, pages =       "19--28"
+, update =      "98.07 bibrelex"
 }
 
 @article{e-spccc-13
-, author =	"A. Emch"
-, title =	"Some properties of closed convex curves in a plane"
-, journal =	"Amer. J. Math."
-, volume =	35
-, year =	1913
-, pages =	"407--412"
-, update =	"98.07 bibrelex"
+, author =      "A. Emch"
+, title =       "Some properties of closed convex curves in a plane"
+, journal =     "Amer. J. Math."
+, volume =      35
+, year =        1913
+, pages =       "407--412"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{e-anccp-82
-, author =	"P. van {Emde Boas}"
-, title =	"Another {NP}-complete covering problem"
-, type =	"Report"
-, number =	"??"
-, institution =	"Univ. Amsterdam"
-, address =	"Amsterdam, Netherlands"
-, year =	1982
-, update =	"93.09 rote"
+, author =      "P. van {Emde Boas}"
+, title =       "Another {NP}-complete covering problem"
+, type =        "Report"
+, number =      "??"
+, institution = "Univ. Amsterdam"
+, address =     "Amsterdam, Netherlands"
+, year =        1982
+, update =      "93.09 rote"
 }
 
 @article{e-olbch-80
-, author =	"P. van {Emde Boas}"
-, title =	"On the {$\Omega(n \log n)$} lower-bound for convex hull and maximal vector determination"
-, journal =	"Inform. Process. Lett."
-, volume =	10
-, year =	1980
-, pages =	"132--136"
-, update =	"93.09 rote"
+, author =      "P. van {Emde Boas}"
+, title =       "On the {$\Omega(n \log n)$} lower-bound for convex hull and maximal vector determination"
+, journal =     "Inform. Process. Lett."
+, volume =      10
+, year =        1980
+, pages =       "132--136"
+, update =      "93.09 rote"
 }
 
 @article{e-pofll-77
-, author =	"P. van {Emde Boas}"
-, title =	"Preserving order in a forest in less than logarithmic time and linear space"
-, journal =	"Inform. Process. Lett."
-, volume =	6
-, year =	1977
-, pages =	"80--82"
-, update =	"97.11 bibrelex"
+, author =      "P. van {Emde Boas}"
+, title =       "Preserving order in a forest in less than logarithmic time and linear space"
+, journal =     "Inform. Process. Lett."
+, volume =      6
+, year =        1977
+, pages =       "80--82"
+, update =      "97.11 bibrelex"
 }
 
 @article{ekz-diepq-77
-, author =	"P. van {Emde Boas} and R. Kaas and E. Zijlstra"
-, title =	"Design and Implementation of an Efficient Priority Queue"
-, journal =	"Math. Syst. Theory"
-, volume =	10
-, year =	1977
-, pages =	"99--127"
-, update =	"93.09 rote"
+, author =      "P. van {Emde Boas} and R. Kaas and E. Zijlstra"
+, title =       "Design and Implementation of an Efficient Priority Queue"
+, journal =     "Math. Syst. Theory"
+, volume =      10
+, year =        1977
+, pages =       "99--127"
+, update =      "93.09 rote"
 }
 
 @article{ejla-csmcd-91
-, author =	"A. F. Emery and O. Johansson and M. Lobo and A. Abrous"
-, title =	"A comparative study of methods for computing the diffuse radiation viewfactors for complex structures"
-, journal =	"Journal of Heath Transfer"
-, volume =	113
-, year =	1991
-, pages =	"412--421"
-, update =	"98.03 bibrelex"
+, author =      "A. F. Emery and O. Johansson and M. Lobo and A. Abrous"
+, title =       "A comparative study of methods for computing the diffuse radiation viewfactors for complex structures"
+, journal =     "Journal of Heath Transfer"
+, volume =      113
+, year =        1991
+, pages =       "412--421"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{e-cicgd-96
-, author =	"I. Emiris"
-, title =	"A Complete Implementation for Computing General Dimensional Convex Hulls"
-, type =	"Research {Report}"
-, number =	2551
-, institution =	"INRIA"
-, year =	1996
-, url =	"http://www.inria.fr/rapports/sophia/RR-2551.html"
-, precedes =	"e-cicgd-98"
-, update =	"98.11 devillers, 97.03 devillers"
-, abstract =	"We  study  two important,  and   often complementary,
+, author =      "I. Emiris"
+, title =       "A Complete Implementation for Computing General Dimensional Convex Hulls"
+, type =        "Research {Report}"
+, number =      2551
+, institution = "INRIA"
+, year =        1996
+, url = "http://www.inria.fr/rapports/sophia/RR-2551.html"
+, precedes =    "e-cicgd-98"
+, update =      "98.11 devillers, 97.03 devillers"
+, abstract =    "We  study  two important,  and   often complementary,
 issues  in  the implementation of geometric algorithms,  namely exact
 arithmetic  and degeneracy.  We focus on integer arithmetic and propose
 a general and efficient method for  its implementation based on modular
@@ -54205,1554 +54205,1554 @@ @techreport{e-cicgd-96
 }
 
 @article{e-cicgd-98
-, author =	"I. Emiris"
-, title =	"A Complete Implementation for Computing General Dimensional Convex Hulls"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"33--36"
-, succeeds =	"e-cicgd-96"
-, update =	"99.11 bibrelex, 98.11 devillers, 98.07 bibrelex"
+, author =      "I. Emiris"
+, title =       "A Complete Implementation for Computing General Dimensional Convex Hulls"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "33--36"
+, succeeds =    "e-cicgd-96"
+, update =      "99.11 bibrelex, 98.11 devillers, 98.07 bibrelex"
 }
 
 @mastersthesis{e-eargd-91
-, author =	"I. Emiris"
-, title =	"An efficient approach to removing geometric degeneracies"
-, school =	"Comput. Sci. Div., Univ. California"
-, address =	"Berkeley, CA"
-, month =	may
-, year =	1991
-, keywords =	"master thesis"
-, update =	"97.11 bibrelex"
+, author =      "I. Emiris"
+, title =       "An efficient approach to removing geometric degeneracies"
+, school =      "Comput. Sci. Div., Univ. California"
+, address =     "Berkeley, CA"
+, month =       may
+, year =        1991
+, keywords =    "master thesis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ec-gard-91
-, author =	"I. Emiris and J. Canny"
-, title =	"A general approach to removing degeneracies"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"405--413"
-, precedes =	"ec-gard-95"
-, update =	"96.09 devillers"
+, author =      "I. Emiris and J. Canny"
+, title =       "A general approach to removing degeneracies"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "405--413"
+, precedes =    "ec-gard-95"
+, update =      "96.09 devillers"
 }
 
 @article{ec-gard-95
-, author =	"I. Emiris and J. Canny"
-, title =	"A general approach to removing degeneracies"
-, journal =	"SIAM J. Comput."
-, volume =	24
-, year =	1995
-, pages =	"650--664"
-, keywords =	"input degeneracy, ill-conditioned problems, symbolic perturbation, infinitesimals, randomization, determinants, roots of polynomials, algorithmic complexity"
-, succeeds =	"ec-gard-91,ec-eargd-92"
-, update =	"96.09 devillers"
+, author =      "I. Emiris and J. Canny"
+, title =       "A general approach to removing degeneracies"
+, journal =     "SIAM J. Comput."
+, volume =      24
+, year =        1995
+, pages =       "650--664"
+, keywords =    "input degeneracy, ill-conditioned problems, symbolic perturbation, infinitesimals, randomization, determinants, roots of polynomials, algorithmic complexity"
+, succeeds =    "ec-gard-91,ec-eargd-92"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{ec-eargd-92
-, author =	"I. Emiris and J. Canny"
-, title =	"An efficient approach to removing geometric degeneracies"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"74--82"
-, precedes =	"ec-gard-95"
-, cites =	"ahu-daca-74, c-crsas-91, cl-rzp-82, d-lpe-63, d-afp-90, e-acg-87, eg-tsa-86, em-sstcd-90, ew-chsct-86, e-eargd-91, ec-gard-91, k-facp-85, ps-cgi-85, y-stgd-87, y-gctsp-88, ZZZ"
-, update =	"97.11 bibrelex, 96.09 devillers"
+, author =      "I. Emiris and J. Canny"
+, title =       "An efficient approach to removing geometric degeneracies"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "74--82"
+, precedes =    "ec-gard-95"
+, cites =       "ahu-daca-74, c-crsas-91, cl-rzp-82, d-lpe-63, d-afp-90, e-acg-87, eg-tsa-86, em-sstcd-90, ew-chsct-86, e-eargd-91, ec-gard-91, k-facp-85, ps-cgi-85, y-stgd-87, y-gctsp-88, ZZZ"
+, update =      "97.11 bibrelex, 96.09 devillers"
 }
 
 @inproceedings{e-cipms-00
-, author =	"Ioannis Z. Emiris"
-, title =	"Computing Integer Points in {Minkowski} Sums"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"29--36"
-, update =	"00.11 jones"
+, author =      "Ioannis Z. Emiris"
+, title =       "Computing Integer Points in {Minkowski} Sums"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "29--36"
+, update =      "00.11 jones"
 }
 
 @article{ecs-ephgd-97
-, author =	"I. Z. Emiris and J. F. Canny and R. Seidel"
-, title =	"Efficient Perturbations for Handling Geometric Degeneracies"
-, journal =	"Algorithmica"
-, volume =	19
-, number =	"1--2"
-, month =	sep
-, year =	1997
-, pages =	"219--242"
-, update =	"97.07 held"
+, author =      "I. Z. Emiris and J. F. Canny and R. Seidel"
+, title =       "Efficient Perturbations for Handling Geometric Degeneracies"
+, journal =     "Algorithmica"
+, volume =      19
+, number =      "1--2"
+, month =       sep
+, year =        1997
+, pages =       "219--242"
+, update =      "97.07 held"
 }
 
 @inproceedings{eg-dcmv-97
-, author =	"Ioannis Z. Emiris and Thierry Giordano"
-, title =	"Distributed Computation of Mixed Volume"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"48--50"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Ioannis Z. Emiris and Thierry Giordano"
+, title =       "Distributed Computation of Mixed Volume"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "48--50"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{e-sshlp-70
-, author =	"J. L. Encarnacao"
-, title =	"A survey of solutions of the hidden line problem"
-, booktitle =	"Proc. Interactive Comput. Graphics Conf."
-, year =	1970
-, pages =	"??"
+, author =      "J. L. Encarnacao"
+, title =       "A survey of solutions of the hidden line problem"
+, booktitle =   "Proc. Interactive Comput. Graphics Conf."
+, year =        1970
+, pages =       "??"
 }
 
 @book{e-cgpav-75
-, author =	"J. L. Encarnacao"
-, title =	"Computer-Graphics: {Programmierung} and {Anwendung} von graphischen {Systemen}"
-, publisher =	"R. Oldenburg Verlag"
-, address =	"M{\"u}nchen, West Germany"
-, year =	1975
+, author =      "J. L. Encarnacao"
+, title =       "Computer-Graphics: {Programmierung} and {Anwendung} von graphischen {Systemen}"
+, publisher =   "R. Oldenburg Verlag"
+, address =     "M{\"u}nchen, West Germany"
+, year =        1975
 }
 
 @inproceedings{e-mpr-91
-, author =	"Peter Engel"
-, title =	"On the morphology of polytopes in {$R^d$}"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"71--83"
-, keywords =	"combinatorial enumeration"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
-, abstract =	"An algorithm to enumerate the combinatorial types of
+, author =      "Peter Engel"
+, title =       "On the morphology of polytopes in {$R^d$}"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "71--83"
+, keywords =    "combinatorial enumeration"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
+, abstract =    "An algorithm to enumerate the combinatorial types of
                  $d$-spheres is described.  A purely geometric condition is
                  given to determine the non-polytopal spheres.
                  New results are presented for $d=4$ and $5$."
 }
 
 @book{e-oaz-94
-, author =	"P. Engel"
-, title =	"Origami from Angelfish to Zen"
-, publisher =	"Dover"
-, year =	1994
-, update =	"97.11 bibrelex"
+, author =      "P. Engel"
+, title =       "Origami from Angelfish to Zen"
+, publisher =   "Dover"
+, year =        1994
+, update =      "97.11 bibrelex"
 }
 
 @book{es-vims-98
-, title =	"Voronoi's Impact on Modern Science"
-, editor =	"P. Engel and H. Syta"
-, publisher =	"Institute of Mathematics of the National Academy of Sciences of Ukraine"
-, address =	"Kyiv"
-, year =	1998
-, update =	"00.11 smid"
-, annote =	"Two books, contains a biography of Voronoi"
+, title =       "Voronoi's Impact on Modern Science"
+, editor =      "P. Engel and H. Syta"
+, publisher =   "Institute of Mathematics of the National Academy of Sciences of Ukraine"
+, address =     "Kyiv"
+, year =        1998
+, update =      "00.11 smid"
+, annote =      "Two books, contains a biography of Voronoi"
 }
 
 @article{elw-bggde-90
-, author =	"J. Engelfriet and G. Leih and Emo Welzl"
-, title =	"Boundary graph grammars with dynamic edge relabeling"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	40
-, year =	1990
-, pages =	"307--345"
-, update =	"98.03 mitchell, 97.03 gaertner+salinger"
+, author =      "J. Engelfriet and G. Leih and Emo Welzl"
+, title =       "Boundary graph grammars with dynamic edge relabeling"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      40
+, year =        1990
+, pages =       "307--345"
+, update =      "98.03 mitchell, 97.03 gaertner+salinger"
 }
 
 @article{e-cma-89
-, author =	"H. Englisch"
-, title =	"The circumpolygon with maximal area"
-, journal =	"Optimization"
-, volume =	20
-, number =	4
-, year =	1989
-, pages =	"503--508"
-, keywords =	"polygon, circuscribed, area, optimization"
-, update =	"95.09 korneenko"
+, author =      "H. Englisch"
+, title =       "The circumpolygon with maximal area"
+, journal =     "Optimization"
+, volume =      20
+, number =      4
+, year =        1989
+, pages =       "503--508"
+, keywords =    "polygon, circuscribed, area, optimization"
+, update =      "95.09 korneenko"
 }
 
 @article{ev-imacm-88
-, author =	"H. Englisch and H. Voigt"
-, title =	"The inpolygon with minimal area and the circumpolygon with maximal perimeter"
-, journal =	"Optimization"
-, volume =	19
-, number =	2
-, year =	1988
-, pages =	"229--233"
-, keywords =	"polygon, circuscribed, inscribed, area, optimization, perimeter"
-, update =	"95.09 korneenko"
+, author =      "H. Englisch and H. Voigt"
+, title =       "The inpolygon with minimal area and the circumpolygon with maximal perimeter"
+, journal =     "Optimization"
+, volume =      19
+, number =      2
+, year =        1988
+, pages =       "229--233"
+, keywords =    "polygon, circuscribed, inscribed, area, optimization, perimeter"
+, update =      "95.09 korneenko"
 }
 
 @article{e-eadwf-84
-, author =	"T. C. Enns"
-, title =	"An efficient algorithm determining when fabrics hang together"
-, journal =	"Geom. Dedicata"
-, volume =	15
-, year =	1984
-, pages =	"259--260"
-, keywords =	"fabrics, weavings"
-, update =	"95.09 korneenko"
+, author =      "T. C. Enns"
+, title =       "An efficient algorithm determining when fabrics hang together"
+, journal =     "Geom. Dedicata"
+, volume =      15
+, year =        1984
+, pages =       "259--260"
+, keywords =    "fabrics, weavings"
+, update =      "95.09 korneenko"
 }
 
 @article{esg-imgc-98
-, author =	"M. T. Ensz and D. W. Storti and M. A. Ganter"
-, title =	"Implicit Methods for Geometry Creation"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"509--536"
-, update =	"98.11 devillers"
+, author =      "M. T. Ensz and D. W. Storti and M. A. Ganter"
+, title =       "Implicit Methods for Geometry Creation"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "509--536"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{ek-tgpdr-87
-, author =	"K. S. Eo and C. M. Kyung"
-, title =	"A two-dimensional geometric processor for design rule check applications"
-, booktitle =	"TENCON'87. IEEE Per.10 Conf.?"
-, volume =	1
-, year =	1987
-, pages =	"266--270"
-, keywords =	"parallel computations, isothetic, VLSI design"
-, update =	"95.09 korneenko"
+, author =      "K. S. Eo and C. M. Kyung"
+, title =       "A two-dimensional geometric processor for design rule check applications"
+, booktitle =   "TENCON'87. IEEE Per.10 Conf.?"
+, volume =      1
+, year =        1987
+, pages =       "266--270"
+, keywords =    "parallel computations, isothetic, VLSI design"
+, update =      "95.09 korneenko"
 }
 
 @article{e-amwst-94
-, author =	"D. Eppstein"
-, title =	"Approximating the minimum weight {Steiner} triangulation"
-, journal =	"Discrete Comput. Geom."
-, volume =	11
-, year =	1994
-, pages =	"163--191"
-, succeeds =	"e-amwt-92"
-, update =	"96.09 aronov"
+, author =      "D. Eppstein"
+, title =       "Approximating the minimum weight {Steiner} triangulation"
+, journal =     "Discrete Comput. Geom."
+, volume =      11
+, year =        1994
+, pages =       "163--191"
+, succeeds =    "e-amwt-92"
+, update =      "96.09 aronov"
 }
 
 @techreport{e-amwt-91
-, author =	"D. Eppstein"
-, title =	"Approximating the minimum weight triangulation"
-, type =	"Tech. Report"
-, number =	"91-55"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1991
-, precedes =	"e-amwt-92"
+, author =      "D. Eppstein"
+, title =       "Approximating the minimum weight triangulation"
+, type =        "Tech. Report"
+, number =      "91-55"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1991
+, precedes =    "e-amwt-92"
 }
 
 @inproceedings{e-amwt-92
-, author =	"D. Eppstein"
-, title =	"Approximating the minimum weight triangulation"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"48--57"
-, succeeds =	"e-amwt-91"
-, precedes =	"e-amwst-94"
-, update =	"96.09 aronov"
+, author =      "D. Eppstein"
+, title =       "Approximating the minimum weight triangulation"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "48--57"
+, succeeds =    "e-amwt-91"
+, precedes =    "e-amwst-94"
+, update =      "96.09 aronov"
 }
 
 @article{e-acadg-96
-, author =	"D. Eppstein"
-, title =	"Average case analysis of dynamic geometric optimization"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"45--68"
-, update =	"96.09 devillers"
+, author =      "D. Eppstein"
+, title =       "Average case analysis of dynamic geometric optimization"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "45--68"
+, update =      "96.09 devillers"
 }
 
 @article{e-demst-95
-, author =	"D. Eppstein"
-, title =	"Dynamic {Euclidean} minimum spanning trees and extrema of binary functions"
-, journal =	"Discrete Comput. Geom."
-, volume =	13
-, year =	1995
-, pages =	"111--122"
-, update =	"96.05 smid"
+, author =      "D. Eppstein"
+, title =       "Dynamic {Euclidean} minimum spanning trees and extrema of binary functions"
+, journal =     "Discrete Comput. Geom."
+, volume =      13
+, year =        1995
+, pages =       "111--122"
+, update =      "96.05 smid"
 }
 
 @inproceedings{e-dtdlp-91
-, author =	"D. Eppstein"
-, title =	"Dynamic three-dimensional linear programming"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"488--494"
-, precedes =	"e-dtdlp-92"
-, update =	"93.09 rote"
+, author =      "D. Eppstein"
+, title =       "Dynamic three-dimensional linear programming"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "488--494"
+, precedes =    "e-dtdlp-92"
+, update =      "93.09 rote"
 }
 
 @article{e-dtdlp-92
-, author =	"D. Eppstein"
-, title =	"Dynamic three-dimensional linear programming"
-, journal =	"ORSA J. Comput."
-, volume =	4
-, number =	4
-, year =	1992
-, pages =	"360--368"
-, keywords =	"optimization, cluster analysis"
-, succeeds =	"e-dtdlp-91"
-, update =	"98.03 mitchell, 93.09 rote"
-, annote =	"Special issue on computational geometry; J. Mitchell and
+, author =      "D. Eppstein"
+, title =       "Dynamic three-dimensional linear programming"
+, journal =     "ORSA J. Comput."
+, volume =      4
+, number =      4
+, year =        1992
+, pages =       "360--368"
+, keywords =    "optimization, cluster analysis"
+, succeeds =    "e-dtdlp-91"
+, update =      "98.03 mitchell, 93.09 rote"
+, annote =      "Special issue on computational geometry; J. Mitchell and
                   J. Karel Lenstra, eds."
 }
 
 @inproceedings{e-fhcoa-98
-, author =	"David Eppstein"
-, title =	"Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"619--628"
-, update =	"98.07 agarwal+mitchell"
+, author =      "David Eppstein"
+, title =       "Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "619--628"
+, update =      "98.07 agarwal+mitchell"
 }
 
 @article{e-fcpan-97
-, author =	"D. Eppstein"
-, title =	"Faster Circle Packing with Application to Non-Obtuse Triangulation"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"485--492"
-, update =	"99.11 bibrelex, 98.11 devillers"
+, author =      "D. Eppstein"
+, title =       "Faster Circle Packing with Application to Non-Obtuse Triangulation"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "485--492"
+, update =      "99.11 bibrelex, 98.11 devillers"
 }
 
 @techreport{e-fcptc-96
-, author =	"D. Eppstein"
-, title =	"Faster construction of planar two-centers"
-, type =	"Tech. Report"
-, number =	"96-12"
-, institution =	"Dept. Comput. Sci."
-, address =	"University of California, Irvine"
-, year =	1996
-, update =	"96.05 agarwal"
+, author =      "D. Eppstein"
+, title =       "Faster construction of planar two-centers"
+, type =        "Tech. Report"
+, number =      "96-12"
+, institution = "Dept. Comput. Sci."
+, address =     "University of California, Irvine"
+, year =        1996
+, update =      "96.05 agarwal"
 }
 
 @inproceedings{e-fcptc-97
-, author =	"D. Eppstein"
-, title =	"Faster construction of planar two-centers"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1997
-, update =	"97.03 agarwal, 96.05 agarwal"
+, author =      "D. Eppstein"
+, title =       "Faster construction of planar two-centers"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1997
+, update =      "97.03 agarwal, 96.05 agarwal"
 }
 
 @techreport{e-fgkma-95
-, author =	"D. Eppstein"
-, title =	"Faster geometric $k$-point {MST} approximation"
-, type =	"Tech. Report"
-, number =	"95-13"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1995
-, keywords =	"k-MST"
-, precedes =	"e-fgkma-97"
-, update =	"98.03 mitchell, 95.09 mitchell"
+, author =      "D. Eppstein"
+, title =       "Faster geometric $k$-point {MST} approximation"
+, type =        "Tech. Report"
+, number =      "95-13"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1995
+, keywords =    "k-MST"
+, precedes =    "e-fgkma-97"
+, update =      "98.03 mitchell, 95.09 mitchell"
 }
 
 @article{e-fgkma-97
-, author =	"D. Eppstein"
-, title =	"Faster geometric $k$-point {MST} approximation"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, number =	5
-, month =	oct
-, year =	1997
-, pages =	"231--240"
-, keywords =	"k-MST"
-, succeeds =	"e-fgkma-95"
-, update =	"98.03 mitchell"
+, author =      "D. Eppstein"
+, title =       "Faster geometric $k$-point {MST} approximation"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, number =      5
+, month =       oct
+, year =        1997
+, pages =       "231--240"
+, keywords =    "k-MST"
+, succeeds =    "e-fgkma-95"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{e-fksst-90
-, author =	"D. Eppstein"
-, title =	"Finding the $k$ smallest spanning trees"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"38--47"
+, author =      "D. Eppstein"
+, title =       "Finding the $k$ smallest spanning trees"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "38--47"
 }
 
 @article{e-fksst-92
-, author =	"D. Eppstein"
-, title =	"Finding the $k$ smallest spanning trees"
-, journal =	"BIT"
-, volume =	32
-, year =	1992
-, pages =	"237--248"
+, author =      "D. Eppstein"
+, title =       "Finding the $k$ smallest spanning trees"
+, journal =     "BIT"
+, volume =      32
+, year =        1992
+, pages =       "237--248"
 }
 
 @techreport{e-fdmem-92
-, author =	"D. Eppstein"
-, title =	"Fully dynamic maintenance of {Euclidean} minimum spanning trees"
-, type =	"Tech. Report"
-, number =	"92-05"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1992
+, author =      "D. Eppstein"
+, title =       "Fully dynamic maintenance of {Euclidean} minimum spanning trees"
+, type =        "Tech. Report"
+, number =      "92-05"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1992
 }
 
 @inproceedings{e-glbpm-95
-, author =	"D. Eppstein"
-, title =	"Geometric lower bounds for parametric matroid optimization"
-, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
-, year =	1995
-, pages =	"662--671"
-, update =	"95.09 smid"
+, author =      "D. Eppstein"
+, title =       "Geometric lower bounds for parametric matroid optimization"
+, booktitle =   "Proc. 27th Annu. ACM Sympos. Theory Comput."
+, year =        1995
+, pages =       "662--671"
+, update =      "95.09 smid"
 }
 
 @misc{e-ga-
-, author =	"David Eppstein"
-, title =	"Geometry in Action"
-, url =	"https://www.ics.uci.edu/~eppstein/geom.html"
-, update =	"97.03 tamassia"
+, author =      "David Eppstein"
+, title =       "Geometry in Action"
+, url = "https://www.ics.uci.edu/~eppstein/geom.html"
+, update =      "97.03 tamassia"
 }
 
 @techreport{e-ibith-91
-, author =	"D. Eppstein"
-, title =	"Improved bounds for intersecting triangles and halving planes"
-, type =	"Tech. Report"
-, number =	"91-53"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1991
-, comments =	"To appear in J. Comb. Theory Ser. A"
+, author =      "D. Eppstein"
+, title =       "Improved bounds for intersecting triangles and halving planes"
+, type =        "Tech. Report"
+, number =      "91-53"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1991
+, comments =    "To appear in J. Comb. Theory Ser. A"
 }
 
 @article{e-ibith-93
-, author =	"D. Eppstein"
-, title =	"Improved bounds for intersecting triangles and halving planes"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	62
-, year =	1993
-, pages =	"176--182"
-, update =	"98.03 agarwal"
+, author =      "D. Eppstein"
+, title =       "Improved bounds for intersecting triangles and halving planes"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      62
+, year =        1993
+, pages =       "176--182"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{e-lchmg-96
-, author =	"David Eppstein"
-, title =	"Linear Complexity Hexahedral Mesh Generation"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"58--67"
-, cites =	"bpmcs-cahat-95, b-ct-93, be-mgot-95, cs-bst-94, h-mgasi-83, h-srcc-95, jsk-actfm-91, bbmmt-hmgd-95, m-cqmsw-95, rrt-ctq-95, s-op-, t-hdp-93, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "David Eppstein"
+, title =       "Linear Complexity Hexahedral Mesh Generation"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "58--67"
+, cites =       "bpmcs-cahat-95, b-ct-93, be-mgot-95, cs-bst-94, h-mgasi-83, h-srcc-95, jsk-actfm-91, bbmmt-hmgd-95, m-cqmsw-95, rrt-ctq-95, s-op-, t-hdp-93, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @techreport{e-namak-91
-, author =	"D. Eppstein"
-, title =	"New algorithms for minimum area $k$-gons"
-, type =	"Tech. Report"
-, number =	"91-59"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1991
+, author =      "D. Eppstein"
+, title =       "New algorithms for minimum area $k$-gons"
+, type =        "Tech. Report"
+, number =      "91-59"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1991
 }
 
 @inproceedings{e-namak-92
-, author =	"D. Eppstein"
-, title =	"New algorithms for minimum area $k$-gons"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"83--88"
+, author =      "D. Eppstein"
+, title =       "New algorithms for minimum area $k$-gons"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "83--88"
 }
 
 @inproceedings{e-oadms-91
-, author =	"D. Eppstein"
-, title =	"Offline algorithms for dynamic minimum spanning tree problems"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"392--399"
-, keywords =	"proximity, minimum spanning tree"
-, precedes =	"e-oadms-92"
+, author =      "D. Eppstein"
+, title =       "Offline algorithms for dynamic minimum spanning tree problems"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "392--399"
+, keywords =    "proximity, minimum spanning tree"
+, precedes =    "e-oadms-92"
 }
 
 @techreport{e-oadms-92
-, author =	"D. Eppstein"
-, title =	"Offline algorithms for dynamic minimum spanning tree problems"
-, type =	"Tech. Report"
-, number =	"92-04"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1992
-, succeeds =	"e-oadms-91"
+, author =      "D. Eppstein"
+, title =       "Offline algorithms for dynamic minimum spanning tree problems"
+, type =        "Tech. Report"
+, number =      "92-04"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1992
+, succeeds =    "e-oadms-91"
 }
 
 @techreport{e-poasc-91
-, author =	"D. Eppstein"
-, title =	"Persistence, offline algorithms, and space compaction"
-, type =	"Tech. Report"
-, number =	"91-54"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1991
+, author =      "D. Eppstein"
+, title =       "Persistence, offline algorithms, and space compaction"
+, type =        "Tech. Report"
+, number =      "91-54"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1991
 }
 
 @incollection{e-sts-00
-, author =	"David Eppstein"
-, title =	"Spanning Trees and Spanners"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"425--461"
-, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 agarwal"
-, annote =	"Chapter 9 of su-hcg-00"
+, author =      "David Eppstein"
+, title =       "Spanning Trees and Spanners"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "425--461"
+, update =      "00.03 bibrelex+smid, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 agarwal"
+, annote =      "Chapter 9 of su-hcg-00"
 }
 
 @techreport{e-sucsg-92
-, author =	"D. Eppstein"
-, title =	"Speed-ups in constructive solid geometry"
-, type =	"Report"
-, number =	"92-87"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1992
-, update =	"96.09 orourke"
+, author =      "D. Eppstein"
+, title =       "Speed-ups in constructive solid geometry"
+, type =        "Report"
+, number =      "92-87"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1992
+, update =      "96.09 orourke"
 }
 
 @techreport{e-sntcp-91
-, author =	"D. Eppstein"
-, title =	"Subquadratic nonobtuse triangulation of convex polygons"
-, type =	"Tech. Report"
-, number =	"91-61"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1991
+, author =      "D. Eppstein"
+, title =       "Subquadratic nonobtuse triangulation of convex polygons"
+, type =        "Tech. Report"
+, number =      "91-61"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1991
 }
 
 @techreport{e-dnng-92
-, author =	"D. Eppstein"
-, title =	"The diameter of nearest neighbor graphs"
-, type =	"Tech. Report"
-, number =	"92-76"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, month =	jul
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "D. Eppstein"
+, title =       "The diameter of nearest neighbor graphs"
+, type =        "Tech. Report"
+, number =      "92-76"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, month =       jul
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @techreport{e-fpdtm-90
-, author =	"D. Eppstein"
-, title =	"The farthest point {Delaunay} triangulation minimizes angles"
-, type =	"Manuscript"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "D. Eppstein"
+, title =       "The farthest point {Delaunay} triangulation minimizes angles"
+, type =        "Manuscript"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @article{e-fpdtm-92
-, author =	"D. Eppstein"
-, title =	"The farthest point {Delaunay} triangulation minimizes angles"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, year =	1992
-, pages =	"143--148"
-, keywords =	"Delaunay triangulation, Voronoi diagrams"
+, author =      "D. Eppstein"
+, title =       "The farthest point {Delaunay} triangulation minimizes angles"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, year =        1992
+, pages =       "143--148"
+, keywords =    "Delaunay triangulation, Voronoi diagrams"
 }
 
 @techreport{e-twngk-92
-, author =	"D. Eppstein"
-, title =	"Tree-weighted neighbors and geometric $k$ smallest spanning trees"
-, type =	"Tech. Report"
-, number =	"92-77"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1992
-, precedes =	"e-twngk-94"
-, update =	"96.09 devillers"
+, author =      "D. Eppstein"
+, title =       "Tree-weighted neighbors and geometric $k$ smallest spanning trees"
+, type =        "Tech. Report"
+, number =      "92-77"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1992
+, precedes =    "e-twngk-94"
+, update =      "96.09 devillers"
 }
 
 @article{e-twngk-94
-, author =	"D. Eppstein"
-, title =	"Tree-weighted neighbors and geometric $k$ smallest spanning trees"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"229--238"
-, keywords =	"minimum spanning trees, spanning tree enumeration, geometric optimization, nearest neighbors"
-, succeeds =	"e-twngk-92"
-, update =	"96.09 devillers"
+, author =      "D. Eppstein"
+, title =       "Tree-weighted neighbors and geometric $k$ smallest spanning trees"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "229--238"
+, keywords =    "minimum spanning trees, spanning tree enumeration, geometric optimization, nearest neighbors"
+, succeeds =    "e-twngk-92"
+, update =      "96.09 devillers"
 }
 
 @techreport{ee-innfm-92
-, author =	"D. Eppstein and J. Erickson"
-, title =	"Iterated nearest neighbors and finding minimal polytopes"
-, type =	"Tech. Report"
-, number =	"92-71"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1992
-, precedes =	"ee-innfm-93"
-, update =	"93.09 rote"
+, author =      "D. Eppstein and J. Erickson"
+, title =       "Iterated nearest neighbors and finding minimal polytopes"
+, type =        "Tech. Report"
+, number =      "92-71"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1992
+, precedes =    "ee-innfm-93"
+, update =      "93.09 rote"
 }
 
 @inproceedings{ee-innfm-93
-, author =	"D. Eppstein and J. Erickson"
-, title =	"Iterated Nearest Neighbors and Finding Minimal Polytopes"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"64--73"
-, keywords =	"optimization"
-, succeeds =	"ee-innfm-92"
-, update =	"93.09 rote, 93.05 smid"
+, author =      "D. Eppstein and J. Erickson"
+, title =       "Iterated Nearest Neighbors and Finding Minimal Polytopes"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "64--73"
+, keywords =    "optimization"
+, succeeds =    "ee-innfm-92"
+, update =      "93.09 rote, 93.05 smid"
 }
 
 @article{ee-innfm-94
-, author =	"D. Eppstein and J. Erickson"
-, title =	"Iterated nearest neighbors and finding minimal polytopes"
-, journal =	"Discrete Comput. Geom."
-, volume =	11
-, year =	1994
-, pages =	"321--350"
-, succeeds =	"ee-innfm-93"
-, update =	"95.01 matousek"
+, author =      "D. Eppstein and J. Erickson"
+, title =       "Iterated nearest neighbors and finding minimal polytopes"
+, journal =     "Discrete Comput. Geom."
+, volume =      11
+, year =        1994
+, pages =       "321--350"
+, succeeds =    "ee-innfm-93"
+, update =      "95.01 matousek"
 }
 
 @techreport{ee-namms-92
-, author =	"D. Eppstein and J. Erickson"
-, title =	"New algorithms for minimum measure simplices and one-dimensional weighted {Voronoi} diagrams"
-, type =	"Tech. Report"
-, number =	"92-55"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1992
+, author =      "D. Eppstein and J. Erickson"
+, title =       "New algorithms for minimum measure simplices and one-dimensional weighted {Voronoi} diagrams"
+, type =        "Tech. Report"
+, number =      "92-55"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1992
 }
 
 @article{eg-patcc-88
-, author =	"D. Eppstein and Z. Galil"
-, title =	"Parallel algorithmic techniques for combinatorial computation"
-, journal =	"Annu. Rev. Comput. Sci."
-, volume =	3
-, year =	1988
-, pages =	"233--283"
-, update =	"96.09 orourke"
+, author =      "D. Eppstein and Z. Galil"
+, title =       "Parallel algorithmic techniques for combinatorial computation"
+, journal =     "Annu. Rev. Comput. Sci."
+, volume =      3
+, year =        1988
+, pages =       "233--283"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{egg-sudp-88
-, author =	"D. Eppstein and Z. Galil and R. Giancarlo"
-, title =	"Speeding up dynamic programming"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"488--496"
+, author =      "D. Eppstein and Z. Galil and R. Giancarlo"
+, title =       "Speeding up dynamic programming"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "488--496"
 }
 
 @inproceedings{eggi-sdp-90
-, author =	"D. Eppstein and Z. Galil and R. Giancarlo and G. F. Italiano"
-, title =	"Sparse dynamic programming"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"513--522"
+, author =      "D. Eppstein and Z. Galil and R. Giancarlo and G. F. Italiano"
+, title =       "Sparse dynamic programming"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "513--522"
 }
 
 @inproceedings{egis-sbsdp-93
-, author =	"D. Eppstein and Z. Galil and G. Italiano and T. Spencer"
-, title =	"Separator Based Sparsification for Dynamic Planar Graph Algorithms"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"208--217"
-, update =	"95.05 tamassia"
+, author =      "D. Eppstein and Z. Galil and G. Italiano and T. Spencer"
+, title =       "Separator Based Sparsification for Dynamic Planar Graph Algorithms"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "208--217"
+, update =      "95.05 tamassia"
 }
 
 @inproceedings{egin-stsud-92
-, author =	"D. Eppstein and Z. Galil and G. F. Italiano and A. Nissenzweig"
-, title =	"Sparsification: {A} Technique for Speeding up Dynamic Graph Algorithms"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"60--69"
-, update =	"94.01 tamassia"
+, author =      "D. Eppstein and Z. Galil and G. F. Italiano and A. Nissenzweig"
+, title =       "Sparsification: {A} Technique for Speeding up Dynamic Graph Algorithms"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "60--69"
+, update =      "94.01 tamassia"
 }
 
 @article{egis-sbspt-96
-, author =	"D. Eppstein and Z. Galil and G. F. Italiano and T. H. Spencer"
-, title =	"Separator based sparsification I. planarity testing and minimum spanning trees"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	52
-, year =	1996
-, pages =	"3--27"
-, update =	"96.05 smid"
+, author =      "D. Eppstein and Z. Galil and G. F. Italiano and T. H. Spencer"
+, title =       "Separator based sparsification I. planarity testing and minimum spanning trees"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      52
+, year =        1996
+, pages =       "3--27"
+, update =      "96.05 smid"
 }
 
 @techreport{eh-spakl-97
-, author =	"David Eppstein and David Hart"
-, title =	"Shortest Paths in an Arrangement with {$k$} Line Orientations"
-, type =	"Manuscript"
-, institution =	"University of California, Irvine"
-, year =	1997
-, update =	"98.03 mitchell"
+, author =      "David Eppstein and David Hart"
+, title =       "Shortest Paths in an Arrangement with {$k$} Line Orientations"
+, type =        "Manuscript"
+, institution = "University of California, Irvine"
+, year =        1997
+, update =      "98.03 mitchell"
 }
 
 @article{eittwy-cmmsf-93
-, author =	"D. Eppstein and G. F. Italiano and R. Tamassia and R. E. Tarjan and J. Westbrook and M. Yung"
-, title =	"Corrigendum ({M}aintenance of a Minimum Spanning Forest in a Dynamic Plane Graph)"
-, journal =	"J. Algorithms"
-, volume =	15
-, number =	1
-, year =	1993
-, pages =	173
-, update =	"98.07 tamassia+vismara"
+, author =      "D. Eppstein and G. F. Italiano and R. Tamassia and R. E. Tarjan and J. Westbrook and M. Yung"
+, title =       "Corrigendum ({M}aintenance of a Minimum Spanning Forest in a Dynamic Plane Graph)"
+, journal =     "J. Algorithms"
+, volume =      15
+, number =      1
+, year =        1993
+, pages =       173
+, update =      "98.07 tamassia+vismara"
 }
 
 @inproceedings{eittwy-mmsfd-90
-, author =	"D. Eppstein and G. F. Italiano and R. Tamassia and R. E. Tarjan and J. Westbrook and M. Yung"
-, title =	"Maintenance of a minimum spanning forest in a dynamic planar graph"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"1--11"
-, precedes =	"eittwy-mmsfd-92"
+, author =      "D. Eppstein and G. F. Italiano and R. Tamassia and R. E. Tarjan and J. Westbrook and M. Yung"
+, title =       "Maintenance of a minimum spanning forest in a dynamic planar graph"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "1--11"
+, precedes =    "eittwy-mmsfd-92"
 }
 
 @article{eittwy-mmsfd-92
-, author =	"D. Eppstein and G. F. Italiano and R. Tamassia and R. E. Tarjan and J. Westbrook and M. Yung"
-, title =	"Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph"
-, journal =	"J. Algorithms"
-, volume =	13
-, number =	1
-, year =	1992
-, pages =	"33--54"
-, succeeds =	"eittwy-mmsfd-90"
-, update =	"98.07 tamassia+vismara"
-, annote =	"Corrigendum in 15(1):173, 1993"
+, author =      "D. Eppstein and G. F. Italiano and R. Tamassia and R. E. Tarjan and J. Westbrook and M. Yung"
+, title =       "Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph"
+, journal =     "J. Algorithms"
+, volume =      13
+, number =      1
+, year =        1992
+, pages =       "33--54"
+, succeeds =    "eittwy-mmsfd-90"
+, update =      "98.07 tamassia+vismara"
+, annote =      "Corrigendum in 15(1):173, 1993"
 }
 
 @inproceedings{emt-dltag-93
-, author =	"D. Eppstein and G. L. Miller and S.-H. Teng"
-, title =	"A deterministic linear time algorithm for geometric separators and its applications"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"99--108"
-, cites =	"b-mdc-80, beg-pgmg-90, cs-splg-88, d-scpps-92, dfn-mgma-84, fj-sbsem-86, fmt-sbpdc-92, g-ndrfe-73, gl-cslsp-81, ght-stgbg-84, gt-anda-87, hs-sugpm-90, hlp-i-52, hw-ensrq-87, hc-gi-52, jp-dhp-78, k-fa-73, k-sa-81, k-ss-73, lrt-gnd-79, lt-stpg-79, lt-apst-80, m-aogdc-91, mt-cppd-90, mttv-amp-92, mt-sttd-90, mtv-ugags-91, mv-dgs-91, pr-epsls-85, sf-afem-73, t-pssug-90, t-gt3m-88, vc-ucrfe-71, v-adptd-91, v-oaann-89, y-3spia-83, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "D. Eppstein and G. L. Miller and S.-H. Teng"
+, title =       "A deterministic linear time algorithm for geometric separators and its applications"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "99--108"
+, cites =       "b-mdc-80, beg-pgmg-90, cs-splg-88, d-scpps-92, dfn-mgma-84, fj-sbsem-86, fmt-sbpdc-92, g-ndrfe-73, gl-cslsp-81, ght-stgbg-84, gt-anda-87, hs-sugpm-90, hlp-i-52, hw-ensrq-87, hc-gi-52, jp-dhp-78, k-fa-73, k-sa-81, k-ss-73, lrt-gnd-79, lt-stpg-79, lt-apst-80, m-aogdc-91, mt-cppd-90, mttv-amp-92, mt-sttd-90, mtv-ugags-91, mv-dgs-91, pr-epsls-85, sf-afem-73, t-pssug-90, t-gt3m-88, vc-ucrfe-71, v-adptd-91, v-oaann-89, y-3spia-83, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{eorw-fmakg-92
-, author =	"D. Eppstein and M. H. Overmars and G{\"u}nter Rote and G. Woeginger"
-, title =	"Finding minimum area $k$-gons"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"45--58"
-, keywords =	"optimization, reporting"
-, update =	"98.07 agarwal, 98.03 mitchell, 93.09 rote"
+, author =      "D. Eppstein and M. H. Overmars and G{\"u}nter Rote and G. Woeginger"
+, title =       "Finding minimum area $k$-gons"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "45--58"
+, keywords =    "optimization, reporting"
+, update =      "98.07 agarwal, 98.03 mitchell, 93.09 rote"
 }
 
 @mastersthesis{e-ggor-92
-, author =	"P. Epstein"
-, title =	"Generating Geometric Objects at Random"
-, school =	"School of Computer Science, Carleton University"
-, month =	apr
-, year =	1992
-, keywords =	"master thesis"
-, update =	"98.11 bibrelex"
+, author =      "P. Epstein"
+, title =       "Generating Geometric Objects at Random"
+, school =      "School of Computer Science, Carleton University"
+, month =       apr
+, year =        1992
+, keywords =    "master thesis"
+, update =      "98.11 bibrelex"
 }
 
 @article{ekkmns-wcg-94
-, author =	"P. Epstein and J. Kavanagh and A. Knight and J. May and T. Nguyen and J.-R. Sack"
-, title =	"A Workbench for Computational Geometry"
-, journal =	"Algorithmica"
-, volume =	11
-, number =	4
-, month =	apr
-, year =	1994
-, pages =	"404--428"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 97.11 sack, 97.07 smid"
+, author =      "P. Epstein and J. Kavanagh and A. Knight and J. May and T. Nguyen and J.-R. Sack"
+, title =       "A Workbench for Computational Geometry"
+, journal =     "Algorithmica"
+, volume =      11
+, number =      4
+, month =       apr
+, year =        1994
+, pages =       "404--428"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 97.11 sack, 97.07 smid"
 }
 
 @techreport{ekmns-wcg-90
-, author =	"P. Epstein and A. Knight and J. May and T. Nguyen and J.-R. Sack"
-, title =	"A workbench for computational geometry"
-, type =	"Technical {Report}"
-, number =	"SCS-TR-180"
-, institution =	"School Comput. Sci., Carleton Univ."
-, address =	"Ottawa, ON"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "P. Epstein and A. Knight and J. May and T. Nguyen and J.-R. Sack"
+, title =       "A workbench for computational geometry"
+, type =        "Technical {Report}"
+, number =      "SCS-TR-180"
+, institution = "School Comput. Sci., Carleton Univ."
+, address =     "Ottawa, ON"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{es-gtr-92
-, author =	"P. Epstein and J.-R. Sack"
-, title =	"Generating triangulations at random"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"305--310"
-, cites =	"as-gbtr-92, e-ggor-92, u-igfpc-80, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. Epstein and J.-R. Sack"
+, title =       "Generating triangulations at random"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "305--310"
+, cites =       "as-gbtr-92, e-ggor-92, u-igfpc-80, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{es-gtr-94
-, author =	"P. Epstein and J.-R. Sack"
-, title =	"Generating Triangulations at Random"
-, journal =	"ACM Transaction on Modeling and Computer Simulation"
-, volume =	4
-, number =	3
-, year =	1994
-, pages =	"267--278"
-, update =	"97.11 sack"
+, author =      "P. Epstein and J.-R. Sack"
+, title =       "Generating Triangulations at Random"
+, journal =     "ACM Transaction on Modeling and Computer Simulation"
+, volume =      4
+, number =      3
+, year =        1994
+, pages =       "267--278"
+, update =      "97.11 sack"
 }
 
 @techreport{e-mpu-84
-, author =	"M. Erdmann"
-, title =	"On motion planning with uncertainty"
-, number =	"MIT-AI-TR 810"
-, institution =	"Artificial Intelligence Laboratory, MIT"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "M. Erdmann"
+, title =       "On motion planning with uncertainty"
+, number =      "MIT-AI-TR 810"
+, institution = "Artificial Intelligence Laboratory, MIT"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @article{e-ubfmp-86
-, author =	"M. Erdmann"
-, title =	"Using Backprojections for Fine Motion Planning with Uncertainty"
-, journal =	"Internat. J. Robot. Res."
-, volume =	5
-, number =	1
-, year =	1986
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "M. Erdmann"
+, title =       "Using Backprojections for Fine Motion Planning with Uncertainty"
+, journal =     "Internat. J. Robot. Res."
+, volume =      5
+, number =      1
+, year =        1986
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{el-mmo-87
-, author =	"M. Erdmann and T. Lozano-P{\'e}rez"
-, title =	"On multiple moving objects"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"477--521"
+, author =      "M. Erdmann and T. Lozano-P{\'e}rez"
+, title =       "On multiple moving objects"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "477--521"
 }
 
 @inproceedings{em-esm-86
-, author =	"M. Erdmann and M. T. Mason"
-, title =	"An Exploration of Sensorless Manipulation"
-, booktitle =	"Proc. 3rd IEEE Internat. Conf. Robot. Autom."
-, month =	apr
-, year =	1986
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "M. Erdmann and M. T. Mason"
+, title =       "An Exploration of Sensorless Manipulation"
+, booktitle =   "Proc. 3rd IEEE Internat. Conf. Robot. Autom."
+, month =       apr
+, year =        1986
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{em-esm-88
-, author =	"M. A. Erdmann and M. Mason"
-, title =	"An exploration of sensorless manipulation"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	4
-, number =	4
-, year =	1988
-, pages =	"367--379"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "M. A. Erdmann and M. Mason"
+, title =       "An exploration of sensorless manipulation"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      4
+, number =      4
+, year =        1988
+, pages =       "367--379"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @incollection{e-cpgnt-79
-, author =	"P. Erd{\H o}s"
-, title =	"Combinatorial problems in geometry and number theory"
-, booktitle =	"??"
-, series =	"Proc. Symp. Pure Math."
-, volume =	34
-, publisher =	"American Mathematical Society"
-, year =	1979
-, pages =	"149--62"
-, update =	"98.03 bibrelex"
+, author =      "P. Erd{\H o}s"
+, title =       "Combinatorial problems in geometry and number theory"
+, booktitle =   "??"
+, series =      "Proc. Symp. Pure Math."
+, volume =      34
+, publisher =   "American Mathematical Society"
+, year =        1979
+, pages =       "149--62"
+, update =      "98.03 bibrelex"
 }
 
 @article{e-gtp-59
-, author =	"P. Erd{\H o}s"
-, title =	"Graph theory and probability"
-, journal =	"Canad. J. Math."
-, volume =	11
-, year =	1959
-, pages =	"34--38"
-, update =	"98.03 bibrelex"
+, author =      "P. Erd{\H o}s"
+, title =       "Graph theory and probability"
+, journal =     "Canad. J. Math."
+, volume =      11
+, year =        1959
+, pages =       "34--38"
+, update =      "98.03 bibrelex"
 }
 
 @article{e-epggg-64
-, author =	"P. Erd{\H o}s"
-, title =	"On extremal problems of graphs and generalized graphs"
-, journal =	"Israel J. Math."
-, volume =	2
-, year =	1964
-, pages =	"183--190"
-, update =	"98.03 bibrelex"
+, author =      "P. Erd{\H o}s"
+, title =       "On extremal problems of graphs and generalized graphs"
+, journal =     "Israel J. Math."
+, volume =      2
+, year =        1964
+, pages =       "183--190"
+, update =      "98.03 bibrelex"
 }
 
 @article{e-sdnp-46
-, author =	"P. Erd{\H o}s"
-, title =	"On sets of distances of $n$ points"
-, journal =	"Amer. Math. Monthly"
-, volume =	53
-, year =	1946
-, pages =	"248--250"
-, keywords =	"combinatorial geometry, number theory, unit distances"
-, update =	"02.03 orourke"
+, author =      "P. Erd{\H o}s"
+, title =       "On sets of distances of $n$ points"
+, journal =     "Amer. Math. Monthly"
+, volume =      53
+, year =        1946
+, pages =       "248--250"
+, keywords =    "combinatorial geometry, number theory, unit distances"
+, update =      "02.03 orourke"
 }
 
 @article{e-sdnpe-60
-, author =	"P. Erd{\H o}s"
-, title =	"On sets of distances of $n$ points in {Euclidean} space"
-, journal =	"Publications Mathematical Institute of Hungarian Academy of Sciences"
-, volume =	5
-, year =	1960
-, pages =	"165--169"
-, keywords =	"combinatorial geometry, number theory, unit distance"
+, author =      "P. Erd{\H o}s"
+, title =       "On sets of distances of $n$ points in {Euclidean} space"
+, journal =     "Publications Mathematical Institute of Hungarian Academy of Sciences"
+, volume =      5
+, year =        1960
+, pages =       "165--169"
+, keywords =    "combinatorial geometry, number theory, unit distance"
 }
 
 @article{e-sagtg-67
-, author =	"P. Erd{\H o}s"
-, title =	"On some applications of graph theory to geometry"
-, journal =	"Canad. J. Math."
-, volume =	19
-, year =	1967
-, pages =	"968--971"
-, keywords =	"unit distance, extremal graph theory"
+, author =      "P. Erd{\H o}s"
+, title =       "On some applications of graph theory to geometry"
+, journal =     "Canad. J. Math."
+, volume =      19
+, year =        1967
+, pages =       "968--971"
+, keywords =    "unit distance, extremal graph theory"
 }
 
 @article{e-irpnn-62
-, author =	"P. Erd{\H o}s"
-, title =	"On the integers relatively prime to $n$ and on a number theoretic function considered by {Jacobsthal}"
-, journal =	"Math. Scand."
-, volume =	10
-, year =	1962
-, pages =	"163--170"
-, update =	"97.11 bibrelex"
+, author =      "P. Erd{\H o}s"
+, title =       "On the integers relatively prime to $n$ and on a number theoretic function considered by {Jacobsthal}"
+, journal =     "Math. Scand."
+, volume =      10
+, year =        1962
+, pages =       "163--170"
+, update =      "97.11 bibrelex"
 }
 
 @book{e-peac-73
-, author =	"P. Erd{\H o}s"
-, title =	"Paul Erd{\H o}s: {The} Art of Counting"
-, editor =	"J. H. Spencer"
-, publisher =	"MIT Press"
-, year =	1973
-, update =	"97.11 bibrelex"
+, author =      "P. Erd{\H o}s"
+, title =       "Paul Erd{\H o}s: {The} Art of Counting"
+, editor =      "J. H. Spencer"
+, publisher =   "MIT Press"
+, year =        1973
+, update =      "97.11 bibrelex"
 }
 
 @article{e-p3763-35
-, author =	"P. Erd{\H o}s"
-, title =	"Problem 3763"
-, journal =	"Amer. Math. Monthly"
-, volume =	42
-, year =	1935
-, pages =	627
-, comments =	"See sn-sp3763-39."
-, update =	"98.11 orourke"
-, annote =	"Flipping polygon pockets."
+, author =      "P. Erd{\H o}s"
+, title =       "Problem 3763"
+, journal =     "Amer. Math. Monthly"
+, volume =      42
+, year =        1935
+, pages =       627
+, comments =    "See sn-sp3763-39."
+, update =      "98.11 orourke"
+, annote =      "Flipping polygon pockets."
 }
 
 @article{e-pn4-44
-, author =	"P. Erd{\H o}s"
-, title =	"Problem No 4065"
-, journal =	"Amer. Math. Monthly"
-, volume =	51
-, year =	1944
-, pages =	169
-, update =	"98.03 devillers"
+, author =      "P. Erd{\H o}s"
+, title =       "Problem No 4065"
+, journal =     "Amer. Math. Monthly"
+, volume =      51
+, year =        1944
+, pages =       169
+, update =      "98.03 devillers"
 }
 
 @article{e-smpeg-78
-, author =	"Paul Erd{{\H o}}s"
-, title =	"Some more problems on elementary geometry"
-, journal =	"Austral. Math. Soc. Gaz."
-, volume =	5
-, year =	1978
-, pages =	"52--54"
-, update =	"02.03 devillers"
+, author =      "Paul Erd{{\H o}}s"
+, title =       "Some more problems on elementary geometry"
+, journal =     "Austral. Math. Soc. Gaz."
+, volume =      5
+, year =        1978
+, pages =       "52--54"
+, update =      "02.03 devillers"
 }
 
 @article{efrs-srn-78
-, author =	"P. Erd{\H o}s and R. J. Faudree and C. C. Rousseau and R. H. Schelp"
-, title =	"The size {Ramsey} number"
-, journal =	"Periodica Mathematica Hungarica"
-, volume =	9
-, year =	1978
-, pages =	"145--161"
-, update =	"97.11 bibrelex"
+, author =      "P. Erd{\H o}s and R. J. Faudree and C. C. Rousseau and R. H. Schelp"
+, title =       "The size {Ramsey} number"
+, journal =     "Periodica Mathematica Hungarica"
+, volume =      9
+, year =        1978
+, pages =       "145--161"
+, update =      "97.11 bibrelex"
 }
 
 @article{ef-mpsme-97
-, author =	"P. Erd{\H o}s and P. Fishburn"
-, title =	"Minimum planar sets with maximum equidistance counts"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"207--218"
-, update =	"97.07 devillers"
+, author =      "P. Erd{\H o}s and P. Fishburn"
+, title =       "Minimum planar sets with maximum equidistance counts"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "207--218"
+, update =      "97.07 devillers"
 }
 
 @book{egh-lp-89
-, author =	"P. Erd{\H o}s and P. M. Gruber and J. Hammer"
-, title =	"Lattice Points"
-, publisher =	"Longman Scientific \& Technical"
-, year =	1989
-, update =	"98.03 bibrelex"
+, author =      "P. Erd{\H o}s and P. M. Gruber and J. Hammer"
+, title =       "Lattice Points"
+, publisher =   "Longman Scientific \& Technical"
+, year =        1989
+, update =      "98.03 bibrelex"
 }
 
 @article{eg-cnp-73
-, author =	"P. Erd{\H o}s and R. K. Guy"
-, title =	"Crossing number problems"
-, journal =	"Amer. Math. Monthly"
-, volume =	80
-, year =	1973
-, pages =	"52--58"
-, update =	"97.11 bibrelex"
+, author =      "P. Erd{\H o}s and R. K. Guy"
+, title =       "Crossing number problems"
+, journal =     "Amer. Math. Monthly"
+, volume =      80
+, year =        1973
+, pages =       "52--58"
+, update =      "97.11 bibrelex"
 }
 
 @article{eg-vcmp-95
-, author =	"P. Erd{\H o}s and A. Gy{\'a}rf{\'a}s"
-, title =	"Vertex covering with monochromatic paths"
-, journal =	"Mathematica Pannonica"
-, volume =	6
-, year =	1995
-, pages =	"7--10"
-, update =	"97.11 bibrelex"
+, author =      "P. Erd{\H o}s and A. Gy{\'a}rf{\'a}s"
+, title =       "Vertex covering with monochromatic paths"
+, journal =     "Mathematica Pannonica"
+, volume =      6
+, year =        1995
+, pages =       "7--10"
+, update =      "97.11 bibrelex"
 }
 
 @article{egp-vcmct-91
-, author =	"P. Erd{\H o}s and A. Gy{\'a}rf{\'a}s and L. Pyber"
-, title =	"Vertex coverings by monochromatic cycles and trees"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	51
-, year =	1991
-, pages =	"90--95"
-, update =	"97.11 bibrelex"
+, author =      "P. Erd{\H o}s and A. Gy{\'a}rf{\'a}s and L. Pyber"
+, title =       "Vertex coverings by monochromatic cycles and trees"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      51
+, year =        1991
+, pages =       "90--95"
+, update =      "97.11 bibrelex"
 }
 
 @article{ek-cdrr-90
-, author =	"P. Erd{\H o}s and P. Komj{\'a}th"
-, title =	"Countable decompositions of {$\Re^2$} and {$\Re^3$}"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"325--331"
+, author =      "P. Erd{\H o}s and P. Komj{\'a}th"
+, title =       "Countable decompositions of {$\Re^2$} and {$\Re^3$}"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "325--331"
 }
 
 @incollection{elss-dgpps-73
-, author =	"P. Erd{\H o}s and L. Lov{\'a}sz and A. Simmons and E. Straus"
-, title =	"Dissection graphs of planar point sets"
-, editor =	"J. N. Srivastava"
-, booktitle =	"A Survey of Combinatorial Theory"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1973
-, pages =	"139--154"
-, keywords =	"$k$-sets"
+, author =      "P. Erd{\H o}s and L. Lov{\'a}sz and A. Simmons and E. Straus"
+, title =       "Dissection graphs of planar point sets"
+, editor =      "J. N. Srivastava"
+, booktitle =   "A Survey of Combinatorial Theory"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1973
+, pages =       "139--154"
+, keywords =    "$k$-sets"
 }
 
 @article{elv-gld-89
-, author =	"P. Erd{\H o}s and L. Lov{\'a}sz and K. Vesztergombi"
-, title =	"On the graph of large distances"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"541--549"
+, author =      "P. Erd{\H o}s and L. Lov{\'a}sz and K. Vesztergombi"
+, title =       "On the graph of large distances"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "541--549"
 }
 
 @article{ep-vtrd-90
-, author =	"P. Erd{\H o}s and J. Pach"
-, title =	"Variations on the theme of repeated distances"
-, journal =	"Combinatorica"
-, volume =	10
-, year =	1990
-, pages =	"261--269"
-, keywords =	"combinatorial geometry, unit distance"
+, author =      "P. Erd{\H o}s and J. Pach"
+, title =       "Variations on the theme of repeated distances"
+, journal =     "Combinatorica"
+, volume =      10
+, year =        1990
+, pages =       "261--269"
+, keywords =    "combinatorial geometry, unit distance"
 }
 
 @article{ep-sepg-71
-, author =	"P. Erd{\H o}s and G. Purdy"
-, title =	"Some extremal problems in geometry"
-, journal =	"J. Combin. Theory"
-, volume =	10
-, number =	3
-, year =	1971
-, pages =	"246--252"
-, update =	"98.07 bibrelex"
+, author =      "P. Erd{\H o}s and G. Purdy"
+, title =       "Some extremal problems in geometry"
+, journal =     "J. Combin. Theory"
+, volume =      10
+, number =      3
+, year =        1971
+, pages =       "246--252"
+, update =      "98.07 bibrelex"
 }
 
 @article{er-ag-63
-, author =	"P. Erd{\H o}s and A. Renyi"
-, title =	"Asymmetric Graphs"
-, journal =	"Acta Math. Acad. Sci. Hungar."
-, volume =	14
-, year =	1963
-, pages =	"295--315"
-, update =	"97.11 bibrelex"
+, author =      "P. Erd{\H o}s and A. Renyi"
+, title =       "Asymmetric Graphs"
+, journal =     "Acta Math. Acad. Sci. Hungar."
+, volume =      14
+, year =        1963
+, pages =       "295--315"
+, update =      "97.11 bibrelex"
 }
 
 @article{es-sgh-83
-, author =	"P. Erd{\H o}s and M. Simonovits"
-, title =	"Supersaturated graphs and hypergraphs"
-, journal =	"Combinatorica"
-, volume =	3
-, year =	1983
-, pages =	"181--192"
-, update =	"98.03 bibrelex"
+, author =      "P. Erd{\H o}s and M. Simonovits"
+, title =       "Supersaturated graphs and hypergraphs"
+, journal =     "Combinatorica"
+, volume =      3
+, year =        1983
+, pages =       "181--192"
+, update =      "98.03 bibrelex"
 }
 
 @book{es-pmc-74
-, author =	"P. Erd{\H o}s and J. Spencer"
-, title =	"Probabilistic Methods in Combinatorics"
-, publisher =	"Academic Press"
-, year =	1974
+, author =      "P. Erd{\H o}s and J. Spencer"
+, title =       "Probabilistic Methods in Combinatorics"
+, publisher =   "Academic Press"
+, year =        1974
 }
 
 @article{es-cpg-35
-, author =	"P. Erd{\H o}s and G. Szekeres"
-, title =	"A combinatorial problem in geometry"
-, journal =	"Compositio Math."
-, volume =	2
-, year =	1935
-, pages =	"463--470"
-, update =	"93.09 rote"
+, author =      "P. Erd{\H o}s and G. Szekeres"
+, title =       "A combinatorial problem in geometry"
+, journal =     "Compositio Math."
+, volume =      2
+, year =        1935
+, pages =       "463--470"
+, update =      "93.09 rote"
 }
 
 @article{es-sepeg-60
-, author =	"P. Erd{\H o}s and G. Szekeres"
-, title =	"On Some Extremeum Problem in Geometry"
-, journal =	"Ann. Univ. Sci. Budapest"
-, volume =	"3-4"
-, year =	1960
-, pages =	"53--62"
-, update =	"97.11 bibrelex"
+, author =      "P. Erd{\H o}s and G. Szekeres"
+, title =       "On Some Extremeum Problem in Geometry"
+, journal =     "Ann. Univ. Sci. Budapest"
+, volume =      "3-4"
+, year =        1960
+, pages =       "53--62"
+, update =      "97.11 bibrelex"
 }
 
 @article{et-psant-41
-, author =	"P. Erd{\H o}s and P. Tur{\'a}n"
-, title =	"On aproblem of {Sidon} in additive number theory, and on some related problems"
-, journal =	"Proc. London Math. Soc."
-, volume =	16
-, year =	1941
-, pages =	"212--215"
-, update =	"98.03 bibrelex"
+, author =      "P. Erd{\H o}s and P. Tur{\'a}n"
+, title =       "On aproblem of {Sidon} in additive number theory, and on some related problems"
+, journal =     "Proc. London Math. Soc."
+, volume =      16
+, year =        1941
+, pages =       "212--215"
+, update =      "98.03 bibrelex"
 }
 
 @book{eg-orcrg-90
-, author =	"W. Eric and L. Grimson"
-, title =	"Object Recognition by Computer: The Role of Geometric Constraints"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1990
-, update =	"98.07 agarwal"
+, author =      "W. Eric and L. Grimson"
+, title =       "Object Recognition by Computer: The Role of Geometric Constraints"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1990
+, update =      "98.07 agarwal"
 }
 
 @misc{e-cgp-
-, author =	"Jeff Erickson"
-, title =	"Computational Geometry Pages"
-, url =	"http://www.cs.duke.edu/~jeffe/compgeom/"
-, update =	"97.03 tamassia"
+, author =      "Jeff Erickson"
+, title =       "Computational Geometry Pages"
+, url = "http://www.cs.duke.edu/~jeffe/compgeom/"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{e-lblsp-95
-, author =	"Jeff Erickson"
-, title =	"Lower Bounds for Linear Satisfiability Problems"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"388--395"
-, keywords =	"lower bounds, decision trees"
-, update =	"96.09 agarwal, 96.05 mitchell"
+, author =      "Jeff Erickson"
+, title =       "Lower Bounds for Linear Satisfiability Problems"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "388--395"
+, keywords =    "lower bounds, decision trees"
+, update =      "96.09 agarwal, 96.05 mitchell"
 }
 
 @inproceedings{e-nlbch-96
-, author =	"Jeff Erickson"
-, title =	"New Lower Bounds for Convex Hull Problems in Odd Dimensions"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, site =	""
-, year =	1996
-, pages =	"1--9"
-, cites =	"am-rsps-93, af-pachv-92, b-lbact-83, c-osrch-95, csy-oscpf-95, ck-acp-70, c-ochaa-93, cm-dosch-92, c-mosga-94, cs-arscg-89, e-lblsp-95, es-blbda-95, go-copcg-95, g-ncp-63, g-eadch-72, g-cp-67, j-dfaed-41, ks-upcha-86, ms-rscp-93, m-loq-93, ph-chfsp-77, r-dchhd-92, s-uekvm-01, s-chaop-81, s-mplbc-85, s-chdch-86, s-sdlpc-91, s-opgfg-91, s-fchff-85, y-lbfch-81, z-lp-94, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Jeff Erickson"
+, title =       "New Lower Bounds for Convex Hull Problems in Odd Dimensions"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, site =        ""
+, year =        1996
+, pages =       "1--9"
+, cites =       "am-rsps-93, af-pachv-92, b-lbact-83, c-osrch-95, csy-oscpf-95, ck-acp-70, c-ochaa-93, cm-dosch-92, c-mosga-94, cs-arscg-89, e-lblsp-95, es-blbda-95, go-copcg-95, g-ncp-63, g-eadch-72, g-cp-67, j-dfaed-41, ks-upcha-86, ms-rscp-93, m-loq-93, ph-chfsp-77, r-dchhd-92, s-uekvm-01, s-chaop-81, s-mplbc-85, s-chdch-86, s-sdlpc-91, s-opgfg-91, s-fchff-85, y-lbfch-81, z-lp-94, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @article{e-nlbch-99
-, author =	"J. Erickson"
-, title =	"New Lower Bounds for Convex Hull Problems in Odd Dimensions"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1999
-, pages =	"1198--1214"
-, update =	"99.11 smid"
+, author =      "J. Erickson"
+, title =       "New Lower Bounds for Convex Hull Problems in Odd Dimensions"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1999
+, pages =       "1198--1214"
+, update =      "99.11 smid"
 }
 
 @inproceedings{e-nlbhe-96
-, author =	"Jeff Erickson"
-, title =	"New Lower Bounds for Halfspace Emptiness"
-, booktitle =	"Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1996
-, pages =	"472--481"
-, keywords =	"partition graph, partitioning algorithm, range searching, incidences"
-, update =	"97.07 agarwal"
+, author =      "Jeff Erickson"
+, title =       "New Lower Bounds for Halfspace Emptiness"
+, booktitle =   "Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1996
+, pages =       "472--481"
+, keywords =    "partition graph, partitioning algorithm, range searching, incidences"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{e-nlbhp-95
-, author =	"Jeff Erickson"
-, title =	"New Lower Bounds for {Hopcroft's} Problem"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"127--137"
-, keywords =	"partitioning algorithms"
-, cites =	"a-pal2a-90, aaas-cvgbr-93, b-lbact-83, bos-cvdo-92, bs-ca-92, c-rcsi-86, c-lbcpr-89, c-chdc-93, c-lbolr-95, csw-qoubs-92, cegsw-ccbac-90, csy-khrp-87, e-acg-87, eghsssw-irals-89, egs-cmcap-90, es-hipac-91, e-rcsgp-95, es-blbda-95, f-lbcso-81, hw-tn-65, l-ccs-90, m-rsehc-93, sy-lbadt-82, s-opgfg-91, st-epdg-83, t-clc-75, t-cgcbs-84, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Jeff Erickson"
+, title =       "New Lower Bounds for {Hopcroft's} Problem"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "127--137"
+, keywords =    "partitioning algorithms"
+, cites =       "a-pal2a-90, aaas-cvgbr-93, b-lbact-83, bos-cvdo-92, bs-ca-92, c-rcsi-86, c-lbcpr-89, c-chdc-93, c-lbolr-95, csw-qoubs-92, cegsw-ccbac-90, csy-khrp-87, e-acg-87, eghsssw-irals-89, egs-cmcap-90, es-hipac-91, e-rcsgp-95, es-blbda-95, f-lbcso-81, hw-tn-65, l-ccs-90, m-rsehc-93, sy-lbadt-82, s-opgfg-91, st-epdg-83, t-clc-75, t-cgcbs-84, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{e-nlbhp-96
-, author =	"Jeff Erickson"
-, title =	"New Lower Bounds for {Hopcroft's} Problem"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, year =	1996
-, pages =	"389--418"
-, keywords =	"range searching, incidence, partitioning algorithm, partition graph"
-, update =	"97.07 agarwal"
+, author =      "Jeff Erickson"
+, title =       "New Lower Bounds for {Hopcroft's} Problem"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, year =        1996
+, pages =       "389--418"
+, keywords =    "range searching, incidence, partitioning algorithm, partition graph"
+, update =      "97.07 agarwal"
 }
 
 @techreport{e-npsch-01
-, author =	"Jeff Erickson"
-, title =	"Nice point sets can have nasty {Delaunay} triangulations"
-, institution =	"University of Illinois, Urbana-Champaign"
-, year =	2001
-, update =	"01.07 devillers"
+, author =      "Jeff Erickson"
+, title =       "Nice point sets can have nasty {Delaunay} triangulations"
+, institution = "University of Illinois, Urbana-Champaign"
+, year =        2001
+, update =      "01.07 devillers"
 }
 
 @inproceedings{e-npsch-01i
-, author =	"Jeff Erickson"
-, title =	"Nice point sets can have nasty {Delaunay} triangulations"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
-, year =	2001
-, pages =	"96--105"
-, update =	"01.07 devillers"
+, author =      "Jeff Erickson"
+, title =       "Nice point sets can have nasty {Delaunay} triangulations"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Comput. Geom."
+, year =        2001
+, pages =       "96--105"
+, update =      "01.07 devillers"
 }
 
 @inproceedings{e-rcsgp-95
-, author =	"Jeff Erickson"
-, title =	"On the Relative Complexities of Some Geometric Problems"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"85--90"
-, update =	"95.09 jones"
+, author =      "Jeff Erickson"
+, title =       "On the Relative Complexities of Some Geometric Problems"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "85--90"
+, update =      "95.09 jones"
 }
 
 @article{e-pc-97
-, author =	"Jeff Erickson"
-, title =	"Pl{\"u}cker coordinates"
-, journal =	"Ray Tracing News"
-, volume =	10
-, number =	3
-, month =	dec
-, year =	1997
-, pages =	"electronic"
-, url =	"http://www.acm.org/tog/resources/RTNews/html/rtnv10n3.html"
-, update =	"98.07 orourke"
+, author =      "Jeff Erickson"
+, title =       "Pl{\"u}cker coordinates"
+, journal =     "Ray Tracing News"
+, volume =      10
+, number =      3
+, month =       dec
+, year =        1997
+, pages =       "electronic"
+, url = "http://www.acm.org/tog/resources/RTNews/html/rtnv10n3.html"
+, update =      "98.07 orourke"
 }
 
 @inproceedings{e-stteq-97
-, author =	"Jeff Erickson"
-, title =	"Space-Time Tradeoffs for Emptiness Queries"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"304--313"
-, keywords =	"lower bounds, range searching, partition graph"
-, cites =	"a-rs-96, am-rsps-93, ahl-sqrpc-90, b-lbact-83, bos-cvdo-94, bcp-hhihr-93, c-fdlpq-96, c-osrch-96, c-lbcpr-89, c-chdc-93, cegs-ablsp-94, cf-plhur-94, cgl-pgd-85, cr-srrpm-96, c-lbolr-97, dk-dsppu-90, de-mee-96, e-nlbhe-96, e-nlbhp-96, f-lbcso-81, m-ept-92, m-rph-92, m-loq-93, m-vrsa-93, m-rsehc-93, m-grs-94, ms-rscp-93, pa-cg-95, ps-cgi-85, t-cawrn-79, y-cmps-85, ZZZ"
-, update =	"98.07 bibrelex, 97.07 agarwal+efrat"
+, author =      "Jeff Erickson"
+, title =       "Space-Time Tradeoffs for Emptiness Queries"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "304--313"
+, keywords =    "lower bounds, range searching, partition graph"
+, cites =       "a-rs-96, am-rsps-93, ahl-sqrpc-90, b-lbact-83, bos-cvdo-94, bcp-hhihr-93, c-fdlpq-96, c-osrch-96, c-lbcpr-89, c-chdc-93, cegs-ablsp-94, cf-plhur-94, cgl-pgd-85, cr-srrpm-96, c-lbolr-97, dk-dsppu-90, de-mee-96, e-nlbhe-96, e-nlbhp-96, f-lbcso-81, m-ept-92, m-rph-92, m-loq-93, m-vrsa-93, m-rsehc-93, m-grs-94, ms-rscp-93, pa-cg-95, ps-cgi-85, t-cawrn-79, y-cmps-85, ZZZ"
+, update =      "98.07 bibrelex, 97.07 agarwal+efrat"
 }
 
 @article{e-stteq-00
-, author =	"J. Erickson"
-, title =	"Space-time tradeoffs for emptiness queries"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, year =	2000
-, pages =	"1968--1996"
-, update =	"01.04 smid"
+, author =      "J. Erickson"
+, title =       "Space-time tradeoffs for emptiness queries"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, year =        2000
+, pages =       "1968--1996"
+, update =      "01.04 smid"
 }
 
 @techreport{es-blbda-93t
-, author =	"Jeff Erickson and Raimund Seidel"
-, title =	"Better Lower Bounds on Detecting Affine and Spherical Degeneracies"
-, type =	"manuscript"
-, year =	1993
-, precedes =	"es-blbda-93, es-blbda-95"
-, update =	"98.11 bibrelex"
+, author =      "Jeff Erickson and Raimund Seidel"
+, title =       "Better Lower Bounds on Detecting Affine and Spherical Degeneracies"
+, type =        "manuscript"
+, year =        1993
+, precedes =    "es-blbda-93, es-blbda-95"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{es-blbda-93
-, author =	"Jeff Erickson and Raimund Seidel"
-, title =	"Better Lower Bounds on Detecting Affine and Spherical Degeneracies"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"528--536"
-, succeeds =	"es-blbda-93t"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 97.03 agarwal, 94.01 orourke+smid, 93.09 erickson+milone+mitchell"
+, author =      "Jeff Erickson and Raimund Seidel"
+, title =       "Better Lower Bounds on Detecting Affine and Spherical Degeneracies"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "528--536"
+, succeeds =    "es-blbda-93t"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 97.03 agarwal, 94.01 orourke+smid, 93.09 erickson+milone+mitchell"
 }
 
 @article{es-blbda-95
-, author =	"J. Erickson and R. Seidel"
-, title =	"Better lower bounds on detecting affine and spherical degeneracies"
-, journal =	"Discrete Comput. Geom."
-, volume =	13
-, year =	1995
-, pages =	"41--57"
-, succeeds =	"es-blbda-93t"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 96.05 smid"
+, author =      "J. Erickson and R. Seidel"
+, title =       "Better lower bounds on detecting affine and spherical degeneracies"
+, journal =     "Discrete Comput. Geom."
+, volume =      13
+, year =        1995
+, pages =       "41--57"
+, succeeds =    "es-blbda-93t"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 96.05 smid"
 }
 
 @article{eo-etpnm-90
-, author =	"L. Ericson and C. {\'O}'D{\'u}nlaing"
-, title =	"Enumeration of tree properties by naive methods"
-, journal =	"Algorithms Rev."
-, volume =	1
-, number =	3
-, year =	1990
-, pages =	"119--124"
+, author =      "L. Ericson and C. {\'O}'D{\'u}nlaing"
+, title =       "Enumeration of tree properties by naive methods"
+, journal =     "Algorithms Rev."
+, volume =      1
+, number =      3
+, year =        1990
+, pages =       "119--124"
 }
 
 @techreport{e-tcgep-87
-, author =	"L. W. Ericson"
-, title =	"Topologically correct graphical editing in the plane"
-, type =	"Technical {Report}"
-, number =	97
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, month =	jan
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "L. W. Ericson"
+, title =       "Topologically correct graphical editing in the plane"
+, type =        "Technical {Report}"
+, number =      97
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, month =       jan
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ey-dlge-88
-, author =	"L. W. Ericson and C. K. Yap"
-, title =	"The design of {LINETOOL}, a geometric editor"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"83--92"
-, cites =	"-pltc-85, a-ggar-88, a-grla-88, b-tcosl-79, bdmpw-gas-87, b-bdn-87, b-wcgbd-89, b-gbamp-85, bcla-casac-83, bl-as-83, cgh-snebc-88, c-pegtu-84, c-cmpr-71, c-qercf-75, cb-enaaa-80, d-smbgb-87, dmy-aobgn-86, e-tfcgc-88, e-tcgep-87, f-gcest-88, g-seppi-84, g-ac-83, km-gr-89, ks-agtpu-86, l-cae-83, m-vigau-89i, my-ngb-86, mm-chf-83, n-jcbgs-85, n-cte-83, p-lfg-66, ram-tm-84, s-fpavp-80, ss-pmp2g-83, ss-ccsm-85, s-rmes-40, s-dicpl-80, sb-ooptv-85, s-smmgc-63, u-te-48, w-eidag-73, v-ltg-80, y-snegi-79, gy-frcg-86, -m4rm-85, ZZZ"
-, update =	"99.11 bibrelex, 99.03 forrest, 98.03 bibrelex"
+, author =      "L. W. Ericson and C. K. Yap"
+, title =       "The design of {LINETOOL}, a geometric editor"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "83--92"
+, cites =       "-pltc-85, a-ggar-88, a-grla-88, b-tcosl-79, bdmpw-gas-87, b-bdn-87, b-wcgbd-89, b-gbamp-85, bcla-casac-83, bl-as-83, cgh-snebc-88, c-pegtu-84, c-cmpr-71, c-qercf-75, cb-enaaa-80, d-smbgb-87, dmy-aobgn-86, e-tfcgc-88, e-tcgep-87, f-gcest-88, g-seppi-84, g-ac-83, km-gr-89, ks-agtpu-86, l-cae-83, m-vigau-89i, my-ngb-86, mm-chf-83, n-jcbgs-85, n-cte-83, p-lfg-66, ram-tm-84, s-fpavp-80, ss-pmp2g-83, ss-ccsm-85, s-rmes-40, s-dicpl-80, sb-ooptv-85, s-smmgc-63, u-te-48, w-eidag-73, v-ltg-80, y-snegi-79, gy-frcg-86, -m4rm-85, ZZZ"
+, update =      "99.11 bibrelex, 99.03 forrest, 98.03 bibrelex"
 }
 
 @inproceedings{e-immpe-99
-, author =	"Ulf Erikson"
-, title =	"Implementing Main-Memory Point-Enclosure Algorithms"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"117--118"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Ulf Erikson"
+, title =       "Implementing Main-Memory Point-Enclosure Algorithms"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "117--118"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{e-dpp-90
-, author =	"E. Erkut"
-, title =	"The discrete $p$-dispersion problem"
-, journal =	"European J. Oper. Res."
-, volume =	46
-, number =	1
-, year =	1990
-, pages =	"48--60"
-, keywords =	"facility location, points, minmax, NP-completeness"
-, update =	"95.09 korneenko"
+, author =      "E. Erkut"
+, title =       "The discrete $p$-dispersion problem"
+, journal =     "European J. Oper. Res."
+, volume =      46
+, number =      1
+, year =        1990
+, pages =       "48--60"
+, keywords =    "facility location, points, minmax, NP-completeness"
+, update =      "95.09 korneenko"
 }
 
 @article{ebh-dplp-90
-, author =	"E. Erkut and T. Baptie and B. {von Hohenbalken}"
-, title =	"The discrete $p$-maxian location problem"
-, journal =	"Comput. Oper. Res."
-, volume =	17
-, number =	1
-, year =	1990
-, pages =	"51--61"
-, keywords =	"facility location, points"
-, update =	"95.09 korneenko"
+, author =      "E. Erkut and T. Baptie and B. {von Hohenbalken}"
+, title =       "The discrete $p$-maxian location problem"
+, journal =     "Comput. Oper. Res."
+, volume =      17
+, number =      1
+, year =        1990
+, pages =       "51--61"
+, keywords =    "facility location, points"
+, update =      "95.09 korneenko"
 }
 
 @article{en-amluf-89
-, author =	"E. Erkut and S. Neuman"
-, title =	"Analytical models for locating undesirable facilities"
-, journal =	"European J. Oper. Res."
-, volume =	40
-, number =	3
-, year =	1989
-, pages =	"275--291"
-, keywords =	"facility location, points, maxmin"
-, update =	"95.09 korneenko"
+, author =      "E. Erkut and S. Neuman"
+, title =       "Analytical models for locating undesirable facilities"
+, journal =     "European J. Oper. Res."
+, volume =      40
+, number =      3
+, year =        1989
+, pages =       "275--291"
+, keywords =    "facility location, points, maxmin"
+, update =      "95.09 korneenko"
 }
 
 @techreport{ekn-mstap-80
-, author =	"J. Ernvall and J. Katajainen and O. Nevalainen"
-, title =	"A minimal spanning tree algorithm for a point set in {Euclidean} space"
-, type =	"Report"
-, number =	24
-, institution =	"Dept. Comput. Sci., Univ. Turku"
-, address =	"Turku, Finland"
-, year =	1980
+, author =      "J. Ernvall and J. Katajainen and O. Nevalainen"
+, title =       "A minimal spanning tree algorithm for a point set in {Euclidean} space"
+, type =        "Report"
+, number =      24
+, institution = "Dept. Comput. Sci., Univ. Turku"
+, address =     "Turku, Finland"
+, year =        1980
 }
 
 @article{en-elmst-84
-, author =	"J. Ernvall and O. Nevalainen"
-, title =	"Estimating the length of minimal spanning trees in compression of files"
-, journal =	"BIT"
-, volume =	24
-, year =	1984
-, pages =	"19--32"
+, author =      "J. Ernvall and O. Nevalainen"
+, title =       "Estimating the length of minimal spanning trees in compression of files"
+, journal =     "BIT"
+, volume =      24
+, year =        1984
+, pages =       "19--32"
 }
 
 @article{e-espsn-95
-, author =	"Martin Erwig"
-, title =	"Encoding shortest paths in spatial networks"
-, journal =	"Networks"
-, volume =	26
-, year =	1995
-, pages =	"291--303"
-, keywords =	"point location, shortest paths, subdivision simplification"
-, update =	"96.01 mitchell"
+, author =      "Martin Erwig"
+, title =       "Encoding shortest paths in spatial networks"
+, journal =     "Networks"
+, volume =      26
+, year =        1995
+, pages =       "291--303"
+, keywords =    "point location, shortest paths, subdivision simplification"
+, update =      "96.01 mitchell"
 }
 
 @article{ebc-adddc-89
-, author =	"G. Eshel and M. M. Barash and V. Chandru"
-, title =	"Automatic design of a deep-drawn circumscribing preform"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	5
-, number =	2
-, year =	1989
-, pages =	"208--222"
-, update =	"95.09 korneenko"
+, author =      "G. Eshel and M. M. Barash and V. Chandru"
+, title =       "Automatic design of a deep-drawn circumscribing preform"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      5
+, number =      2
+, year =        1989
+, pages =       "208--222"
+, update =      "95.09 korneenko"
 }
 
 @techreport{ew-mmcfs-99
-, author =	"W. Espelage and E. Wanke"
-, title =	"Movement Optimization in Conveyor Flow Shop Processing with one Worker"
-, type =	"Manuscript"
-, institution =	"University of D{\"u}sseldorf, Department  of Computer Science"
-, year =	1999
-, update =	"00.03 bibrelex"
+, author =      "W. Espelage and E. Wanke"
+, title =       "Movement Optimization in Conveyor Flow Shop Processing with one Worker"
+, type =        "Manuscript"
+, institution = "University of D{\"u}sseldorf, Department  of Computer Science"
+, year =        1999
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{es-romov-94
-, author =	"C. Esperanca and H. Samet"
-, title =	"Representing Orthogonal Multidimensional Objects by Vertex Lists"
-, editor =	"C. Arcelli and L. P. Cordella and G. Sanniti di Baja"
-, booktitle =	"Aspects of Visual Form Processing"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1994
-, pages =	"209--220"
-, update =	"96.05 efrat"
+, author =      "C. Esperanca and H. Samet"
+, title =       "Representing Orthogonal Multidimensional Objects by Vertex Lists"
+, editor =      "C. Arcelli and L. P. Cordella and G. Sanniti di Baja"
+, booktitle =   "Aspects of Visual Form Processing"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1994
+, pages =       "209--220"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{e-cespd-91
-, author =	"M. Espie"
-, title =	"Computing efficiently shortest paths for degenerate metrics"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"149--152"
-, cites =	"f-gmt-70, c-pt-90i, b-sdg-87, ps-cgi-85, bm-sg-70, rlw-rsppr-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M. Espie"
+, title =       "Computing efficiently shortest paths for degenerate metrics"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "149--152"
+, cites =       "f-gmt-70, c-pt-90i, b-sdg-87, ps-cgi-85, bm-sg-70, rlw-rsppr-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{e-uasdc-90
-, author =	"M. Espie"
-, title =	"Un algorithme simple de calcul de plus court chemin en norme $L_1$ dans des regions simplement connexes"
-, booktitle =	"Journees de Geometrie Algorithmique. Pap. Conf. Sophia-Antipolis. INRIA"
-, year =	1990
-, pages =	"72--79"
-, keywords =	"$L_1$-metrics, shortest paths"
-, update =	"95.09 korneenko"
+, author =      "M. Espie"
+, title =       "Un algorithme simple de calcul de plus court chemin en norme $L_1$ dans des regions simplement connexes"
+, booktitle =   "Journees de Geometrie Algorithmique. Pap. Conf. Sophia-Antipolis. INRIA"
+, year =        1990
+, pages =       "72--79"
+, keywords =    "$L_1$-metrics, shortest paths"
+, update =      "95.09 korneenko"
 }
 
 @article{e-ggtp-88
-, author =	"C. Esposito"
-, title =	"Graph Graphics: Theory and Practice"
-, journal =	"Comput. Math. Appl."
-, volume =	15
-, number =	4
-, year =	1988
-, pages =	"247--253"
-, keywords =	"graph drawing"
-, update =	"96.09 devillers, 93.09 tamassia"
+, author =      "C. Esposito"
+, title =       "Graph Graphics: Theory and Practice"
+, journal =     "Comput. Math. Appl."
+, volume =      15
+, number =      4
+, year =        1988
+, pages =       "247--253"
+, keywords =    "graph drawing"
+, update =      "96.09 devillers, 93.09 tamassia"
 }
 
 @techreport{eoux-ipvf-94
-, author =	"V. Estivill-Castro and J. O'Rourke and J. Urrutia and D. Xu"
-, title =	"Illumination of polygons with vertex floodlights"
-, type =	"Technical {Report}"
-, number =	037
-, institution =	"Dept. Comput. Sci., Smith College"
-, month =	aug
-, year =	1994
-, keywords =	"visibility, floodlights"
-, precedes =	"eoux-ipvf-95"
-, update =	"96.01 orourke, 94.09 orourke"
+, author =      "V. Estivill-Castro and J. O'Rourke and J. Urrutia and D. Xu"
+, title =       "Illumination of polygons with vertex floodlights"
+, type =        "Technical {Report}"
+, number =      037
+, institution = "Dept. Comput. Sci., Smith College"
+, month =       aug
+, year =        1994
+, keywords =    "visibility, floodlights"
+, precedes =    "eoux-ipvf-95"
+, update =      "96.01 orourke, 94.09 orourke"
 }
 
 @article{eoux-ipvf-95
-, author =	"V. Estivill-Castro and J. O'Rourke and J. Urrutia and D. Xu"
-, title =	"Illumination of polygons with vertex floodlights"
-, journal =	"Inform. Process. Lett."
-, volume =	56
-, year =	1995
-, pages =	"9--13"
-, keywords =	"visibility, floodlights"
-, succeeds =	"eoux-ipvf-94"
-, update =	"96.01 orourke"
+, author =      "V. Estivill-Castro and J. O'Rourke and J. Urrutia and D. Xu"
+, title =       "Illumination of polygons with vertex floodlights"
+, journal =     "Inform. Process. Lett."
+, volume =      56
+, year =        1995
+, pages =       "9--13"
+, keywords =    "visibility, floodlights"
+, succeeds =    "eoux-ipvf-94"
+, update =      "96.01 orourke"
 }
 
 @techreport{er-evfof-90
-, author =	"V. Estivill-Castro and V. Raman"
-, title =	"Edge visibility for finitely oriented figures"
-, type =	"Technical {Report}"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, year =	1990
-, note =	"In preparation"
-, update =	"98.07 bibrelex"
+, author =      "V. Estivill-Castro and V. Raman"
+, title =       "Edge visibility for finitely oriented figures"
+, type =        "Technical {Report}"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, year =        1990
+, note =        "In preparation"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{er-vfop-90
-, author =	"V. Estivill-Castro and V. Raman"
-, title =	"Visibility in finitely oriented polygons"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"181--185"
-, precedes =	"er-vfop-93"
-, cites =	"at-oadvp-81, deo-secp-88, er-evfof-90, g-scop-83, g-dcopi-84a, js-clvpa-87, l-vsp-83, lw-apcfp-79, o-agta-87, rw-ocfoc-87, rw-rocs-89, srw-gtv-89, www-dpcgf-85, wwsw-suipp-86, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "V. Estivill-Castro and V. Raman"
+, title =       "Visibility in finitely oriented polygons"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "181--185"
+, precedes =    "er-vfop-93"
+, cites =       "at-oadvp-81, deo-secp-88, er-evfof-90, g-scop-83, g-dcopi-84a, js-clvpa-87, l-vsp-83, lw-apcfp-79, o-agta-87, rw-ocfoc-87, rw-rocs-89, srw-gtv-89, www-dpcgf-85, wwsw-suipp-86, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{er-vfop-93
-, author =	"V. Estivill-Castro and V. Raman"
-, title =	"Visibility in finitely oriented polygons"
-, type =	"Technical Report"
-, number =	"LANIA RT-7-93"
-, institution =	"Laboratorio Nacional de Inform{\'a}tica Avanzada"
-, year =	1993
-, note =	"also in: Proc. 2nd Canad. Conf. Comput. Geom."
-, succeeds =	"er-vfop-90"
-, update =	"98.11 bibrelex"
+, author =      "V. Estivill-Castro and V. Raman"
+, title =       "Visibility in finitely oriented polygons"
+, type =        "Technical Report"
+, number =      "LANIA RT-7-93"
+, institution = "Laboratorio Nacional de Inform{\'a}tica Avanzada"
+, year =        1993
+, note =        "also in: Proc. 2nd Canad. Conf. Comput. Geom."
+, succeeds =    "er-vfop-90"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{eu-ofioa-94
-, author =	"V. Estivill-Castro and J. Urrutia"
-, title =	"Optimal floodlight illumination of orthogonal art galleries"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"81--86"
-, keywords =	"visibility, floodlights"
-, cites =	"bglosu-fp-93, c-tsplt-91a, cru-ofipt-93, er-vfop-93, o-agta-87, r-erog-87, s-rrag-92, kkk-tgrfw-83, ZZZ"
-, update =	"98.11 bibrelex, 94.09 orourke"
+, author =      "V. Estivill-Castro and J. Urrutia"
+, title =       "Optimal floodlight illumination of orthogonal art galleries"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "81--86"
+, keywords =    "visibility, floodlights"
+, cites =       "bglosu-fp-93, c-tsplt-91a, cru-ofipt-93, er-vfop-93, o-agta-87, r-erog-87, s-rrag-92, kkk-tgrfw-83, ZZZ"
+, update =      "98.11 bibrelex, 94.09 orourke"
 }
 
 @inproceedings{eu-tficp-95
-, author =	"V. Estivill-Castro and J. Urrutia"
-, title =	"Two-Floodlight Illumination of Convex Polygons"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"62--73"
-, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
+, author =      "V. Estivill-Castro and J. Urrutia"
+, title =       "Two-Floodlight Illumination of Convex Polygons"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "62--73"
+, update =      "99.07 bibrelex, 96.01 smid, 95.05 mitchell"
 }
 
 @techreport{er-bsacv-96
-, author =	"Michal Etzion and Ari Rappoport"
-, title =	"A Boundary Sampling Algorithm for Computing the {Voronoi} Graph of a {2-D} Polygon"
-, type =	"Technical Report"
-, institution =	"Institute of Computer Science, The Hebrew University"
-, year =	1996
-, update =	"98.03 mitchell"
-, abstract =	"The Voronoi graph of a set of sites contains the
+, author =      "Michal Etzion and Ari Rappoport"
+, title =       "A Boundary Sampling Algorithm for Computing the {Voronoi} Graph of a {2-D} Polygon"
+, type =        "Technical Report"
+, institution = "Institute of Computer Science, The Hebrew University"
+, year =        1996
+, update =      "98.03 mitchell"
+, abstract =    "The Voronoi graph of a set of sites contains the
 complete symbolic information of the Voronoi diagram of the sites
 without the latter's geometry. The Voronoi graph is important for two
 reasons. First, there are applications that need only the symbolic
@@ -55770,15 +55770,15 @@ @techreport{er-bsacv-96
 }
 
 @article{er-csdsp-97
-, author =	"Michal Etzion and Ari Rappoport"
-, title =	"On Compatible Star Decompositions of Simple Polygons"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	3
-, number =	1
-, year =	1997
-, pages =	"87--95"
-, update =	"98.03 mitchell"
-, abstract =	"We introduce the notion of compatible star
+, author =      "Michal Etzion and Ari Rappoport"
+, title =       "On Compatible Star Decompositions of Simple Polygons"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      3
+, number =      1
+, year =        1997
+, pages =       "87--95"
+, update =      "98.03 mitchell"
+, abstract =    "We introduce the notion of compatible star
 decompositions of simple polygons. In general, given two polygons with
 a correspondence between their vertices, two polygonal decompositions
 of the two polygons are said to be compatible if there exists a
@@ -55807,16 +55807,16 @@ @article{er-csdsp-97
 }
 
 @article{sr-sbuss-95
-, author =	"Michal Shapira (Etzion) and Ari Rappoport"
-, title =	"Shape Blending Using the Star-Skeleton Representation"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	15
-, number =	2
-, month =	mar
-, year =	1995
-, pages =	"44--50"
-, update =	"98.03 mitchell, 96.01 held"
-, abstract =	"We present a novel approach to the problem of generating
+, author =      "Michal Shapira (Etzion) and Ari Rappoport"
+, title =       "Shape Blending Using the Star-Skeleton Representation"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      15
+, number =      2
+, month =       mar
+, year =        1995
+, pages =       "44--50"
+, update =      "98.03 mitchell, 96.01 held"
+, abstract =    "We present a novel approach to the problem of generating
 a polygon sequence that blends two simple polygons given a
 correspondence between their boundaries. Previous approaches to this
 problem, including direct vertex interpolation and an interpolation
@@ -55843,1448 +55843,1448 @@ @article{sr-sbuss-95
 }
 
 @inproceedings{egt-cal-92
-, author =	"D. Eu and E. Gu{\'e}vremont and G. Toussaint"
-, title =	"On classes of arrangements of lines"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"109--114"
-, cites =	"cl-fdsl-85, csss-otass-89, eat-atdhl-83, et-gpprl-89, hv-splsp-49, k-sades-91a, s-cesl-85, t-slaic-85, v-cbrdf-87, z-fuafc-75, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "D. Eu and E. Gu{\'e}vremont and G. Toussaint"
+, title =       "On classes of arrangements of lines"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "109--114"
+, cites =       "cl-fdsl-85, csss-otass-89, eat-atdhl-83, et-gpprl-89, hv-splsp-49, k-sades-91a, s-cesl-85, t-slaic-85, v-cbrdf-87, z-fuafc-75, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{egt-eal-93
-, author =	"D. Eu and E. Gu{\'e}vremont and G. T. Toussaint"
-, title =	"On envelopes of arrangements of lines"
-, type =	"Technical Report"
-, number =	"SOCS 93.10"
-, institution =	"McGill University, School of Computer Science"
-, month =	nov
-, year =	1993
-, precedes =	"egt-eal-96"
-, update =	"98.11 bibrelex"
+, author =      "D. Eu and E. Gu{\'e}vremont and G. T. Toussaint"
+, title =       "On envelopes of arrangements of lines"
+, type =        "Technical Report"
+, number =      "SOCS 93.10"
+, institution = "McGill University, School of Computer Science"
+, month =       nov
+, year =        1993
+, precedes =    "egt-eal-96"
+, update =      "98.11 bibrelex"
 }
 
 @article{egt-eal-96
-, author =	"D. Eu and E. Gu{\'e}vremont and G. T. Toussaint"
-, title =	"On envelopes of arrangements of lines"
-, journal =	"J. Algorithms"
-, volume =	21
-, year =	1996
-, pages =	"111--148"
-, succeeds =	"egt-eal-93"
-, update =	"98.11 bibrelex, 96.09 smid"
+, author =      "D. Eu and E. Gu{\'e}vremont and G. T. Toussaint"
+, title =       "On envelopes of arrangements of lines"
+, journal =     "J. Algorithms"
+, volume =      21
+, year =        1996
+, pages =       "111--148"
+, succeeds =    "egt-eal-93"
+, update =      "98.11 bibrelex, 96.09 smid"
 }
 
 @article{et-apctt-94
-, author =	"D. Eu and G. T. Toussaint"
-, title =	"On approximating polygonal curves in two and three dimensions"
-, journal =	"CVGIP: Graph. Models Image Process."
-, volume =	56
-, number =	3
-, month =	may
-, year =	1994
-, pages =	"231--246"
-, update =	"96.09 kreveld+orourke"
+, author =      "D. Eu and G. T. Toussaint"
+, title =       "On approximating polygonal curves in two and three dimensions"
+, journal =     "CVGIP: Graph. Models Image Process."
+, volume =      56
+, number =      3
+, month =       may
+, year =        1994
+, pages =       "231--246"
+, update =      "96.09 kreveld+orourke"
 }
 
 @book{e-e-56
-, author =	"Euclid"
-, title =	"Elements"
-, publisher =	"Dover"
-, year =	1956
-, note =	"Translated by Sir Thomas L.~Heath"
+, author =      "Euclid"
+, title =       "Elements"
+, publisher =   "Dover"
+, year =        1956
+, note =        "Translated by Sir Thomas L.~Heath"
 }
 
 @article{els-htmai-97
-, author =	"G. Evangelidis and D. B. Lomet and B. Salzberg"
-, title =	"The ${{\rm h{B}}^\Pi}$-tree: {A} multi-attribute index supporting concurrency, recovery and node consolidation"
-, journal =	"VLDB Journal"
-, volume =	6
-, year =	1997
-, pages =	"1--25"
-, update =	"97.07 agarwal"
+, author =      "G. Evangelidis and D. B. Lomet and B. Salzberg"
+, title =       "The ${{\rm h{B}}^\Pi}$-tree: {A} multi-attribute index supporting concurrency, recovery and node consolidation"
+, journal =     "VLDB Journal"
+, volume =      6
+, year =        1997
+, pages =       "1--25"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{ets-adtdr-94
-, author =	"B. L. Evans and J. Teich and C. Schwarz"
-, title =	"Automated design of two-dimensional rational decimation systems"
-, booktitle =	"IEEE Asilomar Conference on Signals, Systems, and Computers"
-, site =	"Pacific Grove, CA"
-, year =	1994
-, pages =	"498--502"
-, url =	"https://ptolemy.berkeley.edu/"
-, update =	"98.03 bibrelex"
+, author =      "B. L. Evans and J. Teich and C. Schwarz"
+, title =       "Automated design of two-dimensional rational decimation systems"
+, booktitle =   "IEEE Asilomar Conference on Signals, Systems, and Computers"
+, site =        "Pacific Grove, CA"
+, year =        1994
+, pages =       "498--502"
+, url = "https://ptolemy.berkeley.edu/"
+, update =      "98.03 bibrelex"
 }
 
 @article{ej-dvaip-87
-, author =	"D. G. Evans and S. M. Jones"
-, title =	"Detecting {Voronoi} (Area-of-Influence) Polygons"
-, journal =	"Mathematical Geology"
-, volume =	19
-, number =	6
-, year =	1987
-, pages =	"523--537"
-, annote =	"Least squares to find the points that would have a
-		 given set of polygons as their VPs. Gives a simple
-		 measure to find the closeness of fit."
+, author =      "D. G. Evans and S. M. Jones"
+, title =       "Detecting {Voronoi} (Area-of-Influence) Polygons"
+, journal =     "Mathematical Geology"
+, volume =      19
+, number =      6
+, year =        1987
+, pages =       "523--537"
+, annote =      "Least squares to find the points that would have a
+                 given set of polygons as their VPs. Gives a simple
+                 measure to find the closeness of fit."
 }
 
 @article{em-tpach-85
-, author =	"D. J. Evans and S. Mai"
-, title =	"Two parallel algorithms for the convex hull problem in a two dimensional space"
-, journal =	"Parallel Comput."
-, volume =	2
-, year =	1985
-, pages =	"313--326"
+, author =      "D. J. Evans and S. Mai"
+, title =       "Two parallel algorithms for the convex hull problem in a two dimensional space"
+, journal =     "Parallel Comput."
+, volume =      2
+, year =        1985
+, pages =       "313--326"
 }
 
 @article{es-pcvd-89
-, author =	"D. J. Evans and I. Stojmenovic"
-, title =	"On parallel computation of {Voronoi} diagrams"
-, journal =	"Parallel Comput."
-, volume =	12
-, number =	1
-, year =	1989
-, pages =	"121--125"
-, keywords =	"Voronoi diagram, parallel computations"
-, update =	"95.09 korneenko"
+, author =      "D. J. Evans and I. Stojmenovic"
+, title =       "On parallel computation of {Voronoi} diagrams"
+, journal =     "Parallel Comput."
+, volume =      12
+, number =      1
+, year =        1989
+, pages =       "121--125"
+, keywords =    "Voronoi diagram, parallel computations"
+, update =      "95.09 korneenko"
 }
 
 @article{ey-appqm-85
-, author =	"D. J. Evans and N. Y. Yousif"
-, title =	"Analysis of the performance of the parallel quicksort method"
-, journal =	"BIT"
-, volume =	25
-, year =	1985
-, pages =	"106--112"
-, update =	"96.09 orourke"
+, author =      "D. J. Evans and N. Y. Yousif"
+, title =       "Analysis of the performance of the parallel quicksort method"
+, journal =     "BIT"
+, volume =      25
+, year =        1985
+, pages =       "106--112"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{esv-otsfr-96
-, author =	"F. Evans and Steven S. Skiena and A. Varshney"
-, title =	"Optimizing Triangle Strips for Fast Rendering"
-, booktitle =	"IEEE Visualization '96 Proceedings"
-, month =	oct
-, year =	1996
-, pages =	"319--326"
-, issn =	"0-89791-864-9"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "F. Evans and Steven S. Skiena and A. Varshney"
+, title =       "Optimizing Triangle Strips for Fast Rendering"
+, booktitle =   "IEEE Visualization '96 Proceedings"
+, month =       oct
+, year =        1996
+, pages =       "319--326"
+, issn =        "0-89791-864-9"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @article{emm-sc2ma-98
-, author =	"G. Evans and A. Middleditch and N. Miles"
-, title =	"Stable Computation of the 2D Medial Axis Transform"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"577--598"
-, update =	"98.11 devillers"
+, author =      "G. Evans and A. Middleditch and N. Miles"
+, title =       "Stable Computation of the 2D Medial Axis Transform"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "577--598"
+, update =      "98.11 devillers"
 }
 
 @article{e-sci-77
-, author =	"I. S. Evans"
-, title =	"The Selection of Class Intervals"
-, journal =	"Trans. Inst. Br. Geogrs."
-, volume =	2
-, year =	1977
-, pages =	"98--124"
-, update =	"96.09 kreveld"
+, author =      "I. S. Evans"
+, title =       "The Selection of Class Intervals"
+, journal =     "Trans. Inst. Br. Geogrs."
+, volume =      2
+, year =        1977
+, pages =       "98--124"
+, update =      "96.09 kreveld"
 }
 
 @article{ekr-sgoct-87
-, author =	"R. C. Evans and G. Koppelman and V. T. Rajan"
-, title =	"Shaping geometric objects by cumulative translational sweeps"
-, journal =	"IBM J. Res. Develop."
-, volume =	31
-, year =	1987
-, pages =	"343--360"
+, author =      "R. C. Evans and G. Koppelman and V. T. Rajan"
+, title =       "Shaping geometric objects by cumulative translational sweeps"
+, journal =     "IBM J. Res. Develop."
+, volume =      31
+, year =        1987
+, pages =       "343--360"
 }
 
 @inproceedings{e-rpamt-95
-, author =	"William Evans"
-, title =	"Regular Polygons are Most Tolerant"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"109--113"
-, update =	"95.09 jones"
+, author =      "William Evans"
+, title =       "Regular Polygons are Most Tolerant"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "109--113"
+, update =      "95.09 jones"
 }
 
 @book{e-ac-73
-, author =	"S. Even"
-, title =	"Algorithmic Combinatorics"
-, publisher =	"Macmillan"
-, address =	"New York, NY"
-, year =	1973
+, author =      "S. Even"
+, title =       "Algorithmic Combinatorics"
+, publisher =   "Macmillan"
+, address =     "New York, NY"
+, year =        1973
 }
 
 @book{e-ga-79
-, author =	"S. Even"
-, title =	"Graph Algorithms"
-, publisher =	"Computer Science Press"
-, address =	"Potomac, Maryland"
-, year =	1979
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "S. Even"
+, title =       "Graph Algorithms"
+, publisher =   "Computer Science Press"
+, address =     "Potomac, Maryland"
+, year =        1979
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{ee-eingl-97
-, author =	"S. Even and G. Even"
-, title =	"Embedding Interconnection Networks in Grids via the Layered Cross Product"
-, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1203
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	""
-, keywords =	"Invited talk"
-, update =	"00.03 devillers, 98.03 mitchell"
+, author =      "S. Even and G. Even"
+, title =       "Embedding Interconnection Networks in Grids via the Layered Cross Product"
+, booktitle =   "Algorithms and Complexity (Proc. CIAC' 97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1203
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       ""
+, keywords =    "Invited talk"
+, update =      "00.03 devillers, 98.03 mitchell"
 }
 
 @inproceedings{eg-glbdb-95
-, author =	"S. Even and G. Granot"
-, title =	"Grid Layouts of Block Diagrams --- Bounding the Number of Bends in Each Connection"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"64--75"
-, keywords =	"graph drawing, orthogonal, planar"
-, update =	"95.01 tamassia"
+, author =      "S. Even and G. Granot"
+, title =       "Grid Layouts of Block Diagrams --- Bounding the Number of Bends in Each Connection"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "64--75"
+, keywords =    "graph drawing, orthogonal, planar"
+, update =      "95.01 tamassia"
 }
 
 @techreport{eg-rpdfb-94
-, author =	"S. Even and G. Granot"
-, title =	"Rectilinear Planar Drawings with Few Bends in Each Edge"
-, type =	"Technical Report"
-, number =	797
-, institution =	"Computer Science Dept., Technion"
-, year =	1994
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia"
+, author =      "S. Even and G. Granot"
+, title =       "Rectilinear Planar Drawings with Few Bends in Each Edge"
+, type =        "Technical Report"
+, number =      797
+, institution = "Computer Science Dept., Technion"
+, year =        1994
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia"
 }
 
 @article{eis-ctmfp-76
-, author =	"S. Even and A. Itai and A. Shamir"
-, title =	"On the complexity of timetable and multicommodity flow problems"
-, journal =	"SIAM J. Comput."
-, volume =	5
-, year =	1976
-, pages =	"691--703"
-, update =	"97.11 bibrelex"
+, author =      "S. Even and A. Itai and A. Shamir"
+, title =       "On the complexity of timetable and multicommodity flow problems"
+, journal =     "SIAM J. Comput."
+, volume =      5
+, year =        1976
+, pages =       "691--703"
+, update =      "97.11 bibrelex"
 }
 
 @article{es-oledp-81
-, author =	"S. Even and Y. Shiloach"
-, title =	"An On-Line Edge Deletion Problem"
-, journal =	"J. ACM"
-, volume =	28
-, year =	1981
-, pages =	"1--4"
-, update =	"94.01 tamassia"
+, author =      "S. Even and Y. Shiloach"
+, title =       "An On-Line Edge Deletion Problem"
+, journal =     "J. ACM"
+, volume =      28
+, year =        1981
+, pages =       "1--4"
+, update =      "94.01 tamassia"
 }
 
 @article{et-csn-76
-, author =	"S. Even and R. E. Tarjan"
-, title =	"Computing an st-Numbering"
-, journal =	"Theoret. Comput. Sci."
-, volume =	2
-, year =	1976
-, pages =	"339--344"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "S. Even and R. E. Tarjan"
+, title =       "Computing an st-Numbering"
+, journal =     "Theoret. Comput. Sci."
+, volume =      2
+, year =        1976
+, pages =       "339--344"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{et-nftgc-75
-, author =	"S. Even and R. E. Tarjan"
-, title =	"Network Flow and Testing Graph Connectivity"
-, journal =	"SIAM J. Comput."
-, volume =	4
-, year =	1975
-, pages =	"507--518"
-, update =	"95.05 tamassia"
+, author =      "S. Even and R. E. Tarjan"
+, title =       "Network Flow and Testing Graph Connectivity"
+, journal =     "SIAM J. Comput."
+, volume =      4
+, year =        1975
+, pages =       "507--518"
+, update =      "95.05 tamassia"
 }
 
 @techreport{e-hpnrg-86
-, author =	"H. Everett"
-, title =	"Hamiltonian paths in non-rectangular grid graphs"
-, type =	"Report"
-, number =	"86-1"
-, institution =	"Dept. Comput. Sci., Univ. Toronto"
-, address =	"Toronto, ON"
-, year =	1986
-, update =	"95.09 mitchell"
+, author =      "H. Everett"
+, title =       "Hamiltonian paths in non-rectangular grid graphs"
+, type =        "Report"
+, number =      "86-1"
+, institution = "Dept. Comput. Sci., Univ. Toronto"
+, address =     "Toronto, ON"
+, year =        1986
+, update =      "95.09 mitchell"
 }
 
 @inproceedings{e-vgsp-89
-, author =	"H. Everett"
-, title =	"The visibility graphs of spiral polygons"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	47
-, precedes =	"ec-rvgsp-90"
+, author =      "H. Everett"
+, title =       "The visibility graphs of spiral polygons"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       47
+, precedes =    "ec-rvgsp-90"
 }
 
 @techreport{e-vgr-90
-, author =	"H. Everett"
-, title =	"Visibility Graph Recognition"
-, type =	"Report"
-, number =	"231/90"
-, institution =	"Dept. Comput. Sci., Univ. Toronto"
-, address =	"Toronto, ON"
-, year =	1990
-, note =	"Ph.D. Thesis"
-, update =	"96.09 orourke"
+, author =      "H. Everett"
+, title =       "Visibility Graph Recognition"
+, type =        "Report"
+, number =      "231/90"
+, institution = "Dept. Comput. Sci., Univ. Toronto"
+, address =     "Toronto, ON"
+, year =        1990
+, note =        "Ph.D. Thesis"
+, update =      "96.09 orourke"
 }
 
 @article{ec-nrcvg-95
-, author =	"H. Everett and D. G. Corneil"
-, title =	"Negative results on characterizing visibility graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"51--63"
-, update =	"96.09 devillers"
+, author =      "H. Everett and D. G. Corneil"
+, title =       "Negative results on characterizing visibility graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "51--63"
+, update =      "96.09 devillers"
 }
 
 @article{ec-rvgsp-90
-, author =	"H. Everett and D. G. Corneil"
-, title =	"Recognizing visibility graphs of spiral polygons"
-, journal =	"J. Algorithms"
-, volume =	11
-, year =	1990
-, pages =	"1--26"
-, succeeds =	"e-vgsp-89"
+, author =      "H. Everett and D. G. Corneil"
+, title =       "Recognizing visibility graphs of spiral polygons"
+, journal =     "J. Algorithms"
+, volume =      11
+, year =        1990
+, pages =       "1--26"
+, succeeds =    "e-vgsp-89"
 }
 
 @inproceedings{ehkn-psvg-97
-, author =	"Hazel Everett and Chinh Hoang and Kyri Kilakos and Marc Noy"
-, title =	"Planar Segment Visibility Graphs"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"65--69"
-, update =	"97.11 jones"
+, author =      "Hazel Everett and Chinh Hoang and Kyri Kilakos and Marc Noy"
+, title =       "Planar Segment Visibility Graphs"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "65--69"
+, update =      "97.11 jones"
 }
 
 @article{ehkn-psvg-00
-, author =	"H. Everett and C. T. Hoang and K. Kilakos and M. Noy"
-, title =	"Planar segment visibility graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	16
-, year =	2000
-, pages =	"235--243"
-, update =	"01.04 smid"
+, author =      "H. Everett and C. T. Hoang and K. Kilakos and M. Noy"
+, title =       "Planar segment visibility graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      16
+, year =        2000
+, pages =       "235--243"
+, update =      "01.04 smid"
 }
 
 @inproceedings{ehn-sisp-96
-, author =	"H. Everett and F. Hurtado and M. Noy"
-, title =	"Stabbing information of a simple polygon"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"74--79"
-, update =	"96.09 mitchell"
+, author =      "H. Everett and F. Hurtado and M. Noy"
+, title =       "Stabbing information of a simple polygon"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "74--79"
+, update =      "96.09 mitchell"
 }
 
 @inproceedings{elrss-cssp-98
-, author =	"H. Everett and S. Lazard and S. Robbins and H. Schr{{\"o}}der and S. Whitesides"
-, title =	"Convexifying Star-Shaped Polygons"
-, booktitle =	"Proc. 10th Canad. Conf. Comput. Geom."
-, year =	1998
-, pages =	"2--3"
-, update =	"98.11 orourke"
+, author =      "H. Everett and S. Lazard and S. Robbins and H. Schr{{\"o}}der and S. Whitesides"
+, title =       "Convexifying Star-Shaped Polygons"
+, booktitle =   "Proc. 10th Canad. Conf. Comput. Geom."
+, year =        1998
+, pages =       "2--3"
+, update =      "98.11 orourke"
 }
 
 @inproceedings{elosu-scqp-92
-, author =	"H. Everett and W. Lenhart and M. H. Overmars and T. Shermer and J. Urrutia"
-, title =	"Strictly convex quadrilateralizations of polygons"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"77--83"
-, cites =	"bg-tph-90, beg-pgmg-90, c-tsplt-90i, kkk-tgrfw-83, l-dprcq-85, o-agta-87, st-ltadr-81, ZZZ"
-, update =	"98.07 agarwal+bibrelex"
+, author =      "H. Everett and W. Lenhart and M. H. Overmars and T. Shermer and J. Urrutia"
+, title =       "Strictly convex quadrilateralizations of polygons"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "77--83"
+, cites =       "bg-tph-90, beg-pgmg-90, c-tsplt-90i, kkk-tgrfw-83, l-dprcq-85, o-agta-87, st-ltadr-81, ZZZ"
+, update =      "98.07 agarwal+bibrelex"
 }
 
 @techreport{elo-rchev-93t
-, author =	"H. Everett and A. Lubiw and J. O'Rourke"
-, title =	"Recovery of convex hulls from external visibility graphs"
-, type =	"Technical Report"
-, number =	024
-, institution =	"Smith College"
-, month =	jan
-, year =	1993
-, precedes =	"elo-rchev-93"
-, update =	"98.11 bibrelex"
+, author =      "H. Everett and A. Lubiw and J. O'Rourke"
+, title =       "Recovery of convex hulls from external visibility graphs"
+, type =        "Technical Report"
+, number =      024
+, institution = "Smith College"
+, month =       jan
+, year =        1993
+, precedes =    "elo-rchev-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{elo-rchev-93
-, author =	"H. Everett and A. Lubiw and J. O'Rourke"
-, title =	"Recovery of convex hulls from external visibility graphs"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"309--314"
-, succeeds =	"elo-rchev-93t"
-, cites =	"elo-rchev-93t, o-agta-87, o-rcvg-90, o-cgc18-93, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "H. Everett and A. Lubiw and J. O'Rourke"
+, title =       "Recovery of convex hulls from external visibility graphs"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "309--314"
+, succeeds =    "elo-rchev-93t"
+, cites =       "elo-rchev-93t, o-agta-87, o-rcvg-90, o-cgc18-93, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{elrs-ist-91
-, author =	"H. Everett and K. Lyons and B. Reed and D. Souvaine"
-, title =	"Illuminating squares on a transversal"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"118--121"
-, cites =	"cru-irtp-89, e-ftssg-85, eos-smcga-84t, f-icd-77, h-ragp-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "H. Everett and K. Lyons and B. Reed and D. Souvaine"
+, title =       "Illuminating squares on a transversal"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "118--121"
+, cites =       "cru-irtp-89, e-ftssg-85, eos-smcga-84t, f-icd-77, h-ragp-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{er-egtpt-94
-, author =	"H. Everett and E. Rivera-Campo"
-, title =	"Edge Guarding a Triangulated Polyhedral Terrain"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"293--295"
-, precedes =	"er-egpt-97"
-, cites =	"ah-epmfc-77, bstz-gpt-92, o-agta-87, ZZZ"
-, update =	"98.11 bibrelex, 97.03 devillers, 94.09 jones"
+, author =      "H. Everett and E. Rivera-Campo"
+, title =       "Edge Guarding a Triangulated Polyhedral Terrain"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "293--295"
+, precedes =    "er-egpt-97"
+, cites =       "ah-epmfc-77, bstz-gpt-92, o-agta-87, ZZZ"
+, update =      "98.11 bibrelex, 97.03 devillers, 94.09 jones"
 }
 
 @article{er-egpt-97
-, author =	"H. Everett and E. Rivera-Campo"
-, title =	"Edge Guarding Polyhedral Terrain"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"201--203"
-, succeeds =	"er-egtpt-94"
-, update =	"97.11 bibrelex, 97.03 devillers"
+, author =      "H. Everett and E. Rivera-Campo"
+, title =       "Edge Guarding Polyhedral Terrain"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "201--203"
+, succeeds =    "er-egtpt-94"
+, update =      "97.11 bibrelex, 97.03 devillers"
 }
 
 @inproceedings{erk-oalla-93
-, author =	"H. Everett and J.-M. Robert and M. van Kreveld"
-, title =	"An optimal algorithm for the $({\leq} k)$-levels, with applications to separation and transversal problems"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"38--46"
-, cites =	"ass-sulbl-89, ag-nssfs-86, c-clps-85, ce-oails-92, c-narsc-87, csy-khrp-87, e-acg-87, eg-tsa-89, emprww-sls-82, ew-cbtda-86, elss-dgpps-73, h-awwss-89b, m-ltalp-83, m-fppa1-88, m-fppa2-89, m-lavd-91, o-olafs-81, ol-mcp-81, pss-ubnpk-89, s-ksacs-91, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "H. Everett and J.-M. Robert and M. van Kreveld"
+, title =       "An optimal algorithm for the $({\leq} k)$-levels, with applications to separation and transversal problems"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "38--46"
+, cites =       "ass-sulbl-89, ag-nssfs-86, c-clps-85, ce-oails-92, c-narsc-87, csy-khrp-87, e-acg-87, eg-tsa-89, emprww-sls-82, ew-cbtda-86, elss-dgpps-73, h-awwss-89b, m-ltalp-83, m-fppa1-88, m-fppa2-89, m-lavd-91, o-olafs-81, ol-mcp-81, pss-ubnpk-89, s-ksacs-91, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{erk-oalla-96
-, author =	"H. Everett and J.-M. Robert and M. van Kreveld"
-, title =	"An optimal algorithm for the $({\leq} k)$-levels, with applications to separation and transversal problems"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"247--261"
-, succeeds =	"erk-oalla-93"
-, update =	"97.03 agarwal+devillers"
+, author =      "H. Everett and J.-M. Robert and M. van Kreveld"
+, title =       "An optimal algorithm for the $({\leq} k)$-levels, with applications to separation and transversal problems"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "247--261"
+, succeeds =    "erk-oalla-93"
+, update =      "97.03 agarwal+devillers"
 }
 
 @techreport{ew-falc3-91t
-, author =	"H. Everett and S. Whitesides"
-, title =	"Finding all the largest circles in a $3$-dimensional box"
-, type =	"Technical Report"
-, number =	"TR-SOCS-91.4"
-, institution =	"School of Computer Science, McGill University"
-, address =	"Montreal"
-, month =	jun
-, year =	1991
-, precedes =	"ew-falc3-91"
-, update =	"98.11 bibrelex"
+, author =      "H. Everett and S. Whitesides"
+, title =       "Finding all the largest circles in a $3$-dimensional box"
+, type =        "Technical Report"
+, number =      "TR-SOCS-91.4"
+, institution = "School of Computer Science, McGill University"
+, address =     "Montreal"
+, month =       jun
+, year =        1991
+, precedes =    "ew-falc3-91"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ew-falc3-91
-, author =	"H. Everett and S. Whitesides"
-, title =	"Finding all the largest circles in a $3$-dimensional box"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"84--87"
-, succeeds =	"ew-falc3-91t"
-, cites =	"agss-ltacv-87, k-nptal-84a, m-lpltw-84, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "H. Everett and S. Whitesides"
+, title =       "Finding all the largest circles in a $3$-dimensional box"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "84--87"
+, succeeds =    "ew-falc3-91t"
+, cites =       "agss-ltacv-87, k-nptal-84a, m-lpltw-84, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{elr-ogdi-91
-, author =	"K. Ewacha and W. Li and I. Rival"
-, title =	"Order, genus and diagram invariance"
-, journal =	"Order"
-, volume =	8
-, year =	1991
-, pages =	"107--113"
-, update =	"98.07 bibrelex"
+, author =      "K. Ewacha and W. Li and I. Rival"
+, title =       "Order, genus and diagram invariance"
+, journal =     "Order"
+, volume =      8
+, year =        1991
+, pages =       "107--113"
+, update =      "98.07 bibrelex"
 }
 
 @article{e-hcsc-73
-, author =	"G. Ewald"
-, title =	"{Hamiltonian} circuits in simplicial complexes"
-, journal =	"Geom. Dedicata"
-, volume =	2
-, number =	1
-, month =	sep
-, year =	1973
-, pages =	"115--125"
-, update =	"98.11 bibrelex"
+, author =      "G. Ewald"
+, title =       "{Hamiltonian} circuits in simplicial complexes"
+, journal =     "Geom. Dedicata"
+, volume =      2
+, number =      1
+, month =       sep
+, year =        1973
+, pages =       "115--125"
+, update =      "98.11 bibrelex"
 }
 
 @article{e-ctfv-88
-, author =	"G. Ewald"
-, title =	"On the classification of toric {Fano} varieties"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"49--54"
+, author =      "G. Ewald"
+, title =       "On the classification of toric {Fano} varieties"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "49--54"
 }
 
 @article{e-scntv-86
-, author =	"G. Ewald"
-, title =	"Spherical complexes and nonprojective toric varieties"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"115--122"
+, author =      "G. Ewald"
+, title =       "Spherical complexes and nonprojective toric varieties"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "115--122"
 }
 
 @article{elr-dlsrd-70
-, author =	"G. Ewald and D. G. Larman and C. A. Rogers"
-, title =	"The directions of the line segments and of the $r$-dimensional balls on the boundary of a convex body in {Euclidean} space"
-, journal =	"Mathematika"
-, volume =	17
-, year =	1970
-, pages =	"1--20"
-, update =	"98.03 smid, 97.11 bibrelex"
+, author =      "G. Ewald and D. G. Larman and C. A. Rogers"
+, title =       "The directions of the line segments and of the $r$-dimensional balls on the boundary of a convex body in {Euclidean} space"
+, journal =     "Mathematika"
+, volume =      17
+, year =        1970
+, pages =       "1--20"
+, update =      "98.03 smid, 97.11 bibrelex"
 }
 
 @book{e-cva-85
-, author =	"G. M. Ewing"
-, title =	"Calculus of variations with applications"
-, publisher =	"MIT Press"
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "G. M. Ewing"
+, title =       "Calculus of variations with applications"
+, publisher =   "MIT Press"
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @techreport{fo-ttpne-86
-, author =	"G. Fabella and J. O'Rourke"
-, title =	"Twenty-two points with no empty hexagon"
-, type =	"Report"
-, number =	"JHU 86-03"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	jan
-, year =	1986
-, keywords =	"arrangements"
+, author =      "G. Fabella and J. O'Rourke"
+, title =       "Twenty-two points with no empty hexagon"
+, type =        "Report"
+, number =      "JHU 86-03"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       jan
+, year =        1986
+, keywords =    "arrangements"
 }
 
 @phdthesis{f-gapmr
-, author =	"A. Fabri"
-, title =	"G{\'e}om{\'e}trie algorithmique en parall{\`e}le sur des machines r{\'e}elles"
-, type =	"Th\`{e}se de doctorat en sciences"
-, school =	"{\'E}cole Nationale Sup\'erieure des Mines de Paris"
-, address =	"France"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"98.07 devillers"
+, author =      "A. Fabri"
+, title =       "G{\'e}om{\'e}trie algorithmique en parall{\`e}le sur des machines r{\'e}elles"
+, type =        "Th\`{e}se de doctorat en sciences"
+, school =      "{\'E}cole Nationale Sup\'erieure des Mines de Paris"
+, address =     "France"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "98.07 devillers"
 }
 
 @article{fgkss-dccga-00
-, author =	"A. Fabri and G.-J. Giezeman and L. Kettner and S. Schirra and S. Sch{\"o}nherr"
-, title =	"On the Design of {CGAL} a Computational Geometry Algorithms Library"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	30
-, number =	11
-, year =	2000
-, pages =	"1167--1202"
-, succeeds =	"fgkss-ckbgc-96, fgkss-dccga-98"
-, update =	"01.04 vismara"
-, annote =	"Special Issue on Discrete Algorithm Engineering"
+, author =      "A. Fabri and G.-J. Giezeman and L. Kettner and S. Schirra and S. Sch{\"o}nherr"
+, title =       "On the Design of {CGAL} a Computational Geometry Algorithms Library"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      30
+, number =      11
+, year =        2000
+, pages =       "1167--1202"
+, succeeds =    "fgkss-ckbgc-96, fgkss-dccga-98"
+, update =      "01.04 vismara"
+, annote =      "Special Issue on Discrete Algorithm Engineering"
 }
 
 @techreport{fgkss-dccga-98
-, author =	"A. Fabri and G.-J. Giezeman and L. Kettner and S. Schirra and S. Sch{\"o}nherr"
-, title =	"On the Design of {CGAL}, the {C}omputational {G}eometry {A}lgorithms {L}ibrary"
-, type =	"Research Report"
-, number =	"MPI-I-98-1-007"
-, institution =	"Max--Planck--Institut f{\"u}r Informatik"
-, month =	feb
-, year =	1998
-, url =	"http://data.mpi-sb.mpg.de/internet/reports.nsf/NumberView/1998-1-007"
-, update =	"99.07 vismara"
+, author =      "A. Fabri and G.-J. Giezeman and L. Kettner and S. Schirra and S. Sch{\"o}nherr"
+, title =       "On the Design of {CGAL}, the {C}omputational {G}eometry {A}lgorithms {L}ibrary"
+, type =        "Research Report"
+, number =      "MPI-I-98-1-007"
+, institution = "Max--Planck--Institut f{\"u}r Informatik"
+, month =       feb
+, year =        1998
+, url = "http://data.mpi-sb.mpg.de/internet/reports.nsf/NumberView/1998-1-007"
+, update =      "99.07 vismara"
 }
 
 @inproceedings{fgkss-ckbgc-96
-, author =	"Andreas Fabri and Geert-Jan Giezeman and Lutz Kettner and Stefan Schirra and Sven Sch{\"o}nherr"
-, title =	"The {CGAL} Kernel: {A} Basis for Geometric Computation"
-, editor =	"M. C. Lin and D. Manocha"
-, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1148
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"191--202"
-, url =	"http://www.cs.uu.nl/CGAL/Papers/wacg.ps.gz"
-, update =	"98.11 bibrelex, 97.03 tamassia"
+, author =      "Andreas Fabri and Geert-Jan Giezeman and Lutz Kettner and Stefan Schirra and Sven Sch{\"o}nherr"
+, title =       "The {CGAL} Kernel: {A} Basis for Geometric Computation"
+, editor =      "M. C. Lin and D. Manocha"
+, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1148
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "191--202"
+, url = "http://www.cs.uu.nl/CGAL/Papers/wacg.ps.gz"
+, update =      "98.11 bibrelex, 97.03 tamassia"
 }
 
 @article{f-eeccp-82
-, author =	"Fr. Fabricius-Bjerre"
-, title =	"On enclosing and enclosed conics for convex polygons and curves"
-, journal =	"Geom. Dedicata"
-, volume =	12
-, year =	1982
-, pages =	"131--136"
+, author =      "Fr. Fabricius-Bjerre"
+, title =       "On enclosing and enclosed conics for convex polygons and curves"
+, journal =     "Geom. Dedicata"
+, volume =      12
+, year =        1982
+, pages =       "131--136"
 }
 
 @inproceedings{ff-acdpf-97
-, author =	"A. E. Fabris and A. R. Forrest"
-, title =	"Antialiasing of Curves by Discrete Pre-filtering"
-, booktitle =	"Proc. SIGGRAPH '97"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"ACM Press/Addison-Wesley"
-, address =	"Los Angeles, California"
-, month =	aug
-, year =	1997
-, pages =	"317--326"
-, note =	"ISBN 0-89791-896-7"
-, keywords =	"anti-aliasing, curves, Bezier curves, sampling, filtering, reconstruction"
-, update =	"99.03 forrest"
+, author =      "A. E. Fabris and A. R. Forrest"
+, title =       "Antialiasing of Curves by Discrete Pre-filtering"
+, booktitle =   "Proc. SIGGRAPH '97"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "ACM Press/Addison-Wesley"
+, address =     "Los Angeles, California"
+, month =       aug
+, year =        1997
+, pages =       "317--326"
+, note =        "ISBN 0-89791-896-7"
+, keywords =    "anti-aliasing, curves, Bezier curves, sampling, filtering, reconstruction"
+, update =      "99.03 forrest"
 }
 
 @inproceedings{ff-hqrtd-97
-, author =	"A. E. Fabris and A. R. Forrest"
-, title =	"High Quality Rendering of Two-dimensional Continuous Curves"
-, editor =	"L. H. de Figueiredo and M. Lobo Nt."
-, booktitle =	"Proceedings of SIBGRAPI '97"
-, site =	"Campos do Jord{\~a}o"
-, organization =	"SBC-Sociedade Brasileira de Computa{\,c}{\~a}o"
-, publisher =	"IEEE Computer Society"
-, address =	"Campos do Jord{\~a}o"
-, month =	oct
-, year =	1997
-, pages =	"10--17"
-, note =	"ISBN 0-8186-8102-0"
-, isbn =	"0-8186-8102-0"
-, keywords =	"rendering, anti-aliasing, curves"
-, update =	"99.03 forrest"
+, author =      "A. E. Fabris and A. R. Forrest"
+, title =       "High Quality Rendering of Two-dimensional Continuous Curves"
+, editor =      "L. H. de Figueiredo and M. Lobo Nt."
+, booktitle =   "Proceedings of SIBGRAPI '97"
+, site =        "Campos do Jord{\~a}o"
+, organization =        "SBC-Sociedade Brasileira de Computa{\,c}{\~a}o"
+, publisher =   "IEEE Computer Society"
+, address =     "Campos do Jord{\~a}o"
+, month =       oct
+, year =        1997
+, pages =       "10--17"
+, note =        "ISBN 0-8186-8102-0"
+, isbn =        "0-8186-8102-0"
+, keywords =    "rendering, anti-aliasing, curves"
+, update =      "99.03 forrest"
 }
 
 @inproceedings{fsf-efans-97
-, author =	"A. E. Fabris and L. Silva and A. R. Forrest"
-, title =	"An Efficient Filling Algorithm for Non-simple Closed Curves using the Point Containment Paradigm"
-, editor =	"L. H. de Figueiredo and M. Lobo Nt."
-, booktitle =	"Proceedings of SIBGRAPI '97"
-, site =	"Campos do Jord{\~a}o"
-, organization =	"SBC-Sociedade Brasileira de Computa{\,c}{\~a}o"
-, publisher =	"IEEE Computer Society"
-, address =	"Campos do Jord{\~a}o"
-, month =	oct
-, year =	1997
-, pages =	"2--9"
-, note =	"ISBN 0-8186-8102-0"
-, isbn =	"0-8186-8102-0"
-, keywords =	"area filling, point containment, rendering"
-, update =	"99.03 forrest"
+, author =      "A. E. Fabris and L. Silva and A. R. Forrest"
+, title =       "An Efficient Filling Algorithm for Non-simple Closed Curves using the Point Containment Paradigm"
+, editor =      "L. H. de Figueiredo and M. Lobo Nt."
+, booktitle =   "Proceedings of SIBGRAPI '97"
+, site =        "Campos do Jord{\~a}o"
+, organization =        "SBC-Sociedade Brasileira de Computa{\,c}{\~a}o"
+, publisher =   "IEEE Computer Society"
+, address =     "Campos do Jord{\~a}o"
+, month =       oct
+, year =        1997
+, pages =       "2--9"
+, note =        "ISBN 0-8186-8102-0"
+, isbn =        "0-8186-8102-0"
+, keywords =    "area filling, point containment, rendering"
+, update =      "99.03 forrest"
 }
 
 @inproceedings{fsf-sdpbc-98
-, author =	"A. E. Fabris and L. Silva and A. R. Forrest"
-, title =	"Stroking Discrete Polynomial B{\'e}zier Curves via Point Containment Paradigm"
-, editor =	"L. da F. Cost and G. C{\^a}mara"
-, booktitle =	"Proceedings of SIBGRAPI '98"
-, site =	"IMPA, Rio de Janeiro"
-, organization =	"SBC-Sociedade Brasileira de Computa{\,c}{\~a}o"
-, publisher =	"IEEE Computer Society"
-, address =	"Rio de Janeiro"
-, month =	oct
-, year =	1998
-, pages =	"94--101"
-, note =	"International Symposium of Computer Graphics and Image Processing"
-, isbn =	"0-8186-9215-4"
-, keywords =	"area filling, point containment, rendering"
-, update =	"00.11 smid, 00.07 icking, 99.03 forrest"
+, author =      "A. E. Fabris and L. Silva and A. R. Forrest"
+, title =       "Stroking Discrete Polynomial B{\'e}zier Curves via Point Containment Paradigm"
+, editor =      "L. da F. Cost and G. C{\^a}mara"
+, booktitle =   "Proceedings of SIBGRAPI '98"
+, site =        "IMPA, Rio de Janeiro"
+, organization =        "SBC-Sociedade Brasileira de Computa{\,c}{\~a}o"
+, publisher =   "IEEE Computer Society"
+, address =     "Rio de Janeiro"
+, month =       oct
+, year =        1998
+, pages =       "94--101"
+, note =        "International Symposium of Computer Graphics and Image Processing"
+, isbn =        "0-8186-9215-4"
+, keywords =    "area filling, point containment, rendering"
+, update =      "00.11 smid, 00.07 icking, 99.03 forrest"
 }
 
 @article{f-iradr-95
-, author =	"M. A. Facello"
-, title =	"Implementation of a Randomized Algorithm for {Delaunay} and Regular Triangulations in Three Dimensions"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	12
-, number =	4
-, month =	jun
-, year =	1995
-, pages =	"349--370"
-, update =	"97.07 held"
+, author =      "M. A. Facello"
+, title =       "Implementation of a Randomized Algorithm for {Delaunay} and Regular Triangulations in Three Dimensions"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      12
+, number =      4
+, month =       jun
+, year =        1995
+, pages =       "349--370"
+, update =      "97.07 held"
 }
 
 @techreport{f-irtmc-90
-, author =	"M. A. Facello"
-, title =	"Improved Ray Tracing Methods for {CSG} Modeling Systems"
-, type =	"Report"
-, number =	"JHU-90/05"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1990
-, update =	"93.09 goodrich"
+, author =      "M. A. Facello"
+, title =       "Improved Ray Tracing Methods for {CSG} Modeling Systems"
+, type =        "Report"
+, number =      "JHU-90/05"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1990
+, update =      "93.09 goodrich"
 }
 
 @inproceedings{fpf-stgrl-88
-, author =	"K. M. Fairchild and S. E. Poltrock and G. W. Furnas"
-, title =	"SemNet: Three-Dimensional Graphic Representation of Large Knowledge Bases"
-, editor =	"R. Guindon"
-, booktitle =	"Cognitive Science and its Applications for Human-Computer Interaction"
-, publisher =	"Lawrence Erlbaum Associates"
-, year =	1988
-, pages =	"201--233"
-, keywords =	"graph drawing, 3D"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "K. M. Fairchild and S. E. Poltrock and G. W. Furnas"
+, title =       "SemNet: Three-Dimensional Graphic Representation of Large Knowledge Bases"
+, editor =      "R. Guindon"
+, booktitle =   "Cognitive Science and its Applications for Human-Computer Interaction"
+, publisher =   "Lawrence Erlbaum Associates"
+, year =        1988
+, pages =       "201--233"
+, keywords =    "graph drawing, 3D"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @inproceedings{f-caisu-85
-, author =	"John Fairfield"
-, title =	"Cellular Approach For Image Segmentation Using {Voronoi} Diagrams"
-, booktitle =	"1985 IEEE Computer Society Workshop on Computer Architecture for Pattern Analysis and Image Database Management."
-, publisher =	"IEEE"
-, address =	"New York, NY"
-, year =	1985
-, pages =	"237--241"
-, keywords =	"image segmentation, cellular automata, Voronoi diagrams, Delaunay triangulation"
-, annote =	"Cellular automata to compute VD"
-, abstract =	"Cellular representations of Voronoi diagrams are
-		 calculated simply by cellular automata. A cellular
-		 automation is presented that segments the image on the
-		 basis of a cellular representation of the Voronoi
-		 diagram. The output of the automation is a fuzzy subset
-		 of the Delaunay triangulation, which, when graphed with
-		 the strength of the line proportional to the strength
-		 of membership, segments the image. To within cell
-		 granularity, the segmentation is independent of
-		 rotation, translation, and magnification of the image.
-		 5 refs."
+, author =      "John Fairfield"
+, title =       "Cellular Approach For Image Segmentation Using {Voronoi} Diagrams"
+, booktitle =   "1985 IEEE Computer Society Workshop on Computer Architecture for Pattern Analysis and Image Database Management."
+, publisher =   "IEEE"
+, address =     "New York, NY"
+, year =        1985
+, pages =       "237--241"
+, keywords =    "image segmentation, cellular automata, Voronoi diagrams, Delaunay triangulation"
+, annote =      "Cellular automata to compute VD"
+, abstract =    "Cellular representations of Voronoi diagrams are
+                 calculated simply by cellular automata. A cellular
+                 automation is presented that segments the image on the
+                 basis of a cellular representation of the Voronoi
+                 diagram. The output of the automation is a fuzzy subset
+                 of the Delaunay triangulation, which, when graphed with
+                 the strength of the line proportional to the strength
+                 of membership, segments the image. To within cell
+                 granularity, the segmentation is independent of
+                 rotation, translation, and magnification of the image.
+                 5 refs."
 }
 
 @inproceedings{f-csgft-79
-, author =	"J. Fairfield"
-, title =	"Contoured shape generation: forms that people see in dot patterns"
-, booktitle =	"Proc. IEEE Conf. Systems Man Cybernet."
-, year =	1979
-, pages =	"60--64"
+, author =      "J. Fairfield"
+, title =       "Contoured shape generation: forms that people see in dot patterns"
+, booktitle =   "Proc. IEEE Conf. Systems Man Cybernet."
+, year =        1979
+, pages =       "60--64"
 }
 
 @article{f-sdpvd-83
-, author =	"J. Fairfield"
-, title =	"Segmenting dot patterns by {Voronoi} diagram concavity"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-32"
-, year =	1983
-, pages =	"104--110"
+, author =      "J. Fairfield"
+, title =       "Segmenting dot patterns by {Voronoi} diagram concavity"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-32"
+, year =        1983
+, pages =       "104--110"
 }
 
 @article{fp-nsacs-90
-, author =	"B. Falcidieno and C. Pienovi"
-, title =	"Natural Surface Approximation by Constrained Stochastic Interpolation"
-, journal =	"Comput. Aided Design"
-, volume =	22
-, number =	3
-, year =	1990
-, pages =	"167--172"
-, annote =	"First we build a CDT of constraint edges and important
-		 points. Then any points where error is too high are
-		 inserted in the triangulation by dividing the relevant
-		 triangle into three pieces. Then any triangles that are
-		 too big are broken into four with the midpoint randomly
-		 perturbed (like with fractals)."
+, author =      "B. Falcidieno and C. Pienovi"
+, title =       "Natural Surface Approximation by Constrained Stochastic Interpolation"
+, journal =     "Comput. Aided Design"
+, volume =      22
+, number =      3
+, year =        1990
+, pages =       "167--172"
+, annote =      "First we build a CDT of constraint edges and important
+                 points. Then any points where error is too high are
+                 inserted in the triangulation by dividing the relevant
+                 triangle into three pieces. Then any triangles that are
+                 too big are broken into four with the midpoint randomly
+                 perturbed (like with fractals)."
 }
 
 @article{f-hxpsm-83
-, author =	"K. J. Falconer"
-, title =	"Hammer's x-ray problem and the stable manifold theorem"
-, journal =	"J. London Math. Soc."
-, volume =	2
-, number =	28
-, year =	1983
-, pages =	"149--160"
-, update =	"98.11 bibrelex"
+, author =      "K. J. Falconer"
+, title =       "Hammer's x-ray problem and the stable manifold theorem"
+, journal =     "J. London Math. Soc."
+, volume =      2
+, number =      28
+, year =        1983
+, pages =       "149--160"
+, update =      "98.11 bibrelex"
 }
 
 @article{f-xpps-83
-, author =	"K. J. Falconer"
-, title =	"X-ray problems for point sources"
-, journal =	"Proc. London Math. Soc."
-, volume =	3
-, number =	46
-, year =	1983
-, pages =	"241--262"
-, update =	"98.11 bibrelex"
+, author =      "K. J. Falconer"
+, title =       "X-ray problems for point sources"
+, journal =     "Proc. London Math. Soc."
+, volume =      3
+, number =      46
+, year =        1983
+, pages =       "241--262"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{fr-hta-87
-, author =	"M. Falk and R. Randell"
-, title =	"On the homotopy theory in arrangements"
-, booktitle =	"Complex Analytic Singularities"
-, publisher =	"North-Holland"
-, address =	"Amsterdam"
-, year =	1987
-, pages =	"101--124"
-, update =	"98.07 agarwal"
+, author =      "M. Falk and R. Randell"
+, title =       "On the homotopy theory in arrangements"
+, booktitle =   "Complex Analytic Singularities"
+, publisher =   "North-Holland"
+, address =     "Amsterdam"
+, year =        1987
+, pages =       "101--124"
+, update =      "98.07 agarwal"
 }
 
 @article{f-gcpmr-88
-, author =	"C. Faloutsos"
-, title =	"Gray codes for partial match and range queries"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	44
-, year =	1988
-, pages =	"1381--1393"
-, update =	"97.07 agarwal"
+, author =      "C. Faloutsos"
+, title =       "Gray codes for partial match and range queries"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      44
+, year =        1988
+, pages =       "1381--1393"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{fg-andqu-96
-, author =	"C. Faloutsos and V. Gaede"
-, title =	"Analysis of $n$-dimensional quadtrees using the {Hausdorff} fractal dimension"
-, booktitle =	"Proc. 22nd VLDB Conference"
-, year =	1996
-, pages =	"40--50"
-, update =	"99.07 bibrelex, 97.07 agarwal"
+, author =      "C. Faloutsos and V. Gaede"
+, title =       "Analysis of $n$-dimensional quadtrees using the {Hausdorff} fractal dimension"
+, booktitle =   "Proc. 22nd VLDB Conference"
+, year =        1996
+, pages =       "40--50"
+, update =      "99.07 bibrelex, 97.07 agarwal"
 }
 
 @inproceedings{fl-ffaid-95
-, author =	"C. Faloutsos and K.-I. Lin"
-, title =	"{FastMap}: {A} fast algorithm for indexing, data-mining and visualization of traditional and multimedia databases"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1995
-, pages =	"163--173"
-, update =	"99.07 bibrelex, 97.07 agarwal"
+, author =      "C. Faloutsos and K.-I. Lin"
+, title =       "{FastMap}: {A} fast algorithm for indexing, data-mining and visualization of traditional and multimedia databases"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1995
+, pages =       "163--173"
+, update =      "99.07 bibrelex, 97.07 agarwal"
 }
 
 @inproceedings{frm-fsmts-94
-, author =	"C. Faloutsos and M. Ranganathan and Y. Manolopoulos"
-, title =	"Fast subsequence matching in time-series databases"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1994
-, pages =	"86--93"
-, update =	"97.07 agarwal"
+, author =      "C. Faloutsos and M. Ranganathan and Y. Manolopoulos"
+, title =       "Fast subsequence matching in time-series databases"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1994
+, pages =       "86--93"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{fr-dsamu-91
-, author =	"C. Faloutsos and Y. Rong"
-, title =	"{DOT}: {A} spatial access method using fractals"
-, booktitle =	"Proc. 7th IEEE Internat. Conf. Data Eng."
-, year =	1991
-, pages =	"152--158"
-, update =	"97.07 agarwal"
+, author =      "C. Faloutsos and Y. Rong"
+, title =       "{DOT}: {A} spatial access method using fractals"
+, booktitle =   "Proc. 7th IEEE Internat. Conf. Data Eng."
+, year =        1991
+, pages =       "152--158"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{fr-fskr-89
-, author =	"C. Faloutsos and S. Roseman"
-, title =	"Fractals for secondary key retrieval"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1989
-, pages =	"247--252"
-, update =	"97.07 agarwal"
+, author =      "C. Faloutsos and S. Roseman"
+, title =       "Fractals for secondary key retrieval"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1989
+, pages =       "247--252"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{fsr-aoosa-87
-, author =	"C. Faloutsos and T. Sellis and N. Roussopoulos"
-, title =	"Analysis of Object Oriented Spatial Access Methods"
-, booktitle =	"Proc. SIGMOD Conf. on Management of Data"
-, year =	1987
-, pages =	"426--439"
-, update =	"97.07 agarwal, 96.09 kreveld"
+, author =      "C. Faloutsos and T. Sellis and N. Roussopoulos"
+, title =       "Analysis of Object Oriented Spatial Access Methods"
+, booktitle =   "Proc. SIGMOD Conf. on Management of Data"
+, year =        1987
+, pages =       "426--439"
+, update =      "97.07 agarwal, 96.09 kreveld"
 }
 
 @techreport{f-qpvmc-87
-, author =	"B. Faltings"
-, title =	"Qualitative place vocabularies for mechanisms in configuration space"
-, type =	"Report"
-, number =	1360
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1987
-, keywords =	"artificial intelligence"
+, author =      "B. Faltings"
+, title =       "Qualitative place vocabularies for mechanisms in configuration space"
+, type =        "Report"
+, number =      1360
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1987
+, keywords =    "artificial intelligence"
 }
 
 @inproceedings{fh-cfaia-82
-, author =	"J. Q. Fang and T. S. Huang"
-, title =	"A corner finding algorithm for image analysis and registration"
-, booktitle =	"Proc. AAAI Conf."
-, year =	1982
-, pages =	"46--49"
-, update =	"98.11 bibrelex"
+, author =      "J. Q. Fang and T. S. Huang"
+, title =       "A corner finding algorithm for image analysis and registration"
+, booktitle =   "Proc. AAAI Conf."
+, year =        1982
+, pages =       "46--49"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{fb-rgmtb-91
-, author =	"Shiaofen Fang and Beat Br{\"u}derlin"
-, title =	"Robustness in geometric modeling --- tolerance-based methods"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"85--101"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Shiaofen Fang and Beat Br{\"u}derlin"
+, title =       "Robustness in geometric modeling --- tolerance-based methods"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "85--101"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @article{fp-acdt-94
-, author =	"T.-P. Fang and L. A. Piegl"
-, title =	"Algorithm for Constrained {Delaunay} Triangulation"
-, journal =	"Visual Comput."
-, volume =	10
-, number =	5
-, year =	1994
-, pages =	"255--265"
-, update =	"96.01 held"
+, author =      "T.-P. Fang and L. A. Piegl"
+, title =       "Algorithm for Constrained {Delaunay} Triangulation"
+, journal =     "Visual Comput."
+, volume =      10
+, number =      5
+, year =        1994
+, pages =       "255--265"
+, update =      "96.01 held"
 }
 
 @article{fp-adtch-92
-, author =	"T.-P. Fang and L. A. Piegl"
-, title =	"Algorithm for {Delaunay} Triangulation and Convex-hull Computation Using Sparse Matrix"
-, journal =	"Comput. Aided Design"
-, volume =	24
-, number =	8
-, month =	aug
-, year =	1992
-, pages =	"425--436"
-, annote =	"Circumcircle algorithm. Sorts by $x$-coord to speed
-		 search. Timings given seem to fit this pattern."
+, author =      "T.-P. Fang and L. A. Piegl"
+, title =       "Algorithm for {Delaunay} Triangulation and Convex-hull Computation Using Sparse Matrix"
+, journal =     "Comput. Aided Design"
+, volume =      24
+, number =      8
+, month =       aug
+, year =        1992
+, pages =       "425--436"
+, annote =      "Circumcircle algorithm. Sorts by $x$-coord to speed
+                 search. Timings given seem to fit this pattern."
 }
 
 @article{fp-dttd-95
-, author =	"T. P. Fang and L. A. Piegl"
-, title =	"Delaunay Triangulation in Three Dimensions"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	15
-, number =	5
-, month =	sep
-, year =	1995
-, pages =	"62--69"
-, update =	"96.01 held"
+, author =      "T. P. Fang and L. A. Piegl"
+, title =       "Delaunay Triangulation in Three Dimensions"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      15
+, number =      5
+, month =       sep
+, year =        1995
+, pages =       "62--69"
+, update =      "96.01 held"
 }
 
 @article{fp-dtuug-93
-, author =	"T.-P. Fang and L. A. Piegl"
-, title =	"{Delaunay} Triangulation Using a Uniform Grid"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	13
-, number =	3
-, month =	may
-, year =	1993
-, pages =	"36--48"
-, update =	"93.09 held"
-, annote =	"Circumcircle algorithm with buckets.  DFS starting at
+, author =      "T.-P. Fang and L. A. Piegl"
+, title =       "{Delaunay} Triangulation Using a Uniform Grid"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      13
+, number =      3
+, month =       may
+, year =        1993
+, pages =       "36--48"
+, update =      "93.09 held"
+, annote =      "Circumcircle algorithm with buckets.  DFS starting at
 middle point, deleting points as they are surrounded.  Claims that 16/9
 points per bucket (on average) is fastest."
 }
 
 @article{fst-gcfcs-95
-, author =	"A. O. Farahat and P. F. Stiller and J. C. Trinkle"
-, title =	"On the Geometry of Contact Formation Cells for Systems of Polygons"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	11
-, number =	4
-, month =	aug
-, year =	1995
-, pages =	"522--536"
-, update =	"96.01 held"
+, author =      "A. O. Farahat and P. F. Stiller and J. C. Trinkle"
+, title =       "On the Geometry of Contact Formation Cells for Systems of Polygons"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      11
+, number =      4
+, month =       aug
+, year =        1995
+, pages =       "522--536"
+, update =      "96.01 held"
 }
 
 @article{f-cvccp-82
-, author =	"G. Farin"
-, title =	"A construction for visual {$C^{1}$} continuity of polynomial surface patches"
-, journal =	"Comput. Graph. Image Process."
-, volume =	20
-, year =	1982
-, pages =	"272--282"
+, author =      "G. Farin"
+, title =       "A construction for visual {$C^{1}$} continuity of polynomial surface patches"
+, journal =     "Comput. Graph. Image Process."
+, volume =      20
+, year =        1982
+, pages =       "272--282"
 }
 
 @book{f-cscag-93
-, author =	"G. Farin"
-, title =	"Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide"
-, publisher =	"Academic Press"
-, year =	1993
-, update =	"97.11 bibrelex"
+, author =      "G. Farin"
+, title =       "Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide"
+, publisher =   "Academic Press"
+, year =        1993
+, update =      "97.11 bibrelex"
 }
 
 @book{f-ncspg-95
-, author =	"G. Farin"
-, title =	"NURB Curves and Surfaces, from Projective Geometry to Practical Use"
-, publisher =	"A.K. Peters"
-, year =	1995
-, update =	"98.07 bibrelex"
+, author =      "G. Farin"
+, title =       "NURB Curves and Surfaces, from Projective Geometry to Practical Use"
+, publisher =   "A.K. Peters"
+, year =        1995
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{f-sbvd-97
-, author =	"Gerald Farin"
-, title =	"Surfaces Based on {Voronoi} Diagrams"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	33
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Gerald Farin"
+, title =       "Surfaces Based on {Voronoi} Diagrams"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       33
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{f-sodt-90
-, author =	"G. Farin"
-, title =	"Surfaces over {Dirichlet} Tessellations"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	7
-, year =	1990
-, pages =	"281--292"
-, update =	"00.03 bibrelex+devillers"
+, author =      "G. Farin"
+, title =       "Surfaces over {Dirichlet} Tessellations"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      7
+, year =        1990
+, pages =       "281--292"
+, update =      "00.03 bibrelex+devillers"
 }
 
 @article{f-eopss-85
-, author =	"R. Farouki"
-, title =	"Exact offset procedures for simple solids"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	2
-, year =	1985
-, pages =	"257--279"
-, update =	"98.07 bibrelex"
+, author =      "R. Farouki"
+, title =       "Exact offset procedures for simple solids"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      2
+, year =        1985
+, pages =       "257--279"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{fj-cpccc-94
-, author =	"R. Farouki and J. Johnstone"
-, title =	"Computing point/curve and curve/curve bisectors"
-, editor =	"R. B. Fisher"
-, booktitle =	"Design and Application of Curves and Surfaces: Mathematics of Surfaces V"
-, series =	"327--354"
-, publisher =	"Oxford University Press"
-, year =	1994
-, update =	"98.07 bibrelex"
+, author =      "R. Farouki and J. Johnstone"
+, title =       "Computing point/curve and curve/curve bisectors"
+, editor =      "R. B. Fisher"
+, booktitle =   "Design and Application of Curves and Surfaces: Mathematics of Surfaces V"
+, series =      "327--354"
+, publisher =   "Oxford University Press"
+, year =        1994
+, update =      "98.07 bibrelex"
 }
 
 @techreport{fj-bpppc-91
-, author =	"R. Farouki and J. K. Johnstone"
-, title =	"The bisector of a point and a plane parametric curve"
-, type =	"Technical {Report}"
-, number =	"JHU-91-21"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	nov
-, year =	1991
+, author =      "R. Farouki and J. K. Johnstone"
+, title =       "The bisector of a point and a plane parametric curve"
+, type =        "Technical {Report}"
+, number =      "JHU-91-21"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       nov
+, year =        1991
 }
 
 @techreport{f-tsaei-86
-, author =	"R. T. Farouki"
-, title =	"Trimmed surface algorithms for the evaluation and interrogation of solid boundary representations"
-, type =	"Report"
-, number =	"RC 12052"
-, institution =	"Manufacturing Res. Dept., IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1986
+, author =      "R. T. Farouki"
+, title =       "Trimmed surface algorithms for the evaluation and interrogation of solid boundary representations"
+, type =        "Report"
+, number =      "RC 12052"
+, institution = "Manufacturing Res. Dept., IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1986
 }
 
 @article{fj-bpppc-94
-, author =	"R. T. Farouki and J. K. Johnstone"
-, title =	"The Bisector of a Point and a Plane Parametric Curve"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	11
-, year =	1994
-, pages =	"117--151"
-, update =	"95.05 held"
+, author =      "R. T. Farouki and J. K. Johnstone"
+, title =       "The Bisector of a Point and a Plane Parametric Curve"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      11
+, year =        1994
+, pages =       "117--151"
+, update =      "95.05 held"
 }
 
 % ### also claimed pages 101--127
 @article{fn-appoc-90
-, author =	"R. T. Farouki and C. A. Neff"
-, title =	"Analytic Properties of Plane Offset Curves"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	7
-, number =	"1--4"
-, month =	jun
-, year =	1990
-, pages =	"83--99"
-, update =	"95.05 held"
+, author =      "R. T. Farouki and C. A. Neff"
+, title =       "Analytic Properties of Plane Offset Curves"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      7
+, number =      "1--4"
+, month =       jun
+, year =        1990
+, pages =       "83--99"
+, update =      "95.05 held"
 }
 
 @techreport{fr-apbf-87
-, author =	"R. T. Farouki and V. T. Rajan"
-, title =	"Algorithms for polynomials in {Bernstein} form"
-, type =	"Report"
-, number =	"??"
-, institution =	"Manufacturing Res. Dept., IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1987
+, author =      "R. T. Farouki and V. T. Rajan"
+, title =       "Algorithms for polynomials in {Bernstein} form"
+, type =        "Report"
+, number =      "??"
+, institution = "Manufacturing Res. Dept., IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1987
 }
 
 @article{fr-spccc-98
-, author =	"R. T. Farouki and R. Ramamurthy"
-, title =	"Specified-Precision Computation of Curve/Curve Bisectors"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"599--619"
-, update =	"98.11 devillers"
+, author =      "R. T. Farouki and R. Ramamurthy"
+, title =       "Specified-Precision Computation of Curve/Curve Bisectors"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "599--619"
+, update =      "98.11 devillers"
 }
 
 @article{fm-rpdsa-85
-, author =	"N. Farvardin and J. W. Modestino"
-, title =	"Rate-distortion performance of {DPCM} schemes for autoregresssive sources"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	31
-, year =	1985
-, pages =	"402--418"
-, update =	"98.03 bibrelex"
+, author =      "N. Farvardin and J. W. Modestino"
+, title =       "Rate-distortion performance of {DPCM} schemes for autoregresssive sources"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      31
+, year =        1985
+, pages =       "402--418"
+, update =      "98.03 bibrelex"
 }
 
 % journal???
 @article{f-slrpg-48
-, author =	"I. Fary"
-, title =	"On Straight Lines Representation of Planar Graphs"
-, journal =	"Acta Sci. Math. Szeged"
-, volume =	11
-, year =	1948
-, pages =	"229--233"
-, keywords =	"graph drawing"
-, update =	"97.11 bibrelex, 93.09 tamassia"
+, author =      "I. Fary"
+, title =       "On Straight Lines Representation of Planar Graphs"
+, journal =     "Acta Sci. Math. Szeged"
+, volume =      11
+, year =        1948
+, pages =       "229--233"
+, keywords =    "graph drawing"
+, update =      "97.11 bibrelex, 93.09 tamassia"
 }
 
 @book{f-tdcvg-93
-, author =	"Olivier Faugeras"
-, title =	"Three-Dimensional Computer Vision: A Geometric Viewpoint"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1993
+, author =      "Olivier Faugeras"
+, title =       "Three-Dimensional Computer Vision: A Geometric Viewpoint"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1993
 }
 
 @article{fhmb-pa3do-84
-, author =	"O. Faugeras and M. Hebert and P. Mussi and J.-D. Boissonnat"
-, title =	"Polyhedral approximation of 3-{D} objects without holes"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	25
-, year =	1984
-, pages =	"169--183"
+, author =      "O. Faugeras and M. Hebert and P. Mussi and J.-D. Boissonnat"
+, title =       "Polyhedral approximation of 3-{D} objects without holes"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      25
+, year =        1984
+, pages =       "169--183"
 }
 
 @article{flb-rsddt-90
-, author =	"O. D. Faugeras and E. {Le Bras-Mehlman} and J. D. Boissonnat"
-, title =	"Representing Stereo Data With The {Delaunay} Triangulation"
-, journal =	"Artif. Intell."
-, volume =	44
-, number =	"1--2"
-, month =	jul
-, year =	1990
-, pages =	"41--87"
-, keywords =	"stereo data, Delaunay triangulation, stereo vision, probabilistic geometry"
-, annote =	"CDT algorithm via inserting extra points on compulsory
-		 line segments. Uses bucketing for speed."
-, abstract =	"This article proposes a coherent way of interpolating
-		 three-dimensional data obtained by stero, for example,
-		 with a simplical polyhedral surface. The proposed
-		 method is based on the use of the constrained Delaunay
-		 triangulation; the polyhedral surface is obtained by
-		 using a simple visibility property to mark tetrahedra
-		 likely to be empty. The method is intrinsically
-		 discontinuity-preserving, works for multiple viewpoints
-		 and yields both a surface representation of objects and
-		 a volume representation of free space which may be
-		 useful in robotics. Algorithms to implement the method
-		 are described and their complexity analyzed in the
-		 worst-case and average-case situations where tools of
-		 probabilistic geometry are used. (Author abstract) 37
-		 Refs."
+, author =      "O. D. Faugeras and E. {Le Bras-Mehlman} and J. D. Boissonnat"
+, title =       "Representing Stereo Data With The {Delaunay} Triangulation"
+, journal =     "Artif. Intell."
+, volume =      44
+, number =      "1--2"
+, month =       jul
+, year =        1990
+, pages =       "41--87"
+, keywords =    "stereo data, Delaunay triangulation, stereo vision, probabilistic geometry"
+, annote =      "CDT algorithm via inserting extra points on compulsory
+                 line segments. Uses bucketing for speed."
+, abstract =    "This article proposes a coherent way of interpolating
+                 three-dimensional data obtained by stero, for example,
+                 with a simplical polyhedral surface. The proposed
+                 method is based on the use of the constrained Delaunay
+                 triangulation; the polyhedral surface is obtained by
+                 using a simple visibility property to mark tetrahedra
+                 likely to be empty. The method is intrinsically
+                 discontinuity-preserving, works for multiple viewpoints
+                 and yields both a surface representation of objects and
+                 a volume representation of free space which may be
+                 useful in robotics. Algorithms to implement the method
+                 are described and their complexity analyzed in the
+                 worst-case and average-case situations where tools of
+                 probabilistic geometry are used. (Author abstract) 37
+                 Refs."
 }
 
 @article{fp-ochr3-84
-, author =	"O. D. Faugeras and J. Ponce"
-, title =	"An object-centered hierarchical representation for $3$-d objects: {The} prism-tree"
-, journal =	"Special Issue of Topics on Computational Geometry"
-, volume =	38
-, number =	1
-, month =	apr
-, year =	1984
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "O. D. Faugeras and J. Ponce"
+, title =       "An object-centered hierarchical representation for $3$-d objects: {The} prism-tree"
+, journal =     "Special Issue of Topics on Computational Geometry"
+, volume =      38
+, number =      1
+, month =       apr
+, year =        1984
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @book{fp-cgdm-79
-, author =	"I. D. Faux and M. J. Pratt"
-, title =	"Computational Geometry for Design and Manufacture"
-, publisher =	"Ellis Horwood"
-, address =	"Chichester, UK"
-, year =	1979
-, update =	"97.03 schwarzkopf"
+, author =      "I. D. Faux and M. J. Pratt"
+, title =       "Computational Geometry for Design and Manufacture"
+, publisher =   "Ellis Horwood"
+, address =     "Chichester, UK"
+, year =        1979
+, update =      "97.03 schwarzkopf"
 }
 
 @article{fv-sappm-85
-, author =	"J.-P. Faye and J. Vignes"
-, title =	"Stochastic Approach of the Permutation-Perturbation Method for Round-off Error Analysis"
-, journal =	"Applied Numerical Mathematics"
-, volume =	1
-, year =	1985
-, pages =	"349--362"
-, update =	"98.03 bibrelex"
+, author =      "J.-P. Faye and J. Vignes"
+, title =       "Stochastic Approach of the Permutation-Perturbation Method for Round-off Error Analysis"
+, journal =     "Applied Numerical Mathematics"
+, volume =      1
+, year =        1985
+, pages =       "349--362"
+, update =      "98.03 bibrelex"
 }
 
 @article{f-crdua-83
-, author =	"R. Featherstone"
-, title =	"The calculation of robot dynamics using articulated-body inertias"
-, journal =	"Internat. J. Robot. Res."
-, volume =	2
-, number =	1
-, year =	1983
-, pages =	"13--30"
-, update =	"97.11 bibrelex"
+, author =      "R. Featherstone"
+, title =       "The calculation of robot dynamics using articulated-body inertias"
+, journal =     "Internat. J. Robot. Res."
+, volume =      2
+, number =      1
+, year =        1983
+, pages =       "13--30"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{fg-oaac-88t
-, author =	"T. Feder and D. H. Greene"
-, title =	"Optimal Algorithms for Approximate Clustering"
-, institution =	"Dept. of Computer Science, Stanford University"
-, year =	1988
-, keywords =	"clustering"
-, update =	"95.01 smid, 93.09 milone+mitchell"
+, author =      "T. Feder and D. H. Greene"
+, title =       "Optimal Algorithms for Approximate Clustering"
+, institution = "Dept. of Computer Science, Stanford University"
+, year =        1988
+, keywords =    "clustering"
+, update =      "95.01 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{fg-oaac-88i
-, author =	"T. Feder and D. H. Greene"
-, title =	"Optimal Algorithms for Approximate Clustering"
-, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
-, year =	1988
-, pages =	"434--444"
-, update =	"95.01 smid"
+, author =      "T. Feder and D. H. Greene"
+, title =       "Optimal Algorithms for Approximate Clustering"
+, booktitle =   "Proc. 20th Annu. ACM Sympos. Theory Comput."
+, year =        1988
+, pages =       "434--444"
+, update =      "95.01 smid"
 }
 
 @inproceedings{fm-cpgcs-91
-, author =	"T. Feder and R. Motwani"
-, title =	"Clique partitions, graph compression, and speeding up algoithms"
-, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
-, year =	1991
-, pages =	"123--133"
-, update =	"97.11 bibrelex"
+, author =      "T. Feder and R. Motwani"
+, title =       "Clique partitions, graph compression, and speeding up algoithms"
+, booktitle =   "Proc. 27th Annu. ACM Sympos. Theory Comput."
+, year =        1991
+, pages =       "123--133"
+, update =      "97.11 bibrelex"
 }
 
 @book{f-gmt-70
-, author =	"H. Federer"
-, title =	"Geometric Measure Theory"
-, publisher =	"Springer-Verlag"
-, year =	1970
-, update =	"98.07 bibrelex"
+, author =      "H. Federer"
+, title =       "Geometric Measure Theory"
+, publisher =   "Springer-Verlag"
+, year =        1970
+, update =      "98.07 bibrelex"
 }
 
 @incollection{f-dpsds-82
-, author =	"P. J. Federico"
-, title =	"Descartes on polyhedra: {A} study of the {De} {Solidorum} {Elementis}"
-, booktitle =	"Sources in the History of Mathematics and Physical Sciences"
-, volume =	4
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "P. J. Federico"
+, title =       "Descartes on polyhedra: {A} study of the {De} {Solidorum} {Elementis}"
+, booktitle =   "Sources in the History of Mathematics and Physical Sciences"
+, volume =      4
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @techreport{f-cspoo-87
-, author =	"E. B. Feinberg"
-, title =	"Characterizing the Shortest Path of an Object Among Obstacles"
-, type =	"Manuscript"
-, institution =	"AT\& T Bell Labs"
-, year =	1987
-, succeeds =	"f-cspoo-89"
-, update =	"95.09 korneenko, 93.09 milone+mitchell"
+, author =      "E. B. Feinberg"
+, title =       "Characterizing the Shortest Path of an Object Among Obstacles"
+, type =        "Manuscript"
+, institution = "AT\& T Bell Labs"
+, year =        1987
+, succeeds =    "f-cspoo-89"
+, update =      "95.09 korneenko, 93.09 milone+mitchell"
 }
 
 @article{f-cspoo-89
-, author =	"E. B. Feinberg"
-, title =	"Characterizing the shortest path of an object among obstacles"
-, journal =	"Inform. Process. Lett."
-, volume =	31
-, year =	1989
-, pages =	"257--264"
-, keywords =	"motion planning, ladder"
-, precedes =	"f-cspoo-87"
-, update =	"95.09 korneenko"
+, author =      "E. B. Feinberg"
+, title =       "Characterizing the shortest path of an object among obstacles"
+, journal =     "Inform. Process. Lett."
+, volume =      31
+, year =        1989
+, pages =       "257--264"
+, keywords =    "motion planning, ladder"
+, precedes =    "f-cspoo-87"
+, update =      "95.09 korneenko"
 }
 
 @article{fp-ffptp-89
-, author =	"E. B. Feinberg and C. H. Papadimitriou"
-, title =	"Finding feasible paths for a two-point body"
-, journal =	"J. Algorithms"
-, volume =	10
-, year =	1989
-, pages =	"109--119"
+, author =      "E. B. Feinberg and C. H. Papadimitriou"
+, title =       "Finding feasible paths for a two-point body"
+, journal =     "J. Algorithms"
+, volume =      10
+, year =        1989
+, pages =       "109--119"
 }
 
 @book{f-ocscs-88
-, author =	"D. G. Feitelson"
-, title =	"Optical computing: {A} survey for computer scientists"
-, publisher =	"MIT Press"
-, address =	"Cambridge, Massachusetts, London, England"
-, year =	1988
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "D. G. Feitelson"
+, title =       "Optical computing: {A} survey for computer scientists"
+, publisher =   "MIT Press"
+, address =     "Cambridge, Massachusetts, London, England"
+, year =        1988
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @article{ft-itgp-97
-, author =	"F. R. Feito and J. C. Torres"
-, title =	"Inclusion Test for General Polyhedra"
-, journal =	"Comput. \& Graphics"
-, volume =	21
-, number =	1
-, month =	jan
-, year =	1997
-, pages =	"23--30"
-, update =	"97.11 held"
+, author =      "F. R. Feito and J. C. Torres"
+, title =       "Inclusion Test for General Polyhedra"
+, journal =     "Comput. \& Graphics"
+, volume =      21
+, number =      1
+, month =       jan
+, year =        1997
+, pages =       "23--30"
+, update =      "97.11 held"
 }
 
 @article{f-fctcs-87
-, author =	"G. {Fejes T{\'o}th}"
-, title =	"Finite covering by translates of centrally symmetric convex domains"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"353--363"
-, update =	"93.09 erickson"
+, author =      "G. {Fejes T{\'o}th}"
+, title =       "Finite covering by translates of centrally symmetric convex domains"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "353--363"
+, update =      "93.09 erickson"
 }
 
 @article{fgw-fspsc-89
-, author =	"G. {Fejes T{\'o}th} and P. Gritzmann and J. M. Wills"
-, title =	"Finite sphere packing and sphere covering"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"19--40"
-, update =	"93.09 erickson"
+, author =      "G. {Fejes T{\'o}th} and P. Gritzmann and J. M. Wills"
+, title =       "Finite sphere packing and sphere covering"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "19--40"
+, update =      "93.09 erickson"
 }
 
 @incollection{fk-srrtp-93
-, author =	"G. {Fejes T{\'o}th} and W. Kuperberg"
-, title =	"A Survey of Recent Results in the Theory of Packing and Covering"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"251--279"
-, keywords =	"survey paper, discrete geometry, packing, covering, tiling"
-, update =	"93.09 erickson"
+, author =      "G. {Fejes T{\'o}th} and W. Kuperberg"
+, title =       "A Survey of Recent Results in the Theory of Packing and Covering"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "251--279"
+, keywords =    "survey paper, discrete geometry, packing, covering, tiling"
+, update =      "93.09 erickson"
 }
 
 @article{f-dptut-86
-, author =	"L. {Fejes T{\'o}th}"
-, title =	"Densest packing of translates of the union of two circles"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"307--314"
-, update =	"93.09 erickson"
+, author =      "L. {Fejes T{\'o}th}"
+, title =       "Densest packing of translates of the union of two circles"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "307--314"
+, update =      "93.09 erickson"
 }
 
 @article{f-ecd-78
-, author =	"L. {Fejes T{\'o}th}"
-, title =	"Evading convex discs"
-, journal =	"Studia Scientiarum Mathematicarum Hungarica"
-, volume =	13
-, year =	1978
-, pages =	"453--461"
-, update =	"93.09 milone+mitchell"
+, author =      "L. {Fejes T{\'o}th}"
+, title =       "Evading convex discs"
+, journal =     "Studia Scientiarum Mathematicarum Hungarica"
+, volume =      13
+, year =        1978
+, pages =       "453--461"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{f-icd-77
-, author =	"L. {Fejes T{\'o}th}"
-, title =	"Illumination of convex discs"
-, journal =	"Acta Math. Acad. Sci. Hungar."
-, volume =	29
-, number =	"3--4"
-, year =	1977
-, pages =	"355--360"
-, update =	"93.09 erickson"
+, author =      "L. {Fejes T{\'o}th}"
+, title =       "Illumination of convex discs"
+, journal =     "Acta Math. Acad. Sci. Hungar."
+, volume =      29
+, number =      "3--4"
+, year =        1977
+, pages =       "355--360"
+, update =      "93.09 erickson"
 }
 
 @book{f-lidea-53
-, author =	"L. {Fejes T{\'o}th}"
-, title =	"{Lagerungen} in der {Ebene}, auf der {Kugel} und im {Raum}"
-, edition =	"1st"
-, publisher =	"Springer-Verlag"
-, year =	1953
-, update =	"97.11 bibrelex"
+, author =      "L. {Fejes T{\'o}th}"
+, title =       "{Lagerungen} in der {Ebene}, auf der {Kugel} und im {Raum}"
+, edition =     "1st"
+, publisher =   "Springer-Verlag"
+, year =        1953
+, update =      "97.11 bibrelex"
 }
 
 @book{f-ldead-72
-, author =	"L. {Fejes T{\'o}th}"
-, title =	"Lagerungen in der Ebene, auf der Kugel und im Raum"
-, edition =	"2nd"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1972
-, update =	"93.09 erickson"
+, author =      "L. {Fejes T{\'o}th}"
+, title =       "Lagerungen in der Ebene, auf der Kugel und im Raum"
+, edition =     "2nd"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1972
+, update =      "93.09 erickson"
 }
 
 @article{f-plcl-66
-, author =	"L. {Fejes T{\'o}th}"
-, title =	"On the Permeability of a Layer of Circle-layer"
-, journal =	"Studia Scientiarum Mathematicarum Hungarica"
-, volume =	1
-, year =	1966
-, pages =	"5--10"
-, update =	"93.09 milone+mitchell"
+, author =      "L. {Fejes T{\'o}th}"
+, title =       "On the Permeability of a Layer of Circle-layer"
+, journal =     "Studia Scientiarum Mathematicarum Hungarica"
+, volume =      1
+, year =        1966
+, pages =       "5--10"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{f-plp-68
-, author =	"L. {Fejes T{\'o}th}"
-, title =	"On the Permeability of a Layer of Parallelograms"
-, journal =	"Studia Scientiarum Mathematicarum Hungarica"
-, volume =	3
-, year =	1968
-, pages =	"195--200"
-, update =	"93.09 milone+mitchell"
+, author =      "L. {Fejes T{\'o}th}"
+, title =       "On the Permeability of a Layer of Parallelograms"
+, journal =     "Studia Scientiarum Mathematicarum Hungarica"
+, volume =      3
+, year =        1968
+, pages =       "195--200"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{f-icd-50
-, author =	"L. {Fejes T{\'o}th}"
-, title =	"Some packing and covering theorems"
-, journal =	"Acta Sci. Math. Szeged"
-, volume =	"12/A"
-, year =	1950
-, pages =	"62--67"
-, update =	"97.11 bibrelex, 97.03 pocchiola, 96.05 pocchiola"
+, author =      "L. {Fejes T{\'o}th}"
+, title =       "Some packing and covering theorems"
+, journal =     "Acta Sci. Math. Szeged"
+, volume =      "12/A"
+, year =        1950
+, pages =       "62--67"
+, update =      "97.11 bibrelex, 97.03 pocchiola, 96.05 pocchiola"
 }
 
 @article{fh-usk-63
-, author =	"L. {Fejes T{\'o}th} and A. Heppes"
-, title =	"{\"U}ber stabile {K{\"o}rpersysteme}"
-, journal =	"Compositio Mathematica"
-, volume =	15
-, number =	2
-, year =	1963
-, pages =	"119--126"
-, update =	"98.03 bibrelex"
+, author =      "L. {Fejes T{\'o}th} and A. Heppes"
+, title =       "{\"U}ber stabile {K{\"o}rpersysteme}"
+, journal =     "Compositio Mathematica"
+, volume =      15
+, number =      2
+, year =        1963
+, pages =       "119--126"
+, update =      "98.03 bibrelex"
 }
 
 @mastersthesis{f-dpmp-89
-, author =	"S{\'a}ndor P. Fekete"
-, title =	"Das Piano Movers' Problem"
-, type =	"Diplom Thesis"
-, school =	"Mathematisches Institut der Universit{\"a}t zu K{\"o}ln"
-, year =	1989
-, keywords =	"master thesis"
-, update =	"98.03 mitchell"
+, author =      "S{\'a}ndor P. Fekete"
+, title =       "Das Piano Movers' Problem"
+, type =        "Diplom Thesis"
+, school =      "Mathematisches Institut der Universit{\"a}t zu K{\"o}ln"
+, year =        1989
+, keywords =    "master thesis"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{f-faasc-92
-, author =	"S{\'a}ndor P. Fekete"
-, title =	"Finding all anchored squares in a convex polygon in subquadratic time"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"71--76"
-, cites =	"c-kiikf-50, dko-fliet-87, dj-nlbma-89, e-spccc-13, e-mccp-15, kw-onupp-91, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "S{\'a}ndor P. Fekete"
+, title =       "Finding all anchored squares in a convex polygon in subquadratic time"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "71--76"
+, cites =       "c-kiikf-50, dko-fliet-87, dj-nlbma-89, e-spccc-13, e-mccp-15, kw-onupp-91, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @techreport{f-fmlte-98
-, author =	"S{\'a}ndor P. Fekete"
-, title =	"Finding Maximum Length Tours under {Euclidean} Metrics"
-, type =	"Technical Report"
-, number =	"98-317"
-, institution =	"Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
-, year =	1998
-, update =	"98.03 mitchell"
-, annote =	"Proves NP-hardness of max-TSP under Euclidean norms in 3
+, author =      "S{\'a}ndor P. Fekete"
+, title =       "Finding Maximum Length Tours under {Euclidean} Metrics"
+, type =        "Technical Report"
+, number =      "98-317"
+, institution = "Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
+, year =        1998
+, update =      "98.03 mitchell"
+, annote =      "Proves NP-hardness of max-TSP under Euclidean norms in 3
                   or higher dimension.  Contrast with the recent
                   polynomial-time algorithm of Barvinoki et al
                   \cite{bjww-ptamp-98} for polytope distance
@@ -57293,37 +57293,37 @@ @techreport{f-fmlte-98
 }
 
 @phdthesis{f-gtsp-92
-, author =	"S{\'a}ndor P. Fekete"
-, title =	"Geometry and the Travelling Salesman Problem"
-, type =	"Ph.{D}. Thesis"
-, school =	"Department of Combinatorics and Optimization, University of Waterloo"
-, address =	"Waterloo, ON"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"98.03 mitchell"
+, author =      "S{\'a}ndor P. Fekete"
+, title =       "Geometry and the Travelling Salesman Problem"
+, type =        "Ph.{D}. Thesis"
+, school =      "Department of Combinatorics and Optimization, University of Waterloo"
+, address =     "Waterloo, ON"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "98.03 mitchell"
 }
 
 @techreport{f-cmlrb-92
-, author =	"S{\'a}ndor P. Fekete"
-, title =	"On the complexity of min-link red-blue separation"
-, type =	"Manuscript"
-, institution =	"Department of Applied Mathematics, SUNY Stony Brook, NY"
-, year =	1992
-, update =	"98.03 mitchell, 95.09 mitchell"
+, author =      "S{\'a}ndor P. Fekete"
+, title =       "On the complexity of min-link red-blue separation"
+, type =        "Manuscript"
+, institution = "Department of Applied Mathematics, SUNY Stony Brook, NY"
+, year =        1992
+, update =      "98.03 mitchell, 95.09 mitchell"
 }
 
 @techreport{f-oasp-97
-, author =	"S{\'a}ndor P. Fekete"
-, title =	"Optimizing the area of simple polygons"
-, number =	"97-256"
-, institution =	"Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
-, year =	1997
-, url =	"ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr97-256.ps.gz"
-, keywords =	"geometric optimization, area, simple polygons, point separation, complexity, approximation, Traveling Salesman Problem, Pick's theorem, grid points, polyhedra; 90C28, 68Q25"
-, succeeds =	"fp-aosp-93"
-, update =	"00.11 smid, 00.07 smid, 98.03 mitchell"
-, annote =	"Submitted to DCG for publication."
-, abstract =	"We discuss problems of optimizing the area of a simple polygon for a
+, author =      "S{\'a}ndor P. Fekete"
+, title =       "Optimizing the area of simple polygons"
+, number =      "97-256"
+, institution = "Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
+, year =        1997
+, url = "ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr97-256.ps.gz"
+, keywords =    "geometric optimization, area, simple polygons, point separation, complexity, approximation, Traveling Salesman Problem, Pick's theorem, grid points, polyhedra; 90C28, 68Q25"
+, succeeds =    "fp-aosp-93"
+, update =      "00.11 smid, 00.07 smid, 98.03 mitchell"
+, annote =      "Submitted to DCG for publication."
+, abstract =    "We discuss problems of optimizing the area of a simple polygon for a
 given set of vertices P and show that these problems are very closely
 related to problems of optimizing the number of points from a set Q in
 a simple polygon with vertex set P. We prove that it is NP-complete
@@ -57349,105 +57349,105 @@ @techreport{f-oasp-97
 }
 
 @techreport{f-shmts-98
-, author =	"S{\'a}ndor P. Fekete"
-, title =	"Simplicity and Hardness of the Maximum Traveling Salesman Problem under Geometric Distances"
-, type =	"Manuscript (submitted)"
-, institution =	"Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
-, year =	1998
-, keywords =	"geometric optimization, complexity, Traveling Salesman Problem"
-, update =	"98.07 mitchell"
+, author =      "S{\'a}ndor P. Fekete"
+, title =       "Simplicity and Hardness of the Maximum Traveling Salesman Problem under Geometric Distances"
+, type =        "Manuscript (submitted)"
+, institution = "Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
+, year =        1998
+, keywords =    "geometric optimization, complexity, Traveling Salesman Problem"
+, update =      "98.07 mitchell"
 }
 
 @inproceedings{fhw-nrvrg-96
-, author =	"S{\'a}ndor P. Fekete and M. E. Houle and S. Whitesides"
-, title =	"New results on a visibility representation of graphs in 3-D"
-, editor =	"F. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"234--241"
-, keywords =	"visibility graphs"
-, precedes =	"behflmrrswz-vrg3d-98"
-, update =	"98.11 bibrelex, 98.07 rote, 98.03 mitchell, 97.03 rote, 96.09 orourke"
+, author =      "S{\'a}ndor P. Fekete and M. E. Houle and S. Whitesides"
+, title =       "New results on a visibility representation of graphs in 3-D"
+, editor =      "F. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "234--241"
+, keywords =    "visibility graphs"
+, precedes =    "behflmrrswz-vrg3d-98"
+, update =      "98.11 bibrelex, 98.07 rote, 98.03 mitchell, 97.03 rote, 96.09 orourke"
 }
 
 @inproceedings{fhw-wleph-97
-, author =	"S{\'a}ndor P. Fekete and Michael E. Houle and Sue Whitesides"
-, title =	"The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"272--283"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "S{\'a}ndor P. Fekete and Michael E. Houle and Sue Whitesides"
+, title =       "The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "272--283"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{fm-rbvg3-96
-, author =	"S{\'a}ndor P. Fekete and Henk Meijer"
-, title =	"Rectangle and Box Visibility Graphs in 3D"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"31--34"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "S{\'a}ndor P. Fekete and Henk Meijer"
+, title =       "Rectangle and Box Visibility Graphs in 3D"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "31--34"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @unpublished{fm-gaim-93
-, author =	"S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
-, title =	"Geometric Aspects of Injection Molding"
-, year =	1993
-, note =	"Workshop on Geometric and Computational Aspects of
+, author =      "S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
+, title =       "Geometric Aspects of Injection Molding"
+, year =        1993
+, note =        "Workshop on Geometric and Computational Aspects of
               Injection Molding, Bellairs Research Institute, February 5--12"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @techreport{fm-hds-97
-, author =	"S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
-, title =	"Histogram Decomposition and Stereolithography"
-, type =	"Technical Report"
-, number =	"97-280"
-, institution =	"Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
-, year =	1997
-, update =	"98.03 mitchell"
+, author =      "S{\'a}ndor P. Fekete and Joseph S. B. Mitchell"
+, title =       "Histogram Decomposition and Stereolithography"
+, type =        "Technical Report"
+, number =      "97-280"
+, institution = "Mathematisches Institut, Universit{\"a}t zu K{\"o}ln"
+, year =        1997
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{fmw-cwkmp-00
-, author =	"Sandor P. Fekete and Joseph S. B. Mitchell and Karin Weinbrecht"
-, title =	"On the Continuous {Weber} and $k$-Median Problems"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"70--79"
-, update =	"00.11 jones"
+, author =      "Sandor P. Fekete and Joseph S. B. Mitchell and Karin Weinbrecht"
+, title =       "On the Continuous {Weber} and $k$-Median Problems"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "70--79"
+, update =      "00.11 jones"
 }
 
 @inproceedings{fp-aosp-93
-, author =	"S{\'a}ndor P. Fekete and W. R. Pulleyblank"
-, title =	"Area optimization of simple polygons"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"173--182"
-, precedes =	"f-aosp-97"
-, cites =	"aiks-fkpmd-91, bddg-fep-85, c-tsplt-91a, c-ig-61, ddg-fsp-83, dj-nlbma-89, eorw-fmakg-92, egh-lp-89, f-gtsp-92, ggj-sncgp-76, gj-cigtn-79, o-pom3d-80, p-gzz-99, p-nchcp-79, rt-rplbo-86, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 93.09 jones"
+, author =      "S{\'a}ndor P. Fekete and W. R. Pulleyblank"
+, title =       "Area optimization of simple polygons"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "173--182"
+, precedes =    "f-aosp-97"
+, cites =       "aiks-fkpmd-91, bddg-fep-85, c-tsplt-91a, c-ig-61, ddg-fsp-83, dj-nlbma-89, eorw-fmakg-92, egh-lp-89, f-gtsp-92, ggj-sncgp-76, gj-cigtn-79, o-pom3d-80, p-gzz-99, p-nchcp-79, rt-rplbo-86, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 93.09 jones"
 }
 
 @article{fw-artp-97
-, author =	"S{\'a}ndor P. Fekete and Gerhard J. Woeginger"
-, title =	"Angle-Restricted Tours in the Plane"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, number =	4
-, year =	1997
-, pages =	"195--218"
-, update =	"98.03 mitchell"
-, abstract =	"For a given set $A\subseteq\ (-\pi;+\pi]$ of angles, the problem ``Angle-Restricted Tour'' (ART) is to decide whether a set $P$ of $n$ points in the
+, author =      "S{\'a}ndor P. Fekete and Gerhard J. Woeginger"
+, title =       "Angle-Restricted Tours in the Plane"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, number =      4
+, year =        1997
+, pages =       "195--218"
+, update =      "98.03 mitchell"
+, abstract =    "For a given set $A\subseteq\ (-\pi;+\pi]$ of angles, the problem ``Angle-Restricted Tour'' (ART) is to decide whether a set $P$ of $n$ points in the
 Euclidean plane allows a closed directed tour consisting of straight line segments, such that all angles between consecutive line segments are from the
 set $A$.
 \par
@@ -57456,2835 +57456,2835 @@ @article{fw-artp-97
 }
 
 @article{ft-ousls-86
-, author =	"A. Feldstein and P. R. Turner"
-, title =	"Overflow, underflow, and severe loss of significance in floating-point addition and subtraction"
-, journal =	"IMA J. Numer. Analysis"
-, volume =	6
-, year =	1986
-, pages =	"241--251"
-, update =	"98.11 bibrelex"
+, author =      "A. Feldstein and P. R. Turner"
+, title =       "Overflow, underflow, and severe loss of significance in floating-point addition and subtraction"
+, journal =     "IMA J. Numer. Analysis"
+, volume =      6
+, year =        1986
+, pages =       "241--251"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ft-alfdp-85
-, author =	"P. Di Felice and R. Tamassia"
-, title =	"Automatic Layout of Flow Diagrams: Preliminary Analysis"
-, booktitle =	"Proc. ISMM"
-, year =	1985
-, pages =	"263--267"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Di Felice and R. Tamassia"
+, title =       "Automatic Layout of Flow Diagrams: Preliminary Analysis"
+, booktitle =   "Proc. ISMM"
+, year =        1985
+, pages =       "263--267"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{f-iptia-68
-, author =	"W. Feller"
-, title =	"An introduction to probability theory and its applications"
-, edition =	"3rd"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1968
-, update =	"98.03 bibrelex"
+, author =      "W. Feller"
+, title =       "An introduction to probability theory and its applications"
+, edition =     "3rd"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1968
+, update =      "98.03 bibrelex"
 }
 
 @incollection{f-pc6ck-89
-, author =	"M. Fellows"
-, title =	"Problem Corner: 6. The complexity of knot triviality and the {Arf} invariant"
-, booktitle =	"Proc. AMS-IMS-SIAM Joint Summer Research Conf."
-, series =	"Contemporary Mathematics"
-, publisher =	"American Mathematical Society"
-, year =	1989
-, pages =	"189--190"
-, update =	"97.11 bibrelex"
+, author =      "M. Fellows"
+, title =       "Problem Corner: 6. The complexity of knot triviality and the {Arf} invariant"
+, booktitle =   "Proc. AMS-IMS-SIAM Joint Summer Research Conf."
+, series =      "Contemporary Mathematics"
+, publisher =   "American Mathematical Society"
+, year =        1989
+, pages =       "189--190"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{fhw-dpmtw-93
-, author =	"Michael R. Fellows and Michael T. Hallett and H. Todd Wareham"
-, title =	"DNA Physical Mapping: {Three} Ways Difficult"
-, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	726
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"157--168"
-, update =	"94.01 smid, 93.09 milone+mitchell"
+, author =      "Michael R. Fellows and Michael T. Hallett and H. Todd Wareham"
+, title =       "DNA Physical Mapping: {Three} Ways Difficult"
+, booktitle =   "Proc. 1st Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      726
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "157--168"
+, update =      "94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{f-3iipo-94
-, author =	"S. Felsner"
-, title =	"3-Interval Irreducible Partially Ordered Sets"
-, journal =	"Order"
-, volume =	11
-, year =	1994
-, pages =	"97--125"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Felsner"
+, title =       "3-Interval Irreducible Partially Ordered Sets"
+, journal =     "Order"
+, volume =      11
+, year =        1994
+, pages =       "97--125"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{f-nap-96
-, author =	"Stefan Felsner"
-, title =	"On the Number of Arrangements of Pseudolines"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"30--37"
-, cites =	"bepy-htlp-91, blwsz-om-93, eg-bt-87, eg-tsa-89, g-pcbgs-80, gp-sccca-84, gp-asotd-93, g-as-72, k-ah-92, s-nrdec-84, w-mksfs-86, ZZZ"
-, update =	"98.07 bibrelex, 97.11 bibrelex, 96.05 efrat"
+, author =      "Stefan Felsner"
+, title =       "On the Number of Arrangements of Pseudolines"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "30--37"
+, cites =       "bepy-htlp-91, blwsz-om-93, eg-bt-87, eg-tsa-89, g-pcbgs-80, gp-sccca-84, gp-asotd-93, g-as-72, k-ah-92, s-nrdec-84, w-mksfs-86, ZZZ"
+, update =      "98.07 bibrelex, 97.11 bibrelex, 96.05 efrat"
 }
 
 @article{f-nap-97
-, author =	"Stefan Felsner"
-, title =	"On the Number of Arrangements of Pseudolines"
-, journal =	"Discrete Comput. Geom."
-, volume =	18
-, year =	1997
-, pages =	"257--267"
-, update =	"98.03 agarwal"
+, author =      "Stefan Felsner"
+, title =       "On the Number of Arrangements of Pseudolines"
+, journal =     "Discrete Comput. Geom."
+, volume =      18
+, year =        1997
+, pages =       "257--267"
+, update =      "98.03 agarwal"
 }
 
 @article{f-osdg-93
-, author =	"S. Felsner"
-, title =	"Orthogonal Structures in Directed Graphs"
-, journal =	"J. Combin. Theory (B)"
-, volume =	57
-, year =	1993
-, pages =	"309--321"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Felsner"
+, title =       "Orthogonal Structures in Directed Graphs"
+, journal =     "J. Combin. Theory (B)"
+, volume =      57
+, year =        1993
+, pages =       "309--321"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{f-tgo-93
-, author =	"S. Felsner"
-, title =	"Tolerance Graphs and Orders"
-, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	657
-, year =	1993
-, pages =	"17--26"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Felsner"
+, title =       "Tolerance Graphs and Orders"
+, booktitle =   "Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      657
+, year =        1993
+, pages =       "17--26"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{fgmr-ccd-94
-, author =	"S. Felsner and J. Gustedt and M. Morvan and J. X. Rampon"
-, title =	"Constructing Colorings for Diagrams"
-, journal =	"Discrete Appl. Math."
-, volume =	51
-, year =	1994
-, pages =	"85--93"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Felsner and J. Gustedt and M. Morvan and J. X. Rampon"
+, title =       "Constructing Colorings for Diagrams"
+, journal =     "Discrete Appl. Math."
+, volume =      51
+, year =        1994
+, pages =       "85--93"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{fhm-iidd-94
-, author =	"S. Felsner and M. Habib and R. H. M{\"o}ring"
-, title =	"On the Interplay of Interval Dimension and Dimension"
-, journal =	"SIAM J. Discrete Math."
-, volume =	7
-, year =	1994
-, pages =	"32--40"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Felsner and M. Habib and R. H. M{\"o}ring"
+, title =       "On the Interplay of Interval Dimension and Dimension"
+, journal =     "SIAM J. Discrete Math."
+, volume =      7
+, year =        1994
+, pages =       "32--40"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{fk-tea-98
-, author =	"Stefan Felsner and Klaus Kriegel"
-, title =	"Triangles in {Euclidean} Arrangements"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Stefan Felsner and Klaus Kriegel"
+, title =       "Triangles in {Euclidean} Arrangements"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{fm-ish-01
-, author =	"Stefan Felsner and Nicole Morawe"
-, title =	"Infeasibility of Systems of Halfspaces"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"63--65"
-, update =	"01.04 icking"
+, author =      "Stefan Felsner and Nicole Morawe"
+, title =       "Infeasibility of Systems of Halfspaces"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "63--65"
+, update =      "01.04 icking"
 }
 
 @inproceedings{fmw-tggga-94
-, author =	"S. Felsner and R. M{\"u}ller and L. Wernisch"
-, title =	"Trapezoid Graphs and Generalizations: Geometry and Algorithms"
-, booktitle =	"Proc. 4th Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	824
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"143--154"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Felsner and R. M{\"u}ller and L. Wernisch"
+, title =       "Trapezoid Graphs and Generalizations: Geometry and Algorithms"
+, booktitle =   "Proc. 4th Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      824
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "143--154"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{ft-cdioa-95
-, author =	"S. Felsner and W. T. Trotter"
-, title =	"Colorings of Diagrams of Interval Orders and $\alpha$-Sequences of Sets"
-, journal =	"Discrete Math."
-, volume =	144
-, year =	1995
-, pages =	"23--32"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Felsner and W. T. Trotter"
+, title =       "Colorings of Diagrams of Interval Orders and $\alpha$-Sequences of Sets"
+, journal =     "Discrete Math."
+, volume =      144
+, year =        1995
+, pages =       "23--32"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{ft-fdpos-94
-, author =	"S. Felsner and W. T. Trotter"
-, title =	"On the Fractional Dimension of Partially Ordered Sets"
-, journal =	"Discrete Math."
-, volume =	136
-, year =	1994
-, pages =	"101--117"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Felsner and W. T. Trotter"
+, title =       "On the Fractional Dimension of Partially Ordered Sets"
+, journal =     "Discrete Math."
+, volume =      136
+, year =        1994
+, pages =       "101--117"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{fw-cpop-93
-, author =	"S. Felsner and D. Wagner"
-, title =	"On the Complexity of Partial Order Properties"
-, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	657
-, year =	1993
-, pages =	"225--235"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Felsner and D. Wagner"
+, title =       "On the Complexity of Partial Order Properties"
+, booktitle =   "Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      657
+, year =        1993
+, pages =       "225--235"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{fw-sahbo-98
-, author =	"Stefan Felsner and Helmut Weil"
-, title =	"Sweeps, Arrangements and Higher {Bruhat} Orders"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	77
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Stefan Felsner and Helmut Weil"
+, title =       "Sweeps, Arrangements and Higher {Bruhat} Orders"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       77
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{fw-mkcpp-93
-, author =	"S. Felsner and L. Wernisch"
-, title =	"Maximum $k$-Chains in Planar Point Sets: {Combinatorial} Structure and Algorithms"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"??"
+, author =      "S. Felsner and L. Wernisch"
+, title =       "Maximum $k$-Chains in Planar Point Sets: {Combinatorial} Structure and Algorithms"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "??"
 }
 
 @article{fs-lda1-35
-, author =	"W. Fenchel and J. Sutherland"
-, title =	"L{\"o}sung der {Aufgabe} $167$"
-, journal =	"Jahresbericht Deutsch. Math. Verein"
-, volume =	45
-, year =	1935
-, pages =	"33--35"
-, update =	"98.03 bibrelex"
+, author =      "W. Fenchel and J. Sutherland"
+, title =       "L{\"o}sung der {Aufgabe} $167$"
+, journal =     "Jahresbericht Deutsch. Math. Verein"
+, volume =      45
+, year =        1935
+, pages =       "33--35"
+, update =      "98.03 bibrelex"
 }
 
 @article{fp-dpscf-75
-, author =	"H. Y. F. Feng and T. Pavlidis"
-, title =	"Decomposition of polygons into simpler components: feature generation for syntactic pattern recognition"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-24"
-, year =	1975
-, pages =	"636--650"
+, author =      "H. Y. F. Feng and T. Pavlidis"
+, title =       "Decomposition of polygons into simpler components: feature generation for syntactic pattern recognition"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-24"
+, year =        1975
+, pages =       "636--650"
 }
 
 @techreport{fh-rcgtt-91
-, author =	"S. C. Feng and T. H. Hopp"
-, title =	"A review of current geometric tolerancing theories and inspection data analysis algorithms"
-, type =	"Technical {Report}"
-, number =	"NISTIR-4509"
-, institution =	"Factory Automation Systems Division, U.S. Department of Commerce, National Institute of Standards and Technology"
-, address =	"Gaithersburg, MD"
-, month =	feb
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "S. C. Feng and T. H. Hopp"
+, title =       "A review of current geometric tolerancing theories and inspection data analysis algorithms"
+, type =        "Technical {Report}"
+, number =      "NISTIR-4509"
+, institution = "Factory Automation Systems Division, U.S. Department of Commerce, National Institute of Standards and Technology"
+, address =     "Gaithersburg, MD"
+, month =       feb
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{f-lsavd-91
-, author =	"P. Ferianc"
-, title =	"Linear systolic array for {Voronoi} diagram construction in linear time"
-, booktitle =	"Proc. Geobild '91"
-, series =	"Research in Informatics"
-, volume =	4
-, publisher =	"Akademie-Verlag"
-, year =	1991
-, pages =	"120--125"
-, keywords =	"parallel computations, Voronoi diagram"
-, update =	"95.09 korneenko"
+, author =      "P. Ferianc"
+, title =       "Linear systolic array for {Voronoi} diagram construction in linear time"
+, booktitle =   "Proc. Geobild '91"
+, series =      "Research in Informatics"
+, volume =      4
+, publisher =   "Akademie-Verlag"
+, year =        1991
+, pages =       "120--125"
+, keywords =    "parallel computations, Voronoi diagram"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{f-ssapo-90
-, author =	"D. Fern{\'a}ndez-Baca"
-, title =	"Space-sweep algorithms for parametric optimization"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"264--275"
+, author =      "D. Fern{\'a}ndez-Baca"
+, title =       "Space-sweep algorithms for parametric optimization"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "264--275"
 }
 
 @article{fm-pmapt
-, author =	"D. Fern{\'a}ndez-Baca and A. Medepalli"
-, title =	"Parametric module allocation on partial $k$-trees"
-, journal =	"IEEE Trans. Comput."
-, volume =	42
-, year =	1993
-, pages =	"738--742"
-, update =	"96.05 agarwal"
+, author =      "D. Fern{\'a}ndez-Baca and A. Medepalli"
+, title =       "Parametric module allocation on partial $k$-trees"
+, journal =     "IEEE Trans. Comput."
+, volume =      42
+, year =        1993
+, pages =       "738--742"
+, update =      "96.05 agarwal"
 }
 
 @techreport{fm-dgmnc-69
-, author =	"D. Ferrari and L. Mezzalira"
-, title =	"On Drawing a Graph with the Minimum Number of Crossings"
-, number =	"69-11"
-, institution =	"Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano"
-, year =	1969
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. Ferrari and L. Mezzalira"
+, title =       "On Drawing a Graph with the Minimum Number of Crossings"
+, number =      "69-11"
+, institution = "Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano"
+, year =        1969
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{fss-mrpdb-80
-, author =	"L. Ferrari and P. V. Sankar and J. Sklansky"
-, title =	"Minimal rectangular partitions of digitized blobs"
-, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn."
-, year =	1980
-, pages =	"1040--1043"
-, precedes =	"fss-mrpdb-84"
-, update =	"97.11 bibrelex"
+, author =      "L. Ferrari and P. V. Sankar and J. Sklansky"
+, title =       "Minimal rectangular partitions of digitized blobs"
+, booktitle =   "Proc. IEEE Internat. Conf. Pattern Recogn."
+, year =        1980
+, pages =       "1040--1043"
+, precedes =    "fss-mrpdb-84"
+, update =      "97.11 bibrelex"
 }
 
 @article{fss-mrpdb-84
-, author =	"L. Ferrari and P. V. Sankar and J. Sklansky"
-, title =	"Minimal rectangular partitions of digitized blobs"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	28
-, number =	1
-, year =	1984
-, pages =	"58--71"
-, keywords =	"isothetic polygons, partition, rectangles"
-, precedes =	"fss-mrpdb-80"
-, update =	"97.11 bibrelex, 95.09 korneenko"
+, author =      "L. Ferrari and P. V. Sankar and J. Sklansky"
+, title =       "Minimal rectangular partitions of digitized blobs"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      28
+, number =      1
+, year =        1984
+, pages =       "58--71"
+, keywords =    "isothetic polygons, partition, rectangles"
+, precedes =    "fss-mrpdb-80"
+, update =      "97.11 bibrelex, 95.09 korneenko"
 }
 
 @inproceedings{fp-fsprp-91
-, author =	"A. Ferreira and J. G. Peters"
-, title =	"Finding smallest paths in rectilinear polygons on a hypercube multiprocessor"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"162--165"
-, cites =	"acgoy-pcg-88, acg-cdctd-89, cp-dsnlt-90, d-rld-89, dfr-pfchm-89, dr-idshm-90, kr-pasmm-90, mp-spsrp-89, s-rcg-84, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "A. Ferreira and J. G. Peters"
+, title =       "Finding smallest paths in rectilinear polygons on a hypercube multiprocessor"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "162--165"
+, cites =       "acgoy-pcg-88, acg-cdctd-89, cp-dsnlt-90, d-rld-89, dfr-pfchm-89, dr-idshm-90, kr-pasmm-90, mp-spsrp-89, s-rcg-84, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{forv-hvvnp-94
-, author =	"V. Ferrucci and M. H. Overmars and A. Rao and J. Vleugels"
-, title =	"Hunting {Voronoi} Vertices in Non-Polygonal Domains"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"45--50"
-, precedes =	"vfor-hvv-96"
-, cites =	"ay-aampt2-90, a-vdsfg-91, bpv-ocdat-84, g-cp-67, hss-pgcrm-87, ks-tpscv-93, k-eccs-79, km-st-76, l-rmp-91, ly-ptic-75, osy-rnamp-83, obs-stcav-92, o-ramp-92, y-oavds-87, g-plpg-93, ZZZ"
-, update =	"98.11 bibrelex, 98.07 agarwal, 97.03 devillers+smid, 94.09 jones"
+, author =      "V. Ferrucci and M. H. Overmars and A. Rao and J. Vleugels"
+, title =       "Hunting {Voronoi} Vertices in Non-Polygonal Domains"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "45--50"
+, precedes =    "vfor-hvv-96"
+, cites =       "ay-aampt2-90, a-vdsfg-91, bpv-ocdat-84, g-cp-67, hss-pgcrm-87, ks-tpscv-93, k-eccs-79, km-st-76, l-rmp-91, ly-ptic-75, osy-rnamp-83, obs-stcav-92, o-ramp-92, y-oavds-87, g-plpg-93, ZZZ"
+, update =      "98.11 bibrelex, 98.07 agarwal, 97.03 devillers+smid, 94.09 jones"
 }
 
 @article{fp-ebemp-91
-, author =	"V. Ferrucci and A. Paoluzzi"
-, title =	"An extrusion and boundary evaluation for multidimensional polyhedra"
-, journal =	"Comput. Aided Design"
-, volume =	23
-, number =	1
-, year =	1991
-, pages =	"40--50"
-, update =	"98.07 bibrelex"
+, author =      "V. Ferrucci and A. Paoluzzi"
+, title =       "An extrusion and boundary evaluation for multidimensional polyhedra"
+, journal =     "Comput. Aided Design"
+, volume =      23
+, number =      1
+, year =        1991
+, pages =       "40--50"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{f-gcago-88
-, author =	"R. A. Ferstenberg"
-, title =	"Geometric considerations for automatic generation of optimized cutter paths for $3$-axis numerically controlled milling"
-, type =	"Ph.{D}. Thesis"
-, school =	"Sibley School Mech. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1988
-, keywords =	"doctoral thesis"
+, author =      "R. A. Ferstenberg"
+, title =       "Geometric considerations for automatic generation of optimized cutter paths for $3$-axis numerically controlled milling"
+, type =        "Ph.{D}. Thesis"
+, school =      "Sibley School Mech. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1988
+, keywords =    "doctoral thesis"
 }
 
 @techreport{fm-gp-94
-, author =	"E. Feuerstein and A. Marchetti-Spaccamela"
-, title =	"Graph Paging"
-, number =	""
-, institution =	"Universit\`a di Roma, La Sapienza"
-, year =	1994
-, update =	"95.01 devillers"
+, author =      "E. Feuerstein and A. Marchetti-Spaccamela"
+, title =       "Graph Paging"
+, number =      ""
+, institution = "Universit\`a di Roma, La Sapienza"
+, year =        1994
+, update =      "95.01 devillers"
 }
 
 @article{fhmst-spcd-01
-, author =	"Thomas Fevens and Antonio Hernandez and Antonio Mesa and Michael Soss and Godfried Toussaint"
-, title =	"Simple polygons that cannot be deflated"
-, journal =	"Beitr{\"a}ge zur Algebra und Geometrie (Contributions to Algebra and Geometry)"
-, volume =	"??"
-, year =	2001
-, note =	"To appear"
-, comments =	"Manuscript. School of Computer Science, McGill University
+, author =      "Thomas Fevens and Antonio Hernandez and Antonio Mesa and Michael Soss and Godfried Toussaint"
+, title =       "Simple polygons that cannot be deflated"
+, journal =     "Beitr{\"a}ge zur Algebra und Geometrie (Contributions to Algebra and Geometry)"
+, volume =      "??"
+, year =        2001
+, note =        "To appear"
+, comments =    "Manuscript. School of Computer Science, McGill University
                    June 2000
                    \url{http://cgm.cs.mcgill.ca/~godfried/publications/deflation.ps.gz}"
-, update =	"02.03 orourke"
+, update =      "02.03 orourke"
 }
 
 @inproceedings{fmr-mcpcp-98
-, author =	"Thomas Fevens and Henk Meijer and David Rappaport"
-, title =	"Minimum Convex Partition of a Constrained Point Set"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"79--81"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Thomas Fevens and Henk Meijer and David Rappaport"
+, title =       "Minimum Convex Partition of a Constrained Point Set"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "79--81"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{f-splrt-55
-, author =	"L. Few"
-, title =	"The shortest path and the shortest road through $n$ points in a region"
-, journal =	"Mathematika"
-, volume =	2
-, year =	1955
-, pages =	"141--144"
-, update =	"00.03 smid, 98.03 smid, 97.11 bibrelex"
+, author =      "L. Few"
+, title =       "The shortest path and the shortest road through $n$ points in a region"
+, journal =     "Mathematika"
+, volume =      2
+, year =        1955
+, pages =       "141--144"
+, update =      "00.03 smid, 98.03 smid, 97.11 bibrelex"
 }
 
 @book{fls-flp-63
-, author =	"?? Feynmann and ?? Leighton and ?? Sands"
-, title =	"The {Feynmann} Lectures on Physics"
-, volume =	1
-, publisher =	"Addison-Wesley"
-, year =	1963
-, update =	"01.07 devillers, 98.07 bibrelex"
+, author =      "?? Feynmann and ?? Leighton and ?? Sands"
+, title =       "The {Feynmann} Lectures on Physics"
+, volume =      1
+, publisher =   "Addison-Wesley"
+, year =        1963
+, update =      "01.07 devillers, 98.07 bibrelex"
 }
 
 @proceedings{fks-p8ccc-96
-, title =	"Proc. 8th Canadian Conference on Computational Geometry"
-, editor =	"F. Fiala and E. Kranakis and J.-R. Sack"
-, series =	5
-, publisher =	"International Informatics"
-, year =	1996
-, update =	"97.11 sack"
+, title =       "Proc. 8th Canadian Conference on Computational Geometry"
+, editor =      "F. Fiala and E. Kranakis and J.-R. Sack"
+, series =      5
+, publisher =   "International Informatics"
+, year =        1996
+, update =      "97.11 sack"
 }
 
 @article{fs-hfb-89
-, author =	"A. Fiat and A. Shamir"
-, title =	"How to find a battleship"
-, journal =	"Networks"
-, volume =	19
-, year =	1989
-, pages =	"361--371"
-, keywords =	"probing"
-, update =	"95.09 korneenko"
+, author =      "A. Fiat and A. Shamir"
+, title =       "How to find a battleship"
+, journal =     "Networks"
+, volume =      19
+, year =        1989
+, pages =       "361--371"
+, keywords =    "probing"
+, update =      "95.09 korneenko"
 }
 
 @book{fw-ola-98
-, title =	"Online Algorithms: The State of the Art"
-, editor =	"Amos Fiat and Gerhard Woeginger"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1442
-, publisher =	"Springer-Verlag"
-, year =	1998
-, isbn =	"3-540-64917-4"
-, update =	"02.03 icking, 99.03 bibrelex, 97.03 icking"
+, title =       "Online Algorithms: The State of the Art"
+, editor =      "Amos Fiat and Gerhard Woeginger"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1442
+, publisher =   "Springer-Verlag"
+, year =        1998
+, isbn =        "3-540-64917-4"
+, update =      "02.03 icking, 99.03 bibrelex, 97.03 icking"
 }
 
 @techreport{ffg-eacw0-92
-, author =	"M. Fidrich and J. Frenk and J. Gromicho"
-, title =	"An efficient algorithm to check whether $0$ belongs to the convex hull of a finite number of {$L_p$}-circles"
-, number =	"9204/a"
-, institution =	"Econometric Institute"
-, address =	"Netherlands"
-, year =	1992
-, update =	"93.09 milone+mitchell"
+, author =      "M. Fidrich and J. Frenk and J. Gromicho"
+, title =       "An efficient algorithm to check whether $0$ belongs to the convex hull of a finite number of {$L_p$}-circles"
+, number =      "9204/a"
+, institution = "Econometric Institute"
+, address =     "Netherlands"
+, year =        1992
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{f-fdta-87
-, author =	"D. Field"
-, title =	"A Flexible {Delaunay} Triangulation Algorithm"
-, type =	"Research Publication"
-, number =	"GMR-5675"
-, institution =	"General Motors"
-, year =	1987
-, annote =	"Extends Watson's algorithm to (2 and 3 D) to allow
-		 point deletion. Uses this for Laplacian smoothing."
+, author =      "D. Field"
+, title =       "A Flexible {Delaunay} Triangulation Algorithm"
+, type =        "Research Publication"
+, number =      "GMR-5675"
+, institution = "General Motors"
+, year =        1987
+, annote =      "Extends Watson's algorithm to (2 and 3 D) to allow
+                 point deletion. Uses this for Laplacian smoothing."
 }
 
 @article{f-nndsp-87
-, author =	"D. A. Field"
-, title =	"A note on a new data structure for in-the-past queries"
-, journal =	"Inform. Process. Lett."
-, volume =	24
-, year =	1987
-, pages =	"95--96"
+, author =      "D. A. Field"
+, title =       "A note on a new data structure for in-the-past queries"
+, journal =     "Inform. Process. Lett."
+, volume =      24
+, year =        1987
+, pages =       "95--96"
 }
 
 @article{f-gdtaf-91
-, author =	"D. A. Field"
-, title =	"Generic {Delaunay} Triangulation Algorithm For Finite Element Meshes"
-, journal =	"Advances in Engineering Software and Workstations"
-, volume =	13
-, number =	"5--6"
-, month =	sep
-, year =	1991
-, pages =	"263--272"
-, keywords =	"generic Delaunay triangulation algorithms, finite element meshes, Voronoi diagrams"
-, update =	"97.07 devillers"
-, annote =	"About $k/d$ Dts. These are $k$-simplices with empty
-		 hypersphere property, embedded in $d$-dimensional
-		 space. (A subset of regular Dt). Watson's to
-		 construct."
-, abstract =	"A mathematical framework for the construction of k
-		 dimensional meshes embedded in n dimensions is
-		 provided. By extending Delaunay triangulations a
-		 generic triangulation algorithm is stated along with
-		 methods for assessing the shapes of simplices. Planar
-		 surface and solid meshes illustrate the algorithm.
-		 (Author abstract) 31 Refs."
+, author =      "D. A. Field"
+, title =       "Generic {Delaunay} Triangulation Algorithm For Finite Element Meshes"
+, journal =     "Advances in Engineering Software and Workstations"
+, volume =      13
+, number =      "5--6"
+, month =       sep
+, year =        1991
+, pages =       "263--272"
+, keywords =    "generic Delaunay triangulation algorithms, finite element meshes, Voronoi diagrams"
+, update =      "97.07 devillers"
+, annote =      "About $k/d$ Dts. These are $k$-simplices with empty
+                 hypersphere property, embedded in $d$-dimensional
+                 space. (A subset of regular Dt). Watson's to
+                 construct."
+, abstract =    "A mathematical framework for the construction of k
+                 dimensional meshes embedded in n dimensions is
+                 provided. By extending Delaunay triangulations a
+                 generic triangulation algorithm is stated along with
+                 methods for assessing the shapes of simplices. Planar
+                 surface and solid meshes illustrate the algorithm.
+                 (Author abstract) 31 Refs."
 }
 
 @inproceedings{f-iwatd-86
-, author =	"D. A. Field"
-, title =	"Implementing {Watson}'s algorithm in three dimensions"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"246--259"
-, keywords =	"Delaunay triangulations, implementing algorithms, three-dimensional"
-, cites =	"bg-gimha-84, cff-aatdf-85, ff-atmg-86, k-isasm-82, w-cnddt-81, z-fem-77, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "D. A. Field"
+, title =       "Implementing {Watson}'s algorithm in three dimensions"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "246--259"
+, keywords =    "Delaunay triangulations, implementing algorithms, three-dimensional"
+, cites =       "bg-gimha-84, cff-aatdf-85, ff-atmg-86, k-isasm-82, w-cnddt-81, z-fem-77, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{f-lsdt-88
-, author =	"David A. Field"
-, title =	"{Laplacian} Smoothing And {Delaunay} Triangulations"
-, journal =	"Communications in Applied Numerical Methods"
-, volume =	4
-, number =	6
-, month =	nov
-, year =	1988
-, pages =	"709--712"
-, keywords =	"laplacian smoothing, Delaunay triangulations"
-, annote =	"After each step of Laplacian smoothing, do a local
-		 retriangulation."
-, abstract =	"In contrast to most triangulation algorithms which
-		 implicitly assume that triangulation point locations
-		 are fixed, 'Laplacian' smoothing focuses on moving
-		 point locations to improve triangulation. Laplacian
-		 smoothing is attractive for its simplicity but it does
-		 require an existing triangulation. In this paper the
-		 effect of Laplacian smoothing on Delaunay
-		 triangulations is explored. It will become clear that
-		 constraining Laplacian smoothing to maintain a Delaunay
-		 triangulation measurably improves Laplacian smoothing.
-		 (Author abstract) 11 Refs."
+, author =      "David A. Field"
+, title =       "{Laplacian} Smoothing And {Delaunay} Triangulations"
+, journal =     "Communications in Applied Numerical Methods"
+, volume =      4
+, number =      6
+, month =       nov
+, year =        1988
+, pages =       "709--712"
+, keywords =    "laplacian smoothing, Delaunay triangulations"
+, annote =      "After each step of Laplacian smoothing, do a local
+                 retriangulation."
+, abstract =    "In contrast to most triangulation algorithms which
+                 implicitly assume that triangulation point locations
+                 are fixed, 'Laplacian' smoothing focuses on moving
+                 point locations to improve triangulation. Laplacian
+                 smoothing is attractive for its simplicity but it does
+                 require an existing triangulation. In this paper the
+                 effect of Laplacian smoothing on Delaunay
+                 triangulations is explored. It will become clear that
+                 constraining Laplacian smoothing to maintain a Delaunay
+                 triangulation measurably improves Laplacian smoothing.
+                 (Author abstract) 11 Refs."
 }
 
 @techreport{ff-atmg-86
-, author =	"D. A. Field and W. H. Frey"
-, title =	"Automation of tetrahedral mesh generation"
-, number =	"GMR-4967"
-, institution =	"General Motors Research Laboratories, Warren"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "D. A. Field and W. H. Frey"
+, title =       "Automation of tetrahedral mesh generation"
+, number =      "GMR-4967"
+, institution = "General Motors Research Laboratories, Warren"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{fn-sttm-92
-, author =	"David A. Field and Thomas W. Nehl"
-, title =	"Stitching Together Tetrahedral Meshes"
-, booktitle =	"Proceedings of the SIAM Regional Conference on Geometric Aspects of Industrial Design"
-, publisher =	"Soc. for Industrial \& Applied Mathematics"
-, address =	"Philadelphia, PA"
-, year =	1992
-, pages =	"25--38"
-, keywords =	"Delaunay based stitching algorithm, tetrahedral meshes, Delaunay criterion of two dimensional triangular meshes, magnetostatics fields"
-, update =	"93.09 rote"
-, annote =	"3D Dt is constrained to fit 2D Dt of surface. Watson's
-		 alg."
-, abstract =	"A Delaunay based algorithm has been developed for
-		 stitching together two tetrahedral meshes separated by
-		 a planar gap of finite thickness. It is assumed that
-		 the tetrahedral faces on either side of the planar gap
-		 satisfy the Delaunay criterion of two dimensional
-		 triangular meshes. The stitching algorithm is applied
-		 to a first order tetrahedral finite element mesh model
-		 of a prototype magnetostatics problems. Intended for
-		 the finite element analysis of three dimensional
-		 magnetostatics fields, this mesh is generated in two
-		 parts and, due to geometric differences, is stitched
-		 together in a narrow air gap region which separates
-		 them. In addition to preserving the structure of an
-		 existing tetrahedral mesh, material boundaries are
-		 preserved and severe length scale problems are
-		 overcome. (Author abstract) 10 Refs."
+, author =      "David A. Field and Thomas W. Nehl"
+, title =       "Stitching Together Tetrahedral Meshes"
+, booktitle =   "Proceedings of the SIAM Regional Conference on Geometric Aspects of Industrial Design"
+, publisher =   "Soc. for Industrial \& Applied Mathematics"
+, address =     "Philadelphia, PA"
+, year =        1992
+, pages =       "25--38"
+, keywords =    "Delaunay based stitching algorithm, tetrahedral meshes, Delaunay criterion of two dimensional triangular meshes, magnetostatics fields"
+, update =      "93.09 rote"
+, annote =      "3D Dt is constrained to fit 2D Dt of surface. Watson's
+                 alg."
+, abstract =    "A Delaunay based algorithm has been developed for
+                 stitching together two tetrahedral meshes separated by
+                 a planar gap of finite thickness. It is assumed that
+                 the tetrahedral faces on either side of the planar gap
+                 satisfy the Delaunay criterion of two dimensional
+                 triangular meshes. The stitching algorithm is applied
+                 to a first order tetrahedral finite element mesh model
+                 of a prototype magnetostatics problems. Intended for
+                 the finite element analysis of three dimensional
+                 magnetostatics fields, this mesh is generated in two
+                 parts and, due to geometric differences, is stitched
+                 together in a narrow air gap region which separates
+                 them. In addition to preserving the structure of an
+                 existing tetrahedral mesh, material boundaries are
+                 preserved and severe length scale problems are
+                 overcome. (Author abstract) 10 Refs."
 }
 
 @article{fs-gtfem-91
-, author =	"David A. Field and Warren D. Smith"
-, title =	"Graded Tetrahedral Finite Element Meshes"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	31
-, number =	3
-, year =	1991
-, pages =	"413--425"
-, annote =	"Uses octree based on body centred cubic lattice of
-		 tetras. (Typical bcc tetra has vertices $(-1,0,0),
-		 (0,1,-1), (0,1,1), (1,0,0)$)"
-, abstract =	"Vertices in the body centred cubic (bcc) lattice are
-		 used to create a tetrahedral spatial decomposition.
-		 With this spatial decomposition an octree approach is
-		 combined with Delaunay triangulations to decompose
-		 solids into tetrahedral finite element meshes. Solids
-		 must have their surfaces triangulated and the vertices
-		 in the triangulation are finite element nodes. Local
-		 densities of interior tetrahedra are controlled by the
-		 densities of surface triangles. Accuracy of the
-		 decomposition into finite elements depends on the
-		 accuracy of the surface triangulation which can be
-		 constructed with state of the art computer aided design
-		 systems. (Author abstract) 22 Refs."
+, author =      "David A. Field and Warren D. Smith"
+, title =       "Graded Tetrahedral Finite Element Meshes"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      31
+, number =      3
+, year =        1991
+, pages =       "413--425"
+, annote =      "Uses octree based on body centred cubic lattice of
+                 tetras. (Typical bcc tetra has vertices $(-1,0,0),
+                 (0,1,-1), (0,1,1), (1,0,0)$)"
+, abstract =    "Vertices in the body centred cubic (bcc) lattice are
+                 used to create a tetrahedral spatial decomposition.
+                 With this spatial decomposition an octree approach is
+                 combined with Delaunay triangulations to decompose
+                 solids into tetrahedral finite element meshes. Solids
+                 must have their surfaces triangulated and the vertices
+                 in the triangulation are finite element nodes. Local
+                 densities of interior tetrahedra are controlled by the
+                 densities of surface triangles. Accuracy of the
+                 decomposition into finite elements depends on the
+                 accuracy of the surface triangulation which can be
+                 constructed with state of the art computer aided design
+                 systems. (Author abstract) 22 Refs."
 }
 
 @techreport{f-adlct-82
-, author =	"D. E. Field"
-, title =	"Algorithms for drawing lines, curves, and triangles"
-, type =	"Report"
-, number =	"TR310"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1982
-, keywords =	"aliasing, anti-aliasing, filtering techniques"
+, author =      "D. E. Field"
+, title =       "Algorithms for drawing lines, curves, and triangles"
+, type =        "Report"
+, number =      "TR310"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1982
+, keywords =    "aliasing, anti-aliasing, filtering techniques"
 }
 
 @phdthesis{f-adsgo-83
-, author =	"D. E. Field"
-, title =	"Algorithms for drawing simple geometric objects on raster devices"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1983
-, note =	"Technical Report TR314"
-, keywords =	"doctoral thesis"
-, comments =	"UMI PRH83-18698, 146 pp."
-, update =	"93.09 jones"
+, author =      "D. E. Field"
+, title =       "Algorithms for drawing simple geometric objects on raster devices"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1983
+, note =        "Technical Report TR314"
+, keywords =    "doctoral thesis"
+, comments =    "UMI PRH83-18698, 146 pp."
+, update =      "93.09 jones"
 }
 
 @article{ff-famwt-90
-, author =	"M. C. Fields and G. N. Frederickson"
-, title =	"A faster algorithm for the maximum weighted tardiness problem"
-, journal =	"Inform. Process. Lett."
-, volume =	36
-, number =	1
-, year =	1990
-, pages =	"39--44"
-, keywords =	"convex hull, dynamizing, lines, geometric transformations"
-, update =	"96.09 agarwal, 95.09 korneenko"
+, author =      "M. C. Fields and G. N. Frederickson"
+, title =       "A faster algorithm for the maximum weighted tardiness problem"
+, journal =     "Inform. Process. Lett."
+, volume =      36
+, number =      1
+, year =        1990
+, pages =       "39--44"
+, keywords =    "convex hull, dynamizing, lines, geometric transformations"
+, update =      "96.09 agarwal, 95.09 korneenko"
 }
 
 @unpublished{fo-fdmm-
-, author =	"G.-J. Fiezeman and M. H. Overmars"
-, title =	"Fast display of molecular models"
-, note =	"In preparation"
-, update =	"98.03 bibrelex"
+, author =      "G.-J. Fiezeman and M. H. Overmars"
+, title =       "Fast display of molecular models"
+, note =        "In preparation"
+, update =      "98.03 bibrelex"
 }
 
 @article{fg-cmc-95
-, author =	"L. H. de Figueiredo and J. de Miranda Gomes"
-, title =	"Computational morphology of curves"
-, journal =	"Visual Comput."
-, volume =	11
-, year =	1995
-, pages =	"105--112"
-, update =	"00.03 orourke"
+, author =      "L. H. de Figueiredo and J. de Miranda Gomes"
+, title =       "Computational morphology of curves"
+, journal =     "Visual Comput."
+, volume =      11
+, year =        1995
+, pages =       "105--112"
+, update =      "00.03 orourke"
 }
 
 @article{fmm-saubd-86
-, author =	"D. Filip and R. Magedson and R. Markot"
-, title =	"Surface algorithms using bounds on derivatives"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	3
-, year =	1986
-, pages =	"295--311"
-, update =	"97.11 bibrelex"
+, author =      "D. Filip and R. Magedson and R. Markot"
+, title =       "Surface algorithms using bounds on derivatives"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      3
+, year =        1986
+, pages =       "295--311"
+, update =      "97.11 bibrelex"
 }
 
 @article{fyp-cmbs-93
-, author =	"P. C. Filkins and S. T. Tuohy and N. M. Patrikalakis"
-, title =	"Computational Methods for Blending Surface Approximation"
-, journal =	"Engineering with Computers"
-, volume =	9
-, number =	1
-, year =	1993
-, pages =	"49--62"
-, update =	"95.05 abrams"
+, author =      "P. C. Filkins and S. T. Tuohy and N. M. Patrikalakis"
+, title =       "Computational Methods for Blending Surface Approximation"
+, journal =     "Engineering with Computers"
+, volume =      9
+, number =      1
+, year =        1993
+, pages =       "49--62"
+, update =      "95.05 abrams"
 }
 
 @article{f-eapp-90
-, author =	"P. Filliman"
-, title =	"Exterior algebra and projections of polytopes"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"305--322"
+, author =      "P. Filliman"
+, title =       "Exterior algebra and projections of polytopes"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "305--322"
 }
 
 @article{f-epz-88
-, author =	"P. Filliman"
-, title =	"Extremum problems for zonotopes"
-, journal =	"Geom. Dedicata"
-, volume =	27
-, number =	3
-, year =	1988
-, pages =	"251--262"
-, update =	"95.09 korneenko"
+, author =      "P. Filliman"
+, title =       "Extremum problems for zonotopes"
+, journal =     "Geom. Dedicata"
+, volume =      27
+, number =      3
+, year =        1988
+, pages =       "251--262"
+, update =      "95.09 korneenko"
 }
 
 @unpublished{f-pp-87
-, author =	"P. Filliman"
-, title =	"Projections of polytopes"
-, month =	mar
-, year =	1987
-, note =	"Submitted for publication"
-, update =	"98.03 bibrelex"
+, author =      "P. Filliman"
+, title =       "Projections of polytopes"
+, month =       mar
+, year =        1987
+, note =        "Submitted for publication"
+, update =      "98.03 bibrelex"
 }
 
 @article{f-aicgt-80
-, author =	"I. S. Filotti"
-, title =	"An algorithm for imbedding cubic graphs in the torus"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	20
-, year =	1980
-, pages =	"255--276"
-, succeeds =	"f-eadwc-78"
+, author =      "I. S. Filotti"
+, title =       "An algorithm for imbedding cubic graphs in the torus"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      20
+, year =        1980
+, pages =       "255--276"
+, succeeds =    "f-eadwc-78"
 }
 
 @inproceedings{f-eadwc-78
-, author =	"I. S. Filotti"
-, title =	"An efficient algorithm for determining whether a cubic graph is toroidal"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Theory Comput."
-, year =	1978
-, pages =	"133--141"
-, precedes =	"f-aicgt-80"
+, author =      "I. S. Filotti"
+, title =       "An efficient algorithm for determining whether a cubic graph is toroidal"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Theory Comput."
+, year =        1978
+, pages =       "133--141"
+, precedes =    "f-aicgt-80"
 }
 
 @techreport{fmr-dggo-79
-, author =	"I. S. Filotti and G. L. Miller and J. Reif"
-, title =	"On determining the genus of a graph in {$O(v^{O(g)})$}"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1979
+, author =      "I. S. Filotti and G. L. Miller and J. Reif"
+, title =       "On determining the genus of a graph in {$O(v^{O(g)})$}"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1979
 }
 
 @article{fw-utpf-81
-, author =	"N. J. Fine and H. S. Wilf"
-, title =	"Uniqueness theorems for periodic functions"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	16
-, year =	1981
-, pages =	"109--114"
-, update =	"98.07 bibrelex"
+, author =      "N. J. Fine and H. S. Wilf"
+, title =       "Uniqueness theorems for periodic functions"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      16
+, year =        1981
+, pages =       "109--114"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{fw-gh-96
-, author =	"E. Fink and D. Wood"
-, title =	"Generalizing halfspaces"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"211--216"
-, update =	"96.09 mitchell"
+, author =      "E. Fink and D. Wood"
+, title =       "Generalizing halfspaces"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "211--216"
+, update =      "96.09 mitchell"
 }
 
 @inproceedings{fw-tdroc-96
-, author =	"E. Fink and D. Wood"
-, title =	"Three-dimensional restricted-orientation convexity"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"258--263"
-, update =	"96.09 mitchell"
+, author =      "E. Fink and D. Wood"
+, title =       "Three-dimensional restricted-orientation convexity"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "258--263"
+, update =      "96.09 mitchell"
 }
 
 @inproceedings{fw-tdroc-96c
-, author =	"Eugene Fink and Derick Wood"
-, title =	"Three-Dimensional Restricted-Orientation Convexity"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"7--10"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Eugene Fink and Derick Wood"
+, title =       "Three-Dimensional Restricted-Orientation Convexity"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "7--10"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @phdthesis{f-afv-94
-, author =	"U. Finke"
-, title =	"Algorithmen f{\"u}r {Verschneidungsoperationen}"
-, school =	"University of Siegen"
-, address =	"Siegen, Germany"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "U. Finke"
+, title =       "Algorithmen f{\"u}r {Verschneidungsoperationen}"
+, school =      "University of Siegen"
+, address =     "Siegen, Germany"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{fh-oscps-95
-, author =	"Ulrich Finke and Klaus Hinrichs"
-, title =	"Overlaying simply connected planar subdivisions in linear time"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"119--126"
-, keywords =	"red-blue segment intersection"
-, cites =	"c-stsar-94, c-tsplt-91a, f-afv-94, gs-ccrs-86, gs-pmgsc-85, s-sfira-91, w-vfgi-94, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Ulrich Finke and Klaus Hinrichs"
+, title =       "Overlaying simply connected planar subdivisions in linear time"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "119--126"
+, keywords =    "red-blue segment intersection"
+, cites =       "c-stsar-94, c-tsplt-91a, f-afv-94, gs-ccrs-86, gs-pmgsc-85, s-sfira-91, w-vfgi-94, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{fh-qvdsr-95
-, author =	"U. Finke and K. H. Hinrichs"
-, title =	"The Quad View Data Structure: a Representation for Planar Subdivisions"
-, booktitle =	"Proc. 6th? Sympos. Advances in Spatial Databases"
-, series =	"Lecture Notes Comput. Sci."
-, number =	951
-, year =	1995
-, pages =	"29--46"
-, update =	"96.09 kreveld"
+, author =      "U. Finke and K. H. Hinrichs"
+, title =       "The Quad View Data Structure: a Representation for Planar Subdivisions"
+, booktitle =   "Proc. 6th? Sympos. Advances in Spatial Databases"
+, series =      "Lecture Notes Comput. Sci."
+, number =      951
+, year =        1995
+, pages =       "29--46"
+, update =      "96.09 kreveld"
 }
 
 @article{fb-qtdsr-74
-, author =	"R. A. Finkel and J. L. Bentley"
-, title =	"Quad trees: a data structure for retrieval on composite keys"
-, journal =	"Acta Inform."
-, volume =	4
-, year =	1974
-, pages =	"1--9"
+, author =      "R. A. Finkel and J. L. Bentley"
+, title =       "Quad trees: a data structure for retrieval on composite keys"
+, journal =     "Acta Inform."
+, volume =      4
+, year =        1974
+, pages =       "1--9"
 }
 
 @inproceedings{fm-rprpr-97
-, author =	"U. Finkler and K. Mehlhorn"
-, title =	"Runtime Prediction of Real Programs on Real Machines"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, month =	jan
-, year =	1997
-, pages =	"380--389"
-, update =	"97.03 held"
+, author =      "U. Finkler and K. Mehlhorn"
+, title =       "Runtime Prediction of Real Programs on Real Machines"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, month =       jan
+, year =        1997
+, pages =       "380--389"
+, update =      "97.03 held"
 }
 
 @inproceedings{fb-pagtc-92
-, author =	"G. D. Finlayson and B. K. Bhattacharya"
-, title =	"A practical algorithm for the greedy triangulation of a convex polygon"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"347--352"
-, cites =	"fbf-afbml-77, k-mtpd-80, lp-annpc-78, ll-abgtc-87, ll-fagt-90, h-mg-73, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "G. D. Finlayson and B. K. Bhattacharya"
+, title =       "A practical algorithm for the greedy triangulation of a convex polygon"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "347--352"
+, cites =       "fbf-afbml-77, k-mtpd-80, lp-annpc-78, ll-abgtc-87, ll-fagt-90, h-mg-73, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{fhklmsv-gmfl-96
-, author =	"P. Finn and D. Halperin and L. Kavraki and J.-C. Latombe and R. Motwani and C. Shelton and S. Venkatsubramanian"
-, title =	"Geometric manipulation of flexible ligands"
-, editor =	"M. C. Lin and D. Manocha"
-, booktitle =	"Applied Computational Geometry: Towards Geometric Engineering"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1148
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"67--78"
-, update =	"98.07 bibrelex"
+, author =      "P. Finn and D. Halperin and L. Kavraki and J.-C. Latombe and R. Motwani and C. Shelton and S. Venkatsubramanian"
+, title =       "Geometric manipulation of flexible ligands"
+, editor =      "M. C. Lin and D. Manocha"
+, booktitle =   "Applied Computational Geometry: Towards Geometric Engineering"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1148
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "67--78"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{fklmsvy-rrpid-97
-, author =	"P. Finn and L. E. Kavraki and J.-C. Latombe and R. Motwani and C. Shelton and S. Venkatasubramanian and A. Yao"
-, title =	"RAPID: randomized pharmacophore identification for drug design"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"324--333"
-, cites =	"a-dcpsh-94, ah-alcsl-94, att-ddtps-97, ag-dgsmi-96, amww-cssgo-88, ahb-lsft3-87, a-oagc-87, bmb-pmmca-94, bgss-icfcm-96, bd-glihf-93, b-amm-90, b-afzef-71, bk-facus-73, cgs-icmcm-89, ccfm-icdir-97, cegsw-ccbac-90, ch-dgmc-88, d-fpfnh-93, dl-msp-76, fhklmsv-gmfl-96, gj-cigtn-79, gkpt-csmsm-93, gmhhwsbr-cads5-95, gs-rclcd-70, g-cmmid-85, gbe-pcsai-92, hs-pssaa-97, ityik-msrdd-95, k-rncsf-95, kmy-aalcs-95, km-femgb-94, l-smscs-91, l-arpmb-93, ls-mmpmm-88, l-csbsu-90, mzw-camcu-95, mbddl-fnapm-93, mbw-sdtds-90, mr-ra-95, p-ota-86, ir-cerrp-96, rl-pspmd-95, skt-acc1v-95, w-sppdt-95, ZZZ"
-, update =	"98.11 bibrelex, 98.07 agarwal+bibrelex, 97.07 efrat"
+, author =      "P. Finn and L. E. Kavraki and J.-C. Latombe and R. Motwani and C. Shelton and S. Venkatasubramanian and A. Yao"
+, title =       "RAPID: randomized pharmacophore identification for drug design"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "324--333"
+, cites =       "a-dcpsh-94, ah-alcsl-94, att-ddtps-97, ag-dgsmi-96, amww-cssgo-88, ahb-lsft3-87, a-oagc-87, bmb-pmmca-94, bgss-icfcm-96, bd-glihf-93, b-amm-90, b-afzef-71, bk-facus-73, cgs-icmcm-89, ccfm-icdir-97, cegsw-ccbac-90, ch-dgmc-88, d-fpfnh-93, dl-msp-76, fhklmsv-gmfl-96, gj-cigtn-79, gkpt-csmsm-93, gmhhwsbr-cads5-95, gs-rclcd-70, g-cmmid-85, gbe-pcsai-92, hs-pssaa-97, ityik-msrdd-95, k-rncsf-95, kmy-aalcs-95, km-femgb-94, l-smscs-91, l-arpmb-93, ls-mmpmm-88, l-csbsu-90, mzw-camcu-95, mbddl-fnapm-93, mbw-sdtds-90, mr-ra-95, p-ota-86, ir-cerrp-96, rl-pspmd-95, skt-acc1v-95, w-sppdt-95, ZZZ"
+, update =      "98.11 bibrelex, 98.07 agarwal+bibrelex, 97.07 efrat"
 }
 
 @article{fklmsvy-rrpid-98
-, author =	"P. W. Finn and L. E. Kavraki and J.-C. Latombe and R. Motwani and C. Shelton and S. Venkatasubramanian and A. Yao"
-, title =	"RAPID: Randomized pharmacophore identification for drug design"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"263--272"
-, succeeds =	"fklmsvy-rrpid-97"
-, update =	"98.11 devillers"
+, author =      "P. W. Finn and L. E. Kavraki and J.-C. Latombe and R. Motwani and C. Shelton and S. Venkatasubramanian and A. Yao"
+, title =       "RAPID: Randomized pharmacophore identification for drug design"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "263--272"
+, succeeds =    "fklmsvy-rrpid-97"
+, update =      "98.11 devillers"
 }
 
 @article{f-pcvp-79
-, author =	"J. L. Finney"
-, title =	"A Procedure for the Construction of {Voronoi} Polyhedra"
-, journal =	"J. Comput. Phys."
-, volume =	32
-, year =	1979
-, pages =	"137--143"
-, annote =	"3D Voronoi diagram. To build one polyhedron: consider
-		 all triples within $N_c$ of centre and check for empty
-		 circumspheres. (only points within $N_s$ ($>N_c$) are
-		 checked). Time $O(N^2+ N_c^3N_sN)$. Once vertices are
-		 found, they are sorted into the polygon."
+, author =      "J. L. Finney"
+, title =       "A Procedure for the Construction of {Voronoi} Polyhedra"
+, journal =     "J. Comput. Phys."
+, volume =      32
+, year =        1979
+, pages =       "137--143"
+, annote =      "3D Voronoi diagram. To build one polyhedron: consider
+                 all triples within $N_c$ of centre and check for empty
+                 circumspheres. (only points within $N_s$ ($>N_c$) are
+                 checked). Time $O(N^2+ N_c^3N_sN)$. Once vertices are
+                 found, they are sorted into the polygon."
 }
 
 @book{fj-cesr-89
-, author =	"J.-C. Fiorot and P. Jeannin"
-, title =	"Courbes et Surfaces Rationelles"
-, series =	"RMA"
-, volume =	12
-, publisher =	"Masson"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "J.-C. Fiorot and P. Jeannin"
+, title =       "Courbes et Surfaces Rationelles"
+, series =      "RMA"
+, volume =      12
+, publisher =   "Masson"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @book{fj-csr-92
-, author =	"J.-C. Fiorot and P. Jeannin"
-, title =	"Courbes Splines Rationelles"
-, series =	"RMA"
-, volume =	24
-, publisher =	"Masson"
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "J.-C. Fiorot and P. Jeannin"
+, title =       "Courbes Splines Rationelles"
+, series =      "RMA"
+, volume =      24
+, publisher =   "Masson"
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{fp-pannd-70
-, author =	"F. P. Fischer and E. A. Patrick"
-, title =	"A preprocessing algorithm for nearest neighbor decision rules"
-, booktitle =	"Proc. XXVI Nat. Electron. Conf."
-, publisher =	"Illinois Inst. Tech."
-, year =	1970
-, pages =	"481--485"
+, author =      "F. P. Fischer and E. A. Patrick"
+, title =       "A preprocessing algorithm for nearest neighbor decision rules"
+, booktitle =   "Proc. XXVI Nat. Electron. Conf."
+, publisher =   "Illinois Inst. Tech."
+, year =        1970
+, pages =       "481--485"
 }
 
 @article{fsh-eaeha-88
-, author =	"H. C. Fischer and G. Schumacher and R. Haggenmuller"
-, title =	"Evaluation of arithmetic expressions with high accuracy"
-, journal =	"Computing"
-, volume =	"suppl"
-, year =	1988
-, pages =	"149--157"
-, keywords =	"robustness"
-, update =	"95.09 korneenko"
+, author =      "H. C. Fischer and G. Schumacher and R. Haggenmuller"
+, title =       "Evaluation of arithmetic expressions with high accuracy"
+, journal =     "Computing"
+, volume =      "suppl"
+, year =        1988
+, pages =       "149--157"
+, keywords =    "robustness"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{flz-gswaw-98
-, author =	"M. Fischer and T. Lukovszki and M. Ziegler"
-, title =	"Geometric searching in walkthrough animations with weak spanners in real time"
-, booktitle =	"Proc. 6th Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1461
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	1998
-, pages =	"163--174"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "M. Fischer and T. Lukovszki and M. Ziegler"
+, title =       "Geometric searching in walkthrough animations with weak spanners in real time"
+, booktitle =   "Proc. 6th Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1461
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        1998
+, pages =       "163--174"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @inproceedings{flz-pnsmo-98
-, author =	"M. Fischer and T. Lukovszki and M. Ziegler"
-, title =	"Partitioned neighborhood spanners of minimal outdegree"
-, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
-, year =	1999
-, pages =	"47--50"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "M. Fischer and T. Lukovszki and M. Ziegler"
+, title =       "Partitioned neighborhood spanners of minimal outdegree"
+, booktitle =   "Proc. 11th Canad. Conf. Comput. Geom."
+, year =        1999
+, pages =       "47--50"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @inproceedings{flz-scsns-99
-, author =	"Matthias Fischer and Tam{\'a}s Lukovszki and Martin Ziegler"
-, title =	"Space Complexity of Sectoral Neighborhood Spanners"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"105--108"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Matthias Fischer and Tam{\'a}s Lukovszki and Martin Ziegler"
+, title =       "Space Complexity of Sectoral Neighborhood Spanners"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "105--108"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @incollection{fp-dmpps-85
-, author =	"M. J. Fischer and M. S. Paterson"
-, title =	"Dynamic monotone priorities on planar sets"
-, booktitle =	"Proc. Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"289--292"
-, keywords =	"searching, dynamizing"
-, update =	"95.09 korneenko"
+, author =      "M. J. Fischer and M. S. Paterson"
+, title =       "Dynamic monotone priorities on planar sets"
+, booktitle =   "Proc. Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "289--292"
+, keywords =    "searching, dynamizing"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{f-fmcp-93
-, author =	"P. Fischer"
-, title =	"Finding Maximum Convex Polygons"
-, booktitle =	"Proc. 9th Internat. Conf. Fund. Comput. Theory"
-, site =	"Szeged, Hungary"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	710
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"234--243"
-, precedes =	"f-spafm-97"
-, update =	"99.11 bibrelex, 97.03 devillers, 94.09 smid, 93.09 milone+mitchell"
+, author =      "P. Fischer"
+, title =       "Finding Maximum Convex Polygons"
+, booktitle =   "Proc. 9th Internat. Conf. Fund. Comput. Theory"
+, site =        "Szeged, Hungary"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      710
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "234--243"
+, precedes =    "f-spafm-97"
+, update =      "99.11 bibrelex, 97.03 devillers, 94.09 smid, 93.09 milone+mitchell"
 }
 
 @article{f-spafm-97
-, author =	"P. Fischer"
-, title =	"Sequential and parallel algorithms for finding a maximum convex polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"187--200"
-, succeeds =	"f-fmcp-93"
-, update =	"97.03 devillers"
+, author =      "P. Fischer"
+, title =       "Sequential and parallel algorithms for finding a maximum convex polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "187--200"
+, succeeds =    "f-fmcp-93"
+, update =      "97.03 devillers"
 }
 
 @article{fh-cmaar-94
-, author =	"P. Fischer and K.-U. H{\"o}ffgen"
-, title =	"Computing a maximum axis-aligned rectangle in a convex polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	51
-, year =	1994
-, pages =	"189--193"
-, update =	"94.09 smid"
+, author =      "P. Fischer and K.-U. H{\"o}ffgen"
+, title =       "Computing a maximum axis-aligned rectangle in a convex polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      51
+, year =        1994
+, pages =       "189--193"
+, update =      "94.09 smid"
 }
 
 @inproceedings{fhll-aaar-93
-, author =	"P. Fischer and K.-U. H{\"o}ffgen and H. Lefmann and T. Luczak"
-, title =	"Approximations with Axis-Aligned Rectangles"
-, booktitle =	"Proc. 9th Internat. Conf. Fund. Comput. Theory"
-, site =	"Szeged, Hungary"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	710
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"244--255"
-, update =	"99.11 bibrelex, 94.09 smid, 93.09 milone+mitchell"
+, author =      "P. Fischer and K.-U. H{\"o}ffgen and H. Lefmann and T. Luczak"
+, title =       "Approximations with Axis-Aligned Rectangles"
+, booktitle =   "Proc. 9th Internat. Conf. Fund. Comput. Theory"
+, site =        "Szeged, Hungary"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      710
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "244--255"
+, update =      "99.11 bibrelex, 94.09 smid, 93.09 milone+mitchell"
 }
 
 @article{f-lbpvd-89
-, author =	"T. Fischer"
-, title =	"Lower bound proofs via {Voronoi} diagrams"
-, journal =	"J. Inform. Process. Cybern."
-, volume =	25
-, number =	"5--6"
-, year =	1989
-, pages =	"233--238"
-, keywords =	"lower bounds, Voronoi diagrams, $d$-dimensional"
-, update =	"95.09 korneenko"
+, author =      "T. Fischer"
+, title =       "Lower bound proofs via {Voronoi} diagrams"
+, journal =     "J. Inform. Process. Cybern."
+, volume =      25
+, number =      "5--6"
+, year =        1989
+, pages =       "233--238"
+, keywords =    "lower bounds, Voronoi diagrams, $d$-dimensional"
+, update =      "95.09 korneenko"
 }
 
 @techreport{f-crips-86
-, author =	"T. Fischer"
-, title =	"On the complexity of rectangle intersection problems under structural constraints"
-, type =	"Preprint"
-, number =	37
-, institution =	"Akad. Wissensch. DDR Inst. Math."
-, year =	1986
-, keywords =	"rectangles, intersection"
-, update =	"99.11 bibrelex, 98.07 bibrelex, 95.09 korneenko"
+, author =      "T. Fischer"
+, title =       "On the complexity of rectangle intersection problems under structural constraints"
+, type =        "Preprint"
+, number =      37
+, institution = "Akad. Wissensch. DDR Inst. Math."
+, year =        1986
+, keywords =    "rectangles, intersection"
+, update =      "99.11 bibrelex, 98.07 bibrelex, 95.09 korneenko"
 }
 
 @incollection{f-rbcss-86
-, author =	"T. Fischer"
-, title =	"Refined bounds on the complexity of sorting and selection in $d$-dimensional space"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	233
-, publisher =	"Springer-Verlag"
-, year =	1986
-, pages =	"308--314"
-, update =	"96.05 agarwal, 95.09 korneenko"
+, author =      "T. Fischer"
+, title =       "Refined bounds on the complexity of sorting and selection in $d$-dimensional space"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      233
+, publisher =   "Springer-Verlag"
+, year =        1986
+, pages =       "308--314"
+, update =      "96.05 agarwal, 95.09 korneenko"
 }
 
 @techreport{f-trcgs-86
-, author =	"T. Fischer"
-, title =	"Towards a refined classification of geometric search and computation problems"
-, type =	"Preprint"
-, institution =	"Akad. Wissensch. DDR. Inst. Math."
-, year =	1986
-, succeeds =	"f-trcgs-89"
-, update =	"98.07 bibrelex, 95.09 korneenko"
+, author =      "T. Fischer"
+, title =       "Towards a refined classification of geometric search and computation problems"
+, type =        "Preprint"
+, institution = "Akad. Wissensch. DDR. Inst. Math."
+, year =        1986
+, succeeds =    "f-trcgs-89"
+, update =      "98.07 bibrelex, 95.09 korneenko"
 }
 
 @inproceedings{f-trcgs-89
-, author =	"T. Fischer"
-, title =	"Towards refined classification of geometric search and computation problems"
-, editor =	"J. H. Davenport"
-, booktitle =	"European Conference on Computer Algebra"
-, nickname =	"EUROCAL '87"
-, site =	"Leipzig"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	378
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"426--437"
-, keywords =	"lower bounds, searching, $d$-dimensional"
-, precedes =	"f-trcgs-86"
-, update =	"97.11 bibrelex, 96.05 agarwal, 95.09 korneenko"
+, author =      "T. Fischer"
+, title =       "Towards refined classification of geometric search and computation problems"
+, editor =      "J. H. Davenport"
+, booktitle =   "European Conference on Computer Algebra"
+, nickname =    "EUROCAL '87"
+, site =        "Leipzig"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      378
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "426--437"
+, keywords =    "lower bounds, searching, $d$-dimensional"
+, precedes =    "f-trcgs-86"
+, update =      "97.11 bibrelex, 96.05 agarwal, 95.09 korneenko"
 }
 
 @incollection{fw-icgpd-86
-, author =	"T. Fischer and K. Wolfrum"
-, title =	"The inherent complexity of geometric problems in $d$-space"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	233
-, publisher =	"Springer-Verlag"
-, year =	1986
-, pages =	"315--324"
-, keywords =	"lower bounds, $d$-dimensional"
-, update =	"96.05 agarwal, 95.09 korneenko"
+, author =      "T. Fischer and K. Wolfrum"
+, title =       "The inherent complexity of geometric problems in $d$-space"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      233
+, publisher =   "Springer-Verlag"
+, year =        1986
+, pages =       "315--324"
+, keywords =    "lower bounds, $d$-dimensional"
+, update =      "96.05 agarwal, 95.09 korneenko"
 }
 
 @article{f-fatmd-80
-, author =	"M. A. Fischler"
-, title =	"Fast algorithms for two maximal distance problems with applications to image analysis"
-, journal =	"Pattern Recogn."
-, volume =	12
-, year =	1980
-, pages =	"35--40"
+, author =      "M. A. Fischler"
+, title =       "Fast algorithms for two maximal distance problems with applications to image analysis"
+, journal =     "Pattern Recogn."
+, volume =      12
+, year =        1980
+, pages =       "35--40"
 }
 
 @article{fb-rscpm-81
-, author =	"M. A. Fischler and R. C. Bolles"
-, title =	"Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography"
-, journal =	"Commun. ACM"
-, volume =	24
-, number =	6
-, year =	1981
-, pages =	"381--395"
-, update =	"97.11 bibrelex"
+, author =      "M. A. Fischler and R. C. Bolles"
+, title =       "Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography"
+, journal =     "Commun. ACM"
+, volume =      24
+, number =      6
+, year =        1981
+, pages =       "381--395"
+, update =      "97.11 bibrelex"
 }
 
 @book{f-peg-69
-, author =	"W. T. Fishback"
-, title =	"Projective and {Euclidean} Geometry"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1969
-, update =	"99.11 bibrelex"
+, author =      "W. T. Fishback"
+, title =       "Projective and {Euclidean} Geometry"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1969
+, update =      "99.11 bibrelex"
 }
 
 @article{f-cpfid-95
-, author =	"P. Fishburn"
-, title =	"Convex polygons with few intervertex distances"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"65--93"
-, update =	"96.09 devillers"
+, author =      "P. Fishburn"
+, title =       "Convex polygons with few intervertex distances"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "65--93"
+, update =      "96.09 devillers"
 }
 
 @article{f-ioco-88
-, author =	"P. C. Fishburn"
-, title =	"Interval orders and circle orders"
-, journal =	"Order"
-, volume =	5
-, year =	1988
-, pages =	"225--234"
-, update =	"98.03 bibrelex"
+, author =      "P. C. Fishburn"
+, title =       "Interval orders and circle orders"
+, journal =     "Order"
+, volume =      5
+, year =        1988
+, pages =       "225--234"
+, update =      "98.03 bibrelex"
 }
 
 @book{f-ioig-85
-, author =	"P. C. Fishburn"
-, title =	"Interval Orders and Interval Graphs"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1985
-, update =	"99.11 bibrelex, 94.05 franciosa"
+, author =      "P. C. Fishburn"
+, title =       "Interval Orders and Interval Graphs"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1985
+, update =      "99.11 bibrelex, 94.05 franciosa"
 }
 
 @article{fr-udbvc-92
-, author =	"P. C. Fishburn and J. A. Reeds"
-, title =	"Unit distances between vertices of a convex polygon"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	2
-, year =	1992
-, pages =	"81--91"
+, author =      "P. C. Fishburn and J. A. Reeds"
+, title =       "Unit distances between vertices of a convex polygon"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      2
+, year =        1992
+, pages =       "81--91"
 }
 
 @inproceedings{fl-cstds-86
-, author =	"A. D. Fisher and J. N. Lee"
-, title =	"The current status of two-dimensional spatial light modulator technology"
-, booktitle =	"Proc. of SPIE"
-, volume =	634
-, year =	1986
-, pages =	"352--371"
-, update =	"98.07 bibrelex"
+, author =      "A. D. Fisher and J. N. Lee"
+, title =       "The current status of two-dimensional spatial light modulator technology"
+, booktitle =   "Proc. of SPIE"
+, volume =      634
+, year =        1986
+, pages =       "352--371"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{fw-rvnsh-94
-, author =	"Frederick Fisher and Andrew Woo"
-, title =	"{R.E} versus {N.H} Specular Highlights"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"388--400"
-, keywords =	"Phong illumination, specular reflection"
-, update =	"94.09 heckbert"
-, annote =	"Compares two common variants of Phong's specular
+, author =      "Frederick Fisher and Andrew Woo"
+, title =       "{R.E} versus {N.H} Specular Highlights"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "388--400"
+, keywords =    "Phong illumination, specular reflection"
+, update =      "94.09 heckbert"
+, annote =      "Compares two common variants of Phong's specular
 reflection formula and derives a surprising relationship between them."
 }
 
 @article{frs-pp-85
-, author =	"J. C. Fisher and D. Ruoff and J. Shilleto"
-, title =	"Perpendicular polygons"
-, journal =	"Amer. Math. Monthly"
-, volume =	92
-, year =	1985
-, pages =	"23--37"
-, update =	"95.09 korneenko"
+, author =      "J. C. Fisher and D. Ruoff and J. Shilleto"
+, title =       "Perpendicular polygons"
+, journal =     "Amer. Math. Monthly"
+, volume =      92
+, year =        1985
+, pages =       "23--37"
+, update =      "95.09 korneenko"
 }
 
 @article{f-aiuva-93
-, author =	"P. F. Fisher"
-, title =	"Algorithm and Implementation Uncertainty in Viewshed Analysis"
-, journal =	"Internat. J. Geogr. Inform. Syst."
-, volume =	7
-, year =	1993
-, pages =	"331--347"
-, keywords =	"viewshed, uncertainty, terrains"
-, update =	"96.09 kreveld"
+, author =      "P. F. Fisher"
+, title =       "Algorithm and Implementation Uncertainty in Viewshed Analysis"
+, journal =     "Internat. J. Geogr. Inform. Syst."
+, volume =      7
+, year =        1993
+, pages =       "331--347"
+, keywords =    "viewshed, uncertainty, terrains"
+, update =      "96.09 kreveld"
 }
 
 @article{f-rvftm-96
-, author =	"P. F. Fisher"
-, title =	"Reconsideration of the viewshed function in terrain modelling"
-, journal =	"Geogr. Syst."
-, volume =	3
-, year =	1996
-, pages =	"33--58"
-, keywords =	"viewshed, uncertainty, terrains"
-, update =	"96.09 kreveld"
+, author =      "P. F. Fisher"
+, title =       "Reconsideration of the viewshed function in terrain modelling"
+, journal =     "Geogr. Syst."
+, volume =      3
+, year =        1996
+, pages =       "33--58"
+, keywords =    "viewshed, uncertainty, terrains"
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{f-sv-94
-, author =	"P. F. Fisher"
-, title =	"Stretching the Viewshed"
-, booktitle =	"Proc. 6th Internat. Sympos. Spatial Data Handling"
-, year =	1994
-, pages =	"725--738"
-, update =	"96.09 kreveld"
+, author =      "P. F. Fisher"
+, title =       "Stretching the Viewshed"
+, booktitle =   "Proc. 6th Internat. Sympos. Spatial Data Handling"
+, year =        1994
+, pages =       "725--738"
+, update =      "96.09 kreveld"
 }
 
 @article{f-edpsp-40
-, author =	"R. A. Fisher"
-, title =	"An examination of the different possible solutions of a problem in incomplete blocks"
-, journal =	"Annals of Eugenics"
-, volume =	10
-, year =	1940
-, pages =	"52--75"
-, update =	"98.03 bibrelex"
+, author =      "R. A. Fisher"
+, title =       "An examination of the different possible solutions of a problem in incomplete blocks"
+, journal =     "Annals of Eugenics"
+, volume =      10
+, year =        1940
+, pages =       "52--75"
+, update =      "98.03 bibrelex"
 }
 
 @article{f-spcwt-78
-, author =	"S. Fisk"
-, title =	"A short proof of {Chv\'atal's} watchman theorem"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	24
-, year =	1978
-, pages =	374
-, update =	"97.03 pocchiola, 94.05 devillers"
+, author =      "S. Fisk"
+, title =       "A short proof of {Chv\'atal's} watchman theorem"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      24
+, year =        1978
+, pages =       374
+, update =      "97.03 pocchiola, 94.05 devillers"
 }
 
 @article{f-spcrd-86
-, author =	"S. Fisk"
-, title =	"Separating points by circles and the recognition of digital discs"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	8
-, number =	4
-, year =	1986
-, pages =	"554--556"
-, keywords =	"points, partition"
-, update =	"95.09 korneenko"
+, author =      "S. Fisk"
+, title =       "Separating points by circles and the recognition of digital discs"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      8
+, number =      4
+, year =        1986
+, pages =       "554--556"
+, keywords =    "points, partition"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{f-agcg-97
-, author =	"Eugene Fiume"
-, title =	"Applied Geometry for Computer Graphics"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"181--186"
-, update =	"97.11 jones"
+, author =      "Eugene Fiume"
+, title =       "Applied Geometry for Computer Graphics"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "181--186"
+, update =      "97.11 jones"
 }
 
 @book{f-msrg-89
-, author =	"E. Fiume"
-, title =	"The Mathematical Structure of Raster Graphics"
-, publisher =	"Academic Press"
-, address =	"San Diego"
-, year =	1989
-, update =	"98.11 ghali"
+, author =      "E. Fiume"
+, title =       "The Mathematical Structure of Raster Graphics"
+, publisher =   "Academic Press"
+, address =     "San Diego"
+, year =        1989
+, update =      "98.11 ghali"
 }
 
 @techreport{ff-rtiph-85
-, author =	"E. Fiume and A. Fournier"
-, title =	"Ray-tracing is {$PSPACE$}-hard"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Toronto"
-, address =	"Toronto, ON"
-, year =	1985
+, author =      "E. Fiume and A. Fournier"
+, title =       "Ray-tracing is {$PSPACE$}-hard"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Toronto"
+, address =     "Toronto, ON"
+, year =        1985
 }
 
 @techreport{ff-vspsc-85
-, author =	"E. Fiume and A. Fournier"
-, title =	"The visible surface problem: semantics and complexity"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Toronto"
-, address =	"Toronto, ON"
-, year =	1985
+, author =      "E. Fiume and A. Fournier"
+, title =       "The visible surface problem: semantics and complexity"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Toronto"
+, address =     "Toronto, ON"
+, year =        1985
 }
 
 @incollection{ff-vspag-88
-, author =	"E. Fiume and A. Fournier"
-, title =	"The visible surface problem under abstract graphics models"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"575--586"
-, update =	"99.11 bibrelex"
+, author =      "E. Fiume and A. Fournier"
+, title =       "The visible surface problem under abstract graphics models"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "575--586"
+, update =      "99.11 bibrelex"
 }
 
 @article{ffr-pscaa-83
-, author =	"E. Fiume and A. Fournier and L. Rudolph"
-, title =	"A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultra-computer"
-, journal =	"ACM Comput. Graph."
-, volume =	17
-, number =	3
-, month =	jul
-, year =	1983
-, pages =	"141--150"
-, update =	"97.11 bibrelex"
+, author =      "E. Fiume and A. Fournier and L. Rudolph"
+, title =       "A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultra-computer"
+, journal =     "ACM Comput. Graph."
+, volume =      17
+, number =      3
+, month =       jul
+, year =        1983
+, pages =       "141--150"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{f-iffss-85
-, author =	"Per-Olof Fj{\"a}llstr{\"o}m"
-, title =	"Integration of free-form surfaces and solid modelling"
-, school =	"?"
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "Per-Olof Fj{\"a}llstr{\"o}m"
+, title =       "Integration of free-form surfaces and solid modelling"
+, school =      "?"
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{f-pabf-91
-, author =	"P.-O. Fj{\"a}llstr{\"o}m"
-, title =	"Polyhedral approximation of bivariate functions"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"187--190"
-, keywords =	"Computational geometry, {Delaunay} triangulation, polyhedral approximation"
-, cites =	"d-pdstb-89, f-sditm-82, gs-cdtp-78, l-scsi-77, l-gdtan-86, m-tdird-76, ps-cgi-85, w-cnddt-81, w-rit-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P.-O. Fj{\"a}llstr{\"o}m"
+, title =       "Polyhedral approximation of bivariate functions"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "187--190"
+, keywords =    "Computational geometry, {Delaunay} triangulation, polyhedral approximation"
+, cites =       "d-pdstb-89, f-sditm-82, gs-cdtp-78, l-scsi-77, l-gdtan-86, m-tdird-76, ps-cgi-85, w-cnddt-81, w-rit-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{f-spm-86
-, author =	"P. O. Fjallstrom"
-, title =	"Smoothing of polyhedral models"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"226--235"
-, cites =	"br-cagd-74, bbl-ntc-78, cc-rgbss-78, cg-pspca-84, fp-cgdm-79, ck-dsffs-83, f-iffss-85, gc-tipca-80, s-nrsps-83, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "P. O. Fjallstrom"
+, title =       "Smoothing of polyhedral models"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "226--235"
+, cites =       "br-cagd-74, bbl-ntc-78, cc-rgbss-78, cg-pspca-84, fp-cgdm-79, ck-dsffs-83, f-iffss-85, gc-tipca-80, s-nrsps-83, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{fklp-scha-90
-, author =	"P.-O. Fj{\"a}llstr{\"o}m and J. Katajainen and C. Levcopoulos and C. Petersson"
-, title =	"A sublogarithmic convex hull algorithm"
-, journal =	"BIT"
-, volume =	30
-, number =	3
-, year =	1990
-, pages =	"378--384"
-, keywords =	"convex hull, parallel computations"
-, update =	"95.09 korneenko"
+, author =      "P.-O. Fj{\"a}llstr{\"o}m and J. Katajainen and C. Levcopoulos and C. Petersson"
+, title =       "A sublogarithmic convex hull algorithm"
+, journal =     "BIT"
+, volume =      30
+, number =      3
+, year =        1990
+, pages =       "378--384"
+, keywords =    "convex hull, parallel computations"
+, update =      "95.09 korneenko"
 }
 
 @techreport{fp-eagcs-93
-, author =	"P. O. Fj{\"a}llstr{\"o}m and J. Petersson"
-, title =	"Evaluation of algorithms for geometrical contact-searching problems"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "P. O. Fj{\"a}llstr{\"o}m and J. Petersson"
+, title =       "Evaluation of algorithms for geometrical contact-searching problems"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @unpublished{fp-eorsm-94
-, author =	"Per-Olof Fj{\"a}llstr{\"o}m and Jan Petersson"
-, title =	"Evaluation of orthogonal range-searching methods for geometric contact searching"
-, institution =	"Dept. Computer Science, Link{\"o}ping Univ."
-, year =	1994
-, note =	"Manuscript (submitted)"
-, update =	"97.11 icking, 95.01 mitchell"
+, author =      "Per-Olof Fj{\"a}llstr{\"o}m and Jan Petersson"
+, title =       "Evaluation of orthogonal range-searching methods for geometric contact searching"
+, institution = "Dept. Computer Science, Link{\"o}ping Univ."
+, year =        1994
+, note =        "Manuscript (submitted)"
+, update =      "97.11 icking, 95.01 mitchell"
 }
 
 @article{fpnz-ersmc-98
-, author =	"P. O. Fj{\"a}llstr{\"o}m and J. Petersson and L. Nilsson and Z.-H. Zhong"
-, title =	"Evaluation of Range Searching Methods for Contact Searching in Mechanical Engineering"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"67--84"
-, update =	"98.11 devillers"
+, author =      "P. O. Fj{\"a}llstr{\"o}m and J. Petersson and L. Nilsson and Z.-H. Zhong"
+, title =       "Evaluation of Range Searching Methods for Contact Searching in Mechanical Engineering"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "67--84"
+, update =      "98.11 devillers"
 }
 
 @techreport{f-addmd-79
-, author =	"P. Flajolet"
-, title =	"Analyse d'algorithmes de manilulations d'arbres et de fichiers"
-, number =	"Cahier 34-35"
-, institution =	"B.U.R.O."
-, year =	1979
-, note =	"Cahiers du B.U.R.O. serie Recherche"
-, update =	"97.11 bibrelex"
+, author =      "P. Flajolet"
+, title =       "Analyse d'algorithmes de manilulations d'arbres et de fichiers"
+, number =      "Cahier 34-35"
+, institution = "B.U.R.O."
+, year =        1979
+, note =        "Cahiers du B.U.R.O. serie Recherche"
+, update =      "97.11 bibrelex"
 }
 
 @article{f-sdscm-85
-, author =	"P. Flajolet"
-, title =	"Singular differential systems + {Cauchy} = multidimensional search"
-, journal =	"Bull. EATCS"
-, volume =	26
-, year =	1985
-, pages =	"157--158"
+, author =      "P. Flajolet"
+, title =       "Singular differential systems + {Cauchy} = multidimensional search"
+, journal =     "Bull. EATCS"
+, volume =      26
+, year =        1985
+, pages =       "157--158"
 }
 
 @inproceedings{fgpr-amsqt-91
-, author =	"P. Flajolet and G. Gonnet and C. Puech and J. M. Robson"
-, title =	"The analysis of multidimensional searching in quad-trees"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"100--109"
-, keywords =	"quad trees"
+, author =      "P. Flajolet and G. Gonnet and C. Puech and J. M. Robson"
+, title =       "The analysis of multidimensional searching in quad-trees"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "100--109"
+, keywords =    "quad trees"
 }
 
 @article{fsz-aacaa-91
-, author =	"P. Flajolet and B. Salvy and P. Zimmerman"
-, title =	"Automatic average-case analysis of algorithms"
-, journal =	"Theoret. Comput. Sci."
-, volume =	79
-, year =	1991
-, pages =	"37--109"
-, keywords =	"recurrence, generating function, asymptotic analysis, combinatorial enumeration"
-, comments =	"general reference for a powerful automatic asymptotic analyzer"
-, update =	"94.01 matousek"
+, author =      "P. Flajolet and B. Salvy and P. Zimmerman"
+, title =       "Automatic average-case analysis of algorithms"
+, journal =     "Theoret. Comput. Sci."
+, volume =      79
+, year =        1991
+, pages =       "37--109"
+, keywords =    "recurrence, generating function, asymptotic analysis, combinatorial enumeration"
+, comments =    "general reference for a powerful automatic asymptotic analyzer"
+, update =      "94.01 matousek"
 }
 
 @article{fs-ppmta-83
-, author =	"P. Flajolet and J.-M. Steyaert"
-, title =	"Pattern and pattern-matching in trees: {An} analysis"
-, journal =	"Inform. Control"
-, volume =	58
-, number =	"1-3"
-, year =	1983
-, pages =	"18--58"
-, update =	"97.11 bibrelex"
+, author =      "P. Flajolet and J.-M. Steyaert"
+, title =       "Pattern and pattern-matching in trees: {An} analysis"
+, journal =     "Inform. Control"
+, volume =      58
+, number =      "1-3"
+, year =        1983
+, pages =       "18--58"
+, update =      "97.11 bibrelex"
 }
 
 @article{fcm-eergm-87
-, author =	"J. Flaquer and A. Carbajal and M. A. Mendez"
-, title =	"Edge-edge relationships in geometric modelling"
-, journal =	"Comput. Aided Design"
-, volume =	19
-, number =	5
-, year =	1987
-, pages =	"237--244"
-, keywords =	"polyhedra, geometric modelling"
-, update =	"95.09 korneenko"
+, author =      "J. Flaquer and A. Carbajal and M. A. Mendez"
+, title =       "Edge-edge relationships in geometric modelling"
+, journal =     "Comput. Aided Design"
+, volume =      19
+, number =      5
+, year =        1987
+, pages =       "237--244"
+, keywords =    "polyhedra, geometric modelling"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{fs-erqnn-95
-, author =	"Robin Y. Flatland and Charles V. Stewart"
-, title =	"Extending Range Queries and Nearest Neighbours"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"267--272"
-, update =	"95.09 jones"
+, author =      "Robin Y. Flatland and Charles V. Stewart"
+, title =       "Extending Range Queries and Nearest Neighbours"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "267--272"
+, update =      "95.09 jones"
 }
 
 @article{fs-erqnn-00
-, author =	"R. Y. Flatland and C. V. Stewart"
-, title =	"Extending range queries and nearest neighbours"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	17
-, year =	2000
-, pages =	"3--24"
-, update =	"01.04 smid"
+, author =      "R. Y. Flatland and C. V. Stewart"
+, title =       "Extending range queries and nearest neighbours"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      17
+, year =        2000
+, pages =       "3--24"
+, update =      "01.04 smid"
 }
 
 @inproceedings{fs-errrq-96
-, author =	"R. Y. Flatland and C. V. Stewart"
-, title =	"Extending rectangular range reporting with query sensitive analysis"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"319--324"
-, update =	"96.09 mitchell"
+, author =      "R. Y. Flatland and C. V. Stewart"
+, title =       "Extending rectangular range reporting with query sensitive analysis"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "319--324"
+, update =      "96.09 mitchell"
 }
 
 @inproceedings{fh-recpm-00
-, author =	"Eyal Flato and Dan Halperin"
-, title =	"Robust and Efficient Construction of Planar {Minkowski} Sums"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"85--88"
-, update =	"00.03 bibrelex"
+, author =      "Eyal Flato and Dan Halperin"
+, title =       "Robust and Efficient Construction of Planar {Minkowski} Sums"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "85--88"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{fhhn-dipmc-99
-, author =	"Eyal Flato and Dan Halperin and Iddo Hanniel and Oren Nechushtan"
-, title =	"The Design and Implementation of Planar Maps in {CGAL}"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"169--172"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Eyal Flato and Dan Halperin and Iddo Hanniel and Oren Nechushtan"
+, title =       "The Design and Implementation of Planar Maps in {CGAL}"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "169--172"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{f-sbstw-92
-, author =	"Rudolf Fleischer"
-, title =	"A Simple Balanced Search Tree With {$O(1)$} Worst-Case Update Time"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"77--80"
-, update =	"00.03 bibrelex"
+, author =      "Rudolf Fleischer"
+, title =       "A Simple Balanced Search Tree With {$O(1)$} Worst-Case Update Time"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "77--80"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{f-dtonr-93
-, author =	"R. Fleischer"
-, title =	"Decision Trees: {Old} and New Results"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"468--477"
-, update =	"97.03 smid"
+, author =      "R. Fleischer"
+, title =       "Decision Trees: {Old} and New Results"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "468--477"
+, update =      "97.03 smid"
 }
 
 @article{f-dtonr-99
-, author =	"R. Fleischer"
-, title =	"Decision trees: {Old} and new results"
-, journal =	"Inform. Comput."
-, volume =	152
-, year =	1999
-, pages =	"44--61"
-, update =	"00.11 smid"
+, author =      "R. Fleischer"
+, title =       "Decision trees: {Old} and new results"
+, journal =     "Inform. Comput."
+, volume =      152
+, year =        1999
+, pages =       "44--61"
+, update =      "00.11 smid"
 }
 
 @inproceedings{fmrwy-sioas-90
-, author =	"R. Fleischer and K. Mehlhorn and G{\"u}nter Rote and Emo Welzl and C. K. Yap"
-, title =	"On simultaneous inner and outer approximation of shapes"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"216--224"
-, precedes =	"fmrwy-sioas-92"
-, cites =	"acy-macp-85, afkmnsu-ampcb-90, c-pcp-83, ds-gmmmc-79, g-acb-83, j-episc-48, l-udaek-59, m-tgis-82, sfrw-acfpr-90, f-lidea-53, y-amp-87, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 rote"
+, author =      "R. Fleischer and K. Mehlhorn and G{\"u}nter Rote and Emo Welzl and C. K. Yap"
+, title =       "On simultaneous inner and outer approximation of shapes"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "216--224"
+, precedes =    "fmrwy-sioas-92"
+, cites =       "acy-macp-85, afkmnsu-ampcb-90, c-pcp-83, ds-gmmmc-79, g-acb-83, j-episc-48, l-udaek-59, m-tgis-82, sfrw-acfpr-90, f-lidea-53, y-amp-87, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 93.09 rote"
 }
 
 @article{fmrwy-sioas-92
-, author =	"R. Fleischer and K. Mehlhorn and G{\"u}nter Rote and Emo Welzl and C. K. Yap"
-, title =	"Simultaneous inner and outer approximation of shapes"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"365--389"
-, keywords =	"convex, Banach-Mazur distance, homothetic"
-, succeeds =	"fmrwy-sioas-90"
-, update =	"98.03 mitchell, 93.09 rote"
+, author =      "R. Fleischer and K. Mehlhorn and G{\"u}nter Rote and Emo Welzl and C. K. Yap"
+, title =       "Simultaneous inner and outer approximation of shapes"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "365--389"
+, keywords =    "convex, Banach-Mazur distance, homothetic"
+, succeeds =    "fmrwy-sioas-90"
+, update =      "98.03 mitchell, 93.09 rote"
 }
 
 @inproceedings{ft-orlt-00
-, author =	"Rudolf Fleischer and Gerhard Trippen"
-, title =	"Optimal Robot Localization in Trees"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"373--374"
-, keywords =	"video review"
-, update =	"00.11 jones"
+, author =      "Rudolf Fleischer and Gerhard Trippen"
+, title =       "Optimal Robot Localization in Trees"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "373--374"
+, keywords =    "video review"
+, update =      "00.11 jones"
 }
 
 @article{f-rglpr-86
-, author =	"U. Flemming"
-, title =	"On the representation and generation of loosely packed rectangles"
-, journal =	"Environ. \& Plan., Ser. B"
-, volume =	13
-, year =	1986
-, pages =	"189--205"
-, keywords =	"rectangles, packing, data structuring"
-, update =	"95.09 korneenko"
+, author =      "U. Flemming"
+, title =       "On the representation and generation of loosely packed rectangles"
+, journal =     "Environ. \& Plan., Ser. B"
+, volume =      13
+, year =        1986
+, pages =       "189--205"
+, keywords =    "rectangles, packing, data structuring"
+, update =      "95.09 korneenko"
 }
 
 @article{f-wrrda-80
-, author =	"U. Flemming"
-, title =	"Wall representations of rectangular dissections: additional results"
-, journal =	"Environ. \& Plan., Ser. B"
-, volume =	7
-, year =	1980
-, pages =	"247--251"
-, keywords =	"rectangles, isothetic polygons, partition"
-, update =	"95.09 korneenko"
+, author =      "U. Flemming"
+, title =       "Wall representations of rectangular dissections: additional results"
+, journal =     "Environ. \& Plan., Ser. B"
+, volume =      7
+, year =        1980
+, pages =       "247--251"
+, keywords =    "rectangles, isothetic polygons, partition"
+, update =      "95.09 korneenko"
 }
 
 @article{fk-ratss-88
-, author =	"L. A. Fletcher and R. Kasturi"
-, title =	"A robust algorithm for text string separation from mixed text/graph images"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	10
-, number =	6
-, year =	1988
-, pages =	"910--918"
-, keywords =	"image analysis, rectangles, clustering"
-, update =	"95.09 korneenko"
+, author =      "L. A. Fletcher and R. Kasturi"
+, title =       "A robust algorithm for text string separation from mixed text/graph images"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      10
+, number =      6
+, year =        1988
+, pages =       "910--918"
+, keywords =    "image analysis, rectangles, clustering"
+, update =      "95.09 korneenko"
 }
 
 @article{fs-qbic-95
-, author =	"M. Flickner and H. Sawhney and W. Niblack and J. Ashley and Q. Huang and B. Dom and M. Gorkani and J. Hafner and D. Lee and D. Petkovic and D. Steele and P. Yanker"
-, title =	"Query by Image and Video Content: The {QBIC} System"
-, journal =	"Computer"
-, volume =	28
-, year =	1995
-, pages =	"23--32"
-, update =	"98.07 agarwal"
+, author =      "M. Flickner and H. Sawhney and W. Niblack and J. Ashley and Q. Huang and B. Dom and M. Gorkani and J. Hafner and D. Lee and D. Petkovic and D. Steele and P. Yanker"
+, title =       "Query by Image and Video Content: The {QBIC} System"
+, journal =     "Computer"
+, volume =      28
+, year =        1995
+, pages =       "23--32"
+, update =      "98.07 agarwal"
 }
 
 @article{fj-scdnn-81
-, author =	"B. E. Flinchbaugh and L. K. Jones"
-, title =	"Strong connectivity in directional nearest-neighbor graphs"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	2
-, number =	4
-, year =	1981
-, pages =	"461--463"
-, keywords =	"closeness, nearest neighbor graph"
-, update =	"95.09 korneenko"
+, author =      "B. E. Flinchbaugh and L. K. Jones"
+, title =       "Strong connectivity in directional nearest-neighbor graphs"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      2
+, number =      4
+, year =        1981
+, pages =       "461--463"
+, keywords =    "closeness, nearest neighbor graph"
+, update =      "95.09 korneenko"
 }
 
 @article{f-undkd-
-, author =	"A. Flores"
-, title =	"{\"U}ber $n$-dimensionale {Komplexe} die im {$R_{2n+1}$} absolut selbstverschlungen sind"
-, journal =	"Ergeb. Math. Kolloq."
-, volume =	6
-, year =	"1932/1934"
-, pages =	"4--7"
-, update =	"95.01 matousek"
+, author =      "A. Flores"
+, title =       "{\"U}ber $n$-dimensionale {Komplexe} die im {$R_{2n+1}$} absolut selbstverschlungen sind"
+, journal =     "Ergeb. Math. Kolloq."
+, volume =      6
+, year =        "1932/1934"
+, pages =       "4--7"
+, update =      "95.01 matousek"
 }
 
 @article{f-acdp-86
-, author =	"A. Florian"
-, title =	"Approximation of convex discs by polygons"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"241--263"
+, author =      "A. Florian"
+, title =       "Approximation of convex discs by polygons"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "241--263"
 }
 
 @article{f-pld-78
-, author =	"A. Florian"
-, title =	"On the permeability of layers of discs"
-, journal =	"Studia Scientiarum Mathematicarum Hungarica"
-, volume =	13
-, year =	1978
-, pages =	"125--132"
-, update =	"93.09 milone+mitchell"
+, author =      "A. Florian"
+, title =       "On the permeability of layers of discs"
+, journal =     "Studia Scientiarum Mathematicarum Hungarica"
+, volume =      13
+, year =        1978
+, pages =       "125--132"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{fs-zvddm-87
-, author =	"A. Florian and W. M. Schmidt"
-, title =	"Zerlegung von {Dreiecken} in {Dreiecke} mit {Nebenbedigungen}"
-, journal =	"Geom. Dedicata"
-, volume =	24
-, year =	1987
-, pages =	"363--369"
-, keywords =	"triangle, covering, convex"
-, update =	"95.09 korneenko"
+, author =      "A. Florian and W. M. Schmidt"
+, title =       "Zerlegung von {Dreiecken} in {Dreiecke} mit {Nebenbedigungen}"
+, journal =     "Geom. Dedicata"
+, volume =      24
+, year =        1987
+, pages =       "363--369"
+, keywords =    "triangle, covering, convex"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{ffpan-vbmtf-86
-, author =	"L. De Floriani and B. Falcidieno and C. Pienovi and D. Allen and G. Nagy"
-, title =	"A visibility-based model for terrain features"
-, booktitle =	"Proc. 2nd Internat. Sympos. Spatial Data Handling"
-, year =	1986
-, pages =	"235--250"
-, update =	"96.09 kreveld"
+, author =      "L. De Floriani and B. Falcidieno and C. Pienovi and D. Allen and G. Nagy"
+, title =       "A visibility-based model for terrain features"
+, booktitle =   "Proc. 2nd Internat. Sympos. Spatial Data Handling"
+, year =        1986
+, pages =       "235--250"
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{fmp-seset-99
-, author =	"Leila De Floriani and Paola Magillo and Enrico Puppo"
-, title =	"A Simple and Efficient Sequential Encoding for Triangle Meshes"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"129--133"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Leila De Floriani and Paola Magillo and Enrico Puppo"
+, title =       "A Simple and Efficient Sequential Encoding for Triangle Meshes"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "129--133"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{fnp-clsnt-92
-, author =	"L. De Floriani and G. Nagy and E. Puppo"
-, title =	"Computing a Line-of-Sight Network on a Terrain Model"
-, booktitle =	"Proc. 5th Internat. Sympos. Spatial Data Handling"
-, year =	1992
-, pages =	"672--681"
-, update =	"96.09 kreveld"
+, author =      "L. De Floriani and G. Nagy and E. Puppo"
+, title =       "Computing a Line-of-Sight Network on a Terrain Model"
+, booktitle =   "Proc. 5th Internat. Sympos. Spatial Data Handling"
+, year =        1992
+, pages =       "672--681"
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{fy-okvd-01
-, author =	"Julia Fl{\"o}totto and Mariette Yvinec"
-, title =	"Order-$k$ {Voronoi} Diagrams"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"109--112"
-, update =	"01.04 icking"
+, author =      "Julia Fl{\"o}totto and Mariette Yvinec"
+, title =       "Order-$k$ {Voronoi} Diagrams"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "109--112"
+, update =      "01.04 icking"
 }
 
 @article{fr-aasfs-75
-, author =	"R. Floyd and R. Rivest"
-, title =	"Algorithm 489: The Algorithm {SELECT} for finding the {$i$}th smallest of {$n$} elements"
-, journal =	"Commun. ACM"
-, volume =	8
-, year =	1973
-, pages =	173
-, update =	"98.11 bibrelex"
+, author =      "R. Floyd and R. Rivest"
+, title =       "Algorithm 489: The Algorithm {SELECT} for finding the {$i$}th smallest of {$n$} elements"
+, journal =     "Commun. ACM"
+, volume =      8
+, year =        1973
+, pages =       173
+, update =      "98.11 bibrelex"
 }
 
 @article{fr-etbs-75
-, author =	"R. Floyd and R. Rivest"
-, title =	"Expected time bounds for selection"
-, journal =	"Commun. ACM"
-, volume =	18
-, year =	1975
-, pages =	"165--172"
-, update =	"97.11 bibrelex"
+, author =      "R. Floyd and R. Rivest"
+, title =       "Expected time bounds for selection"
+, journal =     "Commun. ACM"
+, volume =      18
+, year =        1975
+, pages =       "165--172"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{f-enphp-??
-, author =	"R. W. Floyd"
-, title =	"Expected number of points on hull of points drawn from triangle"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
+, author =      "R. W. Floyd"
+, title =       "Expected number of points on hull of points drawn from triangle"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
 }
 
 @techreport{f-scptd-89
-, author =	"S. Foldes"
-, title =	"Separability by convection and permeability in two-dimensional velocity fields"
-, number =	"G-89-32"
-, institution =	"GERAD and {\'E}cole des Hautes {\'E}tudes Commerciales"
-, address =	"Montr{\'e}al"
-, month =	sep
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "S. Foldes"
+, title =       "Separability by convection and permeability in two-dimensional velocity fields"
+, number =      "G-89-32"
+, institution = "GERAD and {\'E}cole des Hautes {\'E}tudes Commerciales"
+, address =     "Montr{\'e}al"
+, month =       sep
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @techreport{f-ssdco-89
-, author =	"S. Foldes"
-, title =	"Sequential separability of directionally convex objects with restricted motion"
-, number =	"G-89-21"
-, institution =	"GERAD and {\'E}cole des Hautes {\'E}tudes Commerciales"
-, address =	"Montr{\'e}al"
-, month =	jun
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "S. Foldes"
+, title =       "Sequential separability of directionally convex objects with restricted motion"
+, number =      "G-89-21"
+, institution = "GERAD and {\'E}cole des Hautes {\'E}tudes Commerciales"
+, address =     "Montr{\'e}al"
+, month =       jun
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{f-soplo-90
-, author =	"S. Foldes"
-, title =	"Spherical orders, planar lattices and obstruction graphs in abstract convection systems"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"134--137"
-, cites =	"fru-lsoso-88, f-ssdco-89, f-scptd-89, gy-tsr-80, ru-roptc-88, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. Foldes"
+, title =       "Spherical orders, planar lattices and obstruction graphs in abstract convection systems"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "134--137"
+, cites =       "fru-lsoso-88, f-ssdco-89, f-scptd-89, gy-tsr-80, ru-roptc-88, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{fru-lsoso-88
-, author =	"S. Foldes and I. Rival and J. Urrutia"
-, title =	"Light sources, obstructions and spherical orders"
-, number =	"G-88-30"
-, institution =	"GERAD and {\'E}cole des Hautes {\'E}tudes Commerciales"
-, address =	"Montr{\'e}al"
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "S. Foldes and I. Rival and J. Urrutia"
+, title =       "Light sources, obstructions and spherical orders"
+, number =      "G-88-30"
+, institution = "GERAD and {\'E}cole des Hautes {\'E}tudes Commerciales"
+, address =     "Montr{\'e}al"
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @article{fru-lsoso-92
-, author =	"S. Foldes and I. Rival and J. Urrutia"
-, title =	"Light sources, obstructions and spherical orders"
-, journal =	"Discrete Math."
-, volume =	102
-, year =	1992
-, pages =	"13--23"
-, update =	"95.01 franciosa"
+, author =      "S. Foldes and I. Rival and J. Urrutia"
+, title =       "Light sources, obstructions and spherical orders"
+, journal =     "Discrete Math."
+, volume =      102
+, year =        1992
+, pages =       "13--23"
+, update =      "95.01 franciosa"
 }
 
 @book{fd-ficg-82
-, author =	"J. D. Foley and A. van Dam"
-, title =	"Fundamentals of Interactive Computer Graphics"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, Mass."
-, year =	1982
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. D. Foley and A. van Dam"
+, title =       "Fundamentals of Interactive Computer Graphics"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, Mass."
+, year =        1982
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{fdfh-cgpp-90
-, author =	"J. D. Foley and A. van Dam and S. K. Feiner and J. F. Hughes"
-, title =	"Computer Graphics: Principles and Practice"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1990
-, note =	"second edition"
-, update =	"98.11 bibrelex, 94.09 lambert"
+, author =      "J. D. Foley and A. van Dam and S. K. Feiner and J. F. Hughes"
+, title =       "Computer Graphics: Principles and Practice"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1990
+, note =        "second edition"
+, update =      "98.11 bibrelex, 94.09 lambert"
 }
 
 @book{fdfhp-icg-93
-, author =	"J. D. Foley and A. van Dam and S. K. Feiner and J. F. Hughes and Phillips"
-, title =	"Introduction to Computer Graphics"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1993
-, update =	"94.09 lambert, 94.05 devillers"
+, author =      "J. D. Foley and A. van Dam and S. K. Feiner and J. F. Hughes and Phillips"
+, title =       "Introduction to Computer Graphics"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1993
+, update =      "94.09 lambert, 94.05 devillers"
 }
 
 @article{f-tsisd-84
-, author =	"T. A. Foley"
-, title =	"Three-stage interpolation to scattered data"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, number =	1
-, year =	1984
-, pages =	"141--150"
+, author =      "T. A. Foley"
+, title =       "Three-stage interpolation to scattered data"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, number =      1
+, year =        1984
+, pages =       "141--150"
 }
 
 @article{f-wbsir-87
-, author =	"T. A. Foley"
-, title =	"Weighted bicubic spline interpolation to rapidly varying data"
-, journal =	"ACM Trans. Graph."
-, volume =	6
-, year =	1987
-, pages =	"1--18"
+, author =      "T. A. Foley"
+, title =       "Weighted bicubic spline interpolation to rapidly varying data"
+, journal =     "ACM Trans. Graph."
+, volume =      6
+, year =        1987
+, pages =       "1--18"
 }
 
 @inproceedings{f-mlar3-95
-, author =	"Frank Follert"
-, title =	"Maxmin Location of an Anchored Ray in $3$-Space and Related Problems"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"7--12"
-, update =	"95.09 jones"
+, author =      "Frank Follert"
+, title =       "Maxmin Location of an Anchored Ray in $3$-Space and Related Problems"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "7--12"
+, update =      "95.09 jones"
 }
 
 @inproceedings{f-vsswm-96
-, author =	"F. Follert"
-, title =	"Viewing a set of spheres while moving on a linear flightpath"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"137--142"
-, update =	"96.09 mitchell"
+, author =      "F. Follert"
+, title =       "Viewing a set of spheres while moving on a linear flightpath"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "137--142"
+, update =      "96.09 mitchell"
 }
 
 @inproceedings{fss-sawmf-95
-, author =	"Frank Follert and Elmar Sch{\"o}mer and J{\"u}rgen Sellen"
-, title =	"Subquadratic Algorithms for the Weighted Maximin Facility Location Problem"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"1--6"
-, update =	"95.09 jones"
+, author =      "Frank Follert and Elmar Sch{\"o}mer and J{\"u}rgen Sellen"
+, title =       "Subquadratic Algorithms for the Weighted Maximin Facility Location Problem"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "1--6"
+, update =      "95.09 jones"
 }
 
 @techreport{fssst-cleac-95t
-, author =	"F. Follert and E. Sch{\"o}mer and J. Sellen and M. Smid and C. Thiel"
-, title =	"Computing a largest empty anchored cylinder, and related problems"
-, type =	"Report"
-, number =	"MPI-I-95-1-001"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1995
-, update =	"96.01 smid, 95.05 smid"
+, author =      "F. Follert and E. Sch{\"o}mer and J. Sellen and M. Smid and C. Thiel"
+, title =       "Computing a largest empty anchored cylinder, and related problems"
+, type =        "Report"
+, number =      "MPI-I-95-1-001"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1995
+, update =      "96.01 smid, 95.05 smid"
 }
 
 @inproceedings{fssst-cleac-95i
-, author =	"F. Follert and E. Sch{\"o}mer and J. Sellen and M. Smid and C. Thiel"
-, title =	"Computing a largest empty anchored cylinder, and related problems"
-, booktitle =	"Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1026
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"428--442"
-, update =	"97.03 agarwal, 96.01 smid"
+, author =      "F. Follert and E. Sch{\"o}mer and J. Sellen and M. Smid and C. Thiel"
+, title =       "Computing a largest empty anchored cylinder, and related problems"
+, booktitle =   "Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1026
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "428--442"
+, update =      "97.03 agarwal, 96.01 smid"
 }
 
 @article{fssst-cleac-97
-, author =	"F. Follert and E. Sch{\"o}mer and J. Sellen and M. Smid and C. Thiel"
-, title =	"Computing a largest empty anchored cylinder, and related problems"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"563--580"
-, update =	"98.03 smid"
+, author =      "F. Follert and E. Sch{\"o}mer and J. Sellen and M. Smid and C. Thiel"
+, title =       "Computing a largest empty anchored cylinder, and related problems"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "563--580"
+, update =      "98.03 smid"
 }
 
 @article{fc-sprap-90
-, author =	"D. Y.-S. Fong and J.-L. Chu"
-, title =	"A string pattern recognition approach to polygon clipping"
-, journal =	"Pattern Recogn."
-, volume =	23
-, number =	8
-, year =	1990
-, pages =	"879--892"
-, keywords =	"polygons, clipping"
-, update =	"95.09 korneenko"
+, author =      "D. Y.-S. Fong and J.-L. Chu"
+, title =       "A string pattern recognition approach to polygon clipping"
+, journal =     "Pattern Recogn."
+, volume =      23
+, number =      8
+, year =        1990
+, pages =       "879--892"
+, keywords =    "polygons, clipping"
+, update =      "95.09 korneenko"
 }
 
 @techreport{f-gta-92
-, author =	"A. B. Forbes"
-, title =	"Geometric tolerance assessment"
-, type =	"Technical {Report}"
-, number =	"DITC 210/92"
-, institution =	"Division of Information Technology and Computing, National Physical Laboratory"
-, address =	"Teddington, UK"
-, month =	oct
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "A. B. Forbes"
+, title =       "Geometric tolerance assessment"
+, type =        "Technical {Report}"
+, number =      "DITC 210/92"
+, institution = "Division of Information Technology and Computing, National Physical Laboratory"
+, address =     "Teddington, UK"
+, month =       oct
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @book{ff-fn-62
-, author =	"L. Ford and D. Fulkerson"
-, title =	"Flows in Networks"
-, publisher =	"Princeton University Press"
-, year =	1962
-, update =	"97.11 bibrelex"
+, author =      "L. Ford and D. Fulkerson"
+, title =       "Flows in Networks"
+, publisher =   "Princeton University Press"
+, year =        1962
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{f-agpsp-92
-, author =	"M. Formann"
-, title =	"Algorithms for geometric packing and scaling problems"
-, school =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
-, address =	"Berling, Germany"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "M. Formann"
+, title =       "Algorithms for geometric packing and scaling problems"
+, school =      "Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
+, address =     "Berling, Germany"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{f-wcp-92
-, author =	"M. Formann"
-, title =	"Weighted closest pairs"
-, type =	"Report"
-, number =	"B-92-04"
-, institution =	"Fachber. Math., Free Univ. Berlin"
-, month =	feb
-, year =	1992
-, precedes =	"f-wcp-93"
-, update =	"93.05 smid"
+, author =      "M. Formann"
+, title =       "Weighted closest pairs"
+, type =        "Report"
+, number =      "B-92-04"
+, institution = "Fachber. Math., Free Univ. Berlin"
+, month =       feb
+, year =        1992
+, precedes =    "f-wcp-93"
+, update =      "93.05 smid"
 }
 
 @inproceedings{f-wcp-92c
-, author =	"Michael Formann"
-, title =	"Weighted Closest Pairs"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"59--60"
-, update =	"00.03 bibrelex"
+, author =      "Michael Formann"
+, title =       "Weighted Closest Pairs"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "59--60"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{f-wcp-93
-, author =	"M. Formann"
-, title =	"Weighted closest pairs"
-, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	665
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"270--281"
-, succeeds =	"f-wcp-92"
-, update =	"93.05 smid"
+, author =      "M. Formann"
+, title =       "Weighted closest pairs"
+, booktitle =   "Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      665
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "270--281"
+, succeeds =    "f-wcp-92"
+, update =      "93.05 smid"
 }
 
 @techreport{fhhklsww-dgphr-90t
-, author =	"M. Formann and T. Hagerup and J. Haralambides and M. Kaufmann and F. T. Leighton and A. Simvonis and Emo Welzl and G. Woeginger"
-, title =	"Drawing graphs in the plane with high resolution"
-, type =	"Technical {Report}"
-, number =	"B-90-10"
-, institution =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, month =	dec
-, year =	1990
-, precedes =	"fhhklsww-dgphr-90i"
-, update =	"98.07 rote, 98.03 mitchell, 93.09 milone+mitchell"
+, author =      "M. Formann and T. Hagerup and J. Haralambides and M. Kaufmann and F. T. Leighton and A. Simvonis and Emo Welzl and G. Woeginger"
+, title =       "Drawing graphs in the plane with high resolution"
+, type =        "Technical {Report}"
+, number =      "B-90-10"
+, institution = "Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, month =       dec
+, year =        1990
+, precedes =    "fhhklsww-dgphr-90i"
+, update =      "98.07 rote, 98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @inproceedings{fhhklsww-dgphr-90i
-, author =	"M. Formann and T. Hagerup and J. Haralambides and M. Kaufmann and F. T. Leighton and A. Simvonis and Emo Welzl and G. Woeginger"
-, title =	"Drawing Graphs in the Plane with High Resolution"
-, booktitle =	"Proc. 31th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"86--95"
-, keywords =	"graph drawing"
-, succeeds =	"fhhklsww-dgphr-90t"
-, precedes =	"fhhklsww-dgphr-93"
-, update =	"98.11 bibrelex, 98.07 rote, 98.03 mitchell, 94.05 franciosa, 93.09 tamassia"
+, author =      "M. Formann and T. Hagerup and J. Haralambides and M. Kaufmann and F. T. Leighton and A. Simvonis and Emo Welzl and G. Woeginger"
+, title =       "Drawing Graphs in the Plane with High Resolution"
+, booktitle =   "Proc. 31th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "86--95"
+, keywords =    "graph drawing"
+, succeeds =    "fhhklsww-dgphr-90t"
+, precedes =    "fhhklsww-dgphr-93"
+, update =      "98.11 bibrelex, 98.07 rote, 98.03 mitchell, 94.05 franciosa, 93.09 tamassia"
 }
 
 @article{fhhklsww-dgphr-93
-, author =	"M. Formann and T. Hagerup and J. Haralambides and M. Kaufmann and F. T. Leighton and A. Simvonis and Emo Welzl and G. Woeginger"
-, title =	"Drawing Graphs in the Plane with High Resolution"
-, journal =	"SIAM J. Comput."
-, volume =	22
-, year =	1993
-, pages =	"1035--1052"
-, keywords =	"graph drawing"
-, succeeds =	"fhhklsww-dgphr-90i"
-, update =	"98.03 mitchell, 94.05 franciosa"
+, author =      "M. Formann and T. Hagerup and J. Haralambides and M. Kaufmann and F. T. Leighton and A. Simvonis and Emo Welzl and G. Woeginger"
+, title =       "Drawing Graphs in the Plane with High Resolution"
+, journal =     "SIAM J. Comput."
+, volume =      22
+, year =        1993
+, pages =       "1035--1052"
+, keywords =    "graph drawing"
+, succeeds =    "fhhklsww-dgphr-90i"
+, update =      "98.03 mitchell, 94.05 franciosa"
 }
 
 @inproceedings{fww-rtdcm-91
-, author =	"M. Formann and D. Wagner and F. Wagner"
-, title =	"Routing through a dense channel with minimum total wire length"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"475--482"
+, author =      "M. Formann and D. Wagner and F. Wagner"
+, title =       "Routing through a dense channel with minimum total wire length"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "475--482"
 }
 
 @article{fww-rtdcm-93
-, author =	"M. Formann and D. Wagner and F. Wagner"
-, title =	"Routing through a Dense Channel with Minimum Total Wire Length"
-, journal =	"J. Algorithms"
-, volume =	15
-, year =	1993
-, pages =	"267--283"
-, update =	"97.03 gaertner+salinger"
+, author =      "M. Formann and D. Wagner and F. Wagner"
+, title =       "Routing through a Dense Channel with Minimum Total Wire Length"
+, journal =     "J. Algorithms"
+, volume =      15
+, year =        1993
+, pages =       "267--283"
+, update =      "97.03 gaertner+salinger"
 }
 
 @unpublished{fw--90
-, author =	"M. Formann and F. Wagner"
-, year =	1990
-, note =	"Unpublished note"
-, update =	"97.11 bibrelex"
+, author =      "M. Formann and F. Wagner"
+, year =        1990
+, note =        "Unpublished note"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{fw-ppalm-91
-, author =	"M. Formann and F. Wagner"
-, title =	"A packing problem with applications to lettering of maps"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"281--288"
-, keywords =	"packing, optimization"
-, cites =	"b-lbact-83, e-ddsoi-80, eis-ctmfp-76, gj-cigtn-79, ia-eaggs-86, i-pnm-75, y-laml-72, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "M. Formann and F. Wagner"
+, title =       "A packing problem with applications to lettering of maps"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "281--288"
+, keywords =    "packing, optimization"
+, cites =       "b-lbact-83, e-ddsoi-80, eis-ctmfp-76, gj-cigtn-79, ia-eaggs-86, i-pnm-75, y-laml-72, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{fw-vlpve-91
-, author =	"M. Formann and F. Wagner"
-, title =	"The {VLSI} Layout Problem in Various Embedding Models"
-, booktitle =	"Proc. 16th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	484
-, year =	1991
-, pages =	"130--139"
-, update =	"97.03 gaertner+salinger"
+, author =      "M. Formann and F. Wagner"
+, title =       "The {VLSI} Layout Problem in Various Embedding Models"
+, booktitle =   "Proc. 16th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      484
+, year =        1991
+, pages =       "130--139"
+, update =      "97.03 gaertner+salinger"
 }
 
 @techreport{f-bcg-84
-, author =	"A. R. Forrest"
-, title =	"Bibliography on computational geometry"
-, type =	"Internal {Report}"
-, number =	"CSA-8-1984/Memo CGP84-1"
-, institution =	"Comput. Geom. Project, School Comput. Studies Accountancy, Univ. East Anglia"
-, year =	1984
+, author =      "A. R. Forrest"
+, title =       "Bibliography on computational geometry"
+, type =        "Internal {Report}"
+, number =      "CSA-8-1984/Memo CGP84-1"
+, institution = "Comput. Geom. Project, School Comput. Studies Accountancy, Univ. East Anglia"
+, year =        1984
 }
 
 @article{f-cg-71
-, author =	"A. R. Forrest"
-, title =	"Computational geometry"
-, journal =	"Proc. Roy. Soc. Lond. Ser. A"
-, volume =	321
-, year =	1971
-, pages =	"187--195"
+, author =      "A. R. Forrest"
+, title =       "Computational geometry"
+, journal =     "Proc. Roy. Soc. Lond. Ser. A"
+, volume =      321
+, year =        1971
+, pages =       "187--195"
 }
 
 @incollection{f-cgap-74
-, author =	"A. R. Forrest"
-, title =	"Computational geometry: achievements and problems"
-, editor =	"R. E. Barnhill and R. F. Riesenfeld"
-, booktitle =	"Comput. Aided Geom. Design"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1974
-, pages =	"17--44"
+, author =      "A. R. Forrest"
+, title =       "Computational geometry: achievements and problems"
+, editor =      "R. E. Barnhill and R. F. Riesenfeld"
+, booktitle =   "Comput. Aided Geom. Design"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1974
+, pages =       "17--44"
 }
 
 @incollection{f-cgset-87
-, author =	"A. R. Forrest"
-, title =	"Computational Geometry and Software Engineering: Towards a Geometric Computing Environment"
-, editor =	"D. F. Rogers and R. A. Earnshaw"
-, booktitle =	"Techniques for Computer Graphics"
-, publisher =	"Springer-Verlag"
-, year =	1987
-, pages =	"23--37"
-, isbn =	"3-540-96492-4"
-, update =	"93.09 held"
+, author =      "A. R. Forrest"
+, title =       "Computational Geometry and Software Engineering: Towards a Geometric Computing Environment"
+, editor =      "D. F. Rogers and R. A. Earnshaw"
+, booktitle =   "Techniques for Computer Graphics"
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "23--37"
+, isbn =        "3-540-96492-4"
+, update =      "93.09 held"
 }
 
 @incollection{f-cgpractice-85
-, author =	"A. R. Forrest"
-, title =	"Computational geometry in practice"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Fundamental Algorithms for Computer Graphics"
-, series =	"NATO ASI"
-, volume =	"F17"
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"707--724"
+, author =      "A. R. Forrest"
+, title =       "Computational geometry in practice"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Fundamental Algorithms for Computer Graphics"
+, series =      "NATO ASI"
+, volume =      "F17"
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "707--724"
 }
 
 @incollection{f-gcest-88
-, author =	"A. R. Forrest"
-, title =	"Geometric computing environments: some tentative thoughts"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"185--198"
-, keywords =	"implementing algorithms"
-, update =	"99.11 bibrelex"
+, author =      "A. R. Forrest"
+, title =       "Geometric computing environments: some tentative thoughts"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "185--198"
+, keywords =    "implementing algorithms"
+, update =      "99.11 bibrelex"
 }
 
 @incollection{f-rwga-80
-, author =	"A. R. Forrest"
-, title =	"Recent work on geometric algorithms"
-, editor =	"K. W. Brodlie"
-, booktitle =	"Mathematical Methods in Computer Graphics and Design"
-, publisher =	"Academic Press"
-, address =	"London, England"
-, year =	1980
-, pages =	"105--121"
+, author =      "A. R. Forrest"
+, title =       "Recent work on geometric algorithms"
+, editor =      "K. W. Brodlie"
+, booktitle =   "Mathematical Methods in Computer Graphics and Design"
+, publisher =   "Academic Press"
+, address =     "London, England"
+, year =        1980
+, pages =       "105--121"
 }
 
 @book{f-wd-71
-, author =	"J. W. Forrester"
-, title =	"World Dynamics"
-, publisher =	"Wright-Allen"
-, address =	"Cambridge, Mass."
-, year =	1971
-, keywords =	"graph drawing, example"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "J. W. Forrester"
+, title =       "World Dynamics"
+, publisher =   "Wright-Allen"
+, address =     "Cambridge, Mass."
+, year =        1971
+, keywords =    "graph drawing, example"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @article{f-gcen-32
-, author =	"R. M. Forster"
-, title =	"Geometrical Circuits of Electrical Networks"
-, journal =	"Trans. Amer. Inst. Elec. Engrs."
-, volume =	51
-, year =	1932
-, pages =	"309--317"
-, update =	"97.11 bibrelex"
+, author =      "R. M. Forster"
+, title =       "Geometrical Circuits of Electrical Networks"
+, journal =     "Trans. Amer. Inst. Elec. Engrs."
+, volume =      51
+, year =        1932
+, pages =       "309--317"
+, update =      "97.11 bibrelex"
 }
 
 @book{fm-cslas-67
-, author =	"G. Forsythe and C. Moler"
-, title =	"Computer solutions of linear algebraic systems"
-, publisher =	"Prentice Hall"
-, year =	1967
-, update =	"97.03 devillers"
+, author =      "G. Forsythe and C. Moler"
+, title =       "Computer solutions of linear algebraic systems"
+, publisher =   "Prentice Hall"
+, year =        1967
+, update =      "97.03 devillers"
 }
 
 @inproceedings{f-btapi-96
-, author =	"S. Fortune"
-, title =	"A beam-tracing algorithm for prediction of indoor radio propagation"
-, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
-, site =	"Philadelphia, PA"
-, month =	may
-, year =	1996
-, pages =	"76--81"
-, update =	"98.07 bibrelex"
+, author =      "S. Fortune"
+, title =       "A beam-tracing algorithm for prediction of indoor radio propagation"
+, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
+, site =        "Philadelphia, PA"
+, month =       may
+, year =        1996
+, pages =       "76--81"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{f-savd-86
-, author =	"S. Fortune"
-, title =	"A sweepline algorithm for {Voronoi} diagrams"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"313--322"
-, precedes =	"f-savd-87"
-, cites =	"ae-oacwv-84, bwy-oetac-80, cd-vdbcd-85, f-fapct-85, gs-cdtp-78, k-eccs-79, ld-gvdp-81, ls-tacdt-80, ls-ippvd-87, ls-pptmc-85, l-matps-82, oim-iimvd-84, p-masp-77, sh-cpp-75, s-a-83, st-pplup-86, y-oavds-84, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "S. Fortune"
+, title =       "A sweepline algorithm for {Voronoi} diagrams"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "313--322"
+, precedes =    "f-savd-87"
+, cites =       "ae-oacwv-84, bwy-oetac-80, cd-vdbcd-85, f-fapct-85, gs-cdtp-78, k-eccs-79, ld-gvdp-81, ls-tacdt-80, ls-ippvd-87, ls-pptmc-85, l-matps-82, oim-iimvd-84, p-masp-77, sh-cpp-75, s-a-83, st-pplup-86, y-oavds-84, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{f-nsa2d-95
-, author =	"S. Fortune"
-, title =	"Numerical stability of algorithms for $2$-d {Delaunay} triangulations"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, number =	"1--2"
-, year =	1995
-, pages =	"193--213"
-, keywords =	"robustness, numerical precision"
-, succeeds =	"f-nsa2d-92"
-, update =	"98.07 tamassia, 96.01 liotta"
+, author =      "S. Fortune"
+, title =       "Numerical stability of algorithms for $2$-d {Delaunay} triangulations"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, number =      "1--2"
+, year =        1995
+, pages =       "193--213"
+, keywords =    "robustness, numerical precision"
+, succeeds =    "f-nsa2d-92"
+, update =      "98.07 tamassia, 96.01 liotta"
 }
 
 @inproceedings{f-nsa2d-92
-, author =	"S. Fortune"
-, title =	"Numerical stability of algorithms for $2$-d {Delaunay} triangulations and {Voronoi} diagrams"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"83--92"
-, cites =	"dba-nm-74, f-savd-87, f-smpst-89, f-pcg-93, gs-cdtp-78, gs-pmgsc-85, h-pargc-89, l-scsi-77, m-vigau-88a, m-vigau-88p, si-gafpa-88, si-cvd10-89, ZZZ"
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "S. Fortune"
+, title =       "Numerical stability of algorithms for $2$-d {Delaunay} triangulations and {Voronoi} diagrams"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "83--92"
+, cites =       "dba-nm-74, f-savd-87, f-smpst-89, f-pcg-93, gs-cdtp-78, gs-pmgsc-85, h-pargc-89, l-scsi-77, m-vigau-88a, m-vigau-88p, si-gafpa-88, si-cvd10-89, ZZZ"
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @article{f-pmmia-97
-, author =	"S. Fortune"
-, title =	"Polyhedral Modeling with Multiprecision Integer Arithmetic"
-, journal =	"Comput. Aided Design"
-, volume =	29
-, number =	2
-, year =	1997
-, pages =	"123--133"
-, update =	"98.07 held"
+, author =      "S. Fortune"
+, title =       "Polyhedral Modeling with Multiprecision Integer Arithmetic"
+, journal =     "Comput. Aided Design"
+, volume =      29
+, number =      2
+, year =        1997
+, pages =       "123--133"
+, update =      "98.07 held"
 }
 
 @incollection{f-pcg-93
-, author =	"S. Fortune"
-, title =	"Progress in Computational Geometry"
-, editor =	"R. Martin"
-, booktitle =	"Directions in Computational Geometry"
-, publisher =	"Information Geometers"
-, year =	1993
-, pages =	"81--128"
-, keywords =	"survey paper"
-, update =	"98.03 mitchell, 93.05 orourke"
+, author =      "S. Fortune"
+, title =       "Progress in Computational Geometry"
+, editor =      "R. Martin"
+, booktitle =   "Directions in Computational Geometry"
+, publisher =   "Information Geometers"
+, year =        1993
+, pages =       "81--128"
+, keywords =    "survey paper"
+, update =      "98.03 mitchell, 93.05 orourke"
 }
 
 @inproceedings{f-riga-96
-, author =	"S. Fortune"
-, title =	"Robustness Issues in Geometric Algorithms"
-, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
-, site =	"Philadelphia, PA, USA"
-, month =	may
-, year =	1996
-, pages =	"20--23"
-, update =	"97.11 held"
+, author =      "S. Fortune"
+, title =       "Robustness Issues in Geometric Algorithms"
+, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
+, site =        "Philadelphia, PA, USA"
+, month =       may
+, year =        1996
+, pages =       "20--23"
+, update =      "97.11 held"
 }
 
 @incollection{f-riga-96i
-, author =	"S. Fortune"
-, title =	"Robustness issues in geometric algorithms"
-, editor =	"M. C. Lin and D. Manocha"
-, booktitle =	"Applied Computational Geometry: Towards Geometric Engineering"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1148
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"9--14"
-, update =	"98.07 bibrelex"
+, author =      "S. Fortune"
+, title =       "Robustness issues in geometric algorithms"
+, editor =      "M. C. Lin and D. Manocha"
+, booktitle =   "Applied Computational Geometry: Towards Geometric Engineering"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1148
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "9--14"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{f-smpst-90
-, author =	"S. Fortune"
-, title =	"Stable Maintenance of Point-Set Triangulation in Two Dimensions"
-, type =	"Manuscript"
-, institution =	"AT\&T Bell Laboratories"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "S. Fortune"
+, title =       "Stable Maintenance of Point-Set Triangulation in Two Dimensions"
+, type =        "Manuscript"
+, institution = "AT\&T Bell Laboratories"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{f-smpst-89
-, author =	"S. Fortune"
-, title =	"Stable maintenance of point set triangulations in two dimensions"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, month =	oct
-, year =	1989
-, pages =	"494--505"
-, update =	"98.11 bibrelex"
+, author =      "S. Fortune"
+, title =       "Stable maintenance of point set triangulations in two dimensions"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, month =       oct
+, year =        1989
+, pages =       "494--505"
+, update =      "98.11 bibrelex"
 }
 
 @article{f-vrtdp-99
-, author =	"S. Fortune"
-, title =	"Vertex-Rounding a Three-Dimensional Polyhedral Subdivision"
-, journal =	"Discrete Comput. Geom."
-, volume =	22
-, number =	4
-, year =	1999
-, pages =	"593--618"
-, update =	"99.11 held"
+, author =      "S. Fortune"
+, title =       "Vertex-Rounding a Three-Dimensional Polyhedral Subdivision"
+, journal =     "Discrete Comput. Geom."
+, volume =      22
+, number =      4
+, year =        1999
+, pages =       "593--618"
+, update =      "99.11 held"
 }
 
 @incollection{f-vddt-92
-, author =	"S. Fortune"
-, title =	"Voronoi diagrams and {Delaunay} triangulations"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	1
-, edition =	"1st"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1992
-, pages =	"193--233"
-, keywords =	"survey paper, Voronoi diagrams, Delaunay triangulations"
-, precedes =	"f-vddt-95"
-, update =	"98.03 bibrelex, 97.11 bibrelex, 93.09 erickson"
+, author =      "S. Fortune"
+, title =       "Voronoi diagrams and {Delaunay} triangulations"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      1
+, edition =     "1st"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1992
+, pages =       "193--233"
+, keywords =    "survey paper, Voronoi diagrams, Delaunay triangulations"
+, precedes =    "f-vddt-95"
+, update =      "98.03 bibrelex, 97.11 bibrelex, 93.09 erickson"
 }
 
 @incollection{f-vddt-95
-, author =	"S. Fortune"
-, title =	"Voronoi diagrams and {Delaunay} triangulations"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1995
-, pages =	"225--265"
-, keywords =	"survey paper, Voronoi diagrams, Delaunay triangulations"
-, succeeds =	"f-vddt-92"
-, update =	"99.11 bibrelex, 98.07 icking, 98.03 bibrelex, 97.11 bibrelex, 97.03 pocchiola"
+, author =      "S. Fortune"
+, title =       "Voronoi diagrams and {Delaunay} triangulations"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1995
+, pages =       "225--265"
+, keywords =    "survey paper, Voronoi diagrams, Delaunay triangulations"
+, succeeds =    "f-vddt-92"
+, update =      "99.11 bibrelex, 98.07 icking, 98.03 bibrelex, 97.11 bibrelex, 97.03 pocchiola"
 }
 
 @incollection{f-vddt-97
-, author =	"S. Fortune"
-, title =	"Voronoi diagrams and {Delaunay} triangulations"
-, chapter =	20
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"377--388"
-, update =	"97.11 orourke"
+, author =      "S. Fortune"
+, title =       "Voronoi diagrams and {Delaunay} triangulations"
+, chapter =     20
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "377--388"
+, update =      "97.11 orourke"
 }
 
 @inproceedings{fm-nsala-91
-, author =	"S. Fortune and V. Milenkovic"
-, title =	"Numerical stability of algorithms for line arrangements"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, site =	"North Conway, N.H."
-, month =	jun
-, year =	1991
-, pages =	"334--341"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"arrangements, implementing algorithms, robust geometric computation"
-, cites =	"cgl-pgd-83, eg-tsa-86, eos-calha-86, f-smpst-90, gt-tgt-87, g-as-72, gss-egbra-89, gs-pmgsc-85, h-pargc-89, hhk-tirgc-88, hk-prga-89, k-rmrs-89, lm-cschu-90, m-dpggt-89, m-vigau-88p, m-vigau-88a, m-utcpc-89, si-gafpa-88, si-cvd10-89, ZZZ"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 97.03 daniels"
+, author =      "S. Fortune and V. Milenkovic"
+, title =       "Numerical stability of algorithms for line arrangements"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, site =        "North Conway, N.H."
+, month =       jun
+, year =        1991
+, pages =       "334--341"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "arrangements, implementing algorithms, robust geometric computation"
+, cites =       "cgl-pgd-83, eg-tsa-86, eos-calha-86, f-smpst-90, gt-tgt-87, g-as-72, gss-egbra-89, gs-pmgsc-85, h-pargc-89, hhk-tirgc-88, hk-prga-89, k-rmrs-89, lm-cschu-90, m-dpggt-89, m-vigau-88p, m-vigau-88a, m-utcpc-89, si-gafpa-88, si-cvd10-89, ZZZ"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 97.03 daniels"
 }
 
 @inproceedings{fv-eeacg-93
-, author =	"S. Fortune and C. J. {Van Wyk}"
-, title =	"Efficient exact arithmetic for computational geometry"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, month =	may
-, year =	1993
-, pages =	"163--172"
-, succeeds =	"fw-eeacg-92"
-, cites =	"b-csmpi-72, bkv-eccm-91, c-sede-92, cms-frric-92i, f-nsa2d-92, f-vddt-92, gs-pmgsc-85, h-gsm-89, kln-edtur-91, k-sa-81, l-scsi-77, m-vigau-88a, m-maia-79, svh-bpepa-89, sh-cpp-75, si-gafpa-88, si-cvd10-89, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
+, author =      "S. Fortune and C. J. {Van Wyk}"
+, title =       "Efficient exact arithmetic for computational geometry"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, month =       may
+, year =        1993
+, pages =       "163--172"
+, succeeds =    "fw-eeacg-92"
+, cites =       "b-csmpi-72, bkv-eccm-91, c-sede-92, cms-frric-92i, f-nsa2d-92, f-vddt-92, gs-pmgsc-85, h-gsm-89, kln-edtur-91, k-sa-81, l-scsi-77, m-vigau-88a, m-maia-79, svh-bpepa-89, sh-cpp-75, si-gafpa-88, si-cvd10-89, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
 }
 
 @article{fv-sayee-96
-, author =	"S. Fortune and C. J. {Van Wyk}"
-, title =	"Static Analysis Yields Efficient Exact Integer Arithmetic for Computational Geometry"
-, journal =	"ACM Trans. Graph."
-, volume =	15
-, number =	3
-, month =	jul
-, year =	1996
-, pages =	"223--248"
-, update =	"98.07 bibrelex, 97.03 held"
+, author =      "S. Fortune and C. J. {Van Wyk}"
+, title =       "Static Analysis Yields Efficient Exact Integer Arithmetic for Computational Geometry"
+, journal =     "ACM Trans. Graph."
+, volume =      15
+, number =      3
+, month =       jul
+, year =        1996
+, pages =       "223--248"
+, update =      "98.07 bibrelex, 97.03 held"
 }
 
 @inproceedings{fw-pcm-88
-, author =	"S. Fortune and G. Wilfong"
-, title =	"Planning constrained motion"
-, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
-, year =	1988
-, pages =	"445--459"
-, precedes =	"fw-pcm-91"
-, update =	"98.03 mitchell"
+, author =      "S. Fortune and G. Wilfong"
+, title =       "Planning constrained motion"
+, booktitle =   "Proc. 20th Annu. ACM Sympos. Theory Comput."
+, year =        1988
+, pages =       "445--459"
+, precedes =    "fw-pcm-91"
+, update =      "98.03 mitchell"
 }
 
 @article{fw-pcm-91
-, author =	"S. Fortune and G. Wilfong"
-, title =	"Planning constrained motion"
-, journal =	"Annals of Math. and AI"
-, volume =	3
-, year =	1991
-, pages =	"21--82"
-, succeeds =	"fw-pcm-88"
-, update =	"98.03 mitchell"
+, author =      "S. Fortune and G. Wilfong"
+, title =       "Planning constrained motion"
+, journal =     "Annals of Math. and AI"
+, volume =      3
+, year =        1991
+, pages =       "21--82"
+, succeeds =    "fw-pcm-88"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{fwy-cmtra-86
-, author =	"S. Fortune and G. Wilfong and C. Yap"
-, title =	"Coordinated motion of two robot arms"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1986
-, pages =	"1216--1223"
-, keywords =	"motion planning"
-, update =	"00.03 agarwal"
+, author =      "S. Fortune and G. Wilfong and C. Yap"
+, title =       "Coordinated motion of two robot arms"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1986
+, pages =       "1216--1223"
+, keywords =    "motion planning"
+, update =      "00.03 agarwal"
 }
 
 @techreport{fw-eeacg-92
-, author =	"S. Fortune and C. Van Wyk"
-, title =	"Efficient Exact Arithmetic for Comutational Geometry"
-, type =	"manuscript"
-, year =	1992
-, precedes =	"fv-eeacg-93"
-, update =	"98.11 bibrelex"
+, author =      "S. Fortune and C. Van Wyk"
+, title =       "Efficient Exact Arithmetic for Comutational Geometry"
+, type =        "manuscript"
+, year =        1992
+, precedes =    "fv-eeacg-93"
+, update =      "98.11 bibrelex"
 }
 
 @manual{fw-lnum-93
-, author =	"S. Fortune and C. Van Wyk"
-, title =	"{LN} User Manual"
-, organization =	"AT\&T Bell Laboratories"
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "S. Fortune and C. Van Wyk"
+, title =       "{LN} User Manual"
+, organization =        "AT\&T Bell Laboratories"
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{f-fapct-85
-, author =	"S. J. Fortune"
-, title =	"A fast algorithm for polygon containment by translation"
-, booktitle =	"Proc. 12th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	194
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"189--198"
-, keywords =	"motion planning, Voronoi diagrams, polygons"
+, author =      "S. J. Fortune"
+, title =       "A fast algorithm for polygon containment by translation"
+, booktitle =   "Proc. 12th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      194
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "189--198"
+, keywords =    "motion planning, Voronoi diagrams, polygons"
 }
 
 @techreport{f-nddf-87
-, author =	"S. J. Fortune"
-, title =	"A note on {Delaunay} diagonal flips"
-, type =	"Manuscript"
-, institution =	"AT\&T Bell Lab."
-, address =	"Murray Hill, NJ"
-, year =	1987
+, author =      "S. J. Fortune"
+, title =       "A note on {Delaunay} diagonal flips"
+, type =        "Manuscript"
+, institution = "AT\&T Bell Lab."
+, address =     "Murray Hill, NJ"
+, year =        1987
 }
 
 @article{f-savd-87
-, author =	"S. J. Fortune"
-, title =	"A sweepline algorithm for {Voronoi} diagrams"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"153--174"
-, keywords =	"plane-sweep, geometric transformations, Voronoi diagrams, Delaunay triangulations"
-, succeeds =	"f-savd-86"
+, author =      "S. J. Fortune"
+, title =       "A sweepline algorithm for {Voronoi} diagrams"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "153--174"
+, keywords =    "plane-sweep, geometric transformations, Voronoi diagrams, Delaunay triangulations"
+, succeeds =    "f-savd-86"
 }
 
 @article{fh-nrnna-79
-, author =	"S. J. Fortune and J. E. Hopcroft"
-, title =	"A note on {Rabin}'s nearest-neighbor algorithm"
-, journal =	"Inform. Process. Lett."
-, volume =	8
-, number =	1
-, year =	1979
-, pages =	"20--23"
-, keywords =	"bucketing"
-, update =	"98.11 bibrelex"
+, author =      "S. J. Fortune and J. E. Hopcroft"
+, title =       "A note on {Rabin}'s nearest-neighbor algorithm"
+, journal =     "Inform. Process. Lett."
+, volume =      8
+, number =      1
+, year =        1979
+, pages =       "20--23"
+, keywords =    "bucketing"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{f-iogda-97
-, author =	"Ulrich F{\"o}{\ss}meier"
-, title =	"Interactive Orthogonal Graph Drawing: Algorithms and Bounds"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"111--123"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Ulrich F{\"o}{\ss}meier"
+, title =       "Interactive Orthogonal Graph Drawing: Algorithms and Bounds"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "111--123"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{fhk-iod4a-98
-, author =	"U. F{\"o}{\ss}meier and C. Hess and M. Kaufmann"
-, title =	"On Improving Orthogonal Drawings: The {4M}-Algorithm"
-, editor =	"S. H. Whitesides"
-, booktitle =	"Graph Drawing (Proc. GD~'98)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1547
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"125--137"
-, update =	"99.07 vismara, 99.03 vismara"
+, author =      "U. F{\"o}{\ss}meier and C. Hess and M. Kaufmann"
+, title =       "On Improving Orthogonal Drawings: The {4M}-Algorithm"
+, editor =      "S. H. Whitesides"
+, booktitle =   "Graph Drawing (Proc. GD~'98)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1547
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "125--137"
+, update =      "99.07 vismara, 99.03 vismara"
 }
 
 @inproceedings{fk-aabno-97
-, author =	"Ulrich F{\"o}{\ss}meier and Michael Kaufmann"
-, title =	"Algorithms and Area Bounds for Nonplanar Orthogonal Drawings"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"134--145"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Ulrich F{\"o}{\ss}meier and Michael Kaufmann"
+, title =       "Algorithms and Area Bounds for Nonplanar Orthogonal Drawings"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "134--145"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{fk-dhdgl-96
-, author =	"Ulrich F{\"o}{\ss}meier and Michael Kaufmann"
-, title =	"Drawing High Degree Graphs with Low Bend Numbers"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, nickname =	"GD '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"254--266"
-, keywords =	"graph drawing, planar, orthogonal"
-, update =	"99.03 patrignani+vismara"
+, author =      "Ulrich F{\"o}{\ss}meier and Michael Kaufmann"
+, title =       "Drawing High Degree Graphs with Low Bend Numbers"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, nickname =    "GD '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "254--266"
+, keywords =    "graph drawing, planar, orthogonal"
+, update =      "99.03 patrignani+vismara"
 }
 
 @inproceedings{fk-ndpbg-97
-, author =	"U. F{\"o}ssmeier and M. Kaufmann"
-, title =	"Nice Drawings for Planar Bipartite Graphs"
-, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1203
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	""
-, update =	"00.03 devillers, 98.03 mitchell"
+, author =      "U. F{\"o}ssmeier and M. Kaufmann"
+, title =       "Nice Drawings for Planar Bipartite Graphs"
+, booktitle =   "Algorithms and Complexity (Proc. CIAC' 97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1203
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       ""
+, update =      "00.03 devillers, 98.03 mitchell"
 }
 
 @inproceedings{fk-bmoud-95
-, author =	"U. F{\"o}{\ss}meier and M. Kaufmann"
-, title =	"On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"52--63"
-, keywords =	"graph drawing, planar, orthogonal, upward"
-, update =	"95.01 tamassia"
+, author =      "U. F{\"o}{\ss}meier and M. Kaufmann"
+, title =       "On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "52--63"
+, keywords =    "graph drawing, planar, orthogonal, upward"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{fk-esrsp-97
-, author =	"U. F{\"o}ssmeier and M. Kaufmann"
-, title =	"On Exact Solutions for the Rectilinear {Steiner} Problem"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"436--438"
-, cites =	"a-ptase-96, br-iastp-92, fk-esrsp-96, gc-orsmt-94, gj-rstpi-77, h-sprd-66, h-smtrd-76, hrw-stp-92, kps-stvl-90, l-caicl-90, r-fhars-89, sw-tfprs-95, s-hfsmt-92, z-1aasp-92, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "U. F{\"o}ssmeier and M. Kaufmann"
+, title =       "On Exact Solutions for the Rectilinear {Steiner} Problem"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "436--438"
+, cites =       "a-ptase-96, br-iastp-92, fk-esrsp-96, gc-orsmt-94, gj-rstpi-77, h-sprd-66, h-smtrd-76, hrw-stp-92, kps-stvl-90, l-caicl-90, r-fhars-89, sw-tfprs-95, s-hfsmt-92, z-1aasp-92, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @techreport{fk-esrsp-96
-, author =	"U. F{\"o}ssmeier and M. Kaufmann"
-, title =	"On exact solutions for the rectilinear {Steiner} problem. {Part} {I}: {Theoretical} results"
-, type =	"Technical {Report}"
-, number =	"WSI-96-09"
-, institution =	"Universit{\"a}t T{\"u}bingen"
-, address =	"T{\"u}bingen, Germany"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "U. F{\"o}ssmeier and M. Kaufmann"
+, title =       "On exact solutions for the rectilinear {Steiner} problem. {Part} {I}: {Theoretical} results"
+, type =        "Technical {Report}"
+, number =      "WSI-96-09"
+, institution = "Universit{\"a}t T{\"u}bingen"
+, address =     "T{\"u}bingen, Germany"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{fkz-faars-93
-, author =	"Ulrich F{\"o}{\ss}meier and Michael Kaufmann and Alexander Zelikovsky"
-, title =	"Faster Approximation Algorithms for the Rectilinear {Steiner} Tree Problem"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"533--542"
-, precedes =	"fkz-faars-97"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Ulrich F{\"o}{\ss}meier and Michael Kaufmann and Alexander Zelikovsky"
+, title =       "Faster Approximation Algorithms for the Rectilinear {Steiner} Tree Problem"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "533--542"
+, precedes =    "fkz-faars-97"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @article{fkz-faars-97
-, author =	"Ulrich F{\"o}{\ss}meier and Michael Kaufmann and Alexander Zelikovsky"
-, title =	"Faster Approximation Algorithms for the Rectilinear {Steiner} Tree Problem"
-, journal =	"Discrete Comput. Geom."
-, volume =	18
-, number =	1
-, year =	1997
-, pages =	"93--109"
-, succeeds =	"fkz-faars-93"
-, update =	"98.03 mitchell"
+, author =      "Ulrich F{\"o}{\ss}meier and Michael Kaufmann and Alexander Zelikovsky"
+, title =       "Faster Approximation Algorithms for the Rectilinear {Steiner} Tree Problem"
+, journal =     "Discrete Comput. Geom."
+, volume =      18
+, number =      1
+, year =        1997
+, pages =       "93--109"
+, succeeds =    "fkz-faars-93"
+, update =      "98.03 mitchell"
 }
 
 @book{f-gm2ag-82
-, author =	"L. W. Foster"
-, title =	"GEO-METRICS {II}: {The} application of geometric tolerancing techniques"
-, publisher =	"Addison-Wesley"
-, year =	1982
-, update =	"98.07 bibrelex"
+, author =      "L. W. Foster"
+, title =       "GEO-METRICS {II}: {The} application of geometric tolerancing techniques"
+, publisher =   "Addison-Wesley"
+, year =        1982
+, update =      "98.07 bibrelex"
 }
 
 @book{fr-sag-94
-, author =	"S. Fotheringham and P. Rogerson"
-, title =	"Spatial analysis and {GIS}"
-, publisher =	"Taylor \& Francis"
-, address =	"Bristol, PA"
-, year =	1994
-, update =	"96.09 orourke"
+, author =      "S. Fotheringham and P. Rogerson"
+, title =       "Spatial analysis and {GIS}"
+, publisher =   "Taylor \& Francis"
+, address =     "Bristol, PA"
+, year =        1994
+, update =      "96.09 orourke"
 }
 
 @article{fgg-gthfl-85
-, author =	"L. R. Foulds and P. B. Gibbons and J. W. Giffin"
-, title =	"Graph Theoretic Heuristics for the Facilities Layout Problem: An Experimental Comparison"
-, journal =	"Oper. Res."
-, volume =	"??"
-, year =	1985
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "L. R. Foulds and P. B. Gibbons and J. W. Giffin"
+, title =       "Graph Theoretic Heuristics for the Facilities Layout Problem: An Experimental Comparison"
+, journal =     "Oper. Res."
+, volume =      "??"
+, year =        1985
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{fhp-gtadm-79
-, author =	"L. R. Foulds and M. D. Hendy and D. Penny"
-, title =	"A graph theoretic approach to the development of minimal phylogenetic trees"
-, journal =	"J. Mol. Evol."
-, volume =	13
-, year =	1979
-, pages =	"127--149"
-, update =	"97.11 bibrelex"
+, author =      "L. R. Foulds and M. D. Hendy and D. Penny"
+, title =       "A graph theoretic approach to the development of minimal phylogenetic trees"
+, journal =     "J. Mol. Evol."
+, volume =      13
+, year =        1979
+, pages =       "127--149"
+, update =      "97.11 bibrelex"
 }
 
 %   what is this??  L.R.I. UA410 CNRS
 @techreport{ffgs-ucasb-87
-, author =	"J. M. Fourneau and I. Fournier and A. Germa and D. Sotteau"
-, title =	"Unicorn: {A} Computer-Aided Scratch Book for Graph Theory"
-, number =	381
-, institution =	"Univ. Paris Sud"
-, year =	1987
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. M. Fourneau and I. Fournier and A. Germa and D. Sotteau"
+, title =       "Unicorn: {A} Computer-Aided Scratch Book for Graph Theory"
+, number =      381
+, institution = "Univ. Paris Sud"
+, year =        1987
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{f-cchfs-79
-, author =	"A. Fournier"
-, title =	"Comments on convex hull of a finite set of points in two dimensions"
-, journal =	"Inform. Process. Lett."
-, volume =	8
-, year =	1979
-, pages =	173
+, author =      "A. Fournier"
+, title =       "Comments on convex hull of a finite set of points in two dimensions"
+, journal =     "Inform. Process. Lett."
+, volume =      8
+, year =        1979
+, pages =       173
 }
 
 @article{ffc-crsm-82
-, author =	"A. Fournier and D. Fussell and L. Carpenter"
-, title =	"Computer rendering of stochastic models"
-, journal =	"Commun. ACM"
-, volume =	25
-, number =	6
-, year =	1982
-, pages =	"371--384"
+, author =      "A. Fournier and D. Fussell and L. Carpenter"
+, title =       "Computer rendering of stochastic models"
+, journal =     "Commun. ACM"
+, volume =      25
+, number =      6
+, year =        1982
+, pages =       "371--384"
 }
 
 @article{fk-cannp-79
-, author =	"A. Fournier and Z. M. Kedem"
-, title =	"Comments on the all nearest-neighbor problem for convex polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	9
-, year =	1979
-, pages =	"105--107"
+, author =      "A. Fournier and Z. M. Kedem"
+, title =       "Comments on the all nearest-neighbor problem for convex polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      9
+, year =        1979
+, pages =       "105--107"
 }
 
 @article{fm-tspep-84
-, author =	"A. Fournier and D. Y. Montuno"
-, title =	"Triangulating simple polygons and equivalent problems"
-, journal =	"ACM Trans. Graph."
-, volume =	3
-, number =	2
-, year =	1984
-, pages =	"153--174"
+, author =      "A. Fournier and D. Y. Montuno"
+, title =       "Triangulating simple polygons and equivalent problems"
+, journal =     "ACM Trans. Graph."
+, volume =      3
+, number =      2
+, year =        1984
+, pages =       "153--174"
 }
 
 @article{fw-bpo-83
-, author =	"A. Fournier and M. A. Wesley"
-, title =	"Bending polyhedral objects"
-, journal =	"Comput. Aided Design"
-, volume =	15
-, number =	2
-, year =	1983
-, pages =	"79--87"
-, note =	"Proc. 6th IFIP Internat. Sympos. Comput. Hardware"
-, update =	"97.11 bibrelex"
+, author =      "A. Fournier and M. A. Wesley"
+, title =       "Bending polyhedral objects"
+, journal =     "Comput. Aided Design"
+, volume =      15
+, number =      2
+, year =        1983
+, pages =       "79--87"
+, note =        "Proc. 6th IFIP Internat. Sympos. Comput. Hardware"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{fk-rvdb-87
-, author =	"D. R. Fowler and J. M. Keil"
-, title =	"The rectilinear {Voronoi} diagram with barriers"
-, booktitle =	"Proc. 25th Allerton Conf. Commun. Control Comput."
-, year =	1987
-, pages =	"889--897"
-, keywords =	"Voronoi diagrams"
+, author =      "D. R. Fowler and J. M. Keil"
+, title =       "The rectilinear {Voronoi} diagram with barriers"
+, booktitle =   "Proc. 25th Allerton Conf. Commun. Control Comput."
+, year =        1987
+, pages =       "889--897"
+, keywords =    "Voronoi diagrams"
 }
 
 @article{f-egavp-83
-, author =	"G. Fowler"
-, title =	"Efficient Graph Automorphism by Vertex Partitioning"
-, journal =	"Artif. Intell."
-, volume =	21
-, year =	1983
-, pages =	"245--269"
-, update =	"97.11 bibrelex"
+, author =      "G. Fowler"
+, title =       "Efficient Graph Automorphism by Vertex Partitioning"
+, journal =     "Artif. Intell."
+, volume =      21
+, year =        1983
+, pages =       "245--269"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{fps-mgemc-95
-, author =	"P. W. Fowler and T. Pisanski and J. Shawe-Taylor"
-, title =	"Molecular Graph Eigenvectors for Molecular Coordinates"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"282--285"
-, keywords =	"graph drawing, system, 3D, force-directed"
-, update =	"95.01 tamassia"
+, author =      "P. W. Fowler and T. Pisanski and J. Shawe-Taylor"
+, title =       "Molecular Graph Eigenvectors for Molecular Coordinates"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "282--285"
+, keywords =    "graph drawing, system, 3D, force-directed"
+, update =      "95.01 tamassia"
 }
 
 @techreport{f-dpicd-??
-, author =	"R. J. Fowler"
-, title =	"Deltri: a program for inductively computing {Delaunay} triangulations"
-, type =	"Technical {Report}"
-, number =	18
-, institution =	"Data Struct. Project, Dept. Geog., Simon Fraser Univ."
-, address =	"Burnaby, BC"
-, year =	"??"
+, author =      "R. J. Fowler"
+, title =       "Deltri: a program for inductively computing {Delaunay} triangulations"
+, type =        "Technical {Report}"
+, number =      18
+, institution = "Data Struct. Project, Dept. Geog., Simon Fraser Univ."
+, address =     "Burnaby, BC"
+, year =        "??"
 }
 
 @article{fl-aeind-79
-, author =	"R. J. Fowler and J. J. Little"
-, title =	"Automatic Extraction of Irregular Network Digital Terrain Models"
-, journal =	"Comput. Graph."
-, volume =	13
-, number =	2
-, month =	aug
-, year =	1979
-, pages =	"199--207"
-, update =	"96.09 devillers"
-, annote =	"Builds a triangulation to represent the surface from
-		 dense raster model. Uses incremental Delaunay
-		 triangulation."
+, author =      "R. J. Fowler and J. J. Little"
+, title =       "Automatic Extraction of Irregular Network Digital Terrain Models"
+, journal =     "Comput. Graph."
+, volume =      13
+, number =      2
+, month =       aug
+, year =        1979
+, pages =       "199--207"
+, update =      "96.09 devillers"
+, annote =      "Builds a triangulation to represent the surface from
+                 dense raster model. Uses incremental Delaunay
+                 triangulation."
 }
 
 @article{fpt-opcpa-81
-, author =	"R. J. Fowler and M. S. Paterson and S. L. Tanimoto"
-, title =	"Optimal packing and covering in the plane are {NP}-complete"
-, journal =	"Inform. Process. Lett."
-, volume =	12
-, number =	3
-, year =	1981
-, pages =	"133--137"
+, author =      "R. J. Fowler and M. S. Paterson and S. L. Tanimoto"
+, title =       "Optimal packing and covering in the plane are {NP}-complete"
+, journal =     "Inform. Process. Lett."
+, volume =      12
+, number =      3
+, year =        1981
+, pages =       "133--137"
 }
 
 @article{d-fcpmp-00
-, author =	"P. Di Francesco"
-, title =	"Folding and coloring problems in mathematics and physics"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	37
-, number =	3
-, month =	jul
-, year =	2000
-, pages =	"251--307"
-, update =	"00.11 smid, 00.07 orourke"
+, author =      "P. Di Francesco"
+, title =       "Folding and coloring problems in mathematics and physics"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      37
+, number =      3
+, month =       jul
+, year =        2000
+, pages =       "251--307"
+, update =      "00.11 smid, 00.07 orourke"
 }
 
 @phdthesis{f-asdh-94
-, author =	"P. G. Franciosa"
-, title =	"Adaptive spatial data handling"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dipartimento di Informatica e Sistemistica, Univ. of Rome ``La Sapienza''"
-, address =	"Rome, Italy"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"94.05 franciosa"
+, author =      "P. G. Franciosa"
+, title =       "Adaptive spatial data handling"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dipartimento di Informatica e Sistemistica, Univ. of Rome ``La Sapienza''"
+, address =     "Rome, Italy"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "94.05 franciosa"
 }
 
 @article{fggt-chapa-94
-, author =	"P. G. Franciosa and C. Gaibisso and G. Gambosi and M. Talamo"
-, title =	"A convex hull algorithm for points with approximately known positions"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, number =	2
-, year =	1994
-, pages =	"153--163"
-, update =	"95.01 franciosa"
+, author =      "P. G. Franciosa and C. Gaibisso and G. Gambosi and M. Talamo"
+, title =       "A convex hull algorithm for points with approximately known positions"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, number =      2
+, year =        1994
+, pages =       "153--163"
+, update =      "95.01 franciosa"
 }
 
 @techreport{fgt-assdh-93
-, author =	"P. G. Franciosa and C. Gaibisso and M. Talamo"
-, title =	"Adaptive strategies for spatial data handling: an application to the maxima problem"
-, type =	""
-, number =	"RAP.10.93"
-, institution =	"Universit{\`a} di Roma ``La Sapienza''"
-, address =	"Dipartimento di Informatica e Sistemistica"
-, month =	oct
-, year =	1993
-, update =	"94.05 franciosa"
+, author =      "P. G. Franciosa and C. Gaibisso and M. Talamo"
+, title =       "Adaptive strategies for spatial data handling: an application to the maxima problem"
+, type =        ""
+, number =      "RAP.10.93"
+, institution = "Universit{\`a} di Roma ``La Sapienza''"
+, address =     "Dipartimento di Informatica e Sistemistica"
+, month =       oct
+, year =        1993
+, update =      "94.05 franciosa"
 }
 
 @techreport{fgt-olcha-92
-, author =	"P. G. Franciosa and C. Gaibisso and M. Talamo"
-, title =	"An on-line convex hull algorithm on reals"
-, type =	"Report"
-, number =	"R. 301"
-, institution =	"Istituto di Analisi dei Sistemi ed Informatica"
-, address =	"Rome, Italy"
-, year =	1992
-, update =	"94.05 franciosa"
+, author =      "P. G. Franciosa and C. Gaibisso and M. Talamo"
+, title =       "An on-line convex hull algorithm on reals"
+, type =        "Report"
+, number =      "R. 301"
+, institution = "Istituto di Analisi dei Sistemi ed Informatica"
+, address =     "Rome, Italy"
+, year =        1992
+, update =      "94.05 franciosa"
 }
 
 @inproceedings{fgt-oamsp-92
-, author =	"Paolo Giulio Franciosa and Carlo Gaibisso and Maurizio Talamo"
-, title =	"An Optimal Algorithm for the Maxima Set Problem for Data in Motion"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"17--21"
-, update =	"00.03 bibrelex"
+, author =      "Paolo Giulio Franciosa and Carlo Gaibisso and Maurizio Talamo"
+, title =       "An Optimal Algorithm for the Maxima Set Problem for Data in Motion"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "17--21"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{ft-oksfh-94
-, author =	"P. G. Franciosa and M. Talamo"
-, title =	"Orders, $k$-sets and fast halfplane search on paged memory"
-, booktitle =	"Proc. Workshop on Orders, Algorithms and Applications"
-, nickname =	"ORDAL '94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	831
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"117--127"
-, update =	"98.07 bibrelex, 94.09 franciosa, 94.05 franciosa"
-, abstract =	"We investigate the properties of the poset defined by
+, author =      "P. G. Franciosa and M. Talamo"
+, title =       "Orders, $k$-sets and fast halfplane search on paged memory"
+, booktitle =   "Proc. Workshop on Orders, Algorithms and Applications"
+, nickname =    "ORDAL '94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      831
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "117--127"
+, update =      "98.07 bibrelex, 94.09 franciosa, 94.05 franciosa"
+, abstract =    "We investigate the properties of the poset defined by
 the set inclusion relation on the set of possible answers to an
 halfplane search problem.  We use these properties to design a
 static data structure for $n$ points stored in pages of size $b$
@@ -60299,6908 +60299,6908 @@ @inproceedings{ft-oksfh-94
 }
 
 @article{f-nolnm-61
-, author =	"R. Francis"
-, title =	"A note on the optimum location of new machines"
-, journal =	"J. Indust. Eng."
-, volume =	12
-, year =	1961
-, pages =	"41--47"
-, update =	"98.03 bibrelex"
+, author =      "R. Francis"
+, title =       "A note on the optimum location of new machines"
+, journal =     "J. Indust. Eng."
+, volume =      12
+, year =        1961
+, pages =       "41--47"
+, update =      "98.03 bibrelex"
 }
 
 @article{f-samlp-67
-, author =	"R. Francis"
-, title =	"Some aspects of minimax location problem"
-, journal =	"Oper. Res."
-, volume =	15
-, year =	1967
-, pages =	"1163--1168"
-, update =	"98.03 bibrelex"
+, author =      "R. Francis"
+, title =       "Some aspects of minimax location problem"
+, journal =     "Oper. Res."
+, volume =      15
+, year =        1967
+, pages =       "1163--1168"
+, update =      "98.03 bibrelex"
 }
 
 @book{fw-fll-74
-, author =	"R. L. Francis and J. A. White"
-, title =	"Facility Layout and Location"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1974
-, keywords =	"book"
+, author =      "R. L. Francis and J. A. White"
+, title =       "Facility Layout and Location"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1974
+, keywords =    "book"
 }
 
 @article{fp-ppepq-92
-, author =	"R. S. Francis and L. J. H. Pannan"
-, title =	"A parallel partition for enhanced parallel quicksort"
-, journal =	"Parallel Comput."
-, volume =	18
-, year =	1992
-, pages =	"543--550"
-, update =	"96.09 orourke"
+, author =      "R. S. Francis and L. J. H. Pannan"
+, title =       "A parallel partition for enhanced parallel quicksort"
+, journal =     "Parallel Comput."
+, volume =      18
+, year =        1992
+, pages =       "543--550"
+, update =      "96.09 orourke"
 }
 
 @incollection{f-on4ac-83
-, author =	"A. Frank"
-, title =	"An $O(n^4)$ algorithm to construct all {Voronoi} diagrams for $k$ nearest neighbor searching"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	154
-, publisher =	"Springer-Verlag"
-, year =	1983
-, pages =	"160--172"
-, keywords =	"Voronoi diagram"
-, update =	"96.05 agarwal, 95.09 korneenko"
+, author =      "A. Frank"
+, title =       "An $O(n^4)$ algorithm to construct all {Voronoi} diagrams for $k$ nearest neighbor searching"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      154
+, publisher =   "Springer-Verlag"
+, year =        1983
+, pages =       "160--172"
+, keywords =    "Voronoi diagram"
+, update =      "96.05 agarwal, 95.09 korneenko"
 }
 
 @article{f-dprg-82
-, author =	"A. Frank"
-, title =	"Disjoint paths in a rectilinear grid"
-, journal =	"Combinatorica"
-, volume =	2
-, number =	4
-, year =	1982
-, pages =	"361--371"
-, keywords =	"graphs, paths"
-, update =	"95.09 korneenko"
+, author =      "A. Frank"
+, title =       "Disjoint paths in a rectilinear grid"
+, journal =     "Combinatorica"
+, volume =      2
+, number =      4
+, year =        1982
+, pages =       "361--371"
+, keywords =    "graphs, paths"
+, update =      "95.09 korneenko"
 }
 
 @article{f-edppg-85
-, author =	"A. Frank"
-, title =	"Edge-disjoint paths in planar graphs"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	39
-, year =	1985
-, pages =	"164--178"
-, keywords =	"graphs, paths"
-, update =	"95.09 korneenko"
+, author =      "A. Frank"
+, title =       "Edge-disjoint paths in planar graphs"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      39
+, year =        1985
+, pages =       "164--178"
+, keywords =    "graphs, paths"
+, update =      "95.09 korneenko"
 }
 
 @article{f-hmdsc-81
-, author =	"A. Frank"
-, title =	"How to Make a Digraph Strongly Connected"
-, journal =	"Combinatorica"
-, volume =	1
-, number =	2
-, year =	1981
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "A. Frank"
+, title =       "How to Make a Digraph Strongly Connected"
+, journal =     "Combinatorica"
+, volume =      1
+, number =      2
+, year =        1981
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @incollection{f-pgdrs-91
-, author =	"A. Frank"
-, title =	"Properties of geographic data: requirement for spatial access methods"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	525
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"225--234"
-, update =	"96.05 agarwal, 95.09 korneenko"
+, author =      "A. Frank"
+, title =       "Properties of geographic data: requirement for spatial access methods"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      525
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "225--234"
+, update =      "96.05 agarwal, 95.09 korneenko"
 }
 
 @inproceedings{fhkk-rgosi-96
-, author =	"Andrew Frank and Peter Haunold and Werner Kuhn and Gabriel Kuper"
-, title =	"Representation of Geometric Objects as Set of Inequalities"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"51--56"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Andrew Frank and Peter Haunold and Werner Kuhn and Gabriel Kuper"
+, title =       "Representation of Geometric Objects as Set of Inequalities"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "51--56"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{fk-cgpcm-86
-, author =	"A. U. Frank and W. Kuhn"
-, title =	"Cell {Graphs}: a provable correct method for the storage of geometry"
-, booktitle =	"Proc. 2nd Internat. Sympos. Spatial Data Handling"
-, site =	"Seattle, WA"
-, year =	1986
-, pages =	"??"
+, author =      "A. U. Frank and W. Kuhn"
+, title =       "Cell {Graphs}: a provable correct method for the storage of geometry"
+, booktitle =   "Proc. 2nd Internat. Sympos. Spatial Data Handling"
+, site =        "Seattle, WA"
+, year =        1986
+, pages =       "??"
 }
 
 @article{f-sditm-82
-, author =	"R. Franke"
-, title =	"Scattered data interpolation: tests of some methods"
-, journal =	"Math. Comput."
-, volume =	38
-, year =	1982
-, pages =	"181--200"
-, update =	"98.07 bibrelex"
+, author =      "R. Franke"
+, title =       "Scattered data interpolation: tests of some methods"
+, journal =     "Math. Comput."
+, volume =      38
+, year =        1982
+, pages =       "181--200"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{fn-silss-79
-, author =	"R. Franke and G. Nielson"
-, title =	"Smooth interpolation of large sets of scattered data"
-, type =	"Report"
-, number =	"NPS-53-79-005"
-, institution =	"Naval Postgraduate School"
-, address =	"Monterey, CA"
-, year =	1979
+, author =      "R. Franke and G. Nielson"
+, title =       "Smooth interpolation of large sets of scattered data"
+, type =        "Report"
+, number =      "NPS-53-79-005"
+, institution = "Naval Postgraduate School"
+, address =     "Monterey, CA"
+, year =        1979
 }
 
 @article{fm-cdg-88
-, author =	"P. Frankl and H. Maehara"
-, title =	"On the contact dimensions of graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"89--96"
+, author =      "P. Frankl and H. Maehara"
+, title =       "On the contact dimensions of graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "89--96"
 }
 
 @article{fm-sgabd-90
-, author =	"P. Frankl and H. Maehara"
-, title =	"Some geometric applications of the beta distribution"
-, journal =	"Ann. Inst. Stat. Math"
-, volume =	42
-, year =	1990
-, pages =	"463--474"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "P. Frankl and H. Maehara"
+, title =       "Some geometric applications of the beta distribution"
+, journal =     "Ann. Inst. Stat. Math"
+, volume =      42
+, year =        1990
+, pages =       "463--474"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @article{fm-jllss-88
-, author =	"P. Frankl and H. Maehara"
-, title =	"The {Johnson-Lindenstrauss} lemmas and the sphericity of some graphs"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	44
-, year =	1988
-, pages =	"355--362"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "P. Frankl and H. Maehara"
+, title =       "The {Johnson-Lindenstrauss} lemmas and the sphericity of some graphs"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      44
+, year =        1988
+, pages =       "355--362"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @article{fr-hdnj-84
-, author =	"P. Frankl and V. R{\"o}dl"
-, title =	"Hypergraphs do not jump"
-, journal =	"Combinatorica"
-, volume =	4
-, year =	1984
-, pages =	"149--159"
-, update =	"98.03 bibrelex"
+, author =      "P. Frankl and V. R{\"o}dl"
+, title =       "Hypergraphs do not jump"
+, journal =     "Combinatorica"
+, volume =      4
+, year =        1984
+, pages =       "149--159"
+, update =      "98.03 bibrelex"
 }
 
 @article{f-ltehs-80
-, author =	"W. R. Franklin"
-, title =	"A linear time exact hidden surface algorithm"
-, journal =	"Comput. Graph."
-, volume =	14
-, number =	3
-, year =	1980
-, pages =	"117--123"
-, note =	"Proc. SIGGRAPH '80"
-, keywords =	"computer graphics, hidden line/surface elimination"
-, precedes =	"f-ltehs-88"
-, update =	"93.09 franklin"
+, author =      "W. R. Franklin"
+, title =       "A linear time exact hidden surface algorithm"
+, journal =     "Comput. Graph."
+, volume =      14
+, number =      3
+, year =        1980
+, pages =       "117--123"
+, note =        "Proc. SIGGRAPH '80"
+, keywords =    "computer graphics, hidden line/surface elimination"
+, precedes =    "f-ltehs-88"
+, update =      "93.09 franklin"
 }
 
 % ### others?
 @incollection{f-ltehs-88
-, author =	"W. R. Franklin"
-, title =	"A linear time exact hidden surface algorithm"
-, editor =	"Kenneth I. Joy and others"
-, booktitle =	"Tutorial: Computer Graphics: Image Synthesis"
-, publisher =	""
-, year =	1988
-, pages =	"218--224"
-, keywords =	"computer graphics, hidden line/surface elimination"
-, succeeds =	"f-ltehs-80"
-, precedes =	"f-ehsat-81"
-, update =	"93.09 franklin"
+, author =      "W. R. Franklin"
+, title =       "A linear time exact hidden surface algorithm"
+, editor =      "Kenneth I. Joy and others"
+, booktitle =   "Tutorial: Computer Graphics: Image Synthesis"
+, publisher =   ""
+, year =        1988
+, pages =       "218--224"
+, keywords =    "computer graphics, hidden line/surface elimination"
+, succeeds =    "f-ltehs-80"
+, precedes =    "f-ehsat-81"
+, update =      "93.09 franklin"
 }
 
 @article{f-ehsat-81
-, author =	"W. R. Franklin"
-, title =	"An exact hidden sphere algorithm that operates in linear time"
-, journal =	"Comput. Graph. Image Process."
-, volume =	15
-, year =	1981
-, pages =	"364--379"
-, keywords =	"computer graphics, hidden line/surface elimination"
-, succeeds =	"f-ltehs-80"
-, update =	"93.09 franklin"
+, author =      "W. R. Franklin"
+, title =       "An exact hidden sphere algorithm that operates in linear time"
+, journal =     "Comput. Graph. Image Process."
+, volume =      15
+, year =        1981
+, pages =       "364--379"
+, keywords =    "computer graphics, hidden line/surface elimination"
+, succeeds =    "f-ltehs-80"
+, update =      "93.09 franklin"
 }
 
 @techreport{f-chsa-78
-, author =	"W. R. Franklin"
-, title =	"Combinatorics of hidden surface algorithms"
-, type =	"Technical {Report}"
-, number =	"TR-12-78"
-, institution =	"Center Res. Comput., Harvard Univ."
-, address =	"Cambridge, MA"
-, year =	1978
-, keywords =	"computer graphics, hidden line/surface elimination"
-, comments =	"Thesis w/o appendices available as a TR from CRCT.
+, author =      "W. R. Franklin"
+, title =       "Combinatorics of hidden surface algorithms"
+, type =        "Technical {Report}"
+, number =      "TR-12-78"
+, institution = "Center Res. Comput., Harvard Univ."
+, address =     "Cambridge, MA"
+, year =        1978
+, keywords =    "computer graphics, hidden line/surface elimination"
+, comments =    "Thesis w/o appendices available as a TR from CRCT.
 Complete thesis available only on microfilm from Harvard, since Harvard did not then subscribe to UMI."
-, update =	"93.09 franklin"
+, update =      "93.09 franklin"
 }
 
 @techreport{f-lporh-78
-, author =	"W. R. Franklin"
-, title =	"Locating a point in overlapping regions of hyperspace"
-, type =	"Report"
-, number =	"CRL-64"
-, institution =	"ECSE Dept. Rensselaer Polytech. Inst."
-, address =	"Troy, NY"
-, year =	1978
-, keywords =	"point location"
-, update =	"93.09 franklin"
+, author =      "W. R. Franklin"
+, title =       "Locating a point in overlapping regions of hyperspace"
+, type =        "Report"
+, number =      "CRL-64"
+, institution = "ECSE Dept. Rensselaer Polytech. Inst."
+, address =     "Troy, NY"
+, year =        1978
+, keywords =    "point location"
+, update =      "93.09 franklin"
 }
 
 @inproceedings{f-ppcvn-87
-, author =	"W. R. Franklin"
-, title =	"Polygon properties calculated from the vertex neighborhoods"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"110--118"
-, keywords =	"rays, measure, polygons"
-, cites =	"b-mrsdh-, cb-accwf-86, ey-eafui-72, f-epiu-82, f-rnrpp-83, gs-pmgsc-83, ms-gsmeo-82, m-nmseo-84, w-tsgm-86, w-nmpo-77, ZZZ"
-, update =	"98.03 bibrelex, 93.09 franklin"
+, author =      "W. R. Franklin"
+, title =       "Polygon properties calculated from the vertex neighborhoods"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "110--118"
+, keywords =    "rays, measure, polygons"
+, cites =       "b-mrsdh-, cb-accwf-86, ey-eafui-72, f-epiu-82, f-rnrpp-83, gs-pmgsc-83, ms-gsmeo-82, m-nmseo-84, w-tsgm-86, w-nmpo-77, ZZZ"
+, update =      "98.03 bibrelex, 93.09 franklin"
 }
 
 @inproceedings{fa-wcusp-87
-, author =	"W. R. Franklin and V. Akman"
-, title =	"A workbench to compute unobstructed shortest paths in three-space"
-, booktitle =	"Proc. 1st Internat. Conf. Indust. Applied Math."
-, site =	"Paris, France"
-, year =	1987
-, pages =	"1--38"
-, keywords =	"motion planning"
-, update =	"93.09 franklin"
+, author =      "W. R. Franklin and V. Akman"
+, title =       "A workbench to compute unobstructed shortest paths in three-space"
+, booktitle =   "Proc. 1st Internat. Conf. Indust. Applied Math."
+, site =        "Paris, France"
+, year =        1987
+, pages =       "1--38"
+, keywords =    "motion planning"
+, update =      "93.09 franklin"
 }
 
 @article{fav-vdbpm-85
-, author =	"W. Randolph Franklin and Varol Akman and Colin Verrilli"
-, title =	"Voronoi diagrams with barriers and on polyhedra for minimal path planning"
-, journal =	"Visual Comput."
-, volume =	1
-, number =	2
-, month =	oct
-, year =	1985
-, pages =	"133--150"
-, keywords =	"robotics, planar partitions, motion planning, Voronoi diagrams"
-, update =	"93.09 franklin"
+, author =      "W. Randolph Franklin and Varol Akman and Colin Verrilli"
+, title =       "Voronoi diagrams with barriers and on polyhedra for minimal path planning"
+, journal =     "Visual Comput."
+, volume =      1
+, number =      2
+, month =       oct
+, year =        1985
+, pages =       "133--150"
+, keywords =    "robotics, planar partitions, motion planning, Voronoi diagrams"
+, update =      "93.09 franklin"
 }
 
 @inproceedings{f-3dgdu-81
-, author =	"Wm. Randolph Franklin"
-, title =	"3-{D} Geometric Databases Using Hierarchies of Inscribing Boxes"
-, booktitle =	"Proceedings of the 7th Canadian Man-Computer Conference"
-, site =	"Waterloo, Ontario, Canada"
-, month =	jun
-, year =	1981
-, pages =	"173--180"
-, keywords =	"computer graphics, CAD"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "3-{D} Geometric Databases Using Hierarchies of Inscribing Boxes"
+, booktitle =   "Proceedings of the 7th Canadian Man-Computer Conference"
+, site =        "Waterloo, Ontario, Canada"
+, month =       jun
+, year =        1981
+, pages =       "173--180"
+, keywords =    "computer graphics, CAD"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @inproceedings{f-smoa-83
-, author =	"Wm. Randolph Franklin"
-, title =	"A Simplified Map Overlay Algorithm"
-, booktitle =	"Harvard Computer Graphics Conference"
-, site =	"Cambridge, Mass, USA"
-, month =	jul
-, year =	1983
-, keywords =	"intersection"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "A Simplified Map Overlay Algorithm"
+, booktitle =   "Harvard Computer Graphics Conference"
+, site =        "Cambridge, Mass, USA"
+, month =       jul
+, year =        1983
+, keywords =    "intersection"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @inproceedings{f-aggo-83
-, author =	"Wm. Randolph Franklin"
-, title =	"Adaptive Grids for geometric operations"
-, booktitle =	"Proc. 6th International Symposium on Automated Cartography"
-, site =	"Ottawa"
-, year =	1983
-, pages =	"230--239"
-, keywords =	"intersection, grids"
-, precedes =	"f-aggo-84"
-, update =	"97.11 bibrelex, 93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Adaptive Grids for geometric operations"
+, booktitle =   "Proc. 6th International Symposium on Automated Cartography"
+, site =        "Ottawa"
+, year =        1983
+, pages =       "230--239"
+, keywords =    "intersection, grids"
+, precedes =    "f-aggo-84"
+, update =      "97.11 bibrelex, 93.09 franklin"
 }
 
 @article{f-aggo-84
-, author =	"Wm. Randolph Franklin"
-, title =	"Adaptive Grids for geometric operations"
-, journal =	"Cartographica"
-, volume =	21
-, number =	"2--3"
-, year =	1984
-, pages =	"161--167"
-, note =	"monograph 32--33"
-, keywords =	"intersection, grids"
-, succeeds =	"f-aggo-83"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Adaptive Grids for geometric operations"
+, journal =     "Cartographica"
+, volume =      21
+, number =      "2--3"
+, year =        1984
+, pages =       "161--167"
+, note =        "monograph 32--33"
+, keywords =    "intersection, grids"
+, succeeds =    "f-aggo-83"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @inproceedings{f-cmopa-90
-, author =	"Wm. Randolph Franklin"
-, title =	"Calculating Map Overlay Polygon Areas Without Explicitly Calculating the Polygons --- Implementation"
-, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
-, site =	"Z{\"u}rich"
-, month =	jul
-, year =	1990
-, pages =	"151--160"
-, keywords =	"intersection, area, grids, measure, polygons"
-, precedes =	"fsskn-ofmop-93"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Calculating Map Overlay Polygon Areas Without Explicitly Calculating the Polygons --- Implementation"
+, booktitle =   "Proc. 4th Internat. Sympos. Spatial Data Handling"
+, site =        "Z{\"u}rich"
+, month =       jul
+, year =        1990
+, pages =       "151--160"
+, keywords =    "intersection, area, grids, measure, polygons"
+, precedes =    "fsskn-ofmop-93"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @inproceedings{f-cesua-84
-, author =	"Wm. Randolph Franklin"
-, title =	"Cartographic Errors Symptomatic of Underlying Algebra Problems"
-, booktitle =	"Proc. Internat. Sympos. Spatial Data Handling"
-, site =	"Z{\"u}rich"
-, volume =	1
-, month =	aug
-, year =	1984
-, pages =	"190--208"
-, keywords =	"robustness"
-, update =	"00.11 smid, 00.07 icking, 95.09 korneenko, 93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Cartographic Errors Symptomatic of Underlying Algebra Problems"
+, booktitle =   "Proc. Internat. Sympos. Spatial Data Handling"
+, site =        "Z{\"u}rich"
+, volume =      1
+, month =       aug
+, year =        1984
+, pages =       "190--208"
+, keywords =    "robustness"
+, update =      "00.11 smid, 00.07 icking, 95.09 korneenko, 93.09 franklin"
 }
 
 @incollection{f-cgprolog-85
-, author =	"Wm. Randolph Franklin"
-, title =	"Computational Geometry in {Prolog}"
-, booktitle =	"Proceedings of the NATO Advanced Study Institute on Fundamental Algorithms for Computer Graphics"
-, series =	"NATO ASI Series F"
-, volume =	17
-, publisher =	"Springer-Verlag"
-, address =	"Ilkley, Yorkshire, England"
-, month =	mar
-, year =	1985
-, pages =	"737--749"
-, keywords =	"artificial intelligence"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Computational Geometry in {Prolog}"
+, booktitle =   "Proceedings of the NATO Advanced Study Institute on Fundamental Algorithms for Computer Graphics"
+, series =      "NATO ASI Series F"
+, volume =      17
+, publisher =   "Springer-Verlag"
+, address =     "Ilkley, Yorkshire, England"
+, month =       mar
+, year =        1985
+, pages =       "737--749"
+, keywords =    "artificial intelligence"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @incollection{f-cslld-91
-, author =	"Wm. Randolph Franklin"
-, title =	"Computer Systems and Low Level Data Structures for {GIS}"
-, editor =	"David Maguire and David Rhind and Mike Goodchild"
-, booktitle =	"GIS: Principles and Practice"
-, volume =	1
-, publisher =	"Longman Higher Education and Reference"
-, address =	"London UK"
-, year =	1991
-, pages =	"215--225"
-, keywords =	"tutorial"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Computer Systems and Low Level Data Structures for {GIS}"
+, editor =      "David Maguire and David Rhind and Mike Goodchild"
+, booktitle =   "GIS: Principles and Practice"
+, volume =      1
+, publisher =   "Longman Higher Education and Reference"
+, address =     "London UK"
+, year =        1991
+, pages =       "215--225"
+, keywords =    "tutorial"
+, update =      "93.09 franklin"
 }
 
 @inproceedings{f-eicld-89
-, author =	"Wm. Randolph Franklin"
-, title =	"Efficient Intersection Calculations in Large Databases"
-, booktitle =	"International Cartographic Association 14th World Conference"
-, site =	"Budapest"
-, month =	aug
-, year =	1989
-, pages =	"A62 -- A63"
-, keywords =	"intersection, grids"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Efficient Intersection Calculations in Large Databases"
+, booktitle =   "International Cartographic Association 14th World Conference"
+, site =        "Budapest"
+, month =       aug
+, year =        1989
+, pages =       "A62 -- A63"
+, keywords =    "intersection, grids"
+, update =      "93.09 franklin"
 }
 
 @inproceedings{f-epiu-82
-, author =	"Wm. Randolph Franklin"
-, title =	"Efficient polyhedron intersection and union"
-, booktitle =	"Proc. Graphics Interface"
-, site =	"Toronto"
-, year =	1982
-, pages =	"73--80"
-, keywords =	"intersection, CAD"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Efficient polyhedron intersection and union"
+, booktitle =   "Proc. Graphics Interface"
+, site =        "Toronto"
+, year =        1982
+, pages =       "73--80"
+, keywords =    "intersection, CAD"
+, update =      "93.09 franklin"
 }
 
 @article{f-ero-83
-, author =	"Wm. Randolph Franklin"
-, title =	"Efficient Rotation of an Object"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-32"
-, number =	11
-, month =	nov
-, year =	1983
-, pages =	"1064--1067"
-, keywords =	"computer graphics, CAD"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Efficient Rotation of an Object"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-32"
+, number =      11
+, month =       nov
+, year =        1983
+, pages =       "1064--1067"
+, keywords =    "computer graphics, CAD"
+, update =      "93.09 franklin"
 }
 
 @article{f-eadvp-79
-, author =	"Wm. Randolph Franklin"
-, title =	"Evaluation of Algorithms to Display Vector Plots on Raster Devices"
-, journal =	"Comput. Graph. Image Process."
-, volume =	11
-, number =	4
-, month =	dec
-, year =	1979
-, pages =	"377--397"
-, keywords =	"computer graphics, CAD, discrete geometry"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Evaluation of Algorithms to Display Vector Plots on Raster Devices"
+, journal =     "Comput. Graph. Image Process."
+, volume =      11
+, number =      4
+, month =       dec
+, year =        1979
+, pages =       "377--397"
+, keywords =    "computer graphics, CAD, discrete geometry"
+, update =      "93.09 franklin"
 }
 
 @inproceedings{f-moaap-92
-, author =	"Wm. Randolph Franklin"
-, title =	"Map Overlay Area Animation and Parallel Simulation"
-, editor =	"David H. Douglas"
-, booktitle =	"Proceedings, SORSA'92 Symposium and Workshop"
-, month =	jul
-, year =	1992
-, pages =	"200--203"
-, keywords =	"parallel computation, intersection, area"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Map Overlay Area Animation and Parallel Simulation"
+, editor =      "David H. Douglas"
+, booktitle =   "Proceedings, SORSA'92 Symposium and Workshop"
+, month =       jul
+, year =        1992
+, pages =       "200--203"
+, keywords =    "parallel computation, intersection, area"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @incollection{f-prga-86
-, author =	"Wm. Randolph Franklin"
-, title =	"Problems with Raster Graphics Algorithms"
-, editor =	"L. R. A. Kessener and F. J. Peters and M. L. P. van Lierop"
-, booktitle =	"Data Structures for Raster Graphics (Proceedings of a Workshop held at Steensel, The Netherlands, June 24--28, 1985)"
-, publisher =	"Springer-Verlag Eurographic Seminars"
-, year =	1986
-, keywords =	"computer graphics, discrete geometry"
-, comments =	"(invited presentation)"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Problems with Raster Graphics Algorithms"
+, editor =      "L. R. A. Kessener and F. J. Peters and M. L. P. van Lierop"
+, booktitle =   "Data Structures for Raster Graphics (Proceedings of a Workshop held at Steensel, The Netherlands, June 24--28, 1985)"
+, publisher =   "Springer-Verlag Eurographic Seminars"
+, year =        1986
+, keywords =    "computer graphics, discrete geometry"
+, comments =    "(invited presentation)"
+, update =      "93.09 franklin"
 }
 
 @article{f-rnrpp-83
-, author =	"Wm. Randolph Franklin"
-, title =	"RAYS -- New Representation for Polygons and Polyhedra"
-, journal =	"Comput. Graph. Image Process."
-, volume =	22
-, year =	1983
-, pages =	"327--338"
-, keywords =	"measure, polygons, rays"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "RAYS -- New Representation for Polygons and Polyhedra"
+, journal =     "Comput. Graph. Image Process."
+, volume =      22
+, year =        1983
+, pages =       "327--338"
+, keywords =    "measure, polygons, rays"
+, update =      "93.09 franklin"
 }
 
 @inproceedings{f-tcfg-92
-, author =	"Wm. Randolph Franklin"
-, title =	"Tutorial on Curve Fitting for {GIS}"
-, editor =	"David H. Douglas"
-, booktitle =	"Proceedings, SORSA'92 Symposium and Workshop"
-, month =	jul
-, year =	1992
-, pages =	"235--250"
-, keywords =	"splines, tutorial"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin"
+, title =       "Tutorial on Curve Fitting for {GIS}"
+, editor =      "David H. Douglas"
+, booktitle =   "Proceedings, SORSA'92 Symposium and Workshop"
+, month =       jul
+, year =        1992
+, pages =       "235--250"
+, keywords =    "splines, tutorial"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @article{fa-sehla-87
-, author =	"Wm. Randolph Franklin and Varol Akman"
-, title =	"A simple and efficient haloed line algorithm for hidden line elimination"
-, journal =	"Comput. Graph. Forum"
-, volume =	6
-, number =	2
-, month =	may
-, year =	1987
-, pages =	"103--109"
-, keywords =	"computer graphics, hidden line/surface elimination"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Varol Akman"
+, title =       "A simple and efficient haloed line algorithm for hidden line elimination"
+, journal =     "Comput. Graph. Forum"
+, volume =      6
+, number =      2
+, month =       may
+, year =        1987
+, pages =       "103--109"
+, keywords =    "computer graphics, hidden line/surface elimination"
+, update =      "93.09 franklin"
 }
 
 @article{fa-agpvo-88
-, author =	"Wm. Randolph Franklin and Varol Akman"
-, title =	"Adaptive Grid for polyhedral visibility in object space, an implementation"
-, journal =	"Comput. J."
-, volume =	31
-, number =	1
-, month =	feb
-, year =	1988
-, pages =	"56--60"
-, keywords =	"computer graphics, hidden line/surface elimination"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Varol Akman"
+, title =       "Adaptive Grid for polyhedral visibility in object space, an implementation"
+, journal =     "Comput. J."
+, volume =      31
+, number =      1
+, month =       feb
+, year =        1988
+, pages =       "56--60"
+, keywords =    "computer graphics, hidden line/surface elimination"
+, update =      "93.09 franklin"
 }
 
 @inproceedings{fa-bosp-85i
-, author =	"Wm. Randolph Franklin and Varol Akman"
-, title =	"Building an Octree from a Set of Parallelepipeds"
-, booktitle =	"Graphics Interface"
-, year =	1985
-, keywords =	"computer graphics, oct trees, CAD"
-, precedes =	"fa-bosp-85j"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Varol Akman"
+, title =       "Building an Octree from a Set of Parallelepipeds"
+, booktitle =   "Graphics Interface"
+, year =        1985
+, keywords =    "computer graphics, oct trees, CAD"
+, precedes =    "fa-bosp-85j"
+, update =      "93.09 franklin"
 }
 
 @article{fa-bosp-85j
-, author =	"Wm. Randolph Franklin and Varol Akman"
-, title =	"Building an Octree from a Set of Parallelepipeds"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	5
-, number =	10
-, month =	oct
-, year =	1985
-, pages =	"58--64"
-, keywords =	"computer graphics, oct trees"
-, succeeds =	"fa-bosp-85i"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Varol Akman"
+, title =       "Building an Octree from a Set of Parallelepipeds"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      5
+, number =      10
+, month =       oct
+, year =        1985
+, pages =       "58--64"
+, keywords =    "computer graphics, oct trees"
+, succeeds =    "fa-bosp-85i"
+, update =      "93.09 franklin"
 }
 
 @incollection{fa-odscs-85
-, author =	"Wm. Randolph Franklin and Varol Akman"
-, title =	"Octree Data Structures and Creation by Stacking"
-, editor =	"Nadia Magenat-Thalmann"
-, booktitle =	"Computer Generated Images, State of the Art"
-, publisher =	"Springer-Verlag"
-, year =	1985
-, keywords =	"computer graphics, oct trees"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Varol Akman"
+, title =       "Octree Data Structures and Creation by Stacking"
+, editor =      "Nadia Magenat-Thalmann"
+, booktitle =   "Computer Generated Images, State of the Art"
+, publisher =   "Springer-Verlag"
+, year =        1985
+, keywords =    "computer graphics, oct trees"
+, update =      "93.09 franklin"
 }
 
 @article{fa-rvrvs-86
-, author =	"Wm. Randolph Franklin and Varol Akman"
-, title =	"Reconstructing Visible Regions From Visible Segments"
-, journal =	"BIT"
-, volume =	26
-, year =	1986
-, pages =	"430--441"
-, keywords =	"computer graphics, hidden line/surface elimination"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Varol Akman"
+, title =       "Reconstructing Visible Regions From Visible Segments"
+, journal =     "BIT"
+, volume =      26
+, year =        1986
+, pages =       "430--441"
+, keywords =    "computer graphics, hidden line/surface elimination"
+, update =      "93.09 franklin"
 }
 
 @inproceedings{fa-spbsg-84
-, author =	"Wm. Randolph Franklin and Varol Akman"
-, title =	"Shortest Paths Between Source and Goal Points Located On/Around a Convex Polyhedron"
-, booktitle =	"Proc. 22nd Allerton Conf. Commun. Control Comput."
-, site =	"Urbana, Illinois, USA"
-, month =	oct
-, year =	1984
-, keywords =	"motion planning"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin and Varol Akman"
+, title =       "Shortest Paths Between Source and Goal Points Located On/Around a Convex Polyhedron"
+, booktitle =   "Proc. 22nd Allerton Conf. Commun. Control Comput."
+, site =        "Urbana, Illinois, USA"
+, month =       oct
+, year =        1984
+, keywords =    "motion planning"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @incollection{fa-sp3sv-85
-, author =	"Wm. Randolph Franklin and Varol Akman"
-, title =	"Shortest Paths in 3-Space, {Voronoi} Diagrams with Barriers, and Related Complexity and Algebraic Issues"
-, booktitle =	"Proceedings of the NATO Advanced Study Institute on Fundamental Algorithms for Computer Graphics"
-, series =	"NATO ASI Series F"
-, volume =	17
-, publisher =	"Springer-Verlag"
-, address =	"Ilkley, Yorkshire, England"
-, month =	mar
-, year =	1985
-, pages =	"895--917"
-, keywords =	"motion planning"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin and Varol Akman"
+, title =       "Shortest Paths in 3-Space, {Voronoi} Diagrams with Barriers, and Related Complexity and Algebraic Issues"
+, booktitle =   "Proceedings of the NATO Advanced Study Institute on Fundamental Algorithms for Computer Graphics"
+, series =      "NATO ASI Series F"
+, volume =      17
+, publisher =   "Springer-Verlag"
+, address =     "Ilkley, Yorkshire, England"
+, month =       mar
+, year =        1985
+, pages =       "895--917"
+, keywords =    "motion planning"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @incollection{fckaw-egoc-90
-, author =	"Wm. Randolph Franklin and Narayanaswami Chandrasekhar and Mohan Kankanhalli and Varol Akman and Peter Y. F. Wu"
-, title =	"Efficient Geometric Operations for {CAD}"
-, editor =	"Michael J. Wozny and Joshua U. Turner and K. Preiss"
-, booktitle =	"Geometric Modeling for Product Engineering"
-, publisher =	"Elsevier Science Publishers B.V. (North-Holland)"
-, year =	1990
-, pages =	"485--498"
-, note =	"Selected and expanded papers from the IFIP WG 5.2/NSF Working Conference on Geometric Modeling, Rensselaerville, USA, 18-22 September 1988"
-, keywords =	"intersection, CAD, grids"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Narayanaswami Chandrasekhar and Mohan Kankanhalli and Varol Akman and Peter Y. F. Wu"
+, title =       "Efficient Geometric Operations for {CAD}"
+, editor =      "Michael J. Wozny and Joshua U. Turner and K. Preiss"
+, booktitle =   "Geometric Modeling for Product Engineering"
+, publisher =   "Elsevier Science Publishers B.V. (North-Holland)"
+, year =        1990
+, pages =       "485--498"
+, note =        "Selected and expanded papers from the IFIP WG 5.2/NSF Working Conference on Geometric Modeling, Rensselaerville, USA, 18-22 September 1988"
+, keywords =    "intersection, CAD, grids"
+, update =      "93.09 franklin"
 }
 
 @incollection{fcksa-eugid-88
-, author =	"Wm. Randolph Franklin and Narayanaswami Chandrasekhar and Mohan Kankanhalli and Manoj Seshan and Varol Akman"
-, title =	"Efficiency of uniform grids for intersection detection on serial and parallel machines"
-, editor =	"Nadia Magnenat-Thalmann and D. Thalmann"
-, booktitle =	"New Trends in Computer Graphics (Proc. Computer Graphics International'88)"
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"288--297"
-, keywords =	"parallel computation, intersection, grids"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Narayanaswami Chandrasekhar and Mohan Kankanhalli and Manoj Seshan and Varol Akman"
+, title =       "Efficiency of uniform grids for intersection detection on serial and parallel machines"
+, editor =      "Nadia Magnenat-Thalmann and D. Thalmann"
+, booktitle =   "New Trends in Computer Graphics (Proc. Computer Graphics International'88)"
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "288--297"
+, keywords =    "parallel computation, intersection, grids"
+, update =      "93.09 franklin"
 }
 
 @article{fk-poshs-90
-, author =	"Wm. Randolph Franklin and Mohan Kankanhalli"
-, title =	"Parallel Object-Space Hidden Surface Removal"
-, journal =	"Comput. Graph."
-, volume =	24
-, number =	4
-, month =	aug
-, year =	1990
-, pages =	"87--94"
-, note =	"Proc. SIGGRAPH '90"
-, keywords =	"computer graphics, parallel computation, hidden line/surface elimination, grids"
-, comments =	"Dallas, Texas"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Mohan Kankanhalli"
+, title =       "Parallel Object-Space Hidden Surface Removal"
+, journal =     "Comput. Graph."
+, volume =      24
+, number =      4
+, month =       aug
+, year =        1990
+, pages =       "87--94"
+, note =        "Proc. SIGGRAPH '90"
+, keywords =    "computer graphics, parallel computation, hidden line/surface elimination, grids"
+, comments =    "Dallas, Texas"
+, update =      "93.09 franklin"
 }
 
 @inproceedings{fkn-epgol-89
-, author =	"Wm. Randolph Franklin and Mohan Kankanhalli and Chandrasekhar Narayanaswami"
-, title =	"Efficient Primitive Geometric Operations on Large Databases"
-, booktitle =	"Proceedings National Conference Challenge for the 1990s GIS Geographic Information Systems"
-, site =	"Ottawa"
-, organization =	"Canadian Institute of Surveying and Mapping"
-, month =	feb
-, year =	1989
-, pages =	"1247--1256"
-, keywords =	"intersection, CAD, grids"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin and Mohan Kankanhalli and Chandrasekhar Narayanaswami"
+, title =       "Efficient Primitive Geometric Operations on Large Databases"
+, booktitle =   "Proceedings National Conference Challenge for the 1990s GIS Geographic Information Systems"
+, site =        "Ottawa"
+, organization =        "Canadian Institute of Surveying and Mapping"
+, month =       feb
+, year =        1989
+, pages =       "1247--1256"
+, keywords =    "intersection, CAD, grids"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @incollection{fk-vo3dt-93
-, author =	"Wm. Randolph Franklin and Mohan S. Kankanhalli"
-, title =	"Volumes From Overlaying 3-{D} Triangulations in Parallel"
-, editor =	"D. Abel and B. C. Ooi"
-, booktitle =	"Proc. 3rd Sympos. Advances in Spatial Databases"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	692
-, publisher =	"Springer-Verlag"
-, month =	jun
-, year =	1993
-, pages =	"477--489"
-, keywords =	"parallel computation, intersection, volume, CAD"
-, comments =	"SSD =	Symp on Large Spatial DBs, Singapore"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Mohan S. Kankanhalli"
+, title =       "Volumes From Overlaying 3-{D} Triangulations in Parallel"
+, editor =      "D. Abel and B. C. Ooi"
+, booktitle =   "Proc. 3rd Sympos. Advances in Spatial Databases"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      692
+, publisher =   "Springer-Verlag"
+, month =       jun
+, year =        1993
+, pages =       "477--489"
+, keywords =    "parallel computation, intersection, volume, CAD"
+, comments =    "SSD =  Symp on Large Spatial DBs, Singapore"
+, update =      "93.09 franklin"
 }
 
 @article{fl-3dgdd-78
-, author =	"Wm. Randolph Franklin and Harry R. Lewis"
-, title =	"3-{D} Graphic Display of Discrete Spatial Data By Prism Maps"
-, journal =	"Comput. Graph."
-, volume =	12
-, number =	3
-, month =	aug
-, year =	1978
-, pages =	"70--75"
-, note =	"Proc. SIGGRAPH '78"
-, keywords =	"computer graphics, hidden line/surface elimination"
-, update =	"96.09 devillers, 93.09 franklin"
+, author =      "Wm. Randolph Franklin and Harry R. Lewis"
+, title =       "3-{D} Graphic Display of Discrete Spatial Data By Prism Maps"
+, journal =     "Comput. Graph."
+, volume =      12
+, number =      3
+, month =       aug
+, year =        1978
+, pages =       "70--75"
+, note =        "Proc. SIGGRAPH '78"
+, keywords =    "computer graphics, hidden line/surface elimination"
+, update =      "96.09 devillers, 93.09 franklin"
 }
 
 @inproceedings{fnkszw-ugtid-89
-, author =	"Wm. Randolph Franklin and Chandrasekhar Narayanaswami and Mohan Kankanhalli and David Sun and Meng-Chu Zhou and Peter Y. F. Wu"
-, title =	"Uniform Grids: A Technique for Intersection Detection on Serial and Parallel Machines"
-, booktitle =	"Proceedings 9th International Symposium on Computer-Assisted Cartography"
-, site =	"Baltimore, Maryland"
-, month =	apr
-, year =	1989
-, pages =	"100--109"
-, keywords =	"parallel computation, intersection, CAD, grids"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin and Chandrasekhar Narayanaswami and Mohan Kankanhalli and David Sun and Meng-Chu Zhou and Peter Y. F. Wu"
+, title =       "Uniform Grids: A Technique for Intersection Detection on Serial and Parallel Machines"
+, booktitle =   "Proceedings 9th International Symposium on Computer-Assisted Cartography"
+, site =        "Baltimore, Maryland"
+, month =       apr
+, year =        1989
+, pages =       "100--109"
+, keywords =    "parallel computation, intersection, CAD, grids"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @inproceedings{fnsw-eupg-86
-, author =	"Wm. Randolph Franklin and Margaret Nichols and Sumitro Samaddar and Peter Y. F. Wu"
-, title =	"Experiences with Using {Prolog} for Geometry"
-, booktitle =	"Proceedings of Graphics Interface'86, Vision Interface'86"
-, site =	"Vancouver, BC"
-, month =	may
-, year =	1986
-, pages =	"26--31"
-, keywords =	"computer graphics, artificial intelligence"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin and Margaret Nichols and Sumitro Samaddar and Peter Y. F. Wu"
+, title =       "Experiences with Using {Prolog} for Geometry"
+, booktitle =   "Proceedings of Graphics Interface'86, Vision Interface'86"
+, site =        "Vancouver, BC"
+, month =       may
+, year =        1986
+, pages =       "26--31"
+, keywords =    "computer graphics, artificial intelligence"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @inproceedings{fr-hinbv-94
-, author =	"Wm. Randolph Franklin and C. K. Ray"
-, title =	"Higher Isn't Necessarily Better: Visibility Algorithms and Experiments"
-, booktitle =	"Proc. 6th Internat. Sympos. Spatial Data Handling"
-, year =	1994
-, pages =	"751--763"
-, keywords =	"visibility, terrains"
-, update =	"96.09 kreveld"
+, author =      "Wm. Randolph Franklin and C. K. Ray"
+, title =       "Higher Isn't Necessarily Better: Visibility Algorithms and Experiments"
+, booktitle =   "Proc. 6th Internat. Sympos. Spatial Data Handling"
+, year =        1994
+, pages =       "751--763"
+, keywords =    "visibility, terrains"
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{fs-ocamo-90
-, author =	"Wm. Randolph Franklin and Venkatesh Sivaswami"
-, title =	"{OVERPROP} --- Calculating Areas of Map Overlay Polygons without Calculating the Overlay"
-, booktitle =	"Second National Conference on Geographic Information Systems"
-, site =	"Ottawa"
-, month =	mar
-, year =	1990
-, pages =	"1646--1654"
-, keywords =	"intersection, area, grids"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin and Venkatesh Sivaswami"
+, title =       "{OVERPROP} --- Calculating Areas of Map Overlay Polygons without Calculating the Overlay"
+, booktitle =   "Second National Conference on Geographic Information Systems"
+, site =        "Ottawa"
+, month =       mar
+, year =        1990
+, pages =       "1646--1654"
+, keywords =    "intersection, area, grids"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @article{fsskn-ofmop-93
-, author =	"Wm. Randolph Franklin and Venkateshkumar Sivaswami and David Sun and Mohan Kankanhalli and Chandrasekhar Narayanaswami"
-, title =	"{OVERPROP} --- Finding Map Overlay Polygons' Areas Without Finding The Polygons"
-, journal =	"Cartography and Geographic Information Systems"
-, volume =	"??"
-, year =	1993
-, keywords =	"intersection, grids, area"
-, succeeds =	"f-cmopa-90"
-, update =	"97.11 bibrelex, 93.09 franklin"
+, author =      "Wm. Randolph Franklin and Venkateshkumar Sivaswami and David Sun and Mohan Kankanhalli and Chandrasekhar Narayanaswami"
+, title =       "{OVERPROP} --- Finding Map Overlay Polygons' Areas Without Finding The Polygons"
+, journal =     "Cartography and Geographic Information Systems"
+, volume =      "??"
+, year =        1993
+, keywords =    "intersection, grids, area"
+, succeeds =    "f-cmopa-90"
+, update =      "97.11 bibrelex, 93.09 franklin"
 }
 
 @inproceedings{fw-posp-87
-, author =	"Wm. Randolph Franklin and Peter Y. F. Wu"
-, title =	"A Polygon Overlay System in {Prolog}"
-, booktitle =	"Proceedings of the 8th International Symposium on Computer-Assisted Cartography"
-, site =	"Baltimore, Maryland"
-, month =	mar
-, year =	1987
-, pages =	"97--106"
-, keywords =	"intersection, artificial intelligence"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Wm. Randolph Franklin and Peter Y. F. Wu"
+, title =       "A Polygon Overlay System in {Prolog}"
+, booktitle =   "Proceedings of the 8th International Symposium on Computer-Assisted Cartography"
+, site =        "Baltimore, Maryland"
+, month =       mar
+, year =        1987
+, pages =       "97--106"
+, keywords =    "intersection, artificial intelligence"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @inproceedings{fwsn-gp-86
-, author =	"Wm. Randolph Franklin and Peter Y. F. Wu and Sumitro Samaddar and Margaret Nichols"
-, title =	"Geometry in {Prolog}"
-, editor =	"Tosiyasu Kunii"
-, booktitle =	"Advanced Computer Graphics, Proceedings of Computer Graphics Tokyo 86"
-, month =	apr
-, year =	1986
-, pages =	"71--78"
-, keywords =	"computer graphics, artificial intelligence"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Peter Y. F. Wu and Sumitro Samaddar and Margaret Nichols"
+, title =       "Geometry in {Prolog}"
+, editor =      "Tosiyasu Kunii"
+, booktitle =   "Advanced Computer Graphics, Proceedings of Computer Graphics Tokyo 86"
+, month =       apr
+, year =        1986
+, pages =       "71--78"
+, keywords =    "computer graphics, artificial intelligence"
+, update =      "93.09 franklin"
 }
 
 @article{fwsn-pgp-86
-, author =	"Wm. Randolph Franklin and Peter Y. F. Wu and Sumitro Samaddar and Margaret Nichols"
-, title =	"Prolog and Geometry Projects"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	"??"
-, month =	nov
-, year =	1986
-, pages =	"46--55"
-, keywords =	"computer graphics, artificial intelligence"
-, update =	"93.09 franklin"
+, author =      "Wm. Randolph Franklin and Peter Y. F. Wu and Sumitro Samaddar and Margaret Nichols"
+, title =       "Prolog and Geometry Projects"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      "??"
+, month =       nov
+, year =        1986
+, pages =       "46--55"
+, keywords =    "computer graphics, artificial intelligence"
+, update =      "93.09 franklin"
 }
 
 @article{f-fpe-94
-, author =	"Marc Frantz"
-, title =	"A focusing property of the ellipse"
-, journal =	"Amer. Math. Monthly"
-, volume =	101
-, year =	1994
-, pages =	"250--258"
-, update =	"01.04 orourke"
+, author =      "Marc Frantz"
+, title =       "A focusing property of the ellipse"
+, journal =     "Amer. Math. Monthly"
+, volume =      101
+, year =        1994
+, pages =       "250--258"
+, update =      "01.04 orourke"
 }
 
 @article{f-pgslh-89
-, author =	"D. Franzblau"
-, title =	"Performance guarantees on a sweep-line heuristic for covering rectilinear polygons with rectangles"
-, journal =	"SIAM J. Discrete Math."
-, volume =	2
-, number =	3
-, year =	1989
-, pages =	"307--321"
-, keywords =	"isothetic polygons, covering, rectangles"
-, update =	"95.09 korneenko"
+, author =      "D. Franzblau"
+, title =       "Performance guarantees on a sweep-line heuristic for covering rectilinear polygons with rectangles"
+, journal =     "SIAM J. Discrete Math."
+, volume =      2
+, number =      3
+, year =        1989
+, pages =       "307--321"
+, keywords =    "isothetic polygons, covering, rectangles"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{fk-acrri-84
-, author =	"D. Franzblau and D. Kleitman"
-, title =	"An algorithm for constructing regions with rectangles: independence and minimum generating sets for collections of intervals"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"167--174"
-, precedes =	"fk-acpr-84"
+, author =      "D. Franzblau and D. Kleitman"
+, title =       "An algorithm for constructing regions with rectangles: independence and minimum generating sets for collections of intervals"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "167--174"
+, precedes =    "fk-acpr-84"
 }
 
 @article{fk-acpr-84
-, author =	"D. Franzblau and D. Kleitman"
-, title =	"An algorithm for covering polygons with rectangles"
-, journal =	"Inform. Control"
-, volume =	63
-, year =	1984
-, pages =	"164--189"
-, succeeds =	"fk-acrri-84"
+, author =      "D. Franzblau and D. Kleitman"
+, title =       "An algorithm for covering polygons with rectangles"
+, journal =     "Inform. Control"
+, volume =      63
+, year =        1984
+, pages =       "164--189"
+, succeeds =    "fk-acrri-84"
 }
 
 @phdthesis{f-gcp-85
-, author =	"D. S. Franzblau"
-, title =	"Geometric covering and partitioning"
-, type =	"Ph.{D}. Thesis"
-, school =	"Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1985
-, keywords =	"doctoral thesis"
+, author =      "D. S. Franzblau"
+, title =       "Geometric covering and partitioning"
+, type =        "Ph.{D}. Thesis"
+, school =      "Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1985
+, keywords =    "doctoral thesis"
 }
 
 @article{f-tbppf-77
-, author =	"A. R. Fraser"
-, title =	"Triangle Based Probability Polygons for Forest Sampling"
-, journal =	"Forest Science"
-, volume =	23
-, year =	1977
-, pages =	"111--121"
-, annote =	"Uses Least Diagonal Neighbour Triangulation and Linear
-		 approximation over triangles to weighted VD to estimate
-		 area of weighted VD polygon of a given tree."
+, author =      "A. R. Fraser"
+, title =       "Triangle Based Probability Polygons for Forest Sampling"
+, journal =     "Forest Science"
+, volume =      23
+, year =        1977
+, pages =       "111--121"
+, annote =      "Uses Least Diagonal Neighbour Triangulation and Linear
+                 approximation over triangles to weighted VD to estimate
+                 area of weighted VD polygon of a given tree."
 }
 
 @article{fk-plsn-92
-, author =	"H. Fraysseix and P. Kuntz"
-, title =	"Pagination of large-scale networks"
-, journal =	"Algorithms Rev."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"105--112"
+, author =      "H. Fraysseix and P. Kuntz"
+, title =       "Pagination of large-scale networks"
+, journal =     "Algorithms Rev."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "105--112"
 }
 
 @inproceedings{fm-spgp-97
-, author =	"H. de Fraysseix and P. O. de Mendez"
-, title =	"A Short Proof of a Gauss Problem"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"230--235"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "H. de Fraysseix and P. O. de Mendez"
+, title =       "A Short Proof of a Gauss Problem"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "230--235"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{fm-roaa-95
-, author =	"H. de Fraysseix and P. O. de Mendez"
-, title =	"Regular Orientations, Arboricity, and Augmentation"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"111--118"
-, keywords =	"graph drawing, planar, orientation"
-, update =	"95.01 tamassia"
+, author =      "H. de Fraysseix and P. O. de Mendez"
+, title =       "Regular Orientations, Arboricity, and Augmentation"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "111--118"
+, keywords =    "graph drawing, planar, orientation"
+, update =      "95.01 tamassia"
 }
 
 @techreport{fmr-bor-93
-, author =	"H. de Fraysseix and P. O. de Mendez and P. Rosenstiehl"
-, title =	"Bipolar Orientations Revisited"
-, number =	"C.A.M.S. P089"
-, institution =	"EHESS, Paris"
-, year =	1993
-, update =	"94.05 tamassia"
+, author =      "H. de Fraysseix and P. O. de Mendez and P. Rosenstiehl"
+, title =       "Bipolar Orientations Revisited"
+, number =      "C.A.M.S. P089"
+, institution = "EHESS, Paris"
+, year =        1993
+, update =      "94.05 tamassia"
 }
 
 @article{fmr-bor-95
-, author =	"H. de Fraysseix and P. O. de Mendez and P. Rosenstiehl"
-, title =	"Bipolar Orientations Revisited"
-, journal =	"Discrete Appl. Math."
-, volume =	56
-, year =	1995
-, pages =	"157--179"
-, update =	"98.07 tamassia+vismara"
+, author =      "H. de Fraysseix and P. O. de Mendez and P. Rosenstiehl"
+, title =       "Bipolar Orientations Revisited"
+, journal =     "Discrete Appl. Math."
+, volume =      56
+, year =        1995
+, pages =       "157--179"
+, update =      "98.07 tamassia+vismara"
 }
 
 @misc{fmr-poo-92
-, author =	"H. de Fraysseix and P. O. de Mendez and P. Rosenstiehl"
-, title =	"Partial Orders and Orientation"
-, year =	1992
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "H. de Fraysseix and P. O. de Mendez and P. Rosenstiehl"
+, title =       "Partial Orders and Orientation"
+, year =        1992
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{fpp-hdpgg-90
-, author =	"H. de Fraysseix and J. Pach and R. Pollack"
-, title =	"How to Draw a Planar Graph on a Grid"
-, journal =	"Combinatorica"
-, volume =	10
-, number =	1
-, year =	1990
-, pages =	"41--51"
-, keywords =	"graph drawing"
-, update =	"98.07 tamassia, 93.09 tamassia"
+, author =      "H. de Fraysseix and J. Pach and R. Pollack"
+, title =       "How to Draw a Planar Graph on a Grid"
+, journal =     "Combinatorica"
+, volume =      10
+, number =      1
+, year =        1990
+, pages =       "41--51"
+, keywords =    "graph drawing"
+, update =      "98.07 tamassia, 93.09 tamassia"
 }
 
 @inproceedings{fpp-sssfe-88
-, author =	"H. de Fraysseix and J. Pach and R. Pollack"
-, title =	"Small Sets Supporting {Fary} Embeddings of Planar Graphs"
-, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
-, year =	1988
-, pages =	"426--433"
-, keywords =	"graph drawing"
-, update =	"94.01 tamassia, 93.09 tamassia"
+, author =      "H. de Fraysseix and J. Pach and R. Pollack"
+, title =       "Small Sets Supporting {Fary} Embeddings of Planar Graphs"
+, booktitle =   "Proc. 20th Annu. ACM Sympos. Theory Comput."
+, year =        1988
+, pages =       "426--433"
+, keywords =    "graph drawing"
+, update =      "94.01 tamassia, 93.09 tamassia"
 }
 
 @article{fr-dfscp-82
-, author =	"H. de Fraysseix and P. Rosenstiehl"
-, title =	"A Depth-First-Search Characterization of Planarity"
-, journal =	"Ann. Discrete Math."
-, volume =	13
-, year =	1982
-, pages =	"75--80"
-, keywords =	"graph drawing"
-, update =	"96.09 devillers, 93.09 tamassia"
+, author =      "H. de Fraysseix and P. Rosenstiehl"
+, title =       "A Depth-First-Search Characterization of Planarity"
+, journal =     "Ann. Discrete Math."
+, volume =      13
+, year =        1982
+, pages =       "75--80"
+, keywords =    "graph drawing"
+, update =      "96.09 devillers, 93.09 tamassia"
 }
 
 %   is this the publisher??
 @inproceedings{fr-scpdt-84
-, author =	"H. de Fraysseix and P. Rosenstiehl"
-, title =	"Structures Combinatoires pour des Traces Automatiques de Reseaux"
-, booktitle =	"Proc. 3rd European Conf. on CAD/CAM and Computer Graphics (Paris)"
-, publisher =	"Hermes"
-, year =	1984
-, pages =	"332--337"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "H. de Fraysseix and P. Rosenstiehl"
+, title =       "Structures Combinatoires pour des Traces Automatiques de Reseaux"
+, booktitle =   "Proc. 3rd European Conf. on CAD/CAM and Computer Graphics (Paris)"
+, publisher =   "Hermes"
+, year =        1984
+, pages =       "332--337"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{fm-ssams-70
-, author =	"W. D. Frazer and A. C. McKellar"
-, title =	"Samplesort: A sampling approach to minimal storage tree sorting"
-, journal =	"J. ACM"
-, volume =	17
-, number =	3
-, year =	1970
-, pages =	"496--507"
-, update =	"96.09 orourke"
+, author =      "W. D. Frazer and A. C. McKellar"
+, title =       "Samplesort: A sampling approach to minimal storage tree sorting"
+, journal =     "J. ACM"
+, volume =      17
+, number =      3
+, year =        1970
+, pages =       "496--507"
+, update =      "96.09 orourke"
 }
 
 @article{f-sqpdc-06
-, author =	"M. Fr{\'e}chet"
-, title =	"Sur quelques points du calcul fonctionnel"
-, journal =	"Rendiconti del Circolo Mathematico di Palermo"
-, volume =	22
-, year =	1906
-, pages =	"1--74"
-, update =	"97.11 bibrelex"
+, author =      "M. Fr{\'e}chet"
+, title =       "Sur quelques points du calcul fonctionnel"
+, journal =     "Rendiconti del Circolo Mathematico di Palermo"
+, volume =      22
+, year =        1906
+, pages =       "1--74"
+, update =      "97.11 bibrelex"
 }
 
 @book{ff-ict-34
-, author =	"M. Fr{\'e}chet and K. Fan"
-, title =	"Initiation to Combinatorial Topology"
-, publisher =	"Prindle, Weber and Schmidt, Inc."
-, address =	"Boston, MA"
-, year =	1934
-, note =	"Translated from French, with notes by Howard E. Eves"
-, update =	"97.11 bibrelex"
+, author =      "M. Fr{\'e}chet and K. Fan"
+, title =       "Initiation to Combinatorial Topology"
+, publisher =   "Prindle, Weber and Schmidt, Inc."
+, address =     "Boston, MA"
+, year =        1934
+, note =        "Translated from French, with notes by Howard E. Eves"
+, update =      "97.11 bibrelex"
 }
 
 @article{fwe-tdamg-70
-, author =	"C. O. Frederick and Y. C. Wong and F. W. Edge"
-, title =	"Two-dimensional Automatic Mesh Generation for Structural Analysis"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	2
-, year =	1970
-, pages =	"133--144"
-, annote =	"Triangulation of set of specified points. Builds
-		 triangles on edges to surround each point in turn. When
-		 building on edge $AB$ point $C$ which maximizes $\angle
-		 ACB$ is picked. DT!"
+, author =      "C. O. Frederick and Y. C. Wong and F. W. Edge"
+, title =       "Two-dimensional Automatic Mesh Generation for Structural Analysis"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      2
+, year =        1970
+, pages =       "133--144"
+, annote =      "Triangulation of set of specified points. Builds
+                 triangles on edges to surround each point in turn. When
+                 building on edge $AB$ point $C$ which maximizes $\angle
+                 ACB$ is picked. DT!"
 }
 
 @article{fm-nbkck-78
-, author =	"H. Fredericksen and J. Maiorana"
-, title =	"Necklaces of beads in $k$ colours and $k$-ary {DeBruin} sequences"
-, journal =	"Discrete Math."
-, volume =	23
-, year =	1978
-, pages =	"207--210"
-, update =	"97.11 bibrelex"
+, author =      "H. Fredericksen and J. Maiorana"
+, title =       "Necklaces of beads in $k$ colours and $k$-ary {DeBruin} sequences"
+, journal =     "Discrete Math."
+, volume =      23
+, year =        1978
+, pages =       "207--210"
+, update =      "97.11 bibrelex"
 }
 
 @book{f-dpf-97
-, author =	"Greg Frederickson"
-, title =	"Dissections: Plane and Fancy"
-, publisher =	"Cambridge University Press"
-, year =	1997
-, update =	"01.07 orourke"
+, author =      "Greg Frederickson"
+, title =       "Dissections: Plane and Fancy"
+, publisher =   "Cambridge University Press"
+, year =        1997
+, update =      "01.07 orourke"
 }
 
 @inproceedings{f-dsdmr-93
-, author =	"G. N. Frederickson"
-, title =	"A data structure for dynamically maintaining rooted trees"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"175--184"
-, update =	"96.01 tamassia"
+, author =      "G. N. Frederickson"
+, title =       "A data structure for dynamically maintaining rooted trees"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "175--184"
+, update =      "96.01 tamassia"
 }
 
 @article{f-dsdmr-97
-, author =	"Greg N. Frederickson"
-, title =	"A Data Structure for Dynamically Maintaining Rooted Trees"
-, journal =	"J. Algorithms"
-, volume =	24
-, year =	1997
-, pages =	"37--65"
-, keywords =	"topology tree"
-, succeeds =	"f-dsdmr-93"
-, update =	"98.07 cheong"
+, author =      "Greg N. Frederickson"
+, title =       "A Data Structure for Dynamically Maintaining Rooted Trees"
+, journal =     "J. Algorithms"
+, volume =      24
+, year =        1997
+, pages =       "37--65"
+, keywords =    "topology tree"
+, succeeds =    "f-dsdmr-93"
+, update =      "98.07 cheong"
 }
 
 @incollection{f-naaps-87
-, author =	"G. N. Frederickson"
-, title =	"A new approach to all pairs shortest paths in planar graphs"
-, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
-, year =	1987
-, pages =	"19--28"
-, keywords =	"shortest paths, graphs"
-, update =	"95.09 korneenko"
+, author =      "G. N. Frederickson"
+, title =       "A new approach to all pairs shortest paths in planar graphs"
+, booktitle =   "Proc. 19th Annu. ACM Sympos. Theory Comput."
+, year =        1987
+, pages =       "19--28"
+, keywords =    "shortest paths, graphs"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{f-adsd2-91
-, author =	"G. N. Frederickson"
-, title =	"Ambivalent Data Structures for Dynamic 2-Edge Connectivity and $k$-Smallest Spanning Trees"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"632--641"
-, update =	"94.01 tamassia"
+, author =      "G. N. Frederickson"
+, title =       "Ambivalent Data Structures for Dynamic 2-Edge Connectivity and $k$-Smallest Spanning Trees"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "632--641"
+, update =      "94.01 tamassia"
 }
 
 @article{f-adsd2-97
-, author =	"Greg N. Frederickson"
-, title =	"Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and $k$ Smallest Spanning Trees"
-, journal =	"SIAM J. Comput."
-, volume =	26
-, year =	1997
-, pages =	"484--538"
-, keywords =	"topology tree"
-, succeeds =	"f-adsd2-91"
-, update =	"98.07 cheong"
+, author =      "Greg N. Frederickson"
+, title =       "Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and $k$ Smallest Spanning Trees"
+, journal =     "SIAM J. Comput."
+, volume =      26
+, year =        1997
+, pages =       "484--538"
+, keywords =    "topology tree"
+, succeeds =    "f-adsd2-91"
+, update =      "98.07 cheong"
 }
 
 @article{f-dsolu-85
-, author =	"G. N. Frederickson"
-, title =	"Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, number =	4
-, year =	1985
-, pages =	"781--798"
-, update =	"94.01 tamassia"
+, author =      "G. N. Frederickson"
+, title =       "Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, number =      4
+, year =        1985
+, pages =       "781--798"
+, update =      "94.01 tamassia"
 }
 
 @article{f-faspp-87
-, author =	"G. N. Frederickson"
-, title =	"Fast algorithms for shortest paths in planar graphs, with applications"
-, journal =	"SIAM J. Comput."
-, volume =	16
-, number =	6
-, year =	1987
-, pages =	"1004--1022"
-, keywords =	"shortest paths, graphs"
-, update =	"96.09 agarwal, 95.09 korneenko"
+, author =      "G. N. Frederickson"
+, title =       "Fast algorithms for shortest paths in planar graphs, with applications"
+, journal =     "SIAM J. Comput."
+, volume =      16
+, number =      6
+, year =        1987
+, pages =       "1004--1022"
+, keywords =    "shortest paths, graphs"
+, update =      "96.09 agarwal, 95.09 korneenko"
 }
 
 @inproceedings{f-oatp-91
-, author =	"G. N. Frederickson"
-, title =	"Optimal algorithms for tree partitioning"
-, booktitle =	"Proc. 2nd ACM-SIAM Symp. Discr. Algo."
-, year =	1991
-, pages =	"168--177"
-, update =	"96.09 agarwal, 96.05 agarwal"
+, author =      "G. N. Frederickson"
+, title =       "Optimal algorithms for tree partitioning"
+, booktitle =   "Proc. 2nd ACM-SIAM Symp. Discr. Algo."
+, year =        1991
+, pages =       "168--177"
+, update =      "96.09 agarwal, 96.05 agarwal"
 }
 
 @techreport{fg-nempt-89
-, author =	"G. N. Frederickson and D. J. Guan"
-, title =	"Nonpreemptive ensemble motion planning on a tree"
-, type =	"Technical {Report}"
-, institution =	"Purdue Univ."
-, address =	"W. Lafayette, IN"
-, month =	aug
-, year =	1989
-, update =	"96.09 agarwal, 93.09 milone+mitchell"
+, author =      "G. N. Frederickson and D. J. Guan"
+, title =       "Nonpreemptive ensemble motion planning on a tree"
+, type =        "Technical {Report}"
+, institution = "Purdue Univ."
+, address =     "W. Lafayette, IN"
+, month =       aug
+, year =        1989
+, update =      "96.09 agarwal, 93.09 milone+mitchell"
 }
 
 @techreport{fg-pempt-89
-, author =	"G. N. Frederickson and D. J. Guan"
-, title =	"Preemptive ensemble motion planning on a tree"
-, type =	"Technical {Report}"
-, institution =	"Purdue Univ."
-, address =	"W. Lafayette, IN"
-, month =	aug
-, year =	1989
-, update =	"96.09 agarwal, 93.09 milone+mitchell"
+, author =      "G. N. Frederickson and D. J. Guan"
+, title =       "Preemptive ensemble motion planning on a tree"
+, type =        "Technical {Report}"
+, institution = "Purdue Univ."
+, address =     "W. Lafayette, IN"
+, month =       aug
+, year =        1989
+, update =      "96.09 agarwal, 93.09 milone+mitchell"
 }
 
 @techreport{fh-plaog-87
-, author =	"G. N. Frederickson and S. E. Hambrusch"
-, title =	"Planar linear arrangements of outerplanar graphs"
-, type =	"Technical {Report}"
-, institution =	"Purdue Univ."
-, address =	"W. Lafayette, IN"
-, month =	mar
-, year =	1987
-, update =	"96.09 agarwal, 93.09 milone+mitchell"
+, author =      "G. N. Frederickson and S. E. Hambrusch"
+, title =       "Planar linear arrangements of outerplanar graphs"
+, type =        "Technical {Report}"
+, institution = "Purdue Univ."
+, address =     "W. Lafayette, IN"
+, month =       mar
+, year =        1987
+, update =      "96.09 agarwal, 93.09 milone+mitchell"
 }
 
 @article{fj-fkppc-83
-, author =	"G. N. Frederickson and D. B. Johnson"
-, title =	"Finding $k$th paths and $p$-centers by generating and searching good data structures"
-, journal =	"J. Algorithms"
-, volume =	4
-, year =	1983
-, pages =	"61--80"
+, author =      "G. N. Frederickson and D. B. Johnson"
+, title =       "Finding $k$th paths and $p$-centers by generating and searching good data structures"
+, journal =     "J. Algorithms"
+, volume =      4
+, year =        1983
+, pages =       "61--80"
 }
 
 @article{fj-gsrsm-84
-, author =	"G. N. Frederickson and D. B. Johnson"
-, title =	"Generalized selection and ranking: sorted matrices"
-, journal =	"SIAM J. Comput."
-, volume =	13
-, year =	1984
-, pages =	"14--30"
-, update =	"96.09 agarwal, 96.05 agarwal"
+, author =      "G. N. Frederickson and D. B. Johnson"
+, title =       "Generalized selection and ranking: sorted matrices"
+, journal =     "SIAM J. Comput."
+, volume =      13
+, year =        1984
+, pages =       "14--30"
+, update =      "96.09 agarwal, 96.05 agarwal"
 }
 
 @article{fj-csrxm-82
-, author =	"G. N. Frederickson and D. B. Johnson"
-, title =	"The complexity of selection and ranking in {$X+Y$} and matrices with sorted rows and columns"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	24
-, year =	1982
-, pages =	"197--208"
+, author =      "G. N. Frederickson and D. B. Johnson"
+, title =       "The complexity of selection and ranking in {$X+Y$} and matrices with sorted rows and columns"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      24
+, year =        1982
+, pages =       "197--208"
 }
 
 @techreport{fr-nadmm-87
-, author =	"G. N. Frederickson and S. Rodger"
-, title =	"A new approach to the dynamic maintenance of maximal points in a plane"
-, type =	"Report"
-, number =	"CSD-TR-658"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1987
-, precedes =	"fr-nadmm-90"
-, update =	"96.09 agarwal"
+, author =      "G. N. Frederickson and S. Rodger"
+, title =       "A new approach to the dynamic maintenance of maximal points in a plane"
+, type =        "Report"
+, number =      "CSD-TR-658"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1987
+, precedes =    "fr-nadmm-90"
+, update =      "96.09 agarwal"
 }
 
 @article{fr-nadmm-90
-, author =	"G. N. Frederickson and S. Rodger"
-, title =	"A new approach to the dynamic maintenance of maximal points in a plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"365--374"
-, succeeds =	"fr-nadmm-87"
-, update =	"96.09 agarwal"
+, author =      "G. N. Frederickson and S. Rodger"
+, title =       "A new approach to the dynamic maintenance of maximal points in a plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "365--374"
+, succeeds =    "fr-nadmm-87"
+, update =      "96.09 agarwal"
 }
 
 @inproceedings{fs-dsolu-84
-, author =	"G. N. Frederickson and M. A. Srinivas"
-, title =	"Data structures for on-line updating of matroid intersection solutions"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"383--390"
-, precedes =	"fs-olusc-87"
-, update =	"97.11 bibrelex"
+, author =      "G. N. Frederickson and M. A. Srinivas"
+, title =       "Data structures for on-line updating of matroid intersection solutions"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "383--390"
+, precedes =    "fs-olusc-87"
+, update =      "97.11 bibrelex"
 }
 
 @article{fs-olusc-87
-, author =	"G. N. Frederickson and M. A. Srinivas"
-, title =	"On-line updating of solutions to a class of matroid intersection problems"
-, journal =	"Inform. Comput."
-, volume =	74
-, year =	1987
-, pages =	"113--139"
-, succeeds =	"fs-dsolu-84"
+, author =      "G. N. Frederickson and M. A. Srinivas"
+, title =       "On-line updating of solutions to a class of matroid intersection problems"
+, journal =     "Inform. Comput."
+, volume =      74
+, year =        1987
+, pages =       "113--139"
+, succeeds =    "fs-dsolu-84"
 }
 
 @inproceedings{fg-empt-89
-, author =	"H. N. Frederickson and D. J. Guan"
-, title =	"Esemble motion planning in trees"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"66--71"
+, author =      "H. N. Frederickson and D. J. Guan"
+, title =       "Esemble motion planning in trees"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "66--71"
 }
 
 @inproceedings{fhk-aasrp-76
-, author =	"H. N. Frederickson and M. S. Hecht and C. E. Kim"
-, title =	"Approximation algorithms for some routing problems"
-, booktitle =	"Proc. 17th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1976
-, pages =	"216--227"
-, precedes =	"fhk-aasrp-78"
+, author =      "H. N. Frederickson and M. S. Hecht and C. E. Kim"
+, title =       "Approximation algorithms for some routing problems"
+, booktitle =   "Proc. 17th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1976
+, pages =       "216--227"
+, precedes =    "fhk-aasrp-78"
 }
 
 @article{fhk-aasrp-78
-, author =	"H. N. Frederickson and M. S. Hecht and C. E. Kim"
-, title =	"Approximation algorithms for some routing problems"
-, journal =	"SIAM J. Comput."
-, volume =	7
-, year =	1978
-, pages =	"178--193"
-, succeeds =	"fhk-aasrp-76"
+, author =      "H. N. Frederickson and M. S. Hecht and C. E. Kim"
+, title =       "Approximation algorithms for some routing problems"
+, journal =     "SIAM J. Comput."
+, volume =      7
+, year =        1978
+, pages =       "178--193"
+, succeeds =    "fhk-aasrp-76"
 }
 
 @inproceedings{fj-sbsem-86
-, author =	"F. N. Fredickson and R. Janardan"
-, title =	"Separator-based strategies for efficient message routing"
-, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1986
-, pages =	"428--437"
-, update =	"98.03 bibrelex"
+, author =      "F. N. Fredickson and R. Janardan"
+, title =       "Separator-based strategies for efficient message routing"
+, booktitle =   "Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1986
+, pages =       "428--437"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{f-idswd-81
-, author =	"G. N. Fredickson"
-, title =	"Implicit data structures for the weighted dictionary problem"
-, booktitle =	"Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1981
-, pages =	"133--139"
-, update =	"97.11 bibrelex"
+, author =      "G. N. Fredickson"
+, title =       "Implicit data structures for the weighted dictionary problem"
+, booktitle =   "Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1981
+, pages =       "133--139"
+, update =      "97.11 bibrelex"
 }
 
 @article{fw-sitbf-93
-, author =	"F. W. Fredman and D. E. Willard"
-, title =	"Surpassing the information theoretic bound with fusion trees"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	48
-, number =	3
-, year =	1993
-, pages =	"424--436"
-, update =	"97.07 agarwal"
+, author =      "F. W. Fredman and D. E. Willard"
+, title =       "Surpassing the information theoretic bound with fusion trees"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      48
+, number =      3
+, year =        1993
+, pages =       "424--436"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{fw-tdams-90
-, author =	"F. W. Fredman and D. E. Willard"
-, title =	"Trans-dichotomous algorithms for minimum spanning trees and shortest paths"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"719--725"
+, author =      "F. W. Fredman and D. E. Willard"
+, title =       "Trans-dichotomous algorithms for minimum spanning trees and shortest paths"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "719--725"
 }
 
 @article{f-lbcor-81
-, author =	"M. L. Fredman"
-, title =	"A lower bound on the complexity of orthogonal range queries"
-, journal =	"J. ACM"
-, volume =	28
-, year =	1981
-, pages =	"696--705"
+, author =      "M. L. Fredman"
+, title =       "A lower bound on the complexity of orthogonal range queries"
+, journal =     "J. ACM"
+, volume =      28
+, year =        1981
+, pages =       "696--705"
 }
 
 @inproceedings{f-nodst-79
-, author =	"M. L. Fredman"
-, title =	"A near-optimal data structure for a type of range query problem"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
-, year =	1979
-, pages =	"62--66"
-, precedes =	"f-cmaci-79"
+, author =      "M. L. Fredman"
+, title =       "A near-optimal data structure for a type of range query problem"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Theory Comput."
+, year =        1979
+, pages =       "62--66"
+, precedes =    "f-cmaci-79"
 }
 
 @article{f-hgiit-76
-, author =	"M. L. Fredman"
-, title =	"How good is the information theory bound in sorting?"
-, journal =	"Theoret. Comput. Sci."
-, volume =	1
-, year =	1976
-, pages =	"355--361"
-, update =	"93.09 erickson"
+, author =      "M. L. Fredman"
+, title =       "How good is the information theory bound in sorting?"
+, journal =     "Theoret. Comput. Sci."
+, volume =      1
+, year =        1976
+, pages =       "355--361"
+, update =      "93.09 erickson"
 }
 
 @inproceedings{f-icrqp-79
-, author =	"M. L. Fredman"
-, title =	"Inherent complexity of range query problems"
-, booktitle =	"Proc. 17th Allerton Conf. Commun. Control Comput."
-, year =	1979
-, pages =	"231--240"
+, author =      "M. L. Fredman"
+, title =       "Inherent complexity of range query problems"
+, booktitle =   "Proc. 17th Allerton Conf. Commun. Control Comput."
+, year =        1979
+, pages =       "231--240"
 }
 
 @article{f-lbcso-81
-, author =	"M. L. Fredman"
-, title =	"Lower bounds on the complexity of some optimal data structures"
-, journal =	"SIAM J. Comput."
-, volume =	10
-, year =	1981
-, pages =	"1--10"
+, author =      "M. L. Fredman"
+, title =       "Lower bounds on the complexity of some optimal data structures"
+, journal =     "SIAM J. Comput."
+, volume =      10
+, year =        1981
+, pages =       "1--10"
 }
 
 @article{f-cmaci-79
-, author =	"M. L. Fredman"
-, title =	"The complexity of maintaining an array and computing its partial sums"
-, journal =	"J. ACM"
-, volume =	29
-, year =	1979
-, pages =	"250--260"
-, succeeds =	"f-nodst-79"
+, author =      "M. L. Fredman"
+, title =       "The complexity of maintaining an array and computing its partial sums"
+, journal =     "J. ACM"
+, volume =      29
+, year =        1979
+, pages =       "250--260"
+, succeeds =    "f-nodst-79"
 }
 
 @inproceedings{f-icdds-80
-, author =	"M. L. Fredman"
-, title =	"The inherent complexity of dynamic data structures which accommodate range queries"
-, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1980
-, pages =	"191--199"
-, comments =	"Split into three journal papers: \cite{f-lbcso-81},
-		 \cite{f-lbcor-81}, and \cite{f-sbmrq-81}"
+, author =      "M. L. Fredman"
+, title =       "The inherent complexity of dynamic data structures which accommodate range queries"
+, booktitle =   "Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1980
+, pages =       "191--199"
+, comments =    "Split into three journal papers: \cite{f-lbcso-81},
+                 \cite{f-lbcor-81}, and \cite{f-sbmrq-81}"
 }
 
 @article{f-sbmrq-81
-, author =	"M. L. Fredman"
-, title =	"The spanning bound as a measure of range query complexity"
-, journal =	"J. Algorithms"
-, volume =	2
-, year =	1981
-, pages =	"77--87"
+, author =      "M. L. Fredman"
+, title =       "The spanning bound as a measure of range query complexity"
+, journal =     "J. Algorithms"
+, volume =      2
+, year =        1981
+, pages =       "77--87"
 }
 
 @inproceedings{fks-sstwc-82
-, author =	"M. L. Fredman and J. Komlos and E. Szemeredi"
-, title =	"Storing a sparse table with {$O(1)$} worst -case access time"
-, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1982
-, pages =	"165--170"
-, update =	"00.11 smid, 97.11 bibrelex"
+, author =      "M. L. Fredman and J. Komlos and E. Szemeredi"
+, title =       "Storing a sparse table with {$O(1)$} worst -case access time"
+, booktitle =   "Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1982
+, pages =       "165--170"
+, update =      "00.11 smid, 97.11 bibrelex"
 }
 
 @article{fks-sstwc-84
-, author =	"M. L. Fredman and J. Komlos and E. Szemeredi"
-, title =	"Storing a sparse table with {$O(1)$} worst case access time"
-, journal =	"J. ACM"
-, volume =	31
-, number =	3
-, month =	jul
-, year =	1984
-, pages =	"538--544"
-, update =	"00.11 smid, 98.11 bibrelex, 98.03 smid"
+, author =      "M. L. Fredman and J. Komlos and E. Szemeredi"
+, title =       "Storing a sparse table with {$O(1)$} worst case access time"
+, journal =     "J. ACM"
+, volume =      31
+, number =      3
+, month =       jul
+, year =        1984
+, pages =       "538--544"
+, update =      "00.11 smid, 98.11 bibrelex, 98.03 smid"
 }
 
 @inproceedings{ft-fhtu-84
-, author =	"M. L. Fredman and R. E. Tarjan"
-, title =	"{Fibonacchi} heaps and their uses"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1984
-, pages =	"338--346"
-, update =	"97.11 bibrelex"
+, author =      "M. L. Fredman and R. E. Tarjan"
+, title =       "{Fibonacchi} heaps and their uses"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1984
+, pages =       "338--346"
+, update =      "97.11 bibrelex"
 }
 
 @article{ft-fhtui-87
-, author =	"M. L. Fredman and R. E. Tarjan"
-, title =	"Fibonacci heaps and their uses in improved network optimization algorithms"
-, journal =	"J. ACM"
-, volume =	34
-, year =	1987
-, pages =	"596--615"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "M. L. Fredman and R. E. Tarjan"
+, title =       "Fibonacci heaps and their uses in improved network optimization algorithms"
+, journal =     "J. ACM"
+, volume =      34
+, year =        1987
+, pages =       "596--615"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @article{fv-qtvrt-81
-, author =	"M. L. Fredman and D. J. Volper"
-, title =	"Query time versus redundancy trade-offs for range queries"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	23
-, year =	1981
-, pages =	"355--365"
+, author =      "M. L. Fredman and D. J. Volper"
+, title =       "Query time versus redundancy trade-offs for range queries"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      23
+, year =        1981
+, pages =       "355--365"
 }
 
 @article{fv-cpmrd-82
-, author =	"M. L. Fredman and D. J. Volper"
-, title =	"The complexity of partial match retrieval in a dynamic setting"
-, journal =	"J. Algorithms"
-, volume =	3
-, year =	1982
-, pages =	"68--78"
+, author =      "M. L. Fredman and D. J. Volper"
+, title =       "The complexity of partial match retrieval in a dynamic setting"
+, journal =     "J. Algorithms"
+, volume =      3
+, year =        1982
+, pages =       "68--78"
 }
 
 @article{fw-ccmb-78
-, author =	"M. L. Fredman and B. Weide"
-, title =	"On the complexity of computing the measure of $\bigcup[{a_{i}},b_{i}]$"
-, journal =	"Commun. ACM"
-, volume =	21
-, year =	1978
-, pages =	"540--544"
+, author =      "M. L. Fredman and B. Weide"
+, title =       "On the complexity of computing the measure of $\bigcup[{a_{i}},b_{i}]$"
+, journal =     "Commun. ACM"
+, volume =      21
+, year =        1978
+, pages =       "540--544"
 }
 
 @inproceedings{fw-bitbf-90
-, author =	"M. L. Fredman and D. E. Willard"
-, title =	"Blasting through the information theoretic barrier with fusion trees"
-, booktitle =	"STOC '90"
-, year =	1990
-, pages =	"1--7"
-, update =	"98.11 bibrelex"
+, author =      "M. L. Fredman and D. E. Willard"
+, title =       "Blasting through the information theoretic barrier with fusion trees"
+, booktitle =   "STOC '90"
+, year =        1990
+, pages =       "1--7"
+, update =      "98.11 bibrelex"
 }
 
 @article{f-pldps-87
-, author =	"M. H. Freedman"
-, title =	"A power law for the distortion of planar sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"345--351"
+, author =      "M. H. Freedman"
+, title =       "A power law for the distortion of planar sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "345--351"
 }
 
 @incollection{f-cnp-91
-, author =	"H. Freeman"
-, title =	"Computer Name Placement"
-, editor =	"D. J. Maguire and M. F. Goodchild and D. W. Rhind"
-, booktitle =	"Geographical Information Systems: Principles and Applications"
-, publisher =	"Longman"
-, address =	"London"
-, year =	1991
-, pages =	"445--456"
-, update =	"96.09 kreveld"
+, author =      "H. Freeman"
+, title =       "Computer Name Placement"
+, editor =      "D. J. Maguire and M. F. Goodchild and D. W. Rhind"
+, booktitle =   "Geographical Information Systems: Principles and Applications"
+, publisher =   "Longman"
+, address =     "London"
+, year =        1991
+, pages =       "445--456"
+, update =      "96.09 kreveld"
 }
 
 @article{f-cpldi-74
-, author =	"H. Freeman"
-, title =	"Computer processing of line-drawing images"
-, journal =	"ACM Comput. Surv."
-, volume =	6
-, year =	1974
-, pages =	"57--97"
+, author =      "H. Freeman"
+, title =       "Computer processing of line-drawing images"
+, journal =     "ACM Comput. Surv."
+, volume =      6
+, year =        1974
+, pages =       "57--97"
 }
 
 @article{f-lccs-80
-, author =	"H. Freeman"
-, title =	"Lines, curves, and the characterization of shapes"
-, journal =	"Inform. Process. Lett."
-, volume =	80
-, year =	1980
-, pages =	"629--639"
+, author =      "H. Freeman"
+, title =       "Lines, curves, and the characterization of shapes"
+, journal =     "Inform. Process. Lett."
+, volume =      80
+, year =        1980
+, pages =       "629--639"
 }
 
 @inproceedings{f-past-75
-, author =	"H. Freeman"
-, title =	"On the packing of arbitrary shaped templates"
-, booktitle =	"Proc. 2nd USA-Japan Comput. Conf."
-, year =	1975
-, pages =	"102--107"
-, update =	"98.03 bibrelex"
+, author =      "H. Freeman"
+, title =       "On the packing of arbitrary shaped templates"
+, booktitle =   "Proc. 2nd USA-Japan Comput. Conf."
+, year =        1975
+, pages =       "102--107"
+, update =      "98.03 bibrelex"
 }
 
 @article{fl-atdhl-67
-, author =	"H. Freeman and P. P. Loutrel"
-, title =	"An algorithm for the two dimensional ``hidden line'' problem"
-, journal =	"IEEE Trans. Electron. Comput."
-, volume =	"EC-16"
-, year =	1967
-, pages =	"784--790"
+, author =      "H. Freeman and P. P. Loutrel"
+, title =       "An algorithm for the two dimensional ``hidden line'' problem"
+, journal =     "IEEE Trans. Electron. Comput."
+, volume =      "EC-16"
+, year =        1967
+, pages =       "784--790"
 }
 
 @article{fm-scmgt-67
-, author =	"H. Freeman and S. P. Morse"
-, title =	"On searching a contour map for a given terrain profile"
-, journal =	"J. of the Franklin Institute"
-, volume =	248
-, year =	1967
-, pages =	"1--25"
-, update =	"98.07 bibrelex"
+, author =      "H. Freeman and S. P. Morse"
+, title =       "On searching a contour map for a given terrain profile"
+, journal =     "J. of the Franklin Institute"
+, volume =      248
+, year =        1967
+, pages =       "1--25"
+, update =      "98.07 bibrelex"
 }
 
 @article{fs-dmaer-75
-, author =	"H. Freeman and R. Shapira"
-, title =	"Determining the minimum-area encasing rectangle for an arbitrary closed curve"
-, journal =	"Commun. ACM"
-, volume =	18
-, year =	1975
-, pages =	"409--413"
+, author =      "H. Freeman and R. Shapira"
+, title =       "Determining the minimum-area encasing rectangle for an arbitrary closed curve"
+, journal =     "Commun. ACM"
+, volume =      18
+, year =        1975
+, pages =       "409--413"
 }
 
 @inproceedings{f-bfnkg-87
-, author =	"H. Freeston"
-, title =	"The {BANG} file: a new kind of grid file"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1987
-, pages =	"260--269"
-, keywords =	"data structuring"
-, update =	"97.07 agarwal, 95.09 korneenko"
+, author =      "H. Freeston"
+, title =       "The {BANG} file: a new kind of grid file"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1987
+, pages =       "260--269"
+, keywords =    "data structuring"
+, update =      "97.07 agarwal, 95.09 korneenko"
 }
 
 @inproceedings{f-gsndb-95
-, author =	"M. Freestone"
-, title =	"A general solution of the $n$-dimensional {B}-tree problem"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1995
-, pages =	"80--91"
-, update =	"97.07 agarwal"
+, author =      "M. Freestone"
+, title =       "A general solution of the $n$-dimensional {B}-tree problem"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1995
+, pages =       "80--91"
+, update =      "97.07 agarwal"
 }
 
 @techreport{f-bwlss-91
-, author =	"R. Freimer"
-, title =	"Bisectors of weakly linearly separable sets"
-, type =	"Report"
-, number =	"RC 16817"
-, institution =	"IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, month =	apr
-, year =	1991
-, keywords =	"Voronoi diagrams"
+, author =      "R. Freimer"
+, title =       "Bisectors of weakly linearly separable sets"
+, type =        "Report"
+, number =      "RC 16817"
+, institution = "IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, month =       apr
+, year =        1991
+, keywords =    "Voronoi diagrams"
 }
 
 @techreport{f-scph-91t
-, author =	"R. Freimer"
-, title =	"Shattering configurations of points with hyperplanes"
-, type =	"Technical {Report}"
-, number =	"TR~91-1199"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1991
-, keywords =	"arrangements, separation"
-, precedes =	"f-scph-91i"
+, author =      "R. Freimer"
+, title =       "Shattering configurations of points with hyperplanes"
+, type =        "Technical {Report}"
+, number =      "TR~91-1199"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1991
+, keywords =    "arrangements, separation"
+, precedes =    "f-scph-91i"
 }
 
 @inproceedings{f-scph-91i
-, author =	"R. Freimer"
-, title =	"Shattering configurations of points with hyperplanes"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"220--223"
-, keywords =	"arrangements, separation"
-, succeeds =	"f-scph-91t"
-, cites =	"e-acg-87, fmp-csua-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "R. Freimer"
+, title =       "Shattering configurations of points with hyperplanes"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "220--223"
+, keywords =    "arrangements, separation"
+, succeeds =    "f-scph-91t"
+, cites =       "e-acg-87, fmp-csua-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{fkmprs-lofp-94
-, author =	"R. Freimer and S. Khuller and Joseph S. B. Mitchell and C. Piatko and K. Romanik and D. Souvaine"
-, title =	"Localizing an Object with Finger Probes"
-, editor =	"Robert A. Melter and Angela Y. Wu"
-, booktitle =	"Proceedings of Vision Geometry III"
-, publisher =	"SPIE - The International Society for Optical Engineering"
-, month =	nov
-, year =	1994
-, pages =	"272--283"
-, note =	"part of SPIE's Intl. Symp. Photonics for Industrial Appl."
-, keywords =	"probing, finger probes, localization"
-, update =	"98.03 mitchell, 96.09 romanik"
+, author =      "R. Freimer and S. Khuller and Joseph S. B. Mitchell and C. Piatko and K. Romanik and D. Souvaine"
+, title =       "Localizing an Object with Finger Probes"
+, editor =      "Robert A. Melter and Angela Y. Wu"
+, booktitle =   "Proceedings of Vision Geometry III"
+, publisher =   "SPIE - The International Society for Optical Engineering"
+, month =       nov
+, year =        1994
+, pages =       "272--283"
+, note =        "part of SPIE's Intl. Symp. Photonics for Industrial Appl."
+, keywords =    "probing, finger probes, localization"
+, update =      "98.03 mitchell, 96.09 romanik"
 }
 
 @inproceedings{fmp-csua-90
-, author =	"R. Freimer and J. S. B. Mitchell and C. D. Piatko"
-, title =	"On the complexity of shattering using arrangements"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1990
-, pages =	"218--222"
-, keywords =	"arrangements, separation, NP-hardness"
-, precedes =	"fmp-csua-91"
-, cites =	"e-acg-87, eow-gfcs-83, ers-ccsno-90, ew-hrsls-86, gm-osacv-87, hm-aahos-88, m-cps-88, mt-cllfp-82, mw-dmvgi-90, sv-ecrps-89, w-ubgpc-90, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "R. Freimer and J. S. B. Mitchell and C. D. Piatko"
+, title =       "On the complexity of shattering using arrangements"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1990
+, pages =       "218--222"
+, keywords =    "arrangements, separation, NP-hardness"
+, precedes =    "fmp-csua-91"
+, cites =       "e-acg-87, eow-gfcs-83, ers-ccsno-90, ew-hrsls-86, gm-osacv-87, hm-aahos-88, m-cps-88, mt-cllfp-82, mw-dmvgi-90, sv-ecrps-89, w-ubgpc-90, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @techreport{fmp-csua-91
-, author =	"R. Freimer and Joseph S. B. Mitchell and C. D. Piatko"
-, title =	"On the complexity of shattering using arrangements"
-, type =	"Technical {Report}"
-, number =	"TR~91-1197"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	apr
-, year =	1991
-, keywords =	"arrangements, separation, NP-hardness, approximation"
-, succeeds =	"fmp-csua-90"
-, update =	"98.03 mitchell"
+, author =      "R. Freimer and Joseph S. B. Mitchell and C. D. Piatko"
+, title =       "On the complexity of shattering using arrangements"
+, type =        "Technical {Report}"
+, number =      "TR~91-1197"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       apr
+, year =        1991
+, keywords =    "arrangements, separation, NP-hardness, approximation"
+, succeeds =    "fmp-csua-90"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{fjp-epams-95
-, author =	"Lori Freitag and Mark Jones and Paul Plassmann"
-, title =	"An Efficient Parallel Algorithm for Mesh Smoothing"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"47--58"
-, update =	"96.01 samitchell"
+, author =      "Lori Freitag and Mark Jones and Paul Plassmann"
+, title =       "An Efficient Parallel Algorithm for Mesh Smoothing"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "47--58"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{fo-ctmit-96
-, author =	"Lori Freitag and Carl Ollivier-Gooch"
-, title =	"A comparison of tetrahedral mesh improvement techniques"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"87--100"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Lori Freitag and Carl Ollivier-Gooch"
+, title =       "A comparison of tetrahedral mesh improvement techniques"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "87--100"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @article{fsg-famg3-94
-, author =	"P. Frey and B. Sarter and M. Gautherie"
-, title =	"Fully automatic mesh generation for 3d domains based upon voxel sets"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	37
-, year =	1994
-, pages =	"2735--2754"
-, update =	"97.11 bibrelex"
+, author =      "P. Frey and B. Sarter and M. Gautherie"
+, title =       "Fully automatic mesh generation for 3d domains based upon voxel sets"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      37
+, year =        1994
+, pages =       "2735--2754"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{fbg-dtuaf-96
-, author =	"Pascal J. Frey and H. Borouchaki and Paul-Louis George"
-, title =	"Delaunay tetrahedrization using an advancing-front approach"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"31--43"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Pascal J. Frey and H. Borouchaki and Paul-Louis George"
+, title =       "Delaunay tetrahedrization using an advancing-front approach"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "31--43"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @book{fg-taef-99
-, author =	"Pascal J. Frey and Paul-Louis George"
-, title =	"Maillages. Applications aux {\'el\'ements} finis"
-, publisher =	"Hermes"
-, address =	"Paris, France"
-, year =	1999
-, update =	"01.07 devillers"
+, author =      "Pascal J. Frey and Paul-Louis George"
+, title =       "Maillages. Applications aux {\'el\'ements} finis"
+, publisher =   "Hermes"
+, address =     "Paris, France"
+, year =        1999
+, update =      "01.07 devillers"
 }
 
 @techreport{ff-mrnti-
-, author =	"W. Frey and D. Field"
-, title =	"Mesh Relaxation: {A} new technique for improving triangulations"
-, type =	"Research {Publication}"
-, institution =	"General Motors"
-, year =	"??"
-, update =	"97.11 bibrelex"
+, author =      "W. Frey and D. Field"
+, title =       "Mesh Relaxation: {A} new technique for improving triangulations"
+, type =        "Research {Publication}"
+, institution = "General Motors"
+, year =        "??"
+, update =      "97.11 bibrelex"
 }
 
 @article{f-srnsa-87
-, author =	"William H. Frey"
-, title =	"Selective Refinement: {A} New Strategy For Automatic Node Placement In Graded Triangular Meshes"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	24
-, number =	11
-, month =	nov
-, year =	1987
-, pages =	"2183--2200"
-, keywords =	"automatic node placement, graded triangular meshes, mesh generation"
-, annote =	"Refines mesh by adding new point at $\rho O +
-		 (1-\rho)I$ where $I$ is the incentre and $O$
-		 circumcentre and $\rho =2r/R$. Mentions $r/R$ as
-		 triangle quality measure."
-, abstract =	"Automating triangular finite element mesh generation
-		 involves two interrelated tasks: generating a
-		 distribution of well-placed nodes on the boundary and
-		 in the interior of a domain, and constructing a
-		 triangulation of these nodes. For a given distribution
-		 of nodes the Delaunay triangulation generally provides
-		 a suitable mesh, and Watson's algorithm provides a
-		 flexible means of constructing it. In this paper, a new
-		 method is described for automating node placement in a
-		 Delaunay triangulation by selective refinement of an
-		 initial triangulation. Grading of the mesh is
-		 controlled by an explicit or implicit node spacing
-		 function. Although this paper describes the technique
-		 only in the planar context the method generalizes to
-		 three dimensions as well. (Author abstract) 26 refs."
+, author =      "William H. Frey"
+, title =       "Selective Refinement: {A} New Strategy For Automatic Node Placement In Graded Triangular Meshes"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      24
+, number =      11
+, month =       nov
+, year =        1987
+, pages =       "2183--2200"
+, keywords =    "automatic node placement, graded triangular meshes, mesh generation"
+, annote =      "Refines mesh by adding new point at $\rho O +
+                 (1-\rho)I$ where $I$ is the incentre and $O$
+                 circumcentre and $\rho =2r/R$. Mentions $r/R$ as
+                 triangle quality measure."
+, abstract =    "Automating triangular finite element mesh generation
+                 involves two interrelated tasks: generating a
+                 distribution of well-placed nodes on the boundary and
+                 in the interior of a domain, and constructing a
+                 triangulation of these nodes. For a given distribution
+                 of nodes the Delaunay triangulation generally provides
+                 a suitable mesh, and Watson's algorithm provides a
+                 flexible means of constructing it. In this paper, a new
+                 method is described for automating node placement in a
+                 Delaunay triangulation by selective refinement of an
+                 initial triangulation. Grading of the mesh is
+                 controlled by an explicit or implicit node spacing
+                 function. Although this paper describes the technique
+                 only in the planar context the method generalizes to
+                 three dimensions as well. (Author abstract) 26 refs."
 }
 
 @article{ff-mrnti-91
-, author =	"William H. Frey and David A. Field"
-, title =	"Mesh Relaxation. {A} New Technique For Improving Triangulations"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	31
-, number =	6
-, month =	may
-, year =	1991
-, pages =	"1121--1133"
-, keywords =	"mathematical color shaded surface generation, mesh relaxation, laplacian smoothing techniques, planar domain triangulation"
-, annote =	"Flips to get degrees of interior nodes as close to 6
-		 as possible, then Laplacian smoothing. Mesh
-		 irregularity is $\sum_k(d_k-6)^2$."
-, abstract =	"Given a list of points defining a domain boundary, a
-		 three-stage process is often used to triangulate a
-		 domain. First, an appropriate distribution of interior
-		 points is generated. Next the points are connected to
-		 form triangles. And, finally, the connectivity data are
-		 used to reposition the interior points using the
-		 Laplacian smoothing technique, thereby usually
-		 improving the shapes of the triangles. This paper
-		 describes a new technique for mesh
-		 improvement--adjusting the connection structure during
-		 the second stage of this process. The new scheme, which
-		 we call mesh relaxation, consists of a procedure for
-		 iteratively making the mesh topology more regular by
-		 edge swapping. For each interior edge, a relaxation
-		 index is computed that depends on the degrees of its
-		 end points and adjacent points. Any edge for which this
-		 index exceeds a prescribed threshold will be swapped,
-		 i.e. replaced by a new edge connecting the adjacent
-		 points of the original edge. After all edge swaps are
-		 completed, Laplacian smoothing is applied to the mesh.
-		 Examples show that, when the mesh point density varies
-		 smoothly and due care is taken in the vicinity of the
-		 boundary, mesh relaxation can dramatically increase the
-		 regularity of the mesh and produce improved triangle
-		 shapes. (Author abstract)"
+, author =      "William H. Frey and David A. Field"
+, title =       "Mesh Relaxation. {A} New Technique For Improving Triangulations"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      31
+, number =      6
+, month =       may
+, year =        1991
+, pages =       "1121--1133"
+, keywords =    "mathematical color shaded surface generation, mesh relaxation, laplacian smoothing techniques, planar domain triangulation"
+, annote =      "Flips to get degrees of interior nodes as close to 6
+                 as possible, then Laplacian smoothing. Mesh
+                 irregularity is $\sum_k(d_k-6)^2$."
+, abstract =    "Given a list of points defining a domain boundary, a
+                 three-stage process is often used to triangulate a
+                 domain. First, an appropriate distribution of interior
+                 points is generated. Next the points are connected to
+                 form triangles. And, finally, the connectivity data are
+                 used to reposition the interior points using the
+                 Laplacian smoothing technique, thereby usually
+                 improving the shapes of the triangles. This paper
+                 describes a new technique for mesh
+                 improvement--adjusting the connection structure during
+                 the second stage of this process. The new scheme, which
+                 we call mesh relaxation, consists of a procedure for
+                 iteratively making the mesh topology more regular by
+                 edge swapping. For each interior edge, a relaxation
+                 index is computed that depends on the degrees of its
+                 end points and adjacent points. Any edge for which this
+                 index exceeds a prescribed threshold will be swapped,
+                 i.e. replaced by a new edge connecting the adjacent
+                 points of the original edge. After all edge swaps are
+                 completed, Laplacian smoothing is applied to the mesh.
+                 Examples show that, when the mesh point density varies
+                 smoothly and due care is taken in the vicinity of the
+                 boundary, mesh relaxation can dramatically increase the
+                 regularity of the mesh and produce improved triangle
+                 shapes. (Author abstract)"
 }
 
 @inproceedings{ff-mrit-92
-, author =	"William H. Frey and David A. Field"
-, title =	"Mesh Relaxation For Improving Triangulations"
-, booktitle =	"Proceedings of the SIAM Regional Conference on Geometric Aspects of Industrial Design"
-, publisher =	"Soc. for Industrial \& Applied Mathematics"
-, address =	"Philadelphia, PA"
-, year =	1992
-, pages =	"11--24"
-, keywords =	"mesh relaxation, connection structure, edge swaps, laplacian smoothing, mesh point density, relaxation index"
-, update =	"93.09 rote"
-, annote =	"Uses min angle, max angle, and min (r/R) to measure
-		 mesh quality."
-, abstract =	"This paper describes a new technique for improving a
-		 triangulation by modifying its connection structure.
-		 The new scheme, which we call mesh relaxation, consists
-		 of a systematic procedure for iteratively making the
-		 mesh topology more regular by edge swapping. Interior
-		 edges that are good candidates for swapping are
-		 identified by computing a relaxation index for each
-		 edge that depends on the degrees of its end points and
-		 adjacent points. Any edge whose index exceeds a
-		 prescribed threshold will be swapped, i.e. replaced by
-		 a new edge connecting the points adjacent to the
-		 original edge. After all edge swaps are completed,
-		 Laplacian smoothing is applied to the mesh. Examples
-		 show that when the mesh point density varies smoothly
-		 and due care is taken in the vicinity of the boundary,
-		 mesh relaxation can dramatically increase the
-		 regularity of the connection structure and produce
-		 improved triangle shapes. (Author abstract) 12 Refs."
+, author =      "William H. Frey and David A. Field"
+, title =       "Mesh Relaxation For Improving Triangulations"
+, booktitle =   "Proceedings of the SIAM Regional Conference on Geometric Aspects of Industrial Design"
+, publisher =   "Soc. for Industrial \& Applied Mathematics"
+, address =     "Philadelphia, PA"
+, year =        1992
+, pages =       "11--24"
+, keywords =    "mesh relaxation, connection structure, edge swaps, laplacian smoothing, mesh point density, relaxation index"
+, update =      "93.09 rote"
+, annote =      "Uses min angle, max angle, and min (r/R) to measure
+                 mesh quality."
+, abstract =    "This paper describes a new technique for improving a
+                 triangulation by modifying its connection structure.
+                 The new scheme, which we call mesh relaxation, consists
+                 of a systematic procedure for iteratively making the
+                 mesh topology more regular by edge swapping. Interior
+                 edges that are good candidates for swapping are
+                 identified by computing a relaxation index for each
+                 edge that depends on the degrees of its end points and
+                 adjacent points. Any edge whose index exceeds a
+                 prescribed threshold will be swapped, i.e. replaced by
+                 a new edge connecting the points adjacent to the
+                 original edge. After all edge swaps are completed,
+                 Laplacian smoothing is applied to the mesh. Examples
+                 show that when the mesh point density varies smoothly
+                 and due care is taken in the vicinity of the boundary,
+                 mesh relaxation can dramatically increase the
+                 regularity of the connection structure and produce
+                 improved triangle shapes. (Author abstract) 12 Refs."
 }
 
 @inproceedings{f-ubnhn-97
-, author =	"Arne Frick"
-, title =	"Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm"
-, editor =	"Stephen North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"169--183"
-, update =	"98.11 bibrelex, 98.07 tamassia+vismara"
+, author =      "Arne Frick"
+, title =       "Upper Bounds on the Number of Hidden Nodes in Sugiyama's Algorithm"
+, editor =      "Stephen North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "169--183"
+, update =      "98.11 bibrelex, 98.07 tamassia+vismara"
 }
 
 @inproceedings{fkv-ida-97
-, author =	"A. Frick and C. Keskin and V. Vogelmann"
-, title =	"Integration of Declarative Approaches"
-, editor =	"S. North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"184--192"
-, keywords =	"graph drawing, 3D"
-, update =	"98.07 patrignani"
+, author =      "A. Frick and C. Keskin and V. Vogelmann"
+, title =       "Integration of Declarative Approaches"
+, editor =      "S. North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "184--192"
+, keywords =    "graph drawing, 3D"
+, update =      "98.07 patrignani"
 }
 
 @inproceedings{flm-falau-95
-, author =	"A. Frick and A. Ludwig and H. Mehldau"
-, title =	"A Fast Adaptive Layout Algorithm for Undirected Graphs"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"388--403"
-, keywords =	"graph drawing, force-directed, system"
-, update =	"95.01 tamassia"
+, author =      "A. Frick and A. Ludwig and H. Mehldau"
+, title =       "A Fast Adaptive Layout Algorithm for Undirected Graphs"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "388--403"
+, keywords =    "graph drawing, force-directed, system"
+, update =      "95.01 tamassia"
 }
 
 @book{f-eidg-82
-, author =	"F. Fricker"
-, title =	"Einf{\"u}hrung in die {Gitterpunktlehre}"
-, publisher =	"Birkh{\"a}user"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "F. Fricker"
+, title =       "Einf{\"u}hrung in die {Gitterpunktlehre}"
+, publisher =   "Birkh{\"a}user"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @article{f-cfemg-72
-, author =	"I. Fried"
-, title =	"Condition of finite element matrices generated from nonuniform meshes"
-, journal =	"AIAA J."
-, volume =	10
-, year =	1972
-, pages =	"219--221"
-, update =	"97.11 bibrelex"
+, author =      "I. Fried"
+, title =       "Condition of finite element matrices generated from nonuniform meshes"
+, journal =     "AIAA J."
+, volume =      10
+, year =        1972
+, pages =       "219--221"
+, update =      "97.11 bibrelex"
 }
 
 @article{f-fass-86
-, author =	"A. Friedberg"
-, title =	"Finding axes of skewed symmetry"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	34
-, number =	2
-, year =	1986
-, pages =	"138--154"
-, keywords =	"symmetry"
-, update =	"95.09 korneenko"
+, author =      "A. Friedberg"
+, title =       "Finding axes of skewed symmetry"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      34
+, number =      2
+, year =        1986
+, pages =       "138--154"
+, keywords =    "symmetry"
+, update =      "95.09 korneenko"
 }
 
 @article{fw-spsrc-89
-, author =	"J. Friedel and P. Widmayer"
-, title =	"A simple proof of the {Steiner} ratio conjecture for five points"
-, journal =	"SIAM J. Appl. Math."
-, volume =	49
-, number =	3
-, year =	1989
-, pages =	"960--967"
-, keywords =	"Steiner tree, graphs"
-, update =	"95.09 korneenko"
+, author =      "J. Friedel and P. Widmayer"
+, title =       "A simple proof of the {Steiner} ratio conjecture for five points"
+, journal =     "SIAM J. Appl. Math."
+, volume =      49
+, number =      3
+, year =        1989
+, pages =       "960--967"
+, keywords =    "Steiner tree, graphs"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{fs-ddhsu-90
-, author =	"O. Frieder and M. R. Stytz"
-, title =	"Dynamic detection of hidden-surfaces using a {MIMD} multiprocessor"
-, booktitle =	"Proc. Annu. IEEE Symp. Computer-Based Med. Syst."
-, year =	1990
-, pages =	"44--51"
-, keywords =	"parallel computations, hidden line/serface elimination"
-, update =	"95.09 korneenko"
+, author =      "O. Frieder and M. R. Stytz"
+, title =       "Dynamic detection of hidden-surfaces using a {MIMD} multiprocessor"
+, booktitle =   "Proc. Annu. IEEE Symp. Computer-Based Med. Syst."
+, year =        1990
+, pages =       "44--51"
+, keywords =    "parallel computations, hidden line/serface elimination"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{fhs-cmsp-89
-, author =	"J. Friedman and J. Hershberger and J. Snoeyink"
-, title =	"Compliant motion in a simple polygon"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"175--186"
-, cites =	"b-ptcms-87, c-namrm-87, cr-nlbtr-87, ctv-flvat-88i, dghs-eafcr-88, d-cpcmp-88, d-edrrm-87, egs-oplms-86, e-ubfmp-86, em-esm-88, fw-pcm-88, fm-tspep-84, gy-fchsp-83, gss-gmppt-88, hm-ndsrs-82, k-osps-83, l-mpupb-88, lmt-asfms-84, lw-apcfp-79, m-olcch-87, n-moo-86, hss-pgcrm-87, tv-otats-88, ta-chapi-82, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "J. Friedman and J. Hershberger and J. Snoeyink"
+, title =       "Compliant motion in a simple polygon"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "175--186"
+, cites =       "b-ptcms-87, c-namrm-87, cr-nlbtr-87, ctv-flvat-88i, dghs-eafcr-88, d-cpcmp-88, d-edrrm-87, egs-oplms-86, e-ubfmp-86, em-esm-88, fw-pcm-88, fm-tspep-84, gy-fchsp-83, gss-gmppt-88, hm-ndsrs-82, k-osps-83, l-mpupb-88, lmt-asfms-84, lw-apcfp-79, m-olcch-87, n-moo-86, hss-pgcrm-87, tv-otats-88, ta-chapi-82, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{fhs-epcmp-96
-, author =	"J. Friedman and J. Hershberger and J. Snoeyink"
-, title =	"Efficiently planning compliant motion in the plane"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, year =	1996
-, pages =	"562--599"
-, update =	"96.09 smid"
+, author =      "J. Friedman and J. Hershberger and J. Snoeyink"
+, title =       "Efficiently planning compliant motion in the plane"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, pages =       "562--599"
+, update =      "96.09 smid"
 }
 
 @inproceedings{fhs-iscmp-90
-, author =	"J. Friedman and J. Hershberger and J. Snoeyink"
-, title =	"Input-sensitive compliant motion in the plane"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"225--237"
+, author =      "J. Friedman and J. Hershberger and J. Snoeyink"
+, title =       "Input-sensitive compliant motion in the plane"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "225--237"
 }
 
 @inproceedings{fhs-cmtm-90
-, author =	"J. Friedman and J. Hershberger and J. Snoeyink"
-, title =	"On coordinated motion through a maze"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"120--124"
-, cites =	"cr-nlbtr-87, d-cpcmp-90, em-esm-88, fhs-iscmp-90, gb-ompcc-75, hu-iatlc-79, lmt-asfms-84, n-moo-86, s-rbndt-70, hss-pgcrm-87, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "J. Friedman and J. Hershberger and J. Snoeyink"
+, title =       "On coordinated motion through a maze"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "120--124"
+, cites =       "cr-nlbtr-87, d-cpcmp-90, em-esm-88, fhs-iscmp-90, gb-ompcc-75, hu-iatlc-79, lmt-asfms-84, n-moo-86, s-rbndt-70, hss-pgcrm-87, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{fbs-afnn-75
-, author =	"J. H. Friedman and F. Baskett and L. J. Shustek"
-, title =	"An algorithm for finding nearest neighbors"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-24"
-, year =	1975
-, pages =	"1000--1006"
+, author =      "J. H. Friedman and F. Baskett and L. J. Shustek"
+, title =       "An algorithm for finding nearest neighbors"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-24"
+, year =        1975
+, pages =       "1000--1006"
 }
 
 @article{fbf-afbml-77
-, author =	"J. H. Friedman and J. L. Bentley and R. A. Finkel"
-, title =	"An algorithm for finding best matches in logarithmic expected time"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	3
-, year =	1977
-, pages =	"209--226"
-, keywords =	"range search"
+, author =      "J. H. Friedman and J. L. Bentley and R. A. Finkel"
+, title =       "An algorithm for finding best matches in logarithmic expected time"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      3
+, year =        1977
+, pages =       "209--226"
+, keywords =    "range search"
 }
 
 @mastersthesis{f-zepud-85
-, author =	"O. Fries"
-, title =	"Zerlegung einer planaren {Unterteilung} der {Ebene} und ihre {Anwendungen}"
-, type =	"M.{S}. Thesis"
-, school =	"Inst. Angew. Math. Inform., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1985
-, keywords =	"master thesis"
+, author =      "O. Fries"
+, title =       "Zerlegung einer planaren {Unterteilung} der {Ebene} und ihre {Anwendungen}"
+, type =        "M.{S}. Thesis"
+, school =      "Inst. Angew. Math. Inform., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1985
+, keywords =    "master thesis"
 }
 
 @inproceedings{fmn-dgds-85
-, author =	"O. Fries and K. Mehlhorn and S. N{\"a}her"
-, title =	"Dynamization of geometric data structures"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"168--176"
-, cites =	"cg-fc-85, egs-oplms-84, hm-ndsrs-82, ia-dsisa-84, k-osps-83, lt-apst-77, lp-lppsi-77, l-dsorq-78, ms-hbt-79, m-dsa-84, vw-rlsil-82, w-ndsor-85, w-ndsor-78, ekz-diepq-77, l-fmprp-83, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "O. Fries and K. Mehlhorn and S. N{\"a}her"
+, title =       "Dynamization of geometric data structures"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "168--176"
+, cites =       "cg-fc-85, egs-oplms-84, hm-ndsrs-82, ia-dsisa-84, k-osps-83, lt-apst-77, lp-lppsi-77, l-dsorq-78, ms-hbt-79, m-dsa-84, vw-rlsil-82, w-ndsor-85, w-ndsor-78, ekz-diepq-77, l-fmprp-83, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{fmnt-ldsts-86
-, author =	"O. Fries and K. Mehlhorn and S. N{\"a}her and A. Tsakalidis"
-, title =	"A $\log\log n$ data structure for three-sided range queries"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1986
-, pages =	"269--273"
+, author =      "O. Fries and K. Mehlhorn and S. N{\"a}her and A. Tsakalidis"
+, title =       "A $\log\log n$ data structure for three-sided range queries"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1986
+, pages =       "269--273"
 }
 
 @article{fmr-gml-91
-, author =	"A. Frieze and C. McDiarmid and B. Reed"
-, title =	"Greedy matching on the line"
-, journal =	"SIAM J. Comput."
-, volume =	19
-, number =	4
-, year =	1991
-, pages =	"666--672"
-, keywords =	"graph, matching, optimization"
-, update =	"95.09 korneenko"
+, author =      "A. Frieze and C. McDiarmid and B. Reed"
+, title =       "Greedy matching on the line"
+, journal =     "SIAM J. Comput."
+, volume =      19
+, number =      4
+, year =        1991
+, pages =       "666--672"
+, keywords =    "graph, matching, optimization"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{fmt-sbpdc-92
-, author =	"A. Frieze and G. Miller and S.-H. Teng"
-, title =	"Separator Based Parallel Divide and Conquer in Computational Geometry"
-, booktitle =	"Proc. 4th ACM Sympos. Parallel Algorithms Architect."
-, year =	1992
-, pages =	"??"
-, update =	"93.09 rote"
+, author =      "A. Frieze and G. Miller and S.-H. Teng"
+, title =       "Separator Based Parallel Divide and Conquer in Computational Geometry"
+, booktitle =   "Proc. 4th ACM Sympos. Parallel Algorithms Architect."
+, year =        1992
+, pages =       "??"
+, update =      "93.09 rote"
 }
 
 @article{fp-iglc-89
-, author =	"J. C. Frinkle and R. P. Paul"
-, title =	"The initial grasp liftability chart"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	5
-, number =	1
-, year =	1989
-, pages =	"47--52"
-, keywords =	"grasp"
-, update =	"95.09 korneenko"
+, author =      "J. C. Frinkle and R. P. Paul"
+, title =       "The initial grasp liftability chart"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      5
+, number =      1
+, year =        1989
+, pages =       "47--52"
+, keywords =    "grasp"
+, update =      "95.09 korneenko"
 }
 
 @book{fp-cst-90
-, author =	"R. Fritsch and R. A. Piccinini"
-, title =	"Cellular Structures in Topology"
-, publisher =	"Cambridge University Press"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "R. Fritsch and R. A. Piccinini"
+, title =       "Cellular Structures in Topology"
+, publisher =   "Cambridge University Press"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{fw-digvs-95
-, author =	"M. Fr{\"o}hlich and M. Werner"
-, title =	"Demonstration of the Interactive Graph-Visualization System {\em daVinci}"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"266--269"
-, keywords =	"graph drawing, system"
-, update =	"95.01 tamassia"
+, author =      "M. Fr{\"o}hlich and M. Werner"
+, title =       "Demonstration of the Interactive Graph-Visualization System {\em daVinci}"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "266--269"
+, keywords =    "graph drawing, system"
+, update =      "95.01 tamassia"
 }
 
 @book{fgs-tddea-90
-, author =	"C. Froidevaux and M. C. Gaudel and M. Soria"
-, title =	"Type de donn{\'e}es et algorithmes"
-, publisher =	"McGraw-Hill"
-, address =	"Paris"
-, year =	1990
-, keywords =	"algorithms, complexity, data type"
-, update =	"93.09 devillers"
+, author =      "C. Froidevaux and M. C. Gaudel and M. Soria"
+, title =       "Type de donn{\'e}es et algorithmes"
+, publisher =   "McGraw-Hill"
+, address =     "Paris"
+, year =        1990
+, keywords =    "algorithms, complexity, data type"
+, update =      "93.09 devillers"
 }
 
 @article{ft-csmet-88
-, author =	"H. J. Frost and C. V. Thompson"
-, title =	"Computer simulation of microstructural evolution in thin films"
-, journal =	"J. Electronic Materials"
-, volume =	"??"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "H. J. Frost and C. V. Thompson"
+, title =       "Computer simulation of microstructural evolution in thin films"
+, journal =     "J. Electronic Materials"
+, volume =      "??"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ft-dmtf-87
-, author =	"H. J. Frost and C. V. Thompson"
-, title =	"Development of microstructure in thin films"
-, booktitle =	"Proc. SPIE"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "H. J. Frost and C. V. Thompson"
+, title =       "Development of microstructure in thin films"
+, booktitle =   "Proc. SPIE"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @article{f-gdtga-49
-, author =	"R. Frucht"
-, title =	"Graphs of Degree Three with a given Abstract Group"
-, journal =	"Canad. J. Math."
-, volume =	1
-, year =	1949
-, pages =	"365--378"
-, update =	"97.11 bibrelex"
+, author =      "R. Frucht"
+, title =       "Graphs of Degree Three with a given Abstract Group"
+, journal =     "Canad. J. Math."
+, volume =      1
+, year =        1949
+, pages =       "365--378"
+, update =      "97.11 bibrelex"
 }
 
 @article{f-hdg-70
-, author =	"R. Frucht"
-, title =	"How to Describe a Graph"
-, journal =	"Ann. New York Acad. Sci."
-, volume =	175
-, year =	1970
-, pages =	"159--167"
-, update =	"97.11 bibrelex"
+, author =      "R. Frucht"
+, title =       "How to Describe a Graph"
+, journal =     "Ann. New York Acad. Sci."
+, volume =      175
+, year =        1970
+, pages =       "159--167"
+, update =      "97.11 bibrelex"
 }
 
 @article{f-grg-49
-, author =	"R. Frucht"
-, title =	"On the Groups of Repeated Graphs"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	55
-, year =	1949
-, pages =	"418--420"
-, update =	"97.11 bibrelex"
+, author =      "R. Frucht"
+, title =       "On the Groups of Repeated Graphs"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      55
+, year =        1949
+, pages =       "418--420"
+, update =      "97.11 bibrelex"
 }
 
 @article{fr-gdfdp-91
-, author =	"T. Fruchterman and E. Reingold"
-, title =	"Graph Drawing by Force-Directed Placement"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	21
-, number =	11
-, year =	1991
-, pages =	"1129--1164"
-, keywords =	"graph drawing"
-, update =	"95.05 tamassia, 93.09 tamassia"
+, author =      "T. Fruchterman and E. Reingold"
+, title =       "Graph Drawing by Force-Directed Placement"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      21
+, number =      11
+, year =        1991
+, pages =       "1129--1164"
+, keywords =    "graph drawing"
+, update =      "95.05 tamassia, 93.09 tamassia"
 }
 
 @article{fbr-accab-89
-, author =	"B. Fruhwirth and R. E. Burkard and G{\"u}nter Rote"
-, title =	"Approximation of convex curves with application to the bicriteral minimum cost flow problem"
-, journal =	"European J. Oper. Res."
-, volume =	42
-, year =	1989
-, pages =	"326--338"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "B. Fruhwirth and R. E. Burkard and G{\"u}nter Rote"
+, title =       "Approximation of convex curves with application to the bicriteral minimum cost flow problem"
+, journal =     "European J. Oper. Res."
+, volume =      42
+, year =        1989
+, pages =       "326--338"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @article{fl-mstmp-91
-, author =	"J.-J. Fu and R. C. T. Lee"
-, title =	"Minimal spanning trees of moving points in the plane"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-40"
-, number =	1
-, year =	1991
-, pages =	"113--118"
-, keywords =	"graphs, closeness, minimal spanning tree, points"
-, update =	"95.09 agarwal+korneenko"
+, author =      "J.-J. Fu and R. C. T. Lee"
+, title =       "Minimal spanning trees of moving points in the plane"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-40"
+, number =      1
+, year =        1991
+, pages =       "113--118"
+, keywords =    "graphs, closeness, minimal spanning tree, points"
+, update =      "95.09 agarwal+korneenko"
 }
 
 @inproceedings{fl-vdmpp-90
-, author =	"Jyh-Jong Fu and R. C. T. Lee"
-, title =	"{Voronoi} Diagrams of Moving Points in the Plane"
-, booktitle =	"Proc. 10th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1990
-, pages =	"238--254"
-, precedes =	"fl-vdmpp-91"
-, update =	"96.09 agarwal"
+, author =      "Jyh-Jong Fu and R. C. T. Lee"
+, title =       "{Voronoi} Diagrams of Moving Points in the Plane"
+, booktitle =   "Proc. 10th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1990
+, pages =       "238--254"
+, precedes =    "fl-vdmpp-91"
+, update =      "96.09 agarwal"
 }
 
 @article{fl-vdmpp-91
-, author =	"J.-J. Fu and R. C. T. Lee"
-, title =	"Voronoi diagrams of moving points in the plane"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	1
-, year =	1991
-, pages =	"23--32"
-, succeeds =	"fl-vdmpp-90"
+, author =      "J.-J. Fu and R. C. T. Lee"
+, title =       "Voronoi diagrams of moving points in the plane"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      1
+, year =        1991
+, pages =       "23--32"
+, succeeds =    "fl-vdmpp-90"
 }
 
 @article{fl-eafcf-90
-, author =	"L.-C. Fu and D.-Y. Liu"
-, title =	"An efficient algorithm for finding a collision-free path among polyhedral obstacles"
-, journal =	"J. Robot. Syst."
-, volume =	"??"
-, year =	1990
-, keywords =	"motion planning"
-, update =	"95.09 korneenko"
+, author =      "L.-C. Fu and D.-Y. Liu"
+, title =       "An efficient algorithm for finding a collision-free path among polyhedral obstacles"
+, journal =     "J. Robot. Syst."
+, volume =      "??"
+, year =        1990
+, keywords =    "motion planning"
+, update =      "95.09 korneenko"
 }
 
 @article{fag-nrtsd-83
-, author =	"H. Fuchs and G. D. Abrams and E. D. Grant"
-, title =	"Near Real-Time Shaded Display of Rigid Objects"
-, journal =	"Comput. Graph."
-, volume =	17
-, number =	3
-, year =	1983
-, pages =	"65--72"
-, note =	"Proc. SIGGRAPH '83"
-, update =	"97.11 bibrelex"
+, author =      "H. Fuchs and G. D. Abrams and E. D. Grant"
+, title =       "Near Real-Time Shaded Display of Rigid Objects"
+, journal =     "Comput. Graph."
+, volume =      17
+, number =      3
+, year =        1983
+, pages =       "65--72"
+, note =        "Proc. SIGGRAPH '83"
+, update =      "97.11 bibrelex"
 }
 
 @article{fkn-vsgpt-80
-, author =	"H. Fuchs and Z. M. Kedem and B. Naylor"
-, title =	"On visible surface generation by a priori tree structures"
-, journal =	"Comput. Graph."
-, volume =	14
-, number =	3
-, year =	1980
-, pages =	"124--133"
-, note =	"Proc. SIGGRAPH '80"
+, author =      "H. Fuchs and Z. M. Kedem and B. Naylor"
+, title =       "On visible surface generation by a priori tree structures"
+, journal =     "Comput. Graph."
+, volume =      14
+, number =      3
+, year =        1980
+, pages =       "124--133"
+, note =        "Proc. SIGGRAPH '80"
 }
 
 @article{fku-osrpc-77
-, author =	"H. Fuchs and Z. M. Kedem and S. P. Uselton"
-, title =	"Optimal surface reconstruction from planar contours"
-, journal =	"Commun. ACM"
-, volume =	20
-, year =	1977
-, pages =	"693--702"
+, author =      "H. Fuchs and Z. M. Kedem and S. P. Uselton"
+, title =       "Optimal surface reconstruction from planar contours"
+, journal =     "Commun. ACM"
+, volume =      20
+, year =        1977
+, pages =       "693--702"
 }
 
 @article{fpeggemtti-pp5hm-89
-, author =	"H. Fuchs and J. Poulton and J. Eyles and T. Greer and J. Goldfeather and D. Ellsworth and S. Molnar and G. Turk and B. Tebbs and L. Israel"
-, title =	"Pixel-planes 5: {A} heterogeneous multiprocessor graphics system using processor-enhanced memories"
-, journal =	"Comput. Graph."
-, volume =	23
-, number =	3
-, year =	1989
-, pages =	"79--88"
-, note =	"Proc. SIGGRAPH '89"
-, update =	"98.03 bibrelex"
+, author =      "H. Fuchs and J. Poulton and J. Eyles and T. Greer and J. Goldfeather and D. Ellsworth and S. Molnar and G. Turk and B. Tebbs and L. Israel"
+, title =       "Pixel-planes 5: {A} heterogeneous multiprocessor graphics system using processor-enhanced memories"
+, journal =     "Comput. Graph."
+, volume =      23
+, number =      3
+, year =        1989
+, pages =       "79--88"
+, note =        "Proc. SIGGRAPH '89"
+, update =      "98.03 bibrelex"
 }
 
 @article{f-nmc-71
-, author =	"M. Fuchs"
-, title =	"A note on mapping cylinders"
-, journal =	"Mich. Math. J."
-, volume =	18
-, year =	1971
-, pages =	"289--290"
-, update =	"98.03 bibrelex"
+, author =      "M. Fuchs"
+, title =       "A note on mapping cylinders"
+, journal =     "Mich. Math. J."
+, volume =      18
+, year =        1971
+, pages =       "289--290"
+, update =      "98.03 bibrelex"
 }
 
 @article{f-fshc-87
-, author =	"S. F{\"u}dadi"
-, title =	"Fixing system and homothetic covering"
-, journal =	"Acta Math. Acad. Sci. Hungar."
-, volume =	50
-, year =	1987
-, pages =	"203--225"
-, update =	"96.09 devillers, 95.09 korneenko"
+, author =      "S. F{\"u}dadi"
+, title =       "Fixing system and homothetic covering"
+, journal =     "Acta Math. Acad. Sci. Hungar."
+, volume =      50
+, year =        1987
+, pages =       "203--225"
+, update =      "96.09 devillers, 95.09 korneenko"
 }
 
 @article{fh-cpgcs-96
-, author =	"I. Fudos and C. Hoffmann"
-, title =	"Correctness proof of a geometric constraint solver"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"405--420"
-, update =	"97.03 devillers"
+, author =      "I. Fudos and C. Hoffmann"
+, title =       "Correctness proof of a geometric constraint solver"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "405--420"
+, update =      "97.03 devillers"
 }
 
 @article{fh-gcass-97
-, author =	"I. Fudos and C. M. Hoffmann"
-, title =	"A Graph-constructive Approach to Solving Systems of Geometric Constraints"
-, journal =	"ACM Trans. Graph."
-, volume =	16
-, number =	2
-, month =	apr
-, year =	1997
-, pages =	"179--216"
-, update =	"97.11 held"
+, author =      "I. Fudos and C. M. Hoffmann"
+, title =       "A Graph-constructive Approach to Solving Systems of Geometric Constraints"
+, journal =     "ACM Trans. Graph."
+, volume =      16
+, number =      2
+, month =       apr
+, year =        1997
+, pages =       "179--216"
+, update =      "97.11 held"
 }
 
 @inproceedings{f-trprp-97
-, author =	"Artur Fuhrmann"
-, title =	"Testing Roundness of a Polytope and Related Problems"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"169--174"
-, update =	"97.11 jones"
+, author =      "Artur Fuhrmann"
+, title =       "Testing Roundness of a Polytope and Related Problems"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "169--174"
+, update =      "97.11 jones"
 }
 
 @techreport{f-pmtve-91
-, author =	"K. Fujimura"
-, title =	"On Planning Motion in a Time-Varying Environment"
-, institution =	"Oak Ridge National Laboratory"
-, year =	1991
-, keywords =	"motion planing, time-dependent obstacles, time-minimal motion"
-, update =	"93.09 milone+mitchell"
+, author =      "K. Fujimura"
+, title =       "On Planning Motion in a Time-Varying Environment"
+, institution = "Oak Ridge National Laboratory"
+, year =        1991
+, keywords =    "motion planing, time-dependent obstacles, time-minimal motion"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{fk-prais-84
-, author =	"K. Fujimura and T. L. Kunii"
-, title =	"A polytree; representation and algorithms to integrate solid and boundary models"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Inform. Sci., Univ. Tokyo"
-, address =	"Tokyo, Japan"
-, year =	1984
+, author =      "K. Fujimura and T. L. Kunii"
+, title =       "A polytree; representation and algorithms to integrate solid and boundary models"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Inform. Sci., Univ. Tokyo"
+, address =     "Tokyo, Japan"
+, year =        1984
 }
 
 @article{fs-hsppm-89
-, author =	"K. Fujimura and H. Samet"
-, title =	"A hierarchical strategy for path planning among moving obstacles"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	5
-, number =	1
-, month =	feb
-, year =	1989
-, pages =	"61--19"
-, update =	"96.05 efrat"
+, author =      "K. Fujimura and H. Samet"
+, title =       "A hierarchical strategy for path planning among moving obstacles"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      5
+, number =      1
+, month =       feb
+, year =        1989
+, pages =       "61--19"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{fs-anapp-88
-, author =	"K. Fujimura and H. Samet"
-, title =	"Accessibility: A New Approach to Path Planning among Moving Obstacles"
-, booktitle =	"Proceedings of the CVPR88 Conference"
-, site =	"Ann Arbor, Michigan"
-, month =	jun
-, year =	1988
-, pages =	"803--807"
-, update =	"96.05 efrat"
+, author =      "K. Fujimura and H. Samet"
+, title =       "Accessibility: A New Approach to Path Planning among Moving Obstacles"
+, booktitle =   "Proceedings of the CVPR88 Conference"
+, site =        "Ann Arbor, Michigan"
+, month =       jun
+, year =        1988
+, pages =       "803--807"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{fs-mpdd-90
-, author =	"K. Fujimura and H. Samet"
-, title =	"Motion planning in a dynamic domain"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Cincinnati, OH"
-, volume =	1
-, month =	may
-, year =	1990
-, pages =	"324--330"
-, update =	"96.05 efrat"
+, author =      "K. Fujimura and H. Samet"
+, title =       "Motion planning in a dynamic domain"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Cincinnati, OH"
+, volume =      1
+, month =       may
+, year =        1990
+, pages =       "324--330"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{fs-ppmou-88
-, author =	"K. Fujimura and H. Samet"
-, title =	"Path Planning among Moving Obstacles Using Spatial Indexing"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Philadelphia, Pennsylvania"
-, month =	apr
-, year =	1988
-, pages =	"1662--1667"
-, update =	"96.05 efrat"
+, author =      "K. Fujimura and H. Samet"
+, title =       "Path Planning among Moving Obstacles Using Spatial Indexing"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Philadelphia, Pennsylvania"
+, month =       apr
+, year =        1988
+, pages =       "1662--1667"
+, update =      "96.05 efrat"
 }
 
 @article{fs-ptmmm-93
-, author =	"K. Fujimura and H. Samet"
-, title =	"Planning a Time-Minimal Motion among Moving Obstacles"
-, journal =	"Algorithmica"
-, volume =	10
-, year =	1993
-, pages =	"41--63"
-, update =	"96.05 efrat"
+, author =      "K. Fujimura and H. Samet"
+, title =       "Planning a Time-Minimal Motion among Moving Obstacles"
+, journal =     "Algorithmica"
+, volume =      10
+, year =        1993
+, pages =       "41--63"
+, update =      "96.05 efrat"
 }
 
 @techreport{fs-tmpmo-88
-, author =	"K. Fujimura and H. Samet"
-, title =	"Time-Minimal Paths Among Moving Obstacles"
-, type =	"Technical {Report}"
-, number =	"CS-TR-2124"
-, institution =	"Computer Science, Univ. of Maryland"
-, year =	1988
-, update =	"93.09 milone+mitchell"
+, author =      "K. Fujimura and H. Samet"
+, title =       "Time-Minimal Paths Among Moving Obstacles"
+, type =        "Technical {Report}"
+, number =      "CS-TR-2124"
+, institution = "Computer Science, Univ. of Maryland"
+, year =        1988
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{fs-tmpmo-89
-, author =	"K. Fujimura and H. Samet"
-, title =	"Time-Minimal Paths Among Moving Obstacles"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Scottsdale, Arizona"
-, month =	may
-, year =	1989
-, pages =	"1110--1115"
-, update =	"96.05 efrat"
+, author =      "K. Fujimura and H. Samet"
+, title =       "Time-Minimal Paths Among Moving Obstacles"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Scottsdale, Arizona"
+, month =       may
+, year =        1989
+, pages =       "1110--1115"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{ftyk-oasm-83
-, author =	"K. Fujimura and H. Toriya and K. Tamaguchi and T. L. Kunii"
-, title =	"Octree algorithms for solid modeling"
-, booktitle =	"Proc. Intergraphics '83"
-, volume =	"B2-1"
-, year =	1983
-, pages =	"1--15"
-, update =	"97.11 bibrelex"
+, author =      "K. Fujimura and H. Toriya and K. Tamaguchi and T. L. Kunii"
+, title =       "Octree algorithms for solid modeling"
+, booktitle =   "Proc. Intergraphics '83"
+, volume =      "B2-1"
+, year =        1983
+, pages =       "1--15"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ftyk-eotds-83
-, author =	"K. Fujimura and H. Toriya and K. Yamaguchi and T. L. Kunii"
-, title =	"An enhanced oct-tree data structure and operation for solid modeling"
-, booktitle =	"Proc. Comput. Aided Geom. Modeling Sympos."
-, site =	"Hampton"
-, month =	apr
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "K. Fujimura and H. Toriya and K. Yamaguchi and T. L. Kunii"
+, title =       "An enhanced oct-tree data structure and operation for solid modeling"
+, booktitle =   "Proc. Comput. Aided Geom. Modeling Sympos."
+, site =        "Hampton"
+, month =       apr
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{f-skgk-20
-, author =	"M. Fujiwara"
-, title =	"Ein Satz {\"uber} konvexe geschlosene Kurven"
-, journal =	"Sci. Repts. {T\^hoku} Univ."
-, volume =	9
-, year =	1920
-, pages =	"289--294"
-, update =	"98.11 bibrelex"
+, author =      "M. Fujiwara"
+, title =       "Ein Satz {\"uber} konvexe geschlosene Kurven"
+, journal =     "Sci. Repts. {T\^hoku} Univ."
+, volume =      9
+, year =        1920
+, pages =       "289--294"
+, update =      "98.11 bibrelex"
 }
 
 @article{fn-rtisa-90
-, author =	"H. Fujiware and K. Nakagawa"
-, title =	"Real-time image subtraction and addition using two cross-polarized phase-conjugate waves"
-, journal =	"Optics Commun."
-, volume =	79
-, number =	"1,2"
-, year =	1990
-, pages =	"6--10"
-, update =	"97.11 bibrelex"
+, author =      "H. Fujiware and K. Nakagawa"
+, title =       "Real-time image subtraction and addition using two cross-polarized phase-conjugate waves"
+, journal =     "Optics Commun."
+, volume =      79
+, number =      "1,2"
+, year =        1990
+, pages =       "6--10"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{fp-jtgp-89
-, author =	"Hidetosi Fukagawa and Dan Pedoe"
-, title =	"Japanese Temple Geometry Problems"
-, institution =	"The Charles Babbage Research Centre"
-, address =	"Winnipeg"
-, year =	1989
-, update =	"98.11 bibrelex"
+, author =      "Hidetosi Fukagawa and Dan Pedoe"
+, title =       "Japanese Temple Geometry Problems"
+, institution = "The Charles Babbage Research Centre"
+, address =     "Winnipeg"
+, year =        1989
+, update =      "98.11 bibrelex"
 }
 
 @incollection{fs-amgfe-72
-, author =	"J. Fukuda and J. Suhara"
-, title =	"Automatic Mesh Generation for Finite Element Analysis"
-, editor =	"J. T. Oden and R. W. Clough and Y. Yamamoto"
-, booktitle =	"Advances in Computational Methods in Structural Mechanics and Design"
-, publisher =	"UAU Press"
-, address =	"Hunstville, Alabama"
-, year =	1972
-, annote =	"Two phases. First randomly generates points in polygon
-		 to required density, then triangulates points by
-		 horribly complicated algorithm. Picks five points
-		 minimizing triangle edge length. Discards triangle
-		 intersecting or containing. Then picks point making
-		 this triangle and the next one as equilateral as
-		 possible."
+, author =      "J. Fukuda and J. Suhara"
+, title =       "Automatic Mesh Generation for Finite Element Analysis"
+, editor =      "J. T. Oden and R. W. Clough and Y. Yamamoto"
+, booktitle =   "Advances in Computational Methods in Structural Mechanics and Design"
+, publisher =   "UAU Press"
+, address =     "Hunstville, Alabama"
+, year =        1972
+, annote =      "Two phases. First randomly generates points in polygon
+                 to required density, then triangulates points by
+                 horribly complicated algorithm. Picks five points
+                 minimizing triangle edge length. Discards triangle
+                 intersecting or containing. Then picks point making
+                 this triangle and the next one as equilateral as
+                 possible."
 }
 
 @manual{f-crmv0-
-, author =	"K. Fukuda"
-, title =	"CDD Reference Manual, Version 0.52b"
-, organization =	"EPFL"
-, address =	"Lausanne, Switzerland"
-, update =	"98.03 bibrelex"
+, author =      "K. Fukuda"
+, title =       "CDD Reference Manual, Version 0.52b"
+, organization =        "EPFL"
+, address =     "Lausanne, Switzerland"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{f-omp-82
-, author =	"K. Fukuda"
-, title =	"Oriented Matroid Programming"
-, school =	"University of Waterloo"
-, year =	1982
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "K. Fukuda"
+, title =       "Oriented Matroid Programming"
+, school =      "University of Waterloo"
+, year =        1982
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @article{flm-abalv-97
-, author =	"K. Fukuda and T. Liebling and F. Margot"
-, title =	"Analysis of backtrack algorithms for listig all vertices and all faces of a convex polyhedron"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"1--12"
-, update =	"97.07 devillers"
+, author =      "K. Fukuda and T. Liebling and F. Margot"
+, title =       "Analysis of backtrack algorithms for listig all vertices and all faces of a convex polyhedron"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "1--12"
+, update =      "97.07 devillers"
 }
 
 @article{fll-ech-01
-, author =	"K. Fukuda and T. M. Liebling and C. L{\"u}tolf"
-, title =	"Extended convex hull"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	20
-, year =	2001
-, pages =	"13--23"
-, update =	"01.11 smid"
+, author =      "K. Fukuda and T. M. Liebling and C. L{\"u}tolf"
+, title =       "Extended convex hull"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      20
+, year =        2001
+, pages =       "13--23"
+, update =      "01.11 smid"
 }
 
 @article{fm-fccm-91
-, author =	"K. Fukuda and T. Matsui"
-, title =	"On the finiteness of the criss-cross method"
-, journal =	"European J. Oper. Res."
-, volume =	52
-, year =	1991
-, pages =	"119--124"
-, update =	"97.03 gaertner+salinger"
+, author =      "K. Fukuda and T. Matsui"
+, title =       "On the finiteness of the criss-cross method"
+, journal =     "European J. Oper. Res."
+, volume =      52
+, year =        1991
+, pages =       "119--124"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{fr-cfecp-94
-, author =	"K. Fukuda and V. Rosta"
-, title =	"Combinatorial face enumeration in convex polytopes"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"191--198"
-, update =	"96.09 devillers"
+, author =      "K. Fukuda and V. Rosta"
+, title =       "Combinatorial face enumeration in convex polytopes"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "191--198"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{fst-cfeao-89
-, author =	"K. Fukuda and S. Saito and A. Tamura"
-, title =	"Combinatorial face enumeration in arrangements and oriented matroids"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	4
-, precedes =	"fst-cfeao-91"
-, update =	"95.09 korneenko"
+, author =      "K. Fukuda and S. Saito and A. Tamura"
+, title =       "Combinatorial face enumeration in arrangements and oriented matroids"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       4
+, precedes =    "fst-cfeao-91"
+, update =      "95.09 korneenko"
 }
 
 @article{fst-cfeao-91
-, author =	"K. Fukuda and S. Saito and A. Tamura"
-, title =	"Combinatorial face enumeration in arrangements and oriented matroids"
-, journal =	"Discrete Appl. Math."
-, volume =	31
-, number =	2
-, year =	1991
-, pages =	"141--149"
-, keywords =	"comb, arrangement, sphereset, hyperplaneset, flat, matroid, $n$-dimensional"
-, succeeds =	"fst-cfeao-89"
-, update =	"95.09 korneenko"
+, author =      "K. Fukuda and S. Saito and A. Tamura"
+, title =       "Combinatorial face enumeration in arrangements and oriented matroids"
+, journal =     "Discrete Appl. Math."
+, volume =      31
+, number =      2
+, year =        1991
+, pages =       "141--149"
+, keywords =    "comb, arrangement, sphereset, hyperplaneset, flat, matroid, $n$-dimensional"
+, succeeds =    "fst-cfeao-89"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{fstt-bnkfa-89
-, author =	"K. Fukuda and S. Saito and A. Tamura and T. Tokuyama"
-, title =	"Bounding the number of $k$-faces in arrangements of hyperplanes"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	3
-, precedes =	"fstt-bnkfa-91"
-, update =	"97.11 bibrelex, 95.09 korneenko"
+, author =      "K. Fukuda and S. Saito and A. Tamura and T. Tokuyama"
+, title =       "Bounding the number of $k$-faces in arrangements of hyperplanes"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       3
+, precedes =    "fstt-bnkfa-91"
+, update =      "97.11 bibrelex, 95.09 korneenko"
 }
 
 @article{fstt-bnkfa-91
-, author =	"K. Fukuda and S. Saito and A. Tamura and T. Tokuyama"
-, title =	"Bounding the number of $k$-faces in arrangements of hyperplanes"
-, journal =	"Discrete Appl. Math."
-, volume =	31
-, number =	2
-, year =	1991
-, pages =	"151--165"
-, keywords =	"comb, arrangement, hyperplaneset, flat, sphereset, matroid, face, $n$-dimensional"
-, succeeds =	"fstt-bnkfa-89"
-, update =	"97.11 bibrelex, 95.09 korneenko"
+, author =      "K. Fukuda and S. Saito and A. Tamura and T. Tokuyama"
+, title =       "Bounding the number of $k$-faces in arrangements of hyperplanes"
+, journal =     "Discrete Appl. Math."
+, volume =      31
+, number =      2
+, year =        1991
+, pages =       "151--165"
+, keywords =    "comb, arrangement, hyperplaneset, flat, sphereset, matroid, face, $n$-dimensional"
+, succeeds =    "fstt-bnkfa-89"
+, update =      "97.11 bibrelex, 95.09 korneenko"
 }
 
 @article{fn-bback-75
-, author =	"K. Fukunaga and P. M. Narendra"
-, title =	"A branch and bound algorithm for computing $k$-nearest neighbors"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-24"
-, year =	1975
-, pages =	"750--753"
+, author =      "K. Fukunaga and P. M. Narendra"
+, title =       "A branch and bound algorithm for computing $k$-nearest neighbors"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-24"
+, year =        1975
+, pages =       "750--753"
 }
 
 @article{f-ipcfc-74
-, author =	"B. E. Fullbright"
-, title =	"Intersectional properties of certain families of compact convex sets"
-, journal =	"Pacific J. Math."
-, volume =	50
-, year =	1974
-, pages =	"57--62"
-, update =	"97.11 bibrelex"
+, author =      "B. E. Fullbright"
+, title =       "Intersectional properties of certain families of compact convex sets"
+, journal =     "Pacific J. Math."
+, volume =      50
+, year =        1974
+, pages =       "57--62"
+, update =      "97.11 bibrelex"
 }
 
 @book{f-it-84
-, author =	"W. Fulton"
-, title =	"Intersection Theory"
-, publisher =	"Springer-Verlag"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "W. Fulton"
+, title =       "Intersection Theory"
+, publisher =   "Springer-Verlag"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @techreport{fntv-sltjs-88
-, author =	"K. Y. Fung and T. M. Nicholl and R. E. Tarjan and C. J. {Van Wyk}"
-, title =	"Simplified linear-time {Jordan} sorting and polygon clipping"
-, type =	"Technical {Report}"
-, number =	"CS-TR-189-88"
-, institution =	"Dept. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1988
-, precedes =	"fntv-sltjs-90"
+, author =      "K. Y. Fung and T. M. Nicholl and R. E. Tarjan and C. J. {Van Wyk}"
+, title =       "Simplified linear-time {Jordan} sorting and polygon clipping"
+, type =        "Technical {Report}"
+, number =      "CS-TR-189-88"
+, institution = "Dept. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1988
+, precedes =    "fntv-sltjs-90"
 }
 
 @article{fntv-sltjs-90
-, author =	"K. Y. Fung and T. M. Nicholl and R. E. Tarjan and C. J. {Van Wyk}"
-, title =	"Simplified linear-time {Jordan} sorting and polygon clipping"
-, journal =	"Inform. Process. Lett."
-, volume =	35
-, year =	1990
-, pages =	"85--92"
-, succeeds =	"fntv-sltjs-88"
+, author =      "K. Y. Fung and T. M. Nicholl and R. E. Tarjan and C. J. {Van Wyk}"
+, title =       "Simplified linear-time {Jordan} sorting and polygon clipping"
+, journal =     "Inform. Process. Lett."
+, volume =      35
+, year =        1990
+, pages =       "85--92"
+, succeeds =    "fntv-sltjs-88"
 }
 
 @inproceedings{fm-llook-00
-, author =	"Stefan Funke and Kurt Mehlhorn"
-, title =	"LOOK: A Lazy Object-Oriented Kernel for Geometric Computation"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"156--165"
-, update =	"00.11 jones"
+, author =      "Stefan Funke and Kurt Mehlhorn"
+, title =       "LOOK: A Lazy Object-Oriented Kernel for Geometric Computation"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "156--165"
+, update =      "00.11 jones"
 }
 
 @inproceedings{fst-mladi-92
-, author =	"T. Funkhouser and C. S{\'e}quin and S. Teller"
-, title =	"Management of Large Amounts of Data in Interactive Building Walkthroughs"
-, booktitle =	"Proc. 1992 Workshop on Interactive 3D Graphics"
-, year =	1992
-, pages =	"11--20"
-, update =	"97.11 bibrelex"
+, author =      "T. Funkhouser and C. S{\'e}quin and S. Teller"
+, title =       "Management of Large Amounts of Data in Interactive Building Walkthroughs"
+, booktitle =   "Proc. 1992 Workshop on Interactive 3D Graphics"
+, year =        1992
+, pages =       "11--20"
+, update =      "97.11 bibrelex"
 }
 
 @article{f-rpddc-86
-, author =	"Z. F{\"u}redi"
-, title =	"Random polytopes in the $d$-dimensional cube"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"315--319"
+, author =      "Z. F{\"u}redi"
+, title =       "Random polytopes in the $d$-dimensional cube"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "315--319"
 }
 
 @article{f-dpecp-91
-, author =	"Z. F{\"u}redi"
-, title =	"The densest packing of equal circles into a parallel strip"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"95--106"
+, author =      "Z. F{\"u}redi"
+, title =       "The densest packing of equal circles into a parallel strip"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "95--106"
 }
 
 @article{f-mnudc-90
-, author =	"Z. F{\"u}redi"
-, title =	"The maximum number of unit distances in a convex $n$-gon"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	55
-, year =	1990
-, pages =	"316--320"
-, keywords =	"combinatorial geometry, convex"
+, author =      "Z. F{\"u}redi"
+, title =       "The maximum number of unit distances in a convex $n$-gon"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      55
+, year =        1990
+, pages =       "316--320"
+, keywords =    "combinatorial geometry, convex"
 }
 
 @techreport{fh-dstm-89
-, author =	"Z. F{\"u}redi and P. Hajnal"
-, title =	"Davenport-Schinzel Theory of Matrices"
-, type =	"Technical {Report}"
-, institution =	"DIMACS, Rutgers Univ."
-, year =	1989
-, update =	"95.09 agarwal, 93.09 milone+mitchell"
+, author =      "Z. F{\"u}redi and P. Hajnal"
+, title =       "Davenport-Schinzel Theory of Matrices"
+, type =        "Technical {Report}"
+, institution = "DIMACS, Rutgers Univ."
+, year =        1989
+, update =      "95.09 agarwal, 93.09 milone+mitchell"
 }
 
 @article{fh-dstm-92
-, author =	"Z. F{\"u}redi and P. Hajnal"
-, title =	"{Davenport}-{Schinzel} Theory of Matrices"
-, journal =	"Discrete Math."
-, volume =	103
-, year =	1992
-, pages =	"233--251"
-, update =	"95.09 agarwal, 93.09 milone+mitchell"
+, author =      "Z. F{\"u}redi and P. Hajnal"
+, title =       "{Davenport}-{Schinzel} Theory of Matrices"
+, journal =     "Discrete Math."
+, volume =      103
+, year =        1992
+, pages =       "233--251"
+, update =      "95.09 agarwal, 93.09 milone+mitchell"
 }
 
 @article{fk-pyp-94
-, author =	"Z. {F\"uredi} and D. Kleitman"
-, title =	"The prison yard problem"
-, journal =	"Combinatorica"
-, volume =	14
-, year =	1994
-, pages =	"287--300"
-, update =	"97.07 orourke"
+, author =      "Z. {F\"uredi} and D. Kleitman"
+, title =       "The prison yard problem"
+, journal =     "Combinatorica"
+, volume =      14
+, year =        1994
+, pages =       "287--300"
+, update =      "97.07 orourke"
 }
 
 @inproceedings{fhkr-owpas-92
-, author =	"M. F{\"u}rer and X. He and M.-Y. Kao and B. Raghavachari"
-, title =	"${O}(n \log\log n)$-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs"
-, booktitle =	"Proc. ACM Sympos. Parallel Algorithms Architect."
-, year =	1992
-, pages =	"410--419"
-, keywords =	"graph drawing, planar, straight-line, grid, parallel"
-, update =	"96.09 tamassia"
+, author =      "M. F{\"u}rer and X. He and M.-Y. Kao and B. Raghavachari"
+, title =       "${O}(n \log\log n)$-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs"
+, booktitle =   "Proc. ACM Sympos. Parallel Algorithms Architect."
+, year =        1992
+, pages =       "410--419"
+, keywords =    "graph drawing, planar, straight-line, grid, parallel"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{fr-amdst-92
-, author =	"M. Furer and B. Raghavachari"
-, title =	"Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '92"
-, year =	1992
-, pages =	"317--324"
-, update =	"99.07 bibrelex, 98.07 bibrelex"
+, author =      "M. Furer and B. Raghavachari"
+, title =       "Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '92"
+, year =        1992
+, pages =       "317--324"
+, update =      "99.07 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{fhl-ptapg-80
-, author =	"M. Furst and J. Hopcroft and E. Luks"
-, title =	"Polynomial Time Algorithm for Permutation Groups"
-, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1980
-, pages =	"36--41"
-, update =	"97.11 bibrelex"
+, author =      "M. Furst and J. Hopcroft and E. Luks"
+, title =       "Polynomial Time Algorithm for Permutation Groups"
+, booktitle =   "Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1980
+, pages =       "36--41"
+, update =      "97.11 bibrelex"
 }
 
 @article{fa-rcfsc-96
-, author =	"M. Furukata and K. Asano"
-, title =	"Reporting the crossing-free segments of a complete graph"
-, journal =	"Internat. J. Comput. Math."
-, volume =	62
-, year =	1996
-, pages =	"163--170"
-, update =	"97.03 smid"
+, author =      "M. Furukata and K. Asano"
+, title =       "Reporting the crossing-free segments of a complete graph"
+, journal =     "Internat. J. Comput. Math."
+, volume =      62
+, year =        1996
+, pages =       "163--170"
+, update =      "97.03 smid"
 }
 
 @article{frt-ftclr-93
-, author =	"D. Fussell and V. Ramachandran and R. Thurimella"
-, title =	"Finding Triconnected Components by Local Replacement"
-, journal =	"SIAM J. Comput."
-, volume =	26
-, number =	3
-, year =	1993
-, pages =	"587--616"
-, keywords =	"parallel algorithm, triconnectivity, PRAM, graph, vertex connectivity"
-, succeeds =	"frt-ftclr-89"
-, update =	"98.07 patrignani"
+, author =      "D. Fussell and V. Ramachandran and R. Thurimella"
+, title =       "Finding Triconnected Components by Local Replacement"
+, journal =     "SIAM J. Comput."
+, volume =      26
+, number =      3
+, year =        1993
+, pages =       "587--616"
+, keywords =    "parallel algorithm, triconnectivity, PRAM, graph, vertex connectivity"
+, succeeds =    "frt-ftclr-89"
+, update =      "98.07 patrignani"
 }
 
 @inproceedings{frt-ftclr-89
-, author =	"D. Fussell and V. Ramachandran and R. Thurimella"
-, title =	"Finding Triconnected Components by Local Replacements"
-, booktitle =	"Automata, Languages and Programming (Proc. 16th ICALP)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	372
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"379--393"
-, precedes =	"frt-ftclr-93"
-, update =	"98.07 patrignani, 96.05 agarwal, 95.01 tamassia"
+, author =      "D. Fussell and V. Ramachandran and R. Thurimella"
+, title =       "Finding Triconnected Components by Local Replacements"
+, booktitle =   "Automata, Languages and Programming (Proc. 16th ICALP)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      372
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "379--393"
+, precedes =    "frt-ftclr-93"
+, update =      "98.07 patrignani, 96.05 agarwal, 95.01 tamassia"
 }
 
 @inproceedings{ghs-rcgpt-85
-, author =	"C. P. Gabor and W.-L. Hsu and K. J. Supowit"
-, title =	"Recognizing circle graphs in polynomial time"
-, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"106--116"
-, keywords =	"circles, graph theory"
-, precedes =	"ghs-rcgpt-89"
+, author =      "C. P. Gabor and W.-L. Hsu and K. J. Supowit"
+, title =       "Recognizing circle graphs in polynomial time"
+, booktitle =   "Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "106--116"
+, keywords =    "circles, graph theory"
+, precedes =    "ghs-rcgpt-89"
 }
 
 @article{ghs-rcgpt-89
-, author =	"C. P. Gabor and W.-L. Hsu and K. J. Supowit"
-, title =	"Recognizing circle graphs in polynomial time"
-, journal =	"J. ACM"
-, volume =	36
-, year =	1989
-, pages =	"435--473"
-, succeeds =	"ghs-rcgpt-85"
+, author =      "C. P. Gabor and W.-L. Hsu and K. J. Supowit"
+, title =       "Recognizing circle graphs in polynomial time"
+, journal =     "J. ACM"
+, volume =      36
+, year =        1989
+, pages =       "435--473"
+, succeeds =    "ghs-rcgpt-85"
 }
 
 @inproceedings{gt-ltasc-83
-, author =	"H. Gabow and R. Tarjan"
-, title =	"A linear time algorithm for a special case of disjoint set union"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
-, year =	1983
-, pages =	"246--251"
-, update =	"98.07 bibrelex"
+, author =      "H. Gabow and R. Tarjan"
+, title =       "A linear time algorithm for a special case of disjoint set union"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Theory Comput."
+, year =        1983
+, pages =       "246--251"
+, update =      "98.07 bibrelex"
 }
 
 @article{gt-ltasc-85
-, author =	"H. Gabow and R. Tarjan"
-, title =	"A linear time algorithm for a special case of disjoint set union"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	30
-, year =	1985
-, pages =	"209--221"
-, update =	"97.11 bibrelex"
+, author =      "H. Gabow and R. Tarjan"
+, title =       "A linear time algorithm for a special case of disjoint set union"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      30
+, year =        1985
+, pages =       "209--221"
+, update =      "97.11 bibrelex"
 }
 
 @article{gt-fsanp-89
-, author =	"H. Gabow and R. Tarjan"
-, title =	"Faster scaling algorithms for network problems"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, year =	1989
-, pages =	"1013--1036"
-, update =	"97.11 bibrelex"
+, author =      "H. Gabow and R. Tarjan"
+, title =       "Faster scaling algorithms for network problems"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, year =        1989
+, pages =       "1013--1036"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gbt-srtgp-84
-, author =	"H. N. Gabow and J. L. Bentley and R. E. Tarjan"
-, title =	"Scaling and related techniques for geometry problems"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"135--143"
+, author =      "H. N. Gabow and J. L. Bentley and R. E. Tarjan"
+, title =       "Scaling and related techniques for geometry problems"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "135--143"
 }
 
 @article{ggst-eamst-86
-, author =	"H. N. Gabow and Z. Galil and T. H. Spencer and R. E. Tarjan"
-, title =	"Efficient Algorithms for Minimum Spanning Trees on Directed and Undirected Graphs"
-, journal =	"Combinatorica"
-, volume =	6
-, year =	1986
-, pages =	"109--122"
-, update =	"97.11 bibrelex"
+, author =      "H. N. Gabow and Z. Galil and T. H. Spencer and R. E. Tarjan"
+, title =       "Efficient Algorithms for Minimum Spanning Trees on Directed and Undirected Graphs"
+, journal =     "Combinatorica"
+, volume =      6
+, year =        1986
+, pages =       "109--122"
+, update =      "97.11 bibrelex"
 }
 
 @article{gt-ltafm-88
-, author =	"H. N. Gabow and R. E. Tarjan"
-, title =	"A linear-time algorithm for finding a minimum spanning pseudoforest"
-, journal =	"Inform. Process. Lett."
-, volume =	27
-, year =	1988
-, pages =	"259--263"
-, update =	"98.07 bibrelex"
+, author =      "H. N. Gabow and R. E. Tarjan"
+, title =       "A linear-time algorithm for finding a minimum spanning pseudoforest"
+, journal =     "Inform. Process. Lett."
+, volume =      27
+, year =        1988
+, pages =       "259--263"
+, update =      "98.07 bibrelex"
 }
 
 @article{gs-nsagv-69
-, author =	"K. R. Gabriel and R. R. Sokal"
-, title =	"A new statistical approach to geographic variation analysis"
-, journal =	"Systematic Zoology"
-, volume =	18
-, year =	1969
-, pages =	"259--278"
+, author =      "K. R. Gabriel and R. R. Sokal"
+, title =       "A new statistical approach to geographic variation analysis"
+, journal =     "Systematic Zoology"
+, volume =      18
+, year =        1969
+, pages =       "259--278"
 }
 
 @article{gv-cssps-95
-, author =	"A. Gabrielov and N. Vorobjov"
-, title =	"Complexity of stratification of semi-pfaffian sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	14
-, year =	1995
-, pages =	"71--91"
-, update =	"98.03 agarwal"
+, author =      "A. Gabrielov and N. Vorobjov"
+, title =       "Complexity of stratification of semi-pfaffian sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      14
+, year =        1995
+, pages =       "71--91"
+, update =      "98.03 agarwal"
 }
 
 @techreport{gz-fgnim-86
-, author =	"M. E. Gaddis and M. J. Zyda"
-, title =	"The fractal geometry of nature: its mathematical basis and application to computer graphics"
-, type =	"Report"
-, number =	"NPS52-86-008"
-, institution =	"Naval Postgraduate School"
-, address =	"Monterey, CA"
-, year =	1986
+, author =      "M. E. Gaddis and M. J. Zyda"
+, title =       "The fractal geometry of nature: its mathematical basis and application to computer graphics"
+, type =        "Report"
+, number =      "NPS52-86-008"
+, institution = "Naval Postgraduate School"
+, address =     "Monterey, CA"
+, year =        1986
 }
 
 @inproceedings{g-prpt-93
-, author =	"Noud Gademann"
-, title =	"Linear Programming in Random Polynomial Time"
-, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
-, month =	jun
-, year =	1993
-, pages =	"??"
-, update =	"00.03 devillers, 93.09 milone+mitchell"
+, author =      "Noud Gademann"
+, title =       "Linear Programming in Random Polynomial Time"
+, booktitle =   "Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
+, month =       jun
+, year =        1993
+, pages =       "??"
+, update =      "00.03 devillers, 93.09 milone+mitchell"
 }
 
 @article{gg-mam-98
-, author =	"V. Gaede and O. G{\"u}nther"
-, title =	"Multidimensional Access Methods"
-, journal =	"ACM Comput. Surv."
-, volume =	30
-, year =	1998
-, pages =	"170--231"
-, keywords =	"survey paper"
-, update =	"98.11 pocchiola"
+, author =      "V. Gaede and O. G{\"u}nther"
+, title =       "Multidimensional Access Methods"
+, journal =     "ACM Comput. Surv."
+, volume =      30
+, year =        1998
+, pages =       "170--231"
+, keywords =    "survey paper"
+, update =      "98.11 pocchiola"
 }
 
 @techreport{go-nhpcg-93t
-, author =	"A. Gajentaan and M. Overmars"
-, title =	"$n^2$-Hard Problems in Computational Geometry"
-, type =	"manuscript"
-, year =	1993
-, precedes =	"go-nhpcg-93, go-copcg-95"
-, update =	"98.11 bibrelex"
+, author =      "A. Gajentaan and M. Overmars"
+, title =       "$n^2$-Hard Problems in Computational Geometry"
+, type =        "manuscript"
+, year =        1993
+, precedes =    "go-nhpcg-93, go-copcg-95"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{go-nhpcg-93
-, author =	"A. Gajentaan and M. H. Overmars"
-, title =	"$n^2$-Hard Problems in Computational Geometry"
-, type =	"Report"
-, number =	"RUU-CS-93-15"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, month =	apr
-, year =	1993
-, succeeds =	"go-nhpcg-93t"
-, update =	"98.11 bibrelex, 93.09 erickson+goodrich+milone+mitchell"
+, author =      "A. Gajentaan and M. H. Overmars"
+, title =       "$n^2$-Hard Problems in Computational Geometry"
+, type =        "Report"
+, number =      "RUU-CS-93-15"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, month =       apr
+, year =        1993
+, succeeds =    "go-nhpcg-93t"
+, update =      "98.11 bibrelex, 93.09 erickson+goodrich+milone+mitchell"
 }
 
 @article{go-copcg-95
-, author =	"A. Gajentaan and M. H. Overmars"
-, title =	"On a class of ${O}(n^2)$ problems in computational geometry"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"165--185"
-, succeeds =	"go-nhpcg-93t"
-, update =	"99.07 smid, 98.11 bibrelex, 96.01 smid"
+, author =      "A. Gajentaan and M. H. Overmars"
+, title =       "On a class of ${O}(n^2)$ problems in computational geometry"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "165--185"
+, succeeds =    "go-nhpcg-93t"
+, update =      "99.07 smid, 98.11 bibrelex, 96.01 smid"
 }
 
 @incollection{g-csg-89
-, author =	"Shmuel Gal"
-, title =	"Continous Search Games"
-, booktitle =	"Search theory: some recent developments."
-, series =	"Lecture Notes in pure and applied mathematics"
-, volume =	112
-, publisher =	"Dekker"
-, address =	"New York, NY"
-, year =	1989
-, pages =	"33--53"
-, update =	"00.03 bibrelex"
+, author =      "Shmuel Gal"
+, title =       "Continous Search Games"
+, booktitle =   "Search theory: some recent developments."
+, series =      "Lecture Notes in pure and applied mathematics"
+, volume =      112
+, publisher =   "Dekker"
+, address =     "New York, NY"
+, year =        1989
+, pages =       "33--53"
+, update =      "00.03 bibrelex"
 }
 
 @book{g-sg-80
-, author =	"Shmuel Gal"
-, title =	"Search Games"
-, series =	"Mathematics in Science and Engeneering"
-, volume =	149
-, publisher =	"Academic Press"
-, address =	"New York"
-, year =	1980
-, update =	"98.07 bibrelex+icking"
+, author =      "Shmuel Gal"
+, title =       "Search Games"
+, series =      "Mathematics in Science and Engeneering"
+, volume =      149
+, publisher =   "Academic Press"
+, address =     "New York"
+, year =        1980
+, update =      "98.07 bibrelex+icking"
 }
 
 @article{g-hsli-69
-, author =	"D. Gala"
-, title =	"How to solve linear inequalities"
-, journal =	"Amer. Math. Monthly"
-, volume =	76
-, year =	1969
-, pages =	"589--599"
-, update =	"93.09 milone+mitchell"
+, author =      "D. Gala"
+, title =       "How to solve linear inequalities"
+, journal =     "Amer. Math. Monthly"
+, volume =      76
+, year =        1969
+, pages =       "589--599"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{g-cpcli-51
-, author =	"D. Gale"
-, title =	"Convex Polyhedral Cones and Linear Inequalities"
-, journal =	"Cowles Commission Monograph"
-, volume =	13
-, year =	1951
-, pages =	"287--297"
-, update =	"97.11 bibrelex"
+, author =      "D. Gale"
+, title =       "Convex Polyhedral Cones and Linear Inequalities"
+, journal =     "Cowles Commission Monograph"
+, volume =      13
+, year =        1951
+, pages =       "287--297"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{g-ncp-63
-, author =	"D. Gale"
-, title =	"Neighborly and cyclic polytopes"
-, editor =	"V. Klee"
-, booktitle =	"Convexity"
-, series =	"Proc. Symp. Pure Math."
-, volume =	7
-, publisher =	"American Mathematical Society"
-, year =	1963
-, pages =	"225--232"
-, update =	"97.11 bibrelex"
+, author =      "D. Gale"
+, title =       "Neighborly and cyclic polytopes"
+, editor =      "V. Klee"
+, booktitle =   "Convexity"
+, series =      "Proc. Symp. Pure Math."
+, volume =      7
+, publisher =   "American Mathematical Society"
+, year =        1963
+, pages =       "225--232"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{g-namfp-87
-, author =	"Z. Galil"
-, title =	"A new algorithm for the maximal flow problem"
-, booktitle =	"Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
-, month =	oct
-, year =	1987
-, pages =	"231--245"
-, update =	"98.03 bibrelex"
+, author =      "Z. Galil"
+, title =       "A new algorithm for the maximal flow problem"
+, booktitle =   "Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
+, month =       oct
+, year =        1987
+, pages =       "231--245"
+, update =      "98.03 bibrelex"
 }
 
 @article{gg-sudpa-89
-, author =	"Z. Galil and R. Giancarlo"
-, title =	"Speeding Up Dynamic Programming with Applications to Molecular Biology"
-, journal =	"Theoret. Comput. Sci."
-, volume =	64
-, year =	1989
-, pages =	"107--118"
+, author =      "Z. Galil and R. Giancarlo"
+, title =       "Speeding Up Dynamic Programming with Applications to Molecular Biology"
+, journal =     "Theoret. Comput. Sci."
+, volume =      64
+, year =        1989
+, pages =       "107--118"
 }
 
 @article{gi-dsads-91
-, author =	"Z. Galil and G. F. Italiano"
-, title =	"Data Structures and Algorithms for Disjoint Set Union Problems"
-, journal =	"ACM Comput. Surv."
-, volume =	23
-, number =	3
-, year =	1991
-, pages =	"319--344"
-, update =	"97.03 tamassia"
+, author =      "Z. Galil and G. F. Italiano"
+, title =       "Data Structures and Algorithms for Disjoint Set Union Problems"
+, journal =     "ACM Comput. Surv."
+, volume =      23
+, number =      3
+, year =        1991
+, pages =       "319--344"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{gi-fdaec-91
-, author =	"Z. Galil and G. F. Italiano"
-, title =	"Fully Dynamic Algorithms for Edge Connectivity Problems"
-, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
-, year =	1991
-, pages =	"317--327"
-, update =	"98.07 tamassia+vismara, 94.01 tamassia"
+, author =      "Z. Galil and G. F. Italiano"
+, title =       "Fully Dynamic Algorithms for Edge Connectivity Problems"
+, booktitle =   "Proc. 23rd Annu. ACM Sympos. Theory Comput."
+, year =        1991
+, pages =       "317--327"
+, update =      "98.07 tamassia+vismara, 94.01 tamassia"
 }
 
 @inproceedings{gi-mbcdp-91
-, author =	"Z. Galil and G. F. Italiano"
-, title =	"Maintaining Biconnected Components of Dynamic Planar Graphs"
-, booktitle =	"Proc. 18th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	510
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"339--350"
-, update =	"93.09 rote"
+, author =      "Z. Galil and G. F. Italiano"
+, title =       "Maintaining Biconnected Components of Dynamic Planar Graphs"
+, booktitle =   "Proc. 18th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      510
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "339--350"
+, update =      "93.09 rote"
 }
 
 @inproceedings{gis-fdpt-92
-, author =	"Z. Galil and G. F. Italiano and N. Sarnak"
-, title =	"Fully dynamic planarity testing"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"495--506"
+, author =      "Z. Galil and G. F. Italiano and N. Sarnak"
+, title =       "Fully dynamic planarity testing"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "495--506"
 }
 
 @article{gm-fsapo-79
-, author =	"Z. Galil and N. Megiddo"
-, title =	"A fast selection algorithm and the problem of optimum distribution of effort"
-, journal =	"J. ACM"
-, volume =	26
-, year =	1979
-, pages =	"58--64"
-, update =	"98.07 mitchell, 97.11 bibrelex"
+, author =      "Z. Galil and N. Megiddo"
+, title =       "A fast selection algorithm and the problem of optimum distribution of effort"
+, journal =     "J. ACM"
+, volume =      26
+, year =        1979
+, pages =       "58--64"
+, update =      "98.07 mitchell, 97.11 bibrelex"
 }
 
 @article{gm-ahle-69
-, author =	"R. Galimberti and U. Montanari"
-, title =	"An algorithm for hidden-line elimination"
-, journal =	"Commun. ACM"
-, volume =	12
-, year =	1969
-, pages =	206
+, author =      "R. Galimberti and U. Montanari"
+, title =       "An algorithm for hidden-line elimination"
+, journal =     "Commun. ACM"
+, volume =      12
+, year =        1969
+, pages =       206
 }
 
 @techreport{gk-mpcd2-84
-, author =	"V. V. Galitsky and A. A. Kzylov"
-, title =	"Modelling of plant community dynamics: $2$-d model of one-species even-aged community"
-, type =	"Report"
-, number =	"??"
-, institution =	"Sci. Center Sislogical Res., Inst. Soil Sci. Photosynthesis, USSR Acad. Sci."
-, year =	1984
-, pages =	"480--485"
+, author =      "V. V. Galitsky and A. A. Kzylov"
+, title =       "Modelling of plant community dynamics: $2$-d model of one-species even-aged community"
+, type =        "Report"
+, number =      "??"
+, institution = "Sci. Center Sislogical Res., Inst. Soil Sci. Photosynthesis, USSR Acad. Sci."
+, year =        1984
+, pages =       "480--485"
 }
 
 @techreport{gm-vmpca-81
-, author =	"V. V. Galitsky and E. V. Mironenko"
-, title =	"Voronoi {Mosaic} on the plane, construction algorithm: materials on software"
-, type =	"Report"
-, number =	"??"
-, institution =	"Sci. Center Sislogical Res., Inst. Soil Sci. Photosynthesis, USSR Acad. Sci."
-, year =	1981
+, author =      "V. V. Galitsky and E. V. Mironenko"
+, title =       "Voronoi {Mosaic} on the plane, construction algorithm: materials on software"
+, type =        "Report"
+, number =      "??"
+, institution = "Sci. Center Sislogical Res., Inst. Soil Sci. Photosynthesis, USSR Acad. Sci."
+, year =        1981
 }
 
 @article{g-spn4-44
-, author =	"T. Gallai"
-, title =	"Solution to Problem No 4065"
-, journal =	"Amer. Math. Monthly"
-, volume =	51
-, year =	1944
-, pages =	"169--171"
-, succeeds =	"e-pn4-44"
-, update =	"98.07 devillers"
+, author =      "T. Gallai"
+, title =       "Solution to Problem No 4065"
+, journal =     "Amer. Math. Monthly"
+, volume =      51
+, year =        1944
+, pages =       "169--171"
+, succeeds =    "e-pn4-44"
+, update =      "98.07 devillers"
 }
 
 @article{gf-iea-64
-, author =	"B. A. Galler and M. J. Fischer"
-, title =	"An Improved Equivalence Algorithm"
-, journal =	"Commun. ACM"
-, volume =	7
-, year =	1964
-, pages =	"301--303"
-, update =	"98.03 bibrelex"
+, author =      "B. A. Galler and M. J. Fischer"
+, title =       "An Improved Equivalence Algorithm"
+, journal =     "Commun. ACM"
+, volume =      7
+, year =        1964
+, pages =       "301--303"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{g-dcrs-97
-, author =	"J. Gallier"
-, title =	"Drawing closed rational surfaces"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"370--372"
-, cites =	"a-tdmrt-41, br-tdarp-94, br-frrpc-95, b-g-87, f-cscag-93, f-ncspg-95, fj-cesr-89, fj-csr-92, g-adcrs-96, g-csgai-97, hl-cagd-93, r-bcdas-87, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "J. Gallier"
+, title =       "Drawing closed rational surfaces"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "370--372"
+, cites =       "a-tdmrt-41, br-tdarp-94, br-frrpc-95, b-g-87, f-cscag-93, f-ncspg-95, fj-cesr-89, fj-csr-92, g-adcrs-96, g-csgai-97, hl-cagd-93, r-bcdas-87, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @techreport{g-adcrs-96
-, author =	"J. H. Gallier"
-, title =	"Algorithms for drawing closed rational surfaces"
-, type =	"Technical {Report}"
-, institution =	"Univ. Pennsylvania"
-, address =	"Philadelphia, PA"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "J. H. Gallier"
+, title =       "Algorithms for drawing closed rational surfaces"
+, type =        "Technical {Report}"
+, institution = "Univ. Pennsylvania"
+, address =     "Philadelphia, PA"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @techreport{g-csgai-97
-, author =	"J. H. Gallier"
-, title =	"Curves and surfaces: {Geometry}, algorithms, and implementation in {Mathematica}"
-, type =	"Technical {Report}"
-, institution =	"Univ. Pennsylvania"
-, address =	"Philadelphia, PA"
-, year =	1997
-, update =	"98.07 bibrelex"
+, author =      "J. H. Gallier"
+, title =       "Curves and surfaces: {Geometry}, algorithms, and implementation in {Mathematica}"
+, type =        "Technical {Report}"
+, institution = "Univ. Pennsylvania"
+, address =     "Philadelphia, PA"
+, year =        1997
+, update =      "98.07 bibrelex"
 }
 
 @article{ggt-fpmfa-89
-, author =	"G. Gallo and M. D. Grigoriadis and R. E. Tarjan"
-, title =	"A fast parametric maximum flow algorithm"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, year =	1989
-, pages =	"30--55"
-, update =	"97.11 bibrelex"
+, author =      "G. Gallo and M. D. Grigoriadis and R. E. Tarjan"
+, title =       "A fast parametric maximum flow algorithm"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, year =        1989
+, pages =       "30--55"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{gm-eabwr-91
-, author =	"G. Gallo and B. Mishra"
-, title =	"Efficient algorithms and bounds for {Wu}-{Ritt} characteristic sets"
-, editor =	"T. Mora and C. Traverso"
-, booktitle =	"Effective Methods on Algebraic Geometry"
-, series =	"Progress in Mathematics"
-, volume =	94
-, publisher =	"Birkh{\"a}user"
-, year =	1991
-, pages =	"119--142"
-, update =	"98.03 bibrelex"
+, author =      "G. Gallo and B. Mishra"
+, title =       "Efficient algorithms and bounds for {Wu}-{Ritt} characteristic sets"
+, editor =      "T. Mora and C. Traverso"
+, booktitle =   "Effective Methods on Algebraic Geometry"
+, series =      "Progress in Mathematics"
+, volume =      94
+, publisher =   "Birkh{\"a}user"
+, year =        1991
+, pages =       "119--142"
+, update =      "98.03 bibrelex"
 }
 
 @article{gkt-lioppb-95
-, author =	"G. Galperin and T. Kr{\"u}ger and S. Troubetzkoy"
-, title =	"Local instability of orbits in polygonal and polyhedral billiards"
-, journal =	"Commun. Math. Phys."
-, volume =	169
-, year =	1995
-, pages =	"463--473"
-, update =	"01.04 orourke"
+, author =      "G. Galperin and T. Kr{\"u}ger and S. Troubetzkoy"
+, title =       "Local instability of orbits in polygonal and polyhedral billiards"
+, journal =     "Commun. Math. Phys."
+, volume =      169
+, year =        1995
+, pages =       "463--473"
+, update =      "01.04 orourke"
 }
 
 @inproceedings{gg-pwmsp-96
-, author =	"Jerome Galtier and Paul Louis George"
-, title =	"Prepartitioning as a way to mesh subdomains in parallel"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"107--121"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Jerome Galtier and Paul Louis George"
+, title =       "Prepartitioning as a way to mesh subdomains in parallel"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "107--121"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @inproceedings{gp-pfpt-99
-, author =	"J{\'e}r{\^o}me Galtier and St{\'e}phane Perennes"
-, title =	"Parallel Flips on Planar Triangulations"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"81--86"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "J{\'e}r{\^o}me Galtier and St{\'e}phane Perennes"
+, title =       "Parallel Flips on Planar Triangulations"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "81--86"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @misc{ghj-gpma-67
-, author =	"R. Gambini and D. L. Huff and G. F. Jenks"
-, title =	"Geometric properties of market areas"
-, howpublished =	"Regional Science Association: Papers"
-, year =	1967
-, update =	"97.11 bibrelex"
+, author =      "R. Gambini and D. L. Huff and G. F. Jenks"
+, title =       "Geometric properties of market areas"
+, howpublished =        "Regional Science Association: Papers"
+, year =        1967
+, update =      "97.11 bibrelex"
 }
 
 @techreport{gt-amatd-85
-, author =	"G. Gambosi and M. Talamo"
-, title =	"An application of $m$-ary trees to the design of data structures for geometric searching problems"
-, type =	"Report"
-, number =	"??"
-, institution =	"Centro Nazionale Ricerche, Instituto Analisi Sistemi Inform."
-, year =	1985
+, author =      "G. Gambosi and M. Talamo"
+, title =       "An application of $m$-ary trees to the design of data structures for geometric searching problems"
+, type =        "Report"
+, number =      "??"
+, institution = "Centro Nazionale Ricerche, Instituto Analisi Sistemi Inform."
+, year =        1985
 }
 
 @book{ghjv-dp-95
-, author =	"Erich Gamma and Richard Helm and Ralph Johnson and John Vlissides"
-, title =	"Design Patterns"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1995
-, keywords =	"object-oriented programming, patterns, reuse"
-, update =	"97.03 tamassia"
+, author =      "Erich Gamma and Richard Helm and Ralph Johnson and John Vlissides"
+, title =       "Design Patterns"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1995
+, keywords =    "object-oriented programming, patterns, reuse"
+, update =      "97.03 tamassia"
 }
 
 @article{gd-ngtmp-82
-, author =	"S. Ganapathy and T. G. Dennehy"
-, title =	"A new general triangulation method for planar contours"
-, journal =	"ACS Trans. Comput. Graph."
-, volume =	16
-, year =	1982
-, pages =	"69--75"
-, update =	"98.03 bibrelex"
+, author =      "S. Ganapathy and T. G. Dennehy"
+, title =       "A new general triangulation method for planar contours"
+, journal =     "ACS Trans. Comput. Graph."
+, volume =      16
+, year =        1982
+, pages =       "69--75"
+, update =      "98.03 bibrelex"
 }
 
 @article{gt-admff-86
-, author =	"M. V. Gandhi and B. S. Thompson"
-, title =	"Automated design of modular fixtures for flexible manufacturing systems"
-, journal =	"J. of Manufacturing Systems"
-, volume =	5
-, number =	4
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "M. V. Gandhi and B. S. Thompson"
+, title =       "Automated design of modular fixtures for flexible manufacturing systems"
+, journal =     "J. of Manufacturing Systems"
+, volume =      5
+, number =      4
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{g-cpsps-01
-, author =	"Pierre-Marie Gandoin"
-, title =	"Compression progressive sans perte de structures g{\'e}om{\'e}triques"
-, type =	"Th\`{e}se de doctorat en sciences"
-, school =	"universit\'e de {Nice-Sophia Antipolis}"
-, address =	"France"
-, year =	2001
-, keywords =	"doctoral thesis"
-, update =	"02.03 devillers"
+, author =      "Pierre-Marie Gandoin"
+, title =       "Compression progressive sans perte de structures g{\'e}om{\'e}triques"
+, type =        "Th\`{e}se de doctorat en sciences"
+, school =      "universit\'e de {Nice-Sophia Antipolis}"
+, address =     "France"
+, year =        2001
+, keywords =    "doctoral thesis"
+, update =      "02.03 devillers"
 }
 
 @book{gs-ssa-79
-, author =	"G. Gane and T. Sarson"
-, title =	"Structured Systems Analysis"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1979
-, update =	"98.07 vismara, 98.03 bibrelex, 95.01 tamassia"
+, author =      "G. Gane and T. Sarson"
+, title =       "Structured Systems Analysis"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1979
+, update =      "98.07 vismara, 98.03 bibrelex, 95.01 tamassia"
 }
 
 @inproceedings{gc-fdpae-94
-, author =	"J. L. Ganley and J. P. Cohoon"
-, title =	"A faster dynamic programming algorithm for exact rectilinear {Steiner} minimal trees"
-, booktitle =	"Proc. 4th Great Lakes Sympos. VLSI"
-, year =	1994
-, pages =	"238--241"
-, update =	"98.11 bibrelex"
+, author =      "J. L. Ganley and J. P. Cohoon"
+, title =       "A faster dynamic programming algorithm for exact rectilinear {Steiner} minimal trees"
+, booktitle =   "Proc. 4th Great Lakes Sympos. VLSI"
+, year =        1994
+, pages =       "238--241"
+, update =      "98.11 bibrelex"
 }
 
 @article{gc-icors-97
-, author =	"J. L. Ganley and J. P. Cohoon"
-, title =	"Improved Computation of Optimal Rectilinear {Steiner} Minimal Trees"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"457--472"
-, succeeds =	"gc-orsmt-94"
-, update =	"98.11 devillers"
+, author =      "J. L. Ganley and J. P. Cohoon"
+, title =       "Improved Computation of Optimal Rectilinear {Steiner} Minimal Trees"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "457--472"
+, succeeds =    "gc-orsmt-94"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{gc-orsmt-94
-, author =	"J. L. Ganley and J. P. Cohoon"
-, title =	"Optimal Rectilinear {Steiner} Minimal Trees in {$O(n^2 2.62^n)$} Time"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"308--313"
-, precedes =	"gc-icors-97"
-, cites =	"ch-ecsmt-86, ch-icpsm-92, dw-spg-72, gc-fdpae-94, gj-rstpi-77, h-sprd-66, hu-iatlc-79, h-smtrd-76, sw-ersta-93, s-hfsmt-92, tac-rsmw-92, w-aspep-85, hrw-stp-92, ZZZ"
-, update =	"98.11 bibrelex+devillers, 94.09 jones"
+, author =      "J. L. Ganley and J. P. Cohoon"
+, title =       "Optimal Rectilinear {Steiner} Minimal Trees in {$O(n^2 2.62^n)$} Time"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "308--313"
+, precedes =    "gc-icors-97"
+, cites =       "ch-ecsmt-86, ch-icpsm-92, dw-spg-72, gc-fdpae-94, gj-rstpi-77, h-sprd-66, hu-iatlc-79, h-smtrd-76, sw-ersta-93, s-hfsmt-92, tac-rsmw-92, w-aspep-85, hrw-stp-92, ZZZ"
+, update =      "98.11 bibrelex+devillers, 94.09 jones"
 }
 
 @article{gknv-tddg-93
-, author =	"E. R. Gansner and E. Koutsofios and S. C. North and K. P. Vo"
-, title =	"A Technique for Drawing Directed Graphs"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	19
-, year =	1993
-, pages =	"214--230"
-, keywords =	"graph drawing"
-, update =	"95.05 tamassia, 93.09 tamassia"
+, author =      "E. R. Gansner and E. Koutsofios and S. C. North and K. P. Vo"
+, title =       "A Technique for Drawing Directed Graphs"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      19
+, year =        1993
+, pages =       "214--230"
+, keywords =    "graph drawing"
+, update =      "95.05 tamassia, 93.09 tamassia"
 }
 
 @inproceedings{gknv-gvsa-92
-, author =	"E. R. Gansner and E. Koutsofios and S. C. North and K. P. Vo"
-, title =	"Graph Visualization in Software Analysis"
-, booktitle =	"Proc. IEEE Symposium on Assessment of Quality Software Development Tools"
-, month =	may
-, year =	1992
-, pages =	""
-, keywords =	"graph drawing"
-, update =	"94.05 devillers, 93.09 tamassia"
+, author =      "E. R. Gansner and E. Koutsofios and S. C. North and K. P. Vo"
+, title =       "Graph Visualization in Software Analysis"
+, booktitle =   "Proc. IEEE Symposium on Assessment of Quality Software Development Tools"
+, month =       may
+, year =        1992
+, pages =       ""
+, keywords =    "graph drawing"
+, update =      "94.05 devillers, 93.09 tamassia"
 }
 
 @article{gnv-dptdd-88
-, author =	"E. R. Gansner and S. C. North and K. P. Vo"
-, title =	"{DAG} -- {A} Program that Draws Directed Graphs"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	18
-, number =	11
-, year =	1988
-, pages =	"1047--1062"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. R. Gansner and S. C. North and K. P. Vo"
+, title =       "{DAG} -- {A} Program that Draws Directed Graphs"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      18
+, number =      11
+, year =        1988
+, pages =       "1047--1062"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{gu-gssco-85
-, author =	"M. A. Gantner and J. J. {Uicker, Jr.}"
-, title =	"Generating swept solids for convex objects"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Mech. Engrg., Univ. Wisconsin"
-, address =	"Madison, WI"
-, year =	1985
+, author =      "M. A. Gantner and J. J. {Uicker, Jr.}"
+, title =       "Generating swept solids for convex objects"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Mech. Engrg., Univ. Wisconsin"
+, address =     "Madison, WI"
+, year =        1985
 }
 
 @inproceedings{gdg-tlbsr-94
-, author =	"B. Gao and D.-Z. Du and R. L. Graham"
-, title =	"A Tight Lower Bound for the {Steiner} Ratio in {Minkowski} Planes"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"183--191"
-, cites =	"achlkkmh-sspmn-91, cg-fpms-85, c-srbmp-90, c-sp-67, d-src-91, dgglw-mstnp-, dh-pgpcs-92, dh-rspns-92, ggj-ccsmt-77, gj-rstpi-77, gp-smt-68, gh-rsmt-76, h-smtrd-76, lm-pcasi-91, ld-smtld-92, m-ccm-76, sr-lvsta-75, sw-hstcu-, sg-smtus-82, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "B. Gao and D.-Z. Du and R. L. Graham"
+, title =       "A Tight Lower Bound for the {Steiner} Ratio in {Minkowski} Planes"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "183--191"
+, cites =       "achlkkmh-sspmn-91, cg-fpms-85, c-srbmp-90, c-sp-67, d-src-91, dgglw-mstnp-, dh-pgpcs-92, dh-rspns-92, ggj-ccsmt-77, gj-rstpi-77, gp-smt-68, gh-rsmt-76, h-smtrd-76, lm-pcasi-91, ld-smtld-92, m-ccm-76, sr-lvsta-75, sw-hstcu-, sg-smtus-82, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @inproceedings{gjkmrs-cholr-4scg-88
-, author =	"S. Gao and M. Jerrum and M. Kaufmann and K. Mehlhorn and W. R{\"u}lling and C. Storb"
-, title =	"On continuous homotopic one layer routing"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"392--402"
-, succeeds =	"gjkmrs-cholr-cga-88"
-, cites =	"cs-rreww-83, lm-artrp-85, m-slwr-87, st-ldt-47, t-oswrp-81, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "S. Gao and M. Jerrum and M. Kaufmann and K. Mehlhorn and W. R{\"u}lling and C. Storb"
+, title =       "On continuous homotopic one layer routing"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "392--402"
+, succeeds =    "gjkmrs-cholr-cga-88"
+, cites =       "cs-rreww-83, lm-artrp-85, m-slwr-87, st-ldt-47, t-oswrp-81, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{gjkmrs-cholr-cga-88
-, author =	"S. Gao and M. Jerrum and M. Kaufmann and K. Mehlhorn and W. R{\"u}lling and C. Storb"
-, title =	"On continuous homotopic one layer routing"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"55--70"
-, precedes =	"gjkmrs-cholr-4scg-88"
-, update =	"00.03 bibrelex, 99.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "S. Gao and M. Jerrum and M. Kaufmann and K. Mehlhorn and W. R{\"u}lling and C. Storb"
+, title =       "On continuous homotopic one layer routing"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "55--70"
+, precedes =    "gjkmrs-cholr-4scg-88"
+, update =      "00.03 bibrelex, 99.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{gk-crmn-87
-, author =	"S. Gao and M. Kaufmann"
-, title =	"Channel routing of multiterminal nets"
-, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1987
-, pages =	"316--325"
+, author =      "S. Gao and M. Kaufmann"
+, title =       "Channel routing of multiterminal nets"
+, booktitle =   "Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1987
+, pages =       "316--325"
 }
 
 @inproceedings{gkm-ahlc-89
-, author =	"S. Gao and M. Kaufmann and F. M. Maley"
-, title =	"Advances in homotopic layout compaction"
-, booktitle =	"Proc. 1st ACM Sympos. Parallel Algorithms Architect."
-, year =	1989
-, pages =	"273--282"
+, author =      "S. Gao and M. Kaufmann and F. M. Maley"
+, title =       "Advances in homotopic layout compaction"
+, booktitle =   "Proc. 1st ACM Sympos. Parallel Algorithms Architect."
+, year =        1989
+, pages =       "273--282"
 }
 
 @article{gc-npcs-91
-, author =	"X. S. Gao and S. C. Chou"
-, title =	"On the normal parametrization of curves and surfaces"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	2
-, year =	1991
-, pages =	"125--136"
-, keywords =	"normal parametric equation, inversion map, conic, conicoid, computer modeling"
+, author =      "X. S. Gao and S. C. Chou"
+, title =       "On the normal parametrization of curves and surfaces"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      2
+, year =        1991
+, pages =       "125--136"
+, keywords =    "normal parametric equation, inversion map, conic, conicoid, computer modeling"
 }
 
 @inproceedings{ghhnt-ptpg-97
-, author =	"A. Garc{\'{\i}}a and C. Hernando and F. Hurtado and M. Noy and J. Tejel"
-, title =	"Packing Trees into Planar Graphs"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"383--390"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "A. Garc{\'{\i}}a and C. Hernando and F. Hurtado and M. Noy and J. Tejel"
+, title =       "Packing Trees into Planar Graphs"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "383--390"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{gnt-lbncf-95
-, author =	"Alfredo Garc{\'\i}a and Marc Noy and Javier Tejel"
-, title =	"Lower Bounds for the Number of Crossing-Free Subgraphs of {$K_n$}"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"97--102"
-, update =	"95.09 jones"
+, author =      "Alfredo Garc{\'\i}a and Marc Noy and Javier Tejel"
+, title =       "Lower Bounds for the Number of Crossing-Free Subgraphs of {$K_n$}"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "97--102"
+, update =      "95.09 jones"
 }
 
 @article{gnt-lbncf-00
-, author =	"A. Garc{\'\i}a and M. Noy and J. Tejel"
-, title =	"Lower bounds on the number of crossing-free subgraphs of {$K_N$}"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	16
-, year =	2000
-, pages =	"211--221"
-, update =	"01.04 smid"
+, author =      "A. Garc{\'\i}a and M. Noy and J. Tejel"
+, title =       "Lower bounds on the number of crossing-free subgraphs of {$K_N$}"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      16
+, year =        2000
+, pages =       "211--221"
+, update =      "01.04 smid"
 }
 
 @article{gsf-scdp-94
-, author =	"A. Garcia-Alonso and N. Serrano and J. Flaquer"
-, title =	"Solving the Collision Detection Problem"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	14
-, month =	may
-, year =	1994
-, pages =	"36--43"
-, update =	"95.01 mitchell"
+, author =      "A. Garcia-Alonso and N. Serrano and J. Flaquer"
+, title =       "Solving the Collision Detection Problem"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      14
+, month =       may
+, year =        1994
+, pages =       "36--43"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{gr-mcsp-96
-, author =	"Jesus Garcia and Pedro A. Ramos"
-, title =	"Measuring Circularity of a Set of Points"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	75
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Jesus Garcia and Pedro A. Ramos"
+, title =       "Measuring Circularity of a Set of Points"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       75
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{gm-afegg-88
-, author =	"Luis F. Garcia and Osama A. Mohammed"
-, title =	"Automatic Finite Element Grid Generation In Electromagnetics"
-, booktitle =	"1988 IEEE Southeastcon, Conference Proceedings."
-, publisher =	"IEEE"
-, address =	"New York, NY"
-, year =	1988
-, pages =	"571--575"
-, keywords =	"grid generation, field region, finite-element meshes, triangulation, finite- element grids"
-, annote =	"Basic incremental switching algorithm."
-, abstract =	"An automatic two-dimensional finite-element grid
-		 generator, which would greatly assist in improving
-		 preprocessing operations, and geometry handling, for
-		 electromagnetic field computations is presented. The
-		 algorithm developed iteratively triangulates a set of
-		 points, defining a field region, into optimal
-		 finite-element meshes. The mathematical procedure used
-		 in developing the algorithm is based on the concept of
-		 Delaunay triangulation and variational principles. The
-		 main objective of this algorithm is to efficiently
-		 reconstruct complicated field regions in terms of a set
-		 of points, known to the user, and generate optimal
-		 finite- element grids. The algorithm would also assist
-		 in preparing the geometrical and material
-		 characteristic-field regions to obtain numerical
-		 solutions. The algorithm is executed interactively. 20
-		 refs."
+, author =      "Luis F. Garcia and Osama A. Mohammed"
+, title =       "Automatic Finite Element Grid Generation In Electromagnetics"
+, booktitle =   "1988 IEEE Southeastcon, Conference Proceedings."
+, publisher =   "IEEE"
+, address =     "New York, NY"
+, year =        1988
+, pages =       "571--575"
+, keywords =    "grid generation, field region, finite-element meshes, triangulation, finite- element grids"
+, annote =      "Basic incremental switching algorithm."
+, abstract =    "An automatic two-dimensional finite-element grid
+                 generator, which would greatly assist in improving
+                 preprocessing operations, and geometry handling, for
+                 electromagnetic field computations is presented. The
+                 algorithm developed iteratively triangulates a set of
+                 points, defining a field region, into optimal
+                 finite-element meshes. The mathematical procedure used
+                 in developing the algorithm is based on the concept of
+                 Delaunay triangulation and variational principles. The
+                 main objective of this algorithm is to efficiently
+                 reconstruct complicated field regions in terms of a set
+                 of points, known to the user, and generate optimal
+                 finite- element grids. The algorithm would also assist
+                 in preparing the geometrical and material
+                 characteristic-field regions to obtain numerical
+                 solutions. The algorithm is executed interactively. 20
+                 refs."
 }
 
 @inproceedings{gr-cvs-93
-, author =	"J. Garc{'i}a-L{'o}pez and P. Ramos-Alonso"
-, title =	"Circular visibility and seability"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"18--23"
-, cites =	"as-cssp-93, as-cvspf-93, c-tsplt-91a, ghlst-ltavs-87, gy-fchsp-83, ps-cgi-85, t-cg-85, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "J. Garc{'i}a-L{'o}pez and P. Ramos-Alonso"
+, title =       "Circular visibility and seability"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "18--23"
+, cites =       "as-cssp-93, as-cvspf-93, c-tsplt-91a, ghlst-ltavs-87, gy-fchsp-83, ps-cgi-85, t-cg-85, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{gr-fspc-97
-, author =	"J. Garc{\'i}a-Lopez and P. Ramos"
-, title =	"Fitting a set of points by a circle"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"139--146"
-, precedes =	"grs-fspc-98"
-, cites =	"ast-apsgo-94, agss-ltacv-89, efnn-rauvd-89, egs-oplms-86, f-gm2ag-82, ll-orpr-91, ps-cgi-85, r-ac-79, rz-epccm-92, sy-pncrr-95, sj-wrspp-95, slw-oardc-95, y-ecgtm-95, ZZZ"
-, update =	"99.07 devillers, 98.07 bibrelex, 97.07 efrat"
+, author =      "J. Garc{\'i}a-Lopez and P. Ramos"
+, title =       "Fitting a set of points by a circle"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "139--146"
+, precedes =    "grs-fspc-98"
+, cites =       "ast-apsgo-94, agss-ltacv-89, efnn-rauvd-89, egs-oplms-86, f-gm2ag-82, ll-orpr-91, ps-cgi-85, r-ac-79, rz-epccm-92, sy-pncrr-95, sj-wrspp-95, slw-oardc-95, y-ecgtm-95, ZZZ"
+, update =      "99.07 devillers, 98.07 bibrelex, 97.07 efrat"
 }
 
 @article{grs-fspc-98
-, author =	"Jes{\'u}s Garc{\'i}a-L{\'o}pez and Pedro Ramos and Jack Snoeyink"
-, title =	"Fitting a set of points by a circle"
-, journal =	"Discrete Comput. Geom."
-, volume =	20
-, year =	1998
-, pages =	"389--402"
-, succeeds =	"gr-fspc-97"
-, update =	"99.07 devillers"
+, author =      "Jes{\'u}s Garc{\'i}a-L{\'o}pez and Pedro Ramos and Jack Snoeyink"
+, title =       "Fitting a set of points by a circle"
+, journal =     "Discrete Comput. Geom."
+, volume =      20
+, year =        1998
+, pages =       "389--402"
+, succeeds =    "gr-fspc-97"
+, update =      "99.07 devillers"
 }
 
 @incollection{g-tc-92
-, author =	"M. Gardner"
-, title =	"Tangent Circles"
-, booktitle =	"Fractal Music and Hypercards"
-, publisher =	"W. H. Freeman"
-, year =	1992
-, pages =	"149--166"
-, update =	"97.11 bibrelex"
+, author =      "M. Gardner"
+, title =       "Tangent Circles"
+, booktitle =   "Fractal Music and Hypercards"
+, publisher =   "W. H. Freeman"
+, year =        1992
+, pages =       "149--166"
+, update =      "97.11 bibrelex"
 }
 
 @book{g-gt-95
-, author =	"R. J. Gardner"
-, title =	"Geometric Tomography"
-, publisher =	"Cambridge University Press"
-, year =	1995
-, update =	"96.05 orourke"
+, author =      "R. J. Gardner"
+, title =       "Geometric Tomography"
+, publisher =   "Cambridge University Press"
+, year =        1995
+, update =      "96.05 orourke"
 }
 
 @article{g-sxpcb-83
-, author =	"R. J. Gardner"
-, title =	"Symmetrals and x-rays of planar convex bodies"
-, journal =	"Arch. Math."
-, volume =	41
-, year =	1983
-, pages =	"183--189"
-, update =	"98.11 bibrelex"
+, author =      "R. J. Gardner"
+, title =       "Symmetrals and x-rays of planar convex bodies"
+, journal =     "Arch. Math."
+, volume =      41
+, year =        1983
+, pages =       "183--189"
+, update =      "98.11 bibrelex"
 }
 
 @article{g-xrp-92
-, author =	"R. J. Gardner"
-, title =	"{X}-rays of polygons"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"281--293"
+, author =      "R. J. Gardner"
+, title =       "{X}-rays of polygons"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "281--293"
 }
 
 @inproceedings{gg-dfsxr-96
-, author =	"R. J. Gardner and Peter Gritzmann"
-, title =	"Determination of Finite Sets by {X}-Rays"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"71--72"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "R. J. Gardner and Peter Gritzmann"
+, title =       "Determination of Finite Sets by {X}-Rays"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "71--72"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{gm-hxp-80
-, author =	"R. J. Gardner and P. {McMullen}"
-, title =	"On {Hammer's} x-ray problem"
-, journal =	"J. London Math. Soc."
-, volume =	21
-, year =	1980
-, pages =	"171--175"
-, update =	"98.11 bibrelex"
+, author =      "R. J. Gardner and P. {McMullen}"
+, title =       "On {Hammer's} x-ray problem"
+, journal =     "J. London Math. Soc."
+, volume =      21
+, year =        1980
+, pages =       "171--175"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{gfp-porqm-89
-, author =	"D. Gardy and P. Flajolet and C. Puech"
-, title =	"On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"218--229"
-, update =	"94.01 smid, 93.09 milone+mitchell"
+, author =      "D. Gardy and P. Flajolet and C. Puech"
+, title =       "On the Performance of Orthogonal Range Queries in Multiattribute and Doubly Chained Trees"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "218--229"
+, update =      "94.01 smid, 93.09 milone+mitchell"
 }
 
 @techreport{gg-esdss-90
-, author =	"D. Gardy and D. Gouyou-Beauchamps"
-, title =	"Enumeration of some {Davenport}-{Schinzel} sequences"
-, type =	"Report"
-, number =	564
-, institution =	"Universit{\'e} de Paris-Sud"
-, address =	"Paris"
-, year =	1990
-, update =	"95.09 agarwal, 95.05 agarwal"
+, author =      "D. Gardy and D. Gouyou-Beauchamps"
+, title =       "Enumeration of some {Davenport}-{Schinzel} sequences"
+, type =        "Report"
+, number =      564
+, institution = "Universit{\'e} de Paris-Sud"
+, address =     "Paris"
+, year =        1990
+, update =      "95.09 agarwal, 95.05 agarwal"
 }
 
 @article{g-obip-72
-, author =	"M. Garey"
-, title =	"Optimal binary identification procedures"
-, journal =	"SIAM J. Appl. Math."
-, volume =	23
-, year =	1972
-, pages =	"173--186"
-, update =	"98.03 bibrelex"
+, author =      "M. Garey"
+, title =       "Optimal binary identification procedures"
+, journal =     "SIAM J. Appl. Math."
+, volume =      23
+, year =        1972
+, pages =       "173--186"
+, update =      "98.03 bibrelex"
 }
 
 @article{gjs-agcpc-76
-, author =	"M. Garey and D. Johnson and H. So"
-, title =	"An Apllication of Graph Coloring to Printed Circuit Testing"
-, journal =	"IEEE Trans. Circuits Syst."
-, volume =	"CAS-23"
-, number =	10
-, month =	oct
-, year =	1976
-, pages =	"591--598"
-, update =	"97.11 bibrelex"
+, author =      "M. Garey and D. Johnson and H. So"
+, title =       "An Apllication of Graph Coloring to Printed Circuit Testing"
+, journal =     "IEEE Trans. Circuits Syst."
+, volume =      "CAS-23"
+, number =      10
+, month =       oct
+, year =        1976
+, pages =       "591--598"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ggj-sncgp-76
-, author =	"M. R. Garey and R. L. Graham and D. S. Johnson"
-, title =	"Some {NP}-complete geometric problems"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Theory Comput."
-, year =	1976
-, pages =	"10--22"
+, author =      "M. R. Garey and R. L. Graham and D. S. Johnson"
+, title =       "Some {NP}-complete geometric problems"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Theory Comput."
+, year =        1976
+, pages =       "10--22"
 }
 
 @article{ggj-ccsmt-77
-, author =	"M. R. Garey and R. L. Graham and D. S. Johnson"
-, title =	"The complexity of computing {Steiner} minimal trees"
-, journal =	"SIAM J. Appl. Math."
-, volume =	32
-, year =	1977
-, pages =	"835--859"
+, author =      "M. R. Garey and R. L. Graham and D. S. Johnson"
+, title =       "The complexity of computing {Steiner} minimal trees"
+, journal =     "SIAM J. Appl. Math."
+, volume =      32
+, year =        1977
+, pages =       "835--859"
 }
 
 % also claimed address = "San Francisco, CA"
 @book{gj-cigtn-79
-, author =	"M. R. Garey and D. S. Johnson"
-, title =	"Computers and Intractability: {A} Guide to the Theory of {NP}-Completeness"
-, publisher =	"W. H. Freeman"
-, address =	"New York, NY"
-, year =	1979
-, keywords =	"NP-completeness"
+, author =      "M. R. Garey and D. S. Johnson"
+, title =       "Computers and Intractability: {A} Guide to the Theory of {NP}-Completeness"
+, publisher =   "W. H. Freeman"
+, address =     "New York, NY"
+, year =        1979
+, keywords =    "NP-completeness"
 }
 
 @article{gj-cninc-83
-, author =	"M. R. Garey and D. S. Johnson"
-, title =	"Crossing Number is {NP}-Complete"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	4
-, number =	3
-, year =	1983
-, pages =	"312--316"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. R. Garey and D. S. Johnson"
+, title =       "Crossing Number is {NP}-Complete"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      4
+, number =      3
+, year =        1983
+, pages =       "312--316"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{gj-rstpi-77
-, author =	"M. R. Garey and D. S. Johnson"
-, title =	"The rectilinear {Steiner} tree problem is {NP}-complete"
-, journal =	"SIAM J. Appl. Math."
-, volume =	32
-, year =	1977
-, pages =	"826--834"
+, author =      "M. R. Garey and D. S. Johnson"
+, title =       "The rectilinear {Steiner} tree problem is {NP}-complete"
+, journal =     "SIAM J. Appl. Math."
+, volume =      32
+, year =        1977
+, pages =       "826--834"
 }
 
 @article{gjpt-tsp-78
-, author =	"M. R. Garey and D. S. Johnson and F. P. Preparata and R. E. Tarjan"
-, title =	"Triangulating a simple polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	7
-, number =	4
-, year =	1978
-, pages =	"175--179"
-, update =	"98.11 bibrelex"
+, author =      "M. R. Garey and D. S. Johnson and F. P. Preparata and R. E. Tarjan"
+, title =       "Triangulating a simple polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      7
+, number =      4
+, year =        1978
+, pages =       "175--179"
+, update =      "98.11 bibrelex"
 }
 
 @article{gjt-phcpn-76
-, author =	"M. R. Garey and D. S. Johnson and R. E. Tarjan"
-, title =	"The planar {Hamiltonian} circuit problem is {NP}-complete"
-, journal =	"SIAM J. Comput."
-, volume =	5
-, number =	4
-, year =	1976
-, pages =	"704--714"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "M. R. Garey and D. S. Johnson and R. E. Tarjan"
+, title =       "The planar {Hamiltonian} circuit problem is {NP}-complete"
+, journal =     "SIAM J. Comput."
+, volume =      5
+, number =      4
+, year =        1976
+, pages =       "704--714"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{gp-oswsc-84
-, author =	"M. R. Garey and R. Y. Pinter"
-, title =	"Optimum scan-width selection under containment constraints"
-, journal =	"AT\&T Bell Lab. Tech. J."
-, volume =	63
-, year =	1984
-, pages =	"1191--1212"
+, author =      "M. R. Garey and R. Y. Pinter"
+, title =       "Optimum scan-width selection under containment constraints"
+, journal =     "AT\&T Bell Lab. Tech. J."
+, volume =      63
+, year =        1984
+, pages =       "1191--1212"
 }
 
 @article{g-nrdag-98
-, author =	"A. Garg"
-, title =	"New results on Drawing Angle Graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, number =	"1--2"
-, year =	1998
-, pages =	"43--82"
-, note =	"Special Issue on Geometric Representations of
+, author =      "A. Garg"
+, title =       "New results on Drawing Angle Graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, number =      "1--2"
+, year =        1998
+, pages =       "43--82"
+, note =        "Special Issue on Geometric Representations of
                   Graphs, G.~{Di Battista} and R.~Tamassia, editors"
-, succeeds =	"g-dag-95"
-, update =	"98.07 vismara"
+, succeeds =    "g-dag-95"
+, update =      "98.07 vismara"
 }
 
 @inproceedings{g-dag-95
-, author =	"A. Garg"
-, title =	"On Drawing Angle Graphs"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"84--95"
-, keywords =	"graph drawing, planar, straight-line, NP-hardness"
-, update =	"95.01 tamassia"
+, author =      "A. Garg"
+, title =       "On Drawing Angle Graphs"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "84--95"
+, keywords =    "graph drawing, planar, straight-line, NP-hardness"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{ggt-aeutd-93
-, author =	"A. Garg and M. T. Goodrich and R. Tamassia"
-, title =	"Area-efficient upward tree drawings"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"359--368"
-, keywords =	"graph drawing"
-, precedes =	"ggt-putdo-96"
-, cites =	"bc-cmwlv-87, bl-fsvgl-84, bm-gta-76, b-ndgta-88, bk-abtl-80, c-tpca-82, cdttb-fdgd-92, cdp-noaau-92, dtt-arsdp-92, dett-adgab-93, dv-aptg-93, fpp-sssfe-88, ell-ttdc-90, ghlst-ltavs-87, fhkr-owpas-92, k-dpgul-92, l-aeglv-80, mp-arpg-92, o-cgc18-93, rt-tdt-81, sr-cdtn-83, rt-rplbo-86, s-epgg-90, tt-uavrp-86, t-hdg-63, v-ucvc-81, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex, 97.03 devillers, 93.09 tamassia"
+, author =      "A. Garg and M. T. Goodrich and R. Tamassia"
+, title =       "Area-efficient upward tree drawings"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "359--368"
+, keywords =    "graph drawing"
+, precedes =    "ggt-putdo-96"
+, cites =       "bc-cmwlv-87, bl-fsvgl-84, bm-gta-76, b-ndgta-88, bk-abtl-80, c-tpca-82, cdttb-fdgd-92, cdp-noaau-92, dtt-arsdp-92, dett-adgab-93, dv-aptg-93, fpp-sssfe-88, ell-ttdc-90, ghlst-ltavs-87, fhkr-owpas-92, k-dpgul-92, l-aeglv-80, mp-arpg-92, o-cgc18-93, rt-tdt-81, sr-cdtn-83, rt-rplbo-86, s-epgg-90, tt-uavrp-86, t-hdg-63, v-ucvc-81, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex, 97.03 devillers, 93.09 tamassia"
 }
 
 @article{ggt-putdo-96
-, author =	"A. Garg and M. T. Goodrich and R. Tamassia"
-, title =	"Planar upward tree drawings with optimal area"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"333--356"
-, url =	"https://www.cs.brown.edu/cgc/papers/ggt-aoutd-96.ps.gz"
-, keywords =	"graph drawing, tree, planar, upward"
-, succeeds =	"ggt-aeutd-93"
-, update =	"97.03 devillers+tamassia"
+, author =      "A. Garg and M. T. Goodrich and R. Tamassia"
+, title =       "Planar upward tree drawings with optimal area"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "333--356"
+, url = "https://www.cs.brown.edu/cgc/papers/ggt-aoutd-96.ps.gz"
+, keywords =    "graph drawing, tree, planar, upward"
+, succeeds =    "ggt-aeutd-93"
+, update =      "97.03 devillers+tamassia"
 }
 
 @techreport{gt-nmcfa-96
-, author =	"A. Garg and R. Tamassia"
-, title =	"A New Minimum Cost Flow Algorithm with Applications to Graph Drawing"
-, type =	"Manuscript"
-, institution =	"Dept. of Computer Sci., Brown University"
-, year =	1996
-, keywords =	"graph drawing, orthogonal, planar"
-, update =	"96.09 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "A New Minimum Cost Flow Algorithm with Applications to Graph Drawing"
+, type =        "Manuscript"
+, institution = "Dept. of Computer Sci., Brown University"
+, year =        1996
+, keywords =    "graph drawing, orthogonal, planar"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{gt-nmcfa-97
-, author =	"A. Garg and R. Tamassia"
-, title =	"A New Minimum Cost Flow Algorithm with Applications to Graph Drawing"
-, editor =	"S. C. North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"201--216"
-, url =	"https://www.cs.brown.edu/cgc/papers/gt-nmcfa-97.ps.gz"
-, keywords =	"graph drawing, planar, orthogonal, grid"
-, update =	"99.03 vismara, 97.03 tamassia, 96.09 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "A New Minimum Cost Flow Algorithm with Applications to Graph Drawing"
+, editor =      "S. C. North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "201--216"
+, url = "https://www.cs.brown.edu/cgc/papers/gt-nmcfa-97.ps.gz"
+, keywords =    "graph drawing, planar, orthogonal, grid"
+, update =      "99.03 vismara, 97.03 tamassia, 96.09 tamassia"
 }
 
 @inproceedings{gt-agd-94
-, author =	"A. Garg and R. Tamassia"
-, title =	"Advances in Graph Drawing"
-, booktitle =	"Algorithms and Complexity"
-, nickname =	"CIAC '94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	778
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"12--21"
-, url =	"https://www.cs.brown.edu/cgc/papers/gt-agd-94.ps.gz"
-, keywords =	"graph drawing"
-, update =	"97.11 bibrelex, 97.03 tamassia, 94.05 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "Advances in Graph Drawing"
+, booktitle =   "Algorithms and Complexity"
+, nickname =    "CIAC '94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      778
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "12--21"
+, url = "https://www.cs.brown.edu/cgc/papers/gt-agd-94.ps.gz"
+, keywords =    "graph drawing"
+, update =      "97.11 bibrelex, 97.03 tamassia, 94.05 tamassia"
 }
 
 @techreport{gt-arpd-93
-, author =	"A. Garg and R. Tamassia"
-, title =	"Angular Resolution of Planar Drawings"
-, institution =	"Brown Univ., Dept. of Computer Science"
-, year =	1993
-, keywords =	"graph drawing"
-, update =	"94.01 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "Angular Resolution of Planar Drawings"
+, institution = "Brown Univ., Dept. of Computer Science"
+, year =        1993
+, keywords =    "graph drawing"
+, update =      "94.01 tamassia"
 }
 
 @techreport{gt-evhst-96
-, author =	"A. Garg and R. Tamassia"
-, title =	"Effective Visualization of Hierarchical Structures in {3D}"
-, type =	"Manuscript"
-, institution =	"Dept. of Computer Sci., Brown University"
-, year =	1996
-, note =	"Available at \url{https://www.cs.brown.edu/people/rt/fadiva/giotto3d.html}"
-, url =	"https://www.cs.brown.edu/people/rt/fadiva/giotto3d.html"
-, keywords =	"graph drawing, 3D"
-, update =	"97.03 tamassia, 96.09 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "Effective Visualization of Hierarchical Structures in {3D}"
+, type =        "Manuscript"
+, institution = "Dept. of Computer Sci., Brown University"
+, year =        1996
+, note =        "Available at \url{https://www.cs.brown.edu/people/rt/fadiva/giotto3d.html}"
+, url = "https://www.cs.brown.edu/people/rt/fadiva/giotto3d.html"
+, keywords =    "graph drawing, 3D"
+, update =      "97.03 tamassia, 96.09 tamassia"
 }
 
 @inproceedings{gt-ecpsl-93
-, author =	"A. Garg and R. Tamassia"
-, title =	"Efficient Computation of Planar Straight-Line Upward Drawings"
-, booktitle =	"Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
-, site =	"Paris, France"
-, year =	1993
-, keywords =	"graph drawing, planar, upward, straight-line"
-, update =	"95.05 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "Efficient Computation of Planar Straight-Line Upward Drawings"
+, booktitle =   "Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing)"
+, site =        "Paris, France"
+, year =        1993
+, keywords =    "graph drawing, planar, upward, straight-line"
+, update =      "95.05 tamassia"
 }
 
 @inproceedings{gt-gsvhs-97
-, author =	"A. Garg and R. Tamassia"
-, title =	"{GIOTTO3D}: A System for Visualizing Hierarchical Structures in {3D}"
-, editor =	"S. North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, publisher =	"Springer-Verlag"
-, year =	1997
-, url =	"https://www.cs.brown.edu/cgc/papers/gt-gsvhs-97.ps.gz"
-, keywords =	"graph drawing, upward, 3D, CGC, Brown"
-, update =	"99.11 bibrelex, 97.03 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "{GIOTTO3D}: A System for Visualizing Hierarchical Structures in {3D}"
+, editor =      "S. North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, publisher =   "Springer-Verlag"
+, year =        1997
+, url = "https://www.cs.brown.edu/cgc/papers/gt-gsvhs-97.ps.gz"
+, keywords =    "graph drawing, upward, 3D, CGC, Brown"
+, update =      "99.11 bibrelex, 97.03 tamassia"
 }
 
 @techreport{gt-cupt-93
-, author =	"A. Garg and R. Tamassia"
-, title =	"On the Complexity of Upward Planarity Testing"
-, institution =	"Brown Univ., Dept. of Computer Science"
-, year =	1993
-, keywords =	"graph drawing"
-, update =	"94.01 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "On the Complexity of Upward Planarity Testing"
+, institution = "Brown Univ., Dept. of Computer Science"
+, year =        1993
+, keywords =    "graph drawing"
+, update =      "94.01 tamassia"
 }
 
 @techreport{gt-ccurp-94
-, author =	"A. Garg and R. Tamassia"
-, title =	"On the Computational Complexity of Upward and Rectilinear Planarity Testing"
-, type =	"Report"
-, number =	"CS-94-10"
-, institution =	"Comput. Sci. Dept., Brown Univ."
-, address =	"Providence, RI"
-, year =	1994
-, update =	"94.05 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "On the Computational Complexity of Upward and Rectilinear Planarity Testing"
+, type =        "Report"
+, number =      "CS-94-10"
+, institution = "Comput. Sci. Dept., Brown Univ."
+, address =     "Providence, RI"
+, year =        1994
+, update =      "94.05 tamassia"
 }
 
 @unpublished{gt-ccurp-s-95
-, author =	"A. Garg and R. Tamassia"
-, title =	"On the Computational Complexity of Upward and Rectilinear Planarity Testing"
-, year =	1995
-, note =	"Submitted to {\em SIAM Journal on Computing}"
-, keywords =	"graph drawing, planar upward, orthogonal"
-, update =	"96.09 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "On the Computational Complexity of Upward and Rectilinear Planarity Testing"
+, year =        1995
+, note =        "Submitted to {\em SIAM Journal on Computing}"
+, keywords =    "graph drawing, planar upward, orthogonal"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{gt-ccurp-95
-, author =	"A. Garg and R. Tamassia"
-, title =	"On the Computational Complexity of Upward and Rectilinear Planarity Testing"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"286--297"
-, url =	"https://www.cs.brown.edu/cgc/papers/gt-ccurp-95.ps.gz"
-, keywords =	"graph drawing, planar, upward, rectilinear, orthogonal, NP-hardness"
-, update =	"97.03 tamassia, 95.01 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "On the Computational Complexity of Upward and Rectilinear Planarity Testing"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "286--297"
+, url = "https://www.cs.brown.edu/cgc/papers/gt-ccurp-95.ps.gz"
+, keywords =    "graph drawing, planar, upward, rectilinear, orthogonal, NP-hardness"
+, update =      "97.03 tamassia, 95.01 tamassia"
 }
 
 @inproceedings{gt-pdara-94
-, author =	"A. Garg and R. Tamassia"
-, title =	"Planar Drawings and Angular Resolution: Algorithms and Bounds"
-, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
-, nickname =	"ESA '94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"12--23"
-, keywords =	"graph drawing, planar, straight-line, angular resolution"
-, update =	"95.05 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "Planar Drawings and Angular Resolution: Algorithms and Bounds"
+, booktitle =   "Proc. 2nd Annu. European Sympos. Algorithms"
+, nickname =    "ESA '94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "12--23"
+, keywords =    "graph drawing, planar, straight-line, angular resolution"
+, update =      "95.05 tamassia"
 }
 
 @article{gt-upt-95
-, author =	"A. Garg and R. Tamassia"
-, title =	"Upward Planarity Testing"
-, journal =	"Order"
-, volume =	12
-, year =	1995
-, pages =	"109--133"
-, url =	"https://www.cs.brown.edu/cgc/papers/gt-upt-95.ps.gz"
-, keywords =	"graph drawing, planar, upward, survey"
-, update =	"97.03 tamassia, 96.09 tamassia, 95.09 tamassia, 95.05 tamassia"
+, author =      "A. Garg and R. Tamassia"
+, title =       "Upward Planarity Testing"
+, journal =     "Order"
+, volume =      12
+, year =        1995
+, pages =       "109--133"
+, url = "https://www.cs.brown.edu/cgc/papers/gt-upt-95.ps.gz"
+, keywords =    "graph drawing, planar, upward, survey"
+, update =      "97.03 tamassia, 96.09 tamassia, 95.09 tamassia, 95.05 tamassia"
 }
 
 @inproceedings{gtv-dc-96
-, author =	"A. Garg and R. Tamassia and P. Vocca"
-, title =	"Drawing with Colors"
-, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
-, nickname =	"ESA '96"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1136
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"12--26"
-, url =	"https://www.cs.brown.edu/cgc/papers/gtv-dc-96.ps.gz"
-, keywords =	"graph drawing, 3D, straight-line"
-, update =	"97.03 smid+tamassia"
+, author =      "A. Garg and R. Tamassia and P. Vocca"
+, title =       "Drawing with Colors"
+, booktitle =   "Proc. 4th Annu. European Sympos. Algorithms"
+, nickname =    "ESA '96"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1136
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "12--26"
+, url = "https://www.cs.brown.edu/cgc/papers/gtv-dc-96.ps.gz"
+, keywords =    "graph drawing, 3D, straight-line"
+, update =      "97.03 smid+tamassia"
 }
 
 @inproceedings{gh-oaakm-94
-, author =	"Naveen Garg and Dorit S. Hochbaum"
-, title =	"An ${O}(\log k)$ Approximation Algorithm for the $k$ Minimum Spanning Tree Problem in the Plane"
-, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '94"
-, year =	1994
-, pages =	"432--438"
-, update =	"98.07 bibrelex, 97.03 agarwal, 95.01 mitchell"
+, author =      "Naveen Garg and Dorit S. Hochbaum"
+, title =       "An ${O}(\log k)$ Approximation Algorithm for the $k$ Minimum Spanning Tree Problem in the Plane"
+, booktitle =   "Proc. 26th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '94"
+, year =        1994
+, pages =       "432--438"
+, update =      "98.07 bibrelex, 97.03 agarwal, 95.01 mitchell"
 }
 
 @inproceedings{gkr-paags-98
-, author =	"Naveen Garg and Goran Konjevod and R. Ravi"
-, title =	"A Polylogarithmic Approximation Algorithm for the Group {Steiner} Problem"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"253--259"
-, update =	"99.07 bibrelex, 98.07 mitchell"
+, author =      "Naveen Garg and Goran Konjevod and R. Ravi"
+, title =       "A Polylogarithmic Approximation Algorithm for the Group {Steiner} Problem"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "253--259"
+, update =      "99.07 bibrelex, 98.07 mitchell"
 }
 
 @article{g-ewrq-82
-, author =	"I. Gargantini"
-, title =	"An Effective Way to Represent Quadtrees"
-, journal =	"Commun. ACM"
-, volume =	25
-, number =	12
-, month =	dec
-, year =	1982
-, pages =	"905--910"
-, update =	"97.11 bibrelex"
+, author =      "I. Gargantini"
+, title =       "An Effective Way to Represent Quadtrees"
+, journal =     "Commun. ACM"
+, volume =      25
+, number =      12
+, month =       dec
+, year =        1982
+, pages =       "905--910"
+, update =      "97.11 bibrelex"
 }
 
 @article{ga-rtone-93
-, author =	"I. Gargantini and H. H. Atkinson"
-, title =	"Ray Tracing an Octree: Numerical Evaluation of the First Intersection"
-, journal =	"Comput. Graph. Forum"
-, volume =	12
-, number =	4
-, month =	oct
-, year =	1993
-, pages =	"199--210"
-, update =	"96.01 held"
+, author =      "I. Gargantini and H. H. Atkinson"
+, title =       "Ray Tracing an Octree: Numerical Evaluation of the First Intersection"
+, journal =     "Comput. Graph. Forum"
+, volume =      12
+, number =      4
+, month =       oct
+, year =        1993
+, pages =       "199--210"
+, update =      "96.01 held"
 }
 
 @inproceedings{gs-tmgme-95
-, author =	"Rao Garimella and Mark S. Shephard"
-, title =	"Tetrahedral Mesh Generation with Multiple Elements Through the Thickness"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"321--334"
-, update =	"96.01 samitchell"
+, author =      "Rao Garimella and Mark S. Shephard"
+, title =       "Tetrahedral Mesh Generation with Multiple Elements Through the Thickness"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "321--334"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{gh-ssqem-97
-, author =	"M. Garland and P. S. Heckbert"
-, title =	"Surface simplification using quadric error metrics"
-, booktitle =	"Proc. SIGGRAPH '97"
-, year =	1997
-, pages =	"209--216"
-, update =	"98.07 orourke"
+, author =      "M. Garland and P. S. Heckbert"
+, title =       "Surface simplification using quadric error metrics"
+, booktitle =   "Proc. SIGGRAPH '97"
+, year =        1997
+, pages =       "209--216"
+, update =      "98.07 orourke"
 }
 
 @inproceedings{gbw-ivlgd-90
-, author =	"B. Garlick and D. Baum and J. Winget"
-, title =	"Interactive viewing of large geometric databases using multiprocessor graphics workstations"
-, booktitle =	"SIGGRAPH '90 Course Notes: Parallel Algorithms and Architectures for 3D Image Generation"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "B. Garlick and D. Baum and J. Winget"
+, title =       "Interactive viewing of large geometric databases using multiprocessor graphics workstations"
+, booktitle =   "SIGGRAPH '90 Course Notes: Parallel Algorithms and Architectures for 3D Image Generation"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @misc{gg-sdvpx-92
-, author =	"R. J. Garnder and P. Gritzmann"
-, title =	"Successive determination and verification of polytopes by their x-rays"
-, year =	1992
-, note =	"preprint"
-, update =	"98.11 bibrelex"
+, author =      "R. J. Garnder and P. Gritzmann"
+, title =       "Successive determination and verification of polytopes by their x-rays"
+, year =        1992
+, note =        "preprint"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{gm-eggsm-97
-, author =	"M. A. Garrido and A. M{\'a}rquez"
-, title =	"Embedding a Graph in the Grid of a Surface with the Minimum Number of Bends is {NP-hard}"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"124--133"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "M. A. Garrido and A. M{\'a}rquez"
+, title =       "Embedding a Graph in the Grid of a Surface with the Minimum Number of Bends is {NP-hard}"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "124--133"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{gmpr-otp-99
-, author =	"Maria Angeles Garrido and Alberto M{\'a}rquez and Jose Ramon Portillo and Pedro Reyes"
-, title =	"Orthogonal Triangles in the Plane"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"165--167"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Maria Angeles Garrido and Alberto M{\'a}rquez and Jose Ramon Portillo and Pedro Reyes"
+, title =       "Orthogonal Triangles in the Plane"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "165--167"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{gw-cipas-87
-, author =	"T. Garrity and J. Warren"
-, title =	"On Computing the Intersection of a Pair of Algebraic Surfaces"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	"??"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "T. Garrity and J. Warren"
+, title =       "On Computing the Intersection of a Pair of Algebraic Surfaces"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      "??"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @book{gb-amgd-92
-, author =	"G. D. Garson and R. S. Biggs"
-, title =	"Analytic Mapping and Geographic Databases"
-, publisher =	"Sage Publications"
-, address =	"Newbury Park"
-, year =	1992
-, update =	"96.09 kreveld"
+, author =      "G. D. Garson and R. S. Biggs"
+, title =       "Analytic Mapping and Geographic Databases"
+, publisher =   "Sage Publications"
+, address =     "Newbury Park"
+, year =        1992
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{g-saaop-92
-, author =	"Bernd G{\"a}rtner"
-, title =	"A Subexponential Algorithm for Abstract Optimization Problems"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"464--472"
-, keywords =	"geometric optimization, randomized algorithm, smallest enclosing ball, distance of convex polyhedra"
-, update =	"94.01 smid, 93.09 matousek+milone+mitchell"
+, author =      "Bernd G{\"a}rtner"
+, title =       "A Subexponential Algorithm for Abstract Optimization Problems"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "464--472"
+, keywords =    "geometric optimization, randomized algorithm, smallest enclosing ball, distance of convex polyhedra"
+, update =      "94.01 smid, 93.09 matousek+milone+mitchell"
 }
 
 @techreport{g-saaop-93
-, author =	"Bernd G{\"a}rtner"
-, title =	"A Subexponential Algorithm for Abstract Optimization Problems"
-, institution =	"Princeton University"
-, month =	feb
-, year =	1993
-, comments =	"DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
-, update =	"93.09 milone+mitchell"
+, author =      "Bernd G{\"a}rtner"
+, title =       "A Subexponential Algorithm for Abstract Optimization Problems"
+, institution = "Princeton University"
+, month =       feb
+, year =        1993
+, comments =    "DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{g-saaop-95
-, author =	"Bernd G{\"a}rtner"
-, title =	"A Subexponential Algorithm for Abstract Optimization Problems"
-, journal =	"SIAM J. Comput."
-, volume =	24
-, year =	1995
-, pages =	"1018--1035"
-, keywords =	"geometric optimization, randomized algorithm, smallest enclosing ball, distance of convex polyhedra"
-, update =	"96.09 agarwal, 96.05 agarwal"
+, author =      "Bernd G{\"a}rtner"
+, title =       "A Subexponential Algorithm for Abstract Optimization Problems"
+, journal =     "SIAM J. Comput."
+, volume =      24
+, year =        1995
+, pages =       "1018--1035"
+, keywords =    "geometric optimization, randomized algorithm, smallest enclosing ball, distance of convex polyhedra"
+, update =      "96.09 agarwal, 96.05 agarwal"
 }
 
 @inproceedings{g-ealcc-98
-, author =	"Bernd G{\"a}rtner"
-, title =	"Exact Arithmetic at Low Cost: {A} Case Study in Linear Programming"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"157--166"
-, update =	"99.07 bibrelex, 98.07 mitchell"
+, author =      "Bernd G{\"a}rtner"
+, title =       "Exact Arithmetic at Low Cost: {A} Case Study in Linear Programming"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "157--166"
+, update =      "99.07 bibrelex, 98.07 mitchell"
 }
 
 @inproceedings{g-pcpd-00
-, author =	"Bernd G{\"a}rtner"
-, title =	"Pitfalls in Computing with Pseudorandom Determinants"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"148--155"
-, update =	"00.11 jones"
+, author =      "Bernd G{\"a}rtner"
+, title =       "Pitfalls in Computing with Pseudorandom Determinants"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "148--155"
+, update =      "00.11 jones"
 }
 
 @phdthesis{g-rostm-95
-, author =	"B. G{\"a}rtner"
-, title =	"Randomized Optimization by Simplex-Type Methods"
-, school =	"Freie Universit{\"a}t Berlin"
-, year =	1995
-, keywords =	"doctoral thesis"
-, update =	"97.03 gaertner+salinger"
+, author =      "B. G{\"a}rtner"
+, title =       "Randomized Optimization by Simplex-Type Methods"
+, school =      "Freie Universit{\"a}t Berlin"
+, year =        1995
+, keywords =    "doctoral thesis"
+, update =      "97.03 gaertner+salinger"
 }
 
 @mastersthesis{g-ssbvc-91
-, author =	"B. G{\"a}rtner"
-, title =	"Set Systems of Bounded {Vapnik}-{Chervonenkis} Dimension and a Relation to Arrangements"
-, type =	"Masters Thesis"
-, school =	"Fachbereich Mathematik, Freie Univ. Berlin"
-, address =	"Berlin, Germany"
-, year =	1991
-, keywords =	"masters thesis"
-, update =	"97.03 gaertner+salinger"
+, author =      "B. G{\"a}rtner"
+, title =       "Set Systems of Bounded {Vapnik}-{Chervonenkis} Dimension and a Relation to Arrangements"
+, type =        "Masters Thesis"
+, school =      "Fachbereich Mathematik, Freie Univ. Berlin"
+, address =     "Berlin, Germany"
+, year =        1991
+, keywords =    "masters thesis"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{gs-eegqp-00
-, author =	"Bernd G{\"a}rtner and Svend Sch{\"o}nherr"
-, title =	"An Efficient, Exact, and Generic Quadratic Programming Solver for Geometric Optimization"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"110--118"
-, update =	"00.11 jones"
+, author =      "Bernd G{\"a}rtner and Svend Sch{\"o}nherr"
+, title =       "An Efficient, Exact, and Generic Quadratic Programming Solver for Geometric Optimization"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "110--118"
+, update =      "00.11 jones"
 }
 
 @inproceedings{gs-epsee-97
-, author =	"B. G{\"a}rtner and S. Sch{\"o}nherr"
-, title =	"Exact Primitives for Smallest Enclosing Ellipses"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"430--432"
-, cites =	"as-rssua-93, dll-udleu-57, d-ccpac-92, gs-seefe-97t, j-episc-48, msw-sblp-92, p-cmse-82, s-bkeup-94, st-mce-80, s-ac-57, t-odsga-75, w-sedbe-91a, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "B. G{\"a}rtner and S. Sch{\"o}nherr"
+, title =       "Exact Primitives for Smallest Enclosing Ellipses"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "430--432"
+, cites =       "as-rssua-93, dll-udleu-57, d-ccpac-92, gs-seefe-97t, j-episc-48, msw-sblp-92, p-cmse-82, s-bkeup-94, st-mce-80, s-ac-57, t-odsga-75, w-sedbe-91a, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @techreport{gs-seefe-97t
-, author =	"B. G{\"a}rtner and S. Sch{\"o}nherr"
-, title =	"Smallest enclosing ellipses - fast and exact"
-, type =	"Technical {Report}"
-, institution =	"Free University Berlin"
-, address =	"Berlin, Germany"
-, year =	1997
-, update =	"98.07 bibrelex"
+, author =      "B. G{\"a}rtner and S. Sch{\"o}nherr"
+, title =       "Smallest enclosing ellipses - fast and exact"
+, type =        "Technical {Report}"
+, institution = "Free University Berlin"
+, address =     "Berlin, Germany"
+, year =        1997
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{gw-lpraf-96
-, author =	"Bernd G{\"a}rtner and Emo Welzl"
-, title =	"Linear Programming -- Randomization and Abstract Frameworks"
-, booktitle =	"Proc. 13th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1046
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"669--687"
-, keywords =	"survey paper, linear programming, randomization, abstract frameworks"
-, update =	"97.03 agarwal+gaertner+salinger+pocchiola"
+, author =      "Bernd G{\"a}rtner and Emo Welzl"
+, title =       "Linear Programming -- Randomization and Abstract Frameworks"
+, booktitle =   "Proc. 13th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1046
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "669--687"
+, keywords =    "survey paper, linear programming, randomization, abstract frameworks"
+, update =      "97.03 agarwal+gaertner+salinger+pocchiola"
 }
 
 @inproceedings{gw-rsgon-00
-, author =	"Bernd G{\" a}rtner and Emo Welzl"
-, title =	"Random sampling in geometric optimization: {N}ew insights and applications"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"91--99"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Bernd G{\" a}rtner and Emo Welzl"
+, title =       "Random sampling in geometric optimization: {N}ew insights and applications"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "91--99"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @article{gw-vcdph-94
-, author =	"B. G{\"a}rtner and Emo Welzl"
-, title =	"{Vapnik}-{Chervonenkis} Dimension and (Pseudo-)Hyperplane Arrangements"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"399--432"
-, update =	"98.03 mitchell, 97.03 gaertner+salinger"
+, author =      "B. G{\"a}rtner and Emo Welzl"
+, title =       "{Vapnik}-{Chervonenkis} Dimension and (Pseudo-)Hyperplane Arrangements"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "399--432"
+, update =      "98.03 mitchell, 97.03 gaertner+salinger"
 }
 
 @inproceedings{gz-rsakm-94
-, author =	"B. G{\"a}rtner and G. Ziegler"
-, title =	"Randomized Simplex Algorithms on {Klee}-{Minty} Cubes"
-, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1994
-, pages =	"502--510"
-, update =	"97.03 gaertner+salinger"
+, author =      "B. G{\"a}rtner and G. Ziegler"
+, title =       "Randomized Simplex Algorithms on {Klee}-{Minty} Cubes"
+, booktitle =   "Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1994
+, pages =       "502--510"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{gs-capof-55
-, author =	"Saul I. Gass and Thomas Saaty"
-, title =	"The computational algorithm for the parametric objective function"
-, journal =	"Naval Research Logistics"
-, volume =	2
-, year =	1955
-, pages =	"39--45"
-, update =	"97.11 bibrelex"
+, author =      "Saul I. Gass and Thomas Saaty"
+, title =       "The computational algorithm for the parametric objective function"
+, journal =     "Naval Research Logistics"
+, volume =      2
+, year =        1955
+, pages =       "39--45"
+, update =      "97.11 bibrelex"
 }
 
 @article{gl-trluo-84
-, author =	"P. Gaston and T. Lozano-Perez"
-, title =	"Tactile recognition and localization using object models: {The} case of polyhedra on a plane"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-6"
-, month =	may
-, year =	1984
-, pages =	"257--266"
-, update =	"98.03 bibrelex"
+, author =      "P. Gaston and T. Lozano-Perez"
+, title =       "Tactile recognition and localization using object models: {The} case of polyhedra on a plane"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-6"
+, month =       may
+, year =        1984
+, pages =       "257--266"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{g-act-88
-, author =	"Joachim von zur Gathen"
-, title =	"Algebraic Complexity Theory"
-, booktitle =	"Annu. Rev. Comput. Sci."
-, volume =	3
-, publisher =	"Annual Reviews"
-, address =	"Palo Alto, CA"
-, year =	1988
-, pages =	"317--347"
-, update =	"97.07 agarwal"
+, author =      "Joachim von zur Gathen"
+, title =       "Algebraic Complexity Theory"
+, booktitle =   "Annu. Rev. Comput. Sci."
+, volume =      3
+, publisher =   "Annual Reviews"
+, address =     "Palo Alto, CA"
+, year =        1988
+, pages =       "317--347"
+, update =      "97.07 agarwal"
 }
 
 @article{g-amcmc-72
-, author =	"F. Gavril"
-, title =	"Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques and Maximum Independent Set of a Chordal Graph"
-, journal =	"SIAM J. Comput."
-, volume =	1
-, number =	2
-, year =	1972
-, pages =	"180--187"
-, update =	"98.03 bibrelex"
+, author =      "F. Gavril"
+, title =       "Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques and Maximum Independent Set of a Chordal Graph"
+, journal =     "SIAM J. Comput."
+, volume =      1
+, number =      2
+, year =        1972
+, pages =       "180--187"
+, update =      "98.03 bibrelex"
 }
 
 @article{g-acag-74
-, author =	"F. Gavril"
-, title =	"Algorithms on circular-arc graphs"
-, journal =	"Networks"
-, volume =	4
-, year =	1974
-, pages =	"357--369"
-, update =	"98.07 bibrelex"
+, author =      "F. Gavril"
+, title =       "Algorithms on circular-arc graphs"
+, journal =     "Networks"
+, volume =      4
+, year =        1974
+, pages =       "357--369"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{g-sncpg-77
-, author =	"F. Gavril"
-, title =	"Some {NP}-complete problems on graphs"
-, booktitle =	"Proc. 11th Conf. Inform. Sci. Syst."
-, site =	"Baltimore, MD"
-, organization =	"Johns Hopkins University"
-, year =	1977
-, pages =	"91--95"
-, update =	"98.07 bibrelex"
+, author =      "F. Gavril"
+, title =       "Some {NP}-complete problems on graphs"
+, booktitle =   "Proc. 11th Conf. Inform. Sci. Syst."
+, site =        "Baltimore, MD"
+, organization =        "Johns Hopkins University"
+, year =        1977
+, pages =       "91--95"
+, update =      "98.07 bibrelex"
 }
 
 @article{g-igsec-74
-, author =	"F. Gavril"
-, title =	"The intersection graphs of subtrees is exactly the chordal graphs"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	16
-, year =	1974
-, pages =	"47--56"
-, update =	"98.11 bibrelex"
+, author =      "F. Gavril"
+, title =       "The intersection graphs of subtrees is exactly the chordal graphs"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      16
+, year =        1974
+, pages =       "47--56"
+, update =      "98.11 bibrelex"
 }
 
 @article{grr-ecvdd-00
-, author =	"M. Gavrilova and H. Ratschek and J. Rokne"
-, title =	"Exact Computation of {Voronoi} Diagram and {Delaunay} Triangulation"
-, journal =	"J. Reliable Computing"
-, volume =	6
-, number =	1
-, year =	2000
-, pages =	"39--60"
-, update =	"00.11 smid, 00.07 held"
+, author =      "M. Gavrilova and H. Ratschek and J. Rokne"
+, title =       "Exact Computation of {Voronoi} Diagram and {Delaunay} Triangulation"
+, journal =     "J. Reliable Computing"
+, volume =      6
+, number =      1
+, year =        2000
+, pages =       "39--60"
+, update =      "00.11 smid, 00.07 held"
 }
 
 @inproceedings{grg-dcdac-96
-, author =	"Marina Gavrilova and Jon Rokne and Dmitri Gavrilov"
-, title =	"Dynamic Collision Detection Algorithms in Computational Geometry"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"103--106"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Marina Gavrilova and Jon Rokne and Dmitri Gavrilov"
+, title =       "Dynamic Collision Detection Algorithms in Computational Geometry"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "103--106"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @techreport{g-iaspg-86
-, author =	"H. Gazit"
-, title =	"An Improved Algorithm for Separating a Planar Graph"
-, type =	"Manuscript"
-, institution =	"Univ. Southern California"
-, address =	"Los Ageles, CA"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "H. Gazit"
+, title =       "An Improved Algorithm for Separating a Planar Graph"
+, type =        "Manuscript"
+, institution = "Univ. Southern California"
+, address =     "Los Ageles, CA"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gm-psen-90
-, author =	"H. Gazit and G. L. Miller"
-, title =	"Planar separators and the {Euclidean} norm"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, site =	"Tokyo, Japan"
-, organization =	"Information Processing Society of Japan"
-, publisher =	"Springer-Verlag"
-, month =	aug
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "H. Gazit and G. L. Miller"
+, title =       "Planar separators and the {Euclidean} norm"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, site =        "Tokyo, Japan"
+, organization =        "Information Processing Society of Japan"
+, publisher =   "Springer-Verlag"
+, month =       aug
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gm-eha3s-87
-, author =	"P. Gburzynski and M. McLeish"
-, title =	"An efficient heuristic algorithm for a $3$-space $n$-partitioning problem used in polygon retrieval and non-parametric statistics"
-, booktitle =	"Proc. Allerton Conf."
-, year =	1987
-, pages =	"908--916"
-, update =	"98.07 bibrelex"
+, author =      "P. Gburzynski and M. McLeish"
+, title =       "An efficient heuristic algorithm for a $3$-space $n$-partitioning problem used in polygon retrieval and non-parametric statistics"
+, booktitle =   "Proc. Allerton Conf."
+, year =        1987
+, pages =       "908--916"
+, update =      "98.07 bibrelex"
 }
 
 @book{g-nivpo-71
-, author =	"W. C. Gear"
-, title =	"Numerical Initial Value Problems in Ordinary Differential Equations"
-, publisher =	"Prentice Hall"
-, year =	1971
-, update =	"97.11 bibrelex"
+, author =      "W. C. Gear"
+, title =       "Numerical Initial Value Problems in Ordinary Differential Equations"
+, publisher =   "Prentice Hall"
+, year =        1971
+, update =      "97.11 bibrelex"
 }
 
 @article{get-hpfrt-89
-, author =	"J. N. Gederquist and M. T. Eismann and A. M. Tai"
-, title =	"Holographic polar formatting and real-time optical processing of synthetic radar data"
-, journal =	"Appl. Optics"
-, volume =	1928
-, number =	19
-, year =	1989
-, pages =	"4182--4189"
-, update =	"97.11 bibrelex"
+, author =      "J. N. Gederquist and M. T. Eismann and A. M. Tai"
+, title =       "Holographic polar formatting and real-time optical processing of synthetic radar data"
+, journal =     "Appl. Optics"
+, volume =      1928
+, number =      19
+, year =        1989
+, pages =       "4182--4189"
+, update =      "97.11 bibrelex"
 }
 
 @article{gt-cghgt-84
-, author =	"J. N. Gederquist and A. M. Tai"
-, title =	"Computer-generated holograms for geometric transformations"
-, journal =	"Appl. Optics"
-, volume =	23
-, number =	18
-, year =	1984
-, pages =	"3099--3104"
-, update =	"97.11 bibrelex"
+, author =      "J. N. Gederquist and A. M. Tai"
+, title =       "Computer-generated holograms for geometric transformations"
+, journal =     "Appl. Optics"
+, volume =      23
+, number =      18
+, year =        1984
+, pages =       "3099--3104"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{g-cnugc-95
-, author =	"Carl Van Geem"
-, title =	"Computation of a Non-Uniform Grid on the Configuration Space of a Robot Arm Amidst Obstacles: Intersection Problem"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"75--78"
-, update =	"00.03 bibrelex"
+, author =      "Carl Van Geem"
+, title =       "Computation of a Non-Uniform Grid on the Configuration Space of a Robot Arm Amidst Obstacles: Intersection Problem"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "75--78"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{g-tfsmg-94
-, author =	"Carl van Geem"
-, title =	"Towards a Fast Solution Method for the General Robot Motion Planning Problem Using a {Manhattan}-like Distance Function on a Non-Uniform Grid in Configuration Space"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"73--76"
-, cites =	"ZZZ"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Carl van Geem"
+, title =       "Towards a Fast Solution Method for the General Robot Motion Planning Problem Using a {Manhattan}-like Distance Function on a Non-Uniform Grid in Configuration Space"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "73--76"
+, cites =       "ZZZ"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{g-3dmud-95
-, author =	"Bernhard Geiger"
-, title =	"{3D} {Modeling} Using the {Delaunay} Triangulation"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"V11--V12"
-, keywords =	"video review"
-, cites =	"bg-tdrcs-93, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Bernhard Geiger"
+, title =       "{3D} {Modeling} Using the {Delaunay} Triangulation"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "V11--V12"
+, keywords =    "video review"
+, cites =       "bg-tdrcs-93, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @techreport{g-tdmho-93b
-, author =	"Bernhard Geiger"
-, title =	"Three-dimensional modeling of human organs and its application to diagnosis and surgical planning"
-, type =	"Report"
-, number =	2105
-, institution =	"INRIA Sophia-Antipolis"
-, address =	"Valbonne, France"
-, year =	1993
-, succeeds =	"g-tdmho-93"
-, update =	"99.07 devillers, 94.05 devillers"
+, author =      "Bernhard Geiger"
+, title =       "Three-dimensional modeling of human organs and its application to diagnosis and surgical planning"
+, type =        "Report"
+, number =      2105
+, institution = "INRIA Sophia-Antipolis"
+, address =     "Valbonne, France"
+, year =        1993
+, succeeds =    "g-tdmho-93"
+, update =      "99.07 devillers, 94.05 devillers"
 }
 
 @phdthesis{g-tdmho-93
-, author =	"Bernhard Geiger"
-, title =	"Three-dimensional modeling of human organs and its application to diagnosis and surgical planning"
-, type =	"Th\`{e}se de Doctorat en Sciences"
-, school =	"Ecole Nationale Sup\'erieure des Mines de Paris"
-, address =	"France"
-, year =	1993
-, keywords =	"doctoral thesis"
-, precedes =	"g-tdmho-93b"
-, update =	"99.07 devillers, 94.05 devillers, 93.09 devillers"
+, author =      "Bernhard Geiger"
+, title =       "Three-dimensional modeling of human organs and its application to diagnosis and surgical planning"
+, type =        "Th\`{e}se de Doctorat en Sciences"
+, school =      "Ecole Nationale Sup\'erieure des Mines de Paris"
+, address =     "France"
+, year =        1993
+, keywords =    "doctoral thesis"
+, precedes =    "g-tdmho-93b"
+, update =      "99.07 devillers, 94.05 devillers, 93.09 devillers"
 }
 
 @book{s-5hbc-38
-, author =	"{Dr. Seuss} [Theodore Seuss Geisel]"
-, title =	"The 500 Hats of Bartholomew Cubbins"
-, publisher =	"Vanguard Press"
-, year =	1938
-, comments =	"Early recursion [Jeff Erickson]"
-, update =	"01.11 orourke"
+, author =      "{Dr. Seuss} [Theodore Seuss Geisel]"
+, title =       "The 500 Hats of Bartholomew Cubbins"
+, publisher =   "Vanguard Press"
+, year =        1938
+, comments =    "Early recursion [Jeff Erickson]"
+, update =      "01.11 orourke"
 }
 
 @book{s-chcb-58
-, author =	"{Dr. Seuss} [Theodore Seuss Geisel]"
-, title =	"The Cat in the Hat Comes Back"
-, series =	"Beginner Books"
-, publisher =	"Random House"
-, year =	1958
-, comments =	"Early recursion [Jeff Erickson]"
-, update =	"01.11 orourke"
+, author =      "{Dr. Seuss} [Theodore Seuss Geisel]"
+, title =       "The Cat in the Hat Comes Back"
+, series =      "Beginner Books"
+, publisher =   "Random House"
+, year =        1958
+, comments =    "Early recursion [Jeff Erickson]"
+, update =      "01.11 orourke"
 }
 
 @incollection{g-rgtpm-63
-, author =	"H. Gelernter"
-, title =	"Realization of a geometry theorem proving machine"
-, editor =	"E. A. Feigenbaum and J. E. Feldman"
-, booktitle =	"Computers and Thought"
-, publisher =	"McGraw-Hill"
-, address =	"New York, NY"
-, year =	1963
-, update =	"98.03 bibrelex"
+, author =      "H. Gelernter"
+, title =       "Realization of a geometry theorem proving machine"
+, editor =      "E. A. Feigenbaum and J. E. Feldman"
+, booktitle =   "Computers and Thought"
+, publisher =   "McGraw-Hill"
+, address =     "New York, NY"
+, year =        1963
+, update =      "98.03 bibrelex"
 }
 
 @book{gkz-drmd-94
-, author =	"I. M. Gelfand and M. M. Kapranov and A. V. Zelevinski"
-, title =	"Discriminants, Resultants and Mulidimensional Determinants"
-, publisher =	"Birkh{\"a}user"
-, address =	"Boston, MA"
-, year =	1994
-, update =	"97.11 bibrelex"
+, author =      "I. M. Gelfand and M. M. Kapranov and A. V. Zelevinski"
+, title =       "Discriminants, Resultants and Mulidimensional Determinants"
+, publisher =   "Birkh{\"a}user"
+, address =     "Boston, MA"
+, year =        1994
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ggt-tdsdp-98
-, author =	"Natasha Gelfand and Michael T. Goodrich and Roberto Tamassia"
-, title =	"Teaching Data Structure Design Patterns"
-, booktitle =	"Proc. ACM Symp. Computer Science Education"
-, year =	1998
-, update =	"98.11 tamassia"
+, author =      "Natasha Gelfand and Michael T. Goodrich and Roberto Tamassia"
+, title =       "Teaching Data Structure Design Patterns"
+, booktitle =   "Proc. ACM Symp. Computer Science Education"
+, year =        1998
+, update =      "98.11 tamassia"
 }
 
 @inproceedings{gt-apogd-98
-, author =	"Natasha Gelfand and Roberto Tamassia"
-, title =	"Algorithmic Patterns for Orthogonal Graph Drawing"
-, editor =	"S. H. Whitesides"
-, booktitle =	"Graph Drawing (Proc. GD~'98)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1547
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"138--152"
-, keywords =	"graph drawing, planar, orthogonal, system"
-, update =	"99.07 vismara, 99.03 vismara, 98.11 tamassia"
+, author =      "Natasha Gelfand and Roberto Tamassia"
+, title =       "Algorithmic Patterns for Orthogonal Graph Drawing"
+, editor =      "S. H. Whitesides"
+, booktitle =   "Graph Drawing (Proc. GD~'98)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1547
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "138--152"
+, keywords =    "graph drawing, planar, orthogonal, system"
+, update =      "99.07 vismara, 99.03 vismara, 98.11 tamassia"
 }
 
 @book{g-vcem-77
-, title =	"The {VNR} Concise Encyclopedia of Mathematics"
-, editor =	"Gellert"
-, publisher =	"Van Nostrand Reinhold"
-, year =	1977
-, update =	"98.03 bibrelex"
+, title =       "The {VNR} Concise Encyclopedia of Mathematics"
+, editor =      "Gellert"
+, publisher =   "Van Nostrand Reinhold"
+, year =        1977
+, update =      "98.03 bibrelex"
 }
 
 @book{gghkk-vcem-89
-, author =	"W. Gellert and S. Gottwald and M. Hellwich and H. K{\"a}stner and H. K{\"u}stner"
-, title =	"The {VNR} Concise Encyclopedia of Mathematics"
-, edition =	"2nd"
-, publisher =	"Van Nostrand Reinhold"
-, address =	"New York"
-, year =	1989
-, update =	"98.11 bibrelex"
+, author =      "W. Gellert and S. Gottwald and M. Hellwich and H. K{\"a}stner and H. K{\"u}stner"
+, title =       "The {VNR} Concise Encyclopedia of Mathematics"
+, edition =     "2nd"
+, publisher =   "Van Nostrand Reinhold"
+, address =     "New York"
+, year =        1989
+, update =      "98.11 bibrelex"
 }
 
 @article{gd-bsrsc-95
-, author =	"S. M. Gelston and D. Dutta"
-, title =	"Boundary Surface Recovery from Skeleton Curves and Surfaces"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	12
-, number =	1
-, month =	feb
-, year =	1995
-, pages =	"27--51"
-, update =	"97.07 held"
+, author =      "S. M. Gelston and D. Dutta"
+, title =       "Boundary Surface Recovery from Skeleton Curves and Surfaces"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      12
+, number =      1
+, month =       feb
+, year =        1995
+, pages =       "27--51"
+, update =      "97.07 held"
 }
 
 @article{gp-1stp-87
-, author =	"G. Georgakopoulos and C. H. Papadimitriou"
-, title =	"The $1$-{Steiner} tree problem"
-, journal =	"J. Algorithms"
-, volume =	8
-, year =	1987
-, pages =	"122--130"
+, author =      "G. Georgakopoulos and C. H. Papadimitriou"
+, title =       "The $1$-{Steiner} tree problem"
+, journal =     "J. Algorithms"
+, volume =      8
+, year =        1987
+, pages =       "122--130"
 }
 
 @article{g-ndrfe-73
-, author =	"J. A. George"
-, title =	"Nested dissection of a regular finite element mesh"
-, journal =	"SIAM J. Numer. Anal."
-, volume =	10
-, year =	1973
-, pages =	"345--363"
-, update =	"98.03 bibrelex"
+, author =      "J. A. George"
+, title =       "Nested dissection of a regular finite element mesh"
+, journal =     "SIAM J. Numer. Anal."
+, volume =      10
+, year =        1973
+, pages =       "345--363"
+, update =      "98.03 bibrelex"
 }
 
 @book{gl-cslsp-81
-, author =	"J. A. George and J. W. Liu"
-, title =	"Computer Solution of Large Sparse Positive Definite Systems"
-, publisher =	"Prentice Hall"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "J. A. George and J. W. Liu"
+, title =       "Computer Solution of Large Sparse Positive Definite Systems"
+, publisher =   "Prentice Hall"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @book{gb-tdmae-97
-, author =	"Paul-Louis George and Houman Borouchaki"
-, title =	"Triangulation de {Delaunay} et maillage. Applications aux \'el\'ements finis"
-, publisher =	"Hermes"
-, address =	"Paris, France"
-, year =	1997
-, update =	"00.03 devillers"
+, author =      "Paul-Louis George and Houman Borouchaki"
+, title =       "Triangulation de {Delaunay} et maillage. Applications aux \'el\'ements finis"
+, publisher =   "Hermes"
+, address =     "Paris, France"
+, year =        1997
+, update =      "00.03 devillers"
 }
 
 @article{ghs-amgsb-91
-, author =	"P. L. George and F. Hecht and E. Saltel"
-, title =	"Automatic Mesh Generator With Specified Boundary"
-, journal =	"Computer Methods in Applied Mechanics and Engineering"
-, volume =	92
-, number =	3
-, month =	nov
-, year =	1991
-, pages =	"269--288"
-, keywords =	"finite element mesh generation, automatic mesh generators, finite element boundary fitting, two-dimensional domain meshing, three-dimensional domain meshing, Voronoi's theory"
-, abstract =	"For the purpose of finite element computation for 2D
-		 or 3D geometry, one needs an appropriate mesh of the
-		 considered domain. A class of fully automatic methods,
-		 derived from Voronoi's theory, is suitable for
-		 generating a mesh of any shape via a set of points
-		 describing the geometry. Such methods, providing
-		 triangles in 2D and tetrahedra in 3D, can be seen,
-		 after an adequate initialization, as the merger of each
-		 given point in an existing mesh using an updating
-		 process. Unfortunately, this mesh, which contains all
-		 the given points, does not contain, in general, the
-		 edges (or the faces) of the boundary which are the
-		 natural data to be satisfied. The aim of this paper is,
-		 after a brief survey of the different steps of the
-		 above-mentioned method, to point out the problem of the
-		 exact fitting of the given boundary and to present a
-		 method which guarantees this crucial property. (Edited
-		 author abstract) 18 Refs."
+, author =      "P. L. George and F. Hecht and E. Saltel"
+, title =       "Automatic Mesh Generator With Specified Boundary"
+, journal =     "Computer Methods in Applied Mechanics and Engineering"
+, volume =      92
+, number =      3
+, month =       nov
+, year =        1991
+, pages =       "269--288"
+, keywords =    "finite element mesh generation, automatic mesh generators, finite element boundary fitting, two-dimensional domain meshing, three-dimensional domain meshing, Voronoi's theory"
+, abstract =    "For the purpose of finite element computation for 2D
+                 or 3D geometry, one needs an appropriate mesh of the
+                 considered domain. A class of fully automatic methods,
+                 derived from Voronoi's theory, is suitable for
+                 generating a mesh of any shape via a set of points
+                 describing the geometry. Such methods, providing
+                 triangles in 2D and tetrahedra in 3D, can be seen,
+                 after an adequate initialization, as the merger of each
+                 given point in an existing mesh using an updating
+                 process. Unfortunately, this mesh, which contains all
+                 the given points, does not contain, in general, the
+                 edges (or the faces) of the boundary which are the
+                 natural data to be satisfied. The aim of this paper is,
+                 after a brief survey of the different steps of the
+                 above-mentioned method, to point out the problem of the
+                 exact fitting of the given boundary and to present a
+                 method which guarantees this crucial property. (Edited
+                 author abstract) 18 Refs."
 }
 
 @article{ghv-cipvt-91
-, author =	"P. L. George and F. Hecht and M. G. Vallet"
-, title =	"Creation Of Internal Points In {Voronoi's} Type Method. Control Adaptation"
-, journal =	"Advances in Engineering Software and Workstations"
-, volume =	13
-, number =	"5--6"
-, month =	sep
-, year =	1991
-, pages =	"303--312"
-, keywords =	"Voronoi's method, control adaptation, mesh generation, finite element automatic meshes, isotropic and anisotropic meshes"
-, annote =	"Inside flip insertion. Extra points added
-		 adaptively."
-, abstract =	"Devoted to mesh generation based upon a variant of the
-		 Delaunay-Voronoi type of method, this paper briefly
-		 recalls the different steps of such a process with
-		 special attention paid to the process concerning the
-		 creation of internal points. A general background is
-		 introduced which makes the control and the adaptation
-		 of the meshes so created according to some special
-		 specifications possible both for 2D and 3D situations.
-		 (Author abstract) 16 Refs."
+, author =      "P. L. George and F. Hecht and M. G. Vallet"
+, title =       "Creation Of Internal Points In {Voronoi's} Type Method. Control Adaptation"
+, journal =     "Advances in Engineering Software and Workstations"
+, volume =      13
+, number =      "5--6"
+, month =       sep
+, year =        1991
+, pages =       "303--312"
+, keywords =    "Voronoi's method, control adaptation, mesh generation, finite element automatic meshes, isotropic and anisotropic meshes"
+, annote =      "Inside flip insertion. Extra points added
+                 adaptively."
+, abstract =    "Devoted to mesh generation based upon a variant of the
+                 Delaunay-Voronoi type of method, this paper briefly
+                 recalls the different steps of such a process with
+                 special attention paid to the process concerning the
+                 creation of internal points. A general background is
+                 introduced which makes the control and the adaptation
+                 of the meshes so created according to some special
+                 specifications possible both for 2D and 3D situations.
+                 (Author abstract) 16 Refs."
 }
 
 @article{gh-dmcpd-92
-, author =	"P. L. George and F. Hermeline"
-, title =	"Delaunay's Mesh of a Convex Polyhedron In Dimension $d$. Application To Arbitrary Polyhedra"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	33
-, number =	5
-, month =	apr
-, year =	1992
-, pages =	"975--995"
-, keywords =	"Delaunay triangulation, mesh generation, polyhedra"
-, annote =	"Watson's in arbitrary dimensions. Hybrid approach for
-		 robustness -- calculation of simplex volumes is done
-		 exactly but not cc tests. Result is therefore
-		 guaranteed to be a valid mesh."
-, abstract =	"This paper presents a method for creating a Delaunay
-		 triangulation connected to a set of specified points.
-		 The theoretical aspect is recalled for an arbitrary
-		 dimension and the method is discussed in order to
-		 derive a practical approach, valid for dimensions 2 and
-		 3, which is simple, robust and well adapted to
-		 computation. Convex polyhedral and arbitrary polyhedral
-		 situations are introduced. (Author abstract) 22 Refs."
+, author =      "P. L. George and F. Hermeline"
+, title =       "Delaunay's Mesh of a Convex Polyhedron In Dimension $d$. Application To Arbitrary Polyhedra"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      33
+, number =      5
+, month =       apr
+, year =        1992
+, pages =       "975--995"
+, keywords =    "Delaunay triangulation, mesh generation, polyhedra"
+, annote =      "Watson's in arbitrary dimensions. Hybrid approach for
+                 robustness -- calculation of simplex volumes is done
+                 exactly but not cc tests. Result is therefore
+                 guaranteed to be a valid mesh."
+, abstract =    "This paper presents a method for creating a Delaunay
+                 triangulation connected to a set of specified points.
+                 The theoretical aspect is recalled for an arbitrary
+                 dimension and the method is discussed in order to
+                 derive a practical approach, valid for dimensions 2 and
+                 3, which is simple, robust and well adapted to
+                 computation. Convex polyhedral and arbitrary polyhedral
+                 situations are introduced. (Author abstract) 22 Refs."
 }
 
 @inproceedings{gs-cedsb-96
-, author =	"Alexandros Gerbessiotis and Constantinos Siniolakis"
-, title =	"Communication Efficient Data Structures on the BSP Model with Applications in Computational Geometry"
-, booktitle =	"Proceedings of EUROPAR'96"
-, month =	aug
-, year =	1996
-, keywords =	"BSP Model, Data Structures"
-, update =	"96.09 orourke"
+, author =      "Alexandros Gerbessiotis and Constantinos Siniolakis"
+, title =       "Communication Efficient Data Structures on the BSP Model with Applications in Computational Geometry"
+, booktitle =   "Proceedings of EUROPAR'96"
+, month =       aug
+, year =        1996
+, keywords =    "BSP Model, Data Structures"
+, update =      "96.09 orourke"
 }
 
 @article{gv-dbspa-94
-, author =	"A. V. Gerbessiotis and L. G. Valiant"
-, title =	"Direct bulk-synchronous parallel algorithms"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	22
-, year =	1994
-, pages =	"251--267"
-, update =	"96.09 orourke"
+, author =      "A. V. Gerbessiotis and L. G. Valiant"
+, title =       "Direct bulk-synchronous parallel algorithms"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      22
+, year =        1994
+, pages =       "251--267"
+, update =      "96.09 orourke"
 }
 
 @article{gg-rtp-67
-, author =	"L. Gerencs{\'e}r and A. Gy{\'a}rf{\'a}s"
-, title =	"On {Ramsey}-type problems"
-, journal =	"Annales Universitatis Scientarium Budapestinensis Roland E{\H o}tv{\H o}s, Sectio Mathematica"
-, volume =	10
-, year =	1967
-, pages =	"167--170"
-, update =	"97.11 bibrelex"
+, author =      "L. Gerencs{\'e}r and A. Gy{\'a}rf{\'a}s"
+, title =       "On {Ramsey}-type problems"
+, journal =     "Annales Universitatis Scientarium Budapestinensis Roland E{\H o}tv{\H o}s, Sectio Mathematica"
+, volume =      10
+, year =        1967
+, pages =       "167--170"
+, update =      "97.11 bibrelex"
 }
 
 @book{gg-vqsc-91
-, author =	"A. Gersho and R. M. Gray"
-, title =	"Vector Quantization and Signal Compression"
-, publisher =	"Kluwer Academic Publishers"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "A. Gersho and R. M. Gray"
+, title =       "Vector Quantization and Signal Compression"
+, publisher =   "Kluwer Academic Publishers"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @article{g-dpnet-84
-, author =	"J. L. Gerver"
-, title =	"The dissection of a polygon into nearly equilateral triangles"
-, journal =	"Geom. Dedicata"
-, volume =	16
-, year =	1984
-, pages =	"93--106"
-, update =	"97.11 bibrelex"
+, author =      "J. L. Gerver"
+, title =       "The dissection of a polygon into nearly equilateral triangles"
+, journal =     "Geom. Dedicata"
+, volume =      16
+, year =        1984
+, pages =       "93--106"
+, update =      "97.11 bibrelex"
 }
 
 @book{gb-msp-78
-, author =	"A. Getis and B. Boots"
-, title =	"Models of Spatial Processes"
-, publisher =	"Cambridge University Press"
-, year =	1978
-, update =	"97.11 bibrelex"
+, author =      "A. Getis and B. Boots"
+, title =       "Models of Spatial Processes"
+, publisher =   "Cambridge University Press"
+, year =        1978
+, update =      "97.11 bibrelex"
 }
 
 @incollection{g-frtuc-89
-, author =	"P. Getto"
-, title =	"Fast Ray Tracing of Unevaluated Constructive Solid Geometry Models"
-, editor =	"R. A. Earnshaw and B. Wyvill"
-, booktitle =	"New Advances in Computer Graphics: Proc. of Computer Graphics International '89"
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"563--578"
-, update =	"93.09 goodrich"
+, author =      "P. Getto"
+, title =       "Fast Ray Tracing of Unevaluated Constructive Solid Geometry Models"
+, editor =      "R. A. Earnshaw and B. Wyvill"
+, booktitle =   "New Advances in Computer Graphics: Proc. of Computer Graphics International '89"
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "563--578"
+, update =      "93.09 goodrich"
 }
 
 @inproceedings{g-cbnnn-94
-, author =	"N. H. Getz"
-, title =	"Control of balance for a nonlinear nonholonomic nonminimum-phase model of a bicycle"
-, booktitle =	"American Control Conference"
-, site =	"Baltimore, MD"
-, organization =	"American Automatic Control Council"
-, month =	jun
-, year =	1994
-, update =	"97.11 bibrelex"
+, author =      "N. H. Getz"
+, title =       "Control of balance for a nonlinear nonholonomic nonminimum-phase model of a bicycle"
+, booktitle =   "American Control Conference"
+, site =        "Baltimore, MD"
+, organization =        "American Automatic Control Council"
+, month =       jun
+, year =        1994
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{g-eappv-89
-, author =	"L. Gewali"
-, title =	"Efficient Algorithms for Path Planning and Visibility Problems"
-, type =	"Ph.{D}. Dissertation"
-, school =	"Computer Science, Univ. of Texas at Dallas"
-, month =	aug
-, year =	1989
-, keywords =	"doctoral thesis"
-, update =	"93.09 milone+mitchell"
+, author =      "L. Gewali"
+, title =       "Efficient Algorithms for Path Planning and Visibility Problems"
+, type =        "Ph.{D}. Dissertation"
+, school =      "Computer Science, Univ. of Texas at Dallas"
+, month =       aug
+, year =        1989
+, keywords =    "doctoral thesis"
+, update =      "93.09 milone+mitchell"
 }
 
 @unpublished{g-cscvp-93
-, author =	"L. Gewali"
-, title =	"On Computing Stair-Case Visibility Polygon"
-, year =	1993
-, note =	"to appear in Proc. Vision Geometry {II} (SPIE)"
-, precedes =	"gg-cscvp-93"
-, update =	"98.11 bibrelex"
+, author =      "L. Gewali"
+, title =       "On Computing Stair-Case Visibility Polygon"
+, year =        1993
+, note =        "to appear in Proc. Vision Geometry {II} (SPIE)"
+, precedes =    "gg-cscvp-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{g-mmvp-93
-, author =	"L. Gewali"
-, title =	"On minimum and maximum visibility problem"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"240--245"
-, cites =	"c-tsplt-90i, ea-lacvp-81, g-cscvp-93, fm-tspep-84, gkn-copss-92, gn-cgopp-93, ha-gmps-92, ll-ccagp-86, l-vsp-83, mrs-copsp-89, nt-opg-91, o-agta-87, rc-csopm-87, t-cm-88, s-rrag-92, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "L. Gewali"
+, title =       "On minimum and maximum visibility problem"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "240--245"
+, cites =       "c-tsplt-90i, ea-lacvp-81, g-cscvp-93, fm-tspep-84, gkn-copss-92, gn-cgopp-93, ha-gmps-92, ll-ccagp-86, l-vsp-83, mrs-copsp-89, nt-opg-91, o-agta-87, rc-csopm-87, t-cm-88, s-rrag-92, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{g-pgiop-96
-, author =	"L. Gewali"
-, title =	"Placing guards inside orthogonal polygons"
-, journal =	"Inform. Sci."
-, volume =	88
-, year =	1996
-, pages =	"1--14"
-, update =	"97.07 gewali"
+, author =      "L. Gewali"
+, title =       "Placing guards inside orthogonal polygons"
+, journal =     "Inform. Sci."
+, volume =      88
+, year =        1996
+, pages =       "1--14"
+, update =      "97.07 gewali"
 }
 
 @inproceedings{g-rssp-94
-, author =	"L. Gewali"
-, title =	"Recognizing S-Star Polygons"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"183--188"
-, cites =	"a-eafvp-85, bt-gcaim-92, ea-lacvp-81, fm-tspep-84, gg-cscvp-93, gn-cgopp-93, ha-gmps-92, o-agta-87, ps-cgi-85, s-rrag-92, srw-gsv-cccg-91, sw-gkph-93, t-cm-88, lp-oafkp-79, mrs-copsp-89, rc-csopm-87, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "L. Gewali"
+, title =       "Recognizing S-Star Polygons"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "183--188"
+, cites =       "a-eafvp-85, bt-gcaim-92, ea-lacvp-81, fm-tspep-84, gg-cscvp-93, gn-cgopp-93, ha-gmps-92, o-agta-87, ps-cgi-85, s-rrag-92, srw-gsv-cccg-91, sw-gkph-93, t-cm-88, lp-oafkp-79, mrs-copsp-89, rc-csopm-87, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @article{g-rssp-95
-, author =	"L. Gewali"
-, title =	"Recognizing $s$-star polygons"
-, journal =	"Pattern Recogn."
-, volume =	28
-, year =	1995
-, pages =	"1019--1032"
-, update =	"97.07 gewali"
+, author =      "L. Gewali"
+, title =       "Recognizing $s$-star polygons"
+, journal =     "Pattern Recogn."
+, volume =      28
+, year =        1995
+, pages =       "1019--1032"
+, update =      "97.07 gewali"
 }
 
 @inproceedings{gg-cscvp-93
-, author =	"L. Gewali and D. Glasser"
-, title =	"On Computing Stair-Case Visibility Polygon"
-, booktitle =	"Proc. of the 1993 Systems Science Conf."
-, site =	"Las Vegas"
-, year =	1993
-, succeeds =	"g-cscvp-93"
-, update =	"98.11 bibrelex"
+, author =      "L. Gewali and D. Glasser"
+, title =       "On Computing Stair-Case Visibility Polygon"
+, booktitle =   "Proc. of the 1993 Systems Science Conf."
+, site =        "Las Vegas"
+, year =        1993
+, succeeds =    "g-cscvp-93"
+, update =      "98.11 bibrelex"
 }
 
 @article{gkn-copss-92
-, author =	"L. Gewali and Mark Keil and S. Ntafos"
-, title =	"On covering orthogonal polygons with star-shaped polygons"
-, journal =	"Inform. Sci."
-, volume =	65
-, year =	1992
-, pages =	"45--63"
-, update =	"97.07 gewali"
+, author =      "L. Gewali and Mark Keil and S. Ntafos"
+, title =       "On covering orthogonal polygons with star-shaped polygons"
+, journal =     "Inform. Sci."
+, volume =      65
+, year =        1992
+, pages =       "45--63"
+, update =      "97.07 gewali"
 }
 
 @inproceedings{gmmn-pp0wr-88
-, author =	"L. Gewali and A. Meng and Joseph S. B. Mitchell and S. Ntafos"
-, title =	"Path planning in $0/1/\infty$ weighted regions with applications"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"266--278"
-, keywords =	"maximum concealment, shortest paths, Voronoi diagrams, continuous Dijkstra, visibility"
-, precedes =	"gmmn-pp0wr-90"
-, cites =	"aaghi-vpses-85, aai-spbts-87, cr-nlbtr-87, cn-owr-88, cn-wrsp-87, ea-lacvp-81, ft-fhtu-84, gm-osacv-87, l-prp-78, lc-pgdr-85, m-psp-86, m-aaspt-88, m-spozc-87, m-mcp-, m-mfpd-88, mmp-dgp-87, mp-wrp-85, o-agta-87, rs-spesp-85, r-naspa-86, ss-spps-86, w-cvgnl-85, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "L. Gewali and A. Meng and Joseph S. B. Mitchell and S. Ntafos"
+, title =       "Path planning in $0/1/\infty$ weighted regions with applications"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "266--278"
+, keywords =    "maximum concealment, shortest paths, Voronoi diagrams, continuous Dijkstra, visibility"
+, precedes =    "gmmn-pp0wr-90"
+, cites =       "aaghi-vpses-85, aai-spbts-87, cr-nlbtr-87, cn-owr-88, cn-wrsp-87, ea-lacvp-81, ft-fhtu-84, gm-osacv-87, l-prp-78, lc-pgdr-85, m-psp-86, m-aaspt-88, m-spozc-87, m-mcp-, m-mfpd-88, mmp-dgp-87, mp-wrp-85, o-agta-87, rs-spesp-85, r-naspa-86, ss-spps-86, w-cvgnl-85, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{gmmn-pp0wr-90
-, author =	"L. Gewali and A. Meng and Joseph S. B. Mitchell and S. Ntafos"
-, title =	"Path planning in $0/1/\infty$ weighted regions with applications"
-, journal =	"ORSA J. Comput."
-, volume =	2
-, number =	3
-, year =	1990
-, pages =	"253--272"
-, keywords =	"maximum concealment, shortest paths, Voronoi diagrams, continuous Dijkstra, visibility"
-, succeeds =	"gmmn-pp0wr-88"
-, update =	"00.11 smid, 00.07 icking, 98.03 mitchell"
+, author =      "L. Gewali and A. Meng and Joseph S. B. Mitchell and S. Ntafos"
+, title =       "Path planning in $0/1/\infty$ weighted regions with applications"
+, journal =     "ORSA J. Comput."
+, volume =      2
+, number =      3
+, year =        1990
+, pages =       "253--272"
+, keywords =    "maximum concealment, shortest paths, Voronoi diagrams, continuous Dijkstra, visibility"
+, succeeds =    "gmmn-pp0wr-88"
+, update =      "00.11 smid, 00.07 icking, 98.03 mitchell"
 }
 
 @techreport{gnt-pppvo-89
-, author =	"L. Gewali and S. Ntafos and I. G. Tollis"
-, title =	"Path Planning in the Presence of Vertical Obstacles"
-, type =	"Technical Report"
-, institution =	"Computer Science, University of Texas at Dallas"
-, year =	1989
-, update =	"93.09 milone+mitchell"
+, author =      "L. Gewali and S. Ntafos and I. G. Tollis"
+, title =       "Path Planning in the Presence of Vertical Obstacles"
+, type =        "Technical Report"
+, institution = "Computer Science, University of Texas at Dallas"
+, year =        1989
+, update =      "93.09 milone+mitchell"
 }
 
 @article{gs-cewrp-94
-, author =	"L. Gewali and I. Stojmenovi{\'c}"
-, title =	"Computing external watchman routes on {PRAM}, {BSR}, and interconnection models of parallel computation"
-, journal =	"Parallel Processing Letters"
-, volume =	4
-, year =	1994
-, pages =	"83--93"
-, update =	"97.07 gewali"
+, author =      "L. Gewali and I. Stojmenovi{\'c}"
+, title =       "Computing external watchman routes on {PRAM}, {BSR}, and interconnection models of parallel computation"
+, journal =     "Parallel Processing Letters"
+, volume =      4
+, year =        1994
+, pages =       "83--93"
+, update =      "97.07 gewali"
 }
 
 @techreport{gv-oacmg-92
-, author =	"L. Gewali and R. Venkatasubramanian"
-, title =	"An Optimum Algorithm for Computing Maximum Grazing Area"
-, type =	"Technical Report"
-, number =	"CS-92-023"
-, institution =	"Dept. of Comput. Sci., UNLV"
-, address =	"Las Vegas, Nevada"
-, month =	jun
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "L. Gewali and R. Venkatasubramanian"
+, title =       "An Optimum Algorithm for Computing Maximum Grazing Area"
+, type =        "Technical Report"
+, number =      "CS-92-023"
+, institution = "Dept. of Comput. Sci., UNLV"
+, address =     "Las Vegas, Nevada"
+, month =       jun
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @article{gn-cgopp-93
-, author =	"L. P. Gewali and S. Ntafos"
-, title =	"Covering grids and orthogonal polygons with periscope guards"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, year =	1993
-, pages =	"309--334"
-, update =	"96.09 devillers"
+, author =      "L. P. Gewali and S. Ntafos"
+, title =       "Covering grids and orthogonal polygons with periscope guards"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, year =        1993
+, pages =       "309--334"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{gn-mcgop-90
-, author =	"L. P. Gewali and S. Ntafos"
-, title =	"Minimum covers for grids and orthogonal polygons by periscope guards"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"358--361"
-, cites =	"cr-dduap-87, k-mchco-86, mrs-copsp-88, n-gwg-86, o-agta-87, st-gprp-88, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "L. P. Gewali and S. Ntafos"
+, title =       "Minimum covers for grids and orthogonal polygons by periscope guards"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "358--361"
+, cites =       "cr-dduap-87, k-mchco-86, mrs-copsp-88, n-gwg-86, o-agta-87, st-gprp-88, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{gn-wrppc-95
-, author =	"Laxmi P. Gewali and Simeon Ntafos"
-, title =	"Watchman Routes in the Presence of a Pair of Convex Polygons"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"127--132"
-, update =	"95.09 jones"
+, author =      "Laxmi P. Gewali and Simeon Ntafos"
+, title =       "Watchman Routes in the Presence of a Pair of Convex Polygons"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "127--132"
+, update =      "95.09 jones"
 }
 
 @inproceedings{g-cmvsp-98
-, author =	"S. Ghali"
-, title =	"Computation and Maintenance of Visibility and Shadows in the Plane"
-, booktitle =	"Sixth Int. Conf. in Central Europe on Computer Graphics and Visualization, WSCG '98"
-, month =	feb
-, year =	1998
-, pages =	"117--124"
-, url =	"http://www.dgp.toronto.edu/~ghali/papers/wscg98.ps.gz"
-, keywords =	"visibility, shadows, dynamic algorithms, class hierarchy"
-, update =	"98.03 ghali"
+, author =      "S. Ghali"
+, title =       "Computation and Maintenance of Visibility and Shadows in the Plane"
+, booktitle =   "Sixth Int. Conf. in Central Europe on Computer Graphics and Visualization, WSCG '98"
+, month =       feb
+, year =        1998
+, pages =       "117--124"
+, url = "http://www.dgp.toronto.edu/~ghali/papers/wscg98.ps.gz"
+, keywords =    "visibility, shadows, dynamic algorithms, class hierarchy"
+, update =      "98.03 ghali"
 }
 
 @inproceedings{gs-iuvms-96
-, author =	"Sherif Ghali and A. James Stewart"
-, title =	"Incremental update of the visibility map as seen by a moving viewpoint in two dimensions"
-, booktitle =	"Seventh International Eurographics Workshop on Computer Animation and Simulation"
-, month =	aug
-, year =	1996
-, pages =	"1--11"
-, update =	"98.03 mitchell"
+, author =      "Sherif Ghali and A. James Stewart"
+, title =       "Incremental update of the visibility map as seen by a moving viewpoint in two dimensions"
+, booktitle =   "Seventh International Eurographics Workshop on Computer Animation and Simulation"
+, month =       aug
+, year =        1996
+, pages =       "1--11"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{gs-mssvm-96
-, author =	"Sherif Ghali and A. James Stewart"
-, title =	"Maintenance of the set of segments visible from a moving viewpoint in two dimensions"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"V3--V4"
-, cites =	"bdeg-vmpv-90, gm-osacv-87, mn-lpcgc-95, ol-dmcp-80, ow-nmcvg-88, p-gfr-90, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Sherif Ghali and A. James Stewart"
+, title =       "Maintenance of the set of segments visible from a moving viewpoint in two dimensions"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "V3--V4"
+, cites =       "bdeg-vmpv-90, gm-osacv-87, mn-lpcgc-95, ol-dmcp-80, ow-nmcvg-88, p-gfr-90, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @article{ggr-ngptd-87
-, author =	"G. Ghione and R. D. Graglia and C. Rosati"
-, title =	"New General-Purpose Two-Dimensional Mesh Generator For Finite Elements, Generalized Finite Differences, And Moment Method Applications"
-, journal =	"IEEE Trans. Magn."
-, volume =	24
-, number =	1
-, month =	jan
-, year =	1987
-, pages =	"307--310"
-, keywords =	"2-d mesh generator, finite elements, generalized finite differences, moment method"
-, annote =	"Radial sweep for initial triangulation then switching
-		 as in Mirante."
-, abstract =	"Numerical techniques such as finite elements,
-		 generalized finite differences and moment method for
-		 the solution of two-dimensional-field boundary-value
-		 problems pose different constraints as far as the
-		 discretization of the solution domain is concerned. A
-		 general-purpose, two- dimensional grid generator is
-		 described that produces region triangularizations well
-		 suited to each of the aforementioned methods. The
-		 triangularization is based on the radial sweep
-		 algorithm, which was developed by A. Mirante and N.
-		 Weingarten (1982) for solving topological modelling
-		 problems. Some application results are presented. 13
-		 refs."
+, author =      "G. Ghione and R. D. Graglia and C. Rosati"
+, title =       "New General-Purpose Two-Dimensional Mesh Generator For Finite Elements, Generalized Finite Differences, And Moment Method Applications"
+, journal =     "IEEE Trans. Magn."
+, volume =      24
+, number =      1
+, month =       jan
+, year =        1987
+, pages =       "307--310"
+, keywords =    "2-d mesh generator, finite elements, generalized finite differences, moment method"
+, annote =      "Radial sweep for initial triangulation then switching
+                 as in Mirante."
+, abstract =    "Numerical techniques such as finite elements,
+                 generalized finite differences and moment method for
+                 the solution of two-dimensional-field boundary-value
+                 problems pose different constraints as far as the
+                 discretization of the solution domain is concerned. A
+                 general-purpose, two- dimensional grid generator is
+                 described that produces region triangularizations well
+                 suited to each of the aforementioned methods. The
+                 triangularization is based on the radial sweep
+                 algorithm, which was developed by A. Mirante and N.
+                 Weingarten (1982) for solving topological modelling
+                 problems. Some application results are presented. 13
+                 refs."
 }
 
 @article{gkpt-csmsm-93
-, author =	"A. Ghos and J. Kowalcyk and M. Peterson and A. Treasurywala"
-, title =	"Conformational searching methods for small molecules: {I} study of the sybyl search method"
-, journal =	"J. Comput. Chemistry"
-, volume =	14
-, number =	9
-, year =	1993
-, pages =	"1050--1065"
-, update =	"98.07 bibrelex"
+, author =      "A. Ghos and J. Kowalcyk and M. Peterson and A. Treasurywala"
+, title =       "Conformational searching methods for small molecules: {I} study of the sybyl search method"
+, journal =     "J. Comput. Chemistry"
+, volume =      14
+, number =      9
+, year =        1993
+, pages =       "1050--1065"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{g-ctfsr-86
-, author =	"P. K. Ghosh"
-, title =	"A Computational Theoretic Framework for Shape Representation and Analysis using the {Minkowski} Addition and Decomposition Operators"
-, school =	"Tata Institute of Fundamental Research"
-, address =	"Bombay"
-, year =	1986
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "P. K. Ghosh"
+, title =       "A Computational Theoretic Framework for Shape Representation and Analysis using the {Minkowski} Addition and Decomposition Operators"
+, school =      "Tata Institute of Fundamental Research"
+, address =     "Bombay"
+, year =        1986
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{g-vgmo-91
-, author =	"P. K. Ghosh"
-, title =	"Vision, geometry, and {Minkowski} operators"
-, booktitle =	"Contemporary Mathematics"
-, volume =	119
-, year =	1991
-, pages =	"63--83"
-, update =	"98.07 bibrelex, 96.05 ramkumar"
+, author =      "P. K. Ghosh"
+, title =       "Vision, geometry, and {Minkowski} operators"
+, booktitle =   "Contemporary Mathematics"
+, volume =      119
+, year =        1991
+, pages =       "63--83"
+, update =      "98.07 bibrelex, 96.05 ramkumar"
 }
 
 @inproceedings{gh-mmtdo-93
-, author =	"P. K. Ghosh and R. M. Haralick"
-, title =	"Mathematical morphology of three-dimensional objects: the slope diagrammatic approach"
-, booktitle =	"Proc. SPIE"
-, year =	1993
-, pages =	"2--13"
-, update =	"96.05 ramkumar"
+, author =      "P. K. Ghosh and R. M. Haralick"
+, title =       "Mathematical morphology of three-dimensional objects: the slope diagrammatic approach"
+, booktitle =   "Proc. SPIE"
+, year =        1993
+, pages =       "2--13"
+, update =      "96.05 ramkumar"
 }
 
 @techreport{gm-ctfma-85
-, author =	"P. K. Ghosh and S. P. Mudur"
-, title =	"A computational theoretic framework for {Minkowski} addition and decomposition of boundary represented regions"
-, type =	"Report"
-, number =	"??"
-, institution =	"National Centre Softw. Develop. Comput. Tech., Tata Inst. Fund. Res."
-, address =	"Bombay, India"
-, year =	1985
+, author =      "P. K. Ghosh and S. P. Mudur"
+, title =       "A computational theoretic framework for {Minkowski} addition and decomposition of boundary represented regions"
+, type =        "Report"
+, number =      "??"
+, institution = "National Centre Softw. Develop. Comput. Tech., Tata Inst. Fund. Res."
+, address =     "Bombay, India"
+, year =        1985
 }
 
 @article{gm-pcgds-83
-, author =	"P. K. Ghosh and S. P. Mudur"
-, title =	"Parametric curves for graphic design systems"
-, journal =	"Comput. J."
-, volume =	26
-, year =	1983
-, pages =	"312--219"
+, author =      "P. K. Ghosh and S. P. Mudur"
+, title =       "Parametric curves for graphic design systems"
+, journal =     "Comput. J."
+, volume =      26
+, year =        1983
+, pages =       "312--219"
 }
 
 @article{gm-btafs-84
-, author =	"P. K. Ghosh and S. P. Mudur"
-, title =	"The brush-trajectory approach to figure specification: {Some} algebraic solutions"
-, journal =	"ACM Trans. Graph."
-, volume =	3
-, number =	2
-, year =	1984
-, pages =	"110--134"
+, author =      "P. K. Ghosh and S. P. Mudur"
+, title =       "The brush-trajectory approach to figure specification: {Some} algebraic solutions"
+, journal =     "ACM Trans. Graph."
+, volume =      3
+, number =      2
+, year =        1984
+, pages =       "110--134"
 }
 
 @techreport{g-fasva-87
-, author =	"S. K. Ghosh"
-, title =	"A few applications of the set-visibility algorithm"
-, type =	"Report"
-, number =	"CAR-TR-273"
-, institution =	"Center Automat. Res., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1987
-, update =	"94.05 ghosh"
+, author =      "S. K. Ghosh"
+, title =       "A few applications of the set-visibility algorithm"
+, type =        "Report"
+, number =      "CAR-TR-273"
+, institution = "Center Automat. Res., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1987
+, update =      "94.05 ghosh"
 }
 
 @inproceedings{g-ltadm-83
-, author =	"S. K. Ghosh"
-, title =	"A linear time algorithm for decomposing a monotone polygon into star-shaped polygons"
-, booktitle =	"Proc. 3rd Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, site =	"India"
-, year =	1983
-, pages =	"505--519"
+, author =      "S. K. Ghosh"
+, title =       "A linear time algorithm for decomposing a monotone polygon into star-shaped polygons"
+, booktitle =   "Proc. 3rd Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, site =        "India"
+, year =        1983
+, pages =       "505--519"
 }
 
 @incollection{g-ltadi-84
-, author =	"S. K. Ghosh"
-, title =	"A linear time algorithm for determining the intersection type of two star polygons"
-, booktitle =	"Proc. 4th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	181
-, publisher =	"Springer-Verlag"
-, year =	1984
-, pages =	"317--330"
+, author =      "S. K. Ghosh"
+, title =       "A linear time algorithm for determining the intersection type of two star polygons"
+, booktitle =   "Proc. 4th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      181
+, publisher =   "Springer-Verlag"
+, year =        1984
+, pages =       "317--330"
 }
 
 @article{g-ncha-86
-, author =	"S. K. Ghosh"
-, title =	"A note on convex hull algorithms"
-, journal =	"Pattern Recogn."
-, volume =	19
-, year =	1986
-, pages =	75
+, author =      "S. K. Ghosh"
+, title =       "A note on convex hull algorithms"
+, journal =     "Pattern Recogn."
+, volume =      19
+, year =        1986
+, pages =       75
 }
 
 @inproceedings{g-aaagp-87
-, author =	"S. K. Ghosh"
-, title =	"Approximation algorithms for art gallery problems"
-, booktitle =	"Proc. Canadian Inform. Process. Soc. Congress"
-, year =	1987
-, pages =	"??"
+, author =      "S. K. Ghosh"
+, title =       "Approximation algorithms for art gallery problems"
+, booktitle =   "Proc. Canadian Inform. Process. Soc. Congress"
+, year =        1987
+, pages =       "??"
 }
 
 @inproceedings{g-cvspi-88
-, author =	"S. K. Ghosh"
-, title =	"Computing a Viewpoint of a Set of Points Inside a Polygon"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	338
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"18--29"
-, update =	"96.05 agarwal, 94.05 ghosh"
+, author =      "S. K. Ghosh"
+, title =       "Computing a Viewpoint of a Set of Points Inside a Polygon"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      338
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "18--29"
+, update =      "96.05 agarwal, 94.05 ghosh"
 }
 
 @techreport{g-cvspi-90
-, author =	"S. K. Ghosh"
-, title =	"Computing a Viewpoint of a Set of Points Inside a Polygon"
-, type =	"Technical {Report}"
-, institution =	"Computer Science, Tata Inst."
-, address =	"Bombay, India"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "S. K. Ghosh"
+, title =       "Computing a Viewpoint of a Set of Points Inside a Polygon"
+, type =        "Technical {Report}"
+, institution = "Computer Science, Tata Inst."
+, address =     "Bombay, India"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{g-cvpcs-86
-, author =	"S. K. Ghosh"
-, title =	"Computing the visibility polygon from a convex set"
-, type =	"Report"
-, number =	"CAR-TR-246"
-, institution =	"Center Automat. Res., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1986
+, author =      "S. K. Ghosh"
+, title =       "Computing the visibility polygon from a convex set"
+, type =        "Report"
+, number =      "CAR-TR-246"
+, institution = "Center Automat. Res., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1986
 }
 
 @article{g-cvpcs-91
-, author =	"S. K. Ghosh"
-, title =	"Computing visibility polygon from a convex set and related problems"
-, journal =	"J. Algorithms"
-, volume =	12
-, year =	1991
-, pages =	"75--95"
-, keywords =	"polygon, visibility"
-, update =	"94.05 ghosh"
+, author =      "S. K. Ghosh"
+, title =       "Computing visibility polygon from a convex set and related problems"
+, journal =     "J. Algorithms"
+, volume =      12
+, year =        1991
+, pages =       "75--95"
+, keywords =    "polygon, visibility"
+, update =      "94.05 ghosh"
 }
 
 @techreport{g-rcvgs-86
-, author =	"S. K. Ghosh"
-, title =	"On recognizing and characterizing visibility graphs of simple polygons"
-, type =	"Report"
-, number =	"JHU/EECS-86/14"
-, institution =	"Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1986
-, precedes =	"g-rcvgs-88"
+, author =      "S. K. Ghosh"
+, title =       "On recognizing and characterizing visibility graphs of simple polygons"
+, type =        "Report"
+, number =      "JHU/EECS-86/14"
+, institution = "Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1986
+, precedes =    "g-rcvgs-88"
 }
 
 @inproceedings{g-rcvgs-88
-, author =	"S. K. Ghosh"
-, title =	"On recognizing and characterizing visibility graphs of simple polygons"
-, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	318
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"96--104"
-, succeeds =	"g-rcvgs-86"
+, author =      "S. K. Ghosh"
+, title =       "On recognizing and characterizing visibility graphs of simple polygons"
+, booktitle =   "Proc. 1st Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      318
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "96--104"
+, succeeds =    "g-rcvgs-86"
 }
 
 @article{g-rcvgs-97
-, author =	"S. K. Ghosh"
-, title =	"On recognizing and characterizing visibility graphs of simple polygons"
-, journal =	"Discrete Comput. Geom."
-, volume =	17
-, year =	1997
-, pages =	"143--162"
-, succeeds =	"g-rcvgs-88"
-, update =	"97.11 orourke"
+, author =      "S. K. Ghosh"
+, title =       "On recognizing and characterizing visibility graphs of simple polygons"
+, journal =     "Discrete Comput. Geom."
+, volume =      17
+, year =        1997
+, pages =       "143--162"
+, succeeds =    "g-rcvgs-88"
+, update =      "97.11 orourke"
 }
 
 @phdthesis{g-pcg-87
-, author =	"S. K. Ghosh"
-, title =	"Problems in Computational Geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"Univ. Bombay"
-, year =	1987
-, keywords =	"doctoral thesis"
-, update =	"94.05 ghosh"
+, author =      "S. K. Ghosh"
+, title =       "Problems in Computational Geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "Univ. Bombay"
+, year =        1987
+, keywords =    "doctoral thesis"
+, update =      "94.05 ghosh"
 }
 
 @inproceedings{gb-olaeu-97
-, author =	"Subir K. Ghosh and Joel W. Burdick"
-, title =	"An On--line Algorithm for Exploring an Unknown Polygonal Environment by a Point Robot"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"100--105"
-, update =	"97.11 jones"
+, author =      "Subir K. Ghosh and Joel W. Burdick"
+, title =       "An On--line Algorithm for Exploring an Unknown Polygonal Environment by a Point Robot"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "100--105"
+, update =      "97.11 jones"
 }
 
 @inproceedings{gb-udvra-97
-, author =	"Subir K. Ghosh and Joel W. Burdick"
-, title =	"Understanding Discrete Visibility and related Approximation Algorithms"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"106--111"
-, update =	"97.11 jones"
+, author =      "Subir K. Ghosh and Joel W. Burdick"
+, title =       "Understanding Discrete Visibility and related Approximation Algorithms"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "106--111"
+, update =      "97.11 jones"
 }
 
 @techreport{gm-oacmn-90t
-, author =	"S. K. Ghosh and A. Maheshwari"
-, title =	"An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon"
-, type =	"Technical {Report}"
-, number =	"CS-90/2"
-, institution =	"Tata Inst."
-, year =	1990
-, precedes =	"gm-oacmn-90a"
-, update =	"93.09 milone+mitchell"
+, author =      "S. K. Ghosh and A. Maheshwari"
+, title =       "An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon"
+, type =        "Technical {Report}"
+, number =      "CS-90/2"
+, institution = "Tata Inst."
+, year =        1990
+, precedes =    "gm-oacmn-90a"
+, update =      "93.09 milone+mitchell"
 }
 
 % precise title ?
 @article{gm-oacmn-90a
-, author =	"S. K. Ghosh and A. Maheshwari"
-, title =	"An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	36
-, year =	1990
-, pages =	"277--280"
-, keywords =	"Computational geometry, nested polygon, link path, relative convex hull"
-, update =	"93.09 milone+mitchell+rote"
+, author =      "S. K. Ghosh and A. Maheshwari"
+, title =       "An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      36
+, year =        1990
+, pages =       "277--280"
+, keywords =    "Computational geometry, nested polygon, link path, relative convex hull"
+, update =      "93.09 milone+mitchell+rote"
 }
 
 @techreport{gm-opadi-90
-, author =	"S. K. Ghosh and A. Maheshwari"
-, title =	"An optimal parallel algorithm for determining the intersection type of two star-shaped polygons"
-, type =	"Technical {Report}"
-, institution =	"TATA Inst."
-, address =	"Bombay, India"
-, month =	mar
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "S. K. Ghosh and A. Maheshwari"
+, title =       "An optimal parallel algorithm for determining the intersection type of two star-shaped polygons"
+, type =        "Technical {Report}"
+, institution = "TATA Inst."
+, address =     "Bombay, India"
+, month =       mar
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{gm-opadi-91
-, author =	"S. K. Ghosh and A. Maheshwari"
-, title =	"An optimal parallel algorithm for determining the intersection type of two star-shaped polygons"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"2--6"
-, cites =	"ac-opavs-89,  acg-cdctd-89, cg-opapp-88, g-ltadi-84, hr-omsep-89, kr-spasm-88t, v-ismaa-83, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. K. Ghosh and A. Maheshwari"
+, title =       "An optimal parallel algorithm for determining the intersection type of two star-shaped polygons"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "2--6"
+, cites =       "ac-opavs-89,  acg-cdctd-89, cg-opapp-88, g-ltadi-84, hr-omsep-89, kr-spasm-88t, v-ismaa-83, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{gm-paaml-92
-, author =	"S. K. Ghosh and A. Maheshwari"
-, title =	"Parallel algorithms for all minimum link paths and link center problems"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"106--117"
+, author =      "S. K. Ghosh and A. Maheshwari"
+, title =       "Parallel algorithms for all minimum link paths and link center problems"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "106--117"
 }
 
 @article{gmpsv-crwvp-93
-, author =	"S. K. Ghosh and A. Maheshwari and S. P. Pal and S. Saluja and C. E. {Veni Madhavan}"
-, title =	"Characterizing and recognizing weak visibility polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"213--233"
-, update =	"94.05 ghosh"
+, author =      "S. K. Ghosh and A. Maheshwari and S. P. Pal and S. Saluja and C. E. {Veni Madhavan}"
+, title =       "Characterizing and recognizing weak visibility polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "213--233"
+, update =      "94.05 ghosh"
 }
 
 @techreport{gmpsv-cwvpr-90t
-, author =	"S. K. Ghosh and A. Maheshwari and S. P. Pal and S. Saluja and C. E. {Veni Madhavan}"
-, title =	"Characterizing weak visibility polygons and related problems"
-, type =	"Technical {Report}"
-, number =	"IISc-CSA-90-1"
-, institution =	"Dept. Comput. Sci. Auto., Indian Inst. Sci."
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "S. K. Ghosh and A. Maheshwari and S. P. Pal and S. Saluja and C. E. {Veni Madhavan}"
+, title =       "Characterizing weak visibility polygons and related problems"
+, type =        "Technical {Report}"
+, number =      "IISc-CSA-90-1"
+, institution = "Dept. Comput. Sci. Auto., Indian Inst. Sci."
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gmpsv-cwvpr-90
-, author =	"S. K. Ghosh and A. Maheshwari and S. P. Pal and S. Saluja and C. E. {Veni Madhavan}"
-, title =	"Characterizing weak visibility polygons and related problems"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"93--97"
-, cites =	"at-oadvp-81, c-tsplt-90t, g-cvpcs-91, ghlst-ltavs-87, gmpsv-cwvpr-90t, hm-svpap-90, gpv-awvp-90, s-hpp-87, t-spsee-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. K. Ghosh and A. Maheshwari and S. P. Pal and S. Saluja and C. E. {Veni Madhavan}"
+, title =       "Characterizing weak visibility polygons and related problems"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "93--97"
+, cites =       "at-oadvp-81, c-tsplt-90t, g-cvpcs-91, ghlst-ltavs-87, gmpsv-cwvpr-90t, hm-svpap-90, gpv-awvp-90, s-hpp-87, t-spsee-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{gmpsv-csptw-91
-, author =	"Subir Kumar Ghosh and Anil Maheshwari and Sudebkumar Prasant Pal and Sanjeev Saluja and C. E. {Veni Madhavan}"
-, title =	"Computing the Shortest Path Tree in a Weak Visibility Polygon"
-, booktitle =	"Proc. 11th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	560
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"369--389"
-, update =	"94.09 lambert, 94.05 ghosh, 93.09 milone+mitchell"
+, author =      "Subir Kumar Ghosh and Anil Maheshwari and Sudebkumar Prasant Pal and Sanjeev Saluja and C. E. {Veni Madhavan}"
+, title =       "Computing the Shortest Path Tree in a Weak Visibility Polygon"
+, booktitle =   "Proc. 11th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      560
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "369--389"
+, update =      "94.09 lambert, 94.05 ghosh, 93.09 milone+mitchell"
 }
 
 @inproceedings{gmpv-arpp-90
-, author =	"S. K. Ghosh and A. Maheshwari and S. P. Pal and C. E. {Veni Madhavan}"
-, title =	"An algorithm for recognizing palm polygons"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"246--251"
-, cites =	"c-tsplt-90t, et-gpprl-89, h-ovgat-89, lp-oafkp-79, ZZZ"
-, update =	"01.04 icking, 98.07 bibrelex, 95.01 smid, 94.05 ghosh"
+, author =      "S. K. Ghosh and A. Maheshwari and S. P. Pal and C. E. {Veni Madhavan}"
+, title =       "An algorithm for recognizing palm polygons"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "246--251"
+, cites =       "c-tsplt-90t, et-gpprl-89, h-ovgat-89, lp-oafkp-79, ZZZ"
+, update =      "01.04 icking, 98.07 bibrelex, 95.01 smid, 94.05 ghosh"
 }
 
 @article{gmpv-arpp-94
-, author =	"S. K. Ghosh and A. Maheshwari and S. P. Pal and C. E. {Veni Madhavan}"
-, title =	"An algorithm for recognizing palm polygons"
-, journal =	"Visual Comput."
-, volume =	10
-, year =	1994
-, pages =	"443--451"
-, update =	"95.01 smid"
+, author =      "S. K. Ghosh and A. Maheshwari and S. P. Pal and C. E. {Veni Madhavan}"
+, title =       "An algorithm for recognizing palm polygons"
+, journal =     "Visual Comput."
+, volume =      10
+, year =        1994
+, pages =       "443--451"
+, update =      "95.01 smid"
 }
 
 @techreport{gm-osacv-87t
-, author =	"S. K. Ghosh and D. M. Mount"
-, title =	"An output sensitive algorithm for computing visibility graphs"
-, number =	"CS-TR-1874"
-, institution =	"Department of Computer Science, University of Maryland"
-, month =	jul
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "S. K. Ghosh and D. M. Mount"
+, title =       "An output sensitive algorithm for computing visibility graphs"
+, number =      "CS-TR-1874"
+, institution = "Department of Computer Science, University of Maryland"
+, month =       jul
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{gm-osacv-87
-, author =	"S. K. Ghosh and D. M. Mount"
-, title =	"An output sensitive algorithm for computing visibility graphs"
-, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1987
-, pages =	"11--19"
-, precedes =	"gm-osacv-91"
+, author =      "S. K. Ghosh and D. M. Mount"
+, title =       "An output sensitive algorithm for computing visibility graphs"
+, booktitle =   "Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1987
+, pages =       "11--19"
+, precedes =    "gm-osacv-91"
 }
 
 @article{gm-osacv-91
-, author =	"S. K. Ghosh and D. M. Mount"
-, title =	"An output-sensitive algorithm for computing visibility graphs"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"888--910"
-, keywords =	"visibility, two-dimensional, line segments, polygons, output-dependent"
-, succeeds =	"gm-osacv-87"
-, annote =	"weak visibility between edges of polygonal obstacles;
-		 $O(n \log n + E)$ time"
+, author =      "S. K. Ghosh and D. M. Mount"
+, title =       "An output-sensitive algorithm for computing visibility graphs"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "888--910"
+, keywords =    "visibility, two-dimensional, line segments, polygons, output-dependent"
+, succeeds =    "gm-osacv-87"
+, annote =      "weak visibility between edges of polygonal obstacles;
+                 $O(n \log n + E)$ time"
 }
 
 @techreport{gpv-awvp-90
-, author =	"S. K. Ghosh and S. P. Pal and C. E. {Veni Madhavan}"
-, title =	"Algorithms for weak visibility polygons"
-, type =	"Technical {Report}"
-, number =	"IISc-CSA-90-2"
-, institution =	"TATA Inst."
-, address =	"Bombay, India"
-, month =	jan
-, year =	1990
-, update =	"94.09 lambert, 93.09 milone+mitchell"
+, author =      "S. K. Ghosh and S. P. Pal and C. E. {Veni Madhavan}"
+, title =       "Algorithms for weak visibility polygons"
+, type =        "Technical {Report}"
+, number =      "IISc-CSA-90-2"
+, institution = "TATA Inst."
+, address =     "Bombay, India"
+, month =       jan
+, year =        1990
+, update =      "94.09 lambert, 93.09 milone+mitchell"
 }
 
 @techreport{gpv-cwvpr-90
-, author =	"S. K. Ghosh and S. P. Pal and C. E. {Veni Madhavan}"
-, title =	"Characterizing weak visibility polygons and related problems"
-, type =	"Technical {Report}"
-, number =	"IISc-CSA-90-1"
-, institution =	"TATA Inst."
-, address =	"Bombay, India"
-, month =	jan
-, year =	1990
-, update =	"94.09 lambert, 93.09 milone+mitchell"
+, author =      "S. K. Ghosh and S. P. Pal and C. E. {Veni Madhavan}"
+, title =       "Characterizing weak visibility polygons and related problems"
+, type =        "Technical {Report}"
+, number =      "IISc-CSA-90-1"
+, institution = "TATA Inst."
+, address =     "Bombay, India"
+, month =       jan
+, year =        1990
+, update =      "94.09 lambert, 93.09 milone+mitchell"
 }
 
 @techreport{gs-oolaw-95
-, author =	"S. K. Ghosh and S. Saluja"
-, title =	"Optimal on-line algorithms for walking with minimum number of turns in unknown streets"
-, type =	"Manuscript"
-, number =	"RCS-94-2"
-, institution =	"TATA Institute of Fundamental Research"
-, address =	"Bombay, India"
-, year =	1995
-, keywords =	"link distance, shortest paths, competitive ratio, visibility, simple polygons"
-, precedes =	"gs-oolaw-97"
-, update =	"98.03 bibrelex+mitchell, 95.09 mitchell"
+, author =      "S. K. Ghosh and S. Saluja"
+, title =       "Optimal on-line algorithms for walking with minimum number of turns in unknown streets"
+, type =        "Manuscript"
+, number =      "RCS-94-2"
+, institution = "TATA Institute of Fundamental Research"
+, address =     "Bombay, India"
+, year =        1995
+, keywords =    "link distance, shortest paths, competitive ratio, visibility, simple polygons"
+, precedes =    "gs-oolaw-97"
+, update =      "98.03 bibrelex+mitchell, 95.09 mitchell"
 }
 
 @article{gs-oolaw-97
-, author =	"S. K. Ghosh and S. Saluja"
-, title =	"Optimal on-line algorithms for walking with minimum number of turns in unknown streets"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, number =	5
-, month =	oct
-, year =	1997
-, pages =	"241--266"
-, keywords =	"link distance, shortest paths, competitive ratio, visibility, simple polygons"
-, succeeds =	"gs-oolaw-95"
-, update =	"98.03 mitchell"
+, author =      "S. K. Ghosh and S. Saluja"
+, title =       "Optimal on-line algorithms for walking with minimum number of turns in unknown streets"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, number =      5
+, month =       oct
+, year =        1997
+, pages =       "241--266"
+, keywords =    "link distance, shortest paths, competitive ratio, visibility, simple polygons"
+, succeeds =    "gs-oolaw-95"
+, update =      "98.03 mitchell"
 }
 
 @article{gs-ltacc-84
-, author =	"S. K. Ghosh and R. K. Shyamasundar"
-, title =	"A linear time algorithm for computing the convex hull of an ordered crossing polygon"
-, journal =	"Pattern Recogn."
-, volume =	17
-, year =	1984
-, pages =	"351--358"
+, author =      "S. K. Ghosh and R. K. Shyamasundar"
+, title =       "A linear time algorithm for computing the convex hull of an ordered crossing polygon"
+, journal =     "Pattern Recogn."
+, volume =      17
+, year =        1984
+, pages =       "351--358"
 }
 
 @article{gs-ltaoc-83
-, author =	"S. K. Ghosh and R. K. Shyamasundar"
-, title =	"A linear time algorithm for obtaining the convex hull of a simple polygon"
-, journal =	"Pattern Recogn."
-, volume =	16
-, year =	1983
-, pages =	"587--592"
+, author =      "S. K. Ghosh and R. K. Shyamasundar"
+, title =       "A linear time algorithm for obtaining the convex hull of a simple polygon"
+, journal =     "Pattern Recogn."
+, volume =      16
+, year =        1983
+, pages =       "587--592"
 }
 
 @article{ga-afgfo-68
-, author =	"S. P. Ghosh and C. T. Abraham"
-, title =	"Application of finite geometry in file organization for records with multiple-valued attributes"
-, journal =	"IBM J. Res. Develop."
-, volume =	12
-, year =	1968
-, pages =	"180--187"
+, author =      "S. P. Ghosh and C. T. Abraham"
+, title =       "Application of finite geometry in file organization for records with multiple-valued attributes"
+, journal =     "IBM J. Res. Develop."
+, volume =      12
+, year =        1968
+, pages =       "180--187"
 }
 
 @article{gg-frpmp-97
-, author =	"M. Ghouse and M. Goodrich"
-, title =	"Fast randomized parallel methods for planar convex hull construction"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"219--236"
-, update =	"97.07 devillers"
+, author =      "M. Ghouse and M. Goodrich"
+, title =       "Fast randomized parallel methods for planar convex hull construction"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "219--236"
+, update =      "97.07 devillers"
 }
 
 @inproceedings{gg-eeprs-93
-, author =	"Mujtaba Ghouse and Michael T. Goodrich"
-, title =	"Experimental Evidence for the Power of Random Sampling in Practical Parallel Algorithms"
-, booktitle =	"??"
-, publisher =	"IEEE Computer Society"
-, year =	1993
-, pages =	"549--556"
-, update =	"94.01 jones, 93.09 milone+mitchell"
+, author =      "Mujtaba Ghouse and Michael T. Goodrich"
+, title =       "Experimental Evidence for the Power of Random Sampling in Practical Parallel Algorithms"
+, booktitle =   "??"
+, publisher =   "IEEE Computer Society"
+, year =        1993
+, pages =       "549--556"
+, update =      "94.01 jones, 93.09 milone+mitchell"
 }
 
 @inproceedings{gg-ptpch-91
-, author =	"M. Ghouse and M. T. Goodrich"
-, title =	"In-place techniques for parallel convex hull algorithms"
-, booktitle =	"Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
-, year =	1991
-, pages =	"192--203"
+, author =      "M. Ghouse and M. T. Goodrich"
+, title =       "In-place techniques for parallel convex hull algorithms"
+, booktitle =   "Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
+, year =        1991
+, pages =       "192--203"
 }
 
 @inproceedings{gi-d23cpg-92
-, author =	"D. Giammarresi and G. F. Italiano"
-, title =	"Dynamic 2- and 3-Connectivity on Planar Graphs"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"221--232"
-, update =	"95.05 tamassia"
+, author =      "D. Giammarresi and G. F. Italiano"
+, title =       "Dynamic 2- and 3-Connectivity on Planar Graphs"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "221--232"
+, update =      "95.05 tamassia"
 }
 
 @book{g-agt-85
-, author =	"A. Gibbons"
-, title =	"Algorithmic Graph Theory"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge"
-, year =	1985
-, keywords =	"graph theory, graph algorithms"
-, update =	"00.03 bibrelex, 98.07 tamassia, 97.06 tollis"
+, author =      "A. Gibbons"
+, title =       "Algorithmic Graph Theory"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge"
+, year =        1985
+, keywords =    "graph theory, graph algorithms"
+, update =      "00.03 bibrelex, 98.07 tamassia, 97.06 tollis"
 }
 
 @book{gr-epa-88
-, author =	"A. Gibbons and W. Rytter"
-, title =	"Efficient Parallel Algorithms"
-, publisher =	"Cambridge University Press"
-, address =	"New York"
-, year =	1988
-, update =	"96.09 orourke"
+, author =      "A. Gibbons and W. Rytter"
+, title =       "Efficient Parallel Algorithms"
+, publisher =   "Cambridge University Press"
+, address =     "New York"
+, year =        1988
+, update =      "96.09 orourke"
 }
 
 @inproceedings{g-mppm-89
-, author =	"P. B. Gibbons"
-, title =	"A more practical {PRAM} model"
-, booktitle =	"Proc. 1st ACM Sympos. Parallel Algorithms Architect."
-, year =	1989
-, pages =	"158--168"
-, update =	"96.09 orourke"
+, author =      "P. B. Gibbons"
+, title =       "A more practical {PRAM} model"
+, booktitle =   "Proc. 1st ACM Sympos. Parallel Algorithms Architect."
+, year =        1989
+, pages =       "158--168"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{gmr-qpacp-94
-, author =	"P. B. Gibbons and Y. Matias and V. Ramachandran"
-, title =	"The {QRQW} {PRAM}: Accounting for contention in parallel algorithms"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	""
-, update =	"96.09 orourke"
+, author =      "P. B. Gibbons and Y. Matias and V. Ramachandran"
+, title =       "The {QRQW} {PRAM}: Accounting for contention in parallel algorithms"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       ""
+, update =      "96.09 orourke"
 }
 
 @book{g-gsh-77
-, author =	"P. J. Giblin"
-, title =	"Graphs, Surfaces and Homology"
-, edition =	"1st"
-, publisher =	"Chapman and Hall"
-, address =	"London"
-, year =	1977
-, update =	"98.03 bibrelex, 94.05 devillers"
+, author =      "P. J. Giblin"
+, title =       "Graphs, Surfaces and Homology"
+, edition =     "1st"
+, publisher =   "Chapman and Hall"
+, address =     "London"
+, year =        1977
+, update =      "98.03 bibrelex, 94.05 devillers"
 }
 
 @book{g-gsh-81
-, author =	"P. J. Giblin"
-, title =	"Graphs, Surfaces and Homology"
-, edition =	"2nd"
-, publisher =	"Chapman and Hall"
-, address =	"London, UK"
-, year =	1981
-, update =	"98.03 bibrelex"
+, author =      "P. J. Giblin"
+, title =       "Graphs, Surfaces and Homology"
+, edition =     "2nd"
+, publisher =   "Chapman and Hall"
+, address =     "London, UK"
+, year =        1981
+, update =      "98.03 bibrelex"
 }
 
 @article{gvw-rwgsi-96
-, author =	"G. A. Gibson and J. S. Vitter and J. Wilkes"
-, title =	"Report of the Working Group on Storage {I/O} Issues in Large-Scale Computing"
-, journal =	"ACM Comput. Surv."
-, volume =	28
-, number =	4
-, month =	dec
-, year =	1996
-, note =	"Also available as
-		  \url{http://www.cs.duke.edu/~jsv/report.ps}"
-, update =	"97.03 murali"
+, author =      "G. A. Gibson and J. S. Vitter and J. Wilkes"
+, title =       "Report of the Working Group on Storage {I/O} Issues in Large-Scale Computing"
+, journal =     "ACM Comput. Surv."
+, volume =      28
+, number =      4
+, month =       dec
+, year =        1996
+, note =        "Also available as
+                  \url{http://www.cs.duke.edu/~jsv/report.ps}"
+, update =      "97.03 murali"
 }
 
 @article{ghjst-chtm-98
-, author =	"T. S. Gieng and B. Hamann and K. I. Joy and G. L. Schussman and I. J. Trotts"
-, title =	"Constructing Hierarchies for Triangle Meshes"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	4
-, number =	2
-, month =	apr
-, year =	1998
-, pages =	"145--161"
-, update =	"98.11 held"
+, author =      "T. S. Gieng and B. Hamann and K. I. Joy and G. L. Schussman and I. J. Trotts"
+, title =       "Constructing Hierarchies for Triangle Meshes"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      4
+, number =      2
+, month =       apr
+, year =        1998
+, pages =       "145--161"
+, update =      "98.11 held"
 }
 
 @article{g-beess-62
-, author =	"O. Giering"
-, title =	"Bestimmung von Eibereichen und Eik{\"o}rpern durch {Steiner} Symmetrisierungen"
-, journal =	"Sber. Bayer. Akad. Wiss. M{\"u}nchen, Math.-Nat. Kl."
-, volume =	"??"
-, year =	1962
-, pages =	"225--253"
-, update =	"98.11 bibrelex"
+, author =      "O. Giering"
+, title =       "Bestimmung von Eibereichen und Eik{\"o}rpern durch {Steiner} Symmetrisierungen"
+, journal =     "Sber. Bayer. Akad. Wiss. M{\"u}nchen, Math.-Nat. Kl."
+, volume =      "??"
+, year =        1962
+, pages =       "225--253"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{g-crtspmtl-99
-, author =	"J. Giesen"
-, title =	"Curve reconstruction, the {TSP}, and {Menger}'s theorem on length"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"207--216"
-, update =	"00.03 orourke"
+, author =      "J. Giesen"
+, title =       "Curve reconstruction, the {TSP}, and {Menger}'s theorem on length"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "207--216"
+, update =      "00.03 orourke"
 }
 
 @techreport{g-plpg-93
-, author =	"G.-J. Giezeman"
-, title =	"{PlaGeo} - A Library for Planar Geometry"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, month =	aug
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "G.-J. Giezeman"
+, title =       "{PlaGeo} - A Library for Planar Geometry"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, month =       aug
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @article{gcs-ecrag-91
-, author =	"Z. Gigus and J. Canny and R. Seidel"
-, title =	"Efficiently computing and representing aspect graphs of polyhedral objects"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	13
-, number =	6
-, month =	jun
-, year =	1991
-, pages =	"542--551"
-, keywords =	"visibility, aspect graphs"
-, update =	"98.11 bibrelex, 96.09 devillers, 94.09 orourke"
+, author =      "Z. Gigus and J. Canny and R. Seidel"
+, title =       "Efficiently computing and representing aspect graphs of polyhedral objects"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      13
+, number =      6
+, month =       jun
+, year =        1991
+, pages =       "542--551"
+, keywords =    "visibility, aspect graphs"
+, update =      "98.11 bibrelex, 96.09 devillers, 94.09 orourke"
 }
 
 @article{gm-cagld-90
-, author =	"Z. Gigus and J. Malik"
-, title =	"Computing the Aspect Graph for Line Drawings of Polyhedral Objects"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	12
-, number =	2
-, year =	1990
-, pages =	"113--122"
-, update =	"98.03 smid, 97.11 bibrelex"
+, author =      "Z. Gigus and J. Malik"
+, title =       "Computing the Aspect Graph for Line Drawings of Polyhedral Objects"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      12
+, number =      2
+, year =        1990
+, pages =       "113--122"
+, update =      "98.03 smid, 97.11 bibrelex"
 }
 
 @inproceedings{gmv-ttnct-92
-, author =	"J. Gil and Y. Matias and U. Vishkin"
-, title =	"Towards a theory of nearly constant time parallel algorithms"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "J. Gil and Y. Matias and U. Vishkin"
+, title =       "Towards a theory of nearly constant time parallel algorithms"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{gsw-sgm-89
-, author =	"J. Gil and W. Steiger and A. Wigderson"
-, title =	"Some geometric medians"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	5
+, author =      "J. Gil and W. Steiger and A. Wigderson"
+, title =       "Some geometric medians"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       5
 }
 
 @article{gw-c2dmm-93
-, author =	"Y. Gil and M. Werman"
-, title =	"Computing 2D Min, Max and Median Filters"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	15
-, year =	1993
-, pages =	"504--507"
-, update =	"96.01 werman"
+, author =      "Y. Gil and M. Werman"
+, title =       "Computing 2D Min, Max and Median Filters"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      15
+, year =        1993
+, pages =       "504--507"
+, update =      "96.01 werman"
 }
 
 @article{gm-vlbe-59
-, author =	"E. Gilbert and E. Moore"
-, title =	"Variable-length binary encoding"
-, journal =	"Bell Syst. Tech. J."
-, volume =	38
-, year =	1959
-, pages =	"933--968"
-, update =	"98.03 bibrelex"
+, author =      "E. Gilbert and E. Moore"
+, title =       "Variable-length binary encoding"
+, journal =     "Bell Syst. Tech. J."
+, volume =      38
+, year =        1959
+, pages =       "933--968"
+, update =      "98.03 bibrelex"
 }
 
 @article{gf-cdgco-90
-, author =	"E. G. Gilbert and C. P. Foo"
-, title =	"Computing the Distance between General Convex Objects in Three-Dimensional Space"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	6
-, number =	1
-, month =	feb
-, year =	1990
-, pages =	"53--61"
-, update =	"98.11 bibrelex"
+, author =      "E. G. Gilbert and C. P. Foo"
+, title =       "Computing the Distance between General Convex Objects in Three-Dimensional Space"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      6
+, number =      1
+, month =       feb
+, year =        1990
+, pages =       "53--61"
+, update =      "98.11 bibrelex"
 }
 
 @article{gj-dfarp-85
-, author =	"E. G. Gilbert and D. W. Johnson"
-, title =	"Distance functions and their application to robot path planning in the presence of obstacles"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	"RA-1"
-, year =	1985
-, pages =	"21--30"
-, update =	"98.07 bibrelex"
+, author =      "E. G. Gilbert and D. W. Johnson"
+, title =       "Distance functions and their application to robot path planning in the presence of obstacles"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      "RA-1"
+, year =        1985
+, pages =       "21--30"
+, update =      "98.07 bibrelex"
 }
 
 @article{gjk-fpcdb-88
-, author =	"E. G. Gilbert and D. W. Johnson and S. S. Keerthi"
-, title =	"A fast procedure for computing the distance between complex objects"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	4
-, number =	2
-, year =	1988
-, pages =	"193--203"
-, update =	"98.07 bibrelex"
+, author =      "E. G. Gilbert and D. W. Johnson and S. S. Keerthi"
+, title =       "A fast procedure for computing the distance between complex objects"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      4
+, number =      2
+, year =        1988
+, pages =       "193--203"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{gjk-fpcdb-??
-, author =	"E. G. Gilbert and D. W. Johnson and S. S. Keerthi"
-, title =	"A fast procedure for computing the distance between complex objects in three space"
-, type =	"Report"
-, number =	"??"
-, institution =	"Univ. Michigan"
-, address =	"Ann Arbor, MI"
-, year =	"??"
+, author =      "E. G. Gilbert and D. W. Johnson and S. S. Keerthi"
+, title =       "A fast procedure for computing the distance between complex objects in three space"
+, type =        "Report"
+, number =      "??"
+, institution = "Univ. Michigan"
+, address =     "Ann Arbor, MI"
+, year =        "??"
 }
 
 @article{g-gcpnc-58
-, author =	"E. N. Gilbert"
-, title =	"Gray Codes and Paths on the $n$-cube"
-, journal =	"Bell Syst. Tech. J."
-, volume =	"??"
-, year =	1958
-, pages =	"815--826"
-, update =	"97.11 bibrelex"
+, author =      "E. N. Gilbert"
+, title =       "Gray Codes and Paths on the $n$-cube"
+, journal =     "Bell Syst. Tech. J."
+, volume =      "??"
+, year =        1958
+, pages =       "815--826"
+, update =      "97.11 bibrelex"
 }
 
 @article{g-rssc-62
-, author =	"E. N. Gilbert"
-, title =	"Random subdivisions of space into crystals"
-, journal =	"Ann. Math. Statist."
-, volume =	33
-, year =	1962
-, pages =	"958--972"
+, author =      "E. N. Gilbert"
+, title =       "Random subdivisions of space into crystals"
+, journal =     "Ann. Math. Statist."
+, volume =      33
+, year =        1962
+, pages =       "958--972"
 }
 
 @article{g-pc2sn-65
-, author =	"E. N. Gilbert"
-, title =	"The probability of covering $2$ sphere with {$N$} circular caps"
-, journal =	"Biometrika"
-, volume =	52
-, year =	1965
-, pages =	"323--330"
+, author =      "E. N. Gilbert"
+, title =       "The probability of covering $2$ sphere with {$N$} circular caps"
+, journal =     "Biometrika"
+, volume =      52
+, year =        1965
+, pages =       "323--330"
 }
 
 @article{gp-smt-68
-, author =	"E. N. Gilbert and H. O. Pollak"
-, title =	"Steiner minimal trees"
-, journal =	"SIAM J. Appl. Math."
-, volume =	16
-, number =	1
-, year =	1968
-, pages =	"1--29"
+, author =      "E. N. Gilbert and H. O. Pollak"
+, title =       "Steiner minimal trees"
+, journal =     "SIAM J. Appl. Math."
+, volume =      16
+, number =      1
+, year =        1968
+, pages =       "1--29"
 }
 
 @techreport{gs-tde-74
-, author =	"E. N. Gilbert and L. A. Shepp"
-, title =	"Textures for discrimination experiments"
-, number =	"TM-74-1218-6, TM-74-1215-15"
-, institution =	"Bell Laboratories"
-, address =	"Murray Hill, NJ"
-, month =	apr
-, year =	1974
-, update =	"97.11 bibrelex"
+, author =      "E. N. Gilbert and L. A. Shepp"
+, title =       "Textures for discrimination experiments"
+, number =      "TM-74-1218-6, TM-74-1215-15"
+, institution = "Bell Laboratories"
+, address =     "Murray Hill, NJ"
+, month =       apr
+, year =        1974
+, update =      "97.11 bibrelex"
 }
 
 @article{ght-stgbg-84
-, author =	"J. R. Gilbert and J. P. Hutchinson and R. E. Tarjan"
-, title =	"A separation theorem for graphs of bounded genus"
-, journal =	"J. Algorithms"
-, volume =	5
-, year =	1984
-, pages =	"391--407"
-, update =	"01.07 devillers, 98.03 bibrelex"
+, author =      "J. R. Gilbert and J. P. Hutchinson and R. E. Tarjan"
+, title =       "A separation theorem for graphs of bounded genus"
+, journal =     "J. Algorithms"
+, volume =      5
+, year =        1984
+, pages =       "391--407"
+, update =      "01.07 devillers, 98.03 bibrelex"
 }
 
 @techreport{gmt-gampi-92
-, author =	"J. R. Gilbert and G. L. Miller and S.-H. Teng"
-, title =	"A Geometric Approach to Mesh Partitioning: {Implementation} and Experiments"
-, type =	"Technical {Report}"
-, institution =	"Xerox Palo Alto Research Center"
-, address =	"Palo Alto, CA"
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "J. R. Gilbert and G. L. Miller and S.-H. Teng"
+, title =       "A Geometric Approach to Mesh Partitioning: {Implementation} and Experiments"
+, type =        "Technical {Report}"
+, institution = "Xerox Palo Alto Research Center"
+, address =     "Palo Alto, CA"
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @article{gt-anda-87
-, author =	"J. R. Gilbert and R. E. Tarjan"
-, title =	"The analysis of a nested dissection algorithm"
-, journal =	"Numer. Math."
-, volume =	50
-, year =	1987
-, pages =	"377--404"
-, update =	"97.11 bibrelex"
+, author =      "J. R. Gilbert and R. E. Tarjan"
+, title =       "The analysis of a nested dissection algorithm"
+, journal =     "Numer. Math."
+, volume =      50
+, year =        1987
+, pages =       "377--404"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{g-nrpt-79
-, author =	"P. D. Gilbert"
-, title =	"New results in planar triangulations"
-, type =	"Report"
-, number =	"R-850"
-, institution =	"Coordinated Sci. Lab., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1979
+, author =      "P. D. Gilbert"
+, title =       "New results in planar triangulations"
+, type =        "Report"
+, number =      "R-850"
+, institution = "Coordinated Sci. Lab., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1979
 }
 
 @book{gmw-po-81
-, author =	"P. E. Gill and W. Murray and M. H. Wright"
-, title =	"Practical Optimization"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "P. E. Gill and W. Murray and M. H. Wright"
+, title =       "Practical Optimization"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gd-tdsgi-81
-, author =	"R. Gillespie and W. A. Davis"
-, title =	"Tree data structures for graphics and image processing"
-, booktitle =	"Proc. Canad. Man-Computer Comm. Soc. Conf."
-, site =	"Waterloo, Canada"
-, year =	1981
-, pages =	"155--162"
-, update =	"97.11 bibrelex"
+, author =      "R. Gillespie and W. A. Davis"
+, title =       "Tree data structures for graphics and image processing"
+, booktitle =   "Proc. Canad. Man-Computer Comm. Soc. Conf."
+, site =        "Waterloo, Canada"
+, year =        1981
+, pages =       "155--162"
+, update =      "97.11 bibrelex"
 }
 
 @article{gg-sosvm-64
-, author =	"P. C. Gilmore and R. E. Gomory"
-, title =	"Sequencing a one-state variable machine: {A} solvable case of the traveling salesman problem"
-, journal =	"Oper. Res."
-, volume =	12
-, year =	1964
-, pages =	"655--679"
-, update =	"98.07 bibrelex"
+, author =      "P. C. Gilmore and R. E. Gomory"
+, title =       "Sequencing a one-state variable machine: {A} solvable case of the traveling salesman problem"
+, journal =     "Oper. Res."
+, volume =      12
+, year =        1964
+, pages =       "655--679"
+, update =      "98.07 bibrelex"
 }
 
 @book{g-icgds-78
-, author =	"W. K. Giloi"
-, title =	"Interactive Computer Graphics: Data Structures, Algorithms, Languages"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1978
+, author =      "W. K. Giloi"
+, title =       "Interactive Computer Graphics: Data Structures, Algorithms, Languages"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1978
 }
 
 @inproceedings{gn-tpot-90
-, author =	"D. Girault-Beauquier and M. Nivat"
-, title =	"Tiling the plane with one tile"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"128--138"
-, precedes =	"bn-toptp-91"
-, cites =	"bg-gd-72, b-udp-66, gs-tp-87, g-p-66, h-etiah-86, p-p-78, r-untp-71, s-tleup-78, w-glc-65, wl-avpss-84, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. Girault-Beauquier and M. Nivat"
+, title =       "Tiling the plane with one tile"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "128--138"
+, precedes =    "bn-toptp-91"
+, cites =       "bg-gd-72, b-udp-66, gs-tp-87, g-p-66, h-etiah-86, p-p-78, r-untp-71, s-tleup-78, w-glc-65, wl-avpss-84, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{gos-rpps-93
-, author =	"C. Gitlin and J. O'Rourke and V. Subramanian"
-, title =	"On reconstructing polyhedra from parallel slices"
-, type =	"Technical {Report}"
-, number =	025
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA"
-, month =	mar
-, year =	1993
-, keywords =	"triangulations, polyhedra, surface reconstruction"
-, update =	"94.01 orourke"
+, author =      "C. Gitlin and J. O'Rourke and V. Subramanian"
+, title =       "On reconstructing polyhedra from parallel slices"
+, type =        "Technical {Report}"
+, number =      025
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA"
+, month =       mar
+, year =        1993
+, keywords =    "triangulations, polyhedra, surface reconstruction"
+, update =      "94.01 orourke"
 }
 
 @article{gos-rpps-96
-, author =	"C. Gitlin and J. O'Rourke and V. Subramanian"
-, title =	"On reconstructing polyhedra from parallel slices"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, number =	1
-, year =	1996
-, pages =	"103--122"
-, keywords =	"triangulations, polyhedra, surface reconstruction"
-, update =	"96.09 orourke, 96.05 orourke, 96.01 orourke, 95.05 orourke, 94.09 orourke, 94.01 orourke"
-, annote =	"Gives an example of two polygons in parallel planes
-		that cannot be connected to form a simple polyhedron
-		on the same set of vertices.  One polygon is a triangle,
-		the other a complicated spiraling shape of 63 vertices."
+, author =      "C. Gitlin and J. O'Rourke and V. Subramanian"
+, title =       "On reconstructing polyhedra from parallel slices"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, number =      1
+, year =        1996
+, pages =       "103--122"
+, keywords =    "triangulations, polyhedra, surface reconstruction"
+, update =      "96.09 orourke, 96.05 orourke, 96.01 orourke, 95.05 orourke, 94.09 orourke, 94.01 orourke"
+, annote =      "Gives an example of two polygons in parallel planes
+                that cannot be connected to form a simple polyhedron
+                on the same set of vertices.  One polygon is a triangle,
+                the other a complicated spiraling shape of 63 vertices."
 }
 
 @inproceedings{gj-mv3du-96
-, author =	"Carole S. Gitlin and Christopher R. Johnson"
-, title =	"MeshView: visualizing 3D unstructured meshes"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"333--345"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Carole S. Gitlin and Christopher R. Johnson"
+, title =       "MeshView: visualizing 3D unstructured meshes"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "333--345"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @book{g-fa3dg-94
-, author =	"G. Glaeser"
-, title =	"Fast Algorithms for {3D}-Graphics"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1994
-, isbn =	"0-387-94288-2"
-, update =	"96.09 agarwal, 95.09 mitchell"
+, author =      "G. Glaeser"
+, title =       "Fast Algorithms for {3D}-Graphics"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1994
+, isbn =        "0-387-94288-2"
+, update =      "96.09 agarwal, 95.09 mitchell"
 }
 
 @inproceedings{gn-aep47-95
-, author =	"Steve Glassman and Greg Nelson"
-, title =	"An Animation of {Euclid's} Proposition 47: {The} {Pythagorean} Theorem"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"V3--V4"
-, keywords =	"video review"
-, cites =	"b-1saf-93, e-e-56, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Steve Glassman and Greg Nelson"
+, title =       "An Animation of {Euclid's} Proposition 47: {The} {Pythagorean} Theorem"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "V3--V4"
+, keywords =    "video review"
+, cites =       "b-1saf-93, e-e-56, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @incollection{g-bvnup-94
-, author =	"Andrew Glassner"
-, title =	"Building Vertex Normals from an Unstructured Polygon List"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"60--73"
-, keywords =	"smooth shading, topology, polyhedron"
-, update =	"94.09 heckbert"
-, annote =	"Solves a fairly common rendering problem: if one is given
+, author =      "Andrew Glassner"
+, title =       "Building Vertex Normals from an Unstructured Polygon List"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "60--73"
+, keywords =    "smooth shading, topology, polyhedron"
+, update =      "94.09 heckbert"
+, annote =      "Solves a fairly common rendering problem: if one is given
 a set of polygons in raw form, with no topological (adjacency) information,
 and asked to do smooth shading (Gouraud or Phong shading) of them, one must
 infer topology and compute vertex normals. Contains C code."
 }
 
 @incollection{gh-chfvl-94
-, author =	"Andrew Glassner and Eric Haines"
-, title =	"{C} Header File and Vector Library"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"558--570"
-, keywords =	"vector algebra, root-finding"
-, update =	"94.09 heckbert"
-, annote =	"Revised version of the ``Graphics Gems'' subroutine
+, author =      "Andrew Glassner and Eric Haines"
+, title =       "{C} Header File and Vector Library"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "558--570"
+, keywords =    "vector algebra, root-finding"
+, update =      "94.09 heckbert"
+, annote =      "Revised version of the ``Graphics Gems'' subroutine
 library, used in several other Gems in the book. Contains C code."
 }
 
 @book{g-irt-89
-, author =	"A. S. Glassner"
-, title =	"An Introduction to Ray Tracing"
-, publisher =	"Academic Press"
-, year =	1989
-, update =	"98.03 bibrelex, 96.05 pocchiola"
+, author =      "A. S. Glassner"
+, title =       "An Introduction to Ray Tracing"
+, publisher =   "Academic Press"
+, year =        1989
+, update =      "98.03 bibrelex, 96.05 pocchiola"
 }
 
 @book{g-gg-90
-, title =	"Graphics Gems {I}"
-, editor =	"Andrew S. Glassner"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1990
-, update =	"98.11 bibrelex, 98.07 tamassia+vismara"
+, title =       "Graphics Gems {I}"
+, editor =      "Andrew S. Glassner"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1990
+, update =      "98.11 bibrelex, 98.07 tamassia+vismara"
 }
 
 @article{g-ssfrt-84
-, author =	"A. S. Glassner"
-, title =	"Space Subdivision for Fast Ray Tracing"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	4
-, number =	10
-, month =	oct
-, year =	1984
-, pages =	"15--22"
-, update =	"97.11 bibrelex"
+, author =      "A. S. Glassner"
+, title =       "Space Subdivision for Fast Ray Tracing"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      4
+, number =      10
+, month =       oct
+, year =        1984
+, pages =       "15--22"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{gchhhr-irt-87
-, author =	"Andrew S. Glassner and Robert L. Cook and Eric Haines and Pat Hanrahan and Paul Heckbert and L. Richard Speer"
-, title =	"Introduction to Ray Tracing"
-, booktitle =	"SIGGRAPH '87 Introduction to Ray Tracing"
-, year =	1987
-, update =	"98.03 agarwal"
+, author =      "Andrew S. Glassner and Robert L. Cook and Eric Haines and Pat Hanrahan and Paul Heckbert and L. Richard Speer"
+, title =       "Introduction to Ray Tracing"
+, booktitle =   "SIGGRAPH '87 Introduction to Ray Tracing"
+, year =        1987
+, update =      "98.03 agarwal"
 }
 
 @article{gmhhwsbr-cads5-95
-, author =	"R. Glen and G. Martin and A. Hill and R. Hyde and P. Wollard and J. Salmon and J. Buckingham and A. Robertson"
-, title =	"Computer-aided design and sythesis of $5$-substituted tryptamines and their pharmacology at the $5-{HT}_{10}$ receptor: {Discovery} of compounds with potential anti-migraine properties"
-, journal =	"J. Medical Chemistry"
-, volume =	38
-, year =	1995
-, pages =	"3566--3580"
-, update =	"98.07 bibrelex"
+, author =      "R. Glen and G. Martin and A. Hill and R. Hyde and P. Wollard and J. Salmon and J. Buckingham and A. Robertson"
+, title =       "Computer-aided design and sythesis of $5$-substituted tryptamines and their pharmacology at the $5-{HT}_{10}$ receptor: {Discovery} of compounds with potential anti-migraine properties"
+, journal =     "J. Medical Chemistry"
+, volume =      38
+, year =        1995
+, pages =       "3566--3580"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{ggglsttz-ftttd-96
-, author =	"J. Glimm and M. J. Graham and J. Grove and X. L. Li and T. M. Smith and D. Tan and F. Tangerman and Q. Zhang"
-, title =	"Front Tracking in Two and Three Dimensions"
-, type =	"Technical {Report}"
-, number =	"SUNYSB-AMS-96-12"
-, institution =	"Applied Mathematics and Statistics, University at Stony Brook"
-, year =	1996
-, update =	"98.03 mitchell"
+, author =      "J. Glimm and M. J. Graham and J. Grove and X. L. Li and T. M. Smith and D. Tan and F. Tangerman and Q. Zhang"
+, title =       "Front Tracking in Two and Three Dimensions"
+, type =        "Technical {Report}"
+, number =      "SUNYSB-AMS-96-12"
+, institution = "Applied Mathematics and Statistics, University at Stony Brook"
+, year =        1996
+, update =      "98.03 mitchell"
 }
 
 @article{g-mmbg-67
-, author =	"F. Glover"
-, title =	"Maximum Matching in bipartite Graph"
-, journal =	"Naval Res. Logist. Quart."
-, volume =	"??"
-, year =	1967
-, update =	"98.03 bibrelex"
+, author =      "F. Glover"
+, title =       "Maximum Matching in bipartite Graph"
+, journal =     "Naval Res. Logist. Quart."
+, volume =      "??"
+, year =        1967
+, update =      "98.03 bibrelex"
 }
 
 @article{gks-cdrcp-99
-, author =	"A. Glozman and K. Kedem and G. Shpitalnik"
-, title =	"Computing a double-ray center for a planar point set"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, year =	1999
-, pages =	"109--123"
-, update =	"99.07 smid"
+, author =      "A. Glozman and K. Kedem and G. Shpitalnik"
+, title =       "Computing a double-ray center for a planar point set"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, year =        1999
+, pages =       "109--123"
+, update =      "99.07 smid"
 }
 
 @inproceedings{gks-sgsop-95
-, author =	"Alex Glozman and Klara Kedem and Gregory Shpitalnik"
-, title =	"On some Geometric Selection and Optimization Problems via Sorted Matrices"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"26--37"
-, update =	"99.07 bibrelex, 96.01 devillers+smid, 95.05 mitchell"
+, author =      "Alex Glozman and Klara Kedem and Gregory Shpitalnik"
+, title =       "On some Geometric Selection and Optimization Problems via Sorted Matrices"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "26--37"
+, update =      "99.07 bibrelex, 96.01 devillers+smid, 95.05 mitchell"
 }
 
 @article{gks-sgsop-98
-, author =	"Alex Glozman and Klara Kedem and Gregory Shpitalnik"
-, title =	"On some geometric selection and optimization problems via sorted matrices"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	11
-, year =	1998
-, pages =	"17--28"
-, succeeds =	"gks-sgsop-95"
-, update =	"98.11 devillers"
+, author =      "Alex Glozman and Klara Kedem and Gregory Shpitalnik"
+, title =       "On some geometric selection and optimization problems via sorted matrices"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      11
+, year =        1998
+, pages =       "17--28"
+, succeeds =    "gks-sgsop-95"
+, update =      "98.11 devillers"
 }
 
 @article{ggsbcg-ocrot-89
-, author =	"A. F. Gmitro and J. E. Greivenkamp and W. Swindell and H. H. Barett and M. Y. Chiu and S. K. Gordon"
-, title =	"Optical computers for reconstructing objects from their x-ray projections"
-, journal =	"Optical. Engineering"
-, volume =	19
-, number =	3
-, year =	1989
-, pages =	"260--272"
-, update =	"97.11 bibrelex"
+, author =      "A. F. Gmitro and J. E. Greivenkamp and W. Swindell and H. H. Barett and M. Y. Chiu and S. K. Gordon"
+, title =       "Optical computers for reconstructing objects from their x-ray projections"
+, journal =     "Optical. Engineering"
+, volume =      19
+, number =      3
+, year =        1989
+, pages =       "260--272"
+, update =      "97.11 bibrelex"
 }
 
 @article{gs-rclcd-70
-, author =	"N. Go and H. Scherga"
-, title =	"Ring closure and local conformational deformations of chain molecules"
-, journal =	"Macromolecules"
-, volume =	3
-, number =	2
-, year =	1970
-, pages =	"178--187"
-, update =	"98.07 bibrelex"
+, author =      "N. Go and H. Scherga"
+, title =       "Ring closure and local conformational deformations of chain molecules"
+, journal =     "Macromolecules"
+, volume =      3
+, number =      2
+, year =        1970
+, pages =       "178--187"
+, update =      "98.07 bibrelex"
 }
 
 @article{g-spaph-82
-, author =	"C. Goad"
-, title =	"Special Purpose Automatic Programming for Hidden Surface Elimination"
-, journal =	"Comput. Graph."
-, volume =	16
-, number =	3
-, month =	jul
-, year =	1982
-, pages =	"167--178"
-, note =	"Proc. SIGGRAPH '82"
-, update =	"97.11 bibrelex"
+, author =      "C. Goad"
+, title =       "Special Purpose Automatic Programming for Hidden Surface Elimination"
+, journal =     "Comput. Graph."
+, volume =      16
+, number =      3
+, month =       jul
+, year =        1982
+, pages =       "167--178"
+, note =        "Proc. SIGGRAPH '82"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{g-nmccd-91
-, author =	"M. Godau"
-, title =	"A Natural Metric for Curves -- Computing the Distance for Polygonal Chains and Approximation Algorithms"
-, booktitle =	"Proc. 8th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	480
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"127--136"
-, update =	"97.03 gaertner+salinger"
+, author =      "M. Godau"
+, title =       "A Natural Metric for Curves -- Computing the Distance for Polygonal Chains and Approximation Algorithms"
+, booktitle =   "Proc. 8th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      480
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "127--136"
+, update =      "97.03 gaertner+salinger"
 }
 
 @mastersthesis{g-fmpaa-91
-, author =	"M. Godau"
-, title =	"Die {Fr{\'e}chet}-{Metrik} f{\"u}r {P}olygonz{\"u}ge -- {Algorithmen} zur {Abstandsmessung} und {Approximation}"
-, type =	"Masters Thesis"
-, school =	"Fachbereich Mathematik, Freie Univ. Berlin"
-, address =	"Berlin, Germany"
-, year =	1991
-, keywords =	"masters thesis"
-, update =	"97.03 gaertner+salinger"
+, author =      "M. Godau"
+, title =       "Die {Fr{\'e}chet}-{Metrik} f{\"u}r {P}olygonz{\"u}ge -- {Algorithmen} zur {Abstandsmessung} und {Approximation}"
+, type =        "Masters Thesis"
+, school =      "Fachbereich Mathematik, Freie Univ. Berlin"
+, address =     "Berlin, Germany"
+, year =        1991
+, keywords =    "masters thesis"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{g-depgi-95
-, author =	"M. Godau"
-, title =	"On the Difficulty of Embedding Planar Graphs with Inaccuracies"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"254--261"
-, keywords =	"graph drawing, placement, NP-hardness"
-, update =	"95.01 tamassia"
+, author =      "M. Godau"
+, title =       "On the Difficulty of Embedding Planar Graphs with Inaccuracies"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "254--261"
+, keywords =    "graph drawing, placement, NP-hardness"
+, update =      "95.01 tamassia"
 }
 
 @techreport{gkk-fdsp-
-, author =	"W. Goddard and M. Katchalski and D. J. Kleitman"
-, title =	"Forcing disjoint segments in the plane"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
-, update =	"98.03 bibrelex"
+, author =      "W. Goddard and M. Katchalski and D. J. Kleitman"
+, title =       "Forcing disjoint segments in the plane"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
+, update =      "98.03 bibrelex"
 }
 
 @article{g-qwcet-88
-, author =	"L. Goddyn"
-, title =	"Quantizers and the worst-case {Euclidean} traveling salesman problem"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	50
-, year =	1988
-, pages =	"65--81"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "L. Goddyn"
+, title =       "Quantizers and the worst-case {Euclidean} traveling salesman problem"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      50
+, year =        1988
+, pages =       "65--81"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @article{gw-agatc-95
-, author =	"Michel X. Goemans and David P. Williamson"
-, title =	"A General Approximation Technique for Constrained Forest Problems"
-, journal =	"SIAM J. Comput."
-, volume =	24
-, number =	2
-, year =	1995
-, pages =	"296--317"
-, update =	"98.03 agarwal"
+, author =      "Michel X. Goemans and David P. Williamson"
+, title =       "A General Approximation Technique for Constrained Forest Problems"
+, journal =     "SIAM J. Comput."
+, volume =      24
+, number =      2
+, year =        1995
+, pages =       "296--317"
+, update =      "98.03 agarwal"
 }
 
 @book{gt-smmp-60
-, author =	"G. Goertzel and N. Tralli"
-, title =	"Some Mathematical Methods of Physics"
-, publisher =	"McGraw-Hill"
-, year =	1960
-, update =	"98.03 bibrelex"
+, author =      "G. Goertzel and N. Tralli"
+, title =       "Some Mathematical Methods of Physics"
+, publisher =   "McGraw-Hill"
+, year =        1960
+, update =      "98.03 bibrelex"
 }
 
 @article{g-rmssl-80
-, author =	"J. L. Goffin"
-, title =	"The Relaxation Method for Solving Systems of Linear Inequalities"
-, journal =	"Math. Oper. Res."
-, volume =	5
-, number =	3
-, month =	aug
-, year =	1980
-, pages =	"388--414"
-, update =	"97.11 bibrelex"
+, author =      "J. L. Goffin"
+, title =       "The Relaxation Method for Solving Systems of Linear Inequalities"
+, journal =     "Math. Oper. Res."
+, volume =      5
+, number =      3
+, month =       aug
+, year =        1980
+, pages =       "388--414"
+, update =      "97.11 bibrelex"
 }
 
 @article{g-pboot-81
-, author =	"I. Golan"
-, title =	"Performance bounds for orthogonal oriented two-dimensional packing algorithms"
-, journal =	"SIAM J. Comput."
-, volume =	10
-, year =	1981
-, pages =	"571--582"
+, author =      "I. Golan"
+, title =       "Performance bounds for orthogonal oriented two-dimensional packing algorithms"
+, journal =     "SIAM J. Comput."
+, volume =      10
+, year =        1981
+, pages =       "571--582"
 }
 
 @inproceedings{g-cac-99
-, author =	"C. Gold"
-, title =	"Crust and anti-crust: {A} one-step boundary and skeleton extraction algorithm"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"189--196"
-, update =	"00.03 orourke"
+, author =      "C. Gold"
+, title =       "Crust and anti-crust: {A} one-step boundary and skeleton extraction algorithm"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "189--196"
+, update =      "00.03 orourke"
 }
 
 @inproceedings{gc-sontr-86
-, author =	"C. Gold and S. Cormack"
-, title =	"Spatially ordered networks and topographic reconstructions"
-, booktitle =	"Proc. 2nd Internat. Sympos. Spatial Data Handling"
-, year =	1986
-, pages =	"74--85"
-, update =	"97.11 bibrelex"
+, author =      "C. Gold and S. Cormack"
+, title =       "Spatially ordered networks and topographic reconstructions"
+, booktitle =   "Proc. 2nd Internat. Sympos. Spatial Data Handling"
+, year =        1986
+, pages =       "74--85"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{g-odsma-92
-, author =	"C. M. Gold"
-, title =	"An object-based dynamic spatial model, and its application in the development of a user-friendly digitizing system"
-, booktitle =	"Proc. 5th Internat. Sympos. Spatial Data Handling"
-, site =	"Charleston"
-, year =	1992
-, pages =	"495--504"
-, update =	"98.11 bibrelex"
+, author =      "C. M. Gold"
+, title =       "An object-based dynamic spatial model, and its application in the development of a user-friendly digitizing system"
+, booktitle =   "Proc. 5th Internat. Sympos. Spatial Data Handling"
+, site =        "Charleston"
+, year =        1992
+, pages =       "495--504"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{g-dsdsv-92
-, author =	"C. M. Gold"
-, title =	"Dynamic spatial data structures -- the {Voronoi} approach"
-, booktitle =	"Proc. Canad. Conf. GIS"
-, site =	"Ottawa"
-, year =	1992
-, pages =	"245--255"
-, update =	"93.05 freimer"
+, author =      "C. M. Gold"
+, title =       "Dynamic spatial data structures -- the {Voronoi} approach"
+, booktitle =   "Proc. Canad. Conf. GIS"
+, site =        "Ottawa"
+, year =        1992
+, pages =       "245--255"
+, update =      "93.05 freimer"
 }
 
 @inproceedings{g-fsdss-93
-, author =	"C. M. Gold"
-, title =	"Forestry spatial decision support system classification and the flight simulator approach"
-, booktitle =	"Proc. GIS'93"
-, site =	"Vancouver"
-, year =	1993
-, pages =	"797--802"
-, update =	"98.11 bibrelex"
+, author =      "C. M. Gold"
+, title =       "Forestry spatial decision support system classification and the flight simulator approach"
+, booktitle =   "Proc. GIS'93"
+, site =        "Vancouver"
+, year =        1993
+, pages =       "797--802"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{g-ovdtu-87
-, author =	"C. M. Gold"
-, title =	"Ordering of {Voronoi} diagrams and their use in terrain database management"
-, booktitle =	"Proc. 8th Internat. Sympos. Comput.-Assist. Cartog."
-, site =	"Baltimore"
-, year =	1987
-, pages =	"185--194"
-, update =	"93.05 freimer"
+, author =      "C. M. Gold"
+, title =       "Ordering of {Voronoi} diagrams and their use in terrain database management"
+, booktitle =   "Proc. 8th Internat. Sympos. Comput.-Assist. Cartog."
+, site =        "Baltimore"
+, year =        1987
+, pages =       "185--194"
+, update =      "93.05 freimer"
 }
 
 @inproceedings{g-psrsd-94
-, author =	"C. M. Gold"
-, title =	"Persistent Spatial Relations - a Systems Design Objective"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"219--224"
-, cites =	"a-vdsfg-91, bb-dvddt-90, cegss-cfals-91, f-savd-87, g-sdsed-90, g-srbb-90, g-odsma-92, g-fsdss-93, gcr-acmut-77, gks-ricdv-92, k-eccs-79, as-sdcav-94, obs-stcav-92, pc-cds-75, r-vdds-90, r-vdds-93, s-dmgsm-91, sh-cpp-75, t-tdrac-93, tcm-chgd-76, w-dpo-78, b-dgs-70, gc-sdsig-94, gmr-vdmpp-92, ZZZ"
-, update =	"99.11 bibrelex, 98.11 bibrelex, 94.09 jones"
+, author =      "C. M. Gold"
+, title =       "Persistent Spatial Relations - a Systems Design Objective"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "219--224"
+, cites =       "a-vdsfg-91, bb-dvddt-90, cegss-cfals-91, f-savd-87, g-sdsed-90, g-srbb-90, g-odsma-92, g-fsdss-93, gcr-acmut-77, gks-ricdv-92, k-eccs-79, as-sdcav-94, obs-stcav-92, pc-cds-75, r-vdds-90, r-vdds-93, s-dmgsm-91, sh-cpp-75, t-tdrac-93, tcm-chgd-76, w-dpo-78, b-dgs-70, gc-sdsig-94, gmr-vdmpp-92, ZZZ"
+, update =      "99.11 bibrelex, 98.11 bibrelex, 94.09 jones"
 }
 
 @article{g-phsdv-91
-, author =	"C. M. Gold"
-, title =	"Problems with handling spatial data -- {The Voronoi} approach"
-, journal =	"CISM Journal ACSGC"
-, volume =	45
-, number =	1
-, year =	1991
-, pages =	"65--80"
-, keywords =	"GIS, geography, surfaces, approximation"
-, update =	"95.01 mitchell"
+, author =      "C. M. Gold"
+, title =       "Problems with handling spatial data -- {The Voronoi} approach"
+, journal =     "CISM Journal ACSGC"
+, volume =      45
+, number =      1
+, year =        1991
+, pages =       "65--80"
+, keywords =    "GIS, geography, surfaces, approximation"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{g-srbb-90
-, author =	"C. M. Gold"
-, title =	"Space revisited: back to the basics"
-, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
-, site =	"Z{\"u}rich"
-, year =	1990
-, pages =	"175--189"
-, update =	"98.11 bibrelex"
+, author =      "C. M. Gold"
+, title =       "Space revisited: back to the basics"
+, booktitle =   "Proc. 4th Internat. Sympos. Spatial Data Handling"
+, site =        "Z{\"u}rich"
+, year =        1990
+, pages =       "175--189"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{g-sdsed-90
-, author =	"C. M. Gold"
-, title =	"Spatial data structures: the extension from one to two dimensions"
-, editor =	"L. F. Pau"
-, booktitle =	"Mapping and Spatial Modelling in Navigation"
-, series =	"NATO ASI Series F"
-, volume =	65
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	1990
-, pages =	"11--39"
-, update =	"98.11 bibrelex"
+, author =      "C. M. Gold"
+, title =       "Spatial data structures: the extension from one to two dimensions"
+, editor =      "L. F. Pau"
+, booktitle =   "Mapping and Spatial Modelling in Navigation"
+, series =      "NATO ASI Series F"
+, volume =      65
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        1990
+, pages =       "11--39"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{g-sovnt-85
-, author =	"C. M. Gold"
-, title =	"Spatial ordering of {Voronoi} networks and their use in terrain modeling"
-, type =	"Report"
-, number =	"??"
-, institution =	"Contoursoft Corp."
-, address =	"Edmonton, AB"
-, year =	1985
+, author =      "C. M. Gold"
+, title =       "Spatial ordering of {Voronoi} networks and their use in terrain modeling"
+, type =        "Report"
+, number =      "??"
+, institution = "Contoursoft Corp."
+, address =     "Edmonton, AB"
+, year =        1985
 }
 
 @inproceedings{g-sivsa-92
-, author =	"C. M. Gold"
-, title =	"Surface interpolation as a {Voronoi} spatial adjacency problem"
-, booktitle =	"Proc. Canad. Conf. GIS"
-, site =	"Ottawa"
-, year =	1992
-, pages =	"419--431"
-, update =	"93.05 freimer"
+, author =      "C. M. Gold"
+, title =       "Surface interpolation as a {Voronoi} spatial adjacency problem"
+, booktitle =   "Proc. Canad. Conf. GIS"
+, site =        "Ottawa"
+, year =        1992
+, pages =       "419--431"
+, update =      "93.05 freimer"
 }
 
 @article{g-vsmtt-92
-, author =	"C. M. Gold"
-, title =	"The {Voronoi} spatial model -- two and three dimensional applications in image analysis"
-, journal =	"ITC J."
-, volume =	"??"
-, year =	1992
-, note =	"To appear"
-, update =	"93.05 freimer"
+, author =      "C. M. Gold"
+, title =       "The {Voronoi} spatial model -- two and three dimensional applications in image analysis"
+, journal =     "ITC J."
+, volume =      "??"
+, year =        1992
+, note =        "To appear"
+, update =      "93.05 freimer"
 }
 
 @article{gcr-acmut-77
-, author =	"C. M. Gold and T. D. Charters and J. Ramsden"
-, title =	"Automated Contour Mapping Using Triangular Element Data Structures and an Interpolant Over Each Irregular Triangular Domain"
-, journal =	"Comput. Graph."
-, volume =	11
-, number =	2
-, year =	1977
-, pages =	"170--175"
-, update =	"96.09 devillers"
-, annote =	"Fits surface to irregular points by triangulating and
-		 then using a polynomial over each triangle. An initial
-		 triangulation is found by subdividing the triangle
-		 enclosing each new point into four. The triangulation
-		 is then improved by switchings (empirical tests suggest
-		 time $3\log t$ for switchings). Switchings based on
-		 ``Maximize minimum triangle height''."
+, author =      "C. M. Gold and T. D. Charters and J. Ramsden"
+, title =       "Automated Contour Mapping Using Triangular Element Data Structures and an Interpolant Over Each Irregular Triangular Domain"
+, journal =     "Comput. Graph."
+, volume =      11
+, number =      2
+, year =        1977
+, pages =       "170--175"
+, update =      "96.09 devillers"
+, annote =      "Fits surface to irregular points by triangulating and
+                 then using a polynomial over each triangle. An initial
+                 triangulation is found by subdividing the triangle
+                 enclosing each new point into four. The triangulation
+                 is then improved by switchings (empirical tests suggest
+                 time $3\log t$ for switchings). Switchings based on
+                 ``Maximize minimum triangle height''."
 }
 
 @article{gc-sdsig-94
-, author =	"C. M. Gold and A. R. Condal"
-, title =	"A spatial data structure integrating GIS and simulation in a marine environment"
-, journal =	"Marine Geodesy"
-, volume =	"??"
-, year =	1994
-, note =	"submitted"
-, update =	"98.11 bibrelex"
+, author =      "C. M. Gold and A. R. Condal"
+, title =       "A spatial data structure integrating GIS and simulation in a marine environment"
+, journal =     "Marine Geodesy"
+, volume =      "??"
+, year =        1994
+, note =        "submitted"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{gm-tsocc-78
-, author =	"C. M. Gold and U. Maydell"
-, title =	"Triangulation and spatial ordering in computer cartography"
-, booktitle =	"Proc. Canad. Cardographic Association Annu. Meeting"
-, year =	1978
-, pages =	"69--81"
-, update =	"97.11 bibrelex"
+, author =      "C. M. Gold and U. Maydell"
+, title =       "Triangulation and spatial ordering in computer cartography"
+, booktitle =   "Proc. Canad. Cardographic Association Annu. Meeting"
+, year =        1978
+, pages =       "69--81"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{grr-vdlsm-95
-, author =	"Christopher M. Gold and Peter M. Remmele and Thomas Roos"
-, title =	"Voronoi Diagrams of Line Segments Made Easy"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"223--228"
-, update =	"95.09 jones"
+, author =      "Christopher M. Gold and Peter M. Remmele and Thomas Roos"
+, title =       "Voronoi Diagrams of Line Segments Made Easy"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "223--228"
+, update =      "95.09 jones"
 }
 
 @proceedings{gr-p7ccc-95
-, title =	"Proc. 7th Canad. Conf. Comput. Geom."
-, editor =	"Christopher M. Gold and Jean-Marc Robert"
-, publisher =	"Geomatics Research Centre, Univ. Laval"
-, address =	"Qu\'ebec, QC"
-, month =	aug
-, year =	1995
-, url =	"http://www.uqac.uquebec.ca/DIM/prof/jmrobert/Proceedings_e.html"
-, update =	"95.09 jones"
+, title =       "Proc. 7th Canad. Conf. Comput. Geom."
+, editor =      "Christopher M. Gold and Jean-Marc Robert"
+, publisher =   "Geomatics Research Centre, Univ. Laval"
+, address =     "Qu\'ebec, QC"
+, month =       aug
+, year =        1995
+, url = "http://www.uqac.uquebec.ca/DIM/prof/jmrobert/Proceedings_e.html"
+, update =      "95.09 jones"
 }
 
 @article{gykd-cdma3-91
-, author =	"J. A. Goldak and X. Yu and A. Knight and L. Dong"
-, title =	"Constructing discrete medial axis of {3-D} objects"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	3
-, year =	1991
-, pages =	"327--339"
-, keywords =	"Delaunay triangulation, medial axis"
+, author =      "J. A. Goldak and X. Yu and A. Knight and L. Dong"
+, title =       "Constructing discrete medial axis of {3-D} objects"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      3
+, year =        1991
+, pages =       "327--339"
+, keywords =    "Delaunay triangulation, medial axis"
 }
 
 @inproceedings{gpst-ipmpc-89
-, author =	"A. V. Goldberg and S. A. Plotkin and D. B. Shmoys and E. Tardos"
-, title =	"Interior-point methods in parallel computation"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"350--355"
-, comments =	"Submitted to SIAM J. Comput."
+, author =      "A. V. Goldberg and S. A. Plotkin and D. B. Shmoys and E. Tardos"
+, title =       "Interior-point methods in parallel computation"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "350--355"
+, comments =    "Submitted to SIAM J. Comput."
 }
 
 @incollection{gtt-nfa-90
-, author =	"A. V. Goldberg and E. Tardos and R. E. Tarjan"
-, title =	"Network flow algorithms"
-, editor =	"B. Korte and L. Lov{\'a}sz and H. J. Pr{\"o}mel and A. Schrijver"
-, booktitle =	"Paths, Flows, and VLSI-Layout"
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"101--164"
-, update =	"97.11 bibrelex"
+, author =      "A. V. Goldberg and E. Tardos and R. E. Tarjan"
+, title =       "Network flow algorithms"
+, editor =      "B. Korte and L. Lov{\'a}sz and H. J. Pr{\"o}mel and A. Schrijver"
+, booktitle =   "Paths, Flows, and VLSI-Layout"
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "101--164"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gt-namfp-86
-, author =	"A. V. Goldberg and R. E. Tarjan"
-, title =	"A new approach to the maximum flow problem"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"136--146"
-, update =	"98.03 bibrelex"
+, author =      "A. V. Goldberg and R. E. Tarjan"
+, title =       "A new approach to the maximum flow problem"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "136--146"
+, update =      "98.03 bibrelex"
 }
 
 @article{gt-namfp-88
-, author =	"A. V. Goldberg and R. E. Tarjan"
-, title =	"A new approach to the maximum flow problem"
-, journal =	"J. ACM"
-, volume =	35
-, year =	1988
-, pages =	"921--940"
-, update =	"97.11 bibrelex"
+, author =      "A. V. Goldberg and R. E. Tarjan"
+, title =       "A new approach to the maximum flow problem"
+, journal =     "J. ACM"
+, volume =      35
+, year =        1988
+, pages =       "921--940"
+, update =      "97.11 bibrelex"
 }
 
 @article{g-wecss-91
-, author =	"D. Goldberg"
-, title =	"What Every Computer Scientist Should Know About Floating-Point Arithmetic"
-, journal =	"ACM Comput. Surv."
-, volume =	23
-, number =	1
-, month =	mar
-, year =	1991
-, pages =	"5--48"
-, keywords =	"numerical precision, stability, robustness"
-, update =	"97.11 bibrelex, 93.09 held"
+, author =      "D. Goldberg"
+, title =       "What Every Computer Scientist Should Know About Floating-Point Arithmetic"
+, journal =     "ACM Comput. Surv."
+, volume =      23
+, number =      1
+, month =       mar
+, year =        1991
+, pages =       "5--48"
+, keywords =    "numerical precision, stability, robustness"
+, update =      "97.11 bibrelex, 93.09 held"
 }
 
 @book{ghlw-afr-95
-, title =	"Algorithmic Foundations of Robotics"
-, editor =	"K. Goldberg and D. Halperin and J.-C. Latombe and R. Wilson"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1995
-, update =	"97.03 schwarzkopf"
+, title =       "Algorithmic Foundations of Robotics"
+, editor =      "K. Goldberg and D. Halperin and J.-C. Latombe and R. Wilson"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1995
+, update =      "97.03 schwarzkopf"
 }
 
 @article{g-oppws-93
-, author =	"Kenneth Y. Goldberg"
-, title =	"Orienting Polygonal Parts Without Sensors"
-, journal =	"Algorithmica"
-, volume =	10
-, year =	1993
-, pages =	"201--225"
-, keywords =	"part orientation, parallel-jaw gripper"
-, update =	"96.09 romanik"
+, author =      "Kenneth Y. Goldberg"
+, title =       "Orienting Polygonal Parts Without Sensors"
+, journal =     "Algorithmica"
+, volume =      10
+, year =        1993
+, pages =       "201--225"
+, keywords =    "part orientation, parallel-jaw gripper"
+, update =      "96.09 romanik"
 }
 
 @phdthesis{g-sprm-90
-, author =	"K. Y. Goldberg"
-, title =	"Stochastic plans for robotic manipulation"
-, school =	"School Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, month =	aug
-, year =	1990
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "K. Y. Goldberg"
+, title =       "Stochastic plans for robotic manipulation"
+, school =      "School Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, month =       aug
+, year =        1990
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{gme-gsppp-91
-, author =	"K. Y. Goldberg and M. T. Mason and M. A. Erdmann"
-, title =	"Generating stochastic plans for a programmable parts feeder"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, month =	apr
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "K. Y. Goldberg and M. T. Mason and M. A. Erdmann"
+, title =       "Generating stochastic plans for a programmable parts feeder"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, month =       apr
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @article{g-ipp-35
-, author =	"M. Goldberg"
-, title =	"The isoperimetric problem for polyhedra"
-, journal =	"Tohoku Mathematics Journal"
-, volume =	40
-, year =	1935
-, pages =	"226--236"
-, update =	"97.11 bibrelex"
+, author =      "M. Goldberg"
+, title =       "The isoperimetric problem for polyhedra"
+, journal =     "Tohoku Mathematics Journal"
+, volume =      40
+, year =        1935
+, pages =       "226--236"
+, update =      "97.11 bibrelex"
 }
 
 @article{g-mpmmm-73
-, author =	"M. Goldberg"
-, title =	"The minimum path and the minimum motion of a moved line segments"
-, journal =	"Math. Mag."
-, volume =	46
-, year =	1973
-, pages =	"31--34"
-, update =	"98.03 bibrelex"
+, author =      "M. Goldberg"
+, title =       "The minimum path and the minimum motion of a moved line segments"
+, journal =     "Math. Mag."
+, volume =      46
+, year =        1973
+, pages =       "31--34"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{gz-odapp-95
-, author =	"T. Goldberg and U. Zwick"
-, title =	"Optimal Deterministic Approximate Parallel Prefix Sums and Their Applications"
-, booktitle =	"Proc. 4th IEEE Israel Symp. on Theory of Computing and Systems"
-, year =	1995
-, pages =	"220--228"
-, update =	"96.09 orourke"
+, author =      "T. Goldberg and U. Zwick"
+, title =       "Optimal Deterministic Approximate Parallel Prefix Sums and Their Applications"
+, booktitle =   "Proc. 4th IEEE Israel Symp. on Theory of Computing and Systems"
+, year =        1995
+, pages =       "220--228"
+, update =      "96.09 orourke"
 }
 
 @article{glv-op-91
-, author =	"Bruce L. Golden and Larry Levy and Rakesh Vohra"
-, title =	"The Orienteering Problem"
-, journal =	"Naval Res. Logistics"
-, volume =	34
-, year =	1991
-, pages =	"307--318"
-, keywords =	"TSP, generalized TSP"
-, update =	"98.03 mitchell"
+, author =      "Bruce L. Golden and Larry Levy and Rakesh Vohra"
+, title =       "The Orienteering Problem"
+, journal =     "Naval Res. Logistics"
+, volume =      34
+, year =        1991
+, pages =       "307--318"
+, keywords =    "TSP, generalized TSP"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{g-ocsa-93
-, author =	"D. Goldfarb"
-, title =	"On the complexity of the simplex algorithm"
-, editor =	"S. Gomez"
-, booktitle =	"IV. Workshop on Numerical Analysis and Optimization"
-, site =	"Oaxaca, Mexico"
-, year =	1993
-, update =	"97.03 gaertner+salinger"
+, author =      "D. Goldfarb"
+, title =       "On the complexity of the simplex algorithm"
+, editor =      "S. Gomez"
+, booktitle =   "IV. Workshop on Numerical Analysis and Optimization"
+, site =        "Oaxaca, Mexico"
+, year =        1993
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{g-csa-94
-, author =	"Donald Goldfarb"
-, title =	"On the complexity of the simplex algorithm"
-, booktitle =	"Advances in optimization and numerical analysis"
-, publisher =	"Kluwer"
-, address =	"Dordrecht"
-, year =	1994
-, pages =	"25--38"
-, update =	"97.11 bibrelex"
+, author =      "Donald Goldfarb"
+, title =       "On the complexity of the simplex algorithm"
+, booktitle =   "Advances in optimization and numerical analysis"
+, publisher =   "Kluwer"
+, address =     "Dordrecht"
+, year =        1994
+, pages =       "25--38"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{g-wccsv-83
-, author =	"D. Goldfarb"
-, title =	"Worst case complexity of the shadow vertex simplex al\-go\-rithm"
-, type =	"Preprint"
-, institution =	"Co\-lum\-bia University"
-, year =	1983
-, update =	"97.03 gaertner+salinger"
+, author =      "D. Goldfarb"
+, title =       "Worst case complexity of the shadow vertex simplex al\-go\-rithm"
+, type =        "Preprint"
+, institution = "Co\-lum\-bia University"
+, year =        1983
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{gs-wcbse-79
-, author =	"D. Goldfarb and W. Y. Sit"
-, title =	"Worst case behavior of the steepest edge simplex method"
-, journal =	"Discrete Appl. Math."
-, volume =	1
-, year =	1979
-, pages =	"277--285"
-, update =	"97.03 gaertner+salinger"
+, author =      "D. Goldfarb and W. Y. Sit"
+, title =       "Worst case behavior of the steepest edge simplex method"
+, journal =     "Discrete Appl. Math."
+, volume =      1
+, year =        1979
+, pages =       "277--285"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{gmtf-nrtcr-89
-, author =	"J. Goldfeather and S. Molnar and G. Turk and H. Fuchs"
-, title =	"Near Real-Time {CSG} Rendering Using Tree Normalization and Geometric Pruning"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	9
-, number =	3
-, year =	1989
-, pages =	"20--28"
-, update =	"93.09 goodrich"
+, author =      "J. Goldfeather and S. Molnar and G. Turk and H. Fuchs"
+, title =       "Near Real-Time {CSG} Rendering Using Tree Normalization and Geometric Pruning"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      9
+, number =      3
+, year =        1989
+, pages =       "20--28"
+, update =      "93.09 goodrich"
 }
 
 @article{g-idppr-67
-, author =	"J. R. Goldman"
-, title =	"Infinitely divisible point processes in {$R^{n}$}"
-, journal =	"J. Math. Anal. Appl."
-, volume =	17
-, year =	1967
-, pages =	"133--146"
+, author =      "J. R. Goldman"
+, title =       "Infinitely divisible point processes in {$R^{n}$}"
+, journal =     "J. Math. Anal. Appl."
+, volume =      17
+, year =        1967
+, pages =       "133--146"
 }
 
 @incollection{g-rssm-87
-, author =	"R. Goldman"
-, title =	"The role of surfaces in solid geometric modeling"
-, editor =	"G. E. Farin"
-, booktitle =	"Geometric Modeling: Algorithms and New Trends"
-, publisher =	"Society for Industrial and Appliced Mathematics"
-, year =	1987
-, pages =	"69--90"
-, update =	"98.07 bibrelex"
+, author =      "R. Goldman"
+, title =       "The role of surfaces in solid geometric modeling"
+, editor =      "G. E. Farin"
+, booktitle =   "Geometric Modeling: Algorithms and New Trends"
+, publisher =   "Society for Industrial and Appliced Mathematics"
+, year =        1987
+, pages =       "69--90"
+, update =      "98.07 bibrelex"
 }
 
 @article{g-mrtii-85
-, author =	"R. N. Goldman"
-, title =	"The methods of resolvents: a technique for the implicitization, inversion and intersection of non-planar, parametric, rational cubic curves"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	"??"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "R. N. Goldman"
+, title =       "The methods of resolvents: a technique for the implicitization, inversion and intersection of non-planar, parametric, rational cubic curves"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      "??"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @article{gs-sarpc-85
-, author =	"Ronald N. Goldman and Thomas W. Sederberg"
-, title =	"Some Applications of Resultants to Problems in Computational Geometry"
-, journal =	"Visual Comput."
-, volume =	1
-, number =	2
-, month =	oct
-, year =	1985
-, pages =	"101--107"
+, author =      "Ronald N. Goldman and Thomas W. Sederberg"
+, title =       "Some Applications of Resultants to Problems in Computational Geometry"
+, journal =     "Visual Comput."
+, volume =      1
+, number =      2
+, month =       oct
+, year =        1985
+, pages =       "101--107"
 }
 
 @article{g-segta-89
-, author =	"S. Goldman"
-, title =	"A Space Efficient Greedy Triangulation Algorithm"
-, journal =	"Inform. Process. Lett."
-, volume =	31
-, number =	4
-, year =	1989
-, pages =	"191--196"
-, annote =	"CDT is used to compute GT. DT is constrained to
-		 include all the edges of the GT so far. Next edge can
-		 be found in time O(n)."
-, abstract =	"We show that the greedy triangulation of n points in
-		 the plane can be computed in O(n**2 log n) time and
-		 O(n) memory and storage. In particular we show that, by
-		 maintaining a generalized Delaunay triangulation, the
-		 next edge to be added to the greedy triangulation can
-		 be found in O(n) time. Furthermore, if the generalized
-		 Delaunay triangulation of a simple polygon could be
-		 computed in O(n) time, our algorithm would compute the
-		 greedy triangulation in O(n**2) time. (Author abstract)
-		 13 Refs."
+, author =      "S. Goldman"
+, title =       "A Space Efficient Greedy Triangulation Algorithm"
+, journal =     "Inform. Process. Lett."
+, volume =      31
+, number =      4
+, year =        1989
+, pages =       "191--196"
+, annote =      "CDT is used to compute GT. DT is constrained to
+                 include all the edges of the GT so far. Next edge can
+                 be found in time O(n)."
+, abstract =    "We show that the greedy triangulation of n points in
+                 the plane can be computed in O(n**2 log n) time and
+                 O(n) memory and storage. In particular we show that, by
+                 maintaining a generalized Delaunay triangulation, the
+                 next edge to be added to the greedy triangulation can
+                 be found in O(n) time. Furthermore, if the generalized
+                 Delaunay triangulation of a simple polygon could be
+                 computed in O(n) time, our algorithm would compute the
+                 greedy triangulation in O(n**2) time. (Author abstract)
+                 13 Refs."
 }
 
 @article{gsa-vetii-84
-, author =	"R. Goldmann and T. Sederberg and R. Anderson"
-, title =	"Vector elimination: a technique for implicitization, inversion and intersection of planar parametric rational polynomial curves"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	1
-, year =	1984
-, pages =	"327--356"
-, update =	"98.03 bibrelex"
+, author =      "R. Goldmann and T. Sederberg and R. Anderson"
+, title =       "Vector elimination: a technique for implicitization, inversion and intersection of planar parametric rational polynomial curves"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      1
+, year =        1984
+, pages =       "327--356"
+, update =      "98.03 bibrelex"
 }
 
 @article{gs-acohr-87
-, author =	"J. Goldsmith and J. Salmon"
-, title =	"Automatic Creation of Object Hierarchies for Ray Tracing"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	7
-, year =	1987
-, pages =	"14--20"
-, update =	"98.03 mitchell"
+, author =      "J. Goldsmith and J. Salmon"
+, title =       "Automatic Creation of Object Hierarchies for Ray Tracing"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      7
+, year =        1987
+, pages =       "14--20"
+, update =      "98.03 mitchell"
 }
 
 @book{g-cra-67
-, author =	"A. A. Goldstein"
-, title =	"Constructive Real Analysis"
-, publisher =	"Harper \& Row Publishers"
-, address =	"New York, NY"
-, year =	1967
-, update =	"98.03 bibrelex"
+, author =      "A. A. Goldstein"
+, title =       "Constructive Real Analysis"
+, publisher =   "Harper \& Row Publishers"
+, address =     "New York, NY"
+, year =        1967
+, update =      "98.03 bibrelex"
 }
 
 @techreport{gr-ibtsp-87
-, author =	"A. S. Goldstein and E. M. Reingold"
-, title =	"Improved bounds on the traveling salesman problem in the unit cube"
-, type =	"Technical {Report}"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "A. S. Goldstein and E. M. Reingold"
+, title =       "Improved bounds on the traveling salesman problem in the unit cube"
+, type =        "Technical {Report}"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @book{g-cm-80
-, author =	"H. Goldstein"
-, title =	"Classical Mechanics"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1980
-, update =	"98.07 bibrelex"
+, author =      "H. Goldstein"
+, title =       "Classical Mechanics"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1980
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{grsy-pqlc-97
-, author =	"J. Goldstein and R. Ramakrishnan and U. Shaft and J.-B. Yu"
-, title =	"Processing queries by linear constraints"
-, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
-, year =	1997
-, pages =	"257--267"
-, update =	"97.07 agarwal"
+, author =      "J. Goldstein and R. Ramakrishnan and U. Shaft and J.-B. Yu"
+, title =       "Processing queries by linear constraints"
+, booktitle =   "Proc. Annu. ACM Sympos. Principles Database Syst."
+, year =        1997
+, pages =       "257--267"
+, update =      "97.07 agarwal"
 }
 
 @techreport{gpsw-3dwmu-87
-, author =	"M. Goldstein and F. G. Pin and G. de Saussure and C. R. Weisbin"
-, title =	"3-D World Modeling With Updating Capability Based on Combinatorial Geometry"
-, type =	"Technical {Report}"
-, number =	"CESAR-87/02"
-, institution =	"Oak Ridge National Laboratory"
-, year =	1987
-, update =	"93.09 milone+mitchell"
+, author =      "M. Goldstein and F. G. Pin and G. de Saussure and C. R. Weisbin"
+, title =       "3-D World Modeling With Updating Capability Based on Combinatorial Geometry"
+, type =        "Technical {Report}"
+, number =      "CESAR-87/02"
+, institution = "Oak Ridge National Laboratory"
+, year =        1987
+, update =      "93.09 milone+mitchell"
 }
 
 @article{g-aslpr-95
-, author =	"M. Goldwasser"
-, title =	"A survey of linear programming in randomized subexponential time"
-, journal =	"SIGACT News"
-, volume =	26
-, number =	2
-, year =	1995
-, pages =	"96--104"
-, update =	"97.03 agarwal+gaertner+salinger"
+, author =      "M. Goldwasser"
+, title =       "A survey of linear programming in randomized subexponential time"
+, journal =     "SIGACT News"
+, volume =      26
+, number =      2
+, year =        1995
+, pages =       "96--104"
+, update =      "97.03 agarwal+gaertner+salinger"
 }
 
 @inproceedings{g-imap-95
-, author =	"Michael Goldwasser"
-, title =	"An Implementation for Maintaining Arrangements of Polygons"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C32--C33"
-, keywords =	"randomized incremental algorithm"
-, cites =	"ci-tsc-84, egs-oplms-86, m-cgitr-93, rggr-esaac-94, s-sfira-91, s-opgfg-91, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Michael Goldwasser"
+, title =       "An Implementation for Maintaining Arrangements of Polygons"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C32--C33"
+, keywords =    "randomized incremental algorithm"
+, cites =       "ci-tsc-84, egs-oplms-86, m-cgitr-93, rggr-esaac-94, s-sfira-91, s-opgfg-91, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @techreport{g-pacpa-88
-, author =	"M. Golin"
-, title =	"Probabilistic analysis of a closest pair algorithm"
-, type =	"Technical {Report}"
-, number =	"TR-194-88"
-, institution =	"Dept. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, month =	dec
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "M. Golin"
+, title =       "Probabilistic analysis of a closest pair algorithm"
+, type =        "Technical {Report}"
+, number =      "TR-194-88"
+, institution = "Dept. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, month =       dec
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @techreport{grss-rdsdc-93t
-, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
-, title =	"Randomized data structures for the dynamic closest-pair problem"
-, type =	"Report"
-, number =	"MPI-I-93-102"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
+, author =      "M. Golin and R. Raman and C. Schwarz and M. Smid"
+, title =       "Randomized data structures for the dynamic closest-pair problem"
+, type =        "Report"
+, number =      "MPI-I-93-102"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
 }
 
 @inproceedings{grss-rdsdc-93i
-, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
-, title =	"Randomized Data Structures for the Dynamic Closest-Pair Problem"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, month =	jan
-, year =	1993
-, pages =	"301--310"
-, update =	"98.11 bibrelex, 93.05 smid"
+, author =      "M. Golin and R. Raman and C. Schwarz and M. Smid"
+, title =       "Randomized Data Structures for the Dynamic Closest-Pair Problem"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, month =       jan
+, year =        1993
+, pages =       "301--310"
+, update =      "98.11 bibrelex, 93.05 smid"
 }
 
 @article{grss-rdsdc-98
-, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
-, title =	"Randomized Data Structures for the Dynamic Closest-Pair Problem"
-, journal =	"SIAM J. Comput."
-, volume =	27
-, year =	1998
-, pages =	"1036--1072"
-, update =	"98.07 smid"
+, author =      "M. Golin and R. Raman and C. Schwarz and M. Smid"
+, title =       "Randomized Data Structures for the Dynamic Closest-Pair Problem"
+, journal =     "SIAM J. Comput."
+, volume =      27
+, year =        1998
+, pages =       "1036--1072"
+, update =      "98.07 smid"
 }
 
 @techreport{grss-sracp-92
-, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
-, title =	"Simple randomized algorithms for closest pair problems"
-, type =	"Report"
-, number =	"MPI-I-92-155"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
-, precedes =	"grss-sracp-93"
-, update =	"98.11 bibrelex"
+, author =      "M. Golin and R. Raman and C. Schwarz and M. Smid"
+, title =       "Simple randomized algorithms for closest pair problems"
+, type =        "Report"
+, number =      "MPI-I-92-155"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
+, precedes =    "grss-sracp-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{grss-sracp-93
-, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
-, title =	"Simple randomized algorithms for closest pair problems"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"246--251"
-, succeeds =	"grss-sracp-92"
-, cites =	"b-lbact-83, bs-dcms-76, dm-nuchf-90, cms-frric-92i, grss-rdsdc-93i, km-srsac-91, ls-ekcpo-92i, sss-oaolc-92, s-sdlpc-91, r-pa-76, s-barg-92, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "M. Golin and R. Raman and C. Schwarz and M. Smid"
+, title =       "Simple randomized algorithms for closest pair problems"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "246--251"
+, succeeds =    "grss-sracp-92"
+, cites =       "b-lbact-83, bs-dcms-76, dm-nuchf-90, cms-frric-92i, grss-rdsdc-93i, km-srsac-91, ls-ekcpo-92i, sss-oaolc-92, s-sdlpc-91, r-pa-76, s-barg-92, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{grss-sracp-95
-, author =	"M. Golin and R. Raman and C. Schwarz and M. Smid"
-, title =	"Simple randomized algorithms for closest pair problems"
-, journal =	"Nordic J. Comput."
-, volume =	2
-, year =	1995
-, pages =	"3--27"
-, update =	"95.09 smid"
+, author =      "M. Golin and R. Raman and C. Schwarz and M. Smid"
+, title =       "Simple randomized algorithms for closest pair problems"
+, journal =     "Nordic J. Comput."
+, volume =      2
+, year =        1995
+, pages =       "3--27"
+, update =      "95.09 smid"
 }
 
 @inproceedings{gs-asyec-88
-, author =	"M. Golin and R. Sedgewick"
-, title =	"Analysis of a simple yet efficient convex hull algorithm"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"153--163"
-, cites =	"bs-dclet-78, dt-nleta-81, e-nchap-77, gs-prp-85, ol-fcbch-80, ps-cgi-85, rs-udkhv-63, r-pma-76, s-a-83, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "M. Golin and R. Sedgewick"
+, title =       "Analysis of a simple yet efficient convex hull algorithm"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "153--163"
+, cites =       "bs-dclet-78, dt-nleta-81, e-nchap-77, gs-prp-85, ol-fcbch-80, ps-cgi-85, rs-udkhv-63, r-pma-76, s-a-83, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{g-dcppa-92
-, author =	"M. J. Golin"
-, title =	"Dynamic closest pairs -- a probabilistic approach"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"340--351"
-, update =	"94.01 smid"
+, author =      "M. J. Golin"
+, title =       "Dynamic closest pairs -- a probabilistic approach"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "340--351"
+, update =      "94.01 smid"
 }
 
 @article{g-hmmcb-93
-, author =	"M. J. Golin"
-, title =	"How many maxima can there be?"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, year =	1993
-, pages =	"335--353"
-, update =	"96.09 devillers"
+, author =      "M. J. Golin"
+, title =       "How many maxima can there be?"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, year =        1993
+, pages =       "335--353"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{g-ltmwt-96
-, author =	"Mordecai J. Golin"
-, title =	"Limit theorems for minimum-weight triangulations, other {Euclidean} functionals, and probabilistic recurrence relations"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"252--260"
-, keywords =	"uniform distribution, MWT, degree probabilities of Delaunay triangulations"
-, update =	"96.09 agarwal, 96.01 mitchell"
+, author =      "Mordecai J. Golin"
+, title =       "Limit theorems for minimum-weight triangulations, other {Euclidean} functionals, and probabilistic recurrence relations"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "252--260"
+, keywords =    "uniform distribution, MWT, degree probabilities of Delaunay triangulations"
+, update =      "96.09 agarwal, 96.01 mitchell"
 }
 
 @inproceedings{g-mcr-92
-, author =	"Mordecai J. Golin"
-, title =	"Maxima in Convex Regions"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"23--27"
-, update =	"00.03 bibrelex"
+, author =      "Mordecai J. Golin"
+, title =       "Maxima in Convex Regions"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "23--27"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{g-mcr-93
-, author =	"M. J. Golin"
-, title =	"Maxima in Convex Regions"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"352--360"
-, keywords =	"probabilistic geometry"
-, update =	"93.09 rote, 93.05 smid"
+, author =      "M. J. Golin"
+, title =       "Maxima in Convex Regions"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "352--360"
+, keywords =    "probabilistic geometry"
+, update =      "93.09 rote, 93.05 smid"
 }
 
 @techreport{g-pacpa-91
-, author =	"M. J. Golin"
-, title =	"Probabilistic analyses of closest pair algorithms"
-, type =	"Report"
-, number =	1471
-, institution =	"INRIA"
-, address =	"Rocquencourt, France"
-, year =	1991
+, author =      "M. J. Golin"
+, title =       "Probabilistic analyses of closest pair algorithms"
+, type =        "Report"
+, number =      1471
+, institution = "INRIA"
+, address =     "Rocquencourt, France"
+, year =        1991
 }
 
 @phdthesis{g-paga-90
-, author =	"M. J. Golin"
-, title =	"Probabilistic analysis of geometric algorithms"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NY"
-, year =	1990
-, keywords =	"doctoral thesis"
-, update =	"93.05 smid"
+, author =      "M. J. Golin"
+, title =       "Probabilistic analysis of geometric algorithms"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NY"
+, year =        1990
+, keywords =    "doctoral thesis"
+, update =      "93.05 smid"
 }
 
 @inproceedings{gn-ac3vd-01
-, author =	"Mordecai J. Golin and Hyeon-Suk Na"
-, title =	"On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"127--135"
-, update =	"02.03 devillers"
+, author =      "Mordecai J. Golin and Hyeon-Suk Na"
+, title =       "On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "127--135"
+, update =      "02.03 devillers"
 }
 
 @inproceedings{gss-fdcg-92
-, author =	"M. J. Golin and C. Schwarz and M. Smid"
-, title =	"Further dynamic computational geometry"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"154--159"
-, cites =	"ako-iqco-91, a-dcg-83, dsst-mdsp-89, fl-vdmpp-91, ps-cgi-85, k-nrdsc-92, st-pplup-86, st-dsdt-83, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M. J. Golin and C. Schwarz and M. Smid"
+, title =       "Further dynamic computational geometry"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "154--159"
+, cites =       "ako-iqco-91, a-dcg-83, dsst-mdsp-89, fl-vdmpp-91, ps-cgi-85, k-nrdsc-92, st-pplup-86, st-dsdt-83, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @book{g-p-65
-, author =	"S. W. Golomb"
-, title =	"Polyominoes"
-, publisher =	"Charles Scribner's Sons"
-, address =	"New York"
-, year =	1965
-, update =	"98.07 bibrelex"
+, author =      "S. W. Golomb"
+, title =       "Polyominoes"
+, publisher =   "Charles Scribner's Sons"
+, address =     "New York"
+, year =        1965
+, update =      "98.07 bibrelex"
 }
 
 @book{g-p-66
-, author =	"S. W. Golomb"
-, title =	"Polyominoes"
-, publisher =	"Georges Allen and Unwin Ltd"
-, address =	"London, UK"
-, year =	1966
-, update =	"97.11 bibrelex"
+, author =      "S. W. Golomb"
+, title =       "Polyominoes"
+, publisher =   "Georges Allen and Unwin Ltd"
+, address =     "London, UK"
+, year =        1966
+, update =      "97.11 bibrelex"
 }
 
 @book{gl-mc-83
-, author =	"G. Golub and C. van Loan"
-, title =	"Matrix Computations"
-, publisher =	"Johns Hopkins Univ. Press"
-, address =	"Baltimore, MA"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "G. Golub and C. van Loan"
+, title =       "Matrix Computations"
+, publisher =   "Johns Hopkins Univ. Press"
+, address =     "Baltimore, MA"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @book{gl-mc-89
-, author =	"G. H. Golub and C. F. van Loan"
-, title =	"Matrix computations"
-, edition =	"2nd"
-, publisher =	"Johns Hopkins University Press"
-, address =	"Baltimore, MD"
-, year =	1989
-, update =	"98.03 bibrelex"
+, author =      "G. H. Golub and C. F. van Loan"
+, title =       "Matrix computations"
+, edition =     "2nd"
+, publisher =   "Johns Hopkins University Press"
+, address =     "Baltimore, MD"
+, year =        1989
+, update =      "98.03 bibrelex"
 }
 
 @book{gg-smts-73
-, author =	"M. Golubitsky and V. Guillemin"
-, title =	"Stable mappings and their singularities"
-, publisher =	"Springer-Verlag"
-, year =	1973
-, update =	"97.11 bibrelex"
+, author =      "M. Golubitsky and V. Guillemin"
+, title =       "Stable mappings and their singularities"
+, publisher =   "Springer-Verlag"
+, year =        1973
+, update =      "97.11 bibrelex"
 }
 
 @book{g-agtpg-80
-, author =	"M. C. Golumbic"
-, title =	"Algorithmic Graph Theory and Perfect Graphs"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1980
+, author =      "M. C. Golumbic"
+, title =       "Algorithmic Graph Theory and Perfect Graphs"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1980
 }
 
 @inproceedings{gm-gigt-82
-, author =	"M. C. Golumbic and C. L. Monma"
-, title =	"A generalization of interval graphs with tolerances"
-, booktitle =	"Proc. 13th Southeastern Conf. on Combinatorics, Graph Theory and Computing"
-, site =	"Winnipeg"
-, series =	"Congr. Numer."
-, volume =	35
-, organization =	"Utilitas Math."
-, year =	1982
-, pages =	"321--331"
-, update =	"98.11 bibrelex"
+, author =      "M. C. Golumbic and C. L. Monma"
+, title =       "A generalization of interval graphs with tolerances"
+, booktitle =   "Proc. 13th Southeastern Conf. on Combinatorics, Graph Theory and Computing"
+, site =        "Winnipeg"
+, series =      "Congr. Numer."
+, volume =      35
+, organization =        "Utilitas Math."
+, year =        1982
+, pages =       "321--331"
+, update =      "98.11 bibrelex"
 }
 
 @article{gmt-tg-84
-, author =	"M. C. Golumbic and C. L. Monma and W. T. Trotter"
-, title =	"Tolerance graphs"
-, journal =	"Discrete Appl. Math."
-, volume =	9
-, year =	1984
-, pages =	"157--170"
-, update =	"98.11 bibrelex"
+, author =      "M. C. Golumbic and C. L. Monma and W. T. Trotter"
+, title =       "Tolerance graphs"
+, journal =     "Discrete Appl. Math."
+, volume =      9
+, year =        1984
+, pages =       "157--170"
+, update =      "98.11 bibrelex"
 }
 
 @article{gg-dmtds-79
-, author =	"D. Gomez and A. Guzman"
-, title =	"Digital Model for Three-Dimensional Surface Representation"
-, journal =	"Geo-Process."
-, volume =	1
-, year =	1979
-, pages =	"53--70"
-, update =	"98.11 bibrelex"
+, author =      "D. Gomez and A. Guzman"
+, title =       "Digital Model for Three-Dimensional Surface Representation"
+, journal =     "Geo-Process."
+, volume =      1
+, year =        1979
+, pages =       "53--70"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{g-lttii-95
-, author =	"Teresa G{\'o}mez-Diaz"
-, title =	"Let {$T$} be a Triangle, Is It Isosceles?"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"47--51"
-, update =	"00.03 bibrelex"
+, author =      "Teresa G{\'o}mez-Diaz"
+, title =       "Let {$T$} be a Triangle, Is It Isosceles?"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "47--51"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{ghrst-icp-98
-, author =	"Francisco G{\'o}mez and Ferran Hurtado and Suneeta Ramaswami and Vera Sacrist{\'a}n and Godfried Toussaint"
-, title =	"Implicit Convex Polygons"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"83--85"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Francisco G{\'o}mez and Ferran Hurtado and Suneeta Ramaswami and Vera Sacrist{\'a}n and Godfried Toussaint"
+, title =       "Implicit Convex Polygons"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "83--85"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{grt-rnacg-97
-, author =	"F. Gomez and S. Ramaswami and G. Toussaint"
-, title =	"On Removing Non-degeneracy Assumptions in Computational Geometry"
-, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1203
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"86--99"
-, update =	"00.03 devillers, 98.03 mitchell"
+, author =      "F. Gomez and S. Ramaswami and G. Toussaint"
+, title =       "On Removing Non-degeneracy Assumptions in Computational Geometry"
+, booktitle =   "Algorithms and Complexity (Proc. CIAC' 97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1203
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "86--99"
+, update =      "00.03 devillers, 98.03 mitchell"
 }
 
 @book{gb-hads-91
-, author =	"G. H. Gonnet and R. Baeza-Yates"
-, title =	"Handbook of Algorithms and Data Structures"
-, publisher =	"Addison-Wesley"
-, year =	1991
-, update =	"97.03 tamassia"
+, author =      "G. H. Gonnet and R. Baeza-Yates"
+, title =       "Handbook of Algorithms and Data Structures"
+, publisher =   "Addison-Wesley"
+, year =        1991
+, update =      "97.03 tamassia"
 }
 
 @article{gmw-ddssl-83
-, author =	"G. H. Gonnet and J. I. Munro and D. Wood"
-, title =	"Direct dynamic structures for some line segment problems"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	"??"
-, year =	1983
-, pages =	"178--186"
+, author =      "G. H. Gonnet and J. I. Munro and D. Wood"
+, title =       "Direct dynamic structures for some line segment problems"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      "??"
+, year =        1983
+, pages =       "178--186"
 }
 
 @book{g-itsn-86
-, author =	"Harry Gonshor"
-, title =	"An introduction to the theory of surreal numbers"
-, series =	"London Mathematical Society lecture note series"
-, volume =	110
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge"
-, year =	1986
-, update =	"98.11 bibrelex"
+, author =      "Harry Gonshor"
+, title =       "An introduction to the theory of surreal numbers"
+, series =      "London Mathematical Society lecture note series"
+, volume =      110
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge"
+, year =        1986
+, update =      "98.11 bibrelex"
 }
 
 @article{g-sdilp-91
-, author =	"C. C. Gonzaga"
-, title =	"Search directions for interior linear-programming methods"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"153--181"
+, author =      "C. C. Gonzaga"
+, title =       "Search directions for interior linear-programming methods"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "153--181"
 }
 
 @techreport{grsz-odgpa-89
-, author =	"T. M. Gonzales and M. Razzazi and M. Shing and S. Zheng"
-, title =	"On optimal $d$-guillotine partitions approximating hyperrectangular partitions"
-, type =	"Technical {Report}"
-, number =	"89-25"
-, institution =	"Dept. Comput. Sci., Univ. California"
-, address =	"Santa Barbara, CA"
-, month =	oct
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "T. M. Gonzales and M. Razzazi and M. Shing and S. Zheng"
+, title =       "On optimal $d$-guillotine partitions approximating hyperrectangular partitions"
+, type =        "Technical {Report}"
+, number =      "89-25"
+, institution = "Dept. Comput. Sci., Univ. California"
+, address =     "Santa Barbara, CA"
+, month =       oct
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @techreport{g-asrp-75
-, author =	"T. Gonzalez"
-, title =	"Algorithms on sets and related problems"
-, type =	"Technical {Report}"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Oklahoma"
-, address =	"Norman, OK"
-, year =	1975
+, author =      "T. Gonzalez"
+, title =       "Algorithms on sets and related problems"
+, type =        "Technical {Report}"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Oklahoma"
+, address =     "Norman, OK"
+, year =        1975
 }
 
 @article{g-cmmid-85
-, author =	"T. Gonzalez"
-, title =	"Clustering to minimize the maximum intercluster distance"
-, journal =	"Theoret. Comput. Sci."
-, volume =	38
-, year =	1985
-, pages =	"293--306"
-, update =	"96.05 agarwal"
+, author =      "T. Gonzalez"
+, title =       "Clustering to minimize the maximum intercluster distance"
+, journal =     "Theoret. Comput. Sci."
+, volume =      38
+, year =        1985
+, pages =       "293--306"
+, update =      "96.05 agarwal"
 }
 
 @article{g-cspms-91
-, author =	"T. Gonzalez"
-, title =	"Covering a set of points in multidimensional space"
-, journal =	"Inform. Process. Lett."
-, volume =	40
-, year =	1991
-, pages =	"181--188"
-, update =	"96.09 devillers, 96.05 agarwal"
+, author =      "T. Gonzalez"
+, title =       "Covering a set of points in multidimensional space"
+, journal =     "Inform. Process. Lett."
+, volume =      40
+, year =        1991
+, pages =       "181--188"
+, update =      "96.09 devillers, 96.05 agarwal"
 }
 
 @inproceedings{gr-aaphp-91
-, author =	"T. Gonzalez and M. Razzazi"
-, title =	"An approximation algorithm for partitioning a hyperrectilinear polytope with holes"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"183--186"
-, keywords =	"orthogonal hyperplane segments"
-, cites =	"dc-fhmel-86, dps-melgr-86, grz-edcaa-89, gz-bprp-85, gz-aaprp-85, gz-ibrgp-89, l-hmelr-83, lprs-melpr-82, l-mltfr-85, l-fhmlr-86, r-ppis-82, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "T. Gonzalez and M. Razzazi"
+, title =       "An approximation algorithm for partitioning a hyperrectilinear polytope with holes"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "183--186"
+, keywords =    "orthogonal hyperplane segments"
+, cites =       "dc-fhmel-86, dps-melgr-86, grz-edcaa-89, gz-bprp-85, gz-aaprp-85, gz-ibrgp-89, l-hmelr-83, lprs-melpr-82, l-mltfr-85, l-fhmlr-86, r-ppis-82, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{gr-pacdt-91
-, author =	"Teofilo Gonzalez and Mohammadreza Razzazi"
-, title =	"Properties and algorithms for constrained {Delaunay} triangulations"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"114--117"
-, cites =	"c-tpca-82, c-cdt-87, j-oacdt-88, j-ccdt-88, f-savd-87, gs-pmgsc-85, l-scsi-77, ls-tacdt-80, ll-gdtpg-86, nf-scbut-83, ps-cgi-85, s-cdtvd-89, sh-cpp-75, ws-oacdt-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "Teofilo Gonzalez and Mohammadreza Razzazi"
+, title =       "Properties and algorithms for constrained {Delaunay} triangulations"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "114--117"
+, cites =       "c-tpca-82, c-cdt-87, j-oacdt-88, j-ccdt-88, f-savd-87, gs-pmgsc-85, l-scsi-77, ls-tacdt-80, ll-gdtpg-86, nf-scbut-83, ps-cgi-85, s-cdtvd-89, sh-cpp-75, ws-oacdt-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{grsz-ogpao-94
-, author =	"T. Gonzalez and M. Razzazi and M.-T. Shing and S.-Q. Zheng"
-, title =	"On optimal guillotine partitions approximating optimal {$d$}-box partitions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, number =	1
-, year =	1994
-, pages =	"1--12"
-, keywords =	"approximation algorithms, d-box partitions, polynomial time complexity, guillotine partitions"
-, update =	"98.03 mitchell"
-, annote =	"Abstract:
+, author =      "T. Gonzalez and M. Razzazi and M.-T. Shing and S.-Q. Zheng"
+, title =       "On optimal guillotine partitions approximating optimal {$d$}-box partitions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, number =      1
+, year =        1994
+, pages =       "1--12"
+, keywords =    "approximation algorithms, d-box partitions, polynomial time complexity, guillotine partitions"
+, update =      "98.03 mitchell"
+, annote =      "Abstract:
 Given a set of n points, P, in E(d)(the plane when d = 2) that lie
 inside a d-box (rectangle when d = 2) R, we study the problem of
 partitioning R into d-boxes by introducing a set of orthogonal
@@ -67218,5035 +67218,5035 @@ @article{grsz-ogpao-94
 }
 
 @techreport{grz-edcaa-89
-, author =	"T. Gonzalez and M. Razzazi and S.-Q. Zheng"
-, title =	"An efficient divide-and-conquer approximation algorithm for hyperrectangular partitions"
-, type =	"Report"
-, number =	"TR-89-24"
-, institution =	"CS Dept., UCSB"
-, month =	oct
-, year =	1989
-, precedes =	"grz-edcaa-90, gz-edcap-93"
-, update =	"98.07 bibrelex"
+, author =      "T. Gonzalez and M. Razzazi and S.-Q. Zheng"
+, title =       "An efficient divide-and-conquer approximation algorithm for hyperrectangular partitions"
+, type =        "Report"
+, number =      "TR-89-24"
+, institution = "CS Dept., UCSB"
+, month =       oct
+, year =        1989
+, precedes =    "grz-edcaa-90, gz-edcap-93"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{grz-edcaa-90
-, author =	"T. Gonzalez and M. Razzazi and S.-Q. Zheng"
-, title =	"An efficient divide-and-conquer approximation algorithm for hyperrectangular partitions"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"214--217"
-, succeeds =	"grz-edcaa-89"
-, precedes =	"gz-edcap-93"
-, cites =	"dc-fhmel-86, dps-melgr-86, grsz-odgpa-89, gz-bprp-85, gz-aaprp-85, gz-ibrgp-89, k-ubsir-80, l-hmelr-83, lprs-melpr-82, l-mltfr-85, l-fhmlr-86, r-ppis-82, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "T. Gonzalez and M. Razzazi and S.-Q. Zheng"
+, title =       "An efficient divide-and-conquer approximation algorithm for hyperrectangular partitions"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "214--217"
+, succeeds =    "grz-edcaa-89"
+, precedes =    "gz-edcap-93"
+, cites =       "dc-fhmel-86, dps-melgr-86, grsz-odgpa-89, gz-bprp-85, gz-aaprp-85, gz-ibrgp-89, k-ubsir-80, l-hmelr-83, lprs-melpr-82, l-mltfr-85, l-fhmlr-86, r-ppis-82, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{gz-edcap-93
-, author =	"T. Gonzalez and S.-Q. Zheng"
-, title =	"An efficient divide and conquer approximation algorithm for partitioning into {D}-boxes"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"417--428"
-, succeeds =	"grz-edcaa-89, grz-edcaa-90"
-, update =	"98.07 bibrelex, 96.09 devillers"
+, author =      "T. Gonzalez and S.-Q. Zheng"
+, title =       "An efficient divide and conquer approximation algorithm for partitioning into {D}-boxes"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "417--428"
+, succeeds =    "grz-edcaa-89, grz-edcaa-90"
+, update =      "98.07 bibrelex, 96.09 devillers"
 }
 
 @article{gz-aapri-90
-, author =	"T. Gonzalez and S.-Q. Zheng"
-, title =	"Approximation algorithms for partitioning a rectangle with interior points"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"11--42"
-, succeeds =	"gz-bprp-85"
+, author =      "T. Gonzalez and S.-Q. Zheng"
+, title =       "Approximation algorithms for partitioning a rectangle with interior points"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "11--42"
+, succeeds =    "gz-bprp-85"
 }
 
 @techreport{gz-aaprp-85
-, author =	"T. Gonzalez and S.-Q. Zheng"
-, title =	"Approximation Algorithms for Partitioning Rectilinear Polygons"
-, type =	"Technical {Report}"
-, institution =	"Univ. California"
-, address =	"Santa Barbara, CA"
-, month =	mar
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "T. Gonzalez and S.-Q. Zheng"
+, title =       "Approximation Algorithms for Partitioning Rectilinear Polygons"
+, type =        "Technical {Report}"
+, institution = "Univ. California"
+, address =     "Santa Barbara, CA"
+, month =       mar
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gz-bprp-85
-, author =	"T. Gonzalez and S.-Q. Zheng"
-, title =	"Bounds for partitioning rectilinear polygons"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"281--287"
-, precedes =	"gz-aapri-90"
-, cites =	"ahu-daca-74, at-eadps-81, cd-dpicp-79, gjpt-tsp-78, gz-aaprp-85, lllmp-tddo2-79, llmp-tddo1-79, lprs-melpr-82, r-ppis-82, s-oadrp-82, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "T. Gonzalez and S.-Q. Zheng"
+, title =       "Bounds for partitioning rectilinear polygons"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "281--287"
+, precedes =    "gz-aapri-90"
+, cites =       "ahu-daca-74, at-eadps-81, cd-dpicp-79, gjpt-tsp-78, gz-aaprp-85, lllmp-tddo2-79, llmp-tddo1-79, lprs-melpr-82, r-ppis-82, s-oadrp-82, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{gz-ibrgp-89
-, author =	"T. Gonzalez and S.-Q. Zheng"
-, title =	"Improved Bounds for Rectangular and Guillotine Partitions"
-, journal =	"J. Symbolic Comput."
-, volume =	7
-, year =	1989
-, pages =	"591--610"
-, update =	"95.01 mitchell"
+, author =      "T. Gonzalez and S.-Q. Zheng"
+, title =       "Improved Bounds for Rectangular and Guillotine Partitions"
+, journal =     "J. Symbolic Comput."
+, volume =      7
+, year =        1989
+, pages =       "591--610"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{g-olddd-92
-, author =	"Teofilo F. Gonzalez"
-, title =	"The On-Line $d$-Dimensional Dictionary Problem"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"376--385"
-, update =	"94.01 smid, 93.09 milone+mitchell"
+, author =      "Teofilo F. Gonzalez"
+, title =       "The On-Line $d$-Dimensional Dictionary Problem"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "376--385"
+, update =      "94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{gg-tpgnt-85
-, author =	"V. Ramirez Gonzalez and M. L. Marquez Garcia"
-, title =	"Triangulation in the plane with given nodes. Triangulacion en el plano con nodos arbitrarios. Triangulation in der Ebene mit vorgegebenen Knoten"
-, journal =	"Epsilon"
-, volume =	5
-, month =	sep
-, year =	1985
-, pages =	"57--64"
-, abstract =	"An algorithm for triangulation in the plane with given
-		 nodes is presented, as well as a program in BASIC and a
-		 calculated example. Es wird ein Algorithmus entwickelt,
-		 der bei gegebenen Punkten in der Ebene eine Zerlegung
-		 des Polygons in Dreiecke berechnet. Ein Programm in
-		 BASIC und ein Beispiel sind beigegeben."
+, author =      "V. Ramirez Gonzalez and M. L. Marquez Garcia"
+, title =       "Triangulation in the plane with given nodes. Triangulacion en el plano con nodos arbitrarios. Triangulation in der Ebene mit vorgegebenen Knoten"
+, journal =     "Epsilon"
+, volume =      5
+, month =       sep
+, year =        1985
+, pages =       "57--64"
+, abstract =    "An algorithm for triangulation in the plane with given
+                 nodes is presented, as well as a program in BASIC and a
+                 calculated example. Es wird ein Algorithmus entwickelt,
+                 der bei gegebenen Punkten in der Ebene eine Zerlegung
+                 des Polygons in Dreiecke berechnet. Ein Programm in
+                 BASIC und ein Beispiel sind beigegeben."
 }
 
 @inproceedings{gl-spbce-94
-, author =	"Laureano Gonz{\'a}lez-Vega and Henri Lombardi"
-, title =	"Splines and {Pierce-Birkhoff} Conjecture: The Evaluation of Continuous and Piecewise Polynomial Functions"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"49--52"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Laureano Gonz{\'a}lez-Vega and Henri Lombardi"
+, title =       "Splines and {Pierce-Birkhoff} Conjecture: The Evaluation of Continuous and Piecewise Polynomial Functions"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "49--52"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @book{gps-emg-93
-, author =	"M. F. Goodchild and B. O. Parks and L. T. Steyaert"
-, title =	"Environmental Modeling with GIS"
-, publisher =	"Oxford University Press"
-, address =	"New York"
-, year =	1993
-, update =	"98.03 agarwal"
+, author =      "M. F. Goodchild and B. O. Parks and L. T. Steyaert"
+, title =       "Environmental Modeling with GIS"
+, publisher =   "Oxford University Press"
+, address =     "New York"
+, year =        1993
+, update =      "98.03 agarwal"
 }
 
 @article{g-he-83
-, author =	"P. R. Goodey"
-, title =	"Homothetic Ellipsoids"
-, journal =	"Math. Proc. Camb. Phil. Soc."
-, volume =	93
-, year =	1983
-, pages =	"25--34"
-, update =	"99.03 bibrelex"
+, author =      "P. R. Goodey"
+, title =       "Homothetic Ellipsoids"
+, journal =     "Math. Proc. Camb. Phil. Soc."
+, volume =      93
+, year =        1983
+, pages =       "25--34"
+, update =      "99.03 bibrelex"
 }
 
 @article{g-lcpcn-81
-, author =	"J. E. Goodman"
-, title =	"On the largest convex polygon contained in a non-convex $n$-gon or how to peel a potato"
-, journal =	"Geom. Dedicata"
-, volume =	11
-, year =	1981
-, pages =	"99--106"
+, author =      "J. E. Goodman"
+, title =       "On the largest convex polygon contained in a non-convex $n$-gon or how to peel a potato"
+, journal =     "Geom. Dedicata"
+, volume =      11
+, year =        1981
+, pages =       "99--106"
 }
 
 @article{g-pcbgs-80
-, author =	"J. E. Goodman"
-, title =	"Proof of a conjecture of {Burr}, {Gr{\"u}nbaum} and {Sloane}"
-, journal =	"Discrete Math."
-, volume =	32
-, year =	1980
-, pages =	"27--35"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Goodman"
+, title =       "Proof of a conjecture of {Burr}, {Gr{\"u}nbaum} and {Sloane}"
+, journal =     "Discrete Math."
+, volume =      32
+, year =        1980
+, pages =       "27--35"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{g-pa-97
-, author =	"J. E. Goodman"
-, title =	"Pseudoline arrangements"
-, chapter =	5
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"83--110"
-, update =	"97.11 orourke"
+, author =      "J. E. Goodman"
+, title =       "Pseudoline arrangements"
+, chapter =     5
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "83--110"
+, update =      "97.11 orourke"
 }
 
 @inproceedings{g-cots-89
-, author =	"J. E. Goodman"
-, title =	"The complexity of order types: a survey"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	1
+, author =      "J. E. Goodman"
+, title =       "The complexity of order types: a survey"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       1
 }
 
 @book{go-chdcg-97
-, title =	"Handbook of Discrete and Computational Geometry"
-, editor =	"J. E. Goodman and J. O'Rourke"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, comments =	"52 chapters, xiv + 991 pages;
+, title =       "Handbook of Discrete and Computational Geometry"
+, editor =      "J. E. Goodman and J. O'Rourke"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, comments =    "52 chapters, xiv + 991 pages;
                 published July 1997"
-, update =	"97.11 icking+orourke, 97.07 orourke, 97.03 orourke+tamassia"
+, update =      "97.11 icking+orourke, 97.07 orourke, 97.03 orourke+tamassia"
 }
 
 @article{gp-cdpb-88
-, author =	"J. E. Goodman and J. Pach"
-, title =	"Cell decomposition of polytopes by bending"
-, journal =	"Israel J. Math."
-, volume =	64
-, number =	2
-, year =	1988
-, pages =	"129--138"
-, update =	"98.11 bibrelex, 96.09 orourke"
+, author =      "J. E. Goodman and J. Pach"
+, title =       "Cell decomposition of polytopes by bending"
+, journal =     "Israel J. Math."
+, volume =      64
+, number =      2
+, year =        1988
+, pages =       "129--138"
+, update =      "98.11 bibrelex, 96.09 orourke"
 }
 
 @article{gpy-mclmr-89
-, author =	"J. E. Goodman and J. Pach and C. K. Yap"
-, title =	"Mountain climbing, ladder moving, and the ring width of a polygon"
-, journal =	"Amer. Math. Monthly"
-, volume =	96
-, year =	1989
-, pages =	"494--510"
+, author =      "J. E. Goodman and J. Pach and C. K. Yap"
+, title =       "Mountain climbing, ladder moving, and the ring width of a polygon"
+, journal =     "Amer. Math. Monthly"
+, volume =      96
+, year =        1989
+, pages =       "494--510"
 }
 
 @article{gp-tod-82
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"A theorem of ordered duality"
-, journal =	"Geom. Dedicata"
-, volume =	12
-, year =	1982
-, pages =	"63--74"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "A theorem of ordered duality"
+, journal =     "Geom. Dedicata"
+, volume =      12
+, year =        1982
+, pages =       "63--74"
 }
 
 @incollection{gp-asotd-93
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"Allowable Sequences and Order Types in Discrete and Computational Geometry"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"103--134"
-, keywords =	"survey paper, allowable sequences, order types, pseudolines, stretchability, geometric sorting, isotopy conjecture, lattice realization"
-, update =	"93.09 erickson"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "Allowable Sequences and Order Types in Discrete and Computational Geometry"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "103--134"
+, keywords =    "survey paper, allowable sequences, order types, pseudolines, stretchability, geometric sorting, isotopy conjecture, lattice realization"
+, update =      "93.09 erickson"
 }
 
 @article{gp-ftcagm-95
-, author =	"Jacob E. Goodman and Richard Pollack"
-, title =	"Foundations of a Theory of Convexity on Affine {G}rassmann Manifolds"
-, journal =	"Mathematika"
-, volume =	42
-, year =	1995
-, pages =	"305--328"
-, update =	"01.07 wenger"
+, author =      "Jacob E. Goodman and Richard Pollack"
+, title =       "Foundations of a Theory of Convexity on Affine {G}rassmann Manifolds"
+, journal =     "Mathematika"
+, volume =      42
+, year =        1995
+, pages =       "305--328"
+, update =      "01.07 wenger"
 }
 
 @book{gp-gs-82
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"Geometric Sorting"
-, series =	"Annals of Discrete Geometry and Convexity"
-, publisher =	"New York Academie of Sciences"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "Geometric Sorting"
+, series =      "Annals of Discrete Geometry and Convexity"
+, publisher =   "New York Academie of Sciences"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @techreport{gp-htthd-86
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"Hadwiger's Transversal Theorem in Higher Dimensions"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "Hadwiger's Transversal Theorem in Higher Dimensions"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{gp-htthd-88
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"{Hadwiger}'s transversal theorem in higher dimensions"
-, journal =	"J. Amer. Math. Soc."
-, volume =	1
-, year =	1988
-, pages =	"301--309"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "{Hadwiger}'s transversal theorem in higher dimensions"
+, journal =     "J. Amer. Math. Soc."
+, volume =      1
+, year =        1988
+, pages =       "301--309"
+, update =      "97.11 bibrelex"
 }
 
 @article{gp-httpa-82
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"Helly-type theorems for pseudoline arrangements in {$P^{2}$}"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	32
-, year =	1982
-, pages =	"1--19"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "Helly-type theorems for pseudoline arrangements in {$P^{2}$}"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      32
+, year =        1982
+, pages =       "1--19"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gp-mpc-85
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"Modelling planar configurations"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"121--124"
-, cites =	"ag-nssfs-86, bp-ddnpp-79, c-sutds-82, c-ddnpp-83, eos-calha-83, ew-nlsfs-85, gp-ccncp-82, gp-httpa-82, gp-nkssn-84, gp-ms-83, gp-ubcpr-86, g-as-72, s-nrdec-84, u-2nnpd-82, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "Modelling planar configurations"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "121--124"
+, cites =       "ag-nssfs-86, bp-ddnpp-79, c-sutds-82, c-ddnpp-83, eos-calha-83, ew-nlsfs-85, gp-ccncp-82, gp-httpa-82, gp-nkssn-84, gp-ms-83, gp-ubcpr-86, g-as-72, s-nrdec-84, u-2nnpd-82, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{gp-ms-83
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"Multidimensional sorting"
-, journal =	"SIAM J. Comput."
-, volume =	12
-, number =	3
-, month =	aug
-, year =	1983
-, pages =	"484--507"
-, update =	"98.11 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "Multidimensional sorting"
+, journal =     "SIAM J. Comput."
+, volume =      12
+, number =      3
+, month =       aug
+, year =        1983
+, pages =       "484--507"
+, update =      "98.11 bibrelex"
 }
 
 @article{gp-ccncp-80
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"On the combinatorial classification of nondegenerate configurations in the plane"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	29
-, year =	1980
-, pages =	"220--235"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "On the combinatorial classification of nondegenerate configurations in the plane"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      29
+, year =        1980
+, pages =       "220--235"
+, update =      "97.11 bibrelex"
 }
 
 @article{gp-ccncp-82
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"On the combinatorial classification of nondegenerate configurations in the plane"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	29
-, year =	1982
-, pages =	"63--74"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "On the combinatorial classification of nondegenerate configurations in the plane"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      29
+, year =        1982
+, pages =       "63--74"
+, update =      "97.11 bibrelex"
 }
 
 @article{gp-nkssn-84
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"On the number of $k$-subsets of a set of $n$ points in the plane"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	36
-, year =	1984
-, pages =	"101--104"
-, update =	"94.09 bernal"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "On the number of $k$-subsets of a set of $n$ points in the plane"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      36
+, year =        1984
+, pages =       "101--104"
+, update =      "94.09 bernal"
 }
 
 @article{gp-prpa-85
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"Polynomial realization of pseudoline arrangements"
-, journal =	"Commun. Pure Appl. Math."
-, volume =	38
-, year =	1985
-, pages =	"725--732"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "Polynomial realization of pseudoline arrangements"
+, journal =     "Commun. Pure Appl. Math."
+, volume =      38
+, year =        1985
+, pages =       "725--732"
+, update =      "97.11 bibrelex"
 }
 
 @article{gp-pgcsc-80
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"Proof of {Gr{\"u}nbaum}'s conjecture on the stretchability of certain arrangements of pseudolines"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	29
-, year =	1980
-, pages =	"385--390"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "Proof of {Gr{\"u}nbaum}'s conjecture on the stretchability of certain arrangements of pseudolines"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      29
+, year =        1980
+, pages =       "385--390"
+, update =      "97.11 bibrelex"
 }
 
 @article{gp-sccca-84
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"Semispaces of Configurations, Cell Complexes of Arrangements"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	37
-, year =	1984
-, pages =	"257--293"
-, update =	"96.05 orourke"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "Semispaces of Configurations, Cell Complexes of Arrangements"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      37
+, year =        1984
+, pages =       "257--293"
+, update =      "96.05 orourke"
 }
 
 @article{gp-taafp-86
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"There are asymptotically fewer polytopes than we thought"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	14
-, year =	1986
-, pages =	"127--129"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "There are asymptotically fewer polytopes than we thought"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      14
+, year =        1986
+, pages =       "127--129"
+, update =      "97.11 bibrelex"
 }
 
 @article{gp-tpdnd-81
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"Three points do not determine a (pseudo-) plane"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	31
-, year =	1981
-, pages =	"215--218"
-, update =	"01.07 wenger, 98.03 bibrelex"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "Three points do not determine a (pseudo-) plane"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      31
+, year =        1981
+, pages =       "215--218"
+, update =      "01.07 wenger, 98.03 bibrelex"
 }
 
 @article{gp-ubcpr-86
-, author =	"J. E. Goodman and R. Pollack"
-, title =	"Upper bounds for configurations and polytopes in {$\Re^d$}"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"219--227"
+, author =      "J. E. Goodman and R. Pollack"
+, title =       "Upper bounds for configurations and polytopes in {$\Re^d$}"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "219--227"
 }
 
 @book{gps-dcgpdsy-91
-, title =	"Discrete and Computational Geometry: Papers from the Dimacs Special Year"
-, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
-, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
-, publisher =	"American Mathematical Society, Association for Computing Machinery"
-, year =	1991
-, update =	"99.11 bibrelex, 96.05 pocchiola"
+, title =       "Discrete and Computational Geometry: Papers from the Dimacs Special Year"
+, editor =      "J. E. Goodman and R. Pollack and W. Steiger"
+, series =      "DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
+, publisher =   "American Mathematical Society, Association for Computing Machinery"
+, year =        1991
+, update =      "99.11 bibrelex, 96.05 pocchiola"
 }
 
 @inproceedings{gps-crotr-89
-, author =	"J. E. Goodman and R. Pollack and B. Sturmfels"
-, title =	"Coordinate representation of order types requires exponential storage"
-, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
-, year =	1989
-, pages =	"405--410"
-, precedes =	"gps-iscir-90"
+, author =      "J. E. Goodman and R. Pollack and B. Sturmfels"
+, title =       "Coordinate representation of order types requires exponential storage"
+, booktitle =   "Proc. 21st Annu. ACM Sympos. Theory Comput."
+, year =        1989
+, pages =       "405--410"
+, precedes =    "gps-iscir-90"
 }
 
 @article{gps-iscir-90
-, author =	"J. E. Goodman and R. Pollack and B. Sturmfels"
-, title =	"The intrinsic spread of a configuration in {$\Re^d$}"
-, journal =	"J. Amer. Math. Soc."
-, volume =	3
-, year =	1990
-, pages =	"639--651"
-, succeeds =	"gps-crotr-89"
-, update =	"97.03 rote"
+, author =      "J. E. Goodman and R. Pollack and B. Sturmfels"
+, title =       "The intrinsic spread of a configuration in {$\Re^d$}"
+, journal =     "J. Amer. Math. Soc."
+, volume =      3
+, year =        1990
+, pages =       "639--651"
+, succeeds =    "gps-crotr-89"
+, update =      "97.03 rote"
 }
 
 @inproceedings{gpw-bngpi-94
-, author =	"J. E. Goodman and R. Pollack and R. Wenger"
-, title =	"Bounding the Number of Geometric Permutations Induced by $k$-Transversals"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"192--197"
-, cites =	"bpr-ncdfp-95, bcr-gar-87, cgppsw-ccht-90, es-mnwsn-90, gp-ubcpr-86, gpw-gtt-93, kll-dwsdc-92, l-it-49, w-ubgpc-90, ZZZ"
-, update =	"98.03 bibrelex, 95.09 wenger, 94.09 jones, 94.01 jones"
+, author =      "J. E. Goodman and R. Pollack and R. Wenger"
+, title =       "Bounding the Number of Geometric Permutations Induced by $k$-Transversals"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "192--197"
+, cites =       "bpr-ncdfp-95, bcr-gar-87, cgppsw-ccht-90, es-mnwsn-90, gp-ubcpr-86, gpw-gtt-93, kll-dwsdc-92, l-it-49, w-ubgpc-90, ZZZ"
+, update =      "98.03 bibrelex, 95.09 wenger, 94.09 jones, 94.01 jones"
 }
 
 @article{gpw-bngpi-96
-, author =	"Jacob E. Goodman and Richard Pollack and Rephael Wenger"
-, title =	"Bounding the Number of Geometric Permutations Induced by $k$-Transversals"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	75
-, year =	1996
-, pages =	"187--197"
-, update =	"01.07 wenger"
+, author =      "Jacob E. Goodman and Richard Pollack and Rephael Wenger"
+, title =       "Bounding the Number of Geometric Permutations Induced by $k$-Transversals"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      75
+, year =        1996
+, pages =       "187--197"
+, update =      "01.07 wenger"
 }
 
 @techreport{gpw-gtt-91
-, author =	"J. E. Goodman and R. Pollack and R. Wenger"
-, title =	"Geometric Transversal Theory"
-, type =	"Technical {Report}"
-, number =	"91-76"
-, institution =	"DIMACS, Rutgers Univ."
-, year =	1991
-, precedes =	"gpw-gtt-93"
-, update =	"95.09 wenger, 93.09 milone+mitchell"
+, author =      "J. E. Goodman and R. Pollack and R. Wenger"
+, title =       "Geometric Transversal Theory"
+, type =        "Technical {Report}"
+, number =      "91-76"
+, institution = "DIMACS, Rutgers Univ."
+, year =        1991
+, precedes =    "gpw-gtt-93"
+, update =      "95.09 wenger, 93.09 milone+mitchell"
 }
 
 @incollection{gpw-gtt-93
-, author =	"J. E. Goodman and R. Pollack and R. Wenger"
-, title =	"Geometric Transversal Theory"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg, Germany"
-, year =	1993
-, pages =	"163--198"
-, keywords =	"survey paper, transversal, Helly's theorem, Hadwiger's theorem, combinatorial complexity, Davenport-Schinzel sequences"
-, succeeds =	"gpw-gtt-91"
-, update =	"95.09 wenger, 93.09 erickson"
+, author =      "J. E. Goodman and R. Pollack and R. Wenger"
+, title =       "Geometric Transversal Theory"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg, Germany"
+, year =        1993
+, pages =       "163--198"
+, keywords =    "survey paper, transversal, Helly's theorem, Hadwiger's theorem, combinatorial complexity, Davenport-Schinzel sequences"
+, succeeds =    "gpw-gtt-91"
+, update =      "95.09 wenger, 93.09 erickson"
 }
 
 @article{gpw-occsl-95
-, author =	"J. E. Goodman and R. Pollack and R. Wenger"
-, title =	"On the Connected Components of the Space of Line Transversals to a Family of Convex Sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	13
-, year =	1995
-, pages =	"469--476"
-, update =	"95.09 wenger"
+, author =      "J. E. Goodman and R. Pollack and R. Wenger"
+, title =       "On the Connected Components of the Space of Line Transversals to a Family of Convex Sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      13
+, year =        1995
+, pages =       "469--476"
+, update =      "95.09 wenger"
 }
 
 @article{gpwz-atp-94
-, author =	"J. E. Goodman and R. Pollack and R. Wenger and T. Zamfirescu"
-, title =	"Arrangements and Topological Planes"
-, journal =	"Amer. Math. Monthly"
-, volume =	101
-, number =	10
-, year =	1994
-, pages =	"866--878"
-, update =	"95.09 agarwal, 93.09 erickson"
+, author =      "J. E. Goodman and R. Pollack and R. Wenger and T. Zamfirescu"
+, title =       "Arrangements and Topological Planes"
+, journal =     "Amer. Math. Monthly"
+, volume =      101
+, number =      10
+, year =        1994
+, pages =       "866--878"
+, update =      "95.09 agarwal, 93.09 erickson"
 }
 
 @inproceedings{gpwz-eaes-91
-, author =	"J. E. Goodman and R. Pollack and R. Wenger and T. Zamfirescu"
-, title =	"Every arrangement extends to a spread"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"191--194"
-, cites =	"g-as-72, s-cm-51, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "J. E. Goodman and R. Pollack and R. Wenger and T. Zamfirescu"
+, title =       "Every arrangement extends to a spread"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "191--194"
+, cites =       "g-as-72, s-cm-51, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{gpwz-tiutp-92
-, author =	"J. E. Goodman and R. Pollack and R. Wenger and T. Zamfirescu"
-, title =	"There is a universal topological plane"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"171--176"
-, cites =	"eg-tsa-89, gp-pgcsc-80, gpwz-eaes-91, g-as-72, h-m-35, h-fggdg-71, l-dtdpe-26, sh-sac-91, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Goodman and R. Pollack and R. Wenger and T. Zamfirescu"
+, title =       "There is a universal topological plane"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "171--176"
+, cites =       "eg-tsa-89, gp-pgcsc-80, gpwz-eaes-91, g-as-72, h-m-35, h-fggdg-71, l-dtdpe-26, sh-sac-91, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @book{g-ifo-68
-, author =	"J. W. Goodman"
-, title =	"Introduction to {Fourier} optics"
-, publisher =	"McGraw-Hill"
-, address =	"New York, NY"
-, year =	1968
-, update =	"97.11 bibrelex"
+, author =      "J. W. Goodman"
+, title =       "Introduction to {Fourier} optics"
+, publisher =   "McGraw-Hill"
+, address =     "New York, NY"
+, year =        1968
+, update =      "97.11 bibrelex"
 }
 
 @article{gr-ssaip-88
-, author =	"S. D. Goodman and W. T. Rhodes"
-, title =	"Symbolic substituiton applications to image processing"
-, journal =	"Applied Optics"
-, volume =	27
-, year =	1988
-, pages =	"1708--1714"
-, update =	"98.07 bibrelex"
+, author =      "S. D. Goodman and W. T. Rhodes"
+, title =       "Symbolic substituiton applications to image processing"
+, journal =     "Applied Optics"
+, volume =      27
+, year =        1988
+, pages =       "1708--1714"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{gght-srlse-97
-, author =	"M. Goodrich and L. J. Guibas and J. Hershberger and P. Tanenbaum"
-, title =	"Snap Rounding Line Segments Efficiently in Two and Three Dimensions"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"284--293"
-, cites =	"am-rsss-94, abdpy-enmcs-95, bo-arcgi-79, b-carcg-81, c-rga-92, cms-frric-93, em-sstcd-90, f-nsa2d-95, fm-nsala-91, gy-frcg-86, gm-rad-95, gks-ricdv-92, gss-egbra-89, gs-pmgsc-85, h-psifp-93, hhk-tirgc-88, lpt-rpqiv-96, ms-temsi-92, m-dpggt-89, m-fppap-88, s-barga-93, si-gafpa-88, si-tdpga-89"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "M. Goodrich and L. J. Guibas and J. Hershberger and P. Tanenbaum"
+, title =       "Snap Rounding Line Segments Efficiently in Two and Three Dimensions"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "284--293"
+, cites =       "am-rsss-94, abdpy-enmcs-95, bo-arcgi-79, b-carcg-81, c-rga-92, cms-frric-93, em-sstcd-90, f-nsa2d-95, fm-nsala-91, gy-frcg-86, gm-rad-95, gks-ricdv-92, gss-egbra-89, gs-pmgsc-85, h-psifp-93, hhk-tirgc-88, lpt-rpqiv-96, ms-temsi-92, m-dpggt-89, m-fppap-88, s-barga-93, si-gafpa-88, si-tdpga-89"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @book{gks-cg-99
-, title =	"Computational Geometry"
-, editor =	"Michael Goodrich and Rolf Klein and Raimund Seidel"
-, series =	"Dagstuhl-Seminar-Report"
-, volume =	233
-, publisher =	"Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
-, address =	"Schloss Dagstuhl, Germany"
-, year =	1999
-, url =	"ftp://ftp.dagstuhl.de/pub/Reports/99/99102.ps.gz"
-, update =	"01.04 icking"
+, title =       "Computational Geometry"
+, editor =      "Michael Goodrich and Rolf Klein and Raimund Seidel"
+, series =      "Dagstuhl-Seminar-Report"
+, volume =      233
+, publisher =   "Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
+, address =     "Schloss Dagstuhl, Germany"
+, year =        1999
+, url = "ftp://ftp.dagstuhl.de/pub/Reports/99/99102.ps.gz"
+, update =      "01.04 icking"
 }
 
 @inproceedings{gt-dtdpl-91
-, author =	"M. Goodrich and R. Tamassia"
-, title =	"Dynamic trees and dynamic point location"
-, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
-, year =	1991
-, pages =	"523--533"
-, keywords =	"point location, on-line"
+, author =      "M. Goodrich and R. Tamassia"
+, title =       "Dynamic trees and dynamic point location"
+, booktitle =   "Proc. 23rd Annu. ACM Sympos. Theory Comput."
+, year =        1991
+, pages =       "523--533"
+, keywords =    "point location, on-line"
 }
 
 @article{agk-paess-94
-, author =	"M. J. Atallah Michael T. Goodrich and S .R. Kosaraju"
-, title =	"Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations"
-, journal =	"J. ACM"
-, volume =	41
-, number =	6
-, year =	1994
-, pages =	"1049--1088"
-, update =	"97.03 tamassia"
+, author =      "M. J. Atallah Michael T. Goodrich and S .R. Kosaraju"
+, title =       "Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations"
+, journal =     "J. ACM"
+, volume =      41
+, number =      6
+, year =        1994
+, pages =       "1049--1088"
+, update =      "97.03 tamassia"
 }
 
 @article{g-pahlh-92
-, author =	"M. T. Goodrich"
-, title =	"A Polygonal Approach to Hidden-Line and Hidden-Surface Elimination"
-, journal =	"CVGIP: Graph. Models Image Process."
-, volume =	54
-, number =	1
-, year =	1992
-, pages =	"1--12"
-, update =	"94.01 goodrich"
+, author =      "M. T. Goodrich"
+, title =       "A Polygonal Approach to Hidden-Line and Hidden-Surface Elimination"
+, journal =     "CVGIP: Graph. Models Image Process."
+, volume =      54
+, number =      1
+, year =        1992
+, pages =       "1--12"
+, update =      "94.01 goodrich"
 }
 
 @techreport{g-pahle-87
-, author =	"M. T. Goodrich"
-, title =	"A polygonal approach to hidden-line elimination"
-, type =	"Report"
-, number =	"TR 87-18"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1987
+, author =      "M. T. Goodrich"
+, title =       "A polygonal approach to hidden-line elimination"
+, type =        "Report"
+, number =      "TR 87-18"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1987
 }
 
 @inproceedings{g-pahle-87i
-, author =	"M. T. Goodrich"
-, title =	"A polygonal approach to hidden line elimination"
-, booktitle =	"Proc. 25th Allerton Conf. Commun. Control Comput."
-, year =	1987
-, pages =	"849--858"
-, update =	"97.11 bibrelex"
+, author =      "M. T. Goodrich"
+, title =       "A polygonal approach to hidden line elimination"
+, booktitle =   "Proc. 25th Allerton Conf. Commun. Control Comput."
+, year =        1987
+, pages =       "849--858"
+, update =      "97.11 bibrelex"
 }
 
 @article{g-airsm-98
-, author =	"M. T. Goodrich"
-, title =	"An improved ray shooting method for constructive solid geometry models via tree contraction"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1998
-, pages =	"1--24"
-, update =	"98.11 devillers, 97.03 tamassia"
+, author =      "M. T. Goodrich"
+, title =       "An improved ray shooting method for constructive solid geometry models via tree contraction"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1998
+, pages =       "1--24"
+, update =      "98.11 devillers, 97.03 tamassia"
 }
 
 @techreport{g-opaan-85
-, author =	"M. T. Goodrich"
-, title =	"An Optimal Parallel Algorithm for the All Nearest-neighbor Problem for a Convex Polygon"
-, number =	"CSD-TR-533"
-, institution =	"Dept. Computer Science, Purdue University"
-, address =	"USA"
-, year =	1985
-, update =	"93.09 held"
+, author =      "M. T. Goodrich"
+, title =       "An Optimal Parallel Algorithm for the All Nearest-neighbor Problem for a Convex Polygon"
+, number =      "CSD-TR-533"
+, institution = "Dept. Computer Science, Purdue University"
+, address =     "USA"
+, year =        1985
+, update =      "93.09 held"
 }
 
 @inproceedings{g-apptc-90
-, author =	"M. T. Goodrich"
-, title =	"Applying parallel processing techniques to classification problems in constructive solid geometry"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"118--128"
+, author =      "M. T. Goodrich"
+, title =       "Applying parallel processing techniques to classification problems in constructive solid geometry"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "118--128"
 }
 
 @techreport{g-ceps-95
-, author =	"M. T. Goodrich"
-, title =	"Communication-Efficient Parallel Sorting"
-, type =	"Technical {Report}"
-, institution =	"Dept. of Computer Science, Johns Hopkins Univeristy"
-, year =	1995
-, update =	"96.09 orourke"
+, author =      "M. T. Goodrich"
+, title =       "Communication-Efficient Parallel Sorting"
+, type =        "Technical {Report}"
+, institution = "Dept. of Computer Science, Johns Hopkins Univeristy"
+, year =        1995
+, update =      "96.09 orourke"
 }
 
 @techreport{g-ceps-97
-, author =	"M. T. Goodrich"
-, title =	"Communication-efficient parallel sorting"
-, type =	"Research {Report}, under submission to {\it SICOMP}"
-, institution =	"Center for Geometric Computing"
-, address =	"Johns Hopkins Univ."
-, year =	1997
-, update =	"97.03 tamassia"
+, author =      "M. T. Goodrich"
+, title =       "Communication-efficient parallel sorting"
+, type =        "Research {Report}, under submission to {\it SICOMP}"
+, institution = "Center for Geometric Computing"
+, address =     "Johns Hopkins Univ."
+, year =        1997
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{g-caop-91
-, author =	"M. T. Goodrich"
-, title =	"Constructing arrangements optimally in parallel"
-, booktitle =	"Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
-, year =	1991
-, pages =	"169--179"
+, author =      "M. T. Goodrich"
+, title =       "Constructing arrangements optimally in parallel"
+, booktitle =   "Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
+, year =        1991
+, pages =       "169--179"
 }
 
 @article{g-caop-93
-, author =	"M. T. Goodrich"
-, title =	"Constructing arrangements optimally in parallel"
-, journal =	"Discrete Comput. Geom."
-, volume =	9
-, year =	1993
-, pages =	"371--385"
-, succeeds =	"g-caop-91"
-, update =	"94.01 goodrich"
+, author =      "M. T. Goodrich"
+, title =       "Constructing arrangements optimally in parallel"
+, journal =     "Discrete Comput. Geom."
+, volume =      9
+, year =        1993
+, pages =       "371--385"
+, succeeds =    "g-caop-91"
+, update =      "94.01 goodrich"
 }
 
 @techreport{g-cchps-91
-, author =	"M. T. Goodrich"
-, title =	"Constructing the convex hull of a partially sorted set of points"
-, type =	"Technical {Report}"
-, number =	"91-10"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1991
+, author =      "M. T. Goodrich"
+, title =       "Constructing the convex hull of a partially sorted set of points"
+, type =        "Technical {Report}"
+, number =      "91-10"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1991
 }
 
 @article{g-cchps-93
-, author =	"M. T. Goodrich"
-, title =	"Constructing the Convex Hull of a Partially Sorted Set of Points"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	5
-, month =	mar
-, year =	1993
-, pages =	"267--278"
-, update =	"93.09 held"
+, author =      "M. T. Goodrich"
+, title =       "Constructing the Convex Hull of a Partially Sorted Set of Points"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      5
+, month =       mar
+, year =        1993
+, pages =       "267--278"
+, update =      "93.09 held"
 }
 
 @phdthesis{g-eptcg-87
-, author =	"M. T. Goodrich"
-, title =	"Efficient parallel techniques for computational geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1987
-, keywords =	"parallel computation, convex hull, triangulation, domination, visibility, diameter, proximity, intersection, fractional cascading, doctoral thesis"
+, author =      "M. T. Goodrich"
+, title =       "Efficient parallel techniques for computational geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1987
+, keywords =    "parallel computation, convex hull, triangulation, domination, visibility, diameter, proximity, intersection, fractional cascading, doctoral thesis"
 }
 
 @inproceedings{g-eplfa-94
-, author =	"M. T. Goodrich"
-, title =	"Efficient Piecewise-Linear Function Approximation Using the Uniform Metric"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"322--331"
-, cites =	"aaakss-cefns-91, aass-sdp-90, am-rsps-92, ast-apsgo-92, abosy-fmcnp-85, ams-olpqs-92, a-gvdps-89, br-cfssl-69, br-matmm-86, cegghss-rspug-91, cegs-dwclp-92, c-lpot-86, c-sdsno-87, c-pms-88, csss-otass-89, cb-enaaa-80, clr-ia-90, d-ia-63, d-csfs-93, d-ltatt-84, e-acg-87, eg-paspp-88, g-cvpcs-91, gm-paaml-92, gt-drssp-93, gh-ospqs-87, gh-ospqs-89, ghlst-ltavs-87, ghms-apsml-91, hs-fpfsp-91, h-ndssp-91, hs-cmlpg-91, ii-cgmpa-86, ii-oaapl-86a, ii-pacfa-88, j-adsfk-78, k-ealdp-89, lp-esppr-84, lpsssstwy-clcsp-88, msw-sblp-92, m-apcad-83, m-ltalp-83, m-lpltw-84, mo-pca-88, m-aaspt-88, mmp-dgp-87, mpa-csklp-92, mrw-mlpop-90, ms-saps-92, o-agta-87, ps-cgi-85, rt-laso-92, s-sdlpc-91, s-ltaml-86, s-mlppr-87, s-cgfns-89, t-capcp-85, whcl-psapa-93, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "M. T. Goodrich"
+, title =       "Efficient Piecewise-Linear Function Approximation Using the Uniform Metric"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "322--331"
+, cites =       "aaakss-cefns-91, aass-sdp-90, am-rsps-92, ast-apsgo-92, abosy-fmcnp-85, ams-olpqs-92, a-gvdps-89, br-cfssl-69, br-matmm-86, cegghss-rspug-91, cegs-dwclp-92, c-lpot-86, c-sdsno-87, c-pms-88, csss-otass-89, cb-enaaa-80, clr-ia-90, d-ia-63, d-csfs-93, d-ltatt-84, e-acg-87, eg-paspp-88, g-cvpcs-91, gm-paaml-92, gt-drssp-93, gh-ospqs-87, gh-ospqs-89, ghlst-ltavs-87, ghms-apsml-91, hs-fpfsp-91, h-ndssp-91, hs-cmlpg-91, ii-cgmpa-86, ii-oaapl-86a, ii-pacfa-88, j-adsfk-78, k-ealdp-89, lp-esppr-84, lpsssstwy-clcsp-88, msw-sblp-92, m-apcad-83, m-ltalp-83, m-lpltw-84, mo-pca-88, m-aaspt-88, mmp-dgp-87, mpa-csklp-92, mrw-mlpop-90, ms-saps-92, o-agta-87, ps-cgi-85, rt-laso-92, s-sdlpc-91, s-ltaml-86, s-mlppr-87, s-cgfns-89, t-capcp-85, whcl-psapa-93, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @article{g-eplfa-95
-, author =	"M. T. Goodrich"
-, title =	"Efficient Piecewise-Linear Function Approximation Using the Uniform Metric"
-, journal =	"Discrete Comput. Geom."
-, volume =	14
-, year =	1995
-, pages =	"445--462"
-, succeeds =	"g-eplfa-94"
-, update =	"96.01 smid"
+, author =      "M. T. Goodrich"
+, title =       "Efficient Piecewise-Linear Function Approximation Using the Uniform Metric"
+, journal =     "Discrete Comput. Geom."
+, volume =      14
+, year =        1995
+, pages =       "445--462"
+, succeeds =    "g-eplfa-94"
+, update =      "96.01 smid"
 }
 
 @article{g-fchsp-87
-, author =	"M. T. Goodrich"
-, title =	"Finding the convex hull of a sorted point set in parallel"
-, journal =	"Inform. Process. Lett."
-, volume =	26
-, year =	1987
-, pages =	"176--179"
-, keywords =	"parallel computation, convex hull, points, divide-and-conquer, two-dimensional"
+, author =      "M. T. Goodrich"
+, title =       "Finding the convex hull of a sorted point set in parallel"
+, journal =     "Inform. Process. Lett."
+, volume =      26
+, year =        1987
+, pages =       "176--179"
+, keywords =    "parallel computation, convex hull, points, divide-and-conquer, two-dimensional"
 }
 
 @inproceedings{g-fdplp-96
-, author =	"Michael T. Goodrich"
-, title =	"Fixed-dimensional parallel linear programming via relative epsilon-approximations"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"132--141"
-, keywords =	"CRCW, PRAM, derandomization, {$\epsilon$}-approximation, geometric random samples, independence"
-, update =	"97.03 smid, 96.09 agarwal, 96.01 mitchell"
+, author =      "Michael T. Goodrich"
+, title =       "Fixed-dimensional parallel linear programming via relative epsilon-approximations"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "132--141"
+, keywords =    "CRCW, PRAM, derandomization, {$\epsilon$}-approximation, geometric random samples, independence"
+, update =      "97.03 smid, 96.09 agarwal, 96.01 mitchell"
 }
 
 @inproceedings{g-gpmee-93
-, author =	"M. T. Goodrich"
-, title =	"Geometric partitioning made easier, even in parallel"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"73--82"
-, cites =	"a-gpia-91t, aass-sdp-90, ast-apsgo-92, as-pm-92, ap-p3dch-92, av-fpahc-79, brs-enasc-89, c-ochan-91, cf-dvrsi-90, cm-dosch-95, cm-ltdao-93, cegs-dwclp-92, c-maeth-52, c-racpq-88, cs-arscg-89, c-sdsno-87, c-pms-88, cg-opapp-92, csss-otass-89, csy-khrp-87, cz-opabd-90, clr-ia-90, dk-pcsh-89, dd-ekdnp-91, dc-hcpc-80, e-acg-87, g-caop-93, hr-gtcb-90, hw-ensrq-87, j-ipa-92, kr-pasmm-90, l-spami-86, l-rrpcw-88, m-cha-91, m-aogdc-91, m-ept-92, mww-deabv-91, m-apcad-83, mnn-pmydp-89, rs-oprat-92, r-tclir-90, sss-chbal-93, s-dfs-72, vc-ucrfe-71, y-ptptc-88, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
+, author =      "M. T. Goodrich"
+, title =       "Geometric partitioning made easier, even in parallel"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "73--82"
+, cites =       "a-gpia-91t, aass-sdp-90, ast-apsgo-92, as-pm-92, ap-p3dch-92, av-fpahc-79, brs-enasc-89, c-ochan-91, cf-dvrsi-90, cm-dosch-95, cm-ltdao-93, cegs-dwclp-92, c-maeth-52, c-racpq-88, cs-arscg-89, c-sdsno-87, c-pms-88, cg-opapp-92, csss-otass-89, csy-khrp-87, cz-opabd-90, clr-ia-90, dk-pcsh-89, dd-ekdnp-91, dc-hcpc-80, e-acg-87, g-caop-93, hr-gtcb-90, hw-ensrq-87, j-ipa-92, kr-pasmm-90, l-spami-86, l-rrpcw-88, m-cha-91, m-aogdc-91, m-ept-92, mww-deabv-91, m-apcad-83, mnn-pmydp-89, rs-oprat-92, r-tclir-90, sss-chbal-93, s-dfs-72, vc-ucrfe-71, y-ptptc-88, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
 }
 
 @inproceedings{g-ilspo-89
-, author =	"M. T. Goodrich"
-, title =	"Intersectin line segments in parallel with an output sensitive number of processors"
-, booktitle =	"Proc. 1st ACM Sympos. Parallel Algorithms Architect."
-, year =	1989
-, pages =	"127--137"
-, update =	"97.11 bibrelex"
+, author =      "M. T. Goodrich"
+, title =       "Intersectin line segments in parallel with an output sensitive number of processors"
+, booktitle =   "Proc. 1st ACM Sympos. Parallel Algorithms Architect."
+, year =        1989
+, pages =       "127--137"
+, update =      "97.11 bibrelex"
 }
 
 @article{g-ilspo-91
-, author =	"M. T. Goodrich"
-, title =	"Intersecting line segments in parallel with an output-sensitive number of processors"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"737--755"
+, author =      "M. T. Goodrich"
+, title =       "Intersecting line segments in parallel with an output-sensitive number of processors"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "737--755"
 }
 
 @incollection{g-pag-97
-, author =	"M. T. Goodrich"
-, title =	"Parallel algorithms in geometry"
-, chapter =	36
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"669--682"
-, update =	"97.11 orourke"
+, author =      "M. T. Goodrich"
+, title =       "Parallel algorithms in geometry"
+, chapter =     36
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "669--682"
+, update =      "97.11 orourke"
 }
 
 @inproceedings{g-psppt-92
-, author =	"M. T. Goodrich"
-, title =	"Planar separators and parallel polygon triangulation"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"507--516"
+, author =      "M. T. Goodrich"
+, title =       "Planar separators and parallel polygon triangulation"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "507--516"
 }
 
 @article{g-psppt-95
-, author =	"M. T. Goodrich"
-, title =	"Planar separators and parallel polygon triangulation"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	51
-, number =	3
-, year =	1995
-, pages =	"374--389"
-, update =	"97.11 bibrelex, 97.03 tamassia"
+, author =      "M. T. Goodrich"
+, title =       "Planar separators and parallel polygon triangulation"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      51
+, number =      3
+, year =        1995
+, pages =       "374--389"
+, update =      "97.11 bibrelex, 97.03 tamassia"
 }
 
 @inproceedings{g-rfsbt-97
-, author =	"M. T. Goodrich"
-, title =	"Randomized fully-scalable {BSP} techniques for multi-searching and convex hull construction"
-, booktitle =	"Proc. ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1997
-, pages =	"767--776"
-, update =	"97.03 tamassia"
+, author =      "M. T. Goodrich"
+, title =       "Randomized fully-scalable {BSP} techniques for multi-searching and convex hull construction"
+, booktitle =   "Proc. ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1997
+, pages =       "767--776"
+, update =      "97.03 tamassia"
 }
 
 @techreport{g-tpp-87
-, author =	"M. T. Goodrich"
-, title =	"Triangulating a polygon in parallel"
-, type =	"Report"
-, number =	"TR-679"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1987
-, precedes =	"g-tpp-89"
+, author =      "M. T. Goodrich"
+, title =       "Triangulating a polygon in parallel"
+, type =        "Report"
+, number =      "TR-679"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1987
+, precedes =    "g-tpp-89"
 }
 
 @article{g-tpp-89
-, author =	"M. T. Goodrich"
-, title =	"Triangulating a polygon in parallel"
-, journal =	"J. Algorithms"
-, volume =	10
-, year =	1989
-, pages =	"327--351"
-, keywords =	"parallel computation, triangulation, polygons, simple, divide-and-conquer, two-dimensional"
-, succeeds =	"g-tpp-87"
+, author =      "M. T. Goodrich"
+, title =       "Triangulating a polygon in parallel"
+, journal =     "J. Algorithms"
+, volume =      10
+, year =        1989
+, pages =       "327--351"
+, keywords =    "parallel computation, triangulation, polygons, simple, divide-and-conquer, two-dimensional"
+, succeeds =    "g-tpp-87"
 }
 
 @inproceedings{g-uaadp-91
-, author =	"M. T. Goodrich"
-, title =	"Using approximation algorithms to design parallel algorithms that may ignore processor allocation"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"711--722"
+, author =      "M. T. Goodrich"
+, title =       "Using approximation algorithms to design parallel algorithms that may ignore processor allocation"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "711--722"
 }
 
 @inproceedings{gao-isost-90
-, author =	"M. T. Goodrich and M. J. Atallah and M. H. Overmars"
-, title =	"An input-size/output-size trade-off in the time complexity of rectilinear hidden-surface removal"
-, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	443
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"689--702"
-, update =	"98.07 agarwal"
+, author =      "M. T. Goodrich and M. J. Atallah and M. H. Overmars"
+, title =       "An input-size/output-size trade-off in the time complexity of rectilinear hidden-surface removal"
+, booktitle =   "Proc. 17th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      443
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "689--702"
+, update =      "98.07 agarwal"
 }
 
 @techreport{gao-osmrh-90
-, author =	"M. T. Goodrich and M. J. Atallah and M. H. Overmars"
-, title =	"Output-Sensitive Methods for Rectilinear Hidden Surface Removal"
-, type =	"Technical {Report}"
-, number =	"90-13"
-, institution =	"DIMACS, Rutgers Univ."
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "M. T. Goodrich and M. J. Atallah and M. H. Overmars"
+, title =       "Output-Sensitive Methods for Rectilinear Hidden Surface Removal"
+, type =        "Technical {Report}"
+, number =      "90-13"
+, institution = "DIMACS, Rutgers Univ."
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @article{gao-osmrh-93
-, author =	"M. T. Goodrich and M. J. Atallah and M. H. Overmars"
-, title =	"Output-Sensitive Methods for Rectilinear Hidden Surface Removal"
-, journal =	"Inform. Comput."
-, volume =	107
-, year =	1993
-, pages =	"1--24"
-, update =	"94.01 smid"
+, author =      "M. T. Goodrich and M. J. Atallah and M. H. Overmars"
+, title =       "Output-Sensitive Methods for Rectilinear Hidden Surface Removal"
+, journal =     "Inform. Comput."
+, volume =      107
+, year =        1993
+, pages =       "1--24"
+, update =      "94.01 smid"
 }
 
 @inproceedings{ggb-gsmpc-90
-, author =	"M. T. Goodrich and M. Ghouse and J. Bright"
-, title =	"Generalized sweep methods for parallel computational geometry"
-, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
-, year =	1990
-, pages =	"280--289"
+, author =      "M. T. Goodrich and M. Ghouse and J. Bright"
+, title =       "Generalized sweep methods for parallel computational geometry"
+, booktitle =   "Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
+, year =        1990
+, pages =       "280--289"
 }
 
 @article{ggb-smpcg-
-, author =	"M. T. Goodrich and M. Ghouse and J. Bright"
-, title =	"Sweep Methods for Parallel Computational Geometry"
-, journal =	"Algorithmica"
-, note =	"To appear"
-, update =	"97.03 tamassia"
+, author =      "M. T. Goodrich and M. Ghouse and J. Bright"
+, title =       "Sweep Methods for Parallel Computational Geometry"
+, journal =     "Algorithmica"
+, note =        "To appear"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{ghht-apids-98
-, author =	"M. T. Goodrich and M. Handy and B. Hudson and R. Tamassia"
-, title =	"Abstracting Positional Information in Data Structures: Locators and Positions in {JDSL}"
-, booktitle =	"OOPSLA '98 Technical Notes"
-, year =	1998
-, update =	"98.11 tamassia"
+, author =      "M. T. Goodrich and M. Handy and B. Hudson and R. Tamassia"
+, title =       "Abstracting Positional Information in Data Structures: Locators and Positions in {JDSL}"
+, booktitle =   "OOPSLA '98 Technical Notes"
+, year =        1998
+, update =      "98.11 tamassia"
 }
 
 @inproceedings{ghht-aiods-99
-, author =	"M. T. Goodrich and M. Handy and B. Hudson and R. Tamassia"
-, title =	"Accessing the Internal Organization of Data Structures in the {JDSL} Library"
-, editor =	"M. T. Goodrich and C. C. McGeoch"
-, booktitle =	"Proc. Workshop on Algorithm Engineering and Experimentation"
-, nickname =	"ALENEX '99"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1619
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"124--139"
-, update =	"00.03 vismara, 99.07 vismara, 98.11 tamassia"
+, author =      "M. T. Goodrich and M. Handy and B. Hudson and R. Tamassia"
+, title =       "Accessing the Internal Organization of Data Structures in the {JDSL} Library"
+, editor =      "M. T. Goodrich and C. C. McGeoch"
+, booktitle =   "Proc. Workshop on Algorithm Engineering and Experimentation"
+, nickname =    "ALENEX '99"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1619
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "124--139"
+, update =      "00.03 vismara, 99.07 vismara, 98.11 tamassia"
 }
 
 @inproceedings{gk-sppma-89
-, author =	"M. T. Goodrich and S. R. Kosaraju"
-, title =	"Sorting on a parallel pointer machine with applications to set expression evaluation"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"190--196"
-, update =	"97.03 tamassia"
+, author =      "M. T. Goodrich and S. R. Kosaraju"
+, title =       "Sorting on a parallel pointer machine with applications to set expression evaluation"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "190--196"
+, update =      "97.03 tamassia"
 }
 
 @article{gk-sppma-
-, author =	"M. T. Goodrich and S. R. Kosaraju"
-, title =	"Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation"
-, journal =	"J. ACM"
-, volume =	"??"
-, year =	"to appear"
-, pages =	""
-, update =	"96.09 orourke"
+, author =      "M. T. Goodrich and S. R. Kosaraju"
+, title =       "Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation"
+, journal =     "J. ACM"
+, volume =      "??"
+, year =        "to appear"
+, pages =       ""
+, update =      "96.09 orourke"
 }
 
 @inproceedings{gmv-appci-93
-, author =	"Michael T. Goodrich and Yossi Matias and Uzi Vishkin"
-, title =	"Approximate Parallel Prefix Computation and Its Applications"
-, booktitle =	"??"
-, publisher =	"IEEE Computer Society"
-, year =	1993
-, pages =	"318--325"
-, update =	"94.01 jones, 93.09 milone+mitchell"
+, author =      "Michael T. Goodrich and Yossi Matias and Uzi Vishkin"
+, title =       "Approximate Parallel Prefix Computation and Its Applications"
+, booktitle =   "??"
+, publisher =   "IEEE Computer Society"
+, year =        1993
+, pages =       "318--325"
+, update =      "94.01 jones, 93.09 milone+mitchell"
 }
 
 @inproceedings{gmv-opaps-94
-, author =	"M. T. Goodrich and Y. Matias and U. Vishkin"
-, title =	"Optimal Parallel Approximation for Prefix Sums and Integer Sorting"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"241--250"
-, update =	"96.09 orourke"
+, author =      "M. T. Goodrich and Y. Matias and U. Vishkin"
+, title =       "Optimal Parallel Approximation for Prefix Sums and Integer Sorting"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "241--250"
+, update =      "96.09 orourke"
 }
 
 @techreport{gmos-dtcfd-95
-, author =	"M. T. Goodrich and V. Mirelli and M. Orletsky and J. Salowe"
-, title =	"Decision tree construction in fixed dimensions: being global is hard but local greed is good"
-, type =	"Technical {Report}"
-, institution =	"Dept. Computer Sci., Johns Hopkins Univ."
-, year =	1995
-, update =	"95.05 agarwal"
+, author =      "M. T. Goodrich and V. Mirelli and M. Orletsky and J. Salowe"
+, title =       "Decision tree construction in fixed dimensions: being global is hard but local greed is good"
+, type =        "Technical {Report}"
+, institution = "Dept. Computer Sci., Johns Hopkins Univ."
+, year =        1995
+, update =      "95.05 agarwal"
 }
 
 @article{gmo-pmagp-??
-, author =	"M. T. Goodrich and Joseph S. B. Mitchell and M. W. Orletsky"
-, title =	"Practical Methods for Approximate Geometric Pattern Matching under Rigid Motion"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"??"
-, number =	"??"
-, year =	"??"
-, pages =	"to appear"
-, succeeds =	"gmo-pmagp-94"
-, update =	"98.03 mitchell"
+, author =      "M. T. Goodrich and Joseph S. B. Mitchell and M. W. Orletsky"
+, title =       "Practical Methods for Approximate Geometric Pattern Matching under Rigid Motion"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "??"
+, number =      "??"
+, year =        "??"
+, pages =       "to appear"
+, succeeds =    "gmo-pmagp-94"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{gmo-pmagp-94
-, author =	"M. T. Goodrich and Joseph S. B. Mitchell and M. W. Orletsky"
-, title =	"Practical Methods for Approximate Geometric Pattern Matching under Rigid Motion"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"103--112"
-, precedes =	"gmo-pmagp-??"
-, cites =	"aass-sdp-90, abb-amps-91, amww-cssgo-88, akmsw-mppdn-92, amnsw-oaann-94, cghkkk-gpmem-93, ck-igpmp-92, c-sdsno-84, c-pms-88, csss-otass-89, clr-ia-90, e-acg-87, fd-ficg-82, gj-cigtn-79, gt-dtdpl-91, h-gaaps-93, hs-adaps-92, hk-cmhdp-90, hkk-dvdmh-92i, hks-uevsi-91, isi-mgftc-89, m-apcad-83, m-mdscg-84, ps-cgi-85, r-cmhdb-91, r-lbchd-93, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
+, author =      "M. T. Goodrich and Joseph S. B. Mitchell and M. W. Orletsky"
+, title =       "Practical Methods for Approximate Geometric Pattern Matching under Rigid Motion"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "103--112"
+, precedes =    "gmo-pmagp-??"
+, cites =       "aass-sdp-90, abb-amps-91, amww-cssgo-88, akmsw-mppdn-92, amnsw-oaann-94, cghkkk-gpmem-93, ck-igpmp-92, c-sdsno-84, c-pms-88, csss-otass-89, clr-ia-90, e-acg-87, fd-ficg-82, gj-cigtn-79, gt-dtdpl-91, h-gaaps-93, hs-adaps-92, hk-cmhdp-90, hkk-dvdmh-92i, hks-uevsi-91, isi-mgftc-89, m-apcad-83, m-mdscg-84, ps-cgi-85, r-cmhdb-91, r-lbchd-93, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
 }
 
 @inproceedings{goy-cvdsl-89
-, author =	"M. T. Goodrich and C. {\'O}'D{\'u}nlaing and C. Yap"
-, title =	"Constructing the {Voronoi} diagram of a set of line segments in parallel"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"12--23"
+, author =      "M. T. Goodrich and C. {\'O}'D{\'u}nlaing and C. Yap"
+, title =       "Constructing the {Voronoi} diagram of a set of line segments in parallel"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "12--23"
 }
 
 @article{goy-cvdsl-93
-, author =	"M. T. Goodrich and C. {\'O}'D{\'u}nlaing and C. Yap"
-, title =	"Constructing the {Voronoi} Diagram of a Set of Line Segments in Parallel"
-, journal =	"Algorithmica"
-, volume =	9
-, year =	1993
-, pages =	"128--141"
-, succeeds =	"goy-cvdsl-89"
-, update =	"97.11 bibrelex, 94.01 goodrich"
+, author =      "M. T. Goodrich and C. {\'O}'D{\'u}nlaing and C. Yap"
+, title =       "Constructing the {Voronoi} Diagram of a Set of Line Segments in Parallel"
+, journal =     "Algorithmica"
+, volume =      9
+, year =        1993
+, pages =       "128--141"
+, succeeds =    "goy-cvdsl-89"
+, update =      "97.11 bibrelex, 94.01 goodrich"
 }
 
 @techreport{goy-fpavd-85
-, author =	"M. T. Goodrich and C. {\'O}'Dunlaing and C. K. Yap"
-, title =	"Fast Parallel Algorithms for {Voronoi} Diagrams"
-, number =	"CSD-TR-538"
-, institution =	"Dept. Computer Science, Purdue University"
-, address =	"USA"
-, year =	1985
-, update =	"00.03 bibrelex, 93.09 held"
+, author =      "M. T. Goodrich and C. {\'O}'Dunlaing and C. K. Yap"
+, title =       "Fast Parallel Algorithms for {Voronoi} Diagrams"
+, number =      "CSD-TR-538"
+, institution = "Dept. Computer Science, Purdue University"
+, address =     "USA"
+, year =        1985
+, update =      "00.03 bibrelex, 93.09 held"
 }
 
 @inproceedings{gor-mafqt-97
-, author =	"M. T. Goodrich and M. Orletsky and K. Ramaiyer"
-, title =	"Methods for Achieving Fast Query Times in Point Location Data Structures"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1997
-, pages =	"757--766"
-, update =	"97.03 held+tamassia"
+, author =      "M. T. Goodrich and M. Orletsky and K. Ramaiyer"
+, title =       "Methods for Achieving Fast Query Times in Point Location Data Structures"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1997
+, pages =       "757--766"
+, update =      "97.03 held+tamassia"
 }
 
 @incollection{gr-gds-00
-, author =	"Michael T. Goodrich and Kumar Ramaiyer"
-, title =	"Geometric Data Structures"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"463--489"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 tamassia, 98.07 mitchell"
-, annote =	"Chapter 10 of su-hcg-00"
+, author =      "Michael T. Goodrich and Kumar Ramaiyer"
+, title =       "Geometric Data Structures"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "463--489"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.11 tamassia, 98.07 mitchell"
+, annote =      "Chapter 10 of su-hcg-00"
 }
 
 @article{gr-bidgp-97
-, author =	"M. T. Goodrich and E. A. Ramos"
-, title =	"Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming"
-, journal =	"Discrete Comput. Geom."
-, volume =	18
-, year =	1997
-, pages =	"397--420"
-, update =	"98.07 agarwal, 97.03 tamassia"
+, author =      "M. T. Goodrich and E. A. Ramos"
+, title =       "Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming"
+, journal =     "Discrete Comput. Geom."
+, volume =      18
+, year =        1997
+, pages =       "397--420"
+, update =      "98.07 agarwal, 97.03 tamassia"
 }
 
 @article{gsg-apmvs-93
-, author =	"M. T. Goodrich and S. Shauck and S. Guha"
-, title =	"Addendum to ``Parallel methods for visibility and shortest path problems in simple polygons''"
-, journal =	"Algorithmica"
-, volume =	9
-, year =	1993
-, pages =	"515--516"
-, succeeds =	"gsg-pmvsp-90"
-, update =	"94.01 goodrich"
+, author =      "M. T. Goodrich and S. Shauck and S. Guha"
+, title =       "Addendum to ``Parallel methods for visibility and shortest path problems in simple polygons''"
+, journal =     "Algorithmica"
+, volume =      9
+, year =        1993
+, pages =       "515--516"
+, succeeds =    "gsg-pmvsp-90"
+, update =      "94.01 goodrich"
 }
 
 @article{gsg-pmvsp-92
-, author =	"M. T. Goodrich and S. Shauck and S. Guha"
-, title =	"Parallel methods for visibility and shortest path problems in simple polygons"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"461--486"
-, succeeds =	"gsg-pmvsp-90"
-, update =	"94.01 goodrich"
+, author =      "M. T. Goodrich and S. Shauck and S. Guha"
+, title =       "Parallel methods for visibility and shortest path problems in simple polygons"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "461--486"
+, succeeds =    "gsg-pmvsp-90"
+, update =      "94.01 goodrich"
 }
 
 @techreport{gsg-pmvsp-89
-, author =	"M. T. Goodrich and S. B. Shauck and S. Guha"
-, title =	"Parallel methods for visibility and shortest path problems in simple polygons"
-, type =	"Technical {Report}"
-, institution =	"Dept. Comput. Sci., Johns Hopkins University"
-, address =	"Baltimore, MD"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "M. T. Goodrich and S. B. Shauck and S. Guha"
+, title =       "Parallel methods for visibility and shortest path problems in simple polygons"
+, type =        "Technical {Report}"
+, institution = "Dept. Comput. Sci., Johns Hopkins University"
+, address =     "Baltimore, MD"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gsg-pmvsp-90
-, author =	"M. T. Goodrich and S. B. Shauck and S. Guha"
-, title =	"Parallel methods for visibility and shortest path problems in simple polygons"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"73--82"
-, cites =	"ap-psmma-89, am-dplr-88, ac-opavs-89, acg-cdctd-89, at-oadvp-81, bn-absop-89, c-tpca-82, c-iies-84, c-ept-90, cg-fc1ds-86, cg-vippg-88, e-acg-87, emprww-sls-82, ea-lacvp-81, eg-paspp-88, gjpt-tsp-78, g-tpp-89, g-ilspo-89, gh-ospqs-89, ghlst-ltavs-86, grs-kfcg-83, h-ovgat-89, krs-ppp-85, lf-ppc-80, lp-esppr-84, mp-fitcp-78, ol-mcp-81, ps-cgi-85, r-plsir-89, s-opg-87, s-cgfns-89, tv-opatc-89, tv-otats-86, y-ptptc-87, ZZZ"
-, update =	"01.04 icking, 97.11 bibrelex"
+, author =      "M. T. Goodrich and S. B. Shauck and S. Guha"
+, title =       "Parallel methods for visibility and shortest path problems in simple polygons"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "73--82"
+, cites =       "ap-psmma-89, am-dplr-88, ac-opavs-89, acg-cdctd-89, at-oadvp-81, bn-absop-89, c-tpca-82, c-iies-84, c-ept-90, cg-fc1ds-86, cg-vippg-88, e-acg-87, emprww-sls-82, ea-lacvp-81, eg-paspp-88, gjpt-tsp-78, g-tpp-89, g-ilspo-89, gh-ospqs-89, ghlst-ltavs-86, grs-kfcg-83, h-ovgat-89, krs-ppp-85, lf-ppc-80, lp-esppr-84, mp-fitcp-78, ol-mcp-81, ps-cgi-85, r-plsir-89, s-opg-87, s-cgfns-89, tv-opatc-89, tv-otats-86, y-ptptc-87, ZZZ"
+, update =      "01.04 icking, 97.11 bibrelex"
 }
 
 @article{gs-spscp-90
-, author =	"M. T. Goodrich and J. Snoeyink"
-, title =	"Stabbing parallel segments with a convex polygon"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	49
-, year =	1990
-, pages =	"152--170"
-, succeeds =	"gs-spscp-89"
+, author =      "M. T. Goodrich and J. Snoeyink"
+, title =       "Stabbing parallel segments with a convex polygon"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      49
+, year =        1990
+, pages =       "152--170"
+, succeeds =    "gs-spscp-89"
 }
 
 @techreport{gs-svscp-87
-, author =	"M. T. Goodrich and J. Snoeyink"
-, title =	"Stabbing vertical segments with a convex polygon"
-, type =	"Report"
-, number =	"JHU 87-19"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1987
-, precedes =	"gs-spscp-89"
+, author =      "M. T. Goodrich and J. Snoeyink"
+, title =       "Stabbing vertical segments with a convex polygon"
+, type =        "Report"
+, number =      "JHU 87-19"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1987
+, precedes =    "gs-spscp-89"
 }
 
 @inproceedings{gs-spscp-89
-, author =	"M. T. Goodrich and J. S. Snoeyink"
-, title =	"Stabbing parallel segments with a convex polygon"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"231--242"
-, succeeds =	"gs-svscp-87"
-, precedes =	"gs-spscp-90"
+, author =      "M. T. Goodrich and J. S. Snoeyink"
+, title =       "Stabbing parallel segments with a convex polygon"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "231--242"
+, succeeds =    "gs-svscp-87"
+, precedes =    "gs-spscp-90"
 }
 
 @book{gt-dsaj-98
-, author =	"Michael T. Goodrich and Roberto Tamassia"
-, title =	"Data Structures and Algorithms in Java"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1998
-, update =	"99.11 bibrelex, 98.11 tamassia"
+, author =      "Michael T. Goodrich and Roberto Tamassia"
+, title =       "Data Structures and Algorithms in Java"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1998
+, update =      "99.11 bibrelex, 98.11 tamassia"
 }
 
 @book{gt-dsaj-01
-, author =	"M. T. Goodrich and R. Tamassia"
-, title =	"Data Structures and Algorithms in {J}ava"
-, edition =	"2nd"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	2001
-, update =	"01.04 vismara"
+, author =      "M. T. Goodrich and R. Tamassia"
+, title =       "Data Structures and Algorithms in {J}ava"
+, edition =     "2nd"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        2001
+, update =      "01.04 vismara"
 }
 
 @article{gt-drssp-97
-, author =	"M. T. Goodrich and R. Tamassia"
-, title =	"Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations"
-, journal =	"J. Algorithms"
-, volume =	23
-, year =	1997
-, pages =	"51--73"
-, update =	"97.07 smid"
+, author =      "M. T. Goodrich and R. Tamassia"
+, title =       "Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations"
+, journal =     "J. Algorithms"
+, volume =      23
+, year =        1997
+, pages =       "51--73"
+, update =      "97.07 smid"
 }
 
 @inproceedings{gt-drssp-93
-, author =	"M. T. Goodrich and R. Tamassia"
-, title =	"Dynamic ray shooting and shortest paths via balanced geodesic triangulations"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"318--327"
-, cites =	"as-anps-91, cegghss-rspug-91, cg-vippg-89, cpt-uadpl-93, cj-nrdpl-90, cj-sersi-91, clr-ia-90, eittwy-mmsfd-90, fmn-dgds-85, ggb-gsmpc-90, gt-dtdpl-91, gh-ospqs-89, ghlst-ltavs-86, gs-dfbt-78, h-opats-92, hs-parss-93, l-cspc-72, lp-esppr-84, m-pst-85, m-ss-84, o-ddds-83, ps-cgi-85, st-dsdt-83, stt-rdthg-88, t-dsna-83,  wl-arrcd-85, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "M. T. Goodrich and R. Tamassia"
+, title =       "Dynamic ray shooting and shortest paths via balanced geodesic triangulations"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "318--327"
+, cites =       "as-anps-91, cegghss-rspug-91, cg-vippg-89, cpt-uadpl-93, cj-nrdpl-90, cj-sersi-91, clr-ia-90, eittwy-mmsfd-90, fmn-dgds-85, ggb-gsmpc-90, gt-dtdpl-91, gh-ospqs-89, ghlst-ltavs-86, gs-dfbt-78, h-opats-92, hs-parss-93, l-cspc-72, lp-esppr-84, m-pst-85, m-ss-84, o-ddds-83, ps-cgi-85, st-dsdt-83, stt-rdthg-88, t-dsna-83,  wl-arrcd-85, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{gt-dtdpl-98
-, author =	"M. T. Goodrich and R. Tamassia"
-, title =	"Dynamic trees and dynamic point location"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1998
-, pages =	"612--636"
-, update =	"99.07 smid, 98.11 tamassia, 97.03 tamassia"
+, author =      "M. T. Goodrich and R. Tamassia"
+, title =       "Dynamic trees and dynamic point location"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1998
+, pages =       "612--636"
+, update =      "99.07 smid, 98.11 tamassia, 97.03 tamassia"
 }
 
 @inproceedings{gt-taavp-98
-, author =	"M. T. Goodrich and R. Tamassia"
-, title =	"Teaching the Analysis of Algorithms with Visual Proofs"
-, booktitle =	"Proc. ACM Symp. Computer Science Education"
-, year =	1998
-, update =	"98.11 tamassia"
+, author =      "M. T. Goodrich and R. Tamassia"
+, title =       "Teaching the Analysis of Algorithms with Visual Proofs"
+, booktitle =   "Proc. ACM Symp. Computer Science Education"
+, year =        1998
+, update =      "98.11 tamassia"
 }
 
 @inproceedings{gtvv-emcg-93
-, author =	"Michael T. Goodrich and Jyh-Jong Tsay and Darren E. Vengroff and Jeffrey Scott Vitter"
-, title =	"External-Memory Computational Geometry"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"714--723"
-, update =	"98.07 bibrelex, 97.03 agarwal, 95.01 franciosa, 94.01 smid, 93.09 milone+mitchell+vengroff"
+, author =      "Michael T. Goodrich and Jyh-Jong Tsay and Darren E. Vengroff and Jeffrey Scott Vitter"
+, title =       "External-Memory Computational Geometry"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "714--723"
+, update =      "98.07 bibrelex, 97.03 agarwal, 95.01 franciosa, 94.01 smid, 93.09 milone+mitchell+vengroff"
 }
 
 @article{g-sp-92
-, author =	"P. Goossens"
-, title =	"Shelling pseudopolyhedra"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"207--215"
+, author =      "P. Goossens"
+, title =       "Shelling pseudopolyhedra"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "207--215"
 }
 
 @inproceedings{gks-srbld-00
-, author =	"M. Gopi and S. Krishnan and C. T. Silva"
-, title =	"Surface reconstruction based on lower dimensional localized {Delaunay} triangulation"
-, booktitle =	"Eurographics"
-, year =	2000
-, pages =	""
-, update =	"01.07 devillers"
+, author =      "M. Gopi and S. Krishnan and C. T. Silva"
+, title =       "Surface reconstruction based on lower dimensional localized {Delaunay} triangulation"
+, booktitle =   "Eurographics"
+, year =        2000
+, pages =       ""
+, update =      "01.07 devillers"
 }
 
 @article{gh-3drpr-74
-, author =	"R. Gordon and G. T. Herman"
-, title =	"$3$-d reconstruction from projections: a review of algorithms"
-, journal =	"Internat. Review Cytology"
-, volume =	38
-, year =	1974
-, pages =	"111--151"
+, author =      "R. Gordon and G. T. Herman"
+, title =       "$3$-d reconstruction from projections: a review of algorithms"
+, journal =     "Internat. Review Cytology"
+, volume =      38
+, year =        1974
+, pages =       "111--151"
 }
 
 @incollection{gr-bscs-74
-, author =	"W. J. Gordon and R. F. Riesenfeld"
-, title =	"{B}-Spline Curves and Surfaces"
-, editor =	"F. Barnhill and R. Riesenfeld"
-, booktitle =	"Comput. Aided Geom. Design"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1974
-, pages =	"95--120"
-, update =	"98.03 bibrelex"
+, author =      "W. J. Gordon and R. F. Riesenfeld"
+, title =       "{B}-Spline Curves and Surfaces"
+, editor =      "F. Barnhill and R. Riesenfeld"
+, booktitle =   "Comput. Aided Geom. Design"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1974
+, pages =       "95--120"
+, update =      "98.03 bibrelex"
 }
 
 @book{gm-smt-87
-, author =	"M. Goresky and R. MacPherson"
-, title =	"Stratified {Morse} theory"
-, publisher =	"Springer-Verlag"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "M. Goresky and R. MacPherson"
+, title =       "Stratified {Morse} theory"
+, publisher =   "Springer-Verlag"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @article{g-spcsp-90
-, author =	"P. K. Gosh"
-, title =	"A Solution of Polygon Containment Spatial Planning and Other Related Problems Using {Minkowski} Operators"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	49
-, year =	1990
-, pages =	"1--35"
-, update =	"93.09 held"
+, author =      "P. K. Gosh"
+, title =       "A Solution of Polygon Containment Spatial Planning and Other Related Problems Using {Minkowski} Operators"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      49
+, year =        1990
+, pages =       "1--35"
+, update =      "93.09 held"
 }
 
 @phdthesis{g-ac-83
-, author =	"J. Gosling"
-, title =	"Algebraic constraints"
-, school =	"Dept. Comput. Sci., Carnegie Mellon Univ."
-, address =	"Pittsburgh, PA"
-, month =	may
-, year =	1983
-, note =	"Technical Report CMU-CS-83-132"
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "J. Gosling"
+, title =       "Algebraic constraints"
+, school =      "Dept. Comput. Sci., Carnegie Mellon Univ."
+, address =     "Pittsburgh, PA"
+, month =       may
+, year =        1983
+, note =        "Technical Report CMU-CS-83-132"
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @book{gy-japi-96
-, author =	"J. Gosling and F. Yellin and {The J}ava Team"
-, title =	"The {J}ava Application Programming Interface: Window Toolkit and Applets"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1996
-, update =	"98.07 tamassia"
+, author =      "J. Gosling and F. Yellin and {The J}ava Team"
+, title =       "The {J}ava Application Programming Interface: Window Toolkit and Applets"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1996
+, update =      "98.07 tamassia"
 }
 
 @article{gsf-oocuf-99
-, author =	"C. Gotsman and O. Sudarsky and J. A. Fayman"
-, title =	"Optimized Occlusion Culling Using Five-Dimensional Subdivision"
-, journal =	"Comput. \& Graphics"
-, volume =	23
-, number =	5
-, month =	oct
-, year =	1999
-, pages =	"645--654"
-, update =	"00.03 held"
+, author =      "C. Gotsman and O. Sudarsky and J. A. Fayman"
+, title =       "Optimized Occlusion Culling Using Five-Dimensional Subdivision"
+, journal =     "Comput. \& Graphics"
+, volume =      23
+, number =      5
+, month =       oct
+, year =        1999
+, pages =       "645--654"
+, update =      "00.03 held"
 }
 
 @article{gw-ratpc-93
-, author =	"C. Gotsman and M. Werman"
-, title =	"Recognition of Affine Transformed Planar Curves by Extremal Geometric Properties"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, year =	1993
-, pages =	"183--202"
-, update =	"96.01 werman"
+, author =      "C. Gotsman and M. Werman"
+, title =       "Recognition of Affine Transformed Planar Curves by Extremal Geometric Properties"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, year =        1993
+, pages =       "183--202"
+, update =      "96.01 werman"
 }
 
 @article{glm-othsr-96
-, author =	"S. Gottschalk and M. C. Lin and D. Manocha"
-, title =	"{OBB}-Tree: {A} Hierarchical Structure for Rapid Interference Detection"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1996
-, pages =	"171--180"
-, note =	"Proc. SIGGRAPH '96"
-, keywords =	"collision detection"
-, update =	"98.07 mitchell, 96.09 devillers, 96.05 klosowski"
+, author =      "S. Gottschalk and M. C. Lin and D. Manocha"
+, title =       "{OBB}-Tree: {A} Hierarchical Structure for Rapid Interference Detection"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1996
+, pages =       "171--180"
+, note =        "Proc. SIGGRAPH '96"
+, keywords =    "collision detection"
+, update =      "98.07 mitchell, 96.09 devillers, 96.05 klosowski"
 }
 
 @article{cg-prca-83
-, author =	"K. D. Gourley and D. M. Green"
-, title =	"A Polygon-to-Rectangle Conversion Algorithm"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	3
-, year =	1983
-, pages =	"31--36"
-, update =	"98.03 bibrelex"
+, author =      "K. D. Gourley and D. M. Green"
+, title =       "A Polygon-to-Rectangle Conversion Algorithm"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      3
+, year =        1983
+, pages =       "31--36"
+, update =      "98.03 bibrelex"
 }
 
 @article{gr-crsas-93
-, author =	"L. Gournay and J.-J. Risler"
-, title =	"Construction of roadmaps in semi-algebraic sets"
-, journal =	"Appl. Algebra Engrg. Comm. Comput."
-, volume =	4
-, year =	1993
-, pages =	"239--252"
-, update =	"98.07 agarwal"
+, author =      "L. Gournay and J.-J. Risler"
+, title =       "Construction of roadmaps in semi-algebraic sets"
+, journal =     "Appl. Algebra Engrg. Comm. Comput."
+, volume =      4
+, year =        1993
+, pages =       "239--252"
+, update =      "98.07 agarwal"
 }
 
 @article{g-hcppc-82
-, author =	"D. Gouyou-Beauchamps"
-, title =	"The {Hamiltonian} circuit problem is polynomial for 4-connected planar graphs"
-, journal =	"SIAM J. Comput."
-, volume =	11
-, year =	1982
-, pages =	"529--539"
-, update =	"99.07 forrest, 98.11 bibrelex"
+, author =      "D. Gouyou-Beauchamps"
+, title =       "The {Hamiltonian} circuit problem is polynomial for 4-connected planar graphs"
+, journal =     "SIAM J. Comput."
+, volume =      11
+, year =        1982
+, pages =       "529--539"
+, update =      "99.07 forrest, 98.11 bibrelex"
 }
 
 @mastersthesis{g-dpcg-80
-, author =	"I. G. Gowda"
-, title =	"Dynamic problems in computational geometry"
-, type =	"M.{Sc}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. British Columbia"
-, address =	"Vancouver, BC"
-, year =	1980
-, keywords =	"master thesis"
+, author =      "I. G. Gowda"
+, title =       "Dynamic problems in computational geometry"
+, type =        "M.{Sc}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. British Columbia"
+, address =     "Vancouver, BC"
+, year =        1980
+, keywords =    "master thesis"
 }
 
 @inproceedings{gk-elmes-80
-, author =	"I. G. Gowda and D. G. Kirkpatrick"
-, title =	"Exploiting linear merging and extra storage in the maintenance of fully dynamic geometric data structures"
-, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
-, year =	1980
-, pages =	"1--10"
-, keywords =	"data structuring, dynamizing data structures, Voronoi diagrams, convex hull"
+, author =      "I. G. Gowda and D. G. Kirkpatrick"
+, title =       "Exploiting linear merging and extra storage in the maintenance of fully dynamic geometric data structures"
+, booktitle =   "Proc. 18th Allerton Conf. Commun. Control Comput."
+, year =        1980
+, pages =       "1--10"
+, keywords =    "data structuring, dynamizing data structures, Voronoi diagrams, convex hull"
 }
 
 @article{gkln-dvd-83
-, author =	"I. G. Gowda and D. G. Kirkpatrick and D. T. Lee and A. Naamad"
-, title =	"Dynamic {Voronoi} diagrams"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	"IT-29"
-, year =	1983
-, pages =	"724--731"
-, keywords =	"data structuring, dynamizing data structures, Voronoi diagrams"
+, author =      "I. G. Gowda and D. G. Kirkpatrick and D. T. Lee and A. Naamad"
+, title =       "Dynamic {Voronoi} diagrams"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      "IT-29"
+, year =        1983
+, pages =       "724--731"
+, keywords =    "data structuring, dynamizing data structures, Voronoi diagrams"
 }
 
 @article{gk-cnnru-79
-, author =	"K. C. Gowda and G. Krishna"
-, title =	"The condensed nearest neighbor rule using the concept of mutual nearest neighborhood"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	"IT-25"
-, year =	1979
-, pages =	"488--490"
+, author =      "K. C. Gowda and G. Krishna"
+, title =       "The condensed nearest neighbor rule using the concept of mutual nearest neighborhood"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      "IT-25"
+, year =        1979
+, pages =       "488--490"
 }
 
 @techreport{gh-psaan-92
-, author =	"T. Graf and K. Hinrichs"
-, title =	"A plane sweep algorithm for the all nearest neighbors problem for a set of convex planar objects"
-, type =	"Report"
-, number =	"17/92-I"
-, institution =	"Angew. Math. Inform., Univ. M{\"u}nster"
-, address =	"M{\"u}nster, Germany"
-, year =	1992
+, author =      "T. Graf and K. Hinrichs"
+, title =       "A plane sweep algorithm for the all nearest neighbors problem for a set of convex planar objects"
+, type =        "Report"
+, number =      "17/92-I"
+, institution = "Angew. Math. Inform., Univ. M{\"u}nster"
+, address =     "M{\"u}nster, Germany"
+, year =        1992
 }
 
 @inproceedings{gh-psaan-93
-, author =	"Thorsten Graf and Klaus Hinrichs"
-, title =	"A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"349--360"
-, succeeds =	"gh-psaan-93p"
-, update =	"97.11 icking, 96.05 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "Thorsten Graf and Klaus Hinrichs"
+, title =       "A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "349--360"
+, succeeds =    "gh-psaan-93p"
+, update =      "97.11 icking, 96.05 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @inproceedings{gh-psaan-93p
-, author =	"Thorsten Graf and Klaus Hinrichs"
-, title =	"A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"74--77"
-, precedes =	"gh-psaan-93"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
+, author =      "Thorsten Graf and Klaus Hinrichs"
+, title =       "A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "74--77"
+, precedes =    "gh-psaan-93"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
 }
 
 @techreport{gh-appcp-92
-, author =	"T. Graf and K. Hinrichs"
-, title =	"Algorithms for proximity problems on colored point sets"
-, type =	"Report"
-, number =	"18/92-I"
-, institution =	"Angew. Math. Inform., Univ. M{\"u}nster"
-, address =	"M{\"u}nster, Germany"
-, year =	1992
-, precedes =	"gh-appcp-93"
-, update =	"98.11 bibrelex"
+, author =      "T. Graf and K. Hinrichs"
+, title =       "Algorithms for proximity problems on colored point sets"
+, type =        "Report"
+, number =      "18/92-I"
+, institution = "Angew. Math. Inform., Univ. M{\"u}nster"
+, address =     "M{\"u}nster, Germany"
+, year =        1992
+, precedes =    "gh-appcp-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{gh-appcp-93
-, author =	"T. Graf and K. Hinrichs"
-, title =	"Algorithms for proximity problems on colored point sets"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"420--425"
-, succeeds =	"gh-appcp-93p, gh-appcp-92"
-, cites =	"aert-otbsp-92, hns-arsa2-92, lw-vdllm-80, m-pst-85, o-ncbbs-82, iko-pstsm-88, s-raplg-91, v-famst-84, y-cmstk-82, ZZZ"
-, update =	"98.11 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "T. Graf and K. Hinrichs"
+, title =       "Algorithms for proximity problems on colored point sets"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "420--425"
+, succeeds =    "gh-appcp-93p, gh-appcp-92"
+, cites =       "aert-otbsp-92, hns-arsa2-92, lw-vdllm-80, m-pst-85, o-ncbbs-82, iko-pstsm-88, s-raplg-91, v-famst-84, y-cmstk-82, ZZZ"
+, update =      "98.11 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @inproceedings{gh-appcp-93p
-, author =	"Thorsten Graf and Klaus Hinrichs"
-, title =	"Algorithms for proximity problems on colored point sets"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"78--81"
-, precedes =	"gh-appcp-93"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Thorsten Graf and Klaus Hinrichs"
+, title =       "Algorithms for proximity problems on colored point sets"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "78--81"
+, precedes =    "gh-appcp-93"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @inproceedings{gh-daanf-94
-, author =	"T. Graf and K. Hinrichs"
-, title =	"Distribution algorithms for the all-nearest-foreign-neighbors problem in arbitrary {$L^t$} metrics"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"69--74"
-, cites =	"aert-otbsp-92, gh-appcp-93, hns-arsa2-92, l-tdvdl-80, ow-ad-93, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "T. Graf and K. Hinrichs"
+, title =       "Distribution algorithms for the all-nearest-foreign-neighbors problem in arbitrary {$L^t$} metrics"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "69--74"
+, cites =       "aert-otbsp-92, gh-appcp-93, hns-arsa2-92, l-tdvdl-80, ow-ad-93, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{gh-ssnfn-94
-, author =	"Thorsten Graf and Klaus Hinrichs"
-, title =	"Simple Search for Nearest Foreign Neighbors in Arbitrary {$L^t$}-Metrics"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"25--28"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Thorsten Graf and Klaus Hinrichs"
+, title =       "Simple Search for Nearest Foreign Neighbors in Arbitrary {$L^t$}-Metrics"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "25--28"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{gk-oacvn-98
-, author =	"T. Graf and V. Kamakoti"
-, title =	"An Optimal Algorithm for Computing Visible Nearest Foreign Neighbors Among Colored Line Segments"
-, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '98"
-, site =	"Stockholm"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1432
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"59--70"
-, update =	"99.03 bibrelex, 98.07 mitchell"
+, author =      "T. Graf and V. Kamakoti"
+, title =       "An Optimal Algorithm for Computing Visible Nearest Foreign Neighbors Among Colored Line Segments"
+, booktitle =   "Proc. 6th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '98"
+, site =        "Stockholm"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1432
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "59--70"
+, update =      "99.03 bibrelex, 98.07 mitchell"
 }
 
 % see http://www.cs.auc.dk/icalp98/
 @inproceedings{gk-mspop-98
-, author =	"T. Graf and V. Kamakoti"
-, title =	"Morphing Simple Polygons Optimally -- {A} Proof for an Improved Conjecture"
-, booktitle =	"Proc. 25th Internat. Colloq. Automata Lang. Prog."
-, nickname =	"ICALP '98"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	"??"
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"??"
-, update =	"98.03 mitchell"
-, annote =	"To appear, July 13-17 in Aalborg, Denmark"
+, author =      "T. Graf and V. Kamakoti"
+, title =       "Morphing Simple Polygons Optimally -- {A} Proof for an Improved Conjecture"
+, booktitle =   "Proc. 25th Internat. Colloq. Automata Lang. Prog."
+, nickname =    "ICALP '98"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      "??"
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "??"
+, update =      "98.03 mitchell"
+, annote =      "To appear, July 13-17 in Aalborg, Denmark"
 }
 
 @inproceedings{g-vscfa-81
-, author =	"N. Graham"
-, title =	"The visual system does a crude {Fourier} analysis of patterns"
-, booktitle =	"SIAM-AMS Proc."
-, volume =	13
-, year =	1981
-, pages =	"1--16"
-, update =	"98.11 bibrelex"
+, author =      "N. Graham"
+, title =       "The visual system does a crude {Fourier} analysis of patterns"
+, booktitle =   "SIAM-AMS Proc."
+, volume =      13
+, year =        1981
+, pages =       "1--16"
+, update =      "98.11 bibrelex"
 }
 
 @book{grs-rt-80
-, author =	"R. Graham and B. Rothschild and J. Spencer"
-, title =	"Ramsey Theory"
-, publisher =	"Wiley-Interscience"
-, address =	"New York"
-, year =	1980
-, update =	"95.05 agarwal"
+, author =      "R. Graham and B. Rothschild and J. Spencer"
+, title =       "Ramsey Theory"
+, publisher =   "Wiley-Interscience"
+, address =     "New York"
+, year =        1980
+, update =      "95.05 agarwal"
 }
 
 @article{gy-wtcg-90
-, author =	"R. Graham and F. Yao"
-, title =	"A whirlwind tour of computational geometry"
-, journal =	"Amer. Math. Monthly"
-, volume =	97
-, number =	8
-, year =	1990
-, pages =	"687--701"
-, keywords =	"survey paper, Voronoi diagrams, convex hull"
+, author =      "R. Graham and F. Yao"
+, title =       "A whirlwind tour of computational geometry"
+, journal =     "Amer. Math. Monthly"
+, volume =      97
+, number =      8
+, year =        1990
+, pages =       "687--701"
+, keywords =    "survey paper, Voronoi diagrams, convex hull"
 }
 
 @article{g-eadch-72
-, author =	"R. L. Graham"
-, title =	"An efficient algorithm for determining the convex hull of a finite planar set"
-, journal =	"Inform. Process. Lett."
-, volume =	1
-, year =	1972
-, pages =	"132--133"
-, keywords =	"design of algorithms, convex hull, worst-case analysis"
-, precedes =	"gs-ngcha-87"
-, annote =	"$O(n \log n)$ time, polar sorting"
+, author =      "R. L. Graham"
+, title =       "An efficient algorithm for determining the convex hull of a finite planar set"
+, journal =     "Inform. Process. Lett."
+, volume =      1
+, year =        1972
+, pages =       "132--133"
+, keywords =    "design of algorithms, convex hull, worst-case analysis"
+, precedes =    "gs-ngcha-87"
+, annote =      "$O(n \log n)$ time, polar sorting"
 }
 
 @incollection{g-ert-97
-, author =	"R. L. Graham"
-, title =	"Euclidean {Ramsey} theory"
-, chapter =	8
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"153--166"
-, update =	"97.11 orourke"
+, author =      "R. L. Graham"
+, title =       "Euclidean {Ramsey} theory"
+, chapter =     8
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "153--166"
+, update =      "97.11 orourke"
 }
 
 @article{g-p855e-85
-, author =	"R. L. Graham"
-, title =	"Problem 85-5/{EATCS}: {Euclidean} minimum spanning trees"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	285
+, author =      "R. L. Graham"
+, title =       "Problem 85-5/{EATCS}: {Euclidean} minimum spanning trees"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       285
 }
 
 @article{g-lsh-75
-, author =	"R. L. Graham"
-, title =	"The largest small hexagon"
-, journal =	"J. Combin. Theory"
-, volume =	18
-, year =	1975
-, pages =	"165--170"
-, update =	"98.03 bibrelex"
+, author =      "R. L. Graham"
+, title =       "The largest small hexagon"
+, journal =     "J. Combin. Theory"
+, volume =      18
+, year =        1975
+, pages =       "165--170"
+, update =      "98.03 bibrelex"
 }
 
 @article{gh-hmstp-85
-, author =	"R. L. Graham and P. Hell"
-, title =	"On the history of the minimum spanning tree problem"
-, journal =	"Annals of the History of Computing"
-, volume =	7
-, year =	1985
-, pages =	"43--57"
-, update =	"98.03 bibrelex"
+, author =      "R. L. Graham and P. Hell"
+, title =       "On the history of the minimum spanning tree problem"
+, journal =     "Annals of the History of Computing"
+, volume =      7
+, year =        1985
+, pages =       "43--57"
+, update =      "98.03 bibrelex"
 }
 
 @article{gh-rsmt-76
-, author =	"R. L. Graham and F. K. Hwang"
-, title =	"Remarks on {Steiner} minimum trees"
-, journal =	"Bull. Inst. Math. acad. Sinica"
-, volume =	4
-, year =	1976
-, pages =	"177--182"
-, update =	"98.03 bibrelex"
+, author =      "R. L. Graham and F. K. Hwang"
+, title =       "Remarks on {Steiner} minimum trees"
+, journal =     "Bull. Inst. Math. acad. Sinica"
+, volume =      4
+, year =        1976
+, pages =       "177--182"
+, update =      "98.03 bibrelex"
 }
 
 @book{gkp-cm-89
-, author =	"R. L. Graham and D. E. Knuth and O. Patashnik"
-, title =	"Concrete Mathematics"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1989
-, precedes =	"gkp-cm-94"
-, update =	"00.03 bibrelex, 97.03 gaertner+salinger"
+, author =      "R. L. Graham and D. E. Knuth and O. Patashnik"
+, title =       "Concrete Mathematics"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1989
+, precedes =    "gkp-cm-94"
+, update =      "00.03 bibrelex, 97.03 gaertner+salinger"
 }
 
 @book{gkp-cm-94
-, author =	"Ronald L. Graham and Donald E. Knuth and Oren Patashnik"
-, title =	"Concrete Mathematics"
-, edition =	"second"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1994
-, succeeds =	"gkp-cm-89"
-, update =	"00.03 bibrelex"
+, author =      "Ronald L. Graham and Donald E. Knuth and Oren Patashnik"
+, title =       "Concrete Mathematics"
+, edition =     "second"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1994
+, succeeds =    "gkp-cm-89"
+, update =      "00.03 bibrelex"
 }
 
 @book{grs-rt-90
-, author =	"R. L. Graham and B. L. Rothschild and J. Spencer"
-, title =	"Ramsey Theory"
-, publisher =	"John Wiley \& Sons"
-, year =	1990
-, update =	"99.11 bibrelex, 95.01 matousek"
+, author =      "R. L. Graham and B. L. Rothschild and J. Spencer"
+, title =       "Ramsey Theory"
+, publisher =   "John Wiley \& Sons"
+, year =        1990
+, update =      "99.11 bibrelex, 95.01 matousek"
 }
 
 @article{gs-pptdc-90
-, author =	"R. L. Graham and N. J. A. Sloane"
-, title =	"Penny-packing and two-dimensional codes"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"1--11"
+, author =      "R. L. Graham and N. J. A. Sloane"
+, title =       "Penny-packing and two-dimensional codes"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "1--11"
 }
 
 @article{gy-fchsp-83
-, author =	"R. L. Graham and F. F. Yao"
-, title =	"Finding the convex hull of a simple polygon"
-, journal =	"J. Algorithms"
-, volume =	4
-, year =	1983
-, pages =	"324--331"
-, keywords =	"designing algorithms, convex hull, two-dimensional, worst-case analysis"
-, annote =	"$O(n)$ time where points are ordered vertices"
+, author =      "R. L. Graham and F. F. Yao"
+, title =       "Finding the convex hull of a simple polygon"
+, journal =     "J. Algorithms"
+, volume =      4
+, year =        1983
+, pages =       "324--331"
+, keywords =    "designing algorithms, convex hull, two-dimensional, worst-case analysis"
+, annote =      "$O(n)$ time where points are ordered vertices"
 }
 
 @misc{g-ggmpa
-, author =	"Torbj{\"o}rn Granlund"
-, title =	"{GMP}, The {GNU} Multiple Precision Arithmetic Library"
-, url =	"https://gmplib.org/"
-, update =	"02.03 devillers"
+, author =      "Torbj{\"o}rn Granlund"
+, title =       "{GMP}, The {GNU} Multiple Precision Arithmetic Library"
+, url = "https://gmplib.org/"
+, update =      "02.03 devillers"
 }
 
 @manual{g-ggmpa-96
-, author =	"Torbj{\"o}rn Granlund"
-, title =	"{GMP}, The {GNU} Multiple Precision Arithmetic Library"
-, edition =	"2.0.2"
-, year =	1996
-, url =	"https://gmplib.org/"
-, update =	"02.03 devillers, 00.03 devillers"
+, author =      "Torbj{\"o}rn Granlund"
+, title =       "{GMP}, The {GNU} Multiple Precision Arithmetic Library"
+, edition =     "2.0.2"
+, year =        1996
+, url = "https://gmplib.org/"
+, update =      "02.03 devillers, 00.03 devillers"
 }
 
 @book{g-cof-01
-, author =	"Jack E. Graver"
-, title =	"Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures"
-, publisher =	"Mathematical Association of America"
-, year =	2001
-, location =	"Washington, D.C."
-, update =	"02.03 orourke"
+, author =      "Jack E. Graver"
+, title =       "Counting on Frameworks: Mathematics to Aid the Design of Rigid Structures"
+, publisher =   "Mathematical Association of America"
+, year =        2001
+, location =    "Washington, D.C."
+, update =      "02.03 orourke"
 }
 
 @book{gw-cetg-77
-, author =	"J. E. Graver and M. E. Watkins"
-, title =	"Combinatorics with Emphasis on the Theory of Graphs"
-, publisher =	"Springer-Verlag"
-, year =	1977
-, update =	"97.11 bibrelex"
+, author =      "J. E. Graver and M. E. Watkins"
+, title =       "Combinatorics with Emphasis on the Theory of Graphs"
+, publisher =   "Springer-Verlag"
+, year =        1977
+, update =      "97.11 bibrelex"
 }
 
 @article{g-asleb-97
-, author =	"J. Gravesen"
-, title =	"Adaptive subdivision and the length and energy of {B\'ezier} curves"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"13--31"
-, update =	"97.07 devillers"
+, author =      "J. Gravesen"
+, title =       "Adaptive subdivision and the length and energy of {B\'ezier} curves"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "13--31"
+, update =      "97.07 devillers"
 }
 
 @inproceedings{gblp-dcrao-96
-, author =	"J. Gray and A. Bosworth and A. Layman and H. Patel"
-, title =	"Data cube: {A} relational aggregation operator generalizing group-by, cross-tab, and sub-totals"
-, booktitle =	"Proc. 12th IEEE Internat. Conf. Data Eng."
-, year =	1996
-, pages =	"152--159"
-, update =	"97.07 agarwal"
+, author =      "J. Gray and A. Bosworth and A. Layman and H. Patel"
+, title =       "Data cube: {A} relational aggregation operator generalizing group-by, cross-tab, and sub-totals"
+, booktitle =   "Proc. 12th IEEE Internat. Conf. Data Eng."
+, year =        1996
+, pages =       "152--159"
+, update =      "97.07 agarwal"
 }
 
 @article{gmi-hibef-90
-, author =	"L. Gray and L. Martha and A. Ingraffea"
-, title =	"Hypersingular integrals in boundary element fracture analysis"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	20
-, year =	1990
-, pages =	"1135--1158"
-, update =	"97.11 bibrelex"
+, author =      "L. Gray and L. Martha and A. Ingraffea"
+, title =       "Hypersingular integrals in boundary element fracture analysis"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      20
+, year =        1990
+, pages =       "1135--1158"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{g-tsdg-93
-, author =	"J. Green-Cottingham"
-, title =	"Thrackles, Surfaces and Drawings of Graphs"
-, school =	"Clemson Univ."
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "J. Green-Cottingham"
+, title =       "Thrackles, Surfaces and Drawings of Graphs"
+, school =      "Clemson Univ."
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{g-chabd-80
-, author =	"P. J. Green"
-, title =	"Convex hulls in the analysis of bivariate data"
-, type =	"Paper read at the conference ``{Looking} at {Multivariate} {Data}''"
-, institution =	"Univ. Durham"
-, address =	"Sheffield, England"
-, year =	1980
+, author =      "P. J. Green"
+, title =       "Convex hulls in the analysis of bivariate data"
+, type =        "Paper read at the conference ``{Looking} at {Multivariate} {Data}''"
+, institution = "Univ. Durham"
+, address =     "Sheffield, England"
+, year =        1980
 }
 
 @incollection{g-pbd-81
-, author =	"P. J. Green"
-, title =	"Peeling Bivariate Data"
-, editor =	"Vic Barnet"
-, booktitle =	"Interpreting Multivariate Data"
-, publisher =	"John Wiley \& Sons"
-, address =	"Chichester"
-, year =	1981
-, pages =	"3--19"
-, update =	"99.11 bibrelex"
-, annote =	"Suggested Delaunay peeling, successive removing layers
-		 from DT"
+, author =      "P. J. Green"
+, title =       "Peeling Bivariate Data"
+, editor =      "Vic Barnet"
+, booktitle =   "Interpreting Multivariate Data"
+, publisher =   "John Wiley \& Sons"
+, address =     "Chichester"
+, year =        1981
+, pages =       "3--19"
+, update =      "99.11 bibrelex"
+, annote =      "Suggested Delaunay peeling, successive removing layers
+                 from DT"
 }
 
 @article{gs-cdtp-78
-, author =	"P. J. Green and R. R. Sibson"
-, title =	"Computing {Dirichlet} tessellations in the plane"
-, journal =	"Comput. J."
-, volume =	21
-, year =	1978
-, pages =	"168--173"
-, keywords =	"implementing algorithms, Delaunay triangulations, two-dimensional"
+, author =      "P. J. Green and R. R. Sibson"
+, title =       "Computing {Dirichlet} tessellations in the plane"
+, journal =     "Comput. J."
+, volume =      21
+, year =        1978
+, pages =       "168--173"
+, keywords =    "implementing algorithms, Delaunay triangulations, two-dimensional"
 }
 
 @article{gs-cchsp-79
-, author =	"P. J. Green and B. W. Silverman"
-, title =	"Constructing the convex hull of a set of points in the plane"
-, journal =	"Comput. J."
-, volume =	22
-, year =	1979
-, pages =	"262--266"
-, keywords =	"implementing algorithms, convex hull, two-dimensional"
-, annote =	"Implementation notes and benchmarks for Eddy's
-		 algorithm [e-nchap-77]"
+, author =      "P. J. Green and B. W. Silverman"
+, title =       "Constructing the convex hull of a set of points in the plane"
+, journal =     "Comput. J."
+, volume =      22
+, year =        1979
+, pages =       "262--266"
+, keywords =    "implementing algorithms, convex hull, two-dimensional"
+, annote =      "Implementation notes and benchmarks for Eddy's
+                 algorithm [e-nchap-77]"
 }
 
 @book{g-lat-67
-, author =	"M. Greenberg"
-, title =	"Lectures on Algebraic Topology"
-, publisher =	"Benjamin"
-, address =	"Reading, MA"
-, year =	1967
-, update =	"95.05 agarwal"
+, author =      "M. Greenberg"
+, title =       "Lectures on Algebraic Topology"
+, publisher =   "Benjamin"
+, address =     "Reading, MA"
+, year =        1967
+, update =      "95.05 agarwal"
 }
 
 @book{gh-atfc-81
-, author =	"M. Greenberg and J. Harper"
-, title =	"Algebraic Topology: {A} First Course"
-, publisher =	"Benjamin-Cummings"
-, address =	"Reading, MA"
-, year =	1981
-, update =	"98.03 bibrelex"
+, author =      "M. Greenberg and J. Harper"
+, title =       "Algebraic Topology: {A} First Course"
+, publisher =   "Benjamin-Cummings"
+, address =     "Reading, MA"
+, year =        1981
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ghs-paslc-93
-, author =	"Ronald I. Greenberg and Shih-Chuan Hung and Jau-Der Shih"
-, title =	"Parallel Algorithms for Single-Layer Channel Routing"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"456--465"
-, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Ronald I. Greenberg and Shih-Chuan Hung and Jau-Der Shih"
+, title =       "Parallel Algorithms for Single-Layer Channel Routing"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "456--465"
+, update =      "98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @article{gl-rrft-89
-, author =	"R. I. Greenberg and C. E. Leiserson"
-, title =	"Randomized routing on fat-trees"
-, journal =	"Adv. Comput. Res."
-, volume =	5
-, year =	1989
-, pages =	"345--374"
-, update =	"98.03 bibrelex"
+, author =      "R. I. Greenberg and C. E. Leiserson"
+, title =       "Randomized routing on fat-trees"
+, journal =     "Adv. Comput. Res."
+, volume =      5
+, year =        1989
+, pages =       "345--374"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{g-aipas-89
-, author =	"D. Greene"
-, title =	"An implementation and performance analysis of spatial data access methods"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Data Eng."
-, year =	1989
-, pages =	"606--615"
-, update =	"97.07 agarwal"
+, author =      "D. Greene"
+, title =       "An implementation and performance analysis of spatial data access methods"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Data Eng."
+, year =        1989
+, pages =       "606--615"
+, update =      "97.07 agarwal"
 }
 
 @unpublished{g-ilsi-
-, author =	"D. H. Greene"
-, title =	"Integer line segment intersection"
-, note =	"Unpublished Manuscript"
-, update =	"98.03 bibrelex"
+, author =      "D. H. Greene"
+, title =       "Integer line segment intersection"
+, note =        "Unpublished Manuscript"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{g-dpcp-83
-, author =	"Daniel H. Greene"
-, title =	"The Decomposition of Polygons into Convex Parts"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"235--259"
-, update =	"01.04 icking"
-, annote =	"minimal decomposition; finds optimal in $O(n^{4})$
-		 time, constant-factor in $O(n \log n)$"
+, author =      "Daniel H. Greene"
+, title =       "The Decomposition of Polygons into Convex Parts"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "235--259"
+, update =      "01.04 icking"
+, annote =      "minimal decomposition; finds optimal in $O(n^{4})$
+                 time, constant-factor in $O(n \log n)$"
 }
 
 @book{gk-maa-82
-, author =	"D. H. Greene and D. E. Knuth"
-, title =	"Mathematics for the analysis of algorithms"
-, publisher =	"Birkh{\"a}user"
-, address =	"Boston"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "D. H. Greene and D. E. Knuth"
+, title =       "Mathematics for the analysis of algorithms"
+, publisher =   "Birkh{\"a}user"
+, address =     "Boston"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gy-frcg-86
-, author =	"D. H. Greene and F. F. Yao"
-, title =	"Finite-resolution computational geometry"
-, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1986
-, pages =	"143--152"
+, author =      "D. H. Greene and F. F. Yao"
+, title =       "Finite-resolution computational geometry"
+, booktitle =   "Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1986
+, pages =       "143--152"
 }
 
 @incollection{g-dirsc-94
-, author =	"Ned Greene"
-, title =	"Detecting Intersection of a Rectangular Solid and a Convex Polyhedron"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"74--82"
-, keywords =	"collision detection, octree, computational geometry"
-, update =	"94.09 heckbert"
-, annote =	"Presents an optimized technique to test for intersection
+, author =      "Ned Greene"
+, title =       "Detecting Intersection of a Rectangular Solid and a Convex Polyhedron"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "74--82"
+, keywords =    "collision detection, octree, computational geometry"
+, update =      "94.09 heckbert"
+, annote =      "Presents an optimized technique to test for intersection
 between a convex polyhedron and a box. This is useful when comparing
 bounding boxes against a viewing frustum in a rendering program, for
 instance. Contains pseudocode."
 }
 
 @inproceedings{gkm-hzbv-93
-, author =	"N. Greene and M. Kass and G. Miller"
-, title =	"Hierachical Z-Buffer Visibility"
-, booktitle =	"Computer Graphics Proceedings, Annu. Conference Series, 1993"
-, year =	1993
-, pages =	"273--278"
-, update =	"97.11 bibrelex"
+, author =      "N. Greene and M. Kass and G. Miller"
+, title =       "Hierachical Z-Buffer Visibility"
+, booktitle =   "Computer Graphics Proceedings, Annu. Conference Series, 1993"
+, year =        1993
+, pages =       "273--278"
+, update =      "97.11 bibrelex"
 }
 
 @article{g-nsnbp-90
-, author =	"L. Greengard"
-, title =	"The numerical solution of the {N}-body problem"
-, journal =	"Computers in Physics"
-, volume =	"??"
-, year =	1990
-, pages =	"142--152"
-, update =	"97.07 agarwal"
+, author =      "L. Greengard"
+, title =       "The numerical solution of the {N}-body problem"
+, journal =     "Computers in Physics"
+, volume =      "??"
+, year =        1990
+, pages =       "142--152"
+, update =      "97.07 agarwal"
 }
 
 @book{g-repfp-88
-, author =	"L. Greengard"
-, title =	"The rapid evaluation of potential fields in particle systems"
-, publisher =	"MIT Press"
-, address =	"Cambridge"
-, year =	1988
-, update =	"97.07 agarwal"
+, author =      "L. Greengard"
+, title =       "The rapid evaluation of potential fields in particle systems"
+, publisher =   "MIT Press"
+, address =     "Cambridge"
+, year =        1988
+, update =      "97.07 agarwal"
 }
 
 @article{g-dawp-60
-, author =	"M. Greenlinger"
-, title =	"Dehn's algorithm for the word problem"
-, journal =	"Commun. Pure Appl. Math."
-, volume =	13
-, year =	1960
-, pages =	"67--83"
-, update =	"98.07 bibrelex"
+, author =      "M. Greenlinger"
+, title =       "Dehn's algorithm for the word problem"
+, journal =     "Commun. Pure Appl. Math."
+, volume =      13
+, year =        1960
+, pages =       "67--83"
+, update =      "98.07 bibrelex"
 }
 
 @article{g-ulebt-89
-, author =	"A. Gregori"
-, title =	"Unit Length Embedding of Binary Trees on a Square Grid"
-, journal =	"Inform. Process. Lett."
-, volume =	31
-, year =	1989
-, pages =	"167--172"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "A. Gregori"
+, title =       "Unit Length Embedding of Binary Trees on a Square Grid"
+, journal =     "Inform. Process. Lett."
+, volume =      31
+, year =        1989
+, pages =       "167--172"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @incollection{g-eblit-75
-, author =	"J. Gregory"
-, title =	"Error bounds for linear interpolation on triangles"
-, editor =	"J. R. Whiteman"
-, booktitle =	"The Mathematics of Finite Elements and Applications II"
-, publisher =	"Academic Press"
-, year =	1975
-, pages =	"163--170"
-, update =	"97.11 bibrelex"
+, author =      "J. Gregory"
+, title =       "Error bounds for linear interpolation on triangles"
+, editor =      "J. R. Whiteman"
+, booktitle =   "The Mathematics of Finite Elements and Applications II"
+, publisher =   "Academic Press"
+, year =        1975
+, pages =       "163--170"
+, update =      "97.11 bibrelex"
 }
 
 @article{gc-tipca-80
-, author =	"J. A. Gregory and Charrot"
-, title =	"A $C^1$ triangular interpolation patch for computer-aided geometric design"
-, journal =	"Comput. Graph. Image Process."
-, volume =	13
-, year =	1980
-, pages =	"80--87"
-, update =	"98.03 bibrelex"
+, author =      "J. A. Gregory and Charrot"
+, title =       "A $C^1$ triangular interpolation patch for computer-aided geometric design"
+, journal =     "Comput. Graph. Image Process."
+, volume =      13
+, year =        1980
+, pages =       "80--87"
+, update =      "98.03 bibrelex"
 }
 
 @article{g-sgtpa-73
-, author =	"U. Grenander"
-, title =	"Statistical geometry: a tool for pattern analysis"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	79
-, year =	1973
-, pages =	"829--856"
+, author =      "U. Grenander"
+, title =       "Statistical geometry: a tool for pattern analysis"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      79
+, year =        1973
+, pages =       "829--856"
 }
 
 @incollection{gck-ccs-91
-, author =	"U. Grenander and Y. Chow and D. M. Keenan"
-, title =	"Connectivity of Configuration Space"
-, chapter =	"D"
-, booktitle =	"Hands: A Pattern Theoretic Study of Biological Shapes"
-, type =	"Appendix"
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"108--128"
-, update =	"02.03 orourke"
+, author =      "U. Grenander and Y. Chow and D. M. Keenan"
+, title =       "Connectivity of Configuration Space"
+, chapter =     "D"
+, booktitle =   "Hands: A Pattern Theoretic Study of Biological Shapes"
+, type =        "Appendix"
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "108--128"
+, update =      "02.03 orourke"
 }
 
 @article{gks-ecstv-90
-, author =	"J. Gretenkort and P. Kleinschmidt and B. Sturmfels"
-, title =	"On the existence of certain smooth toric varieties"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"255--262"
+, author =      "J. Gretenkort and P. Kleinschmidt and B. Sturmfels"
+, title =       "On the existence of certain smooth toric varieties"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "255--262"
 }
 
 @article{gs-ngcha-87
-, author =	"D. Gries and I. Stojmenovi{\'c}"
-, title =	"A note on {Graham}'s convex hull algorithm"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"323--327"
-, succeeds =	"g-eadch-72"
+, author =      "D. Gries and I. Stojmenovi{\'c}"
+, title =       "A note on {Graham}'s convex hull algorithm"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "323--327"
+, succeeds =    "g-eadch-72"
 }
 
 @book{g-sap-87
-, author =	"D. A. Griffith"
-, title =	"Spatial Autocorrelation: a primer"
-, publisher =	"Association of American Cartographers"
-, address =	"Washington"
-, year =	1987
-, update =	"96.09 kreveld"
+, author =      "D. A. Griffith"
+, title =       "Spatial Autocorrelation: a primer"
+, publisher =   "Association of American Cartographers"
+, address =     "Washington"
+, year =        1987
+, update =      "96.09 kreveld"
 }
 
 @article{g-eheld-79
-, author =	"J. G. Griffith"
-, title =	"Eliminating hidden edges in line drawing"
-, journal =	"Comput. Aided Design"
-, volume =	11
-, year =	1979
-, pages =	"71--78"
+, author =      "J. G. Griffith"
+, title =       "Eliminating hidden edges in line drawing"
+, journal =     "Comput. Aided Design"
+, volume =      11
+, year =        1979
+, pages =       "71--78"
 }
 
 @article{g-cvrtp-81
-, author =	"H. Griffiths"
-, title =	"Cayley's version of the resultant of two polynomials"
-, journal =	"Amer. Math. Monthly"
-, volume =	"??"
-, month =	may
-, year =	1981
-, pages =	"328--338"
-, update =	"98.03 bibrelex"
+, author =      "H. Griffiths"
+, title =       "Cayley's version of the resultant of two polynomials"
+, journal =     "Amer. Math. Monthly"
+, volume =      "??"
+, month =       may
+, year =        1981
+, pages =       "328--338"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{gkp-aspgt-95
-, author =	"M. Grigni and E. Koutsoupias and C. H. Papadimitriou"
-, title =	"An approximation scheme for planar graph {TSP}"
-, booktitle =	"Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '95"
-, year =	1995
-, pages =	"640--645"
-, update =	"00.03 bibrelex, 97.03 agarwal+bibrelex, 95.09 mitchell"
+, author =      "M. Grigni and E. Koutsoupias and C. H. Papadimitriou"
+, title =       "An approximation scheme for planar graph {TSP}"
+, booktitle =   "Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '95"
+, year =        1995
+, pages =       "640--645"
+, update =      "00.03 bibrelex, 97.03 agarwal+bibrelex, 95.09 mitchell"
 }
 
 @article{gv-cccsa-92
-, author =	"Dima Grigor{\'e}v and Nicolai Vorobjov"
-, title =	"Counting connected components of a semi-algebraic set in subexponential time"
-, journal =	"Comput. Complexity"
-, volume =	2
-, year =	1992
-, pages =	"133--186"
-, update =	"98.07 agarwal"
+, author =      "Dima Grigor{\'e}v and Nicolai Vorobjov"
+, title =       "Counting connected components of a semi-algebraic set in subexponential time"
+, journal =     "Comput. Complexity"
+, volume =      2
+, year =        1992
+, pages =       "133--186"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{gkms-lbrad-96
-, author =	"Dima Grigoriev and Marek Karpinski and {Friedhelm Meyer auf der Heide} and Roman Smolensky"
-, title =	"A Lower Bound for Randomized Algebraic Decision Trees"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, year =	1996
-, pages =	"612--619"
-, update =	"01.07 orourke"
+, author =      "Dima Grigoriev and Marek Karpinski and {Friedhelm Meyer auf der Heide} and Roman Smolensky"
+, title =       "A Lower Bound for Randomized Algebraic Decision Trees"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, year =        1996
+, pages =       "612--619"
+, update =      "01.07 orourke"
 }
 
 @inproceedings{gkv-clbtm-94
-, author =	"Dima Grigoriev and Marek Karpinski and Nicolai Vorobjov"
-, title =	"Complexity Lower Bounds on Testing Membership to a Polyhedron by Algebraic Decision Trees"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	""
-, update =	"94.01 jones"
+, author =      "Dima Grigoriev and Marek Karpinski and Nicolai Vorobjov"
+, title =       "Complexity Lower Bounds on Testing Membership to a Polyhedron by Algebraic Decision Trees"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       ""
+, update =      "94.01 jones"
 }
 
 @article{gv-clbct-96
-, author =	"Dima Grigoriev and Nicolai Vorobjov"
-, title =	"Complexity lower bounds for computation trees with elementary transcendental function gates"
-, journal =	"Theoret. Comput. Sci."
-, volume =	157
-, year =	1996
-, pages =	"185--214"
-, comments =	"Proves an $\Omega(\sqrt{log N})$ lower bound for testing
+, author =      "Dima Grigoriev and Nicolai Vorobjov"
+, title =       "Complexity lower bounds for computation trees with elementary transcendental function gates"
+, journal =     "Theoret. Comput. Sci."
+, volume =      157
+, year =        1996
+, pages =       "185--214"
+, comments =    "Proves an $\Omega(\sqrt{log N})$ lower bound for testing
 membership in a set whose sum of Betti numbers is $N$, or membership
 in a polyhedron with $N$ faces (of all dimensions).  The model of
 computation generalizes Ben-Or's algebraic computation trees by also
 allowing the computation of Pfaffian functions such as exp, log, sin,
 cos, etc."
-, update =	"97.07 agarwal"
+, update =      "97.07 agarwal"
 }
 
 @article{g-cdta-87
-, author =	"D. Y. Grigoryev"
-, title =	"Complexity of deciding {Tarski} algebra"
-, journal =	"J. Symbolic Comput."
-, volume =	"??"
-, year =	1987
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "D. Y. Grigoryev"
+, title =       "Complexity of deciding {Tarski} algebra"
+, journal =     "J. Symbolic Comput."
+, volume =      "??"
+, year =        1987
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{gmo-laapc-98
-, author =	"C. I. Grima and A. M{\'a}rquez and L. Ortega"
-, title =	"A Locus Approach to Angle Problems in Computational Geometry"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	87
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "C. I. Grima and A. M{\'a}rquez and L. Ortega"
+, title =       "A Locus Approach to Angle Problems in Computational Geometry"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       87
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{gmo-pdgo-99
-, author =	"Clara I. Grima and Alberto M{\'a}rquez and Lidia Ortega"
-, title =	"Polar Diagrams of Geometric Objects"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"149--151"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Clara I. Grima and Alberto M{\'a}rquez and Lidia Ortega"
+, title =       "Polar Diagrams of Geometric Objects"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "149--151"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @book{gs-prp-85
-, author =	"G. R. Grimmet and D. R. Stirzaker"
-, title =	"Probability and Random Processes"
-, publisher =	"Clarendon Press"
-, address =	"Oxford, UK"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "G. R. Grimmet and D. R. Stirzaker"
+, title =       "Probability and Random Processes"
+, publisher =   "Clarendon Press"
+, address =     "Oxford, UK"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @article{g-clcmb-86
-, author =	"W. E. Grimson"
-, title =	"The combinatorics of local constraints in model-based recognition and localization from sparse data"
-, journal =	"J. ACM"
-, volume =	33
-, year =	1986
-, pages =	"658--686"
-, update =	"98.03 bibrelex"
+, author =      "W. E. Grimson"
+, title =       "The combinatorics of local constraints in model-based recognition and localization from sparse data"
+, journal =     "J. ACM"
+, volume =      33
+, year =        1986
+, pages =       "658--686"
+, update =      "98.03 bibrelex"
 }
 
 @article{gl-lopsi-87
-, author =	"W. E. Grimson and T. Lozano-Perez"
-, title =	"Localizing overlapping parts by searching the interpretation tree"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-9"
-, year =	1987
-, pages =	"469--482"
-, update =	"98.03 bibrelex"
+, author =      "W. E. Grimson and T. Lozano-Perez"
+, title =       "Localizing overlapping parts by searching the interpretation tree"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-9"
+, year =        1987
+, pages =       "469--482"
+, update =      "98.03 bibrelex"
 }
 
 @book{g-iscsh-81
-, author =	"W. E. L. Grimson"
-, title =	"Form Images to Surfaces: A Computational Study of the Human Early Visual System"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "W. E. L. Grimson"
+, title =       "Form Images to Surfaces: A Computational Study of the Human Early Visual System"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gh-sgh-90
-, author =	"W. E. L. Grimson and D. P. Huttenlocher"
-, title =	"On the sensitivity of geometric hashing"
-, booktitle =	"Proc. 3rd Internat. Conf. Comput. Vision"
-, year =	1990
-, pages =	"334--338"
-, update =	"98.07 rote, 97.11 bibrelex"
+, author =      "W. E. L. Grimson and D. P. Huttenlocher"
+, title =       "On the sensitivity of geometric hashing"
+, booktitle =   "Proc. 3rd Internat. Conf. Comput. Vision"
+, year =        1990
+, pages =       "334--338"
+, update =      "98.07 rote, 97.11 bibrelex"
 }
 
 @techreport{gc-cspum-93
-, author =	"R. Grinde and T. Cavalier"
-, title =	"Containment of a single polygon using mathematical programming"
-, type =	"Technical {Report} {IMSE} {Working} {Paper}"
-, number =	"92-164"
-, institution =	"Dept. Industrial and Management Systems Engineering, Pennsylvania State Univ."
-, year =	1993
-, update =	"98.07 bibrelex"
+, author =      "R. Grinde and T. Cavalier"
+, title =       "Containment of a single polygon using mathematical programming"
+, type =        "Technical {Report} {IMSE} {Working} {Paper}"
+, number =      "92-164"
+, institution = "Dept. Industrial and Management Systems Engineering, Pennsylvania State Univ."
+, year =        1993
+, update =      "98.07 bibrelex"
 }
 
 @article{gc-natpc-96
-, author =	"R. Grinde and T. M. Cavalier"
-, title =	"A new algorithm for the two-polygon containment problem"
-, journal =	"Comput. Oper. Res."
-, volume =	"??"
-, year =	1996
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "R. Grinde and T. M. Cavalier"
+, title =       "A new algorithm for the two-polygon containment problem"
+, journal =     "Comput. Oper. Res."
+, volume =      "??"
+, year =        1996
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @article{g-tprc2-81
-, author =	"P. Gritzmann"
-, title =	"Tight polyhedral realizations of closed $2$-dimensional manifolds in {$R^{3}$}"
-, journal =	"J. Geom."
-, volume =	17
-, year =	1981
-, pages =	"69--76"
+, author =      "P. Gritzmann"
+, title =       "Tight polyhedral realizations of closed $2$-dimensional manifolds in {$R^{3}$}"
+, journal =     "J. Geom."
+, volume =      17
+, year =        1981
+, pages =       "69--76"
 }
 
 @article{ghk-gbrcp-91
-, author =	"P. Gritzmann and L. Habsieger and V. Klee"
-, title =	"Good and bad radii of convex polygons"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"395--403"
+, author =      "P. Gritzmann and L. Habsieger and V. Klee"
+, title =       "Good and bad radii of convex polygons"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "395--403"
 }
 
 @inproceedings{gh-ptamr-95
-, author =	"Peter Gritzmann and Alexander Hufnagel"
-, title =	"A Polynomial Time Algorithm for {Minkowski} Reconstruction"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"1--9"
-, keywords =	"polytopes, convexity, computer vision, facet volumes"
-, cites =	"df-ccv-88, dgh-ccmv-94, gj-cigtn-79, gh-acmrt-94, gk-csbpc-94, g-immv-90, g-sgi-93, gls-gaco-88, h-egi-84, h-rv-86, h-apbmt-95, l-pvc-91, l-imrcp-83, l-egimv-85, m-aludk-97, m-vuo-03, s-mv-93, s-cbbmt-93, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Peter Gritzmann and Alexander Hufnagel"
+, title =       "A Polynomial Time Algorithm for {Minkowski} Reconstruction"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "1--9"
+, keywords =    "polytopes, convexity, computer vision, facet volumes"
+, cites =       "df-ccv-88, dgh-ccmv-94, gj-cigtn-79, gh-acmrt-94, gk-csbpc-94, g-immv-90, g-sgi-93, gls-gaco-88, h-egi-84, h-rv-86, h-apbmt-95, l-pvc-91, l-imrcp-83, l-egimv-85, m-aludk-97, m-vuo-03, s-mv-93, s-cbbmt-93, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @techreport{gh-acmrt-94
-, author =	"P. Gritzmann and A. Hufnagel"
-, title =	"On the algorithmic complexity of {Minkowski}'s reconstruction theorem"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "P. Gritzmann and A. Hufnagel"
+, title =       "On the algorithmic complexity of {Minkowski}'s reconstruction theorem"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @article{gk-ccioj-93
-, author =	"P. Gritzmann and V. Klee"
-, title =	"Computational complexity of inner and outer $j$-radii of polytopes in finite-dimensional normed spaces"
-, journal =	"Math. Program."
-, volume =	59
-, year =	1993
-, pages =	"163--213"
-, update =	"93.09 smid"
+, author =      "P. Gritzmann and V. Klee"
+, title =       "Computational complexity of inner and outer $j$-radii of polytopes in finite-dimensional normed spaces"
+, journal =     "Math. Program."
+, volume =      59
+, year =        1993
+, pages =       "163--213"
+, update =      "93.09 smid"
 }
 
 @incollection{gk-cc-97
-, author =	"P. Gritzmann and V. Klee"
-, title =	"Computational convexity"
-, chapter =	27
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"491--516"
-, update =	"97.11 orourke"
+, author =      "P. Gritzmann and V. Klee"
+, title =       "Computational convexity"
+, chapter =     27
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "491--516"
+, update =      "97.11 orourke"
 }
 
 @article{gk-iojrc-92
-, author =	"P. Gritzmann and V. Klee"
-, title =	"Inner and outer $j$-radii of convex bodies in finite-dimensional normed spaces"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"255--280"
+, author =      "P. Gritzmann and V. Klee"
+, title =       "Inner and outer $j$-radii of convex bodies in finite-dimensional normed spaces"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "255--280"
 }
 
 @incollection{gk-csbpc-94
-, author =	"P. Gritzmann and V. Klee"
-, title =	"On the complexity of some basic problems in computational convexity: {II}. {Volume} and mixed volumes"
-, editor =	"T. Bisztriczky and P. McMullen and R. Schneider and A. I. Weiss"
-, booktitle =	"Polytopes: Abstract, Convex and Computational"
-, publisher =	"Kluwer Academic Publischers"
-, year =	1994
-, pages =	"373--466"
-, update =	"98.03 bibrelex"
+, author =      "P. Gritzmann and V. Klee"
+, title =       "On the complexity of some basic problems in computational convexity: {II}. {Volume} and mixed volumes"
+, editor =      "T. Bisztriczky and P. McMullen and R. Schneider and A. I. Weiss"
+, booktitle =   "Polytopes: Abstract, Convex and Computational"
+, publisher =   "Kluwer Academic Publischers"
+, year =        1994
+, pages =       "373--466"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{gkw-lplpo-90
-, author =	"P. Gritzmann and V. Klee and J. Westwater"
-, title =	"On the limited power of linear probes and other optimization oracles"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"92--101"
-, cites =	"bb-ca-85, cy-sp-87, dey-pcp-86, gls-gaco-88, sk-ctnmx-78, s-gp-88, s-pgp-89, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "P. Gritzmann and V. Klee and J. Westwater"
+, title =       "On the limited power of linear probes and other optimization oracles"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "92--101"
+, cites =       "bb-ca-85, cy-sp-87, dey-pcp-86, gls-gaco-88, sk-ctnmx-78, s-gp-88, s-pgp-89, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{gkw-pcdlp-93
-, author =	"Peter Gritzmann and Victor Klee and John Westwater"
-, title =	"Polytope Containment And Determination By Linear Probes"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"59--60"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Peter Gritzmann and Victor Klee and John Westwater"
+, title =       "Polytope Containment And Determination By Linear Probes"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "59--60"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @article{gl-emwpi-89
-, author =	"P. Gritzmann and M. Lassak"
-, title =	"Estimates for the minimal width polytopes inscribed in convex bodies"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"627--635"
+, author =      "P. Gritzmann and M. Lassak"
+, title =       "Estimates for the minimal width polytopes inscribed in convex bodies"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "627--635"
 }
 
 @article{gmpp-eptvs-91
-, author =	"P. Gritzmann and B. Mohar and J. Pach and R. Pollack"
-, title =	"Embedding a Planar Triangulation with Vertices at Specified Points"
-, journal =	"Amer. Math. Monthly"
-, volume =	98
-, number =	2
-, year =	1991
-, pages =	"165--166"
-, update =	"98.11 bibrelex, 93.09 held"
+, author =      "P. Gritzmann and B. Mohar and J. Pach and R. Pollack"
+, title =       "Embedding a Planar Triangulation with Vertices at Specified Points"
+, journal =     "Amer. Math. Monthly"
+, volume =      98
+, number =      2
+, year =        1991
+, pages =       "165--166"
+, update =      "98.11 bibrelex, 93.09 held"
 }
 
 @article{gs-mapcc-93
-, author =	"P. Gritzmann and B. Sturmfels"
-, title =	"Minkowski addition of polytopes: Computational complexity and applications"
-, journal =	"SIAM J. Discrete Math."
-, volume =	6
-, year =	1993
-, pages =	"246--269"
-, update =	"94.05 matousek"
+, author =      "P. Gritzmann and B. Sturmfels"
+, title =       "Minkowski addition of polytopes: Computational complexity and applications"
+, journal =     "SIAM J. Discrete Math."
+, volume =      6
+, year =        1993
+, pages =       "246--269"
+, update =      "94.05 matousek"
 }
 
 @article{g-immv-90
-, author =	"H. Groemer"
-, title =	"On an inequality of {Minkowski} for mixed volumes"
-, journal =	"Geom. Dedicata"
-, volume =	33
-, year =	1990
-, pages =	"117--122"
-, update =	"98.03 bibrelex"
+, author =      "H. Groemer"
+, title =       "On an inequality of {Minkowski} for mixed volumes"
+, journal =     "Geom. Dedicata"
+, volume =      33
+, year =        1990
+, pages =       "117--122"
+, update =      "98.03 bibrelex"
 }
 
 @article{g-cbtpp-90
-, author =	"H. Groemer"
-, title =	"On convex bodies that permit packings of high density"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"357--364"
+, author =      "H. Groemer"
+, title =       "On convex bodies that permit packings of high density"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "357--364"
 }
 
 @article{g-sbppc-86
-, author =	"H. Groemer"
-, title =	"Some basic properties of packing and covering constants"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"183--193"
+, author =      "H. Groemer"
+, title =       "Some basic properties of packing and covering constants"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "183--193"
 }
 
 @incollection{g-sgi-93
-, author =	"H. Groemer"
-, title =	"Stability of geometric inequalities"
-, editor =	"P. M. Gruber and J. M. Wills"
-, booktitle =	"Handbook of Convex Geometry"
-, volume =	"A"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1993
-, pages =	"125--150"
-, update =	"98.03 bibrelex"
+, author =      "H. Groemer"
+, title =       "Stability of geometric inequalities"
+, editor =      "P. M. Gruber and J. M. Wills"
+, booktitle =   "Handbook of Convex Geometry"
+, volume =      "A"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1993
+, pages =       "125--150"
+, update =      "98.03 bibrelex"
 }
 
 @article{gvdk-sbap-81
-, author =	"F. C. A. Groen and P. W. Verbeek and N. DeJong and J. W. Klumper"
-, title =	"The Smallest Box Around a Package"
-, journal =	"Pattern Recogn."
-, volume =	14
-, number =	"1--6"
-, year =	1981
-, pages =	"173--178"
-, update =	"94.01 jones, 93.09 held"
+, author =      "F. C. A. Groen and P. W. Verbeek and N. DeJong and J. W. Klumper"
+, title =       "The Smallest Box Around a Package"
+, journal =     "Pattern Recogn."
+, volume =      14
+, number =      "1--6"
+, year =        1981
+, pages =       "173--178"
+, update =      "94.01 jones, 93.09 held"
 }
 
 @techreport{gh-epfpk-84
-, author =	"U. Groh and G. Hotz"
-, title =	"Ein {Planarit{\"a}tstest} f{\"u}r planar-konvexe {Grapheneinbettungen} mit linearer {Komplexit{\"a}t}"
-, type =	"Report"
-, number =	"??"
-, institution =	"Fachber. Inform., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1984
+, author =      "U. Groh and G. Hotz"
+, title =       "Ein {Planarit{\"a}tstest} f{\"u}r planar-konvexe {Grapheneinbettungen} mit linearer {Komplexit{\"a}t}"
+, type =        "Report"
+, number =      "??"
+, institution = "Fachber. Inform., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1984
 }
 
 @techreport{g-lbds-85
-, author =	"V. Grolmusz"
-, title =	"A lower bound to diameter searching"
-, type =	"Report"
-, number =	"??"
-, institution =	"Comput. Sci. Dept., E{\"o}tv{\"o}s Lora{\'a}nd Univ."
-, address =	"Budapest, Hungary"
-, year =	1985
+, author =      "V. Grolmusz"
+, title =       "A lower bound to diameter searching"
+, type =        "Report"
+, number =      "??"
+, institution = "Comput. Sci. Dept., E{\"o}tv{\"o}s Lora{\'a}nd Univ."
+, address =     "Budapest, Hungary"
+, year =        1985
 }
 
 @article{g-sih-69
-, author =	"M. L. Gromov"
-, title =	"Simplexes Inscribed on a Hypersurface"
-, journal =	"Mat. Zametki"
-, volume =	5
-, year =	1969
-, pages =	"81--89"
-, note =	"In Russian. English translation in Transl. Math. Notes Acad. Sci. USSR 5:52--56, 1969."
-, update =	"99.11 bibrelex"
+, author =      "M. L. Gromov"
+, title =       "Simplexes Inscribed on a Hypersurface"
+, journal =     "Mat. Zametki"
+, volume =      5
+, year =        1969
+, pages =       "81--89"
+, note =        "In Russian. English translation in Transl. Math. Notes Acad. Sci. USSR 5:52--56, 1969."
+, update =      "99.11 bibrelex"
 }
 
 @book{gz-cccad-84
-, author =	"M. P. Groover and E. W. Zimmers"
-, title =	"{CAD}/{CAM}: {Computer} Aided Design and Manufacturing"
-, publisher =	"Prentice Hall"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "M. P. Groover and E. W. Zimmers"
+, title =       "{CAD}/{CAM}: {Computer} Aided Design and Manufacturing"
+, publisher =   "Prentice Hall"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{g-cgc-30
-, author =	"Harald Gropp"
-, title =	"Configurations between Geometry and Combinatorics"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"30--32"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Harald Gropp"
+, title =       "Configurations between Geometry and Combinatorics"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "30--32"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{gj-oqdsi-80
-, author =	"W. I. Grosky and R. Jain"
-, title =	"On optimizing quadtrees, a data structure for image representation"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Wayne State Univ."
-, address =	"Detroit, MI"
-, year =	1980
+, author =      "W. I. Grosky and R. Jain"
+, title =       "On optimizing quadtrees, a data structure for image representation"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Wayne State Univ."
+, address =     "Detroit, MI"
+, year =        1980
 }
 
 @article{g-vg-74
-, author =	"J. L. Gross"
-, title =	"Voltage graphs"
-, journal =	"Discrete Math."
-, volume =	9
-, year =	1974
-, pages =	"239--246"
+, author =      "J. L. Gross"
+, title =       "Voltage graphs"
+, journal =     "Discrete Math."
+, volume =      9
+, year =        1974
+, pages =       "239--246"
 }
 
 @article{ga-ttcg-74
-, author =	"J. L. Gross and S. R. Alpert"
-, title =	"The topological theory of current graphs"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	17
-, year =	1974
-, pages =	"218--233"
+, author =      "J. L. Gross and S. R. Alpert"
+, title =       "The topological theory of current graphs"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      17
+, year =        1974
+, pages =       "218--233"
 }
 
 @article{gr-ltpa2-79
-, author =	"J. L. Gross and R. H. Rosen"
-, title =	"A linear time planarity algorithm for $2$-complexes"
-, journal =	"J. ACM"
-, volume =	26
-, year =	1979
-, pages =	"611--617"
+, author =      "J. L. Gross and R. H. Rosen"
+, title =       "A linear time planarity algorithm for $2$-complexes"
+, journal =     "J. ACM"
+, volume =      26
+, year =        1979
+, pages =       "611--617"
 }
 
 @book{gt-tgt-87
-, author =	"J. L. Gross and T. W. Tucker"
-, title =	"Topological Graph Theory"
-, publisher =	"John Wiley \& Sons"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "J. L. Gross and T. W. Tucker"
+, title =       "Topological Graph Theory"
+, publisher =   "John Wiley \& Sons"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @article{gt-gagcp-77
-, author =	"J. L. Gross and W. Tucker"
-, title =	"Generating all graph coverings by permutation voltage assignments"
-, journal =	"Discrete Math."
-, volume =	18
-, year =	1977
-, pages =	"273--283"
+, author =      "J. L. Gross and W. Tucker"
+, title =       "Generating all graph coverings by permutation voltage assignments"
+, journal =     "Discrete Math."
+, volume =      18
+, year =        1977
+, pages =       "273--283"
 }
 
 @inproceedings{gpp-odpmr-98
-, author =	"Roberto Grossi and Andrea Pietracaprina and Geppino Pucci"
-, title =	"Optimal Deterministic Protocols for Mobile Robots on a Grid"
-, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '98"
-, site =	"Stockholm"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1432
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"181--192"
-, update =	"99.03 bibrelex, 98.07 mitchell"
+, author =      "Roberto Grossi and Andrea Pietracaprina and Geppino Pucci"
+, title =       "Optimal Deterministic Protocols for Mobile Robots on a Grid"
+, booktitle =   "Proc. 6th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '98"
+, site =        "Stockholm"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1432
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "181--192"
+, update =      "99.03 bibrelex, 98.07 mitchell"
 }
 
 @article{g-orncm-86
-, author =	"D. D. Grossman"
-, title =	"Opportunities for Research on Numerical Control Machining"
-, journal =	"Commun. ACM"
-, volume =	29
-, number =	6
-, month =	jun
-, year =	1986
-, pages =	"515--522"
-, update =	"98.03 bibrelex"
+, author =      "D. D. Grossman"
+, title =       "Opportunities for Research on Numerical Control Machining"
+, journal =     "Commun. ACM"
+, volume =      29
+, number =      6
+, month =       jun
+, year =        1986
+, pages =       "515--522"
+, update =      "98.03 bibrelex"
 }
 
 @article{gb-ompcc-75
-, author =	"D. D. Grossman and M. W. Blasgen"
-, title =	"Orienting mechanical parts by computer-controlled manipulator"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	"SMC-5"
-, number =	5
-, year =	1975
-, pages =	"561--565"
-, update =	"98.07 bibrelex"
+, author =      "D. D. Grossman and M. W. Blasgen"
+, title =       "Orienting mechanical parts by computer-controlled manipulator"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      "SMC-5"
+, number =      5
+, year =        1975
+, pages =       "561--565"
+, update =      "98.07 bibrelex"
 }
 
 @book{gm-gtg-64
-, author =	"I. Grossman and W. Magnus"
-, title =	"Groups and their Graphs"
-, publisher =	"Random House"
-, year =	1964
-, update =	"97.11 bibrelex"
+, author =      "I. Grossman and W. Magnus"
+, title =       "Groups and their Graphs"
+, publisher =   "Random House"
+, year =        1964
+, update =      "97.11 bibrelex"
 }
 
 @book{g-ttn-66
-, author =	"E. Grosswald"
-, title =	"Topics from the Theory of Numbers"
-, publisher =	"Macmillan"
-, address =	"New York, NY"
-, year =	1966
-, update =	"97.11 bibrelex"
+, author =      "E. Grosswald"
+, title =       "Topics from the Theory of Numbers"
+, publisher =   "Macmillan"
+, address =     "New York, NY"
+, year =        1966
+, update =      "97.11 bibrelex"
 }
 
 @book{gls-gaco-88
-, author =	"M. Gr{\"o}tschel and L. Lov{\'a}sz and A. Schrijver"
-, title =	"Geometric Algorithms and Combinatorial Optimization"
-, series =	"Algorithms and Combinatorics"
-, volume =	2
-, publisher =	"Springer-Verlag"
-, address =	"Berlin Heidelberg"
-, year =	1988
-, note =	"2nd edition 1994"
-, update =	"97.11 bibrelex, 97.03 gaertner+salinger"
+, author =      "M. Gr{\"o}tschel and L. Lov{\'a}sz and A. Schrijver"
+, title =       "Geometric Algorithms and Combinatorial Optimization"
+, series =      "Algorithms and Combinatorics"
+, volume =      2
+, publisher =   "Springer-Verlag"
+, address =     "Berlin Heidelberg"
+, year =        1988
+, note =        "2nd edition 1994"
+, update =      "97.11 bibrelex, 97.03 gaertner+salinger"
 }
 
 @incollection{gls-papg
-, author =	"M. Gr{\"o}tschel and L. Lov{\'a}sz and A. Schrijver"
-, title =	"Polynomial Algorithms for Perfect Graphs"
-, editor =	"C. Berge and V. Chv{\'a}tal"
-, booktitle =	"Topics on Perfect Graphs"
-, series =	"Ann. Discrete Math."
-, volume =	21
-, publisher =	"North-Holland"
-, year =	1984
-, update =	"98.11 bibrelex"
+, author =      "M. Gr{\"o}tschel and L. Lov{\'a}sz and A. Schrijver"
+, title =       "Polynomial Algorithms for Perfect Graphs"
+, editor =      "C. Berge and V. Chv{\'a}tal"
+, booktitle =   "Topics on Perfect Graphs"
+, series =      "Ann. Discrete Math."
+, volume =      21
+, publisher =   "North-Holland"
+, year =        1984
+, update =      "98.11 bibrelex"
 }
 
 @article{gls-emicc-81
-, author =	"M. Gr{\"o}tschel and L. Lov{\'a}z and A. Schrijver"
-, title =	"The Ellipsoid Method and its Consequences on Combinatorial Optimization"
-, journal =	"Combinatorica"
-, volume =	1
-, year =	1981
-, pages =	"169--197"
-, update =	"98.03 bibrelex"
+, author =      "M. Gr{\"o}tschel and L. Lov{\'a}z and A. Schrijver"
+, title =       "The Ellipsoid Method and its Consequences on Combinatorial Optimization"
+, journal =     "Combinatorica"
+, volume =      1
+, year =        1981
+, pages =       "169--197"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{gmv-ocmhs-95
-, author =	"Edward F. Grove and T. M. Murali and Jeffrey Scott Vitter"
-, title =	"The Object Complexity Model for Hidden-Surface Elimination"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"273--278"
-, update =	"95.09 jones"
+, author =      "Edward F. Grove and T. M. Murali and Jeffrey Scott Vitter"
+, title =       "The Object Complexity Model for Hidden-Surface Elimination"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "273--278"
+, update =      "95.09 jones"
 }
 
 @article{gmv-ocmhs-99
-, author =	"E. F. Grove and T. M. Murali and J. S. Vitter"
-, title =	"The Object Complexity Model for Hidden-Surface Removal"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, number =	2
-, month =	apr
-, year =	1999
-, pages =	"207--217"
-, update =	"99.07 held+smid"
+, author =      "E. F. Grove and T. M. Murali and J. S. Vitter"
+, title =       "The Object Complexity Model for Hidden-Surface Removal"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, number =      2
+, month =       apr
+, year =        1999
+, pages =       "207--217"
+, update =      "99.07 held+smid"
 }
 
 % pages correct?
 @incollection{g-acb-83
-, author =	"P. M. Gruber"
-, title =	"Approximation of convex bodies"
-, editor =	"Peter M. Gruber and J. M. Wills"
-, booktitle =	"Convexity and its Applications"
-, publisher =	"Birkh{\"a}user"
-, address =	"Basel, Switzerland"
-, year =	1983
-, pages =	"131--162"
-, keywords =	"survey paper"
-, update =	"93.09 milone+mitchell+rote"
+, author =      "P. M. Gruber"
+, title =       "Approximation of convex bodies"
+, editor =      "Peter M. Gruber and J. M. Wills"
+, booktitle =   "Convexity and its Applications"
+, publisher =   "Birkh{\"a}user"
+, address =     "Basel, Switzerland"
+, year =        1983
+, pages =       "131--162"
+, keywords =    "survey paper"
+, update =      "93.09 milone+mitchell+rote"
 }
 
 @incollection{g-aacb-93
-, author =	"P. M. Gruber"
-, title =	"Aspects of approximation of convex bodies"
-, chapter =	"1.10"
-, editor =	"Peter M. Gruber and J. M. Wills"
-, booktitle =	"Handbook of Convex Geometry"
-, volume =	"A"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1993
-, pages =	"319--345"
-, keywords =	"survey paper"
-, update =	"93.09 rote"
+, author =      "P. M. Gruber"
+, title =       "Aspects of approximation of convex bodies"
+, chapter =     "1.10"
+, editor =      "Peter M. Gruber and J. M. Wills"
+, booktitle =   "Handbook of Convex Geometry"
+, volume =      "A"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1993
+, pages =       "319--345"
+, keywords =    "survey paper"
+, update =      "93.09 rote"
 }
 
 @incollection{g-hc-93
-, author =	"P. M. Gruber"
-, title =	"History of Convexity"
-, editor =	"P. M. Gruber and J. M. Wills"
-, booktitle =	"Handbook of Convex Geometry"
-, publisher =	"North-Holland"
-, year =	1993
-, update =	"99.11 bibrelex, 97.03 pocchiola"
+, author =      "P. M. Gruber"
+, title =       "History of Convexity"
+, editor =      "P. M. Gruber and J. M. Wills"
+, booktitle =   "Handbook of Convex Geometry"
+, publisher =   "North-Holland"
+, year =        1993
+, update =      "99.11 bibrelex, 97.03 pocchiola"
 }
 
 @book{gl-gn-87
-, author =	"Peter M. Gruber and C. G. Lekkerkerker"
-, title =	"Geometry of Numbers"
-, edition =	"2nd"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1987
-, succeeds =	"l-gn-69"
-, update =	"93.09 rote"
+, author =      "Peter M. Gruber and C. G. Lekkerkerker"
+, title =       "Geometry of Numbers"
+, edition =     "2nd"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1987
+, succeeds =    "l-gn-69"
+, update =      "93.09 rote"
 }
 
 @book{gw-cia-83
-, title =	"Convexity and its Applications"
-, editor =	"Peter M. Gruber and J. M. Wills"
-, publisher =	"Birkh{\"a}user"
-, address =	"Basel, Switzerland"
-, year =	1983
-, keywords =	"collection, survey papers"
-, update =	"93.09 rote"
+, title =       "Convexity and its Applications"
+, editor =      "Peter M. Gruber and J. M. Wills"
+, publisher =   "Birkh{\"a}user"
+, address =     "Basel, Switzerland"
+, year =        1983
+, keywords =    "collection, survey papers"
+, update =      "93.09 rote"
 }
 
 @book{gw-hcg-93a
-, title =	"Handbook of Convex Geometry"
-, editor =	"Peter M. Gruber and J. M. Wills"
-, volume =	"A"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1993
-, keywords =	"collection, survey papers"
-, update =	"93.09 rote"
+, title =       "Handbook of Convex Geometry"
+, editor =      "Peter M. Gruber and J. M. Wills"
+, volume =      "A"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1993
+, keywords =    "collection, survey papers"
+, update =      "93.09 rote"
 }
 
 @book{gw-hcg-93b
-, title =	"Handbook of Convex Geometry"
-, editor =	"Peter M. Gruber and J. M. Wills"
-, volume =	"B"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1993
-, keywords =	"collection, survey papers"
-, update =	"93.09 rote"
+, title =       "Handbook of Convex Geometry"
+, editor =      "Peter M. Gruber and J. M. Wills"
+, volume =      "B"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1993
+, keywords =    "collection, survey papers"
+, update =      "93.09 rote"
 }
 
 @article{g-pvc-56
-, author =	"B. Gr{\"u}nbaum"
-, title =	"A proof of {V{\'a}zsonyi}'s conjecture"
-, journal =	"Bull. Research Council Israel, Section A"
-, volume =	6
-, year =	1956
-, pages =	"77--78"
-, update =	"96.09 agarwal, 96.05 agarwal"
+, author =      "B. Gr{\"u}nbaum"
+, title =       "A proof of {V{\'a}zsonyi}'s conjecture"
+, journal =     "Bull. Research Council Israel, Section A"
+, volume =      6
+, year =        1956
+, pages =       "77--78"
+, update =      "96.09 agarwal, 96.05 agarwal"
 }
 
 @book{g-as-72
-, author =	"B. Gr{\"u}nbaum"
-, title =	"Arrangements and Spreads"
-, series =	"Regional Conf. Ser. Math."
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1972
-, update =	"98.03 agarwal"
+, author =      "B. Gr{\"u}nbaum"
+, title =       "Arrangements and Spreads"
+, series =      "Regional Conf. Ser. Math."
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1972
+, update =      "98.03 agarwal"
 }
 
 @article{g-ah-71
-, author =	"B. Gr{\"u}nbaum"
-, title =	"Arrangements of hyperplanes"
-, journal =	"Congr. Numer."
-, volume =	3
-, year =	1971
-, pages =	"41--106"
-, comments =	"Louisiana Conf. on Comb., Graph Theory \& Comput."
+, author =      "B. Gr{\"u}nbaum"
+, title =       "Arrangements of hyperplanes"
+, journal =     "Congr. Numer."
+, volume =      3
+, year =        1971
+, pages =       "41--106"
+, comments =    "Louisiana Conf. on Comb., Graph Theory \& Comput."
 }
 
 @book{g-cp-67
-, author =	"B. Gr{\"u}nbaum"
-, title =	"Convex Polytopes"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1967
-, update =	"99.11 bibrelex"
+, author =      "B. Gr{\"u}nbaum"
+, title =       "Convex Polytopes"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1967
+, update =      "99.11 bibrelex"
 }
 
 @article{g-hcp-95
-, author =	"B. Gr{\"u}nbaum"
-, title =	"How to convexify a polygon"
-, journal =	"Geombinatorics"
-, volume =	5
-, month =	jul
-, year =	1995
-, pages =	"24--30"
-, update =	"98.11 orourke"
+, author =      "B. Gr{\"u}nbaum"
+, title =       "How to convexify a polygon"
+, journal =     "Geombinatorics"
+, volume =      5
+, month =       jul
+, year =        1995
+, pages =       "24--30"
+, update =      "98.11 orourke"
 }
 
 @techreport{g-lcg-74
-, author =	"B. Gr{\"u}nbaum"
-, title =	"Lectures on Combinatorial Geometry"
-, type =	"Mimeographed {Note}"
-, institution =	"Univ. Washington"
-, address =	"Seattle, WA"
-, year =	1974
-, update =	"97.11 bibrelex"
+, author =      "B. Gr{\"u}nbaum"
+, title =       "Lectures on Combinatorial Geometry"
+, type =        "Mimeographed {Note}"
+, institution = "Univ. Washington"
+, address =     "Seattle, WA"
+, year =        1974
+, update =      "97.11 bibrelex"
 }
 
 @article{g-ts-55
-, author =	"B. Gr{\"u}nbaum"
-, title =	"On a theorem of L. A. Santalo"
-, journal =	"Pacific J. Math."
-, volume =	5
-, year =	1955
-, pages =	"351--359"
-, update =	"98.03 bibrelex"
+, author =      "B. Gr{\"u}nbaum"
+, title =       "On a theorem of L. A. Santalo"
+, journal =     "Pacific J. Math."
+, volume =      5
+, year =        1955
+, pages =       "351--359"
+, update =      "98.03 bibrelex"
 }
 
 @article{g-ct-58
-, author =	"B. Gr{\"u}nbaum"
-, title =	"On common transversals"
-, journal =	"Arch. Math."
-, volume =	9
-, year =	1958
-, pages =	"465--469"
+, author =      "B. Gr{\"u}nbaum"
+, title =       "On common transversals"
+, journal =     "Arch. Math."
+, volume =      9
+, year =        1958
+, pages =       "465--469"
 }
 
 @article{g-iss-59
-, author =	"B. Gr{\"u}nbaum"
-, title =	"On intersections of similar sets"
-, journal =	"Portugal Math."
-, volume =	18
-, year =	1959
-, pages =	"155--164"
-, update =	"97.11 bibrelex"
+, author =      "B. Gr{\"u}nbaum"
+, title =       "On intersections of similar sets"
+, journal =     "Portugal Math."
+, volume =      18
+, year =        1959
+, pages =       "155--164"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{g-ibs-70
-, author =	"B. Gr{\"u}nbaum"
-, title =	"The importance of being straight"
-, booktitle =	"Proceedings of the 12th Biennial Seminar of the Canadian Mathematical Congress on TimeSeries and Stochastic Processes; Convexity and Combinatorics"
-, year =	1970
-, pages =	"243--254"
-, update =	"98.03 bibrelex"
+, author =      "B. Gr{\"u}nbaum"
+, title =       "The importance of being straight"
+, booktitle =   "Proceedings of the 12th Biennial Seminar of the Canadian Mathematical Congress on TimeSeries and Stochastic Processes; Convexity and Combinatorics"
+, year =        1970
+, pages =       "243--254"
+, update =      "98.03 bibrelex"
 }
 
 @article{gm-csfs-61
-, author =	"B. Gr{\"u}nbaum and T. S. Motzkin"
-, title =	"On components in some families of sets"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	12
-, year =	1961
-, pages =	"607--613"
-, update =	"98.03 bibrelex"
+, author =      "B. Gr{\"u}nbaum and T. S. Motzkin"
+, title =       "On components in some families of sets"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      12
+, year =        1961
+, pages =       "607--613"
+, update =      "98.03 bibrelex"
 }
 
 @article{gs-rwnpc-90
-, author =	"B. Gr{\"u}nbaum and G. C. Shephard"
-, title =	"Rotation and winding numbers for polygons and curves"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	322
-, number =	1
-, year =	1990
-, pages =	"169--187"
-, update =	"98.11 bibrelex"
+, author =      "B. Gr{\"u}nbaum and G. C. Shephard"
+, title =       "Rotation and winding numbers for polygons and curves"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      322
+, number =      1
+, year =        1990
+, pages =       "169--187"
+, update =      "98.11 bibrelex"
 }
 
 @article{gs-spp-87
-, author =	"B. Gr{\"u}nbaum and G. C. Shephard"
-, title =	"Some problems on polyhedra"
-, journal =	"J. Geom."
-, volume =	29
-, number =	2
-, month =	aug
-, year =	1987
-, pages =	"182--190"
-, update =	"97.11 bibrelex"
+, author =      "B. Gr{\"u}nbaum and G. C. Shephard"
+, title =       "Some problems on polyhedra"
+, journal =     "J. Geom."
+, volume =      29
+, number =      2
+, month =       aug
+, year =        1987
+, pages =       "182--190"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gs-gpg-81
-, author =	"B. Gr{\"u}nbaum and G. C. Shephard"
-, title =	"The geometry of planar graphs"
-, booktitle =	"Proc. 8-th British Combinatorial Conference"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "B. Gr{\"u}nbaum and G. C. Shephard"
+, title =       "The geometry of planar graphs"
+, booktitle =   "Proc. 8-th British Combinatorial Conference"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @book{gs-tp-87
-, author =	"B. Gr{\"u}nbaum and G. C. Shephard"
-, title =	"Tilings and Patterns"
-, publisher =	"W. H. Freeman"
-, address =	"New York, NY"
-, year =	1987
+, author =      "B. Gr{\"u}nbaum and G. C. Shephard"
+, title =       "Tilings and Patterns"
+, publisher =   "W. H. Freeman"
+, address =     "New York, NY"
+, year =        1987
 }
 
 @techreport{gz-cpff-98
-, author =	"Branko Gr{\"u}nbaum and Joseph Zaks"
-, title =	"Convexification of polygons by flips and by flipturns"
-, number =	"6/4/98"
-, institution =	"Department of Mathematics, University of Washington"
-, address =	"Seattle"
-, year =	1998
-, update =	"02.03 orourke"
+, author =      "Branko Gr{\"u}nbaum and Joseph Zaks"
+, title =       "Convexification of polygons by flips and by flipturns"
+, number =      "6/4/98"
+, institution = "Department of Mathematics, University of Washington"
+, address =     "Seattle"
+, year =        1998
+, update =      "02.03 orourke"
 }
 
 @article{g-dcrcf-57
-, author =	"A. Grzegorczyk"
-, title =	"On the definition of computable real continuous functions"
-, journal =	"Fund. math."
-, volume =	44
-, year =	1957
-, pages =	"61--71"
-, update =	"98.11 bibrelex"
+, author =      "A. Grzegorczyk"
+, title =       "On the definition of computable real continuous functions"
+, journal =     "Fund. math."
+, volume =      44
+, year =        1957
+, pages =       "61--71"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{gm-radhd-89
-, author =	"D. J. Gschwind and T. P. Murtagh"
-, title =	"A Recursive Algorithm for Drawing Hierarchical Directed Graphs"
-, number =	"CS-89-02"
-, institution =	"Department of Computer Science, Williams College"
-, year =	1989
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. J. Gschwind and T. P. Murtagh"
+, title =       "A Recursive Algorithm for Drawing Hierarchical Directed Graphs"
+, number =      "CS-89-02"
+, institution = "Department of Computer Science, Williams College"
+, year =        1989
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{gchhzy-otmo-92
-, author =	"C. Gu and S. Campbell and J. Hong and Q. He and D. Zhang and P. Yeh"
-, title =	"Optical thresholding and maximum operations"
-, journal =	"Appl. Optics"
-, volume =	31
-, number =	26
-, year =	1992
-, pages =	"5661--5665"
-, update =	"98.11 bibrelex"
+, author =      "C. Gu and S. Campbell and J. Hong and Q. He and D. Zhang and P. Yeh"
+, title =       "Optical thresholding and maximum operations"
+, journal =     "Appl. Optics"
+, volume =      31
+, number =      26
+, year =        1992
+, pages =       "5661--5665"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{gh-ecbcp-00
-, author =	"Roser Gu{\`a}rdia and Ferran Hurtado"
-, title =	"On the Equipartitions of Convex Bodies and Convex Polygons"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"47--50"
-, update =	"00.03 bibrelex"
+, author =      "Roser Gu{\`a}rdia and Ferran Hurtado"
+, title =       "On the Equipartitions of Convex Bodies and Convex Polygons"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "47--50"
+, update =      "00.03 bibrelex"
 }
 
 @article{gk-shfmp-70
-, author =	"M. D. Guay and D. C. Kay"
-, title =	"On sets having finitely many points of local nonconvexity"
-, journal =	"Israel J. Math."
-, volume =	"??"
-, year =	1970
-, pages =	"39--52"
-, update =	"97.11 bibrelex"
+, author =      "M. D. Guay and D. C. Kay"
+, title =       "On sets having finitely many points of local nonconvexity"
+, journal =     "Israel J. Math."
+, volume =      "??"
+, year =        1970
+, pages =       "39--52"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{gl-faatn-97
-, author =	"Joachim Gudmundsson and Christos Levcopoulos"
-, title =	"A Fast Approximation Algorithm for {TSP} with Neighborhoods"
-, type =	"Technical Report"
-, number =	"LU-CS-TR:97-195"
-, institution =	"Dept. of Comp. Sci., Lund University"
-, year =	1997
-, update =	"98.03 mitchell"
+, author =      "Joachim Gudmundsson and Christos Levcopoulos"
+, title =       "A Fast Approximation Algorithm for {TSP} with Neighborhoods"
+, type =        "Technical Report"
+, number =      "LU-CS-TR:97-195"
+, institution = "Dept. of Comp. Sci., Lund University"
+, year =        1997
+, update =      "98.03 mitchell"
 }
 
 @article{gl-faatn-99
-, author =	"J. Gudmundsson and C. Levcopoulos"
-, title =	"A Fast Approximation Algorithm for {TSP} with Neighborhoods"
-, journal =	"Nordic J. Comput."
-, volume =	6
-, year =	1999
-, pages =	"469--488"
-, update =	"01.11 smid"
+, author =      "J. Gudmundsson and C. Levcopoulos"
+, title =       "A Fast Approximation Algorithm for {TSP} with Neighborhoods"
+, journal =     "Nordic J. Comput."
+, volume =      6
+, year =        1999
+, pages =       "469--488"
+, update =      "01.11 smid"
 }
 
 @article{gl-paamw-00
-, author =	"J. Gudmundsson and C. Levcopoulos"
-, title =	"A Parallel Approximation Algorithm for Minimum Weight Triangulation"
-, journal =	"Nordic J. Comput."
-, volume =	7
-, year =	2000
-, pages =	"32--57"
-, update =	"01.11 smid"
+, author =      "J. Gudmundsson and C. Levcopoulos"
+, title =       "A Parallel Approximation Algorithm for Minimum Weight Triangulation"
+, journal =     "Nordic J. Comput."
+, volume =      7
+, year =        2000
+, pages =       "32--57"
+, update =      "01.11 smid"
 }
 
 @article{gln-ammn-01
-, author =	"J. Gudmundsson and C. Levcopoulos and G. Narasimhan"
-, title =	"Approximating a minimum {Manhattan} network"
-, journal =	"Nordic J. Comput."
-, volume =	8
-, year =	2001
-, pages =	"219--232"
-, update =	"01.11 smid"
+, author =      "J. Gudmundsson and C. Levcopoulos and G. Narasimhan"
+, title =       "Approximating a minimum {Manhattan} network"
+, journal =     "Nordic J. Comput."
+, volume =      8
+, year =        2001
+, pages =       "219--232"
+, update =      "01.11 smid"
 }
 
 @inproceedings{gln-igacs-00
-, author =	"J. Gudmundsson and C. Levcopoulos and G. Narasimhan"
-, title =	"Improved greedy algorithms for constructing sparse geometric spanners"
-, booktitle =	"Proc. 7th Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1851
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	2000
-, pages =	"314--327"
-, update =	"00.11 smid"
+, author =      "J. Gudmundsson and C. Levcopoulos and G. Narasimhan"
+, title =       "Improved greedy algorithms for constructing sparse geometric spanners"
+, booktitle =   "Proc. 7th Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1851
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        2000
+, pages =       "314--327"
+, update =      "00.11 smid"
 }
 
 @inproceedings{glns-adogg-02
-, author =	"J. Gudmundsson and C. Levcopoulos and G. Narasimhan and M. Smid"
-, title =	"Approximate distance oracles for geometric graphs"
-, booktitle =	"Proc. 13th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '02"
-, year =	2002
-, pages =	"828--837"
-, update =	"02.03 smid"
+, author =      "J. Gudmundsson and C. Levcopoulos and G. Narasimhan and M. Smid"
+, title =       "Approximate distance oracles for geometric graphs"
+, booktitle =   "Proc. 13th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '02"
+, year =        2002
+, pages =       "828--837"
+, update =      "02.03 smid"
 }
 
 @article{g-rst-83
-, author =	"A. Gu{\'e}noche"
-, title =	"Random spanning tree"
-, journal =	"J. Algorithms"
-, volume =	4
-, year =	1983
-, pages =	"214--220"
+, author =      "A. Gu{\'e}noche"
+, title =       "Random spanning tree"
+, journal =     "J. Algorithms"
+, volume =      4
+, year =        1983
+, pages =       "214--220"
 }
 
 @inproceedings{gs-rellt-92
-, author =	"E. Guevremont and J. Snoeyink"
-, title =	"Recognizing an Envelope of Lines in Linear Time"
-, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '92"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	650
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"370--377"
-, update =	"94.09 smid, 93.09 milone+mitchell"
+, author =      "E. Guevremont and J. Snoeyink"
+, title =       "Recognizing an Envelope of Lines in Linear Time"
+, booktitle =   "Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '92"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      650
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "370--377"
+, update =      "94.09 smid, 93.09 milone+mitchell"
 }
 
 @book{g-agglc-77
-, author =	"H. W. Guggenheimer"
-, title =	"Applicable Geometry: global and local convexity"
-, publisher =	"R. E. Krieger"
-, address =	"Huntington, NY"
-, year =	1977
-, update =	"98.07 orourke"
+, author =      "H. W. Guggenheimer"
+, title =       "Applicable Geometry: global and local convexity"
+, publisher =   "R. E. Krieger"
+, address =     "Huntington, NY"
+, year =        1977
+, update =      "98.07 orourke"
 }
 
 @book{g-dg-63
-, author =	"H. W. Guggenheimer"
-, title =	"Differential Geometry"
-, publisher =	"McGraw-Hill"
-, address =	"New York, NY"
-, year =	1963
-, update =	"01.04 icking, 00.11 smid, 00.07 orourke, 97.11 bibrelex"
+, author =      "H. W. Guggenheimer"
+, title =       "Differential Geometry"
+, publisher =   "McGraw-Hill"
+, address =     "New York, NY"
+, year =        1963
+, update =      "01.04 icking, 00.11 smid, 00.07 orourke, 97.11 bibrelex"
 }
 
 @article{g-opaue-93
-, author =	"S. Guha"
-, title =	"An optimal parallel algorithm using exclusive read/writes for the rectilinear {Voronoi} diagram"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, number =	""
-, year =	1993
-, pages =	"37--52"
-, keywords =	"parallel algorithm, rectilinear metric, Voronoi diagram"
-, update =	"93.09 guha"
+, author =      "S. Guha"
+, title =       "An optimal parallel algorithm using exclusive read/writes for the rectilinear {Voronoi} diagram"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, number =      ""
+, year =        1993
+, pages =       "37--52"
+, keywords =    "parallel algorithm, rectilinear metric, Voronoi diagram"
+, update =      "93.09 guha"
 }
 
 @inproceedings{g-omcas-93
-, author =	"Sumanta Guha"
-, title =	"Optimal Mesh Computer Algorithms for Simple Polygons"
-, booktitle =	"Proc. 7th IEEE Internat. Parallel Process. Sympos."
-, publisher =	"IEEE Computer Society"
-, year =	1993
-, pages =	"182--187"
-, update =	"93.09 guha"
+, author =      "Sumanta Guha"
+, title =       "Optimal Mesh Computer Algorithms for Simple Polygons"
+, booktitle =   "Proc. 7th IEEE Internat. Parallel Process. Sympos."
+, publisher =   "IEEE Computer Society"
+, year =        1993
+, pages =       "182--187"
+, update =      "93.09 guha"
 }
 
 @inproceedings{g-paapp-93
-, author =	"Sumanta Guha"
-, title =	"Parallel Analog Algorithms for Processing Polygonal Images on a Systolic Screen"
-, booktitle =	"Proc. 7th IEEE Internat. Parallel Process. Sympos."
-, publisher =	"IEEE Computer Society"
-, year =	1993
-, pages =	"557--562"
-, update =	"93.09 guha"
+, author =      "Sumanta Guha"
+, title =       "Parallel Analog Algorithms for Processing Polygonal Images on a Systolic Screen"
+, booktitle =   "Proc. 7th IEEE Internat. Parallel Process. Sympos."
+, publisher =   "IEEE Computer Society"
+, year =        1993
+, pages =       "557--562"
+, update =      "93.09 guha"
 }
 
 @techreport{g-pcief-91
-, author =	"S. Guha"
-, title =	"Parallel computation of internal and external farthest neighbors in simple polygons"
-, type =	"Manuscript"
-, institution =	"EECS Dept., Univ. Michigan"
-, address =	"Ann Arbor, MI"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "S. Guha"
+, title =       "Parallel computation of internal and external farthest neighbors in simple polygons"
+, type =        "Manuscript"
+, institution = "EECS Dept., Univ. Michigan"
+, address =     "Ann Arbor, MI"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @article{g-pcief-92
-, author =	"S. Guha"
-, title =	"Parallel computation of internal and external farthest neighbours in simple polygons"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	2
-, year =	1992
-, pages =	"175--190"
-, keywords =	"parallel algorithm, simple polygons, farthest neighbors"
+, author =      "S. Guha"
+, title =       "Parallel computation of internal and external farthest neighbours in simple polygons"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      2
+, year =        1992
+, pages =       "175--190"
+, keywords =    "parallel algorithm, simple polygons, farthest neighbors"
 }
 
 @techreport{ghlst-ltavs-86t
-, author =	"L. Guibas and J. Hershberger and D. Leven and M. Sharir and R. E. Tarjan"
-, title =	"Linear time algorithm for visibility and shortest path problems inside a triangulated simple polygon"
-, type =	"Technical {Report}"
-, number =	218
-, institution =	"Dept. Comput Sci., Courant Institute"
-, address =	"New York, NY"
-, month =	apr
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "L. Guibas and J. Hershberger and D. Leven and M. Sharir and R. E. Tarjan"
+, title =       "Linear time algorithm for visibility and shortest path problems inside a triangulated simple polygon"
+, type =        "Technical {Report}"
+, number =      218
+, institution = "Dept. Comput Sci., Courant Institute"
+, address =     "New York, NY"
+, month =       apr
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @unpublished{ghs-btdsc-88
-, author =	"L. Guibas and J. Hershberger and J. Snoeyink"
-, title =	"Bridge trees: a data structure for convex hulls"
-, year =	1988
-, note =	"In preparation"
-, update =	"98.03 bibrelex"
+, author =      "L. Guibas and J. Hershberger and J. Snoeyink"
+, title =       "Bridge trees: a data structure for convex hulls"
+, year =        1988
+, note =        "In preparation"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ghsz-kcud-00
-, author =	"Leonidas Guibas and John Hershberger and Subash Suri and Li Zhang"
-, title =	"Kinetic Connectivity for Unit Disks"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"331--340"
-, update =	"00.11 jones"
+, author =      "Leonidas Guibas and John Hershberger and Subash Suri and Li Zhang"
+, title =       "Kinetic Connectivity for Unit Disks"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "331--340"
+, update =      "00.11 jones"
 }
 
 @inproceedings{gm-rad-95
-, author =	"Leonidas Guibas and David Marimont"
-, title =	"Rounding Arrangements Dynamically"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"190--199"
-, keywords =	"robustness, randomized incremental algorithm"
-, precedes =	"gm-rad-98"
-, cites =	"bo-arcgi-79, ce-oails-92, cs-arscg-89,  f-smpst-89, fm-nsala-91, g-ilsi-, gy-frcg-86, h-psifp-94, hhk-tirgc-88, m-grs-93, m-vigau-88p, m-fppa-90, m-cgitr-93, gss-egbra-89, si-gafpa-88, ZZZ"
-, update =	"98.11 devillers, 98.03 bibrelex, 95.09 mitchell"
+, author =      "Leonidas Guibas and David Marimont"
+, title =       "Rounding Arrangements Dynamically"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "190--199"
+, keywords =    "robustness, randomized incremental algorithm"
+, precedes =    "gm-rad-98"
+, cites =       "bo-arcgi-79, ce-oails-92, cs-arscg-89,  f-smpst-89, fm-nsala-91, g-ilsi-, gy-frcg-86, h-psifp-94, hhk-tirgc-88, m-grs-93, m-vigau-88p, m-fppa-90, m-cgitr-93, gss-egbra-89, si-gafpa-88, ZZZ"
+, update =      "98.11 devillers, 98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{gm-rad-98
-, author =	"Leonidas Guibas and David Marimont"
-, title =	"Rounding Arrangements Dynamically"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"157--176"
-, succeeds =	"gm-rad-95"
-, update =	"98.11 devillers"
+, author =      "Leonidas Guibas and David Marimont"
+, title =       "Rounding Arrangements Dynamically"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "157--176"
+, succeeds =    "gm-rad-95"
+, update =      "98.11 devillers"
 }
 
 @techreport{gos-ilsrs-88t
-, author =	"L. Guibas and M. H. Overmars and M. Sharir"
-, title =	"Intersecting line segments, ray shooting and other applications of geometric partitioning techniques"
-, number =	"RUU-CS-88"
-, institution =	"Dept. Computer Science, University of Utrecht"
-, year =	1988
-, update =	"98.07 agarwal, 98.03 bibrelex"
+, author =      "L. Guibas and M. H. Overmars and M. Sharir"
+, title =       "Intersecting line segments, ray shooting and other applications of geometric partitioning techniques"
+, number =      "RUU-CS-88"
+, institution = "Dept. Computer Science, University of Utrecht"
+, year =        1988
+, update =      "98.07 agarwal, 98.03 bibrelex"
 }
 
 @techreport{gp-narlp-92
-, author =	"L. Guibas and M. Pellegrini"
-, title =	"New algorithmic results for lines-in-3-space problems"
-, type =	"Technical Report"
-, number =	"TR-92-005"
-, institution =	"Int. Comput. Sci. Institute"
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "L. Guibas and M. Pellegrini"
+, title =       "New algorithmic results for lines-in-3-space problems"
+, type =        "Technical Report"
+, number =      "TR-92-005"
+, institution = "Int. Comput. Sci. Institute"
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @techreport{gs-lncg-83
-, author =	"L. Guibas and J. Stolfi"
-, title =	"Lecture notes on computational geometry"
-, number =	"CS 445"
-, institution =	"Stanford University"
-, address =	"Stanford, California"
-, year =	1983
-, update =	"98.07 bibrelex"
+, author =      "L. Guibas and J. Stolfi"
+, title =       "Lecture notes on computational geometry"
+, number =      "CS 445"
+, institution = "Stanford University"
+, address =     "Stanford, California"
+, year =        1983
+, update =      "98.07 bibrelex"
 }
 
 @techreport{gs-pms-
-, author =	"L. Guibas and J. Stolfi"
-, title =	"Primitives for the Manipulation of Subdivisions"
-, type =	"Technical {Report}"
-, institution =	"DEC"
-, year =	"??"
-, update =	"98.03 bibrelex"
+, author =      "L. Guibas and J. Stolfi"
+, title =       "Primitives for the Manipulation of Subdivisions"
+, type =        "Technical {Report}"
+, institution = "DEC"
+, year =        "??"
+, update =      "98.03 bibrelex"
 }
 
 @article{g-cgvpi-??
-, author =	"Leonidas J. Guibas"
-, title =	"Computational geometry and visualization: {Problems} at the interface"
-, journal =	"??"
-, volume =	"??"
-, year =	"??"
-, pages =	"45--59"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "Leonidas J. Guibas"
+, title =       "Computational geometry and visualization: {Problems} at the interface"
+, journal =     "??"
+, volume =      "??"
+, year =        "??"
+, pages =       "45--59"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @inproceedings{g-igar-96
-, author =	"Leonidas J. Guibas"
-, title =	"Implementing Geometric Algorithms Robustly"
-, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
-, site =	"Philadelphia, PA, USA"
-, month =	may
-, year =	1996
-, pages =	"24--28"
-, update =	"98.03 mitchell, 97.11 held"
+, author =      "Leonidas J. Guibas"
+, title =       "Implementing Geometric Algorithms Robustly"
+, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
+, site =        "Philadelphia, PA, USA"
+, month =       may
+, year =        1996
+, pages =       "24--28"
+, update =      "98.03 mitchell, 97.11 held"
 }
 
 @incollection{g-kdssar-98
-, author =	"L. J. Guibas"
-, title =	"Kinetic data structures --- a state of the art report"
-, editor =	"P. K. Agarwal and L. E. Kavraki and M. Mason"
-, booktitle =	"Proc. Workshop Algorithmic Found. Robot."
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1998
-, pages =	"191--209"
-, update =	"00.03 agarwal"
+, author =      "L. J. Guibas"
+, title =       "Kinetic data structures --- a state of the art report"
+, editor =      "P. K. Agarwal and L. E. Kavraki and M. Mason"
+, booktitle =   "Proc. Workshop Algorithmic Found. Robot."
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1998
+, pages =       "191--209"
+, update =      "00.03 agarwal"
 }
 
 @inproceedings{g-mgcco-97
-, author =	"Leonidas J. Guibas"
-, title =	"Maintenance of Geometric Configurations under Continuous Object Motion"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	10
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Leonidas J. Guibas"
+, title =       "Maintenance of Geometric Configurations under Continuous Object Motion"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       10
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{ag-dgsmi-96
-, author =	"Leonidas J. Guibas and Helmut Alt"
-, title =	"Discrete Geometric Shapes: {Matching}, Interpolation, and Approximation"
-, number =	"Report B 96-11"
-, institution =	"Institut {f\"ur} Informatik, Freie Universit{\"a}t Berlin"
-, year =	1996
-, url =	"https://www.inf.fu-berlin.de/pub/reports/tr-b-96-11.ps.gz, https://www.inf.fu-berlin.de/inst/pubs/tr-b-96-11.abstract.html"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and Helmut Alt"
+, title =       "Discrete Geometric Shapes: {Matching}, Interpolation, and Approximation"
+, number =      "Report B 96-11"
+, institution = "Institut {f\"ur} Informatik, Freie Universit{\"a}t Berlin"
+, year =        1996
+, url = "https://www.inf.fu-berlin.de/pub/reports/tr-b-96-11.ps.gz, https://www.inf.fu-berlin.de/inst/pubs/tr-b-96-11.abstract.html"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ghhlw-sepap-95
-, author =	"Leonidas J. Guibas and D. Halperin and H. Hirukawa and J.-C. Latombe and R. H. Wilson"
-, title =	"A simple and efficient procedure for assembly partitioning under infinitesimal motions"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1995
-, pages =	"2553--2560"
-, keywords =	"robotics, assembly planning, separability, polytopes"
-, update =	"98.03 mitchell, 95.09 halperin"
+, author =      "Leonidas J. Guibas and D. Halperin and H. Hirukawa and J.-C. Latombe and R. H. Wilson"
+, title =       "A simple and efficient procedure for assembly partitioning under infinitesimal motions"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1995
+, pages =       "2553--2560"
+, keywords =    "robotics, assembly planning, separability, polytopes"
+, update =      "98.03 mitchell, 95.09 halperin"
 }
 
 @article{ghhlw-papum-98
-, author =	"Leonidas J. Guibas and D. Halperin and H. Hirukawa and J.-C. Latombe and R. H. Wilson"
-, title =	"Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"179--200"
-, update =	"98.11 devillers"
+, author =      "Leonidas J. Guibas and D. Halperin and H. Hirukawa and J.-C. Latombe and R. H. Wilson"
+, title =       "Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "179--200"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{ghms-vdahf-93
-, author =	"Leonidas J. Guibas and D. Halperin and J. Matou{\v s}ek and Micha Sharir"
-, title =	"On vertical decomposition of arrangements of hyperplanes in four dimensions"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"127--132"
-, cites =	"c-racpq-88, ams-sscch-91, a-caecc-87, cegs-sessr-91, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 96.09 agarwal, 93.09 milone+mitchell"
+, author =      "Leonidas J. Guibas and D. Halperin and J. Matou{\v s}ek and Micha Sharir"
+, title =       "On vertical decomposition of arrangements of hyperplanes in four dimensions"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "127--132"
+, cites =       "c-racpq-88, ams-sscch-91, a-caecc-87, cegs-sessr-91, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 96.09 agarwal, 93.09 milone+mitchell"
 }
 
 @article{ghms-vdahf-95
-, author =	"Leonidas J. Guibas and D. Halperin and J. Matou{\v s}ek and Micha Sharir"
-, title =	"On vertical decomposition of arrangements of hyperplanes in four dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	14
-, year =	1995
-, pages =	"113--122"
-, update =	"98.03 mitchell, 97.11 aronov"
+, author =      "Leonidas J. Guibas and D. Halperin and J. Matou{\v s}ek and Micha Sharir"
+, title =       "On vertical decomposition of arrangements of hyperplanes in four dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      14
+, year =        1995
+, pages =       "113--122"
+, update =      "98.03 mitchell, 97.11 aronov"
 }
 
 @article{gh-cvgnl-85
-, author =	"Leonidas J. Guibas and J. Hershberger"
-, title =	"Computing the visibility graph of $n$ line segments in {$O(n^{2})$} time"
-, journal =	"Bull. EATCS"
-, volume =	26
-, year =	1985
-, pages =	"13--20"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and J. Hershberger"
+, title =       "Computing the visibility graph of $n$ line segments in {$O(n^{2})$} time"
+, journal =     "Bull. EATCS"
+, volume =      26
+, year =        1985
+, pages =       "13--20"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{gh-msp-94
-, author =	"Leonidas J. Guibas and J. Hershberger"
-, title =	"Morphing Simple Polygons"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"267--276"
-, cites =	"cr-tgsps-85, cw-nstsm-82, kr-sidc-92, sgwm-2dsbi-93, sg-pba2d-92, stt-rdthg-86, t-dpg-83, v-gpga-86, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "Leonidas J. Guibas and J. Hershberger"
+, title =       "Morphing Simple Polygons"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "267--276"
+, cites =       "cr-tgsps-85, cw-nstsm-82, kr-sidc-92, sgwm-2dsbi-93, sg-pba2d-92, stt-rdthg-86, t-dpg-83, v-gpga-86, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @inproceedings{gh-ospqs-87
-, author =	"Leonidas J. Guibas and J. Hershberger"
-, title =	"Optimal shortest path queries in a simple polygon"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"50--63"
-, precedes =	"gh-ospqs-89"
-, cites =	"aaghi-vdp-86, akmsw-gamsa-86, bt-ladts-86, egs-oplms-86, c-tpca-82, cg-vippg-85, ghlst-ltavs-86, lp-esppr-84, ol-mcp-81, ps-cgi-85, rs-spesp-85, s-agfnp-87, tv-otats-86, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Leonidas J. Guibas and J. Hershberger"
+, title =       "Optimal shortest path queries in a simple polygon"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "50--63"
+, precedes =    "gh-ospqs-89"
+, cites =       "aaghi-vdp-86, akmsw-gamsa-86, bt-ladts-86, egs-oplms-86, c-tpca-82, cg-vippg-85, ghlst-ltavs-86, lp-esppr-84, ol-mcp-81, ps-cgi-85, rs-spesp-85, s-agfnp-87, tv-otats-86, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{gh-ospqs-89
-, author =	"Leonidas J. Guibas and J. Hershberger"
-, title =	"Optimal shortest path queries in a simple polygon"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	39
-, number =	2
-, month =	oct
-, year =	1989
-, pages =	"126--152"
-, succeeds =	"gh-ospqs-87"
-, update =	"01.04 icking, 98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex"
+, author =      "Leonidas J. Guibas and J. Hershberger"
+, title =       "Optimal shortest path queries in a simple polygon"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      39
+, number =      2
+, month =       oct
+, year =        1989
+, pages =       "126--152"
+, succeeds =    "gh-ospqs-87"
+, update =      "01.04 icking, 98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{ghlst-ltavs-86
-, author =	"Leonidas J. Guibas and J. Hershberger and D. Leven and Micha Sharir and R. E. Tarjan"
-, title =	"Linear time algorithms for visibility and shortest path problems inside simple polygons"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"1--13"
-, precedes =	"ghlst-ltavs-87"
-, cites =	"a-eafvp, at-oadvp-81, c-tpca-82, cg-vippg-85, egs-oplms-86, e-eacwv-84, ea-lacvp-81, f-spcrd-86, fm-tspep-84, gjpt-tsp-78, gmpr-nrll-77, grs-kfcg-83, gy-fchsp-83, h-ep-82, hm-ndsrs-82, k-osps-83, l-vsp-83, ll-cvpe-86, lp-esppr-84, ma-lafch-79, ps-rgpcr-86, ps-tspm-81, s-ltaml-86, t-dsna-83, tv-ltats-86, t-spsee-85, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Leonidas J. Guibas and J. Hershberger and D. Leven and Micha Sharir and R. E. Tarjan"
+, title =       "Linear time algorithms for visibility and shortest path problems inside simple polygons"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "1--13"
+, precedes =    "ghlst-ltavs-87"
+, cites =       "a-eafvp, at-oadvp-81, c-tpca-82, cg-vippg-85, egs-oplms-86, e-eacwv-84, ea-lacvp-81, f-spcrd-86, fm-tspep-84, gjpt-tsp-78, gmpr-nrll-77, grs-kfcg-83, gy-fchsp-83, h-ep-82, hm-ndsrs-82, k-osps-83, l-vsp-83, ll-cvpe-86, lp-esppr-84, ma-lafch-79, ps-rgpcr-86, ps-tspm-81, s-ltaml-86, t-dsna-83, tv-ltats-86, t-spsee-85, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{ghlst-ltavs-87
-, author =	"Leonidas J. Guibas and J. Hershberger and D. Leven and Micha Sharir and R. E. Tarjan"
-, title =	"Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"209--233"
-, keywords =	"polygons, simple, shortest paths, visibility, finger search trees"
-, succeeds =	"ghlst-ltavs-86"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and J. Hershberger and D. Leven and Micha Sharir and R. E. Tarjan"
+, title =       "Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "209--233"
+, keywords =    "polygons, simple, shortest paths, visibility, finger search trees"
+, succeeds =    "ghlst-ltavs-86"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ghs-citds-90
-, author =	"Leonidas J. Guibas and J. Hershberger and J. Snoeyink"
-, title =	"Compact interval trees: a data structure for convex hulls"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"169--178"
-, precedes =	"ghs-citds-91"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and J. Hershberger and J. Snoeyink"
+, title =       "Compact interval trees: a data structure for convex hulls"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "169--178"
+, precedes =    "ghs-citds-91"
+, update =      "98.03 mitchell"
 }
 
 @article{ghs-citds-91
-, author =	"Leonidas J. Guibas and J. Hershberger and J. Snoeyink"
-, title =	"Compact interval trees: a data structure for convex hulls"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	1
-, year =	1991
-, pages =	"1--22"
-, keywords =	"data structures, convex hull, lower bounds, common tangents"
-, succeeds =	"ghs-citds-90"
-, update =	"98.03 mitchell, 94.01 rote"
-, annote =	"replaces the bridge tree data structure used in eghsssw-irals-89"
+, author =      "Leonidas J. Guibas and J. Hershberger and J. Snoeyink"
+, title =       "Compact interval trees: a data structure for convex hulls"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      1
+, year =        1991
+, pages =       "1--22"
+, keywords =    "data structures, convex hull, lower bounds, common tangents"
+, succeeds =    "ghs-citds-90"
+, update =      "98.03 mitchell, 94.01 rote"
+, annote =      "replaces the bridge tree data structure used in eghsssw-irals-89"
 }
 
 @inproceedings{ghms-apsml-91
-, author =	"Leonidas J. Guibas and J. E. Hershberger and Joseph S. B. Mitchell and J. S. Snoeyink"
-, title =	"Approximating polygons and subdivisions with minimum link paths"
-, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"151--162"
-, precedes =	"ghms-apsml-93"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, author =      "Leonidas J. Guibas and J. E. Hershberger and Joseph S. B. Mitchell and J. S. Snoeyink"
+, title =       "Approximating polygons and subdivisions with minimum link paths"
+, booktitle =   "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "151--162"
+, precedes =    "ghms-apsml-93"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @article{ghms-apsml-93
-, author =	"Leonidas J. Guibas and J. E. Hershberger and Joseph S. B. Mitchell and J. S. Snoeyink"
-, title =	"Approximating Polygons and Subdivisions with Minimum Link Paths"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, number =	4
-, month =	dec
-, year =	1993
-, pages =	"383--415"
-, succeeds =	"ghms-apsml-91"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, author =      "Leonidas J. Guibas and J. E. Hershberger and Joseph S. B. Mitchell and J. S. Snoeyink"
+, title =       "Approximating Polygons and Subdivisions with Minimum Link Paths"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, number =      4
+, month =       dec
+, year =        1993
+, pages =       "383--415"
+, succeeds =    "ghms-apsml-91"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @techreport{gks-ricdv-89
-, author =	"Leonidas J. Guibas and D. Knuth and Micha Sharir"
-, title =	"Randomized incremental construction of {Delaunay} and {Voronoi} diagrams"
-, type =	"Technical {Report}"
-, number =	481
-, institution =	"Courant institute of mathematical sciences"
-, month =	dec
-, year =	1989
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Leonidas J. Guibas and D. Knuth and Micha Sharir"
+, title =       "Randomized incremental construction of {Delaunay} and {Voronoi} diagrams"
+, type =        "Technical {Report}"
+, number =      481
+, institution = "Courant institute of mathematical sciences"
+, month =       dec
+, year =        1989
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{gks-ricdv-90
-, author =	"Leonidas J. Guibas and Donald E. Knuth and Micha Sharir"
-, title =	"Randomized Incremental Construction of {Delaunay} and {Voronoi} Diagrams"
-, editor =	"M. S. Paterson"
-, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	443
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"414--431"
-, precedes =	"gks-ricdv-92"
-, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 rote"
-, annote =	"Main result: If the order of point insertion is
-		 randomized, then the total number of changes to DT
-		 when insertion algorithm is used is $O(n)$. By keeping
-		 previous triangulations around and searching in old
-		 triangulations first, the point location problem takes
-		 $O(\log n)$ expected time, meaning that insertion
-		 algorithm takes $O(n \log n)$ on average."
+, author =      "Leonidas J. Guibas and Donald E. Knuth and Micha Sharir"
+, title =       "Randomized Incremental Construction of {Delaunay} and {Voronoi} Diagrams"
+, editor =      "M. S. Paterson"
+, booktitle =   "Proc. 17th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      443
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "414--431"
+, precedes =    "gks-ricdv-92"
+, update =      "99.11 bibrelex, 96.09 agarwal, 93.09 rote"
+, annote =      "Main result: If the order of point insertion is
+                 randomized, then the total number of changes to DT
+                 when insertion algorithm is used is $O(n)$. By keeping
+                 previous triangulations around and searching in old
+                 triangulations first, the point location problem takes
+                 $O(\log n)$ expected time, meaning that insertion
+                 algorithm takes $O(n \log n)$ on average."
 }
 
 @article{gks-ricdv-92
-, author =	"Leonidas J. Guibas and D. E. Knuth and Micha Sharir"
-, title =	"Randomized incremental construction of {Delaunay} and {Voronoi} diagrams"
-, journal =	"Algorithmica"
-, volume =	7
-, year =	1992
-, pages =	"381--413"
-, succeeds =	"gks-ricdv-90"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and D. E. Knuth and Micha Sharir"
+, title =       "Randomized incremental construction of {Delaunay} and {Voronoi} diagrams"
+, journal =     "Algorithmica"
+, volume =      7
+, year =        1992
+, pages =       "381--413"
+, succeeds =    "gks-ricdv-90"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{gmpr-nrll-77
-, author =	"Leonidas J. Guibas and E. McCreight and M. Plass and J. Roberts"
-, title =	"A new representation for linear lists"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Theory Comput."
-, year =	1977
-, pages =	"49--60"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Leonidas J. Guibas and E. McCreight and M. Plass and J. Roberts"
+, title =       "A new representation for linear lists"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Theory Comput."
+, year =        1977
+, pages =       "49--60"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{gmr-vdmpp-91t
-, author =	"Leonidas J. Guibas and Joseph S. B. Mitchell and T. Roos"
-, title =	"Voronoi diagrams of moving points in the plane"
-, type =	"manuscript"
-, year =	1991
-, precedes =	"gmr-vdmpp-92, agmr-vdmp-98"
-, update =	"99.11 bibrelex, 98.11 bibrelex"
+, author =      "Leonidas J. Guibas and Joseph S. B. Mitchell and T. Roos"
+, title =       "Voronoi diagrams of moving points in the plane"
+, type =        "manuscript"
+, year =        1991
+, precedes =    "gmr-vdmpp-92, agmr-vdmp-98"
+, update =      "99.11 bibrelex, 98.11 bibrelex"
 }
 
 @inproceedings{gmr-vdmpp-92
-, author =	"Leonidas J. Guibas and Joseph S. B. Mitchell and T. Roos"
-, title =	"Voronoi diagrams of moving points in the plane"
-, booktitle =	"Proc. 17th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	570
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"113--125"
-, keywords =	"Voronoi diagrams, Davenport-Schinzel sequences"
-, succeeds =	"gmr-vdmpp-91t"
-, precedes =	"agmr-vdmp-98"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex, 98.03 mitchell"
+, author =      "Leonidas J. Guibas and Joseph S. B. Mitchell and T. Roos"
+, title =       "Voronoi diagrams of moving points in the plane"
+, booktitle =   "Proc. 17th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      570
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "113--125"
+, keywords =    "Voronoi diagrams, Davenport-Schinzel sequences"
+, succeeds =    "gmr-vdmpp-91t"
+, precedes =    "agmr-vdmp-98"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 98.11 bibrelex, 98.03 mitchell"
 }
 
 @article{gmr-rlp-97
-, author =	"Leonidas J. Guibas and R. Motwani and P. Raghavan"
-, title =	"The robot localization problem"
-, journal =	"SIAM J. Comput."
-, volume =	26
-, number =	4
-, month =	aug
-, year =	1997
-, pages =	"1120--1138"
-, update =	"98.03 mitchell, 97.11 smid"
+, author =      "Leonidas J. Guibas and R. Motwani and P. Raghavan"
+, title =       "The robot localization problem"
+, journal =     "SIAM J. Comput."
+, volume =      26
+, number =      4
+, month =       aug
+, year =        1997
+, pages =       "1120--1138"
+, update =      "98.03 mitchell, 97.11 smid"
 }
 
 @inproceedings{gmr-rlptd-92
-, author =	"Leonidas J. Guibas and R. Motwani and P. Raghavan"
-, title =	"The robot localization problem in two dimensions"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"259--268"
-, precedes =	"gmr-rlp-97"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and R. Motwani and P. Raghavan"
+, title =       "The robot localization problem in two dimensions"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "259--268"
+, precedes =    "gmr-rlp-97"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{gor-efpp-91
-, author =	"Leonidas J. Guibas and M. H. Overmars and J.-M. Robert"
-, title =	"The exact fitting problem for points"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"171--174"
-, precedes =	"gor-efpp-96"
-, cites =	"a-pal2a-90, bb-atp-88, b-gtfga-80, cegsw-ccbac-90, e-acg-87, eg-tsa-89, hiiry-owlll-90, m-cha-90i, mg-fre-82, st-epdg-83, ZZZ"
-, update =	"98.07 agarwal+bibrelex, 98.03 mitchell, 96.09 devillers"
+, author =      "Leonidas J. Guibas and M. H. Overmars and J.-M. Robert"
+, title =       "The exact fitting problem for points"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "171--174"
+, precedes =    "gor-efpp-96"
+, cites =       "a-pal2a-90, bb-atp-88, b-gtfga-80, cegsw-ccbac-90, e-acg-87, eg-tsa-89, hiiry-owlll-90, m-cha-90i, mg-fre-82, st-epdg-83, ZZZ"
+, update =      "98.07 agarwal+bibrelex, 98.03 mitchell, 96.09 devillers"
 }
 
 @article{gor-efpp-96
-, author =	"Leonidas J. Guibas and M. H. Overmars and J.-M. Robert"
-, title =	"The exact fitting problem for points"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"215--230"
-, succeeds =	"gor-efpp-91"
-, update =	"98.07 agarwal, 98.03 mitchell, 97.11 bibrelex, 96.09 devillers"
+, author =      "Leonidas J. Guibas and M. H. Overmars and J.-M. Robert"
+, title =       "The exact fitting problem for points"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "215--230"
+, succeeds =    "gor-efpp-91"
+, update =      "98.07 agarwal, 98.03 mitchell, 97.11 bibrelex, 96.09 devillers"
 }
 
 @techreport{gos-crial-89
-, author =	"Leonidas J. Guibas and M. H. Overmars and Micha Sharir"
-, title =	"Counting and reporting intersections in arrangements of line segments"
-, type =	"Technical {Report}"
-, number =	434
-, institution =	"Dept. Comput. Sci, New York  Univ."
-, address =	"New York, NY"
-, month =	mar
-, year =	1989
-, update =	"98.07 agarwal, 98.03 mitchell, 97.11 bibrelex"
+, author =      "Leonidas J. Guibas and M. H. Overmars and Micha Sharir"
+, title =       "Counting and reporting intersections in arrangements of line segments"
+, type =        "Technical {Report}"
+, number =      434
+, institution = "Dept. Comput. Sci, New York  Univ."
+, address =     "New York, NY"
+, month =       mar
+, year =        1989
+, update =      "98.07 agarwal, 98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{gos-ilsrs-88
-, author =	"Leonidas J. Guibas and M. H. Overmars and Micha Sharir"
-, title =	"Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques"
-, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	318
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"64--73"
-, update =	"98.07 agarwal, 98.03 mitchell"
+, author =      "Leonidas J. Guibas and M. H. Overmars and Micha Sharir"
+, title =       "Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques"
+, booktitle =   "Proc. 1st Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      318
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "64--73"
+, update =      "98.07 agarwal, 98.03 mitchell"
 }
 
 @techreport{gos-rsipl-89
-, author =	"Leonidas J. Guibas and M. H. Overmars and Micha Sharir"
-, title =	"Ray shooting, implicit point location, and related queries in arrangements of segments"
-, type =	"Report"
-, number =	433
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, month =	mar
-, year =	1989
-, keywords =	"random sampling, ray tracing, arrangements, point location"
-, update =	"98.07 agarwal, 98.03 mitchell"
+, author =      "Leonidas J. Guibas and M. H. Overmars and Micha Sharir"
+, title =       "Ray shooting, implicit point location, and related queries in arrangements of segments"
+, type =        "Report"
+, number =      433
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, month =       mar
+, year =        1989
+, keywords =    "random sampling, ray tracing, arrangements, point location"
+, update =      "98.07 agarwal, 98.03 mitchell"
 }
 
 @inproceedings{grs-kfcg-83
-, author =	"Leonidas J. Guibas and L. Ramshaw and J. Stolfi"
-, title =	"A kinetic framework for computational geometry"
-, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1983
-, pages =	"100--111"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and L. Ramshaw and J. Stolfi"
+, title =       "A kinetic framework for computational geometry"
+, booktitle =   "Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1983
+, pages =       "100--111"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{gss-cscah-90
-, author =	"Leonidas J. Guibas and D. Salesin and J. Stolfi"
-, title =	"Constructing strongly convex approximate hulls with inaccurate primitives"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"261--270"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and D. Salesin and J. Stolfi"
+, title =       "Constructing strongly convex approximate hulls with inaccurate primitives"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "261--270"
+, update =      "98.03 mitchell"
 }
 
 @article{gss-cscah-93
-, author =	"Leonidas J. Guibas and D. Salesin and J. Stolfi"
-, title =	"Constructing strongly convex approximate hulls with inaccurate primitives"
-, journal =	"Algorithmica"
-, volume =	9
-, year =	1993
-, pages =	"534--560"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Leonidas J. Guibas and D. Salesin and J. Stolfi"
+, title =       "Constructing strongly convex approximate hulls with inaccurate primitives"
+, journal =     "Algorithmica"
+, volume =      9
+, year =        1993
+, pages =       "534--560"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{gss-egbra-89
-, author =	"Leonidas J. Guibas and D. Salesin and J. Stolfi"
-, title =	"Epsilon geometry: building robust algorithms from imprecise computations"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"208--217"
-, cites =	"em-sstcd-88, gy-frcg-86, hhk-tirgc-88, grs-kfcg-83, k-acp-73, m-vigau-88a, mk-impgo-84, otu-nsga-87, y-gctsp-88, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Leonidas J. Guibas and D. Salesin and J. Stolfi"
+, title =       "Epsilon geometry: building robust algorithms from imprecise computations"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "208--217"
+, cites =       "em-sstcd-88, gy-frcg-86, hhk-tirgc-88, grs-kfcg-83, k-acp-73, m-vigau-88a, mk-impgo-84, otu-nsga-87, y-gctsp-88, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @techreport{gs-sp801-82
-, author =	"Leonidas J. Guibas and J. Saxe"
-, title =	"Solution to problem 80-15: computing the connected components of a collection of rectangles"
-, type =	"Report"
-, number =	"??"
-, institution =	"Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1982
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and J. Saxe"
+, title =       "Solution to problem 80-15: computing the connected components of a collection of rectangles"
+, type =        "Report"
+, number =      "??"
+, institution = "Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1982
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{gs-dfbt-78
-, author =	"Leonidas J. Guibas and R. Sedgewick"
-, title =	"A dichromatic framework for balanced trees"
-, booktitle =	"Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, publisher =	"Springer-Verlag"
-, year =	1978
-, pages =	"8--21"
-, update =	"98.03 mitchell, 96.05 agarwal, 94.01 tamassia"
+, author =      "Leonidas J. Guibas and R. Sedgewick"
+, title =       "A dichromatic framework for balanced trees"
+, booktitle =   "Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, publisher =   "Springer-Verlag"
+, year =        1978
+, pages =       "8--21"
+, update =      "98.03 mitchell, 96.05 agarwal, 94.01 tamassia"
 }
 
 @inproceedings{gs-ccrs-86
-, author =	"Leonidas J. Guibas and R. Seidel"
-, title =	"Computing convolutions by reciprocal search"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"90--99"
-, keywords =	"intersection, subdivisions, plane-sweep"
-, precedes =	"gs-ccrs-87"
-, cites =	"bo-arcgi-79, c-fsnaq-86, eg-tsa-86, g-cp-67, grs-kfcg-83, gs-pmgsc-85, np-psaig-82, s-at-66, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Leonidas J. Guibas and R. Seidel"
+, title =       "Computing convolutions by reciprocal search"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "90--99"
+, keywords =    "intersection, subdivisions, plane-sweep"
+, precedes =    "gs-ccrs-87"
+, cites =       "bo-arcgi-79, c-fsnaq-86, eg-tsa-86, g-cp-67, grs-kfcg-83, gs-pmgsc-85, np-psaig-82, s-at-66, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{gs-ccrs-87
-, author =	"Leonidas J. Guibas and R. Seidel"
-, title =	"Computing convolutions by reciprocal search"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"175--193"
-, keywords =	"intersection, subdivisions, plane-sweep"
-, succeeds =	"gs-ccrs-86"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and R. Seidel"
+, title =       "Computing convolutions by reciprocal search"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "175--193"
+, keywords =    "intersection, subdivisions, plane-sweep"
+, succeeds =    "gs-ccrs-86"
+, update =      "98.03 mitchell"
 }
 
 @techreport{gs-atlrp-90
-, author =	"Leonidas J. Guibas and Micha Sharir"
-, title =	"Arrangements of Thick Lines and Related problems"
-, type =	"Manuscript"
-, year =	1990
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "Leonidas J. Guibas and Micha Sharir"
+, title =       "Arrangements of Thick Lines and Related problems"
+, type =        "Manuscript"
+, year =        1990
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @techreport{gs-caa-90
-, author =	"Leonidas J. Guibas and Micha Sharir"
-, title =	"Combinatorics and algorithms of arrangements"
-, type =	"Manuscript"
-, year =	1990
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Leonidas J. Guibas and Micha Sharir"
+, title =       "Combinatorics and algorithms of arrangements"
+, type =        "Manuscript"
+, year =        1990
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @incollection{gs-caa-93
-, author =	"Leonidas J. Guibas and Micha Sharir"
-, title =	"Combinatorics and Algorithms of Arrangements"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg"
-, year =	1993
-, pages =	"9--36"
-, keywords =	"survey paper, arrangements, lower envelopes, Davenport-Shinzel sequences, face complexity, partitioning"
-, update =	"98.07 agarwal, 98.03 mitchell, 93.09 erickson"
+, author =      "Leonidas J. Guibas and Micha Sharir"
+, title =       "Combinatorics and Algorithms of Arrangements"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg"
+, year =        1993
+, pages =       "9--36"
+, keywords =    "survey paper, arrangements, lower envelopes, Davenport-Shinzel sequences, face complexity, partitioning"
+, update =      "98.07 agarwal, 98.03 mitchell, 93.09 erickson"
 }
 
 @inproceedings{gss-gmppt-88
-, author =	"Leonidas J. Guibas and Micha Sharir and S. Sifrony"
-, title =	"On the general motion planning problem with two degrees of freedom"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"289--298"
-, precedes =	"gss-gmppt-89"
-, cites =	"ass-sulbl-87, as-tsbac-88, a-dcg-83, bo-arcgi-79, cg-vippg-85, dsst-mdsp-86, eg-tsa-86, egppss-acptc-88, eghppsss-ajati-88, egs-cmfal-88, es-mnwsn-87, fwy-cmtra-86, ghlst-ltavs-87, hs-ndssg-86, ks-eapcf-85, ks-empac-90, klps-ujrcf-86, ls-esmpa-87, ls-pptmc-87, lw-apcfp-79, osy-gvdl-86, osy-gvdl-87, oy-rmpmd-85, ps-ueplf-87, pss-stsps-88, ss-pmp1c-83, ss-pmp2g-83, ss-pmp3c-83, ss-pmp5c-84, s-tddsp-85, sa-pmp4v-84, s-alubl-87, s-ilbld-88, ss-cmpti-88, ss-nempa-87, ws-prnds-88, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Leonidas J. Guibas and Micha Sharir and S. Sifrony"
+, title =       "On the general motion planning problem with two degrees of freedom"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "289--298"
+, precedes =    "gss-gmppt-89"
+, cites =       "ass-sulbl-87, as-tsbac-88, a-dcg-83, bo-arcgi-79, cg-vippg-85, dsst-mdsp-86, eg-tsa-86, egppss-acptc-88, eghppsss-ajati-88, egs-cmfal-88, es-mnwsn-87, fwy-cmtra-86, ghlst-ltavs-87, hs-ndssg-86, ks-eapcf-85, ks-empac-90, klps-ujrcf-86, ls-esmpa-87, ls-pptmc-87, lw-apcfp-79, osy-gvdl-86, osy-gvdl-87, oy-rmpmd-85, ps-ueplf-87, pss-stsps-88, ss-pmp1c-83, ss-pmp2g-83, ss-pmp3c-83, ss-pmp5c-84, s-tddsp-85, sa-pmp4v-84, s-alubl-87, s-ilbld-88, ss-cmpti-88, ss-nempa-87, ws-prnds-88, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{gss-gmppt-89
-, author =	"Leonidas J. Guibas and Micha Sharir and S. Sifrony"
-, title =	"On the general motion planning problem with two degrees of freedom"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"491--521"
-, keywords =	"motion planning, arrangements"
-, succeeds =	"gss-gmppt-88"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and Micha Sharir and S. Sifrony"
+, title =       "On the general motion planning problem with two degrees of freedom"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "491--521"
+, keywords =    "motion planning, arrangements"
+, succeeds =    "gss-gmppt-88"
+, update =      "98.03 mitchell"
 }
 
 @techreport{gs-ncg-82
-, author =	"Leonidas J. Guibas and J. Stolfi"
-, title =	"Notes on Computational Geometry"
-, institution =	"XEROX PARK"
-, year =	1982
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Leonidas J. Guibas and J. Stolfi"
+, title =       "Notes on Computational Geometry"
+, institution = "XEROX PARK"
+, year =        1982
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{gs-canen-83
-, author =	"Leonidas J. Guibas and J. Stolfi"
-, title =	"On computing all north-east nearest neighbors in the {$L_{1}$} metric"
-, journal =	"Inform. Process. Lett."
-, volume =	17
-, year =	1983
-, pages =	"219--223"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and J. Stolfi"
+, title =       "On computing all north-east nearest neighbors in the {$L_{1}$} metric"
+, journal =     "Inform. Process. Lett."
+, volume =      17
+, year =        1983
+, pages =       "219--223"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{gs-pmgsc-83
-, author =	"Leonidas J. Guibas and J. Stolfi"
-, title =	"Primitives for the manipulation of general subdivisions and the computation of {Voronoi} diagrams"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
-, year =	1983
-, pages =	"221--234"
-, precedes =	"gs-pmgsc-85"
-, update =	"98.03 mitchell"
+, author =      "Leonidas J. Guibas and J. Stolfi"
+, title =       "Primitives for the manipulation of general subdivisions and the computation of {Voronoi} diagrams"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Theory Comput."
+, year =        1983
+, pages =       "221--234"
+, precedes =    "gs-pmgsc-85"
+, update =      "98.03 mitchell"
 }
 
 @article{gs-pmgsc-85
-, author =	"Leonidas J. Guibas and J. Stolfi"
-, title =	"Primitives for the manipulation of general subdivisions and the computation of {Voronoi} diagrams"
-, journal =	"ACM Trans. Graph."
-, volume =	4
-, number =	2
-, month =	apr
-, year =	1985
-, pages =	"74--123"
-, keywords =	"design of algorithms, data structuring"
-, succeeds =	"gs-pmgsc-83"
-, update =	"98.07 bibrelex+tamassia, 98.03 mitchell"
-, annote =	"data structure for convex hull"
+, author =      "Leonidas J. Guibas and J. Stolfi"
+, title =       "Primitives for the manipulation of general subdivisions and the computation of {Voronoi} diagrams"
+, journal =     "ACM Trans. Graph."
+, volume =      4
+, number =      2
+, month =       apr
+, year =        1985
+, pages =       "74--123"
+, keywords =    "design of algorithms, data structuring"
+, succeeds =    "gs-pmgsc-83"
+, update =      "98.07 bibrelex+tamassia, 98.03 mitchell"
+, annote =      "data structure for convex hull"
 }
 
 @incollection{gs-rccda-88
-, author =	"Leonidas J. Guibas and J. Stolfi"
-, title =	"Ruler, compass and computer: the design and analysis of geometric algorithms"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"111--165"
-, keywords =	"survey paper"
-, update =	"98.03 mitchell, 97.03 pocchiola+schwarzkopf"
+, author =      "Leonidas J. Guibas and J. Stolfi"
+, title =       "Ruler, compass and computer: the design and analysis of geometric algorithms"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "111--165"
+, keywords =    "survey paper"
+, update =      "98.03 mitchell, 97.03 pocchiola+schwarzkopf"
 }
 
 @article{gsc-srttd-87
-, author =	"Leonidas J. Guibas and J. Stolfi and K. Clarkson"
-, title =	"Solving related two- and three-dimensional linear programming in logarithmic time"
-, journal =	"Theoret. Comput. Sci."
-, volume =	49
-, number =	1
-, year =	1987
-, pages =	"81--84"
-, update =	"98.03 mitchell, 93.09 matousek"
+, author =      "Leonidas J. Guibas and J. Stolfi and K. Clarkson"
+, title =       "Solving related two- and three-dimensional linear programming in logarithmic time"
+, journal =     "Theoret. Comput. Sci."
+, volume =      49
+, number =      1
+, year =        1987
+, pages =       "81--84"
+, update =      "98.03 mitchell, 93.09 matousek"
 }
 
 @inproceedings{gy-tsr-80
-, author =	"Leonidas J. Guibas and F. Frances Yao"
-, title =	"On Translating a Set of Rectangles"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Theory Comput."
-, year =	1980
-, pages =	"154--160"
-, precedes =	"gy-tsr-83"
-, update =	"01.04 icking, 98.03 mitchell"
+, author =      "Leonidas J. Guibas and F. Frances Yao"
+, title =       "On Translating a Set of Rectangles"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Theory Comput."
+, year =        1980
+, pages =       "154--160"
+, precedes =    "gy-tsr-83"
+, update =      "01.04 icking, 98.03 mitchell"
 }
 
 @incollection{gy-tsr-83
-, author =	"Leonidas J. Guibas and F. Frances Yao"
-, title =	"On Translating a Set of Rectangles"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"61--77"
-, succeeds =	"gy-tsr-80"
-, update =	"01.04 icking, 98.03 mitchell"
+, author =      "Leonidas J. Guibas and F. Frances Yao"
+, title =       "On Translating a Set of Rectangles"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "61--77"
+, succeeds =    "gy-tsr-80"
+, update =      "01.04 icking, 98.03 mitchell"
 }
 
 @article{gbe-pcsai-92
-, author =	"W. Guida and R. Bohacek and M. Erion"
-, title =	"Probing the conformational space available to inhibitors on the thermolysin active site using {Monte}-{Carlo}/energy minimization techniques"
-, journal =	"J. Comput. Chemistry"
-, volume =	13
-, number =	2
-, year =	1992
-, pages =	"214--228"
-, update =	"98.07 bibrelex"
+, author =      "W. Guida and R. Bohacek and M. Erion"
+, title =       "Probing the conformational space available to inhibitors on the thermolysin active site using {Monte}-{Carlo}/energy minimization techniques"
+, journal =     "J. Comput. Chemistry"
+, volume =      13
+, number =      2
+, year =        1992
+, pages =       "214--228"
+, update =      "98.07 bibrelex"
 }
 
 @book{gp-dt-74
-, author =	"V. Guillemin and A. Pollack"
-, title =	"Differential Topology"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1974
-, update =	"97.11 bibrelex"
+, author =      "V. Guillemin and A. Pollack"
+, title =       "Differential Topology"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1974
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{g-seppi-84
-, author =	"M. Guisti"
-, title =	"Some Effectivity Problems in Polynomial Ideal Theory"
-, booktitle =	"Proc. EUROSAM 84"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	174
-, publisher =	"Springer-Verlag"
-, year =	1984
-, pages =	"159--171"
-, update =	"97.11 bibrelex"
+, author =      "M. Guisti"
+, title =       "Some Effectivity Problems in Polynomial Ideal Theory"
+, booktitle =   "Proc. EUROSAM 84"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      174
+, publisher =   "Springer-Verlag"
+, year =        1984
+, pages =       "159--171"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{gs-rtctm-98
-, author =	"S. Gumhold and W. Stra{\ss}er"
-, title =	"Real Time Compression of Triangle Mesh Connectivity"
-, booktitle =	"Proc. SIGGRAPH '98"
-, site =	"Orlando, FL"
-, series =	"Computer Graphics Proceedings, Annual Conference Series"
-, month =	jul
-, year =	1998
-, pages =	"133--140"
-, update =	"98.11 held"
+, author =      "S. Gumhold and W. Stra{\ss}er"
+, title =       "Real Time Compression of Triangle Mesh Connectivity"
+, booktitle =   "Proc. SIGGRAPH '98"
+, site =        "Orlando, FL"
+, series =      "Computer Graphics Proceedings, Annual Conference Series"
+, month =       jul
+, year =        1998
+, pages =       "133--140"
+, update =      "98.11 held"
 }
 
 @inproceedings{g-lbtaa-88
-, author =	"O. G{\"u}nther"
-, title =	"A lower bound and two approximative algorithms for the $k$-partitioning of rectilinear polygons"
-, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	318
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"86--95"
+, author =      "O. G{\"u}nther"
+, title =       "A lower bound and two approximative algorithms for the $k$-partitioning of rectilinear polygons"
+, booktitle =   "Proc. 1st Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      318
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "86--95"
 }
 
 @book{g-esgdm-88
-, author =	"O. G{\"u}nther"
-, title =	"Efficient Structures for Geometric Data Management"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	337
-, publisher =	"Springer-Verlag"
-, year =	1988
-, isbn =	"3-540-50463-X"
-, update =	"96.05 agarwal, 93.09 held"
+, author =      "O. G{\"u}nther"
+, title =       "Efficient Structures for Geometric Data Management"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      337
+, publisher =   "Springer-Verlag"
+, year =        1988
+, isbn =        "3-540-50463-X"
+, update =      "96.05 agarwal, 93.09 held"
 }
 
 @article{g-mkprp-90
-, author =	"O. G{\"u}nther"
-, title =	"Minimum $k$-Partitioning of Rectilinear Polygons"
-, journal =	"J. Symbolic Comput."
-, volume =	9
-, number =	4
-, month =	apr
-, year =	1990
-, pages =	"457--483"
-, update =	"93.09 held"
+, author =      "O. G{\"u}nther"
+, title =       "Minimum $k$-Partitioning of Rectilinear Polygons"
+, journal =     "J. Symbolic Comput."
+, volume =      9
+, number =      4
+, month =       apr
+, year =        1990
+, pages =       "457--483"
+, update =      "93.09 held"
 }
 
 @inproceedings{g-tdcto-89
-, author =	"O. G{\"u}nther"
-, title =	"The design of the cell tree: {An} object oriented index structure for geometric data bases"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Data Eng."
-, year =	1989
-, pages =	"598--605"
-, update =	"99.07 bibrelex, 97.07 agarwal"
+, author =      "O. G{\"u}nther"
+, title =       "The design of the cell tree: {An} object oriented index structure for geometric data bases"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Data Eng."
+, year =        1989
+, pages =       "598--605"
+, update =      "99.07 bibrelex, 97.07 agarwal"
 }
 
 @article{gb-tbams-91
-, author =	"O. G{\"u}nther and J. Bilmes"
-, title =	"Tree based access methods for spatial databases: {Implementation} and performance evaluation"
-, journal =	"IEEE Trans. Knowledge and Data Enginerring"
-, volume =	3
-, year =	1991
-, pages =	"342--356"
-, update =	"99.07 bibrelex, 97.07 agarwal"
+, author =      "O. G{\"u}nther and J. Bilmes"
+, title =       "Tree based access methods for spatial databases: {Implementation} and performance evaluation"
+, journal =     "IEEE Trans. Knowledge and Data Enginerring"
+, volume =      3
+, year =        1991
+, pages =       "342--356"
+, update =      "99.07 bibrelex, 97.07 agarwal"
 }
 
 @article{gw-dadpi-91
-, author =	"O. G{\"u}nther and E. Wong"
-, title =	"A Dual Approach to Detect Polyhedral Intersections in Arbitrary Dimensions"
-, journal =	"Bit"
-, volume =	31
-, number =	1
-, year =	1991
-, pages =	"2--14"
-, update =	"98.11 bibrelex"
+, author =      "O. G{\"u}nther and E. Wong"
+, title =       "A Dual Approach to Detect Polyhedral Intersections in Arbitrary Dimensions"
+, journal =     "Bit"
+, volume =      31
+, number =      1
+, year =        1991
+, pages =       "2--14"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{gw-dsrgd-87
-, author =	"O. G{\"u}nther and E. Wong"
-, title =	"A Dual Space Representation for Geometric Data"
-, booktitle =	"Proc. 13th VLDB Conference"
-, year =	1987
-, pages =	"501--506"
-, update =	"99.07 bibrelex, 97.07 agarwal"
+, author =      "O. G{\"u}nther and E. Wong"
+, title =       "A Dual Space Representation for Geometric Data"
+, booktitle =   "Proc. 13th VLDB Conference"
+, year =        1987
+, pages =       "501--506"
+, update =      "99.07 bibrelex, 97.07 agarwal"
 }
 
 @article{g-uptom-96
-, author =	"H. G{\"u}nzel"
-, title =	"The universal partition theorem for oriented matroids"
-, journal =	"Discrete Comput. Geom."
-, note =	"(to appear)"
-, update =	"96.05 pocchiola"
+, author =      "H. G{\"u}nzel"
+, title =       "The universal partition theorem for oriented matroids"
+, journal =     "Discrete Comput. Geom."
+, note =        "(to appear)"
+, update =      "96.05 pocchiola"
 }
 
 @inproceedings{g-ffsmu-90
-, author =	"B. Guo"
-, title =	"Free-form surface modeling using implicit patches"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"176--180"
-, cites =	"hk-crcs-85i, hh-gpbs-88, w-asmgc-86, bi-hiura-89, p-dlsfas-87, s-pasp-85, d-spqs-, d-pimcc-85, f-spm-86, p-lssic-, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "B. Guo"
+, title =       "Free-form surface modeling using implicit patches"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "176--180"
+, cites =       "hk-crcs-85i, hh-gpbs-88, w-asmgc-86, bi-hiura-89, p-dlsfas-87, s-pasp-85, d-spqs-, d-pimcc-85, f-spm-86, p-lssic-, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{g-ddcps-96
-, author =	"B. Guo"
-, title =	"On the difficulty of deciding the convexity of polynomials over simplexes"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"227--230"
-, update =	"96.09 devillers"
+, author =      "B. Guo"
+, title =       "On the difficulty of deciding the convexity of polynomials over simplexes"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "227--230"
+, update =      "96.09 devillers"
 }
 
 @article{gmw-sruas-97
-, author =	"B. Guo and J. Menon and B. Willette"
-, title =	"Surface Reconstruction Using Alpha Shapes"
-, journal =	"Comput. Graph. Forum"
-, volume =	16
-, number =	4
-, month =	oct
-, year =	1997
-, pages =	"177--190"
-, update =	"98.07 held"
+, author =      "B. Guo and J. Menon and B. Willette"
+, title =       "Surface Reconstruction Using Alpha Shapes"
+, journal =     "Comput. Graph. Forum"
+, volume =      16
+, number =      4
+, month =       oct
+, year =        1997
+, pages =       "177--190"
+, update =      "98.07 held"
 }
 
 @inproceedings{ghru-hso-97
-, author =	"H. Gupta and V. Harinarayan and A. Rajaraman and J. D. Ullman"
-, title =	"Index selection for {OLAP}"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1996
-, pages =	"205--216"
-, update =	"97.07 agarwal"
+, author =      "H. Gupta and V. Harinarayan and A. Rajaraman and J. D. Ullman"
+, title =       "Index selection for {OLAP}"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1996
+, pages =       "205--216"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{gw-cpdp-97
-, author =	"Himanshu Gupta and Rephael Wenger"
-, title =	"Constructing Pairwise Disjoint Paths with Few Links"
-, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
-, site =	"Halifax, Canada"
-, year =	1997
-, update =	"01.07 wenger"
+, author =      "Himanshu Gupta and Rephael Wenger"
+, title =       "Constructing Pairwise Disjoint Paths with Few Links"
+, booktitle =   "Proc. 5th Workshop Algorithms Data Struct."
+, site =        "Halifax, Canada"
+, year =        1997
+, update =      "01.07 wenger"
 }
 
 @article{gw-cplh-97
-, author =	"Himanshu Gupta and Rephael Wenger"
-, title =	"Constructing Piecewise Linear Homeomorphisms of Simple Polygons"
-, journal =	"J. Algorithms"
-, volume =	22
-, year =	1997
-, pages =	"142--157"
-, update =	"01.07 wenger"
+, author =      "Himanshu Gupta and Rephael Wenger"
+, title =       "Constructing Piecewise Linear Homeomorphisms of Simple Polygons"
+, journal =     "J. Algorithms"
+, volume =      22
+, year =        1997
+, pages =       "142--157"
+, update =      "01.07 wenger"
 }
 
 @inproceedings{gs-fospc-96
-, author =	"Neelima Gupta and Sandeep Sen"
-, title =	"Faster Output-Sensitive Parallel Convex Hulls for $d \le 3$: Optimal Sublogarithmic Algorithms for Small Outputs"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"176--185"
-, cites =	"acgoy-pcg-85, agr-pahdc-94, a-oacch-84, ag-epssg-86, ag-pasft-88, ap-p3dch-92, bh-fpsae-93, cd-icott-87, c-pagp-80, c-osrch-95, csy-oscpf-95, cf-dvrsi-90, cm-dosch-92, c-oesa-87, cs-arscg-89, d-opalp-90, dk-pcsh-89, e-acg-87, gg-ptpch-91, g-gpmee-93, g-fdplp-96, g-eadch-72, h-fdpa-93, hr-wmhtb-92, hw-ensrq-87, gz-odapp-95, kr-lbmcl-89, ks-upcha-86, mv-chpnc-91, ph-chfsp-77, p-ortap-79, ps-cgi-85, rs-oprat-92, rs-rstpa-93, rs-rabsl-94, s-lbadt-94, s-pmsua-96, s-cg-78, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Neelima Gupta and Sandeep Sen"
+, title =       "Faster Output-Sensitive Parallel Convex Hulls for $d \le 3$: Optimal Sublogarithmic Algorithms for Small Outputs"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "176--185"
+, cites =       "acgoy-pcg-85, agr-pahdc-94, a-oacch-84, ag-epssg-86, ag-pasft-88, ap-p3dch-92, bh-fpsae-93, cd-icott-87, c-pagp-80, c-osrch-95, csy-oscpf-95, cf-dvrsi-90, cm-dosch-92, c-oesa-87, cs-arscg-89, d-opalp-90, dk-pcsh-89, e-acg-87, gg-ptpch-91, g-gpmee-93, g-fdplp-96, g-eadch-72, h-fdpa-93, hr-wmhtb-92, hw-ensrq-87, gz-odapp-95, kr-lbmcl-89, ks-upcha-86, mv-chpnc-91, ph-chfsp-77, p-ortap-79, ps-cgi-85, rs-oprat-92, rs-rstpa-93, rs-rabsl-94, s-lbadt-94, s-pmsua-96, s-cg-78, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @phdthesis{g-eadsg-95
-, author =	"P. Gupta"
-, title =	"Efficient algorithms and data structures for geometric intersection problems"
-, type =	"Ph.{D}. Thesis"
-, school =	"University of Minnesota"
-, address =	"Minneapolis"
-, year =	1995
-, keywords =	"doctoral thesis"
-, update =	"96.01 smid"
+, author =      "P. Gupta"
+, title =       "Efficient algorithms and data structures for geometric intersection problems"
+, type =        "Ph.{D}. Thesis"
+, school =      "University of Minnesota"
+, address =     "Minneapolis"
+, year =        1995
+, keywords =    "doctoral thesis"
+, update =      "96.01 smid"
 }
 
 @inproceedings{gjmw-egawo-95
-, author =	"Prosenjit Gupta and Ravi Janardan and Jayanth Majhi and Tony Woo"
-, title =	"Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis {NC}-Machining"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"171--182"
-, update =	"99.07 bibrelex, 96.01 smid, 95.05 mitchell"
+, author =      "Prosenjit Gupta and Ravi Janardan and Jayanth Majhi and Tony Woo"
+, title =       "Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-Axis {NC}-Machining"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "171--182"
+, update =      "99.07 bibrelex, 96.01 smid, 95.05 mitchell"
 }
 
 @article{gjmw-egawo-96
-, author =	"P. Gupta and R. Janardan and J. Majhi and T. C. Woo"
-, title =	"Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-axis {NC} Machining"
-, journal =	"Comput. Aided Design"
-, volume =	28
-, number =	8
-, month =	aug
-, year =	1996
-, pages =	"577--587"
-, update =	"96.09 held"
+, author =      "P. Gupta and R. Janardan and J. Majhi and T. C. Woo"
+, title =       "Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5-axis {NC} Machining"
+, journal =     "Comput. Aided Design"
+, volume =      28
+, number =      8
+, month =       aug
+, year =        1996
+, pages =       "577--587"
+, update =      "96.09 held"
 }
 
 @techreport{gjs-atarr-96
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"A technique for adding range restrictions to generalized searching problems"
-, type =	"Report"
-, number =	"MPI-I-96-1-017"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1996
-, update =	"96.09 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "A technique for adding range restrictions to generalized searching problems"
+, type =        "Report"
+, number =      "MPI-I-96-1-017"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1996
+, update =      "96.09 smid"
 }
 
 @article{gjs-atarr-97
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"A technique for adding range restrictions to generalized searching problems"
-, journal =	"Inform. Process. Lett."
-, volume =	64
-, year =	1997
-, pages =	"263--269"
-, update =	"98.03 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "A technique for adding range restrictions to generalized searching problems"
+, journal =     "Inform. Process. Lett."
+, volume =      64
+, year =        1997
+, pages =       "263--269"
+, update =      "98.03 smid"
 }
 
 @article{gjs-aghrs-96
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Algorithms for generalized halfspace range searching and other intersection searching problems"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1996
-, pages =	"321--340"
-, update =	"96.09 devillers+smid, 96.05 smid"
-, annote =	"also published (erroneously) in Volume 6 (1996), pp. 1--19"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Algorithms for generalized halfspace range searching and other intersection searching problems"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1996
+, pages =       "321--340"
+, update =      "96.09 devillers+smid, 96.05 smid"
+, annote =      "also published (erroneously) in Volume 6 (1996), pp. 1--19"
 }
 
 @article{gjs-asisp-99
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Algorithms for some intersection searching problems involving circular objects"
-, journal =	"International Journal of Mathematical Algorithms"
-, volume =	1
-, year =	1999
-, pages =	"35--52"
-, update =	"99.11 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Algorithms for some intersection searching problems involving circular objects"
+, journal =     "International Journal of Mathematical Algorithms"
+, volume =      1
+, year =        1999
+, pages =       "35--52"
+, update =      "99.11 smid"
 }
 
 @techreport{gjs-eacrp-96t
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Efficient algorithms for counting and reporting pairwise intersections between convex polygons"
-, type =	"Report"
-, number =	"TR 96-03"
-, institution =	"Department of Computer Science, King's College"
-, address =	"London, UK"
-, year =	1996
-, update =	"96.09 mitchell, 96.05 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Efficient algorithms for counting and reporting pairwise intersections between convex polygons"
+, type =        "Report"
+, number =      "TR 96-03"
+, institution = "Department of Computer Science, King's College"
+, address =     "London, UK"
+, year =        1996
+, update =      "96.09 mitchell, 96.05 smid"
 }
 
 @inproceedings{gjs-eacrp-96i
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Efficient algorithms for counting and reporting pairwise intersections between convex polygons"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"8--13"
-, update =	"97.03 smid, 96.09 mitchell"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Efficient algorithms for counting and reporting pairwise intersections between convex polygons"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "8--13"
+, update =      "97.03 smid, 96.09 mitchell"
 }
 
 @article{gjs-eacrp-99
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Efficient algorithms for counting and reporting pairwise intersections between convex polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	69
-, year =	1999
-, pages =	"7--13"
-, update =	"99.07 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Efficient algorithms for counting and reporting pairwise intersections between convex polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      69
+, year =        1999
+, pages =       "7--13"
+, update =      "99.07 smid"
 }
 
 @techreport{gjs-eagis-93
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Efficient algorithms for generalized intersection searching on non-iso-oriented objects"
-, type =	"Report"
-, number =	"MPI-I-93-166"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, update =	"94.01 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Efficient algorithms for generalized intersection searching on non-iso-oriented objects"
+, type =        "Report"
+, number =      "MPI-I-93-166"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, update =      "94.01 smid"
 }
 
 @inproceedings{gjs-eagis-94
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"369--378"
-, cites =	"ahl-sqrpc-90, ak-ccspi-93, ako-iqco-93, cgl-pgd-85, ds-tamol-87, dsst-mdsp-89, e-acg-87, gjs-frgis-93, gjs-ispic-93, gjs-eagis-93, jl-gisp-93, m-cha-91, m-ept-92, m-rsehc-92, m-cgitr-93, oy-nubkm-88, ZZZ"
-, update =	"98.03 bibrelex, 94.09 smid, 94.01 jones"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Efficient Algorithms for Generalized Intersection Searching on Non-Iso-Oriented Objects"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "369--378"
+, cites =       "ahl-sqrpc-90, ak-ccspi-93, ako-iqco-93, cgl-pgd-85, ds-tamol-87, dsst-mdsp-89, e-acg-87, gjs-frgis-93, gjs-ispic-93, gjs-eagis-93, jl-gisp-93, m-cha-91, m-ept-92, m-rsehc-92, m-cgitr-93, oy-nubkm-88, ZZZ"
+, update =      "98.03 bibrelex, 94.09 smid, 94.01 jones"
 }
 
 @techreport{gjs-facpp-94t
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Fast algorithms for collision and proximity problems involving moving geometric objects"
-, type =	"Report"
-, number =	"MPI-I-94-113"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, update =	"95.01 smid, 94.05 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Fast algorithms for collision and proximity problems involving moving geometric objects"
+, type =        "Report"
+, number =      "MPI-I-94-113"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, update =      "95.01 smid, 94.05 smid"
 }
 
 @inproceedings{gjs-facpp-94i
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Fast algorithms for collision and proximity problems involving moving geometric objects"
-, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
-, nickname =	"ESA '94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"278--289"
-, precedes =	"gjs-facpp-96"
-, update =	"97.03 devillers, 95.01 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Fast algorithms for collision and proximity problems involving moving geometric objects"
+, booktitle =   "Proc. 2nd Annu. European Sympos. Algorithms"
+, nickname =    "ESA '94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "278--289"
+, precedes =    "gjs-facpp-96"
+, update =      "97.03 devillers, 95.01 smid"
 }
 
 @article{gjs-facpp-96
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Fast algorithms for collision and proximity problems involving moving geometric objects"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"371--391"
-, succeeds =	"gjs-facpp-94i"
-, update =	"97.03 devillers+smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Fast algorithms for collision and proximity problems involving moving geometric objects"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "371--391"
+, succeeds =    "gjs-facpp-94i"
+, update =      "97.03 devillers+smid"
 }
 
 @techreport{gjs-frgis-92
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Further results on generalized intersection searching problems: counting, reporting and dynamization"
-, type =	"Report"
-, number =	"MPI-I-92-154"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Further results on generalized intersection searching problems: counting, reporting and dynamization"
+, type =        "Report"
+, number =      "MPI-I-92-154"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
 }
 
 @inproceedings{gjs-frgis-93
-, author =	"Prosenjit Gupta and Ravi Janardan and Michiel Smid"
-, title =	"Further Results on Generalized Intersection Searching Problems: {Counting}, Reporting, and Dynamization"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"361--372"
-, update =	"95.01 smid, 93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "Prosenjit Gupta and Ravi Janardan and Michiel Smid"
+, title =       "Further Results on Generalized Intersection Searching Problems: {Counting}, Reporting, and Dynamization"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "361--372"
+, update =      "95.01 smid, 93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @article{gjs-frgis-95
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"Further results on generalized intersection searching problems: counting, reporting and dynamization"
-, journal =	"J. Algorithms"
-, volume =	19
-, year =	1995
-, pages =	"282--317"
-, update =	"96.01 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "Further results on generalized intersection searching problems: counting, reporting and dynamization"
+, journal =     "J. Algorithms"
+, volume =      19
+, year =        1995
+, pages =       "282--317"
+, update =      "96.01 smid"
 }
 
 @techreport{gjs-ispic-93
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"On intersection searching problems involving curved objects"
-, type =	"Report"
-, number =	"MPI-I-93-124"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, update =	"93.09 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "On intersection searching problems involving curved objects"
+, type =        "Report"
+, number =      "MPI-I-93-124"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, update =      "93.09 smid"
 }
 
 @inproceedings{gjs-ispic-94
-, author =	"P. Gupta and R. Janardan and M. Smid"
-, title =	"On intersection searching problems involving curved objects"
-, booktitle =	"Proc. 4th Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	824
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"183--194"
-, update =	"94.09 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid"
+, title =       "On intersection searching problems involving curved objects"
+, booktitle =   "Proc. 4th Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      824
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "183--194"
+, update =      "94.09 smid"
 }
 
 @techreport{gjsd-repdp-94
-, author =	"P. Gupta and R. Janardan and M. Smid and B. Dasgupta"
-, title =	"The rectangle enclosure and point-dominance problems revisited"
-, type =	"Report"
-, number =	"MPI-I-94-142"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, update =	"94.09 smid"
+, author =      "P. Gupta and R. Janardan and M. Smid and B. Dasgupta"
+, title =       "The rectangle enclosure and point-dominance problems revisited"
+, type =        "Report"
+, number =      "MPI-I-94-142"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, update =      "94.09 smid"
 }
 
 @inproceedings{gjsd-repdp-95
-, author =	"Prosenjit Gupta and Ravi Janardan and Michiel Smid and Bhaskar Dasgupta"
-, title =	"The Rectangle Enclosure and Point-Dominance Problems Revisited"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"162--171"
-, keywords =	""
-, cites =	"eo-esrp-82, gjsd-repdp-94, ko-sag-88, lp-iarep-82, lw-firrs-81, m-pst-85, pl-pdavs-88, ps-cgi-85, ekz-diepq-77, e-pofll-77, vw-dsrce-80, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Prosenjit Gupta and Ravi Janardan and Michiel Smid and Bhaskar Dasgupta"
+, title =       "The Rectangle Enclosure and Point-Dominance Problems Revisited"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "162--171"
+, keywords =    ""
+, cites =       "eo-esrp-82, gjsd-repdp-94, ko-sag-88, lp-iarep-82, lw-firrs-81, m-pst-85, pl-pdavs-88, ps-cgi-85, ekz-diepq-77, e-pofll-77, vw-dsrce-80, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{gjsd-repdp-97
-, author =	"Prosenjit Gupta and Ravi Janardan and Michiel Smid and Bhaskar Dasgupta"
-, title =	"The Rectangle Enclosure and Point-Dominance Problems Revisited"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"437--455"
-, update =	"98.03 smid"
+, author =      "Prosenjit Gupta and Ravi Janardan and Michiel Smid and Bhaskar Dasgupta"
+, title =       "The Rectangle Enclosure and Point-Dominance Problems Revisited"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "437--455"
+, update =      "98.03 smid"
 }
 
 @techreport{gs-oappg-96
-, author =	"P. Gupta and S. Saluja"
-, title =	"Optimal algorithms for some proximity problems on the {Gaussian} sphere with applications"
-, type =	"Report"
-, number =	"MPI-I-96-1-022"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1996
-, update =	"96.09 smid"
+, author =      "P. Gupta and S. Saluja"
+, title =       "Optimal algorithms for some proximity problems on the {Gaussian} sphere with applications"
+, type =        "Report"
+, number =      "MPI-I-96-1-022"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1996
+, update =      "96.09 smid"
 }
 
 @inproceedings{gk-gsbif-98
-, author =	"S. Gupta and S. Khuller"
-, title =	"Greedy strikes back: {I}mproved facility location problems"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1998
-, pages =	"649--657"
-, update =	"98.07 agarwal"
+, author =      "S. Gupta and S. Khuller"
+, title =       "Greedy strikes back: {I}mproved facility location problems"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1998
+, pages =       "649--657"
+, update =      "98.07 agarwal"
 }
 
 @article{g-smbop-99
-, author =	"Satyandra K. Gupta"
-, title =	"Sheet metal bending operation planning: {U}sing virtual node generation to improve search efficiency"
-, journal =	"J. Manuf. Sys."
-, volume =	18
-, number =	2
-, year =	1999
-, pages =	"127--139"
-, update =	"02.03 orourke"
+, author =      "Satyandra K. Gupta"
+, title =       "Sheet metal bending operation planning: {U}sing virtual node generation to improve search efficiency"
+, journal =     "J. Manuf. Sys."
+, volume =      18
+, number =      2
+, year =        1999
+, pages =       "127--139"
+, update =      "02.03 orourke"
 }
 
 @article{gbkk-appsmbo-98
-, author =	"S. K. Gupta and D. A. Bourne and K. H. Kim and S. S. Krishnan"
-, title =	"Automated process planning for sheet metal bending operations"
-, journal =	"J. Manufacturing Systems"
-, volume =	17
-, number =	5
-, year =	1998
-, pages =	"338--360"
-, keywords =	"manufacturing"
-, update =	"99.03 orourke, 98.11 orourke"
+, author =      "S. K. Gupta and D. A. Bourne and K. H. Kim and S. S. Krishnan"
+, title =       "Automated process planning for sheet metal bending operations"
+, journal =     "J. Manufacturing Systems"
+, volume =      17
+, number =      5
+, year =        1998
+, pages =       "338--360"
+, keywords =    "manufacturing"
+, update =      "99.03 orourke, 98.11 orourke"
 }
 
 @article{gn-saamm-95
-, author =	"Satyandra K. Gupta and Dana S. Nau"
-, title =	"Systematic approach to analysing the manufacturability of machined parts"
-, journal =	"Comput. Aided Design"
-, volume =	27
-, number =	5
-, year =	1995
-, pages =	"323--342"
-, keywords =	"design for manufacturability, CAM, CAD, feature-based models"
-, update =	"98.03 mitchell"
+, author =      "Satyandra K. Gupta and Dana S. Nau"
+, title =       "Systematic approach to analysing the manufacturability of machined parts"
+, journal =     "Comput. Aided Design"
+, volume =      27
+, number =      5
+, year =        1995
+, pages =       "323--342"
+, keywords =    "design for manufacturability, CAM, CAD, feature-based models"
+, update =      "98.03 mitchell"
 }
 
 @article{g-meds-75
-, author =	"A. B. Gurevich"
-, title =	"The 'most economical' displacement of a segment"
-, journal =	"Differential Equations"
-, volume =	11
-, year =	1975
-, pages =	"1583--1589"
-, update =	"98.03 bibrelex"
+, author =      "A. B. Gurevich"
+, title =       "The 'most economical' displacement of a segment"
+, journal =     "Differential Equations"
+, volume =      11
+, year =        1975
+, pages =       "1583--1589"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{g-simat-89
-, author =	"H. N. G{\"u}rsoy"
-, title =	"Shape Interrogation by Medial Axis Transform for Automated Analysis"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Ocean Engineering, MIT"
-, address =	"Cambridge, MA"
-, month =	nov
-, year =	1989
-, keywords =	"doctoral thesis"
-, update =	"95.09 korneenko, 93.09 held"
+, author =      "H. N. G{\"u}rsoy"
+, title =       "Shape Interrogation by Medial Axis Transform for Automated Analysis"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Ocean Engineering, MIT"
+, address =     "Cambridge, MA"
+, month =       nov
+, year =        1989
+, keywords =    "doctoral thesis"
+, update =      "95.09 korneenko, 93.09 held"
 }
 
 @article{gp-aiass-91
-, author =	"H. N. G{\"u}rsoy and N. M. Patrialakis"
-, title =	"Automated Interrogation and Adaptive Subdivision of Shape Using Medial Axis Transform"
-, journal =	"Advances in Engineering Software and Workstations"
-, volume =	13
-, number =	"5--6"
-, month =	sep
-, year =	1991
-, pages =	"287--302"
-, annote =	"Vd of region is used break it up into quads and tris,
-		 which are then triangulated."
+, author =      "H. N. G{\"u}rsoy and N. M. Patrialakis"
+, title =       "Automated Interrogation and Adaptive Subdivision of Shape Using Medial Axis Transform"
+, journal =     "Advances in Engineering Software and Workstations"
+, volume =      13
+, number =      "5--6"
+, month =       sep
+, year =        1991
+, pages =       "287--302"
+, annote =      "Vd of region is used break it up into quads and tris,
+                 which are then triangulated."
 }
 
 @article{gp-acfsm1-92
-, author =	"H. N. G{\"u}rsoy and N. M. Patrikalakis"
-, title =	"An Automatic Coarse and Fine Surface Mesh Generation Scheme Based on Medial Axis Transform: Part {I} Algorithm"
-, journal =	"Engineering with Computers"
-, volume =	8
-, year =	1992
-, pages =	"121--137"
-, update =	"93.09 held"
+, author =      "H. N. G{\"u}rsoy and N. M. Patrikalakis"
+, title =       "An Automatic Coarse and Fine Surface Mesh Generation Scheme Based on Medial Axis Transform: Part {I} Algorithm"
+, journal =     "Engineering with Computers"
+, volume =      8
+, year =        1992
+, pages =       "121--137"
+, update =      "93.09 held"
 }
 
 @article{gp-acfsm2-92
-, author =	"H. N. G{\"u}rsoy and N. M. Patrikalakis"
-, title =	"An Automatic Coarse and Fine Surface Mesh Generation Scheme Based on Medial Axis Transform: Part {II} Implementation"
-, journal =	"Engineering with Computers"
-, volume =	8
-, year =	1992
-, pages =	"179--196"
-, update =	"93.09 held"
+, author =      "H. N. G{\"u}rsoy and N. M. Patrikalakis"
+, title =       "An Automatic Coarse and Fine Surface Mesh Generation Scheme Based on Medial Axis Transform: Part {II} Implementation"
+, journal =     "Engineering with Computers"
+, volume =      8
+, year =        1992
+, pages =       "179--196"
+, update =      "93.09 held"
 }
 
 @inproceedings{g-bpstp-79
-, author =	"D. Gusfield"
-, title =	"Bounds for the parametric spanning tree problem"
-, booktitle =	"Proc. West Coast Conf. Combinatorics, Graph Theory and Comput."
-, year =	1979
-, pages =	"173--181"
-, update =	"98.03 agarwal, 97.11 bibrelex"
+, author =      "D. Gusfield"
+, title =       "Bounds for the parametric spanning tree problem"
+, booktitle =   "Proc. West Coast Conf. Combinatorics, Graph Theory and Comput."
+, year =        1979
+, pages =       "173--181"
+, update =      "98.03 agarwal, 97.11 bibrelex"
 }
 
 @article{g-pccpp-83
-, author =	"D. Gusfield"
-, title =	"Parametric combinatorial computing and a problem in program module allocation"
-, journal =	"J. ACM"
-, volume =	30
-, year =	1983
-, pages =	"551--563"
-, update =	"96.05 agarwal"
+, author =      "D. Gusfield"
+, title =       "Parametric combinatorial computing and a problem in program module allocation"
+, journal =     "J. ACM"
+, volume =      30
+, year =        1983
+, pages =       "551--563"
+, update =      "96.05 agarwal"
 }
 
 @techreport{g-saco-80
-, author =	"D. Gusfield"
-, title =	"Sensitivity analysis for combinatorial optimization"
-, number =	"UCB/ERLM80/22"
-, institution =	"Univ. of California"
-, address =	"Berkeley, CA"
-, year =	1980
-, update =	"96.05 agarwal"
+, author =      "D. Gusfield"
+, title =       "Sensitivity analysis for combinatorial optimization"
+, number =      "UCB/ERLM80/22"
+, institution = "Univ. of California"
+, address =     "Berkeley, CA"
+, year =        1980
+, update =      "96.05 agarwal"
 }
 
 @article{gbn-posa-94
-, author =	"D. Gusfield and K. Balasubramanian and D. Naor"
-, title =	"Parametric optimization of sequence alignment"
-, journal =	"Algorithmica"
-, volume =	12
-, year =	1994
-, pages =	"312--326"
-, update =	"96.05 agarwal"
+, author =      "D. Gusfield and K. Balasubramanian and D. Naor"
+, title =       "Parametric optimization of sequence alignment"
+, journal =     "Algorithmica"
+, volume =      12
+, year =        1994
+, pages =       "312--326"
+, update =      "96.05 agarwal"
 }
 
 @article{gi-psmmc-89
-, author =	"D. Gusfield and R. Irving"
-, title =	"Parametric stable marriage and minimum cuts"
-, journal =	"Inform. Process. Lett."
-, volume =	30
-, year =	1989
-, pages =	"255--259"
-, update =	"97.11 bibrelex"
+, author =      "D. Gusfield and R. Irving"
+, title =       "Parametric stable marriage and minimum cuts"
+, journal =     "Inform. Process. Lett."
+, volume =      30
+, year =        1989
+, pages =       "255--259"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{gm-fagpm-89
-, author =	"D. Gusfield and C. Martel"
-, title =	"A fast algorithm for the generalized parametric minimum cut problem and applications"
-, type =	"Technical {Report}"
-, number =	"CSE-89-21"
-, institution =	"UC Davis"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "D. Gusfield and C. Martel"
+, title =       "A fast algorithm for the generalized parametric minimum cut problem and applications"
+, type =        "Technical {Report}"
+, number =      "CSE-89-21"
+, institution = "UC Davis"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @techreport{g-mlsdf-83
-, author =	"R. H. G{\"u}ting"
-, title =	"A message to the line sweeper: don't forget divide-and-conquer"
-, type =	"Report"
-, number =	170
-, institution =	"Lehrstuhl Inform. VI, Univ. Dortmund"
-, address =	"Dortmund, West Germany"
-, year =	1983
+, author =      "R. H. G{\"u}ting"
+, title =       "A message to the line sweeper: don't forget divide-and-conquer"
+, type =        "Report"
+, number =      170
+, institution = "Lehrstuhl Inform. VI, Univ. Dortmund"
+, address =     "Dortmund, West Germany"
+, year =        1983
 }
 
 @techreport{g-audfg-84
-, author =	"R. H. G{\"u}ting"
-, title =	"Algorithmen und {Datenstrukturen} f{\"u}r geometrische {Probleme}"
-, type =	"Report"
-, number =	"SS 84-1984"
-, institution =	"Lehrstuhl Inform. VI, Univ. Dortmund"
-, address =	"Dortmund, West Germany"
-, year =	1984
+, author =      "R. H. G{\"u}ting"
+, title =       "Algorithmen und {Datenstrukturen} f{\"u}r geometrische {Probleme}"
+, type =        "Report"
+, number =      "SS 84-1984"
+, institution = "Lehrstuhl Inform. VI, Univ. Dortmund"
+, address =     "Dortmund, West Germany"
+, year =        1984
 }
 
 @article{g-isds-94
-, author =	"R. H. G{\"u}ting"
-, title =	"An introduction to spatial database systems"
-, journal =	"VLDB Journal"
-, volume =	4
-, year =	1994
-, pages =	"357--399"
-, update =	"97.07 agarwal"
+, author =      "R. H. G{\"u}ting"
+, title =       "An introduction to spatial database systems"
+, journal =     "VLDB Journal"
+, volume =      4
+, year =        1994
+, pages =       "357--399"
+, update =      "97.07 agarwal"
 }
 
 @article{g-ocaio-84
-, author =	"R. H. G{\"u}ting"
-, title =	"An optimal contour algorithm for iso-oriented rectangles"
-, journal =	"J. Algorithms"
-, volume =	5
-, year =	1984
-, pages =	"303--326"
+, author =      "R. H. G{\"u}ting"
+, title =       "An optimal contour algorithm for iso-oriented rectangles"
+, journal =     "J. Algorithms"
+, volume =      5
+, year =        1984
+, pages =       "303--326"
 }
 
 @phdthesis{g-cceac-83
-, author =	"R. H. G{\"u}ting"
-, title =	"Conquering contours: {Efficient} algorithms for computational geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"Abteilung Inform., Dortmund Univ."
-, address =	"Dortmund, West Germany"
-, year =	1983
-, keywords =	"doctoral thesis"
-, update =	"96.05 smid"
+, author =      "R. H. G{\"u}ting"
+, title =       "Conquering contours: {Efficient} algorithms for computational geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "Abteilung Inform., Dortmund Univ."
+, address =     "Dortmund, West Germany"
+, year =        1983
+, keywords =    "doctoral thesis"
+, update =      "96.05 smid"
 }
 
 @techreport{g-dcopi-84
-, author =	"R. H. G{\"u}ting"
-, title =	"Dynamic C-oriented polygonal intersection searching"
-, institution =	"Lehrstuhl Inform. VI, Univ. Dortmund"
-, address =	"Dortmund, Germany"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "R. H. G{\"u}ting"
+, title =       "Dynamic C-oriented polygonal intersection searching"
+, institution = "Lehrstuhl Inform. VI, Univ. Dortmund"
+, address =     "Dortmund, Germany"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{g-dcopi-84a
-, author =	"R. H. G{\"u}ting"
-, title =	"Dynamic {C}-oriented polygonal intersection searching"
-, journal =	"Inform. Control"
-, volume =	63
-, year =	1984
-, pages =	"143--163"
-, update =	"98.07 bibrelex"
+, author =      "R. H. G{\"u}ting"
+, title =       "Dynamic {C}-oriented polygonal intersection searching"
+, journal =     "Inform. Control"
+, volume =      63
+, year =        1984
+, pages =       "143--163"
+, update =      "98.07 bibrelex"
 }
 
 @article{g-fdiss-85
-, author =	"R. H. G{\"u}ting"
-, title =	"Fast dynamic intersection searching in a set of isothetic line segments"
-, journal =	"Inform. Process. Lett."
-, volume =	21
-, year =	1985
-, pages =	"165--171"
+, author =      "R. H. G{\"u}ting"
+, title =       "Fast dynamic intersection searching in a set of isothetic line segments"
+, journal =     "Inform. Process. Lett."
+, volume =      21
+, year =        1985
+, pages =       "165--171"
 }
 
 @techreport{g-fdlsi-84
-, author =	"R. H. G{\"u}ting"
-, title =	"Fast dynamic line segment intersection searching"
-, type =	"Report"
-, number =	87
-, institution =	"Forschungsberichte Fachber. Inform., Univ. Dortmund"
-, address =	"Dortmund, West Germany"
-, year =	1984
-, keywords =	"intersection searching, line segment, segment tree, range tree, halfobject technique"
+, author =      "R. H. G{\"u}ting"
+, title =       "Fast dynamic line segment intersection searching"
+, type =        "Report"
+, number =      87
+, institution = "Forschungsberichte Fachber. Inform., Univ. Dortmund"
+, address =     "Dortmund, West Germany"
+, year =        1984
+, keywords =    "intersection searching, line segment, segment tree, range tree, halfobject technique"
 }
 
 @inproceedings{g-gramq-cga-88
-, author =	"R. H. G{\"u}ting"
-, title =	"Geo-relational algebra: a model and query language for geometric database systems"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"90--96"
-, comments =	"extended abstract"
-, precedes =	"g-gramq-edbt-88"
-, update =	"00.03 bibrelex, 99.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "R. H. G{\"u}ting"
+, title =       "Geo-relational algebra: a model and query language for geometric database systems"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "90--96"
+, comments =    "extended abstract"
+, precedes =    "g-gramq-edbt-88"
+, update =      "00.03 bibrelex, 99.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @incollection{g-gramq-edbt-88
-, author =	"R. H. G{\"u}ting"
-, title =	"Geo-relational algebra: a model and query language for geometric database systems"
-, booktitle =	"Advances in Database Technology: EDBT '88"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	303
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"506--527"
-, succeeds =	"g-gramq-cga-88"
+, author =      "R. H. G{\"u}ting"
+, title =       "Geo-relational algebra: a model and query language for geometric database systems"
+, booktitle =   "Advances in Database Technology: EDBT '88"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      303
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "506--527"
+, succeeds =    "g-gramq-cga-88"
 }
 
 @techreport{g-graiv-86
-, author =	"R. H. G{\"u}ting"
-, title =	"Geo-relational algebra: an integrated view of geometric and standard data in databases"
-, type =	"Report"
-, number =	226
-, institution =	"Fachber. Inform., Univ. Dortmund"
-, address =	"Dortmund, West Germany"
-, year =	1986
+, author =      "R. H. G{\"u}ting"
+, title =       "Geo-relational algebra: an integrated view of geometric and standard data in databases"
+, type =        "Report"
+, number =      226
+, institution = "Fachber. Inform., Univ. Dortmund"
+, address =     "Dortmund, West Germany"
+, year =        1986
 }
 
 @article{g-odccm-84
-, author =	"R. H. G{\"u}ting"
-, title =	"Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles"
-, journal =	"Acta Inform."
-, volume =	21
-, year =	1984
-, pages =	"271--291"
-, update =	"96.05 smid"
+, author =      "R. H. G{\"u}ting"
+, title =       "Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles"
+, journal =     "Acta Inform."
+, volume =      21
+, year =        1984
+, pages =       "271--291"
+, update =      "96.05 smid"
 }
 
 @article{g-scop-83
-, author =	"R. H. G{\"u}ting"
-, title =	"Stabbing $c$-oriented polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	16
-, year =	1983
-, pages =	"35--40"
+, author =      "R. H. G{\"u}ting"
+, title =       "Stabbing $c$-oriented polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      16
+, year =        1983
+, pages =       "35--40"
 }
 
 @inproceedings{gk-dkdms-81
-, author =	"R. H. G{\"u}ting and H. P. Kriegel"
-, title =	"Dynamic $k$-dimensional multiway search under time-varying access frequencies"
-, booktitle =	"Proc. 5th GI Conf. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	104
-, publisher =	"Springer-Verlag"
-, year =	1981
-, pages =	"135--145"
+, author =      "R. H. G{\"u}ting and H. P. Kriegel"
+, title =       "Dynamic $k$-dimensional multiway search under time-varying access frequencies"
+, booktitle =   "Proc. 5th GI Conf. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      104
+, publisher =   "Springer-Verlag"
+, year =        1981
+, pages =       "135--145"
 }
 
 @inproceedings{gk-mbted-80
-, author =	"R. H. G{\"u}ting and H. P. Kriegel"
-, title =	"Multidimensional {$B$}-tree: {An} efficient dynamic file structure for exact match queries"
-, booktitle =	"Proc. 10th GI Conf."
-, publisher =	"Springer-Verlag"
-, year =	1980
-, pages =	"375--388"
+, author =      "R. H. G{\"u}ting and H. P. Kriegel"
+, title =       "Multidimensional {$B$}-tree: {An} efficient dynamic file structure for exact match queries"
+, booktitle =   "Proc. 10th GI Conf."
+, publisher =   "Springer-Verlag"
+, year =        1980
+, pages =       "375--388"
 }
 
 @article{gno-faded-89
-, author =	"R. H. G{\"u}ting and O. Nurmi and T. Ottmann"
-, title =	"Fast algorithms for direct enclosures and direct dominances"
-, journal =	"J. Algorithms"
-, volume =	10
-, year =	1989
-, pages =	"170--186"
-, succeeds =	"gno-ddp-85"
+, author =      "R. H. G{\"u}ting and O. Nurmi and T. Ottmann"
+, title =       "Fast algorithms for direct enclosures and direct dominances"
+, journal =     "J. Algorithms"
+, volume =      10
+, year =        1989
+, pages =       "170--186"
+, succeeds =    "gno-ddp-85"
 }
 
 @inproceedings{gno-ddp-85
-, author =	"R. H. G{\"u}ting and O. Nurmi and T. Ottmann"
-, title =	"The direct dominance problem"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"81--88"
-, precedes =	"gno-faded-89"
-, cites =	"b-skrp-77, em-ioo-81, eo-esrp-82, gw-pt-82, k-ddp-85, klp-fmsv-75, lp-iarep-82, l-tarrc-79, m-eaeii-80, nr-bstbb-73, vw-dsrce-80, w-isbt-79, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "R. H. G{\"u}ting and O. Nurmi and T. Ottmann"
+, title =       "The direct dominance problem"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "81--88"
+, precedes =    "gno-faded-89"
+, cites =       "b-skrp-77, em-ioo-81, eo-esrp-82, gw-pt-82, k-ddp-85, klp-fmsv-75, lp-iarep-82, l-tarrc-79, m-eaeii-80, nr-bstbb-73, vw-dsrce-80, w-isbt-79, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{go-nasch-85
-, author =	"R. H. G{\"u}ting and T. Ottmann"
-, title =	"New Algorithms for Special Cases of the Hidden Line Elimination"
-, booktitle =	"Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "R. H. G{\"u}ting and T. Ottmann"
+, title =       "New Algorithms for Special Cases of the Hidden Line Elimination"
+, booktitle =   "Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @techreport{go-nasch-84
-, author =	"R. H. G{\"u}ting and T. Ottmann"
-, title =	"New algorithms for special cases of the hidden line elimination problem"
-, type =	"Report"
-, number =	184
-, institution =	"Lehrstuhl Inform. VI, Univ. Dortmund"
-, address =	"Dortmund, West Germany"
-, year =	1984
-, precedes =	"go-nasch-87"
+, author =      "R. H. G{\"u}ting and T. Ottmann"
+, title =       "New algorithms for special cases of the hidden line elimination problem"
+, type =        "Report"
+, number =      184
+, institution = "Lehrstuhl Inform. VI, Univ. Dortmund"
+, address =     "Dortmund, West Germany"
+, year =        1984
+, precedes =    "go-nasch-87"
 }
 
 @article{go-nasch-87
-, author =	"R. H. G{\"u}ting and T. Ottmann"
-, title =	"New algorithms for special cases of the hidden line elimination problem"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	40
-, year =	1987
-, pages =	"188--204"
-, succeeds =	"go-nasch-84"
+, author =      "R. H. G{\"u}ting and T. Ottmann"
+, title =       "New algorithms for special cases of the hidden line elimination problem"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      40
+, year =        1987
+, pages =       "188--204"
+, succeeds =    "go-nasch-84"
 }
 
 @techreport{gs-pdcar-85
-, author =	"R. H. G{\"u}ting and W. Schilling"
-, title =	"A practical divide-and conquer algorithm for the rectangle intersection problem"
-, type =	"Report"
-, number =	196
-, institution =	"Lehrstuhl Inform. VI, Univ. Dortmund"
-, address =	"Dortmund, West Germany"
-, year =	1985
+, author =      "R. H. G{\"u}ting and W. Schilling"
+, title =       "A practical divide-and conquer algorithm for the rectangle intersection problem"
+, type =        "Report"
+, number =      196
+, institution = "Lehrstuhl Inform. VI, Univ. Dortmund"
+, address =     "Dortmund, West Germany"
+, year =        1985
 }
 
 @techreport{gw-fridc-82
-, author =	"R. H. G{\"u}ting and D. Wood"
-, title =	"Finding rectangle intersections by divide-and-conquer"
-, type =	"Report"
-, number =	"82-CS-04"
-, institution =	"Unit Comput. Sci., McMaster Univ."
-, address =	"Hamilton, ON"
-, year =	1982
-, precedes =	"gw-fridc-84"
+, author =      "R. H. G{\"u}ting and D. Wood"
+, title =       "Finding rectangle intersections by divide-and-conquer"
+, type =        "Report"
+, number =      "82-CS-04"
+, institution = "Unit Comput. Sci., McMaster Univ."
+, address =     "Hamilton, ON"
+, year =        1982
+, precedes =    "gw-fridc-84"
 }
 
 @article{gw-fridc-84
-, author =	"R. H. G{\"u}ting and D. Wood"
-, title =	"Finding rectangle intersections by divide-and-conquer"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-33"
-, year =	1984
-, pages =	"671--675"
-, succeeds =	"gw-fridc-82"
+, author =      "R. H. G{\"u}ting and D. Wood"
+, title =       "Finding rectangle intersections by divide-and-conquer"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-33"
+, year =        1984
+, pages =       "671--675"
+, succeeds =    "gw-fridc-82"
 }
 
 @article{gw-pt-82
-, author =	"R. H. G{\"u}ting and D. Wood"
-, title =	"The parenthesis tree"
-, journal =	"Inform. Sci."
-, volume =	27
-, year =	1982
-, pages =	"151--162"
+, author =      "R. H. G{\"u}ting and D. Wood"
+, title =       "The parenthesis tree"
+, journal =     "Inform. Sci."
+, volume =      27
+, year =        1982
+, pages =       "151--162"
 }
 
 @inproceedings{gww-pgc-89
-, author =	"W. Gutjahr and Emo Welzl and G. Woeginger"
-, title =	"Polynomial graph-colorings"
-, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	349
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"108--119"
-, update =	"98.03 mitchell, 97.03 gaertner+salinger"
+, author =      "W. Gutjahr and Emo Welzl and G. Woeginger"
+, title =       "Polynomial graph-colorings"
+, booktitle =   "Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      349
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "108--119"
+, update =      "98.03 mitchell, 97.03 gaertner+salinger"
 }
 
 @article{gww-pgc-92
-, author =	"W. Gutjahr and Emo Welzl and G. Woeginger"
-, title =	"Polynomial Graph-Colorings"
-, journal =	"Discrete Appl. Math."
-, volume =	8
-, year =	1992
-, pages =	"29--45"
-, update =	"98.03 mitchell, 97.03 gaertner+salinger"
+, author =      "W. Gutjahr and Emo Welzl and G. Woeginger"
+, title =       "Polynomial Graph-Colorings"
+, journal =     "Discrete Appl. Math."
+, volume =      8
+, year =        1992
+, pages =       "29--45"
+, update =      "98.03 mitchell, 97.03 gaertner+salinger"
 }
 
 @article{g-bp-86
-, author =	"E. Gutkin"
-, title =	"Billards in polygons"
-, journal =	"Physica D"
-, volume =	19
-, year =	1986
-, pages =	"311--333"
-, update =	"98.03 bibrelex"
+, author =      "E. Gutkin"
+, title =       "Billards in polygons"
+, journal =     "Physica D"
+, volume =      19
+, year =        1986
+, pages =       "311--333"
+, update =      "98.03 bibrelex"
 }
 
 % jsbm changed the page numbers from "569--592" to "47--57"
 % and removed "SIGACT"; please confirm
 @inproceedings{g-rtdis-84
-, author =	"A. Guttman"
-, title =	"R-Trees: {A} Dynamic Index Structure for Spatial Searching"
-, booktitle =	"Proc. ACM SIGMOD Conf. Principles Database Systems"
-, year =	1984
-, pages =	"47--57"
-, update =	"98.03 mitchell, 94.05 franciosa"
+, author =      "A. Guttman"
+, title =       "R-Trees: {A} Dynamic Index Structure for Spatial Searching"
+, booktitle =   "Proc. ACM SIGMOD Conf. Principles Database Systems"
+, year =        1984
+, pages =       "47--57"
+, update =      "98.03 mitchell, 94.05 franciosa"
 }
 
 @book{g-ims-72
-, author =	"A. G. Guy"
-, title =	"Introduction to Materials Science"
-, publisher =	"McGraw-Hill"
-, year =	1972
-, update =	"97.11 bibrelex"
+, author =      "A. G. Guy"
+, title =       "Introduction to Materials Science"
+, publisher =   "McGraw-Hill"
+, year =        1972
+, update =      "97.11 bibrelex"
 }
 
 @incollection{g-cng-72
-, author =	"R. K. Guy"
-, title =	"Crossing Numbers of Graphs"
-, booktitle =	"Graph Theory and Applications"
-, series =	"Lecture Notes Math."
-, volume =	303
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1972
-, pages =	"111--124"
-, keywords =	"graph drawing"
-, update =	"96.09 agarwal, 93.09 tamassia"
+, author =      "R. K. Guy"
+, title =       "Crossing Numbers of Graphs"
+, booktitle =   "Graph Theory and Applications"
+, series =      "Lecture Notes Math."
+, volume =      303
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1972
+, pages =       "111--124"
+, keywords =    "graph drawing"
+, update =      "96.09 agarwal, 93.09 tamassia"
 }
 
 @inproceedings{g-ao2am-89
-, author =	"M. K. Guyder"
-, title =	"Automating the Optimization of {$2{1\over 2}$}-Axis Milling"
-, editor =	"F. Kimura and A. Rolstad{\aa}s"
-, booktitle =	"Proc. Computer Applications in Production and Engineering"
-, nickname =	"CAPE '89"
-, publisher =	"North-Holland"
-, month =	oct
-, year =	1989
-, pages =	"(supplement)"
-, keywords =	"survey, pocket machining, milling"
-, comments =	"This paper doesn't have page numbers. It was a supplement to the
+, author =      "M. K. Guyder"
+, title =       "Automating the Optimization of {$2{1\over 2}$}-Axis Milling"
+, editor =      "F. Kimura and A. Rolstad{\aa}s"
+, booktitle =   "Proc. Computer Applications in Production and Engineering"
+, nickname =    "CAPE '89"
+, publisher =   "North-Holland"
+, month =       oct
+, year =        1989
+, pages =       "(supplement)"
+, keywords =    "survey, pocket machining, milling"
+, comments =    "This paper doesn't have page numbers. It was a supplement to the
 printed proceeding. (For whatever reasons, it did not get included into
 the printed proceedings.)"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @incollection{g-ccgmp-89
-, author =	"A. Gy{\'a}rf{\'a}s"
-, title =	"Covering complete graphs by monochromatic paths"
-, editor =	"G. Hal{\'a}sz and V. T. S{\'o}s"
-, booktitle =	"Irregularities of Partitions"
-, series =	"Algorithms and Combinatorics"
-, volume =	8
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg"
-, year =	1989
-, pages =	"89--91"
-, update =	"97.11 bibrelex"
+, author =      "A. Gy{\'a}rf{\'a}s"
+, title =       "Covering complete graphs by monochromatic paths"
+, editor =      "G. Hal{\'a}sz and V. T. S{\'o}s"
+, booktitle =   "Irregularities of Partitions"
+, series =      "Algorithms and Combinatorics"
+, volume =      8
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg"
+, year =        1989
+, pages =       "89--91"
+, update =      "97.11 bibrelex"
 }
 
 @article{g-vcmpc-83
-, author =	"A. Gy{\'a}rf{\'a}s"
-, title =	"Vertex coverings by monochromatic paths and cycles"
-, journal =	"J. Graph Theory"
-, volume =	7
-, year =	1983
-, pages =	"131--135"
-, update =	"97.11 bibrelex"
+, author =      "A. Gy{\'a}rf{\'a}s"
+, title =       "Vertex coverings by monochromatic paths and cycles"
+, journal =     "J. Graph Theory"
+, volume =      7
+, year =        1983
+, pages =       "131--135"
+, update =      "97.11 bibrelex"
 }
 
 @article{gl-ccpri-85
-, author =	"A. Gy{\'a}rf{\'a}s and J. Lehel"
-, title =	"Covering and coloring problems for relatives of intervals"
-, journal =	"Discrete Math."
-, volume =	55
-, year =	1985
-, pages =	"167--180"
-, update =	"98.03 bibrelex"
+, author =      "A. Gy{\'a}rf{\'a}s and J. Lehel"
+, title =       "Covering and coloring problems for relatives of intervals"
+, journal =     "Discrete Math."
+, volume =      55
+, year =        1985
+, pages =       "167--180"
+, update =      "98.03 bibrelex"
 }
 
 @article{gl-ofcg-88
-, author =	"A. Gyarfas and J. Lehel"
-, title =	"On-line and First-Fit Colorings of Graphs"
-, journal =	"J. Graph Theory"
-, volume =	12
-, number =	2
-, year =	1988
-, pages =	"217--227"
-, update =	"98.07 bibrelex"
+, author =      "A. Gyarfas and J. Lehel"
+, title =       "On-line and First-Fit Colorings of Graphs"
+, journal =     "J. Graph Theory"
+, volume =      12
+, number =      2
+, year =        1988
+, pages =       "217--227"
+, update =      "98.07 bibrelex"
 }
 
 @article{g-sprag-86
-, author =	"E. Gy{\"o}ri"
-, title =	"A Short Proof of the Rectilinear Art Gallery Theorem"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	7
-, year =	1986
-, pages =	"452--454"
-, update =	"98.11 bibrelex"
+, author =      "E. Gy{\"o}ri"
+, title =       "A Short Proof of the Rectilinear Art Gallery Theorem"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      7
+, year =        1986
+, pages =       "452--454"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{ghks-ggprp-94t
-, author =	"Ervin Gy{\"o}ri and Frank Hoffman and Klaus Kriegel and Thomas Shermer"
-, title =	"Generalized Guarding and Partitioning for Rectilinear Polygons"
-, type =	"Technical Report"
-, number =	"CMPT94-01"
-, institution =	"School of Computing Science, Simon Fraser University"
-, month =	jan
-, year =	1994
-, succeeds =	"ghks-ggprp-94, ghks-ggprp-96"
-, update =	"98.11 bibrelex"
+, author =      "Ervin Gy{\"o}ri and Frank Hoffman and Klaus Kriegel and Thomas Shermer"
+, title =       "Generalized Guarding and Partitioning for Rectilinear Polygons"
+, type =        "Technical Report"
+, number =      "CMPT94-01"
+, institution = "School of Computing Science, Simon Fraser University"
+, month =       jan
+, year =        1994
+, succeeds =    "ghks-ggprp-94, ghks-ggprp-96"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{ghks-ggprp-93
-, author =	"E. Gy{\"o}ri and F. Hoffmann and K. Kriegel and T. Shermer"
-, title =	"Generalized Guarding and Partitioning for Rectilinear Polygon"
-, type =	"Technical Report"
-, number =	"B 93-17"
-, institution =	"Frei Universit{\"a}t Berlin, FB Mathematik-Informatik"
-, month =	dec
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "E. Gy{\"o}ri and F. Hoffmann and K. Kriegel and T. Shermer"
+, title =       "Generalized Guarding and Partitioning for Rectilinear Polygon"
+, type =        "Technical Report"
+, number =      "B 93-17"
+, institution = "Frei Universit{\"a}t Berlin, FB Mathematik-Informatik"
+, month =       dec
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ghks-ggprp-94
-, author =	"E. Gy{\H o}ri and F. Hoffmann and K. Kriegel and T. Shermer"
-, title =	"Generalized Guarding and Partitioning for Rectilinear Polygons"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"302--307"
-, precedes =	"ghks-ggprp-96, ghks-ggprp-94t"
-, cites =	"a-agpiv-84, c-tsplt-91a, g-sprag-86, ghks-ggprp-93, h-ragp-90, hkk-agtph-91, kkk-tgrfw-83, o-aprag-83, o-agta-87, s-rrag-92, s-cgpul-91, s-cgopl-91, bs-tbgph-91, eow-sgrag-84, ZZZ"
-, update =	"98.11 bibrelex, 96.09 devillers, 95.09 agarwal, 94.09 jones"
+, author =      "E. Gy{\H o}ri and F. Hoffmann and K. Kriegel and T. Shermer"
+, title =       "Generalized Guarding and Partitioning for Rectilinear Polygons"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "302--307"
+, precedes =    "ghks-ggprp-96, ghks-ggprp-94t"
+, cites =       "a-agpiv-84, c-tsplt-91a, g-sprag-86, ghks-ggprp-93, h-ragp-90, hkk-agtph-91, kkk-tgrfw-83, o-aprag-83, o-agta-87, s-rrag-92, s-cgpul-91, s-cgopl-91, bs-tbgph-91, eow-sgrag-84, ZZZ"
+, update =      "98.11 bibrelex, 96.09 devillers, 95.09 agarwal, 94.09 jones"
 }
 
 @article{ghks-ggprp-96
-, author =	"E. Gy{\H o}ri and F. Hoffmann and K. Kriegel and T. Shermer"
-, title =	"Generalized Guarding and Partitioning for Rectilinear Polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"21--44"
-, succeeds =	"ghks-ggprp-94"
-, update =	"96.09 devillers"
+, author =      "E. Gy{\H o}ri and F. Hoffmann and K. Kriegel and T. Shermer"
+, title =       "Generalized Guarding and Partitioning for Rectilinear Polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "21--44"
+, succeeds =    "ghks-ggprp-94"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{hbb-chnnr-80
-, author =	"H. P. A. Haas and E. Backer and I. J. Boxma"
-, title =	"Convex hull nearest neighbor rule"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
-, year =	1980
-, pages =	"87--90"
+, author =      "H. P. A. Haas and E. Backer and I. J. Boxma"
+, title =       "Convex hull nearest neighbor rule"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Pattern Recogn."
+, year =        1980
+, pages =       "87--90"
 }
 
 @techreport{hkm-cigno-92
-, author =	"M. Habib and D. Kelly and R. H. M{\"o}hring"
-, title =	"Comparability invariance of geometric notion of order dimension"
-, type =	"Technical {Report}"
-, number =	"320/1992"
-, institution =	"Technical University of Berlin"
-, address =	"Berlin, Germany"
-, year =	1992
-, update =	"94.05 franciosa"
+, author =      "M. Habib and D. Kelly and R. H. M{\"o}hring"
+, title =       "Comparability invariance of geometric notion of order dimension"
+, type =        "Technical {Report}"
+, number =      "320/1992"
+, institution = "Technical University of Berlin"
+, address =     "Berlin, Germany"
+, year =        1992
+, update =      "94.05 franciosa"
 }
 
 @article{h-ca112-62
-, author =	"R. Hacker"
-, title =	"Certification of algorithm 112: position of point relative to polygon"
-, journal =	"Commun. ACM"
-, volume =	5
-, year =	1962
-, pages =	606
+, author =      "R. Hacker"
+, title =       "Certification of algorithm 112: position of point relative to polygon"
+, journal =     "Commun. ACM"
+, volume =      5
+, year =        1962
+, pages =       606
 }
 
 @article{h-esfde-68
-, author =	"H. Hadwiger"
-, title =	"Eine {Schnittrekursion} f{\"u}r die {Eulersche} {Charakteristik} euklidischer {Polyeder} mit {Anwendungen} innerhalb der kombinatorischen {Geometrie}"
-, journal =	"Elem. Math."
-, volume =	23
-, year =	1968
-, pages =	"121--132"
-, update =	"96.09 devillers"
+, author =      "H. Hadwiger"
+, title =       "Eine {Schnittrekursion} f{\"u}r die {Eulersche} {Charakteristik} euklidischer {Polyeder} mit {Anwendungen} innerhalb der kombinatorischen {Geometrie}"
+, journal =     "Elem. Math."
+, volume =      23
+, year =        1968
+, pages =       "121--132"
+, update =      "96.09 devillers"
 }
 
 @article{h-ecukg-55
-, author =	"H. Hadwiger"
-, title =	"Eulers {Charakteristik} und kombinatorische {Geometrie}"
-, journal =	"J. Reine Angew. Math."
-, volume =	134
-, year =	1955
-, pages =	"101--110"
+, author =      "H. Hadwiger"
+, title =       "Eulers {Charakteristik} und kombinatorische {Geometrie}"
+, journal =     "J. Reine Angew. Math."
+, volume =      134
+, year =        1955
+, pages =       "101--110"
 }
 
 @article{h-uegt-57
-, author =	"H. Hadwiger"
-, title =	"{\"U}ber Eibereiche mit gemeinsamer Treffgeraden"
-, journal =	"Portugal Math."
-, volume =	6
-, year =	1957
-, pages =	"23--29"
-, update =	"98.03 bibrelex"
+, author =      "H. Hadwiger"
+, title =       "{\"U}ber Eibereiche mit gemeinsamer Treffgeraden"
+, journal =     "Portugal Math."
+, volume =      6
+, year =        1957
+, pages =       "23--29"
+, update =      "98.03 bibrelex"
 }
 
 @book{hd-kgde-60
-, author =	"H. Hadwiger and H. Debrunner"
-, title =	"Kombinatorische Geometrie in der Ebene"
-, series =	"Monograph. Enseign. Math."
-, volume =	2
-, publisher =	"Enseignement Mathematique"
-, address =	"Geneva, Switzerland"
-, year =	1960
-, precedes =	"hdk-cgp-64"
+, author =      "H. Hadwiger and H. Debrunner"
+, title =       "Kombinatorische Geometrie in der Ebene"
+, series =      "Monograph. Enseign. Math."
+, volume =      2
+, publisher =   "Enseignement Mathematique"
+, address =     "Geneva, Switzerland"
+, year =        1960
+, precedes =    "hdk-cgp-64"
 }
 
 @article{hd-uevzh-57
-, author =	"H. Hadwiger and H. Debrunner"
-, title =	"{\"U}ber eine {Variante} zum {Helly}'schen {Satz}"
-, journal =	"Arch. Math."
-, volume =	8
-, year =	1957
-, pages =	"309--313"
-, update =	"97.11 bibrelex"
+, author =      "H. Hadwiger and H. Debrunner"
+, title =       "{\"U}ber eine {Variante} zum {Helly}'schen {Satz}"
+, journal =     "Arch. Math."
+, volume =      8
+, year =        1957
+, pages =       "309--313"
+, update =      "97.11 bibrelex"
 }
 
 @book{hdk-cgp-64
-, author =	"H. Hadwiger and H. Debrunner and V. Klee"
-, title =	"Combinatorial Geometry in the Plane"
-, publisher =	"Holt, Rinehart \& Winston"
-, address =	"New York"
-, year =	1964
-, succeeds =	"hd-kgde-60"
+, author =      "H. Hadwiger and H. Debrunner and V. Klee"
+, title =       "Combinatorial Geometry in the Plane"
+, publisher =   "Holt, Rinehart \& Winston"
+, address =     "New York"
+, year =        1964
+, succeeds =    "hd-kgde-60"
 }
 
 @inproceedings{hr-tcpp-93
-, author =	"J. Hagauer and G{\"u}nter Rote"
-, title =	"Three-clustering of points in the plane"
-, editor =	"T. Lengauer"
-, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
-, nickname =	"ESA '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	726
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"192--199"
-, precedes =	"hr-tcpp-97"
-, update =	"98.03 mitchell, 97.03 rote, 94.01 rote+smid, 93.09 rote"
+, author =      "J. Hagauer and G{\"u}nter Rote"
+, title =       "Three-clustering of points in the plane"
+, editor =      "T. Lengauer"
+, booktitle =   "Proc. 1st Annu. European Sympos. Algorithms"
+, nickname =    "ESA '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      726
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "192--199"
+, precedes =    "hr-tcpp-97"
+, update =      "98.03 mitchell, 97.03 rote, 94.01 rote+smid, 93.09 rote"
 }
 
 @article{hr-tcpp-97
-, author =	"J. Hagauer and G{\"u}nter Rote"
-, title =	"Three-clustering of points in the plane"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"87--95"
-, update =	"98.07 bibrelex+rote, 98.03 mitchell, 97.03 rote"
-, abstract =	"Given $n$ points in the plane, we partition them into
-		 three classes such that the maximum distance between
-		 two points in the same class is minimized.
-		 The algorithm takes $O(n^2 \log^2 n)$ time."
+, author =      "J. Hagauer and G{\"u}nter Rote"
+, title =       "Three-clustering of points in the plane"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "87--95"
+, update =      "98.07 bibrelex+rote, 98.03 mitchell, 97.03 rote"
+, abstract =    "Given $n$ points in the plane, we partition them into
+                 three classes such that the maximum distance between
+                 two points in the same class is minimized.
+                 The algorithm takes $O(n^2 \log^2 n)$ time."
 }
 
 @inproceedings{hov-raism-00
-, author =	"Michiel Hagedoorn and Mark Overmars and Remco C. Veltkamp"
-, title =	"A Robust Affine Invariant Similarity Measure Based on Visibility"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"112--116"
-, update =	"00.03 bibrelex"
+, author =      "Michiel Hagedoorn and Mark Overmars and Remco C. Veltkamp"
+, title =       "A Robust Affine Invariant Similarity Measure Based on Visibility"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "112--116"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{hv-gmpps-97
-, author =	"M. Hagedoorn and R. Veltkamp"
-, title =	"A general method for partial point set matching"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"406--408"
-, cites =	"hks-uevsi-93, hr-mrtci-92, cghkkk-gpmem-93, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "M. Hagedoorn and R. Veltkamp"
+, title =       "A general method for partial point set matching"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "406--408"
+, cites =       "hks-uevsi-93, hr-mrtci-92, cghkkk-gpmem-93, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @techreport{hv-repma-97
-, author =	"Michiel Hagedoorn and Remco C. Veltkamp"
-, title =	"Reliable and efficient pattern matching using an affine invariant metric"
-, number =	"UU-CS-1997-33"
-, institution =	"Utrecht University, Department of Computing Science"
-, month =	oct
-, year =	1997
-, update =	"97.11 oostrum"
+, author =      "Michiel Hagedoorn and Remco C. Veltkamp"
+, title =       "Reliable and efficient pattern matching using an affine invariant metric"
+, number =      "UU-CS-1997-33"
+, institution = "Utrecht University, Department of Computing Science"
+, month =       oct
+, year =        1997
+, update =      "97.11 oostrum"
 }
 
 @inproceedings{h-gmss-88
-, author =	"H. Hagen"
-, title =	"Geometric modeling of smooth surfaces"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"158--167"
-, update =	"00.03 bibrelex, 99.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "H. Hagen"
+, title =       "Geometric modeling of smooth surfaces"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "158--167"
+, update =      "00.03 bibrelex, 99.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{h-ofa-89
-, author =	"H. Hagen"
-, title =	"{Offset}-{Fl{\"a}chen}-{Algorithmen}"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "H. Hagen"
+, title =       "{Offset}-{Fl{\"a}chen}-{Algorithmen}"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{h-qa-90
-, author =	"Hans Hagen"
-, title =	"{Qualit{\"a}tsanalyse}-{Algorithmen}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	10
-, update =	"00.03 bibrelex"
+, author =      "Hans Hagen"
+, title =       "{Qualit{\"a}tsanalyse}-{Algorithmen}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       10
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{h-vsdsi-93
-, author =	"Hans Hagen"
-, title =	"Variational Surface Design and Surface Interrogation"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"52--55"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Hans Hagen"
+, title =       "Variational Surface Design and Surface Interrogation"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "52--55"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @book{hmn-fsv-93
-, author =	"H. Hagen and H. M{\"u}ller and G. M. Nielson"
-, title =	"Focus on Scientific Visualization"
-, publisher =	"Springer-Verlag"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "H. Hagen and H. M{\"u}ller and G. M. Nielson"
+, title =       "Focus on Scientific Visualization"
+, publisher =   "Springer-Verlag"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{h-fdpa-93
-, author =	"T. Hagerup"
-, title =	"Fast deterministic processor allocation"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"1--10"
-, update =	"97.11 bibrelex"
+, author =      "T. Hagerup"
+, title =       "Fast deterministic processor allocation"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "1--10"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{hjw-epcah-90
-, author =	"T. Hagerup and H. Jung and Emo Welzl"
-, title =	"Efficient parallel computation of arrangements of hyperplanes in $d$ dimensions"
-, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
-, year =	1990
-, pages =	"290--297"
-, update =	"98.03 mitchell, 97.03 gaertner+salinger"
+, author =      "T. Hagerup and H. Jung and Emo Welzl"
+, title =       "Efficient parallel computation of arrangements of hyperplanes in $d$ dimensions"
+, booktitle =   "Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
+, year =        1990
+, pages =       "290--297"
+, update =      "98.03 mitchell, 97.03 gaertner+salinger"
 }
 
 @inproceedings{hr-wmhtb-92
-, author =	"T. Hagerup and R. Raman"
-, title =	"Waste makes haste: Tight bounds for loose, parallel sorting"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"628--637"
-, update =	"97.11 bibrelex"
+, author =      "T. Hagerup and R. Raman"
+, title =       "Waste makes haste: Tight bounds for loose, parallel sorting"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "628--637"
+, update =      "97.11 bibrelex"
 }
 
 @article{hr-gtcb-90
-, author =	"T. Hagerup and C. R{\"u}b"
-, title =	"A guided tour of {Chernoff} bounds"
-, journal =	"Inform. Process. Lett."
-, volume =	33
-, year =	1990
-, pages =	"305--308"
-, update =	"96.09 orourke"
+, author =      "T. Hagerup and C. R{\"u}b"
+, title =       "A guided tour of {Chernoff} bounds"
+, journal =     "Inform. Process. Lett."
+, volume =      33
+, year =        1990
+, pages =       "305--308"
+, update =      "96.09 orourke"
 }
 
 @article{hr-omsep-89
-, author =	"T. Hagerup and C. R{\"u}b"
-, title =	"Optimal Merging and Sorting on the EREW PRAM"
-, journal =	"Inform. Process. Lett."
-, volume =	33
-, year =	1989
-, pages =	"181--185"
-, update =	"96.09 orourke"
+, author =      "T. Hagerup and C. R{\"u}b"
+, title =       "Optimal Merging and Sorting on the EREW PRAM"
+, journal =     "Inform. Process. Lett."
+, volume =      33
+, year =        1989
+, pages =       "181--185"
+, update =      "96.09 orourke"
 }
 
 @article{h-rarb-88
-, author =	"J. K. Hahn"
-, title =	"Realistic animation of rigid bodies"
-, journal =	"Comput. Graph."
-, volume =	22
-, number =	4
-, year =	1988
-, pages =	"299--308"
-, update =	"98.07 bibrelex"
+, author =      "J. K. Hahn"
+, title =       "Realistic animation of rigid bodies"
+, journal =     "Comput. Graph."
+, volume =      22
+, number =      4
+, year =        1988
+, pages =       "299--308"
+, update =      "98.07 bibrelex"
 }
 
 @article{h-sretn-91
-, author =	"M. Haiman"
-, title =	"A simple and relatively efficient triangulation of the $n$-cube"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"287--289"
+, author =      "M. Haiman"
+, title =       "A simple and relatively efficient triangulation of the $n$-cube"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "287--289"
 }
 
 @incollection{h-pps-94
-, author =	"Eric Haines"
-, title =	"Point in Polygon Strategies"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"24--46"
-, keywords =	"computational geometry, inclusion testing, ray-polygon intersection testing"
-, update =	"94.09 heckbert"
-, annote =	"Provides algorithms for testing if a point is inside a
+, author =      "Eric Haines"
+, title =       "Point in Polygon Strategies"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "24--46"
+, keywords =    "computational geometry, inclusion testing, ray-polygon intersection testing"
+, update =      "94.09 heckbert"
+, annote =      "Provides algorithms for testing if a point is inside a
 polygon, a task known as point inclusion testing in computational geometry.
 Point-in-polygon testing is a basic task when ray tracing polygonal models,
 so these methods are useful for 3D as well as 2D graphics. Haines surveys a
@@ -72256,652 +72256,652 @@ @incollection{h-pps-94
 }
 
 @inproceedings{haa-nrmwt-97
-, author =	"Reinhard Hainz and Oswin Aichholzer and Franz Aurenhammer"
-, title =	"New Results on Minimum Weight Triangulations and the {LMT}-Skeleton"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"4--6"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Reinhard Hainz and Oswin Aichholzer and Franz Aurenhammer"
+, title =       "New Results on Minimum Weight Triangulations and the {LMT}-Skeleton"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "4--6"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @incollection{hkss-decic-87
-, author =	"A. Hajnal and P. Komj{\'a}th and L. Soukup and I. Szalkai"
-, title =	"Decompositions of edge colored infinite complete graphs"
-, booktitle =	"Combinatorics"
-, series =	"Colloquia Mathematica Societatis J{\'a}nos Bolyai"
-, volume =	52
-, year =	1987
-, pages =	"277--280"
-, update =	"97.11 bibrelex"
+, author =      "A. Hajnal and P. Komj{\'a}th and L. Soukup and I. Szalkai"
+, title =       "Decompositions of edge colored infinite complete graphs"
+, booktitle =   "Combinatorics"
+, series =      "Colloquia Mathematica Societatis J{\'a}nos Bolyai"
+, volume =      52
+, year =        1987
+, pages =       "277--280"
+, update =      "97.11 bibrelex"
 }
 
 @article{h-ag-57
-, author =	"G. H{\"a}jos"
-, title =	"{\"U}ber eine Art von Graphen"
-, journal =	"Intern. Math. Nachr."
-, volume =	11
-, year =	1957
-, note =	"Problem 65"
-, update =	"98.11 bibrelex"
+, author =      "G. H{\"a}jos"
+, title =       "{\"U}ber eine Art von Graphen"
+, journal =     "Intern. Math. Nachr."
+, volume =      11
+, year =        1957
+, note =        "Problem 65"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{h-rtkpd-97
-, author =	"Wolfgang Haken"
-, title =	"Recognizing the Trivial Knot by Planar Diagrams"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"44--45"
-, update =	"97.11 jones"
+, author =      "Wolfgang Haken"
+, title =       "Recognizing the Trivial Knot by Planar Diagrams"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "44--45"
+, update =      "97.11 jones"
 }
 
 @article{h-tdnei-61
-, author =	"W. Haken"
-, title =	"{Theorie} der {Normalfl{\"a}chen}: {Ein} {Isotopiekriterium} f{\"u}r den {Kreisknoten}"
-, journal =	"Acta Math."
-, volume =	105
-, year =	1961
-, pages =	"245--375"
-, update =	"97.11 bibrelex"
+, author =      "W. Haken"
+, title =       "{Theorie} der {Normalfl{\"a}chen}: {Ein} {Isotopiekriterium} f{\"u}r den {Kreisknoten}"
+, journal =     "Acta Math."
+, volume =      105
+, year =        1961
+, pages =       "245--375"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{h-prf-88
-, author =	"S. l. Hakimi"
-, title =	"A Problem on Rectangular Floorplans"
-, booktitle =	"Proc. Int. Sympos. on Circuits and Systems"
-, year =	1988
-, pages =	"1533--1536"
-, update =	"98.11 bibrelex"
+, author =      "S. l. Hakimi"
+, title =       "A Problem on Rectangular Floorplans"
+, booktitle =   "Proc. Int. Sympos. on Circuits and Systems"
+, year =        1988
+, pages =       "1533--1536"
+, update =      "98.11 bibrelex"
 }
 
 @article{hls-vpnil-92
-, author =	"S. Louis Hakimi and Martine Labb{\'e} and Edward Schmeichel"
-, title =	"The {Voronoi} Partition of a Network and Its Implications in Location Theory"
-, journal =	"ORSA J. Comput."
-, volume =	4
-, number =	4
-, year =	1992
-, pages =	"412--417"
-, update =	"98.03 mitchell"
-, annote =	"Special issue on computational geometry; J. Mitchell and
+, author =      "S. Louis Hakimi and Martine Labb{\'e} and Edward Schmeichel"
+, title =       "The {Voronoi} Partition of a Network and Its Implications in Location Theory"
+, journal =     "ORSA J. Comput."
+, volume =      4
+, number =      4
+, year =        1992
+, pages =       "412--417"
+, update =      "98.03 mitchell"
+, annote =      "Special issue on computational geometry; J. Mitchell and
                   J. Karel Lenstra, eds."
 }
 
 @article{hs-fpfsp-91
-, author =	"S. L. Hakimi and E. F. Schmeichel"
-, title =	"Fitting polygonal functions to a set of points in the plane"
-, journal =	"CVGIP: Graph. Models Image Process."
-, volume =	53
-, number =	2
-, year =	1991
-, pages =	"132--136"
-, update =	"96.09 devillers, 93.09 goodrich"
+, author =      "S. L. Hakimi and E. F. Schmeichel"
+, title =       "Fitting polygonal functions to a set of points in the plane"
+, journal =     "CVGIP: Graph. Models Image Process."
+, volume =      53
+, number =      2
+, year =        1991
+, pages =       "132--136"
+, update =      "96.09 devillers, 93.09 goodrich"
 }
 
 @article{hh-opbtot-00
-, author =	"Lorenz Halbelsen and Norbert Hungerb{\"u}hler"
-, title =	"On periodic billiard trajectories in obtuse triangles"
-, journal =	"SIAM Rev."
-, volume =	42
-, number =	4
-, year =	2000
-, pages =	"657--670"
-, update =	"01.04 orourke"
+, author =      "Lorenz Halbelsen and Norbert Hungerb{\"u}hler"
+, title =       "On periodic billiard trajectories in obtuse triangles"
+, journal =     "SIAM Rev."
+, volume =      42
+, number =      4
+, year =        2000
+, pages =       "657--670"
+, update =      "01.04 orourke"
 }
 
 @incollection{hr-s-83
-, author =	"H. Halberstam and K. F. Roth"
-, title =	"Sequences"
-, booktitle =	"??"
-, publisher =	"Springer-Verlag"
-, address =	"NY"
-, year =	1983
-, pages =	90
-, update =	"98.11 bibrelex"
+, author =      "H. Halberstam and K. F. Roth"
+, title =       "Sequences"
+, booktitle =   "??"
+, publisher =   "Springer-Verlag"
+, address =     "NY"
+, year =        1983
+, pages =       90
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{h-fata-80
-, author =	"W. K. Hale"
-, title =	"Frequency Assignment: Theory and Applications"
-, booktitle =	"Proc. IEEE"
-, volume =	68
-, year =	1980
-, pages =	"1497--1514"
-, update =	"98.07 bibrelex"
+, author =      "W. K. Hale"
+, title =       "Frequency Assignment: Theory and Applications"
+, booktitle =   "Proc. IEEE"
+, volume =      68
+, year =        1980
+, pages =       "1497--1514"
+, update =      "98.07 bibrelex"
 }
 
 @book{hs-et-55
-, author =	"D. W. Hall and G. Spencer"
-, title =	"Elementary Topology"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1955
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "D. W. Hall and G. Spencer"
+, title =       "Elementary Topology"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1955
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{hw-apids-90
-, author =	"M. Hall and J. Warren"
-, title =	"Adaptive Polygonalization of Implicitly Defined Surfaces"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	10
-, number =	6
-, year =	1990
-, pages =	"33--40"
-, annote =	"3D tetrahedronization."
+, author =      "M. Hall and J. Warren"
+, title =       "Adaptive Polygonalization of Implicitly Defined Surfaces"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      10
+, number =      6
+, year =        1990
+, pages =       "33--40"
+, annote =      "3D tetrahedronization."
 }
 
 @book{h-ct-67
-, author =	"M. {Hall, Jr.}"
-, title =	"Combinatoial Theory"
-, publisher =	"John Wiley \& Sons"
-, year =	1967
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "M. {Hall, Jr.}"
+, title =       "Combinatoial Theory"
+, publisher =   "John Wiley \& Sons"
+, year =        1967
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @phdthesis{h-ampac-92
-, author =	"D. Halperin"
-, title =	"Algorithmic Motion Planning via Arrangements of Curves and of Surfaces"
-, type =	"Ph.{D}. Thesis"
-, school =	"Computer Science Department, Tel-Aviv University"
-, address =	"Tel Aviv"
-, month =	jul
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex, 95.05 agarwal"
+, author =      "D. Halperin"
+, title =       "Algorithmic Motion Planning via Arrangements of Curves and of Surfaces"
+, type =        "Ph.{D}. Thesis"
+, school =      "Computer Science Department, Tel-Aviv University"
+, address =     "Tel Aviv"
+, month =       jul
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex, 95.05 agarwal"
 }
 
 @incollection{h-a-97
-, author =	"D. Halperin"
-, title =	"Arrangements"
-, chapter =	21
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"389--412"
-, update =	"97.11 orourke"
+, author =      "D. Halperin"
+, title =       "Arrangements"
+, chapter =     21
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "389--412"
+, update =      "97.11 orourke"
 }
 
 @inproceedings{h-cscca-91
-, author =	"D. Halperin"
-, title =	"On the complexity of a single cell in certain arrangements of surfaces in $3$-space"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"314--323"
-, cites =	"aa-cfi-89, ao-ampps-87, as-tsbac-90, as-cocat-91, a-pdpaa-87, c-crmp-87, cegss-cfals-91, cy-olmpm-89, egs-ccmfa-90, gs-caa-90, gss-gmppt-89, hos-empls-88, hs-icbet-90, klps-ujrcf-86, ks-empac-90, ls-esmpa-87, ps-ueplf-89, p-rmmpc-81, pss-stsps-88, ss-nempa-87, ws-prnds-88, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. Halperin"
+, title =       "On the complexity of a single cell in certain arrangements of surfaces in $3$-space"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "314--323"
+, cites =       "aa-cfi-89, ao-ampps-87, as-tsbac-90, as-cocat-91, a-pdpaa-87, c-crmp-87, cegss-cfals-91, cy-olmpm-89, egs-ccmfa-90, gs-caa-90, gss-gmppt-89, hos-empls-88, hs-icbet-90, klps-ujrcf-86, ks-empac-90, ls-esmpa-87, ps-ueplf-89, p-rmmpc-81, pss-stsps-88, ss-nempa-87, ws-prnds-88, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{h-cscca-94
-, author =	"D. Halperin"
-, title =	"On the complexity of a single cell in certain arrangements of surfaces related to motion planning"
-, journal =	"Discrete Comput. Geom."
-, volume =	11
-, year =	1994
-, pages =	"1--34"
-, succeeds =	"h-cscca-91"
-, update =	"95.01 matousek"
+, author =      "D. Halperin"
+, title =       "On the complexity of a single cell in certain arrangements of surfaces related to motion planning"
+, journal =     "Discrete Comput. Geom."
+, volume =      11
+, year =        1994
+, pages =       "1--34"
+, succeeds =    "h-cscca-91"
+, update =      "95.01 matousek"
 }
 
 @article{h-rmpsc-94
-, author =	"D. Halperin"
-, title =	"Robot Motion Planning and the Single Cell Problem in Arrangements"
-, journal =	"Journal of Intelligent and Robotic Systems"
-, volume =	11
-, year =	1994
-, pages =	"45--65"
-, update =	"98.11 halperin"
+, author =      "D. Halperin"
+, title =       "Robot Motion Planning and the Single Cell Problem in Arrangements"
+, journal =     "Journal of Intelligent and Robotic Systems"
+, volume =      11
+, year =        1994
+, pages =       "45--65"
+, update =      "98.11 halperin"
 }
 
 @incollection{hkl-r-97
-, author =	"D. Halperin and L. E. Kavraki and J.-C. Latombe"
-, title =	"Robotics"
-, chapter =	41
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"755--778"
-, update =	"98.07 agarwal, 97.11 orourke"
+, author =      "D. Halperin and L. E. Kavraki and J.-C. Latombe"
+, title =       "Robotics"
+, chapter =     41
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "755--778"
+, update =      "98.07 agarwal, 97.11 orourke"
 }
 
 @incollection{hlm-dmks-97
-, author =	"D. Halperin and J.-C. Latombe and R. Motwani"
-, title =	"Dynamic Maintenance of Kinematic Structures"
-, editor =	"J. P. Laumond and M. Overmars"
-, booktitle =	"Robotic Motion and Manipulation"
-, publisher =	"A. K. Peters"
-, pages =	"155--170"
-, note =	"WAFR 2"
-, update =	"99.11 bibrelex, 98.11 halperin"
+, author =      "D. Halperin and J.-C. Latombe and R. Motwani"
+, title =       "Dynamic Maintenance of Kinematic Structures"
+, editor =      "J. P. Laumond and M. Overmars"
+, booktitle =   "Robotic Motion and Manipulation"
+, publisher =   "A. K. Peters"
+, pages =       "155--170"
+, note =        "WAFR 2"
+, update =      "99.11 bibrelex, 98.11 halperin"
 }
 
 @unpublished{hlw-gfapm-97
-, author =	"D. Halperin and J.-C. Latombe and R. H. Wilson"
-, title =	"A general framework for assembly planning: {T}he motion space approach"
-, year =	1997
-, note =	"unpublished manuscript"
-, update =	"98.03 agarwal"
+, author =      "D. Halperin and J.-C. Latombe and R. H. Wilson"
+, title =       "A general framework for assembly planning: {T}he motion space approach"
+, year =        1997
+, note =        "unpublished manuscript"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{ho-empls-89
-, author =	"D. Halperin and M. H. Overmars"
-, title =	"Efficient motion planning for an {L}-shaped object"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"156--166"
-, precedes =	"hos-empls-92"
-, cites =	"abf-pempa-89, as-tsbac-88, ao-ampps-87, c-crmp-87, gss-gmppt-88, ko-lbmlt-87a, ko-cst-88, ks-eapcf-85, ks-empac-90, ls-esmpa-87, lw-apcfp-79, m-mdscg-84, oy-rmpmd-85, o-gdscg-88, ss-nempa-87, ss-pmp1c-83, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "D. Halperin and M. H. Overmars"
+, title =       "Efficient motion planning for an {L}-shaped object"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "156--166"
+, precedes =    "hos-empls-92"
+, cites =       "abf-pempa-89, as-tsbac-88, ao-ampps-87, c-crmp-87, gss-gmppt-88, ko-lbmlt-87a, ko-cst-88, ks-eapcf-85, ks-empac-90, ls-esmpa-87, lw-apcfp-79, m-mdscg-84, oy-rmpmd-85, o-gdscg-88, ss-nempa-87, ss-pmp1c-83, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ho-smhsr-94
-, author =	"D. Halperin and M. H. Overmars"
-, title =	"Spheres, Molecules, and Hidden Surface Removal"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"113--122"
-, cites =	"abbkw-pdb-87, bkwmbrkst-pdbcb-77, cegs-sessr-91, cegsw-ccbac-90, c-saspn-83, b-rsdoh-93, dkmmrt-dphul-88, fp-eagcs-93, fo-fdmm-, gs-pmgsc-85, s-hb-70, kos-ehsro-92, klps-ujrcf-86, lr-ipses-71, mmpssw-ftdlm-91, m-ms-90, o-plfs-92, ps-cgi-85, s-atubl-93, sho-cfsrm-93, vb-facrs-93, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "D. Halperin and M. H. Overmars"
+, title =       "Spheres, Molecules, and Hidden Surface Removal"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "113--122"
+, cites =       "abbkw-pdb-87, bkwmbrkst-pdbcb-77, cegs-sessr-91, cegsw-ccbac-90, c-saspn-83, b-rsdoh-93, dkmmrt-dphul-88, fp-eagcs-93, fo-fdmm-, gs-pmgsc-85, s-hb-70, kos-ehsro-92, klps-ujrcf-86, lr-ipses-71, mmpssw-ftdlm-91, m-ms-90, o-plfs-92, ps-cgi-85, s-atubl-93, sho-cfsrm-93, vb-facrs-93, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @techreport{hos-empls-88
-, author =	"D. Halperin and M. H. Overmars and Micha Sharir"
-, title =	"Efficient motion planning for an {L}-shaped object"
-, type =	"Technical {Report}"
-, number =	418
-, institution =	"Courant Institute of Mathematical Science"
-, year =	1988
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "D. Halperin and M. H. Overmars and Micha Sharir"
+, title =       "Efficient motion planning for an {L}-shaped object"
+, type =        "Technical {Report}"
+, number =      418
+, institution = "Courant Institute of Mathematical Science"
+, year =        1988
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{hos-empls-92
-, author =	"D. Halperin and M. H. Overmars and Micha Sharir"
-, title =	"Efficient motion planning for an {L}-shaped object"
-, journal =	"SIAM J. Comput."
-, volume =	21
-, year =	1992
-, pages =	"1--23"
-, succeeds =	"ho-empls-89"
-, update =	"98.03 mitchell"
+, author =      "D. Halperin and M. H. Overmars and Micha Sharir"
+, title =       "Efficient motion planning for an {L}-shaped object"
+, journal =     "SIAM J. Comput."
+, volume =      21
+, year =        1992
+, pages =       "1--23"
+, succeeds =    "ho-empls-89"
+, update =      "98.03 mitchell"
 }
 
 @article{hs-nqapm-96
-, author =	"D. Halperin and Micha Sharir"
-, title =	"A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, year =	1996
-, pages =	"121--134"
-, succeeds =	"hs-nqbmp-93t"
-, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 smid"
+, author =      "D. Halperin and Micha Sharir"
+, title =       "A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, year =        1996
+, pages =       "121--134"
+, succeeds =    "hs-nqbmp-93t"
+, update =      "98.11 bibrelex, 98.03 mitchell, 97.03 smid"
 }
 
 @inproceedings{hs-atubs-94
-, author =	"D. Halperin and Micha Sharir"
-, title =	"Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"11--20"
-, precedes =	"hs-atubs-95"
-, cites =	"ass-sulbl-89, ams-sscch-91, aps-zsha-93, as-tsbac-90, as-car-92, as-tmp3s-94, bcr-gar-87, cegss-cfals-93, cs-arscg-89, bgh-vdt3s-94, e-acg-87, egppss-acptc-92, ess-ztha-93, gss-gmppt-89, h-ampac-92, hs-nblet-93, hs-nqbmp-93, hs-ndssg-86, h-ag-77, h-dt-76, m-mnfcp-70, ps-ueplf-89, pr-ncdsp-93, ss-tddsp-90, s-ksacs-91, s-atubl-93, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 97.11 aronov, 94.09 jones, 94.01 jones"
+, author =      "D. Halperin and Micha Sharir"
+, title =       "Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "11--20"
+, precedes =    "hs-atubs-95"
+, cites =       "ass-sulbl-89, ams-sscch-91, aps-zsha-93, as-tsbac-90, as-car-92, as-tmp3s-94, bcr-gar-87, cegss-cfals-93, cs-arscg-89, bgh-vdt3s-94, e-acg-87, egppss-acptc-92, ess-ztha-93, gss-gmppt-89, h-ampac-92, hs-nblet-93, hs-nqbmp-93, hs-ndssg-86, h-ag-77, h-dt-76, m-mnfcp-70, ps-ueplf-89, pr-ncdsp-93, ss-tddsp-90, s-ksacs-91, s-atubl-93, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 97.11 aronov, 94.09 jones, 94.01 jones"
 }
 
-% also claimed, pages =	"313--326"
+% also claimed, pages = "313--326"
 @article{hs-atubs-95
-, author =	"D. Halperin and Micha Sharir"
-, title =	"Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	14
-, year =	1995
-, pages =	"385--410"
-, succeeds =	"hs-atubs-94"
-, update =	"98.03 mitchell, 97.11 aronov+bibrelex"
+, author =      "D. Halperin and Micha Sharir"
+, title =       "Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      14
+, year =        1995
+, pages =       "385--410"
+, succeeds =    "hs-atubs-94"
+, update =      "98.03 mitchell, 97.11 aronov+bibrelex"
 }
 
 @incollection{hs-atarr-95
-, author =	"D. Halperin and Micha Sharir"
-, title =	"Arrangements and their applications in robotics: Recent developments"
-, editor =	"K. Goldberg and D. Halperin and J.-C. Latombe and R. Wilson"
-, booktitle =	"Algorithmic Foundations of Robotics"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1995
-, pages =	"495--511"
-, update =	"99.11 bibrelex, 98.07 agarwal, 98.03 agarwal+mitchell, 95.09 agarwal, 95.05 agarwal"
+, author =      "D. Halperin and Micha Sharir"
+, title =       "Arrangements and their applications in robotics: Recent developments"
+, editor =      "K. Goldberg and D. Halperin and J.-C. Latombe and R. Wilson"
+, booktitle =   "Algorithmic Foundations of Robotics"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1995
+, pages =       "495--511"
+, update =      "99.11 bibrelex, 98.07 agarwal, 98.03 agarwal+mitchell, 95.09 agarwal, 95.05 agarwal"
 }
 
 @article{hs-cdcca-94
-, author =	"D. Halperin and Micha Sharir"
-, title =	"Corrigendum: On disjoint concave chains in arrangements of (pseudo) lines"
-, journal =	"Inform. Process. Lett."
-, volume =	51
-, year =	1994
-, pages =	"53--56"
-, keywords =	"polygonal chains, tight bounds, combinatorial complexity, line arrangements"
-, succeeds =	"hs-dccap-91"
-, update =	"98.11 aronov, 98.03 mitchell, 97.07 aronov"
+, author =      "D. Halperin and Micha Sharir"
+, title =       "Corrigendum: On disjoint concave chains in arrangements of (pseudo) lines"
+, journal =     "Inform. Process. Lett."
+, volume =      51
+, year =        1994
+, pages =       "53--56"
+, keywords =    "polygonal chains, tight bounds, combinatorial complexity, line arrangements"
+, succeeds =    "hs-dccap-91"
+, update =      "98.11 aronov, 98.03 mitchell, 97.07 aronov"
 }
 
 @techreport{hs-icbet-90t
-, author =	"D. Halperin and M. Sharir"
-, title =	"Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom"
-, type =	"Technical {Report}"
-, number =	"176/90"
-, institution =	"Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
-, address =	"Tel-Aviv, Israel"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "D. Halperin and M. Sharir"
+, title =       "Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom"
+, type =        "Technical {Report}"
+, number =      "176/90"
+, institution = "Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
+, address =     "Tel-Aviv, Israel"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{hs-icbet-90
-, author =	"D. Halperin and M. Sharir"
-, title =	"Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"98--101"
-, precedes =	"hs-icbet-92"
-, cites =	"ao-ampps-87, as-tsbac-90, cegsw-ccbac-90, hos-empls-88, hs-icbet-90t, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "D. Halperin and M. Sharir"
+, title =       "Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "98--101"
+, precedes =    "hs-icbet-92"
+, cites =       "ao-ampps-87, as-tsbac-90, cegsw-ccbac-90, hos-empls-88, hs-icbet-90t, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @article{hs-icbet-92
-, author =	"D. Halperin and Micha Sharir"
-, title =	"Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, number =	5
-, year =	1992
-, pages =	"269--303"
-, keywords =	"robotics, motion planning, arrangements, configuration space"
-, succeeds =	"hs-icbet-90"
-, update =	"98.03 mitchell"
+, author =      "D. Halperin and Micha Sharir"
+, title =       "Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, number =      5
+, year =        1992
+, pages =       "269--303"
+, keywords =    "robotics, motion planning, arrangements, configuration space"
+, succeeds =    "hs-icbet-90"
+, update =      "98.03 mitchell"
 }
 
 @techreport{hs-nqbmp-93t
-, author =	"D. Halperin and Micha Sharir"
-, title =	"Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment"
-, type =	"manuscript"
-, year =	1993
-, precedes =	"hs-nqbmp-93, hs-nqapm-96"
-, update =	"98.11 bibrelex"
+, author =      "D. Halperin and Micha Sharir"
+, title =       "Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment"
+, type =        "manuscript"
+, year =        1993
+, precedes =    "hs-nqbmp-93, hs-nqapm-96"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{hs-nqbmp-93
-, author =	"D. Halperin and Micha Sharir"
-, title =	"Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"382--391"
-, succeeds =	"hs-nqbmp-93t"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 96.09 orourke, 94.01 smid, 93.09 milone+mitchell"
+, author =      "D. Halperin and Micha Sharir"
+, title =       "Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "382--391"
+, succeeds =    "hs-nqbmp-93t"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 96.09 orourke, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{hs-nblet-93
-, author =	"D. Halperin and Micha Sharir"
-, title =	"New bounds for lower envelopes in three dimensions, with applications to visibility in terrains"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"11--18"
-, cites =	"ass-sulbl-89, bhok-sanvp-92, cegs-sessr-89, cegs-lscaa-89, cegsw-ccbac-90, cs-arscg-89, cs-vppt-89, h-ampac-92, hs-nqbmp-93, hs-ndssg-86, ps-ueplf-89, p-lmps3-93, ss-tddsp-90, s-ksacs-91, s-atubl-93, sa-dsstg-95, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 93.09 devillers"
+, author =      "D. Halperin and Micha Sharir"
+, title =       "New bounds for lower envelopes in three dimensions, with applications to visibility in terrains"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "11--18"
+, cites =       "ass-sulbl-89, bhok-sanvp-92, cegs-sessr-89, cegs-lscaa-89, cegsw-ccbac-90, cs-arscg-89, cs-vppt-89, h-ampac-92, hs-nqbmp-93, hs-ndssg-86, ps-ueplf-89, p-lmps3-93, ss-tddsp-90, s-ksacs-91, s-atubl-93, sa-dsstg-95, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 93.09 devillers"
 }
 
 %, number =      3
 @article{hs-nblet-94
-, author =	"D. Halperin and Micha Sharir"
-, title =	"New bounds for lower envelopes in three dimensions, with applications to visibility in terrains"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"313--326"
-, succeeds =	"hs-nblet-93"
-, update =	"98.03 mitchell, 95.01 orourke+smid"
+, author =      "D. Halperin and Micha Sharir"
+, title =       "New bounds for lower envelopes in three dimensions, with applications to visibility in terrains"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "313--326"
+, succeeds =    "hs-nblet-93"
+, update =      "98.03 mitchell, 95.01 orourke+smid"
 }
 
 @article{hs-dccap-91
-, author =	"D. Halperin and Micha Sharir"
-, title =	"On disjoint concave chains in arrangements of (pseudo) lines"
-, journal =	"Inform. Process. Lett."
-, volume =	40
-, number =	4
-, year =	1991
-, pages =	"189--192"
-, keywords =	"polygonal chains, tight bounds, combinatorial complexity, line arrangements"
-, precedes =	"hs-cdcca-94"
-, update =	"98.03 mitchell, 97.07 aronov"
+, author =      "D. Halperin and Micha Sharir"
+, title =       "On disjoint concave chains in arrangements of (pseudo) lines"
+, journal =     "Inform. Process. Lett."
+, volume =      40
+, number =      4
+, year =        1991
+, pages =       "189--192"
+, keywords =    "polygonal chains, tight bounds, combinatorial complexity, line arrangements"
+, precedes =    "hs-cdcca-94"
+, update =      "98.03 mitchell, 97.07 aronov"
 }
 
 @unpublished{hs-cscas
-, author =	"D. Halperin and M. Sharir"
-, title =	"On the complexity of a single cell in an arrangement of surfaces in 3 dimensions"
-, note =	"in preparation"
-, update =	"98.11 bibrelex"
+, author =      "D. Halperin and M. Sharir"
+, title =       "On the complexity of a single cell in an arrangement of surfaces in 3 dimensions"
+, note =        "in preparation"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{hsg-tcpo-00
-, author =	"Dan Halperin and Micha Sharir and Ken Goldberg"
-, title =	"The 2-Center problem with obstacles"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"80--90"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Dan Halperin and Micha Sharir and Ken Goldberg"
+, title =       "The 2-Center problem with obstacles"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "80--90"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{hs-pssaa-97
-, author =	"D. Halperin and C. Shelton"
-, title =	"A perturbation scheme for spherical arrangements with application to molecular modeling"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"183--192"
-, cites =	"bmb-pmmca-94, c-amsc-83, c-msr-96, e-acg-87, em-sstcd-90, fhklmsv-gmfl-96, fklmsvy-rrpid-97, f-riga-96i, fv-sayee-96, g-imap-95, gy-frcg-86, gs-pmgsc-85, ho-smhsr-94, h-gsm-89, h-pargc-89, m-ms-90, m-vigau-88a, ps-cgi-85, sos-frcms-95, s-rafpg-96, s-fprgo-89, si-tdpga-89, vbw-csms-94, yd-ecp-95, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "D. Halperin and C. Shelton"
+, title =       "A perturbation scheme for spherical arrangements with application to molecular modeling"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "183--192"
+, cites =       "bmb-pmmca-94, c-amsc-83, c-msr-96, e-acg-87, em-sstcd-90, fhklmsv-gmfl-96, fklmsvy-rrpid-97, f-riga-96i, fv-sayee-96, g-imap-95, gy-frcg-86, gs-pmgsc-85, ho-smhsr-94, h-gsm-89, h-pargc-89, m-ms-90, m-vigau-88a, ps-cgi-85, sos-frcms-95, s-rafpg-96, s-fprgo-89, si-tdpga-89, vbw-csms-94, yd-ecp-95, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{hs-pssaa-98
-, author =	"Dan Halperin and Christian R. Shelton"
-, title =	"A perturbation scheme for spherical arrangements with application to molecular modeling"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"273--287"
-, succeeds =	"hs-pssaa-97"
-, update =	"98.11 devillers"
+, author =      "Dan Halperin and Christian R. Shelton"
+, title =       "A perturbation scheme for spherical arrangements with application to molecular modeling"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "273--287"
+, succeeds =    "hs-pssaa-97"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{hw-apasp-95
-, author =	"D. Halperin and R. H. Wilson"
-, title =	"Assembly partitioning along simple paths: the case of multiple translations"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1995
-, pages =	"1585--1592"
-, keywords =	"robotics, assembly planning, separability, arrangements"
-, update =	"95.09 halperin"
+, author =      "D. Halperin and R. H. Wilson"
+, title =       "Assembly partitioning along simple paths: the case of multiple translations"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1995
+, pages =       "1585--1592"
+, keywords =    "robotics, assembly planning, separability, arrangements"
+, update =      "95.09 halperin"
 }
 
 @article{hw-apasp-97
-, author =	"D. Halperin and R. H. Wilson"
-, title =	"Assembly Partitioning along Simple Paths: the Case of Multiple Translations"
-, journal =	"Advanced Robotics"
-, volume =	11
-, year =	1997
-, pages =	"127--145"
-, update =	"98.11 halperin"
+, author =      "D. Halperin and R. H. Wilson"
+, title =       "Assembly Partitioning along Simple Paths: the Case of Multiple Translations"
+, journal =     "Advanced Robotics"
+, volume =      11
+, year =        1997
+, pages =       "127--145"
+, update =      "98.11 halperin"
 }
 
 @inproceedings{hy-cctbp-93
-, author =	"D. Halperin and C.-K. Yap"
-, title =	"Combinatorial complexity of translating a box in polyhedral $3$-space"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"29--37"
-, cites =	"as-car-92, ck-hcmpc-90, gss-gmppt-89, h-ampac-92, hs-ndssg-86, ko-amltd-87, klps-ujrcf-86, ks-empac-90, l-rmp-91, ls-ncfcc-87, ls-pptmc-87, s-eappt-87, s-ampr-89, y-amp-87, ZZZ"
-, update =	"98.03 bibrelex, 93.09 devillers"
+, author =      "D. Halperin and C.-K. Yap"
+, title =       "Combinatorial complexity of translating a box in polyhedral $3$-space"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "29--37"
+, cites =       "as-car-92, ck-hcmpc-90, gss-gmppt-89, h-ampac-92, hs-ndssg-86, ko-amltd-87, klps-ujrcf-86, ks-empac-90, l-rmp-91, ls-ncfcc-87, ls-pptmc-87, s-eappt-87, s-ampr-89, y-amp-87, ZZZ"
+, update =      "98.03 bibrelex, 93.09 devillers"
 }
 
 @article{hy-cctbp-98
-, author =	"D. Halperin and C.-K. Yap"
-, title =	"Combinatorial complexity of translating a box in polyhedral $3$-space"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, year =	1998
-, pages =	"181--196"
-, update =	"98.03 smid"
+, author =      "D. Halperin and C.-K. Yap"
+, title =       "Combinatorial complexity of translating a box in polyhedral $3$-space"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, year =        1998
+, pages =       "181--196"
+, update =      "98.03 smid"
 }
 
 @inproceedings{hz-orltc-94
-, author =	"S. Halperin and U. Zwick"
-, title =	"An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM"
-, booktitle =	"Proc. ACM Sympos. Parallel Algorithms Architect."
-, year =	1994
-, pages =	"1--10"
-, update =	"96.09 orourke"
+, author =      "S. Halperin and U. Zwick"
+, title =       "An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM"
+, booktitle =   "Proc. ACM Sympos. Parallel Algorithms Architect."
+, year =        1994
+, pages =       "1--10"
+, update =      "96.09 orourke"
 }
 
 @article{h-ecqsp-60
-, author =	"J. H. Halton"
-, title =	"On the efficiency of certain quasirandom sequences of points in evaluating multidimensional integrals"
-, journal =	"Numer. Math."
-, volume =	2
-, year =	1960
-, pages =	"84--90"
-, update =	"98.03 bibrelex"
+, author =      "J. H. Halton"
+, title =       "On the efficiency of certain quasirandom sequences of points in evaluating multidimensional integrals"
+, journal =     "Numer. Math."
+, volume =      2
+, year =        1960
+, pages =       "84--90"
+, update =      "98.03 bibrelex"
 }
 
 @article{ht-faets-82
-, author =	"J. H. Halton and R. Terada"
-, title =	"A fast algorithm for the {Euclidean} traveling salesman problem, optimal with probability one"
-, journal =	"SIAM J. Comput."
-, volume =	11
-, year =	1982
-, pages =	"28--46"
+, author =      "J. H. Halton and R. Terada"
+, title =       "A fast algorithm for the {Euclidean} traveling salesman problem, optimal with probability one"
+, journal =     "SIAM J. Comput."
+, volume =      11
+, year =        1982
+, pages =       "28--46"
 }
 
 @techreport{ht-asoae-78
-, author =	"J. H. Halton and R. Terada"
-, title =	"An almost surely optimal algorithm for the {Euclidean} traveling salesman problem"
-, type =	"Report"
-, number =	335
-, institution =	"Dept. Comput. Sci., Univ. Wisconsin"
-, address =	"Madison, WI"
-, year =	1978
+, author =      "J. H. Halton and R. Terada"
+, title =       "An almost surely optimal algorithm for the {Euclidean} traveling salesman problem"
+, type =        "Report"
+, number =      335
+, institution = "Dept. Comput. Sci., Univ. Wisconsin"
+, address =     "Madison, WI"
+, year =        1978
 }
 
 @inproceedings{h-gmla-97
-, author =	"Horst W. Hamacher"
-, title =	"Geometric Methods in Location Analysis"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	16
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Horst W. Hamacher"
+, title =       "Geometric Methods in Location Analysis"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       16
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @book{h-mlps-95
-, author =	"Horst W. Hamacher"
-, title =	"{Mathematische} {L{\"o}sungsverfahren} f{\"u}r planare {Standortprobleme}"
-, publisher =	"Verlag Vieweg"
-, address =	"Wiesbaden"
-, year =	1995
-, update =	"97.03 icking"
+, author =      "Horst W. Hamacher"
+, title =       "{Mathematische} {L{\"o}sungsverfahren} f{\"u}r planare {Standortprobleme}"
+, publisher =   "Verlag Vieweg"
+, address =     "Wiesbaden"
+, year =        1995
+, update =      "97.03 icking"
 }
 
 @article{h-drsts-94
-, author =	"B. Hamann"
-, title =	"A Data Reduction Scheme for Triangulated Surfaces"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	11
-, year =	1994
-, pages =	"197--214"
-, update =	"95.01 mitchell"
+, author =      "B. Hamann"
+, title =       "A Data Reduction Scheme for Triangulated Surfaces"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      11
+, year =        1994
+, pages =       "197--214"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{hd-dmkwc-92
-, author =	"S. Hambrusch and F. Dehne"
-, title =	"Determining maximum $k$-width connectivity on meshes"
-, booktitle =	"Proc. IEEE Internat. Parallel Process. Sympos."
-, year =	1992
-, pages =	""
-, update =	"94.01 dehne"
+, author =      "S. Hambrusch and F. Dehne"
+, title =       "Determining maximum $k$-width connectivity on meshes"
+, booktitle =   "Proc. IEEE Internat. Parallel Process. Sympos."
+, year =        1992
+, pages =       ""
+, update =      "94.01 dehne"
 }
 
 @article{hd-dmkwc-94
-, author =	"S. Hambrusch and F. Dehne"
-, title =	"Determining maximum $k$-width-connectivity on meshes"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	"??"
-, year =	1993
-, pages =	"91--105"
-, update =	"96.09 devillers, 94.01 dehne"
+, author =      "S. Hambrusch and F. Dehne"
+, title =       "Determining maximum $k$-width-connectivity on meshes"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      "??"
+, year =        1993
+, pages =       "91--105"
+, update =      "96.09 devillers, 94.01 dehne"
 }
 
 @article{ht-f1dcf-92
-, author =	"S. Hambrusch and H.-Y. Tu"
-, title =	"A framework for 1-{D} compaction with forbidden region avoidance"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, number =	4
-, year =	1992
-, pages =	"203--226"
-, keywords =	"analysis of algorithms, compaction, forbidden regions, visibility graphs, VLSI layouts"
+, author =      "S. Hambrusch and H.-Y. Tu"
+, title =       "A framework for 1-{D} compaction with forbidden region avoidance"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, number =      4
+, year =        1992
+, pages =       "203--226"
+, keywords =    "analysis of algorithms, compaction, forbidden regions, visibility graphs, VLSI layouts"
 }
 
 @inproceedings{ht-namlw-93
-, author =	"Susanne E. Hambrusch and Hung-Yi Tony Tu"
-, title =	"New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"446--455"
-, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Susanne E. Hambrusch and Hung-Yi Tony Tu"
+, title =       "New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "446--455"
+, update =      "98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @book{h-eq-69
-, author =	"W. R. Hamilton"
-, title =	"Elements of Quaternions"
-, publisher =	"Chelsea Publishing Cl."
-, address =	"N. Y."
-, year =	1969
-, update =	"98.11 bibrelex"
+, author =      "W. R. Hamilton"
+, title =       "Elements of Quaternions"
+, publisher =   "Chelsea Publishing Cl."
+, address =     "N. Y."
+, year =        1969
+, update =      "98.11 bibrelex"
 }
 
 @article{hg-rshsa-77
-, author =	"G. Hamlin and C. W. Gear"
-, title =	"Raster-scan hidden surface algorithm techniques"
-, journal =	"Comput. Graph."
-, volume =	11
-, number =	2
-, year =	1977
-, pages =	"206--213"
-, note =	"Proc. SIGGRAPH '77"
+, author =      "G. Hamlin and C. W. Gear"
+, title =       "Raster-scan hidden surface algorithm techniques"
+, journal =     "Comput. Graph."
+, volume =      11
+, number =      2
+, year =        1977
+, pages =       "206--213"
+, note =        "Proc. SIGGRAPH '77"
 }
 
 @inproceedings{hn-ctbes-97
-, author =	"M. Hammar and Bengt J. Nilsson"
-, title =	"Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms"
-, booktitle =	"Proc. 11th International Symposium on Fundamentals of Computation Theory"
-, nickname =	"FCT '97"
-, site =	"Krakow, Poland"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1279
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"210--221"
-, comments =	"LU-CS-TR:97-186, LUNDFD6/(NFCS-3119)/1-18/1997"
-, update =	"02.03 icking, 00.11 smid, 00.07 icking, 99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
-, annote =	"
+, author =      "M. Hammar and Bengt J. Nilsson"
+, title =       "Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms"
+, booktitle =   "Proc. 11th International Symposium on Fundamentals of Computation Theory"
+, nickname =    "FCT '97"
+, site =        "Krakow, Poland"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1279
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "210--221"
+, comments =    "LU-CS-TR:97-186, LUNDFD6/(NFCS-3119)/1-18/1997"
+, update =      "02.03 icking, 00.11 smid, 00.07 icking, 99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, annote =      "
 An error was discovered in the earlier papers on watchman routes: It
 turns out that the ``adjustment'' algorithm that modifies a route in
 order to achieve the reflection property at essential cuts may in fact
@@ -72910,5851 +72910,5851 @@ @inproceedings{hn-ctbes-97
 }
 
 @inproceedings{hns-psmr-99
-, author =	"Mikael Hammar and Bengt J. Nilsson and Sven Schuierer"
-, title =	"Parallel Searching on $m$ Rays"
-, booktitle =	"Proc. 16th Sympos. Theoret. Aspects Comput. Sci."
-, nickname =	"STACS '99"
-, site =	"Trier"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1563
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"132--142"
-, succeeds =	"ikl-ocsws-98"
-, update =	"99.07 bibrelex"
+, author =      "Mikael Hammar and Bengt J. Nilsson and Sven Schuierer"
+, title =       "Parallel Searching on $m$ Rays"
+, booktitle =   "Proc. 16th Sympos. Theoret. Aspects Comput. Sci."
+, nickname =    "STACS '99"
+, site =        "Trier"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1563
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "132--142"
+, succeeds =    "ikl-ocsws-98"
+, update =      "99.07 bibrelex"
 }
 
 @article{hns-psmr-01
-, author =	"M. Hammar and B. J. Nilsson and S. Schuierer"
-, title =	"Parallel Searching on $m$ Rays"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	18
-, year =	2001
-, pages =	"125--139"
-, update =	"01.07 smid"
+, author =      "M. Hammar and B. J. Nilsson and S. Schuierer"
+, title =       "Parallel Searching on $m$ Rays"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      18
+, year =        2001
+, pages =       "125--139"
+, update =      "01.07 smid"
 }
 
 @article{h-etdf-63
-, author =	"P. C. Hammer"
-, title =	"Extended Topology: Domain Finiteness"
-, journal =	"Indagationes Mathematicae"
-, volume =	25
-, year =	1963
-, pages =	"200--212"
-, update =	"98.07 bibrelex"
+, author =      "P. C. Hammer"
+, title =       "Extended Topology: Domain Finiteness"
+, journal =     "Indagationes Mathematicae"
+, volume =      25
+, year =        1963
+, pages =       "200--212"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{h-p2-63
-, author =	"P. C. Hammer"
-, title =	"Problem 2"
-, booktitle =	"Proc. Sympos. Pure Math. vol VII"
-, organization =	"Amer. Math. Soc."
-, year =	1963
-, pages =	"498--499"
-, update =	"98.11 bibrelex"
+, author =      "P. C. Hammer"
+, title =       "Problem 2"
+, booktitle =   "Proc. Sympos. Pure Math. vol VII"
+, organization =        "Amer. Math. Soc."
+, year =        1963
+, pages =       "498--499"
+, update =      "98.11 bibrelex"
 }
 
 @book{hhkr-ctvc-95
-, author =	"R. Hammer and M. Hocks and U. Kulisch and D. Ratz"
-, title =	"C++ Toolbox for Verified Computing"
-, publisher =	"Springer"
-, year =	1995
-, update =	"00.03 devillers"
+, author =      "R. Hammer and M. Hocks and U. Kulisch and D. Ratz"
+, title =       "C++ Toolbox for Verified Computing"
+, publisher =   "Springer"
+, year =        1995
+, update =      "00.03 devillers"
 }
 
 @techreport{hs-sugpm-90
-, author =	"S. Hammond and R. Schreiber"
-, title =	"Solving unstructured grid problems on massively parallel computers"
-, type =	"Technical {Report}"
-, number =	"90.22"
-, institution =	"Research Institute for Advanced Computer Science"
-, year =	1990
-, update =	"98.03 bibrelex"
+, author =      "S. Hammond and R. Schreiber"
+, title =       "Solving unstructured grid problems on massively parallel computers"
+, type =        "Technical {Report}"
+, number =      "90.22"
+, institution = "Research Institute for Advanced Computer Science"
+, year =        1990
+, update =      "98.03 bibrelex"
 }
 
 @book{hrrs-rsabi-86
-, author =	"F. R. Hampel and E. M. Ronchetti and P. J. Rousseeuw and W. A. Stahel"
-, title =	"Robust Statistics: The Approach Based on Influence Functions"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1986
-, update =	"98.11 bibrelex"
+, author =      "F. R. Hampel and E. M. Ronchetti and P. J. Rousseeuw and W. A. Stahel"
+, title =       "Robust Statistics: The Approach Based on Influence Functions"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1986
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{hm-iorac-96
-, author =	"Kyung-Ah Han and Sung-Hyun Myaeng"
-, title =	"Image Organization and Retrieval with Automatically Constructed Feature Vectors"
-, editor =	"Hans-Peter Frei and Donna Harman and Peter Sch{\"a}uble and Ross Wilkinson"
-, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
-, publisher =	"ACM Press"
-, address =	"New York"
-, month =	aug
-, year =	1996
-, pages =	"157--165"
-, update =	"98.07 agarwal"
+, author =      "Kyung-Ah Han and Sung-Hyun Myaeng"
+, title =       "Image Organization and Retrieval with Automatically Constructed Feature Vectors"
+, editor =      "Hans-Peter Frei and Donna Harman and Peter Sch{\"a}uble and Ross Wilkinson"
+, booktitle =   "Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
+, publisher =   "ACM Press"
+, address =     "New York"
+, month =       aug
+, year =        1996
+, pages =       "157--165"
+, update =      "98.07 agarwal"
 }
 
 @book{hk-mic-94
-, author =	"T. Han and K. Kobayashi"
-, title =	"Mathematical Information and Code"
-, publisher =	"Iwanami Publisher"
-, address =	"Japan"
-, year =	1994
-, note =	"In Japanese"
-, update =	"98.07 bibrelex"
+, author =      "T. Han and K. Kobayashi"
+, title =       "Mathematical Information and Code"
+, publisher =   "Iwanami Publisher"
+, address =     "Japan"
+, year =        1994
+, note =        "In Japanese"
+, update =      "98.07 bibrelex"
 }
 
 @article{h-sprd-66
-, author =	"M. Hanan"
-, title =	"On {Steiner's} problem with rectilinear distance"
-, journal =	"SIAM J. Appl. Math."
-, volume =	14
-, year =	1966
-, pages =	"255--265"
-, update =	"97.11 bibrelex"
+, author =      "M. Hanan"
+, title =       "On {Steiner's} problem with rectilinear distance"
+, journal =     "SIAM J. Appl. Math."
+, volume =      14
+, year =        1966
+, pages =       "255--265"
+, update =      "97.11 bibrelex"
 }
 
 @book{h-ei-17
-, author =	"H. Hancock"
-, title =	"Elliptic Integrals"
-, publisher =	"Dover Publications"
-, address =	"New York, NY"
-, year =	1917
-, update =	"98.03 bibrelex"
+, author =      "H. Hancock"
+, title =       "Elliptic Integrals"
+, publisher =   "Dover Publications"
+, address =     "New York, NY"
+, year =        1917
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{h-ldtud-93
-, author =	"Thomas R. Hancock"
-, title =	"Learning Decision Trees on the Uniform Distribution"
-, booktitle =	"Proc. 6th ACM Conf. Comput. Learning Theory"
-, nickname =	"COLT '93"
-, month =	jul
-, year =	1993
-, pages =	"??"
-, update =	"98.07 bibrelex, 93.09 milone+mitchell"
+, author =      "Thomas R. Hancock"
+, title =       "Learning Decision Trees on the Uniform Distribution"
+, booktitle =   "Proc. 6th ACM Conf. Comput. Learning Theory"
+, nickname =    "COLT '93"
+, month =       jul
+, year =        1993
+, pages =       "??"
+, update =      "98.07 bibrelex, 93.09 milone+mitchell"
 }
 
 @book{hm-lnta-79
-, author =	"G. Y. Handler and P. B. Mirchandani"
-, title =	"Location of networks: {Theory} and algorithms"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1979
-, update =	"98.03 bibrelex"
+, author =      "G. Y. Handler and P. B. Mirchandani"
+, title =       "Location of networks: {Theory} and algorithms"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1979
+, update =      "98.03 bibrelex"
 }
 
 @article{h-epcha-85
-, author =	"C. C. Handley"
-, title =	"Efficient planar convex hull algorithm"
-, journal =	"Image Vision Comput."
-, volume =	3
-, year =	1985
-, pages =	"29--35"
+, author =      "C. C. Handley"
+, title =       "Efficient planar convex hull algorithm"
+, journal =     "Image Vision Comput."
+, volume =      3
+, year =        1985
+, pages =       "29--35"
 }
 
 @inproceedings{hos-efdt-96
-, author =	"Sabine Hanke and Thomas Ottmann and Sven Schuierer"
-, title =	"The Edge-Flipping Distance of Triangulations"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"15--18"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Sabine Hanke and Thomas Ottmann and Sven Schuierer"
+, title =       "The Edge-Flipping Distance of Triangulations"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "15--18"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @techreport{h-hgc-84
-, author =	"P. Hanrahan"
-, title =	"A homogeneous geometry calculator"
-, type =	"Technical {Memo}"
-, number =	"3{D}-7"
-, institution =	"Comput. Graph. Lab., New York Inst. Tech."
-, address =	"New York, NY"
-, year =	1984
+, author =      "P. Hanrahan"
+, title =       "A homogeneous geometry calculator"
+, type =        "Technical {Memo}"
+, number =      "3{D}-7"
+, institution = "Comput. Graph. Lab., New York Inst. Tech."
+, address =     "New York, NY"
+, year =        1984
 }
 
 @incollection{h-srsia-89
-, author =	"P. Hanrahan"
-, title =	"A survey of ray-surface intersection algorithms"
-, editor =	"A. Glassner"
-, booktitle =	"An introduction to ray tracing"
-, publisher =	"Academic Press"
-, year =	1989
-, update =	"98.11 bibrelex"
+, author =      "P. Hanrahan"
+, title =       "A survey of ray-surface intersection algorithms"
+, editor =      "A. Glassner"
+, booktitle =   "An introduction to ray tracing"
+, publisher =   "Academic Press"
+, year =        1989
+, update =      "98.11 bibrelex"
 }
 
 @article{h-cvmev-82
-, author =	"P. Hanrahan"
-, title =	"Creating volume models from edge-vertex graphs"
-, journal =	"Comput. Graph."
-, volume =	16
-, number =	3
-, year =	1982
-, pages =	"77--84"
-, note =	"Proc. SIGGRAPH '82"
-, update =	"98.07 bibrelex"
+, author =      "P. Hanrahan"
+, title =       "Creating volume models from edge-vertex graphs"
+, journal =     "Comput. Graph."
+, volume =      16
+, number =      3
+, year =        1982
+, pages =       "77--84"
+, note =        "Proc. SIGGRAPH '82"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{h-tsm-85
-, author =	"P. Hanrahan"
-, title =	"Topological Shape Models"
-, school =	"University of Wisconsin"
-, address =	"Madison, WI"
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "P. Hanrahan"
+, title =       "Topological Shape Models"
+, school =      "University of Wisconsin"
+, address =     "Madison, WI"
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @article{hsa-rhra-91
-, author =	"P. Hanrahan and D. Salzman and L. Aupperle"
-, title =	"A rapid hierarchical radiosity algorithm"
-, journal =	"Comput. Graph."
-, volume =	25
-, number =	4
-, year =	1991
-, pages =	"197--206"
-, note =	"Proc. SIGGRAPH '91"
-, update =	"98.03 bibrelex"
+, author =      "P. Hanrahan and D. Salzman and L. Aupperle"
+, title =       "A rapid hierarchical radiosity algorithm"
+, journal =     "Comput. Graph."
+, volume =      25
+, number =      4
+, year =        1991
+, pages =       "197--206"
+, note =        "Proc. SIGGRAPH '91"
+, update =      "98.03 bibrelex"
 }
 
 @article{ha-agntp-92
-, author =	"A. Hansen and F. Arbab"
-, title =	"An Algorithm for Generating {NC} Tool Paths for Arbitrarily Shaped Pockets with Islands"
-, journal =	"ACM Trans. Graph."
-, volume =	11
-, number =	2
-, month =	apr
-, year =	1992
-, pages =	"152--182"
-, update =	"93.09 held"
+, author =      "A. Hansen and F. Arbab"
+, title =       "An Algorithm for Generating {NC} Tool Paths for Arbitrarily Shaped Pockets with Islands"
+, journal =     "ACM Trans. Graph."
+, volume =      11
+, number =      2
+, month =       apr
+, year =        1992
+, pages =       "152--182"
+, update =      "93.09 held"
 }
 
 @phdthesis{h-tppga-89
-, author =	"A. B. Hansen"
-, title =	"Tool Positioning and Path Generation Algorithms for Computer-Aided Manufacturing"
-, school =	"CS Dept., U. of Southern California, Los Angeles, CA 90089, USA"
-, year =	1989
-, keywords =	"doctoral thesis"
-, update =	"93.09 held"
+, author =      "A. B. Hansen"
+, title =       "Tool Positioning and Path Generation Algorithms for Computer-Aided Manufacturing"
+, school =      "CS Dept., U. of Southern California, Los Angeles, CA 90089, USA"
+, year =        1989
+, keywords =    "doctoral thesis"
+, update =      "93.09 held"
 }
 
 @techreport{ha-agntp-89
-, author =	"A. B. Hansen and F. Arbab"
-, title =	"An Algorithm for Generating {NC} Tool Paths for Arbitrarily Shaped Pockets with Islands"
-, number =	"CS 88-51"
-, institution =	"CS Dept., U. of Southern California, Los Angeles, CA 90089, USA"
-, year =	1989
-, update =	"93.09 held"
+, author =      "A. B. Hansen and F. Arbab"
+, title =       "An Algorithm for Generating {NC} Tool Paths for Arbitrarily Shaped Pockets with Islands"
+, number =      "CS 88-51"
+, institution = "CS Dept., U. of Southern California, Los Angeles, CA 90089, USA"
+, year =        1989
+, update =      "93.09 held"
 }
 
 @article{hl-cdmg-92
-, author =	"A. J. Hansen and P. L. Levin"
-, title =	"On Conforming {Delaunay} Mesh Generation"
-, journal =	"Adv. Eng. Softw."
-, volume =	14
-, number =	2
-, year =	1992
-, pages =	"129--135"
-, update =	"94.09 lambert, 93.09 held"
+, author =      "A. J. Hansen and P. L. Levin"
+, title =       "On Conforming {Delaunay} Mesh Generation"
+, journal =     "Adv. Eng. Softw."
+, volume =      14
+, number =      2
+, year =        1992
+, pages =       "129--135"
+, update =      "94.09 lambert, 93.09 held"
 }
 
 @inproceedings{h-aagep-89
-, author =	"M. D. Hansen"
-, title =	"Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"604--609"
+, author =      "M. D. Hansen"
+, title =       "Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "604--609"
 }
 
 @incollection{h-bpp-80
-, author =	"P. Hansen"
-, title =	"Bicriteria Path Problems"
-, booktitle =	"Multiple Criteria Decision Making: Theory and Applications"
-, series =	"Lecture Notes in Economics and Mathematical Systems"
-, volume =	177
-, publisher =	"Springer"
-, address =	"Heidelberg"
-, year =	1980
-, pages =	"109--127"
-, update =	"98.07 bibrelex"
+, author =      "P. Hansen"
+, title =       "Bicriteria Path Problems"
+, booktitle =   "Multiple Criteria Decision Making: Theory and Applications"
+, series =      "Lecture Notes in Economics and Mathematical Systems"
+, volume =      177
+, publisher =   "Springer"
+, address =     "Heidelberg"
+, year =        1980
+, pages =       "109--127"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{hj-mssc-88
-, author =	"P. Hansen and B. Jaumard"
-, title =	"Maximum sum of splits clustering"
-, type =	"Technical {Report}"
-, institution =	"RUTCOR, Ruters University"
-, address =	"New Brunswick, New Jersey"
-, month =	mar
-, year =	1988
-, update =	"93.09 milone+mitchell"
+, author =      "P. Hansen and B. Jaumard"
+, title =       "Maximum sum of splits clustering"
+, type =        "Technical {Report}"
+, institution = "RUTCOR, Ruters University"
+, address =     "New Brunswick, New Jersey"
+, month =       mar
+, year =        1988
+, update =      "93.09 milone+mitchell"
 }
 
 @article{hpt-sltcw-81
-, author =	"P. Hansen and D. Peeters and J. F. Thisse"
-, title =	"Some Localization Theorems for a Constrained {Weber} Problem"
-, journal =	"Journal of Regional Science"
-, volume =	21
-, year =	1981
-, pages =	"103--115"
-, update =	"93.09 milone+mitchell"
+, author =      "P. Hansen and D. Peeters and J. F. Thisse"
+, title =       "Some Localization Theorems for a Constrained {Weber} Problem"
+, journal =     "Journal of Regional Science"
+, volume =      21
+, year =        1981
+, pages =       "103--115"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{h-ncmmt-90
-, author =	"Dianne Hansford"
-, title =	"The Neutral Case for the Min-Max Triangulation"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	7
-, year =	1990
-, pages =	"431--438"
-, annote =	"Constructs contour for the minimize maximum angle
-		 criterion."
+, author =      "Dianne Hansford"
+, title =       "The Neutral Case for the Min-Max Triangulation"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      7
+, year =        1990
+, pages =       "431--438"
+, annote =      "Constructs contour for the minimize maximum angle
+                 criterion."
 }
 
 @incollection{h-gndg-94
-, author =	"Andrew J. Hanson"
-, title =	"Geometry for {N}-Dimensional Graphics"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"149--170"
-, keywords =	"geometry, hyperplane, determinant, Levi-Civita, volume"
-, update =	"94.09 heckbert"
-, annote =	"A tutorial on n-dimensional geometry. Hanson generalizes a
+, author =      "Andrew J. Hanson"
+, title =       "Geometry for {N}-Dimensional Graphics"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "149--170"
+, keywords =    "geometry, hyperplane, determinant, Levi-Civita, volume"
+, update =      "94.09 heckbert"
+, annote =      "A tutorial on n-dimensional geometry. Hanson generalizes a
 number of familiar concepts, such as plane equations, clipping, volume, and
 rotation, to n-D."
 }
 
 @inproceedings{h-islds-91
-, author =	"E. N. Hanson"
-, title =	"The interval skip list: a data structure for finding all intervals that overlap a point"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"153--164"
-, keywords =	"data structuring"
+, author =      "E. N. Hanson"
+, title =       "The interval skip list: a data structure for finding all intervals that overlap a point"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "153--164"
+, keywords =    "data structuring"
 }
 
 @article{h-osadc-98
-, author =	"Sariel Har-Peled"
-, title =	"An output sensitive algorithm for discrete convex hulls"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"125--138"
-, update =	"98.11 devillers"
+, author =      "Sariel Har-Peled"
+, title =       "An output sensitive algorithm for discrete convex hulls"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "125--138"
+, update =      "98.11 devillers"
 }
 
 @article{h-aspgd-??a
-, author =	"S. Har-Peled"
-, title =	"Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	"??"
-, number =	"??"
-, year =	"??"
-, pages =	"to appear"
-, succeeds =	"h-aspgd-97i"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "S. Har-Peled"
+, title =       "Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      "??"
+, number =      "??"
+, year =        "??"
+, pages =       "to appear"
+, succeeds =    "h-aspgd-97i"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{h-aspgd-97i
-, author =	"S. Har-Peled"
-, title =	"Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"359--365"
-, precedes =	"h-aspgd-??a"
-, cites =	"aaos-supa-97, ahsv-aspcp-96, ch-spp-96, c-aaspm-87, cr-nlbtr-87, csy-aesp3-94, dk-ladsc-85, dk-dsppu-90, h-caspm-97, hs-pmasp-95, mmp-dgp-87, p-aspmt-85, p-egcs-73, rs-seubf-94, s-spacp-87, ss-spps-86, va-aspp-96, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.06 efrat"
+, author =      "S. Har-Peled"
+, title =       "Approximate Shortest Paths and Geodesic Diameters on Convex Polytopes in Three Dimensions"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "359--365"
+, precedes =    "h-aspgd-??a"
+, cites =       "aaos-supa-97, ahsv-aspcp-96, ch-spp-96, c-aaspm-87, cr-nlbtr-87, csy-aesp3-94, dk-ladsc-85, dk-dsppu-90, h-caspm-97, hs-pmasp-95, mmp-dgp-87, p-aspmt-85, p-egcs-73, rs-seubf-94, s-spacp-87, ss-spps-86, va-aspp-96, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.06 efrat"
 }
 
 @inproceedings{h-caspm-98
-, author =	"Sariel Har-Peled"
-, title =	"Constructing approximate shortest path maps in three dimensions"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"383--391"
-, keywords =	"shortest paths, approximation algorithms, polyhedral obstacles"
-, update =	"99.11 smid, 98.03 mitchell"
+, author =      "Sariel Har-Peled"
+, title =       "Constructing approximate shortest path maps in three dimensions"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "383--391"
+, keywords =    "shortest paths, approximation algorithms, polyhedral obstacles"
+, update =      "99.11 smid, 98.03 mitchell"
 }
 
 @article{h-caspm-99
-, author =	"S. Har-Peled"
-, title =	"Constructing approximate shortest path maps in three dimensions"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1999
-, pages =	"1182--1197"
-, succeeds =	"h-caspm-98"
-, update =	"99.11 smid"
+, author =      "S. Har-Peled"
+, title =       "Constructing approximate shortest path maps in three dimensions"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1999
+, pages =       "1182--1197"
+, succeeds =    "h-caspm-98"
+, update =      "99.11 smid"
 }
 
 @techreport{h-caspm-97
-, author =	"S. Har-Peled"
-, title =	"Constructing approximate shortest paths maps in three dimensions"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1997
-, update =	"98.07 bibrelex"
+, author =      "S. Har-Peled"
+, title =       "Constructing approximate shortest paths maps in three dimensions"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1997
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{h-cctp-98
-, author =	"S. Har-Peled"
-, title =	"Constructing cuttings in theory and practice"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"327--334"
-, keywords =	"cuttings"
-, update =	"98.11 pocchiola, 98.03 agarwal"
+, author =      "S. Har-Peled"
+, title =       "Constructing cuttings in theory and practice"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "327--334"
+, keywords =    "cuttings"
+, update =      "98.11 pocchiola, 98.03 agarwal"
 }
 
 @article{h-cpctp-00
-, author =	"S. Har-Peled"
-, title =	"Constructing planar cuttings in theory and practice"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, year =	2000
-, pages =	"2016--2039"
-, update =	"01.04 smid"
+, author =      "S. Har-Peled"
+, title =       "Constructing planar cuttings in theory and practice"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, year =        2000
+, pages =       "2016--2039"
+, update =      "01.04 smid"
 }
 
 @inproceedings{h-twpa-99
-, author =	"S. Har-Peled"
-, title =	"Taking a walk in a planar arrangement"
-, booktitle =	"Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS 99"
-, year =	1999
-, pages =	"100--110"
-, update =	"01.11 pocchiola"
+, author =      "S. Har-Peled"
+, title =       "Taking a walk in a planar arrangement"
+, booktitle =   "Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS 99"
+, year =        1999
+, pages =       "100--110"
+, update =      "01.11 pocchiola"
 }
 
 @article{h-twpa-00
-, author =	"S. Har-Peled"
-, title =	"Taking a walk in a planar arrangement"
-, journal =	"SIAM J. Comput."
-, volume =	30
-, year =	2000
-, pages =	"1341--1367"
-, update =	"02.03 pocchiola"
+, author =      "S. Har-Peled"
+, title =       "Taking a walk in a planar arrangement"
+, journal =     "SIAM J. Comput."
+, volume =      30
+, year =        2000
+, pages =       "1341--1367"
+, update =      "02.03 pocchiola"
 }
 
 @mastersthesis{h-cmco-95
-, author =	"S. Har-Peled"
-, title =	"The Complexity of Many Cells in the Overlay of Many Arrangements"
-, type =	"{M.S.} Thesis"
-, school =	"Dept. Computer Science, Tel Aviv University"
-, address =	"Tel Aviv, Israel"
-, year =	1995
-, keywords =	"master thesis"
-, update =	"95.09 agarwal"
+, author =      "S. Har-Peled"
+, title =       "The Complexity of Many Cells in the Overlay of Many Arrangements"
+, type =        "{M.S.} Thesis"
+, school =      "Dept. Computer Science, Tel Aviv University"
+, address =     "Tel Aviv, Israel"
+, year =        1995
+, keywords =    "master thesis"
+, update =      "95.09 agarwal"
 }
 
 @inproceedings{hcahs-csfms-95
-, author =	"Sariel Har-Peled and Timothy M. Chan and Boris Aronov and Dan Halperin and Jack Snoeyink"
-, title =	"The Complexity of a Single Face of a {Minkowski} Sum"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"91--96"
-, update =	"95.09 agarwal+jones"
+, author =      "Sariel Har-Peled and Timothy M. Chan and Boris Aronov and Dan Halperin and Jack Snoeyink"
+, title =       "The Complexity of a Single Face of a {Minkowski} Sum"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "91--96"
+, update =      "95.09 agarwal+jones"
 }
 
 @inproceedings{hi-wccam-00
-, author =	"S. Har-Peled and P. Indyk"
-, title =	"When crossings count: Approximating the minimum spanning tree"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, note =	"166--175"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "S. Har-Peled and P. Indyk"
+, title =       "When crossings count: Approximating the minimum spanning tree"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, note =        "166--175"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @article{hs-oplpa-01
-, author =	"S. Har-Peled and M. Sharir"
-, title =	"Online Point Location in Planar Arrangements and Its Applications"
-, journal =	"Discrete Comput. Geom."
-, volume =	26
-, year =	2001
-, pages =	"19--40"
-, update =	"02.03 pocchiola"
+, author =      "S. Har-Peled and M. Sharir"
+, title =       "Online Point Location in Planar Arrangements and Its Applications"
+, journal =     "Discrete Comput. Geom."
+, volume =      26
+, year =        2001
+, pages =       "19--40"
+, update =      "02.03 pocchiola"
 }
 
 @inproceedings{hsv-aspcp-96
-, author =	"Sariel Har-Peled and Micha Sharir and Kasturi R. Varadarajan"
-, title =	"Approximate Shortest Paths on a Convex Polytope in Three Dimensions"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"329--338"
-, cites =	"a-lbvsc-63, b-acspp-85, bs-spbtc-88, bv-nclp-92, cr-nlbtr-87, ch-spp-90, c-aaspm-87, dk-ladsc-85, e-acg-87, hs-pmasp-95, mmp-dgp-87, p-aspmt-85, p-egcs-73, ps-cgi-85, rs-seubf-94, s-spacp-87, ss-spps-86, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Sariel Har-Peled and Micha Sharir and Kasturi R. Varadarajan"
+, title =       "Approximate Shortest Paths on a Convex Polytope in Three Dimensions"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "329--338"
+, cites =       "a-lbvsc-63, b-acspp-85, bs-spbtc-88, bv-nclp-92, cr-nlbtr-87, ch-spp-90, c-aaspm-87, dk-ladsc-85, e-acg-87, hs-pmasp-95, mmp-dgp-87, p-aspmt-85, p-egcs-73, ps-cgi-85, rs-seubf-94, s-spacp-87, ss-spps-86, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @techreport{hkrw-ihdrt-81
-, author =	"Y. Hara and A. Keller and P. Rathmann and G. Wiederhold"
-, title =	"Implementing Hypertext Database Relationships through Aggregations and Exceptions"
-, type =	"Technical Report"
-, number =	"STAN-CS-91-1381"
-, institution =	"Stanford University"
-, year =	1981
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "Y. Hara and A. Keller and P. Rathmann and G. Wiederhold"
+, title =       "Implementing Hypertext Database Relationships through Aggregations and Exceptions"
+, type =        "Technical Report"
+, number =      "STAN-CS-91-1381"
+, institution = "Stanford University"
+, year =        1981
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @inproceedings{hs-dpsc-77
-, author =	"R. M. Haralick and L. G. Shapiro"
-, title =	"Decomposition of polygonal shapes by clustering"
-, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn. Image Process."
-, year =	1977
-, pages =	"183--190"
+, author =      "R. M. Haralick and L. G. Shapiro"
+, title =       "Decomposition of polygonal shapes by clustering"
+, booktitle =   "Proc. IEEE Internat. Conf. Pattern Recogn. Image Process."
+, year =        1977
+, pages =       "183--190"
 }
 
 @book{h-gt-69
-, author =	"F. Harary"
-, title =	"Graph Theory"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, Mass."
-, year =	1969
-, keywords =	"graph drawing"
-, precedes =	"h-gt-72"
-, update =	"97.11 bibrelex, 93.09 tamassia"
+, author =      "F. Harary"
+, title =       "Graph Theory"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, Mass."
+, year =        1969
+, keywords =    "graph drawing"
+, precedes =    "h-gt-72"
+, update =      "97.11 bibrelex, 93.09 tamassia"
 }
 
 @book{h-gt-72
-, author =	"F. Harary"
-, title =	"Graph Theory"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1972
-, succeeds =	"h-gt-69"
-, update =	"97.11 bibrelex"
+, author =      "F. Harary"
+, title =       "Graph Theory"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1972
+, succeeds =    "h-gt-69"
+, update =      "97.11 bibrelex"
 }
 
 @article{ht-ogpm-66
-, author =	"F. Haray and W. T. Tutte"
-, title =	"On the Order of the Group of a Planar Map"
-, journal =	"J. Combin.Theory"
-, volume =	1
-, year =	1966
-, pages =	"394--395"
-, update =	"97.11 bibrelex"
+, author =      "F. Haray and W. T. Tutte"
+, title =       "On the Order of the Group of a Planar Map"
+, journal =     "J. Combin.Theory"
+, volume =      1
+, year =        1966
+, pages =       "394--395"
+, update =      "97.11 bibrelex"
 }
 
 @article{h-kfiep-78
-, author =	"H. Harborth"
-, title =	"Konvexe {F{\"u}nfecke} in ebenen {Punktmengen}"
-, journal =	"Elem. Math."
-, volume =	33
-, year =	1979
-, pages =	"116--118"
-, cites =	"ar-clecs-85"
-, update =	"97.11 bibrelex"
+, author =      "H. Harborth"
+, title =       "Konvexe {F{\"u}nfecke} in ebenen {Punktmengen}"
+, journal =     "Elem. Math."
+, volume =      33
+, year =        1979
+, pages =       "116--118"
+, cites =       "ar-clecs-85"
+, update =      "97.11 bibrelex"
 }
 
 @article{h-sp664-74
-, author =	"H. Harborth"
-, title =	"Solution to problem 664{A}"
-, journal =	"Elemente der Mathematik"
-, volume =	29
-, year =	1974
-, pages =	"14--15"
-, keywords =	"combinatorial geometry, proximity"
+, author =      "H. Harborth"
+, title =       "Solution to problem 664{A}"
+, journal =     "Elemente der Mathematik"
+, volume =      29
+, year =        1974
+, pages =       "14--15"
+, keywords =    "combinatorial geometry, proximity"
 }
 
 @article{hm-ewcdc-74
-, author =	"H. Harborth and I. Mengersen"
-, title =	"Edges Without Crossings in Drawings of Complete Graphs"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	17
-, number =	3
-, year =	1974
-, pages =	"229--311"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "H. Harborth and I. Mengersen"
+, title =       "Edges Without Crossings in Drawings of Complete Graphs"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      17
+, number =      3
+, year =        1974
+, pages =       "229--311"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{hs-nacod-93
-, author =	"R. H. Hardin and N. J. A. Sloane"
-, title =	"A new approach to the construction of optimal designs"
-, journal =	"J. Statistical Planning and Inference"
-, volume =	37
-, year =	1993
-, pages =	"339--369"
-, note =	"Also DIMACS Technical Report 93-47, August 1993."
-, update =	"97.07 orourke"
+, author =      "R. H. Hardin and N. J. A. Sloane"
+, title =       "A new approach to the construction of optimal designs"
+, journal =     "J. Statistical Planning and Inference"
+, volume =      37
+, year =        1993
+, pages =       "339--369"
+, note =        "Also DIMACS Technical Report 93-47, August 1993."
+, update =      "97.07 orourke"
 }
 
 @book{hlp-i-52
-, author =	"G. Hardy and J. E. Littlewood and G. P{\'o}lya"
-, title =	"Inequalities"
-, edition =	"2nd"
-, publisher =	"Cambridge University Press"
-, year =	1952
-, precedes =	"hlp-i-64"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "G. Hardy and J. E. Littlewood and G. P{\'o}lya"
+, title =       "Inequalities"
+, edition =     "2nd"
+, publisher =   "Cambridge University Press"
+, year =        1952
+, precedes =    "hlp-i-64"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @book{hlp-i-64
-, author =	"G. Hardy and J. E. Littlewood and G. P{\'o}lya"
-, title =	"Inequalities"
-, edition =	"1st"
-, publisher =	"Cambridge University Press"
-, year =	1967
-, succeeds =	"hlp-i-52"
-, update =	"98.11 bibrelex"
+, author =      "G. Hardy and J. E. Littlewood and G. P{\'o}lya"
+, title =       "Inequalities"
+, edition =     "1st"
+, publisher =   "Cambridge University Press"
+, year =        1967
+, succeeds =    "hlp-i-52"
+, update =      "98.11 bibrelex"
 }
 
 @book{hw-tn-65
-, author =	"G. Hardy and E. Wright"
-, title =	"The Theory of Numbers"
-, edition =	"4th"
-, publisher =	"Oxford University Press"
-, address =	"London, England"
-, year =	1965
+, author =      "G. Hardy and E. Wright"
+, title =       "The Theory of Numbers"
+, edition =     "4th"
+, publisher =   "Oxford University Press"
+, address =     "London, England"
+, year =        1965
 }
 
 @book{hw-itn-68
-, author =	"G. H. Hardy and E. M. Wright"
-, title =	"An Introduction to the Theory of Numbers"
-, publisher =	"Oxford University Press"
-, address =	"New York"
-, year =	1968
-, precedes =	"hw-itn-79"
-, update =	"98.07 bibrelex"
+, author =      "G. H. Hardy and E. M. Wright"
+, title =       "An Introduction to the Theory of Numbers"
+, publisher =   "Oxford University Press"
+, address =     "New York"
+, year =        1968
+, precedes =    "hw-itn-79"
+, update =      "98.07 bibrelex"
 }
 
 @book{hw-itn-79
-, author =	"G. H. Hardy and E. M. Wright"
-, title =	"An Introduction to the Theory of Numbers"
-, publisher =	"Oxford Science Publications"
-, year =	1979
-, succeeds =	"hw-itn-68"
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "G. H. Hardy and E. M. Wright"
+, title =       "An Introduction to the Theory of Numbers"
+, publisher =   "Oxford Science Publications"
+, year =        1979
+, succeeds =    "hw-itn-68"
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @article{hk-crp-71
-, author =	"W. R. Hare and J. W. Kenelly"
-, title =	"Characterizations of Radon partitions"
-, journal =	"Pacific J. Math."
-, volume =	36
-, year =	1971
-, pages =	"159--164"
-, update =	"98.03 bibrelex"
+, author =      "W. R. Hare and J. W. Kenelly"
+, title =       "Characterizations of Radon partitions"
+, journal =     "Pacific J. Math."
+, volume =      36
+, year =        1971
+, pages =       "159--164"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{h-ltalc-80
-, author =	"D. Harel"
-, title =	"A linear time algorithm for the lowest common ancestors problem"
-, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1980
-, pages =	"308--319"
-, precedes =	"ht-fafnc-84"
+, author =      "D. Harel"
+, title =       "A linear time algorithm for the lowest common ancestors problem"
+, booktitle =   "Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1980
+, pages =       "308--319"
+, precedes =    "ht-fafnc-84"
 }
 
 @article{h-etiah-86
-, author =	"D. Harel"
-, title =	"Effective transformations on infinite, with applications to high undecidability, dominoes and fairness"
-, journal =	"J. ACM"
-, volume =	33
-, year =	1986
-, pages =	"224--248"
-, update =	"97.11 bibrelex"
+, author =      "D. Harel"
+, title =       "Effective transformations on infinite, with applications to high undecidability, dominoes and fairness"
+, journal =     "J. ACM"
+, volume =      33
+, year =        1986
+, pages =       "224--248"
+, update =      "97.11 bibrelex"
 }
 
 @article{h-vf-88
-, author =	"D. Harel"
-, title =	"On Visual Formalisms"
-, journal =	"Commun. ACM"
-, volume =	31
-, number =	5
-, year =	1988
-, pages =	"514--530"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. Harel"
+, title =       "On Visual Formalisms"
+, journal =     "Commun. ACM"
+, volume =      31
+, number =      5
+, year =        1988
+, pages =       "514--530"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{hs-rgdhd-95
-, author =	"D. Harel and M. Sardas"
-, title =	"Randomized Graph Drawing with Heavy-Duty Preprocessing"
-, journal =	"J. Visual Lang. Comput."
-, volume =	6
-, number =	3
-, year =	1995
-, pages =	"233--253"
-, note =	"(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
-, keywords =	"graph drawing, physical simulation, planarization"
-, update =	"98.07 vismara, 95.09 agarwal+devillers, 95.05 tamassia"
+, author =      "D. Harel and M. Sardas"
+, title =       "Randomized Graph Drawing with Heavy-Duty Preprocessing"
+, journal =     "J. Visual Lang. Comput."
+, volume =      6
+, number =      3
+, year =        1995
+, pages =       "233--253"
+, note =        "(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
+, keywords =    "graph drawing, physical simulation, planarization"
+, update =      "98.07 vismara, 95.09 agarwal+devillers, 95.05 tamassia"
 }
 
 @article{ht-fafnc-84
-, author =	"D. Harel and R. E. Tarjan"
-, title =	"Fast algorithms for finding nearest common ancestors"
-, journal =	"SIAM J. Comput."
-, volume =	13
-, number =	2
-, year =	1984
-, pages =	"338--355"
-, succeeds =	"h-ltalc-80"
-, update =	"98.11 bibrelex"
+, author =      "D. Harel and R. E. Tarjan"
+, title =       "Fast algorithms for finding nearest common ancestors"
+, journal =     "SIAM J. Comput."
+, volume =      13
+, number =      2
+, year =        1984
+, pages =       "338--355"
+, succeeds =    "h-ltalc-80"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{hru-idce-96
-, author =	"V. Harinarayan and A. Rajaraman and J. D. Ullman"
-, title =	"Implementing data cubes efficiently"
-, booktitle =	"Proc. 13th IEEE Internat. Conf. Data Eng."
-, year =	1997
-, pages =	"208--219"
-, update =	"97.07 agarwal"
+, author =      "V. Harinarayan and A. Rajaraman and J. D. Ullman"
+, title =       "Implementing data cubes efficiently"
+, booktitle =   "Proc. 13th IEEE Internat. Conf. Data Eng."
+, year =        1997
+, pages =       "208--219"
+, update =      "97.07 agarwal"
 }
 
 @article{hpss-sxoc-75
-, author =	"L. H. Harper and T. H. Payne and J. E. Savage and E. Strauss"
-, title =	"Sorting $X+Y$ in $O(n^2)$ comparisons"
-, journal =	"Commun. ACM"
-, volume =	18
-, number =	6
-, year =	1975
-, pages =	"347--349"
-, update =	"98.11 bibrelex, 97.03 devillers"
+, author =      "L. H. Harper and T. H. Payne and J. E. Savage and E. Strauss"
+, title =       "Sorting $X+Y$ in $O(n^2)$ comparisons"
+, journal =     "Commun. ACM"
+, volume =      18
+, number =      6
+, year =        1975
+, pages =       "347--349"
+, update =      "98.11 bibrelex, 97.03 devillers"
 }
 
 @techreport{h-fafch-78
-, author =	"B. Harris"
-, title =	"A fast algorithm for finding the convex hull of a set of points in the plane"
-, type =	"Internal {Report}"
-, number =	""
-, institution =	"School Public Urban Policy, Univ. Pennsylvania"
-, address =	"Philadelphia, PA"
-, year =	1978
-, update =	"94.05 devillers"
+, author =      "B. Harris"
+, title =       "A fast algorithm for finding the convex hull of a set of points in the plane"
+, type =        "Internal {Report}"
+, number =      ""
+, institution = "School Public Urban Policy, Univ. Pennsylvania"
+, address =     "Philadelphia, PA"
+, year =        1978
+, update =      "94.05 devillers"
 }
 
 @book{h-agfc-92
-, author =	"J. Harris"
-, title =	"Algebraic Geometry (A First Course)"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1992
-, update =	"96.09 agarwal, 95.01 matousek"
+, author =      "J. Harris"
+, title =       "Algebraic Geometry (A First Course)"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1992
+, update =      "96.09 agarwal, 95.01 matousek"
 }
 
 @incollection{h-de-94
-, author =	"John C. Hart"
-, title =	"Distance to an Ellipsoid"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"113--119"
-, keywords =	"ray tracing, ellipse"
-, update =	"94.09 heckbert"
-, annote =	"Gives the formulas necessary to find the distance from a
+, author =      "John C. Hart"
+, title =       "Distance to an Ellipsoid"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "113--119"
+, keywords =    "ray tracing, ellipse"
+, update =      "94.09 heckbert"
+, annote =      "Gives the formulas necessary to find the distance from a
 point to an ellipsoid, or from a point to an ellipse. These formulas can be
 useful for geometric modeling or for ray tracing."
 }
 
 @techreport{h-otdrq-81
-, author =	"J. M. Hart"
-, title =	"Optimal two dimensional range queries using binary range lists"
-, type =	"Report"
-, number =	"76-81"
-, institution =	"Dept. Comput. Sci., Univ. Kentucky"
-, address =	"Lexington, KY"
-, year =	1981
+, author =      "J. M. Hart"
+, title =       "Optimal two dimensional range queries using binary range lists"
+, type =        "Report"
+, number =      "76-81"
+, institution = "Dept. Comput. Sci., Univ. Kentucky"
+, address =     "Lexington, KY"
+, year =        1981
 }
 
 @article{h-pimcd-82
-, author =	"J. M. Hart"
-, title =	"Permutation inversions and multidimensional cumulative distribution functions"
-, journal =	"Inform. Process. Lett."
-, volume =	14
-, year =	1982
-, pages =	"218--222"
+, author =      "J. M. Hart"
+, title =       "Permutation inversions and multidimensional cumulative distribution functions"
+, journal =     "Inform. Process. Lett."
+, volume =      14
+, year =        1982
+, pages =       "218--222"
 }
 
 @article{h-cnnr-68
-, author =	"P. E. Hart"
-, title =	"The condensed nearest neighbor rule"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	"??"
-, year =	1968
-, pages =	"515--516"
-, update =	"97.11 bibrelex"
+, author =      "P. E. Hart"
+, title =       "The condensed nearest neighbor rule"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      "??"
+, year =        1968
+, pages =       "515--516"
+, update =      "97.11 bibrelex"
 }
 
 @article{hnr-fbhdm-68
-, author =	"P. E. Hart and N. J. Nilsson and B. Raphael"
-, title =	"A Formal Basis for the Heuristic Determination of Minimum Cost Paths"
-, journal =	"IEEE Trans. Syst. Sci. Cybern."
-, volume =	"SCC-4"
-, number =	2
-, year =	1968
-, pages =	"100--107"
-, update =	"96.09 devillers"
+, author =      "P. E. Hart and N. J. Nilsson and B. Raphael"
+, title =       "A Formal Basis for the Heuristic Determination of Minimum Cost Paths"
+, journal =     "IEEE Trans. Syst. Sci. Cybern."
+, volume =      "SCC-4"
+, number =      2
+, year =        1968
+, pages =       "100--107"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{hs-ndssg-84
-, author =	"S. Hart and Micha Sharir"
-, title =	"Nonlinearity of {Davenport}-{Schinzel} sequences and of generalized path compression schemes"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1984
-, pages =	"313--319"
-, precedes =	"hs-ndssg-86"
-, update =	"98.03 mitchell"
+, author =      "S. Hart and Micha Sharir"
+, title =       "Nonlinearity of {Davenport}-{Schinzel} sequences and of generalized path compression schemes"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1984
+, pages =       "313--319"
+, precedes =    "hs-ndssg-86"
+, update =      "98.03 mitchell"
 }
 
 @article{hs-ndssg-86
-, author =	"S. Hart and Micha Sharir"
-, title =	"Nonlinearity of {Davenport}-{Schinzel} sequences and of generalized path compression schemes"
-, journal =	"Combinatorica"
-, volume =	6
-, year =	1986
-, pages =	"151--177"
-, keywords =	"Davenport-Schinzel sequences"
-, succeeds =	"hs-ndssg-84"
-, update =	"98.03 mitchell"
+, author =      "S. Hart and Micha Sharir"
+, title =       "Nonlinearity of {Davenport}-{Schinzel} sequences and of generalized path compression schemes"
+, journal =     "Combinatorica"
+, volume =      6
+, year =        1986
+, pages =       "151--177"
+, keywords =    "Davenport-Schinzel sequences"
+, succeeds =    "hs-ndssg-84"
+, update =      "98.03 mitchell"
 }
 
 @book{h-tdicl-91
-, author =	"A. C. Harter"
-, title =	"Three-dimensional integrated circuit layout"
-, publisher =	"Cambridge University Press"
-, address =	"New York, NY"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "A. C. Harter"
+, title =       "Three-dimensional integrated circuit layout"
+, publisher =   "Cambridge University Press"
+, address =     "New York, NY"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @book{h-ca-75
-, author =	"J. A. Hartigan"
-, title =	"Clustering Algorithms"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1975
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "J. A. Hartigan"
+, title =       "Clustering Algorithms"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1975
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @book{h-ag-77
-, author =	"R. Hartshorne"
-, title =	"Algebraic Geometry"
-, series =	"Graduate texts in Mathematics"
-, volume =	52
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1977
-, update =	"98.03 icking, 97.11 bibrelex"
+, author =      "R. Hartshorne"
+, title =       "Algebraic Geometry"
+, series =      "Graduate texts in Mathematics"
+, volume =      52
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1977
+, update =      "98.03 icking, 97.11 bibrelex"
 }
 
 @article{h-rvdlp-92
-, author =	"D. Hartvigsen"
-, title =	"Recognizing {Voronoi} diagrams with linear programming"
-, journal =	"ORSA J. Comput."
-, volume =	4
-, number =	4
-, year =	1992
-, pages =	"369--374"
-, update =	"98.03 mitchell, 93.09 rote"
-, annote =	"Special issue on computational geometry; J. Mitchell and
+, author =      "D. Hartvigsen"
+, title =       "Recognizing {Voronoi} diagrams with linear programming"
+, journal =     "ORSA J. Comput."
+, volume =      4
+, number =      4
+, year =        1992
+, pages =       "369--374"
+, update =      "98.03 mitchell, 93.09 rote"
+, annote =      "Special issue on computational geometry; J. Mitchell and
                   J. Karel Lenstra, eds."
 }
 
 @inproceedings{hvm-vwsh-95
-, author =	"M. Hasan and D. Vista and A. Mendelzon"
-, title =	"Visual {Web} Surfing with {HY+}"
-, booktitle =	"Proc. CASCON'95"
-, year =	1995
-, url =	"http://www.db.toronto.edu:8020/"
-, keywords =	"graph drawing, system"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "M. Hasan and D. Vista and A. Mendelzon"
+, title =       "Visual {Web} Surfing with {HY+}"
+, booktitle =   "Proc. CASCON'95"
+, year =        1995
+, url = "http://www.db.toronto.edu:8020/"
+, keywords =    "graph drawing, system"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @inproceedings{hiikn-eavbk-93
-, author =	"Susumu Hasegawa and Hiroshi Imai and Mary Inaba and Naoki Katoh and Jun Nakano"
-, title =	"Efficient algorithms for variance-based $k$-clustering"
-, booktitle =	"Proc. First Pacific Conf. Computer Graphics Appl., Seoul, Korea, vol. 1"
-, volume =	1
-, publisher =	"World Scientific Publishing Co."
-, year =	1993
-, pages =	"75--89"
-, keywords =	"clustering, proximity, computer graphics, Voronoi diagram, $k$th order Voronoi diagram, $d$-dimensional"
-, update =	"95.09 korneenko"
+, author =      "Susumu Hasegawa and Hiroshi Imai and Mary Inaba and Naoki Katoh and Jun Nakano"
+, title =       "Efficient algorithms for variance-based $k$-clustering"
+, booktitle =   "Proc. First Pacific Conf. Computer Graphics Appl., Seoul, Korea, vol. 1"
+, volume =      1
+, publisher =   "World Scientific Publishing Co."
+, year =        1993
+, pages =       "75--89"
+, keywords =    "clustering, proximity, computer graphics, Voronoi diagram, $k$th order Voronoi diagram, $d$-dimensional"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{hii-eakls-93
-, author =	"S. Hasegawa and H. Imai and M. Ishiguro"
-, title =	"$\varepsilon$-approximations of $k$-label spaces"
-, booktitle =	"Proc. 4th Internat. Workshop in Algorithmic Learning Theory"
-, series =	"Lecture Notes in Artificial Intelligence"
-, volume =	744
-, year =	1993
-, pages =	"288--299"
-, update =	"98.03 bibrelex"
+, author =      "S. Hasegawa and H. Imai and M. Ishiguro"
+, title =       "$\varepsilon$-approximations of $k$-label spaces"
+, booktitle =   "Proc. 4th Internat. Workshop in Algorithmic Learning Theory"
+, series =      "Lecture Notes in Artificial Intelligence"
+, volume =      744
+, year =        1993
+, pages =       "288--299"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{hs-nlbmm-86
-, author =	"A. Hasham and J.-R. Sack"
-, title =	"A Note on Lower Bounds for Min-Max Heaps"
-, booktitle =	"Proc. 24th Allerton Conf. Commun. Control Comput."
-, year =	1986
-, pages =	"306--307"
-, update =	"97.11 sack"
+, author =      "A. Hasham and J.-R. Sack"
+, title =       "A Note on Lower Bounds for Min-Max Heaps"
+, booktitle =   "Proc. 24th Allerton Conf. Commun. Control Comput."
+, year =        1986
+, pages =       "306--307"
+, update =      "97.11 sack"
 }
 
 @inproceedings{hr-udfs-94
-, author =	"S. M. Hashemi and I. Rival"
-, title =	"Upward Drawings to Fit Surfaces"
-, booktitle =	"Proc. Workshop on Orders, Algorithms and Applications"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	831
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"53--58"
-, keywords =	"graph drawing, 3D, upward"
-, update =	"95.05 tamassia"
+, author =      "S. M. Hashemi and I. Rival"
+, title =       "Upward Drawings to Fit Surfaces"
+, booktitle =   "Proc. Workshop on Orders, Algorithms and Applications"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      831
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "53--58"
+, keywords =    "graph drawing, 3D, upward"
+, update =      "95.05 tamassia"
 }
 
 @inproceedings{hst-uttst-99
-, author =	"Joel Hass and Jack Snoeyink and William P. Thurston"
-, title =	"Using Train Tracks to Show that a Trivial Knot May Require Exponential-Size Spanning Disks"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"59--61"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Joel Hass and Jack Snoeyink and William P. Thurston"
+, title =       "Using Train Tracks to Show that a Trivial Knot May Require Exponential-Size Spanning Disks"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "59--61"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{hm-oafaj-85
-, author =	"R. Hassin and N. Megiddo"
-, title =	"An optimal algorithm for finding all the jumps of a monotone step-function"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	"265--274"
-, keywords =	"design of algorithms, binary search, worst-case analysis, prune-and-search, points, lines, two-dimensional"
+, author =      "R. Hassin and N. Megiddo"
+, title =       "An optimal algorithm for finding all the jumps of a monotone step-function"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "265--274"
+, keywords =    "design of algorithms, binary search, worst-case analysis, prune-and-search, points, lines, two-dimensional"
 }
 
 @techreport{hm-aahos-88
-, author =	"R. Hassin and N. Megiddo"
-, title =	"Approximation algorithms for hitting objects by straight lines"
-, type =	"Technical {Report}"
-, institution =	"Tel Aviv Univ."
-, address =	"Tel Aviv, Israel"
-, month =	may
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "R. Hassin and N. Megiddo"
+, title =       "Approximation algorithms for hitting objects by straight lines"
+, type =        "Technical {Report}"
+, institution = "Tel Aviv Univ."
+, address =     "Tel Aviv, Israel"
+, month =       may
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @article{hm-aahos-91
-, author =	"R. Hassin and N. Megiddo"
-, title =	"Approximation algorithms for hitting objects by straight lines"
-, journal =	"Discrete Appl. Math."
-, volume =	30
-, year =	1991
-, pages =	"29--42"
-, keywords =	"NP-Completeness, stabbing, approximation"
-, update =	"93.09 jones"
+, author =      "R. Hassin and N. Megiddo"
+, title =       "Approximation algorithms for hitting objects by straight lines"
+, journal =     "Discrete Appl. Math."
+, volume =      30
+, year =        1991
+, pages =       "29--42"
+, keywords =    "NP-Completeness, stabbing, approximation"
+, update =      "93.09 jones"
 }
 
 @techreport{hr-aamts-97
-, author =	"R. Hassin and S. Rubinstein"
-, title =	"An approximation algorithm for the maximum traveling salesman problem"
-, type =	"Manuscript, submitted"
-, institution =	"Tel Aviv University"
-, address =	"Tel Aviv, Israel"
-, year =	1997
-, update =	"98.03 mitchell"
-, annote =	"Finds and fixes result of S.R. Kosaraju, J.K. Park, C. Stein"
+, author =      "R. Hassin and S. Rubinstein"
+, title =       "An approximation algorithm for the maximum traveling salesman problem"
+, type =        "Manuscript, submitted"
+, institution = "Tel Aviv University"
+, address =     "Tel Aviv, Israel"
+, year =        1997
+, update =      "98.03 mitchell"
+, annote =      "Finds and fixes result of S.R. Kosaraju, J.K. Park, C. Stein"
 }
 
 @article{ht-dannc-96
-, author =	"T. Hastie and R. Tibshirani"
-, title =	"Discriminant adaptive nearest neighbor classification"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	18
-, year =	1996
-, pages =	"607--616"
-, update =	"97.07 agarwal"
+, author =      "T. Hastie and R. Tibshirani"
+, title =       "Discriminant adaptive nearest neighbor classification"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      18
+, year =        1996
+, pages =       "607--616"
+, update =      "97.07 agarwal"
 }
 
 @mastersthesis{h-senea-93
-, author =	"S. Haswgawa"
-, title =	"A study on $\varepsilon$-net and $\varepsilon$-approximation"
-, school =	"Dept. Inform. Sci., Univ. Tokyo"
-, address =	"Tokyo, Japan"
-, year =	1993
-, keywords =	"master thesis"
-, update =	"98.03 bibrelex"
+, author =      "S. Haswgawa"
+, title =       "A study on $\varepsilon$-net and $\varepsilon$-approximation"
+, school =      "Dept. Inform. Sci., Univ. Tokyo"
+, address =     "Tokyo, Japan"
+, year =        1993
+, keywords =    "master thesis"
+, update =      "98.03 bibrelex"
 }
 
 @book{h-at-01
-, author =	"Allan Hatcher"
-, title =	"Algebraic Topology"
-, publisher =	"Cambridge University Press"
-, year =	2001
-, url =	"https://www.math.cornell.edu/~hatcher/"
-, update =	"01.11 orourke"
+, author =      "Allan Hatcher"
+, title =       "Algebraic Topology"
+, publisher =   "Cambridge University Press"
+, year =        2001
+, url = "https://www.math.cornell.edu/~hatcher/"
+, update =      "01.11 orourke"
 }
 
 @book{h-m-35
-, author =	"F. Hausdorff"
-, title =	"Mengenlehre"
-, edition =	"3rd"
-, publisher =	"DeGruyter"
-, address =	"Berlin, Germany"
-, year =	1935
-, update =	"97.11 bibrelex"
+, author =      "F. Hausdorff"
+, title =       "Mengenlehre"
+, edition =     "3rd"
+, publisher =   "DeGruyter"
+, address =     "Berlin, Germany"
+, year =        1935
+, update =      "97.11 bibrelex"
 }
 
 @proceedings{ht-nggcf-86
-, title =	"Numerical Grid Generation in Computational Fluid Dynamics"
-, editor =	"J. Hauser and C. Taylor"
-, publisher =	"Pineridge Press"
-, address =	"Swansea, UK"
-, year =	1986
-, update =	"97.11 bibrelex"
+, title =       "Numerical Grid Generation in Computational Fluid Dynamics"
+, editor =      "J. Hauser and C. Taylor"
+, publisher =   "Pineridge Press"
+, address =     "Swansea, UK"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @incollection{hd-mgvia-00
-, author =	"Alejo Hausner and David P. Dobkin"
-, title =	"Making Geometry Visible: {An} Introduction to the Animation of Geometric Algorithms"
-, chapter =	8
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"389--423"
-, keywords =	"algorithm animation, visualization"
-, update =	"00.03 bibrelex+vismara, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell+tamassia, 97.03 tamassia"
-, annote =	"Chapter 8 of su-hcg-00"
+, author =      "Alejo Hausner and David P. Dobkin"
+, title =       "Making Geometry Visible: {An} Introduction to the Animation of Geometric Algorithms"
+, chapter =     8
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "389--423"
+, keywords =    "algorithm animation, visualization"
+, update =      "00.03 bibrelex+vismara, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell+tamassia, 97.03 tamassia"
+, annote =      "Chapter 8 of su-hcg-00"
 }
 
 @book{h-vsag-65
-, author =	"M. Hausner"
-, title =	"A Vector Space Approach to Geometry"
-, publisher =	"Prentice Hall"
-, year =	1965
-, update =	"97.11 bibrelex"
+, author =      "M. Hausner"
+, title =       "A Vector Space Approach to Geometry"
+, publisher =   "Prentice Hall"
+, year =        1965
+, update =      "97.11 bibrelex"
 }
 
 @techreport{h-spnsb-91
-, author =	"D. Haussler"
-, title =	"Sphere packing numbers for subsets of the {Boolean} $n$-cube with bounded {Vapnik}-{Chervonenkis} dimension"
-, type =	"Tech. Report"
-, number =	"UCSC-CRL-91-41"
-, institution =	"University of California at Santa Cruz"
-, year =	1991
-, keywords =	"Vapnik-Chervonenkis dimension, range spaces"
-, comments =	"related to spanning trees with small crossing number"
-, update =	"93.09 matousek"
+, author =      "D. Haussler"
+, title =       "Sphere packing numbers for subsets of the {Boolean} $n$-cube with bounded {Vapnik}-{Chervonenkis} dimension"
+, type =        "Tech. Report"
+, number =      "UCSC-CRL-91-41"
+, institution = "University of California at Santa Cruz"
+, year =        1991
+, keywords =    "Vapnik-Chervonenkis dimension, range spaces"
+, comments =    "related to spanning trees with small crossing number"
+, update =      "93.09 matousek"
 }
 
 @inproceedings{hw-ensrq-86
-, author =	"D. Haussler and Emo Welzl"
-, title =	"Epsilon-nets and simplex range queries"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"61--71"
-, precedes =	"hw-ensrq-87"
-, cites =	"cgl-pgd-83, cgl-pgd-83, c-papop-85, c-pps4d-85, de-opstt-84, dey-3spa-84, d-cltem-78, ew-hrsls-86, eh-dsptt-84, g-cp-67, vc-ucrfe-71, wd-ssvcc-81, w-pr-82, y-3spia-83, yy-gaddg-85, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "D. Haussler and Emo Welzl"
+, title =       "Epsilon-nets and simplex range queries"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "61--71"
+, precedes =    "hw-ensrq-87"
+, cites =       "cgl-pgd-83, cgl-pgd-83, c-papop-85, c-pps4d-85, de-opstt-84, dey-3spa-84, d-cltem-78, ew-hrsls-86, eh-dsptt-84, g-cp-67, vc-ucrfe-71, wd-ssvcc-81, w-pr-82, y-3spia-83, yy-gaddg-85, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{hw-ensrq-87
-, author =	"D. Haussler and Emo Welzl"
-, title =	"Epsilon-nets and simplex range queries"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"127--151"
-, keywords =	"combinatorial geometry, probabilistic geometry, probability theory, reporting, counting, half spaces, simplices, $d$-dimensional"
-, succeeds =	"hw-ensrq-86"
-, update =	"98.03 mitchell"
+, author =      "D. Haussler and Emo Welzl"
+, title =       "Epsilon-nets and simplex range queries"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "127--151"
+, keywords =    "combinatorial geometry, probabilistic geometry, probability theory, reporting, counting, half spaces, simplices, $d$-dimensional"
+, succeeds =    "hw-ensrq-86"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{h-ubcpc-89
-, author =	"W. Haverdings"
-, title =	"Use of the {BRL-CAD} package in the construction of a geometric model of the {General} {Dynamics} {F-16A} {Air} {Combat} {Fighter} for vulnerability assessments"
-, booktitle =	"Proc. BRL-CAD Symposium `89"
-, publisher =	"American Defense Preparadness Assoc."
-, address =	"Aberdeen Proving Ground, MD"
-, year =	1989
-, pages =	"170--193"
-, update =	"95.05 agarwal"
+, author =      "W. Haverdings"
+, title =       "Use of the {BRL-CAD} package in the construction of a geometric model of the {General} {Dynamics} {F-16A} {Air} {Combat} {Fighter} for vulnerability assessments"
+, booktitle =   "Proc. BRL-CAD Symposium `89"
+, publisher =   "American Defense Preparadness Assoc."
+, address =     "Aberdeen Proving Ground, MD"
+, year =        1989
+, pages =       "170--193"
+, update =      "95.05 agarwal"
 }
 
 @article{h-nccp-89
-, author =	"R. Hayward"
-, title =	"A note on the circle containment problem"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"263--264"
+, author =      "R. Hayward"
+, title =       "A note on the circle containment problem"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "263--264"
 }
 
 @article{hrw-sercc-89
-, author =	"R. Hayward and D. Rappaport and R. Wenger"
-, title =	"Some extremal results on circles containing points"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"253--258"
+, author =      "R. Hayward and D. Rappaport and R. Wenger"
+, title =       "Some extremal results on circles containing points"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "253--258"
 }
 
 @article{h-lbocf-87
-, author =	"R. B. Hayward"
-, title =	"A lower bound for the optimal crossing-free {Hamiltonian} cycle problem"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"327--343"
+, author =      "R. B. Hayward"
+, title =       "A lower bound for the optimal crossing-free {Hamiltonian} cycle problem"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "327--343"
 }
 
 @article{h-wtg-85
-, author =	"R. B. Hayward"
-, title =	"Weakly Triangulated Graphs"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	39
-, year =	1985
-, pages =	"200--209"
-, update =	"98.03 bibrelex"
+, author =      "R. B. Hayward"
+, title =       "Weakly Triangulated Graphs"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      39
+, year =        1985
+, pages =       "200--209"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{hhm-owtg-87
-, author =	"R. B. Hayward and C. Hoang and F. Maffrey"
-, title =	"Optimizing Weakly Triangulated Graphs"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1987
-, update =	"01.04 smid, 98.03 bibrelex"
+, author =      "R. B. Hayward and C. Hoang and F. Maffrey"
+, title =       "Optimizing Weakly Triangulated Graphs"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1987
+, update =      "01.04 smid, 98.03 bibrelex"
 }
 
 @techreport{hk-ing-93
-, author =	"R. B. Hayward and P. Kearney"
-, title =	"Investigating {NeST} Graphs"
-, number =	"TR-CS-04-93"
-, institution =	"U. Lethbridge"
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "R. B. Hayward and P. Kearney"
+, title =       "Investigating {NeST} Graphs"
+, number =      "TR-CS-04-93"
+, institution = "U. Lethbridge"
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{hk-tfnr-94
-, author =	"R. B. Hayward and P. Kearney"
-, title =	"Tolerance-Free {NeST} Representations"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"275--280"
-, cites =	"bc-tpg-84, bd-nstg-93, bilf-putg-91, g-igsec-74, g-agtpg-80, gm-gigt-82, gmt-tg-84, gls-papg, h-ag-57, h-wtg-85, hk-ing-93, k-nr-, mrt-ttg-88, r-ig-69, t-cbmal-83, bm-gta-76, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "R. B. Hayward and P. Kearney"
+, title =       "Tolerance-Free {NeST} Representations"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "275--280"
+, cites =       "bc-tpg-84, bd-nstg-93, bilf-putg-91, g-igsec-74, g-agtpg-80, gm-gigt-82, gmt-tg-84, gls-papg, h-ag-57, h-wtg-85, hk-ing-93, k-nr-, mrt-ttg-88, r-ig-69, t-cbmal-83, bm-gta-76, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @article{hafg-ecpmm-95
-, author =	"V. Hayward and S. Aubry and A. Foisy and Y. Ghallab"
-, title =	"Efficient collision prediction among many moving objects"
-, journal =	"Internat. J. Robot. Res."
-, volume =	14
-, number =	2
-, year =	1995
-, pages =	"129--143"
-, update =	"98.07 bibrelex"
+, author =      "V. Hayward and S. Aubry and A. Foisy and Y. Ghallab"
+, title =       "Efficient collision prediction among many moving objects"
+, journal =     "Internat. J. Robot. Res."
+, volume =      14
+, number =      2
+, year =        1995
+, pages =       "129--143"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{h-dcadd-88
-, author =	"C. Hazelwood"
-, title =	"A Divide and Conquer Approach to $D$-dimensional Triangulations"
-, school =	"Department of Computer Science, University of Texas at Austin"
-, year =	1988
-, keywords =	"doctoral thesis"
-, annote =	"Contains Pascal code for algorithms"
+, author =      "C. Hazelwood"
+, title =       "A Divide and Conquer Approach to $D$-dimensional Triangulations"
+, school =      "Department of Computer Science, University of Texas at Austin"
+, year =        1988
+, keywords =    "doctoral thesis"
+, annote =      "Contains Pascal code for algorithms"
 }
 
 @article{h-act-93
-, author =	"C. Hazlewood"
-, title =	"Approximating Constrained Tetrahedrizations"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	10
-, number =	1
-, month =	jun
-, year =	1993
-, pages =	"67--87"
-, update =	"95.05 held"
+, author =      "C. Hazlewood"
+, title =       "Approximating Constrained Tetrahedrizations"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      10
+, number =      1
+, month =       jun
+, year =        1993
+, pages =       "67--87"
+, update =      "95.05 held"
 }
 
 @inproceedings{hk-cdvm-97
-, author =	"T. He and A. Kaufman"
-, title =	"Collision Detection for Volumetric Models"
-, booktitle =	"Proc. IEEE Visualization"
-, site =	"Phoenix, AZ"
-, year =	1997
-, pages =	"??"
-, update =	"98.03 mitchell"
+, author =      "T. He and A. Kaufman"
+, title =       "Collision Detection for Volumetric Models"
+, booktitle =   "Proc. IEEE Visualization"
+, site =        "Phoenix, AZ"
+, year =        1997
+, pages =       "??"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{hm-cgl-97
-, author =	"Weiqing He and Kim Marriott"
-, title =	"Constrained Graph Layout"
-, editor =	"Stephen North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"217--232"
-, keywords =	"graph drawing, constraints"
-, update =	"98.11 bibrelex, 98.07 tamassia+vismara"
+, author =      "Weiqing He and Kim Marriott"
+, title =       "Constrained Graph Layout"
+, editor =      "Stephen North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "217--232"
+, keywords =    "graph drawing, constraints"
+, update =      "98.11 bibrelex, 98.07 tamassia+vismara"
 }
 
 @article{h-epafm-91
-, author =	"Xin He"
-, title =	"An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	37
-, number =	2
-, year =	1991
-, pages =	"111--116"
+, author =      "Xin He"
+, title =       "An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      37
+, number =      2
+, year =        1991
+, pages =       "111--116"
 }
 
 @techreport{h-frdpt-90
-, author =	"X. He"
-, title =	"On Finding the Rectangular Duals of Planar Triangulated Graphs"
-, number =	"90-24"
-, institution =	"Department of Computer Science, University of Buffalo"
-, year =	1990
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "X. He"
+, title =       "On Finding the Rectangular Duals of Planar Triangulated Graphs"
+, number =      "90-24"
+, institution = "Department of Computer Science, University of Buffalo"
+, year =        1990
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{hk-pccoc-93
-, author =	"Xin He and Ming-Yang Kao"
-, title =	"Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"303--312"
-, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Xin He and Ming-Yang Kao"
+, title =       "Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "303--312"
+, update =      "98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{hk-reldp-95
-, author =	"X. He and M.-Y. Kao"
-, title =	"Regular Edge Labelings and Drawings of Planar Graphs"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"96--103"
-, keywords =	"graph drawing, planar, straight-line, visibility, survey"
-, update =	"95.01 tamassia"
+, author =      "X. He and M.-Y. Kao"
+, title =       "Regular Edge Labelings and Drawings of Planar Graphs"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "96--103"
+, keywords =    "graph drawing, planar, straight-line, visibility, survey"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{h-otrpa-94
-, author =	"Patrick Healy"
-, title =	"An {$O(n)$}-Time Rectangle Placement Algorithm"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"33--37"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Patrick Healy"
+, title =       "An {$O(n)$}-Time Rectangle Placement Algorithm"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "33--37"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @book{hb-cg-86
-, author =	"D. Hearn and M. P. Baker"
-, title =	"Computer Graphics"
-, publisher =	"Prentice Hall"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "D. Hearn and M. P. Baker"
+, title =       "Computer Graphics"
+, publisher =   "Prentice Hall"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{hp-rchsg-96
-, author =	"M. A. Hearst and J. O. Pedersen"
-, title =	"Reexamining the Cluster Hypothesis: Scatter/Gather on Retrieval Results"
-, editor =	"Hans-Peter Frei and Donna Harman and Peter Sch{\"a}uble and Ross Wilkinson"
-, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
-, publisher =	"ACM Press"
-, address =	"New York"
-, month =	aug
-, year =	1996
-, pages =	"76--84"
-, update =	"98.07 agarwal"
+, author =      "M. A. Hearst and J. O. Pedersen"
+, title =       "Reexamining the Cluster Hypothesis: Scatter/Gather on Retrieval Results"
+, editor =      "Hans-Peter Frei and Donna Harman and Peter Sch{\"a}uble and Ross Wilkinson"
+, booktitle =   "Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
+, publisher =   "ACM Press"
+, address =     "New York"
+, month =       aug
+, year =        1996
+, pages =       "76--84"
+, update =      "98.07 agarwal"
 }
 
 @article{hk-cfmvc-93
-, author =	"D. Heath and S. Kasif"
-, title =	"The complexity of finding minimal {Voronoi} covers with application to machine learning"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"289--305"
-, update =	"96.09 devillers"
+, author =      "D. Heath and S. Kasif"
+, title =       "The complexity of finding minimal {Voronoi} covers with application to machine learning"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "289--305"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{h-epgsp-84
-, author =	"L. Heath"
-, title =	"Embedding planar graphs in seven pages"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1984
-, pages =	"74--83"
+, author =      "L. Heath"
+, title =       "Embedding planar graphs in seven pages"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1984
+, pages =       "74--83"
 }
 
 @techreport{hp-nrmwt-92
-, author =	"L. Heath and S. Pemmaraju"
-, title =	"New results for the minimum weight triangulation problem"
-, type =	"Technical {Report}"
-, number =	"92-30"
-, institution =	"Dept. Comput. Sci., Virginia Politechnic Inst. and State Univ."
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "L. Heath and S. Pemmaraju"
+, title =       "New results for the minimum weight triangulation problem"
+, type =        "Technical {Report}"
+, number =      "92-30"
+, institution = "Dept. Comput. Sci., Virginia Politechnic Inst. and State Univ."
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @article{hp-nrmwt-94
-, author =	"L. Heath and S. Pemmaraju"
-, title =	"New results for the minimum weight triangulation problem"
-, journal =	"Algorithmica"
-, volume =	12
-, year =	1994
-, pages =	"533--552"
-, update =	"97.11 bibrelex"
+, author =      "L. Heath and S. Pemmaraju"
+, title =       "New results for the minimum weight triangulation problem"
+, journal =     "Algorithmica"
+, volume =      12
+, year =        1994
+, pages =       "533--552"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{hpr-pfabv-90
-, author =	"L. S. Heath and P. K. Paripati and J. W. Roach"
-, title =	"Polyhedra: faces are better than vertices"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"191--199"
-, precedes =	"hpr-rpfab-93"
-, cites =	"gt-tgt-87, g-cp-67, h-cvmev-82, m-ism-88, mw-fowf-80, p-prr-89, r-rrstm-80, rwr-sdi3d-86, rpw-csbsd-87, w-ebdss-85, ZZZ"
-, update =	"98.07 bibrelex, 96.09 devillers"
+, author =      "L. S. Heath and P. K. Paripati and J. W. Roach"
+, title =       "Polyhedra: faces are better than vertices"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "191--199"
+, precedes =    "hpr-rpfab-93"
+, cites =       "gt-tgt-87, g-cp-67, h-cvmev-82, m-ism-88, mw-fowf-80, p-prr-89, r-rrstm-80, rwr-sdi3d-86, rpw-csbsd-87, w-ebdss-85, ZZZ"
+, update =      "98.07 bibrelex, 96.09 devillers"
 }
 
 @article{hpr-rpfab-93
-, author =	"L. S. Heath and P. K. Paripati and J. W. Roach"
-, title =	"Representing polyhedra: faces are better than vertices"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"327--351"
-, succeeds =	"hpr-pfabv-90"
-, update =	"97.11 bibrelex, 96.09 devillers"
+, author =      "L. S. Heath and P. K. Paripati and J. W. Roach"
+, title =       "Representing polyhedra: faces are better than vertices"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "327--351"
+, succeeds =    "hpr-pfabv-90"
+, update =      "97.11 bibrelex, 96.09 devillers"
 }
 
 @mastersthesis{h-ciqfb-80
-, author =	"P. Heckbert"
-, title =	"Color Image Quantization for Frame Buffer Display"
-, school =	"Department of Mathematics, Massachusetts Institute of Technology"
-, year =	1980
-, note =	"Bachelor's Thesis"
-, keywords =	"master thesis"
-, update =	"97.11 bibrelex"
+, author =      "P. Heckbert"
+, title =       "Color Image Quantization for Frame Buffer Display"
+, school =      "Department of Mathematics, Massachusetts Institute of Technology"
+, year =        1980
+, note =        "Bachelor's Thesis"
+, keywords =    "master thesis"
+, update =      "97.11 bibrelex"
 }
 
 @article{h-ciqfb-82
-, author =	"P. Heckbert"
-, title =	"Color image quantization frame buffer display"
-, journal =	"ACM Trans. Comput. Graph."
-, volume =	16
-, number =	3
-, year =	1982
-, pages =	"297--304"
-, update =	"98.03 bibrelex"
+, author =      "P. Heckbert"
+, title =       "Color image quantization frame buffer display"
+, journal =     "ACM Trans. Comput. Graph."
+, volume =      16
+, number =      3
+, year =        1982
+, pages =       "297--304"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{h-dmr-92
-, author =	"Paul Heckbert"
-, title =	"Discontinuity meshing for radiosity"
-, booktitle =	"3. Eurographics Workshop on Rendering"
-, month =	may
-, year =	1992
-, pages =	"203--215"
-, update =	"98.11 bibrelex"
+, author =      "Paul Heckbert"
+, title =       "Discontinuity meshing for radiosity"
+, booktitle =   "3. Eurographics Workshop on Rendering"
+, month =       may
+, year =        1992
+, pages =       "203--215"
+, update =      "98.11 bibrelex"
 }
 
 @book{h-gg4-94
-, title =	"Graphics Gems {IV}"
-, editor =	"Paul Heckbert"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, note =	"comes with either MAC or DOS floppy"
-, keywords =	"computer graphics, image processing"
-, comments =	"C code from books in Gems series available in subdirectories
+, title =       "Graphics Gems {IV}"
+, editor =      "Paul Heckbert"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, note =        "comes with either MAC or DOS floppy"
+, keywords =    "computer graphics, image processing"
+, comments =    "C code from books in Gems series available in subdirectories
 of \url{ftp://princeton.edu/pub/Graphics/GraphicsGems}"
-, update =	"94.09 heckbert"
+, update =      "94.09 heckbert"
 }
 
 @incollection{h-mrt-94
-, author =	"Paul S. Heckbert"
-, title =	"A Minimal Ray Tracer"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"375--381"
-, keywords =	"ray tracing, obfuscation"
-, update =	"94.09 heckbert"
-, annote =	"Answers the question: how short can a ray tracer be?
+, author =      "Paul S. Heckbert"
+, title =       "A Minimal Ray Tracer"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "375--381"
+, keywords =    "ray tracing, obfuscation"
+, update =      "94.09 heckbert"
+, annote =      "Answers the question: how short can a ray tracer be?
 Contains C code."
 }
 
 @incollection{h-bcpiw-94
-, author =	"Paul S. Heckbert"
-, title =	"Bilinear {Coons} Patch Image Warping"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"438--446"
-, keywords =	"morph, resampling"
-, update =	"94.09 heckbert"
-, annote =	"Presents a fast technique to warp an image according to
+, author =      "Paul S. Heckbert"
+, title =       "Bilinear {Coons} Patch Image Warping"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "438--446"
+, keywords =    "morph, resampling"
+, update =      "94.09 heckbert"
+, annote =      "Presents a fast technique to warp an image according to
 four boundary curves. This can be used to correct distortions in images, or
 to introduce them, for special effects purposes. Contains C code."
 }
 
 @inproceedings{h-rf-92
-, author =	"P. S. Heckbert"
-, title =	"Radiosity in flatland"
-, booktitle =	"Eurographics 92"
-, site =	"Cambridge, UK"
-, month =	sep
-, year =	1992
-, pages =	"181--192"
-, update =	"97.11 bibrelex"
+, author =      "P. S. Heckbert"
+, title =       "Radiosity in flatland"
+, booktitle =   "Eurographics 92"
+, site =        "Cambridge, UK"
+, month =       sep
+, year =        1992
+, pages =       "181--192"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{h-sgiua-91
-, author =	"P. S. Heckbert"
-, title =	"Simulating Global Illumination Using Adaptive Meshing"
-, school =	"University of California"
-, address =	"Berkeley, CA"
-, month =	jan
-, year =	1991
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "P. S. Heckbert"
+, title =       "Simulating Global Illumination Using Adaptive Meshing"
+, school =      "University of California"
+, address =     "Berkeley, CA"
+, month =       jan
+, year =        1991
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{hg-fpath-95
-, author =	"P. S. Heckbert and M. Garland"
-, title =	"Fast polygonal approximation of terrains and height fields"
-, type =	"Report"
-, number =	"CMU-CS-95-181"
-, institution =	"Carnegie Mellon University"
-, year =	1995
-, keywords =	"surface approximation, mesh simplification, decimiation, terrains"
-, update =	"96.01 mitchell"
+, author =      "P. S. Heckbert and M. Garland"
+, title =       "Fast polygonal approximation of terrains and height fields"
+, type =        "Report"
+, number =      "CMU-CS-95-181"
+, institution = "Carnegie Mellon University"
+, year =        1995
+, keywords =    "surface approximation, mesh simplification, decimiation, terrains"
+, update =      "96.01 mitchell"
 }
 
 @article{hh-btpo-84
-, author =	"P. S. Heckbert and P. Hanrahan"
-, title =	"Beam Tracing Polygonal Objects"
-, journal =	"Comput. Graph."
-, volume =	18
-, number =	3
-, year =	1984
-, pages =	"119--127"
-, note =	"Proc. SIGGRAPH '84"
-, update =	"97.11 bibrelex"
+, author =      "P. S. Heckbert and P. Hanrahan"
+, title =       "Beam Tracing Polygonal Objects"
+, journal =     "Comput. Graph."
+, volume =      18
+, number =      3
+, year =        1984
+, pages =       "119--127"
+, note =        "Proc. SIGGRAPH '84"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{hl-culbt-96
-, author =	"R. Heckmann and T. Lengauer"
-, title =	"Computing upper and lower bounds on textile nesting problems"
-, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1136
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"392--405"
-, update =	"97.03 smid"
+, author =      "R. Heckmann and T. Lengauer"
+, title =       "Computing upper and lower bounds on textile nesting problems"
+, booktitle =   "Proc. 4th Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1136
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "392--405"
+, update =      "97.03 smid"
 }
 
 @inproceedings{hk-esrpo-90
-, author =	"S. Heep and H.-P. Kriegel"
-, title =	"Effiziente sekund{\"a}rspeichergeeignete {Randdarstellung} polygonaler {Objekte} und ihre algorithmische {Bearbeitung}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	11
-, update =	"00.03 bibrelex"
+, author =      "S. Heep and H.-P. Kriegel"
+, title =       "Effiziente sekund{\"a}rspeichergeeignete {Randdarstellung} polygonaler {Objekte} und ihre algorithmische {Bearbeitung}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       11
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{h-oatgp-93
-, author =	"P. J. Heffernan"
-, title =	"An optimal algorithm for the two-guard problem"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"348--358"
-, precedes =	"h-oatgp-96"
-, cites =	"at-oadvp-81, c-tsplt-91a, cn-owr-86, c-ctpg-75, et-gpprl-89, f-spcwt-78, ghlst-ltavs-87, h-ltawm-90, ik-tgp-91, ll-ccagp-86, lp-esppr-84, lc-scvps-90, mw-omcpo-90i, o-agta-87, s-vpp-89, ZZZ"
-, update =	"98.03 bibrelex, 96.09 devillers, 93.09 jones"
+, author =      "P. J. Heffernan"
+, title =       "An optimal algorithm for the two-guard problem"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "348--358"
+, precedes =    "h-oatgp-96"
+, cites =       "at-oadvp-81, c-tsplt-91a, cn-owr-86, c-ctpg-75, et-gpprl-89, f-spcwt-78, ghlst-ltavs-87, h-ltawm-90, ik-tgp-91, ll-ccagp-86, lp-esppr-84, lc-scvps-90, mw-omcpo-90i, o-agta-87, s-vpp-89, ZZZ"
+, update =      "98.03 bibrelex, 96.09 devillers, 93.09 jones"
 }
 
 @article{h-oatgp-96
-, author =	"P. J. Heffernan"
-, title =	"An optimal algorithm for the two-guard problem"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"15--44"
-, succeeds =	"h-oatgp-93"
-, update =	"96.09 devillers"
+, author =      "P. J. Heffernan"
+, title =       "An optimal algorithm for the two-guard problem"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "15--44"
+, succeeds =    "h-oatgp-93"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{h-gaaps-93
-, author =	"Paul J. Heffernan"
-, title =	"Generalized Approximate Algorithms for Point Set Congruence"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"373--384"
-, update =	"96.05 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "Paul J. Heffernan"
+, title =       "Generalized Approximate Algorithms for Point Set Congruence"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "373--384"
+, update =      "96.05 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @inproceedings{h-ltawm-90
-, author =	"P. J. Heffernan"
-, title =	"Linear-time algorithms for weakly-monotone polygons"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"236--239"
-, cites =	"c-tsplt-90t, et-gpprl-89, gjpt-tsp-78, hm-svpap-90, kkt-ptots-90i, lp-oafkp-79, ps-tspm-81, t-ocspt-88, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. J. Heffernan"
+, title =       "Linear-time algorithms for weakly-monotone polygons"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "236--239"
+, cites =       "c-tsplt-90t, et-gpprl-89, gjpt-tsp-78, hm-svpap-90, kkt-ptots-90i, lp-oafkp-79, ps-tspm-81, t-ocspt-88, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{h-tsmac-91
-, author =	"P. J. Heffernan"
-, title =	"The Translation Square Map and Approximate Congruence"
-, journal =	"Inform. Process. Lett."
-, volume =	39
-, year =	1991
-, pages =	"153--159"
-, update =	"93.09 milone+mitchell"
+, author =      "P. J. Heffernan"
+, title =       "The Translation Square Map and Approximate Congruence"
+, journal =     "Inform. Process. Lett."
+, volume =      39
+, year =        1991
+, pages =       "153--159"
+, update =      "93.09 milone+mitchell"
 }
 
 @phdthesis{h-tcgpm-91
-, author =	"P. J. Heffernan"
-, title =	"Topics in computational geometry: point matching and polygonal visibility"
-, type =	"Ph.{D}. Thesis"
-, school =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1991
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "P. J. Heffernan"
+, title =       "Topics in computational geometry: point matching and polygonal visibility"
+, type =        "Ph.{D}. Thesis"
+, school =      "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1991
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @techreport{hm-oacvp-90
-, author =	"P. J. Heffernan and Joseph S. B. Mitchell"
-, title =	"An optimal algorithm for computing visibility in the plane"
-, type =	"Technical {Report}"
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1990
-, keywords =	"visibility"
-, precedes =	"hm-oacvp-91"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, author =      "P. J. Heffernan and Joseph S. B. Mitchell"
+, title =       "An optimal algorithm for computing visibility in the plane"
+, type =        "Technical {Report}"
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1990
+, keywords =    "visibility"
+, precedes =    "hm-oacvp-91"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @inproceedings{hm-oacvp-91
-, author =	"P. J. Heffernan and Joseph S. B. Mitchell"
-, title =	"An optimal algorithm for computing visibility in the plane"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"437--448"
-, keywords =	"visibility, lower envelopes, polygons with holes"
-, succeeds =	"hm-oacvp-90"
-, precedes =	"hm-oacvp-95"
-, update =	"98.03 mitchell, 96.05 mitchell"
+, author =      "P. J. Heffernan and Joseph S. B. Mitchell"
+, title =       "An optimal algorithm for computing visibility in the plane"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "437--448"
+, keywords =    "visibility, lower envelopes, polygons with holes"
+, succeeds =    "hm-oacvp-90"
+, precedes =    "hm-oacvp-95"
+, update =      "98.03 mitchell, 96.05 mitchell"
 }
 
 @article{hm-oacvp-95
-, author =	"P. J. Heffernan and Joseph S. B. Mitchell"
-, title =	"An optimal algorithm for computing visibility in the plane"
-, journal =	"SIAM J. Comput."
-, volume =	24
-, number =	1
-, year =	1995
-, pages =	"184--201"
-, keywords =	"visibility, lower envelopes, polygons with holes"
-, succeeds =	"hm-oacvp-91"
-, update =	"98.03 mitchell, 96.05 mitchell"
+, author =      "P. J. Heffernan and Joseph S. B. Mitchell"
+, title =       "An optimal algorithm for computing visibility in the plane"
+, journal =     "SIAM J. Comput."
+, volume =      24
+, number =      1
+, year =        1995
+, pages =       "184--201"
+, keywords =    "visibility, lower envelopes, polygons with holes"
+, succeeds =    "hm-oacvp-91"
+, update =      "98.03 mitchell, 96.05 mitchell"
 }
 
 @inproceedings{hm-svpap-90
-, author =	"P. J. Heffernan and Joseph S. B. Mitchell"
-, title =	"Structured visibility profiles with applications to problems in simple polygons"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"53--62"
-, cites =	"acm-mpoap-89, at-oadvp-81, bt-ladts-86, c-ept-90, cg-vippg-89, e-hdpa-85, ea-lacvp-81, fhs-cmsp-89, gjpt-tsp-78, g-cvpcs-86, gy-fchsp-83, ghlst-ltavs-87, js-clvpa-87, k-osps-83, kkt-ptots-90i, l-vsp-83, ll-cvpe-84, lp-esppr-84, ma-lafch-79, m-olcch-87, ps-rgpcr-86, ps-tspm-81, s-ltaml-86, tv-otats-88, t-ltass-86a, t-stsps-89, t-spsts-85, t-mss-85, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "P. J. Heffernan and Joseph S. B. Mitchell"
+, title =       "Structured visibility profiles with applications to problems in simple polygons"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "53--62"
+, cites =       "acm-mpoap-89, at-oadvp-81, bt-ladts-86, c-ept-90, cg-vippg-89, e-hdpa-85, ea-lacvp-81, fhs-cmsp-89, gjpt-tsp-78, g-cvpcs-86, gy-fchsp-83, ghlst-ltavs-87, js-clvpa-87, k-osps-83, kkt-ptots-90i, l-vsp-83, ll-cvpe-84, lp-esppr-84, ma-lafch-79, m-olcch-87, ps-rgpcr-86, ps-tspm-81, s-ltaml-86, tv-otats-88, t-ltass-86a, t-stsps-89, t-spsts-85, t-mss-85, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{hs-adaps-91
-, author =	"P. J. Heffernan and S. Schirra"
-, title =	"Approximate decision algorithms for point set congruence"
-, type =	"Report"
-, number =	"MPI-I-91-110"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1991
-, precedes =	"hs-adaps-92"
+, author =      "P. J. Heffernan and S. Schirra"
+, title =       "Approximate decision algorithms for point set congruence"
+, type =        "Report"
+, number =      "MPI-I-91-110"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1991
+, precedes =    "hs-adaps-92"
 }
 
 @inproceedings{hs-adaps-92
-, author =	"P. J. Heffernan and S. Schirra"
-, title =	"Approximate decision algorithms for point set congruence"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"93--101"
-, succeeds =	"hs-adaps-91"
-, precedes =	"hs-adaps-94"
-, cites =	"amww-cssgo-88, akmsw-mpnrc-91, amo-nf-90, amz-apmp-89, b-mbimu-84, b-azede-90, fm-cpgcs-91, gt-namfp-88, gtt-nfa-90, h-tsmac-91, hk-cmhdp-90, hks-uevsi-91, isi-mgftc-89, i-acsdp-90, krt-fdmfa-92, ls-ocmgc-91i, s-udbde-88, s-aaac-90, s-pma-90, ZZZ"
-, update =	"97.11 bibrelex, 96.09 devillers"
+, author =      "P. J. Heffernan and S. Schirra"
+, title =       "Approximate decision algorithms for point set congruence"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "93--101"
+, succeeds =    "hs-adaps-91"
+, precedes =    "hs-adaps-94"
+, cites =       "amww-cssgo-88, akmsw-mpnrc-91, amo-nf-90, amz-apmp-89, b-mbimu-84, b-azede-90, fm-cpgcs-91, gt-namfp-88, gtt-nfa-90, h-tsmac-91, hk-cmhdp-90, hks-uevsi-91, isi-mgftc-89, i-acsdp-90, krt-fdmfa-92, ls-ocmgc-91i, s-udbde-88, s-aaac-90, s-pma-90, ZZZ"
+, update =      "97.11 bibrelex, 96.09 devillers"
 }
 
 @article{hs-adaps-94
-, author =	"P. J. Heffernan and S. Schirra"
-, title =	"Approximate decision algorithms for point set congruence"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"137--156"
-, succeeds =	"hs-adaps-92"
-, update =	"96.09 devillers"
+, author =      "P. J. Heffernan and S. Schirra"
+, title =       "Approximate decision algorithms for point set congruence"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "137--156"
+, succeeds =    "hs-adaps-92"
+, update =      "96.09 devillers"
 }
 
 @article{h-udpdn-81
-, author =	"L. Heffter"
-, title =	"{\"U}ber das {Problem} der {Nachbargebiete}"
-, journal =	"Math. Ann."
-, volume =	38
-, year =	1981
-, pages =	"477--508"
+, author =      "L. Heffter"
+, title =       "{\"U}ber das {Problem} der {Nachbargebiete}"
+, journal =     "Math. Ann."
+, volume =      38
+, year =        1981
+, pages =       "477--508"
 }
 
 @article{h-acpr-82
-, author =	"A. Heged{\"u}s"
-, title =	"Algorithms for Covering Polygons by Rectangles"
-, journal =	"Comput. Aided Design"
-, volume =	14
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "A. Heged{\"u}s"
+, title =       "Algorithms for Covering Polygons by Rectangles"
+, journal =     "Comput. Aided Design"
+, volume =      14
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @article{hsb-tarms-90
-, author =	"W. Heiden and M. Schlenkrich and J. Brickmann"
-, title =	"Triangulation algorithms for the representation of molecular surface properties"
-, journal =	"J. Comput. Aided Mol. Des."
-, volume =	4
-, year =	1990
-, pages =	"255--269"
-, update =	"98.03 bibrelex"
+, author =      "W. Heiden and M. Schlenkrich and J. Brickmann"
+, title =       "Triangulation algorithms for the representation of molecular surface properties"
+, journal =     "J. Comput. Aided Mol. Des."
+, volume =      4
+, year =        1990
+, pages =       "255--269"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{hss-uccli-94
-, author =	"W. Heidrich and P. Slusallek and H.-P. Seidel"
-, title =	"Using {C}++ class libraries from an interpreted language"
-, booktitle =	"Technology of Object-Oriented Languages and Systems"
-, nickname =	"TOOLS"
-, site =	"Santa Barbara, CA"
-, year =	1994
-, pages =	"397--408"
-, update =	"98.07 bibrelex"
+, author =      "W. Heidrich and P. Slusallek and H.-P. Seidel"
+, title =       "Using {C}++ class libraries from an interpreted language"
+, booktitle =   "Technology of Object-Oriented Languages and Systems"
+, nickname =    "TOOLS"
+, site =        "Santa Barbara, CA"
+, year =        1994
+, pages =       "397--408"
+, update =      "98.07 bibrelex"
 }
 
 @article{h-mgasi-83
-, author =	"E. Heighway"
-, title =	"A mesh generator for automatically subdividing irregular polygons into quadrilaterals"
-, journal =	"IEEE Trans. Magn."
-, volume =	19
-, number =	6
-, year =	1983
-, pages =	"2535--2538"
-, update =	"97.11 bibrelex"
+, author =      "E. Heighway"
+, title =       "A mesh generator for automatically subdividing irregular polygons into quadrilaterals"
+, journal =     "IEEE Trans. Magn."
+, volume =      19
+, number =      6
+, year =        1983
+, pages =       "2535--2538"
+, update =      "97.11 bibrelex"
 }
 
 @article{hb-tdatm-82
-, author =	"E. A. Heighway and C. S. Biddlecombe"
-, title =	"Two Dimensional Automatic Triangular Mesh Generation for the Finite Element Electromagnetic Package {PE2D}"
-, journal =	"IEEE Trans. Magn."
-, volume =	"MAG-18"
-, year =	1982
-, pages =	"594--598"
-, annote =	"``Poorness'' measure ``fractional difference of area
-		 of element and equilateral triangle of same
-		 perimeter''. Nodes are moved to fix this."
+, author =      "E. A. Heighway and C. S. Biddlecombe"
+, title =       "Two Dimensional Automatic Triangular Mesh Generation for the Finite Element Electromagnetic Package {PE2D}"
+, journal =     "IEEE Trans. Magn."
+, volume =      "MAG-18"
+, year =        1982
+, pages =       "594--598"
+, annote =      "``Poorness'' measure ``fractional difference of area
+                 of element and equilateral triangle of same
+                 perimeter''. Nodes are moved to fix this."
 }
 
 @inproceedings{h-tstel-01
-, author =	"Laura Heinrich-Litan"
-, title =	"Time-Space Tradeoffs for Exact {$L_\infty$} Nearest Neighbor Search in High Dimensions"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"93--96"
-, update =	"01.04 icking"
+, author =      "Laura Heinrich-Litan"
+, title =       "Time-Space Tradeoffs for Exact {$L_\infty$} Nearest Neighbor Search in High Dimensions"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "93--96"
+, update =      "01.04 icking"
 }
 
 @incollection{hrr-araga-91
-, author =	"J. Heintz and T. Reico and M.-F. Roy"
-, title =	"Algorithms in real algebraic geometry and applications to computational geometry"
-, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
-, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
-, publisher =	"American Mathematical Society, Association for Computing Machinery"
-, address =	"Providence, RI"
-, year =	1991
-, pages =	"137--163"
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "J. Heintz and T. Reico and M.-F. Roy"
+, title =       "Algorithms in real algebraic geometry and applications to computational geometry"
+, editor =      "J. E. Goodman and R. Pollack and W. Steiger"
+, booktitle =   "Discrete and Computational Geometry: Papers from the DIMACS Special Year"
+, publisher =   "American Mathematical Society, Association for Computing Machinery"
+, address =     "Providence, RI"
+, year =        1991
+, pages =       "137--163"
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{hrs-dccss-94
-, author =	"J. Heintz and M.-F. Roy and P. Solern{\'o}"
-, title =	"Description of the connected components of a semialgebraic set in single exponential time"
-, journal =	"Discrete Comput. Geom."
-, volume =	11
-, year =	1994
-, pages =	"121--140"
-, update =	"98.07 agarwal"
+, author =      "J. Heintz and M.-F. Roy and P. Solern{\'o}"
+, title =       "Description of the connected components of a semialgebraic set in single exponential time"
+, journal =     "Discrete Comput. Geom."
+, volume =      11
+, year =        1994
+, pages =       "121--140"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{hrs-ocss-89
-, author =	"J. Heintz and M.-F. Roy and P. Solern{\'o}"
-, title =	"On the complexity of semialgebraic sets"
-, booktitle =	"Proc. IFIP San Francisco"
-, year =	1989
-, pages =	"293--298"
-, update =	"98.03 agarwal"
+, author =      "J. Heintz and M.-F. Roy and P. Solern{\'o}"
+, title =       "On the complexity of semialgebraic sets"
+, booktitle =   "Proc. IFIP San Francisco"
+, year =        1989
+, pages =       "293--298"
+, update =      "98.03 agarwal"
 }
 
 @incollection{hrs-sepfs-93
-, author =	"J. Heintz and M.-F. Roy and P. Solern{\'o}"
-, title =	"Single exponential path finding in semi-algebraic sets {II}: {The} general case"
-, editor =	"C. Bajaj"
-, booktitle =	"Algebraic Geometry and its Applications"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1993
-, pages =	"467--481"
-, update =	"98.07 agarwal"
+, author =      "J. Heintz and M.-F. Roy and P. Solern{\'o}"
+, title =       "Single exponential path finding in semi-algebraic sets {II}: {The} general case"
+, editor =      "C. Bajaj"
+, booktitle =   "Algebraic Geometry and its Applications"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1993
+, pages =       "467--481"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{hp-brd-89
-, author =	"G. Heinzinger and B. Paden"
-, title =	"Bounds on Robot Dynamics"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Scottsdale, AZ"
-, month =	may
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "G. Heinzinger and B. Paden"
+, title =       "Bounds on Robot Dynamics"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Scottsdale, AZ"
+, month =       may
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{hl-eapni-93
-, author =	"J. Heistermann and T. Lengauer"
-, title =	"Efficient Automatic Part Nesting on Irregular and Inhomogeneous Surfaces"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"251--259"
-, keywords =	"optimization, CAD, packing"
-, update =	"93.09 rote, 93.05 smid"
+, author =      "J. Heistermann and T. Lengauer"
+, title =       "Efficient Automatic Part Nesting on Irregular and Inhomogeneous Surfaces"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "251--259"
+, keywords =    "optimization, CAD, packing"
+, update =      "93.09 rote, 93.05 smid"
 }
 
 @inproceedings{h-fiacv-93
-, author =	"Martin Held"
-, title =	"A Fast Incremental Algorithm for Computing the {Voronoi} Diagram of a Planar Shape"
-, booktitle =	"Communicating with Virtual Worlds"
-, nickname =	"CGI '93"
-, publisher =	"Springer-Verlag"
-, address =	"Lausanne, Switzerland"
-, month =	jun
-, year =	1993
-, pages =	"318--329"
-, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 held"
+, author =      "Martin Held"
+, title =       "A Fast Incremental Algorithm for Computing the {Voronoi} Diagram of a Planar Shape"
+, booktitle =   "Communicating with Virtual Worlds"
+, nickname =    "CGI '93"
+, publisher =   "Springer-Verlag"
+, address =     "Lausanne, Switzerland"
+, month =       jun
+, year =        1993
+, pages =       "318--329"
+, update =      "98.07 bibrelex, 98.03 mitchell, 93.09 held"
 }
 
 @article{h-gbitp-91
-, author =	"Martin Held"
-, title =	"A Geometry-Based Investigation of the Tool Path Generation for Zigzag Pocket Machining"
-, journal =	"Visual Comput."
-, volume =	7
-, number =	"5--6"
-, month =	sep
-, year =	1991
-, pages =	"296--308"
-, update =	"98.03 mitchell, 93.09 held"
+, author =      "Martin Held"
+, title =       "A Geometry-Based Investigation of the Tool Path Generation for Zigzag Pocket Machining"
+, journal =     "Visual Comput."
+, volume =      7
+, number =      "5--6"
+, month =       sep
+, year =        1991
+, pages =       "296--308"
+, update =      "98.03 mitchell, 93.09 held"
 }
 
 @inproceedings{h-ertp-98
-, author =	"Martin Held"
-, title =	"Efficient and Reliable Triangulation of Polygons"
-, booktitle =	"Proc. Comput. Graphics Internat. 1998"
-, site =	"Hannover, Germany"
-, month =	jun
-, year =	1998
-, pages =	"633--643"
-, update =	"98.07 held+mitchell"
+, author =      "Martin Held"
+, title =       "Efficient and Reliable Triangulation of Polygons"
+, booktitle =   "Proc. Comput. Graphics Internat. 1998"
+, site =        "Hannover, Germany"
+, month =       jun
+, year =        1998
+, pages =       "633--643"
+, update =      "98.07 held+mitchell"
 }
 
 @techreport{h-eceri-96
-, author =	"Martin Held"
-, title =	"{ERIT} -- {A} Collection of Efficient and Reliable Intersection Tests"
-, type =	"Technical {Report}"
-, institution =	"University at Stony Brook"
-, year =	1996
-, update =	"98.03 mitchell"
-, annote =	"Submitted for publication"
+, author =      "Martin Held"
+, title =       "{ERIT} -- {A} Collection of Efficient and Reliable Intersection Tests"
+, type =        "Technical {Report}"
+, institution = "University at Stony Brook"
+, year =        1996
+, update =      "98.03 mitchell"
+, annote =      "Submitted for publication"
 }
 
 @techreport{h-ffist-98
-, author =	"Martin Held"
-, title =	"{FIST}: {Fast} Industrial-Strength Triangulation of Polygons"
-, institution =	"University at Stony Brook"
-, year =	1998
-, comments =	"Submitted for publication"
-, update =	"98.07 mitchell"
+, author =      "Martin Held"
+, title =       "{FIST}: {Fast} Industrial-Strength Triangulation of Polygons"
+, institution = "University at Stony Brook"
+, year =        1998
+, comments =    "Submitted for publication"
+, update =      "98.07 mitchell"
 }
 
 @inproceedings{h-gscgs-89
-, author =	"Martin Held"
-, title =	"GeoPocket -- {A} Sophisticated Computational Geometry Solution of Geometrical and Technological Problems Arising from Pocket Machining"
-, editor =	"F. Kimura and A. Rolstad{\aa}s"
-, booktitle =	"Proc. Computer Applications in Production and Engineering"
-, nickname =	"CAPE '89"
-, publisher =	"North-Holland"
-, month =	oct
-, year =	1989
-, pages =	"283--293"
-, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 held"
+, author =      "Martin Held"
+, title =       "GeoPocket -- {A} Sophisticated Computational Geometry Solution of Geometrical and Technological Problems Arising from Pocket Machining"
+, editor =      "F. Kimura and A. Rolstad{\aa}s"
+, booktitle =   "Proc. Computer Applications in Production and Engineering"
+, nickname =    "CAPE '89"
+, publisher =   "North-Holland"
+, month =       oct
+, year =        1989
+, pages =       "283--293"
+, update =      "98.07 bibrelex, 98.03 mitchell, 93.09 held"
 }
 
 @inproceedings{h-igvdp-93
-, author =	"Martin Held"
-, title =	"Incremental Generation of {Voronoi} Diagrams of Planar Shapes"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"70--73"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
+, author =      "Martin Held"
+, title =       "Incremental Generation of {Voronoi} Diagrams of Planar Shapes"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "70--73"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
 }
 
 @inproceedings{h-cvdcp-94
-, author =	"Martin Held"
-, title =	"On Computing {Voronoi} Diagrams of Convex Polyhedra by Means of Wavefront Propagation"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"128--133"
-, cites =	"a-am3sa-91, c-edt-92, gp-acfsm1-92, gykd-cdma3-91, h-fiacv-93, h-hcsco-90t, l-matps-82, m-rcvdp-93, ns-blss-91, obs-stcav-92, p-nmasp-78, p-masp-77, ps-cgi-90, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 94.09 jones"
+, author =      "Martin Held"
+, title =       "On Computing {Voronoi} Diagrams of Convex Polyhedra by Means of Wavefront Propagation"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "128--133"
+, cites =       "a-am3sa-91, c-edt-92, gp-acfsm1-92, gykd-cdma3-91, h-fiacv-93, h-hcsco-90t, l-matps-82, m-rcvdp-93, ns-blss-91, obs-stcav-92, p-nmasp-78, p-masp-77, ps-cgi-90, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 94.09 jones"
 }
 
 @book{h-cgpm-91
-, author =	"Martin Held"
-, title =	"On the Computational Geometry of Pocket Machining"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	500
-, publisher =	"Springer-Verlag"
-, month =	jun
-, year =	1991
-, isbn =	"3-540-54103-9"
-, update =	"98.03 mitchell, 93.09 held"
+, author =      "Martin Held"
+, title =       "On the Computational Geometry of Pocket Machining"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      500
+, publisher =   "Springer-Verlag"
+, month =       jun
+, year =        1991
+, isbn =        "3-540-54103-9"
+, update =      "98.03 mitchell, 93.09 held"
 }
 
 @article{h-vdocc-98
-, author =	"M. Held"
-, title =	"Voronoi Diagrams and Offset Curves of Curvilinear Polygons"
-, journal =	"Comput. Aided Design"
-, volume =	30
-, number =	4
-, month =	apr
-, year =	1998
-, pages =	"287--300"
-, update =	"98.07 held"
+, author =      "M. Held"
+, title =       "Voronoi Diagrams and Offset Curves of Curvilinear Polygons"
+, journal =     "Comput. Aided Design"
+, volume =      30
+, number =      4
+, month =       apr
+, year =        1998
+, pages =       "287--300"
+, update =      "98.07 held"
 }
 
 @article{h-veare-01
-, author =	"M. Held"
-, title =	"VRONI: {An} engineering approach to the reliable and efficient computation of {Voronoi} diagrams of points and line segments"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	18
-, year =	2001
-, pages =	"95--123"
-, update =	"01.07 smid"
+, author =      "M. Held"
+, title =       "VRONI: {An} engineering approach to the reliable and efficient computation of {Voronoi} diagrams of points and line segments"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      18
+, year =        2001
+, pages =       "95--123"
+, update =      "01.07 smid"
 }
 
 @inproceedings{h-zcgzp-90
-, author =	"Martin Held"
-, title =	"ZigPocket -- On the Computational Geometry of Zigzag Pocket Machining"
-, editor =	"T. S. Chua and T. L. Kunii"
-, booktitle =	"Proc. CG International '90"
-, nickname =	"CGI '90"
-, publisher =	"Springer-Verlag"
-, month =	jun
-, year =	1990
-, pages =	"281--296"
-, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 held"
+, author =      "Martin Held"
+, title =       "ZigPocket -- On the Computational Geometry of Zigzag Pocket Machining"
+, editor =      "T. S. Chua and T. L. Kunii"
+, booktitle =   "Proc. CG International '90"
+, nickname =    "CGI '90"
+, publisher =   "Springer-Verlag"
+, month =       jun
+, year =        1990
+, pages =       "281--296"
+, update =      "98.07 bibrelex, 98.03 mitchell, 93.09 held"
 }
 
 @inproceedings{hkm-rtcdm-96
-, author =	"M. Held and J. Klosowski and Joseph S. B. Mitchell"
-, title =	"Real-Time Collision Detection for Motion Simulation within Complex Environments"
-, booktitle =	"Proc. ACM SIGGRAPH'96 Visual Proceedings"
-, site =	"New Orleans, LA"
-, year =	1996
-, pages =	151
-, precedes =	"khmsz-ecdubv-98"
-, update =	"98.03 mitchell"
+, author =      "M. Held and J. Klosowski and Joseph S. B. Mitchell"
+, title =       "Real-Time Collision Detection for Motion Simulation within Complex Environments"
+, booktitle =   "Proc. ACM SIGGRAPH'96 Visual Proceedings"
+, site =        "New Orleans, LA"
+, year =        1996
+, pages =       151
+, precedes =    "khmsz-ecdubv-98"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{hkm-cdftv-96
-, author =	"Martin Held and James T. Klosowski and Joseph S. B. Mitchell"
-, title =	"Collision detection for fly-throughs in virtual environments"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"V13--V14"
-, precedes =	"hkm-ecdmv-95"
-, cites =	"clmp-ecdie-94, gsf-scdp-94, hkm-ecdmv-95, hkm-scgbb-95, hs-parss-93, h-cdiga-95, lm-fidgm-95, mms-qsrs-94, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat+mitchell"
+, author =      "Martin Held and James T. Klosowski and Joseph S. B. Mitchell"
+, title =       "Collision detection for fly-throughs in virtual environments"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "V13--V14"
+, precedes =    "hkm-ecdmv-95"
+, cites =       "clmp-ecdie-94, gsf-scdp-94, hkm-ecdmv-95, hkm-scgbb-95, hs-parss-93, h-cdiga-95, lm-fidgm-95, mms-qsrs-94, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat+mitchell"
 }
 
 @techreport{hkm-ecdmv-94
-, author =	"Martin Held and James T. Klosowski and Joseph S. B. Mitchell"
-, title =	"Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs"
-, institution =	"Department of Applied Mathematics, SUNY Stony Brook, NY"
-, year =	1994
-, keywords =	"mesh generation, stabbing number, BSP, R-star trees, R-tree"
-, precedes =	"hkm-ecdmv-95"
-, update =	"95.09 mitchell"
+, author =      "Martin Held and James T. Klosowski and Joseph S. B. Mitchell"
+, title =       "Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs"
+, institution = "Department of Applied Mathematics, SUNY Stony Brook, NY"
+, year =        1994
+, keywords =    "mesh generation, stabbing number, BSP, R-star trees, R-tree"
+, precedes =    "hkm-ecdmv-95"
+, update =      "95.09 mitchell"
 }
 
 @inproceedings{hkm-ecdmv-95
-, author =	"Martin Held and James T. Klosowski and Joseph S. B. Mitchell"
-, title =	"Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"205--210"
-, keywords =	"mesh generation, stabbing number, BSP, R-star trees, R-tree"
-, succeeds =	"hkm-ecdmv-94"
-, update =	"96.05 mitchell, 95.09 jones+mitchell"
+, author =      "Martin Held and James T. Klosowski and Joseph S. B. Mitchell"
+, title =       "Evaluation of Collision Detection Methods for Virtual Reality Fly-Throughs"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "205--210"
+, keywords =    "mesh generation, stabbing number, BSP, R-star trees, R-tree"
+, succeeds =    "hkm-ecdmv-94"
+, update =      "96.05 mitchell, 95.09 jones+mitchell"
 }
 
 @unpublished{hkm-scgbb-95
-, author =	"Martin Held and J. T. Klosowski and Joseph S. B. Mitchell"
-, title =	"Speed comparison of generalized bounding boxes"
-, year =	1995
-, note =	"??"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Martin Held and J. T. Klosowski and Joseph S. B. Mitchell"
+, title =       "Speed comparison of generalized bounding boxes"
+, year =        1995
+, note =        "??"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{hla-pmbcp-94
-, author =	"Martin Held and G. Luk{\'a}cs and L. Andor"
-, title =	"Pocket Machining Based on Contour-Parallel Tool Paths Generated by Means of Proximity Maps"
-, journal =	"Comput. Aided Design"
-, volume =	26
-, number =	3
-, month =	mar
-, year =	1994
-, pages =	"189--203"
-, update =	"98.03 mitchell, 96.09 devillers, 95.01 held"
+, author =      "Martin Held and G. Luk{\'a}cs and L. Andor"
+, title =       "Pocket Machining Based on Contour-Parallel Tool Paths Generated by Means of Proximity Maps"
+, journal =     "Comput. Aided Design"
+, volume =      26
+, number =      3
+, month =       mar
+, year =        1994
+, pages =       "189--203"
+, update =      "98.03 mitchell, 96.09 devillers, 95.01 held"
 }
 
 % ### others?
 @incollection{h??-skcsn-95
-, author =	"T. Helgason and others"
-, title =	"On shortest $k$-edge connected {Steiner} networks with rectilinear distance"
-, editor =	"Ding-Zhu Du and Panos M. Pardalos"
-, booktitle =	"Minmax and Applications"
-, series =	"Nonconvex Optimization and Applications"
-, year =	1995
-, pages =	""
-, keywords =	"optimization, Steiner tree, $L_1$ metrics"
-, update =	"95.09 korneenko"
+, author =      "T. Helgason and others"
+, title =       "On shortest $k$-edge connected {Steiner} networks with rectilinear distance"
+, editor =      "Ding-Zhu Du and Panos M. Pardalos"
+, booktitle =   "Minmax and Applications"
+, series =      "Nonconvex Optimization and Applications"
+, year =        1995
+, pages =       ""
+, keywords =    "optimization, Steiner tree, $L_1$ metrics"
+, update =      "95.09 korneenko"
 }
 
 @inproceedings{h-taatm-90
-, author =	"M. Heller"
-, title =	"Triangulation algorithms for adaptive terrain modeling"
-, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
-, year =	1990
-, pages =	"163--174"
-, update =	"98.07 devillers"
+, author =      "M. Heller"
+, title =       "Triangulation algorithms for adaptive terrain modeling"
+, booktitle =   "Proc. 4th Internat. Sympos. Spatial Data Handling"
+, year =        1990
+, pages =       "163--174"
+, update =      "98.07 devillers"
 }
 
 @inproceedings{hkp-oais-97
-, author =	"J. H. Hellerstein and E. Koustsoupias and C. H. Papadimtriou"
-, title =	"On the analysis of indexing schemes"
-, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
-, year =	1997
-, pages =	"249--256"
-, update =	"97.07 agarwal"
+, author =      "J. H. Hellerstein and E. Koustsoupias and C. H. Papadimtriou"
+, title =       "On the analysis of indexing schemes"
+, booktitle =   "Proc. Annu. ACM Sympos. Principles Database Syst."
+, year =        1997
+, pages =       "249--256"
+, update =      "97.07 agarwal"
 }
 
 @article{h-umkkm-23
-, author =	"E. Helly"
-, title =	"{\"U}ber {Mengen} konvexer {K{\"o}rper} mit gemeinschaftlichen {Punkten}"
-, journal =	"Jahresbericht Deutsch. Math. Verein."
-, volume =	32
-, year =	1923
-, pages =	"175--176"
-, update =	"97.11 bibrelex"
+, author =      "E. Helly"
+, title =       "{\"U}ber {Mengen} konvexer {K{\"o}rper} mit gemeinschaftlichen {Punkten}"
+, journal =     "Jahresbericht Deutsch. Math. Verein."
+, volume =      32
+, year =        1923
+, pages =       "175--176"
+, update =      "97.11 bibrelex"
 }
 
 @article{h-usvam-30
-, author =	"E. Helly"
-, title =	"{\"U}ber {Systeme} von abgeschlossenen {Mengen} mit gemeinschaftlichen {Punkten}"
-, journal =	"Monaths. Math. und Physik"
-, volume =	37
-, year =	1930
-, pages =	"281--302"
-, update =	"96.09 agarwal, 95.01 matousek"
+, author =      "E. Helly"
+, title =       "{\"U}ber {Systeme} von abgeschlossenen {Mengen} mit gemeinschaftlichen {Punkten}"
+, journal =     "Monaths. Math. und Physik"
+, volume =      37
+, year =        1930
+, pages =       "281--302"
+, update =      "96.09 agarwal, 95.01 matousek"
 }
 
 @book{h-lp-89
-, author =	"Armin Hemmerling"
-, title =	"Labyrinth Problems: Labyrinth-Searching Abilities of Automata"
-, publisher =	"B. G. Teubner"
-, address =	"Leipzig"
-, year =	1989
-, update =	"99.11 bibrelex, 97.03 icking"
+, author =      "Armin Hemmerling"
+, title =       "Labyrinth Problems: Labyrinth-Searching Abilities of Automata"
+, publisher =   "B. G. Teubner"
+, address =     "Leipzig"
+, year =        1989
+, update =      "99.11 bibrelex, 97.03 icking"
 }
 
 @techreport{h-nwpcd-93
-, author =	"Armin Hemmerling"
-, title =	"Navigation Without Perception of Coordinates and Distances"
-, number =	"TR-93-018"
-, institution =	"International Computer Science Institute"
-, address =	"Berkeley, California"
-, year =	1993
-, precedes =	"h-nwpcd-94"
-, update =	"97.03 icking"
+, author =      "Armin Hemmerling"
+, title =       "Navigation Without Perception of Coordinates and Distances"
+, number =      "TR-93-018"
+, institution = "International Computer Science Institute"
+, address =     "Berkeley, California"
+, year =        1993
+, precedes =    "h-nwpcd-94"
+, update =      "97.03 icking"
 }
 
 @article{h-nwpcd-94
-, author =	"Armin Hemmerling"
-, title =	"Navigation Without Perception of Coordinates and Distances"
-, journal =	"Mathematical Logic Quarterly"
-, volume =	40
-, year =	1994
-, pages =	"237--260"
-, succeeds =	"h-nwpcd-93"
-, update =	"97.03 icking"
+, author =      "Armin Hemmerling"
+, title =       "Navigation Without Perception of Coordinates and Distances"
+, journal =     "Mathematical Logic Quarterly"
+, volume =      40
+, year =        1994
+, pages =       "237--260"
+, succeeds =    "h-nwpcd-93"
+, update =      "97.03 icking"
 }
 
 @phdthesis{h-efitd-84
-, author =	"M. R. Henderson"
-, title =	"Extraction of feature information from three dimensional {CAD} data"
-, school =	"Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1984
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "M. R. Henderson"
+, title =       "Extraction of feature information from three dimensional {CAD} data"
+, school =      "Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1984
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ht-kdtre-82
-, author =	"T. C. Henderson and E. Triendl"
-, title =	"The $k$-d tree representation of edge descriptions"
-, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
-, site =	"Munich, West Germany"
-, year =	1982
-, pages =	"806--809"
+, author =      "T. C. Henderson and E. Triendl"
+, title =       "The $k$-d tree representation of edge descriptions"
+, booktitle =   "Proc. 6th IEEE Internat. Conf. Pattern Recogn."
+, site =        "Munich, West Germany"
+, year =        1982
+, pages =       "806--809"
 }
 
 @article{h-sppto-85
-, author =	"M. Henig"
-, title =	"The shortest path problem with two objective functions"
-, journal =	"European J. Oper. Res."
-, volume =	25
-, year =	1985
-, pages =	"281--291"
-, keywords =	"dynamic programming, networks, multiattribute utility"
-, update =	"93.09 milone+mitchell"
+, author =      "M. Henig"
+, title =       "The shortest path problem with two objective functions"
+, journal =     "European J. Oper. Res."
+, volume =      25
+, year =        1985
+, pages =       "281--291"
+, keywords =    "dynamic programming, networks, multiattribute utility"
+, update =      "93.09 milone+mitchell"
 }
 
 @incollection{hrgz-bpcp-97
-, author =	"M. Henk and J. Richter-Gebert and G. M. Ziegler"
-, title =	"Basic properties of convex polytopes"
-, chapter =	13
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"243--270"
-, update =	"97.11 orourke"
+, author =      "M. Henk and J. Richter-Gebert and G. M. Ziegler"
+, title =       "Basic properties of convex polytopes"
+, chapter =     13
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "243--270"
+, update =      "97.11 orourke"
 }
 
 @book{h-cit-79
-, author =	"M. Henle"
-, title =	"A Combinatorial Introduction to Topology"
-, publisher =	"W. H. Freeman"
-, address =	"San Francisco, CA"
-, year =	1979
-, update =	"93.05 orourke"
+, author =      "M. Henle"
+, title =       "A Combinatorial Introduction to Topology"
+, publisher =   "W. H. Freeman"
+, address =     "San Francisco, CA"
+, year =        1979
+, update =      "93.05 orourke"
 }
 
 @book{h-gsss-11
-, author =	"L. Henneberg"
-, title =	"Die graphische Statik der starren Systeme"
-, publisher =	"Leipzig"
-, year =	1911
-, update =	"97.11 bibrelex"
+, author =      "L. Henneberg"
+, title =       "Die graphische Statik der starren Systeme"
+, publisher =   "Leipzig"
+, year =        1911
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{h-unsgd-90
-, author =	"Andreas Henrich"
-, title =	"{Die} {Unterst{\"u}tzung} von {Nicht}-{Standardanfragen} in geometrischen {Datenbanksystemen} durch r{\"a}umliche {Zugriffsstrukturen}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	12
-, update =	"00.03 bibrelex"
+, author =      "Andreas Henrich"
+, title =       "{Die} {Unterst{\"u}tzung} von {Nicht}-{Standardanfragen} in geometrischen {Datenbanksystemen} durch r{\"a}umliche {Zugriffsstrukturen}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       12
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{h-ipmda-96
-, author =	"A. Henrich"
-, title =	"Improving the performance of multi-dimensional access structures based on $kd$-trees"
-, booktitle =	"Proc. 12th IEEE Intl. Conf. on Data Engineering"
-, year =	1996
-, pages =	"68--74"
-, update =	"97.07 agarwal"
+, author =      "A. Henrich"
+, title =       "Improving the performance of multi-dimensional access structures based on $kd$-trees"
+, booktitle =   "Proc. 12th IEEE Intl. Conf. on Data Engineering"
+, year =        1996
+, pages =       "68--74"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{hsw-ltsam-89
-, author =	"A. Henrich and H.-W. Six and P. Widmayer"
-, title =	"The {LSD} tree: {S}patial access to multidimensional point and non-point objects"
-, booktitle =	"Proc. 15th VLDB Conference"
-, year =	1989
-, pages =	"45--53"
-, update =	"97.07 agarwal"
+, author =      "A. Henrich and H.-W. Six and P. Widmayer"
+, title =       "The {LSD} tree: {S}patial access to multidimensional point and non-point objects"
+, booktitle =   "Proc. 15th VLDB Conference"
+, year =        1989
+, pages =       "45--53"
+, update =      "97.07 agarwal"
 }
 
 @book{h-acca-77
-, author =	"P. Henrici"
-, title =	"Applied and computational complex analysis"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1977
-, update =	"99.11 bibrelex, 97.11 bibrelex"
+, author =      "P. Henrici"
+, title =       "Applied and computational complex analysis"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1977
+, update =      "99.11 bibrelex, 97.11 bibrelex"
 }
 
 @techreport{hh-vlg-90
-, author =	"T. R. Henry and S. E. Hudson"
-, title =	"Viewing Large Graphs"
-, number =	"90-13"
-, institution =	"Department of Computer Science, University of Arizona"
-, year =	1990
-, keywords =	"graph drawing"
-, update =	"98.07 patrignani, 93.09 tamassia"
+, author =      "T. R. Henry and S. E. Hudson"
+, title =       "Viewing Large Graphs"
+, number =      "90-13"
+, institution = "Department of Computer Science, University of Arizona"
+, year =        1990
+, keywords =    "graph drawing"
+, update =      "98.07 patrignani, 93.09 tamassia"
 }
 
 @book{h-tdaz-08
-, author =	"K. Hensel"
-, title =	"Theorie der algebraischen {Zahlen}"
-, publisher =	"B. G. Teubner"
-, address =	"Leipzig"
-, year =	1908
-, update =	"99.11 bibrelex, 97.11 bibrelex"
+, author =      "K. Hensel"
+, title =       "Theorie der algebraischen {Zahlen}"
+, publisher =   "B. G. Teubner"
+, address =     "Leipzig"
+, year =        1908
+, update =      "99.11 bibrelex, 97.11 bibrelex"
 }
 
 @article{h-bevv-56
-, author =	"A. Heppes"
-, title =	"Beweis einer {Vermutung} von {A}. {V{\'a}zsonyi}"
-, journal =	"Acta Math. Acad. Sci. Hungar."
-, volume =	7
-, year =	1956
-, pages =	"463--466"
-, update =	"96.09 agarwal+devillers+orourke, 96.05 agarwal"
+, author =      "A. Heppes"
+, title =       "Beweis einer {Vermutung} von {A}. {V{\'a}zsonyi}"
+, journal =     "Acta Math. Acad. Sci. Hungar."
+, volume =      7
+, year =        1956
+, pages =       "463--466"
+, update =      "96.09 agarwal+devillers+orourke, 96.05 agarwal"
 }
 
 @article{h-fdd-64
-, author =	"A. Heppes"
-, title =	"Filling a domain by discs"
-, journal =	"Periodica Mathematica Hungarica"
-, volume =	8
-, year =	1964
-, pages =	"363--371"
-, update =	"96.05 pocchiola"
+, author =      "A. Heppes"
+, title =       "Filling a domain by discs"
+, journal =     "Periodica Mathematica Hungarica"
+, volume =      8
+, year =        1964
+, pages =       "363--371"
+, update =      "96.05 pocchiola"
 }
 
 @article{h-scpep-92
-, author =	"A. Heppes"
-, title =	"Solid circle-packings in the {Euclidean} plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"29--43"
+, author =      "A. Heppes"
+, title =       "Solid circle-packings in the {Euclidean} plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "29--43"
 }
 
 @article{hjt-tdrgo-95
-, author =	"M. J. Herbert and C. B. Jones and D. S. Tudhope"
-, title =	"Three-dimensional Reconstruction of Geoscientific Objects from Serial Sections"
-, journal =	"Visual Comput."
-, volume =	11
-, number =	7
-, year =	1995
-, pages =	"343--359"
-, update =	"96.01 held"
+, author =      "M. J. Herbert and C. B. Jones and D. S. Tudhope"
+, title =       "Three-dimensional Reconstruction of Geoscientific Objects from Serial Sections"
+, journal =     "Visual Comput."
+, volume =      11
+, number =      7
+, year =        1995
+, pages =       "343--359"
+, update =      "96.01 held"
 }
 
 @article{h-hmhat-80
-, author =	"D. Herbison-Evans"
-, title =	"How to merge hidden arcs and then not draw them"
-, journal =	"Computers and Graphics"
-, volume =	5
-, year =	1980
-, pages =	"79--81"
+, author =      "D. Herbison-Evans"
+, title =       "How to merge hidden arcs and then not draw them"
+, journal =     "Computers and Graphics"
+, volume =      5
+, year =        1980
+, pages =       "79--81"
 }
 
 @book{h-irpfc-80
-, author =	"G. T. Herman"
-, title =	"Image Reconstruction from Projections: the Fundamentals of Computerized Tomography"
-, publisher =	"Academic Press"
-, address =	"New York"
-, year =	1980
-, update =	"98.11 bibrelex"
+, author =      "G. T. Herman"
+, title =       "Image Reconstruction from Projections: the Fundamentals of Computerized Tomography"
+, publisher =   "Academic Press"
+, address =     "New York"
+, year =        1980
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{h-sict-83
-, author =	"G. T. Herman"
-, title =	"The special issue on computerized tomography"
-, booktitle =	"Proc. IEEE"
-, volume =	71
-, year =	1983
-, pages =	"291--292"
-, update =	"98.11 bibrelex"
+, author =      "G. T. Herman"
+, title =       "The special issue on computerized tomography"
+, booktitle =   "Proc. IEEE"
+, volume =      71
+, year =        1983
+, pages =       "291--292"
+, update =      "98.11 bibrelex"
 }
 
 @book{hm-im-77
-, author =	"R. Hermann and C. Martin"
-, title =	"Interdisciplinary Mathematics"
-, volume =	13
-, publisher =	"Math. Sci. Press"
-, year =	1977
-, update =	"98.03 bibrelex"
+, author =      "R. Hermann and C. Martin"
+, title =       "Interdisciplinary Mathematics"
+, volume =      13
+, publisher =   "Math. Sci. Press"
+, year =        1977
+, update =      "98.03 bibrelex"
 }
 
 @article{h-tadpe-82
-, author =	"F. Hermeline"
-, title =	"Triangulation automatique d'un poly{\`e}dre en dimension {$N$}"
-, journal =	"RAIRO-Mathematical Modelling And Numerical Analysis-Modelisation Mathematique Et Analyse Numerique"
-, volume =	16
-, number =	3
-, year =	1982
-, pages =	"211--242"
-, update =	"93.09 rote"
-, annote =	"Incremental algorithm for NDVD."
+, author =      "F. Hermeline"
+, title =       "Triangulation automatique d'un poly{\`e}dre en dimension {$N$}"
+, journal =     "RAIRO-Mathematical Modelling And Numerical Analysis-Modelisation Mathematique Et Analyse Numerique"
+, volume =      16
+, number =      3
+, year =        1982
+, pages =       "211--242"
+, update =      "93.09 rote"
+, annote =      "Incremental algorithm for NDVD."
 }
 
 @inproceedings{b-foais-96
-, author =	"A. {Hern{\'a}ndez Barrera}"
-, title =	"Finding an {$o(n^2 \log n)$} algorithm is sometimes hard"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"289--294"
-, update =	"96.09 mitchell"
+, author =      "A. {Hern{\'a}ndez Barrera}"
+, title =       "Finding an {$o(n^2 \log n)$} algorithm is sometimes hard"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "289--294"
+, update =      "96.09 mitchell"
 }
 
 @inproceedings{hna-mscpp-99
-, author =	"Antonio Hern{\'a}ndez-Barrera and Subhas Chandra Nandy and Tetsuo Asano"
-, title =	"The {Minkowski} Sum of a Convex Polyhedron and a Polyhedral Terrain"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"135--136"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Antonio Hern{\'a}ndez-Barrera and Subhas Chandra Nandy and Tetsuo Asano"
+, title =       "The {Minkowski} Sum of a Convex Polyhedron and a Polyhedral Terrain"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "135--136"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{h-cg-94
-, author =	"Gregorio Hern{\'a}ndez-Pe{\~n}alver"
-, title =	"Controlling Guards"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"387--392"
-, succeeds =	"h-cg-94c"
-, cites =	"c-ctpg-75, lhl-mcgpk-93, o-agta-87, o-gnfmg-83, s-rrag-92, s-hpp-89, ZZZ"
-, update =	"00.11 smid, 00.07 icking, 98.11 bibrelex, 94.09 jones"
+, author =      "Gregorio Hern{\'a}ndez-Pe{\~n}alver"
+, title =       "Controlling Guards"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "387--392"
+, succeeds =    "h-cg-94c"
+, cites =       "c-ctpg-75, lhl-mcgpk-93, o-agta-87, o-gnfmg-83, s-rrag-92, s-hpp-89, ZZZ"
+, update =      "00.11 smid, 00.07 icking, 98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{h-cg-94c
-, author =	"Gregorio Hern{\'a}ndez-Pe{\~n}alver"
-, title =	"Controlling Guards"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"68--71"
-, precedes =	"h-cg-94"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Gregorio Hern{\'a}ndez-Pe{\~n}alver"
+, title =       "Controlling Guards"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "68--71"
+, precedes =    "h-cg-94"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{hhmmn-gtg-97
-, author =	"C. Hernando and F. Hurtado and A. Marquez and M. Mora and M. Noy"
-, title =	"Geometric Tree Graphs"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"28--29"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "C. Hernando and F. Hurtado and A. Marquez and M. Mora and M. Noy"
+, title =       "Geometric Tree Graphs"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "28--29"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{hhn-gncm-99
-, author =	"Maria del Carmen Hernando and Ferran Hurtado and Marc Noy"
-, title =	"Graphs of Non-Crossing Matchings"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"97--99"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Maria del Carmen Hernando and Ferran Hurtado and Marc Noy"
+, title =       "Graphs of Non-Crossing Matchings"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "97--99"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{h-fatcd-93
-, author =	"J. Hershberger"
-, title =	"A faster algorithm for the two-center decision problem"
-, journal =	"Inform. Process. Lett."
-, volume =	47
-, year =	1993
-, pages =	"23--29"
-, update =	"96.05 agarwal"
+, author =      "J. Hershberger"
+, title =       "A faster algorithm for the two-center decision problem"
+, journal =     "Inform. Process. Lett."
+, volume =      47
+, year =        1993
+, pages =       "23--29"
+, update =      "96.05 agarwal"
 }
 
 @article{h-ndssp-91
-, author =	"J. Hershberger"
-, title =	"A new data structure for shortest path queries in a simple polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	38
-, year =	1991
-, pages =	"231--235"
+, author =      "J. Hershberger"
+, title =       "A new data structure for shortest path queries in a simple polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      38
+, year =        1991
+, pages =       "231--235"
 }
 
 @article{h-ovgat-89
-, author =	"J. Hershberger"
-, title =	"An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"141--155"
-, succeeds =	"h-fvgsp-87"
-, update =	"01.04 icking, 97.11 bibrelex"
+, author =      "J. Hershberger"
+, title =       "An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "141--155"
+, succeeds =    "h-fvgsp-87"
+, update =      "01.04 icking, 97.11 bibrelex"
 }
 
 @inproceedings{h-cmsp-93
-, author =	"J. Hershberger"
-, title =	"Compliant motion in a simple polygon"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"397--398"
-, keywords =	"video review"
-, cites =	"b-zsaa-91, bh-csaa-92, fhs-cmsp-89, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "J. Hershberger"
+, title =       "Compliant motion in a simple polygon"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "397--398"
+, keywords =    "video review"
+, cites =       "b-zsaa-91, bh-csaa-92, fhs-cmsp-89, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{h-fuenl-89
-, author =	"J. Hershberger"
-, title =	"Finding the upper envelope of $n$ line segments in {$O(n\log n)$} time"
-, journal =	"Inform. Process. Lett."
-, volume =	33
-, year =	1989
-, pages =	"169--174"
-, update =	"93.05 devillers"
+, author =      "J. Hershberger"
+, title =       "Finding the upper envelope of $n$ line segments in {$O(n\log n)$} time"
+, journal =     "Inform. Process. Lett."
+, volume =      33
+, year =        1989
+, pages =       "169--174"
+, update =      "93.05 devillers"
 }
 
 @inproceedings{h-fvgsp-87
-, author =	"J. Hershberger"
-, title =	"Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"11--20"
-, precedes =	"h-ovgat-89"
-, cites =	"aaghi-vdp-86, b-prcv-75, cg-vippg-85, ci-tsc-84, gjpt-tsp-78, ghlst-ltavs-86, gmpr-nrll-77, gs-pmgsc-85, hm-ftsp-83, hm-ndsrs-82, tv-otats-86, a-jschc-87, ZZZ"
-, update =	"01.04 icking, 98.03 bibrelex"
+, author =      "J. Hershberger"
+, title =       "Finding the Visibility Graph of a Simple Polygon in Time Proportional to its Size"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "11--20"
+, precedes =    "h-ovgat-89"
+, cites =       "aaghi-vdp-86, b-prcv-75, cg-vippg-85, ci-tsc-84, gjpt-tsp-78, ghlst-ltavs-86, gmpr-nrll-77, gs-pmgsc-85, hm-ftsp-83, hm-ndsrs-82, tv-otats-86, a-jschc-87, ZZZ"
+, update =      "01.04 icking, 98.03 bibrelex"
 }
 
 @inproceedings{h-msde-91
-, author =	"J. Hershberger"
-, title =	"Minimizing the sum of diameters efficiently"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"62--65"
-, precedes =	"h-msde-92"
-, cites =	"agss-ltacv-89, abky-cabmm-88, ds-dcmdf-89, e-acg-87, egs-oplms-86, gt-ltasc-85, gj-cigtn-79, hs-ftp-89, j-nccog-82, k-osps-83, ms-cscgl-84, ms-ppgmm-91, ps-cgi-85, rw-gc-89, s-wcaso-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "J. Hershberger"
+, title =       "Minimizing the sum of diameters efficiently"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "62--65"
+, precedes =    "h-msde-92"
+, cites =       "agss-ltacv-89, abky-cabmm-88, ds-dcmdf-89, e-acg-87, egs-oplms-86, gt-ltasc-85, gj-cigtn-79, hs-ftp-89, j-nccog-82, k-osps-83, ms-cscgl-84, ms-ppgmm-91, ps-cgi-85, rw-gc-89, s-wcaso-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{h-msde-92
-, author =	"J. Hershberger"
-, title =	"Minimizing the sum of diameters efficiently"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	2
-, year =	1992
-, pages =	"111--118"
-, succeeds =	"h-msde-91"
+, author =      "J. Hershberger"
+, title =       "Minimizing the sum of diameters efficiently"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      2
+, year =        1992
+, pages =       "111--118"
+, succeeds =    "h-msde-91"
 }
 
 @inproceedings{h-opats-92
-, author =	"J. Hershberger"
-, title =	"Optimal parallel algorithms for triangulated simple polygons"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"33--42"
-, precedes =	"h-opats-95"
-, cites =	"acg-cdctd-89, acw-opavs-91, ag-pasft-86, at-oadvp-81, bt-ladts-86, cgmrs-namlp-90, c-tpca-82, c-tsplt-91a, cegghss-rspug-91, cg-vippg-89, cg-fc1ds-86, cct-rpatd-91, c-pms-88, cv-acdto-88, dk-fdpi-82, gsg-pmvsp-90, g-pcief-91, gh-ospqs-89, ghlst-ltavs-87, ghs-citds-91, h-ndssp-91, hs-cmlpg-91, krs-ppp-85, lp-esppr-84, ps-rgpcr-85, ps-cgi-85, rr-ostrp-89, sv-flcas-88, s-sfira-90, sv-fmmsp-81, s-cgfns-89, tv-opatc-89, tv-epba-85, ZZZ"
-, update =	"97.11 bibrelex, 96.09 devillers"
+, author =      "J. Hershberger"
+, title =       "Optimal parallel algorithms for triangulated simple polygons"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "33--42"
+, precedes =    "h-opats-95"
+, cites =       "acg-cdctd-89, acw-opavs-91, ag-pasft-86, at-oadvp-81, bt-ladts-86, cgmrs-namlp-90, c-tpca-82, c-tsplt-91a, cegghss-rspug-91, cg-vippg-89, cg-fc1ds-86, cct-rpatd-91, c-pms-88, cv-acdto-88, dk-fdpi-82, gsg-pmvsp-90, g-pcief-91, gh-ospqs-89, ghlst-ltavs-87, ghs-citds-91, h-ndssp-91, hs-cmlpg-91, krs-ppp-85, lp-esppr-84, ps-rgpcr-85, ps-cgi-85, rr-ostrp-89, sv-flcas-88, s-sfira-90, sv-fmmsp-81, s-cgfns-89, tv-opatc-89, tv-epba-85, ZZZ"
+, update =      "97.11 bibrelex, 96.09 devillers"
 }
 
 @article{h-opats-95
-, author =	"J. Hershberger"
-, title =	"Optimal parallel algorithms for triangulated simple polygons"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"145--170"
-, keywords =	"parallel algorithms, simple polygons, shortest paths, shortest path queries, shortest path trees, ray shooting, relative convex hull"
-, succeeds =	"h-opats-92"
-, update =	"96.09 devillers"
+, author =      "J. Hershberger"
+, title =       "Optimal parallel algorithms for triangulated simple polygons"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "145--170"
+, keywords =    "parallel algorithms, simple polygons, shortest paths, shortest path queries, shortest path trees, ray shooting, relative convex hull"
+, succeeds =    "h-opats-92"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{h-ueop-90
-, author =	"J. Hershberger"
-, title =	"Upper envelope onion peeling"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"368--379"
-, precedes =	"h-ueop-92"
+, author =      "J. Hershberger"
+, title =       "Upper envelope onion peeling"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "368--379"
+, precedes =    "h-ueop-92"
 }
 
 @article{h-ueop-92
-, author =	"J. Hershberger"
-, title =	"Upper envelope onion peeling"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	2
-, year =	1992
-, pages =	"93--110"
-, succeeds =	"h-ueop-90"
+, author =      "J. Hershberger"
+, title =       "Upper envelope onion peeling"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      2
+, year =        1992
+, pages =       "93--110"
+, succeeds =    "h-ueop-90"
 }
 
 @article{hg-ospan-88
-, author =	"J. Hershberger and Leonidas J. Guibas"
-, title =	"An {$O(n^{2})$} shortest path algorithm for a non-rotating convex body"
-, journal =	"J. Algorithms"
-, volume =	9
-, year =	1988
-, pages =	"18--46"
-, update =	"98.03 mitchell"
+, author =      "J. Hershberger and Leonidas J. Guibas"
+, title =       "An {$O(n^{2})$} shortest path algorithm for a non-rotating convex body"
+, journal =     "J. Algorithms"
+, volume =      9
+, year =        1988
+, pages =       "18--46"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{hrs-fd2ec-92
-, author =	"J. Hershberger and M. Rauch and Subhash Suri"
-, title =	"Fully dynamic $2$-edge-connectivity in planar graphs"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"233--244"
-, update =	"98.03 mitchell"
+, author =      "J. Hershberger and M. Rauch and Subhash Suri"
+, title =       "Fully dynamic $2$-edge-connectivity in planar graphs"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "233--244"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{hs-eszp-94
-, author =	"J. Hershberger and J. Snoeyink"
-, title =	"An Efficient Solution to the Zookeeper's Problem"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"104--109"
-, cites =	"cn-ozkr-89, gh-ospqs-89, h-ndssp-91, hs-cmlpg-91, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "J. Hershberger and J. Snoeyink"
+, title =       "An Efficient Solution to the Zookeeper's Problem"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "104--109"
+, cites =       "cn-ozkr-89, gh-ospqs-89, h-ndssp-91, hs-cmlpg-91, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{hs-oidpa-94
-, author =	"J. Hershberger and J. Snoeyink"
-, title =	"An ${O}(n \log n)$ Implementation of the {Douglas}-{Peucker} Algorithm for Line Simplification"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"383--384"
-, keywords =	"video review"
-, cites =	"b-tcl-85, dghs-eafcr-93, dp-arnpr-73, hs-sudpl-92, m-samml-86, m-alg-87, m-olcch-87, r-ippap-, r-qcsaa-90, w-algau-85, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones"
+, author =      "J. Hershberger and J. Snoeyink"
+, title =       "An ${O}(n \log n)$ Implementation of the {Douglas}-{Peucker} Algorithm for Line Simplification"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "383--384"
+, keywords =    "video review"
+, cites =       "b-tcl-85, dghs-eafcr-93, dp-arnpr-73, hs-sudpl-92, m-samml-86, m-alg-87, m-olcch-87, r-ippap-, r-qcsaa-90, w-algau-85, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones"
 }
 
 @inproceedings{hs-aacsl-91
-, author =	"J. Hershberger and J. Snoeyink"
-, title =	"Around and around: computing the shortest loop"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"157--161"
-, cites =	"hs-cmphc-90, bt-ladts-86, c-tpca-82, ceersstu-akp-91, ghlst-ltavs-87, lp-esppr-84, t-stsps-89, t-mss-85, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "J. Hershberger and J. Snoeyink"
+, title =       "Around and around: computing the shortest loop"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "157--161"
+, cites =       "hs-cmphc-90, bt-ladts-86, c-tpca-82, ceersstu-akp-91, ghlst-ltavs-87, lp-esppr-84, t-stsps-89, t-mss-85, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{hs-cmphc-90
-, author =	"J. Hershberger and J. Snoeyink"
-, title =	"Computing minimum length paths of a given homotopy class"
-, type =	"Technical Report"
-, number =	"RUU-CS-90-37"
-, institution =	"Utrecht University, Department of Computer Science"
-, month =	dec
-, year =	1990
-, precedes =	"hs-cmlpg-91, hs-cmlpg-94"
-, update =	"98.07 bibrelex"
+, author =      "J. Hershberger and J. Snoeyink"
+, title =       "Computing minimum length paths of a given homotopy class"
+, type =        "Technical Report"
+, number =      "RUU-CS-90-37"
+, institution = "Utrecht University, Department of Computer Science"
+, month =       dec
+, year =        1990
+, precedes =    "hs-cmlpg-91, hs-cmlpg-94"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{hs-cmlpg-91
-, author =	"J. Hershberger and J. Snoeyink"
-, title =	"Computing minimum length paths of a given homotopy class"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"331--342"
-, keywords =	"path planning, topology"
-, succeeds =	"hs-cmphc-90"
-, update =	"98.07 bibrelex"
+, author =      "J. Hershberger and J. Snoeyink"
+, title =       "Computing minimum length paths of a given homotopy class"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "331--342"
+, keywords =    "path planning, topology"
+, succeeds =    "hs-cmphc-90"
+, update =      "98.07 bibrelex"
 }
 
 @article{hs-cmlpg-94
-, author =	"J. Hershberger and J. Snoeyink"
-, title =	"Computing minimum length paths of a given homotopy class"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"63--98"
-, succeeds =	"hs-cmphc-90"
-, update =	"98.07 bibrelex, 95.01 devillers"
+, author =      "J. Hershberger and J. Snoeyink"
+, title =       "Computing minimum length paths of a given homotopy class"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "63--98"
+, succeeds =    "hs-cmphc-90"
+, update =      "98.07 bibrelex, 95.01 devillers"
 }
 
 @inproceedings{hs-cpmfl-92
-, author =	"J. Hershberger and J. Snoeyink"
-, title =	"Convex polygons made from few lines and convex decompositions of polyhedra"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"376--387"
+, author =      "J. Hershberger and J. Snoeyink"
+, title =       "Convex polygons made from few lines and convex decompositions of polyhedra"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "376--387"
 }
 
 @inproceedings{hs-sudpl-92
-, author =	"J. Hershberger and J. Snoeyink"
-, title =	"Speeding up the {Douglas-Peucker} line simplification algorithm"
-, booktitle =	"Proc. 5th Internat. Sympos. Spatial Data Handling"
-, year =	1992
-, pages =	"134--143"
-, update =	"97.11 bibrelex"
+, author =      "J. Hershberger and J. Snoeyink"
+, title =       "Speeding up the {Douglas-Peucker} line simplification algorithm"
+, booktitle =   "Proc. 5th Internat. Sympos. Spatial Data Handling"
+, year =        1992
+, pages =       "134--143"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{hs-parss-93
-, author =	"J. Hershberger and Subhash Suri"
-, title =	"A Pedestrian Approach to Ray Shooting: {Shoot} a Ray, Take a Walk"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, month =	jan
-, year =	1993
-, pages =	"54--63"
-, precedes =	"hs-parss-95"
-, update =	"98.11 bibrelex, 98.03 mitchell, 96.05 mitchell, 93.05 smid"
+, author =      "J. Hershberger and Subhash Suri"
+, title =       "A Pedestrian Approach to Ray Shooting: {Shoot} a Ray, Take a Walk"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, month =       jan
+, year =        1993
+, pages =       "54--63"
+, precedes =    "hs-parss-95"
+, update =      "98.11 bibrelex, 98.03 mitchell, 96.05 mitchell, 93.05 smid"
 }
 
 @article{hs-parss-95
-, author =	"J. Hershberger and Subhash Suri"
-, title =	"A Pedestrian Approach to Ray Shooting: {Shoot} a Ray, Take a Walk"
-, journal =	"J. Algorithms"
-, volume =	18
-, year =	1995
-, pages =	"403--431"
-, keywords =	"mesh generation, triangulation, stabbing number"
-, succeeds =	"hs-parss-93"
-, update =	"98.03 mitchell, 96.05 mitchell+pocchiola"
-, annote =	"Special issue of selected papers from the
+, author =      "J. Hershberger and Subhash Suri"
+, title =       "A Pedestrian Approach to Ray Shooting: {Shoot} a Ray, Take a Walk"
+, journal =     "J. Algorithms"
+, volume =      18
+, year =        1995
+, pages =       "403--431"
+, keywords =    "mesh generation, triangulation, stabbing number"
+, succeeds =    "hs-parss-93"
+, update =      "98.03 mitchell, 96.05 mitchell+pocchiola"
+, annote =      "Special issue of selected papers from the
 4th Symposium on Discrete Algorithms."
 }
 
 @article{hs-oaesp-??
-, author =	"John Hershberger and Subhash Suri"
-, title =	"An optimal algorithm for {Euclidean} shortest paths in the plane"
-, journal =	"SIAM J. Comput."
-, volume =	"??"
-, year =	"??"
-, pages =	"To appear"
-, succeeds =	"hs-oaesp-95,hs-ecesp-93"
-, update =	"98.03 mitchell"
+, author =      "John Hershberger and Subhash Suri"
+, title =       "An optimal algorithm for {Euclidean} shortest paths in the plane"
+, journal =     "SIAM J. Comput."
+, volume =      "??"
+, year =        "??"
+, pages =       "To appear"
+, succeeds =    "hs-oaesp-95,hs-ecesp-93"
+, update =      "98.03 mitchell"
 }
 
 @techreport{hs-oaesp-95
-, author =	"John Hershberger and Subhash Suri"
-, title =	"An optimal algorithm for {Euclidean} shortest paths in the plane"
-, type =	"Manuscript"
-, institution =	"Washington University"
-, year =	1995
-, succeeds =	"hs-ecesp-93"
-, update =	"97.03 smid, 96.05 mitchell"
+, author =      "John Hershberger and Subhash Suri"
+, title =       "An optimal algorithm for {Euclidean} shortest paths in the plane"
+, type =        "Manuscript"
+, institution = "Washington University"
+, year =        1995
+, succeeds =    "hs-ecesp-93"
+, update =      "97.03 smid, 96.05 mitchell"
 }
 
 @article{hs-oaesp-99
-, author =	"John Hershberger and Subhash Suri"
-, title =	"An optimal algorithm for {Euclidean} shortest paths in the plane"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, number =	6
-, year =	1999
-, pages =	"2215--2256"
-, update =	"01.07 orourke"
+, author =      "John Hershberger and Subhash Suri"
+, title =       "An optimal algorithm for {Euclidean} shortest paths in the plane"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, number =      6
+, year =        1999
+, pages =       "2215--2256"
+, update =      "01.07 orourke"
 }
 
 @inproceedings{hs-asdch-90
-, author =	"J. Hershberger and Subhash Suri"
-, title =	"Applications of a semi-dynamic convex hull algorithm"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"380--392"
-, update =	"98.03 mitchell"
+, author =      "J. Hershberger and Subhash Suri"
+, title =       "Applications of a semi-dynamic convex hull algorithm"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "380--392"
+, update =      "98.03 mitchell"
 }
 
 @article{hs-asdch-92
-, author =	"J. Hershberger and S. Suri"
-, title =	"Applications of a semi-dynamic convex hull algorithm"
-, journal =	"BIT"
-, volume =	32
-, year =	1992
-, pages =	"249--267"
-, update =	"98.03 bibrelex"
+, author =      "J. Hershberger and S. Suri"
+, title =       "Applications of a semi-dynamic convex hull algorithm"
+, journal =     "BIT"
+, volume =      32
+, year =        1992
+, pages =       "249--267"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{hs-ebrpc-97
-, author =	"J. Hershberger and S. Suri"
-, title =	"Efficient Breakout Routing in Printed Circuit Boards"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"460--462"
-, cites =	"cc-eafdp-97, clr-ia-90, dks-rrbs-91, m-slwrc-90, rbk-earvw-90, t-dsna-83, yd-slfrr-95, ydd-iprap-96, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "J. Hershberger and S. Suri"
+, title =       "Efficient Breakout Routing in Printed Circuit Boards"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "460--462"
+, cites =       "cc-eafdp-97, clr-ia-90, dks-rrbs-91, m-slwrc-90, rbk-earvw-90, t-dsna-83, yd-slfrr-95, ydd-iprap-96, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @inproceedings{hs-ecesp-93
-, author =	"John Hershberger and Subhash Suri"
-, title =	"Efficient Computation of {Euclidean} Shortest Paths in the Plane"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"508--517"
-, precedes =	"hs-oaesp-95"
-, update =	"98.07 bibrelex, 97.11 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "John Hershberger and Subhash Suri"
+, title =       "Efficient Computation of {Euclidean} Shortest Paths in the Plane"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "508--517"
+, precedes =    "hs-oaesp-95"
+, update =      "98.07 bibrelex, 97.11 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{hs-fsdsp-97
-, author =	"John Hershberger and Subhash Suri"
-, title =	"Finding a shortest diagonal of a simple polygon in linear time"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"149--160"
-, update =	"97.03 devillers"
+, author =      "John Hershberger and Subhash Suri"
+, title =       "Finding a shortest diagonal of a simple polygon in linear time"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "149--160"
+, update =      "97.03 devillers"
 }
 
 @inproceedings{hs-ftp-89
-, author =	"J. Hershberger and Subhash Suri"
-, title =	"Finding tailored partitions"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"255--265"
-, precedes =	"hs-ftp-91"
-, cites =	"abky-cabmm-88, a-dp-86, c-clps-85, j-nccog-82, ms-cscgl-84, ms-ppgmm-91, ol-mcp-81, ph-chfsp-77, ps-cgi-85, yb-cf-61, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "J. Hershberger and Subhash Suri"
+, title =       "Finding tailored partitions"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "255--265"
+, precedes =    "hs-ftp-91"
+, cites =       "abky-cabmm-88, a-dp-86, c-clps-85, j-nccog-82, ms-cscgl-84, ms-ppgmm-91, ol-mcp-81, ph-chfsp-77, ps-cgi-85, yb-cf-61, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{hs-ftp-91
-, author =	"J. Hershberger and Subhash Suri"
-, title =	"Finding tailored partitions"
-, journal =	"J. Algorithms"
-, volume =	12
-, year =	1991
-, pages =	"431--463"
-, succeeds =	"hs-ftp-89"
-, update =	"98.03 mitchell"
+, author =      "J. Hershberger and Subhash Suri"
+, title =       "Finding tailored partitions"
+, journal =     "J. Algorithms"
+, volume =      12
+, year =        1991
+, pages =       "431--463"
+, succeeds =    "hs-ftp-89"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{hs-msspm-93
-, author =	"J. Hershberger and Subhash Suri"
-, title =	"Matrix Searching with the Shortest Path Metric"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '93"
-, year =	1993
-, pages =	"485--494"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 93.09 milone+mitchell"
+, author =      "J. Hershberger and Subhash Suri"
+, title =       "Matrix Searching with the Shortest Path Metric"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '93"
+, year =        1993
+, pages =       "485--494"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.03 agarwal, 93.09 milone+mitchell"
 }
 
 @article{hs-msspm-97
-, author =	"J. Hershberger and Subhash Suri"
-, title =	"Matrix Searching with the Shortest Path Metric"
-, journal =	"SIAM J. Comput."
-, volume =	26
-, number =	6
-, month =	dec
-, year =	1997
-, pages =	"1612--1634"
-, succeeds =	"hs-msspm-93"
-, update =	"98.03 mitchell+smid"
+, author =      "J. Hershberger and Subhash Suri"
+, title =       "Matrix Searching with the Shortest Path Metric"
+, journal =     "SIAM J. Comput."
+, volume =      26
+, number =      6
+, month =       dec
+, year =        1997
+, pages =       "1612--1634"
+, succeeds =    "hs-msspm-93"
+, update =      "98.03 mitchell+smid"
 }
 
 @inproceedings{hs-mbt-95
-, author =	"John Hershberger and Subhash Suri"
-, title =	"Morphing Binary Trees"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"396--404"
-, keywords =	"shape morphing, rotation distance, tree morphing"
-, update =	"96.09 agarwal, 96.05 mitchell"
+, author =      "John Hershberger and Subhash Suri"
+, title =       "Morphing Binary Trees"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "396--404"
+, keywords =    "shape morphing, rotation distance, tree morphing"
+, update =      "96.09 agarwal, 96.05 mitchell"
 }
 
 @article{hs-olmpc-96
-, author =	"J. Hershberger and Subhash Suri"
-, title =	"Off-Line maintenance of planar configurations"
-, journal =	"J. Algorithms"
-, volume =	21
-, year =	1996
-, pages =	"453--475"
-, keywords =	"dynamic convex hull"
-, succeeds =	"hs-ompc-91"
-, update =	"98.03 mitchell, 97.11 bibrelex, 97.03 smid"
+, author =      "J. Hershberger and Subhash Suri"
+, title =       "Off-Line maintenance of planar configurations"
+, journal =     "J. Algorithms"
+, volume =      21
+, year =        1996
+, pages =       "453--475"
+, keywords =    "dynamic convex hull"
+, succeeds =    "hs-ompc-91"
+, update =      "98.03 mitchell, 97.11 bibrelex, 97.03 smid"
 }
 
 @inproceedings{hs-ompc-91
-, author =	"J. Hershberger and Subhash Suri"
-, title =	"Offline maintenance of planar configurations"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"32--41"
-, keywords =	"dynamic convex hull"
-, update =	"98.03 mitchell"
-, annote =	"$O(\log n)$ amortized time per operation"
+, author =      "J. Hershberger and Subhash Suri"
+, title =       "Offline maintenance of planar configurations"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "32--41"
+, keywords =    "dynamic convex hull"
+, update =      "98.03 mitchell"
+, annote =      "$O(\log n)$ amortized time per operation"
 }
 
 @inproceedings{hs-pmasp-95
-, author =	"John Hershberger and Subhash Suri"
-, title =	"Practical Methods for Approximating Shortest Paths on a Convex Polytope in {$\Re^3$}"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"447--456"
-, keywords =	"geodesic paths, shortest paths, approximation algorithm"
-, precedes =	"hs-pmasp-98"
-, update =	"98.03 mitchell, 96.09 agarwal, 96.05 mitchell"
+, author =      "John Hershberger and Subhash Suri"
+, title =       "Practical Methods for Approximating Shortest Paths on a Convex Polytope in {$\Re^3$}"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "447--456"
+, keywords =    "geodesic paths, shortest paths, approximation algorithm"
+, precedes =    "hs-pmasp-98"
+, update =      "98.03 mitchell, 96.09 agarwal, 96.05 mitchell"
 }
 
 @article{hs-pmasp-98
-, author =	"John Hershberger and Subhash Suri"
-, title =	"Practical Methods for Approximating Shortest Paths on a Convex Polytope in {$\Re^3$}"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, number =	1
-, year =	1998
-, pages =	"31--46"
-, succeeds =	"hs-pmasp-95"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "John Hershberger and Subhash Suri"
+, title =       "Practical Methods for Approximating Shortest Paths on a Convex Polytope in {$\Re^3$}"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, number =      1
+, year =        1998
+, pages =       "31--46"
+, succeeds =    "hs-pmasp-95"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @techreport{hs-spp-96
-, author =	"John Hershberger and Subhash Suri"
-, title =	"Shortest path problems"
-, type =	"Technical {Report}"
-, institution =	"Washington University"
-, year =	1996
-, update =	"00.03 smid, 96.05 mitchell"
+, author =      "John Hershberger and Subhash Suri"
+, title =       "Shortest path problems"
+, type =        "Technical {Report}"
+, institution = "Washington University"
+, year =        1996
+, update =      "00.03 smid, 96.05 mitchell"
 }
 
 @phdthesis{h-easpv-87
-, author =	"J. E. Hershberger"
-, title =	"Efficient algorithms for shortest path and visibility problems"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1987
-, note =	"Report STAN-CS-87-1163"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "J. E. Hershberger"
+, title =       "Efficient algorithms for shortest path and visibility problems"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1987
+, note =        "Report STAN-CS-87-1163"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @article{hs-ealcd-98
-, author =	"J. E. Hershberger and J. S. Snoeyink"
-, title =	"Erased arrangements of lines and convex decompositions of polyhedra"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, year =	1998
-, pages =	"129--143"
-, update =	"98.03 agarwal+smid"
+, author =      "J. E. Hershberger and J. S. Snoeyink"
+, title =       "Erased arrangements of lines and convex decompositions of polyhedra"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, year =        1998
+, pages =       "129--143"
+, update =      "98.03 agarwal+smid"
 }
 
 @inproceedings{h-cap-01
-, author =	"Susan Hert"
-, title =	"Connected Area Partitioning"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"35--38"
-, update =	"01.04 icking"
+, author =      "Susan Hert"
+, title =       "Connected Area Partitioning"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "35--38"
+, update =      "01.04 icking"
 }
 
 @inproceedings{hhkps-aegk-01
-, author =	"Susan Hert and Michael Hoffmann and Lutz Kettner and Sylvain Pion and Michael Seel"
-, title =	"An Adaptable and Extensible Geometry Kernel"
-, booktitle =	"Proc. Workshop on Algorithm Engineering"
-, nickname =	"WAE '01"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	2141
-, publisher =	"Springer-Verlag"
-, year =	2001
-, pages =	"79--90"
-, update =	"02.03 devillers"
+, author =      "Susan Hert and Michael Hoffmann and Lutz Kettner and Sylvain Pion and Michael Seel"
+, title =       "An Adaptable and Extensible Geometry Kernel"
+, booktitle =   "Proc. Workshop on Algorithm Engineering"
+, nickname =    "WAE '01"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      2141
+, publisher =   "Springer-Verlag"
+, year =        2001
+, pages =       "79--90"
+, update =      "02.03 devillers"
 }
 
 @inproceedings{hl-dcptr-96
-, author =	"S. Hert and V. Lumelsky"
-, title =	"Deforming curves in the plane for tethered-robot motion planning"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"125--130"
-, update =	"96.09 mitchell"
+, author =      "S. Hert and V. Lumelsky"
+, title =       "Deforming curves in the plane for tethered-robot motion planning"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "125--130"
+, update =      "96.09 mitchell"
 }
 
 @article{hl-pcrtr-97
-, author =	"S. Hert and V. Lumelsky"
-, title =	"Planar curve routing for tethered-robot motion planning"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"225--252"
-, update =	"97.07 devillers"
+, author =      "S. Hert and V. Lumelsky"
+, title =       "Planar curve routing for tethered-robot motion planning"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "225--252"
+, update =      "97.07 devillers"
 }
 
 @article{hl-padmr-98
-, author =	"S. Hert and V. Lumelsky"
-, title =	"Polygon Area Decomposition for Multiple-Robot Workspace Division"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"437--466"
-, update =	"98.11 devillers"
+, author =      "S. Hert and V. Lumelsky"
+, title =       "Polygon Area Decomposition for Multiple-Robot Workspace Division"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "437--466"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{h-eappk-90
-, author =	"E. Hertel"
-, title =	"{Einige} algorithmische {Probleme} in {Polyeder-} und {Konvexgeometrie}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	13
-, update =	"00.03 bibrelex"
+, author =      "E. Hertel"
+, title =       "{Einige} algorithmische {Probleme} in {Polyeder-} und {Konvexgeometrie}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       13
+, update =      "00.03 bibrelex"
 }
 
 @techreport{h-atcha-83
-, author =	"S. Hertel"
-, title =	"An almost trivial convex hull algorithm for a presorted point set in the plane"
-, type =	"Report"
-, number =	"A83/08"
-, institution =	"Fachber. Inform., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1983
+, author =      "S. Hertel"
+, title =       "An almost trivial convex hull algorithm for a presorted point set in the plane"
+, type =        "Report"
+, number =      "A83/08"
+, institution = "Fachber. Inform., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1983
 }
 
 @techreport{h-safpu-84
-, author =	"S. Hertel"
-, title =	"Sweep-{Algorithmen} f{\"u}r {Polygone} und {Polyeder}"
-, type =	"Report"
-, number =	"??"
-, institution =	"Fachber. Inform., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1984
-, update =	"94.05 devillers"
+, author =      "S. Hertel"
+, title =       "Sweep-{Algorithmen} f{\"u}r {Polygone} und {Polyeder}"
+, type =        "Report"
+, number =      "??"
+, institution = "Fachber. Inform., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1984
+, update =      "94.05 devillers"
 }
 
 @article{hmmn-sssic-84
-, author =	"S. Hertel and M. M{\"a}ntyl{\"a} and K. Mehlhorn and J. Nievergelt"
-, title =	"Space sweep solves intersection of convex polyhedra"
-, journal =	"Acta Inform."
-, volume =	21
-, year =	1984
-, pages =	"501--519"
+, author =      "S. Hertel and M. M{\"a}ntyl{\"a} and K. Mehlhorn and J. Nievergelt"
+, title =       "Space sweep solves intersection of convex polyhedra"
+, journal =     "Acta Inform."
+, volume =      21
+, year =        1984
+, pages =       "501--519"
 }
 
 @inproceedings{hm-ftsp-83
-, author =	"S. Hertel and K. Mehlhorn"
-, title =	"Fast triangulation of simple polygons"
-, booktitle =	"Proc. 4th Internat. Conf. Found. Comput. Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	158
-, publisher =	"Springer-Verlag"
-, year =	1983
-, pages =	"207--218"
-, precedes =	"hm-ftprs-85"
+, author =      "S. Hertel and K. Mehlhorn"
+, title =       "Fast triangulation of simple polygons"
+, booktitle =   "Proc. 4th Internat. Conf. Found. Comput. Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      158
+, publisher =   "Springer-Verlag"
+, year =        1983
+, pages =       "207--218"
+, precedes =    "hm-ftprs-85"
 }
 
 @article{hm-ftprs-85
-, author =	"S. Hertel and K. Mehlhorn"
-, title =	"Fast triangulation of the plane with respect to simple polygons"
-, journal =	"Inform. Control"
-, volume =	64
-, year =	1985
-, pages =	"52--76"
-, succeeds =	"hm-ftsp-83"
+, author =      "S. Hertel and K. Mehlhorn"
+, title =       "Fast triangulation of the plane with respect to simple polygons"
+, journal =     "Inform. Control"
+, volume =      64
+, year =        1985
+, pages =       "52--76"
+, succeeds =    "hm-ftsp-83"
 }
 
 @techreport{h-tkfeb-93
-, author =	"P. Hertling"
-, title =	"Topologische Komplexit{\"a}tsgrade von Funktionen mit endlichem Bild"
-, type =	"Report"
-, number =	152
-, institution =	"Fernuniversit{\"a}t"
-, address =	"Hagen"
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "P. Hertling"
+, title =       "Topologische Komplexit{\"a}tsgrade von Funktionen mit endlichem Bild"
+, type =        "Report"
+, number =      152
+, institution = "Fernuniversit{\"a}t"
+, address =     "Hagen"
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{hw-ldelc-94
-, author =	"P. Hertling and K. Weihrauch"
-, title =	"Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"237--242"
-, cites =	"a-ca-80, bb-ca-85, bss-tccrn-89, g-dcrcf-57, gy-frcg-86, gss-egbra-89, h-tkfeb-93, hhk-tirgc-88, k-ctrf-91, m-vigau-88a, pr-cap-88, ps-cgi-85, sh-gip-76, s-ta-87, s-aefsm-87, w-c-87, wk-uacra-84, y-stgd-90, h-pargc-89, td-cm-88, v-cdsmt-92, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "P. Hertling and K. Weihrauch"
+, title =       "Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "237--242"
+, cites =       "a-ca-80, bb-ca-85, bss-tccrn-89, g-dcrcf-57, gy-frcg-86, gss-egbra-89, h-tkfeb-93, hhk-tirgc-88, k-ctrf-91, m-vigau-88a, pr-cap-88, ps-cgi-85, sh-gip-76, s-ta-87, s-aefsm-87, w-c-87, wk-uacra-84, y-stgd-90, h-pargc-89, td-cm-88, v-cdsmt-92, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @book{hkp-itnc-91
-, author =	"J. Hertz and A. Krogh and R. G. Palmer"
-, title =	"Introduction to the Theory of Neural Computation"
-, publisher =	"Addison-Wesley"
-, address =	"New York"
-, year =	1991
-, update =	"00.03 bibrelex"
+, author =      "J. Hertz and A. Krogh and R. G. Palmer"
+, title =       "Introduction to the Theory of Neural Computation"
+, publisher =   "Addison-Wesley"
+, address =     "New York"
+, year =        1991
+, update =      "00.03 bibrelex"
 }
 
 @article{hb-atdis-87
-, author =	"B. Von Herzen and A. H. Barr"
-, title =	"Accurate triangulations of deformed, intersecting surfaces"
-, journal =	"Comput. Graph."
-, volume =	21
-, number =	4
-, month =	jul
-, year =	1987
-, pages =	"103--110"
-, update =	"96.09 devillers, 95.01 mitchell"
+, author =      "B. Von Herzen and A. H. Barr"
+, title =       "Accurate triangulations of deformed, intersecting surfaces"
+, journal =     "Comput. Graph."
+, volume =      21
+, number =      4
+, month =       jul
+, year =        1987
+, pages =       "103--110"
+, update =      "96.09 devillers, 95.01 mitchell"
 }
 
 @article{hs-pvnlp-71
-, author =	"F. Herzog and B. M. Steward"
-, title =	"Patterns of visible and nonvisible lattice points"
-, journal =	"Amer. Math. Monthly"
-, volume =	78
-, year =	1971
-, pages =	"487--496"
-, update =	"97.11 bibrelex"
+, author =      "F. Herzog and B. M. Steward"
+, title =       "Patterns of visible and nonvisible lattice points"
+, journal =     "Amer. Math. Monthly"
+, volume =      78
+, year =        1971
+, pages =       "487--496"
+, update =      "97.11 bibrelex"
 }
 
 @book{hs-cagcu-84
-, author =	"D. Hestenes and G. Sobczyk"
-, title =	"Clifford algebra to geometric calculus: {A} unified language for mathematics and physics"
-, publisher =	"D. Reidel Publishing Co."
-, address =	"Dodrecht"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "D. Hestenes and G. Sobczyk"
+, title =       "Clifford algebra to geometric calculus: {A} unified language for mathematics and physics"
+, publisher =   "D. Reidel Publishing Co."
+, address =     "Dodrecht"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @book{h-cvoct-66
-, author =	"M. R. Hestens"
-, title =	"Calculus of Variations and Optimal Control Theory"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1966
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "M. R. Hestens"
+, title =       "Calculus of Variations and Optimal Control Theory"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1966
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{h-srcc-95
-, author =	"G. Hetyai"
-, title =	"On the {Stanley} ring of a cubical complex"
-, journal =	"Discrete Comput. Geom."
-, volume =	14
-, year =	1995
-, pages =	"305--330"
-, update =	"97.11 bibrelex"
+, author =      "G. Hetyai"
+, title =       "On the {Stanley} ring of a cubical complex"
+, journal =     "Discrete Comput. Geom."
+, volume =      14
+, year =        1995
+, pages =       "305--330"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{h-bvb-89
-, author =	"H. Heusinger"
-, title =	"{Balancierung} von {Voronoi}-{B{\"a}umen}"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "H. Heusinger"
+, title =       "{Balancierung} von {Voronoi}-{B{\"a}umen}"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{hn-src-88
-, author =	"H. Heusinger and H. Noltemeier"
-, title =	"On separable and rectangular clusterings"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"25--42"
-, update =	"00.03 bibrelex, 99.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "H. Heusinger and H. Noltemeier"
+, title =       "On separable and rectangular clusterings"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "25--42"
+, update =      "00.03 bibrelex, 99.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @article{hn-sc-89
-, author =	"H. Heusinger and H. Noltemeier"
-, title =	"On separable clusterings"
-, journal =	"J. Algorithms"
-, volume =	10
-, year =	1989
-, pages =	"212--227"
-, update =	"00.03 bibrelex"
+, author =      "H. Heusinger and H. Noltemeier"
+, title =       "On separable clusterings"
+, journal =     "J. Algorithms"
+, volume =      10
+, year =        1989
+, pages =       "212--227"
+, update =      "00.03 bibrelex"
 }
 
 @techreport{h-oafms-83
-, author =	"P. T. Highnam"
-, title =	"An optimal algorithm for finding the mirror symmetries of a planar point set"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1983
+, author =      "P. T. Highnam"
+, title =       "An optimal algorithm for finding the mirror symmetries of a planar point set"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1983
 }
 
 @techreport{h-oafsp-85
-, author =	"P. T. Highnam"
-, title =	"Optimal algorithms for finding the symmetries of a planar point set"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1985
+, author =      "P. T. Highnam"
+, title =       "Optimal algorithms for finding the symmetries of a planar point set"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1985
 }
 
 @article{h-oafsp-86
-, author =	"P. T. Highnam"
-, title =	"Optimal Algorithms for Finding the Symmetries of a Planar Point Set"
-, journal =	"Inform. Process. Lett."
-, volume =	22
-, year =	1986
-, pages =	"219--222"
-, update =	"98.03 bibrelex"
+, author =      "P. T. Highnam"
+, title =       "Optimal Algorithms for Finding the Symmetries of a Planar Point Set"
+, journal =     "Inform. Process. Lett."
+, volume =      22
+, year =        1986
+, pages =       "219--222"
+, update =      "98.03 bibrelex"
 }
 
 @article{h-ep-82
-, author =	"P. T. Highnam"
-, title =	"The ears of a polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	15
-, number =	5
-, year =	1982
-, pages =	"196--198"
-, keywords =	"two-dimensional, triangles, reporting, counting, triangulation, polygons"
+, author =      "P. T. Highnam"
+, title =       "The ears of a polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      15
+, number =      5
+, year =        1982
+, pages =       "196--198"
+, keywords =    "two-dimensional, triangles, reporting, counting, triangulation, polygons"
 }
 
 @inproceedings{hpr-irslp-92
-, author =	"W. L. Hightower and J. F. Prins and J. H. Reif"
-, title =	"Implementation of randomized sorting on large parallel machines"
-, booktitle =	"Proc. 4th ACM Sympos. Parallel Algorithms Architect."
-, year =	1992
-, pages =	"158--167"
-, update =	"96.09 orourke"
+, author =      "W. L. Hightower and J. F. Prins and J. H. Reif"
+, title =       "Implementation of randomized sorting on large parallel machines"
+, booktitle =   "Proc. 4th ACM Sympos. Parallel Algorithms Architect."
+, year =        1992
+, pages =       "158--167"
+, update =      "96.09 orourke"
 }
 
 @book{h-fggdg-71
-, author =	"D. Hilbert"
-, title =	"Foundations of Geometry (Grundlagen der Geometrie)"
-, publisher =	"Open Court"
-, year =	1971
-, note =	"Tr. by Leo Unger"
-, update =	"93.09 erickson"
+, author =      "D. Hilbert"
+, title =       "Foundations of Geometry (Grundlagen der Geometrie)"
+, publisher =   "Open Court"
+, year =        1971
+, note =        "Tr. by Leo Unger"
+, update =      "93.09 erickson"
 }
 
 @book{hc-gi-52
-, author =	"D. Hilbert and S. {Cohn-Vossen}"
-, title =	"Geometry and the Imagination"
-, publisher =	"Chelsea Publishing Company"
-, address =	"New York, NY"
-, year =	1952
-, update =	"98.03 bibrelex"
+, author =      "D. Hilbert and S. {Cohn-Vossen}"
+, title =       "Geometry and the Imagination"
+, publisher =   "Chelsea Publishing Company"
+, address =     "New York, NY"
+, year =        1952
+, update =      "98.03 bibrelex"
 }
 
 @article{h-cdtdp-81
-, author =	"R. Hilbert"
-, title =	"Construction and display of three-dimensional polygon-histograms"
-, journal =	"Comput. Graph."
-, volume =	15
-, number =	3
-, year =	1981
-, pages =	"230--241"
-, note =	"Proc. SIGGRAPH '81"
+, author =      "R. Hilbert"
+, title =       "Construction and display of three-dimensional polygon-histograms"
+, journal =     "Comput. Graph."
+, volume =      15
+, number =      3
+, year =        1981
+, pages =       "230--241"
+, note =        "Proc. SIGGRAPH '81"
 }
 
 @article{h-trpsp-72
-, author =	"J. Hilden"
-, title =	"Testing the relative position of several points on a circle"
-, journal =	"BIT"
-, volume =	12
-, year =	1972
-, pages =	"182--187"
+, author =      "J. Hilden"
+, title =       "Testing the relative position of several points on a circle"
+, journal =     "BIT"
+, volume =      12
+, year =        1972
+, pages =       "182--187"
 }
 
 @incollection{h-ppdp-94
-, author =	"F. S. {Hill Jr.}"
-, title =	"The Pleasures of ``Perp Dot'' Products"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"138--148"
-, keywords =	"geometry, fillet, perp-dot product, projection"
-, update =	"94.09 heckbert"
-, annote =	"A tutorial on the ``perp dot product,'' which is the dot
+, author =      "F. S. {Hill Jr.}"
+, title =       "The Pleasures of ``Perp Dot'' Products"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "138--148"
+, keywords =    "geometry, fillet, perp-dot product, projection"
+, update =      "94.09 heckbert"
+, annote =      "A tutorial on the ``perp dot product,'' which is the dot
 product, in 2D, of one vector and the vector perpendicular to another."
 }
 
 @techreport{h-ebnef-81
-, author =	"M. D. Hill"
-, title =	"An examination of the bounds of the number of edges and faces of a simple polyhedron (rough draft)"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1981
+, author =      "M. D. Hill"
+, title =       "An examination of the bounds of the number of edges and faces of a simple polyhedron (rough draft)"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1981
 }
 
 @techreport{h-tdp-81
-, author =	"M. D. Hill"
-, title =	"Tetrahedral decomposition of polyhedra"
-, type =	"Manuscript"
-, institution =	"??"
-, address =	"Ann Arbor, MI"
-, year =	1981
+, author =      "M. D. Hill"
+, title =       "Tetrahedral decomposition of polyhedra"
+, type =        "Manuscript"
+, institution = "??"
+, address =     "Ann Arbor, MI"
+, year =        1981
 }
 
 @incollection{h-tli-94
-, author =	"Steve Hill"
-, title =	"Tri-linear Interpolation"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"521--525"
-, keywords =	"trilinear interpolation, bilinear interpolation, reconstruction"
-, update =	"94.09 heckbert"
-, annote =	"Gives optimized code for performing linear interpolation
+, author =      "Steve Hill"
+, title =       "Tri-linear Interpolation"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "521--525"
+, keywords =    "trilinear interpolation, bilinear interpolation, reconstruction"
+, update =      "94.09 heckbert"
+, annote =      "Gives optimized code for performing linear interpolation
 in a 3D grid. Trilinear interpolation is useful for volume rendering, and
 its 2D variant, bilinear interpolation, is a very common operation in image
 processing. Contains C code."
 }
 
 @techreport{h-dwgsa-72
-, author =	"T. W. {Hill, Jr.}"
-, title =	"On Determining When a Graph Is The Skeleton Of an Abstract Polytope"
-, type =	"Research Memorandum"
-, number =	"72-4"
-, institution =	"School of Industrial Engineering, Purdue University"
-, address =	"West Lafayette, IN"
-, year =	1972
-, update =	"96.05 pascucci"
+, author =      "T. W. {Hill, Jr.}"
+, title =       "On Determining When a Graph Is The Skeleton Of an Abstract Polytope"
+, type =        "Research Memorandum"
+, number =      "72-4"
+, institution = "School of Industrial Engineering, Purdue University"
+, address =     "West Lafayette, IN"
+, year =        1972
+, update =      "96.05 pascucci"
 }
 
 @book{hhp-mr-97
-, author =	"Peter Hilton and Derek Holton and Jean Pedersen"
-, title =	"Mathematical Reflections: In a Room with Many Mirrors"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1997
-, update =	"02.03 icking, 01.11 orourke"
+, author =      "Peter Hilton and Derek Holton and Jean Pedersen"
+, title =       "Mathematical Reflections: In a Room with Many Mirrors"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1997
+, update =      "02.03 icking, 01.11 orourke"
 }
 
 @techreport{h-celag-94
-, author =	"M. Himsolt"
-, title =	"Comparing and Evaluating Layout Algorithms within GraphEd"
-, type =	"Manuscript"
-, institution =	"Fakultat fur Mathematik und Informatik, Univ. Passau"
-, year =	1994
-, url =	"ftp://ftp.uni-passau.de/pub/local/graphed/papers/LayoutEvaluation.ps.Z"
-, update =	"95.01 tamassia"
+, author =      "M. Himsolt"
+, title =       "Comparing and Evaluating Layout Algorithms within GraphEd"
+, type =        "Manuscript"
+, institution = "Fakultat fur Mathematik und Informatik, Univ. Passau"
+, year =        1994
+, url = "ftp://ftp.uni-passau.de/pub/local/graphed/papers/LayoutEvaluation.ps.Z"
+, update =      "95.01 tamassia"
 }
 
 @article{h-celag-95
-, author =	"M. Himsolt"
-, title =	"Comparing and Evaluating Layout Algorithms within {GraphEd}"
-, journal =	"J. Visual Lang. Comput."
-, volume =	6
-, number =	3
-, year =	1995
-, pages =	"255--273"
-, note =	"(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
-, keywords =	"graph drawing, experiments"
-, update =	"97.03 tamassia, 95.09 agarwal+devillers, 95.05 tamassia"
+, author =      "M. Himsolt"
+, title =       "Comparing and Evaluating Layout Algorithms within {GraphEd}"
+, journal =     "J. Visual Lang. Comput."
+, volume =      6
+, number =      3
+, year =        1995
+, pages =       "255--273"
+, note =        "(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
+, keywords =    "graph drawing, experiments"
+, update =      "97.03 tamassia, 95.09 agarwal+devillers, 95.05 tamassia"
 }
 
 @techreport{h-ggml-96
-, author =	"M. Himsolt"
-, title =	"GML: Graph Modelling Language"
-, type =	"Manuscript"
-, institution =	"Universit{\"a}t Passau, Innstra\ss e 33, 94030 Passau, Germany"
-, year =	1996
-, url =	"https://www.uni-passau.de/~himsolt/Graphlet/GML"
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia"
+, author =      "M. Himsolt"
+, title =       "GML: Graph Modelling Language"
+, type =        "Manuscript"
+, institution = "Universit{\"a}t Passau, Innstra\ss e 33, 94030 Passau, Germany"
+, year =        1996
+, url = "https://www.uni-passau.de/~himsolt/Graphlet/GML"
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{h-ggpig-95
-, author =	"M. Himsolt"
-, title =	"{GraphEd}: a Graphical Platform for the Implementation of Graph Algorithms"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"182--193"
-, keywords =	"graph drawing, system, grammar"
-, update =	"95.01 tamassia"
+, author =      "M. Himsolt"
+, title =       "{GraphEd}: a Graphical Platform for the Implementation of Graph Algorithms"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "182--193"
+, keywords =    "graph drawing, system, grammar"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{h-gige-89
-, author =	"M. Himsolt"
-, title =	"GraphEd: An Interactive Graph Editor"
-, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	349
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"532--533"
-, keywords =	"graph drawing"
-, comments =	"Software in \url{ftp://ftp.uni-passau.de/pub/local/graphed}"
-, update =	"99.11 bibrelex, 96.09 agarwal, 94.09 jones, 93.09 tamassia"
+, author =      "M. Himsolt"
+, title =       "GraphEd: An Interactive Graph Editor"
+, booktitle =   "Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      349
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "532--533"
+, keywords =    "graph drawing"
+, comments =    "Software in \url{ftp://ftp.uni-passau.de/pub/local/graphed}"
+, update =      "99.11 bibrelex, 96.09 agarwal, 94.09 jones, 93.09 tamassia"
 }
 
 @article{hm-mcedr-80
-, author =	"A. L. Hinde and R. E. Miles"
-, title =	"{Monte}-{Carlo} Estimates of the Distributions of the Random Polygons of the {Voronoi} Tessellation With Respect to a {Poisson} Process"
-, journal =	"Journal of Statistics and Computer Simulation"
-, volume =	10
-, year =	1980
-, pages =	"205--223"
-, annote =	"Measurements of various statistics of two million
-		 independent Voronoi polygons. Circumcircle algorithm
-		 used to generate (one polygon)."
+, author =      "A. L. Hinde and R. E. Miles"
+, title =       "{Monte}-{Carlo} Estimates of the Distributions of the Random Polygons of the {Voronoi} Tessellation With Respect to a {Poisson} Process"
+, journal =     "Journal of Statistics and Computer Simulation"
+, volume =      10
+, year =        1980
+, pages =       "205--223"
+, annote =      "Measurements of various statistics of two million
+                 independent Voronoi polygons. Circumcircle algorithm
+                 used to generate (one polygon)."
 }
 
 @inproceedings{hkm-alsiq-96
-, author =	"Andr{\'e} Hinkenjann and Markus Kukuk and Heinrich M{\"u}ller"
-, title =	"Answering Line Segment Intersection Queries Based on Sample Answers"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"65--68"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Andr{\'e} Hinkenjann and Markus Kukuk and Heinrich M{\"u}ller"
+, title =       "Answering Line Segment Intersection Queries Based on Sample Answers"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "65--68"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{h-oscps-95
-, author =	"Klaus Hinrichs"
-, title =	"Overlaying Simply Connected Planar Subdivision in Linear Time"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	31
-, update =	"00.03 bibrelex"
+, author =      "Klaus Hinrichs"
+, title =       "Overlaying Simply Connected Planar Subdivision in Linear Time"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       31
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{hn-gfdsd-83
-, author =	"K. Hinrichs and J. Nievergelt"
-, title =	"The grid file: a data structure designed to support proximity queries on spatial objects"
-, editor =	"M. Nagl and J. Perl"
-, booktitle =	"Proc. 9th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '83"
-, publisher =	"Trauner Verlag"
-, address =	"Linz, Austria"
-, year =	1983
-, pages =	"100--113"
-, update =	"98.07 bibrelex"
+, author =      "K. Hinrichs and J. Nievergelt"
+, title =       "The grid file: a data structure designed to support proximity queries on spatial objects"
+, editor =      "M. Nagl and J. Perl"
+, booktitle =   "Proc. 9th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '83"
+, publisher =   "Trauner Verlag"
+, address =     "Linz, Austria"
+, year =        1983
+, pages =       "100--113"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{hns-saiia-89
-, author =	"K. Hinrichs and J. Nievergelt and P. Schorn"
-, title =	"A sweep algorithm and its implementation: {The} all-nearest-neighbors problem revisited"
-, editor =	"J. van Leuuwen"
-, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput."
-, site =	"Amsterdam, Netherlands"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	344
-, publisher =	"Springer-Verlag"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "K. Hinrichs and J. Nievergelt and P. Schorn"
+, title =       "A sweep algorithm and its implementation: {The} all-nearest-neighbors problem revisited"
+, editor =      "J. van Leuuwen"
+, booktitle =   "Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput."
+, site =        "Amsterdam, Netherlands"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      344
+, publisher =   "Springer-Verlag"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{hns-saann-88
-, author =	"K. Hinrichs and J. Nievergelt and P. Schorn"
-, title =	"A sweep algorithm for the all-nearest-neighbours problem"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"43--54"
-, keywords =	"proximity, points, two-dimensional, plane-sweep"
-, update =	"00.03 bibrelex, 99.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "K. Hinrichs and J. Nievergelt and P. Schorn"
+, title =       "A sweep algorithm for the all-nearest-neighbours problem"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "43--54"
+, keywords =    "proximity, points, two-dimensional, plane-sweep"
+, update =      "00.03 bibrelex, 99.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @article{hns-arsa2-92
-, author =	"K. Hinrichs and J. Nievergelt and P. Schorn"
-, title =	"An all-round sweep algorithm for $2$-dimensional nearest-neighbors problems"
-, journal =	"Acta Inform."
-, volume =	29
-, number =	4
-, year =	1992
-, pages =	"383--394"
-, update =	"98.11 bibrelex, 97.11 smid"
+, author =      "K. Hinrichs and J. Nievergelt and P. Schorn"
+, title =       "An all-round sweep algorithm for $2$-dimensional nearest-neighbors problems"
+, journal =     "Acta Inform."
+, volume =      29
+, number =      4
+, year =        1992
+, pages =       "383--394"
+, update =      "98.11 bibrelex, 97.11 smid"
 }
 
 @inproceedings{hns-arsa2-90
-, author =	"K. Hinrichs and J. Nievergelt and P. Schorn"
-, title =	"An all-round sweep algorithm for $2$-dimensional nearest-neighbour problems"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"343--346"
-, cites =	"f-savd-87, hns-saiia-89, v-oaann-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "K. Hinrichs and J. Nievergelt and P. Schorn"
+, title =       "An all-round sweep algorithm for $2$-dimensional nearest-neighbour problems"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "343--346"
+, cites =       "f-savd-87, hns-saiia-89, v-oaann-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{hns-psscp-88
-, author =	"K. Hinrichs and J. Nievergelt and P. Schorn"
-, title =	"Plane-sweep solves the closest pair problem elegantly"
-, journal =	"Inform. Process. Lett."
-, volume =	26
-, year =	1988
-, pages =	"255--261"
+, author =      "K. Hinrichs and J. Nievergelt and P. Schorn"
+, title =       "Plane-sweep solves the closest pair problem elegantly"
+, journal =     "Inform. Process. Lett."
+, volume =      26
+, year =        1988
+, pages =       "255--261"
 }
 
 @proceedings{h-ewcg-96
-, title =	"Abstracts 12th European Workshop Comput. Geom."
-, editor =	"Klaus H. Hinrichs"
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, volume =	"7/96-I"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 12th European Workshop Comput. Geom."
+, editor =      "Klaus H. Hinrichs"
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, volume =      "7/96-I"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, update =      "00.03 bibrelex"
 }
 
 @proceedings{h-iwcg-90
-, title =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, editor =	"Klaus H. Hinrichs"
-, nickname =	"CG '90"
-, site =	"Siegen"
-, series =	"Informatik-Berichte"
-, volume =	"90-01"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 6th Intern. Workshop Comput. Geom."
+, editor =      "Klaus H. Hinrichs"
+, nickname =    "CG '90"
+, site =        "Siegen"
+, series =      "Informatik-Berichte"
+, volume =      "90-01"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, update =      "00.03 bibrelex"
 }
 
 @phdthesis{h-gfsic-85
-, author =	"K. H. Hinrichs"
-, title =	"The grid file system: {I}mplementation and case studies of applications"
-, school =	"Dept. Information Science, ETH"
-, address =	"Z{\"u}rich"
-, year =	1985
-, keywords =	"doctoral thesis"
-, comments =	"Diss. ETH 7734"
-, update =	"97.07 agarwal"
+, author =      "K. H. Hinrichs"
+, title =       "The grid file system: {I}mplementation and case studies of applications"
+, school =      "Dept. Information Science, ETH"
+, address =     "Z{\"u}rich"
+, year =        1985
+, keywords =    "doctoral thesis"
+, comments =    "Diss. ETH 7734"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{h-ugigf-88
-, author =	"H. Hinterberger"
-, title =	"Using graphical information from a grid file's directory to visualize patterns in {Cartesian} product spaces"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"1--14"
-, update =	"00.03 bibrelex, 99.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "H. Hinterberger"
+, title =       "Using graphical information from a grid file's directory to visualize patterns in {Cartesian} product spaces"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "1--14"
+, update =      "00.03 bibrelex, 99.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @techreport{hikl-hfplf-97
-, author =	"Christoph Hipke and Christian Icking and Rolf Klein and Elmar Langetepe"
-, title =	"How to Find a Point on a Line within a Fixed Distance"
-, number =	220
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1997
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr220.pdf"
-, precedes =	"hikl-hfplf-99"
-, cites =	"bcr-sp-93, brs-nugt-97, ik-csas-95, kp-caasu-93, krt-sueor-96, k-ag-97, ls-pinos-97, ZZZ"
-, update =	"00.03 bibrelex, 99.07 bibrelex, 98.07 icking"
+, author =      "Christoph Hipke and Christian Icking and Rolf Klein and Elmar Langetepe"
+, title =       "How to Find a Point on a Line within a Fixed Distance"
+, number =      220
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1997
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr220.pdf"
+, precedes =    "hikl-hfplf-99"
+, cites =       "bcr-sp-93, brs-nugt-97, ik-csas-95, kp-caasu-93, krt-sueor-96, k-ag-97, ls-pinos-97, ZZZ"
+, update =      "00.03 bibrelex, 99.07 bibrelex, 98.07 icking"
 }
 
 @article{hikl-hfplf-99
-, author =	"Christoph Hipke and Christian Icking and Rolf Klein and Elmar Langetepe"
-, title =	"How to Find a Point on a Line within a Fixed Distance"
-, journal =	"Discrete Appl. Math."
-, volume =	93
-, year =	1999
-, pages =	"67--73"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr220.pdf"
-, succeeds =	"hikl-hfplf-97"
-, cites =	"bcr-sp-93, brs-nugt-97, ik-csas-95, kp-caasu-93, krt-sueor-96, k-ag-97, ls-pinos-97, ZZZ"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Christoph Hipke and Christian Icking and Rolf Klein and Elmar Langetepe"
+, title =       "How to Find a Point on a Line within a Fixed Distance"
+, journal =     "Discrete Appl. Math."
+, volume =      93
+, year =        1999
+, pages =       "67--73"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr220.pdf"
+, succeeds =    "hikl-hfplf-97"
+, cites =       "bcr-sp-93, brs-nugt-97, ik-csas-95, kp-caasu-93, krt-sueor-96, k-ag-97, ls-pinos-97, ZZZ"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @incollection{h-dpos-51
-, author =	"T. Hiraguchi"
-, title =	"On the dimension of partially ordered sets"
-, booktitle =	"Scientific {Report} 1"
-, publisher =	"Kanzawa University"
-, year =	1951
-, pages =	"77--94"
-, update =	"94.05 franciosa"
+, author =      "T. Hiraguchi"
+, title =       "On the dimension of partially ordered sets"
+, booktitle =   "Scientific {Report} 1"
+, publisher =   "Kanzawa University"
+, year =        1951
+, pages =       "77--94"
+, update =      "94.05 franciosa"
 }
 
 @inproceedings{hmtt-cpics-92
-, author =	"T. Hirata and J. Matou{\v s}ek and X.-H. Tan and T. Tokuyama"
-, title =	"Complexity of projected images of convex subdivisions"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"121--126"
-, precedes =	"hmtt-cpics-94"
-, cites =	"abe-ap1sp-91, ce-oails-88, c-sssl-86, dl-msp-76, e-acg-87, s-nvapo-91, s-chdch-86, s-lpchm-90, thi-splia-90, ZZZ"
-, update =	"98.07 bibrelex, 96.09 agarwal+devillers"
+, author =      "T. Hirata and J. Matou{\v s}ek and X.-H. Tan and T. Tokuyama"
+, title =       "Complexity of projected images of convex subdivisions"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "121--126"
+, precedes =    "hmtt-cpics-94"
+, cites =       "abe-ap1sp-91, ce-oails-88, c-sssl-86, dl-msp-76, e-acg-87, s-nvapo-91, s-chdch-86, s-lpchm-90, thi-splia-90, ZZZ"
+, update =      "98.07 bibrelex, 96.09 agarwal+devillers"
 }
 
 @article{hmtt-cpics-94
-, author =	"T. Hirata and J. Matou{\v s}ek and X.-H. Tan and T. Tokuyama"
-, title =	"Complexity of projected images of convex subdivisions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"293--308"
-, succeeds =	"hmtt-cpics-92"
-, update =	"96.09 devillers"
+, author =      "T. Hirata and J. Matou{\v s}ek and X.-H. Tan and T. Tokuyama"
+, title =       "Complexity of projected images of convex subdivisions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "293--308"
+, succeeds =    "hmtt-cpics-92"
+, update =      "96.09 devillers"
 }
 
 @article{hk-gsftq-91
-, author =	"S. Hirose and O. Kunieda"
-, title =	"Generalized standard foot trajectory for a quadruped walking vehicle"
-, journal =	"Internat. J. Robot. Res."
-, volume =	10
-, number =	1
-, month =	feb
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "S. Hirose and O. Kunieda"
+, title =       "Generalized standard foot trajectory for a quadruped walking vehicle"
+, journal =     "Internat. J. Robot. Res."
+, volume =      10
+, number =      1
+, month =       feb
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{hnku-agcqw-84
-, author =	"S. Hirose and M. Nose and H. Kikuchi and Y. Umetani"
-, title =	"Adaptive gait control of a quadruped walking vehicle"
-, booktitle =	"Proc. Internat. Sympos. Robot. Res."
-, publisher =	"MIT Press"
-, year =	1984
-, pages =	"253--277"
-, update =	"97.11 bibrelex"
+, author =      "S. Hirose and M. Nose and H. Kikuchi and Y. Umetani"
+, title =       "Adaptive gait control of a quadruped walking vehicle"
+, booktitle =   "Proc. Internat. Sympos. Robot. Res."
+, publisher =   "MIT Press"
+, year =        1984
+, pages =       "253--277"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{hs-ptard-94
-, author =	"Tetsuya Hiroshima and Kokichi Sugihara"
-, title =	"Polynomial-Time Algorithm for Recognizing {Delaunay} Graphs"
-, number =	"{METR}~94-15"
-, institution =	"Department of Mathematical Engineering and Information Physics, University of Tokyo"
-, month =	sep
-, year =	1994
-, update =	"98.07 tamassia+vismara"
+, author =      "Tetsuya Hiroshima and Kokichi Sugihara"
+, title =       "Polynomial-Time Algorithm for Recognizing {Delaunay} Graphs"
+, number =      "{METR}~94-15"
+, institution = "Department of Mathematical Engineering and Information Physics, University of Tokyo"
+, month =       sep
+, year =        1994
+, update =      "98.07 tamassia+vismara"
 }
 
 @book{h-dt-76
-, author =	"M. W. Hirsch"
-, title =	"Differential Topology"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1976
-, update =	"98.03 bibrelex"
+, author =      "M. W. Hirsch"
+, title =       "Differential Topology"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1976
+, update =      "98.03 bibrelex"
 }
 
 @article{h-cssv-80
-, author =	"D. S. Hirschberg"
-, title =	"On the complexity of searching a set of vectors"
-, journal =	"SIAM J. Comput."
-, volume =	9
-, year =	1980
-, pages =	"126--129"
+, author =      "D. S. Hirschberg"
+, title =       "On the complexity of searching a set of vectors"
+, journal =     "SIAM J. Comput."
+, volume =      9
+, year =        1980
+, pages =       "126--129"
 }
 
 @article{hl-tp-92
-, author =	"D. S. Hirschberg and L. L. Larmore"
-, title =	"The traveler's problem"
-, journal =	"J. Algorithms"
-, volume =	13
-, year =	1992
-, pages =	"148--160"
+, author =      "D. S. Hirschberg and L. L. Larmore"
+, title =       "The traveler's problem"
+, journal =     "J. Algorithms"
+, volume =      13
+, year =        1992
+, pages =       "148--160"
 }
 
 @article{hv-iuq-87
-, author =	"D. S. Hirschberg and D. J. Volper"
-, title =	"Improved update/query"
-, journal =	"Inform. Process. Lett."
-, volume =	24
-, year =	1987
-, pages =	"307--310"
+, author =      "D. S. Hirschberg and D. J. Volper"
+, title =       "Improved update/query"
+, journal =     "Inform. Process. Lett."
+, volume =      24
+, year =        1987
+, pages =       "307--310"
 }
 
 @inproceedings{h-adshf-95
-, author =	"N. Hitschfeld"
-, title =	"Algorithms and Data Structures for Handling a Fully Flexible Refinement Approach in Mesh Generation"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"265--276"
-, update =	"96.01 samitchell"
+, author =      "N. Hitschfeld"
+, title =       "Algorithms and Data Structures for Handling a Fully Flexible Refinement Approach in Mesh Generation"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "265--276"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{hf-1ietm-96
-, author =	"Nancy Hitschfeld and Rodrigo Farias"
-, title =	"1-irregular element tessellation in mixed element meshes for the control volume discretization method"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"195--204"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Nancy Hitschfeld and Rodrigo Farias"
+, title =       "1-irregular element tessellation in mixed element meshes for the control volume discretization method"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "195--204"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @inproceedings{hf-metgm-92
-, author =	"Nancy Hitschfeld and Wolfgang Fichtner"
-, title =	"Mixed Element Trees: A Generalization of Modified Octrees for the Generation of {3-D} {Delaunay} Meshes"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"85--87"
-, update =	"00.03 bibrelex"
+, author =      "Nancy Hitschfeld and Wolfgang Fichtner"
+, title =       "Mixed Element Trees: A Generalization of Modified Octrees for the Generation of {3-D} {Delaunay} Meshes"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "85--87"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{hs-dsufp-98
-, author =	"Hisamoto Hiyoshi and Hiroshi Sekigawa"
-, title =	"Deciding the Sign Using Floating-Point Arithmetic"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"89--91"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Hisamoto Hiyoshi and Hiroshi Sekigawa"
+, title =       "Deciding the Sign Using Floating-Point Arithmetic"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "89--91"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{hs-vbihc-00
-, author =	"Hisamoto Hiyoshi and Kokichi Sugihara"
-, title =	"Voronoi-Based Interpolation with Higher Continuity"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"242--250"
-, update =	"00.11 jones"
+, author =      "Hisamoto Hiyoshi and Kokichi Sugihara"
+, title =       "Voronoi-Based Interpolation with Higher Continuity"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "242--250"
+, update =      "00.11 jones"
 }
 
 @inproceedings{hs-rsd-95
-, author =	"G. R. Hjaltason and H. Samet"
-, title =	"Ranking in spatial databases"
-, editor =	"M. J. Egenhofer and J. R. Herring"
-, booktitle =	"Advances in Spatial Databases - Fourth International Symposium"
-, site =	"Portland, ME"
-, series =	"Lecture Notes Comput. Sci."
-, number =	951
-, month =	aug
-, year =	1995
-, pages =	"83--95"
-, update =	"96.05 efrat"
+, author =      "G. R. Hjaltason and H. Samet"
+, title =       "Ranking in spatial databases"
+, editor =      "M. J. Egenhofer and J. R. Herring"
+, booktitle =   "Advances in Spatial Databases - Fourth International Symposium"
+, site =        "Portland, ME"
+, series =      "Lecture Notes Comput. Sci."
+, number =      951
+, month =       aug
+, year =        1995
+, pages =       "83--95"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{h-tgub-97
-, author =	"Petr Hlin{\v e}n{\'y}"
-, title =	"Touching Graphs of Unit Balls"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"350--358"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Petr Hlin{\v e}n{\'y}"
+, title =       "Touching Graphs of Unit Balls"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "350--358"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @techreport{hy-prsts-87
-, author =	"C. Ho and C. K. Yap"
-, title =	"Polynomial Remainder Sequences and Theory of Subresultants"
-, type =	"Technical {Report}"
-, number =	319
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1987
-, note =	"Robotics Report No. 119"
-, update =	"97.11 bibrelex"
+, author =      "C. Ho and C. K. Yap"
+, title =       "Polynomial Remainder Sequences and Theory of Subresultants"
+, type =        "Technical {Report}"
+, number =      319
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1987
+, note =        "Robotics Report No. 119"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{hams-rqodc-97
-, author =	"C.-T. Ho and R. Agrawal and N. Megiddo and R. Srikant"
-, title =	"Range queries in {OLAP} data cubes"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1997
-, pages =	"73--88"
-, update =	"97.07 agarwal"
+, author =      "C.-T. Ho and R. Agrawal and N. Megiddo and R. Srikant"
+, title =       "Range queries in {OLAP} data cubes"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1997
+, pages =       "73--88"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{hba-psqod-97
-, author =	"C.-T. Ho and J. Bruck and R. Agrawal"
-, title =	"Partial-sum queries in {OLAP} data cubes using covering codes"
-, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
-, year =	1997
-, pages =	"228--237"
-, update =	"97.07 agarwal"
+, author =      "C.-T. Ho and J. Bruck and R. Agrawal"
+, title =       "Partial-sum queries in {OLAP} data cubes using covering codes"
+, booktitle =   "Proc. Annu. ACM Sympos. Principles Database Syst."
+, year =        1997
+, pages =       "228--237"
+, update =      "97.07 agarwal"
 }
 
 @article{h-dpt-76
-, author =	"C.-W. Ho"
-, title =	"Decomposition of a polygon into triangles"
-, journal =	"Math. Gazette"
-, volume =	60
-, year =	1976
-, pages =	"132--134"
-, keywords =	"decomposition, polygon triangulation, elementary geometry"
-, cites =	"l-tsfpp-11"
-, annote =	"A short correct proof of decomposability."
+, author =      "C.-W. Ho"
+, title =       "Decomposition of a polygon into triangles"
+, journal =     "Math. Gazette"
+, volume =      60
+, year =        1976
+, pages =       "132--134"
+, keywords =    "decomposition, polygon triangulation, elementary geometry"
+, cites =       "l-tsfpp-11"
+, annote =      "A short correct proof of decomposability."
 }
 
 @inproceedings{hkms-aromt-92
-, author =	"J. M. Ho and M. T. Ko and T. H. Ma and T. Y. Sung"
-, title =	"Algorithms for Rectilinear Optimal Multicast Tree Problem"
-, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '92"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	650
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"106--115"
-, update =	"94.09 smid, 93.09 milone+mitchell"
+, author =      "J. M. Ho and M. T. Ko and T. H. Ma and T. Y. Sung"
+, title =       "Algorithms for Rectilinear Optimal Multicast Tree Problem"
+, booktitle =   "Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '92"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      650
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "106--115"
+, update =      "94.09 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{hlcw-bdmst-89
-, author =	"J.-M. Ho and D. T. Lee and C.-H. Chang and C. K. Wong"
-, title =	"Bounded-diameter minimum spanning trees and related problems"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"276--282"
-, precedes =	"hlcw-mdstr-91"
-, cites =	"ct-fmst-76, d-ltatt-84, egs-oplms-86, gj-cigtn-79, gkln-dvd-83, k-osps-83, l-fnvda-80, m-ltalp-83, p-nappl-81, p-scnsg-57, sh-cpp-75, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "J.-M. Ho and D. T. Lee and C.-H. Chang and C. K. Wong"
+, title =       "Bounded-diameter minimum spanning trees and related problems"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "276--282"
+, precedes =    "hlcw-mdstr-91"
+, cites =       "ct-fmst-76, d-ltatt-84, egs-oplms-86, gj-cigtn-79, gkln-dvd-83, k-osps-83, l-fnvda-80, m-ltalp-83, p-nappl-81, p-scnsg-57, sh-cpp-75, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{hlcw-mdstr-91
-, author =	"J.-M. Ho and D. T. Lee and C.-H. Chang and C. K. Wong"
-, title =	"Minimum diameter spanning trees and related problems"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"987--997"
-, keywords =	"design of algorithms, geometric graphs, two-dimensional, minimum spanning trees, Steiner trees, NP-completeness"
-, succeeds =	"hlcw-bdmst-89"
+, author =      "J.-M. Ho and D. T. Lee and C.-H. Chang and C. K. Wong"
+, title =       "Minimum diameter spanning trees and related problems"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "987--997"
+, keywords =    "design of algorithms, geometric graphs, two-dimensional, minimum spanning trees, Steiner trees, NP-completeness"
+, succeeds =    "hlcw-bdmst-89"
 }
 
 @article{hvw-narst-90
-, author =	"J.-M. Ho and G. Vijayan and C. K. Wong"
-, title =	"New algorithms for the rectilinear {Steiner} tree problem"
-, journal =	"IEEE Trans. Comput. Aided Design"
-, volume =	9
-, year =	1990
-, pages =	"185--193"
-, update =	"98.03 bibrelex"
+, author =      "J.-M. Ho and G. Vijayan and C. K. Wong"
+, title =       "New algorithms for the rectilinear {Steiner} tree problem"
+, journal =     "IEEE Trans. Comput. Aided Design"
+, volume =      9
+, year =        1990
+, pages =       "185--193"
+, update =      "98.03 bibrelex"
 }
 
 @article{h-femgm-88
-, author =	"K. Ho-Le"
-, title =	"Finite Element Mesh Generation Methods: {A} Review And Classification"
-, journal =	"Comput. Aided Design"
-, volume =	20
-, number =	1
-, month =	jan
-, year =	1988
-, pages =	"27--38"
-, keywords =	"finite element mesh generation methods, Delaunay triangulation, mesh topology, Voronoi diagram"
-, annote =	"Good survey paper."
-, abstract =	"An attempt is made to provide a clear overall picture
-		 of the finite element mesh generation field. A scheme
-		 for classifying mesh generation methods is proposed,
-		 whereby seven major mesh generation approaches are
-		 identified. The basis for classification is the
-		 temporal order in which nodes and elements are created.
-		 The published mesh generation methods are reviewed.
-		 Only four approaches are found to have fully automatic
-		 mesh generation methods. These approaches are compared
-		 on the criteria of element types and shapes, mesh
-		 density control, and time efficiency. (Author abstract)
-		 73 refs."
+, author =      "K. Ho-Le"
+, title =       "Finite Element Mesh Generation Methods: {A} Review And Classification"
+, journal =     "Comput. Aided Design"
+, volume =      20
+, number =      1
+, month =       jan
+, year =        1988
+, pages =       "27--38"
+, keywords =    "finite element mesh generation methods, Delaunay triangulation, mesh topology, Voronoi diagram"
+, annote =      "Good survey paper."
+, abstract =    "An attempt is made to provide a clear overall picture
+                 of the finite element mesh generation field. A scheme
+                 for classifying mesh generation methods is proposed,
+                 whereby seven major mesh generation approaches are
+                 identified. The basis for classification is the
+                 temporal order in which nodes and elements are created.
+                 The published mesh generation methods are reviewed.
+                 Only four approaches are found to have fully automatic
+                 mesh generation methods. These approaches are compared
+                 on the criteria of element types and shapes, mesh
+                 density control, and time efficiency. (Author abstract)
+                 73 refs."
 }
 
 @techreport{h-psifp-93
-, author =	"J. Hobby"
-, title =	"Practical segment intersection with finite precision output"
-, type =	"Technical {Report}"
-, number =	"93/2-27"
-, institution =	"Bell Laboratories"
-, year =	1993
-, update =	"98.07 bibrelex"
+, author =      "J. Hobby"
+, title =       "Practical segment intersection with finite precision output"
+, type =        "Technical {Report}"
+, number =      "93/2-27"
+, institution = "Bell Laboratories"
+, year =        1993
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{h-psifp-94
-, author =	"J. Hobby"
-, title =	"Practical segment intersection with finite precision output"
-, year =	1994
-, note =	"Manuscript"
-, update =	"97.11 bibrelex"
+, author =      "J. Hobby"
+, title =       "Practical segment intersection with finite precision output"
+, year =        1994
+, note =        "Manuscript"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{h-patmn-93
-, author =	"J. D. Hobby"
-, title =	"Polygonal Approximations that Minimize the Number of Inflections"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"93--102"
-, update =	"93.05 smid"
+, author =      "J. D. Hobby"
+, title =       "Polygonal Approximations that Minimize the Number of Inflections"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "93--102"
+, update =      "93.05 smid"
 }
 
 @article{h-psifp-99
-, author =	"J. D. Hobby"
-, title =	"Practical Segment Intersection with Finite Precision Output"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, number =	4
-, month =	oct
-, year =	1999
-, pages =	"199--214"
-, update =	"00.03 held+smid"
+, author =      "J. D. Hobby"
+, title =       "Practical Segment Intersection with Finite Precision Output"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, number =      4
+, month =       oct
+, year =        1999
+, pages =       "199--214"
+, update =      "00.03 held+smid"
 }
 
 @article{h-rccw-89
-, author =	"J. D. Hobby"
-, title =	"Rasterizing curves of constant width"
-, journal =	"J. ACM"
-, volume =	36
-, year =	1989
-, pages =	"209--229"
+, author =      "J. D. Hobby"
+, title =       "Rasterizing curves of constant width"
+, journal =     "J. ACM"
+, volume =      36
+, year =        1989
+, pages =       "209--229"
 }
 
 @article{h-secis-86
-, author =	"J. D. Hobby"
-, title =	"Smooth, easy to compute interpolating splines"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"123--140"
+, author =      "J. D. Hobby"
+, title =       "Smooth, easy to compute interpolating splines"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "123--140"
 }
 
 @book{h-apncp-97
-, title =	"Approximation Problems for {NP}-Complete Problems"
-, editor =	"Dorit Hochbaum"
-, publisher =	"PWS Publishing Company"
-, address =	"Boston, MA"
-, year =	1997
-, update =	"98.03 mitchell"
+, title =       "Approximation Problems for {NP}-Complete Problems"
+, editor =      "Dorit Hochbaum"
+, publisher =   "PWS Publishing Company"
+, address =     "Boston, MA"
+, year =        1997
+, update =      "98.03 mitchell"
 }
 
 @article{h-aascv-82
-, author =	"D. S. Hochbaum"
-, title =	"Approximation algorithms of the set covering and vertex cover problems"
-, journal =	"SIAM J. Comput."
-, volume =	11
-, number =	3
-, year =	1982
-, pages =	"555--556"
-, update =	"97.11 bibrelex"
+, author =      "D. S. Hochbaum"
+, title =       "Approximation algorithms of the set covering and vertex cover problems"
+, journal =     "SIAM J. Comput."
+, volume =      11
+, number =      3
+, year =        1982
+, pages =       "555--556"
+, update =      "97.11 bibrelex"
 }
 
 @article{h-ebssv-83
-, author =	"Dorit S. Hochbaum"
-, title =	"Efficient Bounds for the Stable Set, Vertex Cover and Set Packing Problems"
-, journal =	"Discrete Appl. Math."
-, volume =	6
-, year =	1983
-, pages =	"243--254"
-, update =	"98.07 bibrelex"
+, author =      "Dorit S. Hochbaum"
+, title =       "Efficient Bounds for the Stable Set, Vertex Cover and Set Packing Problems"
+, journal =     "Discrete Appl. Math."
+, volume =      6
+, year =        1983
+, pages =       "243--254"
+, update =      "98.07 bibrelex"
 }
 
 @article{hm-ascpp-85
-, author =	"D. S. Hochbaum and W. Maas"
-, title =	"Approximation schemes for covering and packing problems in image processing and {VLSI}"
-, journal =	"J. ACM"
-, volume =	32
-, year =	1985
-, pages =	"130--136"
-, update =	"96.09 orourke"
+, author =      "D. S. Hochbaum and W. Maas"
+, title =       "Approximation schemes for covering and packing problems in image processing and {VLSI}"
+, journal =     "J. ACM"
+, volume =      32
+, year =        1985
+, pages =       "130--136"
+, update =      "96.09 orourke"
 }
 
 @techreport{hm-aacpp-84
-, author =	"D. S. Hochbaum and W. Maass"
-, title =	"Approximation algorithms for covering and packing problems in robotics"
-, type =	"Report"
-, number =	"??"
-, institution =	"Univ. California Berkeley"
-, address =	"Berkeley, CA"
-, year =	1984
-, update =	"94.01 rote"
+, author =      "D. S. Hochbaum and W. Maass"
+, title =       "Approximation algorithms for covering and packing problems in robotics"
+, type =        "Report"
+, number =      "??"
+, institution = "Univ. California Berkeley"
+, address =     "Berkeley, CA"
+, year =        1984
+, update =      "94.01 rote"
 }
 
 @article{hm-faanc-87
-, author =	"D. S. Hochbaum and W. Maass"
-, title =	"Fast approximation algorithms for a nonconvex covering problem"
-, journal =	"J. Algorithms"
-, volume =	8
-, year =	1987
-, pages =	"305--323"
-, update =	"94.01 rote"
+, author =      "D. S. Hochbaum and W. Maass"
+, title =       "Fast approximation algorithms for a nonconvex covering problem"
+, journal =     "J. Algorithms"
+, volume =      8
+, year =        1987
+, pages =       "305--323"
+, update =      "94.01 rote"
 }
 
 @article{hs-bphkc-85
-, author =	"D. S. Hochbaum and D. Shmoys"
-, title =	"A best possible heuristic for the $k$-center problem"
-, journal =	"Math. Oper. Res."
-, volume =	10
-, year =	1985
-, pages =	"180--184"
-, update =	"96.05 agarwal"
+, author =      "D. S. Hochbaum and D. Shmoys"
+, title =       "A best possible heuristic for the $k$-center problem"
+, journal =     "Math. Oper. Res."
+, volume =      10
+, year =        1985
+, pages =       "180--184"
+, update =      "96.05 agarwal"
 }
 
 @article{hs-uaaab-86
-, author =	"D. S. Hochbaum and D. Shmoys"
-, title =	"A unified approach to approximation algorithms for bottleneck problems"
-, journal =	"J. ACM"
-, volume =	33
-, year =	1986
-, pages =	"533--550"
-, update =	"96.05 agarwal"
+, author =      "D. S. Hochbaum and D. Shmoys"
+, title =       "A unified approach to approximation algorithms for bottleneck problems"
+, journal =     "J. ACM"
+, volume =      33
+, year =        1986
+, pages =       "533--550"
+, update =      "96.05 agarwal"
 }
 
 @article{hrb-sicm-93
-, author =	"R. J. Hocken and J. Raja and U. Babu"
-, title =	"Sampling issues in coordinate metrology"
-, journal =	"Manufacturing Review"
-, volume =	6
-, number =	4
-, year =	1993
-, pages =	"282--294"
-, update =	"97.03 agarwal"
+, author =      "R. J. Hocken and J. Raja and U. Babu"
+, title =       "Sampling issues in coordinate metrology"
+, journal =     "Manufacturing Review"
+, volume =      6
+, number =      4
+, year =        1993
+, pages =       "282--294"
+, update =      "97.03 agarwal"
 }
 
 @book{hy-t-61
-, author =	"J. G. Hocking and G. S. Young"
-, title =	"Topology"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1961
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "J. G. Hocking and G. S. Young"
+, title =       "Topology"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1961
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{h-sg-85
-, author =	"L. Hodes"
-, title =	"Sphere graphs"
-, type =	"Report"
-, number =	"??"
-, institution =	"National Cancer Inst."
-, address =	"Bethseda, MD"
-, year =	1985
+, author =      "L. Hodes"
+, title =       "Sphere graphs"
+, type =        "Report"
+, number =      "??"
+, institution = "National Cancer Inst."
+, address =     "Bethseda, MD"
+, year =        1985
 }
 
 @inproceedings{h-lcgpp-69
-, author =	"L. Hodes"
-, title =	"The logical complexity of geometric properties in the plane"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Theory Comput."
-, year =	1969
-, pages =	"249--254"
-, precedes =	"h-lcgpp-70"
+, author =      "L. Hodes"
+, title =       "The logical complexity of geometric properties in the plane"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Theory Comput."
+, year =        1969
+, pages =       "249--254"
+, precedes =    "h-lcgpp-70"
 }
 
 @article{h-lcgpp-70
-, author =	"L. Hodes"
-, title =	"The logical complexity of geometric properties in the plane"
-, journal =	"J. ACM"
-, volume =	17
-, year =	1970
-, pages =	"339--347"
-, succeeds =	"h-lcgpp-69"
+, author =      "L. Hodes"
+, title =       "The logical complexity of geometric properties in the plane"
+, journal =     "J. ACM"
+, volume =      17
+, year =        1970
+, pages =       "339--347"
+, succeeds =    "h-lcgpp-69"
 }
 
 @book{hp-mag-52
-, author =	"W. V. D. Hodge and D. Pedoe"
-, title =	"Methods of algebraic geometry"
-, publisher =	"Cambridge University Press"
-, year =	1952
-, update =	"97.11 bibrelex"
+, author =      "W. V. D. Hodge and D. Pedoe"
+, title =       "Methods of algebraic geometry"
+, publisher =   "Cambridge University Press"
+, year =        1952
+, update =      "97.11 bibrelex"
 }
 
 @article{hwbo-aha-95
-, author =	"J. K. Hodgins and W. L. Wooten and D. C. Brogan and J. F. O'Brien"
-, title =	"Animating human atheletics"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1995
-, pages =	"71--78"
-, note =	"Proc. SIGGRAPH"
-, update =	"97.11 bibrelex"
+, author =      "J. K. Hodgins and W. L. Wooten and D. C. Brogan and J. F. O'Brien"
+, title =       "Animating human atheletics"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1995
+, pages =       "71--78"
+, note =        "Proc. SIGGRAPH"
+, update =      "97.11 bibrelex"
 }
 
 @article{hr-cccph-93
-, author =	"C. D. Hodgson and I. Rivin"
-, title =	"A characterization of compact convex polyhedra in hyperbolic 3-space"
-, journal =	"Inventiones Mathematicae"
-, volume =	111
-, number =	1
-, month =	jan
-, year =	1993
-, pages =	"77--111"
-, update =	"98.11 bibrelex"
+, author =      "C. D. Hodgson and I. Rivin"
+, title =       "A characterization of compact convex polyhedra in hyperbolic 3-space"
+, journal =     "Inventiones Mathematicae"
+, volume =      111
+, number =      1
+, month =       jan
+, year =        1993
+, pages =       "77--111"
+, update =      "98.11 bibrelex"
 }
 
 @article{hrs-cchpc-92
-, author =	"C. D. Hodgson and I. Rivin and W. D. Smith"
-, title =	"A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere"
-, journal =	"Bull. (New Series) of the AMS"
-, volume =	27
-, number =	2
-, year =	1992
-, pages =	"246--251"
-, keywords =	"graph drawing, convex, 3D"
-, update =	"98.07 tamassia+vismara, 96.09 tamassia"
-, annote =	"Erratum in 28(1):213, 1993"
+, author =      "C. D. Hodgson and I. Rivin and W. D. Smith"
+, title =       "A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere"
+, journal =     "Bull. (New Series) of the AMS"
+, volume =      27
+, number =      2
+, year =        1992
+, pages =       "246--251"
+, keywords =    "graph drawing, convex, 3D"
+, update =      "98.07 tamassia+vismara, 96.09 tamassia"
+, annote =      "Erratum in 28(1):213, 1993"
 }
 
 @article{hrs-ecchpcpis-93
-, author =	"C. D. Hodgson and I. Rivin and W. D. Smith"
-, title =	"Erratum ({A} Characterization of Convex Hyperbolic Polyhedra and of Convex Polyhedra Inscribed in the Sphere)"
-, journal =	"Bull. Amer. Math. Soc. (New Series)"
-, volume =	28
-, number =	1
-, year =	1993
-, pages =	213
-, update =	"98.07 tamassia+vismara"
+, author =      "C. D. Hodgson and I. Rivin and W. D. Smith"
+, title =       "Erratum ({A} Characterization of Convex Hyperbolic Polyhedra and of Convex Polyhedra Inscribed in the Sphere)"
+, journal =     "Bull. Amer. Math. Soc. (New Series)"
+, volume =      28
+, number =      1
+, year =        1993
+, pages =       213
+, update =      "98.07 tamassia+vismara"
 }
 
 @techreport{hs-adpso-94
-, author =	"E. Hoel and H. Samet"
-, title =	"Algorithms for data-parallel spatial operations"
-, type =	"Computer Science Department"
-, number =	"CAR-TR-704"
-, institution =	"University of Maryland"
-, month =	feb
-, year =	1994
-, update =	"96.05 efrat"
+, author =      "E. Hoel and H. Samet"
+, title =       "Algorithms for data-parallel spatial operations"
+, type =        "Computer Science Department"
+, number =      "CAR-TR-704"
+, institution = "University of Maryland"
+, month =       feb
+, year =        1994
+, update =      "96.05 efrat"
 }
 
 @inproceedings{hs-dpsja-94
-, author =	"E. Hoel and H. Samet"
-, title =	"Data-Parallel Spatial Join Algorithms"
-, booktitle =	"Proc. 23rd Internat. Conf. Parallel Process."
-, site =	"St. Charles, Illinois"
-, month =	aug
-, year =	1994
-, pages =	"227--234"
-, update =	"96.05 efrat"
+, author =      "E. Hoel and H. Samet"
+, title =       "Data-Parallel Spatial Join Algorithms"
+, booktitle =   "Proc. 23rd Internat. Conf. Parallel Process."
+, site =        "St. Charles, Illinois"
+, month =       aug
+, year =        1994
+, pages =       "227--234"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{hs-pdpso-94
-, author =	"E. Hoel and H. Samet"
-, title =	"Performance of Data-Parallel Spatial Operations"
-, editor =	"J. Bocca and M. Jarke and C. Zaniolo"
-, booktitle =	"vldb94"
-, site =	"Santiago, Chile"
-, month =	sep
-, year =	1994
-, pages =	"156--167"
-, update =	"96.05 efrat"
+, author =      "E. Hoel and H. Samet"
+, title =       "Performance of Data-Parallel Spatial Operations"
+, editor =      "J. Bocca and M. Jarke and C. Zaniolo"
+, booktitle =   "vldb94"
+, site =        "Santiago, Chile"
+, month =       sep
+, year =        1994
+, pages =       "156--167"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{hs-qcsds-92
-, author =	"E. G. Hoel and H. Samet"
-, title =	"A qualitative comparison study of data structures for large line segment databases"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, site =	"San Diego"
-, year =	1992
-, pages =	"205--214"
-, update =	"97.07 agarwal, 96.05 efrat"
+, author =      "E. G. Hoel and H. Samet"
+, title =       "A qualitative comparison study of data structures for large line segment databases"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, site =        "San Diego"
+, year =        1992
+, pages =       "205--214"
+, update =      "97.07 agarwal, 96.05 efrat"
 }
 
 @inproceedings{hs-bsjos-95
-, author =	"E. G. Hoel and H. Samet"
-, title =	"Benchmarking Spatial Join Operations with Spatial Output"
-, editor =	"U. Dayal and P. M. D. Gray and S. Nishio"
-, booktitle =	"Proceedings of the Twenty First International Conference on Very Large Data Bases"
-, site =	"Zurich"
-, month =	sep
-, year =	1995
-, pages =	"606--618"
-, update =	"96.05 efrat"
+, author =      "E. G. Hoel and H. Samet"
+, title =       "Benchmarking Spatial Join Operations with Spatial Output"
+, editor =      "U. Dayal and P. M. D. Gray and S. Nishio"
+, booktitle =   "Proceedings of the Twenty First International Conference on Very Large Data Bases"
+, site =        "Zurich"
+, month =       sep
+, year =        1995
+, pages =       "606--618"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{hs-dppso-icpr-95
-, author =	"E. G. Hoel and H. Samet"
-, title =	"Data-Parallel Primitives for Spatial Operations"
-, booktitle =	"Proc. 24th Internat. Conf. Parallel Process."
-, site =	"Oconomowoc, WI"
-, volume =	3
-, month =	aug
-, year =	1995
-, pages =	"184--191"
-, update =	"96.05 efrat"
+, author =      "E. G. Hoel and H. Samet"
+, title =       "Data-Parallel Primitives for Spatial Operations"
+, booktitle =   "Proc. 24th Internat. Conf. Parallel Process."
+, site =        "Oconomowoc, WI"
+, volume =      3
+, month =       aug
+, year =        1995
+, pages =       "184--191"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{hs-dppso-camp-95
-, author =	"E. G. Hoel and H. Samet"
-, title =	"Data-Parallel Primitives for Spatial Operations Using PM Quadtrees"
-, editor =	"V. Cantoni and L. Lombardi and M. Mosconi and M. Savini and A. Setti"
-, booktitle =	"Proceedings of Computer Architectures for Machine Perception '95"
-, site =	"Como, Italy"
-, month =	sep
-, year =	1995
-, pages =	"266--273"
-, update =	"96.05 efrat"
+, author =      "E. G. Hoel and H. Samet"
+, title =       "Data-Parallel Primitives for Spatial Operations Using PM Quadtrees"
+, editor =      "V. Cantoni and L. Lombardi and M. Mosconi and M. Savini and A. Setti"
+, booktitle =   "Proceedings of Computer Architectures for Machine Perception '95"
+, site =        "Como, Italy"
+, month =       sep
+, year =        1995
+, pages =       "266--273"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{hs-dprta-93
-, author =	"E. G. Hoel and H. Samet"
-, title =	"Data-Parallel R-tree Algorithms"
-, booktitle =	"Proc. 22nd Internat. Conf. Parallel Process."
-, nickname =	"ICPP '93"
-, site =	"St. Charles, IL"
-, month =	aug
-, year =	1993
-, pages =	"47--50"
-, update =	"98.07 bibrelex, 96.05 efrat"
+, author =      "E. G. Hoel and H. Samet"
+, title =       "Data-Parallel R-tree Algorithms"
+, booktitle =   "Proc. 22nd Internat. Conf. Parallel Process."
+, nickname =    "ICPP '93"
+, site =        "St. Charles, IL"
+, month =       aug
+, year =        1993
+, pages =       "47--50"
+, update =      "98.07 bibrelex, 96.05 efrat"
 }
 
 @incollection{hs-epsql-91
-, author =	"E. G. Hoel and H. Samet"
-, title =	"Efficient processing of spatial queries in line segment databases"
-, editor =	"O. G{\"u}nther and H. J. Schek"
-, booktitle =	"Proc. 2rd Sympos. Advances in Spatial Databases"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1991
-, pages =	"237--256"
-, comments =	"also Lecture Notes in Computer Science 525"
-, update =	"96.09 agarwal, 96.05 efrat"
+, author =      "E. G. Hoel and H. Samet"
+, title =       "Efficient processing of spatial queries in line segment databases"
+, editor =      "O. G{\"u}nther and H. J. Schek"
+, booktitle =   "Proc. 2rd Sympos. Advances in Spatial Databases"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1991
+, pages =       "237--256"
+, comments =    "also Lecture Notes in Computer Science 525"
+, update =      "96.09 agarwal, 96.05 efrat"
 }
 
 @inproceedings{hkf-dsc-96
-, author =	"Werner Hoelbling and Werner Kuhn and Andrew U. Frank"
-, title =	"Discrete Simplicial Complexes"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	69
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Werner Hoelbling and Werner Kuhn and Andrew U. Frank"
+, title =       "Discrete Simplicial Complexes"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       69
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{hcklm-fcgvd-00
-, author =	"Kenneth E. {Hoff III} and Tim Culver and John Keyser and Ming Lin and Dinesh Manocha"
-, title =	"Fast Computation of Generalized {Voronoi} Diagrams Using Graphics Hardware"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"375--376"
-, keywords =	"video review"
-, update =	"00.11 jones"
+, author =      "Kenneth E. {Hoff III} and Tim Culver and John Keyser and Ming Lin and Dinesh Manocha"
+, title =       "Fast Computation of Generalized {Voronoi} Diagrams Using Graphics Hardware"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "375--376"
+, keywords =    "video review"
+, update =      "00.11 jones"
 }
 
 @article{h-bchn-79
-, author =	"A. J. Hoffman"
-, title =	"Binding constraints and {Helly} numbers"
-, journal =	"Ann. New York Acad. Sci."
-, volume =	319
-, year =	1979
-, pages =	"284--288"
-, update =	"98.03 bibrelex"
+, author =      "A. J. Hoffman"
+, title =       "Binding constraints and {Helly} numbers"
+, journal =     "Ann. New York Acad. Sci."
+, volume =      319
+, year =        1979
+, pages =       "284--288"
+, update =      "98.03 bibrelex"
 }
 
 @article{hl-cnc-86
-, author =	"A. J. Hoffman and C. W. Lee"
-, title =	"On the cone of nonnegative circuits"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"229--239"
+, author =      "A. J. Hoffman and C. W. Lee"
+, title =       "On the cone of nonnegative circuits"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "229--239"
 }
 
 @article{hh-gpbs-88
-, author =	"C. Hoffman and J. Hopcroft"
-, title =	"The geometry of projective blending surfaces"
-, journal =	"Artif. Intell."
-, volume =	37
-, year =	1988
-, pages =	"357--376"
-, update =	"98.07 bibrelex"
+, author =      "C. Hoffman and J. Hopcroft"
+, title =       "The geometry of projective blending surfaces"
+, journal =     "Artif. Intell."
+, volume =      37
+, year =        1988
+, pages =       "357--376"
+, update =      "98.07 bibrelex"
 }
 
 @book{h-mf-87
-, author =	"E. G. Hoffman"
-, title =	"Modular Fixturing"
-, publisher =	"Manufacturing Technology Press"
-, address =	"Lake Geneva, Wisconsin"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "E. G. Hoffman"
+, title =       "Modular Fixturing"
+, publisher =   "Manufacturing Technology Press"
+, address =     "Lake Geneva, Wisconsin"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{h-dpsi-90
-, author =	"C. Hoffmann"
-, title =	"A dimensionality paradigm for surface interrogations"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	7
-, number =	6
-, year =	1990
-, pages =	"517--532"
-, update =	"98.07 bibrelex"
+, author =      "C. Hoffmann"
+, title =       "A dimensionality paradigm for surface interrogations"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      7
+, number =      6
+, year =        1990
+, pages =       "517--532"
+, update =      "98.07 bibrelex"
 }
 
 @book{h-gsm-89
-, author =	"C. Hoffmann"
-, title =	"Geometric and Solid Modeling"
-, publisher =	"Morgan-Kaufmann"
-, address =	"San Mateo, CA"
-, year =	1989
-, update =	"97.03 schwarzkopf, 93.05 orourke"
+, author =      "C. Hoffmann"
+, title =       "Geometric and Solid Modeling"
+, publisher =   "Morgan-Kaufmann"
+, address =     "San Mateo, CA"
+, year =        1989
+, update =      "97.03 schwarzkopf, 93.05 orourke"
 }
 
 @article{hh-asgca-85a
-, author =	"C. Hoffmann and J. Hopcroft"
-, title =	"Automatic Surface Generation in Computer Aided Design"
-, journal =	"Visual Comput."
-, volume =	1
-, number =	2
-, year =	1985
-, pages =	"92--100"
-, update =	"98.03 bibrelex"
+, author =      "C. Hoffmann and J. Hopcroft"
+, title =       "Automatic Surface Generation in Computer Aided Design"
+, journal =     "Visual Comput."
+, volume =      1
+, number =      2
+, year =        1985
+, pages =       "92--100"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{hh-gabr-86
-, author =	"C. Hoffmann and J. Hopcroft"
-, title =	"Geometric Ambiguities in Boundary Representation"
-, number =	"86-725"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "C. Hoffmann and J. Hopcroft"
+, title =       "Geometric Ambiguities in Boundary Representation"
+, number =      "86-725"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @techreport{h-ac-85
-, author =	"C. M. Hoffmann"
-, title =	"Algebraic Curves"
-, number =	"CSD-TR-675"
-, institution =	"Computer Science Department, Purdue University"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "C. M. Hoffmann"
+, title =       "Algebraic Curves"
+, number =      "CSD-TR-675"
+, institution = "Computer Science Department, Purdue University"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @techreport{h-cvdgc-91
-, author =	"C. M. Hoffmann"
-, title =	"Computer Vision, Descriptive Geometry, and Classical Mechanics"
-, number =	"CSD-TR-91-073"
-, institution =	"Purdue University, CS Dept., West Lafayette, IN 47907, USA"
-, month =	oct
-, year =	1991
-, keywords =	"skeleton, Voronoi diagram, offsetting"
-, update =	"93.09 held"
+, author =      "C. M. Hoffmann"
+, title =       "Computer Vision, Descriptive Geometry, and Classical Mechanics"
+, number =      "CSD-TR-91-073"
+, institution = "Purdue University, CS Dept., West Lafayette, IN 47907, USA"
+, month =       oct
+, year =        1991
+, keywords =    "skeleton, Voronoi diagram, offsetting"
+, update =      "93.09 held"
 }
 
 @techreport{h-gamg-93
-, author =	"C. M. Hoffmann"
-, title =	"Geometric Approaches to Mesh Generation"
-, number =	"CSD-TR-93-053"
-, institution =	"CS Dept., Purdue U., West Lafayette, IN 48907, USA"
-, month =	aug
-, year =	1993
-, update =	"95.01 held"
+, author =      "C. M. Hoffmann"
+, title =       "Geometric Approaches to Mesh Generation"
+, number =      "CSD-TR-93-053"
+, institution = "CS Dept., Purdue U., West Lafayette, IN 48907, USA"
+, month =       aug
+, year =        1993
+, update =      "95.01 held"
 }
 
 @inproceedings{h-hsism-96
-, author =	"C. M. Hoffmann"
-, title =	"How solid is solid modeling?"
-, editor =	"M. C. Lina and D. Manocha"
-, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1148
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"1--8"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "C. M. Hoffmann"
+, title =       "How solid is solid modeling?"
+, editor =      "M. C. Lina and D. Manocha"
+, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1148
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "1--8"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{h-hcsco-90t
-, author =	"C. M. Hoffmann"
-, title =	"How to Construct the Skeleton of {CSG} Objects"
-, type =	"Technical Report"
-, number =	"CSD-TR-1014"
-, institution =	"CS Dept., Purdue Univ."
-, address =	"West Lafayette, IN 47907, USA"
-, month =	sep
-, year =	1990
-, precedes =	"h-hcsco-90"
-, update =	"98.11 bibrelex"
+, author =      "C. M. Hoffmann"
+, title =       "How to Construct the Skeleton of {CSG} Objects"
+, type =        "Technical Report"
+, number =      "CSD-TR-1014"
+, institution = "CS Dept., Purdue Univ."
+, address =     "West Lafayette, IN 47907, USA"
+, month =       sep
+, year =        1990
+, precedes =    "h-hcsco-90"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{h-hcsco-90
-, author =	"C. M. Hoffmann"
-, title =	"How to Construct the Skeleton of {CSG} Objects"
-, booktitle =	"Proc. 4th IMA Conf. on The Mathematics of Surfaces"
-, publisher =	"Oxford University Press"
-, address =	"Bath, UK"
-, year =	1990
-, pages =	"??"
-, succeeds =	"h-hcsco-90t"
-, update =	"98.11 bibrelex, 93.09 held"
+, author =      "C. M. Hoffmann"
+, title =       "How to Construct the Skeleton of {CSG} Objects"
+, booktitle =   "Proc. 4th IMA Conf. on The Mathematics of Surfaces"
+, publisher =   "Oxford University Press"
+, address =     "Bath, UK"
+, year =        1990
+, pages =       "??"
+, succeeds =    "h-hcsco-90t"
+, update =      "98.11 bibrelex, 93.09 held"
 }
 
 @inproceedings{h-sggr-93
-, author =	"C. M. Hoffmann"
-, title =	"On semantics of generative geometry representations"
-, booktitle =	"Proc. 19th ASME Design Automation Conference"
-, year =	1993
-, pages =	"411--420"
-, update =	"98.07 bibrelex"
+, author =      "C. M. Hoffmann"
+, title =       "On semantics of generative geometry representations"
+, booktitle =   "Proc. 19th ASME Design Automation Conference"
+, year =        1993
+, pages =       "411--420"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{h-sm-97
-, author =	"C. M. Hoffmann"
-, title =	"Solid modeling"
-, chapter =	47
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"863--880"
-, update =	"97.11 orourke"
+, author =      "C. M. Hoffmann"
+, title =       "Solid modeling"
+, chapter =     47
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "863--880"
+, update =      "97.11 orourke"
 }
 
 @techreport{h-pargc-88
-, author =	"C. M. Hoffmann"
-, title =	"The problem of accuracy and robustness in geometric computation"
-, type =	"Report"
-, number =	"CSD-TR-771"
-, institution =	"Dept. Comput. Sci., Purdue Univ."
-, address =	"West Lafayette, IN"
-, year =	1988
+, author =      "C. M. Hoffmann"
+, title =       "The problem of accuracy and robustness in geometric computation"
+, type =        "Report"
+, number =      "CSD-TR-771"
+, institution = "Dept. Comput. Sci., Purdue Univ."
+, address =     "West Lafayette, IN"
+, year =        1988
 }
 
 @article{h-pargc-89
-, author =	"C. M. Hoffmann"
-, title =	"The Problems of Accuracy and Robustness in Geometric Computation"
-, journal =	"IEEE Computer"
-, volume =	22
-, number =	3
-, month =	mar
-, year =	1989
-, pages =	"31--41"
-, keywords =	"numerical precision, stability, robustness"
-, update =	"93.09 held"
+, author =      "C. M. Hoffmann"
+, title =       "The Problems of Accuracy and Robustness in Geometric Computation"
+, journal =     "IEEE Computer"
+, volume =      22
+, number =      3
+, month =       mar
+, year =        1989
+, pages =       "31--41"
+, keywords =    "numerical precision, stability, robustness"
+, update =      "93.09 held"
 }
 
 @techreport{hh-asgca-85t
-, author =	"C. M. Hoffmann and J. E. Hopcroft"
-, title =	"Automatic Surface Generation in Computer Aided Design"
-, number =	"85-661"
-, institution =	"Cornell University, Computer Science Department"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "C. M. Hoffmann and J. E. Hopcroft"
+, title =       "Automatic Surface Generation in Computer Aided Design"
+, number =      "85-661"
+, institution = "Cornell University, Computer Science Department"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @techreport{hh-qbs-85
-, author =	"C. M. Hoffmann and J. E. Hopcroft"
-, title =	"Quadratic Blending Surfaces"
-, number =	"85-647"
-, institution =	"Cornell University, Computer Science Department"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "C. M. Hoffmann and J. E. Hopcroft"
+, title =       "Quadratic Blending Surfaces"
+, number =      "85-647"
+, institution = "Cornell University, Computer Science Department"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @article{hh-qbs-86
-, author =	"C. M. Hoffmann and J. E. Hopcroft"
-, title =	"Quadratic blending surfaces"
-, journal =	"Comput. Aided Design"
-, volume =	18
-, number =	6
-, year =	1986
-, pages =	"301--306"
-, update =	"98.03 bibrelex"
+, author =      "C. M. Hoffmann and J. E. Hopcroft"
+, title =       "Quadratic blending surfaces"
+, journal =     "Comput. Aided Design"
+, volume =      18
+, number =      6
+, year =        1986
+, pages =       "301--306"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{hh-pmbsc-85
-, author =	"C. M. Hoffmann and J. E. Hopcroft"
-, title =	"The potential method for blending surfaces and corners"
-, number =	"85-699"
-, institution =	"Cornell University, Computer Science Department"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "C. M. Hoffmann and J. E. Hopcroft"
+, title =       "The potential method for blending surfaces and corners"
+, number =      "85-699"
+, institution = "Cornell University, Computer Science Department"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{hhk-tirgc-88
-, author =	"C. M. Hoffmann and J. E. Hopcroft and M. S. Karasick"
-, title =	"Towards implementing robust geometric computations"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"106--117"
-, cites =	"d-cugr-86, eos-calha-86, gl-mc-83, gy-frcg-86, hhk-rsops-87, k-rmrs-89, l-ccsda-85, m-vigau-86i, otu-nsga-87, s-aefsm-87t, s-fprgo-87, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "C. M. Hoffmann and J. E. Hopcroft and M. S. Karasick"
+, title =       "Towards implementing robust geometric computations"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "106--117"
+, cites =       "d-cugr-86, eos-calha-86, gl-mc-83, gy-frcg-86, hhk-rsops-87, k-rmrs-89, l-ccsda-85, m-vigau-86i, otu-nsga-87, s-aefsm-87t, s-fprgo-87, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{hhk-rsops-87
-, author =	"C. M. Hoffmann and J. E. Hopcroft and M. T. Karasick"
-, title =	"Robust Set Operations on Polyhedral Solids"
-, number =	"87-875"
-, institution =	"Cornell University, Computer Science Department"
-, address =	"Ithaca, New York"
-, month =	oct
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "C. M. Hoffmann and J. E. Hopcroft and M. T. Karasick"
+, title =       "Robust Set Operations on Polyhedral Solids"
+, number =      "87-875"
+, institution = "Cornell University, Computer Science Department"
+, address =     "Ithaca, New York"
+, month =       oct
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{hhk-rsops-89
-, author =	"C. M. Hoffmann and J. E. Hopcroft and M. T. Karasick"
-, title =	"Robust Set Operations on Polyhedral Solids"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	9
-, number =	6
-, month =	nov
-, year =	1989
-, pages =	"50--59"
-, keywords =	"numerical precision, stability, robustness"
-, update =	"93.09 held"
+, author =      "C. M. Hoffmann and J. E. Hopcroft and M. T. Karasick"
+, title =       "Robust Set Operations on Polyhedral Solids"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      9
+, number =      6
+, month =       nov
+, year =        1989
+, pages =       "50--59"
+, keywords =    "numerical precision, stability, robustness"
+, update =      "93.09 held"
 }
 
 @article{hr-rmsm-96
-, author =	"C. M. Hoffmann and J. R. Rossignac"
-, title =	"A Road Map to Solid Modeling"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	2
-, number =	1
-, month =	mar
-, year =	1996
-, pages =	"3--10"
-, update =	"96.09 held"
+, author =      "C. M. Hoffmann and J. R. Rossignac"
+, title =       "A Road Map to Solid Modeling"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      2
+, number =      1
+, month =       mar
+, year =        1996
+, pages =       "3--10"
+, update =      "96.09 held"
 }
 
 @article{hv-ftgsm-91
-, author =	"C. M. Hoffmann and G. Van{\v e}{\v c}ek"
-, title =	"Fundamental Techniques for Geometric and Solid Modeling"
-, journal =	"Control and Dynamic Systems"
-, volume =	48
-, year =	1991
-, pages =	"101--165"
-, keywords =	"skeleton, Voronoi diagram, offsetting"
-, update =	"93.09 held"
+, author =      "C. M. Hoffmann and G. Van{\v e}{\v c}ek"
+, title =       "Fundamental Techniques for Geometric and Solid Modeling"
+, journal =     "Control and Dynamic Systems"
+, volume =      48
+, year =        1991
+, pages =       "101--165"
+, keywords =    "skeleton, Voronoi diagram, offsetting"
+, update =      "93.09 held"
 }
 
 @inproceedings{hv-scp-95
-, author =	"C. M. Hoffmann and P. J. Vermeer"
-, title =	"A spatial constraint problem"
-, booktitle =	"Computational Kinematics Workshop"
-, site =	"Nice, France"
-, month =	sep
-, year =	1995
-, update =	"98.07 bibrelex"
+, author =      "C. M. Hoffmann and P. J. Vermeer"
+, title =       "A spatial constraint problem"
+, booktitle =   "Computational Kinematics Workshop"
+, site =        "Nice, France"
+, month =       sep
+, year =        1995
+, update =      "98.07 bibrelex"
 }
 
 @article{hv-eescs-91
-, author =	"C. M. Hoffmann and P. J. Vermeer"
-, title =	"Eliminating extraneous solutions in curve and surface operations"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, year =	1991
-, pages =	"47--66 and 345"
-, keywords =	"geometric modeling, faithful problem formulation, offsets, blends, equidistance surfaces, extraneous solutions"
-, precedes =	"hv-eeesc-91"
-, update =	"96.09 devillers"
+, author =      "C. M. Hoffmann and P. J. Vermeer"
+, title =       "Eliminating extraneous solutions in curve and surface operations"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, year =        1991
+, pages =       "47--66 and 345"
+, keywords =    "geometric modeling, faithful problem formulation, offsets, blends, equidistance surfaces, extraneous solutions"
+, precedes =    "hv-eeesc-91"
+, update =      "96.09 devillers"
 }
 
 @article{hv-eeesc-91
-, author =	"C. M. Hoffmann and P. J. Vermeer"
-, title =	"Erratum --- Eliminating extraneous solutions in curve and surface operations"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, year =	1991
-, pages =	345
-, succeeds =	"hv-eescs-91"
+, author =      "C. M. Hoffmann and P. J. Vermeer"
+, title =       "Erratum --- Eliminating extraneous solutions in curve and surface operations"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, year =        1991
+, pages =       345
+, succeeds =    "hv-eescs-91"
 }
 
 @incollection{hv-gcsr2-95
-, author =	"Christoph M. Hoffmann and Pamela J. Vermeer"
-, title =	"Geometric Constraint Solving in {$\Re^2$} and {$\Re^3$}"
-, editor =	"Ding-Zhu Du and Frank Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1995
-, pages =	"266--298"
-, keywords =	"survey paper"
-, update =	"98.07 icking"
+, author =      "Christoph M. Hoffmann and Pamela J. Vermeer"
+, title =       "Geometric Constraint Solving in {$\Re^2$} and {$\Re^3$}"
+, editor =      "Ding-Zhu Du and Frank Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1995
+, pages =       "266--298"
+, keywords =    "survey paper"
+, update =      "98.07 icking"
 }
 
 @inproceedings{h-ragp-90
-, author =	"Frank Hoffmann"
-, title =	"On the Rectilinear Art Gallery Problem"
-, booktitle =	"Proc. 17th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	443
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"717--728"
-, update =	"94.05 devillers, 93.09 milone+mitchell"
+, author =      "Frank Hoffmann"
+, title =       "On the Rectilinear Art Gallery Problem"
+, booktitle =   "Proc. 17th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      443
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "717--728"
+, update =      "94.05 devillers, 93.09 milone+mitchell"
 }
 
 @inproceedings{hikk-cslp-97
-, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
-, title =	"A Competitive Strategy for Learning a Polygon"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1997
-, pages =	"166--174"
-, succeeds =	"hikk-ecslp-96"
-, update =	"97.03 icking"
+, author =      "Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
+, title =       "A Competitive Strategy for Learning a Polygon"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1997
+, pages =       "166--174"
+, succeeds =    "hikk-ecslp-96"
+, update =      "97.03 icking"
 }
 
 @techreport{hikk-ecslp-96
-, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
-, title =	"An Efficient Competitive Strategy for Learning a Polygon"
-, number =	"B 96--01"
-, institution =	"Freie Universit{\"a}t Berlin, Fachbereich Mathematik"
-, year =	1996
-, precedes =	"hikk-cslp-97"
-, update =	"97.03 icking"
+, author =      "Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
+, title =       "An Efficient Competitive Strategy for Learning a Polygon"
+, number =      "B 96--01"
+, institution = "Freie Universit{\"a}t Berlin, Fachbereich Mathematik"
+, year =        1996
+, precedes =    "hikk-cslp-97"
+, update =      "97.03 icking"
 }
 
 @inproceedings{hikk-ecslp-96c
-, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
-, title =	"An Efficient Competitive Strategy for Learning a Polygon"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"107--108"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
+, title =       "An Efficient Competitive Strategy for Learning a Polygon"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "107--108"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @techreport{hikk-maar-97
-, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
-, title =	"Moving an Angle Around a Region"
-, type =	"Manuscript"
-, institution =	"FernUniversit{\"a}t Hagen"
-, address =	"Hagen, Germany"
-, year =	1997
-, precedes =	"hikk-maar-98"
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
+, title =       "Moving an Angle Around a Region"
+, type =        "Manuscript"
+, institution = "FernUniversit{\"a}t Hagen"
+, address =     "Hagen, Germany"
+, year =        1997
+, precedes =    "hikk-maar-98"
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{hikk-maar-98
-, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
-, title =	"Moving an Angle Around a Region"
-, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '98"
-, site =	"Stockholm"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1432
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"71--82"
-, succeeds =	"hikk-maar-97"
-, update =	"98.11 bibrelex, 98.07 icking+mitchell"
+, author =      "Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
+, title =       "Moving an Angle Around a Region"
+, booktitle =   "Proc. 6th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '98"
+, site =        "Stockholm"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1432
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "71--82"
+, succeeds =    "hikk-maar-97"
+, update =      "98.11 bibrelex, 98.07 icking+mitchell"
 }
 
 @article{hikk-pep-01
-, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
-, title =	"The Polygon Exploration Problem"
-, journal =	"SIAM J. Comput."
-, volume =	31
-, year =	2001
-, pages =	"577--600"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/hikk-pep-01.pdf"
-, cites =	"aaiklr-gsac-98p, aks-eueo-99, afm-aalmm-97, b-olsn-98, brs-nugt-97, cj-cswps-95, cjn-fswrs-93, co-rpwdu-00, cn-wrsp-91, bghosst-rgdu-95, dkp-hlue-91, dkp-hlue1-98, fw-ola-98, hn-ctbes-97, hikk-cslp-97, hikk-maar-98, hikk-pepns-98, ik-skpcs-95, ikl-ocsws-99, ikm-hlac-93, m-gspno-00, n-wrlv-90, rksi-rnut-93, r-cic-94, su-hcg-00, st-aelup-85, th-cswrd-93, thi-ciacs-99, ZZZ"
-, update =	"02.03 icking, 01.07 icking, 01.04 icking"
+, author =      "Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
+, title =       "The Polygon Exploration Problem"
+, journal =     "SIAM J. Comput."
+, volume =      31
+, year =        2001
+, pages =       "577--600"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/hikk-pep-01.pdf"
+, cites =       "aaiklr-gsac-98p, aks-eueo-99, afm-aalmm-97, b-olsn-98, brs-nugt-97, cj-cswps-95, cjn-fswrs-93, co-rpwdu-00, cn-wrsp-91, bghosst-rgdu-95, dkp-hlue-91, dkp-hlue1-98, fw-ola-98, hn-ctbes-97, hikk-cslp-97, hikk-maar-98, hikk-pepns-98, ik-skpcs-95, ikl-ocsws-99, ikm-hlac-93, m-gspno-00, n-wrlv-90, rksi-rnut-93, r-cic-94, su-hcg-00, st-aelup-85, th-cswrd-93, thi-ciacs-99, ZZZ"
+, update =      "02.03 icking, 01.07 icking, 01.04 icking"
 }
 
 @inproceedings{hikk-pepns-98
-, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
-, title =	"The Polygon Exploration Problem: A New Strategy and a New Analysis Technique"
-, booktitle =	"Robotics: The Algorithmic Perspective, Proc. 3rd Workshop Algorithmic Found. Robot."
-, nickname =	"WAFR '98"
-, site =	"Houston"
-, publisher =	"A. K. Peters"
-, year =	1998
-, pages =	"211--222"
-, comments =	"Utilizes result in \cite{hikk-maar-98}"
-, update =	"99.03 bibrelex, 98.11 bibrelex, 98.07 bibrelex+icking, 98.03 icking+mitchell"
+, author =      "Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
+, title =       "The Polygon Exploration Problem: A New Strategy and a New Analysis Technique"
+, booktitle =   "Robotics: The Algorithmic Perspective, Proc. 3rd Workshop Algorithmic Found. Robot."
+, nickname =    "WAFR '98"
+, site =        "Houston"
+, publisher =   "A. K. Peters"
+, year =        1998
+, pages =       "211--222"
+, comments =    "Utilizes result in \cite{hikk-maar-98}"
+, update =      "99.03 bibrelex, 98.11 bibrelex, 98.07 bibrelex+icking, 98.03 icking+mitchell"
 }
 
 @techreport{hikk-pep1c-98
-, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
-, title =	"The Polygon Exploration Problem {I}: A Competitive Strategy"
-, number =	241
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1998
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr241.pdf"
-, update =	"98.11 bibrelex"
+, author =      "Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
+, title =       "The Polygon Exploration Problem {I}: A Competitive Strategy"
+, number =      241
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1998
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr241.pdf"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{hikk-pep2a-98
-, author =	"Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
-, title =	"The Polygon Exploration Problem {II}: The Angle Hull"
-, number =	245
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1998
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr245.pdf"
-, update =	"99.03 bibrelex"
+, author =      "Frank Hoffmann and Christian Icking and Rolf Klein and Klaus Kriegel"
+, title =       "The Polygon Exploration Problem {II}: The Angle Hull"
+, number =      245
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1998
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr245.pdf"
+, update =      "99.03 bibrelex"
 }
 
 @inproceedings{hkk-agtph-91
-, author =	"F. Hoffmann and M. Kaufmann and K. Kriegel"
-, title =	"The art gallery theorem for polygons with holes"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"39--48"
+, author =      "F. Hoffmann and M. Kaufmann and K. Kriegel"
+, title =       "The art gallery theorem for polygons with holes"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "39--48"
 }
 
 @inproceedings{hk-gcric-93
-, author =	"Frank Hoffmann and Klaus Kriegel"
-, title =	"A Graph Coloring Result and Its Consequences for some Guarding Problems"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"78--87"
-, update =	"98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
+, author =      "Frank Hoffmann and Klaus Kriegel"
+, title =       "A Graph Coloring Result and Its Consequences for some Guarding Problems"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "78--87"
+, update =      "98.07 bibrelex, 94.05 devillers+smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{hk-dpmc-93
-, author =	"Frank Hoffmann and Klaus Kriegel"
-, title =	"Dominating Polygons by Many Colors"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Frank Hoffmann and Klaus Kriegel"
+, title =       "Dominating Polygons by Many Colors"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @article{hk-ertlt-88
-, author =	"F. Hoffmann and K. Kriegel"
-, title =	"Embedding Rectilinear Graphs in Linear Time"
-, journal =	"Inform. Process. Lett."
-, volume =	29
-, year =	1988
-, pages =	"75--79"
-, update =	"99.03 vismara"
+, author =      "F. Hoffmann and K. Kriegel"
+, title =       "Embedding Rectilinear Graphs in Linear Time"
+, journal =     "Inform. Process. Lett."
+, volume =      29
+, year =        1988
+, pages =       "75--79"
+, update =      "99.03 vismara"
 }
 
 @inproceedings{hkw-gapi2-99
-, author =	"Frank Hoffmann and Klaus Kriegel and Carola Wenk"
-, title =	"A Geometric Approach to Protein Identification in {2D} Electrophoretic Gel Images"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"173--174"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Frank Hoffmann and Klaus Kriegel and Carola Wenk"
+, title =       "A Geometric Approach to Protein Identification in {2D} Electrophoretic Gel Images"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "173--174"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{hkw-natc2-98
-, author =	"Frank Hoffmann and Klaus Kriegel and Carola Wenk"
-, title =	"New Algorithmic Tools for Comparing {2D} Patterns of Protein Spots"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"93--95"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Frank Hoffmann and Klaus Kriegel and Carola Wenk"
+, title =       "New Algorithmic Tools for Comparing {2D} Patterns of Protein Spots"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "93--95"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{hm-ilsp-84
-, author =	"K. Hoffmann and K. Mehlhorn"
-, title =	"Intersecting a line and a simple polygon"
-, journal =	"Bull. EATCS"
-, volume =	22
-, month =	feb
-, year =	1984
-, pages =	"120--121"
-, update =	"97.11 bibrelex"
+, author =      "K. Hoffmann and K. Mehlhorn"
+, title =       "Intersecting a line and a simple polygon"
+, journal =     "Bull. EATCS"
+, volume =      22
+, month =       feb
+, year =        1984
+, pages =       "120--121"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{hmrt-sjslt-85
-, author =	"K. Hoffmann and K. Mehlhorn and P. Rosenstiehl and R. E. Tarjan"
-, title =	"Sorting {Jordan} sequences in linear time"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"196--203"
-, precedes =	"hmrt-sjslt-86"
-, cites =	"bt-dadsr-80, e-pp-83, f-hgiit-76, hm-ilsp-84, hm-ndsrs-82, ms-hbt-81, m-ss-84, r-ppdti-84, t-acc-85, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "K. Hoffmann and K. Mehlhorn and P. Rosenstiehl and R. E. Tarjan"
+, title =       "Sorting {Jordan} sequences in linear time"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "196--203"
+, precedes =    "hmrt-sjslt-86"
+, cites =       "bt-dadsr-80, e-pp-83, f-hgiit-76, hm-ilsp-84, hm-ndsrs-82, ms-hbt-81, m-ss-84, r-ppdti-84, t-acc-85, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{hmrt-sjslt-86
-, author =	"K. Hoffmann and K. Mehlhorn and P. Rosenstiehl and R. E. Tarjan"
-, title =	"Sorting {Jordan} sequences in linear time using level-linked search trees"
-, journal =	"Inform. Control"
-, volume =	68
-, year =	1986
-, pages =	"170--184"
-, succeeds =	"hmrt-sjslt-85"
+, author =      "K. Hoffmann and K. Mehlhorn and P. Rosenstiehl and R. E. Tarjan"
+, title =       "Sorting {Jordan} sequences in linear time using level-linked search trees"
+, journal =     "Inform. Control"
+, volume =      68
+, year =        1986
+, pages =       "170--184"
+, succeeds =    "hmrt-sjslt-85"
 }
 
 @inproceedings{h-cpfr-01
-, author =	"Michael Hoffmann"
-, title =	"Covering Polygons with Few Rectangles"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"39--42"
-, update =	"01.04 icking"
+, author =      "Michael Hoffmann"
+, title =       "Covering Polygons with Few Rectangles"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "39--42"
+, update =      "01.04 icking"
 }
 
 @article{h-wirt-90
-, author =	"Georg R. Hofmann"
-, title =	"Who Invented Ray Tracing?"
-, journal =	"Visual Comput."
-, volume =	6
-, number =	3
-, month =	jun
-, year =	1990
-, pages =	"120--4"
+, author =      "Georg R. Hofmann"
+, title =       "Who Invented Ray Tracing?"
+, journal =     "Visual Comput."
+, volume =      6
+, number =      3
+, month =       jun
+, year =        1990
+, pages =       "120--4"
 }
 
 @techreport{h-ffpsd1-75
-, author =	"B. van Hohenbalken"
-, title =	"Finding faces of polytopes by simplicial decomposition, {Part} {I}: vertices and edges"
-, type =	"Report"
-, number =	24
-, institution =	"Dept. Econom., Univ. Alberta"
-, address =	"Edmonton, AB"
-, year =	1975
+, author =      "B. van Hohenbalken"
+, title =       "Finding faces of polytopes by simplicial decomposition, {Part} {I}: vertices and edges"
+, type =        "Report"
+, number =      24
+, institution = "Dept. Econom., Univ. Alberta"
+, address =     "Edmonton, AB"
+, year =        1975
 }
 
 @techreport{h-ffpsd2-75
-, author =	"B. van Hohenbalken"
-, title =	"Finding faces of polytopes by simplicial decomposition, {Part} {II}: higher-dimensional faces"
-, type =	"Report"
-, number =	25
-, institution =	"Dept. Econom., Univ. Alberta"
-, address =	"Edmonton, AB"
-, year =	1975
+, author =      "B. van Hohenbalken"
+, title =       "Finding faces of polytopes by simplicial decomposition, {Part} {II}: higher-dimensional faces"
+, type =        "Report"
+, number =      25
+, institution = "Dept. Econom., Univ. Alberta"
+, address =     "Edmonton, AB"
+, year =        1975
 }
 
 @article{h-fssp-81
-, author =	"B. van Hohenbalken"
-, title =	"Finding simplicial subdivisions of polytopes"
-, journal =	"Math. Program."
-, volume =	21
-, year =	1981
-, pages =	"233--234"
+, author =      "B. van Hohenbalken"
+, title =       "Finding simplicial subdivisions of polytopes"
+, journal =     "Math. Program."
+, volume =      21
+, year =        1981
+, pages =       "233--234"
 }
 
 @article{h-ldmsp-78
-, author =	"B. van Hohenbalken"
-, title =	"Least distance methods for the scheme of polytopes"
-, journal =	"Math. Program."
-, volume =	15
-, year =	1978
-, pages =	"1--11"
+, author =      "B. van Hohenbalken"
+, title =       "Least distance methods for the scheme of polytopes"
+, journal =     "Math. Program."
+, volume =      15
+, year =        1978
+, pages =       "1--11"
 }
 
 @inproceedings{hc-faobg-95
-, author =	"Michael Hohmeyer and Wayne Christopher"
-, title =	"Fully-Automated Object-Based Generation of Hexahedral Meshes"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"129--139"
-, update =	"96.01 samitchell"
+, author =      "Michael Hohmeyer and Wayne Christopher"
+, title =       "Fully-Automated Object-Based Generation of Hexahedral Meshes"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "129--139"
+, update =      "96.01 samitchell"
 }
 
 @article{h-siabl-91
-, author =	"M. E. Hohmeyer"
-, title =	"A surface intersection algorithm based on loop detection"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	4
-, year =	1991
-, pages =	"473--490"
-, keywords =	"surface, curve, intersection, computer aided design CAD, closed loops, linear programming"
+, author =      "M. E. Hohmeyer"
+, title =       "A surface intersection algorithm based on loop detection"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      4
+, year =        1991
+, pages =       "473--490"
+, keywords =    "surface, curve, intersection, computer aided design CAD, closed loops, linear programming"
 }
 
 @techreport{hr-dcpbc-84
-, author =	"D. H. Hoitsma and M. Roche"
-, title =	"The determination of the critical points on a bi-cubic patch relative to a plane"
-, type =	"Report"
-, number =	"??"
-, institution =	"Fairchild Republic, and Lundy Systems"
-, year =	1984
+, author =      "D. H. Hoitsma and M. Roche"
+, title =       "The determination of the critical points on a bi-cubic patch relative to a plane"
+, type =        "Report"
+, number =      "??"
+, institution = "Fairchild Republic, and Lundy Systems"
+, year =        1984
 }
 
 @techreport{h-dsmt-83t
-, author =	"J. M. Hollerbach"
-, title =	"Dynamic scaling of Manipulator Trajectories"
-, number =	"A. I. Lab Memo 700"
-, institution =	"Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "J. M. Hollerbach"
+, title =       "Dynamic scaling of Manipulator Trajectories"
+, number =      "A. I. Lab Memo 700"
+, institution = "Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{h-dsmt-83
-, author =	"J. M. Hollerbach"
-, title =	"Dynamic scaling of manipulator trajectories"
-, booktitle =	"Proc. ACC"
-, site =	"San Francisco, CA"
-, organization =	"American Automatic Control Council"
-, month =	jun
-, year =	1983
-, pages =	"752--756"
-, update =	"97.11 bibrelex"
+, author =      "J. M. Hollerbach"
+, title =       "Dynamic scaling of manipulator trajectories"
+, booktitle =   "Proc. ACC"
+, site =        "San Francisco, CA"
+, organization =        "American Automatic Control Council"
+, month =       jun
+, year =        1983
+, pages =       "752--756"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{h-gmdsg-95
-, author =	"David Holmes"
-, title =	"Generalized Method of Decomposing Solid Geometry into Hexahedron Finite Elements"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"141--152"
-, update =	"96.01 samitchell"
+, author =      "David Holmes"
+, title =       "Generalized Method of Decomposing Solid Geometry into Hexahedron Finite Elements"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "141--152"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{hl-atmcf-86
-, author =	"D. Graham Holmes and Scott H. Lamson"
-, title =	"Adaptive Triangular Meshes for Compressible Flow Solutions"
-, editor =	"J. H{\"a}user and C. Taylor"
-, booktitle =	"Numerical Grid Generation in Computational Fluid Dynamics"
-, publisher =	"Pineridge Press"
-, address =	"Swansea, England"
-, year =	1986
-, pages =	"413--424"
-, annote =	"Insertion algorithm for CDT for mesh for fluid
-		 dynamics FEM. Laplacian smoothing of mesh. Adaptive
-		 refinement by splitting triangles into four pieces
-		 along edge mid points."
+, author =      "D. Graham Holmes and Scott H. Lamson"
+, title =       "Adaptive Triangular Meshes for Compressible Flow Solutions"
+, editor =      "J. H{\"a}user and C. Taylor"
+, booktitle =   "Numerical Grid Generation in Computational Fluid Dynamics"
+, publisher =   "Pineridge Press"
+, address =     "Swansea, England"
+, year =        1986
+, pages =       "413--424"
+, annote =      "Insertion algorithm for CDT for mesh for fluid
+                 dynamics FEM. Laplacian smoothing of mesh. Adaptive
+                 refinement by splitting triangles into four pieces
+                 along edge mid points."
 }
 
 @article{hs-ccagm-91
-, author =	"L. S. {Homem de Mello} and A. C. Sanderson"
-, title =	"A correct and complete algorithm for the generation of mechanical assembly Sequences"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	7
-, year =	1991
-, pages =	"228--240"
-, update =	"98.03 agarwal"
+, author =      "L. S. {Homem de Mello} and A. C. Sanderson"
+, title =       "A correct and complete algorithm for the generation of mechanical assembly Sequences"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      7
+, year =        1991
+, pages =       "228--240"
+, update =      "98.03 agarwal"
 }
 
 @techreport{hs-agmas-88
-, author =	"L. S. {Homem de Mello} and A. C. Sanderson"
-, title =	"Automatic Generation of Mechanical Assembly Sequences"
-, type =	"Technical {Report}"
-, institution =	"Robotics Institute, Carnegie Mellon University"
-, month =	dec
-, year =	1988
-, update =	"93.09 milone+mitchell"
+, author =      "L. S. {Homem de Mello} and A. C. Sanderson"
+, title =       "Automatic Generation of Mechanical Assembly Sequences"
+, type =        "Technical {Report}"
+, institution = "Robotics Institute, Carnegie Mellon University"
+, month =       dec
+, year =        1988
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{hjss-cohdl-01
-, author =	"M. C. Hon and R. Janardan and J. Schwerdt and M. Smid"
-, title =	"Computing optimal hatching directions in layered manufacturing"
-, booktitle =	"Proceedings International Conference on Computational Science"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	2073
-, publisher =	"Springer-Verlag"
-, year =	2001
-, pages =	"683--692"
-, update =	"01.07 smid"
+, author =      "M. C. Hon and R. Janardan and J. Schwerdt and M. Smid"
+, title =       "Computing optimal hatching directions in layered manufacturing"
+, booktitle =   "Proceedings International Conference on Computational Science"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      2073
+, publisher =   "Springer-Verlag"
+, year =        2001
+, pages =       "683--692"
+, update =      "01.07 smid"
 }
 
 @article{h-dcpdd-78
-, author =	"H. Honda"
-, title =	"Description of Cellular Patterns by {Dirichlet} Domains: The Two-Dimensional Case"
-, journal =	"Journal of Theoretical Biology"
-, volume =	72
-, year =	1978
-, pages =	"523--543"
-, annote =	"VD as model of cell patterns. Tries to find centres to
-		 create pattern. $O(n^2)$ algorithm to build VD."
+, author =      "H. Honda"
+, title =       "Description of Cellular Patterns by {Dirichlet} Domains: The Two-Dimensional Case"
+, journal =     "Journal of Theoretical Biology"
+, volume =      72
+, year =        1978
+, pages =       "523--543"
+, annote =      "VD as model of cell patterns. Tries to find centres to
+                 create pattern. $O(n^2)$ algorithm to build VD."
 }
 
 @inproceedings{hw-imbmm-88
-, author =	"J. Hong and H. J. Wolfson"
-, title =	"An improved model-based matching method using footprints"
-, booktitle =	"Proc. 9th IEEE Internat. Conf. Pattern Recogn."
-, year =	1988
-, pages =	"72--28"
-, update =	"98.03 bibrelex"
+, author =      "J. Hong and H. J. Wolfson"
+, title =       "An improved model-based matching method using footprints"
+, booktitle =   "Proc. 9th IEEE Internat. Conf. Pattern Recogn."
+, year =        1988
+, pages =       "72--28"
+, update =      "98.03 bibrelex"
 }
 
 @article{hcy-iatwm-90
-, author =	"J. H. Hong and A. E. Chiou and P. Yeh"
-, title =	"Image amplification by two-wave mixing in photorefractive crystals"
-, journal =	"Appl. Optics"
-, volume =	29
-, number =	20
-, year =	1990
-, pages =	"3026--3029"
-, update =	"97.11 bibrelex"
+, author =      "J. H. Hong and A. E. Chiou and P. Yeh"
+, title =       "Image amplification by two-wave mixing in photorefractive crystals"
+, journal =     "Appl. Optics"
+, volume =      29
+, number =      20
+, year =        1990
+, pages =       "3026--3029"
+, update =      "97.11 bibrelex"
 }
 
 @article{hmr-ctoge-83
-, author =	"J. W. Hong and K. Mehlhorn and A. L. Rosenberg"
-, title =	"Cost trade-offs in graph embedding with applications"
-, journal =	"J. ACM"
-, volume =	30
-, year =	1983
-, pages =	"709--728"
+, author =      "J. W. Hong and K. Mehlhorn and A. L. Rosenberg"
+, title =       "Cost trade-offs in graph embedding with applications"
+, journal =     "J. ACM"
+, volume =      30
+, year =        1983
+, pages =       "709--728"
 }
 
 @article{hskk-tbcua-98
-, author =	"M. Hong and T. W. Sederberg and K. S. Klimaszewski and K. Kaneda"
-, title =	"Triangulation of Branching Contours Using Area Minimization"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"389--406"
-, update =	"98.11 devillers"
+, author =      "M. Hong and T. W. Sederberg and K. S. Klimaszewski and K. Kaneda"
+, title =       "Triangulation of Branching Contours Using Area Minimization"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "389--406"
+, update =      "98.11 devillers"
 }
 
 @techreport{hjss-mtpsv-01
-, author =	"M. C. Hong and R. Janardan and J. Schwerdt and M. Smid"
-, title =	"Minimizing the total projection of a set of vectors, with applications to layered manufacturing"
-, type =	"Report"
-, number =	4
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	2001
-, update =	"01.04 smid"
+, author =      "M. C. Hong and R. Janardan and J. Schwerdt and M. Smid"
+, title =       "Minimizing the total projection of a set of vectors, with applications to layered manufacturing"
+, type =        "Report"
+, number =      4
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        2001
+, update =      "01.04 smid"
 }
 
 @article{hel-dspds-00
-, author =	"S.-H. Hong and P. Eades and S.-H. Lee"
-, title =	"Drawing series parallel digraphs symmetrically"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	17
-, year =	2000
-, pages =	"165--188"
-, update =	"01.04 smid"
+, author =      "S.-H. Hong and P. Eades and S.-H. Lee"
+, title =       "Drawing series parallel digraphs symmetrically"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      17
+, year =        2000
+, pages =       "165--188"
+, update =      "01.04 smid"
 }
 
 @article{hs-drwsv-85
-, author =	"T. H. Hong and M. Schneier"
-, title =	"Describing a robot's workspace using a sequence of views from a moving camera"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	7
-, year =	1985
-, pages =	"721--726"
-, update =	"98.11 bibrelex"
+, author =      "T. H. Hong and M. Schneier"
+, title =       "Describing a robot's workspace using a sequence of views from a moving camera"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      7
+, year =        1985
+, pages =       "721--726"
+, update =      "98.11 bibrelex"
 }
 
 @book{h-mg-73
-, author =	"R. Honsberger"
-, title =	"Mathematical Gems I"
-, series =	"The Dolciani Mathematical Expositions"
-, number =	1
-, publisher =	"Math. Soc. of America"
-, year =	1973
-, precedes =	"h-mg-76,h-mg-85"
-, update =	"99.11 bibrelex, 98.11 bibrelex"
+, author =      "R. Honsberger"
+, title =       "Mathematical Gems I"
+, series =      "The Dolciani Mathematical Expositions"
+, number =      1
+, publisher =   "Math. Soc. of America"
+, year =        1973
+, precedes =    "h-mg-76,h-mg-85"
+, update =      "99.11 bibrelex, 98.11 bibrelex"
 }
 
 @book{h-mg-76
-, author =	"R. Honsberger"
-, title =	"Mathematical Gems II"
-, series =	"The Dolciani Mathematical Expositions"
-, number =	2
-, publisher =	"Math. Soc. of America"
-, year =	1976
-, succeeds =	"h-mg-73"
-, precedes =	"h-mg-85"
-, update =	"99.11 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
+, author =      "R. Honsberger"
+, title =       "Mathematical Gems II"
+, series =      "The Dolciani Mathematical Expositions"
+, number =      2
+, publisher =   "Math. Soc. of America"
+, year =        1976
+, succeeds =    "h-mg-73"
+, precedes =    "h-mg-85"
+, update =      "99.11 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
 }
 
 @book{h-mg-85
-, author =	"R. Honsberger"
-, title =	"Mathematical Gems III"
-, series =	"The Dolciani Mathematical Expositions"
-, number =	9
-, publisher =	"Math. Soc. of America"
-, year =	1985
-, succeeds =	"h-mg-73, h-mg-76"
-, update =	"99.11 bibrelex, 98.11 bibrelex"
+, author =      "R. Honsberger"
+, title =       "Mathematical Gems III"
+, series =      "The Dolciani Mathematical Expositions"
+, number =      9
+, publisher =   "Math. Soc. of America"
+, year =        1985
+, succeeds =    "h-mg-73, h-mg-76"
+, update =      "99.11 bibrelex, 98.11 bibrelex"
 }
 
 @article{h-srlp-82
-, author =	"R. Honsberger"
-, title =	"Semi-regular lattice polygons"
-, journal =	"Two Year College Math. J."
-, volume =	13
-, year =	1982
-, pages =	"36--44"
-, update =	"97.11 bibrelex"
+, author =      "R. Honsberger"
+, title =       "Semi-regular lattice polygons"
+, journal =     "Two Year College Math. J."
+, volume =      13
+, year =        1982
+, pages =       "36--44"
+, update =      "97.11 bibrelex"
 }
 
 @article{hrwz-aairf-87
-, author =	"S. J. Hood and R. C. Rosenberg and D. H. Withers and T. Zhou"
-, title =	"An algorithm for automatic identification of {$R$}-fields in bond graphs"
-, journal =	"IBM J. Res. Develop."
-, volume =	31
-, year =	1987
-, pages =	"382--390"
+, author =      "S. J. Hood and R. C. Rosenberg and D. H. Withers and T. Zhou"
+, title =       "An algorithm for automatic identification of {$R$}-fields in bond graphs"
+, journal =     "IBM J. Res. Develop."
+, volume =      31
+, year =        1987
+, pages =       "382--390"
 }
 
 @techreport{hk-prga-89
-, author =	"J. Hopcroft and P. Kahn"
-, title =	"A Paradigm for Robust Geometric Algorithms"
-, type =	"Technical {Report}"
-, number =	"TR-89-1044"
-, institution =	"Cornell University"
-, month =	oct
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "J. Hopcroft and P. Kahn"
+, title =       "A Paradigm for Robust Geometric Algorithms"
+, type =        "Technical {Report}"
+, number =      "TR-89-1044"
+, institution = "Cornell University"
+, month =       oct
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @article{hk-nammb-73
-, author =	"J. Hopcroft and R. M. Karp"
-, title =	"An $n^(5/2)$ algorithm for maximum matchings in bipartite graphs"
-, journal =	"SIAM J. Comput."
-, volume =	2
-, number =	4
-, year =	1973
-, pages =	"225--231"
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "J. Hopcroft and R. M. Karp"
+, title =       "An $n^(5/2)$ algorithm for maximum matchings in bipartite graphs"
+, journal =     "SIAM J. Comput."
+, volume =      2
+, number =      4
+, year =        1973
+, pages =       "225--231"
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @incollection{hk-crcs-85i
-, author =	"J. Hopcroft and D. Kraft"
-, title =	"The Challenge of Robotics for Computer Science"
-, editor =	"J. Schwartz and C. Yap"
-, booktitle =	"Advances in Robotics: {Algorithms} and Geometric Aspects of Robotics"
-, volume =	1
-, publisher =	"??"
-, year =	1985
-, pages =	"7--42"
-, update =	"97.11 bibrelex"
+, author =      "J. Hopcroft and D. Kraft"
+, title =       "The Challenge of Robotics for Computer Science"
+, editor =      "J. Schwartz and C. Yap"
+, booktitle =   "Advances in Robotics: {Algorithms} and Geometric Aspects of Robotics"
+, volume =      1
+, publisher =   "??"
+, year =        1985
+, pages =       "7--42"
+, update =      "97.11 bibrelex"
 }
 
 @article{ht-dgtc-73
-, author =	"J. Hopcroft and R. E. Tarjan"
-, title =	"Dividing a Graph into Triconnected Components"
-, journal =	"SIAM J. Comput."
-, volume =	2
-, number =	3
-, year =	1973
-, pages =	"135--158"
-, update =	"98.07 tamassia, 95.01 tamassia"
+, author =      "J. Hopcroft and R. E. Tarjan"
+, title =       "Dividing a Graph into Triconnected Components"
+, journal =     "SIAM J. Comput."
+, volume =      2
+, number =      3
+, year =        1973
+, pages =       "135--158"
+, update =      "98.07 tamassia, 95.01 tamassia"
 }
 
 @article{ht-ept-74
-, author =	"J. Hopcroft and R. E. Tarjan"
-, title =	"Efficient Planarity Testing"
-, journal =	"J. ACM"
-, volume =	21
-, number =	4
-, year =	1974
-, pages =	"549--568"
-, keywords =	"graph drawing"
-, precedes =	"d-nhtpa-76"
-, update =	"93.09 tamassia"
+, author =      "J. Hopcroft and R. E. Tarjan"
+, title =       "Efficient Planarity Testing"
+, journal =     "J. ACM"
+, volume =      21
+, number =      4
+, year =        1974
+, pages =       "549--568"
+, keywords =    "graph drawing"
+, precedes =    "d-nhtpa-76"
+, update =      "93.09 tamassia"
 }
 
 @article{hw-moc-86
-, author =	"J. Hopcroft and G. Wilfong"
-, title =	"Motion of objects in contact"
-, journal =	"Internat. J. Robot. Res."
-, volume =	4
-, number =	4
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "J. Hopcroft and G. Wilfong"
+, title =       "Motion of objects in contact"
+, journal =     "Internat. J. Robot. Res."
+, volume =      4
+, number =      4
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @inbook{hh-gicv-92
-, author =	"J. E. Hopcroft and D. P. Huttenlocher"
-, title =	"Geometric invariance on computer vision"
-, chapter =	18
-, publisher =	"MIT Press"
-, year =	1992
-, pages =	"354--374"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Hopcroft and D. P. Huttenlocher"
+, title =       "Geometric invariance on computer vision"
+, chapter =     18
+, publisher =   "MIT Press"
+, year =        1992
+, pages =       "354--374"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{hh-ppmat-89
-, author =	"J. E. Hopcroft and D. P. Huttenlocher"
-, title =	"On planar point matching under affine transformation"
-, type =	"Technical {Report}"
-, number =	"TR~89-986"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	apr
-, year =	1989
-, update =	"93.09 milone+mitchell"
+, author =      "J. E. Hopcroft and D. P. Huttenlocher"
+, title =       "On planar point matching under affine transformation"
+, type =        "Technical {Report}"
+, number =      "TR~89-986"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       apr
+, year =        1989
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{hh-pmat-89
-, author =	"J. E. Hopcroft and D. P. Huttenlocher"
-, title =	"Point matching under affine transformation"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	14
+, author =      "J. E. Hopcroft and D. P. Huttenlocher"
+, title =       "Point matching under affine transformation"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       14
 }
 
 @article{hjw-mp2dl-84
-, author =	"J. E. Hopcroft and D. A. Joseph and S. H. Whitesides"
-, title =	"Movement problems for $2$-dimensional linkages"
-, journal =	"SIAM J. Comput."
-, volume =	13
-, year =	1984
-, pages =	"610--629"
+, author =      "J. E. Hopcroft and D. A. Joseph and S. H. Whitesides"
+, title =       "Movement problems for $2$-dimensional linkages"
+, journal =     "SIAM J. Comput."
+, volume =      13
+, year =        1984
+, pages =       "610--629"
 }
 
 @techreport{hjw-mra2d-82
-, author =	"J. E. Hopcroft and D. A. Joseph and S. H. Whitesides"
-, title =	"On the movement of robot arms in $2$-dimensional bounded regions"
-, type =	"Technical {Report}"
-, number =	"TR~82-486"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1982
-, precedes =	"hjw-mra2d-85"
+, author =      "J. E. Hopcroft and D. A. Joseph and S. H. Whitesides"
+, title =       "On the movement of robot arms in $2$-dimensional bounded regions"
+, type =        "Technical {Report}"
+, number =      "TR~82-486"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1982
+, precedes =    "hjw-mra2d-85"
 }
 
 @article{hjw-mra2d-85
-, author =	"J. E. Hopcroft and D. A. Joseph and S. H. Whitesides"
-, title =	"On the movement of robot arms in $2$-dimensional bounded regions"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"315--333"
-, succeeds =	"hjw-mra2d-82"
+, author =      "J. E. Hopcroft and D. A. Joseph and S. H. Whitesides"
+, title =       "On the movement of robot arms in $2$-dimensional bounded regions"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "315--333"
+, succeeds =    "hjw-mra2d-82"
 }
 
 @article{hk-prga-92
-, author =	"J. E. Hopcroft and P. J. Kahn"
-, title =	"A paradigm for robust geometric algorithms"
-, journal =	"Algorithmica"
-, volume =	7
-, number =	4
-, year =	1992
-, pages =	"339--380"
-, update =	"98.07 tamassia"
+, author =      "J. E. Hopcroft and P. J. Kahn"
+, title =       "A paradigm for robust geometric algorithms"
+, journal =     "Algorithmica"
+, volume =      7
+, number =      4
+, year =        1992
+, pages =       "339--380"
+, update =      "98.07 tamassia"
 }
 
 @techreport{hk-crcs-85
-, author =	"J. E. Hopcroft and D. B. Krafft"
-, title =	"The challenge of robotics for computer science"
-, type =	"Technical {Report}"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1985
+, author =      "J. E. Hopcroft and D. B. Krafft"
+, title =       "The challenge of robotics for computer science"
+, type =        "Technical {Report}"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1985
 }
 
 @article{hss-edis-83a
-, author =	"J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
-, title =	"Efficient detection of intersections among spheres"
-, journal =	"Internat. J. Robot. Res."
-, volume =	2
-, number =	4
-, year =	1983
-, pages =	"77--80"
-, keywords =	"intersection, detection, spheres, three-dimensional"
-, succeeds =	"hss-edis-83t"
-, update =	"98.03 mitchell"
+, author =      "J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
+, title =       "Efficient detection of intersections among spheres"
+, journal =     "Internat. J. Robot. Res."
+, volume =      2
+, number =      4
+, year =        1983
+, pages =       "77--80"
+, keywords =    "intersection, detection, spheres, three-dimensional"
+, succeeds =    "hss-edis-83t"
+, update =      "98.03 mitchell"
 }
 
 @techreport{hss-edis-83t
-, author =	"J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
-, title =	"Efficient detections of intersections among spheres"
-, type =	"Report"
-, number =	59
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1983
-, precedes =	"hss-edis-83a"
-, update =	"98.03 mitchell"
+, author =      "J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
+, title =       "Efficient detections of intersections among spheres"
+, type =        "Report"
+, number =      59
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1983
+, precedes =    "hss-edis-83a"
+, update =      "98.03 mitchell"
 }
 
 @article{hss-cmpmi-84
-, author =	"J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
-, title =	"On the complexity of motion planning for multiple independent objects: {P}-space hardness of the ``{Warehouseman}'s {Problem}''"
-, journal =	"Internat. J. Robot. Res."
-, volume =	3
-, number =	4
-, year =	1984
-, pages =	"76--88"
-, keywords =	"motion planning, lower bounds"
-, update =	"98.03 mitchell"
+, author =      "J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
+, title =       "On the complexity of motion planning for multiple independent objects: {P}-space hardness of the ``{Warehouseman}'s {Problem}''"
+, journal =     "Internat. J. Robot. Res."
+, volume =      3
+, number =      4
+, year =        1984
+, pages =       "76--88"
+, keywords =    "motion planning, lower bounds"
+, update =      "98.03 mitchell"
 }
 
 @book{hss-pgcrm-87
-, author =	"J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
-, title =	"Planning, Geometry, and Complexity of Robot Motion"
-, publisher =	"Ablex Publishing"
-, address =	"Norwood, NJ"
-, year =	1987
-, update =	"98.03 mitchell"
+, author =      "J. E. Hopcroft and J. T. Schwartz and Micha Sharir"
+, title =       "Planning, Geometry, and Complexity of Robot Motion"
+, publisher =   "Ablex Publishing"
+, address =     "Norwood, NJ"
+, year =        1987
+, update =      "98.03 mitchell"
 }
 
 @book{hu-iatlc-79
-, author =	"J. E. Hopcroft and J. D. Ullman"
-, title =	"Introduction to Automata Theory, Languages, and Computation"
-, publisher =	"Addison-Wesley"
-, year =	1979
-, update =	"98.07 bibrelex"
+, author =      "J. E. Hopcroft and J. D. Ullman"
+, title =       "Introduction to Automata Theory, Languages, and Computation"
+, publisher =   "Addison-Wesley"
+, year =        1979
+, update =      "98.07 bibrelex"
 }
 
 @techreport{hw-moc-84
-, author =	"J. E. Hopcroft and G. T. Wilfong"
-, title =	"On the Motion of Objects in Contact"
-, type =	"Technical {Report}"
-, number =	"84-602"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	may
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "J. E. Hopcroft and G. T. Wilfong"
+, title =       "On the Motion of Objects in Contact"
+, type =        "Technical {Report}"
+, number =      "84-602"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       may
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @techreport{hw-rmomp-84
-, author =	"J. E. Hopcroft and G. T. Wilfong"
-, title =	"Reducing Multiple Object Motion Planning to Graph Searching"
-, type =	"Technical {Report}"
-, number =	"84-616"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	jul
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "J. E. Hopcroft and G. T. Wilfong"
+, title =       "Reducing Multiple Object Motion Planning to Graph Searching"
+, type =        "Technical {Report}"
+, number =      "84-616"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       jul
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{hw-rmomp-86
-, author =	"J. E. Hopcroft and G. T. Wilfong"
-, title =	"Reducing Multiple Object Motion Planning to Graph Searching"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"768--785"
-, update =	"00.03 agarwal"
+, author =      "J. E. Hopcroft and G. T. Wilfong"
+, title =       "Reducing Multiple Object Motion Planning to Graph Searching"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "768--785"
+, update =      "00.03 agarwal"
 }
 
 @article{h-pgdp-71
-, author =	"A. K. Hope"
-, title =	"A Planar Graph Drawing Program"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	1
-, year =	1971
-, pages =	"83--91"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "A. K. Hope"
+, title =       "A Planar Graph Drawing Program"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      1
+, year =        1971
+, pages =       "83--91"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{hk-spcs-90
-, author =	"R. Hope and M. Katchalski"
-, title =	"Separating plane convex sets"
-, journal =	"Math. Scand."
-, volume =	66
-, year =	1990
-, pages =	"44--46"
-, update =	"97.03 pocchiola"
+, author =      "R. Hope and M. Katchalski"
+, title =       "Separating plane convex sets"
+, journal =     "Math. Scand."
+, volume =      66
+, year =        1990
+, pages =       "44--46"
+, update =      "97.03 pocchiola"
 }
 
 @article{h-uzztu-53
-, author =	"H. Hopf"
-, title =	"{\"U}ber {Zusammenh{\"a}nge} zwischen {Topologie} und {Metrik} im {Rahmen} der elementaren {Geometrie}"
-, journal =	"Mathematisch-Physikalische Semester Berichte"
-, volume =	3
-, year =	1953
-, pages =	"16--29"
-, update =	"97.11 bibrelex"
+, author =      "H. Hopf"
+, title =       "{\"U}ber {Zusammenh{\"a}nge} zwischen {Topologie} und {Metrik} im {Rahmen} der elementaren {Geometrie}"
+, journal =     "Mathematisch-Physikalische Semester Berichte"
+, volume =      3
+, year =        1953
+, pages =       "16--29"
+, update =      "97.11 bibrelex"
 }
 
 @article{hp-an1-34
-, author =	"H. Hopf and E. Pannwitz"
-, title =	"Aufgabe {No.} $167$"
-, journal =	"Jahresbericht Deutsch. Math. Verein"
-, volume =	43
-, year =	1934
-, pages =	114
-, update =	"98.03 bibrelex"
+, author =      "H. Hopf and E. Pannwitz"
+, title =       "Aufgabe {No.} $167$"
+, journal =     "Jahresbericht Deutsch. Math. Verein"
+, volume =      43
+, year =        1934
+, pages =       114
+, update =      "98.03 bibrelex"
 }
 
 @article{h-ngrhc-84
-, author =	"J. Hopfield"
-, title =	"Neurons with graded response have collective computational properties like those of two-state neurons"
-, journal =	"Proc. Nat. Acad. Sci. USA"
-, volume =	81
-, year =	1984
-, pages =	"2554--2558"
-, update =	"98.07 bibrelex"
+, author =      "J. Hopfield"
+, title =       "Neurons with graded response have collective computational properties like those of two-state neurons"
+, journal =     "Proc. Nat. Acad. Sci. USA"
+, volume =      81
+, year =        1984
+, pages =       "2554--2558"
+, update =      "98.07 bibrelex"
 }
 
 @article{ht-cncm-86
-, author =	"J. Hopfield and D. Tank"
-, title =	"Computing with neural circuits: a model"
-, journal =	"Science"
-, volume =	233
-, year =	1986
-, pages =	"624--633"
-, update =	"98.07 bibrelex"
+, author =      "J. Hopfield and D. Tank"
+, title =       "Computing with neural circuits: a model"
+, journal =     "Science"
+, volume =      233
+, year =        1986
+, pages =       "624--633"
+, update =      "98.07 bibrelex"
 }
 
 @article{ht-ncdop-85
-, author =	"J. Hopfield and D. Tank"
-, title =	"``Neural'' computation of decisions in optimization problems"
-, journal =	"Biological Cybernetics"
-, volume =	52
-, year =	1985
-, pages =	"141--152"
-, update =	"98.07 bibrelex"
+, author =      "J. Hopfield and D. Tank"
+, title =       "``Neural'' computation of decisions in optimization problems"
+, journal =     "Biological Cybernetics"
+, volume =      52
+, year =        1985
+, pages =       "141--152"
+, update =      "98.07 bibrelex"
 }
 
 @article{h-cm-93
-, author =	"T. Hopp"
-, title =	"Computational metrology"
-, journal =	"Manufacturing Review"
-, volume =	6
-, number =	4
-, year =	1993
-, pages =	"295--304"
-, update =	"98.03 agarwal, 97.03 agarwal"
+, author =      "T. Hopp"
+, title =       "Computational metrology"
+, journal =     "Manufacturing Review"
+, volume =      6
+, number =      4
+, year =        1993
+, pages =       "295--304"
+, update =      "98.03 agarwal, 97.03 agarwal"
 }
 
 @inproceedings{h-pm-96
-, author =	"H. Hoppe"
-, title =	"Progressive meshes"
-, booktitle =	"Proc. SIGGRAPH '96"
-, year =	1996
-, pages =	"99--108"
-, update =	"98.07 bibrelex+orourke"
+, author =      "H. Hoppe"
+, title =       "Progressive meshes"
+, booktitle =   "Proc. SIGGRAPH '96"
+, year =        1996
+, pages =       "99--108"
+, update =      "98.07 bibrelex+orourke"
 }
 
 @inproceedings{h-vdrpm-97
-, author =	"Hugues Hoppe"
-, title =	"View-Dependent Refinement of Progressive Meshes"
-, booktitle =	"Proc. SIGGRAPH '97"
-, series =	"Computer Graphics Proceedings, Annual Conference Series"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"ACM Press"
-, month =	aug
-, year =	1997
-, pages =	"189--198"
-, update =	"98.07 agarwal, 98.03 agarwal+mitchell"
+, author =      "Hugues Hoppe"
+, title =       "View-Dependent Refinement of Progressive Meshes"
+, booktitle =   "Proc. SIGGRAPH '97"
+, series =      "Computer Graphics Proceedings, Annual Conference Series"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "ACM Press"
+, month =       aug
+, year =        1997
+, pages =       "189--198"
+, update =      "98.07 agarwal, 98.03 agarwal+mitchell"
 }
 
 @inproceedings{hddhjmss-pssr-94
-, author =	"H. Hoppe and T. DeRose and T. Duchamp and M. Halstead and H. Jin and J. McDonald and J. Schweitzer and W. Stuetzle"
-, title =	"Piecewise Smooth Surface Reconstruction"
-, booktitle =	"Proc. SIGGRAPH 94"
-, year =	1994
-, pages =	"295--302"
-, update =	"97.03 agarwal, 95.01 mitchell"
+, author =      "H. Hoppe and T. DeRose and T. Duchamp and M. Halstead and H. Jin and J. McDonald and J. Schweitzer and W. Stuetzle"
+, title =       "Piecewise Smooth Surface Reconstruction"
+, booktitle =   "Proc. SIGGRAPH 94"
+, year =        1994
+, pages =       "295--302"
+, update =      "97.03 agarwal, 95.01 mitchell"
 }
 
 @inproceedings{hddms-mo-93
-, author =	"H. Hoppe and T. DeRose and T. Duchamp and J. McDonald and W. Stuetzle"
-, title =	"Mesh Optimization"
-, booktitle =	"Proc. SIGGRAPH '93"
-, year =	1993
-, pages =	"19--26"
-, update =	"95.01 mitchell"
+, author =      "H. Hoppe and T. DeRose and T. Duchamp and J. McDonald and W. Stuetzle"
+, title =       "Mesh Optimization"
+, booktitle =   "Proc. SIGGRAPH '93"
+, year =        1993
+, pages =       "19--26"
+, update =      "95.01 mitchell"
 }
 
 @article{hddms-srup-92
-, author =	"H. Hoppe and T. DeRose and T. Duchamp and J. McDonald and W. Stuetzle"
-, title =	"Surface reconstruction from unorganized points"
-, journal =	"Comput. Graphics"
-, volume =	26
-, number =	2
-, year =	1992
-, pages =	"71--78"
-, note =	"Proc. SIGGRAPH '92"
-, update =	"93.05 orourke"
+, author =      "H. Hoppe and T. DeRose and T. Duchamp and J. McDonald and W. Stuetzle"
+, title =       "Surface reconstruction from unorganized points"
+, journal =     "Comput. Graphics"
+, volume =      26
+, number =      2
+, year =        1992
+, pages =       "71--78"
+, note =        "Proc. SIGGRAPH '92"
+, update =      "93.05 orourke"
 }
 
 @article{ha-pppap-01
-, author =	"K. Hormann and A. Agathos"
-, title =	"The point in polygon problem for arbitrary polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	20
-, year =	2001
-, pages =	"131--144"
-, update =	"02.03 smid"
+, author =      "K. Hormann and A. Agathos"
+, title =       "The point in polygon problem for arbitrary polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      20
+, year =        2001
+, pages =       "131--144"
+, update =      "02.03 smid"
 }
 
 @article{hv-splsp-49
-, author =	"A. Horn and F. A. Valentine"
-, title =	"Some properties of L-sets in the plane"
-, journal =	"Duke Mathematics Journal"
-, volume =	16
-, year =	1949
-, pages =	"131--140"
-, update =	"98.03 bibrelex"
+, author =      "A. Horn and F. A. Valentine"
+, title =       "Some properties of L-sets in the plane"
+, journal =     "Duke Mathematics Journal"
+, volume =      16
+, year =        1949
+, pages =       "131--140"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{h-egi-84
-, author =	"B. K. P. Horn"
-, title =	"Extended {Gaussian} Images"
-, booktitle =	"Proc. IEEE"
-, month =	dec
-, year =	1984
-, pages =	"1671--1586"
-, update =	"97.11 bibrelex"
+, author =      "B. K. P. Horn"
+, title =       "Extended {Gaussian} Images"
+, booktitle =   "Proc. IEEE"
+, month =       dec
+, year =        1984
+, pages =       "1671--1586"
+, update =      "97.11 bibrelex"
 }
 
 @book{h-rv-86
-, author =	"B. K. P. Horn"
-, title =	"Robot Vision"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "B. K. P. Horn"
+, title =       "Robot Vision"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @article{ht-tdscp-89
-, author =	"W. P. Horn and D. L. Taylor"
-, title =	"A theorem to determine the spatial containment of a point in a planar polyhedron"
-, journal =	"Comput. Graph. Image Process."
-, volume =	45
-, year =	1989
-, pages =	"106--116"
-, keywords =	"point location, polyhedron, winged-edge"
-, update =	"96.01 mitchell"
+, author =      "W. P. Horn and D. L. Taylor"
+, title =       "A theorem to determine the spatial containment of a point in a planar polyhedron"
+, journal =     "Comput. Graph. Image Process."
+, volume =      45
+, year =        1989
+, pages =       "106--116"
+, keywords =    "point location, polyhedron, winged-edge"
+, update =      "96.01 mitchell"
 }
 
 @book{hs-fds-83
-, author =	"E. Horowitz and S. Sahni"
-, title =	"Fundamentals of Data Structures"
-, publisher =	"Computer Science Press"
-, address =	"Potomac, Maryland"
-, year =	1983
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. Horowitz and S. Sahni"
+, title =       "Fundamentals of Data Structures"
+, publisher =   "Computer Science Press"
+, address =     "Potomac, Maryland"
+, year =        1983
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{hsa-fdsc-93
-, author =	"E. Horowitz and S. Sahni and S. {Anderson-Freed}"
-, title =	"Fundamentals of Data Structures in {C}"
-, publisher =	"Computer Science Press"
-, address =	"New York"
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "E. Horowitz and S. Sahni and S. {Anderson-Freed}"
+, title =       "Fundamentals of Data Structures in {C}"
+, publisher =   "Computer Science Press"
+, address =     "New York"
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @book{hsm-fdsc-95
-, author =	"E. Horowitz and S. Sahni and D. Metha"
-, title =	"Fundamentals of Data Structures in C++"
-, publisher =	"Computer Science Press"
-, year =	1995
-, update =	"97.03 tamassia"
+, author =      "E. Horowitz and S. Sahni and D. Metha"
+, title =       "Fundamentals of Data Structures in C++"
+, publisher =   "Computer Science Press"
+, year =        1995
+, update =      "97.03 tamassia"
 }
 
 @techreport{h-cvdp-79
-, author =	"R. N. Horspool"
-, title =	"Constructing the {Voronoi} diagram in the plane"
-, type =	"Report"
-, number =	"SOCS 79.12"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, month =	jul
-, year =	1979
-, update =	"93.09 held"
+, author =      "R. N. Horspool"
+, title =       "Constructing the {Voronoi} diagram in the plane"
+, type =        "Report"
+, number =      "SOCS 79.12"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, month =       jul
+, year =        1979
+, update =      "93.09 held"
 }
 
 @article{h-snec7-83
-, author =	"J. D. Horton"
-, title =	"Sets with no empty convex $7$-gons"
-, journal =	"Canad. Math. Bull."
-, volume =	26
-, year =	1983
-, pages =	"482--484"
+, author =      "J. D. Horton"
+, title =       "Sets with no empty convex $7$-gons"
+, journal =     "Canad. Math. Bull."
+, volume =      26
+, year =        1983
+, pages =       "482--484"
 }
 
 % ### others?
 @article{ho-rcbsc-92
-, author =	"T. Horvath and others"
-, title =	"Ray Coherence Between a Sphere and a Convex Polyhedron"
-, journal =	"Comput. Graph. Forum"
-, volume =	11
-, number =	2
-, month =	jun
-, year =	1992
-, pages =	"163--172"
-, update =	"93.09 held"
+, author =      "T. Horvath and others"
+, title =       "Ray Coherence Between a Sphere and a Convex Polyhedron"
+, journal =     "Comput. Graph. Forum"
+, volume =      11
+, number =      2
+, month =       jun
+, year =        1992
+, pages =       "163--172"
+, update =      "93.09 held"
 }
 
 @book{hd-pvd-94
-, author =	"J. Hoschek and W. Dankwort"
-, title =	"Parametric and Variational Design"
-, publisher =	"B. G. Teubner"
-, year =	1994
-, update =	"98.07 bibrelex"
+, author =      "J. Hoschek and W. Dankwort"
+, title =       "Parametric and Variational Design"
+, publisher =   "B. G. Teubner"
+, year =        1994
+, update =      "98.07 bibrelex"
 }
 
 @book{hl-cagd-93
-, author =	"J. Hoschek and D. Lasser"
-, title =	"Computer Aided Geometric Design"
-, publisher =	"A.K. Peters"
-, year =	1993
-, update =	"98.07 bibrelex"
+, author =      "J. Hoschek and D. Lasser"
+, title =       "Computer Aided Geometric Design"
+, publisher =   "A.K. Peters"
+, year =        1993
+, update =      "98.07 bibrelex"
 }
 
 @article{hy-cempk-82
-, author =	"M. Hoshi and T. Yuba"
-, title =	"A counter example to a monotonicity property of $k$-d trees"
-, journal =	"Inform. Process. Lett."
-, volume =	15
-, number =	4
-, year =	1982
-, pages =	"169--173"
+, author =      "M. Hoshi and T. Yuba"
+, title =       "A counter example to a monotonicity property of $k$-d trees"
+, journal =     "Inform. Process. Lett."
+, volume =      15
+, number =      4
+, year =        1982
+, pages =       "169--173"
 }
 
 @article{hu-ndcqg-01
-, author =	"K. Hosono and M. Urabe"
-, title =	"On the number of disjoint convex quadrilaterals for a given point set in the plane"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	20
-, year =	2001
-, pages =	"97--104"
-, update =	"02.03 devillers"
+, author =      "K. Hosono and M. Urabe"
+, title =       "On the number of disjoint convex quadrilaterals for a given point set in the plane"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      20
+, year =        2001
+, pages =       "97--104"
+, update =      "02.03 devillers"
 }
 
 @techreport{h-cthlra-89
-, author =	"L. B. Hostetler"
-, title =	"A Comparison of Three Hidden Line Removal Algorithms"
-, type =	"Report"
-, number =	"TR--89--02"
-, institution =	"Department of Computer Science, Johns Hopkins University"
-, year =	1989
-, update =	"98.11 ghali"
+, author =      "L. B. Hostetler"
+, title =       "A Comparison of Three Hidden Line Removal Algorithms"
+, type =        "Report"
+, number =      "TR--89--02"
+, institution = "Department of Computer Science, Johns Hopkins University"
+, year =        1989
+, update =      "98.11 ghali"
 }
 
 @book{hs-rt-67
-, author =	"Hottel and Sarofim"
-, title =	"Radioactive Transfer"
-, publisher =	"McGraw-Hill"
-, address =	"New York, NY"
-, year =	1967
-, update =	"98.03 bibrelex"
+, author =      "Hottel and Sarofim"
+, title =       "Radioactive Transfer"
+, publisher =   "McGraw-Hill"
+, address =     "New York, NY"
+, year =        1967
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{htap-pgmis-91
-, author =	"G. R. Hottel and S. T. Tuohy and P. G. Alourdas and N. M. Patrikalakis"
-, title =	"Praxiteles: A Geometric Modeling and Interrogation System"
-, booktitle =	"Proc. Marine Computers '91"
-, year =	1991
-, pages =	"CC4"
-, update =	"95.05 abrams"
+, author =      "G. R. Hottel and S. T. Tuohy and P. G. Alourdas and N. M. Patrikalakis"
+, title =       "Praxiteles: A Geometric Modeling and Interrogation System"
+, booktitle =   "Proc. Marine Computers '91"
+, year =        1991
+, pages =       "CC4"
+, update =      "95.05 abrams"
 }
 
 @techreport{hs-actbn-93
-, author =	"G. Hotz and J. Sellen"
-, title =	"On algebraic computation trees and {Betti} numbers"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "G. Hotz and J. Sellen"
+, title =       "On algebraic computation trees and {Betti} numbers"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @incollection{hm-fwecs-88
-, author =	"M. Houle and A. Maciel"
-, title =	"Finding the widest empty corridor through a set of points"
-, booktitle =	"Snapshots of computational and discrete geometry"
-, publisher =	"Dept. of Computer Science, McGill University"
-, address =	"Montreal, Canada"
-, year =	1988
-, pages =	"201--213"
-, note =	"Technical Report SOCS-88.11"
-, update =	"98.11 bibrelex"
+, author =      "M. Houle and A. Maciel"
+, title =       "Finding the widest empty corridor through a set of points"
+, booktitle =   "Snapshots of computational and discrete geometry"
+, publisher =   "Dept. of Computer Science, McGill University"
+, address =     "Montreal, Canada"
+, year =        1988
+, pages =       "201--213"
+, note =        "Technical Report SOCS-88.11"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{h-awwss-89a
-, author =	"M. E. Houle"
-, title =	"Algorithms for weak and wide separation of sets"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	25
-, precedes =	"h-awwss-89b"
-, update =	"95.09 mitchell"
+, author =      "M. E. Houle"
+, title =       "Algorithms for weak and wide separation of sets"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       25
+, precedes =    "h-awwss-89b"
+, update =      "95.09 mitchell"
 }
 
 @inproceedings{h-awwss-89b
-, author =	"M. E. Houle"
-, title =	"Algorithms for weak and wide separation of sets"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, year =	1989
-, pages =	"61--68"
-, keywords =	"linear separation, red-blue separation, spherical separation"
-, succeeds =	"h-awwss-89a"
-, update =	"95.09 mitchell"
+, author =      "M. E. Houle"
+, title =       "Algorithms for weak and wide separation of sets"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, year =        1989
+, pages =       "61--68"
+, keywords =    "linear separation, red-blue separation, spherical separation"
+, succeeds =    "h-awwss-89a"
+, update =      "95.09 mitchell"
 }
 
 @article{h-tess-91
-, author =	"M. E. Houle"
-, title =	"Theorems on the existence of separating surfaces"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"49--56"
+, author =      "M. E. Houle"
+, title =       "Theorems on the existence of separating surfaces"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "49--56"
 }
 
 @inproceedings{hiir-wolla-89
-, author =	"M. E. Houle and H. Imai and K. Imai and J.-M. Robert"
-, title =	"Weighted orthogonal linear {$L_{\infty}$}-approximation and applications"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"183--191"
+, author =      "M. E. Houle and H. Imai and K. Imai and J.-M. Robert"
+, title =       "Weighted orthogonal linear {$L_{\infty}$}-approximation and applications"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "183--191"
 }
 
 @article{hiiry-owllla-93
-, author =	"M. E. Houle and H. Imai and K. Imai and J.-M. Robert and P. Yam amoto"
-, title =	"Orthogonal Weighted Linear {$L_{1}$} and {$L_{\infty}$} Approximation and Applications"
-, journal =	"Discrete Appl. Math."
-, volume =	43
-, number =	3
-, month =	jun
-, year =	1993
-, pages =	"217--232"
-, succeeds =	"hiiry-owlll-90"
-, update =	"00.11 smid, 00.07 smid, 98.07 bibrelex"
+, author =      "M. E. Houle and H. Imai and K. Imai and J.-M. Robert and P. Yam amoto"
+, title =       "Orthogonal Weighted Linear {$L_{1}$} and {$L_{\infty}$} Approximation and Applications"
+, journal =     "Discrete Appl. Math."
+, volume =      43
+, number =      3
+, month =       jun
+, year =        1993
+, pages =       "217--232"
+, succeeds =    "hiiry-owlll-90"
+, update =      "00.11 smid, 00.07 smid, 98.07 bibrelex"
 }
 
 @techreport{hiiry-owlll-90
-, author =	"M. E. Houle and H. Imai and K. Imai and J.-M. Robert and P. Yamamoto"
-, title =	"Orthogonal Weighted Linear {$L_{1}$} and {$L_{\infty}$} Approximation and Applications"
-, type =	"Manuscript"
-, year =	1990
-, precedes =	"hiiry-owllla-93"
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "M. E. Houle and H. Imai and K. Imai and J.-M. Robert and P. Yamamoto"
+, title =       "Orthogonal Weighted Linear {$L_{1}$} and {$L_{\infty}$} Approximation and Applications"
+, type =        "Manuscript"
+, year =        1990
+, precedes =    "hiiry-owllla-93"
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{ht-cws-85
-, author =	"M. E. Houle and G. T. Toussaint"
-, title =	"Computing the width of a set"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"1--7"
-, precedes =	"ht-cws-88"
-, cites =	"t-mss-84, s-cg-78, b-gtfga-80, ks-upcha-82t, mt-uchap-84, ma-lafch-79, l-fchsp-80, gs-ncg-82, k-osps-81, ph-chfsp-77, ik-spc-75, ii-cgmpa-85, kd-pamm-82, t-sgprc-83, t-apctd-, ZZZ"
-, update =	"97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "M. E. Houle and G. T. Toussaint"
+, title =       "Computing the width of a set"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "1--7"
+, precedes =    "ht-cws-88"
+, cites =       "t-mss-84, s-cg-78, b-gtfga-80, ks-upcha-82t, mt-uchap-84, ma-lafch-79, l-fchsp-80, gs-ncg-82, k-osps-81, ph-chfsp-77, ik-spc-75, ii-cgmpa-85, kd-pamm-82, t-sgprc-83, t-apctd-, ZZZ"
+, update =      "97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{ht-cws-88
-, author =	"M. E. Houle and G. T. Toussaint"
-, title =	"Computing the width of a set"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-10"
-, number =	5
-, year =	1988
-, pages =	"761--765"
-, keywords =	"two-dimensional, three-dimensional, rotating calipers, antipodal pairs, line fitting, plane fitting, approximation"
-, succeeds =	"ht-cws-85"
-, update =	"93.09 milone+mitchell+rote"
-, annote =	"$O(n \log n + I)$ time, where $I$ is the number of
-		 antipodal pairs:
-		 vertex-edge pairs in two dimensions ($I=O(n)$);
-		 edge-edge pairs and $O(n)$ vertex-face pairs in three
-		 dimensions ($I=O(n^2)$)"
+, author =      "M. E. Houle and G. T. Toussaint"
+, title =       "Computing the width of a set"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-10"
+, number =      5
+, year =        1988
+, pages =       "761--765"
+, keywords =    "two-dimensional, three-dimensional, rotating calipers, antipodal pairs, line fitting, plane fitting, approximation"
+, succeeds =    "ht-cws-85"
+, update =      "93.09 milone+mitchell+rote"
+, annote =      "$O(n \log n + I)$ time, where $I$ is the number of
+                 antipodal pairs:
+                 vertex-edge pairs in two dimensions ($I=O(n)$);
+                 edge-edge pairs and $O(n)$ vertex-face pairs in three
+                 dimensions ($I=O(n^2)$)"
 }
 
 @article{h-bsmbs-87
-, author =	"Piet Houthuys"
-, title =	"Box Sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching"
-, journal =	"Visual Comput."
-, volume =	3
-, number =	4
-, month =	dec
-, year =	1987
-, pages =	"236--249"
-, keywords =	"multidimensional sorting, range searching, set operations on polygons"
+, author =      "Piet Houthuys"
+, title =       "Box Sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching"
+, journal =     "Visual Comput."
+, volume =      3
+, number =      4
+, month =       dec
+, year =        1987
+, pages =       "236--249"
+, keywords =    "multidimensional sorting, range searching, set operations on polygons"
 }
 
 @article{h-sp-68
-, author =	"W. E. Howden"
-, title =	"The Sofa Problem"
-, journal =	"Comput. J."
-, volume =	11
-, year =	1968
-, pages =	"299--301"
-, update =	"97.11 bibrelex"
+, author =      "W. E. Howden"
+, title =       "The Sofa Problem"
+, journal =     "Comput. J."
+, volume =      11
+, year =        1968
+, pages =       "299--301"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{h-ercsd-78
-, author =	"A. E. Howe"
-, title =	"Estimating regions and clustering spatial data: analysis and implementation of methods using the {Voronoi} diagram"
-, type =	"Ph.{D}. Thesis"
-, school =	"Brown Univ."
-, address =	"Providence, RI"
-, year =	1978
-, keywords =	"doctoral thesis"
+, author =      "A. E. Howe"
+, title =       "Estimating regions and clustering spatial data: analysis and implementation of methods using the {Voronoi} diagram"
+, type =        "Ph.{D}. Thesis"
+, school =      "Brown Univ."
+, address =     "Providence, RI"
+, year =        1978
+, keywords =    "doctoral thesis"
 }
 
 @article{hb-mpaic-94
-, author =	"C. T. Howie and E. H. Blake"
-, title =	"The mesh propagation algorithm for isosurface construction"
-, journal =	"Comput. Graph. Forum"
-, volume =	13
-, year =	1994
-, pages =	"65--74"
-, update =	"98.07 bibrelex"
+, author =      "C. T. Howie and E. H. Blake"
+, title =       "The mesh propagation algorithm for isosurface construction"
+, journal =     "Comput. Graph. Forum"
+, volume =      13
+, year =        1994
+, pages =       "65--74"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{h-dqgpg-92
-, author =	"W.-Y. Hsiang"
-, title =	"On the development of quantitative geometry from {Pythagoras} to {Grassman}"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	1
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1992
-, pages =	"1--21"
-, keywords =	"survey paper"
-, precedes =	"h-dqgpg-95"
-, update =	"98.07 icking"
+, author =      "W.-Y. Hsiang"
+, title =       "On the development of quantitative geometry from {Pythagoras} to {Grassman}"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      1
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1992
+, pages =       "1--21"
+, keywords =    "survey paper"
+, precedes =    "h-dqgpg-95"
+, update =      "98.07 icking"
 }
 
 @incollection{h-dqgpg-95
-, author =	"Wu-Yi Hsiang"
-, title =	"On the Development of Quantitative Geometry from {Pythagoras} to {Grassmann}"
-, editor =	"Ding-Zhu Du and Frank Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1995
-, pages =	"1--21"
-, keywords =	"survey paper"
-, succeeds =	"h-dqgpg-92"
-, update =	"98.07 icking"
+, author =      "Wu-Yi Hsiang"
+, title =       "On the Development of Quantitative Geometry from {Pythagoras} to {Grassmann}"
+, editor =      "Ding-Zhu Du and Frank Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1995
+, pages =       "1--21"
+, keywords =    "survey paper"
+, succeeds =    "h-dqgpg-92"
+, update =      "98.07 icking"
 }
 
 @inproceedings{hklms-fnppr-98
-, author =	"David Hsu and Lydia E. Kavraki and Jean-Claude Latombe and Rajeev Motwani and Stephen Sorkin"
-, title =	"On Finding Narrow Passages with Probabilistic Roadmap Planners"
-, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
-, nickname =	"WAFR '98"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1998
-, note =	"To appear"
-, update =	"98.11 bibrelex, 98.07 agarwal+bibrelex, 98.03 agarwal+mitchell"
+, author =      "David Hsu and Lydia E. Kavraki and Jean-Claude Latombe and Rajeev Motwani and Stephen Sorkin"
+, title =       "On Finding Narrow Passages with Probabilistic Roadmap Planners"
+, booktitle =   "Proc. 3rd Workshop Algorithmic Found. Robot."
+, nickname =    "WAFR '98"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1998
+, note =        "To appear"
+, update =      "98.11 bibrelex, 98.07 agarwal+bibrelex, 98.03 agarwal+mitchell"
 }
 
 @article{hcl-paccv-92
-, author =	"F. R. Hsu and R. C. Chang and R. C. T. Lee"
-, title =	"Parallel algorithms for computing the closest visible vertex pair between two polygons"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	2
-, year =	1992
-, pages =	"135--162"
-, keywords =	"parallel algorithm, visibility"
-, update =	"94.09 jones"
+, author =      "F. R. Hsu and R. C. Chang and R. C. T. Lee"
+, title =       "Parallel algorithms for computing the closest visible vertex pair between two polygons"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      2
+, year =        1992
+, pages =       "135--162"
+, keywords =    "parallel algorithm, visibility"
+, update =      "94.09 jones"
 }
 
 @techreport{hwh-cpr-85
-, author =	"W.-J. Hsu and C.-C. Wang and K.-T. Huang"
-, title =	"Convex polygon retrieval"
-, type =	"Report"
-, number =	"??"
-, institution =	"IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1985
+, author =      "W.-J. Hsu and C.-C. Wang and K.-T. Huang"
+, title =       "Convex polygon retrieval"
+, type =        "Report"
+, number =      "??"
+, institution = "IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1985
 }
 
 @article{hn-ehblp-79
-, author =	"W. L. Hsu and G. L. Nemhauser"
-, title =	"Easy and Hard Bottleneck Location Problems"
-, journal =	"Discrete Appl. Math."
-, volume =	1
-, year =	1979
-, pages =	"209--215"
-, update =	"98.07 agarwal"
+, author =      "W. L. Hsu and G. L. Nemhauser"
+, title =       "Easy and Hard Bottleneck Location Problems"
+, journal =     "Discrete Appl. Math."
+, volume =      1
+, year =        1979
+, pages =       "209--215"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{hp-callc-79
-, author =	"M. Y. Hsueh and D. O. Pederson"
-, title =	"Computer-Aided Layout of LSI Circuit Building-Blocks"
-, booktitle =	"Proc. IEEE Int. Symp. on Circuits and Systems"
-, year =	1979
-, update =	"98.03 bibrelex"
+, author =      "M. Y. Hsueh and D. O. Pederson"
+, title =       "Computer-Aided Layout of LSI Circuit Building-Blocks"
+, booktitle =   "Proc. IEEE Int. Symp. on Circuits and Systems"
+, year =        1979
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{h-trism-95
-, author =	"C.-Y. Hu"
-, title =	"Towards Robust Interval Solid Modeling of Curved Objects"
-, type =	"Ph.{D}. Thesis"
-, school =	"Massachusetts Institute of Technology"
-, address =	"Cambridge, Massachusetts"
-, year =	1995
-, keywords =	"doctoral thesis"
-, update =	"95.05 abrams"
+, author =      "C.-Y. Hu"
+, title =       "Towards Robust Interval Solid Modeling of Curved Objects"
+, type =        "Ph.{D}. Thesis"
+, school =      "Massachusetts Institute of Technology"
+, address =     "Cambridge, Massachusetts"
+, year =        1995
+, keywords =    "doctoral thesis"
+, update =      "95.05 abrams"
 }
 
 @article{hpy-rismp1-96
-, author =	"C.-Y. Hu and N. M. Patrikalakis and X. Ye"
-, title =	"Robust interval solid modeling, {Part} {I}: representations"
-, journal =	"CAD"
-, volume =	28
-, year =	1996
-, pages =	"807--818"
-, update =	"98.07 bibrelex"
+, author =      "C.-Y. Hu and N. M. Patrikalakis and X. Ye"
+, title =       "Robust interval solid modeling, {Part} {I}: representations"
+, journal =     "CAD"
+, volume =      28
+, year =        1996
+, pages =       "807--818"
+, update =      "98.07 bibrelex"
 }
 
 @article{hpy-rismp2-96
-, author =	"C.-Y. Hu and N. M. Patrikalakis and X. Ye"
-, title =	"Robust interval solid modeling, {Part} {II}: boundary evaluation"
-, journal =	"CAD"
-, volume =	28
-, year =	1996
-, pages =	"819--830"
-, update =	"98.07 bibrelex"
+, author =      "C.-Y. Hu and N. M. Patrikalakis and X. Ye"
+, title =       "Robust interval solid modeling, {Part} {II}: boundary evaluation"
+, journal =     "CAD"
+, volume =      28
+, year =        1996
+, pages =       "819--830"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{h-ntcmp-91
-, author =	"Limin Hu"
-, title =	"A Novel Topology Control For Multihop Packet Radio Networks"
-, booktitle =	"Proceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies, IEEE INFOCOM '91"
-, publisher =	"IEEE"
-, address =	"IEEE Service Center, Piscataway, NJ, USA (IEEE cat n 91CH2979-3)"
-, year =	1991
-, pages =	"1084--1093"
-, keywords =	"packet radio networks, topology control algorithms, data links"
-, abstract =	"A novel, distributed topology-control algorithm has
-		 been developed for each node in a packet radio network
-		 (PRN) to control its transmitting power and logical
-		 neighbors in order to construct a reliable,
-		 high-throughput topology. The algorithm first
-		 constructs a planar triangulation from locations of all
-		 nodes as a starting topology. Then, the minimum angles
-		 of all triangles in the planar triangulation are
-		 maximized by means of edge switching to improve
-		 connectivity and throughput. The resulting Delaunay
-		 triangulation can be determined locally at each node.
-		 The topology is modified by negotiating among neighbors
-		 to satisfy a design requirement on the nodal degree
-		 parameter. Simulations show that (1) the final topology
-		 is degree-bounded, (2) it has a rather regular and
-		 uniform structure, and (3) its throughput and
-		 reliability are greater than that of a number of
-		 alternative topologies. 25 Refs."
+, author =      "Limin Hu"
+, title =       "A Novel Topology Control For Multihop Packet Radio Networks"
+, booktitle =   "Proceedings of the 10th Annual Joint Conference of the IEEE and Communications Societies, IEEE INFOCOM '91"
+, publisher =   "IEEE"
+, address =     "IEEE Service Center, Piscataway, NJ, USA (IEEE cat n 91CH2979-3)"
+, year =        1991
+, pages =       "1084--1093"
+, keywords =    "packet radio networks, topology control algorithms, data links"
+, abstract =    "A novel, distributed topology-control algorithm has
+                 been developed for each node in a packet radio network
+                 (PRN) to control its transmitting power and logical
+                 neighbors in order to construct a reliable,
+                 high-throughput topology. The algorithm first
+                 constructs a planar triangulation from locations of all
+                 nodes as a starting topology. Then, the minimum angles
+                 of all triangles in the planar triangulation are
+                 maximized by means of edge switching to improve
+                 connectivity and throughput. The resulting Delaunay
+                 triangulation can be determined locally at each node.
+                 The topology is modified by negotiating among neighbors
+                 to satisfy a design requirement on the nodal degree
+                 parameter. Simulations show that (1) the final topology
+                 is degree-bounded, (2) it has a rather regular and
+                 uniform structure, and (3) its throughput and
+                 reliability are greater than that of a number of
+                 alternative topologies. 25 Refs."
 }
 
 @book{h-ipnf-69
-, author =	"T. C. Hu"
-, title =	"Integer programming and network flows"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1969
-, update =	"98.03 bibrelex"
+, author =      "T. C. Hu"
+, title =       "Integer programming and network flows"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1969
+, update =      "98.03 bibrelex"
 }
 
 @techreport{hkr-orppg-92
-, author =	"T. C. Hu and Andrew B. Kahng and Gabriel Robins"
-, title =	"Optimal Robust Path Planning in General Environments"
-, type =	"Manuscript"
-, year =	1992
-, precedes =	"hkr-orppg-93"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "T. C. Hu and Andrew B. Kahng and Gabriel Robins"
+, title =       "Optimal Robust Path Planning in General Environments"
+, type =        "Manuscript"
+, year =        1992
+, precedes =    "hkr-orppg-93"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @article{hkr-orppg-93
-, author =	"T. C. Hu and Andrew B. Kahng and Gabriel Robins"
-, title =	"Optimal Robust Path Planning in General Environments"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	9
-, number =	6
-, month =	dec
-, year =	1993
-, pages =	"775--784"
-, succeeds =	"hkr-orppg-92"
-, update =	"98.03 mitchell"
-, abstract =	"
+, author =      "T. C. Hu and Andrew B. Kahng and Gabriel Robins"
+, title =       "Optimal Robust Path Planning in General Environments"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      9
+, number =      6
+, month =       dec
+, year =        1993
+, pages =       "775--784"
+, succeeds =    "hkr-orppg-92"
+, update =      "98.03 mitchell"
+, abstract =    "
 We address robust path planning for a mobile agent in a general
 environment by finding minimum cost source-destination paths having
 prescribed widths. The main result is a new approach that optimally
@@ -78776,157 +78776,157 @@ @article{hkr-orppg-93
 }
 
 @article{hs-oafno-81
-, author =	"T. C. Hu and M.-T. Shing"
-, title =	"An {$O(n)$} algorithm to find a near-optimum partition of a convex polygon"
-, journal =	"J. Algorithms"
-, volume =	2
-, year =	1981
-, pages =	"122--138"
+, author =      "T. C. Hu and M.-T. Shing"
+, title =       "An {$O(n)$} algorithm to find a near-optimum partition of a convex polygon"
+, journal =     "J. Algorithms"
+, volume =      2
+, year =        1981
+, pages =       "122--138"
 }
 
 @inproceedings{h-odcbl-90
-, author =	"A. Huang"
-, title =	"Optical digital computing at {Bell} {Labs}"
-, booktitle =	"1990 International Topical Meeting on Optical Computing"
-, site =	"Kobe, Japan"
-, year =	1990
-, update =	"98.03 bibrelex"
+, author =      "A. Huang"
+, title =       "Optical digital computing at {Bell} {Labs}"
+, booktitle =   "1990 International Topical Meeting on Optical Computing"
+, site =        "Kobe, Japan"
+, year =        1990
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{hmns-narp-95
-, author =	"Jian Huang and Anil Maheshwari and Doron Nussbaum and J{\"o}rg-R{\"u}diger Sack"
-, title =	"A Note on Approximations of Rectilinear Polygons"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"43--48"
-, update =	"95.09 jones"
+, author =      "Jian Huang and Anil Maheshwari and Doron Nussbaum and J{\"o}rg-R{\"u}diger Sack"
+, title =       "A Note on Approximations of Rectilinear Polygons"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "43--48"
+, update =      "95.09 jones"
 }
 
 @techreport{hhh-icgts-85
-, author =	"J. M. Huang and P. Huang and Y. P. Huang"
-, title =	"Interactive computer graphics in topographical simulation"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1985
+, author =      "J. M. Huang and P. Huang and Y. P. Huang"
+, title =       "Interactive computer graphics in topographical simulation"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1985
 }
 
 @inproceedings{hc-psdps-83
-, author =	"J. S. Huang and Y. C. Chow"
-, title =	"Parallel sorting and data partitioning by sampling"
-, booktitle =	"Proc. IEEE 7th Int. Computer Software and Applications Conference"
-, year =	1983
-, pages =	"627--631"
-, update =	"96.09 orourke"
+, author =      "J. S. Huang and Y. C. Chow"
+, title =       "Parallel sorting and data partitioning by sampling"
+, booktitle =   "Proc. IEEE 7th Int. Computer Software and Applications Conference"
+, year =        1983
+, pages =       "627--631"
+, update =      "96.09 orourke"
 }
 
 @article{hl-ifsea-85
-, author =	"M.-D. A. Huang and K. J. Lieberherr"
-, title =	"Implications of forbidden structures for extremal algorithmic problems"
-, journal =	"Theoret. Comput. Sci."
-, volume =	40
-, year =	1985
-, pages =	"195--210"
+, author =      "M.-D. A. Huang and K. J. Lieberherr"
+, title =       "Implications of forbidden structures for extremal algorithmic problems"
+, journal =     "Theoret. Comput. Sci."
+, volume =      40
+, year =        1985
+, pages =       "195--210"
 }
 
 @techreport{h-pcprn-91
-, author =	"N.-F. Huang"
-, title =	"The power connecting problem on a radio network"
-, institution =	"Dept. of Comput. Sci., National Tsing Hua Univ., Hsinchu, Taiwan 300, Republic of China"
-, year =	1991
-, update =	"00.03 bibrelex"
+, author =      "N.-F. Huang"
+, title =       "The power connecting problem on a radio network"
+, institution = "Dept. of Comput. Sci., National Tsing Hua Univ., Hsinchu, Taiwan 300, Republic of China"
+, year =        1991
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{hxc-gphds-01
-, author =	"Y. Huang and J. Xu and D. Z. Chen"
-, title =	"Geometric Permutations of High Dimensional Spheres"
-, booktitle =	"Proc. 12th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '01"
-, year =	2001
-, pages =	"244--245"
-, update =	"01.04 orourke"
+, author =      "Y. Huang and J. Xu and D. Z. Chen"
+, title =       "Geometric Permutations of High Dimensional Spheres"
+, booktitle =   "Proc. 12th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '01"
+, year =        2001
+, pages =       "244--245"
+, update =      "01.04 orourke"
 }
 
 @article{h-tingt-89
-, author =	"Yih-Ping Huang"
-, title =	"Triangular Irregular Network Generation and Topographical Modeling"
-, journal =	"Computers in Industry"
-, volume =	12
-, year =	1989
-, pages =	"203--213"
-, annote =	"Program for a CT. Three different measures of goodness
-		 used in incompatible ways!! Initial triangulation is
-		 built by on edges by taking the first point that
-		 subtends a sufficiently angle (6 degrees seemed to work
-		 well). Then a LOT based on shortest diagonal is
-		 produced (but with an additional unspecified rule to
-		 avoid really skinny triangles!). Finally a third
-		 measure is used to evaluate the
-		 triangulation---triangle quality is (area of
-		 equilateral tri with same perimeter)/area. Then the
-		 triangulation quality is the weighted-by-area average
-		 of this (Note that this is a rotten measure---really
-		 skinny triangles have low areas). Measured performance
-		 is $O(n^{2.5})$. Oh yes, bucketing is used to speed the
-		 search in triangle building. God knows how slow it
-		 would have been without bucketing. (Like 2 cpu hours
-		 for 1500 points!)"
+, author =      "Yih-Ping Huang"
+, title =       "Triangular Irregular Network Generation and Topographical Modeling"
+, journal =     "Computers in Industry"
+, volume =      12
+, year =        1989
+, pages =       "203--213"
+, annote =      "Program for a CT. Three different measures of goodness
+                 used in incompatible ways!! Initial triangulation is
+                 built by on edges by taking the first point that
+                 subtends a sufficiently angle (6 degrees seemed to work
+                 well). Then a LOT based on shortest diagonal is
+                 produced (but with an additional unspecified rule to
+                 avoid really skinny triangles!). Finally a third
+                 measure is used to evaluate the
+                 triangulation---triangle quality is (area of
+                 equilateral tri with same perimeter)/area. Then the
+                 triangulation quality is the weighted-by-area average
+                 of this (Note that this is a rotten measure---really
+                 skinny triangles have low areas). Measured performance
+                 is $O(n^{2.5})$. Oh yes, bucketing is used to speed the
+                 search in triangle building. God knows how slow it
+                 would have been without bucketing. (Like 2 cpu hours
+                 for 1500 points!)"
 }
 
 @inproceedings{hch-rfomr-86
-, author =	"Y. Y. Huang and Z. Cao and E. l. Hall"
-, title =	"Region filling operations for mobile robots using computer graphics"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1986
-, pages =	"1607--1614"
-, update =	"98.07 bibrelex"
+, author =      "Y. Y. Huang and Z. Cao and E. l. Hall"
+, title =       "Region filling operations for mobile robots using computer graphics"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1986
+, pages =       "1607--1614"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{hch-rfomr-85
-, author =	"Y. Y. Huang and Z. L. Cao and E. L. Hall"
-, title =	"Region filling operations for mobile robots using computer graphics"
-, type =	"Report"
-, number =	"??"
-, institution =	"Center Rob. Res., Univ. Cincinnati"
-, address =	"Cincinnati, OH"
-, year =	1985
+, author =      "Y. Y. Huang and Z. L. Cao and E. L. Hall"
+, title =       "Region filling operations for mobile robots using computer graphics"
+, type =        "Report"
+, number =      "??"
+, institution = "Center Rob. Res., Univ. Cincinnati"
+, address =     "Cincinnati, OH"
+, year =        1985
 }
 
 @article{h-apstc-96
-, author =	"P. M. Hubbard"
-, title =	"Approximating Polyhedra with Spheres for Time-Critical Collision Detection"
-, journal =	"ACM Trans. Graph."
-, volume =	15
-, number =	3
-, month =	jul
-, year =	1996
-, pages =	"179--210"
-, update =	"97.03 held"
+, author =      "P. M. Hubbard"
+, title =       "Approximating Polyhedra with Spheres for Time-Critical Collision Detection"
+, journal =     "ACM Trans. Graph."
+, volume =      15
+, number =      3
+, month =       jul
+, year =        1996
+, pages =       "179--210"
+, update =      "97.03 held"
 }
 
 @article{h-cdiga-95
-, author =	"Philip M. Hubbard"
-, title =	"Collision detection for interactive graphics applications"
-, journal =	"IEEE Trans. Visualization and Computer Graphics"
-, volume =	1
-, number =	3
-, month =	sep
-, year =	1995
-, pages =	"218--230"
-, keywords =	"collision detection, intersection detection, sphere trees"
-, update =	"96.09 devillers, 96.01 mitchell"
+, author =      "Philip M. Hubbard"
+, title =       "Collision detection for interactive graphics applications"
+, journal =     "IEEE Trans. Visualization and Computer Graphics"
+, volume =      1
+, number =      3
+, month =       sep
+, year =        1995
+, pages =       "218--230"
+, keywords =    "collision detection, intersection detection, sphere trees"
+, update =      "96.09 devillers, 96.01 mitchell"
 }
 
 @article{h-iarat-96
-, author =	"Philip M. Hubbard"
-, title =	"Improving Accuracy in a Robust Algorithm for Three-Dimensional {Voronoi} Diagrams"
-, journal =	"Journal of Graphics Tools"
-, volume =	1
-, number =	1
-, year =	1996
-, pages =	"33--47"
-, update =	"96.09 held+hubbard"
-, annote =	"Extends \cite{iss-nriac-92}"
-, abstract =	"This paper describes extensions to a previous algorithm that
+, author =      "Philip M. Hubbard"
+, title =       "Improving Accuracy in a Robust Algorithm for Three-Dimensional {Voronoi} Diagrams"
+, journal =     "Journal of Graphics Tools"
+, volume =      1
+, number =      1
+, year =        1996
+, pages =       "33--47"
+, update =      "96.09 held+hubbard"
+, annote =      "Extends \cite{iss-nriac-92}"
+, abstract =    "This paper describes extensions to a previous algorithm that
                  robustly builds three-dimensional Voronoi diagrams in the
                  presence of inexact numerical computations.  The extensions
                  improve the algorithm's accuracy, making its results more
@@ -78938,77 +78938,77 @@ @article{h-iarat-96
 }
 
 @inproceedings{h-icd-93
-, author =	"P. M. Hubbard"
-, title =	"Interactive Collision Detection"
-, booktitle =	"Proc. IEEE Symposium on Research Frontiers in Virtual Reality"
-, year =	1993
-, pages =	"24--31"
-, update =	"95.01 mitchell"
+, author =      "P. M. Hubbard"
+, title =       "Interactive Collision Detection"
+, booktitle =   "Proc. IEEE Symposium on Research Frontiers in Virtual Reality"
+, year =        1993
+, pages =       "24--31"
+, update =      "95.01 mitchell"
 }
 
 @techreport{h-stbcd-93
-, author =	"P. M. Hubbard"
-, title =	"Space-Time Bounds for Collision Detection"
-, type =	"Technical Report CS-93-04"
-, institution =	"Dept. of Computer Science, Brown University"
-, month =	feb
-, year =	1993
-, update =	"95.01 mitchell"
+, author =      "P. M. Hubbard"
+, title =       "Space-Time Bounds for Collision Detection"
+, type =        "Technical Report CS-93-04"
+, institution = "Dept. of Computer Science, Brown University"
+, month =       feb
+, year =        1993
+, update =      "95.01 mitchell"
 }
 
 @article{hw-rffam-68
-, author =	"D. H. Hubel and T. N. Wiesel"
-, title =	"Receptive fields and functional architecture of monkey striate cortex"
-, journal =	"J. Physiol. (London)"
-, volume =	195
-, year =	1968
-, pages =	"215--243"
-, update =	"98.07 bibrelex"
+, author =      "D. H. Hubel and T. N. Wiesel"
+, title =       "Receptive fields and functional architecture of monkey striate cortex"
+, journal =     "J. Physiol. (London)"
+, volume =      195
+, year =        1968
+, pages =       "215--243"
+, update =      "98.07 bibrelex"
 }
 
 @article{hw-srgoc-74
-, author =	"D. H. Hubel and T. N. Wiesel"
-, title =	"Sequence regularity and geometry of orientation columns in the monkey striate cortex"
-, journal =	"J. Comp. Neurol."
-, volume =	158
-, year =	1974
-, pages =	"267--293"
-, update =	"98.07 bibrelex"
+, author =      "D. H. Hubel and T. N. Wiesel"
+, title =       "Sequence regularity and geometry of orientation columns in the monkey striate cortex"
+, journal =     "J. Comp. Neurol."
+, volume =      158
+, year =        1974
+, pages =       "267--293"
+, update =      "98.07 bibrelex"
 }
 
 @mastersthesis{h-radeu-84
-, author =	"F. Huber"
-, title =	"Rekursive {Aufteilungen} der {Ebene} und des {Raumes} f{\"u}r {Bereichsuchverfahren}"
-, type =	"{Dipl.-Ing.} master thesis"
-, school =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1984
-, keywords =	"master thesis"
-, comments =	"61 pp."
-, update =	"93.09 rote"
+, author =      "F. Huber"
+, title =       "Rekursive {Aufteilungen} der {Ebene} und des {Raumes} f{\"u}r {Bereichsuchverfahren}"
+, type =        "{Dipl.-Ing.} master thesis"
+, school =      "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1984
+, keywords =    "master thesis"
+, comments =    "61 pp."
+, update =      "93.09 rote"
 }
 
 @article{h-rsr-72
-, author =	"P. J. Huber"
-, title =	"Robust statistics: a review"
-, journal =	"Ann. Math. Statist."
-, volume =	43
-, number =	3
-, year =	1972
-, pages =	"1041--1067"
-, update =	"98.07 bibrelex"
+, author =      "P. J. Huber"
+, title =       "Robust statistics: a review"
+, journal =     "Ann. Math. Statist."
+, volume =      43
+, number =      3
+, year =        1972
+, pages =       "1041--1067"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{hr-cdr-97
-, author =	"Mia Hubert and Peter J. Rousseeuw"
-, title =	"The Catline for Deep Regression"
-, type =	"Manuscript"
-, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
-, year =	1997
-, keywords =	"breakdown value, heteroscedasticity, influence function, regression depth, robust regression"
-, comments =	"to appear, Journal of Multivariate Analysis"
-, update =	"98.07 mitchell"
-, abstract =	"
+, author =      "Mia Hubert and Peter J. Rousseeuw"
+, title =       "The Catline for Deep Regression"
+, type =        "Manuscript"
+, institution = "Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
+, year =        1997
+, keywords =    "breakdown value, heteroscedasticity, influence function, regression depth, robust regression"
+, comments =    "to appear, Journal of Multivariate Analysis"
+, update =      "98.07 mitchell"
+, abstract =    "
 Motivated by the notion of regression depth (Rousseeuw and Hubert
 1996) we introduce the catline, a new method for simple linear
 regression. At any bivariate data set $Z_n=\{(x_i,y_i);i=1,...,n\}$
@@ -79028,3873 +79028,3873 @@ @techreport{hr-cdr-97
 }
 
 @article{hkv-dchfs-81
-, author =	"A. H{\"u}bler and R. Klette and K. Vob"
-, title =	"Determination of the convex hull of a finite set of planar points within linear time"
-, journal =	"Elektron. Informationsverarb. Kybernet."
-, volume =	17
-, year =	1981
-, pages =	"121--139"
+, author =      "A. H{\"u}bler and R. Klette and K. Vob"
+, title =       "Determination of the convex hull of a finite set of planar points within linear time"
+, journal =     "Elektron. Informationsverarb. Kybernet."
+, volume =      17
+, year =        1981
+, pages =       "121--139"
 }
 
 @article{hz-ffchs-82
-, author =	"H. Hubschman and S. W. Zucker"
-, title =	"Frame-to-frame coherence and the hidden surface computation: constraints for a convex world"
-, journal =	"ACM Trans. Graph."
-, volume =	1
-, year =	1982
-, pages =	"129--162"
+, author =      "H. Hubschman and S. W. Zucker"
+, title =       "Frame-to-frame coherence and the hidden surface computation: constraints for a convex world"
+, journal =     "ACM Trans. Graph."
+, volume =      1
+, year =        1982
+, pages =       "129--162"
 }
 
 @inproceedings{h-gaa-88
-, author =	"U. Huckenbeck"
-, title =	"Geometrical abstract automata"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"217--231"
-, keywords =	"computational model"
-, update =	"00.03 bibrelex, 99.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "U. Huckenbeck"
+, title =       "Geometrical abstract automata"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "217--231"
+, keywords =    "computational model"
+, update =      "00.03 bibrelex, 99.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @techreport{h-gm-86
-, author =	"U. Huckenbeck"
-, title =	"Geometrische {Maschinenmodelle}"
-, type =	"Report"
-, number =	"??"
-, institution =	"Bayerische Julius-Maximilians-Univ."
-, address =	"W{\"u}rzburg, West Germany"
-, year =	1986
+, author =      "U. Huckenbeck"
+, title =       "Geometrische {Maschinenmodelle}"
+, type =        "Report"
+, number =      "??"
+, institution = "Bayerische Julius-Maximilians-Univ."
+, address =     "W{\"u}rzburg, West Germany"
+, year =        1986
 }
 
 @inproceedings{h-kaogr-90
-, author =	"Ulrich Huckenbeck"
-, title =	"{Kreisscheiben} als {Orakel} f{\"u}r geometrische {Random} {Access} {Machines}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	14
-, update =	"00.03 bibrelex"
+, author =      "Ulrich Huckenbeck"
+, title =       "{Kreisscheiben} als {Orakel} f{\"u}r geometrische {Random} {Access} {Machines}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       14
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{h-uazlm-89
-, author =	"U. Huckenbeck"
-, title =	"{{\"U}ber} die {Ausdrucksm{\"a}chtigkeit} von {Zirkel-} und {Lineal}-{Maschinen}, die die {Gleicheit} von {Punkten} entscheiden k{\"o}nnen"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "U. Huckenbeck"
+, title =       "{{\"U}ber} die {Ausdrucksm{\"a}chtigkeit} von {Zirkel-} und {Lineal}-{Maschinen}, die die {Gleicheit} von {Punkten} entscheiden k{\"o}nnen"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @article{hm-ndsrs-82
-, author =	"S. Huddleston and K. Mehlhorn"
-, title =	"A New Data Structure for Representing Sorted Lists"
-, journal =	"Acta Inform."
-, volume =	17
-, year =	1982
-, pages =	"157--184"
-, update =	"94.01 tamassia"
+, author =      "S. Huddleston and K. Mehlhorn"
+, title =       "A New Data Structure for Representing Sorted Lists"
+, journal =     "Acta Inform."
+, volume =      17
+, year =        1982
+, pages =       "157--184"
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{hmclhz-aocus-97
-, author =	"T. Hudson and D. Manocha and J. Cohen and M. Lin and K. Hoff and H. Zhang"
-, title =	"Accelerated Occlusion Culling Using Shadow Frustra"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"1--10"
-, cites =	"arb-tiriu-90, bcgmt-bhrs3-96, bdeg-vmpv-94, c-oaitd-89, c-hgmvs-76, c-arscg-88, clmp-iciec-95, c-sacg-77, ct-tccv-96, ct-rtocm-97, d-soshs-94, fdfh-cgpp-90, fkn-vsgpt-80, f-riga-96, gbw-ivlgd-90, gcs-ecrag-91, gjk-fpcdb-88, gkm-hzbv-93, glm-othsr-96, g-dirsc-94, hhk-rsops-89, hkm-ecdmv-95, kk-rtcs-86, lc-eaidc-91, lg-pmsfe-95, m-wcohs-87, mn-lpcgc-95, ms-foscp-85, m-eahsr-89, n-isgpt-92, s-lpchm-90, sss-cthsa-74, ts-vpiw-91, yr-vcewc-96, zmhh-vcuho-97t, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "T. Hudson and D. Manocha and J. Cohen and M. Lin and K. Hoff and H. Zhang"
+, title =       "Accelerated Occlusion Culling Using Shadow Frustra"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "1--10"
+, cites =       "arb-tiriu-90, bcgmt-bhrs3-96, bdeg-vmpv-94, c-oaitd-89, c-hgmvs-76, c-arscg-88, clmp-iciec-95, c-sacg-77, ct-tccv-96, ct-rtocm-97, d-soshs-94, fdfh-cgpp-90, fkn-vsgpt-80, f-riga-96, gbw-ivlgd-90, gcs-ecrag-91, gjk-fpcdb-88, gkm-hzbv-93, glm-othsr-96, g-dirsc-94, hhk-rsops-89, hkm-ecdmv-95, kk-rtcs-86, lc-eaidc-91, lg-pmsfe-95, m-wcohs-87, mn-lpcgc-95, ms-foscp-85, m-eahsr-89, n-isgpt-92, s-lpchm-90, sss-cthsa-74, ts-vpiw-91, yr-vcewc-96, zmhh-vcuho-97t, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{hj-gifdg-68
-, author =	"D. L. Huff and G. F. Jenks"
-, title =	"A geographic interpretation of the friction of distance in gravity models"
-, journal =	"Annals of the Association of American Geographers"
-, volume =	"??"
-, year =	1968
-, update =	"97.11 bibrelex"
+, author =      "D. L. Huff and G. F. Jenks"
+, title =       "A geographic interpretation of the friction of distance in gravity models"
+, journal =     "Annals of the Association of American Geographers"
+, volume =      "??"
+, year =        1968
+, update =      "97.11 bibrelex"
 }
 
 @article{hl-ius-79
-, author =	"D. L. Huff and J. M. Lutz"
-, title =	"Ireland's urban system"
-, journal =	"Economic Geography"
-, volume =	"??"
-, year =	1979
-, update =	"97.11 bibrelex"
+, author =      "D. L. Huff and J. M. Lutz"
+, title =       "Ireland's urban system"
+, journal =     "Economic Geography"
+, volume =      "??"
+, year =        1979
+, update =      "97.11 bibrelex"
 }
 
 @article{h-dcaps-77
-, author =	"D. Huffman"
-, title =	"A duality concept for the analysis of polyhedral scenes"
-, journal =	"Machine Intelligence"
-, volume =	8
-, year =	1977
-, pages =	"475--492"
-, update =	"97.11 bibrelex"
+, author =      "D. Huffman"
+, title =       "A duality concept for the analysis of polyhedral scenes"
+, journal =     "Machine Intelligence"
+, volume =      8
+, year =        1977
+, pages =       "475--492"
+, update =      "97.11 bibrelex"
 }
 
 @article{h-ions-71
-, author =	"D. Huffman"
-, title =	"Impossible objects as nonsense sentences"
-, journal =	"Machine Intelligence"
-, volume =	6
-, year =	1971
-, pages =	"295--323"
-, update =	"97.11 bibrelex"
+, author =      "D. Huffman"
+, title =       "Impossible objects as nonsense sentences"
+, journal =     "Machine Intelligence"
+, volume =      6
+, year =        1971
+, pages =       "295--323"
+, update =      "97.11 bibrelex"
 }
 
 @article{h-ccpp-76
-, author =	"D. A. Huffman"
-, title =	"Curvatures and creases: a primer on paper"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-25"
-, year =	1976
-, pages =	"1010--1019"
-, update =	"97.11 bibrelex"
+, author =      "D. A. Huffman"
+, title =       "Curvatures and creases: a primer on paper"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-25"
+, year =        1976
+, pages =       "1010--1019"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{h-apbmt-95
-, author =	"A. Hufnagel"
-, title =	"Algorithmic problems in {Brunn}-{Minkowski} theory"
-, school =	"??"
-, address =	"Trier, Germany"
-, year =	1995
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "A. Hufnagel"
+, title =       "Algorithmic problems in {Brunn}-{Minkowski} theory"
+, school =      "??"
+, address =     "Trier, Germany"
+, year =        1995
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{h-gamp-97
-, author =	"K. Hui"
-, title =	"Geometric aspects of mouldability of parts"
-, journal =	"Comput. Aided Design"
-, volume =	29
-, year =	1997
-, pages =	"107--208"
-, update =	"98.07 bibrelex"
+, author =      "K. Hui"
+, title =       "Geometric aspects of mouldability of parts"
+, journal =     "Comput. Aided Design"
+, volume =      29
+, year =        1997
+, pages =       "107--208"
+, update =      "98.07 bibrelex"
 }
 
 @article{ht-mdsoh-92
-, author =	"K. Hui and S. Tan"
-, title =	"Mould design with sweep operations - a heuristic search approach"
-, journal =	"Comput. Aided Design"
-, volume =	24
-, year =	1992
-, pages =	"81--91"
-, update =	"98.07 bibrelex"
+, author =      "K. Hui and S. Tan"
+, title =       "Mould design with sweep operations - a heuristic search approach"
+, journal =     "Comput. Aided Design"
+, volume =      24
+, year =        1992
+, pages =       "81--91"
+, update =      "98.07 bibrelex"
 }
 
 @article{h-ssisa-94
-, author =	"K. C. Hui"
-, title =	"Solid Sweeping in Image Space -- Application in {NC} Simulation"
-, journal =	"Visual Comput."
-, volume =	10
-, number =	6
-, year =	1994
-, pages =	"306--316"
-, update =	"96.01 held"
+, author =      "K. C. Hui"
+, title =       "Solid Sweeping in Image Space -- Application in {NC} Simulation"
+, journal =     "Visual Comput."
+, volume =      10
+, number =      6
+, year =        1994
+, pages =       "306--316"
+, update =      "96.01 held"
 }
 
 @article{hk-dppsm-95
-, author =	"K. C. Hui and Y. M. Kan"
-, title =	"Data Partitioning for Parallel Solid Modeling"
-, journal =	"Visual Comput."
-, volume =	11
-, number =	10
-, year =	1995
-, pages =	"526--541"
-, update =	"96.05 held"
+, author =      "K. C. Hui and Y. M. Kan"
+, title =       "Data Partitioning for Parallel Solid Modeling"
+, journal =     "Visual Comput."
+, volume =      11
+, number =      10
+, year =        1995
+, pages =       "526--541"
+, update =      "96.05 held"
 }
 
 @incollection{hj-r3dor-88
-, author =	"D. P. Huijsmans and G. H. Jense"
-, title =	"Representation of 3${D}$ Objects Reconstructed from Series of Parallel 2${D}$ Slices"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series"
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"1031--1038"
-, isbn =	"3-540-19506-8"
-, update =	"93.09 held"
+, author =      "D. P. Huijsmans and G. H. Jense"
+, title =       "Representation of 3${D}$ Objects Reconstructed from Series of Parallel 2${D}$ Slices"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series"
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "1031--1038"
+, isbn =        "3-540-19506-8"
+, update =      "93.09 held"
 }
 
 @article{h-ajddb-83
-, author =	"R. Hull"
-, title =	"Acyclic join dependency and data base projections"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	27
-, year =	1983
-, pages =	"331--349"
+, author =      "R. Hull"
+, title =       "Acyclic join dependency and data base projections"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      27
+, year =        1983
+, pages =       "331--349"
 }
 
 @article{h-mfo-94
-, author =	"T. Hull"
-, title =	"On the mathematics of flat origamis"
-, journal =	"Congr. Numer."
-, volume =	100
-, year =	1994
-, pages =	"215--224"
-, update =	"97.11 bibrelex"
+, author =      "T. Hull"
+, title =       "On the mathematics of flat origamis"
+, journal =     "Congr. Numer."
+, volume =      100
+, year =        1994
+, pages =       "215--224"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{hmpt-agdsa-97
-, author =	"Christoph Hundack and Petra Mutzel and Igor Pouchkarev and Stefan Thome"
-, title =	"{\em ArchE}: A Graph Drawing System for Archaeology"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"297--302"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Christoph Hundack and Petra Mutzel and Igor Pouchkarev and Stefan Thome"
+, title =       "{\em ArchE}: A Graph Drawing System for Archaeology"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "297--302"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{hi-cchqs-95
-, author =	"Chao-Kuei Hung and Doug Ierardi"
-, title =	"Constructing Convex Hulls of Quadratic Surface Patches"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"255--260"
-, update =	"95.09 jones"
+, author =      "Chao-Kuei Hung and Doug Ierardi"
+, title =       "Constructing Convex Hulls of Quadratic Surface Patches"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "255--260"
+, update =      "95.09 jones"
 }
 
 @article{hp-asdmr-94
-, author =	"C. Y. Hung and B. Parhami"
-, title =	"An approximate sign detection method for residue numbers and its applications to {RNS} division"
-, journal =	"Comput. Math. Appl."
-, volume =	27
-, number =	4
-, year =	1994
-, pages =	"23--35"
-, update =	"98.07 bibrelex"
+, author =      "C. Y. Hung and B. Parhami"
+, title =       "An approximate sign detection method for residue numbers and its applications to {RNS} division"
+, journal =     "Comput. Math. Appl."
+, volume =      27
+, number =      4
+, year =        1994
+, pages =       "23--35"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{hc-qpp-91
-, author =	"Yung-Chen Hung and Gen-Huey Chen"
-, title =	"On the Quickest Path Problem"
-, booktitle =	"??"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	497
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Yung-Chen Hung and Gen-Huey Chen"
+, title =       "On the Quickest Path Problem"
+, booktitle =   "??"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      497
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{hg-nmcdt-86
-, author =	"C. J. Hunt and C. Greenough"
-, title =	"Novel Method for the Computation of the {Delaunay} Triangulation with a View to Efficient Use of Parallel Architectures"
-, number =	"RAL-86-090"
-, institution =	"Science and Engineering Research Council, Chilton (England). Rutherford Appleton Lab."
-, month =	oct
-, year =	1986
-, keywords =	"foreign technology, Delaunay triangulation, mapping (transformations), mesh generation, ntistfser"
-, update =	"93.09 rote"
-, abstract =	"In recent years a multitude of techniques have been
-		 presented for generating the Delaunay triangulation of
-		 a set of points in the plane. Many of these methods
-		 have been extended to connect points in three
-		 dimensions with varied success. All of these methods
-		 are serial processes. Nodes must be added one by one to
-		 an existing Delaunay triangulation. Consequently
-		 although these methods may be efficient on a serial
-		 machine, they cannot exploit the full potential of
-		 highly parallel architectures. In the report the
-		 authors discuss an alternative method for computing the
-		 Delaunay triangulation of a set of points in the plane.
-		 The algorithm is optimal in performance on a serial
-		 machine computing the triangulation in order N(log to
-		 the base 2)N time for N nodes. In addition it appears
-		 that the algorithm will transport to an array processor
-		 giving order (log to the base 2)N time for N nodes. The
-		 algorithm has potential for extension into higher space
-		 dimensions. The research has application for the
-		 simulation of semiconductor devices."
+, author =      "C. J. Hunt and C. Greenough"
+, title =       "Novel Method for the Computation of the {Delaunay} Triangulation with a View to Efficient Use of Parallel Architectures"
+, number =      "RAL-86-090"
+, institution = "Science and Engineering Research Council, Chilton (England). Rutherford Appleton Lab."
+, month =       oct
+, year =        1986
+, keywords =    "foreign technology, Delaunay triangulation, mapping (transformations), mesh generation, ntistfser"
+, update =      "93.09 rote"
+, abstract =    "In recent years a multitude of techniques have been
+                 presented for generating the Delaunay triangulation of
+                 a set of points in the plane. Many of these methods
+                 have been extended to connect points in three
+                 dimensions with varied success. All of these methods
+                 are serial processes. Nodes must be added one by one to
+                 an existing Delaunay triangulation. Consequently
+                 although these methods may be efficient on a serial
+                 machine, they cannot exploit the full potential of
+                 highly parallel architectures. In the report the
+                 authors discuss an alternative method for computing the
+                 Delaunay triangulation of a set of points in the plane.
+                 The algorithm is optimal in performance on a serial
+                 machine computing the triangulation in order N(log to
+                 the base 2)N time for N nodes. In addition it appears
+                 that the algorithm will transport to an array processor
+                 giving order (log to the base 2)N time for N nodes. The
+                 algorithm has potential for extension into higher space
+                 dimensions. The research has application for the
+                 simulation of semiconductor devices."
 }
 
 @inproceedings{hmrrrs-uaasn-95
-, author =	"H. B. {Hunt III} and M. V. Marathe and V. Radhakrishnan and S. S. Ravi and D. J. Rosenkrantz and R. E. Stearns"
-, title =	"A unified approach to approximation schemes for {NP}- and {PSPACE}-hard problems for geometric graphs"
-, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, year =	1995
-, pages =	"424--435"
-, update =	"97.07 agarwal"
+, author =      "H. B. {Hunt III} and M. V. Marathe and V. Radhakrishnan and S. S. Ravi and D. J. Rosenkrantz and R. E. Stearns"
+, title =       "A unified approach to approximation schemes for {NP}- and {PSPACE}-hard problems for geometric graphs"
+, booktitle =   "Proc. 2nd Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, year =        1995
+, pages =       "424--435"
+, update =      "97.07 agarwal"
 }
 
 @book{h-kgm-78
-, author =	"K. H. Hunt"
-, title =	"Kinematic geometry of mechanisms"
-, publisher =	"Oxford University Press"
-, address =	"New York"
-, year =	1978
-, update =	"00.11 smid, 00.07 icking, 98.07 orourke"
+, author =      "K. H. Hunt"
+, title =       "Kinematic geometry of mechanisms"
+, publisher =   "Oxford University Press"
+, address =     "New York"
+, year =        1978
+, update =      "00.11 smid, 00.07 icking, 98.07 orourke"
 }
 
 @techreport{hv-esavp-82
-, author =	"W. A. Hunt and H. B. Voelcker"
-, title =	"An Exploratory Study of Automatic Verification of Programs for Numerically Controlled Machine Tools"
-, type =	"Production Automation Project Tech Memo"
-, number =	34
-, institution =	"Univ. Rochester"
-, address =	"Rochester, NY"
-, month =	jan
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "W. A. Hunt and H. B. Voelcker"
+, title =       "An Exploratory Study of Automatic Verification of Programs for Numerically Controlled Machine Tools"
+, type =        "Production Automation Project Tech Memo"
+, number =      34
+, institution = "Univ. Rochester"
+, address =     "Rochester, NY"
+, month =       jan
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{h-ecdsg-78
-, author =	"G. M. Hunter"
-, title =	"Efficient computation and data structures for graphics"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NY"
-, year =	1978
-, keywords =	"doctoral thesis"
+, author =      "G. M. Hunter"
+, title =       "Efficient computation and data structures for graphics"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NY"
+, year =        1978
+, keywords =    "doctoral thesis"
 }
 
 @article{hs-ltprq-79
-, author =	"G. M. Hunter and K. Steiglitz"
-, title =	"Linear transformations of pictures represented by quad trees"
-, journal =	"Comput. Graph. Image Process."
-, volume =	10
-, year =	1979
-, pages =	"289--296"
+, author =      "G. M. Hunter and K. Steiglitz"
+, title =       "Linear transformations of pictures represented by quad trees"
+, journal =     "Comput. Graph. Image Process."
+, volume =      10
+, year =        1979
+, pages =       "289--296"
 }
 
 @article{hs-oiuqt-79
-, author =	"G. M. Hunter and K. Steiglitz"
-, title =	"Operations on images using quad trees"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-1"
-, year =	1979
-, pages =	"145--153"
+, author =      "G. M. Hunter and K. Steiglitz"
+, title =       "Operations on images using quad trees"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-1"
+, year =        1979
+, pages =       "145--153"
 }
 
 @book{hw-dt-48
-, author =	"W. Hurewitcz and H. Wallman"
-, title =	"Dimension Theory"
-, publisher =	"Princeton University Press"
-, year =	1948
-, update =	"98.03 bibrelex"
+, author =      "W. Hurewitcz and H. Wallman"
+, title =       "Dimension Theory"
+, publisher =   "Princeton University Press"
+, year =        1948
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{h-ltw-93
-, author =	"F. Hurtado"
-, title =	"Looking through a window"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"234--239"
-, cites =	"bhot-oaa-93, h-pgv-93, t-stc-88, t-wpop-89, abdeghz-umpca-93, abdeghz-ump2, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "F. Hurtado"
+, title =       "Looking through a window"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "234--239"
+, cites =       "bhot-oaa-93, h-pgv-93, t-stc-88, t-wpop-89, abdeghz-umpca-93, abdeghz-ump2, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @phdthesis{h-pgv-93
-, author =	"F. Hurtado"
-, title =	"Problemas geom{\'e}tricos de visibilidad"
-, school =	"Univ. Polit{\'e}cnica de Catalunya"
-, month =	jan
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "F. Hurtado"
+, title =       "Problemas geom{\'e}tricos de visibilidad"
+, school =      "Univ. Polit{\'e}cnica de Catalunya"
+, month =       jan
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{hlm-osrap-01
-, author =	"Ferran Hurtado and Giuseppe Liotta and Henk Meijer"
-, title =	"Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"117--120"
-, update =	"01.04 icking"
+, author =      "Ferran Hurtado and Giuseppe Liotta and Henk Meijer"
+, title =       "Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "117--120"
+, update =      "01.04 icking"
 }
 
 @inproceedings{hmrs-tpslp-99
-, author =	"Ferran Hurtado and Merc{\`e} Mora and Pedro A. Ramos and Carlos Seara"
-, title =	"Two Problems on Separability with Lines and Polygonals"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"33--35"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Ferran Hurtado and Merc{\`e} Mora and Pedro A. Ramos and Carlos Seara"
+, title =       "Two Problems on Separability with Lines and Polygonals"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "33--35"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{hn-ctacp-97
-, author =	"F. Hurtado and M. Noy"
-, title =	"Counting triangulations of almost-convex polygons"
-, journal =	"Ars Combin."
-, volume =	45
-, year =	1997
-, pages =	"169--179"
-, update =	"99.11 smid"
+, author =      "F. Hurtado and M. Noy"
+, title =       "Counting triangulations of almost-convex polygons"
+, journal =     "Ars Combin."
+, volume =      45
+, year =        1997
+, pages =       "169--179"
+, update =      "99.11 smid"
 }
 
 @article{hn-etcn-96
-, author =	"F. Hurtado and M. Noy"
-, title =	"Ears of triangulations and {Catalan} numbers"
-, journal =	"Discrete Math."
-, volume =	149
-, year =	1996
-, pages =	"319--324"
-, update =	"99.11 smid"
+, author =      "F. Hurtado and M. Noy"
+, title =       "Ears of triangulations and {Catalan} numbers"
+, journal =     "Discrete Math."
+, volume =      149
+, year =        1996
+, pages =       "319--324"
+, update =      "99.11 smid"
 }
 
 @article{hn-gtcpt-99
-, author =	"F. Hurtado and M. Noy"
-, title =	"Graph of triangulations of a convex polygon and tree of triangulations"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, year =	1999
-, pages =	"179--188"
-, update =	"99.11 smid"
+, author =      "F. Hurtado and M. Noy"
+, title =       "Graph of triangulations of a convex polygon and tree of triangulations"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, year =        1999
+, pages =       "179--188"
+, update =      "99.11 smid"
 }
 
 @techreport{hn-gtcp-94
-, author =	"F. Hurtado and M. Noy"
-, title =	"The Graph of Triangulations of a Convex Polygon"
-, number =	"MA2-IR-94-13"
-, institution =	"Universitat Polit{\`e}cnica de Catalunya, Spain"
-, year =	1994
-, precedes =	"hn-gtcp-95"
-, update =	"00.11 smid, 00.07 icking, 97.11 bibrelex, 97.03 devillers, 93.09 held"
+, author =      "F. Hurtado and M. Noy"
+, title =       "The Graph of Triangulations of a Convex Polygon"
+, number =      "MA2-IR-94-13"
+, institution = "Universitat Polit{\`e}cnica de Catalunya, Spain"
+, year =        1994
+, precedes =    "hn-gtcp-95"
+, update =      "00.11 smid, 00.07 icking, 97.11 bibrelex, 97.03 devillers, 93.09 held"
 }
 
 @inproceedings{hn-gtcp-95
-, author =	"F. Hurtado and M. Noy"
-, title =	"The Graph of Triangulations of a Convex Polygon"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"11--12"
-, succeeds =	"hn-gtcp-94"
-, precedes =	"hn-gtcp-96"
-, update =	"00.11 smid, 00.07 icking, 00.03 bibrelex"
+, author =      "F. Hurtado and M. Noy"
+, title =       "The Graph of Triangulations of a Convex Polygon"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "11--12"
+, succeeds =    "hn-gtcp-94"
+, precedes =    "hn-gtcp-96"
+, update =      "00.11 smid, 00.07 icking, 00.03 bibrelex"
 }
 
 @inproceedings{hn-gtcp-96
-, author =	"F. Hurtado and M. Noy"
-, title =	"The Graph of Triangulations of a Convex Polygon"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"C7--C8"
-, succeeds =	"hn-gtcp-95"
-, cites =	"f-nddf-87, hn-gtcp-94, hnu-fet-96, kt-rduf-??, l-atng-89, l-rgbth-88, lrr-rgbth-93, stt-rdthg-86, ZZZ"
-, update =	"00.11 smid, 00.07 icking, 97.11 bibrelex, 96.05 efrat"
+, author =      "F. Hurtado and M. Noy"
+, title =       "The Graph of Triangulations of a Convex Polygon"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "C7--C8"
+, succeeds =    "hn-gtcp-95"
+, cites =       "f-nddf-87, hn-gtcp-94, hnu-fet-96, kt-rduf-??, l-atng-89, l-rgbth-88, lrr-rgbth-93, stt-rdthg-86, ZZZ"
+, update =      "00.11 smid, 00.07 icking, 97.11 bibrelex, 96.05 efrat"
 }
 
 @techreport{hn-tvgrv-93t
-, author =	"F. Hurtado and M. Noy"
-, title =	"Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon"
-, number =	"MA2-IR-93-2"
-, institution =	"Dept. Applied Mathematics, U. Polit\`ecnica de Catalunya, Spain"
-, month =	feb
-, year =	1993
-, precedes =	"hn-tvgrv-96"
-, update =	"97.11 icking, 97.03 devillers, 93.09 held"
+, author =      "F. Hurtado and M. Noy"
+, title =       "Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon"
+, number =      "MA2-IR-93-2"
+, institution = "Dept. Applied Mathematics, U. Polit\`ecnica de Catalunya, Spain"
+, month =       feb
+, year =        1993
+, precedes =    "hn-tvgrv-96"
+, update =      "97.11 icking, 97.03 devillers, 93.09 held"
 }
 
 @inproceedings{hn-tvgrv-93i
-, author =	"Ferran Hurtado and M. Noy"
-, title =	"Triangulations, Visibility Graph and Reflex Vertices of a Simple polygon"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"36--39"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Ferran Hurtado and M. Noy"
+, title =       "Triangulations, Visibility Graph and Reflex Vertices of a Simple polygon"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "36--39"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @article{hn-tvgrv-96
-, author =	"F. Hurtado and M. Noy"
-, title =	"Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"355--369"
-, succeeds =	"hn-tvgrv-93t, hn-tvgrv-93i"
-, update =	"98.03 bibrelex, 97.03 devillers"
+, author =      "F. Hurtado and M. Noy"
+, title =       "Triangulations, Visibility Graph and Reflex Vertices of a Simple Polygon"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "355--369"
+, succeeds =    "hn-tvgrv-93t, hn-tvgrv-93i"
+, update =      "98.03 bibrelex, 97.03 devillers"
 }
 
 @inproceedings{hnrs-sopws-98
-, author =	"Ferran Hurtado and Marc Noy and Pedro A. Ramos and Carlos Seara"
-, title =	"Separating Objects in the Plane with Wedges and Strips"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"97--98"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Ferran Hurtado and Marc Noy and Pedro A. Ramos and Carlos Seara"
+, title =       "Separating Objects in the Plane with Wedges and Strips"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "97--98"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{hnu-fet-96
-, author =	"F. Hurtado and M. Noy and J. Urrutia"
-, title =	"Flipping Edges in Triangulations"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"214--223"
-, cites =	"ahms-htfr-94, b-ras-77, be-mgot-92i, bs-plibp-94, ff-mrnti-91, f-vddt-92, h-ncmmt-90, hn-gtcp-94, hn-tvgrv-96, h-femgm-88, kgv-osa-83, la-satp-87, l-scsi-77, lrr-rgbth-93, ls-sdiuc-94, l-rgbth-88, obs-stcav-92, qs-csfdd-90, s-jttm-87, ss-gbfam-88, s-tc-93, sr-sbuss-95, sntm-amgus-92, stt-rdthg-88, t-nrcgr-86, w-cqsis-92, wp-sst-84, y-cdcrc-75, zt-fem-89, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "F. Hurtado and M. Noy and J. Urrutia"
+, title =       "Flipping Edges in Triangulations"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "214--223"
+, cites =       "ahms-htfr-94, b-ras-77, be-mgot-92i, bs-plibp-94, ff-mrnti-91, f-vddt-92, h-ncmmt-90, hn-gtcp-94, hn-tvgrv-96, h-femgm-88, kgv-osa-83, la-satp-87, l-scsi-77, lrr-rgbth-93, ls-sdiuc-94, l-rgbth-88, obs-stcav-92, qs-csfdd-90, s-jttm-87, ss-gbfam-88, s-tc-93, sr-sbuss-95, sntm-amgus-92, stt-rdthg-88, t-nrcgr-86, w-cqsis-92, wp-sst-84, y-cdcrc-75, zt-fem-89, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @article{hnu-fet-99
-, author =	"F. Hurtado and M. Noy and J. Urrutia"
-, title =	"Flipping Edges in Triangulations"
-, journal =	"Discrete Comput. Geom."
-, volume =	22
-, number =	3
-, year =	1999
-, pages =	"333--346"
-, update =	"99.11 held"
+, author =      "F. Hurtado and M. Noy and J. Urrutia"
+, title =       "Flipping Edges in Triangulations"
+, journal =     "Discrete Comput. Geom."
+, volume =      22
+, number =      3
+, year =        1999
+, pages =       "333--346"
+, update =      "99.11 held"
 }
 
 @proceedings{ht-ewcg-98
-, title =	"Abstracts 14th European Workshop Comput. Geom."
-, editor =	"Ferran Hurtado and Joan Trias"
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 14th European Workshop Comput. Geom."
+, editor =      "Ferran Hurtado and Joan Trias"
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{hnu-fetpp-96
-, author =	"Ferran Hurtatdo and Marc Noy and Jorge Urrutia"
-, title =	"Flipping edges in Triangulations of Polygons and Point Sets"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"19--20"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Ferran Hurtatdo and Marc Noy and Jorge Urrutia"
+, title =       "Flipping edges in Triangulations of Polygons and Point Sets"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "19--20"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{hsw-sclp-75
-, author =	"A. Hurter and M. Schaeffer and R. Wendell"
-, title =	"Solutions of Constrained Location Problems"
-, journal =	"Manage. Sci."
-, volume =	22
-, year =	1975
-, pages =	"51--56"
-, update =	"97.03 rote, 93.09 milone+mitchell"
+, author =      "A. Hurter and M. Schaeffer and R. Wendell"
+, title =       "Solutions of Constrained Location Problems"
+, journal =     "Manage. Sci."
+, volume =      22
+, year =        1975
+, pages =       "51--56"
+, update =      "97.03 rote, 93.09 milone+mitchell"
 }
 
 @inproceedings{hklmnrs-pnm-96
-, author =	"D. Hutchinson and L. K{\"u}ttner and M. Lanthier and A. Maheshwari and D. Nussbaum and D. Roytenberg and J.-R. Sack"
-, title =	"Parallel Neighbourhood Modeling"
-, booktitle =	"Proc. 8th ACM Sympos. Parallel Algorithms Architect."
-, nickname =	"SPAA '96"
-, site =	"Padua, Italy"
-, year =	1996
-, pages =	"204--207"
-, update =	"98.07 bibrelex, 97.11 sack"
+, author =      "D. Hutchinson and L. K{\"u}ttner and M. Lanthier and A. Maheshwari and D. Nussbaum and D. Roytenberg and J.-R. Sack"
+, title =       "Parallel Neighbourhood Modeling"
+, booktitle =   "Proc. 8th ACM Sympos. Parallel Algorithms Architect."
+, nickname =    "SPAA '96"
+, site =        "Padua, Italy"
+, year =        1996
+, pages =       "204--207"
+, update =      "98.07 bibrelex, 97.11 sack"
 }
 
 @inproceedings{hlmnrs-pnm-96
-, author =	"D. Hutchinson and M. Lanthier and A. Maheshwari and D. Nussbaum and D. Roytenberg and J.-R. Sack"
-, title =	"Parallel neighbourhood modeling"
-, booktitle =	"Proc. 4th ACM Workshop Adv. Geogr. Inform. Syst."
-, year =	1996
-, pages =	"25--34"
-, update =	"98.07 bibrelex"
+, author =      "D. Hutchinson and M. Lanthier and A. Maheshwari and D. Nussbaum and D. Roytenberg and J.-R. Sack"
+, title =       "Parallel neighbourhood modeling"
+, booktitle =   "Proc. 4th ACM Workshop Adv. Geogr. Inform. Syst."
+, year =        1996
+, pages =       "25--34"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{hlmnrs-pnm-97
-, author =	"D. Hutchinson and M. Lanthier and A. Maheshwari and D. Nussbaum and D. Roytenberg and J.-R. Sack"
-, title =	"Parallel Neighbourhood Modeling"
-, booktitle =	"Proc. ACM GIS"
-, year =	1997
-, pages =	"26--34"
-, update =	"97.11 sack"
-, annote =	"full conference version"
+, author =      "D. Hutchinson and M. Lanthier and A. Maheshwari and D. Nussbaum and D. Roytenberg and J.-R. Sack"
+, title =       "Parallel Neighbourhood Modeling"
+, booktitle =   "Proc. ACM GIS"
+, year =        1997
+, pages =       "26--34"
+, update =      "97.11 sack"
+, annote =      "full conference version"
 }
 
 @inproceedings{hmsv-eeibt-97
-, author =	"D. Hutchinson and A. Maheshwari and J.-R. Sack and R. Velicescu"
-, title =	"Early Experiences in Implementing the Buffer Tree"
-, booktitle =	"Proc. Workshop on Algorithm Engineering"
-, nickname =	"WAE '97"
-, site =	"Venice"
-, month =	sep
-, year =	1997
-, pages =	"92--103"
-, url =	"http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap10.ps.gz"
-, update =	"00.11 smid, 00.07 icking, 98.07 bibrelex+smid+vahrenhold+vismara, 98.03 mitchell"
+, author =      "D. Hutchinson and A. Maheshwari and J.-R. Sack and R. Velicescu"
+, title =       "Early Experiences in Implementing the Buffer Tree"
+, booktitle =   "Proc. Workshop on Algorithm Engineering"
+, nickname =    "WAE '97"
+, site =        "Venice"
+, month =       sep
+, year =        1997
+, pages =       "92--103"
+, url = "http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap10.ps.gz"
+, update =      "00.11 smid, 00.07 icking, 98.07 bibrelex+smid+vahrenhold+vismara, 98.03 mitchell"
 }
 
 @inproceedings{hmz-emdss-99
-, author =	"David Hutchinson and Anil Maheshwari and Norbert Zeh"
-, title =	"An External Memory Data Structure for Shortest Path Queries"
-, booktitle =	"Proc. 5th Ann. Internat. Conf. Computing and Combinatorics"
-, nickname =	"COCOON '99"
-, site =	"Tokyo, Japan"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1627
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"51--60"
-, update =	"01.04 smid, 99.11 bibrelex"
+, author =      "David Hutchinson and Anil Maheshwari and Norbert Zeh"
+, title =       "An External Memory Data Structure for Shortest Path Queries"
+, booktitle =   "Proc. 5th Ann. Internat. Conf. Computing and Combinatorics"
+, nickname =    "COCOON '99"
+, site =        "Tokyo, Japan"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1627
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "51--60"
+, update =      "01.04 smid, 99.11 bibrelex"
 }
 
 @inproceedings{hsv-rsttg-96
-, author =	"J. P. Hutchinson and T. Shermer and A. Vince"
-, title =	"On representations of some thickness-two graphs"
-, editor =	"F. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"324--332"
-, keywords =	"visibility graphs"
-, update =	"99.07 vismara, 98.11 bibrelex, 97.11 orourke, 96.09 orourke"
+, author =      "J. P. Hutchinson and T. Shermer and A. Vince"
+, title =       "On representations of some thickness-two graphs"
+, editor =      "F. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "324--332"
+, keywords =    "visibility graphs"
+, update =      "99.07 vismara, 98.11 bibrelex, 97.11 orourke, 96.09 orourke"
 }
 
 @article{hsv-rsttg-99
-, author =	"J. P. Hutchinson and T. Shermer and A. Vince"
-, title =	"On representations of some thickness-two graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, year =	1999
-, pages =	"161--171"
-, update =	"99.11 smid"
+, author =      "J. P. Hutchinson and T. Shermer and A. Vince"
+, title =       "On representations of some thickness-two graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, year =        1999
+, pages =       "161--171"
+, update =      "99.11 smid"
 }
 
 @inproceedings{hsw-gopml-88
-, author =	"A. Hutflesz and H.-W. Six and P. Widmayer"
-, title =	"Globally order preserving multidimensional linear hashing"
-, booktitle =	"Proc. 4th Intl. Conf. on Data Engineering"
-, year =	1988
-, pages =	"572--579"
-, update =	"97.07 agarwal"
+, author =      "A. Hutflesz and H.-W. Six and P. Widmayer"
+, title =       "Globally order preserving multidimensional linear hashing"
+, booktitle =   "Proc. 4th Intl. Conf. on Data Engineering"
+, year =        1988
+, pages =       "572--579"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{hsw-trfea-90
-, author =	"A. Hutflesz and H.-W. Six and P. Widmayer"
-, title =	"The {R}-file: {A}n efficient access structure for proximity queries"
-, booktitle =	"Proc. 6th IEEE Internat. Conf. Data Eng."
-, year =	1990
-, pages =	"372--379"
-, update =	"97.07 agarwal"
+, author =      "A. Hutflesz and H.-W. Six and P. Widmayer"
+, title =       "The {R}-file: {A}n efficient access structure for proximity queries"
+, booktitle =   "Proc. 6th IEEE Internat. Conf. Data Eng."
+, year =        1990
+, pages =       "372--379"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{hsw-tgfpe-88
-, author =	"A. Hutflesz and H.-W. Six and P. Widmayer"
-, title =	"Twin grid files: a performance evaluation"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"15--24"
-, update =	"00.03 bibrelex, 99.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "A. Hutflesz and H.-W. Six and P. Widmayer"
+, title =       "Twin grid files: a performance evaluation"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "15--24"
+, update =      "00.03 bibrelex, 99.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{hsw-tgfso-88
-, author =	"A. Hutflesz and H.-W. Six and P. Widmayer"
-, title =	"Twin grid files: {S}pace optimizing access schemes"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1988
-, pages =	"183--190"
-, update =	"97.07 agarwal"
+, author =      "A. Hutflesz and H.-W. Six and P. Widmayer"
+, title =       "Twin grid files: {S}pace optimizing access schemes"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1988
+, pages =       "183--190"
+, update =      "97.07 agarwal"
 }
 
 @techreport{hr-mrtci-92
-, author =	"D. P. Huttenlocher"
-, title =	"A multi-resolution technique for comparing images using the {Hausdorff} distance"
-, type =	"Technical {Report}"
-, number =	"92-1321"
-, institution =	"Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "D. P. Huttenlocher"
+, title =       "A multi-resolution technique for comparing images using the {Hausdorff} distance"
+, type =        "Technical {Report}"
+, number =      "92-1321"
+, institution = "Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{h-tdrso-88
-, author =	"D. P. Huttenlocher"
-, title =	"Three-Dimensional Recognition of Solid Objects from a Two-Dimensional Image"
-, type =	"Ph.{D}. Thesis"
-, school =	"Electrical Engineering and Computer Science, Massachusetts Institute of Technology"
-, year =	1988
-, note =	"Report TR-1045"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "D. P. Huttenlocher"
+, title =       "Three-Dimensional Recognition of Solid Objects from a Two-Dimensional Image"
+, type =        "Ph.{D}. Thesis"
+, school =      "Electrical Engineering and Computer Science, Massachusetts Institute of Technology"
+, year =        1988
+, note =        "Report TR-1045"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @inproceedings{hk-cmhdp-90
-, author =	"D. P. Huttenlocher and K. Kedem"
-, title =	"Computing the minimum {Hausdorff} distance for point sets under translation"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"340--349"
-, cites =	"achkm-ecmcp-90, amww-cssgo-88, a-ltahd-83, cd-vdbcd-85, egs-ueplf-87, hks-echdp-, h-rv-86, k-emasg-39, os-mvm-90, ls-pptmc-87, m-mdscg-84, r-ra-68, s-cidg-79, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. P. Huttenlocher and K. Kedem"
+, title =       "Computing the minimum {Hausdorff} distance for point sets under translation"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "340--349"
+, cites =       "achkm-ecmcp-90, amww-cssgo-88, a-ltahd-83, cd-vdbcd-85, egs-ueplf-87, hks-echdp-, h-rv-86, k-emasg-39, os-mvm-90, ls-pptmc-87, m-mdscg-84, r-ra-68, s-cidg-79, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{hkk-dvdmh-92t
-, author =	"D. P. Huttenlocher and K. Kedem and J. M. Kleinberg"
-, title =	"On dynamic {Voronoi} diagrams and the minimum {Hausdorff} distance for point sets under {Euclidean} motion in the plane"
-, type =	"Technical {Report}"
-, number =	"TR~92-1271"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	mar
-, year =	1992
-, precedes =	"hkk-dvdmh-92i"
+, author =      "D. P. Huttenlocher and K. Kedem and J. M. Kleinberg"
+, title =       "On dynamic {Voronoi} diagrams and the minimum {Hausdorff} distance for point sets under {Euclidean} motion in the plane"
+, type =        "Technical {Report}"
+, number =      "TR~92-1271"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       mar
+, year =        1992
+, precedes =    "hkk-dvdmh-92i"
 }
 
 @inproceedings{hkk-dvdmh-92i
-, author =	"D. P. Huttenlocher and K. Kedem and J. M. Kleinberg"
-, title =	"On dynamic {Voronoi} diagrams and the minimum {Hausdorff} distance for point sets under {Euclidean} motion in the plane"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"110--119"
-, succeeds =	"hkk-dvdmh-92t"
-, cites =	"aiit-mlcop-90, ass-sulbl-89, ast-apsgo-92, abb-amps-91, achkm-ecmcp-90, fl-vdmpp-91, gmr-vdmpp-92, gs-pmgsc-85, hs-ndssg-86, hk-cmhdp-90, hks-uevsi-91, m-prsd-87, ZZZ"
-, update =	"99.11 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
+, author =      "D. P. Huttenlocher and K. Kedem and J. M. Kleinberg"
+, title =       "On dynamic {Voronoi} diagrams and the minimum {Hausdorff} distance for point sets under {Euclidean} motion in the plane"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "110--119"
+, succeeds =    "hkk-dvdmh-92t"
+, cites =       "aiit-mlcop-90, ass-sulbl-89, ast-apsgo-92, abb-amps-91, achkm-ecmcp-90, fl-vdmpp-91, gmr-vdmpp-92, gs-pmgsc-85, hs-ndssg-86, hk-cmhdp-90, hks-uevsi-91, m-prsd-87, ZZZ"
+, update =      "99.11 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
 }
 
 @article{hkk-vdrms-92
-, author =	"D. P. Huttenlocher and K. Kedem and J. M. Kleinberg"
-, title =	"{Voronoi} diagrams of rigidly moving sets of points"
-, journal =	"Inform. Process. Lett."
-, volume =	43
-, year =	1992
-, pages =	"217--223"
-, update =	"01.04 icking, 95.09 agarwal"
+, author =      "D. P. Huttenlocher and K. Kedem and J. M. Kleinberg"
+, title =       "{Voronoi} diagrams of rigidly moving sets of points"
+, journal =     "Inform. Process. Lett."
+, volume =      43
+, year =        1992
+, pages =       "217--223"
+, update =      "01.04 icking, 95.09 agarwal"
 }
 
 @unpublished{hks-echdp-
-, author =	"D. P. Huttenlocher and K. Kedem and Micha Sharir"
-, title =	"Efficiently Computing the {Hausdorff} Distance for Point Sets Under Translation"
-, note =	"In preparation"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "D. P. Huttenlocher and K. Kedem and Micha Sharir"
+, title =       "Efficiently Computing the {Hausdorff} Distance for Point Sets Under Translation"
+, note =        "In preparation"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{hks-uevsi-91t
-, author =	"D. P. Huttenlocher and K. Kedem and Micha Sharir"
-, title =	"The upper envelope of {Voronoi} surfaces and its applications"
-, type =	"Technical {Report}"
-, number =	"200/91"
-, institution =	"Dept. Comput. Sci., Tel-Aviv University"
-, address =	"Tel-Aviv, Israel"
-, month =	feb
-, year =	1991
-, precedes =	"hks-uevsi-91"
-, update =	"01.04 icking, 98.03 mitchell, 97.11 bibrelex"
+, author =      "D. P. Huttenlocher and K. Kedem and Micha Sharir"
+, title =       "The upper envelope of {Voronoi} surfaces and its applications"
+, type =        "Technical {Report}"
+, number =      "200/91"
+, institution = "Dept. Comput. Sci., Tel-Aviv University"
+, address =     "Tel-Aviv, Israel"
+, month =       feb
+, year =        1991
+, precedes =    "hks-uevsi-91"
+, update =      "01.04 icking, 98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{hks-uevsi-91
-, author =	"D. P. Huttenlocher and K. Kedem and Micha Sharir"
-, title =	"The upper envelope of {Voronoi} surfaces and its applications"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"194--203"
-, keywords =	"Voronoi diagrams, upper envelopes, matching"
-, succeeds =	"hks-uevsi-91t"
-, precedes =	"hks-uevsi-93"
-, cites =	"abb-mrps-, ass-sulbl-89, a-vdsfg-90, cd-vdbcd-85, e-acg-87, egppss-acptc-88, egs-ueplf-89, egs-ccmfa-90, es-vda-86, gss-gmppt-89, h-fuenl-89, h-rv-86, hk-cmhdp-90, hks-uevsi-91t, hs-ndssg-86, ls-ippvd-87, ps-ueplf-89, ps-cgi-85, ss-pmp2g-83, y-oavds-87, ZZZ"
-, update =	"01.04 icking, 98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex"
+, author =      "D. P. Huttenlocher and K. Kedem and Micha Sharir"
+, title =       "The upper envelope of {Voronoi} surfaces and its applications"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "194--203"
+, keywords =    "Voronoi diagrams, upper envelopes, matching"
+, succeeds =    "hks-uevsi-91t"
+, precedes =    "hks-uevsi-93"
+, cites =       "abb-mrps-, ass-sulbl-89, a-vdsfg-90, cd-vdbcd-85, e-acg-87, egppss-acptc-88, egs-ueplf-89, egs-ccmfa-90, es-vda-86, gss-gmppt-89, h-fuenl-89, h-rv-86, hk-cmhdp-90, hks-uevsi-91t, hs-ndssg-86, ls-ippvd-87, ps-ueplf-89, ps-cgi-85, ss-pmp2g-83, y-oavds-87, ZZZ"
+, update =      "01.04 icking, 98.11 bibrelex, 98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{hks-uevsi-93
-, author =	"D. P. Huttenlocher and K. Kedem and Micha Sharir"
-, title =	"The upper envelope of {Voronoi} surfaces and its applications"
-, journal =	"Discrete Comput. Geom."
-, volume =	9
-, year =	1993
-, pages =	"267--291"
-, succeeds =	"hks-uevsi-91"
-, update =	"01.04 icking, 98.03 mitchell, 95.09 agarwal, 94.05 sharir"
+, author =      "D. P. Huttenlocher and K. Kedem and Micha Sharir"
+, title =       "The upper envelope of {Voronoi} surfaces and its applications"
+, journal =     "Discrete Comput. Geom."
+, volume =      9
+, year =        1993
+, pages =       "267--291"
+, succeeds =    "hks-uevsi-91"
+, update =      "01.04 icking, 98.03 mitchell, 95.09 agarwal, 94.05 sharir"
 }
 
 @article{hkr-ciuhd-93
-, author =	"D. P. Huttenlocher and G. A. Klanderman and W. J. Rucklidge"
-, title =	"Comparing Images Using the {Hausdorff} Distance"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	15
-, year =	1993
-, pages =	"850--863"
-, update =	"98.11 bibrelex, 98.07 agarwal, 97.11 bibrelex"
+, author =      "D. P. Huttenlocher and G. A. Klanderman and W. J. Rucklidge"
+, title =       "Comparing Images Using the {Hausdorff} Distance"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      15
+, year =        1993
+, pages =       "850--863"
+, update =      "98.11 bibrelex, 98.07 agarwal, 97.11 bibrelex"
 }
 
 @inproceedings{hk-cpsup-94
-, author =	"D. P. Huttenlocher and J. M. Kleinberg"
-, title =	"Comparing point sets under projection"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"1--7"
-, update =	"96.09 agarwal"
+, author =      "D. P. Huttenlocher and J. M. Kleinberg"
+, title =       "Comparing point sets under projection"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "1--7"
+, update =      "96.09 agarwal"
 }
 
 @inproceedings{hu-orua-87
-, author =	"D. P. Huttenlocher and S. Ullman"
-, title =	"Object recognition using alignment"
-, booktitle =	"Proc. 1st Internat. Conf. Comput. Vision"
-, year =	1987
-, pages =	"102--111"
-, update =	"97.11 bibrelex"
+, author =      "D. P. Huttenlocher and S. Ullman"
+, title =       "Object recognition using alignment"
+, booktitle =   "Proc. 1st Internat. Conf. Comput. Vision"
+, year =        1987
+, pages =       "102--111"
+, update =      "97.11 bibrelex"
 }
 
 @article{hu-rsoa-90
-, author =	"D. P. Huttenlocher and S. Ullman"
-, title =	"Recognizing solid objects by alignment"
-, journal =	"Internat. J. Comput. Vision"
-, volume =	5
-, number =	2
-, year =	1990
-, pages =	"255--274"
-, update =	"97.11 bibrelex"
+, author =      "D. P. Huttenlocher and S. Ullman"
+, title =       "Recognizing solid objects by alignment"
+, journal =     "Internat. J. Comput. Vision"
+, volume =      5
+, number =      2
+, year =        1990
+, pages =       "255--274"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{hu-rsoai-89
-, author =	"D. P. Huttenlocher and S. Ullman"
-, title =	"Recognizing solid objects by alignment with an image"
-, type =	"Technical {Report}"
-, number =	"TR~89-978"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	mar
-, year =	1989
-, update =	"93.09 milone+mitchell"
+, author =      "D. P. Huttenlocher and S. Ullman"
+, title =       "Recognizing solid objects by alignment with an image"
+, type =        "Technical {Report}"
+, number =      "TR~89-978"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       mar
+, year =        1989
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{hw-fcegi-90
-, author =	"D. P. Huttenlocher and P. Wayener"
-, title =	"Finding convex edge groupings in an image"
-, type =	"Technical {Report}"
-, number =	"TR~90-1116"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	apr
-, year =	1990
-, update =	"95.09 agarwal, 93.09 milone+mitchell"
+, author =      "D. P. Huttenlocher and P. Wayener"
+, title =       "Finding convex edge groupings in an image"
+, type =        "Technical {Report}"
+, number =      "TR~90-1116"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       apr
+, year =        1990
+, update =      "95.09 agarwal, 93.09 milone+mitchell"
 }
 
 @inproceedings{hl-updss-91
-, author =	"M. D. Hutton and A. Lubiw"
-, title =	"Upward Planar Drawing of Single Source Acyclic Digraphs"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"203--211"
-, keywords =	"graph drawing, planar, upward"
-, precedes =	"hl-updss-96"
-, update =	"97.03 tamassia, 93.09 tamassia"
+, author =      "M. D. Hutton and A. Lubiw"
+, title =       "Upward Planar Drawing of Single Source Acyclic Digraphs"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "203--211"
+, keywords =    "graph drawing, planar, upward"
+, precedes =    "hl-updss-96"
+, update =      "97.03 tamassia, 93.09 tamassia"
 }
 
 @article{hl-updss-96
-, author =	"M. D. Hutton and A. Lubiw"
-, title =	"Upward Planar Drawing of Single-Source Acyclic Digraphs"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, number =	2
-, year =	1996
-, pages =	"291--311"
-, keywords =	"graph drawing, planar, upward"
-, succeeds =	"hl-updss-91"
-, update =	"97.03 tamassia"
+, author =      "M. D. Hutton and A. Lubiw"
+, title =       "Upward Planar Drawing of Single-Source Acyclic Digraphs"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, number =      2
+, year =        1996
+, pages =       "291--311"
+, keywords =    "graph drawing, planar, upward"
+, succeeds =    "hl-updss-91"
+, update =      "97.03 tamassia"
 }
 
 @article{h-eslp-90
-, author =	"M. N. Huxley"
-, title =	"Exponential sums and lattice points"
-, journal =	"Proc. London Math. Soc."
-, volume =	60
-, year =	1990
-, pages =	"471--502"
-, update =	"97.11 bibrelex"
+, author =      "M. N. Huxley"
+, title =       "Exponential sums and lattice points"
+, journal =     "Proc. London Math. Soc."
+, volume =      60
+, year =        1990
+, pages =       "471--502"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{hz-scthc-95
-, author =	"Cho Hwan-Gue and Alexander Zelikovsky"
-, title =	"Spanning Closed Trail and {Hamiltonian} Cycle in Grid Graphs"
-, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1004
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"342--351"
-, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
+, author =      "Cho Hwan-Gue and Alexander Zelikovsky"
+, title =       "Spanning Closed Trail and {Hamiltonian} Cycle in Grid Graphs"
+, booktitle =   "Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1004
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "342--351"
+, update =      "98.07 bibrelex, 96.01 smid, 95.09 mitchell"
 }
 
 @article{hr-stp-92
-, author =	"F. D. Hwang and D. S. Richards"
-, title =	"Steiner tree problems"
-, journal =	"Networks"
-, volume =	22
-, year =	1992
-, pages =	"55--89"
-, update =	"98.11 bibrelex"
+, author =      "F. D. Hwang and D. S. Richards"
+, title =       "Steiner tree problems"
+, journal =     "Networks"
+, volume =      22
+, year =        1992
+, pages =       "55--89"
+, update =      "98.11 bibrelex"
 }
 
 % also claimed pages = "86--91"
 @article{h-oarms-79
-, author =	"F. K. Hwang"
-, title =	"An {$O(n \log n)$} algorithm for rectilinear minimal spanning tree"
-, journal =	"J. ACM"
-, volume =	26
-, year =	1979
-, pages =	"177--182"
+, author =      "F. K. Hwang"
+, title =       "An {$O(n \log n)$} algorithm for rectilinear minimal spanning tree"
+, journal =     "J. ACM"
+, volume =      26
+, year =        1979
+, pages =       "177--182"
 }
 
 @article{h-oasrs-79
-, author =	"F. K. Hwang"
-, title =	"An {$O(n \log n)$} algorithm for suboptimal rectilinear {Steiner} trees"
-, journal =	"IEEE Trans. Circuits Syst."
-, volume =	"CAS-26"
-, number =	1
-, year =	1979
-, pages =	"75--77"
-, update =	"98.07 bibrelex"
+, author =      "F. K. Hwang"
+, title =       "An {$O(n \log n)$} algorithm for suboptimal rectilinear {Steiner} trees"
+, journal =     "IEEE Trans. Circuits Syst."
+, volume =      "CAS-26"
+, number =      1
+, year =        1979
+, pages =       "75--77"
+, update =      "98.07 bibrelex"
 }
 
 @article{h-smtrd-76
-, author =	"F. K. Hwang"
-, title =	"On {Steiner} minimal trees with rectilinear distance"
-, journal =	"SIAM J. Appl. Math."
-, volume =	30
-, number =	1
-, year =	1976
-, pages =	"104--114"
+, author =      "F. K. Hwang"
+, title =       "On {Steiner} minimal trees with rectilinear distance"
+, journal =     "SIAM J. Appl. Math."
+, volume =      30
+, number =      1
+, year =        1976
+, pages =       "104--114"
 }
 
 @article{h-rsp-78
-, author =	"F. K. Hwang"
-, title =	"The rectilinear {Steiner} problem"
-, journal =	"J. Design Autom. Fault-Tolerant Comput."
-, volume =	2
-, year =	1978
-, pages =	"303--310"
+, author =      "F. K. Hwang"
+, title =       "The rectilinear {Steiner} problem"
+, journal =     "J. Design Autom. Fault-Tolerant Comput."
+, volume =      2
+, year =        1978
+, pages =       "303--310"
 }
 
 @book{hrw-stp-92
-, author =	"F. K. Hwang and D. S. Richards and P. Winter"
-, title =	"The {Steiner} Tree Problem"
-, publisher =	"Elsevier Science"
-, address =	"Amsterdam"
-, year =	1992
-, update =	"97.07 smid"
+, author =      "F. K. Hwang and D. S. Richards and P. Winter"
+, title =       "The {Steiner} Tree Problem"
+, publisher =   "Elsevier Science"
+, address =     "Amsterdam"
+, year =        1992
+, update =      "97.07 smid"
 }
 
 @article{hstd-dtesm-88
-, author =	"F. K. Hwang and G. D. Song and G. Y. Ting and D. Z. Du"
-, title =	"A decomposition theorem on {Euclidean} {Steiner} minimal trees"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"367--382"
+, author =      "F. K. Hwang and G. D. Song and G. Y. Ting and D. Z. Du"
+, title =       "A decomposition theorem on {Euclidean} {Steiner} minimal trees"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "367--382"
 }
 
 @article{hy-cbprr-90
-, author =	"F. K. Hwang and Y. C. Yao"
-, title =	"Comments on {Bern}'s probabilistic results on rectilinear {Steiner} trees"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"591--598"
+, author =      "F. K. Hwang and Y. C. Yao"
+, title =       "Comments on {Bern}'s probabilistic results on rectilinear {Steiner} trees"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "591--598"
 }
 
 @unpublished{hct-spdcg-90
-, author =	"H. Hwang and R. Chang and H. Tu"
-, title =	"The separability problem in dynamic computational geometry"
-, year =	1990
-, note =	"Unpublished manuscript"
-, update =	"95.09 agarwal"
+, author =      "H. Hwang and R. Chang and H. Tu"
+, title =       "The separability problem in dynamic computational geometry"
+, year =        1990
+, note =        "Unpublished manuscript"
+, update =      "95.09 agarwal"
 }
 
 @inproceedings{hcl-gdcsa-89
-, author =	"R. Z. Hwang and R. C. Chang and R. C. T. Lee"
-, title =	"The generalized divide-and-conquer strategy and its applications to some {Euclidean} {NP}-hard problems"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, year =	1989
-, pages =	"17--24"
-, keywords =	"p-median, p-center, TSP"
-, update =	"95.09 mitchell"
+, author =      "R. Z. Hwang and R. C. Chang and R. C. T. Lee"
+, title =       "The generalized divide-and-conquer strategy and its applications to some {Euclidean} {NP}-hard problems"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, year =        1989
+, pages =       "17--24"
+, keywords =    "p-median, p-center, TSP"
+, update =      "95.09 mitchell"
 }
 
 @article{hcl-sssss-93
-, author =	"R. Z. Hwang and R. C. Chang and R. C. T. Lee"
-, title =	"The generalized searching over separators strategy to solve some {NP}-{H}ard problems in subexponential time"
-, journal =	"Algorithmica"
-, volume =	9
-, year =	1993
-, pages =	"398--423"
-, update =	"96.05 agarwal"
+, author =      "R. Z. Hwang and R. C. Chang and R. C. T. Lee"
+, title =       "The generalized searching over separators strategy to solve some {NP}-{H}ard problems in subexponential time"
+, journal =     "Algorithmica"
+, volume =      9
+, year =        1993
+, pages =       "398--423"
+, update =      "96.05 agarwal"
 }
 
 @article{hlc-sdase-93
-, author =	"R. Z. Hwang and R. C. T. Lee and R. C. Chang"
-, title =	"The slab dividing approach to solve the {Euclidean} $p$-center problem"
-, journal =	"Algorithmica"
-, volume =	9
-, year =	1993
-, pages =	"1--22"
-, update =	"96.05 agarwal"
+, author =      "R. Z. Hwang and R. C. T. Lee and R. C. Chang"
+, title =       "The slab dividing approach to solve the {Euclidean} $p$-center problem"
+, journal =     "Algorithmica"
+, volume =      9
+, year =        1993
+, pages =       "1--22"
+, update =      "96.05 agarwal"
 }
 
 @inproceedings{hct-faspe-89
-, author =	"Y.-H. Hwang and R.-C. Chang and H.-Y. Tu"
-, title =	"Finding all shortest path edge sequences on a convex polyhedron"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"251--266"
+, author =      "Y.-H. Hwang and R.-C. Chang and H.-Y. Tu"
+, title =       "Finding all shortest path edge sequences on a convex polyhedron"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "251--266"
 }
 
 @article{ha-gmps-92
-, author =	"Y. K. Hwang and N. Ahuja"
-, title =	"Gross motion planning -- A survey"
-, journal =	"ACM Comput. Surv."
-, volume =	24
-, number =	3
-, year =	1992
-, pages =	"219--291"
-, update =	"98.07 orourke"
+, author =      "Y. K. Hwang and N. Ahuja"
+, title =       "Gross motion planning -- A survey"
+, journal =     "ACM Comput. Surv."
+, volume =      24
+, number =      3
+, year =        1992
+, pages =       "219--291"
+, update =      "98.07 orourke"
 }
 
 @article{hr-cobdt-76
-, author =	"L. Hyafil and R. Rivest"
-, title =	"Constructing optimal binary decision trees is NP-Complete"
-, journal =	"Inform. Process. Lett."
-, volume =	5
-, year =	1976
-, pages =	"15--17"
-, update =	"96.09 agarwal"
+, author =      "L. Hyafil and R. Rivest"
+, title =       "Constructing optimal binary decision trees is NP-Complete"
+, journal =     "Inform. Process. Lett."
+, volume =      5
+, year =        1976
+, pages =       "15--17"
+, update =      "96.09 agarwal"
 }
 
 @inproceedings{he-tgest-85
-, author =	"J. Hynd and P. Eades"
-, title =	"The Typed Graph Editing System: {TYGES}"
-, booktitle =	"Proc. 3rd Australasian Conf. on Computer Graphics"
-, year =	1985
-, pages =	"15--19"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Hynd and P. Eades"
+, title =       "The Typed Graph Editing System: {TYGES}"
+, booktitle =   "Proc. 3rd Australasian Conf. on Computer Graphics"
+, year =        1985
+, pages =       "15--19"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{ik-olctc-83
-, author =	"T. Ibaraki and N. Katoh"
-, title =	"On-Line Computation of Transitive Closure of Graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	16
-, year =	1983
-, pages =	"95--97"
-, update =	"94.01 tamassia"
+, author =      "T. Ibaraki and N. Katoh"
+, title =       "On-Line Computation of Transitive Closure of Graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      16
+, year =        1983
+, pages =       "95--97"
+, update =      "94.01 tamassia"
 }
 
 @article{ik-spc-75
-, author =	"K. Ichida and T. Kiyono"
-, title =	"Segmentation of Plane Curves"
-, journal =	"Transactions of the Electronics and Communication Engineers of Japan"
-, volume =	"58-D"
-, year =	1975
-, pages =	"689--696"
-, update =	"97.11 bibrelex"
+, author =      "K. Ichida and T. Kiyono"
+, title =       "Segmentation of Plane Curves"
+, journal =     "Transactions of the Electronics and Communication Engineers of Japan"
+, volume =      "58-D"
+, year =        1975
+, pages =       "689--696"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{i-kbl-89
-, author =	"Christian Icking"
-, title =	"{K{\"u}rzeste} {Bewegung} von {Liniensegmenten}"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "Christian Icking"
+, title =       "{K{\"u}rzeste} {Bewegung} von {Liniensegmenten}"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @mastersthesis{i-baoer-85
-, author =	"Christian Icking"
-, title =	"Le Balayage Appliqu{\'e} aux Op{\'e}rations Ensemblistes et au R{\'e}gionnement"
-, type =	"Diploma Thesis ({DEA})"
-, school =	"Department of Computer Science, Universit{\'e} Pierre et Marie Curie Paris~VI"
-, address =	"Paris, France"
-, year =	1985
-, keywords =	"master thesis"
-, update =	"00.03 bibrelex"
+, author =      "Christian Icking"
+, title =       "Le Balayage Appliqu{\'e} aux Op{\'e}rations Ensemblistes et au R{\'e}gionnement"
+, type =        "Diploma Thesis ({DEA})"
+, school =      "Department of Computer Science, Universit{\'e} Pierre et Marie Curie Paris~VI"
+, address =     "Paris, France"
+, year =        1985
+, keywords =    "master thesis"
+, update =      "00.03 bibrelex"
 }
 
 @phdthesis{i-mvsp-94
-, author =	"Christian Icking"
-, title =	"Motion and Visibility in Simple Polygons"
-, school =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"00.11 smid, 00.07 icking, 97.03 icking"
+, author =      "Christian Icking"
+, title =       "Motion and Visibility in Simple Polygons"
+, school =      "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "00.11 smid, 00.07 icking, 97.03 icking"
 }
 
 @inproceedings{ikkl-euce-00
-, author =	"Christian Icking and Thomas Kamphans and Rolf Klein and Elmar Langetepe"
-, title =	"Exploring an Unknown Cellular Environment"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"140--143"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ikkl-euce-00.pdf"
-, cites =	"afm-aalmm-97, a-ptase-96, dkp-hlue1-98, e-hpnrg-86, fw-ola-98, gkp-aspgt-95, hikk-pepns-98, ips-hpgg-82, m-gsaps-96, m-spn-97, n-wrlv-92, ul-hcsgg-97, ZZZ"
-, update =	"01.04 icking, 00.03 bibrelex"
+, author =      "Christian Icking and Thomas Kamphans and Rolf Klein and Elmar Langetepe"
+, title =       "Exploring an Unknown Cellular Environment"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "140--143"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/ikkl-euce-00.pdf"
+, cites =       "afm-aalmm-97, a-ptase-96, dkp-hlue1-98, e-hpnrg-86, fw-ola-98, gkp-aspgt-95, hikk-pepns-98, ips-hpgg-82, m-gsaps-96, m-spn-97, n-wrlv-92, ul-hcsgg-97, ZZZ"
+, update =      "01.04 icking, 00.03 bibrelex"
 }
 
 @proceedings{ik-ewcg-93
-, title =	"Abstracts 9th European Workshop on Computational Geometry"
-, editor =	"Christian Icking and Rolf Klein"
-, nickname =	"CG '93"
-, site =	"Hagen"
-, series =	"Informatik-Berichte"
-, volume =	140
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
+, title =       "Abstracts 9th European Workshop on Computational Geometry"
+, editor =      "Christian Icking and Rolf Klein"
+, nickname =    "CG '93"
+, site =        "Hagen"
+, series =      "Informatik-Berichte"
+, volume =      140
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
 }
 
 @techreport{ik-csas-95t
-, author =	"Christian Icking and Rolf Klein"
-, title =	"Competitive Strategies for Autonomous Systems"
-, number =	175
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1995
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr175.pdf"
-, precedes =	"ik-csas-95"
-, update =	"98.11 bibrelex"
+, author =      "Christian Icking and Rolf Klein"
+, title =       "Competitive Strategies for Autonomous Systems"
+, number =      175
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1995
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr175.pdf"
+, precedes =    "ik-csas-95"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{ik-csas-95
-, author =	"Christian Icking and Rolf Klein"
-, title =	"Competitive Strategies for Autonomous Systems"
-, editor =	"H. Bunke and T. Kanade and H. Noltemeier"
-, booktitle =	"Modelling and Planning for Sensor Based Intelligent Robot Systems"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1995
-, pages =	"23--40"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr175.pdf"
-, succeeds =	"ik-csas-95t"
-, cites =	"bcr-sp-93, cg-opapp-92, di-csgs-94, dkp-hlue1-93, drw-lrmt-95, gj-cigtn-79, gs-oolaw-95, gmr-rlptd-92, ikl-sac-97, ikm-hlac-93, k-wusbd-92, k-lpmr-94, k-olssp-94, lp-oafkp-79, ls-ghtun-94, osh-kaoa-94, rksi-rnut-93, st-aelup-85, ZZZ"
-, update =	"00.03 bibrelex, 98.11 bibrelex, 97.03 icking"
+, author =      "Christian Icking and Rolf Klein"
+, title =       "Competitive Strategies for Autonomous Systems"
+, editor =      "H. Bunke and T. Kanade and H. Noltemeier"
+, booktitle =   "Modelling and Planning for Sensor Based Intelligent Robot Systems"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1995
+, pages =       "23--40"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr175.pdf"
+, succeeds =    "ik-csas-95t"
+, cites =       "bcr-sp-93, cg-opapp-92, di-csgs-94, dkp-hlue1-93, drw-lrmt-95, gj-cigtn-79, gs-oolaw-95, gmr-rlptd-92, ikl-sac-97, ikm-hlac-93, k-wusbd-92, k-lpmr-94, k-olssp-94, lp-oafkp-79, ls-ghtun-94, osh-kaoa-94, rksi-rnut-93, st-aelup-85, ZZZ"
+, update =      "00.03 bibrelex, 98.11 bibrelex, 97.03 icking"
 }
 
 @inproceedings{ik-ppuu-92
-, author =	"Christian Icking and Rolf Klein"
-, title =	"Path Planning Under Uncertainty"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	5
-, update =	"00.03 bibrelex"
+, author =      "Christian Icking and Rolf Klein"
+, title =       "Path Planning Under Uncertainty"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       5
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{ik-skpcs-95
-, author =	"Christian Icking and Rolf Klein"
-, title =	"Searching for the Kernel of a Polygon: {A} Competitive Strategy"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"258--266"
-, keywords =	"competitive strategy, shortest paths, simple polygon"
-, precedes =	"ikl-skpcs-97"
-, cites =	"cg-opapp-92, di-csgs-94, dkp-hlue-91, dkp-hlue1-93, drw-lrmt-95, gs-oolaw-95, i-mvsp-94, ikm-hlac-93, k-wusbd-92, k-lpmr-94, k-olssp-94, lp-oafkp-79, ls-ghtun-94, r-cic-94, ZZZ"
-, update =	"98.07 icking, 98.03 bibrelex, 95.09 mitchell"
+, author =      "Christian Icking and Rolf Klein"
+, title =       "Searching for the Kernel of a Polygon: {A} Competitive Strategy"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "258--266"
+, keywords =    "competitive strategy, shortest paths, simple polygon"
+, precedes =    "ikl-skpcs-97"
+, cites =       "cg-opapp-92, di-csgs-94, dkp-hlue-91, dkp-hlue1-93, drw-lrmt-95, gs-oolaw-95, i-mvsp-94, ikm-hlac-93, k-wusbd-92, k-lpmr-94, k-olssp-94, lp-oafkp-79, ls-ghtun-94, r-cic-94, ZZZ"
+, update =      "98.07 icking, 98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{ik-skpcs-95c
-, author =	"Christian Icking and Rolf Klein"
-, title =	"Searching for the Kernel of a Polygon: A Competitive Strategy"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"7--99"
-, update =	"00.03 bibrelex"
+, author =      "Christian Icking and Rolf Klein"
+, title =       "Searching for the Kernel of a Polygon: A Competitive Strategy"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "7--99"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{ik-tgp-91
-, author =	"Christian Icking and Rolf Klein"
-, title =	"The Two Guards Problem"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"166--175"
-, keywords =	"polygon"
-, precedes =	"ik-tgp-92t"
-, cites =	"at-oadvp-81, cg-vippg-85, fw--90, gh-ospqs-89, o-agta-87, ZZZ"
-, update =	"99.07 bibrelex, 98.11 bibrelex, 98.07 icking, 97.11 bibrelex"
+, author =      "Christian Icking and Rolf Klein"
+, title =       "The Two Guards Problem"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "166--175"
+, keywords =    "polygon"
+, precedes =    "ik-tgp-92t"
+, cites =       "at-oadvp-81, cg-vippg-85, fw--90, gh-ospqs-89, o-agta-87, ZZZ"
+, update =      "99.07 bibrelex, 98.11 bibrelex, 98.07 icking, 97.11 bibrelex"
 }
 
 @techreport{ik-tgp-92t
-, author =	"Christian Icking and Rolf Klein"
-, title =	"The Two Guards Problem"
-, number =	126
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1992
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr126.pdf"
-, succeeds =	"ik-tgp-91"
-, precedes =	"ik-tgp-92"
-, update =	"98.11 bibrelex"
+, author =      "Christian Icking and Rolf Klein"
+, title =       "The Two Guards Problem"
+, number =      126
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1992
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr126.pdf"
+, succeeds =    "ik-tgp-91"
+, precedes =    "ik-tgp-92"
+, update =      "98.11 bibrelex"
 }
 
 @article{ik-tgp-92
-, author =	"Christian Icking and Rolf Klein"
-, title =	"The Two Guards Problem"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"257--285"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ik-tgp-92.pdf"
-, keywords =	"visibility, watchman routes, planar polygons, motion planning"
-, succeeds =	"ik-tgp-92t"
-, update =	"01.04 icking, 99.07 bibrelex, 98.11 bibrelex, 98.07 icking"
+, author =      "Christian Icking and Rolf Klein"
+, title =       "The Two Guards Problem"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "257--285"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/ik-tgp-92.pdf"
+, keywords =    "visibility, watchman routes, planar polygons, motion planning"
+, succeeds =    "ik-tgp-92t"
+, update =      "01.04 icking, 99.07 bibrelex, 98.11 bibrelex, 98.07 icking"
 }
 
 @inproceedings{ikkm-jadvv-97
-, author =	"Christian Icking and Rolf Klein and Peter K{\"o}llner and Lihong Ma"
-, title =	"A {Java} Applet for the Dynamic Visualization of {Voronoi} Diagrams"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"46--47"
-, update =	"00.03 bibrelex, 99.07 bibrelex, 98.07 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Peter K{\"o}llner and Lihong Ma"
+, title =       "A {Java} Applet for the Dynamic Visualization of {Voronoi} Diagrams"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "46--47"
+, update =      "00.03 bibrelex, 99.07 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{ikl-ocsws-98
-, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
-, title =	"An Optimal Competitive Strategy for Walking in Streets"
-, number =	233
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1998
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr233.pdf"
-, precedes =	"ikl-ocsws-99"
-, update =	"98.11 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Elmar Langetepe"
+, title =       "An Optimal Competitive Strategy for Walking in Streets"
+, number =      233
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1998
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr233.pdf"
+, precedes =    "ikl-ocsws-99"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ikl-ocsws-99
-, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
-, title =	"An Optimal Competitive Strategy for Walking in Streets"
-, booktitle =	"Proc. 16th Sympos. Theoret. Aspects Comput. Sci."
-, nickname =	"STACS '99"
-, site =	"Trier"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1563
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"110--120"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ikl-ocsws-99.pdf"
-, succeeds =	"ikl-ocsws-98"
-, update =	"01.04 icking, 99.07 bibrelex, 99.03 bibrelex, 98.11 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Elmar Langetepe"
+, title =       "An Optimal Competitive Strategy for Walking in Streets"
+, booktitle =   "Proc. 16th Sympos. Theoret. Aspects Comput. Sci."
+, nickname =    "STACS '99"
+, site =        "Trier"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1563
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "110--120"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/ikl-ocsws-99.pdf"
+, succeeds =    "ikl-ocsws-98"
+, update =      "01.04 icking, 99.07 bibrelex, 99.03 bibrelex, 98.11 bibrelex"
 }
 
 @inproceedings{ikl-sgmrw-99
-, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
-, title =	"Searching a Goal on $m$ Rays Within a Fixed Distance"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"137--139"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ikl-sgmrw-99.pdf"
-, update =	"01.04 icking, 00.03 bibrelex, 99.07 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Elmar Langetepe"
+, title =       "Searching a Goal on $m$ Rays Within a Fixed Distance"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "137--139"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/ikl-sgmrw-99.pdf"
+, update =      "01.04 icking, 00.03 bibrelex, 99.07 bibrelex"
 }
 
 @techreport{ikl-skpcs-97
-, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
-, title =	"Searching for the Kernel of a Polygon: A Competitive Strategy Using Self-Approaching Curves"
-, number =	211
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1997
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr211.pdf"
-, succeeds =	"ik-skpcs-95"
-, update =	"98.07 icking, 98.03 icking"
+, author =      "Christian Icking and Rolf Klein and Elmar Langetepe"
+, title =       "Searching for the Kernel of a Polygon: A Competitive Strategy Using Self-Approaching Curves"
+, number =      211
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1997
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr211.pdf"
+, succeeds =    "ik-skpcs-95"
+, update =      "98.07 icking, 98.03 icking"
 }
 
 @techreport{ikl-sac-97
-, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
-, title =	"Self-Approaching Curves"
-, number =	217
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1997
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr217.pdf"
-, precedes =	"ikl-sac-99"
-, update =	"99.07 bibrelex, 98.07 icking"
+, author =      "Christian Icking and Rolf Klein and Elmar Langetepe"
+, title =       "Self-Approaching Curves"
+, number =      217
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1997
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr217.pdf"
+, precedes =    "ikl-sac-99"
+, update =      "99.07 bibrelex, 98.07 icking"
 }
 
 @article{ikl-sac-99
-, author =	"Christian Icking and Rolf Klein and Elmar Langetepe"
-, title =	"Self-Approaching Curves"
-, journal =	"Math. Proc. Camb. Phil. Soc."
-, volume =	125
-, year =	1999
-, pages =	"441--453"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr217.pdf"
-, succeeds =	"ikl-sac-97"
-, update =	"01.04 icking, 99.07 bibrelex, 99.03 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Elmar Langetepe"
+, title =       "Self-Approaching Curves"
+, journal =     "Math. Proc. Camb. Phil. Soc."
+, volume =      125
+, year =        1999
+, pages =       "441--453"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr217.pdf"
+, succeeds =    "ikl-sac-97"
+, update =      "01.04 icking, 99.07 bibrelex, 99.03 bibrelex"
 }
 
 @techreport{iklm-cdf3s-92
-, author =	"Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma"
-, title =	"Convex Distance Functions in $3$-space are Different"
-, number =	133
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1992
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr133.pdf"
-, precedes =	"iklm-cdf3s-93"
-, update =	"98.07 icking, 98.03 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma"
+, title =       "Convex Distance Functions in $3$-space are Different"
+, number =      133
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1992
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr133.pdf"
+, precedes =    "iklm-cdf3s-93"
+, update =      "98.07 icking, 98.03 bibrelex"
 }
 
 @inproceedings{iklm-cdf3s-93
-, author =	"Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma"
-, title =	"Convex Distance Functions in $3$-Space are Different"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"116--123"
-, succeeds =	"iklm-cdf3s-92"
-, precedes =	"iklm-cdf3s-95"
-, cites =	"a-vdsfg-91, b-eakfd-70, cgglmw-m5lrm-91, cd-vdbcd-85, ei-drmwc-79, h-ag-77, iklm-cdf3s-92, j-ba1-74, k-cavd-89, k-cpavd-89, kmm-cavd2-90, km-weacs-92, l-a1-69, l-tdvdl-80, m-ddvec-92, mr-vdbsc-91, mmo-cavd-91, sh-cpp-75, sd-hdvdc-92, ss-ampr-90, www-dpcgf-85, ZZZ"
-, update =	"99.07 bibrelex, 98.07 icking, 98.03 bibrelex, 97.11 icking, 93.09 jones"
+, author =      "Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma"
+, title =       "Convex Distance Functions in $3$-Space are Different"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "116--123"
+, succeeds =    "iklm-cdf3s-92"
+, precedes =    "iklm-cdf3s-95"
+, cites =       "a-vdsfg-91, b-eakfd-70, cgglmw-m5lrm-91, cd-vdbcd-85, ei-drmwc-79, h-ag-77, iklm-cdf3s-92, j-ba1-74, k-cavd-89, k-cpavd-89, kmm-cavd2-90, km-weacs-92, l-a1-69, l-tdvdl-80, m-ddvec-92, mr-vdbsc-91, mmo-cavd-91, sh-cpp-75, sd-hdvdc-92, ss-ampr-90, www-dpcgf-85, ZZZ"
+, update =      "99.07 bibrelex, 98.07 icking, 98.03 bibrelex, 97.11 icking, 93.09 jones"
 }
 
 @article{iklm-cdf3s-95
-, author =	"Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma"
-, title =	"Convex Distance Functions in $3$-Space are Different"
-, journal =	"Fundam. Inform."
-, volume =	22
-, year =	1995
-, pages =	"331--352"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/iklm-cdf3s-95.pdf"
-, succeeds =	"iklm-cdf3s-93"
-, update =	"01.04 icking, 97.03 icking+smid"
+, author =      "Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma"
+, title =       "Convex Distance Functions in $3$-Space are Different"
+, journal =     "Fundam. Inform."
+, volume =      22
+, year =        1995
+, pages =       "331--352"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/iklm-cdf3s-95.pdf"
+, succeeds =    "iklm-cdf3s-93"
+, update =      "01.04 icking, 97.03 icking+smid"
 }
 
 @techreport{iklms-bcdf3-99t
-, author =	"Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma and Francisco Santos"
-, title =	"On Bisectors for Convex Distance Functions in 3-Space"
-, number =	250
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1999
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr250.pdf"
-, precedes =	"iklms-bcdf3-99"
-, update =	"99.07 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma and Francisco Santos"
+, title =       "On Bisectors for Convex Distance Functions in 3-Space"
+, number =      250
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1999
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr250.pdf"
+, precedes =    "iklms-bcdf3-99"
+, update =      "99.07 bibrelex"
 }
 
 @inproceedings{iklms-bcdf3-99
-, author =	"Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma and Francisco Santos"
-, title =	"On Bisectors for Convex Distance Functions in 3-Space"
-, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
-, nickname =	"CCCG '99"
-, site =	"Vancouver, Canada"
-, year =	1999
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr250.pdf"
-, succeeds =	"iklms-bcdf3-99t"
-, update =	"01.04 icking, 99.07 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Ngoc-Minh L{\^e} and Lihong Ma and Francisco Santos"
+, title =       "On Bisectors for Convex Distance Functions in 3-Space"
+, booktitle =   "Proc. 11th Canad. Conf. Comput. Geom."
+, nickname =    "CCCG '99"
+, site =        "Vancouver, Canada"
+, year =        1999
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr250.pdf"
+, succeeds =    "iklms-bcdf3-99t"
+, update =      "01.04 icking, 99.07 bibrelex"
 }
 
 @techreport{ikm-ocsla-94
-, author =	"Christian Icking and Rolf Klein and Lihong Ma"
-, title =	"An Optimal Competitive Strategy for Looking Around a Corner"
-, number =	167
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1994
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr167.pdf"
-, succeeds =	"ikm-hlac-93"
-, update =	"98.11 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Lihong Ma"
+, title =       "An Optimal Competitive Strategy for Looking Around a Corner"
+, number =      167
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1994
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr167.pdf"
+, succeeds =    "ikm-hlac-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ikm-hlac-93
-, author =	"Christian Icking and Rolf Klein and Lihong Ma"
-, title =	"How to Look Around a Corner"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"443--448"
-, precedes =	"ikm-ocsla-94"
-, cites =	"cgglmw-m5lrm-91, dkp-hlue-91, elw-pgmpt-90, k-dv1-83, k-wusbd-91, m-aaorp-90, m-odes-60, py-spwm-89, ss-ampr-90, sy-agar-87, st-aelup-85, brs-nut-90, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "Christian Icking and Rolf Klein and Lihong Ma"
+, title =       "How to Look Around a Corner"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "443--448"
+, precedes =    "ikm-ocsla-94"
+, cites =       "cgglmw-m5lrm-91, dkp-hlue-91, elw-pgmpt-90, k-dv1-83, k-wusbd-91, m-aaorp-90, m-odes-60, py-spwm-89, ss-ampr-90, sy-agar-87, st-aelup-85, brs-nut-90, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{ikm-brdcd-98
-, author =	"Christian Icking and Rolf Klein and Lihong Ma"
-, title =	"The Bisector with Respect to Different Convex Distance Functions"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"99--101"
-, precedes =	"ikmnw-bddf-98"
-, update =	"00.03 bibrelex, 99.07 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Lihong Ma"
+, title =       "The Bisector with Respect to Different Convex Distance Functions"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "99--101"
+, precedes =    "ikmnw-bddf-98"
+, update =      "00.03 bibrelex, 99.07 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{ikm-owlac-93
-, author =	"Christian Icking and Rolf Klein and Lihong Ma"
-, title =	"The Optimal Way for Looking Around a Corner"
-, booktitle =	"Proc. 4th IEEE--IEE Vehicle Navigation and Information Systems Conference"
-, nickname =	"VNIS '93"
-, site =	"Ottawa, Canada"
-, year =	1993
-, update =	"98.07 icking, 97.03 icking"
+, author =      "Christian Icking and Rolf Klein and Lihong Ma"
+, title =       "The Optimal Way for Looking Around a Corner"
+, booktitle =   "Proc. 4th IEEE--IEE Vehicle Navigation and Information Systems Conference"
+, nickname =    "VNIS '93"
+, site =        "Ottawa, Canada"
+, year =        1993
+, update =      "98.07 icking, 97.03 icking"
 }
 
 @techreport{ikmnw-bddf-98
-, author =	"Christian Icking and Rolf Klein and Lihong Ma and Stefan Nickel and Ansgar Wei{\ss}ler"
-, title =	"On Bisectors for Different Distance Functions"
-, number =	237
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1998
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr237.pdf"
-, succeeds =	"ikm-brdcd-98"
-, precedes =	"ikmnw-bddf-99"
-, update =	"99.07 bibrelex, 98.11 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Lihong Ma and Stefan Nickel and Ansgar Wei{\ss}ler"
+, title =       "On Bisectors for Different Distance Functions"
+, number =      237
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1998
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr237.pdf"
+, succeeds =    "ikm-brdcd-98"
+, precedes =    "ikmnw-bddf-99"
+, update =      "99.07 bibrelex, 98.11 bibrelex"
 }
 
 @inproceedings{ikmnw-bddf-99
-, author =	"Christian Icking and Rolf Klein and Lihong Ma and Stefan Nickel and Ansgar Wei{\ss}ler"
-, title =	"On Bisectors for Different Distance Functions"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"291--299"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/ikmnw-bddf-99.pdf"
-, succeeds =	"ikmnw-bddf-98"
-, precedes =	"ikmnw-bddf-01"
-, update =	"01.04 icking, 99.07 bibrelex, 99.03 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Lihong Ma and Stefan Nickel and Ansgar Wei{\ss}ler"
+, title =       "On Bisectors for Different Distance Functions"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "291--299"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/ikmnw-bddf-99.pdf"
+, succeeds =    "ikmnw-bddf-98"
+, precedes =    "ikmnw-bddf-01"
+, update =      "01.04 icking, 99.07 bibrelex, 99.03 bibrelex"
 }
 
 @article{ikmnw-bddf-01
-, author =	"Christian Icking and Rolf Klein and Lihong Ma and Stefan Nickel and Ansgar Wei{\ss}ler"
-, title =	"On Bisectors for Different Distance Functions"
-, journal =	"Discrete Appl. Math."
-, volume =	109
-, year =	2001
-, pages =	"139--161"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr237.pdf"
-, succeeds =	"ikmnw-bddf-99"
-, cites =	"ae-oacwv-84, ak-vd-00, cd-vdbcd-85, cmr-gbscd-96, es-vda-86, h-mlps-95, iklm-cdf3s-95, kw-gcsmm-79, lb-cg2-93, nprw-gcmlp-97, os-lopst-97, rnp-falp-97, v-cs-64, ww-ubnlm-85, www-dpcgf-85, ZZZ"
-, update =	"01.04 icking"
+, author =      "Christian Icking and Rolf Klein and Lihong Ma and Stefan Nickel and Ansgar Wei{\ss}ler"
+, title =       "On Bisectors for Different Distance Functions"
+, journal =     "Discrete Appl. Math."
+, volume =      109
+, year =        2001
+, pages =       "139--161"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr237.pdf"
+, succeeds =    "ikmnw-bddf-99"
+, cites =       "ae-oacwv-84, ak-vd-00, cd-vdbcd-85, cmr-gbscd-96, es-vda-86, h-mlps-95, iklm-cdf3s-95, kw-gcsmm-79, lb-cg2-93, nprw-gcmlp-97, os-lopst-97, rnp-falp-97, v-cs-64, ww-ubnlm-85, www-dpcgf-85, ZZZ"
+, update =      "01.04 icking"
 }
 
 @inproceedings{iko-pstsm-88
-, author =	"Christian Icking and Rolf Klein and Thomas Ottmann"
-, title =	"Priority Search Trees in Secondary Memory"
-, booktitle =	"Proc. 13th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '87"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	314
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"84--93"
-, keywords =	"search trees, B-tree, red-black tree, priority search trees"
-, update =	"98.11 bibrelex"
+, author =      "Christian Icking and Rolf Klein and Thomas Ottmann"
+, title =       "Priority Search Trees in Secondary Memory"
+, booktitle =   "Proc. 13th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '87"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      314
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "84--93"
+, keywords =    "search trees, B-tree, red-black tree, priority search trees"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{ilss-ghtus-98
-, author =	"Christian Icking and Alejandro L{\'o}pez-Ortiz and Sven Schuierer and Ines Semrau"
-, title =	"Going Home Through an Unknown Street"
-, number =	228
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1998
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr228.pdf"
-, update =	"99.07 bibrelex, 98.07 icking"
+, author =      "Christian Icking and Alejandro L{\'o}pez-Ortiz and Sven Schuierer and Ines Semrau"
+, title =       "Going Home Through an Unknown Street"
+, number =      228
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1998
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr228.pdf"
+, update =      "99.07 bibrelex, 98.07 icking"
 }
 
 @techreport{im-tbcvd-00
-, author =	"Christian Icking and Lihong Ma"
-, title =	"A Tight Bound for the Complexity of {Voronoi} Diagrams under Polyhedral Convex Distance Functions in {3D}"
-, number =	277
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	2000
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr277.pdf"
-, precedes =	"im-tbcvd-01"
-, cites =	"ak-vd-00, bsty-vdhdc-98, by-ag-98, cd-vdbcd-85, ckstw-vdl3s-98, cs-arscg-89, dv-cprac-77, es-vda-86, f-vddt-97, gmr-vdmpp-92, gs-ccrs-87, iklm-cdf3s-95, iklms-bcdf3-99, ikmnw-bddf-99, k-cavd-89, kw-vdbgm-88, ls-pptmc-87, m-bvdcd-00, mmo-cavd-91, ss-ampr-90, s-atubl-94, s-ahdvd-95, sa-dsstg-95, t-csas-96, t-ntasa-96, ZZZ"
-, update =	"01.04 icking"
+, author =      "Christian Icking and Lihong Ma"
+, title =       "A Tight Bound for the Complexity of {Voronoi} Diagrams under Polyhedral Convex Distance Functions in {3D}"
+, number =      277
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        2000
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr277.pdf"
+, precedes =    "im-tbcvd-01"
+, cites =       "ak-vd-00, bsty-vdhdc-98, by-ag-98, cd-vdbcd-85, ckstw-vdl3s-98, cs-arscg-89, dv-cprac-77, es-vda-86, f-vddt-97, gmr-vdmpp-92, gs-ccrs-87, iklm-cdf3s-95, iklms-bcdf3-99, ikmnw-bddf-99, k-cavd-89, kw-vdbgm-88, ls-pptmc-87, m-bvdcd-00, mmo-cavd-91, ss-ampr-90, s-atubl-94, s-ahdvd-95, sa-dsstg-95, t-csas-96, t-ntasa-96, ZZZ"
+, update =      "01.04 icking"
 }
 
 @inproceedings{im-tbcvd-01
-, author =	"Christian Icking and Lihong Ma"
-, title =	"A Tight Bound for the Complexity of {Voronoi} Diagrams under Polyhedral Convex Distance Functions in {3D}"
-, booktitle =	"Proc. 33rd Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC 2001"
-, site =	"Crete, Greece"
-, year =	2001
-, pages =	"316--321"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr277.pdf"
-, succeeds =	"im-tbcvd-00"
-, update =	"02.03 icking, 01.04 icking"
+, author =      "Christian Icking and Lihong Ma"
+, title =       "A Tight Bound for the Complexity of {Voronoi} Diagrams under Polyhedral Convex Distance Functions in {3D}"
+, booktitle =   "Proc. 33rd Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC 2001"
+, site =        "Crete, Greece"
+, year =        2001
+, pages =       "316--321"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr277.pdf"
+, succeeds =    "im-tbcvd-00"
+, update =      "02.03 icking, 01.04 icking"
 }
 
 @techreport{irwy-spls-89
-, author =	"Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
-, title =	"Shortest Paths for Line Segments"
-, type =	"Technical {Report}"
-, number =	"B-89-14"
-, institution =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, month =	sep
-, year =	1989
-, precedes =	"irwy-spls-91"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
+, title =       "Shortest Paths for Line Segments"
+, type =        "Technical {Report}"
+, number =      "B-89-14"
+, institution = "Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, month =       sep
+, year =        1989
+, precedes =    "irwy-spls-91"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{irwy-spls-91
-, author =	"Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
-, title =	"Shortest Paths for Line Segments"
-, type =	"Technical {Report}"
-, number =	596
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1991
-, succeeds =	"irwy-spls-89"
-, precedes =	"irwy-spls-92t"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
+, title =       "Shortest Paths for Line Segments"
+, type =        "Technical {Report}"
+, number =      596
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1991
+, succeeds =    "irwy-spls-89"
+, precedes =    "irwy-spls-92t"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @techreport{irwy-spls-92t
-, author =	"Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
-, title =	"Shortest Paths for Line Segments"
-, number =	125
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1992
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr125.pdf"
-, succeeds =	"irwy-spls-91"
-, precedes =	"irwy-spls-92"
-, update =	"98.11 bibrelex"
+, author =      "Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
+, title =       "Shortest Paths for Line Segments"
+, number =      125
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1992
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr125.pdf"
+, succeeds =    "irwy-spls-91"
+, precedes =    "irwy-spls-92"
+, update =      "98.11 bibrelex"
 }
 
 @article{irwy-spls-92
-, author =	"Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
-, title =	"Shortest Paths for Line Segments"
-, journal =	"Algorithmica"
-, volume =	10
-, year =	1993
-, pages =	"182--200"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/irwy-spls-92.pdf"
-, keywords =	"Ulam problem, motion planning"
-, succeeds =	"irwy-spls-92t"
-, update =	"01.04 icking, 98.11 bibrelex, 98.03 mitchell, 95.01 mitchell, 93.09 rote, 95.01 mitchell"
+, author =      "Christian Icking and G{\"u}nter Rote and Emo Welzl and Chee Yap"
+, title =       "Shortest Paths for Line Segments"
+, journal =     "Algorithmica"
+, volume =      10
+, year =        1993
+, pages =       "182--200"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/irwy-spls-92.pdf"
+, keywords =    "Ulam problem, motion planning"
+, succeeds =    "irwy-spls-92t"
+, update =      "01.04 icking, 98.11 bibrelex, 98.03 mitchell, 95.01 mitchell, 93.09 rote, 95.01 mitchell"
 }
 
 @mastersthesis{i-dtg-90
-, author =	"P. J. Idicula"
-, title =	"Drawing Trees in Grids"
-, school =	"Department of Computer Science, University of Auckland"
-, year =	1990
-, keywords =	"master thesis, graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. J. Idicula"
+, title =       "Drawing Trees in Grids"
+, school =      "Department of Computer Science, University of Auckland"
+, year =        1990
+, keywords =    "master thesis, graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{ic-copop-91
-, author =	"D. J. Ieradi and Y.-B. Chen"
-, title =	"The complexity of oblivious plans for orienting polygonal parts"
-, type =	"Technical {Report}"
-, number =	"USC-CS-92-502"
-, institution =	"Dept. Comput. Sci., Univ. Southern California"
-, month =	dec
-, year =	1991
-, precedes =	"ci-copod-95"
-, update =	"98.07 bibrelex"
+, author =      "D. J. Ieradi and Y.-B. Chen"
+, title =       "The complexity of oblivious plans for orienting polygonal parts"
+, type =        "Technical {Report}"
+, number =      "USC-CS-92-502"
+, institution = "Dept. Comput. Sci., Univ. Southern California"
+, month =       dec
+, year =        1991
+, precedes =    "ci-copod-95"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{i-lgto-81
-, author =	"A. Iftikhar"
-, title =	"Linear geometric transformations on octrees"
-, type =	"Technical {Report}"
-, number =	"TR-81-003"
-, institution =	"Rensselaer Polytechnic Inst."
-, address =	"Troy, NY"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "A. Iftikhar"
+, title =       "Linear geometric transformations on octrees"
+, type =        "Technical {Report}"
+, number =      "TR-81-003"
+, institution = "Rensselaer Polytechnic Inst."
+, address =     "Troy, NY"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{i-dfdgu-96
-, author =	"J. Ignatowicz"
-, title =	"Drawing Force-Directed Graphs Using Optigraph"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"333--336"
-, keywords =	"graph drawing, straight-line, system, force-direceted"
-, update =	"96.09 tamassia"
+, author =      "J. Ignatowicz"
+, title =       "Drawing Force-Directed Graphs Using Optigraph"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "333--336"
+, keywords =    "graph drawing, straight-line, system, force-direceted"
+, update =      "96.09 tamassia"
 }
 
 @book{ic-lp-94
-, author =	"J. P. Ignizio and T. M. Cavalier"
-, title =	"Linear Programming"
-, series =	"Prentice Hall International Series in Industrial and Systems Engineering"
-, publisher =	"Prentice Hall"
-, year =	1994
-, update =	"98.07 bibrelex"
+, author =      "J. P. Ignizio and T. M. Cavalier"
+, title =       "Linear Programming"
+, series =      "Prentice Hall International Series in Industrial and Systems Engineering"
+, publisher =   "Prentice Hall"
+, year =        1994
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{i-mrsti-92
-, author =	"Edmund Ihler"
-, title =	"Minimum rectilinear {Steiner} trees for intervals on two parallel lines"
-, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, year =	1992
-, pages =	"??"
-, precedes =	"i-rcstp-94"
-, update =	"95.01 mitchell, 93.09 milone+mitchell"
+, author =      "Edmund Ihler"
+, title =       "Minimum rectilinear {Steiner} trees for intervals on two parallel lines"
+, booktitle =   "Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, year =        1992
+, pages =       "??"
+, precedes =    "i-rcstp-94"
+, update =      "95.01 mitchell, 93.09 milone+mitchell"
 }
 
 @inproceedings{i-cacst-92
-, author =	"Edmund Ihler"
-, title =	"The Complexity of Approximating the Class {Steiner} Tree Problem"
-, booktitle =	"Graph Theoretic Concepts in Computer Science: Proc. Internat. Workshop WG '91"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	570
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"85--96"
-, keywords =	"TSP"
-, update =	"99.11 bibrelex, 98.03 mitchell, 97.11 icking, 96.09 agarwal, 95.01 mitchell"
+, author =      "Edmund Ihler"
+, title =       "The Complexity of Approximating the Class {Steiner} Tree Problem"
+, booktitle =   "Graph Theoretic Concepts in Computer Science: Proc. Internat. Workshop WG '91"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      570
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "85--96"
+, keywords =    "TSP"
+, update =      "99.11 bibrelex, 98.03 mitchell, 97.11 icking, 96.09 agarwal, 95.01 mitchell"
 }
 
 @article{i-rcstp-94
-, author =	"Edmund Ihler"
-, title =	"The Rectilinear {Steiner} Tree Problem for Intervals on Two Parallel Lines"
-, journal =	"Math. Program. Ser. B"
-, volume =	63
-, year =	1994
-, pages =	"281--296"
-, succeeds =	"i-mrsti-92"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, author =      "Edmund Ihler"
+, title =       "The Rectilinear {Steiner} Tree Problem for Intervals on Two Parallel Lines"
+, journal =     "Math. Program. Ser. B"
+, volume =      63
+, year =        1994
+, pages =       "281--296"
+, succeeds =    "i-mrsti-92"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @inproceedings{irw-sncpp-91
-, author =	"Edmund Ihler and Gabriele Reich and Peter Widmayer"
-, title =	"On shortest networks for classes of points in the plane"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"103--111"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Edmund Ihler and Gabriele Reich and Peter Widmayer"
+, title =       "On shortest networks for classes of points in the plane"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "103--111"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @article{iww-mhgsm-93
-, author =	"E. Ihler and D. Wagner and F. Wagner"
-, title =	"Modeling Hyperedges by Graphs with the Same Mincut Properties"
-, journal =	"Inform. Process. Lett."
-, volume =	45
-, year =	1993
-, pages =	"171--175"
-, update =	"97.03 gaertner+salinger"
+, author =      "E. Ihler and D. Wagner and F. Wagner"
+, title =       "Modeling Hyperedges by Graphs with the Same Mincut Properties"
+, journal =     "Inform. Process. Lett."
+, volume =      45
+, year =        1993
+, pages =       "171--175"
+, update =      "97.03 gaertner+salinger"
 }
 
 @incollection{in-pladc-91
-, author =	"I. Ihm and B. Naylor"
-, title =	"Piecewise linear approximations of digitized curves with applications"
-, editor =	"N. M. Patrilakis"
-, booktitle =	"Scientific Visualization of Physical Phenomena"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1991
-, pages =	"545--568"
-, update =	"98.07 bibrelex"
+, author =      "I. Ihm and B. Naylor"
+, title =       "Piecewise linear approximations of digitized curves with applications"
+, editor =      "N. M. Patrilakis"
+, booktitle =   "Scientific Visualization of Physical Phenomena"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1991
+, pages =       "545--568"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{i-r3dou-81
-, author =	"K. I. Ikeuchi"
-, title =	"Recognition of 3-D Objects Using the Extended {Gaussian} Image"
-, booktitle =	"Proc. 7th Internat. Joint Conf. Artif. Intell."
-, year =	1981
-, pages =	"595--600"
-, update =	"97.11 bibrelex"
+, author =      "K. I. Ikeuchi"
+, title =       "Recognition of 3-D Objects Using the Extended {Gaussian} Image"
+, booktitle =   "Proc. 7th Internat. Joint Conf. Artif. Intell."
+, year =        1981
+, pages =       "595--600"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ihncf-puopo-83
-, author =	"K. I. Ikeuchi and B. K. P. Horn and S. Nagata and T. Callahan and O. Feingold"
-, title =	"Picking up an object from a pile of objects"
-, type =	"Memo"
-, number =	"AI Memo 726"
-, institution =	"??"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "K. I. Ikeuchi and B. K. P. Horn and S. Nagata and T. Callahan and O. Feingold"
+, title =       "Picking up an object from a pile of objects"
+, type =        "Memo"
+, number =      "AI Memo 726"
+, institution = "??"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ijmsss-dbalm-00
-, author =	"I. Ilinkin and R. Janardan and J. Majhi and J. Schwerdt and M. Smid and R. Sriram"
-, title =	"A decomposition-based approach to layered manufacturing"
-, type =	"Report"
-, number =	"00-041"
-, institution =	"Department of Computer Science, University of Minnesota"
-, address =	"Minneapolis"
-, year =	2000
-, update =	"00.11 smid"
+, author =      "I. Ilinkin and R. Janardan and J. Majhi and J. Schwerdt and M. Smid and R. Sriram"
+, title =       "A decomposition-based approach to layered manufacturing"
+, type =        "Report"
+, number =      "00-041"
+, institution = "Department of Computer Science, University of Minnesota"
+, address =     "Minneapolis"
+, year =        2000
+, update =      "00.11 smid"
 }
 
 @inproceedings{ijmsss-dbalm-01
-, author =	"I. Ilinkin and R. Janardan and J. Majhi and J. Schwerdt and M. Smid and R. Sriram"
-, title =	"A decomposition-based approach to layered manufacturing"
-, booktitle =	"Proc. 7th Workshop Algorithms Data Struct."
-, nickname =	"WADS '01"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	2125
-, publisher =	"Springer-Verlag"
-, year =	2001
-, pages =	"389--400"
-, update =	"01.11 smid"
+, author =      "I. Ilinkin and R. Janardan and J. Majhi and J. Schwerdt and M. Smid and R. Sriram"
+, title =       "A decomposition-based approach to layered manufacturing"
+, booktitle =   "Proc. 7th Workshop Algorithms Data Struct."
+, nickname =    "WADS '01"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      2125
+, publisher =   "Springer-Verlag"
+, year =        2001
+, pages =       "389--400"
+, update =      "01.11 smid"
 }
 
 @techreport{i-empfm-86
-, author =	"H. Imai"
-, title =	"Extensions of the multiplicative penalty function method for linear programming"
-, type =	"Report"
-, number =	"CSCE-86-C04"
-, institution =	"Dept. Comput. Sci., Kyushu Univ."
-, address =	"Fukuoka, Japan"
-, year =	1986
+, author =      "H. Imai"
+, title =       "Extensions of the multiplicative penalty function method for linear programming"
+, type =        "Report"
+, number =      "CSCE-86-C04"
+, institution = "Dept. Comput. Sci., Kyushu Univ."
+, address =     "Fukuoka, Japan"
+, year =        1986
 }
 
 @techreport{i-galse-87
-, author =	"H. Imai"
-, title =	"Geometric algorithms for locating a single-eye robot"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
-, address =	"Fukuoka, Japan"
-, year =	1987
+, author =      "H. Imai"
+, title =       "Geometric algorithms for locating a single-eye robot"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
+, address =     "Fukuoka, Japan"
+, year =        1987
 }
 
 @article{i-nfalt-83
-, author =	"H. Imai"
-, title =	"Network-Flow Algorithms for Lower-Tuncated Transversal Polymatroids"
-, journal =	"J. Oper. Res. Soc. Japan"
-, volume =	26
-, number =	3
-, year =	1983
-, pages =	"186--210"
-, update =	"98.07 bibrelex"
+, author =      "H. Imai"
+, title =       "Network-Flow Algorithms for Lower-Tuncated Transversal Polymatroids"
+, journal =     "J. Oper. Res. Soc. Japan"
+, volume =      26
+, number =      3
+, year =        1983
+, pages =       "186--210"
+, update =      "98.07 bibrelex"
 }
 
 @article{i-csldp-85
-, author =	"H. Imai"
-, title =	"On combinatorial structures of line drawings of polyhedra"
-, journal =	"Discrete Appl. Math."
-, volume =	10
-, year =	1985
-, pages =	"79--92"
-, update =	"97.11 bibrelex"
+, author =      "H. Imai"
+, title =       "On combinatorial structures of line drawings of polyhedra"
+, journal =     "Discrete Appl. Math."
+, volume =      10
+, year =        1985
+, pages =       "79--92"
+, update =      "97.11 bibrelex"
 }
 
 @article{i-wcapm-86
-, author =	"H. Imai"
-, title =	"Worst-case analysis for planar matching and tour heuristics with bucketing techniques and spacefilling curves"
-, journal =	"J. Oper. Res. Soc. Japan"
-, volume =	29
-, number =	1
-, year =	1986
-, pages =	"43--68"
+, author =      "H. Imai"
+, title =       "Worst-case analysis for planar matching and tour heuristics with bucketing techniques and spacefilling curves"
+, journal =     "J. Oper. Res. Soc. Japan"
+, volume =      29
+, number =      1
+, year =        1986
+, pages =       "43--68"
 }
 
 @techreport{ia-eafmm-83
-, author =	"H. Imai and Ta. Asano"
-, title =	"An efficient algorithm for finding a maximum matching of an intersection graph of horizontal and vertical line segments"
-, type =	"Paper"
-, number =	"{CAS} 83-143"
-, institution =	"IECE Tech. Group Circuits \& Systems"
-, year =	1983
+, author =      "H. Imai and Ta. Asano"
+, title =       "An efficient algorithm for finding a maximum matching of an intersection graph of horizontal and vertical line segments"
+, type =        "Paper"
+, number =      "{CAS} 83-143"
+, institution = "IECE Tech. Group Circuits \& Systems"
+, year =        1983
 }
 
 @techreport{ia-oghmc-??
-, author =	"H. Imai and Ta. Asano"
-, title =	"An {$O(n \log n)$} greedy heuristic for the minimum chord-length rectangular partition (extended abstract)"
-, type =	"Technical {Report}"
-, number =	"CAS84-115"
-, institution =	"IECE of Japan"
-, year =	"??"
-, pages =	"1--4"
-, keywords =	"decomposition, approximation, VLSI design"
+, author =      "H. Imai and Ta. Asano"
+, title =       "An {$O(n \log n)$} greedy heuristic for the minimum chord-length rectangular partition (extended abstract)"
+, type =        "Technical {Report}"
+, number =      "CAS84-115"
+, institution = "IECE of Japan"
+, year =        "??"
+, pages =       "1--4"
+, keywords =    "decomposition, approximation, VLSI design"
 }
 
 @article{ia-dosis-87
-, author =	"H. Imai and Ta. Asano"
-, title =	"Dynamic orthogonal segment intersection search"
-, journal =	"J. Algorithms"
-, volume =	8
-, year =	1987
-, pages =	"1--18"
-, keywords =	"intersection, dynamizing, data structuring, searching, VLSI design, decomposition, amortized analysis"
-, succeeds =	"ia-dsisa-84"
-, update =	"97.11 bibrelex"
+, author =      "H. Imai and Ta. Asano"
+, title =       "Dynamic orthogonal segment intersection search"
+, journal =     "J. Algorithms"
+, volume =      8
+, year =        1987
+, pages =       "1--18"
+, keywords =    "intersection, dynamizing, data structuring, searching, VLSI design, decomposition, amortized analysis"
+, succeeds =    "ia-dsisa-84"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ia-dsisa-84
-, author =	"H. Imai and Ta. Asano"
-, title =	"Dynamic Segment Intersection Search with Applications"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, publisher =	"IEEE Computer Society Press"
-, address =	"Los Angeles, Ca., USA"
-, year =	1984
-, pages =	"393--402"
-, precedes =	"ia-dosis-87"
-, update =	"97.11 bibrelex"
+, author =      "H. Imai and Ta. Asano"
+, title =       "Dynamic Segment Intersection Search with Applications"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, publisher =   "IEEE Computer Society Press"
+, address =     "Los Angeles, Ca., USA"
+, year =        1984
+, pages =       "393--402"
+, precedes =    "ia-dosis-87"
+, update =      "97.11 bibrelex"
 }
 
 @article{ia-eaggs-86
-, author =	"H. Imai and Ta. Asano"
-, title =	"Efficient algorithms for geometric graph search problems"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, number =	2
-, year =	1986
-, pages =	"478--494"
-, keywords =	"intersection, dynamizing, data structuring, searching, VLSI design, decomposition, amortized analysis"
-, update =	"97.11 bibrelex"
+, author =      "H. Imai and Ta. Asano"
+, title =       "Efficient algorithms for geometric graph search problems"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, number =      2
+, year =        1986
+, pages =       "478--494"
+, keywords =    "intersection, dynamizing, data structuring, searching, VLSI design, decomposition, amortized analysis"
+, update =      "97.11 bibrelex"
 }
 
 @article{ia-fccmc-83
-, author =	"H. Imai and Ta. Asano"
-, title =	"Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane"
-, journal =	"J. Algorithms"
-, volume =	4
-, year =	1983
-, pages =	"310--323"
-, keywords =	"VLSI design, plane-sweep, rectangles, intersection"
+, author =      "H. Imai and Ta. Asano"
+, title =       "Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane"
+, journal =     "J. Algorithms"
+, volume =      4
+, year =        1983
+, pages =       "310--323"
+, keywords =    "VLSI design, plane-sweep, rectangles, intersection"
 }
 
 @inproceedings{ii-vdmp-90
-, author =	"H. Imai and K. Imai"
-, title =	"Voronoi Diagrams of Moving Points"
-, booktitle =	"Proc. Int. Computer Symp."
-, site =	"Taiwan"
-, year =	1990
-, pages =	"600--606"
-, update =	"98.11 bibrelex"
+, author =      "H. Imai and K. Imai"
+, title =       "Voronoi Diagrams of Moving Points"
+, booktitle =   "Proc. Int. Computer Symp."
+, site =        "Taiwan"
+, year =        1990
+, pages =       "600--606"
+, update =      "98.11 bibrelex"
 }
 
 @article{ii-gca-96
-, author =	"H. Imai and M. Inaba"
-, title =	"Geometric clustering with applications"
-, journal =	"Zeitschrift f{\"u}r Angewandte Mathematik"
-, volume =	3
-, year =	1996
-, pages =	"183--186"
-, note =	"ICIAM95 Proc., Applied Stochastics and Optimzation"
-, update =	"98.07 bibrelex"
+, author =      "H. Imai and M. Inaba"
+, title =       "Geometric clustering with applications"
+, journal =     "Zeitschrift f{\"u}r Angewandte Mathematik"
+, volume =      3
+, year =        1996
+, pages =       "183--186"
+, note =        "ICIAM95 Proc., Applied Stochastics and Optimzation"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{ii-oaapl-86t
-, author =	"H. Imai and M. Iri"
-, title =	"An optimal algorithm for approximating a piecewise linear function"
-, type =	"Report"
-, number =	"CSCE-86-C03"
-, institution =	"Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
-, address =	"Fukuoka, Japan"
-, year =	1986
-, precedes =	"ii-oaapl-86a"
+, author =      "H. Imai and M. Iri"
+, title =       "An optimal algorithm for approximating a piecewise linear function"
+, type =        "Report"
+, number =      "CSCE-86-C03"
+, institution = "Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
+, address =     "Fukuoka, Japan"
+, year =        1986
+, precedes =    "ii-oaapl-86a"
 }
 
 @article{ii-oaapl-86a
-, author =	"H. Imai and M. Iri"
-, title =	"An Optimal Algorithm for Approximating a Piecewise Linear Function"
-, journal =	"J. Inform. Process."
-, volume =	9
-, number =	3
-, year =	1986
-, pages =	"159--162"
-, succeeds =	"ii-oaapl-86t"
+, author =      "H. Imai and M. Iri"
+, title =       "An Optimal Algorithm for Approximating a Piecewise Linear Function"
+, journal =     "J. Inform. Process."
+, volume =      9
+, number =      3
+, year =        1986
+, pages =       "159--162"
+, succeeds =    "ii-oaapl-86t"
 }
 
 @techreport{ii-cgmpa-85
-, author =	"H. Imai and M. Iri"
-, title =	"Computational-geometric methods for polygonal approximations of a curve"
-, type =	"Report"
-, number =	"RMI 85-01"
-, institution =	"Dept. Math. Engrg. Instrumentation Phys., Univ. Tokyo"
-, address =	"Bunkyo-ku, Tokyo, Japan"
-, year =	1985
-, precedes =	"ii-cgmpa-86"
-, update =	"98.07 bibrelex"
+, author =      "H. Imai and M. Iri"
+, title =       "Computational-geometric methods for polygonal approximations of a curve"
+, type =        "Report"
+, number =      "RMI 85-01"
+, institution = "Dept. Math. Engrg. Instrumentation Phys., Univ. Tokyo"
+, address =     "Bunkyo-ku, Tokyo, Japan"
+, year =        1985
+, precedes =    "ii-cgmpa-86"
+, update =      "98.07 bibrelex"
 }
 
 @article{ii-cgmpa-86
-, author =	"Hiroshi Imai and Masao Iri"
-, title =	"Computational-Geometric Methods for Polygonal Approximations of a Curve"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	36
-, year =	1986
-, pages =	"31--41"
-, succeeds =	"ii-cgmpa-85"
-, update =	"98.07 bibrelex"
+, author =      "Hiroshi Imai and Masao Iri"
+, title =       "Computational-Geometric Methods for Polygonal Approximations of a Curve"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      36
+, year =        1986
+, pages =       "31--41"
+, succeeds =    "ii-cgmpa-85"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{ii-pacfa-88
-, author =	"H. Imai and M. Iri"
-, title =	"Polygonal approximations of a curve-formulations and algorithms"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"71--86"
-, succeeds =	"ii-pacfs-86"
+, author =      "H. Imai and M. Iri"
+, title =       "Polygonal approximations of a curve-formulations and algorithms"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "71--86"
+, succeeds =    "ii-pacfs-86"
 }
 
 @techreport{ii-pacfs-86
-, author =	"H. Imai and M. Iri"
-, title =	"Polygonal approximations of a curve-formulations and solution algorithms"
-, type =	"Report"
-, number =	"CSCE-86-C07"
-, institution =	"Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
-, address =	"Fukuoka, Japan"
-, year =	1986
-, precedes =	"ii-pacfa-88"
+, author =      "H. Imai and M. Iri"
+, title =       "Polygonal approximations of a curve-formulations and solution algorithms"
+, type =        "Report"
+, number =      "CSCE-86-C07"
+, institution = "Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
+, address =     "Fukuoka, Japan"
+, year =        1986
+, precedes =    "ii-pacfa-88"
 }
 
 @article{iim-vdlgi-85
-, author =	"H. Imai and M. Iri and K. Murota"
-, title =	"Voronoi diagrams in the {Laguerre} geometry and its applications"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"93--105"
+, author =      "H. Imai and M. Iri and K. Murota"
+, title =       "Voronoi diagrams in the {Laguerre} geometry and its applications"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "93--105"
 }
 
 @techreport{iky-ltall-87
-, author =	"H. Imai and K. Kato and P. Yamamoto"
-, title =	"A linear-time algorithm for linear {$L_{1}$} approximation of points"
-, type =	"Report"
-, number =	"CSCE-87-C30"
-, institution =	"Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
-, address =	"Kukuoka, Japan"
-, year =	1987
-, precedes =	"iky-ltall-89"
+, author =      "H. Imai and K. Kato and P. Yamamoto"
+, title =       "A linear-time algorithm for linear {$L_{1}$} approximation of points"
+, type =        "Report"
+, number =      "CSCE-87-C30"
+, institution = "Dept. Comput. Sci. Commun. Engrg., Kyushu Univ."
+, address =     "Kukuoka, Japan"
+, year =        1987
+, precedes =    "iky-ltall-89"
 }
 
 @article{iky-ltall-89
-, author =	"H. Imai and K. Kato and P. Yamamoto"
-, title =	"A linear-time algorithm for linear {$L_{1}$} approximation of points"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"77--96"
-, succeeds =	"iky-ltall-87"
+, author =      "H. Imai and K. Kato and P. Yamamoto"
+, title =       "A linear-time algorithm for linear {$L_{1}$} approximation of points"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "77--96"
+, succeeds =    "iky-ltall-87"
 }
 
 @article{ily-sccp-92
-, author =	"H. Imai and D. Lee and C. Yang"
-, title =	"$1$-Segment center covering problems"
-, journal =	"ORSA J. Comput."
-, volume =	4
-, number =	4
-, year =	1992
-, pages =	"426--434"
-, update =	"98.03 mitchell, 96.09 agarwal, 95.09 agarwal"
-, annote =	"Special issue on computational geometry; J. Mitchell and
+, author =      "H. Imai and D. Lee and C. Yang"
+, title =       "$1$-Segment center covering problems"
+, journal =     "ORSA J. Comput."
+, volume =      4
+, number =      4
+, year =        1992
+, pages =       "426--434"
+, update =      "98.03 mitchell, 96.09 agarwal, 95.09 agarwal"
+, annote =      "Special issue on computational geometry; J. Mitchell and
                   J. Karel Lenstra, eds."
 }
 
 @inproceedings{ily-1scp-89
-, author =	"H. Imai and D. T. Lee and C. D. Yang"
-, title =	"On the $1$-segment-center problem"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	18
+, author =      "H. Imai and D. T. Lee and C. D. Yang"
+, title =       "On the $1$-segment-center problem"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       18
 }
 
 @article{i-vdmp-89
-, author =	"K. Imai"
-, title =	"{Voronoi} Diagrams for Moving Points"
-, journal =	"Memoirs of Mathematical Research Institute, Kyoto Univ."
-, volume =	695
-, year =	1989
-, pages =	"225--232"
-, note =	"In Japanese"
-, update =	"97.11 bibrelex"
+, author =      "K. Imai"
+, title =       "{Voronoi} Diagrams for Moving Points"
+, journal =     "Memoirs of Mathematical Research Institute, Kyoto Univ."
+, volume =      695
+, year =        1989
+, pages =       "225--232"
+, note =        "In Japanese"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{isi-mgftc-89
-, author =	"K. Imai and S. Sumino and H. Imai"
-, title =	"Minimax geometric fitting of two corresponding sets of points"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"266--275"
-, cites =	"ass-sulbl-89, amww-cssgo-88, a-sdcgp-85, epss-lebfi-87, h-fuenl-89, ms-rcibt-88, m-lpltw-84, m-dlp-86, n-avsir-87, s-ossac-86, s-pds-74, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "K. Imai and S. Sumino and H. Imai"
+, title =       "Minimax geometric fitting of two corresponding sets of points"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "266--275"
+, cites =       "ass-sulbl-89, amww-cssgo-88, a-sdcgp-85, epss-lebfi-87, h-fuenl-89, ms-rcibt-88, m-lpltw-84, m-dlp-86, n-avsir-87, s-ossac-86, s-pds-74, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{i-stdgp-98
-, author =	"Toshiyuki Imai"
-, title =	"A Simple Treatment for Degeneracies in Geometric Programs"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"103--105"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Toshiyuki Imai"
+, title =       "A Simple Treatment for Degeneracies in Geometric Programs"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "103--105"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{i-toavd-96
-, author =	"T. Imai"
-, title =	"A topology oriented algorithm for the {Voronoi} diagram of polygons"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"107--112"
-, update =	"96.09 mitchell"
+, author =      "T. Imai"
+, title =       "A topology oriented algorithm for the {Voronoi} diagram of polygons"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "107--112"
+, update =      "96.09 mitchell"
 }
 
 @mastersthesis{i-nracv-89
-, author =	"T. Imai"
-, title =	"Numerically robust algorithm for constructing {Voronoi} diagrams for line segments (in {Japanese})"
-, type =	"M.{Sc}. Thesis"
-, school =	"Dept. Math. Engr. Info. Phys., Univ. Tokyo"
-, address =	"Tokyo, Japan"
-, year =	1989
-, keywords =	"master thesis"
+, author =      "T. Imai"
+, title =       "Numerically robust algorithm for constructing {Voronoi} diagrams for line segments (in {Japanese})"
+, type =        "M.{Sc}. Thesis"
+, school =      "Dept. Math. Engr. Info. Phys., Univ. Tokyo"
+, address =     "Tokyo, Japan"
+, year =        1989
+, keywords =    "master thesis"
 }
 
 @inproceedings{i-smdsi-97
-, author =	"Toshiyuki Imai"
-, title =	"Some Methods to Determine the Sign of an Integer from its Remainders"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"117--122"
-, update =	"97.11 jones"
+, author =      "Toshiyuki Imai"
+, title =       "Some Methods to Determine the Sign of an Integer from its Remainders"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "117--122"
+, update =      "97.11 jones"
 }
 
 @article{iw-dstp-91
-, author =	"M. Imase and B. M. Waxman"
-, title =	"Dynamic {Steiner} tree problem"
-, journal =	"SIAM J. Discrete Math."
-, volume =	4
-, year =	1991
-, pages =	"369--384"
-, update =	"97.11 bibrelex"
+, author =      "M. Imase and B. M. Waxman"
+, title =       "Dynamic {Steiner} tree problem"
+, journal =     "SIAM J. Discrete Math."
+, volume =      4
+, year =        1991
+, pages =       "369--384"
+, update =      "97.11 bibrelex"
 }
 
 @article{i-pnm-75
-, author =	"E. Imhof"
-, title =	"Positioning Names on Maps"
-, journal =	"Amer. Cartogr."
-, volume =	2
-, year =	1975
-, pages =	"128--144"
-, update =	"97.11 bibrelex"
+, author =      "E. Imhof"
+, title =       "Positioning Names on Maps"
+, journal =     "Amer. Cartogr."
+, volume =      2
+, year =        1975
+, pages =       "128--144"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ik-chmhe-89
-, author =	"C. Imielinska and B. Kalantari"
-, title =	"On the complexity of the hypergreeedy matching heuristic for the {Euclidean} points in the plane"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	17
+, author =      "C. Imielinska and B. Kalantari"
+, title =       "On the complexity of the hypergreeedy matching heuristic for the {Euclidean} points in the plane"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       17
 }
 
 @inproceedings{iah-ldra-94
-, author =	"M. Inaba and Y. Aoki and S. Hasegawa"
-, title =	"Level Difference of the Reconstructed Arrangement"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"12--17"
-, cites =	"a-ccra-93, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "M. Inaba and Y. Aoki and S. Hasegawa"
+, title =       "Level Difference of the Reconstructed Arrangement"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "12--17"
+, cites =       "a-ccra-93, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{iik-errca-96
-, author =	"Mary Inaba and Hiroshi Imai and Naoki Katoh"
-, title =	"Experimental Results of a Randomized Clustering Algorithm"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"C1--C2"
-, cites =	"h-ciqfb-80, iki-awvdr-94, si-kmtag-84, wwp-amdc-88, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Mary Inaba and Hiroshi Imai and Naoki Katoh"
+, title =       "Experimental Results of a Randomized Clustering Algorithm"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "C1--C2"
+, cites =       "h-ciqfb-80, iki-awvdr-94, si-kmtag-84, wwp-amdc-88, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{iins-aegcm-97
-, author =	"M. Inaba and H. Imai and M. Nakade and T. Sekiguchi"
-, title =	"Application of an Effective Geometric Clustering Method to Color Quantization Problem"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"477--478"
-, keywords =	"video review"
-, cites =	"h-ciqfb-82, hiikn-eavbk-93, imo-fvdaa-83, ii-gca-96, iki-awvdr-94, iik-errca-96, si-kmtag-84, wwp-amdc-88, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "M. Inaba and H. Imai and M. Nakade and T. Sekiguchi"
+, title =       "Application of an Effective Geometric Clustering Method to Color Quantization Problem"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "477--478"
+, keywords =    "video review"
+, cites =       "h-ciqfb-82, hiikn-eavbk-93, imo-fvdaa-83, ii-gca-96, iki-awvdr-94, iik-errca-96, si-kmtag-84, wwp-amdc-88, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{iki-awvdr-94
-, author =	"M. Inaba and N. Katoh and H. Imai"
-, title =	"Applications of Weighted {Voronoi} Diagrams and Randomization to Variance-Based $k$-Clustering"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"332--339"
-, cites =	"abky-cabmm-88, bh-cpcoe-88, crw-gc-91, fg-oaac-88i, hr-tcpp-93, h-senea-93, hiikn-eavbk-93, hii-eakls-93, h-ciqfb-82, h-msde-92, i-ecchs-94, ki-pceas-87, kl-ehppg-70, ms-cscgl-84, wwp-amdc-88, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "M. Inaba and N. Katoh and H. Imai"
+, title =       "Applications of Weighted {Voronoi} Diagrams and Randomization to Variance-Based $k$-Clustering"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "332--339"
+, cites =       "abky-cabmm-88, bh-cpcoe-88, crw-gc-91, fg-oaac-88i, hr-tcpp-93, h-senea-93, hiikn-eavbk-93, hii-eakls-93, h-ciqfb-82, h-msde-92, i-ecchs-94, ki-pceas-87, kl-ehppg-70, ms-cscgl-84, wwp-amdc-88, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @inproceedings{is-nracc-94
-, author =	"H. Inagaki and K. Sugihara"
-, title =	"Numerically Robust Algorithm for Constructing Constrained {Delaunay} Triangulation"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"171--176"
-, cites =	"ps-cgi-85, a-vdsfg-91, obs-stcav-92, be-mgot-92i, hhk-tirgc-88, m-vigau-88a, si-cvdom-92, iss-nriac-92, oim-iimvd-84, ZZZ"
-, update =	"98.11 bibrelex, 97.03 schwarzkopf, 94.09 jones"
+, author =      "H. Inagaki and K. Sugihara"
+, title =       "Numerically Robust Algorithm for Constructing Constrained {Delaunay} Triangulation"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "171--176"
+, cites =       "ps-cgi-85, a-vdsfg-91, obs-stcav-92, be-mgot-92i, hhk-tirgc-88, m-vigau-88a, si-cvdom-92, iss-nriac-92, oim-iimvd-84, ZZZ"
+, update =      "98.11 bibrelex, 97.03 schwarzkopf, 94.09 jones"
 }
 
 @inproceedings{iss-nriac-92
-, author =	"H. Inagaki and K. Sugihara and N. Sugie"
-, title =	"Numerically robust incremental algorithm for constructing three-dimensional {Voronoi} diagrams"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"334--339"
-, cites =	"h-pargc-89, si-tdpga-89, si-cvdom-92, oim-iimvd-84, ZZZ"
-, update =	"98.07 bibrelex, 95.05 schwarzkopf"
+, author =      "H. Inagaki and K. Sugihara and N. Sugie"
+, title =       "Numerically robust incremental algorithm for constructing three-dimensional {Voronoi} diagrams"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "334--339"
+, cites =       "h-pargc-89, si-tdpga-89, si-cvdom-92, oim-iimvd-84, ZZZ"
+, update =      "98.07 bibrelex, 95.05 schwarzkopf"
 }
 
 @inproceedings{i-stasc-99
-, author =	"Piotr Indyk"
-, title =	"A Sublinear-time Approximation Scheme for Clustering in Metric Spaces"
-, booktitle =	"Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1999
-, pages =	"154--159"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Piotr Indyk"
+, title =       "A Sublinear-time Approximation Scheme for Clustering in Metric Spaces"
+, booktitle =   "Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1999
+, pages =       "154--159"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{i-drtpp-00
-, author =	"Piotr Indyk"
-, title =	"Dimensionality reduction techniques for proximity problems"
-, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	2000
-, pages =	"371--378"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Piotr Indyk"
+, title =       "Dimensionality reduction techniques for proximity problems"
+, booktitle =   "Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        2000
+, pages =       "371--378"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{i-annne-98
-, author =	"Piotr Indyk"
-, title =	"On Approximate Nearest Neighbors in Non-{Euclidean} Spaces"
-, booktitle =	"Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1998
-, pages =	"148--155"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Piotr Indyk"
+, title =       "On Approximate Nearest Neighbors in Non-{Euclidean} Spaces"
+, booktitle =   "Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1998
+, pages =       "148--155"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{if-annah-99
-, author =	"Piotr Indyk and M. Farach-Colton"
-, title =	"Approximate Nearest Neighbor Algorithms for {Hausdorff} Metrics via Embeddings"
-, booktitle =	"Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1999
-, pages =	"171--180"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Piotr Indyk and M. Farach-Colton"
+, title =       "Approximate Nearest Neighbor Algorithms for {Hausdorff} Metrics via Embeddings"
+, booktitle =   "Proc. 40th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1999
+, pages =       "171--180"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{im-anntr-98
-, author =	"Piotr Indyk and Rajeev Motwani"
-, title =	"Approximate Nearest Neighbors: {Towards} Removing the Curse of Dimensionality"
-, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
-, year =	1998
-, pages =	"to appear"
-, update =	"98.03 mitchell"
+, author =      "Piotr Indyk and Rajeev Motwani"
+, title =       "Approximate Nearest Neighbors: {Towards} Removing the Curse of Dimensionality"
+, booktitle =   "Proc. 30th Annu. ACM Sympos. Theory Comput."
+, year =        1998
+, pages =       "to appear"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{imrv-lphms-97
-, author =	"P. Indyk and R. Motwani and P. Raghavan and S. Vempala"
-, title =	"Locality-preserving hashing in multidimensional spaces"
-, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '97"
-, year =	1997
-, pages =	"618--625"
-, update =	"98.07 bibrelex, 98.03 smid, 97.07 agarwal"
+, author =      "P. Indyk and R. Motwani and P. Raghavan and S. Vempala"
+, title =       "Locality-preserving hashing in multidimensional spaces"
+, booktitle =   "Proc. 29th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '97"
+, year =        1997
+, pages =       "618--625"
+, update =      "98.07 bibrelex, 98.03 smid, 97.07 agarwal"
 }
 
 @inproceedings{i-crosp-89
-, author =	"A. Inselberg"
-, title =	"Conflict resolution, one-shot problem, and air traffic control"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	26
+, author =      "A. Inselberg"
+, title =       "Conflict resolution, one-shot problem, and air traffic control"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       26
 }
 
 @techreport{i-ndgp1-81
-, author =	"A. Inselberg"
-, title =	"{$N$}-dimensional graphics, part {I}: lines and hyperplanes"
-, type =	"Report"
-, number =	"G320-2711"
-, institution =	"IBM Sci. Center"
-, address =	"Los Angeles, CA"
-, year =	1981
+, author =      "A. Inselberg"
+, title =       "{$N$}-dimensional graphics, part {I}: lines and hyperplanes"
+, type =        "Report"
+, number =      "G320-2711"
+, institution = "IBM Sci. Center"
+, address =     "Los Angeles, CA"
+, year =        1981
 }
 
 @article{i-ppc-85
-, author =	"A. Inselberg"
-, title =	"The plane with parallel coordinates"
-, journal =	"Visual Comput."
-, volume =	1
-, year =	1985
-, pages =	"69--91"
+, author =      "A. Inselberg"
+, title =       "The plane with parallel coordinates"
+, journal =     "Visual Comput."
+, volume =      1
+, year =        1985
+, pages =       "69--91"
 }
 
 @article{icr-capc-87
-, author =	"A. Inselberg and T. Chomut and M. Reif"
-, title =	"Complexity algorithms in parallel coordinates"
-, journal =	"J. ACM"
-, volume =	34
-, year =	1987
-, pages =	"765--801"
+, author =      "A. Inselberg and T. Chomut and M. Reif"
+, title =       "Complexity algorithms in parallel coordinates"
+, journal =     "J. ACM"
+, volume =      34
+, year =        1987
+, pages =       "765--801"
 }
 
 @techreport{ir-cpc-84
-, author =	"A. Inselberg and M. Reif"
-, title =	"Convexity in parallel coordinates"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Univ. California"
-, address =	"Los Angeles, CA"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "A. Inselberg and M. Reif"
+, title =       "Convexity in parallel coordinates"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Univ. California"
+, address =     "Los Angeles, CA"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{i-cigol-90
-, author =	"S. Irani"
-, title =	"Coloring Inductive Graphs On-Line"
-, booktitle =	"Proc. 30th FOCS"
-, year =	1990
-, pages =	"470--479"
-, update =	"98.07 bibrelex"
+, author =      "S. Irani"
+, title =       "Coloring Inductive Graphs On-Line"
+, booktitle =   "Proc. 30th FOCS"
+, year =        1990
+, pages =       "470--479"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ir-cerrp-96
-, author =	"Sandy Irani and Prabhakar Raghavan"
-, title =	"Combinatorial and Experimental Results for Randomized Point Matching Algorithms"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"68--77"
-, cites =	"cghkkk-gpmem-93, ee-scpps-, fb-rscpm-81, gh-sgh-90, hh-gicv-92, hu-orua-87, hu-rsoa-90, lsw-oraim-88, lw-ghgem-88, lw-eagh-91, w-mborg-90, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Sandy Irani and Prabhakar Raghavan"
+, title =       "Combinatorial and Experimental Results for Randomized Point Matching Algorithms"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "68--77"
+, cites =       "cghkkk-gpmem-93, ee-scpps-, fb-rscpm-81, gh-sgh-90, hh-gicv-92, hu-orua-87, hu-rsoa-90, lsw-oraim-88, lw-ghgem-88, lw-eagh-91, w-mborg-90, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @book{i-smp-79
-, author =	"?? Iri"
-, title =	"Survey of mathematical programming"
-, editor =	"A. Pr{\'e}kopa"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1979
-, update =	"98.03 bibrelex"
+, author =      "?? Iri"
+, title =       "Survey of mathematical programming"
+, editor =      "A. Pr{\'e}kopa"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1979
+, update =      "98.03 bibrelex"
 }
 
 @techreport{i-fagdp-83
-, author =	"M. Iri"
-, title =	"Fundamental algorithms for geographical data processing"
-, type =	"Report"
-, number =	"T-83-1"
-, institution =	"Oper. Res. Soc. of Japan"
-, year =	1983
+, author =      "M. Iri"
+, title =       "Fundamental algorithms for geographical data processing"
+, type =        "Report"
+, number =      "T-83-1"
+, institution = "Oper. Res. Soc. of Japan"
+, year =        1983
 }
 
 @article{if-umtor-81
-, author =	"M. Iri and S. Fujishige"
-, title =	"Use of matroid theory in operating research, circuits and systems theory"
-, journal =	"Int. J. Systems Sci."
-, volume =	12
-, number =	1
-, year =	1981
-, pages =	"27--54"
-, update =	"98.11 bibrelex"
+, author =      "M. Iri and S. Fujishige"
+, title =       "Use of matroid theory in operating research, circuits and systems theory"
+, journal =     "Int. J. Systems Sci."
+, volume =      12
+, number =      1
+, year =        1981
+, pages =       "27--54"
+, update =      "98.11 bibrelex"
 }
 
 @article{imm-hpmwp-83
-, author =	"M. Iri and K. Murota and S. Matsui"
-, title =	"Heuristics for planar minimum-weight perfect matchings"
-, journal =	"Networks"
-, volume =	13
-, year =	1983
-, pages =	"67--92"
+, author =      "M. Iri and K. Murota and S. Matsui"
+, title =       "Heuristics for planar minimum-weight perfect matchings"
+, journal =     "Networks"
+, volume =      13
+, year =        1983
+, pages =       "67--92"
 }
 
 @article{imm-ltaaf-81
-, author =	"M. Iri and K. Murota and S. Matsui"
-, title =	"Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane"
-, journal =	"Inform. Process. Lett."
-, volume =	12
-, year =	1981
-, pages =	"206--209"
+, author =      "M. Iri and K. Murota and S. Matsui"
+, title =       "Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane"
+, journal =     "Inform. Process. Lett."
+, volume =      12
+, year =        1981
+, pages =       "206--209"
 }
 
 % I think I corrected it now.
 % This entry is/was incorrect; LNCS 59 is not that proceedings
 @inproceedings{imo-fvdaa-83
-, author =	"M. Iri and K. Murota and T. Ohya"
-, title =	"A fast {Voronoi}-diagram algorithm with applications to geographical optimization problems"
-, booktitle =	"Proc. 11th IFIP Conf."
-, series =	"Lecture Notes in Control and Information Science"
-, volume =	59
-, publisher =	"Springer-Verlag"
-, year =	1983
-, pages =	"253--288"
-, update =	"95.01 mitchell"
+, author =      "M. Iri and K. Murota and T. Ohya"
+, title =       "A fast {Voronoi}-diagram algorithm with applications to geographical optimization problems"
+, booktitle =   "Proc. 11th IFIP Conf."
+, series =      "Lecture Notes in Control and Information Science"
+, volume =      59
+, publisher =   "Springer-Verlag"
+, year =        1983
+, pages =       "253--288"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{imo-goptp-83
-, author =	"M. Iri and K. Murota and T. Ohya"
-, title =	"Geographical optimization problems and their practical solutions"
-, booktitle =	"Proc. Spring Conf. Oper. Res. Soc. of Japan"
-, volume =	"C-2"
-, year =	1983
-, pages =	"92--93"
+, author =      "M. Iri and K. Murota and T. Ohya"
+, title =       "Geographical optimization problems and their practical solutions"
+, booktitle =   "Proc. Spring Conf. Oper. Res. Soc. of Japan"
+, volume =      "C-2"
+, year =        1983
+, pages =       "92--93"
 }
 
 @techreport{ir-scstp-92
-, author =	"G. Iribarren and M. C. Rivara"
-, title =	"A study on the classes of similar triangles produced by 4-T-bisection"
-, institution =	"Dept. of Computer Science, University of Chile"
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "G. Iribarren and M. C. Rivara"
+, title =       "A study on the classes of similar triangles produced by 4-T-bisection"
+, institution = "Dept. of Computer Science, University of Chile"
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @article{i-amids-91
-, author =	"R. W. Irving"
-, title =	"On Approximating the Minimum Independent Dominating Set"
-, journal =	"Inf. Proc. Lett."
-, volume =	37
-, year =	1991
-, pages =	"197--200"
-, update =	"98.07 bibrelex"
+, author =      "R. W. Irving"
+, title =       "On Approximating the Minimum Independent Dominating Set"
+, journal =     "Inf. Proc. Lett."
+, volume =      37
+, year =        1991
+, pages =       "197--200"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{i-tfebc-00
-, author =	"Martin Isenburg"
-, title =	"Triangle Fixer: Edge-Based Connectivity Compression"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"18--23"
-, update =	"00.03 bibrelex"
+, author =      "Martin Isenburg"
+, title =       "Triangle Fixer: Edge-Based Connectivity Compression"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "18--23"
+, update =      "00.03 bibrelex"
 }
 
 @article{is-srrde-01
-, author =	"M. Isenburg and J. Snoeyink"
-, title =	"Spirale {Reversi}: {Reverse} decoding of the {Edgebreaker} encoding"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	20
-, year =	2001
-, pages =	"39--52"
-, update =	"01.11 smid"
+, author =      "M. Isenburg and J. Snoeyink"
+, title =       "Spirale {Reversi}: {Reverse} decoding of the {Edgebreaker} encoding"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      20
+, year =        2001
+, pages =       "39--52"
+, update =      "01.11 smid"
 }
 
 @inproceedings{is-ffv-00
-, author =	"Martin Isenburg and Jack Snoeyink"
-, title =	"The Face Fixer Video"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"377--378"
-, keywords =	"video review"
-, update =	"00.11 jones"
+, author =      "Martin Isenburg and Jack Snoeyink"
+, title =       "The Face Fixer Video"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "377--378"
+, keywords =    "video review"
+, update =      "00.11 jones"
 }
 
 @mastersthesis{i-ecchs-94
-, author =	"M. Ishiguro"
-, title =	"Evaluation of combinatorial complexity for hypothesis spaces in learning theory with applications"
-, school =	"Dept. Inform. Sci., Univ. Tokyo"
-, address =	"Tokyo, Japan"
-, year =	1994
-, keywords =	"master thesis"
-, update =	"98.03 bibrelex"
+, author =      "M. Ishiguro"
+, title =       "Evaluation of combinatorial complexity for hypothesis spaces in learning theory with applications"
+, school =      "Dept. Inform. Sci., Univ. Tokyo"
+, address =     "Tokyo, Japan"
+, year =        1994
+, keywords =    "master thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{i-mlpd-92
-, author =	"H. Ishii"
-, title =	"Minimax location problem with a distance"
-, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
-, site =	"Kyoto, Japan"
-, year =	1992
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "H. Ishii"
+, title =       "Minimax location problem with a distance"
+, booktitle =   "Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
+, site =        "Kyoto, Japan"
+, year =        1992
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{ishs-spadc-83
-, author =	"M. Ishijama and S.-B. Shin and G. H. Hostetter and J. Sklansky"
-, title =	"Scan-along polygonal approximation for data compression of electrocardiograms"
-, journal =	"IEEE Trans. on Biomedical Engg."
-, volume =	"BME-30"
-, number =	11
-, year =	1983
-, pages =	"723--729"
-, update =	"98.07 bibrelex"
+, author =      "M. Ishijama and S.-B. Shin and G. H. Hostetter and J. Sklansky"
+, title =       "Scan-along polygonal approximation for data compression of electrocardiograms"
+, journal =     "IEEE Trans. on Biomedical Engg."
+, volume =      "BME-30"
+, number =      11
+, year =        1983
+, pages =       "723--729"
+, update =      "98.07 bibrelex"
 }
 
 @article{iso-vvd-87
-, author =	"S. Isoda and T. Shimonmura and Y. Ono"
-, title =	"VIPS: A visual Debugger"
-, journal =	"IEEE Softw."
-, volume =	4
-, number =	3
-, year =	1987
-, pages =	"8--19"
-, keywords =	"graph drawing, system"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "S. Isoda and T. Shimonmura and Y. Ono"
+, title =       "VIPS: A visual Debugger"
+, journal =     "IEEE Softw."
+, volume =      4
+, number =      3
+, year =        1987
+, pages =       "8--19"
+, keywords =    "graph drawing, system"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @article{ips-hpgg-82
-, author =	"A. Itai and C. H. Papadimitriou and J. L. Szwarcfiter"
-, title =	"Hamilton paths in grid graphs"
-, journal =	"SIAM J. Comput."
-, volume =	11
-, year =	1982
-, pages =	"676--686"
-, update =	"95.09 mitchell"
+, author =      "A. Itai and C. H. Papadimitriou and J. L. Szwarcfiter"
+, title =       "Hamilton paths in grid graphs"
+, journal =     "SIAM J. Comput."
+, volume =      11
+, year =        1982
+, pages =       "676--686"
+, update =      "95.09 mitchell"
 }
 
 @inproceedings{ir-mtard-84
-, author =	"A. Itai and M. Rodeh"
-, title =	"The multi-tree approach to reliability in distributed networks"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1984
-, pages =	"137--147"
-, update =	"98.11 bibrelex"
+, author =      "A. Itai and M. Rodeh"
+, title =       "The multi-tree approach to reliability in distributed networks"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1984
+, pages =       "137--147"
+, update =      "98.11 bibrelex"
 }
 
 @article{is-mfpn-79
-, author =	"A. Itai and Y. Shiloach"
-, title =	"Maximum flow in planar networks"
-, journal =	"SIAM J. Comput."
-, volume =	8
-, number =	2
-, month =	may
-, year =	1979
-, pages =	"135--150"
-, update =	"98.03 bibrelex"
+, author =      "A. Itai and Y. Shiloach"
+, title =       "Maximum flow in planar networks"
+, journal =     "SIAM J. Comput."
+, volume =      8
+, number =      2
+, month =       may
+, year =        1979
+, pages =       "135--150"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{ityik-msrdd-95
-, author =	"A. Itai and N. Tomioka and M. Yamada and A. Inoue and Y. Kato"
-, title =	"Molecular superposition for rational drug design"
-, editor =	"?? Kubingi"
-, booktitle =	"3D QSAR in Drug Design: Theory, Methods, and Applications"
-, publisher =	"ESCOM"
-, year =	1995
-, update =	"98.07 bibrelex"
+, author =      "A. Itai and N. Tomioka and M. Yamada and A. Inoue and Y. Kato"
+, title =       "Molecular superposition for rational drug design"
+, editor =      "?? Kubingi"
+, booktitle =   "3D QSAR in Drug Design: Theory, Methods, and Applications"
+, publisher =   "ESCOM"
+, year =        1995
+, update =      "98.07 bibrelex"
 }
 
 @article{i-aeprd-86
-, author =	"G. F. Italiano"
-, title =	"Amortized Efficiency of a Path Retrieval Data Structure"
-, journal =	"Theoret. Comput. Sci."
-, volume =	48
-, year =	1986
-, pages =	"273--281"
-, update =	"94.01 tamassia"
+, author =      "G. F. Italiano"
+, title =       "Amortized Efficiency of a Path Retrieval Data Structure"
+, journal =     "Theoret. Comput. Sci."
+, volume =      48
+, year =        1986
+, pages =       "273--281"
+, update =      "94.01 tamassia"
 }
 
 @article{i-fpded-88
-, author =	"G. F. Italiano"
-, title =	"Finding Paths and Deleting Edges in Directed Acyclic Graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	28
-, number =	1
-, year =	1988
-, pages =	"5--11"
-, update =	"94.01 tamassia"
+, author =      "G. F. Italiano"
+, title =       "Finding Paths and Deleting Edges in Directed Acyclic Graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      28
+, number =      1
+, year =        1988
+, pages =       "5--11"
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{ipr-fdptp-93
-, author =	"Giuseppe F. Italiano and Johannes A. {La Poutr{\'e}} and Monika H. Rauch"
-, title =	"Fully Dynamic Planarity Testing in Planar Embedded Graphs"
-, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	726
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"212--223"
-, update =	"00.03 vismara, 95.05 tamassia, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Giuseppe F. Italiano and Johannes A. {La Poutr{\'e}} and Monika H. Rauch"
+, title =       "Fully Dynamic Planarity Testing in Planar Embedded Graphs"
+, booktitle =   "Proc. 1st Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      726
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "212--223"
+, update =      "00.03 vismara, 95.05 tamassia, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{iuy-npsip-98
-, author =	"H. Ito and H. Uehara and M. Yokayama"
-, title =	"NP-completeness of stage illumination problem"
-, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '98"
-, site =	"Tokyo"
-, year =	1998
-, pages =	"88--92"
-, update =	"00.11 smid, 00.07 icking, 99.07 orourke"
+, author =      "H. Ito and H. Uehara and M. Yokayama"
+, title =       "NP-completeness of stage illumination problem"
+, booktitle =   "Proc. Japan Conf. Discrete Comput. Geom. '98"
+, site =        "Tokyo"
+, year =        1998
+, pages =       "88--92"
+, update =      "00.11 smid, 00.07 icking, 99.07 orourke"
 }
 
 @article{ik-aipue-95
-, author =	"T. Itoh and K. Koyamada"
-, title =	"Automatic isosurface propagation using an extrema graph and sorted boundary cell lists"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	1
-, year =	1995
-, pages =	"319--327"
-, update =	"98.07 bibrelex"
+, author =      "T. Itoh and K. Koyamada"
+, title =       "Automatic isosurface propagation using an extrema graph and sorted boundary cell lists"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      1
+, year =        1995
+, pages =       "319--327"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{il-eltac-97
-, author =	"Claudia Iturriaga and Anna Lubiw"
-, title =	"Elastic Labels: the Two-Axis Case"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"181--192"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Claudia Iturriaga and Anna Lubiw"
+, title =       "Elastic Labels: the Two-Axis Case"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "181--192"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{isn-spapr-94
-, author =	"M. Iwai and H. Suzuki and T. Nishizeki"
-, title =	"Shortest path algorithm in the plane with rectilinear polygonal obstacles"
-, booktitle =	"Proc. SIGAL Workshop"
-, month =	jul
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "M. Iwai and H. Suzuki and T. Nishizeki"
+, title =       "Shortest path algorithm in the plane with rectilinear polygonal obstacles"
+, booktitle =   "Proc. SIGAL Workshop"
+, month =       jul
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @techreport{isn-spprp-95
-, author =	"M. Iwai and H. Suzuki and T. Nishizeki"
-, title =	"Shortest paths in a plane with rectiliinear polygonal obstacles"
-, type =	"Report"
-, institution =	"Graduate School of Information Science, Tohoku University, Japan"
-, year =	"1995??"
-, keywords =	"shortest paths, L1 metric, shortest path query, rectilinear polygons"
-, update =	"96.05 efrat, 96.01 mitchell"
-, annote =	"abstract in English, but paper in Japanese
-		Submitted to a journal: Institute of Electronics, Information
-		and Communication Engineers (IEICE), Tokyo"
+, author =      "M. Iwai and H. Suzuki and T. Nishizeki"
+, title =       "Shortest paths in a plane with rectiliinear polygonal obstacles"
+, type =        "Report"
+, institution = "Graduate School of Information Science, Tohoku University, Japan"
+, year =        "1995??"
+, keywords =    "shortest paths, L1 metric, shortest path query, rectilinear polygons"
+, update =      "96.05 efrat, 96.01 mitchell"
+, annote =      "abstract in English, but paper in Japanese
+                Submitted to a journal: Institute of Electronics, Information
+                and Communication Engineers (IEICE), Tokyo"
 }
 
 @inproceedings{it-fhcaj-94i
-, author =	"C. Iwamoto and G. T. Toussaint"
-, title =	"Finding {Hamiltonian} Circuits in Arrangements of {Jordan} Curves is {NP}-Complete"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"93--98"
-, cites =	"ans-nchcp-80, c-hc-85, egt-cal-92, egt-eal-93, gjt-phcpn-76, g-hcppc-82, lw-ehppn-93, or-cswvg-91, r-cscsl-87, rit-cscsl-90, t-tpg-56, w-tg-31, k-racpc-72, ZZZ"
-, update =	"98.11 bibrelex, 95.01 smid, 94.09 jones"
+, author =      "C. Iwamoto and G. T. Toussaint"
+, title =       "Finding {Hamiltonian} Circuits in Arrangements of {Jordan} Curves is {NP}-Complete"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "93--98"
+, cites =       "ans-nchcp-80, c-hc-85, egt-cal-92, egt-eal-93, gjt-phcpn-76, g-hcppc-82, lw-ehppn-93, or-cswvg-91, r-cscsl-87, rit-cscsl-90, t-tpg-56, w-tg-31, k-racpc-72, ZZZ"
+, update =      "98.11 bibrelex, 95.01 smid, 94.09 jones"
 }
 
 @article{it-fhcaj-94a
-, author =	"C. Iwamoto and G. T. Toussaint"
-, title =	"Finding {Hamiltonian} Circuits in Arrangements of {Jordan} Curves is {NP}-Complete"
-, journal =	"Inform. Process. Lett."
-, volume =	52
-, year =	1994
-, pages =	"183--189"
-, update =	"95.01 smid"
+, author =      "C. Iwamoto and G. T. Toussaint"
+, title =       "Finding {Hamiltonian} Circuits in Arrangements of {Jordan} Curves is {NP}-Complete"
+, journal =     "Inform. Process. Lett."
+, volume =      52
+, year =        1994
+, pages =       "183--189"
+, update =      "95.01 smid"
 }
 
 @article{i-smdnc-91
-, author =	"K. Iwano"
-, title =	"Strong {Minkowski} decomposition is {NP}-complete"
-, journal =	"IEICE Trans."
-, volume =	"E74"
-, number =	4
-, year =	1991
-, pages =	"653--656"
-, update =	"96.05 ramkumar"
+, author =      "K. Iwano"
+, title =       "Strong {Minkowski} decomposition is {NP}-complete"
+, journal =     "IEICE Trans."
+, volume =      "E74"
+, number =      4
+, year =        1991
+, pages =       "653--656"
+, update =      "96.05 ramkumar"
 }
 
 @inproceedings{irt-tcpaa-94
-, author =	"K. Iwano and P. Raghavan and H. Tamaki"
-, title =	"The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"29--37"
-, update =	"98.03 mitchell+smid, 96.05 mitchell"
+, author =      "K. Iwano and P. Raghavan and H. Tamaki"
+, title =       "The Traveling Cameraman Problem, with Applications to Automatic Optical Inspection"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "29--37"
+, update =      "98.03 mitchell+smid, 96.05 mitchell"
 }
 
 @article{is-scpzs-90
-, author =	"K. Iwano and K. Steiglitz"
-, title =	"A semiring on convex polygons and zero-sum cycle problems"
-, journal =	"SIAM J. Comput."
-, volume =	19
-, year =	1990
-, pages =	"883--901"
+, author =      "K. Iwano and K. Steiglitz"
+, title =       "A semiring on convex polygons and zero-sum cycle problems"
+, journal =     "SIAM J. Comput."
+, volume =      19
+, year =        1990
+, pages =       "883--901"
 }
 
 @phdthesis{i-acsdp-90
-, author =	"S. Iwanowski"
-, title =	"Approximate congruence and symmetry detection in the plane"
-, type =	"Ph.{D}. Thesis"
-, school =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, year =	1990
-, keywords =	"doctoral thesis"
+, author =      "S. Iwanowski"
+, title =       "Approximate congruence and symmetry detection in the plane"
+, type =        "Ph.{D}. Thesis"
+, school =      "Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, year =        1990
+, keywords =    "doctoral thesis"
 }
 
 @inproceedings{i-ltata-89
-, author =	"S. Iwanowski"
-, title =	"Linear Time Algorithms for Testing Approximate Congruence in the Plane"
-, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	344
-, year =	1989
-, pages =	"213--228"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Iwanowski"
+, title =       "Linear Time Algorithms for Testing Approximate Congruence in the Plane"
+, booktitle =   "Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      344
+, year =        1989
+, pages =       "213--228"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{i-taspi-89
-, author =	"S. Iwanowski"
-, title =	"Testing approximate symmetry in the plane is {$NP$}-hard"
-, booktitle =	"Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, publisher =	"Springer-Verlag"
-, year =	1989
-, update =	"96.05 agarwal, 93.09 milone+mitchell"
+, author =      "S. Iwanowski"
+, title =       "Testing approximate symmetry in the plane is {$NP$}-hard"
+, booktitle =   "Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, publisher =   "Springer-Verlag"
+, year =        1989
+, update =      "96.05 agarwal, 93.09 milone+mitchell"
 }
 
 @article{i-taspn-91
-, author =	"S. Iwanowski"
-, title =	"Testing Approximate Symmetry in the Plane is {NP}-Hard"
-, journal =	"Theoret. Comput. Sci."
-, volume =	80
-, year =	1991
-, pages =	"227--262"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Iwanowski"
+, title =       "Testing Approximate Symmetry in the Plane is {NP}-Hard"
+, journal =     "Theoret. Comput. Sci."
+, volume =      80
+, year =        1991
+, pages =       "227--262"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{iti-ieesu-92
-, author =	"M. Iwata and J. Tanida and Y. Ichioka"
-, title =	"Inference engine for expert system by using optical array logic"
-, journal =	"Appl. Optics"
-, volume =	31
-, number =	26
-, year =	1992
-, pages =	"5604--5613"
-, update =	"98.03 bibrelex"
+, author =      "M. Iwata and J. Tanida and Y. Ichioka"
+, title =       "Inference engine for expert system by using optical array logic"
+, journal =     "Appl. Optics"
+, volume =      31
+, number =      26
+, year =        1992
+, pages =       "5604--5613"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{it-cbtcc-95
-, author =	"M. Iwayama and T. Tokunaga"
-, title =	"Cluster-Based Text Categorization: {A} Comparison of Category Search Strategies"
-, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
-, year =	1995
-, pages =	"273--280"
-, update =	"98.07 agarwal"
+, author =      "M. Iwayama and T. Tokunaga"
+, title =       "Cluster-Based Text Categorization: {A} Comparison of Category Search Strategies"
+, booktitle =   "Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
+, year =        1995
+, pages =       "273--280"
+, update =      "98.07 agarwal"
 }
 
 @book{ik-edm-68
-, author =	"S. Iyanaga and Y. Kawada"
-, title =	"Encyclopedic Dictionary of Mathematics"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1968
+, author =      "S. Iyanaga and Y. Kawada"
+, title =       "Encyclopedic Dictionary of Mathematics"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1968
 }
 
 @book{ie-amrpm-91
-, title =	"Autonomous Mobile Robots: Perception, Mapping, and Navigation"
-, editor =	"S. Sitharama Iyengar and Alberto Elfes"
-, publisher =	"IEEE Computer Society Press"
-, address =	"Los Alamitos, CA"
-, year =	1991
-, pages =	"408--427"
+, title =       "Autonomous Mobile Robots: Perception, Mapping, and Navigation"
+, editor =      "S. Sitharama Iyengar and Alberto Elfes"
+, publisher =   "IEEE Computer Society Press"
+, address =     "Los Alamitos, CA"
+, year =        1991
+, pages =       "408--427"
 }
 
 @article{ijrw-rnaul-86
-, author =	"S. S. Iyengar and C. C. Jorgensen and S. V. N. Rao and C. R. Weisbin"
-, title =	"Robot Navigation Algorithms Using Learned Spatial Graphs"
-, journal =	"Robotica"
-, volume =	4
-, year =	1986
-, pages =	"93--100"
+, author =      "S. S. Iyengar and C. C. Jorgensen and S. V. N. Rao and C. R. Weisbin"
+, title =       "Robot Navigation Algorithms Using Learned Spatial Graphs"
+, journal =     "Robotica"
+, volume =      4
+, year =        1986
+, pages =       "93--100"
 }
 
 @inproceedings{i-favdc-88
-, author =	"David Izraelevitz"
-, title =	"Fast Algorithm For {Voronoi} Diagram Calculation Based On Distance Doubling"
-, booktitle =	"Proceedings: The 2nd Symposium on the Frontiers of Massively Parallel Computations"
-, publisher =	"IEEE"
-, address =	"IEEE Service Center, Piscataway, NJ"
-, year =	1988
-, pages =	"173--176"
-, keywords =	"Voronoi diagrams, fine-grain parallel computers"
-, annote =	"Discrete VD on parallel machine."
-, abstract =	"An efficient algorithm is described for calculation of
-		 the Voronoi diagram over one- and two-dimensional
-		 lattices. The algorithm proceeds by propagating the
-		 location of Voronoi points through the lattice using a
-		 distance-doubling strategy. This algorithm is designed
-		 for implementation on a fine-grain parallel computer
-		 such as the connection machine. It is shown how the
-		 algorithm is extended to calculation of
-		 distance-from-region computations and the use of
-		 nonstandard metrics. Two algorithms are presented for
-		 the calculation of the Voronoi diagram over one- and
-		 two- dimensional lattices. Both algorithms propagate
-		 the explicit location of the nearest Voronoi point
-		 rather than the distance to the point and so are more
-		 accurate than traditional methods. The first algorithm
-		 is based on brushfire propagation while the second
-		 algorithm relies on distance doubling. It is found that
-		 the distance-doubling algorithm is more efficient than
-		 the classical algorithm when at least one Voronoi
-		 polygon is large. It is found that there is little
-		 penalty in using the updated brushfire algorithm over
-		 the traditional algorithm. 6 Refs."
+, author =      "David Izraelevitz"
+, title =       "Fast Algorithm For {Voronoi} Diagram Calculation Based On Distance Doubling"
+, booktitle =   "Proceedings: The 2nd Symposium on the Frontiers of Massively Parallel Computations"
+, publisher =   "IEEE"
+, address =     "IEEE Service Center, Piscataway, NJ"
+, year =        1988
+, pages =       "173--176"
+, keywords =    "Voronoi diagrams, fine-grain parallel computers"
+, annote =      "Discrete VD on parallel machine."
+, abstract =    "An efficient algorithm is described for calculation of
+                 the Voronoi diagram over one- and two-dimensional
+                 lattices. The algorithm proceeds by propagating the
+                 location of Voronoi points through the lattice using a
+                 distance-doubling strategy. This algorithm is designed
+                 for implementation on a fine-grain parallel computer
+                 such as the connection machine. It is shown how the
+                 algorithm is extended to calculation of
+                 distance-from-region computations and the use of
+                 nonstandard metrics. Two algorithms are presented for
+                 the calculation of the Voronoi diagram over one- and
+                 two- dimensional lattices. Both algorithms propagate
+                 the explicit location of the nearest Voronoi point
+                 rather than the distance to the point and so are more
+                 accurate than traditional methods. The first algorithm
+                 is based on brushfire propagation while the second
+                 algorithm relies on distance doubling. It is found that
+                 the distance-doubling algorithm is more efficient than
+                 the classical algorithm when at least one Voronoi
+                 polygon is large. It is found that there is little
+                 penalty in using the updated brushfire algorithm over
+                 the traditional algorithm. 6 Refs."
 }
 
 @article{jmr-drafm-98
-, author =	"T. Jabbour and C. Mascle and R. Maranzana"
-, title =	"A Database for the Representation of Assembly Features in Mechanical Products"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"483--509"
-, update =	"98.11 devillers"
+, author =      "T. Jabbour and C. Mascle and R. Maranzana"
+, title =       "A Database for the Representation of Assembly Features in Mechanical Products"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "483--509"
+, update =      "98.11 devillers"
 }
 
 @article{jg-gtmag-89
-, author =	"D. Jablonowsky and V. A. Guarna"
-, title =	"{GMB}: {A} Tool for Manipulating and Animating Graph Data Structures"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	19
-, number =	3
-, year =	1989
-, pages =	"283--301"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. Jablonowsky and V. A. Guarna"
+, title =       "{GMB}: {A} Tool for Manipulating and Animating Graph Data Structures"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      19
+, number =      3
+, year =        1989
+, pages =       "283--301"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{jt-ottur-80
-, author =	"C. Jackins and S. L. Tanimoto"
-, title =	"Oct-trees and their use in representing $3$-d objects"
-, journal =	"Comput. Graph. Image Process."
-, volume =	14
-, year =	1980
-, pages =	"249--270"
+, author =      "C. Jackins and S. L. Tanimoto"
+, title =       "Oct-trees and their use in representing $3$-d objects"
+, journal =     "Comput. Graph. Image Process."
+, volume =      14
+, year =        1980
+, pages =       "249--270"
 }
 
 @mastersthesis{j-cmtdo-79
-, author =	"C. L. Jackins"
-, title =	"Computer Modeling of three-dimensional objects using oct-trees"
-, school =	"Univ. Washington"
-, address =	"Seattle, WA"
-, year =	1979
-, keywords =	"master thesis"
-, update =	"97.11 bibrelex"
+, author =      "C. L. Jackins"
+, title =       "Computer Modeling of three-dimensional objects using oct-trees"
+, school =      "Univ. Washington"
+, address =     "Seattle, WA"
+, year =        1979
+, keywords =    "master thesis"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{jt-otur3-82
-, author =	"C. L. Jackins and S. L. Tanimoto"
-, title =	"Octrees and their use in representing $3$-d objects"
-, type =	"Technical {Report}"
-, number =	"82-02-02"
-, institution =	"Dept. Comput. Sci., Univ. Washington"
-, address =	"Seattle, WA"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "C. L. Jackins and S. L. Tanimoto"
+, title =       "Octrees and their use in representing $3$-d objects"
+, type =        "Technical {Report}"
+, number =      "82-02-02"
+, institution = "Dept. Comput. Sci., Univ. Washington"
+, address =     "Seattle, WA"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{jw-opr-96
-, author =	"L. Jackson and S. K. Wismath"
-, title =	"Orthogonal polygon reconstruction"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"44--49"
-, update =	"96.09 mitchell"
+, author =      "L. Jackson and S. K. Wismath"
+, title =       "Orthogonal polygon reconstruction"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "44--49"
+, update =      "96.09 mitchell"
 }
 
 @inproceedings{j-euimp-89
-, author =	"R. Jacob"
-, title =	"Emerging user-interface media: potentials and challenges - eye tracking"
-, booktitle =	"Tutorial SIGGRAPH '89"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "R. Jacob"
+, title =       "Emerging user-interface media: potentials and challenges - eye tracking"
+, booktitle =   "Tutorial SIGGRAPH '89"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @article{j-dfaed-41
-, author =	"C. G. J. Jacobi"
-, title =	"De functionibus alternatibus earumque divisione per productum e differentiis elementorum conflatum"
-, journal =	"J. Reine Angew. Math."
-, volume =	22
-, year =	1841
-, pages =	"360--371"
-, update =	"97.11 bibrelex"
+, author =      "C. G. J. Jacobi"
+, title =       "De functionibus alternatibus earumque divisione per productum e differentiis elementorum conflatum"
+, journal =     "J. Reine Angew. Math."
+, volume =      22
+, year =        1841
+, pages =       "360--371"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{j-mlccp-90
-, author =	"P. Jacobs"
-, title =	"Minimal Length Curvature Constrained Paths in the Presence of Obstacles"
-, type =	"Research {Report}"
-, number =	90042
-, institution =	"LAAS"
-, address =	"7, av du colonel-Roche 31077 Toulouse Cedex"
-, year =	1990
-, update =	"95.01 devillers"
+, author =      "P. Jacobs"
+, title =       "Minimal Length Curvature Constrained Paths in the Presence of Obstacles"
+, type =        "Research {Report}"
+, number =      90042
+, institution = "LAAS"
+, address =     "7, av du colonel-Roche 31077 Toulouse Cedex"
+, year =        1990
+, update =      "95.01 devillers"
 }
 
 @inproceedings{jc-pspmr-89
-, author =	"P. Jacobs and J. Canny"
-, title =	"Planning Smooth Paths for Mobile Robots"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1989
-, pages =	"2--7"
-, precedes =	"jc-pspmr-92"
-, update =	"98.03 mitchell"
+, author =      "P. Jacobs and J. Canny"
+, title =       "Planning Smooth Paths for Mobile Robots"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1989
+, pages =       "2--7"
+, precedes =    "jc-pspmr-92"
+, update =      "98.03 mitchell"
 }
 
 @incollection{jc-pspmr-92
-, author =	"P. Jacobs and J. Canny"
-, title =	"Planning Smooth Paths for Mobile Robots"
-, editor =	"Z. Li and J. F. Canny"
-, booktitle =	"Nonholonomic Motion Planning"
-, publisher =	"Kluwer Academic Pubishers"
-, address =	"Norwell, MA"
-, year =	1992
-, pages =	"271--342"
-, succeeds =	"jc-pspmr-89"
-, update =	"98.03 mitchell"
+, author =      "P. Jacobs and J. Canny"
+, title =       "Planning Smooth Paths for Mobile Robots"
+, editor =      "Z. Li and J. F. Canny"
+, booktitle =   "Nonholonomic Motion Planning"
+, publisher =   "Kluwer Academic Pubishers"
+, address =     "Norwell, MA"
+, year =        1992
+, pages =       "271--342"
+, succeeds =    "jc-pspmr-89"
+, update =      "98.03 mitchell"
 }
 
 @techreport{jhcp-pgnto-89
-, author =	"P. Jacobs and G. Heinzinger and J. Canny and B. Paden"
-, title =	"Planning Guaranteed Near-Time-Optimal Trajectories for a Manipulator in a Cluttered Workspace"
-, type =	"Technical {Report}"
-, number =	"ESRC 89-20/RAMP 89-15"
-, institution =	"Engineering Systems Research Center, Univ. California"
-, address =	"Berkeley, CA"
-, month =	oct
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "P. Jacobs and G. Heinzinger and J. Canny and B. Paden"
+, title =       "Planning Guaranteed Near-Time-Optimal Trajectories for a Manipulator in a Cluttered Workspace"
+, type =        "Technical {Report}"
+, number =      "ESRC 89-20/RAMP 89-15"
+, institution = "Engineering Systems Research Center, Univ. California"
+, address =     "Berkeley, CA"
+, month =       oct
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{jhcp-pgnto-89i
-, author =	"P. Jacobs and G. Heinzinger and J. Canny and B. Paden"
-, title =	"Planning Guaranteed Near-Time-Optimal Trajectories in a Cluttered Workspace"
-, booktitle =	"Internat. Workshop on Sensorial Integration for Industrial Robots: Architectures and Applications"
-, site =	"Zaragoza, Spain"
-, month =	nov
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "P. Jacobs and G. Heinzinger and J. Canny and B. Paden"
+, title =       "Planning Guaranteed Near-Time-Optimal Trajectories in a Cluttered Workspace"
+, booktitle =   "Internat. Workshop on Sensorial Integration for Industrial Robots: Architectures and Applications"
+, site =        "Zaragoza, Spain"
+, month =       nov
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{jlt-empnm-91
-, author =	"P. Jacobs and J.-P. Laumond and M. Taix"
-, title =	"Efficient motion planners for nonholonomic mobile robots"
-, booktitle =	"Proc. IEEE/RSJ Internat. Workshop Intell. Robots Syst."
-, year =	1991
-, pages =	"1229--1235"
-, update =	"97.11 bibrelex"
+, author =      "P. Jacobs and J.-P. Laumond and M. Taix"
+, title =       "Efficient motion planners for nonholonomic mobile robots"
+, booktitle =   "Proc. IEEE/RSJ Internat. Workshop Intell. Robots Syst."
+, year =        1991
+, pages =       "1229--1235"
+, update =      "97.11 bibrelex"
 }
 
 @book{j-ba1-74
-, author =	"N. Jacobson"
-, title =	"Basic Algebra {I}"
-, publisher =	"W. H. Freeman"
-, address =	"San Francisco, CA"
-, year =	1974
-, precedes =	"j-ba1-85"
-, update =	"98.07 bibrelex, 98.03 bibrelex"
+, author =      "N. Jacobson"
+, title =       "Basic Algebra {I}"
+, publisher =   "W. H. Freeman"
+, address =     "San Francisco, CA"
+, year =        1974
+, precedes =    "j-ba1-85"
+, update =      "98.07 bibrelex, 98.03 bibrelex"
 }
 
 @book{j-ba1-85
-, author =	"N. Jacobson"
-, title =	"Basic algebra {I}"
-, edition =	"2nd"
-, publisher =	"W. H. Freeman"
-, address =	"New York, NY"
-, year =	1985
-, succeeds =	"j-ba1-74"
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "N. Jacobson"
+, title =       "Basic algebra {I}"
+, edition =     "2nd"
+, publisher =   "W. H. Freeman"
+, address =     "New York, NY"
+, year =        1985
+, succeeds =    "j-ba1-74"
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @techreport{j-guapd-92
-, author =	"W. R. Jacometti"
-, title =	"GeoLab - um ambiente para desenvolvimento de algoritmos em geometria computacional"
-, number =	"DCC-IMECC-UNICAMP"
-, institution =	"Departamento de Ci{\^e}ncia da Computa{\c c}{\~a}o, Universidade Estadual de Campinas"
-, address =	"Campinas, Brazil"
-, year =	1992
-, keywords =	"master thesis"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "W. R. Jacometti"
+, title =       "GeoLab - um ambiente para desenvolvimento de algoritmos em geometria computacional"
+, number =      "DCC-IMECC-UNICAMP"
+, institution = "Departamento de Ci{\^e}ncia da Computa{\c c}{\~a}o, Universidade Estadual de Campinas"
+, address =     "Campinas, Brazil"
+, year =        1992
+, keywords =    "master thesis"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @techreport{j-acaqt-80
-, author =	"K. J. Jacquemin"
-, title =	"Average case analysis of quad-trees"
-, type =	"Report"
-, number =	8003
-, institution =	"Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
-, address =	"Aachen, West Germany"
-, year =	1980
+, author =      "K. J. Jacquemin"
+, title =       "Average case analysis of quad-trees"
+, type =        "Report"
+, number =      8003
+, institution = "Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
+, address =     "Aachen, West Germany"
+, year =        1980
 }
 
 @techreport{j-eduaf-82
-, author =	"K. J. Jacquemin"
-, title =	"Effiziente {Datenstrukturen} und {Algorithmen} f{\"u}r ausgew{\"a}hlte mehrdimensionale {Suchprobleme}"
-, type =	"Manuscript"
-, institution =	"Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
-, address =	"Aachen, West Germany"
-, year =	1982
+, author =      "K. J. Jacquemin"
+, title =       "Effiziente {Datenstrukturen} und {Algorithmen} f{\"u}r ausgew{\"a}hlte mehrdimensionale {Suchprobleme}"
+, type =        "Manuscript"
+, institution = "Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
+, address =     "Aachen, West Germany"
+, year =        1982
 }
 
 @techreport{j-lubac-80
-, author =	"K. J. Jacquemin"
-, title =	"Lower and upper bounds for the average case complexity of quad-trees of arbitrary dimension"
-, type =	"Report"
-, number =	9011
-, institution =	"Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
-, address =	"Aachen, West Germany"
-, year =	1980
+, author =      "K. J. Jacquemin"
+, title =       "Lower and upper bounds for the average case complexity of quad-trees of arbitrary dimension"
+, type =        "Report"
+, number =      9011
+, institution = "Lehrstuhl Inform. III, Rheinisch-Westf{\"a}lischen Tech. Hochschule Aachen"
+, address =     "Aachen, West Germany"
+, year =        1980
 }
 
 @incollection{j-cegt-70
-, author =	"A. Jacques"
-, title =	"Constellations et Graphes Topologiques"
-, booktitle =	"Combinatorial Theory and Applications"
-, series =	"Colloquia Mathematica Societatis J{\'a}nos Bolyai"
-, publisher =	"??"
-, address =	"Budapest"
-, year =	1970
-, pages =	"657--672"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "A. Jacques"
+, title =       "Constellations et Graphes Topologiques"
+, booktitle =   "Combinatorial Theory and Applications"
+, series =      "Colloquia Mathematica Societatis J{\'a}nos Bolyai"
+, publisher =   "??"
+, address =     "Budapest"
+, year =        1970
+, pages =       "657--672"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{jm-ccfps-93
-, author =	"S. Jadhav and A. Mukhopadhyay"
-, title =	"Computing a centerpoint of a finite planar set of points in linear time"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"83--90"
-, cites =	"c-sdsno-87, csy-khrp-87, e-acg-87, ls-otahs-90, m-aogdc-91, m-apcad-83, m-ltalp-83, m-ptlp-85, yb-cf-61, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "S. Jadhav and A. Mukhopadhyay"
+, title =       "Computing a centerpoint of a finite planar set of points in linear time"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "83--90"
+, cites =       "c-sdsno-87, csy-khrp-87, e-acg-87, ls-otahs-90, m-aogdc-91, m-apcad-83, m-ltalp-83, m-ptlp-85, yb-cf-61, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{jm-ccfps-94
-, author =	"S. Jadhav and A. Mukhopadhyay"
-, title =	"Computing a centerpoint of a finite planar set of points in linear time"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"291--312"
-, update =	"95.01 smid"
+, author =      "S. Jadhav and A. Mukhopadhyay"
+, title =       "Computing a centerpoint of a finite planar set of points in linear time"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "291--312"
+, update =      "95.01 smid"
 }
 
 @inproceedings{jmb-oairs-92
-, author =	"S. Jadhav and A. Mukhopadhyay and B. K. Bhattacharya"
-, title =	"An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons"
-, booktitle =	"Proc. 12th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, site =	"New Delhi, India"
-, year =	1992
-, update =	"98.07 agarwal, 93.09 milone+mitchell"
+, author =      "S. Jadhav and A. Mukhopadhyay and B. K. Bhattacharya"
+, title =       "An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons"
+, booktitle =   "Proc. 12th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, site =        "New Delhi, India"
+, year =        1992
+, update =      "98.07 agarwal, 93.09 milone+mitchell"
 }
 
 @article{jmb-oairs-96
-, author =	"S. Jadhav and A. Mukhopadhyay and B. K. Bhattacharya"
-, title =	"An optimal algorithm for the intersection radius of a set of convex polygons"
-, journal =	"J. Algorithms"
-, volume =	20
-, year =	1996
-, pages =	"244--267"
-, keywords =	"prune and search, optimization"
-, update =	"98.07 agarwal, 96.05 agarwal+smid"
+, author =      "S. Jadhav and A. Mukhopadhyay and B. K. Bhattacharya"
+, title =       "An optimal algorithm for the intersection radius of a set of convex polygons"
+, journal =     "J. Algorithms"
+, volume =      20
+, year =        1996
+, pages =       "244--267"
+, keywords =    "prune and search, optimization"
+, update =      "98.07 agarwal, 96.05 agarwal+smid"
 }
 
 @inproceedings{jmm-sbq-95
-, author =	"H. V. Jagadish and A. O. Mendelzon and T. Milo"
-, title =	"Similarity-based queries"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Principles Database Syst."
-, nickname =	"PODS '95"
-, year =	1995
-, pages =	"36--45"
-, update =	"98.07 bibrelex"
+, author =      "H. V. Jagadish and A. O. Mendelzon and T. Milo"
+, title =       "Similarity-based queries"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Principles Database Syst."
+, nickname =    "PODS '95"
+, year =        1995
+, pages =       "36--45"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{j-lcoma-90
-, author =	"H. V. Jagdish"
-, title =	"Linear clustering of objects with multiple attributes"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1990
-, pages =	"332--342"
-, update =	"97.07 agarwal"
+, author =      "H. V. Jagdish"
+, title =       "Linear clustering of objects with multiple attributes"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1990
+, pages =       "332--342"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{j-oils-90
-, author =	"H. V. Jagdish"
-, title =	"On indexing line segments"
-, booktitle =	"Proc. 16th VLDB Conference"
-, year =	1990
-, pages =	"614--625"
-, update =	"97.07 agarwal"
+, author =      "H. V. Jagdish"
+, title =       "On indexing line segments"
+, booktitle =   "Proc. 16th VLDB Conference"
+, year =        1990
+, pages =       "614--625"
+, update =      "97.07 agarwal"
 }
 
 @article{jmsw-uomwi-89
-, author =	"B. Jaggi and P. Mani-Levitska and B. Sturmfels and N. White"
-, title =	"Uniform oriented matroids without the isotopy property"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"97--100"
+, author =      "B. Jaggi and P. Mani-Levitska and B. Sturmfels and N. White"
+, title =       "Uniform oriented matroids without the isotopy property"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "97--100"
 }
 
 @article{j-ehdim-90
-, author =	"K.-U. Jahn"
-, title =	"Evaluation of {Hausdorff} distances in interval mathematics"
-, journal =	"Computing"
-, volume =	45
-, year =	1990
-, pages =	"69--77"
-, update =	"97.03 rote"
+, author =      "K.-U. Jahn"
+, title =       "Evaluation of {Hausdorff} distances in interval mathematics"
+, journal =     "Computing"
+, volume =      45
+, year =        1990
+, pages =       "69--77"
+, update =      "97.03 rote"
 }
 
 @inproceedings{jsv-pbsss-97
-, author =	"Fabrice Jaillet and Behzad Shariat and Denis Vandorpe"
-, title =	"Periodic {B}--Spline Surface Skinning Of Anatomic Shapes"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"199--204"
-, update =	"97.11 jones"
+, author =      "Fabrice Jaillet and Behzad Shariat and Denis Vandorpe"
+, title =       "Periodic {B}--Spline Surface Skinning Of Anatomic Shapes"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "199--204"
+, update =      "97.11 jones"
 }
 
 @unpublished{j-leair-93
-, author =	"P. Jaillon"
-, title =	"{LEA}, a lazy exact arithmetic: Implementation and related problems"
-, year =	1993
-, note =	"Technical Report in preparation, {\'E}cole Nationale Sup{\'e}rieure des Mines de Saint-{\'E}tienne"
-, update =	"98.11 bibrelex"
+, author =      "P. Jaillon"
+, title =       "{LEA}, a lazy exact arithmetic: Implementation and related problems"
+, year =        1993
+, note =        "Technical Report in preparation, {\'E}cole Nationale Sup{\'e}rieure des Mines de Saint-{\'E}tienne"
+, update =      "98.11 bibrelex"
 }
 
 @book{jd-acd-88
-, author =	"A. K. Jain and R. C. Dubes"
-, title =	"Algorithms for Clustering Data"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1988
-, update =	"98.07 agarwal"
+, author =      "A. K. Jain and R. C. Dubes"
+, title =       "Algorithms for Clustering Data"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1988
+, update =      "98.07 agarwal"
 }
 
 @book{j-ipa-92
-, author =	"J. J\'aJ\'a"
-, title =	"An Introduction to Parallel Algorithms"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, Mass."
-, year =	1992
-, update =	"96.09 orourke"
+, author =      "J. J\'aJ\'a"
+, title =       "An Introduction to Parallel Algorithms"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, Mass."
+, year =        1992
+, update =      "96.09 orourke"
 }
 
 @article{js-pagtp-82
-, author =	"J. Ja'Ja' and J. Simon"
-, title =	"Parallel Algorithms in Graph Theory: Planarity Testing"
-, journal =	"SIAM J. Comput."
-, volume =	11
-, number =	2
-, year =	1982
-, pages =	"314--328"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Ja'Ja' and J. Simon"
+, title =       "Parallel Algorithms in Graph Theory: Planarity Testing"
+, journal =     "SIAM J. Comput."
+, volume =      11
+, number =      2
+, year =        1982
+, pages =       "314--328"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{jd-hfdt-99
-, author =	"A. James and A. M. Day"
-, title =	"The Hidden Face Determination Tree"
-, journal =	"Comput. \& Graphics"
-, volume =	23
-, number =	3
-, month =	jun
-, year =	1999
-, pages =	"377--387"
-, update =	"00.03 held"
+, author =      "A. James and A. M. Day"
+, title =       "The Hidden Face Determination Tree"
+, journal =     "Comput. \& Graphics"
+, volume =      23
+, number =      3
+, month =       jun
+, year =        1999
+, pages =       "377--387"
+, update =      "00.03 held"
 }
 
 @inproceedings{jb-iaem-87
-, author =	"A. Jameson and T. Baker"
-, title =	"Improvements to the aircraft {Euler} method"
-, booktitle =	"AIAA 25th Aerospace Science Meeting"
-, year =	1987
-, note =	"Paper AIAA-87-0452"
-, update =	"98.03 bibrelex"
+, author =      "A. Jameson and T. Baker"
+, title =       "Improvements to the aircraft {Euler} method"
+, booktitle =   "AIAA 25th Aerospace Science Meeting"
+, year =        1987
+, note =        "Paper AIAA-87-0452"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{j-atag-85
-, author =	"J. Jameson"
-, title =	"Analytic techniques for automated grasp"
-, school =	"Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "J. Jameson"
+, title =       "Analytic techniques for automated grasp"
+, school =      "Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @article{j-dt-87
-, author =	"R. E. Jamison"
-, title =	"Direction trees"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"249--254"
+, author =      "R. E. Jamison"
+, title =       "Direction trees"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "249--254"
 }
 
 @inproceedings{j-pacca-82
-, author =	"R. E. Jamison-Waldner"
-, title =	"A perspective of abstract convexity: classifying alignments by varieties"
-, editor =	"D. C. Kay and M. Breen"
-, booktitle =	"Convexity and Related Combinatorial Geometry, Proc. 2nd University of Oklahoma Conference"
-, series =	"Lecture Notes in Pure and Applied Mathematics"
-, volume =	76
-, publisher =	"Marcel Dekker, Inc."
-, year =	1982
-, pages =	"113--150"
-, update =	"98.07 bibrelex"
+, author =      "R. E. Jamison-Waldner"
+, title =       "A perspective of abstract convexity: classifying alignments by varieties"
+, editor =      "D. C. Kay and M. Breen"
+, booktitle =   "Convexity and Related Combinatorial Geometry, Proc. 2nd University of Oklahoma Conference"
+, series =      "Lecture Notes in Pure and Applied Mathematics"
+, volume =      76
+, publisher =   "Marcel Dekker, Inc."
+, year =        1982
+, pages =       "113--150"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{jp-wcp-93t
-, author =	"R. Janaardan and F. P. Preparata"
-, title =	"Widest-corridor problemes"
-, type =	"Technical Report"
-, number =	"TR-93-17"
-, institution =	"Dept. of Computer Science, University of Minnesota"
-, address =	"Twin Cities"
-, month =	may
-, year =	1993
-, precedes =	"jp-wcp-93, jp-wcp-94"
-, update =	"98.11 bibrelex"
+, author =      "R. Janaardan and F. P. Preparata"
+, title =       "Widest-corridor problemes"
+, type =        "Technical Report"
+, number =      "TR-93-17"
+, institution = "Dept. of Computer Science, University of Minnesota"
+, address =     "Twin Cities"
+, month =       may
+, year =        1993
+, precedes =    "jp-wcp-93, jp-wcp-94"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{j-mwdpp-91
-, author =	"R. Janardan"
-, title =	"On maintaining the width and diameter of a planar point-set online"
-, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"137--149"
-, precedes =	"j-mwdpp-93, j-mwdpp-93"
-, update =	"96.09 devillers, 95.01 smid"
+, author =      "R. Janardan"
+, title =       "On maintaining the width and diameter of a planar point-set online"
+, booktitle =   "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "137--149"
+, precedes =    "j-mwdpp-93, j-mwdpp-93"
+, update =      "96.09 devillers, 95.01 smid"
 }
 
 @article{j-mwdpp-93
-, author =	"R. Janardan"
-, title =	"On maintaining the width and diameter of a planar point-set online"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"331--344"
-, keywords =	"diameter, duality, dynamization, width"
-, succeeds =	"j-mwdpp-91"
-, update =	"96.09 devillers, 95.01 smid"
+, author =      "R. Janardan"
+, title =       "On maintaining the width and diameter of a planar point-set online"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "331--344"
+, keywords =    "diameter, duality, dynamization, width"
+, succeeds =    "j-mwdpp-91"
+, update =      "96.09 devillers, 95.01 smid"
 }
 
 @article{j-dmmpp-91
-, author =	"R. Janardan"
-, title =	"On the dynamic maintenance of maximal points in the plane"
-, journal =	"Inform. Process. Lett."
-, volume =	40
-, year =	1991
-, pages =	"59--64"
-, update =	"95.01 smid"
+, author =      "R. Janardan"
+, title =       "On the dynamic maintenance of maximal points in the plane"
+, journal =     "Inform. Process. Lett."
+, volume =      40
+, year =        1991
+, pages =       "59--64"
+, update =      "95.01 smid"
 }
 
 @article{jl-gisp-93
-, author =	"R. Janardan and M. Lopez"
-, title =	"Generalized intersection searching problems"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"39--69"
-, update =	"95.01 smid"
+, author =      "R. Janardan and M. Lopez"
+, title =       "Generalized intersection searching problems"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "39--69"
+, update =      "95.01 smid"
 }
 
 @inproceedings{jp-wcp-93
-, author =	"R. Janardan and F. P. Preparata"
-, title =	"Widest-corridor problems"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"426--431"
-, succeeds =	"jp-wcp-93t"
-, cites =	"cd-kdcp-90, cgl-pgd-85, eg-tsa-89, egs-oplms-86, hm-fwecs-88, jp-wcp-93t, ps-cgi-85, t-sgprc-83, ZZZ"
-, update =	"01.11 devillers, 98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "R. Janardan and F. P. Preparata"
+, title =       "Widest-corridor problems"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "426--431"
+, succeeds =    "jp-wcp-93t"
+, cites =       "cd-kdcp-90, cgl-pgd-85, eg-tsa-89, egs-oplms-86, hm-fwecs-88, jp-wcp-93t, ps-cgi-85, t-sgprc-83, ZZZ"
+, update =      "01.11 devillers, 98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{jp-wcp-94
-, author =	"R. Janardan and F. P. Preparata"
-, title =	"Widest-corridor problems"
-, journal =	"Nordic J. Comput."
-, volume =	1
-, year =	1994
-, pages =	"231--245"
-, succeeds =	"jp-wcp-93t"
-, update =	"98.11 bibrelex, 95.01 smid"
+, author =      "R. Janardan and F. P. Preparata"
+, title =       "Widest-corridor problems"
+, journal =     "Nordic J. Comput."
+, volume =      1
+, year =        1994
+, pages =       "231--245"
+, succeeds =    "jp-wcp-93t"
+, update =      "98.11 bibrelex, 95.01 smid"
 }
 
 @incollection{jw-mp-97
-, author =	"R. Janardan and T. Woo"
-, title =	"Manufacturing processes"
-, chapter =	46
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"851--862"
-, update =	"97.11 orourke"
+, author =      "R. Janardan and T. Woo"
+, title =       "Manufacturing processes"
+, chapter =     46
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "851--862"
+, update =      "97.11 orourke"
 }
 
 @article{jl-rrt-92
-, author =	"E. Jansen and W. de Leeuw"
-, title =	"Recursive ray traversal"
-, journal =	"Ray Tracing News"
-, volume =	5
-, number =	1
-, year =	1992
-, url =	"nic.funet.fi:/pub/graphics/misc/RTNews"
-, update =	"98.07 bibrelex"
+, author =      "E. Jansen and W. de Leeuw"
+, title =       "Recursive ray traversal"
+, journal =     "Ray Tracing News"
+, volume =      5
+, number =      1
+, year =        1992
+, url = "nic.funet.fi:/pub/graphics/misc/RTNews"
+, update =      "98.07 bibrelex"
 }
 
 @article{j-dopct-91
-, author =	"F. W. Jansen"
-, title =	"Depth-Order Point Classification Techniques for {CSG} Display Algorithms"
-, journal =	"ACM Trans. Graph."
-, volume =	10
-, number =	1
-, year =	1991
-, pages =	"40--70"
-, update =	"93.09 goodrich"
+, author =      "F. W. Jansen"
+, title =       "Depth-Order Point Classification Techniques for {CSG} Display Algorithms"
+, journal =     "ACM Trans. Graph."
+, volume =      10
+, number =      1
+, year =        1991
+, pages =       "40--70"
+, update =      "93.09 goodrich"
 }
 
 @inproceedings{j-asbpc-98
-, author =	"Klaus Jansen"
-, title =	"An Approximation Scheme for Bin Packing with Conflicts"
-, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '98"
-, site =	"Stockholm"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1432
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"35--46"
-, update =	"99.03 bibrelex, 98.07 mitchell"
+, author =      "Klaus Jansen"
+, title =       "An Approximation Scheme for Bin Packing with Conflicts"
+, booktitle =   "Proc. 6th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '98"
+, site =        "Stockholm"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1432
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "35--46"
+, update =      "99.03 bibrelex, 98.07 mitchell"
 }
 
 @article{j-sammd-93
-, author =	"K. Jansen"
-, title =	"One strike against the min-max degree triangulation problem"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"107--120"
-, update =	"96.09 devillers"
+, author =      "K. Jansen"
+, title =       "One strike against the min-max degree triangulation problem"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "107--120"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{j-cmmdt-93
-, author =	"Klaus Jansen"
-, title =	"The complexity of the min-max degree triangulation problem"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"40--43"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Klaus Jansen"
+, title =       "The complexity of the min-max degree triangulation problem"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "40--43"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @article{jw-cdccp-93
-, author =	"K. Jansen and G. J. Woeginger"
-, title =	"The complexity of detecting crossingfree configurations in the plane"
-, journal =	"BIT"
-, volume =	33
-, number =	4
-, year =	1993
-, pages =	"580--595"
-, update =	"97.11 bibrelex"
+, author =      "K. Jansen and G. J. Woeginger"
+, title =       "The complexity of detecting crossingfree configurations in the plane"
+, journal =     "BIT"
+, volume =      33
+, number =      4
+, year =        1993
+, pages =       "580--595"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{jptw-sgas-90
-, author =	"V. Jansen and A. Potthoff and W. Thomas and U. Wermuth"
-, title =	"A Short Guide to the {AMORE} System"
-, number =	"90-2"
-, institution =	"Fachgruppe Informatik, RWTH Aachen"
-, year =	1990
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "V. Jansen and A. Potthoff and W. Thomas and U. Wermuth"
+, title =       "A Short Guide to the {AMORE} System"
+, number =      "90-2"
+, institution = "Fachgruppe Informatik, RWTH Aachen"
+, year =        1990
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{jkl-ebncl-98
-, author =	"H. Jaouni and M. Khatib and J.-P. Laumond"
-, title =	"Elastic Bands for Nonholonomic Car-Like Robots: {Algorithms} and Combinatorial Issues"
-, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
-, nickname =	"WAFR '98"
-, year =	1998
-, pages =	"to appear"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "H. Jaouni and M. Khatib and J.-P. Laumond"
+, title =       "Elastic Bands for Nonholonomic Car-Like Robots: {Algorithms} and Combinatorial Issues"
+, booktitle =   "Proc. 3rd Workshop Algorithmic Found. Robot."
+, nickname =    "WAFR '98"
+, year =        1998
+, pages =       "to appear"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @article{j-ugukk-25
-, author =	"V. Jarnik"
-, title =	"{\"U }ber {Gitterpunkte} und konvexe {Kurven}"
-, journal =	"Math. Zeitschrift"
-, volume =	24
-, year =	1925
-, pages =	"500--518"
-, update =	"97.11 bibrelex"
+, author =      "V. Jarnik"
+, title =       "{\"U }ber {Gitterpunkte} und konvexe {Kurven}"
+, journal =     "Math. Zeitschrift"
+, volume =      24
+, year =        1925
+, pages =       "500--518"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{j-actgr-89
-, author =	"J. W. Jaromczyk"
-, title =	"Algorithmic and combinatorial techniques for graphs in {$R^{d}$}"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	27
+, author =      "J. W. Jaromczyk"
+, title =       "Algorithmic and combinatorial techniques for graphs in {$R^{d}$}"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       27
 }
 
 @article{j-ldtat-81
-, author =	"J. W. Jaromczyk"
-, title =	"Linear decision trees are too weak for convex hull problem"
-, journal =	"Inform. Process. Lett."
-, volume =	12
-, year =	1981
-, pages =	"138--141"
+, author =      "J. W. Jaromczyk"
+, title =       "Linear decision trees are too weak for convex hull problem"
+, journal =     "Inform. Process. Lett."
+, volume =      12
+, year =        1981
+, pages =       "138--141"
 }
 
 @inproceedings{j-lbpst-84
-, author =	"J. W. Jaromczyk"
-, title =	"Lower Bounds for Polygon Simplicity Testing and Other Problems"
-, booktitle =	"Proc. Math. Found. of Computer Science '84"
-, publisher =	"Springer-Verlag"
-, year =	1984
-, pages =	"339--347"
-, update =	"93.09 held"
+, author =      "J. W. Jaromczyk"
+, title =       "Lower Bounds for Polygon Simplicity Testing and Other Problems"
+, booktitle =   "Proc. Math. Found. of Computer Science '84"
+, publisher =   "Springer-Verlag"
+, year =        1984
+, pages =       "339--347"
+, update =      "93.09 held"
 }
 
 @techreport{j-polbm-87
-, author =	"J. W. Jaromczyk"
-, title =	"Proof of {$\Omega(n \log n)$} lower bound for maximal gap problem using slicer transformation approach"
-, type =	"Report"
-, number =	"91-87"
-, institution =	"Dept. Comput. Sci., Univ. Kentucky"
-, address =	"Lexington, KY"
-, year =	1987
-, keywords =	"lower bounds"
+, author =      "J. W. Jaromczyk"
+, title =       "Proof of {$\Omega(n \log n)$} lower bound for maximal gap problem using slicer transformation approach"
+, type =        "Report"
+, number =      "91-87"
+, institution = "Dept. Comput. Sci., Univ. Kentucky"
+, address =     "Lexington, KY"
+, year =        1987
+, keywords =    "lower bounds"
 }
 
 @inproceedings{jk-gpcbn-95
-, author =	"Jerzy W. Jaromczyk and Miroslaw Kowaluk"
-, title =	"A Geometric Proof of the Combinatorial Bounds for the Number of Optimal Solutions to the $2$-Center {Euclidean} Problem"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"19--24"
-, update =	"95.09 jones"
+, author =      "Jerzy W. Jaromczyk and Miroslaw Kowaluk"
+, title =       "A Geometric Proof of the Combinatorial Bounds for the Number of Optimal Solutions to the $2$-Center {Euclidean} Problem"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "19--24"
+, update =      "95.09 jones"
 }
 
 @inproceedings{jk-nrng-87
-, author =	"J. W. Jaromczyk and M. Kowaluk"
-, title =	"A note on relative neighborhood graphs"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"233--241"
-, cites =	"e-acg-87, gf-iea-64, l-rtaa-69, lw-vdllm-80, l-tdvdl-80, s-rngam-83, t-egbnl-75, t-dsna-83, t-rngfp-80, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "J. W. Jaromczyk and M. Kowaluk"
+, title =       "A note on relative neighborhood graphs"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "233--241"
+, cites =       "e-acg-87, gf-iea-64, l-rtaa-69, lw-vdllm-80, l-tdvdl-80, s-rngam-83, t-egbnl-75, t-dsna-83, t-rngfp-80, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{jk-eaetc-94
-, author =	"J. W. Jaromczyk and M. Kowaluk"
-, title =	"An Efficient Algorithm for the {Euclidean} Two-Center Problem"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"303--311"
-, cites =	"as-pglp-90, d-ptctm-84, e-acg-87, f-nolnm-61, f-samlp-67, hm-lnta-79, hs-ftp-91, k-sades-91a, ks-ebago-93, m-ltalp-83, rt-em-57, s-qgs-57, sh-cpp-75, v-cbrdf-87, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "J. W. Jaromczyk and M. Kowaluk"
+, title =       "An Efficient Algorithm for the {Euclidean} Two-Center Problem"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "303--311"
+, cites =       "as-pglp-90, d-ptctm-84, e-acg-87, f-nolnm-61, f-samlp-67, hm-lnta-79, hs-ftp-91, k-sades-91a, ks-ebago-93, m-ltalp-83, rt-em-57, s-qgs-57, sh-cpp-75, v-cbrdf-87, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @inproceedings{jk-oicps-96
-, author =	"Jerzy W. Jaromczyk and Miroslaw Kowaluk"
-, title =	"Orientation Independent Covering of Point Sets in {$R^2$} with Pairs of Rectangles or Optimal Squares"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"77--84"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Jerzy W. Jaromczyk and Miroslaw Kowaluk"
+, title =       "Orientation Independent Covering of Point Sets in {$R^2$} with Pairs of Rectangles or Optimal Squares"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "77--84"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @techreport{jk-rngnn-87
-, author =	"J. W. Jaromczyk and M. Kowaluk"
-, title =	"Relative neighborhood graphs and nearest neighbor pairs in $d$-dimensional space with the metric {$L^{p}$}"
-, type =	"Report"
-, number =	"98-87"
-, institution =	"Dept. Comput. Sci., Univ. Kentucky"
-, address =	"Lexington, KY"
-, year =	1987
+, author =      "J. W. Jaromczyk and M. Kowaluk"
+, title =       "Relative neighborhood graphs and nearest neighbor pairs in $d$-dimensional space with the metric {$L^{p}$}"
+, type =        "Report"
+, number =      "98-87"
+, institution = "Dept. Comput. Sci., Univ. Kentucky"
+, address =     "Lexington, KY"
+, year =        1987
 }
 
 @inproceedings{jk-slcop-01
-, author =	"Jerzy W. Jaromczyk and Miroslaw Kowaluk"
-, title =	"Sets of Lines and Cutting Out Polyhedral Objects"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"183--186"
-, update =	"01.04 icking"
+, author =      "Jerzy W. Jaromczyk and Miroslaw Kowaluk"
+, title =       "Sets of Lines and Cutting Out Polyhedral Objects"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "183--186"
+, update =      "01.04 icking"
 }
 
 @inproceedings{jk-spals-88
-, author =	"J. W. Jaromczyk and M. Kowaluk"
-, title =	"Skewed Projections with an Application to Line Stabbing in {$R^3$}"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, organization =	"ACM"
-, publisher =	"ACM Press"
-, address =	"New York"
-, year =	1988
-, pages =	"362--370"
-, keywords =	"image part pattern"
-, cites =	"ab-eact-87, a-dp-86, ad-ahdsp-87, aw-alts-87, b-mag-69, dgk-htir-63, ds-cpcde-65, emprww-sls-82, e-ftssg-85, es-mnwsn-87, egs-ueplf-87, epss-lebfi-87, et-eaide-85, g-ct-58, hdk-cgp-64, hs-ndssg-86, klz-gpcs-85, scklps-gadss-86, s-pds-74, w-ublo-86, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex"
+, author =      "J. W. Jaromczyk and M. Kowaluk"
+, title =       "Skewed Projections with an Application to Line Stabbing in {$R^3$}"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, organization =        "ACM"
+, publisher =   "ACM Press"
+, address =     "New York"
+, year =        1988
+, pages =       "362--370"
+, keywords =    "image part pattern"
+, cites =       "ab-eact-87, a-dp-86, ad-ahdsp-87, aw-alts-87, b-mag-69, dgk-htir-63, ds-cpcde-65, emprww-sls-82, e-ftssg-85, es-mnwsn-87, egs-ueplf-87, epss-lebfi-87, et-eaide-85, g-ct-58, hdk-cgp-64, hs-ndssg-86, klz-gpcs-85, scklps-gadss-86, s-pds-74, w-ublo-86, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{jk-fwchw-00
-, author =	"Jerzy W. Jaromczyk and Miroslaw Kowaluk"
-, title =	"The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"93--97"
-, update =	"00.03 bibrelex"
+, author =      "Jerzy W. Jaromczyk and Miroslaw Kowaluk"
+, title =       "The Face-Wise Continuity in Hot Wire Cutting of Polyhedral Sets"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "93--97"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{jk-tlcpp-95
-, author =	"Jerzy W. Jaromczyk and Miroslaw Kowaluk"
-, title =	"The Two-Line Center Problem from a Polar view: {A} new algorithm and data structure"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"13--25"
-, update =	"99.11 bibrelex, 99.07 bibrelex, 97.03 agarwal, 96.09 agarwal, 95.05 mitchell"
+, author =      "Jerzy W. Jaromczyk and Miroslaw Kowaluk"
+, title =       "The Two-Line Center Problem from a Polar view: {A} new algorithm and data structure"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "13--25"
+, update =      "99.11 bibrelex, 99.07 bibrelex, 97.03 agarwal, 96.09 agarwal, 95.05 mitchell"
 }
 
 @article{js-rfccg-91
-, author =	"J. W. Jaromczyk and G. {\'S}wi{\c a}tek"
-, title =	"A role of lower semi-continuous functions in combinatorial complexity of geometric problems"
-, journal =	"J. Complexity"
-, volume =	"??"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "J. W. Jaromczyk and G. {\'S}wi{\c a}tek"
+, title =       "A role of lower semi-continuous functions in combinatorial complexity of geometric problems"
+, journal =     "J. Complexity"
+, volume =      "??"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @article{jt-rngtr-92
-, author =	"J. W. Jaromczyk and G. T. Toussaint"
-, title =	"Relative Neighborhood Graphs and Their Relatives"
-, journal =	"Proc. IEEE"
-, volume =	80
-, number =	9
-, month =	sep
-, year =	1992
-, pages =	"1502--1517"
-, update =	"93.09 held"
+, author =      "J. W. Jaromczyk and G. T. Toussaint"
+, title =       "Relative Neighborhood Graphs and Their Relatives"
+, journal =     "Proc. IEEE"
+, volume =      80
+, number =      9
+, month =       sep
+, year =        1992
+, pages =       "1502--1517"
+, update =      "93.09 held"
 }
 
 @article{jw-cchfp-94
-, author =	"J. W. Jaromczyk and G. W. Wasilkowski"
-, title =	"Computing convex hull in a floating point arithmetic"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"283--292"
-, update =	"95.01 smid"
+, author =      "J. W. Jaromczyk and G. W. Wasilkowski"
+, title =       "Computing convex hull in a floating point arithmetic"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "283--292"
+, update =      "95.01 smid"
 }
 
 @inproceedings{jw-nscha-90
-, author =	"J. W. Jaromczyk and G. W. Wasilkowski"
-, title =	"Numerical stability of a convex hull algorithm for simple polygons"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"257--260"
-, cites =	"e-acg-87, f-smpst-89, g-eadch-72, gy-fchsp-83, l-fchsp-83, ps-cgi-85, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "J. W. Jaromczyk and G. W. Wasilkowski"
+, title =       "Numerical stability of a convex hull algorithm for simple polygons"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "257--260"
+, cites =       "e-acg-87, f-smpst-89, g-eadch-72, gy-fchsp-83, l-fchsp-83, ps-cgi-85, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{jw-nscha-93
-, author =	"J. W. Jaromczyk and G. W. Wasilkowski"
-, title =	"Numerical stability of a convex hull algorithm for simple polygons"
-, journal =	"Algorithmica"
-, volume =	10
-, year =	1993
-, pages =	"457--472"
-, update =	"95.01 smid"
+, author =      "J. W. Jaromczyk and G. W. Wasilkowski"
+, title =       "Numerical stability of a convex hull algorithm for simple polygons"
+, journal =     "Algorithmica"
+, volume =      10
+, year =        1993
+, pages =       "457--472"
+, update =      "95.01 smid"
 }
 
 @inproceedings{j-cshpp-77
-, author =	"R. A. Jarvis"
-, title =	"Computing the shape hull of points in the plane"
-, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn. Image Process."
-, year =	1977
-, pages =	"231--241"
+, author =      "R. A. Jarvis"
+, title =       "Computing the shape hull of points in the plane"
+, booktitle =   "Proc. IEEE Internat. Conf. Pattern Recogn. Image Process."
+, year =        1977
+, pages =       "231--241"
 }
 
 @article{j-ichfs-73
-, author =	"R. A. Jarvis"
-, title =	"On the identification of the convex hull of a finite set of points in the plane"
-, journal =	"Inform. Process. Lett."
-, volume =	2
-, year =	1973
-, pages =	"18--21"
-, keywords =	"designing algorithms, convex hull, two-dimensional, worst-case analysis"
-, annote =	"$O(n h)$ time"
+, author =      "R. A. Jarvis"
+, title =       "On the identification of the convex hull of a finite set of points in the plane"
+, journal =     "Inform. Process. Lett."
+, volume =      2
+, year =        1973
+, pages =       "18--21"
+, keywords =    "designing algorithms, convex hull, two-dimensional, worst-case analysis"
+, annote =      "$O(n h)$ time"
 }
 
 @inproceedings{j-snnms-78
-, author =	"R. A. Jarvis"
-, title =	"Shared near neighbor maximal spanning trees for cluster analysis"
-, booktitle =	"Proc. 4th IEEE Internat. Conf. Pattern Recogn."
-, site =	"Kyoto, Japan"
-, year =	1978
-, update =	"98.03 bibrelex"
+, author =      "R. A. Jarvis"
+, title =       "Shared near neighbor maximal spanning trees for cluster analysis"
+, booktitle =   "Proc. 4th IEEE Internat. Conf. Pattern Recogn."
+, site =        "Kyoto, Japan"
+, year =        1978
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{jts-oampn-86
-, author =	"R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
-, title =	"An Optimal Algorithm for Maximal Planarization of Nonplanar Graphs"
-, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
-, year =	1986
-, pages =	"1237--1240"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
+, title =       "An Optimal Algorithm for Maximal Planarization of Nonplanar Graphs"
+, booktitle =   "Proc. IEEE Internat. Sympos. on Circuits and Systems"
+, year =        1986
+, pages =       "1237--1240"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{jts-oagp-88
-, author =	"R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
-, title =	"${O}(n^2)$ Algorithms for Graph Planarization"
-, number =	"CSD-88-01"
-, institution =	"Department of Computer Science, Concordia University"
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
+, title =       "${O}(n^2)$ Algorithms for Graph Planarization"
+, number =      "CSD-88-01"
+, institution = "Department of Computer Science, Concordia University"
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{jts-oagp-89
-, author =	"R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
-, title =	"${O}(n^2)$ Algorithms for Graph Planarization"
-, journal =	"IEEE Trans. Comp.-Aided Design"
-, volume =	8
-, year =	1989
-, pages =	"257--267"
-, keywords =	"graph drawing, planarization"
-, update =	"95.05 tamassia"
+, author =      "R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
+, title =       "${O}(n^2)$ Algorithms for Graph Planarization"
+, journal =     "IEEE Trans. Comp.-Aided Design"
+, volume =      8
+, year =        1989
+, pages =       "257--267"
+, keywords =    "graph drawing, planarization"
+, update =      "95.05 tamassia"
 }
 
 @article{jts-pelta-88
-, author =	"R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
-, title =	"Planar Embedding: Linear-Time Algorithms for Vertex Placement and Edge Ordering"
-, journal =	"IEEE Trans. Circuits Syst."
-, volume =	35
-, number =	3
-, year =	1988
-, pages =	"334--344"
-, keywords =	"graph drawing"
-, update =	"96.09 devillers, 93.09 tamassia"
+, author =      "R. Jayakumar and K. Thulasiraman and M. N. S. Swamy"
+, title =       "Planar Embedding: Linear-Time Algorithms for Vertex Placement and Edge Ordering"
+, journal =     "IEEE Trans. Circuits Syst."
+, volume =      35
+, number =      3
+, year =        1988
+, pages =       "334--344"
+, keywords =    "graph drawing"
+, update =      "96.09 devillers, 93.09 tamassia"
 }
 
 @techreport{js-vbrct-87
-, author =	"R. Jayaraman and V. Srinivasan"
-, title =	"Virtual boundary requirements and conditional tolerances in mechanical design"
-, type =	"Report"
-, number =	"RC 12942 (\#58050)"
-, institution =	"Auto. Res. Group, IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1987
+, author =      "R. Jayaraman and V. Srinivasan"
+, title =       "Virtual boundary requirements and conditional tolerances in mechanical design"
+, type =        "Report"
+, number =      "RC 12942 (\#58050)"
+, institution = "Auto. Res. Group, IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1987
 }
 
 @article{jnr-dippl-87
-, author =	"R. J{\`e}gan and R. Nowakowski and I. Rival"
-, title =	"The Diagram Invariant Problem for Planar Lattices"
-, journal =	"Acta Sci. Math. Szeged"
-, volume =	51
-, year =	1987
-, pages =	"103--121"
-, update =	"97.11 bibrelex"
+, author =      "R. J{\`e}gan and R. Nowakowski and I. Rival"
+, title =       "The Diagram Invariant Problem for Planar Lattices"
+, journal =     "Acta Sci. Math. Szeged"
+, volume =      51
+, year =        1987
+, pages =       "103--121"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{jl-rcgs-92
-, author =	"E. Jennings and A. Lingas"
-, title =	"On the Relationships among Constrained Geometric Structures"
-, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '92"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	650
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"289--298"
-, update =	"94.09 smid, 93.09 milone+mitchell"
+, author =      "E. Jennings and A. Lingas"
+, title =       "On the Relationships among Constrained Geometric Structures"
+, booktitle =   "Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '92"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      650
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "289--298"
+, update =      "94.09 smid, 93.09 milone+mitchell"
 }
 
 @incollection{jl-agtls-93
-, author =	"G. F. Jennings and W. J. Lenhart"
-, title =	"An art gallery theorem for line segments in the plane"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Pattern Recognition Letters Special Issue on Computational Geometry"
-, month =	sep
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "G. F. Jennings and W. J. Lenhart"
+, title =       "An art gallery theorem for line segments in the plane"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Pattern Recognition Letters Special Issue on Computational Geometry"
+, month =       sep
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{j-rcnls-96
-, author =	"Henrik Wann Jensen"
-, title =	"Rendering Caustics on Non-Lambertian Surfaces"
-, booktitle =	"Proc. Graphics Interface '96"
-, site =	"Toronto"
-, year =	1996
-, pages =	"116--121"
-, update =	"00.11 smid, 00.07 icking, 99.07 orourke"
+, author =      "Henrik Wann Jensen"
+, title =       "Rendering Caustics on Non-Lambertian Surfaces"
+, booktitle =   "Proc. Graphics Interface '96"
+, site =        "Toronto"
+, year =        1996
+, pages =       "116--121"
+, update =      "00.11 smid, 00.07 icking, 99.07 orourke"
 }
 
 @article{j-pvdll-91
-, author =	"C.-J. Jeong"
-, title =	"Parallel {Voronoi} Diagram in ${L}_{1}$ (${L}_{\infty}$) Metric on a Mesh-connected Computer"
-, journal =	"Parallel Comput."
-, volume =	17
-, number =	"2--3"
-, month =	jun
-, year =	1991
-, pages =	"241--252"
-, update =	"93.09 held"
+, author =      "C.-J. Jeong"
+, title =       "Parallel {Voronoi} Diagram in ${L}_{1}$ (${L}_{\infty}$) Metric on a Mesh-connected Computer"
+, journal =     "Parallel Comput."
+, volume =      17
+, number =      "2--3"
+, month =       jun
+, year =        1991
+, pages =       "241--252"
+, update =      "93.09 held"
 }
 
 @article{jl-pgamc-90
-, author =	"C. S. Jeong and D. T. Lee"
-, title =	"Parallel geometric algorithms on a mesh-connected computer"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"155--177"
+, author =      "C. S. Jeong and D. T. Lee"
+, title =       "Parallel geometric algorithms on a mesh-connected computer"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "155--177"
 }
 
 @inproceedings{jdh-ucgtd-87
-, author =	"R. B. Jerard and R. L. Drysdale and K. Hauck"
-, title =	"The Uses of Computer Graphics as a Tool for Detecting Errors in Numerical Control Machining of Sculptured Surfaces"
-, booktitle =	"Proceedings of NCGA's Computer Graphics '87"
-, site =	"Philadelphia"
-, month =	mar
-, year =	1987
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "R. B. Jerard and R. L. Drysdale and K. Hauck"
+, title =       "The Uses of Computer Graphics as a Tool for Detecting Errors in Numerical Control Machining of Sculptured Surfaces"
+, booktitle =   "Proceedings of NCGA's Computer Graphics '87"
+, site =        "Philadelphia"
+, month =       mar
+, year =        1987
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{jhd-sncms-86
-, author =	"R. B. Jerard and K. Hauck and R. L. Drysdale"
-, title =	"Simulation of Numerical Control Machining of Sculptured Surfaces"
-, booktitle =	"15th International Symposium on Automative Technology and Automation"
-, nickname =	"ISATA"
-, month =	oct
-, year =	1986
-, note =	"Paper No. 86057"
-, update =	"98.03 bibrelex"
+, author =      "R. B. Jerard and K. Hauck and R. L. Drysdale"
+, title =       "Simulation of Numerical Control Machining of Sculptured Surfaces"
+, booktitle =   "15th International Symposium on Automative Technology and Automation"
+, nickname =    "ISATA"
+, month =       oct
+, year =        1986
+, note =        "Paper No. 86057"
+, update =      "98.03 bibrelex"
 }
 
 @article{jk-rbhat-85
-, author =	"B. Jeromin and F. K{\"o}rner"
-, title =	"On the refinement of bounds of heuristic algorithms for the traveling salesman problem"
-, journal =	"Math. Program."
-, volume =	32
-, year =	1985
-, pages =	"114--117"
-, keywords =	"heuristics, approximation"
+, author =      "B. Jeromin and F. K{\"o}rner"
+, title =       "On the refinement of bounds of heuristic algorithms for the traveling salesman problem"
+, journal =     "Math. Program."
+, volume =      32
+, year =        1985
+, pages =       "114--117"
+, keywords =    "heuristics, approximation"
 }
 
 @inproceedings{jj-3dlrg-95
-, author =	"T. J{\'e}ron and C. Jard"
-, title =	"{3D} Layout of Reachability Graphs of Communicating Processes"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"25--32"
-, keywords =	"graph drawing, 3D"
-, update =	"95.01 tamassia"
+, author =      "T. J{\'e}ron and C. Jard"
+, title =       "{3D} Layout of Reachability Graphs of Communicating Processes"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "25--32"
+, keywords =    "graph drawing, 3D"
+, update =      "95.01 tamassia"
 }
 
 @article{j-saprm-73
-, author =	"R. G. Jeroslow"
-, title =	"The simplex algorithm with the pivot rule of maximizing criterion improvement"
-, journal =	"Discrete Math."
-, volume =	4
-, year =	1973
-, pages =	"367--377"
-, update =	"97.03 gaertner+salinger"
+, author =      "R. G. Jeroslow"
+, title =       "The simplex algorithm with the pivot rule of maximizing criterion improvement"
+, journal =     "Discrete Math."
+, volume =      4
+, year =        1973
+, pages =       "367--377"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{j-crpg-82
-, author =	"M. Jerrum"
-, title =	"A Compact Representation for Permutation Groups"
-, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1982
-, pages =	"126--133"
-, update =	"97.11 bibrelex"
+, author =      "M. Jerrum"
+, title =       "A Compact Representation for Permutation Groups"
+, booktitle =   "Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1982
+, pages =       "126--133"
+, update =      "97.11 bibrelex"
 }
 
 @article{j-crpg-86
-, author =	"M. Jerrum"
-, title =	"A compact representation for permutation groups"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"60--78"
+, author =      "M. Jerrum"
+, title =       "A compact representation for permutation groups"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "60--78"
 }
 
 @techreport{j-dsson-87
-, author =	"M. Jerrum"
-, title =	"A data structure for systems of orthogonal, non-overlapping rectangles"
-, type =	"Report"
-, number =	"CSR-239-87"
-, institution =	"Dept. Comput. Sci., Univ. Edinburgh"
-, address =	"Edinburgh, Scotland"
-, year =	1987
+, author =      "M. Jerrum"
+, title =       "A data structure for systems of orthogonal, non-overlapping rectangles"
+, type =        "Report"
+, number =      "CSR-239-87"
+, institution = "Dept. Comput. Sci., Univ. Edinburgh"
+, address =     "Edinburgh, Scotland"
+, year =        1987
 }
 
 @techreport{j-cporp-85
-, author =	"M. Jerrum"
-, title =	"Complementary partial orders and rectangle packing"
-, type =	"Report"
-, number =	"CSR-190-85"
-, institution =	"Dept. Comput. Sci., Univ. Edinburgh"
-, address =	"Edinburgh, Scotland"
-, year =	1985
+, author =      "M. Jerrum"
+, title =       "Complementary partial orders and rectangle packing"
+, type =        "Report"
+, number =      "CSR-190-85"
+, institution = "Dept. Comput. Sci., Univ. Edinburgh"
+, address =     "Edinburgh, Scotland"
+, year =        1985
 }
 
 @article{jvv-rgcsu-86
-, author =	"M. Jerrum and L. Valiant and V. Vazirani"
-, title =	"Random generation of combinatorial structures from a uniform distribution"
-, journal =	"Theoret. Comput. Sci."
-, volume =	43
-, year =	1986
-, pages =	"169--188"
-, update =	"98.03 bibrelex"
+, author =      "M. Jerrum and L. Valiant and V. Vazirani"
+, title =       "Random generation of combinatorial structures from a uniform distribution"
+, journal =     "Theoret. Comput. Sci."
+, volume =      43
+, year =        1986
+, pages =       "169--188"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{jjm-asest-01
-, author =	"M{\'a}rio Jesus and S{\'e}rgio Jesus and Alberto M{\'a}rquez"
-, title =	"Approximated Solutions for the {Euclidean} {Steiner} Tree Problem with Large Sets of Points"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"174--177"
-, update =	"01.04 icking"
+, author =      "M{\'a}rio Jesus and S{\'e}rgio Jesus and Alberto M{\'a}rquez"
+, title =       "Approximated Solutions for the {Euclidean} {Steiner} Tree Problem with Large Sets of Points"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "174--177"
+, update =      "01.04 icking"
 }
 
 @inproceedings{je-sppi-94
-, author =	"Yan-Bin Jia and Michael Erdmann"
-, title =	"Sensing Polygon Poses by Inscription"
-, booktitle =	"Proc. 1994 IEEE Internat. Conf. Robot. Autom."
-, publisher =	"IEEE Computer Society"
-, year =	1994
-, pages =	"1642--1649"
-, keywords =	"probing, point probes, part orientation"
-, update =	"96.09 romanik"
+, author =      "Yan-Bin Jia and Michael Erdmann"
+, title =       "Sensing Polygon Poses by Inscription"
+, booktitle =   "Proc. 1994 IEEE Internat. Conf. Robot. Autom."
+, publisher =   "IEEE Computer Society"
+, year =        1994
+, pages =       "1642--1649"
+, keywords =    "probing, point probes, part orientation"
+, update =      "96.09 romanik"
 }
 
 @inproceedings{je-csps-94
-, author =	"Yan-Bin Jia and Michael Erdmann"
-, title =	"The Complexity of Sensing by Point Sampling"
-, booktitle =	"Proc. 1st Workshop Algorithmic Found. Robot."
-, publisher =	"A.~K. Peters"
-, address =	"Wellesley, MA"
-, year =	1995
-, pages =	""
-, keywords =	"probing, point probes, NP-complete"
-, update =	"98.07 agarwal, 96.09 romanik"
+, author =      "Yan-Bin Jia and Michael Erdmann"
+, title =       "The Complexity of Sensing by Point Sampling"
+, booktitle =   "Proc. 1st Workshop Algorithmic Found. Robot."
+, publisher =   "A.~K. Peters"
+, address =     "Wellesley, MA"
+, year =        1995
+, pages =       ""
+, keywords =    "probing, point probes, NP-complete"
+, update =      "98.07 agarwal, 96.09 romanik"
 }
 
 @inproceedings{jw-assst-94
-, author =	"T. Jiang and L. Wang"
-, title =	"An Approximation Scheme for Some {Steiner} Tree Problems in the Plane"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"414--422"
-, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
+, author =      "T. Jiang and L. Wang"
+, title =       "An Approximation Scheme for Some {Steiner} Tree Problems in the Plane"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "414--422"
+, update =      "99.11 bibrelex, 98.03 smid, 96.05 mitchell"
 }
 
 @article{jyb-drisc-96
-, author =	"X. Jiang and K. Yu and H. Bunke"
-, title =	"Detection of Rotational and Involutional Symmetries and Congruity of Polyhedra"
-, journal =	"Visual Comput."
-, volume =	12
-, number =	4
-, year =	1996
-, pages =	"193--201"
-, update =	"96.09 held"
+, author =      "X. Jiang and K. Yu and H. Bunke"
+, title =       "Detection of Rotational and Involutional Symmetries and Congruity of Polyhedra"
+, journal =     "Visual Comput."
+, volume =      12
+, number =      4
+, year =        1996
+, pages =       "193--201"
+, update =      "96.09 held"
 }
 
 @inproceedings{jb-dspao-91
-, author =	"Xiao-Yi Jiang and Horst Bunke"
-, title =	"Determination of the symmetries of polyhedra and an application to object recognition"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"113--121"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
-, abstract =	"In this paper we present a simple and efficient algorithm
+, author =      "Xiao-Yi Jiang and Horst Bunke"
+, title =       "Determination of the symmetries of polyhedra and an application to object recognition"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "113--121"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
+, abstract =    "In this paper we present a simple and efficient algorithm
                  for determining the rotational symmetries of polyhedral
                  objects in $O(m^2)$ time using $O(m)$ space where
                  $m$ represents the number of edges of the object.
@@ -82908,3542 +82908,3542 @@ @inproceedings{jb-dspao-91
 }
 
 @article{jabccpw-ifemp-93
-, author =	"R. A. Jinkerson and S. L. Abrams and L. Bardis and C. Chryssostomidis and A. Cl{\'e}ment and N. M. Patrikalakis and F.-E. Wolter"
-, title =	"Inspection and Feature Extraction of Marine Propellers"
-, journal =	"Journal of Ship Production"
-, volume =	9
-, number =	2
-, year =	1993
-, pages =	"88--106"
-, update =	"95.05 abrams"
+, author =      "R. A. Jinkerson and S. L. Abrams and L. Bardis and C. Chryssostomidis and A. Cl{\'e}ment and N. M. Patrikalakis and F.-E. Wolter"
+, title =       "Inspection and Feature Extraction of Marine Propellers"
+, journal =     "Journal of Ship Production"
+, volume =      9
+, number =      2
+, year =        1993
+, pages =       "88--106"
+, update =      "95.05 abrams"
 }
 
 @article{j-3dtlt-89
-, author =	"B. Joe"
-, title =	"3-Dimensional Triangulations from Local Transformations"
-, journal =	"SIAM J. Sci. Statist. Comput."
-, volume =	10
-, number =	4
-, year =	1989
-, pages =	"718--741"
-, annote =	"Considers 3D DT and max-min solid angle criterion.
-		 Shows 3D DT has local optimality property, but
-		 switchings will not necessarily converge to DT.
-		 Conjectures that switchings based on insertion
-		 algorithm give DT. Experiments with variations on
-		 switching order."
+, author =      "B. Joe"
+, title =       "3-Dimensional Triangulations from Local Transformations"
+, journal =     "SIAM J. Sci. Statist. Comput."
+, volume =      10
+, number =      4
+, year =        1989
+, pages =       "718--741"
+, annote =      "Considers 3D DT and max-min solid angle criterion.
+                 Shows 3D DT has local optimality property, but
+                 switchings will not necessarily converge to DT.
+                 Conjectures that switchings based on insertion
+                 algorithm give DT. Experiments with variations on
+                 switching order."
 }
 
 @techreport{j-ckddt-93
-, author =	"Barry Joe"
-, title =	"Construction of $k$-dimensional {Delaunay} triangulations using local transformations"
-, institution =	"University of Alberta"
-, address =	"Edmonton, Alberta, Canada"
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "Barry Joe"
+, title =       "Construction of $k$-dimensional {Delaunay} triangulations using local transformations"
+, institution = "University of Alberta"
+, address =     "Edmonton, Alberta, Canada"
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @article{j-ctddt-91
-, author =	"B. Joe"
-, title =	"Construction of Three-Dimensional {Delaunay} Triangulations Using Local Transformations"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	8
-, number =	2
-, month =	may
-, year =	1991
-, pages =	"123--142"
-, update =	"93.09 held"
+, author =      "B. Joe"
+, title =       "Construction of Three-Dimensional {Delaunay} Triangulations Using Local Transformations"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      8
+, number =      2
+, month =       may
+, year =        1991
+, pages =       "123--142"
+, update =      "93.09 held"
 }
 
 @techreport{j-ctdiq-93
-, author =	"Barry Joe"
-, title =	"Construction of three-dimensional improved-quality triangulations using local transformations"
-, institution =	"University of Alberta"
-, address =	"Edmonton, Alberta, Canada"
-, month =	jul
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "Barry Joe"
+, title =       "Construction of three-dimensional improved-quality triangulations using local transformations"
+, institution = "University of Alberta"
+, address =     "Edmonton, Alberta, Canada"
+, month =       jul
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{j-dtmcp-84
-, author =	"B. Joe"
-, title =	"Delaunay triangular meshes in convex polygons"
-, type =	"Report"
-, number =	"CS-84-15"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	1984
-, keywords =	"finite element method, mesh generation, numerical analysis, decomposition, Delaunay triangulations"
-, precedes =	"j-dtmcp-86"
+, author =      "B. Joe"
+, title =       "Delaunay triangular meshes in convex polygons"
+, type =        "Report"
+, number =      "CS-84-15"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        1984
+, keywords =    "finite element method, mesh generation, numerical analysis, decomposition, Delaunay triangulations"
+, precedes =    "j-dtmcp-86"
 }
 
 @article{j-dtmcp-86
-, author =	"B. Joe"
-, title =	"{Delaunay} Triangular Meshes in Convex Polygons"
-, journal =	"SIAM J. Sci. Statist. Comput."
-, volume =	7
-, number =	2
-, year =	1986
-, pages =	"514--539"
-, succeeds =	"j-dtmcp-84"
-, annote =	"Finds a Delaunay Triangulation of a convex polygon.
-		 Extra points are added on a semiregular grid and on
-		 boundary. Hard part is strip around boundary. Initial
-		 triangle constructed by a ``walk'' method, improved by
-		 switchings."
+, author =      "B. Joe"
+, title =       "{Delaunay} Triangular Meshes in Convex Polygons"
+, journal =     "SIAM J. Sci. Statist. Comput."
+, volume =      7
+, number =      2
+, year =        1986
+, pages =       "514--539"
+, succeeds =    "j-dtmcp-84"
+, annote =      "Finds a Delaunay Triangulation of a convex polygon.
+                 Extra points are added on a semiregular grid and on
+                 boundary. Hard part is strip around boundary. Initial
+                 triangle constructed by a ``walk'' method, improved by
+                 switchings."
 }
 
 @article{j-dvmms-91
-, author =	"Barry Joe"
-, title =	"{Delaunay} Versus Max-Min Solid Angle Triangulations For Three-Dimensional Mesh Generation"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	31
-, number =	5
-, month =	apr
-, year =	1991
-, pages =	"987--997"
-, keywords =	"mesh generation, Delaunay triangulations"
-, annote =	"Builds 3D DT by incremental flip. Then flips to
-		 maximize minimum solid angle. Max-min seems to give
-		 better shapes."
-, abstract =	"The Delaunay triangulation has been used in several
-		 methods for generating finite element tetrahedral
-		 meshes in three-dimensional polyhedral regions. Other
-		 types of three-dimensional triangulations are possible,
-		 such as a triangulation satisfying a local max-min
-		 solid angle criterion. In this paper, we present
-		 experimental results to show that max-min solid angle
-		 triangulations are better than Delaunay triangulations
-		 for finite element tetrahedral meshes, since the former
-		 type of triangulations contains tetrahedra of better
-		 shape than the latter type. We also describe how mesh
-		 points are generated and triangulated in our
-		 tetrahedral mesh generation method. (Author abstract)
-		 16 Refs."
+, author =      "Barry Joe"
+, title =       "{Delaunay} Versus Max-Min Solid Angle Triangulations For Three-Dimensional Mesh Generation"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      31
+, number =      5
+, month =       apr
+, year =        1991
+, pages =       "987--997"
+, keywords =    "mesh generation, Delaunay triangulations"
+, annote =      "Builds 3D DT by incremental flip. Then flips to
+                 maximize minimum solid angle. Max-min seems to give
+                 better shapes."
+, abstract =    "The Delaunay triangulation has been used in several
+                 methods for generating finite element tetrahedral
+                 meshes in three-dimensional polyhedral regions. Other
+                 types of three-dimensional triangulations are possible,
+                 such as a triangulation satisfying a local max-min
+                 solid angle criterion. In this paper, we present
+                 experimental results to show that max-min solid angle
+                 triangulations are better than Delaunay triangulations
+                 for finite element tetrahedral meshes, since the former
+                 type of triangulations contains tetrahedra of better
+                 shape than the latter type. We also describe how mesh
+                 points are generated and triangulated in our
+                 tetrahedral mesh generation method. (Author abstract)
+                 16 Refs."
 }
 
 @techreport{j-fetcr-84
-, author =	"B. Joe"
-, title =	"Finite element triangulation of complex regions using computational geometry"
-, type =	"Report"
-, number =	"CS-84-19"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	1984
+, author =      "B. Joe"
+, title =       "Finite element triangulation of complex regions using computational geometry"
+, type =        "Report"
+, number =      "CS-84-19"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        1984
 }
 
 @article{j-gspgm-91
-, author =	"B. Joe"
-, title =	"Geompack. {A} Software Package For The Generation Of Meshes Using Geometric Algorithms"
-, journal =	"Advances in Engineering Software and Workstations"
-, volume =	13
-, number =	"5--6"
-, month =	sep
-, year =	1991
-, pages =	"325--331"
-, keywords =	"geompack computer software, mesh generation software, geometric algorithms, Delaunay triangulation, visibility polygons"
-, annote =	"2D and 3D triangulations via insertion flip alg.
-		 Vertices are bin sorted in $\sqrt(n)$ bins."
-, abstract =	"We describe the mathematical software package
-		 GEOMPACK, which contains standard Fortran 77 routines
-		 for the generation of two-dimensional triangular and
-		 three-dimensional tetrahedral finite element meshes
-		 using efficient geometric algorithms. This package
-		 results from our research into mesh generation and
-		 geometric algorithms. It contains routines for
-		 constructing two- and three-dimensional Delaunay
-		 triangulations, decomposing a general polygonal region
-		 into simple or convex polygons, constructing the
-		 visibility polygon of a simple polygon from a
-		 viewpoint, and other geometric algorithms, from which
-		 our mesh generation method is built and others can be
-		 implemented. Our method generates meshes in polygonal
-		 or polyhedral regions specified by their boundary
-		 representation and possible interfaces between
-		 subregions. (Author abstract) 15 Refs."
+, author =      "B. Joe"
+, title =       "Geompack. {A} Software Package For The Generation Of Meshes Using Geometric Algorithms"
+, journal =     "Advances in Engineering Software and Workstations"
+, volume =      13
+, number =      "5--6"
+, month =       sep
+, year =        1991
+, pages =       "325--331"
+, keywords =    "geompack computer software, mesh generation software, geometric algorithms, Delaunay triangulation, visibility polygons"
+, annote =      "2D and 3D triangulations via insertion flip alg.
+                 Vertices are bin sorted in $\sqrt(n)$ bins."
+, abstract =    "We describe the mathematical software package
+                 GEOMPACK, which contains standard Fortran 77 routines
+                 for the generation of two-dimensional triangular and
+                 three-dimensional tetrahedral finite element meshes
+                 using efficient geometric algorithms. This package
+                 results from our research into mesh generation and
+                 geometric algorithms. It contains routines for
+                 constructing two- and three-dimensional Delaunay
+                 triangulations, decomposing a general polygonal region
+                 into simple or convex polygons, constructing the
+                 visibility polygon of a simple polygon from a
+                 viewpoint, and other geometric algorithms, from which
+                 our mesh generation method is built and others can be
+                 implemented. Our method generates meshes in polygonal
+                 or polyhedral regions specified by their boundary
+                 representation and possible interfaces between
+                 subregions. (Author abstract) 15 Refs."
 }
 
 @techreport{j-gspgm-93
-, author =	"Barry Joe"
-, title =	"GEOMPACK: A software package for the generation of meshes using geometric algorithms"
-, institution =	"University of Alberta"
-, address =	"Edmonton, Alberta, Canada"
-, month =	jul
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "Barry Joe"
+, title =       "GEOMPACK: A software package for the generation of meshes using geometric algorithms"
+, institution = "University of Alberta"
+, address =     "Edmonton, Alberta, Canada"
+, month =       jul
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @article{j-ocltv-90
-, author =	"B. Joe"
-, title =	"On the correctness of a linear-time visibility polygon algorithm"
-, journal =	"Internat. J. Comput. Math."
-, volume =	32
-, year =	1990
-, pages =	"155--172"
-, update =	"97.03 smid+icking"
+, author =      "B. Joe"
+, title =       "On the correctness of a linear-time visibility polygon algorithm"
+, journal =     "Internat. J. Comput. Math."
+, volume =      32
+, year =        1990
+, pages =       "155--172"
+, update =      "97.03 smid+icking"
 }
 
 @article{j-qmgpr-95
-, author =	"B. Joe"
-, title =	"Quadrilateral mesh generation in polygonal regions"
-, journal =	"Comput. Aided Design"
-, volume =	27
-, year =	1995
-, pages =	"209--222"
-, update =	"98.07 bibrelex"
+, author =      "B. Joe"
+, title =       "Quadrilateral mesh generation in polygonal regions"
+, journal =     "Comput. Aided Design"
+, volume =      27
+, year =        1995
+, pages =       "209--222"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{j-tdbct-93
-, author =	"Barry Joe"
-, title =	"Three-dimensional boundary-constrained triangulations"
-, institution =	"University of Alberta"
-, address =	"Edmonton, Alberta, Canada"
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "Barry Joe"
+, title =       "Three-dimensional boundary-constrained triangulations"
+, institution = "University of Alberta"
+, address =     "Edmonton, Alberta, Canada"
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{js-acpvp-87
-, author =	"B. Joe and R. B. Simpson"
-, title =	"Algorithms and correctness proofs for visibility polygon computations"
-, type =	"Report"
-, number =	"CS-87-03"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	1987
-, keywords =	"visibility, hidden line/surface elimination"
+, author =      "B. Joe and R. B. Simpson"
+, title =       "Algorithms and correctness proofs for visibility polygon computations"
+, type =        "Report"
+, number =      "CS-87-03"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        1987
+, keywords =    "visibility, hidden line/surface elimination"
 }
 
 @article{js-clvpa-87
-, author =	"B. Joe and R. B. Simpson"
-, title =	"Correction to {Lee}'s visibility polygon algorithm"
-, journal =	"BIT"
-, volume =	27
-, year =	1987
-, pages =	"458--473"
+, author =      "B. Joe and R. B. Simpson"
+, title =       "Correction to {Lee}'s visibility polygon algorithm"
+, journal =     "BIT"
+, volume =      27
+, year =        1987
+, pages =       "458--473"
 }
 
 @techreport{js-fetcr-??
-, author =	"B. Joe and R. B. Simpson"
-, title =	"Finite element triangulation of complex regions"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	"??"
+, author =      "B. Joe and R. B. Simpson"
+, title =       "Finite element triangulation of complex regions"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        "??"
 }
 
 @article{js-tmrcs-86
-, author =	"B. Joe and R. B. Simpson"
-, title =	"Triangular meshes for regions of complicated shape"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	23
-, year =	1986
-, pages =	"751--778"
-, keywords =	"finite element method, mesh generation, numerical analysis, decomposition, multiply-connected"
+, author =      "B. Joe and R. B. Simpson"
+, title =       "Triangular meshes for regions of complicated shape"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      23
+, year =        1986
+, pages =       "751--778"
+, keywords =    "finite element method, mesh generation, numerical analysis, decomposition, multiply-connected"
 }
 
 @techreport{js-vspp-85
-, author =	"B. Joe and R. B. Simpson"
-, title =	"Visibility of a simple polygon from a point"
-, type =	"Report"
-, number =	"CS-85-38"
-, institution =	"Dept. Math. Comput. Sci., Drexel Univ."
-, address =	"Philadelphia, PA"
-, year =	1985
-, keywords =	"visibility, hidden line/surface elimination, algorithm correctness"
+, author =      "B. Joe and R. B. Simpson"
+, title =       "Visibility of a simple polygon from a point"
+, type =        "Report"
+, number =      "CS-85-38"
+, institution = "Dept. Math. Comput. Sci., Drexel Univ."
+, address =     "Philadelphia, PA"
+, year =        1985
+, keywords =    "visibility, hidden line/surface elimination, algorithm correctness"
 }
 
 @techreport{jw-dcvdd-88
-, author =	"B. Joe and C. Wang"
-, title =	"Duality constrained {Voronoi} diagrams and {Delaunay} triangulation of a set of line segments"
-, type =	"Technical {Report}"
-, institution =	"Memorial Univ. of Newfoundland"
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "B. Joe and C. Wang"
+, title =       "Duality constrained {Voronoi} diagrams and {Delaunay} triangulation of a set of line segments"
+, type =        "Technical {Report}"
+, institution = "Memorial Univ. of Newfoundland"
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @article{jss-pccrp-77
-, author =	"L. S. Joel and D. R. Shier and M. L. Stein"
-, title =	"Planes, Cubes and Center-Representable Polytopes"
-, journal =	"Amer. Math. Monthly"
-, volume =	84
-, year =	1977
-, pages =	"360--363"
-, update =	"94.05 aich"
+, author =      "L. S. Joel and D. R. Shier and M. L. Stein"
+, title =       "Planes, Cubes and Center-Representable Polytopes"
+, journal =     "Amer. Math. Monthly"
+, volume =      84
+, year =        1977
+, pages =       "360--363"
+, update =      "94.05 aich"
 }
 
 @article{j-sadki-74
-, author =	"A. Joffe"
-, title =	"On a set of almost deterministic k-independent random variables"
-, journal =	"Ann. Probab."
-, volume =	2
-, year =	1974
-, pages =	"161--162"
-, update =	"96.09 orourke"
+, author =      "A. Joffe"
+, title =       "On a set of almost deterministic k-independent random variables"
+, journal =     "Ann. Probab."
+, volume =      2
+, year =        1974
+, pages =       "161--162"
+, update =      "96.09 orourke"
 }
 
 @article{jg-sab3d-83
-, author =	"G. H. Johansen and C. Gram"
-, title =	"A simple algorithm for building the $3$-d convex hull"
-, journal =	"BIT"
-, volume =	23
-, year =	1983
-, pages =	"146--160"
+, author =      "G. H. Johansen and C. Gram"
+, title =       "A simple algorithm for building the $3$-d convex hull"
+, journal =     "BIT"
+, volume =      23
+, year =        1983
+, pages =       "146--160"
 }
 
 @techreport{j-wdmim-97
-, author =	"Peter Johansson"
-, title =	"On a Weighted Distance Model for Injection Moulding"
-, type =	"Link{\"o}ping Studies in Science and Technology, Thesis No. 604"
-, number =	"LiU-TEK-LIC-1997:05"
-, institution =	"Division of Applied Mathematics, Link{\"o}ping University"
-, address =	"Link{\"o}ping, Sweden"
-, month =	feb
-, year =	1997
-, keywords =	"shortest paths, injection molding, weighted region problem"
-, update =	"98.03 mitchell"
-, annote =	"Licentiate thesis"
+, author =      "Peter Johansson"
+, title =       "On a Weighted Distance Model for Injection Moulding"
+, type =        "Link{\"o}ping Studies in Science and Technology, Thesis No. 604"
+, number =      "LiU-TEK-LIC-1997:05"
+, institution = "Division of Applied Mathematics, Link{\"o}ping University"
+, address =     "Link{\"o}ping, Sweden"
+, month =       feb
+, year =        1997
+, keywords =    "shortest paths, injection molding, weighted region problem"
+, update =      "98.03 mitchell"
+, annote =      "Licentiate thesis"
 }
 
 @article{j-episc-48
-, author =	"F. John"
-, title =	"Extremum problems with inequalities as subsidary conditions"
-, journal =	"Courant Anniversary"
-, volume =	"??"
-, year =	1948
-, pages =	"187--204"
-, update =	"97.11 bibrelex"
+, author =      "F. John"
+, title =       "Extremum problems with inequalities as subsidary conditions"
+, journal =     "Courant Anniversary"
+, volume =      "??"
+, year =        1948
+, pages =       "187--204"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{j-ttvhs-93
-, author =	"B. Johnson"
-, title =	"TreeViz: TreeMap Visualization of Hierarchically Structured Information"
-, booktitle =	"Proc. ACM Conf. on Human Factors in Computing Systems"
-, nickname =	"CHI"
-, year =	1993
-, pages =	"369--370"
-, keywords =	"graph drawing, planar"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "B. Johnson"
+, title =       "TreeViz: TreeMap Visualization of Hierarchically Structured Information"
+, booktitle =   "Proc. ACM Conf. on Human Factors in Computing Systems"
+, nickname =    "CHI"
+, year =        1993
+, pages =       "369--370"
+, keywords =    "graph drawing, planar"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @article{js-tmsat-91
-, author =	"B. Johnson and B. Shneiderman"
-, title =	"Tree-Maps: A Space-Filling Approach to the Visualization of Hierarchical Information Systems"
-, journal =	"IEEE Visualization"
-, volume =	"??"
-, year =	1991
-, keywords =	"graph drawing, planar"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "B. Johnson and B. Shneiderman"
+, title =       "Tree-Maps: A Space-Filling Approach to the Visualization of Hierarchical Information Systems"
+, journal =     "IEEE Visualization"
+, volume =      "??"
+, year =        1991
+, keywords =    "graph drawing, planar"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @book{j-nspde-87
-, author =	"C. Johnson"
-, title =	"Numerical solution of partial differential equations by the finite element method"
-, publisher =	"Cambridge University Press"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "C. Johnson"
+, title =       "Numerical solution of partial differential equations by the finite element method"
+, publisher =   "Cambridge University Press"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @article{j-pqiqo-82
-, author =	"D. B. Johnson"
-, title =	"A priority queue in which initialization and queue operations take $O(\log\log D)$ time"
-, journal =	"Math. Syst. Theory"
-, volume =	"??"
-, year =	1982
-, pages =	"295--309"
-, update =	"97.11 bibrelex"
+, author =      "D. B. Johnson"
+, title =       "A priority queue in which initialization and queue operations take $O(\log\log D)$ time"
+, journal =     "Math. Syst. Theory"
+, volume =      "??"
+, year =        1982
+, pages =       "295--309"
+, update =      "97.11 bibrelex"
 }
 
 @article{jm-sktex-78
-, author =	"D. B. Johnson and T. Mizoguchi"
-, title =	"Selecting the $k$-th element in {$X+Y$} and {$X_{1}+X_{2} + ... +X_{m}$}"
-, journal =	"SIAM J. Comput."
-, volume =	7
-, year =	1978
-, pages =	"147--153"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "D. B. Johnson and T. Mizoguchi"
+, title =       "Selecting the $k$-th element in {$X+Y$} and {$X_{1}+X_{2} + ... +X_{m}$}"
+, journal =     "SIAM J. Comput."
+, volume =      7
+, year =        1978
+, pages =       "147--153"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{j-aacp-74
-, author =	"D. S. Johnson"
-, title =	"Approximation algorithms for combinatorial problems"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	9
-, year =	1974
-, pages =	"256--278"
+, author =      "D. S. Johnson"
+, title =       "Approximation algorithms for combinatorial problems"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      9
+, year =        1974
+, pages =       "256--278"
 }
 
 @article{j-nccog-82
-, author =	"D. S. Johnson"
-, title =	"The {NP}-Completeness Column: an Ongoing Guide"
-, journal =	"J. Algorithms"
-, volume =	3
-, number =	1
-, year =	1982
-, pages =	"89--99"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. S. Johnson"
+, title =       "The {NP}-Completeness Column: an Ongoing Guide"
+, journal =     "J. Algorithms"
+, volume =      3
+, number =      1
+, year =        1982
+, pages =       "89--99"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{j-nccog-84
-, author =	"D. S. Johnson"
-, title =	"The {NP}-Completeness Column: an Ongoing Guide"
-, journal =	"J. Algorithms"
-, volume =	5
-, number =	2
-, year =	1984
-, pages =	"147--160"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. S. Johnson"
+, title =       "The {NP}-Completeness Column: an Ongoing Guide"
+, journal =     "J. Algorithms"
+, volume =      5
+, number =      2
+, year =        1984
+, pages =       "147--160"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{jdugg-wcpbs-74
-, author =	"D. S. Johnson and A. Demers and J. D. Ullmann and M. R. Garey and R. L. Graham"
-, title =	"Worst-case performance bounds for simple one-dimensional packing algorithms"
-, journal =	"SIAM J. Comput."
-, volume =	3
-, year =	1974
-, pages =	"299--325"
-, update =	"97.03 icking"
+, author =      "D. S. Johnson and A. Demers and J. D. Ullmann and M. R. Garey and R. L. Graham"
+, title =       "Worst-case performance bounds for simple one-dimensional packing algorithms"
+, journal =     "SIAM J. Comput."
+, volume =      3
+, year =        1974
+, pages =       "299--325"
+, update =      "97.03 icking"
 }
 
 @inproceedings{jmr-aeahk-96
-, author =	"D. S. Johnson and L. A. McGeoch and E. E. Rothberg"
-, title =	"Asymptotic experimental analysis for the {Held}-{Karp} traveling salesman bound"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"341--350"
-, keywords =	"integer programming, linear programming, approximation, TSP, uniform random points"
-, update =	"96.09 agarwal, 96.01 mitchell"
+, author =      "D. S. Johnson and L. A. McGeoch and E. E. Rothberg"
+, title =       "Asymptotic experimental analysis for the {Held}-{Karp} traveling salesman bound"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "341--350"
+, keywords =    "integer programming, linear programming, approximation, TSP, uniform random points"
+, update =      "96.09 agarwal, 96.01 mitchell"
 }
 
 @incollection{jp-cctsp-85
-, author =	"D. S. Johnson and C. H. Papadimitriou"
-, title =	"Computational complexity and the traveling salesman problem"
-, editor =	"E. Lawler and J. Lenstra and A. Rinnooy Kan and D. Shmoys"
-, booktitle =	"The Traveling Salesman Problem"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1985
-, pages =	"68--74"
-, update =	"95.09 mitchell"
+, author =      "D. S. Johnson and C. H. Papadimitriou"
+, title =       "Computational complexity and the traveling salesman problem"
+, editor =      "E. Lawler and J. Lenstra and A. Rinnooy Kan and D. Shmoys"
+, booktitle =   "The Traveling Salesman Problem"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1985
+, pages =       "68--74"
+, update =      "95.09 mitchell"
 }
 
 @article{jp-hpcdv-87
-, author =	"D. S. Johnson and H. O. Pollak"
-, title =	"Hypergraph Planarity and the Complexity of Drawing {Venn} Diagrams"
-, journal =	"J. Graph Theory"
-, volume =	11
-, number =	3
-, year =	1987
-, pages =	"309--325"
-, keywords =	"graph drawing"
-, update =	"97.07 guedes, 93.09 tamassia"
+, author =      "D. S. Johnson and H. O. Pollak"
+, title =       "Hypergraph Planarity and the Complexity of Drawing {Venn} Diagrams"
+, journal =     "J. Graph Theory"
+, volume =      11
+, number =      3
+, year =        1987
+, pages =       "309--325"
+, keywords =    "graph drawing"
+, update =      "97.07 guedes, 93.09 tamassia"
 }
 
 @article{jp-dhp-78
-, author =	"D. S. Johnson and F. P. Preparata"
-, title =	"The densest hemisphere problem"
-, journal =	"Theoret. Comput. Sci."
-, volume =	6
-, year =	1978
-, pages =	"93--107"
+, author =      "D. S. Johnson and F. P. Preparata"
+, title =       "The densest hemisphere problem"
+, journal =     "Theoret. Comput. Sci."
+, volume =      6
+, year =        1978
+, pages =       "93--107"
 }
 
 @book{j-aeg-60
-, author =	"R. A. Johnson"
-, title =	"Advanced {Euclidean} Geometry"
-, publisher =	"Dover"
-, address =	"New York"
-, year =	1960
-, update =	"98.11 bibrelex"
+, author =      "R. A. Johnson"
+, title =       "Advanced {Euclidean} Geometry"
+, publisher =   "Dover"
+, address =     "New York"
+, year =        1960
+, update =      "98.11 bibrelex"
 }
 
 @article{j-hcs-67
-, author =	"S. C. Johnson"
-, title =	"Hierarchical clustering schemes"
-, journal =	"Psychometrika"
-, volume =	32
-, year =	1967
-, pages =	"241--254"
-, update =	"98.03 bibrelex"
+, author =      "S. C. Johnson"
+, title =       "Hierarchical clustering schemes"
+, journal =     "Psychometrika"
+, volume =      32
+, year =        1967
+, pages =       "241--254"
+, update =      "98.03 bibrelex"
 }
 
 @article{jl-elmhs-84
-, author =	"W. Johnson and J. Lindenstrauss"
-, title =	"Extensions of {Lipschitz} maps into a {Hilbert} space"
-, journal =	"Contemp. Math."
-, volume =	26
-, year =	1984
-, pages =	"189--206"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "W. Johnson and J. Lindenstrauss"
+, title =       "Extensions of {Lipschitz} maps into a {Hilbert} space"
+, journal =     "Contemp. Math."
+, volume =      26
+, year =        1984
+, pages =       "189--206"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @article{jsk-actfm-91
-, author =	"B. P. Johnston and J. M. Sullivan and A. Kwasnik"
-, title =	"Automatic Conversion of Triangular Finite Meshes to Quadrilateral Elements"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	31
-, number =	1
-, year =	1991
-, pages =	"67--84"
-, annote =	"Works by combining adjacent triangles---looking at
-		 those with one neighbour first and trying to combine
-		 them with adjacent nodes. Bad quads are rejected.
-		 Splitting triangles may be necessary."
+, author =      "B. P. Johnston and J. M. Sullivan and A. Kwasnik"
+, title =       "Automatic Conversion of Triangular Finite Meshes to Quadrilateral Elements"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      31
+, number =      1
+, year =        1991
+, pages =       "67--84"
+, annote =      "Works by combining adjacent triangles---looking at
+                 those with one neighbour first and trying to combine
+                 them with adjacent nodes. Bad quads are rejected.
+                 Splitting triangles may be necessary."
 }
 
 @techreport{j-niauc-91
-, author =	"J. K. Johnstone"
-, title =	"A new intersection algorithm using circle decomposition"
-, type =	"Technical {Report}"
-, number =	"JHU-91-20"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	oct
-, year =	1991
+, author =      "J. K. Johnstone"
+, title =       "A new intersection algorithm using circle decomposition"
+, type =        "Technical {Report}"
+, number =      "JHU-91-20"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       oct
+, year =        1991
 }
 
 @techreport{j-fgdcr-91
-, author =	"J. K. Johnstone"
-, title =	"Finding generators and directrix curves on ruled surfaces"
-, type =	"Technical {Report}"
-, number =	"91-17"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	sep
-, year =	1991
-, succeeds =	"j-wrssm-89"
+, author =      "J. K. Johnstone"
+, title =       "Finding generators and directrix curves on ruled surfaces"
+, type =        "Technical {Report}"
+, number =      "91-17"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       sep
+, year =        1991
+, succeeds =    "j-wrssm-89"
 }
 
 @phdthesis{j-spaac-87
-, author =	"J. K. Johnstone"
-, title =	"The sorting of points along an algebraic curve"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1987
-, note =	"Technical Report TR 87-841"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "J. K. Johnstone"
+, title =       "The sorting of points along an algebraic curve"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1987
+, note =        "Technical Report TR 87-841"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @incollection{j-wrssm-89
-, author =	"J. K. Johnstone"
-, title =	"Working with ruled surfaces in solid modeling"
-, booktitle =	"Computers and Mathematics"
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"260--268"
-, precedes =	"j-fgdcr-91"
+, author =      "J. K. Johnstone"
+, title =       "Working with ruled surfaces in solid modeling"
+, booktitle =   "Computers and Mathematics"
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "260--268"
+, precedes =    "j-fgdcr-91"
 }
 
 @article{jb-spaac-90
-, author =	"J. K. Johnstone and C. Bajaj"
-, title =	"Sorting points along an algebraic curve"
-, journal =	"SIAM J. Comput."
-, volume =	19
-, year =	1990
-, pages =	"925--967"
+, author =      "J. K. Johnstone and C. Bajaj"
+, title =       "Sorting points along an algebraic curve"
+, journal =     "SIAM J. Comput."
+, volume =      19
+, year =        1990
+, pages =       "925--967"
 }
 
 @article{jg-lmipa-91
-, author =	"J. K. Johnstone and M. Goodrich"
-, title =	"A localized method for intersecting plane algebraic curve segments"
-, journal =	"Visual Comput."
-, volume =	7
-, year =	1991
-, pages =	"60--71"
+, author =      "J. K. Johnstone and M. Goodrich"
+, title =       "A localized method for intersecting plane algebraic curve segments"
+, journal =     "Visual Comput."
+, volume =      7
+, year =        1991
+, pages =       "60--71"
 }
 
 @techreport{js-cipnq-91
-, author =	"J. K. Johnstone and C.-K. Shene"
-, title =	"Computing the intersection of a plane and a natural quadric"
-, type =	"Technical {Report}"
-, number =	"JHU-91-04"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1991
-, comments =	"to appear in Computers and Graphics 16 (1992)"
+, author =      "J. K. Johnstone and C.-K. Shene"
+, title =       "Computing the intersection of a plane and a natural quadric"
+, type =        "Technical {Report}"
+, number =      "JHU-91-04"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1991
+, comments =    "to appear in Computers and Graphics 16 (1992)"
 }
 
 @techreport{js-drqsr-90
-, author =	"J. K. Johnstone and C. K. Shene"
-, title =	"The distance Representation of Quadric surfaces: {Ruled} quadrics"
-, number =	"JHU-90/08"
-, institution =	"Dept. of Comp. Sci., Johns Hopkins Univ"
-, address =	"Baltimore, MD"
-, month =	jul
-, year =	1990
-, keywords =	"representation of surfaces, bisector, quadric surfaces, design, solid modeling"
-, update =	"93.09 milone+mitchell"
+, author =      "J. K. Johnstone and C. K. Shene"
+, title =       "The distance Representation of Quadric surfaces: {Ruled} quadrics"
+, number =      "JHU-90/08"
+, institution = "Dept. of Comp. Sci., Johns Hopkins Univ"
+, address =     "Baltimore, MD"
+, month =       jul
+, year =        1990
+, keywords =    "representation of surfaces, bisector, quadric surfaces, design, solid modeling"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{js-rahos-91
-, author =	"J. K. Johnstone and C.-K. Shene"
-, title =	"The representation of all hyperboloids of one sheet by two lines"
-, type =	"Technical {Report}"
-, number =	"JHU-91-19"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	jul
-, year =	1991
+, author =      "J. K. Johnstone and C.-K. Shene"
+, title =       "The representation of all hyperboloids of one sheet by two lines"
+, type =        "Technical {Report}"
+, number =      "JHU-91-19"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       jul
+, year =        1991
 }
 
 @article{jmb-rcacv-91
-, author =	"J. Jolion and P. Meer and S. Batauche"
-, title =	"Robust Clustering with Applications in Computer Vision"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	13
-, year =	1991
-, pages =	"791--802"
-, update =	"98.07 agarwal"
+, author =      "J. Jolion and P. Meer and S. Batauche"
+, title =       "Robust Clustering with Applications in Computer Vision"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      13
+, year =        1991
+, pages =       "791--802"
+, update =      "98.07 agarwal"
 }
 
 @article{jk-tawai-78
-, author =	"A. T. Jonassen and D. E. Knuth"
-, title =	"A trivial algorithm whose analysis isn't"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	16
-, year =	1978
-, pages =	"301--322"
+, author =      "A. T. Jonassen and D. E. Knuth"
+, title =       "A trivial algorithm whose analysis isn't"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      16
+, year =        1978
+, pages =       "301--322"
 }
 
 @article{j-cnpp-89
-, author =	"C. Jones"
-, title =	"Cartographic name placement with {Prolog}"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	5
-, year =	1989
-, pages =	"36--47"
-, update =	"98.07 bibrelex"
+, author =      "C. Jones"
+, title =       "Cartographic name placement with {Prolog}"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      5
+, year =        1989
+, pages =       "36--47"
+, update =      "98.07 bibrelex"
 }
 
 @article{j-nahlp-71
-, author =	"C. B. Jones"
-, title =	"A new approach to the ``hidden line'' problem"
-, journal =	"Comput. J."
-, volume =	14
-, year =	1971
-, pages =	"232--237"
+, author =      "C. B. Jones"
+, title =       "A new approach to the ``hidden line'' problem"
+, journal =     "Comput. J."
+, volume =      14
+, year =        1971
+, pages =       "232--237"
 }
 
 @article{jwe-tsmns-99
-, author =	"C. B. Jones and J. M. Ware and C. D. Enyon"
-, title =	"Triangulated Spatial Models and Neighborhood Search: An Experimental Comparison with Quadtrees"
-, journal =	"Visual Comput."
-, volume =	15
-, number =	5
-, year =	1999
-, pages =	"235--248"
-, update =	"00.03 held"
+, author =      "C. B. Jones and J. M. Ware and C. D. Enyon"
+, title =       "Triangulated Spatial Models and Neighborhood Search: An Experimental Comparison with Quadtrees"
+, journal =     "Visual Comput."
+, volume =      15
+, number =      5
+, year =        1999
+, pages =       "235--248"
+, update =      "00.03 held"
 }
 
 @techreport{j-orvgt-93
-, author =	"C. H. Jones"
-, title =	"An obstacle to realizing visibility graphs and triangle intersection graphs"
-, institution =	"Washington State University"
-, address =	"Pullman, WA"
-, month =	jul
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "C. H. Jones"
+, title =       "An obstacle to realizing visibility graphs and triangle intersection graphs"
+, institution = "Washington State University"
+, address =     "Pullman, WA"
+, month =       jul
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @article{j-ecpqe-86
-, author =	"D. W. Jones"
-, title =	"An Empirical Comparison of Priority-Queue and Event-Set Implementations"
-, journal =	"Commun. ACM"
-, volume =	29
-, number =	4
-, month =	apr
-, year =	1986
-, pages =	"300--311"
-, update =	"98.11 bibrelex"
+, author =      "D. W. Jones"
+, title =       "An Empirical Comparison of Priority-Queue and Event-Set Implementations"
+, journal =     "Commun. ACM"
+, volume =      29
+, number =      4
+, month =       apr
+, year =        1986
+, pages =       "300--311"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{j-icfsi-87
-, author =	"L. G. Jones"
-, title =	"Incremental Compaction of Flat Symbolic IC Layouts"
-, type =	"Technical {Report}"
-, number =	"UIUCDCS-R-87-1386"
-, institution =	"Dept. Computer Science, Univ. Illinois."
-, address =	"Urbana, IL"
-, year =	1987
-, update =	"96.01 tamassia"
+, author =      "L. G. Jones"
+, title =       "Incremental Compaction of Flat Symbolic IC Layouts"
+, type =        "Technical {Report}"
+, number =      "UIUCDCS-R-87-1386"
+, institution = "Dept. Computer Science, Univ. Illinois."
+, address =     "Urbana, IL"
+, year =        1987
+, update =      "96.01 tamassia"
 }
 
 @inproceedings{js-hvdsb-86
-, author =	"L. G. Jones and J. Simon"
-, title =	"Hierarchical VLSI Design Systems Based on Attribute Grammars"
-, booktitle =	"13th ACM Sympos. on Principles of Programming Languages"
-, year =	1986
-, pages =	"58--69"
-, update =	"96.01 tamassia"
+, author =      "L. G. Jones and J. Simon"
+, title =       "Hierarchical VLSI Design Systems Based on Attribute Grammars"
+, booktitle =   "13th ACM Sympos. on Principles of Programming Languages"
+, year =        1986
+, pages =       "58--69"
+, update =      "96.01 tamassia"
 }
 
 @inproceedings{jpb-gmsam-95
-, author =	"M. R. Jones and M. A. Price and G. Butlin"
-, title =	"Geometry Management Support for Auto-meshing"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"153--164"
-, update =	"96.01 samitchell"
+, author =      "M. R. Jones and M. A. Price and G. Butlin"
+, title =       "Geometry Management Support for Auto-meshing"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "153--164"
+, update =      "96.01 samitchell"
 }
 
 @article{jc-nacsc-94
-, author =	"M. W. Jones and M. Chen"
-, title =	"A new approach to the construction of surfaces from contour data"
-, journal =	"Comput. Graph. Forum"
-, volume =	13
-, number =	3
-, year =	1994
-, pages =	"75--84"
-, keywords =	"computer graphics, contours, surfaces, approximation"
-, update =	"95.09 korneenko"
+, author =      "M. W. Jones and M. Chen"
+, title =       "A new approach to the construction of surfaces from contour data"
+, journal =     "Comput. Graph. Forum"
+, volume =      13
+, number =      3
+, year =        1994
+, pages =       "75--84"
+, keywords =    "computer graphics, contours, surfaces, approximation"
+, update =      "95.09 korneenko"
 }
 
 @article{jw-asts-91
-, author =	"Norman L. Jones and Stephen G. Wright"
-, title =	"Algorithm For Smoothing Triangulated Surfaces"
-, journal =	"Journal of Computing in Civil Engineering"
-, volume =	5
-, number =	1
-, month =	jan
-, year =	1991
-, pages =	"85--102"
-, keywords =	"contouring, volume calculations, smooth interpolation surfaces, triangulated surface smoothing"
-, annote =	"Extra points added where deviation is maximum.
-		 Insertion inside flip to update tri. Also suggests
-		 flips to minimize deviation."
-, abstract =	"Surfaces defined by linearly interpolating a
-		 two-dimensional triangulation of a set of scattered
-		 data points are frequently used to describe geometry in
-		 computer applications. The linear nature of such
-		 surfaces simplifies many subsequent operations on the
-		 surface such as contouring and volume calculations.
-		 However, if the data points defining the surface are
-		 sparse, the resulting triangulated surface may be
-		 unacceptably rough or irregular. An algorithm is
-		 presented for smoothing a triangulated surface by
-		 adding extra data points at special locations in the
-		 interior of the triangulated region. The incremental
-		 addition of the supplemental data points forces the
-		 triangulated surface to approximate or converge to a
-		 previously specified smooth surface that interpolates
-		 the original data points. A unique feature of the
-		 algorithm is that any smooth interpolation scheme or
-		 surface can be used to smooth the triangulated surface.
-		 The algorithm has been implemented on a microcomputer
-		 and the results have been satisfactory. (Author
-		 abstract) 21 Refs."
+, author =      "Norman L. Jones and Stephen G. Wright"
+, title =       "Algorithm For Smoothing Triangulated Surfaces"
+, journal =     "Journal of Computing in Civil Engineering"
+, volume =      5
+, number =      1
+, month =       jan
+, year =        1991
+, pages =       "85--102"
+, keywords =    "contouring, volume calculations, smooth interpolation surfaces, triangulated surface smoothing"
+, annote =      "Extra points added where deviation is maximum.
+                 Insertion inside flip to update tri. Also suggests
+                 flips to minimize deviation."
+, abstract =    "Surfaces defined by linearly interpolating a
+                 two-dimensional triangulation of a set of scattered
+                 data points are frequently used to describe geometry in
+                 computer applications. The linear nature of such
+                 surfaces simplifies many subsequent operations on the
+                 surface such as contouring and volume calculations.
+                 However, if the data points defining the surface are
+                 sparse, the resulting triangulated surface may be
+                 unacceptably rough or irregular. An algorithm is
+                 presented for smoothing a triangulated surface by
+                 adding extra data points at special locations in the
+                 interior of the triangulated region. The incremental
+                 addition of the supplemental data points forces the
+                 triangulated surface to approximate or converge to a
+                 previously specified smooth surface that interpolates
+                 the original data points. A unique feature of the
+                 algorithm is that any smooth interpolation scheme or
+                 surface can be used to smooth the triangulated surface.
+                 The algorithm has been implemented on a microcomputer
+                 and the results have been satisfactory. (Author
+                 abstract) 21 Refs."
 }
 
 @article{j-rstsp-90
-, author =	"P. Jones"
-, title =	"Rectifiable sets and the {Traveling} {Salesman} {Problem}"
-, journal =	"Invent. Math."
-, volume =	102
-, year =	1990
-, pages =	"1--15"
-, update =	"97.11 bibrelex"
+, author =      "P. Jones"
+, title =       "Rectifiable sets and the {Traveling} {Salesman} {Problem}"
+, journal =     "Invent. Math."
+, volume =      102
+, year =        1990
+, pages =       "1--15"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{jemwdt-npgda-91
-, author =	"S. Jones and P. Eades and A. Moran and N. Ward and G. Delott and R. Tamassia"
-, title =	"A Note on Planar Graph Drawing Algorithms"
-, number =	216
-, institution =	"Department of Computer Science, University of Queensland"
-, year =	1991
-, keywords =	"graph drawing, experiments, planar, straight-line"
-, update =	"96.09 tamassia, 93.09 tamassia"
+, author =      "S. Jones and P. Eades and A. Moran and N. Ward and G. Delott and R. Tamassia"
+, title =       "A Note on Planar Graph Drawing Algorithms"
+, number =      216
+, institution = "Department of Computer Science, University of Queensland"
+, year =        1991
+, keywords =    "graph drawing, experiments, planar, straight-line"
+, update =      "96.09 tamassia, 93.09 tamassia"
 }
 
 @article{jo-nmctd-90
-, author =	"S. Jones and J. O'Rourke"
-, title =	"A note on moving a chair through a doorway"
-, journal =	"Algorithms Rev."
-, volume =	1
-, number =	3
-, year =	1990
-, pages =	"139--149"
-, note =	"S. Jones is now S. Dorward"
-, keywords =	"motion planning, lower bounds"
+, author =      "S. Jones and J. O'Rourke"
+, title =       "A note on moving a chair through a doorway"
+, journal =     "Algorithms Rev."
+, volume =      1
+, number =      3
+, year =        1990
+, pages =       "139--149"
+, note =        "S. Jones is now S. Dorward"
+, keywords =    "motion planning, lower bounds"
 }
 
 @article{j-spivt1-80
-, author =	"S. T. Jones"
-, title =	"Solving Problems Involving Variable Terrain. Part {1}: {A} General Algorithm"
-, journal =	"Byte"
-, volume =	5
-, number =	2
-, month =	feb
-, year =	1980
-, pages =	"58--68"
-, update =	"93.09 milone+mitchell"
+, author =      "S. T. Jones"
+, title =       "Solving Problems Involving Variable Terrain. Part {1}: {A} General Algorithm"
+, journal =     "Byte"
+, volume =      5
+, number =      2
+, month =       feb
+, year =        1980
+, pages =       "58--68"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{j-spivt2-80
-, author =	"S. T. Jones"
-, title =	"Solving Problems Involving Variable Terrain. Part {2}: {Special} Case"
-, journal =	"Byte"
-, volume =	5
-, number =	3
-, month =	mar
-, year =	1980
-, pages =	"74--82"
-, update =	"93.09 milone+mitchell"
+, author =      "S. T. Jones"
+, title =       "Solving Problems Involving Variable Terrain. Part {2}: {Special} Case"
+, journal =     "Byte"
+, volume =      5
+, number =      3
+, month =       mar
+, year =        1980
+, pages =       "74--82"
+, update =      "93.09 milone+mitchell"
 }
 
 @misc{j-cgcb-
-, author =	"W. D. Jones"
-, title =	"Computational Geometry, a Community Bibliography"
-, note =	"Overview at \url{http://compgeom.cs.duke.edu/~jeffe/compgeom/biblios.html#geombib}"
-, url =	"ftp://ftp.cs.usask.ca/pub/geometry/geombib.tar.gz"
-, keywords =	"bibliography"
-, update =	"99.03 jones, 97.03 tamassia"
+, author =      "W. D. Jones"
+, title =       "Computational Geometry, a Community Bibliography"
+, note =        "Overview at \url{http://compgeom.cs.duke.edu/~jeffe/compgeom/biblios.html#geombib}"
+, url = "ftp://ftp.cs.usask.ca/pub/geometry/geombib.tar.gz"
+, keywords =    "bibliography"
+, update =      "99.03 jones, 97.03 tamassia"
 }
 
 @inproceedings{jk-msssp-90
-, author =	"W. D. Jones and Y. Ke"
-, title =	"Maximal segment-stabbing of segments in the plane"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"85--88"
-, keywords =	"stabbing, line segments, two-dimensional, plane-sweep, configuration space"
-, cites =	"ab-eact-87, ad-ahdsp-87, aw-alts-87, e-ftssg-85, e-ftssg-85, emprww-sls-82, epss-lebfi-87, ew-spdtl-89, gs-spscp-90, g-ct-58, g-scop-83, hdk-cgp-64, jk-spals-88, ls-esmpa-87, o-olafs-81, ss-pmp1c-83, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "W. D. Jones and Y. Ke"
+, title =       "Maximal segment-stabbing of segments in the plane"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "85--88"
+, keywords =    "stabbing, line segments, two-dimensional, plane-sweep, configuration space"
+, cites =       "ab-eact-87, ad-ahdsp-87, aw-alts-87, e-ftssg-85, e-ftssg-85, emprww-sls-82, epss-lebfi-87, ew-spdtl-89, gs-spscp-90, g-ct-58, g-scop-83, hdk-cgp-64, jk-spals-88, ls-esmpa-87, o-olafs-81, ss-pmp1c-83, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{h-zp-99m
-, author =	"H{\aa}kan Jonsson"
-, title =	"On the Zookeeper's Problem"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"141--144"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "H{\aa}kan Jonsson"
+, title =       "On the Zookeeper's Problem"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "141--144"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{js-csml-99
-, author =	"Denis Jordan and Marcel Steiner"
-, title =	"Configuration spaces of mechanical linkages"
-, journal =	"Discrete Comput. Geom."
-, volume =	22
-, year =	1999
-, pages =	"297--315"
-, update =	"02.03 orourke"
+, author =      "Denis Jordan and Marcel Steiner"
+, title =       "Configuration spaces of mechanical linkages"
+, journal =     "Discrete Comput. Geom."
+, volume =      22
+, year =        1999
+, pages =       "297--315"
+, update =      "02.03 orourke"
 }
 
 @misc{j-icm-93
-, author =	"H. F. Jordan"
-, title =	"Interview to 'Computerworld' magazine"
-, journal =	"Computerworld"
-, month =	mar
-, year =	1993
-, pages =	28
-, update =	"98.11 bibrelex"
+, author =      "H. F. Jordan"
+, title =       "Interview to 'Computerworld' magazine"
+, journal =     "Computerworld"
+, month =       mar
+, year =        1993
+, pages =       28
+, update =      "98.11 bibrelex"
 }
 
 @article{jhw-arn-86
-, author =	"C. Jorgensen and W. Hamel and C. Weisbin"
-, title =	"Autonomous Robot Navigation"
-, journal =	"Byte"
-, volume =	11
-, number =	1
-, month =	jan
-, year =	1986
-, pages =	"223--235"
-, update =	"93.09 milone+mitchell"
+, author =      "C. Jorgensen and W. Hamel and C. Weisbin"
+, title =       "Autonomous Robot Navigation"
+, journal =     "Byte"
+, volume =      11
+, number =      1
+, month =       jan
+, year =        1986
+, pages =       "223--235"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{jmo-acrbv-94
-, author =	"A. Josefczyk and J. Miller and J. O'Rourke"
-, title =	"Arkin's conjecture for rectangle and box visibility graphs"
-, type =	"Technical {Report}"
-, number =	036
-, institution =	"Dept. Comput. Sci., Smith College"
-, month =	jul
-, year =	1994
-, keywords =	"visibility graphs"
-, update =	"94.09 orourke"
+, author =      "A. Josefczyk and J. Miller and J. O'Rourke"
+, title =       "Arkin's conjecture for rectangle and box visibility graphs"
+, type =        "Technical {Report}"
+, number =      036
+, institution = "Dept. Comput. Sci., Smith College"
+, month =       jul
+, year =        1994
+, keywords =    "visibility graphs"
+, update =      "94.09 orourke"
 }
 
 @article{j-ptcme-83
-, author =	"D. Joseph"
-, title =	"Polynomial time computations in models of {ET}"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	26
-, year =	1983
-, pages =	"311--338"
+, author =      "D. Joseph"
+, title =       "Polynomial time computations in models of {ET}"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      26
+, year =        1983
+, pages =       "311--338"
 }
 
 @inproceedings{jmt-ddssu-92
-, author =	"D. Joseph and J. Meidanis and P. Tiwari"
-, title =	"Determining {DNA} sequence similarity using maximum independent set algorithms for interval graphs"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"326--337"
-, update =	"94.01 smid, 93.09 milone+mitchell"
+, author =      "D. Joseph and J. Meidanis and P. Tiwari"
+, title =       "Determining {DNA} sequence similarity using maximum independent set algorithms for interval graphs"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "326--337"
+, update =      "94.01 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{jp-crmpq-85
-, author =	"D. A. Joseph and W. H. Plantinga"
-, title =	"On the complexity of reachability and motion planning questions"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"62--66"
-, cites =	"h-sp-68, lw-apcfp-79, r-cmpg-79, b-pcfmp-83, ss-pmp2g-83, hss-cmpmi-84, hjw-mra2d-85, hjw-mp2dl-84, k-racpc-72, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. A. Joseph and W. H. Plantinga"
+, title =       "On the complexity of reachability and motion planning questions"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "62--66"
+, cites =       "h-sp-68, lw-apcfp-79, r-cmpg-79, b-pcfmp-83, ss-pmp2g-83, hss-cmpmi-84, hjw-mra2d-85, hjw-mp2dl-84, k-racpc-72, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{js-mbpsc-92
-, author =	"Eugene Joseph and Steven S. Skiena"
-, title =	"Model-Based Probing Strategies for Convex Polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, year =	1992
-, pages =	"209--221"
-, keywords =	"probing, model-based, convex polygons"
-, update =	"96.09 romanik"
+, author =      "Eugene Joseph and Steven S. Skiena"
+, title =       "Model-Based Probing Strategies for Convex Polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, year =        1992
+, pages =       "209--221"
+, keywords =    "probing, model-based, convex polygons"
+, update =      "96.09 romanik"
 }
 
 @article{js-ck-91
-, author =	"L. Joskowicz and E. Sacks"
-, title =	"Computational Kinematics"
-, journal =	"Artif. Intell."
-, volume =	51
-, number =	"1-3"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "L. Joskowicz and E. Sacks"
+, title =       "Computational Kinematics"
+, journal =     "Artif. Intell."
+, volume =      51
+, number =      "1-3"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{jss-kta-95
-, author =	"L. Joskowicz and E. Sacks and V. Srinivasan"
-, title =	"Kinematic tolerance analysis"
-, booktitle =	"Proc. 3rd ACM Symposium on Solid Modeling and Applications"
-, publisher =	"ACM Press"
-, year =	1995
-, update =	"98.03 bibrelex"
+, author =      "L. Joskowicz and E. Sacks and V. Srinivasan"
+, title =       "Kinematic tolerance analysis"
+, booktitle =   "Proc. 3rd ACM Symposium on Solid Modeling and Applications"
+, publisher =   "ACM Press"
+, year =        1995
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{js-himad-95
-, author =	"Leo Joskowitz and Elisha Sacks"
-, title =	"{HIPAIR}: {Interactive} Mechanism Analysis and Design Using Configuration Spaces"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"V5--V6"
-, keywords =	"video review"
-, cites =	"js-ck-91, sj-amksm-93, sj-cscmd-94, jss-kta-95, sj-ckahp-95, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Leo Joskowitz and Elisha Sacks"
+, title =       "{HIPAIR}: {Interactive} Mechanism Analysis and Design Using Configuration Spaces"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "V5--V6"
+, keywords =    "video review"
+, cites =       "js-ck-91, sj-amksm-93, sj-cscmd-94, jss-kta-95, sj-ckahp-95, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{jkk-kssp-01
-, author =	"Michael Joswig and Volker Kaibel and Friederike K{\"o}rner"
-, title =	"On the $k$-Systems of a Simple Polytope"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"140--141"
-, update =	"01.04 icking"
+, author =      "Michael Joswig and Volker Kaibel and Friederike K{\"o}rner"
+, title =       "On the $k$-Systems of a Simple Polytope"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "140--141"
+, update =      "01.04 icking"
 }
 
 @inproceedings{jz-pvhc-01
-, author =	"Michael Joswig and G{\"u}nter M. Ziegler"
-, title =	"Polytope Verification by Homology Computation"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"142--145"
-, update =	"01.04 icking"
+, author =      "Michael Joswig and G{\"u}nter M. Ziegler"
+, title =       "Polytope Verification by Homology Computation"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "142--145"
+, update =      "01.04 icking"
 }
 
 @inproceedings{jdl-macrd-98
-, author =	"A. Joukhadar and A. Deguet and C. Laugier"
-, title =	"Models and Algorithms for the Collision of Rigid and Deformable Bodies"
-, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
-, nickname =	"WAFR '98"
-, year =	1998
-, pages =	"to appear"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "A. Joukhadar and A. Deguet and C. Laugier"
+, title =       "Models and Algorithms for the Collision of Rigid and Deformable Bodies"
+, booktitle =   "Proc. 3rd Workshop Algorithmic Found. Robot."
+, nickname =    "WAFR '98"
+, year =        1998
+, pages =       "to appear"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{jrz-udpgu-95
-, author =	"G.-V. Jourdan and I. Rival and N. Zaguia"
-, title =	"Upward Drawing on the Plane Grid Using Less Ink"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"318--327"
-, keywords =	"graph drawing, order, upward"
-, update =	"95.01 tamassia"
+, author =      "G.-V. Jourdan and I. Rival and N. Zaguia"
+, title =       "Upward Drawing on the Plane Grid Using Less Ink"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "318--327"
+, keywords =    "graph drawing, order, upward"
+, update =      "95.01 tamassia"
 }
 
 @article{j-uphmm-91
-, author =	"K. I. Joy"
-, title =	"Utilizing parametric hyperpatch methods for modeling and display of free-form solids"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	4
-, year =	1991
-, pages =	"455--471"
-, keywords =	"Bsplines, hypermatch models, free form surfaces, free form solids, sweeping operation"
+, author =      "K. I. Joy"
+, title =       "Utilizing parametric hyperpatch methods for modeling and display of free-form solids"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      4
+, year =        1991
+, pages =       "455--471"
+, keywords =    "Bsplines, hypermatch models, free form surfaces, free form solids, sweeping operation"
 }
 
 @article{j-msndc-83
-, author =	"A. J{\'o}{\'z}wik"
-, title =	"A method for solving the $n$-dimensional convex hull problem"
-, journal =	"Pattern Recogn. Lett."
-, volume =	2
-, year =	1983
-, pages =	"23--25"
+, author =      "A. J{\'o}{\'z}wik"
+, title =       "A method for solving the $n$-dimensional convex hull problem"
+, journal =     "Pattern Recogn. Lett."
+, volume =      2
+, year =        1983
+, pages =       "23--25"
 }
 
 @article{j-rmils-83
-, author =	"A. J{\'o}{\'z}wik"
-, title =	"A recursive method for the investigation of the linear separability of two sets"
-, journal =	"Pattern Recogn."
-, volume =	11
-, year =	1983
-, pages =	"429--431"
+, author =      "A. J{\'o}{\'z}wik"
+, title =       "A recursive method for the investigation of the linear separability of two sets"
+, journal =     "Pattern Recogn."
+, volume =      11
+, year =        1983
+, pages =       "429--431"
 }
 
 @book{t-cseh-96
-, title =	"The Computer Science and Engineering Handbook"
-, editor =	"Allen B. Tucker, Jr."
-, publisher =	"CRC Press"
-, address =	"Boca Raton, FL"
-, year =	1996
-, isbn =	"0-8493-2909-4"
-, comments =	"contains survey articles, 130 chapters, 2500 pages"
-, update =	"98.07 bibrelex"
+, title =       "The Computer Science and Engineering Handbook"
+, editor =      "Allen B. Tucker, Jr."
+, publisher =   "CRC Press"
+, address =     "Boca Raton, FL"
+, year =        1996
+, isbn =        "0-8493-2909-4"
+, comments =    "contains survey articles, 130 chapters, 2500 pages"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{j-mbfip-94
-, author =	"Robert Juan-Arinyo"
-, title =	"Monotone Boolean Formulae for Isothetic Polyhedra"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"58--61"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Robert Juan-Arinyo"
+, title =       "Monotone Boolean Formulae for Isothetic Polyhedra"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "58--61"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @article{jvb-cprpv-96
-, author =	"R. Juan-Arinyo and A. Vinacua and P. Brunet"
-, title =	"Classification of a point with respect to a polyhedron vertex"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"157--168"
-, update =	"96.09 devillers"
+, author =      "R. Juan-Arinyo and A. Vinacua and P. Brunet"
+, title =       "Classification of a point with respect to a polyhedron vertex"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "157--168"
+, update =      "96.09 devillers"
 }
 
 @article{js-niqpr-91
-, author =	"E. Jucovic and S. Sevec"
-, title =	"Note on inscribability of quadrangular polyhedra with restricted number of edge-types"
-, journal =	"J. Geom."
-, volume =	42
-, number =	"1--2"
-, year =	1991
-, pages =	"126--131"
-, update =	"98.11 bibrelex"
+, author =      "E. Jucovic and S. Sevec"
+, title =       "Note on inscribability of quadrangular polyhedra with restricted number of edge-types"
+, journal =     "J. Geom."
+, volume =      42
+, number =      "1--2"
+, year =        1991
+, pages =       "126--131"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{j-levso-90
-, author =	"F. Juhnke"
-, title =	"{L{\"o}wner} ellipsoids via semiinfinite optimization and (quasi-) convexity theory"
-, type =	"Report"
-, number =	"4/90"
-, institution =	"Sektion Mathematik, Technische Universit{\"a}t Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "F. Juhnke"
+, title =       "{L{\"o}wner} ellipsoids via semiinfinite optimization and (quasi-) convexity theory"
+, type =        "Report"
+, number =      "4/90"
+, institution = "Sektion Mathematik, Technische Universit{\"a}t Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @techreport{j-ccdt-88
-, author =	"D. Jung"
-, title =	"On Constructing the Constrained {Delaunay} Triangulation"
-, type =	"report"
-, number =	100
-, institution =	"Electrical, Computer and Systems Engineering Department, Rensselaer Polytechnic Institute"
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "D. Jung"
+, title =       "On Constructing the Constrained {Delaunay} Triangulation"
+, type =        "report"
+, number =      100
+, institution = "Electrical, Computer and Systems Engineering Department, Rensselaer Polytechnic Institute"
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{j-oacdt-88
-, author =	"Dz-Mou Jung"
-, title =	"An Optimal Algorithm for Constrained {Delaunay} Triangulation"
-, booktitle =	"Proc. 26th Allerton Conf. Commun. Control Comput."
-, publisher =	"Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1988
-, pages =	"85--86"
-, annote =	"O(n log n) algorithm for CDT. First build DT, delete
-		 edges intersected by constraint edges and then builds
-		 CDT for the resulting simple polygons."
+, author =      "Dz-Mou Jung"
+, title =       "An Optimal Algorithm for Constrained {Delaunay} Triangulation"
+, booktitle =   "Proc. 26th Allerton Conf. Commun. Control Comput."
+, publisher =   "Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1988
+, pages =       "85--86"
+, annote =      "O(n log n) algorithm for CDT. First build DT, delete
+                 edges intersected by constraint edges and then builds
+                 CDT for the resulting simple polygons."
 }
 
 @article{j-udkkd-01
-, author =	"H. Jung"
-, title =	"{\"U}ber die kleinste {Kugel}, die eine r{\"a}umliche {Figur} einschlie{\ss}t"
-, journal =	"J. Reine Angew. Math."
-, volume =	123
-, year =	1901
-, pages =	"241--257"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "H. Jung"
+, title =       "{\"U}ber die kleinste {Kugel}, die eine r{\"a}umliche {Figur} einschlie{\ss}t"
+, journal =     "J. Reine Angew. Math."
+, volume =      123
+, year =        1901
+, pages =       "241--257"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{jlmo-pamlc-97
-, author =	"Michael J{\"u}nger and Eva K. Lee and Petra Mutzel and Thomas Odenthal"
-, title =	"A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, number =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"13--24"
-, keywords =	"graph drawing"
-, update =	"99.07 vismara, 98.11 bibrelex, 98.07 patrignani+tamassia+vismara"
+, author =      "Michael J{\"u}nger and Eva K. Lee and Petra Mutzel and Thomas Odenthal"
+, title =       "A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, number =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "13--24"
+, keywords =    "graph drawing"
+, update =      "99.07 vismara, 98.11 bibrelex, 98.07 patrignani+tamassia+vismara"
 }
 
 @inproceedings{jlm-pupqt-97
-, author =	"Michael J{\"u}nger and Sebastian Leipert and Petra Mutzel"
-, title =	"Pitfalls of Using {PQ-Trees} in Automatic Graph Drawing"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"193--204"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Michael J{\"u}nger and Sebastian Leipert and Petra Mutzel"
+, title =       "Pitfalls of Using {PQ-Trees} in Automatic Graph Drawing"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "193--204"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{jm-2lscm-97
-, author =	"Michael J{\"u}nger and Petra Mutzel"
-, title =	"2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms"
-, journal =	"J. Graph Algorithms Appl."
-, volume =	1
-, number =	1
-, year =	1997
-, pages =	"1--25"
-, url =	"https://www.cs.brown.edu/publications/jgaa/accepted/97/JuengerMutzel97.1.1.ps.gz"
-, keywords =	"graph drawing, straight-line, planarization, crossings, experiments"
-, succeeds =	"jm-eha2s-96"
-, update =	"99.07 vismara, 98.07 tamassia+vismara"
+, author =      "Michael J{\"u}nger and Petra Mutzel"
+, title =       "2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms"
+, journal =     "J. Graph Algorithms Appl."
+, volume =      1
+, number =      1
+, year =        1997
+, pages =       "1--25"
+, url = "https://www.cs.brown.edu/publications/jgaa/accepted/97/JuengerMutzel97.1.1.ps.gz"
+, keywords =    "graph drawing, straight-line, planarization, crossings, experiments"
+, succeeds =    "jm-eha2s-96"
+, update =      "99.07 vismara, 98.07 tamassia+vismara"
 }
 
 @inproceedings{jm-eha2s-96
-, author =	"Michael J{\"u}nger and Petra Mutzel"
-, title =	"Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"337--348"
-, keywords =	"graph drawing, straight-line, layered, crossings, experiments"
-, update =	"96.09 tamassia"
+, author =      "Michael J{\"u}nger and Petra Mutzel"
+, title =       "Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "337--348"
+, keywords =    "graph drawing, straight-line, layered, crossings, experiments"
+, update =      "96.09 tamassia"
 }
 
 @article{jm-mpsne-96
-, author =	"M. J{\"u}nger and P. Mutzel"
-, title =	"Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools"
-, journal =	"Algorithmica"
-, volume =	16
-, number =	1
-, year =	1996
-, pages =	"33--59"
-, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
-, keywords =	"graph drawing, planarization"
-, update =	"98.07 tamassia, 96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
+, author =      "M. J{\"u}nger and P. Mutzel"
+, title =       "Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools"
+, journal =     "Algorithmica"
+, volume =      16
+, number =      1
+, year =        1996
+, pages =       "33--59"
+, note =        "(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
+, keywords =    "graph drawing, planarization"
+, update =      "98.07 tamassia, 96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
 }
 
 @inproceedings{jm-pamps-95
-, author =	"M. J{\"u}nger and P. Mutzel"
-, title =	"The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"119--130"
-, keywords =	"graph drawing, planarization"
-, update =	"95.01 tamassia"
+, author =      "M. J{\"u}nger and P. Mutzel"
+, title =       "The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "119--130"
+, keywords =    "graph drawing, planarization"
+, update =      "95.01 tamassia"
 }
 
 @article{jp-gdco-93
-, author =	"M. J{\"u}nger and W. Pulleyblank"
-, title =	"Geometric duality and combinatorial optimization"
-, journal =	"Jahrb. Ueberbl. Math"
-, volume =	"??"
-, year =	1993
-, pages =	"1--24"
-, update =	"98.03 agarwal"
+, author =      "M. J{\"u}nger and W. Pulleyblank"
+, title =       "Geometric duality and combinatorial optimization"
+, journal =     "Jahrb. Ueberbl. Math"
+, volume =      "??"
+, year =        1993
+, pages =       "1--24"
+, update =      "98.03 agarwal"
 }
 
 @article{jp-npdmh-95
-, author =	"M. J{\"u}nger and W. Pulleyblank"
-, title =	"New primal and dual matching heuristics"
-, journal =	"Algorithmica"
-, volume =	13
-, number =	4
-, year =	1995
-, pages =	"357--380"
-, update =	"98.03 agarwal"
+, author =      "M. J{\"u}nger and W. Pulleyblank"
+, title =       "New primal and dual matching heuristics"
+, journal =     "Algorithmica"
+, volume =      13
+, number =      4
+, year =        1995
+, pages =       "357--380"
+, update =      "98.03 agarwal"
 }
 
 @incollection{jrr-tsp-95
-, author =	"M. J{\"u}nger and G. Reinelt and G. Rinaldi"
-, title =	"The Traveling Salesman Problem"
-, editor =	"M. O. Ball and T. L. Magnanti and C. L. Monma and G. L. Nemhauser"
-, booktitle =	"Network Models"
-, series =	"Handbook of Operations Research/Management Science"
-, publisher =	"Elsevier Science"
-, address =	"Amsterdam"
-, year =	1995
-, pages =	"225--330"
-, update =	"98.03 mitchell"
+, author =      "M. J{\"u}nger and G. Reinelt and G. Rinaldi"
+, title =       "The Traveling Salesman Problem"
+, editor =      "M. O. Ball and T. L. Magnanti and C. L. Monma and G. L. Nemhauser"
+, booktitle =   "Network Models"
+, series =      "Handbook of Operations Research/Management Science"
+, publisher =   "Elsevier Science"
+, address =     "Amsterdam"
+, year =        1995
+, pages =       "225--330"
+, update =      "98.03 mitchell"
 }
 
 @article{jrz-ccdt-91
-, author =	"M. J{\"u}nger and G. Reinelt and D. Zepf"
-, title =	"Computing Correct {Delaunay} Triangulations"
-, journal =	"Computing"
-, volume =	47
-, number =	1
-, year =	1991
-, pages =	"43--49"
-, keywords =	"Delaunay triangulation, computational geometry"
-, update =	"93.09 rote"
-, annote =	"For cc test need numbers up $6M^4$"
-, abstract =	"In recent years the practical computation of Delaunay
-		 triangulations, resp. Voronoi diagrams has received a
-		 lot of attention in the literature. While the Delaunay
-		 triangulation is an important basic tool in geometric
-		 optimization algorithms, it is nontrivial to achieve a
-		 numerically stable computer implementation. In this
-		 technical note we assume that all generating points are
-		 grid points of a regular M by M lattice in the plane.
-		 Depending on M we derive the necessary word length a
-		 binary computer must have for integer representation in
-		 order to obtain exact Delaunay triangulations. This
-		 analysis is carried out for the L//1-, L//2- and L//
-		 infinity -metric. (Author abstract) 4 Refs."
+, author =      "M. J{\"u}nger and G. Reinelt and D. Zepf"
+, title =       "Computing Correct {Delaunay} Triangulations"
+, journal =     "Computing"
+, volume =      47
+, number =      1
+, year =        1991
+, pages =       "43--49"
+, keywords =    "Delaunay triangulation, computational geometry"
+, update =      "93.09 rote"
+, annote =      "For cc test need numbers up $6M^4$"
+, abstract =    "In recent years the practical computation of Delaunay
+                 triangulations, resp. Voronoi diagrams has received a
+                 lot of attention in the literature. While the Delaunay
+                 triangulation is an important basic tool in geometric
+                 optimization algorithms, it is nontrivial to achieve a
+                 numerically stable computer implementation. In this
+                 technical note we assume that all generating points are
+                 grid points of a regular M by M lattice in the plane.
+                 Depending on M we derive the necessary word length a
+                 binary computer must have for integer representation in
+                 order to obtain exact Delaunay triangulations. This
+                 analysis is carried out for the L//1-, L//2- and L//
+                 infinity -metric. (Author abstract) 4 Refs."
 }
 
 @article{j-adsfk-78
-, author =	"D. L. B. Jupp"
-, title =	"Approximation to data by splines with free knots"
-, journal =	"SIAM J. Numer. Anal."
-, volume =	15
-, number =	2
-, year =	1978
-, pages =	"328--343"
-, update =	"96.09 orourke"
+, author =      "D. L. B. Jupp"
+, title =       "Approximation to data by splines with free knots"
+, journal =     "SIAM J. Numer. Anal."
+, volume =      15
+, number =      2
+, year =        1978
+, pages =       "328--343"
+, update =      "96.09 orourke"
 }
 
 @techreport{jl-dhdpo-79
-, author =	"H. Jurgensen and J. Loewer"
-, title =	"Drawing Hasse Diagrams of Partially Ordered Sets"
-, number =	"TI 5/79"
-, institution =	"Institut fur Theoretische Informatik, Technische Hochschule Darmstad"
-, year =	1979
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "H. Jurgensen and J. Loewer"
+, title =       "Drawing Hasse Diagrams of Partially Ordered Sets"
+, number =      "TI 5/79"
+, institution = "Institut fur Theoretische Informatik, Technische Hochschule Darmstad"
+, year =        1979
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{kan-w1cps-90
-, author =	"S. Kabadi and Y. P. Aneja and K. P. K. Nair"
-, title =	"Weighted $1$-center problem in a simple polygon"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"306--308"
-, cites =	"d-mstia-86, m-lpltw-84, m-bsb-89, psr-cgcsp-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. Kabadi and Y. P. Aneja and K. P. K. Nair"
+, title =       "Weighted $1$-center problem in a simple polygon"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "306--308"
+, cites =       "d-mstia-86, m-lpltw-84, m-bsb-89, psr-cgcsp-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{kc-scgts-85
-, author =	"S. N. Kabadi and R. Chandrasekaran"
-, title =	"Solvable classes of generalized traveling salesman problem"
-, year =	1985
-, note =	"??"
-, update =	"98.07 bibrelex"
+, author =      "S. N. Kabadi and R. Chandrasekaran"
+, title =       "Solvable classes of generalized traveling salesman problem"
+, year =        1985
+, note =        "??"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{kc-ttsp-90
-, author =	"S. N. Kabadi and R. Chandrasekaran"
-, title =	"Tree traveling salesman problem"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"366--371"
-, cites =	"gg-sosvm-64, k-sssgt-56, kc-scgts-85, llrs-tsp-85, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. N. Kabadi and R. Chandrasekaran"
+, title =       "Tree traveling salesman problem"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "366--371"
+, cites =       "gg-sosvm-64, k-sssgt-56, kc-scgts-85, llrs-tsp-85, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @book{k-sipan-59
-, author =	"M. Kac"
-, title =	"Statistical Independence in Probability , Analysis and Number Theory"
-, series =	"The Carus Mathematical Monographs"
-, volume =	12
-, publisher =	"Mathematical Association of America"
-, year =	1959
-, update =	"97.11 bibrelex"
+, author =      "M. Kac"
+, title =       "Statistical Independence in Probability , Analysis and Number Theory"
+, series =      "The Carus Mathematical Monographs"
+, volume =      12
+, publisher =   "Mathematical Association of America"
+, year =        1959
+, update =      "97.11 bibrelex"
 }
 
 @article{k-c-47
-, author =	"I. N. Kagno"
-, title =	"Corrections"
-, journal =	"Amer. J. Math."
-, volume =	69
-, year =	1947
-, pages =	872
-, update =	"97.11 bibrelex"
+, author =      "I. N. Kagno"
+, title =       "Corrections"
+, journal =     "Amer. J. Math."
+, volume =      69
+, year =        1947
+, pages =       872
+, update =      "97.11 bibrelex"
 }
 
 @article{k-dpgtg-47
-, author =	"I. N. Kagno"
-, title =	"Desargue's and Pappus' Graphs and their Groups"
-, journal =	"Amer. J. Math."
-, volume =	69
-, year =	1947
-, pages =	"859--862"
-, update =	"97.11 bibrelex"
+, author =      "I. N. Kagno"
+, title =       "Desargue's and Pappus' Graphs and their Groups"
+, journal =     "Amer. J. Math."
+, volume =      69
+, year =        1947
+, pages =       "859--862"
+, update =      "97.11 bibrelex"
 }
 
 @article{k-lgdlt-46
-, author =	"I. N. Kagno"
-, title =	"Linear Graphs of Degree $\leq 6$ and their Groups"
-, journal =	"Amer. J. Math."
-, volume =	68
-, year =	1946
-, pages =	"505--520"
-, update =	"97.11 bibrelex"
+, author =      "I. N. Kagno"
+, title =       "Linear Graphs of Degree $\leq 6$ and their Groups"
+, journal =     "Amer. J. Math."
+, volume =      68
+, year =        1946
+, pages =       "505--520"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{k-mdm-91
-, author =	"S. Kahan"
-, title =	"A model for data in motion"
-, booktitle =	"Proc. 23th Annu. ACM Sympos. Theory Comput."
-, year =	1991
-, pages =	"267--277"
-, update =	"94.05 franciosa"
+, author =      "S. Kahan"
+, title =       "A model for data in motion"
+, booktitle =   "Proc. 23th Annu. ACM Sympos. Theory Comput."
+, year =        1991
+, pages =       "267--277"
+, update =      "94.05 franciosa"
 }
 
 @phdthesis{k-rtpmd-91
-, author =	"S. Kahan"
-, title =	"Real time processing of moving data"
-, type =	"Ph.{D}. Dissertation"
-, school =	"University of Washington"
-, address =	"Seattle, WA"
-, year =	1991
-, keywords =	"doctoral thesis"
-, update =	"95.01 franciosa"
+, author =      "S. Kahan"
+, title =       "Real time processing of moving data"
+, type =        "Ph.{D}. Dissertation"
+, school =      "University of Washington"
+, address =     "Seattle, WA"
+, year =        1991
+, keywords =    "doctoral thesis"
+, update =      "95.01 franciosa"
 }
 
 @inproceedings{ks-bcmlp-96
-, author =	"Simon Kahan and Jack Snoeyink"
-, title =	"On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear time"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"151--158"
-, cites =	"abosy-fmcnp-89, ams-olpqs-92, c-tpca-82, d-haitn-83, dls-oaclc-92, g-cvpcs-91, gm-rad-95, ghms-apsml-93, hs-cmlpg-94, h-psifp-94, h-patmn-93, k-ealdp-89, lp-esppr-84, lpsssstwy-clcsp-88, m-cacau-89, m-dpggt-89, m-vigau-88p, m-pmsop-95, mrw-mlpop-92, ps-cgi-85, s-tfga-94, s-ltaml-86, s-mlppr-87, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Simon Kahan and Jack Snoeyink"
+, title =       "On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear time"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "151--158"
+, cites =       "abosy-fmcnp-89, ams-olpqs-92, c-tpca-82, d-haitn-83, dls-oaclc-92, g-cvpcs-91, gm-rad-95, ghms-apsml-93, hs-cmlpg-94, h-psifp-94, h-patmn-93, k-ealdp-89, lp-esppr-84, lpsssstwy-clcsp-88, m-cacau-89, m-dpggt-89, m-vigau-88p, m-pmsop-95, mrw-mlpop-92, ps-cgi-85, s-tfga-94, s-ltaml-86, s-mlppr-87, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @article{k-lmfp-87
-, author =	"J. Kahn"
-, title =	"On lattices with {M{\"o}bius} function $\pm1,0$"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"1--8"
-, update =	"93.09 rote"
+, author =      "J. Kahn"
+, title =       "On lattices with {M{\"o}bius} function $\pm1,0$"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "1--8"
+, update =      "93.09 rote"
 }
 
 @article{kkk-tgrfw-83
-, author =	"J. Kahn and M. M. Klawe and D. Kleitman"
-, title =	"Traditional galleries require fewer watchmen"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	4
-, year =	1983
-, pages =	"194--206"
-, update =	"96.09 agarwal, 94.05 devillers"
+, author =      "J. Kahn and M. M. Klawe and D. Kleitman"
+, title =       "Traditional galleries require fewer watchmen"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      4
+, year =        1983
+, pages =       "194--206"
+, update =      "96.09 agarwal, 94.05 devillers"
 }
 
 @techreport{kr-oadrp-90
-, author =	"Andrew Kahng and Gabriel Robins"
-, title =	"Optimal algorithms for determining regularity in pointsets"
-, type =	"Technical Report"
-, number =	"CSD-900045"
-, institution =	"UCLA CS Department"
-, year =	1990
-, precedes =	"kr-oadrp-91"
-, update =	"98.07 bibrelex"
+, author =      "Andrew Kahng and Gabriel Robins"
+, title =       "Optimal algorithms for determining regularity in pointsets"
+, type =        "Technical Report"
+, number =      "CSD-900045"
+, institution = "UCLA CS Department"
+, year =        1990
+, precedes =    "kr-oadrp-91"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{kr-oadrp-91
-, author =	"Andrew Kahng and Gabriel Robins"
-, title =	"Optimal algorithms for determining regularity in pointsets"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"167--170"
-, succeeds =	"kr-oadrp-90"
-, cites =	"bs-cht-90, dh-uhtdl-72, e-acg-87, eg-tsa-86, kr-oadrp-90, ps-cgi-85, r-trcad-89,"
-, update =	"98.07 bibrelex"
+, author =      "Andrew Kahng and Gabriel Robins"
+, title =       "Optimal algorithms for determining regularity in pointsets"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "167--170"
+, succeeds =    "kr-oadrp-90"
+, cites =       "bs-cht-90, dh-uhtdl-72, e-acg-87, eg-tsa-86, kr-oadrp-90, ps-cgi-85, r-trcad-89,"
+, update =      "98.07 bibrelex"
 }
 
 @article{kr-ncist-92
-, author =	"A. B. Kahng and G. Robins"
-, title =	"A new class of iterative {Steiner} tree heuristics with good performance"
-, journal =	"IEEE Trans. Comput. Aided Design"
-, volume =	11
-, year =	1992
-, pages =	"893--902"
-, update =	"98.03 bibrelex"
+, author =      "A. B. Kahng and G. Robins"
+, title =       "A new class of iterative {Steiner} tree heuristics with good performance"
+, journal =     "IEEE Trans. Comput. Aided Design"
+, volume =      11
+, year =        1992
+, pages =       "893--902"
+, update =      "98.03 bibrelex"
 }
 
 @misc{kt-rdgpm-89
-, author =	"Y. Kajitani and H. Takahashi"
-, title =	"Rectilinear Drawing of a Graph on a Plane with the Minimum Number of Segments"
-, year =	1989
-, note =	"presented at the 2nd Internat. Catania Combinatorial
+, author =      "Y. Kajitani and H. Takahashi"
+, title =       "Rectilinear Drawing of a Graph on a Plane with the Minimum Number of Segments"
+, year =        1989
+, note =        "presented at the 2nd Internat. Catania Combinatorial
                  Conf."
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{k-rtpp-82
-, author =	"J. Kajiya"
-, title =	"Ray tracing parametric patches"
-, journal =	"Comput. Graph."
-, volume =	16
-, number =	3
-, year =	1982
-, pages =	"245--254"
-, update =	"97.11 bibrelex"
+, author =      "J. Kajiya"
+, title =       "Ray tracing parametric patches"
+, journal =     "Comput. Graph."
+, volume =      16
+, number =      3
+, year =        1982
+, pages =       "245--254"
+, update =      "97.11 bibrelex"
 }
 
 @article{k-re-86
-, author =	"J. T. Kajiya"
-, title =	"The Rendering Equation"
-, journal =	"Comput. Graph."
-, volume =	20
-, year =	1986
-, pages =	"143--150"
-, update =	"98.03 bibrelex"
+, author =      "J. T. Kajiya"
+, title =       "The Rendering Equation"
+, journal =     "Comput. Graph."
+, volume =      20
+, year =        1986
+, pages =       "143--150"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{kt-alehd-97
-, author =	"Konstantinos G. Kakoulis and Ioannis G. Tollis"
-, title =	"An Algorithm for Labeling Edges of Hierarchical Drawings"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"169--180"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani+tamassia+vismara"
+, author =      "Konstantinos G. Kakoulis and Ioannis G. Tollis"
+, title =       "An Algorithm for Labeling Edges of Hierarchical Drawings"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "169--180"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani+tamassia+vismara"
 }
 
 @article{kt-celpp-01
-, author =	"K. G. Kakoulis and I. G. Tollis"
-, title =	"On the complexity of the edge label placement problem"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	18
-, year =	2001
-, pages =	"1--17"
-, update =	"01.04 smid"
+, author =      "K. G. Kakoulis and I. G. Tollis"
+, title =       "On the complexity of the edge label placement problem"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      18
+, year =        2001
+, pages =       "1--17"
+, update =      "01.04 smid"
 }
 
 @inproceedings{k-srsa-92
-, author =	"G. Kalai"
-, title =	"A subexponential randomized simplex algorithm"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"475--482"
+, author =      "G. Kalai"
+, title =       "A subexponential randomized simplex algorithm"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "475--482"
 }
 
 @article{k-ipcs-84
-, author =	"G. Kalai"
-, title =	"Intersection patterns of convex sets"
-, journal =	"Israel J. Math."
-, volume =	48
-, year =	1984
-, pages =	"161--174"
-, update =	"97.11 bibrelex"
+, author =      "G. Kalai"
+, title =       "Intersection patterns of convex sets"
+, journal =     "Israel J. Math."
+, volume =      48
+, year =        1984
+, pages =       "161--174"
+, update =      "97.11 bibrelex"
 }
 
 @article{k-mts-88
-, author =	"G. Kalai"
-, title =	"Many triangulated spheres"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"1--14"
+, author =      "G. Kalai"
+, title =       "Many triangulated spheres"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "1--14"
 }
 
 @incollection{k-psp-97
-, author =	"G. Kalai"
-, title =	"Polytope skeletons and paths"
-, chapter =	17
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"331--344"
-, update =	"97.11 orourke"
+, author =      "G. Kalai"
+, title =       "Polytope skeletons and paths"
+, chapter =     17
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "331--344"
+, update =      "97.11 orourke"
 }
 
 @article{kk-qpbdg-92
-, author =	"G. Kalai and D. J. Kleitman"
-, title =	"A quasi-polynomial bound for the diameter of graphs of polyhedra"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	26
-, year =	1992
-, pages =	"315--316"
-, update =	"97.03 gaertner+salinger"
+, author =      "G. Kalai and D. J. Kleitman"
+, title =       "A quasi-polynomial bound for the diameter of graphs of polyhedra"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      26
+, year =        1992
+, pages =       "315--316"
+, update =      "97.03 gaertner+salinger"
 }
 
 @book{kz-pcc-00
-, title =	"Polytopes -- Combinatorics and Computation"
-, editor =	"G. Kalai and G. Ziegler"
-, publisher =	"Birkh{\"a}user"
-, year =	2000
-, update =	"02.03 pocchiola"
+, title =       "Polytopes -- Combinatorics and Computation"
+, editor =      "G. Kalai and G. Ziegler"
+, publisher =   "Birkh{\"a}user"
+, year =        2000
+, update =      "02.03 pocchiola"
 }
 
 @article{km-dsanp-83
-, author =	"I. Kalantari and G. McDonald"
-, title =	"A data structure and an algorithm for the nearest point problem"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	"SE-9"
-, year =	1983
-, pages =	"631--634"
+, author =      "I. Kalantari and G. McDonald"
+, title =       "A data structure and an algorithm for the nearest point problem"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      "SE-9"
+, year =        1983
+, pages =       "631--634"
 }
 
 @article{k-dscpg-82
-, author =	"Y. E. Kalay"
-, title =	"Determining the spatial containment of a point in general polyhedra"
-, journal =	"Comput. Graph. Image Process."
-, volume =	19
-, year =	1982
-, pages =	"303--330"
-, update =	"98.11 bibrelex"
+, author =      "Y. E. Kalay"
+, title =       "Determining the spatial containment of a point in general polyhedra"
+, journal =     "Comput. Graph. Image Process."
+, volume =      19
+, year =        1982
+, pages =       "303--330"
+, update =      "98.11 bibrelex"
 }
 
 @book{k-moe-89
-, author =	"Y. E. Kalay"
-, title =	"Modeling Objects and Environments"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1989
-, keywords =	"CAD, geometric primitives, solid modeling, computational geometry"
-, update =	"99.11 bibrelex, 98.03 mitchell"
+, author =      "Y. E. Kalay"
+, title =       "Modeling Objects and Environments"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1989
+, keywords =    "CAD, geometric primitives, solid modeling, computational geometry"
+, update =      "99.11 bibrelex, 98.03 mitchell"
 }
 
 @techreport{k-vicgb-85
-, author =	"Y. E. Kalay"
-, title =	"Vertically integrated computational geometry based on the hybrid-edge data model"
-, type =	"Report"
-, number =	"??"
-, institution =	"Comput.-Aided Design Graph. Lab., School Architect., State Univ. New York Buffalo"
-, address =	"Buffalo, NY"
-, year =	1985
+, author =      "Y. E. Kalay"
+, title =       "Vertically integrated computational geometry based on the hybrid-edge data model"
+, type =        "Report"
+, number =      "??"
+, institution = "Comput.-Aided Design Graph. Lab., School Architect., State Univ. New York Buffalo"
+, address =     "Buffalo, NY"
+, year =        1985
 }
 
 @techreport{kr-nacap-84
-, author =	"R. Kalin and N. Ramsey"
-, title =	"A new analysis and comparison of algorithms for the planar segment intersection problem"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1984
+, author =      "R. Kalin and N. Ramsey"
+, title =       "A new analysis and comparison of algorithms for the planar segment intersection problem"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1984
 }
 
 @article{ks-dpbst-58
-, author =	"G. K. Kalisch and E. G. Straus"
-, title =	"On the Determination of Points in a {Banach} space by Their Distances from Points of a Given Set"
-, journal =	"Acad. Brasil. Ci."
-, volume =	29
-, year =	1958
-, pages =	"501--519"
-, update =	"99.11 bibrelex"
+, author =      "G. K. Kalisch and E. G. Straus"
+, title =       "On the Determination of Points in a {Banach} space by Their Distances from Points of a Given Set"
+, journal =     "Acad. Brasil. Ci."
+, volume =      29
+, year =        1958
+, pages =       "501--519"
+, update =      "99.11 bibrelex"
 }
 
 @techreport{k-chahd-81
-, author =	"M. Kallay"
-, title =	"Convex Hull Algorithms in Higher Dimensions"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "M. Kallay"
+, title =       "Convex Hull Algorithms in Higher Dimensions"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @article{k-chme-86
-, author =	"M. Kallay"
-, title =	"Convex hull made easy"
-, journal =	"Inform. Process. Lett."
-, volume =	22
-, year =	1986
-, pages =	161
+, author =      "M. Kallay"
+, title =       "Convex hull made easy"
+, journal =     "Inform. Process. Lett."
+, volume =      22
+, year =        1986
+, pages =       161
 }
 
 @article{k-cicha-84
-, author =	"M. Kallay"
-, title =	"The complexity of incremental convex hull algorithms in {$R^{d}$}"
-, journal =	"Inform. Process. Lett."
-, volume =	19
-, year =	1984
-, pages =	197
+, author =      "M. Kallay"
+, title =       "The complexity of incremental convex hull algorithms in {$R^{d}$}"
+, journal =     "Inform. Process. Lett."
+, volume =      19
+, year =        1984
+, pages =       197
 }
 
 @inproceedings{k-cirfc-89
-, author =	"E. Kaltofen"
-, title =	"Computing the irreducible real factors and components of an algebraic curve"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"79--87"
-, cites =	"acm-cad1b-84, c-qercf-75, ch-mrsp-74, c-sagcp-88, cg-stssa-83, j-ba1-74, k-ptrmb-85, k-fpait-85, k-ditpo-87, l-eaac-81, m-idp-64, r-fpade-88, s-ftatc-82, s-ndmea-54, t-iaf-84, w-ma-53, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex"
+, author =      "E. Kaltofen"
+, title =       "Computing the irreducible real factors and components of an algebraic curve"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "79--87"
+, cites =       "acm-cad1b-84, c-qercf-75, ch-mrsp-74, c-sagcp-88, cg-stssa-83, j-ba1-74, k-ptrmb-85, k-fpait-85, k-ditpo-87, l-eaac-81, m-idp-64, r-fpade-88, s-ftatc-82, s-ndmea-54, t-iaf-84, w-ma-53, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex"
 }
 
 @article{k-ditpo-87
-, author =	"E. Kaltofen"
-, title =	"Deterministic irreducibility testing of polynomials over large finite fields"
-, journal =	"J. Symbolic Comput."
-, volume =	4
-, year =	1987
-, pages =	"77--82"
-, update =	"98.03 bibrelex"
+, author =      "E. Kaltofen"
+, title =       "Deterministic irreducibility testing of polynomials over large finite fields"
+, journal =     "J. Symbolic Comput."
+, volume =      4
+, year =        1987
+, pages =       "77--82"
+, update =      "98.03 bibrelex"
 }
 
 @article{k-fpait-85
-, author =	"E. Kaltofen"
-, title =	"Fast parallel absolute irreducibility testing"
-, journal =	"J. Symbolic Computation 1"
-, volume =	"??"
-, year =	1985
-, pages =	"57--67"
-, update =	"98.03 bibrelex"
+, author =      "E. Kaltofen"
+, title =       "Fast parallel absolute irreducibility testing"
+, journal =     "J. Symbolic Computation 1"
+, volume =      "??"
+, year =        1985
+, pages =       "57--67"
+, update =      "98.03 bibrelex"
 }
 
 @article{k-ptrmb-85
-, author =	"E. Kaltofen"
-, title =	"Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"469--489"
-, update =	"98.03 bibrelex"
+, author =      "E. Kaltofen"
+, title =       "Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "469--489"
+, update =      "98.03 bibrelex"
 }
 
 @article{ksss-tdmbb-86
-, author =	"A. Kalvin and E. Schonberg and J. T. Schwartz and Micha Sharir"
-, title =	"Two dimensional model based boundary matching using footprints"
-, journal =	"Internat. J. Robot. Res."
-, volume =	5
-, number =	4
-, year =	1986
-, pages =	"38--55"
-, keywords =	"computer vision, curves, matchings, two-dimensional"
-, update =	"98.03 mitchell"
+, author =      "A. Kalvin and E. Schonberg and J. T. Schwartz and Micha Sharir"
+, title =       "Two dimensional model based boundary matching using footprints"
+, journal =     "Internat. J. Robot. Res."
+, volume =      5
+, number =      4
+, year =        1986
+, pages =       "38--55"
+, keywords =    "computer vision, curves, matchings, two-dimensional"
+, update =      "98.03 mitchell"
 }
 
 @article{kt-spmsb-96
-, author =	"A. D. Kalvin and R. H. Taylor"
-, title =	"Superfaces: Polygonal Mesh Simplification with Bounded Error"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	16
-, number =	3
-, month =	may
-, year =	1996
-, pages =	"64--77"
-, update =	"96.09 held"
+, author =      "A. D. Kalvin and R. H. Taylor"
+, title =       "Superfaces: Polygonal Mesh Simplification with Bounded Error"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      16
+, number =      3
+, month =       may
+, year =        1996
+, pages =       "64--77"
+, update =      "96.09 held"
 }
 
 @article{kp-caasu-93
-, author =	"B. Kalyanasundaram and K. Pruhs"
-, title =	"A competitive analysis of algorithms for searching unknown scenes"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"139--155"
-, succeeds =	"kp-cannb-92"
-, update =	"96.09 devillers"
+, author =      "B. Kalyanasundaram and K. Pruhs"
+, title =       "A competitive analysis of algorithms for searching unknown scenes"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "139--155"
+, succeeds =    "kp-cannb-92"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{kp-cannb-92
-, author =	"B. Kalyanasundaram and K. Pruhs"
-, title =	"A competitive analysis of nearest neighbor based algorithms for searching unknown scenes"
-, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	577
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"147--157"
-, precedes =	"kp-caasu-93"
-, update =	"96.09 devillers"
+, author =      "B. Kalyanasundaram and K. Pruhs"
+, title =       "A competitive analysis of nearest neighbor based algorithms for searching unknown scenes"
+, booktitle =   "Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      577
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "147--157"
+, precedes =    "kp-caasu-93"
+, update =      "96.09 devillers"
 }
 
 @article{kp-cctli-94
-, author =	"B. Kalyanasundaram and K. Pruhs"
-, title =	"Constructing Competitive Tours from Local Information"
-, journal =	"Theoret. Comput. Sci."
-, volume =	130
-, year =	1994
-, pages =	"125--138"
-, keywords =	"mapping an unknown environment, limited distance visibility, on-line d-sweeper problem, watchman route, competitive analysis, shortest paths, on-line navigation"
-, update =	"98.03 mitchell"
-, annote =	"Originally appeared in ICALP 1993."
+, author =      "B. Kalyanasundaram and K. Pruhs"
+, title =       "Constructing Competitive Tours from Local Information"
+, journal =     "Theoret. Comput. Sci."
+, volume =      130
+, year =        1994
+, pages =       "125--138"
+, keywords =    "mapping an unknown environment, limited distance visibility, on-line d-sweeper problem, watchman route, competitive analysis, shortest paths, on-line navigation"
+, update =      "98.03 mitchell"
+, annote =      "Originally appeared in ICALP 1993."
 }
 
 @incollection{kp-onop-98
-, author =	"Bala Kalyanasundaram and Kirk Pruhs"
-, title =	"Online Network Optimization Problems"
-, editor =	"Amos Fiat and Gerhard Woeginger"
-, booktitle =	"Online Algorithms: The State of the Art"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1442
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"268--280"
-, comments =	"chapter 8 of fw-ola-98"
-, update =	"02.03 icking, 98.07 bibrelex, 98.03 mitchell"
+, author =      "Bala Kalyanasundaram and Kirk Pruhs"
+, title =       "Online Network Optimization Problems"
+, editor =      "Amos Fiat and Gerhard Woeginger"
+, booktitle =   "Online Algorithms: The State of the Art"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1442
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "268--280"
+, comments =    "chapter 8 of fw-ola-98"
+, update =      "02.03 icking, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @phdthesis{k-vaor-88
-, author =	"T. Kamada"
-, title =	"On Visualization of Abstract Objects and Relations"
-, school =	"Department of Information Science, University of Tokyo"
-, year =	1988
-, keywords =	"doctoral thesis, graph drawing"
-, update =	"93.09 tamassia"
+, author =      "T. Kamada"
+, title =       "On Visualization of Abstract Objects and Relations"
+, school =      "Department of Information Science, University of Tokyo"
+, year =        1988
+, keywords =    "doctoral thesis, graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{k-sgdsa-89
-, author =	"T. Kamada"
-, title =	"Symmetric Graph Drawing by a Spring Algorithm and its Applications to Radial Drawing"
-, institution =	"Department of Information Science, University of Tokyo"
-, year =	1989
-, keywords =	"graph drawing"
-, update =	"98.07 tamassia, 93.09 tamassia"
+, author =      "T. Kamada"
+, title =       "Symmetric Graph Drawing by a Spring Algorithm and its Applications to Radial Drawing"
+, institution = "Department of Information Science, University of Tokyo"
+, year =        1989
+, keywords =    "graph drawing"
+, update =      "98.07 tamassia, 93.09 tamassia"
 }
 
 %  is this a book
 @book{k-vaor-89
-, author =	"T. Kamada"
-, title =	"Visualizing Abstract Objects and Relations"
-, publisher =	"World Scientific Series in Computer Science"
-, year =	1989
-, keywords =	"graph drawing"
-, update =	"94.05 devillers, 93.09 tamassia"
+, author =      "T. Kamada"
+, title =       "Visualizing Abstract Objects and Relations"
+, publisher =   "World Scientific Series in Computer Science"
+, year =        1989
+, keywords =    "graph drawing"
+, update =      "94.05 devillers, 93.09 tamassia"
 }
 
 @article{kk-athl-87
-, author =	"T. Kamada and S. Kawai"
-, title =	"An advanced treatment of hidden lines"
-, journal =	"ACM Trans. Graph."
-, volume =	6
-, year =	1987
-, pages =	"308--323"
+, author =      "T. Kamada and S. Kawai"
+, title =       "An advanced treatment of hidden lines"
+, journal =     "ACM Trans. Graph."
+, volume =      6
+, year =        1987
+, pages =       "308--323"
 }
 
 @article{kk-adgug-89
-, author =	"T. Kamada and S. Kawai"
-, title =	"An Algorithm for Drawing General Undirected Graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	31
-, year =	1989
-, pages =	"7--15"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "T. Kamada and S. Kawai"
+, title =       "An Algorithm for Drawing General Undirected Graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      31
+, year =        1989
+, pages =       "7--15"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{kk-adnsh-88
-, author =	"T. Kamada and S. Kawai"
-, title =	"Automatic Display of Network Structures for Human Understanding"
-, number =	"88-007"
-, institution =	"Department of Information Science, University of Tokyo"
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "T. Kamada and S. Kawai"
+, title =       "Automatic Display of Network Structures for Human Understanding"
+, number =      "88-007"
+, institution = "Department of Information Science, University of Tokyo"
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{kd-mppmr-86
-, author =	"S. Kambhampati and L. S. Davis"
-, title =	"Multiresolution Path Planning for Mobile Robots"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	"RA-2"
-, number =	3
-, month =	sep
-, year =	1986
-, pages =	"135--145"
-, keywords =	"quadtree, shortest paths"
+, author =      "S. Kambhampati and L. S. Davis"
+, title =       "Multiresolution Path Planning for Mobile Robots"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      "RA-2"
+, number =      3
+, month =       sep
+, year =        1986
+, pages =       "135--145"
+, keywords =    "quadtree, shortest paths"
 }
 
 @article{k-vrrpd-75
-, author =	"T. Kameda"
-, title =	"On the vector representation of the reachability in planar directed graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	3
-, number =	3
-, year =	1975
-, pages =	"75--77"
-, update =	"98.03 bibrelex"
+, author =      "T. Kameda"
+, title =       "On the vector representation of the reachability in planar directed graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      3
+, number =      3
+, year =        1975
+, pages =       "75--77"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{kf-hrtir-94
-, author =	"I. Kamel and C. Faloutsos"
-, title =	"Hilbert {R}-tree: {A}n improved {R}-tree using fractals"
-, booktitle =	"Proc. 20th VLDB Conference"
-, year =	1994
-, pages =	"500--510"
-, update =	"97.07 agarwal"
+, author =      "I. Kamel and C. Faloutsos"
+, title =       "Hilbert {R}-tree: {A}n improved {R}-tree using fractals"
+, booktitle =   "Proc. 20th VLDB Conference"
+, year =        1994
+, pages =       "500--510"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{kf-prt-93
-, author =	"I. Kamel and C. Faloutsos"
-, title =	"On packing {R}-trees"
-, booktitle =	"Proc. 2nd Internat. Conf. on Information and Knowledge Management"
-, year =	1993
-, pages =	"490--499"
-, update =	"97.07 agarwal"
+, author =      "I. Kamel and C. Faloutsos"
+, title =       "On packing {R}-trees"
+, booktitle =   "Proc. 2nd Internat. Conf. on Information and Knowledge Management"
+, year =        1993
+, pages =       "490--499"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{kf-prt-92
-, author =	"I. Kamel and C. Faloutsos"
-, title =	"Parallel {R}-trees"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1992
-, pages =	"195--204"
-, update =	"97.07 agarwal"
+, author =      "I. Kamel and C. Faloutsos"
+, title =       "Parallel {R}-trees"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1992
+, pages =       "195--204"
+, update =      "97.07 agarwal"
 }
 
 @book{k-dv1-83
-, author =	"E. Kamke"
-, title =	"Differentialgleichungen, Volume I"
-, publisher =	"B. G. Teubner"
-, address =	"Stuttgart"
-, year =	1983
-, update =	"98.11 bibrelex"
+, author =      "E. Kamke"
+, title =       "Differentialgleichungen, Volume I"
+, publisher =   "B. G. Teubner"
+, address =     "Stuttgart"
+, year =        1983
+, update =      "98.11 bibrelex"
 }
 
 @article{k-amrts-84
-, author =	"K. Kammerlander"
-, title =	"C 900 - An Advanced Mobile Radio Telephone System with Optimum Frequency Utilization"
-, journal =	"IEEE Trans. Selected Areas in Communication"
-, volume =	2
-, year =	1984
-, pages =	"589--597"
-, update =	"98.07 bibrelex"
+, author =      "K. Kammerlander"
+, title =       "C 900 - An Advanced Mobile Radio Telephone System with Optimum Frequency Utilization"
+, journal =     "IEEE Trans. Selected Areas in Communication"
+, volume =      2
+, year =        1984
+, pages =       "589--597"
+, update =      "98.07 bibrelex"
 }
 
 @article{k-ker-32
-, author =	"R. E. van Kampen"
-, title =	"Komplexe in euklidischen {R\"aumen}"
-, journal =	"Abh. Math. Sem. Hamburg"
-, volume =	9
-, year =	1932
-, pages =	"72--78"
-, note =	"Berightigung dazu, {\em ibid.} (1932) 152--153"
-, update =	"95.01 matousek"
+, author =      "R. E. van Kampen"
+, title =       "Komplexe in euklidischen {R\"aumen}"
+, journal =     "Abh. Math. Sem. Hamburg"
+, volume =      9
+, year =        1932
+, pages =       "72--78"
+, note =        "Berightigung dazu, {\em ibid.} (1932) 152--153"
+, update =      "95.01 matousek"
 }
 
 @article{k-tow-80
-, author =	"T. Kanade"
-, title =	"A theory of origami world"
-, journal =	"Artif. Intell."
-, volume =	13
-, year =	1980
-, pages =	"279--311"
-, update =	"97.11 bibrelex"
+, author =      "T. Kanade"
+, title =       "A theory of origami world"
+, journal =     "Artif. Intell."
+, volume =      13
+, year =        1980
+, pages =       "279--311"
+, update =      "97.11 bibrelex"
 }
 
 @article{kg-cfpaa-91
-, author =	"S. Kanaganathan and N. B. Goldstein"
-, title =	"Comparison Of Four-Point Adding Algorithms For Delaunay-Type Three Dimensional Mesh Generators"
-, journal =	"IEEE Trans. Magn."
-, volume =	27
-, number =	3
-, month =	may
-, year =	1991
-, pages =	"3444--3451"
-, keywords =	"three-dimensional tetrahedral meshes, Delaunay triangulation, Dirichlet tessellation, pascal primitives, point adding algorithms"
-, annote =	"Does not understand what DT is! Three of the
-		 algorithms do not give DT (and give bad meshes.)"
-, abstract =	"Four different approaches to generating
-		 three-dimensional tetrahedral meshes were tested and
-		 compared in regard to the complexity and quality of the
-		 elements they produce as points are added into the
-		 existing coarse meshes. Points are added according to
-		 Delaunay triangulation. It was found that there is a
-		 marked difference between the different approaches and
-		 that the method suggested by D. F. Watson (1981) is the
-		 better one in terms of quality of the meshes generated,
-		 although its time complexity is a little higher than
-		 that of the other methods. 8 Refs."
+, author =      "S. Kanaganathan and N. B. Goldstein"
+, title =       "Comparison Of Four-Point Adding Algorithms For Delaunay-Type Three Dimensional Mesh Generators"
+, journal =     "IEEE Trans. Magn."
+, volume =      27
+, number =      3
+, month =       may
+, year =        1991
+, pages =       "3444--3451"
+, keywords =    "three-dimensional tetrahedral meshes, Delaunay triangulation, Dirichlet tessellation, pascal primitives, point adding algorithms"
+, annote =      "Does not understand what DT is! Three of the
+                 algorithms do not give DT (and give bad meshes.)"
+, abstract =    "Four different approaches to generating
+                 three-dimensional tetrahedral meshes were tested and
+                 compared in regard to the complexity and quality of the
+                 elements they produce as points are added into the
+                 existing coarse meshes. Points are added according to
+                 Delaunay triangulation. It was found that there is a
+                 marked difference between the different approaches and
+                 that the method suggested by D. F. Watson (1981) is the
+                 better one in terms of quality of the meshes generated,
+                 although its time complexity is a little higher than
+                 that of the other methods. 8 Refs."
 }
 
 @inproceedings{kna-eegpp-92
-, author =	"N. Kanamaru and T. Nishizeki and T. Asano"
-, title =	"Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming"
-, booktitle =	"Integer Programming and Combinatorial Optimization"
-, year =	1992
-, pages =	"??"
-, precedes =	"kna-eegpp-94"
-, update =	"96.09 devillers, 93.09 milone+mitchell"
+, author =      "N. Kanamaru and T. Nishizeki and T. Asano"
+, title =       "Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming"
+, booktitle =   "Integer Programming and Combinatorial Optimization"
+, year =        1992
+, pages =       "??"
+, precedes =    "kna-eegpp-94"
+, update =      "96.09 devillers, 93.09 milone+mitchell"
 }
 
 @article{kna-eegpp-94
-, author =	"N. Kanamaru and T. Nishizeki and T. Asano"
-, title =	"Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"69--85"
-, keywords =	"convex polygon, grid point enumeration, integer programming, polygon filling"
-, succeeds =	"kna-eegpp-92"
-, update =	"96.09 devillers"
+, author =      "N. Kanamaru and T. Nishizeki and T. Asano"
+, title =       "Efficient Enumeration of Grid Points in a Polygon and its Application to Integer Programming"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "69--85"
+, keywords =    "convex polygon, grid point enumeration, integer programming, polygon filling"
+, succeeds =    "kna-eegpp-92"
+, update =      "96.09 devillers"
 }
 
 @book{k-gcmv-93
-, author =	"K. Kanatani"
-, title =	"Geometric Computation for Machine Vision"
-, publisher =	"Clarendon Press"
-, address =	"Oxford"
-, year =	1993
-, update =	"98.07 orourke"
+, author =      "K. Kanatani"
+, title =       "Geometric Computation for Machine Vision"
+, publisher =   "Clarendon Press"
+, address =     "Oxford"
+, year =        1993
+, update =      "98.07 orourke"
 }
 
 @techreport{kd-mtspp-??
-, author =	"Y. Kanayama and G. R. DeHaan"
-, title =	"A Mathematical Theory of Safe Path Planning"
-, type =	"Technical {Report}"
-, institution =	"Department of Computer Science, University of California, Santa Barbara"
-, year =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Y. Kanayama and G. R. DeHaan"
+, title =       "A Mathematical Theory of Safe Path Planning"
+, type =        "Technical {Report}"
+, institution = "Department of Computer Science, University of California, Santa Barbara"
+, year =        "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{k-bpppt-97
-, author =	"Atsushi Kaneko"
-, title =	"A Balanced Partition of Points in the Plane and Tree Embedding Problems"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"56--58"
-, update =	"97.11 jones"
+, author =      "Atsushi Kaneko"
+, title =       "A Balanced Partition of Points in the Plane and Tree Embedding Problems"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "56--58"
+, update =      "97.11 jones"
 }
 
 @book{kp-td-86
-, title =	"The Theory of Databases"
-, editor =	"Paris C. Kanellakis and Franco P. Preparata"
-, series =	"Adv. Comput. Res."
-, volume =	3
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1986
-, update =	"01.04 icking"
+, title =       "The Theory of Databases"
+, editor =      "Paris C. Kanellakis and Franco P. Preparata"
+, series =      "Adv. Comput. Res."
+, volume =      3
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1986
+, update =      "01.04 icking"
 }
 
 @inproceedings{krvv-idmcc-93
-, author =	"P. C. Kanellakis and S. Ramaswamy and D. E. Vengroff and J. S. Vitter"
-, title =	"Indexing for data models with constraints and classes"
-, booktitle =	"Proc. 12th ACM SIGACT-SIGMOD-SIGART Conf. Princ. Database Sys."
-, year =	1993
-, pages =	"233--243"
-, update =	"93.09 vengroff"
+, author =      "P. C. Kanellakis and S. Ramaswamy and D. E. Vengroff and J. S. Vitter"
+, title =       "Indexing for data models with constraints and classes"
+, booktitle =   "Proc. 12th ACM SIGACT-SIGMOD-SIGART Conf. Princ. Database Sys."
+, year =        1993
+, pages =       "233--243"
+, update =      "93.09 vengroff"
 }
 
 @inproceedings{ko-ichspa-00
-, author =	"Biliana Kaneva and J. O'Rourke"
-, title =	"An Implementation of {Chen \& Han's} Shortest Paths Algorithm"
-, booktitle =	"Proc. 12th Canad. Conf. Comput. Geom."
-, site =	"New Brunswick"
-, month =	aug
-, year =	2000
-, pages =	"139--146"
-, url =	"https://www.science.smith.edu/~jorourke/ShortestPaths//"
-, keywords =	"shortest paths"
-, update =	"02.03 icking, 01.11 orourke, 01.04 icking+orourke, 00.11 smid, 00.07 orourke"
+, author =      "Biliana Kaneva and J. O'Rourke"
+, title =       "An Implementation of {Chen \& Han's} Shortest Paths Algorithm"
+, booktitle =   "Proc. 12th Canad. Conf. Comput. Geom."
+, site =        "New Brunswick"
+, month =       aug
+, year =        2000
+, pages =       "139--146"
+, url = "https://www.science.smith.edu/~jorourke/ShortestPaths//"
+, keywords =    "shortest paths"
+, update =      "02.03 icking, 01.11 orourke, 01.04 icking+orourke, 00.11 smid, 00.07 orourke"
 }
 
 @article{k-csptg-90
-, author =	"A. Kanevsky"
-, title =	"A Characterization of Separating Pairs and Triplets in a Graph"
-, journal =	"Congr. Numer."
-, volume =	74
-, year =	1990
-, pages =	"213--232"
-, update =	"94.01 tamassia"
+, author =      "A. Kanevsky"
+, title =       "A Characterization of Separating Pairs and Triplets in a Graph"
+, journal =     "Congr. Numer."
+, volume =      74
+, year =        1990
+, pages =       "213--232"
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{ktdc-olmfc-91
-, author =	"A. Kanevsky and R. Tamassia and G. {Di Battista} and J. Chen"
-, title =	"On-line Maintenance of the Four-Connected Components of a Graph"
-, booktitle =	"Proc. Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"793--801"
-, update =	"94.05 tamassia"
+, author =      "A. Kanevsky and R. Tamassia and G. {Di Battista} and J. Chen"
+, title =       "On-line Maintenance of the Four-Connected Components of a Graph"
+, booktitle =   "Proc. Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "793--801"
+, update =      "94.05 tamassia"
 }
 
 @article{k-ccchf-85
-, author =	"B. S. Kang"
-, title =	"Computer construction of the convex hull of a finite set of points in space ({Chinese} {English} summary)"
-, journal =	"J. Northwest Univ."
-, volume =	15
-, year =	1985
-, pages =	"17--23"
+, author =      "B. S. Kang"
+, title =       "Computer construction of the convex hull of a finite set of points in space ({Chinese} {English} summary)"
+, journal =     "J. Northwest Univ."
+, volume =      15
+, year =        1985
+, pages =       "17--23"
 }
 
 @inproceedings{kg-srrg-92
-, author =	"D. Kang and K. Y. Goldberg"
-, title =	"Shape recognition by random grasping"
-, booktitle =	"Proc. IEEE Internat. Conf. Intell. Robots Syst."
-, month =	jul
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "D. Kang and K. Y. Goldberg"
+, title =       "Shape recognition by random grasping"
+, booktitle =   "Proc. IEEE Internat. Conf. Intell. Robots Syst."
+, month =       jul
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @article{kg-sprg-95
-, author =	"Dukhyun Kang and Kenneth Y. Goldberg"
-, title =	"Sorting Parts by Random Grasping"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	11
-, number =	1
-, month =	feb
-, year =	1995
-, pages =	"146--152"
-, keywords =	"probing, diameter probes, parallel-jaw gripper, random grasping"
-, update =	"96.09 romanik"
+, author =      "Dukhyun Kang and Kenneth Y. Goldberg"
+, title =       "Sorting Parts by Random Grasping"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      11
+, number =      1
+, month =       feb
+, year =        1995
+, pages =       "146--152"
+, keywords =    "probing, diameter probes, parallel-jaw gripper, random grasping"
+, update =      "96.09 romanik"
 }
 
 @phdthesis{k-tpgc-90
-, author =	"Mohan Kankanhalli"
-, title =	"Techniques for Parallel Geometric Computations"
-, school =	"Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
-, month =	oct
-, year =	1990
-, keywords =	"doctoral thesis, area, parallel computation, grids"
-, update =	"93.09 franklin"
+, author =      "Mohan Kankanhalli"
+, title =       "Techniques for Parallel Geometric Computations"
+, school =      "Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
+, month =       oct
+, year =        1990
+, keywords =    "doctoral thesis, area, parallel computation, grids"
+, update =      "93.09 franklin"
 }
 
 @techreport{kf-apcus-92
-, author =	"Mohan Kankanhalli and Wm. Randolph Franklin"
-, title =	"Area and Perimeter Computation of the Union of a Set of Iso-Rectangles in Parallel"
-, type =	"Technical {Report}"
-, number =	"TR92-81-0"
-, institution =	"Institute Of Systems Science, National University of Singapore"
-, address =	"Kent Ridge, Singapore 0511"
-, year =	1992
-, keywords =	"intersection, parallel computation, grids, area"
-, update =	"93.09 franklin"
+, author =      "Mohan Kankanhalli and Wm. Randolph Franklin"
+, title =       "Area and Perimeter Computation of the Union of a Set of Iso-Rectangles in Parallel"
+, type =        "Technical {Report}"
+, number =      "TR92-81-0"
+, institution = "Institute Of Systems Science, National University of Singapore"
+, address =     "Kent Ridge, Singapore 0511"
+, year =        1992
+, keywords =    "intersection, parallel computation, grids, area"
+, update =      "93.09 franklin"
 }
 
 @techreport{k-cgrw-93
-, author =	"Ravi Kannan"
-, title =	"Convergence of a geometric random walk"
-, institution =	"Princeton University"
-, month =	feb
-, year =	1993
-, comments =	"DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
-, update =	"93.09 milone+mitchell"
+, author =      "Ravi Kannan"
+, title =       "Convergence of a geometric random walk"
+, institution = "Princeton University"
+, month =       feb
+, year =        1993
+, comments =    "DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{k-iaipr-83
-, author =	"R. Kannan"
-, title =	"Improved algorithms for integer programming and related lattice problems"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
-, year =	1983
-, pages =	"193--206"
-, precedes =	"k-mcbti-87"
+, author =      "R. Kannan"
+, title =       "Improved algorithms for integer programming and related lattice problems"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Theory Comput."
+, year =        1983
+, pages =       "193--206"
+, precedes =    "k-mcbti-87"
 }
 
 @article{k-mcbti-87
-, author =	"R. Kannan"
-, title =	"Minkowski's convex body theorem and integer programming"
-, journal =	"Math. Oper. Res."
-, volume =	12
-, year =	1987
-, pages =	"415--440"
-, succeeds =	"k-iaipr-83"
+, author =      "R. Kannan"
+, title =       "Minkowski's convex body theorem and integer programming"
+, journal =     "Math. Oper. Res."
+, volume =      12
+, year =        1987
+, pages =       "415--440"
+, succeeds =    "k-iaipr-83"
 }
 
 @techreport{k-rwcs-92
-, author =	"R. Kannan"
-, title =	"Random Walks in Convex Sets"
-, type =	"Manuscript"
-, institution =	"Indian Institute of Technology"
-, address =	"New Delhi"
-, year =	1992
-, note =	"Presented at Workshop on Approximation Algorithms"
-, update =	"93.09 milone+mitchell"
+, author =      "R. Kannan"
+, title =       "Random Walks in Convex Sets"
+, type =        "Manuscript"
+, institution = "Indian Institute of Technology"
+, address =     "New Delhi"
+, year =        1992
+, note =        "Presented at Workshop on Approximation Algorithms"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{kb-ptacs-79
-, author =	"R. Kannan and A. Bachem"
-, title =	"Polynomial time algorithms for computing the {Smith} and {Hermite} normal forms of an integer matrix"
-, journal =	"SIAM J. Comput."
-, volume =	8
-, year =	1979
-, pages =	"499--507"
-, update =	"97.11 bibrelex"
+, author =      "R. Kannan and A. Bachem"
+, title =       "Polynomial time algorithms for computing the {Smith} and {Hermite} normal forms of an integer matrix"
+, journal =     "SIAM J. Comput."
+, volume =      8
+, year =        1979
+, pages =       "499--507"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{knr-irg-88
-, author =	"S. Kannan and M. Naor and S. Rudich"
-, title =	"Implicit representation of graphs"
-, booktitle =	"Proc. 20th ACM Sympoos. Theory. Comput."
-, year =	1988
-, pages =	"334--343"
-, update =	"98.11 bibrelex"
+, author =      "S. Kannan and M. Naor and S. Rudich"
+, title =       "Implicit representation of graphs"
+, booktitle =   "Proc. 20th ACM Sympoos. Theory. Comput."
+, year =        1988
+, pages =       "334--343"
+, update =      "98.11 bibrelex"
 }
 
 @article{ks-tpp-92
-, author =	"S. Kannan and D. Soroker"
-, title =	"Tiling polygons with parallelograms"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"175--188"
+, author =      "S. Kannan and D. Soroker"
+, title =       "Tiling polygons with parallelograms"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "175--188"
 }
 
 @incollection{km-alnor-93
-, author =	"Sampath K. Kannan and Eugene W. Myers"
-, title =	"An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score"
-, booktitle =	"Combinatorial Pattern Matching"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	"??"
-, institution =	"University of Arizona, USA"
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Sampath K. Kannan and Eugene W. Myers"
+, title =       "An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score"
+, booktitle =   "Combinatorial Pattern Matching"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      "??"
+, institution = "University of Arizona, USA"
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{k-sletm-97
-, author =	"M. Kano"
-, title =	"A Straight-Line Embedding of Two or More Rooted Trees in the Plane"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"50--55"
-, update =	"97.11 jones"
+, author =      "M. Kano"
+, title =       "A Straight-Line Embedding of Two or More Rooted Trees in the Plane"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "50--55"
+, update =      "97.11 jones"
 }
 
 @inproceedings{k-mcvr-93
-, author =	"G. Kant"
-, title =	"A More Compact Visibility Representation"
-, editor =	"J. van Leeuwen"
-, booktitle =	"Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '93"
-, series =	"Lecture Notes Comput. Sci."
-, publisher =	"Springer-Verlag"
-, year =	1993
-, precedes =	"k-mcvr-97"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 97.07 devillers, 94.01 tamassia, 93.09 milone+mitchell"
+, author =      "G. Kant"
+, title =       "A More Compact Visibility Representation"
+, editor =      "J. van Leeuwen"
+, booktitle =   "Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '93"
+, series =      "Lecture Notes Comput. Sci."
+, publisher =   "Springer-Verlag"
+, year =        1993
+, precedes =    "k-mcvr-97"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 97.07 devillers, 94.01 tamassia, 93.09 milone+mitchell"
 }
 
 @article{k-mcvr-97
-, author =	"G. Kant"
-, title =	"A More Compact Visibility Representation"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"197--210"
-, succeeds =	"k-mcvr-93"
-, update =	"98.07 tamassia, 97.07 devillers"
-, annote =	"$\lfloor 3/2 n \rfloor - 3) \times (n-1)$"
+, author =      "G. Kant"
+, title =       "A More Compact Visibility Representation"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "197--210"
+, succeeds =    "k-mcvr-93"
+, update =      "98.07 tamassia, 97.07 devillers"
+, annote =      "$\lfloor 3/2 n \rfloor - 3) \times (n-1)$"
 }
 
 % ### same pages as k-dpgul-92
 @inproceedings{k-mpgdg-92
-, author =	"G. Kant"
-, title =	"A New Method for Planar Graph Drawings on a Grid"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"101--110"
-, update =	"99.03 forrest, 98.11 bibrelex"
+, author =      "G. Kant"
+, title =       "A New Method for Planar Graph Drawings on a Grid"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "101--110"
+, update =      "99.03 forrest, 98.11 bibrelex"
 }
 
 @phdthesis{k-adpg-93
-, author =	"G. Kant"
-, title =	"Algorithms for Drawing Planar Graphs"
-, school =	"Dept. Comput. Sci., Univ. Utrecht"
-, address =	"Utrecht, Netherlands"
-, year =	1993
-, keywords =	"doctoral thesis, graph drawing"
-, update =	"94.05 tamassia"
+, author =      "G. Kant"
+, title =       "Algorithms for Drawing Planar Graphs"
+, school =      "Dept. Comput. Sci., Univ. Utrecht"
+, address =     "Utrecht, Netherlands"
+, year =        1993
+, keywords =    "doctoral thesis, graph drawing"
+, update =      "94.05 tamassia"
 }
 
 @techreport{k-ompab-92
-, author =	"G. Kant"
-, title =	"An ${O}(n^2)$ Maximal Planarization Algorithm based on {PQ}-trees"
-, number =	"RUU-CS-92-03"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1992
-, keywords =	"graph drawing"
-, update =	"94.05 schwarzkopf, 93.09 tamassia"
+, author =      "G. Kant"
+, title =       "An ${O}(n^2)$ Maximal Planarization Algorithm based on {PQ}-trees"
+, number =      "RUU-CS-92-03"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1992
+, keywords =    "graph drawing"
+, update =      "94.05 schwarzkopf, 93.09 tamassia"
 }
 
 @article{k-dpguc-96
-, author =	"G. Kant"
-, title =	"Drawing Planar Graphs Using the Canonical Ordering"
-, journal =	"Algorithmica"
-, volume =	16
-, year =	1996
-, pages =	"4--32"
-, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
-, keywords =	"graph drawing, planar, orthogonal, straight-line, polyline, convex, angular resolution"
-, succeeds =	"k-dpgul-92"
-, update =	"96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
+, author =      "G. Kant"
+, title =       "Drawing Planar Graphs Using the Canonical Ordering"
+, journal =     "Algorithmica"
+, volume =      16
+, year =        1996
+, pages =       "4--32"
+, note =        "(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
+, keywords =    "graph drawing, planar, orthogonal, straight-line, polyline, convex, angular resolution"
+, succeeds =    "k-dpgul-92"
+, update =      "96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
 }
 
 @inproceedings{k-dpgul-92
-, author =	"G. Kant"
-, title =	"Drawing Planar Graphs Using the {\it{}lmc}-Ordering"
-, booktitle =	"Proc. 33th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"101--110"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "G. Kant"
+, title =       "Drawing Planar Graphs Using the {\it{}lmc}-Ordering"
+, booktitle =   "Proc. 33th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "101--110"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{k-hgd-92t
-, author =	"G. Kant"
-, title =	"Hexagonal Grid Drawings"
-, number =	"RUU-CS-92-06"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1992
-, keywords =	"graph drawing"
-, update =	"94.05 schwarzkopf, 93.09 milone+mitchell+tamassia"
+, author =      "G. Kant"
+, title =       "Hexagonal Grid Drawings"
+, number =      "RUU-CS-92-06"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1992
+, keywords =    "graph drawing"
+, update =      "94.05 schwarzkopf, 93.09 milone+mitchell+tamassia"
 }
 
 @inproceedings{k-hgd-92i
-, author =	"Goos Kant"
-, title =	"Hexagonal grid drawings"
-, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, year =	1992
-, update =	"98.07 tamassia, 93.09 milone+mitchell"
+, author =      "Goos Kant"
+, title =       "Hexagonal grid drawings"
+, booktitle =   "Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, year =        1992
+, update =      "98.07 tamassia, 93.09 milone+mitchell"
 }
 
 @inproceedings{kb-pgap-92
-, author =	"G. Kant and H. L. Bodlaender"
-, title =	"Planar Graph Augmentation Problems"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"286--298"
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia"
+, author =      "G. Kant and H. L. Bodlaender"
+, title =       "Planar Graph Augmentation Problems"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "286--298"
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{kb-tpgwm-92
-, author =	"G. Kant and H. L. Bodlaender"
-, title =	"Triangulating planar graphs while minimizing the maximum degree"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"258--271"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "G. Kant and H. L. Bodlaender"
+, title =       "Triangulating planar graphs while minimizing the maximum degree"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "258--271"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{kh-rdvr-93
-, author =	"Goos Kant and Xin He"
-, title =	"Rectangular Duals and Visibility Representations"
-, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
-, month =	jun
-, year =	1993
-, pages =	"??"
-, comments =	"does it exist?"
-, update =	"94.09 franciosa, 93.09 milone+mitchell"
+, author =      "Goos Kant and Xin He"
+, title =       "Rectangular Duals and Visibility Representations"
+, booktitle =   "Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
+, month =       jun
+, year =        1993
+, pages =       "??"
+, comments =    "does it exist?"
+, update =      "94.09 franciosa, 93.09 milone+mitchell"
 }
 
 @inproceedings{kh-tafrd-93
-, author =	"Goos Kant and Xin He"
-, title =	"Two Algorithms for Finding Rectangular Duals of Planar Graphs"
-, booktitle =	"Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	790
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"396--410"
-, update =	"98.07 bibrelex+vismara, 95.01 schwarzkopf, 94.09 franciosa, 93.09 milone+mitchell"
+, author =      "Goos Kant and Xin He"
+, title =       "Two Algorithms for Finding Rectangular Duals of Planar Graphs"
+, booktitle =   "Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      790
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "396--410"
+, update =      "98.07 bibrelex+vismara, 95.01 schwarzkopf, 94.09 franciosa, 93.09 milone+mitchell"
 }
 
 @inproceedings{kltt-arvrt-93
-, author =	"G. Kant and G. Liotta and R. Tamassia and I. Tollis"
-, title =	"Area requirement of visibility representations of trees"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"192--197"
-, cites =	"a-srvg-89, k-mcvr-93, o-cgc18-93, rt-rplbo-86, tt-uavrp-86, kw-wvgbr-89, w-brvgr-89, cdp-noaau-92, dett-adgab-93, dtt-cvrg-92, dtt-arsdp-92, ZZZ"
-, update =	"98.11 bibrelex, 94.05 tamassia, 93.09 milone+mitchell"
+, author =      "G. Kant and G. Liotta and R. Tamassia and I. Tollis"
+, title =       "Area requirement of visibility representations of trees"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "192--197"
+, cites =       "a-srvg-89, k-mcvr-93, o-cgc18-93, rt-rplbo-86, tt-uavrp-86, kw-wvgbr-89, w-brvgr-89, cdp-noaau-92, dett-adgab-93, dtt-cvrg-92, dtt-arsdp-92, ZZZ"
+, update =      "98.11 bibrelex, 94.05 tamassia, 93.09 milone+mitchell"
 }
 
 @article{kltt-arvrt-97
-, author =	"G. Kant and G. Liotta and R. Tamassia and I. G. Tollis"
-, title =	"Area Requirement of Visibility Representations of Trees"
-, journal =	"Inform. Process. Lett."
-, volume =	62
-, number =	2
-, year =	1997
-, pages =	"81--88"
-, url =	"https://www.cs.brown.edu/cgc/papers/kltt-arvrt-97.ps.gz"
-, keywords =	"graph drawing, visibility, tree, CGC, Brown"
-, update =	"98.11 tamassia, 97.03 tamassia"
+, author =      "G. Kant and G. Liotta and R. Tamassia and I. G. Tollis"
+, title =       "Area Requirement of Visibility Representations of Trees"
+, journal =     "Inform. Process. Lett."
+, volume =      62
+, number =      2
+, year =        1997
+, pages =       "81--88"
+, url = "https://www.cs.brown.edu/cgc/papers/kltt-arvrt-97.ps.gz"
+, keywords =    "graph drawing, visibility, tree, CGC, Brown"
+, update =      "98.11 tamassia, 97.03 tamassia"
 }
 
 @techreport{kltt-vrt-96
-, author =	"G. Kant and G. Liotta and R. Tamassia and I. G. Tollis"
-, title =	"Visibility Representations of Trees"
-, type =	"Technical Report"
-, number =	"CS-96-23"
-, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
-, year =	1996
-, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-23.ps.Z"
-, keywords =	"graph drawing, visibility, tree, CGC, Brown"
-, update =	"97.03 tamassia"
+, author =      "G. Kant and G. Liotta and R. Tamassia and I. G. Tollis"
+, title =       "Visibility Representations of Trees"
+, type =        "Technical Report"
+, number =      "CS-96-23"
+, institution = "Center for Geometric Computing, Dept. Computer Science, Brown Univ."
+, year =        1996
+, url = "ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-23.ps.Z"
+, keywords =    "graph drawing, visibility, tree, CGC, Brown"
+, update =      "97.03 tamassia"
 }
 
 @article{k-fibrp-85
-, author =	"K. Kant"
-, title =	"Finding interferences between rectangular paths"
-, journal =	"IEEE Trans. Comput."
-, volume =	34
-, number =	11
-, year =	1985
-, pages =	"1045--1049"
-, update =	"94.01 tuan"
+, author =      "K. Kant"
+, title =       "Finding interferences between rectangular paths"
+, journal =     "IEEE Trans. Comput."
+, volume =      34
+, number =      11
+, year =        1985
+, pages =       "1045--1049"
+, update =      "94.01 tuan"
 }
 
 @article{kz-tetpp-86
-, author =	"K. Kant and S. Zucker"
-, title =	"Toward efficient trajectory planning: {The} path-velocity decomposition"
-, journal =	"Internat. J. Robot. Res."
-, volume =	5
-, number =	3
-, year =	1986
-, pages =	"72--89"
-, update =	"98.03 bibrelex"
+, author =      "K. Kant and S. Zucker"
+, title =       "Toward efficient trajectory planning: {The} path-velocity decomposition"
+, journal =     "Internat. J. Robot. Res."
+, volume =      5
+, number =      3
+, year =        1986
+, pages =       "72--89"
+, update =      "98.03 bibrelex"
 }
 
 @article{kz-pcftt-88
-, author =	"Kamal Kant and Steven W. Zucker"
-, title =	"Planning collision-free trajectories in time-varying environments: a two-level hierarchy"
-, journal =	"Visual Comput."
-, volume =	3
-, number =	5
-, month =	mar
-, year =	1988
-, pages =	"304--313"
-, keywords =	"robotics, trajectory planning, path planning, obstacle avoidance, velocity planning"
+, author =      "Kamal Kant and Steven W. Zucker"
+, title =       "Planning collision-free trajectories in time-varying environments: a two-level hierarchy"
+, journal =     "Visual Comput."
+, volume =      3
+, number =      5
+, month =       mar
+, year =        1988
+, pages =       "304--313"
+, keywords =    "robotics, trajectory planning, path planning, obstacle avoidance, velocity planning"
 }
 
 @article{k-mslra-92
-, author =	"V. Kantabutra"
-, title =	"Motions of a short-linked robot arm in a square"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"69--76"
+, author =      "V. Kantabutra"
+, title =       "Motions of a short-linked robot arm in a square"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "69--76"
 }
 
 @article{k-rpura-97
-, author =	"V. Kantabutra"
-, title =	"Reaching a Point with an Unanchored Robot Arm in a Square"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"539--550"
-, update =	"98.11 devillers+orourke"
+, author =      "V. Kantabutra"
+, title =       "Reaching a Point with an Unanchored Robot Arm in a Square"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "539--550"
+, update =      "98.11 devillers+orourke"
 }
 
 @article{k-tscan-83
-, author =	"V. Kantabutra"
-, title =	"Traveling salesman cycles are not always subgraphs of {Voronoi} duals"
-, journal =	"Inform. Process. Lett."
-, volume =	16
-, year =	1983
-, pages =	"11--12"
+, author =      "V. Kantabutra"
+, title =       "Traveling salesman cycles are not always subgraphs of {Voronoi} duals"
+, journal =     "Inform. Process. Lett."
+, volume =      16
+, year =        1983
+, pages =       "11--12"
 }
 
 @inproceedings{kk-aram-84
-, author =	"V. Kantabutra and S. R. Kosaraju"
-, title =	"Algorithms for robot arm movements"
-, booktitle =	"Proc. Conf. Inform. Sci. \& Sys."
-, site =	"Princeton, NJ"
-, year =	1984
-, pages =	"??"
+, author =      "V. Kantabutra and S. R. Kosaraju"
+, title =       "Algorithms for robot arm movements"
+, booktitle =   "Proc. Conf. Inform. Sci. \& Sys."
+, site =        "Princeton, NJ"
+, year =        1984
+, pages =       "??"
 }
 
 @article{kk-namra-86
-, author =	"V. Kantabutra and S. R. Kosaraju"
-, title =	"New algorithms for multilink robot arms"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	32
-, month =	feb
-, year =	1986
-, pages =	"136--153"
-, update =	"98.07 bibrelex"
+, author =      "V. Kantabutra and S. R. Kosaraju"
+, title =       "New algorithms for multilink robot arms"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      32
+, month =       feb
+, year =        1986
+, pages =       "136--153"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{kmnpsw-askmc-00
-, author =	"Tapas Kanungo and David M. Mount and Nathan S. Netanyahu and Christine Piatko and Ruth Silverman and Angela Y. Wu"
-, title =	"The Analysis of a Simple $k$-Means Clustering Algorithm"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"100--109"
-, update =	"00.11 jones"
+, author =      "Tapas Kanungo and David M. Mount and Nathan S. Netanyahu and Christine Piatko and Ruth Silverman and Angela Y. Wu"
+, title =       "The Analysis of a Simple $k$-Means Clustering Algorithm"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "100--109"
+, update =      "00.11 jones"
 }
 
 @article{kfhr-opasl-94
-, author =	"M.-Y. Kao and M. F{\"u}rer and X. He and B. Raghavachari"
-, title =	"Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs"
-, journal =	"SIAM J. Discrete Math."
-, volume =	7
-, number =	4
-, year =	1994
-, pages =	"632--646"
-, keywords =	"graph drawing, planar, straight-line, grid, parallel"
-, update =	"98.11 vismara, 98.07 tamassia+vismara, 96.09 tamassia, 93.09 tamassia"
-}
-
-% also claimed pages =	"441--448"
+, author =      "M.-Y. Kao and M. F{\"u}rer and X. He and B. Raghavachari"
+, title =       "Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs"
+, journal =     "SIAM J. Discrete Math."
+, volume =      7
+, number =      4
+, year =        1994
+, pages =       "632--646"
+, keywords =    "graph drawing, planar, straight-line, grid, parallel"
+, update =      "98.11 vismara, 98.07 tamassia+vismara, 96.09 tamassia, 93.09 tamassia"
+}
+
+% also claimed pages =  "441--448"
 @inproceedings{krt-sueor-93
-, author =	"M.-Y. Kao and J. H. Reif and S. R. Tate"
-, title =	"Searching in an Unknown Environment: {An} Optimal Randomized Algorithm for the Cow-Path Problem"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"441--447"
-, precedes =	"krt-sueor-96"
-, update =	"98.03 mitchell, 93.09 milone+mitchell, 93.05 smid"
+, author =      "M.-Y. Kao and J. H. Reif and S. R. Tate"
+, title =       "Searching in an Unknown Environment: {An} Optimal Randomized Algorithm for the Cow-Path Problem"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "441--447"
+, precedes =    "krt-sueor-96"
+, update =      "98.03 mitchell, 93.09 milone+mitchell, 93.05 smid"
 }
 
 @article{krt-sueor-96
-, author =	"M.-Y. Kao and J. H. Reif and S. R. Tate"
-, title =	"Searching in an Unknown Environment: {An} Optimal Randomized Algorithm for the Cow-Path Problem"
-, journal =	"Inform. Comput."
-, volume =	133
-, number =	1
-, year =	1996
-, pages =	"63--79"
-, succeeds =	"krt-sueor-93"
-, update =	"99.07 bibrelex, 98.03 mitchell"
+, author =      "M.-Y. Kao and J. H. Reif and S. R. Tate"
+, title =       "Searching in an Unknown Environment: {An} Optimal Randomized Algorithm for the Cow-Path Problem"
+, journal =     "Inform. Comput."
+, volume =      133
+, number =      1
+, year =        1996
+, pages =       "63--79"
+, succeeds =    "krt-sueor-93"
+, update =      "99.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{ks-lrgop-89
-, author =	"M.-Y. Kao and G. E. Shannon"
-, title =	"Local Reorientations, Global Order, and Planar Topology"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"286--296"
-, update =	"95.01 tamassia"
+, author =      "M.-Y. Kao and G. E. Shannon"
+, title =       "Local Reorientations, Global Order, and Planar Topology"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "286--296"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{kms-dmdt-91
-, author =	"Thomas Kao and David Mount and Alan Saalfeld"
-, title =	"Dynamic Maintenance of {Delaunay} Triangulations"
-, booktitle =	"Proc. 10th Internat. Sympos. Comput.-Assist. Cartog."
-, series =	"Technical Papers 1991 ACSM-ASPRS Annual Convention"
-, volume =	6
-, year =	1991
-, pages =	"219--233"
-, update =	"93.05 freimer"
-, annote =	"Incremental insertion and deletion of points based on
-		 \cite{gks-ricdv-90}. Earlier versions of the
-		 triangulation can be recovered. In a sequence of
-		 deletions and insertions, periodic rebalancing of the
-		 history graph is required. Implemented."
+, author =      "Thomas Kao and David Mount and Alan Saalfeld"
+, title =       "Dynamic Maintenance of {Delaunay} Triangulations"
+, booktitle =   "Proc. 10th Internat. Sympos. Comput.-Assist. Cartog."
+, series =      "Technical Papers 1991 ACSM-ASPRS Annual Convention"
+, volume =      6
+, year =        1991
+, pages =       "219--233"
+, update =      "93.05 freimer"
+, annote =      "Incremental insertion and deletion of points based on
+                 \cite{gks-ricdv-90}. Earlier versions of the
+                 triangulation can be recovered. In a sequence of
+                 deletions and insertions, periodic rebalancing of the
+                 history graph is required. Implemented."
 }
 
 @inproceedings{kk-cpcfv-90
-, author =	"T. C. Kao and G. D. Knott"
-, title =	"Computing polygonal chords and the farthest visibility polygons"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"332--336"
-, cites =	"as-cldsp-89, bkt-dsvp-89, cs-agpli-88, cg-vippg-89, dls-rphs-88, ea-lacvp-81, g-cvpcs-86, ghlst-ltavs-86, l-vsp-83, ll-cvpe-86, ps-cgi-85, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "T. C. Kao and G. D. Knott"
+, title =       "Computing polygonal chords and the farthest visibility polygons"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "332--336"
+, cites =       "as-cldsp-89, bkt-dsvp-89, cs-agpli-88, cg-vippg-89, dls-rphs-88, ea-lacvp-81, g-cvpcs-86, ghlst-ltavs-86, l-vsp-83, ll-cvpe-86, ps-cgi-85, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{km-accvd-91
-, author =	"T. C. Kao and D. M. Mount"
-, title =	"An algorithm for computing compacted {Voronoi} diagrams defined by convex distance functions"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"104--109"
-, cites =	"cd-vdbcd-85, eghsssw-irals-89, f-fapct-85, gs-ccrs-87, k-eccs-79, l-csa-72, ls-pptmc-87, lw-vdllm-80, ps-cgi-85, y-oavds-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "T. C. Kao and D. M. Mount"
+, title =       "An algorithm for computing compacted {Voronoi} diagrams defined by convex distance functions"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "104--109"
+, cites =       "cd-vdbcd-85, eghsssw-irals-89, f-fapct-85, gs-ccrs-87, k-eccs-79, l-csa-72, ls-pptmc-87, lw-vdllm-80, ps-cgi-85, y-oavds-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{km-icdmc-92
-, author =	"T. C. Kao and D. M. Mount"
-, title =	"Incremental construction and dynamic maintenance of constrained {Delaunay} triangulations"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"170--175"
-, cites =	"agss-ltacv-89, b-amgct-89, beg-pgmg-90, c-tpca-82, c-tsplt-90i, c-cdt-89, dp-olacd-91, g-eadch-72, gs-pmgsc-85, l-vsp-83, ll-gdtpg-86, ls-tacdt-80, s-let-78, sp-htucc-92, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "T. C. Kao and D. M. Mount"
+, title =       "Incremental construction and dynamic maintenance of constrained {Delaunay} triangulations"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "170--175"
+, cites =       "agss-ltacv-89, b-amgct-89, beg-pgmg-90, c-tpca-82, c-tsplt-90i, c-cdt-89, dp-olacd-91, g-eadch-72, gs-pmgsc-85, l-vsp-83, ll-gdtpg-86, ls-tacdt-80, s-let-78, sp-htucc-92, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{k-agnta-97
-, author =	"Sanjiv Kapoor"
-, title =	"Approximate Geographic Neighbor Tree with Applications"
-, type =	"Manuscript"
-, institution =	"IIT, New Delhi"
-, year =	1997
-, update =	"98.07 mitchell"
+, author =      "Sanjiv Kapoor"
+, title =       "Approximate Geographic Neighbor Tree with Applications"
+, type =        "Manuscript"
+, institution = "IIT, New Delhi"
+, year =        1997
+, update =      "98.07 mitchell"
 }
 
 @techreport{k-dm2dc-95
-, author =	"S. Kapoor"
-, title =	"Dynamic maintenance of 2-d convex hulls and order decomposable problems"
-, number =	"MPI-I-95-1-015"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1995
-, update =	"95.09 smid"
+, author =      "S. Kapoor"
+, title =       "Dynamic maintenance of 2-d convex hulls and order decomposable problems"
+, number =      "MPI-I-95-1-015"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1995
+, update =      "95.09 smid"
 }
 
 @article{k-dmm2d-00
-, author =	"S. Kapoor"
-, title =	"Dynamic maintenance of maxima of $2$-d point sets"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, year =	2000
-, pages =	"1858--1877"
-, update =	"01.04 smid"
+, author =      "S. Kapoor"
+, title =       "Dynamic maintenance of maxima of $2$-d point sets"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, year =        2000
+, pages =       "1858--1877"
+, update =      "01.04 smid"
 }
 
 @inproceedings{k-dmm2d-94
-, author =	"S. Kapoor"
-, title =	"Dynamic Maintenance of Maximas of $2$-d Point Sets"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"140--149"
-, cites =	"ps-cgi-85, fr-nadmm-90, hs-ompc-91, j-dmmpp-91, klp-fmsv-75, ol-mcp-81, t-ubstr-83, wl-arrcd-85, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "S. Kapoor"
+, title =       "Dynamic Maintenance of Maximas of $2$-d Point Sets"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "140--149"
+, cites =       "ps-cgi-85, fr-nadmm-90, hs-ompc-91, j-dmmpp-91, klp-fmsv-75, ol-mcp-81, t-ubstr-83, wl-arrcd-85, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @inproceedings{k-ecgsp-99
-, author =	"S. Kapoor"
-, title =	"Efficient computation of geodesic shortest paths"
-, booktitle =	"Proc. 32nd Annu. ACM Sympos. Theory Comput."
-, year =	1999
-, pages =	"??--??"
-, note =	"To appear"
-, update =	"99.07 orourke"
+, author =      "S. Kapoor"
+, title =       "Efficient computation of geodesic shortest paths"
+, booktitle =   "Proc. 32nd Annu. ACM Sympos. Theory Comput."
+, year =        1999
+, pages =       "??--??"
+, note =        "To appear"
+, update =      "99.07 orourke"
 }
 
 @techreport{k-tdaca-86
-, author =	"S. Kapoor"
-, title =	"Topics in the design and analysis of combinatorial algorithms"
-, type =	"Report"
-, number =	"86-1297"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1986
-, keywords =	"NP-completeness, data structuring"
+, author =      "S. Kapoor"
+, title =       "Topics in the design and analysis of combinatorial algorithms"
+, type =        "Report"
+, number =      "86-1297"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1986
+, keywords =    "NP-completeness, data structuring"
 }
 
 @techreport{km-eaesp-94
-, author =	"S. Kapoor and S. N. Maheshwari"
-, title =	"An efficient algorithm for {Euclidean} shortest path with polygonal obstacles"
-, type =	"Technical {Report}"
-, institution =	"IIT, New Delhi"
-, year =	1994
-, precedes =	"kmm-eaesp-97"
-, update =	"98.03 mitchell, 96.05 mitchell"
-, annote =	"Gives an $O(n+ h^2\log n)$ algorithm for shortest paths"
+, author =      "S. Kapoor and S. N. Maheshwari"
+, title =       "An efficient algorithm for {Euclidean} shortest path with polygonal obstacles"
+, type =        "Technical {Report}"
+, institution = "IIT, New Delhi"
+, year =        1994
+, precedes =    "kmm-eaesp-97"
+, update =      "98.03 mitchell, 96.05 mitchell"
+, annote =      "Gives an $O(n+ h^2\log n)$ algorithm for shortest paths"
 }
 
 @inproceedings{km-eaesp-88
-, author =	"S. Kapoor and S. N. Maheshwari"
-, title =	"Efficient algorithms for {Euclidean} shortest path and visibility problems with polygonal obstacles"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"172--182"
-, precedes =	"kmm-eaesp-97"
-, cites =	"gh-ospqs-87, gm-osacv-87, h-fvgsp-87, lp-esppr-84, rs-spesp-85, w-cvgnl-85, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "S. Kapoor and S. N. Maheshwari"
+, title =       "Efficient algorithms for {Euclidean} shortest path and visibility problems with polygonal obstacles"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "172--182"
+, precedes =    "kmm-eaesp-97"
+, cites =       "gh-ospqs-87, gm-osacv-87, h-fvgsp-87, lp-esppr-84, rs-spesp-85, w-cvgnl-85, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{kmm-eaesp-97
-, author =	"S. Kapoor and S. N. Maheshwari and Joseph S. B. Mitchell"
-, title =	"An Efficient Algorithm for {Euclidean} Shortest Paths among Polygonal Obstacles in the Plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	18
-, year =	1997
-, pages =	"377--383"
-, succeeds =	"m-esppo-94, km-eaesp-94"
-, update =	"98.03 mitchell"
-, annote =	"Gives an $O(n+ h^2\log n)$ algorithm for shortest paths"
+, author =      "S. Kapoor and S. N. Maheshwari and Joseph S. B. Mitchell"
+, title =       "An Efficient Algorithm for {Euclidean} Shortest Paths among Polygonal Obstacles in the Plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      18
+, year =        1997
+, pages =       "377--383"
+, succeeds =    "m-esppo-94, km-eaesp-94"
+, update =      "98.03 mitchell"
+, annote =      "Gives an $O(n+ h^2\log n)$ algorithm for shortest paths"
 }
 
 @article{kr-lbmcl-89
-, author =	"S. Kapoor and P. Ramanan"
-, title =	"Lower bounds for maximal and convex layers problems"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"447--459"
-, keywords =	"maxima, maximal depth, convex hull, convex depth, two-dimensional"
-, annote =	"$\Omega(n \log n)$"
+, author =      "S. Kapoor and P. Ramanan"
+, title =       "Lower bounds for maximal and convex layers problems"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "447--459"
+, keywords =    "maxima, maximal depth, convex hull, convex depth, two-dimensional"
+, annote =      "$\Omega(n \log n)$"
 }
 
 @incollection{ks-dmspt-96
-, author =	"S. Kapoor and T. Singh"
-, title =	"Dynamic maintenance of shortest path trees in simple polygons"
-, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1180
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"123--134"
-, update =	"97.03 smid"
+, author =      "S. Kapoor and T. Singh"
+, title =       "Dynamic maintenance of shortest path trees in simple polygons"
+, booktitle =   "Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1180
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "123--134"
+, update =      "97.03 smid"
 }
 
 @techreport{ks-ntead-93
-, author =	"S. Kapoor and M. Smid"
-, title =	"New techniques for exact and approximate dynamic closest-point problems"
-, number =	"MPI-I-93-159"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, succeeds =	"ks-ntead-"
-, update =	"98.11 bibrelex, 94.01 smid"
+, author =      "S. Kapoor and M. Smid"
+, title =       "New techniques for exact and approximate dynamic closest-point problems"
+, number =      "MPI-I-93-159"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, succeeds =    "ks-ntead-"
+, update =      "98.11 bibrelex, 94.01 smid"
 }
 
 @inproceedings{ks-ntead-94
-, author =	"S. Kapoor and M. Smid"
-, title =	"New Techniques for Exact and Approximate Dynamic Closest-Point Problems"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"165--174"
-, cites =	"am-annqf-93, amnsw-oaann-94, c-racpq-88, ehh-rpldd-86, grss-rdsdc-93i, mn-dfc-90, ps-cgi-85, s-eis-92, s-dsadc-93, sss-oaolc-92, s-rpldc-91, s-mmdpsp-92a, s-ntsdc-90, v-oaann-89, y-cmstk-82, ZZZ"
-, update =	"98.03 bibrelex, 94.09 smid, 94.01 jones"
+, author =      "S. Kapoor and M. Smid"
+, title =       "New Techniques for Exact and Approximate Dynamic Closest-Point Problems"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "165--174"
+, cites =       "am-annqf-93, amnsw-oaann-94, c-racpq-88, ehh-rpldd-86, grss-rdsdc-93i, mn-dfc-90, ps-cgi-85, s-eis-92, s-dsadc-93, sss-oaolc-92, s-rpldc-91, s-mmdpsp-92a, s-ntsdc-90, v-oaann-89, y-cmstk-82, ZZZ"
+, update =      "98.03 bibrelex, 94.09 smid, 94.01 jones"
 }
 
 @article{ks-ntead-96
-, author =	"S. Kapoor and M. Smid"
-, title =	"New techniques for exact and approximate dynamic closest-point problems"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, year =	1996
-, pages =	"775--796"
-, update =	"97.03 smid"
+, author =      "S. Kapoor and M. Smid"
+, title =       "New techniques for exact and approximate dynamic closest-point problems"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, pages =       "775--796"
+, update =      "97.03 smid"
 }
 
 @techreport{ks-ntead-
-, author =	"S. Kapoor and M. Smid"
-, title =	"New Techniques for Exact and Approximate Dynamic Closest-PointProblems"
-, type =	"manuscript"
-, precedes =	"ks-ntead-93"
-, update =	"98.11 bibrelex"
+, author =      "S. Kapoor and M. Smid"
+, title =       "New Techniques for Exact and Approximate Dynamic Closest-PointProblems"
+, type =        "manuscript"
+, precedes =    "ks-ntead-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{kv-facqp-86
-, author =	"S. Kapoor and P. M. Vaidya"
-, title =	"Fast algorithms for convex quadratic programming and multicommodity flows"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"147--159"
-, comments =	"Submitted to Math. Program."
+, author =      "S. Kapoor and P. M. Vaidya"
+, title =       "Fast algorithms for convex quadratic programming and multicommodity flows"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "147--159"
+, comments =    "Submitted to Math. Program."
 }
 
 @article{km-mspep-95
-, author =	"M. Kapovich and J. Millson"
-, title =	"On the moduli spaces of polygons in the {Euclidean} plane"
-, journal =	"J. Differential Geom."
-, volume =	42
-, number =	1
-, year =	1995
-, pages =	"133--164"
-, url =	"http://www.math.utah.edu/~kapovich/eprints.html"
-, update =	"02.03 orourke"
+, author =      "M. Kapovich and J. Millson"
+, title =       "On the moduli spaces of polygons in the {Euclidean} plane"
+, journal =     "J. Differential Geom."
+, volume =      42
+, number =      1
+, year =        1995
+, pages =       "133--164"
+, url = "http://www.math.utah.edu/~kapovich/eprints.html"
+, update =      "02.03 orourke"
 }
 
 @incollection{k-ragtp-89
-, author =	"D. Kapur"
-, title =	"A refutational approach to geometry theorem proving"
-, editor =	"D. Kapur and J. L. Mundy"
-, booktitle =	"Geometric Reasoning"
-, publisher =	"MIT Press"
-, year =	1989
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "D. Kapur"
+, title =       "A refutational approach to geometry theorem proving"
+, editor =      "D. Kapur and J. L. Mundy"
+, booktitle =   "Geometric Reasoning"
+, publisher =   "MIT Press"
+, year =        1989
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{k-gtpuh-86
-, author =	"D. Kapur"
-, title =	"Geometry theorem proving using {Hilbert}'s {Nullstellensatz}"
-, booktitle =	"Proc. ACM Sympos. Symbolic and Algebraic Computation"
-, site =	"Waterloo, Canada"
-, year =	1986
-, pages =	"202--208"
-, update =	"98.03 bibrelex"
+, author =      "D. Kapur"
+, title =       "Geometry theorem proving using {Hilbert}'s {Nullstellensatz}"
+, booktitle =   "Proc. ACM Sympos. Symbolic and Algebraic Computation"
+, site =        "Waterloo, Canada"
+, year =        1986
+, pages =       "202--208"
+, update =      "98.03 bibrelex"
 }
 
 @book{km-gr-89
-, title =	"Geometric Reasoning"
-, editor =	"D. Kapur and J. L. Mundy"
-, publisher =	"MIT Press"
-, year =	1989
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, title =       "Geometric Reasoning"
+, editor =      "D. Kapur and J. L. Mundy"
+, publisher =   "MIT Press"
+, year =        1989
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{kptb-itcdp-99
-, author =	"E.-A. Karabassi and G. Papaioannou and T. Theoharis and A. B{\"o}hm"
-, title =	"Intersection Test for Collision Detection in Particle Systems"
-, journal =	"J. Graphics Tools"
-, volume =	4
-, number =	1
-, year =	1999
-, pages =	"25--37"
-, update =	"00.03 held"
+, author =      "E.-A. Karabassi and G. Papaioannou and T. Theoharis and A. B{\"o}hm"
+, title =       "Intersection Test for Collision Detection in Particle Systems"
+, journal =     "J. Graphics Tools"
+, volume =      4
+, number =      1
+, year =        1999
+, pages =       "25--37"
+, update =      "00.03 held"
 }
 
 @manual{klpy-clp-99
-, author =	"Vijay Karamcheti and Chen Li and Igor Pechtchanski and Chee Yap"
-, title =	"The {CORE} Library Project"
-, edition =	"1.2"
-, year =	1999
-, url =	"https://cs.nyu.edu/exact/doc/core.pdf"
-, update =	"00.03 devillers"
+, author =      "Vijay Karamcheti and Chen Li and Igor Pechtchanski and Chee Yap"
+, title =       "The {CORE} Library Project"
+, edition =     "1.2"
+, year =        1999
+, url = "https://cs.nyu.edu/exact/doc/core.pdf"
+, update =      "00.03 devillers"
 }
 
 @inproceedings{k-bisoa-89
-, author =	"M. Karasick"
-, title =	"Benchmarks for implementations of set-operations algorithms on polyhedral solids"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	13
+, author =      "M. Karasick"
+, title =       "Benchmarks for implementations of set-operations algorithms on polyhedral solids"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       13
 }
 
 @phdthesis{k-rmrs-89
-, author =	"M. Karasick"
-, title =	"On the Representation and Manipulation of Rigid Solids"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1989
-, keywords =	"doctoral thesis"
+, author =      "M. Karasick"
+, title =       "On the Representation and Manipulation of Rigid Solids"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1989
+, keywords =    "doctoral thesis"
 }
 
 @techreport{kln-edtur-89
-, author =	"M. Karasick and D. Lieber and L. R. Nackman"
-, title =	"Efficient {Delaunay} triangulations using rational arithmetic"
-, type =	"Report"
-, number =	"RC 14455"
-, institution =	"IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, month =	mar
-, year =	1989
-, precedes =	"kln-edtur-91"
+, author =      "M. Karasick and D. Lieber and L. R. Nackman"
+, title =       "Efficient {Delaunay} triangulations using rational arithmetic"
+, type =        "Report"
+, number =      "RC 14455"
+, institution = "IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, month =       mar
+, year =        1989
+, precedes =    "kln-edtur-91"
 }
 
 @article{kln-edtur-91
-, author =	"M. Karasick and D. Lieber and L. R. Nackman"
-, title =	"Efficient {Delaunay} triangulations using rational arithmetic"
-, journal =	"ACM Trans. Graph."
-, volume =	10
-, number =	1
-, month =	jan
-, year =	1991
-, pages =	"71--91"
-, succeeds =	"kln-edtur-89"
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "M. Karasick and D. Lieber and L. R. Nackman"
+, title =       "Efficient {Delaunay} triangulations using rational arithmetic"
+, journal =     "ACM Trans. Graph."
+, volume =      10
+, number =      1
+, month =       jan
+, year =        1991
+, pages =       "71--91"
+, succeeds =    "kln-edtur-89"
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @article{klnr-vtddm-97
-, author =	"M. S. Karasick and D. Lieber and L. R. Nackman and V. T. Rajan"
-, title =	"Visualization of Three-Dimensional {Delaunay} Meshes"
-, journal =	"Algorithmica"
-, volume =	19
-, number =	"1--2"
-, month =	sep
-, year =	1997
-, pages =	"114--128"
-, update =	"97.07 held"
+, author =      "M. S. Karasick and D. Lieber and L. R. Nackman and V. T. Rajan"
+, title =       "Visualization of Three-Dimensional {Delaunay} Meshes"
+, journal =     "Algorithmica"
+, volume =      19
+, number =      "1--2"
+, month =       sep
+, year =        1997
+, pages =       "114--128"
+, update =      "97.07 held"
 }
 
 @inproceedings{ks-oag-93
-, author =	"Y. Karasik and Micha Sharir"
-, title =	"Optical algorithms in geometry"
-, booktitle =	"Proc. Optical Comput. Topical Meeting, Optical Society of America"
-, year =	1993
-, pages =	"164--167"
-, update =	"98.03 mitchell, 94.05 sharir"
+, author =      "Y. Karasik and Micha Sharir"
+, title =       "Optical algorithms in geometry"
+, booktitle =   "Proc. Optical Comput. Topical Meeting, Optical Society of America"
+, year =        1993
+, pages =       "164--167"
+, update =      "98.03 mitchell, 94.05 sharir"
 }
 
 @inproceedings{k-coctk-94
-, author =	"Y. B. Karasik"
-, title =	"Constructing Optically in Constant Time the $k$-Level of an Arrangement of Lines in the Plane and Other Related Problems"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"212--218"
-, cites =	"b-omt-74, e-acg-87, ed-copht-83, erk-oalla-93, ers-ufwsc-, gchhzy-otmo-92, k-oacg-91, k-oaiht-92, ks-ocg-92, ks-pgdms-93, j-icm-93, ohg-riitf-85, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "Y. B. Karasik"
+, title =       "Constructing Optically in Constant Time the $k$-Level of an Arrangement of Lines in the Plane and Other Related Problems"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "212--218"
+, cites =       "b-omt-74, e-acg-87, ed-copht-83, erk-oalla-93, ers-ufwsc-, gchhzy-otmo-92, k-oacg-91, k-oaiht-92, ks-ocg-92, ks-pgdms-93, j-icm-93, ohg-riitf-85, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @article{k-fhtuh-89
-, author =	"Y. B. Karasik"
-, title =	"Formalization of heuristic tactics used by human beings in searching for the closest packing of arbitrary objects in a given domain"
-, journal =	"Cybernetics \& Systems: An International Journal"
-, volume =	20
-, number =	1
-, year =	1989
-, pages =	"43--49"
-, update =	"98.03 bibrelex"
+, author =      "Y. B. Karasik"
+, title =       "Formalization of heuristic tactics used by human beings in searching for the closest packing of arbitrary objects in a given domain"
+, journal =     "Cybernetics \& Systems: An International Journal"
+, volume =      20
+, number =      1
+, year =        1989
+, pages =       "43--49"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{k-oacg-91
-, author =	"Y. B. Karasik"
-, title =	"Optical algorithms of computational geometry"
-, type =	"Technical {Report}"
-, number =	"199/91"
-, institution =	"The Eskenasy Institute of Computer Science, Tel Aviv Univ."
-, address =	"Tel Aviv, Israel"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "Y. B. Karasik"
+, title =       "Optical algorithms of computational geometry"
+, type =        "Technical {Report}"
+, number =      "199/91"
+, institution = "The Eskenasy Institute of Computer Science, Tel Aviv Univ."
+, address =     "Tel Aviv, Israel"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{k-ocvsg-94
-, author =	"Y. B. Karasik"
-, title =	"Optical Computer Vision: Some Geometrical Algorithms"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"207--211"
-, cites =	"b-omt-74, ed-copht-83, fh-cfaia-82, g-vscfa-81, gchhzy-otmo-92, k-oacg-91, k-oaiht-92, ks-ocg-92, ks-pgdms-93, kr-glcd-82, ohg-riitf-85, p-lb-71, rsb-ocd-88, s-oiphv-82, s-hctoc-86, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "Y. B. Karasik"
+, title =       "Optical Computer Vision: Some Geometrical Algorithms"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "207--211"
+, cites =       "b-omt-74, ed-copht-83, fh-cfaia-82, g-vscfa-81, gchhzy-otmo-92, k-oacg-91, k-oaiht-92, ks-ocg-92, ks-pgdms-93, kr-glcd-82, ohg-riitf-85, p-lb-71, rsb-ocd-88, s-oiphv-82, s-hctoc-86, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{k-ofa-92
-, author =	"Y. B. Karasik"
-, title =	"Optical filling algorithm"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"328--333"
-, cites =	"ks-ocg-92, m-rtisu-86, v-sdcsf-64, wt-ommsl-83, agw-fqo-86, ca-hadla-86, gr-ssaip-88, f-ocscs-88, fl-cstds-86, p-farg-79, r-ospft-86, s-frbri-80, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "Y. B. Karasik"
+, title =       "Optical filling algorithm"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "328--333"
+, cites =       "ks-ocg-92, m-rtisu-86, v-sdcsf-64, wt-ommsl-83, agw-fqo-86, ca-hadla-86, gr-ssaip-88, f-ocscs-88, fl-cstds-86, p-farg-79, r-ospft-86, s-frbri-80, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{k-oaiht-92
-, author =	"Y. B. Karasik"
-, title =	"The optical algorithm for the inverse {Hough} transform"
-, journal =	"Optical computing and processing"
-, volume =	2
-, number =	2
-, year =	1992
-, pages =	"127--136"
-, update =	"93.09 milone+mitchell"
+, author =      "Y. B. Karasik"
+, title =       "The optical algorithm for the inverse {Hough} transform"
+, journal =     "Optical computing and processing"
+, volume =      2
+, number =      2
+, year =        1992
+, pages =       "127--136"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{ks-ocg-92
-, author =	"Y. B. Karasik and Micha Sharir"
-, title =	"Optical computational geometry"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"232--241"
-, cites =	"ate-plcsl-89, b-gto-74, b-omt-74, br-lbceo-87, br-pcamm-87, cgl-pgd-83, cky-ommmu-88, clpp-odpfs-60, d-htrt-81, ed-copht-83, f-ocscs-88, fn-rtisa-90, g-ifo-68, get-hpfrt-89, ggsbcg-ocrot-89, gt-cghgt-84, hcy-iatwm-90, ls-mtoap-83, m-rtisu-86, ma-oaslm-89, r-asoi-53, rt-epaoc-90, sc-ctrmh-90, v-sdcsf-64, w-blsf-87, wt-ommsl-83, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Y. B. Karasik and Micha Sharir"
+, title =       "Optical computational geometry"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "232--241"
+, cites =       "ate-plcsl-89, b-gto-74, b-omt-74, br-lbceo-87, br-pcamm-87, cgl-pgd-83, cky-ommmu-88, clpp-odpfs-60, d-htrt-81, ed-copht-83, f-ocscs-88, fn-rtisa-90, g-ifo-68, get-hpfrt-89, ggsbcg-ocrot-89, gt-cghgt-84, hcy-iatwm-90, ls-mtoap-83, m-rtisu-86, ma-oaslm-89, r-asoi-53, rt-epaoc-90, sc-ctrmh-90, v-sdcsf-64, w-blsf-87, wt-ommsl-83, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{ks-pgdms-93
-, author =	"Y. B. Karasik and Micha Sharir"
-, title =	"The power of geometric duality and {Minkowski} sums in optical computational geometry"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"379--388"
-, cites =	"br-lbceo-87, br-pcamm-87, cgl-pgd-83, d-htrt-81, dh-uhtdl-72, ek-iodc-90, ghlst-ltavs-87, h-odcbl-90, iti-ieesu-92, k-fhtuh-89, k-oacg-91, ks-ocg-92, ka-oci-92, klps-ujrcf-86, l-tdoad-91, m-oca-91, ph-ddocs-92, rt-epaoc-90, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 93.09 jones"
+, author =      "Y. B. Karasik and Micha Sharir"
+, title =       "The power of geometric duality and {Minkowski} sums in optical computational geometry"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "379--388"
+, cites =       "br-lbceo-87, br-pcamm-87, cgl-pgd-83, d-htrt-81, dh-uhtdl-72, ek-iodc-90, ghlst-ltavs-87, h-odcbl-90, iti-ieesu-92, k-fhtuh-89, k-oacg-91, ks-ocg-92, ka-oci-92, klps-ujrcf-86, l-tdoad-91, m-oca-91, ph-ddocs-92, rt-epaoc-90, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 93.09 jones"
 }
 
 @proceedings{knv-ewcg-97
-, title =	"Abstracts 13th European Workshop Comput. Geom."
-, editor =	"Oliver Karch and Hartmut Noltemeier and Knut Verbarg"
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 13th European Workshop Comput. Geom."
+, editor =      "Oliver Karch and Hartmut Noltemeier and Knut Verbarg"
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{knw-rlti-97
-, author =	"Oliver Karch and Hartmut Noltemeier and Thomas Wahl"
-, title =	"Robot Localization: Theory and Implementation"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"17--19"
-, update =	"99.07 bibrelex, 98.07 bibrelex"
+, author =      "Oliver Karch and Hartmut Noltemeier and Thomas Wahl"
+, title =       "Robot Localization: Theory and Implementation"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "17--19"
+, update =      "99.07 bibrelex, 98.07 bibrelex"
 }
 
 @article{kkt-rltaf-95
-, author =	"D. Karger and P. N. Klein and R. E. Tarjan"
-, title =	"A randomized linear-time algorithm to find minimum spanning trees"
-, journal =	"J. ACM"
-, volume =	42
-, year =	1995
-, pages =	"321--328"
-, update =	"98.07 bibrelex"
+, author =      "D. Karger and P. N. Klein and R. E. Tarjan"
+, title =       "A randomized linear-time algorithm to find minimum spanning trees"
+, journal =     "J. ACM"
+, volume =      42
+, year =        1995
+, pages =       "321--328"
+, update =      "98.07 bibrelex"
 }
 
 @article{k-rtorc-96
-, author =	"H. A. Karimi"
-, title =	"Real-time optimal-routing computation: {A} heuristic approach"
-, journal =	"ITS Journal"
-, volume =	3
-, year =	1996
-, pages =	"111--127"
-, update =	"98.03 agarwal"
+, author =      "H. A. Karimi"
+, title =       "Real-time optimal-routing computation: {A} heuristic approach"
+, journal =     "ITS Journal"
+, volume =      3
+, year =        1996
+, pages =       "111--127"
+, update =      "98.03 agarwal"
 }
 
 @article{kh-esiem-96
-, author =	"H. A. Karimi and B. H. Houston"
-, title =	"Evaluating strategies for integrating environmental models with GIS: Current trends and future need"
-, journal =	"Comput., Environ. and Urban Systems"
-, volume =	20
-, year =	1996
-, pages =	"413--425"
-, update =	"98.03 agarwal"
+, author =      "H. A. Karimi and B. H. Houston"
+, title =       "Evaluating strategies for integrating environmental models with GIS: Current trends and future need"
+, journal =     "Comput., Environ. and Urban Systems"
+, volume =      20
+, year =        1996
+, pages =       "413--425"
+, update =      "98.03 agarwal"
 }
 
 @book{ka-oci-92
-, author =	"A. M. Karin and A. Awwal"
-, title =	"Optical Computing: {An} Introduction"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1992
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "A. M. Karin and A. Awwal"
+, title =       "Optical Computing: {An} Introduction"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1992
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{kh-aanlp-79
-, author =	"O. Kariv and S. L. Hakimi"
-, title =	"An algorithmic approach to network location problems. I: The $p$-centers"
-, journal =	"SIAM J. Appl. Math."
-, volume =	37
-, year =	1979
-, pages =	"513--538"
-, update =	"97.11 bibrelex"
+, author =      "O. Kariv and S. L. Hakimi"
+, title =       "An algorithmic approach to network location problems. I: The $p$-centers"
+, journal =     "SIAM J. Appl. Math."
+, volume =      37
+, year =        1979
+, pages =       "513--538"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{k-rop-91
-, author =	"W. C. Karl"
-, title =	"Reconstructing Objects from Projections"
-, school =	"Dept. EECS, Massachusetts Institute of Technology"
-, address =	"Boston, MA"
-, month =	feb
-, year =	1991
-, keywords =	"doctoral thesis, probing, x-ray probes"
-, update =	"96.09 romanik"
+, author =      "W. C. Karl"
+, title =       "Reconstructing Objects from Projections"
+, school =      "Dept. EECS, Massachusetts Institute of Technology"
+, address =     "Boston, MA"
+, month =       feb
+, year =        1991
+, keywords =    "doctoral thesis, probing, x-ray probes"
+, update =      "96.09 romanik"
 }
 
 @article{ku-pheis-88
-, author =	"A. R. Karlin and E. Upfal"
-, title =	"Parallel hashing: An efficient implementation of shared memory"
-, journal =	"J. ACM"
-, volume =	35
-, number =	4
-, year =	1988
-, pages =	"876--892"
-, update =	"96.09 orourke"
+, author =      "A. R. Karlin and E. Upfal"
+, title =       "Parallel hashing: An efficient implementation of shared memory"
+, journal =     "J. ACM"
+, volume =      35
+, number =      4
+, year =        1988
+, pages =       "876--892"
+, update =      "96.09 orourke"
 }
 
 @book{k-lp-91
-, author =	"H. Karloff"
-, title =	"Linear Programming"
-, publisher =	"Birkh{\"a}user"
-, address =	"Boston"
-, year =	1991
-, update =	"96.09 orourke"
+, author =      "H. Karloff"
+, title =       "Linear Programming"
+, publisher =   "Birkh{\"a}user"
+, address =     "Boston"
+, year =        1991
+, update =      "96.09 orourke"
 }
 
 @techreport{k-olakr-89
-, author =	"H. Karloff"
-, title =	"Online algorithms for the $k$-robot problem on the line."
-, type =	"Manuscript"
-, institution =	"Univ. of Chicago"
-, address =	"Univ. Illinois, Urbana, IL."
-, year =	1989
-, comments =	"talk was the Semi-Annual Lunch, Algorithms, and Dinner Symposium"
-, update =	"93.09 milone+mitchell"
+, author =      "H. Karloff"
+, title =       "Online algorithms for the $k$-robot problem on the line."
+, type =        "Manuscript"
+, institution = "Univ. of Chicago"
+, address =     "Univ. Illinois, Urbana, IL."
+, year =        1989
+, comments =    "talk was the Semi-Annual Lunch, Algorithms, and Dinner Symposium"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{km-ckwir-94
-, author =	"H. Karloff and Y. Mansour"
-, title =	"On construction of $k$--wise independent random variables"
-, booktitle =	"Proc. Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	"564--573"
-, update =	"96.09 orourke"
+, author =      "H. Karloff and Y. Mansour"
+, title =       "On construction of $k$--wise independent random variables"
+, booktitle =   "Proc. Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       "564--573"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{krr-lbrks-91
-, author =	"H. Karloff and Y. Rabani and Y. Ravid"
-, title =	"Lower bounds for randomized $k$-servers and motion planning algorithms"
-, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
-, year =	1991
-, pages =	"278--288"
-, keywords =	"path planning, on-line"
+, author =      "H. Karloff and Y. Rabani and Y. Ravid"
+, title =       "Lower bounds for randomized $k$-servers and motion planning algorithms"
+, booktitle =   "Proc. 23rd Annu. ACM Sympos. Theory Comput."
+, year =        1991
+, pages =       "278--288"
+, keywords =    "path planning, on-line"
 }
 
 @article{kr-rapn-93
-, author =	"H. Karloff and P. Raghavan"
-, title =	"Randomized algorithms and pseudorandom numbers"
-, journal =	"J. ACM"
-, volume =	40
-, number =	3
-, year =	1993
-, pages =	"454--476"
-, comments =	"using few random bits; precedes Mulmuley's work"
-, update =	"94.01 matousek"
+, author =      "H. Karloff and P. Raghavan"
+, title =       "Randomized algorithms and pseudorandom numbers"
+, journal =     "J. ACM"
+, volume =      40
+, number =      3
+, year =        1993
+, pages =       "454--476"
+, comments =    "using few random bits; precedes Mulmuley's work"
+, update =      "94.01 matousek"
 }
 
 @techreport{k-hlcet-87
-, author =	"H. J. Karloff"
-, title =	"How long can a {Euclidean} traveling salesman tour be?"
-, type =	"Technical {Report}"
-, number =	"87-20"
-, institution =	"Dept. Comput. Sci., Univ. Chicago"
-, address =	"Chicago, IL"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "H. J. Karloff"
+, title =       "How long can a {Euclidean} traveling salesman tour be?"
+, type =        "Technical {Report}"
+, number =      "87-20"
+, institution = "Dept. Comput. Sci., Univ. Chicago"
+, address =     "Chicago, IL"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @article{k-hlcet-89
-, author =	"H. J. Karloff"
-, title =	"How long can a {Euclidean} traveling salesman tour be?"
-, journal =	"SIAM J. Discrete Math."
-, volume =	2
-, year =	1989
-, pages =	"91--99"
-, update =	"97.11 bibrelex"
+, author =      "H. J. Karloff"
+, title =       "How long can a {Euclidean} traveling salesman tour be?"
+, journal =     "SIAM J. Discrete Math."
+, volume =      2
+, year =        1989
+, pages =       "91--99"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{k-aru-84
-, author =	"R. G. Karlsson"
-, title =	"Algorithms in a restricted universe"
-, type =	"Report"
-, number =	"CS-84-50"
-, institution =	"Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	1984
+, author =      "R. G. Karlsson"
+, title =       "Algorithms in a restricted universe"
+, type =        "Report"
+, number =      "CS-84-50"
+, institution = "Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        1984
 }
 
 @article{k-gmg-88
-, author =	"R. G. Karlsson"
-, title =	"Greedy matching on a grid"
-, journal =	"BIT"
-, volume =	28
-, year =	1988
-, pages =	"19--26"
+, author =      "R. G. Karlsson"
+, title =       "Greedy matching on a grid"
+, journal =     "BIT"
+, volume =      28
+, year =        1988
+, pages =       "19--26"
 }
 
 @incollection{km-pg-85
-, author =	"R. G. Karlsson and J. I. Munro"
-, title =	"Proximity on a grid"
-, booktitle =	"Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	182
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"187--196"
-, update =	"97.03 schwarzkopf"
+, author =      "R. G. Karlsson and J. I. Munro"
+, title =       "Proximity on a grid"
+, booktitle =   "Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      182
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "187--196"
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{kmr-nnpbd-85
-, author =	"R. G. Karlsson and J. I. Munro and E. L. Robertson"
-, title =	"The nearest neighbor problem on bounded domains"
-, booktitle =	"Proc. 12th Internat. Colloq. Automata Lang. Program."
-, nickname =	"ICALP '85"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	194
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"318--327"
-, update =	"99.11 bibrelex, 97.11 bibrelex"
+, author =      "R. G. Karlsson and J. I. Munro and E. L. Robertson"
+, title =       "The nearest neighbor problem on bounded domains"
+, booktitle =   "Proc. 12th Internat. Colloq. Automata Lang. Program."
+, nickname =    "ICALP '85"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      194
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "318--327"
+, update =      "99.11 bibrelex, 97.11 bibrelex"
 }
 
 @article{ko-ndcst-88
-, author =	"R. G. Karlsson and M. H. Overmars"
-, title =	"Normalized divide-and-conquer: a scaling technique for solving multi-dimensional problems"
-, journal =	"Inform. Process. Lett."
-, volume =	26
-, year =	1988
-, pages =	"307--312"
+, author =      "R. G. Karlsson and M. H. Overmars"
+, title =       "Normalized divide-and-conquer: a scaling technique for solving multi-dimensional problems"
+, journal =     "Inform. Process. Lett."
+, volume =      26
+, year =        1988
+, pages =       "307--312"
 }
 
 @article{ko-sag-88
-, author =	"R. G. Karlsson and M. H. Overmars"
-, title =	"Scanline algorithms on a grid"
-, journal =	"BIT"
-, volume =	28
-, year =	1988
-, pages =	"227--241"
-, update =	"97.03 schwarzkopf"
+, author =      "R. G. Karlsson and M. H. Overmars"
+, title =       "Scanline algorithms on a grid"
+, journal =     "BIT"
+, volume =      28
+, year =        1988
+, pages =       "227--241"
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{k-nptal-84i
-, author =	"N. Karmarkar"
-, title =	"A new polynomial-time algorithm for linear programming"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"302--311"
-, precedes =	"k-nptal-84a"
+, author =      "N. Karmarkar"
+, title =       "A new polynomial-time algorithm for linear programming"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "302--311"
+, precedes =    "k-nptal-84a"
 }
 
 @article{k-nptal-84a
-, author =	"N. Karmarkar"
-, title =	"A new polynomial-time algorithm for linear programming"
-, journal =	"Combinatorica"
-, volume =	4
-, year =	1984
-, pages =	"373--395"
-, succeeds =	"k-nptal-84i"
+, author =      "N. Karmarkar"
+, title =       "A new polynomial-time algorithm for linear programming"
+, journal =     "Combinatorica"
+, volume =      4
+, year =        1984
+, pages =       "373--395"
+, succeeds =    "k-nptal-84i"
 }
 
 @techreport{kkkll-mcaep-90
-, author =	"N. Karmarkar and R. Karp and R. Karp and L. Lovasz and M. Luby"
-, title =	"A {Monte}-{Carlo} algorithm for estimating the permanent"
-, type =	"Technical {Report}"
-, number =	"TR-90-063"
-, institution =	"International Computer Science Institute"
-, address =	"Berkeley, CA"
-, year =	1990
-, update =	"98.03 bibrelex"
+, author =      "N. Karmarkar and R. Karp and R. Karp and L. Lovasz and M. Luby"
+, title =       "A {Monte}-{Carlo} algorithm for estimating the permanent"
+, type =        "Technical {Report}"
+, number =      "TR-90-063"
+, institution = "International Computer Science Institute"
+, address =     "Berkeley, CA"
+, year =        1990
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{kg-scmg-00
-, author =	"Zachi Karni and Craig Gotsman"
-, title =	"Spectral Compression of Mesh Geometry"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"27--30"
-, update =	"00.03 bibrelex"
+, author =      "Zachi Karni and Craig Gotsman"
+, title =       "Spectral Compression of Mesh Geometry"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "27--30"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{k-rrcse
-, author =	"Gyula K{\'a}rolyi"
-, title =	"{Ramsey}-Remainder for Convex Sets and the {Erd{\H o}s-Szekeres Theorem}"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"107--108"
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Gyula K{\'a}rolyi"
+, title =       "{Ramsey}-Remainder for Convex Sets and the {Erd{\H o}s-Szekeres Theorem}"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "107--108"
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{k-rrcse-01
-, author =	"Gyula K{\'a}rolyi"
-, title =	"{Ramsey}-Remainder for Convex Sets and the {Erd{\H o}s-Szekeres} theorem"
-, journal =	"Discrete Appl. Math."
-, volume =	109
-, year =	2001
-, pages =	"163--175"
-, succeeds =	"k-rrcse"
-, update =	"02.03 devillers"
+, author =      "Gyula K{\'a}rolyi"
+, title =       "{Ramsey}-Remainder for Convex Sets and the {Erd{\H o}s-Szekeres} theorem"
+, journal =     "Discrete Appl. Math."
+, volume =      109
+, year =        2001
+, pages =       "163--175"
+, succeeds =    "k-rrcse"
+, update =      "02.03 devillers"
 }
 
 @incollection{kptt-afmdm-
-, author =	"G. K{\'a}rolyi and J. Pach and G. Tardos and G. T{\'o}th"
-, title =	"An algorithm for finding many disjoint monochromatic edges in a complete $2$-colored geometric graph"
-, editor =	"I. B{\'a}r{\'a}ny and K. B{\"o}r{\"o}czky"
-, booktitle =	"Intuitive Geometry"
-, series =	"Bolyai Soc. Math. Studies"
-, volume =	6
-, publisher =	"??"
-, year =	"??"
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "G. K{\'a}rolyi and J. Pach and G. Tardos and G. T{\'o}th"
+, title =       "An algorithm for finding many disjoint monochromatic edges in a complete $2$-colored geometric graph"
+, editor =      "I. B{\'a}r{\'a}ny and K. B{\"o}r{\"o}czky"
+, booktitle =   "Intuitive Geometry"
+, series =      "Bolyai Soc. Math. Studies"
+, volume =      6
+, publisher =   "??"
+, year =        "??"
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{kpt-rtrgg-96
-, author =	"Gyula K{\'a}rolyi and J{\'a}nos Pach and G{\'e}za T{\'o}th"
-, title =	"Ramsey-Type Results for Geometric Graphs"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"359--365"
-, update =	"96.05 efrat"
+, author =      "Gyula K{\'a}rolyi and J{\'a}nos Pach and G{\'e}za T{\'o}th"
+, title =       "Ramsey-Type Results for Geometric Graphs"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "359--365"
+, update =      "96.05 efrat"
 }
 
 @article{kpt-rtrgg-97
-, author =	"G. K{\'a}rolyi and J. Pach and G. T{\'o}th"
-, title =	"Ramsey-Type Results for Geometric Graphs, I"
-, journal =	"Discrete Comput. Geom."
-, volume =	18
-, year =	1997
-, pages =	"247--255"
-, succeeds =	"kpt-rtrgg-96"
-, update =	"02.03 devillers"
+, author =      "G. K{\'a}rolyi and J. Pach and G. T{\'o}th"
+, title =       "Ramsey-Type Results for Geometric Graphs, I"
+, journal =     "Discrete Comput. Geom."
+, volume =      18
+, year =        1997
+, pages =       "247--255"
+, succeeds =    "kpt-rtrgg-96"
+, update =      "02.03 devillers"
 }
 
 @inproceedings{kptv-rttgg-97
-, author =	"G. K{\'a}rolyi and J. Pach and G. T{\'o}th and P. Valtr"
-, title =	"Ramsey-Type Results for Geometric Graphs II"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, publisher =	"ACM Press"
-, year =	1997
-, pages =	"94--103"
-, cites =	"b-grtgs-74, bes-rtmcg-75, d-dtpos-50, elss-dgpps-73, gmpp-eptvs-91, grs-rt-90, hs-asdch-92, kpt-rtrgg-96, kptt-afmdm-, pa-cg-95, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
+, author =      "G. K{\'a}rolyi and J. Pach and G. T{\'o}th and P. Valtr"
+, title =       "Ramsey-Type Results for Geometric Graphs II"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, publisher =   "ACM Press"
+, year =        1997
+, pages =       "94--103"
+, cites =       "b-grtgs-74, bes-rtmcg-75, d-dtpos-50, elss-dgpps-73, gmpp-eptvs-91, grs-rt-90, hs-asdch-92, kpt-rtrgg-96, kptt-afmdm-, pa-cg-95, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
 }
 
 @article{kptv-rttgg-98
-, author =	"G. K{\'a}rolyi and J. Pach and G. T{\'o}th and P. Valtr"
-, title =	"Ramsey-Type Results for Geometric Graphs, II"
-, journal =	"Discrete Comput. Geom."
-, volume =	20
-, year =	1998
-, pages =	"375--388"
-, succeeds =	"kptv-rttgg-97"
-, update =	"02.03 devillers"
+, author =      "G. K{\'a}rolyi and J. Pach and G. T{\'o}th and P. Valtr"
+, title =       "Ramsey-Type Results for Geometric Graphs, II"
+, journal =     "Discrete Comput. Geom."
+, volume =      20
+, year =        1998
+, pages =       "375--388"
+, succeeds =    "kptv-rttgg-97"
+, update =      "02.03 devillers"
 }
 
 @article{k-ira-91
-, author =	"R. Karp"
-, title =	"An introduction to randomized algorithms"
-, journal =	"Discrete Appl. Math."
-, volume =	34
-, year =	1991
-, pages =	"165--201"
-, update =	"94.05 matousek"
+, author =      "R. Karp"
+, title =       "An introduction to randomized algorithms"
+, journal =     "Discrete Appl. Math."
+, volume =      34
+, year =        1991
+, pages =       "165--201"
+, update =      "94.05 matousek"
 }
 
 @incollection{k-racpc-72
-, author =	"R. Karp"
-, title =	"Reducibility among combinatorical problems of computer computaions"
-, editor =	"E. Miller and J. W. Thatcher"
-, booktitle =	"Complexity of Computer Computations"
-, publisher =	"Plenum Press"
-, address =	"New York"
-, year =	1972
-, pages =	"88--104"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "R. Karp"
+, title =       "Reducibility among combinatorical problems of computer computaions"
+, editor =      "E. Miller and J. W. Thatcher"
+, booktitle =   "Complexity of Computer Computations"
+, publisher =   "Plenum Press"
+, address =     "New York"
+, year =        1972
+, pages =       "88--104"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @article{kl-tscap-75
-, author =	"R. Karp and S. Li"
-, title =	"Two special cases of the assignment problem"
-, journal =	"Discrete Math."
-, volume =	13
-, year =	1975
-, pages =	"129--142"
-, update =	"98.03 bibrelex"
+, author =      "R. Karp and S. Li"
+, title =       "Two special cases of the assignment problem"
+, journal =     "Discrete Math."
+, volume =      13
+, year =        1975
+, pages =       "129--142"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{klm-epsdm-92
-, author =	"R. Karp and M. Luby and F. {Meyer auf der Heide}"
-, title =	"Efficient PRAM simulation on distributed machines"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"318--326"
-, update =	"96.09 orourke"
+, author =      "R. Karp and M. Luby and F. {Meyer auf der Heide}"
+, title =       "Efficient PRAM simulation on distributed machines"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "318--326"
+, update =      "96.09 orourke"
 }
 
 @unpublished{km-pstoo-85
-, author =	"R. Karp and R. Motwani"
-, title =	"Preprocessing search trade-offs: an optimal randomized algorithm"
-, year =	1985
-, note =	"Computer Science Division U.C. Berkeley"
-, update =	"98.03 bibrelex"
+, author =      "R. Karp and R. Motwani"
+, title =       "Preprocessing search trade-offs: an optimal randomized algorithm"
+, year =        1985
+, note =        "Computer Science Division U.C. Berkeley"
+, update =      "98.03 bibrelex"
 }
 
 @article{k-papat-77
-, author =	"R. M. Karp"
-, title =	"Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane"
-, journal =	"Math. Oper. Res."
-, volume =	2
-, year =	1977
-, pages =	"209--224"
+, author =      "R. M. Karp"
+, title =       "Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane"
+, journal =     "Math. Oper. Res."
+, volume =      2
+, year =        1977
+, pages =       "209--224"
 }
 
 @incollection{k-pascs-76
-, author =	"R. M. Karp"
-, title =	"The probabilistic analysis of some combinatorial search algorithms"
-, editor =	"J. F. Traub"
-, booktitle =	"Algorithms and Complexity: New Directions and Recent Results"
-, publisher =	"Academic Press"
-, address =	"New York"
-, year =	1976
-, pages =	"1--19"
-, update =	"98.11 bibrelex"
+, author =      "R. M. Karp"
+, title =       "The probabilistic analysis of some combinatorial search algorithms"
+, editor =      "J. F. Traub"
+, booktitle =   "Algorithms and Complexity: New Directions and Recent Results"
+, publisher =   "Academic Press"
+, address =     "New York"
+, year =        1976
+, pages =       "1--19"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{klm-pambp-84
-, author =	"R. M. Karp and M. Luby and A. Marchetti-Spaccamela"
-, title =	"A probabilistic analysis of multidimensional bin-packing problems"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"289--299"
+, author =      "R. M. Karp and M. Luby and A. Marchetti-Spaccamela"
+, title =       "A probabilistic analysis of multidimensional bin-packing problems"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "289--299"
 }
 
 @article{kmr-dds-88
-, author =	"R. M. Karp and R. Motwani and P. Raghavan"
-, title =	"Deferred data structuring"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, year =	1988
-, pages =	"883--902"
-, succeeds =	"mr-ddsqd-86"
+, author =      "R. M. Karp and R. Motwani and P. Raghavan"
+, title =       "Deferred data structuring"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, year =        1988
+, pages =       "883--902"
+, succeeds =    "mr-ddsqd-86"
 }
 
 @techreport{kr-spasm-88t
-, author =	"R. M. Karp and V. Ramachandran"
-, title =	"A survey of parallel algorithms for shared-memory machines"
-, number =	"UCB/CSD 88/408"
-, institution =	"University of California, Berkeley"
-, year =	1988
-, precedes =	"kr-pasmm-90"
-, update =	"98.07 bibrelex"
+, author =      "R. M. Karp and V. Ramachandran"
+, title =       "A survey of parallel algorithms for shared-memory machines"
+, number =      "UCB/CSD 88/408"
+, institution = "University of California, Berkeley"
+, year =        1988
+, precedes =    "kr-pasmm-90"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{kr-pasmm-90
-, author =	"R. M. Karp and V. Ramachandran"
-, title =	"Parallel algorithms for shared memory machines"
-, editor =	"J. van Leeuwen"
-, booktitle =	"Handbook of Theoretical Computer Science"
-, publisher =	"Elsevier/The MIT Press"
-, address =	"Amsterdam"
-, year =	1990
-, pages =	"869--941"
-, succeeds =	"kr-spasm-88t"
-, update =	"98.07 bibrelex, 93.05 devillers"
+, author =      "R. M. Karp and V. Ramachandran"
+, title =       "Parallel algorithms for shared memory machines"
+, editor =      "J. van Leeuwen"
+, booktitle =   "Handbook of Theoretical Computer Science"
+, publisher =   "Elsevier/The MIT Press"
+, address =     "Amsterdam"
+, year =        1990
+, pages =       "869--941"
+, succeeds =    "kr-spasm-88t"
+, update =      "98.07 bibrelex, 93.05 devillers"
 }
 
 @inproceedings{ksss-obslm-93
-, author =	"R. M. Karp and A. Sahay and E. Santos and K. E. Schauser"
-, title =	"Optimal Broadcast and Summation in the {LogP} Model"
-, booktitle =	"Proc. 5th ACM Sympos. Parallel Algorithms Architect."
-, year =	1993
-, pages =	"142--153"
-, update =	"96.09 orourke"
+, author =      "R. M. Karp and A. Sahay and E. Santos and K. E. Schauser"
+, title =       "Optimal Broadcast and Summation in the {LogP} Model"
+, booktitle =   "Proc. 5th ACM Sympos. Parallel Algorithms Architect."
+, year =        1993
+, pages =       "142--153"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{kw-fpami-84
-, author =	"R. M. Karp and A. Wigderson"
-, title =	"A Fast Parallel Algorithm for the Maximal Independent Set Problem"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"86--109"
-, update =	"98.03 bibrelex"
+, author =      "R. M. Karp and A. Wigderson"
+, title =       "A Fast Parallel Algorithm for the Maximal Independent Set Problem"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "86--109"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{kz-fista-94
-, author =	"M. Karpinski and A. Zelikovsky"
-, title =	"Further improvements of {Steiner} tree approximations"
-, type =	"Report"
-, number =	"MPI-I-94-158"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, update =	"95.01 smid"
+, author =      "M. Karpinski and A. Zelikovsky"
+, title =       "Further improvements of {Steiner} tree approximations"
+, type =        "Report"
+, number =      "MPI-I-94-158"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, update =      "95.01 smid"
 }
 
 @inproceedings{k-ecbmf-73
-, author =	"A. V. Karzanov"
-, title =	"Exact complexity bound for a max-flow algorithm applied to ''representatives``"
-, booktitle =	"Voprosy Kibernetiki (Proc. of the Seminar on Combinatorial Mathematics)"
-, year =	1973
-, pages =	"66--70"
-, update =	"97.11 bibrelex"
+, author =      "A. V. Karzanov"
+, title =       "Exact complexity bound for a max-flow algorithm applied to ''representatives``"
+, booktitle =   "Voprosy Kibernetiki (Proc. of the Seminar on Combinatorial Mathematics)"
+, year =        1973
+, pages =       "66--70"
+, update =      "97.11 bibrelex"
 }
 
 @book{k-co-67
-, author =	"K. Kasahara"
-, title =	"Creative Origami"
-, publisher =	"Japan Publications"
-, year =	1967
-, update =	"97.11 bibrelex"
+, author =      "K. Kasahara"
+, title =       "Creative Origami"
+, publisher =   "Japan Publications"
+, year =        1967
+, update =      "97.11 bibrelex"
 }
 
 @book{kt-oc-78
-, author =	"K. Kasahara"
-, title =	"Origami for the Connoisseur"
-, publisher =	"Japan Publications"
-, year =	1978
-, update =	"97.11 bibrelex"
+, author =      "K. Kasahara"
+, title =       "Origami for the Connoisseur"
+, publisher =   "Japan Publications"
+, year =        1978
+, update =      "97.11 bibrelex"
 }
 
 @book{k-oo-88
-, author =	"K. Kasahara"
-, title =	"Origami Omnibus"
-, publisher =	"Japan Publications"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "K. Kasahara"
+, title =       "Origami Omnibus"
+, publisher =   "Japan Publications"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ko-gapdc-82
-, author =	"R. L. Kashyap and B. J. Oommen"
-, title =	"A geometrical approach to polygonal dissimilarity and the classification of closed boundaries"
-, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
-, year =	1982
-, pages =	"472--481"
+, author =      "R. L. Kashyap and B. J. Oommen"
+, title =       "A geometrical approach to polygonal dissimilarity and the classification of closed boundaries"
+, booktitle =   "Proc. 6th IEEE Internat. Conf. Pattern Recogn."
+, year =        1982
+, pages =       "472--481"
 }
 
 @article{k-drpte-89
-, author =	"E. A. Kasimatis"
-, title =	"Dissections of regular polygons into triangles of equal areas"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"375--381"
+, author =      "E. A. Kasimatis"
+, title =       "Dissections of regular polygons into triangles of equal areas"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "375--381"
 }
 
 @techreport{k-adppr-85
-, author =	"D. T. Kasper"
-, title =	"An algorithm for determining the position of a point relative to a polygon"
-, type =	"Report"
-, number =	"??"
-, institution =	"Advanced Products Lab., Hughes Support Syst."
-, address =	"Long Beach, CA"
-, year =	1985
+, author =      "D. T. Kasper"
+, title =       "An algorithm for determining the position of a point relative to a polygon"
+, type =        "Report"
+, number =      "??"
+, institution = "Advanced Products Lab., Hughes Support Syst."
+, address =     "Long Beach, CA"
+, year =        1985
 }
 
 @article{kk-rtcs-86
-, author =	"T. Kat and J. Kajiya"
-, title =	"Ray tracing complex scenes"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1986
-, pages =	"269--278"
-, update =	"98.07 bibrelex"
+, author =      "T. Kat and J. Kajiya"
+, title =       "Ray tracing complex scenes"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1986
+, pages =       "269--278"
+, update =      "98.07 bibrelex"
 }
 
 @article{km-etdpp-88
-, author =	"M. Katachalski and A. Meir"
-, title =	"On empty triangles determined by points in the plane"
-, journal =	"Acta Math. Hungar."
-, volume =	51
-, year =	1988
-, pages =	"323--328"
-, update =	"01.07 devillers, 98.03 bibrelex"
+, author =      "M. Katachalski and A. Meir"
+, title =       "On empty triangles determined by points in the plane"
+, journal =     "Acta Math. Hungar."
+, volume =      51
+, year =        1988
+, pages =       "323--328"
+, update =      "01.07 devillers, 98.03 bibrelex"
 }
 
 @article{k-wcmst-82
-, author =	"J. Katajainen"
-, title =	"On the worst case of a minimal spanning tree algorithm for {Euclidean} space"
-, journal =	"BIT"
-, volume =	23
-, year =	1982
-, pages =	"2--8"
+, author =      "J. Katajainen"
+, title =       "On the worst case of a minimal spanning tree algorithm for {Euclidean} space"
+, journal =     "BIT"
+, volume =      23
+, year =        1982
+, pages =       "2--8"
 }
 
 @techreport{k-racrn-85
-, author =	"J. Katajainen"
-, title =	"The region approach for computing relative neighborhood graphs in the {$L_{p}$} metric"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Math. Sci., Univ. Turku"
-, address =	"Turku, Finland"
-, year =	1985
+, author =      "J. Katajainen"
+, title =       "The region approach for computing relative neighborhood graphs in the {$L_{p}$} metric"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Math. Sci., Univ. Turku"
+, address =     "Turku, Finland"
+, year =        1985
 }
 
 @article{k-racrn-88
-, author =	"J. Katajainen"
-, title =	"The region approach for computing relative neighborhood graphs in the {$L_{p}$} metric"
-, journal =	"Computing"
-, volume =	40
-, year =	1988
-, pages =	"147--161"
-, update =	"98.07 bibrelex"
+, author =      "J. Katajainen"
+, title =       "The region approach for computing relative neighborhood graphs in the {$L_{p}$} metric"
+, journal =     "Computing"
+, volume =      40
+, year =        1988
+, pages =       "147--161"
+, update =      "98.07 bibrelex"
 }
 
 @article{kk-cdtmb-88
-, author =	"Jyrki Katajainen and Markku Koppinen"
-, title =	"Constructing {Delaunay} triangulations by merging buckets in quadtree order"
-, journal =	"Annales Societatis Mathematicae Polonae, Series IV, Fundamenta Informaticae"
-, volume =	11
-, number =	3
-, year =	1988
-, pages =	"275--288"
-, update =	"98.03 mitchell"
-, abstract =	"Recently R. A. Dwyer [Algorithmica 2, 137 - 151 (1987;
-		 Zbl. 631.68043)] presented an algorithm which
-		 constructs a Delaunay triangulation for a planar set of
-		 N sites in O(N log log N) expected time and O(N log N)
-		 worst-case-time. We show that a slight modification of
-		 his algorithm preserves the worst-case running time,
-		 but has only O(N) average running time. The method is a
-		 hybrid which combines the cell techniques with the
-		 divide-and-conquer algorithm of Leonidas J. Guibas and J. Stolfi
-		 [ACM Trans. Graphics 4, 74 - 123 (1985; Zbl.
-		 586.68059)]. First a square grid of size about sqrt(N)
-		 by sqrt(N) is placed on the set of sites. The grid
-		 forms about N cells (buckets), each of which is
-		 implemented as a list of the sites which fall into the
-		 corresponding square of the grid. A Delaunay
-		 triangulation of the generally rather few sites within
-		 each cell is constructed with the Guibas \& Stolfi
-		 algorithm. Then the triangulations are merged, four by
-		 four, in a quadtree-like order"
+, author =      "Jyrki Katajainen and Markku Koppinen"
+, title =       "Constructing {Delaunay} triangulations by merging buckets in quadtree order"
+, journal =     "Annales Societatis Mathematicae Polonae, Series IV, Fundamenta Informaticae"
+, volume =      11
+, number =      3
+, year =        1988
+, pages =       "275--288"
+, update =      "98.03 mitchell"
+, abstract =    "Recently R. A. Dwyer [Algorithmica 2, 137 - 151 (1987;
+                 Zbl. 631.68043)] presented an algorithm which
+                 constructs a Delaunay triangulation for a planar set of
+                 N sites in O(N log log N) expected time and O(N log N)
+                 worst-case-time. We show that a slight modification of
+                 his algorithm preserves the worst-case running time,
+                 but has only O(N) average running time. The method is a
+                 hybrid which combines the cell techniques with the
+                 divide-and-conquer algorithm of Leonidas J. Guibas and J. Stolfi
+                 [ACM Trans. Graphics 4, 74 - 123 (1985; Zbl.
+                 586.68059)]. First a square grid of size about sqrt(N)
+                 by sqrt(N) is placed on the set of sites. The grid
+                 forms about N cells (buckets), each of which is
+                 implemented as a list of the sites which fall into the
+                 corresponding square of the grid. A Delaunay
+                 triangulation of the generally rather few sites within
+                 each cell is constructed with the Guibas \& Stolfi
+                 algorithm. Then the triangulations are merged, four by
+                 four, in a quadtree-like order"
 }
 
 @article{knt-letac-87
-, author =	"J. Katajainen and O. Nevalainen and J. Teuhola"
-, title =	"A linear expected-time algorithm for computing planar relative neighbourhood graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"77--86"
+, author =      "J. Katajainen and O. Nevalainen and J. Teuhola"
+, title =       "A linear expected-time algorithm for computing planar relative neighbourhood graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "77--86"
 }
 
 @unpublished{kk-cdtmb-87
-, author =	"J. Katakjainen and M. Koppinen"
-, title =	"Constructing {Delaunay} triangulations by merging buckets in quad-tree order"
-, year =	1987
-, note =	"Unpublished Manuscript"
-, update =	"98.03 bibrelex"
+, author =      "J. Katakjainen and M. Koppinen"
+, title =       "Constructing {Delaunay} triangulations by merging buckets in quad-tree order"
+, year =        1987
+, note =        "Unpublished Manuscript"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ks-stish-97
-, author =	"Norio Katayama and Shin'ichi Satoh"
-, title =	"The {SR}-tree: {An} Index Structure for High-Dimensional Nearest Neighbor Queries"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1997
-, pages =	"369--380"
-, keywords =	"nearest neighbor, R-trees, bounding volume hierarchies"
-, update =	"99.03 forrest, 98.03 mitchell, 97.07 agarwal"
-, abstract =	"Recently, similarity queries on feature vectors have been widely used to
+, author =      "Norio Katayama and Shin'ichi Satoh"
+, title =       "The {SR}-tree: {An} Index Structure for High-Dimensional Nearest Neighbor Queries"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1997
+, pages =       "369--380"
+, keywords =    "nearest neighbor, R-trees, bounding volume hierarchies"
+, update =      "99.03 forrest, 98.03 mitchell, 97.07 agarwal"
+, abstract =    "Recently, similarity queries on feature vectors have been widely used to
 perform content-based retrieval of images. To apply this technique to large
 databases, it is required to develop multidimensional index structures
 supporting nearest neighbor queries efficiently. The SS-tree had been
@@ -86467,1357 +86467,1357 @@ @inproceedings{ks-stish-97
 }
 
 @article{k-cgct-86
-, author =	"M. Katchalski"
-, title =	"A conjecture of Gr{\"u}nbaum on common transversals"
-, journal =	"Math. Scan."
-, volume =	59
-, year =	1986
-, pages =	"192--198"
-, update =	"98.03 bibrelex"
+, author =      "M. Katchalski"
+, title =       "A conjecture of Gr{\"u}nbaum on common transversals"
+, journal =     "Math. Scan."
+, volume =      59
+, year =        1986
+, pages =       "192--198"
+, update =      "98.03 bibrelex"
 }
 
 @article{k-tsct-80
-, author =	"M. Katchalski"
-, title =	"Thin Sets and Common Transversals"
-, journal =	"J. Geom."
-, volume =	14
-, year =	1980
-, pages =	"103--107"
-, update =	"98.03 bibrelex"
+, author =      "M. Katchalski"
+, title =       "Thin Sets and Common Transversals"
+, journal =     "J. Geom."
+, volume =      14
+, year =        1980
+, pages =       "103--107"
+, update =      "98.03 bibrelex"
 }
 
 @article{kll-gpct-86
-, author =	"M. Katchalski and T. Lewis and A. Liu"
-, title =	"Geometric permutations and common transversals"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"371--377"
+, author =      "M. Katchalski and T. Lewis and A. Liu"
+, title =       "Geometric permutations and common transversals"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "371--377"
 }
 
 @article{kll-gpdt-87
-, author =	"M. Katchalski and T. Lewis and A. Liu"
-, title =	"Geometric permutations of disjoint translates of convex sets"
-, journal =	"Discrete Math."
-, volume =	65
-, year =	1987
-, pages =	"249--259"
-, update =	"95.09 agarwal"
+, author =      "M. Katchalski and T. Lewis and A. Liu"
+, title =       "Geometric permutations of disjoint translates of convex sets"
+, journal =     "Discrete Math."
+, volume =      65
+, year =        1987
+, pages =       "249--259"
+, update =      "95.09 agarwal"
 }
 
 @article{kll-dwsdc-92
-, author =	"M. Katchalski and T. Lewis and A. Liu"
-, title =	"The different ways of stabbing disjoint convex sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"197--206"
+, author =      "M. Katchalski and T. Lewis and A. Liu"
+, title =       "The different ways of stabbing disjoint convex sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "197--206"
 }
 
 @article{klz-gpcs-85
-, author =	"M. Katchalski and T. Lewis and J. Zaks"
-, title =	"Geometric permutations for convex sets"
-, journal =	"Discrete Math."
-, volume =	54
-, year =	1985
-, pages =	"271--284"
-, update =	"95.09 agarwal"
+, author =      "M. Katchalski and T. Lewis and J. Zaks"
+, title =       "Geometric permutations for convex sets"
+, journal =     "Discrete Math."
+, volume =      54
+, year =        1985
+, pages =       "271--284"
+, update =      "95.09 agarwal"
 }
 
 @article{kl-pgr-79
-, author =	"M. Katchalski and A. Liu"
-, title =	"A problem of geometry in ${R}^n$"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	75
-, year =	1979
-, pages =	"284--288"
-, update =	"97.11 bibrelex"
+, author =      "M. Katchalski and A. Liu"
+, title =       "A problem of geometry in ${R}^n$"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      75
+, year =        1979
+, pages =       "284--288"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{kn-cdg-96
-, author =	"M. Katchalski and D. Nashtir"
-, title =	"On a conjecture of {Danzer} and {Gr{\"u}nbaum}"
-, booktitle =	"Proc. Amer. Math. Soc."
-, year =	1996
-, update =	"97.11 bibrelex"
+, author =      "M. Katchalski and D. Nashtir"
+, title =       "On a conjecture of {Danzer} and {Gr{\"u}nbaum}"
+, booktitle =   "Proc. Amer. Math. Soc."
+, year =        1996
+, update =      "97.11 bibrelex"
 }
 
 @article{ki-pceas-87
-, author =	"N. Katoh and T. Ibaraki"
-, title =	"A parametric characterization and an $\varepsilon$-approximation scheme for the minimization of a quasiconcave program"
-, journal =	"Discrete Appl. Math."
-, volume =	17
-, year =	1987
-, pages =	"39--66"
-, update =	"98.03 bibrelex"
+, author =      "N. Katoh and T. Ibaraki"
+, title =       "A parametric characterization and an $\varepsilon$-approximation scheme for the minimization of a quasiconcave program"
+, journal =     "Discrete Appl. Math."
+, volume =      17
+, year =        1987
+, pages =       "39--66"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ki-tnprc-83
-, author =	"N. Katoh and T. Ibaraki"
-, title =	"On the total number of pivots required for certain parametric combinatorial optimization problems"
-, type =	"Working {Paper}"
-, number =	71
-, institution =	"Institute of Economic Research, Kobe University"
-, address =	"Kobe, Japan"
-, year =	1983
-, update =	"98.03 bibrelex"
+, author =      "N. Katoh and T. Ibaraki"
+, title =       "On the total number of pivots required for certain parametric combinatorial optimization problems"
+, type =        "Working {Paper}"
+, number =      71
+, institution = "Institute of Economic Research, Kobe University"
+, address =     "Kobe, Japan"
+, year =        1983
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ki-fkbdn-91
-, author =	"N. Katoh and K. Iwano"
-, title =	"Finding $k$ best distances of $n$ points in the plane"
-, institution =	"Kobe Univ."
-, address =	"Kobe, Japan"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "N. Katoh and K. Iwano"
+, title =       "Finding $k$ best distances of $n$ points in the plane"
+, institution = "Kobe Univ."
+, address =     "Kobe, Japan"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @article{ki-fkfpk-95
-, author =	"N. Katoh and K. Iwano"
-, title =	"Finding $k$ farthest pairs and $k$ closest/farthest bichromatic pairs for points in the plane"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"37--51"
-, keywords =	"k farthest pairs, k closest/farthest bichromatic pairs, higher order Voronoi diagrams"
-, succeeds =	"ki-fkfpk-92"
-, update =	"96.09 devillers"
+, author =      "N. Katoh and K. Iwano"
+, title =       "Finding $k$ farthest pairs and $k$ closest/farthest bichromatic pairs for points in the plane"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "37--51"
+, keywords =    "k farthest pairs, k closest/farthest bichromatic pairs, higher order Voronoi diagrams"
+, succeeds =    "ki-fkfpk-92"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{ki-fkfpk-92
-, author =	"N. Katoh and K. Iwano"
-, title =	"Finding $k$ farthest pairs and $k$ closest pairs/farthest bichromatic pairs for points in the plane"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"320--329"
-, precedes =	"ki-fkfpk-95"
-, cites =	"aass-sdp-90, aiks-fkpmd-91, bfprt-tbs-73, c-ntcos-85, ce-iacko-87, c-narsc-87, dd-ekdnp-91, ds-ekldn-92, ddg-fsp-83, e-esaa-86, fj-csrxm-82, k-osps-83, l-knnvd-82, lt-apst-80, ps-cgi-85, s-lisps-89, s-sisie-91, hss-pgcrm-87, s-mmdpsl-90t, v-oaann-89, ZZZ"
-, update =	"97.11 bibrelex, 96.09 devillers"
+, author =      "N. Katoh and K. Iwano"
+, title =       "Finding $k$ farthest pairs and $k$ closest pairs/farthest bichromatic pairs for points in the plane"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "320--329"
+, precedes =    "ki-fkfpk-95"
+, cites =       "aass-sdp-90, aiks-fkpmd-91, bfprt-tbs-73, c-ntcos-85, ce-iacko-87, c-narsc-87, dd-ekdnp-91, ds-ekldn-92, ddg-fsp-83, e-esaa-86, fj-csrxm-82, k-osps-83, l-knnvd-82, lt-apst-80, ps-cgi-85, s-lisps-89, s-sisie-91, hss-pgcrm-87, s-mmdpsl-90t, v-oaann-89, ZZZ"
+, update =      "97.11 bibrelex, 96.09 devillers"
 }
 
 @inproceedings{kt-ncpkp-01
-, author =	"Naoki Katoh and Takeshi Tokuyama"
-, title =	"Notes on Computing Peaks in K-Levels and Parametric Spanning Trees"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
-, year =	2001
-, pages =	"241--248"
-, update =	"01.11 pocchiola"
+, author =      "Naoki Katoh and Takeshi Tokuyama"
+, title =       "Notes on Computing Peaks in K-Levels and Parametric Spanning Trees"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Comput. Geom."
+, year =        2001
+, pages =       "241--248"
+, update =      "01.11 pocchiola"
 }
 
 @inproceedings{kti-mmstl-92
-, author =	"N. Katoh and T. Tokuyama and K. Iwano"
-, title =	"On minimum and maximum spanning trees of linearly moving points"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"396--405"
+, author =      "N. Katoh and T. Tokuyama and K. Iwano"
+, title =       "On minimum and maximum spanning trees of linearly moving points"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "396--405"
 }
 
 @article{kti-mmstl-95
-, author =	"N. Katoh and T. Tokuyama and K. Iwano"
-, title =	"On minimum and maximum spanning trees of linearly moving points"
-, journal =	"Discrete Comput. Geom."
-, volume =	13
-, year =	1995
-, pages =	"161--176"
-, update =	"95.05 smid"
+, author =      "N. Katoh and T. Tokuyama and K. Iwano"
+, title =       "On minimum and maximum spanning trees of linearly moving points"
+, journal =     "Discrete Comput. Geom."
+, volume =      13
+, year =        1995
+, pages =       "161--176"
+, update =      "95.05 smid"
 }
 
 @article{ks-pgt-67
-, author =	"G. Katona and E. Szemer{\'e}di"
-, title =	"On a problem in a graph theory"
-, journal =	"Studia Scientiarium Mathematicarum Hungarica"
-, volume =	2
-, year =	1967
-, pages =	"23--28"
-, update =	"98.03 bibrelex"
+, author =      "G. Katona and E. Szemer{\'e}di"
+, title =       "On a problem in a graph theory"
+, journal =     "Studia Scientiarium Mathematicarum Hungarica"
+, volume =      2
+, year =        1967
+, pages =       "23--28"
+, update =      "98.03 bibrelex"
 }
 
 @article{k-dess-89
-, author =	"M. Katz"
-, title =	"Diameter-extremal subsets of spheres"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"117--137"
+, author =      "M. Katz"
+, title =       "Diameter-extremal subsets of spheres"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "117--137"
 }
 
 @techreport{kn-pso-96-t
-, author =	"Matthew Katz and Franck Nielsen"
-, title =	"On Piercing Sets of Objects"
-, type =	"Rapport de recherche"
-, number =	2874
-, institution =	"INRIA"
-, year =	1996
-, update =	"02.03 devillers, 97.11 bibrelex"
-, abstract =	"A set of objects is $k$-pierceable if there exists a set of $k$ poin ts such that each object is pierced by (contains) at least one of these points.  Finding the smallest integer $k$ such that a set is $k$-pierceable is NP-complete. In this technical report, we present efficient algorithms for findi ng a piercing set (i.e., a set of $k$ points as above) for several classes of convex objects and small values of $k$.  In some of the cases, our algorithms imply known as well as new Helly-type theorems, thus adding to previous results of Danzer and Gr{\"u}nbaum who studied the case of axis-parallel boxes.  The problems studied here are related to the collection of optimization problems in which one seeks the smallest scaling factor of a centrally symmetric convex object $K$, so that a set of points can be covered by $k$ congruent homothets of $K$."
+, author =      "Matthew Katz and Franck Nielsen"
+, title =       "On Piercing Sets of Objects"
+, type =        "Rapport de recherche"
+, number =      2874
+, institution = "INRIA"
+, year =        1996
+, update =      "02.03 devillers, 97.11 bibrelex"
+, abstract =    "A set of objects is $k$-pierceable if there exists a set of $k$ poin ts such that each object is pierced by (contains) at least one of these points.  Finding the smallest integer $k$ such that a set is $k$-pierceable is NP-complete. In this technical report, we present efficient algorithms for findi ng a piercing set (i.e., a set of $k$ points as above) for several classes of convex objects and small values of $k$.  In some of the cases, our algorithms imply known as well as new Helly-type theorems, thus adding to previous results of Danzer and Gr{\"u}nbaum who studied the case of axis-parallel boxes.  The problems studied here are related to the collection of optimization problems in which one seeks the smallest scaling factor of a centrally symmetric convex object $K$, so that a set of points can be covered by $k$ congruent homothets of $K$."
 }
 
 @phdthesis{k-grdsc-85
-, author =	"M. D. Katz"
-, title =	"Geometric retrieval: data structures and computational complexity"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Inform. Comput. Sci., Univ. California Irvine"
-, address =	"Irvine, CA"
-, year =	1985
-, keywords =	"doctoral thesis"
+, author =      "M. D. Katz"
+, title =       "Geometric retrieval: data structures and computational complexity"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Inform. Comput. Sci., Univ. California Irvine"
+, address =     "Irvine, CA"
+, year =        1985
+, keywords =    "doctoral thesis"
 }
 
 @article{kv-dsrsq-86
-, author =	"M. D. Katz and D. J. Volper"
-, title =	"Data structures for retrieval on square grids"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"919--931"
-, update =	"97.07 agarwal"
+, author =      "M. D. Katz and D. J. Volper"
+, title =       "Data structures for retrieval on square grids"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "919--931"
+, update =      "97.07 agarwal"
 }
 
 @article{k-3vrs2-??
-, author =	"M. J. Katz"
-, title =	"{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects"
-, journal =	"Comput. Geom. Theory Appl."
-, note =	"to appear"
-, succeeds =	"k-3vrs2-95"
-, update =	"97.11 katz"
+, author =      "M. J. Katz"
+, title =       "{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects"
+, journal =     "Comput. Geom. Theory Appl."
+, note =        "to appear"
+, succeeds =    "k-3vrs2-95"
+, update =      "97.11 katz"
 }
 
 @techreport{k-3vrs2-95
-, author =	"M. J. Katz"
-, title =	"{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects"
-, type =	"Research {Report}"
-, number =	2583
-, institution =	"INRIA"
-, address =	"BP93, 06902 Sophia-Antipolis, France"
-, year =	1995
-, update =	"97.11 katz, 96.09 smid"
+, author =      "M. J. Katz"
+, title =       "{3-D} vertical ray shooting and {2-D} point enclosure, range searching, and arc shooting amidst convex fat objects"
+, type =        "Research {Report}"
+, number =      2583
+, institution = "INRIA"
+, address =     "BP93, 06902 Sophia-Antipolis, France"
+, year =        1995
+, update =      "97.11 katz, 96.09 smid"
 }
 
 @phdthesis{k-
-, author =	"M. J. Katz"
-, title =	"Geometric Optimization via Expanders and Visibility of Fat Objects in Three Dimensions: Two Studies in Computational Geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"Tel-Aviv University"
-, address =	"Tel-Aviv, Israel"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"97.11 katz"
+, author =      "M. J. Katz"
+, title =       "Geometric Optimization via Expanders and Visibility of Fat Objects in Three Dimensions: Two Studies in Computational Geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "Tel-Aviv University"
+, address =     "Tel-Aviv, Israel"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "97.11 katz"
 }
 
 @inproceedings{k-iagoe-95
-, author =	"M. J. Katz"
-, title =	"Improved algorithms in geometric optimization via expanders"
-, booktitle =	"Proc. 3rd Israel Symposium on Theory of Computing and Systems"
-, year =	1995
-, pages =	"78--87"
-, update =	"96.01 devillers"
+, author =      "M. J. Katz"
+, title =       "Improved algorithms in geometric optimization via expanders"
+, booktitle =   "Proc. 3rd Israel Symposium on Theory of Computing and Systems"
+, year =        1995
+, pages =       "78--87"
+, update =      "96.01 devillers"
 }
 
 @inproceedings{kks-cscp-98
-, author =	"Matthew J. Katz and Klara Kedem and Michael Segal"
-, title =	"Constrained Square Center Problems"
-, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '98"
-, site =	"Stockholm"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1432
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"95--106"
-, precedes =	"kks-dr2cp-00"
-, update =	"00.03 smid, 99.03 bibrelex, 98.07 mitchell"
+, author =      "Matthew J. Katz and Klara Kedem and Michael Segal"
+, title =       "Constrained Square Center Problems"
+, booktitle =   "Proc. 6th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '98"
+, site =        "Stockholm"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1432
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "95--106"
+, precedes =    "kks-dr2cp-00"
+, update =      "00.03 smid, 99.03 bibrelex, 98.07 mitchell"
 }
 
 @article{kks-dr2cp-00
-, author =	"M. J. Katz and K. Kedem and M. Segal"
-, title =	"Discrete rectilinear $2$-center problems"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	15
-, year =	2000
-, pages =	"203--214"
-, succeeds =	"kks-cscp-98"
-, update =	"00.03 smid"
+, author =      "M. J. Katz and K. Kedem and M. Segal"
+, title =       "Discrete rectilinear $2$-center problems"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      15
+, year =        2000
+, pages =       "203--214"
+, succeeds =    "kks-cscp-98"
+, update =      "00.03 smid"
 }
 
 @inproceedings{kks-iapuf-99
-, author =	"Matthew J. Katz and Klara Kedem and Michael Segal"
-, title =	"Improved Algorithms for Placing Undesirable Facilities"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"39--42"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Matthew J. Katz and Klara Kedem and Michael Segal"
+, title =       "Improved Algorithms for Placing Undesirable Facilities"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "39--42"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{kn-pso-96-i
-, author =	"M. J. Katz and F. Nielsen"
-, title =	"On Piercing Sets of Objects"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"113--121"
-, cites =	"a-httgl-94, bglr-epcpa-93, c-ghscp-79, cm-ltdao-93, dg-ipbr-82, dgk-htir-63, fpt-opcpa-81, gw-hcg-93a, hd-kgde-60, h-aascv-82, k-racpc-72, kn-cdg-96, kn-pso-t, m-apcad-83, msw-sblp-92, s-nlap2-96, sw-rpppp-96, ZZZ"
-, update =	"02.03 devillers, 98.03 bibrelex, 97.11 bibrelex+katz, 96.05 efrat"
+, author =      "M. J. Katz and F. Nielsen"
+, title =       "On Piercing Sets of Objects"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "113--121"
+, cites =       "a-httgl-94, bglr-epcpa-93, c-ghscp-79, cm-ltdao-93, dg-ipbr-82, dgk-htir-63, fpt-opcpa-81, gw-hcg-93a, hd-kgde-60, h-aascv-82, k-racpc-72, kn-cdg-96, kn-pso-t, m-apcad-83, msw-sblp-92, s-nlap2-96, sw-rpppp-96, ZZZ"
+, update =      "02.03 devillers, 98.03 bibrelex, 97.11 bibrelex+katz, 96.05 efrat"
 }
 
 @inproceedings{kns-sltps-00
-, author =	"Matthew J. Katz and Frank Nielsen and Micheal Segal"
-, title =	"Shooter Location Through Piercing Sets"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"55--58"
-, update =	"00.03 bibrelex"
+, author =      "Matthew J. Katz and Frank Nielsen and Micheal Segal"
+, title =       "Shooter Location Through Piercing Sets"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "55--58"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{kos-ehsro-91
-, author =	"M. J. Katz and M. H. Overmars and Micha Sharir"
-, title =	"Efficient hidden surface removal for objects with small union size"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"31--40"
-, keywords =	"hidden surface removal"
-, cites =	"as-anspt-91, b-hsrr-90, bo-arcgi-79, bo-hsrap-90, cegpsss-ccclr-90, cs-vppt-89, d-qbhle-86, g-pahle-87i, gao-isost-90, go-nasch-87, klps-ujrcf-86, ms-rcibt-88, mpssw-ftdlm-90, m-wcohs-87, m-eahsr-89, n-flsah-85, os-oshsr-89, os-itosh-89, os-mvm-91, py-bpahs-89, ps-cgi-85, pvy-cavsi-90, rs-eoshs-88i, so-sosah-92, s-tsbhl-81, sss-cthsa-74, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "M. J. Katz and M. H. Overmars and Micha Sharir"
+, title =       "Efficient hidden surface removal for objects with small union size"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "31--40"
+, keywords =    "hidden surface removal"
+, cites =       "as-anspt-91, b-hsrr-90, bo-arcgi-79, bo-hsrap-90, cegpsss-ccclr-90, cs-vppt-89, d-qbhle-86, g-pahle-87i, gao-isost-90, go-nasch-87, klps-ujrcf-86, ms-rcibt-88, mpssw-ftdlm-90, m-wcohs-87, m-eahsr-89, n-flsah-85, os-oshsr-89, os-itosh-89, os-mvm-91, py-bpahs-89, ps-cgi-85, pvy-cavsi-90, rs-eoshs-88i, so-sosah-92, s-tsbhl-81, sss-cthsa-74, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{kos-ehsro-92
-, author =	"M. J. Katz and M. H. Overmars and Micha Sharir"
-, title =	"Efficient hidden surface removal for objects with small union size"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, year =	1992
-, pages =	"223--234"
-, keywords =	"hidden surface removal"
-, update =	"98.03 mitchell, 96.05 ramkumar"
+, author =      "M. J. Katz and M. H. Overmars and Micha Sharir"
+, title =       "Efficient hidden surface removal for objects with small union size"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, year =        1992
+, pages =       "223--234"
+, keywords =    "hidden surface removal"
+, update =      "98.03 mitchell, 96.05 ramkumar"
 }
 
 @inproceedings{ks-ebago-93
-, author =	"M. J. Katz and Micha Sharir"
-, title =	"An expander-based approach to geometric optimization"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"198--207"
-, cites =	"aass-sdp-90, aest-cscpp-91, am-rsps-92, as-pglp-90, ast-apsgo-92, am-dptnp-96, as-pm-92, cegs-dwclp-92, csw-qoubs-92, cw-qorss-89, cs-arscg-89, c-sdsno-87, csss-otass-89, dmn-rass-92, hw-ensrq-87, hs-ftp-91, ks-osse-, lps-rg-88, m-egtcc-88, m-roass-91, m-ept-92, m-rsehc-92, ms-datdd-93, m-apcad-83, st-epcp-91, v-pcp-75, ZZZ"
-, update =	"99.03 forrest, 98.11 bibrelex, 98.03 bibrelex+mitchell, 93.09 jones"
+, author =      "M. J. Katz and Micha Sharir"
+, title =       "An expander-based approach to geometric optimization"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "198--207"
+, cites =       "aass-sdp-90, aest-cscpp-91, am-rsps-92, as-pglp-90, ast-apsgo-92, am-dptnp-96, as-pm-92, cegs-dwclp-92, csw-qoubs-92, cw-qorss-89, cs-arscg-89, c-sdsno-87, csss-otass-89, dmn-rass-92, hw-ensrq-87, hs-ftp-91, ks-osse-, lps-rg-88, m-egtcc-88, m-roass-91, m-ept-92, m-rsehc-92, ms-datdd-93, m-apcad-83, st-epcp-91, v-pcp-75, ZZZ"
+, update =      "99.03 forrest, 98.11 bibrelex, 98.03 bibrelex+mitchell, 93.09 jones"
 }
 
 @article{ks-ebago-97
-, author =	"M. J. Katz and Micha Sharir"
-, title =	"An expander-based approach to geometric optimization"
-, journal =	"SIAM J. Comput."
-, volume =	26
-, year =	1997
-, pages =	"1384--1408"
-, succeeds =	"ks-ebago-93"
-, update =	"98.03 mitchell, 97.11 katz+smid"
+, author =      "M. J. Katz and Micha Sharir"
+, title =       "An expander-based approach to geometric optimization"
+, journal =     "SIAM J. Comput."
+, volume =      26
+, year =        1997
+, pages =       "1384--1408"
+, succeeds =    "ks-ebago-93"
+, update =      "98.03 mitchell, 97.11 katz+smid"
 }
 
 @techreport{ks-osse-
-, author =	"M. J. Katz and M. Sharir"
-, title =	"Optimal slope selection via expanders"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
-, precedes =	"ks-osse-93i"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "M. J. Katz and M. Sharir"
+, title =       "Optimal slope selection via expanders"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
+, precedes =    "ks-osse-93i"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{ks-osse-93i
-, author =	"M. J. Katz and Micha Sharir"
-, title =	"Optimal slope selection via expanders"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"139--144"
-, succeeds =	"ks-osse-"
-, cites =	"as-pm-92, am-dptnp-92, cegs-dwclp-92, c-sdsno-87, csss-oss-88, dmn-rass-92, e-acg-87, ks-ebago-93, lps-eerc-86, m-egtcc-88, m-roass-91, m-cha-91, m-apcad-83, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 95.09 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "M. J. Katz and Micha Sharir"
+, title =       "Optimal slope selection via expanders"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "139--144"
+, succeeds =    "ks-osse-"
+, cites =       "as-pm-92, am-dptnp-92, cegs-dwclp-92, c-sdsno-87, csss-oss-88, dmn-rass-92, e-acg-87, ks-ebago-93, lps-eerc-86, m-egtcc-88, m-roass-91, m-cha-91, m-apcad-83, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 95.09 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{ks-osse-93
-, author =	"M. J. Katz and Micha Sharir"
-, title =	"Optimal slope selection via expanders"
-, journal =	"Inform. Process. Lett."
-, volume =	47
-, year =	1993
-, pages =	"115--122"
-, update =	"98.03 mitchell, 94.05 sharir"
+, author =      "M. J. Katz and Micha Sharir"
+, title =       "Optimal slope selection via expanders"
+, journal =     "Inform. Process. Lett."
+, volume =      47
+, year =        1993
+, pages =       "115--122"
+, update =      "98.03 mitchell, 94.05 sharir"
 }
 
 @unpublished{kv-tbngp-99
-, author =	"M. J. Katz and K. R. Varadarajan"
-, title =	"A tight bound on the number of geometric permutations of convex fat objects in {$\Re^d$}"
-, year =	1999
-, note =	"Dept. Comput. Sci., Ben-Gurion University of the Negev, Israel"
-, update =	"01.04 orourke"
+, author =      "M. J. Katz and K. R. Varadarajan"
+, title =       "A tight bound on the number of geometric permutations of convex fat objects in {$\Re^d$}"
+, year =        1999
+, note =        "Dept. Comput. Sci., Ben-Gurion University of the Negev, Israel"
+, update =      "01.04 orourke"
 }
 
 @article{ks-gictr-??
-, author =	"S. Katz and T. W. Sederberg"
-, title =	"Genus of the intersection curve of two rational surface patches"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	5
-, year =	"??"
-, pages =	"253--258"
-, update =	"97.11 bibrelex"
+, author =      "S. Katz and T. W. Sederberg"
+, title =       "Genus of the intersection curve of two rational surface patches"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      5
+, year =        "??"
+, pages =       "253--258"
+, update =      "97.11 bibrelex"
 }
 
 @article{k-aairm-83
-, author =	"S. Kauffman"
-, title =	"An Algorithmic Approach to Intelligent Robot Mobility"
-, journal =	"Robotics Age"
-, volume =	5
-, number =	3
-, year =	1983
-, pages =	"38--47"
-, update =	"93.09 milone+mitchell"
+, author =      "S. Kauffman"
+, title =       "An Algorithmic Approach to Intelligent Robot Mobility"
+, journal =     "Robotics Age"
+, volume =      5
+, number =      3
+, year =        1983
+, pages =       "38--47"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{ks-saplc-99
-, author =	"Pierre Kauffmann and Jean-Claude Spehner"
-, title =	"Sweeping Along a Polygonal Line to Construct a {Delaunay} Diagram"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"153--155"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Pierre Kauffmann and Jean-Claude Spehner"
+, title =       "Sweeping Along a Polygonal Line to Construct a {Delaunay} Diagram"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "153--155"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @article{kcy-vg-93
-, author =	"A. Kaufman and D. Cohen and R. Yagel"
-, title =	"Volumetric Graphics"
-, journal =	"IEEE Computer"
-, volume =	26
-, number =	7
-, year =	1993
-, pages =	"51--64"
-, update =	"98.03 mitchell"
+, author =      "A. Kaufman and D. Cohen and R. Yagel"
+, title =       "Volumetric Graphics"
+, journal =     "IEEE Computer"
+, volume =      26
+, number =      7
+, year =        1993
+, pages =       "51--64"
+, update =      "98.03 mitchell"
 }
 
 @book{k-vv-90
-, author =	"A. E. Kaufman"
-, title =	"Volume Visualization"
-, publisher =	"IEEE Computer Society Press"
-, address =	"Los Alamitos, CA"
-, year =	1990
-, isbn =	"908186-9020-8"
-, update =	"98.03 mitchell"
+, author =      "A. E. Kaufman"
+, title =       "Volume Visualization"
+, publisher =   "IEEE Computer Society Press"
+, address =     "Los Alamitos, CA"
+, year =        1990
+, isbn =        "908186-9020-8"
+, update =      "98.03 mitchell"
 }
 
 @book{kr-fgdic-90
-, author =	"L. Kaufman and P. J. Rousseeuw"
-, title =	"Finding Groups in Data: An Introduction to Cluster Analysis"
-, publisher =	"John Wiley \& Sons"
-, year =	1990
-, update =	"99.11 bibrelex, 98.07 agarwal"
+, author =      "L. Kaufman and P. J. Rousseeuw"
+, title =       "Finding Groups in Data: An Introduction to Cluster Analysis"
+, publisher =   "John Wiley \& Sons"
+, year =        1990
+, update =      "99.11 bibrelex, 98.07 agarwal"
 }
 
 @book{ks-sts-93
-, author =	"W. J. {Kaufmann III} and L. L. Smarr"
-, title =	"Supercomputing and the transformation of science"
-, publisher =	"Scientific American Library"
-, address =	"New York, NY"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "W. J. {Kaufmann III} and L. L. Smarr"
+, title =       "Supercomputing and the transformation of science"
+, publisher =   "Scientific American Library"
+, address =     "New York, NY"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{kgt-smtgg-94
-, author =	"M. Kaufmann and S. Gao and K. Thulasiraman"
-, title =	"On {Steiner} Minimal Tree in Grid Graphs and Its Application to {VLSI} Routing"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"351--359"
-, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
+, author =      "M. Kaufmann and S. Gao and K. Thulasiraman"
+, title =       "On {Steiner} Minimal Tree in Grid Graphs and Its Application to {VLSI} Routing"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "351--359"
+, update =      "99.11 bibrelex, 98.03 smid, 96.05 mitchell"
 }
 
 @inproceedings{kk-faedp-91
-, author =	"Michael Kaufmann and Gerhard Kl{\"a}r"
-, title =	"A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs"
-, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"336--348"
-, update =	"94.01 smid, 93.09 milone+mitchell"
+, author =      "Michael Kaufmann and Gerhard Kl{\"a}r"
+, title =       "A Faster Algorithm for Edge-Disjoint Paths in Planar Graphs"
+, booktitle =   "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "336--348"
+, update =      "94.01 smid, 93.09 milone+mitchell"
 }
 
 @techreport{km-lrttn-84
-, author =	"M. Kaufmann and K. Mehlhorn"
-, title =	"Local routing of two-terminal nets is easy"
-, type =	"Report"
-, number =	"A84/12"
-, institution =	"Fachber. Inform., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1984
+, author =      "M. Kaufmann and K. Mehlhorn"
+, title =       "Local routing of two-terminal nets is easy"
+, type =        "Report"
+, number =      "A84/12"
+, institution = "Fachber. Inform., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1984
 }
 
 @article{km-rtgs-86
-, author =	"M. Kaufmann and K. Mehlhorn"
-, title =	"Routing through a generalized switchbox"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"510--531"
+, author =      "M. Kaufmann and K. Mehlhorn"
+, title =       "Routing through a generalized switchbox"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "510--531"
 }
 
 @inproceedings{krb-sadlg-95
-, author =	"K. Kaugars and J. Reinfelds and A. Brazma"
-, title =	"A Simple Algorithm for Drawing Large Graphs on Small Screens"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"278--281"
-, keywords =	"graph drawing, system, fisheye view"
-, update =	"95.01 tamassia"
+, author =      "K. Kaugars and J. Reinfelds and A. Brazma"
+, title =       "A Simple Algorithm for Drawing Large Graphs on Small Screens"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "278--281"
+, keywords =    "graph drawing, system, fisheye view"
+, update =      "95.01 tamassia"
 }
 
 @article{kf-cmspc-95
-, author =	"A. Kaul and R. Farouki"
-, title =	"Computing {Minkowski} sums of plane curves"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"413--432"
-, keywords =	"Minkowski sums, plane curves, convolutions, Gauss maps, shape design, configuration space"
-, update =	"96.09 devillers"
+, author =      "A. Kaul and R. Farouki"
+, title =       "Computing {Minkowski} sums of plane curves"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "413--432"
+, keywords =    "Minkowski sums, plane curves, convolutions, Gauss maps, shape design, configuration space"
+, update =      "96.09 devillers"
 }
 
 @techreport{ko-cmsrp-93
-, author =	"A. Kaul and M. A. O'Connor"
-, title =	"Computing {Minkowski} sums of regular polyhedra"
-, type =	"Report"
-, number =	"RC 18891 (82557) 5/12/93"
-, institution =	"IBM T.J. Watson Research Center"
-, address =	"Yorktown Heights, NY 10598"
-, year =	1993
-, update =	"98.07 bibrelex, 96.05 ramkumar"
+, author =      "A. Kaul and M. A. O'Connor"
+, title =       "Computing {Minkowski} sums of regular polyhedra"
+, type =        "Report"
+, number =      "RC 18891 (82557) 5/12/93"
+, institution = "IBM T.J. Watson Research Center"
+, address =     "Yorktown Heights, NY 10598"
+, year =        1993
+, update =      "98.07 bibrelex, 96.05 ramkumar"
 }
 
 @inproceedings{kos-cmsrp-91i
-, author =	"A. Kaul and M. A. O'Connor and V. Srinivasan"
-, title =	"Computing {Minkowski} sums of regular polygons"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"74--77"
-, cites =	"bo-arcgi-79, dhks-isccd-90, g-ctfsr-86, g-cp-67, grs-kfcg-83, gs-lncg-83, kos-cmsrp-91t, klps-ujrcf-86, m-rsig-75, ps-cgi-85, s-iamm-82, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "A. Kaul and M. A. O'Connor and V. Srinivasan"
+, title =       "Computing {Minkowski} sums of regular polygons"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "74--77"
+, cites =       "bo-arcgi-79, dhks-isccd-90, g-ctfsr-86, g-cp-67, grs-kfcg-83, gs-lncg-83, kos-cmsrp-91t, klps-ujrcf-86, m-rsig-75, ps-cgi-85, s-iamm-82, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{kos-cmsrp-91t
-, author =	"A. Kaul and M. A. O'Connor and V. Srinivasan"
-, title =	"Computing {Minkowski} sums of regular polygons"
-, type =	"Report"
-, number =	"RC 18523 (80982) 11/13/93"
-, institution =	"IBM T.J. Watson Research Center"
-, address =	"Yorktown Heights, NY 10598"
-, year =	1992
-, update =	"98.07 bibrelex, 96.05 ramkumar"
+, author =      "A. Kaul and M. A. O'Connor and V. Srinivasan"
+, title =       "Computing {Minkowski} sums of regular polygons"
+, type =        "Report"
+, number =      "RC 18523 (80982) 11/13/93"
+, institution = "IBM T.J. Watson Research Center"
+, address =     "Yorktown Heights, NY 10598"
+, year =        1992
+, update =      "98.07 bibrelex, 96.05 ramkumar"
 }
 
 @inproceedings{kr-sidc-92
-, author =	"A. Kaul and J. Rossignac"
-, title =	"Solid-interpolating deformations: construction and animation of {PIPs}"
-, booktitle =	"Proc. Eurographics '91"
-, year =	1991
-, pages =	"493--505"
-, comments =	"use of Minkowski sums for animation"
-, update =	"96.05 ramkumar"
+, author =      "A. Kaul and J. Rossignac"
+, title =       "Solid-interpolating deformations: construction and animation of {PIPs}"
+, booktitle =   "Proc. Eurographics '91"
+, year =        1991
+, pages =       "493--505"
+, comments =    "use of Minkowski sums for animation"
+, update =      "96.05 ramkumar"
 }
 
 @phdthesis{k-rncsf-95
-, author =	"L. Kavraki"
-, title =	"Random Networks in Configuration Space for Fast Path Planning"
-, school =	"Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1995
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "L. Kavraki"
+, title =       "Random Networks in Configuration Space for Fast Path Planning"
+, school =      "Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1995
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{kl-cppa-93t
-, author =	"L. Kavraki and J.-C. Latombe"
-, title =	"Complexity of partitioning a planar assembly"
-, number =	"STAN-CS-93-1467"
-, institution =	"Department of Computer Science, Stanford University"
-, year =	1993
-, precedes =	"klw-cap-93"
-, update =	"98.11 bibrelex"
+, author =      "L. Kavraki and J.-C. Latombe"
+, title =       "Complexity of partitioning a planar assembly"
+, number =      "STAN-CS-93-1467"
+, institution = "Department of Computer Science, Stanford University"
+, year =        1993
+, precedes =    "klw-cap-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{klw-cap-93
-, author =	"L. Kavraki and J.-C. Latombe and R. Wilson"
-, title =	"On the Complexity of Assembly Partitioning"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"12--17"
-, succeeds =	"kl-cppa-93t"
-, cites =	"acm-mpoap-89, gj-cigtn-79, m-camap-91, kl-cppa-93t, n-pa-88, pss-stsps-88, ss-pmp1c-83, ss-otcbt-93, t-mss-85, w-fap-92, hr-s-83, wll-cpa-92, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "L. Kavraki and J.-C. Latombe and R. Wilson"
+, title =       "On the Complexity of Assembly Partitioning"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "12--17"
+, succeeds =    "kl-cppa-93t"
+, cites =       "acm-mpoap-89, gj-cigtn-79, m-camap-91, kl-cppa-93t, n-pa-88, pss-stsps-88, ss-pmp1c-83, ss-otcbt-93, t-mss-85, w-fap-92, hr-s-83, wll-cpa-92, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{kk-ppatc-95
-, author =	"L. E. Kavraki and M. N. Kolountzakis"
-, title =	"Partitioning a planar assembly into two connected components is {NP}-complete"
-, journal =	"Inform. Process. Lett."
-, volume =	55
-, number =	3
-, year =	1995
-, pages =	"159--165"
-, keywords =	"polygons, assembly, robotics, planning, NP-hardness"
-, update =	"95.09 mitchell"
+, author =      "L. E. Kavraki and M. N. Kolountzakis"
+, title =       "Partitioning a planar assembly into two connected components is {NP}-complete"
+, journal =     "Inform. Process. Lett."
+, volume =      55
+, number =      3
+, year =        1995
+, pages =       "159--165"
+, keywords =    "polygons, assembly, robotics, planning, NP-hardness"
+, update =      "95.09 mitchell"
 }
 
 @inproceedings{klmr-rqprp-95
-, author =	"L. E. Kavraki and J.-C. Latombe and R. Motwani and P. Raghavan"
-, title =	"Randomized query processing in robot path planning"
-, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
-, year =	1995
-, pages =	"353--362"
-, update =	"95.09 smid"
+, author =      "L. E. Kavraki and J.-C. Latombe and R. Motwani and P. Raghavan"
+, title =       "Randomized query processing in robot path planning"
+, booktitle =   "Proc. 27th Annu. ACM Sympos. Theory Comput."
+, year =        1995
+, pages =       "353--362"
+, update =      "95.09 smid"
 }
 
 @article{kslo-prpph-96
-, author =	"L. E. Kavraki and P. {\v S}vestka and J.-C. Latombe and M. H. Overmars"
-, title =	"Probabilistic Roadmaps for Path Planning in High Dimensional Configuration Spaces"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	12
-, year =	1996
-, pages =	"566--580"
-, update =	"98.07 agarwal, 97.03 schwarzkopf"
+, author =      "L. E. Kavraki and P. {\v S}vestka and J.-C. Latombe and M. H. Overmars"
+, title =       "Probabilistic Roadmaps for Path Planning in High Dimensional Configuration Spaces"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      12
+, year =        1996
+, pages =       "566--580"
+, update =      "98.07 agarwal, 97.03 schwarzkopf"
 }
 
 @book{k-fo-95
-, author =	"F. Kawahata"
-, title =	"Fantasy Origami"
-, publisher =	"Gallery Origami House"
-, address =	"Tokyo, Japan"
-, year =	1995
-, update =	"97.11 bibrelex"
+, author =      "F. Kawahata"
+, title =       "Fantasy Origami"
+, publisher =   "Gallery Origami House"
+, address =     "Tokyo, Japan"
+, year =        1995
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{k-tffaf-94
-, author =	"F. Kawahata"
-, title =	"The technique to fold free angles of formative art 'origami'"
-, booktitle =	"Proc. 2nd Internat. Meeting on Origami Science and Scientific Origami"
-, site =	"Otsu, Japan"
-, year =	1994
-, update =	"97.11 bibrelex"
+, author =      "F. Kawahata"
+, title =       "The technique to fold free angles of formative art 'origami'"
+, booktitle =   "Proc. 2nd Internat. Meeting on Origami Science and Scientific Origami"
+, site =        "Otsu, Japan"
+, year =        1994
+, update =      "97.11 bibrelex"
 }
 
 @incollection{k-rbmcv-89
-, author =	"T. Kawasaki"
-, title =	"On the relation between mountain-creases and valley-creases of a flat origami"
-, editor =	"H. Huzita"
-, booktitle =	"Origami Science and Technology"
-, year =	1989
-, pages =	"229--237"
-, update =	"97.11 bibrelex"
+, author =      "T. Kawasaki"
+, title =       "On the relation between mountain-creases and valley-creases of a flat origami"
+, editor =      "H. Huzita"
+, booktitle =   "Origami Science and Technology"
+, year =        1989
+, pages =       "229--237"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{k-ealdp-89
-, author =	"Y. Ke"
-, title =	"An efficient algorithm for link-distance problems"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"69--78"
-, keywords =	"motion planning, visibility, polygonal chains"
-, cites =	"cg-vippg-85, dls-oaclc-88, egs-oplms-86, gh-ospqs-87, ghlst-ltavs-86, k-ealdp-88, k-pvawv-89, k-twvsp-87, kr-wvpsp-87, lpsssstwy-clcsp-87, gjpt-tsp-78, s-ltaml-86, s-mlppr-87, tv-otats-88, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "Y. Ke"
+, title =       "An efficient algorithm for link-distance problems"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "69--78"
+, keywords =    "motion planning, visibility, polygonal chains"
+, cites =       "cg-vippg-85, dls-oaclc-88, egs-oplms-86, gh-ospqs-87, ghlst-ltavs-86, k-ealdp-88, k-pvawv-89, k-twvsp-87, kr-wvpsp-87, lpsssstwy-clcsp-87, gjpt-tsp-78, s-ltaml-86, s-mlppr-87, tv-otats-88, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{k-ealdp-88
-, author =	"Y. Ke"
-, title =	"An Efficient Algorithm for Link Distance Problems inside a Simple Polygon"
-, type =	"Technical {Report}"
-, number =	"JHU-87/28"
-, institution =	"Dept. of Computer Science, Johns Hopkins Univ."
-, year =	1988
-, update =	"93.09 milone+mitchell"
+, author =      "Y. Ke"
+, title =       "An Efficient Algorithm for Link Distance Problems inside a Simple Polygon"
+, type =        "Technical {Report}"
+, number =      "JHU-87/28"
+, institution = "Dept. of Computer Science, Johns Hopkins Univ."
+, year =        1988
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{k-dwvsp-88
-, author =	"Y. Ke"
-, title =	"Detecting the weak visibility of a simple polygon and related problems"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "Y. Ke"
+, title =       "Detecting the weak visibility of a simple polygon and related problems"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{k-pvawv-89
-, author =	"Y. Ke"
-, title =	"Polygon visibility algorithms for weak visibility and link distance problems"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1989
-, keywords =	"doctoral thesis"
-, update =	"96.01 aronov+orourke"
+, author =      "Y. Ke"
+, title =       "Polygon visibility algorithms for weak visibility and link distance problems"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1989
+, keywords =    "doctoral thesis"
+, update =      "96.01 aronov+orourke"
 }
 
 @techreport{k-twvsp-87
-, author =	"Y. Ke"
-, title =	"Testing the weak visibility of a simple polygon and related problems"
-, number =	27
-, institution =	"Department of Computer Science, The Johns Hopkins University"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "Y. Ke"
+, title =       "Testing the weak visibility of a simple polygon and related problems"
+, number =      27
+, institution = "Department of Computer Science, The Johns Hopkins University"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ko-amltd-87
-, author =	"Y. Ke and J. O'Rourke"
-, title =	"An algorithm for moving a ladder in three dimensions"
-, type =	"Technical {Report}"
-, number =	"JHU-87/17"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	sep
-, year =	1987
-, keywords =	"motion planning, three-dimensional, lower bounds, cell complexes"
-, precedes =	"ko-mltdu-87"
+, author =      "Y. Ke and J. O'Rourke"
+, title =       "An algorithm for moving a ladder in three dimensions"
+, type =        "Technical {Report}"
+, number =      "JHU-87/17"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       sep
+, year =        1987
+, keywords =    "motion planning, three-dimensional, lower bounds, cell complexes"
+, precedes =    "ko-mltdu-87"
 }
 
 @techreport{ko-oamlt-87
-, author =	"Y. Ke and J. O'Rourke"
-, title =	"An ${O} (n^{6} \log n)$ algorithm for moving a ladder in three dimensions"
-, type =	"Technical {Report}"
-, institution =	"Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	may
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "Y. Ke and J. O'Rourke"
+, title =       "An ${O} (n^{6} \log n)$ algorithm for moving a ladder in three dimensions"
+, type =        "Technical {Report}"
+, institution = "Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       may
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{ko-ckpsp-
-, author =	"Y. Ke and J. O'Rourke"
-, title =	"Computing the kernel of a point set in a polygon"
-, journal =	"Visual Comput."
-, volume =	""
-, year =	""
-, pages =	""
-, keywords =	"visibility, points, polygons, kernel"
-, comments =	"submitted"
-, succeeds =	"ko-ckpsp-89"
-, update =	"94.05 devillers"
+, author =      "Y. Ke and J. O'Rourke"
+, title =       "Computing the kernel of a point set in a polygon"
+, journal =     "Visual Comput."
+, volume =      ""
+, year =        ""
+, pages =       ""
+, keywords =    "visibility, points, polygons, kernel"
+, comments =    "submitted"
+, succeeds =    "ko-ckpsp-89"
+, update =      "94.05 devillers"
 }
 
 @inproceedings{ko-ckpsp-89
-, author =	"Y. Ke and J. O'Rourke"
-, title =	"Computing the kernel of a point set in a polygon"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"135--146"
-, keywords =	"visibility, points, polygons, kernel"
-, precedes =	"ko-ckpsp-"
-, update =	"97.11 bibrelex"
+, author =      "Y. Ke and J. O'Rourke"
+, title =       "Computing the kernel of a point set in a polygon"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "135--146"
+, keywords =    "visibility, points, polygons, kernel"
+, precedes =    "ko-ckpsp-"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ko-lbmlt-87t
-, author =	"Y. Ke and J. O'Rourke"
-, title =	"Lower bounds on moving a ladder in two and three dimensions"
-, type =	"Technical {Report}"
-, institution =	"Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	may
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "Y. Ke and J. O'Rourke"
+, title =       "Lower bounds on moving a ladder in two and three dimensions"
+, type =        "Technical {Report}"
+, institution = "Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       may
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{ko-lbmlt-87a
-, author =	"Y. Ke and J. O'Rourke"
-, title =	"Lower bounds on moving a ladder in two and three dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1987
-, pages =	"197--218"
-, update =	"98.03 bibrelex"
+, author =      "Y. Ke and J. O'Rourke"
+, title =       "Lower bounds on moving a ladder in two and three dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1987
+, pages =       "197--218"
+, update =      "98.03 bibrelex"
 }
 
 @article{ko-lbmlt-88
-, author =	"Y. Ke and J. O'Rourke"
-, title =	"Lower bounds on moving a ladder in two and three dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"197--217"
-, keywords =	"motion planning, two-dimensional, three-dimensional, lower bounds, cell complexes"
-, succeeds =	"ko-mltdu-87"
+, author =      "Y. Ke and J. O'Rourke"
+, title =       "Lower bounds on moving a ladder in two and three dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "197--217"
+, keywords =    "motion planning, two-dimensional, three-dimensional, lower bounds, cell complexes"
+, succeeds =    "ko-mltdu-87"
 }
 
 @inproceedings{ko-mltdu-87
-, author =	"Y. Ke and J. O'Rourke"
-, title =	"Moving a ladder in three dimensions: upper and lower bounds"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"136--145"
-, keywords =	"motion planning, three-dimensional, lower bounds, cell complexes"
-, succeeds =	"ko-amltd-87"
-, precedes =	"ko-lbmlt-88"
-, cites =	"c-emscc-87, eos-calha-86, ko-lbmlt-87t, ko-oamlt-87, ls-esmpa-85, o-lbml-85, osy-gvdl1-84, osy-gvdl2-84, osy-rnamp-83, ss-pmp1c-83, ss-pmp5c-84, ss-nempa-86, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "Y. Ke and J. O'Rourke"
+, title =       "Moving a ladder in three dimensions: upper and lower bounds"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "136--145"
+, keywords =    "motion planning, three-dimensional, lower bounds, cell complexes"
+, succeeds =    "ko-amltd-87"
+, precedes =    "ko-lbmlt-88"
+, cites =       "c-emscc-87, eos-calha-86, ko-lbmlt-87t, ko-oamlt-87, ls-esmpa-85, o-lbml-85, osy-gvdl1-84, osy-gvdl2-84, osy-rnamp-83, ss-pmp1c-83, ss-pmp5c-84, ss-nempa-86, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{kr-wvpsp-87
-, author =	"Y. Ke and J. O'Rourke"
-, title =	"Weak visibility problems for a set of points in a simple polygon"
-, institution =	"Department of Computer Science, The Johns Hopkins University"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "Y. Ke and J. O'Rourke"
+, title =       "Weak visibility problems for a set of points in a simple polygon"
+, institution = "Department of Computer Science, The Johns Hopkins University"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @techreport{k-nr-
-, author =	"P. Kearney"
-, title =	"On {NeST} representations"
-, type =	"manuscript"
-, update =	"98.11 bibrelex"
+, author =      "P. Kearney"
+, title =       "On {NeST} representations"
+, type =        "manuscript"
+, update =      "98.11 bibrelex"
 }
 
 @proceedings{k-ewcg-00
-, title =	"Abstracts 16th European Workshop Comput. Geom."
-, editor =	"Klara Kedem"
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 16th European Workshop Comput. Geom."
+, editor =      "Klara Kedem"
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, update =      "00.03 bibrelex"
 }
 
 @article{kc-ebrut-97
-, author =	"K. Kedem and D. Cohen"
-, title =	"Efficient bitmap resemblance under translations"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"57--84"
-, update =	"97.07 devillers"
+, author =      "K. Kedem and D. Cohen"
+, title =       "Efficient bitmap resemblance under translations"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "57--84"
+, update =      "97.07 devillers"
 }
 
 @article{klps-ujrcf-86
-, author =	"K. Kedem and R. Livne and J. Pach and Micha Sharir"
-, title =	"On the union of {Jordan} regions and collision-free translational motion amidst polygonal obstacles"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"59--71"
-, keywords =	"motion planning, two-dimensional, Jordan curves"
-, succeeds =	"ks-eapcf-85"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "K. Kedem and R. Livne and J. Pach and Micha Sharir"
+, title =       "On the union of {Jordan} regions and collision-free translational motion amidst polygonal obstacles"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "59--71"
+, keywords =    "motion planning, two-dimensional, Jordan curves"
+, succeeds =    "ks-eapcf-85"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @inproceedings{ks-ampsc-88
-, author =	"K. Kedem and Micha Sharir"
-, title =	"An automatic motion planning system for a convex polygonal mobile robot in $2$-d polygonal space"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"329--340"
-, precedes =	"ks-ampsc-90"
-, cites =	"ass-sulbl-87, a-sdcgp-85, bz-stdfp-86, bl-sacsf-83, hs-ndssg-86, hss-pgcrm-87, ksss-tdmbb-86, klps-ujrcf-86, ks-eapcf-85, ls-esmpa-87, ls-pptmc-87, ls-ncfcc-87, l-smpag-86, l-dpppa-87, l-acirm-87, ls-ppspm-87, oy-rmpmd-85, osy-gvdl-86, osy-gvdl-87, o-lbml-85, ss-pmp1c-83, ss-mprga-86, ss-nempa-87, y-amp-87, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "K. Kedem and Micha Sharir"
+, title =       "An automatic motion planning system for a convex polygonal mobile robot in $2$-d polygonal space"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "329--340"
+, precedes =    "ks-ampsc-90"
+, cites =       "ass-sulbl-87, a-sdcgp-85, bz-stdfp-86, bl-sacsf-83, hs-ndssg-86, hss-pgcrm-87, ksss-tdmbb-86, klps-ujrcf-86, ks-eapcf-85, ls-esmpa-87, ls-pptmc-87, ls-ncfcc-87, l-smpag-86, l-dpppa-87, l-acirm-87, ls-ppspm-87, oy-rmpmd-85, osy-gvdl-86, osy-gvdl-87, o-lbml-85, ss-pmp1c-83, ss-mprga-86, ss-nempa-87, y-amp-87, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @incollection{ks-ampsc-90
-, author =	"K. Kedem and Micha Sharir"
-, title =	"An automatic motion planning system for a convex polygonal mobile robot in $2$-d polygonal space"
-, editor =	"I. J. Cox and G. T. Wilfong"
-, booktitle =	"Autonomous Robot Vehicles"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1990
-, pages =	"349--362"
-, keywords =	"motion planning, robotics, implementing algorithms"
-, succeeds =	"ks-ampsc-88"
-, update =	"98.03 mitchell"
+, author =      "K. Kedem and Micha Sharir"
+, title =       "An automatic motion planning system for a convex polygonal mobile robot in $2$-d polygonal space"
+, editor =      "I. J. Cox and G. T. Wilfong"
+, booktitle =   "Autonomous Robot Vehicles"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1990
+, pages =       "349--362"
+, keywords =    "motion planning, robotics, implementing algorithms"
+, succeeds =    "ks-ampsc-88"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ks-eapcf-85
-, author =	"K. Kedem and Micha Sharir"
-, title =	"An efficient algorithm for planning collision-free translational motion of a convex polygonal object in $2$-dimensional space amidst polygonal obstacles"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"75--80"
-, keywords =	"motion planning, convex objects, two-dimensional"
-, precedes =	"ks-empac-90"
-, cites =	"b-egc-66, bo-arcgi-79, gk-shfmp-70, grs-kfcg-83, k-osps-83, ls-esmpa-84, lw-apcfp-79, np-psaig-82, oy-rmpmd-85, osy-gvdl1-84, osy-gvdl2-84, oww-fabmo-82, ss-pmp1c-83, ss-spps-86, w-cvgnl-84, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "K. Kedem and Micha Sharir"
+, title =       "An efficient algorithm for planning collision-free translational motion of a convex polygonal object in $2$-dimensional space amidst polygonal obstacles"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "75--80"
+, keywords =    "motion planning, convex objects, two-dimensional"
+, precedes =    "ks-empac-90"
+, cites =       "b-egc-66, bo-arcgi-79, gk-shfmp-70, grs-kfcg-83, k-osps-83, ls-esmpa-84, lw-apcfp-79, np-psaig-82, oy-rmpmd-85, osy-gvdl1-84, osy-gvdl2-84, oww-fabmo-82, ss-pmp1c-83, ss-spps-86, w-cvgnl-84, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{ks-empac-90
-, author =	"K. Kedem and Micha Sharir"
-, title =	"An efficient motion planning algorithm for a convex rigid polygonal object in $2$-dimensional polygonal space"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"43--75"
-, keywords =	"motion planning, convex objects, Davenport-Schinzel sequences, two-dimensional"
-, succeeds =	"ks-eapcf-85"
-, update =	"98.03 mitchell"
+, author =      "K. Kedem and Micha Sharir"
+, title =       "An efficient motion planning algorithm for a convex rigid polygonal object in $2$-dimensional polygonal space"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "43--75"
+, keywords =    "motion planning, convex objects, Davenport-Schinzel sequences, two-dimensional"
+, succeeds =    "ks-eapcf-85"
+, update =      "98.03 mitchell"
 }
 
 @techreport{kst-coksm-93t
-, author =	"K. Kedem and Micha Sharir and S. Toledo"
-, title =	"On critical orientations in the {Kedem}-{Sharir} motion planning algorithm for a convex polygon in the plane"
-, number =	"273/93"
-, institution =	"Department of Computer Science, Tel-Aviv University"
-, year =	1993
-, precedes =	"kst-coksm-93i"
-, update =	"98.03 mitchell, 97.07 devillers, 93.09 milone+mitchell, 93.05 orourke"
-, annote =	"Fixes bug in Kedem-Sharir algorithm"
+, author =      "K. Kedem and Micha Sharir and S. Toledo"
+, title =       "On critical orientations in the {Kedem}-{Sharir} motion planning algorithm for a convex polygon in the plane"
+, number =      "273/93"
+, institution = "Department of Computer Science, Tel-Aviv University"
+, year =        1993
+, precedes =    "kst-coksm-93i"
+, update =      "98.03 mitchell, 97.07 devillers, 93.09 milone+mitchell, 93.05 orourke"
+, annote =      "Fixes bug in Kedem-Sharir algorithm"
 }
 
 @inproceedings{kst-coksm-93i
-, author =	"K. Kedem and Micha Sharir and S. Toledo"
-, title =	"On critical orientations in the {Kedem}-{Sharir} motion planning algorithm for a convex polygon in the plane"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"204--209"
-, succeeds =	"kst-coksm-93t"
-, precedes =	"kst-coksm-97"
-, update =	"98.03 mitchell, 97.07 devillers, 93.09 milone+mitchell"
+, author =      "K. Kedem and Micha Sharir and S. Toledo"
+, title =       "On critical orientations in the {Kedem}-{Sharir} motion planning algorithm for a convex polygon in the plane"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "204--209"
+, succeeds =    "kst-coksm-93t"
+, precedes =    "kst-coksm-97"
+, update =      "98.03 mitchell, 97.07 devillers, 93.09 milone+mitchell"
 }
 
 @article{kst-coksm-97
-, author =	"K. Kedem and Micha Sharir and S. Toledo"
-, title =	"On critical orientations in the {Kedem}-{Sharir} motion planning algorithm for a convex polygon in the plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	17
-, year =	1997
-, pages =	"227--240"
-, succeeds =	"kst-coksm-93i"
-, update =	"98.03 mitchell, 97.07 devillers"
+, author =      "K. Kedem and Micha Sharir and S. Toledo"
+, title =       "On critical orientations in the {Kedem}-{Sharir} motion planning algorithm for a convex polygon in the plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      17
+, year =        1997
+, pages =       "227--240"
+, succeeds =    "kst-coksm-93i"
+, update =      "98.03 mitchell, 97.07 devillers"
 }
 
 @inproceedings{ky-cbsmu-96
-, author =	"Klara Kedem and Yana Yarmovski"
-, title =	"Curve Based Stereo Matching Using the Minimum {Hausdorff} Distance"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"C15--C18"
-, cites =	"af-ersmg-87, a-avmrs-91, ct-lsm3d-93, hkr-ciuhd-93, hks-uevsi-93, sp-simc-90, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Klara Kedem and Yana Yarmovski"
+, title =       "Curve Based Stereo Matching Using the Minimum {Hausdorff} Distance"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "C15--C18"
+, cites =       "af-ersmg-87, a-avmrs-91, ct-lsm3d-93, hkr-ciuhd-93, hks-uevsi-93, sp-simc-90, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{ksd-ttute-92
-, author =	"S. S. Keerthi and N. K. Sancheti and A. Dattasharma"
-, title =	"Transversality Theorem: A Useful Tool for Establishing Genericity"
-, booktitle =	"Proc. IEEE Conf. on Decision and Control"
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "S. S. Keerthi and N. K. Sancheti and A. Dattasharma"
+, title =       "Transversality Theorem: A Useful Tool for Establishing Genericity"
+, booktitle =   "Proc. IEEE Conf. on Decision and Control"
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ks-micco-91
-, author =	"S. Sathiya Keerthi and K. Sridharan"
-, title =	"Measures of intensity of collision between convex objects and their efficient computation"
-, booktitle =	"Proceedings of the International Symposium on Intelligent Robotics, Bangalore, India"
-, month =	jan
-, year =	1991
-, pages =	"266--275"
-, update =	"98.07 bibrelex"
+, author =      "S. Sathiya Keerthi and K. Sridharan"
+, title =       "Measures of intensity of collision between convex objects and their efficient computation"
+, booktitle =   "Proceedings of the International Symposium on Intelligent Robotics, Bangalore, India"
+, month =       jan
+, year =        1991
+, pages =       "266--275"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ks-cdctd-91
-, author =	"S. S. Keerthi and K. Sridharan"
-, title =	"On computing depth of collision in two dimensions"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"19--25"
-, cites =	"gpwz-eaes-91, bhh-fgavt-81, dk-ladsc-85, gjk-fpcdb-88, cc-dmtdb-86, bl-pmcpp-85, ds-splif-90, grs-kfcg-83, l-spcsa-83, cd-icott-87, r-ca-70, k-smsm-55, cg-vippg-85, ks-micco-91, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. S. Keerthi and K. Sridharan"
+, title =       "On computing depth of collision in two dimensions"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "19--25"
+, cites =       "gpwz-eaes-91, bhh-fgavt-81, dk-ladsc-85, gjk-fpcdb-88, cc-dmtdb-86, bl-pmcpp-85, ds-splif-90, grs-kfcg-83, l-spcsa-83, cd-icott-87, r-ca-70, k-smsm-55, cg-vippg-85, ks-micco-91, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{ds-splif-90
-, author =	"S. S. Keerthi and K. Sridharan"
-, title =	"Solution of parametrized linear inequalities by Fourier Elimination and its applications"
-, journal =	"J. Optim. Theory Appl."
-, volume =	65
-, month =	apr
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "S. S. Keerthi and K. Sridharan"
+, title =       "Solution of parametrized linear inequalities by Fourier Elimination and its applications"
+, journal =     "J. Optim. Theory Appl."
+, volume =      65
+, month =       apr
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @article{kf-fsr3d-88
-, author =	"N. Kehtarnavaz and R. J. P. de Figueiredo"
-, title =	"A framework for surface reconstruction from $3$-d contours"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	42
-, year =	1988
-, pages =	"32--47"
-, update =	"98.03 bibrelex"
+, author =      "N. Kehtarnavaz and R. J. P. de Figueiredo"
+, title =       "A framework for surface reconstruction from $3$-d contours"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      42
+, year =        1988
+, pages =       "32--47"
+, update =      "98.03 bibrelex"
 }
 
 @article{ksf-sstsr-88
-, author =	"N. Kehtarnavaz and L. R. Simar and R. J. P. de Figueiredo"
-, title =	"Syntactic/Semantic Technique For Surface Reconstruction From Cross- Sectional Contours"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	42
-, number =	3
-, month =	jun
-, year =	1988
-, pages =	"399--409"
-, keywords =	"syntactic/semantic technique, surface reconstruction, cross-sectional contours, weighted levenshtein graph"
-, annote =	"Breaks contours into ``syntactic'' components, matches
-		 and triangulates between each piece."
-, abstract =	"Surface reconstruction from cross-sectional contours
-		 has become increasingly important in medicine. In this
-		 paper, a surface reconstruction technique has been
-		 developed to improve the conventional triangulation
-		 techniques by taking into account local shape
-		 characteristics of the surface being reconstructed. The
-		 technique involves a syntactic/semantic contour
-		 representation which allows a similarity relation,
-		 based on the weighted Levenshtein graph, to be
-		 established between adjacent contours. This similarity
-		 relation is then employed as a guide to form the
-		 surface by triangulating similar substructures. (Author
-		 abstract) 11 refs."
+, author =      "N. Kehtarnavaz and L. R. Simar and R. J. P. de Figueiredo"
+, title =       "Syntactic/Semantic Technique For Surface Reconstruction From Cross- Sectional Contours"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      42
+, number =      3
+, month =       jun
+, year =        1988
+, pages =       "399--409"
+, keywords =    "syntactic/semantic technique, surface reconstruction, cross-sectional contours, weighted levenshtein graph"
+, annote =      "Breaks contours into ``syntactic'' components, matches
+                 and triangulates between each piece."
+, abstract =    "Surface reconstruction from cross-sectional contours
+                 has become increasingly important in medicine. In this
+                 paper, a surface reconstruction technique has been
+                 developed to improve the conventional triangulation
+                 techniques by taking into account local shape
+                 characteristics of the surface being reconstructed. The
+                 technique involves a syntactic/semantic contour
+                 representation which allows a similarity relation,
+                 based on the weighted Levenshtein graph, to be
+                 established between adjacent contours. This similarity
+                 relation is then employed as a guide to form the
+                 surface by triangulating similar substructures. (Author
+                 abstract) 11 refs."
 }
 
 @inproceedings{k-aceg-88
-, author =	"J. M. Keil"
-, title =	"Approximating the complete {Euclidean} graph"
-, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	318
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"208--213"
-, keywords =	"geometric graphs, path planning"
+, author =      "J. M. Keil"
+, title =       "Approximating the complete {Euclidean} graph"
+, booktitle =   "Proc. 1st Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      318
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "208--213"
+, keywords =    "geometric graphs, path planning"
 }
 
 @mastersthesis{k-cgig-80
-, author =	"J. M. Keil"
-, title =	"Computational geometry on the integer grid"
-, type =	"M.{Sc}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. British Columbia"
-, address =	"Vancouver, BC"
-, year =	1980
-, keywords =	"master thesis, priority search trees, bucketing, design of algorithms, data structuring, sorting, convex hull, intersection"
-, precedes =	"kk-cgig-81"
+, author =      "J. M. Keil"
+, title =       "Computational geometry on the integer grid"
+, type =        "M.{Sc}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. British Columbia"
+, address =     "Vancouver, BC"
+, year =        1980
+, keywords =    "master thesis, priority search trees, bucketing, design of algorithms, data structuring, sorting, convex hull, intersection"
+, precedes =    "kk-cgig-81"
 }
 
 @article{k-copnp-97
-, author =	"J. M. Keil"
-, title =	"Covering Orthogonal Polygons with Non-Piercing Rectangles"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"473--484"
-, update =	"98.11 devillers"
+, author =      "J. M. Keil"
+, title =       "Covering Orthogonal Polygons with Non-Piercing Rectangles"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "473--484"
+, update =      "98.11 devillers"
 }
 
 @article{k-dpsc-85
-, author =	"J. M. Keil"
-, title =	"Decomposing a polygon into simpler components"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"799--817"
-, keywords =	"dynamic programming, convex, polygons, star-shaped, partition, decomposition"
+, author =      "J. M. Keil"
+, title =       "Decomposing a polygon into simpler components"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "799--817"
+, keywords =    "dynamic programming, convex, polygons, star-shaped, partition, decomposition"
 }
 
 @phdthesis{k-dpsc-83
-, author =	"J. M. Keil"
-, title =	"Decomposing Polygons into Simpler Components"
-, school =	"Dept. Comput. Sci., Univ. Toronto"
-, address =	"Toronto, ON"
-, year =	1983
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "J. M. Keil"
+, title =       "Decomposing Polygons into Simpler Components"
+, school =      "Dept. Comput. Sci., Univ. Toronto"
+, address =     "Toronto, ON"
+, year =        1983
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{k-mchco-86
-, author =	"J. M. Keil"
-, title =	"Minimally covering a horizontally convex orthogonal polygon"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"43--51"
-, keywords =	"covering, polygons, convex, star-shaped"
-, cites =	"a-agpiv-84, acyb-idcat-80, cd-dpicp-79, c-cgc-79, eow-sgrag-84, fk-acrri-84, g-dpcp-83, g-dpcp-83, kkk-tgrfw-83, k-dpsc-83, k-dpsc-85, ks-mdpo-85, l-pnrh-82, lllmp-tddo2-79, mw-sprag-84, m-snpcs-79, mf-diasp-82, ostt-mprr-83, o-aprag-83, os-snhpd-83, s-oadrp-82, s-rcg-84, sl-tssp-80, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "J. M. Keil"
+, title =       "Minimally covering a horizontally convex orthogonal polygon"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "43--51"
+, keywords =    "covering, polygons, convex, star-shaped"
+, cites =       "a-agpiv-84, acyb-idcat-80, cd-dpicp-79, c-cgc-79, eow-sgrag-84, fk-acrri-84, g-dpcp-83, g-dpcp-83, kkk-tgrfw-83, k-dpsc-83, k-dpsc-85, ks-mdpo-85, l-pnrh-82, lllmp-tddo2-79, mw-sprag-84, m-snpcs-79, mf-diasp-82, ostt-mprr-83, o-aprag-83, os-snhpd-83, s-oadrp-82, s-rcg-84, sl-tssp-80, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{k-pd-00
-, author =	"J. Mark Keil"
-, title =	"Polygon Decomposition"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"491--518"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 11 of su-hcg-00"
+, author =      "J. Mark Keil"
+, title =       "Polygon Decomposition"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "491--518"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 11 of su-hcg-00"
 }
 
 @proceedings{k-p6ccc-94
-, title =	"Proc. 6th Canad. Conf. Comput. Geom."
-, editor =	"J. Mark Keil"
-, publisher =	"Dept. Comput. Sci., Univ. Saskatchewan"
-, address =	"Saskatoon, SK"
-, month =	aug
-, year =	1994
-, comments =	"C\$40 cheque or money order payable to Univ. Saskatchewan, includes postage"
-, update =	"95.01 smid, 94.09 jones"
+, title =       "Proc. 6th Canad. Conf. Comput. Geom."
+, editor =      "J. Mark Keil"
+, publisher =   "Dept. Comput. Sci., Univ. Saskatchewan"
+, address =     "Saskatoon, SK"
+, month =       aug
+, year =        1994
+, comments =    "C\$40 cheque or money order payable to Univ. Saskatchewan, includes postage"
+, update =      "95.01 smid, 94.09 jones"
 }
 
 @article{kg-cgwac-92
-, author =	"J. M. Keil and C. A. Gutwin"
-, title =	"Classes of graphs which approximate the complete {Euclidean} graph"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"13--28"
+, author =      "J. M. Keil and C. A. Gutwin"
+, title =       "Classes of graphs which approximate the complete {Euclidean} graph"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "13--28"
 }
 
 @inproceedings{kg-dtcac-89
-, author =	"J. M. Keil and C. A. Gutwin"
-, title =	"The {Delaunay} triangulation closely approximates the complete {Euclidean} graph"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"47--56"
-, keywords =	"geometric graphs, Delaunay triangulations"
+, author =      "J. M. Keil and C. A. Gutwin"
+, title =       "The {Delaunay} triangulation closely approximates the complete {Euclidean} graph"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "47--56"
+, keywords =    "geometric graphs, Delaunay triangulations"
 }
 
 @inproceedings{kk-cgig-81
-, author =	"J. M. Keil and D. G. Kirkpatrick"
-, title =	"Computational geometry on the integer grid"
-, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
-, year =	1981
-, pages =	"41--50"
-, keywords =	"priority search trees, bucketing, design of algorithms, data structuring, sorting, convex hull, intersection"
-, succeeds =	"k-cgig-80"
+, author =      "J. M. Keil and D. G. Kirkpatrick"
+, title =       "Computational geometry on the integer grid"
+, booktitle =   "Proc. 19th Allerton Conf. Commun. Control Comput."
+, year =        1981
+, pages =       "41--50"
+, keywords =    "priority search trees, bucketing, design of algorithms, data structuring, sorting, convex hull, intersection"
+, succeeds =    "k-cgig-80"
 }
 
 @incollection{ks-mdpo-85
-, author =	"J. M. Keil and J.-R. Sack"
-, title =	"Minimum decompositions of polygonal objects"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"197--216"
-, keywords =	"survey paper, convex, polygons, star-shaped, partition, decomposition, covering"
+, author =      "J. M. Keil and J.-R. Sack"
+, title =       "Minimum decompositions of polygonal objects"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "197--216"
+, keywords =    "survey paper, convex, polygons, star-shaped, partition, decomposition, covering"
 }
 
 @unpublished{kt-dcicc-91u
-, author =	"J. Mark Keil and Godfried T. Toussaint"
-, title =	"Detecting and computing intersections of convex chains"
-, year =	1991
-, note =	"manuscript in preparation"
-, succeeds =	"kt-dcicc-91i"
-, update =	"98.07 bibrelex"
+, author =      "J. Mark Keil and Godfried T. Toussaint"
+, title =       "Detecting and computing intersections of convex chains"
+, year =        1991
+, note =        "manuscript in preparation"
+, succeeds =    "kt-dcicc-91i"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{k-sades-91t
-, author =	"M. Keil"
-, title =	"A simple algorithm for determining the envelope of a set of lines"
-, type =	"Technical {Report}"
-, number =	"91-1"
-, institution =	"University of Saskatchewan"
-, year =	1991
-, update =	"98.07 mitchell, 97.11 bibrelex"
+, author =      "M. Keil"
+, title =       "A simple algorithm for determining the envelope of a set of lines"
+, type =        "Technical {Report}"
+, number =      "91-1"
+, institution = "University of Saskatchewan"
+, year =        1991
+, update =      "98.07 mitchell, 97.11 bibrelex"
 }
 
 @article{k-sades-91a
-, author =	"M. Keil"
-, title =	"A simple algorithm for determining the envelope of a set of lines"
-, journal =	"Inform. Process. Lett."
-, volume =	39
-, year =	1991
-, pages =	"121--124"
-, update =	"98.07 bibrelex, 95.01 smid"
+, author =      "M. Keil"
+, title =       "A simple algorithm for determining the envelope of a set of lines"
+, journal =     "Inform. Process. Lett."
+, volume =      39
+, year =        1991
+, pages =       "121--124"
+, update =      "98.07 bibrelex, 95.01 smid"
 }
 
 @article{k-csmwt-94
-, author =	"M. Keil"
-, title =	"Computing a subgraph of the minimum weight triangulation"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"13--26"
-, update =	"96.09 devillers"
+, author =      "M. Keil"
+, title =       "Computing a subgraph of the minimum weight triangulation"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "13--26"
+, update =      "96.09 devillers"
 }
 
 @article{kmw-vsdfs-00
-, author =	"M. Keil and D. M. Mount and S. K. Wismath"
-, title =	"Visibility stabs and depth-first spiralling on line segments in output sensitive time"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, year =	2000
-, pages =	"535--552"
-, update =	"01.04 smid"
+, author =      "M. Keil and D. M. Mount and S. K. Wismath"
+, title =       "Visibility stabs and depth-first spiralling on line segments in output sensitive time"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, year =        2000
+, pages =       "535--552"
+, update =      "01.04 smid"
 }
 
 @inproceedings{kt-dcicc-91i
-, author =	"M. Keil and G. Toussaint"
-, title =	"Detecting and computing intersections of convex chains"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"7--10"
-, update =	"98.07 bibrelex"
+, author =      "M. Keil and G. Toussaint"
+, title =       "Detecting and computing intersections of convex chains"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "7--10"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{kw-cvpes-92
-, author =	"M. Keil and S. Wismath"
-, title =	"Computing the visibility polygons of the endpoints of a set of line segments in output sensitive time"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"39--45"
-, cites =	"aaghi-vdp-86, c-tsplt-91a, h-fvgsp-87, gm-osacv-87, ow-nmcvg-88, v-dmvg-91, w-cvgnl-85, w-cfvgs-92, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M. Keil and S. Wismath"
+, title =       "Computing the visibility polygons of the endpoints of a set of line segments in output sensitive time"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "39--45"
+, cites =       "aaghi-vdp-86, c-tsplt-91a, h-fvgsp-87, gm-osacv-87, ow-nmcvg-88, v-dmvg-91, w-cvgnl-85, w-cfvgs-92, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{km-psptv-84
-, author =	"D. M. Keirsey and Joseph S. B. Mitchell"
-, title =	"Planning Strategic Paths Through Variable Terrain Data"
-, booktitle =	"Proc. SPIE Applications of Artificial Intelligence"
-, volume =	485
-, year =	1984
-, pages =	"172--179"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "D. M. Keirsey and Joseph S. B. Mitchell"
+, title =       "Planning Strategic Paths Through Variable Terrain Data"
+, booktitle =   "Proc. SPIE Applications of Artificial Intelligence"
+, volume =      485
+, year =        1984
+, pages =       "172--179"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @inproceedings{kmpp-mppav-84
-, author =	"D. M. Keirsey and Joseph S. B. Mitchell and D. W. Payton and E. P. Preyss"
-, title =	"Multilevel Path Planning for Autonomous Vehicles"
-, booktitle =	"Proc. SPIE Applications of Artificial Intelligence"
-, volume =	485
-, year =	1984
-, pages =	"133--137"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "D. M. Keirsey and Joseph S. B. Mitchell and D. W. Payton and E. P. Preyss"
+, title =       "Multilevel Path Planning for Autonomous Vehicles"
+, booktitle =   "Proc. SPIE Applications of Artificial Intelligence"
+, volume =      485
+, year =        1984
+, pages =       "133--137"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @article{k-mcp-93
-, author =	"T. Keleti"
-, title =	"The Mountain Climbers' Problem"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	117
-, number =	1
-, year =	1993
-, pages =	"89--97"
+, author =      "T. Keleti"
+, title =       "The Mountain Climbers' Problem"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      117
+, number =      1
+, year =        1993
+, pages =       "89--97"
 }
 
 @article{k-facp-85
-, author =	"W. Keller-Gehrig"
-, title =	"Fast algorithms for the characteristic polynomial"
-, journal =	"Theoret. Comput. Sci."
-, volume =	36
-, year =	1985
-, pages =	"309--317"
-, update =	"97.11 bibrelex"
+, author =      "W. Keller-Gehrig"
+, title =       "Fast algorithms for the characteristic polynomial"
+, journal =     "Theoret. Comput. Sci."
+, volume =      36
+, year =        1985
+, pages =       "309--317"
+, update =      "97.11 bibrelex"
 }
 
 @book{kn-lts-63
-, author =	"J. L. Kelley and I. Namioka"
-, title =	"Linear Topological Spaces"
-, publisher =	"Van Nostrand"
-, address =	"Princeton, NJ"
-, year =	1963
-, update =	"97.11 bibrelex"
+, author =      "J. L. Kelley and I. Namioka"
+, title =       "Linear Topological Spaces"
+, publisher =   "Van Nostrand"
+, address =     "Princeton, NJ"
+, year =        1963
+, update =      "97.11 bibrelex"
 }
 
 @book{kn-lts-76
-, author =	"J. L. Kelley and I. Namioka"
-, title =	"Linear Topological Spaces"
-, publisher =	"Springer-Verlag"
-, year =	1976
-, update =	"98.07 bibrelex"
+, author =      "J. L. Kelley and I. Namioka"
+, title =       "Linear Topological Spaces"
+, publisher =   "Springer-Verlag"
+, year =        1976
+, update =      "98.07 bibrelex"
 }
 
 @article{k-fpos-87
-, author =	"D. Kelly"
-, title =	"Fundamentals of Planar Ordered Sets"
-, journal =	"Discrete Math."
-, volume =	63
-, year =	1987
-, pages =	"197--216"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. Kelly"
+, title =       "Fundamentals of Planar Ordered Sets"
+, journal =     "Discrete Math."
+, volume =      63
+, year =        1987
+, pages =       "197--216"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{k-3ipos-77
-, author =	"D. Kelly"
-, title =	"The 3-irreducible partially ordred sets"
-, journal =	"Canad. J. Math."
-, volume =	24
-, number =	2
-, year =	1977
-, pages =	"367--383"
-, update =	"98.11 bibrelex"
+, author =      "D. Kelly"
+, title =       "The 3-irreducible partially ordred sets"
+, journal =     "Canad. J. Math."
+, volume =      24
+, number =      2
+, year =        1977
+, pages =       "367--383"
+, update =      "98.11 bibrelex"
 }
 
 @article{kr-pl-75
-, author =	"D. Kelly and I. Rival"
-, title =	"Planar Lattices"
-, journal =	"Canad. J. Math."
-, volume =	27
-, number =	3
-, year =	1975
-, pages =	"636--665"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. Kelly and I. Rival"
+, title =       "Planar Lattices"
+, journal =     "Canad. J. Math."
+, volume =      27
+, number =      3
+, year =        1975
+, pages =       "636--665"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{k-srrlp-81
-, author =	"D. G. Kelly"
-, title =	"Some results on random linear programs"
-, journal =	"Methods of Operations Research"
-, volume =	40
-, year =	1981
-, pages =	"351--355"
-, update =	"97.03 gaertner+salinger"
+, author =      "D. G. Kelly"
+, title =       "Some results on random linear programs"
+, journal =     "Methods of Operations Research"
+, volume =      40
+, year =        1981
+, pages =       "351--355"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{km-noldn-58
-, author =	"L. Kelly and W. Moser"
-, title =	"On the number of ordinary lines determined by $n$ points"
-, journal =	"Canad. J. Math."
-, volume =	10
-, year =	1958
-, pages =	"210--219"
-, update =	"98.03 devillers"
+, author =      "L. Kelly and W. Moser"
+, title =       "On the number of ordinary lines determined by $n$ points"
+, journal =     "Canad. J. Math."
+, volume =      10
+, year =        1958
+, pages =       "210--219"
+, update =      "98.03 devillers"
 }
 
 @article{k-rsgpj-86
-, author =	"L. M. Kelly"
-, title =	"A resolution of the {Sylvester}-{Gallai} problem of {J.-P. Serre}"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"101--104"
+, author =      "L. M. Kelly"
+, title =       "A resolution of the {Sylvester}-{Gallai} problem of {J.-P. Serre}"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "101--104"
 }
 
 @book{kw-gcsmm-79
-, author =	"P. Kelly and M. Weiss"
-, title =	"Geometry and Convexity: {A} Study in Mathematical Methods"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1979
-, update =	"99.11 bibrelex"
+, author =      "P. Kelly and M. Weiss"
+, title =       "Geometry and Convexity: {A} Study in Mathematical Methods"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1979
+, update =      "99.11 bibrelex"
 }
 
 @Article{k-dfcosubm-09,
@@ -87829,4904 +87829,4904 @@ @Article{k-dfcosubm-09
 }
 
 @book{k-hdsl-1877
-, author =	"Alfred Bray Kempe"
-, title =	"How to Draw a Straight Line; a Lecture on Linkages"
-, publisher =	"Macmillan \& co."
-, year =	1877
-, location =	"London"
-, update =	"02.03 orourke"
+, author =      "Alfred Bray Kempe"
+, title =       "How to Draw a Straight Line; a Lecture on Linkages"
+, publisher =   "Macmillan \& co."
+, year =        1877
+, location =    "London"
+, update =      "02.03 orourke"
 }
 
 @article{k-gmdpc-1876
-, author =	"Alfred Bray Kempe"
-, title =	"On a general method of describing plane curves of the nth degree by linkwork"
-, journal =	"Proc. London Math. Soc."
-, volume =	7
-, year =	1876
-, pages =	"213--216"
-, update =	"02.03 orourke"
+, author =      "Alfred Bray Kempe"
+, title =       "On a general method of describing plane curves of the nth degree by linkwork"
+, journal =     "Proc. London Math. Soc."
+, volume =      7
+, year =        1876
+, pages =       "213--216"
+, update =      "02.03 orourke"
 }
 
 @book{km-gp-63
-, author =	"N. G. Kendall and P. A. P. Moran"
-, title =	"Geometrical Probability"
-, publisher =	"Hafner"
-, address =	"New York, NY"
-, year =	1963
+, author =      "N. G. Kendall and P. A. P. Moran"
+, title =       "Geometrical Probability"
+, publisher =   "Hafner"
+, address =     "New York, NY"
+, year =        1963
 }
 
 @book{k-eag-77
-, author =	"K. Kendig"
-, title =	"Elementary Algebraic Geometry"
-, publisher =	"Springer-Verlag"
-, year =	1977
-, update =	"98.03 bibrelex"
+, author =      "K. Kendig"
+, title =       "Elementary Algebraic Geometry"
+, publisher =   "Springer-Verlag"
+, year =        1977
+, update =      "98.03 bibrelex"
 }
 
 @article{khh-eeuap-89
-, author =	"N. C. Kenkel and W. D. Hoskins and J. A. Hoskins"
-, title =	"Edge Effects in the Use of Area Polygons to Study Competition"
-, journal =	"Ecology"
-, volume =	70
-, number =	1
-, year =	1989
-, pages =	"272--274"
-, annote =	"Points out that if we take sample of points contained
-		 some region, and calculate the Voronoi polygons, then
-		 to avoid edge effects it is necessary to exclude the
-		 polygons which potentially could be made smaller by
-		 points outside the region. (These are not necessarily
-		 adjacent to the boundary.) Simulation shows that for
-		 500 points in a square 0.77 of the polygons can be
-		 kept."
+, author =      "N. C. Kenkel and W. D. Hoskins and J. A. Hoskins"
+, title =       "Edge Effects in the Use of Area Polygons to Study Competition"
+, journal =     "Ecology"
+, volume =      70
+, number =      1
+, year =        1989
+, pages =       "272--274"
+, annote =      "Points out that if we take sample of points contained
+                 some region, and calculate the Voronoi polygons, then
+                 to avoid edge effects it is necessary to exclude the
+                 polygons which potentially could be made smaller by
+                 points outside the region. (These are not necessarily
+                 adjacent to the boundary.) Simulation shows that for
+                 500 points in a square 0.77 of the polygons can be
+                 kept."
 }
 
 @inproceedings{kk-htsc-91
-, author =	"C. Kenyon and R. Kenyon"
-, title =	"How to take short cuts"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"250--255"
-, cites =	"j-rstsp-90, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "C. Kenyon and R. Kenyon"
+, title =       "How to take short cuts"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "250--255"
+, cites =       "j-rstsp-90, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{kk-htsc-92
-, author =	"C. Kenyon and R. Kenyon"
-, title =	"How To Take Short Cuts"
-, journal =	"Discrete Comput. Geom."
-, volume =	8
-, year =	1992
-, pages =	"251--264"
-, update =	"99.07 smid"
+, author =      "C. Kenyon and R. Kenyon"
+, title =       "How To Take Short Cuts"
+, journal =     "Discrete Comput. Geom."
+, volume =      8
+, year =        1992
+, pages =       "251--264"
+, update =      "99.07 smid"
 }
 
 @inproceedings{kk-tpr-92
-, author =	"C. Kenyon and R. Kenyon"
-, title =	"Tiling a polygon with rectangles"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"610--619"
+, author =      "C. Kenyon and R. Kenyon"
+, title =       "Tiling a polygon with rectangles"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "610--619"
 }
 
 @techreport{kt-rduf-??
-, author =	"C. Kenyon and W. P. Thurston"
-, title =	"Rotation distance using flows"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
-, update =	"97.11 bibrelex"
+, author =      "C. Kenyon and W. P. Thurston"
+, title =       "Rotation distance using flows"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{kv-mqshl-88
-, author =	"C. M. Kenyon and J. S. Vitter"
-, title =	"Maximum queue size and hashing with lazy deletion"
-, booktitle =	"Proceedings of the 20th Annual Symposium on the Interface of Computing Science and Statistics"
-, site =	"Reston, VA"
-, year =	1988
-, pages =	"743--748"
-, precedes =	"kv-mqshl-91"
-, update =	"94.09 vitter"
+, author =      "C. M. Kenyon and J. S. Vitter"
+, title =       "Maximum queue size and hashing with lazy deletion"
+, booktitle =   "Proceedings of the 20th Annual Symposium on the Interface of Computing Science and Statistics"
+, site =        "Reston, VA"
+, year =        1988
+, pages =       "743--748"
+, precedes =    "kv-mqshl-91"
+, update =      "94.09 vitter"
 }
 
 @article{kv-mqshl-91
-, author =	"C. M. Kenyon and J. S. Vitter"
-, title =	"Maximum queue size and hashing with lazy deletion"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"597--619"
-, succeeds =	"kv-mqshl-88"
-, update =	"94.09 vitter"
+, author =      "C. M. Kenyon and J. S. Vitter"
+, title =       "Maximum queue size and hashing with lazy deletion"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "597--619"
+, succeeds =    "kv-mqshl-88"
+, update =      "94.09 vitter"
 }
 
 @inproceedings{kv-gmams-89
-, author =	"C. M. Kenyon-Mathieu and J. S. Vitter"
-, title =	"General methods for the analysis of the maximum size of dynamic data structures"
-, booktitle =	"Proc. 16th Internat. Colloq. Automata Lang. Program."
-, nickname =	"ICALP '89"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	372
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"473--487"
-, precedes =	"kv-gmams-91"
-, update =	"94.09 vitter"
+, author =      "C. M. Kenyon-Mathieu and J. S. Vitter"
+, title =       "General methods for the analysis of the maximum size of dynamic data structures"
+, booktitle =   "Proc. 16th Internat. Colloq. Automata Lang. Program."
+, nickname =    "ICALP '89"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      372
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "473--487"
+, precedes =    "kv-gmams-91"
+, update =      "94.09 vitter"
 }
 
 @article{kv-gmams-91
-, author =	"C. M. Kenyon-Mathieu and J. S. Vitter"
-, title =	"General methods for the analysis of the maximum size of dynamic data structures"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"807--823"
-, succeeds =	"kv-gmams-89"
-, update =	"94.09 vitter"
+, author =      "C. M. Kenyon-Mathieu and J. S. Vitter"
+, title =       "General methods for the analysis of the maximum size of dynamic data structures"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "807--823"
+, succeeds =    "kv-gmams-89"
+, update =      "94.09 vitter"
 }
 
 @article{k-acstc-75
-, author =	"E. Keppel"
-, title =	"Approximating complex surfaces by triangulation of contour lines"
-, journal =	"IBM J. Res. Develop."
-, volume =	19
-, year =	1975
-, pages =	"2--11"
-, update =	"98.03 bibrelex"
+, author =      "E. Keppel"
+, title =       "Approximating complex surfaces by triangulation of contour lines"
+, journal =     "IBM J. Res. Develop."
+, volume =      19
+, year =        1975
+, pages =       "2--11"
+, update =      "98.03 bibrelex"
 }
 
 @article{kw-2dfpi-90
-, author =	"J. P. Kermode and D. Weaire"
-, title =	"2{D}-Froth --- {A} Program for the Investigation of 2-Dimensional Froths"
-, journal =	"Computer Physics Communications"
-, volume =	60
-, number =	1
-, year =	1990
-, pages =	"75--109"
-, update =	"94.09 lambert"
-, annote =	"Basic circumcircle algorithm for DT and get VD from
-		 that."
+, author =      "J. P. Kermode and D. Weaire"
+, title =       "2{D}-Froth --- {A} Program for the Investigation of 2-Dimensional Froths"
+, journal =     "Computer Physics Communications"
+, volume =      60
+, number =      1
+, year =        1990
+, pages =       "75--109"
+, update =      "94.09 lambert"
+, annote =      "Basic circumcircle algorithm for DT and get VD from
+                 that."
 }
 
 @article{kw-pacls-90
-, author =	"W. Kern and A. Wanka"
-, title =	"On a problem about covering lines by squares"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"77--82"
+, author =      "W. Kern and A. Wanka"
+, title =       "On a problem about covering lines by squares"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "77--82"
 }
 
 @article{kl-ehppg-70
-, author =	"B. W. Kernighan and S. Lin"
-, title =	"An efficient heuristic procedure for partitioning graphs"
-, journal =	"Bell Syst. Tech. J."
-, volume =	49
-, number =	2
-, year =	1970
-, pages =	"291--307"
-, update =	"98.03 bibrelex"
+, author =      "B. W. Kernighan and S. Lin"
+, title =       "An efficient heuristic procedure for partitioning graphs"
+, journal =     "Bell Syst. Tech. J."
+, volume =      49
+, number =      2
+, year =        1970
+, pages =       "291--307"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ke-loqt-79
-, author =	"M. L. Kersten and P. van {Emde Boas}"
-, title =	"Local optimizations of quad trees"
-, type =	"Report"
-, number =	"IR-51"
-, institution =	"Univ. Amsterdam"
-, address =	"Amsterdam, Netherlands"
-, year =	1979
-, update =	"93.09 rote"
+, author =      "M. L. Kersten and P. van {Emde Boas}"
+, title =       "Local optimizations of quad trees"
+, type =        "Report"
+, number =      "IR-51"
+, institution = "Univ. Amsterdam"
+, address =     "Amsterdam, Netherlands"
+, year =        1979
+, update =      "93.09 rote"
 }
 
 @article{ks-rgrf-81
-, author =	"J. Ketonen and R. Solovay"
-, title =	"Rapidly growing {R}amsey functions"
-, journal =	"Annals of Math."
-, volume =	113
-, year =	1981
-, pages =	"267--314"
-, update =	"95.09 agarwal"
+, author =      "J. Ketonen and R. Solovay"
+, title =       "Rapidly growing {R}amsey functions"
+, journal =     "Annals of Math."
+, volume =      113
+, year =        1981
+, pages =       "267--314"
+, update =      "95.09 agarwal"
 }
 
 @inproceedings{k-cebpv-00
-, author =	"Lutz Kettner"
-, title =	"Contour-Edge Based Polyhedron Visualization"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"77--80"
-, update =	"00.03 bibrelex"
+, author =      "Lutz Kettner"
+, title =       "Contour-Edge Based Polyhedron Visualization"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "77--80"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{k-ddsps-98
-, author =	"L. Kettner"
-, title =	"Designing a data structure for polyhedral surfaces"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"146--154"
-, update =	"99.03 devillers"
+, author =      "L. Kettner"
+, title =       "Designing a data structure for polyhedral surfaces"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "146--154"
+, update =      "99.03 devillers"
 }
 
 @article{k-ugpdd-99
-, author =	"L. Kettner"
-, title =	"Using generic programming for designing a data structure for polyhedral surfaces"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, year =	1999
-, pages =	"65--90"
-, update =	"00.03 smid"
+, author =      "L. Kettner"
+, title =       "Using generic programming for designing a data structure for polyhedral surfaces"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, year =        1999
+, pages =       "65--90"
+, update =      "00.03 smid"
 }
 
 @inproceedings{kmsst-bdptp-01
-, author =	"Lutz Kettner and Andrea Mantler and Jack Snoeyink and Bettina Speckmann and Fumihiko Takeuchi"
-, title =	"Bounded-Degree Pseudo-Triangulations of Points"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"19--22"
-, update =	"01.04 icking"
+, author =      "Lutz Kettner and Andrea Mantler and Jack Snoeyink and Bettina Speckmann and Fumihiko Takeuchi"
+, title =       "Bounded-Degree Pseudo-Triangulations of Points"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "19--22"
+, update =      "01.04 icking"
 }
 
 @inproceedings{kkm-sabrg-97
-, author =	"J. Keyser and S. Krishnan and D. Manocha"
-, title =	"Efficient and Accurate {B}-rep Generation of Low Degree Sculptured Solids using Exact Arithmetic"
-, booktitle =	"Proceedings of ACM Solid Modeling"
-, year =	1997
-, note =	"To appear"
-, update =	"98.03 agarwal"
+, author =      "J. Keyser and S. Krishnan and D. Manocha"
+, title =       "Efficient and Accurate {B}-rep Generation of Low Degree Sculptured Solids using Exact Arithmetic"
+, booktitle =   "Proceedings of ACM Solid Modeling"
+, year =        1997
+, note =        "To appear"
+, update =      "98.03 agarwal"
 }
 
 @techreport{kkm-ebrgl-96
-, author =	"J. Keyser and S. Krishnan and D. Manocha"
-, title =	"Efficient {B}-rep generation of low degree sculptured solids using exact arithmetic"
-, type =	"Technical {Report}"
-, number =	40
-, institution =	"Dept. Comput. Sci., Univ. North Carolina"
-, address =	"Chapel Hill, NC"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "J. Keyser and S. Krishnan and D. Manocha"
+, title =       "Efficient {B}-rep generation of low degree sculptured solids using exact arithmetic"
+, type =        "Technical {Report}"
+, number =      40
+, institution = "Dept. Comput. Sci., Univ. North Carolina"
+, address =     "Chapel Hill, NC"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @techreport{k-cpvc-90
-, author =	"L. Khachiyan"
-, title =	"Complexity of polytope volume computation"
-, type =	"Report"
-, number =	"90-59"
-, institution =	"DIMACS, Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1990
-, keywords =	"approximation, volume, convex"
-, precedes =	"k-cpvc-93"
-, update =	"93.09 erickson"
+, author =      "L. Khachiyan"
+, title =       "Complexity of polytope volume computation"
+, type =        "Report"
+, number =      "90-59"
+, institution = "DIMACS, Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1990
+, keywords =    "approximation, volume, convex"
+, precedes =    "k-cpvc-93"
+, update =      "93.09 erickson"
 }
 
 @incollection{k-cpvc-93
-, author =	"L. Khachiyan"
-, title =	"Complexity of polytope volume computation"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"91--101"
-, keywords =	"survey paper, approximation, volume, convex polytopes"
-, succeeds =	"k-cpvc-90"
-, update =	"93.09 erickson"
+, author =      "L. Khachiyan"
+, title =       "Complexity of polytope volume computation"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "91--101"
+, keywords =    "survey paper, approximation, volume, convex polytopes"
+, succeeds =    "k-cpvc-90"
+, update =      "93.09 erickson"
 }
 
 @article{k-ivie-90
-, author =	"L. G. Khachiyan"
-, title =	"An inequality for the volume of inscribed ellipsoids"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"219--222"
+, author =      "L. G. Khachiyan"
+, title =       "An inequality for the volume of inscribed ellipsoids"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "219--222"
 }
 
 @article{k-palp-80
-, author =	"L. G. Khachiyan"
-, title =	"Polynomial algorithm in linear programming"
-, journal =	"U.S.S.R. Comput. Math. and Math. Phys."
-, volume =	20
-, year =	1980
-, pages =	"53--72"
-, update =	"95.09 devillers"
+, author =      "L. G. Khachiyan"
+, title =       "Polynomial algorithm in linear programming"
+, journal =     "U.S.S.R. Comput. Math. and Math. Phys."
+, volume =      20
+, year =        1980
+, pages =       "53--72"
+, update =      "95.09 devillers"
 }
 
 @techreport{kmy-aalcs-95
-, author =	"S. Khanna and R. Motwani and F. F. Yao"
-, title =	"Approximation algorithms for the largest common subtree problem"
-, type =	"Technical {Report}"
-, number =	"STAN-CS-95-1545"
-, institution =	"Dept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1995
-, update =	"98.07 bibrelex"
+, author =      "S. Khanna and R. Motwani and F. F. Yao"
+, title =       "Approximation algorithms for the largest common subtree problem"
+, type =        "Technical {Report}"
+, number =      "STAN-CS-95-1545"
+, institution = "Dept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1995
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{kmp-artp-98
-, author =	"Sanjeev Khanna and S. Muthukrishnan and Mike Paterson"
-, title =	"On Approximating Rectangle Tiling and Packing"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"384--393"
-, update =	"99.07 bibrelex, 98.07 mitchell"
+, author =      "Sanjeev Khanna and S. Muthukrishnan and Mike Paterson"
+, title =       "On Approximating Rectangle Tiling and Packing"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "384--393"
+, update =      "99.07 bibrelex, 98.07 mitchell"
 }
 
 @article{k-rtoam-85
-, author =	"O. Khatib"
-, title =	"Real-time obstacle avoidance for manipulators and mobile robots"
-, journal =	"Internat. J. Robot. Res."
-, volume =	5
-, year =	1985
-, pages =	"90--98"
-, update =	"95.05 agarwal"
+, author =      "O. Khatib"
+, title =       "Real-time obstacle avoidance for manipulators and mobile robots"
+, journal =     "Internat. J. Robot. Res."
+, volume =      5
+, year =        1985
+, pages =       "90--98"
+, update =      "95.05 agarwal"
 }
 
 @book{k-f-91
-, author =	"A. G. Khovanski\u{\i}"
-, title =	"Fewnomials"
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1991
-, update =	"98.03 agarwal"
+, author =      "A. G. Khovanski\u{\i}"
+, title =       "Fewnomials"
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1991
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{km-srsac-91
-, author =	"S. Khuller and Y. Matias"
-, title =	"A simple randomized sieve algorithm for the closest-pair problem"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"130--134"
-, precedes =	"km-srsac-95"
-, cites =	"b-mdc-80, b-lbact-83, bs-dcms-76, c-faann-83, clr-ia-90, fks-sstwc-84, hns-psscp-88, m-iaca-89, ps-cgi-85, r-pa-76, sh-cpp-75, v-oaann-89, ZZZ"
-, update =	"98.07 bibrelex, 95.09 smid"
+, author =      "S. Khuller and Y. Matias"
+, title =       "A simple randomized sieve algorithm for the closest-pair problem"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "130--134"
+, precedes =    "km-srsac-95"
+, cites =       "b-mdc-80, b-lbact-83, bs-dcms-76, c-faann-83, clr-ia-90, fks-sstwc-84, hns-psscp-88, m-iaca-89, ps-cgi-85, r-pa-76, sh-cpp-75, v-oaann-89, ZZZ"
+, update =      "98.07 bibrelex, 95.09 smid"
 }
 
 @article{km-srsac-95
-, author =	"S. Khuller and Y. Matias"
-, title =	"A simple randomized sieve algorithm for the closest-pair problem"
-, journal =	"Inform. Comput."
-, volume =	118
-, year =	1995
-, pages =	"34--37"
-, succeeds =	"km-srsac-91"
-, update =	"95.09 smid"
+, author =      "S. Khuller and Y. Matias"
+, title =       "A simple randomized sieve algorithm for the closest-pair problem"
+, journal =     "Inform. Comput."
+, volume =      118
+, year =        1995
+, pages =       "34--37"
+, succeeds =    "km-srsac-91"
+, update =      "95.09 smid"
 }
 
 @article{km-tcp-90
-, author =	"S. Khuller and Joseph S. B. Mitchell"
-, title =	"On a triangle counting problem"
-, journal =	"Inform. Process. Lett."
-, volume =	33
-, number =	6
-, year =	1990
-, pages =	"319--321"
-, keywords =	"range query, counting"
-, update =	"98.03 mitchell"
+, author =      "S. Khuller and Joseph S. B. Mitchell"
+, title =       "On a triangle counting problem"
+, journal =     "Inform. Process. Lett."
+, volume =      33
+, number =      6
+, year =        1990
+, pages =       "319--321"
+, keywords =    "range query, counting"
+, update =      "98.03 mitchell"
 }
 
 @article{kry-ldsts-96
-, author =	"S. Khuller and B. Raghavachari and N. Young"
-, title =	"Low-degree spanning trees of small weight"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, year =	1996
-, pages =	"355--368"
-, update =	"96.05 smid"
+, author =      "S. Khuller and B. Raghavachari and N. Young"
+, title =       "Low-degree spanning trees of small weight"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, pages =       "355--368"
+, update =      "96.05 smid"
 }
 
 @inproceedings{ks-ckcp-96
-, author =	"S. Khuller and Y. J. Sussmann"
-, title =	"The capacitated $k$-center problem"
-, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1136
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"152--166"
-, update =	"98.07 agarwal"
+, author =      "S. Khuller and Y. J. Sussmann"
+, title =       "The capacitated $k$-center problem"
+, booktitle =   "Proc. 4th Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1136
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "152--166"
+, update =      "98.07 agarwal"
 }
 
 @article{k-rf23d-66
-, author =	"T. Kiang"
-, title =	"Random fragmentation in $2$ and $3$ dimensions"
-, journal =	"Z. Astrophys."
-, volume =	64
-, year =	1966
-, pages =	"433--439"
+, author =      "T. Kiang"
+, title =       "Random fragmentation in $2$ and $3$ dimensions"
+, journal =     "Z. Astrophys."
+, volume =      64
+, year =        1966
+, pages =       "433--439"
 }
 
 @inproceedings{k-smsm-55
-, author =	"J. Kiefer"
-, title =	"Sequential minimax search for a maximum"
-, booktitle =	"Proc. Amer. Math. Soc."
-, volume =	4
-, year =	1955
-, pages =	"502--506"
-, update =	"98.07 bibrelex"
+, author =      "J. Kiefer"
+, title =       "Sequential minimax search for a maximum"
+, booktitle =   "Proc. Amer. Math. Soc."
+, volume =      4
+, year =        1955
+, pages =       "502--506"
+, update =      "98.07 bibrelex"
 }
 
 @article{kt-eprc-81
-, author =	"H. A. Kierstead and W. T. Trotter"
-, title =	"An extremal problem in recursive combinatorics"
-, journal =	"Congr. Numer."
-, volume =	33
-, year =	1981
-, pages =	"143--153"
-, update =	"98.07 bibrelex"
+, author =      "H. A. Kierstead and W. T. Trotter"
+, title =       "An extremal problem in recursive combinatorics"
+, journal =     "Congr. Numer."
+, volume =      33
+, year =        1981
+, pages =       "143--153"
+, update =      "98.07 bibrelex"
 }
 
 @article{k-dcscp-82
-, author =	"C. Kim"
-, title =	"Digital convexity, straightness, and convex polygons"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-4"
-, year =	1982
-, pages =	"618--626"
-, update =	"98.07 bibrelex"
+, author =      "C. Kim"
+, title =       "Digital convexity, straightness, and convex polygons"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-4"
+, year =        1982
+, pages =       "618--626"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{k-ltcha-80
-, author =	"C. E. Kim"
-, title =	"A linear time convex hull algorithm for simple polygons"
-, type =	"Report"
-, number =	"TR-956"
-, institution =	"Univ. Maryland, Dept. Comput. Sci."
-, address =	"Baltimore, MD"
-, year =	1980
+, author =      "C. E. Kim"
+, title =       "A linear time convex hull algorithm for simple polygons"
+, type =        "Report"
+, number =      "TR-956"
+, institution = "Univ. Maryland, Dept. Comput. Sci."
+, address =     "Baltimore, MD"
+, year =        1980
 }
 
 @article{ka-dd-84
-, author =	"C. E. Kim and T. Anderson"
-, title =	"Digital disks"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-6"
-, number =	5
-, year =	1984
-, pages =	"639--645"
-, succeeds =	"ka-dddcm-84"
+, author =      "C. E. Kim and T. Anderson"
+, title =       "Digital disks"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-6"
+, number =      5
+, year =        1984
+, pages =       "639--645"
+, succeeds =    "ka-dddcm-84"
 }
 
 @inproceedings{ka-dddcm-84
-, author =	"C. E. Kim and T. Anderson"
-, title =	"Digital disks and a digital compactness measure"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"117--124"
-, precedes =	"ka-dd-84"
+, author =      "C. E. Kim and T. Anderson"
+, title =       "Digital disks and a digital compactness measure"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "117--124"
+, precedes =    "ka-dd-84"
 }
 
 @article{kr-dslcd-82
-, author =	"C. E. Kim and A. Rosenfeld"
-, title =	"Digital straight lines and convexity of digital regions"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-4"
-, year =	1982
-, pages =	"149--153"
-, succeeds =	"kr-dsc-81"
+, author =      "C. E. Kim and A. Rosenfeld"
+, title =       "Digital straight lines and convexity of digital regions"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-4"
+, year =        1982
+, pages =       "149--153"
+, succeeds =    "kr-dsc-81"
 }
 
 @inproceedings{kr-dsc-81
-, author =	"C. E. Kim and A. Rosenfeld"
-, title =	"Digital straightness and convexity"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
-, year =	1981
-, pages =	"80--89"
-, precedes =	"kr-dslcd-82"
+, author =      "C. E. Kim and A. Rosenfeld"
+, title =       "Digital straightness and convexity"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Theory Comput."
+, year =        1981
+, pages =       "80--89"
+, precedes =    "kr-dslcd-82"
 }
 
 @inproceedings{kr-cdr-80
-, author =	"C. E. Kim and A. Rosenfeld"
-, title =	"On the convexity of digital regions"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
-, year =	1980
-, pages =	"1010--1015"
+, author =      "C. E. Kim and A. Rosenfeld"
+, title =       "On the convexity of digital regions"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Pattern Recogn."
+, year =        1980
+, pages =       "1010--1015"
 }
 
 @inproceedings{kgs-fcdmm-97
-, author =	"D. Kim and L. J. Guibas and S. Shin"
-, title =	"Fast collision detection among multiple moving spheres"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"373--375"
-, cites =	"b-cscnp-90, bgh-dsmd-97, fls-flp-63, glm-othsr-96, h-rarb-88, ho-smhsr-94, h-apstc-96, l-mmbc-66, m-pbpsm-96, mw-cdrca-88, ob-dtdos-79, r-pstmc-83, r-fhsdb-87, s-parud-90, st-smops-92, t-icdmg-90, hafg-ecpmm-95, wg-udbvh-92, wl-arrcd-85, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "D. Kim and L. J. Guibas and S. Shin"
+, title =       "Fast collision detection among multiple moving spheres"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "373--375"
+, cites =       "b-cscnp-90, bgh-dsmd-97, fls-flp-63, glm-othsr-96, h-rarb-88, ho-smhsr-94, h-apstc-96, l-mmbc-66, m-pbpsm-96, mw-cdrca-88, ob-dtdos-79, r-pstmc-83, r-fhsdb-87, s-parud-90, st-smops-92, t-icdmg-90, hafg-ecpmm-95, wg-udbvh-92, wl-arrcd-85, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @article{khp-rvdsp-95
-, author =	"D. S. Kim and I. K. Hwang and B. J. Park"
-, title =	"Representing the {Voronoi} Diagram of a Simple Polygon Using Rational Quadratic Bezi\'er Curves"
-, journal =	"Comput. Aided Design"
-, volume =	27
-, number =	8
-, month =	aug
-, year =	1995
-, pages =	"605--614"
-, update =	"97.11 held"
+, author =      "D. S. Kim and I. K. Hwang and B. J. Park"
+, title =       "Representing the {Voronoi} Diagram of a Simple Polygon Using Rational Quadratic Bezi\'er Curves"
+, journal =     "Comput. Aided Design"
+, volume =      27
+, number =      8
+, month =       aug
+, year =        1995
+, pages =       "605--614"
+, update =      "97.11 held"
 }
 
 @article{ksc-easdv-95
-, author =	"S. H. Kim and S. Y. Shin and K. Y. Chwa"
-, title =	"Efficient algorithms for solving diagonal visibility problems in a simple polygon"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"433--458"
-, keywords =	"visibility, polygon, weak visibility, guard diagonal"
-, update =	"96.09 devillers"
+, author =      "S. H. Kim and S. Y. Shin and K. Y. Chwa"
+, title =       "Efficient algorithms for solving diagonal visibility problems in a simple polygon"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "433--458"
+, keywords =    "visibility, polygon, weak visibility, guard diagonal"
+, update =      "96.09 devillers"
 }
 
 @techreport{k-pafmc-89
-, author =	"S. K. Kim"
-, title =	"A parallel algorithm for finding a maximum clique of a set of circular-arcs of a circle"
-, institution =	"Univ. Washington"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "S. K. Kim"
+, title =       "A parallel algorithm for finding a maximum clique of a set of circular-arcs of a circle"
+, institution = "Univ. Washington"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{k-saoud-95
-, author =	"Sung Kwon Kim"
-, title =	"Simple Algorithms for Orthogonal Upward Drawings of Binary and Ternary Trees"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"115--120"
-, update =	"95.09 jones"
+, author =      "Sung Kwon Kim"
+, title =       "Simple Algorithms for Orthogonal Upward Drawings of Binary and Ternary Trees"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "115--120"
+, update =      "95.09 jones"
 }
 
 @techreport{ks-cobbt-99
-, author =	"S. K. Kim and C. S. Shin"
-, title =	"Computing the optimal bridge between two polygons"
-, type =	"Research Report {TCSC-99-14}"
-, institution =	"HKUST"
-, year =	1999
-, precedes =	"ks-cobbt-01"
-, update =	"02.03 cheong"
+, author =      "S. K. Kim and C. S. Shin"
+, title =       "Computing the optimal bridge between two polygons"
+, type =        "Research Report {TCSC-99-14}"
+, institution = "HKUST"
+, year =        1999
+, precedes =    "ks-cobbt-01"
+, update =      "02.03 cheong"
 }
 
 @article{ks-cobbt-01
-, author =	"S. K. Kim and C.-S. Shin"
-, title =	"Computing the optimal bridge between two polygons"
-, journal =	"Theory of Computing Systems"
-, volume =	34
-, year =	2001
-, pages =	"337--354"
-, succeeds =	"ks-cobbt-99"
-, update =	"02.03 cheong"
+, author =      "S. K. Kim and C.-S. Shin"
+, title =       "Computing the optimal bridge between two polygons"
+, journal =     "Theory of Computing Systems"
+, volume =      34
+, year =        2001
+, pages =       "337--354"
+, succeeds =    "ks-cobbt-99"
+, update =      "02.03 cheong"
 }
 
 @article{ksy-lrmsl-01
-, author =	"S. K. Kim and C.-S. Shin and T.-C. Yang"
-, title =	"Labeling a rectilinear map with sliding labels"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"167--179"
-, update =	"01.07 smid"
+, author =      "S. K. Kim and C.-S. Shin and T.-C. Yang"
+, title =       "Labeling a rectilinear map with sliding labels"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "167--179"
+, update =      "01.07 smid"
 }
 
 @article{ksy-ptdcp-00
-, author =	"S. K. Kim and C.-S. Shin and T.-C. Yang"
-, title =	"Placing two disks in a convex polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	73
-, year =	2000
-, pages =	"33--39"
-, update =	"01.07 smid"
+, author =      "S. K. Kim and C.-S. Shin and T.-C. Yang"
+, title =       "Placing two disks in a convex polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      73
+, year =        2000
+, pages =       "33--39"
+, update =      "01.07 smid"
 }
 
 @article{ka-rpcsm-86
-, author =	"Y. Kim and J. Aggarwal"
-, title =	"Rectangular parallelepiped coding for solid modeling"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	"??"
-, year =	1986
-, pages =	"77--85"
-, update =	"98.11 bibrelex"
+, author =      "Y. Kim and J. Aggarwal"
+, title =       "Rectangular parallelepiped coding for solid modeling"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      "??"
+, year =        1986
+, pages =       "77--85"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{klrz-rvcdg-95
-, author =	"D. Kimelman and B. Leban and T. Roth and D. Zernik"
-, title =	"Reduction of Visual Complexity in Dynamic Graphs"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"218--225"
-, keywords =	"graph drawing, software visualization, system"
-, update =	"95.01 tamassia"
+, author =      "D. Kimelman and B. Leban and T. Roth and D. Zernik"
+, title =       "Reduction of Visual Complexity in Dynamic Graphs"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "218--225"
+, keywords =    "graph drawing, software visualization, system"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{ks-pviac-92
-, author =	"D. Kimelman and G. Sangudi"
-, title =	"Program Visualization by Integration of Advanced Compiler Technology with Configurable Views"
-, editor =	"J. J. Dongarra and B. Tourancheau"
-, booktitle =	"Proc. CNRS-NSF Collaboration Workshop on Environments and Tools for Parallel Scientific Computing, Saint Hilaire du Touvert, France"
-, publisher =	"Elsevier Science"
-, year =	"September, 1992"
-, pages =	"73--84"
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "D. Kimelman and G. Sangudi"
+, title =       "Program Visualization by Integration of Advanced Compiler Technology with Configurable Views"
+, editor =      "J. J. Dongarra and B. Tourancheau"
+, booktitle =   "Proc. CNRS-NSF Collaboration Workshop on Environments and Tools for Parallel Scientific Computing, Saint Hilaire du Touvert, France"
+, publisher =   "Elsevier Science"
+, year =        "September, 1992"
+, pages =       "73--84"
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @techreport{kab-fspgs-93
-, author =	"R. Kimmel and A. Amir and A. M. Bruckstein"
-, title =	"Finding shortest paths on graph surfaces"
-, number =	"CIS 9301"
-, institution =	"Technion IIT"
-, address =	"Haifa, Israel"
-, month =	jan
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "R. Kimmel and A. Amir and A. M. Bruckstein"
+, title =       "Finding shortest paths on graph surfaces"
+, number =      "CIS 9301"
+, institution = "Technion IIT"
+, address =     "Haifa, Israel"
+, month =       jan
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{kb-sols-92
-, author =	"R. Kimmel and A. M. Bruckstein"
-, title =	"Shape offsets via level sets"
-, institution =	"Technion IIT"
-, address =	"Haifa, Israel"
-, month =	jul
-, year =	1992
-, update =	"93.09 milone+mitchell"
+, author =      "R. Kimmel and A. M. Bruckstein"
+, title =       "Shape offsets via level sets"
+, institution = "Technion IIT"
+, address =     "Haifa, Israel"
+, month =       jul
+, year =        1992
+, update =      "93.09 milone+mitchell"
 }
 
 @article{kb-sols-93
-, author =	"R. Kimmel and A. M. Bruckstein"
-, title =	"Shape Offsets via Level Sets"
-, journal =	"Comput. Aided Design"
-, volume =	25
-, number =	3
-, month =	mar
-, year =	1993
-, pages =	"154--162"
-, update =	"93.09 held"
+, author =      "R. Kimmel and A. M. Bruckstein"
+, title =       "Shape Offsets via Level Sets"
+, journal =     "Comput. Aided Design"
+, volume =      25
+, number =      3
+, month =       mar
+, year =        1993
+, pages =       "154--162"
+, update =      "93.09 held"
 }
 
 @techreport{kb-spdmw-93
-, author =	"R. Kimmel and A. M. Bruckstein"
-, title =	"Sub-pixel distance maps and weighted distance transforms"
-, number =	"CIS 9314"
-, institution =	"Technion IIT"
-, address =	"Haifa, Israel"
-, month =	apr
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "R. Kimmel and A. M. Bruckstein"
+, title =       "Sub-pixel distance maps and weighted distance transforms"
+, number =      "CIS 9314"
+, institution = "Technion IIT"
+, address =     "Haifa, Israel"
+, month =       apr
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{ks-stdct-93
-, author =	"R. Kimmel and G. Sapiro"
-, title =	"Shortening three dimensional curves via two dimensional flows"
-, number =	"CIS 9315"
-, institution =	"Technion IIT"
-, address =	"Haifa, Israel"
-, month =	apr
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "R. Kimmel and G. Sapiro"
+, title =       "Shortening three dimensional curves via two dimensional flows"
+, number =      "CIS 9315"
+, institution = "Technion IIT"
+, address =     "Haifa, Israel"
+, month =       apr
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{ks-fvdts-00
-, author =	"R. Kimmel and J. A. Sethian"
-, title =	"Fast {Voronoi} Diagrams on Triangulated Surfaces"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"1--4"
-, update =	"00.03 bibrelex"
+, author =      "R. Kimmel and J. A. Sethian"
+, title =       "Fast {Voronoi} Diagrams on Triangulated Surfaces"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "1--4"
+, update =      "00.03 bibrelex"
 }
 
 @article{k-opcbf-95
-, author =	"J. Kincses"
-, title =	"On polytopes cut by flats"
-, journal =	"Discrete Comput. Geom."
-, volume =	14
-, year =	1995
-, pages =	"287--294"
-, update =	"96.05 pascucci"
+, author =      "J. Kincses"
+, title =       "On polytopes cut by flats"
+, journal =     "Discrete Comput. Geom."
+, volume =      14
+, year =        1995
+, pages =       "287--294"
+, update =      "96.05 pascucci"
 }
 
 @techreport{ksr-sawrp1-91
-, author =	"M. Kindl and M. Shing and N. Rowe"
-, title =	"A stochastic approach to the weighted-region problem, {I}: The design of the path annealing algorithm"
-, institution =	"Computer Science, U.S. Naval Postgraduate School"
-, address =	"Monterey, CA"
-, year =	1991
+, author =      "M. Kindl and M. Shing and N. Rowe"
+, title =       "A stochastic approach to the weighted-region problem, {I}: The design of the path annealing algorithm"
+, institution = "Computer Science, U.S. Naval Postgraduate School"
+, address =     "Monterey, CA"
+, year =        1991
 }
 
 @techreport{ksr-sawrp2-91
-, author =	"M. Kindl and M. Shing and N. Rowe"
-, title =	"A stochastic approach to the weighted-region problem, {II}: Performance enhancement techniques and experimental results"
-, institution =	"Computer Science, U.S. Naval Postgraduate School"
-, address =	"Monterey, CA"
-, year =	1991
+, author =      "M. Kindl and M. Shing and N. Rowe"
+, title =       "A stochastic approach to the weighted-region problem, {II}: Performance enhancement techniques and experimental results"
+, institution = "Computer Science, U.S. Naval Postgraduate School"
+, address =     "Monterey, CA"
+, year =        1991
 }
 
 @inproceedings{krt-fdmfa-92
-, author =	"V. King and S. Rao and R. E. Tarjan"
-, title =	"A faster deterministic maximum flow algorithm"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"157--164"
-, update =	"97.11 bibrelex"
+, author =      "V. King and S. Rao and R. E. Tarjan"
+, title =       "A faster deterministic maximum flow algorithm"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "157--164"
+, update =      "97.11 bibrelex"
 }
 
 @book{k-ts-93
-, author =	"C. Kinsey"
-, title =	"Topology of Surfaces"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1993
-, update =	"98.07 bibrelex"
+, author =      "C. Kinsey"
+, title =       "Topology of Surfaces"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1993
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{k-pldt-97
-, author =	"Rob Kirby"
-, title =	"Problems in Low-Dimensional Topology"
-, booktitle =	"Geometric Topology: Proceedings of the 1993 Georgia International Topology Conference"
-, site =	"Conference held on August 2--13, 1993 in Athens, Georgia."
-, series =	"AMS/IP Studies in Advanced Mathematics"
-, volume =	"2.2"
-, publisher =	"American Mathematical Society and International Press"
-, year =	1997
-, pages =	"35--473"
+, author =      "Rob Kirby"
+, title =       "Problems in Low-Dimensional Topology"
+, booktitle =   "Geometric Topology: Proceedings of the 1993 Georgia International Topology Conference"
+, site =        "Conference held on August 2--13, 1993 in Athens, Georgia."
+, series =      "AMS/IP Studies in Advanced Mathematics"
+, volume =      "2.2"
+, publisher =   "American Mathematical Society and International Press"
+, year =        1997
+, pages =       "35--473"
 , url = "http://www.math.berkeley.edu/~kirby/problems.ps.gz"
-, update =	"02.03 orourke"
+, update =      "02.03 orourke"
 }
 
 @incollection{ks-sbtat-77
-, author =	"R. C. Kirby and L. C. Siebenmann"
-, title =	"Some basic theorems about topological manifolds"
-, booktitle =	"Foundational Essays on Topological Manifolds, Smoothings, and Triangulations"
-, series =	"Ann. Math. Studies"
-, publisher =	"Princeton University Press"
-, address =	"Princeton, NJ"
-, year =	1977
-, pages =	"79--152"
-, update =	"97.11 bibrelex"
+, author =      "R. C. Kirby and L. C. Siebenmann"
+, title =       "Some basic theorems about topological manifolds"
+, booktitle =   "Foundational Essays on Topological Manifolds, Smoothings, and Triangulations"
+, series =      "Ann. Math. Studies"
+, publisher =   "Princeton University Press"
+, address =     "Princeton, NJ"
+, year =        1977
+, pages =       "79--152"
+, update =      "97.11 bibrelex"
 }
 
 @article{k-ta-03
-, author =	"P. Kirchberger"
-, title =	"{\"U}ber Tschebyschefsche Ann{\"a}herungsmethoden"
-, journal =	"Math. Ann."
-, volume =	57
-, year =	1903
-, pages =	"509--540"
-, update =	"98.03 bibrelex"
+, author =      "P. Kirchberger"
+, title =       "{\"U}ber Tschebyschefsche Ann{\"a}herungsmethoden"
+, journal =     "Math. Ann."
+, volume =      57
+, year =        1903
+, pages =       "509--540"
+, update =      "98.03 bibrelex"
 }
 
 @book{k-gg3-92
-, title =	"Graphics Gems {III}"
-, editor =	"David Kirk"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1992
-, update =	"98.07 tamassia+vismara"
+, title =       "Graphics Gems {III}"
+, editor =      "David Kirk"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1992
+, update =      "98.07 tamassia+vismara"
 }
 
 @article{kl-dmraa-70
-, author =	"D. Kirk and L. Lim"
-, title =	"A Dual-Mode Routing Algorithm for an Autonomous Roving Vehicle"
-, journal =	"IEEE Trans. Aerosp. Electron. Syst."
-, volume =	6
-, number =	3
-, year =	1970
-, pages =	"290--294"
-, comments =	"Oldest paper found on shortest paths among obstacles in the plane"
-, update =	"96.09 devillers, 93.09 milone+mitchell"
+, author =      "D. Kirk and L. Lim"
+, title =       "A Dual-Mode Routing Algorithm for an Autonomous Roving Vehicle"
+, journal =     "IEEE Trans. Aerosp. Electron. Syst."
+, volume =      6
+, number =      3
+, year =        1970
+, pages =       "290--294"
+, comments =    "Oldest paper found on shortest paths among obstacles in the plane"
+, update =      "96.09 devillers, 93.09 milone+mitchell"
 }
 
 @techreport{kkmy-qstam-89
-, author =	"D. Kirkpatrick and S. Kosaraju and B. Mishra and C. Yap"
-, title =	"Quantitative {Steinitz}'s theorems with applications to multifinger grasping"
-, type =	"Technical {Report}"
-, number =	460
-, institution =	"New York University"
-, address =	"New York, NY"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "D. Kirkpatrick and S. Kosaraju and B. Mishra and C. Yap"
+, title =       "Quantitative {Steinitz}'s theorems with applications to multifinger grasping"
+, type =        "Technical {Report}"
+, number =      460
+, institution = "New York University"
+, address =     "New York, NY"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{kmy-qstam-90
-, author =	"D. Kirkpatrick and B. Mishra and C. K. Yap"
-, title =	"Quantitative {Steinitz}'s theorems with applications to multifingered grasping"
-, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
-, year =	1990
-, pages =	"341--351"
-, precedes =	"kmy-qstam-92"
+, author =      "D. Kirkpatrick and B. Mishra and C. K. Yap"
+, title =       "Quantitative {Steinitz}'s theorems with applications to multifingered grasping"
+, booktitle =   "Proc. 22nd Annu. ACM Sympos. Theory Comput."
+, year =        1990
+, pages =       "341--351"
+, precedes =    "kmy-qstam-92"
 }
 
 @article{kmy-qstam-92
-, author =	"D. Kirkpatrick and B. Mishra and C.-K. Yap"
-, title =	"Quantitative {Steinitz}'s theorems with applications to multifingered grasping"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"295--318"
-, succeeds =	"kmy-qstam-90"
+, author =      "D. Kirkpatrick and B. Mishra and C.-K. Yap"
+, title =       "Quantitative {Steinitz}'s theorems with applications to multifingered grasping"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "295--318"
+, succeeds =    "kmy-qstam-90"
 }
 
 @inproceedings{ks-cctws-95
-, author =	"David Kirkpatrick and Jack Snoeyink"
-, title =	"Computing Common Tangents Without a Separating Line"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"183--193"
-, update =	"99.07 bibrelex, 98.11 bibrelex, 95.05 mitchell"
+, author =      "David Kirkpatrick and Jack Snoeyink"
+, title =       "Computing Common Tangents Without a Separating Line"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "183--193"
+, update =      "99.07 bibrelex, 98.11 bibrelex, 95.05 mitchell"
 }
 
 @inproceedings{ks-ccssb-93
-, author =	"D. Kirkpatrick and J. Snoeyink"
-, title =	"Computing constrained shortest segments: {Butterfly} wingspans in logarithmic time"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"163--168"
-, cites =	"bt-cst-91a, bcetsu-csts-91, bet-cwb-91, dk-fdpi-83, e-cedbt-85, ghs-citds-91, ks-tpscv-93, ol-mcp-81, ps-cgi-85, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "D. Kirkpatrick and J. Snoeyink"
+, title =       "Computing constrained shortest segments: {Butterfly} wingspans in logarithmic time"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "163--168"
+, cites =       "bt-cst-91a, bcetsu-csts-91, bet-cwb-91, dk-fdpi-83, e-cedbt-85, ghs-citds-91, ks-tpscv-93, ol-mcp-81, ps-cgi-85, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{ks-tpscf-95
-, author =	"D. Kirkpatrick and J. Snoeyink"
-, title =	"Tentative prune-and-search for computing fixed-points with applications to geometric computation"
-, journal =	"Fundam. Inform."
-, volume =	22
-, year =	1995
-, pages =	"353--370"
-, update =	"96.09 smid"
+, author =      "D. Kirkpatrick and J. Snoeyink"
+, title =       "Tentative prune-and-search for computing fixed-points with applications to geometric computation"
+, journal =     "Fundam. Inform."
+, volume =      22
+, year =        1995
+, pages =       "353--370"
+, update =      "96.09 smid"
 }
 
 @inproceedings{ks-tpscv-93
-, author =	"D. Kirkpatrick and J. Snoeyink"
-, title =	"Tentative prune-and-search for computing {Voronoi} vertices"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"133--142"
-, cites =	"bet-cwb-91, c-oaitd-89t, dk-fdpi-83, dk-dsppu-90, e-cedbt-85, em-feptd-85, e-dtdlp-91, ghs-citds-91, km-accvd-91, k-osps-83, ls-pptmc-87, m-spai3-91, mks-avdpt-93, m-ddlpc-91i, ol-mcp-81, ps-cgi-85, y-oavds-87, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "D. Kirkpatrick and J. Snoeyink"
+, title =       "Tentative prune-and-search for computing {Voronoi} vertices"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "133--142"
+, cites =       "bet-cwb-91, c-oaitd-89t, dk-fdpi-83, dk-dsppu-90, e-cedbt-85, em-feptd-85, e-dtdlp-91, ghs-citds-91, km-accvd-91, k-osps-83, ls-pptmc-87, m-spai3-91, mks-avdpt-93, m-ddlpc-91i, ol-mcp-81, ps-cgi-85, y-oavds-87, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @inproceedings{kss-kcdsp-00
-, author =	"David Kirkpatrick and Jack Snoeyink and Bettina Speckmann"
-, title =	"Kinetic Collision Detection for Simple Polygons"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"322--330"
-, update =	"00.11 jones"
+, author =      "David Kirkpatrick and Jack Snoeyink and Bettina Speckmann"
+, title =       "Kinetic Collision Detection for Simple Polygons"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "322--330"
+, update =      "00.11 jones"
 }
 
 @article{kw-dbrow-96
-, author =	"D. Kirkpatrick and S. Wismath"
-, title =	"Determining bar-representability for ordered weighted graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"99--122"
-, update =	"97.07 devillers"
+, author =      "D. Kirkpatrick and S. Wismath"
+, title =       "Determining bar-representability for ordered weighted graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "99--122"
+, update =      "97.07 devillers"
 }
 
 @article{k-ndot-80
-, author =	"D. G. Kirkpatrick"
-, title =	"A note on {Delaunay} and optimal triangulations"
-, journal =	"Inform. Process. Lett."
-, volume =	10
-, number =	3
-, year =	1980
-, pages =	"127--128"
-, keywords =	"triangulations, Delaunay triangulations, worst-case analysis"
-, update =	"98.11 bibrelex"
+, author =      "D. G. Kirkpatrick"
+, title =       "A note on {Delaunay} and optimal triangulations"
+, journal =     "Inform. Process. Lett."
+, volume =      10
+, number =      3
+, year =        1980
+, pages =       "127--128"
+, keywords =    "triangulations, Delaunay triangulations, worst-case analysis"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{k-ubsir-80
-, author =	"D. G. Kirkpatrick"
-, title =	"An upper bound for sorting integers in restricted ranges"
-, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "D. G. Kirkpatrick"
+, title =       "An upper bound for sorting integers in restricted ranges"
+, booktitle =   "Proc. 18th Allerton Conf. Commun. Control Comput."
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{k-eccs-79
-, author =	"D. G. Kirkpatrick"
-, title =	"Efficient computation of continuous skeletons"
-, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1979
-, pages =	"18--27"
-, keywords =	"design of algorithms, Voronoi diagrams, merging, generalized Voronoi diagrams, minimum spanning trees"
+, author =      "D. G. Kirkpatrick"
+, title =       "Efficient computation of continuous skeletons"
+, booktitle =   "Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1979
+, pages =       "18--27"
+, keywords =    "design of algorithms, Voronoi diagrams, merging, generalized Voronoi diagrams, minimum spanning trees"
 }
 
 @inproceedings{k-eops-87
-, author =	"D. G. Kirkpatrick"
-, title =	"Establishing order in planar subdivisions"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"316--321"
-, keywords =	"data structuring, construction, plane graph representation, subdivisions"
-, precedes =	"k-eops-88"
-, cites =	"ahu-daca-74, b-prcv-75, b-lbact-83, dl-ccvsp-79, egs-oplms-86, e-ga-79, f-slrpg-48, grs-kfcg-83, gs-pmgsc-83, ht-ept-74, k-osps-83, k-ss-73, lp-lppsi-77, lec-aptg-67, mp-fitcp-78, ps-dtram-80, ps-cgi-85, t-dfslg-72, tv-otats-86, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "D. G. Kirkpatrick"
+, title =       "Establishing order in planar subdivisions"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "316--321"
+, keywords =    "data structuring, construction, plane graph representation, subdivisions"
+, precedes =    "k-eops-88"
+, cites =       "ahu-daca-74, b-prcv-75, b-lbact-83, dl-ccvsp-79, egs-oplms-86, e-ga-79, f-slrpg-48, grs-kfcg-83, gs-pmgsc-83, ht-ept-74, k-osps-83, k-ss-73, lp-lppsi-77, lec-aptg-67, mp-fitcp-78, ps-dtram-80, ps-cgi-85, t-dfslg-72, tv-otats-86, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{k-eops-88
-, author =	"D. G. Kirkpatrick"
-, title =	"Establishing order in planar subdivisions"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"267--280"
-, keywords =	"data structuring, construction, plane graph representation, subdivisions"
-, succeeds =	"k-eops-87"
+, author =      "D. G. Kirkpatrick"
+, title =       "Establishing order in planar subdivisions"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "267--280"
+, keywords =    "data structuring, construction, plane graph representation, subdivisions"
+, succeeds =    "k-eops-87"
 }
 
 @inproceedings{k-alcmw-89
-, author =	"D. G. Kirkpatrick"
-, title =	"On the absence of local characterizations of minimum weight triangulations"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	16
+, author =      "D. G. Kirkpatrick"
+, title =       "On the absence of local characterizations of minimum weight triangulations"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       16
 }
 
 @techreport{k-osps-81
-, author =	"D. G. Kirkpatrick"
-, title =	"Optimal Search in Planar Subdivisions"
-, type =	"Technical {Report}"
-, number =	"81-13"
-, institution =	"Dept. Comput. Sci., Univ. British Columbia"
-, address =	"Vancouver, BC"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "D. G. Kirkpatrick"
+, title =       "Optimal Search in Planar Subdivisions"
+, type =        "Technical {Report}"
+, number =      "81-13"
+, institution = "Dept. Comput. Sci., Univ. British Columbia"
+, address =     "Vancouver, BC"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @article{k-osps-83
-, author =	"D. G. Kirkpatrick"
-, title =	"Optimal search in planar subdivisions"
-, journal =	"SIAM J. Comput."
-, volume =	12
-, number =	1
-, year =	1983
-, pages =	"28--35"
-, keywords =	"data structuring, searching, subdivisions, plane graph representation, hierarchical representations"
-, update =	"98.07 bibrelex+tamassia"
+, author =      "D. G. Kirkpatrick"
+, title =       "Optimal search in planar subdivisions"
+, journal =     "SIAM J. Comput."
+, volume =      12
+, number =      1
+, year =        1983
+, pages =       "28--35"
+, keywords =    "data structuring, searching, subdivisions, plane graph representation, hierarchical representations"
+, update =      "98.07 bibrelex+tamassia"
 }
 
 @techreport{kkt-ptots-90t
-, author =	"D. G. Kirkpatrick and M. M. Klawe and R. E. Tarjan"
-, title =	"Polygon triangulation in {$O(n \log\log n)$} time with simple data structures"
-, type =	"Technical {Report}"
-, number =	"90-17"
-, institution =	"Dept. Comput. Sci., Univ. British Columbia"
-, address =	"Vancouver, BC"
-, month =	jun
-, year =	1990
-, precedes =	"kkt-ptots-90i"
+, author =      "D. G. Kirkpatrick and M. M. Klawe and R. E. Tarjan"
+, title =       "Polygon triangulation in {$O(n \log\log n)$} time with simple data structures"
+, type =        "Technical {Report}"
+, number =      "90-17"
+, institution = "Dept. Comput. Sci., Univ. British Columbia"
+, address =     "Vancouver, BC"
+, month =       jun
+, year =        1990
+, precedes =    "kkt-ptots-90i"
 }
 
 @inproceedings{kkt-ptots-90i
-, author =	"D. G. Kirkpatrick and M. M. Klawe and R. E. Tarjan"
-, title =	"Polygon triangulation in {$O(n \log\log n)$} time with simple data structures"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"34--43"
-, succeeds =	"kkt-ptots-90t"
-, cites =	"bt-ladts-86, c-tpca-82, ci-tsc-84, c-ept-90, ctv-flvat-88i, egs-oplms-86, ffr-pscaa-83, fm-tspep-84, fntv-sltjs-88, ghlst-ltavs-87, gjpt-tsp-78, hm-ftsp-83, hmrt-sjslt-86, kk-cgig-81, k-osps-83, l-srvdd-81, ltl-mpsrp-89, tv-otats-88, t-prgc-80, t-cgm-86, t-ocspt-88, t-cm-88, ta-chapi-82, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. G. Kirkpatrick and M. M. Klawe and R. E. Tarjan"
+, title =       "Polygon triangulation in {$O(n \log\log n)$} time with simple data structures"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "34--43"
+, succeeds =    "kkt-ptots-90t"
+, cites =       "bt-ladts-86, c-tpca-82, ci-tsc-84, c-ept-90, ctv-flvat-88i, egs-oplms-86, ffr-pscaa-83, fm-tspep-84, fntv-sltjs-88, ghlst-ltavs-87, gjpt-tsp-78, hm-ftsp-83, hmrt-sjslt-86, kk-cgig-81, k-osps-83, l-srvdd-81, ltl-mpsrp-89, tv-otats-88, t-prgc-80, t-cgm-86, t-ocspt-88, t-cm-88, ta-chapi-82, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{kr-fcm-85
-, author =	"D. G. Kirkpatrick and J. D. Radke"
-, title =	"A framework for computational morphology"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"217--248"
-, keywords =	"design of algorithms, construction, pattern recognition, shape"
+, author =      "D. G. Kirkpatrick and J. D. Radke"
+, title =       "A framework for computational morphology"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "217--248"
+, keywords =    "design of algorithms, construction, pattern recognition, shape"
 }
 
 @inproceedings{ks-ossaf-85
-, author =	"D. G. Kirkpatrick and R. Seidel"
-, title =	"Output-size sensitive algorithms for finding maximal vectors"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"89--96"
-, keywords =	"domination, divide-and-conquer, output dependent"
-, cites =	"ahu-daca-74, b-lbact-83, bs-dclet-78, bkst-anmsv-78, gbt-srtgp-84, ks-upcha-82t, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. G. Kirkpatrick and R. Seidel"
+, title =       "Output-size sensitive algorithms for finding maximal vectors"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "89--96"
+, keywords =    "domination, divide-and-conquer, output dependent"
+, cites =       "ahu-daca-74, b-lbact-83, bs-dclet-78, bkst-anmsv-78, gbt-srtgp-84, ks-upcha-82t, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ks-upcha-82
-, author =	"D. G. Kirkpatrick and R. Seidel"
-, title =	"The Ultimate Planar Convex Hull Algorithm?"
-, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
-, site =	"Monticello, Illinois"
-, year =	1982
-, pages =	"35--42"
-, precedes =	"ks-upcha-86"
-, update =	"94.05 grigni, 93.09 held"
+, author =      "D. G. Kirkpatrick and R. Seidel"
+, title =       "The Ultimate Planar Convex Hull Algorithm?"
+, booktitle =   "Proc. 20th Allerton Conf. Commun. Control Comput."
+, site =        "Monticello, Illinois"
+, year =        1982
+, pages =       "35--42"
+, precedes =    "ks-upcha-86"
+, update =      "94.05 grigni, 93.09 held"
 }
 
 @article{ks-upcha-86
-, author =	"D. G. Kirkpatrick and R. Seidel"
-, title =	"The ultimate planar convex hull algorithm?"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"287--299"
-, keywords =	"designing algorithms, convex hull, two-dimensional, divide-and-conquer, output-dependent, lower bounds, linear programming"
-, succeeds =	"ks-upcha-82"
-, update =	"94.05 grigni"
-, annote =	"$O(n \log h)$ time"
+, author =      "D. G. Kirkpatrick and R. Seidel"
+, title =       "The ultimate planar convex hull algorithm?"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "287--299"
+, keywords =    "designing algorithms, convex hull, two-dimensional, divide-and-conquer, output-dependent, lower bounds, linear programming"
+, succeeds =    "ks-upcha-82"
+, update =      "94.05 grigni"
+, annote =      "$O(n \log h)$ time"
 }
 
 @techreport{ks-upcha-82t
-, author =	"D. G. Kirkpatrick and R. Seidel"
-, title =	"The Ultimate Planar Convex Hull Algorithm"
-, type =	"Technical {Report}"
-, number =	"83-577"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	oct
-, year =	1982
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "D. G. Kirkpatrick and R. Seidel"
+, title =       "The Ultimate Planar Convex Hull Algorithm"
+, type =        "Technical {Report}"
+, number =      "83-577"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       oct
+, year =        1982
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{kw-wvgbr-89
-, author =	"D. G. Kirkpatrick and S. K. Wismath"
-, title =	"Weighted visibility graphs of bars and related flow problems"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"325--334"
-, succeeds =	"w-cblsg-85"
-, update =	"93.09 milone+mitchell"
+, author =      "D. G. Kirkpatrick and S. K. Wismath"
+, title =       "Weighted visibility graphs of bars and related flow problems"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "325--334"
+, succeeds =    "w-cblsg-85"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{kgv-osa-83
-, author =	"S. Kirkpatrick and C. D. Gelatt and M. P. Vecchi"
-, title =	"Optimization by simulated annealing"
-, journal =	"Science"
-, volume =	220
-, year =	1983
-, pages =	"671--680"
-, update =	"97.11 bibrelex"
+, author =      "S. Kirkpatrick and C. D. Gelatt and M. P. Vecchi"
+, title =       "Optimization by simulated annealing"
+, journal =     "Science"
+, volume =      220
+, year =        1983
+, pages =       "671--680"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{k-elppp-89
-, author =	"L. M. Kirousis"
-, title =	"Effectively Labeling Planar Projections of Polyhedra"
-, type =	"Technical {Report}"
-, number =	"89.08.88"
-, institution =	"Univ. of Patras"
-, address =	"Greece"
-, year =	1989
-, keywords =	"polyhedron, labeling, $2$-dimensional image of a polyhedron"
-, update =	"93.09 milone+mitchell"
+, author =      "L. M. Kirousis"
+, title =       "Effectively Labeling Planar Projections of Polyhedra"
+, type =        "Technical {Report}"
+, number =      "89.08.88"
+, institution = "Univ. of Patras"
+, address =     "Greece"
+, year =        1989
+, keywords =    "polyhedron, labeling, $2$-dimensional image of a polyhedron"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{kp-crps-85
-, author =	"L. M. Kirousis and C. H. Papadimitriou"
-, title =	"The complexity of recognizing polyhedral scenes"
-, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"175--185"
-, precedes =	"kp-crps-88"
+, author =      "L. M. Kirousis and C. H. Papadimitriou"
+, title =       "The complexity of recognizing polyhedral scenes"
+, booktitle =   "Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "175--185"
+, precedes =    "kp-crps-88"
 }
 
 @article{kp-crps-88
-, author =	"L. M. Kirousis and C. H. Papadimitriou"
-, title =	"The complexity of recognizing polyhedral scenes"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	37
-, year =	1988
-, pages =	"14--38"
-, succeeds =	"kp-crps-85"
+, author =      "L. M. Kirousis and C. H. Papadimitriou"
+, title =       "The complexity of recognizing polyhedral scenes"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      37
+, year =        1988
+, pages =       "14--38"
+, succeeds =    "kp-crps-85"
 }
 
 @article{keb-pht-91
-, author =	"N. Kiryai and Y. Eldar and A. M. Bruckstein"
-, title =	"A probabilistic {Hough} transform"
-, journal =	"Pattern Recogn."
-, volume =	24
-, number =	4
-, year =	1991
-, pages =	"303--316"
-, update =	"98.07 bibrelex"
+, author =      "N. Kiryai and Y. Eldar and A. M. Bruckstein"
+, title =       "A probabilistic {Hough} transform"
+, journal =     "Pattern Recogn."
+, volume =      24
+, number =      4
+, year =        1991
+, pages =       "303--316"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{kb-wsp-90
-, author =	"N. Kiryati and A. M. Bruckstein"
-, title =	"What's in a set of points"
-, number =	605
-, institution =	"Israel Inst. of Tech."
-, address =	"Haifa, Israel"
-, month =	jan
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "N. Kiryati and A. M. Bruckstein"
+, title =       "What's in a set of points"
+, number =      605
+, institution = "Israel Inst. of Tech."
+, address =     "Haifa, Israel"
+, month =       jan
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @book{k-ss-65
-, author =	"L. Kish"
-, title =	"Survey Sampling"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1965
-, update =	"99.11 bibrelex, 98.07 bibrelex"
+, author =      "L. Kish"
+, title =       "Survey Sampling"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1965
+, update =      "99.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{khw-3dcmu-91
-, author =	"E. Kishon and T. Hastie and H. Wolfson"
-, title =	"$3$-d curve matching using splines"
-, journal =	"J. Robot. Syst."
-, volume =	8
-, year =	1991
-, pages =	"723--743"
-, update =	"98.03 bibrelex"
+, author =      "E. Kishon and T. Hastie and H. Wolfson"
+, title =       "$3$-d curve matching using splines"
+, journal =     "J. Robot. Syst."
+, volume =      8
+, year =        1991
+, pages =       "723--743"
+, update =      "98.03 bibrelex"
 }
 
 @article{kr-glcd-82
-, author =	"L. Kitchen and A. Rosenfeld"
-, title =	"Gray level corner detection"
-, journal =	"Pattern Rec. Lett."
-, volume =	1
-, year =	1982
-, pages =	"95--102"
-, update =	"98.11 bibrelex"
+, author =      "L. Kitchen and A. Rosenfeld"
+, title =       "Gray level corner detection"
+, journal =     "Pattern Rec. Lett."
+, volume =      1
+, year =        1982
+, pages =       "95--102"
+, update =      "98.11 bibrelex"
 }
 
 @article{kt-srehl-96
-, author =	"N. Kitsios and A. Tsakalidis"
-, title =	"Space reduction and an extension for a hidden line elimination algorithm"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"397--404"
-, update =	"97.03 devillers"
+, author =      "N. Kitsios and A. Tsakalidis"
+, title =       "Space reduction and an extension for a hidden line elimination algorithm"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "397--404"
+, update =      "97.03 devillers"
 }
 
 @article{kl-pic-80
-, author =	"M. S. Klamkin and A. Liu"
-, title =	"Polyominoes on the Infinite Checkerboard"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	28
-, year =	1980
-, pages =	"7--16"
-, update =	"98.07 bibrelex"
+, author =      "M. S. Klamkin and A. Liu"
+, title =       "Polyominoes on the Infinite Checkerboard"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      28
+, year =        1980
+, pages =       "7--16"
+, update =      "98.07 bibrelex"
 }
 
 @article{k-lbcch-87
-, author =	"A. Klapper"
-, title =	"A lower bound on the complexity of the convex hull problem for simple polyhedra"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"159--161"
+, author =      "A. Klapper"
+, title =       "A lower bound on the complexity of the convex hull problem for simple polyhedra"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "159--161"
 }
 
 @incollection{k-p-97
-, author =	"D. A. Klarner"
-, title =	"Polyominoes"
-, chapter =	12
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"225--242"
-, update =	"97.11 orourke"
+, author =      "D. A. Klarner"
+, title =       "Polyominoes"
+, chapter =     12
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "225--242"
+, update =      "97.11 orourke"
 }
 
 @incollection{k-ipccm-94
-, author =	"R. Victor Klassen"
-, title =	"Intersecting Parametric Cubic Curves by Midpoint Subdivision"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"261--277"
-, keywords =	"Bezier curve, curve intersection, curve subdivision"
-, update =	"94.09 heckbert"
-, annote =	"Provides code to find the intersection points of planar
+, author =      "R. Victor Klassen"
+, title =       "Intersecting Parametric Cubic Curves by Midpoint Subdivision"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "261--277"
+, keywords =    "Bezier curve, curve intersection, curve subdivision"
+, update =      "94.09 heckbert"
+, annote =      "Provides code to find the intersection points of planar
 cubic curves. Contains C++ code."
 }
 
 @techreport{km-ocogd-98
-, author =	"Gunnar W. Klau and Petra Mutzel"
-, title =	"Optimal Compaction of Orthogonal Grid Drawings"
-, type =	"Technical {Report}"
-, number =	"MPI-I-98-1-031"
-, institution =	"Max Planck Institut f{\"u}r Informatik"
-, address =	"Saarbr{\"u}cken, Germany"
-, month =	dec
-, year =	1998
-, url =	"http://data.mpi-sb.mpg.de/internet/reports.nsf/NumberView/1998-1-031"
-, update =	"99.07 vismara, 99.03 patrignani+vismara"
+, author =      "Gunnar W. Klau and Petra Mutzel"
+, title =       "Optimal Compaction of Orthogonal Grid Drawings"
+, type =        "Technical {Report}"
+, number =      "MPI-I-98-1-031"
+, institution = "Max Planck Institut f{\"u}r Informatik"
+, address =     "Saarbr{\"u}cken, Germany"
+, month =       dec
+, year =        1998
+, url = "http://data.mpi-sb.mpg.de/internet/reports.nsf/NumberView/1998-1-031"
+, update =      "99.07 vismara, 99.03 patrignani+vismara"
 }
 
 @inproceedings{km-ocogd-99
-, author =	"G. W. Klau and P. Mutzel"
-, title =	"Optimal Compaction of Orthogonal Grid Drawings"
-, editor =	"G. Cornuejols and R. E. Burkard and G. J. Woeginger"
-, booktitle =	"Integer Programming and Combinatorial Optimization"
-, nickname =	"IPCO '99"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1610
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"304--319"
-, update =	"00.03 vismara"
+, author =      "G. W. Klau and P. Mutzel"
+, title =       "Optimal Compaction of Orthogonal Grid Drawings"
+, editor =      "G. Cornuejols and R. E. Burkard and G. J. Woeginger"
+, booktitle =   "Integer Programming and Combinatorial Optimization"
+, nickname =    "IPCO '99"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1610
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "304--319"
+, update =      "00.03 vismara"
 }
 
 @techreport{km-qodpg-98
-, author =	"Gunnar W. Klau and Petra Mutzel"
-, title =	"Quasi-Orthogonal Drawing of Planar Graphs"
-, type =	"Technical {Report}"
-, number =	"MPI-I-98-1-013"
-, institution =	"Max Planck Institut f{\"u}r Informatik"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1998
-, update =	"99.03 patrignani"
+, author =      "Gunnar W. Klau and Petra Mutzel"
+, title =       "Quasi-Orthogonal Drawing of Planar Graphs"
+, type =        "Technical {Report}"
+, number =      "MPI-I-98-1-013"
+, institution = "Max Planck Institut f{\"u}r Informatik"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1998
+, update =      "99.03 patrignani"
 }
 
 @techreport{k-sltac-89
-, author =	"M. Klawe"
-, title =	"A simple linear time algorithm for concave one-dimensional dynamic programming"
-, type =	"Technical {Report}"
-, number =	"89-16"
-, institution =	"Univ. Britisch Columbia"
-, address =	"Vancouver, BC"
-, year =	1989
-, update =	"98.03 bibrelex"
+, author =      "M. Klawe"
+, title =       "A simple linear time algorithm for concave one-dimensional dynamic programming"
+, type =        "Technical {Report}"
+, number =      "89-16"
+, institution = "Univ. Britisch Columbia"
+, address =     "Vancouver, BC"
+, year =        1989
+, update =      "98.03 bibrelex"
 }
 
 @techreport{kk-altag-88
-, author =	"M. Klawe and D. Kleitman"
-, title =	"An almost linear time algorithm for generalized matrix"
-, type =	"Technical {Report}"
-, number =	"RJ6275"
-, institution =	"IBM Almaden Research Center"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "M. Klawe and D. Kleitman"
+, title =       "An almost linear time algorithm for generalized matrix"
+, type =        "Technical {Report}"
+, number =      "RJ6275"
+, institution = "IBM Almaden Research Center"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @unpublished{kpp-nrvu-82
-, author =	"M. Klawe and M. Paterson and N. Pippenger"
-, title =	"Inversions with $n2^{1+\Omega(1+\sqrt{\log n})}$ transpositions at the median"
-, year =	1982
-, note =	"unpublished manuscript"
-, update =	"98.03 agarwal"
+, author =      "M. Klawe and M. Paterson and N. Pippenger"
+, title =       "Inversions with $n2^{1+\Omega(1+\sqrt{\log n})}$ transpositions at the median"
+, year =        1982
+, note =        "unpublished manuscript"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{k-sbms-90
-, author =	"M. M. Klawe"
-, title =	"Superlinear bounds on matrix searching"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"485--493"
+, author =      "M. M. Klawe"
+, title =       "Superlinear bounds on matrix searching"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "485--493"
 }
 
 @article{kk-altag-90
-, author =	"M. M. Klawe and D. J. Kleitman"
-, title =	"An almost linear time algorithm for generalized matrix searching"
-, journal =	"SIAM J. Discrete Math."
-, volume =	3
-, number =	1
-, year =	1990
-, pages =	"81--97"
-, update =	"98.11 bibrelex"
+, author =      "M. M. Klawe and D. J. Kleitman"
+, title =       "An almost linear time algorithm for generalized matrix searching"
+, journal =     "SIAM J. Discrete Math."
+, volume =      3
+, number =      1
+, year =        1990
+, pages =       "81--97"
+, update =      "98.11 bibrelex"
 }
 
 @article{k-gubet-92
-, author =	"M. Klazar"
-, title =	"A general upper bound in extremal theory of sequences"
-, journal =	"Comment. Math. Univ. Carol."
-, volume =	33
-, year =	1992
-, pages =	"737--746"
-, update =	"95.09 agarwal"
+, author =      "M. Klazar"
+, title =       "A general upper bound in extremal theory of sequences"
+, journal =     "Comment. Math. Univ. Carol."
+, volume =      33
+, year =        1992
+, pages =       "737--746"
+, update =      "95.09 agarwal"
 }
 
 @article{k-lubet-94
-, author =	"M. Klazar"
-, title =	"A linear upper bound in extremal theory of sequences"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	68
-, year =	1994
-, pages =	"454--464"
-, update =	"95.09 agarwal"
+, author =      "M. Klazar"
+, title =       "A linear upper bound in extremal theory of sequences"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      68
+, year =        1994
+, pages =       "454--464"
+, update =      "95.09 agarwal"
 }
 
 @phdthesis{k-cadss-95
-, author =	"M. Klazar"
-, title =	"Combinatorial Aspects of Davenport--Schinzel Sequences"
-, type =	"Ph.{D}. Thesis"
-, school =	"Department of Applied Mathematics, Charles University"
-, address =	"Prague, Czech Republic"
-, year =	1995
-, keywords =	"doctoral thesis"
-, update =	"95.09 agarwal"
+, author =      "M. Klazar"
+, title =       "Combinatorial Aspects of Davenport--Schinzel Sequences"
+, type =        "Ph.{D}. Thesis"
+, school =      "Department of Applied Mathematics, Charles University"
+, address =     "Prague, Czech Republic"
+, year =        1995
+, keywords =    "doctoral thesis"
+, update =      "95.09 agarwal"
 }
 
 @article{k-trpo-93
-, author =	"M. Klazar"
-, title =	"Two results on a partial ordering of finite sequences"
-, journal =	"Comment. Math. Univ. Carol."
-, volume =	34
-, year =	1993
-, pages =	"667--675"
-, update =	"95.09 agarwal"
+, author =      "M. Klazar"
+, title =       "Two results on a partial ordering of finite sequences"
+, journal =     "Comment. Math. Univ. Carol."
+, volume =      34
+, year =        1993
+, pages =       "667--675"
+, update =      "95.09 agarwal"
 }
 
 @article{kv-gdss-94
-, author =	"M. Klazar and P. Valtr"
-, title =	"Generalized {Davenport--Schinzel} sequences"
-, journal =	"Combinatorica"
-, volume =	14
-, year =	1994
-, pages =	"463--476"
-, update =	"95.09 agarwal"
+, author =      "M. Klazar and P. Valtr"
+, title =       "Generalized {Davenport--Schinzel} sequences"
+, journal =     "Combinatorica"
+, volume =      14
+, year =        1994
+, pages =       "463--476"
+, update =      "95.09 agarwal"
 }
 
 @article{km-femgb-94
-, author =	"G. Klebe and T. Mietzener"
-, title =	"A fast and efficient method to generate biologically relevant conformations"
-, journal =	"J. Computer Aided Molecular Design"
-, volume =	8
-, year =	1994
-, pages =	"583--606"
-, update =	"98.07 bibrelex"
+, author =      "G. Klebe and T. Mietzener"
+, title =       "A fast and efficient method to generate biologically relevant conformations"
+, journal =     "J. Computer Aided Molecular Design"
+, volume =      8
+, year =        1994
+, pages =       "583--606"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{k-ltatf-80
-, author =	"V. Klee"
-, title =	"A linear-time algorithm that finds all local minima among triangles containing a given convex polygon"
-, booktitle =	"Proc. 5th Sympos. Operations Res."
-, site =	"K{\"o}ln, West Germany"
-, year =	1980
-, pages =	"??"
+, author =      "V. Klee"
+, title =       "A linear-time algorithm that finds all local minima among triangles containing a given convex polygon"
+, booktitle =   "Proc. 5th Sympos. Operations Res."
+, site =        "K{\"o}ln, West Germany"
+, year =        1980
+, pages =       "??"
 }
 
 @article{k-cmbbc-77
-, author =	"V. Klee"
-, title =	"Can the measure of $\bigcup_{1}^{n}[{a_{i}},b_{i}]$ be computed in less than {$O(n \log n)$} steps?"
-, journal =	"Amer. Math. Monthly"
-, volume =	84
-, year =	1977
-, pages =	"284--285"
-, precedes =	"oy-nubkm-88"
+, author =      "V. Klee"
+, title =       "Can the measure of $\bigcup_{1}^{n}[{a_{i}},b_{i}]$ be computed in less than {$O(n \log n)$} steps?"
+, journal =     "Amer. Math. Monthly"
+, volume =      84
+, year =        1977
+, pages =       "284--285"
+, precedes =    "oy-nubkm-88"
 }
 
 @inproceedings{k-cplp-66
-, author =	"V. Klee"
-, title =	"Convex polytopes and linear programming"
-, booktitle =	"Proc. IBM Sci. Comput. Symp.: Combinatorial Problems"
-, publisher =	"IBM"
-, year =	1966
-, pages =	"123--158"
-, update =	"98.11 bibrelex"
+, author =      "V. Klee"
+, title =       "Convex polytopes and linear programming"
+, booktitle =   "Proc. IBM Sci. Comput. Symp.: Combinatorial Problems"
+, publisher =   "IBM"
+, year =        1966
+, pages =       "123--158"
+, update =      "98.11 bibrelex"
 }
 
 @article{k-fcvm-86
-, author =	"Victor Klee"
-, title =	"Facet-centroids and volume minimization"
-, journal =	"Studia Scientiarum Mathematicarum Hungarica"
-, volume =	21
-, year =	1986
-, pages =	"143--147"
-, note =	"Fejes T{\'o}th Festschrift"
-, update =	"01.04 orourke, 99.07 orourke"
+, author =      "Victor Klee"
+, title =       "Facet-centroids and volume minimization"
+, journal =     "Studia Scientiarum Mathematicarum Hungarica"
+, volume =      21
+, year =        1986
+, pages =       "143--147"
+, note =        "Fejes T{\'o}th Festschrift"
+, update =      "01.04 orourke, 99.07 orourke"
 }
 
 @article{k-iepri-69
-, author =	"Victor Klee"
-, title =	"Is Every Polygonal Region Illuminable from Some Point?"
-, journal =	"Amer. Math. Monthly"
-, volume =	76
-, year =	1969
-, pages =	180
-, update =	"01.04 orourke, 96.01 aronov"
+, author =      "Victor Klee"
+, title =       "Is Every Polygonal Region Illuminable from Some Point?"
+, journal =     "Amer. Math. Monthly"
+, volume =      76
+, year =        1969
+, pages =       180
+, update =      "01.04 orourke, 96.01 aronov"
 }
 
 @article{k-cddvd-80
-, author =	"V. Klee"
-, title =	"On the complexity of $d$-dimensional {Voronoi} diagrams"
-, journal =	"Archiv der Mathematik"
-, volume =	34
-, year =	1980
-, pages =	"75--80"
+, author =      "V. Klee"
+, title =       "On the complexity of $d$-dimensional {Voronoi} diagrams"
+, journal =     "Archiv der Mathematik"
+, volume =      34
+, year =        1980
+, pages =       "75--80"
 }
 
 @article{k-pptrl-74
-, author =	"V. Klee"
-, title =	"Polytope pairs and their relationship to linear programming"
-, journal =	"Acta Math."
-, volume =	133
-, year =	1974
-, pages =	"1--25"
-, update =	"98.03 bibrelex"
+, author =      "V. Klee"
+, title =       "Polytope pairs and their relationship to linear programming"
+, journal =     "Acta Math."
+, volume =      133
+, year =        1974
+, pages =       "1--25"
+, update =      "98.03 bibrelex"
 }
 
 @article{k-cscb-53
-, author =	"V. Klee"
-, title =	"The Critical Set of a Convex Body"
-, journal =	"Amer. J. Math."
-, volume =	75
-, year =	1953
-, pages =	"178--188"
-, update =	"98.07 bibrelex"
+, author =      "V. Klee"
+, title =       "The Critical Set of a Convex Body"
+, journal =     "Amer. J. Math."
+, volume =      75
+, year =        1953
+, pages =       "178--188"
+, update =      "98.07 bibrelex"
 }
 
 @book{k-vmafs-72
-, author =	"V. Klee"
-, title =	"Viewers Manual to accompany the film shapes of the futur e - some unsolved problems in geometry, Part II: Three Dimensions"
-, publisher =	"Modern Learning Aids"
-, year =	1972
-, update =	"97.11 bibrelex"
+, author =      "V. Klee"
+, title =       "Viewers Manual to accompany the film shapes of the futur e - some unsolved problems in geometry, Part II: Three Dimensions"
+, publisher =   "Modern Learning Aids"
+, year =        1972
+, update =      "97.11 bibrelex"
 }
 
 @article{kk-ggspc-90
-, author =	"V. Klee and P. Kleinschmidt"
-, title =	"Geometry of the {Gass}-{Saaty} parametric cost {LP} algorithm"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"13--26"
+, author =      "V. Klee and P. Kleinschmidt"
+, title =       "Geometry of the {Gass}-{Saaty} parametric cost {LP} algorithm"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "13--26"
 }
 
 @article{kk-dscir-87
-, author =	"V. Klee and P. Kleinschmidt"
-, title =	"The $d$-steps conjecture and its relatives"
-, journal =	"Math. Oper. Res."
-, volume =	12
-, year =	1987
-, pages =	"718--755"
-, update =	"93.09 milone+mitchell"
+, author =      "V. Klee and P. Kleinschmidt"
+, title =       "The $d$-steps conjecture and its relatives"
+, journal =     "Math. Oper. Res."
+, volume =      12
+, year =        1987
+, pages =       "718--755"
+, update =      "93.09 milone+mitchell"
 }
 
-% also claimed pages =	"457--464"
+% also claimed pages =  "457--464"
 @article{kl-fstcg-85
-, author =	"V. Klee and M. C. Laskowski"
-, title =	"Finding the smallest triangles containing a given convex polygon"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	"359--375"
+, author =      "V. Klee and M. C. Laskowski"
+, title =       "Finding the smallest triangles containing a given convex polygon"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "359--375"
 }
 
 @article{klh-arsss-97
-, author =	"V. Klee and T. Lewis and B. {von Hohenbalken}"
-, title =	"{Apollonius} Revisited: {Supporting} Spheres for Sundered Systems"
-, journal =	"Discrete Comput. Geom."
-, volume =	18
-, year =	1997
-, pages =	"385--395"
-, cites =	"g-sih-69, ks-dpbst-58, s-scpe-80"
-, update =	"99.11 bibrelex"
+, author =      "V. Klee and T. Lewis and B. {von Hohenbalken}"
+, title =       "{Apollonius} Revisited: {Supporting} Spheres for Sundered Systems"
+, journal =     "Discrete Comput. Geom."
+, volume =      18
+, year =        1997
+, pages =       "385--395"
+, cites =       "g-sih-69, ks-dpbst-58, s-scpe-80"
+, update =      "99.11 bibrelex"
 }
 
 @incollection{km-hgisa-72
-, author =	"V. Klee and G. J. Minty"
-, title =	"How good is the simplex algorithm?"
-, editor =	"O. Shisha"
-, booktitle =	"Inequalities III"
-, publisher =	"Academic Press"
-, year =	1972
-, pages =	"159--175"
-, update =	"93.09 milone+mitchell"
+, author =      "V. Klee and G. J. Minty"
+, title =       "How good is the simplex algorithm?"
+, editor =      "O. Shisha"
+, booktitle =   "Inequalities III"
+, publisher =   "Academic Press"
+, year =        1972
+, pages =       "159--175"
+, update =      "93.09 milone+mitchell"
 }
 
 @book{kw-onupp-91
-, author =	"Victor Klee and Stan Wagon"
-, title =	"Old and New Unsolved Problems in Plane Geometry"
-, publisher =	"Mathematical Association of America"
-, year =	1991
-, update =	"01.04 orourke, 98.03 bibrelex"
+, author =      "Victor Klee and Stan Wagon"
+, title =       "Old and New Unsolved Problems in Plane Geometry"
+, publisher =   "Mathematical Association of America"
+, year =        1991
+, update =      "01.04 orourke, 98.03 bibrelex"
 }
 
 @article{kw-dscpd-??
-, author =	"V. Klee and D. Walkup"
-, title =	"The $d$-step conjecture for polyhedra of dimension $d<6$"
-, journal =	"Acta Math."
-, volume =	133
-, year =	"??"
-, pages =	"53--78"
-, update =	"93.09 milone+mitchell"
+, author =      "V. Klee and D. Walkup"
+, title =       "The $d$-step conjecture for polyhedra of dimension $d<6$"
+, journal =     "Acta Math."
+, volume =      133
+, year =        "??"
+, pages =       "53--78"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{kl-sc-72
-, author =	"S. Kleiman and D. Laksov"
-, title =	"Schubert calculus"
-, journal =	"Amer. Math. Monthly"
-, volume =	79
-, year =	1972
-, pages =	"1061--1082"
-, update =	"98.03 bibrelex"
+, author =      "S. Kleiman and D. Laksov"
+, title =       "Schubert calculus"
+, journal =     "Amer. Math. Monthly"
+, volume =      79
+, year =        1972
+, pages =       "1061--1082"
+, update =      "98.03 bibrelex"
 }
 
 @book{k-emasg-39
-, author =	"F. Klein"
-, title =	"Elementary Mathematics from an Advanced Standpoint: Geometry"
-, publisher =	"Macmillan"
-, address =	"New York, NY"
-, year =	1939
-, update =	"97.11 bibrelex"
+, author =      "F. Klein"
+, title =       "Elementary Mathematics from an Advanced Standpoint: Geometry"
+, publisher =   "Macmillan"
+, address =     "New York, NY"
+, year =        1939
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{kt-rltaf-94
-, author =	"Philip Klein and Robert E. Tarjan"
-, title =	"A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	""
-, update =	"94.01 jones"
+, author =      "Philip Klein and Robert E. Tarjan"
+, title =       "A Randomized Linear-Time Algorithm for Finding Minimum Spanning Trees"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       ""
+, update =      "94.01 jones"
 }
 
 @article{kr-epap-88
-, author =	"P. N. Klein and J. H. Reif"
-, title =	"An Efficient Parallel Algorithm for Planarity"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	37
-, number =	2
-, year =	1988
-, pages =	"190--246"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. N. Klein and J. H. Reif"
+, title =       "An Efficient Parallel Algorithm for Planarity"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      37
+, number =      2
+, year =        1988
+, pages =       "190--246"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{ks-prass-92
-, author =	"P. N. Klein and S. Sairam"
-, title =	"A parallel randomized approximation scheme for shortest paths"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"750--758"
+, author =      "P. N. Klein and S. Sairam"
+, title =       "A parallel randomized approximation scheme for shortest paths"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "750--758"
 }
 
 @inproceedings{ks-fdasa-93
-, author =	"P. N. Klein and S. Subramanian"
-, title =	"A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs"
-, booktitle =	"Proc. 1993 Workshop Algorithms Data Struct."
-, year =	1993
-, pages =	"442--451"
-, update =	"94.01 tamassia"
+, author =      "P. N. Klein and S. Subramanian"
+, title =       "A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs"
+, booktitle =   "Proc. 1993 Workshop Algorithms Data Struct."
+, year =        1993
+, pages =       "442--451"
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{k-avdta-88
-, author =	"Rolf Klein"
-, title =	"Abstract {Voronoi} Diagrams and Their Applications"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"148--157"
-, comments =	"extended abstract"
-, succeeds =	"k-vdmm-87"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 99.07 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "Rolf Klein"
+, title =       "Abstract {Voronoi} Diagrams and Their Applications"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "148--157"
+, comments =    "extended abstract"
+, succeeds =    "k-vdmm-87"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 99.07 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @book{k-ag-97
-, author =	"Rolf Klein"
-, title =	"Algorithmische Geometrie"
-, publisher =	"Addison-Wesley"
-, address =	"Bonn"
-, year =	1997
-, url =	"http://www.oldenbourg.de/cgi-bin/rotitel?T=24382"
-, keywords =	"textbook, in German"
-, update =	"01.04 icking, 99.07 bibrelex, 97.03 icking+smid"
+, author =      "Rolf Klein"
+, title =       "Algorithmische Geometrie"
+, publisher =   "Addison-Wesley"
+, address =     "Bonn"
+, year =        1997
+, url = "http://www.oldenbourg.de/cgi-bin/rotitel?T=24382"
+, keywords =    "textbook, in German"
+, update =      "01.04 icking, 99.07 bibrelex, 97.03 icking+smid"
 }
 
 @inproceedings{k-cpavd-89
-, author =	"Rolf Klein"
-, title =	"Combinatorial Properties of Abstract {Voronoi} Diagrams"
-, editor =	"M. Nagl"
-, booktitle =	"Proc. Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	411
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"356--369"
-, update =	"97.03 icking"
+, author =      "Rolf Klein"
+, title =       "Combinatorial Properties of Abstract {Voronoi} Diagrams"
+, editor =      "M. Nagl"
+, booktitle =   "Proc. Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      411
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "356--369"
+, update =      "97.03 icking"
 }
 
 @book{k-cavd-89
-, author =	"Rolf Klein"
-, title =	"Concrete and Abstract {Voronoi} Diagrams"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	400
-, publisher =	"Springer-Verlag"
-, year =	1989
-, isbn =	"3-540-52055-4"
-, keywords =	"book"
-, update =	"99.07 bibrelex, 93.09 held"
+, author =      "Rolf Klein"
+, title =       "Concrete and Abstract {Voronoi} Diagrams"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      400
+, publisher =   "Springer-Verlag"
+, year =        1989
+, isbn =        "3-540-52055-4"
+, keywords =    "book"
+, update =      "99.07 bibrelex, 93.09 held"
 }
 
 @incollection{k-dsv-98
-, author =	"Rolf Klein"
-, title =	"Das {Sweep-Verfahren}"
-, editor =	"Thomas Ottmann"
-, booktitle =	"Prinzipien des {Algorithmenentwurfs}"
-, publisher =	"Spektrum Akademischer Verlag"
-, year =	1998
-, pages =	"67--89"
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/sweep.pdf"
-, cites =	"b-oafsi-95, b-pp-85, bo-arcgi-79, ce-oails-92, hns-psscp-88, k-ag-97, m-mdscg-84, ps-vvasq-91, ZZZ"
-, update =	"00.03 bibrelex"
-, annote =	"The book comes with a CD-ROM which contains, for each chapter, a lecture
-		 held by the author of that chapter."
+, author =      "Rolf Klein"
+, title =       "Das {Sweep-Verfahren}"
+, editor =      "Thomas Ottmann"
+, booktitle =   "Prinzipien des {Algorithmenentwurfs}"
+, publisher =   "Spektrum Akademischer Verlag"
+, year =        1998
+, pages =       "67--89"
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/sweep.pdf"
+, cites =       "b-oafsi-95, b-pp-85, bo-arcgi-79, ce-oails-92, hns-psscp-88, k-ag-97, m-mdscg-84, ps-vvasq-91, ZZZ"
+, update =      "00.03 bibrelex"
+, annote =      "The book comes with a CD-ROM which contains, for each chapter, a lecture
+                 held by the author of that chapter."
 }
 
 @techreport{k-ddp-85
-, author =	"Rolf Klein"
-, title =	"Direct Dominance of Points"
-, number =	154
-, institution =	"Institut f{\"u}r {Angewandte} {Informatik} und {Formale} {Beschreibungsverfahren}, Universit{\"a}t Karlsruhe"
-, year =	1985
-, update =	"99.07 bibrelex, 97.11 bibrelex"
+, author =      "Rolf Klein"
+, title =       "Direct Dominance of Points"
+, number =      154
+, institution = "Institut f{\"u}r {Angewandte} {Informatik} und {Formale} {Beschreibungsverfahren}, Universit{\"a}t Karlsruhe"
+, year =        1985
+, update =      "99.07 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{k-mas-91
-, author =	"Rolf Klein"
-, title =	"Moving Along a Street"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"123--140"
-, precedes =	"k-wusbd-91"
-, update =	"00.03 bibrelex, 99.07 bibrelex, 98.11 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Rolf Klein"
+, title =       "Moving Along a Street"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "123--140"
+, precedes =    "k-wusbd-91"
+, update =      "00.03 bibrelex, 99.07 bibrelex, 98.11 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @techreport{k-vdmm-87
-, author =	"Rolf Klein"
-, title =	"Voronoi diagrams in the {Moscow} metric"
-, type =	"Technical {Report}"
-, number =	7
-, institution =	"Inst. Inform., Univ. Freiburg"
-, year =	1987
-, precedes =	"k-vdmm-89"
-, update =	"99.07 bibrelex, 98.11 bibrelex"
+, author =      "Rolf Klein"
+, title =       "Voronoi diagrams in the {Moscow} metric"
+, type =        "Technical {Report}"
+, number =      7
+, institution = "Inst. Inform., Univ. Freiburg"
+, year =        1987
+, precedes =    "k-vdmm-89"
+, update =      "99.07 bibrelex, 98.11 bibrelex"
 }
 
 @inproceedings{k-vdmm-89
-, author =	"Rolf Klein"
-, title =	"{Voronoi} Diagrams in the Moscow Metric"
-, booktitle =	"Proc. Graph-Theoretic Concepts in Computer Science. Proceedings."
-, nickname =	"WG '88"
-, site =	"Amsterdam"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	344
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"434--441"
-, succeeds =	"k-vdmm-87"
-, update =	"98.11 bibrelex"
+, author =      "Rolf Klein"
+, title =       "{Voronoi} Diagrams in the Moscow Metric"
+, booktitle =   "Proc. Graph-Theoretic Concepts in Computer Science. Proceedings."
+, nickname =    "WG '88"
+, site =        "Amsterdam"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      344
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "434--441"
+, succeeds =    "k-vdmm-87"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{k-wusbd-91
-, author =	"Rolf Klein"
-, title =	"Walking an Unknown Street with Bounded Detour"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"304--313"
-, succeeds =	"k-mas-91"
-, precedes =	"k-wusbd-92t"
-, update =	"99.07 bibrelex, 98.11 bibrelex"
+, author =      "Rolf Klein"
+, title =       "Walking an Unknown Street with Bounded Detour"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "304--313"
+, succeeds =    "k-mas-91"
+, precedes =    "k-wusbd-92t"
+, update =      "99.07 bibrelex, 98.11 bibrelex"
 }
 
 @techreport{k-wusbd-92t
-, author =	"Rolf Klein"
-, title =	"Walking an Unknown Street with Bounded Detour"
-, number =	122
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1992
-, succeeds =	"k-wusbd-91"
-, precedes =	"k-wusbd-92"
-, update =	"98.11 bibrelex"
+, author =      "Rolf Klein"
+, title =       "Walking an Unknown Street with Bounded Detour"
+, number =      122
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1992
+, succeeds =    "k-wusbd-91"
+, precedes =    "k-wusbd-92"
+, update =      "98.11 bibrelex"
 }
 
 @article{k-wusbd-92
-, author =	"Rolf Klein"
-, title =	"Walking an Unknown Street with Bounded Detour"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, year =	1992
-, pages =	"325--351"
-, succeeds =	"k-wusbd-92t"
-, update =	"99.07 bibrelex, 98.11 bibrelex"
+, author =      "Rolf Klein"
+, title =       "Walking an Unknown Street with Bounded Detour"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, year =        1992
+, pages =       "325--351"
+, succeeds =    "k-wusbd-92t"
+, update =      "99.07 bibrelex, 98.11 bibrelex"
 }
 
 @techreport{kl-ltrab-93t
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
-, number =	150
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1993
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr150.pdf"
-, succeeds =	"lk-ltrab-91"
-, precedes =	"kl-ltrab-93"
-, update =	"98.11 bibrelex"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
+, number =      150
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1993
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr150.pdf"
+, succeeds =    "lk-ltrab-91"
+, precedes =    "kl-ltrab-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{kl-ltrab-93
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"124--132"
-, succeeds =	"kl-ltrab-93t"
-, precedes =	"kl-ltrab-96"
-, cites =	"agss-ltacv-89, a-vds-88, c-tsplt-90i, c-bvdcp-86, c-cdt-87, dl-cvdrp-91, k-cavd-89, kl-mpsp-92, kl-cgdts-92, ll-gdtpg-86, l-hmdp-87, ll-fagt-90, l-vdbsd-89, ps-cgi-85, s-cdtvd-88, s-sfira-91, ws-oacdt-87, ZZZ"
-, update =	"99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 97.03 devillers, 93.09 jones"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "124--132"
+, succeeds =    "kl-ltrab-93t"
+, precedes =    "kl-ltrab-96"
+, cites =       "agss-ltacv-89, a-vds-88, c-tsplt-90i, c-bvdcp-86, c-cdt-87, dl-cvdrp-91, k-cavd-89, kl-mpsp-92, kl-cgdts-92, ll-gdtpg-86, l-hmdp-87, ll-fagt-90, l-vdbsd-89, ps-cgi-85, s-cdtvd-88, s-sfira-91, ws-oacdt-87, ZZZ"
+, update =      "99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 97.03 devillers, 93.09 jones"
 }
 
 @article{kl-ltrab-96
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"263--278"
-, succeeds =	"kl-ltrab-93"
-, update =	"99.07 bibrelex, 97.03 devillers+icking"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "263--278"
+, succeeds =    "kl-ltrab-93"
+, update =      "99.07 bibrelex, 97.03 devillers+icking"
 }
 
 @inproceedings{kl-ngcav-93
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"A Note on Generalizations of {Chew's} Algorithm for the {Voronoi} Diagram of a Convex Polygon"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"370--374"
-, cites =	"a-vds-88, c-bvdcp-86, d-rysoa-92, dl-cvdrp-91, e-acg-87, gs-pmgsc-85, kl-ltrab-93, k-eccs-79, k-cavd-89, kl-havdl-93, ps-cgi-85, ya-mpce-89, s-barga-91, agss-ltacv-89, ZZZ"
-, update =	"99.07 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "A Note on Generalizations of {Chew's} Algorithm for the {Voronoi} Diagram of a Convex Polygon"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "370--374"
+, cites =       "a-vds-88, c-bvdcp-86, d-rysoa-92, dl-cvdrp-91, e-acg-87, gs-pmgsc-85, kl-ltrab-93, k-eccs-79, k-cavd-89, kl-havdl-93, ps-cgi-85, ya-mpce-89, s-barga-91, agss-ltacv-89, ZZZ"
+, update =      "99.07 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{kl-fsc-95
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"Fast Skeleton Construction"
-, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	979
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"582--595"
-, update =	"00.03 bibrelex, 99.07 bibrelex, 97.03 icking"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "Fast Skeleton Construction"
+, booktitle =   "Proc. 3rd Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      979
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "582--595"
+, update =      "00.03 bibrelex, 99.07 bibrelex, 97.03 icking"
 }
 
 @techreport{kl-havdl-93
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"Hamiltonian Abstract {Voronoi} Diagrams in Linear Time"
-, type =	"manuscript"
-, year =	1993
-, precedes =	"kl-havdl-94c"
-, update =	"00.11 smid, 00.07 icking, 99.07 bibrelex, 98.11 bibrelex"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "Hamiltonian Abstract {Voronoi} Diagrams in Linear Time"
+, type =        "manuscript"
+, year =        1993
+, precedes =    "kl-havdl-94c"
+, update =      "00.11 smid, 00.07 icking, 99.07 bibrelex, 98.11 bibrelex"
 }
 
 @inproceedings{kl-havdl-94
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"Hamiltonian Abstract {Voronoi} Diagrams in Linear Time"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"11--19"
-, succeeds =	"kl-havdl-94c"
-, update =	"00.11 smid, 00.07 icking, 99.11 bibrelex, 99.07 bibrelex, 98.11 bibrelex, 98.07 icking, 98.03 smid, 96.05 mitchell"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "Hamiltonian Abstract {Voronoi} Diagrams in Linear Time"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "11--19"
+, succeeds =    "kl-havdl-94c"
+, update =      "00.11 smid, 00.07 icking, 99.11 bibrelex, 99.07 bibrelex, 98.11 bibrelex, 98.07 icking, 98.03 smid, 96.05 mitchell"
 }
 
 @inproceedings{kl-havdl-94c
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"Hamiltonian Abstract {Voronoi} Diagrams in Linear Time"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"1--4"
-, succeeds =	"kl-havdl-93"
-, precedes =	"kl-havdl-94"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "Hamiltonian Abstract {Voronoi} Diagrams in Linear Time"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "1--4"
+, succeeds =    "kl-havdl-93"
+, precedes =    "kl-havdl-94"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @techreport{kl-mpsp-92t
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"Manhattonian Proximity in a Simple Polygon"
-, number =	124
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1992
-, precedes =	"kl-mpsp-92"
-, update =	"98.11 bibrelex"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "Manhattonian Proximity in a Simple Polygon"
+, number =      124
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1992
+, precedes =    "kl-mpsp-92"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{kl-mpsp-92
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"Manhattonian Proximity in a Simple Polygon"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"312--319"
-, succeeds =	"kl-mpsp-92t"
-, precedes =	"kl-mpsp-95"
-, cites =	"agss-ltacv-89, a-gvdps-87, a-vds-88, c-tsplt-90i, c-cdt-87, cf-shvd-91, dk-bsbav-91, dl-cvdrp-91, egs-oplms-86, f-savd-87, k-cavd-89, kmm-cavd2-90, l-hmdp-87, ll-fagt-90, l-vdbsd-89, lk-ltrab-91, ps-cgi-85, s-cdtvd-88, s-mplbc-85, sh-cpp-75, ws-oacdt-87, ZZZ"
-, update =	"99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 97.11 bibrelex, 96.09 devillers"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "Manhattonian Proximity in a Simple Polygon"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "312--319"
+, succeeds =    "kl-mpsp-92t"
+, precedes =    "kl-mpsp-95"
+, cites =       "agss-ltacv-89, a-gvdps-87, a-vds-88, c-tsplt-90i, c-cdt-87, cf-shvd-91, dk-bsbav-91, dl-cvdrp-91, egs-oplms-86, f-savd-87, k-cavd-89, kmm-cavd2-90, l-hmdp-87, ll-fagt-90, l-vdbsd-89, lk-ltrab-91, ps-cgi-85, s-cdtvd-88, s-mplbc-85, sh-cpp-75, ws-oacdt-87, ZZZ"
+, update =      "99.07 bibrelex, 98.11 bibrelex, 98.03 bibrelex, 97.11 bibrelex, 96.09 devillers"
 }
 
 @article{kl-mpsp-95
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"Manhattonian proximity in a simple polygon"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"53--74"
-, keywords =	"Voronoi diagram, simple polygon, computational geometry"
-, succeeds =	"kl-mpsp-92"
-, update =	"99.07 bibrelex, 96.09 devillers"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "Manhattonian proximity in a simple polygon"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "53--74"
+, keywords =    "Voronoi diagram, simple polygon, computational geometry"
+, succeeds =    "kl-mpsp-92"
+, update =      "99.07 bibrelex, 96.09 devillers"
 }
 
 @techreport{kl-cgdts-92
-, author =	"Rolf Klein and Andrzej Lingas"
-, title =	"On Computing the Generalized {Delaunay} Triangulation of a Simple Polygon"
-, type =	"Manuscript"
-, institution =	"Lund University"
-, address =	"Lund, Sweden"
-, year =	1992
-, update =	"99.07 bibrelex, 98.03 bibrelex"
+, author =      "Rolf Klein and Andrzej Lingas"
+, title =       "On Computing the Generalized {Delaunay} Triangulation of a Simple Polygon"
+, type =        "Manuscript"
+, institution = "Lund University"
+, address =     "Lund, Sweden"
+, year =        1992
+, update =      "99.07 bibrelex, 98.03 bibrelex"
 }
 
 @techreport{km-weacs-92
-, author =	"Rolf Klein and Lihong Ma"
-, title =	"Wrapping Ellipses Around a Convex Skeleton"
-, number =	132
-, institution =	"Fachbereich Informatik, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1992
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr132.pdf"
-, precedes =	"km-weacs-95"
-, update =	"98.07 icking, 98.03 bibrelex"
+, author =      "Rolf Klein and Lihong Ma"
+, title =       "Wrapping Ellipses Around a Convex Skeleton"
+, number =      132
+, institution = "Fachbereich Informatik, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1992
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr132.pdf"
+, precedes =    "km-weacs-95"
+, update =      "98.07 icking, 98.03 bibrelex"
 }
 
 @article{km-weacs-95
-, author =	"Rolf Klein and Lihong Ma"
-, title =	"Wrapping Ellipses Around a Convex Skeleton"
-, journal =	"Internat. J. Comput. Math."
-, volume =	55
-, year =	1995
-, pages =	"173--181"
-, succeeds =	"km-weacs-92"
-, update =	"98.07 icking, 97.03 icking"
+, author =      "Rolf Klein and Lihong Ma"
+, title =       "Wrapping Ellipses Around a Convex Skeleton"
+, journal =     "Internat. J. Comput. Math."
+, volume =      55
+, year =        1995
+, pages =       "173--181"
+, succeeds =    "km-weacs-92"
+, update =      "98.07 icking, 97.03 icking"
 }
 
 @incollection{kmm-cavd-92
-, author =	"Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
-, title =	"On the Construction of Abstract {Voronoi} Diagrams"
-, editor =	"J. Buchmann and H. Ganzinger and W. J. Paul"
-, booktitle =	"{Festschrift} zum 60. {Geburtstag} von {G{\"u}nter} {Hotz}"
-, series =	"Teubner-Texte zur Informatik"
-, publisher =	"B. G. Teubner"
-, year =	1992
-, pages =	"283--308"
-, update =	"97.03 icking"
+, author =      "Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
+, title =       "On the Construction of Abstract {Voronoi} Diagrams"
+, editor =      "J. Buchmann and H. Ganzinger and W. J. Paul"
+, booktitle =   "{Festschrift} zum 60. {Geburtstag} von {G{\"u}nter} {Hotz}"
+, series =      "Teubner-Texte zur Informatik"
+, publisher =   "B. G. Teubner"
+, year =        1992
+, pages =       "283--308"
+, update =      "97.03 icking"
 }
 
 @inproceedings{kmm-cavd2-90
-, author =	"Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
-, title =	"On the Construction of Abstract {Voronoi} Diagrams {II}"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"138--154"
-, precedes =	"kmm-ricav-93"
-, update =	"99.07 bibrelex, 93.05 smid"
+, author =      "Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
+, title =       "On the Construction of Abstract {Voronoi} Diagrams {II}"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "138--154"
+, precedes =    "kmm-ricav-93"
+, update =      "99.07 bibrelex, 93.05 smid"
 }
 
 @techreport{kmm-ricav-93
-, author =	"Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
-, title =	"Randomized Incremental Construction of Abstract {Voronoi} Diagrams"
-, number =	"MPI-I-93-105"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, succeeds =	"kmm-cavd2-90"
-, precedes =	"kmm-ricav-93a"
-, update =	"99.07 bibrelex, 94.05 devillers, 93.05 smid"
+, author =      "Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
+, title =       "Randomized Incremental Construction of Abstract {Voronoi} Diagrams"
+, number =      "MPI-I-93-105"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, succeeds =    "kmm-cavd2-90"
+, precedes =    "kmm-ricav-93a"
+, update =      "99.07 bibrelex, 94.05 devillers, 93.05 smid"
 }
 
 @article{kmm-ricav-93a
-, author =	"Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
-, title =	"Randomized Incremental Construction of Abstract {Voronoi} Diagrams"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, number =	3
-, year =	1993
-, pages =	"157--184"
-, succeeds =	"kmm-ricav-93"
-, update =	"99.07 bibrelex, 97.11 bibrelex, 94.05 devillers"
+, author =      "Rolf Klein and Kurt Mehlhorn and Stefan Meiser"
+, title =       "Randomized Incremental Construction of Abstract {Voronoi} Diagrams"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, number =      3
+, year =        1993
+, pages =       "157--184"
+, succeeds =    "kmm-ricav-93"
+, update =      "99.07 bibrelex, 97.11 bibrelex, 94.05 devillers"
 }
 
 @techreport{know-dfwp-87
-, author =	"Rolf Klein and Otto Nurmi and Thomas Ottmann and Derick Wood"
-, title =	"A Dynamic Fixed Windowing Problem"
-, type =	"Report"
-, number =	"CS-87-56"
-, institution =	"Data Struct. Group, Dept. Comput. Sci., Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	1987
-, precedes =	"know-odsfw-86"
-, update =	"99.07 bibrelex"
+, author =      "Rolf Klein and Otto Nurmi and Thomas Ottmann and Derick Wood"
+, title =       "A Dynamic Fixed Windowing Problem"
+, type =        "Report"
+, number =      "CS-87-56"
+, institution = "Data Struct. Group, Dept. Comput. Sci., Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        1987
+, precedes =    "know-odsfw-86"
+, update =      "99.07 bibrelex"
 }
 
 @article{know-dfwp-89
-, author =	"Rolf Klein and Otto Nurmi and Thomas Ottmann and Derick Wood"
-, title =	"A Dynamic Fixed Windowing Problem"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"535--550"
-, keywords =	"points, range searching, polygons, two-dimensional, dynamizing data structures, priority search trees"
-, succeeds =	"know-odsfw-86"
-, update =	"99.07 bibrelex"
+, author =      "Rolf Klein and Otto Nurmi and Thomas Ottmann and Derick Wood"
+, title =       "A Dynamic Fixed Windowing Problem"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "535--550"
+, keywords =    "points, range searching, polygons, two-dimensional, dynamizing data structures, priority search trees"
+, succeeds =    "know-odsfw-86"
+, update =      "99.07 bibrelex"
 }
 
 @inproceedings{know-odsfw-86
-, author =	"Rolf Klein and Otto Nurmi and Thomas Ottmann and Derick Wood"
-, title =	"Optimal Dynamic Solutions for Fixed Windowing Problems"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"109--115"
-, succeeds =	"know-dfwp-87"
-, precedes =	"know-dfwp-89"
-, cites =	"asss-moacp-85, b-sbbtd-72, bs-dsp1s-80, ce-oscpr-85, g-dcopi-84, m-pst-85, m-pst-85, o-ddds-83, ol-tgmdd-81, t-ubstr-83, lw-ddsp-80, ZZZ"
-, update =	"99.07 bibrelex, 97.11 bibrelex"
+, author =      "Rolf Klein and Otto Nurmi and Thomas Ottmann and Derick Wood"
+, title =       "Optimal Dynamic Solutions for Fixed Windowing Problems"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "109--115"
+, succeeds =    "know-dfwp-87"
+, precedes =    "know-dfwp-89"
+, cites =       "asss-moacp-85, b-sbbtd-72, bs-dsp1s-80, ce-oscpr-85, g-dcopi-84, m-pst-85, m-pst-85, o-ddds-83, ol-tgmdd-81, t-ubstr-83, lw-ddsp-80, ZZZ"
+, update =      "99.07 bibrelex, 97.11 bibrelex"
 }
 
 @book{kst-cg-97
-, title =	"Computational Geometry"
-, editor =	"Rolf Klein and Raimond Seidel and Seth Teller"
-, series =	"Dagstuhl-Seminar-Report"
-, volume =	168
-, publisher =	"Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
-, address =	"Schloss Dagstuhl, Germany"
-, year =	1997
-, url =	"ftp://ftp.dagstuhl.de/pub/Reports/97/9707.ps.gz"
-, update =	"01.04 icking"
+, title =       "Computational Geometry"
+, editor =      "Rolf Klein and Raimond Seidel and Seth Teller"
+, series =      "Dagstuhl-Seminar-Report"
+, volume =      168
+, publisher =   "Internat. Begegnungs- und Forschungszentrum f{\"u}r Informatik"
+, address =     "Schloss Dagstuhl, Germany"
+, year =        1997
+, url = "ftp://ftp.dagstuhl.de/pub/Reports/97/9707.ps.gz"
+, update =      "01.04 icking"
 }
 
 @article{kw-tubla-90
-, author =	"Rolf Klein and Derick Wood"
-, title =	"A Tight Upper Bound for the Length of {AVL} Trees"
-, journal =	"Theoret. Comput. Sci."
-, volume =	72
-, year =	1990
-, pages =	"251--264"
-, update =	"98.11 bibrelex"
+, author =      "Rolf Klein and Derick Wood"
+, title =       "A Tight Upper Bound for the Length of {AVL} Trees"
+, journal =     "Theoret. Comput. Sci."
+, volume =      72
+, year =        1990
+, pages =       "251--264"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{kw-bt-89
-, author =	"Rolf Klein and Derick Wood"
-, title =	"On Binary Trees"
-, booktitle =	"Information Processing 89, 11th World Computer Congress"
-, nickname =	"IFIP '89"
-, site =	"San Francisco"
-, year =	1989
-, pages =	"449--454"
-, update =	"98.11 bibrelex"
+, author =      "Rolf Klein and Derick Wood"
+, title =       "On Binary Trees"
+, booktitle =   "Information Processing 89, 11th World Computer Congress"
+, nickname =    "IFIP '89"
+, site =        "San Francisco"
+, year =        1989
+, pages =       "449--454"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{kw-mplat-88
-, author =	"Rolf Klein and Derick Wood"
-, title =	"On the Maximum Path Length of {AVL}-Trees"
-, booktitle =	"Proc. 13th Colloquium on Trees in Algebra and Programming"
-, nickname =	"CAAP '88"
-, site =	"Nancy"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	299
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"16--27"
-, update =	"98.11 bibrelex"
+, author =      "Rolf Klein and Derick Wood"
+, title =       "On the Maximum Path Length of {AVL}-Trees"
+, booktitle =   "Proc. 13th Colloquium on Trees in Algebra and Programming"
+, nickname =    "CAAP '88"
+, site =        "Nancy"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      299
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "16--27"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{kw-plbt-89p
-, author =	"Rolf Klein and Derick Wood"
-, title =	"On the Path Length of Binary Trees"
-, booktitle =	"Proc. 3rd International Conference on Foundations of Data Organization and Algorithms"
-, nickname =	"FODO '89"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	367
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"128--136"
-, precedes =	"kw-plbt-89"
-, update =	"98.11 bibrelex"
+, author =      "Rolf Klein and Derick Wood"
+, title =       "On the Path Length of Binary Trees"
+, booktitle =   "Proc. 3rd International Conference on Foundations of Data Organization and Algorithms"
+, nickname =    "FODO '89"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      367
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "128--136"
+, precedes =    "kw-plbt-89"
+, update =      "98.11 bibrelex"
 }
 
 @article{kw-plbt-89
-, author =	"Rolf Klein and Derick Wood"
-, title =	"On the Path Length of Binary Trees"
-, journal =	"J. ACM"
-, volume =	36
-, number =	2
-, year =	1989
-, pages =	"280--289"
-, succeeds =	"kw-plbt-89p"
-, update =	"98.11 bibrelex"
+, author =      "Rolf Klein and Derick Wood"
+, title =       "On the Path Length of Binary Trees"
+, journal =     "J. ACM"
+, volume =      36
+, number =      2
+, year =        1989
+, pages =       "280--289"
+, succeeds =    "kw-plbt-89p"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{kw-vdbgm-88
-, author =	"Rolf Klein and Derick Wood"
-, title =	"Voronoi Diagrams Based on General Metrics in the Plane"
-, editor =	"R. Cori and M. Wirsing"
-, booktitle =	"Proc. 5th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	294
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"281--291"
-, update =	"97.03 icking"
+, author =      "Rolf Klein and Derick Wood"
+, title =       "Voronoi Diagrams Based on General Metrics in the Plane"
+, editor =      "R. Cori and M. Wirsing"
+, booktitle =   "Proc. 5th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      294
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "281--291"
+, update =      "97.03 icking"
 }
 
 @inproceedings{k-tanns-97
-, author =	"J. Kleinberg"
-, title =	"Two Algorithms for Nearest-Neighbor Search in High Dimension"
-, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '97"
-, year =	1997
-, pages =	"599--608"
-, update =	"98.07 bibrelex, 97.07 agarwal"
+, author =      "J. Kleinberg"
+, title =       "Two Algorithms for Nearest-Neighbor Search in High Dimension"
+, booktitle =   "Proc. 29th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '97"
+, year =        1997
+, pages =       "599--608"
+, update =      "98.07 bibrelex, 97.07 agarwal"
 }
 
 @inproceedings{kpr-sp-98
-, author =	"Jon Kleinberg and Christos Papadimitriou and Prabhakar Raghavan"
-, title =	"Segmentation Problems"
-, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
-, year =	1998
-, pages =	"473--482"
-, update =	"00.11 smid, 00.07 smid, 98.03 mitchell"
+, author =      "Jon Kleinberg and Christos Papadimitriou and Prabhakar Raghavan"
+, title =       "Segmentation Problems"
+, booktitle =   "Proc. 30th Annu. ACM Sympos. Theory Comput."
+, year =        1998
+, pages =       "473--482"
+, update =      "00.11 smid, 00.07 smid, 98.03 mitchell"
 }
 
 @mastersthesis{k-olarn-94
-, author =	"Jon Michael Kleinberg"
-, title =	"On-line algorithms for robot navigation and server problems"
-, school =	"MIT, Dept. of Electr. Engineering and Comp. Science"
-, year =	1994
-, keywords =	"master thesis"
-, update =	"98.07 icking"
+, author =      "Jon Michael Kleinberg"
+, title =       "On-line algorithms for robot navigation and server problems"
+, school =      "MIT, Dept. of Electr. Engineering and Comp. Science"
+, year =        1994
+, keywords =    "master thesis"
+, update =      "98.07 icking"
 }
 
 @inproceedings{k-olssp-94
-, author =	"Jon M. Kleinberg"
-, title =	"On-Line Search in a Simple Polygon"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '94"
-, year =	1994
-, pages =	"8--15"
-, comments =	"Contains, among other things, a 2.83-competitive algorithm for searching in streets
+, author =      "Jon M. Kleinberg"
+, title =       "On-Line Search in a Simple Polygon"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '94"
+, year =        1994
+, pages =       "8--15"
+, comments =    "Contains, among other things, a 2.83-competitive algorithm for searching in streets
 (but not 1.62-competitive as said in the abstract)."
-, update =	"98.03 bibrelex+icking+mitchell"
+, update =      "98.03 bibrelex+icking+mitchell"
 }
 
 @inproceedings{k-lpmr-94
-, author =	"J. M. Kleinberg"
-, title =	"The localization problem for mobile robots"
-, booktitle =	"Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1994
-, pages =	"521--531"
-, update =	"97.11 bibrelex"
+, author =      "J. M. Kleinberg"
+, title =       "The localization problem for mobile robots"
+, booktitle =   "Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1994
+, pages =       "521--531"
+, update =      "97.11 bibrelex"
 }
 
 @mastersthesis{k-rspqw-94
-, author =	"K. S. Klenk"
-, title =	"Rectilinear shortest path queries among weighted obstacles"
-, school =	"University of Notre Dame"
-, month =	nov
-, year =	1994
-, keywords =	"master thesis"
-, update =	"98.03 bibrelex"
+, author =      "K. S. Klenk"
+, title =       "Rectilinear shortest path queries among weighted obstacles"
+, school =      "University of Notre Dame"
+, month =       nov
+, year =        1994
+, keywords =    "master thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{k-achfg-83
-, author =	"R. Klette"
-, title =	"On the approximation of convex hulls of finite grid point sets"
-, journal =	"Pattern Recogn. Lett."
-, volume =	2
-, year =	1983
-, pages =	"19--22"
+, author =      "R. Klette"
+, title =       "On the approximation of convex hulls of finite grid point sets"
+, journal =     "Pattern Recogn. Lett."
+, volume =      2
+, year =        1983
+, pages =       "19--22"
 }
 
 @article{kk-atcdp-81
-, author =	"R. Klette and E. V. Krishnamurthy"
-, title =	"Algorithms for testing convexity of digital polygons"
-, journal =	"Comput. Graph. Image Process."
-, volume =	16
-, year =	1981
-, pages =	"177--184"
+, author =      "R. Klette and E. V. Krishnamurthy"
+, title =       "Algorithms for testing convexity of digital polygons"
+, journal =     "Comput. Graph. Image Process."
+, volume =      16
+, year =        1981
+, pages =       "177--184"
 }
 
 @article{ks-frtua-97
-, author =	"K. Klimaszewski and T. Sederberg"
-, title =	"Faster ray-tracing using adaptive grids"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	"??"
-, month =	"jan-feb"
-, year =	1997
-, pages =	"42--51"
-, update =	"98.07 bibrelex"
+, author =      "K. Klimaszewski and T. Sederberg"
+, title =       "Faster ray-tracing using adaptive grids"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      "??"
+, month =       "jan-feb"
+, year =        1997
+, pages =       "42--51"
+, update =      "98.07 bibrelex"
 }
 
 @article{k-mtpd-80
-, author =	"G. T. Klincsek"
-, title =	"Minimal triangulations of polygonal domains"
-, journal =	"Discrete Math."
-, volume =	9
-, year =	1980
-, pages =	"121--123"
+, author =      "G. T. Klincsek"
+, title =       "Minimal triangulations of polygonal domains"
+, journal =     "Discrete Math."
+, volume =      9
+, year =        1980
+, pages =       "121--123"
 }
 
 @book{k-vd-73
-, author =	"W. Klingenberg"
-, title =	"Eine Vorlesung {\"uber} Differentialgeometrie"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	1973
-, update =	"98.11 bibrelex"
+, author =      "W. Klingenberg"
+, title =       "Eine Vorlesung {\"uber} Differentialgeometrie"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        1973
+, update =      "98.11 bibrelex"
 }
 
 @article{kd-epurd-76
-, author =	"A. Klinger and C. R. Dyer"
-, title =	"Experiments on pictures using regular decompositions"
-, journal =	"Comput. Graph. Image Process."
-, volume =	5
-, year =	1976
-, pages =	"68--105"
-, update =	"97.11 bibrelex"
+, author =      "A. Klinger and C. R. Dyer"
+, title =       "Experiments on pictures using regular decompositions"
+, journal =     "Comput. Graph. Image Process."
+, volume =      5
+, year =        1976
+, pages =       "68--105"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{k-cizct-85
-, author =	"D. A. Klip"
-, title =	"The completeness issue of the zero curve tracing algorithm for the isolation of the zeros of an analytic function defined on a disk"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Inform. Sci., Univ. Alabama Birmingham"
-, address =	"Birmingham, AL"
-, year =	1985
+, author =      "D. A. Klip"
+, title =       "The completeness issue of the zero curve tracing algorithm for the isolation of the zeros of an analytic function defined on a disk"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Inform. Sci., Univ. Alabama Birmingham"
+, address =     "Birmingham, AL"
+, year =        1985
 }
 
 @article{khmsz-ecdubv-98
-, author =	"J. Klosowski and M. Held and Joseph S. B. Mitchell and K. Zikan and H. Sowizral"
-, title =	"Efficient Collision Detection Using Bounding Volume Hierarchies of {$k$-DOPs}"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	4
-, number =	1
-, year =	1998
-, pages =	"21--36"
-, succeeds =	"hkm-rtcdm-96"
-, update =	"98.11 held, 98.03 mitchell"
+, author =      "J. Klosowski and M. Held and Joseph S. B. Mitchell and K. Zikan and H. Sowizral"
+, title =       "Efficient Collision Detection Using Bounding Volume Hierarchies of {$k$-DOPs}"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      4
+, number =      1
+, year =        1998
+, pages =       "21--36"
+, succeeds =    "hkm-rtcdm-96"
+, update =      "98.11 held, 98.03 mitchell"
 }
 
 @inproceedings{ks-spc1a-96
-, author =	"Petra Knieper and Anand Srivastav"
-, title =	"Sequential and Parallel Construction of {$(1/r)$}-Approximations"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"123--125"
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Petra Knieper and Anand Srivastav"
+, title =       "Sequential and Parallel Construction of {$(1/r)$}-Approximations"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "123--125"
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @mastersthesis{k-iacgw-90
-, author =	"A. Knight"
-, title =	"Implementation of algorithms in a computational geometry workbench"
-, school =	"School Comput. Sci., Carleton Univ."
-, address =	"Ottawa, ON"
-, month =	apr
-, year =	1990
-, keywords =	"master thesis"
-, update =	"98.03 bibrelex"
+, author =      "A. Knight"
+, title =       "Implementation of algorithms in a computational geometry workbench"
+, school =      "School Comput. Sci., Carleton Univ."
+, address =     "Ottawa, ON"
+, month =       apr
+, year =        1990
+, keywords =    "master thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{kmmns-cgw-90
-, author =	"A. Knight and J. May and M. McAffer and T. Nguyen and J.-R. Sack"
-, title =	"A Workbench for Computational Geometry (WOCG)"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	370
-, cites =	"ZZZ"
-, update =	"97.11 bibrelex+sack"
+, author =      "A. Knight and J. May and M. McAffer and T. Nguyen and J.-R. Sack"
+, title =       "A Workbench for Computational Geometry (WOCG)"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       370
+, cites =       "ZZZ"
+, update =      "97.11 bibrelex+sack"
 }
 
 @article{kf-p841d-84
-, author =	"G. Knott and H. Flanders"
-, title =	"Problem 84-1: determine if a polygon is clockwise or counterclockwise"
-, journal =	"J. Algorithms"
-, volume =	5
-, year =	1984
-, pages =	591
+, author =      "G. Knott and H. Flanders"
+, title =       "Problem 84-1: determine if a polygon is clockwise or counterclockwise"
+, journal =     "J. Algorithms"
+, volume =      5
+, year =        1984
+, pages =       591
 }
 
 @techreport{kj-pdwtl-87
-, author =	"G. Knott and E. Jou"
-, title =	"A Program to Determine Whether Two Line Segments Intersect"
-, type =	"Technical {Report}"
-, number =	"CAR-TR-306, CS-TR-1884, DCR-86-05557"
-, institution =	"Dept. Comput. Sci., Univ. Maryland College Park"
-, address =	"College Park, MD"
-, month =	aug
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "G. Knott and E. Jou"
+, title =       "A Program to Determine Whether Two Line Segments Intersect"
+, type =        "Technical {Report}"
+, number =      "CAR-TR-306, CS-TR-1884, DCR-86-05557"
+, institution = "Dept. Comput. Sci., Univ. Maryland College Park"
+, address =     "College Park, MD"
+, month =       aug
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @book{k-acp-73
-, author =	"D. Knuth"
-, title =	"The art of computer programming"
-, publisher =	"Addison-Wesley"
-, year =	1973
-, update =	"98.03 bibrelex"
+, author =      "D. Knuth"
+, title =       "The art of computer programming"
+, publisher =   "Addison-Wesley"
+, year =        1973
+, update =      "98.03 bibrelex"
 }
 
 @book{k-ah-92
-, author =	"Donald E. Knuth"
-, title =	"Axioms and Hulls"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	606
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg, Germany"
-, year =	1992
-, update =	"94.05 grigni"
+, author =      "Donald E. Knuth"
+, title =       "Axioms and Hulls"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      606
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg, Germany"
+, year =        1992
+, update =      "94.05 grigni"
 }
 
 @article{k-cdf-63
-, author =	"D. E. Knuth"
-, title =	"Computer Drawn Flowcharts"
-, journal =	"Commun. ACM"
-, volume =	6
-, year =	1963
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. E. Knuth"
+, title =       "Computer Drawn Flowcharts"
+, journal =     "Commun. ACM"
+, volume =      6
+, year =        1963
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{k-fa-68
-, author =	"D. E. Knuth"
-, title =	"Fundamental Algorithms"
-, series =	"The Art of Computer Programming"
-, volume =	1
-, edition =	"1st"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1968
-, update =	"97.11 bibrelex"
+, author =      "D. E. Knuth"
+, title =       "Fundamental Algorithms"
+, series =      "The Art of Computer Programming"
+, volume =      1
+, edition =     "1st"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1968
+, update =      "97.11 bibrelex"
 }
 
 @book{k-fa-73
-, author =	"D. E. Knuth"
-, title =	"Fundamental Algorithms"
-, series =	"The Art of Computer Programming"
-, volume =	1
-, edition =	"2nd"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1973
+, author =      "D. E. Knuth"
+, title =       "Fundamental Algorithms"
+, series =      "The Art of Computer Programming"
+, volume =      1
+, edition =     "2nd"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1973
 }
 
 @book{k-fa-97
-, author =	"D. E. Knuth"
-, title =	"Fundamental Algorithms"
-, series =	"The Art of Computer Programming"
-, volume =	1
-, edition =	"3rd"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1997
-, update =	"98.07 smid"
+, author =      "D. E. Knuth"
+, title =       "Fundamental Algorithms"
+, series =      "The Art of Computer Programming"
+, volume =      1
+, edition =     "3rd"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1997
+, update =      "98.07 smid"
 }
 
 @article{k-scfl-68
-, author =	"D. E. Knuth"
-, title =	"Semantics of Context-Free Languages"
-, journal =	"Math. Syst. Theory"
-, volume =	2
-, year =	1968
-, pages =	"127--145"
-, update =	"96.01 tamassia"
+, author =      "D. E. Knuth"
+, title =       "Semantics of Context-Free Languages"
+, journal =     "Math. Syst. Theory"
+, volume =      2
+, year =        1968
+, pages =       "127--145"
+, update =      "96.01 tamassia"
 }
 
 @book{k-sa-69
-, author =	"D. E. Knuth"
-, title =	"Seminumerical Algorithms"
-, series =	"The Art of Computer Programming"
-, volume =	2
-, edition =	"1st"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1969
-, update =	"97.11 bibrelex"
+, author =      "D. E. Knuth"
+, title =       "Seminumerical Algorithms"
+, series =      "The Art of Computer Programming"
+, volume =      2
+, edition =     "1st"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1969
+, update =      "97.11 bibrelex"
 }
 
 @book{k-sa-81
-, author =	"D. E. Knuth"
-, title =	"Seminumerical Algorithms"
-, series =	"The Art of Computer Programming"
-, volume =	2
-, edition =	"2nd"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1981
+, author =      "D. E. Knuth"
+, title =       "Seminumerical Algorithms"
+, series =      "The Art of Computer Programming"
+, volume =      2
+, edition =     "2nd"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1981
 }
 
 @book{k-sa-98
-, author =	"D. E. Knuth"
-, title =	"Seminumerical Algorithms"
-, series =	"The Art of Computer Programming"
-, volume =	2
-, edition =	"3rd"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1998
-, update =	"98.07 smid"
+, author =      "D. E. Knuth"
+, title =       "Seminumerical Algorithms"
+, series =      "The Art of Computer Programming"
+, volume =      2
+, edition =     "3rd"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1998
+, update =      "98.07 smid"
 }
 
 @book{k-ss-73
-, author =	"D. E. Knuth"
-, title =	"Sorting and Searching"
-, series =	"The Art of Computer Programming"
-, volume =	3
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1973
+, author =      "D. E. Knuth"
+, title =       "Sorting and Searching"
+, series =      "The Art of Computer Programming"
+, volume =      3
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1973
 }
 
 @book{k-sg-93
-, author =	"D. E. Knuth"
-, title =	"The {Stanford} {GraphBase}: A Platform for Combinatorial Computing"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1993
-, update =	"98.07 tamassia"
+, author =      "D. E. Knuth"
+, title =       "The {Stanford} {GraphBase}: A Platform for Combinatorial Computing"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1993
+, update =      "98.07 tamassia"
 }
 
 @article{kr-pcr-92
-, author =	"D. E. Knuth and A. Raghunathan"
-, title =	"The problem of compatible representatives"
-, journal =	"SIAM J. Discrete Math."
-, volume =	5
-, year =	1992
-, pages =	"422--427"
-, update =	"98.03 bibrelex"
+, author =      "D. E. Knuth and A. Raghunathan"
+, title =       "The problem of compatible representatives"
+, journal =     "SIAM J. Discrete Math."
+, volume =      5
+, year =        1992
+, pages =       "422--427"
+, update =      "98.03 bibrelex"
 }
 
 @book{k-ctrf-91
-, author =	"K.-I. Ko"
-, title =	"Complexity Theory of Real Functions"
-, publisher =	"Birkh{\"a}user"
-, address =	"Boston"
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "K.-I. Ko"
+, title =       "Complexity Theory of Real Functions"
+, publisher =   "Birkh{\"a}user"
+, address =     "Boston"
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{kc-ltawr-89
-, author =	"M. T. Ko and Y. T. Ching"
-, title =	"A linear time algorithm for the weighted rectilinear 2-center problem"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, year =	1989
-, pages =	"75--82"
-, update =	"95.09 mitchell"
+, author =      "M. T. Ko and Y. T. Ching"
+, title =       "A linear time algorithm for the weighted rectilinear 2-center problem"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, year =        1989
+, pages =       "75--82"
+, update =      "95.09 mitchell"
 }
 
 @article{kc-ltawt-92
-, author =	"M. T. Ko and Y. T. Ching"
-, title =	"Linear time algorithms for the weighted tailored $2$-partition problem and the weighted rectilinear 2-center problem under ${L}_\infty$-distance"
-, journal =	"Discrete Appl. Math."
-, volume =	40
-, year =	1992
-, pages =	"397--410"
-, update =	"97.03 agarwal, 96.05 agarwal, 95.09 mitchell"
+, author =      "M. T. Ko and Y. T. Ching"
+, title =       "Linear time algorithms for the weighted tailored $2$-partition problem and the weighted rectilinear 2-center problem under ${L}_\infty$-distance"
+, journal =     "Discrete Appl. Math."
+, volume =      40
+, year =        1992
+, pages =       "397--410"
+, update =      "97.03 agarwal, 96.05 agarwal, 95.09 mitchell"
 }
 
 @article{kl-wrccp-91
-, author =	"M. T. Ko and R. C. T. Lee"
-, title =	"On weighted rectilinear $2$-center and $3$-center problems"
-, journal =	"Inform. Sci."
-, volume =	54
-, year =	1991
-, pages =	"169--190"
-, update =	"96.05 agarwal"
+, author =      "M. T. Ko and R. C. T. Lee"
+, title =       "On weighted rectilinear $2$-center and $3$-center problems"
+, journal =     "Inform. Sci."
+, volume =      54
+, year =        1991
+, pages =       "169--190"
+, update =      "96.05 agarwal"
 }
 
 @article{klc-oaarm-90
-, author =	"M. T. Ko and R. C. T. Lee and J. S. Chang"
-, title =	"An optimal approximation algorithm for the rectilinear $m$-center problem"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"341--352"
+, author =      "M. T. Ko and R. C. T. Lee and J. S. Chang"
+, title =       "An optimal approximation algorithm for the rectilinear $m$-center problem"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "341--352"
 }
 
 @inproceedings{klc-rmcp-87
-, author =	"M. T. Ko and R. C. T. Lee and J. S. Chang"
-, title =	"Rectilinear $m$-center problem"
-, booktitle =	"Proc. National Computer Symp."
-, site =	"Taipei, Taiwan, R. O. C."
-, year =	1987
-, pages =	"325--329"
-, update =	"97.11 bibrelex"
+, author =      "M. T. Ko and R. C. T. Lee and J. S. Chang"
+, title =       "Rectilinear $m$-center problem"
+, booktitle =   "Proc. National Computer Symp."
+, site =        "Taipei, Taiwan, R. O. C."
+, year =        1987
+, pages =       "325--329"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{k-ccl-67
-, author =	"S. Kobayashi"
-, title =	"On conjugate and cut loci"
-, editor =	"S. S. Chern"
-, booktitle =	"Studies in Global Geometry and Analysis"
-, publisher =	"Mathematical Association of America"
-, year =	1967
-, pages =	"96--122"
-, keywords =	"shortest paths"
-, update =	"93.09 erickson, 93.05 orourke"
+, author =      "S. Kobayashi"
+, title =       "On conjugate and cut loci"
+, editor =      "S. S. Chern"
+, booktitle =   "Studies in Global Geometry and Analysis"
+, publisher =   "Mathematical Association of America"
+, year =        1967
+, pages =       "96--122"
+, keywords =    "shortest paths"
+, update =      "93.09 erickson, 93.05 orourke"
 }
 
 @article{k-fdpam-94
-, author =	"L. Kobbelt"
-, title =	"A fast dot-product algorithm with minimal rounding errors"
-, journal =	"Computing"
-, volume =	52
-, year =	1994
-, pages =	"355--369"
-, update =	"98.07 bibrelex"
+, author =      "L. Kobbelt"
+, title =       "A fast dot-product algorithm with minimal rounding errors"
+, journal =     "Computing"
+, volume =      52
+, year =        1994
+, pages =       "355--369"
+, update =      "98.07 bibrelex"
 }
 
 @mastersthesis{k-ibme-
-, author =	"L. Kobbelt"
-, title =	"Iterative {Berechnung} metrischer {Eigenschaften}"
-, school =	"Universit{\"a}t Karlsruhe"
-, address =	"Karlsruhe, Germany"
-, year =	"??"
-, note =	"Thesis"
-, keywords =	"master thesis"
-, update =	"98.07 bibrelex"
+, author =      "L. Kobbelt"
+, title =       "Iterative {Berechnung} metrischer {Eigenschaften}"
+, school =      "Universit{\"a}t Karlsruhe"
+, address =     "Karlsruhe, Germany"
+, year =        "??"
+, note =        "Thesis"
+, keywords =    "master thesis"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{k-reefp-97
-, author =	"L. Kobbelt"
-, title =	"Robust and efficient evaluation of functionals on parametric surfaces"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"376--378"
-, cites =	"b-wdwnb-90, bs-aulbr-66, bs-nqe-67, d-fptea-71, g-igar-96, f-pcg-93, f-riga-96, fv-eeacg-93, k-ibme-, k-fdpam-94, km-catp-81, p-pfpan-92, s-apfpa-96, s-aeqes-82, s-eidnm-83, s-acmi-71, ts-cggps-80, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "L. Kobbelt"
+, title =       "Robust and efficient evaluation of functionals on parametric surfaces"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "376--378"
+, cites =       "b-wdwnb-90, bs-aulbr-66, bs-nqe-67, d-fptea-71, g-igar-96, f-pcg-93, f-riga-96, fv-eeacg-93, k-ibme-, k-fdpam-94, km-catp-81, p-pfpan-92, s-apfpa-96, s-aeqes-82, s-eidnm-83, s-acmi-71, ts-cggps-80, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{kcvs-imrma-98
-, author =	"L. Kobbelt and S. Campagna and J. Vorsatz and H.-P. Seidel"
-, title =	"Interactive Multi-Resolution Modeling on Arbitrary Meshes"
-, booktitle =	"Proc. SIGGRAPH '98"
-, site =	"Orlando, FL"
-, series =	"Computer Graphics Proceedings, Annual Conference Series"
-, month =	jul
-, year =	1998
-, pages =	"105--114"
-, update =	"98.11 held"
+, author =      "L. Kobbelt and S. Campagna and J. Vorsatz and H.-P. Seidel"
+, title =       "Interactive Multi-Resolution Modeling on Arbitrary Meshes"
+, booktitle =   "Proc. SIGGRAPH '98"
+, site =        "Orlando, FL"
+, series =      "Computer Graphics Proceedings, Annual Conference Series"
+, month =       jul
+, year =        1998
+, pages =       "105--114"
+, update =      "98.11 held"
 }
 
 @article{kk-mpf-89
-, author =	"M. W. Koch and R. L. Kashyap"
-, title =	"Matching polygon fragments"
-, journal =	"Pattern Recogn. Lett."
-, volume =	10
-, year =	1989
-, pages =	"297--308"
-, keywords =	"shape matching"
-, update =	"98.07 rote"
+, author =      "M. W. Koch and R. L. Kashyap"
+, title =       "Matching polygon fragments"
+, journal =     "Pattern Recogn. Lett."
+, volume =      10
+, year =        1989
+, pages =       "297--308"
+, keywords =    "shape matching"
+, update =      "98.07 rote"
 }
 
 @article{k-ambsc-84
-, author =	"P. Kochevar"
-, title =	"An application of multivariate {B}-splines to computer-aided geometric design"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, number =	1
-, year =	1984
-, pages =	"159--175"
+, author =      "P. Kochevar"
+, title =       "An application of multivariate {B}-splines to computer-aided geometric design"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, number =      1
+, year =        1984
+, pages =       "159--175"
 }
 
 @inproceedings{k-ernmp-87
-, author =	"D. E. Koditschek"
-, title =	"Exact robot navigation by means of potential functions: some topological considerations"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1987
-, pages =	"1--6"
-, update =	"95.05 agarwal"
+, author =      "D. E. Koditschek"
+, title =       "Exact robot navigation by means of potential functions: some topological considerations"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1987
+, pages =       "1--6"
+, update =      "95.05 agarwal"
 }
 
 @article{k-kdka-36
-, author =	"P. Koebe"
-, title =	"Kontaktprobleme der konformen {Abbildung}"
-, journal =	"Ber. Verh. S{\"a}chs. Akademie der Wissenschaften Leipzig, Math.-Phys. Klasse"
-, volume =	88
-, year =	1936
-, pages =	"141--164"
-, update =	"97.11 bibrelex"
+, author =      "P. Koebe"
+, title =       "Kontaktprobleme der konformen {Abbildung}"
+, journal =     "Ber. Verh. S{\"a}chs. Akademie der Wissenschaften Leipzig, Math.-Phys. Klasse"
+, volume =      88
+, year =        1936
+, pages =       "141--164"
+, update =      "97.11 bibrelex"
 }
 
 @book{k-ss-89
-, author =	"J. Koenderink"
-, title =	"Solid Shape"
-, publisher =	"MIT Press"
-, year =	1989
-, update =	"95.01 mitchell"
+, author =      "J. Koenderink"
+, title =       "Solid Shape"
+, publisher =   "MIT Press"
+, year =        1989
+, update =      "95.01 mitchell"
 }
 
 @article{kd-irssr-79
-, author =	"J. J. Koenderink and A. J. van Doorn"
-, title =	"The internal representation of solid shape with respect to vision"
-, journal =	"Biological Cybernetics"
-, volume =	32
-, year =	1979
-, pages =	"211--216"
+, author =      "J. J. Koenderink and A. J. van Doorn"
+, title =       "The internal representation of solid shape with respect to vision"
+, journal =     "Biological Cybernetics"
+, volume =      32
+, year =        1979
+, pages =       "211--216"
 }
 
 @article{kd-svm-76
-, author =	"J. J. Koenderink and A. J. van Doorn"
-, title =	"The singularities of the visual mapping"
-, journal =	"Biological Cybernetics"
-, volume =	24
-, year =	1976
-, pages =	"51--59"
+, author =      "J. J. Koenderink and A. J. van Doorn"
+, title =       "The singularities of the visual mapping"
+, journal =     "Biological Cybernetics"
+, volume =      24
+, year =        1976
+, pages =       "51--59"
 }
 
 @inproceedings{k-atdvo-92
-, author =	"H. Koike"
-, title =	"An Application of Three Dimensional Visualization to Object-Oriented Programming"
-, booktitle =	"Proc. Advanced Visual Interfaces"
-, series =	"World Scientific Series in Computer Science"
-, volume =	36
-, year =	1992
-, pages =	"180--192"
-, keywords =	"graph drawing"
-, update =	"94.01 tamassia, 93.09 tamassia"
+, author =      "H. Koike"
+, title =       "An Application of Three Dimensional Visualization to Object-Oriented Programming"
+, booktitle =   "Proc. Advanced Visual Interfaces"
+, series =      "World Scientific Series in Computer Science"
+, volume =      36
+, year =        1992
+, pages =       "180--192"
+, keywords =    "graph drawing"
+, update =      "94.01 tamassia, 93.09 tamassia"
 }
 
 @inproceedings{kts-vsmbc-85
-, author =	"P. Koistinen and M. Tamminen and H. Samet"
-, title =	"Viewing solid models by bintree conversion"
-, editor =	"C. E. Vandoni"
-, booktitle =	"Proceedings of the {EUROGRAPHICS'85} Conference"
-, publisher =	"North-Holland"
-, address =	"Amsterdam"
-, year =	1985
-, pages =	"147--157"
-, update =	"96.05 efrat"
+, author =      "P. Koistinen and M. Tamminen and H. Samet"
+, title =       "Viewing solid models by bintree conversion"
+, editor =      "C. E. Vandoni"
+, booktitle =   "Proceedings of the {EUROGRAPHICS'85} Conference"
+, publisher =   "North-Holland"
+, address =     "Amsterdam"
+, year =        1985
+, pages =       "147--157"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{kk-nnfmd-95
-, author =	"V. Koivune and S. Kassam"
-, title =	"Nearest neighbor filters for multivariate data"
-, booktitle =	"IEEE Workshop on Nonlinear Signal and Image Processing"
-, year =	1995
-, update =	"97.07 agarwal"
+, author =      "V. Koivune and S. Kassam"
+, title =       "Nearest neighbor filters for multivariate data"
+, booktitle =   "IEEE Workshop on Nonlinear Signal and Image Processing"
+, year =        1995
+, update =      "97.07 agarwal"
 }
 
 @article{k-ptldt-87
-, author =	"M. Kolinek"
-, title =	"A polynomial-time linear decision tree for the traveling salesman problem and other {NP}-complete problems"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"37--48"
+, author =      "M. Kolinek"
+, title =       "A polynomial-time linear decision tree for the traveling salesman problem and other {NP}-complete problems"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "37--48"
 }
 
 @article{k-3dlca-94
-, author =	"I. Kolingerov{\'a}"
-, title =	"3D-Line Clipping Algorithms -- A Comparative Study"
-, journal =	"Visual Comput."
-, volume =	11
-, number =	2
-, year =	1994
-, pages =	"96--104"
-, update =	"96.01 held"
+, author =      "I. Kolingerov{\'a}"
+, title =       "3D-Line Clipping Algorithms -- A Comparative Study"
+, journal =     "Visual Comput."
+, volume =      11
+, number =      2
+, year =        1994
+, pages =       "96--104"
+, update =      "96.01 held"
 }
 
 @inproceedings{k-ccheu-94
-, author =	"Ivana Kollingerova"
-, title =	"Creating convex hulls in {$E^2$} using dual representation"
-, booktitle =	"Winter School of Computer Graphics and CAD Systems 94"
-, publisher =	"University of West Bohemia"
-, address =	"Pilsen, Czech Republic"
-, month =	jan
-, year =	1994
-, pages =	"158--167"
-, comments =	"$O(n \log h)$ 2D convex hull algorithm using duality
+, author =      "Ivana Kollingerova"
+, title =       "Creating convex hulls in {$E^2$} using dual representation"
+, booktitle =   "Winter School of Computer Graphics and CAD Systems 94"
+, publisher =   "University of West Bohemia"
+, address =     "Pilsen, Czech Republic"
+, month =       jan
+, year =        1994
+, pages =       "158--167"
+, comments =    "$O(n \log h)$ 2D convex hull algorithm using duality
 mapping"
-, update =	"98.07 icking, 95.09 korneenko, 95.05 korneenko"
+, update =      "98.07 icking, 95.09 korneenko, 95.05 korneenko"
 }
 
 @inproceedings{kr-nltas-99
-, author =	"S. Kolliopoulos and S. Rao"
-, title =	"A nearly linear-time approximation scheme for the {Euclidean} $k$-median problem"
-, booktitle =	"Proc. 7th Annu. European Sympos. Algorithms"
-, year =	1999
-, pages =	"378--389"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "S. Kolliopoulos and S. Rao"
+, title =       "A nearly linear-time approximation scheme for the {Euclidean} $k$-median problem"
+, booktitle =   "Proc. 7th Annu. European Sympos. Algorithms"
+, year =        1999
+, pages =       "378--389"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{k-atubv-01
-, author =	"Vladlen Koltun"
-, title =	"Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions"
-, booktitle =	"Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	2001
-, update =	"01.07 orourke"
+, author =      "Vladlen Koltun"
+, title =       "Almost Tight Upper Bounds for Vertical Decompositions in Four Dimensions"
+, booktitle =   "Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        2001
+, update =      "01.07 orourke"
 }
 
 @inproceedings{k-ispgs-01
-, author =	"Vladlen Koltun"
-, title =	"Intersection Searching Problems in General Settings"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"89--92"
-, update =	"01.04 icking"
+, author =      "Vladlen Koltun"
+, title =       "Intersection Searching Problems in General Settings"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "89--92"
+, update =      "01.04 icking"
 }
 
 @article{kkv-arcbt-89
-, author =	"D. K{\"o}lzow and A. Kuba and A. Vol{\v c}i{\v c}"
-, title =	"An algorithm for reconstructing convex bodies from their projections"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"205--237"
+, author =      "D. K{\"o}lzow and A. Kuba and A. Vol{\v c}i{\v c}"
+, title =       "An algorithm for reconstructing convex bodies from their projections"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "205--237"
 }
 
 @article{k-scnds-88
-, author =	"P. Komj{\'a}th"
-, title =	"A simplified construction of nonlinear {Davenport--Schinzel} sequences"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	49
-, year =	1988
-, pages =	"262--267"
-, update =	"98.07 icking, 95.09 agarwal"
+, author =      "P. Komj{\'a}th"
+, title =       "A simplified construction of nonlinear {Davenport--Schinzel} sequences"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      49
+, year =        1988
+, pages =       "262--267"
+, update =      "98.07 icking, 95.09 agarwal"
 }
 
 @incollection{k-stces-93
-, author =	"P. Komj{\'a}th"
-, title =	"Set Theoretic Constructions in {Euclidean} Spaces"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"303--325"
-, keywords =	"survey paper, axiom of choice, decomposition, coloring, continuum hypothesis, Hilbert space, paradoxical sets"
-, update =	"93.09 erickson"
+, author =      "P. Komj{\'a}th"
+, title =       "Set Theoretic Constructions in {Euclidean} Spaces"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "303--325"
+, keywords =    "survey paper, axiom of choice, decomposition, coloring, continuum hypothesis, Hilbert space, paradoxical sets"
+, update =      "93.09 erickson"
 }
 
 @article{kpw-atben-92
-, author =	"J. Koml{\'o}s and J. Pach and G. Woeginger"
-, title =	"Almost tight bounds for $\epsilon$-nets"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"163--173"
-, succeeds =	"pw-snben-90"
-, update =	"93.09 rote"
+, author =      "J. Koml{\'o}s and J. Pach and G. Woeginger"
+, title =       "Almost tight bounds for $\epsilon$-nets"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "163--173"
+, succeeds =    "pw-snben-90"
+, update =      "93.09 rote"
 }
 
 @article{ks-ppars-85
-, author =	"J. Komlos and M. T. Shing"
-, title =	"Probabilistic partitioning algorithms for the rectilinear {Steiner} tree problem"
-, journal =	"Networks"
-, volume =	15
-, year =	1985
-, pages =	"413--423"
-, update =	"01.07 devillers, 98.07 bibrelex"
+, author =      "J. Komlos and M. T. Shing"
+, title =       "Probabilistic partitioning algorithms for the rectilinear {Steiner} tree problem"
+, journal =     "Networks"
+, volume =      15
+, year =        1985
+, pages =       "413--423"
+, update =      "01.07 devillers, 98.07 bibrelex"
 }
 
 @article{kmr-drrmp-88
-, author =	"T. Y. Kong and D. M. Mount and A. W. Roscoe"
-, title =	"The decomposition of a rectangle into rectangles of minimal perimeter"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, year =	1988
-, pages =	"1215--1231"
+, author =      "T. Y. Kong and D. M. Mount and A. W. Roscoe"
+, title =       "The decomposition of a rectangle into rectangles of minimal perimeter"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, year =        1988
+, pages =       "1215--1231"
 }
 
 @article{kmw-dsrmp-87
-, author =	"T. Y. Kong and D. M. Mount and M. Werman"
-, title =	"The Decomposition of a Square into Rectangles of Minimal Perimeter"
-, journal =	"Discrete Appl. Math."
-, volume =	16
-, year =	1987
-, pages =	"239--243"
-, update =	"96.01 werman"
+, author =      "T. Y. Kong and D. M. Mount and M. Werman"
+, title =       "The Decomposition of a Square into Rectangles of Minimal Perimeter"
+, journal =     "Discrete Appl. Math."
+, volume =      16
+, year =        1987
+, pages =       "239--243"
+, update =      "96.01 werman"
 }
 
 @book{k-eidat-03
-, author =	"Julius K{\"o}nig"
-, title =	"{Einleitung} in die allgemeine {Theorie} der algebraischen {Gr{\"o}{\ss}en}"
-, publisher =	"B. G. Teubner"
-, address =	"Leipzig"
-, year =	1903
-, update =	"99.11 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
+, author =      "Julius K{\"o}nig"
+, title =       "{Einleitung} in die allgemeine {Theorie} der algebraischen {Gr{\"o}{\ss}en}"
+, publisher =   "B. G. Teubner"
+, address =     "Leipzig"
+, year =        1903
+, update =      "99.11 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
 }
 
 @article{ks-envci-84
-, author =	"S. B. Konyagin and K. A. Savastyanov"
-, title =	"Estimation of the number of vertices of a convex integral polyhedron in terms of its volume"
-, journal =	"Functional Anal. Appl."
-, volume =	18
-, year =	1984
-, pages =	"13--15"
-, update =	"97.11 bibrelex"
+, author =      "S. B. Konyagin and K. A. Savastyanov"
+, title =       "Estimation of the number of vertices of a convex integral polyhedron in terms of its volume"
+, journal =     "Functional Anal. Appl."
+, volume =      18
+, year =        1984
+, pages =       "13--15"
+, update =      "97.11 bibrelex"
 }
 
 @article{kf-nvstc-72
-, author =	"W. L. G. Koontz and K. Fukunaga"
-, title =	"A nonparametric valley-seeking technique for clustering analysis"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-21"
-, year =	1972
-, pages =	"171--178"
+, author =      "W. L. G. Koontz and K. Fukunaga"
+, title =       "A nonparametric valley-seeking technique for clustering analysis"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-21"
+, year =        1972
+, pages =       "171--178"
 }
 
 @article{knf-gtanp-76
-, author =	"W. L. G. Koontz and P. M. Narendra and K. Fukunaga"
-, title =	"A graph-theoretical approach to non-parametric cluster analysis"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-25"
-, year =	1976
-, pages =	"936--944"
+, author =      "W. L. G. Koontz and P. M. Narendra and K. Fukunaga"
+, title =       "A graph-theoretical approach to non-parametric cluster analysis"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-25"
+, year =        1976
+, pages =       "936--944"
 }
 
 @phdthesis{k-stpvp-92
-, author =	"A. A. Kooshesh"
-, title =	"Structuring Techniques for Path and Visibility Problems"
-, type =	"Ph.{D}. Thesis"
-, school =	"University of New Mexico"
-, address =	"Albuquerque, NM 87131"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"93.05 moret"
+, author =      "A. A. Kooshesh"
+, title =       "Structuring Techniques for Path and Visibility Problems"
+, type =        "Ph.{D}. Thesis"
+, school =      "University of New Mexico"
+, address =     "Albuquerque, NM 87131"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "93.05 moret"
 }
 
 @inproceedings{km-fsp-95
-, author =	"A. A. Kooshesh and B. M. E. Moret"
-, title =	"Folding a simple polygons: a paradigm for computational geometry"
-, booktitle =	"Proc. ACM Comput. Science Conf."
-, year =	1995
-, pages =	"114--118"
-, update =	"98.03 moret"
+, author =      "A. A. Kooshesh and B. M. E. Moret"
+, title =       "Folding a simple polygons: a paradigm for computational geometry"
+, booktitle =   "Proc. ACM Comput. Science Conf."
+, year =        1995
+, pages =       "114--118"
+, update =      "98.03 moret"
 }
 
 @inproceedings{km-ftsps-91
-, author =	"A. A. Kooshesh and B. M. E. Moret"
-, title =	"Folding triangulated simple polygons: structural and algorithmic results"
-, booktitle =	"Proc. 3rd Int'l Conf. on Information and Computing"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	497
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"102--110"
-, update =	"93.09 erickson, 93.05 moret"
+, author =      "A. A. Kooshesh and B. M. E. Moret"
+, title =       "Folding triangulated simple polygons: structural and algorithmic results"
+, booktitle =   "Proc. 3rd Int'l Conf. on Information and Computing"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      497
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "102--110"
+, update =      "93.09 erickson, 93.05 moret"
 }
 
 @article{km-tcvts-92
-, author =	"A. A. Kooshesh and B. M. E. Moret"
-, title =	"Three-coloring the vertices of a triangulated simple polygon"
-, journal =	"Pattern Recogn."
-, volume =	25
-, year =	1992
-, pages =	443
-, update =	"93.05 moret"
+, author =      "A. A. Kooshesh and B. M. E. Moret"
+, title =       "Three-coloring the vertices of a triangulated simple polygon"
+, journal =     "Pattern Recogn."
+, volume =      25
+, year =        1992
+, pages =       443
+, update =      "93.05 moret"
 }
 
 @article{kms-ibpyp-90
-, author =	"A. A. Kooshesh and B. M. E. Moret and L. A. Sz{\'e}kely"
-, title =	"Improved bounds for the prison yard problem"
-, journal =	"Congr. Numer."
-, volume =	76
-, year =	1990
-, pages =	"145--149"
-, update =	"93.09 rote, 93.05 moret"
+, author =      "A. A. Kooshesh and B. M. E. Moret and L. A. Sz{\'e}kely"
+, title =       "Improved bounds for the prison yard problem"
+, journal =     "Congr. Numer."
+, volume =      76
+, year =        1990
+, pages =       "145--149"
+, update =      "93.09 rote, 93.05 moret"
 }
 
 @article{k-amctp-63
-, author =	"R. J. Kopec"
-, title =	"An alternate method for the construction of {Thiessen} polygons"
-, journal =	"Professional Geographer"
-, volume =	14
-, year =	1963
-, pages =	"24--26"
+, author =      "R. J. Kopec"
+, title =       "An alternate method for the construction of {Thiessen} polygons"
+, journal =     "Professional Geographer"
+, volume =      14
+, year =        1963
+, pages =       "24--26"
 }
 
 @article{kj-mecha-78
-, author =	"J. Koplowitz and D. Jouppi"
-, title =	"A more efficient convex hull algorithm"
-, journal =	"Inform. Process. Lett."
-, volume =	7
-, year =	1978
-, pages =	"56--57"
+, author =      "J. Koplowitz and D. Jouppi"
+, title =       "A more efficient convex hull algorithm"
+, journal =     "Inform. Process. Lett."
+, volume =      7
+, year =        1978
+, pages =       "56--57"
 }
 
 @incollection{kg-xdgc-94
-, author =	"Manfred Kopp and Michael Gervautz"
-, title =	"{XOR}-Drawing with Guaranteed Contrast"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"413--414"
-, keywords =	"cursor"
-, update =	"94.09 heckbert"
-, annote =	"Gives simple guidelines for the choice of write mask when
+, author =      "Manfred Kopp and Michael Gervautz"
+, title =       "{XOR}-Drawing with Guaranteed Contrast"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "413--414"
+, keywords =    "cursor"
+, update =      "94.09 heckbert"
+, annote =      "Gives simple guidelines for the choice of write mask when
 drawing cursors and other graphics with exclusive-OR on multi-bit frame
 buffers."
 }
 
 @article{k-aapge-78
-, author =	"R. Koppe"
-, title =	"Automatische Abbildung eines planaren Graphen in die Ebene mit beliebig vorgebbaren Orten der Knotenbilder"
-, journal =	"Computing"
-, volume =	20
-, year =	1978
-, pages =	"61--73"
-, update =	"98.03 bibrelex"
+, author =      "R. Koppe"
+, title =       "Automatische Abbildung eines planaren Graphen in die Ebene mit beliebig vorgebbaren Orten der Knotenbilder"
+, journal =     "Computing"
+, volume =      20
+, year =        1978
+, pages =       "61--73"
+, update =      "98.03 bibrelex"
 }
 
 @article{kmw-jsttd-91
-, author =	"R. Kopperman and P. R. Meyer and R. G. Wilson"
-, title =	"A {Jordan} surface theorem for three-dimensional digital spaces"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"155--161"
+, author =      "R. Kopperman and P. R. Meyer and R. G. Wilson"
+, title =       "A {Jordan} surface theorem for three-dimensional digital spaces"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "155--161"
 }
 
 @techreport{k-smrra-
-, author =	"J. U. Korien"
-, title =	"Solid Modeling Requirements for Robotic Applications"
-, institution =	"IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	"??"
-, update =	"97.11 bibrelex"
+, author =      "J. U. Korien"
+, title =       "Solid Modeling Requirements for Robotic Applications"
+, institution = "IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        "??"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ksfsp-fnnsm-96
-, author =	"Flip Korn and Nikolaos Sidiropoulos and Christos Faloutsos and Eliot Siegel and Zenon Protopapa"
-, title =	"Fast Nearest Neighbor Search in Medical Image Database"
-, booktitle =	"Proc. 22nd VLDB Conference"
-, year =	1996
-, pages =	"215--226"
-, update =	"97.07 agarwal"
+, author =      "Flip Korn and Nikolaos Sidiropoulos and Christos Faloutsos and Eliot Siegel and Zenon Protopapa"
+, title =       "Fast Nearest Neighbor Search in Medical Image Database"
+, booktitle =   "Proc. 22nd VLDB Conference"
+, year =        1996
+, pages =       "215--226"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{k-vdags-91
-, author =	"N. M. Korneenko"
-, title =	"Voronoi diagrams: applications and generalizations: a survey"
-, booktitle =	"Geometrical Problems of Image Processing, Proc. 5th Workshop, Georgenthal, March 11--15, 1991"
-, series =	"Research in Informatics"
-, volume =	4
-, publisher =	"Akademie-Verlag"
-, address =	"Berlin, Germany"
-, year =	1991
-, pages =	"136--146"
-, keywords =	"{Voronoi} diagram, generalized {Voronoi} diagram, bibliography"
-, update =	"95.01 korneenko"
-, annote =	"Partly classified bibliography"
+, author =      "N. M. Korneenko"
+, title =       "Voronoi diagrams: applications and generalizations: a survey"
+, booktitle =   "Geometrical Problems of Image Processing, Proc. 5th Workshop, Georgenthal, March 11--15, 1991"
+, series =      "Research in Informatics"
+, volume =      4
+, publisher =   "Akademie-Verlag"
+, address =     "Berlin, Germany"
+, year =        1991
+, pages =       "136--146"
+, keywords =    "{Voronoi} diagram, generalized {Voronoi} diagram, bibliography"
+, update =      "95.01 korneenko"
+, annote =      "Partly classified bibliography"
 }
 
 @inproceedings{km-afwps-90
-, author =	"N. M. Korneenko and H. Martini"
-, title =	"Approximating finite weighted point sets by hyperplanes"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"276--286"
+, author =      "N. M. Korneenko and H. Martini"
+, title =       "Approximating finite weighted point sets by hyperplanes"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "276--286"
 }
 
 @incollection{km-hart-93
-, author =	"N. M. Korneenko and H. Martini"
-, title =	"Hyperplane Approximation and Related Topics"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg"
-, year =	1993
-, pages =	"135--161"
-, keywords =	"survey paper, hyperplane approximation/fitting"
-, update =	"97.03 agarwal, 93.09 erickson"
+, author =      "N. M. Korneenko and H. Martini"
+, title =       "Hyperplane Approximation and Related Topics"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg"
+, year =        1993
+, pages =       "135--161"
+, keywords =    "survey paper, hyperplane approximation/fitting"
+, update =      "97.03 agarwal, 93.09 erickson"
 }
 
 @article{km-lppcs-93
-, author =	"N. M. Korneenko and N. N. Metelskij"
-, title =	"On lattice points in polyhedral cross-sections"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, number =	1
-, year =	1993
-, pages =	"95--99"
-, keywords =	"convex polyhedron, integer points"
-, update =	"95.01 korneenko"
+, author =      "N. M. Korneenko and N. N. Metelskij"
+, title =       "On lattice points in polyhedral cross-sections"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, number =      1
+, year =        1993
+, pages =       "95--99"
+, keywords =    "convex polyhedron, integer points"
+, update =      "95.01 korneenko"
 }
 
 @article{km-fpraa-83
-, author =	"P. Kornerup and D. Matula"
-, title =	"Finite Precision Rational Arithmetic: {An} Arithmetic Unit"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-32"
-, number =	4
-, month =	apr
-, year =	1983
-, update =	"98.03 bibrelex"
+, author =      "P. Kornerup and D. Matula"
+, title =       "Finite Precision Rational Arithmetic: {An} Arithmetic Unit"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-32"
+, number =      4
+, month =       apr
+, year =        1983
+, update =      "98.03 bibrelex"
 }
 
 @mastersthesis{k-gbs-83
-, author =	"M. Korp"
-, title =	"Geradlinig begrenztes {Suchen}"
-, type =	"M.{Sc}. Thesis"
-, school =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1983
-, keywords =	"master thesis"
+, author =      "M. Korp"
+, title =       "Geradlinig begrenztes {Suchen}"
+, type =        "M.{Sc}. Thesis"
+, school =      "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1983
+, keywords =    "master thesis"
 }
 
 @incollection{kps-stvl-90
-, author =	"B. Korte and H. J. Pr{\"o}mel and A. Steger"
-, title =	"Steiner trees in {VLSI}-Layout"
-, editor =	"B. Korte and L. Lov{\'a}sz and H. J. Pr{\"o}mel and A. Schrijver"
-, booktitle =	"Paths, Flows and VLSI-Layout"
-, publisher =	"Springer-Verlag"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "B. Korte and H. J. Pr{\"o}mel and A. Steger"
+, title =       "Steiner trees in {VLSI}-Layout"
+, editor =      "B. Korte and L. Lov{\'a}sz and H. J. Pr{\"o}mel and A. Schrijver"
+, booktitle =   "Paths, Flows and VLSI-Layout"
+, publisher =   "Springer-Verlag"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @book{kv-cota-00
-, author =	"B. Korte and J. Vygen"
-, title =	"Combinatorial Optimization, Theory and Algorithms"
-, series =	"Algorithms and Combinatorics"
-, volume =	21
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	2000
-, update =	"00.11 smid"
+, author =      "B. Korte and J. Vygen"
+, title =       "Combinatorial Optimization, Theory and Algorithms"
+, series =      "Algorithms and Combinatorics"
+, volume =      21
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        2000
+, update =      "00.11 smid"
 }
 
 @inproceedings{kr-dgipc-99
-, author =	"Ulrich H. Kortenkamp and J{\"u}rgen Richter-Gebert"
-, title =	"Dynamic Geometry {I}: The Problem of Continuity"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"51--53"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Ulrich H. Kortenkamp and J{\"u}rgen Richter-Gebert"
+, title =       "Dynamic Geometry {I}: The Problem of Continuity"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "51--53"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{kr-dgiia-99
-, author =	"Ulrich H. Kortenkamp and J{\"u}rgen Richter-Gebert"
-, title =	"Dynamic Geometry {II}: Applications"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"109--111"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Ulrich H. Kortenkamp and J{\"u}rgen Richter-Gebert"
+, title =       "Dynamic Geometry {II}: Applications"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "109--111"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @incollection{kg-ifics-96
-, author =	"P. Kortum and S. Geisler"
-, title =	"Implementation of a foveated image coding system for image bandwidth reduction"
-, booktitle =	"Human Visions and Electronic Imaging"
-, series =	"Proc. SPIE"
-, volume =	2657
-, publisher =	"SPIE"
-, year =	1996
-, pages =	"350--360"
-, update =	"98.07 bibrelex"
+, author =      "P. Kortum and S. Geisler"
+, title =       "Implementation of a foveated image coding system for image bandwidth reduction"
+, booktitle =   "Human Visions and Electronic Imaging"
+, series =      "Proc. SPIE"
+, volume =      2657
+, publisher =   "SPIE"
+, year =        1996
+, pages =       "350--360"
+, update =      "98.07 bibrelex"
 }
 
 @article{kt-cdcct-90
-, author =	"G. K{\'o}s and J. T{\"o}r{\H o}csik"
-, title =	"Convex disks can cover their shadow"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"529--531"
+, author =      "G. K{\'o}s and J. T{\"o}r{\H o}csik"
+, title =       "Convex disks can cover their shadow"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "529--531"
 }
 
 @inproceedings{km-pgand-91
-, author =	"C. Kosak and J. Marks"
-, title =	"A Parallel Genetic Algorithm for Network-Diagram Layout"
-, booktitle =	"Proc. 4th Internat. Conf. on Genetic Algorithms"
-, nickname =	"ICGA '91"
-, year =	1991
-, keywords =	"graph drawing"
-, update =	"98.07 bibrelex, 93.09 tamassia"
+, author =      "C. Kosak and J. Marks"
+, title =       "A Parallel Genetic Algorithm for Network-Diagram Layout"
+, booktitle =   "Proc. 4th Internat. Conf. on Genetic Algorithms"
+, nickname =    "ICGA '91"
+, year =        1991
+, keywords =    "graph drawing"
+, update =      "98.07 bibrelex, 93.09 tamassia"
 }
 
 @article{kms-alnds-94
-, author =	"C. Kosak and J. Marks and S. Shieber"
-, title =	"Automating the Layout of Network Diagrams with Specified Visual Organization"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	24
-, number =	3
-, year =	1994
-, pages =	"440--454"
-, keywords =	"graph drawing"
-, update =	"95.05 tamassia"
+, author =      "C. Kosak and J. Marks and S. Shieber"
+, title =       "Automating the Layout of Network Diagrams with Specified Visual Organization"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      24
+, number =      3
+, year =        1994
+, pages =       "440--454"
+, keywords =    "graph drawing"
+, update =      "95.05 tamassia"
 }
 
 @inproceedings{k-oricm-94
-, author =	"S. R. Kosaraju"
-, title =	"An Optimal {RAM} Implementation of Catenable Min Double-ended Queues"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"195--203"
-, update =	"98.03 bibrelex"
+, author =      "S. R. Kosaraju"
+, title =       "An Optimal {RAM} Implementation of Catenable Min Double-ended Queues"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "195--203"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{k-lssl-81
-, author =	"S. R. Kosaraju"
-, title =	"Localized Search in Sorted Lists"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
-, year =	1981
-, pages =	"62--69"
-, update =	"98.03 bibrelex"
+, author =      "S. R. Kosaraju"
+, title =       "Localized Search in Sorted Lists"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Theory Comput."
+, year =        1981
+, pages =       "62--69"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{k-msp-79
-, author =	"S. R. Kosaraju"
-, title =	"On a multidimensional search problem"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
-, year =	1979
-, pages =	"67--73"
+, author =      "S. R. Kosaraju"
+, title =       "On a multidimensional search problem"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Theory Comput."
+, year =        1979
+, pages =       "67--73"
 }
 
 @article{ka-osbmc-88
-, author =	"S. R. Kosaraju and M. J. Atallah"
-, title =	"Optimal simulations between meshed-connected arrays of processors"
-, journal =	"J. ACM"
-, volume =	"??"
-, month =	jul
-, year =	1988
-, pages =	"635--650"
-, update =	"98.03 bibrelex"
+, author =      "S. R. Kosaraju and M. J. Atallah"
+, title =       "Optimal simulations between meshed-connected arrays of processors"
+, journal =     "J. ACM"
+, volume =      "??"
+, month =       jul
+, year =        1988
+, pages =       "635--650"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{kd-opets-88
-, author =	"S. R. Kosaraju and A. L. Delcher"
-, title =	"Optimal Parallel Evaluation of Tree-Structured Computations by Raking"
-, booktitle =	"Proc. AWOC 88"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	319
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"101--110"
-, update =	"96.09 orourke"
+, author =      "S. R. Kosaraju and A. L. Delcher"
+, title =       "Optimal Parallel Evaluation of Tree-Structured Computations by Raking"
+, booktitle =   "Proc. AWOC 88"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      319
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "101--110"
+, update =      "96.09 orourke"
 }
 
 @techreport{ksb-aagdp-97
-, author =	"S. R. Kosaraju and A. A. Sch{\"a}ffer and L. G. Biesecker"
-, title =	"Approximation Algorithms for a Genetic Diagnostics Problem"
-, type =	"Research {Report}"
-, institution =	"Center for Geometric Computing"
-, address =	"Johns Hopkins Univ."
-, year =	1997
-, update =	"97.03 tamassia"
+, author =      "S. R. Kosaraju and A. A. Sch{\"a}ffer and L. G. Biesecker"
+, title =       "Approximation Algorithms for a Genetic Diagnostics Problem"
+, type =        "Research {Report}"
+, institution = "Center for Geometric Computing"
+, address =     "Johns Hopkins Univ."
+, year =        1997
+, update =      "97.03 tamassia"
 }
 
 @book{k-tvs1-69
-, author =	"G. K{\"o}the"
-, title =	"Topological Vector Spaces {I}"
-, publisher =	"Springer-Verlag"
-, year =	1969
-, update =	"98.03 bibrelex"
+, author =      "G. K{\"o}the"
+, title =       "Topological Vector Spaces {I}"
+, publisher =   "Springer-Verlag"
+, year =        1969
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ks-sssj-97
-, author =	"N. Koudas and K. C. Sevcik"
-, title =	"Size separation spatial join"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1997
-, pages =	"324--335"
-, update =	"97.07 agarwal"
+, author =      "N. Koudas and K. C. Sevcik"
+, title =       "Size separation spatial join"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1997
+, pages =       "324--335"
+, update =      "97.07 agarwal"
 }
 
 @techreport{ko-fapd-82
-, author =	"N. Kouta and J. O'Rourke"
-, title =	"Fast algorithms for polygon decomposition"
-, type =	"Report"
-, number =	"JHU82-10"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1982
+, author =      "N. Kouta and J. O'Rourke"
+, title =       "Fast algorithms for polygon decomposition"
+, type =        "Report"
+, number =      "JHU82-10"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1982
 }
 
 @misc{kn-dgd-93
-, author =	"E. Koutsofios and S. North"
-, title =	"Drawing graphs with {\em dot}"
-, year =	1993
-, note =	"{\em dot} user's manual. \url{ftp.research.bell-labs.com/dist/drawdag/}"
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia"
+, author =      "E. Koutsofios and S. North"
+, title =       "Drawing graphs with {\em dot}"
+, year =        1993
+, note =        "{\em dot} user's manual. \url{ftp.research.bell-labs.com/dist/drawdag/}"
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia"
 }
 
 @techreport{kn-dgd-95
-, author =	"E. Koutsofios and S. North"
-, title =	"Drawing Graphs with {\em dot}"
-, institution =	"AT\&T Bell Laboratories, Murray Hill, NJ."
-, year =	1995
-, note =	"Available from \url{http://www.research.bell-labs.com/dist/drawdag}"
-, keywords =	"graph drawing, system"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "E. Koutsofios and S. North"
+, title =       "Drawing Graphs with {\em dot}"
+, institution = "AT\&T Bell Laboratories, Murray Hill, NJ."
+, year =        1995
+, note =        "Available from \url{http://www.research.bell-labs.com/dist/drawdag}"
+, keywords =    "graph drawing, system"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @inproceedings{k-grsmo-85
-, author =	"A. Koutsou"
-, title =	"A geometric reasoning system for moving an object while maintaining contact with others"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"67--74"
-, cites =	"hw-moc-84, hw-rmomp-84, k-srspm-84, lw-apcfp-79, m-cfccc-79, m-hct-78, p-smtsr-79, rt-mfcsg-78, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "A. Koutsou"
+, title =       "A geometric reasoning system for moving an object while maintaining contact with others"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "67--74"
+, cites =       "hw-moc-84, hw-rmomp-84, k-srspm-84, lw-apcfp-79, m-cfccc-79, m-hct-78, p-smtsr-79, rt-mfcsg-78, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{k-srspm-84
-, author =	"A. Koutsou"
-, title =	"A Spatial Reasoning System for Parts Mating Operations"
-, type =	"Working {Paper}"
-, number =	173
-, institution =	"Dept. Artif. Intell., Univ. Edinburgh"
-, address =	"Edingburgh, Scotland"
-, month =	oct
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "A. Koutsou"
+, title =       "A Spatial Reasoning System for Parts Mating Operations"
+, type =        "Working {Paper}"
+, number =      173
+, institution = "Dept. Artif. Intell., Univ. Edinburgh"
+, address =     "Edingburgh, Scotland"
+, month =       oct
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @techreport{k-oeupj-88
-, author =	"A. Koutsou"
-, title =	"Object exploration using a parallel-jaw gripper"
-, type =	"Technical {Report}"
-, number =	"MS-CIS-88-48"
-, institution =	"Grasp Lab, Univ. Pennsylvania"
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "A. Koutsou"
+, title =       "Object exploration using a parallel-jaw gripper"
+, type =        "Technical {Report}"
+, number =      "MS-CIS-88-48"
+, institution = "Grasp Lab, Univ. Pennsylvania"
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{kps-obp-90
-, author =	"E. Koutsoupias and C. H. Papadimitriou and M. Sideri"
-, title =	"On the optimal bisection of a polygon"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"198--202"
-, precedes =	"kps-obp-92"
-, cites =	"ps-bwgg-90, ps-coac-82, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "E. Koutsoupias and C. H. Papadimitriou and M. Sideri"
+, title =       "On the optimal bisection of a polygon"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "198--202"
+, precedes =    "kps-obp-92"
+, cites =       "ps-bwgg-90, ps-coac-82, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{kps-obp-92
-, author =	"Elias Koutsoupias and Christos H. Papadimitriou and Martha Sideri"
-, title =	"On the Optimal Bisection of a Polygon"
-, journal =	"ORSA J. Comput."
-, volume =	4
-, number =	4
-, year =	1992
-, pages =	"435--438"
-, succeeds =	"kps-obp-90"
-, update =	"98.03 mitchell"
-, annote =	"Special issue on computational geometry; J. Mitchell and
+, author =      "Elias Koutsoupias and Christos H. Papadimitriou and Martha Sideri"
+, title =       "On the Optimal Bisection of a Polygon"
+, journal =     "ORSA J. Comput."
+, volume =      4
+, number =      4
+, year =        1992
+, pages =       "435--438"
+, succeeds =    "kps-obp-90"
+, update =      "98.03 mitchell"
+, annote =      "Special issue on computational geometry; J. Mitchell and
                   J. Karel Lenstra, eds."
 }
 
 @article{kst-pkz-54
-, author =	"T. K{\H o}v{\'a}ri and V. T. S{ \'o}s and P. Tur{\'a}n"
-, title =	"On a problem of {K}. {Zarankiewicz}"
-, journal =	"Colloq. Math."
-, volume =	3
-, year =	1954
-, pages =	"50--57"
-, update =	"98.03 bibrelex"
+, author =      "T. K{\H o}v{\'a}ri and V. T. S{ \'o}s and P. Tur{\'a}n"
+, title =       "On a problem of {K}. {Zarankiewicz}"
+, journal =     "Colloq. Math."
+, volume =      3
+, year =        1954
+, pages =       "50--57"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ky-acdn-??
-, author =	"D. Kozen and C. K. Yap"
-, title =	"Algebraic cell decomposition in {NC}"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
+, author =      "D. Kozen and C. K. Yap"
+, title =       "Algebraic cell decomposition in {NC}"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
 }
 
 @techreport{k-apacl-94
-, author =	"B. van de Kraats"
-, title =	"Approximation of polygons with applications to circuit layout"
-, type =	"Report"
-, number =	"INF/SC-94-39"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "B. van de Kraats"
+, title =       "Approximation of polygons with applications to circuit layout"
+, type =        "Report"
+, number =      "INF/SC-94-39"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @incollection{kl-cwrfm-84
-, author =	"M. R. Kramer and J. van Leeuwen"
-, title =	"The Complexity of Wire-Routing and Finding Minimum Area Layouts for Arbitrary {VLSI} Circuits"
-, editor =	"Franco P. Preparata"
-, booktitle =	"VLSI Theory"
-, series =	"Adv. Comput. Res."
-, volume =	2
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1984
-, pages =	"129--146"
-, keywords =	"graph drawing"
-, update =	"01.04 icking, 93.09 tamassia"
+, author =      "M. R. Kramer and J. van Leeuwen"
+, title =       "The Complexity of Wire-Routing and Finding Minimum Area Layouts for Arbitrary {VLSI} Circuits"
+, editor =      "Franco P. Preparata"
+, booktitle =   "VLSI Theory"
+, series =      "Adv. Comput. Res."
+, volume =      2
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1984
+, pages =       "129--146"
+, keywords =    "graph drawing"
+, update =      "01.04 icking, 93.09 tamassia"
 }
 
 @inproceedings{kkm-llrwt-90
-, author =	"E. Kranakis and D. Krizanc and L. Meertens"
-, title =	"Link length of rectilinear watchman tours in grids"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"328--331"
-, cites =	"cn-owr-86, dls-oaclc-89, g-sncpg-77, h-ragp-90, lpsssstwy-clcsp-87, n-gwg-86, o-agta-87, s-pptld-86, s-agfnp-87, s-mlppr-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "E. Kranakis and D. Krizanc and L. Meertens"
+, title =       "Link length of rectilinear watchman tours in grids"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "328--331"
+, cites =       "cn-owr-86, dls-oaclc-89, g-sncpg-77, h-ragp-90, lpsssstwy-clcsp-87, n-gwg-86, o-agta-87, s-pptld-86, s-agfnp-87, s-mlppr-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{kku-ndvrg-95
-, author =	"E. Kranakis and D. Krizanc and J. Urrutia"
-, title =	"On the Number of Directions in Visibility Representations of Graphs"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"167--176"
-, keywords =	"graph drawing, visibility"
-, update =	"95.01 tamassia"
+, author =      "E. Kranakis and D. Krizanc and J. Urrutia"
+, title =       "On the Number of Directions in Visibility Representations of Graphs"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "167--176"
+, keywords =    "graph drawing, visibility"
+, update =      "95.01 tamassia"
 }
 
 @unpublished{kp-vil-90
-, author =	"E. Kranakis and M. Picchiola"
-, title =	"Visibility in integer lattices"
-, year =	1990
-, note =	"In Preparation"
-, update =	"97.11 bibrelex"
+, author =      "E. Kranakis and M. Picchiola"
+, title =       "Visibility in integer lattices"
+, year =        1990
+, note =        "In Preparation"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{kp-agpil-92
-, author =	"Evangelos Kranakis and Michel Pocchiola"
-, title =	"Art Gallery Problems in Integer Lattice Systems"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	29
-, update =	"00.03 bibrelex"
+, author =      "Evangelos Kranakis and Michel Pocchiola"
+, title =       "Art Gallery Problems in Integer Lattice Systems"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       29
+, update =      "00.03 bibrelex"
 }
 
 @article{kp-cpil-94
-, author =	"E. Kranakis and M. Pocchiola"
-, title =	"Camera placement in integer lattices"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, number =	1
-, month =	jul
-, year =	1994
-, pages =	"91--104"
-, keywords =	""
-, succeeds =	"kp-evpil-90"
-, update =	"96.05 pocchiola, 95.11 pocchiola"
+, author =      "E. Kranakis and M. Pocchiola"
+, title =       "Camera placement in integer lattices"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, number =      1
+, month =       jul
+, year =        1994
+, pages =       "91--104"
+, keywords =    ""
+, succeeds =    "kp-evpil-90"
+, update =      "96.05 pocchiola, 95.11 pocchiola"
 }
 
 @article{kp-cprdt-94
-, author =	"E. Kranakis and M. Pocchiola"
-, title =	"Counting problems relating to a {Dirichlet}'s theorem"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, number =	6
-, month =	dec
-, year =	1994
-, pages =	"309--325"
-, succeeds =	"kp-evpil-90"
-, update =	"96.05 pocchiola, 95.11 pocchiola"
+, author =      "E. Kranakis and M. Pocchiola"
+, title =       "Counting problems relating to a {Dirichlet}'s theorem"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, number =      6
+, month =       dec
+, year =        1994
+, pages =       "309--325"
+, succeeds =    "kp-evpil-90"
+, update =      "96.05 pocchiola, 95.11 pocchiola"
 }
 
 @techreport{kp-evpil-89
-, author =	"E. Kranakis and M. Pocchiola"
-, title =	"Enumeration and Visibility Problems in Integer Lattices"
-, type =	"Technical {Report}"
-, number =	13
-, institution =	"LIENS"
-, month =	dec
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "E. Kranakis and M. Pocchiola"
+, title =       "Enumeration and Visibility Problems in Integer Lattices"
+, type =        "Technical {Report}"
+, number =      13
+, institution = "LIENS"
+, month =       dec
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{kp-evpil-90
-, author =	"E. Kranakis and M. Pocchiola"
-, title =	"Enumeration and visibility problems in integer lattices"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"261--270"
-, cites =	"a-srcg-74, a-iant-76, bz-gi-88, cegsw-ccbac-88t, e-acg-87, e-irpnn-62, hs-pvnlp-71, hw-itn-79, k-sipan-59, k-sa-81, kp-evpil-89, kp-vil-90, m-pepfs-85, n-nt-83, n-edlde-48, o-agta-87, r-lent-64, r-??-60, r-svp-66, so-wcoac-86, st-epdg-83, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "E. Kranakis and M. Pocchiola"
+, title =       "Enumeration and visibility problems in integer lattices"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "261--270"
+, cites =       "a-srcg-74, a-iant-76, bz-gi-88, cegsw-ccbac-88t, e-acg-87, e-irpnn-62, hs-pvnlp-71, hw-itn-79, k-sipan-59, k-sa-81, kp-evpil-89, kp-vil-90, m-pepfs-85, n-nt-83, n-edlde-48, o-agta-87, r-lent-64, r-??-60, r-svp-66, so-wcoac-86, st-epdg-83, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ks-aools-97
-, author =	"Evangelos Kranakis and Anthony Spatharis"
-, title =	"Almost Optimal On-line Search in Unknown Streets"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"93--99"
-, update =	"98.11 bibrelex, 97.11 jones"
+, author =      "Evangelos Kranakis and Anthony Spatharis"
+, title =       "Almost Optimal On-line Search in Unknown Streets"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "93--99"
+, update =      "98.11 bibrelex, 97.11 jones"
 }
 
 @inproceedings{ku-itsns-95
-, author =	"Evangelos Kranakis and Jorge Urrutia"
-, title =	"Isomorphic Triangulations with Small Number of {Steiner} Points"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"291--296"
-, update =	"95.09 jones"
+, author =      "Evangelos Kranakis and Jorge Urrutia"
+, title =       "Isomorphic Triangulations with Small Number of {Steiner} Points"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "291--296"
+, update =      "95.09 jones"
 }
 
 @article{kkmnsu-sgr-97
-, author =	"E. Kranankis and D. Krizanc and A. Maheshwari and M. Noy and J.-R. Sack and J. Urrutia"
-, title =	"Stage-graph representations"
-, journal =	"Discrete Applied Mathematic"
-, volume =	75
-, number =	1
-, year =	1997
-, pages =	"71--80"
-, update =	"97.11 sack"
+, author =      "E. Kranankis and D. Krizanc and A. Maheshwari and M. Noy and J.-R. Sack and J. Urrutia"
+, title =       "Stage-graph representations"
+, journal =     "Discrete Applied Mathematic"
+, volume =      75
+, number =      1
+, year =        1997
+, pages =       "71--80"
+, update =      "97.11 sack"
 }
 
 @proceedings{k-gd-99
-, title =	"Graph Drawing (Proc. GD~'99)"
-, editor =	"J. Kratochv{\'\i}l"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1731
-, publisher =	"Springer-Verlag"
-, year =	1999
-, update =	"00.03 vismara"
+, title =       "Graph Drawing (Proc. GD~'99)"
+, editor =      "J. Kratochv{\'\i}l"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1731
+, publisher =   "Springer-Verlag"
+, year =        1999
+, update =      "00.03 vismara"
 }
 
 @article{kln-ncstl-91
-, author =	"J. Kratochvil and A. Lubiw and J. Ne{\v s}et{\v r}il"
-, title =	"Non-crossing subgraphs in topological layouts"
-, journal =	"SIAM J. Discrete Math."
-, volume =	4
-, year =	1991
-, pages =	"223--244"
-, update =	"97.11 bibrelex"
+, author =      "J. Kratochvil and A. Lubiw and J. Ne{\v s}et{\v r}il"
+, title =       "Non-crossing subgraphs in topological layouts"
+, journal =     "SIAM J. Discrete Math."
+, volume =      4
+, year =        1991
+, pages =       "223--244"
+, update =      "97.11 bibrelex"
 }
 
 @article{km-igs-94
-, author =	"J. Kratochv{\'\i}l and J. Matou{\v s}ek"
-, title =	"Intersection graphs of segments"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	35
-, number =	2
-, year =	1994
-, pages =	"317--339"
-, update =	"95.01 matousek"
+, author =      "J. Kratochv{\'\i}l and J. Matou{\v s}ek"
+, title =       "Intersection graphs of segments"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      35
+, number =      2
+, year =        1994
+, pages =       "317--339"
+, update =      "95.01 matousek"
 }
 
 @article{km-sgrhr-91
-, author =	"J. Kratochv{\'\i}l and J. Matou{\v s}ek"
-, title =	"String graphs requiring huge representations"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	31
-, number =	1
-, year =	1991
-, pages =	"1--4"
-, comments =	"Shows that there are n-vertex graphs representable as
+, author =      "J. Kratochv{\'\i}l and J. Matou{\v s}ek"
+, title =       "String graphs requiring huge representations"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      31
+, number =      1
+, year =        1991
+, pages =       "1--4"
+, comments =    "Shows that there are n-vertex graphs representable as
 intersection graphs of curves in the plane, such that in any representation
 some 2 curves cross exponentially many times."
-, update =	"95.01 matousek"
+, update =      "95.01 matousek"
 }
 
 @article{kn-iscpi-90
-, author =	"J. Kratochvil and J. Ne{\v s}et{\v r}il"
-, title =	"Independend set and clique problems in intersection-defined classes of graphs"
-, journal =	"Comment. Math. Univ. Carol."
-, volume =	31
-, year =	1990
-, pages =	"85--93"
-, update =	"97.11 bibrelex"
+, author =      "J. Kratochvil and J. Ne{\v s}et{\v r}il"
+, title =       "Independend set and clique problems in intersection-defined classes of graphs"
+, journal =     "Comment. Math. Univ. Carol."
+, volume =      31
+, year =        1990
+, pages =       "85--93"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ksl-pcdcv-97
-, author =	"F.-L. Krause and C. Stiel and J. Luddermann"
-, title =	"Processing of {CAD}-data-conversion, verification and repair"
-, booktitle =	"Proc. 4th ACM Sympos. Solid Modeling"
-, site =	"Atlanta, GA"
-, year =	1997
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "F.-L. Krause and C. Stiel and J. Luddermann"
+, title =       "Processing of {CAD}-data-conversion, verification and repair"
+, booktitle =   "Proc. 4th ACM Sympos. Solid Modeling"
+, site =        "Atlanta, GA"
+, year =        1997
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{kp-sstma-90
-, author =	"D. Kravets and J. K. Park"
-, title =	"Selection and sorting in totally monotone arrays"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"494--502"
+, author =      "D. Kravets and J. K. Park"
+, title =       "Selection and sorting in totally monotone arrays"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "494--502"
 }
 
 @book{kn-mmpep-77
-, author =	"M. G. Krein and A. A. Nudel'man"
-, title =	"The {Markov} moment problem and extremal problems"
-, publisher =	"American Mathematical Society"
-, year =	1977
+, author =      "M. G. Krein and A. A. Nudel'man"
+, title =       "The {Markov} moment problem and extremal problems"
+, publisher =   "American Mathematical Society"
+, year =        1977
 }
 
 @phdthesis{k-nrdsc-92
-, author =	"M. J. van Kreveld"
-, title =	"New Results on Data Structures in Computational Geometry"
-, type =	"Ph.{D}. Dissertation"
-, school =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"97.07 agarwal, 94.05 schwarzkopf"
+, author =      "M. J. van Kreveld"
+, title =       "New Results on Data Structures in Computational Geometry"
+, type =        "Ph.{D}. Dissertation"
+, school =      "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "97.07 agarwal, 94.05 schwarzkopf"
 }
 
 @article{kb-fsrsp-91
-, author =	"M. J. van Kreveld and M. T. de Berg"
-, title =	"Finding squares and rectangles in sets of points"
-, journal =	"BIT"
-, volume =	31
-, year =	1991
-, pages =	"202--219"
+, author =      "M. J. van Kreveld and M. T. de Berg"
+, title =       "Finding squares and rectangles in sets of points"
+, journal =     "BIT"
+, volume =      31
+, year =        1991
+, pages =       "202--219"
 }
 
 @techreport{ko-cst-88
-, author =	"M. J. van Kreveld and M. H. Overmars"
-, title =	"Concatenable segment trees"
-, number =	"RUU-CS-88-36"
-, institution =	"Computer Science Department, Univ. of Utrecht"
-, address =	"Utrecht, Netherlands"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "M. J. van Kreveld and M. H. Overmars"
+, title =       "Concatenable segment trees"
+, number =      "RUU-CS-88-36"
+, institution = "Computer Science Department, Univ. of Utrecht"
+, address =     "Utrecht, Netherlands"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ko-csdp-90
-, author =	"Marc J. van Kreveld and Mark H. Overmars"
-, title =	"Concatenable Structures for Decomposable Problems"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	15
-, update =	"00.03 bibrelex"
+, author =      "Marc J. van Kreveld and Mark H. Overmars"
+, title =       "Concatenable Structures for Decomposable Problems"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       15
+, update =      "00.03 bibrelex"
 }
 
 @article{ko-dkdt-91
-, author =	"M. J. van Kreveld and M. H. Overmars"
-, title =	"Divided $k$-d trees"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"840--858"
+, author =      "M. J. van Kreveld and M. H. Overmars"
+, title =       "Divided $k$-d trees"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "840--858"
 }
 
 @inproceedings{koa-iqsd-90i
-, author =	"M. J. van Kreveld and M. H. Overmars and P. K. Agarwal"
-, title =	"Intersection queries in sets of disks"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"393--403"
+, author =      "M. J. van Kreveld and M. H. Overmars and P. K. Agarwal"
+, title =       "Intersection queries in sets of disks"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "393--403"
 }
 
 @inproceedings{k-att-97
-, author =	"M. van Kreveld"
-, title =	"Algorithms for triangulated terrains"
-, booktitle =	"Proc. XXIV-th SOFSEM"
-, series =	"Lecture Notes Comput. Sci."
-, number =	1338
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"19--36"
-, update =	"98.07 oostrum"
+, author =      "M. van Kreveld"
+, title =       "Algorithms for triangulated terrains"
+, booktitle =   "Proc. XXIV-th SOFSEM"
+, series =      "Lecture Notes Comput. Sci."
+, number =      1338
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "19--36"
+, update =      "98.07 oostrum"
 }
 
 @incollection{k-demta-97
-, author =	"M. van Kreveld"
-, title =	"Digital elevation models and {TIN} algorithms"
-, editor =	"M. van Kreveld and J. Nievergelt and T. Roos and P. Widmayer"
-, booktitle =	"Algorithmic Foundations of Geographic Information Systems"
-, series =	"Lecture Notes Comput. Sci."
-, number =	1340
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"37--78"
-, update =	"99.11 bibrelex, 98.07 oostrum"
+, author =      "M. van Kreveld"
+, title =       "Digital elevation models and {TIN} algorithms"
+, editor =      "M. van Kreveld and J. Nievergelt and T. Roos and P. Widmayer"
+, booktitle =   "Algorithmic Foundations of Geographic Information Systems"
+, series =      "Lecture Notes Comput. Sci."
+, number =      1340
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "37--78"
+, update =      "99.11 bibrelex, 98.07 oostrum"
 }
 
 @inproceedings{k-emied-94
-, author =	"M. van Kreveld"
-, title =	"Efficient methods for isoline extraction from a digital elevation model based on triangulated irregular networks"
-, booktitle =	"Proc. 6th Internat. Sympos. Spatial Data Handling"
-, publisher =	"Taylor \& Francis"
-, year =	1994
-, pages =	"835--847"
-, note =	"to appear in: {\em Int.\ J. on GIS}"
-, keywords =	"isolines, contours, interval tree, polyhedral terrains"
-, update =	"96.09 kreveld"
+, author =      "M. van Kreveld"
+, title =       "Efficient methods for isoline extraction from a digital elevation model based on triangulated irregular networks"
+, booktitle =   "Proc. 6th Internat. Sympos. Spatial Data Handling"
+, publisher =   "Taylor \& Francis"
+, year =        1994
+, pages =       "835--847"
+, note =        "to appear in: {\em Int.\ J. on GIS}"
+, keywords =    "isolines, contours, interval tree, polyhedral terrains"
+, update =      "96.09 kreveld"
 }
 
 @article{k-emiet-96
-, author =	"M. van Kreveld"
-, title =	"Efficient methods for isoline extraction from a {TIN}"
-, journal =	"Internat. J. of GIS"
-, volume =	10
-, year =	1996
-, pages =	"523--540"
-, update =	"98.07 bibrelex+oostrum"
+, author =      "M. van Kreveld"
+, title =       "Efficient methods for isoline extraction from a {TIN}"
+, journal =     "Internat. J. of GIS"
+, volume =      10
+, year =        1996
+, pages =       "523--540"
+, update =      "98.07 bibrelex+oostrum"
 }
 
 @techreport{k-fpfcu-93t
-, author =	"M. van Kreveld"
-, title =	"On fat partitioning, fat covering and the union size of polygons"
-, type =	"Technical Report"
-, number =	"SOCS-93.2"
-, institution =	"School of Computer Science, McGill University"
-, year =	1993
-, precedes =	"k-fpfcu-98, k-fpfcu-93"
-, update =	"98.11 bibrelex"
+, author =      "M. van Kreveld"
+, title =       "On fat partitioning, fat covering and the union size of polygons"
+, type =        "Technical Report"
+, number =      "SOCS-93.2"
+, institution = "School of Computer Science, McGill University"
+, year =        1993
+, precedes =    "k-fpfcu-98, k-fpfcu-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{k-fpfcu-93
-, author =	"Marc van Kreveld"
-, title =	"On Fat Partitioning, Fat Covering, and the Union Size of Polygons"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"452--463"
-, succeeds =	"k-fpfcu-93t"
-, precedes =	"k-fpfcu-98"
-, update =	"98.11 bibrelex, 98.03 mitchell, 95.01 smid, 93.09 smid, 93.05 jones"
+, author =      "Marc van Kreveld"
+, title =       "On Fat Partitioning, Fat Covering, and the Union Size of Polygons"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "452--463"
+, succeeds =    "k-fpfcu-93t"
+, precedes =    "k-fpfcu-98"
+, update =      "98.11 bibrelex, 98.03 mitchell, 95.01 smid, 93.09 smid, 93.05 jones"
 }
 
 @article{k-fpfcu-98
-, author =	"Marc van Kreveld"
-, title =	"On Fat Partitioning, Fat Covering, and the Union Size of Polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, number =	4
-, year =	1998
-, pages =	"197--210"
-, issn =	"0925-7721"
-, succeeds =	"k-fpfcu-93t, k-fpfcu-93"
-, update =	"98.11 bibrelex, 98.03 mitchell"
+, author =      "Marc van Kreveld"
+, title =       "On Fat Partitioning, Fat Covering, and the Union Size of Polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, number =      4
+, year =        1998
+, pages =       "197--210"
+, issn =        "0925-7721"
+, succeeds =    "k-fpfcu-93t, k-fpfcu-93"
+, update =      "98.11 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{k-qppt-94
-, author =	"M. van Kreveld"
-, title =	"On Quality Paths in Polyhedral Terrains"
-, booktitle =	"Proc. IGIS'94: Geographic Information Systems"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	884
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"113--122"
-, keywords =	"shortest paths, polyhedral terrains"
-, update =	"96.09 kreveld"
+, author =      "M. van Kreveld"
+, title =       "On Quality Paths in Polyhedral Terrains"
+, booktitle =   "Proc. IGIS'94: Geographic Information Systems"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      884
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "113--122"
+, keywords =    "shortest paths, polyhedral terrains"
+, update =      "96.09 kreveld"
 }
 
 @techreport{k-ppp-92
-, author =	"M. van Kreveld"
-, title =	"The power of parallel projection"
-, type =	"Report"
-, number =	"RUU-CS-92-17"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1992
-, update =	"94.05 schwarzkopf, 94.01 smid"
+, author =      "M. van Kreveld"
+, title =       "The power of parallel projection"
+, type =        "Report"
+, number =      "RUU-CS-92-17"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1992
+, update =      "94.05 schwarzkopf, 94.01 smid"
 }
 
 @article{k-ppp-93
-, author =	"M. van Kreveld"
-, title =	"The power of parallel projection"
-, journal =	"Inform. Process. Lett."
-, volume =	46
-, year =	1993
-, pages =	"185--191"
-, succeeds =	"k-ppp-92"
-, update =	"97.11 bibrelex, 94.01 smid"
+, author =      "M. van Kreveld"
+, title =       "The power of parallel projection"
+, journal =     "Inform. Process. Lett."
+, volume =      46
+, year =        1993
+, pages =       "185--191"
+, succeeds =    "k-ppp-92"
+, update =      "97.11 bibrelex, 94.01 smid"
 }
 
 @inproceedings{k-vsaec-96
-, author =	"M. van Kreveld"
-, title =	"Variations on sweep algorithms: efficient computation of extended viewsheds and classifications"
-, booktitle =	"Proc. 7th Internat. Sympos. Spatial Data Handling"
-, year =	1996
-, pages =	"13A.15--13A.27"
-, update =	"98.07 oostrum"
+, author =      "M. van Kreveld"
+, title =       "Variations on sweep algorithms: efficient computation of extended viewsheds and classifications"
+, booktitle =   "Proc. 7th Internat. Sympos. Spatial Data Handling"
+, year =        1996
+, pages =       "13A.15--13A.27"
+, update =      "98.07 oostrum"
 }
 
 @inproceedings{kko-pcbss-95
-, author =	"Marc van Kreveld and Berto van de Kraats and Mark Overmars"
-, title =	"Printed Circuit Board Simplification: {Simplifying} Subdivisions in Practice"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C30--C31"
-, keywords =	"polygon simplification, decimation"
-, cites =	"abb-amps-91, bks-nass-95, be-mgot-95, cmwms-feps-93, elosu-scqp-92, ghms-apsml-93, h-patmn-93, k-apacl-94, ZZZ"
-, update =	"98.07 icking, 98.03 bibrelex, 95.09 mitchell"
+, author =      "Marc van Kreveld and Berto van de Kraats and Mark Overmars"
+, title =       "Printed Circuit Board Simplification: {Simplifying} Subdivisions in Practice"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C30--C31"
+, keywords =    "polygon simplification, decimation"
+, cites =       "abb-amps-91, bks-nass-95, be-mgot-95, cmwms-feps-93, elosu-scqp-92, ghms-apsml-93, h-patmn-93, k-apacl-94, ZZZ"
+, update =      "98.07 icking, 98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{kobps-ctsss-97
-, author =	"M. van Kreveld and R. van Oostrum and C. Bajaj and V. Pascucci and D. Schikore"
-, title =	"Contour Trees and Small Seed Sets for Isosurface Traversal"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"212--220"
-, cites =	"amo-nftaa-93, afh-tdie3-81, bps-fiii-96, bcd-auhsm-95, cmps-oieiv-96, bk-tawfg-93, db-dcghs-94, fm-scmgt-67, gc-sontr-86, h-dt-76, hb-mpaic-94, ik-aipue-95, kk-ettfe-94, lsj-noiea-96, m-mt-63, ps-cgi-85, r-slpsd-46, sk-crgac-91, skk-scbmt-91, sc-aipta-86, tisku-aeccp-95, k-emiet-96, w-cgads-92, wv-ofig-92, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "M. van Kreveld and R. van Oostrum and C. Bajaj and V. Pascucci and D. Schikore"
+, title =       "Contour Trees and Small Seed Sets for Isosurface Traversal"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "212--220"
+, cites =       "amo-nftaa-93, afh-tdie3-81, bps-fiii-96, bcd-auhsm-95, cmps-oieiv-96, bk-tawfg-93, db-dcghs-94, fm-scmgt-67, gc-sontr-86, h-dt-76, hb-mpaic-94, ik-aipue-95, kk-ettfe-94, lsj-noiea-96, m-mt-63, ps-cgi-85, r-slpsd-46, sk-crgac-91, skk-scbmt-91, sc-aipta-86, tisku-aeccp-95, k-emiet-96, w-cgads-92, wv-ofig-92, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{kos-essid-97
-, author =	"M. van Kreveld and R. van Oostrum and J. Snoeyink"
-, title =	"Efficient settlement selection for interactive display"
-, booktitle =	"Proc. Auto-Carto 13: ACSM/ASPRS Annual Convention Technical Papers"
-, year =	1997
-, pages =	"287--296"
-, update =	"98.07 oostrum"
+, author =      "M. van Kreveld and R. van Oostrum and J. Snoeyink"
+, title =       "Efficient settlement selection for interactive display"
+, booktitle =   "Proc. Auto-Carto 13: ACSM/ASPRS Annual Convention Technical Papers"
+, year =        1997
+, pages =       "287--296"
+, update =      "98.07 oostrum"
 }
 
 @article{ko-ucsds-93
-, author =	"M. van Kreveld and M. Overmars"
-, title =	"Union-Copy Structures and Dynamic Segment Trees"
-, journal =	"J. ACM"
-, volume =	40
-, year =	1993
-, pages =	"635--652"
-, keywords =	"union-find, data structures, dynamic segment trees"
-, update =	"96.09 kreveld"
+, author =      "M. van Kreveld and M. Overmars"
+, title =       "Union-Copy Structures and Dynamic Segment Trees"
+, journal =     "J. ACM"
+, volume =      40
+, year =        1993
+, pages =       "635--652"
+, keywords =    "union-find, data structures, dynamic segment trees"
+, update =      "96.09 kreveld"
 }
 
 @techreport{koa-iqsd-90t
-, author =	"M. van Kreveld and M. Overmars and P. K. Agarwal"
-, title =	"Intersection Queries in Sets of Disks"
-, type =	"Technical {Report}"
-, number =	"90-26"
-, institution =	"DIMACS, Rutgers Univ."
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "M. van Kreveld and M. Overmars and P. K. Agarwal"
+, title =       "Intersection Queries in Sets of Disks"
+, type =        "Technical {Report}"
+, number =      "90-26"
+, institution = "DIMACS, Rutgers Univ."
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @article{koa-iqsd-92
-, author =	"M. van Kreveld and M. Overmars and P. K. Agarwal"
-, title =	"Intersection queries in sets of disks"
-, journal =	"BIT"
-, volume =	32
-, year =	1992
-, pages =	"268--279"
-, keywords =	"disks, partition trees, intersection"
-, succeeds =	"koa-iqsd-90i"
-, update =	"96.09 kreveld"
+, author =      "M. van Kreveld and M. Overmars and P. K. Agarwal"
+, title =       "Intersection queries in sets of disks"
+, journal =     "BIT"
+, volume =      32
+, year =        1992
+, pages =       "268--279"
+, keywords =    "disks, partition trees, intersection"
+, succeeds =    "koa-iqsd-90i"
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{ksw-frit-93
-, author =	"M. van Kreveld and J. Snoeyink and S. Whitesides"
-, title =	"Folding rulers inside triangles"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"1--6"
-, cites =	"hjw-mp2dl-84, hjw-mra2d-85, jp-crmpq-85, k-mslra-92, kk-namra-86, lw-tpio-91, lw-rltm-92, lw-rcpce-95, w-aigpl-92, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "M. van Kreveld and J. Snoeyink and S. Whitesides"
+, title =       "Folding rulers inside triangles"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "1--6"
+, cites =       "hjw-mp2dl-84, hjw-mra2d-85, jp-crmpq-85, k-mslra-92, kk-namra-86, lw-tpio-91, lw-rltm-92, lw-rcpce-95, w-aigpl-92, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{ksw-frit-96
-, author =	"M. van Kreveld and J. Snoeyink and S. Whitesides"
-, title =	"Folding rulers inside triangles"
-, journal =	"Discrete Comput. Geom."
-, volume =	15
-, year =	1996
-, pages =	"265--285"
-, keywords =	"rulers, linkages, reconfiguration"
-, succeeds =	"ksw-frit-93"
-, update =	"96.09 kreveld"
+, author =      "M. van Kreveld and J. Snoeyink and S. Whitesides"
+, title =       "Folding rulers inside triangles"
+, journal =     "Discrete Comput. Geom."
+, volume =      15
+, year =        1996
+, pages =       "265--285"
+, keywords =    "rulers, linkages, reconfiguration"
+, succeeds =    "ksw-frit-93"
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{kbs-csamc-91
-, author =	"H.-P. Kriegel and T. Brinkhoff and R. Schneider"
-, title =	"The Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systems"
-, booktitle =	"Proc. 2rd Sympos. Advances in Spatial Databases"
-, series =	"Lecture Notes Comput. Sci."
-, number =	525
-, year =	1991
-, pages =	"5--21"
-, update =	"96.09 kreveld"
+, author =      "H.-P. Kriegel and T. Brinkhoff and R. Schneider"
+, title =       "The Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systems"
+, booktitle =   "Proc. 2rd Sympos. Advances in Spatial Databases"
+, series =      "Lecture Notes Comput. Sci."
+, number =      525
+, year =        1991
+, pages =       "5--21"
+, update =      "96.09 kreveld"
 }
 
 @techreport{kmo-iftme-85
-, author =	"H.-P. Kriegel and R. Mannss and M. H. Overmars"
-, title =	"The inverted file tree machine: efficient multi-key retrieval for {VLSI}"
-, type =	"Report"
-, number =	"RUU-CS-85-8"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1985
-, update =	"94.05 schwarzkopf"
+, author =      "H.-P. Kriegel and R. Mannss and M. H. Overmars"
+, title =       "The inverted file tree machine: efficient multi-key retrieval for {VLSI}"
+, type =        "Report"
+, number =      "RUU-CS-85-8"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1985
+, update =      "94.05 schwarzkopf"
 }
 
 @inproceedings{ks-erigm-90
-, author =	"H.-P. Kriegel and M. Schiwietz"
-, title =	"{Eine} effiziente und robuste {Indexstruktur} f{\"u}r gro{\ss}e {Mengen} polygonaler {Objekte}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	16
-, update =	"00.03 bibrelex"
+, author =      "H.-P. Kriegel and M. Schiwietz"
+, title =       "{Eine} effiziente und robuste {Indexstruktur} f{\"u}r gro{\ss}e {Mengen} polygonaler {Objekte}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       16
+, update =      "00.03 bibrelex"
 }
 
 @incollection{ks-moplh-86
-, author =	"H.-P. Kriegel and B. Seeger"
-, title =	"Multidimensional order preserving linear hashing with partial expansions"
-, booktitle =	"Proc. Intl. Conf. on Database Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	243
-, publisher =	"Springer-Verlag"
-, year =	1986
-, pages =	"203--220"
-, update =	"97.07 agarwal"
+, author =      "H.-P. Kriegel and B. Seeger"
+, title =       "Multidimensional order preserving linear hashing with partial expansions"
+, booktitle =   "Proc. Intl. Conf. on Database Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      243
+, publisher =   "Springer-Verlag"
+, year =        1986
+, pages =       "203--220"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{kv-nodts-81
-, author =	"H. P. Kriegel and V. K. Vaishnavi"
-, title =	"A nearly optimal dynamic tree structure for partial-match queries with time-varying access frequencies"
-, booktitle =	"Proc. 1981 Conf. Inform. Sci. Systems"
-, publisher =	"Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1981
-, pages =	"??"
+, author =      "H. P. Kriegel and V. K. Vaishnavi"
+, title =       "A nearly optimal dynamic tree structure for partial-match queries with time-varying access frequencies"
+, booktitle =   "Proc. 1981 Conf. Inform. Sci. Systems"
+, publisher =   "Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1981
+, pages =       "??"
 }
 
 @inproceedings{kv-wmbtu-81
-, author =	"H. P. Kriegel and V. K. Vaishnavi"
-, title =	"Weighted multidimensional $b$-trees used as nearly optimal dynamic dictionaries"
-, booktitle =	"Proc. 10th Internat. Sympos. Math. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	118
-, publisher =	"Springer-Verlag"
-, year =	1981
-, pages =	"410--417"
+, author =      "H. P. Kriegel and V. K. Vaishnavi"
+, title =       "Weighted multidimensional $b$-trees used as nearly optimal dynamic dictionaries"
+, booktitle =   "Proc. 10th Internat. Sympos. Math. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      118
+, publisher =   "Springer-Verlag"
+, year =        1981
+, pages =       "410--417"
 }
 
 @article{k-cspps-92
-, author =	"D. J. Kriegman"
-, title =	"Computing stable poses of piecewise smooth objects"
-, journal =	"CVGIP: Image Understanding"
-, volume =	55
-, number =	2
-, month =	mar
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "D. J. Kriegman"
+, title =       "Computing stable poses of piecewise smooth objects"
+, journal =     "CVGIP: Image Understanding"
+, volume =      55
+, number =      2
+, month =       mar
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{k-arssi-90
-, author =	"G. A. Kriezis"
-, title =	"Algorithms for Rational Spline Surface Intersections"
-, type =	"Ph.{D}. Thesis"
-, school =	"Massachusetts Institute of Technology"
-, address =	"Cambridge, Massachusetts"
-, year =	1990
-, keywords =	"doctoral thesis"
-, update =	"95.05 abrams"
+, author =      "G. A. Kriezis"
+, title =       "Algorithms for Rational Spline Surface Intersections"
+, type =        "Ph.{D}. Thesis"
+, school =      "Massachusetts Institute of Technology"
+, address =     "Cambridge, Massachusetts"
+, year =        1990
+, keywords =    "doctoral thesis"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{kp-rpsi-91
-, author =	"G. A. Kriezis and N. M. Patrikalakis"
-, title =	"Rational Polynomial Surface Intersections"
-, editor =	"G. A. Gabriele"
-, booktitle =	"Proc. 17th ASME Design Automation Conference"
-, volume =	"II"
-, year =	1991
-, pages =	"43--53"
-, update =	"95.05 abrams"
+, author =      "G. A. Kriezis and N. M. Patrikalakis"
+, title =       "Rational Polynomial Surface Intersections"
+, editor =      "G. A. Gabriele"
+, booktitle =   "Proc. 17th ASME Design Automation Conference"
+, volume =      "II"
+, year =        1991
+, pages =       "43--53"
+, update =      "95.05 abrams"
 }
 
 @article{kpw-tdems-92
-, author =	"G. A. Kriezis and N. M. Patrikalakis and F.-E. Wolter"
-, title =	"Topological and Differential Equation Methods for Surface Intersections"
-, journal =	"Comput. Aided Design"
-, volume =	24
-, number =	1
-, year =	1992
-, pages =	"41--55"
-, update =	"95.05 abrams"
+, author =      "G. A. Kriezis and N. M. Patrikalakis and F.-E. Wolter"
+, title =       "Topological and Differential Equation Methods for Surface Intersections"
+, journal =     "Comput. Aided Design"
+, volume =      24
+, number =      1
+, year =        1992
+, pages =       "41--55"
+, update =      "95.05 abrams"
 }
 
 @article{kpp-miasr-90
-, author =	"G. A. Kriezis and P. V. Prakash and N. M. Patrikalakis"
-, title =	"A Method for Intersecting Algebraic Surfaces with Rational Polynomial Patches"
-, journal =	"Comput. Aided Design"
-, volume =	22
-, number =	10
-, year =	1990
-, pages =	"645--654"
-, update =	"95.05 abrams"
+, author =      "G. A. Kriezis and P. V. Prakash and N. M. Patrikalakis"
+, title =       "A Method for Intersecting Algebraic Surfaces with Rational Polynomial Patches"
+, journal =     "Comput. Aided Design"
+, volume =      22
+, number =      10
+, year =        1990
+, pages =       "645--654"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{k-mpnte-95
-, author =	"J. Kripac"
-, title =	"A mechanism for persistently naming topological entities in history-based parametric solid models"
-, booktitle =	"Proc. 3rd ACM Symposium on Solid Modeling and Applications"
-, site =	"Salt Lake City, UT"
-, month =	may
-, year =	1995
-, update =	"98.07 bibrelex"
+, author =      "J. Kripac"
+, title =       "A mechanism for persistently naming topological entities in history-based parametric solid models"
+, booktitle =   "Proc. 3rd ACM Symposium on Solid Modeling and Applications"
+, site =        "Salt Lake City, UT"
+, month =       may
+, year =        1995
+, update =      "98.07 bibrelex"
 }
 
 @techreport{kw-mgf-85
-, author =	"R. Krishnamurthy and K.-Y. Wang"
-, title =	"Multilevel grid files"
-, type =	"Tech.\ Report"
-, institution =	"IBM T. J. Watson Center"
-, address =	"Yorktown Heights, NY"
-, year =	1985
-, update =	"97.07 agarwal"
+, author =      "R. Krishnamurthy and K.-Y. Wang"
+, title =       "Multilevel grid files"
+, type =        "Tech.\ Report"
+, institution = "IBM T. J. Watson Center"
+, address =     "Yorktown Heights, NY"
+, year =        1985
+, update =      "97.07 agarwal"
 }
 
 @techreport{km-esiab-94
-, author =	"S. Krishnan and D. Manocha"
-, title =	"An efficient surface intersection algorithm based on the lower dimensional formulation"
-, type =	"Technical {Report}"
-, number =	"TR94-062"
-, institution =	"Dept. Comput. Sci., Univ. North Carolina"
-, address =	"Chapel Hill, NC"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "S. Krishnan and D. Manocha"
+, title =       "An efficient surface intersection algorithm based on the lower dimensional formulation"
+, type =        "Technical {Report}"
+, number =      "TR94-062"
+, institution = "Dept. Comput. Sci., Univ. North Carolina"
+, address =     "Chapel Hill, NC"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @techreport{knm-bscbc-94
-, author =	"S. Krishnan and A. Narkhede and D. Manocha"
-, title =	"Boole: {A} system to compute boolean combinations of sculptured solids"
-, type =	"Technical {Report}"
-, number =	"TR95-008"
-, institution =	"Dept. Comput. Sci., Univ. North Carolina"
-, address =	"Chapel Hill, NC"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "S. Krishnan and A. Narkhede and D. Manocha"
+, title =       "Boole: {A} system to compute boolean combinations of sculptured solids"
+, type =        "Technical {Report}"
+, number =      "TR95-008"
+, institution = "Dept. Comput. Sci., Univ. North Carolina"
+, address =     "Chapel Hill, NC"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{knm-rcbcs-95
-, author =	"Shankar Krishnan and Atul Narkhede and Dinesh Manocha"
-, title =	"Representation and Computation of Boolean Combinations of Sculptured Models"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C8--C9"
-, keywords =	"CSG"
-, cites =	"h-gsm-89, km-esiab-94, knm-bscbc-94, s-lpchm-90, s-sfira-91, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Shankar Krishnan and Atul Narkhede and Dinesh Manocha"
+, title =       "Representation and Computation of Boolean Combinations of Sculptured Models"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C8--C9"
+, keywords =    "CSG"
+, cites =       "h-gsm-89, km-esiab-94, knm-bscbc-94, s-lpchm-90, s-sfira-91, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{kplm-sshob-98
-, author =	"S. Krishnan and A. Pattekar and M. Lin and D. Manocha"
-, title =	"Spherical Shells: {A} Higher Order Bounding Volume for Fast Proximity Queries"
-, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
-, nickname =	"WAFR '98"
-, year =	1998
-, pages =	"to appear"
-, url =	"https://www.cs.unc.edu/~dm/collision.html"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "S. Krishnan and A. Pattekar and M. Lin and D. Manocha"
+, title =       "Spherical Shells: {A} Higher Order Bounding Volume for Fast Proximity Queries"
+, booktitle =   "Proc. 3rd Workshop Algorithmic Found. Robot."
+, nickname =    "WAFR '98"
+, year =        1998
+, pages =       "to appear"
+, url = "https://www.cs.unc.edu/~dm/collision.html"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{kk-ppsva-88
-, author =	"R. P. Krishnaswamy and C. E. Kim"
-, title =	"Problems of posting sentries: variations of the {Art} {Gallery} {Theorem}"
-, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	318
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"74--85"
+, author =      "R. P. Krishnaswamy and C. E. Kim"
+, title =       "Problems of posting sentries: variations of the {Art} {Gallery} {Theorem}"
+, booktitle =   "Proc. 1st Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      318
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "74--85"
 }
 
 @inproceedings{krsv-vprma-96
-, author =	"K. Krithivasan and A. Rema and S. Schirra and P. I. Vijaykumar"
-, title =	"Velocity planning for a robot moving along the shortest straight line path among moving obstacles"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"149--154"
-, update =	"96.09 mitchell"
+, author =      "K. Krithivasan and A. Rema and S. Schirra and P. I. Vijaykumar"
+, title =       "Velocity planning for a robot moving along the shortest straight line path among moving obstacles"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "149--154"
+, update =      "96.09 mitchell"
 }
 
 @article{ks-maptr-01
-, author =	"K. Krithivasan and V. Srilakshmi"
-, title =	"Minimum area polygons with two reflex angles enclosing {$k$} points"
-, journal =	"Internat. J. Comput. Math."
-, volume =	78
-, year =	2001
-, comments =	"to appear"
-, update =	"01.04 smid"
+, author =      "K. Krithivasan and V. Srilakshmi"
+, title =       "Minimum area polygons with two reflex angles enclosing {$k$} points"
+, journal =     "Internat. J. Comput. Math."
+, volume =      78
+, year =        2001
+, comments =    "to appear"
+, update =      "01.04 smid"
 }
 
 @techreport{kvd-lhrtd-92
-, author =	"K. Krithivasan and R. Vanisree and A. Datta"
-, title =	"The largest hyper-rectangle in a three dimensional orthogonal polyhedron"
-, type =	"Report"
-, number =	"MPI-I-92-123"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
+, author =      "K. Krithivasan and R. Vanisree and A. Datta"
+, title =       "The largest hyper-rectangle in a three dimensional orthogonal polyhedron"
+, type =        "Report"
+, number =      "MPI-I-92-123"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
 }
 
 @inproceedings{km-cmsvc-85
-, author =	"M. Kriv{\'a}nek and J. Mor{\'a}vek"
-, title =	"Clustering to minimize the sum of volumes of convex hulls of clusters is {NP}-complete"
-, editor =	"L. Budach"
-, booktitle =	"Proc. Found. Comput. Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	199
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"234--241"
+, author =      "M. Kriv{\'a}nek and J. Mor{\'a}vek"
+, title =       "Clustering to minimize the sum of volumes of convex hulls of clusters is {NP}-complete"
+, editor =      "L. Budach"
+, booktitle =   "Proc. Found. Comput. Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      199
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "234--241"
 }
 
 @article{k-geatd-82
-, author =	"L. Kronecker"
-, title =	"{Grundz{\"u}ge} einer arithmetischen {Theorie} der algebraischen {Gr{\"o}{\ss}e}"
-, journal =	"Crelle J."
-, volume =	92
-, year =	1882
-, pages =	"1--122"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "L. Kronecker"
+, title =       "{Grundz{\"u}ge} einer arithmetischen {Theorie} der algebraischen {Gr{\"o}{\ss}e}"
+, journal =     "Crelle J."
+, volume =      92
+, year =        1882
+, pages =       "1--122"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{kc-ecntm-00
-, author =	"Boris Kronrod and Craig Cotsman"
-, title =	"Efficient Coding of Non-Triangular Meshes"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"24--26"
-, update =	"00.03 bibrelex"
+, author =      "Boris Kronrod and Craig Cotsman"
+, title =       "Efficient Coding of Non-Triangular Meshes"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "24--26"
+, update =      "00.03 bibrelex"
 }
 
 @article{k-isasm-82
-, author =	"J. K. Krouse"
-, title =	"Industry gets serious about solid modeling"
-, journal =	"Computer Aided Engineering"
-, volume =	1
-, year =	1982
-, pages =	"22--26"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "J. K. Krouse"
+, title =       "Industry gets serious about solid modeling"
+, journal =     "Computer Aided Engineering"
+, volume =      1
+, year =        1982
+, pages =       "22--26"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @phdthesis{k-ippvt-92
-, author =	"J. Krozel"
-, title =	"Intelligent Path Prediction for Vehicular Travel"
-, type =	"Ph.{D}. Thesis"
-, school =	"Purdue Univ."
-, address =	"W. Lafayette, IN"
-, month =	may
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "J. Krozel"
+, title =       "Intelligent Path Prediction for Vehicular Travel"
+, type =        "Ph.{D}. Thesis"
+, school =      "Purdue Univ."
+, address =     "W. Lafayette, IN"
+, month =       may
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @article{ka-ippvt-93
-, author =	"J. Krozel and D. Andrisani"
-, title =	"Intelligent Path Prediction for Vehicular Travel"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	23
-, year =	1993
-, pages =	"478--487"
-, keywords =	"path prediction, gradient field representation, generalized cost criteria, path similarity"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "J. Krozel and D. Andrisani"
+, title =       "Intelligent Path Prediction for Vehicular Travel"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      23
+, year =        1993
+, pages =       "478--487"
+, keywords =    "path prediction, gradient field representation, generalized cost criteria, path similarity"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @phdthesis{k-darp-85
-, author =	"F. Krueger"
-, title =	"$d$-Arrangements and random polyhedra"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. of Operations Research, Stanford University"
-, year =	1985
-, keywords =	"arrangements, face counting, Zaslavski's formulas, duality"
+, author =      "F. Krueger"
+, title =       "$d$-Arrangements and random polyhedra"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. of Operations Research, Stanford University"
+, year =        1985
+, keywords =    "arrangements, face counting, Zaslavski's formulas, duality"
 }
 
 @book{k-eukav-52
-, author =	"W. Krull"
-, title =	"Elementare und klassische {Algebra} vom modernen {Standpunkt}, Part I"
-, publisher =	"DeGruyter"
-, address =	"Berlin, Germany"
-, year =	1952
-, update =	"97.11 bibrelex"
+, author =      "W. Krull"
+, title =       "Elementare und klassische {Algebra} vom modernen {Standpunkt}, Part I"
+, publisher =   "DeGruyter"
+, address =     "Berlin, Germany"
+, year =        1952
+, update =      "97.11 bibrelex"
 }
 
 @book{k-eukav-59
-, author =	"W. Krull"
-, title =	"Elementare und klassische {Algebra} vom modernen {Standpunkt}, Part II"
-, publisher =	"DeGruyter"
-, address =	"Berlin, Germany"
-, year =	1959
-, update =	"97.11 bibrelex"
+, author =      "W. Krull"
+, title =       "Elementare und klassische {Algebra} vom modernen {Standpunkt}, Part II"
+, publisher =   "DeGruyter"
+, address =     "Berlin, Germany"
+, year =        1959
+, update =      "97.11 bibrelex"
 }
 
 @article{krs-ctepa-90
-, author =	"C. Kruskal and L. Rudolph and M. Snir"
-, title =	"A complexity theory of efficient parallel algorithms"
-, journal =	"Theoret. Comput. Sci."
-, volume =	71
-, year =	1990
-, pages =	"95--132"
-, update =	"96.09 orourke"
+, author =      "C. Kruskal and L. Rudolph and M. Snir"
+, title =       "A complexity theory of efficient parallel algorithms"
+, journal =     "Theoret. Comput. Sci."
+, volume =      71
+, year =        1990
+, pages =       "95--132"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{krs-ppp-85
-, author =	"C. P. Kruskal and L. Rudolph and M. Snir"
-, title =	"The Power of Parallel Prefix"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, year =	1985
-, pages =	"180--185"
-, update =	"97.11 bibrelex"
+, author =      "C. P. Kruskal and L. Rudolph and M. Snir"
+, title =       "The Power of Parallel Prefix"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, year =        1985
+, pages =       "180--185"
+, update =      "97.11 bibrelex"
 }
 
 @article{krs-ppp-85a
-, author =	"C. P. Kruskal and L. Rudolph and M. Snir"
-, title =	"The power of parallel prefix"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-34"
-, year =	1985
-, pages =	"965--968"
-, update =	"97.11 bibrelex"
+, author =      "C. P. Kruskal and L. Rudolph and M. Snir"
+, title =       "The power of parallel prefix"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-34"
+, year =        1985
+, pages =       "965--968"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ks-dnd-80
-, author =	"J. B. Kruskal and J. B. Seery"
-, title =	"Designing Network Diagrams"
-, booktitle =	"Proc. First General Conference on Social Graphics"
-, publisher =	"U. S. Department of the Census"
-, year =	1980
-, pages =	"22--50"
-, keywords =	"graph drawing, physical simulation, force-directed"
-, update =	"95.05 tamassia"
+, author =      "J. B. Kruskal and J. B. Seery"
+, title =       "Designing Network Diagrams"
+, booktitle =   "Proc. First General Conference on Social Graphics"
+, publisher =   "U. S. Department of the Census"
+, year =        1980
+, pages =       "22--50"
+, keywords =    "graph drawing, physical simulation, force-directed"
+, update =      "95.05 tamassia"
 }
 
 @article{k-sssgt-56
-, author =	"J. B. {Kruskal, Jr.}"
-, title =	"On the shortest spanning subtree of a graph and the traveling salesman problem"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	7
-, year =	1956
-, pages =	"48--50"
+, author =      "J. B. {Kruskal, Jr.}"
+, title =       "On the shortest spanning subtree of a graph and the traveling salesman problem"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      7
+, year =        1956
+, pages =       "48--50"
 }
 
 @article{ks-nhovd-94
-, author =	"J. W. Krussel and B. F. Schaudt"
-, title =	"A note on higher order {Voronoi} diagrams"
-, journal =	"Nordic J. Comput."
-, volume =	1
-, year =	1994
-, pages =	"268--272"
-, update =	"95.01 smid"
+, author =      "J. W. Krussel and B. F. Schaudt"
+, title =       "A note on higher order {Voronoi} diagrams"
+, journal =     "Nordic J. Comput."
+, volume =      1
+, year =        1994
+, pages =       "268--272"
+, update =      "95.01 smid"
 }
 
 @phdthesis{k-phcmw-97
-, author =	"D. Krznaric"
-, title =	"Progress in Hierarchical Clustering \& Minimum Weight Triangulation"
-, type =	"Ph.{D}. Thesis"
-, school =	"Department of Computer Science, Lund University"
-, address =	"Lund, Sweden"
-, year =	1997
-, keywords =	"doctoral thesis"
-, update =	"01.11 smid"
+, author =      "D. Krznaric"
+, title =       "Progress in Hierarchical Clustering \& Minimum Weight Triangulation"
+, type =        "Ph.{D}. Thesis"
+, school =      "Department of Computer Science, Lund University"
+, address =     "Lund, Sweden"
+, year =        1997
+, keywords =    "doctoral thesis"
+, update =      "01.11 smid"
 }
 
 @inproceedings{kl-ctqlb-95
-, author =	"Drago Krznaric and Christos Levcopoulos"
-, title =	"Computing a Threaded Quadtree (with Links between Neighbours) from the {Delaunay} Triangulation in Linear Time"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"187--192"
-, update =	"95.09 jones"
+, author =      "Drago Krznaric and Christos Levcopoulos"
+, title =       "Computing a Threaded Quadtree (with Links between Neighbours) from the {Delaunay} Triangulation in Linear Time"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "187--192"
+, update =      "95.09 jones"
 }
 
 @incollection{kl-chcem-95
-, author =	"D. Krznaric and C. Levcopoulos"
-, title =	"Computing hierarchies of clusters from the {Euclidean} minimum spanning tree in linear time"
-, booktitle =	"Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1026
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"443--455"
-, update =	"96.01 smid"
+, author =      "D. Krznaric and C. Levcopoulos"
+, title =       "Computing hierarchies of clusters from the {Euclidean} minimum spanning tree in linear time"
+, booktitle =   "Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1026
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "443--455"
+, update =      "96.01 smid"
 }
 
 @article{kl-faclc-98
-, author =	"D. Krznaric and C. Levcopoulos"
-, title =	"Fast Algorithms for Complete Linkage Clustering"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"131--145"
-, update =	"01.11 smid"
+, author =      "D. Krznaric and C. Levcopoulos"
+, title =       "Fast Algorithms for Complete Linkage Clustering"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "131--145"
+, update =      "01.11 smid"
 }
 
 @inproceedings{kl-fsacl-95
-, author =	"Drago Krznaric and Christos Levcopoulos"
-, title =	"The First Subquadratic Algorithm for Complete Linkage Clustering"
-, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1004
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"392--401"
-, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
+, author =      "Drago Krznaric and Christos Levcopoulos"
+, title =       "The First Subquadratic Algorithm for Complete Linkage Clustering"
+, booktitle =   "Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1004
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "392--401"
+, update =      "98.07 bibrelex, 96.01 smid, 95.09 mitchell"
 }
 
 @inproceedings{kln-mstd-97
-, author =	"D. Krznaric and C. Levcopoulos and Bengt J. Nilsson"
-, title =	"Minimum Spanning Trees in {$d$} Dimensions"
-, booktitle =	"Proc. 5th Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1284
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"341--349"
-, url =	"http://www.dna.lth.se/home/Drago_Krznaric/mst.ps"
-, update =	"98.03 mitchell"
+, author =      "D. Krznaric and C. Levcopoulos and Bengt J. Nilsson"
+, title =       "Minimum Spanning Trees in {$d$} Dimensions"
+, booktitle =   "Proc. 5th Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1284
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "341--349"
+, url = "http://www.dna.lth.se/home/Drago_Krznaric/mst.ps"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{k-tmkrs-84
-, author =	"D. T. Kuan"
-, title =	"Terrain Map knowledge representation for spatial planning"
-, booktitle =	"The 1st IEEE Conference of Artificial Intelligence Applications"
-, month =	dec
-, year =	1984
-, pages =	"578--584"
-, keywords =	"feature-based planning, weighted region problem, hierarchical planning"
+, author =      "D. T. Kuan"
+, title =       "Terrain Map knowledge representation for spatial planning"
+, booktitle =   "The 1st IEEE Conference of Artificial Intelligence Applications"
+, month =       dec
+, year =        1984
+, pages =       "578--584"
+, keywords =    "feature-based planning, weighted region problem, hierarchical planning"
 }
 
 @inproceedings{kzb-ndfsp-85
-, author =	"D. T. Kuan and J. C. Zamiska and R. A. Brooks"
-, title =	"Natural Decomposition of Free Space for Path Planning"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"St. Louis, MO"
-, month =	mar
-, year =	1985
-, pages =	"168--173"
-, update =	"93.09 milone+mitchell"
+, author =      "D. T. Kuan and J. C. Zamiska and R. A. Brooks"
+, title =       "Natural Decomposition of Free Space for Path Planning"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "St. Louis, MO"
+, month =       mar
+, year =        1985
+, pages =       "168--173"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{kmps-eagpp-93
-, author =	"L. Ku{\v c}era and K. Mehlhorn and B. Preis and E. Schwarzenecker"
-, title =	"Exact algorithms for a geometric packing problem"
-, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	665
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"317--322"
-, update =	"93.05 smid"
+, author =      "L. Ku{\v c}era and K. Mehlhorn and B. Preis and E. Schwarzenecker"
+, title =       "Exact algorithms for a geometric packing problem"
+, booktitle =   "Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      665
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "317--322"
+, update =      "93.05 smid"
 }
 
 @inproceedings{kww-aotlc-89
-, author =	"R. Kuchem and D. Wagner and F. Wagner"
-, title =	"Area-Optimal Three-Layer Channel Routing"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"506--511"
-, update =	"97.03 gaertner+salinger"
+, author =      "R. Kuchem and D. Wagner and F. Wagner"
+, title =       "Area-Optimal Three-Layer Channel Routing"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "506--511"
+, update =      "97.03 gaertner+salinger"
 }
 
 @incollection{k-irt-88
-, author =	"R. Kuchkuda"
-, title =	"An introduction to ray tracing"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"1039--1060"
-, update =	"99.11 bibrelex"
+, author =      "R. Kuchkuda"
+, title =       "An introduction to ray tracing"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "1039--1060"
+, update =      "99.11 bibrelex"
 }
 
 @article{k-hmap-55
-, author =	"H. Kuhn"
-, title =	"The {Hungarian} method for the assignment problem"
-, journal =	"Naval Res. Logist. Q."
-, volume =	2
-, year =	1955
-, pages =	"83--97"
-, update =	"97.11 bibrelex"
+, author =      "H. Kuhn"
+, title =       "The {Hungarian} method for the assignment problem"
+, journal =     "Naval Res. Logist. Q."
+, volume =      2
+, year =        1955
+, pages =       "83--97"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{k-rpavd-98
-, author =	"Ulrich K{\"u}hn"
-, title =	"A Randomized Parallel Algorithm for {Voronoi} Diagrams based on Symmetric Convex Distance Functions"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"109--111"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Ulrich K{\"u}hn"
+, title =       "A Randomized Parallel Algorithm for {Voronoi} Diagrams based on Symmetric Convex Distance Functions"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "109--111"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{k-cvduc-96
-, author =	"Ulrich K{\"u}hn"
-, title =	"Computing {Voronoi} Diagrams Using Convex Sweep Curves"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"41--44"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Ulrich K{\"u}hn"
+, title =       "Computing {Voronoi} Diagrams Using Convex Sweep Curves"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "41--44"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{kl-cdtls-88
-, author =	"W. K{\"u}hnel and G. Lassmann"
-, title =	"Combinatorial $d$-tori with a large symmetry group"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"169--176"
+, author =      "W. K{\"u}hnel and G. Lassmann"
+, title =       "Combinatorial $d$-tori with a large symmetry group"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "169--176"
 }
 
 @article{k-acpr-79
-, author =	"G. Kulcsar"
-, title =	"Algorithm to cover polygons by rectangles"
-, journal =	"Comput. Aided Data Preparation Pattern Generator Cont."
-, volume =	30
-, year =	1979
-, pages =	"161--167"
+, author =      "G. Kulcsar"
+, title =       "Algorithm to cover polygons by rectangles"
+, journal =     "Comput. Aided Data Preparation Pattern Generator Cont."
+, volume =      30
+, year =        1979
+, pages =       "161--167"
 }
 
 @book{km-nasc-83
-, title =	"A new approach to scientific computation"
-, editor =	"U. Kulisch and W. L. Miranker"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1983
-, update =	"98.03 bibrelex"
+, title =       "A new approach to scientific computation"
+, editor =      "U. Kulisch and W. L. Miranker"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1983
+, update =      "98.03 bibrelex"
 }
 
 @book{km-catp-81
-, author =	"U. Kulisch and W. L. Miranker"
-, title =	"Computer Arithmetic in Theory and Practice"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1981
-, update =	"98.03 bibrelex"
+, author =      "U. Kulisch and W. L. Miranker"
+, title =       "Computer Arithmetic in Theory and Practice"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1981
+, update =      "98.03 bibrelex"
 }
 
 @article{kd-asplm-96
-, author =	"Prashant Kulkarni and Deba Dutta"
-, title =	"An accurate slicing procedure for layered manufacturing"
-, journal =	"Comput. Aided Design"
-, volume =	28
-, number =	9
-, year =	1996
-, pages =	"683--697"
-, update =	"98.03 mitchell"
+, author =      "Prashant Kulkarni and Deba Dutta"
+, title =       "An accurate slicing procedure for layered manufacturing"
+, journal =     "Comput. Aided Design"
+, volume =      28
+, number =      9
+, year =        1996
+, pages =       "683--697"
+, update =      "98.03 mitchell"
 }
 
 @article{kry-ldstsw-96
-, author =	"S. Kuller and B. Raghavachari and N. Young"
-, title =	"Low-Degree Spanning Tree of small Weight"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, year =	1996
-, update =	"02.03 cheong"
+, author =      "S. Kuller and B. Raghavachari and N. Young"
+, title =       "Low-Degree Spanning Tree of small Weight"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, update =      "02.03 cheong"
 }
 
 @inproceedings{kv-swtwv-93
-, author =	"P. Kumar and C. {Veni Madhavan}"
-, title =	"Shortest watchman tours in weak visibility polygons"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"91--96"
-, cites =	"p-wvrp-90, cn-swrsp-, cn-owr-88, thi-iacsw-91, ZZZ"
-, update =	"98.11 bibrelex, 94.09 lambert, 93.09 milone+mitchell"
+, author =      "P. Kumar and C. {Veni Madhavan}"
+, title =       "Shortest watchman tours in weak visibility polygons"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "91--96"
+, cites =       "p-wvrp-90, cn-swrsp-, cn-owr-88, thi-iacsw-91, ZZZ"
+, update =      "98.11 bibrelex, 94.09 lambert, 93.09 milone+mitchell"
 }
 
 @inproceedings{kk-rers-99
-, author =	"Ravi Kumar and D. Sivakumar"
-, title =	"Roundness Estimation via Random Sampling"
-, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1999
-, pages =	"603--612"
-, update =	"99.03 agarwal"
+, author =      "Ravi Kumar and D. Sivakumar"
+, title =       "Roundness Estimation via Random Sampling"
+, booktitle =   "Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1999
+, pages =       "603--612"
+, update =      "99.03 agarwal"
 }
 
 @article{kkbs-p3dpv-92
-, author =	"S. Kumar and S. K. Kurtz and J. R. Banavar and M. G. Sharma"
-, title =	"Properties of a 3-Dimensional {Poisson}-{Voronoi} Tessellation: a {Monte}-{Carlo} Study"
-, journal =	"Journal Of Statistical Physics"
-, volume =	67
-, number =	"3--4"
-, year =	1992
-, pages =	"523--551"
+, author =      "S. Kumar and S. K. Kurtz and J. R. Banavar and M. G. Sharma"
+, title =       "Properties of a 3-Dimensional {Poisson}-{Voronoi} Tessellation: a {Monte}-{Carlo} Study"
+, journal =     "Journal Of Statistical Physics"
+, volume =      67
+, number =      "3--4"
+, year =        1992
+, pages =       "523--551"
 }
 
 @inproceedings{km-dmgps-96
-, author =	"S. Kumar and D. Manocha"
-, title =	"Dynamic mesh generation for parametric surfaces"
-, booktitle =	"5th Internat. Conf. Numerical Grid Generation in Computational Fluid Dynamics and Related Fields"
-, site =	"Starkville, MS"
-, year =	1996
-, update =	"97.11 bibrelex"
+, author =      "S. Kumar and D. Manocha"
+, title =       "Dynamic mesh generation for parametric surfaces"
+, booktitle =   "5th Internat. Conf. Numerical Grid Generation in Computational Fluid Dynamics and Related Fields"
+, site =        "Starkville, MS"
+, year =        1996
+, update =      "97.11 bibrelex"
 }
 
 @article{km-ertns-95
-, author =	"S. Kumar and D. Manocha"
-, title =	"Efficient rendering of trimmed {NURBS} surfaces"
-, journal =	"Comput. Aided Design"
-, volume =	27
-, number =	7
-, month =	jul
-, year =	1995
-, pages =	"509--521"
-, update =	"97.11 bibrelex"
+, author =      "S. Kumar and D. Manocha"
+, title =       "Efficient rendering of trimmed {NURBS} surfaces"
+, journal =     "Comput. Aided Design"
+, volume =      27
+, number =      7
+, month =       jul
+, year =        1995
+, pages =       "509--521"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{km-idlst-94
-, author =	"S. Kumar and D. Manocha"
-, title =	"Interactive display of large scale trimmed {NURBS} models"
-, type =	"Technical {Report}"
-, number =	"TR94-008"
-, institution =	"Dept. Comput. Sci., Univ. North Carolina"
-, year =	1994
-, update =	"97.11 bibrelex"
+, author =      "S. Kumar and D. Manocha"
+, title =       "Interactive display of large scale trimmed {NURBS} models"
+, type =        "Technical {Report}"
+, number =      "TR94-008"
+, institution = "Dept. Comput. Sci., Univ. North Carolina"
+, year =        1994
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{km-pcfds-96
-, author =	"Suboth Kumar and Dinesh Manocha"
-, title =	"The power of coherence: fast tessellation of surfaces"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"V15--V16"
-, cites =	"c-tsplt-91a, c-farps-79, ctv-flvat-89, f-cscag-93, k-rtpp-82, km-idlst-94, km-ertns-95, km-dmgps-96, lc-rtns-93, lcwb-slmdp-80, rhd-rtrts-89, s-sfira-91, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Suboth Kumar and Dinesh Manocha"
+, title =       "The power of coherence: fast tessellation of surfaces"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "V15--V16"
+, cites =       "c-tsplt-91a, c-farps-79, ctv-flvat-89, f-cscag-93, k-rtpp-82, km-idlst-94, km-ertns-95, km-dmgps-96, lc-rtns-93, lcwb-slmdp-80, rhd-rtrts-89, s-sfira-91, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{kmgl-bfcpc-97
-, author =	"S. Kumar and D. Manocha and W. Garret and M. Lin"
-, title =	"Back-Face Computation of Polygon Clusters"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"487--488"
-, keywords =	"video review"
-, cites =	"bv-vbcd-95, c-hgmvs-76, c-sacg-77, dk-fdpi-82, fkn-vsgpt-80, kmgl-hbfc-96, nns-nshsp-72, sbgs-sacgi-69, sss-cthsa-74, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "S. Kumar and D. Manocha and W. Garret and M. Lin"
+, title =       "Back-Face Computation of Polygon Clusters"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "487--488"
+, keywords =    "video review"
+, cites =       "bv-vbcd-95, c-hgmvs-76, c-sacg-77, dk-fdpi-82, fkn-vsgpt-80, kmgl-hbfc-96, nns-nshsp-72, sbgs-sacgi-69, sss-cthsa-74, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{kmgl-hbfc-96
-, author =	"S. Kumar and D. Manocha and B. Garrett and M. Lin"
-, title =	"Hierarchical back-face culling"
-, booktitle =	"Proc. 7th Eurographics Workshop on Rendering"
-, site =	"Porto, Portugal"
-, year =	1996
-, pages =	"231--240"
-, update =	"98.07 bibrelex"
+, author =      "S. Kumar and D. Manocha and B. Garrett and M. Lin"
+, title =       "Hierarchical back-face culling"
+, booktitle =   "Proc. 7th Eurographics Workshop on Rendering"
+, site =        "Porto, Portugal"
+, year =        1996
+, pages =       "231--240"
+, update =      "98.07 bibrelex"
 }
 
 @article{kmgl-hbfc-99
-, author =	"S. Kumar and D. Manocha and W. Garrett and M. Lin"
-, title =	"Hierarchical Back-face Computation"
-, journal =	"Comput. \& Graphics"
-, volume =	23
-, number =	5
-, month =	oct
-, year =	1999
-, pages =	"681--692"
-, update =	"00.03 held"
+, author =      "S. Kumar and D. Manocha and W. Garrett and M. Lin"
+, title =       "Hierarchical Back-face Computation"
+, journal =     "Comput. \& Graphics"
+, volume =      23
+, number =      5
+, month =       oct
+, year =        1999
+, pages =       "681--692"
+, update =      "00.03 held"
 }
 
 @article{kml-idlnm-96
-, author =	"S. Kumar and D. Manocha and A. Lastra"
-, title =	"Interactive display of large {NURBS} models"
-, journal =	"IEEE Trans. on Visualization and Computer Graphics"
-, volume =	2
-, year =	1996
-, pages =	"323--336"
-, update =	"98.11 bibrelex, 97.03 tamassia"
+, author =      "S. Kumar and D. Manocha and A. Lastra"
+, title =       "Interactive display of large {NURBS} models"
+, journal =     "IEEE Trans. on Visualization and Computer Graphics"
+, volume =      2
+, year =        1996
+, pages =       "323--336"
+, update =      "98.11 bibrelex, 97.03 tamassia"
 }
 
 @article{kr-icmmb-89
-, author =	"V. K. P. Kumar and D. I. Reisis"
-, title =	"Image Computations on Meshes with Multiple Broadcast"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	11
-, year =	1989
-, pages =	"1194--1201"
-, update =	"98.07 bibrelex"
+, author =      "V. K. P. Kumar and D. I. Reisis"
+, title =       "Image Computations on Meshes with Multiple Broadcast"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      11
+, year =        1989
+, pages =       "1194--1201"
+, update =      "98.07 bibrelex"
 }
 
 @article{klp-fmsv-75
-, author =	"H. T. Kung and F. Luccio and F. P. Preparata"
-, title =	"On Finding the Maxima of a Set of Vectors"
-, journal =	"J. ACM"
-, volume =	22
-, year =	1975
-, pages =	"469--476"
-, update =	"93.09 milone+mitchell"
+, author =      "H. T. Kung and F. Luccio and F. P. Preparata"
+, title =       "On Finding the Maxima of a Set of Vectors"
+, journal =     "J. ACM"
+, volume =      22
+, year =        1975
+, pages =       "469--476"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{k-cgrgf-90
-, author =	"J. P. S. Kung"
-, title =	"Combinatorial geometries representable over {$GF(3)$} and {$FG(q)$}, {I}: {The} number of points"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"83--95"
+, author =      "J. P. S. Kung"
+, title =       "Combinatorial geometries representable over {$GF(3)$} and {$FG(q)$}, {I}: {The} number of points"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "83--95"
 }
 
 @techreport{kwr-gvdps-97
-, author =	"Richard Kunze and Franz-Erich Wolter and Thomas Rausch"
-, title =	"Geodesic {Voronoi} Diagrams on Parametric Surfaces"
-, number =	2
-, institution =	"Welfen Laboratory, Universit{\"a}t Hannover"
-, month =	jul
-, year =	1997
-, url =	"http://www-c.informatik.uni-hannover.de"
-, keywords =	"Voronoi diagram, parametric surface, geodesics on surfaces"
-, update =	"98.03 mitchell"
-, annote =	"Appeared in IEEE Computer Society Press Conference
+, author =      "Richard Kunze and Franz-Erich Wolter and Thomas Rausch"
+, title =       "Geodesic {Voronoi} Diagrams on Parametric Surfaces"
+, number =      2
+, institution = "Welfen Laboratory, Universit{\"a}t Hannover"
+, month =       jul
+, year =        1997
+, url = "http://www-c.informatik.uni-hannover.de"
+, keywords =    "Voronoi diagram, parametric surface, geodesics on surfaces"
+, update =      "98.03 mitchell"
+, annote =      "Appeared in IEEE Computer Society Press Conference
                   Proceedings of the Computer Graphics International
                   1997 conference, pp. 230--237, June 1997"
 }
 
 @article{kk-dlpcb-90
-, author =	"G. Kuperberg and W. Kuperberg"
-, title =	"Double-lattice packings of convex bodies in the plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"389--397"
+, author =      "G. Kuperberg and W. Kuperberg"
+, title =       "Double-lattice packings of convex bodies in the plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "389--397"
 }
 
 @techreport{k-dwp-90
-, author =	"W. Kuperberg"
-, title =	"{DIMACS} Workshop on Polytopes"
-, institution =	"Rutgers University"
-, month =	jan
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "W. Kuperberg"
+, title =       "{DIMACS} Workshop on Polytopes"
+, institution = "Rutgers University"
+, month =       jan
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @techreport{k-epcg-79
-, author =	"Y. S. Kupitz"
-, title =	"Extremal problems in combinatorial geometry"
-, type =	"Aarhus {University} {Lecture} {Notes} {Series}"
-, number =	53
-, institution =	"Aarhus University"
-, address =	"Aarhus, Denmark"
-, year =	1979
-, update =	"98.03 bibrelex"
+, author =      "Y. S. Kupitz"
+, title =       "Extremal problems in combinatorial geometry"
+, type =        "Aarhus {University} {Lecture} {Notes} {Series}"
+, number =      53
+, institution = "Aarhus University"
+, address =     "Aarhus, Denmark"
+, year =        1979
+, update =      "98.03 bibrelex"
 }
 
 @article{k-ggst-92
-, author =	"Y. S. Kupitz"
-, title =	"On a generalization of the {Gallai}-{Sylvester} theorem"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"87--106"
+, author =      "Y. S. Kupitz"
+, title =       "On a generalization of the {Gallai}-{Sylvester} theorem"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "87--106"
 }
 
 @book{km-st-76
-, author =	"K. Kuratowski and A. Mostowski"
-, title =	"Set Theory"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, the Netherlands"
-, year =	1976
-, update =	"98.11 bibrelex"
+, author =      "K. Kuratowski and A. Mostowski"
+, title =       "Set Theory"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, the Netherlands"
+, year =        1976
+, update =      "98.11 bibrelex"
 }
 
 @article{kt-ltldp-92
-, author =	"K. Kuroda and H. Tanemura"
-, title =	"Limit-Theorem and Large Deviation Principle for the {Voronoi} Tessellation Generated by a {Gibbs} Point Process"
-, journal =	"Adv. Appl. Probab."
-, volume =	24
-, number =	1
-, year =	1992
-, pages =	"45--70"
+, author =      "K. Kuroda and H. Tanemura"
+, title =       "Limit-Theorem and Large Deviation Principle for the {Voronoi} Tessellation Generated by a {Gibbs} Point Process"
+, journal =     "Adv. Appl. Probab."
+, volume =      24
+, number =      1
+, year =        1992
+, pages =       "45--70"
 }
 
 @article{kd-pamm-82
-, author =	"Y. Kurozumi and W. A. Davis"
-, title =	"Polygonal approximation by the minimax method"
-, journal =	"Comput. Graph. Image Process."
-, volume =	19
-, year =	1982
-, pages =	"248--264"
+, author =      "Y. Kurozumi and W. A. Davis"
+, title =       "Polygonal approximation by the minimax method"
+, journal =     "Comput. Graph. Image Process."
+, volume =      19
+, year =        1982
+, pages =       "248--264"
 }
 
 @inproceedings{kn-afrmt-97
-, author =	"Yoshiyuki Kusakari and Takao Nishizeki"
-, title =	"An Algorithm for Finding a Region with the Minimum Total {$L_1$}-Distance from Prescibed Terminals"
-, booktitle =	"Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '97"
-, site =	"Singapore"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1350
-, publisher =	"Springer-Verlag"
-, month =	dec
-, year =	1997
-, pages =	"324--333"
-, update =	"00.11 smid, 00.07 icking, 99.11 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 mitchell"
+, author =      "Yoshiyuki Kusakari and Takao Nishizeki"
+, title =       "An Algorithm for Finding a Region with the Minimum Total {$L_1$}-Distance from Prescibed Terminals"
+, booktitle =   "Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '97"
+, site =        "Singapore"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1350
+, publisher =   "Springer-Verlag"
+, month =       dec
+, year =        1997
+, pages =       "324--333"
+, update =      "00.11 smid, 00.07 icking, 99.11 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 mitchell"
 }
 
 @article{ksn-spppo-99
-, author =	"Y. Kusakari and H. Suzuki and T. Nishizeki"
-, title =	"A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, year =	1999
-, pages =	"151--170"
-, update =	"99.07 smid"
+, author =      "Y. Kusakari and H. Suzuki and T. Nishizeki"
+, title =       "A Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, year =        1999
+, pages =       "151--170"
+, update =      "99.07 smid"
 }
 
 @inproceedings{ksn-fsppp-95
-, author =	"Yoshiyuki Kusakari and Hitoshi Suzuki and Takao Nishizeki"
-, title =	"Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas"
-, booktitle =	"Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1004
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"42--51"
-, update =	"98.07 bibrelex, 96.01 smid, 95.09 mitchell"
+, author =      "Yoshiyuki Kusakari and Hitoshi Suzuki and Takao Nishizeki"
+, title =       "Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas"
+, booktitle =   "Proc. 6th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1004
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "42--51"
+, update =      "98.07 bibrelex, 96.01 smid, 95.09 mitchell"
 }
 
 @inproceedings{kor-esann-98
-, author =	"E. Kushilevitz and R. Ostrovsky and Y. Rabani"
-, title =	"Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces"
-, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
-, year =	1998
-, pages =	"to appear"
-, update =	"98.03 mitchell"
+, author =      "E. Kushilevitz and R. Ostrovsky and Y. Rabani"
+, title =       "Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces"
+, booktitle =   "Proc. 30th Annu. ACM Sympos. Theory Comput."
+, year =        1998
+, pages =       "to appear"
+, update =      "98.03 mitchell"
 }
 
 @phdthesis{k-cmppl-92
-, author =	"J. Kutcher"
-, title =	"Coordinated motion planning of planar linkages"
-, school =	"Johns Hopkins University"
-, year =	1992
-, keywords =	"doctoral thesis"
+, author =      "J. Kutcher"
+, title =       "Coordinated motion planning of planar linkages"
+, school =      "Johns Hopkins University"
+, year =        1992
+, keywords =    "doctoral thesis"
 }
 
 @inproceedings{kms-spafa-85
-, author =	"B. C. Kuttner and D. S. Majcher and P. B. Snedecor"
-, title =	"Systematic Processing: {An} Approach to Fully Automatic {NC} Tool Path Generation"
-, booktitle =	"Proceedings of Autofact '85 Conference"
-, month =	nov
-, year =	1985
-, pages =	"18--22"
-, update =	"98.03 bibrelex"
+, author =      "B. C. Kuttner and D. S. Majcher and P. B. Snedecor"
+, title =       "Systematic Processing: {An} Approach to Fully Automatic {NC} Tool Path Generation"
+, booktitle =   "Proceedings of Autofact '85 Conference"
+, month =       nov
+, year =        1985
+, pages =       "18--22"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ks-agtpu-86
-, author =	"B. Kutzler and S. Stifter"
-, title =	"Automated geometry theorem proving using {Buchberger}'s algorithm"
-, booktitle =	"SYMSAC '86"
-, site =	"Waterloo, Canada"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "B. Kutzler and S. Stifter"
+, title =       "Automated geometry theorem proving using {Buchberger}'s algorithm"
+, booktitle =   "SYMSAC '86"
+, site =        "Waterloo, Canada"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{ks-abaag-86
-, author =	"B. Kutzler and S. Stifter"
-, title =	"On the application of {Buchberger}'s algorithm to automated geometry theorem proving"
-, journal =	"J. Symbolic Comput."
-, volume =	2
-, year =	1986
-, pages =	"409--420"
-, update =	"98.03 bibrelex"
+, author =      "B. Kutzler and S. Stifter"
+, title =       "On the application of {Buchberger}'s algorithm to automated geometry theorem proving"
+, journal =     "J. Symbolic Comput."
+, volume =      2
+, year =        1986
+, pages =       "409--420"
+, update =      "98.03 bibrelex"
 }
 
 @article{kk-ettfe-94
-, author =	"I. S. Kweon and T. Kanade"
-, title =	"Extracting topographic terrain features from elevation maps"
-, journal =	"CVGIP: Image Understanding"
-, volume =	59
-, year =	1994
-, pages =	"171--182"
-, update =	"98.07 bibrelex"
+, author =      "I. S. Kweon and T. Kanade"
+, title =       "Extracting topographic terrain features from elevation maps"
+, journal =     "CVGIP: Image Understanding"
+, volume =      59
+, year =        1994
+, pages =       "171--182"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{k-caplp-92
-, author =	"K. K. Kwong"
-, title =	"Computer-aided parting line and parting surface generation in mould design"
-, school =	"University of Hong Kong"
-, address =	"Hong Kong"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "K. K. Kwong"
+, title =       "Computer-aided parting line and parting surface generation in mould design"
+, school =      "University of Hong Kong"
+, address =     "Hong Kong"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @mastersthesis{k-sgmwt-96
-, author =	"Y. Kyoda"
-, title =	"A Study of Generating Minimum Weight Triangulation within Practical Time"
-, school =	"Dept. Inform. Sci., Univ. Tokyo"
-, address =	"Tokyo, Japan"
-, year =	1996
-, keywords =	"master thesis"
-, update =	"97.11 bibrelex"
+, author =      "Y. Kyoda"
+, title =       "A Study of Generating Minimum Weight Triangulation within Practical Time"
+, school =      "Dept. Inform. Sci., Univ. Tokyo"
+, address =     "Tokyo, Japan"
+, year =        1996
+, keywords =    "master thesis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ki-bcamw-97
-, author =	"Yoshiaki Kyoda and Keiko Imai"
-, title =	"A Branch-and-Cut Approach for Minimum Weight Triangulation"
-, booktitle =	"Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '97"
-, site =	"Singapore"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1350
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"384--393"
-, update =	"99.11 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 mitchell"
+, author =      "Yoshiaki Kyoda and Keiko Imai"
+, title =       "A Branch-and-Cut Approach for Minimum Weight Triangulation"
+, booktitle =   "Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '97"
+, site =        "Singapore"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1350
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "384--393"
+, update =      "99.11 bibrelex, 98.11 bibrelex, 98.07 mitchell, 98.03 mitchell"
 }
 
 @phdthesis{k-sccad-80
-, author =	"L. K. Kyprianou"
-, title =	"Shape classification in computer aided design"
-, school =	"Cambridge Univ."
-, address =	"Cambridge, UK"
-, year =	1980
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "L. K. Kyprianou"
+, title =       "Shape classification in computer aided design"
+, school =      "Cambridge Univ."
+, address =     "Cambridge, UK"
+, year =        1980
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{l-aaipt-94
-, author =	"J. A. {La Poutr{\'e}}"
-, title =	"Alpha-algorithms for incremental planarity testing"
-, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	"706--715"
-, keywords =	"graph drawing"
-, update =	"95.09 tamassia, 95.05 tamassia, 95.01 tamassia"
+, author =      "J. A. {La Poutr{\'e}}"
+, title =       "Alpha-algorithms for incremental planarity testing"
+, booktitle =   "Proc. 26th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       "706--715"
+, keywords =    "graph drawing"
+, update =      "95.09 tamassia, 95.05 tamassia, 95.01 tamassia"
 }
 
 @phdthesis{l-dgads-91
-, author =	"J. A. {La Poutr{\'e}}"
-, title =	"Dynamic Graph Algorithms and Data Structures"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Utrecht."
-, year =	1991
-, keywords =	"dynamic algorithm"
-, update =	"96.01 tamassia"
+, author =      "J. A. {La Poutr{\'e}}"
+, title =       "Dynamic Graph Algorithms and Data Structures"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Utrecht."
+, year =        1991
+, keywords =    "dynamic algorithm"
+, update =      "96.01 tamassia"
 }
 
 @inproceedings{l-mtcg-92
-, author =	"J. A. {La Poutr{\'e}}"
-, title =	"Maintenance of Triconnected Components of Graphs"
-, booktitle =	"Automata, Languages and Programming (Proc. 19th ICALP)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	623
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"354--365"
-, update =	"98.07 vismara, 96.05 agarwal, 96.01 tamassia, 95.05 tamassia, 94.01 tamassia"
+, author =      "J. A. {La Poutr{\'e}}"
+, title =       "Maintenance of Triconnected Components of Graphs"
+, booktitle =   "Automata, Languages and Programming (Proc. 19th ICALP)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      623
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "354--365"
+, update =      "98.07 vismara, 96.05 agarwal, 96.01 tamassia, 95.05 tamassia, 94.01 tamassia"
 }
 
 @inproceedings{l-ntufp-90
-, author =	"J. A. {La Poutr{\'e}}"
-, title =	"New techniques for the {Union}-{Find} problem"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"54--63"
-, update =	"95.05 tamassia"
+, author =      "J. A. {La Poutr{\'e}}"
+, title =       "New techniques for the {Union}-{Find} problem"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "54--63"
+, update =      "95.05 tamassia"
 }
 
 @inproceedings{pl-mtctr-88
-, author =	"J. A. {La Poutr{\'e}} and J. van Leeuwen"
-, title =	"Maintenance of Transitive Closures and Transitive Reductions of Graphs"
-, editor =	"H. Gottler and H. J. Schneider"
-, booktitle =	"Graph-Theoretic Concepts in Computer Science (Proc. WG '87)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	314
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"106--120"
-, update =	"95.05 tamassia, 94.01 tamassia"
+, author =      "J. A. {La Poutr{\'e}} and J. van Leeuwen"
+, title =       "Maintenance of Transitive Closures and Transitive Reductions of Graphs"
+, editor =      "H. Gottler and H. J. Schneider"
+, booktitle =   "Graph-Theoretic Concepts in Computer Science (Proc. WG '87)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      314
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "106--120"
+, update =      "95.05 tamassia, 94.01 tamassia"
 }
 
 @book{la-satp-87
-, author =	"P. J. M. van Laarhoven and E. H. L. Aarts"
-, title =	"Simulated Annealing: Theory and Practice"
-, publisher =	"Kluwer Academic Publications"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "P. J. M. van Laarhoven and E. H. L. Aarts"
+, title =       "Simulated Annealing: Theory and Practice"
+, publisher =   "Kluwer Academic Publications"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{l-sirdi-99
-, author =	"Jean-Marie Laborde"
-, title =	"Some Issues Raised by the Development of Implemented Dynamic Geometry as with {Cabri-g{\'e}om{\`e}tre}"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"7--19"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Jean-Marie Laborde"
+, title =       "Some Issues Raised by the Development of Implemented Dynamic Geometry as with {Cabri-g{\'e}om{\`e}tre}"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "7--19"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @book{lb-cg2-93
-, author =	"Jean-Marie Laborde and Franck Bellemain"
-, title =	"{Cabri} {Geometry} {II}"
-, publisher =	"Texas Instruments"
-, address =	"Dallas"
-, year =	1993
-, update =	"99.07 bibrelex"
+, author =      "Jean-Marie Laborde and Franck Bellemain"
+, title =       "{Cabri} {Geometry} {II}"
+, publisher =   "Texas Instruments"
+, address =     "Dallas"
+, year =        1993
+, update =      "99.07 bibrelex"
 }
 
 @article{lsv-gmabm-94
-, author =	"B. Lacolle and N. Szafran and P. Valentin"
-, title =	"Geometric Modelling and Algorithms for Binary Mixtures"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"243--260"
-, keywords =	"computational geometry, convex sets, zonotopes, separation theory"
-, update =	"96.09 devillers, 94.05 devillers"
+, author =      "B. Lacolle and N. Szafran and P. Valentin"
+, title =       "Geometric Modelling and Algorithms for Binary Mixtures"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "243--260"
+, keywords =    "computational geometry, convex sets, zonotopes, separation theory"
+, update =      "96.09 devillers, 94.05 devillers"
 }
 
 @article{lf-ppc-80
-, author =	"R. E. Ladner and M. J. Fischer"
-, title =	"Parallel prefix computation"
-, journal =	"J. Assoc. Comput. Machinery"
-, volume =	27
-, number =	4
-, month =	oct
-, year =	1980
-, pages =	"831--838"
-, update =	"97.11 bibrelex"
+, author =      "R. E. Ladner and M. J. Fischer"
+, title =       "Parallel prefix computation"
+, journal =     "J. Assoc. Comput. Machinery"
+, volume =      27
+, number =      4
+, month =       oct
+, year =        1980
+, pages =       "831--838"
+, update =      "97.11 bibrelex"
 }
 
 @article{l-ccsda-85
-, author =	"J. Lagarias"
-, title =	"The computational complexity of simultaneos {Diophantine} approximation problems"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"196--209"
-, update =	"98.03 bibrelex"
+, author =      "J. Lagarias"
+, title =       "The computational complexity of simultaneos {Diophantine} approximation problems"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "196--209"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{lpr-psdsc-96
-, author =	"J. C. Lagarias and N. Prabhu and J. A. Reeds"
-, title =	"The parameter space of the $d$-step conjecture"
-, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1180
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"52--63"
-, update =	"97.03 smid"
+, author =      "J. C. Lagarias and N. Prabhu and J. A. Reeds"
+, title =       "The parameter space of the $d$-step conjecture"
+, booktitle =   "Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1180
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "52--63"
+, update =      "97.03 smid"
 }
 
 @inproceedings{ls-sdiuc-94
-, author =	"M. J. Lai and L. L. Schumaker"
-, title =	"Scattered data interpolation using {$C^{2}$} piecewise polynomials of degree six"
-, booktitle =	"3rd Workshop Proximity Graphs"
-, year =	1994
-, update =	"97.11 bibrelex"
+, author =      "M. J. Lai and L. L. Schumaker"
+, title =       "Scattered data interpolation using {$C^{2}$} piecewise polynomials of degree six"
+, booktitle =   "3rd Workshop Proximity Graphs"
+, year =        1994
+, update =      "97.11 bibrelex"
 }
 
 @article{lw-ehppn-93
-, author =	"T.-H. Lai and S.-S. Wei"
-, title =	"The edge {Hamiltonian} path problem is {NP}-complete for bipartite graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	46
-, year =	1993
-, pages =	"21--26"
-, update =	"98.11 bibrelex"
+, author =      "T.-H. Lai and S.-S. Wei"
+, title =       "The edge {Hamiltonian} path problem is {NP}-complete for bipartite graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      46
+, year =        1993
+, pages =       "21--26"
+, update =      "98.11 bibrelex"
 }
 
 @article{lth-csgpo-86
-, author =	"D. H. Laidlaw and W. B. Trumbore and J. F. Hughes"
-, title =	"Constructive Solid Geometry for Polyhedral Objects"
-, journal =	"Comput. Graph."
-, volume =	20
-, number =	4
-, year =	1986
-, pages =	"161--170"
-, note =	"Proc. SIGGRAPH '86"
-, update =	"93.09 goodrich"
+, author =      "D. H. Laidlaw and W. B. Trumbore and J. F. Hughes"
+, title =       "Constructive Solid Geometry for Polyhedral Objects"
+, journal =     "Comput. Graph."
+, volume =      20
+, number =      4
+, year =        1986
+, pages =       "161--170"
+, note =        "Proc. SIGGRAPH '86"
+, update =      "93.09 goodrich"
 }
 
 @inproceedings{l-ssxoc-90
-, author =	"J.-L. Lambert"
-, title =	"Sorting the sums ($x_i+y_j$) in {$O(n^2)$} comparisons"
-, booktitle =	"Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	415
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"195--206"
-, update =	"99.11 bibrelex"
+, author =      "J.-L. Lambert"
+, title =       "Sorting the sums ($x_i+y_j$) in {$O(n^2)$} comparisons"
+, booktitle =   "Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      415
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "195--206"
+, update =      "99.11 bibrelex"
 }
 
 @inproceedings{l-sxyoc-91
-, author =	"J. L. Lambert"
-, title =	"Sorting {X + Y} in $O(n^2)$ comparisons"
-, booktitle =	"Proc. 8th Sympos. Theoret. Aspects Comput. Sci."
-, year =	1991
-, pages =	"195--206"
-, update =	"98.11 bibrelex"
+, author =      "J. L. Lambert"
+, title =       "Sorting {X + Y} in $O(n^2)$ comparisons"
+, booktitle =   "Proc. 8th Sympos. Theoret. Aspects Comput. Sci."
+, year =        1991
+, pages =       "195--206"
+, update =      "98.11 bibrelex"
 }
 
 @phdthesis{l-esta-94
-, author =	"T. Lambert"
-, title =	"Empty-Shape Triangulation Algorithms"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. of Manitoba"
-, address =	"Winnipeg, MB"
-, month =	aug
-, year =	1994
-, url =	"ftp://ftp.cse.unsw.edu.au/pub/users/lambert/thesis.ps.Z"
-, keywords =	"doctoral thesis"
-, update =	"94.09 lambert"
-, abstract =	"The Delaunay triangulation of a set of sites (points in
+, author =      "T. Lambert"
+, title =       "Empty-Shape Triangulation Algorithms"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. of Manitoba"
+, address =     "Winnipeg, MB"
+, month =       aug
+, year =        1994
+, url = "ftp://ftp.cse.unsw.edu.au/pub/users/lambert/thesis.ps.Z"
+, keywords =    "doctoral thesis"
+, update =      "94.09 lambert"
+, abstract =    "The Delaunay triangulation of a set of sites (points in
 the plane) can be defined as the triangulation with the property that the
 circumcircle of each triangle is empty (contains no site).  I generalize
 this to define {\em empty-shape triangulations}.  An empty-shape
@@ -92756,1996 +92756,1996 @@ @phdthesis{l-esta-94
 }
 
 @techreport{l-lot-93
-, author =	"T. Lambert"
-, title =	"Local optimization of triangulations"
-, type =	"manuscript"
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "T. Lambert"
+, title =       "Local optimization of triangulations"
+, type =        "manuscript"
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @techreport{l-lot-93a
-, author =	"T. Lambert"
-, title =	"Local optimization of triangulations"
-, type =	"manuscript"
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "T. Lambert"
+, title =       "Local optimization of triangulations"
+, type =        "manuscript"
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{l-slfra-93
-, author =	"T. Lambert"
-, title =	"Systematic local flip rules are generalized {Delaunay} rules"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"352--357"
-, cites =	"a-vdsfg-91, be-mgot-92i, b-koejk-36, d-pacdt-90, d-srbtg-87, fdfh-cgpp-90, f-skgk-20, g-itsn-86, gks-ricdv-92, gs-pmgsc-85, k-cavd-89, l-lot-93, l-gtgac-72, ls-tacdt-80, nf-scbut-83, o-dtfl-90, ba-acfem-76, s-let-78, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "T. Lambert"
+, title =       "Systematic local flip rules are generalized {Delaunay} rules"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "352--357"
+, cites =       "a-vdsfg-91, be-mgot-92i, b-koejk-36, d-pacdt-90, d-srbtg-87, fdfh-cgpp-90, f-skgk-20, g-itsn-86, gks-ricdv-92, gs-pmgsc-85, k-cavd-89, l-lot-93, l-gtgac-72, ls-tacdt-80, nf-scbut-83, o-dtfl-90, ba-acfem-76, s-let-78, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{l-dtmmi-94
-, author =	"T. Lambert"
-, title =	"The {Delaunay} Triangulation Maximizes the Mean Inradius"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"201--206"
-, cites =	"a-vdsfg-91, b-ras-77, be-mgot-92i, ds-oiti-89, d-iw-86, fdfh-cgpp-90, f-vddt-92, h-mg-85, j-aeg-60, l-lot-93, ba-acfem-76, d-srbtg-87, ls-agt-, o-dtfl-90, p-mrpdt-92, r-odtr-91, r-mrpdt-90, s-tm-87, s-let-78, w-pdcig-91, fp-jtgp-89, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "T. Lambert"
+, title =       "The {Delaunay} Triangulation Maximizes the Mean Inradius"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "201--206"
+, cites =       "a-vdsfg-91, b-ras-77, be-mgot-92i, ds-oiti-89, d-iw-86, fdfh-cgpp-90, f-vddt-92, h-mg-85, j-aeg-60, l-lot-93, ba-acfem-76, d-srbtg-87, ls-agt-, o-dtfl-90, p-mrpdt-92, r-odtr-91, r-mrpdt-90, s-tm-87, s-let-78, w-pdcig-91, fp-jtgp-89, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{lsw-oraim-88
-, author =	"Y. Lamdan and J. T. Schwartz and H. J. Wolfson"
-, title =	"Object recognition by affine invariant mapping"
-, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
-, year =	1988
-, pages =	"335--344"
-, update =	"97.11 bibrelex"
+, author =      "Y. Lamdan and J. T. Schwartz and H. J. Wolfson"
+, title =       "Object recognition by affine invariant mapping"
+, booktitle =   "Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
+, year =        1988
+, pages =       "335--344"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{lw-ghgem-88
-, author =	"Y. Lamdan and H. J. Wolfson"
-, title =	"Geometric hashing: a general and efficient model-based recognition scheme"
-, booktitle =	"2nd Inter. Conf. on Comput. Vision"
-, year =	1988
-, pages =	"238--249"
-, update =	"96.09 orourke"
+, author =      "Y. Lamdan and H. J. Wolfson"
+, title =       "Geometric hashing: a general and efficient model-based recognition scheme"
+, booktitle =   "2nd Inter. Conf. on Comput. Vision"
+, year =        1988
+, pages =       "238--249"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{lw-eagh-91
-, author =	"Y. Lamdan and H. J. Wolfson"
-, title =	"On the error analysis of geometric hashing"
-, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
-, year =	1991
-, pages =	"22--27"
-, update =	"97.11 bibrelex"
+, author =      "Y. Lamdan and H. J. Wolfson"
+, title =       "On the error analysis of geometric hashing"
+, booktitle =   "Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
+, year =        1991
+, pages =       "22--27"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{lhn-ddq2d-97
-, author =	"Michael G. Lamoureux and Joseph D. Horton and Bradford G. Nickerson"
-, title =	"Dynamizing Domination Queries in 2--dimensions: The Paper Stabbing Problem Revisited"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"211--216"
-, update =	"97.11 jones"
+, author =      "Michael G. Lamoureux and Joseph D. Horton and Bradford G. Nickerson"
+, title =       "Dynamizing Domination Queries in 2--dimensions: The Paper Stabbing Problem Revisited"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "211--216"
+, update =      "97.11 jones"
 }
 
 @book{l-dpslu-86
-, author =	"Leslie Lamport"
-, title =	"A Document Preparation System {Latex} User's Guide and Reference Manual"
-, publisher =	"Addison-Wesley"
-, year =	1986
-, update =	"98.11 bibrelex"
+, author =      "Leslie Lamport"
+, title =       "A Document Preparation System {Latex} User's Guide and Reference Manual"
+, publisher =   "Addison-Wesley"
+, year =        1986
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{lm-sgch-95
-, author =	"H. Lamure and D. Michelucci"
-, title =	"Solving geometric constraints by homotopy"
-, booktitle =	"Proc. 3rd ACM Symposium on Solid Modeling and Applications"
-, site =	"Salt Lake City, UT"
-, month =	may
-, year =	1995
-, update =	"98.07 bibrelex"
+, author =      "H. Lamure and D. Michelucci"
+, title =       "Solving geometric constraints by homotopy"
+, booktitle =   "Proc. 3rd ACM Symposium on Solid Modeling and Applications"
+, site =        "Salt Lake City, UT"
+, month =       may
+, year =        1995
+, update =      "98.07 bibrelex"
 }
 
 @article{lccg-dforp-97
-, author =	"P.-T. Lan and S.-Y. Chou and L.-L. Chen and D. Gemmill"
-, title =	"Determining Fabrication Orientations for Rapid Prototyping with Stereolithography Apparatus"
-, journal =	"Comput. Aided Design"
-, volume =	29
-, number =	1
-, month =	jan
-, year =	1997
-, pages =	"53--62"
-, update =	"97.11 held"
+, author =      "P.-T. Lan and S.-Y. Chou and L.-L. Chen and D. Gemmill"
+, title =       "Determining Fabrication Orientations for Rapid Prototyping with Stereolithography Apparatus"
+, journal =     "Comput. Aided Design"
+, volume =      29
+, number =      1
+, month =       jan
+, year =        1997
+, pages =       "53--62"
+, update =      "97.11 held"
 }
 
 @inproceedings{lv-pmdi-92
-, author =	"G. M. Landau and U. Vishkin"
-, title =	"Pattern matching in a digitized image"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"453--462"
+, author =      "G. M. Landau and U. Vishkin"
+, title =       "Pattern matching in a digitized image"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "453--462"
 }
 
 @incollection{lv-tdpmd-93
-, author =	"Gad M. Landau and Uzi Vishkin"
-, title =	"Two Dimensional Pattern Matching in a Digitized Image"
-, booktitle =	"Combinatorial Pattern Matching"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	684
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"134--151"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "Gad M. Landau and Uzi Vishkin"
+, title =       "Two Dimensional Pattern Matching in a Digitized Image"
+, booktitle =   "Combinatorial Pattern Matching"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      684
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "134--151"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{l-fpq-87
-, author =	"S. Landau"
-, title =	"Factoring polynomials quickly"
-, journal =	"Notices Amer. Math. Soc."
-, volume =	34
-, number =	1
-, year =	1987
-, pages =	"3--8"
-, update =	"97.11 bibrelex"
+, author =      "S. Landau"
+, title =       "Factoring polynomials quickly"
+, journal =     "Notices Amer. Math. Soc."
+, volume =      34
+, number =      1
+, year =        1987
+, pages =       "3--8"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{lm-srpt-83
-, author =	"S. Landau and G. L. Miller"
-, title =	"Solvability by radicals in polynomial time"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
-, year =	1983
-, pages =	"140--151"
-, precedes =	"lm-srpt-85"
+, author =      "S. Landau and G. L. Miller"
+, title =       "Solvability by radicals in polynomial time"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Theory Comput."
+, year =        1983
+, pages =       "140--151"
+, precedes =    "lm-srpt-85"
 }
 
 @article{lm-srpt-85
-, author =	"S. Landau and G. L. Miller"
-, title =	"Solvability by radicals in polynomial time"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	30
-, year =	1985
-, pages =	"179--208"
-, succeeds =	"lm-srpt-83"
+, author =      "S. Landau and G. L. Miller"
+, title =       "Solvability by radicals in polynomial time"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      30
+, year =        1985
+, pages =       "179--208"
+, succeeds =    "lm-srpt-83"
 }
 
 @article{l-ecacr-87
-, author =	"U. M. Landau"
-, title =	"Estimation of circular arc center and its radius"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	38
-, year =	1987
-, pages =	"317--326"
-, update =	"98.11 bibrelex, 97.03 agarwal"
+, author =      "U. M. Landau"
+, title =       "Estimation of circular arc center and its radius"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      38
+, year =        1987
+, pages =       "317--326"
+, update =      "98.11 bibrelex, 97.03 agarwal"
 }
 
 @article{lmr-eppa-84
-, author =	"J. Lane and B. Magedson and M. Rarick"
-, title =	"An efficient point in polyhedron algorithm"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	26
-, year =	1984
-, pages =	"118--125"
-, update =	"98.11 bibrelex"
+, author =      "J. Lane and B. Magedson and M. Rarick"
+, title =       "An efficient point in polyhedron algorithm"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      26
+, year =        1984
+, pages =       "118--125"
+, update =      "98.11 bibrelex"
 }
 
 @article{lcwb-slmdp-80
-, author =	"J. M. Lane and L. C. Carpenter and J. T. Whitted and J. F. Blinn"
-, title =	"Scan line methods for displaying parametrically defined surfaces"
-, journal =	"Commun. ACM"
-, volume =	23
-, number =	1
-, year =	1980
-, pages =	"23--34"
-, update =	"97.11 bibrelex"
+, author =      "J. M. Lane and L. C. Carpenter and J. T. Whitted and J. F. Blinn"
+, title =       "Scan line methods for displaying parametrically defined surfaces"
+, journal =     "Commun. ACM"
+, volume =      23
+, number =      1
+, year =        1980
+, pages =       "23--34"
+, update =      "97.11 bibrelex"
 }
 
 @article{lr-bp-81
-, author =	"J. M. Lane and R. Riesenfeld"
-, title =	"Bounds on a polynomial"
-, journal =	"BIT"
-, volume =	21
-, year =	1981
-, pages =	"112--117"
-, update =	"97.11 bibrelex"
+, author =      "J. M. Lane and R. Riesenfeld"
+, title =       "Bounds on a polynomial"
+, journal =     "BIT"
+, volume =      21
+, year =        1981
+, pages =       "112--117"
+, update =      "97.11 bibrelex"
 }
 
 @article{lr-tdcgd-80
-, author =	"J. M. Lane and R. R. Riesenfeld"
-, title =	"A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-2"
-, number =	1
-, month =	jan
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "J. M. Lane and R. R. Riesenfeld"
+, title =       "A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-2"
+, number =      1
+, month =       jan
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{l-caod-96
-, author =	"Robert J. Lang"
-, title =	"A Computational Algorithm for Origami Design"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"98--105"
-, cites =	"ml-osl-90, m-oe-79, l-oi-95, k-fo-95, m-po-89, k-co-67, kt-oc-78, k-oo-88, e-oaz-94, m-??-94, k-tffaf-94, k-rbmcv-89, l-maod-94, h-mfo-94, h-ccpp-76, bh-cfo-96, v-noted-84, pftv-nrc-93, g-tc-92, ZZZ"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 96.05 efrat"
+, author =      "Robert J. Lang"
+, title =       "A Computational Algorithm for Origami Design"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "98--105"
+, cites =       "ml-osl-90, m-oe-79, l-oi-95, k-fo-95, m-po-89, k-co-67, kt-oc-78, k-oo-88, e-oaz-94, m-??-94, k-tffaf-94, k-rbmcv-89, l-maod-94, h-mfo-94, h-ccpp-76, bh-cfo-96, v-noted-84, pftv-nrc-93, g-tc-92, ZZZ"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 96.05 efrat"
 }
 
 @article{l-maod-94
-, author =	"R. J. Lang"
-, title =	"Mathematical algorithms for origami design"
-, journal =	"Symmetry: Culture and Science"
-, volume =	5
-, number =	2
-, year =	1994
-, pages =	"115--152"
-, update =	"97.11 bibrelex"
+, author =      "R. J. Lang"
+, title =       "Mathematical algorithms for origami design"
+, journal =     "Symmetry: Culture and Science"
+, volume =      5
+, number =      2
+, year =        1994
+, pages =       "115--152"
+, update =      "97.11 bibrelex"
 }
 
 @book{l-oi-95
-, author =	"R. J. Lang"
-, title =	"Origami Insects"
-, publisher =	"Dover"
-, year =	1995
-, update =	"97.11 bibrelex"
+, author =      "R. J. Lang"
+, title =       "Origami Insects"
+, publisher =   "Dover"
+, year =        1995
+, update =      "97.11 bibrelex"
 }
 
 @book{l-a1-69
-, author =	"Serge Lang"
-, title =	"Analysis {I}"
-, publisher =	"Addison-Wesley"
-, address =	"New York, NY"
-, year =	1969
-, update =	"98.07 bibrelex, 98.03 bibrelex"
+, author =      "Serge Lang"
+, title =       "Analysis {I}"
+, publisher =   "Addison-Wesley"
+, address =     "New York, NY"
+, year =        1969
+, update =      "98.07 bibrelex, 98.03 bibrelex"
 }
 
 @phdthesis{l-agas-98
-, author =	"E. de Lange"
-, title =	"Aide g{\'e}om{\'e}trique {\`a} l'am{\'e}nagement de satellites"
-, type =	"Th\`{e}se de doctorat en sciences"
-, school =	"{\'E}cole Nationale Sup\'erieure des Mines de Paris"
-, address =	"France"
-, year =	1998
-, url =	"http://www-sop.inria.fr/prisme/publis/these-delange.ps.gz"
-, keywords =	"doctoral thesis"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers"
+, author =      "E. de Lange"
+, title =       "Aide g{\'e}om{\'e}trique {\`a} l'am{\'e}nagement de satellites"
+, type =        "Th\`{e}se de doctorat en sciences"
+, school =      "{\'E}cole Nationale Sup\'erieure des Mines de Paris"
+, address =     "France"
+, year =        1998
+, url = "http://www-sop.inria.fr/prisme/publis/these-delange.ps.gz"
+, keywords =    "doctoral thesis"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 devillers"
 }
 
 @inproceedings{lrsw-clprt-01
-, author =	"K. Lange and R. Ray and M. Smid and U. Wendt"
-, title =	"Computing large planar regions in terrains"
-, booktitle =	"Proc. 8th International Workshop on Combinatorial Image Analysis"
-, nickname =	"IWCIA '01"
-, year =	2001
-, pages =	"139--151"
-, comments =	"Appears also in Electronic Notes in Theoretical
+, author =      "K. Lange and R. Ray and M. Smid and U. Wendt"
+, title =       "Computing large planar regions in terrains"
+, booktitle =   "Proc. 8th International Workshop on Combinatorial Image Analysis"
+, nickname =    "IWCIA '01"
+, year =        2001
+, pages =       "139--151"
+, comments =    "Appears also in Electronic Notes in Theoretical
                  Computer Science, Volume 46,
                  www.elsevier.nl/locate/entcs/volume46.html"
-, update =	"01.11 smid"
+, update =      "01.11 smid"
 }
 
 @inproceedings{l-chaq-01
-, author =	"Stefan Langermann"
-, title =	"On the Complexity of Halfspace Area Queries"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"86--88"
-, update =	"01.04 icking"
+, author =      "Stefan Langermann"
+, title =       "On the Complexity of Halfspace Area Queries"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "86--88"
+, update =      "01.04 icking"
 }
 
 @phdthesis{l-dasas-00
-, author =	"Elmar Langetepe"
-, title =	"Design and Analysis of Strategies for Autonomous Systems in Motion Planning"
-, school =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, year =	2000
-, keywords =	"doctoral thesis"
-, cites =	"aaiklr-psac-97, aaiklr-gsac-98p, admss-esstl-95, bcr-sp-93, b-olsn-98, brs-nugt-97, bl-piss-99, bs-srsc-99, bsmm-tdm-93, cn-cvpp-99, cgglmw-m5lrm-91, cgglmw-fltim-92, cn-owr-88, c-lp-83, cg-opapp-92, cghj-lwfm-93, cfg-upg-90, dhn-lvp-97, dcd-ncaas-96, dhs-cspbg-95, di-csgs-94, di-csgs-99, bkos-cgaa-97, ew-mmcfs-99, fw-ola-98, g-sg-80, g-csg-89, gj-cigtn-79, gs-oolaw-97, hns-psmr-99, hikl-hfplf-97, hikl-hfplf-99, hikk-cslp-97, hikk-maar-98, hikk-pepns-98, hikk-pep1c-98, hikk-pep2a-98, i-mvsp-94, ik-skpcs-95, ikl-skpcs-97, ikl-sac-97, ikl-ocsws-98, ikl-ocsws-99, ikl-sgmrw-99, ikl-sac-99, ikm-hlac-93, ilss-ghtus-98, jdugg-wcpbs-74, k-wusbd-91, k-wusbd-92, k-ag-97, k-olssp-94, ks-aools-97, lp-oafkp-79, lc-tasso-99, lsksc-ncssu-97, l-oltsb-96, ls-ghtus-95, ls-serst-95, ls-gsr-96, ls-wsf-96, ls-pinos-97, ls-ecesc-98, ls-lbsgs-98, ls-ussmr-98, m-gspno-00, osh-kaoa-94, ps-cgi-85, rksi-rnut-93, r-cic-94, rs-addce-91, s-smbr-98, ss-oss-98, ss-ossus-99, s-naci-89, s-aeusf-96, st-aelup-85, th-cswrd-93, thl-tgwsp-98, ZZZ"
-, update =	"00.11 smid, 00.07 icking, 00.03 bibrelex"
+, author =      "Elmar Langetepe"
+, title =       "Design and Analysis of Strategies for Autonomous Systems in Motion Planning"
+, school =      "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, year =        2000
+, keywords =    "doctoral thesis"
+, cites =       "aaiklr-psac-97, aaiklr-gsac-98p, admss-esstl-95, bcr-sp-93, b-olsn-98, brs-nugt-97, bl-piss-99, bs-srsc-99, bsmm-tdm-93, cn-cvpp-99, cgglmw-m5lrm-91, cgglmw-fltim-92, cn-owr-88, c-lp-83, cg-opapp-92, cghj-lwfm-93, cfg-upg-90, dhn-lvp-97, dcd-ncaas-96, dhs-cspbg-95, di-csgs-94, di-csgs-99, bkos-cgaa-97, ew-mmcfs-99, fw-ola-98, g-sg-80, g-csg-89, gj-cigtn-79, gs-oolaw-97, hns-psmr-99, hikl-hfplf-97, hikl-hfplf-99, hikk-cslp-97, hikk-maar-98, hikk-pepns-98, hikk-pep1c-98, hikk-pep2a-98, i-mvsp-94, ik-skpcs-95, ikl-skpcs-97, ikl-sac-97, ikl-ocsws-98, ikl-ocsws-99, ikl-sgmrw-99, ikl-sac-99, ikm-hlac-93, ilss-ghtus-98, jdugg-wcpbs-74, k-wusbd-91, k-wusbd-92, k-ag-97, k-olssp-94, ks-aools-97, lp-oafkp-79, lc-tasso-99, lsksc-ncssu-97, l-oltsb-96, ls-ghtus-95, ls-serst-95, ls-gsr-96, ls-wsf-96, ls-pinos-97, ls-ecesc-98, ls-lbsgs-98, ls-ussmr-98, m-gspno-00, osh-kaoa-94, ps-cgi-85, rksi-rnut-93, r-cic-94, rs-addce-91, s-smbr-98, ss-oss-98, ss-ossus-99, s-naci-89, s-aeusf-96, st-aelup-85, th-cswrd-93, thl-tgwsp-98, ZZZ"
+, update =      "00.11 smid, 00.07 icking, 00.03 bibrelex"
 }
 
 @article{l-rtaa-69
-, author =	"P. M. Lankford"
-, title =	"Regionalization: theory and alternative algorithms"
-, journal =	"Geogr. Anal."
-, volume =	1
-, year =	1969
-, pages =	"196--212"
-, update =	"98.03 bibrelex"
+, author =      "P. M. Lankford"
+, title =       "Regionalization: theory and alternative algorithms"
+, journal =     "Geogr. Anal."
+, volume =      1
+, year =        1969
+, pages =       "196--212"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{lms-awspp-96
-, author =	"M. Lanthier and A. Maheshwari and J.-R. Sack"
-, title =	"Approximating weighted shortest paths on polyhedral surfaces"
-, type =	"Technical {Report}"
-, number =	"TR-96-32"
-, institution =	"Carleton Univ."
-, address =	"Ottawa, ON"
-, month =	dec
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "M. Lanthier and A. Maheshwari and J.-R. Sack"
+, title =       "Approximating weighted shortest paths on polyhedral surfaces"
+, type =        "Technical {Report}"
+, number =      "TR-96-32"
+, institution = "Carleton Univ."
+, address =     "Ottawa, ON"
+, month =       dec
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{lms-awspp-97i
-, author =	"M. Lanthier and A. Maheshwari and J.-R. Sack"
-, title =	"Approximating weighted shortest paths on polyhedral surfaces"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"274--283"
-, keywords =	"shortest paths, weighted region problem, discrete geodesic problem"
-, cites =	"hsv-aspcp-96, aaos-supa-97, ch-spp-90, c-aaspm-87, d-ntpcg-59, gh-ospqs-87, hs-pmasp-95, hlmnrs-pnm-96, lms-awspp-96, lms-awspp-97v, mmp-dgp-87, mp-wrpfs-91, ms-scg-95, m-fspcp-85, osb-spps-84, rr-ogfpp-90, ss-spps-86, va-aspp-96, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "M. Lanthier and A. Maheshwari and J.-R. Sack"
+, title =       "Approximating weighted shortest paths on polyhedral surfaces"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "274--283"
+, keywords =    "shortest paths, weighted region problem, discrete geodesic problem"
+, cites =       "hsv-aspcp-96, aaos-supa-97, ch-spp-90, c-aaspm-87, d-ntpcg-59, gh-ospqs-87, hs-pmasp-95, hlmnrs-pnm-96, lms-awspp-96, lms-awspp-97v, mmp-dgp-87, mp-wrpfs-91, ms-scg-95, m-fspcp-85, osb-spps-84, rr-ogfpp-90, ss-spps-86, va-aspp-96, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @inproceedings{lms-awspp-97v
-, author =	"M. Lanthier and A. Maheshwari and J.-R. Sack"
-, title =	"Approximating Weighted Shortest Paths on Polyhedral Surfaces"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"485--486"
-, keywords =	"video review"
-, cites =	"aaos-supa-97, ch-spp-90, lms-awspp-96, lms-awspp-97i, mmp-dgp-87, mp-wrpfs-91, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "M. Lanthier and A. Maheshwari and J.-R. Sack"
+, title =       "Approximating Weighted Shortest Paths on Polyhedral Surfaces"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "485--486"
+, keywords =    "video review"
+, cites =       "aaos-supa-97, ch-spp-90, lms-awspp-96, lms-awspp-97i, mmp-dgp-87, mp-wrpfs-91, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{lm-gmqia-84
-, author =	"C. Lantuejoul and F. Maisonneuve"
-, title =	"Geodesic methods in quantitative image analysis"
-, journal =	"Pattern Recogn."
-, volume =	17
-, year =	1984
-, pages =	"177--187"
-, update =	"98.03 bibrelex"
+, author =      "C. Lantuejoul and F. Maisonneuve"
+, title =       "Geodesic methods in quantitative image analysis"
+, journal =     "Pattern Recogn."
+, volume =      17
+, year =        1984
+, pages =       "177--187"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{l-aicla-80
-, author =	"A. LaPaugh"
-, title =	"Algorithms for Integrated Circuit Layout: {An} Analytic Approach"
-, school =	"Laboratory for Computer Science, MIT"
-, year =	1980
-, keywords =	"doctoral thesis"
-, update =	"93.09 milone+mitchell"
+, author =      "A. LaPaugh"
+, title =       "Algorithms for Integrated Circuit Layout: {An} Analytic Approach"
+, school =      "Laboratory for Computer Science, MIT"
+, year =        1980
+, keywords =    "doctoral thesis"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{lmn-eaacv-86
-, author =	"G. Laporte and H. Mercure and Y. Nobert"
-, title =	"An exact algorithm for the asymmetrical capacitated vehicle routing problem"
-, journal =	"Networks"
-, volume =	16
-, year =	1986
-, pages =	"47--50"
+, author =      "G. Laporte and H. Mercure and Y. Nobert"
+, title =       "An exact algorithm for the asymmetrical capacitated vehicle routing problem"
+, journal =     "Networks"
+, volume =      16
+, year =        1986
+, pages =       "47--50"
 }
 
 @article{l-htpuc-68
-, author =	"D. G. Larman"
-, title =	"Helly type properties of unions of convex sets"
-, journal =	"Mathematica"
-, volume =	15
-, year =	1968
-, pages =	"53--59"
-, update =	"98.03 bibrelex"
+, author =      "D. G. Larman"
+, title =       "Helly type properties of unions of convex sets"
+, journal =     "Mathematica"
+, volume =      15
+, year =        1968
+, pages =       "53--59"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{l-pp-70
-, author =	"D. G. Larman"
-, title =	"Paths on polytopes"
-, booktitle =	"Proc. Lon. Math. Soc."
-, volume =	20
-, year =	1970
-, pages =	"161--178"
-, update =	"93.09 milone+mitchell"
+, author =      "D. G. Larman"
+, title =       "Paths on polytopes"
+, booktitle =   "Proc. Lon. Math. Soc."
+, volume =      20
+, year =        1970
+, pages =       "161--178"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{lmpt-rtrpc-94
-, author =	"D. G. Larman and J. Matou{\v s}ek and J. Pach and J. T{\H o}r{\H o}csik"
-, title =	"A {Ramsey}-type result for planar convex sets"
-, journal =	"Bull. London Math. Soc."
-, volume =	26
-, year =	1994
-, pages =	"132--136"
-, update =	"97.11 bibrelex"
+, author =      "D. G. Larman and J. Matou{\v s}ek and J. Pach and J. T{\H o}r{\H o}csik"
+, title =       "A {Ramsey}-type result for planar convex sets"
+, journal =     "Bull. London Math. Soc."
+, volume =      26
+, year =        1994
+, pages =       "132--136"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{lh-llc-90
-, author =	"L. Larmore and D. Hirschberg"
-, title =	"Length-limited coding"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"310--318"
-, update =	"98.03 bibrelex"
+, author =      "L. Larmore and D. Hirschberg"
+, title =       "Length-limited coding"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "310--318"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{lp-pctow-91
-, author =	"L. Larmore and T. Przytycka"
-, title =	"Parallel construction of trees with optimal weighted path length"
-, booktitle =	"Proc. 3rd ACM Sympos. Parallel Algorithms Arch."
-, year =	1991
-, pages =	"71--80"
-, update =	"98.03 bibrelex"
+, author =      "L. Larmore and T. Przytycka"
+, title =       "Parallel construction of trees with optimal weighted path length"
+, booktitle =   "Proc. 3rd ACM Sympos. Parallel Algorithms Arch."
+, year =        1991
+, pages =       "71--80"
+, update =      "98.03 bibrelex"
 }
 
 @article{ls-oldpa-91
-, author =	"L. Larmore and B. Schieber"
-, title =	"On-line dynamic programming with applications to prediction of {RNA} secondary structure"
-, journal =	"J. Algorithms"
-, volume =	12
-, year =	1991
-, pages =	"490--515"
-, update =	"98.03 bibrelex"
+, author =      "L. Larmore and B. Schieber"
+, title =       "On-line dynamic programming with applications to prediction of {RNA} secondary structure"
+, journal =     "J. Algorithms"
+, volume =      12
+, year =        1991
+, pages =       "490--515"
+, update =      "98.03 bibrelex"
 }
 
 @article{l-oautc-90
-, author =	"L. L. Larmore"
-, title =	"An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching"
-, journal =	"Inform. Process. Lett."
-, volume =	36
-, year =	1990
-, pages =	"147--151"
+, author =      "L. L. Larmore"
+, title =       "An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching"
+, journal =     "Inform. Process. Lett."
+, volume =      36
+, year =        1990
+, pages =       "147--151"
 }
 
 @inproceedings{ls-oldpa-90
-, author =	"L. L. Larmore and B. Schieber"
-, title =	"On-line dynamic programming with applications to the prediction of {RNA} secondary structure"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"503--512"
+, author =      "L. L. Larmore and B. Schieber"
+, title =       "On-line dynamic programming with applications to the prediction of {RNA} secondary structure"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "503--512"
 }
 
 @book{l-pstp-83
-, author =	"L. C. Larson"
-, title =	"Problem-Solving Through Problems"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1983
-, update =	"98.03 bibrelex"
+, author =      "L. C. Larson"
+, title =       "Problem-Solving Through Problems"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1983
+, update =      "98.03 bibrelex"
 }
 
 @article{ll-fmrdp-81
-, author =	"R. C. Larson and V. O. K. Li"
-, title =	"Finding minimum rectilinear distance paths in the presence of barriers"
-, journal =	"Networks"
-, volume =	11
-, year =	1981
-, pages =	"285--304"
+, author =      "R. C. Larson and V. O. K. Li"
+, title =       "Finding minimum rectilinear distance paths in the presence of barriers"
+, journal =     "Networks"
+, volume =      11
+, year =        1981
+, pages =       "285--304"
 }
 
 @article{l-com-80
-, author =	"M. {Las Vergnas}"
-, title =	"Convexity in oriented matroids"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	29
-, year =	1980
-, pages =	"231--243"
-, update =	"98.07 agarwal"
+, author =      "M. {Las Vergnas}"
+, title =       "Convexity in oriented matroids"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      29
+, year =        1980
+, pages =       "231--243"
+, update =      "98.07 agarwal"
 }
 
 @book{l-vta-50
-, author =	"H. Lass"
-, title =	"Vector and Tensor Analysis"
-, publisher =	"McGraw-Hill"
-, year =	1950
-, update =	"98.03 bibrelex"
+, author =      "H. Lass"
+, title =       "Vector and Tensor Analysis"
+, publisher =   "McGraw-Hill"
+, year =        1950
+, update =      "98.03 bibrelex"
 }
 
 @article{lz-olpst-91
-, author =	"M. Lassak and J. Zhang"
-, title =	"An on-line potato-sack theorem"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"1--7"
+, author =      "M. Lassak and J. Zhang"
+, title =       "An on-line potato-sack theorem"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "1--7"
 }
 
 @inproceedings{l-kfv-90
-, author =	"Dieter Lasser"
-, title =	"{Kurven-} und {Fl{\"a}chen}-{Verschneidungsmethoden}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	17
-, update =	"00.03 bibrelex"
+, author =      "Dieter Lasser"
+, title =       "{Kurven-} und {Fl{\"a}chen}-{Verschneidungsmethoden}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       17
+, update =      "00.03 bibrelex"
 }
 
 @article{l-aeavc-83
-, author =	"J. B. Lasserre"
-, title =	"An analytical expression and an algorithm for the volume of a convex polyhedron in {$R^{n}$}"
-, journal =	"J. Optim. Theory Appl."
-, volume =	39
-, year =	1983
-, pages =	"363--377"
+, author =      "J. B. Lasserre"
+, title =       "An analytical expression and an algorithm for the volume of a convex polyhedron in {$R^{n}$}"
+, journal =     "J. Optim. Theory Appl."
+, volume =      39
+, year =        1983
+, pages =       "363--377"
 }
 
 @book{l-cgcgc-96
-, author =	"M. Laszlo"
-, title =	"Computational Geometry and Computer Graphics in C++"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1996
-, isbn =	"0-13-290842-5"
-, update =	"98.07 tamassia+vismara, 97.11 icking, 96.05 held"
+, author =      "M. Laszlo"
+, title =       "Computational Geometry and Computer Graphics in C++"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1996
+, isbn =        "0-13-290842-5"
+, update =      "98.07 tamassia+vismara, 97.11 icking, 96.05 held"
 }
 
 @phdthesis{l-dsmtd-87
-, author =	"M. J. Laszlo"
-, title =	"A data structure for manipulating three-dimensional subdivisions"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1987
-, note =	"Report CS-TR-125-87"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "M. J. Laszlo"
+, title =       "A data structure for manipulating three-dimensional subdivisions"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1987
+, note =        "Report CS-TR-125-87"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @inproceedings{l-fppcl-91
-, author =	"J.-C. Latombe"
-, title =	"A fast path-planner for a car-like indoor mobile robot"
-, booktitle =	"Proc. 9th Nat. Conf. Artif. Intell."
-, year =	1991
-, pages =	"659--665"
-, update =	"97.11 bibrelex"
+, author =      "J.-C. Latombe"
+, title =       "A fast path-planner for a car-like indoor mobile robot"
+, booktitle =   "Proc. 9th Nat. Conf. Artif. Intell."
+, year =        1991
+, pages =       "659--665"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{l-mpupb-88
-, author =	"J.-C. Latombe"
-, title =	"Motion planning with uncertainty: The preimage backchaining approach"
-, number =	"STAN-CS-88-1196"
-, institution =	"Department of Computer Science, Stanford University"
-, year =	1988
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "J.-C. Latombe"
+, title =       "Motion planning with uncertainty: The preimage backchaining approach"
+, number =      "STAN-CS-88-1196"
+, institution = "Department of Computer Science, Stanford University"
+, year =        1988
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @book{l-rmp-91
-, author =	"J.-C. Latombe"
-, title =	"Robot Motion Planning"
-, publisher =	"Kluwer Academic Publishers"
-, address =	"Boston"
-, year =	1991
-, keywords =	"robotics"
-, update =	"93.05 orourke"
+, author =      "J.-C. Latombe"
+, title =       "Robot Motion Planning"
+, publisher =   "Kluwer Academic Publishers"
+, address =     "Boston"
+, year =        1991
+, keywords =    "robotics"
+, update =      "93.05 orourke"
 }
 
 @inproceedings{lwc-astp-95
-, author =	"J.-C. Latombe and R. H. Wilson"
-, title =	"Assembly sequencing with toleranced parts"
-, booktitle =	"Proc. 3rd ACM Symposium on Solid Modeling and Applications"
-, site =	"Salt Lake City"
-, year =	1995
-, update =	"99.11 bibrelex, 96.05 ramkumar"
+, author =      "J.-C. Latombe and R. H. Wilson"
+, title =       "Assembly sequencing with toleranced parts"
+, booktitle =   "Proc. 3rd ACM Symposium on Solid Modeling and Applications"
+, site =        "Salt Lake City"
+, year =        1995
+, update =      "99.11 bibrelex, 96.05 ramkumar"
 }
 
 @inproceedings{les-gsd-97
-, author =	"Harald Lauer and Matthias Ettrich and Klaus Soukup"
-, title =	"{GraVis} - System Demonstration"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"344--349"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Harald Lauer and Matthias Ettrich and Klaus Soukup"
+, title =       "{GraVis} - System Demonstration"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "344--349"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @incollection{l-chi-82
-, author =	"M. Lauer"
-, title =	"Computing by homomorphic images"
-, editor =	"B. Buchberger and G. E. Collins and R. Loos"
-, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
-, publisher =	"Springer-Verlag"
-, year =	1982
-, pages =	"139--168"
-, update =	"98.07 bibrelex"
+, author =      "M. Lauer"
+, title =       "Computing by homomorphic images"
+, editor =      "B. Buchberger and G. E. Collins and R. Loos"
+, booktitle =   "Computer Algebra: Symbolic and Algebraic Computation"
+, publisher =   "Springer-Verlag"
+, year =        1982
+, pages =       "139--168"
+, update =      "98.07 bibrelex"
 }
 
 @article{l-cpt-90
-, author =	"J.-P. Laumond"
-, title =	"Connectivity of planar triangulations"
-, journal =	"Inform. Process. Lett."
-, volume =	34
-, number =	2
-, month =	mar
-, year =	1990
-, pages =	"87--96"
-, update =	"98.11 bibrelex"
+, author =      "J.-P. Laumond"
+, title =       "Connectivity of planar triangulations"
+, journal =     "Inform. Process. Lett."
+, volume =      34
+, number =      2
+, month =       mar
+, year =        1990
+, pages =       "87--96"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{l-ftmrk-86
-, author =	"J. P. Laumond"
-, title =	"Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints"
-, editor =	"L. O. Hertzberger and F. C. A. Groen"
-, booktitle =	"Conference on Intelligent Autonomous Systems (Amsterdam, the Netherlands, December 8--11, 1986)"
-, publisher =	"Elsevier Science Publishers"
-, month =	dec
-, year =	1986
-, pages =	"346--354"
-, update =	"95.01 mitchell, 95.01 mitchell"
+, author =      "J. P. Laumond"
+, title =       "Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints"
+, editor =      "L. O. Hertzberger and F. C. A. Groen"
+, booktitle =   "Conference on Intelligent Autonomous Systems (Amsterdam, the Netherlands, December 8--11, 1986)"
+, publisher =   "Elsevier Science Publishers"
+, month =       dec
+, year =        1986
+, pages =       "346--354"
+, update =      "95.01 mitchell, 95.01 mitchell"
 }
 
 @inproceedings{l-fcfst-87
-, author =	"J.-P. Laumond"
-, title =	"Finding collision-free smooth trajectories for a non-holonomic mobile robot"
-, booktitle =	"Proc. Internat. Joint Conf. Artif. Intell."
-, year =	1987
-, pages =	"1120--1123"
-, update =	"97.11 bibrelex"
+, author =      "J.-P. Laumond"
+, title =       "Finding collision-free smooth trajectories for a non-holonomic mobile robot"
+, booktitle =   "Proc. Internat. Joint Conf. Artif. Intell."
+, year =        1987
+, pages =       "1120--1123"
+, update =      "97.11 bibrelex"
 }
 
 @article{l-ognw-87
-, author =	"J.-P. Laumond"
-, title =	"Obstacle growing in a nonpolygonal world"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"41--50"
-, keywords =	"combinatorial geometry"
+, author =      "J.-P. Laumond"
+, title =       "Obstacle growing in a nonpolygonal world"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "41--50"
+, keywords =    "combinatorial geometry"
 }
 
 @inproceedings{la-gapmt-89
-, author =	"J.-P. Laumond and R. Alami"
-, title =	"A geometrical approach to planning manipulation tasks in robotics"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	21
+, author =      "J.-P. Laumond and R. Alami"
+, title =       "A geometrical approach to planning manipulation tasks in robotics"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       21
 }
 
 @article{ljtm-mpnmr-94
-, author =	"J.-P. Laumond and P. Jacobs and M. Taix and R. M. Murray"
-, title =	"A Motion Planner for Nonholonomic Mobile Robots"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	10
-, number =	5
-, year =	1994
-, pages =	"577--593"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex"
+, author =      "J.-P. Laumond and P. Jacobs and M. Taix and R. M. Murray"
+, title =       "A Motion Planner for Nonholonomic Mobile Robots"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      10
+, number =      5
+, year =        1994
+, pages =       "577--593"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.11 bibrelex"
 }
 
 @book{lo-afr2-96
-, title =	"Algorithms for Robotic Motion and Manipulation"
-, editor =	"J.-P. Laumond and M. H. Overmars"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1996
-, update =	"97.03 schwarzkopf"
+, title =       "Algorithms for Robotic Motion and Manipulation"
+, editor =      "J.-P. Laumond and M. H. Overmars"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1996
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{ls-mispc-93
-, author =	"J.-P. Laumond and P. Sou{\`e}res"
-, title =	"Metric induced by the shortest paths for a car-like robot"
-, booktitle =	"IEEE Internat. Workshop on Intelligent Robots and Systems"
-, site =	"Yokohama, Japan"
-, year =	1993
-, pages =	""
-, update =	"94.05 devillers"
+, author =      "J.-P. Laumond and P. Sou{\`e}res"
+, title =       "Metric induced by the shortest paths for a car-like robot"
+, booktitle =   "IEEE Internat. Workshop on Intelligent Robots and Systems"
+, site =        "Yokohama, Japan"
+, year =        1993
+, pages =       ""
+, update =      "94.05 devillers"
 }
 
 @inproceedings{l-isroo-93
-, author =	"A. Laurentini"
-, title =	"Inferring the shape of the real object from the object reconstructid by volume intersection"
-, booktitle =	"Proc. IEEE CVPR"
-, site =	"New York"
-, month =	jun
-, year =	1993
-, pages =	"280--285"
-, update =	"98.11 bibrelex"
+, author =      "A. Laurentini"
+, title =       "Inferring the shape of the real object from the object reconstructid by volume intersection"
+, booktitle =   "Proc. IEEE CVPR"
+, site =        "New York"
+, month =       jun
+, year =        1993
+, pages =       "280--285"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{l-mnvio-93
-, author =	"A. Laurentini"
-, title =	"On the minimal number of volume intersection operations necessary for reconstructing a {$3D$} object"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"285--290"
-, cites =	"s-rtddi-81, ka-rpcsm-86, ca-mrsro-89, sa-agoos-87, t-impbp-87, av-gooso-89, hs-drwsv-85, sp-viosd-91, ma-vdomv-83, s-cgmvi-90, p-gom3o-87, n-coatd-88, ca-vsort-86, c-mvor-87, l-viacd-89, n-loviu-92, l-vhntc-91, l-vhsr-92, l-vhcsi-, lpr-lovi-89, l-isroo-93, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "A. Laurentini"
+, title =       "On the minimal number of volume intersection operations necessary for reconstructing a {$3D$} object"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "285--290"
+, cites =       "s-rtddi-81, ka-rpcsm-86, ca-mrsro-89, sa-agoos-87, t-impbp-87, av-gooso-89, hs-drwsv-85, sp-viosd-91, ma-vdomv-83, s-cgmvi-90, p-gom3o-87, n-coatd-88, ca-vsort-86, c-mvor-87, l-viacd-89, n-loviu-92, l-vhntc-91, l-vhsr-92, l-vhcsi-, lpr-lovi-89, l-isroo-93, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{l-swag-96
-, author =	"A. Laurentini"
-, title =	"The surveillance of the walls of an art gallery"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"223--233"
-, update =	"96.09 mitchell"
+, author =      "A. Laurentini"
+, title =       "The surveillance of the walls of an art gallery"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "223--233"
+, update =      "96.09 mitchell"
 }
 
 @inproceedings{l-vhntc-91
-, author =	"A. Laurentini"
-, title =	"The visual Hull: a new tool for contour-based image understanding"
-, booktitle =	"Proc. 7th Scandinavian Conf. on Image Analysis"
-, year =	1991
-, pages =	"993--1002"
-, update =	"98.11 bibrelex"
+, author =      "A. Laurentini"
+, title =       "The visual Hull: a new tool for contour-based image understanding"
+, booktitle =   "Proc. 7th Scandinavian Conf. on Image Analysis"
+, year =        1991
+, pages =       "993--1002"
+, update =      "98.11 bibrelex"
 }
 
 @unpublished{l-vhcsi-
-, author =	"A. Laurentini"
-, title =	"The visual hull concept for silhouette-based image understanding"
-, note =	"to appear in IEEE Trans. Pattern Anal. Machine Intell."
-, update =	"98.11 bibrelex"
+, author =      "A. Laurentini"
+, title =       "The visual hull concept for silhouette-based image understanding"
+, note =        "to appear in IEEE Trans. Pattern Anal. Machine Intell."
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{l-vhsr-92
-, author =	"A. Laurentini"
-, title =	"The visual hull of solids of revolution"
-, booktitle =	"Proc. 11th IAPR Int. Conf. on Pattern Recognition"
-, site =	"The Hague"
-, year =	1992
-, pages =	"720--724"
-, update =	"98.11 bibrelex"
+, author =      "A. Laurentini"
+, title =       "The visual hull of solids of revolution"
+, booktitle =   "Proc. 11th IAPR Int. Conf. on Pattern Recognition"
+, site =        "The Hague"
+, year =        1992
+, pages =       "720--724"
+, update =      "98.11 bibrelex"
 }
 
 @book{lt-fsis-92
-, author =	"Robert Laurini and Derek Thompson"
-, title =	"Fundamentals of Spatial Information Systems"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1992
-, isbn =	"0-12-438380-7"
-, update =	"95.09 mitchell"
+, author =      "Robert Laurini and Derek Thompson"
+, title =       "Fundamentals of Spatial Information Systems"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1992
+, isbn =        "0-12-438380-7"
+, update =      "95.09 mitchell"
 }
 
 @article{l-cwffd-85
-, author =	"C. Lautemann"
-, title =	"Cases where the floor function doesn't help"
-, journal =	"Bull. EATCS"
-, volume =	26
-, year =	1985
-, pages =	159
-, comments =	"Talk presented at the 2nd Meeting on Efficient
-		 Algorithms, Oberwolfach, West Germany (Nov. 1984)."
+, author =      "C. Lautemann"
+, title =       "Cases where the floor function doesn't help"
+, journal =     "Bull. EATCS"
+, volume =      26
+, year =        1985
+, pages =       159
+, comments =    "Talk presented at the 2nd Meeting on Efficient
+                 Algorithms, Oberwolfach, West Germany (Nov. 1984)."
 }
 
 @article{l-4dbst-78
-, author =	"L. Lauther"
-, title =	"$4$-dimensional binary search trees as $2$ means to speed up associative searches in design rule verification of integrated circuits"
-, journal =	"J. Design Autom. Fault-Tolerant Comput."
-, volume =	2
-, year =	1978
-, pages =	"241--247"
+, author =      "L. Lauther"
+, title =       "$4$-dimensional binary search trees as $2$ means to speed up associative searches in design rule verification of integrated circuits"
+, journal =     "J. Design Autom. Fault-Tolerant Comput."
+, volume =      2
+, year =        1978
+, pages =       "241--247"
 }
 
 @article{lg-gcvfm-85
-, author =	"S. E. Laux and B. M. Grossman"
-, title =	"A general control volume formulation for modeling impact ionization in semiconductor transport"
-, journal =	"IEEE Trans. Electron. Devices"
-, volume =	32
-, year =	1985
-, pages =	"2076--2081"
-, update =	"97.11 bibrelex"
+, author =      "S. E. Laux and B. M. Grossman"
+, title =       "A general control volume formulation for modeling impact ionization in semiconductor transport"
+, journal =     "IEEE Trans. Electron. Devices"
+, volume =      32
+, year =        1985
+, pages =       "2076--2081"
+, update =      "97.11 bibrelex"
 }
 
 % ### others?
 @inproceedings{l-viacd-89
-, author =	"Lavakusha and others"
-, title =	"Volume intersection algorithms with changing directions of views"
-, booktitle =	"Proc. MIV-89"
-, site =	"Tokyo"
-, year =	1989
-, pages =	"309--314"
-, update =	"98.11 bibrelex"
+, author =      "Lavakusha and others"
+, title =       "Volume intersection algorithms with changing directions of views"
+, booktitle =   "Proc. MIV-89"
+, site =        "Tokyo"
+, year =        1989
+, pages =       "309--314"
+, update =      "98.11 bibrelex"
 }
 
 @article{lpr-lovi-89
-, author =	"Lavakusha and Arun K. Pujari and P. G. Reddy"
-, title =	"Linear octrees by volume intersection"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	45
-, month =	mar
-, year =	1989
-, pages =	"371--379"
-, update =	"98.11 bibrelex"
+, author =      "Lavakusha and Arun K. Pujari and P. G. Reddy"
+, title =       "Linear octrees by volume intersection"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      45
+, month =       mar
+, year =        1989
+, pages =       "371--379"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{llglm-futwo-97
-, author =	"S. M. LaValle and D. Lin and L. J. Guibas and J.-C. Latombe and R. Motwani"
-, title =	"Finding an unpredictable target in a workspace with obstacles"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, month =	apr
-, year =	1997
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "S. M. LaValle and D. Lin and L. J. Guibas and J.-C. Latombe and R. Motwani"
+, title =       "Finding an unpredictable target in a workspace with obstacles"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, month =       apr
+, year =        1997
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{lss-asprf-00
-, author =	"Steven M. LaValle and Borislav Simov and Giora Slutzki"
-, title =	"An Algorithm for Searching a Polygonal Region with a Flashlight"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"260--269"
-, update =	"00.11 jones"
+, author =      "Steven M. LaValle and Borislav Simov and Giora Slutzki"
+, title =       "An Algorithm for Searching a Polygonal Region with a Flashlight"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "260--269"
+, update =      "00.11 jones"
 }
 
 @article{lbdww-vdsts-92
-, author =	"David Lavender and Adrian Bowyer and James Davenport and Andrew Wallis and John Woodwark"
-, title =	"{Voronoi} Diagrams of Set-Theoretic Solid Models"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	12
-, number =	5
-, month =	sep
-, year =	1992
-, pages =	"69--77"
-, update =	"95.01 schwarzkopf"
+, author =      "David Lavender and Adrian Bowyer and James Davenport and Andrew Wallis and John Woodwark"
+, title =       "{Voronoi} Diagrams of Set-Theoretic Solid Models"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      12
+, number =      5
+, month =       sep
+, year =        1992
+, pages =       "69--77"
+, update =      "95.01 schwarzkopf"
 }
 
 @book{l-conm-76
-, author =	"E. Lawler"
-, title =	"Combinatorial Optimization: {Networks} and Matroids"
-, publisher =	"Holt, Rinehart \& Winston"
-, address =	"New York"
-, year =	1976
-, update =	"93.09 milone+mitchell"
+, author =      "E. Lawler"
+, title =       "Combinatorial Optimization: {Networks} and Matroids"
+, publisher =   "Holt, Rinehart \& Winston"
+, address =     "New York"
+, year =        1976
+, update =      "93.09 milone+mitchell"
 }
 
 @book{llrs-tsp-85
-, title =	"The Traveling Salesman Problem"
-, editor =	"E. L. Lawler and J. K. Lenstra and A. H. G. {Rinnooy Kan} and D. B. Shmoys"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1985
-, isbn =	"0-471-90413-9"
-, keywords =	"book"
-, update =	"99.11 bibrelex, 97.03 pocchiola, 93.09 rote"
-, annote =	"a collection of survey articles by various authors (the BIBLE on the TSP)"
+, title =       "The Traveling Salesman Problem"
+, editor =      "E. L. Lawler and J. K. Lenstra and A. H. G. {Rinnooy Kan} and D. B. Shmoys"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1985
+, isbn =        "0-471-90413-9"
+, keywords =    "book"
+, update =      "99.11 bibrelex, 97.03 pocchiola, 93.09 rote"
+, annote =      "a collection of survey articles by various authors (the BIBLE on the TSP)"
 }
 
 @techreport{lm-mcnif-91
-, author =	"G. Lawlor and F. Morgan"
-, title =	"Minimizing cones and networks: immiscible fluids, norms, and calibrations"
-, type =	"Preprint"
-, institution =	"Williams College"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "G. Lawlor and F. Morgan"
+, title =       "Minimizing cones and networks: immiscible fluids, norms, and calibrations"
+, type =        "Preprint"
+, institution = "Williams College"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @misc{lm-pcasi-91
-, author =	"G. Lawlor and F. Morgan"
-, title =	"Paired calibrations applied to soapfilms, immiscible fluids, and surfaces or networks minimizing other norms"
-, howpublished =	"Preprint"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "G. Lawlor and F. Morgan"
+, title =       "Paired calibrations applied to soapfilms, immiscible fluids, and surfaces or networks minimizing other norms"
+, howpublished =        "Preprint"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @article{l-pvc-91
-, author =	"J. Lawrence"
-, title =	"Polytope volume computation"
-, journal =	"Math. Comput."
-, volume =	57
-, number =	195
-, year =	1991
-, pages =	"259--271"
-, update =	"97.11 bibrelex"
+, author =      "J. Lawrence"
+, title =       "Polytope volume computation"
+, journal =     "Math. Comput."
+, volume =      57
+, number =      195
+, year =        1991
+, pages =       "259--271"
+, update =      "97.11 bibrelex"
 }
 
 @article{l-vp-88
-, author =	"J. Lawrence"
-, title =	"Valuations and polarity"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"307--324"
+, author =      "J. Lawrence"
+, title =       "Valuations and polarity"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "307--324"
 }
 
 @book{l-cspc-72
-, author =	"J. D. Lawrence"
-, title =	"A Catalog of Special Plane Curves"
-, publisher =	"Dover Publications"
-, address =	"New York, NY"
-, year =	1972
-, update =	"94.01 tamassia"
+, author =      "J. D. Lawrence"
+, title =       "A Catalog of Special Plane Curves"
+, publisher =   "Dover Publications"
+, address =     "New York, NY"
+, year =        1972
+, update =      "94.01 tamassia"
 }
 
 @techreport{l-ccit-76
-, author =	"C. L. Lawson"
-, title =	"{$C^{1}$}-compatible interpolation over a triangle"
-, type =	"Technical {Memo}"
-, number =	"33-770"
-, institution =	"Jet Propulsion Lab., California Inst. Tech."
-, address =	"Pasadena, CA"
-, year =	1976
+, author =      "C. L. Lawson"
+, title =       "{$C^{1}$}-compatible interpolation over a triangle"
+, type =        "Technical {Memo}"
+, number =      "33-770"
+, institution = "Jet Propulsion Lab., California Inst. Tech."
+, address =     "Pasadena, CA"
+, year =        1976
 }
 
 @article{l-csisd-84
-, author =	"C. L. Lawson"
-, title =	"${C}^1$ Surface Interpolation For Scattered Data on a Sphere"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, number =	1
-, year =	1984
-, pages =	"177--202"
-, annote =	"Triangulates sphere using incremental algorithm with
-		 switching. Switching rule is to make the quadrilateral
-		 convex with respect to the sphere."
+, author =      "C. L. Lawson"
+, title =       "${C}^1$ Surface Interpolation For Scattered Data on a Sphere"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, number =      1
+, year =        1984
+, pages =       "177--202"
+, annote =      "Triangulates sphere using incremental algorithm with
+                 switching. Switching rule is to make the quadrilateral
+                 convex with respect to the sphere."
 }
 
 @techreport{l-gtgac-72
-, author =	"C. L. Lawson"
-, title =	"Generation of a triangular grid with applications to contour plotting"
-, type =	"Memo"
-, number =	299
-, institution =	"Jet Propulsion Lab., California Inst. Tech."
-, address =	"Pasadena, CA"
-, year =	1972
+, author =      "C. L. Lawson"
+, title =       "Generation of a triangular grid with applications to contour plotting"
+, type =        "Memo"
+, number =      299
+, institution = "Jet Propulsion Lab., California Inst. Tech."
+, address =     "Pasadena, CA"
+, year =        1972
 }
 
 @techreport{l-i2cts-76
-, author =	"C. L. Lawson"
-, title =	"Integrals of {$2C^{1}$}-compatible triangular surface element"
-, type =	"Technical {Memo}"
-, number =	"33-808"
-, institution =	"Jet Propulsion Lab., California Inst. Tech."
-, address =	"Pasadena, CA"
-, year =	1976
+, author =      "C. L. Lawson"
+, title =       "Integrals of {$2C^{1}$}-compatible triangular surface element"
+, type =        "Technical {Memo}"
+, number =      "33-808"
+, institution = "Jet Propulsion Lab., California Inst. Tech."
+, address =     "Pasadena, CA"
+, year =        1976
 }
 
 @article{l-pndt-86
-, author =	"Charles L. Lawson"
-, title =	"Properties Of {N}-Dimensional Triangulations"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	3
-, number =	4
-, month =	dec
-, year =	1986
-, pages =	"231--246"
-, keywords =	"n-dimensional triangulation, Delaunay triangulation, Dirichlet tessellation"
-, annote =	"Generalizes some of the properties of 2D
-		 triangulations."
-, abstract =	"This paper establishes a number of mathematical
-		 results relevant to the problem of constructing a
-		 triangulation, i. e. , a simplical tessellation of the
-		 convex hull of an arbitrary finite set of points in
-		 n-space. The principal results of the present paper are
-		 (a) A set of n PLUS 2 points in n-space may be
-		 triangulated in at most 2 different ways. (b) The
-		 'sphere test' defined in this paper selects a preferred
-		 one of these two triangulations. (c) A set of
-		 parameters is defined that permits the characterization
-		 and enumeration of all sets of n PLUS 2 points in
-		 n-space that are significantly different from the point
-		 of view of their possible triangulations. (d) The local
-		 sphere test induces a global sphere test property for a
-		 triangulation. (e) A triangulation satisfying the
-		 global sphere property is dual to the n-dimensional
-		 Dirichlet tessellation, i. e. , it is a Delaunay
-		 triangulation. (Author abstract) 12 refs."
+, author =      "Charles L. Lawson"
+, title =       "Properties Of {N}-Dimensional Triangulations"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      3
+, number =      4
+, month =       dec
+, year =        1986
+, pages =       "231--246"
+, keywords =    "n-dimensional triangulation, Delaunay triangulation, Dirichlet tessellation"
+, annote =      "Generalizes some of the properties of 2D
+                 triangulations."
+, abstract =    "This paper establishes a number of mathematical
+                 results relevant to the problem of constructing a
+                 triangulation, i. e. , a simplical tessellation of the
+                 convex hull of an arbitrary finite set of points in
+                 n-space. The principal results of the present paper are
+                 (a) A set of n PLUS 2 points in n-space may be
+                 triangulated in at most 2 different ways. (b) The
+                 'sphere test' defined in this paper selects a preferred
+                 one of these two triangulations. (c) A set of
+                 parameters is defined that permits the characterization
+                 and enumeration of all sets of n PLUS 2 points in
+                 n-space that are significantly different from the point
+                 of view of their possible triangulations. (d) The local
+                 sphere test induces a global sphere test property for a
+                 triangulation. (e) A triangulation satisfying the
+                 global sphere property is dual to the n-dimensional
+                 Dirichlet tessellation, i. e. , it is a Delaunay
+                 triangulation. (Author abstract) 12 refs."
 }
 
 @incollection{l-scsi-77
-, author =	"C. L. Lawson"
-, title =	"Software for {$C^{1}$} surface interpolation"
-, editor =	"J. R. Rice"
-, booktitle =	"Math. Software III"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1977
-, pages =	"161--194"
-, update =	"97.03 schwarzkopf"
+, author =      "C. L. Lawson"
+, title =       "Software for {$C^{1}$} surface interpolation"
+, editor =      "J. R. Rice"
+, booktitle =   "Math. Software III"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1977
+, pages =       "161--194"
+, update =      "97.03 schwarzkopf"
 }
 
 @techreport{l-spndt-85
-, author =	"C. L. Lawson"
-, title =	"Some properties of $n$-dimensional triangulations"
-, type =	"Publication"
-, number =	"85-42"
-, institution =	"Jet Propulsion Lab., California Inst. Tech."
-, address =	"Pasadena, CA"
-, year =	1985
+, author =      "C. L. Lawson"
+, title =       "Some properties of $n$-dimensional triangulations"
+, type =        "Publication"
+, number =      "85-42"
+, institution = "Jet Propulsion Lab., California Inst. Tech."
+, address =     "Pasadena, CA"
+, year =        1985
 }
 
 @article{l-tt-72
-, author =	"C. L. Lawson"
-, title =	"Transforming Triangulations"
-, journal =	"Discrete Math."
-, volume =	3
-, year =	1972
-, pages =	"365--372"
-, annote =	"Proves that any triangulation of a given set of points
-		 can be transformed into any other by a sequence of
-		 ``exchanges''. (If two adjacent triangles form a convex
-		 quadrilateral, replace the included diagonal with the
-		 other one.)"
+, author =      "C. L. Lawson"
+, title =       "Transforming Triangulations"
+, journal =     "Discrete Math."
+, volume =      3
+, year =        1972
+, pages =       "365--372"
+, annote =      "Proves that any triangulation of a given set of points
+                 can be transformed into any other by a sequence of
+                 ``exchanges''. (If two adjacent triangles form a convex
+                 quadrilateral, replace the included diagonal with the
+                 other one.)"
 }
 
 @book{l-csa-72
-, author =	"S. R. Lay"
-, title =	"Convex Sets and Their applications"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1972
-, update =	"99.11 bibrelex, 98.07 bibrelex"
+, author =      "S. R. Lay"
+, title =       "Convex Sets and Their applications"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1972
+, update =      "99.11 bibrelex, 98.07 bibrelex"
 }
 
 @book{l-csta-82
-, author =	"Steven R. Lay"
-, title =	"Convex Sets and Their Applications"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1982
-, keywords =	"book"
-, update =	"98.11 kuehn"
+, author =      "Steven R. Lay"
+, title =       "Convex Sets and Their Applications"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1982
+, keywords =    "book"
+, update =      "98.11 kuehn"
 }
 
 @article{l-sss-71
-, author =	"S. R. Lay"
-, title =	"On separation by spherical surfaces"
-, journal =	"Amer. Math. Monthly"
-, volume =	78
-, year =	1971
-, pages =	"1112--1113"
-, update =	"99.11 devillers"
+, author =      "S. R. Lay"
+, title =       "On separation by spherical surfaces"
+, journal =     "Amer. Math. Monthly"
+, volume =      78
+, year =        1971
+, pages =       "1112--1113"
+, update =      "99.11 devillers"
 }
 
 @techreport{ll-lbrn-92
-, author =	"A. Lazanas and J.-C. Latombe"
-, title =	"Landmark-based robot navigation"
-, type =	"Technical {Report}"
-, institution =	"Dept. of Computer Science, Stanford University"
-, year =	1992
-, update =	"99.11 bibrelex, 93.09 milone+mitchell"
+, author =      "A. Lazanas and J.-C. Latombe"
+, title =       "Landmark-based robot navigation"
+, type =        "Technical {Report}"
+, institution = "Dept. of Computer Science, Stanford University"
+, year =        1992
+, update =      "99.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @techreport{ll-mpula-92
-, author =	"A. Lazanas and J.-C. Latombe"
-, title =	"Motion planning with uncertainty: {A} landmark approach"
-, type =	"Technical {Report}"
-, institution =	"Dept. of Computer Science, Stanford University"
-, year =	1992
-, update =	"99.11 bibrelex, 93.09 milone+mitchell"
+, author =      "A. Lazanas and J.-C. Latombe"
+, title =       "Motion planning with uncertainty: {A} landmark approach"
+, type =        "Technical {Report}"
+, institution = "Dept. of Computer Science, Stanford University"
+, year =        1992
+, update =      "99.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{l-gbger-83
-, author =	"D. Lazard"
-, title =	"{Gr{\"o}bner}-Bases, {Gaussian} Elimination and Resolution of Systems of Algebraic Equations"
-, booktitle =	"Proc. EUROCAL 83"
-, year =	1983
-, pages =	"146--156"
-, update =	"97.11 bibrelex"
+, author =      "D. Lazard"
+, title =       "{Gr{\"o}bner}-Bases, {Gaussian} Elimination and Resolution of Systems of Algebraic Equations"
+, booktitle =   "Proc. EUROCAL 83"
+, year =        1983
+, pages =       "146--156"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{l-ptrmn-96
-, author =	"Sylvain Lazard"
-, title =	"Planification de trajectoires de robots mobiles non-holonomes et de robots {\`a} pattes"
-, type =	"Th\`{e}se de doctorat en sciences"
-, school =	"universit\'e Paris 6"
-, address =	"France"
-, year =	1996
-, url =	"http://www-sop.inria.fr/prisme/publis/these-lazard.ps.gz"
-, keywords =	"doctoral thesis"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers"
+, author =      "Sylvain Lazard"
+, title =       "Planification de trajectoires de robots mobiles non-holonomes et de robots {\`a} pattes"
+, type =        "Th\`{e}se de doctorat en sciences"
+, school =      "universit\'e Paris 6"
+, address =     "France"
+, year =        1996
+, url = "http://www-sop.inria.fr/prisme/publis/these-lazard.ps.gz"
+, keywords =    "doctoral thesis"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 devillers"
 }
 
 @techreport{l-spbcc-97
-, author =	"Sylvain Lazard"
-, title =	"Shortest Paths of Bounded Curvature in a Convex Polygon"
-, type =	"Manuscript, Presented at the 2nd CGC Workshop on Computational Geometry, October, 1997"
-, institution =	"McGill University"
-, year =	1997
-, update =	"98.03 mitchell"
+, author =      "Sylvain Lazard"
+, title =       "Shortest Paths of Bounded Curvature in a Convex Polygon"
+, type =        "Manuscript, Presented at the 2nd CGC Workshop on Computational Geometry, October, 1997"
+, institution = "McGill University"
+, year =        1997
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{lpvv-ccpso-01
-, author =	"Francis Lazarus and Michel Pocchiola and Gert Vegter and Anne Verroust"
-, title =	"Computing a Canonical Polygonal Schema of an Orientable Triangulated Surface"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"146--149"
-, update =	"01.04 icking"
+, author =      "Francis Lazarus and Michel Pocchiola and Gert Vegter and Anne Verroust"
+, title =       "Computing a Canonical Polygonal Schema of an Orientable Triangulated Surface"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "146--149"
+, update =      "01.04 icking"
 }
 
 @inproceedings{lsfb-hdtcb-88
-, author =	"E. {Le Bras-Mehlman} and M. Schmitt and O. D. Faugeras and J. D. Boissonnat"
-, title =	"How The {Delaunay} Triangulation Can Be Used For Representing Stereo Data"
-, booktitle =	"Second International Conference on Computer Vision"
-, publisher =	"IEEE"
-, address =	"New York, NY"
-, year =	1988
-, pages =	"54--63"
-, keywords =	"Delaunay triangulation, stereo data"
-, annote =	"Uses Watson style insertion algorithm. Constraints are
-		 dealt with by adding extra points. To get a
-		 triangulated surface we discard tetrahedra that block
-		 visibility of line segments. This is combined with 3D
-		 DT calculation."
-, abstract =	"A coherent method is discussed of interpolating 3-D
-		 data with a polyhedral surface by the Delaunay
-		 triangulation. First some theoretical properties are
-		 given concerning the approximation of sampled objects
-		 obtained when the sampling rate increases, based on
-		 study of object skeletons using some tools of
-		 mathematical morphology. Then the algorithms and their
-		 complexity analysis are presented which yield both a
-		 surface representation of objects and a volume
-		 representation of free space. This goal is achieved by
-		 means of a simple visibility criterion. The method is
-		 intrinsically discontinuity- preserving and is useful
-		 for the integration of multiple viewpoints. 32 Refs."
+, author =      "E. {Le Bras-Mehlman} and M. Schmitt and O. D. Faugeras and J. D. Boissonnat"
+, title =       "How The {Delaunay} Triangulation Can Be Used For Representing Stereo Data"
+, booktitle =   "Second International Conference on Computer Vision"
+, publisher =   "IEEE"
+, address =     "New York, NY"
+, year =        1988
+, pages =       "54--63"
+, keywords =    "Delaunay triangulation, stereo data"
+, annote =      "Uses Watson style insertion algorithm. Constraints are
+                 dealt with by adding extra points. To get a
+                 triangulated surface we discard tetrahedra that block
+                 visibility of line segments. This is combined with 3D
+                 DT calculation."
+, abstract =    "A coherent method is discussed of interpolating 3-D
+                 data with a polyhedral surface by the Delaunay
+                 triangulation. First some theoretical properties are
+                 given concerning the approximation of sampled objects
+                 obtained when the sampling rate increases, based on
+                 study of object skeletons using some tools of
+                 mathematical morphology. Then the algorithms and their
+                 complexity analysis are presented which yield both a
+                 surface representation of objects and a volume
+                 representation of free space. This goal is achieved by
+                 means of a simple visibility criterion. The method is
+                 intrinsically discontinuity- preserving and is useful
+                 for the integration of multiple viewpoints. 32 Refs."
 }
 
 @inproceedings{l-qsan-97
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"A Quantum--Searching Application Note"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"113--116"
-, update =	"99.03 bibrelex, 97.11 jones"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "A Quantum--Searching Application Note"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "113--116"
+, update =      "99.03 bibrelex, 97.11 jones"
 }
 
 @techreport{l-avd3s-99
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"Abstract {Voronoi} Diagrams in 3-Space"
-, number =	"HKUST-TCSC-99-11"
-, institution =	"Hong Kong University of Science and Technology, Theoretical Computer Science Center"
-, year =	1999
-, url =	"http://www.cs.ust.hk/tcsc/RR/1999-11.ps.gz"
-, update =	"00.03 bibrelex"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "Abstract {Voronoi} Diagrams in 3-Space"
+, number =      "HKUST-TCSC-99-11"
+, institution = "Hong Kong University of Science and Technology, Theoretical Computer Science Center"
+, year =        1999
+, url = "http://www.cs.ust.hk/tcsc/RR/1999-11.ps.gz"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{l-clvd3-98
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"Computing the {$L_\infty$}-{Voronoi} Diagram in 3-Space Optimally"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	113
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "Computing the {$L_\infty$}-{Voronoi} Diagram in 3-Space Optimally"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       113
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{l-dospg-95t
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"On Determining Optimal Strategies in Pursuit Games in the Plane"
-, number =	172
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1995
-, precedes =	"l-dospg-95"
-, update =	"98.11 bibrelex"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "On Determining Optimal Strategies in Pursuit Games in the Plane"
+, number =      172
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1995
+, precedes =    "l-dospg-95"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{l-dospg-95
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"On Determining Optimal Strategies in Pursuit Games in the Plane"
-, booktitle =	"Proc. 22th Internat. Colloq. Automata Lang. Program."
-, nickname =	"ICALP '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	944
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"499--510"
-, succeeds =	"l-dospg-95t"
-, update =	"98.11 bibrelex"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "On Determining Optimal Strategies in Pursuit Games in the Plane"
+, booktitle =   "Proc. 22th Internat. Colloq. Automata Lang. Program."
+, nickname =    "ICALP '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      944
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "499--510"
+, succeeds =    "l-dospg-95t"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{l-gpscs-93
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"On General Properties of Strictly Convex Smooth Distance Functions in {$R^d$}"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"375--380"
-, cites =	"ei-drmwc-79, h-dt-76, iklm-cdf3s-93, k-vd-73, m-dmpcg-90, s-nfa-69, ZZZ"
-, update =	"99.07 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "On General Properties of Strictly Convex Smooth Distance Functions in {$R^d$}"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "375--380"
+, cites =       "ei-drmwc-79, h-dt-76, iklm-cdf3s-93, k-vd-73, m-dmpcg-90, s-nfa-69, ZZZ"
+, update =      "99.07 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{l-nscdf-96
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"On Non-Smooth Convex Distance Functions"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, publisher =	"Carleton University Press, Ottawa, Canada"
-, year =	1996
-, pages =	"113--118"
-, update =	"99.07 bibrelex, 99.03 bibrelex, 96.09 mitchell"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "On Non-Smooth Convex Distance Functions"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, publisher =   "Carleton University Press, Ottawa, Canada"
+, year =        1996
+, pages =       "113--118"
+, update =      "99.07 bibrelex, 99.03 bibrelex, 96.09 mitchell"
 }
 
 @article{l-nscdf-97
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"On Non-Smooth Convex Distance Functions"
-, journal =	"Inform. Process. Lett."
-, volume =	63
-, number =	6
-, year =	1997
-, pages =	"323--329"
-, keywords =	"Voronoi diagram, convex distance function, abstract Voronoi diagram"
-, update =	"99.07 bibrelex, 99.03 bibrelex"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "On Non-Smooth Convex Distance Functions"
+, journal =     "Inform. Process. Lett."
+, volume =      63
+, number =      6
+, year =        1997
+, pages =       "323--329"
+, keywords =    "Voronoi diagram, convex distance function, abstract Voronoi diagram"
+, update =      "99.07 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{l-vdlmh-94
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"On {Voronoi} Diagrams in the {$L_p$} Metric in Higher Dimensions"
-, booktitle =	"Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	755
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"711--722"
-, precedes =	"l-vdlm-96"
-, update =	"99.11 bibrelex, 99.03 bibrelex, 98.03 icking"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "On {Voronoi} Diagrams in the {$L_p$} Metric in Higher Dimensions"
+, booktitle =   "Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      755
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "711--722"
+, precedes =    "l-vdlm-96"
+, update =      "99.11 bibrelex, 99.03 bibrelex, 98.03 icking"
 }
 
 @article{l-vdlm-96
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"On {Voronoi} diagrams in the {$L_p$}-metric in {$R^D$}"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, year =	1996
-, pages =	"177--196"
-, succeeds =	"l-vdlmh-94"
-, update =	"99.03 bibrelex, 97.03 smid"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "On {Voronoi} diagrams in the {$L_p$}-metric in {$R^D$}"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, year =        1996
+, pages =       "177--196"
+, succeeds =    "l-vdlmh-94"
+, update =      "99.03 bibrelex, 97.03 smid"
 }
 
 @techreport{l-ricsa-95t
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
-, number =	174
-, institution =	"Department of Computer Science, FernUniversit{\"a}t Hagen"
-, address =	"Germany"
-, year =	1995
-, precedes =	"l-ricsa-95"
-, update =	"98.11 bibrelex"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
+, number =      174
+, institution = "Department of Computer Science, FernUniversit{\"a}t Hagen"
+, address =     "Germany"
+, year =        1995
+, precedes =    "l-ricsa-95"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{l-ricsa-95
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
-, booktitle =	"Proc. 10th Internat. Conf. Fund. Comput. Theory"
-, nickname =	"FCT '95"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	965
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"333--342"
-, succeeds =	"l-ricsa-95t"
-, precedes =	"l-ricsa-97"
-, update =	"99.03 bibrelex, 98.11 bibrelex"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
+, booktitle =   "Proc. 10th Internat. Conf. Fund. Comput. Theory"
+, nickname =    "FCT '95"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      965
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "333--342"
+, succeeds =    "l-ricsa-95t"
+, precedes =    "l-ricsa-97"
+, update =      "99.03 bibrelex, 98.11 bibrelex"
 }
 
 @inproceedings{l-ricsa-95c
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"17--20"
-, update =	"00.03 bibrelex"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "17--20"
+, update =      "00.03 bibrelex"
 }
 
 @article{l-ricsa-97
-, author =	"Ngoc-Minh L{\^e}"
-, title =	"Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"279--298"
-, keywords =	"computational geometry, Voronoi diagrams, power diagrams, convex distance functions"
-, succeeds =	"l-ricsa-95"
-, update =	"99.03 bibrelex"
+, author =      "Ngoc-Minh L{\^e}"
+, title =       "Randomized Incremental Construction of Simple Abstract {Voronoi} Diagrams in 3-Space"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "279--298"
+, keywords =    "computational geometry, Voronoi diagrams, power diagrams, convex distance functions"
+, succeeds =    "l-ricsa-95"
+, update =      "99.03 bibrelex"
 }
 
 @article{ll-orpr-91
-, author =	"V. B. Le and D. T. Lee"
-, title =	"Out-of-roundness problem revisited"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-13"
-, number =	3
-, year =	1991
-, pages =	"217--223"
+, author =      "V. B. Le and D. T. Lee"
+, title =       "Out-of-roundness problem revisited"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-13"
+, number =      3
+, year =        1991
+, pages =       "217--223"
 }
 
 @incollection{l-smscs-91
-, author =	"A. Leach"
-, title =	"A survey of methods for searching the conformational space of small and medium sized molecules"
-, editor =	"K. Lipkowitz and D. Boyd"
-, booktitle =	"Reviews in Computational Chemistry"
-, volume =	2
-, publisher =	"VCH Publishers"
-, year =	1991
-, pages =	"1--47"
-, update =	"98.07 bibrelex"
+, author =      "A. Leach"
+, title =       "A survey of methods for searching the conformational space of small and medium sized molecules"
+, editor =      "K. Lipkowitz and D. Boyd"
+, booktitle =   "Reviews in Computational Chemistry"
+, volume =      2
+, publisher =   "VCH Publishers"
+, year =        1991
+, pages =       "1--47"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{l-iwcod-92
-, author =	"G. Leach"
-, title =	"Improving worst-case optimal {Delaunay} triangulation algorithms"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"340--346"
-, cites =	"d-fdcac-87, e-acg-87, f-savd-87, gs-dfbt-78, ps-cgi-85, b-prcv-75, dk-savd-87, gs-pmgsc-85, j-ecpqe-86, kln-edtur-91, ls-tacdt-80, s-a-88, s-cg-78, sh-cpp-75, st-sah-86, ZZZ"
-, update =	"99.03 forrest, 98.11 bibrelex, 98.07 bibrelex"
+, author =      "G. Leach"
+, title =       "Improving worst-case optimal {Delaunay} triangulation algorithms"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "340--346"
+, cites =       "d-fdcac-87, e-acg-87, f-savd-87, gs-dfbt-78, ps-cgi-85, b-prcv-75, dk-savd-87, gs-pmgsc-85, j-ecpqe-86, kln-edtur-91, ls-tacdt-80, s-a-88, s-cg-78, sh-cpp-75, st-sah-86, ZZZ"
+, update =      "99.03 forrest, 98.11 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{l-satps-90
-, author =	"A. Leblanc"
-, title =	"Some Applications of the Topological Plane Sweep Algorithm"
-, type =	"Technical {Report}"
-, number =	"SOCS 90.5"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "A. Leblanc"
+, title =       "Some Applications of the Topological Plane Sweep Algorithm"
+, type =        "Technical {Report}"
+, number =      "SOCS 90.5"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @article{lt-sptcc-91
-, author =	"?? L'Ecuyer and ?? Tezuka"
-, title =	"Structural properties for two classes of combined random number generators"
-, journal =	"Math. Comput."
-, volume =	57
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "?? L'Ecuyer and ?? Tezuka"
+, title =       "Structural properties for two classes of combined random number generators"
+, journal =     "Math. Comput."
+, volume =      57
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @article{l-epcrn-88
-, author =	"Pierre L'Ecuyer"
-, title =	"Efficient and portable combined random number generators"
-, journal =	"Commun. ACM"
-, volume =	31
-, year =	1988
-, pages =	"742--749, 774"
-, update =	"99.03 forrest, 98.03 bibrelex"
+, author =      "Pierre L'Ecuyer"
+, title =       "Efficient and portable combined random number generators"
+, journal =     "Commun. ACM"
+, volume =      31
+, year =        1988
+, pages =       "742--749, 774"
+, update =      "99.03 forrest, 98.03 bibrelex"
 }
 
 @inproceedings{lsscd-mmaps-98
-, author =	"A. W. F. Lee and W. Swelden and P. Schr{\"o}der and L. Cowsar and D. Dobkin"
-, title =	"MAPS: Multiresolution Adaptive Parameterization of Surfaces"
-, booktitle =	"Proc. SIGGRAPH '98"
-, site =	"Orlando, FL"
-, series =	"Computer Graphics Proceedings, Annual Conference Series"
-, month =	jul
-, year =	1998
-, pages =	"95--104"
-, update =	"98.11 held"
+, author =      "A. W. F. Lee and W. Swelden and P. Schr{\"o}der and L. Cowsar and D. Dobkin"
+, title =       "MAPS: Multiresolution Adaptive Parameterization of Surfaces"
+, booktitle =   "Proc. SIGGRAPH '98"
+, site =        "Orlando, FL"
+, series =      "Computer Graphics Proceedings, Annual Conference Series"
+, month =       jul
+, year =        1998
+, pages =       "95--104"
+, update =      "98.11 held"
 }
 
 @article{lr-ipses-71
-, author =	"B. Lee and F. M. Richards"
-, title =	"The interpretation of protein structure: {Estimation} of static accessibility"
-, journal =	"J. Molecular Biology"
-, volume =	55
-, year =	1971
-, pages =	"379--400"
-, update =	"98.03 agarwal+bibrelex"
+, author =      "B. Lee and F. M. Richards"
+, title =       "The interpretation of protein structure: {Estimation} of static accessibility"
+, journal =     "J. Molecular Biology"
+, volume =      55
+, year =        1971
+, pages =       "379--400"
+, update =      "98.03 agarwal+bibrelex"
 }
 
 @incollection{l-rtp-91
-, author =	"C. Lee"
-, title =	"Regular Triangulations of Polytopes"
-, editor =	""
-, booktitle =	"Applied Geometry and Discrete Mathematics"
-, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
-, volume =	4
-, publisher =	"AMS Press"
-, year =	1991
-, pages =	"443--456"
-, keywords =	"convex hull, expected-case analysis"
-, update =	"97.11 bibrelex, 95.05 korneenko"
+, author =      "C. Lee"
+, title =       "Regular Triangulations of Polytopes"
+, editor =      ""
+, booktitle =   "Applied Geometry and Discrete Mathematics"
+, series =      "DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
+, volume =      4
+, publisher =   "AMS Press"
+, year =        1991
+, pages =       "443--456"
+, keywords =    "convex hull, expected-case analysis"
+, update =      "97.11 bibrelex, 95.05 korneenko"
 }
 
 @article{ll-ccmp-84
-, author =	"C. C. Lee and D. T. Lee"
-, title =	"On a circle-cover minimization problem"
-, journal =	"Inform. Process. Lett."
-, volume =	18
-, year =	1984
-, pages =	"109--115"
+, author =      "C. C. Lee and D. T. Lee"
+, title =       "On a circle-cover minimization problem"
+, journal =     "Inform. Process. Lett."
+, volume =      18
+, year =        1984
+, pages =       "109--115"
 }
 
 @incollection{l-stp-97
-, author =	"C. W. Lee"
-, title =	"Subdivisions and triangulations of polytopes"
-, chapter =	14
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"271--290"
-, update =	"97.11 orourke"
+, author =      "C. W. Lee"
+, title =       "Subdivisions and triangulations of polytopes"
+, chapter =     14
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "271--290"
+, update =      "97.11 orourke"
 }
 
 @article{l-atng-89
-, author =	"C. W. Lee"
-, title =	"The Associahedron and Triangulations of the $n$-gon"
-, journal =	"European J. Combin."
-, volume =	10
-, year =	1989
-, pages =	"551--560"
-, update =	"97.11 bibrelex"
+, author =      "C. W. Lee"
+, title =       "The Associahedron and Triangulations of the $n$-gon"
+, journal =     "European J. Combin."
+, volume =      10
+, year =        1989
+, pages =       "551--560"
+, update =      "97.11 bibrelex"
 }
 
 @article{ll-ccagp-86
-, author =	"D. Lee and A. Lin"
-, title =	"Computational complexity of art gallery problems"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	32
-, number =	2
-, year =	1986
-, pages =	"276--282"
-, update =	"98.11 bibrelex, 94.05 devillers"
+, author =      "D. Lee and A. Lin"
+, title =       "Computational complexity of art gallery problems"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      32
+, number =      2
+, year =        1986
+, pages =       "276--282"
+, update =      "98.11 bibrelex, 94.05 devillers"
 }
 
 @techreport{l-afknn-81
-, author =	"D. T. Lee"
-, title =	"An approach to finding the $k$-nearest neighbors in the {Eucliedean} plane"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
-, address =	"Evanston, IL"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "D. T. Lee"
+, title =       "An approach to finding the $k$-nearest neighbors in the {Eucliedean} plane"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
+, address =     "Evanston, IL"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @incollection{l-cg-96
-, author =	"D. T. Lee"
-, title =	"Computational Geometry"
-, chapter =	6
-, editor =	"Allen B. Tucker, Jr."
-, booktitle =	"The Computer Science and Engineering Handbook"
-, publisher =	"CRC Press"
-, address =	"Boca Raton, FL"
-, year =	1996
-, url =	"http://www.ece.nwu.edu/~dtlee/CRCHandbook_chap6.ps.Z"
-, comments =	"survey article, 36 pages, 128 references"
-, update =	"98.07 bibrelex"
+, author =      "D. T. Lee"
+, title =       "Computational Geometry"
+, chapter =     6
+, editor =      "Allen B. Tucker, Jr."
+, booktitle =   "The Computer Science and Engineering Handbook"
+, publisher =   "CRC Press"
+, address =     "Boca Raton, FL"
+, year =        1996
+, url = "http://www.ece.nwu.edu/~dtlee/CRCHandbook_chap6.ps.Z"
+, comments =    "survey article, 36 pages, 128 references"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{l-fnvda-80
-, author =	"D. T. Lee"
-, title =	"Furthest neighbor {Voronoi} diagrams and applications"
-, type =	"Report"
-, number =	"80-11-FC-04"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
-, address =	"Evanston, IL"
-, year =	1980
+, author =      "D. T. Lee"
+, title =       "Furthest neighbor {Voronoi} diagrams and applications"
+, type =        "Report"
+, number =      "80-11-FC-04"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
+, address =     "Evanston, IL"
+, year =        1980
 }
 
 @inproceedings{l-gavr-97
-, author =	"D. T. Lee"
-, title =	"Geometric Algorithm Visualization Revisited"
-, booktitle =	"Workshop on Geometric Computing"
-, year =	1997
-, url =	"http://www-sop.inria.fr/prisme/scg97/prog\_workshop.html"
-, update =	"99.07 devillers, 98.07 tamassia"
+, author =      "D. T. Lee"
+, title =       "Geometric Algorithm Visualization Revisited"
+, booktitle =   "Workshop on Geometric Computing"
+, year =        1997
+, url = "http://www-sop.inria.fr/prisme/scg97/prog\_workshop.html"
+, update =      "99.07 devillers, 98.07 tamassia"
 }
 
 @incollection{l-mcprg-83
-, author =	"D. T. Lee"
-, title =	"Maximum Clique Problem of Rectangle Graphs"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"91--107"
-, update =	"01.04 icking"
+, author =      "D. T. Lee"
+, title =       "Maximum Clique Problem of Rectangle Graphs"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "91--107"
+, update =      "01.04 icking"
 }
 
 @article{l-matps-82
-, author =	"D. T. Lee"
-, title =	"Medial axis transformation of a planar shape"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-4"
-, number =	4
-, year =	1982
-, pages =	"363--369"
-, update =	"98.11 bibrelex"
+, author =      "D. T. Lee"
+, title =       "Medial axis transformation of a planar shape"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-4"
+, number =      4
+, year =        1982
+, pages =       "363--369"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{l-fchsp-80
-, author =	"D. T. Lee"
-, title =	"On Finding the Convex Hull of a Simple Polygon"
-, type =	"Technical {Report}"
-, number =	"80-03-FC-01"
-, institution =	"Northwestern Univ."
-, address =	"Evanston, IL"
-, month =	mar
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "D. T. Lee"
+, title =       "On Finding the Convex Hull of a Simple Polygon"
+, type =        "Technical {Report}"
+, number =      "80-03-FC-01"
+, institution = "Northwestern Univ."
+, address =     "Evanston, IL"
+, month =       mar
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @article{l-fchsp-83
-, author =	"D. T. Lee"
-, title =	"On finding the convex hull of a simple polygon"
-, journal =	"Internat. J. Comput. Inform. Sci."
-, volume =	12
-, year =	1983
-, pages =	"87--98"
+, author =      "D. T. Lee"
+, title =       "On finding the convex hull of a simple polygon"
+, journal =     "Internat. J. Comput. Inform. Sci."
+, volume =      12
+, year =        1983
+, pages =       "87--98"
 }
 
 @mastersthesis{l-fknnp-76
-, author =	"D. T. Lee"
-, title =	"On finding the $k$-nearest neighbors in the plane"
-, school =	"Coordinated Sci. Lab., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1976
-, note =	"Report R-728"
-, keywords =	"master thesis"
-, update =	"97.11 bibrelex"
+, author =      "D. T. Lee"
+, title =       "On finding the $k$-nearest neighbors in the plane"
+, school =      "Coordinated Sci. Lab., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1976
+, note =        "Report R-728"
+, keywords =    "master thesis"
+, update =      "97.11 bibrelex"
 }
 
 @article{l-knnvd-82
-, author =	"D. T. Lee"
-, title =	"On $k$-nearest neighbor {Voronoi} diagrams in the plane"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-31"
-, year =	1982
-, pages =	"478--487"
+, author =      "D. T. Lee"
+, title =       "On $k$-nearest neighbor {Voronoi} diagrams in the plane"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-31"
+, year =        1982
+, pages =       "478--487"
 }
 
 @techreport{l-prp-78
-, author =	"D. T. Lee"
-, title =	"Proximity and reachability in the plane"
-, type =	"Report"
-, number =	"R-831"
-, institution =	"Dept. Elect. Engrg., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1978
-, succeeds =	"l-prp-78p"
-, update =	"98.11 bibrelex"
+, author =      "D. T. Lee"
+, title =       "Proximity and reachability in the plane"
+, type =        "Report"
+, number =      "R-831"
+, institution = "Dept. Elect. Engrg., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1978
+, succeeds =    "l-prp-78p"
+, update =      "98.11 bibrelex"
 }
 
 @phdthesis{l-prp-78p
-, author =	"D. T. Lee"
-, title =	"Proximity and reachability in the plane"
-, school =	"Coordinated Science Lab., Univ. Illinois"
-, address =	"Urbana, Ill."
-, year =	1978
-, keywords =	"doctoral thesis"
-, precedes =	"l-prp-78"
-, update =	"98.11 bibrelex"
+, author =      "D. T. Lee"
+, title =       "Proximity and reachability in the plane"
+, school =      "Coordinated Science Lab., Univ. Illinois"
+, address =     "Urbana, Ill."
+, year =        1978
+, keywords =    "doctoral thesis"
+, precedes =    "l-prp-78"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{l-rpro-92
-, author =	"D. T. Lee"
-, title =	"Rectilinear Paths among Rectilinear Obstacles"
-, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '92"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	650
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"5--20"
-, precedes =	"lyw-rpro-96"
-, update =	"96.05 mitchell"
-, annote =	"This is an abridged version of the journal paper by Lee, Yang, and Wong"
+, author =      "D. T. Lee"
+, title =       "Rectilinear Paths among Rectilinear Obstacles"
+, booktitle =   "Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '92"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      650
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "5--20"
+, precedes =    "lyw-rpro-96"
+, update =      "96.05 mitchell"
+, annote =      "This is an abridged version of the journal paper by Lee, Yang, and Wong"
 }
 
 @article{l-rnglm-85
-, author =	"D. T. Lee"
-, title =	"Relative Neighborhood Graphs in the ${L}_1$ Metric"
-, journal =	"Pattern Recogn."
-, volume =	18
-, number =	5
-, year =	1985
-, pages =	"327--335"
-, annote =	"$O(n\log n)$ algorithm for RNG in ${L}_1$, from DT. Scan
-		 in each of four directions, removing non RNG edges."
+, author =      "D. T. Lee"
+, title =       "Relative Neighborhood Graphs in the ${L}_1$ Metric"
+, journal =     "Pattern Recogn."
+, volume =      18
+, number =      5
+, year =        1985
+, pages =       "327--335"
+, annote =      "$O(n\log n)$ algorithm for RNG in ${L}_1$, from DT. Scan
+                 in each of four directions, removing non RNG edges."
 }
 
 @article{l-srvdd-81
-, author =	"D. T. Lee"
-, title =	"Shading of regions on vector display devices"
-, journal =	"Comput. Graph."
-, volume =	15
-, number =	3
-, year =	1981
-, pages =	"37--44"
-, note =	"Proc. SIGGRAPH '81"
+, author =      "D. T. Lee"
+, title =       "Shading of regions on vector display devices"
+, journal =     "Comput. Graph."
+, volume =      15
+, number =      3
+, year =        1981
+, pages =       "37--44"
+, note =        "Proc. SIGGRAPH '81"
 }
 
 @article{l-tdvdl-80
-, author =	"D. T. Lee"
-, title =	"Two-dimensional {Voronoi} diagrams in the {$L_p$}-metric"
-, journal =	"J. ACM"
-, volume =	27
-, number =	4
-, year =	1980
-, pages =	"604--618"
-, update =	"99.03 bibrelex, 98.11 bibrelex"
+, author =      "D. T. Lee"
+, title =       "Two-dimensional {Voronoi} diagrams in the {$L_p$}-metric"
+, journal =     "J. ACM"
+, volume =      27
+, number =      4
+, year =        1980
+, pages =       "604--618"
+, update =      "99.03 bibrelex, 98.11 bibrelex"
 }
 
 @article{l-vsp-83
-, author =	"D. T. Lee"
-, title =	"Visibility of a simple polygon"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	22
-, year =	1983
-, pages =	"207--221"
+, author =      "D. T. Lee"
+, title =       "Visibility of a simple polygon"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      22
+, year =        1983
+, pages =       "207--221"
 }
 
 @techreport{l-wfnvd-93
-, author =	"D. T. Lee"
-, title =	"Weighted farthest neighbor {Voronoi} Diagrams"
-, type =	"Manuscript"
-, institution =	"Mississippi State University"
-, month =	feb
-, year =	1993
-, comments =	"Second Workshop on Proximity Graphs"
-, update =	"93.09 milone+mitchell"
+, author =      "D. T. Lee"
+, title =       "Weighted farthest neighbor {Voronoi} Diagrams"
+, type =        "Manuscript"
+, institution = "Mississippi State University"
+, month =       feb
+, year =        1993
+, comments =    "Second Workshop on Proximity Graphs"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{lcw-occss-81
-, author =	"D. T. Lee and C.-H. Chang and C. K. Wong"
-, title =	"An on-chip compare steer bubble sorter"
-, journal =	"IEEE Trans. Comput."
-, volume =	"??"
-, year =	1981
-, pages =	"396--405"
-, update =	"98.03 bibrelex"
+, author =      "D. T. Lee and C.-H. Chang and C. K. Wong"
+, title =       "An on-chip compare steer bubble sorter"
+, journal =     "IEEE Trans. Comput."
+, volume =      "??"
+, year =        1981
+, pages =       "396--405"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{lc-dvesc-85
-, author =	"D. T. Lee and I. M. Chen"
-, title =	"Display of visible edges of a set of convex polygons"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"249--265"
+, author =      "D. T. Lee and I. M. Chen"
+, title =       "Display of visible edges of a set of convex polygons"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "249--265"
 }
 
 @inproceedings{lcy-srpwo-90
-, author =	"D. T. Lee and T. H. Chen and C. D. Yang"
-, title =	"Shortest rectilinear paths among weighted obstacles"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"301--310"
-, cites =	"aaghi-vdp-86, ckv-rsptp-87, rlw-rsppr-89, ft-fhtu-84, gh-ospqs-87, gs-canen-83, ll-fmrdp-81, l-prp-78, lp-esppr-84, lw-apcfp-79, mp-psp-85, m-srpo-87t, m-naspo-88, ps-cgi-85, w-cvgnl-85, w-ndiv-89, wwsw-rspms-87, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. T. Lee and T. H. Chen and C. D. Yang"
+, title =       "Shortest rectilinear paths among weighted obstacles"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "301--310"
+, cites =       "aaghi-vdp-86, ckv-rsptp-87, rlw-rsppr-89, ft-fhtu-84, gh-ospqs-87, gs-canen-83, ll-fmrdp-81, l-prp-78, lp-esppr-84, lw-apcfp-79, mp-psp-85, m-srpo-87t, m-naspo-88, ps-cgi-85, w-cvgnl-85, w-ndiv-89, wwsw-rspms-87, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{lc-pgdr-85
-, author =	"D. T. Lee and Y. T. Ching"
-, title =	"The power of geometric duality revisited"
-, journal =	"Inform. Process. Lett."
-, volume =	21
-, year =	1985
-, pages =	"117--122"
+, author =      "D. T. Lee and Y. T. Ching"
+, title =       "The power of geometric duality revisited"
+, journal =     "Inform. Process. Lett."
+, volume =      21
+, year =        1985
+, pages =       "117--122"
 }
 
 @article{ld-gvdp-81
-, author =	"D. T. Lee and R. L. {Drysdale, III}"
-, title =	"Generalization of {Voronoi} diagrams in the plane"
-, journal =	"SIAM J. Comput."
-, volume =	10
-, year =	1981
-, pages =	"73--87"
-, keywords =	"Voronoi diagrams, line segments, two-dimensional"
+, author =      "D. T. Lee and R. L. {Drysdale, III}"
+, title =       "Generalization of {Voronoi} diagrams in the plane"
+, journal =     "SIAM J. Comput."
+, volume =      10
+, year =        1981
+, pages =       "73--87"
+, keywords =    "Voronoi diagrams, line segments, two-dimensional"
 }
 
 @techreport{ll-cvpe-84
-, author =	"D. T. Lee and A. Lin"
-, title =	"Computing the Visibility Polygon from an Edge"
-, type =	"Technical {Report}"
-, institution =	"Northwestern University"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "D. T. Lee and A. Lin"
+, title =       "Computing the Visibility Polygon from an Edge"
+, type =        "Technical {Report}"
+, institution = "Northwestern University"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{ll-cvpe-86
-, author =	"D. T. Lee and A. K. Lin"
-, title =	"Computing the visibility polygon from an edge"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	34
-, year =	1986
-, pages =	"1--19"
-, update =	"93.09 milone+mitchell"
+, author =      "D. T. Lee and A. K. Lin"
+, title =       "Computing the visibility polygon from an edge"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      34
+, year =        1986
+, pages =       "1--19"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{ll-gdtpg-86
-, author =	"D. T. Lee and A. K. Lin"
-, title =	"Generalized {Delaunay} Triangulation for Planar Graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"201--217"
+, author =      "D. T. Lee and A. K. Lin"
+, title =       "Generalized {Delaunay} Triangulation for Planar Graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "201--217"
 }
 
 @techreport{lm-rac-83
-, author =	"D. T. Lee and N. Megiddo"
-, title =	"Routing around circles"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1983
+, author =      "D. T. Lee and N. Megiddo"
+, title =       "Routing around circles"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1983
 }
 
 @techreport{ln-ddsvd-80
-, author =	"D. T. Lee and A. Naamad"
-, title =	"A dynamic data structure for {Voronoi} diagrams and its applications"
-, type =	"Report"
-, number =	"80-10-FC-03"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
-, address =	"Evanston, IL"
-, year =	1980
+, author =      "D. T. Lee and A. Naamad"
+, title =       "A dynamic data structure for {Voronoi} diagrams and its applications"
+, type =        "Report"
+, number =      "80-10-FC-03"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
+, address =     "Evanston, IL"
+, year =        1980
 }
 
 @article{lp-iarep-82
-, author =	"D. T. Lee and F. P. Preparata"
-, title =	"An improved algorithm for the rectangle enclosure problem"
-, journal =	"J. Algorithms"
-, volume =	3
-, year =	1982
-, pages =	"218--224"
+, author =      "D. T. Lee and F. P. Preparata"
+, title =       "An improved algorithm for the rectangle enclosure problem"
+, journal =     "J. Algorithms"
+, volume =      3
+, year =        1982
+, pages =       "218--224"
 }
 
 @article{lp-oafkp-79
-, author =	"D. T. Lee and F. P. Preparata"
-, title =	"An optimal algorithm for finding the kernel of a polygon"
-, journal =	"J. ACM"
-, volume =	26
-, number =	3
-, month =	jul
-, year =	1979
-, pages =	"415--421"
-, update =	"98.11 bibrelex"
+, author =      "D. T. Lee and F. P. Preparata"
+, title =       "An optimal algorithm for finding the kernel of a polygon"
+, journal =     "J. ACM"
+, volume =      26
+, number =      3
+, month =       jul
+, year =        1979
+, pages =       "415--421"
+, update =      "98.11 bibrelex"
 }
 
 @article{lp-cgs-84
-, author =	"D. T. Lee and F. P. Preparata"
-, title =	"Computational geometry: a survey"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-33"
-, year =	1984
-, pages =	"1072--1101"
+, author =      "D. T. Lee and F. P. Preparata"
+, title =       "Computational geometry: a survey"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-33"
+, year =        1984
+, pages =       "1072--1101"
 }
 
 @article{lp-esppr-84
-, author =	"D. T. Lee and F. P. Preparata"
-, title =	"Euclidean shortest paths in the presence of rectilinear barriers"
-, journal =	"Networks"
-, volume =	14
-, year =	1984
-, pages =	"393--410"
-, keywords =	"triangulations"
+, author =      "D. T. Lee and F. P. Preparata"
+, title =       "Euclidean shortest paths in the presence of rectilinear barriers"
+, journal =     "Networks"
+, volume =      14
+, year =        1984
+, pages =       "393--410"
+, keywords =    "triangulations"
 }
 
 @inproceedings{lp-lppsi-76
-, author =	"D. T. Lee and F. P. Preparata"
-, title =	"Location of a point in a planar subdivision and its applications"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Theory Comput."
-, year =	1976
-, pages =	"231--235"
-, precedes =	"lp-lppsi-77"
+, author =      "D. T. Lee and F. P. Preparata"
+, title =       "Location of a point in a planar subdivision and its applications"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Theory Comput."
+, year =        1976
+, pages =       "231--235"
+, precedes =    "lp-lppsi-77"
 }
 
 @article{lp-lppsi-77
-, author =	"D. T. Lee and F. P. Preparata"
-, title =	"Location of a point in a planar subdivision and its applications"
-, journal =	"SIAM J. Comput."
-, volume =	6
-, number =	3
-, year =	1977
-, pages =	"594--606"
-, succeeds =	"lp-lppsi-76"
-, update =	"98.07 tamassia"
+, author =      "D. T. Lee and F. P. Preparata"
+, title =       "Location of a point in a planar subdivision and its applications"
+, journal =     "SIAM J. Comput."
+, volume =      6
+, number =      3
+, year =        1977
+, pages =       "594--606"
+, succeeds =    "lp-lppsi-76"
+, update =      "98.07 tamassia"
 }
 
 @article{lp-pbppl-89
-, author =	"D. T. Lee and F. P. Preparata"
-, title =	"Parallel batched planar point location on the {CCC}"
-, journal =	"Inform. Process. Lett."
-, volume =	33
-, year =	1989
-, pages =	"175--179"
-, update =	"93.05 devillers"
+, author =      "D. T. Lee and F. P. Preparata"
+, title =       "Parallel batched planar point location on the {CCC}"
+, journal =     "Inform. Process. Lett."
+, volume =      33
+, year =        1989
+, pages =       "175--179"
+, update =      "93.05 devillers"
 }
 
 @article{lp-annpc-78
-, author =	"D. T. Lee and F. P. Preparata"
-, title =	"The all nearest-neighbor problem for convex polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	7
-, year =	1978
-, pages =	"189--192"
+, author =      "D. T. Lee and F. P. Preparata"
+, title =       "The all nearest-neighbor problem for convex polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      7
+, year =        1978
+, pages =       "189--192"
 }
 
 @article{ls-mispg-93
-, author =	"D. T. Lee and M. Sarrafzadeh"
-, title =	"Maximum independent set of a permutation graph in K tracks"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"291--304"
-, keywords =	"Permutation graphs, maximum independent set, maximum chain, track assignment, plane sweep technique"
-, update =	"96.09 devillers"
+, author =      "D. T. Lee and M. Sarrafzadeh"
+, title =       "Maximum independent set of a permutation graph in K tracks"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "291--304"
+, keywords =    "Permutation graphs, maximum independent set, maximum chain, track assignment, plane sweep technique"
+, update =      "96.09 devillers"
 }
 
 @article{ls-tacdt-80
-, author =	"D. T. Lee and B. J. Schachter"
-, title =	"Two algorithms for constructing {Delaunay} triangulations"
-, journal =	"Internat. J. Comput. Inform. Sci."
-, volume =	9
-, number =	3
-, year =	1980
-, pages =	"219--242"
-, update =	"01.11 smid, 98.07 bibrelex"
+, author =      "D. T. Lee and B. J. Schachter"
+, title =       "Two algorithms for constructing {Delaunay} triangulations"
+, journal =     "Internat. J. Comput. Inform. Sci."
+, volume =      9
+, number =      3
+, year =        1980
+, pages =       "219--242"
+, update =      "01.11 smid, 98.07 bibrelex"
 }
 
 @article{lss-gdvtg-98
-, author =	"D. T. Lee and C.-F. Shen and D. S. Sheu"
-, title =	"Geosheet: A Distributed Visualization Tool for Geometric Algorithms"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"119--156"
-, update =	"98.11 devillers"
+, author =      "D. T. Lee and C.-F. Shen and D. S. Sheu"
+, title =       "Geosheet: A Distributed Visualization Tool for Geometric Algorithms"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "119--156"
+, update =      "98.11 devillers"
 }
 
 @article{ls-oirac-82
-, author =	"D. T. Lee and C. B. Silio"
-, title =	"An optimal illumination region algorithm for convex polygons"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-31"
-, year =	1982
-, pages =	"1225--1227"
+, author =      "D. T. Lee and C. B. Silio"
+, title =       "An optimal illumination region algorithm for convex polygons"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-31"
+, year =        1982
+, pages =       "1225--1227"
 }
 
 @techreport{ls-oscac-80
-, author =	"D. T. Lee and C. B. {Silio, Jr.}"
-, title =	"An optimal simplex coverability algorithm for convex polygons"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
-, address =	"Evanston, IL"
-, year =	1980
+, author =      "D. T. Lee and C. B. {Silio, Jr.}"
+, title =       "An optimal simplex coverability algorithm for convex polygons"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
+, address =     "Evanston, IL"
+, year =        1980
 }
 
 @article{lw-firrs-81
-, author =	"D. T. Lee and C. K. Wong"
-, title =	"Finding intersections of rectangles by range search"
-, journal =	"J. Algorithms"
-, volume =	2
-, year =	1981
-, pages =	"337--347"
+, author =      "D. T. Lee and C. K. Wong"
+, title =       "Finding intersections of rectangles by range search"
+, journal =     "J. Algorithms"
+, volume =      2
+, year =        1981
+, pages =       "337--347"
 }
 
 @article{lw-qtfsm-80
-, author =	"D. T. Lee and C. K. Wong"
-, title =	"Quintary trees: a file structure for multidimensional database systems"
-, journal =	"ACM Trans. Database Syst."
-, volume =	5
-, year =	1980
-, pages =	"339--353"
+, author =      "D. T. Lee and C. K. Wong"
+, title =       "Quintary trees: a file structure for multidimensional database systems"
+, journal =     "ACM Trans. Database Syst."
+, volume =      5
+, year =        1980
+, pages =       "339--353"
 }
 
 @article{lw-vdllm-80
-, author =	"D. T. Lee and C. K. Wong"
-, title =	"Voronoi diagrams in {$L_{1}$} ({$L_{\infty}$}) metrics with $2$-dimensional storage applications"
-, journal =	"SIAM J. Comput."
-, volume =	9
-, number =	1
-, year =	1980
-, pages =	"200--211"
-, update =	"98.11 bibrelex"
+, author =      "D. T. Lee and C. K. Wong"
+, title =       "Voronoi diagrams in {$L_{1}$} ({$L_{\infty}$}) metrics with $2$-dimensional storage applications"
+, journal =     "SIAM J. Comput."
+, volume =      9
+, number =      1
+, year =        1980
+, pages =       "200--211"
+, update =      "98.11 bibrelex"
 }
 
 @article{lw-wcarp-77
-, author =	"D. T. Lee and C. K. Wong"
-, title =	"Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees"
-, journal =	"Acta Inform."
-, volume =	9
-, year =	1977
-, pages =	"23--29"
+, author =      "D. T. Lee and C. K. Wong"
+, title =       "Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees"
+, journal =     "Acta Inform."
+, volume =      9
+, year =        1977
+, pages =       "23--29"
 }
 
 @inproceedings{lw-eae1l-87
-, author =	"D. T. Lee and Y. F. Wu"
-, title =	"Efficient algorithms for {Euclidean} $1$-line center and problems"
-, booktitle =	"Proc. ISOLDE III"
-, site =	"Boston, MA"
-, year =	1987
-, pages =	"??"
+, author =      "D. T. Lee and Y. F. Wu"
+, title =       "Efficient algorithms for {Euclidean} $1$-line center and problems"
+, booktitle =   "Proc. ISOLDE III"
+, site =        "Boston, MA"
+, year =        1987
+, pages =       "??"
 }
 
 @article{lw-gcslp-86
-, author =	"D. T. Lee and Y. F. Wu"
-, title =	"Geometric complexity of some location problems"
-, journal =	"Algorithmica"
-, volume =	1
-, year =	1986
-, pages =	"193--211"
+, author =      "D. T. Lee and Y. F. Wu"
+, title =       "Geometric complexity of some location problems"
+, journal =     "Algorithmica"
+, volume =      1
+, year =        1986
+, pages =       "193--211"
 }
 
 @article{ly-lmpps-79
-, author =	"D. T. Lee and C. C. Yang"
-, title =	"Location of multiple points in a planar subdivision"
-, journal =	"Inform. Process. Lett."
-, volume =	9
-, year =	1979
-, pages =	"190--193"
+, author =      "D. T. Lee and C. C. Yang"
+, title =       "Location of multiple points in a planar subdivision"
+, journal =     "Inform. Process. Lett."
+, volume =      9
+, year =        1979
+, pages =       "190--193"
 }
 
 @article{lyc-srpwo-91
-, author =	"D. T. Lee and C. D. Yang and T. H. Chen"
-, title =	"Shortest rectilinear paths among weighted obstacles"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	2
-, year =	1991
-, pages =	"109--124"
-, keywords =	"shortest path, rectilinear path, weighted obstacle, graph theoretic approach"
+, author =      "D. T. Lee and C. D. Yang and T. H. Chen"
+, title =       "Shortest rectilinear paths among weighted obstacles"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      2
+, year =        1991
+, pages =       "109--124"
+, keywords =    "shortest path, rectilinear path, weighted obstacle, graph theoretic approach"
 }
 
 @article{lyw-frpao-97
-, author =	"D. T. Lee and C. D. Yang and C. K. Wong"
-, title =	"Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"581--598"
-, update =	"98.11 devillers"
+, author =      "D. T. Lee and C. D. Yang and C. K. Wong"
+, title =       "Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "581--598"
+, update =      "98.11 devillers"
 }
 
 @article{lyw-rpro-96
-, author =	"D. T. Lee and C. D. Yang and C. K. Wong"
-, title =	"Rectilinear paths among rectilinear obstacles"
-, journal =	"Discrete Appl. Math."
-, volume =	70
-, year =	1996
-, pages =	"185--215"
-, keywords =	"survey, shortest paths, rectilinear geometry, bicriteria paths, VLSI, wire routing"
-, succeeds =	"l-rpro-92"
-, update =	"97.03 schwarzkopf, 96.05 mitchell"
+, author =      "D. T. Lee and C. D. Yang and C. K. Wong"
+, title =       "Rectilinear paths among rectilinear obstacles"
+, journal =     "Discrete Appl. Math."
+, volume =      70
+, year =        1996
+, pages =       "185--215"
+, keywords =    "survey, shortest paths, rectilinear geometry, bicriteria paths, VLSI, wire routing"
+, succeeds =    "l-rpro-92"
+, update =      "97.03 schwarzkopf, 96.05 mitchell"
 }
 
 @inproceedings{lc-avcpg-92
-, author =	"H. S. Lee and R. C. Chang"
-, title =	"Approximating Vertices of a Convex Polygon with Grid Points in the Polygon"
-, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '92"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	650
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"269--278"
-, update =	"94.09 smid, 93.09 milone+mitchell"
+, author =      "H. S. Lee and R. C. Chang"
+, title =       "Approximating Vertices of a Convex Polygon with Grid Points in the Polygon"
+, booktitle =   "Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '92"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      650
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "269--278"
+, update =      "94.09 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{lc-hgpcp-91
-, author =	"H. S. Lee and R. C. Chang"
-, title =	"On hitting grid points in a convex polygon with straight lines"
-, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"176--189"
+, author =      "H. S. Lee and R. C. Chang"
+, title =       "On hitting grid points in a convex polygon with straight lines"
+, booktitle =   "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "176--189"
 }
 
 @article{lc-regpc-93
-, author =	"H. S. Lee and R. C. Chang"
-, title =	"Regular enumeration of grid points in a convex polygon"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"305--322"
-, keywords =	"approximation algorithms, continued fraction expansions, hitting set problem, number theory"
-, update =	"96.09 devillers"
+, author =      "H. S. Lee and R. C. Chang"
+, title =       "Regular enumeration of grid points in a convex polygon"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "305--322"
+, keywords =    "approximation algorithms, continued fraction expansions, hitting set problem, number theory"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{l-dhcme-89
-, author =	"Jay Lee"
-, title =	"A drop heuristic conversion method for extracting irregular network for digital elevation models"
-, booktitle =	"GIS/LIS '89 Proc."
-, volume =	1
-, publisher =	"American Congress on Surveying and Mapping"
-, month =	nov
-, year =	1989
-, pages =	"30--39"
-, keywords =	"triangulated irregular network, terrain, surface simplification"
-, update =	"95.09 mitchell"
-, abstract =	"The advantages and disadvantages of various DEMs have
+, author =      "Jay Lee"
+, title =       "A drop heuristic conversion method for extracting irregular network for digital elevation models"
+, booktitle =   "GIS/LIS '89 Proc."
+, volume =      1
+, publisher =   "American Congress on Surveying and Mapping"
+, month =       nov
+, year =        1989
+, pages =       "30--39"
+, keywords =    "triangulated irregular network, terrain, surface simplification"
+, update =      "95.09 mitchell"
+, abstract =    "The advantages and disadvantages of various DEMs have
 been discussed extensively and authors have concluded that for many
 types of applications the triangulated irregular network is better
 suited for approximating terrain surfaces because of its efficiency in
@@ -94761,29 +94761,29 @@ @inproceedings{l-dhcme-89
 }
 
 @article{l-avsts-91
-, author =	"J. Lee"
-, title =	"Analyses of Visibility Sites on Topographic Surfaces"
-, journal =	"Internat. J. Geogr. Inform. Syst."
-, volume =	5
-, year =	1991
-, pages =	"413--430"
-, update =	"96.09 kreveld"
+, author =      "J. Lee"
+, title =       "Analyses of Visibility Sites on Topographic Surfaces"
+, journal =     "Internat. J. Geogr. Inform. Syst."
+, volume =      5
+, year =        1991
+, pages =       "413--430"
+, update =      "96.09 kreveld"
 }
 
 @article{l-cembt-91
-, author =	"Jay Lee"
-, title =	"Comparison of existing methods for building triangular irregular network models of terrain from grid digital elevation models"
-, journal =	"Internat. J. Geogr. Inform. Syst."
-, volume =	5
-, number =	3
-, month =	jul # "-" # sep
-, year =	1991
-, pages =	"267--285"
-, keywords =	"terrain, triangulated irregular network, TIN"
-, update =	"96.09 devillers, 95.09 mitchell"
-, annote =	"Compares his drop heuristic algorithm to Chen-Guevara
+, author =      "Jay Lee"
+, title =       "Comparison of existing methods for building triangular irregular network models of terrain from grid digital elevation models"
+, journal =     "Internat. J. Geogr. Inform. Syst."
+, volume =      5
+, number =      3
+, month =       jul # "-" # sep
+, year =        1991
+, pages =       "267--285"
+, keywords =    "terrain, triangulated irregular network, TIN"
+, update =      "96.09 devillers, 95.09 mitchell"
+, annote =      "Compares his drop heuristic algorithm to Chen-Guevara
 and DeFloriani84"
-, abstract =	"Triangulated irregular networks (TINs) are
+, abstract =    "Triangulated irregular networks (TINs) are
 increasingly popular for their efficiency in data storage and their
 ability to accommodate irregularly spaced elevation points for many
 applications of geographical information systems. The paper reviews and
@@ -94796,35 +94796,35 @@ @article{l-cembt-91
 }
 
 @techreport{lc-tasso-98
-, author =	"Jae-Ha Lee and Kyung-Yong Chwa"
-, title =	"Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem"
-, institution =	"Department of Computer Science, KAIST"
-, address =	"Taejon, Korea"
-, year =	1998
-, precedes =	"lc-tasso-99"
-, update =	"99.07 bibrelex, 98.07 icking"
+, author =      "Jae-Ha Lee and Kyung-Yong Chwa"
+, title =       "Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem"
+, institution = "Department of Computer Science, KAIST"
+, address =     "Taejon, Korea"
+, year =        1998
+, precedes =    "lc-tasso-99"
+, update =      "99.07 bibrelex, 98.07 icking"
 }
 
 @article{lc-tasso-99
-, author =	"Jae-Ha Lee and Kyung-Yong Chwa"
-, title =	"Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem"
-, journal =	"Inform. Process. Lett."
-, volume =	69
-, year =	1999
-, pages =	"39--45"
-, succeeds =	"lc-tasso-98"
-, update =	"99.07 bibrelex+smid"
+, author =      "Jae-Ha Lee and Kyung-Yong Chwa"
+, title =       "Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem"
+, journal =     "Inform. Process. Lett."
+, volume =      69
+, year =        1999
+, pages =       "39--45"
+, succeeds =    "lc-tasso-98"
+, update =      "99.07 bibrelex+smid"
 }
 
 @inproceedings{lsksc-ncssu-97
-, author =	"Jae-Ha Lee and Chan-Su Shin and Jae-Hoon Kim and Sung Yong Shin and Kyung-Yong Chwa"
-, title =	"New Competitive Strategies for Searching in Unknown Star-Shaped Polygons"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"427--429"
-, cites =	"bcr-sp-93, di-csgs-94, ik-skpcs-95, l-oltsb-96, ls-pinos-97, k-wusbd-91, k-olssp-94, py-spwm-89, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex+icking, 98.03 mitchell, 97.06 efrat"
-, annote =	"They assume an input of a star-shaped polygon, P.
+, author =      "Jae-Ha Lee and Chan-Su Shin and Jae-Hoon Kim and Sung Yong Shin and Kyung-Yong Chwa"
+, title =       "New Competitive Strategies for Searching in Unknown Star-Shaped Polygons"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "427--429"
+, cites =       "bcr-sp-93, di-csgs-94, ik-skpcs-95, l-oltsb-96, ls-pinos-97, k-wusbd-91, k-olssp-94, py-spwm-89, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex+icking, 98.03 mitchell, 97.06 efrat"
+, annote =      "They assume an input of a star-shaped polygon, P.
                  For the problem of getting from s to the kernel,
                  they give an algorithm with competitive ratio
                  $1+2\sqrt{2}\approx 3.829$, while for getting from s
@@ -94833,2294 +94833,2294 @@ @inproceedings{lsksc-ncssu-97
 }
 
 @article{twccwj-cpspu-97
-, author =	"M. K. Lee"
-, title =	"A New Convex-Hull Based Approach to Evaluating Flatness Tolerance"
-, journal =	"Comput. Aided Design"
-, volume =	29
-, number =	12
-, year =	1997
-, pages =	"861--868"
-, update =	"98.03 mitchell"
+, author =      "M. K. Lee"
+, title =       "A New Convex-Hull Based Approach to Evaluating Flatness Tolerance"
+, journal =     "Comput. Aided Design"
+, volume =      29
+, number =      12
+, year =        1997
+, pages =       "861--868"
+, update =      "98.03 mitchell"
 }
 
 @article{lcc-apcam-76
-, author =	"R. C. T. Lee and Y. H. Chin and S. C. Chang"
-, title =	"Application of principal component analysis to multikey searching"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	"SE-2"
-, year =	1976
-, pages =	"185--193"
+, author =      "R. C. T. Lee and Y. H. Chin and S. C. Chang"
+, title =       "Application of principal component analysis to multikey searching"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      "SE-2"
+, year =        1976
+, pages =       "185--193"
 }
 
 @article{lsb-tmsmp-77
-, author =	"R. C. T. Lee and J. R. Slagle and H. Blum"
-, title =	"A triangulation method for the sequential mapping of points from $n$-space to $2$-space"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-26"
-, year =	1977
-, pages =	"288--292"
+, author =      "R. C. T. Lee and J. R. Slagle and H. Blum"
+, title =       "A triangulation method for the sequential mapping of points from $n$-space to $2$-space"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-26"
+, year =        1977
+, pages =       "288--292"
 }
 
 @techreport{lt-asspm-76
-, author =	"R. C. T. Lee and R. C. Tsai"
-, title =	"Application of short spanning path to multi-key searching"
-, type =	"Report"
-, number =	"??"
-, institution =	"Inst. Appl. Math., National Tsing Hua Univ."
-, address =	"Hsinchu, Taiwan"
-, year =	1976
+, author =      "R. C. T. Lee and R. C. Tsai"
+, title =       "Application of short spanning path to multi-key searching"
+, type =        "Report"
+, number =      "??"
+, institution = "Inst. Appl. Math., National Tsing Hua Univ."
+, address =     "Hsinchu, Taiwan"
+, year =        1976
 }
 
 @article{lc-ntlcs-87
-, author =	"S. H. Lee and K. Y. Chwa"
-, title =	"A new triangulation-linear class of simple polygons"
-, journal =	"Internat. J. Comput. Math."
-, volume =	22
-, year =	1987
-, pages =	"135--147"
+, author =      "S. H. Lee and K. Y. Chwa"
+, title =       "A new triangulation-linear class of simple polygons"
+, journal =     "Internat. J. Comput. Math."
+, volume =      22
+, year =        1987
+, pages =       "135--147"
 }
 
 @article{lc-scvps-90
-, author =	"S. H. Lee and K. Y. Chwa"
-, title =	"Some chain visibility problems in a simple polygon"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"485--507"
+, author =      "S. H. Lee and K. Y. Chwa"
+, title =       "Some chain visibility problems in a simple polygon"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "485--507"
 }
 
 @article{lds-afemg-84
-, author =	"Y. T. Lee and A. {De Pennington} and N. K. Shaw"
-, title =	"Automatic finite-element mesh generation from geometric models: a point-based approach"
-, journal =	"ACM Trans. Graph."
-, volume =	3
-, number =	4
-, year =	1984
-, pages =	"287--311"
+, author =      "Y. T. Lee and A. {De Pennington} and N. K. Shaw"
+, title =       "Automatic finite-element mesh generation from geometric models: a point-based approach"
+, journal =     "ACM Trans. Graph."
+, volume =      3
+, number =      4
+, year =        1984
+, pages =       "287--311"
 }
 
 @article{lr-acvoi1-82
-, author =	"Y. T. Lee and A. A. G. Requicha"
-, title =	"Algorithms for computing the volume and other integral properties of solids. {I}. {Known} methods and open issues"
-, journal =	"Commun. ACM"
-, volume =	25
-, year =	1982
-, pages =	"635--641"
+, author =      "Y. T. Lee and A. A. G. Requicha"
+, title =       "Algorithms for computing the volume and other integral properties of solids. {I}. {Known} methods and open issues"
+, journal =     "Commun. ACM"
+, volume =      25
+, year =        1982
+, pages =       "635--641"
 }
 
 @article{lr-acvoi2-82
-, author =	"Y. T. Lee and A. A. G. Requicha"
-, title =	"Algorithms for computing the volume and other integral properties of solids. {II}. {A} family of algorithms based on representation conversion and cellular approximation"
-, journal =	"Commun. ACM"
-, volume =	25
-, year =	1982
-, pages =	"642--650"
+, author =      "Y. T. Lee and A. A. G. Requicha"
+, title =       "Algorithms for computing the volume and other integral properties of solids. {II}. {A} family of algorithms based on representation conversion and cellular approximation"
+, journal =     "Commun. ACM"
+, volume =      25
+, year =        1982
+, pages =       "642--650"
 }
 
 @techreport{l-gcg-82
-, author =	"J. van Leeuwen"
-, title =	"Graphics and computational geometry"
-, type =	"Report"
-, number =	"RUU-CS-81-18"
-, institution =	"Les Mathematiques de Informatique, Colloq. AFCET"
-, address =	"Paris, France"
-, year =	1982
-, pages =	"159--165"
+, author =      "J. van Leeuwen"
+, title =       "Graphics and computational geometry"
+, type =        "Report"
+, number =      "RUU-CS-81-18"
+, institution = "Les Mathematiques de Informatique, Colloq. AFCET"
+, address =     "Paris, France"
+, year =        1982
+, pages =       "159--165"
 }
 
 @article{l-pp-83
-, author =	"J. van Leeuwen"
-, title =	"Problem {P}20"
-, journal =	"Bull. EATCS"
-, volume =	19
-, year =	1983
-, pages =	150
+, author =      "J. van Leeuwen"
+, title =       "Problem {P}20"
+, journal =     "Bull. EATCS"
+, volume =      19
+, year =        1983
+, pages =       150
 }
 
 @techreport{lm-dssds-80
-, author =	"J. van Leeuwen and H. A. Maurer"
-, title =	"Dynamic systems of static data-structures"
-, type =	"Report"
-, number =	"F42"
-, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1980
+, author =      "J. van Leeuwen and H. A. Maurer"
+, title =       "Dynamic systems of static data-structures"
+, type =        "Report"
+, number =      "F42"
+, institution = "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1980
 }
 
 @inproceedings{lo-ad-81
-, author =	"J. van Leeuwen and M. H. Overmars"
-, title =	"The art of dynamizing"
-, booktitle =	"Proc. 10th Internat. Sympos. Math. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	118
-, publisher =	"Springer-Verlag"
-, year =	1981
-, pages =	"121--131"
+, author =      "J. van Leeuwen and M. H. Overmars"
+, title =       "The art of dynamizing"
+, booktitle =   "Proc. 10th Internat. Sympos. Math. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      118
+, publisher =   "Springer-Verlag"
+, year =        1981
+, pages =       "121--131"
 }
 
 @inproceedings{ls-utstp-82
-, author =	"J. van Leeuwen and Anneke A. Schoone"
-, title =	"Untangling a travelling salesman tour in the plane"
-, editor =	"J. R. M{\"u}hlbacher"
-, booktitle =	"Proc. 7th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '81"
-, publisher =	"Hanser"
-, address =	"M{\"u}nchen"
-, year =	1982
-, pages =	"87--98"
-, comments =	"replaces the old techreport vs-utstp-80"
-, update =	"98.07 bibrelex, 93.09 rote"
+, author =      "J. van Leeuwen and Anneke A. Schoone"
+, title =       "Untangling a travelling salesman tour in the plane"
+, editor =      "J. R. M{\"u}hlbacher"
+, booktitle =   "Proc. 7th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '81"
+, publisher =   "Hanser"
+, address =     "M{\"u}nchen"
+, year =        1982
+, pages =       "87--98"
+, comments =    "replaces the old techreport vs-utstp-80"
+, update =      "98.07 bibrelex, 93.09 rote"
 }
 
 @article{lw-ddsp-80
-, author =	"J. van Leeuwen and D. Wood"
-, title =	"Dynamization of decomposable searching problems"
-, journal =	"Inform. Process. Lett."
-, volume =	10
-, year =	1980
-, pages =	"51--56"
+, author =      "J. van Leeuwen and D. Wood"
+, title =       "Dynamization of decomposable searching problems"
+, journal =     "Inform. Process. Lett."
+, volume =      10
+, year =        1980
+, pages =       "51--56"
 }
 
 @article{lw-mprrd-81
-, author =	"J. van Leeuwen and D. Wood"
-, title =	"The measure problem for rectangular ranges in $d$-space"
-, journal =	"J. Algorithms"
-, volume =	2
-, year =	1981
-, pages =	"282--300"
+, author =      "J. van Leeuwen and D. Wood"
+, title =       "The measure problem for rectangular ranges in $d$-space"
+, journal =     "J. Algorithms"
+, volume =      2
+, year =        1981
+, pages =       "282--300"
 }
 
 @article{lm-tmd-98
-, author =	"Vincent Lef{\'e}vre and Jean-Michel Muller"
-, title =	"The Table Maker's Dilemma"
-, journal =	"IEEE Trans. Comput."
-, volume =	47
-, number =	11
-, year =	1998
-, update =	"00.03 devillers"
+, author =      "Vincent Lef{\'e}vre and Jean-Michel Muller"
+, title =       "The Table Maker's Dilemma"
+, journal =     "IEEE Trans. Comput."
+, volume =      47
+, number =      11
+, year =        1998
+, update =      "00.03 devillers"
 }
 
 @book{l-at-42
-, author =	"S. Lefschetz"
-, title =	"Algebraic topology"
-, publisher =	"American Mathematical Society"
-, year =	1942
-, update =	"97.11 bibrelex"
+, author =      "S. Lefschetz"
+, title =       "Algebraic topology"
+, publisher =   "American Mathematical Society"
+, year =        1942
+, update =      "97.11 bibrelex"
 }
 
 @book{l-aat-75
-, author =	"S. Lefschetz"
-, title =	"Applications of Algebraic Topology"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1975
-, update =	"98.03 bibrelex"
+, author =      "S. Lefschetz"
+, title =       "Applications of Algebraic Topology"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1975
+, update =      "98.03 bibrelex"
 }
 
 @book{l-it-49
-, author =	"S. Lefschetz"
-, title =	"Introduction to Topology"
-, publisher =	"Princeton University Press"
-, address =	"Princeton, NJ"
-, year =	1949
-, update =	"98.03 bibrelex"
+, author =      "S. Lefschetz"
+, title =       "Introduction to Topology"
+, publisher =   "Princeton University Press"
+, address =     "Princeton, NJ"
+, year =        1949
+, update =      "98.03 bibrelex"
 }
 
 @article{ld-cccoe-81
-, author =	"P. Lehert and P. A. Devijver"
-, title =	"Clustering by connected components in {$O(n)$} expected time"
-, journal =	"RAIRO Inform. Theor."
-, volume =	15
-, year =	1981
-, pages =	"207--218"
+, author =      "P. Lehert and P. A. Devijver"
+, title =       "Clustering by connected components in {$O(n)$} expected time"
+, journal =     "RAIRO Inform. Theor."
+, volume =      15
+, year =        1981
+, pages =       "207--218"
 }
 
 @article{l-rpo3d-90
-, author =	"G. Lei"
-, title =	"Recognition of planar objects in 3-D space from single perspective views using cross ratio"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	6
-, number =	4
-, year =	1990
-, pages =	"432--437"
-, update =	"93.09 milone+mitchell"
+, author =      "G. Lei"
+, title =       "Recognition of planar objects in 3-D space from single perspective views using cross ratio"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      6
+, number =      4
+, year =        1990
+, pages =       "432--437"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{ll-dtvdr-00
-, author =	"Greg Leibon and David Letscher"
-, title =	"Delaunay Triangulations and {Voronoi} Diagrams for {Riemannian} Manifolds"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"341--349"
-, update =	"00.11 jones"
+, author =      "Greg Leibon and David Letscher"
+, title =       "Delaunay Triangulations and {Voronoi} Diagrams for {Riemannian} Manifolds"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "341--349"
+, update =      "00.11 jones"
 }
 
 @article{l-udaek-59
-, author =	"K. Leichtwei{\ss}"
-, title =	"{\"U}ber die affine {Exzentrizit{\"a}t} konvexer {K{\"o}rper}"
-, journal =	"Arch. Math."
-, volume =	10
-, year =	1959
-, pages =	"187--199"
-, update =	"97.11 bibrelex"
+, author =      "K. Leichtwei{\ss}"
+, title =       "{\"U}ber die affine {Exzentrizit{\"a}t} konvexer {K{\"o}rper}"
+, journal =     "Arch. Math."
+, volume =      10
+, year =        1959
+, pages =       "187--199"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{l-lsvwi-82
-, author =	"F. T. Leighton"
-, title =	"A layout strategy for {VLSI} which is provably good"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Theory Comput."
-, year =	1982
-, pages =	"85--98"
-, precedes =	"bl-fsvgl-84"
+, author =      "F. T. Leighton"
+, title =       "A layout strategy for {VLSI} which is provably good"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Theory Comput."
+, year =        1982
+, pages =       "85--98"
+, precedes =    "bl-fsvgl-84"
 }
 
 @book{l-civ-83
-, author =	"F. T. Leighton"
-, title =	"Complexity issues in {VLSI}"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "F. T. Leighton"
+, title =       "Complexity issues in {VLSI}"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @book{l-ipaaa-92
-, author =	"F. T. Leighton"
-, title =	"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes"
-, publisher =	"Morgan-Kaufmann"
-, address =	"San Mateo, CA"
-, year =	1992
-, update =	"96.09 orourke"
+, author =      "F. T. Leighton"
+, title =       "Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes"
+, publisher =   "Morgan-Kaufmann"
+, address =     "San Mateo, CA"
+, year =        1992
+, update =      "96.09 orourke"
 }
 
 @inproceedings{l-nlbtv-81
-, author =	"F. T. Leighton"
-, title =	"New lower bound techniques for {VLSI}"
-, booktitle =	"Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1981
-, pages =	"1--12"
-, precedes =	"l-nlbtv-84"
+, author =      "F. T. Leighton"
+, title =       "New lower bound techniques for {VLSI}"
+, booktitle =   "Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1981
+, pages =       "1--12"
+, precedes =    "l-nlbtv-84"
 }
 
 @article{l-nlbtv-84
-, author =	"F. T. Leighton"
-, title =	"New lower bound techniques for {VLSI}"
-, journal =	"Math. Syst. Theory"
-, volume =	17
-, year =	1984
-, pages =	"47--70"
-, succeeds =	"l-nlbtv-81"
+, author =      "F. T. Leighton"
+, title =       "New lower bound techniques for {VLSI}"
+, journal =     "Math. Syst. Theory"
+, volume =      17
+, year =        1984
+, pages =       "47--70"
+, succeeds =    "l-nlbtv-81"
 }
 
 @article{l-tbcps-85
-, author =	"F. T. Leighton"
-, title =	"Tight Bounds on the Complexity of Parallel Sorting"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-34"
-, number =	4
-, year =	1985
-, pages =	"344--354"
-, update =	"96.09 orourke"
+, author =      "F. T. Leighton"
+, title =       "Tight Bounds on the Complexity of Parallel Sorting"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-34"
+, number =      4
+, year =        1985
+, pages =       "344--354"
+, update =      "96.09 orourke"
 }
 
 @article{ll-wsisa-85
-, author =	"F. T. Leighton and C. E. Leiserson"
-, title =	"Wafer-scale integration of systolic arrays"
-, journal =	"IEEE Trans. Comput."
-, volume =	"??"
-, year =	1985
-, pages =	"448--461"
-, update =	"98.03 bibrelex"
+, author =      "F. T. Leighton and C. E. Leiserson"
+, title =       "Wafer-scale integration of systolic arrays"
+, journal =     "IEEE Trans. Comput."
+, volume =      "??"
+, year =        1985
+, pages =       "448--461"
+, update =      "98.03 bibrelex"
 }
 
 @article{lr-3dcl-86
-, author =	"F. T. Leighton and A. Rosenberg"
-, title =	"{3D} Circuit Layouts"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"793--813"
-, update =	"96.09 tamassia"
+, author =      "F. T. Leighton and A. Rosenberg"
+, title =       "{3D} Circuit Layouts"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "793--813"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{l-sndsn-89
-, author =	"P. Leinhardt"
-, title =	"Subdivision of $n$-dimensional spaces and $n$-dimensional generalized maps"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"228--236"
+, author =      "P. Leinhardt"
+, title =       "Subdivision of $n$-dimensional spaces and $n$-dimensional generalized maps"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "228--236"
 }
 
 @article{ln-dnnp-79
-, author =	"T. Leipaelae and O. Nevalainen"
-, title =	"On a dynamic nearest neighbour problem"
-, journal =	"RAIRO Inform. Theor."
-, volume =	13
-, year =	1979
-, pages =	"3--15"
+, author =      "T. Leipaelae and O. Nevalainen"
+, title =       "On a dynamic nearest neighbour problem"
+, journal =     "RAIRO Inform. Theor."
+, volume =      13
+, year =        1979
+, pages =       "3--15"
 }
 
 @inproceedings{l-aeglv-80
-, author =	"C. E. Leiserson"
-, title =	"Area-efficient graph layouts (for {VLSI})"
-, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1980
-, pages =	"270--281"
+, author =      "C. E. Leiserson"
+, title =       "Area-efficient graph layouts (for {VLSI})"
+, booktitle =   "Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1980
+, pages =       "270--281"
 }
 
 @book{l-aeglv-83
-, author =	"C. E. Leiserson"
-, title =	"Area-efficient graph layouts (for {VLSI})"
-, series =	"ACM Doctoral Dissertation Award Series"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1983
+, author =      "C. E. Leiserson"
+, title =       "Area-efficient graph layouts (for {VLSI})"
+, series =      "ACM Doctoral Dissertation Award Series"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1983
 }
 
 @inproceedings{lm-artrp-85
-, author =	"C. E. Leiserson and F. M. Maley"
-, title =	"Algorithms for routing and testing routability of planar {VLSI} layouts"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
-, year =	1985
-, pages =	"69--78"
+, author =      "C. E. Leiserson and F. M. Maley"
+, title =       "Algorithms for routing and testing routability of planar {VLSI} layouts"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Theory Comput."
+, year =        1985
+, pages =       "69--78"
 }
 
 @techreport{lp-seafc-83
-, author =	"C. E. Leiserson and C. A. Phillips"
-, title =	"A space-efficient algorithm for finding the connected components of rectangles in the plane"
-, type =	"Report"
-, number =	"??"
-, institution =	"Lab. Comput. Sci., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1983
+, author =      "C. E. Leiserson and C. A. Phillips"
+, title =       "A space-efficient algorithm for finding the connected components of rectangles in the plane"
+, type =        "Report"
+, number =      "??"
+, institution = "Lab. Comput. Sci., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1983
 }
 
 @article{lp-oprr-83
-, author =	"C. E. Leiserson and R. Y. Pinter"
-, title =	"Optimal placement for river routing"
-, journal =	"SIAM J. Comput."
-, volume =	12
-, year =	1983
-, pages =	"447--462"
+, author =      "C. E. Leiserson and R. Y. Pinter"
+, title =       "Optimal placement for river routing"
+, journal =     "SIAM J. Comput."
+, volume =      12
+, year =        1983
+, pages =       "447--462"
 }
 
 @inproceedings{ls-tdgs-91
-, author =	"A. L. Leistman and T. C. Shermer"
-, title =	"Two-dimensional grid spanners"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"211--214"
-, cites =	"ckv-fhe-87, c-t2s-91, kl-pic-80, ls-ghs-91, ps-gs-89, pu-osh-87, rl-dcps-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "A. L. Leistman and T. C. Shermer"
+, title =       "Two-dimensional grid spanners"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "211--214"
+, cites =       "ckv-fhe-87, c-t2s-91, kl-pic-80, ls-ghs-91, ps-gs-89, pu-osh-87, rl-dcps-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{l-ceaaw-
-, author =	"L. D. Lejter"
-, title =	"A Collaborative Environment for Algorithm Animation on the {WWW}"
-, url =	"http://loki.cs.brown.edu:8080/CollaborativeMocha/paper_html/index.html"
-, update =	"98.07 tamassia"
-, annote =	"M.Sc. thesis manuscript"
+, author =      "L. D. Lejter"
+, title =       "A Collaborative Environment for Algorithm Animation on the {WWW}"
+, url = "http://loki.cs.brown.edu:8080/CollaborativeMocha/paper_html/index.html"
+, update =      "98.07 tamassia"
+, annote =      "M.Sc. thesis manuscript"
 }
 
 @article{lmr-smoop-92
-, author =	"Moises Lejter and Scott Meyers and Steven P. Reiss"
-, title =	"Support for maintaining object-oriented programs"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	18
-, number =	12
-, month =	dec
-, year =	1992
-, pages =	"1045--1052"
-, update =	"97.03 tamassia"
+, author =      "Moises Lejter and Scott Meyers and Steven P. Reiss"
+, title =       "Support for maintaining object-oriented programs"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      18
+, number =      12
+, month =       dec
+, year =        1992
+, pages =       "1045--1052"
+, update =      "97.03 tamassia"
 }
 
 @book{l-gn-69
-, author =	"G. Lekkerkerker"
-, title =	"Geometry of Numbers"
-, publisher =	"Wolters-Noordhoff"
-, address =	"Groningen, Netherlands"
-, year =	1969
-, precedes =	"gl-gn-87"
-, update =	"93.09 rote"
+, author =      "G. Lekkerkerker"
+, title =       "Geometry of Numbers"
+, publisher =   "Wolters-Noordhoff"
+, address =     "Groningen, Netherlands"
+, year =        1969
+, precedes =    "gl-gn-87"
+, update =      "93.09 rote"
 }
 
 @phdthesis{l-tdam-97
-, author =	"C. Lemaire"
-, title =	"Triangulation de {Delaunay} et arbres multidimensionnels"
-, type =	"Th\`{e}se de doctorat en sciences"
-, school =	"{\'E}cole des Mines de St-Etienne"
-, address =	"France"
-, year =	1997
-, keywords =	"doctoral thesis"
-, update =	"98.07 devillers"
+, author =      "C. Lemaire"
+, title =       "Triangulation de {Delaunay} et arbres multidimensionnels"
+, type =        "Th\`{e}se de doctorat en sciences"
+, school =      "{\'E}cole des Mines de St-Etienne"
+, address =     "France"
+, year =        1997
+, keywords =    "doctoral thesis"
+, update =      "98.07 devillers"
 }
 
 @article{lm-prmdd-00
-, author =	"C. Lemaire and J.-M. Moreau"
-, title =	"A probabilistic result on multi-dimensional {Delaunay} triangulations, and its application to the {2D} case"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	17
-, year =	2000
-, pages =	"69--96"
-, update =	"01.04 smid"
+, author =      "C. Lemaire and J.-M. Moreau"
+, title =       "A probabilistic result on multi-dimensional {Delaunay} triangulations, and its application to the {2D} case"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      17
+, year =        2000
+, pages =       "69--96"
+, update =      "01.04 smid"
 }
 
 @inproceedings{lm-ackdm-97
-, author =	"Christophe Lemaire and Jean-Michel Moreau"
-, title =	"Analysis of a Class of $k$--Dimensional Merge Procedures, with an Application to 2$D$ {Delaunay} Triangulation in Expected Linear Time After Two--Directional Sorting"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"129--134"
-, update =	"98.07 devillers, 97.11 jones"
+, author =      "Christophe Lemaire and Jean-Michel Moreau"
+, title =       "Analysis of a Class of $k$--Dimensional Merge Procedures, with an Application to 2$D$ {Delaunay} Triangulation in Expected Linear Time After Two--Directional Sorting"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "129--134"
+, update =      "98.07 devillers, 97.11 jones"
 }
 
 @unpublished{lw-ciaff-88
-, author =	"P. Lemke and M. Werman"
-, title =	"On the complexity of inverting the autocorrelation function of a finite integer sequence, and the problem of locating $n$ points on a line, given the unlabeled distances between them"
-, year =	1988
-, note =	"Manuscript"
-, update =	"97.11 bibrelex"
+, author =      "P. Lemke and M. Werman"
+, title =       "On the complexity of inverting the autocorrelation function of a finite integer sequence, and the problem of locating $n$ points on a line, given the unlabeled distances between them"
+, year =        1988
+, note =        "Manuscript"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{lec-aptg-67
-, author =	"A. Lempel and S. Even and I. Cederbaum"
-, title =	"An Algorithm for Planarity Testing of Graphs"
-, booktitle =	"Theory of Graphs: Internat. Symposium (Rome 1966)"
-, publisher =	"Gordon and Breach"
-, address =	"New York"
-, year =	1967
-, pages =	"215--232"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "A. Lempel and S. Even and I. Cederbaum"
+, title =       "An Algorithm for Planarity Testing of Graphs"
+, booktitle =   "Theory of Graphs: Internat. Symposium (Rome 1966)"
+, publisher =   "Gordon and Breach"
+, address =     "New York"
+, year =        1967
+, pages =       "215--232"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{l-arpmb-93
-, author =	"T. Lengauer"
-, title =	"Algorithmic research problems in molecular bioinformatics"
-, booktitle =	"Proc. 2nd IEEE Israeli Sympos. Theory of Comput. and Systems"
-, year =	1993
-, pages =	"177--192"
-, update =	"98.03 agarwal"
+, author =      "T. Lengauer"
+, title =       "Algorithmic research problems in molecular bioinformatics"
+, booktitle =   "Proc. 2nd IEEE Israeli Sympos. Theory of Comput. and Systems"
+, year =        1993
+, pages =       "177--192"
+, update =      "98.03 agarwal"
 }
 
 @book{l-caicl-90
-, author =	"T. Lengauer"
-, title =	"Combinatorial Algorithms for Integrated Circuit Layout"
-, publisher =	"B. G. Teubner"
-, year =	1990
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "T. Lengauer"
+, title =       "Combinatorial Algorithms for Integrated Circuit Layout"
+, publisher =   "B. G. Teubner"
+, year =        1990
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{l-sisri-84
-, author =	"T. Lengauer"
-, title =	"On the solution of inequality systems relevant to {IC}-layout"
-, journal =	"J. Algorithms"
-, volume =	5
-, year =	1984
-, pages =	"408--421"
-, update =	"98.03 bibrelex"
+, author =      "T. Lengauer"
+, title =       "On the solution of inequality systems relevant to {IC}-layout"
+, journal =     "J. Algorithms"
+, volume =      5
+, year =        1984
+, pages =       "408--421"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ll-dfmwt-97
-, author =	"William Lenhart and Giuseppe Liotta"
-, title =	"Drawable and Forbidden Minimum Weight Triangulations"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"1--12"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "William Lenhart and Giuseppe Liotta"
+, title =       "Drawable and Forbidden Minimum Weight Triangulations"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "1--12"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{ll-domwt-96
-, author =	"W. Lenhart and G. Liotta"
-, title =	"Drawing Outerplanar Minimum Weight Triangulations"
-, journal =	"Inform. Process. Lett."
-, volume =	57
-, number =	5
-, year =	1996
-, pages =	"253--260"
-, url =	"https://www.cs.brown.edu/cgc/papers/ll-domwt-96.ps.gz"
-, keywords =	"graph drawing, planar, minimum weight triangulation"
-, update =	"98.11 tamassia, 97.03 tamassia, 96.01 liotta"
+, author =      "W. Lenhart and G. Liotta"
+, title =       "Drawing Outerplanar Minimum Weight Triangulations"
+, journal =     "Inform. Process. Lett."
+, volume =      57
+, number =      5
+, year =        1996
+, pages =       "253--260"
+, url = "https://www.cs.brown.edu/cgc/papers/ll-domwt-96.ps.gz"
+, keywords =    "graph drawing, planar, minimum weight triangulation"
+, update =      "98.11 tamassia, 97.03 tamassia, 96.01 liotta"
 }
 
 @inproceedings{ll-hdomw-96
-, author =	"W. Lenhart and G. Liotta"
-, title =	"How to Draw Outerplanar Minimum Weight Triangulations"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"373--384"
-, url =	"https://www.cs.brown.edu/cgc/papers/ll-hdomw-96.ps.gz"
-, keywords =	"graph drawing"
-, update =	"97.03 tamassia, 96.09 tamassia"
+, author =      "W. Lenhart and G. Liotta"
+, title =       "How to Draw Outerplanar Minimum Weight Triangulations"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "373--384"
+, url = "https://www.cs.brown.edu/cgc/papers/ll-hdomw-96.ps.gz"
+, keywords =    "graph drawing"
+, update =      "97.03 tamassia, 96.09 tamassia"
 }
 
 @techreport{ll-pdog-96
-, author =	"W. Lenhart and G. Liotta"
-, title =	"Proximity Drawings of Outerplanar Graphs"
-, type =	"Technical Report"
-, number =	"CS-96-21"
-, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
-, year =	1996
-, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-21.ps.Z"
-, keywords =	"graph drawing, proximity, CGC, Brown"
-, update =	"97.03 tamassia"
+, author =      "W. Lenhart and G. Liotta"
+, title =       "Proximity Drawings of Outerplanar Graphs"
+, type =        "Technical Report"
+, number =      "CS-96-21"
+, institution = "Center for Geometric Computing, Dept. Computer Science, Brown Univ."
+, year =        1996
+, url = "ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-21.ps.Z"
+, keywords =    "graph drawing, proximity, CGC, Brown"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{ll-pdog-97
-, author =	"W. Lenhart and G. Liotta"
-, title =	"Proximity Drawings of Outerplanar Graphs"
-, editor =	"S. North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"286--302"
-, url =	"https://www.cs.brown.edu/cgc/papers/ll-pdog-97.ps.gz"
-, keywords =	"graph drawing, proximity, CGC, Brown"
-, update =	"98.07 tamassia, 97.03 tamassia"
+, author =      "W. Lenhart and G. Liotta"
+, title =       "Proximity Drawings of Outerplanar Graphs"
+, editor =      "S. North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "286--302"
+, url = "https://www.cs.brown.edu/cgc/papers/ll-pdog-97.ps.gz"
+, keywords =    "graph drawing, proximity, CGC, Brown"
+, update =      "98.07 tamassia, 97.03 tamassia"
 }
 
 @inproceedings{lpsssstwy-clcsp-87
-, author =	"W. Lenhart and R. Pollack and J.-R. Sack and R. Seidel and Micha Sharir and Subhash Suri and G. T. Toussaint and S. Whitesides and C. K. Yap"
-, title =	"Computing the link center of a simple polygon"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"1--10"
-, keywords =	"polygons, simple, link distance, visibility, construction, diameter, covering"
-, precedes =	"lpsssstwy-clcsp-88"
-, cites =	"at-cgcsp-86, at-oadvp-81, c-tpca-82, cg-vippg-85, ea-lacvp-81, gjpt-tsp-78, g-agtpg-80, ghlst-ltavs-86t, lp-esppr-84, ps-cgcsp-86, s-pptld-86, s-cagfn-86, tv-otats-86, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 93.05 smid"
+, author =      "W. Lenhart and R. Pollack and J.-R. Sack and R. Seidel and Micha Sharir and Subhash Suri and G. T. Toussaint and S. Whitesides and C. K. Yap"
+, title =       "Computing the link center of a simple polygon"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "1--10"
+, keywords =    "polygons, simple, link distance, visibility, construction, diameter, covering"
+, precedes =    "lpsssstwy-clcsp-88"
+, cites =       "at-cgcsp-86, at-oadvp-81, c-tpca-82, cg-vippg-85, ea-lacvp-81, gjpt-tsp-78, g-agtpg-80, ghlst-ltavs-86t, lp-esppr-84, ps-cgcsp-86, s-pptld-86, s-cagfn-86, tv-otats-86, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 93.05 smid"
 }
 
 @article{lpsssstwy-clcsp-88
-, author =	"W. Lenhart and R. Pollack and J.-R. Sack and R. Seidel and Micha Sharir and Subhash Suri and G. T. Toussaint and S. Whitesides and C. K. Yap"
-, title =	"Computing the link center of a simple polygon"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"281--293"
-, keywords =	"polygons, simple, link distance, visibility, construction, diameter, covering"
-, succeeds =	"lpsssstwy-clcsp-87"
-, update =	"98.03 mitchell"
+, author =      "W. Lenhart and R. Pollack and J.-R. Sack and R. Seidel and Micha Sharir and Subhash Suri and G. T. Toussaint and S. Whitesides and C. K. Yap"
+, title =       "Computing the link center of a simple polygon"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "281--293"
+, keywords =    "polygons, simple, link distance, visibility, construction, diameter, covering"
+, succeeds =    "lpsssstwy-clcsp-87"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{lw-rltm-92
-, author =	"W. J. Lenhart and S. H. Whitesides"
-, title =	"Reconfiguration with line tracking motions"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"198--203"
-, cites =	"hjw-mra2d-85, k-mslra-92, kk-namra-86, lw-tpio-91, ss-pmp2g-83, w-aigpl-92, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "W. J. Lenhart and S. H. Whitesides"
+, title =       "Reconfiguration with line tracking motions"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "198--203"
+, cites =       "hjw-mra2d-85, k-mslra-92, kk-namra-86, lw-tpio-91, ss-pmp2g-83, w-aigpl-92, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{lw-rcpce-95
-, author =	"W. J. Lenhart and S. H. Whitesides"
-, title =	"Reconfiguring closed polygonal chains in {Euclidean} $d$-space"
-, journal =	"Discrete Comput. Geom."
-, volume =	13
-, year =	1995
-, pages =	"123--140"
-, update =	"96.05 smid"
+, author =      "W. J. Lenhart and S. H. Whitesides"
+, title =       "Reconfiguring closed polygonal chains in {Euclidean} $d$-space"
+, journal =     "Discrete Comput. Geom."
+, volume =      13
+, year =        1995
+, pages =       "123--140"
+, update =      "96.05 smid"
 }
 
 @techreport{lw-rsp-93
-, author =	"William J. Lenhart and Sue H. Whitesides"
-, title =	"Reconfiguring Simple Polygons"
-, number =	"SOCS-93.3"
-, institution =	"School of Computer Science, McGill University"
-, month =	mar
-, year =	1993
-, update =	"02.03 orourke"
+, author =      "William J. Lenhart and Sue H. Whitesides"
+, title =       "Reconfiguring Simple Polygons"
+, number =      "SOCS-93.3"
+, institution = "School of Computer Science, McGill University"
+, month =       mar
+, year =        1993
+, update =      "02.03 orourke"
 }
 
 @inproceedings{lw-tpio-91
-, author =	"W. J. Lenhart and S. H. Whitesides"
-, title =	"Turning a polygon inside-out"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"66--69"
-, cites =	"hjw-mra2d-85, kk-namra-86, k-mslra-92, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "W. J. Lenhart and S. H. Whitesides"
+, title =       "Turning a polygon inside-out"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "66--69"
+, cites =       "hjw-mra2d-85, kk-namra-86, k-mslra-92, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{l-dusda-93
-, author =	"H. P. Lenhof"
-, title =	"Distanz- und {Suchprobleme} in der algorithmischen {Geometrie} und {Anwendungen} in der {Bioinformatik}"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"94.05 smid"
+, author =      "H. P. Lenhof"
+, title =       "Distanz- und {Suchprobleme} in der algorithmischen {Geometrie} und {Anwendungen} in der {Bioinformatik}"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "94.05 smid"
 }
 
 @inproceedings{ls-afran-94
-, author =	"H.-P. Lenhof and M. Smid"
-, title =	"An animation of a fixed-radius all-nearest-neighbors algorithm"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	387
-, keywords =	"video review"
-, cites =	"hsb-tarms-90, ls-ekcpo-92i, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones"
+, author =      "H.-P. Lenhof and M. Smid"
+, title =       "An animation of a fixed-radius all-nearest-neighbors algorithm"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       387
+, keywords =    "video review"
+, cites =       "hsb-tarms-90, ls-ekcpo-92i, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones"
 }
 
 @techreport{ls-ocmgc-91t
-, author =	"H. P. Lenhof and M. Smid"
-, title =	"An optimal construction method for generalized convex layers"
-, type =	"Report"
-, number =	"MPI-I-91-112"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1991
-, precedes =	"ls-ocmgc-91i"
+, author =      "H. P. Lenhof and M. Smid"
+, title =       "An optimal construction method for generalized convex layers"
+, type =        "Report"
+, number =      "MPI-I-91-112"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1991
+, precedes =    "ls-ocmgc-91i"
 }
 
 @inproceedings{ls-ocmgc-91i
-, author =	"H. P. Lenhof and M. Smid"
-, title =	"An optimal construction method for generalized convex layers"
-, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"349--363"
-, succeeds =	"ls-ocmgc-91t"
-, precedes =	"ls-ocmgc-93"
-, update =	"94.01 smid"
+, author =      "H. P. Lenhof and M. Smid"
+, title =       "An optimal construction method for generalized convex layers"
+, booktitle =   "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "349--363"
+, succeeds =    "ls-ocmgc-91t"
+, precedes =    "ls-ocmgc-93"
+, update =      "94.01 smid"
 }
 
 @article{ls-ocmgc-93
-, author =	"H. P. Lenhof and M. Smid"
-, title =	"An optimal construction method for generalized convex layers"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"245--267"
-, succeeds =	"ls-ocmgc-91i"
-, update =	"94.01 smid"
+, author =      "H. P. Lenhof and M. Smid"
+, title =       "An optimal construction method for generalized convex layers"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "245--267"
+, succeeds =    "ls-ocmgc-91i"
+, update =      "94.01 smid"
 }
 
 @techreport{ls-ekcpo-92t
-, author =	"H. P. Lenhof and M. Smid"
-, title =	"Enumerating the $k$ closest pairs optimally"
-, type =	"Report"
-, number =	"MPI-I-92-118"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
+, author =      "H. P. Lenhof and M. Smid"
+, title =       "Enumerating the $k$ closest pairs optimally"
+, type =        "Report"
+, number =      "MPI-I-92-118"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
 }
 
 @inproceedings{ls-ekcpo-92i
-, author =	"H.-P. Lenhof and M. Smid"
-, title =	"Enumerating the $k$ closest pairs optimally"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"380--386"
+, author =      "H.-P. Lenhof and M. Smid"
+, title =       "Enumerating the $k$ closest pairs optimally"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "380--386"
 }
 
 @techreport{ls-mvmsw-92t
-, author =	"H. P. Lenhof and M. Smid"
-, title =	"Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity"
-, type =	"Report"
-, number =	"MPI-I-92-102"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
-, precedes =	"ls-mvmsw-92i"
+, author =      "H. P. Lenhof and M. Smid"
+, title =       "Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity"
+, type =        "Report"
+, number =      "MPI-I-92-102"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
+, precedes =    "ls-mvmsw-92i"
 }
 
 @inproceedings{ls-mvmsw-92i
-, author =	"H.-P. Lenhof and M. Smid"
-, title =	"Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"388--398"
-, succeeds =	"ls-mvmsw-92t"
-, precedes =	"ls-mvmsw-95"
-, update =	"95.05 smid"
+, author =      "H.-P. Lenhof and M. Smid"
+, title =       "Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "388--398"
+, succeeds =    "ls-mvmsw-92t"
+, precedes =    "ls-mvmsw-95"
+, update =      "95.05 smid"
 }
 
 @article{ls-mvmsw-95
-, author =	"H.-P. Lenhof and M. Smid"
-, title =	"Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity"
-, journal =	"Algorithmica"
-, volume =	13
-, year =	1995
-, pages =	"301--312"
-, succeeds =	"ls-mvmsw-92i"
-, update =	"95.05 smid"
+, author =      "H.-P. Lenhof and M. Smid"
+, title =       "Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity"
+, journal =     "Algorithmica"
+, volume =      13
+, year =        1995
+, pages =       "301--312"
+, succeeds =    "ls-mvmsw-92i"
+, update =      "95.05 smid"
 }
 
 @techreport{ls-spakc-92
-, author =	"H. P. Lenhof and M. Smid"
-, title =	"Sequential and parallel algorithms for the $k$ closest pairs problem"
-, type =	"Report"
-, number =	"MPI-I-92-134"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
+, author =      "H. P. Lenhof and M. Smid"
+, title =       "Sequential and parallel algorithms for the $k$ closest pairs problem"
+, type =        "Report"
+, number =      "MPI-I-92-134"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
 }
 
 @article{ls-spakc-95
-, author =	"H. P. Lenhof and M. Smid"
-, title =	"Sequential and parallel algorithms for the $k$ closest pairs problem"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"273--288"
-, update =	"95.09 smid"
+, author =      "H. P. Lenhof and M. Smid"
+, title =       "Sequential and parallel algorithms for the $k$ closest pairs problem"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "273--288"
+, update =      "95.09 smid"
 }
 
 @techreport{ls-updsa-90
-, author =	"H. P. Lenhof and M. Smid"
-, title =	"Using persistent data structures for adding range restrictions to searching problems"
-, type =	"Report"
-, number =	"A-22/90"
-, institution =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1990
-, update =	"94.05 smid"
+, author =      "H. P. Lenhof and M. Smid"
+, title =       "Using persistent data structures for adding range restrictions to searching problems"
+, type =        "Report"
+, number =      "A-22/90"
+, institution = "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1990
+, update =      "94.05 smid"
 }
 
 @article{ls-updsa-94
-, author =	"H. P. Lenhof and M. Smid"
-, title =	"Using persistent data structures for adding range restrictions to searching problems"
-, journal =	"RAIRO Inform. Theor."
-, volume =	28
-, year =	1994
-, pages =	"25--49"
-, update =	"94.05 smid"
+, author =      "H. P. Lenhof and M. Smid"
+, title =       "Using persistent data structures for adding range restrictions to searching problems"
+, journal =     "RAIRO Inform. Theor."
+, volume =      28
+, year =        1994
+, pages =       "25--49"
+, update =      "94.05 smid"
 }
 
 @article{l-tsfpp-11
-, author =	"N. J. Lennes"
-, title =	"Theorems on the simple finite polygon and polyhedron"
-, journal =	"Amer. J. Math."
-, volume =	33
-, year =	1911
-, pages =	"37--62"
-, keywords =	"decomposition, polygon triangulation, elementary geometry"
-, annote =	"Proves that convex decomposition, without introducing
-		 new vertices, exists for any polygon but not
-		 necessarily for any polyhedron."
+, author =      "N. J. Lennes"
+, title =       "Theorems on the simple finite polygon and polyhedron"
+, journal =     "Amer. J. Math."
+, volume =      33
+, year =        1911
+, pages =       "37--62"
+, keywords =    "decomposition, polygon triangulation, elementary geometry"
+, annote =      "Proves that convex decomposition, without introducing
+                 new vertices, exists for any polygon but not
+                 necessarily for any polyhedron."
 }
 
 @article{lll-fprc-82
-, author =	"A. K. Lenstra and H. W. {Lenstra, Jr.} and L. Lovasz"
-, title =	"Factoring polynomials with rational coefficients"
-, journal =	"Math. Ann."
-, volume =	261
-, year =	1982
-, pages =	"514--534"
-, update =	"97.11 bibrelex"
+, author =      "A. K. Lenstra and H. W. {Lenstra, Jr.} and L. Lovasz"
+, title =       "Factoring polynomials with rational coefficients"
+, journal =     "Math. Ann."
+, volume =      261
+, year =        1982
+, pages =       "514--534"
+, update =      "97.11 bibrelex"
 }
 
 @article{l-ipfnv-83
-, author =	"H. W. Lenstra"
-, title =	"Integer programming with a fixed number of variables"
-, journal =	"Math. Oper. Res."
-, volume =	8
-, year =	1983
-, pages =	"538--548"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "H. W. Lenstra"
+, title =       "Integer programming with a fixed number of variables"
+, journal =     "Math. Oper. Res."
+, volume =      8
+, year =        1983
+, pages =       "538--548"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{l-ptaor-80
-, author =	"A. S. LePaugh"
-, title =	"A polynomial time algorithm for optimal routing around a rectangle"
-, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1980
-, pages =	"292--293"
+, author =      "A. S. LePaugh"
+, title =       "A polynomial time algorithm for optimal routing around a rectangle"
+, booktitle =   "Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1980
+, pages =       "292--293"
 }
 
 @article{l-slfde-45
-, author =	"J. Leray"
-, title =	"Sur la forme des espaces topologiques et sur les points fixes des repr{\`e}sentations"
-, journal =	"J. Math. Pure Appl."
-, volume =	24
-, year =	1945
-, pages =	"95--167"
-, update =	"98.03 bibrelex"
+, author =      "J. Leray"
+, title =       "Sur la forme des espaces topologiques et sur les points fixes des repr{\`e}sentations"
+, journal =     "J. Math. Pure Appl."
+, volume =      24
+, year =        1945
+, pages =       "95--167"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{js-nchga-95
-, author =	"John S. {Letcher, Jr.} and Michael Shook"
-, title =	"NURBS Considered Harmful for Gridding (Alternative Offered)"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"253--264"
-, update =	"96.01 samitchell"
+, author =      "John S. {Letcher, Jr.} and Michael Shook"
+, title =       "NURBS Considered Harmful for Gridding (Alternative Offered)"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "253--264"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{lle-ssea-97
-, author =	"S. T. Leutenegger and M. A. Lopez and J. Edington"
-, title =	"{STR}: {A} simple and efficient algorithm for {R}-tree packing"
-, booktitle =	"Proc. 13th IEEE Internat. Conf. Data Eng."
-, year =	1997
-, pages =	"497--506"
-, update =	"97.07 agarwal"
+, author =      "S. T. Leutenegger and M. A. Lopez and J. Edington"
+, title =       "{STR}: {A} simple and efficient algorithm for {R}-tree packing"
+, booktitle =   "Proc. 13th IEEE Internat. Conf. Data Eng."
+, year =        1997
+, pages =       "497--506"
+, update =      "97.07 agarwal"
 }
 
 @article{l-olbng-87
-, author =	"C. Levcopoulos"
-, title =	"An {$\Omega(\sqrt{n})$} lower bound for the non-optimality of the greedy triangulation"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"247--251"
-, update =	"98.07 bibrelex"
+, author =      "C. Levcopoulos"
+, title =       "An {$\Omega(\sqrt{n})$} lower bound for the non-optimality of the greedy triangulation"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "247--251"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{l-fhmlr-86
-, author =	"C. Levcopoulos"
-, title =	"Fast heuristics for minimum length rectangular partitions of polygons"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"100--108"
-, cites =	"cd-vdbcd-85, f-fapct-85, gz-bprp-85, ia-dsisa-84, ks-mdpo-85, k-ubsir-80, ll-blcpp-84, l-hmelr-83, lprs-melpr-82, l-tspp-77, ps-cgi-85, r-ppis-82, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "C. Levcopoulos"
+, title =       "Fast heuristics for minimum length rectangular partitions of polygons"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "100--108"
+, cites =       "cd-vdbcd-85, f-fapct-85, gz-bprp-85, ia-dsisa-84, ks-mdpo-85, k-ubsir-80, ll-blcpp-84, l-hmelr-83, lprs-melpr-82, l-tspp-77, ps-cgi-85, r-ppis-82, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{l-hmdp-87
-, author =	"C. Levcopoulos"
-, title =	"Heuristics for Minimum Decompositions of Polygons"
-, school =	"Link{\"o}ping Studies in Science and Technology"
-, address =	"Link{\"o}ping, Sweden"
-, year =	1987
-, note =	"No. 155"
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "C. Levcopoulos"
+, title =       "Heuristics for Minimum Decompositions of Polygons"
+, school =      "Link{\"o}ping Studies in Science and Technology"
+, address =     "Link{\"o}ping, Sweden"
+, year =        1987
+, note =        "No. 155"
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{l-mltfr-85
-, author =	"C. Levcopoulos"
-, title =	"Minimum length and 'thickest-first' rectangular partitions of polygons"
-, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "C. Levcopoulos"
+, title =       "Minimum length and 'thickest-first' rectangular partitions of polygons"
+, booktitle =   "Proc. 23rd Allerton Conf. Commun. Control Comput."
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @incollection{lg-lthmr-97
-, author =	"C. Levcopoulos and J. Gudmundsson"
-, title =	"A Linear Time Heuristic for Minimum Rectangle Coverings"
-, booktitle =	"11th International Symposium on Fundamentals of Computation Theory"
-, nickname =	"FCT '97"
-, site =	"Krakow, Poland"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1279
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"305--316"
-, update =	"99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "C. Levcopoulos and J. Gudmundsson"
+, title =       "A Linear Time Heuristic for Minimum Rectangle Coverings"
+, booktitle =   "11th International Symposium on Fundamentals of Computation Theory"
+, nickname =    "FCT '97"
+, site =        "Krakow, Poland"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1279
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "305--316"
+, update =      "99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @incollection{lg-camrc-96
-, author =	"C. Levcopoulos and J. Gudmundsson"
-, title =	"Close approximations of minimum rectangular coverings"
-, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1180
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"135--146"
-, update =	"97.03 smid"
+, author =      "C. Levcopoulos and J. Gudmundsson"
+, title =       "Close approximations of minimum rectangular coverings"
+, booktitle =   "Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1180
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "135--146"
+, update =      "97.03 smid"
 }
 
 @inproceedings{lkl-oetpa-88
-, author =	"C. Levcopoulos and J. Katajainen and A. Lingas"
-, title =	"An optimal expected-time parallel algorithm for {Voronoi} diagrams"
-, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	318
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"190--198"
+, author =      "C. Levcopoulos and J. Katajainen and A. Lingas"
+, title =       "An optimal expected-time parallel algorithm for {Voronoi} diagrams"
+, booktitle =   "Proc. 1st Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      318
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "190--198"
 }
 
 @article{lk-ltasm-98
-, author =	"C. Levcopoulos and D. Krznaric"
-, title =	"A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons"
-, journal =	"Algorithmica"
-, volume =	21
-, year =	1998
-, pages =	"285--311"
-, update =	"01.11 smid"
+, author =      "C. Levcopoulos and D. Krznaric"
+, title =       "A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons"
+, journal =     "Algorithmica"
+, volume =      21
+, year =        1998
+, pages =       "285--311"
+, update =      "01.11 smid"
 }
 
 @inproceedings{lk-qgtam-96
-, author =	"Christos Levcopoulos and Drago Krznaric"
-, title =	"Quasi-greedy triangulations approximating the minimum weight triangulation"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"392--401"
-, keywords =	"greedy triangulation, approximation of MWT"
-, update =	"96.09 agarwal, 96.01 mitchell"
+, author =      "Christos Levcopoulos and Drago Krznaric"
+, title =       "Quasi-greedy triangulations approximating the minimum weight triangulation"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "392--401"
+, keywords =    "greedy triangulation, approximation of MWT"
+, update =      "96.09 agarwal, 96.01 mitchell"
 }
 
 @inproceedings{ll-blcpp-84
-, author =	"C. Levcopoulos and A. Lingas"
-, title =	"Bounds on the length of convex partitions of polygons"
-, booktitle =	"Proc. 4th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	181
-, publisher =	"Springer-Verlag"
-, year =	1984
-, pages =	"279--295"
-, keywords =	"design of algorithms, VLSI design, partition, approximation, length, polygons, convex, rectangles"
+, author =      "C. Levcopoulos and A. Lingas"
+, title =       "Bounds on the length of convex partitions of polygons"
+, booktitle =   "Proc. 4th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      181
+, publisher =   "Springer-Verlag"
+, year =        1984
+, pages =       "279--295"
+, keywords =    "design of algorithms, VLSI design, partition, approximation, length, polygons, convex, rectangles"
 }
 
 @inproceedings{ll-cstam-92
-, author =	"C. Levcopoulos and A. Lingas"
-, title =	"C-Sensitive Triangulations Approximate the Minmax Length Triangulation"
-, booktitle =	"Proc. 12th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, site =	"New Delhi, India"
-, year =	1992
-, update =	"93.09 milone+mitchell"
+, author =      "C. Levcopoulos and A. Lingas"
+, title =       "C-Sensitive Triangulations Approximate the Minmax Length Triangulation"
+, booktitle =   "Proc. 12th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, site =        "New Delhi, India"
+, year =        1992
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{ll-cpmnr-84
-, author =	"C. Levcopoulos and A. Lingas"
-, title =	"Covering polygons with minimum number of rectangles"
-, booktitle =	"Proc. 1st Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	166
-, publisher =	"Springer-Verlag"
-, year =	1984
-, pages =	"63--72"
-, keywords =	"design of algorithms, VLSI design, covering, approximation, polygons, rectangles"
+, author =      "C. Levcopoulos and A. Lingas"
+, title =       "Covering polygons with minimum number of rectangles"
+, booktitle =   "Proc. 1st Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      166
+, publisher =   "Springer-Verlag"
+, year =        1984
+, pages =       "63--72"
+, keywords =    "design of algorithms, VLSI design, covering, approximation, polygons, rectangles"
 }
 
 @inproceedings{ll-fagt-90
-, author =	"C. Levcopoulos and A. Lingas"
-, title =	"Fast algorithms for greedy triangulation"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"238--250"
-, precedes =	"ll-fagt-92"
+, author =      "C. Levcopoulos and A. Lingas"
+, title =       "Fast algorithms for greedy triangulation"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "238--250"
+, precedes =    "ll-fagt-92"
 }
 
 @article{ll-fagt-92
-, author =	"Christos Levcopoulos and Andrzej Lingas"
-, title =	"Fast Algorithms for Greedy Triangulations"
-, journal =	"BIT"
-, volume =	32
-, year =	1992
-, pages =	"280--296"
-, succeeds =	"ll-fagt-90"
-, update =	"94.05 drysdale"
+, author =      "Christos Levcopoulos and Andrzej Lingas"
+, title =       "Fast Algorithms for Greedy Triangulations"
+, journal =     "BIT"
+, volume =      32
+, year =        1992
+, pages =       "280--296"
+, succeeds =    "ll-fagt-90"
+, update =      "94.05 drysdale"
 }
 
 @inproceedings{ll-gtaoc-91
-, author =	"C. Levcopoulos and A. Lingas"
-, title =	"Greedy trianglation approximates the optimum and can be implemented in linear time in the average case"
-, booktitle =	"Proc. 3rd Internat. Conf. on Information and Computing"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	497
-, year =	1991
-, pages =	"139--148"
-, succeeds =	"ll-gtaoc-90"
-, update =	"98.11 bibrelex"
+, author =      "C. Levcopoulos and A. Lingas"
+, title =       "Greedy trianglation approximates the optimum and can be implemented in linear time in the average case"
+, booktitle =   "Proc. 3rd Internat. Conf. on Information and Computing"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      497
+, year =        1991
+, pages =       "139--148"
+, succeeds =    "ll-gtaoc-90"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{ll-gtamw-92
-, author =	"C. Levcopoulos and A. Lingas"
-, title =	"Greedy Triangulation Approximates the Minimum Weight Triangulation and Can be Computed in Linear Time in the Average Case"
-, type =	"Technical {Report}"
-, number =	"LU-CS-TR:92-105"
-, institution =	"Dept. Comput. Sci., Lund Univ."
-, address =	"Lund, Sweden"
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "C. Levcopoulos and A. Lingas"
+, title =       "Greedy Triangulation Approximates the Minimum Weight Triangulation and Can be Computed in Linear Time in the Average Case"
+, type =        "Technical {Report}"
+, number =      "LU-CS-TR:92-105"
+, institution = "Dept. Comput. Sci., Lund Univ."
+, address =     "Lund, Sweden"
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ll-gtaoc-90
-, author =	"C. Levcopoulos and A. Lingas"
-, title =	"Greedy triangulation approximates the optimum and can be implemented in linear time in the average case"
-, number =	"90-72"
-, institution =	"Dept. of Comp. Sci., Lund University"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "C. Levcopoulos and A. Lingas"
+, title =       "Greedy triangulation approximates the optimum and can be implemented in linear time in the average case"
+, number =      "90-72"
+, institution = "Dept. of Comp. Sci., Lund University"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @article{ll-abgtc-87
-, author =	"C. Levcopoulos and A. Lingas"
-, title =	"On approximation behavior of the greedy triangulation for convex polygons"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"175--193"
-, keywords =	"implementing algorithms, approximation, length, triangulations, polygons, convex"
+, author =      "C. Levcopoulos and A. Lingas"
+, title =       "On approximation behavior of the greedy triangulation for convex polygons"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "175--193"
+, keywords =    "implementing algorithms, approximation, length, triangulations, polygons, convex"
 }
 
 @techreport{ll-solbl-??
-, author =	"C. Levcopoulos and A. Lingas"
-, title =	"Supplement: {An} {$\Omega(p \log k)$} lower bound on the length of convex partitions of polygons"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
+, author =      "C. Levcopoulos and A. Lingas"
+, title =       "Supplement: {An} {$\Omega(p \log k)$} lower bound on the length of convex partitions of polygons"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
 }
 
 @article{ll-tapga-92
-, author =	"C. Levcopoulos and A. Lingas"
-, title =	"There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"251--256"
-, update =	"95.01 mitchell"
+, author =      "C. Levcopoulos and A. Lingas"
+, title =       "There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "251--256"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{ll-tapga-89
-, author =	"C. Levcopoulos and A. Lingas"
-, title =	"There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees"
-, booktitle =	"Proc. International Symposium on Optimal Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	401
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"9--13"
-, update =	"96.05 smid"
+, author =      "C. Levcopoulos and A. Lingas"
+, title =       "There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees"
+, booktitle =   "Proc. International Symposium on Optimal Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      401
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "9--13"
+, update =      "96.05 smid"
 }
 
 @techreport{lls-amlpp-87t
-, author =	"C. Levcopoulos and A. Lingas and J.-R. Sack"
-, title =	"Algorithms for minimum length partitions of polygons"
-, type =	"Report"
-, number =	"SCS-TR-119"
-, institution =	"School Comput. Sci., Carleton Univ."
-, address =	"Ottawa, ON"
-, year =	1987
-, keywords =	"design of algorithms, decomposition, triangulations, partition, dynamic programming, length, two-dimensional, convex, polygons"
-, precedes =	"lls-amlpp-87a"
+, author =      "C. Levcopoulos and A. Lingas and J.-R. Sack"
+, title =       "Algorithms for minimum length partitions of polygons"
+, type =        "Report"
+, number =      "SCS-TR-119"
+, institution = "School Comput. Sci., Carleton Univ."
+, address =     "Ottawa, ON"
+, year =        1987
+, keywords =    "design of algorithms, decomposition, triangulations, partition, dynamic programming, length, two-dimensional, convex, polygons"
+, precedes =    "lls-amlpp-87a"
 }
 
 @article{lls-hobst-89
-, author =	"Christos Levcopoulos and Andrzej Lingas and Jorg-R. Sack"
-, title =	"Heuristics For Optimum Binary Search Trees And Minimum Weight Triangulation Problems"
-, journal =	"Theoret. Comput. Sci."
-, volume =	66
-, number =	2
-, month =	aug
-, year =	1989
-, pages =	"181--203"
-, keywords =	"optimum binary search trees, minimum weight triangulation, amortization argument"
-, annote =	"Amortized linear algorithm for GT of semi-circular
-		 polygons."
-, abstract =	"We establish new bounds on the problem of constructing
-		 optimum binary search trees with zero-key access
-		 probabilities (with applications e.g. to point location
-		 problems). We present a linear-time heuristic for
-		 constructing such trees so that their cost is within a
-		 factor of 1 plus epsilon from the optimum cost, where
-		 epsilon is an arbitrary positive constant. Furthermore,
-		 by using an interesting amortization argument, we give
-		 a simple and practical, linear-time implementation of a
-		 known greedy heuristics for such trees. The above
-		 results are obtained in a more general setting, namely,
-		 in the context of minimum length triangulations of so-
-		 called semi-circular polygons. They are carried over to
-		 binary search trees by proving a duality between
-		 optimum (m minus 1)-way search trees and minimum weight
-		 partitions of infinitely-flat semi-circular polygons
-		 into m- gons. With this duality we can also obtain
-		 better heuristics for minimum length partitions of
-		 polygons by using known algorithms for optimum search
-		 trees. (Author abstract) 14 Refs."
+, author =      "Christos Levcopoulos and Andrzej Lingas and Jorg-R. Sack"
+, title =       "Heuristics For Optimum Binary Search Trees And Minimum Weight Triangulation Problems"
+, journal =     "Theoret. Comput. Sci."
+, volume =      66
+, number =      2
+, month =       aug
+, year =        1989
+, pages =       "181--203"
+, keywords =    "optimum binary search trees, minimum weight triangulation, amortization argument"
+, annote =      "Amortized linear algorithm for GT of semi-circular
+                 polygons."
+, abstract =    "We establish new bounds on the problem of constructing
+                 optimum binary search trees with zero-key access
+                 probabilities (with applications e.g. to point location
+                 problems). We present a linear-time heuristic for
+                 constructing such trees so that their cost is within a
+                 factor of 1 plus epsilon from the optimum cost, where
+                 epsilon is an arbitrary positive constant. Furthermore,
+                 by using an interesting amortization argument, we give
+                 a simple and practical, linear-time implementation of a
+                 known greedy heuristics for such trees. The above
+                 results are obtained in a more general setting, namely,
+                 in the context of minimum length triangulations of so-
+                 called semi-circular polygons. They are carried over to
+                 binary search trees by proving a duality between
+                 optimum (m minus 1)-way search trees and minimum weight
+                 partitions of infinitely-flat semi-circular polygons
+                 into m- gons. With this duality we can also obtain
+                 better heuristics for minimum length partitions of
+                 polygons by using known algorithms for optimum search
+                 trees. (Author abstract) 14 Refs."
 }
 
 @inproceedings{lls-nohbs-87
-, author =	"C. Levcopoulos and A. Lingas and J.-R. Sack"
-, title =	"Nearly optimal heuristics for binary search trees with geometric generalizations"
-, booktitle =	"Proc. 14th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	267
-, publisher =	"Springer-Verlag"
-, year =	1987
-, pages =	"376--385"
-, keywords =	"decomposition, partition, polygons, two-dimensional"
+, author =      "C. Levcopoulos and A. Lingas and J.-R. Sack"
+, title =       "Nearly optimal heuristics for binary search trees with geometric generalizations"
+, booktitle =   "Proc. 14th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      267
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "376--385"
+, keywords =    "decomposition, partition, polygons, two-dimensional"
 }
 
 @incollection{llw-pcpt-95
-, author =	"C. Levcopoulos and A. Lingas and C. Wang"
-, title =	"On parallel complexity of planar triangulations"
-, booktitle =	"Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1026
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"413--427"
-, update =	"96.01 smid"
+, author =      "C. Levcopoulos and A. Lingas and C. Wang"
+, title =       "On parallel complexity of planar triangulations"
+, booktitle =   "Proc. 15th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1026
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "413--427"
+, update =      "96.01 smid"
 }
 
 @techreport{lns-eacft-97
-, author =	"C. Levcopoulos and G. Narasimhan and M. Smid"
-, title =	"Efficient algorithms for constructing fault-tolerant geometric spanners"
-, type =	"Report"
-, number =	16
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1997
-, update =	"98.03 smid"
+, author =      "C. Levcopoulos and G. Narasimhan and M. Smid"
+, title =       "Efficient algorithms for constructing fault-tolerant geometric spanners"
+, type =        "Report"
+, number =      16
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1997
+, update =      "98.03 smid"
 }
 
 @inproceedings{lns-eacft-98
-, author =	"C. Levcopoulos and G. Narasimhan and M. Smid"
-, title =	"Efficient algorithms for constructing fault-tolerant geometric spanners"
-, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC 98"
-, year =	1998
-, pages =	"186--195"
-, update =	"98.07 smid, 98.03 mitchell"
+, author =      "C. Levcopoulos and G. Narasimhan and M. Smid"
+, title =       "Efficient algorithms for constructing fault-tolerant geometric spanners"
+, booktitle =   "Proc. 30th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC 98"
+, year =        1998
+, pages =       "186--195"
+, update =      "98.07 smid, 98.03 mitchell"
 }
 
 @techreport{lns-iacft-99
-, author =	"C. Levcopoulos and G. Narasimhan and M. Smid"
-, title =	"Improved algorithms for constructing fault-tolerant geometric spanners"
-, type =	"Report"
-, number =	15
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1999
-, update =	"99.07 smid"
+, author =      "C. Levcopoulos and G. Narasimhan and M. Smid"
+, title =       "Improved algorithms for constructing fault-tolerant geometric spanners"
+, type =        "Report"
+, number =      15
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1999
+, update =      "99.07 smid"
 }
 
 @article{lns-iacft-02
-, author =	"C. Levcopoulos and G. Narasimhan and M. Smid"
-, title =	"Improved algorithms for constructing fault-tolerant spanners"
-, journal =	"Algorithmica"
-, volume =	32
-, year =	2002
-, pages =	"144--156"
-, update =	"01.11 smid"
+, author =      "C. Levcopoulos and G. Narasimhan and M. Smid"
+, title =       "Improved algorithms for constructing fault-tolerant spanners"
+, journal =     "Algorithmica"
+, volume =      32
+, year =        2002
+, pages =       "144--156"
+, update =      "01.11 smid"
 }
 
 @phdthesis{l-eampr-86
-, author =	"D. Leven"
-, title =	"Efficient algorithms for motion planning of robot systems amidst obstacles"
-, type =	"Ph.{D}. Thesis"
-, school =	"Tel-Aviv Univ."
-, address =	"Tel-Aviv, Israel"
-, year =	1986
-, keywords =	"doctoral thesis"
+, author =      "D. Leven"
+, title =       "Efficient algorithms for motion planning of robot systems amidst obstacles"
+, type =        "Ph.{D}. Thesis"
+, school =      "Tel-Aviv Univ."
+, address =     "Tel-Aviv, Israel"
+, year =        1986
+, keywords =    "doctoral thesis"
 }
 
 @techreport{l-mrsva-84
-, author =	"D. Leven"
-, title =	"Multidimensional reconstruction by set-valued approximations"
-, type =	"Report"
-, number =	"018-84"
-, institution =	"Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
-, address =	"Tel-Aviv, Israel"
-, year =	1984
+, author =      "D. Leven"
+, title =       "Multidimensional reconstruction by set-valued approximations"
+, type =        "Report"
+, number =      "018-84"
+, institution = "Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
+, address =     "Tel-Aviv, Israel"
+, year =        1984
 }
 
 @techreport{ls-esmpa-84
-, author =	"D. Leven and Micha Sharir"
-, title =	"An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers"
-, type =	"Technical {Report}"
-, number =	"84-014"
-, institution =	"Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
-, address =	"Tel-Aviv, Israel"
-, month =	nov
-, year =	1984
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "D. Leven and Micha Sharir"
+, title =       "An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers"
+, type =        "Technical {Report}"
+, number =      "84-014"
+, institution = "Eskenasy Inst. Comput. Sci., Tel-Aviv Univ."
+, address =     "Tel-Aviv, Israel"
+, month =       nov
+, year =        1984
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{ls-esmpa-85
-, author =	"D. Leven and Micha Sharir"
-, title =	"An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"221--227"
-, keywords =	"motion planning, two-dimensional"
-, precedes =	"ls-esmpa-87"
-, cites =	"ls-esmpa-84, ss-pmp1c-83, ss-pmp2g-83, ss-pmp3c-83, osy-gvdl1-84, osy-gvdl2-84, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "D. Leven and Micha Sharir"
+, title =       "An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "221--227"
+, keywords =    "motion planning, two-dimensional"
+, precedes =    "ls-esmpa-87"
+, cites =       "ls-esmpa-84, ss-pmp1c-83, ss-pmp2g-83, ss-pmp3c-83, osy-gvdl1-84, osy-gvdl2-84, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{ls-esmpa-87
-, author =	"D. Leven and Micha Sharir"
-, title =	"An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers"
-, journal =	"J. Algorithms"
-, volume =	8
-, year =	1987
-, pages =	"192--215"
-, keywords =	"motion planning, two-dimensional"
-, succeeds =	"ls-esmpa-85"
-, update =	"98.03 mitchell"
+, author =      "D. Leven and Micha Sharir"
+, title =       "An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers"
+, journal =     "J. Algorithms"
+, volume =      8
+, year =        1987
+, pages =       "192--215"
+, keywords =    "motion planning, two-dimensional"
+, succeeds =    "ls-esmpa-85"
+, update =      "98.03 mitchell"
 }
 
 @incollection{ls-ippvd-87
-, author =	"D. Leven and Micha Sharir"
-, title =	"Intersection and proximity problems and {Voronoi} diagrams"
-, editor =	"J. T. Schwartz and C.-K. Yap"
-, booktitle =	"Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
-, publisher =	"Lawrence Erlbaum Associates"
-, address =	"Hillsdale, NJ"
-, year =	1987
-, pages =	"187--228"
-, keywords =	"survey paper, Voronoi diagrams"
-, update =	"98.03 mitchell"
+, author =      "D. Leven and Micha Sharir"
+, title =       "Intersection and proximity problems and {Voronoi} diagrams"
+, editor =      "J. T. Schwartz and C.-K. Yap"
+, booktitle =   "Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
+, publisher =   "Lawrence Erlbaum Associates"
+, address =     "Hillsdale, NJ"
+, year =        1987
+, pages =       "187--228"
+, keywords =    "survey paper, Voronoi diagrams"
+, update =      "98.03 mitchell"
 }
 
 @article{ls-ncfcc-87
-, author =	"D. Leven and Micha Sharir"
-, title =	"On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"255--270"
-, update =	"98.03 mitchell"
+, author =      "D. Leven and Micha Sharir"
+, title =       "On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "255--270"
+, update =      "98.03 mitchell"
 }
 
 @techreport{ls-pptmc-85
-, author =	"D. Leven and M. Sharir"
-, title =	"Planning a purely translational motion for a convex object in two-dimensional space using generalized {Voronoi} diagrams"
-, number =	"34/85"
-, institution =	"Tel Aviv University"
-, month =	jun
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "D. Leven and M. Sharir"
+, title =       "Planning a purely translational motion for a convex object in two-dimensional space using generalized {Voronoi} diagrams"
+, number =      "34/85"
+, institution = "Tel Aviv University"
+, month =       jun
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @article{ls-pptmc-87
-, author =	"D. Leven and Micha Sharir"
-, title =	"Planning a purely translational motion for a convex object in two-dimensional space using generalized {Voronoi} diagrams"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"9--31"
-, keywords =	"motion planning, convex objects, Voronoi diagrams, convex distance functions"
-, update =	"98.03 mitchell"
+, author =      "D. Leven and Micha Sharir"
+, title =       "Planning a purely translational motion for a convex object in two-dimensional space using generalized {Voronoi} diagrams"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "9--31"
+, keywords =    "motion planning, convex objects, Voronoi diagrams, convex distance functions"
+, update =      "98.03 mitchell"
 }
 
 @article{kl-bpss-78
-, author =	"G. A. Kabatjansky ans V. Leven{\v s}te{\v i}n"
-, title =	"Bounds for packings of the sphere and in space"
-, journal =	"Prob. Information Trans."
-, volume =	14
-, year =	1978
-, pages =	"1--17"
-, update =	"98.03 bibrelex"
+, author =      "G. A. Kabatjansky ans V. Leven{\v s}te{\v i}n"
+, title =       "Bounds for packings of the sphere and in space"
+, journal =     "Prob. Information Trans."
+, volume =      14
+, year =        1978
+, pages =       "1--17"
+, update =      "98.03 bibrelex"
 }
 
 @article{l-dtdpe-26
-, author =	"F. Levi"
-, title =	"Die {Teilung} der projektiven {Ebene} durch {Gerade} oder {Pseudogerade}"
-, journal =	"Ber. Math.-Phys. Kl. s{\"a}chs. Akad. Wiss. Leipzig"
-, volume =	78
-, year =	1926
-, pages =	"256--267"
-, update =	"97.11 bibrelex"
+, author =      "F. Levi"
+, title =       "Die {Teilung} der projektiven {Ebene} durch {Gerade} oder {Pseudogerade}"
+, journal =     "Ber. Math.-Phys. Kl. s{\"a}chs. Akad. Wiss. Leipzig"
+, volume =      78
+, year =        1926
+, pages =       "256--267"
+, update =      "97.11 bibrelex"
 }
 
 @article{l-htac-51
-, author =	"F. W. Levi"
-, title =	"On {Helly}'s theorem and the axioms of convexity"
-, journal =	"J. Indian Math. Soc."
-, volume =	15
-, year =	1951
-, pages =	"65--76"
-, update =	"98.07 bibrelex"
+, author =      "F. W. Levi"
+, title =       "On {Helly}'s theorem and the axioms of convexity"
+, journal =     "J. Indian Math. Soc."
+, volume =      15
+, year =        1951
+, pages =       "65--76"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{l-misi-99
-, author =	"David Levin"
-, title =	"Mesh-Independent Surface Interpolation"
-, booktitle =	"4th International Conference on Curves and Surfaces"
-, year =	1999
-, pages =	46
-, note =	"Saint-Malo, France"
-, update =	"00.03 devillers"
+, author =      "David Levin"
+, title =       "Mesh-Independent Surface Interpolation"
+, booktitle =   "4th International Conference on Curves and Surfaces"
+, year =        1999
+, pages =       46
+, note =        "Saint-Malo, France"
+, update =      "00.03 devillers"
 }
 
 @article{l-padps-76
-, author =	"J. Levin"
-, title =	"Algorithm for Drawing Pictures of Solid Objects Composed of Quadratic Surfaces"
-, journal =	"Commun. ACM"
-, volume =	19
-, number =	10
-, month =	oct
-, year =	1976
-, pages =	"555--563"
-, update =	"97.11 bibrelex"
+, author =      "J. Levin"
+, title =       "Algorithm for Drawing Pictures of Solid Objects Composed of Quadratic Surfaces"
+, journal =     "Commun. ACM"
+, volume =      19
+, number =      10
+, month =       oct
+, year =        1976
+, pages =       "555--563"
+, update =      "97.11 bibrelex"
 }
 
 @article{l-mmdiq-79
-, author =	"J. Levin"
-, title =	"Mathematical Models for Determining the Intersections of Quadric Surfaces"
-, journal =	"Comput. Graph. Image Process."
-, volume =	11
-, year =	1979
-, pages =	"73--87"
-, update =	"97.11 bibrelex"
+, author =      "J. Levin"
+, title =       "Mathematical Models for Determining the Intersections of Quadric Surfaces"
+, journal =     "Comput. Graph. Image Process."
+, volume =      11
+, year =        1979
+, pages =       "73--87"
+, update =      "97.11 bibrelex"
 }
 
 @article{l-mmbc-66
-, author =	"C. Levinthal"
-, title =	"Molecular model-building by computer"
-, journal =	"Scientific Amer."
-, volume =	213
-, number =	6
-, month =	jun
-, year =	1966
-, pages =	"42--52"
-, update =	"99.07 orourke, 98.07 bibrelex"
+, author =      "C. Levinthal"
+, title =       "Molecular model-building by computer"
+, journal =     "Scientific Amer."
+, volume =      213
+, number =      6
+, month =       jun
+, year =        1966
+, pages =       "42--52"
+, update =      "99.07 orourke, 98.07 bibrelex"
 }
 
 @article{l-eciul-92
-, author =	"N. Levitt"
-, title =	"The {Euler} characteristic is the unique locally determined numerical homotopy invariant of finite completeness"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"59--67"
+, author =      "N. Levitt"
+, title =       "The {Euler} characteristic is the unique locally determined numerical homotopy invariant of finite completeness"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "59--67"
 }
 
 @article{l-emnmo-90
-, author =	"A. Levy"
-, title =	"Energy-minimizing networks meet only in threes"
-, journal =	"J. Und. Math."
-, volume =	22
-, year =	1990
-, pages =	"53--59"
-, update =	"97.11 bibrelex"
+, author =      "A. Levy"
+, title =       "Energy-minimizing networks meet only in threes"
+, journal =     "J. Und. Math."
+, volume =      22
+, year =        1990
+, pages =       "53--59"
+, update =      "97.11 bibrelex"
 }
 
 @article{lr-tpra-78
-, author =	"B. A. Lewis and J. S. Robinson"
-, title =	"Triangulation of planar regions with applications"
-, journal =	"Comput. J."
-, volume =	21
-, year =	1978
-, pages =	"324--332"
-, keywords =	"point-set triangulation, implementing algorithms"
+, author =      "B. A. Lewis and J. S. Robinson"
+, title =       "Triangulation of planar regions with applications"
+, journal =     "Comput. J."
+, volume =      21
+, year =        1978
+, pages =       "324--332"
+, keywords =    "point-set triangulation, implementing algorithms"
 }
 
 @book{ld-dsta-91
-, author =	"H. R. Lewis and L. Denenberg"
-, title =	"Data Structures and Their Algorithms"
-, publisher =	"Harper Collins"
-, year =	1991
-, update =	"97.03 tamassia"
+, author =      "H. R. Lewis and L. Denenberg"
+, title =       "Data Structures and Their Algorithms"
+, publisher =   "Harper Collins"
+, year =        1991
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{l-vvhc-95
-, author =	"Robert R. Lewis"
-, title =	"{VideHoc}: {A} Visualizer for Homogeneous Coordinates"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C14--C15"
-, keywords =	""
-, cites =	"h-hgc-84, nslab-xpegc-91, s-edpti-88, s-opgfg-91, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Robert R. Lewis"
+, title =       "{VideHoc}: {A} Visualizer for Homogeneous Coordinates"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C14--C15"
+, keywords =    ""
+, cites =       "h-hgc-84, nslab-xpegc-91, s-edpti-88, s-opgfg-91, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{l-tcctc-80
-, author =	"T. Lewis"
-, title =	"Two counterexamples concerning transversals for convex subsets of the plane"
-, journal =	"Geometriae Didacta"
-, volume =	9
-, year =	1980
-, pages =	"461--465"
-, update =	"98.03 bibrelex"
+, author =      "T. Lewis"
+, title =       "Two counterexamples concerning transversals for convex subsets of the plane"
+, journal =     "Geometriae Didacta"
+, volume =      9
+, year =        1980
+, pages =       "461--465"
+, update =      "98.03 bibrelex"
 }
 
 @book{l-rmctf-82
-, author =	"S. Lhuilier"
-, title =	"De relatione mutua capacitatis et terminorum figurarum etc."
-, publisher =	"Versaviae"
-, year =	1782
-, update =	"97.11 bibrelex"
+, author =      "S. Lhuilier"
+, title =       "De relatione mutua capacitatis et terminorum figurarum etc."
+, publisher =   "Versaviae"
+, year =        1782
+, update =      "97.11 bibrelex"
 }
 
 @article{lll-fhtha-85
-, author =	"H. Li and M. A. Lavin and R. J. LeMaster"
-, title =	"Fast {Hough} transform: a hierarchical approach"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	36
-, year =	1985
-, pages =	"139--161"
+, author =      "H. Li and M. A. Lavin and R. J. LeMaster"
+, title =       "Fast {Hough} transform: a hierarchical approach"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      36
+, year =        1985
+, pages =       "139--161"
 }
 
 @inproceedings{ls-pso-94
-, author =	"H. Li and K. C. Sevcik"
-, title =	"Parallel sorting by overpartitioning"
-, booktitle =	"Proc. 6th ACM Sympos. Parallel Algorithms Architect."
-, year =	1994
-, pages =	"46--56"
-, update =	"96.09 orourke"
+, author =      "H. Li and K. C. Sevcik"
+, title =       "Parallel sorting by overpartitioning"
+, booktitle =   "Proc. 6th ACM Sympos. Parallel Algorithms Architect."
+, year =        1994
+, pages =       "46--56"
+, update =      "96.09 orourke"
 }
 
 @article{lc-tdp-90
-, author =	"K. Li and K.-H. Cheng"
-, title =	"On three-dimensional packing"
-, journal =	"SIAM J. Comput."
-, volume =	19
-, year =	1990
-, pages =	"847--867"
+, author =      "K. Li and K.-H. Cheng"
+, title =       "On three-dimensional packing"
+, journal =     "SIAM J. Comput."
+, volume =      19
+, year =        1990
+, pages =       "847--867"
 }
 
 @article{l-rpp-88
-, author =	"Shuo-Yen Robert Li"
-, title =	"Reconstruction of Polygons From Projections"
-, journal =	"Inform. Process. Lett."
-, volume =	28
-, number =	5
-, month =	aug
-, year =	1988
-, pages =	"235--240"
-, keywords =	"probing, x-ray probes"
-, update =	"96.09 romanik"
+, author =      "Shuo-Yen Robert Li"
+, title =       "Reconstruction of Polygons From Projections"
+, journal =     "Inform. Process. Lett."
+, volume =      28
+, number =      5
+, month =       aug
+, year =        1988
+, pages =       "235--240"
+, keywords =    "probing, x-ray probes"
+, update =      "96.09 romanik"
 }
 
 @article{ly-ptic-75
-, author =	"T.-Y. Li and J. A. Yorke"
-, title =	"Period three implies chaos"
-, journal =	"Amer. Math. Monthly"
-, volume =	82
-, year =	1975
-, pages =	"985--992"
-, update =	"01.07 devillers, 98.11 bibrelex"
+, author =      "T.-Y. Li and J. A. Yorke"
+, title =       "Period three implies chaos"
+, journal =     "Amer. Math. Monthly"
+, volume =      82
+, year =        1975
+, pages =       "985--992"
+, update =      "01.07 devillers, 98.11 bibrelex"
 }
 
 @phdthesis{l-canpt-94
-, author =	"Z. Li"
-, title =	"Compaction algorithms for nonconvex polygons and their applications"
-, type =	"Ph.{D}. Thesis"
-, school =	"Harvard University"
-, address =	"Cambridge, MA"
-, year =	1994
-, url =	"ftp://deas-ftp.harvard.edu/techreports/tr-1994.html"
-, keywords =	"doctoral thesis, concave, polygons, layout, packing, optimization, linear programming, physically-based modeling, separation, motion planning, rotation, Minkowski sum, configuration space"
-, comments =	"is also Harvard DAS TechReport number: 15-94"
-, update =	"97.03 daniels"
+, author =      "Z. Li"
+, title =       "Compaction algorithms for nonconvex polygons and their applications"
+, type =        "Ph.{D}. Thesis"
+, school =      "Harvard University"
+, address =     "Cambridge, MA"
+, year =        1994
+, url = "ftp://deas-ftp.harvard.edu/techreports/tr-1994.html"
+, keywords =    "doctoral thesis, concave, polygons, layout, packing, optimization, linear programming, physically-based modeling, separation, motion planning, rotation, Minkowski sum, configuration space"
+, comments =    "is also Harvard DAS TechReport number: 15-94"
+, update =      "97.03 daniels"
 }
 
 @book{lc-nmp-92
-, title =	"Nonholonomic Motion Planning"
-, editor =	"Z. Li and J. F. Canny"
-, publisher =	"Kluwer Academic Pubishers"
-, address =	"Norwell, MA"
-, year =	1992
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, title =       "Nonholonomic Motion Planning"
+, editor =      "Z. Li and J. F. Canny"
+, publisher =   "Kluwer Academic Pubishers"
+, address =     "Norwell, MA"
+, year =        1992
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{lm-cancp-93
-, author =	"Z. Li and V. Milenkovic"
-, title =	"A compaction algorithm for non-convex polygons and its application"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"153--162"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"optimization, CAD, CAM, packing, layout, linear programming, motion planning, separation, configuration space, Minkowski sum"
-, cites =	"aks-oa1dt-90, b-amdsn-89, bb-msbdc-88, c-crmp-87, dhks-isccd-90, grs-kfcg-83, hss-cmpmi-84, kos-cmsrp-91i, l-sisri-84, m-hphc-90, mdl-amm-91, mdl-pcnpc-92, mw-cdrca-88, mfs-2dcmc-87, p-ccmsp-87, pb-cmfm-88, sss-tdczr-86, sp-cppca-92, w-otdcs-85, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex, 97.03 daniels, 93.09 rote"
+, author =      "Z. Li and V. Milenkovic"
+, title =       "A compaction algorithm for non-convex polygons and its application"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "153--162"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "optimization, CAD, CAM, packing, layout, linear programming, motion planning, separation, configuration space, Minkowski sum"
+, cites =       "aks-oa1dt-90, b-amdsn-89, bb-msbdc-88, c-crmp-87, dhks-isccd-90, grs-kfcg-83, hss-cmpmi-84, kos-cmsrp-91i, l-sisri-84, m-hphc-90, mdl-amm-91, mdl-pcnpc-92, mw-cdrca-88, mfs-2dcmc-87, p-ccmsp-87, pb-cmfm-88, sss-tdczr-86, sp-cppca-92, w-otdcs-85, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex, 97.03 daniels, 93.09 rote"
 }
 
 @article{lm-csanp-95
-, author =	"Z. Li and V. Milenkovic"
-, title =	"Compaction and separation algorithms for nonconvex polygons and their applications"
-, journal =	"European J. Oper. Res."
-, volume =	84
-, year =	1995
-, pages =	"539--561"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"layout, packing, placement, linear programming, motion planning, Minkowski sum, configuration space"
-, update =	"97.03 daniels"
+, author =      "Z. Li and V. Milenkovic"
+, title =       "Compaction and separation algorithms for nonconvex polygons and their applications"
+, journal =     "European J. Oper. Res."
+, volume =      84
+, year =        1995
+, pages =       "539--561"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "layout, packing, placement, linear programming, motion planning, Minkowski sum, configuration space"
+, update =      "97.03 daniels"
 }
 
 @inproceedings{lm-cschu-90
-, author =	"Z. Li and V. Milenkovic"
-, title =	"Constructing strongly convex hulls using exact or rounded arithmetic"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"235--243"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation"
-, precedes =	"lm-cschu-92"
-, cites =	"f-smpst-89, g-eadch-72, gss-egbra-89, m-cacau-89, m-dpggt-89, m-vigau-88p, si-cvd10-89, ZZZ"
-, update =	"97.11 bibrelex, 97.03 daniels"
+, author =      "Z. Li and V. Milenkovic"
+, title =       "Constructing strongly convex hulls using exact or rounded arithmetic"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "235--243"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation"
+, precedes =    "lm-cschu-92"
+, cites =       "f-smpst-89, g-eadch-72, gss-egbra-89, m-cacau-89, m-dpggt-89, m-vigau-88p, si-cvd10-89, ZZZ"
+, update =      "97.11 bibrelex, 97.03 daniels"
 }
 
 @article{lm-cschu-92
-, author =	"Z. Li and V. Milenkovic"
-, title =	"Constructing strongly convex hulls using exact or rounded arithmetic"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"345--364"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation"
-, succeeds =	"lm-cschu-90"
-, update =	"97.03 daniels"
+, author =      "Z. Li and V. Milenkovic"
+, title =       "Constructing strongly convex hulls using exact or rounded arithmetic"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "345--364"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation"
+, succeeds =    "lm-cschu-90"
+, update =      "97.03 daniels"
 }
 
 @inproceedings{lm-ccp-93
-, author =	"Z. Li and V. Milenkovic"
-, title =	"The complexity of the compaction problem"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"7--11"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"packing, layout, motion planning, PSPACE"
-, cites =	"cosw-cds-84, hss-cmpmi-84, lm-cancp-93, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 daniels, 93.09 milone+mitchell"
+, author =      "Z. Li and V. Milenkovic"
+, title =       "The complexity of the compaction problem"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "7--11"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "packing, layout, motion planning, PSPACE"
+, cites =       "cosw-cds-84, hss-cmpmi-84, lm-cancp-93, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 97.03 daniels, 93.09 milone+mitchell"
 }
 
 @article{lo-aalgb-92
-, author =	"Z. Li and S. Openshaw"
-, title =	"Algorithms for automated line generalization based on a natural principle of objective generalization"
-, journal =	"Internat. J. Geogr. Inform. Syst."
-, volume =	6
-, year =	1992
-, pages =	"373--389"
-, update =	"96.09 kreveld"
+, author =      "Z. Li and S. Openshaw"
+, title =       "Algorithms for automated line generalization based on a natural principle of objective generalization"
+, journal =     "Internat. J. Geogr. Inform. Syst."
+, volume =      6
+, year =        1992
+, pages =       "373--389"
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{l-c2dcm-91
-, author =	"J. Liang"
-, title =	"On a class of $2$-d compliant motion planning problems"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"70--73"
-, cites =	"c-cfmp-89, lmt-asfms-84, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "J. Liang"
+, title =       "On a class of $2$-d compliant motion planning problems"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "70--73"
+, cites =       "c-cfmp-89, lmt-asfms-84, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{lb-aapc-83
-, author =	"Y.-D. Liang and B. A. Barsky"
-, title =	"An analysis and algorithm for polygon clipping"
-, journal =	"Commun. ACM"
-, volume =	26
-, year =	1983
-, pages =	"868--877"
+, author =      "Y.-D. Liang and B. A. Barsky"
+, title =       "An analysis and algorithm for polygon clipping"
+, journal =     "Commun. ACM"
+, volume =      26
+, year =        1983
+, pages =       "868--877"
 }
 
 @techreport{lhl-mcgpk-93t
-, author =	"B.-C. Liaw and N. Huang and R. Lee"
-, title =	"The minimum cooperative guards problem on $k$-spiral polygons"
-, type =	"Technical Report"
-, institution =	"Department of Computer Science, National Tsing Hua University"
-, year =	1993
-, precedes =	"lhl-mcgpk-93, lhl-mcgpk-93"
-, update =	"98.11 bibrelex"
+, author =      "B.-C. Liaw and N. Huang and R. Lee"
+, title =       "The minimum cooperative guards problem on $k$-spiral polygons"
+, type =        "Technical Report"
+, institution = "Department of Computer Science, National Tsing Hua University"
+, year =        1993
+, precedes =    "lhl-mcgpk-93, lhl-mcgpk-93"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{lhl-mcgpk-93
-, author =	"B.-C. Liaw and N. Huang and R. Lee"
-, title =	"The minimum cooperative guards problem on $k$-spiral polygons"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"97--102"
-, succeeds =	"lhl-mcgpk-93t"
-, cites =	"cn-owr-88, cn-wrsp-91, ghs-citds-91, ik-tgp-91, lhl-mcgpk-93t, ll-ccagp-86, mw-wrmg-91, o-agta-87, s-rrag-92, cnn-ogcmw-91, nw-owrsp-90i, t-pvldp-93, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "B.-C. Liaw and N. Huang and R. Lee"
+, title =       "The minimum cooperative guards problem on $k$-spiral polygons"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "97--102"
+, succeeds =    "lhl-mcgpk-93t"
+, cites =       "cn-owr-88, cn-wrsp-91, ghs-citds-91, ik-tgp-91, lhl-mcgpk-93t, ll-ccagp-86, mw-wrmg-91, o-agta-87, s-rrag-92, cnn-ogcmw-91, nw-owrsp-90i, t-pvldp-93, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{l-pftu-82
-, author =	"D. Lichtenstein"
-, title =	"Planar formulae and their uses"
-, journal =	"SIAM J. Comput."
-, volume =	11
-, number =	2
-, year =	1982
-, pages =	"329--343"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "D. Lichtenstein"
+, title =       "Planar formulae and their uses"
+, journal =     "SIAM J. Comput."
+, volume =      11
+, number =      2
+, year =        1982
+, pages =       "329--343"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{lw-aapsc-77
-, author =	"L. I. Lieberman and M. A. Wesley"
-, title =	"Autopass: an automatic programming system for computer controlled mechanical assembly"
-, journal =	"IBM J. Res. Develop."
-, volume =	21
-, number =	4
-, year =	1977
-, pages =	"321--333"
+, author =      "L. I. Lieberman and M. A. Wesley"
+, title =       "Autopass: an automatic programming system for computer controlled mechanical assembly"
+, journal =     "IBM J. Res. Develop."
+, volume =      21
+, number =      4
+, year =        1977
+, pages =       "321--333"
 }
 
 @techreport{lmmps-dpp-93
-, author =	"Th. M. Liebling and F. Margot and D. Muller and A. Prodon and L. Stauffer"
-, title =	"Disjoint paths in the plane"
-, number =	"RO 930628"
-, institution =	"Ecole Polytechnique Federale de Lausanne"
-, address =	"Lausanne, Suisse"
-, month =	jun
-, year =	1993
-, keywords =	"Disjoint paths, computational geometry, routing, heuristics"
-, update =	"93.09 milone+mitchell"
+, author =      "Th. M. Liebling and F. Margot and D. Muller and A. Prodon and L. Stauffer"
+, title =       "Disjoint paths in the plane"
+, number =      "RO 930628"
+, institution = "Ecole Polytechnique Federale de Lausanne"
+, address =     "Lausanne, Suisse"
+, month =       jun
+, year =        1993
+, keywords =    "Disjoint paths, computational geometry, routing, heuristics"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{l-btgm-90
-, author =	"P. Lienhardt"
-, title =	"Barycentric triangulation of generalized maps"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"129--133"
-, cites =	"l-sndsn-89, l-ndgtm-89, b-rgsdd-89, e-crps-60, j-cegt-70, c-ucplg-75, bs-ftmsb-85, t-gt-84, gs-pmgsc-85, a-atfc-76, m-eat-84, l-ngcse-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. Lienhardt"
+, title =       "Barycentric triangulation of generalized maps"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "129--133"
+, cites =       "l-sndsn-89, l-ndgtm-89, b-rgsdd-89, e-crps-60, j-cegt-70, c-ucplg-75, bs-ftmsb-85, t-gt-84, gs-pmgsc-85, a-atfc-76, m-eat-84, l-ngcse-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{l-ndgcm-94
-, author =	"P. Lienhardt"
-, title =	"N-Dimensional Generalized Combinatorial Maps and Cellular Quasi-Manifolds"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, number =	3
-, year =	1994
-, pages =	"275--324"
-, update =	"96.05 pascucci"
+, author =      "P. Lienhardt"
+, title =       "N-Dimensional Generalized Combinatorial Maps and Cellular Quasi-Manifolds"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, number =      3
+, year =        1994
+, pages =       "275--324"
+, update =      "96.05 pascucci"
 }
 
 @techreport{l-ndgtm-89
-, author =	"P. Lienhardt"
-, title =	"$N$-dimensional generalized topological maps"
-, type =	"Research {Report}"
-, number =	"R89-10"
-, institution =	"D{\'e}partement d'Informatique, Universit{\'e} Louis Pasteur"
-, address =	"Strasbourg, France"
-, month =	dec
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "P. Lienhardt"
+, title =       "$N$-dimensional generalized topological maps"
+, type =        "Research {Report}"
+, number =      "R89-10"
+, institution = "D{\'e}partement d'Informatique, Universit{\'e} Louis Pasteur"
+, address =     "Strasbourg, France"
+, month =       dec
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @techreport{l-ngcse-90
-, author =	"P. Lienhardt"
-, title =	"N-{G}-cartes simplexes et triangulation barycentrique"
-, type =	"Research {Report}"
-, number =	"R90-08"
-, institution =	"D{\'e}partement d'Informatique, Universit{\'e} Louis Pasteur"
-, address =	"Strasbourg, France"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "P. Lienhardt"
+, title =       "N-{G}-cartes simplexes et triangulation barycentrique"
+, type =        "Research {Report}"
+, number =      "R90-08"
+, institution = "D{\'e}partement d'Informatique, Universit{\'e} Louis Pasteur"
+, address =     "Strasbourg, France"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @article{l-tmbrc-91
-, author =	"P. Lienhardt"
-, title =	"Topological models for boundary representation: {A} comparison with $n$-dimensional generalized maps"
-, journal =	"Comput. Aided Design"
-, volume =	23
-, number =	1
-, year =	1991
-, pages =	"59--82"
-, update =	"98.03 agarwal"
+, author =      "P. Lienhardt"
+, title =       "Topological models for boundary representation: {A} comparison with $n$-dimensional generalized maps"
+, journal =     "Comput. Aided Design"
+, volume =      23
+, number =      1
+, year =        1991
+, pages =       "59--82"
+, update =      "98.03 agarwal"
 }
 
 @techreport{ls-ghs-91
-, author =	"A. L. Liestman and T. C. Shermer"
-, title =	"Grid and Hypercube Spanners"
-, type =	"Technical Report"
-, number =	"TR 91-1"
-, institution =	"Simon Fraser University"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "A. L. Liestman and T. C. Shermer"
+, title =       "Grid and Hypercube Spanners"
+, type =        "Technical Report"
+, number =      "TR 91-1"
+, institution = "Simon Fraser University"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @techreport{liz-haspp-93
-, author =	"J. Lim and S. Iyengar and S.-Q. Zheng"
-, title =	"A heuristic approach for shortest path problem with rectilinear obstacles"
-, type =	"Technical {Report}"
-, institution =	"Dept. of Computer Science, Louisiana University"
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "J. Lim and S. Iyengar and S.-Q. Zheng"
+, title =       "A heuristic approach for shortest path problem with rectilinear obstacles"
+, type =        "Technical {Report}"
+, institution = "Dept. of Computer Science, Louisiana University"
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @book{l-pagaa-44
-, author =	"R. A. Liming"
-, title =	"Practical analytical geometry with applications to aircraft"
-, publisher =	"Macmillan"
-, address =	"New York"
-, year =	1944
-, update =	"98.03 bibrelex"
+, author =      "R. A. Liming"
+, title =       "Practical analytical geometry with applications to aircraft"
+, publisher =   "Macmillan"
+, address =     "New York"
+, year =        1944
+, update =      "98.03 bibrelex"
 }
 
 @misc{l-artcn-94
-, author =	"C. Lin"
-, title =	"An application of {Ramsey} theory to the crossing number of posets"
-, year =	1994
-, note =	"Preprint"
-, update =	"98.03 bibrelex"
+, author =      "C. Lin"
+, title =       "An application of {Ramsey} theory to the crossing number of posets"
+, year =        1994
+, note =        "Preprint"
+, update =      "98.03 bibrelex"
 }
 
 @article{l-cnp-94
-, author =	"C. Lin"
-, title =	"The crossing number of posets"
-, journal =	"Order"
-, volume =	11
-, year =	1994
-, pages =	"1--25"
-, update =	"98.03 bibrelex"
+, author =      "C. Lin"
+, title =       "The crossing number of posets"
+, journal =     "Order"
+, volume =      11
+, year =        1994
+, pages =       "1--25"
+, update =      "98.03 bibrelex"
 }
 
 @article{ls-gcmme-97
-, author =	"J. Lin and J. A. Storer"
-, title =	"Geometric Clustering to Minimize the Mean-Square Error"
-, journal =	"Unpublished Manuscript"
-, volume =	"??"
-, year =	1997
-, update =	"98.07 agarwal"
+, author =      "J. Lin and J. A. Storer"
+, title =       "Geometric Clustering to Minimize the Mean-Square Error"
+, journal =     "Unpublished Manuscript"
+, volume =      "??"
+, year =        1997
+, update =      "98.07 agarwal"
 }
 
 @article{lv-aagmp-92
-, author =	"J.-H. Lin and J. S. Vitter"
-, title =	"Approximation Algorithms for Geometric Median Problems"
-, journal =	"Inform. Process. Lett."
-, volume =	44
-, year =	1992
-, pages =	"245--249"
-, update =	"93.09 vengroff"
+, author =      "J.-H. Lin and J. S. Vitter"
+, title =       "Approximation Algorithms for Geometric Median Problems"
+, journal =     "Inform. Process. Lett."
+, volume =      44
+, year =        1992
+, pages =       "245--249"
+, update =      "93.09 vengroff"
 }
 
 @inproceedings{lv-eampc-92
-, author =	"J.-H. Lin and J. S. Vitter"
-, title =	"$\epsilon$-Approximations with Minimum Packing Constraint Violation"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"771--782"
-, update =	"93.09 vengroff"
+, author =      "J.-H. Lin and J. S. Vitter"
+, title =       "$\epsilon$-Approximations with Minimum Packing Constraint Violation"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "771--782"
+, update =      "93.09 vengroff"
 }
 
 @article{ljf-ttish-94
-, author =	"K. I. Lin and H. V. Jagdish and C. Faloutsos"
-, title =	"The {TV}-tree: {A}n index structure for higher dimensional data"
-, journal =	"VLDB Journal"
-, volume =	4
-, year =	1994
-, pages =	"517--542"
-, update =	"97.07 agarwal"
+, author =      "K. I. Lin and H. V. Jagdish and C. Faloutsos"
+, title =       "The {TV}-tree: {A}n index structure for higher dimensional data"
+, journal =     "VLDB Journal"
+, volume =      4
+, year =        1994
+, pages =       "517--542"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{lp-pcilp-92
-, author =	"Y. Lin-Kriz and V. Pan"
-, title =	"On parallel complexity of integer linear programming, {GCD} and the iterated mod function"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"124--137"
+, author =      "Y. Lin-Kriz and V. Pan"
+, title =       "On parallel complexity of integer linear programming, {GCD} and the iterated mod function"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "124--137"
 }
 
 @article{lm-ecdde-97
-, author =	"M. Lin and D. Manocha"
-, title =	"Efficient Contact Determination in Dynamic Environments"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"123--151"
-, update =	"98.07 bibrelex, 97.07 devillers"
+, author =      "M. Lin and D. Manocha"
+, title =       "Efficient Contact Determination in Dynamic Environments"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "123--151"
+, update =      "98.07 bibrelex, 97.07 devillers"
 }
 
 @phdthesis{l-ecdar-93
-, author =	"M. C. Lin"
-, title =	"Efficient Collision Detection for Animation and Robotics"
-, school =	"University of California"
-, address =	"Berkeley, CA"
-, month =	dec
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "M. C. Lin"
+, title =       "Efficient Collision Detection for Animation and Robotics"
+, school =      "University of California"
+, address =     "Berkeley, CA"
+, month =       dec
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{l-efdar-93
-, author =	"M. C. Lin"
-, title =	"Efficient Collision Detection for Animation and Robotics"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Elec. Engin. Comput. Sci., Univ. California"
-, address =	"Berkeley, CA"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"96.05 klosowski"
+, author =      "M. C. Lin"
+, title =       "Efficient Collision Detection for Animation and Robotics"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Elec. Engin. Comput. Sci., Univ. California"
+, address =     "Berkeley, CA"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "96.05 klosowski"
 }
 
 @inproceedings{lc-eaidc-91
-, author =	"M. C. Lin and J. F. Canny"
-, title =	"Efficient Algorithms for Incremental Distance Computation"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, volume =	2
-, year =	1991
-, pages =	"1008--1014"
-, update =	"96.05 klosowski"
+, author =      "M. C. Lin and J. F. Canny"
+, title =       "Efficient Algorithms for Incremental Distance Computation"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, volume =      2
+, year =        1991
+, pages =       "1008--1014"
+, update =      "96.05 klosowski"
 }
 
 @article{lm-fidgm-95
-, author =	"M. C. Lin and D. Manocha"
-, title =	"Fast Interference Detection Between Geometric Models"
-, journal =	"Visual Comput."
-, volume =	11
-, number =	10
-, year =	1995
-, pages =	"542--561"
-, update =	"96.05 held+klosowski"
+, author =      "M. C. Lin and D. Manocha"
+, title =       "Fast Interference Detection Between Geometric Models"
+, journal =     "Visual Comput."
+, volume =      11
+, number =      10
+, year =        1995
+, pages =       "542--561"
+, update =      "96.05 held+klosowski"
 }
 
 @incollection{lm-idbco-93
-, author =	"M. C. Lin and D. Manocha"
-, title =	"Interference Detection Between Curved Objects for Computer Animation"
-, booktitle =	"Models and Techniques in Computer Animation"
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"43--57"
-, update =	"96.05 klosowski"
+, author =      "M. C. Lin and D. Manocha"
+, title =       "Interference Detection Between Curved Objects for Computer Animation"
+, booktitle =   "Models and Techniques in Computer Animation"
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "43--57"
+, update =      "96.05 klosowski"
 }
 
 @inproceedings{lmc-ecdde-94
-, author =	"M. C. Lin and D. Manocha and J. Canny"
-, title =	"Efficient contact determination for dynamic environments"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1994
-, pages =	"602--608"
-, update =	"98.07 bibrelex"
+, author =      "M. C. Lin and D. Manocha and J. Canny"
+, title =       "Efficient contact determination for dynamic environments"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1994
+, pages =       "602--608"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{losz-sema-
-, author =	"R. Lin and S. Olariu and J. L. Schwing and J. Zhang"
-, title =	"Simulating Enhanced Meshes, with Applications"
-, type =	"Technical Report"
-, number =	"TR-91-041"
-, institution =	"Department of Computer Science, Old Dominion University"
-, address =	"Norfolk, Virginia"
-, year =	"??"
-, update =	"98.07 bibrelex"
+, author =      "R. Lin and S. Olariu and J. L. Schwing and J. Zhang"
+, title =       "Simulating Enhanced Meshes, with Applications"
+, type =        "Technical Report"
+, number =      "TR-91-041"
+, institution = "Department of Computer Science, Old Dominion University"
+, address =     "Norfolk, Virginia"
+, year =        "??"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{lc-pvg-94
-, author =	"S.-Y. Lin and C. Chen"
-, title =	"Planar Visibility Graphs"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"30--35"
-, keywords =	"Computational geometry, visibility graphs, planar graphs, visibility problems"
-, cites =	"alp-vgsp-92, o-agta-87, t-tpg-56, o-cgc18-93a, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "S.-Y. Lin and C. Chen"
+, title =       "Planar Visibility Graphs"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "30--35"
+, keywords =    "Computational geometry, visibility graphs, planar graphs, visibility problems"
+, cites =       "alp-vgsp-92, o-agta-87, t-tpg-56, o-cgc18-93a, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{le-idaal-95
-, author =	"T. Lin and P. Eades"
-, title =	"Integration of Declarative and Algorithmic Approaches for Layout Creation"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"376--387"
-, keywords =	"graph drawing, declarative, system, trees"
-, update =	"95.01 tamassia"
+, author =      "T. Lin and P. Eades"
+, title =       "Integration of Declarative and Algorithmic Approaches for Layout Creation"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "376--387"
+, keywords =    "graph drawing, declarative, system, trees"
+, update =      "95.01 tamassia"
 }
 
 @phdthesis{l-aadg-92
-, author =	"X. Lin"
-, title =	"Analysis of Algorithms for Drawing Graphs"
-, school =	"Department of Computer Science, University of Queensland"
-, year =	1992
-, keywords =	"doctoral thesis, graph drawing"
-, update =	"93.09 tamassia"
+, author =      "X. Lin"
+, title =       "Analysis of Algorithms for Drawing Graphs"
+, school =      "Department of Computer Science, University of Queensland"
+, year =        1992
+, keywords =    "doctoral thesis, graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{le-ardhp-97
-, author =	"Xuemin Lin and Peter Eades"
-, title =	"Area Requirements for Drawing Hierarchically Planar Graphs"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"219--229"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Xuemin Lin and Peter Eades"
+, title =       "Area Requirements for Drawing Hierarchically Planar Graphs"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "219--229"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @techreport{ls-cavg-92
-, author =	"Y. Lin and Steven S. Skiena"
-, title =	"Complexity aspects of visibility graphs"
-, type =	"Technical {Report}"
-, number =	"92/08"
-, institution =	"SUNY Stony Brook"
-, year =	1992
-, keywords =	"visibility graphs, polygons, area requirements, outerplanar graphs, isomorphism, independent sets"
-, precedes =	"ls-cavg-95"
-, update =	"98.03 mitchell, 96.09 devillers, 93.09 milone+mitchell"
+, author =      "Y. Lin and Steven S. Skiena"
+, title =       "Complexity aspects of visibility graphs"
+, type =        "Technical {Report}"
+, number =      "92/08"
+, institution = "SUNY Stony Brook"
+, year =        1992
+, keywords =    "visibility graphs, polygons, area requirements, outerplanar graphs, isomorphism, independent sets"
+, precedes =    "ls-cavg-95"
+, update =      "98.03 mitchell, 96.09 devillers, 93.09 milone+mitchell"
 }
 
 @article{ls-cavg-95
-, author =	"Y. Lin and Steven S. Skiena"
-, title =	"Complexity aspects of visibility graphs"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"289--312"
-, keywords =	"graph drawing, visibility graphs, polygons, area requirements, outerplanar graphs, isomorphism, independent sets"
-, succeeds =	"ls-cavg-92"
-, update =	"98.03 mitchell, 96.09 devillers"
+, author =      "Y. Lin and Steven S. Skiena"
+, title =       "Complexity aspects of visibility graphs"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "289--312"
+, keywords =    "graph drawing, visibility graphs, polygons, area requirements, outerplanar graphs, isomorphism, independent sets"
+, succeeds =    "ls-cavg-92"
+, update =      "98.03 mitchell, 96.09 devillers"
 }
 
 @article{lbg-avqd-80
-, author =	"Y. Linde and A. Buzo and R. M. Gray"
-, title =	"An algorithm for vector quantiser design"
-, journal =	"IEEE Transactions on Communications"
-, volume =	"COM-28"
-, year =	1980
-, pages =	"84--95"
-, update =	"98.07 agarwal"
+, author =      "Y. Linde and A. Buzo and R. M. Gray"
+, title =       "An algorithm for vector quantiser design"
+, journal =     "IEEE Transactions on Communications"
+, volume =      "COM-28"
+, year =        1980
+, pages =       "84--95"
+, update =      "98.07 agarwal"
 }
 
 @unpublished{lb-rpdcd-
-, author =	"M. Lindenbaum and A. Bruckstein"
-, title =	"On recursive {$o(n)$} partition of a digital curve into digital straight segments"
-, note =	"to appear in IEEE Trans. on Pattern Analysis and Machine Intelligence(PAMI)"
-, update =	"98.11 bibrelex"
+, author =      "M. Lindenbaum and A. Bruckstein"
+, title =       "On recursive {$o(n)$} partition of a digital curve into digital straight segments"
+, note =        "to appear in IEEE Trans. on Pattern Analysis and Machine Intelligence(PAMI)"
+, update =      "98.11 bibrelex"
 }
 
 @article{lb-bapcs-94
-, author =	"M. Lindenbaum and A. M. Bruckstein"
-, title =	"Blind Approximation of Planar Convex Sets"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	10
-, number =	4
-, month =	aug
-, year =	1994
-, pages =	"517--529"
-, keywords =	"probing, line probes, approximation"
-, update =	"96.09 romanik"
+, author =      "M. Lindenbaum and A. M. Bruckstein"
+, title =       "Blind Approximation of Planar Convex Sets"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      10
+, number =      4
+, month =       aug
+, year =        1994
+, pages =       "517--529"
+, keywords =    "probing, line probes, approximation"
+, update =      "96.09 romanik"
 }
 
 @article{lb-doslv-88
-, author =	"M. Lindenbaum and A. M. Bruckstein"
-, title =	"Determining object shape from local velocity measurements"
-, journal =	"Pattern Recogn."
-, volume =	21
-, number =	6
-, year =	1988
-, pages =	"591--606"
-, update =	"93.09 milone+mitchell"
+, author =      "M. Lindenbaum and A. M. Bruckstein"
+, title =       "Determining object shape from local velocity measurements"
+, journal =     "Pattern Recogn."
+, volume =      21
+, number =      6
+, year =        1988
+, pages =       "591--606"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{lb-psgp-92
-, author =	"M. Lindenbaum and A. M. Bruckstein"
-, title =	"Parallel Strategies for Geometric Probing"
-, journal =	"J. Algorithms"
-, volume =	13
-, year =	1992
-, pages =	"320--349"
-, keywords =	"probing, composite probes, parallel"
-, update =	"96.09 romanik"
+, author =      "M. Lindenbaum and A. M. Bruckstein"
+, title =       "Parallel Strategies for Geometric Probing"
+, journal =     "J. Algorithms"
+, volume =      13
+, year =        1992
+, pages =       "320--349"
+, keywords =    "probing, composite probes, parallel"
+, update =      "96.09 romanik"
 }
 
 @article{lb-rpscu-91
-, author =	"M. Lindenbaum and A. M. Bruckstein"
-, title =	"Reconstruction of Polygonal Sets by Constrained and Unconstrained Double Probing"
-, journal =	"Ann. Math. Artif. Intell."
-, volume =	4
-, year =	1991
-, pages =	"345--362"
-, keywords =	"probing, line probes"
-, update =	"96.09 romanik"
+, author =      "M. Lindenbaum and A. M. Bruckstein"
+, title =       "Reconstruction of Polygonal Sets by Constrained and Unconstrained Double Probing"
+, journal =     "Ann. Math. Artif. Intell."
+, volume =      4
+, year =        1991
+, pages =       "345--362"
+, keywords =    "probing, line probes"
+, update =      "96.09 romanik"
 }
 
 @inproceedings{ls-pahgd-90
-, author =	"M. Lindenbaum and H. Samet"
-, title =	"A probabilistic analysis of hierarchical geometric data structures"
-, booktitle =	"Proceedings of the Tenth International Conference on Pattern Recognition"
-, site =	"Atlantic City, NJ"
-, volume =	"II"
-, month =	jun
-, year =	1990
-, pages =	"91--96"
-, update =	"96.05 efrat"
+, author =      "M. Lindenbaum and H. Samet"
+, title =       "A probabilistic analysis of hierarchical geometric data structures"
+, booktitle =   "Proceedings of the Tenth International Conference on Pattern Recognition"
+, site =        "Atlantic City, NJ"
+, volume =      "II"
+, month =       jun
+, year =        1990
+, pages =       "91--96"
+, update =      "96.05 efrat"
 }
 
 @techreport{ls-patbs-95
-, author =	"M. Lindenbaum and H. Samet"
-, title =	"A probabilistic analysis of trie-based sorting of large collections of line segments"
-, type =	"Center for Automation Research"
-, number =	"CAR-TR-766"
-, institution =	"University of Maryland"
-, month =	apr
-, year =	1995
-, update =	"01.07 devillers, 96.05 efrat"
+, author =      "M. Lindenbaum and H. Samet"
+, title =       "A probabilistic analysis of trie-based sorting of large collections of line segments"
+, type =        "Center for Automation Research"
+, number =      "CAR-TR-766"
+, institution = "University of Maryland"
+, month =       apr
+, year =        1995
+, update =      "01.07 devillers, 96.05 efrat"
 }
 
 @article{l-atmgs-83
-, author =	"P. A. Lindholm"
-, title =	"Automatic Triangle Mesh Generation on Surfaces of Polyhedra"
-, journal =	"IEEE Trans. Magn."
-, volume =	"MAG19"
-, number =	6
-, year =	1983
-, pages =	"2539--2542"
-, update =	"94.09 lambert"
-, annote =	"Defines ``quality'' of two triangles as $(r/R)_{-1}$.
-		 Used to triangulate strip along boundary. For interior
-		 $(r/R)_\infty$ is used (sort of)."
+, author =      "P. A. Lindholm"
+, title =       "Automatic Triangle Mesh Generation on Surfaces of Polyhedra"
+, journal =     "IEEE Trans. Magn."
+, volume =      "MAG19"
+, number =      6
+, year =        1983
+, pages =       "2539--2542"
+, update =      "94.09 lambert"
+, annote =      "Defines ``quality'' of two triangles as $(r/R)_{-1}$.
+                 Used to triangulate strip along boundary. For interior
+                 $(r/R)_\infty$ is used (sort of)."
 }
 
 @book{ly-jvms-97
-, author =	"T. Lindholm and F. Yellin"
-, title =	"The {J}ava Virtual Machine Specification"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1997
-, update =	"98.07 tamassia"
+, author =      "T. Lindholm and F. Yellin"
+, title =       "The {J}ava Virtual Machine Specification"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1997
+, update =      "98.07 tamassia"
 }
 
 @article{l-ltcrn-94
-, author =	"A. Lingas"
-, title =	"A Linear-Time Construction of the Relative Neighborhood Graph from the {Delaunay} triangulation"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"199--208"
-, update =	"98.07 mitchell, 96.09 devillers"
+, author =      "A. Lingas"
+, title =       "A Linear-Time Construction of the Relative Neighborhood Graph from the {Delaunay} triangulation"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "199--208"
+, update =      "98.07 mitchell, 96.09 devillers"
 }
 
 @inproceedings{l-lthmw-85
-, author =	"A. Lingas"
-, title =	"A linear-time heuristic for minimum weight triangulation of convex polygons"
-, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
-, year =	1985
-, keywords =	"design of algorithms, approximation, length, triangulations, polygons, convex"
+, author =      "A. Lingas"
+, title =       "A linear-time heuristic for minimum weight triangulation of convex polygons"
+, booktitle =   "Proc. 23rd Allerton Conf. Commun. Control Comput."
+, year =        1985
+, keywords =    "design of algorithms, approximation, length, triangulations, polygons, convex"
 }
 
 @article{l-nhmwt-87
-, author =	"A. Lingas"
-, title =	"A new heuristic for minimum weight triangulation"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	8
-, number =	4
-, year =	1987
-, pages =	"646--658"
-, keywords =	"design of algorithms, approximation, length, triangulations, minimum spanning trees, points, geometric graphs"
+, author =      "A. Lingas"
+, title =       "A new heuristic for minimum weight triangulation"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      8
+, number =      4
+, year =        1987
+, pages =       "646--658"
+, keywords =    "design of algorithms, approximation, length, triangulations, minimum spanning trees, points, geometric graphs"
 }
 
 @inproceedings{l-seagt-87
-, author =	"A. Lingas"
-, title =	"A space efficient algorithm for the greedy triangulation"
-, booktitle =	"Proc. 13th IFIP Conf. System Modelling and Optimization"
-, site =	"Tokyo, Japan"
-, year =	1987
-, pages =	"??"
-, keywords =	"implementing algorithms, approximation, length, triangulations, Delaunay triangulations, Voronoi diagrams, points, geometric graphs"
-, precedes =	"l-seagt-87a"
-, update =	"98.11 bibrelex"
+, author =      "A. Lingas"
+, title =       "A space efficient algorithm for the greedy triangulation"
+, booktitle =   "Proc. 13th IFIP Conf. System Modelling and Optimization"
+, site =        "Tokyo, Japan"
+, year =        1987
+, pages =       "??"
+, keywords =    "implementing algorithms, approximation, length, triangulations, Delaunay triangulations, Voronoi diagrams, points, geometric graphs"
+, precedes =    "l-seagt-87a"
+, update =      "98.11 bibrelex"
 }
 
 @article{l-seagt-87a
-, author =	"A. Lingas"
-, title =	"A space efficient algorithm for the greedy triangulation"
-, journal =	"Lecture Notes in Control and Information  Sci."
-, volume =	113
-, year =	1987
-, pages =	"359--364"
-, succeeds =	"l-seagt-87"
-, update =	"98.11 bibrelex"
+, author =      "A. Lingas"
+, title =       "A space efficient algorithm for the greedy triangulation"
+, journal =     "Lecture Notes in Control and Information  Sci."
+, volume =      113
+, year =        1987
+, pages =       "359--364"
+, succeeds =    "l-seagt-87"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{l-amwt-83
-, author =	"A. Lingas"
-, title =	"Advances in minimum-weight triangulation"
-, type =	"Link{\"o}ping {Studies} in {Sci}. {Technical} {Dissertations}"
-, number =	97
-, institution =	"Link{\"o}ping Univ."
-, address =	"Link{\"o}ping, Sweden"
-, year =	1983
-, keywords =	"design of algorithms, approximation, NP-completeness, length, triangulations, minimum spanning trees, points, polygons"
+, author =      "A. Lingas"
+, title =       "Advances in minimum-weight triangulation"
+, type =        "Link{\"o}ping {Studies} in {Sci}. {Technical} {Dissertations}"
+, number =      97
+, institution = "Link{\"o}ping Univ."
+, address =     "Link{\"o}ping, Sweden"
+, year =        1983
+, keywords =    "design of algorithms, approximation, NP-completeness, length, triangulations, minimum spanning trees, points, polygons"
 }
 
 @techreport{l-avdbe-85
-, author =	"A. Lingas"
-, title =	"Applications of {Voronoi} diagrams with barriers to efficient implementations of greedy triangulations"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Inform. Sci., Link{\"o}ping Univ."
-, address =	"Link{\"o}ping, Sweden"
-, year =	1985
+, author =      "A. Lingas"
+, title =       "Applications of {Voronoi} diagrams with barriers to efficient implementations of greedy triangulations"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Inform. Sci., Link{\"o}ping Univ."
+, address =     "Link{\"o}ping, Sweden"
+, year =        1985
 }
 
 @inproceedings{l-fabvd-90
-, author =	"A. Lingas"
-, title =	"Fast algorithms for bounded {Voronoi} diagrams of restricted polygons"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"204--208"
-, cites =	"a-rtcg-89, agss-ltacv-87, c-tpca-82, e-acg-87, ll-gdtpg-86, ll-fagt-90, l-pp-85, l-vdbsd-89, ps-cgi-85, tv-otats-88, ws-oacdt-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "A. Lingas"
+, title =       "Fast algorithms for bounded {Voronoi} diagrams of restricted polygons"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "204--208"
+, cites =       "a-rtcg-89, agss-ltacv-87, c-tpca-82, e-acg-87, ll-gdtpg-86, ll-fagt-90, l-pp-85, l-vdbsd-89, ps-cgi-85, tv-otats-88, ws-oacdt-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{l-gtcbe-89
-, author =	"Andrzej Lingas"
-, title =	"Greedy triangulation can be efficiently implemented in the average case"
-, booktitle =	"Graph-Theoretic Concepts in Computer Science. Proceedings."
-, year =	1989
-, update =	"97.03 rote"
-, abstract =	"Let $S$ be a set of $n$ points uniformly distributed
-		 in a unit square. We show that the greedy triangulation
-		 of $S$ can be computed in $O(n \log^{1.5} n)$ expected
-		 time (without bucketing). The best previously known
-		 upper-bound on the expected-time performance of an
-		 algorithm for the greedy triangulation was $O(n^2)$."
+, author =      "Andrzej Lingas"
+, title =       "Greedy triangulation can be efficiently implemented in the average case"
+, booktitle =   "Graph-Theoretic Concepts in Computer Science. Proceedings."
+, year =        1989
+, update =      "97.03 rote"
+, abstract =    "Let $S$ be a set of $n$ points uniformly distributed
+                 in a unit square. We show that the greedy triangulation
+                 of $S$ can be computed in $O(n \log^{1.5} n)$ expected
+                 time (without bucketing). The best previously known
+                 upper-bound on the expected-time performance of an
+                 algorithm for the greedy triangulation was $O(n^2)$."
 }
 
 @inproceedings{l-hmelr-83
-, author =	"A. Lingas"
-, title =	"Heuristics for minimum edge length rectangular partitions of rectilinear figures"
-, booktitle =	"Proc. 6th GI Conf. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	145
-, publisher =	"Springer-Verlag"
-, year =	1983
-, pages =	"199--210"
-, keywords =	"design of algorithms, VLSI design, length, partition, approximation, polygons, geometric graphs, rectangles"
+, author =      "A. Lingas"
+, title =       "Heuristics for minimum edge length rectangular partitions of rectilinear figures"
+, booktitle =   "Proc. 6th GI Conf. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      145
+, publisher =   "Springer-Verlag"
+, year =        1983
+, pages =       "199--210"
+, keywords =    "design of algorithms, VLSI design, length, partition, approximation, polygons, geometric graphs, rectangles"
 }
 
 @inproceedings{l-abigt-86
-, author =	"A. Lingas"
-, title =	"On approximation behavior and implementation of the greedy triangulation for convex planar point sets"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"72--79"
-, keywords =	"implementing algorithms, approximation, length, triangulations, points, polygons, convex"
-, cites =	"g-nrpt-79, k-ndot-80, k-mtpd-80, lp-annpc-78, l-lthmw-85, l-tspp-77, mz-ngndt-79, mz-pmhfa-83, ps-cgi-85, yl-nannp-79, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "A. Lingas"
+, title =       "On approximation behavior and implementation of the greedy triangulation for convex planar point sets"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "72--79"
+, keywords =    "implementing algorithms, approximation, length, triangulations, points, polygons, convex"
+, cites =       "g-nrpt-79, k-ndot-80, k-mtpd-80, lp-annpc-78, l-lthmw-85, l-tspp-77, mz-ngndt-79, mz-pmhfa-83, ps-cgi-85, yl-nannp-79, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{l-pp-85
-, author =	"A. Lingas"
-, title =	"On partitioning polygons"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"288--295"
-, keywords =	"design of algorithms, partition, divide-and-conquer, triangulations, polygons"
-, cites =	"c-tpca-82, d-pppg-82, h-gt-72, hm-ftsp-83, lt-stpg-77, lt-apst-77, m-spgus-84, u-cav-84, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "A. Lingas"
+, title =       "On partitioning polygons"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "288--295"
+, keywords =    "design of algorithms, partition, divide-and-conquer, triangulations, polygons"
+, cites =       "c-tpca-82, d-pppg-82, h-gt-72, hm-ftsp-83, lt-stpg-77, lt-apst-77, m-spgus-84, u-cav-84, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{l-gdtan-86
-, author =	"A. Lingas"
-, title =	"The greedy and {Delaunay} triangulations are not bad in the average case"
-, journal =	"Inform. Process. Lett."
-, volume =	22
-, year =	1986
-, pages =	"25--31"
-, keywords =	"approximation, Delaunay triangulations, triangulations, average-case analysis, points"
-, succeeds =	"l-gdtan-83"
+, author =      "A. Lingas"
+, title =       "The greedy and {Delaunay} triangulations are not bad in the average case"
+, journal =     "Inform. Process. Lett."
+, volume =      22
+, year =        1986
+, pages =       "25--31"
+, keywords =    "approximation, Delaunay triangulations, triangulations, average-case analysis, points"
+, succeeds =    "l-gdtan-83"
 }
 
 @inproceedings{l-gdtan-83
-, author =	"A. Lingas"
-, title =	"The Greedy and {Delaunay} Triangulations are Not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-connected Polygons is {NP}-Complete"
-, booktitle =	"Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1983
-, pages =	"270--284"
-, precedes =	"l-gdtan-86"
-, annote =	"Geometric Triangulation just has to cover all points
-		 with edges."
+, author =      "A. Lingas"
+, title =       "The Greedy and {Delaunay} Triangulations are Not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-connected Polygons is {NP}-Complete"
+, booktitle =   "Proc. 24th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1983
+, pages =       "270--284"
+, precedes =    "l-gdtan-86"
+, annote =      "Geometric Triangulation just has to cover all points
+                 with edges."
 }
 
 @inproceedings{l-pnrh-82
-, author =	"A. Lingas"
-, title =	"The power of non-rectilinear holes"
-, booktitle =	"Proc. 9th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	140
-, publisher =	"Springer-Verlag"
-, year =	1982
-, pages =	"369--383"
-, keywords =	"complexity theory, partition, NP-completeness, polygons, geometric graphs, rectangles"
-, update =	"93.09 rote"
-, annote =	"One of the six NP-hardness results is incorrect,
-		 see sg-mdrpa-92, sg-mdrra-?? for a polynomial solution.
-		 The error is in cases G and H on p. 374, where the
-		 claimed partition is not optimal."
+, author =      "A. Lingas"
+, title =       "The power of non-rectilinear holes"
+, booktitle =   "Proc. 9th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      140
+, publisher =   "Springer-Verlag"
+, year =        1982
+, pages =       "369--383"
+, keywords =    "complexity theory, partition, NP-completeness, polygons, geometric graphs, rectangles"
+, update =      "93.09 rote"
+, annote =      "One of the six NP-hardness results is incorrect,
+                 see sg-mdrpa-92, sg-mdrra-?? for a polynomial solution.
+                 The error is in cases G and H on p. 374, where the
+                 claimed partition is not optimal."
 }
 
 @article{l-vdbsd-89
-, author =	"A. Lingas"
-, title =	"Voronoi diagrams with barriers and the shortest diagonal problem"
-, journal =	"Inform. Process. Lett."
-, volume =	32
-, year =	1989
-, pages =	"191--198"
-, keywords =	"design of algorithms, Delaunay triangulations, Voronoi diagrams, geometric graphs"
+, author =      "A. Lingas"
+, title =       "Voronoi diagrams with barriers and the shortest diagonal problem"
+, journal =     "Inform. Process. Lett."
+, volume =      32
+, year =        1989
+, pages =       "191--198"
+, keywords =    "design of algorithms, Delaunay triangulations, Voronoi diagrams, geometric graphs"
 }
 
 @techreport{lk-ltrab-91
-, author =	"Andrzej Lingas and Rolf Klein"
-, title =	"A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
-, type =	"Manuscript"
-, institution =	"Lund Univ."
-, address =	"Lund, Sweden"
-, year =	1991
-, precedes =	"kl-ltrab-93t"
-, update =	"99.07 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
+, author =      "Andrzej Lingas and Rolf Klein"
+, title =       "A Linear-Time Randomized Algorithm for the Bounded {Voronoi} Diagram of a Simple Polygon"
+, type =        "Manuscript"
+, institution = "Lund Univ."
+, address =     "Lund, Sweden"
+, year =        1991
+, precedes =    "kl-ltrab-93t"
+, update =      "99.07 bibrelex, 98.11 bibrelex, 97.11 bibrelex"
 }
 
 @article{lls-amlpp-87a
-, author =	"A. Lingas and C. Levcopoulos and J.-R. Sack"
-, title =	"Algorithms for minimum length partitions of polygons"
-, journal =	"BIT"
-, volume =	27
-, year =	1987
-, pages =	"474--479"
-, keywords =	"design of algorithms, decomposition, triangulations, partition, dynamic programming, length, two-dimensional, convex, polygons"
-, succeeds =	"lls-amlpp-87t"
+, author =      "A. Lingas and C. Levcopoulos and J.-R. Sack"
+, title =       "Algorithms for minimum length partitions of polygons"
+, journal =     "BIT"
+, volume =      27
+, year =        1987
+, pages =       "474--479"
+, keywords =    "design of algorithms, decomposition, triangulations, partition, dynamic programming, length, two-dimensional, convex, polygons"
+, succeeds =    "lls-amlpp-87t"
 }
 
 @techreport{lms-parld-92
-, author =	"A. Lingas and A. Maheshwari and J.-R. Sack"
-, title =	"Parallel Algorithms for Rectilinear Link Distance Problems"
-, type =	"Technical Report"
-, number =	"SCS-TR-213"
-, institution =	"Carleton University,  School of Computer Science"
-, year =	1992
-, update =	"97.11 sack"
+, author =      "A. Lingas and A. Maheshwari and J.-R. Sack"
+, title =       "Parallel Algorithms for Rectilinear Link Distance Problems"
+, type =        "Technical Report"
+, number =      "SCS-TR-213"
+, institution = "Carleton University,  School of Computer Science"
+, year =        1992
+, update =      "97.11 sack"
 }
 
 @inproceedings{lms-parld-93
-, author =	"Andrzej Lingas and Anil Maheshwari and Jorg-Rudiger Sack"
-, title =	"Parallel Algorithms for Rectilinear Link Distance Problems"
-, booktitle =	"Proc. 7th IEEE Internat. Parallel Process. Sympos."
-, site =	"Newport Beach"
-, publisher =	"IEEE Computer Society"
-, year =	1993
-, pages =	"65--72"
-, precedes =	"lms-parld-95"
-, update =	"98.03 mitchell, 97.11 sack"
+, author =      "Andrzej Lingas and Anil Maheshwari and Jorg-Rudiger Sack"
+, title =       "Parallel Algorithms for Rectilinear Link Distance Problems"
+, booktitle =   "Proc. 7th IEEE Internat. Parallel Process. Sympos."
+, site =        "Newport Beach"
+, publisher =   "IEEE Computer Society"
+, year =        1993
+, pages =       "65--72"
+, precedes =    "lms-parld-95"
+, update =      "98.03 mitchell, 97.11 sack"
 }
 
 @article{lms-parld-95
-, author =	"Andrzej Lingas and Anil Maheshwari and J{\"o}rg-R{\"u}diger Sack"
-, title =	"Parallel Algorithms for Rectilinear Link Distance Problems"
-, journal =	"Algorithmica"
-, volume =	14
-, year =	1995
-, pages =	"261--289"
-, keywords =	"link distance, parallel algorithms, rectilinear paths"
-, succeeds =	"lms-parld-93"
-, update =	"98.07 bibrelex+devillers, 98.03 mitchell, 97.11 sack"
-, abstract =	"
+, author =      "Andrzej Lingas and Anil Maheshwari and J{\"o}rg-R{\"u}diger Sack"
+, title =       "Parallel Algorithms for Rectilinear Link Distance Problems"
+, journal =     "Algorithmica"
+, volume =      14
+, year =        1995
+, pages =       "261--289"
+, keywords =    "link distance, parallel algorithms, rectilinear paths"
+, succeeds =    "lms-parld-93"
+, update =      "98.07 bibrelex+devillers, 98.03 mitchell, 97.11 sack"
+, abstract =    "
 We provide optimal parallel solutions to several link distance
 problems set in trapezoided rectilinear polygons. All our main
 parallel algorithms are deterministic and designed to run on the
@@ -97153,461 +97153,461 @@ @article{lms-parld-95
 }
 
 @inproceedings{lm-ltcrn-95
-, author =	"Andrzej Lingas and Asish Mukhopadhyay"
-, title =	"A Linear-Time Construction of the Relative Neighborhood Graph within a Histogram"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"228--238"
-, update =	"99.07 bibrelex, 98.07 mitchell, 96.01 smid, 95.05 mitchell"
+, author =      "Andrzej Lingas and Asish Mukhopadhyay"
+, title =       "A Linear-Time Construction of the Relative Neighborhood Graph within a Histogram"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "228--238"
+, update =      "99.07 bibrelex, 98.07 mitchell, 96.01 smid, 95.05 mitchell"
 }
 
 @inproceedings{lprs-melpr-82
-, author =	"A. Lingas and R. Pinter and R. Rivest and A. Shamir"
-, title =	"Minimum edge length partitioning of rectilinear polygons"
-, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
-, year =	1982
-, pages =	"53--63"
-, keywords =	"design of algorithms, VLSI design, partition, length, dynamic programming, NP-completeness, polygons, geometric graphs, rectangles"
+, author =      "A. Lingas and R. Pinter and R. Rivest and A. Shamir"
+, title =       "Minimum edge length partitioning of rectilinear polygons"
+, booktitle =   "Proc. 20th Allerton Conf. Commun. Control Comput."
+, year =        1982
+, pages =       "53--63"
+, keywords =    "design of algorithms, VLSI design, partition, length, dynamic programming, NP-completeness, polygons, geometric graphs, rectangles"
 }
 
 @unpublished{lprs-meldr-
-, author =	"A. Lingas and R. Y. Pinter and R. L. Rivest and A. Shamir"
-, title =	"Minimum edge length decomposition of rectilinear polygons"
-, note =	"Unpublished Manuscript"
-, update =	"97.11 bibrelex"
+, author =      "A. Lingas and R. Y. Pinter and R. L. Rivest and A. Shamir"
+, title =       "Minimum edge length decomposition of rectilinear polygons"
+, note =        "Unpublished Manuscript"
+, update =      "97.11 bibrelex"
 }
 
 @article{l-qppt-90
-, author =	"J. Linhart"
-, title =	"A Quick Point-in-Polyhedron Test"
-, journal =	"Comput. Graph. (UK)"
-, volume =	14
-, number =	"3--4"
-, year =	1990
-, pages =	"445--447"
-, update =	"96.09 held"
+, author =      "J. Linhart"
+, title =       "A Quick Point-in-Polyhedron Test"
+, journal =     "Comput. Graph. (UK)"
+, volume =      14
+, number =      "3--4"
+, year =        1990
+, pages =       "445--447"
+, update =      "96.09 held"
 }
 
 @inproceedings{llsz-ecshs-93
-, author =	"N. Linial and M. Luby and M. Saks and D. Zuckerman"
-, title =	"Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"??"
-, update =	"94.05 devillers"
+, author =      "N. Linial and M. Luby and M. Saks and D. Zuckerman"
+, title =       "Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "??"
+, update =      "94.05 devillers"
 }
 
 @inproceedings{lmr-rlvcd-88
-, author =	"N. Linial and Y. Mansour and R. L. Rivest"
-, title =	"Results on learnability and the {Vapnik}-{Chervonekis} dimension"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"120--129"
-, precedes =	"lmr-rlvcd-91"
+, author =      "N. Linial and Y. Mansour and R. L. Rivest"
+, title =       "Results on learnability and the {Vapnik}-{Chervonekis} dimension"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "120--129"
+, precedes =    "lmr-rlvcd-91"
 }
 
 @article{lmr-rlvcd-91
-, author =	"N. Linial and Y. Mansour and R. L. Rivest"
-, title =	"Results on learnability and the {Vapnik}-{Chervonekis} dimension"
-, journal =	"Inform. Comput."
-, volume =	90
-, year =	1991
-, pages =	"33--49"
-, succeeds =	"lmr-rlvcd-88"
+, author =      "N. Linial and Y. Mansour and R. L. Rivest"
+, title =       "Results on learnability and the {Vapnik}-{Chervonekis} dimension"
+, journal =     "Inform. Comput."
+, volume =      90
+, year =        1991
+, pages =       "33--49"
+, succeeds =    "lmr-rlvcd-88"
 }
 
 @inproceedings{ls-dgrsd-91
-, author =	"Nathan Linial and Michael Saks"
-, title =	"Decomposing Graphs Into Regions of Small Diameter"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Nathan Linial and Michael Saks"
+, title =       "Decomposing Graphs Into Regions of Small Diameter"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{ls-neh-96
-, author =	"N. Linial and O. Sasson"
-, title =	"Non-expansive hashing"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '96"
-, year =	1996
-, pages =	"509--517"
-, update =	"98.07 bibrelex, 97.07 agarwal"
+, author =      "N. Linial and O. Sasson"
+, title =       "Non-expansive hashing"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '96"
+, year =        1996
+, pages =       "509--517"
+, update =      "98.07 bibrelex, 97.07 agarwal"
 }
 
 @techreport{l-ldacc-96
-, author =	"G. Liotta"
-, title =	"Low Degree Algorithms for Computing and Checking {Gabriel} Graphs"
-, type =	"Technical Report"
-, number =	"CS-96-28"
-, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
-, year =	1996
-, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-28.ps.Z"
-, keywords =	"graph drawing, proximity, CGC, Brown"
-, update =	"97.03 tamassia"
+, author =      "G. Liotta"
+, title =       "Low Degree Algorithms for Computing and Checking {Gabriel} Graphs"
+, type =        "Technical Report"
+, number =      "CS-96-28"
+, institution = "Center for Geometric Computing, Dept. Computer Science, Brown Univ."
+, year =        1996
+, url = "ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-28.ps.Z"
+, keywords =    "graph drawing, proximity, CGC, Brown"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{ld-cpdt3-95
-, author =	"Giuseppe Liotta and Giuseppe {Di Battista}"
-, title =	"Computing Proximity Drawings of Trees in the 3-Dimensional Space"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"239--250"
-, keywords =	"graph drawing, 3D, proximity"
-, update =	"99.07 bibrelex, 96.09 tamassia, 95.05 mitchell+tamassia"
+, author =      "Giuseppe Liotta and Giuseppe {Di Battista}"
+, title =       "Computing Proximity Drawings of Trees in the 3-Dimensional Space"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "239--250"
+, keywords =    "graph drawing, 3D, proximity"
+, update =      "99.07 bibrelex, 96.09 tamassia, 95.05 mitchell+tamassia"
 }
 
 @techreport{llmw-crig-96
-, author =	"G. Liotta and A. Lubiw and H. Meijer and S. H. Whitesides"
-, title =	"The Rectangle of Influence Drawability Problem"
-, type =	"Technical Report"
-, number =	"CS-96-22"
-, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
-, year =	1996
-, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-22.ps.Z"
-, keywords =	"graph drawing, proximity, CGC, Brown"
-, precedes =	"llmw-crig-98"
-, update =	"98.03 mitchell, 97.03 tamassia"
+, author =      "G. Liotta and A. Lubiw and H. Meijer and S. H. Whitesides"
+, title =       "The Rectangle of Influence Drawability Problem"
+, type =        "Technical Report"
+, number =      "CS-96-22"
+, institution = "Center for Geometric Computing, Dept. Computer Science, Brown Univ."
+, year =        1996
+, url = "ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-22.ps.Z"
+, keywords =    "graph drawing, proximity, CGC, Brown"
+, precedes =    "llmw-crig-98"
+, update =      "98.03 mitchell, 97.03 tamassia"
 }
 
 @article{llmw-crig-98
-, author =	"G. Liotta and A. Lubiw and H. Meijer and S. H. Whitesides"
-, title =	"The Rectangle of Influence Drawability Problem"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, number =	1
-, year =	1998
-, pages =	"1--22"
-, issn =	"0925-7721"
-, succeeds =	"llmw-crig-96"
-, update =	"98.03 mitchell"
+, author =      "G. Liotta and A. Lubiw and H. Meijer and S. H. Whitesides"
+, title =       "The Rectangle of Influence Drawability Problem"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, number =      1
+, year =        1998
+, pages =       "1--22"
+, issn =        "0925-7721"
+, succeeds =    "llmw-crig-96"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{lpt-rpqid-97
-, author =	"Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
-, title =	"Robust Proximity Queries: an Illustration of Degree-Driven Algorithm Design"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"156--165"
-, keywords =	"nearest-neighbor search, point location, arithmetic precision, CGC, Brown"
-, cites =	"b-iha-07, b-ecvdl-96, bkmnsu-egcl-95, bms-dgc-94, c-hsh-85, c-sede-92, d-cgcg-92, dk-fdpi-83, dl-pmtds-89, egs-oplms-86, em-feptd-85, f-smpst-89, fv-eeacg-93, gks-ricdv-92, gs-pmgsc-85, h-pargc-89, kln-edtur-91, k-osps-83, lp-lppsi-77, lpt-rpqid-96, p-nappl-81, ps-cgi-85, pt-eplcs-92, st-pplup-86, si-cvdom-92, tv-ocsfc-96, y-stgd-90, y-tegc-97, ZZZ"
-, update =	"99.11 bibrelex, 98.07 bibrelex, 97.07 efrat, 97.03 tamassia"
+, author =      "Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
+, title =       "Robust Proximity Queries: an Illustration of Degree-Driven Algorithm Design"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "156--165"
+, keywords =    "nearest-neighbor search, point location, arithmetic precision, CGC, Brown"
+, cites =       "b-iha-07, b-ecvdl-96, bkmnsu-egcl-95, bms-dgc-94, c-hsh-85, c-sede-92, d-cgcg-92, dk-fdpi-83, dl-pmtds-89, egs-oplms-86, em-feptd-85, f-smpst-89, fv-eeacg-93, gks-ricdv-92, gs-pmgsc-85, h-pargc-89, kln-edtur-91, k-osps-83, lp-lppsi-77, lpt-rpqid-96, p-nappl-81, ps-cgi-85, pt-eplcs-92, st-pplup-86, si-cvdom-92, tv-ocsfc-96, y-stgd-90, y-tegc-97, ZZZ"
+, update =      "99.11 bibrelex, 98.07 bibrelex, 97.07 efrat, 97.03 tamassia"
 }
 
 @article{lpt-rpqid-98
-, author =	"Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
-, title =	"Robust Proximity Queries: An Illustration of Degree-driven Algorithm Design"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, number =	3
-, year =	1998
-, pages =	"864--889"
-, keywords =	"nearest-neighbor search, point location, arithmetic precision, CGC, Brown"
-, update =	"99.11 smid, 99.07 vismara, 97.03 tamassia"
+, author =      "Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
+, title =       "Robust Proximity Queries: An Illustration of Degree-driven Algorithm Design"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, number =      3
+, year =        1998
+, pages =       "864--889"
+, keywords =    "nearest-neighbor search, point location, arithmetic precision, CGC, Brown"
+, update =      "99.11 smid, 99.07 vismara, 97.03 tamassia"
 }
 
 @techreport{lpt-rpqiv-96
-, author =	"Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
-, title =	"Robust Proximity Queries in Implicit {Voronoi} Diagrams"
-, type =	"Technical Report"
-, number =	"CS-96-16"
-, institution =	"Center for Geometric Computing, Comput. Sci. Dept., Brown Univ."
-, address =	"Providence, RI"
-, year =	1996
-, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-16.ps.Z"
-, update =	"96.09 devillers+tamassia"
+, author =      "Giuseppe Liotta and Franco P. Preparata and Roberto Tamassia"
+, title =       "Robust Proximity Queries in Implicit {Voronoi} Diagrams"
+, type =        "Technical Report"
+, number =      "CS-96-16"
+, institution = "Center for Geometric Computing, Comput. Sci. Dept., Brown Univ."
+, address =     "Providence, RI"
+, year =        1996
+, url = "ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-16.ps.Z"
+, update =      "96.09 devillers+tamassia"
 }
 
 @techreport{lttv-argd-96
-, author =	"G. Liotta and R. Tamassia and I. G. Tollis and P. Vocca"
-, title =	"Area Requirement of {Gabriel} Drawings"
-, type =	"Technical Report"
-, number =	"CS-96-29"
-, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
-, year =	1996
-, url =	"ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-29.ps.Z"
-, keywords =	"graph drawing, proximity, CGC, Brown"
-, update =	"97.03 tamassia"
+, author =      "G. Liotta and R. Tamassia and I. G. Tollis and P. Vocca"
+, title =       "Area Requirement of {Gabriel} Drawings"
+, type =        "Technical Report"
+, number =      "CS-96-29"
+, institution = "Center for Geometric Computing, Dept. Computer Science, Brown Univ."
+, year =        1996
+, url = "ftp://ftp.cs.brown.edu/pub/techreports/96/cs96-29.ps.Z"
+, keywords =    "graph drawing, proximity, CGC, Brown"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{lttv-argd-97
-, author =	"G. Liotta and R. Tamassia and I. G. Tollis and P. Vocca"
-, title =	"Area Requirement of {Gabriel} Drawings"
-, booktitle =	"Algorithms and Complexity (Proc. CIAC' 97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1203
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"135--146"
-, url =	"https://www.cs.brown.edu/cgc/papers/lttv-argd-97.ps.gz"
-, keywords =	"graph drawing, proximity, CGC, Brown"
-, update =	"98.07 tamassia, 97.03 tamassia"
+, author =      "G. Liotta and R. Tamassia and I. G. Tollis and P. Vocca"
+, title =       "Area Requirement of {Gabriel} Drawings"
+, booktitle =   "Algorithms and Complexity (Proc. CIAC' 97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1203
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "135--146"
+, url = "https://www.cs.brown.edu/cgc/papers/lttv-argd-97.ps.gz"
+, keywords =    "graph drawing, proximity, CGC, Brown"
+, update =      "98.07 tamassia, 97.03 tamassia"
 }
 
 @inproceedings{lvd-odmnb-94
-, author =	"G. Liotta and F. Vargiu and G. {Di Battista}"
-, title =	"Orthogonal Drawings with the Minimum Number of Bends"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"281--286"
-, cites =	"dt-ipt-89, dlv-sorod-93, e-ga-79, gt-ccurp-94, k-mpgdg-92, l-conm-76, t-eggmn-87, tt-pgelt-89, ttv-lbpap-91, ttv-lbpod-91, v-ucvc-81, dett-adgab-94, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "G. Liotta and F. Vargiu and G. {Di Battista}"
+, title =       "Orthogonal Drawings with the Minimum Number of Bends"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "281--286"
+, cites =       "dt-ipt-89, dlv-sorod-93, e-ga-79, gt-ccurp-94, k-mpgdg-92, l-conm-76, t-eggmn-87, tt-pgelt-89, ttv-lbpap-91, ttv-lbpod-91, v-ucvc-81, dett-adgab-94, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @book{lw-spgd-
-, title =	"Special Issue on Selected Papers from the 1998 Symposium on Graph Drawing"
-, editor =	"G. Liotta and S. Whitesides"
-, series =	"J. Graph Algorithms Appl."
-, note =	"To appear"
-, keywords =	"graph drawing, collection"
-, update =	"98.11 tamassia"
+, title =       "Special Issue on Selected Papers from the 1998 Symposium on Graph Drawing"
+, editor =      "G. Liotta and S. Whitesides"
+, series =      "J. Graph Algorithms Appl."
+, note =        "To appear"
+, keywords =    "graph drawing, collection"
+, update =      "98.11 tamassia"
 }
 
 @inproceedings{ltl-mpsrp-89
-, author =	"W. T. Liou and J. J. M. Tan and R. C. T. Lee"
-, title =	"Minimum partitioning simple rectilinear polygons in {$O(n \log\log n)$} time"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"344--353"
-, cites =	"ahu-daca-74, aap-ptem-86, ckss-crr-81, fss-mrpdb-84, fk-acpr-84, gt-ltasc-85, g-mmbg-67, cg-prca-83, h-acpr-82, hk-nammb-73, ia-eaggs-86, lllmp-tddo2-79, lp-eafmm-81, m-dsa-84, ns-fapd-88, o-mdrr-83, ostt-mprr-83, ps-coac-82, tv-otats-88, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "W. T. Liou and J. J. M. Tan and R. C. T. Lee"
+, title =       "Minimum partitioning simple rectilinear polygons in {$O(n \log\log n)$} time"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "344--353"
+, cites =       "ahu-daca-74, aap-ptem-86, ckss-crr-81, fss-mrpdb-84, fk-acpr-84, gt-ltasc-85, g-mmbg-67, cg-prca-83, h-acpr-82, hk-nammb-73, ia-eaggs-86, lllmp-tddo2-79, lp-eafmm-81, m-dsa-84, ns-fapd-88, o-mdrr-83, ostt-mprr-83, ps-coac-82, tv-otats-88, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{ltl-ccrpl-91
-, author =	"W. T. Liou and C. Y. Tang and R. C. T. Lee"
-, title =	"Covering convex rectilinear polygons in linear time"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	2
-, year =	1991
-, pages =	"137--185"
-, keywords =	"optimal covering problem, convex rectilinear polygon, optimum algorithm"
+, author =      "W. T. Liou and C. Y. Tang and R. C. T. Lee"
+, title =       "Covering convex rectilinear polygons in linear time"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      2
+, year =        1991
+, pages =       "137--185"
+, keywords =    "optimal covering problem, convex rectilinear polygon, optimum algorithm"
 }
 
 @article{l-ompa-84
-, author =	"W. {Lipski, Jr.}"
-, title =	"An {$O(n \log n)$} {Manhattan} path algorithm"
-, journal =	"Inform. Process. Lett."
-, volume =	19
-, year =	1984
-, pages =	"99--102"
+, author =      "W. {Lipski, Jr.}"
+, title =       "An {$O(n \log n)$} {Manhattan} path algorithm"
+, journal =     "Inform. Process. Lett."
+, volume =      19
+, year =        1984
+, pages =       "99--102"
 }
 
 @article{l-fmprp-83
-, author =	"W. {Lipski, Jr.}"
-, title =	"Finding a {Manhattan} path and related problems"
-, journal =	"Networks"
-, volume =	13
-, year =	1983
-, pages =	"399--409"
+, author =      "W. {Lipski, Jr.}"
+, title =       "Finding a {Manhattan} path and related problems"
+, journal =     "Networks"
+, volume =      13
+, year =        1983
+, pages =       "399--409"
 }
 
 @incollection{l-stlwl-84
-, author =	"W. {Lipski, Jr.}"
-, title =	"On the structure of three-layer wirable layouts"
-, editor =	"Franco P. Preparata"
-, booktitle =	"VLSI Theory"
-, series =	"Adv. Comput. Res."
-, volume =	2
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1984
-, pages =	"231--243"
-, update =	"01.04 icking"
+, author =      "W. {Lipski, Jr.}"
+, title =       "On the structure of three-layer wirable layouts"
+, editor =      "Franco P. Preparata"
+, booktitle =   "VLSI Theory"
+, series =      "Adv. Comput. Res."
+, volume =      2
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1984
+, pages =       "231--243"
+, update =      "01.04 icking"
 }
 
 @article{lllmp-tddo2-79
-, author =	"W. {Lipski, Jr.} and E. Lodi and F. Luccio and C. Mugnai and L. Pagli"
-, title =	"On two-dimensional data organization , {Part} {II}"
-, journal =	"Fundam. Inform."
-, volume =	2
-, year =	1979
-, pages =	"245--260"
-, update =	"97.11 bibrelex"
+, author =      "W. {Lipski, Jr.} and E. Lodi and F. Luccio and C. Mugnai and L. Pagli"
+, title =       "On two-dimensional data organization , {Part} {II}"
+, journal =     "Fundam. Inform."
+, volume =      2
+, year =        1979
+, pages =       "245--260"
+, update =      "97.11 bibrelex"
 }
 
 @article{lp-fatsd-81
-, author =	"W. {Lipski, Jr.} and C. H. Papadimitriou"
-, title =	"A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems"
-, journal =	"J. Algorithms"
-, volume =	2
-, year =	1981
-, pages =	"211--226"
+, author =      "W. {Lipski, Jr.} and C. H. Papadimitriou"
+, title =       "A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems"
+, journal =     "J. Algorithms"
+, volume =      2
+, year =        1981
+, pages =       "211--226"
 }
 
 @article{lp-eafmm-81
-, author =	"W. {Lipski, Jr.} and F. P. Preparata"
-, title =	"Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems"
-, journal =	"Acta Inform."
-, volume =	15
-, year =	1981
-, pages =	"329--346"
-, update =	"98.03 bibrelex"
+, author =      "W. {Lipski, Jr.} and F. P. Preparata"
+, title =       "Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems"
+, journal =     "Acta Inform."
+, volume =      15
+, year =        1981
+, pages =       "329--346"
+, update =      "98.03 bibrelex"
 }
 
 @article{lp-fcuio-80
-, author =	"W. {Lipski, Jr.} and F. P. Preparata"
-, title =	"Finding the contour of a union of iso-oriented rectangles"
-, journal =	"J. Algorithms"
-, volume =	1
-, year =	1980
-, pages =	"235--246"
-, note =	"Errata in 2(1981), 105; corrigendum in 3(1982),
-		 301--302"
+, author =      "W. {Lipski, Jr.} and F. P. Preparata"
+, title =       "Finding the contour of a union of iso-oriented rectangles"
+, journal =     "J. Algorithms"
+, volume =      1
+, year =        1980
+, pages =       "235--246"
+, note =        "Errata in 2(1981), 105; corrigendum in 3(1982),
+                 301--302"
 }
 
 @article{lp-src-81
-, author =	"W. {Lipski, Jr.} and F. P. Preparata"
-, title =	"Segments, rectangles, contours"
-, journal =	"J. Algorithms"
-, volume =	2
-, year =	1981
-, pages =	"63--76"
+, author =      "W. {Lipski, Jr.} and F. P. Preparata"
+, title =       "Segments, rectangles, contours"
+, journal =     "J. Algorithms"
+, volume =      2
+, year =        1981
+, pages =       "63--76"
 }
 
 @book{l-eaac-81
-, author =	"J. Lipson"
-, title =	"Elements of Algebra and Algebraic Computing"
-, publisher =	"Addison-Wesley"
-, year =	1981
-, update =	"98.03 bibrelex"
+, author =      "J. Lipson"
+, title =       "Elements of Algebra and Algebraic Computing"
+, publisher =   "Addison-Wesley"
+, year =        1981
+, update =      "98.03 bibrelex"
 }
 
 @article{ls-mmpmm-88
-, author =	"M. Lipton and W. Still"
-, title =	"The multiple minimum problem in molecular modeling: {Tree} searching internal coordinate conformational space"
-, journal =	"J. Computational Chemistry"
-, volume =	9
-, number =	4
-, year =	1988
-, pages =	"343--355"
-, update =	"98.07 bibrelex"
+, author =      "M. Lipton and W. Still"
+, title =       "The multiple minimum problem in molecular modeling: {Tree} searching internal coordinate conformational space"
+, journal =     "J. Computational Chemistry"
+, volume =      9
+, number =      4
+, year =        1988
+, pages =       "343--355"
+, update =      "98.07 bibrelex"
 }
 
 @article{lm-bmcpg-78
-, author =	"R. J. Lipton and R. E. Miller"
-, title =	"A Batching Method for Coloring Planar Graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	7
-, number =	4
-, year =	1978
-, pages =	"185--188"
-, update =	"98.03 bibrelex"
+, author =      "R. J. Lipton and R. E. Miller"
+, title =       "A Batching Method for Coloring Planar Graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      7
+, number =      4
+, year =        1978
+, pages =       "185--188"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{lns-mdg-85
-, author =	"R. J. Lipton and S. C. North and J. S. Sandberg"
-, title =	"A method for drawing graphs"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"153--160"
-, keywords =	"graph drawing"
-, cites =	"b-agt-74, c-agg-83, c-cgts-69, cm-ecgt-78, c-tggr-95, c-sdcrg-50, cm-grdg-80, cfp-zsg-81, er-ag-63, f-gcen-32, f-egavp-83, f-grg-49, f-gdtga-49, f-hdg-70, fhl-ptapg-80, gj-cigtn-79, gw-cetg-77, gm-gtg-64, ht-ogpm-66, h-gt-72, h-vsag-65, j-crpg-82, k-c-47, k-lgdlt-46, k-dpgtg-47, k-cdf-63, l-cpe-79, m-caclg-77, m-sgta-72, p-kafgg-37, rt-tdt-81, s-ggggg-57, s-cg-59, s-mogga-59, s-gm-60, s-cmspg-70, sr-cdtn-83, t-scg-59, t-crg-60, t-hdg-63, t-cg-66, t-wim-73, t-gt-84, u-ascan-84, w-grras-, w-anagg-71, w-moagp-66, ws-tdt-79, w-s-51, w-fpg-64, ZZZ"
-, update =	"97.11 bibrelex, 93.09 tamassia, 93.05 jones"
+, author =      "R. J. Lipton and S. C. North and J. S. Sandberg"
+, title =       "A method for drawing graphs"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "153--160"
+, keywords =    "graph drawing"
+, cites =       "b-agt-74, c-agg-83, c-cgts-69, cm-ecgt-78, c-tggr-95, c-sdcrg-50, cm-grdg-80, cfp-zsg-81, er-ag-63, f-gcen-32, f-egavp-83, f-grg-49, f-gdtga-49, f-hdg-70, fhl-ptapg-80, gj-cigtn-79, gw-cetg-77, gm-gtg-64, ht-ogpm-66, h-gt-72, h-vsag-65, j-crpg-82, k-c-47, k-lgdlt-46, k-dpgtg-47, k-cdf-63, l-cpe-79, m-caclg-77, m-sgta-72, p-kafgg-37, rt-tdt-81, s-ggggg-57, s-cg-59, s-mogga-59, s-gm-60, s-cmspg-70, sr-cdtn-83, t-scg-59, t-crg-60, t-hdg-63, t-cg-66, t-wim-73, t-gt-84, u-ascan-84, w-grras-, w-anagg-71, w-moagp-66, ws-tdt-79, w-s-51, w-fpg-64, ZZZ"
+, update =      "97.11 bibrelex, 93.09 tamassia, 93.05 jones"
 }
 
 @article{lns-vlp-83
-, author =	"R. J. Lipton and S. C. North and R. Sledgewick"
-, title =	"VLSI layout as programming"
-, journal =	"ACM Trans. on Programming Languages and Systems"
-, volume =	"??"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "R. J. Lipton and S. C. North and R. Sledgewick"
+, title =       "VLSI layout as programming"
+, journal =     "ACM Trans. on Programming Languages and Systems"
+, volume =      "??"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{lrt-gnd-79
-, author =	"R. J. Lipton and D. J. Rose and R. E. Tarjan"
-, title =	"Generalized nested dissection"
-, journal =	"SIAM J. Numer. Anal."
-, volume =	16
-, number =	2
-, year =	1979
-, pages =	"346--358"
-, update =	"97.11 bibrelex"
+, author =      "R. J. Lipton and D. J. Rose and R. E. Tarjan"
+, title =       "Generalized nested dissection"
+, journal =     "SIAM J. Numer. Anal."
+, volume =      16
+, number =      2
+, year =        1979
+, pages =       "346--358"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ls-lbv-81
-, author =	"R. J. Lipton and R. Sedgewick"
-, title =	"Lower bounds for {VLSI}"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Theory Comput."
-, year =	1981
-, pages =	"300--307"
+, author =      "R. J. Lipton and R. Sedgewick"
+, title =       "Lower bounds for {VLSI}"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Theory Comput."
+, year =        1981
+, pages =       "300--307"
 }
 
 @inproceedings{lt-stpg-77
-, author =	"R. J. Lipton and R. E. Tarjan"
-, title =	"A separator theorem for planar graphs"
-, booktitle =	"Proc. GI Conf. Theoret. Comput. Sci."
-, year =	1977
-, update =	"97.11 bibrelex"
+, author =      "R. J. Lipton and R. E. Tarjan"
+, title =       "A separator theorem for planar graphs"
+, booktitle =   "Proc. GI Conf. Theoret. Comput. Sci."
+, year =        1977
+, update =      "97.11 bibrelex"
 }
 
 @article{lt-stpg-79
-, author =	"R. J. Lipton and R. E. Tarjan"
-, title =	"A separator theorem for planar graphs"
-, journal =	"SIAM J. Appl. Math."
-, volume =	36
-, year =	1979
-, pages =	"177--189"
-, update =	"97.11 bibrelex"
+, author =      "R. J. Lipton and R. E. Tarjan"
+, title =       "A separator theorem for planar graphs"
+, journal =     "SIAM J. Appl. Math."
+, volume =      36
+, year =        1979
+, pages =       "177--189"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{lt-apst-77
-, author =	"R. J. Lipton and R. E. Tarjan"
-, title =	"Applications of a planar separator theorem"
-, booktitle =	"Proc. 18th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1977
-, pages =	"162--170"
-, precedes =	"lt-apst-80"
+, author =      "R. J. Lipton and R. E. Tarjan"
+, title =       "Applications of a planar separator theorem"
+, booktitle =   "Proc. 18th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1977
+, pages =       "162--170"
+, precedes =    "lt-apst-80"
 }
 
 @article{lt-apst-80
-, author =	"R. J. Lipton and R. E. Tarjan"
-, title =	"Applications of a planar separator theorem"
-, journal =	"SIAM J. Comput."
-, volume =	9
-, year =	1980
-, pages =	"615--627"
-, succeeds =	"lt-apst-77"
+, author =      "R. J. Lipton and R. E. Tarjan"
+, title =       "Applications of a planar separator theorem"
+, journal =     "SIAM J. Comput."
+, volume =      9
+, year =        1980
+, pages =       "615--627"
+, succeeds =    "lt-apst-77"
 }
 
 @incollection{l-crpbt-94
-, author =	"Dani Lischinski"
-, title =	"Converting Rectangular Patches into {B{\'e}zier} Triangles"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"278--285"
-, keywords =	"Bezier surface, biquadratic patch"
-, update =	"94.09 heckbert"
-, annote =	"A parametric surface conversion routine. Contains C++
+, author =      "Dani Lischinski"
+, title =       "Converting Rectangular Patches into {B{\'e}zier} Triangles"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "278--285"
+, keywords =    "Bezier surface, biquadratic patch"
+, update =      "94.09 heckbert"
+, annote =      "A parametric surface conversion routine. Contains C++
 code."
 }
 
 @incollection{l-idt-94
-, author =	"Dani Lischinski"
-, title =	"Incremental {Delaunay} Triangulation"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"47--59"
-, keywords =	"mesh generation, polygonization, Voronoi diagram"
-, update =	"94.09 heckbert"
-, annote =	"Gives some code to solve a very important problem: finding
+, author =      "Dani Lischinski"
+, title =       "Incremental {Delaunay} Triangulation"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "47--59"
+, keywords =    "mesh generation, polygonization, Voronoi diagram"
+, update =      "94.09 heckbert"
+, annote =      "Gives some code to solve a very important problem: finding
 Delaunay triangulations and Voronoi diagrams in 2D. These two geometric
 constructions are useful for triangular mesh generation and for nearest
 neighbor finding, respectively. Triangular mesh generation comes up when
@@ -97617,6797 +97617,6797 @@ @incollection{l-idt-94
 }
 
 @article{ltg-dmar-92
-, author =	"Dani Lischinski and Filippo Tampieri and Donald Greenberg"
-, title =	"Discontinuity meshing for accurate radiosity"
-, journal =	"IEEE Comp. Graph. App."
-, volume =	"??"
-, month =	nov
-, year =	1992
-, pages =	"25--39"
-, update =	"98.11 bibrelex"
+, author =      "Dani Lischinski and Filippo Tampieri and Donald Greenberg"
+, title =       "Discontinuity meshing for accurate radiosity"
+, journal =     "IEEE Comp. Graph. App."
+, volume =      "??"
+, month =       nov
+, year =        1992
+, pages =       "25--39"
+, update =      "98.11 bibrelex"
 }
 
 @article{lsg-beer-94
-, author =	"D. Lishinski and B. Smith and D. P. Greenberg"
-, title =	"Bounds and error estimates for radiosity"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1994
-, pages =	"67--74"
-, note =	"Proc. SIGGRAPH '94"
-, update =	"98.03 bibrelex"
+, author =      "D. Lishinski and B. Smith and D. P. Greenberg"
+, title =       "Bounds and error estimates for radiosity"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1994
+, pages =       "67--74"
+, note =        "Proc. SIGGRAPH '94"
+, update =      "98.03 bibrelex"
 }
 
 @unpublished{l-tpfc-88
-, author =	"B. Lisper"
-, title =	"Theory{N}et posting and followup communication"
-, month =	jul
-, year =	1988
-, note =	"??"
-, update =	"97.11 bibrelex"
+, author =      "B. Lisper"
+, title =       "Theory{N}et posting and followup communication"
+, month =       jul
+, year =        1988
+, note =        "??"
+, update =      "97.11 bibrelex"
 }
 
 % ###
 @misc{ls-agt-
-, author =	"F. F. Little and J. L. Schwing"
-, title =	"Automatic Generation of Triangulations"
+, author =      "F. F. Little and J. L. Schwing"
+, title =       "Automatic Generation of Triangulations"
 }
 
 @inproceedings{l-imrcp-83
-, author =	"J. J. Little"
-, title =	"An Iterative Method for Reconstructing Convex Polyhedra from Extended {Gaussian} Image"
-, booktitle =	"Proc. AAAI"
-, year =	1983
-, pages =	"247--250"
-, update =	"97.11 bibrelex"
+, author =      "J. J. Little"
+, title =       "An Iterative Method for Reconstructing Convex Polyhedra from Extended {Gaussian} Image"
+, booktitle =   "Proc. AAAI"
+, year =        1983
+, pages =       "247--250"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{l-doaeg-85
-, author =	"J. J. Little"
-, title =	"Determining Object Attitude from Extended {Gaussian} Image"
-, booktitle =	"Proc. Internat. Joint Conf. Artif. Intell."
-, year =	1985
-, note =	"Submitted"
-, update =	"97.11 bibrelex"
+, author =      "J. J. Little"
+, title =       "Determining Object Attitude from Extended {Gaussian} Image"
+, booktitle =   "Proc. Internat. Joint Conf. Artif. Intell."
+, year =        1985
+, note =        "Submitted"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{l-egimv-85
-, author =	"J. J. Little"
-, title =	"Extended gaussian images, mixed volumes, and shape reconstruction"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"15--23"
-, cites =	"bb-deibs-81, b-fodm-84, b-fihs-78, gmw-po-81, g-iscsh-81, g-cp-67, grs-kfcg-83, h-egi-84, i-r3dou-81, ihncf-puopo-83, l-imrcp-83, l-doaeg-85, l-cfp-66, m-aludk-97, ps-coac-82, ph-chfsp-77, s-mplbc-84, s-uesi-79, s-pur-22, t-cpt-62, w-pmdso-80, ZZZ"
-, update =	"97.11 bibrelex, 93.05 jones"
+, author =      "J. J. Little"
+, title =       "Extended gaussian images, mixed volumes, and shape reconstruction"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "15--23"
+, cites =       "bb-deibs-81, b-fodm-84, b-fihs-78, gmw-po-81, g-iscsh-81, g-cp-67, grs-kfcg-83, h-egi-84, i-r3dou-81, ihncf-puopo-83, l-imrcp-83, l-doaeg-85, l-cfp-66, m-aludk-97, ps-coac-82, ph-chfsp-77, s-mplbc-84, s-uesi-79, s-pur-22, t-cpt-62, w-pmdso-80, ZZZ"
+, update =      "97.11 bibrelex, 93.05 jones"
 }
 
 @article{lp-rpfit-79
-, author =	"J. J. Little and T. K. Peucker"
-, title =	"A recursive procedure for finding the intersection of two digital curves"
-, journal =	"Comput. Graph. Image Process."
-, volume =	10
-, year =	1979
-, pages =	"159--171"
+, author =      "J. J. Little and T. K. Peucker"
+, title =       "A recursive procedure for finding the intersection of two digital curves"
+, journal =     "Comput. Graph. Image Process."
+, volume =      10
+, year =        1979
+, pages =       "159--171"
 }
 
 @inproceedings{l-lqwia-87
-, author =	"N. Littlestone"
-, title =	"Learning quickly when irrelevant attributes abound: {A} new linear-threshold algorithm"
-, booktitle =	"Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1987
-, pages =	"68--77"
-, update =	"98.03 bibrelex"
+, author =      "N. Littlestone"
+, title =       "Learning quickly when irrelevant attributes abound: {A} new linear-threshold algorithm"
+, booktitle =   "Proc. 28th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1987
+, pages =       "68--77"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{lj-rbtsm-93
-, author =	"Anwei Liu and Barry Joe"
-, title =	"Relationship between tetrahedron shape measures"
-, institution =	"University of Alberta"
-, address =	"Edmonton, Alberta, Canada"
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "Anwei Liu and Barry Joe"
+, title =       "Relationship between tetrahedron shape measures"
+, institution = "University of Alberta"
+, address =     "Edmonton, Alberta, Canada"
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @article{lefm-dvnmp-96
-, author =	"C. Liu and D. M. Esterling and J. Fontdecaba and E. Mosel"
-, title =	"Dimensional Verification of {NC} Machining Profiles Using Extended Quadtrees"
-, journal =	"Comput. Aided Design"
-, volume =	28
-, number =	11
-, month =	nov
-, year =	1996
-, pages =	"845--852"
-, update =	"97.03 held"
+, author =      "C. Liu and D. M. Esterling and J. Fontdecaba and E. Mosel"
+, title =       "Dimensional Verification of {NC} Machining Profiles Using Extended Quadtrees"
+, journal =     "Comput. Aided Design"
+, volume =      28
+, number =      11
+, month =       nov
+, year =        1996
+, pages =       "845--852"
+, update =      "97.03 held"
 }
 
 @article{ln-dpump-88
-, author =	"Robin Liu and Simeon Ntafos"
-, title =	"On Decomposing Polygons into Uniformly Monotone Parts"
-, journal =	"Inform. Process. Lett."
-, volume =	27
-, number =	2
-, month =	feb
-, year =	1988
-, pages =	"85--89"
-, update =	"98.03 mitchell"
+, author =      "Robin Liu and Simeon Ntafos"
+, title =       "On Decomposing Polygons into Uniformly Monotone Parts"
+, journal =     "Inform. Process. Lett."
+, volume =      27
+, number =      2
+, month =       feb
+, year =        1988
+, pages =       "85--89"
+, update =      "98.03 mitchell"
 }
 
 @article{ln-prpss-91
-, author =	"R. Liu and S. Ntafos"
-, title =	"On partitioning rectilinear polygons into star-shaped polygons"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"771--800"
+, author =      "R. Liu and S. Ntafos"
+, title =       "On partitioning rectilinear polygons into star-shaped polygons"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "771--800"
 }
 
 @inproceedings{ls-smm-85
-, author =	"S. Liu and K. Singhal"
-, title =	"A statistical mosfet model"
-, booktitle =	"Proc. of the International Conference on Computer-Aided Design"
-, site =	"San Jose"
-, year =	1985
-, pages =	"78--80"
-, update =	"98.03 bibrelex"
+, author =      "S. Liu and K. Singhal"
+, title =       "A statistical mosfet model"
+, booktitle =   "Proc. of the International Conference on Computer-Aided Design"
+, site =        "San Jose"
+, year =        1985
+, pages =       "78--80"
+, update =      "98.03 bibrelex"
 }
 
 @unpublished{lsv-cacsc-86
-, author =	"S. Liu and K. Singhal and V. Visivanathan"
-, title =	"CENTER/ADVICE: A CAD system for circuit design optimization"
-, year =	1986
-, note =	"Manuscript in preparation"
-, update =	"98.03 bibrelex"
+, author =      "S. Liu and K. Singhal and V. Visivanathan"
+, title =       "CENTER/ADVICE: A CAD system for circuit design optimization"
+, year =        1986
+, note =        "Manuscript in preparation"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{lg-blbsb-96
-, author =	"Shang-Sheng Liu and Rajit Gadh"
-, title =	"Basic Logical Bulk shapes (BLOBs) for finite element hexahedral mesh generation"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"291--304"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Shang-Sheng Liu and Rajit Gadh"
+, title =       "Basic Logical Bulk shapes (BLOBs) for finite element hexahedral mesh generation"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "291--304"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @inproceedings{lr-eodbr-90
-, author =	"W.-P. Liu and I. Rival"
-, title =	"Enumerating one-directional blocking relations and embedding them in small areas on the plane"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"138--141"
-, cites =	"d-rbwdo-84, fpp-sssfe-88, mt-tqcp-85, nru-roptp-90, ru-roptc-88, dtt-arsdd-89, tt-uavrp-86, w-cblsg-85, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "W.-P. Liu and I. Rival"
+, title =       "Enumerating one-directional blocking relations and embedding them in small areas on the plane"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "138--141"
+, cites =       "d-rbwdo-84, fpp-sssfe-88, mt-tqcp-85, nru-roptp-90, ru-roptc-88, dtt-arsdd-89, tt-uavrp-86, w-cblsg-85, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{lmp-sbeac-94
-, author =	"Y. Liu and P. Marchioro and R. Petreschi"
-, title =	"A Single Bend Embedding Algorithm for Cubic Graphs"
-, type =	"Manuscript"
-, year =	1994
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia"
+, author =      "Y. Liu and P. Marchioro and R. Petreschi"
+, title =       "A Single Bend Embedding Algorithm for Cubic Graphs"
+, type =        "Manuscript"
+, year =        1994
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia"
 }
 
 @techreport{lmps-trm1b-90
-, author =	"Y. Liu and P. Marchioro and R. Petreschi and B. Simeone"
-, title =	"Theoretical Results on at Most 1-Bend Embeddability of Graphs"
-, type =	"Technical Report"
-, institution =	"Dipartimento di Statistica, Univ. di Roma ``La Sapienza''"
-, year =	1990
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia"
+, author =      "Y. Liu and P. Marchioro and R. Petreschi and B. Simeone"
+, title =       "Theoretical Results on at Most 1-Bend Embeddability of Graphs"
+, type =        "Technical Report"
+, institution = "Dipartimento di Statistica, Univ. di Roma ``La Sapienza''"
+, year =        1990
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia"
 }
 
 @techreport{lms-la3be-93
-, author =	"Y. Liu and A. Morgana and B. Simeone"
-, title =	"A Linear Algorithm for 3-Bend Embeddings of Planar Graphs in the Grid"
-, type =	"Manuscript"
-, year =	1993
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia"
+, author =      "Y. Liu and A. Morgana and B. Simeone"
+, title =       "A Linear Algorithm for 3-Bend Embeddings of Planar Graphs in the Grid"
+, type =        "Manuscript"
+, year =        1993
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia"
 }
 
 @article{lms-gtrre-91
-, author =	"Y. Liu and A. Morgana and B. Simeone"
-, title =	"General Theoretical Results on Rectilinear Embeddability of Graphs"
-, journal =	"Acta Math. Appl. Sinica"
-, volume =	7
-, year =	1991
-, pages =	"187--192"
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia"
+, author =      "Y. Liu and A. Morgana and B. Simeone"
+, title =       "General Theoretical Results on Rectilinear Embeddability of Graphs"
+, journal =     "Acta Math. Appl. Sinica"
+, volume =      7
+, year =        1991
+, pages =       "187--192"
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia"
 }
 
 @article{la-fspdp-95
-, author =	"Y.-H. Liu and S. Arimoto"
-, title =	"Finding the Shortest Path of a Disc Among Polygonal Obstacles Using a Radius-Independent Graph"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	11
-, number =	5
-, month =	oct
-, year =	1995
-, pages =	"682--691"
-, update =	"96.01 held"
+, author =      "Y.-H. Liu and S. Arimoto"
+, title =       "Finding the Shortest Path of a Disc Among Polygonal Obstacles Using a Radius-Independent Graph"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      11
+, number =      5
+, month =       oct
+, year =        1995
+, pages =       "682--691"
+, update =      "96.01 held"
 }
 
 @article{ld-smtld-92
-, author =	"Z. C. Liu and D. Z. Du"
-, title =	"On {Steiner} minimal trees with {$L_p$} distance"
-, journal =	"Algorithmica"
-, volume =	7
-, year =	1992
-, pages =	"179--191"
-, update =	"99.03 bibrelex, 98.03 bibrelex"
+, author =      "Z. C. Liu and D. Z. Du"
+, title =       "On {Steiner} minimal trees with {$L_p$} distance"
+, journal =     "Algorithmica"
+, volume =      7
+, year =        1992
+, pages =       "179--191"
+, update =      "99.03 bibrelex, 98.03 bibrelex"
 }
 
 @book{l-kt-93
-, author =	"C. Livingston"
-, title =	"Knot Theory"
-, publisher =	"Mathematical Association of America"
-, address =	"Washington"
-, year =	1993
-, update =	"00.11 smid, 00.07 icking, 98.07 orourke"
+, author =      "C. Livingston"
+, title =       "Knot Theory"
+, publisher =   "Mathematical Association of America"
+, address =     "Washington"
+, year =        1993
+, update =      "00.11 smid, 00.07 icking, 98.07 orourke"
 }
 
 @article{lsj-noiea-96
-, author =	"Y. Livnat and H.-W. Shen and C. R. Johnson"
-, title =	"A near optimal isosurface extraction algorithm using the span space"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	2
-, year =	1996
-, pages =	"73--84"
-, update =	"98.07 bibrelex"
+, author =      "Y. Livnat and H.-W. Shen and C. R. Johnson"
+, title =       "A near optimal isosurface extraction algorithm using the span space"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      2
+, year =        1996
+, pages =       "73--84"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{ls-ipjc-85
-, author =	"R. Livne and Micha Sharir"
-, title =	"On Intersection of Planar {Jordan} Curves"
-, type =	"Technical {Report}"
-, number =	153
-, institution =	"Courant Institute of Mathematical Sciences"
-, year =	1985
-, comments =	"Robotics Report number 37"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "R. Livne and Micha Sharir"
+, title =       "On Intersection of Planar {Jordan} Curves"
+, type =        "Technical {Report}"
+, number =      153
+, institution = "Courant Institute of Mathematical Sciences"
+, year =        1985
+, comments =    "Robotics Report number 37"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @inproceedings{l-tspp-77
-, author =	"E. L. Lloyd"
-, title =	"On triangulations of a set of points in the plane"
-, booktitle =	"Proc. 18th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1977
-, pages =	"228--240"
+, author =      "E. L. Lloyd"
+, title =       "On triangulations of a set of points in the plane"
+, booktitle =   "Proc. 18th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1977
+, pages =       "228--240"
 }
 
 @article{l-opmr-80
-, author =	"J. W. Lloyd"
-, title =	"Optimal partial-match retrieval"
-, journal =	"BIT"
-, volume =	20
-, year =	1980
-, pages =	"406--413"
+, author =      "J. W. Lloyd"
+, title =       "Optimal partial-match retrieval"
+, journal =     "BIT"
+, volume =      20
+, year =        1980
+, pages =       "406--413"
 }
 
 @article{l-pmrdf-82
-, author =	"J. W. Lloyd"
-, title =	"Partial-match retrieval for dynamic files"
-, journal =	"BIT"
-, volume =	22
-, year =	1982
-, pages =	"150--168"
+, author =      "J. W. Lloyd"
+, title =       "Partial-match retrieval for dynamic files"
+, journal =     "BIT"
+, volume =      22
+, year =        1982
+, pages =       "150--168"
 }
 
 @inproceedings{lms-hscr-92
-, author =	"C.-Y. Lo and J. Matou{\v s}ek and W. Steiger"
-, title =	"Ham-sandwich cuts in {$\Re^d$}"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"539--545"
-, update =	"96.09 agarwal"
+, author =      "C.-Y. Lo and J. Matou{\v s}ek and W. Steiger"
+, title =       "Ham-sandwich cuts in {$\Re^d$}"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "539--545"
+, update =      "96.09 agarwal"
 }
 
 @article{lms-ahsc-94
-, author =	"C.-Y. Lo and J. Matou{\v s}ek and W. L. Steiger"
-, title =	"Algorithms for ham-sandwich cuts"
-, journal =	"Discrete Comput. Geom."
-, volume =	11
-, year =	1994
-, pages =	"433--452"
-, succeeds =	"lms-hscr-92"
-, update =	"97.11 bibrelex, 97.03 agarwal, 96.09 agarwal, 95.01 matousek"
+, author =      "C.-Y. Lo and J. Matou{\v s}ek and W. L. Steiger"
+, title =       "Algorithms for ham-sandwich cuts"
+, journal =     "Discrete Comput. Geom."
+, volume =      11
+, year =        1994
+, pages =       "433--452"
+, succeeds =    "lms-hscr-92"
+, update =      "97.11 bibrelex, 97.03 agarwal, 96.09 agarwal, 95.01 matousek"
 }
 
 @inproceedings{ls-otahs-90
-, author =	"C.-Y. Lo and W. Steiger"
-, title =	"An optimal-time algorithm for ham-sandwich cuts in the plane"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"5--9"
-, cites =	"csss-otass-89, csy-khrp-87, e-acg-87, ew-chsct-86, m-cen-89, m-ptlp-85, w-pr-82, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "C.-Y. Lo and W. Steiger"
+, title =       "An optimal-time algorithm for ham-sandwich cuts in the plane"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "5--9"
+, cites =       "csss-otass-89, csy-khrp-87, e-acg-87, ew-chsct-86, m-cen-89, m-ptlp-85, w-pr-82, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{l-dtncp-89
-, author =	"S. H. Lo"
-, title =	"Delaunay Triangulation Of Non-Convex Planar Domains"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	28
-, number =	11
-, month =	nov
-, year =	1989
-, pages =	"2695--2707"
-, keywords =	"Delaunay triangulation, planar domains, mesh generation techniques"
-, annote =	"Triangle quality measure of $$2\sqrt3 \frac{|a\times
-		 b|}{a^2+b^2+c^2}$$. Circumcircle algorithm for CDT.
-		 Keep track of non-Delaunay edges. Initially the
-		 boundary, edges of non-Delaunay triangles are added to
-		 this list, which is all that must be checked for
-		 intersections."
-, abstract =	"This paper investigates the possibility of integrating
-		 the two currently most popular mesh generation
-		 techniques, namely the method of advancing front and
-		 the Delaunay triangulation algorithm. The merits of the
-		 resulting scheme are its simplicity, efficiency and
-		 versatility. With the introduction of 'non-Delaunay'
-		 line segments, the concept of using Delaunay
-		 triangulation as a means of mesh generation is
-		 clarified. An efficient algorithm is proposed for the
-		 construction of Delaunay triangulations over non-convex
-		 planar domains. Interior nodes are first generated
-		 within the planar domain. These interior nodes and the
-		 boundary nodes are then linked up together to produce a
-		 valid triangulation. Through the study of numerous
-		 examples of various characteristics, it is found that
-		 high-quality triangular element meshes are obtained by
-		 the proposed algorithm, and the mesh generation time
-		 bears a linear relationship with the number of
-		 elements/nodes of the triangulation. (Edited author
-		 abstract) 37 Refs."
+, author =      "S. H. Lo"
+, title =       "Delaunay Triangulation Of Non-Convex Planar Domains"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      28
+, number =      11
+, month =       nov
+, year =        1989
+, pages =       "2695--2707"
+, keywords =    "Delaunay triangulation, planar domains, mesh generation techniques"
+, annote =      "Triangle quality measure of $$2\sqrt3 \frac{|a\times
+                 b|}{a^2+b^2+c^2}$$. Circumcircle algorithm for CDT.
+                 Keep track of non-Delaunay edges. Initially the
+                 boundary, edges of non-Delaunay triangles are added to
+                 this list, which is all that must be checked for
+                 intersections."
+, abstract =    "This paper investigates the possibility of integrating
+                 the two currently most popular mesh generation
+                 techniques, namely the method of advancing front and
+                 the Delaunay triangulation algorithm. The merits of the
+                 resulting scheme are its simplicity, efficiency and
+                 versatility. With the introduction of 'non-Delaunay'
+                 line segments, the concept of using Delaunay
+                 triangulation as a means of mesh generation is
+                 clarified. An efficient algorithm is proposed for the
+                 construction of Delaunay triangulations over non-convex
+                 planar domains. Interior nodes are first generated
+                 within the planar domain. These interior nodes and the
+                 boundary nodes are then linked up together to produce a
+                 valid triangulation. Through the study of numerous
+                 examples of various characteristics, it is found that
+                 high-quality triangular element meshes are obtained by
+                 the proposed algorithm, and the mesh generation time
+                 bears a linear relationship with the number of
+                 elements/nodes of the triangulation. (Edited author
+                 abstract) 37 Refs."
 }
 
 @article{l-vdt1v-91
-, author =	"S. H. Lo"
-, title =	"Volume Discretization Into Tetrahedra. {I}. Verification and Orientation of Boundary Surfaces"
-, journal =	"Comput. Struct."
-, volume =	39
-, number =	5
-, year =	1991
-, pages =	"493--500"
-, annote =	"Mesh quality is harmonic mean of $A/(a^2+b^2+c^2)$."
+, author =      "S. H. Lo"
+, title =       "Volume Discretization Into Tetrahedra. {I}. Verification and Orientation of Boundary Surfaces"
+, journal =     "Comput. Struct."
+, volume =      39
+, number =      5
+, year =        1991
+, pages =       "493--500"
+, annote =      "Mesh quality is harmonic mean of $A/(a^2+b^2+c^2)$."
 }
 
 @article{l-vdt23-91
-, author =	"S. H. Lo"
-, title =	"Volume Discretization Into Tetrahedra. {II}. 3{D} Triangulation By Advancing Front Approach"
-, journal =	"Comput. Struct."
-, volume =	39
-, number =	5
-, year =	1991
-, pages =	"501--511"
-, keywords =	"discretization, tetrahedra, mesh generation, triangulation, advancing fronts"
-, annote =	"Doesn't like 3DDT. Advancing front picks next vertex
-		 as one that maximizes `quality' with a lookahead."
-, abstract =	"Existing methods of automatic mesh generation for 3D
-		 solid objects are reviewed. Although the 3D Delaunay
-		 triangulation recently aroused much attention, its
-		 suitability as a finite element mesh generator is
-		 questioned. Although in 2D Delaunay triangulation, the
-		 'max-min' angle criterion can be verified over the
-		 entire domain, no equivalent or similar criterion can
-		 be defined for its extension to 3D situations to ensure
-		 that tetrahedron elements so generated are well
-		 proportioned for numerical calculations. In this paper,
-		 a simple but versatile 3D triangulation scheme based on
-		 the advancing front technique for the discretization of
-		 arbitrary volumes is presented. To ensure that the
-		 tetrahedron elements generated are as equilateral as
-		 possible, the ratio of volume of the element to the sum
-		 of squares of edges put into a dimensionless form is
-		 adopted to judge the quality of a tetrahedron element.
-		 The quality of the finite element mesh can thus be
-		 ensured if the shape of each tetrahedron element is
-		 carefully controlled in the mesh construction process.
-		 Through the study of numerous examples of various
-		 characteristics, it is found that high-quality
-		 tetrahedron element meshes are obtained by the proposed
-		 algorithm. (Author abstract) 24 Refs."
+, author =      "S. H. Lo"
+, title =       "Volume Discretization Into Tetrahedra. {II}. 3{D} Triangulation By Advancing Front Approach"
+, journal =     "Comput. Struct."
+, volume =      39
+, number =      5
+, year =        1991
+, pages =       "501--511"
+, keywords =    "discretization, tetrahedra, mesh generation, triangulation, advancing fronts"
+, annote =      "Doesn't like 3DDT. Advancing front picks next vertex
+                 as one that maximizes `quality' with a lookahead."
+, abstract =    "Existing methods of automatic mesh generation for 3D
+                 solid objects are reviewed. Although the 3D Delaunay
+                 triangulation recently aroused much attention, its
+                 suitability as a finite element mesh generator is
+                 questioned. Although in 2D Delaunay triangulation, the
+                 'max-min' angle criterion can be verified over the
+                 entire domain, no equivalent or similar criterion can
+                 be defined for its extension to 3D situations to ensure
+                 that tetrahedron elements so generated are well
+                 proportioned for numerical calculations. In this paper,
+                 a simple but versatile 3D triangulation scheme based on
+                 the advancing front technique for the discretization of
+                 arbitrary volumes is presented. To ensure that the
+                 tetrahedron elements generated are as equilateral as
+                 possible, the ratio of volume of the element to the sum
+                 of squares of edges put into a dimensionless form is
+                 adopted to judge the quality of a tetrahedron element.
+                 The quality of the finite element mesh can thus be
+                 ensured if the shape of each tetrahedron element is
+                 carefully controlled in the mesh construction process.
+                 Through the study of numerous examples of various
+                 characteristics, it is found that high-quality
+                 tetrahedron element meshes are obtained by the proposed
+                 algorithm. (Author abstract) 24 Refs."
 }
 
 @inproceedings{ltc-pafaq-95
-, author =	"Randy Lober and Timothy J. Tautges and Rich A. Cairncross"
-, title =	"The Parallelization of an Advancing-front, All-quadrilateral Meshing Algorithm for Adaptive Analysis"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"59--71"
-, update =	"96.01 samitchell"
+, author =      "Randy Lober and Timothy J. Tautges and Rich A. Cairncross"
+, title =       "The Parallelization of an Advancing-front, All-quadrilateral Meshing Algorithm for Adaptive Analysis"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "59--71"
+, update =      "96.01 samitchell"
 }
 
 @book{l-bc-61
-, author =	"E. Lockwood"
-, booktitle =	"A Book of Curves"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge, UK"
-, year =	1961
-, update =	"95.09 agarwal"
+, author =      "E. Lockwood"
+, booktitle =   "A Book of Curves"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge, UK"
+, year =        1961
+, update =      "95.09 agarwal"
 }
 
 @article{l-tpst-90
-, author =	"M. Loczkovich"
-, title =	"Tilings of polygons with similar triangles"
-, journal =	"Combinatorica"
-, volume =	10
-, year =	1990
-, pages =	"281--306"
+, author =      "M. Loczkovich"
+, title =       "Tilings of polygons with similar triangles"
+, journal =     "Combinatorica"
+, volume =      10
+, year =        1990
+, pages =       "281--306"
 }
 
 @article{llmp-tddo1-79
-, author =	"E. Lodi and F. Luccio and C. Mugnai and L. Pagli"
-, title =	"On two-dimensional data organization, {Part} {I}"
-, journal =	"Fundam. Inform."
-, volume =	2
-, year =	1979
-, pages =	"211--226"
-, update =	"97.11 bibrelex"
+, author =      "E. Lodi and F. Luccio and C. Mugnai and L. Pagli"
+, title =       "On two-dimensional data organization, {Part} {I}"
+, journal =     "Fundam. Inform."
+, volume =      2
+, year =        1979
+, pages =       "211--226"
+, update =      "97.11 bibrelex"
 }
 
 @article{lp-vsvsv-86
-, author =	"E. Lodi and L. Pagli"
-, title =	"A {VLSI} Solution to the Vertical Segment Visibility Problem"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-35"
-, number =	10
-, year =	1986
-, pages =	"923--928"
-, update =	"93.09 held"
+, author =      "E. Lodi and L. Pagli"
+, title =       "A {VLSI} Solution to the Vertical Segment Visibility Problem"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-35"
+, number =      10
+, year =        1986
+, pages =       "923--928"
+, update =      "93.09 held"
 }
 
 @book{l-ssthc-76
-, author =	"A. L. Loeb"
-, title =	"Space Structures, their Harmony and Counterpoint"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1976
+, author =      "A. L. Loeb"
+, title =       "Space Structures, their Harmony and Counterpoint"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1976
 }
 
 @inproceedings{lhss-96
-, author =	"Jes{\'u}s A. de Loera and Serkan Ho{\c s}ten and Francisco Santos and Bernd Sturmfels"
-, title =	"The Polytope of all Triangulations of a Point Configuration"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"21--24"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Jes{\'u}s A. de Loera and Serkan Ho{\c s}ten and Francisco Santos and Bernd Sturmfels"
+, title =       "The Polytope of all Triangulations of a Point Configuration"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "21--24"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @techreport{l-crtpc-94
-, author =	"J. de Loera"
-, title =	"Computing Regular Traiangulations of Point Configurations"
-, type =	"Preprint"
-, year =	1994
-, update =	"97.11 bibrelex"
+, author =      "J. de Loera"
+, title =       "Computing Regular Traiangulations of Point Configurations"
+, type =        "Preprint"
+, year =        1994
+, update =      "97.11 bibrelex"
 }
 
 @article{lst-gbtsh-95
-, author =	"J. de Loera and B. Sturmfels and R. Thomas"
-, title =	"Gr{\"o}bner bases and triangulation of the second hypersimplex"
-, journal =	"Combinatorica"
-, volume =	15
-, number =	3
-, year =	1995
-, pages =	"409--424"
-, update =	"97.11 bibrelex, 95.05 orourke"
+, author =      "J. de Loera and B. Sturmfels and R. Thomas"
+, title =       "Gr{\"o}bner bases and triangulation of the second hypersimplex"
+, journal =     "Combinatorica"
+, volume =      15
+, number =      3
+, year =        1995
+, pages =       "409--424"
+, update =      "97.11 bibrelex, 95.05 orourke"
 }
 
 @techreport{lmtw-vbrtc-97
-, author =	"I. P. Logan and W. A. McNeely and J. J. Troy and D. P. Wills"
-, title =	"Voxel Based Real-Time Collision Detection"
-, type =	"Manuscript"
-, institution =	"Univ. Hull"
-, year =	1997
-, keywords =	"intersection detection, collision detection, voxels, haptics"
-, update =	"98.03 mitchell"
+, author =      "I. P. Logan and W. A. McNeely and J. J. Troy and D. P. Wills"
+, title =       "Voxel Based Real-Time Collision Detection"
+, type =        "Manuscript"
+, institution = "Univ. Hull"
+, year =        1997
+, keywords =    "intersection detection, collision detection, voxels, haptics"
+, update =      "98.03 mitchell"
 }
 
 @article{ls-mtoap-83
-, author =	"A. W. Lohman and N. Sreibl"
-, title =	"Map transformation by optical anamorphic processing"
-, journal =	"Appl. Optics"
-, volume =	22
-, number =	6
-, year =	1983
-, pages =	"780--783"
-, update =	"97.11 bibrelex"
+, author =      "A. W. Lohman and N. Sreibl"
+, title =       "Map transformation by optical anamorphic processing"
+, journal =     "Appl. Optics"
+, volume =      22
+, number =      6
+, year =        1983
+, pages =       "780--783"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{l-sgdd-95
-, author =	"Rainald Lohner"
-, title =	"Surface Gridding from Discrete Data"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"29--45"
-, update =	"96.01 samitchell"
+, author =      "Rainald Lohner"
+, title =       "Surface Gridding from Discrete Data"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "29--45"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{lp-gtdug-88
-, author =	"Rainald Lohner and Paresh Parikh"
-, title =	"Generation of three-dimensional unstructured grids by the advancing-front method"
-, booktitle =	"AIAA 26th Aerospace Sciences Meeting"
-, month =	jan
-, year =	1988
-, note =	"AIAA Paper AIAA-88-0515"
-, update =	"98.11 bibrelex"
+, author =      "Rainald Lohner and Paresh Parikh"
+, title =       "Generation of three-dimensional unstructured grids by the advancing-front method"
+, booktitle =   "AIAA 26th Aerospace Sciences Meeting"
+, month =       jan
+, year =        1988
+, note =        "AIAA Paper AIAA-88-0515"
+, update =      "98.11 bibrelex"
 }
 
 @article{l-tsas-64
-, author =	"S. Lojasiewicz"
-, title =	"Triangulation of semi-analytic sets"
-, journal =	"Annali della Scuola Normale Superiore de Pisa, Annali Scienze, Fisiche i Mathimatische Serie III"
-, volume =	18
-, year =	1964
-, pages =	"449--474"
-, update =	"98.07 bibrelex"
+, author =      "S. Lojasiewicz"
+, title =       "Triangulation of semi-analytic sets"
+, journal =     "Annali della Scuola Normale Superiore de Pisa, Annali Scienze, Fisiche i Mathimatische Serie III"
+, volume =      18
+, year =        1964
+, pages =       "449--474"
+, update =      "98.07 bibrelex"
 }
 
 @article{ls-htmim-90
-, author =	"D. B. Lomet and B. Salzberg"
-, title =	"The h{B}-tree: {A} multiattribute indexing method with good guaranteed performance"
-, journal =	"ACM Trans. Database Syst."
-, volume =	15
-, year =	1990
-, pages =	"625--658"
-, update =	"97.07 agarwal"
+, author =      "D. B. Lomet and B. Salzberg"
+, title =       "The h{B}-tree: {A} multiattribute indexing method with good guaranteed performance"
+, journal =     "ACM Trans. Database Syst."
+, volume =      15
+, year =        1990
+, pages =       "625--658"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{l-ccm-94
-, author =	"M. J. Longtin"
-, title =	"Cover and concealment in {ModSAF}"
-, booktitle =	"Proc. 4th Conf. on Computer Generated Forces and Behavioral Representation"
-, year =	1994
-, pages =	"239--247"
-, update =	"98.07 bibrelex"
+, author =      "M. J. Longtin"
+, title =       "Cover and concealment in {ModSAF}"
+, booktitle =   "Proc. 4th Conf. on Computer Generated Forces and Behavioral Representation"
+, year =        1994
+, pages =       "239--247"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{lm-crm-95
-, author =	"M. J. Longtin and D. Megherbi"
-, title =	"Concealed routes in {ModSAF}"
-, booktitle =	"Proc. 5th Conf. on Computer Generated Forces and Behavioral Representation"
-, year =	1995
-, pages =	"305--313"
-, update =	"98.07 bibrelex"
+, author =      "M. J. Longtin and D. Megherbi"
+, title =       "Concealed routes in {ModSAF}"
+, booktitle =   "Proc. 5th Conf. on Computer Generated Forces and Behavioral Representation"
+, year =        1995
+, pages =       "305--313"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{l-cae-83
-, author =	"R. Loos"
-, title =	"Computing in algebraic extensions"
-, editor =	"B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
-, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
-, publisher =	"Springer-Verlag"
-, year =	1983
-, pages =	"173--187"
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "R. Loos"
+, title =       "Computing in algebraic extensions"
+, editor =      "B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
+, booktitle =   "Computer Algebra: Symbolic and Algebraic Computation"
+, publisher =   "Springer-Verlag"
+, year =        1983
+, pages =       "173--187"
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @incollection{l-gprs-83
-, author =	"R. Loos"
-, title =	"Generalized Polynomial Remainder Sequences"
-, editor =	"B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
-, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
-, publisher =	"Springer-Verlag"
-, address =	"Wien"
-, year =	1983
-, pages =	"115--137"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 97.11 bibrelex"
+, author =      "R. Loos"
+, title =       "Generalized Polynomial Remainder Sequences"
+, editor =      "B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
+, booktitle =   "Computer Algebra: Symbolic and Algebraic Computation"
+, publisher =   "Springer-Verlag"
+, address =     "Wien"
+, year =        1983
+, pages =       "115--137"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{l-cv-93
-, author =	"Jes{\'u}s Garc{\'\i}a L{\'o}pez and Pedro Ramos-Alonso"
-, title =	"Circular Visibility"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"61--65"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Jes{\'u}s Garc{\'\i}a L{\'o}pez and Pedro Ramos-Alonso"
+, title =       "Circular Visibility"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "61--65"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @article{lm-edpls-96
-, author =	"Mario Lopez and Dinesh Mehta"
-, title =	"Efficient decomposition of polygons into {L}-shapes with applications to {VLSI} layouts"
-, journal =	"ACM Trans. Design. Autom. Electr. Syst."
-, volume =	1
-, number =	3
-, year =	1996
-, pages =	"371--395"
-, update =	"97.11 orourke"
+, author =      "Mario Lopez and Dinesh Mehta"
+, title =       "Efficient decomposition of polygons into {L}-shapes with applications to {VLSI} layouts"
+, journal =     "ACM Trans. Design. Autom. Electr. Syst."
+, volume =      1
+, number =      3
+, year =        1996
+, pages =       "371--395"
+, update =      "97.11 orourke"
 }
 
 @article{lr-eacp-00
-, author =	"M. A. Lopez and S. Reisner"
-, title =	"Efficient approximation of convex polygons"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, year =	2000
-, pages =	"445--452"
-, update =	"01.04 smid"
+, author =      "M. A. Lopez and S. Reisner"
+, title =       "Efficient approximation of convex polygons"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, year =        2000
+, pages =       "445--452"
+, update =      "01.04 smid"
 }
 
 @phdthesis{l-oltsb-96
-, author =	"A. L{\'o}pez-Ortiz"
-, title =	"On-line target searching in bounded and unbounded domains"
-, school =	"Univ. Waterloo"
-, address =	"Waterloo, Canada"
-, year =	1996
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex+icking"
+, author =      "A. L{\'o}pez-Ortiz"
+, title =       "On-line target searching in bounded and unbounded domains"
+, school =      "Univ. Waterloo"
+, address =     "Waterloo, Canada"
+, year =        1996
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex+icking"
 }
 
 @inproceedings{ls-gsr-96
-, author =	"A. L{\'o}pez-Ortiz and S. Schuierer"
-, title =	"Generalized streets revisited"
-, booktitle =	"Proc. 4th Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1136
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"546--558"
-, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 smid"
+, author =      "A. L{\'o}pez-Ortiz and S. Schuierer"
+, title =       "Generalized streets revisited"
+, booktitle =   "Proc. 4th Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1136
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "546--558"
+, update =      "98.11 bibrelex, 98.03 mitchell, 97.03 smid"
 }
 
 @techreport{ls-ghtun-94
-, author =	"A. L{\'o}pez-Ortiz and S. Schuierer"
-, title =	"Going home through an unknown neighbourhood"
-, type =	"Technical {Report}"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, address =	"Waterloo, Canada"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "A. L{\'o}pez-Ortiz and S. Schuierer"
+, title =       "Going home through an unknown neighbourhood"
+, type =        "Technical {Report}"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, address =     "Waterloo, Canada"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ls-ghtus-95
-, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
-, title =	"Going Home Through an Unknown Street"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"135--146"
-, isbn =	"3-540-60220-8"
-, update =	"99.07 bibrelex, 98.07 icking, 98.03 icking+mitchell, 95.05 mitchell"
+, author =      "Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
+, title =       "Going Home Through an Unknown Street"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "135--146"
+, isbn =        "3-540-60220-8"
+, update =      "99.07 bibrelex, 98.07 icking, 98.03 icking+mitchell, 95.05 mitchell"
 }
 
 @misc{ls-lbsgs-98
-, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
-, title =	"Lower Bounds for Searching on Generalized Streets"
-, howpublished =	"University of New Brunswick, Canada"
-, year =	1998
-, update =	"00.03 bibrelex"
+, author =      "Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
+, title =       "Lower Bounds for Searching on Generalized Streets"
+, howpublished =        "University of New Brunswick, Canada"
+, year =        1998
+, update =      "00.03 bibrelex"
 }
 
 @article{ls-lbsgs-01
-, author =	"A. L{\'o}pez-Ortiz and S. Schuierer"
-, title =	"Lower bounds for streets and generalized streets"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"401--421"
-, update =	"01.11 smid"
+, author =      "A. L{\'o}pez-Ortiz and S. Schuierer"
+, title =       "Lower bounds for streets and generalized streets"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "401--421"
+, update =      "01.11 smid"
 }
 
 @inproceedings{ls-pinos-97
-, author =	"A. L{\'o}pez-Ortiz and S. Schuierer"
-, title =	"Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"445--447"
-, precedes =	"ls-pinos-97b"
-, cites =	"bcr-sp-93, dhs-cspbg-95, di-csgs-94, g-sg-80, ik-skpcs-95, k-wusbd-92, k-olssp-94, l-oltsb-96, ls-ghtus-95, ls-gsr-96, ls-wsf-96, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "A. L{\'o}pez-Ortiz and S. Schuierer"
+, title =       "Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "445--447"
+, precedes =    "ls-pinos-97b"
+, cites =       "bcr-sp-93, dhs-cspbg-95, di-csgs-94, g-sg-80, ik-skpcs-95, k-wusbd-92, k-olssp-94, l-oltsb-96, ls-ghtus-95, ls-gsr-96, ls-wsf-96, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @inproceedings{ls-pinos-97b
-, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
-, title =	"Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons"
-, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
-, nickname =	"WADS '97"
-, site =	"Halifax, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1272
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"284--296"
-, update =	"99.07 bibrelex, 98.03 mitchell"
+, author =      "Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
+, title =       "Position-Independent Near Optimal Searching and On-line Recognition in Star Polygons"
+, booktitle =   "Proc. 5th Workshop Algorithms Data Struct."
+, nickname =    "WADS '97"
+, site =        "Halifax, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1272
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "284--296"
+, update =      "99.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{ls-serst-95
-, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
-, title =	"Simple, Efficient and Robust Strategies to Traverse Streets"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"217--222"
-, update =	"95.09 jones"
+, author =      "Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
+, title =       "Simple, Efficient and Robust Strategies to Traverse Streets"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "217--222"
+, update =      "95.09 jones"
 }
 
 @techreport{ls-ecesc-98
-, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
-, title =	"The Exact Cost of Exploring Streets with {CAB}"
-, type =	"Technical Report"
-, institution =	"Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
-, year =	1998
-, update =	"00.03 bibrelex"
+, author =      "Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
+, title =       "The Exact Cost of Exploring Streets with {CAB}"
+, type =        "Technical Report"
+, institution = "Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
+, year =        1998
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{ls-ussmr-98
-, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
-, title =	"The Ultimate Strategy to Search on $m$ Rays?"
-, booktitle =	"Proc. 4th Ann. Internat. Conf. Computing and Combinatorics"
-, nickname =	"COCOON '98"
-, site =	"Taipei, Taiwan"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1449
-, publisher =	"Springer-Verlag"
-, year =	1998
-, update =	"99.11 bibrelex"
+, author =      "Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
+, title =       "The Ultimate Strategy to Search on $m$ Rays?"
+, booktitle =   "Proc. 4th Ann. Internat. Conf. Computing and Combinatorics"
+, nickname =    "COCOON '98"
+, site =        "Taipei, Taiwan"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1449
+, publisher =   "Springer-Verlag"
+, year =        1998
+, update =      "99.11 bibrelex"
 }
 
 @inproceedings{ls-wsf-96
-, author =	"Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
-, title =	"Walking Streets Faster"
-, booktitle =	"Proc. 5th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '96"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1097
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"345--356"
-, isbn =	"3-540-61422-2"
-, update =	"98.07 icking, 98.03 mitchell"
+, author =      "Alejandro L{\'o}pez-Ortiz and Sven Schuierer"
+, title =       "Walking Streets Faster"
+, booktitle =   "Proc. 5th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '96"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1097
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "345--356"
+, isbn =        "3-540-61422-2"
+, update =      "98.07 icking, 98.03 mitchell"
 }
 
 @article{lc-mchr3-87
-, author =	"W. Lorensen and H. Cline"
-, title =	"Marching cubes: a high resolution 3d surface construction algorithm"
-, journal =	"Comput. Graph."
-, volume =	21
-, number =	4
-, year =	1987
-, pages =	"163--170"
-, update =	"98.11 devillers, 97.11 bibrelex"
+, author =      "W. Lorensen and H. Cline"
+, title =       "Marching cubes: a high resolution 3d surface construction algorithm"
+, journal =     "Comput. Graph."
+, volume =      21
+, number =      4
+, year =        1987
+, pages =       "163--170"
+, update =      "98.11 devillers, 97.11 bibrelex"
 }
 
 @book{l-cw-83
-, author =	"M. Lothaire"
-, title =	"Combinatorics on Words"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1983
-, update =	"98.07 bibrelex"
+, author =      "M. Lothaire"
+, title =       "Combinatorics on Words"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1983
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{lsl-oamtc-90
-, author =	"R. D. Lou and M. Sarrafzadeh and D. T. Lee"
-, title =	"An optimal algorithm for the maximum two-chain problem"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"149--158"
+, author =      "R. D. Lou and M. Sarrafzadeh and D. T. Lee"
+, title =       "An optimal algorithm for the maximum two-chain problem"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "149--158"
 }
 
 @article{l-sdrtc-96
-, author =	"Michael C. Loui and others"
-, title =	"Strategic Directions in Research in Theory of Computing"
-, journal =	"ACM Comput. Surv."
-, volume =	28
-, number =	4
-, year =	1996
-, pages =	"575--590"
-, url =	"http://geisel.csl.uiuc.edu/~loui/complete.html"
-, update =	"98.07 tamassia+vismara, 97.03 tamassia"
+, author =      "Michael C. Loui and others"
+, title =       "Strategic Directions in Research in Theory of Computing"
+, journal =     "ACM Comput. Surv."
+, volume =      28
+, number =      4
+, year =        1996
+, pages =       "575--590"
+, url = "http://geisel.csl.uiuc.edu/~loui/complete.html"
+, update =      "98.07 tamassia+vismara, 97.03 tamassia"
 }
 
 @article{ldw-masat-97
-, author =	"M. Lounsbery and T. D. DeRose and J. Warren"
-, title =	"Multiresolution Analysis for Surfaces of Arbitrary Topological Type"
-, journal =	"ACM Trans. Graph."
-, volume =	16
-, number =	1
-, month =	jan
-, year =	1997
-, pages =	"34--73"
-, update =	"97.11 held"
+, author =      "M. Lounsbery and T. D. DeRose and J. Warren"
+, title =       "Multiresolution Analysis for Surfaces of Arbitrary Topological Type"
+, journal =     "ACM Trans. Graph."
+, volume =      16
+, number =      1
+, month =       jan
+, year =        1997
+, pages =       "34--73"
+, update =      "97.11 held"
 }
 
 @article{l-tdoad-91
-, author =	"A. Louri"
-, title =	"Three-dimensional optical architecture and data-parallel algorithms for massively parallel computing"
-, journal =	"IEEE Micro"
-, volume =	"??"
-, month =	apr
-, year =	1991
-, pages =	"24--81"
-, update =	"98.03 bibrelex"
+, author =      "A. Louri"
+, title =       "Three-dimensional optical architecture and data-parallel algorithms for massively parallel computing"
+, journal =     "IEEE Micro"
+, volume =      "??"
+, month =       apr
+, year =        1991
+, pages =       "24--81"
+, update =      "98.03 bibrelex"
 }
 
 @article{l-shlpc-70
-, author =	"P. P. Loutrel"
-, title =	"A solution to the hidden-line problem for computer drawn polyhedra"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-19"
-, year =	1970
-, pages =	"205--213"
+, author =      "P. P. Loutrel"
+, title =       "A solution to the hidden-line problem for computer drawn polyhedra"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-19"
+, year =        1970
+, pages =       "205--213"
 }
 
 @book{l-atngc-86
-, author =	"L. Lovasz"
-, title =	"An Algorithmic Theory of Numbers, Graphs, and Convexity"
-, series =	"CBMS-NSF Regional Conference Series in Applied Mathematics"
-, publisher =	"Society of Industrial and Applied Mathematicians"
-, address =	"Philadelphia, PA"
-, year =	1986
-, update =	"98.11 bibrelex"
+, author =      "L. Lovasz"
+, title =       "An Algorithmic Theory of Numbers, Graphs, and Convexity"
+, series =      "CBMS-NSF Regional Conference Series in Applied Mathematics"
+, publisher =   "Society of Industrial and Applied Mathematicians"
+, address =     "Philadelphia, PA"
+, year =        1986
+, update =      "98.11 bibrelex"
 }
 
 @book{l-cpe-79
-, author =	"L. Lov{\'a}sz"
-, title =	"Combinatorial Problems and Exercises"
-, publisher =	"North-Holland"
-, year =	1979
-, update =	"97.11 bibrelex"
+, author =      "L. Lov{\'a}sz"
+, title =       "Combinatorial Problems and Exercises"
+, publisher =   "North-Holland"
+, year =        1979
+, update =      "97.11 bibrelex"
 }
 
 @incollection{l-ccs-90
-, author =	"L. Lov{\`a}sz"
-, title =	"Communication complexity: {A} survey"
-, booktitle =	"Paths, Flows, and VLSI Layout"
-, series =	"Algorithms and Combinatorics"
-, volume =	9
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"235--265"
-, update =	"98.03 bibrelex"
+, author =      "L. Lov{\`a}sz"
+, title =       "Communication complexity: {A} survey"
+, booktitle =   "Paths, Flows, and VLSI Layout"
+, series =      "Algorithms and Combinatorics"
+, volume =      9
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "235--265"
+, update =      "98.03 bibrelex"
 }
 
 @article{l-nhl-71
-, author =	"L. Lov{\'a}sz"
-, title =	"On the number of halving lines"
-, journal =	"Annal. Univ. Scie. Budapest. de Rolando E{\"o}tv{\"o}s Nominatae, Sectio Math."
-, volume =	14
-, year =	1971
-, pages =	"107--108"
-, update =	"95.09 agarwal"
+, author =      "L. Lov{\'a}sz"
+, title =       "On the number of halving lines"
+, journal =     "Annal. Univ. Scie. Budapest. de Rolando E{\"o}tv{\"o}s Nominatae, Sectio Math."
+, volume =      14
+, year =        1971
+, pages =       "107--108"
+, update =      "95.09 agarwal"
 }
 
 @article{l-roifc-75
-, author =	"L. Lov{\'a}sz"
-, title =	"On the ratio of optimal integral and fractional covers"
-, journal =	"Discrete Math."
-, volume =	13
-, year =	1975
-, pages =	"383--390"
-, keywords =	"approximation"
+, author =      "L. Lov{\'a}sz"
+, title =       "On the ratio of optimal integral and fractional covers"
+, journal =     "Discrete Math."
+, volume =      13
+, year =        1975
+, pages =       "383--390"
+, keywords =    "approximation"
 }
 
 @inproceedings{lps-ctc-95
-, author =	"L{\'a}szl{\'o} Lov{\'a}sz and J{\'a}nos Pach and Mario Szegedy"
-, title =	"On Conway's Thrackle Conjecture"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"147--151"
-, keywords =	""
-, cites =	"bf-lamcp-88, b-siec-69, be-cp-48, dett-adgab-94, fs-lda1-35, f-edpsp-40, gj-cninc-83, g-lsh-75, g-tsdg-93, g-cng-72, hp-an1-34, kst-pkz-54, lst-gbtsh-95, pa-cg-95, prs-crtcs-94, prs-pnmcs-91, rsp-sbmc-91, t-nw-77, t-ttcn-70, wb-tgt-78, w-td-69, w-op-72, ZZZ"
-, update =	"98.03 bibrelex, 97.11 icking, 95.09 mitchell"
+, author =      "L{\'a}szl{\'o} Lov{\'a}sz and J{\'a}nos Pach and Mario Szegedy"
+, title =       "On Conway's Thrackle Conjecture"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "147--151"
+, keywords =    ""
+, cites =       "bf-lamcp-88, b-siec-69, be-cp-48, dett-adgab-94, fs-lda1-35, f-edpsp-40, gj-cninc-83, g-lsh-75, g-tsdg-93, g-cng-72, hp-an1-34, kst-pkz-54, lst-gbtsh-95, pa-cg-95, prs-crtcs-94, prs-pnmcs-91, rsp-sbmc-91, t-nw-77, t-ttcn-70, wb-tgt-78, w-td-69, w-op-72, ZZZ"
+, update =      "98.03 bibrelex, 97.11 icking, 95.09 mitchell"
 }
 
 @book{lp-mt-86
-, author =	"L. Lovasz and M. D. Plummer"
-, title =	"Matching Theory"
-, series =	"Ann. Discrete Math."
-, volume =	29
-, publisher =	"North-Holland"
-, year =	1986
-, update =	"96.09 devillers, 95.01 tamassia"
+, author =      "L. Lovasz and M. D. Plummer"
+, title =       "Matching Theory"
+, series =      "Ann. Discrete Math."
+, volume =      29
+, publisher =   "North-Holland"
+, year =        1986
+, update =      "96.09 devillers, 95.01 tamassia"
 }
 
 @techreport{ls-gbra-92
-, author =	"L. Lovasz and H. E. Scarf"
-, title =	"The Generalized Basis Reduction Algorithm"
-, type =	"Cowles Foundation Paper"
-, number =	818
-, institution =	"Yale University"
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "L. Lovasz and H. E. Scarf"
+, title =       "The Generalized Basis Reduction Algorithm"
+, type =        "Cowles Foundation Paper"
+, number =      818
+, institution = "Yale University"
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ls-mrmci-90
-, author =	"L. Lov{\'a}sz and M. Siminovits"
-, title =	"The mixing rate of {Markov} chains, an isoperimetric inequality, and computing the volume"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"346--354"
-, keywords =	"approximation, volume, convex"
+, author =      "L. Lov{\'a}sz and M. Siminovits"
+, title =       "The mixing rate of {Markov} chains, an isoperimetric inequality, and computing the volume"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "346--354"
+, keywords =    "approximation, volume, convex"
 }
 
 @inproceedings{ls-rcvd-92
-, author =	"L. Lov{\'a}sz and M. Simonovits"
-, title =	"On the randomized complexity of volume and diameter"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"482--492"
+, author =      "L. Lov{\'a}sz and M. Simonovits"
+, title =       "On the randomized complexity of volume and diameter"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "482--492"
 }
 
 @article{ly-grp-82
-, author =	"L. Lovasz and Y. Yemini"
-, title =	"On generic rigidity in the plane"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	3
-, year =	1982
-, pages =	"91--98"
-, update =	"98.11 bibrelex"
+, author =      "L. Lovasz and Y. Yemini"
+, title =       "On generic rigidity in the plane"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      3
+, year =        1982
+, pages =       "91--98"
+, update =      "98.11 bibrelex"
 }
 
 @article{llw-rbceg-88
-, author =	"N. Linial L. Lovasz and A. Wigderson"
-, title =	"Rubber Bands, Convex Embeddings and Graph Connectivity"
-, journal =	"Combinatorica"
-, volume =	8
-, year =	1988
-, pages =	"91--102"
-, update =	"95.09 tamassia"
+, author =      "N. Linial L. Lovasz and A. Wigderson"
+, title =       "Rubber Bands, Convex Embeddings and Graph Connectivity"
+, journal =     "Combinatorica"
+, volume =      8
+, year =        1988
+, pages =       "91--102"
+, update =      "95.09 tamassia"
 }
 
 @incollection{l-pg-83
-, author =	"L. Lov{\'a}z"
-, title =	"Perfect Graphs"
-, editor =	"L. W. Beineke and R. J. Wilson"
-, booktitle =	"Selected Topics in Graph Theory"
-, volume =	2
-, publisher =	"Academic Press"
-, address =	"London, UK"
-, year =	1983
-, pages =	"55--85"
-, update =	"98.03 bibrelex"
+, author =      "L. Lov{\'a}z"
+, title =       "Perfect Graphs"
+, editor =      "L. W. Beineke and R. J. Wilson"
+, booktitle =   "Selected Topics in Graph Theory"
+, volume =      2
+, publisher =   "Academic Press"
+, address =     "London, UK"
+, year =        1983
+, pages =       "55--85"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{l-tdors-86
-, author =	"D. G. Lowe"
-, title =	"Three-dimensional object recognition from single two-dimensional images"
-, type =	"Report"
-, number =	202
-, institution =	"Comput. Sci. Div., New York Univ."
-, address =	"New York, NY"
-, year =	1986
+, author =      "D. G. Lowe"
+, title =       "Three-dimensional object recognition from single two-dimensional images"
+, type =        "Report"
+, number =      202
+, institution = "Comput. Sci. Div., New York Univ."
+, address =     "New York, NY"
+, year =        1986
 }
 
 @techreport{l-smpag-86
-, author =	"T. Lozano-P{\'e}rez"
-, title =	"A simple motion planning algorithm for general robot manipulators"
-, type =	"Technical {Report}"
-, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "T. Lozano-P{\'e}rez"
+, title =       "A simple motion planning algorithm for general robot manipulators"
+, type =        "Technical {Report}"
+, institution = "Artif. Intell. Lab., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{l-smpag-87
-, author =	"T. Lozano-P{\'e}rez"
-, title =	"A simple motion planning algorithm for general robot manipulators"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	"RA-3"
-, number =	3
-, year =	1987
-, pages =	"224--238"
-, update =	"02.03 orourke"
+, author =      "T. Lozano-P{\'e}rez"
+, title =       "A simple motion planning algorithm for general robot manipulators"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      "RA-3"
+, number =      3
+, year =        1987
+, pages =       "224--238"
+, update =      "02.03 orourke"
 }
 
 @article{l-apmtm-81
-, author =	"T. Lozano-P{\'e}rez"
-, title =	"Automatic planning of manipulator transfer movements"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	"SMC-11"
-, number =	10
-, year =	1981
-, pages =	"681--698"
+, author =      "T. Lozano-P{\'e}rez"
+, title =       "Automatic planning of manipulator transfer movements"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      "SMC-11"
+, number =      10
+, year =        1981
+, pages =       "681--698"
 }
 
 @inproceedings{l-rp-83
-, author =	"T. Lozano-P{\'e}rez"
-, title =	"Robot programming"
-, booktitle =	"IEEE Poceedings"
-, year =	1983
-, update =	"98.03 bibrelex"
+, author =      "T. Lozano-P{\'e}rez"
+, title =       "Robot programming"
+, booktitle =   "IEEE Poceedings"
+, year =        1983
+, update =      "98.03 bibrelex"
 }
 
 @article{l-spcsa-83
-, author =	"T. Lozano-P{\'e}rez"
-, title =	"Spatial planning: {A} configuration space approach"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-32"
-, year =	1983
-, pages =	"108--120"
+, author =      "T. Lozano-P{\'e}rez"
+, title =       "Spatial planning: {A} configuration space approach"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-32"
+, year =        1983
+, pages =       "108--120"
 }
 
 @article{lmt-asfms-84
-, author =	"T. Lozano-P{\'e}rez and M. T. Mason and R. Taylor"
-, title =	"Automatic Synthesis of Fine-Motion Strategies for Robots"
-, journal =	"Internat. J. Robot. Res."
-, volume =	3
-, number =	1
-, year =	1984
-, update =	"93.09 milone+mitchell"
+, author =      "T. Lozano-P{\'e}rez and M. T. Mason and R. Taylor"
+, title =       "Automatic Synthesis of Fine-Motion Strategies for Robots"
+, journal =     "Internat. J. Robot. Res."
+, volume =      3
+, number =      1
+, year =        1984
+, update =      "93.09 milone+mitchell"
 }
 
 @article{lw-apcfp-79
-, author =	"T. Lozano-P{\'e}rez and M. A. Wesley"
-, title =	"An algorithm for planning collision-free paths among polyhedral obstacles"
-, journal =	"Commun. ACM"
-, volume =	22
-, number =	10
-, year =	1979
-, pages =	"560--570"
-, update =	"98.11 bibrelex"
+, author =      "T. Lozano-P{\'e}rez and M. A. Wesley"
+, title =       "An algorithm for planning collision-free paths among polyhedral obstacles"
+, journal =     "Commun. ACM"
+, volume =      22
+, number =      10
+, year =        1979
+, pages =       "560--570"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{l-cvdmc-85
-, author =	"M. Lu"
-, title =	"Constructing the {Voronoi} diagram on a mesh-connected computer"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, year =	1985
-, pages =	"806--811"
-, update =	"98.07 bibrelex"
+, author =      "M. Lu"
+, title =       "Constructing the {Voronoi} diagram on a mesh-connected computer"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, year =        1985
+, pages =       "806--811"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{l-dprcq-85
-, author =	"A. Lubiw"
-, title =	"Decomposing polygonal regions into convex quadrilaterals"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"97--106"
-, cites =	"ahu-daca-74, cd-dpicp-79, eow-sgrag-84, f-spcwt-78, gj-cigtn-79, gjpt-tsp-78, k-dpsc-83, kkk-tgrfw-83, l-pftu-82, l-pnrh-82, lprs-meldr-, o-aprag-83, ps-dtram-80, lllmp-tddo2-79, s-oadrp-82, sh-gip-76, t-prgc-80, t-dsna-83, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "A. Lubiw"
+, title =       "Decomposing polygonal regions into convex quadrilaterals"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "97--106"
+, cites =       "ahu-daca-74, cd-dpicp-79, eow-sgrag-84, f-spcwt-78, gj-cigtn-79, gjpt-tsp-78, k-dpsc-83, kkk-tgrfw-83, l-pftu-82, l-pnrh-82, lprs-meldr-, o-aprag-83, ps-dtram-80, lllmp-tddo2-79, s-oadrp-82, sh-gip-76, t-prgc-80, t-dsna-83, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @phdthesis{l-ocopg-85
-, author =	"A. Lubiw"
-, title =	"Ordering and some Combinatorial optimization Problems with some Geometric Applications"
-, school =	"University of Waterloo"
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "A. Lubiw"
+, title =       "Ordering and some Combinatorial optimization Problems with some Geometric Applications"
+, school =      "University of Waterloo"
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{l-bbpcp-88
-, author =	"A. Lubiw"
-, title =	"The Boolean Basis Problem and how to Cover Polygons by Rectangles"
-, type =	"Manuscript"
-, institution =	"University of Waterloo"
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "A. Lubiw"
+, title =       "The Boolean Basis Problem and how to Cover Polygons by Rectangles"
+, type =        "Manuscript"
+, institution = "University of Waterloo"
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{lm-igvgs-94
-, author =	"A. Lubiw and N. Mouawad"
-, title =	"Interval Graphs as Visibility Graphs of Simple Polygons, Part I: Parachutes"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"18--23"
-, cites =	"c-vpgr-92, o-agta-87, o-cgc18-93a, ec-rvgsp-90, g-rcvgs-88, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "A. Lubiw and N. Mouawad"
+, title =       "Interval Graphs as Visibility Graphs of Simple Polygons, Part I: Parachutes"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "18--23"
+, cites =       "c-vpgr-92, o-agta-87, o-cgc18-93a, ec-rvgsp-90, g-rcvgs-88, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @techreport{lo-wcpfp-96
-, author =	"A. Lubiw and J. O'Rourke"
-, title =	"When can a polygon fold to a polytope?"
-, type =	"Technical {Report}"
-, number =	048
-, institution =	"Dept. Comput. Sci., Smith College"
-, month =	jun
-, year =	1996
-, note =	"Presented at AMS Conf., 5 Oct. 1996"
-, keywords =	"polytopes"
-, update =	"96.09 orourke"
+, author =      "A. Lubiw and J. O'Rourke"
+, title =       "When can a polygon fold to a polytope?"
+, type =        "Technical {Report}"
+, number =      048
+, institution = "Dept. Comput. Sci., Smith College"
+, month =       jun
+, year =        1996
+, note =        "Presented at AMS Conf., 5 Oct. 1996"
+, keywords =    "polytopes"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{ls-mogar-93
-, author =	"A. Lubiw and N. Sleumer"
-, title =	"Maximal outerplanar graphs are relative neighborhood graphs"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"198--203"
-, cites =	"am-rngtd-92a, bll-cpt-93t, c-psepg-92, d-rdt-90, jt-rngtr-92, ms-pggrg-80, o-agta-87, s-rngam-83, t-rngfp-80, u-spper-83, v-gng-92, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "A. Lubiw and N. Sleumer"
+, title =       "Maximal outerplanar graphs are relative neighborhood graphs"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "198--203"
+, cites =       "am-rngtd-92a, bll-cpt-93t, c-psepg-92, d-rdt-90, jt-rngtr-92, ms-pggrg-80, o-agta-87, s-rngam-83, t-rngfp-80, u-spper-83, v-gng-92, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{lps-eerc-86
-, author =	"A. Lubotzky and R. Phillips and P. Sarnak"
-, title =	"Explicit expanders and the {Ramanujan} conjectures"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"240--246"
-, precedes =	"lps-rg-88"
-, update =	"98.11 bibrelex"
+, author =      "A. Lubotzky and R. Phillips and P. Sarnak"
+, title =       "Explicit expanders and the {Ramanujan} conjectures"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "240--246"
+, precedes =    "lps-rg-88"
+, update =      "98.11 bibrelex"
 }
 
 @article{lps-rg-88
-, author =	"A. Lubotzky and R. Phillips and P. Sarnak"
-, title =	"Ramanujan graphs"
-, journal =	"Combinatorica"
-, volume =	8
-, year =	1988
-, pages =	"261--277"
-, succeeds =	"lps-eerc-86"
-, update =	"98.11 bibrelex, 95.01 matousek"
+, author =      "A. Lubotzky and R. Phillips and P. Sarnak"
+, title =       "Ramanujan graphs"
+, journal =     "Combinatorica"
+, volume =      8
+, year =        1988
+, pages =       "261--277"
+, succeeds =    "lps-eerc-86"
+, update =      "98.11 bibrelex, 95.01 matousek"
 }
 
 @inproceedings{l-spami-85
-, author =	"M. Luby"
-, title =	"A Simple Parallel Algorithm for the Maximal Independent Set Problem"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
-, year =	1985
-, pages =	"1--10"
-, update =	"98.03 bibrelex"
+, author =      "M. Luby"
+, title =       "A Simple Parallel Algorithm for the Maximal Independent Set Problem"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Theory Comput."
+, year =        1985
+, pages =       "1--10"
+, update =      "98.03 bibrelex"
 }
 
 @article{l-spami-86
-, author =	"M. Luby"
-, title =	"A simple parallel algorithm for the maximal independent set problem"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, number =	4
-, year =	1986
-, pages =	"1036--1053"
-, update =	"96.09 orourke"
+, author =      "M. Luby"
+, title =       "A simple parallel algorithm for the maximal independent set problem"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, number =      4
+, year =        1986
+, pages =       "1036--1053"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{l-rrpcw-88
-, author =	"M. Luby"
-, title =	"Removing randomness in parallel computation without a processor penalty"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"162--173"
-, update =	"96.09 orourke"
+, author =      "M. Luby"
+, title =       "Removing randomness in parallel computation without a processor penalty"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "162--173"
+, update =      "96.09 orourke"
 }
 
 @incollection{l-ggwpp-88
-, author =	"M. G. Luby"
-, title =	"Grid geometries which preserve properties of {Euclidean} geometry: a study of graphics line drawing algorithms"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"397--432"
-, update =	"99.11 bibrelex"
+, author =      "M. G. Luby"
+, title =       "Grid geometries which preserve properties of {Euclidean} geometry: a study of graphics line drawing algorithms"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "397--432"
+, update =      "99.11 bibrelex"
 }
 
 @article{l-rgbth-88
-, author =	"J. Lucas"
-, title =	"The rotation graph of binary trees is {Hamiltonian}"
-, journal =	"J. Algorithms"
-, volume =	9
-, year =	1988
-, pages =	"503--535"
-, update =	"97.11 bibrelex"
+, author =      "J. Lucas"
+, title =       "The rotation graph of binary trees is {Hamiltonian}"
+, journal =     "J. Algorithms"
+, volume =      9
+, year =        1988
+, pages =       "503--535"
+, update =      "97.11 bibrelex"
 }
 
 @article{lrr-rgbth-93
-, author =	"J. Lucas and D. {Roelants van Baronaigien} and F. Ruskey"
-, title =	"On rotations and the generation of binary trees {Hamiltonian}"
-, journal =	"J. Algorithms"
-, volume =	15
-, year =	1993
-, pages =	"343--366"
-, update =	"97.11 bibrelex"
+, author =      "J. Lucas and D. {Roelants van Baronaigien} and F. Ruskey"
+, title =       "On rotations and the generation of binary trees {Hamiltonian}"
+, journal =     "J. Algorithms"
+, volume =      15
+, year =        1993
+, pages =       "343--366"
+, update =      "97.11 bibrelex"
 }
 
 @article{lmw-nvg-87
-, author =	"F. Luccio and S. Mazzone and C. Wong"
-, title =	"A Note on Visibility Graphs"
-, journal =	"Discrete Math."
-, volume =	64
-, year =	1987
-, pages =	"209--219"
-, keywords =	"graph drawing"
-, update =	"94.01 tamassia, 93.09 tamassia"
+, author =      "F. Luccio and S. Mazzone and C. Wong"
+, title =       "A Note on Visibility Graphs"
+, journal =     "Discrete Math."
+, volume =      64
+, year =        1987
+, pages =       "209--219"
+, keywords =    "graph drawing"
+, update =      "94.01 tamassia, 93.09 tamassia"
 }
 
 @article{lp-ubrdb-89
-, author =	"F. Luccio and L. Pagli"
-, title =	"On The Upper Bound On The Rotation Distance Of Binary Trees"
-, journal =	"Inform. Process. Lett."
-, volume =	31
-, number =	2
-, month =	apr
-, year =	1989
-, pages =	"57--60"
-, keywords =	"rotation distance, binary search trees, upper bounds, tree transformation algorithm"
-, annote =	"Exhibits an algorithm to transform from one tree to
-		 another by rotations."
-, abstract =	"The rotation distance d(T//1,T//2) between two binary
-		 search trees T//1 and T//2 on n nodes is the minimum
-		 number of rotations needed to transform T//1 into T//2.
-		 D.D. Sleator, R.E. Tarjan and W.R. Thurston have proved
-		 an upper bound 2n minus 6 to d(T//1,T//2), using
-		 triangulation of polyhedra. Makinen has subsequently
-		 shown that a weaker upper bound of 2n minus 5 can be
-		 simply proved with elementary tree concepts. In this
-		 note we present a new tree transformation algorithm,
-		 leading to an elementary proof of the bound 2n minus 6.
-		 (Author abstract) 4 Refs."
+, author =      "F. Luccio and L. Pagli"
+, title =       "On The Upper Bound On The Rotation Distance Of Binary Trees"
+, journal =     "Inform. Process. Lett."
+, volume =      31
+, number =      2
+, month =       apr
+, year =        1989
+, pages =       "57--60"
+, keywords =    "rotation distance, binary search trees, upper bounds, tree transformation algorithm"
+, annote =      "Exhibits an algorithm to transform from one tree to
+                 another by rotations."
+, abstract =    "The rotation distance d(T//1,T//2) between two binary
+                 search trees T//1 and T//2 on n nodes is the minimum
+                 number of rotations needed to transform T//1 into T//2.
+                 D.D. Sleator, R.E. Tarjan and W.R. Thurston have proved
+                 an upper bound 2n minus 6 to d(T//1,T//2), using
+                 triangulation of polyhedra. Makinen has subsequently
+                 shown that a weaker upper bound of 2n minus 5 can be
+                 simply proved with elementary tree concepts. In this
+                 note we present a new tree transformation algorithm,
+                 leading to an elementary proof of the bound 2n minus 6.
+                 (Author abstract) 4 Refs."
 }
 
 @article{lpp-nsdsp-90
-, author =	"F. Luccio and A. Pietracaprina and G. Pucci"
-, title =	"A new scheme for the deterministic simulation of PRAMs in VLSI"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"529--544"
-, update =	"96.09 orourke"
+, author =      "F. Luccio and A. Pietracaprina and G. Pucci"
+, title =       "A new scheme for the deterministic simulation of PRAMs in VLSI"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "529--544"
+, update =      "96.09 orourke"
 }
 
 @article{l-srass-95
-, author =	"W. Ludwig"
-, title =	"A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem"
-, journal =	"Inform. Comput."
-, volume =	117
-, number =	1
-, year =	1995
-, pages =	"151--155"
-, update =	"97.03 gaertner+salinger"
+, author =      "W. Ludwig"
+, title =       "A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem"
+, journal =     "Inform. Comput."
+, volume =      117
+, number =      1
+, year =        1995
+, pages =       "151--155"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{le-vdsap-97
-, author =	"David Luebke and Carl Erikson"
-, title =	"View-Dependent Simplification of Arbitrary Polygonal Environments"
-, booktitle =	"Proc. SIGGRAPH '97"
-, series =	"Computer Graphics Proceedings, Annual Conference Series"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"ACM Press"
-, month =	aug
-, year =	1997
-, pages =	"199--208"
-, update =	"98.07 agarwal, 98.03 agarwal+mitchell"
+, author =      "David Luebke and Carl Erikson"
+, title =       "View-Dependent Simplification of Arbitrary Polygonal Environments"
+, booktitle =   "Proc. SIGGRAPH '97"
+, series =      "Computer Graphics Proceedings, Annual Conference Series"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "ACM Press"
+, month =       aug
+, year =        1997
+, pages =       "199--208"
+, update =      "98.07 agarwal, 98.03 agarwal+mitchell"
 }
 
 @inproceedings{lg-pmsfe-95
-, author =	"D. Luebke and C. Georges"
-, title =	"Portals and mirrors: {Simple}, fast evaluation of potentially visible sets"
-, booktitle =	"Proc. ACM Interactive 3D Graphics Conf."
-, site =	"Monterey, CA"
-, year =	1995
-, update =	"98.07 bibrelex"
+, author =      "D. Luebke and C. Georges"
+, title =       "Portals and mirrors: {Simple}, fast evaluation of potentially visible sets"
+, booktitle =   "Proc. ACM Interactive 3D Graphics Conf."
+, site =        "Monterey, CA"
+, year =        1995
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{l-dsorq-78
-, author =	"G. S. Lueker"
-, title =	"A data structure for orthogonal range queries"
-, booktitle =	"Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1978
-, pages =	"28--34"
-, precedes =	"lw-dsdrq-82"
-, update =	"97.11 bibrelex"
+, author =      "G. S. Lueker"
+, title =       "A data structure for orthogonal range queries"
+, booktitle =   "Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1978
+, pages =       "28--34"
+, precedes =    "lw-dsdrq-82"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{l-tarrc-79
-, author =	"G. S. Lueker"
-, title =	"A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems"
-, type =	"Report"
-, number =	"R129"
-, institution =	"Dept. Inform. Comput. Sci., Univ. California"
-, address =	"Irvine, CA"
-, year =	1979
+, author =      "G. S. Lueker"
+, title =       "A transformation for adding range restriction capability to dynamic data structures for decomposable searching problems"
+, type =        "Report"
+, number =      "R129"
+, institution = "Dept. Inform. Comput. Sci., Univ. California"
+, address =     "Irvine, CA"
+, year =        1979
 }
 
 @inproceedings{lmr-lptvp-86
-, author =	"G. S. Lueker and N. Megiddo and V. Ramachandran"
-, title =	"Linear programming with two variables per inequality in poly log time"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"196--205"
-, keywords =	"parallel computation, linear programming, $d$-dimensional"
-, precedes =	"lmr-lptvp-90"
+, author =      "G. S. Lueker and N. Megiddo and V. Ramachandran"
+, title =       "Linear programming with two variables per inequality in poly log time"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "196--205"
+, keywords =    "parallel computation, linear programming, $d$-dimensional"
+, precedes =    "lmr-lptvp-90"
 }
 
 @article{lmr-lptvp-90
-, author =	"G. S. Lueker and N. Megiddo and V. Ramachandran"
-, title =	"Linear programming with two variables per inequality in poly log time"
-, journal =	"SIAM J. Comput."
-, volume =	19
-, year =	1990
-, pages =	"1000--1010"
-, keywords =	"parallel computation, linear programming, $d$-dimensional"
-, succeeds =	"lmr-lptvp-86"
+, author =      "G. S. Lueker and N. Megiddo and V. Ramachandran"
+, title =       "Linear programming with two variables per inequality in poly log time"
+, journal =     "SIAM J. Comput."
+, volume =      19
+, year =        1990
+, pages =       "1000--1010"
+, keywords =    "parallel computation, linear programming, $d$-dimensional"
+, succeeds =    "lmr-lptvp-86"
 }
 
 @article{lw-dsdrq-82
-, author =	"G. S. Lueker and D. E. Willard"
-, title =	"A data structure for dynamic range queries"
-, journal =	"Inform. Process. Lett."
-, volume =	15
-, number =	5
-, year =	1982
-, pages =	"209--213"
-, succeeds =	"l-dsorq-78"
-, update =	"97.11 bibrelex"
+, author =      "G. S. Lueker and D. E. Willard"
+, title =       "A data structure for dynamic range queries"
+, journal =     "Inform. Process. Lett."
+, volume =      15
+, number =      5
+, year =        1982
+, pages =       "209--213"
+, succeeds =    "l-dsorq-78"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{l-hdspl-89
-, author =	"H. Lukatela"
-, title =	"Hipparchus data structures: {Points}, lines and regions in spherical {Voronoi} grid"
-, booktitle =	"Proc. 9th Internat. Sympos. Comput.-Assist. Cartog."
-, year =	1989
-, pages =	"164--170"
-, update =	"93.05 freimer"
+, author =      "H. Lukatela"
+, title =       "Hipparchus data structures: {Points}, lines and regions in spherical {Voronoi} grid"
+, booktitle =   "Proc. 9th Internat. Sympos. Comput.-Assist. Cartog."
+, year =        1989
+, pages =       "164--170"
+, update =      "93.05 freimer"
 }
 
 @techreport{lc-rtns-93
-, author =	"W. L. Luken and F. Cheng"
-, title =	"Rendering trimmed {NURB} surfaces"
-, type =	"Research {Report}"
-, number =	"18669 (81711)"
-, institution =	"IBM Research Division"
-, year =	1993
-, update =	"97.11 bibrelex"
+, author =      "W. L. Luken and F. Cheng"
+, title =       "Rendering trimmed {NURB} surfaces"
+, type =        "Research {Report}"
+, number =      "18669 (81711)"
+, institution = "IBM Research Division"
+, year =        1993
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{l-nrftg-99
-, author =	"T. Lukovszki"
-, title =	"New results on fault tolerant geometric spanners"
-, booktitle =	"Proc. 6th Workshop Algorithms Data Struct."
-, nickname =	"WADS '99"
-, site =	"Vancouver, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1663
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"193--204"
-, update =	"00.03 smid, 99.11 bibrelex, 99.07 smid"
+, author =      "T. Lukovszki"
+, title =       "New results on fault tolerant geometric spanners"
+, booktitle =   "Proc. 6th Workshop Algorithms Data Struct."
+, nickname =    "WADS '99"
+, site =        "Vancouver, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1663
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "193--204"
+, update =      "00.03 smid, 99.11 bibrelex, 99.07 smid"
 }
 
 @phdthesis{l-nrgst-99
-, author =	"T. Lukovszki"
-, title =	"New results on geometric spanners and their applications"
-, type =	"Ph.{D}. Thesis"
-, school =	"Department of Computer Science, University of Paderborn"
-, address =	"Paderborn, Germany"
-, year =	1999
-, keywords =	"doctoral thesis"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "T. Lukovszki"
+, title =       "New results on geometric spanners and their applications"
+, type =        "Ph.{D}. Thesis"
+, school =      "Department of Computer Science, University of Paderborn"
+, address =     "Paderborn, Germany"
+, year =        1999
+, keywords =    "doctoral thesis"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @article{l-marci-70
-, author =	"V. Y. Lum"
-, title =	"Multi-attribute retrieval with combined indexes"
-, journal =	"Commun. ACM"
-, volume =	13
-, year =	1970
-, pages =	"660--665"
+, author =      "V. Y. Lum"
+, title =       "Multi-attribute retrieval with combined indexes"
+, journal =     "Commun. ACM"
+, volume =      13
+, year =        1970
+, pages =       "660--665"
 }
 
 @article{l-dpppa-87
-, author =	"V. J. Lumelski"
-, title =	"Dynamic path planning for planar articulated robot arm moving amidst moving obstacles"
-, journal =	"Automatica"
-, volume =	"??"
-, year =	1987
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "V. J. Lumelski"
+, title =       "Dynamic path planning for planar articulated robot arm moving amidst moving obstacles"
+, journal =     "Automatica"
+, volume =      "??"
+, year =        1987
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ls-pivrn-88
-, author =	"V. Lumelsky and T. Skewis"
-, title =	"A paradigm for incorporating vision in the robot navigation function"
-, booktitle =	"Proc. 1988 IEEE Internat. Conf. Robot. Autom."
-, site =	"Philadelphia"
-, month =	apr
-, year =	1988
+, author =      "V. Lumelsky and T. Skewis"
+, title =       "A paradigm for incorporating vision in the robot navigation function"
+, booktitle =   "Proc. 1988 IEEE Internat. Conf. Robot. Autom."
+, site =        "Philadelphia"
+, month =       apr
+, year =        1988
 }
 
 @article{l-csplp-91
-, author =	"V. J. Lumelsky"
-, title =	"A Comparative Study on the Path Length Performance of Maze-Searching and Robot Motion Planning Algorithms"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	7
-, number =	1
-, year =	1991
-, pages =	"57--66"
+, author =      "V. J. Lumelsky"
+, title =       "A Comparative Study on the Path Length Performance of Maze-Searching and Robot Motion Planning Algorithms"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      7
+, number =      1
+, year =        1991
+, pages =       "57--66"
 }
 
 @article{l-acirm-87
-, author =	"V. J. Lumelsky"
-, title =	"Algorithmic and Complexity Issues of Robot Motion in an Uncertain Environment"
-, journal =	"J. Complexity"
-, volume =	3
-, year =	1987
-, pages =	"146--182"
-, update =	"96.09 devillers"
+, author =      "V. J. Lumelsky"
+, title =       "Algorithmic and Complexity Issues of Robot Motion in an Uncertain Environment"
+, journal =     "J. Complexity"
+, volume =      3
+, year =        1987
+, pages =       "146--182"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{l-aisbr-87
-, author =	"V. J. Lumelsky"
-, title =	"Algorithmic Issues of Sensor-Based Robot Motion Planning"
-, booktitle =	"Proc. 26th IEEE Conf. Decision Control"
-, year =	1987
-, pages =	"1796--1801"
-, update =	"98.03 mitchell"
+, author =      "V. J. Lumelsky"
+, title =       "Algorithmic Issues of Sensor-Based Robot Motion Planning"
+, booktitle =   "Proc. 26th IEEE Conf. Decision Control"
+, year =        1987
+, pages =       "1796--1801"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{l-cmpue-86
-, author =	"V. J. Lumelsky"
-, title =	"Continous motion planning in unknown environment for a $3$d cartesian robot arm"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1986
-, pages =	"1569--1574"
-, update =	"98.03 bibrelex"
+, author =      "V. J. Lumelsky"
+, title =       "Continous motion planning in unknown environment for a $3$d cartesian robot arm"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1986
+, pages =       "1569--1574"
+, update =      "98.03 bibrelex"
 }
 
 @article{l-ekdpp-87
-, author =	"V. J. Lumelsky"
-, title =	"Effect of Kinematics on Dynamic Path Planning for Planar Robot Arms Moving Amidst Unknown Obstacles"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	"RA-3"
-, number =	3
-, year =	1987
-, pages =	"207--223"
+, author =      "V. J. Lumelsky"
+, title =       "Effect of Kinematics on Dynamic Path Planning for Planar Robot Arms Moving Amidst Unknown Obstacles"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      "RA-3"
+, number =      3
+, year =        1987
+, pages =       "207--223"
 }
 
 @article{l-fcdbl-85
-, author =	"V. J. Lumelsky"
-, title =	"On fast computation of distance between line segments"
-, journal =	"Inform. Process. Lett."
-, volume =	21
-, year =	1985
-, pages =	"55--61"
+, author =      "V. J. Lumelsky"
+, title =       "On fast computation of distance between line segments"
+, journal =     "Inform. Process. Lett."
+, volume =      21
+, year =        1985
+, pages =       "55--61"
 }
 
 @article{lms-dppsb-90
-, author =	"V. J. Lumelsky and S. Mukhopadhyay and K. Sun"
-, title =	"Dynamic Path Planning in Sensor-Based Terrain Acquisition"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	6
-, number =	4
-, month =	aug
-, year =	1990
-, pages =	"462--472"
+, author =      "V. J. Lumelsky and S. Mukhopadhyay and K. Sun"
+, title =       "Dynamic Path Planning in Sensor-Based Terrain Acquisition"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      6
+, number =      4
+, month =       aug
+, year =        1990
+, pages =       "462--472"
 }
 
 @article{ls-irsrn-90
-, author =	"V. J. Lumelsky and T. Skewis"
-, title =	"Incorporating Range Sensing in the Robot Navigation Function"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	20
-, number =	5
-, year =	1990
-, pages =	"1058--1069"
+, author =      "V. J. Lumelsky and T. Skewis"
+, title =       "Incorporating Range Sensing in the Robot Navigation Function"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      20
+, number =      5
+, year =        1990
+, pages =       "1058--1069"
 }
 
 @article{ls-dppma-86
-, author =	"V. J. Lumelsky and A. A. Stepanov"
-, title =	"Dynamic Path Planning for a Mobile Automaton with Limited Information on the Environment"
-, journal =	"IEEE Trans. Autom. Control"
-, volume =	"AC-31"
-, year =	1986
-, pages =	"1058--1063"
+, author =      "V. J. Lumelsky and A. A. Stepanov"
+, title =       "Dynamic Path Planning for a Mobile Automaton with Limited Information on the Environment"
+, journal =     "IEEE Trans. Autom. Control"
+, volume =      "AC-31"
+, year =        1986
+, pages =       "1058--1063"
 }
 
 @article{ls-ppspm-87
-, author =	"V. J. Lumelsky and A. A. Stepanov"
-, title =	"Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"403--430"
+, author =      "V. J. Lumelsky and A. A. Stepanov"
+, title =       "Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "403--430"
 }
 
 @article{ls-ummpu-90
-, author =	"V. J. Lumelsky and K. Sun"
-, title =	"A Unified Methodology for Motion Planning with Uncertainty for 2D and 3D Two-Link Robot Arm Manipulators"
-, journal =	"Internat. J. Robot. Res."
-, volume =	9
-, number =	5
-, year =	1990
-, pages =	"89--104"
+, author =      "V. J. Lumelsky and K. Sun"
+, title =       "A Unified Methodology for Motion Planning with Uncertainty for 2D and 3D Two-Link Robot Arm Manipulators"
+, journal =     "Internat. J. Robot. Res."
+, volume =      9
+, number =      5
+, year =        1990
+, pages =       "89--104"
 }
 
 @article{ls-ppuoc-92
-, author =	"V. J. Lumelsky and K. Sun"
-, title =	"Path Planning Among Unknown Obstacles: {The} Case of a 3D Cartesian Arm"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	8
-, number =	6
-, year =	1992
-, pages =	"??"
+, author =      "V. J. Lumelsky and K. Sun"
+, title =       "Path Planning Among Unknown Obstacles: {The} Case of a 3D Cartesian Arm"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      8
+, number =      6
+, year =        1992
+, pages =       "??"
 }
 
 @inproceedings{ly-hamp-93
-, author =	"C. Lund and M. Yannakakis"
-, title =	"On the hardness of approximating minimization problems"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"286--293"
-, update =	"98.03 bibrelex"
+, author =      "C. Lund and M. Yannakakis"
+, title =       "On the hardness of approximating minimization problems"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "286--293"
+, update =      "98.03 bibrelex"
 }
 
 @article{ly-ohamp-94
-, author =	"Carsten Lund and Mihalis Yannakakis"
-, title =	"On the Hardness of Approximating Minimization Problems"
-, journal =	"J. ACM"
-, volume =	41
-, number =	5
-, year =	1994
-, pages =	"960--981"
-, update =	"98.03 agarwal"
+, author =      "Carsten Lund and Mihalis Yannakakis"
+, title =       "On the Hardness of Approximating Minimization Problems"
+, journal =     "J. ACM"
+, volume =      41
+, number =      5
+, year =        1994
+, pages =       "960--981"
+, update =      "98.03 agarwal"
 }
 
 @book{lw-tcc-69
-, author =	"A. T. Lundell and S. Weingram"
-, title =	"The topology of {CW} complexes"
-, publisher =	"Van Nostrand"
-, address =	"New York, NY"
-, year =	1969
-, update =	"98.03 bibrelex"
+, author =      "A. T. Lundell and S. Weingram"
+, title =       "The topology of {CW} complexes"
+, publisher =   "Van Nostrand"
+, address =     "New York, NY"
+, year =        1969
+, update =      "98.03 bibrelex"
 }
 
 @techreport{l-imsim-95
-, author =	"Mikael Lundquist"
-, title =	"An implementation of a method for simulating injection moulding of non-planar objects"
-, type =	"Technical {Report}"
-, number =	"LiTH-MAT-R-95-09"
-, institution =	"Link{\"o}ping University"
-, month =	oct
-, year =	1995
-, keywords =	"injection molding, continuous Dijkstra, geodesic metric, shortest paths, wavefront propagation"
-, update =	"96.05 mitchell"
+, author =      "Mikael Lundquist"
+, title =       "An implementation of a method for simulating injection moulding of non-planar objects"
+, type =        "Technical {Report}"
+, number =      "LiTH-MAT-R-95-09"
+, institution = "Link{\"o}ping University"
+, month =       oct
+, year =        1995
+, keywords =    "injection molding, continuous Dijkstra, geodesic metric, shortest paths, wavefront propagation"
+, update =      "96.05 mitchell"
 }
 
 @inproceedings{lm-pasnp-95
-, author =	"J. Luo and K. Miriyala"
-, title =	"A Practical Approach to Static Node Positioning"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"436--443"
-, keywords =	"graph drawing, placement, system"
-, update =	"95.01 tamassia"
+, author =      "J. Luo and K. Miriyala"
+, title =       "A Practical Approach to Static Node Positioning"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "436--443"
+, keywords =    "graph drawing, placement, system"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{lmy-dcsds-96
-, author =	"Robert Lupton and F. Miller Maley and Neal Young"
-, title =	"Data Collection for the {Sloan} {Digital} {Sky} {Survey} -- {A} Network-Flow Heuristic"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"296--303"
-, keywords =	"covering, capacitated covering of point sets, facility location, disk covers, sphere covers, implementation"
-, update =	"96.09 agarwal, 96.01 mitchell"
+, author =      "Robert Lupton and F. Miller Maley and Neal Young"
+, title =       "Data Collection for the {Sloan} {Digital} {Sky} {Survey} -- {A} Network-Flow Heuristic"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "296--303"
+, keywords =    "covering, capacitated covering of point sets, facility location, disk covers, sphere covers, implementation"
+, update =      "96.09 agarwal, 96.01 mitchell"
 }
 
 @inproceedings{lmk-vcpim-01
-, author =	"A. M. Lyakh and V. S. Mukhanov and R. B. Kemp"
-, title =	"The Virtual Cell Project for the Investigation of Microalgal Morphology and Dispersity of Natural Phytoplankton"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"57--58"
-, update =	"01.04 icking"
+, author =      "A. M. Lyakh and V. S. Mukhanov and R. B. Kemp"
+, title =       "The Virtual Cell Project for the Investigation of Microalgal Morphology and Dispersity of Natural Phytoplankton"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "57--58"
+, update =      "01.04 icking"
 }
 
 @incollection{l-csbsu-90
-, author =	"T. Lybrand"
-, title =	"Computer simulation of biomolecular systems using molecular dynamics and free energy perturbation methods"
-, editor =	"K. Lipkowitz and D. B. Boyd"
-, booktitle =	"Reviews in Computational Chemistry"
-, volume =	1
-, publisher =	"VCH Publishers"
-, year =	1990
-, pages =	"295--320"
-, update =	"98.07 bibrelex"
+, author =      "T. Lybrand"
+, title =       "Computer simulation of biomolecular systems using molecular dynamics and free energy perturbation methods"
+, editor =      "K. Lipkowitz and D. B. Boyd"
+, booktitle =   "Reviews in Computational Chemistry"
+, volume =      1
+, publisher =   "VCH Publishers"
+, year =        1990
+, pages =       "295--320"
+, update =      "98.07 bibrelex"
 }
 
 @article{lm-krpbc-87
-, author =	"T. Lyche and K. Morken"
-, title =	"Knot Removal for parametric B-spline curves and surfaces"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	4
-, number =	3
-, year =	1987
-, pages =	"217--230"
-, update =	"98.07 bibrelex"
+, author =      "T. Lyche and K. Morken"
+, title =       "Knot Removal for parametric B-spline curves and surfaces"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      4
+, number =      3
+, year =        1987
+, pages =       "217--230"
+, update =      "98.07 bibrelex"
 }
 
 @article{lm-spmcp-96
-, author =	"K. M. Lynch and M. T. Mason"
-, title =	"Stable pushing: {M}echanics, controllability, and planning"
-, journal =	"Internat. J. Robot. Res."
-, volume =	15
-, year =	1996
-, pages =	"533--556"
-, update =	"98.03 agarwal"
+, author =      "K. M. Lynch and M. T. Mason"
+, title =       "Stable pushing: {M}echanics, controllability, and planning"
+, journal =     "Internat. J. Robot. Res."
+, volume =      15
+, year =        1996
+, pages =       "533--556"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{l-cbagd-92
-, author =	"K. Lyons"
-, title =	"Cluster Busting in Anchored Graph Drawing"
-, booktitle =	"Proceedings of the 1992 CAS Conference"
-, year =	1992
-, pages =	"7--16"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "K. Lyons"
+, title =       "Cluster Busting in Anchored Graph Drawing"
+, booktitle =   "Proceedings of the 1992 CAS Conference"
+, year =        1992
+, pages =       "7--16"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{lmr-mpcil-90
-, author =	"K. Lyons and H. Meijer and D. Rappaport"
-, title =	"Minimum polygon covers for isothetic line segments"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1990
-, note =	"In preparation"
-, succeeds =	"lmr-mpsil-"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "K. Lyons and H. Meijer and D. Rappaport"
+, title =       "Minimum polygon covers for isothetic line segments"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1990
+, note =        "In preparation"
+, succeeds =    "lmr-mpsil-"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @mastersthesis{l-aiorp-88
-, author =	"Kelly A. Lyons"
-, title =	"An Efficient Algorithm for Identifying Objects Using Robot Probes"
-, school =	"Queen's University, Kingston"
-, month =	dec
-, year =	1988
-, keywords =	"master thesis"
-, update =	"98.07 bibrelex"
+, author =      "Kelly A. Lyons"
+, title =       "An Efficient Algorithm for Identifying Objects Using Robot Probes"
+, school =      "Queen's University, Kingston"
+, month =       dec
+, year =        1988
+, keywords =    "master thesis"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{l-cbagd
-, author =	"K. A. Lyons"
-, title =	"Cluster Busting in Anchored Graph Drawing"
-, school =	"??"
-, note =	"in preparation"
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "K. A. Lyons"
+, title =       "Cluster Busting in Anchored Graph Drawing"
+, school =      "??"
+, note =        "in preparation"
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @article{lmr-acbag-98
-, author =	"Kelly A. Lyons and Henk Meijer and David Rappaport"
-, title =	"Algorithms for Cluster Busting in Anchored Graph Drawing"
-, journal =	"J. Graph Algorithms Appl."
-, volume =	2
-, number =	1
-, year =	1998
-, pages =	"1--24"
-, keywords =	"graph drawing, straight-line, interactive"
-, update =	"98.07 tamassia"
+, author =      "Kelly A. Lyons and Henk Meijer and David Rappaport"
+, title =       "Algorithms for Cluster Busting in Anchored Graph Drawing"
+, journal =     "J. Graph Algorithms Appl."
+, volume =      2
+, number =      1
+, year =        1998
+, pages =       "1--24"
+, keywords =    "graph drawing, straight-line, interactive"
+, update =      "98.07 tamassia"
 }
 
 @techreport{lmr-mpsil-
-, author =	"Kelly A. Lyons and Henk Meijer and David Rappaport"
-, title =	"Minimum polygon stabbers of isothetic line segments"
-, institution =	"Dept. of Computing and Information Science, Queen's University"
-, address =	"Ontario, Canada"
-, precedes =	"lmr-mpcil-90"
-, update =	"98.11 bibrelex"
+, author =      "Kelly A. Lyons and Henk Meijer and David Rappaport"
+, title =       "Minimum polygon stabbers of isothetic line segments"
+, institution = "Dept. of Computing and Information Science, Queen's University"
+, address =     "Ontario, Canada"
+, precedes =    "lmr-mpcil-90"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{lmr-pvdcb-93
-, author =	"K. A. Lyons and H. Meijer and D. Rappaport"
-, title =	"Properties of the {Voronoi} Diagram Cluster Buster"
-, editor =	"A. Gawman and W. M. Getleman and E. Kidd and P. Larson and J. Slonim"
-, booktitle =	"Proc. 1993 CAS Conference"
-, volume =	2
-, publisher =	"IBM Canada Ltd. Laboratory Center for Advanced Studies and National Research Council Canada"
-, address =	"Toronto, Ontario, Canada"
-, month =	oct
-, year =	1993
-, pages =	"1148--1163"
-, update =	"98.11 bibrelex"
+, author =      "K. A. Lyons and H. Meijer and D. Rappaport"
+, title =       "Properties of the {Voronoi} Diagram Cluster Buster"
+, editor =      "A. Gawman and W. M. Getleman and E. Kidd and P. Larson and J. Slonim"
+, booktitle =   "Proc. 1993 CAS Conference"
+, volume =      2
+, publisher =   "IBM Canada Ltd. Laboratory Center for Advanced Studies and National Research Council Canada"
+, address =     "Toronto, Ontario, Canada"
+, month =       oct
+, year =        1993
+, pages =       "1148--1163"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{lr-eaiou-89t
-, author =	"K. A. Lyons and D. Rappaport"
-, title =	"An Efficient Algorithm for Identifying Objects Using Robot Probes"
-, number =	"TR CISC 89-259"
-, institution =	"Queen's University"
-, address =	"Kingston, Ontario"
-, year =	1989
-, precedes =	"lr-eaiou-89, lr-eaiou-94"
-, update =	"98.11 bibrelex"
+, author =      "K. A. Lyons and D. Rappaport"
+, title =       "An Efficient Algorithm for Identifying Objects Using Robot Probes"
+, number =      "TR CISC 89-259"
+, institution = "Queen's University"
+, address =     "Kingston, Ontario"
+, year =        1989
+, precedes =    "lr-eaiou-89, lr-eaiou-94"
+, update =      "98.11 bibrelex"
 }
 
 @article{lr-eaiou-94
-, author =	"K. A. Lyons and D. Rappaport"
-, title =	"An efficient algorithm for identifying objects using robot probes"
-, journal =	"Visual Comput."
-, volume =	10
-, year =	1994
-, pages =	"452--458"
-, succeeds =	"lr-eaiou-89t"
-, update =	"98.11 bibrelex, 95.01 smid"
+, author =      "K. A. Lyons and D. Rappaport"
+, title =       "An efficient algorithm for identifying objects using robot probes"
+, journal =     "Visual Comput."
+, volume =      10
+, year =        1994
+, pages =       "452--458"
+, succeeds =    "lr-eaiou-89t"
+, update =      "98.11 bibrelex, 95.01 smid"
 }
 
 @inproceedings{lr-eaiou-89
-, author =	"K. A. Lyons and D. H. Rappaport"
-, title =	"An efficient algorithm for identifying objects using robot probes"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	7
-, succeeds =	"lr-eaiou-89t"
-, update =	"98.11 bibrelex"
+, author =      "K. A. Lyons and D. H. Rappaport"
+, title =       "An efficient algorithm for identifying objects using robot probes"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       7
+, succeeds =    "lr-eaiou-89t"
+, update =      "98.11 bibrelex"
 }
 
 @book{l-cfp-66
-, author =	"L. A. Lyusternik"
-, title =	"Convex Figures and Polyhedra"
-, publisher =	"D. C. Heath"
-, address =	"Boston, MA"
-, year =	1966
-, update =	"94.09 orourke"
+, author =      "L. A. Lyusternik"
+, title =       "Convex Figures and Polyhedra"
+, publisher =   "D. C. Heath"
+, address =     "Boston, MA"
+, year =        1966
+, update =      "94.09 orourke"
 }
 
 @book{l-spvp-64
-, author =	"L. A. Lyusternik"
-, title =	"Shortest Paths: {Variational} Problems"
-, publisher =	"Macmillan Company"
-, address =	"New York"
-, year =	1964
-, update =	"93.09 milone+mitchell"
+, author =      "L. A. Lyusternik"
+, title =       "Shortest Paths: {Variational} Problems"
+, publisher =   "Macmillan Company"
+, address =     "New York"
+, year =        1964
+, update =      "93.09 milone+mitchell"
 }
 
 @phdthesis{m-bvdcd-00
-, author =	"Lihong Ma"
-, title =	"Bisectors and {Voronoi} Diagrams for Convex Distance Functions"
-, school =	"Department of Computer Science, FernUniversit{\"a}t Hagen, Technical Report 267"
-, year =	2000
-, url =	"http://wwwpi6.fernuni-hagen.de/Publikationen/tr267.pdf"
-, keywords =	"doctoral thesis"
-, update =	"01.04 icking, 00.11 smid, 00.07 icking, 00.03 bibrelex, 99.07 bibrelex"
+, author =      "Lihong Ma"
+, title =       "Bisectors and {Voronoi} Diagrams for Convex Distance Functions"
+, school =      "Department of Computer Science, FernUniversit{\"a}t Hagen, Technical Report 267"
+, year =        2000
+, url = "http://wwwpi6.fernuni-hagen.de/Publikationen/tr267.pdf"
+, keywords =    "doctoral thesis"
+, update =      "01.04 icking, 00.11 smid, 00.07 icking, 00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{m-eapls-94
-, author =	"Wolfgang Maass"
-, title =	"Efficient Agnostic {PAC}-Learning with Simple Hypotheses"
-, booktitle =	"Proc. 7th Ann. ACM Conf. Comput. Learning Theory"
-, nickname =	"COLT '94"
-, year =	1994
-, pages =	"67--75"
-, update =	"00.11 smid, 00.07 icking, 98.03 bibrelex"
+, author =      "Wolfgang Maass"
+, title =       "Efficient Agnostic {PAC}-Learning with Simple Hypotheses"
+, booktitle =   "Proc. 7th Ann. ACM Conf. Comput. Learning Theory"
+, nickname =    "COLT '94"
+, year =        1994
+, pages =       "67--75"
+, update =      "00.11 smid, 00.07 icking, 98.03 bibrelex"
 }
 
 @article{m-cnc-86
-, author =	"Wolfgang Maass"
-, title =	"On the Complexity of Nonconvex Covering"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"453--467"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Wolfgang Maass"
+, title =       "On the Complexity of Nonconvex Covering"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "453--467"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @article{m-sfe-02
-, author =	"F. Macaulay"
-, title =	"Some Formulae in Elimination"
-, journal =	"Proc. London Math. Soc."
-, volume =	35
-, year =	1902
-, pages =	"3--27"
-, update =	"97.11 bibrelex"
+, author =      "F. Macaulay"
+, title =       "Some Formulae in Elimination"
+, journal =     "Proc. London Math. Soc."
+, volume =      35
+, year =        1902
+, pages =       "3--27"
+, update =      "97.11 bibrelex"
 }
 
 @article{m-tnhl-52
-, author =	"A. M. Macbeath"
-, title =	"A theorem on non-homogeneous lattices"
-, journal =	"Ann. Math."
-, volume =	56
-, year =	1952
-, pages =	"269--293"
-, update =	"97.11 bibrelex"
+, author =      "A. M. Macbeath"
+, title =       "A theorem on non-homogeneous lattices"
+, journal =     "Ann. Math."
+, volume =      56
+, year =        1952
+, pages =       "269--293"
+, update =      "97.11 bibrelex"
 }
 
 @article{mb-hrtus-90
-, author =	"J. MacDanold and K. Booth"
-, title =	"Heuristics for ray tracing using space subdivision"
-, journal =	"Visual Comput."
-, volume =	6
-, year =	1990
-, pages =	"153--166"
-, keywords =	"ray tracing"
-, update =	"96.05 agarwal"
+, author =      "J. MacDanold and K. Booth"
+, title =       "Heuristics for ray tracing using space subdivision"
+, journal =     "Visual Comput."
+, volume =      6
+, year =        1990
+, pages =       "153--166"
+, keywords =    "ray tracing"
+, update =      "96.05 agarwal"
 }
 
 @article{ms-isp-96
-, author =	"G. MacDonald and T. Shermer"
-, title =	"Isomophism of spiral polygons"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, number =	2
-, year =	1996
-, pages =	"277--304"
-, keywords =	"visibility graphs"
-, update =	"97.11 orourke, 96.09 orourke"
+, author =      "G. MacDonald and T. Shermer"
+, title =       "Isomophism of spiral polygons"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, number =      2
+, year =        1996
+, pages =       "277--304"
+, keywords =    "visibility graphs"
+, update =      "97.11 orourke, 96.09 orourke"
 }
 
 @article{mp-atadp-91
-, author =	"G. Macedonio and M. T. Pareschi"
-, title =	"An Algorithm for the Triangulation of Arbitrarily Distributed Points: Applications to Volume Estimate and Terrain Fitting"
-, journal =	"Comput. Geosci."
-, volume =	17
-, number =	7
-, year =	1991
-, pages =	"859--874"
-, annote =	"Just Lee-Schachter Insertion algorithm. Includes C
-		 code."
+, author =      "G. Macedonio and M. T. Pareschi"
+, title =       "An Algorithm for the Triangulation of Arbitrarily Distributed Points: Applications to Volume Estimate and Terrain Fitting"
+, journal =     "Comput. Geosci."
+, volume =      17
+, number =      7
+, year =        1991
+, pages =       "859--874"
+, annote =      "Just Lee-Schachter Insertion algorithm. Includes C
+                 code."
 }
 
 @techreport{m-psdss-85
-, author =	"J. {MacGregor Smith}"
-, title =	"Point set decomposition and suboptimal {Steiner} minimal trees"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Indust. Engrg. Oper. Res., Univ. Massachusetts Amherst"
-, address =	"Amherst, MA"
-, year =	1985
+, author =      "J. {MacGregor Smith}"
+, title =       "Point set decomposition and suboptimal {Steiner} minimal trees"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Indust. Engrg. Oper. Res., Univ. Massachusetts Amherst"
+, address =     "Amherst, MA"
+, year =        1985
 }
 
 @inproceedings{m-ena2r-50
-, author =	"C. Mack"
-, title =	"The expected number of aggregates in $2$ random distribution of $n$ points"
-, booktitle =	"Proc. Cambridge Phil. Soc."
-, volume =	46
-, year =	1950
-, pages =	"285--292"
+, author =      "C. Mack"
+, title =       "The expected number of aggregates in $2$ random distribution of $n$ points"
+, booktitle =   "Proc. Cambridge Phil. Soc."
+, volume =      46
+, year =        1950
+, pages =       "285--292"
 }
 
 @article{m-scaac-72
-, author =	"A. L. Mackay"
-, title =	"Stereological Characteristics of Atomic Arrangements in Crystals"
-, journal =	"Journal of Microscopy"
-, volume =	95
-, year =	1972
-, pages =	"217--227"
-, annote =	"{Voronoi} polyhedron as a model of crystal structures.
-		 $O(N^3)$ algorithm to find one polyhedron (all triples
-		 neighbouring)"
+, author =      "A. L. Mackay"
+, title =       "Stereological Characteristics of Atomic Arrangements in Crystals"
+, journal =     "Journal of Microscopy"
+, volume =      95
+, year =        1972
+, pages =       "217--227"
+, annote =      "{Voronoi} polyhedron as a model of crystal structures.
+                 $O(N^3)$ algorithm to find one polyhedron (all triples
+                 neighbouring)"
 }
 
 @inproceedings{ms-ufetp-91
-, author =	"P. D. MacKenzie and Q. F. Stout"
-, title =	"Ultra-fast expected time parallel algorithms"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"414--423"
-, update =	"93.05 smid"
+, author =      "P. D. MacKenzie and Q. F. Stout"
+, title =       "Ultra-fast expected time parallel algorithms"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "414--423"
+, update =      "93.05 smid"
 }
 
 @article{m-adgpr-86
-, author =	"J. D. Mackinley"
-, title =	"Automating the Design of Graphical Presentations of Relational Information"
-, journal =	"ACM Trans. Graph."
-, volume =	5
-, number =	2
-, year =	1986
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. D. Mackinley"
+, title =       "Automating the Design of Graphical Presentations of Relational Information"
+, journal =     "ACM Trans. Graph."
+, volume =      5
+, number =      2
+, year =        1986
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{m-ipps-73
-, author =	"A. K. Mackworth"
-, title =	"Interpreting pictures of polyhedral scenes"
-, journal =	"Artif. Intell."
-, volume =	4
-, year =	1973
-, pages =	"121--137"
-, update =	"97.11 bibrelex"
+, author =      "A. K. Mackworth"
+, title =       "Interpreting pictures of polyhedral scenes"
+, journal =     "Artif. Intell."
+, volume =      4
+, year =        1973
+, pages =       "121--137"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{m-smcam-67
-, author =	"J. MacQueen"
-, title =	"Some Methods for Classification and Analysis of Multivariate Observations"
-, booktitle =	"Proceedings of the Fifth Berkeley Symposium on Math., Stat. and Prob."
-, year =	1967
-, pages =	"281--296"
-, update =	"98.07 agarwal"
+, author =      "J. MacQueen"
+, title =       "Some Methods for Classification and Analysis of Multivariate Observations"
+, booktitle =   "Proceedings of the Fifth Berkeley Symposium on Math., Stat. and Prob."
+, year =        1967
+, pages =       "281--296"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{mmph-pgle-96
-, author =	"B. Madden and P. Madden and S. Powers and M. Himsolt"
-, title =	"Portable Graph Layout and Editing"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"385--395"
-, update =	"98.11 bibrelex, 98.07 vismara"
+, author =      "B. Madden and P. Madden and S. Powers and M. Himsolt"
+, title =       "Portable Graph Layout and Editing"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "385--395"
+, update =      "98.11 bibrelex, 98.07 vismara"
 }
 
 @inproceedings{my-mpacc-86
-, author =	"S. Maddila and C. K. Yap"
-, title =	"Moving a polygon around the corner in a corridor"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"187--192"
-, cites =	"b-sfppg-83, m-damlr-86, s-wc-82, y-hmctd-87, y-amp-87, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "S. Maddila and C. K. Yap"
+, title =       "Moving a polygon around the corner in a corridor"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "187--192"
+, cites =       "b-sfppg-83, m-damlr-86, s-wc-82, y-hmctd-87, y-amp-87, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{m-damlr-86
-, author =	"S. R. Maddila"
-, title =	"Decomposition algorithm for moving a ladder among rectangular obstacles"
-, booktitle =	"Proc. of IEEE Inter. Conf. on Robotics and Automation"
-, site =	"San Francisco"
-, month =	apr
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "S. R. Maddila"
+, title =       "Decomposition algorithm for moving a ladder among rectangular obstacles"
+, booktitle =   "Proc. of IEEE Inter. Conf. on Robotics and Automation"
+, site =        "San Francisco"
+, month =       apr
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @techreport{m-mpalr-??
-, author =	"S. R. Maddila"
-, title =	"Motion planning algorithm for a ladder among rectangular obstacles"
-, type =	"Manuscript"
-, institution =	"Dept. Elect. Comput. Engrg., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	"??"
+, author =      "S. R. Maddila"
+, title =       "Motion planning algorithm for a ladder among rectangular obstacles"
+, type =        "Manuscript"
+, institution = "Dept. Elect. Comput. Engrg., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        "??"
 }
 
 @article{mk-impgo-84
-, author =	"S. P. Madur and P. A. Koparkar"
-, title =	"Interval Methods for Processing Geometric Objects"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	"7--17"
-, month =	feb
-, year =	1984
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "S. P. Madur and P. A. Koparkar"
+, title =       "Interval Methods for Processing Geometric Objects"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      "7--17"
+, month =       feb
+, year =        1984
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{m-up-93
-, author =	"R. E. Maeder"
-, title =	"Uniform Polyhedra"
-, journal =	"The Mathematica Journal"
-, volume =	3
-, number =	4
-, year =	1993
-, pages =	"48--57"
-, update =	"96.05 orourke"
+, author =      "R. E. Maeder"
+, title =       "Uniform Polyhedra"
+, journal =     "The Mathematica Journal"
+, volume =      3
+, number =      4
+, year =        1993
+, pages =       "48--57"
+, update =      "96.05 orourke"
 }
 
 @techreport{m-oe-80
-, author =	"D. Maegher"
-, title =	"Octree Encoding"
-, type =	"Technical {Report}"
-, number =	"TR-IPL-80-111"
-, institution =	"Dept. Electrical Syst., Rensselaer Polytechnic Inst."
-, address =	"Troy, NY"
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "D. Maegher"
+, title =       "Octree Encoding"
+, type =        "Technical {Report}"
+, number =      "TR-IPL-80-111"
+, institution = "Dept. Electrical Syst., Rensselaer Polytechnic Inst."
+, address =     "Troy, NY"
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @article{m-dpgec-91
-, author =	"H. Maehara"
-, title =	"Dispersed points and geometric embeddings of complete bipartite graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"57--67"
+, author =      "H. Maehara"
+, title =       "Dispersed points and geometric embeddings of complete bipartite graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "57--67"
 }
 
 @article{m-htts-89
-, author =	"H. Maehara"
-, title =	"Helly-type theorems for spheres"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"279--285"
+, author =      "H. Maehara"
+, title =       "Helly-type theorems for spheres"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "279--285"
 }
 
 @article{m-nisud-89
-, author =	"H. Maehara"
-, title =	"Note on induced subgraphs of the unit distance graph {$E^n$}"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"15--18"
+, author =      "H. Maehara"
+, title =       "Note on induced subgraphs of the unit distance graph {$E^n$}"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "15--18"
 }
 
 @article{m-gccrp-91
-, author =	"H. Maehara"
-, title =	"On {Graver}'s conjecture concerning the rigidity problem of graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"339--342"
+, author =      "H. Maehara"
+, title =       "On {Graver}'s conjecture concerning the rigidity problem of graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "339--342"
 }
 
 @inproceedings{mh-dges-89
-, author =	"H. Maehara and M. Homma"
-, title =	"Distance graphs in {Euclidean} space"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	29
+, author =      "H. Maehara and M. Homma"
+, title =       "Distance graphs in {Euclidean} space"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       29
 }
 
 @article{m-??-94
-, author =	"J. Maekawa"
-, title =	"??"
-, journal =	"Oru"
-, volume =	2
-, number =	2
-, year =	1994
-, update =	"97.11 bibrelex"
+, author =      "J. Maekawa"
+, title =       "??"
+, journal =     "Oru"
+, volume =      2
+, number =      2
+, year =        1994
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{m-rcmsi-93
-, author =	"T. Maekawa"
-, title =	"Robust Computational Methods for Shape Interrogation"
-, type =	"Ph.{D}. Thesis"
-, school =	"Massachusetts Institute of Technology"
-, address =	"Cambridge, Massachusetts"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"95.05 abrams"
+, author =      "T. Maekawa"
+, title =       "Robust Computational Methods for Shape Interrogation"
+, type =        "Ph.{D}. Thesis"
+, school =      "Massachusetts Institute of Technology"
+, address =     "Cambridge, Massachusetts"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "95.05 abrams"
 }
 
 @article{mp-csiop-93
-, author =	"T. Maekawa and N. M. Patrikalakis"
-, title =	"Computation of Singularities and Intersections of Offsets of Planar Curves"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	10
-, number =	5
-, year =	1993
-, pages =	"407--429"
-, update =	"95.05 abrams+held"
+, author =      "T. Maekawa and N. M. Patrikalakis"
+, title =       "Computation of Singularities and Intersections of Offsets of Planar Curves"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      10
+, number =      5
+, year =        1993
+, pages =       "407--429"
+, update =      "95.05 abrams+held"
 }
 
 @article{mp-idgdm-94
-, author =	"T. Maekawa and N. M. Patrikalakis"
-, title =	"Interrogation of Differential Geometry Properties for Design and Manufacture"
-, journal =	"Visual Comput."
-, volume =	10
-, number =	4
-, year =	1994
-, pages =	"216--237"
-, update =	"95.05 abrams"
+, author =      "T. Maekawa and N. M. Patrikalakis"
+, title =       "Interrogation of Differential Geometry Properties for Design and Manufacture"
+, journal =     "Visual Comput."
+, volume =      10
+, number =      4
+, year =        1994
+, pages =       "216--237"
+, update =      "95.05 abrams"
 }
 
 @article{mwp-ulcsi-95
-, author =	"T. Maekawa and F.-E. Wolter and N. M. Patrikalakis"
-, title =	"Umbilics and Lines of Curvature for Shape Interrogation"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	"??"
-, year =	1995
-, note =	"To appear"
-, update =	"95.05 abrams"
+, author =      "T. Maekawa and F.-E. Wolter and N. M. Patrikalakis"
+, title =       "Umbilics and Lines of Curvature for Shape Interrogation"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      "??"
+, year =        1995
+, note =        "To appear"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{mf-cvmht-94
-, author =	"P. Magillo and L. {De Floriani}"
-, title =	"Computing visibility maps on hierarchical terrain models"
-, booktitle =	"Proc. 2nd ACM Workshop on Advances in GIS"
-, year =	1994
-, pages =	""
-, update =	"96.09 kreveld"
+, author =      "P. Magillo and L. {De Floriani}"
+, title =       "Computing visibility maps on hierarchical terrain models"
+, booktitle =   "Proc. 2nd ACM Workshop on Advances in GIS"
+, year =        1994
+, pages =       ""
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{mf-mmldo-96
-, author =	"P. Magillo and L. {De Floriani}"
-, title =	"Maintaining multiple levels of detail in the overlay of hierarchical subdivisions"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"190--195"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "P. Magillo and L. {De Floriani}"
+, title =       "Maintaining multiple levels of detail in the overlay of hierarchical subdivisions"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "190--195"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @article{mjs-spstg-83
-, author =	"E. R. Magnus and C. C. Joyce and W. D. Scott"
-, title =	"A Spiral Procedure for Selecting a Triangular Grid from Random Data"
-, journal =	"Journal for Applied Mathematics and Physics (ZAMP)"
-, volume =	34
-, month =	mar
-, year =	1983
-, pages =	"231--235"
-, annote =	"Constructs a spiral through successive convex hulls by
-		 a variation of Jarvis scan. Spiral is then triangulated
-		 (when a choice is possible Delaunay triangles are
-		 chosen). Then switchings are applied to produce DT.
-		 Claim measured $O(n^{1.6})$ but initial step is clearly
-		 $O(n^2)$."
+, author =      "E. R. Magnus and C. C. Joyce and W. D. Scott"
+, title =       "A Spiral Procedure for Selecting a Triangular Grid from Random Data"
+, journal =     "Journal for Applied Mathematics and Physics (ZAMP)"
+, volume =      34
+, month =       mar
+, year =        1983
+, pages =       "231--235"
+, annote =      "Constructs a spiral through successive convex hulls by
+                 a variation of Jarvis scan. Spiral is then triangulated
+                 (when a choice is possible Delaunay triangles are
+                 chosen). Then switchings are applied to produce DT.
+                 Claim measured $O(n^{1.6})$ but initial step is clearly
+                 $O(n^2)$."
 }
 
 @book{mgr-gispa-91
-, title =	"Geographical Information Systems: Principles and Applications"
-, editor =	"D. J. Maguire and M. F. Goodchild and D. W. Rhind"
-, publisher =	"Longman"
-, address =	"London"
-, year =	1991
-, update =	"96.09 kreveld"
+, title =       "Geographical Information Systems: Principles and Applications"
+, editor =      "D. J. Maguire and M. F. Goodchild and D. W. Rhind"
+, publisher =   "Longman"
+, address =     "London"
+, year =        1991
+, update =      "96.09 kreveld"
 }
 
 @phdthesis{m-pamlp-92
-, author =	"Anil Maheshwari"
-, title =	"Parallel algorithms for minimum link path and related problems"
-, type =	"Ph.{D}. Dissertation"
-, school =	"Univ. Bombay"
-, address =	"Bombay, India"
-, month =	feb
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "Anil Maheshwari"
+, title =       "Parallel algorithms for minimum link path and related problems"
+, type =        "Ph.{D}. Dissertation"
+, school =      "Univ. Bombay"
+, address =     "Bombay, India"
+, month =       feb
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @article{ms-soarl-97
-, author =	"A. Maheshwari and J.-R. Sack"
-, title =	"Simple Optimal Algorithms for Rectilinear link Path and Polygon Separation Problems"
-, journal =	"Parallel Processing Letter"
-, volume =	"??"
-, month =	jun
-, year =	1997
-, update =	"97.11 sack"
+, author =      "A. Maheshwari and J.-R. Sack"
+, title =       "Simple Optimal Algorithms for Rectilinear link Path and Polygon Separation Problems"
+, journal =     "Parallel Processing Letter"
+, volume =      "??"
+, month =       jun
+, year =        1997
+, update =      "97.11 sack"
 }
 
 @incollection{msd-ldp-00
-, author =	"Anil Maheshwari and J{\"o}rg-R{\"u}diger Sack and Hristo N. Djidjev"
-, title =	"Link Distance Problems"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"519--558"
-, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 12 of su-hcg-00"
+, author =      "Anil Maheshwari and J{\"o}rg-R{\"u}diger Sack and Hristo N. Djidjev"
+, title =       "Link Distance Problems"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "519--558"
+, update =      "00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 12 of su-hcg-00"
 }
 
 @inproceedings{msz-ioesp-01
-, author =	"A. Maheshwari and M. Smid and N. Zeh"
-, title =	"I/O-efficient shortest path queries in geometric spanners"
-, booktitle =	"Proc. 7th Workshop Algorithms Data Struct."
-, nickname =	"WADS '01"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	2125
-, publisher =	"Springer-Verlag"
-, year =	2001
-, pages =	"287--299"
-, update =	"01.11 smid"
+, author =      "A. Maheshwari and M. Smid and N. Zeh"
+, title =       "I/O-efficient shortest path queries in geometric spanners"
+, booktitle =   "Proc. 7th Workshop Algorithms Data Struct."
+, nickname =    "WADS '01"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      2125
+, publisher =   "Springer-Verlag"
+, year =        2001
+, pages =       "287--299"
+, update =      "01.11 smid"
 }
 
 @inproceedings{mb-pachp-81
-, author =	"S. N. Maheshwari and P. C. P. Bhatt"
-, title =	"Parallel algorithms for the convex hull problems in two dimensions"
-, booktitle =	"Conf. Analy. Prob. Classes Program. Parallel Comput."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	111
-, publisher =	"Springer-Verlag"
-, year =	1981
-, pages =	"358--372"
+, author =      "S. N. Maheshwari and P. C. P. Bhatt"
+, title =       "Parallel algorithms for the convex hull problems in two dimensions"
+, booktitle =   "Conf. Analy. Prob. Classes Program. Parallel Comput."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      111
+, publisher =   "Springer-Verlag"
+, year =        1981
+, pages =       "358--372"
 }
 
 @article{mhm-cacjm-80
-, author =	"K. W. Mahin and K. Hanson and J. W. {Morris Jr.}"
-, title =	"Comparative analysis of the cellular and {Johnson-Mehl} microstructures through computer simulation"
-, journal =	"Acta Metallurgica"
-, volume =	"??"
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "K. W. Mahin and K. Hanson and J. W. {Morris Jr.}"
+, title =       "Comparative analysis of the cellular and {Johnson-Mehl} microstructures through computer simulation"
+, journal =     "Acta Metallurgica"
+, volume =      "??"
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @article{m-idp-64
-, author =	"K. Mahler"
-, title =	"An inequality for the discriminant of polynomial"
-, journal =	"Michigan Math. J."
-, volume =	11
-, year =	1964
-, pages =	"257--262"
-, update =	"98.03 bibrelex"
+, author =      "K. Mahler"
+, title =       "An inequality for the discriminant of polynomial"
+, journal =     "Michigan Math. J."
+, volume =      11
+, year =        1964
+, pages =       "257--262"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{m-ltn-76
-, author =	"K. Mahler"
-, title =	"Lectures on transcendental numbres"
-, booktitle =	"??"
-, series =	"Lecture Notes Math."
-, volume =	546
-, publisher =	"Springer-Verlag"
-, year =	1976
-, update =	"97.11 bibrelex"
+, author =      "K. Mahler"
+, title =       "Lectures on transcendental numbres"
+, booktitle =   "??"
+, series =      "Lecture Notes Math."
+, volume =      546
+, publisher =   "Springer-Verlag"
+, year =        1976
+, update =      "97.11 bibrelex"
 }
 
 @article{ms-hbt-81
-, author =	"D. Maier and C. Salveter"
-, title =	"Hysterical {B}-trees"
-, journal =	"Inform. Process. Lett."
-, volume =	12
-, year =	1981
-, pages =	"199--202"
-, update =	"97.11 bibrelex"
+, author =      "D. Maier and C. Salveter"
+, title =       "Hysterical {B}-trees"
+, journal =     "Inform. Process. Lett."
+, volume =      12
+, year =        1981
+, pages =       "199--202"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ms-hbt-79
-, author =	"D. Maier and S. C. Salveter"
-, title =	"Hysterical {B}-Trees"
-, type =	"Technical {Report}"
-, number =	"79/007"
-, institution =	"Univ. Stony Brook"
-, year =	1979
-, update =	"97.11 bibrelex"
+, author =      "D. Maier and S. C. Salveter"
+, title =       "Hysterical {B}-Trees"
+, type =        "Technical {Report}"
+, number =      "79/007"
+, institution = "Univ. Stony Brook"
+, year =        1979
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-mddlp-79
-, author =	"M. Maille"
-, title =	"Methodes d'evaluation de la precision d'une mesure ou d'un calcul numerique"
-, type =	"Rapport {L.I.T.P.}"
-, institution =	"Universite P. et M. Curie"
-, address =	"Paris, France"
-, year =	1979
-, update =	"98.03 bibrelex"
+, author =      "M. Maille"
+, title =       "Methodes d'evaluation de la precision d'une mesure ou d'un calcul numerique"
+, type =        "Rapport {L.I.T.P.}"
+, institution = "Universite P. et M. Curie"
+, address =     "Paris, France"
+, year =        1979
+, update =      "98.03 bibrelex"
 }
 
 @techreport{m-rlsi-81
-, author =	"H. G. Mairson"
-, title =	"Reporting line segment intersections"
-, type =	"manuscript"
-, year =	1981
-, update =	"98.11 bibrelex"
+, author =      "H. G. Mairson"
+, title =       "Reporting line segment intersections"
+, type =        "manuscript"
+, year =        1981
+, update =      "98.11 bibrelex"
 }
 
 @incollection{ms-rcibt-88
-, author =	"H. G. Mairson and J. Stolfi"
-, title =	"Reporting and counting intersections between two sets of line segments"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1988
-, pages =	"307--325"
-, update =	"97.03 schwarzkopf"
+, author =      "H. G. Mairson and J. Stolfi"
+, title =       "Reporting and counting intersections between two sets of line segments"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1988
+, pages =       "307--325"
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{mkfa-aascs-86
-, author =	"M. A. Majewski and F. N. Krull and T. E. Fuhrman and P. J. Ainslie"
-, title =	"Autodraft: Automatic Synthesis of Circuit Schematics"
-, booktitle =	"Proc. IEEE Internat. Conf. on Computer-Aided Design"
-, year =	1986
-, pages =	"435--438"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. A. Majewski and F. N. Krull and T. E. Fuhrman and P. J. Ainslie"
+, title =       "Autodraft: Automatic Synthesis of Circuit Schematics"
+, booktitle =   "Proc. IEEE Internat. Conf. on Computer-Aided Design"
+, year =        1986
+, pages =       "435--438"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @phdthesis{m-gmcad-98
-, author =	"J. Majhi"
-, title =	"Geometric Methods in Computer-Aided Design and Manufacturing"
-, type =	"Ph.{D}. Thesis"
-, school =	"University of Minnesota"
-, address =	"Minneapolis"
-, year =	1998
-, keywords =	"doctoral thesis"
-, update =	"98.11 smid"
+, author =      "J. Majhi"
+, title =       "Geometric Methods in Computer-Aided Design and Manufacturing"
+, type =        "Ph.{D}. Thesis"
+, school =      "University of Minnesota"
+, address =     "Minneapolis"
+, year =        1998
+, keywords =    "doctoral thesis"
+, update =      "98.11 smid"
 }
 
 @inproceedings{mgj-cfufp-96
-, author =	"J. Majhi and P. Gupta and R. Janardan"
-, title =	"Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design"
-, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1148
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"39--47"
-, update =	"99.11 bibrelex, 98.07 bibrelex, 97.11 orourke"
+, author =      "J. Majhi and P. Gupta and R. Janardan"
+, title =       "Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design"
+, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1148
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "39--47"
+, update =      "99.11 bibrelex, 98.07 bibrelex, 97.11 orourke"
 }
 
 @article{mgj-cfufp-99
-, author =	"J. Majhi and P. Gupta and R. Janardan"
-, title =	"Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, year =	1999
-, pages =	"229--252"
-, update =	"00.03 smid"
+, author =      "J. Majhi and P. Gupta and R. Janardan"
+, title =       "Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, year =        1999
+, pages =       "229--252"
+, update =      "00.03 smid"
 }
 
 @techreport{mjssg-mssta-98
-, author =	"J. Majhi and R. Janardan and J. Schwerdt and M. Smid and P. Gupta"
-, title =	"Minimizing support structures and trapped area in two-dimensional layered manufacturing"
-, type =	"Report"
-, number =	1
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1998
-, succeeds =	"mjsg-osgop-97i"
-, update =	"00.03 smid, 98.03 smid"
+, author =      "J. Majhi and R. Janardan and J. Schwerdt and M. Smid and P. Gupta"
+, title =       "Minimizing support structures and trapped area in two-dimensional layered manufacturing"
+, type =        "Report"
+, number =      1
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1998
+, succeeds =    "mjsg-osgop-97i"
+, update =      "00.03 smid, 98.03 smid"
 }
 
 @article{mjssg-mssta-99
-, author =	"J. Majhi and R. Janardan and J. Schwerdt and M. Smid and P. Gupta"
-, title =	"Minimizing support structures and trapped area in two-dimensional layered manufacturing"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	12
-, year =	1999
-, pages =	"241--267"
-, succeeds =	"mjssg-osgop-98"
-, update =	"00.03 smid, 99.07 smid"
+, author =      "J. Majhi and R. Janardan and J. Schwerdt and M. Smid and P. Gupta"
+, title =       "Minimizing support structures and trapped area in two-dimensional layered manufacturing"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      12
+, year =        1999
+, pages =       "241--267"
+, succeeds =    "mjssg-osgop-98"
+, update =      "00.03 smid, 99.07 smid"
 }
 
 @techreport{mjsg-osgop-97t
-, author =	"J. Majhi and R. Janardan and M. Smid and P. Gupta"
-, title =	"On some geometric optimization problems in layered manufacturing"
-, type =	"Report"
-, number =	1
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1997
-, update =	"97.11 smid, 97.03 smid"
+, author =      "J. Majhi and R. Janardan and M. Smid and P. Gupta"
+, title =       "On some geometric optimization problems in layered manufacturing"
+, type =        "Report"
+, number =      1
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1997
+, update =      "97.11 smid, 97.03 smid"
 }
 
 @inproceedings{mjsg-osgop-97i
-, author =	"J. Majhi and R. Janardan and M. Smid and P. Gupta"
-, title =	"On some geometric optimization problems in layered manufacturing"
-, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
-, nickname =	"WADS '97"
-, site =	"Halifax, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1272
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"136--149"
-, update =	"99.07 bibrelex, 97.11 smid"
+, author =      "J. Majhi and R. Janardan and M. Smid and P. Gupta"
+, title =       "On some geometric optimization problems in layered manufacturing"
+, booktitle =   "Proc. 5th Workshop Algorithms Data Struct."
+, nickname =    "WADS '97"
+, site =        "Halifax, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1272
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "136--149"
+, update =      "99.07 bibrelex, 97.11 smid"
 }
 
 @techreport{mjsg-osgop-98
-, author =	"J. Majhi and R. Janardan and M. Smid and P. Gupta"
-, title =	"On some geometric optimization problems in layered manufacturing"
-, type =	"Report"
-, number =	2
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1998
-, succeeds =	"mjsg-osgop-97i"
-, update =	"98.03 smid"
+, author =      "J. Majhi and R. Janardan and M. Smid and P. Gupta"
+, title =       "On some geometric optimization problems in layered manufacturing"
+, type =        "Report"
+, number =      2
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1998
+, succeeds =    "mjsg-osgop-97i"
+, update =      "98.03 smid"
 }
 
 @article{mjsg-osgop-99
-, author =	"J. Majhi and R. Janardan and M. Smid and P. Gupta"
-, title =	"On some geometric optimization problems in layered manufacturing"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	12
-, year =	1999
-, pages =	"219--239"
-, succeeds =	"mjsg-osgop-98"
-, update =	"99.07 smid"
+, author =      "J. Majhi and R. Janardan and M. Smid and P. Gupta"
+, title =       "On some geometric optimization problems in layered manufacturing"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      12
+, year =        1999
+, pages =       "219--239"
+, succeeds =    "mjsg-osgop-98"
+, update =      "99.07 smid"
 }
 
 @techreport{mjss-mcgop-98t
-, author =	"J. Majhi and R. Janardan and M. Smid and J. Schwerdt"
-, title =	"Multi-criteria geometric optimization problems in layered manufacturing"
-, type =	"Report"
-, number =	4
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1998
-, update =	"98.07 smid, 98.03 smid"
+, author =      "J. Majhi and R. Janardan and M. Smid and J. Schwerdt"
+, title =       "Multi-criteria geometric optimization problems in layered manufacturing"
+, type =        "Report"
+, number =      4
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1998
+, update =      "98.07 smid, 98.03 smid"
 }
 
 @inproceedings{mjss-mcgop-98i
-, author =	"J. Majhi and R. Janardan and M. Smid and J. Schwerdt"
-, title =	"Multi-criteria geometric optimization problems in layered manufacturing"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"19--28"
-, update =	"98.07 smid"
+, author =      "J. Majhi and R. Janardan and M. Smid and J. Schwerdt"
+, title =       "Multi-criteria geometric optimization problems in layered manufacturing"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "19--28"
+, update =      "98.07 smid"
 }
 
 @article{m-dmpcg-90
-, author =	"V. V. Makeev"
-, title =	"The degree of a mapping in some problems in combinatiorial geometry"
-, journal =	"J. of Soviet Math."
-, volume =	51
-, number =	5
-, month =	oct
-, year =	1990
-, note =	"Plenum Publ. Corp."
-, update =	"98.11 bibrelex"
+, author =      "V. V. Makeev"
+, title =       "The degree of a mapping in some problems in combinatiorial geometry"
+, journal =     "J. of Soviet Math."
+, volume =      51
+, number =      5
+, month =       oct
+, year =        1990
+, note =        "Plenum Publ. Corp."
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{md-sepct-93
-, author =	"I. M{\"a}kel{\"a} and A. Dolenc"
-, title =	"Some efficient procedures for correcting triangulated models"
-, booktitle =	"Proc. Sympos. on Solid Freeform Fabrication"
-, site =	"Austin, TX"
-, organization =	"Dept. Mech. Eng., Univ. Texas Austin"
-, year =	1993
-, update =	"98.07 bibrelex"
+, author =      "I. M{\"a}kel{\"a} and A. Dolenc"
+, title =       "Some efficient procedures for correcting triangulated models"
+, booktitle =   "Proc. Sympos. on Solid Freeform Fabrication"
+, site =        "Austin, TX"
+, organization =        "Dept. Mech. Eng., Univ. Texas Austin"
+, year =        1993
+, update =      "98.07 bibrelex"
 }
 
 @article{mrg-vqsc-85
-, author =	"J. Makhoul and S. Roucos and H. Gish"
-, title =	"Vector Quantization in Speech Coding"
-, journal =	"Proc. IEEE"
-, volume =	73
-, number =	11
-, month =	nov
-, year =	1985
-, pages =	"1551--1588"
-, update =	"98.07 agarwal"
+, author =      "J. Makhoul and S. Roucos and H. Gish"
+, title =       "Vector Quantization in Speech Coding"
+, journal =     "Proc. IEEE"
+, volume =      73
+, number =      11
+, month =       nov
+, year =        1985
+, pages =       "1551--1588"
+, update =      "98.07 agarwal"
 }
 
 @techreport{m-nmhdb-88
-, author =	"E. Makinen"
-, title =	"A Note on the Median Heuristic for Drawing Bipartite Graphs"
-, number =	"A-1988-4"
-, institution =	"Department of Computer Science, University of Tampere"
-, month =	may
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. Makinen"
+, title =       "A Note on the Median Heuristic for Drawing Bipartite Graphs"
+, number =      "A-1988-4"
+, institution = "Department of Computer Science, University of Tampere"
+, month =       may
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{m-ed2lh-88
-, author =	"E. Makinen"
-, title =	"Experiments of Drawing 2-Level Hierarchical Graphs"
-, number =	"A-1988-1"
-, institution =	"Department of Computer Science, University of Tampere"
-, month =	jan
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. Makinen"
+, title =       "Experiments of Drawing 2-Level Hierarchical Graphs"
+, number =      "A-1988-1"
+, institution = "Department of Computer Science, University of Tampere"
+, month =       jan
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{m-ed2lh-90
-, author =	"E. M{\"a}kinen"
-, title =	"Experiments on Drawing 2-Level Hierarchical Graphs"
-, journal =	"Internat. J. Comput. Math."
-, volume =	36
-, year =	1990
-, pages =	"175--181"
-, update =	"98.07 vismara"
+, author =      "E. M{\"a}kinen"
+, title =       "Experiments on Drawing 2-Level Hierarchical Graphs"
+, journal =     "Internat. J. Comput. Math."
+, volume =      36
+, year =        1990
+, pages =       "175--181"
+, update =      "98.07 vismara"
 }
 
 @misc{m-hdh-89
-, author =	"E. Makinen"
-, title =	"How to Draw a Hypergraph"
-, institution =	"Department of Computer Science, University of Tampere"
-, year =	1989
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. Makinen"
+, title =       "How to Draw a Hypergraph"
+, institution = "Department of Computer Science, University of Tampere"
+, year =        1989
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{m-cl-88
-, author =	"E. Makinen"
-, title =	"On Circular Layouts"
-, journal =	"Internat. J. Comput. Math."
-, volume =	24
-, year =	1988
-, pages =	"29--37"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. Makinen"
+, title =       "On Circular Layouts"
+, journal =     "Internat. J. Comput. Math."
+, volume =      24
+, year =        1988
+, pages =       "29--37"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{m-drbg-90
-, author =	"E. Makinen"
-, title =	"On Drawing Regular Bipartite Graphs"
-, number =	"A-1990-8"
-, institution =	"Department of Computer Science, University of Tampere"
-, year =	1990
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. Makinen"
+, title =       "On Drawing Regular Bipartite Graphs"
+, number =      "A-1990-8"
+, institution = "Department of Computer Science, University of Tampere"
+, year =        1990
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{m-rahdb-90
-, author =	"E. Makinen"
-, title =	"Remarks on the Assignment Heuristic for Drawing Bipartite Graphs"
-, number =	"A-1990-7"
-, institution =	"Department of Computer Science, University of Tampere"
-, year =	1990
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. Makinen"
+, title =       "Remarks on the Assignment Heuristic for Drawing Bipartite Graphs"
+, number =      "A-1990-7"
+, institution = "Department of Computer Science, University of Tampere"
+, year =        1990
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{mt-fpior-97
-, author =	"Christos Makris and Athanasios Tsakalidis"
-, title =	"Fast Piercing of Iso--Oriented Rectangles"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"217--222"
-, update =	"97.11 jones"
+, author =      "Christos Makris and Athanasios Tsakalidis"
+, title =       "Fast Piercing of Iso--Oriented Rectangles"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "217--222"
+, update =      "97.11 jones"
 }
 
 @phdthesis{m-slwr-87
-, author =	"F. M. Maley"
-, title =	"Single-Layer Wire Routing"
-, school =	"Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, month =	aug
-, year =	1987
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "F. M. Maley"
+, title =       "Single-Layer Wire Routing"
+, school =      "Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, month =       aug
+, year =        1987
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @book{m-slwrc-90
-, author =	"F. M. Maley"
-, title =	"Single-Layer Wire Routing and Compaction"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "F. M. Maley"
+, title =       "Single-Layer Wire Routing and Compaction"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{mp-arpg-92
-, author =	"S. Malitz and A. Papakostas"
-, title =	"On the Angular Resolution of Planar Graphs"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"527--538"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "S. Malitz and A. Papakostas"
+, title =       "On the Angular Resolution of Planar Graphs"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "527--538"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{mp-arpg-94
-, author =	"S. Malitz and A. Papakostas"
-, title =	"On the Angular Resolution of Planar Graphs"
-, journal =	"SIAM J. Discrete Math."
-, volume =	7
-, year =	1994
-, pages =	"172--183"
-, keywords =	"graph drawing"
-, succeeds =	"mp-arpg-92"
-, update =	"95.01 tamassia"
+, author =      "S. Malitz and A. Papakostas"
+, title =       "On the Angular Resolution of Planar Graphs"
+, journal =     "SIAM J. Discrete Math."
+, volume =      7
+, year =        1994
+, pages =       "172--183"
+, keywords =    "graph drawing"
+, succeeds =    "mp-arpg-92"
+, update =      "95.01 tamassia"
 }
 
 @article{m-cqrbb-96
-, author =	"P. Malraison"
-, title =	"Constraining a quadratic rational {Bezier} to be an elliptical arc"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"435--441"
-, update =	"97.03 devillers"
+, author =      "P. Malraison"
+, title =       "Constraining a quadratic rational {Bezier} to be an elliptical arc"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "435--441"
+, update =      "97.03 devillers"
 }
 
 @article{m-apmpg-76
-, author =	"G. K. Manacher"
-, title =	"An application of pattern matching to a problem in geometrical complexity"
-, journal =	"Inform. Process. Lett."
-, volume =	5
-, year =	1976
-, pages =	"6--7"
-, precedes =	"a-cgmap-78"
+, author =      "G. K. Manacher"
+, title =       "An application of pattern matching to a problem in geometrical complexity"
+, journal =     "Inform. Process. Lett."
+, volume =      5
+, year =        1976
+, pages =       "6--7"
+, precedes =    "a-cgmap-78"
 }
 
 % no relation to 395
 @inproceedings{mz-fseac-78
-, author =	"G. K. Manacher and A. L. Zobrist"
-, title =	"A fast, space-efficient average-case algorithm for the ``greedy'' triangulation of a point set, and a proof that the greedy triangulation is not approximately optimal"
-, booktitle =	"Proc. 16th Allerton Conf. Commun. Control Comput."
-, year =	1978
-, pages =	"824--832"
+, author =      "G. K. Manacher and A. L. Zobrist"
+, title =       "A fast, space-efficient average-case algorithm for the ``greedy'' triangulation of a point set, and a proof that the greedy triangulation is not approximately optimal"
+, booktitle =   "Proc. 16th Allerton Conf. Commun. Control Comput."
+, year =        1978
+, pages =       "824--832"
 }
 
 @article{mz-ngndt-79
-, author =	"G. K. Manacher and A. L. Zobrist"
-, title =	"Neither the greedy nor the {Delaunay} triangulation of a planar point set approximates the optimal triangulation"
-, journal =	"Inform. Process. Lett."
-, volume =	9
-, year =	1979
-, pages =	"31--34"
+, author =      "G. K. Manacher and A. L. Zobrist"
+, title =       "Neither the greedy nor the {Delaunay} triangulation of a planar point set approximates the optimal triangulation"
+, journal =     "Inform. Process. Lett."
+, volume =      9
+, year =        1979
+, pages =       "31--34"
 }
 
 @incollection{mz-pmhfa-83
-, author =	"Glenn K. Manacher and Albert L. Zobrist"
-, title =	"Probabilistic Methods with Heaps for Fast Average-Case Greedy Algorithms"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"261--278"
-, update =	"01.04 icking, 93.09 erickson"
-, annote =	"By using a $O(1)$ ``pretest'' for edges to be added
-		 get average case $\Theta(n^2)$ algorithm for Greedy
-		 Triangulation."
+, author =      "Glenn K. Manacher and Albert L. Zobrist"
+, title =       "Probabilistic Methods with Heaps for Fast Average-Case Greedy Algorithms"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "261--278"
+, update =      "01.04 icking, 93.09 erickson"
+, annote =      "By using a $O(1)$ ``pretest'' for edges to be added
+                 get average case $\Theta(n^2)$ algorithm for Greedy
+                 Triangulation."
 }
 
 @inproceedings{mms-caolp-88
-, author =	"M. S. Manasse and L. A. McGeoch and D. D. Sleator"
-, title =	"Competitive Algorithms for On-line Problems"
-, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
-, month =	may
-, year =	1988
-, pages =	"322--333"
-, update =	"94.05 franciosa"
+, author =      "M. S. Manasse and L. A. McGeoch and D. D. Sleator"
+, title =       "Competitive Algorithms for On-line Problems"
+, booktitle =   "Proc. 20th Annu. ACM Sympos. Theory Comput."
+, month =       may
+, year =        1988
+, pages =       "322--333"
+, update =      "94.05 franciosa"
 }
 
 @article{m-mfavc-69
-, author =	"M. Manav"
-, title =	"Methods for finding all vertices of a convex polyhedron"
-, journal =	"Ekonom. Mat. Obzor"
-, volume =	5
-, year =	1969
-, pages =	"325--342"
+, author =      "M. Manav"
+, title =       "Methods for finding all vertices of a convex polyhedron"
+, journal =     "Ekonom. Mat. Obzor"
+, volume =      5
+, year =        1969
+, pages =       "325--342"
 }
 
 @article{mn-favcp-68
-, author =	"M. Manav and J. Nedoma"
-, title =	"Finding all vertices of a convex polyhedron"
-, journal =	"Numer. Math."
-, volume =	12
-, year =	1968
-, pages =	"226--229"
+, author =      "M. Manav and J. Nedoma"
+, title =       "Finding all vertices of a convex polyhedron"
+, journal =     "Numer. Math."
+, volume =      12
+, year =        1968
+, pages =       "226--229"
 }
 
 @book{m-iaca-89
-, author =	"U. Manber"
-, title =	"Introduction to Algorithms: A Creative Approach"
-, publisher =	"Addison-Wesley"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "U. Manber"
+, title =       "Introduction to Algorithms: A Creative Approach"
+, publisher =   "Addison-Wesley"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @techreport{mt-pnadt-82
-, author =	"U. Manber and M. Tompa"
-, title =	"Probabilistic, Nondeterministic and Alternating Decision Trees"
-, type =	"Technical {Report}"
-, number =	"82-03-01"
-, institution =	"Univ. Washington"
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "U. Manber and M. Tompa"
+, title =       "Probabilistic, Nondeterministic and Alternating Decision Trees"
+, type =        "Technical {Report}"
+, number =      "82-03-01"
+, institution = "Univ. Washington"
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @article{mt-cppna-85
-, author =	"U. Manber and M. Tompa"
-, title =	"The complexity of problems on probabilistic, nondeterministic, and alternating decision trees"
-, journal =	"J. ACM"
-, volume =	32
-, number =	3
-, year =	1985
-, pages =	"720--732"
-, keywords =	"lower bounds"
+, author =      "U. Manber and M. Tompa"
+, title =       "The complexity of problems on probabilistic, nondeterministic, and alternating decision trees"
+, journal =     "J. ACM"
+, volume =      32
+, number =      3
+, year =        1985
+, pages =       "720--732"
+, keywords =    "lower bounds"
 }
 
 @phdthesis{m-tom-82
-, author =	"A. Mandel"
-, title =	"Topology of Oriented Matroids"
-, school =	"Univ. Waterloo"
-, address =	"Waterloo"
-, year =	1982
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "A. Mandel"
+, title =       "Topology of Oriented Matroids"
+, school =      "Univ. Waterloo"
+, address =     "Waterloo"
+, year =        1982
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @article{mc-dmsoc-72
-, author =	"P. Mandel and C. Chryssostomidis"
-, title =	"A Design Methodology for Ships and Other Complex Systems"
-, journal =	"Philosophical Transactions of the Royal Society of London"
-, volume =	"A 273"
-, year =	1972
-, pages =	"85--98"
-, update =	"95.05 abrams"
+, author =      "P. Mandel and C. Chryssostomidis"
+, title =       "A Design Methodology for Ships and Other Complex Systems"
+, journal =     "Philosophical Transactions of the Royal Society of London"
+, volume =      "A 273"
+, year =        1972
+, pages =       "85--98"
+, update =      "95.05 abrams"
 }
 
 @article{ml-sipat-91
-, author =	"A. Mangen and N. Lasudry"
-, title =	"Search for the Intersection Polygon of any Two Polygons: Application at the Garment Industry"
-, journal =	"Comput. Graph. Forum"
-, volume =	10
-, number =	3
-, month =	sep
-, year =	1991
-, pages =	"195--208"
-, update =	"93.09 held"
+, author =      "A. Mangen and N. Lasudry"
+, title =       "Search for the Intersection Polygon of any Two Polygons: Application at the Garment Industry"
+, journal =     "Comput. Graph. Forum"
+, volume =      10
+, number =      3
+, month =       sep
+, year =        1991
+, pages =       "195--208"
+, update =      "93.09 held"
 }
 
 @inproceedings{m-tha-89
-, author =	"P. Mani-Levitska"
-, title =	"Types of Hyperplane Arrangements"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "P. Mani-Levitska"
+, title =       "Types of Hyperplane Arrangements"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{mw-posfp-85
-, author =	"M. Mani and R. D. W. Wilson"
-, title =	"A programmable orienting system for flat parts"
-, booktitle =	"Proc. North American Mfg. Research Inst. Conf XIII"
-, year =	1985
-, update =	"98.07 bibrelex"
+, author =      "M. Mani and R. D. W. Wilson"
+, title =       "A programmable orienting system for flat parts"
+, booktitle =   "Proc. North American Mfg. Research Inst. Conf XIII"
+, year =        1985
+, update =      "98.07 bibrelex"
 }
 
 @article{mw-nlerp-88
-, author =	"H. Mannila and D. Wood"
-, title =	"A note on the largest empty rectangle problem"
-, journal =	"BIT"
-, volume =	28
-, year =	1988
-, pages =	"179--183"
+, author =      "H. Mannila and D. Wood"
+, title =       "A note on the largest empty rectangle problem"
+, journal =     "BIT"
+, volume =      28
+, year =        1988
+, pages =       "179--183"
 }
 
 @techreport{mw-sprag-84
-, author =	"H. Mannila and D. Wood"
-, title =	"A simple proof of the rectilinear art gallery theorem"
-, type =	"Report"
-, number =	"C-1984-16"
-, institution =	"Dept. Comput. Sci., Univ. Helsinki"
-, address =	"Helsinki, Finland"
-, year =	1984
-, precedes =	"mw-sprag-85"
+, author =      "H. Mannila and D. Wood"
+, title =       "A simple proof of the rectilinear art gallery theorem"
+, type =        "Report"
+, number =      "C-1984-16"
+, institution = "Dept. Comput. Sci., Univ. Helsinki"
+, address =     "Helsinki, Finland"
+, year =        1984
+, precedes =    "mw-sprag-85"
 }
 
 @article{mw-sprag-85
-, author =	"H. Mannila and D. Wood"
-, title =	"A simple proof of the rectilinear art gallery theorem"
-, journal =	"Internat. J. Comput. Math."
-, volume =	17
-, year =	1985
-, pages =	"141--149"
-, succeeds =	"mw-sprag-84"
+, author =      "H. Mannila and D. Wood"
+, title =       "A simple proof of the rectilinear art gallery theorem"
+, journal =     "Internat. J. Comput. Math."
+, volume =      17
+, year =        1985
+, pages =       "141--149"
+, succeeds =    "mw-sprag-84"
 }
 
 @inproceedings{maclp-sdggs-95
-, author =	"J. Manning and M. Atallah and K. Cudjoe and J. Lozito and R. Pacheco"
-, title =	"A System for Drawing Graphs with Geometric Symmetry"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"262--265"
-, keywords =	"graph drawing, system, symmetry"
-, update =	"95.01 tamassia"
+, author =      "J. Manning and M. Atallah and K. Cudjoe and J. Lozito and R. Pacheco"
+, title =       "A System for Drawing Graphs with Geometric Symmetry"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "262--265"
+, keywords =    "graph drawing, system, symmetry"
+, update =      "95.01 tamassia"
 }
 
 @techreport{ma-fddso-86
-, author =	"J. Manning and M. J. Atallah"
-, title =	"Fast Detection and Display of Symmetry in Outerplanar Graphs"
-, number =	"CSD-TR-606"
-, institution =	"Department of Computer Science, Purdue University"
-, year =	1986
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Manning and M. J. Atallah"
+, title =       "Fast Detection and Display of Symmetry in Outerplanar Graphs"
+, number =      "CSD-TR-606"
+, institution = "Department of Computer Science, Purdue University"
+, year =        1986
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{ma-fddst-88
-, author =	"J. Manning and M. J. Atallah"
-, title =	"Fast Detection and Display of Symmetry in Trees"
-, journal =	"Congr. Numer."
-, volume =	64
-, year =	1988
-, pages =	"159--169"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Manning and M. J. Atallah"
+, title =       "Fast Detection and Display of Symmetry in Trees"
+, journal =     "Congr. Numer."
+, volume =      64
+, year =        1988
+, pages =       "159--169"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{mc-nasi-91
-, author =	"D. Manocha and J. F. Canny"
-, title =	"A new approach for surface intersection"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	4
-, year =	1991
-, pages =	"491--516"
-, keywords =	"surface, curve, intersection, solid modeling, resultants, matrix operations"
+, author =      "D. Manocha and J. F. Canny"
+, title =       "A new approach for surface intersection"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      4
+, year =        1991
+, pages =       "491--516"
+, keywords =    "surface, curve, intersection, solid modeling, resultants, matrix operations"
 }
 
 @article{mzw-camcu-95
-, author =	"D. Manocha and Y. Zhu and W. Wright"
-, title =	"Conformational analysis of molecular chains using nano-kinematics"
-, journal =	"Computer Application of Biological Sciences (CABIOS)"
-, volume =	11
-, number =	1
-, year =	1995
-, pages =	"71--86"
-, update =	"98.07 bibrelex"
+, author =      "D. Manocha and Y. Zhu and W. Wright"
+, title =       "Conformational analysis of molecular chains using nano-kinematics"
+, journal =     "Computer Application of Biological Sciences (CABIOS)"
+, volume =      11
+, number =      1
+, year =        1995
+, pages =       "71--86"
+, update =      "98.07 bibrelex"
 }
 
 @article{mpss-istma-93
-, author =	"Y. Mansour and J. Park and B. Schieber and S. Sen"
-, title =	"Improved selection in totally monotone arrays"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"115--132"
-, keywords =	"Planar distance, convex polygons, totally monotone arrays, Monge arrays"
-, update =	"96.09 devillers"
+, author =      "Y. Mansour and J. Park and B. Schieber and S. Sen"
+, title =       "Improved selection in totally monotone arrays"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "115--132"
+, keywords =    "Planar distance, convex polygons, totally monotone arrays, Monge arrays"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{mt-rltcp-87
-, author =	"M. Mansouri and G. T. Toussaint"
-, title =	"On the reachability of a ladder in two convex polygons"
-, booktitle =	"Proc. 13th IFIP Conf. on System Modelling and Optimization"
-, site =	"Tokyo, Japan"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "M. Mansouri and G. T. Toussaint"
+, title =       "On the reachability of a ladder in two convex polygons"
+, booktitle =   "Proc. 13th IFIP Conf. on System Modelling and Optimization"
+, site =        "Tokyo, Japan"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{mt-tqcp-85
-, author =	"M. Mansouri and G. T. Toussaint"
-, title =	"Translation queries for convex polygons"
-, booktitle =	"Proc. IASTED, International Symposium on Robotics and Automation"
-, site =	"Lugano, Switzerland"
-, year =	1985
-, update =	"98.07 bibrelex"
+, author =      "M. Mansouri and G. T. Toussaint"
+, title =       "Translation queries for convex polygons"
+, booktitle =   "Proc. IASTED, International Symposium on Robotics and Automation"
+, site =        "Lugano, Switzerland"
+, year =        1985
+, update =      "98.07 bibrelex"
 }
 
 @article{mt-tqcp-86
-, author =	"M. Mansouri and G. T. Toussaint"
-, title =	"Translation queries for convex polygons"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	1
-, number =	3
-, year =	1986
-, pages =	"90--95"
-, update =	"96.09 devillers, 94.05 devillers, 93.09 milone+mitchell"
+, author =      "M. Mansouri and G. T. Toussaint"
+, title =       "Translation queries for convex polygons"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      1
+, number =      3
+, year =        1986
+, pages =       "90--95"
+, update =      "96.09 devillers, 94.05 devillers, 93.09 milone+mitchell"
 }
 
 @article{m-nmseo-84
-, author =	"M. M{\"a}ntyl{\"a}"
-, title =	"A Note on the Modeling Space of {Euler} Operators"
-, journal =	"Comput. Vison Graph. Image Process."
-, volume =	26
-, year =	1984
-, pages =	"45--60"
-, update =	"98.03 bibrelex"
+, author =      "M. M{\"a}ntyl{\"a}"
+, title =       "A Note on the Modeling Space of {Euler} Operators"
+, journal =     "Comput. Vison Graph. Image Process."
+, volume =      26
+, year =        1984
+, pages =       "45--60"
+, update =      "98.03 bibrelex"
 }
 
 @book{m-ism-88
-, author =	"M. M{\"a}ntyl{\"a}"
-, title =	"An Introduction to Solid Modeling"
-, publisher =	"Computer Science Press"
-, address =	"Rockville, MD"
-, year =	1988
-, update =	"93.09 devillers+goodrich"
+, author =      "M. M{\"a}ntyl{\"a}"
+, title =       "An Introduction to Solid Modeling"
+, publisher =   "Computer Science Press"
+, address =     "Rockville, MD"
+, year =        1988
+, update =      "93.09 devillers+goodrich"
 }
 
 @techreport{m-ismp1-84
-, author =	"M. M{\"a}ntyl{\"a}"
-, title =	"An introduction to solid modeling, part {I}: fundamentals"
-, type =	"Report"
-, number =	"HTKK-TKO-C10"
-, institution =	"Lab. Inform. Process., Helsinki Univ. Tech."
-, address =	"Helsinki, Finland"
-, year =	1984
+, author =      "M. M{\"a}ntyl{\"a}"
+, title =       "An introduction to solid modeling, part {I}: fundamentals"
+, type =        "Report"
+, number =      "HTKK-TKO-C10"
+, institution = "Lab. Inform. Process., Helsinki Univ. Tech."
+, address =     "Helsinki, Finland"
+, year =        1984
 }
 
 @techreport{m-ismp2-84
-, author =	"M. M{\"a}ntyl{\"a}"
-, title =	"An introduction to solid modeling, part {II}: boundary models"
-, type =	"Report"
-, number =	"HTKK-TKO-C11"
-, institution =	"Lab. Inform. Process., Helsinki Univ. Tech."
-, address =	"Helsinki, Finland"
-, year =	1984
+, author =      "M. M{\"a}ntyl{\"a}"
+, title =       "An introduction to solid modeling, part {II}: boundary models"
+, type =        "Report"
+, number =      "HTKK-TKO-C11"
+, institution = "Lab. Inform. Process., Helsinki Univ. Tech."
+, address =     "Helsinki, Finland"
+, year =        1984
 }
 
 @techreport{m-ismp3-84
-, author =	"M. M{\"a}ntyl{\"a}"
-, title =	"An introduction to solid modeling, part {III}: advanced topics"
-, type =	"Report"
-, number =	"HTKK-TKO-C12"
-, institution =	"Lab. Inform. Process., Helsinki Univ. Tech."
-, address =	"Helsinki, Finland"
-, year =	1984
+, author =      "M. M{\"a}ntyl{\"a}"
+, title =       "An introduction to solid modeling, part {III}: advanced topics"
+, type =        "Report"
+, number =      "HTKK-TKO-C12"
+, institution = "Lab. Inform. Process., Helsinki Univ. Tech."
+, address =     "Helsinki, Finland"
+, year =        1984
 }
 
 @article{m-ctstm-83
-, author =	"M. J. M{\"a}ntyl{\"a}"
-, title =	"Computational topology: a study of topological manipulations and interrogations in computer graphics and geometric modeling"
-, journal =	"Acta Polytech. Scand. Math. Comput. Sci. Ser."
-, volume =	37
-, year =	1983
-, pages =	"??"
+, author =      "M. J. M{\"a}ntyl{\"a}"
+, title =       "Computational topology: a study of topological manipulations and interrogations in computer graphics and geometric modeling"
+, journal =     "Acta Polytech. Scand. Math. Comput. Sci. Ser."
+, volume =      37
+, year =        1983
+, pages =       "??"
 }
 
 @article{ms-gsmeo-82
-, author =	"M. J. M{\"a}ntyl{\"a} and R. Sulonen"
-, title =	"{GWB}: {A} solid modeler with {Euler} operators"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	2
-, number =	5
-, year =	1982
-, pages =	"17--31"
+, author =      "M. J. M{\"a}ntyl{\"a} and R. Sulonen"
+, title =       "{GWB}: {A} solid modeler with {Euler} operators"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      2
+, number =      5
+, year =        1982
+, pages =       "17--31"
 }
 
 @article{msv-pedse-86
-, author =	"Y. Maon and B. Schieber and U. Vishkin"
-, title =	"Parallel Ear Decomposition Search (EDS) and $st$-Numbering in Graphs"
-, journal =	"Theoret. Comput. Sci."
-, volume =	47
-, year =	1986
-, pages =	"277--298"
-, update =	"94.05 tamassia"
+, author =      "Y. Maon and B. Schieber and U. Vishkin"
+, title =       "Parallel Ear Decomposition Search (EDS) and $st$-Numbering in Graphs"
+, journal =     "Theoret. Comput. Sci."
+, volume =      47
+, year =        1986
+, pages =       "277--298"
+, update =      "94.05 tamassia"
 }
 
 @inproceedings{m-hphc-90
-, author =	"D. Maple"
-, title =	"A hierarchy preserving hierarchical compaction"
-, booktitle =	"Proc. 27th Design Autom. Conf."
-, year =	1990
-, pages =	"375--381"
-, update =	"98.03 bibrelex"
+, author =      "D. Maple"
+, title =       "A hierarchy preserving hierarchical compaction"
+, booktitle =   "Proc. 27th Design Autom. Conf."
+, year =        1990
+, pages =       "375--381"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{maf-dgoap-96
-, author =	"C. D. Maranas and I. P. Androulakis and C. A. Floudas"
-, title =	"A deterministic global optimization approach for the protein folding problem"
-, editor =	"P. M. Pardalos and D. Shalloway and G. Xue"
-, booktitle =	"Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding"
-, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
-, volume =	23
-, publisher =	"America Mathematical Society"
-, year =	1996
-, pages =	"133--150"
-, update =	"02.03 orourke"
+, author =      "C. D. Maranas and I. P. Androulakis and C. A. Floudas"
+, title =       "A deterministic global optimization approach for the protein folding problem"
+, editor =      "P. M. Pardalos and D. Shalloway and G. Xue"
+, booktitle =   "Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding"
+, series =      "DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
+, volume =      23
+, publisher =   "America Mathematical Society"
+, year =        1996
+, pages =       "133--150"
+, update =      "02.03 orourke"
 }
 
 @article{mm-sscep-73
-, author =	"J. Marasa and D. Matula"
-, title =	"A Simulative Study of Correlated Error Propagation in Various Finite-Precision Arithmetics"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-22"
-, number =	6
-, month =	jun
-, year =	1973
-, pages =	"587--597"
-, update =	"98.03 bibrelex"
+, author =      "J. Marasa and D. Matula"
+, title =       "A Simulative Study of Correlated Error Propagation in Various Finite-Precision Arithmetics"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-22"
+, number =      6
+, month =       jun
+, year =        1973
+, pages =       "587--597"
+, update =      "98.03 bibrelex"
 }
 
 @article{mbhrr-shudg-95
-, author =	"M. V. Marathe and H. Breu and H. B. {Hunt III} and S. S. Ravi and D. J. Rosenkrantz"
-, title =	"Simple heuristics for unit disk graphs"
-, journal =	"Networks"
-, volume =	25
-, year =	1995
-, pages =	"59--68"
-, update =	"97.07 agarwal"
+, author =      "M. V. Marathe and H. Breu and H. B. {Hunt III} and S. S. Ravi and D. J. Rosenkrantz"
+, title =       "Simple heuristics for unit disk graphs"
+, journal =     "Networks"
+, volume =      25
+, year =        1995
+, pages =       "59--68"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{mhr-gbaig-92
-, author =	"M. V. Marathe and H. B. {Hunt III} and S. S. Ravi"
-, title =	"Geometry-based approximations for intersection graphs"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"244--249"
-, cites =	"ccj-udg-90, cs-splg-88, gj-cigtn-79, g-agtpg-80, hm-ascpp-85, be-lrtaw-85, b-aancp-83, fr-amdst-92, gl-ofcg-88, h-fata-80, h-ebssv-83, i-cigol-90, i-amids-91, k-amrts-84, s-caig-87, yws-opmtd-84, wk-stglp-88, be-avcpg-82, kt-eprc-81, r-gtaps-78, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M. V. Marathe and H. B. {Hunt III} and S. S. Ravi"
+, title =       "Geometry-based approximations for intersection graphs"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "244--249"
+, cites =       "ccj-udg-90, cs-splg-88, gj-cigtn-79, g-agtpg-80, hm-ascpp-85, be-lrtaw-85, b-aancp-83, fr-amdst-92, gl-ofcg-88, h-fata-80, h-ebssv-83, i-cigol-90, i-amids-91, k-amrts-84, s-caig-87, yws-opmtd-84, wk-stglp-88, be-avcpg-82, kt-eprc-81, r-gtaps-78, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{mrhr-hsudg-93
-, author =	"M. V. Marathe and V. Radhakrishnan and H. B. {Hunt III} and S. S. Ravi"
-, title =	"Hierarchically Specified Unit Disk Graphs"
-, booktitle =	"Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '93"
-, institution =	"SUNY Albany"
-, year =	1993
-, pages =	"??"
-, update =	"98.07 bibrelex, 93.09 milone+mitchell"
+, author =      "M. V. Marathe and V. Radhakrishnan and H. B. {Hunt III} and S. S. Ravi"
+, title =       "Hierarchically Specified Unit Disk Graphs"
+, booktitle =   "Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '93"
+, institution = "SUNY Albany"
+, year =        1993
+, pages =       "??"
+, update =      "98.07 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{m-csgcf-96
-, author =	"Pedro V. Marcal"
-, title =	"Constructive solid geometry, the CAD-FEM connection"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"157--167"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Pedro V. Marcal"
+, title =       "Constructive solid geometry, the CAD-FEM connection"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "157--167"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @inproceedings{m-pcppi-81
-, author =	"A. Marchetti-Spaccamela"
-, title =	"The $p$-center problem in the plane is {NP}-complete"
-, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
-, year =	1981
-, pages =	"31--40"
+, author =      "A. Marchetti-Spaccamela"
+, title =       "The $p$-center problem in the plane is {NP}-complete"
+, booktitle =   "Proc. 19th Allerton Conf. Commun. Control Comput."
+, year =        1981
+, pages =       "31--40"
 }
 
 @inproceedings{ms-fmapp-89
-, author =	"O. Marcotte and Subhash Suri"
-, title =	"Fast matching algorithms for points on a polygon"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"60--65"
-, succeeds =	"ms-gm-89"
-, precedes =	"ms-fmapp-91"
-, update =	"98.03 mitchell"
+, author =      "O. Marcotte and Subhash Suri"
+, title =       "Fast matching algorithms for points on a polygon"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "60--65"
+, succeeds =    "ms-gm-89"
+, precedes =    "ms-fmapp-91"
+, update =      "98.03 mitchell"
 }
 
 @article{ms-fmapp-91
-, author =	"O. Marcotte and Subhash Suri"
-, title =	"Fast matching algorithms for points on a polygon"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"405--422"
-, succeeds =	"ms-fmapp-89"
-, update =	"98.03 mitchell"
+, author =      "O. Marcotte and Subhash Suri"
+, title =       "Fast matching algorithms for points on a polygon"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "405--422"
+, succeeds =    "ms-fmapp-89"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ms-gm-89
-, author =	"O. Marcotte and Subhash Suri"
-, title =	"On geometric matching"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"302--314"
-, precedes =	"ms-fmapp-89"
-, cites =	"akt-om-84, a-nemts-83, c-wcanh-76, df-pamwe-84, gh-ospqs-87, kl-tscap-75, kk-altag-88, k-aapge-78, l-conm-76, ps-coac-82, v-ghm-88, wpmk-bgmpl-86, e-mmpv-65, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "O. Marcotte and Subhash Suri"
+, title =       "On geometric matching"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "302--314"
+, precedes =    "ms-fmapp-89"
+, cites =       "akt-om-84, a-nemts-83, c-wcanh-76, df-pamwe-84, gh-ospqs-87, kl-tscap-75, kk-altag-88, k-aapge-78, l-conm-76, ps-coac-82, v-ghm-88, wpmk-bgmpl-86, e-mmpv-65, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{mkb-ma-79
-, author =	"K. V. Mardia and J. T. Kent and J. M. Bibby"
-, title =	"Multivariate Analysis"
-, journal =	"Academic Press"
-, volume =	"??"
-, year =	1979
-, pages =	"213--250"
-, update =	"01.07 devillers, 98.07 bibrelex"
+, author =      "K. V. Mardia and J. T. Kent and J. M. Bibby"
+, title =       "Multivariate Analysis"
+, journal =     "Academic Press"
+, volume =      "??"
+, year =        1979
+, pages =       "213--250"
+, update =      "01.07 devillers, 98.07 bibrelex"
 }
 
 @inproceedings{m-paice-78
-, author =	"M. Marek-Sadowska"
-, title =	"Planarization Algorithms for Integrated Circuits Engineering"
-, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
-, year =	1978
-, pages =	"919--923"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. Marek-Sadowska"
+, title =       "Planarization Algorithms for Integrated Circuits Engineering"
+, booktitle =   "Proc. IEEE Internat. Sympos. on Circuits and Systems"
+, year =        1978
+, pages =       "919--923"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{ml-cascv-89
-, author =	"M. Maresca and H. Li"
-, title =	"Connection autonomy and {SIMD} computers: a {VLSI} implementation"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	7
-, year =	1989
-, pages =	"302--320"
-, update =	"98.11 bibrelex"
+, author =      "M. Maresca and H. Li"
+, title =       "Connection autonomy and {SIMD} computers: a {VLSI} implementation"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      7
+, year =        1989
+, pages =       "302--320"
+, update =      "98.11 bibrelex"
 }
 
 @article{m-egtcc-88
-, author =	"G. A. Margulis"
-, title =	"Explicit group-theoretical constructions of combinatorial schemes and their applications to the design of expanders and superconcentrators"
-, journal =	"Problemy Peredachi Informatsii"
-, volume =	24
-, year =	1988
-, pages =	"51--60"
-, note =	"In Russian, Englisch Translation in Problems of Information Transmission 24, 39-46"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "G. A. Margulis"
+, title =       "Explicit group-theoretical constructions of combinatorial schemes and their applications to the design of expanders and superconcentrators"
+, journal =     "Problemy Peredachi Informatsii"
+, volume =      24
+, year =        1988
+, pages =       "51--60"
+, note =        "In Russian, Englisch Translation in Problems of Information Transmission 24, 39-46"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{mu-ps-94
-, author =	"A. Mariano and L. Upson"
-, title =	"Penumbral Shadows"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	390
-, keywords =	"video review"
-, cites =	"hs-rt-67, fdfh-cgpp-90, v-gspc-92, t-caals-92, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones"
+, author =      "A. Mariano and L. Upson"
+, title =       "Penumbral Shadows"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       390
+, keywords =    "video review"
+, cites =       "hs-rt-67, fdfh-cgpp-90, v-gspc-92, t-caals-92, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones"
 }
 
 @techreport{mlk-mstmw-76
-, author =	"D. M. Mark and J. J. Little and D. G. Kirkpatrick"
-, title =	"Minimum spanning trees and minimum weight triangulations"
-, type =	"Report"
-, number =	8
-, institution =	"Geog. Data Struct. Project, Simon Fraser Univ."
-, address =	"Burnaby, BC"
-, year =	1976
-, keywords =	"survey paper, design of algorithms, triangulations, minimum spanning trees"
+, author =      "D. M. Mark and J. J. Little and D. G. Kirkpatrick"
+, title =       "Minimum spanning trees and minimum weight triangulations"
+, type =        "Report"
+, number =      8
+, institution = "Geog. Data Struct. Project, Simon Fraser Univ."
+, address =     "Burnaby, BC"
+, year =        1976
+, keywords =    "survey paper, design of algorithms, triangulations, minimum spanning trees"
 }
 
 @article{mnp-gg-90
-, author =	"X. Markenscoff and L. Ni and C. H. Papadimitriou"
-, title =	"The geometry of grasping"
-, journal =	"Internat. J. Robot. Res."
-, volume =	9
-, number =	1
-, month =	feb
-, year =	1990
-, update =	"98.03 bibrelex"
+, author =      "X. Markenscoff and L. Ni and C. H. Papadimitriou"
+, title =       "The geometry of grasping"
+, journal =     "Internat. J. Robot. Res."
+, volume =      9
+, number =      1
+, month =       feb
+, year =        1990
+, update =      "98.03 bibrelex"
 }
 
 @article{mnp-ogp-89
-, author =	"X. Markenscoff and L. Ni and Ch. H. Papadimitriou"
-, title =	"Optimal Grip of a Polygon"
-, journal =	"Internat. J. Robot. Res."
-, volume =	8
-, number =	2
-, year =	1989
-, pages =	"17--29"
-, update =	"98.07 bibrelex"
+, author =      "X. Markenscoff and L. Ni and Ch. H. Papadimitriou"
+, title =       "Optimal Grip of a Polygon"
+, journal =     "Internat. J. Robot. Res."
+, volume =      8
+, number =      2
+, year =        1989
+, pages =       "17--29"
+, update =      "98.07 bibrelex"
 }
 
 @article{mw-fowf-80
-, author =	"G. Markowsky and M. A. Wesley"
-, title =	"Fleshing out wire frames"
-, journal =	"IBM J. Res. Develop."
-, volume =	24
-, number =	5
-, year =	1980
-, pages =	"582--597"
+, author =      "G. Markowsky and M. A. Wesley"
+, title =       "Fleshing out wire frames"
+, journal =     "IBM J. Res. Develop."
+, volume =      24
+, number =      5
+, year =        1980
+, pages =       "582--597"
 }
 
 @article{m-fsndt-91
-, author =	"J. Marks"
-, title =	"A formal specification for network diagrams that facilitates automated design"
-, journal =	"J. Visual Lang. Comput."
-, volume =	2
-, year =	1991
-, pages =	"395--414"
-, keywords =	"graph drawing"
-, update =	"94.01 tamassia"
+, author =      "J. Marks"
+, title =       "A formal specification for network diagrams that facilitates automated design"
+, journal =     "J. Visual Lang. Comput."
+, volume =      2
+, year =        1991
+, pages =       "395--414"
+, keywords =    "graph drawing"
+, update =      "94.01 tamassia"
 }
 
 @article{m-rtisu-86
-, author =	"E. Marom"
-, title =	"Real-time image subtraction using a liquid crystal light valve"
-, journal =	"Optical. Eng."
-, volume =	25
-, number =	2
-, year =	1986
-, pages =	"274--276"
-, update =	"97.11 bibrelex"
+, author =      "E. Marom"
+, title =       "Real-time image subtraction using a liquid crystal light valve"
+, journal =     "Optical. Eng."
+, volume =      25
+, number =      2
+, year =        1986
+, pages =       "274--276"
+, update =      "97.11 bibrelex"
 }
 
 @book{m-vcihr-82
-, author =	"D. Marr"
-, title =	"Vision: {A} computational investigation into human representation and processing of visual information"
-, publisher =	"W. H. Freeman"
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "D. Marr"
+, title =       "Vision: {A} computational investigation into human representation and processing of visual information"
+, publisher =   "W. H. Freeman"
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @techreport{mn-rrsot-77
-, author =	"D. Marr and H. K. Nishihara"
-, title =	"Representation and recognition of the spatial organization of three dimensional shapes"
-, type =	"Report"
-, number =	"AIM 416"
-, institution =	"Comput. Sci. Lab., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1977
+, author =      "D. Marr and H. K. Nishihara"
+, title =       "Representation and recognition of the spatial organization of three dimensional shapes"
+, type =        "Report"
+, number =      "AIM 416"
+, institution = "Comput. Sci. Lab., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1977
 }
 
 @article{mps-woaas-92
-, author =	"C. Martel and A. Park and R. Subramonian"
-, title =	"Work-optimal asynchronous algorithms for shared memory parallel computers"
-, journal =	"SIAM J. Comput."
-, volume =	21
-, number =	6
-, year =	1992
-, pages =	"1070--1099"
-, update =	"96.09 orourke"
+, author =      "C. Martel and A. Park and R. Subramonian"
+, title =       "Work-optimal asynchronous algorithms for shared memory parallel computers"
+, journal =     "SIAM J. Comput."
+, volume =      21
+, number =      6
+, year =        1992
+, pages =       "1070--1099"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{msp-apaag-90
-, author =	"C. Martel and R. Subramonian and A. Park"
-, title =	"Asynchronous {PRAM}s are (almost) as good as Synchronous {PRAM}s"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"590--599"
-, update =	"96.09 orourke"
+, author =      "C. Martel and R. Subramonian and A. Park"
+, title =       "Asynchronous {PRAM}s are (almost) as good as Synchronous {PRAM}s"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "590--599"
+, update =      "96.09 orourke"
 }
 
 @book{m-jtlfe-62
-, author =	"G. Martelli"
-, title =	"Jemmy Twitcher - {A} Life of the Fourth Earl of Sandwich, 1718-1792"
-, publisher =	"Jonathan Cape"
-, address =	"London, UK"
-, year =	1962
-, update =	"98.07 bibrelex"
+, author =      "G. Martelli"
+, title =       "Jemmy Twitcher - {A} Life of the Fourth Earl of Sandwich, 1718-1792"
+, publisher =   "Jonathan Cape"
+, address =     "London, UK"
+, year =        1962
+, update =      "98.07 bibrelex"
 }
 
 @techreport{m-spai3-91
-, author =	"A. Martin"
-, title =	"A simple primal algorithm for intersecting $3$-polyhedra in linear time"
-, type =	"Technical {Report}"
-, number =	"91-16"
-, institution =	"Dept. Comput. Sci., Univ. British Columbia"
-, address =	"Vancouver, BC"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "A. Martin"
+, title =       "A simple primal algorithm for intersecting $3$-polyhedra in linear time"
+, type =        "Technical {Report}"
+, number =      "91-16"
+, institution = "Dept. Comput. Sci., Univ. British Columbia"
+, address =     "Vancouver, BC"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @book{m-tgis-66
-, author =	"G. E. Martin"
-, title =	"Transformation Geometry: An Introduction to Symmetry"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1966
-, precedes =	"m-tgis-82"
-, update =	"97.11 bibrelex"
+, author =      "G. E. Martin"
+, title =       "Transformation Geometry: An Introduction to Symmetry"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1966
+, precedes =    "m-tgis-82"
+, update =      "97.11 bibrelex"
 }
 
 @book{m-tgis-82
-, author =	"G. E. Martin"
-, title =	"Transformation Geometry: An Introduction to Symmetry"
-, publisher =	"Springer-Verlag"
-, year =	1982
-, succeeds =	"m-tgis-66"
-, update =	"97.11 bibrelex"
+, author =      "G. E. Martin"
+, title =       "Transformation Geometry: An Introduction to Symmetry"
+, publisher =   "Springer-Verlag"
+, year =        1982
+, succeeds =    "m-tgis-66"
+, update =      "97.11 bibrelex"
 }
 
 @article{m-sp628-65
-, author =	"J. L. Martin"
-, title =	"Solution to problem 62-8, spatial navigation"
-, journal =	"SIAM Rev."
-, volume =	7
-, year =	1965
-, pages =	"132--134"
+, author =      "J. L. Martin"
+, title =       "Solution to problem 62-8, spatial navigation"
+, journal =     "SIAM Rev."
+, volume =      7
+, year =        1965
+, pages =       "132--134"
 }
 
 @article{ma-vdomv-83
-, author =	"W. N. Martin and J. K. Aggarwal"
-, title =	"Volumetric description of objects from multiple views"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	5
-, year =	1983
-, pages =	"150--158"
-, update =	"98.11 bibrelex"
+, author =      "W. N. Martin and J. K. Aggarwal"
+, title =       "Volumetric description of objects from multiple views"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      5
+, year =        1983
+, pages =       "150--158"
+, update =      "98.11 bibrelex"
 }
 
 @article{mbddl-fnapm-93
-, author =	"Y. Martin and M. Bures and E. Danaher and J. DeLazzer and I. Lico"
-, title =	"A fast new approach to pharmacophore mapping and its application to dopaminergic and benzodiazepine agonists"
-, journal =	"J. Computer Aided Molecular Design"
-, volume =	7
-, year =	1993
-, pages =	"83--102"
-, update =	"98.07 bibrelex"
+, author =      "Y. Martin and M. Bures and E. Danaher and J. DeLazzer and I. Lico"
+, title =       "A fast new approach to pharmacophore mapping and its application to dopaminergic and benzodiazepine agonists"
+, journal =     "J. Computer Aided Molecular Design"
+, volume =      7
+, year =        1993
+, pages =       "83--102"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{mbw-sdtds-90
-, author =	"Y. C. Martin and M. G. Bures and P. Willet"
-, title =	"Searching databases of three-dimensional structures"
-, editor =	"K. Lipkowitz and D. B. Boyd"
-, booktitle =	"Reviews in Computational Chemistry"
-, volume =	1
-, publisher =	"VCH Publishers"
-, year =	1990
-, pages =	"213--256"
-, update =	"98.07 bibrelex"
+, author =      "Y. C. Martin and M. G. Bures and P. Willet"
+, title =       "Searching databases of three-dimensional structures"
+, editor =      "K. Lipkowitz and D. B. Boyd"
+, booktitle =   "Reviews in Computational Chemistry"
+, volume =      1
+, publisher =   "VCH Publishers"
+, year =        1990
+, pages =       "213--256"
+, update =      "98.07 bibrelex"
 }
 
 @article{ms-chrfm-
-, author =	"T. Martinetz and K. Schulten"
-, title =	"Competitive {Hebain} rule forms manifold representing networks"
-, journal =	"Neural Networks"
-, volume =	"??"
-, year =	"??"
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "T. Martinetz and K. Schulten"
+, title =       "Competitive {Hebain} rule forms manifold representing networks"
+, journal =     "Neural Networks"
+, volume =      "??"
+, year =        "??"
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @article{m-cpwpb-91
-, author =	"H. Martini"
-, title =	"Convex polytopes whose projections bodies and difference sets are polars"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"83--91"
+, author =      "H. Martini"
+, title =       "Convex polytopes whose projections bodies and difference sets are polars"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "83--91"
 }
 
 @article{ms-mcppd-98
-, author =	"H. Martini and V. Soltan"
-, title =	"Minimum convex partition of polygonal domains by guillotine cuts"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"291--304"
-, update =	"01.07 orourke"
+, author =      "H. Martini and V. Soltan"
+, title =       "Minimum convex partition of polygonal domains by guillotine cuts"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "291--304"
+, update =      "01.07 orourke"
 }
 
 @inproceedings{mmw-occha-96
-, author =	"V. Martynchik and N. Metelski and D. Wood"
-, title =	"{O-Convexity}: {Computing} hulls, approximations, and orientation sets"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"2--7"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "V. Martynchik and N. Metelski and D. Wood"
+, title =       "{O-Convexity}: {Computing} hulls, approximations, and orientation sets"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "2--7"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @article{m-pdibp-72
-, author =	"K. Maruyama"
-, title =	"A procedure to determine intersections between polyhedral objects"
-, journal =	"Internat. J. Comput. Inform. Sci."
-, volume =	1
-, year =	1972
-, pages =	"255--266"
+, author =      "K. Maruyama"
+, title =       "A procedure to determine intersections between polyhedral objects"
+, journal =     "Internat. J. Comput. Inform. Sci."
+, volume =      1
+, year =        1972
+, pages =       "255--266"
 }
 
 @techreport{m-svsp-72
-, author =	"K. Maruyama"
-, title =	"A study of visual shape perception"
-, type =	"Report"
-, number =	"UIUCDCS-R-72-533"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1972
+, author =      "K. Maruyama"
+, title =       "A study of visual shape perception"
+, type =        "Report"
+, number =      "UIUCDCS-R-72-533"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1972
 }
 
 @inproceedings{m-pprsp-98
-, author =	"Michael N. Maryukov"
-, title =	"Problems of Pattern Recognition on the Set of Polyhedra and their Plane Images"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"115--116"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Michael N. Maryukov"
+, title =       "Problems of Pattern Recognition on the Set of Polyhedra and their Plane Images"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "115--116"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{mn-ekbps-01
-, author =	"A. Marzetta and J. Nievergelt"
-, title =	"Enumerating the {$k$} best plane spanning trees"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	18
-, year =	2001
-, pages =	"55--64"
-, update =	"01.04 smid"
+, author =      "A. Marzetta and J. Nievergelt"
+, title =       "Enumerating the {$k$} best plane spanning trees"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      18
+, year =        2001
+, pages =       "55--64"
+, update =      "01.04 smid"
 }
 
 @mastersthesis{m-aert-95
-, author =	"T. Masada"
-, title =	"An Algorithm for the Enumeration of Regular Triangulations"
-, school =	"Department of Information Science, University of Tokyo"
-, address =	"Tokyo, Japan"
-, month =	mar
-, year =	1995
-, keywords =	"master thesis"
-, update =	"97.11 bibrelex"
+, author =      "T. Masada"
+, title =       "An Algorithm for the Enumeration of Regular Triangulations"
+, school =      "Department of Information Science, University of Tokyo"
+, address =     "Tokyo, Japan"
+, month =       mar
+, year =        1995
+, keywords =    "master thesis"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-ossae-94
-, author =	"T. Masada"
-, title =	"An Output Size Sensitive Algorithm for the Enumeration of Regular Triangulations"
-, type =	"Technical {Report}"
-, number =	"94-1"
-, institution =	"Department of Information Science, University of Tokyo"
-, address =	"Tokyo, Japan"
-, month =	nov
-, year =	1994
-, update =	"97.11 bibrelex"
+, author =      "T. Masada"
+, title =       "An Output Size Sensitive Algorithm for the Enumeration of Regular Triangulations"
+, type =        "Technical {Report}"
+, number =      "94-1"
+, institution = "Department of Information Science, University of Tokyo"
+, address =     "Tokyo, Japan"
+, month =       nov
+, year =        1994
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{mii-ert-96
-, author =	"Tomonari Masada and Hiroshi Imai and Keiko Imai"
-, title =	"Enumeration of Regular Triangulations"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"224--233"
-, cites =	"af-pachv-92, bfs-ccsp-90, c-ochan-91, l-crtpc-94, lst-gbtsh-95, es-itfwr-92, f-iradr-95, gkz-drmd-94, j-3dtlt-89, l-rtp-91, m-ossae-94, m-aert-95, r-dchhd-92, s-chdch-86, s-gbtv-91, s-gbcp-95, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Tomonari Masada and Hiroshi Imai and Keiko Imai"
+, title =       "Enumeration of Regular Triangulations"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "224--233"
+, cites =       "af-pachv-92, bfs-ccsp-90, c-ochan-91, l-crtpc-94, lst-gbtsh-95, es-itfwr-92, f-iradr-95, gkz-drmd-94, j-3dtlt-89, l-rtp-91, m-ossae-94, m-aert-95, r-dchhd-92, s-chdch-86, s-gbtv-91, s-gbcp-95, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @techreport{m-ncscp-78
-, author =	"W. J. Masek"
-, title =	"Some NP-complete Set Covering Problems"
-, type =	"Manuscript"
-, institution =	"MIT"
-, year =	1978
-, update =	"98.07 bibrelex"
+, author =      "W. J. Masek"
+, title =       "Some NP-complete Set Covering Problems"
+, type =        "Manuscript"
+, institution = "MIT"
+, year =        1978
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{m-snpcs-79
-, author =	"W. J. Masek"
-, title =	"Some {NP}-complete set covering problems"
-, year =	1979
-, note =	"unpublished manuscript"
-, update =	"97.11 bibrelex"
+, author =      "W. J. Masek"
+, title =       "Some {NP}-complete set covering problems"
+, year =        1979
+, note =        "unpublished manuscript"
+, update =      "97.11 bibrelex"
 }
 
 @article{ma-oaslm-89
-, author =	"J. Maserjian and P. O. Anderson"
-, title =	"Optically addressed spatial light modulator by {MBE} - grown nipi {MQW} structures"
-, journal =	"Appl. Optics"
-, volume =	28
-, number =	22
-, year =	1989
-, pages =	"4801--4807"
-, update =	"97.11 bibrelex"
+, author =      "J. Maserjian and P. O. Anderson"
+, title =       "Optically addressed spatial light modulator by {MBE} - grown nipi {MQW} structures"
+, journal =     "Appl. Optics"
+, volume =      28
+, number =      22
+, year =        1989
+, pages =       "4801--4807"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{m-apfmc-84
-, author =	"M. T. Mason"
-, title =	"Automatic planning of fine motions: Correctness and completeness"
-, booktitle =	"IEEE International Conference on Robotics"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "M. T. Mason"
+, title =       "Automatic planning of fine motions: Correctness and completeness"
+, booktitle =   "IEEE International Conference on Robotics"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @article{m-cfccc-81
-, author =	"M. T. Mason"
-, title =	"Compliance and force control for computer controlled manipulators"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	"SMC-11"
-, year =	1981
-, pages =	"418--432"
-, update =	"98.03 bibrelex"
+, author =      "M. T. Mason"
+, title =       "Compliance and force control for computer controlled manipulators"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      "SMC-11"
+, year =        1981
+, pages =       "418--432"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{m-cfccc-79
-, author =	"M. T. Mason"
-, title =	"Compliance and Force Control of Computer Controlled Manipulator"
-, number =	"A. I. Memo No. 605"
-, institution =	"Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1979
-, update =	"97.11 bibrelex"
+, author =      "M. T. Mason"
+, title =       "Compliance and Force Control of Computer Controlled Manipulator"
+, number =      "A. I. Memo No. 605"
+, institution = "Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1979
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-mgpo-82
-, author =	"M. T. Mason"
-, title =	"Manipulator grasping and pushing operations"
-, number =	"MIT-AI-TR 690"
-, institution =	"Artificial Intelligence Laboratory, MIT"
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "M. T. Mason"
+, title =       "Manipulator grasping and pushing operations"
+, number =      "MIT-AI-TR 690"
+, institution = "Artificial Intelligence Laboratory, MIT"
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @article{m-mpmpo-86
-, author =	"M. T. Mason"
-, title =	"Mechanics and planning of manipulator pushing operations"
-, journal =	"Internat. J. Robot. Res."
-, volume =	5
-, year =	1986
-, pages =	"53--71"
-, update =	"98.03 agarwal"
+, author =      "M. T. Mason"
+, title =       "Mechanics and planning of manipulator pushing operations"
+, journal =     "Internat. J. Robot. Res."
+, volume =      5
+, year =        1986
+, pages =       "53--71"
+, update =      "98.03 agarwal"
 }
 
 @book{ms-rhmm-85
-, author =	"M. T. Mason and J. K. Salisbury"
-, title =	"Robot hands and the mechanics of manipulation"
-, publisher =	"MIT Press"
-, year =	1985
-, update =	"98.07 bibrelex"
+, author =      "M. T. Mason and J. K. Salisbury"
+, title =       "Robot hands and the mechanics of manipulation"
+, publisher =   "MIT Press"
+, year =        1985
+, update =      "98.07 bibrelex"
 }
 
 @article{m-dac-56
-, author =	"R. M. Mason"
-, title =	"The digital approximation of contours"
-, journal =	"J. ACM"
-, volume =	3
-, year =	1956
-, pages =	"355--359"
+, author =      "R. M. Mason"
+, title =       "The digital approximation of contours"
+, journal =     "J. ACM"
+, volume =      3
+, year =        1956
+, pages =       "355--359"
 }
 
 @book{m-ati-77
-, author =	"W. S. Massey"
-, title =	"Algebraic Topology: {An} Introduction"
-, series =	"Graduate Texts in Mathematics"
-, volume =	56
-, publisher =	"Springer-Verlag"
-, year =	1977
-, update =	"97.11 bibrelex"
+, author =      "W. S. Massey"
+, title =       "Algebraic Topology: {An} Introduction"
+, series =      "Graduate Texts in Mathematics"
+, volume =      56
+, publisher =   "Springer-Verlag"
+, year =        1977
+, update =      "97.11 bibrelex"
 }
 
 @book{m-hct-78
-, author =	"W. S. Massey"
-, title =	"Homology and Cohomology Theory"
-, publisher =	"Marcel Dekker, Inc."
-, address =	"New York, NY"
-, year =	1978
-, update =	"97.11 bibrelex"
+, author =      "W. S. Massey"
+, title =       "Homology and Cohomology Theory"
+, publisher =   "Marcel Dekker, Inc."
+, address =     "New York, NY"
+, year =        1978
+, update =      "97.11 bibrelex"
 }
 
 @article{m-ctqdab-86
-, author =	"Howard Masur"
-, title =	"Closed trajectories for quadratic differentials with an application to billiards"
-, journal =	"Duke Math. J."
-, volume =	53
-, year =	1986
-, pages =	"307--314"
-, update =	"01.04 orourke"
+, author =      "Howard Masur"
+, title =       "Closed trajectories for quadratic differentials with an application to billiards"
+, journal =     "Duke Math. J."
+, volume =      53
+, year =        1986
+, pages =       "307--314"
+, update =      "01.04 orourke"
 }
 
 @article{mih-ccmcp-81
-, author =	"S. Masuyama and T. Ibaraki and T. Hasegawa"
-, title =	"The computational complexity of the $m$-center problem"
-, journal =	"Trans. IECE Japan"
-, volume =	"E 64"
-, number =	2
-, year =	1981
-, pages =	"57--64"
-, update =	"97.11 bibrelex"
+, author =      "S. Masuyama and T. Ibaraki and T. Hasegawa"
+, title =       "The computational complexity of the $m$-center problem"
+, journal =     "Trans. IECE Japan"
+, volume =      "E 64"
+, number =      2
+, year =        1981
+, pages =       "57--64"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-cfaar-95
-, author =	"C. Mata"
-, title =	"A Constant Factor Approximation Algorithm for the Red-Blue Separation Problem"
-, institution =	"Manuscript, Dept. of Computer Science, SUNY Stony Brook, NY"
-, year =	1995
-, keywords =	"TSP, k-MST, approximation, separation"
-, update =	"95.09 mitchell"
+, author =      "C. Mata"
+, title =       "A Constant Factor Approximation Algorithm for the Red-Blue Separation Problem"
+, institution = "Manuscript, Dept. of Computer Science, SUNY Stony Brook, NY"
+, year =        1995
+, keywords =    "TSP, k-MST, approximation, separation"
+, update =      "95.09 mitchell"
 }
 
 @inproceedings{mm-nacsp-97
-, author =	"Cristian Mata and Joseph S. B. Mitchell"
-, title =	"A new algorithm for computing shortest paths in weighted planar subdivisions"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"264--273"
-, cites =	"ar-ppopm-90, ckt-spqwo-95, c-aaspm-87, d-reidt-92, d-lcpgi-93, gmmn-pp0wr-90, gs-pmgsc-85, j-wdmim-97, kg-cgwac-92, ksr-sawrp1-91, ksr-sawrp2-91, lms-awspp-97i, l-ccm-94, lm-crm-95, m-aaspt-91, m-lsppo-92, mp-wrpfs-91, mpk-pravc-87, p-aspmt-85, r-edt-93, rrzm-sgtdr-87, rr-eslmo-90, w-tsplr-57, y-cmstk-82, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "Cristian Mata and Joseph S. B. Mitchell"
+, title =       "A new algorithm for computing shortest paths in weighted planar subdivisions"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "264--273"
+, cites =       "ar-ppopm-90, ckt-spqwo-95, c-aaspm-87, d-reidt-92, d-lcpgi-93, gmmn-pp0wr-90, gs-pmgsc-85, j-wdmim-97, kg-cgwac-92, ksr-sawrp1-91, ksr-sawrp2-91, lms-awspp-97i, l-ccm-94, lm-crm-95, m-aaspt-91, m-lsppo-92, mp-wrpfs-91, mpk-pravc-87, p-aspmt-85, r-edt-93, rrzm-sgtdr-87, rr-eslmo-90, w-tsplr-57, y-cmstk-82, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @techreport{mm-aagtn-94
-, author =	"C. Mata and J. S. B. Mitchell"
-, title =	"Approximation Algorithms for Geometric Tour and Network Design Problems"
-, institution =	"Department of Applied Mathematics, SUNY Stony Brook, NY"
-, year =	1994
-, keywords =	"watchman route, TSP, k-MST, approximation, separation, covering TSP"
-, precedes =	"mm-aagtn-95"
-, update =	"98.03 mitchell, 95.09 mitchell"
+, author =      "C. Mata and J. S. B. Mitchell"
+, title =       "Approximation Algorithms for Geometric Tour and Network Design Problems"
+, institution = "Department of Applied Mathematics, SUNY Stony Brook, NY"
+, year =        1994
+, keywords =    "watchman route, TSP, k-MST, approximation, separation, covering TSP"
+, precedes =    "mm-aagtn-95"
+, update =      "98.03 mitchell, 95.09 mitchell"
 }
 
 @inproceedings{mm-aagtn-95
-, author =	"Cristian Mata and Joseph S. B. Mitchell"
-, title =	"Approximation Algorithms for Geometric Tour and Network Design Problems"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"360--369"
-, keywords =	"watchman route, TSP, k-MST, approximation, separation, covering TSP"
-, succeeds =	"mm-aagtn-94"
-, cites =	"as-sagp-94, ah-aagcs-94, akm-gkp-93, aabv-iagmw-95, bk-rdlsn-93, bcv-cfakm-95, cjn-fswrs-93, cn-owr-88, c-wcanh-76, c-aapts-91, dps-melgr-86, er-ccmsp-93, e-amwt-92, f-cmlrb-92, gh-oaakm-94, grz-edcaa-90, hs-parss-93, irw-sncpp-91, l-fhmlr-86, l-hmdp-87, ll-blcpp-84, m-aagsp-93, n-gagmm-95, py-ebsph-90, py-obspo-92, rw-bspvo-89, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Cristian Mata and Joseph S. B. Mitchell"
+, title =       "Approximation Algorithms for Geometric Tour and Network Design Problems"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "360--369"
+, keywords =    "watchman route, TSP, k-MST, approximation, separation, covering TSP"
+, succeeds =    "mm-aagtn-94"
+, cites =       "as-sagp-94, ah-aagcs-94, akm-gkp-93, aabv-iagmw-95, bk-rdlsn-93, bcv-cfakm-95, cjn-fswrs-93, cn-owr-88, c-wcanh-76, c-aapts-91, dps-melgr-86, er-ccmsp-93, e-amwt-92, f-cmlrb-92, gh-oaakm-94, grz-edcaa-90, hs-parss-93, irw-sncpp-91, l-fhmlr-86, l-hmdp-87, ll-blcpp-84, m-aagsp-93, n-gagmm-95, py-ebsph-90, py-obspo-92, rw-bspvo-89, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @book{m-rsig-75
-, author =	"G. Matheron"
-, title =	"Random Sets and Integral Geometry"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1975
-, update =	"99.11 bibrelex, 98.07 bibrelex"
+, author =      "G. Matheron"
+, title =       "Random Sets and Integral Geometry"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1975
+, update =      "99.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{m-spcg-87
-, author =	"C. Mathieu"
-, title =	"Some problems in computational geometry"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"131--134"
+, author =      "C. Mathieu"
+, title =       "Some problems in computational geometry"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "131--134"
 }
 
 @article{mpy-aedsb-87
-, author =	"C. Mathieu and C. Puech and H. Yahia"
-, title =	"Average efficiency of data structures for binary image processing"
-, journal =	"Inform. Process. Lett."
-, volume =	26
-, year =	1987
-, pages =	"89--93"
+, author =      "C. Mathieu and C. Puech and H. Yahia"
+, title =       "Average efficiency of data structures for binary image processing"
+, journal =     "Inform. Process. Lett."
+, volume =      26
+, year =        1987
+, pages =       "89--93"
 }
 
 @inproceedings{m-sdcpa-93
-, author =	"Y. Matias"
-, title =	"Semi-dynamic closest-pair Algorithms"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"264--271"
-, cites =	"aesw-emstb-90, b-lbact-83, b-dsp-79, b-mdc-80, bs-dcms-76, clr-ia-90, dd-ekdnp-91, dgmp-phfr-92, dm-nuchf-90, fh-nrnna-79, fks-sstwc-84, fw-bitbf-90, grss-rdsdc-93i, grss-sracp-93, hns-psscp-88, km-srsac-91, ms-ufetp-91, m-iaca-89, mv-chpnc-91, m-mdscg-84, ps-cgi-85 , r-ppass-85, s-sisie-91, ss-oaolc-92, sss-oaolc-92, sh-cpp-75, s-mmdpsl-91a, s-mmdpsp-92a, s-ntsdc-90, gmv-ttnct-92, r-pa-76, y-lbact-91, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "Y. Matias"
+, title =       "Semi-dynamic closest-pair Algorithms"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "264--271"
+, cites =       "aesw-emstb-90, b-lbact-83, b-dsp-79, b-mdc-80, bs-dcms-76, clr-ia-90, dd-ekdnp-91, dgmp-phfr-92, dm-nuchf-90, fh-nrnna-79, fks-sstwc-84, fw-bitbf-90, grss-rdsdc-93i, grss-sracp-93, hns-psscp-88, km-srsac-91, ms-ufetp-91, m-iaca-89, mv-chpnc-91, m-mdscg-84, ps-cgi-85 , r-ppass-85, s-sisie-91, ss-oaolc-92, sss-oaolc-92, sh-cpp-75, s-mmdpsl-91a, s-mmdpsp-92a, s-ntsdc-90, gmv-ttnct-92, r-pa-76, y-lbact-91, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{mv-chpnc-91
-, author =	"Y. Matias and U. Vishkin"
-, title =	"Converting high probability into nearly constant time - with appliccations to parallel hashing"
-, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
-, month =	may
-, year =	1991
-, pages =	"307--316"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "Y. Matias and U. Vishkin"
+, title =       "Converting high probability into nearly constant time - with appliccations to parallel hashing"
+, booktitle =   "Proc. 23rd Annu. ACM Sympos. Theory Comput."
+, month =       may
+, year =        1991
+, pages =       "307--316"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{mvn-dgdrv-93
-, author =	"Y. Matias and J. S. Vitter and W.-C. Ni"
-, title =	"Dynamic generation of discrete random variates"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"187--194"
-, update =	"96.09 agarwal, 94.09 vitter"
+, author =      "Y. Matias and J. S. Vitter and W.-C. Ni"
+, title =       "Dynamic generation of discrete random variates"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "187--194"
+, update =      "96.09 agarwal, 94.09 vitter"
 }
 
 @inproceedings{mvw-wbhse-98
-, author =	"Y. Matias and J. S. Vitter and M. Wang"
-, title =	"Wavelet-Based Histograms for Selectivity Estimation"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1998
-, update =	"98.03 agarwal"
+, author =      "Y. Matias and J. S. Vitter and M. Wang"
+, title =       "Wavelet-Based Histograms for Selectivity Estimation"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1998
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{mvy-adsa-94
-, author =	"Y. Matias and J. S. Vitter and N. Young"
-, title =	"Approximate Data Structures with Applications"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"187--194"
-, update =	"94.09 vitter"
+, author =      "Y. Matias and J. S. Vitter and N. Young"
+, title =       "Approximate Data Structures with Applications"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "187--194"
+, update =      "94.09 vitter"
 }
 
 @inproceedings{m-httuc-95
-, author =	"Ji{\v r}{\'\i} Matou{\v s}ek"
-, title =	"A {Helly}-type Theorem for Unions of Convex Sets"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"138--146"
-, keywords =	""
-, cites =	"abfk-pswen-92, ak-pcs-92a, ak-bpn-95, a-htglp-93, a-bbhdn-94, bfl-nhp-90, bk-gdtmc-76, c-lvalp-88, de-ctchp-93, d-httdb-70, dp-epgh-94, e-hrctt-93, e-gtp-59, f-undkd-, g-saaop-92, gm-csfs-61, grs-rt-90, h-usvam-30, l-htpuc-68, m-gofvc-94, m-tphpu-73, msw-sblp-92, m-eat-84, ps-cncsr-90, s-sesc-92, sw-cblpr-92, k-ker-32, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Ji{\v r}{\'\i} Matou{\v s}ek"
+, title =       "A {Helly}-type Theorem for Unions of Convex Sets"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "138--146"
+, keywords =    ""
+, cites =       "abfk-pswen-92, ak-pcs-92a, ak-bpn-95, a-htglp-93, a-bbhdn-94, bfl-nhp-90, bk-gdtmc-76, c-lvalp-88, de-ctchp-93, d-httdb-70, dp-epgh-94, e-hrctt-93, e-gtp-59, f-undkd-, g-saaop-92, gm-csfs-61, grs-rt-90, h-usvam-30, l-htpuc-68, m-gofvc-94, m-tphpu-73, msw-sblp-92, m-eat-84, ps-cncsr-90, s-sesc-92, sw-cblpr-92, k-ker-32, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @techreport{m-aalpl-93
-, author =	"J. Matou{\v s}ek"
-, title =	"Algorithms for abstract linear programming: {Lower} bounds and experiments"
-, institution =	"Princeton University"
-, month =	feb
-, year =	1993
-, comments =	"DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
-, update =	"96.09 agarwal, 93.09 milone+mitchell"
+, author =      "J. Matou{\v s}ek"
+, title =       "Algorithms for abstract linear programming: {Lower} bounds and experiments"
+, institution = "Princeton University"
+, month =       feb
+, year =        1993
+, comments =    "DIMACS Workshop on Randomized Algorithms for Combinatorial Optimization"
+, update =      "96.09 agarwal, 93.09 milone+mitchell"
 }
 
 @techreport{m-ahrc-87
-, author =	"J. Matou{\v s}ek"
-, title =	"Approximate halfplanar range counting"
-, type =	"KAM {Series}"
-, number =	"59-87"
-, institution =	"Charles Univ."
-, address =	"Prague, Czechoslovakia"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "J. Matou{\v s}ek"
+, title =       "Approximate halfplanar range counting"
+, type =        "KAM {Series}"
+, number =      "59-87"
+, institution = "Charles Univ."
+, address =     "Prague, Czechoslovakia"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @article{m-alla-91
-, author =	"J. Matou{\v s}ek"
-, title =	"Approximate levels in line arrangements"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"222--227"
-, update =	"96.09 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Approximate levels in line arrangements"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "222--227"
+, update =      "96.09 agarwal"
 }
 
 @techreport{m-aodq-90
-, author =	"J. Matou{\v s}ek"
-, title =	"Approximations and Optimal Divide-and-Conquer"
-, type =	"Manuscript"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "J. Matou{\v s}ek"
+, title =       "Approximations and Optimal Divide-and-Conquer"
+, type =        "Manuscript"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{m-aogdc-91
-, author =	"J. Matou{\v s}ek"
-, title =	"Approximations and optimal geometric divide-and-conquer"
-, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
-, year =	1991
-, pages =	"505--511"
-, keywords =	"approximations, VC-dimension, shatter function, derandomization, cutting, partition"
-, update =	"00.03 smid, 96.09 agarwal, 93.09 erickson+matousek"
+, author =      "J. Matou{\v s}ek"
+, title =       "Approximations and optimal geometric divide-and-conquer"
+, booktitle =   "Proc. 23rd Annu. ACM Sympos. Theory Comput."
+, year =        1991
+, pages =       "505--511"
+, keywords =    "approximations, VC-dimension, shatter function, derandomization, cutting, partition"
+, update =      "00.03 smid, 96.09 agarwal, 93.09 erickson+matousek"
 }
 
 @article{m-aogdc-95
-, author =	"J. Matou{\v s}ek"
-, title =	"Approximations and optimal geometric divide-and-conquer"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	50
-, year =	1995
-, pages =	"203--208"
-, update =	"00.03 smid"
+, author =      "J. Matou{\v s}ek"
+, title =       "Approximations and optimal geometric divide-and-conquer"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      50
+, year =        1995
+, pages =       "203--208"
+, update =      "00.03 smid"
 }
 
 @unpublished{m-cag-
-, author =	"J. Matou{\v s}ek"
-, title =	"Combinatorial and algorithmic geometry"
-, note =	"Unpublished lecture notes"
-, update =	"98.07 bibrelex"
+, author =      "J. Matou{\v s}ek"
+, title =       "Combinatorial and algorithmic geometry"
+, note =        "Unpublished lecture notes"
+, update =      "98.07 bibrelex"
 }
 
 @article{m-cde-91
-, author =	"J. Matou{\v s}ek"
-, title =	"Computing dominances in {$E^{n}$}"
-, journal =	"Inform. Process. Lett."
-, volume =	38
-, year =	1991
-, pages =	"277--278"
-, update =	"96.09 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Computing dominances in {$E^{n}$}"
+, journal =     "Inform. Process. Lett."
+, volume =      38
+, year =        1991
+, pages =       "277--278"
+, update =      "96.09 agarwal"
 }
 
 @incollection{m-ccpps-91
-, author =	"J. Matou{\v s}ek"
-, title =	"Computing the center of planar point sets"
-, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
-, booktitle =	"Computational Geometry: Papers from the DIMACS Special Year"
-, publisher =	"American Mathematical Society"
-, address =	"Providence"
-, year =	1991
-, pages =	"221--230"
-, keywords =	"centerpoint, parametric search, cutting, k-level"
-, update =	"98.07 agarwal, 96.05 agarwal, 93.09 matousek"
+, author =      "J. Matou{\v s}ek"
+, title =       "Computing the center of planar point sets"
+, editor =      "J. E. Goodman and R. Pollack and W. Steiger"
+, booktitle =   "Computational Geometry: Papers from the DIMACS Special Year"
+, publisher =   "American Mathematical Society"
+, address =     "Providence"
+, year =        1991
+, pages =       "221--230"
+, keywords =    "centerpoint, parametric search, cutting, k-level"
+, update =      "98.07 agarwal, 96.05 agarwal, 93.09 matousek"
 }
 
 @inproceedings{m-cen-89
-, author =	"J. Matou{\v s}ek"
-, title =	"Construction of $\epsilon$-nets"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"1--10"
-, precedes =	"m-cen-90"
-, cites =	"aks-osn-83, c-ghscp-79, csss-otass-89, e-acg-87, ew-cbtda-86, hw-ensrq-87, l-roifc-75, m-ahrc-87, s-pptld-86, w-pttco-88, ZZZ"
-, update =	"98.03 bibrelex, 96.09 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Construction of $\epsilon$-nets"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "1--10"
+, precedes =    "m-cen-90"
+, cites =       "aks-osn-83, c-ghscp-79, csss-otass-89, e-acg-87, ew-cbtda-86, hw-ensrq-87, l-roifc-75, m-ahrc-87, s-pptld-86, w-pttco-88, ZZZ"
+, update =      "98.03 bibrelex, 96.09 agarwal"
 }
 
 @article{m-cen-90
-, author =	"J. Matou{\v s}ek"
-, title =	"Construction of $\epsilon$-nets"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"427--448"
-, succeeds =	"m-cen-89"
-, update =	"96.09 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Construction of $\epsilon$-nets"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "427--448"
+, succeeds =    "m-cen-89"
+, update =      "96.09 agarwal"
 }
 
 @techreport{m-cha-90t
-, author =	"J. Matou{\v s}ek"
-, title =	"Cutting Hyperplane Arrangements"
-, type =	"Technical {Report}"
-, number =	"90-7"
-, institution =	"DIMACS, Rutgers Univ."
-, year =	1990
-, precedes =	"m-cha-90i"
-, update =	"96.09 agarwal, 93.09 milone+mitchell"
+, author =      "J. Matou{\v s}ek"
+, title =       "Cutting Hyperplane Arrangements"
+, type =        "Technical {Report}"
+, number =      "90-7"
+, institution = "DIMACS, Rutgers Univ."
+, year =        1990
+, precedes =    "m-cha-90i"
+, update =      "96.09 agarwal, 93.09 milone+mitchell"
 }
 
 @inproceedings{m-cha-90i
-, author =	"J. Matou{\v s}ek"
-, title =	"Cutting hyperplane arrangements"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"1--9"
-, precedes =	"m-cha-91"
-, cites =	"ahu-dsa-83, a-dapal-89, a-rsoas-89, cegs-lscaa-89,  cf-dvrsi-88t, c-arscg-88, c-racpq-88, cegsw-ccbac-88, e-acg-87, eghsssw-irals-89, eos-calha-86, hw-ensrq-87, m-cen-89, m-ahrc-87, pw-snben-89, yy-gaddg-85, ZZZ"
-, update =	"97.11 bibrelex, 96.09 agarwal, 93.09 milone+mitchell"
+, author =      "J. Matou{\v s}ek"
+, title =       "Cutting hyperplane arrangements"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "1--9"
+, precedes =    "m-cha-91"
+, cites =       "ahu-dsa-83, a-dapal-89, a-rsoas-89, cegs-lscaa-89,  cf-dvrsi-88t, c-arscg-88, c-racpq-88, cegsw-ccbac-88, e-acg-87, eghsssw-irals-89, eos-calha-86, hw-ensrq-87, m-cen-89, m-ahrc-87, pw-snben-89, yy-gaddg-85, ZZZ"
+, update =      "97.11 bibrelex, 96.09 agarwal, 93.09 milone+mitchell"
 }
 
 @article{m-cha-91
-, author =	"J. Matou{\v s}ek"
-, title =	"Cutting hyperplane arrangements"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"385--406"
-, succeeds =	"m-cha-90i"
-, update =	"96.09 agarwal, 93.09 milone+mitchell"
+, author =      "J. Matou{\v s}ek"
+, title =       "Cutting hyperplane arrangements"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "385--406"
+, succeeds =    "m-cha-90i"
+, update =      "96.09 agarwal, 93.09 milone+mitchell"
 }
 
 @article{m-dcg-96
-, author =	"J. Matou{\v s}ek"
-, title =	"Derandomization in computational geometry"
-, journal =	"J. Algorithms"
-, volume =	20
-, year =	1996
-, pages =	"545--580"
-, update =	"97.03 smid"
+, author =      "J. Matou{\v s}ek"
+, title =       "Derandomization in computational geometry"
+, journal =     "J. Algorithms"
+, volume =      20
+, year =        1996
+, pages =       "545--580"
+, update =      "97.03 smid"
 }
 
 @incollection{m-dcg-00
-, author =	"Ji{\v r}{\'\i} Matou{\v s}ek"
-, title =	"Derandomization in Computational Geometry"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"559--595"
-, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 13 of su-hcg-00"
+, author =      "Ji{\v r}{\'\i} Matou{\v s}ek"
+, title =       "Derandomization in Computational Geometry"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "559--595"
+, update =      "00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 13 of su-hcg-00"
 }
 
 @inproceedings{m-ept-91
-, author =	"J. Matou{\v s}ek"
-, title =	"Efficient partition trees"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"1--9"
-, keywords =	"range search, simplex, partition trees"
-, cites =	"a-pal2a-90, ahl-sqrpc-90, b-dsp-79, c-lbcpr-89, cgl-pgd-85, csw-qoubs-90, cf-dvrsi-90, cp-hrsaa-86, cw-qorss-89, ew-hrsls-86, hw-ensrq-87, m-aogdc-91, m-cha-90i, m-mcast-90, o-ddds-83, so-dpt-90, vc-ucrfe-71, w-pttco-88, w-pr-82, yy-gaddg-85, ZZZ"
-, update =	"97.11 bibrelex, 96.09 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Efficient partition trees"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "1--9"
+, keywords =    "range search, simplex, partition trees"
+, cites =       "a-pal2a-90, ahl-sqrpc-90, b-dsp-79, c-lbcpr-89, cgl-pgd-85, csw-qoubs-90, cf-dvrsi-90, cp-hrsaa-86, cw-qorss-89, ew-hrsls-86, hw-ensrq-87, m-aogdc-91, m-cha-90i, m-mcast-90, o-ddds-83, so-dpt-90, vc-ucrfe-71, w-pttco-88, w-pr-82, yy-gaddg-85, ZZZ"
+, update =      "97.11 bibrelex, 96.09 agarwal"
 }
 
 @article{m-ept-92
-, author =	"J. Matou{\v s}ek"
-, title =	"Efficient partition trees"
-, journal =	"Discrete Comput. Geom."
-, volume =	8
-, year =	1992
-, pages =	"315--334"
-, keywords =	"simplex range searching, crossing number, multilevel data structure, approximations"
-, succeeds =	"m-ept-91"
-, update =	"93.09 matousek"
+, author =      "J. Matou{\v s}ek"
+, title =       "Efficient partition trees"
+, journal =     "Discrete Comput. Geom."
+, volume =      8
+, year =        1992
+, pages =       "315--334"
+, keywords =    "simplex range searching, crossing number, multilevel data structure, approximations"
+, succeeds =    "m-ept-91"
+, update =      "93.09 matousek"
 }
 
 @incollection{m-encg-93
-, author =	"J. Matou{\v s}ek"
-, title =	"Epsilon-Nets and Computational Geometry"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg"
-, year =	1993
-, pages =	"69--89"
-, keywords =	"survey paper, epsilon-nets, range spaces, VC-dimension, cuttings, derandomization"
-, update =	"98.07 agarwal, 96.09 agarwal, 93.09 erickson"
+, author =      "J. Matou{\v s}ek"
+, title =       "Epsilon-Nets and Computational Geometry"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg"
+, year =        1993
+, pages =       "69--89"
+, keywords =    "survey paper, epsilon-nets, range spaces, VC-dimension, cuttings, derandomization"
+, update =      "98.07 agarwal, 96.09 agarwal, 93.09 erickson"
 }
 
 @techreport{m-grs-93
-, author =	"J. Matou{\v s}ek"
-, title =	"Geometric range searching"
-, type =	"Tech. Report"
-, number =	"B-93-09"
-, institution =	"Fachbereich Mathematik und Informatik, Free Univ. Berlin"
-, year =	1993
-, comments =	"A survey paper"
-, update =	"96.09 agarwal, 94.01 matousek"
+, author =      "J. Matou{\v s}ek"
+, title =       "Geometric range searching"
+, type =        "Tech. Report"
+, number =      "B-93-09"
+, institution = "Fachbereich Mathematik und Informatik, Free Univ. Berlin"
+, year =        1993
+, comments =    "A survey paper"
+, update =      "96.09 agarwal, 94.01 matousek"
 }
 
 @article{m-grs-94
-, author =	"J. Matou{\v s}ek"
-, title =	"Geometric range searching"
-, journal =	"ACM Comput. Surv."
-, volume =	26
-, year =	1994
-, pages =	"421--461"
-, keywords =	"survey paper"
-, update =	"97.03 pocchiola, 95.05 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Geometric range searching"
+, journal =     "ACM Comput. Surv."
+, volume =      26
+, year =        1994
+, pages =       "421--461"
+, keywords =    "survey paper"
+, update =      "97.03 pocchiola, 95.05 agarwal"
 }
 
 @techreport{m-hsrr-90
-, author =	"J. Matou{\v s}ek"
-, title =	"Half-space range reporting"
-, series =	"KAM Series"
-, type =	"Report"
-, number =	"90-188"
-, institution =	"Charles Univ."
-, address =	"Prague, Czechoslovakia"
-, year =	1990
-, keywords =	"range search, half spaces, polyhedra"
-, update =	"96.09 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Half-space range reporting"
+, series =      "KAM Series"
+, type =        "Report"
+, number =      "90-188"
+, institution = "Charles Univ."
+, address =     "Prague, Czechoslovakia"
+, year =        1990
+, keywords =    "range search, half spaces, polyhedra"
+, update =      "96.09 agarwal"
 }
 
 @article{m-lars-88
-, author =	"J. Matou{\v s}ek"
-, title =	"Line arrangements and range search"
-, journal =	"Inform. Process. Lett."
-, volume =	27
-, year =	1988
-, pages =	"275--280"
-, update =	"98.03 bibrelex"
+, author =      "J. Matou{\v s}ek"
+, title =       "Line arrangements and range search"
+, journal =     "Inform. Process. Lett."
+, volume =      27
+, year =        1988
+, pages =       "275--280"
+, update =      "98.03 bibrelex"
 }
 
 @article{m-loq-93
-, author =	"J. Matou{\v s}ek"
-, title =	"Linear optimization queries"
-, journal =	"J. Algorithms"
-, volume =	14
-, year =	1993
-, pages =	"432--448"
-, keywords =	"multidimensional parametric search, linear programming, separation, range search"
-, update =	"97.11 bibrelex, 96.09 agarwal, 96.05 agarwal, 93.09 matousek"
-, annote =	"See also J. Matou{\v s}ek and O. Schwarzkopf
-		 {\em Proc. 8th ACM Sympos. Comput. Geom.},
-		 1992, pp.\ 16--25"
+, author =      "J. Matou{\v s}ek"
+, title =       "Linear optimization queries"
+, journal =     "J. Algorithms"
+, volume =      14
+, year =        1993
+, pages =       "432--448"
+, keywords =    "multidimensional parametric search, linear programming, separation, range search"
+, update =      "97.11 bibrelex, 96.09 agarwal, 96.05 agarwal, 93.09 matousek"
+, annote =      "See also J. Matou{\v s}ek and O. Schwarzkopf
+                 {\em Proc. 8th ACM Sympos. Comput. Geom.},
+                 1992, pp.\ 16--25"
 }
 
 @article{m-lbsoa-94
-, author =	"J. Matou{\v s}ek"
-, title =	"Lower bound for a subexponential optimization algorithm"
-, journal =	"Random Structures \& Algorithms"
-, volume =	5
-, number =	4
-, year =	1994
-, pages =	"591--607"
-, update =	"95.01 matousek"
+, author =      "J. Matou{\v s}ek"
+, title =       "Lower bound for a subexponential optimization algorithm"
+, journal =     "Random Structures \& Algorithms"
+, volume =      5
+, number =      4
+, year =        1994
+, pages =       "591--607"
+, update =      "95.01 matousek"
 }
 
 @article{m-lblmp-91
-, author =	"J. Matou{\v s}ek"
-, title =	"Lower bounds on the length of monotone paths in arrangements"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"129--134"
-, update =	"96.09 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Lower bounds on the length of monotone paths in arrangements"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "129--134"
+, update =      "96.09 agarwal"
 }
 
 @techreport{m-mcast-90
-, author =	"J. Matou{\v s}ek"
-, title =	"More on cutting arrangements and spanning trees with low crossing number"
-, number =	"B-90-2"
-, institution =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
-, address =	"Berlin"
-, year =	1990
-, update =	"96.09 agarwal, 93.09 milone+mitchell"
+, author =      "J. Matou{\v s}ek"
+, title =       "More on cutting arrangements and spanning trees with low crossing number"
+, number =      "B-90-2"
+, institution = "Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
+, address =     "Berlin"
+, year =        1990
+, update =      "96.09 agarwal, 93.09 milone+mitchell"
 }
 
 @unpublished{m-agkc-00
-, author =	"J. Matou{\v s}ek"
-, title =	"On approximate geometric k-clustering"
-, year =	2000
-, note =	"to appear in {\em Discrete Comput. Geom.}"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "On approximate geometric k-clustering"
+, year =        2000
+, note =        "to appear in {\em Discrete Comput. Geom.}"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @techreport{m-ekpc-93
-, author =	"J. Matou{\v s}ek"
-, title =	"On enclosing $k$ points by a circle"
-, type =	"KAM Series"
-, number =	"93-245"
-, institution =	"Charles University"
-, year =	1993
-, update =	"96.05 smid, 94.01 matousek"
+, author =      "J. Matou{\v s}ek"
+, title =       "On enclosing $k$ points by a circle"
+, type =        "KAM Series"
+, number =      "93-245"
+, institution = "Charles University"
+, year =        1993
+, update =      "96.05 smid, 94.01 matousek"
 }
 
 @article{m-ekpc-95
-, author =	"J. Matou{\v s}ek"
-, title =	"On enclosing $k$ points by a circle"
-, journal =	"Inform. Process. Lett."
-, volume =	53
-, year =	1995
-, pages =	"217--221"
-, update =	"96.09 agarwal, 96.05 smid"
+, author =      "J. Matou{\v s}ek"
+, title =       "On enclosing $k$ points by a circle"
+, journal =     "Inform. Process. Lett."
+, volume =      53
+, year =        1995
+, pages =       "217--221"
+, update =      "96.09 agarwal, 96.05 smid"
 }
 
 @inproceedings{m-gofvc-94
-, author =	"J. Matou{\v s}ek"
-, title =	"On Geometric Optimization with Few Violated Constraints"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"312--321"
-, cites =	"acegsw-ptphp-91, abms-claho-94, aiks-fkpmd-91, am-dhsrr-91, a-htglp-93, c-narsc-87, c-lvalp-88, c-blmat-92, cm-ltdao-93, cs-arscg-89, csy-khrp-87, de-ctchp-93, dlss-sdakp-93i, ec-eargd-92, ee-innfm-93, els-fmcsh-93, em-sstcd-90, erk-oalla-93, es-blbda-93, esz-cskec-93i, g-saaop-92, go-nhpcg-93, k-srsa-92, m-loq-93, m-ekpc-93, m-we1cp-83, msw-sblp-92, m-lavd-91, m-gdsrs-91, ol-mcp-81, s-nmpgc-94, sw-cblpr-92, w-sedbe-91a, y-gctsp-90, ZZZ"
-, update =	"98.03 bibrelex, 96.09 agarwal, 94.09 jones, 94.01 jones"
+, author =      "J. Matou{\v s}ek"
+, title =       "On Geometric Optimization with Few Violated Constraints"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "312--321"
+, cites =       "acegsw-ptphp-91, abms-claho-94, aiks-fkpmd-91, am-dhsrr-91, a-htglp-93, c-narsc-87, c-lvalp-88, c-blmat-92, cm-ltdao-93, cs-arscg-89, csy-khrp-87, de-ctchp-93, dlss-sdakp-93i, ec-eargd-92, ee-innfm-93, els-fmcsh-93, em-sstcd-90, erk-oalla-93, es-blbda-93, esz-cskec-93i, g-saaop-92, go-nhpcg-93, k-srsa-92, m-loq-93, m-ekpc-93, m-we1cp-83, msw-sblp-92, m-lavd-91, m-gdsrs-91, ol-mcp-81, s-nmpgc-94, sw-cblpr-92, w-sedbe-91a, y-gctsp-90, ZZZ"
+, update =      "98.03 bibrelex, 96.09 agarwal, 94.09 jones, 94.01 jones"
 }
 
 @article{m-gofvc-95
-, author =	"J. Matou{\v s}ek"
-, title =	"On Geometric Optimization with Few Violated Constraints"
-, journal =	"Discrete Comput. Geom."
-, volume =	14
-, year =	1995
-, pages =	"365--384"
-, update =	"96.09 agarwal, 96.05 agarwal+smid"
+, author =      "J. Matou{\v s}ek"
+, title =       "On Geometric Optimization with Few Violated Constraints"
+, journal =     "Discrete Comput. Geom."
+, volume =      14
+, year =        1995
+, pages =       "365--384"
+, update =      "96.09 agarwal, 96.05 agarwal+smid"
 }
 
 @article{m-vrsa-93
-, author =	"J. Matou{\v s}ek"
-, title =	"On Vertical Ray Shooting in Arrangements"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	5
-, month =	mar
-, year =	1993
-, pages =	"279--285"
-, keywords =	"ray shooting, zone theorem, cutting, hyperplane arrangement"
-, update =	"93.09 held+matousek+milone+mitchell"
+, author =      "J. Matou{\v s}ek"
+, title =       "On Vertical Ray Shooting in Arrangements"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      5
+, month =       mar
+, year =        1993
+, pages =       "279--285"
+, keywords =    "ray shooting, zone theorem, cutting, hyperplane arrangement"
+, update =      "93.09 held+matousek+milone+mitchell"
 }
 
 @article{m-roass-91
-, author =	"J. Matou{\v s}ek"
-, title =	"Randomized optimal algorithm for slope selection"
-, journal =	"Inform. Process. Lett."
-, volume =	39
-, year =	1991
-, pages =	"183--187"
-, update =	"96.09 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Randomized optimal algorithm for slope selection"
+, journal =     "Inform. Process. Lett."
+, volume =      39
+, year =        1991
+, pages =       "183--187"
+, update =      "96.09 agarwal"
 }
 
 @techreport{m-rsehc-91
-, author =	"J. Matous{\v e}k"
-, title =	"Range searching with efficient hierarchical cuttings"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "J. Matous{\v e}k"
+, title =       "Range searching with efficient hierarchical cuttings"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{m-rsehc-92
-, author =	"J. Matou{\v s}ek"
-, title =	"Range searching with efficient hierarchical cuttings"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"276--285"
-, cites =	"a-pal1e-90, as-anps-91, cf-dvrsi-90, c-lbcpr-89, c-chdc-91, csw-qoubs-90, cw-qorss-89, de-ssio-87, e-acg-87, eghsssw-irals-89, m-aogdc-91, m-cha-91, m-ept-91, m-splcn-91, oss-slspt-90, ps-cgi-85, ZZZ"
-, update =	"97.11 bibrelex, 96.09 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Range searching with efficient hierarchical cuttings"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "276--285"
+, cites =       "a-pal1e-90, as-anps-91, cf-dvrsi-90, c-lbcpr-89, c-chdc-91, csw-qoubs-90, cw-qorss-89, de-ssio-87, e-acg-87, eghsssw-irals-89, m-aogdc-91, m-cha-91, m-ept-91, m-splcn-91, oss-slspt-90, ps-cgi-85, ZZZ"
+, update =      "97.11 bibrelex, 96.09 agarwal"
 }
 
 @article{m-rsehc-93
-, author =	"J. Matou{\v s}ek"
-, title =	"Range searching with efficient hierarchical cuttings"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, number =	2
-, year =	1993
-, pages =	"157--182"
-, succeeds =	"m-rsehc-92"
-, update =	"97.11 bibrelex, 94.01 matousek"
+, author =      "J. Matou{\v s}ek"
+, title =       "Range searching with efficient hierarchical cuttings"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, number =      2
+, year =        1993
+, pages =       "157--182"
+, succeeds =    "m-rsehc-92"
+, update =      "97.11 bibrelex, 94.01 matousek"
 }
 
 @inproceedings{m-rph-91
-, author =	"J. Matou{\v s}ek"
-, title =	"Reporting points in halfspaces"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"207--215"
-, precedes =	"m-rph-92"
-, update =	"96.09 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Reporting points in halfspaces"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "207--215"
+, precedes =    "m-rph-92"
+, update =      "96.09 agarwal"
 }
 
 @article{m-rph-92
-, author =	"J. Matou{\v s}ek"
-, title =	"Reporting points in halfspaces"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"169--186"
-, succeeds =	"m-rph-91"
-, update =	"96.09 agarwal"
+, author =      "J. Matou{\v s}ek"
+, title =       "Reporting points in halfspaces"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "169--186"
+, succeeds =    "m-rph-91"
+, update =      "96.09 agarwal"
 }
 
 @article{m-splcn-91
-, author =	"J. Matou{\v s}ek"
-, title =	"Spanning trees with low crossing numbers"
-, journal =	"Informatique Th\'eorique et Applications"
-, volume =	6
-, number =	25
-, year =	1991
-, pages =	"103--123"
-, keywords =	"spanning trees"
-, update =	"96.05 pocchiola"
+, author =      "J. Matou{\v s}ek"
+, title =       "Spanning trees with low crossing numbers"
+, journal =     "Informatique Th\'eorique et Applications"
+, volume =      6
+, number =      25
+, year =        1991
+, pages =       "103--123"
+, keywords =    "spanning trees"
+, update =      "96.05 pocchiola"
 }
 
 @techreport{m-tubdh-94
-, author =	"J. Matou{\v s}ek"
-, title =	"Tight upper bounds for the discrepancy of halfspaces"
-, type =	"KAM Series"
-, number =	""
-, institution =	"Charles University"
-, year =	1994
-, note =	"Also submitted to {\em Discr. Comput. Geom.}"
-, update =	"96.09 agarwal, 94.05 matousek"
+, author =      "J. Matou{\v s}ek"
+, title =       "Tight upper bounds for the discrepancy of halfspaces"
+, type =        "KAM Series"
+, number =      ""
+, institution = "Charles University"
+, year =        1994
+, note =        "Also submitted to {\em Discr. Comput. Geom.}"
+, update =      "96.09 agarwal, 94.05 matousek"
 }
 
 @inproceedings{mmpssw-ftdlm-91
-, author =	"J. Matou{\v s}ek and N. Miller and J. Pach and Micha Sharir and S. Sifrony and Emo Welzl"
-, title =	"Fat triangles determine linearly many holes"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"49--58"
-, update =	"98.03 mitchell, 96.09 agarwal"
+, author =      "J. Matou{\v s}ek and N. Miller and J. Pach and Micha Sharir and S. Sifrony and Emo Welzl"
+, title =       "Fat triangles determine linearly many holes"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "49--58"
+, update =      "98.03 mitchell, 96.09 agarwal"
 }
 
 @unpublished{mmn-erarm-92
-, author =	"J. Matou{\v s}ek and D. M. Mount and N. S. Netanyahu"
-, title =	"Efficient Randomized Algorithms for the Repeated Median Line Estimator"
-, year =	1992
-, note =	"in preparation"
-, precedes =	"mmn-erarm-93"
-, update =	"98.07 bibrelex"
+, author =      "J. Matou{\v s}ek and D. M. Mount and N. S. Netanyahu"
+, title =       "Efficient Randomized Algorithms for the Repeated Median Line Estimator"
+, year =        1992
+, note =        "in preparation"
+, precedes =    "mmn-erarm-93"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{mmn-erarm-93
-, author =	"J. Matou{\v s}ek and D. M. Mount and N. S. Netanyahu"
-, title =	"Efficient Randomized Algorithms for the Repeated Median Line Estimator"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, month =	jan
-, year =	1993
-, pages =	"74--82"
-, succeeds =	"mmn-erarm-92"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 96.09 agarwal, 93.05 smid"
+, author =      "J. Matou{\v s}ek and D. M. Mount and N. S. Netanyahu"
+, title =       "Efficient Randomized Algorithms for the Repeated Median Line Estimator"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, month =       jan
+, year =        1993
+, pages =       "74--82"
+, succeeds =    "mmn-erarm-92"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 96.09 agarwal, 93.05 smid"
 }
 
 @techreport{mpssw-ftdlm-90
-, author =	"J. Matou{\v s}ek and J. Pach and Micha Sharir and S. Sifrony and Emo Welzl"
-, title =	"Fat triangles determine linearly many holes"
-, type =	"Technical {Report}"
-, number =	"174/90"
-, institution =	"Eskenasy Inst. Comput. Sci., Tel Aviv Univ."
-, address =	"Tel Aviv, Israel"
-, month =	may
-, year =	1990
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "J. Matou{\v s}ek and J. Pach and Micha Sharir and S. Sifrony and Emo Welzl"
+, title =       "Fat triangles determine linearly many holes"
+, type =        "Technical {Report}"
+, number =      "174/90"
+, institution = "Eskenasy Inst. Comput. Sci., Tel Aviv Univ."
+, address =     "Tel Aviv, Israel"
+, month =       may
+, year =        1990
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{mpssw-ftdlm-94
-, author =	"J. Matou{\v s}ek and J. Pach and Micha Sharir and S. Sifrony and Emo Welzl"
-, title =	"Fat triangles determine linearly many holes"
-, journal =	"SIAM J. Comput."
-, volume =	23
-, year =	1994
-, pages =	"154--169"
-, update =	"98.03 mitchell, 96.09 agarwal, 95.09 agarwal, 94.05 sharir"
+, author =      "J. Matou{\v s}ek and J. Pach and Micha Sharir and S. Sifrony and Emo Welzl"
+, title =       "Fat triangles determine linearly many holes"
+, journal =     "SIAM J. Comput."
+, volume =      23
+, year =        1994
+, pages =       "154--169"
+, update =      "98.03 mitchell, 96.09 agarwal, 95.09 agarwal, 94.05 sharir"
 }
 
 @inproceedings{ms-datdd-93
-, author =	"J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"A Deterministic Algorithm for the Three-Dimensional Diameter Problem"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1993
-, pages =	"478--484"
-, keywords =	"diameter, three-dimensional, parametric search"
-, precedes =	"ms-datdd-96"
-, cites =	"cegs-dwclp-92"
-, update =	"96.09 agarwal+devillers, 93.09 milone+mitchell, 93.05 schwarzkopf"
-, abstract =	"A deterministic algorithm for computing the diameter
-		of an $n$ point set in three dimensions with
-		$O(n\log^c n)$ running time is given, $c$ a
-		constant."
+, author =      "J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "A Deterministic Algorithm for the Three-Dimensional Diameter Problem"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1993
+, pages =       "478--484"
+, keywords =    "diameter, three-dimensional, parametric search"
+, precedes =    "ms-datdd-96"
+, cites =       "cegs-dwclp-92"
+, update =      "96.09 agarwal+devillers, 93.09 milone+mitchell, 93.05 schwarzkopf"
+, abstract =    "A deterministic algorithm for computing the diameter
+                of an $n$ point set in three dimensions with
+                $O(n\log^c n)$ running time is given, $c$ a
+                constant."
 }
 
 @article{ms-datdd-96
-, author =	"J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"A Deterministic Algorithm for the Three-Dimensional Diameter Problem"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"253--262"
-, succeeds =	"ms-datdd-93"
-, update =	"96.09 devillers"
+, author =      "J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "A Deterministic Algorithm for the Three-Dimensional Diameter Problem"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "253--262"
+, succeeds =    "ms-datdd-93"
+, update =      "96.09 devillers"
 }
 
 @techreport{ms-loq-91
-, author =	"J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"Linear optimization queries"
-, type =	"Technical {Report}"
-, number =	"B 91-19"
-, institution =	"Freie Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "Linear optimization queries"
+, type =        "Technical {Report}"
+, number =      "B 91-19"
+, institution = "Freie Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ms-loq-92
-, author =	"J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"Linear optimization queries"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"16--25"
-, keywords =	"separation, linear programming, prune-and-search"
-, cites =	"am-dhsrr-91, am-rsps-92, cf-dvrsi-90, c-lpot-86, c-lvalp-88, c-arscg-88, cm-sptna-89, c-sdsno-87, csw-qoubs-90, csy-khrp-87, d-mstia-86, e-acg-87, e-dtdlp-91, gsc-srttd-87, hw-ensrq-87, m-aogdc-91, m-ept-91, m-rph-91, m-loq-93, ms-loq-91, m-apcad-83, m-lpltw-84, m-mdscg-84, m-rmstl-91, npt-usafd-90, ph-chfsp-77, s-pop-91, s-rscp-92, s-chdch-86, s-sdlpc-91, ZZZ"
-, update =	"97.11 bibrelex, 96.09 agarwal"
+, author =      "J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "Linear optimization queries"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "16--25"
+, keywords =    "separation, linear programming, prune-and-search"
+, cites =       "am-dhsrr-91, am-rsps-92, cf-dvrsi-90, c-lpot-86, c-lvalp-88, c-arscg-88, cm-sptna-89, c-sdsno-87, csw-qoubs-90, csy-khrp-87, d-mstia-86, e-acg-87, e-dtdlp-91, gsc-srttd-87, hw-ensrq-87, m-aogdc-91, m-ept-91, m-rph-91, m-loq-93, ms-loq-91, m-apcad-83, m-lpltw-84, m-mdscg-84, m-rmstl-91, npt-usafd-90, ph-chfsp-77, s-pop-91, s-rscp-92, s-chdch-86, s-sdlpc-91, ZZZ"
+, update =      "97.11 bibrelex, 96.09 agarwal"
 }
 
 @article{ms-rscp-93
-, author =	"J. Matou{\v s}ek and O. Schwarzkopf"
-, title =	"On ray shooting in convex polytopes"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, number =	2
-, year =	1993
-, pages =	"215--232"
-, keywords =	"ray shooting, convex polytope, range searching"
-, comments =	"another part of the results of the conference version is in m-loq-93"
-, succeeds =	"ms-loq-92"
-, update =	"96.09 agarwal, 94.05 schwarzkopf, 94.01 matousek"
+, author =      "J. Matou{\v s}ek and O. Schwarzkopf"
+, title =       "On ray shooting in convex polytopes"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, number =      2
+, year =        1993
+, pages =       "215--232"
+, keywords =    "ray shooting, convex polytope, range searching"
+, comments =    "another part of the results of the conference version is in m-loq-93"
+, succeeds =    "ms-loq-92"
+, update =      "96.09 agarwal, 94.05 schwarzkopf, 94.01 matousek"
 }
 
 @unpublished{mss-ncric-96
-, author =	"Ji{{\v r}}{\'{\i}} Matou{{\v s}}ek and Otfried Schwarzkopf and Jack Snoeyink"
-, title =	"Non-Canonical Randomized Incremental Construction"
-, year =	1997
-, note =	"Manuscript"
-, update =	"97.03 schwarzkopf"
+, author =      "Ji{{\v r}}{\'{\i}} Matou{{\v s}}ek and Otfried Schwarzkopf and Jack Snoeyink"
+, title =       "Non-Canonical Randomized Incremental Construction"
+, year =        1997
+, note =        "Manuscript"
+, update =      "97.03 schwarzkopf"
 }
 
 @incollection{ms-temsi-92
-, author =	"J. Matou{\v s}ek and R. Seidel"
-, title =	"A Tail Estimate for {Mulmuley}'s Segment Intersection Algorithm"
-, booktitle =	"Proc. 19th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	623
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"427--438"
-, update =	"96.09 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "J. Matou{\v s}ek and R. Seidel"
+, title =       "A Tail Estimate for {Mulmuley}'s Segment Intersection Algorithm"
+, booktitle =   "Proc. 19th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      623
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "427--438"
+, update =      "96.09 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{msw-hnlls-90
-, author =	"J. Matou{\v s}ek and R. Seidel and Emo Welzl"
-, title =	"How to net a lot with little: small $\epsilon$-nets for disks and halfspaces"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"16--22"
-, cites =	"a-dapal-89, behw-clgcv-89, cf-dvrsi-88, cw-qorss-89, c-narsc-87, es-vda-86, ew-nlsfs-85, hw-ensrq-87, m-cen-89, pw-snben-90, w-uekgf-65, yy-gaddg-85, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 96.09 agarwal"
+, author =      "J. Matou{\v s}ek and R. Seidel and Emo Welzl"
+, title =       "How to net a lot with little: small $\epsilon$-nets for disks and halfspaces"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "16--22"
+, cites =       "a-dapal-89, behw-clgcv-89, cf-dvrsi-88, cw-qorss-89, c-narsc-87, es-vda-86, ew-nlsfs-85, hw-ensrq-87, m-cen-89, pw-snben-90, w-uekgf-65, yy-gaddg-85, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 96.09 agarwal"
 }
 
 @inproceedings{msw-sblp-92
-, author =	"J. Matou{\v s}ek and Micha Sharir and Emo Welzl"
-, title =	"A subexponential bound for linear programming"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"1--8"
-, cites =	"b-udkuu-38, c-ochan-91, c-lpot-86, c-lvali-89, dll-udleu-57, d-lpe-63, d-mstia-86, d-ccpac-92, df-rafdl-87, j-levso-90, j-udkkd-01, k-srsa-92, k-nptal-84a, k-palp-80, km-hgisa-72, m-lpltw-84, p-mse-84, s-sdlpc-91, s-barga-91, sw-cblpr-92, w-sedbe-91a, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 97.03 smid, 96.09 agarwal"
+, author =      "J. Matou{\v s}ek and Micha Sharir and Emo Welzl"
+, title =       "A subexponential bound for linear programming"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "1--8"
+, cites =       "b-udkuu-38, c-ochan-91, c-lpot-86, c-lvali-89, dll-udleu-57, d-lpe-63, d-mstia-86, d-ccpac-92, df-rafdl-87, j-levso-90, j-udkkd-01, k-srsa-92, k-nptal-84a, k-palp-80, km-hgisa-72, m-lpltw-84, p-mse-84, s-sdlpc-91, s-barga-91, sw-cblpr-92, w-sedbe-91a, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 97.03 smid, 96.09 agarwal"
 }
 
 @article{msw-sblp-96
-, author =	"J. Matou{\v s}ek and Micha Sharir and Emo Welzl"
-, title =	"A subexponential bound for linear programming"
-, journal =	"Algorithmica"
-, volume =	16
-, year =	1996
-, pages =	"498--516"
-, update =	"98.03 mitchell, 97.03 agarwal+smid"
+, author =      "J. Matou{\v s}ek and Micha Sharir and Emo Welzl"
+, title =       "A subexponential bound for linear programming"
+, journal =     "Algorithmica"
+, volume =      16
+, year =        1996
+, pages =       "498--516"
+, update =      "98.03 mitchell, 97.03 agarwal+smid"
 }
 
 @incollection{mv-clesh-97
-, author =	"J. Matou{\v s}ek and P. Valtr"
-, title =	"The complexity of the lower envelope of segments with $h$ endpo ints"
-, editor =	"I. Bar{' a}ny"
-, booktitle =	"Intuitive Geometry, Colloq. Math. Society J{\'a}nos Bolyai"
-, publisher =	"North-Holland"
-, address =	"Amsterdam"
-, year =	1997
-, pages =	"407--411"
-, update =	"98.03 agarwal"
+, author =      "J. Matou{\v s}ek and P. Valtr"
+, title =       "The complexity of the lower envelope of segments with $h$ endpo ints"
+, editor =      "I. Bar{' a}ny"
+, booktitle =   "Intuitive Geometry, Colloq. Math. Society J{\'a}nos Bolyai"
+, publisher =   "North-Holland"
+, address =     "Amsterdam"
+, year =        1997
+, pages =       "407--411"
+, update =      "98.03 agarwal"
 }
 
 @techreport{mv-clesh-95
-, author =	"J. Matou{\v s}ek and P. Valtr"
-, title =	"The complexity of the lower envelope of segments with $h$ endpoints"
-, institution =	"??"
-, address =	"Prague"
-, year =	1995
-, update =	"97.03 agarwal"
+, author =      "J. Matou{\v s}ek and P. Valtr"
+, title =       "The complexity of the lower envelope of segments with $h$ endpoints"
+, institution = "??"
+, address =     "Prague"
+, year =        1995
+, update =      "97.03 agarwal"
 }
 
 @inproceedings{mw-gscpt-89
-, author =	"J. Matou{\v s}ek and Emo Welzl"
-, title =	"Good splitters for counting points in triangles"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"124--130"
-, cites =	"b-gtfga-80, cgl-pgd-83, cw-rsvdc-88, csss-otass-89, e-acg-87, eghsssw-irals-88, ew-hrsls-86, ekm-pis-82, es-cpg-35, hw-ensrq-87, m-splcn-91, m-lars-88, w-pr-82, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 96.09 agarwal"
+, author =      "J. Matou{\v s}ek and Emo Welzl"
+, title =       "Good splitters for counting points in triangles"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "124--130"
+, cites =       "b-gtfga-80, cgl-pgd-83, cw-rsvdc-88, csss-otass-89, e-acg-87, eghsssw-irals-88, ew-hrsls-86, ekm-pis-82, es-cpg-35, hw-ensrq-87, m-splcn-91, m-lars-88, w-pr-82, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 96.09 agarwal"
 }
 
 @article{mw-gscpt-92
-, author =	"J. Matou{\v s}ek and Emo Welzl"
-, title =	"Good splitters for counting points in triangles"
-, journal =	"J. Algorithms"
-, volume =	13
-, year =	1992
-, pages =	"307--319"
-, succeeds =	"mw-gscpt-89"
-, update =	"98.03 mitchell, 96.09 agarwal, 93.09 matousek"
+, author =      "J. Matou{\v s}ek and Emo Welzl"
+, title =       "Good splitters for counting points in triangles"
+, journal =     "J. Algorithms"
+, volume =      13
+, year =        1992
+, pages =       "307--319"
+, succeeds =    "mw-gscpt-89"
+, update =      "98.03 mitchell, 96.09 agarwal, 93.09 matousek"
 }
 
 @inproceedings{mww-deabv-91
-, author =	"J. Matou{\v s}ek and Emo Welzl and L. Wernisch"
-, title =	"Discrepancy and $\varepsilon$-approximations for bounded {VC}-dimension"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"424--430"
-, update =	"98.03 mitchell, 96.09 agarwal"
+, author =      "J. Matou{\v s}ek and Emo Welzl and L. Wernisch"
+, title =       "Discrepancy and $\varepsilon$-approximations for bounded {VC}-dimension"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "424--430"
+, update =      "98.03 mitchell, 96.09 agarwal"
 }
 
 @article{mww-deabv-93
-, author =	"J. Matou{\v s}ek and Emo Welzl and L. Wernisch"
-, title =	"Discrepancy and $\varepsilon$-approximations for bounded {VC}-dimension"
-, journal =	"Combinatorica"
-, volume =	13
-, year =	1993
-, pages =	"455--466"
-, succeeds =	"mww-deabv-91"
-, update =	"98.03 mitchell, 96.09 agarwal, 94.05 matousek"
+, author =      "J. Matou{\v s}ek and Emo Welzl and L. Wernisch"
+, title =       "Discrepancy and $\varepsilon$-approximations for bounded {VC}-dimension"
+, journal =     "Combinatorica"
+, volume =      13
+, year =        1993
+, pages =       "455--466"
+, succeeds =    "mww-deabv-91"
+, update =      "98.03 mitchell, 96.09 agarwal, 94.05 matousek"
 }
 
 @inproceedings{mhn-fogis-82
-, author =	"T. Matsuyama and L. V. Hao and M. Nagao"
-, title =	"A file organization for geographic information systems based on the spatial proximity"
-, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
-, year =	1982
-, pages =	"83--88"
+, author =      "T. Matsuyama and L. V. Hao and M. Nagao"
+, title =       "A file organization for geographic information systems based on the spatial proximity"
+, booktitle =   "Proc. 6th IEEE Internat. Conf. Pattern Recogn."
+, year =        1982
+, pages =       "83--88"
 }
 
 @inproceedings{mp-drlvd-84
-, author =	"T. Matsuyama and T. Phillips"
-, title =	"Digital Realization of the Labelled {Voronoi} Diagram and its Application to Closed Boundary Detection"
-, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn."
-, year =	1984
-, pages =	"478--480"
-, annote =	"Discrete VD of set of segments. Medial axis is used to
-		 reconstruct a closed boundary."
+, author =      "T. Matsuyama and T. Phillips"
+, title =       "Digital Realization of the Labelled {Voronoi} Diagram and its Application to Closed Boundary Detection"
+, booktitle =   "Proc. IEEE Internat. Conf. Pattern Recogn."
+, year =        1984
+, pages =       "478--480"
+, annote =      "Discrete VD of set of segments. Medial axis is used to
+                 reconstruct a closed boundary."
 }
 
 @article{m-adica-73
-, author =	"T. H. Mattheiss"
-, title =	"An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities"
-, journal =	"Oper. Res."
-, volume =	21
-, year =	1973
-, pages =	"247--260"
+, author =      "T. H. Mattheiss"
+, title =       "An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities"
+, journal =     "Oper. Res."
+, volume =      21
+, year =        1973
+, pages =       "247--260"
 }
 
 @article{mr-scmfa-80
-, author =	"T. H. Mattheiss and D. Rubin"
-, title =	"A survey and comparison of methods for finding all vertices of convex polyhedral sets"
-, journal =	"Math. Oper. Res."
-, volume =	5
-, year =	1980
-, pages =	"167--185"
+, author =      "T. H. Mattheiss and D. Rubin"
+, title =       "A survey and comparison of methods for finding all vertices of convex polyhedral sets"
+, journal =     "Math. Oper. Res."
+, volume =      5
+, year =        1980
+, pages =       "167--185"
 }
 
 @article{ms-crafa-80
-, author =	"T. H. Mattheiss and B. K. Schmidt"
-, title =	"Computational results on an algorithm for finding all vertices of a polytope"
-, journal =	"Math. Program."
-, volume =	18
-, year =	1980
-, pages =	"308--329"
+, author =      "T. H. Mattheiss and B. K. Schmidt"
+, title =       "Computational results on an algorithm for finding all vertices of a polytope"
+, journal =     "Math. Program."
+, volume =      18
+, year =        1980
+, pages =       "308--329"
 }
 
 @article{ms-pggrg-80
-, author =	"D. W. Matula and R. R. Sokal"
-, title =	"Properties of {Gabriel} graphs relevant to geographic variation research and clustering of points in the plane"
-, journal =	"Geogr. Anal."
-, volume =	12
-, number =	3
-, year =	1980
-, pages =	"205--222"
-, update =	"98.11 bibrelex"
+, author =      "D. W. Matula and R. R. Sokal"
+, title =       "Properties of {Gabriel} graphs relevant to geographic variation research and clustering of points in the plane"
+, journal =     "Geogr. Anal."
+, volume =      12
+, number =      3
+, year =        1980
+, pages =       "205--222"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{m-elnlr-96
-, author =	"Joseph M. Maubach"
-, title =	"The efficient location of neighbors for locally refined n-simplicial grids"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"137--153"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Joseph M. Maubach"
+, title =       "The efficient location of neighbors for locally refined n-simplicial grids"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "137--153"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @inproceedings{m-poprq-80
-, author =	"H. A. Maurer"
-, title =	"The post-office problem and related questions"
-, booktitle =	"Proc. 6th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '80"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	100
-, publisher =	"Springer-Verlag"
-, year =	1980
-, pages =	"1--19"
-, update =	"98.07 bibrelex"
+, author =      "H. A. Maurer"
+, title =       "The post-office problem and related questions"
+, booktitle =   "Proc. 6th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '80"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      100
+, publisher =   "Springer-Verlag"
+, year =        1980
+, pages =       "1--19"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{mo-dsdsp-79
-, author =	"H. A. Maurer and T. A. Ottmann"
-, title =	"Dynamic solutions of decomposable searching problems"
-, editor =	"U. Pape"
-, booktitle =	"Discrete Structures and Algorithms"
-, publisher =	"Carl Hanser Verlag"
-, address =	"M{\"u}nchen, Germany"
-, year =	1979
-, pages =	"17--24"
-, update =	"97.03 schwarzkopf"
+, author =      "H. A. Maurer and T. A. Ottmann"
+, title =       "Dynamic solutions of decomposable searching problems"
+, editor =      "U. Pape"
+, booktitle =   "Discrete Structures and Algorithms"
+, publisher =   "Carl Hanser Verlag"
+, address =     "M{\"u}nchen, Germany"
+, year =        1979
+, pages =       "17--24"
+, update =      "97.03 schwarzkopf"
 }
 
 @incollection{mo-msps-79
-, author =	"H. A. Maurer and T. A. Ottmann"
-, title =	"Manipulating sets of points: a survey"
-, editor =	"M. Nagl and H. J. Schneider"
-, booktitle =	"Applied Computer Science 13"
-, publisher =	"Carl Hanser Verlag"
-, year =	1979
-, pages =	"9--29"
+, author =      "H. A. Maurer and T. A. Ottmann"
+, title =       "Manipulating sets of points: a survey"
+, editor =      "M. Nagl and H. J. Schneider"
+, booktitle =   "Applied Computer Science 13"
+, publisher =   "Carl Hanser Verlag"
+, year =        1979
+, pages =       "9--29"
 }
 
 @article{m-dtchn-84
-, author =	"A. Maus"
-, title =	"Delaunay triangulation and the convex hull of $n$ points in expected linear time"
-, journal =	"BIT"
-, volume =	24
-, year =	1984
-, pages =	"151--163"
-, keywords =	"designing algorithms, convex hull, Delaunay triangulations, two-dimensional, expected-case analysis"
+, author =      "A. Maus"
+, title =       "Delaunay triangulation and the convex hull of $n$ points in expected linear time"
+, journal =     "BIT"
+, volume =      24
+, year =        1984
+, pages =       "151--163"
+, keywords =    "designing algorithms, convex hull, Delaunay triangulations, two-dimensional, expected-case analysis"
 }
 
 @article{m-amgvf-90
-, author =	"Dimtri J. Mavriplis"
-, title =	"Adaptive mesh generation for viscous flows using {Delaunay} triangulation"
-, journal =	"J. Comp. Physik"
-, volume =	90
-, number =	2
-, month =	oct
-, year =	1990
-, pages =	"271--291"
-, update =	"98.07 bibrelex"
+, author =      "Dimtri J. Mavriplis"
+, title =       "Adaptive mesh generation for viscous flows using {Delaunay} triangulation"
+, journal =     "J. Comp. Physik"
+, volume =      90
+, number =      2
+, month =       oct
+, year =        1990
+, pages =       "271--291"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{m-adtad-92
-, author =	"D. J. Mavriplis"
-, title =	"An advancing front {Delaunay} triangulation algorithm designed for robustness"
-, type =	"Report"
-, number =	"92-49"
-, institution =	"NASA Langly Research Center"
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "D. J. Mavriplis"
+, title =       "An advancing front {Delaunay} triangulation algorithm designed for robustness"
+, type =        "Report"
+, number =      "92-49"
+, institution = "NASA Langly Research Center"
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @article{m-wcvnf-99
-, author =	"N. Max"
-, title =	"Weights for Computing Vertex Normals from Facet Normals"
-, journal =	"J. Graphics Tools"
-, volume =	4
-, number =	2
-, year =	1999
-, pages =	"1--6"
-, update =	"00.03 held"
+, author =      "N. Max"
+, title =       "Weights for Computing Vertex Normals from Facet Normals"
+, journal =     "J. Graphics Tools"
+, volume =      4
+, number =      2
+, year =        1999
+, pages =       "1--6"
+, update =      "00.03 held"
 }
 
 @article{mhc-avcev-90
-, author =	"N. Max and P. Hanrahan and R. Crawfis"
-, title =	"Area and volume coherence for efficient visualization of $3$d scalar functions"
-, journal =	"Comput. Graph."
-, volume =	24
-, number =	5
-, year =	1990
-, pages =	"27--33"
-, update =	"97.11 bibrelex"
+, author =      "N. Max and P. Hanrahan and R. Crawfis"
+, title =       "Area and volume coherence for efficient visualization of $3$d scalar functions"
+, journal =     "Comput. Graph."
+, volume =      24
+, number =      5
+, year =        1990
+, pages =       "27--33"
+, update =      "97.11 bibrelex"
 }
 
 @article{m-orfdf-64
-, author =	"J. C. Maxwell"
-, title =	"On Reciprocal Figures and Diagrams of Forces"
-, journal =	"Phil. Mag. Ser."
-, volume =	27
-, year =	1864
-, pages =	"250--261"
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia"
+, author =      "J. C. Maxwell"
+, title =       "On Reciprocal Figures and Diagrams of Forces"
+, journal =     "Phil. Mag. Ser."
+, volume =      27
+, year =        1864
+, pages =       "250--261"
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia"
 }
 
 @article{mm-lsd-84
-, author =	"M. May and P. Mennecke"
-, title =	"Layout of Schematic Drawings"
-, journal =	"Syst. Anal. Model. Simul."
-, volume =	1
-, number =	4
-, year =	1984
-, pages =	"307--338"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. May and P. Mennecke"
+, title =       "Layout of Schematic Drawings"
+, journal =     "Syst. Anal. Model. Simul."
+, volume =      1
+, number =      4
+, year =        1984
+, pages =       "307--338"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{ms-bcn-88
-, author =	"M. May and K. Szkatula"
-, title =	"On the Bipartite Crossing Number"
-, journal =	"Control and Cybernetics"
-, volume =	17
-, number =	1
-, year =	1988
-, pages =	"85--98"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. May and K. Szkatula"
+, title =       "On the Bipartite Crossing Number"
+, journal =     "Control and Cybernetics"
+, volume =      17
+, number =      1
+, year =        1988
+, pages =       "85--98"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{mm-cwpcs-82
-, author =	"E. Mayr and A. Meyer"
-, title =	"The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals"
-, journal =	"Adv. Math."
-, volume =	46
-, year =	1982
-, pages =	"305--329"
-, update =	"97.11 bibrelex"
+, author =      "E. Mayr and A. Meyer"
+, title =       "The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals"
+, journal =     "Adv. Math."
+, volume =      46
+, year =        1982
+, pages =       "305--329"
+, update =      "97.11 bibrelex"
 }
 
 @article{mr-esrsu-95
-, author =	"N. Mayya and V. T. Rajan"
-, title =	"An Efficient Shape-Representation Scheme Using {Voronoi} Skeletons"
-, journal =	"Pattern Recogn. Lett."
-, volume =	16
-, number =	2
-, year =	1995
-, pages =	"147--160"
-, update =	"97.03 held"
+, author =      "N. Mayya and V. T. Rajan"
+, title =       "An Efficient Shape-Representation Scheme Using {Voronoi} Skeletons"
+, journal =     "Pattern Recogn. Lett."
+, volume =      16
+, number =      2
+, year =        1995
+, pages =       "147--160"
+, update =      "97.03 held"
 }
 
 @inproceedings{mb-cpvpe-96
-, author =	"Marisa Maz{\'o}n and Daciana Bochis"
-, title =	"Computing Periodic {Voronoi} Partitions on the {Euclidean} Plane"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"45--47"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Marisa Maz{\'o}n and Daciana Bochis"
+, title =       "Computing Periodic {Voronoi} Partitions on the {Euclidean} Plane"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "45--47"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{mr-cvdes-94
-, author =	"Marisa Maz{\'o}n and Tomas Recio"
-, title =	"The Computation of {Voronoi} Diagrams on the {Euclidean} and Spherical 2-Orbifolds"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"12--15"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Marisa Maz{\'o}n and Tomas Recio"
+, title =       "The Computation of {Voronoi} Diagrams on the {Euclidean} and Spherical 2-Orbifolds"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "12--15"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @proceedings{mrs-ewcg-94
-, title =	"Abstracts 10th European Workshop Comput. Geom."
-, editor =	"M. Maz{\'o}n and T. Recio and F. Santos"
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 10th European Workshop Comput. Geom."
+, editor =      "M. Maz{\'o}n and T. Recio and F. Santos"
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, update =      "00.03 bibrelex"
 }
 
 @phdthesis{m-ddvec-92
-, author =	"M. L. Maz{\'o}n"
-, title =	"Diagrams de {Voronoi} en caleidoscopios"
-, school =	"Universidad de Cantabria"
-, address =	"Santander, Spain"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "M. L. Maz{\'o}n"
+, title =       "Diagrams de {Voronoi} en caleidoscopios"
+, school =      "Universidad de Cantabria"
+, address =     "Santander, Spain"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{mr-vdbsc-91
-, author =	"M. L. Maz{\'o}n and T. Recio"
-, title =	"Voronoi Diagrams Bases on Stricly Convex Distances on the Plane"
-, type =	"Manuscript"
-, institution =	"Departamento de Matem{\'a}ticas, Universidad del Cantabria"
-, address =	"Santander, Spain"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "M. L. Maz{\'o}n and T. Recio"
+, title =       "Voronoi Diagrams Bases on Stricly Convex Distances on the Plane"
+, type =        "Manuscript"
+, institution = "Departamento de Matem{\'a}ticas, Universidad del Cantabria"
+, address =     "Santander, Spain"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{mr-vdcdg-90
-, author =	"M. L. Maz{\'o}n and T. Recio"
-, title =	"Voronoi diagrams coming from discrete groups on the plane"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"223--226"
-, cites =	"b-gtfga-80, dk-oacvd-87, ei-drmwc-79, k-cavd-89, ns-gg-87, ZZZ"
-, update =	"99.07 bibrelex, 98.07 bibrelex"
+, author =      "M. L. Maz{\'o}n and T. Recio"
+, title =       "Voronoi diagrams coming from discrete groups on the plane"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "223--226"
+, cites =       "b-gtfga-80, dk-oacvd-87, ei-drmwc-79, k-cavd-89, ns-gg-87, ZZZ"
+, update =      "99.07 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{mks-cplvd-93
-, author =	"Michael McAllister and David Kirkpatrick and Jack Snoeyink"
-, title =	"A Compact Piecewise-Linear {Voronoi} Diagram for Convex Sites in the Plane"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"573--582"
-, precedes =	"mks-cplvd-96"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Michael McAllister and David Kirkpatrick and Jack Snoeyink"
+, title =       "A Compact Piecewise-Linear {Voronoi} Diagram for Convex Sites in the Plane"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "573--582"
+, precedes =    "mks-cplvd-96"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{mks-cplvd2-96
-, author =	"M. McAllister and D. Kirkpatrick and J. Snoeyink"
-, title =	"A compact piecewise-linear {Voronoi} diagram for convex sites in the plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	15
-, year =	1996
-, pages =	"73--105"
-, succeeds =	"mks-cplvd-93"
-, update =	"00.03 bibrelex"
+, author =      "M. McAllister and D. Kirkpatrick and J. Snoeyink"
+, title =       "A compact piecewise-linear {Voronoi} diagram for convex sites in the plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      15
+, year =        1996
+, pages =       "73--105"
+, succeeds =    "mks-cplvd-93"
+, update =      "00.03 bibrelex"
 }
 
 @article{mks-cplvd-96
-, author =	"M. McAllister and D. Kirkpatrick and J. Snoeyink"
-, title =	"A compact piecewise-linear {Voronoi} diagram for convex sites in the plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	15
-, year =	1996
-, pages =	"73--105"
-, update =	"96.05 smid"
+, author =      "M. McAllister and D. Kirkpatrick and J. Snoeyink"
+, title =       "A compact piecewise-linear {Voronoi} diagram for convex sites in the plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      15
+, year =        1996
+, pages =       "73--105"
+, update =      "96.05 smid"
 }
 
 @misc{mks-avdpt-93
-, author =	"M. McAllister and D. Kirkpatrick and J. Snoeyink"
-, title =	"An approximate {Voronoi} diagram for planning translation motion"
-, year =	1993
-, note =	"In preparation"
-, update =	"98.03 bibrelex"
+, author =      "M. McAllister and D. Kirkpatrick and J. Snoeyink"
+, title =       "An approximate {Voronoi} diagram for planning translation motion"
+, year =        1993
+, note =        "In preparation"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{as-sdcav-94
-, author =	"M. {McAllister} and J. Snoeyink"
-, title =	"The spoke diagram: a compact approximate {Voronoi} diagram for spatial computation"
-, booktitle =	"Proc. GIS'94"
-, site =	"Vancouver"
-, year =	1994
-, update =	"98.11 bibrelex"
+, author =      "M. {McAllister} and J. Snoeyink"
+, title =       "The spoke diagram: a compact approximate {Voronoi} diagram for spatial computation"
+, booktitle =   "Proc. GIS'94"
+, site =        "Vancouver"
+, year =        1994
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ms-tdctd-93
-, author =	"M. McAllister and J. Snoeyink"
-, title =	"Two-dimensional computation of the three-dimensional reachableregion for a welding head"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"437--442"
-, cites =	"bo-arcgi-79, cegghss-rspug-91, cg-vippg-89, hs-parss-93, klps-ujrcf-86, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "M. McAllister and J. Snoeyink"
+, title =       "Two-dimensional computation of the three-dimensional reachableregion for a welding head"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "437--442"
+, cites =       "bo-arcgi-79, cegghss-rspug-91, cg-vippg-89, hs-parss-93, klps-ujrcf-86, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @book{m-oca-91
-, author =	"A. D. McAulay"
-, title =	"Optical Computer Architecture"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1991
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "A. D. McAulay"
+, title =       "Optical Computer Architecture"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1991
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{ma-lafch-79
-, author =	"D. McCallum and D. Avis"
-, title =	"A linear algorithm for finding the convex hull of a simple polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	9
-, year =	1979
-, pages =	"201--206"
-, keywords =	"polygons, convex hull"
+, author =      "D. McCallum and D. Avis"
+, title =       "A linear algorithm for finding the convex hull of a simple polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      9
+, year =        1979
+, pages =       "201--206"
+, keywords =    "polygons, convex hull"
 }
 
 @article{m-essle-73
-, author =	"M. McClellan"
-, title =	"The exact solution of systems of lienear equations with polynomial coefficients"
-, journal =	"J. ACM"
-, volume =	20
-, number =	4
-, year =	1973
-, pages =	"563--588"
-, update =	"98.03 bibrelex"
+, author =      "M. McClellan"
+, title =       "The exact solution of systems of lienear equations with polynomial coefficients"
+, journal =     "J. ACM"
+, volume =      20
+, number =      4
+, year =        1973
+, pages =       "563--588"
+, update =      "98.03 bibrelex"
 }
 
 @article{mv-papcb-75
-, author =	"D. E. McClure and R. A. Vitale"
-, title =	"Polygonal approximation of plane convex bodies"
-, journal =	"J. Math. Anal. Appl."
-, volume =	51
-, year =	1975
-, pages =	"326--358"
-, update =	"01.07 devillers, 98.07 bibrelex"
+, author =      "D. E. McClure and R. A. Vitale"
+, title =       "Polygonal approximation of plane convex bodies"
+, journal =     "J. Math. Anal. Appl."
+, volume =      51
+, year =        1975
+, pages =       "326--358"
+, update =      "01.07 devillers, 98.07 bibrelex"
 }
 
 @article{m-htcsc-67
-, author =	"M. C. McCord"
-, title =	"Homotopy type comparison of a space with complexes associated with its open covers"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	18
-, year =	1967
-, pages =	"705--708"
-, update =	"98.03 bibrelex"
+, author =      "M. C. McCord"
+, title =       "Homotopy type comparison of a space with complexes associated with its open covers"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      18
+, year =        1967
+, pages =       "705--708"
+, update =      "98.03 bibrelex"
 }
 
 @mastersthesis{m-isen-86
-, author =	"J. S. McCranie"
-, title =	"An investigation of the size of epsilon-nets"
-, type =	"M.{Sc}. Thesis"
-, school =	"Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1986
-, keywords =	"master thesis"
+, author =      "J. S. McCranie"
+, title =       "An investigation of the size of epsilon-nets"
+, type =        "M.{Sc}. Thesis"
+, school =      "Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1986
+, keywords =    "master thesis"
 }
 
 @inproceedings{msg-cgdsu-95
-, author =	"C. McCreary and F.-S. Shieh and H. Gill"
-, title =	"{CG}: a Graph Drawing System Using Graph-Grammar Parsing"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"270--273"
-, keywords =	"graph drawing, system, grammar"
-, update =	"95.01 tamassia"
+, author =      "C. McCreary and F.-S. Shieh and H. Gill"
+, title =       "{CG}: a Graph Drawing System Using Graph-Grammar Parsing"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "270--273"
+, keywords =    "graph drawing, system, grammar"
+, update =      "95.01 tamassia"
 }
 
 @techreport{m-eaeii-80
-, author =	"E. M. McCreight"
-, title =	"Efficient algorithms for enumerating intersecting intervals and rectangles"
-, type =	"Report"
-, number =	"CSL-80-9"
-, institution =	"Xerox Palo Alto Res. Center"
-, address =	"Palo Alto, CA"
-, year =	1980
+, author =      "E. M. McCreight"
+, title =       "Efficient algorithms for enumerating intersecting intervals and rectangles"
+, type =        "Report"
+, number =      "CSL-80-9"
+, institution = "Xerox Palo Alto Res. Center"
+, address =     "Palo Alto, CA"
+, year =        1980
 }
 
 @techreport{m-pst-81
-, author =	"E. M. McCreight"
-, title =	"Priority search trees"
-, type =	"Technical {Report}"
-, number =	"CSL-81-5"
-, institution =	"XEROX Palo Alto Research Centre"
-, address =	"Palo Alto, CA"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "E. M. McCreight"
+, title =       "Priority search trees"
+, type =        "Technical {Report}"
+, number =      "CSL-81-5"
+, institution = "XEROX Palo Alto Research Centre"
+, address =     "Palo Alto, CA"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @article{m-pst-85
-, author =	"E. M. McCreight"
-, title =	"Priority search trees"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, number =	2
-, year =	1985
-, pages =	"257--276"
-, update =	"98.11 bibrelex"
+, author =      "E. M. McCreight"
+, title =       "Priority search trees"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, number =      2
+, year =        1985
+, pages =       "257--276"
+, update =      "98.11 bibrelex"
 }
 
 @article{ml-rcecs-94
-, author =	"K. McCroan and R. Lacher"
-, title =	"Region coloring, edge coloring, and scan-conversion of maps"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"423--455"
-, keywords =	"polygon filling, polygon scan conversion, curve filling, color cycle, edge colring, region coloring"
-, update =	"96.09 devillers"
+, author =      "K. McCroan and R. Lacher"
+, title =       "Region coloring, edge coloring, and scan-conversion of maps"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "423--455"
+, keywords =    "polygon filling, polygon scan conversion, curve filling, color cycle, edge colring, region coloring"
+, update =      "96.09 devillers"
 }
 
 @article{mr-dtrds-80
-, author =	"M. J. McCullagh and C. G. Ross"
-, title =	"{Delaunay} Triangulation of a Random Data Set for Isarithmic Mapping"
-, journal =	"The Cartographic Journal"
-, volume =	17
-, number =	2
-, year =	1980
-, pages =	"93--99"
-, annote =	"Circumcircle algorithm with 2D bucketing for search.
-		 Discusses order of triangle construction. Bucket search
-		 order discussed."
+, author =      "M. J. McCullagh and C. G. Ross"
+, title =       "{Delaunay} Triangulation of a Random Data Set for Isarithmic Mapping"
+, journal =     "The Cartographic Journal"
+, volume =      17
+, number =      2
+, year =        1980
+, pages =       "93--99"
+, annote =      "Circumcircle algorithm with 2D bucketing for search.
+                 Discusses order of triangle construction. Bucket search
+                 order discussed."
 }
 
 @techreport{mp-spsrp-89
-, author =	"Kenneth M. McDonald and Joseph G. Peters"
-, title =	"Smallest paths in simple rectilinear polygons"
-, type =	"Technical Report"
-, number =	"TR 89-4"
-, institution =	"School of Computing Science, Simon Fraser Univ."
-, year =	1989
-, precedes =	"mp-spsrp-92, mp-spsrp-90"
-, update =	"98.07 bibrelex"
+, author =      "Kenneth M. McDonald and Joseph G. Peters"
+, title =       "Smallest paths in simple rectilinear polygons"
+, type =        "Technical Report"
+, number =      "TR 89-4"
+, institution = "School of Computing Science, Simon Fraser Univ."
+, year =        1989
+, precedes =    "mp-spsrp-92, mp-spsrp-90"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{mp-spsrp-90
-, author =	"Kenneth M. McDonald and J. G. Peters"
-, title =	"Smallest paths in simple rectilinear polygons"
-, type =	"Manuscript"
-, month =	mar
-, year =	1990
-, succeeds =	"mp-spsrp-89"
-, precedes =	"mp-spsrp-92"
-, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
+, author =      "Kenneth M. McDonald and J. G. Peters"
+, title =       "Smallest paths in simple rectilinear polygons"
+, type =        "Manuscript"
+, month =       mar
+, year =        1990
+, succeeds =    "mp-spsrp-89"
+, precedes =    "mp-spsrp-92"
+, update =      "98.07 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @article{mp-spsrp-92
-, author =	"Kenneth M. McDonald and Joseph G. Peters"
-, title =	"Smallest paths in simple rectilinear polygons"
-, journal =	"IEEE Trans. on Computer Aided Design"
-, volume =	11
-, year =	1992
-, pages =	"864--875"
-, keywords =	"bicriteria shortest paths, link distance, L1 metric, rectilinear shortest paths"
-, comments =	"Gives an $O(n)$ algorithm for finding a path that  is  `smallest' in the sense of minimizing both $L_1$ length and rectilinear link distance at the same time (after proving that such a path always exists in a rectilinear simple polygon).  They also give a parallel algorithm that takes time $O(\log n)$, on $O(n/\log n)$ processors, in EREW PRAM, after the  polygon is triangulated."
-, succeeds =	"mp-spsrp-90, mp-spsrp-89"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Kenneth M. McDonald and Joseph G. Peters"
+, title =       "Smallest paths in simple rectilinear polygons"
+, journal =     "IEEE Trans. on Computer Aided Design"
+, volume =      11
+, year =        1992
+, pages =       "864--875"
+, keywords =    "bicriteria shortest paths, link distance, L1 metric, rectilinear shortest paths"
+, comments =    "Gives an $O(n)$ algorithm for finding a path that  is  `smallest' in the sense of minimizing both $L_1$ length and rectilinear link distance at the same time (after proving that such a path always exists in a rectilinear simple polygon).  They also give a parallel algorithm that takes time $O(\log n)$, on $O(n/\log n)$ processors, in EREW PRAM, after the  polygon is triangulated."
+, succeeds =    "mp-spsrp-90, mp-spsrp-89"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @phdthesis{m-eaa-86
-, author =	"C. McGeoch"
-, title =	"Experimental analysis of algorithms"
-, school =	"School Comput. Sci., Carnegie Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1986
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "C. McGeoch"
+, title =       "Experimental analysis of algorithms"
+, school =      "School Comput. Sci., Carnegie Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1986
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{m-caclg-77
-, author =	"B. D. McKay"
-, title =	"Computing Automorphisms and Canonical Labelings of Graphs"
-, booktitle =	"??"
-, series =	"Lecture Notes Math."
-, volume =	686
-, publisher =	"Springer-Verlag"
-, year =	1977
-, pages =	"223--232"
-, update =	"97.11 bibrelex"
+, author =      "B. D. McKay"
+, title =       "Computing Automorphisms and Canonical Labelings of Graphs"
+, booktitle =   "??"
+, series =      "Lecture Notes Math."
+, volume =      686
+, publisher =   "Springer-Verlag"
+, year =        1977
+, pages =       "223--232"
+, update =      "97.11 bibrelex"
 }
 
 @article{m-strg-83
-, author =	"B. D. McKay"
-, title =	"Spanning trees in regular graphs"
-, journal =	"European J. Combin."
-, volume =	4
-, year =	1983
-, pages =	"149--160"
-, update =	"01.04 orourke"
+, author =      "B. D. McKay"
+, title =       "Spanning trees in regular graphs"
+, journal =     "European J. Combin."
+, volume =      4
+, year =        1983
+, pages =       "149--160"
+, update =      "01.04 orourke"
 }
 
 @inproceedings{m-ismit-87
-, author =	"David G. McKenna"
-, title =	"The Inward Spiral Method: An Improved {TIN} Generation Technique and Data Structure for Land Planning Applications"
-, booktitle =	"Proceedings, AUTOCARTO 8"
-, site =	"Baltimore, MD, March 29--April 3"
-, year =	1987
-, pages =	"670--679"
-, annote =	"CDT via selection. Bucket search. Extra vertices are
-		 added on boundary edges so that no constraint edge is
-		 longer than the grid size. Queue to store boundary"
+, author =      "David G. McKenna"
+, title =       "The Inward Spiral Method: An Improved {TIN} Generation Technique and Data Structure for Land Planning Applications"
+, booktitle =   "Proceedings, AUTOCARTO 8"
+, site =        "Baltimore, MD, March 29--April 3"
+, year =        1987
+, pages =       "670--679"
+, annote =      "CDT via selection. Bucket search. Extra vertices are
+                 added on boundary edges so that no constraint edge is
+                 longer than the grid size. Queue to store boundary"
 }
 
 @phdthesis{m-aagph-89
-, author =	"M. McKenna"
-, title =	"Applications of arrangements to geometric problems in higher dimensions"
-, school =	"Johns Hopkins University"
-, year =	1989
-, keywords =	"doctoral thesis"
+, author =      "M. McKenna"
+, title =       "Applications of arrangements to geometric problems in higher dimensions"
+, school =      "Johns Hopkins University"
+, year =        1989
+, keywords =    "doctoral thesis"
 }
 
 @techreport{m-wcohs-86
-, author =	"M. McKenna"
-, title =	"Worst-case optimal hidden-surface removal"
-, type =	"Technical {Report}"
-, number =	"JHU/EECS-86/05"
-, institution =	"Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "M. McKenna"
+, title =       "Worst-case optimal hidden-surface removal"
+, type =        "Technical {Report}"
+, number =      "JHU/EECS-86/05"
+, institution = "Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{m-wcohs-87
-, author =	"M. McKenna"
-, title =	"Worst-case optimal hidden-surface removal"
-, journal =	"ACM Trans. Graph."
-, volume =	6
-, year =	1987
-, pages =	"19--28"
-, keywords =	"design of algorithms, complexity theory, computer graphics, visibility, plane-sweep, hidden line/surface elimination"
+, author =      "M. McKenna"
+, title =       "Worst-case optimal hidden-surface removal"
+, journal =     "ACM Trans. Graph."
+, volume =      6
+, year =        1987
+, pages =       "19--28"
+, keywords =    "design of algorithms, complexity theory, computer graphics, visibility, plane-sweep, hidden line/surface elimination"
 }
 
 @inproceedings{mo-al3sd-88
-, author =	"M. McKenna and J. O'Rourke"
-, title =	"Arrangements of lines in $3$-space: a data structure with applications"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"371--380"
-, cites =	"ahu-daca-74, aw-alts-87, cgl-pgd-85, eg-tsa-86, egs-oplms-86, eos-calha-86, f-pp-87, gs-ccrs-86, hs-ndssg-86, kl-sc-72, m-wcohs-87, ms-foscp-85, w-cgpsl-87, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "M. McKenna and J. O'Rourke"
+, title =       "Arrangements of lines in $3$-space: a data structure with applications"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "371--380"
+, cites =       "ahu-daca-74, aw-alts-87, cgl-pgd-85, eg-tsa-86, egs-oplms-86, eos-calha-86, f-pp-87, gs-ccrs-86, hs-ndssg-86, kl-sc-72, m-wcohs-87, ms-foscp-85, w-cgpsl-87, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{mos-fmrio-85
-, author =	"M. McKenna and J. O'Rourke and Subhash Suri"
-, title =	"Finding maximal rectangles inscribed in an orthogonal polygon"
-, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
-, year =	1985
-, pages =	"486--495"
-, keywords =	"packing, area, rectangles"
-, update =	"98.03 mitchell"
+, author =      "M. McKenna and J. O'Rourke and Subhash Suri"
+, title =       "Finding maximal rectangles inscribed in an orthogonal polygon"
+, booktitle =   "Proc. 23rd Allerton Conf. Commun. Control Comput."
+, year =        1985
+, pages =       "486--495"
+, keywords =    "packing, area, rectangles"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ms-foscp-85
-, author =	"M. McKenna and R. Seidel"
-, title =	"Finding the optimal shadows of a convex polytope"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"24--28"
-, keywords =	"optimization, volume, arrangements"
-, cites =	"eos-calha-86, eos-calha-83, g-cp-67, t-sgprc-83, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "M. McKenna and R. Seidel"
+, title =       "Finding the optimal shadows of a convex polytope"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "24--28"
+, keywords =    "optimization, volume, arrangements"
+, cites =       "eos-calha-86, eos-calha-83, g-cp-67, t-sgprc-83, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{mt-fmvdb-83
-, author =	"M. McKenna and G. T. Toussaint"
-, title =	"Finding the minimum vertex distance between two disjoint convex polygons in linear time"
-, type =	"Technical {Report}"
-, number =	"SOCS-83-6"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, month =	apr
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "M. McKenna and G. T. Toussaint"
+, title =       "Finding the minimum vertex distance between two disjoint convex polygons in linear time"
+, type =        "Technical {Report}"
+, number =      "SOCS-83-6"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, month =       apr
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{mt-fmvdb-85
-, author =	"M. McKenna and G. T. Toussaint"
-, title =	"Finding the minimum vertex distance between two disjoint convex polygons in linear time"
-, journal =	"Comput. Math. Appl."
-, volume =	11
-, year =	1985
-, pages =	"1227--1242"
-, keywords =	"separation"
+, author =      "M. McKenna and G. T. Toussaint"
+, title =       "Finding the minimum vertex distance between two disjoint convex polygons in linear time"
+, journal =     "Comput. Math. Appl."
+, volume =      11
+, year =        1985
+, pages =       "1227--1242"
+, keywords =    "separation"
 }
 
 @article{mz-dsall-90
-, author =	"M. McKenna and D. Zeltzer"
-, title =	"Dynamic simulation of autonomous legged locomotion"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1990
-, pages =	"29--38"
-, note =	"Proc. SIGGRAPH '90"
-, update =	"97.11 bibrelex"
+, author =      "M. McKenna and D. Zeltzer"
+, title =       "Dynamic simulation of autonomous legged locomotion"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1990
+, pages =       "29--38"
+, note =        "Proc. SIGGRAPH '90"
+, update =      "97.11 bibrelex"
 }
 
 @book{m-ir-91
-, author =	"P. J. McKerrow"
-, title =	"Introduction to Robotics"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1991
-, update =	"97.03 schwarzkopf"
+, author =      "P. J. McKerrow"
+, title =       "Introduction to Robotics"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1991
+, update =      "97.03 schwarzkopf"
 }
 
 @article{m-dcadp-74
-, author =	"D. H. McLain"
-, title =	"Drawing contours from arbitrary data points"
-, journal =	"Comput. J."
-, volume =	17
-, year =	1974
-, pages =	"318--324"
-, update =	"93.09 jones"
+, author =      "D. H. McLain"
+, title =       "Drawing contours from arbitrary data points"
+, journal =     "Comput. J."
+, volume =      17
+, year =        1974
+, pages =       "318--324"
+, update =      "93.09 jones"
 }
 
 @article{m-etdir-76
-, author =	"D. H. McLain"
-, title =	"Errata to ``{Two} dimensional interpolation from random data''"
-, journal =	"Comput. J."
-, volume =	19
-, number =	4
-, year =	1976
-, pages =	384
-, succeeds =	"m-tdird-76"
-, update =	"98.03 bibrelex"
+, author =      "D. H. McLain"
+, title =       "Errata to ``{Two} dimensional interpolation from random data''"
+, journal =     "Comput. J."
+, volume =      19
+, number =      4
+, year =        1976
+, pages =       384
+, succeeds =    "m-tdird-76"
+, update =      "98.03 bibrelex"
 }
 
 @article{m-tdird-76
-, author =	"D. H. McLain"
-, title =	"Two dimensional interpolation from random data"
-, journal =	"Comput. J."
-, volume =	19
-, year =	1976
-, pages =	"178--181"
-, precedes =	"m-etdir-76"
-, update =	"98.03 bibrelex"
+, author =      "D. H. McLain"
+, title =       "Two dimensional interpolation from random data"
+, journal =     "Comput. J."
+, volume =      19
+, year =        1976
+, pages =       "178--181"
+, precedes =    "m-etdir-76"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{m-ioopt-93
-, author =	"M. J. McLennan"
-, title =	"[{Inc} {Tcl}]: object-oriented programming in {Tcl}"
-, booktitle =	"Proceedings of the Tcl/Tk Workshop 1993"
-, year =	1993
-, url =	"http://www.wn.com/biz/itcl"
-, update =	"98.07 bibrelex"
+, author =      "M. J. McLennan"
+, title =       "[{Inc} {Tcl}]: object-oriented programming in {Tcl}"
+, booktitle =   "Proceedings of the Tcl/Tk Workshop 1993"
+, year =        1993
+, url = "http://www.wn.com/biz/itcl"
+, update =      "98.07 bibrelex"
 }
 
 @article{m-ssr-79
-, author =	"R. McLeod"
-, title =	"The {Steiner} Surface Revisited"
-, journal =	"Proc. Roy. Soc. London Ser. A"
-, volume =	369
-, year =	1979
-, pages =	"157--174"
-, update =	"98.03 bibrelex"
+, author =      "R. McLeod"
+, title =       "The {Steiner} Surface Revisited"
+, journal =     "Proc. Roy. Soc. London Ser. A"
+, volume =      369
+, year =        1979
+, pages =       "157--174"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ms-cspsl-99
-, author =	"S. McMains and C. S{\'e}quin"
-, title =	"A coherent sweep plane slicer for layered manufacturing"
-, booktitle =	"Proc. 5th ACM Symposium on Solid Modeling and Applications"
-, year =	1999
-, pages =	"285--295"
-, update =	"00.03 smid"
+, author =      "S. McMains and C. S{\'e}quin"
+, title =       "A coherent sweep plane slicer for layered manufacturing"
+, booktitle =   "Proc. 5th ACM Symposium on Solid Modeling and Applications"
+, year =        1999
+, pages =       "285--295"
+, update =      "00.03 smid"
 }
 
 @article{m-samml-86
-, author =	"R. B. McMaster"
-, title =	"A statistical analysis of mathematical measures for linear simplification"
-, journal =	"Amer. Cartogr."
-, volume =	13
-, year =	1986
-, pages =	"103--116"
-, update =	"98.03 bibrelex"
+, author =      "R. B. McMaster"
+, title =       "A statistical analysis of mathematical measures for linear simplification"
+, journal =     "Amer. Cartogr."
+, volume =      13
+, year =        1986
+, pages =       "103--116"
+, update =      "98.03 bibrelex"
 }
 
 @article{m-alg-87
-, author =	"R. B. McMaster"
-, title =	"Automated Line Generation"
-, journal =	"Cartographica"
-, volume =	24
-, number =	2
-, year =	1987
-, pages =	"74--111"
+, author =      "R. B. McMaster"
+, title =       "Automated Line Generation"
+, journal =     "Cartographica"
+, volume =      24
+, number =      2
+, year =        1987
+, pages =       "74--111"
 }
 
 @article{m-z-71
-, author =	"P. McMullen"
-, title =	"On zonotopes"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	159
-, year =	1971
-, pages =	"91--109"
-, update =	"94.05 devillers"
+, author =      "P. McMullen"
+, title =       "On zonotopes"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      159
+, year =        1971
+, pages =       "91--109"
+, update =      "94.05 devillers"
 }
 
 @article{m-mnfcp-70
-, author =	"P. McMullen"
-, title =	"The maximal number of faces of a convex polytope"
-, journal =	"Mathematika"
-, volume =	17
-, year =	1970
-, pages =	"179--184"
-, update =	"98.03 smid"
+, author =      "P. McMullen"
+, title =       "The maximal number of faces of a convex polytope"
+, journal =     "Mathematika"
+, volume =      17
+, year =        1970
+, pages =       "179--184"
+, update =      "98.03 smid"
 }
 
 @book{ms-cpubc-71
-, author =	"P. McMullen and G. C. Shephard"
-, title =	"Convex Polytopes and the Upper Bound Conjecture"
-, series =	"Lecture Notes"
-, volume =	3
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge, England"
-, year =	1971
-, update =	"97.11 bibrelex"
+, author =      "P. McMullen and G. C. Shephard"
+, title =       "Convex Polytopes and the Upper Bound Conjecture"
+, series =      "Lecture Notes"
+, volume =      3
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge, England"
+, year =        1971
+, update =      "97.11 bibrelex"
 }
 
 @article{mw-glbcs-71
-, author =	"P. McMullen and D. Walkup"
-, title =	"A generalized lower-bound conjecture for simplical polytopes"
-, journal =	"Mathematika"
-, volume =	18
-, year =	1971
-, pages =	"246--273"
-, update =	"98.03 bibrelex"
+, author =      "P. McMullen and D. Walkup"
+, title =       "A generalized lower-bound conjecture for simplical polytopes"
+, journal =     "Mathematika"
+, volume =      18
+, year =        1971
+, pages =       "246--273"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{mt-uchap-84
-, author =	"M. M. {McQueen} and G. T. Toussaint"
-, title =	"On the Ultimate Convex Hull Algorithm in Practice"
-, type =	"Technical {Report}"
-, number =	"SOCS-84.2"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, month =	feb
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "M. M. {McQueen} and G. T. Toussaint"
+, title =       "On the Ultimate Convex Hull Algorithm in Practice"
+, type =        "Technical {Report}"
+, number =      "SOCS-84.2"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, month =       feb
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{mt-uchap-85
-, author =	"M. M. McQueen and G. T. Toussaint"
-, title =	"On the ultimate convex hull algorithm in practice"
-, journal =	"Pattern Recogn. Lett."
-, volume =	3
-, year =	1985
-, pages =	"29--34"
+, author =      "M. M. McQueen and G. T. Toussaint"
+, title =       "On the ultimate convex hull algorithm in practice"
+, journal =     "Pattern Recogn. Lett."
+, volume =      3
+, year =        1985
+, pages =       "29--34"
 }
 
 @article{md-aerpc-73
-, author =	"W. B. McRae and E. R. Davidson"
-, title =	"An algorithm for the extreme rays of a pointed convex polyhedral cone"
-, journal =	"SIAM J. Comput."
-, volume =	2
-, year =	1973
-, pages =	"281--293"
+, author =      "W. B. McRae and E. R. Davidson"
+, title =       "An algorithm for the extreme rays of a pointed convex polyhedral cone"
+, journal =     "SIAM J. Comput."
+, volume =      2
+, year =        1973
+, pages =       "281--293"
 }
 
 @article{m-erf-34
-, author =	"E. J. McShane"
-, title =	"Extensions of range functions"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	40
-, year =	1934
-, pages =	"837--842"
-, update =	"98.07 bibrelex"
+, author =      "E. J. McShane"
+, title =       "Extensions of range functions"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      40
+, year =        1934
+, pages =       "837--842"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{m-digbv-95
-, author =	"J. D. McWhirter"
-, title =	"A Demonstration of Interactive Graph Based Visual Language Applications"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"274--277"
-, keywords =	"graph drawing, system, visual language"
-, update =	"95.01 tamassia"
+, author =      "J. D. McWhirter"
+, title =       "A Demonstration of Interactive Graph Based Visual Language Applications"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "274--277"
+, keywords =    "graph drawing, system, visual language"
+, update =      "95.01 tamassia"
 }
 
 @book{m-avns-89
-, author =	"C. Mead"
-, title =	"Analog {VLSI} and neural systems"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "C. Mead"
+, title =       "Analog {VLSI} and neural systems"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @book{mc-ivs-80
-, author =	"C. Mead and L. Conway"
-, title =	"Introduction to VLSI Systems"
-, publisher =	"Addison-Wesley"
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "C. Mead and L. Conway"
+, title =       "Introduction to VLSI Systems"
+, publisher =   "Addison-Wesley"
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @article{m-ripsy-66
-, author =	"R. Mead"
-, title =	"A relation between the individual plant-spacing and yield"
-, journal =	"Annals of Botany, N.S."
-, volume =	30
-, year =	1966
-, pages =	"301--309"
-, update =	"97.03 schwarzkopf"
+, author =      "R. Mead"
+, title =       "A relation between the individual plant-spacing and yield"
+, journal =     "Annals of Botany, N.S."
+, volume =      30
+, year =        1966
+, pages =       "301--309"
+, update =      "97.03 schwarzkopf"
 }
 
 @article{m-gmuqe-82
-, author =	"D. J. R. Meagher"
-, title =	"Geometric modeling using quadtree encoding"
-, journal =	"Comput. Graph. Image Process."
-, volume =	19
-, year =	1982
-, pages =	"129--147"
+, author =      "D. J. R. Meagher"
+, title =       "Geometric modeling using quadtree encoding"
+, journal =     "Comput. Graph. Image Process."
+, volume =      19
+, year =        1982
+, pages =       "129--147"
 }
 
 @techreport{m-ogam-82
-, author =	"D. J. R. Meagher"
-, title =	"Octree generation, analysis and manipulation"
-, type =	"Report"
-, number =	"IPL-TR-027"
-, institution =	"Image Process. Lab., Rensselaer Polytech. Inst."
-, address =	"Troy, NY"
-, year =	1982
+, author =      "D. J. R. Meagher"
+, title =       "Octree generation, analysis and manipulation"
+, type =        "Report"
+, number =      "IPL-TR-027"
+, institution = "Image Process. Lab., Rensselaer Polytech. Inst."
+, address =     "Troy, NY"
+, year =        1982
 }
 
 @techreport{m-oemes-82
-, author =	"D. J. R. Meagher"
-, title =	"The octree encoding method for efficient solid modeling"
-, type =	"Report"
-, number =	"IPL-TR-032"
-, institution =	"Image Process. Lab., Rensselaer Polytech. Inst."
-, address =	"Troy, NY"
-, year =	1982
+, author =      "D. J. R. Meagher"
+, title =       "The octree encoding method for efficient solid modeling"
+, type =        "Report"
+, number =      "IPL-TR-032"
+, institution = "Image Process. Lab., Rensselaer Polytech. Inst."
+, address =     "Troy, NY"
+, year =        1982
 }
 
 @inproceedings{m-asmab-92
-, author =	"J. E. Mebius"
-, title =	"Artibodies: A System for Modelling Articulated Bodies"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"9--11"
-, update =	"00.03 bibrelex"
+, author =      "J. E. Mebius"
+, title =       "Artibodies: A System for Modelling Articulated Bodies"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "9--11"
+, update =      "00.03 bibrelex"
 }
 
 @incollection{m-rtgh-84
-, author =	"J. Mecke"
-, title =	"Random Tessellations generated by hyperplanes"
-, editor =	"R. Ambartzumian and W. Weil"
-, booktitle =	"Stochastic Geometry, Geometric Statistics, Stereology"
-, publisher =	"B. G. Teubner"
-, address =	"Leipzig"
-, year =	1984
-, pages =	"104--109"
-, update =	"99.11 bibrelex, 98.07 agarwal"
+, author =      "J. Mecke"
+, title =       "Random Tessellations generated by hyperplanes"
+, editor =      "R. Ambartzumian and W. Weil"
+, booktitle =   "Stochastic Geometry, Geometric Statistics, Stereology"
+, publisher =   "B. G. Teubner"
+, address =     "Leipzig"
+, year =        1984
+, pages =       "104--109"
+, update =      "99.11 bibrelex, 98.07 agarwal"
 }
 
 @inproceedings{mcd-vtsml-94
-, author =	"M. R. Mediano and M. A. Casanova and M. Dreux"
-, title =	"{V}-trees: {A} storage method for long vector data"
-, booktitle =	"Proc. 20th VLDB Conference"
-, year =	1994
-, pages =	"321--329"
-, update =	"97.07 agarwal"
+, author =      "M. R. Mediano and M. A. Casanova and M. Dreux"
+, title =       "{V}-trees: {A} storage method for long vector data"
+, booktitle =   "Proc. 20th VLDB Conference"
+, year =        1994
+, pages =       "321--329"
+, update =      "97.07 agarwal"
 }
 
 @article{m-atdvp-86
-, author =	"N. N. Medvedev"
-, title =	"The Algorithm for Three Dimensional {Voronoi} Polyhedra"
-, journal =	"J. Comput. Phys."
-, volume =	67
-, year =	1986
-, pages =	"223--229"
-, annote =	"Construction of a single Voronoi polyhedron.
-		 Effectively follows edges."
+, author =      "N. N. Medvedev"
+, title =       "The Algorithm for Three Dimensional {Voronoi} Polyhedra"
+, journal =     "J. Comput. Phys."
+, volume =      67
+, year =        1986
+, pages =       "223--229"
+, annote =      "Construction of a single Voronoi polyhedron.
+                 Effectively follows edges."
 }
 
 @inproceedings{m-irmbc-95
-, author =	"C. Meghini"
-, title =	"An Image Retrieval Model Based on Classical Logic"
-, booktitle =	"Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
-, year =	1995
-, pages =	"300--308"
-, update =	"98.07 agarwal"
+, author =      "C. Meghini"
+, title =       "An Image Retrieval Model Based on Classical Logic"
+, booktitle =   "Proc. 16th Annu. Internat. ACM SIGIR Conf. Research and Develop. in Inform. Retrieval"
+, year =        1995
+, pages =       "300--308"
+, update =      "98.07 agarwal"
 }
 
 @article{m-ndlp-86
-, author =	"N. Megiddo"
-, title =	"A note on degeneracy in linear programming"
-, journal =	"Math. Program."
-, volume =	35
-, year =	1986
-, pages =	"365--367"
-, keywords =	"complexity theory, linear programming"
+, author =      "N. Megiddo"
+, title =       "A note on degeneracy in linear programming"
+, journal =     "Math. Program."
+, volume =      35
+, year =        1986
+, pages =       "365--367"
+, keywords =    "complexity theory, linear programming"
 }
 
 @article{m-apcad-83
-, author =	"N. Megiddo"
-, title =	"Applying parallel computation algorithms in the design of serial algorithms"
-, journal =	"J. ACM"
-, volume =	30
-, number =	4
-, year =	1983
-, pages =	"852--865"
-, keywords =	"design of algorithms, parallel computation, binary search"
-, update =	"98.11 bibrelex"
+, author =      "N. Megiddo"
+, title =       "Applying parallel computation algorithms in the design of serial algorithms"
+, journal =     "J. ACM"
+, volume =      30
+, number =      4
+, year =        1983
+, pages =       "852--865"
+, keywords =    "design of algorithms, parallel computation, binary search"
+, update =      "98.11 bibrelex"
 }
 
 @article{m-corof-79
-, author =	"N. Megiddo"
-, title =	"Combinatorial optimization with rational objective functions"
-, journal =	"Math. Oper. Res."
-, volume =	4
-, year =	1979
-, pages =	"414--424"
-, keywords =	"complexity theory, design of algorithms, optimization, binary search"
+, author =      "N. Megiddo"
+, title =       "Combinatorial optimization with rational objective functions"
+, journal =     "Math. Oper. Res."
+, volume =      4
+, year =        1979
+, pages =       "414--424"
+, keywords =    "complexity theory, design of algorithms, optimization, binary search"
 }
 
 @article{m-dlp-86
-, author =	"N. Megiddo"
-, title =	"Dynamic location problems"
-, journal =	"Oper. Res."
-, volume =	6
-, year =	1986
-, pages =	"313--319"
-, keywords =	"design of algorithms, balls, optimization"
+, author =      "N. Megiddo"
+, title =       "Dynamic location problems"
+, journal =     "Oper. Res."
+, volume =      6
+, year =        1986
+, pages =       "313--319"
+, keywords =    "design of algorithms, balls, optimization"
 }
 
 @article{m-iaaan-86
-, author =	"N. Megiddo"
-, title =	"Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm"
-, journal =	"Math. Program."
-, volume =	35
-, year =	1986
-, pages =	"140--172"
-, keywords =	"average-case analysis, linear programming"
+, author =      "N. Megiddo"
+, title =       "Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm"
+, journal =     "Math. Program."
+, volume =      35
+, year =        1986
+, pages =       "140--172"
+, keywords =    "average-case analysis, linear programming"
 }
 
 @article{m-ibeap-82
-, author =	"N. Megiddo"
-, title =	"Is binary encoding appropriate for the problem-language relationship?"
-, journal =	"Theoret. Comput. Sci."
-, volume =	19
-, year =	1982
-, pages =	"337--341"
-, keywords =	"computational model"
+, author =      "N. Megiddo"
+, title =       "Is binary encoding appropriate for the problem-language relationship?"
+, journal =     "Theoret. Comput. Sci."
+, volume =      19
+, year =        1982
+, pages =       "337--341"
+, keywords =    "computational model"
 }
 
 @article{m-lp198-87
-, author =	"N. Megiddo"
-, title =	"Linear programming (1986)"
-, journal =	"Annu. Rev. Comput. Sci."
-, volume =	2
-, year =	1987
-, pages =	"119--145"
-, keywords =	"survey paper"
+, author =      "N. Megiddo"
+, title =       "Linear programming (1986)"
+, journal =     "Annu. Rev. Comput. Sci."
+, volume =      2
+, year =        1987
+, pages =       "119--145"
+, keywords =    "survey paper"
 }
 
 @article{m-lpltw-84
-, author =	"N. Megiddo"
-, title =	"Linear programming in linear time when the dimension is fixed"
-, journal =	"J. ACM"
-, volume =	31
-, year =	1984
-, pages =	"114--127"
-, keywords =	"design of algorithms, linear programming, worst-case analysis, prune-and-search"
+, author =      "N. Megiddo"
+, title =       "Linear programming in linear time when the dimension is fixed"
+, journal =     "J. ACM"
+, volume =      31
+, year =        1984
+, pages =       "114--127"
+, keywords =    "design of algorithms, linear programming, worst-case analysis, prune-and-search"
 }
 
 @inproceedings{m-ltalp-82
-, author =	"N. Megiddo"
-, title =	"Linear-time algorithms for linear programming in {$R^{3}$} and related problems"
-, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1982
-, pages =	"329--338"
-, precedes =	"m-ltalp-83"
+, author =      "N. Megiddo"
+, title =       "Linear-time algorithms for linear programming in {$R^{3}$} and related problems"
+, booktitle =   "Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1982
+, pages =       "329--338"
+, precedes =    "m-ltalp-83"
 }
 
 @article{m-ltalp-83
-, author =	"N. Megiddo"
-, title =	"Linear-time algorithms for linear programming in {$R^{3}$} and related problems"
-, journal =	"SIAM J. Comput."
-, volume =	12
-, number =	4
-, year =	1983
-, pages =	"759--776"
-, keywords =	"design of algorithms, linear programming, three-dimensional, graph theory, prune-and-search, geometric transformations, points, lines, planes"
-, succeeds =	"m-ltalp-82"
-, update =	"01.04 icking"
+, author =      "N. Megiddo"
+, title =       "Linear-time algorithms for linear programming in {$R^{3}$} and related problems"
+, journal =     "SIAM J. Comput."
+, volume =      12
+, number =      4
+, year =        1983
+, pages =       "759--776"
+, keywords =    "design of algorithms, linear programming, three-dimensional, graph theory, prune-and-search, geometric transformations, points, lines, planes"
+, succeeds =    "m-ltalp-82"
+, update =      "01.04 icking"
 }
 
 @article{m-nalp-86
-, author =	"N. Megiddo"
-, title =	"New approaches to linear programming"
-, journal =	"Algorithmica"
-, volume =	1
-, year =	1986
-, pages =	"387--394"
-, keywords =	"survey paper"
+, author =      "N. Megiddo"
+, title =       "New approaches to linear programming"
+, journal =     "Algorithmica"
+, volume =      1
+, year =        1986
+, pages =       "387--394"
+, keywords =    "survey paper"
 }
 
 @techreport{m-splp-81
-, author =	"N. Megiddo"
-, title =	"On some planar location problems"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Statist., Tel-Aviv Univ."
-, address =	"Tel-Aviv, Israel"
-, year =	1981
+, author =      "N. Megiddo"
+, title =       "On some planar location problems"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Statist., Tel-Aviv Univ."
+, address =     "Tel-Aviv, Israel"
+, year =        1981
 }
 
 @article{m-bsb-89
-, author =	"N. Megiddo"
-, title =	"On the ball spanned by balls"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"605--610"
+, author =      "N. Megiddo"
+, title =       "On the ball spanned by balls"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "605--610"
 }
 
 @incollection{m-clp-85
-, author =	"N. Megiddo"
-, title =	"On the complexity of linear programming"
-, editor =	"T. Bewley"
-, booktitle =	"Advances in Economic Theory"
-, publisher =	"Cambridge University Press"
-, year =	1985
-, pages =	"??"
-, keywords =	"survey paper, linear programming, complexity theory, computational model"
+, author =      "N. Megiddo"
+, title =       "On the complexity of linear programming"
+, editor =      "T. Bewley"
+, booktitle =   "Advances in Economic Theory"
+, publisher =   "Cambridge University Press"
+, year =        1985
+, pages =       "??"
+, keywords =    "survey paper, linear programming, complexity theory, computational model"
 }
 
 @article{m-cps-88
-, author =	"N. Megiddo"
-, title =	"On the complexity of polyhedral separability"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"325--337"
-, keywords =	"NP-completeness, separation, hyperplanes, two-dimensional, $d$-dimensional"
+, author =      "N. Megiddo"
+, title =       "On the complexity of polyhedral separability"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "325--337"
+, keywords =    "NP-completeness, separation, hyperplanes, two-dimensional, $d$-dimensional"
 }
 
 @techreport{m-csgpu-87
-, author =	"N. Megiddo"
-, title =	"On the complexity of some geometric problems in unbounded dimension"
-, type =	"Report"
-, number =	"RJ 5744"
-, institution =	"IBM Almeden Res. Center"
-, address =	"San Jose, CA"
-, year =	1987
-, keywords =	"balls, covering, stabbing, $d$-dimensional, NP-completeness"
+, author =      "N. Megiddo"
+, title =       "On the complexity of some geometric problems in unbounded dimension"
+, type =        "Report"
+, number =      "RJ 5744"
+, institution = "IBM Almeden Res. Center"
+, address =     "San Jose, CA"
+, year =        1987
+, keywords =    "balls, covering, stabbing, $d$-dimensional, NP-completeness"
 }
 
 @article{m-csgpu-90
-, author =	"N. Megiddo"
-, title =	"On the complexity of some geometric problems in unbounded dimension"
-, journal =	"J. Symbolic Comput."
-, volume =	10
-, year =	1990
-, pages =	"327--334"
-, keywords =	"balls, covering, stabbing, $d$-dimensional, NP-completeness"
-, update =	"96.09 agarwal, 96.05 agarwal"
+, author =      "N. Megiddo"
+, title =       "On the complexity of some geometric problems in unbounded dimension"
+, journal =     "J. Symbolic Comput."
+, volume =      10
+, year =        1990
+, pages =       "327--334"
+, keywords =    "balls, covering, stabbing, $d$-dimensional, NP-completeness"
+, update =      "96.09 agarwal, 96.05 agarwal"
 }
 
 @article{m-cotnd-82
-, author =	"N. Megiddo"
-, title =	"On the complexity of the one-terminal network design problem"
-, journal =	"Oper. Res. Lett."
-, volume =	3
-, year =	1982
-, pages =	"105--107"
-, keywords =	"VLSI design, NP-completeness"
+, author =      "N. Megiddo"
+, title =       "On the complexity of the one-terminal network design problem"
+, journal =     "Oper. Res. Lett."
+, volume =      3
+, year =        1982
+, pages =       "105--107"
+, keywords =    "VLSI design, NP-completeness"
 }
 
 @techreport{m-pafmm-82
-, author =	"N. Megiddo"
-, title =	"Parallel algorithms for finding the maximum and median almost surely in constant-time"
-, type =	"Report"
-, number =	"??"
-, institution =	"Grad. School Indust. Admin., Carnegie-Mellon Univ."
-, address =	"Philadelphia, PA"
-, year =	1982
-, keywords =	"complexity theory, parallel computation, searching, Las Vegas"
+, author =      "N. Megiddo"
+, title =       "Parallel algorithms for finding the maximum and median almost surely in constant-time"
+, type =        "Report"
+, number =      "??"
+, institution = "Grad. School Indust. Admin., Carnegie-Mellon Univ."
+, address =     "Philadelphia, PA"
+, year =        1982
+, keywords =    "complexity theory, parallel computation, searching, Las Vegas"
 }
 
 @article{m-ptlp-85
-, author =	"N. Megiddo"
-, title =	"Partitioning with two lines in the plane"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	"430--433"
-, keywords =	"prune-and-search, design of algorithms, points, lines, two-dimensional"
+, author =      "N. Megiddo"
+, title =       "Partitioning with two lines in the plane"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "430--433"
+, keywords =    "prune-and-search, design of algorithms, points, lines, two-dimensional"
 }
 
 @techreport{m-plpal-82
-, author =	"N. Megiddo"
-, title =	"Poly-log parallel algorithms for {LP} with an application to exploding flying objects"
-, type =	"Technical {Report}"
-, number =	"??"
-, institution =	"Grad. School Indust. Admin., Carnegie-Mellon Univ."
-, address =	"Philadelphia, PA"
-, year =	1982
-, keywords =	"design of algorithms, parallel computation, optimization, balls, three-dimensional, $d$-dimensional"
+, author =      "N. Megiddo"
+, title =       "Poly-log parallel algorithms for {LP} with an application to exploding flying objects"
+, type =        "Technical {Report}"
+, number =      "??"
+, institution = "Grad. School Indust. Admin., Carnegie-Mellon Univ."
+, address =     "Philadelphia, PA"
+, year =        1982
+, keywords =    "design of algorithms, parallel computation, optimization, balls, three-dimensional, $d$-dimensional"
 }
 
 @unpublished{m-ppaa-90
-, author =	"N. Megiddo"
-, title =	"Poly-log parallel algorithms for {LP} with an application to exploding flying objects"
-, year =	1990
-, note =	"Unpublished manuscript"
-, update =	"99.03 bibrelex, 95.09 agarwal"
+, author =      "N. Megiddo"
+, title =       "Poly-log parallel algorithms for {LP} with an application to exploding flying objects"
+, year =        1990
+, note =        "Unpublished manuscript"
+, update =      "99.03 bibrelex, 95.09 agarwal"
 }
 
 @article{m-we1cp-83
-, author =	"N. Megiddo"
-, title =	"The weighted {Euclidean} $1$-center problem"
-, journal =	"Math. Oper. Res."
-, volume =	8
-, number =	4
-, year =	1983
-, pages =	"498--504"
-, keywords =	"design of algorithms, binary search, two-dimensional, circles, weighted, proximity"
+, author =      "N. Megiddo"
+, title =       "The weighted {Euclidean} $1$-center problem"
+, journal =     "Math. Oper. Res."
+, volume =      8
+, number =      4
+, year =        1983
+, pages =       "498--504"
+, keywords =    "design of algorithms, binary search, two-dimensional, circles, weighted, proximity"
 }
 
 @article{m-tgpal-83
-, author =	"N. Megiddo"
-, title =	"Towards a genuinely polynomial algorithms for linear programming"
-, journal =	"SIAM J. Comput."
-, volume =	12
-, year =	1983
-, pages =	"347--353"
-, keywords =	"design of algorithms, linear programming, binary search, worst-case analysis, convex, $d$-dimensional"
+, author =      "N. Megiddo"
+, title =       "Towards a genuinely polynomial algorithms for linear programming"
+, journal =     "SIAM J. Comput."
+, volume =      12
+, year =        1983
+, pages =       "347--353"
+, keywords =    "design of algorithms, linear programming, binary search, worst-case analysis, convex, $d$-dimensional"
 }
 
 @inproceedings{mhgjp-csg-81
-, author =	"N. Megiddo and S. L. Hakimi and M. R. Garey and D. S. Johnson and C. H. Papadimitriou"
-, title =	"On the complexity of searching a graph"
-, booktitle =	"Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1981
-, pages =	"376--385"
-, keywords =	"worst-case analysis, graph theory, dynamic programming, NP-completeness"
-, precedes =	"mhgjp-csg-88"
+, author =      "N. Megiddo and S. L. Hakimi and M. R. Garey and D. S. Johnson and C. H. Papadimitriou"
+, title =       "On the complexity of searching a graph"
+, booktitle =   "Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1981
+, pages =       "376--385"
+, keywords =    "worst-case analysis, graph theory, dynamic programming, NP-completeness"
+, precedes =    "mhgjp-csg-88"
 }
 
 @article{mhgjp-csg-88
-, author =	"N. Megiddo and S. L. Hakimi and M. R. Garey and D. S. Johnson and C. H. Papadimitriou"
-, title =	"On the complexity of searching a graph"
-, journal =	"J. ACM"
-, volume =	35
-, year =	1988
-, pages =	"18--44"
-, succeeds =	"mhgjp-csg-81"
+, author =      "N. Megiddo and S. L. Hakimi and M. R. Garey and D. S. Johnson and C. H. Papadimitriou"
+, title =       "On the complexity of searching a graph"
+, journal =     "J. ACM"
+, volume =      35
+, year =        1988
+, pages =       "18--44"
+, succeeds =    "mhgjp-csg-81"
 }
 
 @article{ms-cscgl-84
-, author =	"N. Megiddo and K. J. Supowit"
-, title =	"On the complexity of some common geometric location problems"
-, journal =	"SIAM J. Comput."
-, volume =	13
-, number =	1
-, year =	1984
-, pages =	"182--196"
-, keywords =	"NP-completeness, packing, covering, proximity"
-, update =	"98.03 bibrelex"
+, author =      "N. Megiddo and K. J. Supowit"
+, title =       "On the complexity of some common geometric location problems"
+, journal =     "SIAM J. Comput."
+, volume =      13
+, number =      1
+, year =        1984
+, pages =       "182--196"
+, keywords =    "NP-completeness, packing, covering, proximity"
+, update =      "98.03 bibrelex"
 }
 
 @article{tt-fldl-83
-, author =	"N. Megiddo and A. Tamir"
-, title =	"Finding least-distances lines"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	2
-, year =	1983
-, pages =	"207--211"
-, keywords =	"design of algorithms, optimization, statistics"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "N. Megiddo and A. Tamir"
+, title =       "Finding least-distances lines"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      2
+, year =        1983
+, pages =       "207--211"
+, keywords =    "design of algorithms, optimization, statistics"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @article{mt-nrcpc-83
-, author =	"N. Megiddo and A. Tamir"
-, title =	"New results on the complexity of $p$-center problems"
-, journal =	"SIAM J. Comput."
-, volume =	12
-, year =	1983
-, pages =	"751--758"
-, keywords =	"design of algorithms, graph theory, binary search, trees"
+, author =      "N. Megiddo and A. Tamir"
+, title =       "New results on the complexity of $p$-center problems"
+, journal =     "SIAM J. Comput."
+, volume =      12
+, year =        1983
+, pages =       "751--758"
+, keywords =    "design of algorithms, graph theory, binary search, trees"
 }
 
 @article{mt-cllfp-82
-, author =	"N. Megiddo and A. Tamir"
-, title =	"On the complexity of locating linear facilities in the plane"
-, journal =	"Oper. Res. Lett."
-, volume =	1
-, year =	1982
-, pages =	"194--197"
-, keywords =	"VLSI design, NP-completeness, points, lines, two-dimensional"
+, author =      "N. Megiddo and A. Tamir"
+, title =       "On the complexity of locating linear facilities in the plane"
+, journal =     "Oper. Res. Lett."
+, volume =      1
+, year =        1982
+, pages =       "194--197"
+, keywords =    "VLSI design, NP-completeness, points, lines, two-dimensional"
 }
 
 @article{mtzc-oaktn-81
-, author =	"N. Megiddo and A. Tamir and E. Zemel and R. Chandrasekaran"
-, title =	"An {$O(n (\log n)^{2})$} algorithm for the $k$-th nearest pair in a tree with applications to location problems"
-, journal =	"SIAM J. Comput."
-, volume =	10
-, year =	1981
-, pages =	"328--337"
-, keywords =	"complexity theory, network algorithms, optimization, searching, centroid decomposition"
+, author =      "N. Megiddo and A. Tamir and E. Zemel and R. Chandrasekaran"
+, title =       "An {$O(n (\log n)^{2})$} algorithm for the $k$-th nearest pair in a tree with applications to location problems"
+, journal =     "SIAM J. Comput."
+, volume =      10
+, year =        1981
+, pages =       "328--337"
+, keywords =    "complexity theory, network algorithms, optimization, searching, centroid decomposition"
 }
 
 @article{mz-roawe-86
-, author =	"N. Megiddo and E. Zemel"
-, title =	"A randomized {$O(n \log n)$} algorithm for the weighted {Euclidean} $1$-center problem"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"358--368"
-, keywords =	"Las Vegas, circles, proximity, weighted, worst-case analysis"
-, update =	"97.03 agarwal"
+, author =      "N. Megiddo and E. Zemel"
+, title =       "A randomized {$O(n \log n)$} algorithm for the weighted {Euclidean} $1$-center problem"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "358--368"
+, keywords =    "Las Vegas, circles, proximity, weighted, worst-case analysis"
+, update =      "97.03 agarwal"
 }
 
 @techreport{mzh-mclp-81
-, author =	"N. Megiddo and E. Zemel and S. L. Hakimi"
-, title =	"The maximum coverage location problem"
-, type =	"Discuss. {Paper}"
-, number =	490
-, institution =	"Cent. Math. Stud. Econ. Manage. Sci., North-Western Univ."
-, address =	"Evanston, IL"
-, year =	1981
+, author =      "N. Megiddo and E. Zemel and S. L. Hakimi"
+, title =       "The maximum coverage location problem"
+, type =        "Discuss. {Paper}"
+, number =      490
+, institution = "Cent. Math. Stud. Econ. Manage. Sci., North-Western Univ."
+, address =     "Evanston, IL"
+, year =        1981
 }
 
 @techreport{m-ihtpt-93
-, author =	"K. Mehlhorn"
-, title =	"An implementation of the {Hopcroft} and {Tarjan} planarity test and embedding algorithm"
-, type =	"Report"
-, number =	"MPI-I-93-151"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, update =	"94.01 smid"
+, author =      "K. Mehlhorn"
+, title =       "An implementation of the {Hopcroft} and {Tarjan} planarity test and embedding algorithm"
+, type =        "Report"
+, number =      "MPI-I-93-151"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, update =      "94.01 smid"
 }
 
 @article{m-awcdt-81
-, author =	"K. Mehlhorn"
-, title =	"Arbitrary weight changes in dynamic trees"
-, journal =	"Theoretical Informatics"
-, volume =	15
-, year =	1981
-, pages =	"183--211"
-, update =	"98.03 bibrelex"
+, author =      "K. Mehlhorn"
+, title =       "Arbitrary weight changes in dynamic trees"
+, journal =     "Theoretical Informatics"
+, volume =      15
+, year =        1981
+, pages =       "183--211"
+, update =      "98.03 bibrelex"
 }
 
 @book{m-dsass-81
-, author =	"Kurt Mehlhorn"
-, title =	"Data Structures and Algorithm 1: Sorting and Searching"
-, series =	"EATCS Monographs on Theoretical Computer Science"
-, volume =	1
-, publisher =	"Springer-Verlag"
-, address =	"Berlin/Heidelberg, Germany"
-, year =	1981
-, pages =	"68--71"
-, precedes =	"m-ss-84"
-, update =	"98.11 bibrelex"
+, author =      "Kurt Mehlhorn"
+, title =       "Data Structures and Algorithm 1: Sorting and Searching"
+, series =      "EATCS Monographs on Theoretical Computer Science"
+, volume =      1
+, publisher =   "Springer-Verlag"
+, address =     "Berlin/Heidelberg, Germany"
+, year =        1981
+, pages =       "68--71"
+, precedes =    "m-ss-84"
+, update =      "98.11 bibrelex"
 }
 
 @book{m-dsa-84
-, author =	"Kurt Mehlhorn"
-, title =	"Data Structures and Algorithms"
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg, Germany"
-, year =	1984
-, note =	"Volumes 1--3"
-, update =	"98.07 icking, 97.03 tamassia"
+, author =      "Kurt Mehlhorn"
+, title =       "Data Structures and Algorithms"
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg, Germany"
+, year =        1984
+, note =        "Volumes 1--3"
+, update =      "98.07 icking, 97.03 tamassia"
 }
 
 @book{m-ss-84
-, author =	"Kurt Mehlhorn"
-, title =	"Data Structures and Algorithms 1: Sorting and Searching"
-, series =	"EATCS Monographs on Theoretical Computer Science"
-, volume =	1
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg, Germany"
-, year =	1984
-, isbn =	"3-540-13302-X"
-, succeeds =	"m-dsass-81"
-, update =	"98.11 bibrelex, 98.07 icking"
+, author =      "Kurt Mehlhorn"
+, title =       "Data Structures and Algorithms 1: Sorting and Searching"
+, series =      "EATCS Monographs on Theoretical Computer Science"
+, volume =      1
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg, Germany"
+, year =        1984
+, isbn =        "3-540-13302-X"
+, succeeds =    "m-dsass-81"
+, update =      "98.11 bibrelex, 98.07 icking"
 }
 
 @book{m-ganc-84
-, author =	"Kurt Mehlhorn"
-, title =	"Data Structures and Algorithms 2: Graph Algorithms and {NP}-Completeness"
-, series =	"EATCS Monographs on Theoretical Computer Science"
-, volume =	2
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg, Germany"
-, year =	1984
-, isbn =	"3-540-13641-X"
-, update =	"98.07 icking"
+, author =      "Kurt Mehlhorn"
+, title =       "Data Structures and Algorithms 2: Graph Algorithms and {NP}-Completeness"
+, series =      "EATCS Monographs on Theoretical Computer Science"
+, volume =      2
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg, Germany"
+, year =        1984
+, isbn =        "3-540-13641-X"
+, update =      "98.07 icking"
 }
 
 @book{m-mdscg-84
-, author =	"Kurt Mehlhorn"
-, title =	"Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry"
-, series =	"EATCS Monographs on Theoretical Computer Science"
-, volume =	3
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg, Germany"
-, year =	1984
-, isbn =	"3-540-13642-8"
-, keywords =	"data structures,  algorithms, computational geometry, book"
-, update =	"98.07 icking, 97.11 bibrelex"
+, author =      "Kurt Mehlhorn"
+, title =       "Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry"
+, series =      "EATCS Monographs on Theoretical Computer Science"
+, volume =      3
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg, Germany"
+, year =        1984
+, isbn =        "3-540-13642-8"
+, keywords =    "data structures,  algorithms, computational geometry, book"
+, update =      "98.07 icking, 97.11 bibrelex"
 }
 
 @book{m-dea-86
-, author =	"K. Mehlhorn"
-, title =	"Datenstrukturen und effiziente Algorithmen 1"
-, publisher =	"B. G. Teubner"
-, address =	"Stuttgart, Germany"
-, year =	1986
-, update =	"98.11 bibrelex"
+, author =      "K. Mehlhorn"
+, title =       "Datenstrukturen und effiziente Algorithmen 1"
+, publisher =   "B. G. Teubner"
+, address =     "Stuttgart, Germany"
+, year =        1986
+, update =      "98.11 bibrelex"
 }
 
 @article{m-lbets-85
-, author =	"K. Mehlhorn"
-, title =	"Lower bounds on the efficiency of transforming static data structures into dynamic structures"
-, journal =	"Math. Syst. Theory"
-, volume =	15
-, year =	1985
-, pages =	"1--16"
+, author =      "K. Mehlhorn"
+, title =       "Lower bounds on the efficiency of transforming static data structures into dynamic structures"
+, journal =     "Math. Syst. Theory"
+, volume =      15
+, year =        1985
+, pages =       "1--16"
 }
 
 @inproceedings{m-pppd-96
-, author =	"K. Mehlhorn"
-, title =	"Position Paper for Panel Discussion"
-, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
-, site =	"Philadelphia, PA, USA"
-, month =	may
-, year =	1996
-, pages =	"111--112"
-, update =	"97.11 held"
+, author =      "K. Mehlhorn"
+, title =       "Position Paper for Panel Discussion"
+, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
+, site =        "Philadelphia, PA, USA"
+, month =       may
+, year =        1996
+, pages =       "111--112"
+, update =      "97.11 held"
 }
 
 @techreport{mmo-cavd-89
-, author =	"K. Mehlhorn and S. Meiser and C. {\'O}'D{\'u}nlaing"
-, title =	"On the Construction of Abstract {Voronoi} Diagrams"
-, type =	"Report"
-, number =	"A01/89"
-, institution =	"Department of Computer Science, Universit{\"a}t des Saarlandes"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1989
-, keywords =	"Voronoi diagrams, randomized algorithms"
-, precedes =	"mmo-cavd-90"
-, update =	"99.07 bibrelex"
+, author =      "K. Mehlhorn and S. Meiser and C. {\'O}'D{\'u}nlaing"
+, title =       "On the Construction of Abstract {Voronoi} Diagrams"
+, type =        "Report"
+, number =      "A01/89"
+, institution = "Department of Computer Science, Universit{\"a}t des Saarlandes"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1989
+, keywords =    "Voronoi diagrams, randomized algorithms"
+, precedes =    "mmo-cavd-90"
+, update =      "99.07 bibrelex"
 }
 
 @inproceedings{mmo-cavd-90
-, author =	"K. Mehlhorn and S. Meiser and C. {\'O}'D{\'u}nlaing"
-, title =	"On the Construction of Abstract {Voronoi} Diagrams"
-, booktitle =	"Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	415
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"227--239"
-, succeeds =	"mmo-cavd-89"
-, precedes =	"mmo-cavd-91"
-, update =	"99.07 bibrelex"
+, author =      "K. Mehlhorn and S. Meiser and C. {\'O}'D{\'u}nlaing"
+, title =       "On the Construction of Abstract {Voronoi} Diagrams"
+, booktitle =   "Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      415
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "227--239"
+, succeeds =    "mmo-cavd-89"
+, precedes =    "mmo-cavd-91"
+, update =      "99.07 bibrelex"
 }
 
 @article{mmo-cavd-91
-, author =	"K. Mehlhorn and S. Meiser and C. {\'O}'D{\'u}nlaing"
-, title =	"On the Construction of Abstract {Voronoi} Diagrams"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"211--224"
-, keywords =	"Voronoi diagrams, randomized algorithms"
-, succeeds =	"mmo-cavd-90"
-, update =	"99.07 bibrelex"
+, author =      "K. Mehlhorn and S. Meiser and C. {\'O}'D{\'u}nlaing"
+, title =       "On the Construction of Abstract {Voronoi} Diagrams"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "211--224"
+, keywords =    "Voronoi diagrams, randomized algorithms"
+, succeeds =    "mmo-cavd-90"
+, update =      "99.07 bibrelex"
 }
 
 @techreport{mmr-fsavd-92
-, author =	"K. Mehlhorn and S. Meiser and R. Rasch"
-, title =	"Furthest site abstract {Voronoi} diagrams"
-, type =	"Report"
-, number =	"MPI-I-92-135"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
+, author =      "K. Mehlhorn and S. Meiser and R. Rasch"
+, title =       "Furthest site abstract {Voronoi} diagrams"
+, type =        "Report"
+, number =      "MPI-I-92-135"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
 }
 
 @inproceedings{mmnssuz-cbhdc-97
-, author =	"K. Mehlhorn and M. M{\"u}ller and S. N{\"a}her and S. Schirra and M. Seel and C. Uhrig and J. Ziegler"
-, title =	"A computational basis for higher dimensional computational geometry and Applications"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"254--263"
-, cites =	"bdh-qach-96, blr-scanp-90, cms-frric-93, e-acg-87, e-sdrla-67, fgkss-ckbgc-96, mn-lpcgc-95, mnssssu-cgpvg-96, nu-lmum-95, mz-icha-94, s-tlip-86, y-fpaa-93, ZZZ"
-, update =	"98.07 bibrelex+tamassia+vismara, 97.07 efrat"
+, author =      "K. Mehlhorn and M. M{\"u}ller and S. N{\"a}her and S. Schirra and M. Seel and C. Uhrig and J. Ziegler"
+, title =       "A computational basis for higher dimensional computational geometry and Applications"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "254--263"
+, cites =       "bdh-qach-96, blr-scanp-90, cms-frric-93, e-acg-87, e-sdrla-67, fgkss-ckbgc-96, mn-lpcgc-95, mnssssu-cgpvg-96, nu-lmum-95, mz-icha-94, s-tlip-86, y-fpaa-93, ZZZ"
+, update =      "98.07 bibrelex+tamassia+vismara, 97.07 efrat"
 }
 
 @article{mmnssuz-cbhdc-98
-, author =	"K. Mehlhorn and M. M{\"u}ller and S. N{\"a}her and S. Schirra and M. Seel and C. Uhrig and J. Ziegler"
-, title =	"A Computational Basis for Higher-Dimensional Computational Geometry and Applications"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, number =	4
-, year =	1998
-, pages =	"289--303"
-, succeeds =	"mmnssuz-cbhdc-97"
-, update =	"98.11 devillers+vismara"
+, author =      "K. Mehlhorn and M. M{\"u}ller and S. N{\"a}her and S. Schirra and M. Seel and C. Uhrig and J. Ziegler"
+, title =       "A Computational Basis for Higher-Dimensional Computational Geometry and Applications"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, number =      4
+, year =        1998
+, pages =       "289--303"
+, succeeds =    "mmnssuz-cbhdc-97"
+, update =      "98.11 devillers+vismara"
 }
 
 @inproceedings{mn-adslr-92
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
-, title =	"Algorithm design and software libraries: Recent developments in the {LEDA} project"
-, booktitle =	"Algorithms, Software, Architectures, Information Processing 92"
-, volume =	1
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	1992
-, pages =	"493--505"
-, update =	"00.11 smid, 00.07 icking, 97.11 bibrelex"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her"
+, title =       "Algorithm design and software libraries: Recent developments in the {LEDA} project"
+, booktitle =   "Algorithms, Software, Architectures, Information Processing 92"
+, volume =      1
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        1992
+, pages =       "493--505"
+, update =      "00.11 smid, 00.07 icking, 97.11 bibrelex"
 }
 
 @article{mn-bodot-90
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
-, title =	"Bounded ordered dictionaries in {$O(\log\log n)$} time and {$O(n)$} space"
-, journal =	"Inform. Process. Lett."
-, volume =	35
-, year =	1990
-, pages =	"183--189"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her"
+, title =       "Bounded ordered dictionaries in {$O(\log\log n)$} time and {$O(n)$} space"
+, journal =     "Inform. Process. Lett."
+, volume =      35
+, year =        1990
+, pages =       "183--189"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @manual{mn-cgs-96
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
-, title =	"Checking Geometric Structures"
-, month =	dec
-, year =	1996
-, note =	"Program Documentation"
-, update =	"00.11 smid, 00.07 icking, 98.11 tamassia, 97.03 tamassia"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her"
+, title =       "Checking Geometric Structures"
+, month =       dec
+, year =        1996
+, note =        "Program Documentation"
+, update =      "00.11 smid, 00.07 icking, 98.11 tamassia, 97.03 tamassia"
 }
 
 @techreport{mn-dfc-86
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
-, title =	"Dynamic fractional cascading"
-, type =	"Technical {Report}"
-, number =	"??"
-, institution =	"Fachber. Inform., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1986
-, precedes =	"mn-dfc-90"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her"
+, title =       "Dynamic fractional cascading"
+, type =        "Technical {Report}"
+, number =      "??"
+, institution = "Fachber. Inform., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1986
+, precedes =    "mn-dfc-90"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @article{mn-dfc-90
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
-, title =	"Dynamic fractional cascading"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"215--241"
-, succeeds =	"mn-dfc-86"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her"
+, title =       "Dynamic fractional cascading"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "215--241"
+, succeeds =    "mn-dfc-86"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @techreport{mn-islas-94
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
-, title =	"Implementation of a sweep line algorithm for the straight line segment intersection problem"
-, type =	"Report"
-, number =	"MPI-I-94-160"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, update =	"00.11 smid, 00.07 icking, 95.01 smid"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her"
+, title =       "Implementation of a sweep line algorithm for the straight line segment intersection problem"
+, type =        "Report"
+, number =      "MPI-I-94-160"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, update =      "00.11 smid, 00.07 icking, 95.01 smid"
 }
 
 @techreport{mn-lledt-89
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
-, title =	"{LEDA}, a library of efficient data types and algorithms"
-, type =	"Report"
-, number =	"A 04/89"
-, institution =	"Fachber. Inform., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1989
-, comments =	"revisions published in MFCS '89 and ICALP '90"
-, precedes =	"mn-lledt-89a"
-, update =	"00.11 smid, 00.07 icking, 98.11 bibrelex, 93.05 jones"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her"
+, title =       "{LEDA}, a library of efficient data types and algorithms"
+, type =        "Report"
+, number =      "A 04/89"
+, institution = "Fachber. Inform., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1989
+, comments =    "revisions published in MFCS '89 and ICALP '90"
+, precedes =    "mn-lledt-89a"
+, update =      "00.11 smid, 00.07 icking, 98.11 bibrelex, 93.05 jones"
 }
 
 @incollection{mn-lledt-89a
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
-, title =	"{LEDA}, a library of efficient data types and algorithms"
-, booktitle =	"Proc. 14th Internat. Sympos. Math. Found. Comput. Sci."
-, nickname =	"MFCS '89"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	379
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"88--106"
-, succeeds =	"mn-lledt-89"
-, update =	"00.11 smid, 00.07 icking, 00.03 smid, 98.11 bibrelex"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her"
+, title =       "{LEDA}, a library of efficient data types and algorithms"
+, booktitle =   "Proc. 14th Internat. Sympos. Math. Found. Comput. Sci."
+, nickname =    "MFCS '89"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      379
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "88--106"
+, succeeds =    "mn-lledt-89"
+, update =      "00.11 smid, 00.07 icking, 00.03 smid, 98.11 bibrelex"
 }
 
 @article{mn-lpcgc-95
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
-, title =	"{LEDA}: a platform for combinatorial and geometric computing"
-, journal =	"Commun. ACM"
-, volume =	38
-, number =	1
-, year =	1995
-, pages =	"96--102"
-, url =	"http://www.mpi-sb.mpg.de/guide/staff/uhrig/leda.html"
-, update =	"00.11 smid, 00.07 icking, 98.07 tamassia, 96.09 devillers, 96.01 tamassia"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her"
+, title =       "{LEDA}: a platform for combinatorial and geometric computing"
+, journal =     "Commun. ACM"
+, volume =      38
+, number =      1
+, year =        1995
+, pages =       "96--102"
+, url = "http://www.mpi-sb.mpg.de/guide/staff/uhrig/leda.html"
+, update =      "00.11 smid, 00.07 icking, 98.07 tamassia, 96.09 devillers, 96.01 tamassia"
 }
 
 @book{mn-lpcgc-00
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
-, title =	"{LEDA}: A Platform for Combinatorial and Geometric Computing"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge, UK"
-, year =	2000
-, update =	"00.11 smid, 00.07 icking, 00.03 orourke+smid+vismara, 98.07 orourke"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her"
+, title =       "{LEDA}: A Platform for Combinatorial and Geometric Computing"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge, UK"
+, year =        2000
+, update =      "00.11 smid, 00.07 icking, 00.03 orourke+smid+vismara, 98.07 orourke"
 }
 
 @inproceedings{mn-iga-94
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her"
-, title =	"The Implementation of Geometric Algorithms"
-, booktitle =	"Proc. 13th World Computer Congress IFIP94"
-, volume =	1
-, year =	1994
-, pages =	"223--231"
-, update =	"00.11 smid, 00.07 icking, 97.03 devillers"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her"
+, title =       "The Implementation of Geometric Algorithms"
+, booktitle =   "Proc. 13th World Computer Congress IFIP94"
+, volume =      1
+, year =        1994
+, pages =       "223--231"
+, update =      "00.11 smid, 00.07 icking, 97.03 devillers"
 }
 
 @techreport{mna-lbcus-86
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her and Helmut Alt"
-, title =	"A lower bound for the complexity of the union-split-find problem"
-, type =	"Technical {Report}"
-, number =	"??"
-, institution =	"Fachber. Inform., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1986
-, precedes =	"mna-lbcus-88"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her and Helmut Alt"
+, title =       "A lower bound for the complexity of the union-split-find problem"
+, type =        "Technical {Report}"
+, number =      "??"
+, institution = "Fachber. Inform., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1986
+, precedes =    "mna-lbcus-88"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @article{mna-lbcus-88
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her and Helmut Alt"
-, title =	"A lower bound on the complexity of the union-split-find problem"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, year =	1988
-, pages =	"1093--1102"
-, succeeds =	"mna-lbcus-86"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her and Helmut Alt"
+, title =       "A lower bound on the complexity of the union-split-find problem"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, year =        1988
+, pages =       "1093--1102"
+, succeeds =    "mna-lbcus-86"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{mnssssu-cgpvg-96
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her and Thomas Schilz and Stefan Schirra and Michael Seel and Raimund Seidel and Christian Uhrig"
-, title =	"Checking Geometric Programs or Verification of Geometric Structures"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"159--165"
-, cites =	"as-rst-89, abs-hgach-97, bk-ptctw-89, blr-scanp-90, bms-dgc-94, cs-arscg-89, cms-frric-93, egs-oplms-86, k-osps-83, m-dsa-84, mn-adslr-92, mn-lpcgc-95, mz-icha-94, nu-lmum-95, r-dcptr-94, st-pplup-86, s-chdch-86, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her and Thomas Schilz and Stefan Schirra and Michael Seel and Raimund Seidel and Christian Uhrig"
+, title =       "Checking Geometric Programs or Verification of Geometric Structures"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "159--165"
+, cites =       "as-rst-89, abs-hgach-97, bk-ptctw-89, blr-scanp-90, bms-dgc-94, cs-arscg-89, cms-frric-93, egs-oplms-86, k-osps-83, m-dsa-84, mn-adslr-92, mn-lpcgc-95, mz-icha-94, nu-lmum-95, r-dcptr-94, st-pplup-86, s-chdch-86, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @unpublished{mnssssu-cgpvg-97
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her and Thomas Schilz and Stefan Schirra and Michael Seel and Raimund Seidel and Christian Uhrig"
-, title =	"Checking Geometric Programs or Verification of Geometric Structures"
-, year =	1997
-, note =	"Manuscript"
-, update =	"97.11 bibrelex, 97.03 tamassia"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her and Thomas Schilz and Stefan Schirra and Michael Seel and Raimund Seidel and Christian Uhrig"
+, title =       "Checking Geometric Programs or Verification of Geometric Structures"
+, year =        1997
+, note =        "Manuscript"
+, update =      "97.11 bibrelex, 97.03 tamassia"
 }
 
 @techreport{mnssu-acbhd-96
-, author =	"K. Mehlhorn and S. N{\"a}her and S. Schirra and M. Seel and C. Uhrig"
-, title =	"A computational basis for higher-dimensional computational geometry"
-, type =	"Report"
-, number =	"MPI-I-96-1-016"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1996
-, update =	"96.09 smid"
+, author =      "K. Mehlhorn and S. N{\"a}her and S. Schirra and M. Seel and C. Uhrig"
+, title =       "A computational basis for higher-dimensional computational geometry"
+, type =        "Report"
+, number =      "MPI-I-96-1-016"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1996
+, update =      "96.09 smid"
 }
 
 @article{mnssssu-cgpvg-99
-, author =	"K. Mehlhorn and S. N{\"a}her and M. Seel and R. Seidel and T. Schilz and S. Schirra and C. Uhrig"
-, title =	"Checking Geometric Programs or Verification of Geometric Structures"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	12
-, number =	"1--2"
-, year =	1999
-, pages =	"85--103"
-, succeeds =	"mnssssu-cgpvg-96"
-, update =	"99.07 smid+vismara"
+, author =      "K. Mehlhorn and S. N{\"a}her and M. Seel and R. Seidel and T. Schilz and S. Schirra and C. Uhrig"
+, title =       "Checking Geometric Programs or Verification of Geometric Structures"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      12
+, number =      "1--2"
+, year =        1999
+, pages =       "85--103"
+, succeeds =    "mnssssu-cgpvg-96"
+, update =      "99.07 smid+vismara"
 }
 
 @article{mnu-hleir-90
-, author =	"K. Mehlhorn and S. N{\"a}her and C. Uhrig"
-, title =	"Hidden line elimination for isooriented rectangles"
-, journal =	"Inform. Process. Lett."
-, volume =	35
-, year =	1990
-, pages =	"137--143"
+, author =      "K. Mehlhorn and S. N{\"a}her and C. Uhrig"
+, title =       "Hidden line elimination for isooriented rectangles"
+, journal =     "Inform. Process. Lett."
+, volume =      35
+, year =        1990
+, pages =       "137--143"
 }
 
 @inproceedings{mnu-lpcgc-97
-, author =	"Kurt Mehlhorn and Stefan N{\"a}her and Christian Uhrig"
-, title =	"The {LEDA} Platform for Combinatorial and Geometric Computing"
-, editor =	"P. Degano and R. Gorrieri and A. Marchetti-Spaccamela"
-, booktitle =	"Automata, Languages and Programming (Proc. ICALP~'97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1256
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"7--16"
-, update =	"98.07 tamassia+vismara"
+, author =      "Kurt Mehlhorn and Stefan N{\"a}her and Christian Uhrig"
+, title =       "The {LEDA} Platform for Combinatorial and Geometric Computing"
+, editor =      "P. Degano and R. Gorrieri and A. Marchetti-Spaccamela"
+, booktitle =   "Automata, Languages and Programming (Proc. ICALP~'97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1256
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "7--16"
+, update =      "98.07 tamassia+vismara"
 }
 
 @article{mo-oddsp-81
-, author =	"K. Mehlhorn and M. H. Overmars"
-, title =	"Optimal dynamization of decomposable searching problems"
-, journal =	"Inform. Process. Lett."
-, volume =	12
-, year =	1981
-, pages =	"93--98"
+, author =      "K. Mehlhorn and M. H. Overmars"
+, title =       "Optimal dynamization of decomposable searching problems"
+, journal =     "Inform. Process. Lett."
+, volume =      12
+, year =        1981
+, pages =       "93--98"
 }
 
 @article{mp-rtr-86
-, author =	"K. Mehlhorn and F. P. Preparata"
-, title =	"Routing through a rectangle"
-, journal =	"J. ACM"
-, volume =	33
-, year =	1986
-, pages =	"60--85"
+, author =      "K. Mehlhorn and F. P. Preparata"
+, title =       "Routing through a rectangle"
+, journal =     "J. ACM"
+, volume =      33
+, year =        1986
+, pages =       "60--85"
 }
 
 @article{mps-crkkm-86
-, author =	"K. Mehlhorn and F. P. Preparata and M. Sarrafzadeh"
-, title =	"Channel routing in knock-knee mode: {Simplified} algorithms and proofs"
-, journal =	"Algorithmica"
-, volume =	1
-, year =	1986
-, pages =	"213--221"
-, update =	"98.03 bibrelex"
+, author =      "K. Mehlhorn and F. P. Preparata and M. Sarrafzadeh"
+, title =       "Channel routing in knock-knee mode: {Simplified} algorithms and proofs"
+, journal =     "Algorithmica"
+, volume =      1
+, year =        1986
+, pages =       "213--221"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ms-iftml-01
-, author =	"Kurt Mehlhorn and Michael Seel"
-, title =	"Infimaximal Frames: A Technique for Making Lines Look Like Segments"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"78--81"
-, update =	"01.04 icking"
+, author =      "Kurt Mehlhorn and Michael Seel"
+, title =       "Infimaximal Frames: A Technique for Making Lines Look Like Segments"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "78--81"
+, update =      "01.04 icking"
 }
 
 @techreport{msw-teeri-93t
-, author =	"K. Mehlhorn and Micha Sharir and Emo Welzl"
-, title =	"Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection"
-, type =	"Report"
-, number =	"MPI-I-93-103"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, succeeds =	"msw-tescr-92"
-, precedes =	"msw-teeri-93a"
-, update =	"98.03 mitchell, 94.01 smid, 93.05 smid"
+, author =      "K. Mehlhorn and Micha Sharir and Emo Welzl"
+, title =       "Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection"
+, type =        "Report"
+, number =      "MPI-I-93-103"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, succeeds =    "msw-tescr-92"
+, precedes =    "msw-teeri-93a"
+, update =      "98.03 mitchell, 94.01 smid, 93.05 smid"
 }
 
 @article{msw-teeri-93a
-, author =	"K. Mehlhorn and Micha Sharir and Emo Welzl"
-, title =	"Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"235--246"
-, succeeds =	"msw-teeri-93t"
-, update =	"98.03 mitchell, 94.01 smid"
+, author =      "K. Mehlhorn and Micha Sharir and Emo Welzl"
+, title =       "Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "235--246"
+, succeeds =    "msw-teeri-93t"
+, update =      "98.03 mitchell, 94.01 smid"
 }
 
 @techreport{msw-tescr-91
-, author =	"K. Mehlhorn and Micha Sharir and Emo Welzl"
-, title =	"Tail estimates for the space complexity of randomized incremental algorithms"
-, type =	"Report"
-, number =	"MPI-I-91-113"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1991
-, precedes =	"msw-tescr-92"
-, update =	"98.03 mitchell"
+, author =      "K. Mehlhorn and Micha Sharir and Emo Welzl"
+, title =       "Tail estimates for the space complexity of randomized incremental algorithms"
+, type =        "Report"
+, number =      "MPI-I-91-113"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1991
+, precedes =    "msw-tescr-92"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{msw-tescr-92
-, author =	"K. Mehlhorn and Micha Sharir and Emo Welzl"
-, title =	"Tail estimates for the space complexity of randomized incremental algorithms"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"89--93"
-, succeeds =	"msw-tescr-91"
-, precedes =	"msw-tescr-93"
-, update =	"98.03 mitchell, 97.11 bibrelex, 93.05 smid"
+, author =      "K. Mehlhorn and Micha Sharir and Emo Welzl"
+, title =       "Tail estimates for the space complexity of randomized incremental algorithms"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "89--93"
+, succeeds =    "msw-tescr-91"
+, precedes =    "msw-tescr-93"
+, update =      "98.03 mitchell, 97.11 bibrelex, 93.05 smid"
 }
 
 @article{msw-tescr-93
-, author =	"K. Mehlhorn and Micha Sharir and Emo Welzl"
-, title =	"Tail Estimates for the Space Complexity of Randomized Incremental Algorithms"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1993
-, pages =	"185--246"
-, update =	"98.03 mitchell, 97.03 gaertner+salinger"
+, author =      "K. Mehlhorn and Micha Sharir and Emo Welzl"
+, title =       "Tail Estimates for the Space Complexity of Randomized Incremental Algorithms"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1993
+, pages =       "185--246"
+, update =      "98.03 mitchell, 97.03 gaertner+salinger"
 }
 
 @inproceedings{msy-crcp-97
-, author =	"K. Mehlhorn and T. Shermer and C. Yap"
-, title =	"A Complete Roundness Classification Procedure"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"129--138"
-, cites =	"cy-sp-87, dgr-eaoac-97, efnn-rauvd-89, fh-rcgtt-91, f-gta-92, gr-fspc-97, ll-orpr-91, pbc-muccm-93, rlw-rdtrp-91, rz-epccm-92, sj-wrspp-94, sv-dtm-93, s-oardc-93, y-ecgtm-95, yc-imgt-96, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "K. Mehlhorn and T. Shermer and C. Yap"
+, title =       "A Complete Roundness Classification Procedure"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "129--138"
+, cites =       "cy-sp-87, dgr-eaoac-97, efnn-rauvd-89, fh-rcgtt-91, f-gta-92, gr-fspc-97, ll-orpr-91, pbc-muccm-93, rlw-rdtrp-91, rz-epccm-92, sj-wrspp-94, sv-dtm-93, s-oardc-93, y-ecgtm-95, yc-imgt-96, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{ms-itpow-85
-, author =	"K. Mehlhorn and K. Simon"
-, title =	"Intersecting two polyhedra one of which is convex"
-, editor =	"L. Budach"
-, booktitle =	"Proc. Found. Comput. Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	199
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"534--542"
+, author =      "K. Mehlhorn and K. Simon"
+, title =       "Intersecting two polyhedra one of which is convex"
+, editor =      "L. Budach"
+, booktitle =   "Proc. Found. Comput. Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      199
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "534--542"
 }
 
 @incollection{mt-ds-90
-, author =	"K. Mehlhorn and A. Tsakalidis"
-, title =	"Data Structures"
-, editor =	"J. van Leeuwen"
-, booktitle =	"Algorithms and Complexity"
-, series =	"Handbook of Theoretical Computer Science"
-, volume =	"A"
-, publisher =	"Elsevier"
-, address =	"Amsterdam"
-, year =	1990
-, pages =	"303--334"
-, keywords =	"dictionary problem, persistence, union-split-find problem, priority queues, nearest common ancestors, selection, merging, dynamization techniques, survey paper"
-, update =	"97.03 pocchiola+tamassia"
+, author =      "K. Mehlhorn and A. Tsakalidis"
+, title =       "Data Structures"
+, editor =      "J. van Leeuwen"
+, booktitle =   "Algorithms and Complexity"
+, series =      "Handbook of Theoretical Computer Science"
+, volume =      "A"
+, publisher =   "Elsevier"
+, address =     "Amsterdam"
+, year =        1990
+, pages =       "303--334"
+, keywords =    "dictionary problem, persistence, union-split-find problem, priority queues, nearest common ancestors, selection, merging, dynamization techniques, survey paper"
+, update =      "97.03 pocchiola+tamassia"
 }
 
 @article{mv-rdspp-84
-, author =	"K. Mehlhorn and U. Vishkin"
-, title =	"Randomized and deterministic simulations of {PRAM}s by parallel machines with restricted granularity of parallel memories"
-, journal =	"Acta Inform."
-, volume =	9
-, number =	1
-, year =	1984
-, pages =	"29--59"
-, update =	"96.09 orourke"
+, author =      "K. Mehlhorn and U. Vishkin"
+, title =       "Randomized and deterministic simulations of {PRAM}s by parallel machines with restricted granularity of parallel memories"
+, journal =     "Acta Inform."
+, volume =      9
+, number =      1
+, year =        1984
+, pages =       "29--59"
+, update =      "96.09 orourke"
 }
 
 @article{my-cwgth-91
-, author =	"K. Mehlhorn and C. Yap"
-, title =	"Constructive {Whitney}-{Graustein} theorem, or how to untangle closed planar curves"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"603--621"
+, author =      "K. Mehlhorn and C. Yap"
+, title =       "Constructive {Whitney}-{Graustein} theorem, or how to untangle closed planar curves"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "603--621"
 }
 
 @inproceedings{my-chthu-88
-, author =	"K. Mehlhorn and C. K. Yap"
-, title =	"Constructive {Hopf}'s theorem: or how to untangle closed planar curves"
-, booktitle =	"Proc. 15 Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	317
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"410--423"
-, update =	"97.11 bibrelex"
+, author =      "K. Mehlhorn and C. K. Yap"
+, title =       "Constructive {Hopf}'s theorem: or how to untangle closed planar curves"
+, booktitle =   "Proc. 15 Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      317
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "410--423"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{mg-fbrss-93
-, author =	"H. Mehrotra and J. E. Gary"
-, title =	"Feature-based retrieval of similar shapes"
-, booktitle =	"Proc. 9th IEEE Intl. Conf. on Data Engineering"
-, year =	1996
-, pages =	"108--115"
-, update =	"97.07 agarwal"
+, author =      "H. Mehrotra and J. E. Gary"
+, title =       "Feature-based retrieval of similar shapes"
+, booktitle =   "Proc. 9th IEEE Intl. Conf. on Data Engineering"
+, year =        1996
+, pages =       "108--115"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{mmn-cia2d-90
-, author =	"S. Mehta and M. Mukherjee and G. Nagy"
-, title =	"Constrained integer approximation to $2$-d line intersections"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"302--305"
-, cites =	"ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. Mehta and M. Mukherjee and G. Nagy"
+, title =       "Constrained integer approximation to $2$-d line intersections"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "302--305"
+, cites =       "ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{mi-rnsue-94
-, author =	"Aohan Mei and Yoshihide Igarashi"
-, title =	"A Robot Navigation Strategy in Unknown Environment and its Efficiency"
-, journal =	"IEICE Trans. Fundamentals Electronics, Comm. and Comput. Sci."
-, volume =	"E77-A"
-, number =	7
-, month =	jul
-, year =	1994
-, pages =	"1157--1162"
-, keywords =	"competitive analysis, shortest paths, on-line navigation"
-, update =	"98.03 mitchell"
+, author =      "Aohan Mei and Yoshihide Igarashi"
+, title =       "A Robot Navigation Strategy in Unknown Environment and its Efficiency"
+, journal =     "IEICE Trans. Fundamentals Electronics, Comm. and Comput. Sci."
+, volume =      "E77-A"
+, number =      7
+, month =       jul
+, year =        1994
+, pages =       "1157--1162"
+, keywords =    "competitive analysis, shortest paths, on-line navigation"
+, update =      "98.03 mitchell"
 }
 
 @article{mi-esrnu-94
-, author =	"Aohan Mei and Yoshihide Igarashi"
-, title =	"An Efficient Strategy for Robot Navigation in Unknown Environment"
-, journal =	"Inform. Process. Lett."
-, volume =	52
-, year =	1994
-, pages =	"51--56"
-, keywords =	"competitive analysis, shortest paths, on-line navigation"
-, precedes =	"mi-esrnu-94a"
-, update =	"98.07 icking, 98.03 mitchell"
+, author =      "Aohan Mei and Yoshihide Igarashi"
+, title =       "An Efficient Strategy for Robot Navigation in Unknown Environment"
+, journal =     "Inform. Process. Lett."
+, volume =      52
+, year =        1994
+, pages =       "51--56"
+, keywords =    "competitive analysis, shortest paths, on-line navigation"
+, precedes =    "mi-esrnu-94a"
+, update =      "98.07 icking, 98.03 mitchell"
 }
 
 @inproceedings{mi-esrnu-94a
-, author =	"Aohan Mei and Yoshihide Igarashi"
-, title =	"Efficient Strategies for Robot Navigation in Unknown Environment"
-, booktitle =	"Proc. 21st Internat. Colloq. Automata Lang. Prog."
-, nickname =	"ICALP '94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	820
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"630--641"
-, succeeds =	"mi-esrnu-94"
-, update =	"98.07 icking"
+, author =      "Aohan Mei and Yoshihide Igarashi"
+, title =       "Efficient Strategies for Robot Navigation in Unknown Environment"
+, booktitle =   "Proc. 21st Internat. Colloq. Automata Lang. Prog."
+, nickname =    "ICALP '94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      820
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "630--641"
+, succeeds =    "mi-esrnu-94"
+, update =      "98.07 icking"
 }
 
 @inproceedings{m-ardts-85
-, author =	"A. Meier"
-, title =	"Applying relational database techniques to solid modeling"
-, booktitle =	"Proc. GI Conf. Database Syst. for Auto. Eng. and Sci. Applic."
-, site =	"Karlsruhe, West Germany"
-, year =	1985
-, pages =	"??"
-, update =	"94.05 devillers"
+, author =      "A. Meier"
+, title =       "Applying relational database techniques to solid modeling"
+, booktitle =   "Proc. GI Conf. Database Syst. for Auto. Eng. and Sci. Applic."
+, site =        "Karlsruhe, West Germany"
+, year =        1985
+, pages =       "??"
+, update =      "94.05 devillers"
 }
 
 @inproceedings{mr-cmwts-91
-, author =	"H. Meijer and D. Rappaport"
-, title =	"Computing the minimum weight triangulation of a set of linearly ordered points"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"175--178"
-, cites =	"a-pmwt-90, gj-cigtn-79, g-nrpt-79, k-ndot-80, k-mtpd-80, l-olbng-87, l-gdtan-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "H. Meijer and D. Rappaport"
+, title =       "Computing the minimum weight triangulation of a set of linearly ordered points"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "175--178"
+, cites =       "a-pmwt-90, gj-cigtn-79, g-nrpt-79, k-ndot-80, k-mtpd-80, l-olbng-87, l-gdtan-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{mr-mpcpl-90
-, author =	"H. Meijer and D. Rappaport"
-, title =	"Minimum polygon covers of parallel line segments"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"324--327"
-, cites =	"cr-wim-41, gs-spscp-89, lmr-mpcil-90, t-p4-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "H. Meijer and D. Rappaport"
+, title =       "Minimum polygon covers of parallel line segments"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "324--327"
+, cites =       "cr-wim-41, gs-spscp-89, lmr-mpcil-90, t-p4-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{mr-ulbnm-90
-, author =	"H. Meijer and D. Rappaport"
-, title =	"Upper and lower bounds for the number of monotone crossing free {Hamiltonian} cycles from a set of points"
-, journal =	"Ars Combin."
-, volume =	30
-, year =	1990
-, pages =	"203--208"
-, update =	"98.07 bibrelex"
+, author =      "H. Meijer and D. Rappaport"
+, title =       "Upper and lower bounds for the number of monotone crossing free {Hamiltonian} cycles from a set of points"
+, journal =     "Ars Combin."
+, volume =      30
+, year =        1990
+, pages =       "203--208"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ms-rpxr-93
-, author =	"H. Meijer and S. Skiena"
-, title =	"Reconstructing polygons from x-rays"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"381--386"
-, precedes =	"ms-rpxr-96"
-, cites =	"by-psncp-89, cy-sp-87, es-pcpxr-88, f-hxpsm-83, f-xpps-83, g-sxpcb-83, g-xrp-92, gg-sdvpx-92, gm-hxp-80, g-beess-62, h-p2-63, h-irpfc-80, h-sict-83, l-rpp-88, lb-rpscu-91, n-rpoca-88, r-bfigm-17, rsfl-sudp-91, sk-ctnmx-78, s-gp-88, s-ckpps-90, s-irgp-92, ssw-pmapr-77, v-tpshp-86, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
+, author =      "H. Meijer and S. Skiena"
+, title =       "Reconstructing polygons from x-rays"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "381--386"
+, precedes =    "ms-rpxr-96"
+, cites =       "by-psncp-89, cy-sp-87, es-pcpxr-88, f-hxpsm-83, f-xpps-83, g-sxpcb-83, g-xrp-92, gg-sdvpx-92, gm-hxp-80, g-beess-62, h-p2-63, h-irpfc-80, h-sict-83, l-rpp-88, lb-rpscu-91, n-rpoca-88, r-bfigm-17, rsfl-sudp-91, sk-ctnmx-78, s-gp-88, s-ckpps-90, s-irgp-92, ssw-pmapr-77, v-tpshp-86, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @article{ms-rpxr-96
-, author =	"H. Meijer and S. Skiena"
-, title =	"Reconstructing polygons from x-rays"
-, journal =	"Geom. Dedicata"
-, volume =	61
-, year =	1996
-, pages =	"191--204"
-, succeeds =	"ms-rpxr-93"
-, update =	"98.03 mitchell"
+, author =      "H. Meijer and S. Skiena"
+, title =       "Reconstructing polygons from x-rays"
+, journal =     "Geom. Dedicata"
+, volume =      61
+, year =        1996
+, pages =       "191--204"
+, succeeds =    "ms-rpxr-93"
+, update =      "98.03 mitchell"
 }
 
 @techreport{m-iaeln-53
-, author =	"J. L. Meijering"
-, title =	"Interface area, edge length, and number of vertices in crystal aggregates with random nucleation"
-, type =	"Research {Report}"
-, number =	8
-, institution =	"Philips"
-, year =	1953
-, pages =	"270--290"
+, author =      "J. L. Meijering"
+, title =       "Interface area, edge length, and number of vertices in crystal aggregates with random nucleation"
+, type =        "Research {Report}"
+, number =      8
+, institution = "Philips"
+, year =        1953
+, pages =       "270--290"
 }
 
 @book{mbmv-iugis-94
-, author =	"A. M. J. Meijerink and H. A. M. de Brouwer and C. M. Mannaerts and C. R. Valenzuela"
-, title =	"Introduction to the Use of Geographic Information Systems for Practical Hydrology"
-, series =	"ITC Publications"
-, number =	23
-, publisher =	"ITC"
-, address =	"Enschede"
-, year =	1994
-, update =	"96.09 kreveld"
+, author =      "A. M. J. Meijerink and H. A. M. de Brouwer and C. M. Mannaerts and C. R. Valenzuela"
+, title =       "Introduction to the Use of Geographic Information Systems for Practical Hydrology"
+, series =      "ITC Publications"
+, number =      23
+, publisher =   "ITC"
+, address =     "Enschede"
+, year =        1994
+, update =      "96.09 kreveld"
 }
 
 @article{m-gpinn-87
-, author =	"A. Meir"
-, title =	"A geometric problem involving the nearest neighbor algorithms"
-, journal =	"Oper. Res. Lett."
-, volume =	6
-, year =	1987
-, pages =	"289--291"
-, update =	"97.11 bibrelex"
+, author =      "A. Meir"
+, title =       "A geometric problem involving the nearest neighbor algorithms"
+, journal =     "Oper. Res. Lett."
+, volume =      6
+, year =        1987
+, pages =       "289--291"
+, update =      "97.11 bibrelex"
 }
 
 @article{mm-anrt-78
-, author =	"A. Meir and J. W. Moon"
-, title =	"On the altitude of nodes in random trees"
-, journal =	"Cand. J. Math."
-, volume =	30
-, year =	1978
-, pages =	"997--1015"
-, update =	"97.11 bibrelex"
+, author =      "A. Meir and J. W. Moon"
+, title =       "On the altitude of nodes in random trees"
+, journal =     "Cand. J. Math."
+, volume =      30
+, year =        1978
+, pages =       "997--1015"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{m-cavd-89
-, author =	"S. Meiser"
-, title =	"On the Construction of Abstract {Voronoi} Diagrams"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "S. Meiser"
+, title =       "On the Construction of Abstract {Voronoi} Diagrams"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{m-pla-88
-, author =	"S. Meiser"
-, title =	"Point location in arrangements"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"71--84"
-, succeeds =	"m-seavh-88"
-, precedes =	"m-plah-93"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 94.01 smid"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "S. Meiser"
+, title =       "Point location in arrangements"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "71--84"
+, succeeds =    "m-seavh-88"
+, precedes =    "m-plah-93"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 94.01 smid"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @article{m-plah-93
-, author =	"S. Meiser"
-, title =	"Point location in arrangements of hyperplanes"
-, journal =	"Inform. Comput."
-, volume =	106
-, year =	1993
-, pages =	"286--303"
-, succeeds =	"m-pla-88"
-, update =	"94.01 smid"
+, author =      "S. Meiser"
+, title =       "Point location in arrangements of hyperplanes"
+, journal =     "Inform. Comput."
+, volume =      106
+, year =        1993
+, pages =       "286--303"
+, succeeds =    "m-pla-88"
+, update =      "94.01 smid"
 }
 
 @techreport{m-seavh-88
-, author =	"S. Meiser"
-, title =	"Suche in einem {Arrangement} von {Hyperebenen}"
-, type =	"Report"
-, number =	"??"
-, institution =	"Fachber. Inform., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1988
-, precedes =	"m-pla-88"
+, author =      "S. Meiser"
+, title =       "Suche in einem {Arrangement} von {Hyperebenen}"
+, type =        "Report"
+, number =      "??"
+, institution = "Fachber. Inform., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1988
+, precedes =    "m-pla-88"
 }
 
 @phdthesis{m-zkav-93
-, author =	"S. Meiser"
-, title =	"Zur {Konstruktion} abstrakter {Voronoidiagramme}"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"93.05 smid"
+, author =      "S. Meiser"
+, title =       "Zur {Konstruktion} abstrakter {Voronoidiagramme}"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "93.05 smid"
 }
 
 @article{m-phe-75
-, author =	"G. Meisters"
-, title =	"Polygons have ears"
-, journal =	"Amer. Math. Monthly"
-, volume =	82
-, year =	1975
-, pages =	"648--651"
-, keywords =	"two-dimensional, triangles, polygon triangulation"
+, author =      "G. Meisters"
+, title =       "Polygons have ears"
+, journal =     "Amer. Math. Monthly"
+, volume =      82
+, year =        1975
+, pages =       "648--651"
+, keywords =    "two-dimensional, triangles, polygon triangulation"
 }
 
 @inproceedings{ms-cinap-92
-, author =	"E. A. Melissaratos and D. L. Souvaine"
-, title =	"Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"202--211"
-, succeeds =	"ms-cinap-91"
-, cites =	"bgr-ntp-88, b-pug-90, beg-pgmg-90, be-psntp-91, be-mgot-92i, ceghss-sdash-90, c-cdt-87, c-gqtm-89, etw-otama-90, ff-mrnti-, f-cfemg-72, j-fetcr-84, lg-gcvfm-85, ll-gdtpg-86, ms-cinap-91, s-qrhds-84, s-dasds-90, sf-afem-73, s-aagcf-88, t-brtgi-80, ys-mqafe-83, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "E. A. Melissaratos and D. L. Souvaine"
+, title =       "Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "202--211"
+, succeeds =    "ms-cinap-91"
+, cites =       "bgr-ntp-88, b-pug-90, beg-pgmg-90, be-psntp-91, be-mgot-92i, ceghss-sdash-90, c-cdt-87, c-gqtm-89, etw-otama-90, ff-mrnti-, f-cfemg-72, j-fetcr-84, lg-gcvfm-85, ll-gdtpg-86, ms-cinap-91, s-qrhds-84, s-dasds-90, sf-afem-73, s-aagcf-88, t-brtgi-80, ys-mqafe-83, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ms-cinap-91
-, author =	"E. A. Melissaratos and D. L. Souvaine"
-, title =	"Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes for the finite element method"
-, type =	"Report"
-, number =	"LCSR-TR-163"
-, institution =	"Lab. Comput. Sci. Res., Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1991
-, keywords =	"mesh generation, aspect ratio, quality triangulation, finite element method"
-, precedes =	"ms-cinap-92"
+, author =      "E. A. Melissaratos and D. L. Souvaine"
+, title =       "Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes for the finite element method"
+, type =        "Report"
+, number =      "LCSR-TR-163"
+, institution = "Lab. Comput. Sci. Res., Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1991
+, keywords =    "mesh generation, aspect ratio, quality triangulation, finite element method"
+, precedes =    "ms-cinap-92"
 }
 
 @inproceedings{ms-sgopu-90
-, author =	"E. A. Melissaratos and D. L. Souvaine"
-, title =	"On solving geometric optimization problems using shortest paths"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"350--359"
-, precedes =	"ms-sphsg-90"
-, cites =	"a-lncg-88, acy-macp-85, akmsw-gamsa-87, ap-nsmma-88, bddg-fep-85, cy-psppp-86, c-pop-86, cg-vippg-85, ck-plscc-89, d-paope-87, dko-fliet-87, ds-gmmmc-79, ds-cgcw-90, dsv-diss-88, f-fapct-85, gjpt-tsp-78, ghlst-ltavs-87, gs-ccrs-87, gs-pmgsc-85, h-ovgat-89, kl-fstcg-85, fm-tspep-84, l-tpfc-88, ms-sabcp-89, oamb-oafme-86, ol-mcp-81, s-cgcw-86, tv-otats-88, ZZZ"
-, update =	"01.04 icking, 97.11 bibrelex"
+, author =      "E. A. Melissaratos and D. L. Souvaine"
+, title =       "On solving geometric optimization problems using shortest paths"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "350--359"
+, precedes =    "ms-sphsg-90"
+, cites =       "a-lncg-88, acy-macp-85, akmsw-gamsa-87, ap-nsmma-88, bddg-fep-85, cy-psppp-86, c-pop-86, cg-vippg-85, ck-plscc-89, d-paope-87, dko-fliet-87, ds-gmmmc-79, ds-cgcw-90, dsv-diss-88, f-fapct-85, gjpt-tsp-78, ghlst-ltavs-87, gs-ccrs-87, gs-pmgsc-85, h-ovgat-89, kl-fstcg-85, fm-tspep-84, l-tpfc-88, ms-sabcp-89, oamb-oafme-86, ol-mcp-81, s-cgcw-86, tv-otats-88, ZZZ"
+, update =      "01.04 icking, 97.11 bibrelex"
 }
 
 @techreport{ms-sphsg-90
-, author =	"E. A. Melissaratos and D. L. Souvaine"
-, title =	"Shortest paths help solve geometric optimization problems on planar regions"
-, type =	"Report"
-, number =	"LCSR-TR-150"
-, institution =	"Lab. Comput. Sci. Res., Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1990
-, keywords =	"design of algorithms, visibility, shortest paths, optimization, inscribed, circumscribed, separator, curved polygon, splinegon"
-, succeeds =	"ms-spvop-90, ms-sgopu-90"
+, author =      "E. A. Melissaratos and D. L. Souvaine"
+, title =       "Shortest paths help solve geometric optimization problems on planar regions"
+, type =        "Report"
+, number =      "LCSR-TR-150"
+, institution = "Lab. Comput. Sci. Res., Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1990
+, keywords =    "design of algorithms, visibility, shortest paths, optimization, inscribed, circumscribed, separator, curved polygon, splinegon"
+, succeeds =    "ms-spvop-90, ms-sgopu-90"
 }
 
 @inproceedings{ms-spvop-90
-, author =	"E. A. Melissaratos and D. L. Souvaine"
-, title =	"Shortest paths, visibility, and optimization problems in planar curvilinear objects"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"337--342"
-, precedes =	"ms-sphsg-90"
-, cites =	"cg-vippg-85, ds-cgcw-90, dsv-diss-88, egs-oplms-86, gh-ospqs-87, ghlst-ltavs-87, h-ovgat-89, fm-tspep-84, ms-sgopu-90, s-cgcw-86, tv-tsp-87, ZZZ"
-, update =	"01.04 icking, 98.07 bibrelex"
+, author =      "E. A. Melissaratos and D. L. Souvaine"
+, title =       "Shortest paths, visibility, and optimization problems in planar curvilinear objects"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "337--342"
+, precedes =    "ms-sphsg-90"
+, cites =       "cg-vippg-85, ds-cgcw-90, dsv-diss-88, egs-oplms-86, gh-ospqs-87, ghlst-ltavs-87, h-ovgat-89, fm-tspep-84, ms-sgopu-90, s-cgcw-86, tv-tsp-87, ZZZ"
+, update =      "01.04 icking, 98.07 bibrelex"
 }
 
 @inproceedings{m-astd-97
-, author =	"M. Melkemi"
-, title =	"A-Shapes and their derivatives"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"367--369"
-, cites =	"eks-sspp-83, mm-addp-95, m-cspps-96, m-asfps-96, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "M. Melkemi"
+, title =       "A-Shapes and their derivatives"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "367--369"
+, cites =       "eks-sspp-83, mm-addp-95, m-cspps-96, m-asfps-96, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @techreport{m-asfps-96
-, author =	"M. Melkemi"
-, title =	"A-shapes of a finite point set"
-, type =	"Technical {Report}"
-, number =	"LIGIM-TR.02.96"
-, institution =	"LIGIM Universit{\'e} Claude Bernard Lyon"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "M. Melkemi"
+, title =       "A-shapes of a finite point set"
+, type =        "Technical {Report}"
+, number =      "LIGIM-TR.02.96"
+, institution = "LIGIM Universit{\'e} Claude Bernard Lyon"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @techreport{m-cspps-96
-, author =	"M. Melkemi"
-, title =	"Computing the shape of a planar point set"
-, type =	"Technical {Report}"
-, number =	"LIGIM-TR.01.96"
-, institution =	"LIGIM Universit{\'e} Claude Bernard Lyon"
-, year =	1996
-, note =	"Submitted to Pattern Recognition Journal"
-, update =	"98.07 bibrelex"
+, author =      "M. Melkemi"
+, title =       "Computing the shape of a planar point set"
+, type =        "Technical {Report}"
+, number =      "LIGIM-TR.01.96"
+, institution = "LIGIM Universit{\'e} Claude Bernard Lyon"
+, year =        1996
+, note =        "Submitted to Pattern Recognition Journal"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{md-cspps-99
-, author =	"Mahmoud Melkemi and Mourad Djebali"
-, title =	"Computing the Shape of a Planar Points Set"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"69--71"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Mahmoud Melkemi and Mourad Djebali"
+, title =       "Computing the Shape of a Planar Points Set"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "69--71"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @incollection{mm-addp-95
-, author =	"M. Melkemi and L. Melkemi"
-, title =	"An algorithm for detecting dot patterns"
-, editor =	"R. A. Earnshaw and J. A. Vince"
-, booktitle =	"Computer Graphics"
-, publisher =	"Academic Press"
-, address =	"Leeds, UK"
-, year =	1995
-, pages =	"161--169"
-, update =	"98.07 bibrelex"
+, author =      "M. Melkemi and L. Melkemi"
+, title =       "An algorithm for detecting dot patterns"
+, editor =      "R. A. Earnshaw and J. A. Vince"
+, booktitle =   "Computer Graphics"
+, publisher =   "Academic Press"
+, address =     "Leeds, UK"
+, year =        1995
+, pages =       "161--169"
+, update =      "98.07 bibrelex"
 }
 
 @article{m-olcch-87
-, author =	"A. Melkman"
-, title =	"On-line construction of the convex hull of a simple polyline"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"11--12"
+, author =      "A. Melkman"
+, title =       "On-line construction of the convex hull of a simple polyline"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "11--12"
 }
 
 @techreport{m-apcp-85
-, author =	"A. Melkman"
-, title =	"On the approximation of polygonal curves in the plane"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Math. Comput. Sci., Univ. Negev"
-, year =	1985
+, author =      "A. Melkman"
+, title =       "On the approximation of polygonal curves in the plane"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Math. Comput. Sci., Univ. Negev"
+, year =        1985
 }
 
 @incollection{mo-pca-88
-, author =	"A. Melkman and J. O'Rourke"
-, title =	"On polygonal chain approximation"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"87--95"
-, keywords =	"approximation, circles"
+, author =      "A. Melkman and J. O'Rourke"
+, title =       "On polygonal chain approximation"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "87--95"
+, keywords =    "approximation, circles"
 }
 
 @book{m-camap-91
-, author =	"L. S. H. d. Mello"
-, title =	"Computer-Aided Mechanical Assembly Planning"
-, publisher =	"Kluwer Academic Publishers"
-, address =	"Boston"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "L. S. H. d. Mello"
+, title =       "Computer-Aided Mechanical Assembly Planning"
+, publisher =   "Kluwer Academic Publishers"
+, address =     "Boston"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @article{mks-eapuc-77
-, author =	"T. W. Melnyk and O. Knop and W. R. Smith"
-, title =	"Extremal arrangements of points and unit charges on a sphere: equilibrium configurations revisited"
-, journal =	"Can. J. Chem."
-, volume =	"??"
-, year =	1977
-, update =	"97.11 bibrelex"
+, author =      "T. W. Melnyk and O. Knop and W. R. Smith"
+, title =       "Extremal arrangements of points and unit charges on a sphere: equilibrium configurations revisited"
+, journal =     "Can. J. Chem."
+, volume =      "??"
+, year =        1977
+, update =      "97.11 bibrelex"
 }
 
 @incollection{m-istam-85
-, author =	"R. C. Melville"
-, title =	"An implementation study of two algorithms for the minimum spanning circle problem"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"267--294"
+, author =      "R. C. Melville"
+, title =       "An implementation study of two algorithms for the minimum spanning circle problem"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "267--294"
 }
 
 @book{m-ccm-76
-, author =	"Z. A. Melzak"
-, title =	"Companion to concrete mathematics"
-, volume =	2
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1976
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "Z. A. Melzak"
+, title =       "Companion to concrete mathematics"
+, volume =      2
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1976
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{m-ps-61
-, author =	"Z. A. Melzak"
-, title =	"On the problem of {Steiner}"
-, journal =	"Canad. Math. Bull."
-, volume =	4
-, year =	1961
-, pages =	"143--148"
+, author =      "Z. A. Melzak"
+, title =       "On the problem of {Steiner}"
+, journal =     "Canad. Math. Bull."
+, volume =      4
+, year =        1961
+, pages =       "143--148"
 }
 
 @article{m-pmcl-61
-, author =	"Z. A. Melzak"
-, title =	"Plane motion with curvature limitations"
-, journal =	"J. Soc. Indust. Appl. Math."
-, volume =	9
-, year =	1961
-, pages =	"422--432"
-, update =	"94.05 devillers"
+, author =      "Z. A. Melzak"
+, title =       "Plane motion with curvature limitations"
+, journal =     "J. Soc. Indust. Appl. Math."
+, volume =      9
+, year =        1961
+, pages =       "422--432"
+, update =      "94.05 devillers"
 }
 
 @inproceedings{m-srups-95
-, author =	"Robert Mencl"
-, title =	"Surface Reconstruction from Unorganized Points in Space"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"67--70"
-, update =	"00.03 bibrelex"
+, author =      "Robert Mencl"
+, title =       "Surface Reconstruction from Unorganized Points in Space"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "67--70"
+, update =      "00.03 bibrelex"
 }
 
 @book{m-it-62
-, author =	"B. Mendelson"
-, title =	"Introduction to Topology"
-, publisher =	"Allyn \& Bacon"
-, address =	"Boston"
-, year =	1962
-, update =	"97.11 bibrelex"
+, author =      "B. Mendelson"
+, title =       "Introduction to Topology"
+, publisher =   "Allyn \& Bacon"
+, address =     "Boston"
+, year =        1962
+, update =      "97.11 bibrelex"
 }
 
 @misc{m-hpvs-92
-, author =	"X. Mendonca"
-, title =	"Heuristics for Planarization by Vertex Splitting"
-, institution =	"University of Newcastle"
-, year =	1992
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "X. Mendonca"
+, title =       "Heuristics for Planarization by Vertex Splitting"
+, institution = "University of Newcastle"
+, year =        1992
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{m-fsmgm-87
-, author =	"A. C.-C. Meng"
-, title =	"Free-Space Modeling and Geometric Motion Planning Under Unexpected Obstacles"
-, type =	"Technical {Report}"
-, institution =	"Texas Instruments Artificial Intelligence Lab"
-, year =	1987
-, update =	"93.09 milone+mitchell"
+, author =      "A. C.-C. Meng"
+, title =       "Free-Space Modeling and Geometric Motion Planning Under Unexpected Obstacles"
+, type =        "Technical {Report}"
+, institution = "Texas Instruments Artificial Intelligence Lab"
+, year =        1987
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{m-fsmpp-??
-, author =	"A. C.-C. Meng"
-, title =	"Free-Space Modeling and Path Planning Under Uncertainty for Autonomous Air Robots"
-, type =	"Manuscript"
-, institution =	"School of Operations Research and Industrial Engineering, Cornell University"
-, year =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "A. C.-C. Meng"
+, title =       "Free-Space Modeling and Path Planning Under Uncertainty for Autonomous Air Robots"
+, type =        "Manuscript"
+, institution = "School of Operations Research and Industrial Engineering, Cornell University"
+, year =        "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{m-uuam-28
-, author =	"K. Menger"
-, title =	"Untersuchungen {\"u}ber allgemeine {Metrik}"
-, journal =	"Math. Ann."
-, volume =	100
-, year =	1928
-, pages =	"75--163"
-, update =	"00.03 bibrelex"
+, author =      "K. Menger"
+, title =       "Untersuchungen {\"u}ber allgemeine {Metrik}"
+, journal =     "Math. Ann."
+, volume =      100
+, year =        1928
+, pages =       "75--163"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{ms-esasg-90
-, author =	"A. Menn and A. K. Somani"
-, title =	"An Efficient Sorting Algorithm for the Star Graph Interconnection Network"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, month =	aug
-, year =	1990
-, pages =	"1--8"
-, update =	"98.07 bibrelex"
+, author =      "A. Menn and A. K. Somani"
+, title =       "An Efficient Sorting Algorithm for the Star Graph Interconnection Network"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, month =       aug
+, year =        1990
+, pages =       "1--8"
+, update =      "98.07 bibrelex"
 }
 
 @article{mg-ffmbb-98
-, author =	"J. Menon and B. Guo"
-, title =	"Free-Form Modeling in Bilateral Brep and CSG Representation Schemes"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"537--576"
-, update =	"98.11 devillers"
+, author =      "J. Menon and B. Guo"
+, title =       "Free-Form Modeling in Bilateral Brep and CSG Representation Schemes"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "537--576"
+, update =      "98.11 devillers"
 }
 
 @article{mr-anvmp-93
-, author =	"J. P. Menon and D. M. Robinson"
-, title =	"Advanced {NC} Verification via Massively Parallel Raycasting"
-, journal =	"Manufact. Review"
-, volume =	6
-, number =	2
-, month =	jun
-, year =	1993
-, pages =	"141--154"
-, update =	"95.01 held"
+, author =      "J. P. Menon and D. M. Robinson"
+, title =       "Advanced {NC} Verification via Massively Parallel Raycasting"
+, journal =     "Manufact. Review"
+, volume =      6
+, number =      2
+, month =       jun
+, year =        1993
+, pages =       "141--154"
+, update =      "95.01 held"
 }
 
 @article{mv-tcfnv-93
-, author =	"J. P. Menon and H. B. Voelcker"
-, title =	"Toward a Comprehensive Formulation of {NC} Verification as a Mathematical and Computational Problem"
-, journal =	"J. Design \& Manufact."
-, volume =	3
-, year =	1993
-, pages =	"263--277"
-, update =	"95.01 held"
+, author =      "J. P. Menon and H. B. Voelcker"
+, title =       "Toward a Comprehensive Formulation of {NC} Verification as a Mathematical and Computational Problem"
+, journal =     "J. Design \& Manufact."
+, volume =      3
+, year =        1993
+, pages =       "263--277"
+, update =      "95.01 held"
 }
 
 @inproceedings{m-piadt-92
-, author =	"M. L. Merriam"
-, title =	"Parallel implementation of an algorithm for {Delaunay} triangulation"
-, booktitle =	"1st European Comput. Fluid Dynamics Conf."
-, month =	sep
-, year =	1992
-, pages =	"907--912"
-, update =	"97.11 bibrelex"
+, author =      "M. L. Merriam"
+, title =       "Parallel implementation of an algorithm for {Delaunay} triangulation"
+, booktitle =   "1st European Comput. Fluid Dynamics Conf."
+, month =       sep
+, year =        1992
+, pages =       "907--912"
+, update =      "97.11 bibrelex"
 }
 
 @article{m-rcrec-73
-, author =	"R. D. Merrill"
-, title =	"Representation of contours and regions for efficient computer search"
-, journal =	"Commun. ACM"
-, volume =	16
-, year =	1973
-, pages =	"69--82"
+, author =      "R. D. Merrill"
+, title =       "Representation of contours and regions for efficient computer search"
+, journal =     "Commun. ACM"
+, volume =      16
+, year =        1973
+, pages =       "69--82"
 }
 
 @article{m-cancp-85
-, author =	"A. {Mesa Henriquez}"
-, title =	"{CONVY}: an algorithm for the nonoverlapping covering of polygons by convex sets ({Spanish} {English} summary)"
-, journal =	"Investigaci{\'o}n Oper."
-, volume =	6
-, year =	1985
-, pages =	"79--94"
+, author =      "A. {Mesa Henriquez}"
+, title =       "{CONVY}: an algorithm for the nonoverlapping covering of polygons by convex sets ({Spanish} {English} summary)"
+, journal =     "Investigaci{\'o}n Oper."
+, volume =      6
+, year =        1985
+, pages =       "79--94"
 }
 
 @article{m-hachc-85
-, author =	"A. {Mesa Henriquez}"
-, title =	"{HODY}: an algorithm for constructing the hodograph of convex polygons ({Spanish} {English} summary)"
-, journal =	"Investigaci{\'o}n Oper."
-, volume =	6
-, year =	1985
-, pages =	"95--110"
+, author =      "A. {Mesa Henriquez}"
+, title =       "{HODY}: an algorithm for constructing the hodograph of convex polygons ({Spanish} {English} summary)"
+, journal =     "Investigaci{\'o}n Oper."
+, volume =      6
+, year =        1985
+, pages =       "95--110"
 }
 
 @inproceedings{mrl-tdugg-91
-, author =	"S. Meshkat and J. Ruppert and H. Li"
-, title =	"Three-dimensional unstructured grid generation based on {Delaunay} tetrahedralization"
-, booktitle =	"Proc. 3 Int. Conf. Numerical Grid Generation"
-, month =	jun
-, year =	1991
-, pages =	"841--851"
-, update =	"98.11 bibrelex"
+, author =      "S. Meshkat and J. Ruppert and H. Li"
+, title =       "Three-dimensional unstructured grid generation based on {Delaunay} tetrahedralization"
+, booktitle =   "Proc. 3 Int. Conf. Numerical Grid Generation"
+, month =       jun
+, year =        1991
+, pages =       "841--851"
+, update =      "98.11 bibrelex"
 }
 
 @article{ms-vdmcp-87
-, author =	"S. N. Meshkat and C. M. Sakkas"
-, title =	"Voronoi diagram for multiply-connected polygonal domains {II}: implementation and application"
-, journal =	"IBM J. Res. Develop."
-, volume =	31
-, year =	1987
-, pages =	"373--381"
-, keywords =	"Voronoi diagram, polygonal domains, resistance networks, two-dimensional VLSI geometry, boundary representation"
+, author =      "S. N. Meshkat and C. M. Sakkas"
+, title =       "Voronoi diagram for multiply-connected polygonal domains {II}: implementation and application"
+, journal =     "IBM J. Res. Develop."
+, volume =      31
+, year =        1987
+, pages =       "373--381"
+, keywords =    "Voronoi diagram, polygonal domains, resistance networks, two-dimensional VLSI geometry, boundary representation"
 }
 
 @techreport{m-alldg-88
-, author =	"E. B. Messinger"
-, title =	"Automatic Layout of Large Directed Graphs"
-, number =	"88-07-08"
-, institution =	"Department of Computer Science, University of Washington"
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. B. Messinger"
+, title =       "Automatic Layout of Large Directed Graphs"
+, number =      "88-07-08"
+, institution = "Department of Computer Science, University of Washington"
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{mrh-dcaal-91
-, author =	"E. B. Messinger and L. A. Rowe and R. H. Henry"
-, title =	"A Divide-and-Conquer Algorithm for the Automatic Layout of Large Directed Graphs"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	"SMC-21"
-, number =	1
-, year =	1991
-, pages =	"1--12"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. B. Messinger and L. A. Rowe and R. H. Henry"
+, title =       "A Divide-and-Conquer Algorithm for the Automatic Layout of Large Directed Graphs"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      "SMC-21"
+, number =      1
+, year =        1991
+, pages =       "1--12"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{mps-anpao-98
-, author =	"P. T. Metaxas and G. E. Pantziou and A. Symvonis"
-, title =	"A note on parallel algorithms for optimal h-v drawings of binary trees"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, year =	1998
-, pages =	"145--158"
-, update =	"98.03 smid"
+, author =      "P. T. Metaxas and G. E. Pantziou and A. Symvonis"
+, title =       "A note on parallel algorithms for optimal h-v drawings of binary trees"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, year =        1998
+, pages =       "145--158"
+, update =      "98.03 smid"
 }
 
 @inproceedings{mps-phvdb-94
-, author =	"P. T. Metaxas and G. E. Pantziou and A. Symvonis"
-, title =	"Parallel h-v Drawings of Binary Trees"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"487--495"
-, keywords =	"graph drawing, trees"
-, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell, 95.01 tamassia"
+, author =      "P. T. Metaxas and G. E. Pantziou and A. Symvonis"
+, title =       "Parallel h-v Drawings of Binary Trees"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "487--495"
+, keywords =    "graph drawing, trees"
+, update =      "99.11 bibrelex, 98.03 smid, 96.05 mitchell, 95.01 tamassia"
 }
 
 @article{mk-oaibr-91
-, author =	"N. N. Metel'skii and V. S. Krikun"
-, title =	"Optimal arrangement of isothetic blocks with respect to approximation criteria (in Russian)"
-, journal =	"Doklady Akad. Nauk SSSR"
-, volume =	317
-, number =	2
-, year =	1991
-, pages =	"320--323"
-, keywords =	"generalized convexity, visibility, isothetic domain, $S-$convex hull"
-, update =	"95.01 korneenko"
-, annote =	"The $S$-convex hull for an isothetic
+, author =      "N. N. Metel'skii and V. S. Krikun"
+, title =       "Optimal arrangement of isothetic blocks with respect to approximation criteria (in Russian)"
+, journal =     "Doklady Akad. Nauk SSSR"
+, volume =      317
+, number =      2
+, year =        1991
+, pages =       "320--323"
+, keywords =    "generalized convexity, visibility, isothetic domain, $S-$convex hull"
+, update =      "95.01 korneenko"
+, annote =      "The $S$-convex hull for an isothetic
    domain is in fact the minimal externally isothetically visible
    hull. An $O(n\log n+r)$ time  algorithm for computing the
    $S$-convex hull of an $n$-vertex isothetic domain is given, where
@@ -104415,1301 +104415,1301 @@ @article{mk-oaibr-91
 }
 
 @article{m-ptlsa-84
-, author =	"F. {Meyer auf der Heide}"
-, title =	"A Polynomial Time Linear Search Algorithm for the $n$-Dimensional Knapsack Problem"
-, journal =	"J. ACM"
-, volume =	31
-, year =	1984
-, pages =	"668--676"
-, keywords =	"NP-complete, knapsack, linear search algorithm, nonuniform algorithm"
-, update =	"93.09 erickson"
-, annote =	"For every fixed $n$, there exists a linear search algorithm which solves the $n$-dimensional knapsack problem in $O(n^4\log n)$ time."
+, author =      "F. {Meyer auf der Heide}"
+, title =       "A Polynomial Time Linear Search Algorithm for the $n$-Dimensional Knapsack Problem"
+, journal =     "J. ACM"
+, volume =      31
+, year =        1984
+, pages =       "668--676"
+, keywords =    "NP-complete, knapsack, linear search algorithm, nonuniform algorithm"
+, update =      "93.09 erickson"
+, annote =      "For every fixed $n$, there exists a linear search algorithm which solves the $n$-dimensional knapsack problem in $O(n^4\log n)$ time."
 }
 
 @incollection{m-hsssm-93
-, author =	"F. {Meyer auf der Heide}"
-, title =	"Hashing stratefies for simulating shared memory on distributed memory machines"
-, booktitle =	"Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	678
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	""
-, update =	"96.09 orourke"
+, author =      "F. {Meyer auf der Heide}"
+, title =       "Hashing stratefies for simulating shared memory on distributed memory machines"
+, booktitle =   "Parallel Architectures and Their Efficient Use: First Heinz Nixdorf Symposium"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      678
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       ""
+, update =      "96.09 orourke"
 }
 
 @article{m-mt-94
-, author =	"D. Meyers"
-, title =	"Multiresolutional Tiling"
-, journal =	"Comput. Graph. Forum"
-, volume =	13
-, number =	5
-, month =	dec
-, year =	1994
-, pages =	"325--340"
-, update =	"96.01 held"
+, author =      "D. Meyers"
+, title =       "Multiresolutional Tiling"
+, journal =     "Comput. Graph. Forum"
+, volume =      13
+, number =      5
+, month =       dec
+, year =        1994
+, pages =       "325--340"
+, update =      "96.01 held"
 }
 
 @article{mss-sc-92
-, author =	"David Meyers and Shelley Skinner and Kenneth Sloan"
-, title =	"Surfaces from Contours"
-, journal =	"ACM Trans. Graph."
-, volume =	11
-, number =	3
-, month =	jul
-, year =	1992
-, pages =	"228--258"
-, annote =	"Makes triangulated mesh from contour slices. Breaks
-		 into four subproblems: correspondence (which contours
-		 to connect), tiling (how to connect), branching (what
-		 to do with branches), and fitting surface to the mesh.
-		 Interesting (to me) bit is branching -- when two
-		 contours merge we must triangulate the polygon between
-		 them. Uses ear cutting to construct original
-		 triangulation and Delaunay flips to improve it. Also
-		 considers flips that encourage triangles that connect
-		 the contours to be merged."
+, author =      "David Meyers and Shelley Skinner and Kenneth Sloan"
+, title =       "Surfaces from Contours"
+, journal =     "ACM Trans. Graph."
+, volume =      11
+, number =      3
+, month =       jul
+, year =        1992
+, pages =       "228--258"
+, annote =      "Makes triangulated mesh from contour slices. Breaks
+                 into four subproblems: correspondence (which contours
+                 to connect), tiling (how to connect), branching (what
+                 to do with branches), and fitting surface to the mesh.
+                 Interesting (to me) bit is branching -- when two
+                 contours merge we must triangulate the polygon between
+                 them. Uses ear cutting to construct original
+                 triangulation and Delaunay flips to improve it. Also
+                 considers flips that encourage triangles that connect
+                 the contours to be merged."
 }
 
 @inproceedings{mss-sccbp-91
-, author =	"D. Meyers and S. Skinner and K. Sloan"
-, title =	"Surfaces from contours: the correspondence and branching problem"
-, booktitle =	"Proc. Graphics Interface '91"
-, year =	1991
-, pages =	"246--254"
-, update =	"98.03 bibrelex"
+, author =      "D. Meyers and S. Skinner and K. Sloan"
+, title =       "Surfaces from contours: the correspondence and branching problem"
+, booktitle =   "Proc. Graphics Interface '91"
+, year =        1991
+, pages =       "246--254"
+, update =      "98.03 bibrelex"
 }
 
 @article{mdr-cssoo-93
-, author =	"Scott Meyers and Carolyn K. Duby and Steven P. Reiss"
-, title =	"Constraining the structure and style of object-oriented programs"
-, journal =	"Proc. First Workshop on Principles and Practice of Constraint Programming"
-, volume =	"??"
-, month =	apr
-, year =	1993
-, update =	"97.03 tamassia"
+, author =      "Scott Meyers and Carolyn K. Duby and Steven P. Reiss"
+, title =       "Constraining the structure and style of object-oriented programs"
+, journal =     "Proc. First Workshop on Principles and Practice of Constraint Programming"
+, volume =      "??"
+, month =       apr
+, year =        1993
+, update =      "97.03 tamassia"
 }
 
 @article{mr-esmvs-92
-, author =	"Scott Meyers and Steven P. Reiss"
-, title =	"An empirical study of multiple-view software development"
-, journal =	"Software Engineering Notes"
-, volume =	17
-, number =	5
-, month =	dec
-, year =	1992
-, pages =	"47--57"
-, update =	"97.03 tamassia"
+, author =      "Scott Meyers and Steven P. Reiss"
+, title =       "An empirical study of multiple-view software development"
+, journal =     "Software Engineering Notes"
+, volume =      17
+, number =      5
+, month =       dec
+, year =        1992
+, pages =       "47--57"
+, update =      "97.03 tamassia"
 }
 
 % m-thasa-94 quotes this work incompletely.
 @article{m--91
-, author =	"P. G. Mezey"
-, journal =	"J. Math. Chem."
-, volume =	8
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "P. G. Mezey"
+, journal =     "J. Math. Chem."
+, volume =      8
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @incollection{m-ms-90
-, author =	"P. G. Mezey"
-, title =	"Molecular surfaces"
-, editor =	"K. B. Lipkowitz and D. B. Boyd"
-, booktitle =	"Reviews in Computational Chemistry"
-, volume =	1
-, publisher =	"VCH Publishers"
-, year =	1990
-, update =	"98.03 agarwal+bibrelex"
+, author =      "P. G. Mezey"
+, title =       "Molecular surfaces"
+, editor =      "K. B. Lipkowitz and D. B. Boyd"
+, booktitle =   "Reviews in Computational Chemistry"
+, volume =      1
+, publisher =   "VCH Publishers"
+, year =        1990
+, update =      "98.03 agarwal+bibrelex"
 }
 
 @book{m-scims-93
-, author =	"P. G. Mezey"
-, title =	"Shape in Chemistry: An Introduction to Molecular Shape and Topology"
-, publisher =	"VCH Publ."
-, address =	"New York"
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "P. G. Mezey"
+, title =       "Shape in Chemistry: An Introduction to Molecular Shape and Topology"
+, publisher =   "VCH Publ."
+, address =     "New York"
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{m-thasa-94
-, author =	"P. G. Mezey"
-, title =	"The T-Hull Approach to Shape Analysis"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"231--236"
-, cites =	"eks-sspp-83, m--91, m-scims-93"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "P. G. Mezey"
+, title =       "The T-Hull Approach to Shape Analysis"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "231--236"
+, cites =       "eks-sspp-83, m--91, m-scims-93"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{d-qnsa-97
-, author =	"Dominique Michelucci"
-, title =	"A Quadratic Non--Standard Arthmetic"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"123--128"
-, update =	"01.07 devillers, 97.11 jones"
+, author =      "Dominique Michelucci"
+, title =       "A Quadratic Non--Standard Arthmetic"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "123--128"
+, update =      "01.07 devillers, 97.11 jones"
 }
 
 @inproceedings{m-aigc-96
-, author =	"D. Michelucci"
-, title =	"Arithmetic isuues in geometric computations"
-, booktitle =	"Proc. 2nd Real Numbers and Computer Conf."
-, site =	"Marseille, France"
-, year =	1996
-, pages =	"43--69"
-, update =	"97.03 devillers"
+, author =      "D. Michelucci"
+, title =       "Arithmetic isuues in geometric computations"
+, booktitle =   "Proc. 2nd Real Numbers and Computer Conf."
+, site =        "Marseille, France"
+, year =        1996
+, pages =       "43--69"
+, update =      "97.03 devillers"
 }
 
 @phdthesis{m-rfqcd-87
-, author =	"D. Michelucci"
-, title =	"Les repr{\'e}sentations par les fronti{\'e}res: quelques constructions; difficulte{\'e}s renconctr{\'e}es"
-, type =	"Th{\`e}se de Doctorat en Sciences"
-, school =	"{\'E}cole Nationale Sup{\'e}rieure des Mines de Saint-{\'E}tienne"
-, year =	1987
-, keywords =	"doctoral thesis"
-, update =	"99.03 forrest, 98.11 bibrelex, 97.03 devillers, 93.03 rote"
+, author =      "D. Michelucci"
+, title =       "Les repr{\'e}sentations par les fronti{\'e}res: quelques constructions; difficulte{\'e}s renconctr{\'e}es"
+, type =        "Th{\`e}se de Doctorat en Sciences"
+, school =      "{\'E}cole Nationale Sup{\'e}rieure des Mines de Saint-{\'E}tienne"
+, year =        1987
+, keywords =    "doctoral thesis"
+, update =      "99.03 forrest, 98.11 bibrelex, 97.03 devillers, 93.03 rote"
 }
 
 @techreport{mz-lubgj-88
-, author =	"S. R. Middila and D. Zhou"
-, title =	"Lower and upper bounds for the general junction routing problem"
-, type =	"Report"
-, number =	"ACT-90"
-, institution =	"Coordinated Science Lab."
-, address =	"Univ. of IL"
-, month =	may
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "S. R. Middila and D. Zhou"
+, title =       "Lower and upper bounds for the general junction routing problem"
+, type =        "Report"
+, number =      "ACT-90"
+, institution = "Coordinated Science Lab."
+, address =     "Univ. of IL"
+, month =       may
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @article{mz-rgj-89
-, author =	"S. R. Middila and D. Zhou"
-, title =	"Routing in general junctions"
-, journal =	"IEEE Trans. on CAD"
-, volume =	8
-, number =	11
-, month =	nov
-, year =	1989
-, pages =	"1174--1184"
-, update =	"98.07 bibrelex"
+, author =      "S. R. Middila and D. Zhou"
+, title =       "Routing in general junctions"
+, journal =     "IEEE Trans. on CAD"
+, volume =      8
+, number =      11
+, month =       nov
+, year =        1989
+, pages =       "1174--1184"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{m-snct-73
-, author =	"A. E. Middleditch"
-, title =	"Survey of Numerical Controller Technology"
-, institution =	"Univ. Rochester"
-, address =	"Rochester, NY"
-, year =	1973
-, note =	"Production Automation Project TR-1-D"
-, update =	"99.03 forrest, 98.03 bibrelex"
+, author =      "A. E. Middleditch"
+, title =       "Survey of Numerical Controller Technology"
+, institution = "Univ. Rochester"
+, address =     "Rochester, NY"
+, year =        1973
+, note =        "Production Automation Project TR-1-D"
+, update =      "99.03 forrest, 98.03 bibrelex"
 }
 
 @incollection{m-rmcp-88
-, author =	"A. E. Middleditch"
-, title =	"The representation and manipulation of convex polygons"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1988
-, pages =	"211--252"
-, update =	"99.11 bibrelex"
+, author =      "A. E. Middleditch"
+, title =       "The representation and manipulation of convex polygons"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1988
+, pages =       "211--252"
+, update =      "99.11 bibrelex"
 }
 
 @article{ms-bsstv-85a
-, author =	"A. E. Middleditch and K. H. Sears"
-, title =	"Blend Surfaces for Set Theoretic Volume Modeling Systems"
-, journal =	"Comput. Graph."
-, volume =	19
-, number =	3
-, year =	1985
-, pages =	"161--170"
-, note =	"Proc. SIGGRAPH '85"
-, update =	"99.03 forrest, 98.03 bibrelex"
+, author =      "A. E. Middleditch and K. H. Sears"
+, title =       "Blend Surfaces for Set Theoretic Volume Modeling Systems"
+, journal =     "Comput. Graph."
+, volume =      19
+, number =      3
+, year =        1985
+, pages =       "161--170"
+, note =        "Proc. SIGGRAPH '85"
+, update =      "99.03 forrest, 98.03 bibrelex"
 }
 
 @article{mst-ialc-89
-, author =	"A. E. Middleditch and T. W. Stacey and S. B. Tor"
-, title =	"Intersection algorithms for lines and circles"
-, journal =	"ACM Trans. Graph."
-, volume =	8
-, year =	1989
-, pages =	"25--40"
+, author =      "A. E. Middleditch and T. W. Stacey and S. B. Tor"
+, title =       "Intersection algorithms for lines and circles"
+, journal =     "ACM Trans. Graph."
+, volume =      8
+, year =        1989
+, pages =       "25--40"
 }
 
 @phdthesis{m-smdnt-93
-, author =	"T. Midtb{\o}"
-, title =	"Spatial Modelling by {Delaunay} Networks of Two and Three Dimensions"
-, type =	"Ph.{D}. Thesis"
-, school =	"Norvegian Institute of Technology"
-, address =	"Trondheim"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"98.07 devillers"
+, author =      "T. Midtb{\o}"
+, title =       "Spatial Modelling by {Delaunay} Networks of Two and Three Dimensions"
+, type =        "Ph.{D}. Thesis"
+, school =      "Norvegian Institute of Technology"
+, address =     "Trondheim"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "98.07 devillers"
 }
 
 @book{m-mca-92
-, author =	"M. Mignotte"
-, title =	"Mathematics for Computer Algebra"
-, publisher =	"Springer-Verlag"
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "M. Mignotte"
+, title =       "Mathematics for Computer Algebra"
+, publisher =   "Springer-Verlag"
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @article{mnr-cochp-94
-, author =	"A. Mikheev and M. Nozik and J. Rubinstein"
-, title =	"Computation of Offset Curves by the Huygens Principle"
-, journal =	"Comput. Graph. Forum"
-, volume =	13
-, number =	4
-, month =	oct
-, year =	1994
-, pages =	"249--252"
-, update =	"96.01 held"
+, author =      "A. Mikheev and M. Nozik and J. Rubinstein"
+, title =       "Computation of Offset Curves by the Huygens Principle"
+, journal =     "Comput. Graph. Forum"
+, volume =      13
+, number =      4
+, month =       oct
+, year =        1994
+, pages =       "249--252"
+, update =      "96.01 held"
 }
 
 @inproceedings{m-cacau-89
-, author =	"V. Milenkovic"
-, title =	"Calculating approximate curve arrangements using rounded arithmetic"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"197--207"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation"
-, cites =	"acm-aacad-88, acm-cad1b-84, acm-cad2a-84, c-qercf-75, cr-tlcra-88, em-sstcd-87, gy-frcg-86, hhk-tirgc-88, hhk-rsops-87, h-pargc-88, k-rmrs-89, kln-edtur-89, m-vigau-88a, m-vigau-88t, otu-nsga-87, r-paff-80, gss-egbra-89, ss-pmp2g-83, ss-ccsm-85, ss-pponp-88, s-aefsm-87, t-dmeag-51, y-gctsp-88, ZZZ"
-, update =	"98.03 bibrelex, 97.03 daniels"
+, author =      "V. Milenkovic"
+, title =       "Calculating approximate curve arrangements using rounded arithmetic"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "197--207"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation"
+, cites =       "acm-aacad-88, acm-cad1b-84, acm-cad2a-84, c-qercf-75, cr-tlcra-88, em-sstcd-87, gy-frcg-86, hhk-tirgc-88, hhk-rsops-87, h-pargc-88, k-rmrs-89, kln-edtur-89, m-vigau-88a, m-vigau-88t, otu-nsga-87, r-paff-80, gss-egbra-89, ss-pmp2g-83, ss-ccsm-85, ss-pponp-88, s-aefsm-87, t-dmeag-51, y-gctsp-88, ZZZ"
+, update =      "98.03 bibrelex, 97.03 daniels"
 }
 
 @inproceedings{m-dpggt-89
-, author =	"V. Milenkovic"
-, title =	"Double precision geometry: {A} general technique for calculating line and segment intersections using rounded arithmetic"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"500--505"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation"
-, update =	"98.03 agarwal, 97.03 daniels"
+, author =      "V. Milenkovic"
+, title =       "Double precision geometry: {A} general technique for calculating line and segment intersections using rounded arithmetic"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "500--505"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation"
+, update =      "98.03 agarwal, 97.03 daniels"
 }
 
 @inproceedings{m-pbpap-95
-, author =	"Victor Milenkovic"
-, title =	"Position-Based Physics: Animating and Packing Spheres Inside Polyhedra"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"79--84"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"computer graphics, simulation, physically-based modeling, linear programming, Minkowski sum, configuration space"
-, update =	"97.03 daniels, 95.09 jones"
+, author =      "Victor Milenkovic"
+, title =       "Position-Based Physics: Animating and Packing Spheres Inside Polyhedra"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "79--84"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "computer graphics, simulation, physically-based modeling, linear programming, Minkowski sum, configuration space"
+, update =      "97.03 daniels, 95.09 jones"
 }
 
 @inproceedings{m-pbpsm-96
-, author =	"Victor Milenkovic"
-, title =	"Position-based physics: simulating the motion of many highly interacting spheres and polyhedra"
-, booktitle =	"Computer Graphics"
-, year =	1996
-, pages =	"129--136"
-, note =	"Proc. SIGGRAPH '96"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"computer graphics, animation, physically-based modeling, linear programming, Minkowski sum, configuration space"
-, update =	"97.03 daniels"
+, author =      "Victor Milenkovic"
+, title =       "Position-based physics: simulating the motion of many highly interacting spheres and polyhedra"
+, booktitle =   "Computer Graphics"
+, year =        1996
+, pages =       "129--136"
+, note =        "Proc. SIGGRAPH '96"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "computer graphics, animation, physically-based modeling, linear programming, Minkowski sum, configuration space"
+, update =      "97.03 daniels"
 }
 
 @inproceedings{m-rcvdp-93
-, author =	"V. Milenkovic"
-, title =	"Robust construction of the {Voronoi} diagram of a polyhedron"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"473--478"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation"
-, cites =	"ck-acp-70, b-tends-67, cs-arscg-89, e-acg-87, f-smpst-90, f-savd-87, fm-nsala-91, ghms-apsml-91, hhk-tirgc-88, iss-nriac-92, l-knnvd-82, ld-gvdp-81, lm-cschu-90, m-vigau-88a, m-cacau-89, ms-saps-92, sh-cpp-75, si-cvd10-89, ls-ippvd-87, ls-pptmc-87, m-dpggt-89, ZZZ"
-, update =	"98.11 bibrelex, 97.03 daniels, 93.09 milone+mitchell"
+, author =      "V. Milenkovic"
+, title =       "Robust construction of the {Voronoi} diagram of a polyhedron"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "473--478"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation"
+, cites =       "ck-acp-70, b-tends-67, cs-arscg-89, e-acg-87, f-smpst-90, f-savd-87, fm-nsala-91, ghms-apsml-91, hhk-tirgc-88, iss-nriac-92, l-knnvd-82, ld-gvdp-81, lm-cschu-90, m-vigau-88a, m-cacau-89, ms-saps-92, sh-cpp-75, si-cvd10-89, ls-ippvd-87, ls-pptmc-87, m-dpggt-89, ZZZ"
+, update =      "98.11 bibrelex, 97.03 daniels, 93.09 milone+mitchell"
 }
 
 @article{m-rpm-93
-, author =	"V. Milenkovic"
-, title =	"Robust polygon modeling"
-, journal =	"Comput. Aided Design"
-, volume =	25
-, number =	9
-, year =	1993
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"algorithms, polygons, geometric modeling"
-, update =	"98.03 agarwal, 97.03 daniels, 96.05 pascucci"
+, author =      "V. Milenkovic"
+, title =       "Robust polygon modeling"
+, journal =     "Comput. Aided Design"
+, volume =      25
+, number =      9
+, year =        1993
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "algorithms, polygons, geometric modeling"
+, update =      "98.03 agarwal, 97.03 daniels, 96.05 pascucci"
 }
 
 @inproceedings{m-rpom-97
-, author =	"V. Milenkovic"
-, title =	"Rotational polygon overlap minimization"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"334--343"
-, cites =	"aaas-lpmpc-97, aas-mpcpp-92, a-peddf-89, ab-pptr-88, c-pcp-83, d-canpa-95, dm-cbspu-96, dm-mtcp1-97, dd-pp-92, d-tcpp-90, gc-cspum-93, gc-natpc-96, hss-cmpmi-84, l-canpt-94, lm-ccp-93, lm-csanp-95, m-tpcme-96, md-tpcme-95, m-mtcp2-97, m-pbpsm-96, sp-cppca-92, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
+, author =      "V. Milenkovic"
+, title =       "Rotational polygon overlap minimization"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "334--343"
+, cites =       "aaas-lpmpc-97, aas-mpcpp-92, a-peddf-89, ab-pptr-88, c-pcp-83, d-canpa-95, dm-cbspu-96, dm-mtcp1-97, dd-pp-92, d-tcpp-90, gc-cspum-93, gc-natpc-96, hss-cmpmi-84, l-canpt-94, lm-ccp-93, lm-csanp-95, m-tpcme-96, md-tpcme-95, m-mtcp2-97, m-pbpsm-96, sp-cppca-92, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{m-rfldd-90
-, author =	"V. Milenkovic"
-, title =	"Rounding face lattices in $d$ dimensions"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"40--45"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation, geometric rounding"
-, cites =	"ZZZ"
-, update =	"98.07 bibrelex, 97.03 daniels"
+, author =      "V. Milenkovic"
+, title =       "Rounding face lattices in $d$ dimensions"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "40--45"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation, geometric rounding"
+, cites =       "ZZZ"
+, update =      "98.07 bibrelex, 97.03 daniels"
 }
 
 @inproceedings{m-rflp-89
-, author =	"V. Milenkovic"
-, title =	"Rounding face lattices in the plane"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	12
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation, geometric rounding"
-, update =	"97.03 daniels"
+, author =      "V. Milenkovic"
+, title =       "Rounding face lattices in the plane"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       12
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation, geometric rounding"
+, update =      "97.03 daniels"
 }
 
 @inproceedings{m-tpcme-96
-, author =	"V. Milenkovic"
-, title =	"Translational polygon containment and minimal enclosure using linear programming based restriction"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, year =	1996
-, pages =	"109--118"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"layout, packing, placement, nesting, concave, polygons, Minkowski sum, configuration space"
-, update =	"97.03 daniels"
+, author =      "V. Milenkovic"
+, title =       "Translational polygon containment and minimal enclosure using linear programming based restriction"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, year =        1996
+, pages =       "109--118"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "layout, packing, placement, nesting, concave, polygons, Minkowski sum, configuration space"
+, update =      "97.03 daniels"
 }
 
 @unpublished{m-vigau-86
-, author =	"V. Milenkovic"
-, title =	"Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic"
-, year =	1986
-, note =	"Unpublished Manuscript"
-, update =	"98.03 bibrelex"
+, author =      "V. Milenkovic"
+, title =       "Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic"
+, year =        1986
+, note =        "Unpublished Manuscript"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{m-vigau-86i
-, author =	"V. Milenkovic"
-, title =	"Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic"
-, booktitle =	"International Workshop on Geometric Reasoning"
-, site =	"Oxford, UK"
-, month =	jul
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "V. Milenkovic"
+, title =       "Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic"
+, booktitle =   "International Workshop on Geometric Reasoning"
+, site =        "Oxford, UK"
+, month =       jul
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{m-vigau-88p
-, author =	"V. Milenkovic"
-, title =	"Verifiable Implementations of Geometric Algorithms using Finite Precision Arithmetic"
-, type =	"PhD Thesis"
-, school =	"Carnegie Mellon University"
-, year =	1988
-, keywords =	"doctoral thesis, robust geometric computation"
-, precedes =	"m-vigau-88a"
-, update =	"98.07 bibrelex, 97.03 daniels, 95.01 devillers"
+, author =      "V. Milenkovic"
+, title =       "Verifiable Implementations of Geometric Algorithms using Finite Precision Arithmetic"
+, type =        "PhD Thesis"
+, school =      "Carnegie Mellon University"
+, year =        1988
+, keywords =    "doctoral thesis, robust geometric computation"
+, precedes =    "m-vigau-88a"
+, update =      "98.07 bibrelex, 97.03 daniels, 95.01 devillers"
 }
 
 @incollection{m-vigau-89i
-, author =	"V. Milenkovic"
-, title =	"Verifiable implementations of geometric algorithms using finite precision arithmetic"
-, editor =	"D. Kapur and J. L. Mundy"
-, booktitle =	"Geometric Reasoning"
-, publisher =	"MIT Press"
-, year =	1989
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "V. Milenkovic"
+, title =       "Verifiable implementations of geometric algorithms using finite precision arithmetic"
+, editor =      "D. Kapur and J. L. Mundy"
+, booktitle =   "Geometric Reasoning"
+, publisher =   "MIT Press"
+, year =        1989
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @techreport{md-tpcme-95
-, author =	"V. Milenkovic and K. Daniels"
-, title =	"Translational polygon containment and minimal enclosure using geometric algorithms and mathematical programming"
-, type =	"Technical {Report}"
-, number =	"25-95"
-, institution =	"Center for Research in Computing Technology, Division of Applied Sciences, Harvard University"
-, address =	"Cambridge, MA"
-, year =	1995
-, url =	"ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
-, keywords =	"packing, layout, nesting, placement, concave, polygons, linear programming, optimization, Minkowski sum, configuration space, overlap, subdivisions"
-, update =	"97.03 daniels"
+, author =      "V. Milenkovic and K. Daniels"
+, title =       "Translational polygon containment and minimal enclosure using geometric algorithms and mathematical programming"
+, type =        "Technical {Report}"
+, number =      "25-95"
+, institution = "Center for Research in Computing Technology, Division of Applied Sciences, Harvard University"
+, address =     "Cambridge, MA"
+, year =        1995
+, url = "ftp://deas-ftp.harvard.edu/techreports/tr-1995.html"
+, keywords =    "packing, layout, nesting, placement, concave, polygons, linear programming, optimization, Minkowski sum, configuration space, overlap, subdivisions"
+, update =      "97.03 daniels"
 }
 
 @inproceedings{mdl-amm-91
-, author =	"V. Milenkovic and K. Daniels and Z. Li"
-, title =	"Automatic marker making"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"243--246"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"layout, nesting, placement, optimization"
-, update =	"97.03 daniels"
+, author =      "V. Milenkovic and K. Daniels and Z. Li"
+, title =       "Automatic marker making"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "243--246"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "layout, nesting, placement, optimization"
+, update =      "97.03 daniels"
 }
 
 @inproceedings{mdl-pcnpc-92
-, author =	"V. Milenkovic and K. Daniels and Z. Li"
-, title =	"Placement and compaction of nonconvex polygons for clothing manufacture"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"236--243"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"concave, polygons, layout, nesting, packing, optimization, Minkowski sum, configuration space"
-, cites =	"dhks-isccd-90, g-ctfsr-86, grs-kfcg-83, kos-cmsrp-91i, ml-sipat-91, mdl-amm-91, s-iamm-82, tw-cmm-73, nh-aplpg-84, s-iamm-88, ZZZ"
-, update =	"98.07 bibrelex, 97.03 daniels"
+, author =      "V. Milenkovic and K. Daniels and Z. Li"
+, title =       "Placement and compaction of nonconvex polygons for clothing manufacture"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "236--243"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "concave, polygons, layout, nesting, packing, optimization, Minkowski sum, configuration space"
+, cites =       "dhks-isccd-90, g-ctfsr-86, grs-kfcg-83, kos-cmsrp-91i, ml-sipat-91, mdl-amm-91, s-iamm-82, tw-cmm-73, nh-aplpg-84, s-iamm-88, ZZZ"
+, update =      "98.07 bibrelex, 97.03 daniels"
 }
 
 @inproceedings{mm-roaom-93
-, author =	"V. Milenkovic and V. Milenkovic"
-, title =	"Rational orthogonal approximations to orthogonal matrices"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"485--490"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"geometric modeling, quaternion arithmetic, basis reduction, integer programming, exact arithmetic"
-, precedes =	"mm-roaom-97"
-, cites =	"cdr-rrmrg-92, c-sede-92, crss-igbra-91, e-sap-80, fw-eeacg-92, h-eq-69, kln-edtur-89, mn-fccrp-90a, m-rfldd-90, r-srsrf-77, lll-fprc-82, l-atngc-86, ls-gbra-92, m-rflp-89, s-qrm-78"
-, update =	"98.11 bibrelex, 97.03 daniels+devillers, 93.09 milone+mitchell"
+, author =      "V. Milenkovic and V. Milenkovic"
+, title =       "Rational orthogonal approximations to orthogonal matrices"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "485--490"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "geometric modeling, quaternion arithmetic, basis reduction, integer programming, exact arithmetic"
+, precedes =    "mm-roaom-97"
+, cites =       "cdr-rrmrg-92, c-sede-92, crss-igbra-91, e-sap-80, fw-eeacg-92, h-eq-69, kln-edtur-89, mn-fccrp-90a, m-rfldd-90, r-srsrf-77, lll-fprc-82, l-atngc-86, ls-gbra-92, m-rflp-89, s-qrm-78"
+, update =      "98.11 bibrelex, 97.03 daniels+devillers, 93.09 milone+mitchell"
 }
 
 @inproceedings{mn-fccrp-90i
-, author =	"V. Milenkovic and L. R. Nackman"
-, title =	"Finding compact coordinate representations for polygons and polyhedra"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"244--252"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation"
-, precedes =	"mn-fccrp-90a"
-, cites =	"gj-cigtn-79, gps-crotr-89, h-gsm-89, m-rflp-89, mn-fccrp-90a, m-utcpc-89, s-fprgo-89, tt-pgelt-89, ZZZ"
-, update =	"97.11 bibrelex, 97.03 daniels"
+, author =      "V. Milenkovic and L. R. Nackman"
+, title =       "Finding compact coordinate representations for polygons and polyhedra"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "244--252"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation"
+, precedes =    "mn-fccrp-90a"
+, cites =       "gj-cigtn-79, gps-crotr-89, h-gsm-89, m-rflp-89, mn-fccrp-90a, m-utcpc-89, s-fprgo-89, tt-pgelt-89, ZZZ"
+, update =      "97.11 bibrelex, 97.03 daniels"
 }
 
 @article{mn-fccrp-90a
-, author =	"V. Milenkovic and L. R. Nackman"
-, title =	"Finding compact coordinate representations for polygons and polyhedra"
-, journal =	"IBM J. Res. Develop."
-, volume =	34
-, number =	35
-, month =	sep
-, year =	1990
-, pages =	"753--769"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation"
-, succeeds =	"mn-fccrp-90i"
-, update =	"98.11 bibrelex, 97.03 daniels"
+, author =      "V. Milenkovic and L. R. Nackman"
+, title =       "Finding compact coordinate representations for polygons and polyhedra"
+, journal =     "IBM J. Res. Develop."
+, volume =      34
+, number =      35
+, month =       sep
+, year =        1990
+, pages =       "753--769"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation"
+, succeeds =    "mn-fccrp-90i"
+, update =      "98.11 bibrelex, 97.03 daniels"
 }
 
 @inproceedings{m-dtlpn-00
-, author =	"Victor J. Milenkovic"
-, title =	"Densest Translational Lattice Packing of Non-Convex Polygons"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"280--289"
-, update =	"00.11 jones"
+, author =      "Victor J. Milenkovic"
+, title =       "Densest Translational Lattice Packing of Non-Convex Polygons"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "280--289"
+, update =      "00.11 jones"
 }
 
 @article{m-mtcp2-97
-, author =	"Victor J. Milenkovic"
-, title =	"Multiple Translational Containment, Part II: Exact Algorithm"
-, journal =	"Algorithmica"
-, volume =	19
-, number =	"1--2"
-, month =	sep
-, year =	1997
-, pages =	"183--218"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 held"
+, author =      "Victor J. Milenkovic"
+, title =       "Multiple Translational Containment, Part II: Exact Algorithm"
+, journal =     "Algorithmica"
+, volume =      19
+, number =      "1--2"
+, month =       sep
+, year =        1997
+, pages =       "183--218"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 held"
 }
 
 @inproceedings{m-pmsop-95
-, author =	"Victor J. Milenkovic"
-, title =	"Practical Methods for Set Operations on Polygons using Exact Arithmetic"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"55--60"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation, shortest-path rounding, nonuniform grids, geometric modeling, geometric rounding"
-, update =	"97.03 daniels, 95.09 jones"
+, author =      "Victor J. Milenkovic"
+, title =       "Practical Methods for Set Operations on Polygons using Exact Arithmetic"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "55--60"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation, shortest-path rounding, nonuniform grids, geometric modeling, geometric rounding"
+, update =      "97.03 daniels, 95.09 jones"
 }
 
 @article{m-rpomc-98
-, author =	"Victor J. Milenkovic"
-, title =	"Rotational polygon overlap minimization and compaction"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"305--318"
-, succeeds =	"m-rpom-97"
-, update =	"98.11 devillers"
+, author =      "Victor J. Milenkovic"
+, title =       "Rotational polygon overlap minimization and compaction"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "305--318"
+, succeeds =    "m-rpom-97"
+, update =      "98.11 devillers"
 }
 
 @article{m-spgr-00
-, author =	"V. J. Milenkovic"
-, title =	"Shortest Path Geometric Rounding"
-, journal =	"Algorithmica"
-, volume =	27
-, number =	1
-, year =	2000
-, pages =	"57--86"
-, update =	"00.11 smid, 00.07 held"
+, author =      "V. J. Milenkovic"
+, title =       "Shortest Path Geometric Rounding"
+, journal =     "Algorithmica"
+, volume =      27
+, number =      1
+, year =        2000
+, pages =       "57--86"
+, update =      "00.11 smid, 00.07 held"
 }
 
 @techreport{m-vigau-88t
-, author =	"V. J. Milenkovic"
-, title =	"Verifiable Implementations of Geometric Algorithms using Finite Precision Arithmetic"
-, number =	"CMU-CS-88-168"
-, institution =	"Department of Computer Science, Carnegie Mellon University"
-, address =	"Pittsburgh, PA15213"
-, month =	jul
-, year =	1988
-, precedes =	"m-vigau-88a"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "V. J. Milenkovic"
+, title =       "Verifiable Implementations of Geometric Algorithms using Finite Precision Arithmetic"
+, number =      "CMU-CS-88-168"
+, institution = "Department of Computer Science, Carnegie Mellon University"
+, address =     "Pittsburgh, PA15213"
+, month =       jul
+, year =        1988
+, precedes =    "m-vigau-88a"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{m-vigau-88a
-, author =	"V. J. Milenkovic"
-, title =	"Verifiable Implementations of Geometric Algorithms using Finite Precision Arithmetic"
-, journal =	"Artif. Intell."
-, volume =	37
-, year =	1988
-, pages =	"377--401"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"robust geometric computation"
-, succeeds =	"m-vigau-88p, m-vigau-88t"
-, update =	"98.11 bibrelex, 97.03 daniels, 95.01 devillers"
+, author =      "V. J. Milenkovic"
+, title =       "Verifiable Implementations of Geometric Algorithms using Finite Precision Arithmetic"
+, journal =     "Artif. Intell."
+, volume =      37
+, year =        1988
+, pages =       "377--401"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "robust geometric computation"
+, succeeds =    "m-vigau-88p, m-vigau-88t"
+, update =      "98.11 bibrelex, 97.03 daniels, 95.01 devillers"
 }
 
 @inproceedings{ml-csche-89
-, author =	"V. J. Milenkovic and Z. Li"
-, title =	"Constructing strongly convex hulls using exact or rounded arithmetic"
-, booktitle =	"Proc. ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1989
-, update =	"98.11 bibrelex"
+, author =      "V. J. Milenkovic and Z. Li"
+, title =       "Constructing strongly convex hulls using exact or rounded arithmetic"
+, booktitle =   "Proc. ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1989
+, update =      "98.11 bibrelex"
 }
 
 @article{mm-roaom-97
-, author =	"V. J. Milenkovic and V. Milenkovic"
-, title =	"Rational orthogonal approximations to orthogonal matrices"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"25--35"
-, url =	"https://www.cs.miami.edu/home/vjm/papers.html"
-, keywords =	"geometric modeling, quaternion arithmetic, basis reduction, integer programming, exact arithmetic"
-, succeeds =	"mm-roaom-93"
-, update =	"97.03 daniels"
+, author =      "V. J. Milenkovic and V. Milenkovic"
+, title =       "Rational orthogonal approximations to orthogonal matrices"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "25--35"
+, url = "https://www.cs.miami.edu/home/vjm/papers.html"
+, keywords =    "geometric modeling, quaternion arithmetic, basis reduction, integer programming, exact arithmetic"
+, succeeds =    "mm-roaom-93"
+, update =      "97.03 daniels"
 }
 
 @article{m-spfes-70
-, author =	"R. E. Miles"
-, title =	"A synopsis of {Poisson} flats in {Euclidean} spaces"
-, journal =	"J. Armenian Acad. Sci."
-, volume =	"??"
-, year =	1970
-, pages =	"??"
-, update =	"94.05 devillers"
+, author =      "R. E. Miles"
+, title =       "A synopsis of {Poisson} flats in {Euclidean} spaces"
+, journal =     "J. Armenian Acad. Sci."
+, volume =      "??"
+, year =        1970
+, pages =       "??"
+, update =      "94.05 devillers"
 }
 
 @article{m-wcdgp-64
-, author =	"R. E. Miles"
-, title =	"A wide class of distributions in geometric probability"
-, journal =	"Ann. Math. Statist."
-, volume =	35
-, year =	1964
-, pages =	"1407--1415"
+, author =      "R. E. Miles"
+, title =       "A wide class of distributions in geometric probability"
+, journal =     "Ann. Math. Statist."
+, volume =      35
+, year =        1964
+, pages =       "1407--1415"
 }
 
 @article{m-agpp2-68
-, author =	"R. E. Miles"
-, title =	"Asymptotic global proximity probabilities for $2$ bivariate $n$-sample (abstract)"
-, journal =	"Ann. Math. Statist."
-, volume =	39
-, year =	1968
-, pages =	1160
+, author =      "R. E. Miles"
+, title =       "Asymptotic global proximity probabilities for $2$ bivariate $n$-sample (abstract)"
+, journal =     "Ann. Math. Statist."
+, volume =      39
+, year =        1968
+, pages =       1160
 }
 
 @article{m-irs-71
-, author =	"R. E. Miles"
-, title =	"Isotropic random simplices"
-, journal =	"Adv. Appl. Probab."
-, volume =	3
-, year =	1971
-, pages =	"353--382"
-, update =	"98.03 bibrelex"
+, author =      "R. E. Miles"
+, title =       "Isotropic random simplices"
+, journal =     "Adv. Appl. Probab."
+, volume =      3
+, year =        1971
+, pages =       "353--382"
+, update =      "98.03 bibrelex"
 }
 
 @article{m-hpppp-70
-, author =	"R. E. Miles"
-, title =	"On the homogenous planar {Poisson} point-process"
-, journal =	"Math. Biosci."
-, volume =	6
-, year =	1970
-, pages =	"85--127"
+, author =      "R. E. Miles"
+, title =       "On the homogenous planar {Poisson} point-process"
+, journal =     "Math. Biosci."
+, volume =      6
+, year =        1970
+, pages =       "85--127"
 }
 
 @article{m-rpsts-71
-, author =	"R. E. Miles"
-, title =	"Random points, sets and tessellations on the surface of a sphere"
-, journal =	"Sankhy{\=a}: The Indian Journal of Statistics: Series A"
-, volume =	33
-, year =	1971
-, pages =	"145--174"
-, update =	"94.09 bernal"
+, author =      "R. E. Miles"
+, title =       "Random points, sets and tessellations on the surface of a sphere"
+, journal =     "Sankhy{\=a}: The Indian Journal of Statistics: Series A"
+, volume =      33
+, year =        1971
+, pages =       "145--174"
+, update =      "94.09 bernal"
 }
 
 @article{m-rpdrl-64
-, author =	"R. E. Miles"
-, title =	"Random polygons determined by random lines in a plane"
-, journal =	"Proc. National Academy of Sciences"
-, volume =	52
-, year =	1964
-, pages =	"901--907 and 1157--1160"
+, author =      "R. E. Miles"
+, title =       "Random polygons determined by random lines in a plane"
+, journal =     "Proc. National Academy of Sciences"
+, volume =      52
+, year =        1964
+, pages =       "901--907 and 1157--1160"
 }
 
 @phdthesis{m-rpgnd-61
-, author =	"R. E. Miles"
-, title =	"Random polytopes: the generalization to $n$ dimensions of the intervals of a {Poisson} process"
-, type =	"Ph.{D}. Thesis"
-, school =	"Cambridge Univ."
-, address =	"Cambridge, England"
-, year =	1961
-, keywords =	"doctoral thesis"
+, author =      "R. E. Miles"
+, title =       "Random polytopes: the generalization to $n$ dimensions of the intervals of a {Poisson} process"
+, type =        "Ph.{D}. Thesis"
+, school =      "Cambridge Univ."
+, address =     "Cambridge, England"
+, year =        1961
+, keywords =    "doctoral thesis"
 }
 
 @article{m-sp671-69
-, author =	"R. E. Miles"
-, title =	"Solution to problem 67-15 ({Probability} distribution of a network of triangles)"
-, journal =	"SIAM Rev."
-, volume =	11
-, year =	1969
-, pages =	"399--402"
+, author =      "R. E. Miles"
+, title =       "Solution to problem 67-15 ({Probability} distribution of a network of triangles)"
+, journal =     "SIAM Rev."
+, volume =      11
+, year =        1969
+, pages =       "399--402"
 }
 
 @article{m-rds-72
-, author =	"R. E. Miles"
-, title =	"The random division of space"
-, journal =	"Suppl. Adv. Appl. Prob."
-, volume =	"??"
-, year =	1972
-, pages =	"243--266"
-, update =	"94.09 bernal"
+, author =      "R. E. Miles"
+, title =       "The random division of space"
+, journal =     "Suppl. Adv. Appl. Prob."
+, volume =      "??"
+, year =        1972
+, pages =       "243--266"
+, update =      "94.09 bernal"
 }
 
 @article{m-srsmr-85
-, author =	"D. Miller"
-, title =	"A spatial representation system for mobile robots"
-, journal =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, volume =	"??"
-, school =	"Dept. Comput. Sci., Yale Univ."
-, address =	"New Haven, CT"
-, year =	1985
-, pages =	"122--127"
-, update =	"93.09 milone+mitchell"
+, author =      "D. Miller"
+, title =       "A spatial representation system for mobile robots"
+, journal =     "Proc. IEEE Internat. Conf. Robot. Autom."
+, volume =      "??"
+, school =      "Dept. Comput. Sci., Yale Univ."
+, address =     "New Haven, CT"
+, year =        1985
+, pages =       "122--127"
+, update =      "93.09 milone+mitchell"
 }
 
 @inbook{mawm-ancmr-89
-, author =	"D. Miller and D. Atkinson and B. Wilcox and A. Mishkin"
-, editor =	"T. Nishimura"
-, booktitle =	"Autonomous navigation and control of a {Mars} rover"
-, publisher =	"Pergamon Press"
-, year =	1989
-, pages =	"111--114"
-, update =	"97.11 bibrelex"
+, author =      "D. Miller and D. Atkinson and B. Wilcox and A. Mishkin"
+, editor =      "T. Nishimura"
+, booktitle =   "Autonomous navigation and control of a {Mars} rover"
+, publisher =   "Pergamon Press"
+, year =        1989
+, pages =       "111--114"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{m-gdata-91
-, author =	"G. Miller"
-, title =	"Goal-directed animation of tubular articulated figures or how snakes play golf"
-, editor =	"N. A. Badler and B. A. Barsky and D. Zeltzer"
-, booktitle =	"Making Them Move: Mechanics, Control, and Animation of Articulated Figures"
-, publisher =	"Morgan Kaufmann Publishers"
-, address =	"San Mateo, CA"
-, year =	1991
-, pages =	"233--241"
-, update =	"97.11 bibrelex"
+, author =      "G. Miller"
+, title =       "Goal-directed animation of tubular articulated figures or how snakes play golf"
+, editor =      "N. A. Badler and B. A. Barsky and D. Zeltzer"
+, booktitle =   "Making Them Move: Mechanics, Control, and Animation of Articulated Figures"
+, publisher =   "Morgan Kaufmann Publishers"
+, address =     "San Mateo, CA"
+, year =        1991
+, pages =       "233--241"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{m-spgus-84
-, author =	"G. Miller"
-, title =	"Separating a Planar Graph Using a Simple Cycle"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, site =	"Washington, DC"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "G. Miller"
+, title =       "Separating a Planar Graph Using a Simple Cycle"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, site =        "Washington, DC"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-atgg-82
-, author =	"G. L. Miller"
-, title =	"An additivity theorem for the genus of a graph"
-, type =	"Manuscript"
-, institution =	"Dept. Math., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1982
+, author =      "G. L. Miller"
+, title =       "An additivity theorem for the genus of a graph"
+, type =        "Manuscript"
+, institution = "Dept. Math., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1982
 }
 
 @techreport{m-fsscs-85
-, author =	"G. L. Miller"
-, title =	"Finding small simple cycle separators for $2$-connected planar graphs"
-, type =	"Report"
-, number =	"85-336"
-, institution =	"Dept. Comput. Sci., Univ. Southern California"
-, address =	"Los Angeles, CA"
-, year =	1985
+, author =      "G. L. Miller"
+, title =       "Finding small simple cycle separators for $2$-connected planar graphs"
+, type =        "Report"
+, number =      "85-336"
+, institution = "Dept. Comput. Sci., Univ. Southern California"
+, address =     "Los Angeles, CA"
+, year =        1985
 }
 
 @article{m-fsscs-86
-, author =	"G. L. Miller"
-, title =	"Finding small simple cycle separators for 2-connected planar graphs"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	32
-, number =	3
-, year =	1986
-, pages =	"265--279"
-, update =	"97.11 bibrelex"
+, author =      "G. L. Miller"
+, title =       "Finding small simple cycle separators for 2-connected planar graphs"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      32
+, number =      3
+, year =        1986
+, pages =       "265--279"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{m-itgbg-80
-, author =	"G. L. Miller"
-, title =	"Isomorphism testing for graphs of bounded genus"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Theory Comput."
-, year =	1980
-, pages =	"225--235"
+, author =      "G. L. Miller"
+, title =       "Isomorphism testing for graphs of bounded genus"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Theory Comput."
+, year =        1980
+, pages =       "225--235"
 }
 
 @inproceedings{mr-ptcia-85
-, author =	"G. L. Miller and J. H. Reif"
-, title =	"Parallel Tree Contraction and its Applications"
-, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"478--489"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "G. L. Miller and J. H. Reif"
+, title =       "Parallel Tree Contraction and its Applications"
+, booktitle =   "Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "478--489"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{mttw-dbnmt-95
-, author =	"G. L. Miller and D. Talmor and S.-H. Teng and N. Walkington"
-, title =	"A {Delaunay} based numerical method for three dimensions: generation, formulation, and partition"
-, booktitle =	"Proc. 27th Annu. ACM Sympos. Theory Comput."
-, year =	1995
-, pages =	"683--692"
-, update =	"95.09 smid"
+, author =      "G. L. Miller and D. Talmor and S.-H. Teng and N. Walkington"
+, title =       "A {Delaunay} based numerical method for three dimensions: generation, formulation, and partition"
+, booktitle =   "Proc. 27th Annu. ACM Sympos. Theory Comput."
+, year =        1995
+, pages =       "683--692"
+, update =      "95.09 smid"
 }
 
 @inproceedings{mttww-cvmus-96
-, author =	"Gary L. Miller and Dafna Talmor and Shang-Hua Teng and Noel Walkington and Han Wang"
-, title =	"Control volume meshes using sphere packing: generation, refinement and coarsening"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"47--61"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Gary L. Miller and Dafna Talmor and Shang-Hua Teng and Noel Walkington and Han Wang"
+, title =       "Control volume meshes using sphere packing: generation, refinement and coarsening"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "47--61"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @techreport{mt-cppd-90
-, author =	"G. L. Miller and S.-H. Teng"
-, title =	"Center Points and Point Divisions"
-, type =	"Manuscript"
-, institution =	"School of Comput. Sci., Carnegie Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1990
-, update =	"98.03 bibrelex"
+, author =      "G. L. Miller and S.-H. Teng"
+, title =       "Center Points and Point Divisions"
+, type =        "Manuscript"
+, institution = "School of Comput. Sci., Carnegie Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1990
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{mttv-amp-92
-, author =	"G. L. Miller and S.-H. Teng and W. Thurston and S. A. Vavasis"
-, title =	"Automatic Mesh Partitioning"
-, booktitle =	"Proc. of the 1992 Workshop on Sparse Matrix Computations: Graph Theory Issues and Algorithms"
-, organization =	"Institute for Mathematics and its Applications"
-, year =	1992
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "G. L. Miller and S.-H. Teng and W. Thurston and S. A. Vavasis"
+, title =       "Automatic Mesh Partitioning"
+, booktitle =   "Proc. of the 1992 Workshop on Sparse Matrix Computations: Graph Theory Issues and Algorithms"
+, organization =        "Institute for Mathematics and its Applications"
+, year =        1992
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @article{mttv-gsfem-95
-, author =	"G. L. Miller and S.-H. Teng and W. Thurston and S. A. Vavasis"
-, title =	"Geometric separators for finite element meshes"
-, journal =	"SIAM J. Sci. Comput."
-, volume =	"??"
-, year =	1995
-, note =	"Submitted"
-, update =	"97.11 bibrelex"
+, author =      "G. L. Miller and S.-H. Teng and W. Thurston and S. A. Vavasis"
+, title =       "Geometric separators for finite element meshes"
+, journal =     "SIAM J. Sci. Comput."
+, volume =      "??"
+, year =        1995
+, note =        "Submitted"
+, update =      "97.11 bibrelex"
 }
 
 @article{mttv-sspnn-97
-, author =	"G. L. Miller and S.-H. Teng and W. Thurston and S. A. Vavasis"
-, title =	"Separators for sphere-packings and nearest neighbor graphs"
-, journal =	"J. ACM"
-, volume =	44
-, year =	1997
-, pages =	"1--29"
-, update =	"97.07 smid"
+, author =      "G. L. Miller and S.-H. Teng and W. Thurston and S. A. Vavasis"
+, title =       "Separators for sphere-packings and nearest neighbor graphs"
+, journal =     "J. ACM"
+, volume =      44
+, year =        1997
+, pages =       "1--29"
+, update =      "97.07 smid"
 }
 
 @inproceedings{mtv-ugags-91
-, author =	"G. L. Miller and S.-H. Teng and S. A. Vavasis"
-, title =	"An unified geometric approach to graph separators"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"538--547"
-, update =	"97.11 bibrelex"
+, author =      "G. L. Miller and S.-H. Teng and S. A. Vavasis"
+, title =       "An unified geometric approach to graph separators"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "538--547"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{mt-sttd-90
-, author =	"Gary L. Miller and William Thurston"
-, title =	"Separators in Two and Three Dimensions"
-, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
-, year =	1990
-, pages =	"300--309"
-, update =	"97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "Gary L. Miller and William Thurston"
+, title =       "Separators in Two and Three Dimensions"
+, booktitle =   "Proc. 22nd Annu. ACM Sympos. Theory Comput."
+, year =        1990
+, pages =       "300--309"
+, update =      "97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{mv-dgs-91
-, author =	"G. L. Miller and S. A. Vavasis"
-, title =	"An unified geometric approach to graph separators"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"331--336"
-, update =	"98.03 bibrelex"
+, author =      "G. L. Miller and S. A. Vavasis"
+, title =       "An unified geometric approach to graph separators"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "331--336"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{mv-dgs-90
-, author =	"G. L. Miller and S. A. Vavasis"
-, title =	"Density graphs and separators"
-, type =	"Technical {Report}"
-, number =	"90-1169"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "G. L. Miller and S. A. Vavasis"
+, title =       "Density graphs and separators"
+, type =        "Technical {Report}"
+, number =      "90-1169"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @article{m-ganqs-87
-, author =	"J. R. Miller"
-, title =	"Geometric approaches to nonplanar quadric surface intersection curves"
-, journal =	"ACM Trans. Graph."
-, volume =	6
-, year =	1987
-, pages =	"274--307"
+, author =      "J. R. Miller"
+, title =       "Geometric approaches to nonplanar quadric surface intersection curves"
+, journal =     "ACM Trans. Graph."
+, volume =      6
+, year =        1987
+, pages =       "274--307"
 }
 
 @techreport{ms-eracu-91
-, author =	"N. Miller and M. Sharir"
-, title =	"Efficient randomized algorithms for constructing the union of fat triangles and of pseudo-disks"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "N. Miller and M. Sharir"
+, title =       "Efficient randomized algorithms for constructing the union of fat triangles and of pseudo-disks"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @unpublished{nm-eracu-
-, author =	"N. Miller and Micha Sharir"
-, title =	"Efficient randomized algorithms for constructing the union of fat triangles and pseudodiscs"
-, note =	"Unpublished manuscript"
-, precedes =	"ms-ericu-91"
-, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 schwarzkopf"
+, author =      "N. Miller and Micha Sharir"
+, title =       "Efficient randomized algorithms for constructing the union of fat triangles and pseudodiscs"
+, note =        "Unpublished manuscript"
+, precedes =    "ms-ericu-91"
+, update =      "98.11 bibrelex, 98.03 mitchell, 97.03 schwarzkopf"
 }
 
 @techreport{ms-ericu-91
-, author =	"N. Miller and M. Sharir"
-, title =	"Efficient randomized incremental construction of the union of fat triangles"
-, type =	"manuscript"
-, year =	1991
-, succeeds =	"nm-eracu-"
-, update =	"98.11 bibrelex"
+, author =      "N. Miller and M. Sharir"
+, title =       "Efficient randomized incremental construction of the union of fat triangles"
+, type =        "manuscript"
+, year =        1991
+, succeeds =    "nm-eracu-"
+, update =      "98.11 bibrelex"
 }
 
 @phdthesis{m-pca-85
-, author =	"R. Miller"
-, title =	"Pyramid Computer Algorithms"
-, school =	"State Univ. New York"
-, address =	"Binghamton"
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "R. Miller"
+, title =       "Pyramid Computer Algorithms"
+, school =      "State Univ. New York"
+, address =     "Binghamton"
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ms-cgmcc-84
-, author =	"R. Miller and Q. F. Stout"
-, title =	"Computational geometry on a mesh connected computer"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, year =	1984
-, pages =	"66--73"
-, update =	"93.05 devillers"
+, author =      "R. Miller and Q. F. Stout"
+, title =       "Computational geometry on a mesh connected computer"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, year =        1984
+, pages =       "66--73"
+, update =      "93.05 devillers"
 }
 
 @article{ms-ccpip-91
-, author =	"R. Miller and Q. F. Stout"
-, title =	"Computing convexity properties of images on a pyramid computer"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"658--684"
-, succeeds =	"ms-pcadg-85"
+, author =      "R. Miller and Q. F. Stout"
+, title =       "Computing convexity properties of images on a pyramid computer"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "658--684"
+, succeeds =    "ms-pcadg-85"
 }
 
 @inproceedings{ms-capc-84
-, author =	"R. Miller and Q. F. Stout"
-, title =	"Convexity algorithms for pyramid computers"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, year =	1984
-, pages =	"177--184"
-, update =	"97.11 bibrelex"
+, author =      "R. Miller and Q. F. Stout"
+, title =       "Convexity algorithms for pyramid computers"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, year =        1984
+, pages =       "177--184"
+, update =      "97.11 bibrelex"
 }
 
 @misc{ms-dmtpc-
-, author =	"R. Miller and Q. F. Stout"
-, title =	"Data movement techniques for the pyramid computer"
-, howpublished =	"Submitted"
-, update =	"97.11 bibrelex"
+, author =      "R. Miller and Q. F. Stout"
+, title =       "Data movement techniques for the pyramid computer"
+, howpublished =        "Submitted"
+, update =      "97.11 bibrelex"
 }
 
 @article{ms-epcha-88
-, author =	"R. Miller and Q. F. Stout"
-, title =	"Efficient parallel convex hull algorithms"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-37"
-, number =	12
-, year =	1988
-, pages =	"1605--1618"
-, update =	"93.05 devillers"
+, author =      "R. Miller and Q. F. Stout"
+, title =       "Efficient parallel convex hull algorithms"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-37"
+, number =      12
+, year =        1988
+, pages =       "1605--1618"
+, update =      "93.05 devillers"
 }
 
 @article{ms-gadpm-85
-, author =	"R. Miller and Q. F. Stout"
-, title =	"Geometric algorithms for digitized pictures on a mesh-connected computer"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-7"
-, year =	1985
-, pages =	"216--228"
-, update =	"97.11 bibrelex"
+, author =      "R. Miller and Q. F. Stout"
+, title =       "Geometric algorithms for digitized pictures on a mesh-connected computer"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-7"
+, year =        1985
+, pages =       "216--228"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ms-ipmcc-85
-, author =	"R. Miller and Q. F. Stout"
-, title =	"Intersection problems on a mesh-connected computer"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., State Univ. New York Buffalo"
-, address =	"Buffalo, NY"
-, year =	1985
+, author =      "R. Miller and Q. F. Stout"
+, title =       "Intersection problems on a mesh-connected computer"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., State Univ. New York Buffalo"
+, address =     "Buffalo, NY"
+, year =        1985
 }
 
 @techreport{ms-mcacg-86
-, author =	"R. Miller and Q. F. Stout"
-, title =	"Mesh computer algorithms for computational geometry"
-, type =	"Report"
-, number =	"86-18"
-, institution =	"Dept. Comput. Sci., State Univ. New York Buffalo"
-, address =	"Buffalo, NY"
-, year =	1986
+, author =      "R. Miller and Q. F. Stout"
+, title =       "Mesh computer algorithms for computational geometry"
+, type =        "Report"
+, number =      "86-18"
+, institution = "Dept. Comput. Sci., State Univ. New York Buffalo"
+, address =     "Buffalo, NY"
+, year =        1986
 }
 
 @article{ms-mcacg-89
-, author =	"R. Miller and Q. F. Stout"
-, title =	"Mesh Computer Algorithms for Computational Geometry"
-, journal =	"IEEE Trans. Comput."
-, volume =	38
-, number =	3
-, month =	mar
-, year =	1989
-, pages =	"321--340"
-, update =	"93.09 held"
+, author =      "R. Miller and Q. F. Stout"
+, title =       "Mesh Computer Algorithms for Computational Geometry"
+, journal =     "IEEE Trans. Comput."
+, volume =      38
+, number =      3
+, month =       mar
+, year =        1989
+, pages =       "321--340"
+, update =      "93.09 held"
 }
 
 @inproceedings{ms-pcadg-85
-, author =	"R. Miller and Q. F. Stout"
-, title =	"Pyramid computer algorithms for determining geometric properties of images"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"263--271"
-, precedes =	"ms-ccpip-91"
-, cites =	"as-mpabu-84, d-fpacp-80, m-pca-85, ms-capc-84, ms-dmtpc-, ms-cgmcc-84, ms-gadpm-85, ns-fccco-80, pu-mipa-82, r-dsls-74, s-pcpbg-81, s-ppmpe-, s-dslpc-82, s-smsft-83, s-pcscp-85, s-mpcig-85, t-pthpi-82, tk-scvmp-80, tk-smcpc-77, u-lrcnt-72, u-cav-84, vk-mnecd-82, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "R. Miller and Q. F. Stout"
+, title =       "Pyramid computer algorithms for determining geometric properties of images"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "263--271"
+, precedes =    "ms-ccpip-91"
+, cites =       "as-mpabu-84, d-fpacp-80, m-pca-85, ms-capc-84, ms-dmtpc-, ms-cgmcc-84, ms-gadpm-85, ns-fccco-80, pu-mipa-82, r-dsls-74, s-pcpbg-81, s-ppmpe-, s-dslpc-82, s-smsft-83, s-pcscp-85, s-mpcig-85, t-pthpi-82, tk-scvmp-80, tk-smcpc-77, u-lrcnt-72, u-cav-84, vk-mnecd-82, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{m-casp-94
-, author =	"Robert D. Miller"
-, title =	"Computing the Area of a Spherical Polygon"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"132--137"
-, keywords =	"cartography, Earth"
-, update =	"94.09 heckbert"
-, annote =	"Gives the formulas needed to find the area of a polygon on
+, author =      "Robert D. Miller"
+, title =       "Computing the Area of a Spherical Polygon"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "132--137"
+, keywords =    "cartography, Earth"
+, update =      "94.09 heckbert"
+, annote =      "Gives the formulas needed to find the area of a polygon on
 a sphere that is bounded by great circle arcs. This is useful in
 cartography. Contains C code."
 }
 
 @techreport{mi-epodm-??
-, author =	"S. W. Miller and S. S. Iyengar"
-, title =	"Efficient polygon overlay for dense map image data sets"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
+, author =      "S. W. Miller and S. S. Iyengar"
+, title =       "Efficient polygon overlay for dense map image data sets"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
 }
 
 @book{m-sgta-72
-, author =	"W. Miller"
-, title =	"Symmetry Groups and their Application"
-, publisher =	"Academic Press"
-, year =	1972
-, update =	"97.11 bibrelex"
+, author =      "W. Miller"
+, title =       "Symmetry Groups and their Application"
+, publisher =   "Academic Press"
+, year =        1972
+, update =      "97.11 bibrelex"
 }
 
 @book{mw-srama-80
-, author =	"W. Miller and C. Wrathall"
-, title =	"Software for Roundoff Analysis of Matrix Algorithms"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1980
-, update =	"98.03 bibrelex"
+, author =      "W. Miller and C. Wrathall"
+, title =       "Software for Roundoff Analysis of Matrix Algorithms"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1980
+, update =      "98.03 bibrelex"
 }
 
 @article{mo-ncmme-85
-, author =	"Z. Miller and J. B. Orlin"
-, title =	"{NP}-Completeness for Minimizing Maximum Edge Length in Grid Embeddings"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	"10--16"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "Z. Miller and J. B. Orlin"
+, title =       "{NP}-Completeness for Minimizing Maximum Edge Length in Grid Embeddings"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "10--16"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{m-krp3s-94
-, author =	"Kenneth C. Millett"
-, title =	"Knotting of regular polygons in $3$-space"
-, journal =	"J. Knot Theory Ramifications"
-, volume =	3
-, number =	3
-, year =	1994
-, pages =	"263--278"
-, update =	"02.03 orourke"
+, author =      "Kenneth C. Millett"
+, title =       "Knotting of regular polygons in $3$-space"
+, journal =     "J. Knot Theory Ramifications"
+, volume =      3
+, number =      3
+, year =        1994
+, pages =       "263--278"
+, update =      "02.03 orourke"
 }
 
 @inproceedings{m-sdss-73
-, author =	"W. Mills"
-, title =	"Some {Davenport--Schinzel} sequences"
-, editor =	"R. Thomas and H. Williams"
-, booktitle =	"Congressus Numer. IX: Proc. 3rd Manitoba Conf. on Numer. Math. and Computing"
-, year =	1973
-, pages =	"307--313"
-, update =	"95.09 agarwal"
+, author =      "W. Mills"
+, title =       "Some {Davenport--Schinzel} sequences"
+, editor =      "R. Thomas and H. Williams"
+, booktitle =   "Congressus Numer. IX: Proc. 3rd Manitoba Conf. on Numer. Math. and Computing"
+, year =        1973
+, pages =       "307--313"
+, update =      "95.09 agarwal"
 }
 
 @article{m-hgf15-82
-, author =	"J. W. Milnor"
-, title =	"Hyperbolic geometry: the first 150 years"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	6
-, number =	1
-, year =	1982
-, pages =	"9--24"
-, update =	"98.07 agarwal"
+, author =      "J. W. Milnor"
+, title =       "Hyperbolic geometry: the first 150 years"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      6
+, number =      1
+, year =        1982
+, pages =       "9--24"
+, update =      "98.07 agarwal"
 }
 
 @book{m-mt-63
-, author =	"John W. Milnor"
-, title =	"Morse Theory"
-, publisher =	"Princeton University Press"
-, address =	"Princeton, NJ"
-, year =	1963
-, update =	"98.03 agarwal+bibrelex"
+, author =      "John W. Milnor"
+, title =       "Morse Theory"
+, publisher =   "Princeton University Press"
+, address =     "Princeton, NJ"
+, year =        1963
+, update =      "98.03 agarwal+bibrelex"
 }
 
 @article{m-bnrav-64
-, author =	"J. W. Milnor"
-, title =	"On the {Betti} numbers of real algebraic varieties"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	15
-, year =	1964
-, pages =	"275--280"
-, update =	"98.07 agarwal, 95.01 matousek"
+, author =      "J. W. Milnor"
+, title =       "On the {Betti} numbers of real algebraic varieties"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      15
+, year =        1964
+, pages =       "275--280"
+, update =      "98.07 agarwal, 95.01 matousek"
 }
 
 @unpublished{mv-psafs-86
-, author =	"L. S. Milor and V. Visvanathan"
-, title =	"Preliminary studies on analog fault signature calculation"
-, year =	1986
-, note =	"Manuscript in preparation"
-, update =	"98.03 bibrelex"
+, author =      "L. S. Milor and V. Visvanathan"
+, title =       "Preliminary studies on analog fault signature calculation"
+, year =        1986
+, note =        "Manuscript in preparation"
+, update =      "98.03 bibrelex"
 }
 
 @article{msvt-cmic-94
-, author =	"P. B. Miltersen and S. Sairam and J. S. Vitter and R. Tamassia"
-, title =	"Complexity Models for Incremental Computation"
-, journal =	"Theoret. Comput. Sci."
-, volume =	130
-, year =	1994
-, pages =	"203--236"
-, keywords =	"dynamic computation, complexity theory"
-, succeeds =	"svt-ctaic-93"
-, update =	"95.01 tamassia, 94.05 tamassia"
+, author =      "P. B. Miltersen and S. Sairam and J. S. Vitter and R. Tamassia"
+, title =       "Complexity Models for Incremental Computation"
+, journal =     "Theoret. Comput. Sci."
+, volume =      130
+, year =        1994
+, pages =       "203--236"
+, keywords =    "dynamic computation, complexity theory"
+, succeeds =    "svt-ctaic-93"
+, update =      "95.01 tamassia, 94.05 tamassia"
 }
 
 @inproceedings{mb-ismga-96
-, author =	"Lai Mingwu and Steven E. Benzley"
-, title =	"An improved sweeping method for generating all hexahedral finite element meshes"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"217--225"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Lai Mingwu and Steven E. Benzley"
+, title =       "An improved sweeping method for generating all hexahedral finite element meshes"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "217--225"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @article{m-aludk-97
-, author =	"H. Minkowski"
-, title =	"Allgemeine {Lehrs{\"a}tze} {\"u}ber die konvexen {Polyeder}"
-, journal =	"Nachr. Ges. Wiss. G{\"o}ttingen"
-, volume =	"??"
-, year =	1897
-, pages =	"198--219"
-, update =	"97.11 bibrelex"
+, author =      "H. Minkowski"
+, title =       "Allgemeine {Lehrs{\"a}tze} {\"u}ber die konvexen {Polyeder}"
+, journal =     "Nachr. Ges. Wiss. G{\"o}ttingen"
+, volume =      "??"
+, year =        1897
+, pages =       "198--219"
+, update =      "97.11 bibrelex"
 }
 
 @article{m-vuo-03
-, author =	"H. Minkowski"
-, title =	"Volumen und {Oberfl{\"a}chen}"
-, journal =	"Math. Ann."
-, volume =	57
-, year =	1903
-, pages =	"447--495"
-, update =	"98.03 bibrelex"
+, author =      "H. Minkowski"
+, title =       "Volumen und {Oberfl{\"a}chen}"
+, journal =     "Math. Ann."
+, volume =      57
+, year =        1903
+, pages =       "447--495"
+, update =      "98.03 bibrelex"
 }
 
 @book{m-mpta-86
-, author =	"M. Minoux"
-, title =	"Mathematical programming-theory and algorithms"
-, publisher =	"John Wiley \& Sons"
-, address =	"Chichester, UK"
-, year =	1986
-, update =	"99.11 bibrelex, 97.11 bibrelex"
+, author =      "M. Minoux"
+, title =       "Mathematical programming-theory and algorithms"
+, publisher =   "John Wiley \& Sons"
+, address =     "Chichester, UK"
+, year =        1986
+, update =      "99.11 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{mag-adcma-98
-, author =	"Darka Mioc and Fran{\c c}ois Anton and Christopher M. Gold"
-, title =	"An Algorithm for the Dynamic Construction and Maintenance of Additively Weighted {Voronoi} Diagrams"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"117--119"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Darka Mioc and Fran{\c c}ois Anton and Christopher M. Gold"
+, title =       "An Algorithm for the Dynamic Construction and Maintenance of Additively Weighted {Voronoi} Diagrams"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "117--119"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{mw-rsact-82
-, author =	"A. Mirante and N. Weingarten"
-, title =	"The Radial Sweep Algorithm for Constructing Triangulated Irreguler Networks"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	"??"
-, month =	may
-, year =	1982
-, pages =	"11--21"
-, annote =	"Triangulation of a set of point. Selects an internal
-		 point and joins it to all other points and then
-		 completes triangulation by proceeding around the
-		 boundary. Triangulation is improved by switchings
-		 picking the shorter diagonal."
+, author =      "A. Mirante and N. Weingarten"
+, title =       "The Radial Sweep Algorithm for Constructing Triangulated Irreguler Networks"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      "??"
+, month =       may
+, year =        1982
+, pages =       "11--21"
+, annote =      "Triangulation of a set of point. Selects an internal
+                 point and joins it to all other points and then
+                 completes triangulation by proceeding around the
+                 boundary. Triangulation is improved by switchings
+                 picking the shorter diagonal."
 }
 
 @book{mf-dlt-90
-, editor =	"P. B. Mirchandani and R. L. Francis"
-, booktitle =	"Discrete Location Theory"
-, publisher =	"John Wiley \& Sons"
-, year =	1990
-, pages =	"xvi+555"
-, keywords =	"facility location"
-, update =	"99.11 bibrelex, 95.09 korneenko"
+, editor =      "P. B. Mirchandani and R. L. Francis"
+, booktitle =   "Discrete Location Theory"
+, publisher =   "John Wiley \& Sons"
+, year =        1990
+, pages =       "xvi+555"
+, keywords =    "facility location"
+, update =      "99.11 bibrelex, 95.09 korneenko"
 }
 
 @inproceedings{mht-iaagl-93
-, author =	"K. Miriyala and S. W. Hornick and R. Tamassia"
-, title =	"An Incremental Approach to Aesthetic Graph Layout"
-, booktitle =	"Proc. Internat. Workshop on Computer-Aided Software Engineering"
-, nickname =	"CASE '93"
-, year =	1993
-, update =	"94.01 tamassia"
+, author =      "K. Miriyala and S. W. Hornick and R. Tamassia"
+, title =       "An Incremental Approach to Aesthetic Graph Layout"
+, booktitle =   "Proc. Internat. Workshop on Computer-Aided Software Engineering"
+, nickname =    "CASE '93"
+, year =        1993
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{m-cmga-94
-, author =	"C. Mirolo"
-, title =	"Convex Minimization on a Grid and Applications"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"314--319"
-, cites =	"c-cdfdi-90, c-cdmp-86, cd-icott-87, dk-fdpi-83, dk-dsppu-90, dhks-isccd-90, egs-oplms-86, gf-cdgco-90, gw-dadpi-91, mp-smsra-89, ny-pcmeo-83, sk-ccmpc-92, ssk-cdmpp-93, m-pacdc-94, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "C. Mirolo"
+, title =       "Convex Minimization on a Grid and Applications"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "314--319"
+, cites =       "c-cdfdi-90, c-cdmp-86, cd-icott-87, dk-fdpi-83, dk-dsppu-90, dhks-isccd-90, egs-oplms-86, gf-cdgco-90, gw-dadpi-91, mp-smsra-89, ny-pcmeo-83, sk-ccmpc-92, ssk-cdmpp-93, m-pacdc-94, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @mastersthesis{m-pacdc-94
-, author =	"C. Mirolo"
-, title =	"Polylogarithmic Algorithms for Collision Detection based on Convex Minimization"
-, number =	"UDMI/01/94/RR"
-, school =	"Univ. di Udine"
-, month =	jan
-, year =	1994
-, note =	"Dip. di Matematica e Informatica"
-, keywords =	"master thesis"
-, update =	"98.11 bibrelex"
+, author =      "C. Mirolo"
+, title =       "Polylogarithmic Algorithms for Collision Detection based on Convex Minimization"
+, number =      "UDMI/01/94/RR"
+, school =      "Univ. di Udine"
+, month =       jan
+, year =        1994
+, note =        "Dip. di Matematica e Informatica"
+, keywords =    "master thesis"
+, update =      "98.11 bibrelex"
 }
 
 @article{mp-smsra-89
-, author =	"C. Mirolo and E. Pagello"
-, title =	"A Solid Modeling System for Robot Action Planning"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	9
-, number =	1
-, year =	1989
-, pages =	"55--69"
-, update =	"98.11 bibrelex"
+, author =      "C. Mirolo and E. Pagello"
+, title =       "A Solid Modeling System for Robot Action Planning"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      9
+, number =      1
+, year =        1989
+, pages =       "55--69"
+, update =      "98.11 bibrelex"
 }
 
 @article{m-facpm-96
-, author =	"B. Mirtich"
-, title =	"Fast and Accurate Computation of Polyhedral Mass Properties"
-, journal =	"J. Graphics Tools"
-, volume =	1
-, number =	2
-, year =	1996
-, pages =	"31--50"
-, update =	"97.11 held"
+, author =      "B. Mirtich"
+, title =       "Fast and Accurate Computation of Polyhedral Mass Properties"
+, journal =     "J. Graphics Tools"
+, volume =      1
+, number =      2
+, year =        1996
+, pages =       "31--50"
+, update =      "97.11 held"
 }
 
 @inproceedings{m-hscci-95
-, author =	"B. Mirtich"
-, title =	"Hybrid Simulation: Combining constraints and impulses"
-, booktitle =	"Workshop on Simulation and Interaction in Virtual Environments"
-, organization =	"Office of Naval Research"
-, month =	jul
-, year =	1995
-, pages =	"153--158"
-, update =	"97.11 bibrelex"
+, author =      "B. Mirtich"
+, title =       "Hybrid Simulation: Combining constraints and impulses"
+, booktitle =   "Workshop on Simulation and Interaction in Virtual Environments"
+, organization =        "Office of Naval Research"
+, month =       jul
+, year =        1995
+, pages =       "153--158"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-vfrpc-97
-, author =	"B. Mirtich"
-, title =	"{V-Clip}: {Fast} and Robust Polyhedral Collision Detection"
-, number =	"TR97-05"
-, institution =	"MERL"
-, address =	"201 Broadway, Cambridge, MA 02139, USA"
-, month =	jul
-, year =	1997
-, update =	"98.03 mitchell"
-, annote =	"URL: http://www.merl.com/reports/TR97-05/index.html;
+, author =      "B. Mirtich"
+, title =       "{V-Clip}: {Fast} and Robust Polyhedral Collision Detection"
+, number =      "TR97-05"
+, institution = "MERL"
+, address =     "201 Broadway, Cambridge, MA 02139, USA"
+, month =       jul
+, year =        1997
+, update =      "98.03 mitchell"
+, annote =      "URL: http://www.merl.com/reports/TR97-05/index.html;
                   submitted to ACM ToG"
-, abstract =	"
+, abstract =    "
 This paper presents the Voronoi-clip, or V-clip, collision detection algorithm
 for polyhedral objects specified by a boundary representation.  V-clip tracks
 the closest pair of features between convex polyhedra, using an approach
@@ -105744,1290 +105744,1290 @@ @techreport{m-vfrpc-97
 }
 
 @article{m-vcfrp-98
-, author =	"B. Mirtich"
-, title =	"V-Clip: Fast and Robust Polyhedral Collision Detection"
-, journal =	"ACM Trans. Graph."
-, volume =	17
-, number =	3
-, month =	jul
-, year =	1998
-, pages =	"177--208"
-, succeeds =	"m-vfrpc-97"
-, update =	"99.03 held"
+, author =      "B. Mirtich"
+, title =       "V-Clip: Fast and Robust Polyhedral Collision Detection"
+, journal =     "ACM Trans. Graph."
+, volume =      17
+, number =      3
+, month =       jul
+, year =        1998
+, pages =       "177--208"
+, succeeds =    "m-vfrpc-97"
+, update =      "99.03 held"
 }
 
 @incollection{mc-ibds-95
-, author =	"B. Mirtich and J. Canny"
-, title =	"Impulse-based dynamic simulation"
-, editor =	"K. Goldberg and D. Halperin and J.-C. Latombe and R. Wilson"
-, booktitle =	"The Algorithmic Foundations of Robotics"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1995
-, update =	"99.11 bibrelex, 98.07 agarwal, 97.11 bibrelex"
+, author =      "B. Mirtich and J. Canny"
+, title =       "Impulse-based dynamic simulation"
+, editor =      "K. Goldberg and D. Halperin and J.-C. Latombe and R. Wilson"
+, booktitle =   "The Algorithmic Foundations of Robotics"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1995
+, update =      "99.11 bibrelex, 98.07 agarwal, 97.11 bibrelex"
 }
 
 @inproceedings{mc-ibsrb-95
-, author =	"B. Mirtich and J. Canny"
-, title =	"Impulse-based simulation of rigid bodies"
-, booktitle =	"Symposium on Interactive 3D Graphics"
-, site =	"New York"
-, publisher =	"ACM Press"
-, year =	1995
-, update =	"97.11 bibrelex"
+, author =      "B. Mirtich and J. Canny"
+, title =       "Impulse-based simulation of rigid bodies"
+, booktitle =   "Symposium on Interactive 3D Graphics"
+, site =        "New York"
+, publisher =   "ACM Press"
+, year =        1995
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{mc-tcsti-96
-, author =	"Brian Mirtich and John Canny"
-, title =	"Testing control systems through impulse-based simulation"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"V5--V6"
-, cites =	"f-crdua-83, g-cbnnn-94, hwbo-aha-95, l-ecdar-93, mz-dsall-90, m-gdata-91, m-hscci-95, mc-ibds-95, mc-ibsrb-95, o-plfs-92, rh-adll-91, r-fhsdb-87, s-evc-94, tt-afplp-94, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Brian Mirtich and John Canny"
+, title =       "Testing control systems through impulse-based simulation"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "V5--V6"
+, cites =       "f-crdua-83, g-cbnnn-94, hwbo-aha-95, l-ecdar-93, mz-dsall-90, m-gdata-91, m-hscci-95, mc-ibds-95, mc-ibsrb-95, o-plfs-92, rh-adll-91, r-fhsdb-87, s-evc-94, tt-afplp-94, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{mc-usnpp-92
-, author =	"Brian Mirtich and John Canny"
-, title =	"Using Skeletons for Nonholonomic Path Planning Among Obstacles"
-, booktitle =	"Proc. 9th IEEE Internat. Conf. Robot. Autom."
-, year =	1992
-, pages =	"2533--2540"
-, update =	"98.03 mitchell"
+, author =      "Brian Mirtich and John Canny"
+, title =       "Using Skeletons for Nonholonomic Path Planning Among Obstacles"
+, booktitle =   "Proc. 9th IEEE Internat. Conf. Robot. Autom."
+, year =        1992
+, pages =       "2533--2540"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{m-cpdls-90
-, author =	"A. Mirzaian"
-, title =	"Circumscribing polygon of disjoint line segments"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"319--323"
-, cites =	"agss-ltacv-89, gt-ltafm-88, g-eadch-72, ms-fmapp-89, r-cscsl-87, rit-cscsl-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "A. Mirzaian"
+, title =       "Circumscribing polygon of disjoint line segments"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "319--323"
+, cites =       "agss-ltacv-89, gt-ltafm-88, g-eadch-72, ms-fmapp-89, r-cscsl-87, rit-cscsl-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{m-htcpd-92
-, author =	"A. Mirzaian"
-, title =	"Hamiltonian triangulations and circumscribing polygons of disjoint line segments"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	1
-, year =	1992
-, pages =	"15--30"
+, author =      "A. Mirzaian"
+, title =       "Hamiltonian triangulations and circumscribing polygons of disjoint line segments"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      1
+, year =        1992
+, pages =       "15--30"
 }
 
 @inproceedings{m-mwemw-93
-, author =	"Andy Mirzaian"
-, title =	"Minimum Weight {Euclidean} Matching and Weighted Relative Neighborhood Graphs"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"506--517"
-, update =	"96.05 agarwal, 93.09 smid, 93.05 jones"
+, author =      "Andy Mirzaian"
+, title =       "Minimum Weight {Euclidean} Matching and Weighted Relative Neighborhood Graphs"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "506--517"
+, update =      "96.05 agarwal, 93.09 smid, 93.05 jones"
 }
 
 @techreport{m-tsppt-88
-, author =	"A. Mirzaian"
-, title =	"Triangulating simple polygons: pseudo-triangulations"
-, type =	"Technical {Report}"
-, number =	"CS-88-12"
-, institution =	"Dept. Comput. Sci., York Univ."
-, address =	"Toronto, ON"
-, month =	sep
-, year =	1988
-, annote =	"``We propose the new concept of {\em
-		 pseudo-triangulation}, a generalized version of
-		 triangulation, in which the member triangles need not
-		 all have the same orientation. In this paper we explore
-		 some combinatorial and topological properties of
-		 pseudo-triangulations.''"
+, author =      "A. Mirzaian"
+, title =       "Triangulating simple polygons: pseudo-triangulations"
+, type =        "Technical {Report}"
+, number =      "CS-88-12"
+, institution = "Dept. Comput. Sci., York Univ."
+, address =     "Toronto, ON"
+, month =       sep
+, year =        1988
+, annote =      "``We propose the new concept of {\em
+                 pseudo-triangulation}, a generalized version of
+                 triangulation, in which the member triangles need not
+                 all have the same orientation. In this paper we explore
+                 some combinatorial and topological properties of
+                 pseudo-triangulations.''"
 }
 
 @inproceedings{mwx-slst-96
-, author =	"A. Mirzaian and C. A. Wang and Y.-F. Xu"
-, title =	"On stable line segments in triangulations"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"62--67"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "A. Mirzaian and C. A. Wang and Y.-F. Xu"
+, title =       "On stable line segments in triangulations"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "62--67"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @incollection{m-crag-97
-, author =	"B. Mishra"
-, title =	"Computational real algebraic geometry"
-, chapter =	29
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"537--558"
-, update =	"97.11 orourke"
+, author =      "B. Mishra"
+, title =       "Computational real algebraic geometry"
+, chapter =     29
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "537--558"
+, update =      "97.11 orourke"
 }
 
 @inproceedings{m-wap-91
-, author =	"B. Mishra"
-, title =	"Workholding: {Analysis} and planning"
-, booktitle =	"Proc. IEEE/RSJ Internat. Conf. Intell. Robots Syst."
-, month =	jul
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "B. Mishra"
+, title =       "Workholding: {Analysis} and planning"
+, booktitle =   "Proc. IEEE/RSJ Internat. Conf. Intell. Robots Syst."
+, month =       jul
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @article{mss-esmpg-87
-, author =	"B. Mishra and J. T. Schwartz and Micha Sharir"
-, title =	"On the existence and synthesis of multifinger positive grips"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"541--558"
-, keywords =	"robot grasping, convex hull"
-, update =	"98.03 mitchell"
+, author =      "B. Mishra and J. T. Schwartz and Micha Sharir"
+, title =       "On the existence and synthesis of multifinger positive grips"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "541--558"
+, keywords =    "robot grasping, convex hull"
+, update =      "98.03 mitchell"
 }
 
 @article{ms-sdsgi-89
-, author =	"B. Mishra and N. Silver"
-, title =	"Some discussion of static gripping and its stabiliy"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	19
-, number =	4
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "B. Mishra and N. Silver"
+, title =       "Some discussion of static gripping and its stabiliy"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      19
+, number =      4
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @techreport{my-ngb-86
-, author =	"B. Mishra and C. K. Yap"
-, title =	"Notes on {Gr{\"o}bner} bases"
-, type =	"Technical {Report}"
-, number =	257
-, institution =	"Dept. Comput. Sci., New York. Univ."
-, address =	"New York, NY"
-, month =	sep
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "B. Mishra and C. K. Yap"
+, title =       "Notes on {Gr{\"o}bner} bases"
+, type =        "Technical {Report}"
+, number =      257
+, institution = "Dept. Comput. Sci., New York. Univ."
+, address =     "New York, NY"
+, month =       sep
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{mg-fre-82
-, author =	"J. Misra and D. Gries"
-, title =	"Finding repeated elements"
-, journal =	"Sc. Comp. Prog."
-, volume =	2
-, year =	1982
-, pages =	"143--152"
-, update =	"98.07 bibrelex"
+, author =      "J. Misra and D. Gries"
+, title =       "Finding repeated elements"
+, journal =     "Sc. Comp. Prog."
+, volume =      2
+, year =        1982
+, pages =       "143--152"
+, update =      "98.07 bibrelex"
 }
 
 @article{mels-lamm-95
-, author =	"K. Misue and Peter Eades and W. Lai and K. Sugiyama"
-, title =	"Layout Adjustment and the Mental Map"
-, journal =	"J. Visual Lang. Comput."
-, volume =	6
-, number =	2
-, year =	1995
-, pages =	"183--210"
-, update =	"98.07 tamassia+vismara"
+, author =      "K. Misue and Peter Eades and W. Lai and K. Sugiyama"
+, title =       "Layout Adjustment and the Mental Map"
+, journal =     "J. Visual Lang. Comput."
+, volume =      6
+, number =      2
+, year =        1995
+, pages =       "183--210"
+, update =      "98.07 tamassia+vismara"
 }
 
 @inproceedings{mha-asspg-95
-, author =	"Curtis R. Mitchell and Gary S. Hufford and Mahesh M. Athavale"
-, title =	"Automated Semi-Structured Prismatic Grids for Brush Seals Analysis"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"205--217"
-, update =	"96.01 samitchell"
+, author =      "Curtis R. Mitchell and Gary S. Hufford and Mahesh M. Athavale"
+, title =       "Automated Semi-Structured Prismatic Grids for Brush Seals Analysis"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "205--217"
+, update =      "96.01 samitchell"
 }
 
 @article{m-sosdr-91
-, author =	"D. P. Mitchell"
-, title =	"Spectrally optimal sampling for distribution ray tracing"
-, journal =	"Comput. Graph."
-, volume =	25
-, number =	4
-, year =	1991
-, pages =	"157--162"
-, note =	"Proc. SIGGRAPH '91"
-, update =	"98.03 bibrelex"
+, author =      "D. P. Mitchell"
+, title =       "Spectrally optimal sampling for distribution ray tracing"
+, journal =     "Comput. Graph."
+, volume =      25
+, number =      4
+, year =        1991
+, pages =       "157--162"
+, note =        "Proc. SIGGRAPH '91"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{m-carte-87
-, author =	"F. Mitchell"
-, title =	"A comparisom of adaptive refinement techniques for elliptic problems"
-, type =	"Report"
-, number =	"UIUCDCS-R-87-1375"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana-Champaign, IL"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "F. Mitchell"
+, title =       "A comparisom of adaptive refinement techniques for elliptic problems"
+, type =        "Report"
+, number =      "UIUCDCS-R-87-1375"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana-Champaign, IL"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-umafe-88
-, author =	"F. Mitchell"
-, title =	"Unified multilevel adaptive finite element methods for elliptic problems"
-, type =	"Report"
-, number =	"UIUCDCS-R-88-1446"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana-Champaign, IL"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "F. Mitchell"
+, title =       "Unified multilevel adaptive finite element methods for elliptic problems"
+, type =        "Report"
+, number =      "UIUCDCS-R-88-1446"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana-Champaign, IL"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-acvpp-90
-, author =	"J. Mitchell"
-, title =	"Algorithmic Computer Vision"
-, type =	"manuscript"
-, institution =	"The Probing Paradigm"
-, month =	nov
-, year =	1990
-, note =	"Workshop on Geometric Probing and Computer Vision"
-, update =	"98.11 bibrelex"
+, author =      "J. Mitchell"
+, title =       "Algorithmic Computer Vision"
+, type =        "manuscript"
+, institution = "The Probing Paradigm"
+, month =       nov
+, year =        1990
+, note =        "Workshop on Geometric Probing and Computer Vision"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{m-aagop-97
-, author =	"Joseph Mitchell"
-, title =	"Approximation Algorithms for Geometric Optimization Problems"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"229--232"
-, update =	"97.11 jones"
+, author =      "Joseph Mitchell"
+, title =       "Approximation Algorithms for Geometric Optimization Problems"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "229--232"
+, update =      "97.11 jones"
 }
 
 @techreport{m-naspo-88
-, author =	"Joseph S. B. Mitchell"
-, title =	"A new algorithm for shortest paths among obstacles in the plane"
-, type =	"Technical {Report}"
-, number =	832
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	oct
-, year =	1988
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Joseph S. B. Mitchell"
+, title =       "A new algorithm for shortest paths among obstacles in the plane"
+, type =        "Technical {Report}"
+, number =      832
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       oct
+, year =        1988
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{m-naspo-91
-, author =	"Joseph S. B. Mitchell"
-, title =	"A new algorithm for shortest paths among obstacles in the plane"
-, journal =	"Ann. Math. Artif. Intell."
-, volume =	3
-, year =	1991
-, pages =	"83--106"
-, keywords =	"shortest paths, distance, continuous Dijkstra, visibility"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "A new algorithm for shortest paths among obstacles in the plane"
+, journal =     "Ann. Math. Artif. Intell."
+, volume =      3
+, year =        1991
+, pages =       "83--106"
+, keywords =    "shortest paths, distance, continuous Dijkstra, visibility"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{m-aaorp-90
-, author =	"Joseph S. B. Mitchell"
-, title =	"Algorithmic approaches to optimal route planning"
-, booktitle =	"Proc. SPIE Conference on Mobile Robots"
-, site =	"Boston, MA"
-, month =	nov
-, year =	1990
-, pages =	"??"
-, keywords =	"shortest paths, visibility graphs, weighted regions"
-, update =	"00.11 smid, 00.07 icking, 98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Algorithmic approaches to optimal route planning"
+, booktitle =   "Proc. SPIE Conference on Mobile Robots"
+, site =        "Boston, MA"
+, month =       nov
+, year =        1990
+, pages =       "??"
+, keywords =    "shortest paths, visibility graphs, weighted regions"
+, update =      "00.11 smid, 00.07 icking, 98.03 mitchell"
 }
 
 @inproceedings{m-aaspt-86
-, author =	"J. S. B. Mitchell"
-, title =	"An algorithmic approach to some problems in terrain navigation"
-, booktitle =	"International Workshop on Geometric Reasoning"
-, site =	"Oxford, UK"
-, month =	jun
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "J. S. B. Mitchell"
+, title =       "An algorithmic approach to some problems in terrain navigation"
+, booktitle =   "International Workshop on Geometric Reasoning"
+, site =        "Oxford, UK"
+, month =       jun
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{m-aaspt-88
-, author =	"Joseph S. B. Mitchell"
-, title =	"An algorithmic approach to some problems in terrain navigation"
-, journal =	"Artif. Intell."
-, volume =	37
-, year =	1988
-, pages =	"171--201"
-, keywords =	"path planning, geodesic distance, shortest paths, continuous Dijkstra"
-, precedes =	"m-aaspt-89"
-, update =	"99.11 bibrelex, 98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "An algorithmic approach to some problems in terrain navigation"
+, journal =     "Artif. Intell."
+, volume =      37
+, year =        1988
+, pages =       "171--201"
+, keywords =    "path planning, geodesic distance, shortest paths, continuous Dijkstra"
+, precedes =    "m-aaspt-89"
+, update =      "99.11 bibrelex, 98.03 mitchell"
 }
 
 @incollection{m-aaspt-89
-, author =	"Joseph S. B. Mitchell"
-, title =	"An algorithmic approach to some problems in terrain navigation"
-, editor =	"D. Kapur and J. Mundy"
-, booktitle =	"Geometric Reasoning"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1989
-, keywords =	"path planning, geodesic distance, shortest paths, continuous Dijkstra"
-, succeeds =	"m-aaspt-88"
-, update =	"99.11 bibrelex, 98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "An algorithmic approach to some problems in terrain navigation"
+, editor =      "D. Kapur and J. Mundy"
+, booktitle =   "Geometric Reasoning"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1989
+, keywords =    "path planning, geodesic distance, shortest paths, continuous Dijkstra"
+, succeeds =    "m-aaspt-88"
+, update =      "99.11 bibrelex, 98.03 mitchell"
 }
 
 @incollection{m-aaspt-91
-, author =	"Joseph S. B. Mitchell"
-, title =	"An algorithmic approach to some problems in terrain navigation"
-, editor =	"S. Sitharama Iyengar and Alberto Elfes"
-, booktitle =	"Autonomous Mobile Robots: Perception, Mapping, and Navigation"
-, publisher =	"IEEE Computer Society Press"
-, address =	"Los Alamitos, CA"
-, year =	1991
-, pages =	"408--427"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "An algorithmic approach to some problems in terrain navigation"
+, editor =      "S. Sitharama Iyengar and Alberto Elfes"
+, booktitle =   "Autonomous Mobile Robots: Perception, Mapping, and Navigation"
+, publisher =   "IEEE Computer Society Press"
+, address =     "Los Alamitos, CA"
+, year =        1991
+, pages =       "408--427"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{m-avna-84
-, author =	"Joseph S. B. Mitchell"
-, title =	"An Autonomous Vehicle Navigation Algorithm"
-, booktitle =	"Proc. SPIE Applications of Artificial Intelligence"
-, volume =	485
-, year =	1984
-, pages =	"153--158"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "An Autonomous Vehicle Navigation Algorithm"
+, booktitle =   "Proc. SPIE Applications of Artificial Intelligence"
+, volume =      485
+, year =        1984
+, pages =       "153--158"
+, update =      "98.03 mitchell"
 }
 
 @techreport{m-eamld-89
-, author =	"Joseph S. B. Mitchell"
-, title =	"An efficient algorithm for minimum link distance paths among obstacles in the plane"
-, type =	"Manuscript"
-, institution =	"Cornell Univ."
-, year =	1989
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Joseph S. B. Mitchell"
+, title =       "An efficient algorithm for minimum link distance paths among obstacles in the plane"
+, type =        "Manuscript"
+, institution = "Cornell Univ."
+, year =        1989
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{m-oasrp-89
-, author =	"Joseph S. B. Mitchell"
-, title =	"An optimal algorithm for shortest rectilinear paths among obstacles"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	22
-, keywords =	"shortest paths, two-dimensional, distance, $L_{1}$ metric, continuous Dijkstra, plane-sweep, range search"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "An optimal algorithm for shortest rectilinear paths among obstacles"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       22
+, keywords =    "shortest paths, two-dimensional, distance, $L_{1}$ metric, continuous Dijkstra, plane-sweep, range search"
+, update =      "98.03 mitchell"
 }
 
 @techreport{m-aagsp-93
-, author =	"Joseph S. B. Mitchell"
-, title =	"Approximation Algorithms for Geometric Separation Problems"
-, institution =	"Department of Applied Mathematics, SUNY Stony Brook, NY"
-, month =	jul
-, year =	1993
-, url =	"http://ams.sunysb.edu/\~{ }jsbm/jsbm.html"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Approximation Algorithms for Geometric Separation Problems"
+, institution = "Department of Applied Mathematics, SUNY Stony Brook, NY"
+, month =       jul
+, year =        1993
+, url = "http://ams.sunysb.edu/\~{ }jsbm/jsbm.html"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @techreport{m-cgmvr-93
-, author =	"J. S. B. Mitchell"
-, title =	"Computational geometry methods for virtual reality"
-, type =	"Manuscript"
-, institution =	"Department of Applied Mathematics, SUNY Stony Brook"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "J. S. B. Mitchell"
+, title =       "Computational geometry methods for virtual reality"
+, type =        "Manuscript"
+, institution = "Department of Applied Mathematics, SUNY Stony Brook"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @techreport{m-esppo-94
-, author =	"Joseph S. B. Mitchell"
-, title =	"Euclidean shortest paths among polygonal obstacles in the plane"
-, type =	"Technical {Report}"
-, institution =	"University at Stony Brook"
-, year =	1994
-, precedes =	"kmm-eaesp-97"
-, update =	"98.03 mitchell, 96.05 mitchell"
-, annote =	"Gives an $O(n+ h^2\log n)$ algorithm for shortest
+, author =      "Joseph S. B. Mitchell"
+, title =       "Euclidean shortest paths among polygonal obstacles in the plane"
+, type =        "Technical {Report}"
+, institution = "University at Stony Brook"
+, year =        1994
+, precedes =    "kmm-eaesp-97"
+, update =      "98.03 mitchell, 96.05 mitchell"
+, annote =      "Gives an $O(n+ h^2\log n)$ algorithm for shortest
                   paths"
 }
 
 @incollection{m-gspno-00
-, author =	"Joseph S. B. Mitchell"
-, title =	"Geometric Shortest Paths and Network Optimization"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"633--701"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 15 of su-hcg-00"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Geometric Shortest Paths and Network Optimization"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "633--701"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 15 of su-hcg-00"
 }
 
 @inproceedings{m-gsaps-96
-, author =	"Joseph S. B. Mitchell"
-, title =	"Guillotine subdivisions approximate polygonal subdivisions: {A} simple new method for the geometric {$k$-MST} problem"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"402--408"
-, keywords =	"k-MST, approximations, rectangular subdivisions, dynamic programming, red-blue separation, minimum spanning tree"
-, precedes =	"mbcv-cfaag-98"
-, update =	"98.03 mitchell, 96.09 agarwal, 96.01 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Guillotine subdivisions approximate polygonal subdivisions: {A} simple new method for the geometric {$k$-MST} problem"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "402--408"
+, keywords =    "k-MST, approximations, rectangular subdivisions, dynamic programming, red-blue separation, minimum spanning tree"
+, precedes =    "mbcv-cfaag-98"
+, update =      "98.03 mitchell, 96.09 agarwal, 96.01 mitchell"
 }
 
 @article{m-gsaps-99
-, author =	"Joseph S. B. Mitchell"
-, title =	"Guillotine Subdivisions Approximate Polygonal Subdivisions: {A} Simple Polynomial-Time Approximation Scheme for Geometric {TSP}, {$k$-MST}, and Related Problems"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1999
-, pages =	"1298--1309"
-, url =	"http://ams.sunysb.edu/~jsbm/jsbm.html"
-, update =	"99.11 smid, 98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Guillotine Subdivisions Approximate Polygonal Subdivisions: {A} Simple Polynomial-Time Approximation Scheme for Geometric {TSP}, {$k$-MST}, and Related Problems"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1999
+, pages =       "1298--1309"
+, url = "http://ams.sunysb.edu/~jsbm/jsbm.html"
+, update =      "99.11 smid, 98.03 mitchell"
 }
 
 @techreport{m-gsaps-96t
-, author =	"Joseph S. B. Mitchell"
-, title =	"Guillotine Subdivisions Approximate Polygonal Subdivisions: {Part II} -- {A} Simple Polynomial-Time Approximation Scheme for Geometric {TSP}, {$k$-MST}, and Related Problems"
-, type =	"Manuscript"
-, institution =	"University at Stony Brook"
-, year =	1996
-, url =	"http://ams.sunysb.edu/~jsbm/jsbm.html"
-, precedes =	"m-gsaps-98"
-, update =	"99.11 smid, 98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Guillotine Subdivisions Approximate Polygonal Subdivisions: {Part II} -- {A} Simple Polynomial-Time Approximation Scheme for Geometric {TSP}, {$k$-MST}, and Related Problems"
+, type =        "Manuscript"
+, institution = "University at Stony Brook"
+, year =        1996
+, url = "http://ams.sunysb.edu/~jsbm/jsbm.html"
+, precedes =    "m-gsaps-98"
+, update =      "99.11 smid, 98.03 mitchell"
 }
 
 @techreport{m-gsaps-97
-, author =	"Joseph S. B. Mitchell"
-, title =	"Guillotine Subdivisions Approximate Polygonal Subdivisions: {Part III} -- {Faster} Polynomial-Time Approximation Schemes for Geometric Network Optimization"
-, type =	"Manuscript"
-, institution =	"University at Stony Brook"
-, year =	1997
-, url =	"http://ams.sunysb.edu/~jsbm/jsbm.html"
-, comments =	"Appears also as part of \cite{m-sacgm-96} in CCCG'97"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Guillotine Subdivisions Approximate Polygonal Subdivisions: {Part III} -- {Faster} Polynomial-Time Approximation Schemes for Geometric Network Optimization"
+, type =        "Manuscript"
+, institution = "University at Stony Brook"
+, year =        1997
+, url = "http://ams.sunysb.edu/~jsbm/jsbm.html"
+, comments =    "Appears also as part of \cite{m-sacgm-96} in CCCG'97"
+, update =      "98.03 mitchell"
 }
 
 @article{m-lsppo-92
-, author =	"Joseph S. B. Mitchell"
-, title =	"{$L_{1}$} shortest paths among polygonal obstacles in the plane"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"55--88"
-, keywords =	"shortest paths, distance, {$L_{1}$} metric, continuous Dijkstra, plane-sweep, range search"
-, succeeds =	"m-srpo-87"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "{$L_{1}$} shortest paths among polygonal obstacles in the plane"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "55--88"
+, keywords =    "shortest paths, distance, {$L_{1}$} metric, continuous Dijkstra, plane-sweep, range search"
+, succeeds =    "m-srpo-87"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @techreport{m-csfal-90
-, author =	"Joseph S. B. Mitchell"
-, title =	"On computing a single face in an arrangement of line segments"
-, type =	"Manuscript"
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	jul
-, year =	1990
-, keywords =	"arrangements, divide-and-conquer"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "On computing a single face in an arrangement of line segments"
+, type =        "Manuscript"
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       jul
+, year =        1990
+, keywords =    "arrangements, divide-and-conquer"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{m-mfpd-88
-, author =	"Joseph S. B. Mitchell"
-, title =	"On maximum flows in polyhedral domains"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"341--351"
-, precedes =	"m-mfpd-90"
-, cites =	"aaghi-vpses-85, ckv-rsptp-87, ek-tiaen-72, g-namfp-87, gmmn-pp0wr-88, gt-namfp-86, h-ipnf-69, i-smp-79, is-mfpn-79, k-eccs-79, l-matps-82, m-psp-86, m-aaspt-86, m-spozc-87, m-srpo-87t, mmp-dgp-87, mp-wrp-85, p-spm-86, rs-spesp-85, s-mftd-83, y-oavds-87, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "On maximum flows in polyhedral domains"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "341--351"
+, precedes =    "m-mfpd-90"
+, cites =       "aaghi-vpses-85, ckv-rsptp-87, ek-tiaen-72, g-namfp-87, gmmn-pp0wr-88, gt-namfp-86, h-ipnf-69, i-smp-79, is-mfpn-79, k-eccs-79, l-matps-82, m-psp-86, m-aaspt-86, m-spozc-87, m-srpo-87t, mmp-dgp-87, mp-wrp-85, p-spm-86, rs-spesp-85, s-mftd-83, y-oavds-87, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{m-mfpd-90
-, author =	"Joseph S. B. Mitchell"
-, title =	"On maximum flows in polyhedral domains"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	40
-, year =	1990
-, pages =	"88--123"
-, succeeds =	"m-mfpd-88"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "On maximum flows in polyhedral domains"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      40
+, year =        1990
+, pages =       "88--123"
+, succeeds =    "m-mfpd-88"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{m-sacgm-96
-, author =	"Joseph S. B. Mitchell"
-, title =	"On Some Applications of Computational Geometry in Manufacturing and Virtual Environments"
-, editor =	"M. C. Lin and D. Manocha"
-, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1148
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"37--40"
-, update =	"98.11 bibrelex, 98.03 mitchell"
-, annote =	"invited lecture"
+, author =      "Joseph S. B. Mitchell"
+, title =       "On Some Applications of Computational Geometry in Manufacturing and Virtual Environments"
+, editor =      "M. C. Lin and D. Manocha"
+, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1148
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "37--40"
+, update =      "98.11 bibrelex, 98.03 mitchell"
+, annote =      "invited lecture"
 }
 
 @techreport{m-mcp-
-, author =	"J. S. B. Mitchell"
-, title =	"On the maximum concealment problem"
-, type =	"Technical Report"
-, institution =	"Dept. Oper. Res., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	"??"
-, note =	"In preparation"
-, update =	"98.03 bibrelex"
+, author =      "J. S. B. Mitchell"
+, title =       "On the maximum concealment problem"
+, type =        "Technical Report"
+, institution = "Dept. Oper. Res., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        "??"
+, note =        "In preparation"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{m-psp-86
-, author =	"Joseph S. B. Mitchell"
-, title =	"Planning shortest paths"
-, type =	"Ph.{D}. Thesis"
-, school =	"Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1986
-, keywords =	"doctoral thesis, motion planning, path planning, geodesic distance, shortest paths, Voronoi diagrams, plane-sweep, continuous Dijkstra"
-, comments =	"UMI AAC87-00791, 143 pp."
-, update =	"98.03 mitchell, 93.09 jones"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Planning shortest paths"
+, type =        "Ph.{D}. Thesis"
+, school =      "Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1986
+, keywords =    "doctoral thesis, motion planning, path planning, geodesic distance, shortest paths, Voronoi diagrams, plane-sweep, continuous Dijkstra"
+, comments =    "UMI AAC87-00791, 143 pp."
+, update =      "98.03 mitchell, 93.09 jones"
 }
 
 @inproceedings{m-spop-93
-, author =	"Joseph S. B. Mitchell"
-, title =	"Shortest paths among obstacles in the plane"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"308--317"
-, precedes =	"m-spop-96"
-, cites =	"a-rsoas-89, aaghi-vdp-86, c-asdii-88, cegghss-rspug-91, csw-qoubs-90, ch-spp-90, cj-sersi-91, gmmn-pp0wr-90, gm-osacv-91, km-eaesp-88, k-eccs-79, l-prp-78, l-prp-78, m-rsehc-92, m-apcad-83, m-lsppo-92, m-oasrp-89, m-mfpd-90, m-naspo-91, mmp-dgp-87, mp-wrpfs-91, ow-nmcvg-88, rs-spesp-85, ss-spps-86, w-cvgnl-85, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 97.03 devillers, 93.09 jones"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Shortest paths among obstacles in the plane"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "308--317"
+, precedes =    "m-spop-96"
+, cites =       "a-rsoas-89, aaghi-vdp-86, c-asdii-88, cegghss-rspug-91, csw-qoubs-90, ch-spp-90, cj-sersi-91, gmmn-pp0wr-90, gm-osacv-91, km-eaesp-88, k-eccs-79, l-prp-78, l-prp-78, m-rsehc-92, m-apcad-83, m-lsppo-92, m-oasrp-89, m-mfpd-90, m-naspo-91, mmp-dgp-87, mp-wrpfs-91, ow-nmcvg-88, rs-spesp-85, ss-spps-86, w-cvgnl-85, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 97.03 devillers, 93.09 jones"
 }
 
 @article{m-spop-96
-, author =	"Joseph S. B. Mitchell"
-, title =	"Shortest paths among obstacles in the plane"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"309--332"
-, keywords =	"shortest paths, geodesic paths, continuous Dijkstra method"
-, succeeds =	"m-spop-93"
-, update =	"98.03 mitchell, 97.03 devillers+schwarzkopf, 96.05 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Shortest paths among obstacles in the plane"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "309--332"
+, keywords =    "shortest paths, geodesic paths, continuous Dijkstra method"
+, succeeds =    "m-spop-93"
+, update =      "98.03 mitchell, 97.03 devillers+schwarzkopf, 96.05 mitchell"
 }
 
 @techreport{m-spozc-87
-, author =	"Joseph S. B. Mitchell"
-, title =	"Shortest paths among obstacles, zero-cost regions, and ``roads''"
-, type =	"Technical {Report}"
-, number =	764
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1987
-, keywords =	"path planning, shortest paths, Voronoi diagrams, continuous Dijkstra"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Shortest paths among obstacles, zero-cost regions, and ``roads''"
+, type =        "Technical {Report}"
+, number =      764
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1987
+, keywords =    "path planning, shortest paths, Voronoi diagrams, continuous Dijkstra"
+, update =      "98.03 mitchell"
 }
 
 @techreport{m-spn-96
-, author =	"Joseph S. B. Mitchell"
-, title =	"Shortest paths and networks"
-, type =	"Technical {Report}"
-, institution =	"University at Stony Brook"
-, year =	1996
-, update =	"98.03 mitchell, 97.07 orourke, 96.05 mitchell"
-, annote =	"A survey chapter written for the Handbook of Computational Geometry.
-		This version is somewhat expanded, with all references, etc."
+, author =      "Joseph S. B. Mitchell"
+, title =       "Shortest paths and networks"
+, type =        "Technical {Report}"
+, institution = "University at Stony Brook"
+, year =        1996
+, update =      "98.03 mitchell, 97.07 orourke, 96.05 mitchell"
+, annote =      "A survey chapter written for the Handbook of Computational Geometry.
+                This version is somewhat expanded, with all references, etc."
 }
 
 @incollection{m-spn-97
-, author =	"Joseph S. B. Mitchell"
-, title =	"Shortest paths and networks"
-, chapter =	24
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"445--466"
-, update =	"98.03 mitchell, 97.11 orourke"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Shortest paths and networks"
+, chapter =     24
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "445--466"
+, update =      "98.03 mitchell, 97.11 orourke"
 }
 
 @techreport{m-spppo-84
-, author =	"Joseph S. B. Mitchell"
-, title =	"Shortest paths in the plane in the presence of obstacles"
-, type =	"Manuscript"
-, institution =	"Dept. Operations Research, Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1984
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Shortest paths in the plane in the presence of obstacles"
+, type =        "Manuscript"
+, institution = "Dept. Operations Research, Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1984
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{m-srpo-87
-, author =	"Joseph S. B. Mitchell"
-, title =	"Shortest rectilinear paths among obstacles"
-, booktitle =	"Proc. 1st Internat. Conf. Indust. Applied Math."
-, site =	"Paris, France"
-, year =	1987
-, pages =	"39--84"
-, keywords =	"shortest paths, distance, $L_{1}$ metric, continuous Dijkstra, plane-sweep, range search"
-, precedes =	"m-lsppo-92"
-, update =	"98.03 mitchell, 94.05 smid"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Shortest rectilinear paths among obstacles"
+, booktitle =   "Proc. 1st Internat. Conf. Indust. Applied Math."
+, site =        "Paris, France"
+, year =        1987
+, pages =       "39--84"
+, keywords =    "shortest paths, distance, $L_{1}$ metric, continuous Dijkstra, plane-sweep, range search"
+, precedes =    "m-lsppo-92"
+, update =      "98.03 mitchell, 94.05 smid"
 }
 
 @techreport{m-srpo-87t
-, author =	"Joseph S. B. Mitchell"
-, title =	"Shortest rectilinear paths among obstacles in the plane"
-, type =	"Technical {Report}"
-, number =	739
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	apr
-, year =	1987
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Joseph S. B. Mitchell"
+, title =       "Shortest rectilinear paths among obstacles in the plane"
+, type =        "Technical {Report}"
+, number =      739
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       apr
+, year =        1987
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{mbcv-cfaag-98
-, author =	"Joseph S. B. Mitchell and A. Blum and P. Chalasani and S. Vempala"
-, title =	"A constant-factor approximation algorithm for the geometric {$k$-MST} problem in the plane"
-, journal =	"SIAM J. Comput."
-, volume =	28
-, year =	1998
-, pages =	"771--781"
-, url =	"http://ams.sunysb.edu/\~{ }jsbm/jsbm.html"
-, succeeds =	"m-gsaps-96"
-, update =	"99.11 smid, 98.03 mitchell"
+, author =      "Joseph S. B. Mitchell and A. Blum and P. Chalasani and S. Vempala"
+, title =       "A constant-factor approximation algorithm for the geometric {$k$-MST} problem in the plane"
+, journal =     "SIAM J. Comput."
+, volume =      28
+, year =        1998
+, pages =       "771--781"
+, url = "http://ams.sunysb.edu/\~{ }jsbm/jsbm.html"
+, succeeds =    "m-gsaps-96"
+, update =      "99.11 smid, 98.03 mitchell"
 }
 
 @techreport{mmp-dgp-85
-, author =	"J. S. B. Mitchell and D. M. Mount and C. H. Papadimitriou"
-, title =	"The discrete geodesic problem"
-, type =	"Technical {Report}"
-, institution =	"Dept. of Operations Research, Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "J. S. B. Mitchell and D. M. Mount and C. H. Papadimitriou"
+, title =       "The discrete geodesic problem"
+, type =        "Technical {Report}"
+, institution = "Dept. of Operations Research, Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @article{mmp-dgp-87
-, author =	"Joseph S. B. Mitchell and D. M. Mount and C. H. Papadimitriou"
-, title =	"The discrete geodesic problem"
-, journal =	"SIAM J. Comput."
-, volume =	16
-, year =	1987
-, pages =	"647--668"
-, keywords =	"path planning, geodesic distance, shortest paths, polyhedra, Voronoi diagrams, continuous Dijkstra"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell and D. M. Mount and C. H. Papadimitriou"
+, title =       "The discrete geodesic problem"
+, journal =     "SIAM J. Comput."
+, volume =      16
+, year =        1987
+, pages =       "647--668"
+, keywords =    "path planning, geodesic distance, shortest paths, polyhedra, Voronoi diagrams, continuous Dijkstra"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{mms-qsrs-94
-, author =	"Joseph S. B. Mitchell and D. M. Mount and Subhash Suri"
-, title =	"Query-Sensitive Ray Shooting"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"359--368"
-, keywords =	"ray shooting, octrees, quadtress, simple cover complexity"
-, precedes =	"mms-qsrs-97"
-, cites =	"a-dapal-89, amnsw-oaann-94, b-acpqh-93, beg-pgmg-90, ck-dmdps-92, cegghss-rspug-91, cg-vippg-85, cj-sersi-91, c-racpq-88, hs-parss-93, hb-atdis-87, m-cgmvr-93, mv-qmgtd-92i, m-smga-92, oss-slspt-90, s-dasds-90, v-oaann-89, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
+, author =      "Joseph S. B. Mitchell and D. M. Mount and Subhash Suri"
+, title =       "Query-Sensitive Ray Shooting"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "359--368"
+, keywords =    "ray shooting, octrees, quadtress, simple cover complexity"
+, precedes =    "mms-qsrs-97"
+, cites =       "a-dapal-89, amnsw-oaann-94, b-acpqh-93, beg-pgmg-90, ck-dmdps-92, cegghss-rspug-91, cg-vippg-85, cj-sersi-91, c-racpq-88, hs-parss-93, hb-atdis-87, m-cgmvr-93, mv-qmgtd-92i, m-smga-92, oss-slspt-90, s-dasds-90, v-oaann-89, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 94.09 jones, 94.01 jones"
 }
 
 @article{mms-qsrs-97
-, author =	"Joseph S. B. Mitchell and D. M. Mount and Subhash Suri"
-, title =	"Query-Sensitive Ray Shooting"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, number =	4
-, month =	aug
-, year =	1997
-, pages =	"317--347"
-, keywords =	"ray shooting, octrees, quadtress, simple cover complexity"
-, succeeds =	"mms-qsrs-94"
-, update =	"98.03 mitchell"
-, annote =	"Special issue devoted to SoCG'94"
+, author =      "Joseph S. B. Mitchell and D. M. Mount and Subhash Suri"
+, title =       "Query-Sensitive Ray Shooting"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, number =      4
+, month =       aug
+, year =        1997
+, pages =       "317--347"
+, keywords =    "ray shooting, octrees, quadtress, simple cover complexity"
+, succeeds =    "mms-qsrs-94"
+, update =      "98.03 mitchell"
+, annote =      "Special issue devoted to SoCG'94"
 }
 
 @article{mo-cgc42-01
-, author =	"J. S. B. Mitchell and J. O'Rourke"
-, title =	"Computational geometry column 42"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	"??"
-, number =	"??"
-, year =	2001
-, pages =	"??--??"
-, note =	"Also in {\em SIGACT News} 32(3):63-72 (2001), Issue 120"
-, update =	"01.07 orourke"
-, annote =	"A compendium of thirty previously published open
+, author =      "J. S. B. Mitchell and J. O'Rourke"
+, title =       "Computational geometry column 42"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      "??"
+, number =      "??"
+, year =        2001
+, pages =       "??--??"
+, note =        "Also in {\em SIGACT News} 32(3):63-72 (2001), Issue 120"
+, update =      "01.07 orourke"
+, annote =      "A compendium of thirty previously published open
 problems in computational geometry is presented."
 }
 
 @inproceedings{mp-psp-85
-, author =	"Joseph S. B. Mitchell and C. H. Papadimitriou"
-, title =	"Planning shortest paths"
-, booktitle =	"SIAM Conf. Geometric Modelling \& Robotics"
-, site =	"Albany, NY"
-, year =	1985
-, pages =	"??"
-, keywords =	"motion planning, path planning, geodesic distance, shortest paths, Voronoi diagrams, plane-sweep, continuous Dijkstra"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell and C. H. Papadimitriou"
+, title =       "Planning shortest paths"
+, booktitle =   "SIAM Conf. Geometric Modelling \& Robotics"
+, site =        "Albany, NY"
+, year =        1985
+, pages =       "??"
+, keywords =    "motion planning, path planning, geodesic distance, shortest paths, Voronoi diagrams, plane-sweep, continuous Dijkstra"
+, update =      "98.03 mitchell"
 }
 
 @techreport{mp-wrp-85
-, author =	"J. S. B. Mitchell and C. H. Papadimitriou"
-, title =	"The weighted region problem"
-, type =	"Technical {Report}"
-, institution =	"Dept. Oper. Res., Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "J. S. B. Mitchell and C. H. Papadimitriou"
+, title =       "The weighted region problem"
+, type =        "Technical {Report}"
+, institution = "Dept. Oper. Res., Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @techreport{mp-wrp-86
-, author =	"J. S. B. Mitchell and C. H. Papadimitriou"
-, title =	"The weighted region problem"
-, type =	"Technical {Report}"
-, institution =	"Dept. of  Operations Research, Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "J. S. B. Mitchell and C. H. Papadimitriou"
+, title =       "The weighted region problem"
+, type =        "Technical {Report}"
+, institution = "Dept. of  Operations Research, Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{mp-wrp-87
-, author =	"Joseph S. B. Mitchell and C. H. Papadimitriou"
-, title =	"The weighted region problem"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, site =	"Waterloo, ON"
-, year =	1987
-, pages =	"30--38"
-, keywords =	"path planning, geodesic distance, shortest paths, Voronoi diagrams, continuous Dijkstra"
-, precedes =	"mp-wrpfs-91"
-, cites =	"d-ntpcg-59, gs-pms-, j-spivt1-80, km-psptv-84, l-prp-78, lp-esppr-84,  m-psp-86, mp-psp-85, mp-wrp-86, mmp-dgp-85, qfp-dsarn-85, rs-spesp-85, ss-spps-86, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Joseph S. B. Mitchell and C. H. Papadimitriou"
+, title =       "The weighted region problem"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, site =        "Waterloo, ON"
+, year =        1987
+, pages =       "30--38"
+, keywords =    "path planning, geodesic distance, shortest paths, Voronoi diagrams, continuous Dijkstra"
+, precedes =    "mp-wrpfs-91"
+, cites =       "d-ntpcg-59, gs-pms-, j-spivt1-80, km-psptv-84, l-prp-78, lp-esppr-84,  m-psp-86, mp-psp-85, mp-wrp-86, mmp-dgp-85, qfp-dsarn-85, rs-spesp-85, ss-spps-86, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{mp-wrpfs-91
-, author =	"Joseph S. B. Mitchell and C. H. Papadimitriou"
-, title =	"The weighted region problem: finding shortest paths through a weighted planar subdivision"
-, journal =	"J. ACM"
-, volume =	38
-, year =	1991
-, pages =	"18--73"
-, keywords =	"weighted, path planning, geodesic distance, shortest paths, Voronoi diagrams, continuous Dijkstra"
-, succeeds =	"mp-wrp-87"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell and C. H. Papadimitriou"
+, title =       "The weighted region problem: finding shortest paths through a weighted planar subdivision"
+, journal =     "J. ACM"
+, volume =      38
+, year =        1991
+, pages =       "18--73"
+, keywords =    "weighted, path planning, geodesic distance, shortest paths, Voronoi diagrams, continuous Dijkstra"
+, succeeds =    "mp-wrp-87"
+, update =      "98.03 mitchell"
 }
 
 @article{mpk-pravc-87
-, author =	"Joseph S. B. Mitchell and D. W. Payton and D. M. Keirsey"
-, title =	"Planning and Reasoning for Autonomous Vehicle Control"
-, journal =	"Internat. J. Intell. Syst."
-, volume =	"II"
-, year =	1987
-, pages =	"129--198"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell and D. W. Payton and D. M. Keirsey"
+, title =       "Planning and Reasoning for Autonomous Vehicle Control"
+, journal =     "Internat. J. Intell. Syst."
+, volume =      "II"
+, year =        1987
+, pages =       "129--198"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{mpa-csklp-92
-, author =	"Joseph S. B. Mitchell and C. Piatko and Esther M. Arkin"
-, title =	"Computing a shortest $k$-link path in a polygon"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"573--582"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell and C. Piatko and Esther M. Arkin"
+, title =       "Computing a shortest $k$-link path in a polygon"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "573--582"
+, update =      "98.03 mitchell"
 }
 
 @article{mrsw-ccppp-95
-, author =	"Joseph S. B. Mitchell and G{\"u}nter Rote and Gopalakrishnan Sundaram and G. Woeginger"
-, title =	"Counting convex polygons in planar point sets"
-, journal =	"Inform. Process. Lett."
-, volume =	56
-, year =	1995
-, pages =	"191--194"
-, keywords =	"convexity, combinatorics"
-, cites =	"rwzw-cksck-91, rw-cckgp-92, eorw-fmakg-92"
-, update =	"98.03 mitchell, 97.11 bibrelex, 97.03 rote"
-, abstract =	"Given a set $S$ of $n$ points in the plane, we compute in time
-		$O(n^3)$ the total number of convex polygons whose vertices are
-		a subset of $S$. We give an $O(m n^3)$ algorithm for computing
-		the number of convex $k$-gons with vertices in $S$, for all
-		values $k=3,\ldots,m$."
+, author =      "Joseph S. B. Mitchell and G{\"u}nter Rote and Gopalakrishnan Sundaram and G. Woeginger"
+, title =       "Counting convex polygons in planar point sets"
+, journal =     "Inform. Process. Lett."
+, volume =      56
+, year =        1995
+, pages =       "191--194"
+, keywords =    "convexity, combinatorics"
+, cites =       "rwzw-cksck-91, rw-cckgp-92, eorw-fmakg-92"
+, update =      "98.03 mitchell, 97.11 bibrelex, 97.03 rote"
+, abstract =    "Given a set $S$ of $n$ points in the plane, we compute in time
+                $O(n^3)$ the total number of convex polygons whose vertices are
+                a subset of $S$. We give an $O(m n^3)$ algorithm for computing
+                the number of convex $k$-gons with vertices in $S$, for all
+                values $k=3,\ldots,m$."
 }
 
 @inproceedings{mrw-mlpop-90
-, author =	"Joseph S. B. Mitchell and G{\"u}nter Rote and G. Woeginger"
-, title =	"Minimum-link paths among obstacles in the plane"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"63--72"
-, precedes =	"mrw-mlpop-92"
-, cites =	"a-idaac-89, cr-nlbtr-87, ce-oails-88t, eghsssw-irals-88, egs-cmfal-88, gm-osacv-87, hs-ndssg-86, km-eaesp-88, k-ealdp-89, m-eamld-89, mw-dmvg-89, rw-cmlps-89, so-wcoac-86, s-ltaml-86, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 rote"
+, author =      "Joseph S. B. Mitchell and G{\"u}nter Rote and G. Woeginger"
+, title =       "Minimum-link paths among obstacles in the plane"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "63--72"
+, precedes =    "mrw-mlpop-92"
+, cites =       "a-idaac-89, cr-nlbtr-87, ce-oails-88t, eghsssw-irals-88, egs-cmfal-88, gm-osacv-87, hs-ndssg-86, km-eaesp-88, k-ealdp-89, m-eamld-89, mw-dmvg-89, rw-cmlps-89, so-wcoac-86, s-ltaml-86, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 93.09 rote"
 }
 
 @article{mrw-mlpop-92
-, author =	"Joseph S. B. Mitchell and G{\"u}nter Rote and G. Woeginger"
-, title =	"Minimum-link paths among obstacles in the plane"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"431--459"
-, keywords =	"link distance, arrangements, visibility graphs"
-, succeeds =	"mrw-mlpop-90"
-, update =	"98.03 mitchell, 93.09 rote"
+, author =      "Joseph S. B. Mitchell and G{\"u}nter Rote and G. Woeginger"
+, title =       "Minimum-link paths among obstacles in the plane"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "431--459"
+, keywords =    "link distance, arrangements, visibility graphs"
+, succeeds =    "mrw-mlpop-90"
+, update =      "98.03 mitchell, 93.09 rote"
 }
 
 @techreport{ms-scg-
-, author =	"J. S. B. Mitchell and S. Suri"
-, title =	"A Survey of Computational Geometry"
-, type =	"manuscript"
-, precedes =	"ms-scg-95"
-, update =	"98.11 bibrelex"
+, author =      "J. S. B. Mitchell and S. Suri"
+, title =       "A Survey of Computational Geometry"
+, type =        "manuscript"
+, precedes =    "ms-scg-95"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{ms-scg-95
-, author =	"Joseph S. B. Mitchell and Subhash Suri"
-, title =	"A Survey of Computational Geometry"
-, editor =	"M. O. Ball and T. L. Magnanti and C. L. Monma and G. L. Nemhauser"
-, booktitle =	"Network Models"
-, series =	"Handbook of Operations Research/Management Science"
-, publisher =	"Elsevier Science"
-, address =	"Amsterdam"
-, year =	1995
-, pages =	"425--479"
-, succeeds =	"ms-scg-"
-, update =	"98.11 bibrelex, 98.03 mitchell, 95.01 mitchell, 95.01 mitchell"
+, author =      "Joseph S. B. Mitchell and Subhash Suri"
+, title =       "A Survey of Computational Geometry"
+, editor =      "M. O. Ball and T. L. Magnanti and C. L. Monma and G. L. Nemhauser"
+, booktitle =   "Network Models"
+, series =      "Handbook of Operations Research/Management Science"
+, publisher =   "Elsevier Science"
+, address =     "Amsterdam"
+, year =        1995
+, pages =       "425--479"
+, succeeds =    "ms-scg-"
+, update =      "98.11 bibrelex, 98.03 mitchell, 95.01 mitchell, 95.01 mitchell"
 }
 
 @article{ms-sapo-95
-, author =	"Joseph S. B. Mitchell and Subhash Suri"
-, title =	"Separation and approximation of polyhedral objects"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"95--114"
-, keywords =	"surface approximation, mesh simplification, set cover, greedy algorithms"
-, succeeds =	"ms-saps-92"
-, update =	"98.03 mitchell, 97.03 agarwal, 96.01 mitchell"
+, author =      "Joseph S. B. Mitchell and Subhash Suri"
+, title =       "Separation and approximation of polyhedral objects"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "95--114"
+, keywords =    "surface approximation, mesh simplification, set cover, greedy algorithms"
+, succeeds =    "ms-saps-92"
+, update =      "98.03 mitchell, 97.03 agarwal, 96.01 mitchell"
 }
 
 @techreport{ms-saps-91
-, author =	"Joseph S. B. Mitchell and Subhash Suri"
-, title =	"Separation and approximation of polyhedral surfaces"
-, type =	"Technical {Report}"
-, number =	974
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1991
-, precedes =	"ms-saps-92"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell and Subhash Suri"
+, title =       "Separation and approximation of polyhedral surfaces"
+, type =        "Technical {Report}"
+, number =      974
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1991
+, precedes =    "ms-saps-92"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ms-saps-92
-, author =	"Joseph S. B. Mitchell and Subhash Suri"
-, title =	"Separation and approximation of polyhedral surfaces"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"296--306"
-, succeeds =	"ms-saps-91"
-, precedes =	"ms-sapo-95"
-, update =	"98.03 mitchell, 96.01 mitchell, 95.01 mitchell"
+, author =      "Joseph S. B. Mitchell and Subhash Suri"
+, title =       "Separation and approximation of polyhedral surfaces"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "296--306"
+, succeeds =    "ms-saps-91"
+, precedes =    "ms-sapo-95"
+, update =      "98.03 mitchell, 96.01 mitchell, 95.01 mitchell"
 }
 
 @techreport{mw-dmvg-89
-, author =	"Joseph S. B. Mitchell and Emo Welzl"
-, title =	"Dynamic methods for visibility graphs"
-, type =	"Manuscript"
-, institution =	"Cornell Univ."
-, year =	1989
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Joseph S. B. Mitchell and Emo Welzl"
+, title =       "Dynamic methods for visibility graphs"
+, type =        "Manuscript"
+, institution = "Cornell Univ."
+, year =        1989
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{mw-dmvgi-90
-, author =	"Joseph S. B. Mitchell and Emo Welzl"
-, title =	"Dynamically Maintaining a Visibility Graph under Insertions of New Obstacles"
-, institution =	"Operations Research, Cornell University"
-, year =	1990
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell and Emo Welzl"
+, title =       "Dynamically Maintaining a Visibility Graph under Insertions of New Obstacles"
+, institution = "Operations Research, Cornell University"
+, year =        1990
+, update =      "98.03 mitchell"
 }
 
 @techreport{mw-fobpp-90
-, author =	"Joseph S. B. Mitchell and E. L. Wynters"
-, title =	"Finding optimal bipartitions of points and polygons"
-, type =	"Technical {Report}"
-, number =	948
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1990
-, keywords =	"bipartitioning, separation, visibility, clustering, convex hulls"
-, precedes =	"mw-fobpp-91"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell and E. L. Wynters"
+, title =       "Finding optimal bipartitions of points and polygons"
+, type =        "Technical {Report}"
+, number =      948
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1990
+, keywords =    "bipartitioning, separation, visibility, clustering, convex hulls"
+, precedes =    "mw-fobpp-91"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{mw-fobpp-91
-, author =	"Joseph S. B. Mitchell and E. L. Wynters"
-, title =	"Finding optimal bipartitions of points and polygons"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"202--213"
-, keywords =	"bipartitioning, separation, visibility, clustering, convex hulls"
-, succeeds =	"mw-fobpp-90"
-, precedes =	"mw-fobpp-95"
-, update =	"98.03 mitchell"
+, author =      "Joseph S. B. Mitchell and E. L. Wynters"
+, title =       "Finding optimal bipartitions of points and polygons"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "202--213"
+, keywords =    "bipartitioning, separation, visibility, clustering, convex hulls"
+, succeeds =    "mw-fobpp-90"
+, precedes =    "mw-fobpp-95"
+, update =      "98.03 mitchell"
 }
 
 @techreport{mw-fobpp-95
-, author =	"Joseph S. B. Mitchell and E. L. Wynters"
-, title =	"Finding Optimal Bipartitions of Points and Polygons"
-, type =	"Technical {Report}"
-, institution =	"Applied Math, SUNY Stony Brook"
-, year =	1995
-, keywords =	"bipartitioning, separation, visibility, clustering, convex hulls"
-, succeeds =	"mw-fobpp-91"
-, update =	"98.03 mitchell"
-, annote =	"Full version of \cite{mw-fobpp-91}, which also corrects a
+, author =      "Joseph S. B. Mitchell and E. L. Wynters"
+, title =       "Finding Optimal Bipartitions of Points and Polygons"
+, type =        "Technical {Report}"
+, institution = "Applied Math, SUNY Stony Brook"
+, year =        1995
+, keywords =    "bipartitioning, separation, visibility, clustering, convex hulls"
+, succeeds =    "mw-fobpp-91"
+, update =      "98.03 mitchell"
+, annote =      "Full version of \cite{mw-fobpp-91}, which also corrects a
                   misstatement made in the proceedings version."
 }
 
 @techreport{mw-omcpo-90t
-, author =	"J. S. B. Mitchell and E. L. Wynters"
-, title =	"Optimal motion of covisible points among obstacles in the plane"
-, type =	"Technical {Report}"
-, number =	896
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	mar
-, year =	1990
-, keywords =	"path planning, visibility, shortest paths, multiple agents"
-, precedes =	"mw-omcpo-90i"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "J. S. B. Mitchell and E. L. Wynters"
+, title =       "Optimal motion of covisible points among obstacles in the plane"
+, type =        "Technical {Report}"
+, number =      896
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       mar
+, year =        1990
+, keywords =    "path planning, visibility, shortest paths, multiple agents"
+, precedes =    "mw-omcpo-90i"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{mw-omcpo-90i
-, author =	"J. S. B. Mitchell and E. L. Wynters"
-, title =	"Optimal motion of covisible points among obstacles in the plane"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"116--119"
-, keywords =	"path planning, shortest paths, multiple agents, visibility"
-, succeeds =	"mw-omcpo-90t"
-, cites =	"aaghi-vdp-86, cr-nlbtr-87, d-ntpcg-59, ft-fhtu-84, gm-osacv-87t, irwy-spls-89, km-eaesp-88, l-prp-78, lp-esppr-84, lw-apcfp-79, m-naspo-88, mw-omcpo-90t, ps-oplmo-86, ss-spps-86, w-cvgnl-85, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "J. S. B. Mitchell and E. L. Wynters"
+, title =       "Optimal motion of covisible points among obstacles in the plane"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "116--119"
+, keywords =    "path planning, shortest paths, multiple agents, visibility"
+, succeeds =    "mw-omcpo-90t"
+, cites =       "aaghi-vdp-86, cr-nlbtr-87, d-ntpcg-59, ft-fhtu-84, gm-osacv-87t, irwy-spls-89, km-eaesp-88, l-prp-78, lp-esppr-84, lw-apcfp-79, m-naspo-88, mw-omcpo-90t, ps-oplmo-86, ss-spps-86, w-cvgnl-85, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{mw-wrmg-91
-, author =	"Joseph S. B. Mitchell and E. L. Wynters"
-, title =	"Watchman routes for multiple guards"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"126--129"
-, keywords =	"watchman routes, shortest paths, multiple agents, art galleries, dynamic programming"
-, cites =	"c-tsplt-90t, c-ctpg-75, cn-owr-86, cn-owr-88, cn-wrsp-87, f-spcwt-78, gj-cigtn-79, k-mchco-86, ll-ccagp-86, nw-owrsp-90m, o-agta-87, mow-vv-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "Joseph S. B. Mitchell and E. L. Wynters"
+, title =       "Watchman routes for multiple guards"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "126--129"
+, keywords =    "watchman routes, shortest paths, multiple agents, art galleries, dynamic programming"
+, cites =       "c-tsplt-90t, c-ctpg-75, cn-owr-86, cn-owr-88, cn-wrsp-87, f-spcwt-78, gj-cigtn-79, k-mchco-86, ll-ccagp-86, nw-owrsp-90m, o-agta-87, mow-vv-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{m-cqmsw-95
-, author =	"S. Mitchell"
-, title =	"A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume"
-, booktitle =	"Proc. 5th Workshop Comput. Geom."
-, year =	1995
-, update =	"97.11 bibrelex"
+, author =      "S. Mitchell"
+, title =       "A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume"
+, booktitle =   "Proc. 5th Workshop Comput. Geom."
+, year =        1995
+, update =      "97.11 bibrelex"
 }
 
 @article{m-amact-97
-, author =	"S. Mitchell"
-, title =	"Approximating the maxmin angle covering triangulation"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"93--111"
-, update =	"97.03 devillers"
+, author =      "S. Mitchell"
+, title =       "Approximating the maxmin angle covering triangulation"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "93--111"
+, update =      "97.03 devillers"
 }
 
 @inproceedings{m-ccrmm-97
-, author =	"S. Mitchell"
-, title =	"Choosing corners of rectangles for mapped meshing"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"87--93"
-, cites =	"bbehlmstwobclpwwt-cmgev-94, mmw-mrbfm-96, ta-femci-93, achkm-ecmcp-89, m-cqmsw-96, t-hdp-93, e-lchmg-96, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "S. Mitchell"
+, title =       "Choosing corners of rectangles for mapped meshing"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "87--93"
+, cites =       "bbehlmstwobclpwwt-cmgev-94, mmw-mrbfm-96, ta-femci-93, achkm-ecmcp-89, m-cqmsw-96, t-hdp-93, e-lchmg-96, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{m-fctma-97
-, author =	"S. Mitchell"
-, title =	"Finding a covering triangulation whose maximum angle is provably small"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"5--20"
-, succeeds =	"mp-fctma-93"
-, update =	"98.11 bibrelex, 97.07 devillers"
+, author =      "S. Mitchell"
+, title =       "Finding a covering triangulation whose maximum angle is provably small"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "5--20"
+, succeeds =    "mp-fctma-93"
+, update =      "98.11 bibrelex, 97.07 devillers"
 }
 
 @inproceedings{mt-pdrme-95
-, author =	"Scott Mitchell and Timothy J. Tautges"
-, title =	"Pillowing Doublets: Refining a Mesh to Ensure that Faces Share at Most One Edge"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"231--241"
-, update =	"96.01 samitchell"
+, author =      "Scott Mitchell and Timothy J. Tautges"
+, title =       "Pillowing Doublets: Refining a Mesh to Ensure that Faces Share at Most One Edge"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "231--241"
+, update =      "96.01 samitchell"
 }
 
 @incollection{m-cqmsw-96
-, author =	"Scott A. Mitchell"
-, title =	"A Characterization of the Quadrilateral Meshes of a Surface which Admit a Compatible Hexahedral Mesh of the Enclosed Volume"
-, booktitle =	"Proc. 13th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1046
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"465--476"
-, update =	"96.05 mitchell+samitchell"
+, author =      "Scott A. Mitchell"
+, title =       "A Characterization of the Quadrilateral Meshes of a Surface which Admit a Compatible Hexahedral Mesh of the Enclosed Volume"
+, booktitle =   "Proc. 13th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1046
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "465--476"
+, update =      "96.05 mitchell+samitchell"
 }
 
 @inproceedings{m-amact-93
-, author =	"Scott A. Mitchell"
-, title =	"Approximating the {MaxMin}-Angel Covering Triangulation"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"36--41"
-, cites =	"a-vdsfg-91, ba-acfem-76, b-ct-93, bde-tpwla-95, beemt-eiot-92i, be-mgot-92i, beg-pgmg-90, c-gqtm-89, etw-otama-90, f-vddt-92, l-scsi-77, m-mgpqb-93, mp-fctma-93, mv-qmgtd-92i, r-nsaq2-92, s-udzvd-28, ZZZ"
-, update =	"98.11 bibrelex"
+, author =      "Scott A. Mitchell"
+, title =       "Approximating the {MaxMin}-Angel Covering Triangulation"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "36--41"
+, cites =       "a-vdsfg-91, ba-acfem-76, b-ct-93, bde-tpwla-95, beemt-eiot-92i, be-mgot-92i, beg-pgmg-90, c-gqtm-89, etw-otama-90, f-vddt-92, l-scsi-77, m-mgpqb-93, mp-fctma-93, mv-qmgtd-92i, r-nsaq2-92, s-udzvd-28, ZZZ"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{m-cbtbm-94
-, author =	"S. A. Mitchell"
-, title =	"Cardinality Bounds for Triangulations with Bounded Minimum Angle"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"326--331"
-, cites =	"beg-pgmg-90, e-acg-87, g-dpnet-84, m-adtad-92, m-amact-93, m-mgpqb-93, mv-qmgtd-92i, r-nsaq2-93, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "S. A. Mitchell"
+, title =       "Cardinality Bounds for Triangulations with Bounded Minimum Angle"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "326--331"
+, cites =       "beg-pgmg-90, e-acg-87, g-dpnet-84, m-adtad-92, m-amact-93, m-mgpqb-93, mv-qmgtd-92i, r-nsaq2-93, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{m-fctwm-94
-, author =	"S. A. Mitchell"
-, title =	"Finding a covering triangulation whose maximum angle is provably small"
-, booktitle =	"Proc. 17th Australian Annu. Comput. Sci. Conf."
-, volume =	16
-, year =	1994
-, pages =	"55--64"
-, succeeds =	"mp-fctma-93"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "S. A. Mitchell"
+, title =       "Finding a covering triangulation whose maximum angle is provably small"
+, booktitle =   "Proc. 17th Australian Annu. Comput. Sci. Conf."
+, volume =      16
+, year =        1994
+, pages =       "55--64"
+, succeeds =    "mp-fctma-93"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @phdthesis{m-mgpqb-93
-, author =	"S. A. Mitchell"
-, title =	"Mesh generation with provable quality bounds"
-, school =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1993
-, note =	"Technical Report CS-TR-92-1327"
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "S. A. Mitchell"
+, title =       "Mesh generation with provable quality bounds"
+, school =      "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1993
+, note =        "Technical Report CS-TR-92-1327"
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{m-rtpsl-93
-, author =	"Scott A. Mitchell"
-, title =	"Refining a Triangulation of a Planar Straight-Line Graph to Eliminate Large Angles"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"583--591"
-, update =	"98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Scott A. Mitchell"
+, title =       "Refining a Triangulation of a Planar Straight-Line Graph to Eliminate Large Angles"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "583--591"
+, update =      "98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @techreport{mp-fctma-93
-, author =	"S. A. Mitchell and J. K. Park"
-, title =	"Finding a Covering Triangulation whose Maximum Angle is Provably Small"
-, type =	"manuscript"
-, institution =	"Sandia National Laboratories"
-, year =	1993
-, precedes =	"m-fctwm-94, m-fctma-97"
-, update =	"98.11 bibrelex"
+, author =      "S. A. Mitchell and J. K. Park"
+, title =       "Finding a Covering Triangulation whose Maximum Angle is Provably Small"
+, type =        "manuscript"
+, institution = "Sandia National Laboratories"
+, year =        1993
+, precedes =    "m-fctwm-94, m-fctma-97"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{mv-arbtd-96
-, author =	"Scott A. Mitchell and Stephen A. Vavasis"
-, title =	"An Aspect Ratio Bound for Triangulating a $d$-Grid Cut by a Hyperplace"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"48--57"
-, cites =	"bgr-ntp-88, bcer-dbmgh-95, beg-pgmg-90, bmr-lsntp-94, c-gqtm-89, d-q3d-94, fsg-famg3-94, j-nspde-87, ms-cinap-92, mv-qmgtd-92i, mv-qmghd-95, t-cfpa-76, v-qfemg-95, v-sfepw-93, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Scott A. Mitchell and Stephen A. Vavasis"
+, title =       "An Aspect Ratio Bound for Triangulating a $d$-Grid Cut by a Hyperplace"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "48--57"
+, cites =       "bgr-ntp-88, bcer-dbmgh-95, beg-pgmg-90, bmr-lsntp-94, c-gqtm-89, d-q3d-94, fsg-famg3-94, j-nspde-87, ms-cinap-92, mv-qmgtd-92i, mv-qmghd-95, t-cfpa-76, v-qfemg-95, v-sfepw-93, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @unpublished{mv-qmghd-95
-, author =	"S. A. Mitchell and S. A. Vavasis"
-, title =	"Quality mesh generation in higher dimensions"
-, year =	1995
-, update =	"00.11 smid, 97.11 bibrelex"
+, author =      "S. A. Mitchell and S. A. Vavasis"
+, title =       "Quality mesh generation in higher dimensions"
+, year =        1995
+, update =      "00.11 smid, 97.11 bibrelex"
 }
 
 @article{mv-qmghd-00
-, author =	"S. A. Mitchell and S. A. Vavasis"
-, title =	"Quality mesh generation in higher dimensions"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, year =	2000
-, pages =	"1334--1370"
-, update =	"00.11 smid"
+, author =      "S. A. Mitchell and S. A. Vavasis"
+, title =       "Quality mesh generation in higher dimensions"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, year =        2000
+, pages =       "1334--1370"
+, update =      "00.11 smid"
 }
 
 @techreport{mv-qmgtd-92t
-, author =	"S. A. Mitchell and S. A. Vavasis"
-, title =	"Quality mesh generation in three dimensions"
-, type =	"Technical {Report}"
-, number =	"TR~92-1267"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	feb
-, year =	1992
-, precedes =	"mv-qmgtd-92i"
+, author =      "S. A. Mitchell and S. A. Vavasis"
+, title =       "Quality mesh generation in three dimensions"
+, type =        "Technical {Report}"
+, number =      "TR~92-1267"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       feb
+, year =        1992
+, precedes =    "mv-qmgtd-92i"
 }
 
 @inproceedings{mv-qmgtd-92i
-, author =	"S. A. Mitchell and S. A. Vavasis"
-, title =	"Quality mesh generation in three dimensions"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"212--221"
-, succeeds =	"mv-qmgtd-92t"
-, cites =	"ba-acfem-76, bde-tpwla-92, beemt-eiot-92t, beg-pgmg-90, be-mgot-92t, csw-cds2d-88, cp-tncp-89, c-cdt-89, c-gqtm-89, e-acg-87, ht-nggcf-86, mtv-ugags-91, mt-sttd-90, mv-dgs-90, m-carte-87, m-umafe-88, mw-mamg-90, ps-cgi-85, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "S. A. Mitchell and S. A. Vavasis"
+, title =       "Quality mesh generation in three dimensions"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "212--221"
+, succeeds =    "mv-qmgtd-92t"
+, cites =       "ba-acfem-76, bde-tpwla-92, beemt-eiot-92t, beg-pgmg-90, be-mgot-92t, csw-cds2d-88, cp-tncp-89, c-cdt-89, c-gqtm-89, e-acg-87, ht-nggcf-86, mtv-ugags-91, mt-sttd-90, mv-dgs-90, m-carte-87, m-umafe-88, mw-mamg-90, ps-cgi-85, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{m-agnq-92
-, author =	"Pinaki Mitra"
-, title =	"Answering {Gabriel} Neighbour Queries"
-, journal =	"Pattern Recogn. Lett."
-, volume =	13
-, year =	1992
-, pages =	"557--560"
-, update =	"98.11 patrignani"
+, author =      "Pinaki Mitra"
+, title =       "Answering {Gabriel} Neighbour Queries"
+, journal =     "Pattern Recogn. Lett."
+, volume =      13
+, year =        1992
+, pages =       "557--560"
+, update =      "98.11 patrignani"
 }
 
 @inproceedings{mb-easpq-93
-, author =	"P. Mitra and B. Bhattacharya"
-, title =	"Efficient Approximate Shortest-Path Queries among Isothetic Rectangular Obstacles"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"518--529"
-, update =	"96.05 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
+, author =      "P. Mitra and B. Bhattacharya"
+, title =       "Efficient Approximate Shortest-Path Queries among Isothetic Rectangular Obstacles"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "518--529"
+, update =      "96.05 agarwal, 93.09 milone+mitchell+smid, 93.05 jones"
 }
 
 @incollection{mn-ecrgv-96
-, author =	"P. Mitra and S. C. Nandy"
-, title =	"Efficient computation of rectilinear geodesic {Voronoi} neighbor in presence of obstacles"
-, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1180
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"76--87"
-, precedes =	"mn-ecrgv-98"
-, update =	"98.11 smid, 97.03 smid"
+, author =      "P. Mitra and S. C. Nandy"
+, title =       "Efficient computation of rectilinear geodesic {Voronoi} neighbor in presence of obstacles"
+, booktitle =   "Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1180
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "76--87"
+, precedes =    "mn-ecrgv-98"
+, update =      "98.11 smid, 97.03 smid"
 }
 
 @article{mn-ecrgv-98
-, author =	"P. Mitra and S. C. Nandy"
-, title =	"Efficient computation of rectilinear geodesic {Voronoi} neighbor in the presence of obstacles"
-, journal =	"J. Algorithms"
-, volume =	28
-, year =	1998
-, pages =	"315--338"
-, succeeds =	"mn-ecrgv-96"
-, update =	"98.11 smid"
+, author =      "P. Mitra and S. C. Nandy"
+, title =       "Efficient computation of rectilinear geodesic {Voronoi} neighbor in the presence of obstacles"
+, journal =     "J. Algorithms"
+, volume =      28
+, year =        1998
+, pages =       "315--338"
+, succeeds =    "mn-ecrgv-96"
+, update =      "98.11 smid"
 }
 
 @book{m-ai-70
-, author =	"D. S. Mitrinovic"
-, title =	"Analytic inequalities"
-, publisher =	"Springer-Verlag"
-, year =	1970
-, update =	"97.11 bibrelex"
+, author =      "D. S. Mitrinovic"
+, title =       "Analytic inequalities"
+, publisher =   "Springer-Verlag"
+, year =        1970
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ms-sabcp-89
-, author =	"J. D. Mittleman and D. L. Souvaine"
-, title =	"Shortest Area-Bisector of a Convex Polygon"
-, type =	"Technical {Report}"
-, number =	"LCSR-TR-139"
-, institution =	"Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, month =	nov
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "J. D. Mittleman and D. L. Souvaine"
+, title =       "Shortest Area-Bisector of a Convex Polygon"
+, type =        "Technical {Report}"
+, number =      "LCSR-TR-139"
+, institution = "Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, month =       nov
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @article{mauy-dflat-98
-, author =	"Youzou Miyadera and Koushi Anzai and Hiroshi Unno and Takeo Yaku"
-, title =	"Depth-first layout algorithm for trees"
-, journal =	"Inform. Process. Lett."
-, volume =	66
-, year =	1998
-, pages =	"187--194"
-, keywords =	"tree-structured diagram, tidy drawing problem, tree layout, hichart"
-, update =	"99.03 patrignani"
+, author =      "Youzou Miyadera and Koushi Anzai and Hiroshi Unno and Takeo Yaku"
+, title =       "Depth-first layout algorithm for trees"
+, journal =     "Inform. Process. Lett."
+, volume =      66
+, year =        1998
+, pages =       "187--194"
+, keywords =    "tree-structured diagram, tidy drawing problem, tree layout, hichart"
+, update =      "99.03 patrignani"
 }
 
 @inproceedings{mk-hcabk-78
-, author =	"R. Mizoguchi and O. Kakusho"
-, title =	"Hierarchical clustering algorithms based on $k$-nearest neighbors"
-, booktitle =	"4th International Joint Conference on Pattern Recognition"
-, site =	"Kyoto, Japan"
-, year =	1978
-, pages =	"314--316"
+, author =      "R. Mizoguchi and O. Kakusho"
+, title =       "Hierarchical clustering algorithms based on $k$-nearest neighbors"
+, booktitle =   "4th International Joint Conference on Pattern Recognition"
+, site =        "Kyoto, Japan"
+, year =        1978
+, pages =       "314--316"
 }
 
 @incollection{m-utcpc-89
-, author =	"M. E. Mnev"
-, title =	"The {Universality} theorems on the classification problem of configuration varieties and convex polytopes varieties"
-, editor =	"O. Y. Viro"
-, booktitle =	"Topology and Geometry - Rohlin Seminar"
-, series =	"Lecture Notes Math."
-, volume =	1346
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"527--544"
-, update =	"97.11 bibrelex"
+, author =      "M. E. Mnev"
+, title =       "The {Universality} theorems on the classification problem of configuration varieties and convex polytopes varieties"
+, editor =      "O. Y. Viro"
+, booktitle =   "Topology and Geometry - Rohlin Seminar"
+, series =      "Lecture Notes Math."
+, volume =      1346
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "527--544"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{m-utoms-91
-, author =	"N. E. Mn{\"e}v"
-, title =	"The universality theorem on the oriented matroid stratification of the space of real matrices"
-, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
-, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
-, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
-, volume =	6
-, publisher =	"American Mathematical Society, Association for Computing Machinery"
-, year =	1991
-, pages =	"237--243"
-, update =	"99.11 bibrelex, 97.11 orourke"
+, author =      "N. E. Mn{\"e}v"
+, title =       "The universality theorem on the oriented matroid stratification of the space of real matrices"
+, editor =      "J. E. Goodman and R. Pollack and W. Steiger"
+, booktitle =   "Discrete and Computational Geometry: Papers from the DIMACS Special Year"
+, series =      "DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
+, volume =      6
+, publisher =   "American Mathematical Society, Association for Computing Machinery"
+, year =        1991
+, pages =       "237--243"
+, update =      "99.11 bibrelex, 97.11 orourke"
 }
 
 @article{mr-tcomd-93
-, author =	"N. E. Mn{\"e}v and J{\"u}rgen Richter-Gebert"
-, title =	"Two constructions of oriented matroids with disconnected extention space"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"271--285"
-, update =	"96.05 pocchiola"
+, author =      "N. E. Mn{\"e}v and J{\"u}rgen Richter-Gebert"
+, title =       "Two constructions of oriented matroids with disconnected extention space"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "271--285"
+, update =      "96.05 pocchiola"
 }
 
 @article{mz-cmfdg-93
-, author =	"N. E. Mn{\"e}v and G. M. Ziegler"
-, title =	"Combinatorial Models for the finite-dimensional {G}rassmannians"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"241--250"
-, update =	"96.05 pocchiola"
+, author =      "N. E. Mn{\"e}v and G. M. Ziegler"
+, title =       "Combinatorial Models for the finite-dimensional {G}rassmannians"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "241--250"
+, update =      "96.05 pocchiola"
 }
 
 @inproceedings{m-iutmw-91
-, author =	"B. Mobasseri"
-, title =	"Impact of uncertain terrain models on the weighted region problem"
-, booktitle =	"Proceedings of the SPIE, The International Society for Optical Engineering"
-, volume =	1388
-, year =	1991
-, pages =	"270--277"
-, keywords =	"Uncertain terrain models, Weighted region problem, Obstacle avoidance problem, Surface patches, Traversability indices, Probability distribution, Decision basis, Search"
-, update =	"93.09 milone+mitchell"
-, abstract =	"Outdoor navigation is characterized by motions through
+, author =      "B. Mobasseri"
+, title =       "Impact of uncertain terrain models on the weighted region problem"
+, booktitle =   "Proceedings of the SPIE, The International Society for Optical Engineering"
+, volume =      1388
+, year =        1991
+, pages =       "270--277"
+, keywords =    "Uncertain terrain models, Weighted region problem, Obstacle avoidance problem, Surface patches, Traversability indices, Probability distribution, Decision basis, Search"
+, update =      "93.09 milone+mitchell"
+, abstract =    "Outdoor navigation is characterized by motions through
    regions of varied terrain. The weighted region problem, (WRP), is a
    generalization of the obstacle avoidance problem with 1/ infinity
    cost structure. By assigning indices to surface patches proportional
@@ -107041,14 +107041,14 @@ @inproceedings{m-iutmw-91
 }
 
 @inproceedings{m-daawr-90
-, author =	"B. G. Mobasseri"
-, title =	"Decision analytic approach to the weighted region problem"
-, booktitle =	"Proceedings of the SPIE, The International Society for Optical Engineering"
-, volume =	1293
-, year =	1990
-, pages =	"438--445"
-, update =	"93.09 milone+mitchell"
-, abstract =	"The weighted region problem is a generalization of the
+, author =      "B. G. Mobasseri"
+, title =       "Decision analytic approach to the weighted region problem"
+, booktitle =   "Proceedings of the SPIE, The International Society for Optical Engineering"
+, volume =      1293
+, year =        1990
+, pages =       "438--445"
+, update =      "93.09 milone+mitchell"
+, abstract =    "The weighted region problem is a generalization of the
    obstacle avoidance problem. By defining a multiple-valued index,
    terrain patches can be distinguished on the basis of their
    traversability. The paper generalizes the weighted region problem by
@@ -107064,2197 +107064,2197 @@ @inproceedings{m-daawr-90
 }
 
 @inproceedings{m-ppuda-89
-, author =	"B. G. Mobasseri"
-, title =	"Path Planning Under Uncertainty from a Decision Analytic Perspective"
-, booktitle =	"Proc. IEEE International Symposium on Intelligent Control"
-, site =	"Albany, NY"
-, month =	sep
-, year =	1989
-, pages =	"556--560"
+, author =      "B. G. Mobasseri"
+, title =       "Path Planning Under Uncertainty from a Decision Analytic Perspective"
+, booktitle =   "Proc. IEEE International Symposium on Intelligent Control"
+, site =        "Albany, NY"
+, month =       sep
+, year =        1989
+, pages =       "556--560"
 }
 
 @article{m-ddt-90
-, author =	"S. Moen"
-, title =	"Drawing Dynamic Trees"
-, journal =	"IEEE Softw."
-, volume =	7
-, year =	1990
-, pages =	"21--28"
-, keywords =	"graph drawing"
-, update =	"98.07 vismara, 93.09 tamassia"
+, author =      "S. Moen"
+, title =       "Drawing Dynamic Trees"
+, journal =     "IEEE Softw."
+, volume =      7
+, year =        1990
+, pages =       "21--28"
+, keywords =    "graph drawing"
+, update =      "98.07 vismara, 93.09 tamassia"
 }
 
 @mastersthesis{m-rsast-93
-, author =	"S. Mohaban"
-, title =	"Ray shooting amidst spheres in three dimensions"
-, type =	"M. {Sc}. Thesis"
-, school =	"Tel Aviv University"
-, month =	jun
-, year =	1993
-, keywords =	"master thesis"
-, update =	"93.09 milone+mitchell"
+, author =      "S. Mohaban"
+, title =       "Ray shooting amidst spheres in three dimensions"
+, type =        "M. {Sc}. Thesis"
+, school =      "Tel Aviv University"
+, month =       jun
+, year =        1993
+, keywords =    "master thesis"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{ms-rsast-93
-, author =	"S. Mohaban and M. Sharir"
-, title =	"Ray shooting amidst spheres in three dimensions"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "S. Mohaban and M. Sharir"
+, title =       "Ray shooting amidst spheres in three dimensions"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @article{ms-rsast-97
-, author =	"S. Mohaban and Micha Sharir"
-, title =	"Ray shooting amidst spheres in three dimensions and related problems"
-, journal =	"SIAM J. Comput."
-, volume =	26
-, year =	1997
-, pages =	"654--674"
-, update =	"98.03 mitchell, 97.07 smid"
+, author =      "S. Mohaban and Micha Sharir"
+, title =       "Ray shooting amidst spheres in three dimensions and related problems"
+, journal =     "SIAM J. Comput."
+, volume =      26
+, year =        1997
+, pages =       "654--674"
+, update =      "98.03 mitchell, 97.07 smid"
 }
 
 @inproceedings{mr-rplta-01
-, author =	"Ali Mohades and Mohammadreza Razzazi"
-, title =	"Reaching a Point with a Linkage in Two Attached Squares"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"162--165"
-, update =	"01.04 icking"
+, author =      "Ali Mohades and Mohammadreza Razzazi"
+, title =       "Reaching a Point with a Linkage in Two Attached Squares"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "162--165"
+, update =      "01.04 icking"
 }
 
 @techreport{m-spcts-83
-, author =	"J. Mohan"
-, title =	"A Study in Parallel Computation: the Travelling Salesman Problem"
-, number =	"CMU-CS-82-136(R)"
-, institution =	"Dept. Computer Science, Carnegie-Mellon University"
-, address =	"Pittsburgh, USA"
-, year =	1983
-, update =	"93.09 held"
+, author =      "J. Mohan"
+, title =       "A Study in Parallel Computation: the Travelling Salesman Problem"
+, number =      "CMU-CS-82-136(R)"
+, institution = "Dept. Computer Science, Carnegie-Mellon University"
+, address =     "Pittsburgh, USA"
+, year =        1983
+, update =      "93.09 held"
 }
 
 @article{m-ptcpa-93
-, author =	"B. Mohar"
-, title =	"A Polynomial Time Circle Packing Algorithm"
-, journal =	"Discrete Math."
-, volume =	117
-, year =	1993
-, pages =	"257--263"
-, update =	"98.07 tamassia+vismara"
+, author =      "B. Mohar"
+, title =       "A Polynomial Time Circle Packing Algorithm"
+, journal =     "Discrete Math."
+, volume =      117
+, year =        1993
+, pages =       "257--263"
+, update =      "98.07 tamassia+vismara"
 }
 
 @article{m-bc-88
-, author =	"B. Mohar"
-, title =	"Branched coverings"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"339--348"
+, author =      "B. Mohar"
+, title =       "Branched coverings"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "339--348"
 }
 
 @article{m-ngncb-88
-, author =	"B. Mohar"
-, title =	"Nonorientable genus of nearly complete bipartite graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"137--146"
+, author =      "B. Mohar"
+, title =       "Nonorientable genus of nearly complete bipartite graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "137--146"
 }
 
 @inproceedings{mr-faudt-95
-, author =	"B. Mohar and P. Rosenstiehl"
-, title =	"A Flow Approach to Upward Drawings of Toroidal Maps"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"33--39"
-, keywords =	"graph drawing, topological graph theory"
-, update =	"95.01 tamassia"
+, author =      "B. Mohar and P. Rosenstiehl"
+, title =       "A Flow Approach to Upward Drawings of Toroidal Maps"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "33--39"
+, keywords =    "graph drawing, topological graph theory"
+, update =      "95.01 tamassia"
 }
 
 @book{mt-gs-01
-, author =	"Bojan Mohar and Carsten Thomassen"
-, title =	"Graphs on Surfaces"
-, publisher =	"Johns Hopkins University Press"
-, address =	"Baltimore"
-, year =	2001
-, update =	"02.03 icking+pocchiola, 01.11 orourke"
+, author =      "Bojan Mohar and Carsten Thomassen"
+, title =       "Graphs on Surfaces"
+, publisher =   "Johns Hopkins University Press"
+, address =     "Baltimore"
+, year =        2001
+, update =      "02.03 icking+pocchiola, 01.11 orourke"
 }
 
 @incollection{m-ctcos-89
-, author =	"R. H. M{\"o}hring"
-, title =	"Computationally Tractable Classes of Ordered Sets"
-, editor =	"I. Rival"
-, booktitle =	"Algorithms and Order"
-, year =	1989
-, pages =	"105--193"
-, update =	"98.07 bibrelex"
+, author =      "R. H. M{\"o}hring"
+, title =       "Computationally Tractable Classes of Ordered Sets"
+, editor =      "I. Rival"
+, booktitle =   "Algorithms and Order"
+, year =        1989
+, pages =       "105--193"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{mm-cmamr-97
-, author =	"Rolf H. M{\"o}hring and Matthias M{\"u}ller-Hannemann"
-, title =	"Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals"
-, booktitle =	"Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '97"
-, site =	"Singapore"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1350
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"263--272"
-, update =	"98.07 bibrelex+mitchell, 98.03 mitchell"
+, author =      "Rolf H. M{\"o}hring and Matthias M{\"u}ller-Hannemann"
+, title =       "Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals"
+, booktitle =   "Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '97"
+, site =        "Singapore"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1350
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "263--272"
+, update =      "98.07 bibrelex+mitchell, 98.03 mitchell"
 }
 
 @techreport{mmw-mrbfm-96
-, author =	"R. H. M{\"o}hring and M. M{\"u}ller-Hannemann and K. Weihe"
-, title =	"Mesh refinement via bidirected flows: {Modeling}, complexity and computational results"
-, type =	"Report"
-, number =	520
-, institution =	"Dept. Math., Technische Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, year =	1996
-, url =	"http://www.math.TU-Berlin.DE/~mhannema/projecteng.html"
-, update =	"98.07 bibrelex"
+, author =      "R. H. M{\"o}hring and M. M{\"u}ller-Hannemann and K. Weihe"
+, title =       "Mesh refinement via bidirected flows: {Modeling}, complexity and computational results"
+, type =        "Report"
+, number =      520
+, institution = "Dept. Math., Technische Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, year =        1996
+, url = "http://www.math.TU-Berlin.DE/~mhannema/projecteng.html"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{mmw-unfsm-95
-, author =	"Rolf H. M{\"o}hring and Matthias M{\"u}ller-Hannemann and Karsten Weihe"
-, title =	"Using Network Flows for Surface Modeling"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"350--359"
-, keywords =	"mesh generation, CAD, surface refinement"
-, update =	"96.09 agarwal, 96.05 mitchell"
+, author =      "Rolf H. M{\"o}hring and Matthias M{\"u}ller-Hannemann and Karsten Weihe"
+, title =       "Using Network Flows for Surface Modeling"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "350--359"
+, keywords =    "mesh generation, CAD, surface refinement"
+, update =      "96.09 agarwal, 96.05 mitchell"
 }
 
 @book{m-gtd23-77
-, author =	"E. Moise"
-, title =	"Geometric Topology in Dimensions 2 and 3"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1977
-, update =	"98.03 bibrelex"
+, author =      "E. Moise"
+, title =       "Geometric Topology in Dimensions 2 and 3"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1977
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{m-epacb-89
-, author =	"D. Moitra"
-, title =	"Efficient parallel algorithms for covering binary images"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1989
-, note =	"Technical Report TR-89-1013"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "D. Moitra"
+, title =       "Efficient parallel algorithms for covering binary images"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1989
+, note =        "Technical Report TR-89-1013"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @article{m-fmcbi-91
-, author =	"D. Moitra"
-, title =	"Finding a minimal cover for binary images: an optimal parallel algorithm"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"624--657"
+, author =      "D. Moitra"
+, title =       "Finding a minimal cover for binary images: an optimal parallel algorithm"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "624--657"
 }
 
 @article{mt-fmsrt-97
-, author =	"T. M{\"o}ller and B. Trumbore"
-, title =	"Fast, Minimum Storage Ray-Triangle Intersection"
-, journal =	"J. Graphics Tools"
-, volume =	2
-, number =	1
-, year =	1997
-, pages =	"21--28"
-, update =	"97.11 held"
+, author =      "T. M{\"o}ller and B. Trumbore"
+, title =       "Fast, Minimum Storage Ray-Triangle Intersection"
+, journal =     "J. Graphics Tools"
+, volume =      2
+, number =      1
+, year =        1997
+, pages =       "21--28"
+, update =      "97.11 held"
 }
 
 @article{m-udzts-57
-, author =	"J. Moln{\'a}r"
-, title =	"{\"U}ber den zweidimensionalen topologischen {Satz} von {Helly}"
-, journal =	"Mat. Lapok"
-, volume =	8
-, year =	1957
-, pages =	"108--114"
-, note =	"Hungarian with German and Russian Summaries"
-, update =	"98.03 bibrelex"
+, author =      "J. Moln{\'a}r"
+, title =       "{\"U}ber den zweidimensionalen topologischen {Satz} von {Helly}"
+, journal =     "Mat. Lapok"
+, volume =      8
+, year =        1957
+, pages =       "108--114"
+, note =        "Hungarian with German and Russian Summaries"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{mrs-psaaf-96
-, author =	"B. Monien and F. Ramme and H. Salmen"
-, title =	"A Parallel Simulated Annealing Algorithm for Generating {3D} Layouts of Undirected Graphs"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"396--408"
-, keywords =	"graph drawing, 3D, straight-line"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "B. Monien and F. Ramme and H. Salmen"
+, title =       "A Parallel Simulated Annealing Algorithm for Generating {3D} Layouts of Undirected Graphs"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "396--408"
+, keywords =    "graph drawing, 3D, straight-line"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @article{m-csmdc-80
-, author =	"L. Monier"
-, title =	"Combinatorial solutions of multidimensional divide-and-conquer recurrences"
-, journal =	"J. Algorithms"
-, volume =	1
-, year =	1980
-, pages =	"60--74"
+, author =      "L. Monier"
+, title =       "Combinatorial solutions of multidimensional divide-and-conquer recurrences"
+, journal =     "J. Algorithms"
+, volume =      1
+, year =        1980
+, pages =       "60--74"
 }
 
 @inproceedings{mpsy-cemst-88
-, author =	"C. Monma and M. Paterson and Subhash Suri and F. Yao"
-, title =	"Computing {Euclidean} maximum spanning trees"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"241--251"
-, precedes =	"mpsy-cemst-90"
-, cites =	"abky-cabmm-88, akmsw-gamsa-87, a-dp-86, c-hsh-85, e-ga-79, gbt-srtgp-84, gh-hmstp-85, j-hcs-67, j-nccog-82, l-fnvda-80, ps-cgi-85, s-cg-78, ss-pnt-63, tb-gatuf-81, y-cmstk-82, j-snnms-78, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "C. Monma and M. Paterson and Subhash Suri and F. Yao"
+, title =       "Computing {Euclidean} maximum spanning trees"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "241--251"
+, precedes =    "mpsy-cemst-90"
+, cites =       "abky-cabmm-88, akmsw-gamsa-87, a-dp-86, c-hsh-85, e-ga-79, gbt-srtgp-84, gh-hmstp-85, j-hcs-67, j-nccog-82, l-fnvda-80, ps-cgi-85, s-cg-78, ss-pnt-63, tb-gatuf-81, y-cmstk-82, j-snnms-78, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{mpsy-cemst-90
-, author =	"C. Monma and M. Paterson and Subhash Suri and F. Yao"
-, title =	"Computing {Euclidean} maximum spanning trees"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"407--419"
-, succeeds =	"mpsy-cemst-88"
-, update =	"98.03 mitchell"
+, author =      "C. Monma and M. Paterson and Subhash Suri and F. Yao"
+, title =       "Computing {Euclidean} maximum spanning trees"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "407--419"
+, succeeds =    "mpsy-cemst-88"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ms-ppgmm-91
-, author =	"C. Monma and Subhash Suri"
-, title =	"Partitioning points and graphs to minimize the maximum or the sum of diameters"
-, booktitle =	"Graph Theory, Combinatorics and Applications (Proc. 6th Internat. Conf. Theory Appl. Graphs)"
-, volume =	2
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1991
-, pages =	"899--912"
-, update =	"99.11 bibrelex, 98.03 mitchell"
+, author =      "C. Monma and Subhash Suri"
+, title =       "Partitioning points and graphs to minimize the maximum or the sum of diameters"
+, booktitle =   "Graph Theory, Combinatorics and Applications (Proc. 6th Internat. Conf. Theory Appl. Graphs)"
+, volume =      2
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1991
+, pages =       "899--912"
+, update =      "99.11 bibrelex, 98.03 mitchell"
 }
 
 @techreport{ms-setpc-90
-, author =	"C. Monma and Subhash Suri"
-, title =	"Some Embedding and topological problems concerning minimum spanning trees"
-, month =	dec
-, year =	1990
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "C. Monma and Subhash Suri"
+, title =       "Some Embedding and topological problems concerning minimum spanning trees"
+, month =       dec
+, year =        1990
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @techreport{ms-tgmst-91t
-, author =	"C. Monma and Subhash Suri"
-, title =	"Transitions in geometric minimum spanning trees"
-, type =	"Technical {Memorandum}"
-, institution =	"Bell Communications Research"
-, year =	1991
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "C. Monma and Subhash Suri"
+, title =       "Transitions in geometric minimum spanning trees"
+, type =        "Technical {Memorandum}"
+, institution = "Bell Communications Research"
+, year =        1991
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{ms-tgmst-91
-, author =	"C. Monma and Subhash Suri"
-, title =	"Transitions in geometric minimum spanning trees"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"239--249"
-, keywords =	"proximity, minimum spanning tree"
-, cites =	"abky-cabmm-88, a-sdcgp-85, ccpy-nubns-86, cd-vdbcd-85, c-oarn-85, d-mstia-86, e-acg-87, ggt-fpmfa-89, g-bpstp-79, g-saco-80, g-pccpp-83, gi-psmmc-89, gm-fagpm-89, ms-tgmst-91t, pq-samcn-82, pr-cardf-78, st-dsdt-83, t-dsna-83, y-cmstk-82, z-gtmdg-71, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "C. Monma and Subhash Suri"
+, title =       "Transitions in geometric minimum spanning trees"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "239--249"
+, keywords =    "proximity, minimum spanning tree"
+, cites =       "abky-cabmm-88, a-sdcgp-85, ccpy-nubns-86, cd-vdbcd-85, c-oarn-85, d-mstia-86, e-acg-87, ggt-fpmfa-89, g-bpstp-79, g-saco-80, g-pccpp-83, gi-psmmc-89, gm-fagpm-89, ms-tgmst-91t, pq-samcn-82, pr-cardf-78, st-dsdt-83, t-dsna-83, y-cmstk-82, z-gtmdg-71, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{ms-tgmst-92
-, author =	"C. Monma and Subhash Suri"
-, title =	"Transitions in geometric minimum spanning trees"
-, journal =	"Discrete Comput. Geom."
-, volume =	8
-, year =	1992
-, pages =	"265--293"
-, keywords =	"proximity, minimum spanning tree"
-, update =	"98.03 mitchell, 95.09 agarwal"
+, author =      "C. Monma and Subhash Suri"
+, title =       "Transitions in geometric minimum spanning trees"
+, journal =     "Discrete Comput. Geom."
+, volume =      8
+, year =        1992
+, pages =       "265--293"
+, keywords =    "proximity, minimum spanning tree"
+, update =      "98.03 mitchell, 95.09 agarwal"
 }
 
 @article{mrt-ttg-88
-, author =	"C. T. Monma and B. Reed and W. T. Trotter"
-, title =	"Threshold tolerance graphs"
-, journal =	"J. Graph Theory"
-, volume =	12
-, year =	1988
-, pages =	"343--362"
-, update =	"98.11 bibrelex"
+, author =      "C. T. Monma and B. Reed and W. T. Trotter"
+, title =       "Threshold tolerance graphs"
+, journal =     "J. Graph Theory"
+, volume =      12
+, year =        1988
+, pages =       "343--362"
+, update =      "98.11 bibrelex"
 }
 
 @book{m-cacpp-82
-, author =	"M. S. Monmonier"
-, title =	"Computer Assisted Cartography: Principles and Prospects"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs"
-, year =	1982
-, update =	"96.09 kreveld"
+, author =      "M. S. Monmonier"
+, title =       "Computer Assisted Cartography: Principles and Prospects"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs"
+, year =        1982
+, update =      "96.09 kreveld"
 }
 
 @book{m-hlm-91
-, author =	"M. S. Monmonier"
-, title =	"How to Lie with Maps"
-, publisher =	"The Chicago University Press"
-, address =	"Chicago"
-, year =	1991
-, update =	"96.09 kreveld"
+, author =      "M. S. Monmonier"
+, title =       "How to Lie with Maps"
+, publisher =   "The Chicago University Press"
+, address =     "Chicago"
+, year =        1991
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{m-pgrth-91
-, author =	"Paul-Andr{\'e} Monney"
-, title =	"Planar geometric reasoning with the theory of hints"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"141--159"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Paul-Andr{\'e} Monney"
+, title =       "Planar geometric reasoning with the theory of hints"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "141--159"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{mmp-lban2-94
-, author =	"J. L. Monta{\~n}a and J. E. Morais and Luis M. Pardo"
-, title =	"Lower Bounds for Arithmetic Networks {II}: Sum of {Betti} Numbers"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"45--48"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "J. L. Monta{\~n}a and J. E. Morais and Luis M. Pardo"
+, title =       "Lower Bounds for Arithmetic Networks {II}: Sum of {Betti} Numbers"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "45--48"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @article{m-mosuq-68
-, author =	"U. Montanari"
-, title =	"A method for obtaining skeletons using a quasi-{Euclidean} distance"
-, journal =	"J. ACM"
-, volume =	15
-, year =	1968
-, pages =	"600--624"
+, author =      "U. Montanari"
+, title =       "A method for obtaining skeletons using a quasi-{Euclidean} distance"
+, journal =     "J. ACM"
+, volume =      15
+, year =        1968
+, pages =       "600--624"
 }
 
 @article{m-csdi-69
-, author =	"U. Montanari"
-, title =	"Continuous skeletons from digitized images"
-, journal =	"J. ACM"
-, volume =	16
-, year =	1969
-, pages =	"534--549"
-, update =	"93.05 freimer"
+, author =      "U. Montanari"
+, title =       "Continuous skeletons from digitized images"
+, journal =     "J. ACM"
+, volume =      16
+, year =        1969
+, pages =       "534--549"
+, update =      "93.05 freimer"
 }
 
 @article{mss-mluti-94
-, author =	"Claudio Montani and Riccardo Scateni and Roberto Scopigno"
-, title =	"A modified look--up table for implicit disambiguation of {M}arching {C}ubes"
-, journal =	"Visual Comput."
-, volume =	10
-, year =	1994
-, pages =	"353--355"
-, update =	"01.07 wenger"
+, author =      "Claudio Montani and Riccardo Scateni and Roberto Scopigno"
+, title =       "A modified look--up table for implicit disambiguation of {M}arching {C}ubes"
+, journal =     "Visual Comput."
+, volume =      10
+, year =        1994
+, pages =       "353--355"
+, update =      "01.07 wenger"
 }
 
 @article{mt-cmcag-84
-, author =	"Y. Montaudin and W. Tilles"
-, title =	"The {Cayley} method in computer aided geometric design"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	1
-, year =	1984
-, pages =	"309--326"
-, update =	"98.03 bibrelex"
+, author =      "Y. Montaudin and W. Tilles"
+, title =       "The {Cayley} method in computer aided geometric design"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      1
+, year =        1984
+, pages =       "309--326"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{mu-ifp-91
-, author =	"L. Montejano and J. Urrutia"
-, title =	"Immobilizing figures on the plane"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"46--49"
-, cites =	"csu-is-90, mnp-ogp-89, mnp-gg-90, k-dwp-90, o-cgc9-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "L. Montejano and J. Urrutia"
+, title =       "Immobilizing figures on the plane"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "46--49"
+, cites =       "csu-is-90, mnp-ogp-89, mnp-gg-90, k-dwp-90, o-cgc9-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{mr-csrp-94
-, author =	"A. Monti and A. Roncato"
-, title =	"On the Complexity of Some Reachability Problems"
-, booktitle =	"Proc. 2nd Italian Conference on Algorithms and Complexity"
-, year =	1994
-, update =	"95.01 mitchell"
+, author =      "A. Monti and A. Roncato"
+, title =       "On the Complexity of Some Reachability Problems"
+, booktitle =   "Proc. 2nd Italian Conference on Algorithms and Complexity"
+, year =        1994
+, update =      "95.01 mitchell"
 }
 
 @book{m-oe-79
-, author =	"J. Montroll"
-, title =	"Origami for the Enthusiast"
-, publisher =	"Dover"
-, year =	1979
-, update =	"97.11 bibrelex"
+, author =      "J. Montroll"
+, title =       "Origami for the Enthusiast"
+, publisher =   "Dover"
+, year =        1979
+, update =      "97.11 bibrelex"
 }
 
 @book{m-po-89
-, author =	"J. Montroll"
-, title =	"Prehistoric Origami"
-, publisher =	"Dover Publications"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "J. Montroll"
+, title =       "Prehistoric Origami"
+, publisher =   "Dover Publications"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @book{ml-osl-90
-, author =	"J. Montroll and R. J. Lang"
-, title =	"Origami Sea Life"
-, publisher =	"Dover"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "J. Montroll and R. J. Lang"
+, title =       "Origami Sea Life"
+, publisher =   "Dover"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @techreport{mf-lttsp-85
-, author =	"D. Montuno and A. Fournier"
-, title =	"A linear time triangulation for simple polygons"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Toronto"
-, address =	"Toronto, ON"
-, year =	1985
+, author =      "D. Montuno and A. Fournier"
+, title =       "A linear time triangulation for simple polygons"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Toronto"
+, address =     "Toronto, ON"
+, year =        1985
 }
 
 @techreport{mf-diasp-82
-, author =	"D. Montuno and A. Fournier"
-, title =	"Detecting intersections among star polygons"
-, institution =	"University of Toronto"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "D. Montuno and A. Fournier"
+, title =       "Detecting intersections among star polygons"
+, institution = "University of Toronto"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @techreport{mw-mamg-90
-, author =	"D. Moore and J. Warren"
-, title =	"Multidimensional adaptive mesh generation"
-, type =	"Technical {Report}"
-, number =	"90-106"
-, institution =	"Dept. Comput. Sci., Rice Univ."
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "D. Moore and J. Warren"
+, title =       "Multidimensional adaptive mesh generation"
+, type =        "Technical {Report}"
+, number =      "90-106"
+, institution = "Dept. Comput. Sci., Rice Univ."
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{m-smga-92
-, author =	"D. W. Moore"
-, title =	"Simplicial mesh generation with applications"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1992
-, note =	"Report 92-1322"
-, keywords =	"doctoral thesis"
-, update =	"95.01 mitchell"
+, author =      "D. W. Moore"
+, title =       "Simplicial mesh generation with applications"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1992
+, note =        "Report 92-1322"
+, keywords =    "doctoral thesis"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{m-sptm-
-, author =	"E. Moore"
-, title =	"Shortest Path Through a Maze"
-, booktitle =	"Proc. of an International Symposium on the Theory of Switching"
-, publisher =	"Harvard University Press"
-, pages =	"285--292"
-, update =	"93.09 milone+mitchell"
+, author =      "E. Moore"
+, title =       "Shortest Path Through a Maze"
+, booktitle =   "Proc. of an International Symposium on the Theory of Switching"
+, publisher =   "Harvard University Press"
+, pages =       "285--292"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{mw-cdrca-88
-, author =	"M. Moore and J. Willhelms"
-, title =	"Collision detection and response for computer animation"
-, journal =	"Comput. Graph."
-, volume =	22
-, number =	4
-, month =	aug
-, year =	1988
-, pages =	"289--298"
-, note =	"Proc. SIGGRAPH '88"
-, update =	"93.09 milone+mitchell"
+, author =      "M. Moore and J. Willhelms"
+, title =       "Collision detection and response for computer animation"
+, journal =     "Comput. Graph."
+, volume =      22
+, number =      4
+, month =       aug
+, year =        1988
+, pages =       "289--298"
+, note =        "Proc. SIGGRAPH '88"
+, update =      "93.09 milone+mitchell"
 }
 
 @book{m-ia-66
-, author =	"R. E. Moore"
-, title =	"Interval Analysis"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1966
-, update =	"98.03 bibrelex"
+, author =      "R. E. Moore"
+, title =       "Interval Analysis"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1966
+, update =      "98.03 bibrelex"
 }
 
 @book{m-maia-79
-, author =	"R. E. Moore"
-, title =	"Methods and Applications of Interval Analysis"
-, publisher =	"SIAM"
-, year =	1979
-, update =	"98.03 bibrelex"
+, author =      "R. E. Moore"
+, title =       "Methods and Applications of Interval Analysis"
+, publisher =   "SIAM"
+, year =        1979
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{mm-chf-83
-, author =	"F. Mora and H. Moller"
-, title =	"Computation of the {Hilbert} Function"
-, booktitle =	"Proc. European Comput. Algebra Conf."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	162
-, publisher =	"Springer-Verlag"
-, year =	1983
-, pages =	"157--167"
-, update =	"97.11 bibrelex"
+, author =      "F. Mora and H. Moller"
+, title =       "Computation of the {Hilbert} Function"
+, booktitle =   "Proc. European Comput. Algebra Conf."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      162
+, publisher =   "Springer-Verlag"
+, year =        1983
+, pages =       "157--167"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{mh-vdvso-91
-, author =	"B. A. Moran and W. Hansmann"
-, title =	"Visual Design Verification of Sculptured Objects"
-, booktitle =	"Proceedings of the First International Offshore and Polar Engineering Conference"
-, year =	1991
-, update =	"95.05 abrams"
+, author =      "B. A. Moran and W. Hansmann"
+, title =       "Visual Design Verification of Sculptured Objects"
+, booktitle =   "Proceedings of the First International Offshore and Polar Engineering Conference"
+, year =        1991
+, update =      "95.05 abrams"
 }
 
 @article{m-nrsgp-66
-, author =	"P. A. P. Moran"
-, title =	"A note on recent search in geometrical probability"
-, journal =	"J. Appl. Probab."
-, volume =	3
-, year =	1966
-, pages =	"453--463"
+, author =      "P. A. P. Moran"
+, title =       "A note on recent search in geometrical probability"
+, journal =     "J. Appl. Probab."
+, volume =      3
+, year =        1966
+, pages =       "453--463"
 }
 
 @article{m-cdopm-83
-, author =	"S. Moran"
-, title =	"On the complexity of designing optimal partial-match retrieval systems"
-, journal =	"ACM Trans. Database Syst."
-, volume =	8
-, year =	1983
-, pages =	"543--551"
+, author =      "S. Moran"
+, title =       "On the complexity of designing optimal partial-match retrieval systems"
+, journal =     "ACM Trans. Database Syst."
+, volume =      8
+, year =        1983
+, pages =       "543--551"
 }
 
 @article{m-lotcs-84
-, author =	"S. Moran"
-, title =	"On the length of optimal {TSP} circuits in sets of bounded diameter"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	37
-, year =	1984
-, pages =	"113--141"
-, update =	"97.11 bibrelex"
+, author =      "S. Moran"
+, title =       "On the length of optimal {TSP} circuits in sets of bounded diameter"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      37
+, year =        1984
+, pages =       "113--141"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{m-rrvn-81
-, author =	"H. P. Moravac"
-, title =	"Robot Rover Visual Navigation"
-, school =	"Stanford University"
-, year =	1981
-, keywords =	"doctoral thesis"
-, update =	"93.09 milone+mitchell"
+, author =      "H. P. Moravac"
+, title =       "Robot Rover Visual Navigation"
+, school =      "Stanford University"
+, year =        1981
+, keywords =    "doctoral thesis"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{m-oanrw-80
-, author =	"H. P. Moravec"
-, title =	"Obstacle avoidance and navigation in the real world by a setting robot rover"
-, type =	"Report"
-, number =	"STAN-CS-80-813"
-, institution =	"Dept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1980
+, author =      "H. P. Moravec"
+, title =       "Obstacle avoidance and navigation in the real world by a setting robot rover"
+, type =        "Report"
+, number =      "STAN-CS-80-813"
+, institution = "Dept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1980
 }
 
 @phdthesis{m-fhrsg-90
-, author =	"J.-M. Moreau"
-, title =	"Fac{\'e}tisation et hi{\'e}rarchisation de la repr{\'e}sentation par segments d'un graphe planaire dans le cadre d'une arithm{\'e}tique mixte"
-, school =	"{\'E}cole Nationale Sup{\'e}rieure des Mines de Saint-{\'E}tienne"
-, year =	1990
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "J.-M. Moreau"
+, title =       "Fac{\'e}tisation et hi{\'e}rarchisation de la repr{\'e}sentation par segments d'un graphe planaire dans le cadre d'une arithm{\'e}tique mixte"
+, school =      "{\'E}cole Nationale Sup{\'e}rieure des Mines de Saint-{\'E}tienne"
+, year =        1990
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{m-hdt-94
-, author =	"J.-M. Moreau"
-, title =	"Hierarchical {Delaunay} Triangulation"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"165--170"
-, cites =	"a-vdsfg-91, c-cdt-89, c-ucplg-75, c-llpqb-72, f-savd-87, gs-pmgsc-85, ll-gdtpg-86, ls-tacdt-80, mv-cdtr-93, s-ac-90, hsa-fdsc-93, j-cegt-70, s-cdtvd-88, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "J.-M. Moreau"
+, title =       "Hierarchical {Delaunay} Triangulation"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "165--170"
+, cites =       "a-vdsfg-91, c-cdt-89, c-ucplg-75, c-llpqb-72, f-savd-87, gs-pmgsc-85, ll-gdtpg-86, ls-tacdt-80, mv-cdtr-93, s-ac-90, hsa-fdsc-93, j-cegt-70, s-cdtvd-88, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{mv-cdtr-93
-, author =	"J.-M. Moreau and P. Volino"
-, title =	"Constrained {Delaunay} triangulation revisited"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"340--345"
-, cites =	"a-vdsfg-91, bt-hrodt-86, c-cdt-87, c-cdt-89, es-cvdpu-90, f-savd-86, f-savd-87, gs-pmgsc-85, k-eccs-79, l-prp-78p, ll-gdtpg-86, ls-tacdt-80, ps-cgi-85, s-cdtvd-88, sh-cpp-75, dmt-fddtl-91t, ws-oacdt-87, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "J.-M. Moreau and P. Volino"
+, title =       "Constrained {Delaunay} triangulation revisited"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "340--345"
+, cites =       "a-vdsfg-91, bt-hrodt-86, c-cdt-87, c-cdt-89, es-cvdpu-90, f-savd-86, f-savd-87, gs-pmgsc-85, k-eccs-79, l-prp-78p, ll-gdtpg-86, ls-tacdt-80, ps-cgi-85, s-cdtvd-88, sh-cpp-75, dmt-fddtl-91t, ws-oacdt-87, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{m-dtd-82
-, author =	"B. Moret"
-, title =	"Decision trees and diagrams"
-, journal =	"ACM Comput. Surv."
-, volume =	"??"
-, year =	1982
-, pages =	"593--623"
-, update =	"98.03 bibrelex"
+, author =      "B. Moret"
+, title =       "Decision trees and diagrams"
+, journal =     "ACM Comput. Surv."
+, volume =      "??"
+, year =        1982
+, pages =       "593--623"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{mcsy-irp-97
-, author =	"B. M. E. Moret and M. Collins and J. Saia and L. Yu"
-, title =	"The Ice Rink Problem"
-, booktitle =	"Proc. Workshop on Algorithm Engineering"
-, nickname =	"WAE '97"
-, site =	"Venice"
-, month =	sep
-, year =	1997
-, url =	"http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap11.ps.gz"
-, update =	"00.11 smid, 00.07 icking, 98.07 bibrelex+smid+vahrenhold+vismara, 98.03 mitchell+moret"
+, author =      "B. M. E. Moret and M. Collins and J. Saia and L. Yu"
+, title =       "The Ice Rink Problem"
+, booktitle =   "Proc. Workshop on Algorithm Engineering"
+, nickname =    "WAE '97"
+, site =        "Venice"
+, month =       sep
+, year =        1997
+, url = "http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap11.ps.gz"
+, update =      "00.11 smid, 00.07 icking, 98.07 bibrelex+smid+vahrenhold+vismara, 98.03 mitchell+moret"
 }
 
 @inproceedings{ms-eaacm-91
-, author =	"B. M. E. Moret and H. D. Shapiro"
-, title =	"An empirical analysis of algorithms for constructing a minimum spanning tree"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"400--411"
-, update =	"93.05 moret"
+, author =      "B. M. E. Moret and H. D. Shapiro"
+, title =       "An empirical analysis of algorithms for constructing a minimum spanning tree"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "400--411"
+, update =      "93.05 moret"
 }
 
 @inproceedings{ms-hfmst-91
-, author =	"B. M. E. Moret and H. D. Shapiro"
-, title =	"How to find a minimum spanning tree in practice"
-, booktitle =	"Proc. Conf. on New Results and New Trends in Computer Science"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	555
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"192--203"
-, update =	"93.09 erickson, 93.05 moret"
+, author =      "B. M. E. Moret and H. D. Shapiro"
+, title =       "How to find a minimum spanning tree in practice"
+, booktitle =   "Proc. Conf. on New Results and New Trends in Computer Science"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      555
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "192--203"
+, update =      "93.09 erickson, 93.05 moret"
 }
 
 @book{m-gmtbg-88
-, author =	"F. Morgan"
-, title =	"Geometric Measure Theory: a Beginner's Guide"
-, publisher =	"Academic Press"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "F. Morgan"
+, title =       "Geometric Measure Theory: a Beginner's Guide"
+, publisher =   "Academic Press"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{m-mscnr-91
-, author =	"F. Morgan"
-, title =	"Minimal surfaces, crystals, and norms on {$R^{n}$}"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"204--213"
-, cites =	"abfhz-csbp-90, achlkkmh-scmfe-90, achlkkmh-sspmn-91, c-sp-67, c-emnr-89, cr-wim-41, h-sprd-66, lm-mcnif-91, l-emnmo-90, m-gmtbg-88, m-rgbg-91, m-sbcsn-91, t-sssbl-76, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "F. Morgan"
+, title =       "Minimal surfaces, crystals, and norms on {$R^{n}$}"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "204--213"
+, cites =       "abfhz-csbp-90, achlkkmh-scmfe-90, achlkkmh-sspmn-91, c-sp-67, c-emnr-89, cr-wim-41, h-sprd-66, lm-mcnif-91, l-emnmo-90, m-gmtbg-88, m-rgbg-91, m-sbcsn-91, t-sssbl-76, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-rgbg-91
-, author =	"F. Morgan"
-, title =	"{Riemannian} Geometry: a Beginner's guide"
-, type =	"Manuscript"
-, institution =	"Williams College"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "F. Morgan"
+, title =       "{Riemannian} Geometry: a Beginner's guide"
+, type =        "Manuscript"
+, institution = "Williams College"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-sbcsn-91
-, author =	"F. Morgan"
-, title =	"Soap-bubble-clusters, shortest networks, and minimal surfaces"
-, type =	"Preprint"
-, institution =	"Williams College"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "F. Morgan"
+, title =       "Soap-bubble-clusters, shortest networks, and minimal surfaces"
+, type =        "Preprint"
+, institution = "Williams College"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @article{msy-hrord-92
-, author =	"S. Mori and C. Suen and K. Yamamoto"
-, title =	"Historical review of {OCR} research and development"
-, journal =	"Proc. IEEE"
-, volume =	80
-, year =	1992
-, pages =	"1029--1058"
-, update =	"98.07 bibrelex"
+, author =      "S. Mori and C. Suen and K. Yamamoto"
+, title =       "Historical review of {OCR} research and development"
+, journal =     "Proc. IEEE"
+, volume =      80
+, year =        1992
+, pages =       "1029--1058"
+, update =      "98.07 bibrelex"
 }
 
 @article{myy-rmrhc-84
-, author =	"S. Mori and K. Yamamoto and M. Yasuda"
-, title =	"Research on machine recognition of handprinted characters"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-6"
-, year =	1984
-, pages =	"386--405"
-, update =	"98.07 bibrelex"
+, author =      "S. Mori and K. Yamamoto and M. Yasuda"
+, title =       "Research on machine recognition of handprinted characters"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-6"
+, year =        1984
+, pages =       "386--405"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{mpz-cgmlp-96
-, author =	"T. L. Morin and N. Prabhu and Z. Zhang"
-, title =	"Complexity of the gravitational method for linear programming"
-, booktitle =	"Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1180
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"212--223"
-, update =	"97.03 smid"
+, author =      "T. L. Morin and N. Prabhu and Z. Zhang"
+, title =       "Complexity of the gravitational method for linear programming"
+, booktitle =   "Proc. 16th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1180
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "212--223"
+, update =      "97.03 smid"
 }
 
 @phdthesis{m-tphpu-73
-, author =	"H. C. Morris"
-, title =	"Two pigeon hole principles and unions of convexly disjoint sets"
-, school =	"Califonia Inst. Tech."
-, address =	"Pasadena, CA"
-, year =	1973
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "H. C. Morris"
+, title =       "Two pigeon hole principles and unions of convexly disjoint sets"
+, school =      "Califonia Inst. Tech."
+, address =     "Pasadena, CA"
+, year =        1973
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{mn-salfl-80
-, author =	"J. G. Morris and J. P. Norback"
-, title =	"A simple approach to linear facility location"
-, journal =	"Transp. Sci."
-, volume =	14
-, year =	1980
-, pages =	"1--8"
-, update =	"98.03 bibrelex"
+, author =      "J. G. Morris and J. P. Norback"
+, title =       "A simple approach to linear facility location"
+, journal =     "Transp. Sci."
+, volume =      14
+, year =        1980
+, pages =       "1--8"
+, update =      "98.03 bibrelex"
 }
 
 @article{ms-esppc-00
-, author =	"W. Morris and V. Soltan"
-, title =	"The {Erd{\H{o}}s-Szekeres} problem on points in convex position - a survey"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	37
-, year =	2000
-, pages =	"437--458"
-, update =	"02.03 devillers"
+, author =      "W. Morris and V. Soltan"
+, title =       "The {Erd{\H{o}}s-Szekeres} problem on points in convex position - a survey"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      37
+, year =        2000
+, pages =       "437--458"
+, update =      "02.03 devillers"
 }
 
 @book{m-cghgm-90
-, author =	"M. E. Mortenson"
-, title =	"Computer Graphics Handbook: Geometry and Mathematics"
-, publisher =	"Industrial Press"
-, year =	1990
-, isbn =	"0-8311-1002-3"
-, update =	"93.09 held"
-, annote =	"a self-contained collection of analytic geometry concepts"
+, author =      "M. E. Mortenson"
+, title =       "Computer Graphics Handbook: Geometry and Mathematics"
+, publisher =   "Industrial Press"
+, year =        1990
+, isbn =        "0-8311-1002-3"
+, update =      "93.09 held"
+, annote =      "a self-contained collection of analytic geometry concepts"
 }
 
 @book{m-gm-85
-, author =	"M. E. Mortenson"
-, title =	"Geometric Modeling"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1985
-, update =	"99.11 bibrelex, 93.05 orourke"
+, author =      "M. E. Mortenson"
+, title =       "Geometric Modeling"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1985
+, update =      "99.11 bibrelex, 93.05 orourke"
 }
 
 @techreport{m-cogdb-66
-, author =	"G. M. Morton"
-, title =	"A computer oriented geodetic data base and a new technique in file sequencing"
-, institution =	"IBM Ltd."
-, address =	"Ottawa, Canada"
-, year =	1966
-, update =	"97.07 agarwal"
+, author =      "G. M. Morton"
+, title =       "A computer oriented geodetic data base and a new technique in file sequencing"
+, institution = "IBM Ltd."
+, address =     "Ottawa, Canada"
+, year =        1966
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{mf-iicsf-96
-, author =	"S. M. Morvan and G. M. Fadel"
-, title =	"IVECS, interactive correction of .{STL} files in a virtual environment"
-, booktitle =	"Proc. Sympos. on Solid Freeform Fabrication"
-, site =	"Austin, TX"
-, organization =	"Dept. Mech. Eng., Univ. Texas Austin"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "S. M. Morvan and G. M. Fadel"
+, title =       "IVECS, interactive correction of .{STL} files in a virtual environment"
+, booktitle =   "Proc. Sympos. on Solid Freeform Fabrication"
+, site =        "Austin, TX"
+, organization =        "Dept. Mech. Eng., Univ. Texas Austin"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{myap-vimps-95
-, author =	"M. A. Mosaad and X. Ye and S. L. Abrams and N. M. Patrikalakis"
-, title =	"Visualization and Information Modeling of Propeller Surface Roughness"
-, booktitle =	"Proc. IMAM '95, 7th International Maritime Association of Mediterranean Congress"
-, year =	1995
-, update =	"95.09 korneenko, 95.05 abrams"
+, author =      "M. A. Mosaad and X. Ye and S. L. Abrams and N. M. Patrikalakis"
+, title =       "Visualization and Information Modeling of Propeller Surface Roughness"
+, booktitle =   "Proc. IMAM '95, 7th International Maritime Association of Mediterranean Congress"
+, year =        1995
+, update =      "95.09 korneenko, 95.05 abrams"
 }
 
 @article{m-dddnp-52
-, author =	"L. Moser"
-, title =	"On the different distances determined by $n$ points"
-, journal =	"Amer. Math. Monthly"
-, volume =	59
-, year =	1952
-, pages =	"85--91"
-, update =	"98.07 bibrelex"
+, author =      "L. Moser"
+, title =       "On the different distances determined by $n$ points"
+, journal =     "Amer. Math. Monthly"
+, volume =      59
+, year =        1952
+, pages =       "85--91"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{m-rpdg-81
-, author =	"W. Moser"
-, title =	"Research Problems in Discrete Geometry"
-, institution =	"Dept. Math., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "W. Moser"
+, title =       "Research Problems in Discrete Geometry"
+, institution = "Dept. Math., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @incollection{mp-rdcg-93
-, author =	"W. Moser and J. Pach"
-, title =	"Recent Developments in Combinatorial Geometry"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"281--302"
-, keywords =	"survey paper, combinatorial geometry, distance distribution, geometric graphs, lines in space"
-, update =	"93.09 erickson+rote"
+, author =      "W. Moser and J. Pach"
+, title =       "Recent Developments in Combinatorial Geometry"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "281--302"
+, keywords =    "survey paper, combinatorial geometry, distance distribution, geometric graphs, lines in space"
+, update =      "93.09 erickson+rote"
 }
 
 % ### others?
 @incollection{m-pepfs-85
-, author =	"W. O. J. Moser"
-, title =	"Problems on extremal properties of a finite set of points"
-, editor =	"Goodman and others"
-, booktitle =	"??"
-, publisher =	"New York Academy of Sciences"
-, year =	1985
-, pages =	"52--64"
-, update =	"97.11 bibrelex"
+, author =      "W. O. J. Moser"
+, title =       "Problems on extremal properties of a finite set of points"
+, editor =      "Goodman and others"
+, booktitle =   "??"
+, publisher =   "New York Academy of Sciences"
+, year =        1985
+, pages =       "52--64"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{m-bafva-89
-, author =	"G. S. Moss"
-, title =	"``{BURST}:'' {Air} {Force} vulnerability analyses from {BRL-CAD} models"
-, booktitle =	"Proc. BRL-CAD Symposium `89"
-, publisher =	"American Defense Preparadness Assoc."
-, address =	"Aberdeen Proving Ground, MD"
-, year =	1989
-, pages =	"88--109"
-, update =	"95.05 agarwal"
+, author =      "G. S. Moss"
+, title =       "``{BURST}:'' {Air} {Force} vulnerability analyses from {BRL-CAD} models"
+, booktitle =   "Proc. BRL-CAD Symposium `89"
+, publisher =   "American Defense Preparadness Assoc."
+, address =     "Aberdeen Proving Ground, MD"
+, year =        1989
+, pages =       "88--109"
+, update =      "95.05 agarwal"
 }
 
 @article{m-snaga-67
-, author =	"W. W. Moss"
-, title =	"Some new analytic and graphic approaches to numerical taxonomy, with an example from the dermanyssidae"
-, journal =	"Systematic Zoology"
-, volume =	16
-, year =	1967
-, pages =	"177--207"
+, author =      "W. W. Moss"
+, title =       "Some new analytic and graphic approaches to numerical taxonomy, with an example from the dermanyssidae"
+, journal =     "Systematic Zoology"
+, volume =      16
+, year =        1967
+, pages =       "177--207"
 }
 
 @incollection{mfs-2dcmc-87
-, author =	"R. C. Mosteller and A. H. Frey and R. Suaya"
-, title =	"$2$-d compaction a {Monte}-{Carlo} method"
-, editor =	"P. Lasleber"
-, booktitle =	"Advanced Research in VLSI"
-, publisher =	"MIT Press"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "R. C. Mosteller and A. H. Frey and R. Suaya"
+, title =       "$2$-d compaction a {Monte}-{Carlo} method"
+, editor =      "P. Lasleber"
+, booktitle =   "Advanced Research in VLSI"
+, publisher =   "MIT Press"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{mas-ast-90
-, author =	"P. H. Mott and A. S. Argon and U. W. Suter"
-, title =	"The atomic strain tensor"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"125--128"
-, cites =	"too-natdv-83, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. H. Mott and A. S. Argon and U. W. Suter"
+, title =       "The atomic strain tensor"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "125--128"
+, cites =       "too-natdv-83, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{m-hmcs-96
-, author =	"R. Motwani"
-, title =	"Hashing Molecules for Common Substructures"
-, type =	"Working paper"
-, institution =	"??"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "R. Motwani"
+, title =       "Hashing Molecules for Common Substructures"
+, type =        "Working paper"
+, institution = "??"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{mnn-pmydp-89
-, author =	"R. Motwani and J. Naor and M. Naor"
-, title =	"The probabilistic method yields deterministic parallel algorithms"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"8--13"
-, keywords =	"random sampling, derandomization"
-, comments =	"to appear in J. Comput. Syst. Sci."
+, author =      "R. Motwani and J. Naor and M. Naor"
+, title =       "The probabilistic method yields deterministic parallel algorithms"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "8--13"
+, keywords =    "random sampling, derandomization"
+, comments =    "to appear in J. Comput. Syst. Sci."
 }
 
 @inproceedings{mr-ddsqd-86
-, author =	"R. Motwani and P. Raghavan"
-, title =	"Deferred data structuring: query-driven preprocessing for geometric search problems"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"303--312"
-, precedes =	"kmr-dds-88"
-, cites =	"b-lbact-83, b-mdc-80, cgl-pgd-83, d-ltatt-84, km-pstoo-85, ks-upcha-82, m-pst-85, m-ltalp-83, sh-cpp-75, sh-gip-76, s-cg-78, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "R. Motwani and P. Raghavan"
+, title =       "Deferred data structuring: query-driven preprocessing for geometric search problems"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "303--312"
+, precedes =    "kmr-dds-88"
+, cites =       "b-lbact-83, b-mdc-80, cgl-pgd-83, d-ltatt-84, km-pstoo-85, ks-upcha-82, m-pst-85, m-ltalp-83, sh-cpp-75, sh-gip-76, s-cg-78, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @book{mr-ra-95
-, author =	"R. Motwani and P. Raghavan"
-, title =	"Randomized Algorithms"
-, publisher =	"Cambridge University Press"
-, address =	"New York, NY"
-, year =	1995
-, update =	"97.03 agarwal, 96.05 ramkumar+smid"
+, author =      "R. Motwani and P. Raghavan"
+, title =       "Randomized Algorithms"
+, publisher =   "Cambridge University Press"
+, address =     "New York, NY"
+, year =        1995
+, update =      "97.03 agarwal, 96.05 ramkumar+smid"
 }
 
 @inproceedings{mrs-copsp-88
-, author =	"R. Motwani and A. Raghunathan and H. Saran"
-, title =	"Covering orthogonal polygons with star polygons: the perfect graph approach"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"211--223"
-, precedes =	"mrs-copsp-89"
-, cites =	"a-agpiv-84, cr-dduap-87, gj-cigtn-79, g-amcmc-72, g-agtpg-80, gls-emicc-81, h-wtg-85, hhm-owtg-87, k-mchco-86, l-pg-83, m-udzts-57, mrs-pgocc-89, o-agta-87, rc-csopm-87, r-cocpt-87, os-snhpd-83, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "R. Motwani and A. Raghunathan and H. Saran"
+, title =       "Covering orthogonal polygons with star polygons: the perfect graph approach"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "211--223"
+, precedes =    "mrs-copsp-89"
+, cites =       "a-agpiv-84, cr-dduap-87, gj-cigtn-79, g-amcmc-72, g-agtpg-80, gls-emicc-81, h-wtg-85, hhm-owtg-87, k-mchco-86, l-pg-83, m-udzts-57, mrs-pgocc-89, o-agta-87, rc-csopm-87, r-cocpt-87, os-snhpd-83, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{mrs-copsp-89
-, author =	"R. Motwani and A. Raghunathan and H. Saran"
-, title =	"Covering orthogonal polygons with star polygons: the perfect graph approach"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	40
-, year =	1989
-, pages =	"19--48"
-, keywords =	"perfect graphs, polygon covering"
-, succeeds =	"mrs-copsp-88"
+, author =      "R. Motwani and A. Raghunathan and H. Saran"
+, title =       "Covering orthogonal polygons with star polygons: the perfect graph approach"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      40
+, year =        1989
+, pages =       "19--48"
+, keywords =    "perfect graphs, polygon covering"
+, succeeds =    "mrs-copsp-88"
 }
 
 @article{mrs-pgocc-88
-, author =	"R. Motwani and A. Raghunathan and H. Saran"
-, title =	"Perfect Graphs and Orthogonally Convex Covers"
-, journal =	"4th SIAM Conf. on Discr. Math."
-, volume =	"??"
-, month =	jun
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "R. Motwani and A. Raghunathan and H. Saran"
+, title =       "Perfect Graphs and Orthogonally Convex Covers"
+, journal =     "4th SIAM Conf. on Discr. Math."
+, volume =      "??"
+, month =       jun
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @article{mrs-pgocc-89
-, author =	"R. Motwani and A. Raghunathan and H. Saran"
-, title =	"Perfect graphs and orthogonally convex covers"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	2
-, year =	1989
-, pages =	"371--392"
-, keywords =	"perfect graphs, polygon covering"
+, author =      "R. Motwani and A. Raghunathan and H. Saran"
+, title =       "Perfect graphs and orthogonally convex covers"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      2
+, year =        1989
+, pages =       "371--392"
+, keywords =    "perfect graphs, polygon covering"
 }
 
 @article{m-lpcpf-51
-, author =	"T. Motzkin"
-, title =	"The lines and planes connecting the points of a finite set"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	70
-, year =	1951
-, pages =	"451--464"
-, update =	"98.07 devillers"
+, author =      "T. Motzkin"
+, title =       "The lines and planes connecting the points of a finite set"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      70
+, year =        1951
+, pages =       "451--464"
+, update =      "98.07 devillers"
 }
 
 @article{mrtt-ddm-53
-, author =	"T. S. Motzkin and H. Raiffa and G. L. Thompson and R. M. Thrall"
-, title =	"The Double Desription Method"
-, journal =	"Annals of Math. Studies"
-, volume =	8
-, year =	1953
-, update =	"97.11 bibrelex"
+, author =      "T. S. Motzkin and H. Raiffa and G. L. Thompson and R. M. Thrall"
+, title =       "The Double Desription Method"
+, journal =     "Annals of Math. Studies"
+, volume =      8
+, year =        1953
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{m-mospv-90
-, author =	"N. Mouawad"
-, title =	"Minimal obscuring sets: the parallel view case"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"232--235"
-, cites =	"ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "N. Mouawad"
+, title =       "Minimal obscuring sets: the parallel view case"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "232--235"
+, cites =       "ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{m-nvg-??
-, author =	"N. Mouawad"
-, title =	"On the nature of visibility graphs"
-, institution =	"University of Waterloo"
-, year =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "N. Mouawad"
+, title =       "On the nature of visibility graphs"
+, institution = "University of Waterloo"
+, year =        "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{m-mcscp-91
-, author =	"Naji Mouawad"
-, title =	"The minimal cone-segment cover problem"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"100--103"
-, cites =	"b-lbact-83, dls-rphs-88, s-mplbc-85, h-tsm-85, hv-splsp-49, ll-ccmp-84, m-dsass-81, o-agta-87, v-msv-53, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "Naji Mouawad"
+, title =       "The minimal cone-segment cover problem"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "100--103"
+, cites =       "b-lbact-83, dls-rphs-88, s-mplbc-85, h-tsm-85, hv-splsp-49, ll-ccmp-84, m-dsass-81, o-agta-87, v-msv-53, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ms-sp-89
-, author =	"N. Mouawad and T. Shermer"
-, title =	"The {Superman} problem"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	39
-, update =	"95.01 smid"
+, author =      "N. Mouawad and T. Shermer"
+, title =       "The {Superman} problem"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       39
+, update =      "95.01 smid"
 }
 
 @article{ms-sp-94
-, author =	"N. Mouawad and T. Shermer"
-, title =	"The {Superman} problem"
-, journal =	"Visual Comput."
-, volume =	10
-, year =	1994
-, pages =	"459--473"
-, update =	"95.01 smid"
+, author =      "N. Mouawad and T. Shermer"
+, title =       "The {Superman} problem"
+, journal =     "Visual Comput."
+, volume =      10
+, year =        1994
+, pages =       "459--473"
+, update =      "95.01 smid"
 }
 
 @incollection{m-gi-97
-, author =	"D. Mount"
-, title =	"Geometric intersection"
-, chapter =	33
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"615--632"
-, update =	"97.11 orourke"
+, author =      "D. Mount"
+, title =       "Geometric intersection"
+, chapter =     33
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "615--632"
+, update =      "97.11 orourke"
 }
 
 @inproceedings{m-idssp-92
-, author =	"D. M. Mount"
-, title =	"Intersection detection and separators for simple polygons"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"303--311"
-, cites =	"c-tsplt-90i, cd-icott-87, cegghss-rspug-91, cg-vippg-89, ck-plscc-89, dk-dsppu-90, e-cedbt-85, f-fapct-85, gs-pmgsc-85, km-accvd-91, ls-pptmc-87, ps-cgi-85, s-dasds-90, s-ltaml-86, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. M. Mount"
+, title =       "Intersection detection and separators for simple polygons"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "303--311"
+, cites =       "c-tsplt-90i, cd-icott-87, cegghss-rspug-91, cg-vippg-89, ck-plscc-89, dk-dsppu-90, e-cedbt-85, f-fapct-85, gs-pmgsc-85, km-accvd-91, ls-pptmc-87, ps-cgi-85, s-dasds-90, s-ltaml-86, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-fspcp-85
-, author =	"D. M. Mount"
-, title =	"On Finding Shortest Paths on Convex Polyhedra"
-, type =	"Technical {Report}"
-, number =	1495
-, institution =	"Department of Computer Science, University of Maryland"
-, year =	1985
-, update =	"95.09 agarwal"
+, author =      "D. M. Mount"
+, title =       "On Finding Shortest Paths on Convex Polyhedra"
+, type =        "Technical {Report}"
+, number =      1495
+, institution = "Department of Computer Science, University of Maryland"
+, year =        1985
+, update =      "95.09 agarwal"
 }
 
 @inproceedings{m-ssps-86
-, author =	"D. M. Mount"
-, title =	"Storing the subdivision of a polyhedral surface"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"150--158"
-, precedes =	"m-ssps-87"
-, cites =	"dk-fdpi-83, dm-eup-85, egs-oplms-86, gs-pmgsc-85, k-osps-83, lp-lppsi-77, mmp-dgp-87, m-fspcp-85, m-vdsp-85, mp-fitcp-78, p-nappl-81, sh-cpp-75, ss-spps-84, s-icpps-85, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. M. Mount"
+, title =       "Storing the subdivision of a polyhedral surface"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "150--158"
+, precedes =    "m-ssps-87"
+, cites =       "dk-fdpi-83, dm-eup-85, egs-oplms-86, gs-pmgsc-85, k-osps-83, lp-lppsi-77, mmp-dgp-87, m-fspcp-85, m-vdsp-85, mp-fitcp-78, p-nappl-81, sh-cpp-75, ss-spps-84, s-icpps-85, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{m-ssps-87
-, author =	"D. M. Mount"
-, title =	"Storing the subdivision of a polyhedral surface"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"153--174"
-, succeeds =	"m-ssps-86"
+, author =      "D. M. Mount"
+, title =       "Storing the subdivision of a polyhedral surface"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "153--174"
+, succeeds =    "m-ssps-86"
 }
 
 @techreport{m-ddlpc-91
-, author =	"D. M. Mount"
-, title =	"The densest double-lattice packing of a convex polygon"
-, type =	"Report"
-, number =	2584
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1991
-, keywords =	"packing, convex"
-, update =	"95.09 agarwal"
+, author =      "D. M. Mount"
+, title =       "The densest double-lattice packing of a convex polygon"
+, type =        "Report"
+, number =      2584
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1991
+, keywords =    "packing, convex"
+, update =      "95.09 agarwal"
 }
 
 @incollection{m-ddlpc-91i
-, author =	"D. M. Mount"
-, title =	"The densest double-lattice packing of a convex polygon"
-, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
-, booktitle =	"Discrete Comput. Geom."
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1991
-, pages =	"245--262"
-, update =	"98.03 bibrelex"
+, author =      "D. M. Mount"
+, title =       "The densest double-lattice packing of a convex polygon"
+, editor =      "J. E. Goodman and R. Pollack and W. Steiger"
+, booktitle =   "Discrete Comput. Geom."
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1991
+, pages =       "245--262"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{m-nspsp-86
-, author =	"D. M. Mount"
-, title =	"The number of shortest paths on the surface of a polyhedron"
-, type =	"Report"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "D. M. Mount"
+, title =       "The number of shortest paths on the surface of a polyhedron"
+, type =        "Report"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @article{m-nspsp-90
-, author =	"D. M. Mount"
-, title =	"The number of shortest paths on the surface of a polyhedron"
-, journal =	"SIAM J. Comput."
-, volume =	19
-, year =	1990
-, pages =	"593--611"
+, author =      "D. M. Mount"
+, title =       "The number of shortest paths on the surface of a polyhedron"
+, journal =     "SIAM J. Comput."
+, volume =      19
+, year =        1990
+, pages =       "593--611"
 }
 
 @techreport{m-vdsp-85
-, author =	"D. M. Mount"
-, title =	"Voronoi Diagrams on the Surface of a Polyhedron"
-, type =	"Technical Report"
-, number =	1496
-, institution =	"Department of Computer Science, University of Maryland"
-, year =	1985
-, update =	"93.09 milone+mitchell"
+, author =      "D. M. Mount"
+, title =       "Voronoi Diagrams on the Surface of a Polyhedron"
+, type =        "Technical Report"
+, number =      1496
+, institution = "Department of Computer Science, University of Maryland"
+, year =        1985
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{mc-uafet-88
-, author =	"D. M. Mount and S. Chandran"
-, title =	"A unified approach to finding enclosing and enclosed triangles"
-, booktitle =	"Proc. 26th Allerton Conf. Commun. Control Comput."
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "D. M. Mount and S. Chandran"
+, title =       "A unified approach to finding enclosing and enclosed triangles"
+, booktitle =   "Proc. 26th Allerton Conf. Commun. Control Comput."
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{mn-earca-93
-, author =	"D. M. Mount and N. Netanyahu"
-, title =	"Efficient algorithms for robust circular arc estimators"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"79--84"
-, succeeds =	"mn-earca-93u"
-, cites =	"am-rsss-92, a-afccf-90, c-ocfod-90, ck-ocfwd-93, csss-otass-89, clr-ia-90, dmn-rass-92, hrrs-rsabi-86, m-ept-91, m-roass-91, mmn-erarm-93, mn-earca-93u, rl-rrod-87, s-ercbk-68, s-rrurm-82, sw-rssf-92, to-lseec-89a, t-mlpra1-50, t-mlpra2-50, t-mlpra3-50, tc-saeca-89, ZZZ"
-, update =	"98.11 bibrelex, 95.09 agarwal, 93.09 milone+mitchell"
+, author =      "D. M. Mount and N. Netanyahu"
+, title =       "Efficient algorithms for robust circular arc estimators"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "79--84"
+, succeeds =    "mn-earca-93u"
+, cites =       "am-rsss-92, a-afccf-90, c-ocfod-90, ck-ocfwd-93, csss-otass-89, clr-ia-90, dmn-rass-92, hrrs-rsabi-86, m-ept-91, m-roass-91, mmn-erarm-93, mn-earca-93u, rl-rrod-87, s-ercbk-68, s-rrurm-82, sw-rssf-92, to-lseec-89a, t-mlpra1-50, t-mlpra2-50, t-mlpra3-50, tc-saeca-89, ZZZ"
+, update =      "98.11 bibrelex, 95.09 agarwal, 93.09 milone+mitchell"
 }
 
 @techreport{mn-ceahr-91
-, author =	"D. M. Mount and N. S. Netanyahu"
-, title =	"Computationally Efficient Algorithms for a Highly Robust Line Estimators"
-, type =	"Technical Report"
-, number =	"CS-TR-2816"
-, institution =	"Center for Automation Research, University of Maryland"
-, month =	dec
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "D. M. Mount and N. S. Netanyahu"
+, title =       "Computationally Efficient Algorithms for a Highly Robust Line Estimators"
+, type =        "Technical Report"
+, number =      "CS-TR-2816"
+, institution = "Center for Automation Research, University of Maryland"
+, month =       dec
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{mn-ceahd-92u
-, author =	"D. M. Mount and N. S. Netanyahu"
-, title =	"Computationally efficient algorithms for high-dimensional robust estimators"
-, year =	1992
-, note =	"Technical Report in preparation, Center for Automation Research, University of Maryland"
-, precedes =	"mn-ceahd-92"
-, update =	"98.07 bibrelex"
+, author =      "D. M. Mount and N. S. Netanyahu"
+, title =       "Computationally efficient algorithms for high-dimensional robust estimators"
+, year =        1992
+, note =        "Technical Report in preparation, Center for Automation Research, University of Maryland"
+, precedes =    "mn-ceahd-92"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{mn-ceahd-92
-, author =	"D. M. Mount and N. S. Netanyahu"
-, title =	"Computationally efficient algorithms for high-dimensional robust estimators"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"257--263"
-, succeeds =	"mn-ceahd-92u"
-, cites =	"dmn-rass-92, dh-nbp-83, es-cmsrl-90, gp-ms-83, m-roass-91, r-msr-84, ss-tseal-87, sw-frmrl-92, t-mlpra1-50, csss-otass-89, mmn-erarm-92, mn-ceahr-91, mn-ceahd-92u, n-ceare-91, on-rerc-84, rl-rrod-87, s-ercbk-68, s-rrurm-82, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "D. M. Mount and N. S. Netanyahu"
+, title =       "Computationally efficient algorithms for high-dimensional robust estimators"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "257--263"
+, succeeds =    "mn-ceahd-92u"
+, cites =       "dmn-rass-92, dh-nbp-83, es-cmsrl-90, gp-ms-83, m-roass-91, r-msr-84, ss-tseal-87, sw-frmrl-92, t-mlpra1-50, csss-otass-89, mmn-erarm-92, mn-ceahr-91, mn-ceahd-92u, n-ceare-91, on-rerc-84, rl-rrod-87, s-ercbk-68, s-rrurm-82, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @unpublished{mn-earca-93u
-, author =	"D. M. Mount and N. S. Netanyahu"
-, title =	"Efficient algorithms for robust circular arc estimators"
-, note =	"technical report in preparation"
-, precedes =	"mn-earca-93"
-, update =	"98.11 bibrelex"
+, author =      "D. M. Mount and N. S. Netanyahu"
+, title =       "Efficient algorithms for robust circular arc estimators"
+, note =        "technical report in preparation"
+, precedes =    "mn-earca-93"
+, update =      "98.11 bibrelex"
 }
 
 @article{mn-erare-01
-, author =	"D. M. Mount and N. S. Netanyahu"
-, title =	"Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"1--33"
-, update =	"01.07 smid"
+, author =      "D. M. Mount and N. S. Netanyahu"
+, title =       "Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "1--33"
+, update =      "01.07 smid"
 }
 
 @article{mnpsw-qarse-00
-, author =	"D. M. Mount and N. S. Netanyahu and C. D. Piatko and R. Silverman and A. Y. Wu"
-, title =	"Quantile approximation for robust statistical estimation and {$k$}-enclosing problems"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, year =	2000
-, pages =	"593--608"
-, update =	"01.04 smid"
+, author =      "D. M. Mount and N. S. Netanyahu and C. D. Piatko and R. Silverman and A. Y. Wu"
+, title =       "Quantile approximation for robust statistical estimation and {$k$}-enclosing problems"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, year =        2000
+, pages =       "593--608"
+, update =      "01.04 smid"
 }
 
 @inproceedings{mnrsy-paall-97
-, author =	"D. M. Mount and N. S. Netanyahu and K. R. Romanik and R. Silverman and A. Y. Yu"
-, title =	"A Practical Approximation Algorithm for the LMS Line Estimator"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, month =	jan
-, year =	1997
-, pages =	"473--482"
-, update =	"97.03 held"
+, author =      "D. M. Mount and N. S. Netanyahu and K. R. Romanik and R. Silverman and A. Y. Yu"
+, title =       "A Practical Approximation Algorithm for the LMS Line Estimator"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, month =       jan
+, year =        1997
+, pages =       "473--482"
+, update =      "97.03 held"
 }
 
 @inproceedings{mnsw-cnnsq-95
-, author =	"David M. Mount and Nathan S. Netanyahu and Ruth Silverman and Angela Y. Wu"
-, title =	"Chromatic Nearest Neighbour Searching: a Query Sensitive Approach"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"261--266"
-, precedes =	"mnsw-cnnsq-00"
-, update =	"01.04 icking, 95.09 jones"
+, author =      "David M. Mount and Nathan S. Netanyahu and Ruth Silverman and Angela Y. Wu"
+, title =       "Chromatic Nearest Neighbour Searching: a Query Sensitive Approach"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "261--266"
+, precedes =    "mnsw-cnnsq-00"
+, update =      "01.04 icking, 95.09 jones"
 }
 
 @article{mnsw-cnnsq-00
-, author =	"David M. Mount and Nathan S. Netanyahu and Ruth Silverman and Angela Y. Wu"
-, title =	"Chromatic Nearest Neighbour Searching: a Query Sensitive Approach"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	17
-, year =	2000
-, pages =	"97--119"
-, succeeds =	"mnsw-cnnsq-95"
-, update =	"01.04 icking+smid"
+, author =      "David M. Mount and Nathan S. Netanyahu and Ruth Silverman and Angela Y. Wu"
+, title =       "Chromatic Nearest Neighbour Searching: a Query Sensitive Approach"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      17
+, year =        2000
+, pages =       "97--119"
+, succeeds =    "mnsw-cnnsq-95"
+, update =      "01.04 icking+smid"
 }
 
 @inproceedings{ms-getcc-88
-, author =	"D. M. Mount and A. Saalfeld"
-, title =	"Globally-equiangular triangulations of co-circular points in {$O(n \log n)$} time"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"143--152"
-, cites =	"e-p33-87, e-acg-87, or-imtfe-76, ps-cgi-85, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "D. M. Mount and A. Saalfeld"
+, title =       "Globally-equiangular triangulations of co-circular points in {$O(n \log n)$} time"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "143--152"
+, cites =       "e-p33-87, e-acg-87, or-imtfe-76, ps-cgi-85, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{ms-pcptc-90
-, author =	"D. M. Mount and R. Silverman"
-, title =	"Packing and covering the plane with translates of a convex polygon"
-, journal =	"J. Algorithms"
-, volume =	11
-, year =	1990
-, pages =	"564--580"
-, keywords =	"packing, decomposition"
-, update =	"95.09 agarwal"
+, author =      "D. M. Mount and R. Silverman"
+, title =       "Packing and covering the plane with translates of a convex polygon"
+, journal =     "J. Algorithms"
+, volume =      11
+, year =        1990
+, pages =       "564--580"
+, keywords =    "packing, decomposition"
+, update =      "95.09 agarwal"
 }
 
 @article{msw-aotp-93
-, author =	"D. M. Mount and R. Silverman and A. Wu"
-, title =	"On the area of overlap of translated polygons"
-, journal =	"SPIE Vision Geometry II"
-, volume =	2060
-, year =	1993
-, pages =	"254--264"
-, update =	"99.11 devillers"
+, author =      "D. M. Mount and R. Silverman and A. Wu"
+, title =       "On the area of overlap of translated polygons"
+, journal =     "SPIE Vision Geometry II"
+, volume =      2060
+, year =        1993
+, pages =       "254--264"
+, update =      "99.11 devillers"
 }
 
 % c-stsar-94 quotes this work incompletely.
 @phdthesis{m--83
-, author =	"J. T. Mowchenko"
-, title =	"??"
-, school =	"Department of Electrical Engineering, University of Waterloo"
-, year =	1983
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "J. T. Mowchenko"
+, title =       "??"
+, school =      "Department of Electrical Engineering, University of Waterloo"
+, year =        1983
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @article{m-ccchf-82
-, author =	"Y. J. Mu"
-, title =	"Computer construction of the convex hull of finite point sets ({Chinese} {English} summary)"
-, journal =	"J. Northwest Univ."
-, volume =	12
-, year =	1982
-, pages =	"28--34"
+, author =      "Y. J. Mu"
+, title =       "Computer construction of the convex hull of finite point sets ({Chinese} {English} summary)"
+, journal =     "J. Northwest Univ."
+, volume =      12
+, year =        1982
+, pages =       "28--34"
 }
 
 @article{m-ritdd-98
-, author =	"E. P. M{\"u}cke"
-, title =	"A Robust Implementation for Three-Dimensional {Delaunay} Triangulations"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, number =	2
-, year =	1998
-, pages =	"255--276"
-, update =	"98.07 held"
+, author =      "E. P. M{\"u}cke"
+, title =       "A Robust Implementation for Three-Dimensional {Delaunay} Triangulations"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, number =      2
+, year =        1998
+, pages =       "255--276"
+, update =      "98.07 held"
 }
 
 @mastersthesis{m-emzed-85
-, author =	"E. P. M{\"u}cke"
-, title =	"Ein {Modell} zur {Elimination} degeneriertter {F{\"a}lle} in geometrischen {Algorithmen}"
-, school =	"Inst. Informationsverarb., Techn. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1985
-, note =	"Graduating thesis"
-, keywords =	"master thesis"
-, update =	"98.03 bibrelex"
+, author =      "E. P. M{\"u}cke"
+, title =       "Ein {Modell} zur {Elimination} degeneriertter {F{\"a}lle} in geometrischen {Algorithmen}"
+, school =      "Inst. Informationsverarb., Techn. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1985
+, note =        "Graduating thesis"
+, keywords =    "master thesis"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{m-sitdg-93
-, author =	"E. P. M{\"u}cke"
-, title =	"Shapes and Implementations in Three-Dimensional Geometry"
-, school =	"Department of Computer Science, University of Illinois"
-, address =	"Urbana, IL"
-, year =	1993
-, note =	"Technical Report UIUCDCS-R-93-1836"
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "E. P. M{\"u}cke"
+, title =       "Shapes and Implementations in Three-Dimensional Geometry"
+, school =      "Department of Computer Science, University of Illinois"
+, address =     "Urbana, IL"
+, year =        1993
+, note =        "Technical Report UIUCDCS-R-93-1836"
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{msz-frplw-96
-, author =	"Ernst P. M{\"u}cke and Isaac Saias and Binhai Zhu"
-, title =	"Fast Randomized Point Location Without Preprocessing in Two- and Three-Dimensional {Delaunay} Triangulations"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"274--283"
-, cites =	"aeiim-pubtc-85, bp-adtaa-91, bd-irgo-95, bey-eedt-91a, b-cdt-81, b-rgsdd-93, dl-pmtds-89, dl-msp-76, dmz-npldt-98, d-hdvdl-91, gh-dmcpd-92, gs-cdtp-78, gs-pmgsc-85, m-sitdg-93, ps-cgi-85, ZZZ"
-, update =	"99.03 bibrelex, 97.11 bibrelex, 96.05 efrat"
+, author =      "Ernst P. M{\"u}cke and Isaac Saias and Binhai Zhu"
+, title =       "Fast Randomized Point Location Without Preprocessing in Two- and Three-Dimensional {Delaunay} Triangulations"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "274--283"
+, cites =       "aeiim-pubtc-85, bp-adtaa-91, bd-irgo-95, bey-eedt-91a, b-cdt-81, b-rgsdd-93, dl-pmtds-89, dl-msp-76, dmz-npldt-98, d-hdvdl-91, gh-dmcpd-92, gs-cdtp-78, gs-pmgsc-85, m-sitdg-93, ps-cgi-85, ZZZ"
+, update =      "99.03 bibrelex, 97.11 bibrelex, 96.05 efrat"
 }
 
 @article{m-hbins-90
-, author =	"D. J. Muder"
-, title =	"How Big Is an {N}-Sided {Voronoi} Polygon"
-, journal =	"Proceedings Of The London Mathematical Society"
-, volume =	61
-, month =	jul
-, year =	1990
-, pages =	"91--108"
-, annote =	"If $a_n$ is area of the smallest VP defined by a point
-		 set with closest distance 2 then $a_n/n$ tends to
-		 $1/\pi$."
+, author =      "D. J. Muder"
+, title =       "How Big Is an {N}-Sided {Voronoi} Polygon"
+, journal =     "Proceedings Of The London Mathematical Society"
+, volume =      61
+, month =       jul
+, year =        1990
+, pages =       "91--108"
+, annote =      "If $a_n$ is area of the smallest VP defined by a point
+                 set with closest distance 2 then $a_n/n$ tends to
+                 $1/\pi$."
 }
 
 @article{m-snuls-87
-, author =	"H. Mueller"
-, title =	"Sorting numbers using limited systolic coprocessors"
-, journal =	"IPL"
-, volume =	"??"
-, year =	1987
-, pages =	"351--354"
-, update =	"98.03 bibrelex"
+, author =      "H. Mueller"
+, title =       "Sorting numbers using limited systolic coprocessors"
+, journal =     "IPL"
+, volume =      "??"
+, year =        1987
+, pages =       "351--354"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{sfh-vchnt-95
-, author =	"S. Mukherjee and J. D. Foley and S. E. Hudson"
-, title =	"Visualizing Complex Hypermedia Networks Through Multiple Hierarchical Views"
-, institution =	"Graphics and Visualization Center, GeorgiaTech"
-, year =	1995
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "S. Mukherjee and J. D. Foley and S. E. Hudson"
+, title =       "Visualizing Complex Hypermedia Networks Through Multiple Hierarchical Views"
+, institution = "Graphics and Visualization Center, GeorgiaTech"
+, year =        1995
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @article{mah-olpcg-97
-, author =	"A. Mukhopadhyay and A. Agrawal and R. M. Hosabettu"
-, title =	"On the ordinary line problem in computational geometry"
-, journal =	"Nordic J. Comput."
-, volume =	4
-, year =	1997
-, pages =	"330--341"
-, update =	"98.07 smid"
+, author =      "A. Mukhopadhyay and A. Agrawal and R. M. Hosabettu"
+, title =       "On the ordinary line problem in computational geometry"
+, journal =     "Nordic J. Comput."
+, volume =      4
+, year =        1997
+, pages =       "330--341"
+, update =      "98.07 smid"
 }
 
 @inproceedings{mkb-caocp-93
-, author =	"A. Mukhopadhyay and C. Kumar and B. Bhattacharya"
-, title =	"Computing an area-optimal convex polygonal stabber of a set of parallel line segments"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"169--174"
-, cites =	"ad-ahdsp-90, aw-plts-89, bcetsu-csts-91, emprww-sls-82, gpw-gtt-91, gs-spscp-90, hdk-cgp-64, jmb-oairs-92, o-olafs-81, ol-mcp-81, e-ftssg-85, lmr-mpsil-, sm-ssps-92, ZZZ"
-, update =	"98.11 bibrelex, 95.01 smid, 93.09 milone+mitchell"
+, author =      "A. Mukhopadhyay and C. Kumar and B. Bhattacharya"
+, title =       "Computing an area-optimal convex polygonal stabber of a set of parallel line segments"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "169--174"
+, cites =       "ad-ahdsp-90, aw-plts-89, bcetsu-csts-91, emprww-sls-82, gpw-gtt-91, gs-spscp-90, hdk-cgp-64, jmb-oairs-92, o-olafs-81, ol-mcp-81, e-ftssg-85, lmr-mpsil-, sm-ssps-92, ZZZ"
+, update =      "98.11 bibrelex, 95.01 smid, 93.09 milone+mitchell"
 }
 
 @article{m-eprcg-88
-, author =	"C. M{\"u}ller"
-, title =	"Equidecomposability of polyhedra with reference to crystallographic groups"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"383--389"
+, author =      "C. M{\"u}ller"
+, title =       "Equidecomposability of polyhedra with reference to crystallographic groups"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "383--389"
 }
 
 @article{mp-fitcp-78
-, author =	"D. E. Muller and F. P. Preparata"
-, title =	"Finding the intersection of two convex polyhedra"
-, journal =	"Theoret. Comput. Sci."
-, volume =	7
-, year =	1978
-, pages =	"217--236"
+, author =      "D. E. Muller and F. P. Preparata"
+, title =       "Finding the intersection of two convex polyhedra"
+, journal =     "Theoret. Comput. Sci."
+, volume =      7
+, year =        1978
+, pages =       "217--236"
 }
 
 @inproceedings{m-bnpdb-90
-, author =	"Heinrich M{\"u}ller"
-, title =	"{Bestimmung} von {Nullstellen} von {Polynomgleichungssystemen} durch {Basistransformation}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	"18--19"
-, update =	"00.03 bibrelex"
+, author =      "Heinrich M{\"u}ller"
+, title =       "{Bestimmung} von {Nullstellen} von {Polynomgleichungssystemen} durch {Basistransformation}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       "18--19"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{m-ct-92
-, author =	"Heinrich M{\"u}ller"
-, title =	"Contour Triangulation"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"93--96"
-, update =	"00.03 bibrelex"
+, author =      "Heinrich M{\"u}ller"
+, title =       "Contour Triangulation"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "93--96"
+, update =      "00.03 bibrelex"
 }
 
 @incollection{m-rpl-85
-, author =	"H. M{\"u}ller"
-, title =	"Rasterized point location"
-, booktitle =	"Proc. Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, publisher =	"Trauner Verlag"
-, address =	"Linz, Austria"
-, year =	1985
-, pages =	"281--293"
-, update =	"97.03 schwarzkopf"
+, author =      "H. M{\"u}ller"
+, title =       "Rasterized point location"
+, booktitle =   "Proc. Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, publisher =   "Trauner Verlag"
+, address =     "Linz, Austria"
+, year =        1985
+, pages =       "281--293"
+, update =      "97.03 schwarzkopf"
 }
 
 @techreport{m-rcsg-85
-, author =	"H. M{\"u}ller"
-, title =	"Raytracing complex scenes by grids"
-, type =	"Report"
-, number =	"??"
-, institution =	"Inst. Inform., Univ. Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1985
+, author =      "H. M{\"u}ller"
+, title =       "Raytracing complex scenes by grids"
+, type =        "Report"
+, number =      "??"
+, institution = "Inst. Inform., Univ. Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1985
 }
 
 @inproceedings{m-srsng-01
-, author =	"Heinrich M{\"u}ller"
-, title =	"Surface Reconstruction by Spatial Neighborhood Graphs"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"7--10"
-, update =	"01.04 icking"
+, author =      "Heinrich M{\"u}ller"
+, title =       "Surface Reconstruction by Spatial Neighborhood Graphs"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "7--10"
+, update =      "01.04 icking"
 }
 
 @inproceedings{m-tccar-88
-, author =	"H. M{\"u}ller"
-, title =	"Time coherence in computer animation by ray tracing"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"187--201"
-, keywords =	"design of algorithms, computer graphics, rays, interval trees"
-, update =	"00.03 bibrelex, 99.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "H. M{\"u}ller"
+, title =       "Time coherence in computer animation by ray tracing"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "187--201"
+, keywords =    "design of algorithms, computer graphics, rays, interval trees"
+, update =      "00.03 bibrelex, 99.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{mo-sasbb-91
-, author =	"Heinrich M{\"u}ller and Matthias Otte"
-, title =	"Solving algebraic systems in {Bernstein}-{B{\'e}zier} representation"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"161--169"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Heinrich M{\"u}ller and Matthias Otte"
+, title =       "Solving algebraic systems in {Bernstein}-{B{\'e}zier} representation"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "161--169"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{ms-ib-89
-, author =	"H. M{\"u}ller and M. Stark"
-, title =	"{Implementierung} eines {Bildinterpolationsverfahrens}"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "H. M{\"u}ller and M. Stark"
+, title =       "{Implementierung} eines {Bildinterpolationsverfahrens}"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{m-iscsh-00
-, author =	"Matthias M{\"u}ller-Hannemann"
-, title =	"Improving the Surface Cycle Structure for Hexahedral Mesh Generation"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"19--28"
-, update =	"00.11 jones"
+, author =      "Matthias M{\"u}ller-Hannemann"
+, title =       "Improving the Surface Cycle Structure for Hexahedral Mesh Generation"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "19--28"
+, update =      "00.11 jones"
 }
 
 @inproceedings{mw-mscqc-97
-, author =	"M. M{\"u}ller-Hannemann and K. Weihe"
-, title =	"Minimum Strictly Convex Quadrangulations of Convex Polygons"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"193--202"
-, cites =	"be-mgot-92i, elosu-scqp-92, gj-cigtn-79, h-femgm-88, j-qmgpr-95, l-dprcq-85, mmw-unfsm-95, nc-pgta-88, s-oadrp-82, st-ltadr-81, ta-femci-93, t-qps-95, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "M. M{\"u}ller-Hannemann and K. Weihe"
+, title =       "Minimum Strictly Convex Quadrangulations of Convex Polygons"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "193--202"
+, cites =       "be-mgot-92i, elosu-scqp-92, gj-cigtn-79, h-femgm-88, j-qmgpr-95, l-dprcq-85, mmw-unfsm-95, nc-pgta-88, s-oadrp-82, st-ltadr-81, ta-femci-93, t-qps-95, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{mw-gfemg-93
-, author =	"Matthias M{\"u}ller-Hannemann and Karsten Weihe"
-, title =	"On the Generation of Finite Element Meshes with Graph Theoretical Methods"
-, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
-, month =	jun
-, year =	1993
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Matthias M{\"u}ller-Hannemann and Karsten Weihe"
+, title =       "On the Generation of Finite Element Meshes with Graph Theoretical Methods"
+, booktitle =   "Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
+, month =       jun
+, year =        1993
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{m-pabst-93
-, author =	"J.-D. M{\"u}ller"
-, title =	"Proven angular bounds and stretched triangulations with the frontal {Delaunay} method"
-, booktitle =	"Proc. 11th AIAA Comput. Fluid Dynamics Conf."
-, site =	"Orlando"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "J.-D. M{\"u}ller"
+, title =       "Proven angular bounds and stretched triangulations with the frontal {Delaunay} method"
+, booktitle =   "Proc. 11th AIAA Comput. Fluid Dynamics Conf."
+, site =        "Orlando"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @techreport{mz-icha-94
-, author =	"M. M{\"u}ller and J. Ziegler"
-, title =	"An implementation of a convex hull algorithm"
-, type =	"Report"
-, number =	"MPI-I-94-105"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, update =	"94.05 smid"
+, author =      "M. M{\"u}ller and J. Ziegler"
+, title =       "An implementation of a convex hull algorithm"
+, type =        "Report"
+, number =      "MPI-I-94-105"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, update =      "94.05 smid"
 }
 
 @article{mkf-arbam-92
-, author =	"S. M{\"u}ller and K. Kells and W. Fichtner"
-, title =	"Automatic rectangle-based adaptive mesh generation without obtuse angles"
-, journal =	"IEEE Trans. Comput.-Aided Design"
-, volume =	10
-, year =	1992
-, pages =	"855--863"
-, update =	"98.03 bibrelex"
+, author =      "S. M{\"u}ller and K. Kells and W. Fichtner"
+, title =       "Automatic rectangle-based adaptive mesh generation without obtuse angles"
+, journal =     "IEEE Trans. Comput.-Aided Design"
+, volume =      10
+, year =        1992
+, pages =       "855--863"
+, update =      "98.03 bibrelex"
 }
 
 @article{m-ssedh-85
-, author =	"J. K. Mullin"
-, title =	"Spiral storage: {E}fficient dynamic hashing with constant-performance"
-, journal =	"Comput. J."
-, volume =	28
-, year =	1985
-, pages =	"330--334"
-, update =	"97.07 agarwal"
+, author =      "J. K. Mullin"
+, title =       "Spiral storage: {E}fficient dynamic hashing with constant-performance"
+, journal =     "Comput. J."
+, volume =      28
+, year =        1985
+, pages =       "330--334"
+, update =      "97.07 agarwal"
 }
 
 @article{ms-madss-72
-, author =	"R. Mullin and R. Stanton"
-, title =	"A map-theoretic approach to {Davenport--Schinzel} sequences"
-, journal =	"Pacific J. Math."
-, volume =	40
-, year =	1972
-, pages =	"167--172"
-, update =	"95.09 agarwal"
+, author =      "R. Mullin and R. Stanton"
+, title =       "A map-theoretic approach to {Davenport--Schinzel} sequences"
+, journal =     "Pacific J. Math."
+, volume =      40
+, year =        1972
+, pages =       "167--172"
+, update =      "95.09 agarwal"
 }
 
 @inproceedings{m-rodis-92
-, author =	"D. Mullis"
-, title =	"Reporting overlaps in a dynamic interval set by filtering search"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"160--169"
-, cites =	"bl-oavdr-89, c-fsnaq-86, m-mdscg-84, ps-cgi-85, p-slpab-90, p-slc-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "D. Mullis"
+, title =       "Reporting overlaps in a dynamic interval set by filtering search"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "160--169"
+, cites =       "bl-oavdr-89, c-fsnaq-86, m-mdscg-84, ps-cgi-85, p-slpab-90, p-slc-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{m-fppa1-88
-, author =	"K. Mulmuley"
-, title =	"A fast planar partition algorithm, {I}"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"580--589"
-, comments =	"To appear in J. Symbolic Logic"
-, succeeds =	"m-fppap-88"
+, author =      "K. Mulmuley"
+, title =       "A fast planar partition algorithm, {I}"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "580--589"
+, comments =    "To appear in J. Symbolic Logic"
+, succeeds =    "m-fppap-88"
 }
 
 @article{m-fppa-90
-, author =	"K. Mulmuley"
-, title =	"A Fast Planar Partition Algorithm, {I}"
-, journal =	"J. Symbolic Comput."
-, volume =	10
-, number =	"3-4"
-, year =	1990
-, pages =	"253--280"
-, update =	"97.03 agarwal"
+, author =      "K. Mulmuley"
+, title =       "A Fast Planar Partition Algorithm, {I}"
+, journal =     "J. Symbolic Comput."
+, volume =      10
+, number =      "3-4"
+, year =        1990
+, pages =       "253--280"
+, update =      "97.03 agarwal"
 }
 
 @inproceedings{m-fppa2-89
-, author =	"K. Mulmuley"
-, title =	"A fast planar partition algorithm, {II}"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"33--43"
-, precedes =	"m-fppa2-91"
-, cites =	"c-crmp-87, ce-oails-88, c-arscg-88, eka-nplai-84, egs-oplms-86, gs-ccrs-87, k-osps-83, lt-apst-77, m-fppa1-88, m-fppa2-91, m-eahsr-89, m-lavd-88, ps-cgi-85, st-pplup-86, sss-cthsa-74, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "K. Mulmuley"
+, title =       "A fast planar partition algorithm, {II}"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "33--43"
+, precedes =    "m-fppa2-91"
+, cites =       "c-crmp-87, ce-oails-88, c-arscg-88, eka-nplai-84, egs-oplms-86, gs-ccrs-87, k-osps-83, lt-apst-77, m-fppa1-88, m-fppa2-91, m-eahsr-89, m-lavd-88, ps-cgi-85, st-pplup-86, sss-cthsa-74, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{m-fppa2-91
-, author =	"K. Mulmuley"
-, title =	"A fast planar partition algorithm, {II}"
-, journal =	"J. ACM"
-, volume =	38
-, year =	1991
-, pages =	"74--103"
-, succeeds =	"m-fppa2-89"
+, author =      "K. Mulmuley"
+, title =       "A fast planar partition algorithm, {II}"
+, journal =     "J. ACM"
+, volume =      38
+, year =        1991
+, pages =       "74--103"
+, succeeds =    "m-fppa2-89"
 }
 
 @techreport{m-fppap-88
-, author =	"K. Mulmuley"
-, title =	"A fast planar partition algorithm: part {I}"
-, type =	"Technical {Report}"
-, number =	"88-007"
-, institution =	"Dept. Comput. Sci., Univ. Chicago"
-, address =	"Chicago, IL"
-, year =	1988
-, precedes =	"m-fppa1-88"
+, author =      "K. Mulmuley"
+, title =       "A fast planar partition algorithm: part {I}"
+, type =        "Technical {Report}"
+, number =      "88-007"
+, institution = "Dept. Comput. Sci., Univ. Chicago"
+, address =     "Chicago, IL"
+, year =        1988
+, precedes =    "m-fppa1-88"
 }
 
 @inproceedings{m-gdsrs-91
-, author =	"K. Mulmuley"
-, title =	"A generalization of {Dehn}-{Sommerville} relations to simple stratified spaces"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"115--120"
-, keywords =	"polytopes"
-, precedes =	"m-gdsrs-93"
-, cites =	"b-lfitm-62, gg-smts-73, gm-smt-87, g-cp-67, l-at-42, ms-cpubc-71, s-nfscp-80, ZZZ"
-, update =	"97.11 bibrelex, 95.05 aronov"
+, author =      "K. Mulmuley"
+, title =       "A generalization of {Dehn}-{Sommerville} relations to simple stratified spaces"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "115--120"
+, keywords =    "polytopes"
+, precedes =    "m-gdsrs-93"
+, cites =       "b-lfitm-62, gg-smts-73, gm-smt-87, g-cp-67, l-at-42, ms-cpubc-71, s-nfscp-80, ZZZ"
+, update =      "97.11 bibrelex, 95.05 aronov"
 }
 
 @article{m-gdsrs-93
-, author =	"Ketan Mulmuley"
-, title =	"A Generalization of {Dehn}-{Sommerville} Relations to Simple Stratified Spaces"
-, journal =	"??"
-, volume =	9
-, year =	1993
-, pages =	"47--55"
-, keywords =	"polytopes"
-, update =	"95.05 aronov"
+, author =      "Ketan Mulmuley"
+, title =       "A Generalization of {Dehn}-{Sommerville} Relations to Simple Stratified Spaces"
+, journal =     "??"
+, volume =      9
+, year =        1993
+, pages =       "47--55"
+, keywords =    "polytopes"
+, update =      "95.05 aronov"
 }
 
 @article{m-eahsr-89
-, author =	"K. Mulmuley"
-, title =	"An efficient algorithm for hidden surface removal"
-, journal =	"Comput. Graph."
-, volume =	23
-, number =	3
-, month =	1989
-, year =	1989
-, pages =	"379--388"
-, update =	"98.11 bibrelex"
+, author =      "K. Mulmuley"
+, title =       "An efficient algorithm for hidden surface removal"
+, journal =     "Comput. Graph."
+, volume =      23
+, number =      3
+, month =       1989
+, year =        1989
+, pages =       "379--388"
+, update =      "98.11 bibrelex"
 }
 
 @article{m-eahsr-90
-, author =	"K. Mulmuley"
-, title =	"An efficient algorithm for hidden surface removal, {II}"
-, journal =	"J. Algorithms"
-, volume =	"??"
-, year =	1990
-, note =	"To appear in special issue on FOCS 1990"
-, update =	"97.11 bibrelex"
+, author =      "K. Mulmuley"
+, title =       "An efficient algorithm for hidden surface removal, {II}"
+, journal =     "J. Algorithms"
+, volume =      "??"
+, year =        1990
+, note =        "To appear in special issue on FOCS 1990"
+, update =      "97.11 bibrelex"
 }
 
 @book{m-cgitr-93
-, author =	"K. Mulmuley"
-, title =	"Computational Geometry: An Introduction Through Randomized Algorithms"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1993
-, update =	"99.11 bibrelex, 96.05 pascucci, 95.09 schwarzkopf, 93.09 devillers, 93.05 orourke"
-, annote =	"Graduate text"
+, author =      "K. Mulmuley"
+, title =       "Computational Geometry: An Introduction Through Randomized Algorithms"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1993
+, update =      "99.11 bibrelex, 96.05 pascucci, 95.09 schwarzkopf, 93.09 devillers, 93.05 orourke"
+, annote =      "Graduate text"
 }
 
 @inproceedings{m-dsrub-93
-, author =	"K. Mulmuley"
-, title =	"Dehn-Sommerville relations, upper bound theorem, and levels in arrangements"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"240--246"
-, cites =	"ag-nssfs-86, acegsw-ptphp-91, bfl-nhp-89, cp-hrsaa-86, c-blmat-92, cs-arscg-89, csy-khrp-87, es-vda-86, ew-nlsfs-85, elss-dgpps-73, gp-nkssn-84, l-knnvd-82, m-mnfcp-70, mw-glbcs-71, m-osclv-90, m-lavd-91, pss-ubnpk-92, w-mksfs-86, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "K. Mulmuley"
+, title =       "Dehn-Sommerville relations, upper bound theorem, and levels in arrangements"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "240--246"
+, cites =       "ag-nssfs-86, acegsw-ptphp-91, bfl-nhp-89, cp-hrsaa-86, c-blmat-92, cs-arscg-89, csy-khrp-87, es-vda-86, ew-nlsfs-85, elss-dgpps-73, gp-nkssn-84, l-knnvd-82, m-mnfcp-70, mw-glbcs-71, m-osclv-90, m-lavd-91, pss-ubnpk-92, w-mksfs-86, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @inproceedings{m-hsrrm-91
-, author =	"K. Mulmuley"
-, title =	"Hidden surface removal with respect to a moving point"
-, booktitle =	"Proc. 23rd Annu. ACM Sympos. Theory Comput."
-, year =	1991
-, pages =	"512--522"
-, keywords =	"hidden line/surface elimination, probabilistic analysis"
+, author =      "K. Mulmuley"
+, title =       "Hidden surface removal with respect to a moving point"
+, booktitle =   "Proc. 23rd Annu. ACM Sympos. Theory Comput."
+, year =        1991
+, pages =       "512--522"
+, keywords =    "hidden line/surface elimination, probabilistic analysis"
 }
 
 @inproceedings{m-gafpc-94
-, author =	"Ketan Mulmuley"
-, title =	"On a Geometric Approach in Finite-Precision Complexity: a Lower Bound for Linear Programming"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	""
-, update =	"94.01 jones"
+, author =      "Ketan Mulmuley"
+, title =       "On a Geometric Approach in Finite-Precision Complexity: a Lower Bound for Linear Programming"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       ""
+, update =      "94.01 jones"
 }
 
 @techreport{m-lavd-88
-, author =	"K. Mulmuley"
-, title =	"On levels in arrangements and {Voronoi} diagrams"
-, number =	"TR 88-21"
-, institution =	"University of Chicago"
-, month =	dec
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "K. Mulmuley"
+, title =       "On levels in arrangements and {Voronoi} diagrams"
+, number =      "TR 88-21"
+, institution = "University of Chicago"
+, month =       dec
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @article{m-lavd-91
-, author =	"K. Mulmuley"
-, title =	"On levels in arrangements and {Voronoi} diagrams"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"307--338"
-, succeeds =	"m-orfv-89"
+, author =      "K. Mulmuley"
+, title =       "On levels in arrangements and {Voronoi} diagrams"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "307--338"
+, succeeds =    "m-orfv-89"
 }
 
 @inproceedings{m-orfv-89
-, author =	"K. Mulmuley"
-, title =	"On obstructions in relation to a fixed viewpoint"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"592--597"
-, precedes =	"m-lavd-91"
+, author =      "K. Mulmuley"
+, title =       "On obstructions in relation to a fixed viewpoint"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "592--597"
+, precedes =    "m-lavd-91"
 }
 
 @inproceedings{m-osclv-90
-, author =	"K. Mulmuley"
-, title =	"Output sensitive construction of levels and {Voronoi} diagrams in {$\Re^d$} of order 1 to $k$"
-, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
-, year =	1990
-, pages =	"322--330"
+, author =      "K. Mulmuley"
+, title =       "Output sensitive construction of levels and {Voronoi} diagrams in {$\Re^d$} of order 1 to $k$"
+, booktitle =   "Proc. 22nd Annu. ACM Sympos. Theory Comput."
+, year =        1990
+, pages =       "322--330"
 }
 
 @incollection{m-racg-00
-, author =	"Ketan Mulmuley"
-, title =	"Randomized Algorithms in Computational Geometry"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"703--724"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 16 of su-hcg-00"
+, author =      "Ketan Mulmuley"
+, title =       "Randomized Algorithms in Computational Geometry"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "703--724"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 16 of su-hcg-00"
 }
 
 @inproceedings{m-rgapr-92
-, author =	"K. Mulmuley"
-, title =	"Randomized geometric algorithms and pseudo-random generators"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"90--100"
+, author =      "K. Mulmuley"
+, title =       "Randomized geometric algorithms and pseudo-random generators"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "90--100"
 }
 
 @article{m-rgapg-96
-, author =	"K. Mulmuley"
-, title =	"Randomized geometric algorithms and pseudorandom generators"
-, journal =	"Algorithmica"
-, volume =	16
-, year =	1996
-, pages =	"450--463"
-, update =	"97.03 smid"
+, author =      "K. Mulmuley"
+, title =       "Randomized geometric algorithms and pseudorandom generators"
+, journal =     "Algorithmica"
+, volume =      16
+, year =        1996
+, pages =       "450--463"
+, update =      "97.03 smid"
 }
 
 @inproceedings{m-rmstd-91
-, author =	"K. Mulmuley"
-, title =	"Randomized multidimensional search trees: {D}ynamic sampling"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"121--131"
-, keywords =	"random sampling, dynamizing data structures"
-, cites =	"agss-ltacv-87, as-rst-89, bt-rcdt-89, c-narsc-87, cs-arscg-89, cj-nrdpl-90, dmt-fddtl-91, fmn-dgds-85, gks-ricdv-89, hw-ensrq-87, m-fppa1-88, m-fppa2-89, m-eahsr-89, m-eahsr-90, m-lavd-91, ms-dplah-91, o-ddds-83, pt-fdplm-89, p-slpab-90, s-mapl-, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex, 96.05 agarwal"
+, author =      "K. Mulmuley"
+, title =       "Randomized multidimensional search trees: {D}ynamic sampling"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "121--131"
+, keywords =    "random sampling, dynamizing data structures"
+, cites =       "agss-ltacv-87, as-rst-89, bt-rcdt-89, c-narsc-87, cs-arscg-89, cj-nrdpl-90, dmt-fddtl-91, fmn-dgds-85, gks-ricdv-89, hw-ensrq-87, m-fppa1-88, m-fppa2-89, m-eahsr-89, m-eahsr-90, m-lavd-91, ms-dplah-91, o-ddds-83, pt-fdplm-89, p-slpab-90, s-mapl-, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex, 96.05 agarwal"
 }
 
 @inproceedings{m-rmstf-91
-, author =	"K. Mulmuley"
-, title =	"Randomized multidimensional search trees: {F}urther results in dynamic sampling"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"216--227"
-, update =	"96.05 agarwal"
+, author =      "K. Mulmuley"
+, title =       "Randomized multidimensional search trees: {F}urther results in dynamic sampling"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "216--227"
+, update =      "96.05 agarwal"
 }
 
 @inproceedings{m-rmstl-91
-, author =	"K. Mulmuley"
-, title =	"Randomized multidimensional search trees: {L}azy balancing and dynamic shuffling"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"180--196"
-, update =	"96.05 agarwal"
+, author =      "K. Mulmuley"
+, title =       "Randomized multidimensional search trees: {L}azy balancing and dynamic shuffling"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "180--196"
+, update =      "96.05 agarwal"
 }
 
 @incollection{ms-ra-97
-, author =	"K. Mulmuley and O. Schwarzkopf"
-, title =	"Randomized algorithms"
-, chapter =	34
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"633--652"
-, update =	"97.11 orourke"
+, author =      "K. Mulmuley and O. Schwarzkopf"
+, title =       "Randomized algorithms"
+, chapter =     34
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "633--652"
+, update =      "97.11 orourke"
 }
 
 @inproceedings{ms-dplah-91
-, author =	"K. Mulmuley and S. Sen"
-, title =	"Dynamic point location in arrangements of hyperplanes"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"132--141"
-, keywords =	"arrangements, hyperplane, point location, dynamizing data structures"
-, cites =	"as-rst-89, c-maeth-52, cf-dvrsi-88, c-narsc-87, cs-arscg-89, cj-nrdpl-90, dk-ladsc-85, eos-calha-86, fmn-dgds-85, hw-ensrq-87, m-rmstd-91, o-ddds-83, pt-fdplm-89, p-slpab-90, rs-orpac-87, st-pplup-86, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "K. Mulmuley and S. Sen"
+, title =       "Dynamic point location in arrangements of hyperplanes"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "132--141"
+, keywords =    "arrangements, hyperplane, point location, dynamizing data structures"
+, cites =       "as-rst-89, c-maeth-52, cf-dvrsi-88, c-narsc-87, cs-arscg-89, cj-nrdpl-90, dk-ladsc-85, eos-calha-86, fmn-dgds-85, hw-ensrq-87, m-rmstd-91, o-ddds-83, pt-fdplm-89, p-slpab-90, rs-orpac-87, st-pplup-86, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{ms-dplah-92
-, author =	"K. Mulmuley and S. Sen"
-, title =	"Dynamic point location in arrangements of hyperplanes"
-, journal =	"Discrete Comput. Geom."
-, volume =	8
-, year =	1992
-, pages =	"335--360"
-, update =	"98.07 agarwal"
+, author =      "K. Mulmuley and S. Sen"
+, title =       "Dynamic point location in arrangements of hyperplanes"
+, journal =     "Discrete Comput. Geom."
+, volume =      8
+, year =        1992
+, pages =       "335--360"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{m-prsd-87
-, author =	"D. Mumford"
-, title =	"The problem of robust shape descriptors"
-, booktitle =	"Proc. 1st. Internat. Conf. Comput. Vision"
-, year =	1987
-, pages =	"602--606"
-, update =	"97.11 bibrelex"
+, author =      "D. Mumford"
+, title =       "The problem of robust shape descriptors"
+, booktitle =   "Proc. 1st. Internat. Conf. Comput. Vision"
+, year =        1987
+, pages =       "602--606"
+, update =      "97.11 bibrelex"
 }
 
 @book{m-eat-84
-, author =	"J. R. Munkers"
-, title =	"Elements of algebraic topology"
-, publisher =	"Addison-Wesley"
-, address =	"Redwood City, California"
-, year =	1984
-, update =	"98.11 bibrelex, 93.09 matousek"
+, author =      "J. R. Munkers"
+, title =       "Elements of algebraic topology"
+, publisher =   "Addison-Wesley"
+, address =     "Redwood City, California"
+, year =        1984
+, update =      "98.11 bibrelex, 93.09 matousek"
 }
 
 @book{m-tfc-75
-, author =	"J. R. Munkres"
-, title =	"Topology: {A} first course"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1975
-, update =	"98.03 bibrelex"
+, author =      "J. R. Munkres"
+, title =       "Topology: {A} first course"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1975
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{m-msp-79
-, author =	"J. I. Munro"
-, title =	"A multikey search problem"
-, booktitle =	"Proc. 17th Allerton Conf. Commun. Control Comput."
-, year =	1979
-, pages =	"241--244"
+, author =      "J. I. Munro"
+, title =       "A multikey search problem"
+, booktitle =   "Proc. 17th Allerton Conf. Commun. Control Comput."
+, year =        1979
+, pages =       "241--244"
 }
 
 @inproceedings{mow-vv-87
-, author =	"J. I. Munro and M. H. Overmars and D. Wood"
-, title =	"Variations on visibility"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"291--299"
-, precedes =	"ow-rv-88"
-, cites =	"afk-sppsb-85, bw-owcar-80, e-ndrs-81, gjs-agcpc-76, k-mchco-86, m-mdscg-84, ps-cgi-85, rw-roc-86, wl-arrcd-85, w-ivcg-85, ZZZ"
-, update =	"98.03 bibrelex, 93.09 milone+mitchell"
+, author =      "J. I. Munro and M. H. Overmars and D. Wood"
+, title =       "Variations on visibility"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "291--299"
+, precedes =    "ow-rv-88"
+, cites =       "afk-sppsb-85, bw-owcar-80, e-ndrs-81, gjs-agcpc-76, k-mchco-86, m-mdscg-84, ps-cgi-85, rw-roc-86, wl-arrcd-85, w-ivcg-85, ZZZ"
+, update =      "98.03 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{ms-idsfs-80
-, author =	"J. I. Munro and H. Suwanda"
-, title =	"Implicit data structure for fast search and update"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	"??"
-, year =	1980
-, pages =	"236--250"
-, update =	"97.11 bibrelex"
+, author =      "J. I. Munro and H. Suwanda"
+, title =       "Implicit data structure for fast search and update"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      "??"
+, year =        1980
+, pages =       "236--250"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-ecple-71
-, author =	"J. H. Munson"
-, title =	"Efficient calculations on points and lines in the {Euclidean} plane"
-, month =	oct
-, year =	1971
-, update =	"93.09 milone+mitchell"
+, author =      "J. H. Munson"
+, title =       "Efficient calculations on points and lines in the {Euclidean} plane"
+, month =       oct
+, year =        1971
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{mf-csbra-97
-, author =	"T. M. Murali and Thomas A. Funkhouser"
-, title =	"Consistent Solid and Boundary Representations from Arbitrary Polygonal Data"
-, booktitle =	"Proc. 1997 Sympos. Interactive 3D Graphics"
-, year =	1997
-, update =	"97.07 agarwal"
+, author =      "T. M. Murali and Thomas A. Funkhouser"
+, title =       "Consistent Solid and Boundary Representations from Arbitrary Polygonal Data"
+, booktitle =   "Proc. 1997 Sympos. Interactive 3D Graphics"
+, year =        1997
+, update =      "97.07 agarwal"
 }
 
 @article{mbbm-cbmrc-
-, author =	"P. Murdoch and S. Benzley and T. D. Blacker and S. A. Mitchell"
-, title =	"A connectivity based method for representing and constructing all-hexahedral finite element meshes, {Part} {I}: {The} spatial twist continuum"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	"??"
-, year =	"??"
-, note =	"Submitted"
-, update =	"98.03 bibrelex"
+, author =      "P. Murdoch and S. Benzley and T. D. Blacker and S. A. Mitchell"
+, title =       "A connectivity based method for representing and constructing all-hexahedral finite element meshes, {Part} {I}: {The} spatial twist continuum"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      "??"
+, year =        "??"
+, note =        "Submitted"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{mb-stc-95
-, author =	"Pete Murdoch and Steven E. Benzley"
-, title =	"The Spatial Twist Continuum"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"243--252"
-, update =	"96.01 samitchell"
+, author =      "Pete Murdoch and Steven E. Benzley"
+, title =       "The Spatial Twist Continuum"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "243--252"
+, update =      "96.01 samitchell"
 }
 
 @techreport{m-ppmp-85
-, author =	"F. Murgola"
-, title =	"Probabilistic point matching in the plane"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Math. Comput. Sci., Univ. California Riverside"
-, address =	"Riverside, CA"
-, year =	1985
+, author =      "F. Murgola"
+, title =       "Probabilistic point matching in the plane"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Math. Comput. Sci., Univ. California Riverside"
+, address =     "Riverside, CA"
+, year =        1985
 }
 
 @book{m-odes-60
-, author =	"G. M. Murphy"
-, title =	"Ordinary Differential Equations and Their Solutions"
-, publisher =	"D. van Nostrand"
-, address =	"Princeton"
-, year =	1960
-, update =	"98.11 bibrelex"
+, author =      "G. M. Murphy"
+, title =       "Ordinary Differential Equations and Their Solutions"
+, publisher =   "D. van Nostrand"
+, address =     "Princeton"
+, year =        1960
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{mmg-ppscd-00
-, author =	"Michael Murphy and David M. Mount and Carl W. Gable"
-, title =	"A point-placement strategy for conforming {Delaunay} tetrahedralization"
-, booktitle =	"Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA"
-, year =	2000
-, pages =	"67--74"
-, update =	"01.07 devillers"
+, author =      "Michael Murphy and David M. Mount and Carl W. Gable"
+, title =       "A point-placement strategy for conforming {Delaunay} tetrahedralization"
+, booktitle =   "Proc. 11th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA"
+, year =        2000
+, pages =       "67--74"
+, update =      "01.07 devillers"
 }
 
 @inproceedings{ms-rtnns-93
-, author =	"M. Murphy and Steven S. Skiena"
-, title =	"Ranger: {A} tool for nearest neighbor search in high dimensions"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"403--404"
-, keywords =	"video review"
-, cites =	"b-mbstu-75, b-kdtsp-90, fbf-afbml-77, s-rnns-91, y-dsann-93, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 96.05 agarwal, 93.09 jones"
+, author =      "M. Murphy and Steven S. Skiena"
+, title =       "Ranger: {A} tool for nearest neighbor search in high dimensions"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "403--404"
+, keywords =    "video review"
+, cites =       "b-mbstu-75, b-kdtsp-90, fbf-afbml-77, s-rnns-91, y-dsann-93, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 96.05 agarwal, 93.09 jones"
 }
 
 @article{ms-fnnvt-90
-, author =	"O. J. Murphy and S. M. Selkow"
-, title =	"Finding Nearest Neighbors With {Voronoi} Tessellations"
-, journal =	"Inform. Process. Lett."
-, volume =	34
-, number =	1
-, month =	feb
-, year =	1990
-, pages =	"37--41"
-, keywords =	"nearest neighbors, Voronoi tessellations, multi key searching"
-, annote =	"Use buckets containing a list of points whose VPs
-		 intersect the bucket."
-, abstract =	"J. L. Bentley et al. have shown that, subject to
-		 certain assumptions, nearest neighbors in k-dimensional
-		 space can be computed in O(3**k) expected time. This
-		 paper presents a new method for finding nearest
-		 neighbors in any bounded region. The algorithm employs
-		 the Voronoi tessellation to allow nearest neighbor
-		 retrievals to be performed in expected constant time
-		 which is independent of the dimension. Under the
-		 assumption that the points in the file are uniformly
-		 distributed, it is shown that as the amount of storage
-		 is increased, the expected number of records examined
-		 will approach 1. (Author abstract) 7 Refs."
+, author =      "O. J. Murphy and S. M. Selkow"
+, title =       "Finding Nearest Neighbors With {Voronoi} Tessellations"
+, journal =     "Inform. Process. Lett."
+, volume =      34
+, number =      1
+, month =       feb
+, year =        1990
+, pages =       "37--41"
+, keywords =    "nearest neighbors, Voronoi tessellations, multi key searching"
+, annote =      "Use buckets containing a list of points whose VPs
+                 intersect the bucket."
+, abstract =    "J. L. Bentley et al. have shown that, subject to
+                 certain assumptions, nearest neighbors in k-dimensional
+                 space can be computed in O(3**k) expected time. This
+                 paper presents a new method for finding nearest
+                 neighbors in any bounded region. The algorithm employs
+                 the Voronoi tessellation to allow nearest neighbor
+                 retrievals to be performed in expected constant time
+                 which is independent of the dimension. Under the
+                 assumption that the points in the file are uniformly
+                 distributed, it is shown that as the amount of storage
+                 is increased, the expected number of records examined
+                 will approach 1. (Author abstract) 7 Refs."
 }
 
 @book{mls-mirm-94
-, author =	"Richard M. Murray and Zexiang Li and S. Shankar Sastry"
-, title =	"A Mathematical Introduction to Robotic Manipulation"
-, publisher =	"CRC Press"
-, year =	1994
-, location =	"Boca Raton"
-, update =	"02.03 orourke"
+, author =      "Richard M. Murray and Zexiang Li and S. Shankar Sastry"
+, title =       "A Mathematical Introduction to Robotic Manipulation"
+, publisher =   "CRC Press"
+, year =        1994
+, location =    "Boca Raton"
+, update =      "02.03 orourke"
 }
 
 @article{m-etcrh-83
-, author =	"Murtagh"
-, title =	"Expected-time complexity results for hierarchic clustering algorithms which use cluster centers"
-, journal =	"Inform. Process. Lett."
-, volume =	16
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "Murtagh"
+, title =       "Expected-time complexity results for hierarchic clustering algorithms which use cluster centers"
+, journal =     "Inform. Process. Lett."
+, volume =      16
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @techreport{m-srahc-??
-, author =	"F. Murtagh"
-, title =	"A survey of recent advances in hierarchical clustering algorithms"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Univ. College Dublin"
-, address =	"Dublin, Ireland"
-, year =	"??"
+, author =      "F. Murtagh"
+, title =       "A survey of recent advances in hierarchical clustering algorithms"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Univ. College Dublin"
+, address =     "Dublin, Ireland"
+, year =        "??"
 }
 
 @article{mks-siodt-94
-, author =	"S. K. Murthy and S. Kasif and S. Salzberg"
-, title =	"A System for Induction of Oblique Decision Trees"
-, journal =	"Journal of Artificial Intelligence Research"
-, volume =	2
-, year =	1994
-, pages =	"1--33"
-, update =	"95.05 agarwal"
+, author =      "S. K. Murthy and S. Kasif and S. Salzberg"
+, title =       "A System for Induction of Oblique Decision Trees"
+, journal =     "Journal of Artificial Intelligence Research"
+, volume =      2
+, year =        1994
+, pages =       "1--33"
+, update =      "95.05 agarwal"
 }
 
 @book{m-lcp-76
-, author =	"K. Murty"
-, title =	"Linear and Combinatorial Programming"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1976
-, update =	"97.03 gaertner+salinger"
+, author =      "K. Murty"
+, title =       "Linear and Combinatorial Programming"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1976
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{m-gap-73
-, author =	"K. Murty"
-, title =	"The graph of an abstract polytope"
-, journal =	"Math. Program."
-, volume =	4
-, year =	1973
-, pages =	"336--346"
-, update =	"97.03 gaertner+salinger"
+, author =      "K. Murty"
+, title =       "The graph of an abstract polytope"
+, journal =     "Math. Program."
+, volume =      4
+, year =        1973
+, pages =       "336--346"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{m-ccplp-80
-, author =	"Katta G. Murty"
-, title =	"Computational complexity of parametric linear programming"
-, journal =	"Math. Program."
-, volume =	19
-, year =	1980
-, pages =	"213--219"
-, update =	"97.11 bibrelex"
+, author =      "Katta G. Murty"
+, title =       "Computational complexity of parametric linear programming"
+, journal =     "Math. Program."
+, volume =      19
+, year =        1980
+, pages =       "213--219"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{m-pdt-97
-, author =	"O. Musin"
-, title =	"Properties of the {Delaunay} Triangulation"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"424--426"
-, cites =	"ds-oiti-89, d-otmgc-91, b-kuk-16, j-ctddt-91, l-scsi-77, l-pndt-86, m-dto-93, m-ihdt-95, m-fvtp-97, r-odtr-91, r-mrpdt-90, s-let-78, v-nadpc-08, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "O. Musin"
+, title =       "Properties of the {Delaunay} Triangulation"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "424--426"
+, cites =       "ds-oiti-89, d-otmgc-91, b-kuk-16, j-ctddt-91, l-scsi-77, l-pndt-86, m-dto-93, m-ihdt-95, m-fvtp-97, r-odtr-91, r-mrpdt-90, s-let-78, v-nadpc-08, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @incollection{m-cvdsp-98
-, author =	"O. R. Musin"
-, title =	"Construction of the {Voronoi} diagram and secondary polytope"
-, editor =	"P. Engel and H. Syta"
-, booktitle =	"Voronoi's Impact on Modern Science, Book 2"
-, publisher =	"Institute of Mathematics of the National Academy of Sciences of Ukraine"
-, address =	"Kyiv"
-, year =	1998
-, pages =	"105--114"
-, update =	"00.11 smid"
+, author =      "O. R. Musin"
+, title =       "Construction of the {Voronoi} diagram and secondary polytope"
+, editor =      "P. Engel and H. Syta"
+, booktitle =   "Voronoi's Impact on Modern Science, Book 2"
+, publisher =   "Institute of Mathematics of the National Academy of Sciences of Ukraine"
+, address =     "Kyiv"
+, year =        1998
+, pages =       "105--114"
+, update =      "00.11 smid"
 }
 
 @inproceedings{m-dto-93
-, author =	"O. R. Musin"
-, title =	"Delaunay triangulation and optimality"
-, booktitle =	"ARO Workshop Comp. Geom."
-, site =	"Raleigh, NC"
-, year =	1993
-, pages =	"37--38"
-, update =	"98.07 bibrelex"
+, author =      "O. R. Musin"
+, title =       "Delaunay triangulation and optimality"
+, booktitle =   "ARO Workshop Comp. Geom."
+, site =        "Raleigh, NC"
+, year =        1993
+, pages =       "37--38"
+, update =      "98.07 bibrelex"
 }
 
 @article{m-eatmp-92
-, author =	"O. R. Musin"
-, title =	"Efficient algorithms for testing membership of a point in polygons and polyhedra"
-, journal =	"Programming and computer software"
-, volume =	17
-, number =	4
-, publisher =	"Plenum Publishing Corporation"
-, year =	1992
-, pages =	"228--235"
-, keywords =	"design of algorithms, detecting, point location, polygons, polyhedra, two-dimensional, three-dimensional"
-, comments =	"translation from Russian: Programmirovanie, 1991, No. 4, pp. 72--81"
-, update =	"96.09 devillers, 95.01 korneenko"
+, author =      "O. R. Musin"
+, title =       "Efficient algorithms for testing membership of a point in polygons and polyhedra"
+, journal =     "Programming and computer software"
+, volume =      17
+, number =      4
+, publisher =   "Plenum Publishing Corporation"
+, year =        1992
+, pages =       "228--235"
+, keywords =    "design of algorithms, detecting, point location, polygons, polyhedra, two-dimensional, three-dimensional"
+, comments =    "translation from Russian: Programmirovanie, 1991, No. 4, pp. 72--81"
+, update =      "96.09 devillers, 95.01 korneenko"
 }
 
 @article{m-fvtp-97
-, author =	"O. R. Musin"
-, title =	"Four-vertex theorem for polygon"
-, journal =	"Kvant"
-, volume =	"??"
-, year =	1997
-, note =	"In Russian"
-, update =	"98.07 bibrelex"
+, author =      "O. R. Musin"
+, title =       "Four-vertex theorem for polygon"
+, journal =     "Kvant"
+, volume =      "??"
+, year =        1997
+, note =        "In Russian"
+, update =      "98.07 bibrelex"
 }
 
 @article{m-ihdt-95
-, author =	"O. R. Musin"
-, title =	"Index of harmony and {Delaunay} triangulation"
-, journal =	"Symmetry: Culture and Science"
-, volume =	6
-, number =	3
-, year =	1995
-, pages =	"389--392"
-, update =	"98.07 bibrelex"
+, author =      "O. R. Musin"
+, title =       "Index of harmony and {Delaunay} triangulation"
+, journal =     "Symmetry: Culture and Science"
+, volume =      6
+, number =      3
+, year =        1995
+, pages =       "389--392"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{m-spcgt-92
-, author =	"O. R. Musin"
-, title =	"On some problems of computational geometry and topology"
-, booktitle =	"??"
-, series =	"Lecture Notes Math."
-, volume =	1520
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"58--80"
-, keywords =	"computational topology, geometric modelling, partition of unity, manifold embedding, curve fitting, surface fitting, terrain fitting, vector field, piecewise-linear vector field, singular point, separatrix, talweg, watershed, index of vector field, piecewise-linear manifold, distance, distance function, shortest path"
-, update =	"95.01 korneenko"
-, annote =	"Exposition of author's research in CGeo \& CTop in
+, author =      "O. R. Musin"
+, title =       "On some problems of computational geometry and topology"
+, booktitle =   "??"
+, series =      "Lecture Notes Math."
+, volume =      1520
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "58--80"
+, keywords =    "computational topology, geometric modelling, partition of unity, manifold embedding, curve fitting, surface fitting, terrain fitting, vector field, piecewise-linear vector field, singular point, separatrix, talweg, watershed, index of vector field, piecewise-linear manifold, distance, distance function, shortest path"
+, update =      "95.01 korneenko"
+, annote =      "Exposition of author's research in CGeo \& CTop in
    three directions: geometric modelling algorithms via partition
    of unity; discrete analogue of the index of vector field
    rotation for singular point and separatrix search; distance
@@ -109262,72 +109262,72 @@ @incollection{m-spcgt-92
 }
 
 @inproceedings{m-amcmh-97
-, author =	"Petra Mutzel"
-, title =	"An Alternative Method to Crossing Minimization on Hierarchical Graphs"
-, editor =	"Stephen North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"318--333"
-, update =	"98.11 bibrelex, 98.07 tamassia+vismara"
+, author =      "Petra Mutzel"
+, title =       "An Alternative Method to Crossing Minimization on Hierarchical Graphs"
+, editor =      "Stephen North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "318--333"
+, update =      "98.11 bibrelex, 98.07 tamassia+vismara"
 }
 
 @inproceedings{mw-tlpgd-98
-, author =	"P. Mutzel and R. Weiskircher"
-, title =	"Two-Layer Planarization in Graph Drawing"
-, editor =	"K.-Y. Chwa and O. H. Ibarra"
-, booktitle =	"Algorithms and Computation"
-, nickname =	"ISAAC '98"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1533
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"69--78"
-, update =	"00.03 vismara"
+, author =      "P. Mutzel and R. Weiskircher"
+, title =       "Two-Layer Planarization in Graph Drawing"
+, editor =      "K.-Y. Chwa and O. H. Ibarra"
+, booktitle =   "Algorithms and Computation"
+, nickname =    "ISAAC '98"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1533
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "69--78"
+, update =      "00.03 vismara"
 }
 
 @article{m-ceicw-86
-, author =	"B. Myers"
-, title =	"A complete and efficient implementation of covered windows"
-, journal =	"Computer"
-, volume =	19
-, month =	sep
-, year =	1986
-, pages =	"57--69"
-, update =	"98.03 bibrelex"
+, author =      "B. Myers"
+, title =       "A complete and efficient implementation of covered windows"
+, journal =     "Computer"
+, volume =      19
+, month =       sep
+, year =        1986
+, pages =       "57--69"
+, update =      "98.03 bibrelex"
 }
 
 @article{mhc-sdhci-96
-, author =	"Brad Myers and Jim Hollan and Isabel Cruz and others"
-, title =	"Strategic Directions in Human Computer Interaction"
-, journal =	"ACM Comput. Surv."
-, volume =	28
-, number =	4
-, year =	1996
-, url =	"http://www.cs.cmu.edu/~bam/nsfworkshop/hcireport.html"
-, update =	"97.03 tamassia"
+, author =      "Brad Myers and Jim Hollan and Isabel Cruz and others"
+, title =       "Strategic Directions in Human Computer Interaction"
+, journal =     "ACM Comput. Surv."
+, volume =      28
+, number =      4
+, year =        1996
+, url = "http://www.cs.cmu.edu/~bam/nsfworkshop/hcireport.html"
+, update =      "97.03 tamassia"
 }
 
 @article{m-oetap-85
-, author =	"E. W. Myers"
-, title =	"An {$O(E \log E+I)$} expected time algorithm for the planar segment intersection problem"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"625--637"
+, author =      "E. W. Myers"
+, title =       "An {$O(E \log E+I)$} expected time algorithm for the planar segment intersection problem"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "625--637"
 }
 
 @article{mok-fcdbc-95
-, author =	"K. Myszkowski and O. G. Okunev and T. L. Kunii"
-, title =	"Fast Collision Detection Between Complex Solids Using Rasterizing Graphics Hardware"
-, journal =	"Visual Comput."
-, volume =	11
-, number =	9
-, year =	1995
-, pages =	"497--511"
-, update =	"96.01 held+mitchell"
+, author =      "K. Myszkowski and O. G. Okunev and T. L. Kunii"
+, title =       "Fast Collision Detection Between Complex Solids Using Rasterizing Graphics Hardware"
+, journal =     "Visual Comput."
+, volume =      11
+, number =      9
+, year =        1995
+, pages =       "497--511"
+, update =      "96.01 held+mitchell"
 }
 
 @article{nan2017polyfit,
@@ -109338,1350 +109338,1350 @@ @article{nan2017polyfit
 }
 
 @article{nhl-merp-84
-, author =	"A. Naamad and W.-L. Hsu and D. T. Lee"
-, title =	"On the maximum empty rectangle problem"
-, journal =	"Discrete Appl. Math."
-, volume =	8
-, year =	1984
-, pages =	"267--277"
+, author =      "A. Naamad and W.-L. Hsu and D. T. Lee"
+, title =       "On the maximum empty rectangle problem"
+, journal =     "Discrete Appl. Math."
+, volume =      8
+, year =        1984
+, pages =       "267--277"
 }
 
 @article{n-crtds-82
-, author =	"L. R. Nackman"
-, title =	"Curvature relations in three-dimensional symmetric axes"
-, journal =	"Comput. Graph. Image Process."
-, volume =	20
-, year =	1982
-, pages =	"43--57"
+, author =      "L. R. Nackman"
+, title =       "Curvature relations in three-dimensional symmetric axes"
+, journal =     "Comput. Graph. Image Process."
+, volume =      20
+, year =        1982
+, pages =       "43--57"
 }
 
 @article{n-tdcpc-84
-, author =	"L. R. Nackman"
-, title =	"Two-dimensional critical point configuration graphs"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-1"
-, year =	1984
-, pages =	"442--450"
+, author =      "L. R. Nackman"
+, title =       "Two-dimensional critical point configuration graphs"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-1"
+, year =        1984
+, pages =       "442--450"
 }
 
 @article{np-tdsdu-85
-, author =	"L. R. Nackman and S. M. Pizer"
-, title =	"Three-dimensional shape description using the symmetric axis transform {I}: {T}heory"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-7"
-, year =	1985
-, pages =	"187--202"
-, keywords =	"symmetric"
-, update =	"96.05 agarwal"
+, author =      "L. R. Nackman and S. M. Pizer"
+, title =       "Three-dimensional shape description using the symmetric axis transform {I}: {T}heory"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-7"
+, year =        1985
+, pages =       "187--202"
+, keywords =    "symmetric"
+, update =      "96.05 agarwal"
 }
 
 @article{ns-blss-91
-, author =	"L. R. Nackman and V. Srinivasan"
-, title =	"Bisectors of linearly separable sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"263--275"
+, author =      "L. R. Nackman and V. Srinivasan"
+, title =       "Bisectors of linearly separable sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "263--275"
 }
 
 @inproceedings{ns-ppdtp-91
-, author =	"L. R. Nackman and V. Srinivasan"
-, title =	"Point placement for {Delaunay} triangulation of polygonal domains"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"37--40"
-, cites =	"beg-pgmg-90, bfl-rsddt-88i, b-srpcs-88, b-ls-79, c-cdt-89, dfp-dbrsd-85, gs-pmgsc-85, ll-gdtpg-86, sp-dtasp-91, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "L. R. Nackman and V. Srinivasan"
+, title =       "Point placement for {Delaunay} triangulation of polygonal domains"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "37--40"
+, cites =       "beg-pgmg-90, bfl-rsddt-88i, b-srpcs-88, b-ls-79, c-cdt-89, dfp-dbrsd-85, gs-pmgsc-85, ll-gdtpg-86, sp-dtasp-91, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{nk-itpsp-85
-, author =	"S. Nagashima and F. Kimura"
-, title =	"An inside test for polyhedron by spherical projection and its application"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Graph., College Arts Sci., Univ. Tokyo"
-, address =	"Tokyo, Japan"
-, year =	1985
+, author =      "S. Nagashima and F. Kimura"
+, title =       "An inside test for polyhedron by spherical projection and its application"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Graph., College Arts Sci., Univ. Tokyo"
+, address =     "Tokyo, Japan"
+, year =        1985
 }
 
 % ### others?
 @inproceedings{no-itpp-88
-, author =	"S. Nagashima and others"
-, title =	"Inclusion Tests for Polygons and Polyhedra"
-, editor =	"S. M. Slaby and H. Stachel"
-, booktitle =	"Proc. 3rd Internat. Conf. Engineering Graphics and Descriptive Geometry"
-, site =	"TU Wien, Austria"
-, month =	jul
-, year =	1988
-, pages =	"II:60--63"
-, update =	"93.09 held"
+, author =      "S. Nagashima and others"
+, title =       "Inclusion Tests for Polygons and Polyhedra"
+, editor =      "S. M. Slaby and H. Stachel"
+, booktitle =   "Proc. 3rd Internat. Conf. Engineering Graphics and Descriptive Geometry"
+, site =        "TU Wien, Austria"
+, month =       jul
+, year =        1988
+, pages =       "II:60--63"
+, update =      "93.09 held"
 }
 
 @inproceedings{n-acs-80
-, author =	"L. W. Nagel"
-, title =	"ADVICE for circuit simulation"
-, booktitle =	"Proc. ISCAS"
-, site =	"Houston, Texas"
-, year =	1980
-, update =	"98.03 bibrelex"
+, author =      "L. W. Nagel"
+, title =       "ADVICE for circuit simulation"
+, booktitle =   "Proc. ISCAS"
+, site =        "Houston, Texas"
+, year =        1980
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{nz-dsgrg-79
-, author =	"M. Nagl and H. Zischler"
-, title =	"A Dialog System for the Graphical Representation of Graphs"
-, booktitle =	"Proc. Workshop WG '78 on Graph Theoretic Concepts in Computer Science"
-, series =	"Applied Computer Science"
-, volume =	13
-, year =	1979
-, pages =	"325--339"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. Nagl and H. Zischler"
+, title =       "A Dialog System for the Graphical Representation of Graphs"
+, booktitle =   "Proc. Workshop WG '78 on Graph Theoretic Concepts in Computer Science"
+, series =      "Applied Computer Science"
+, volume =      13
+, year =        1979
+, pages =       "325--339"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{sn-sp3763-39
-, author =	"B. de Sz. Nagy"
-, title =	"Solution to Problem 3763"
-, journal =	"Amer. Math. Monthly"
-, volume =	46
-, year =	1939
-, pages =	"176--177"
-, comments =	"See e-p3763-35."
-, update =	"98.11 orourke"
-, annote =	"Flipping polygon pockets."
+, author =      "B. de Sz. Nagy"
+, title =       "Solution to Problem 3763"
+, journal =     "Amer. Math. Monthly"
+, volume =      46
+, year =        1939
+, pages =       "176--177"
+, comments =    "See e-p3763-35."
+, update =      "98.11 orourke"
+, annote =      "Flipping polygon pockets."
 }
 
 @inproceedings{n-acg-78
-, author =	"G. Nagy"
-, title =	"Advances in computational geometry"
-, booktitle =	"Proc. 21st Midwest Sympos. Circuits Systems"
-, site =	"Ames, IA"
-, year =	1978
-, pages =	"598--603"
+, author =      "G. Nagy"
+, title =       "Advances in computational geometry"
+, booktitle =   "Proc. 21st Midwest Sympos. Circuits Systems"
+, site =        "Ames, IA"
+, year =        1978
+, pages =       "598--603"
 }
 
 @article{n-sapr-68
-, author =	"G. Nagy"
-, title =	"State of the art in pattern recognition"
-, journal =	"Proc. IEEE"
-, volume =	56
-, year =	1968
-, pages =	"836--860"
-, update =	"98.07 bibrelex"
+, author =      "G. Nagy"
+, title =       "State of the art in pattern recognition"
+, journal =     "Proc. IEEE"
+, volume =      56
+, year =        1968
+, pages =       "836--860"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{n-tv-82
-, author =	"G. Nagy"
-, title =	"Terrain visibility"
-, type =	"Technical {Report}"
-, institution =	"Rensselaer Polytech. Inst."
-, address =	"Troy, NY"
-, year =	1982
-, keywords =	"Digital elevation models, geometric visibility, hidden-surface algorithms, topography"
-, update =	"93.09 milone+mitchell"
+, author =      "G. Nagy"
+, title =       "Terrain visibility"
+, type =        "Technical {Report}"
+, institution = "Rensselaer Polytech. Inst."
+, address =     "Troy, NY"
+, year =        1982
+, keywords =    "Digital elevation models, geometric visibility, hidden-surface algorithms, topography"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{ns-fapd-88
-, author =	"S. Nahar and Sahni"
-, title =	"Fast algorithm for polygon decomposition"
-, journal =	"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"
-, volume =	"??"
-, year =	1988
-, pages =	"473--483"
-, update =	"98.03 bibrelex"
+, author =      "S. Nahar and Sahni"
+, title =       "Fast algorithm for polygon decomposition"
+, journal =     "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"
+, volume =      "??"
+, year =        1988
+, pages =       "473--483"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{nm-lledt-90
-, author =	"S. N{\"a}her and K. Mehlhorn"
-, title =	"{LEDA}: {A} Library of Efficient Data Types and Algorithms"
-, booktitle =	"Proc. Internat. Colloq. Automata Lang. Program."
-, year =	1990
-, pages =	"1--5"
-, update =	"98.11 smid, 95.05 agarwal"
+, author =      "S. N{\"a}her and K. Mehlhorn"
+, title =       "{LEDA}: {A} Library of Efficient Data Types and Algorithms"
+, booktitle =   "Proc. Internat. Colloq. Automata Lang. Program."
+, year =        1990
+, pages =       "1--5"
+, update =      "98.11 smid, 95.05 agarwal"
 }
 
 @manual{nu-lmum-95
-, author =	"S. N{\"a}her and C. Uhrig"
-, title =	"The {LEDA} Manual User Manual"
-, year =	1995
-, update =	"97.11 bibrelex"
+, author =      "S. N{\"a}her and C. Uhrig"
+, title =       "The {LEDA} Manual User Manual"
+, year =        1995
+, update =      "97.11 bibrelex"
 }
 
 @article{nw-ipseb-97
-, author =	"D. Naiman and H. Wynn"
-, title =	"On intersecting a point set with {Euclidean} balls"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"237--244"
-, update =	"97.07 devillers"
+, author =      "D. Naiman and H. Wynn"
+, title =       "On intersecting a point set with {Euclidean} balls"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "237--244"
+, update =      "97.07 devillers"
 }
 
 @article{nw-iebii-92
-, author =	"D. Q. Naiman and H. P. Wynn"
-, title =	"Inclusion-exclusion {Bonferroni} identities and inequalities for discrete tubelike problems via {Euler} characteristics"
-, journal =	"Ann. Statist."
-, volume =	20
-, year =	1992
-, pages =	"43--76"
-, update =	"98.03 bibrelex"
+, author =      "D. Q. Naiman and H. P. Wynn"
+, title =       "Inclusion-exclusion {Bonferroni} identities and inequalities for discrete tubelike problems via {Euler} characteristics"
+, journal =     "Ann. Statist."
+, volume =      20
+, year =        1992
+, pages =       "43--76"
+, update =      "98.03 bibrelex"
 }
 
 @article{n-avsir-87
-, author =	"S. Naito"
-, title =	"Applications of Visual Sensors to Industrial Robots"
-, journal =	"Sensor Technology"
-, volume =	7
-, year =	1987
-, pages =	"90--93"
-, update =	"98.03 bibrelex"
+, author =      "S. Naito"
+, title =       "Applications of Visual Sensors to Industrial Robots"
+, journal =     "Sensor Technology"
+, volume =      7
+, year =        1987
+, pages =       "90--93"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{n-adccg-78
-, author =	"I. Najfeld"
-, title =	"Analytic design of compensators and computational geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"Brown Univ."
-, address =	"Providence, RI"
-, year =	1978
-, keywords =	"doctoral thesis"
+, author =      "I. Najfeld"
+, title =       "Analytic design of compensators and computational geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "Brown Univ."
+, address =     "Providence, RI"
+, year =        1978
+, keywords =    "doctoral thesis"
 }
 
 @article{nb-o3dhl-95
-, author =	"M. A. Najork and M. H. Brown"
-, title =	"Obliq-$3${D}: {A} high-level, fast-turnaround $3$d animation system"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	1
-, number =	2
-, year =	1995
-, pages =	"175--192"
-, update =	"98.07 bibrelex"
+, author =      "M. A. Najork and M. H. Brown"
+, title =       "Obliq-$3${D}: {A} high-level, fast-turnaround $3$d animation system"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      1
+, number =      2
+, year =        1995
+, pages =       "175--192"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{nh-aplpg-84
-, author =	"M. Nakajima and K. Hayashi"
-, title =	"Automated Parts Layout Planning in Garment Industry By Using Group Technology"
-, booktitle =	"Computers in the World of Textiles"
-, year =	1984
-, pages =	"297--310"
-, note =	"Textile Institute Annual World Conference"
-, update =	"98.07 bibrelex"
+, author =      "M. Nakajima and K. Hayashi"
+, title =       "Automated Parts Layout Planning in Garment Industry By Using Group Technology"
+, booktitle =   "Computers in the World of Textiles"
+, year =        1984
+, pages =       "297--310"
+, note =        "Textile Institute Annual World Conference"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{nost-dgsmw-85
-, author =	"N. Nakajima and Y. Ohta and S. Shinotuka and S. Tokumasu"
-, title =	"Direct generation of solid model from wire-frame model"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1985
+, author =      "N. Nakajima and Y. Ohta and S. Shinotuka and S. Tokumasu"
+, title =       "Direct generation of solid model from wire-frame model"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1985
 }
 
 @article{na-dc-84
-, author =	"A. Nakamura and K. Aizawa"
-, title =	"Digital circles"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	26
-, year =	1984
-, pages =	"42--255"
-, update =	"98.07 bibrelex"
+, author =      "A. Nakamura and K. Aizawa"
+, title =       "Digital circles"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      26
+, year =        1984
+, pages =       "42--255"
+, update =      "98.07 bibrelex"
 }
 
 @article{na-digp-85
-, author =	"A. Nakamura and K. Aizawa"
-, title =	"Digital images of geometric pictures"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	30
-, year =	1985
-, pages =	"107--120"
-, update =	"98.07 bibrelex"
+, author =      "A. Nakamura and K. Aizawa"
+, title =       "Digital images of geometric pictures"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      30
+, year =        1985
+, pages =       "107--120"
+, update =      "98.07 bibrelex"
 }
 
 @article{na-ds-90
-, author =	"A. Nakamura and K. Aizawa"
-, title =	"Digital squares"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	49
-, year =	1990
-, pages =	"357--368"
-, update =	"98.07 bibrelex"
+, author =      "A. Nakamura and K. Aizawa"
+, title =       "Digital squares"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      49
+, year =        1990
+, pages =       "357--368"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{nfstk-vpecs-86
-, author =	"K. Nakamura and H. Fujimoto and T. Suzuki and Y. Tarui and Y. Kiyokane"
-, title =	"Visual Programming Environment in Communications Software"
-, booktitle =	"Proc. 5th IEEE Global Telecom Conference"
-, year =	1986
-, pages =	"435--439"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "K. Nakamura and H. Fujimoto and T. Suzuki and Y. Tarui and Y. Kiyokane"
+, title =       "Visual Programming Environment in Communications Software"
+, booktitle =   "Proc. 5th IEEE Global Telecom Conference"
+, year =        1986
+, pages =       "435--439"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{nm-nppa-89
-, author =	"Y. Nakamura and R. Mukherjee"
-, title =	"Nonholonomic path planning and automation"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1989
-, pages =	"1050--1055"
-, update =	"97.11 bibrelex"
+, author =      "Y. Nakamura and R. Mukherjee"
+, title =       "Nonholonomic path planning and automation"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1989
+, pages =       "1050--1055"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{n-hsnmt-95
-, author =	"Tran Quoc Nam"
-, title =	"A Hybrid Symbolic-Numerical Method for Tracing Curves and Surface Intersections"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"79--82"
-, update =	"00.03 bibrelex"
+, author =      "Tran Quoc Nam"
+, title =       "A Hybrid Symbolic-Numerical Method for Tracing Curves and Surface Intersections"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "79--82"
+, update =      "00.03 bibrelex"
 }
 
 @unpublished{nf-u3dcp-93
-, author =	"M. Namiki and K. Fukuda"
-, title =	"Unfolding 3-dimensional convex polytopes: {A} package for {Mathematica} 1.2 or 2.0"
-, year =	1993
-, note =	"Mathematica Notebook, Univ. of Tokyo"
-, update =	"98.11 orourke, 97.11 orourke"
+, author =      "M. Namiki and K. Fukuda"
+, title =       "Unfolding 3-dimensional convex polytopes: {A} package for {Mathematica} 1.2 or 2.0"
+, year =        1993
+, note =        "Mathematica Notebook, Univ. of Tokyo"
+, update =      "98.11 orourke, 97.11 orourke"
 }
 
 @inproceedings{nmb-slp-96
-, author =	"S. C. Nandy and K. Mukhopadhyaya and Bhargab B. Bhattacharya"
-, title =	"Shooter location problem"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"93--98"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "S. C. Nandy and K. Mukhopadhyaya and Bhargab B. Bhattacharya"
+, title =       "Shooter location problem"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "93--98"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @article{nwm-dkssp-90
-, author =	"P. Nanua and K. J. Waldron and V. Murthy"
-, title =	"Direct kinematic solution of a stewart platform"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	6
-, number =	4
-, year =	1990
-, pages =	"438--444"
-, update =	"98.07 bibrelex"
+, author =      "P. Nanua and K. J. Waldron and V. Murthy"
+, title =       "Direct kinematic solution of a stewart platform"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      6
+, number =      4
+, year =        1990
+, pages =       "438--444"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ns-cpcps-90
-, author =	"N. Naor and M. Sharir"
-, title =	"Computing a point in the center of a point set in three dimensions"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"10--13"
-, cites =	"aks-osn-83, c-pms-86, c-sdsno-87, csy-khrp-87, eos-calha-86, m-apcad-83, ns-fpcng-, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "N. Naor and M. Sharir"
+, title =       "Computing a point in the center of a point set in three dimensions"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "10--13"
+, cites =       "aks-osn-83, c-pms-86, c-sdsno-87, csy-khrp-87, eos-calha-86, m-apcad-83, ns-fpcng-, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @techreport{ns-fpcng-
-, author =	"N. Naor and M. Sharir"
-, title =	"On finding a point in the center of $n$ given points in three dimensional space"
-, institution =	"??"
-, year =	"??"
-, note =	"In preparation"
-, update =	"98.07 bibrelex"
+, author =      "N. Naor and M. Sharir"
+, title =       "On finding a point in the center of $n$ given points in three dimensional space"
+, institution = "??"
+, year =        "??"
+, note =        "In preparation"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{n-ohtsp-97
-, author =	"G. Narasimhan"
-, title =	"On {Hamiltonian} triangulations in simple polygons"
-, booktitle =	"Proc. 5th Workshop Algorithms Data Struct."
-, nickname =	"WADS '97"
-, site =	"Halifax, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1272
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"321--330"
-, update =	"99.07 bibrelex, 98.07 smid"
+, author =      "G. Narasimhan"
+, title =       "On {Hamiltonian} triangulations in simple polygons"
+, booktitle =   "Proc. 5th Workshop Algorithms Data Struct."
+, nickname =    "WADS '97"
+, site =        "Halifax, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1272
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "321--330"
+, update =      "99.07 bibrelex, 98.07 smid"
 }
 
 @article{n-htsp-99
-, author =	"G. Narasimhan"
-, title =	"On {Hamiltonian} Triangulations in Simple Polygons"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, number =	3
-, month =	jun
-, year =	1999
-, pages =	"261--275"
-, update =	"99.07 held+smid"
+, author =      "G. Narasimhan"
+, title =       "On {Hamiltonian} Triangulations in Simple Polygons"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, number =      3
+, month =       jun
+, year =        1999
+, pages =       "261--275"
+, update =      "99.07 held+smid"
 }
 
 @techreport{ns-asfeg-99
-, author =	"G. Narasimhan and M. Smid"
-, title =	"Approximating the stretch factor of {Euclidean} graphs"
-, type =	"Report"
-, number =	16
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1999
-, update =	"99.07 smid"
+, author =      "G. Narasimhan and M. Smid"
+, title =       "Approximating the stretch factor of {Euclidean} graphs"
+, type =        "Report"
+, number =      16
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1999
+, update =      "99.07 smid"
 }
 
 @article{ns-asfeg-00
-, author =	"G. Narasimhan and M. Smid"
-, title =	"Approximating the stretch factor of {Euclidean} graphs"
-, journal =	"SIAM J. Comput."
-, volume =	30
-, year =	2000
-, pages =	"978--989"
-, update =	"00.11 smid"
+, author =      "G. Narasimhan and M. Smid"
+, title =       "Approximating the stretch factor of {Euclidean} graphs"
+, journal =     "SIAM J. Comput."
+, volume =      30
+, year =        2000
+, pages =       "978--989"
+, update =      "00.11 smid"
 }
 
 @techreport{ns-asfep-99
-, author =	"G. Narasimhan and M. Smid"
-, title =	"Approximating the stretch factor of {Euclidean} paths, cycles and trees"
-, type =	"Report"
-, number =	9
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1999
-, update =	"99.07 smid"
+, author =      "G. Narasimhan and M. Smid"
+, title =       "Approximating the stretch factor of {Euclidean} paths, cycles and trees"
+, type =        "Report"
+, number =      9
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1999
+, update =      "99.07 smid"
 }
 
 @techreport{ns-aabsf-00
-, author =	"G. Narasimhan and M. Smid"
-, title =	"Approximation algorithms for the bottleneck stretch factor problem"
-, type =	"Report"
-, number =	13
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	2000
-, update =	"00.11 smid"
+, author =      "G. Narasimhan and M. Smid"
+, title =       "Approximation algorithms for the bottleneck stretch factor problem"
+, type =        "Report"
+, number =      13
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        2000
+, update =      "00.11 smid"
 }
 
 @inproceedings{ns-aabsf-01
-, author =	"G. Narasimhan and M. Smid"
-, title =	"Approximation algorithms for the bottleneck stretch factor problem"
-, booktitle =	"Proc. 18th Sympos. Theoret. Aspects Comput. Sci."
-, nickname =	"STACS '01"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	2010
-, publisher =	"Springer-Verlag"
-, year =	2001
-, pages =	"502--513"
-, update =	"01.04 smid"
+, author =      "G. Narasimhan and M. Smid"
+, title =       "Approximation algorithms for the bottleneck stretch factor problem"
+, booktitle =   "Proc. 18th Sympos. Theoret. Aspects Comput. Sci."
+, nickname =    "STACS '01"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      2010
+, publisher =   "Springer-Verlag"
+, year =        2001
+, pages =       "502--513"
+, update =      "01.04 smid"
 }
 
 @inproceedings{nzz-ecgms-00
-, author =	"G. Narasimhan and J. Zhu and M. Zachariasen"
-, title =	"Experiments with computing geometric minimum spanning trees"
-, booktitle =	"Proc. 2nd Workshop Algorithm Eng. Exper."
-, nickname =	"ALENEX '00"
-, year =	2000
-, pages =	"183--196"
-, update =	"01.11 smid"
+, author =      "G. Narasimhan and J. Zhu and M. Zachariasen"
+, title =       "Experiments with computing geometric minimum spanning trees"
+, booktitle =   "Proc. 2nd Workshop Algorithm Eng. Exper."
+, nickname =    "ALENEX '00"
+, year =        2000
+, pages =       "183--196"
+, update =      "01.11 smid"
 }
 
 @phdthesis{n-rpoca-88
-, author =	"L. S. Narasimhan"
-, title =	"Recognition of Polyhedral Objects: {Concepts} and Algorithms"
-, school =	"The University of Texas"
-, address =	"Dallas, Texas"
-, year =	1988
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "L. S. Narasimhan"
+, title =       "Recognition of Polyhedral Objects: {Concepts} and Algorithms"
+, school =      "The University of Texas"
+, address =     "Dallas, Texas"
+, year =        1988
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{nsv-rpamu-92
-, author =	"H. Narayanan and H. Saran and V. V. Vazirani"
-, title =	"Randomized parallel algorithms for matroid union and intersection, with applications to arborescences, and edge-disjoint spanning trees"
-, booktitle =	"Proc. 3rd ACM Sympos. Discr. Alg."
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "H. Narayanan and H. Saran and V. V. Vazirani"
+, title =       "Randomized parallel algorithms for matroid union and intersection, with applications to arborescences, and edge-disjoint spanning trees"
+, booktitle =   "Proc. 3rd ACM Sympos. Discr. Alg."
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @article{n-ppca-96
-, author =	"C. Narayanaswami"
-, title =	"A Parallel Polygon-Clipping Algorithm"
-, journal =	"Visual Comput."
-, volume =	12
-, number =	3
-, year =	1996
-, pages =	"147--158"
-, update =	"96.09 held"
+, author =      "C. Narayanaswami"
+, title =       "A Parallel Polygon-Clipping Algorithm"
+, journal =     "Visual Comput."
+, volume =      12
+, number =      3
+, year =        1996
+, pages =       "147--158"
+, update =      "96.09 held"
 }
 
 @phdthesis{n-ppga-91
-, author =	"Chandrasekhar Narayanaswami"
-, title =	"Parallel Processing for Geometric Applications"
-, school =	"Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
-, year =	1991
-, note =	"UMI no. 92-02201"
-, keywords =	"doctoral thesis, area, parallel computation, grids"
-, update =	"93.09 franklin"
+, author =      "Chandrasekhar Narayanaswami"
+, title =       "Parallel Processing for Geometric Applications"
+, school =      "Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
+, year =        1991
+, note =        "UMI no. 92-02201"
+, keywords =    "doctoral thesis, area, parallel computation, grids"
+, update =      "93.09 franklin"
 }
 
 @article{nf-dmppc-91a
-, author =	"C. Narayanaswami and W. R. Franklin"
-, title =	"Determination of mass properties of polygonal {CSG} objects in parallel"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	4
-, year =	1991
-, pages =	"381--403"
-, keywords =	"parallel computation, intersection, constructive solid geometry, area, grids"
-, succeeds =	"nf-dmppc-91i"
-, update =	"97.11 bibrelex, 93.09 franklin"
+, author =      "C. Narayanaswami and W. R. Franklin"
+, title =       "Determination of mass properties of polygonal {CSG} objects in parallel"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      4
+, year =        1991
+, pages =       "381--403"
+, keywords =    "parallel computation, intersection, constructive solid geometry, area, grids"
+, succeeds =    "nf-dmppc-91i"
+, update =      "97.11 bibrelex, 93.09 franklin"
 }
 
 @inproceedings{nf-bcpp-92
-, author =	"Chandrasekhar Narayanaswami and Wm. Randolph Franklin"
-, title =	"Boolean Combinations of Polygons in Parallel"
-, booktitle =	"Proc. 1992 Internat. Conf. Parallel Process."
-, volume =	""
-, month =	aug
-, year =	1992
-, pages =	""
-, keywords =	"parallel computation, grids, intersection, CAD"
-, update =	"93.09 franklin"
+, author =      "Chandrasekhar Narayanaswami and Wm. Randolph Franklin"
+, title =       "Boolean Combinations of Polygons in Parallel"
+, booktitle =   "Proc. 1992 Internat. Conf. Parallel Process."
+, volume =      ""
+, month =       aug
+, year =        1992
+, pages =       ""
+, keywords =    "parallel computation, grids, intersection, CAD"
+, update =      "93.09 franklin"
 }
 
 @inproceedings{nf-dmppc-91i
-, author =	"Chandrasekhar Narayanaswami and Wm. Randolph Franklin"
-, title =	"Determination of Mass Properties of Polygonal {CSG} Objects in Parallel"
-, editor =	"Joshua Turner"
-, booktitle =	"Proc. Symposium on Solid Modeling Foundations and CAD/CAM Applications"
-, organization =	"ACM/SIGGRAPH"
-, month =	jun
-, year =	1991
-, pages =	"279--?"
-, keywords =	"parallel computation, intersection, grids, constructive solid geometry, area"
-, precedes =	"nf-dmppc-91a"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Chandrasekhar Narayanaswami and Wm. Randolph Franklin"
+, title =       "Determination of Mass Properties of Polygonal {CSG} Objects in Parallel"
+, editor =      "Joshua Turner"
+, booktitle =   "Proc. Symposium on Solid Modeling Foundations and CAD/CAM Applications"
+, organization =        "ACM/SIGGRAPH"
+, month =       jun
+, year =        1991
+, pages =       "279--?"
+, keywords =    "parallel computation, intersection, grids, constructive solid geometry, area"
+, precedes =    "nf-dmppc-91a"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @article{nf-eihc-92
-, author =	"Chandrasekhar Narayanaswami and Wm. Randolph Franklin"
-, title =	"Edge Intersection on the {Hypercube} Computer"
-, journal =	"Inform. Process. Lett."
-, volume =	41
-, number =	5
-, month =	apr
-, year =	1992
-, pages =	"257--262"
-, keywords =	"parallel algorithms, performance evaluation, intersection, grids"
-, update =	"00.11 smid, 00.07 icking, 93.09 franklin"
+, author =      "Chandrasekhar Narayanaswami and Wm. Randolph Franklin"
+, title =       "Edge Intersection on the {Hypercube} Computer"
+, journal =     "Inform. Process. Lett."
+, volume =      41
+, number =      5
+, month =       apr
+, year =        1992
+, pages =       "257--262"
+, keywords =    "parallel algorithms, performance evaluation, intersection, grids"
+, update =      "00.11 smid, 00.07 icking, 93.09 franklin"
 }
 
 @techreport{nt-fapsd-84
-, author =	"E. Nardelli and M. Talamo"
-, title =	"A Fast Algorithm for Planarization of Sparse Diagrams"
-, number =	"R.105"
-, institution =	"IASI-CNR, Rome"
-, year =	1984
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. Nardelli and M. Talamo"
+, title =       "A Fast Algorithm for Planarization of Sparse Diagrams"
+, number =      "R.105"
+, institution = "IASI-CNR, Rome"
+, year =        1984
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @incollection{nm-fptbs-95
-, author =	"A. Narkhede and D. Manocha"
-, title =	"Fast Polygon Triangulation Based on Seidel's Algorithm"
-, editor =	"A. W. Paeth"
-, booktitle =	"Graphics Gems V"
-, publisher =	"Academic Press"
-, year =	1995
-, pages =	"394--397"
-, note =	"ISBN 0-12-543455-3"
-, update =	"97.11 held"
+, author =      "A. Narkhede and D. Manocha"
+, title =       "Fast Polygon Triangulation Based on Seidel's Algorithm"
+, editor =      "A. W. Paeth"
+, booktitle =   "Graphics Gems V"
+, publisher =   "Academic Press"
+, year =        1995
+, pages =       "394--397"
+, note =        "ISBN 0-12-543455-3"
+, update =      "97.11 held"
 }
 
 @book{n-nt-83
-, author =	"W. Narkiewicz"
-, title =	"Number Theory"
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "W. Narkiewicz"
+, title =       "Number Theory"
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @techreport{nddd-padwm-94
-, author =	"J. M. Nash and P. M. Dew and M. E. Dyer and J. R. Davy"
-, title =	"Parallel Algorithm Design on the {WPRAM} Model"
-, type =	"Technical {Report}"
-, number =	"94.24"
-, institution =	"School of Computer Science, Univeristy of Leeds"
-, year =	1994
-, update =	"96.09 orourke"
+, author =      "J. M. Nash and P. M. Dew and M. E. Dyer and J. R. Davy"
+, title =       "Parallel Algorithm Design on the {WPRAM} Model"
+, type =        "Technical {Report}"
+, number =      "94.24"
+, institution = "School of Computer Science, Univeristy of Leeds"
+, year =        1994
+, update =      "96.09 orourke"
 }
 
 @article{n-edstf-61
-, author =	"C. St. J. A. {Nash-Williams}"
-, title =	"Edge-disjoint spanning trees of finite graphs"
-, journal =	"J. London Math. Soc."
-, volume =	36
-, year =	1961
-, pages =	"445--450"
-, update =	"98.11 bibrelex"
+, author =      "C. St. J. A. {Nash-Williams}"
+, title =       "Edge-disjoint spanning trees of finite graphs"
+, journal =     "J. London Math. Soc."
+, volume =      36
+, year =        1961
+, pages =       "445--450"
+, update =      "98.11 bibrelex"
 }
 
 @article{n-psmff-85
-, author =	"A. H. Nasri"
-, title =	"Polyhedral subdivision methods for free-form surfaces"
-, journal =	"ACM Trans. Graph."
-, volume =	6
-, year =	1985
-, pages =	"29--73"
+, author =      "A. H. Nasri"
+, title =       "Polyhedral subdivision methods for free-form surfaces"
+, journal =     "ACM Trans. Graph."
+, volume =      6
+, year =        1985
+, pages =       "29--73"
 }
 
 @article{ns-dbsc-81
-, author =	"D. Nassimi and S. Sahni"
-, title =	"Data Broadcasting in SIMD Computers"
-, journal =	"IEEE Trans. on Compu."
-, volume =	"c-30"
-, number =	2
-, year =	1981
-, pages =	"101--106"
-, update =	"98.07 bibrelex"
+, author =      "D. Nassimi and S. Sahni"
+, title =       "Data Broadcasting in SIMD Computers"
+, journal =     "IEEE Trans. on Compu."
+, volume =      "c-30"
+, number =      2
+, year =        1981
+, pages =       "101--106"
+, update =      "98.07 bibrelex"
 }
 
 @article{ns-fccco-80
-, author =	"D. Nassimi and S. Sahni"
-, title =	"Finding connected components and connected ones on a mesh-connected parallel computer"
-, journal =	"SIAM J. Comput."
-, volume =	9
-, year =	1980
-, pages =	"744--757"
-, update =	"97.11 bibrelex"
+, author =      "D. Nassimi and S. Sahni"
+, title =       "Finding connected components and connected ones on a mesh-connected parallel computer"
+, journal =     "SIAM J. Comput."
+, volume =      9
+, year =        1980
+, pages =       "744--757"
+, update =      "97.11 bibrelex"
 }
 
 @article{ns-ppsan-82
-, author =	"D. Nassimi and S. Sahni"
-, title =	"Parallel permutation and sorting algorithms and a new generalized connection network"
-, journal =	"J. ACM"
-, volume =	29
-, number =	3
-, year =	1982
-, pages =	"642--667"
-, update =	"96.09 orourke"
+, author =      "D. Nassimi and S. Sahni"
+, title =       "Parallel permutation and sorting algorithms and a new generalized connection network"
+, journal =     "J. ACM"
+, volume =      29
+, number =      3
+, year =        1982
+, pages =       "642--667"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{n-aaadp-86
-, author =	"B. K. Natarajan"
-, title =	"An Algorithmic Approach to the Automated Design of Parts Orienters"
-, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
-, publisher =	"IEEE Computer Society"
-, year =	1986
-, pages =	"132--142"
-, update =	"98.07 bibrelex, 98.03 bibrelex"
+, author =      "B. K. Natarajan"
+, title =       "An Algorithmic Approach to the Automated Design of Parts Orienters"
+, booktitle =   "Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
+, publisher =   "IEEE Computer Society"
+, year =        1986
+, pages =       "132--142"
+, update =      "98.07 bibrelex, 98.03 bibrelex"
 }
 
 @article{n-aa-89
-, author =	"B. K. Natarajan"
-, title =	"An analysis of assembly"
-, journal =	"Visual Comput."
-, volume =	5
-, number =	5
-, month =	oct
-, year =	1989
-, pages =	"316--323"
-, keywords =	"assembly of composite subjects, classes, sequence of motions"
+, author =      "B. K. Natarajan"
+, title =       "An analysis of assembly"
+, journal =     "Visual Comput."
+, volume =      5
+, number =      5
+, month =       oct
+, year =        1989
+, pages =       "316--323"
+, keywords =    "assembly of composite subjects, classes, sequence of motions"
 }
 
 @techreport{n-ccpwl-91
-, author =	"B. K. Natarajan"
-, title =	"On comparing and compressing piece-wise linear curves"
-, institution =	"Hewlett Packard"
-, year =	1991
+, author =      "B. K. Natarajan"
+, title =       "On comparing and compressing piece-wise linear curves"
+, institution = "Hewlett Packard"
+, year =        1991
 }
 
 @inproceedings{n-cibs-90
-, author =	"B. K. Natarajan"
-, title =	"On computing the intersection of {B}-splines"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"157--167"
-, cites =	"bhlh-tsi-88, bfjp-ssi-87, bbb-isucg-87, b-pgs-78, clr-dbsst-80, d-fibsr-85, fmm-saubd-86, ks-gictr-??, lr-bp-81, s-sfbt-81, w-smfib-84, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "B. K. Natarajan"
+, title =       "On computing the intersection of {B}-splines"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "157--167"
+, cites =       "bhlh-tsi-88, bfjp-ssi-87, bbb-isucg-87, b-pgs-78, clr-dbsst-80, d-fibsr-85, fmm-saubd-86, ks-gictr-??, lr-bp-81, s-sfbt-81, w-smfib-84, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{n-dopp-87
-, author =	"B. K. Natarajan"
-, title =	"On detecting the orientation of polygons and polyhedra"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"146--152"
-, cites =	"b-dscns-84, cy-sp-83, dey-pcp-86, em-esm-86, n-aaadp-86, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "B. K. Natarajan"
+, title =       "On detecting the orientation of polygons and polyhedra"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "146--152"
+, cites =       "b-dscns-84, cy-sp-83, dey-pcp-86, em-esm-86, n-aaadp-86, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{n-moo-86
-, author =	"B. K. Natarajan"
-, title =	"On Moving and Orienting Objects"
-, type =	"Technical {Report}"
-, school =	"Dept. Computer Science, Cornell University"
-, year =	1986
-, note =	"86-775"
-, keywords =	"doctoral thesis"
-, update =	"93.09 milone+mitchell"
+, author =      "B. K. Natarajan"
+, title =       "On Moving and Orienting Objects"
+, type =        "Technical {Report}"
+, school =      "Dept. Computer Science, Cornell University"
+, year =        1986
+, note =        "86-775"
+, keywords =    "doctoral thesis"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{n-pwlac-91
-, author =	"B. K. Natarajan"
-, title =	"On piece-wise linear approximations to curves"
-, type =	"Technical Report"
-, number =	"HPL-91-36"
-, institution =	"Hewlett Packard Labs"
-, address =	"Palo Alto, CA"
-, year =	1991
-, update =	"00.11 smid, 00.07 smid, 98.07 bibrelex"
+, author =      "B. K. Natarajan"
+, title =       "On piece-wise linear approximations to curves"
+, type =        "Technical Report"
+, number =      "HPL-91-36"
+, institution = "Hewlett Packard Labs"
+, address =     "Palo Alto, CA"
+, year =        1991
+, update =      "00.11 smid, 00.07 smid, 98.07 bibrelex"
 }
 
 @inproceedings{n-oplac-91
-, author =	"B. K. Natarajan"
-, title =	"On piecewise linear approximations to curves"
-, booktitle =	"SIAM Conference on Geometric Design"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "B. K. Natarajan"
+, title =       "On piecewise linear approximations to curves"
+, booktitle =   "SIAM Conference on Geometric Design"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{n-pa-88
-, author =	"B. K. Natarajan"
-, title =	"On planning assemblies"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"299--308"
-, cites =	"c-crsdr-85, d-rbwdo-84, gy-tsr-80, hss-cmpmi-84, lw-aapsc-77, o-ar-85, r-ra-85, r-cmpg-79, te-stmpl-84, ts-snrmp-83, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "B. K. Natarajan"
+, title =       "On planning assemblies"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "299--308"
+, cites =       "c-crsdr-85, d-rbwdo-84, gy-tsr-80, hss-cmpmi-84, lw-aapsc-77, o-ar-85, r-ra-85, r-cmpg-79, te-stmpl-84, ts-snrmp-83, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{n-spadp-89
-, author =	"B. K. Natarajan"
-, title =	"Some paradigms for the automated design of parts feeders"
-, journal =	"Internat. J. Robot. Res."
-, volume =	8
-, number =	6
-, month =	dec
-, year =	1989
-, pages =	"98--109"
-, update =	"98.07 bibrelex"
+, author =      "B. K. Natarajan"
+, title =       "Some paradigms for the automated design of parts feeders"
+, journal =     "Internat. J. Robot. Res."
+, volume =      8
+, number =      6
+, month =       dec
+, year =        1989
+, pages =       "98--109"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{nr-sacf-92
-, author =	"B. K. Natarajan and J. Ruppert"
-, title =	"On sparse approximations of curves and functions"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"250--256"
-, cites =	"abgw-acp-90, ag-mrpc-92, ii-oaapl-86a, ii-cgmpa-86, g-nmccd-91, ghms-apsml-91, mo-pca-88, ms-saps-92, t-capcp-85, in-pladc-91, ii-cgmpa-86, ishs-spadc-83, lm-krpbc-87, n-pwlac-91, n-oplac-91, nh-dp-88, n-asf-89, r-iaf-69, r-licab-90, s-ldpsp-88, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "B. K. Natarajan and J. Ruppert"
+, title =       "On sparse approximations of curves and functions"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "250--256"
+, cites =       "abgw-acp-90, ag-mrpc-92, ii-oaapl-86a, ii-cgmpa-86, g-nmccd-91, ghms-apsml-91, mo-pca-88, ms-saps-92, t-capcp-85, in-pladc-91, ii-cgmpa-86, ishs-spadc-83, lm-krpbc-87, n-pwlac-91, n-oplac-91, nh-dp-88, n-asf-89, r-iaf-69, r-licab-90, s-ldpsp-88, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{nmb-pacht-81
-, author =	"D. Nath and S. N. Maheshwari and P. C. P. Bhatt"
-, title =	"Parallel Algorithms for the Convex Hull in Two Dimensions"
-, number =	"EE 8005"
-, institution =	"Indian Inst. Technology"
-, address =	"New Delhi, India"
-, year =	1981
-, pages =	"358--372"
-, update =	"97.11 bibrelex, 93.09 held"
+, author =      "D. Nath and S. N. Maheshwari and P. C. P. Bhatt"
+, title =       "Parallel Algorithms for the Convex Hull in Two Dimensions"
+, number =      "EE 8005"
+, institution = "Indian Inst. Technology"
+, address =     "New Delhi, India"
+, year =        1981
+, pages =       "358--372"
+, update =      "97.11 bibrelex, 93.09 held"
 }
 
 @techreport{nmb-pachp-80
-, author =	"D. Nath and S. N. Maheshwari and P. C. P. Bhatt"
-, title =	"Parallel algorithms for the convex hull problem in two dimensions"
-, type =	"Report"
-, number =	"EE 8005"
-, institution =	"Indian Inst. Tech."
-, address =	"New Delhi, India"
-, year =	1980
+, author =      "D. Nath and S. N. Maheshwari and P. C. P. Bhatt"
+, title =       "Parallel algorithms for the convex hull problem in two dimensions"
+, type =        "Report"
+, number =      "EE 8005"
+, institution = "Indian Inst. Tech."
+, address =     "New Delhi, India"
+, year =        1980
 }
 
 @article{n-crp2d-66
-, author =	"J. I. Naus"
-, title =	"Clustering of random points in $2$ dimensions"
-, journal =	"Biometrika"
-, volume =	52
-, year =	1966
-, pages =	"263--267"
+, author =      "J. I. Naus"
+, title =       "Clustering of random points in $2$ dimensions"
+, journal =     "Biometrika"
+, volume =      52
+, year =        1966
+, pages =       "263--267"
 }
 
 @inproceedings{n-cgpt-93
-, author =	"B. Naylor"
-, title =	"Constructing good partitioning trees"
-, booktitle =	"Proc. Graphics Interface '93"
-, site =	"Toronto, ON"
-, year =	1993
-, pages =	"181--191"
-, update =	"96.05 pascucci"
+, author =      "B. Naylor"
+, title =       "Constructing good partitioning trees"
+, booktitle =   "Proc. Graphics Interface '93"
+, site =        "Toronto, ON"
+, year =        1993
+, pages =       "181--191"
+, update =      "96.05 pascucci"
 }
 
 @article{nat-mbtyp-90
-, author =	"B. Naylor and J. A. Amanatides and W. Thibault"
-, title =	"Merging {BSP} trees yields polyhedral set operations"
-, journal =	"Comput. Graph."
-, volume =	24
-, number =	4
-, month =	aug
-, year =	1990
-, pages =	"115--124"
-, note =	"Proc. SIGGRAPH '90"
-, update =	"96.05 pascucci, 93.09 milone+mitchell"
+, author =      "B. Naylor and J. A. Amanatides and W. Thibault"
+, title =       "Merging {BSP} trees yields polyhedral set operations"
+, journal =     "Comput. Graph."
+, volume =      24
+, number =      4
+, month =       aug
+, year =        1990
+, pages =       "115--124"
+, note =        "Proc. SIGGRAPH '90"
+, update =      "96.05 pascucci, 93.09 milone+mitchell"
 }
 
 @techreport{nt-abtrt-86
-, author =	"Bruce Naylor and William Thibault"
-, title =	"Application of {BSP} Trees to Ray-Tracing and {CSG} Evaluation"
-, type =	"Technical Report"
-, number =	"GIT-ICS 86/03"
-, institution =	"Georgia Institute of Tech., School of Information and Computer Science"
-, month =	feb
-, year =	1986
-, keywords =	"hierarchies"
-, update =	"97.07 agarwal"
+, author =      "Bruce Naylor and William Thibault"
+, title =       "Application of {BSP} Trees to Ray-Tracing and {CSG} Evaluation"
+, type =        "Technical Report"
+, number =      "GIT-ICS 86/03"
+, institution = "Georgia Institute of Tech., School of Information and Computer Science"
+, month =       feb
+, year =        1986
+, keywords =    "hierarchies"
+, update =      "97.07 agarwal"
 }
 
 @unpublished{n-cgpt-
-, author =	"Bruce F. Naylor"
-, title =	"Constructing Good Partitioning Trees"
-, institution =	"AT\& T Bell Laboratories"
-, year =	"??"
-, note =	"Manuscript"
-, update =	"95.01 mitchell"
+, author =      "Bruce F. Naylor"
+, title =       "Constructing Good Partitioning Trees"
+, institution = "AT\& T Bell Laboratories"
+, year =        "??"
+, note =        "Manuscript"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{n-isgpt-92
-, author =	"Bruce F. Naylor"
-, title =	"Interactive solid geometry via partitioning trees"
-, booktitle =	"Proc. Graphics Interface '92"
-, year =	1992
-, pages =	"11--18"
-, update =	"97.07 agarwal"
+, author =      "Bruce F. Naylor"
+, title =       "Interactive solid geometry via partitioning trees"
+, booktitle =   "Proc. Graphics Interface '92"
+, year =        1992
+, pages =       "11--18"
+, update =      "97.07 agarwal"
 }
 
 @unpublished{n-ptirg-
-, author =	"Bruce F. Naylor"
-, title =	"Partitioning Tree Image Representation and Generation from 3D Geometric Models"
-, institution =	"AT\& T Bell Laboratories"
-, year =	"??"
-, note =	"Manuscript"
-, update =	"95.01 mitchell"
+, author =      "Bruce F. Naylor"
+, title =       "Partitioning Tree Image Representation and Generation from 3D Geometric Models"
+, institution = "AT\& T Bell Laboratories"
+, year =        "??"
+, note =        "Manuscript"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{n-sismt-90
-, author =	"B. F. Naylor"
-, title =	"SCULPT: an interactive solid modeling tool"
-, booktitle =	"Proc. Graphics Interface '90"
-, year =	1990
-, pages =	"138--148"
-, update =	"98.07 bibrelex"
+, author =      "B. F. Naylor"
+, title =       "SCULPT: an interactive solid modeling tool"
+, booktitle =   "Proc. Graphics Interface '90"
+, year =        1990
+, pages =       "138--148"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{n-acpwd-99
-, author =	"Manuela Neagu"
-, title =	"Arrangements of Curves in the Plane: What Does ``Equivalence'' Mean?"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"181--183"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Manuela Neagu"
+, title =       "Arrangements of Curves in the Plane: What Does ``Equivalence'' Mean?"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "181--183"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{nl-ccsac-98
-, author =	"Manuela Neagu and Bernard Lacolle"
-, title =	"Computing the Combinatorial Structure of Arrangements of Curves Using Polygonal Approximations"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"121--123"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Manuela Neagu and Bernard Lacolle"
+, title =       "Computing the Combinatorial Structure of Arrangements of Curves Using Polygonal Approximations"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "121--123"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @book{n-bztdp-78
-, author =	"W. Nef"
-, title =	"Beitr{\"a}ge zur {Theorie} der {Polyeder}"
-, publisher =	"Herbert Lang"
-, address =	"Bern"
-, year =	1978
-, update =	"98.07 icking, 97.11 icking, 93.09 devillers"
+, author =      "W. Nef"
+, title =       "Beitr{\"a}ge zur {Theorie} der {Polyeder}"
+, publisher =   "Herbert Lang"
+, address =     "Bern"
+, year =        1978
+, update =      "98.07 icking, 97.11 icking, 93.09 devillers"
 }
 
 @proceedings{nb-iwcg-84
-, title =	"Abstracts 2nd Intern. Workshop Comput. Geom."
-, editor =	"W. Nef and H. Bieri"
-, nickname =	"CG '84"
-, site =	"Bern"
-, publisher =	"Universit{\"a}t Bern"
-, year =	1984
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 2nd Intern. Workshop Comput. Geom."
+, editor =      "W. Nef and H. Bieri"
+, nickname =    "CG '84"
+, site =        "Bern"
+, publisher =   "Universit{\"a}t Bern"
+, year =        1984
+, update =      "00.03 bibrelex"
 }
 
 @article{n-fdbtc-90
-, author =	"C. A. Neff"
-, title =	"Finding the distance between two circles in three-dimensional space"
-, journal =	"IBM J. Res. Develop."
-, volume =	34
-, year =	1990
-, pages =	"770--775"
+, author =      "C. A. Neff"
+, title =       "Finding the distance between two circles in three-dimensional space"
+, journal =     "IBM J. Res. Develop."
+, volume =      34
+, year =        1990
+, pages =       "770--775"
 }
 
 @inproceedings{n-dfts-92
-, author =	"S. Negami"
-, title =	"Diagonal flips of triangulations on surfaces"
-, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
-, site =	"Kyoto, Japan"
-, year =	1992
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "S. Negami"
+, title =       "Diagonal flips of triangulations on surfaces"
+, booktitle =   "Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
+, site =        "Kyoto, Japan"
+, year =        1992
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{n-jcbgs-85
-, author =	"G. Nelson"
-, title =	"Juno, a constraint-based graphics system"
-, journal =	"Comput. Graph."
-, volume =	19
-, number =	3
-, year =	1985
-, pages =	"235--243"
-, note =	"Proc. SIGGRAPH '85"
+, author =      "G. Nelson"
+, title =       "Juno, a constraint-based graphics system"
+, journal =     "Comput. Graph."
+, volume =      19
+, number =      3
+, year =        1985
+, pages =       "235--243"
+, note =        "Proc. SIGGRAPH '85"
 }
 
 @article{n-taapd-78
-, author =	"J. M. Nelson"
-, title =	"A triangulation algorithm for arbitrary planar domains"
-, journal =	"Appl. Math. Modelling"
-, volume =	2
-, year =	1978
-, pages =	"151--159"
+, author =      "J. M. Nelson"
+, title =       "A triangulation algorithm for arbitrary planar domains"
+, journal =     "Appl. Math. Modelling"
+, volume =      2
+, year =        1978
+, pages =       "151--159"
 }
 
 @article{ns-chrvd-86
-, author =	"R. C. Nelson and H. Samet"
-, title =	"A consistent hierarchical representation for vector data"
-, journal =	"Comput. Graph."
-, volume =	20
-, number =	4
-, month =	aug
-, year =	1986
-, pages =	"197--206"
-, note =	"Proc. SIGGRAPH '86"
-, update =	"96.09 devillers, 96.05 efrat"
+, author =      "R. C. Nelson and H. Samet"
+, title =       "A consistent hierarchical representation for vector data"
+, journal =     "Comput. Graph."
+, volume =      20
+, number =      4
+, month =       aug
+, year =        1986
+, pages =       "197--206"
+, note =        "Proc. SIGGRAPH '86"
+, update =      "96.09 devillers, 96.05 efrat"
 }
 
 @inproceedings{ns-pahds-87
-, author =	"R. C. Nelson and H. Samet"
-, title =	"A population analysis for hierarchical data structures"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, site =	"San Francisco"
-, month =	may
-, year =	1987
-, pages =	"270--277"
-, update =	"97.07 agarwal, 96.05 efrat"
+, author =      "R. C. Nelson and H. Samet"
+, title =       "A population analysis for hierarchical data structures"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, site =        "San Francisco"
+, month =       may
+, year =        1987
+, pages =       "270--277"
+, update =      "97.07 agarwal, 96.05 efrat"
 }
 
 @techreport{ns-paqvn-86
-, author =	"R. C. Nelson and H. Samet"
-, title =	"A population analysis of quadtrees with variable node size"
-, type =	"Computer Science"
-, number =	"TR--1740"
-, institution =	"University of Maryland"
-, address =	"College Park, MD"
-, month =	dec
-, year =	1986
-, update =	"96.05 efrat"
+, author =      "R. C. Nelson and H. Samet"
+, title =       "A population analysis of quadtrees with variable node size"
+, type =        "Computer Science"
+, number =      "TR--1740"
+, institution = "University of Maryland"
+, address =     "College Park, MD"
+, month =       dec
+, year =        1986
+, update =      "96.05 efrat"
 }
 
 @article{nt-vpspa-75
-, author =	"G. L. Nemhauser and L. E. {Trotter, Jr.}"
-, title =	"Vertex packing: {structural} properties and algorithms"
-, journal =	"Math. Prog."
-, volume =	8
-, year =	1975
-, pages =	"232--248"
-, update =	"98.07 bibrelex"
+, author =      "G. L. Nemhauser and L. E. {Trotter, Jr.}"
+, title =       "Vertex packing: {structural} properties and algorithms"
+, journal =     "Math. Prog."
+, volume =      8
+, year =        1975
+, pages =       "232--248"
+, update =      "98.07 bibrelex"
 }
 
 @book{ny-pcmeo-83
-, author =	"A. S. Nemirovsky and D. B. Yudin"
-, title =	"Problem Complexity and Method Efficiency in Optimization"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1983
-, update =	"99.11 bibrelex, 98.11 bibrelex"
+, author =      "A. S. Nemirovsky and D. B. Yudin"
+, title =       "Problem Complexity and Method Efficiency in Optimization"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1983
+, update =      "99.11 bibrelex, 98.11 bibrelex"
 }
 
 @article{nv-rpot-98
-, author =	"J. Ne{\v s}et{\v r}il and P. Valtr"
-, title =	"A {Ramsey} property of order types"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	81
-, year =	1998
-, pages =	"88--107"
-, update =	"02.03 devillers"
+, author =      "J. Ne{\v s}et{\v r}il and P. Valtr"
+, title =       "A {Ramsey} property of order types"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      81
+, year =        1998
+, pages =       "88--107"
+, update =      "02.03 devillers"
 }
 
 @article{nv-rttp-94
-, author =	"J. Ne{\v s}et{\v r}il and P. Valtr"
-, title =	"A {Ramsey}-type theorem in the plane"
-, journal =	"Combinatorics, Probability and Computing"
-, volume =	3
-, year =	1994
-, pages =	"127--135"
-, update =	"02.03 devillers, 97.03 gaertner+salinger"
+, author =      "J. Ne{\v s}et{\v r}il and P. Valtr"
+, title =       "A {Ramsey}-type theorem in the plane"
+, journal =     "Combinatorics, Probability and Computing"
+, volume =      3
+, year =        1994
+, pages =       "127--135"
+, update =      "02.03 devillers, 97.03 gaertner+salinger"
 }
 
 @inproceedings{nvs-imc-99
-, author =	"J. Ne{\v s}et{\v r}il and P. Valtr and J. Solymosi"
-, title =	"Induced monochromatic configurations"
-, booktitle =	"Contemporary trends in Discrete Math."
-, series =	"DIMACS Series 49"
-, year =	1999
-, pages =	"219--228"
-, update =	"02.03 devillers"
+, author =      "J. Ne{\v s}et{\v r}il and P. Valtr and J. Solymosi"
+, title =       "Induced monochromatic configurations"
+, booktitle =   "Contemporary trends in Discrete Math."
+, series =      "DIMACS Series 49"
+, year =        1999
+, pages =       "219--228"
+, update =      "02.03 devillers"
 }
 
 @phdthesis{n-ceare-91
-, author =	"N. S. Netanyahu"
-, title =	"Computationally efficient algorithms for robust estimation"
-, school =	"Department of Computer Science, University of Maryland"
-, year =	1991
-, keywords =	"doctoral thesis"
-, precedes =	"n-ceare-92"
-, update =	"98.07 bibrelex"
+, author =      "N. S. Netanyahu"
+, title =       "Computationally efficient algorithms for robust estimation"
+, school =      "Department of Computer Science, University of Maryland"
+, year =        1991
+, keywords =    "doctoral thesis"
+, precedes =    "n-ceare-92"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{n-ceare-92
-, author =	"N. S. Netanyahu"
-, title =	"Computationally efficient algorithms for robust estimation"
-, number =	"cs-tr-2898"
-, institution =	"University of Maryland"
-, month =	may
-, year =	1992
-, succeeds =	"n-ceare-91"
-, update =	"98.07 bibrelex, 93.09 milone+mitchell"
+, author =      "N. S. Netanyahu"
+, title =       "Computationally efficient algorithms for robust estimation"
+, number =      "cs-tr-2898"
+, institution = "University of Maryland"
+, month =       may
+, year =        1992
+, succeeds =    "n-ceare-91"
+, update =      "98.07 bibrelex, 93.09 milone+mitchell"
 }
 
 @book{nh-dp-88
-, author =	"A. N. Netravali and B. G. Haskell"
-, title =	"Digital Pictures --- Representation and Compression"
-, publisher =	"Plenum Press"
-, address =	"New York, NY"
-, year =	1988
-, update =	"98.07 bibrelex"
+, author =      "A. N. Netravali and B. G. Haskell"
+, title =       "Digital Pictures --- Representation and Compression"
+, publisher =   "Plenum Press"
+, address =     "New York, NY"
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{nd-imgns-96
-, author =	"Friedhelm Neugebauer and Ralf Dickmann"
-, title =	"Improved mesh generation: not simple but good"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"257--270"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Friedhelm Neugebauer and Ralf Dickmann"
+, title =       "Improved mesh generation: not simple but good"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "257--270"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @article{n-tnas-94
-, author =	"A. Neumann"
-, title =	"The new {ASME Y14.5M} standard"
-, journal =	"Manufacturing Review"
-, volume =	7
-, number =	4
-, year =	1994
-, pages =	"9--15"
-, update =	"98.03 agarwal"
+, author =      "A. Neumann"
+, title =       "The new {ASME Y14.5M} standard"
+, journal =     "Manufacturing Review"
+, volume =      7
+, number =      4
+, year =        1994
+, pages =       "9--15"
+, update =      "98.03 agarwal"
 }
 
 @article{nu-crpcp-88
-, author =	"C. Neumann-Lara and J. Urrutia"
-, title =	"A combinatorial result on points and circles in the plane"
-, journal =	"Discrete Math."
-, volume =	69
-, year =	1988
-, pages =	"173--178"
-, update =	"98.03 bibrelex"
+, author =      "C. Neumann-Lara and J. Urrutia"
+, title =       "A combinatorial result on points and circles in the plane"
+, journal =     "Discrete Math."
+, volume =      69
+, year =        1988
+, pages =       "173--178"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ne-nmsta-80
-, author =	"O. Nevalainen and J. Ernvall"
-, title =	"A note on a minimal spanning tree algorithm for {Euclidean} space"
-, type =	"Report"
-, number =	25
-, institution =	"Dept. Comput. Sci., Univ. Turku"
-, address =	"Turku, Finland"
-, year =	1980
+, author =      "O. Nevalainen and J. Ernvall"
+, title =       "A note on a minimal spanning tree algorithm for {Euclidean} space"
+, type =        "Report"
+, number =      25
+, institution = "Dept. Comput. Sci., Univ. Turku"
+, address =     "Turku, Finland"
+, year =        1980
 }
 
 @article{nek-fmste-81
-, author =	"O. Nevalainen and J. Ernvall and J. Katajainen"
-, title =	"Finding minimal spanning trees in a {Euclidean} coordinate space"
-, journal =	"BIT"
-, volume =	21
-, year =	1981
-, pages =	"46--54"
+, author =      "O. Nevalainen and J. Ernvall and J. Katajainen"
+, title =       "Finding minimal spanning trees in a {Euclidean} coordinate space"
+, journal =     "BIT"
+, volume =      21
+, year =        1981
+, pages =       "46--54"
 }
 
 @inproceedings{n-idlge-88
-, author =	"F. Newbery"
-, title =	"An Interface Description Language for Graph Editors"
-, booktitle =	"Proc. IEEE Workshop on Visual Languages"
-, nickname =	"VL '88"
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"98.07 bibrelex, 93.09 tamassia"
+, author =      "F. Newbery"
+, title =       "An Interface Description Language for Graph Editors"
+, booktitle =   "Proc. IEEE Workshop on Visual Languages"
+, nickname =    "VL '88"
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "98.07 bibrelex, 93.09 tamassia"
 }
 
 @inproceedings{n-ecmcd-89
-, author =	"F. J. Newbery"
-, title =	"Edge Concentration: {A} Method for Clustering Directed Graphs"
-, booktitle =	"Proc. 2nd Internat. Workshop on Software Configuration Management"
-, year =	1989
-, pages =	"76--85"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "F. J. Newbery"
+, title =       "Edge Concentration: {A} Method for Clustering Directed Graphs"
+, booktitle =   "Proc. 2nd Internat. Workshop on Software Configuration Management"
+, year =        1989
+, pages =       "76--85"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{nt-eege-90
-, author =	"F. {Newbery Paulisch} and W. F. Tichy"
-, title =	"{EDGE}: An Extendible Graph Editor"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	20
-, number =	"S1"
-, year =	1990
-, pages =	"63--88"
-, note =	"also as Technical Report 8/88, Fakultat fur
+, author =      "F. {Newbery Paulisch} and W. F. Tichy"
+, title =       "{EDGE}: An Extendible Graph Editor"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      20
+, number =      "S1"
+, year =        1990
+, pages =       "63--88"
+, note =        "also as Technical Report 8/88, Fakultat fur
                  Informatik, Univ. of Karlsruhe, 1988"
-, keywords =	"graph drawing"
-, update =	"99.07 forrest, 98.07 vismara, 93.09 tamassia"
+, keywords =    "graph drawing"
+, update =      "99.07 forrest, 98.07 vismara, 93.09 tamassia"
 }
 
 @article{nm-ocfhc-80
-, author =	"M. Newborn and W. O. J. Moser"
-, title =	"Optimal crossing-free {Hamiltonian} circuit drawings of {$K_{n}$}"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	29
-, year =	1980
-, pages =	"13--26"
-, update =	"98.07 bibrelex"
+, author =      "M. Newborn and W. O. J. Moser"
+, title =       "Optimal crossing-free {Hamiltonian} circuit drawings of {$K_{n}$}"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      29
+, year =        1980
+, pages =       "13--26"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{nns-nshsp-72
-, author =	"M. Newell and R. Newell and T. Sancha"
-, title =	"A new solution to the hidden surface problem"
-, booktitle =	"Proc. ACM Annu. Conf."
-, year =	1972
-, pages =	"443--448"
-, update =	"98.07 bibrelex"
+, author =      "M. Newell and R. Newell and T. Sancha"
+, title =       "A new solution to the hidden surface problem"
+, booktitle =   "Proc. ACM Annu. Conf."
+, year =        1972
+, pages =       "443--448"
+, update =      "98.07 bibrelex"
 }
 
 @article{ns-issip-80
-, author =	"M. E. Newell and C. H. Sequin"
-, title =	"The inside story on self-intersecting polygons"
-, journal =	"Lambda"
-, volume =	1
-, year =	1980
-, pages =	"20--21"
-, update =	"98.03 bibrelex"
+, author =      "M. E. Newell and C. H. Sequin"
+, title =       "The inside story on self-intersecting polygons"
+, journal =     "Lambda"
+, volume =      1
+, year =        1980
+, pages =       "20--21"
+, update =      "98.03 bibrelex"
 }
 
 @book{n-ps-82
-, author =	"D. J. Newman"
-, title =	"A problem seminar"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "D. J. Newman"
+, title =       "A problem seminar"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @book{ns-picg-79
-, author =	"W. M. Newman and R. F. Sproull"
-, title =	"Principles of Interactive Computer Graphics"
-, publisher =	"McGraw-Hill"
-, address =	"New York, NY"
-, year =	1979
+, author =      "W. M. Newman and R. F. Sproull"
+, title =       "Principles of Interactive Computer Graphics"
+, publisher =   "McGraw-Hill"
+, address =     "New York, NY"
+, year =        1979
 }
 
 @inproceedings{nh-eecms-94
-, author =	"R. T. Ng and J. Han"
-, title =	"Efficient and Effective Clustering Methods for Spatial Data Mining"
-, booktitle =	"Proceedings of the Twentieth International Conference on Very Large Databases"
-, site =	"Santiago, Chile"
-, year =	1994
-, pages =	"144--155"
-, update =	"98.07 agarwal"
+, author =      "R. T. Ng and J. Han"
+, title =       "Efficient and Effective Clustering Methods for Spatial Data Mining"
+, booktitle =   "Proceedings of the Twentieth International Conference on Very Large Databases"
+, site =        "Santiago, Chile"
+, year =        1994
+, pages =       "144--155"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{nrw-bcsh-93
-, author =	"V. Nguyen and T. Roos and P. Widmayer"
-, title =	"Balanced cuts of a set of hyperrectangles"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"121--126"
-, cites =	"df-ssh-93, df-obpps-92p, b-mbstu-75, g-rtdis-84, py-bpahs-89, s-dasds-90, nhs-gfasm-84, py-obspo-90, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "V. Nguyen and T. Roos and P. Widmayer"
+, title =       "Balanced cuts of a set of hyperrectangles"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "121--126"
+, cites =       "df-ssh-93, df-obpps-92p, b-mbstu-75, g-rtdis-84, py-bpahs-89, s-dasds-90, nhs-gfasm-84, py-obspo-90, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @techreport{n-fppp-84
-, author =	"Van-Duc Nguyen"
-, title =	"The Find-Path Problem in the Plane"
-, type =	"A.I. Memo"
-, number =	760
-, institution =	"MIT, AI Laboratory"
-, year =	1984
-, update =	"93.09 milone+mitchell"
+, author =      "Van-Duc Nguyen"
+, title =       "The Find-Path Problem in the Plane"
+, type =        "A.I. Memo"
+, number =      760
+, institution = "MIT, AI Laboratory"
+, year =        1984
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{n-ssfcg-86
-, author =	"V.-D. Nguyen"
-, title =	"The synthesis of stable force-closure grasps"
-, type =	"Technical {Report}"
-, number =	"MIT AI-TR-905"
-, institution =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1986
-, update =	"98.07 bibrelex"
+, author =      "V.-D. Nguyen"
+, title =       "The synthesis of stable force-closure grasps"
+, type =        "Technical {Report}"
+, number =      "MIT AI-TR-905"
+, institution = "Artif. Intell. Lab., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1986
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{nwr-bcsh-93
-, author =	"Viet Hai Nguyen and Peter Widmayer and Thomas Roos"
-, title =	"Best cuts of a set of hyperrectangles"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"1--5"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Viet Hai Nguyen and Peter Widmayer and Thomas Roos"
+, title =       "Best cuts of a set of hyperrectangles"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "1--5"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @article{n-amgte-82
-, author =	"V. Ph. Nguyen"
-, title =	"Automatic mesh generation with tetrahedron elements"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	18
-, year =	1982
-, pages =	"273--289"
+, author =      "V. Ph. Nguyen"
+, title =       "Automatic mesh generation with tetrahedron elements"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      18
+, year =        1982
+, pages =       "273--289"
 }
 
 @article{nllw-xchsx-83
-, author =	"T. M. Nicholl and D. T. Lee and Y. Z. Liao and C. K. Wong"
-, title =	"On the {$X-Y$} convex hull of a set of {$X-Y$} polygons"
-, journal =	"BIT"
-, volume =	23
-, number =	4
-, year =	1983
-, pages =	"456--471"
-, update =	"98.11 bibrelex"
+, author =      "T. M. Nicholl and D. T. Lee and Y. Z. Liao and C. K. Wong"
+, title =       "On the {$X-Y$} convex hull of a set of {$X-Y$} polygons"
+, journal =     "BIT"
+, volume =      23
+, number =      4
+, year =        1983
+, pages =       "456--471"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{nprw-gcmlp-97
-, author =	"S. Nickel and J. Puerto and A. Rodriguez-Chia and A. Wei{\ss}ler"
-, title =	"General Continuous Multicriteria Location Problems"
-, type =	"Report in Wirtschaftsmathematik"
-, number =	28
-, institution =	"University of  Kaiserslautern, Department of Mathematics"
-, year =	1997
-, update =	"01.04 icking"
+, author =      "S. Nickel and J. Puerto and A. Rodriguez-Chia and A. Wei{\ss}ler"
+, title =       "General Continuous Multicriteria Location Problems"
+, type =        "Report in Wirtschaftsmathematik"
+, number =      28
+, institution = "University of  Kaiserslautern, Department of Mathematics"
+, year =        1997
+, update =      "01.04 icking"
 }
 
 @inproceedings{npw-gscpo-99
-, author =	"Stefan Nickel and Justo Puerto and Ansgar Wei{\ss}ler"
-, title =	"Geometric Solution Comcepts for Planar Ordered {Weber} Problems"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"43--46"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Stefan Nickel and Justo Puerto and Ansgar Wei{\ss}ler"
+, title =       "Geometric Solution Comcepts for Planar Ordered {Weber} Problems"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "43--46"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @incollection{n-med-71
-, author =	"H. Niederreiter"
-, title =	"Methods for estimating discrepancy"
-, editor =	"S. K. Zaremba"
-, booktitle =	"Applications of Number Theory to Numerical Analysis"
-, publisher =	"Academic Press"
-, year =	1971
-, pages =	"203--236"
-, update =	"98.03 bibrelex"
+, author =      "H. Niederreiter"
+, title =       "Methods for estimating discrepancy"
+, editor =      "S. K. Zaremba"
+, booktitle =   "Applications of Number Theory to Numerical Analysis"
+, publisher =   "Academic Press"
+, year =        1971
+, pages =       "203--236"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{n-sqsfp-79
-, author =	"W. P. Niedringhaus"
-, title =	"Scheduling with queueing: {T}he space factory problem"
-, institution =	"Princeton University"
-, year =	1979
-, update =	"96.05 agarwal"
+, author =      "W. P. Niedringhaus"
+, title =       "Scheduling with queueing: {T}he space factory problem"
+, institution = "Princeton University"
+, year =        1979
+, update =      "96.05 agarwal"
 }
 
 @phdthesis{n-aga-96
-, author =	"F. Nielsen"
-, title =	"Algorithmes g{\'e}om{\'e}triques adaptatifs"
-, type =	"Th\`{e}se de doctorat en sciences"
-, school =	"universit\'e de Nice-Sophia Antipolis"
-, address =	"France"
-, year =	1996
-, keywords =	"doctoral thesis"
-, update =	"98.07 devillers"
+, author =      "F. Nielsen"
+, title =       "Algorithmes g{\'e}om{\'e}triques adaptatifs"
+, type =        "Th\`{e}se de doctorat en sciences"
+, school =      "universit\'e de Nice-Sophia Antipolis"
+, address =     "France"
+, year =        1996
+, keywords =    "doctoral thesis"
+, update =      "98.07 devillers"
 }
 
 @inproceedings{n-capma-99
-, author =	"Frank Nielsen"
-, title =	"Constrained Approximate Pattern Matching and its Applications"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"191--193"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Frank Nielsen"
+, title =       "Constrained Approximate Pattern Matching and its Applications"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "191--193"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{n-fsbhd-96
-, author =	"F. Nielsen"
-, title =	"Fast stabbing of boxes in high dimensions"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"87--92"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "F. Nielsen"
+, title =       "Fast stabbing of boxes in high dimensions"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "87--92"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{n-fsbhd-96c
-, author =	"Franck Nielsen"
-, title =	"Fast Stabbing of Boxes in High Dimensions"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	121
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Franck Nielsen"
+, title =       "Fast Stabbing of Boxes in High Dimensions"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       121
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{n-ospcm-96
-, author =	"F. Nielsen"
-, title =	"Output-sensitive {P}eeling of {C}onvex and {M}aximal {L}ayers"
-, journal =	"Inform. Process. Lett."
-, volume =	59
-, year =	1996
-, pages =	"255--259"
-, update =	"98.11 devillers"
+, author =      "F. Nielsen"
+, title =       "Output-sensitive {P}eeling of {C}onvex and {M}aximal {L}ayers"
+, journal =     "Inform. Process. Lett."
+, volume =      59
+, year =        1996
+, pages =       "255--259"
+, update =      "98.11 devillers"
 }
 
 @techreport{ny-oscha-94
-, author =	"F. Nielsen and M. Yvinec"
-, title =	"Output-Sensitive Convex Hull Algorithms of Planar Convex Objects"
-, type =	"Research {Report}"
-, number =	2575
-, institution =	"INRIA"
-, address =	"BP93, 06902 Sophia-Antipolis, France"
-, year =	1994
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=2575"
-, precedes =	"ny-oscha-98"
-, update =	"98.07 devillers, 95.09 devillers"
-, abstract =	"A set of planar objects is said to be of type $m$ if the
+, author =      "F. Nielsen and M. Yvinec"
+, title =       "Output-Sensitive Convex Hull Algorithms of Planar Convex Objects"
+, type =        "Research {Report}"
+, number =      2575
+, institution = "INRIA"
+, address =     "BP93, 06902 Sophia-Antipolis, France"
+, year =        1994
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=2575"
+, precedes =    "ny-oscha-98"
+, update =      "98.07 devillers, 95.09 devillers"
+, abstract =    "A set of planar objects is said to be of type $m$ if the
 convex hull of any two objects has its size bounded by $2m$.  In this
 paper, we  present an algorithm based on the marriage-before-conquest
 paradigm to compute the convex hull of a set  of $n$ planar convex objects
@@ -110700,16 +110700,16 @@ @techreport{ny-oscha-94
 }
 
 @article{ny-oscha-98
-, author =	"F. Nielsen and M. Yvinec"
-, title =	"Output-Sensitive Convex Hull Algorithms of Planar Convex Objects"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, number =	1
-, year =	1998
-, pages =	"39--66"
-, succeeds =	"ny-oscha-94"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 devillers"
-, abstract =	"A set of planar objects is said to be of type $m$ if the
+, author =      "F. Nielsen and M. Yvinec"
+, title =       "Output-Sensitive Convex Hull Algorithms of Planar Convex Objects"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, number =      1
+, year =        1998
+, pages =       "39--66"
+, succeeds =    "ny-oscha-94"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 devillers"
+, abstract =    "A set of planar objects is said to be of type $m$ if the
 convex hull of any two objects has its size bounded by $2m$.  In this paper,
 we present an algorithm based on the marriage-before-conquest paradigm to
 compute the convex hull of a set of $n$ planar convex objects of fixed type
@@ -110727,233 +110727,233 @@ @article{ny-oscha-98
 }
 
 @incollection{nf-scbut-83
-, author =	"G. M. Nielson and R. Franke"
-, title =	"Surface Construction Based Upon Triangulations"
-, editor =	"R. Barnhill and W. Boehm"
-, booktitle =	"Surfaces in Computer-Aided Geometric Design"
-, publisher =	"North-Holland"
-, year =	1983
-, pages =	"163--177"
-, annote =	"Two different triangulations considered for surface
-		 generation. DT and ``min-max'' triangulation which
-		 minimizes maximum triangle angles."
+, author =      "G. M. Nielson and R. Franke"
+, title =       "Surface Construction Based Upon Triangulations"
+, editor =      "R. Barnhill and W. Boehm"
+, booktitle =   "Surfaces in Computer-Aided Geometric Design"
+, publisher =   "North-Holland"
+, year =        1983
+, pages =       "163--177"
+, annote =      "Two different triangulations considered for surface
+                 generation. DT and ``min-max'' triangulation which
+                 minimizes maximum triangle angles."
 }
 
 @proceedings{n-iwcg-83
-, title =	"Abstracts 1st Intern. Workshop Comput. Geom."
-, editor =	"J. Nievergelt"
-, nickname =	"CG '83"
-, site =	"Z{\"u}rich"
-, publisher =	"ETH Z{\"u}rich"
-, year =	1983
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 1st Intern. Workshop Comput. Geom."
+, editor =      "J. Nievergelt"
+, nickname =    "CG '83"
+, site =        "Z{\"u}rich"
+, publisher =   "ETH Z{\"u}rich"
+, year =        1983
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{n-kbgr-89
-, author =	"J. Nievergelt"
-, title =	"{Konsistenzprobleme} beim geometrischen {Rechner}"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "J. Nievergelt"
+, title =       "{Konsistenzprobleme} beim geometrischen {Rechner}"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @book{nh-adsag-93
-, author =	"J. Nievergelt and K. H. Hinrichs"
-, title =	"Algorithms and Data Structures: {W}ith Applications to Graphics and Geometry"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1993
-, keywords =	"book"
-, comments =	"Computing Reviews 9401-0020"
-, update =	"97.03 schwarzkopf, 96.05 agarwal, 94.09 jones, 93.09 held"
+, author =      "J. Nievergelt and K. H. Hinrichs"
+, title =       "Algorithms and Data Structures: {W}ith Applications to Graphics and Geometry"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1993
+, keywords =    "book"
+, comments =    "Computing Reviews 9401-0020"
+, update =      "97.03 schwarzkopf, 96.05 agarwal, 94.09 jones, 93.09 held"
 }
 
 @techreport{nhs-gfasm-81
-, author =	"J. Nievergelt and H. Hinterberger and K. C. Sevcik"
-, title =	"The grid file: {A}n adaptable, symmetric multi-key file structure"
-, type =	"Report"
-, number =	46
-, institution =	"Inst. Inform., Eidgen{\"o}ssische Tech. Hochschule Z{\"u}rich"
-, address =	"Z{\"u}rich, Switzerland"
-, year =	1981
-, update =	"96.05 agarwal"
+, author =      "J. Nievergelt and H. Hinterberger and K. C. Sevcik"
+, title =       "The grid file: {A}n adaptable, symmetric multi-key file structure"
+, type =        "Report"
+, number =      46
+, institution = "Inst. Inform., Eidgen{\"o}ssische Tech. Hochschule Z{\"u}rich"
+, address =     "Z{\"u}rich, Switzerland"
+, year =        1981
+, update =      "96.05 agarwal"
 }
 
 @article{nhs-gfasm-84
-, author =	"J. Nievergelt and H. Hinterberger and K. C. Sevcik"
-, title =	"The grid file: {A}n adaptable, symmetric multi-key file structure"
-, journal =	"ACM Trans. Database Syst."
-, volume =	9
-, number =	1
-, year =	1984
-, pages =	"38--71"
-, update =	"98.11 bibrelex, 97.07 agarwal"
+, author =      "J. Nievergelt and H. Hinterberger and K. C. Sevcik"
+, title =       "The grid file: {A}n adaptable, symmetric multi-key file structure"
+, journal =     "ACM Trans. Database Syst."
+, volume =      9
+, number =      1
+, year =        1984
+, pages =       "38--71"
+, update =      "98.11 bibrelex, 97.07 agarwal"
 }
 
 @article{np-psaig-82
-, author =	"J. Nievergelt and F. P. Preparata"
-, title =	"Plane-sweep algorithms for intersecting geometric figures"
-, journal =	"Commun. ACM"
-, volume =	25
-, year =	1982
-, pages =	"739--747"
-, keywords =	"polygons, intersection, two-dimensional"
+, author =      "J. Nievergelt and F. P. Preparata"
+, title =       "Plane-sweep algorithms for intersecting geometric figures"
+, journal =     "Commun. ACM"
+, volume =      25
+, year =        1982
+, pages =       "739--747"
+, keywords =    "polygons, intersection, two-dimensional"
 }
 
 @article{nr-bstbb-73
-, author =	"J. Nievergelt and E. M. Reingold"
-, title =	"Binary search trees of bounded balance"
-, journal =	"SIAM J. Comput."
-, volume =	2
-, year =	1973
-, pages =	"33--43"
-, update =	"97.11 bibrelex"
+, author =      "J. Nievergelt and E. M. Reingold"
+, title =       "Binary search trees of bounded balance"
+, journal =     "SIAM J. Comput."
+, volume =      2
+, year =        1973
+, pages =       "33--43"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{nslab-xpegc-91
-, author =	"J{\"u}rg Nievergelt and Peter Schorn and Michele de Lorenzi and Christoph Ammann and Adrian Br{\"u}ngger"
-, title =	"{XYZ}: A project in experimental geometric computation"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"171--186"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "J{\"u}rg Nievergelt and Peter Schorn and Michele de Lorenzi and Christoph Ammann and Adrian Br{\"u}ngger"
+, title =       "{XYZ}: A project in experimental geometric computation"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "171--186"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @techreport{nslab-xsgc-91
-, author =	"J. Nievergelt and P. Schorn and M. de Lorenzi and C. Ammann and A. {Br\"ungger}"
-, title =	"{XYZ}: Software for geometric computation"
-, type =	"Report"
-, number =	163
-, institution =	"Institut f{\"u}r Theorische Informatik, ETH"
-, address =	"Z{\"u}rich, Switzerland"
-, month =	jul
-, year =	1991
-, update =	"93.09 erickson+rote"
+, author =      "J. Nievergelt and P. Schorn and M. de Lorenzi and C. Ammann and A. {Br\"ungger}"
+, title =       "{XYZ}: Software for geometric computation"
+, type =        "Report"
+, number =      163
+, institution = "Institut f{\"u}r Theorische Informatik, ETH"
+, address =     "Z{\"u}rich, Switzerland"
+, month =       jul
+, year =        1991
+, update =      "93.09 erickson+rote"
 }
 
 @article{nw-gfsiq-93
-, author =	"J. Nievergelt and P. Widmayer"
-, title =	"Guard files: {S}tabbing and intersection queries on fat spatial objects"
-, journal =	"Comput. J."
-, volume =	36
-, year =	1993
-, pages =	"107--116"
-, update =	"97.07 agarwal"
+, author =      "J. Nievergelt and P. Widmayer"
+, title =       "Guard files: {S}tabbing and intersection queries on fat spatial objects"
+, journal =     "Comput. J."
+, volume =      36
+, year =        1993
+, pages =       "107--116"
+, update =      "97.07 agarwal"
 }
 
 @unpublished{nw-sdscd-96
-, author =	"J. Nievergelt and P. Widmayer"
-, title =	"Spatial data structures: {C}oncepts and design choices"
-, year =	1996
-, note =	"unpublished manuscript"
-, update =	"97.07 agarwal"
+, author =      "J. Nievergelt and P. Widmayer"
+, title =       "Spatial data structures: {C}oncepts and design choices"
+, year =        1996
+, note =        "unpublished manuscript"
+, update =      "97.07 agarwal"
 }
 
 @incollection{nw-sdscd-00
-, author =	"J{\"u}rg Nievergelt and Peter Widmayer"
-, title =	"Spatial Data Structures: {Concepts} and Design Choices"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"725--764"
-, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 17 of su-hcg-00"
+, author =      "J{\"u}rg Nievergelt and Peter Widmayer"
+, title =       "Spatial Data Structures: {Concepts} and Design Choices"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "725--764"
+, update =      "00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 17 of su-hcg-00"
 }
 
 @article{ny-piids-94
-, author =	"Masatoshi Niizeki and Fujio Yamaguchi"
-, title =	"Projectively invariant intersection detection for solid modelling"
-, journal =	"ACM Trans. Graph."
-, volume =	13
-, number =	3
-, year =	1994
-, pages =	"277--299"
-, keywords =	"intersection, homogeneous coordinates, solid modeling"
-, comments =	"Correction to mst-ialc-89"
-, update =	"95.09 korneenko"
+, author =      "Masatoshi Niizeki and Fujio Yamaguchi"
+, title =       "Projectively invariant intersection detection for solid modelling"
+, journal =     "ACM Trans. Graph."
+, volume =      13
+, number =      3
+, year =        1994
+, pages =       "277--299"
+, keywords =    "intersection, homogeneous coordinates, solid modeling"
+, comments =    "Correction to mst-ialc-89"
+, update =      "95.09 korneenko"
 }
 
 @book{ns-gg-87
-, author =	"V. V. Nikulin and I. R. Shafarevich"
-, title =	"Geometrics and Groups"
-, publisher =	"Springer-Verlag"
-, year =	1987
-, update =	"98.07 bibrelex"
+, author =      "V. V. Nikulin and I. R. Shafarevich"
+, title =       "Geometrics and Groups"
+, publisher =   "Springer-Verlag"
+, year =        1987
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{n-gagmm-95
-, author =	"Bengt J. Nilsson"
-, title =	"Guarding Art Galleries --- Methods for Mobile Guards"
-, school =	"Lund University"
-, year =	1995
-, keywords =	"doctoral thesis"
-, update =	"98.03 mitchell, 95.09 mitchell"
+, author =      "Bengt J. Nilsson"
+, title =       "Guarding Art Galleries --- Methods for Mobile Guards"
+, school =      "Lund University"
+, year =        1995
+, keywords =    "doctoral thesis"
+, update =      "98.03 mitchell, 95.09 mitchell"
 }
 
 @incollection{nosi-rocg-92
-, author =	"Bengt J. Nilsson and Thomas Ottmann and Sven Schuierer and Christian Icking"
-, title =	"Restricted Orientation Computational Geometry"
-, editor =	"Burkhard Monien and Thomas Ottmann"
-, booktitle =	"Data Structures and Efficient Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	594
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"148--185"
-, update =	"99.11 bibrelex, 97.03 icking"
+, author =      "Bengt J. Nilsson and Thomas Ottmann and Sven Schuierer and Christian Icking"
+, title =       "Restricted Orientation Computational Geometry"
+, editor =      "Burkhard Monien and Thomas Ottmann"
+, booktitle =   "Data Structures and Efficient Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      594
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "148--185"
+, update =      "99.11 bibrelex, 97.03 icking"
 }
 
 @inproceedings{ns-oarlc-91
-, author =	"Bengt J. Nilsson and S. Schuierer"
-, title =	"An optimal algorithm for the rectilinear link center of a rectilinear polygon"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"249--260"
-, keywords =	"link distance, link center, orthohedral, visibility, polygon"
-, precedes =	"ns-oarlc-96"
-, update =	"98.03 mitchell, 96.09 devillers"
+, author =      "Bengt J. Nilsson and S. Schuierer"
+, title =       "An optimal algorithm for the rectilinear link center of a rectilinear polygon"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "249--260"
+, keywords =    "link distance, link center, orthohedral, visibility, polygon"
+, precedes =    "ns-oarlc-96"
+, update =      "98.03 mitchell, 96.09 devillers"
 }
 
 @article{ns-oarlc-96
-, author =	"Bengt J. Nilsson and S. Schuierer"
-, title =	"An optimal algorithm for the rectilinear link center of a rectilinear polygon"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"169--194"
-, keywords =	"link distance, link center, orthohedral, visibility, polygon"
-, succeeds =	"ns-oarlc-91"
-, update =	"98.03 mitchell, 96.09 devillers"
+, author =      "Bengt J. Nilsson and S. Schuierer"
+, title =       "An optimal algorithm for the rectilinear link center of a rectilinear polygon"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "169--194"
+, keywords =    "link distance, link center, orthohedral, visibility, polygon"
+, succeeds =    "ns-oarlc-91"
+, update =      "98.03 mitchell, 96.09 devillers"
 }
 
 @inproceedings{ns-crldp-91
-, author =	"Bengt J. Nilsson and Sven Schuierer"
-, title =	"Computing the rectilinear link diameter of a polygon"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"203--215"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
-, abstract =	"The problem of finding the diameter of a simple polygon has
+, author =      "Bengt J. Nilsson and Sven Schuierer"
+, title =       "Computing the rectilinear link diameter of a polygon"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "203--215"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
+, abstract =    "The problem of finding the diameter of a simple polygon has
                  been studied extensively in recent years.  $O(n \log n)$
                  time upper bounds have been given for computing the
                  geodesic diameter and the link diameter for a polygon.
@@ -110965,199 +110965,199 @@ @inproceedings{ns-crldp-91
 }
 
 @misc{nw-owrsp-90m
-, author =	"Bengt J. Nilsson and D. Wood"
-, title =	"Optimum watchmen routes in spiral polygons"
-, month =	aug
-, year =	1989
-, note =	"Manuscript, University of Waterloo, Ontario, Canada"
-, precedes =	"nw-owrsp-90i"
-, update =	"98.07 bibrelex"
+, author =      "Bengt J. Nilsson and D. Wood"
+, title =       "Optimum watchmen routes in spiral polygons"
+, month =       aug
+, year =        1989
+, note =        "Manuscript, University of Waterloo, Ontario, Canada"
+, precedes =    "nw-owrsp-90i"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{nw-owrsp-90i
-, author =	"B. J. Nilsson and D. Wood"
-, title =	"Optimum watchmen routes in spiral polygons"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"269--272"
-, succeeds =	"nw-owrsp-90m"
-, cites =	"c-ctpg-75, cn-owr-86, cn-wrsp-87, cn-owr-88, f-spcwt-78, o-agta-87, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "B. J. Nilsson and D. Wood"
+, title =       "Optimum watchmen routes in spiral polygons"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "269--272"
+, succeeds =    "nw-owrsp-90m"
+, cites =       "c-ctpg-75, cn-owr-86, cn-wrsp-87, cn-owr-88, f-spcwt-78, o-agta-87, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{n-maaai-69
-, author =	"N. Nilsson"
-, title =	"A mobile automaton: {A}n application of artificial intelligence techniques"
-, booktitle =	"Proc. IJCAI"
-, year =	1969
-, pages =	"509--520"
-, update =	"96.05 agarwal"
+, author =      "N. Nilsson"
+, title =       "A mobile automaton: {A}n application of artificial intelligence techniques"
+, booktitle =   "Proc. IJCAI"
+, year =        1969
+, pages =       "509--520"
+, update =      "96.05 agarwal"
 }
 
 @inproceedings{n-asmpc-90
-, author =	"N. Nishimura"
-, title =	"Asynchronous shared memory parallel computation"
-, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
-, year =	1990
-, pages =	"76--84"
-, update =	"96.09 orourke"
+, author =      "N. Nishimura"
+, title =       "Asynchronous shared memory parallel computation"
+, booktitle =   "Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
+, year =        1990
+, pages =       "76--84"
+, update =      "96.09 orourke"
 }
 
 @techreport{n-lbcmm-77
-, author =	"T. Nishizeki"
-, title =	"Lower bounds on cardinality of the maximum matchings of planar graphs"
-, type =	"Technical {Report}"
-, institution =	"Carnegie-Mellon Univ."
-, address =	"Phildelphia, PA"
-, year =	1977
-, update =	"98.07 bibrelex"
+, author =      "T. Nishizeki"
+, title =       "Lower bounds on cardinality of the maximum matchings of planar graphs"
+, type =        "Technical {Report}"
+, institution = "Carnegie-Mellon Univ."
+, address =     "Phildelphia, PA"
+, year =        1977
+, update =      "98.07 bibrelex"
 }
 
 @book{nc-pgta-88
-, author =	"T. Nishizeki and N. Chiba"
-, title =	"Planar Graphs: Theory and Algorithms"
-, series =	"Ann. Discrete Math."
-, volume =	32
-, publisher =	"North-Holland"
-, address =	"Amsterdam, The Netherlands"
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"00.03 vismara, 96.09 devillers, 96.05 agarwal, 93.09 tamassia"
+, author =      "T. Nishizeki and N. Chiba"
+, title =       "Planar Graphs: Theory and Algorithms"
+, series =      "Ann. Discrete Math."
+, volume =      32
+, publisher =   "North-Holland"
+, address =     "Amsterdam, The Netherlands"
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "00.03 vismara, 96.09 devillers, 96.05 agarwal, 93.09 tamassia"
 }
 
 @article{n-coatd-88
-, author =	"H. Noborio"
-, title =	"Construction of the octree approximating three-dimensional objects by using multiple views"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	10
-, year =	1988
-, pages =	"769--782"
-, update =	"98.11 bibrelex"
+, author =      "H. Noborio"
+, title =       "Construction of the octree approximating three-dimensional objects by using multiple views"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      10
+, year =        1988
+, pages =       "769--782"
+, update =      "98.11 bibrelex"
 }
 
 @article{nfa-ficmu-89
-, author =	"H. Noborio and S. Fukuda and S. Arimoto"
-, title =	"Fast interference check method using octree representation"
-, journal =	"Advanced robotics"
-, volume =	3
-, number =	3
-, year =	1989
-, pages =	"193--212"
-, update =	"93.09 milone+mitchell"
+, author =      "H. Noborio and S. Fukuda and S. Arimoto"
+, title =       "Fast interference check method using octree representation"
+, journal =     "Advanced robotics"
+, volume =      3
+, number =      3
+, year =        1989
+, pages =       "193--212"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{nyt-usbna-97
-, author =	"Hiroshi Noborio and Takahashi Yoshioka and Shoji Tominaga"
-, title =	"An Universal Sensor-Based Navigation Algorithm"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	23
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Hiroshi Noborio and Takahashi Yoshioka and Shoji Tominaga"
+, title =       "An Universal Sensor-Based Navigation Algorithm"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       23
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{ngv-begs-93
-, author =	"M. H. Nodine and M. T. Goodrich and J. S. Vitter"
-, title =	"Blocking for External Graph Searching"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Principles Database Syst."
-, nickname =	"PODS '93"
-, year =	1993
-, pages =	"222--232"
-, update =	"94.09 vitter"
+, author =      "M. H. Nodine and M. T. Goodrich and J. S. Vitter"
+, title =       "Blocking for External Graph Searching"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Principles Database Syst."
+, nickname =    "PODS '93"
+, year =        1993
+, pages =       "222--232"
+, update =      "94.09 vitter"
 }
 
 @article{ngv-begs-96
-, author =	"M. H. Nodine and M. T. Goodrich and J. S. Vitter"
-, title =	"Blocking for External Graph Searching"
-, journal =	"Algorithmica"
-, volume =	16
-, number =	2
-, month =	aug
-, year =	1996
-, pages =	"181--214"
-, update =	"97.03 murali"
+, author =      "M. H. Nodine and M. T. Goodrich and J. S. Vitter"
+, title =       "Blocking for External Graph Searching"
+, journal =     "Algorithmica"
+, volume =      16
+, number =      2
+, month =       aug
+, year =        1996
+, pages =       "181--214"
+, update =      "97.03 murali"
 }
 
 @inproceedings{nv-ddssd-93
-, author =	"M. H. Nodine and J. S. Vitter"
-, title =	"Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors"
-, booktitle =	"Proc. 5th ACM Sympos. Parallel Algorithms Architect."
-, year =	1993
-, pages =	"120--129"
-, update =	"96.09 orourke+tamassia"
+, author =      "M. H. Nodine and J. S. Vitter"
+, title =       "Deterministic Distribution Sort in Shared and Distributed Memory Multiprocessors"
+, booktitle =   "Proc. 5th ACM Sympos. Parallel Algorithms Architect."
+, year =        1993
+, pages =       "120--129"
+, update =      "96.09 orourke+tamassia"
 }
 
 @article{nv-gsosa-95
-, author =	"M. H. Nodine and J. S. Vitter"
-, title =	"Greed Sort: An Optimal Sorting Algorithm for Multiple Disks"
-, journal =	"J. ACM"
-, volume =	42
-, number =	4
-, month =	jul
-, year =	1995
-, pages =	"919--933"
-, update =	"97.03 murali"
+, author =      "M. H. Nodine and J. S. Vitter"
+, title =       "Greed Sort: An Optimal Sorting Algorithm for Multiple Disks"
+, journal =     "J. ACM"
+, volume =      42
+, number =      4
+, month =       jul
+, year =        1995
+, pages =       "919--933"
+, update =      "97.03 murali"
 }
 
 @inproceedings{nv-lsspm-91
-, author =	"M. H. Nodine and J. S. Vitter"
-, title =	"Large-Scale Sorting in Parallel Memories"
-, booktitle =	"Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
-, year =	1991
-, pages =	"29--39"
-, update =	"96.09 orourke"
+, author =      "M. H. Nodine and J. S. Vitter"
+, title =       "Large-Scale Sorting in Parallel Memories"
+, booktitle =   "Proc. 3rd ACM Sympos. Parallel Algorithms Architect."
+, year =        1991
+, pages =       "29--39"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{n-spetv-94
-, author =	"E. G. Noik"
-, title =	"A Space of Presentation Emphasis Techniques for Visualizing Graphs"
-, booktitle =	"GI '94: Graphics Interface 1994"
-, site =	"Banff, Alberta, Canada"
-, month =	may
-, year =	1994
-, url =	"ftp://db.toronto.edu/pub/papers/gi94.ps.Z"
-, update =	"94.05 tamassia"
+, author =      "E. G. Noik"
+, title =       "A Space of Presentation Emphasis Techniques for Visualizing Graphs"
+, booktitle =   "GI '94: Graphics Interface 1994"
+, site =        "Banff, Alberta, Canada"
+, month =       may
+, year =        1994
+, url = "ftp://db.toronto.edu/pub/papers/gi94.ps.Z"
+, update =      "94.05 tamassia"
 }
 
 @inproceedings{n-epeag-95
-, author =	"E. G. Noik"
-, title =	"Encoding Presentation Emphasis Algorithms for Graphs"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"428--435"
-, keywords =	"graph drawing, fisheye view, system"
-, update =	"95.01 tamassia"
-}
-
-%, day =	"14--18"
+, author =      "E. G. Noik"
+, title =       "Encoding Presentation Emphasis Algorithms for Graphs"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "428--435"
+, keywords =    "graph drawing, fisheye view, system"
+, update =      "95.01 tamassia"
+}
+
+%, day =        "14--18"
 @inproceedings{n-elhfv-93
-, author =	"E. G. Noik"
-, title =	"Exploring Large Hyperdocuments: {F}isheye Views of Nested Networks"
-, booktitle =	"Hypertext '93: ACM Conf. on Hypertext"
-, site =	"Seattle, WA"
-, month =	nov
-, year =	1993
-, pages =	"192--205"
-, update =	"96.05 agarwal, 94.01 tamassia"
+, author =      "E. G. Noik"
+, title =       "Exploring Large Hyperdocuments: {F}isheye Views of Nested Networks"
+, booktitle =   "Hypertext '93: ACM Conf. on Hypertext"
+, site =        "Seattle, WA"
+, month =       nov
+, year =        1993
+, pages =       "192--205"
+, update =      "96.05 agarwal, 94.01 tamassia"
 }
 
 @incollection{n-gshvu-93
-, author =	"E. G. Noik"
-, title =	"Graphite: {A} Suite of Hygraph Visualization Utilities"
-, editor =	"A. O. Mendelzon"
-, booktitle =	"Declarative database visualization: Recent papers from the Hy+/GraphLog project"
-, publisher =	"Technical report CSRI-285, University of Toronto"
-, month =	jul
-, year =	1993
-, update =	"96.05 agarwal, 94.01 tamassia"
-, annote =	"Graphite is a set of Unix programs that support
+, author =      "E. G. Noik"
+, title =       "Graphite: {A} Suite of Hygraph Visualization Utilities"
+, editor =      "A. O. Mendelzon"
+, booktitle =   "Declarative database visualization: Recent papers from the Hy+/GraphLog project"
+, publisher =   "Technical report CSRI-285, University of Toronto"
+, month =       jul
+, year =        1993
+, update =      "96.05 agarwal, 94.01 tamassia"
+, annote =      "Graphite is a set of Unix programs that support
 general and directed graphs and hygraphs (a nested graph formalism) and
 perform the following functions:  -draw graphs using combinations of 10
 basic graph layout algorithms -generate several types of fisheye views
@@ -111168,4797 +111168,4797 @@ @incollection{n-gshvu-93
 encapsulated PostScript"
 }
 
-%, day =	"24--27"
+%, day =        "24--27"
 @inproceedings{n-lifvn-93
-, author =	"E. G. Noik"
-, title =	"Layout-independent Fisheye Views of Nested Graphs"
-, booktitle =	"VL '93: IEEE Symposium on Visual Languages"
-, site =	"Bergen, Norway"
-, month =	aug
-, year =	1993
-, pages =	"336--341"
-, update =	"94.01 tamassia"
+, author =      "E. G. Noik"
+, title =       "Layout-independent Fisheye Views of Nested Graphs"
+, booktitle =   "VL '93: IEEE Symposium on Visual Languages"
+, site =        "Bergen, Norway"
+, month =       aug
+, year =        1993
+, pages =       "336--341"
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{n-nemrp-94
-, author =	"Hartmut Noltemeier"
-, title =	"A New Efficient Method to Represent and Process Proximity and Similarity in Sets of Complex Objects"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	77
-, cites =	"ZZZ"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Hartmut Noltemeier"
+, title =       "A New Efficient Method to Represent and Process Proximity and Similarity in Sets of Complex Objects"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       77
+, cites =       "ZZZ"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @proceedings{n-cgia-88
-, title =	"Computational Geometry and its Applications"
-, editor =	"H. Noltemeier"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, update =	"00.03 bibrelex, 99.11 bibrelex, 97.11 icking, 93.09 milone+mitchell"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, title =       "Computational Geometry and its Applications"
+, editor =      "H. Noltemeier"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, update =      "00.03 bibrelex, 99.11 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{n-lfmss-91
-, author =	"Hartmut Noltemeier"
-, title =	"Layout of flexible manufacturing systems: selected problems"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"217--226"
-, update =	"00.03 bibrelex, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Hartmut Noltemeier"
+, title =       "Layout of flexible manufacturing systems: selected problems"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "217--226"
+, update =      "00.03 bibrelex, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{n-vta-89
-, author =	"H. Noltemeier"
-, title =	"Voronoi trees and applications"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, year =	1989
-, pages =	"69--74"
-, update =	"95.09 mitchell"
+, author =      "H. Noltemeier"
+, title =       "Voronoi trees and applications"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, year =        1989
+, pages =       "69--74"
+, update =      "95.09 mitchell"
 }
 
 @inproceedings{nvz-mbtte-92
-, author =	"H. Noltemeier and K. Verbarg and C. Zirkelbach"
-, title =	"Monotonous Bisector Trees: {A} Tool for Efficient Partitioning of Complex Scenes of Geometric Objects"
-, booktitle =	"Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint Initiative"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	594
-, publisher =	"Springer-Verlag"
-, year =	1992
-, succeeds =	"z-mbtcp-90"
-, update =	"96.05 agarwal, 94.05 franciosa"
+, author =      "H. Noltemeier and K. Verbarg and C. Zirkelbach"
+, title =       "Monotonous Bisector Trees: {A} Tool for Efficient Partitioning of Complex Scenes of Geometric Objects"
+, booktitle =   "Data Structures and Efficient Algorithms: Final Report on the DFG Special Joint Initiative"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      594
+, publisher =   "Springer-Verlag"
+, year =        1992
+, succeeds =    "z-mbtcp-90"
+, update =      "96.05 agarwal, 94.05 franciosa"
 }
 
 @article{n-scpsn-81
-, author =	"A. K. Noor"
-, title =	"Survey of computer programs for solutions of nonlinear structural and solid mechanics problems"
-, journal =	"Comput. Struct."
-, volume =	13
-, year =	1981
-, pages =	"424--465"
+, author =      "A. K. Noor"
+, title =       "Survey of computer programs for solutions of nonlinear structural and solid mechanics problems"
+, journal =     "Comput. Struct."
+, volume =      13
+, year =        1981
+, pages =       "424--465"
 }
 
 @article{nr-ccppp-67
-, author =	"S. Nordbeck and B. Rystedt"
-, title =	"Computer cartography point-in-polygon programs"
-, journal =	"BIT"
-, volume =	7
-, year =	1967
-, pages =	"39--64"
+, author =      "S. Nordbeck and B. Rystedt"
+, title =       "Computer cartography point-in-polygon programs"
+, journal =     "BIT"
+, volume =      7
+, year =        1967
+, pages =       "39--64"
 }
 
 @incollection{n-cte-83
-, author =	"A. C. Norman"
-, title =	"Computing in transcendental extensions"
-, editor =	"B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
-, booktitle =	"Computer Algebra: Symbolic and Algebraic Computation"
-, publisher =	"Springer-Verlag"
-, year =	1983
-, pages =	"169--172"
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "A. C. Norman"
+, title =       "Computing in transcendental extensions"
+, editor =      "B. Buchberger and G. E. Collins and R. Loos and R. Albrecht"
+, booktitle =   "Computer Algebra: Symbolic and Algebraic Computation"
+, publisher =   "Springer-Verlag"
+, year =        1983
+, pages =       "169--172"
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @misc{n-5dg-95
-, author =	"S. North"
-, title =	"5114 directed graphs"
-, year =	1995
-, note =	"Manuscript. \url{ftp.research.bell-labs.com/dist/drawdag/}"
-, keywords =	"graph drawing, experiments"
-, update =	"96.09 tamassia"
+, author =      "S. North"
+, title =       "5114 directed graphs"
+, year =        1995
+, note =        "Manuscript. \url{ftp.research.bell-labs.com/dist/drawdag/}"
+, keywords =    "graph drawing, experiments"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{n-ild-96
-, author =	"S. North"
-, title =	"Incremental Layout in {DynaDAG}"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"409--418"
-, update =	"98.11 bibrelex, 98.07 vismara"
+, author =      "S. North"
+, title =       "Incremental Layout in {DynaDAG}"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "409--418"
+, update =      "98.11 bibrelex, 98.07 vismara"
 }
 
 @techreport{nk-agv-95
-, author =	"S. North and E. Koutsofios"
-, title =	"Applications of Graph Visualization"
-, institution =	"AT\&T Bell Laboratories, Murray Hill, NJ."
-, year =	1995
-, note =	"Available from \url{http://www.research.bell-labs.com/dist/drawdag}"
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "S. North and E. Koutsofios"
+, title =       "Applications of Graph Visualization"
+, institution = "AT\&T Bell Laboratories, Murray Hill, NJ."
+, year =        1995
+, note =        "Available from \url{http://www.research.bell-labs.com/dist/drawdag}"
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @proceedings{n-gd-97
-, title =	"Graph Drawing (Proc. GD '96)"
-, editor =	"S. C. North"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, update =	"99.11 bibrelex, 98.11 bibrelex, 98.07 vismara+tamassia"
+, title =       "Graph Drawing (Proc. GD '96)"
+, editor =      "S. C. North"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, update =      "99.11 bibrelex, 98.11 bibrelex, 98.07 vismara+tamassia"
 }
 
 @inproceedings{npt-usafd-90
-, author =	"C. H. Norton and S. A. Plotkin and {\'E}. Tardos"
-, title =	"Using separation algorithms in fixed dimension"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"377--387"
-, precedes =	"npt-usafd-92"
-, update =	"93.09 rote"
+, author =      "C. H. Norton and S. A. Plotkin and {\'E}. Tardos"
+, title =       "Using separation algorithms in fixed dimension"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "377--387"
+, precedes =    "npt-usafd-92"
+, update =      "93.09 rote"
 }
 
 @article{npt-usafd-92
-, author =	"C. H. Norton and S. A. Plotkin and {\'E}. Tardos"
-, title =	"Using separation algorithms in fixed dimensions"
-, journal =	"J. Algorithms"
-, volume =	13
-, year =	1992
-, pages =	"79--98"
-, succeeds =	"npt-usafd-90"
-, update =	"93.09 rote"
+, author =      "C. H. Norton and S. A. Plotkin and {\'E}. Tardos"
+, title =       "Using separation algorithms in fixed dimensions"
+, journal =     "J. Algorithms"
+, volume =      13
+, year =        1992
+, pages =       "79--98"
+, succeeds =    "npt-usafd-90"
+, update =      "93.09 rote"
 }
 
 @article{npl-wplm-92
-, author =	"R. Norwood and G. Poole and M. Laidacker"
-, title =	"The worm problem of {Leo} {Moser}"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"153--162"
+, author =      "R. Norwood and G. Poole and M. Laidacker"
+, title =       "The worm problem of {Leo} {Moser}"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "153--162"
 }
 
 @article{n-edlde-48
-, author =	"M. Nosarzewska"
-, title =	"Evaluation de la diff{\'e}rence entre l'aire d'une r{\'e}gion plane convexe et le nombre des points aux coordonn{\'e}es enti{\`e}res couverts par elle"
-, journal =	"Colloq. Math."
-, volume =	1
-, year =	1948
-, update =	"97.11 bibrelex"
+, author =      "M. Nosarzewska"
+, title =       "Evaluation de la diff{\'e}rence entre l'aire d'une r{\'e}gion plane convexe et le nombre des points aux coordonn{\'e}es enti{\`e}res couverts par elle"
+, journal =     "Colloq. Math."
+, volume =      1
+, year =        1948
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{nk-sdprl-89
-, author =	"L. V. Nosov and N. M. Korneenko"
-, title =	"Special dissection of polygonal regions in {LSI} mask pattern design"
-, booktitle =	"GEOBILD'89, Proc. 4th Workshop on Geometrical Problems of Image Processing, Georgenthal, March 13--17, 1989"
-, series =	"Math. Res."
-, volume =	51
-, publisher =	"Akademie-Verlag"
-, address =	"Berlin, GDR"
-, year =	1989
-, pages =	"53--57"
-, keywords =	"isothetic domain, dissection, decomposition, {VLSI} layout design"
-, update =	"95.01 korneenko"
+, author =      "L. V. Nosov and N. M. Korneenko"
+, title =       "Special dissection of polygonal regions in {LSI} mask pattern design"
+, booktitle =   "GEOBILD'89, Proc. 4th Workshop on Geometrical Problems of Image Processing, Georgenthal, March 13--17, 1989"
+, series =      "Math. Res."
+, volume =      51
+, publisher =   "Akademie-Verlag"
+, address =     "Berlin, GDR"
+, year =        1989
+, pages =       "53--57"
+, keywords =    "isothetic domain, dissection, decomposition, {VLSI} layout design"
+, update =      "95.01 korneenko"
 }
 
 @article{np-ospp-89
-, author =	"R. Nowakowski and A. Parker"
-, title =	"Ordered sets, pagenumbers and planarity"
-, journal =	"Order"
-, volume =	6
-, year =	1989
-, pages =	"209--218"
-, update =	"98.07 bibrelex"
+, author =      "R. Nowakowski and A. Parker"
+, title =       "Ordered sets, pagenumbers and planarity"
+, journal =     "Order"
+, volume =      6
+, year =        1989
+, pages =       "209--218"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{nr-bsotc-91
-, author =	"R. Nowakowski and I. Rival"
-, title =	"Bending and stretching orders into three channels"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"15--18"
-, cites =	"bk-btg-79, cm-ecgt-78, d-dtpos-50, f-slrpg-48, f-ioig-85, k-fpos-87, m-ctcos-89, np-ospp-89, nru-lcpop-88, t-eggmn-87, w-bzv-36, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "R. Nowakowski and I. Rival"
+, title =       "Bending and stretching orders into three channels"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "15--18"
+, cites =       "bk-btg-79, cm-ecgt-78, d-dtpos-50, f-slrpg-48, f-ioig-85, k-fpos-87, m-ctcos-89, np-ospp-89, nru-lcpop-88, t-eggmn-87, w-bzv-36, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{nru-lcpop-88
-, author =	"R. Nowakowski and I. Rival and J. Urrutia"
-, title =	"Lattices contained in planar orders are planar"
-, note =	"University of Ottawa TR-88-12, to appear in Algebra Universalis"
-, update =	"98.07 bibrelex"
+, author =      "R. Nowakowski and I. Rival and J. Urrutia"
+, title =       "Lattices contained in planar orders are planar"
+, note =        "University of Ottawa TR-88-12, to appear in Algebra Universalis"
+, update =      "98.07 bibrelex"
 }
 
 @article{nru-roptp-90
-, author =	"R. J. Nowakowski and I. Rival and J. Urrutia"
-, title =	"Representing orders on the plane by translating points and lines"
-, journal =	"Discrete Appl. Math."
-, volume =	"??"
-, year =	1990
-, pages =	"147--156"
-, update =	"98.07 bibrelex"
+, author =      "R. J. Nowakowski and I. Rival and J. Urrutia"
+, title =       "Representing orders on the plane by translating points and lines"
+, journal =     "Discrete Appl. Math."
+, volume =      "??"
+, year =        1990
+, pages =       "147--156"
+, update =      "98.07 bibrelex"
 }
 
 @article{n-gwg-86
-, author =	"Simeon Ntafos"
-, title =	"On gallery watchmen in grids"
-, journal =	"Inform. Process. Lett."
-, volume =	23
-, number =	2
-, month =	aug
-, year =	1986
-, pages =	"99--102"
-, update =	"98.03 mitchell"
+, author =      "Simeon Ntafos"
+, title =       "On gallery watchmen in grids"
+, journal =     "Inform. Process. Lett."
+, volume =      23
+, number =      2
+, month =       aug
+, year =        1986
+, pages =       "99--102"
+, update =      "98.03 mitchell"
 }
 
 @techreport{n-rrp-88
-, author =	"S. Ntafos"
-, title =	"The Robber Route Problem"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Texas"
-, address =	"Dallas, TX"
-, year =	1988
-, keywords =	"visibility"
-, precedes =	"n-rrp-90"
-, update =	"98.03 mitchell"
+, author =      "S. Ntafos"
+, title =       "The Robber Route Problem"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Texas"
+, address =     "Dallas, TX"
+, year =        1988
+, keywords =    "visibility"
+, precedes =    "n-rrp-90"
+, update =      "98.03 mitchell"
 }
 
 @article{n-rrp-90
-, author =	"Simeon Ntafos"
-, title =	"The Robber Route Problem"
-, journal =	"Inform. Process. Lett."
-, volume =	34
-, number =	2
-, month =	mar
-, year =	1990
-, pages =	"59--63"
-, keywords =	"watchman route, visibility, concealment, TSP"
-, succeeds =	"n-rrp-88"
-, update =	"98.03 mitchell"
+, author =      "Simeon Ntafos"
+, title =       "The Robber Route Problem"
+, journal =     "Inform. Process. Lett."
+, volume =      34
+, number =      2
+, month =       mar
+, year =        1990
+, pages =       "59--63"
+, keywords =    "watchman route, visibility, concealment, TSP"
+, succeeds =    "n-rrp-88"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{n-wrlv-90
-, author =	"S. Ntafos"
-, title =	"Watchman routes under limited visibility"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"89--92"
-, precedes =	"n-wrlv-92"
-, cites =	"cn-owr-88, cn-wrsp-91, cn-ozr-87, hch-rfomr-86, ips-hpgg-82, j-nccog-82, o-agta-87, p-etspi-77, r-pc-64, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. Ntafos"
+, title =       "Watchman routes under limited visibility"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "89--92"
+, precedes =    "n-wrlv-92"
+, cites =       "cn-owr-88, cn-wrsp-91, cn-ozr-87, hch-rfomr-86, ips-hpgg-82, j-nccog-82, o-agta-87, p-etspi-77, r-pc-64, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{n-wrlv-92
-, author =	"S. Ntafos"
-, title =	"Watchman routes under limited visibility"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, number =	3
-, year =	1992
-, pages =	"149--170"
-, succeeds =	"n-wrlv-90"
+, author =      "S. Ntafos"
+, title =       "Watchman routes under limited visibility"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, number =      3
+, year =        1992
+, pages =       "149--170"
+, succeeds =    "n-wrlv-90"
 }
 
 @techreport{ng-ewr-89
-, author =	"S. Ntafos and L. Gewali"
-, title =	"External Watchman Routes"
-, type =	"Technical {Report}"
-, institution =	"Computer Science, University of Texas at Dallas"
-, year =	1989
-, update =	"93.09 milone+mitchell"
+, author =      "S. Ntafos and L. Gewali"
+, title =       "External Watchman Routes"
+, type =        "Technical {Report}"
+, institution = "Computer Science, University of Texas at Dallas"
+, year =        1989
+, update =      "93.09 milone+mitchell"
 }
 
 @article{ng-ewr-94
-, author =	"S. Ntafos and L. Gewali"
-, title =	"External watchman routes"
-, journal =	"Visual Comput."
-, volume =	10
-, year =	1994
-, pages =	"474--483"
-, update =	"95.01 smid"
+, author =      "S. Ntafos and L. Gewali"
+, title =       "External watchman routes"
+, journal =     "Visual Comput."
+, volume =      10
+, year =        1994
+, pages =       "474--483"
+, update =      "95.01 smid"
 }
 
 @unpublished{nt-opg
-, author =	"S. Ntafos and M. Tsoukalas"
-, title =	"Optimum placement of guards"
-, note =	"to appear in Information Science"
-, succeeds =	"nt-opg-91"
-, update =	"98.11 bibrelex"
+, author =      "S. Ntafos and M. Tsoukalas"
+, title =       "Optimum placement of guards"
+, note =        "to appear in Information Science"
+, succeeds =    "nt-opg-91"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{nt-opg-91
-, author =	"S. Ntafos and M. Tsoukalas"
-, title =	"Optimum placement of guards"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"122--125"
-, precedes =	"nt-opg"
-, cites =	"a-agpiv-84, c-tsplt-90i, ea-lacvp-81, ll-ccagp-86, gj-cigtn-79, o-agta-87, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "S. Ntafos and M. Tsoukalas"
+, title =       "Optimum placement of guards"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "122--125"
+, precedes =    "nt-opg"
+, cites =       "a-agpiv-84, c-tsplt-90i, ea-lacvp-81, ll-ccagp-86, gj-cigtn-79, o-agta-87, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @phdthesis{n-rtsgp-98
-, author =	"St{\'e}phane Nullans"
-, title =	"Reconstruction tridimensionnelle de structures g{\'e}ologiques {\`a} partir de donn{\'e}es h{\'e}t{\'e}rog{\`e}nes"
-, type =	"Th\`{e}se de doctorat en sciences"
-, school =	"Universit\'e de Nice-Sophia Antipolis"
-, address =	"France"
-, year =	1998
-, note =	"TU-0606"
-, keywords =	"doctoral thesis"
-, update =	"00.03 devillers"
+, author =      "St{\'e}phane Nullans"
+, title =       "Reconstruction tridimensionnelle de structures g{\'e}ologiques {\`a} partir de donn{\'e}es h{\'e}t{\'e}rog{\`e}nes"
+, type =        "Th\`{e}se de doctorat en sciences"
+, school =      "Universit\'e de Nice-Sophia Antipolis"
+, address =     "France"
+, year =        1998
+, note =        "TU-0606"
+, keywords =    "doctoral thesis"
+, update =      "00.03 devillers"
 }
 
 @inproceedings{nt-scs-90
-, author =	"K. Numata and T. Tokuyama"
-, title =	"Splitting a configuration in a simplex"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"429--438"
+, author =      "K. Numata and T. Tokuyama"
+, title =       "Splitting a configuration in a simplex"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "429--438"
 }
 
 @inproceedings{nt-cledv-90
-, author =	"J. Nummenmaa and J. Tuomi"
-, title =	"Constructing Layouts for {ER}-Diagrams from Visibility Representations"
-, booktitle =	"Proc. 9th Internat. Conf. on Entity-Relationship Approach"
-, year =	1990
-, pages =	"303--317"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Nummenmaa and J. Tuomi"
+, title =       "Constructing Layouts for {ER}-Diagrams from Visibility Representations"
+, booktitle =   "Proc. 9th Internat. Conf. on Entity-Relationship Approach"
+, year =        1990
+, pages =       "303--317"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{n-flsah-85
-, author =	"O. Nurmi"
-, title =	"A fast line-sweep algorithm for hidden line elimination"
-, journal =	"BIT"
-, volume =	25
-, year =	1985
-, pages =	"466--472"
+, author =      "O. Nurmi"
+, title =       "A fast line-sweep algorithm for hidden line elimination"
+, journal =     "BIT"
+, volume =      25
+, year =        1985
+, pages =       "466--472"
 }
 
 @techreport{n-tsott-84
-, author =	"O. Nurmi"
-, title =	"On translating a set of objects in two- and three-dimensional spaces"
-, type =	"Report"
-, number =	"Bericht 141"
-, institution =	"Inst. Angew., Univ. Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1984
-, precedes =	"n-tsott-86"
+, author =      "O. Nurmi"
+, title =       "On translating a set of objects in two- and three-dimensional spaces"
+, type =        "Report"
+, number =      "Bericht 141"
+, institution = "Inst. Angew., Univ. Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1984
+, precedes =    "n-tsott-86"
 }
 
 @article{n-tsott-86
-, author =	"O. Nurmi"
-, title =	"On translating a set of objects in two- and three-dimensional spaces"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	36
-, year =	1986
-, pages =	"42--52"
-, succeeds =	"n-tsott-84"
+, author =      "O. Nurmi"
+, title =       "On translating a set of objects in two- and three-dimensional spaces"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      36
+, year =        1986
+, pages =       "42--52"
+, succeeds =    "n-tsott-84"
 }
 
 @inproceedings{ns-spots-89
-, author =	"O. Nurmi and J.-R. Sack"
-, title =	"Separating a polyhedron by one translation from a set of obstacles"
-, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '88"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	344
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"202--212"
-, keywords =	"separation"
-, update =	"98.07 smid"
+, author =      "O. Nurmi and J.-R. Sack"
+, title =       "Separating a polyhedron by one translation from a set of obstacles"
+, booktitle =   "Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '88"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      344
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "202--212"
+, keywords =    "separation"
+, update =      "98.07 smid"
 }
 
 @book{n-asf-89
-, author =	"G. Nurnberger"
-, title =	"Approximation by sine functions"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "G. Nurnberger"
+, title =       "Approximation by sine functions"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @mastersthesis{n-dsttd-88
-, author =	"D. Nussbaum"
-, title =	"Directional separability in two and three dimensional space"
-, type =	"M.{Sc}. Thesis"
-, school =	"School Comput. Sci., Carleton Univ."
-, address =	"Ottawa, ON"
-, year =	1988
-, keywords =	"master thesis, separation"
+, author =      "D. Nussbaum"
+, title =       "Directional separability in two and three dimensional space"
+, type =        "M.{Sc}. Thesis"
+, school =      "School Comput. Sci., Carleton Univ."
+, address =     "Ottawa, ON"
+, year =        1988
+, keywords =    "master thesis, separation"
 }
 
 @inproceedings{n-rppp-97
-, author =	"D. Nussbaum"
-, title =	"Rectilinear $p$-piercing problems"
-, booktitle =	"Proceedings of the Annual International Symposium on Symbolic and Algebraic Computation"
-, nickname =	"ISSAC '97"
-, year =	1997
-, pages =	"316--323"
-, update =	"98.11 smid, 98.07 agarwal"
+, author =      "D. Nussbaum"
+, title =       "Rectilinear $p$-piercing problems"
+, booktitle =   "Proceedings of the Annual International Symposium on Symbolic and Algebraic Computation"
+, nickname =    "ISSAC '97"
+, year =        1997
+, pages =       "316--323"
+, update =      "98.11 smid, 98.07 agarwal"
 }
 
 @inproceedings{ns-dtdcp-89
-, author =	"D. Nussbaum and J.-R. Sack"
-, title =	"Disassembling two-dimensional composite parts via translations"
-, booktitle =	"Proc. Optimal Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	401
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"153--167"
-, precedes =	"ns-dtdcp-93"
-, update =	"96.09 devillers"
+, author =      "D. Nussbaum and J.-R. Sack"
+, title =       "Disassembling two-dimensional composite parts via translations"
+, booktitle =   "Proc. Optimal Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      401
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "153--167"
+, precedes =    "ns-dtdcp-93"
+, update =      "96.09 devillers"
 }
 
 @article{ns-dtdcp-93
-, author =	"D. Nussbaum and J.-R. Sack"
-, title =	"Disassembling two-dimensional composite parts via translations"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"71--84"
-, keywords =	"computational geometry, translation motion, upper-bounds, lower-bounds"
-, succeeds =	"ns-dtdcp-89"
-, update =	"96.09 devillers"
+, author =      "D. Nussbaum and J.-R. Sack"
+, title =       "Disassembling two-dimensional composite parts via translations"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "71--84"
+, keywords =    "computational geometry, translation motion, upper-bounds, lower-bounds"
+, succeeds =    "ns-dtdcp-89"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{ns-tsp-89
-, author =	"D. Nussbaum and J.-R. Sack"
-, title =	"Translation separability of polyhedra"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	34
+, author =      "D. Nussbaum and J.-R. Sack"
+, title =       "Translation separability of polyhedra"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       34
 }
 
 @techreport{nw-edmbm-90
-, author =	"R. Nussinov and H. J. Wolfson"
-, title =	"Efficient Detection of Motifs in biological Macromolecules by computer Vision Techniques"
-, number =	"166/90"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "R. Nussinov and H. J. Wolfson"
+, title =       "Efficient Detection of Motifs in biological Macromolecules by computer Vision Techniques"
+, number =      "166/90"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @book{o-iqgmm-92
-, author =	"L. O'Brian"
-, title =	"Introducing Quantitative Geography: measurement, methods and generalised linear models"
-, publisher =	"Routledge"
-, address =	"London"
-, year =	1992
-, update =	"96.09 kreveld"
+, author =      "L. O'Brian"
+, title =       "Introducing Quantitative Geography: measurement, methods and generalised linear models"
+, publisher =   "Routledge"
+, address =     "London"
+, year =        1992
+, update =      "96.09 kreveld"
 }
 
 @article{o-adnnp-75
-, author =	"J. F. O'Callaghan"
-, title =	"An alternative definition for near-neighbourhood of a point"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-24"
-, year =	1975
-, pages =	"1121--1125"
+, author =      "J. F. O'Callaghan"
+, title =       "An alternative definition for near-neighbourhood of a point"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-24"
+, year =        1975
+, pages =       "1121--1125"
 }
 
 @article{o-cpbdp-74
-, author =	"J. F. O'Callaghan"
-, title =	"Computing the perceptual boundaries of dot patterns"
-, journal =	"Comput. Graph. Image Process."
-, volume =	3
-, year =	1974
-, pages =	"141--162"
+, author =      "J. F. O'Callaghan"
+, title =       "Computing the perceptual boundaries of dot patterns"
+, journal =     "Comput. Graph. Image Process."
+, volume =      3
+, year =        1974
+, pages =       "141--162"
 }
 
 @article{o-hphdp-74
-, author =	"J. F. O'Callaghan"
-, title =	"Human perception of homogeneous dot patterns"
-, journal =	"Perception"
-, volume =	3
-, year =	1974
-, pages =	"33--45"
+, author =      "J. F. O'Callaghan"
+, title =       "Human perception of homogeneous dot patterns"
+, journal =     "Perception"
+, volume =      3
+, year =        1974
+, pages =       "33--45"
 }
 
 @article{ohg-riitf-85
-, author =	"E. Ochoa and L. Hesselink and J. Goodman"
-, title =	"Real-time intensity inversion using two-wave and four-wave mixing in photorefractive {$Bi_{12}SiO_{20}$}"
-, journal =	"Applied Optics"
-, volume =	24
-, number =	12
-, year =	1985
-, pages =	"1826--1832"
-, update =	"98.11 bibrelex"
+, author =      "E. Ochoa and L. Hesselink and J. Goodman"
+, title =       "Real-time intensity inversion using two-wave and four-wave mixing in photorefractive {$Bi_{12}SiO_{20}$}"
+, journal =     "Applied Optics"
+, volume =      24
+, number =      12
+, year =        1985
+, pages =       "1826--1832"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{oss-picpu-87
-, author =	"S. Ocken and J. T. Schwartz and Micha Sharir"
-, title =	"Precise implementation of {CAD} primitives using rational parameterization of standard surfaces"
-, editor =	"J. Hopcroft and J. Schwartz and Micha Sharir"
-, booktitle =	"Planning, Geometry, and Complexity of Robot Motion"
-, publisher =	"Ablex Publishing"
-, address =	"Norwood, NJ"
-, year =	1987
-, pages =	"245--266"
-, keywords =	"CAD, rational parameterization, quadric surfaces, intersection"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "S. Ocken and J. T. Schwartz and Micha Sharir"
+, title =       "Precise implementation of {CAD} primitives using rational parameterization of standard surfaces"
+, editor =      "J. Hopcroft and J. Schwartz and Micha Sharir"
+, booktitle =   "Planning, Geometry, and Complexity of Robot Motion"
+, publisher =   "Ablex Publishing"
+, address =     "Norwood, NJ"
+, year =        1987
+, pages =       "245--266"
+, keywords =    "CAD, rational parameterization, quadric surfaces, intersection"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @techreport{og-suvog-86
-, author =	"M. A. O'Connor and G. Gentili"
-, title =	"Simple unit vectors orthogonal to a given vector"
-, type =	"Report"
-, number =	"RC 12263"
-, institution =	"Manufacturing Res. Dept., IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1986
+, author =      "M. A. O'Connor and G. Gentili"
+, title =       "Simple unit vectors orthogonal to a given vector"
+, type =        "Report"
+, number =      "RC 12263"
+, institution = "Manufacturing Res. Dept., IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1986
 }
 
 @techreport{or-sdimp-89t
-, author =	"M. A. O'Connor and J. R. Rossignac"
-, title =	"SCG: {A} dimension independent model for pointsets with internal structures and incomplete boundaries"
-, type =	"Technical {Report}"
-, number =	"RC14340"
-, institution =	"IBM"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "M. A. O'Connor and J. R. Rossignac"
+, title =       "SCG: {A} dimension independent model for pointsets with internal structures and incomplete boundaries"
+, type =        "Technical {Report}"
+, number =      "RC14340"
+, institution = "IBM"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @book{or-imtfe-76
-, author =	"J. T. Oden and J. N. Reddy"
-, title =	"An Introduction to the Mathematical Theory of Finite Elements"
-, publisher =	"John Wiley \& Sons"
-, year =	1976
-, update =	"98.03 bibrelex"
+, author =      "J. T. Oden and J. N. Reddy"
+, title =       "An Introduction to the Mathematical Theory of Finite Elements"
+, publisher =   "John Wiley \& Sons"
+, year =        1976
+, update =      "98.03 bibrelex"
 }
 
-% ?  title =	"... $3.6n-3.4$ edges ..."
+% ?  title =    "... $3.6n-3.4$ edges ..."
 @techreport{op-eggnv-91
-, author =	"P. O'Donnel and M. Perles"
-, title =	"Every geometric graph with $n$ vertices and $3.6n + 3.4$ edges contains $3$ pairwise disjoint edges"
-, type =	"Manuscript"
-, institution =	"Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "P. O'Donnel and M. Perles"
+, title =       "Every geometric graph with $n$ vertices and $3.6n + 3.4$ edges contains $3$ pairwise disjoint edges"
+, type =        "Manuscript"
+, institution = "Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @article{o-tlbcp-88
-, author =	"C. {\'O}'D{\'u}nlaing"
-, title =	"A tight lower bound for the complexity of path-planning for a disc"
-, journal =	"Inform. Process. Lett."
-, volume =	28
-, year =	1988
-, pages =	"165--170"
+, author =      "C. {\'O}'D{\'u}nlaing"
+, title =       "A tight lower bound for the complexity of path-planning for a disc"
+, journal =     "Inform. Process. Lett."
+, volume =      28
+, year =        1988
+, pages =       "165--170"
 }
 
 @techreport{o-mpic-86
-, author =	"C. {\'O}'D{\'u}nlaing"
-, title =	"Motion Planning with Inertial Constraints"
-, number =	"TR 230"
-, institution =	"Robotics Lab., New York Univ."
-, address =	"New York, NY"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "C. {\'O}'D{\'u}nlaing"
+, title =       "Motion Planning with Inertial Constraints"
+, number =      "TR 230"
+, institution = "Robotics Lab., New York Univ."
+, address =     "New York, NY"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @article{o-mpic-87
-, author =	"C. {\'O}'D{\'u}nlaing"
-, title =	"Motion-planning with inertial constraints"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"431--475"
+, author =      "C. {\'O}'D{\'u}nlaing"
+, title =       "Motion-planning with inertial constraints"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "431--475"
 }
 
 @article{osy-gvdl-86
-, author =	"C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
-, title =	"Generalized {Voronoi} diagrams for a ladder: {I}. {Topological} analysis"
-, journal =	"Commun. Pure Appl. Math."
-, volume =	39
-, year =	1986
-, pages =	"423--483"
-, keywords =	"Voronoi diagrams, motion planning"
-, update =	"98.03 mitchell, 96.01 aronov"
+, author =      "C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
+, title =       "Generalized {Voronoi} diagrams for a ladder: {I}. {Topological} analysis"
+, journal =     "Commun. Pure Appl. Math."
+, volume =      39
+, year =        1986
+, pages =       "423--483"
+, keywords =    "Voronoi diagrams, motion planning"
+, update =      "98.03 mitchell, 96.01 aronov"
 }
 
 @techreport{osy-gvdl1-84
-, author =	"C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
-, title =	"Generalized {Voronoi} diagrams for a ladder: {I}. {Topological} considerations"
-, type =	"Technical {Report}"
-, institution =	"Dept. Comput. Sci., Courant Inst."
-, address =	"New York, NY"
-, year =	1984
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
+, title =       "Generalized {Voronoi} diagrams for a ladder: {I}. {Topological} considerations"
+, type =        "Technical {Report}"
+, institution = "Dept. Comput. Sci., Courant Inst."
+, address =     "New York, NY"
+, year =        1984
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{osy-gvdl2-84
-, author =	"C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
-, title =	"Generalized {Voronoi} diagrams for a ladder: {II}. {Efficient} construction of the diagram"
-, type =	"Technical {Report}"
-, institution =	"Dept. Comput. Sci., Courant Inst."
-, address =	"New York, NY"
-, month =	oct
-, year =	1984
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
+, title =       "Generalized {Voronoi} diagrams for a ladder: {II}. {Efficient} construction of the diagram"
+, type =        "Technical {Report}"
+, institution = "Dept. Comput. Sci., Courant Inst."
+, address =     "New York, NY"
+, month =       oct
+, year =        1984
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{osy-gvdl-87
-, author =	"C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
-, title =	"Generalized {Voronoi} diagrams for a ladder: {II}. {Efficient} construction of the diagram"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"27--59"
-, keywords =	"Voronoi diagrams, Davenport-Schinzel sequences, motion planning"
-, update =	"98.03 mitchell, 96.01 aronov"
+, author =      "C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
+, title =       "Generalized {Voronoi} diagrams for a ladder: {II}. {Efficient} construction of the diagram"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "27--59"
+, keywords =    "Voronoi diagrams, Davenport-Schinzel sequences, motion planning"
+, update =      "98.03 mitchell, 96.01 aronov"
 }
 
 @inproceedings{osy-rnamp-83
-, author =	"C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
-, title =	"Retraction: {A} new approach to motion-planning"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
-, year =	1983
-, pages =	"207--220"
-, comments =	"Split into three journal papers: \cite{oy-rmpmd-85},
-		 \cite{osy-gvdl-87}, and \cite{osy-gvdl-86}"
-, precedes =	"oy-rmpmd-85"
-, update =	"98.03 mitchell, 96.05 agarwal"
+, author =      "C. {\'O}'D{\'u}nlaing and Micha Sharir and C. K. Yap"
+, title =       "Retraction: {A} new approach to motion-planning"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Theory Comput."
+, year =        1983
+, pages =       "207--220"
+, comments =    "Split into three journal papers: \cite{oy-rmpmd-85},
+                 \cite{osy-gvdl-87}, and \cite{osy-gvdl-86}"
+, precedes =    "oy-rmpmd-85"
+, update =      "98.03 mitchell, 96.05 agarwal"
 }
 
 @inproceedings{ow-mta-92
-, author =	"Colm {\'O}'D{\'u}nlaing and Colum Watt"
-, title =	"Miscellaneous Topological Algorithms"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"65--66"
-, update =	"00.03 bibrelex"
+, author =      "Colm {\'O}'D{\'u}nlaing and Colum Watt"
+, title =       "Miscellaneous Topological Algorithms"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "65--66"
+, update =      "00.03 bibrelex"
 }
 
 @article{oww-h2ceg-00
-, author =	"C. {\'O}'D{\'u}nlaing and C. Watt and D. Wilkins"
-, title =	"Homeomorphism of 2-complexes is equivalent to grap isomorphism"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, year =	2000
-, pages =	"453--476"
-, update =	"01.04 smid"
+, author =      "C. {\'O}'D{\'u}nlaing and C. Watt and D. Wilkins"
+, title =       "Homeomorphism of 2-complexes is equivalent to grap isomorphism"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, year =        2000
+, pages =       "453--476"
+, update =      "01.04 smid"
 }
 
 @article{oy-rmpmd-85
-, author =	"C. {\'O}'D{\'u}nlaing and C. K. Yap"
-, title =	"A ``retraction'' method for planning the motion of a disk"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	"104--111"
-, succeeds =	"osy-rnamp-83"
+, author =      "C. {\'O}'D{\'u}nlaing and C. K. Yap"
+, title =       "A ``retraction'' method for planning the motion of a disk"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "104--111"
+, succeeds =    "osy-rnamp-83"
 }
 
 @techreport{oy-vmmp1-83
-, author =	"C. {\'O}'D{\'u}nlaing and C. K. Yap"
-, title =	"The {Voronoi} method for motion-planning: {I}. the case of a disc"
-, type =	"Report"
-, number =	53
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1983
+, author =      "C. {\'O}'D{\'u}nlaing and C. K. Yap"
+, title =       "The {Voronoi} method for motion-planning: {I}. the case of a disc"
+, type =        "Report"
+, number =      53
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1983
 }
 
 @book{o-eig-69
-, author =	"C. Stanley Ogilvy"
-, title =	"Excursions in Geometry"
-, publisher =	"Dover Publications"
-, year =	1969
-, location =	"New York"
-, update =	"02.03 orourke"
+, author =      "C. Stanley Ogilvy"
+, title =       "Excursions in Geometry"
+, publisher =   "Dover Publications"
+, year =        1969
+, location =    "New York"
+, update =      "02.03 orourke"
 }
 
 @article{os-wftcb-85
-, author =	"L. O'Gorman and A. C. Sanderson"
-, title =	"The wedge filter technique for convex boundary estimation"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-7"
-, year =	1985
-, pages =	"326--332"
+, author =      "L. O'Gorman and A. C. Sanderson"
+, title =       "The wedge filter technique for convex boundary estimation"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-7"
+, year =        1985
+, pages =       "326--332"
 }
 
 @incollection{o-flaed-94
-, author =	"Yoshikazu Ohashi"
-, title =	"Fast Linear Approximations of {Euclidean} Distance in Higher Dimensions"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"120--124"
-, keywords =	"integer arithmetic, square root"
-, update =	"94.09 heckbert"
-, annote =	"Provides optimized formulas for approximating Euclidean
+, author =      "Yoshikazu Ohashi"
+, title =       "Fast Linear Approximations of {Euclidean} Distance in Higher Dimensions"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "120--124"
+, keywords =    "integer arithmetic, square root"
+, update =      "94.09 heckbert"
+, annote =      "Provides optimized formulas for approximating Euclidean
 distance in two or more dimensions without square roots. Contains C code."
 }
 
 @techreport{o-otrta-85
-, author =	"M. Ohta"
-, title =	"An optimal-time ray tracing algorithm based on direction index"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Inform. Sci., Univ. Tokyo"
-, address =	"Tokyo, Japan"
-, year =	1985
+, author =      "M. Ohta"
+, title =       "An optimal-time ray tracing algorithm based on direction index"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Inform. Sci., Univ. Tokyo"
+, address =     "Tokyo, Japan"
+, year =        1985
 }
 
 @inproceedings{o-mdrp-82
-, author =	"T. Ohtsuki"
-, title =	"Minimum Dissection of Rectilinear Polygons"
-, booktitle =	"Proc. IEEE Symp. on Circuits and Systems"
-, year =	1982
-, pages =	"1210--1213"
-, update =	"98.07 bibrelex"
+, author =      "T. Ohtsuki"
+, title =       "Minimum Dissection of Rectilinear Polygons"
+, booktitle =   "Proc. IEEE Symp. on Circuits and Systems"
+, year =        1982
+, pages =       "1210--1213"
+, update =      "98.07 bibrelex"
 }
 
 @article{o-mdrr-83
-, author =	"T. Ohtsuki"
-, title =	"Minimum dissection of rectilinear regions"
-, journal =	"Trans. Inform. Processing Soc. Japan"
-, volume =	"??"
-, year =	1983
-, pages =	"1210--1213"
-, update =	"98.03 bibrelex"
+, author =      "T. Ohtsuki"
+, title =       "Minimum dissection of rectilinear regions"
+, journal =     "Trans. Inform. Processing Soc. Japan"
+, volume =      "??"
+, year =        1983
+, pages =       "1210--1213"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{osk-cgawr-??
-, author =	"T. Ohtsuki and M. Sato and I. Kojima"
-, title =	"Computational geometry approach to wire routing design"
-, type =	"Manuscript"
-, institution =	"School Sci. Engrg., Waseda Univ."
-, address =	"Tokyo, Japan"
-, year =	"??"
+, author =      "T. Ohtsuki and M. Sato and I. Kojima"
+, title =       "Computational geometry approach to wire routing design"
+, type =        "Manuscript"
+, institution = "School Sci. Engrg., Waseda Univ."
+, address =     "Tokyo, Japan"
+, year =        "??"
 }
 
 @article{ostt-mprr-83
-, author =	"T. Ohtsuki and M. Sato and M. Tachibana and S. Torii"
-, title =	"Minimum partitioning of rectilinear regions"
-, journal =	"Trans. Inform. Processing Soc. Japan"
-, volume =	"??"
-, year =	1983
-, pages =	"??"
+, author =      "T. Ohtsuki and M. Sato and M. Tachibana and S. Torii"
+, title =       "Minimum partitioning of rectilinear regions"
+, journal =     "Trans. Inform. Processing Soc. Japan"
+, volume =      "??"
+, year =        1983
+, pages =       "??"
 }
 
 @inproceedings{o-rfvaa-83
-, author =	"T. Ohya"
-, title =	"Robustness of the fast {Voronoi} algorithm against nonuniform distribution of points"
-, booktitle =	"Proc. Spring Conf. Oper. Res. Soc. Japan"
-, volume =	"C-1"
-, year =	1983
-, pages =	"90--91"
+, author =      "T. Ohya"
+, title =       "Robustness of the fast {Voronoi} algorithm against nonuniform distribution of points"
+, booktitle =   "Proc. Spring Conf. Oper. Res. Soc. Japan"
+, volume =      "C-1"
+, year =        1983
+, pages =       "90--91"
 }
 
 @article{oim-fvdaq-84
-, author =	"T. Ohya and M. Iri and K. Murota"
-, title =	"A fast {Voronoi}-diagram algorithm with quaternary tree bucketing"
-, journal =	"Inform. Process. Lett."
-, volume =	18
-, year =	1984
-, pages =	"227--231"
+, author =      "T. Ohya and M. Iri and K. Murota"
+, title =       "A fast {Voronoi}-diagram algorithm with quaternary tree bucketing"
+, journal =     "Inform. Process. Lett."
+, volume =      18
+, year =        1984
+, pages =       "227--231"
 }
 
 @inproceedings{oim-iacvd-82
-, author =	"T. Ohya and M. Iri and K. Murota"
-, title =	"An improved algorithm for constructing the {Voronoi} diagram"
-, booktitle =	"Proc. Fall Conf. Oper. Res. Soc. Japan"
-, volume =	"E-8"
-, year =	1982
-, pages =	"152--153"
+, author =      "T. Ohya and M. Iri and K. Murota"
+, title =       "An improved algorithm for constructing the {Voronoi} diagram"
+, booktitle =   "Proc. Fall Conf. Oper. Res. Soc. Japan"
+, volume =      "E-8"
+, year =        1982
+, pages =       "152--153"
 }
 
 @article{oim-iimvd-84
-, author =	"T. Ohya and M. Iri and K. Murota"
-, title =	"Improvements of the Incremental Method for the {Voronoi} Diagram with Computational Comparison of Various Algorithms"
-, journal =	"J. Oper. Res. Soc. Japan"
-, volume =	27
-, number =	4
-, year =	1984
-, pages =	"306--336"
-, update =	"93.09 held"
+, author =      "T. Ohya and M. Iri and K. Murota"
+, title =       "Improvements of the Incremental Method for the {Voronoi} Diagram with Computational Comparison of Various Algorithms"
+, journal =     "J. Oper. Res. Soc. Japan"
+, volume =      27
+, number =      4
+, year =        1984
+, pages =       "306--336"
+, update =      "93.09 held"
 }
 
 @inproceedings{om-adscv-82
-, author =	"T. Ohya and K. Murota"
-, title =	"Algorithms and data structures for constructing the {Voronoi} diagram"
-, booktitle =	"Proc. Spring Conf. Oper. Res. Soc. Japan"
-, volume =	"2C-3"
-, year =	1982
-, pages =	"185--186"
+, author =      "T. Ohya and K. Murota"
+, title =       "Algorithms and data structures for constructing the {Voronoi} diagram"
+, booktitle =   "Proc. Spring Conf. Oper. Res. Soc. Japan"
+, volume =      "2C-3"
+, year =        1982
+, pages =       "185--186"
 }
 
 @unpublished{os-nrdca
-, author =	"Y. Oishi and K. Sugihara"
-, title =	"Numerically Robust Divide-and-Conquer Algorithm for Constructing {Voronoi} Diagrams"
-, note =	"in Japanese, Transactions of the Information Processing Society of Japan, to appear"
-, update =	"98.07 bibrelex"
+, author =      "Y. Oishi and K. Sugihara"
+, title =       "Numerically Robust Divide-and-Conquer Algorithm for Constructing {Voronoi} Diagrams"
+, note =        "in Japanese, Transactions of the Information Processing Society of Japan, to appear"
+, update =      "98.07 bibrelex"
 }
 
 @article{os-todqa-95
-, author =	"Y. Oishi and K. Sugihara"
-, title =	"Topology Oriented Divide and Conquer Algorithm for {Voronoi} Diagrams"
-, journal =	"Graphical Models and Image Processing"
-, volume =	57
-, number =	4
-, year =	1995
-, pages =	"303--314"
-, keywords =	"robustness, numerical precision"
-, update =	"96.01 tamassia"
+, author =      "Y. Oishi and K. Sugihara"
+, title =       "Topology Oriented Divide and Conquer Algorithm for {Voronoi} Diagrams"
+, journal =     "Graphical Models and Image Processing"
+, volume =      57
+, number =      4
+, year =        1995
+, pages =       "303--314"
+, keywords =    "robustness, numerical precision"
+, update =      "96.01 tamassia"
 }
 
 @techreport{on-rerc-84
-, author =	"H. Oja and Niinimaa"
-, title =	"On Robust Estimation of Regression Coefficients"
-, type =	"Research Report"
-, institution =	"Department of Applied Mathematics and Statistics, University of Oulu"
-, address =	"Finland"
-, year =	1984
-, update =	"98.07 bibrelex"
+, author =      "H. Oja and Niinimaa"
+, title =       "On Robust Estimation of Regression Coefficients"
+, type =        "Research Report"
+, institution = "Department of Applied Mathematics and Statistics, University of Oulu"
+, address =     "Finland"
+, year =        1984
+, update =      "98.07 bibrelex"
 }
 
 % review in Science (21 May 1993), 1170--1173
 @book{obs-stcav-92
-, author =	"Atsuyuki Okabe and Barry Boots and Kokichi Sugihara"
-, title =	"Spatial Tessellations: {C}oncepts and Applications of {Voronoi} Diagrams"
-, publisher =	"John Wiley \& Sons"
-, address =	"Chichester, UK"
-, year =	1992
-, isbn =	"0-471-93430-5"
-, keywords =	"book, Voronoi diagrams, three-dimensional"
-, comments =	"532 pages"
-, update =	"97.07 kuehn, 97.03 schwarzkopf, 96.05 agarwal, 93.09 jones, 93.05 jones"
+, author =      "Atsuyuki Okabe and Barry Boots and Kokichi Sugihara"
+, title =       "Spatial Tessellations: {C}oncepts and Applications of {Voronoi} Diagrams"
+, publisher =   "John Wiley \& Sons"
+, address =     "Chichester, UK"
+, year =        1992
+, isbn =        "0-471-93430-5"
+, keywords =    "book, Voronoi diagrams, three-dimensional"
+, comments =    "532 pages"
+, update =      "97.07 kuehn, 97.03 schwarzkopf, 96.05 agarwal, 93.09 jones, 93.05 jones"
 }
 
 @article{os-lopst-97
-, author =	"A. Okabe and A. Suzuki"
-, title =	"Locational Optimization Problems Solved Through {Voronoi} Diagrams"
-, journal =	"European J. Oper. Res."
-, volume =	98
-, number =	3
-, month =	may
-, year =	1997
-, pages =	"445--456"
-, update =	"97.11 held"
+, author =      "A. Okabe and A. Suzuki"
+, title =       "Locational Optimization Problems Solved Through {Voronoi} Diagrams"
+, journal =     "European J. Oper. Res."
+, volume =      98
+, number =      3
+, month =       may
+, year =        1997
+, pages =       "445--456"
+, update =      "97.11 held"
 }
 
 @article{o-ucp-88
-, author =	"Stephan Olariu"
-, title =	"On the unimodality of convex polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	29
-, number =	6
-, month =	dec
-, year =	1988
-, pages =	"289--292"
-, abstract =	"An open problem proposed by G. T. Toussaint is to find
-		 the smallest value of n such that a convex polygon with
-		 n vertices is not guaranteed to have any unimodal
-		 vertices. Toussaint conjectured that this value is 6.
-		 The purpose of this article is to prove Toussaint's
-		 conjecture."
+, author =      "Stephan Olariu"
+, title =       "On the unimodality of convex polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      29
+, number =      6
+, month =       dec
+, year =        1988
+, pages =       "289--292"
+, abstract =    "An open problem proposed by G. T. Toussaint is to find
+                 the smallest value of n such that a convex polygon with
+                 n vertices is not guaranteed to have any unimodal
+                 vertices. Toussaint conjectured that this value is 6.
+                 The purpose of this article is to prove Toussaint's
+                 conjecture."
 }
 
 @inproceedings{osz-tosam-92
-, author =	"S. Olariu and J. L. Schwing and J. Zhang"
-, title =	"Time-Optimal Sorting and Applications on {$n$}x{$n$} Enhanced Meshes"
-, booktitle =	"Proc. 6th Annu. European Comp. Conf."
-, month =	may
-, year =	1982
-, update =	"98.11 bibrelex"
+, author =      "S. Olariu and J. L. Schwing and J. Zhang"
+, title =       "Time-Optimal Sorting and Applications on {$n$}x{$n$} Enhanced Meshes"
+, booktitle =   "Proc. 6th Annu. European Comp. Conf."
+, month =       may
+, year =        1982
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{osz-topgc-96
-, author =	"S. Olariu and I. Stojmenovic and A. Y. Zomaya"
-, title =	"Time-optimal proximity graph computations on enhanced meshes"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"119--124"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "S. Olariu and I. Stojmenovic and A. Y. Zomaya"
+, title =       "Time-optimal proximity graph computations on enhanced meshes"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "119--124"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @article{otz-cph-88
-, author =	"S. Olariu and S. Toida and M. Zubaer"
-, title =	"On a Conjecture by {Plaisted} and {Hong}"
-, journal =	"J. Algorithms"
-, volume =	9
-, number =	4
-, year =	1988
-, pages =	"597--598"
-, annote =	"Shows that~\cite{ph-hta-87} produces
-		 triangulations $\Omega(\log n)$ from MLT."
+, author =      "S. Olariu and S. Toida and M. Zubaer"
+, title =       "On a Conjecture by {Plaisted} and {Hong}"
+, journal =     "J. Algorithms"
+, volume =      9
+, number =      4
+, year =        1988
+, pages =       "597--598"
+, annote =      "Shows that~\cite{ph-hta-87} produces
+                 triangulations $\Omega(\log n)$ from MLT."
 }
 
 @inproceedings{o-es12o-00
-, author =	"Vladimir Oliker"
-, title =	"Electromagnetic Scattering, {1D/2D} Obstacle Problem, and Discrete Geodesics"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"66--69"
-, update =	"00.03 bibrelex"
+, author =      "Vladimir Oliker"
+, title =       "Electromagnetic Scattering, {1D/2D} Obstacle Problem, and Discrete Geodesics"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "66--69"
+, update =      "00.03 bibrelex"
 }
 
 @article{opc-3drcp-96
-, author =	"J. M. Oliva and M. Perrin and S. Coquillart"
-, title =	"3D Reconstruction of Complex Polyhedral Shapes from Contours Using a Simplified Generalized {Voronoi} Diagram"
-, journal =	"Comput. Graph. Forum"
-, volume =	15
-, number =	3
-, year =	1996
-, pages =	"397--408"
-, update =	"97.11 held"
+, author =      "J. M. Oliva and M. Perrin and S. Coquillart"
+, title =       "3D Reconstruction of Complex Polyhedral Shapes from Contours Using a Simplified Generalized {Voronoi} Diagram"
+, journal =     "Comput. Graph. Forum"
+, volume =      15
+, number =      3
+, year =        1996
+, pages =       "397--408"
+, update =      "97.11 held"
 }
 
 @inproceedings{onm-mfddt-96
-, author =	"Antonio Oliveira and Sara do Nascimento and Sonja A. L. Meerbaum"
-, title =	"Morphing Fields of Directions Defined on Triangulations to Morph Simple Polygons"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"117--119"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Antonio Oliveira and Sara do Nascimento and Sonja A. L. Meerbaum"
+, title =       "Morphing Fields of Directions Defined on Triangulations to Morph Simple Polygons"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "117--119"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{og-cgvnc-85
-, author =	"J. H. Oliver and E. D. Goodman"
-, title =	"Color Graphic Verification of {N}/{C} Milling Programs for Sculptured Surfaces"
-, booktitle =	"10th Annual Automotive Computer Graphics Conference and Exposition"
-, organization =	"Engineering Soceitey of Detroit"
-, month =	dec
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "J. H. Oliver and E. D. Goodman"
+, title =       "Color Graphic Verification of {N}/{C} Milling Programs for Sculptured Surfaces"
+, booktitle =   "10th Annual Automotive Computer Graphics Conference and Exposition"
+, organization =        "Engineering Soceitey of Detroit"
+, month =       dec
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @article{ow-oqei-83
-, author =	"M. A. Oliver and N. E. Wiseman"
-, title =	"Operations on quadtree encoded images"
-, journal =	"Comput. J."
-, volume =	26
-, year =	1983
-, pages =	"83--91"
+, author =      "M. A. Oliver and N. E. Wiseman"
+, title =       "Operations on quadtree encoded images"
+, journal =     "Comput. J."
+, volume =      26
+, year =        1983
+, pages =       "83--91"
 }
 
 @article{ow-oqlri-83
-, author =	"M. A. Oliver and N. E. Wiseman"
-, title =	"Operations on quadtree leaves and related image areas"
-, journal =	"Comput. J."
-, volume =	26
-, year =	1983
-, pages =	"375--380"
+, author =      "M. A. Oliver and N. E. Wiseman"
+, title =       "Operations on quadtree leaves and related image areas"
+, journal =     "Comput. J."
+, volume =      26
+, year =        1983
+, pages =       "375--380"
 }
 
 @article{o-ncbbs-82
-, author =	"H. J. Olivie"
-, title =	"A new class of balanced binary search trees: half-balanced binary search trees"
-, journal =	"RAIRO Informatique Theoretique"
-, volume =	16
-, year =	1982
-, pages =	"51--71"
-, update =	"97.11 bibrelex"
+, author =      "H. J. Olivie"
+, title =       "A new class of balanced binary search trees: half-balanced binary search trees"
+, journal =     "RAIRO Informatique Theoretique"
+, volume =      16
+, year =        1982
+, pages =       "51--71"
+, update =      "97.11 bibrelex"
 }
 
 @article{o-tavc-91
-, author =	"A. A. Oloufa"
-, title =	"Triangulation applications in volume calculation"
-, journal =	"J. Comput. Civil Engrg."
-, volume =	5
-, year =	1991
-, pages =	"103--119"
-, update =	"97.11 bibrelex"
+, author =      "A. A. Oloufa"
+, title =       "Triangulation applications in volume calculation"
+, journal =     "J. Comput. Civil Engrg."
+, volume =      5
+, year =        1991
+, pages =       "103--119"
+, update =      "97.11 bibrelex"
 }
 
 @article{ot-ppvtd-80
-, author =	"E. A. Olszewski and W. J. Thompson"
-, title =	"A program for perceptive views of three-dimensional surfaces"
-, journal =	"Comput. Phys. Comm."
-, volume =	21
-, year =	1980
-, pages =	"185--191"
+, author =      "E. A. Olszewski and W. J. Thompson"
+, title =       "A program for perceptive views of three-dimensional surfaces"
+, journal =     "Comput. Phys. Comm."
+, volume =      21
+, year =        1980
+, pages =       "185--191"
 }
 
 @techreport{o-fgl-88
-, author =	"S. M. Omohundro"
-, title =	"Fundamentals of geometric learning"
-, type =	"Report"
-, number =	"UIUCDCS-R-88-1408"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1988
-, keywords =	"geometric learning, robotics, computer vision, intersection"
+, author =      "S. M. Omohundro"
+, title =       "Fundamentals of geometric learning"
+, type =        "Report"
+, number =      "UIUCDCS-R-88-1408"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1988
+, keywords =    "geometric learning, robotics, computer vision, intersection"
 }
 
 @techreport{o-dtfl-90
-, author =	"Stephen M. Omohundro"
-, title =	"The {Delaunay} triangulation and function learning"
-, type =	"Technical Report"
-, number =	"TR-90-001"
-, institution =	"International Computer Science Institute"
-, address =	"Berkeley, CA"
-, year =	1990
-, update =	"98.11 bibrelex"
+, author =      "Stephen M. Omohundro"
+, title =       "The {Delaunay} triangulation and function learning"
+, type =        "Technical Report"
+, number =      "TR-90-001"
+, institution = "International Computer Science Institute"
+, address =     "Berkeley, CA"
+, year =        1990
+, update =      "98.11 bibrelex"
 }
 
 @article{o-hcnc-71
-, author =	"Patrick E. O'Neil"
-, title =	"Hyperplane Cuts of an $n$-cube"
-, journal =	"Discrete Math."
-, volume =	1
-, year =	1971
-, pages =	"193--195"
-, update =	"94.05 aich"
+, author =      "Patrick E. O'Neil"
+, title =       "Hyperplane Cuts of an $n$-cube"
+, journal =     "Discrete Math."
+, volume =      1
+, year =        1971
+, pages =       "193--195"
+, update =      "94.05 aich"
 }
 
 @inproceedings{o-vdddh-96
-, author =	"K. Onishi"
-, title =	"Voronoi diagram in the $d$-dimensional hyperbolic space"
-, booktitle =	"Proc. Internat. Sympos. on Combinatorics and Applications"
-, site =	"Tianjin, Japan"
-, organization =	"Nankai Univ."
-, year =	1996
-, pages =	"314--324"
-, update =	"98.07 bibrelex"
+, author =      "K. Onishi"
+, title =       "Voronoi diagram in the $d$-dimensional hyperbolic space"
+, booktitle =   "Proc. Internat. Sympos. on Combinatorics and Applications"
+, site =        "Tianjin, Japan"
+, organization =        "Nankai Univ."
+, year =        1996
+, pages =       "314--324"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{oi-vdsps-97
-, author =	"K. Onishi and H. Imai"
-, title =	"Voronoi Diagram in Statistical Parametric Space by Kull\-back-\-Leibler Divergence"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"463--465"
-, cites =	"a-dgms-85, cd-vdbcd-85, ct-eit-91, e-acg-87, hk-mic-94, ot-cvduh-96, o-vdddh-96, ps-cgi-85, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "K. Onishi and H. Imai"
+, title =       "Voronoi Diagram in Statistical Parametric Space by Kull\-back-\-Leibler Divergence"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "463--465"
+, cites =       "a-dgms-85, cd-vdbcd-85, ct-eit-91, e-acg-87, hk-mic-94, ot-cvduh-96, o-vdddh-96, ps-cgi-85, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{ot-cvduh-96
-, author =	"K. Onishi and N. Takayama"
-, title =	"Construction of {Voronoi} diagrams on the upper half-plane"
-, journal =	"IEICE Trans. Fundamentals"
-, volume =	"E79-A"
-, number =	4
-, year =	1996
-, pages =	"533--539"
-, update =	"98.07 bibrelex"
+, author =      "K. Onishi and N. Takayama"
+, title =       "Construction of {Voronoi} diagrams on the upper half-plane"
+, journal =     "IEICE Trans. Fundamentals"
+, volume =      "E79-A"
+, number =      4
+, year =        1996
+, pages =       "533--539"
+, update =      "98.07 bibrelex"
 }
 
 @article{o-gccrp-91
-, author =	"S. Onn"
-, title =	"On the geometry and computational complexity of {Radon} partitions in the integer lattice"
-, journal =	"SIAM J. Discrete Math."
-, volume =	4
-, year =	1991
-, pages =	"436--447"
-, keywords =	"abstract convexity, convexity spaces, geometry of numbers, Radon number, Radon partition, lattice polytopes, integer programming, integer lattice"
-, succeeds =	"o-rnil-90"
+, author =      "S. Onn"
+, title =       "On the geometry and computational complexity of {Radon} partitions in the integer lattice"
+, journal =     "SIAM J. Discrete Math."
+, volume =      4
+, year =        1991
+, pages =       "436--447"
+, keywords =    "abstract convexity, convexity spaces, geometry of numbers, Radon number, Radon partition, lattice polytopes, integer programming, integer lattice"
+, succeeds =    "o-rnil-90"
 }
 
 @inproceedings{o-rnil-90
-, author =	"S. Onn"
-, title =	"On the {Radon} number of the integer lattice"
-, editor =	"Ravi Kannan and W. R. Pulleyblank"
-, booktitle =	"Integer Programmming and Combinatorial Optimization"
-, publisher =	"Univ. Waterloo Press"
-, address =	"Waterloo, ON"
-, year =	1990
-, pages =	"385--396"
-, keywords =	"abstract convexity, convexity spaces, geometry of numbers, Radon number, Radon partition, lattice polytopes, integer programming, integer lattice"
-, precedes =	"o-gccrp-91"
-, update =	"97.03 rote"
+, author =      "S. Onn"
+, title =       "On the {Radon} number of the integer lattice"
+, editor =      "Ravi Kannan and W. R. Pulleyblank"
+, booktitle =   "Integer Programmming and Combinatorial Optimization"
+, publisher =   "Univ. Waterloo Press"
+, address =     "Waterloo, ON"
+, year =        1990
+, pages =       "385--396"
+, keywords =    "abstract convexity, convexity spaces, geometry of numbers, Radon number, Radon partition, lattice polytopes, integer programming, integer lattice"
+, precedes =    "o-gccrp-91"
+, update =      "97.03 rote"
 }
 
 @article{os-qst-94
-, author =	"S. Onn and B. Sturmfels"
-, title =	"A quantitative {Steinitz}' theorem"
-, journal =	"{Beitr\"age} zur Algebra und Geometrie / Contributions to Algebra and Geometry"
-, volume =	35
-, year =	1994
-, pages =	"125--129"
-, keywords =	"graph drawing, 3D, grid, convex"
-, update =	"96.09 tamassia"
+, author =      "S. Onn and B. Sturmfels"
+, title =       "A quantitative {Steinitz}' theorem"
+, journal =     "{Beitr\"age} zur Algebra und Geometrie / Contributions to Algebra and Geometry"
+, volume =      35
+, year =        1994
+, pages =       "125--129"
+, keywords =    "graph drawing, 3D, grid, convex"
+, update =      "96.09 tamassia"
 }
 
 @mastersthesis{o-mcarg-96
-, author =	"T. Ono"
-, title =	"A {Markov} Chain Approach to Random Generation of Triangulation"
-, school =	"Dept. Inform. Sci., Univ. Tokyo"
-, address =	"Tokyo, Japan"
-, year =	1996
-, keywords =	"master thesis"
-, update =	"97.11 bibrelex"
+, author =      "T. Ono"
+, title =       "A {Markov} Chain Approach to Random Generation of Triangulation"
+, school =      "Dept. Inform. Sci., Univ. Tokyo"
+, address =     "Tokyo, Japan"
+, year =        1996
+, keywords =    "master thesis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{o-ewptt-94
-, author =	"T. Ono"
-, title =	"An Eight-Way Perturbation Technique for the Three-Dimensional Convex Hull"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"159--164"
-, cites =	"d-iafch-90, d-i2dch-90, em-sstcd-88, ph-chfsp-77, y-gctsp-88, y-stgd-, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "T. Ono"
+, title =       "An Eight-Way Perturbation Technique for the Three-Dimensional Convex Hull"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "159--164"
+, cites =       "d-iafch-90, d-i2dch-90, em-sstcd-88, ph-chfsp-77, y-gctsp-88, y-stgd-, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{okmhsniiia-pt-96
-, author =	"T. Ono and Y. Kyoda and T. Masada and K. Hayase and T. Shibuya and M. Nakade and M. Inaba and H. Imai and K. Imai and D. Avis"
-, title =	"A package for triangulations"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"V17--V18"
-, cites =	"almp-gsgv-95, af-pachv-92, k-sgmwt-96, mii-ert-96, o-mcarg-96, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "T. Ono and Y. Kyoda and T. Masada and K. Hayase and T. Shibuya and M. Nakade and M. Inaba and H. Imai and K. Imai and D. Avis"
+, title =       "A package for triangulations"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "V17--V18"
+, cites =       "almp-gsgv-95, af-pachv-92, k-sgmwt-96, mii-ert-96, o-mcarg-96, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @mastersthesis{o-nridc-90
-, author =	"Y. Ooishi"
-, title =	"Numerically robust implementation of the divide-and-conquer algorithm for constructing {Voronoi} diagrams"
-, school =	"Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo"
-, address =	"Tokyo, Japan"
-, year =	1990
-, note =	"Bachelor's Thesis in Japanese"
-, keywords =	"master thesis"
-, update =	"98.07 bibrelex"
+, author =      "Y. Ooishi"
+, title =       "Numerically robust implementation of the divide-and-conquer algorithm for constructing {Voronoi} diagrams"
+, school =      "Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo"
+, address =     "Tokyo, Japan"
+, year =        1990
+, note =        "Bachelor's Thesis in Japanese"
+, keywords =    "master thesis"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{o-lassm-85
-, author =	"B. J. Oommen"
-, title =	"A learning automation solution to the stochastic minimum spanning circle problem"
-, type =	"Report"
-, number =	"SCS-TR-81"
-, institution =	"School Comput. Sci., Carleton Univ."
-, address =	"Ottawa, ON"
-, year =	1985
+, author =      "B. J. Oommen"
+, title =       "A learning automation solution to the stochastic minimum spanning circle problem"
+, type =        "Report"
+, number =      "SCS-TR-81"
+, institution = "School Comput. Sci., Carleton Univ."
+, address =     "Ottawa, ON"
+, year =        1985
 }
 
 @techreport{oirk-rnutu-86
-, author =	"B. J. Oommen and S. S. Iyengar and S. V. Rao and R. L. Kashyap"
-, title =	"Robot Navigation in Unknown Terrains Using Learned Visibility Graphs. Part {I}: {T}he Disjoint Convex Obstacle Case"
-, number =	"SCS-TR-86"
-, institution =	"School of Computer Science, Carleton University"
-, month =	feb
-, year =	1986
-, update =	"96.05 agarwal"
+, author =      "B. J. Oommen and S. S. Iyengar and S. V. Rao and R. L. Kashyap"
+, title =       "Robot Navigation in Unknown Terrains Using Learned Visibility Graphs. Part {I}: {T}he Disjoint Convex Obstacle Case"
+, number =      "SCS-TR-86"
+, institution = "School of Computer Science, Carleton University"
+, month =       feb
+, year =        1986
+, update =      "96.05 agarwal"
 }
 
 @techreport{or-pteot-85
-, author =	"B. J. Oommen and I. Reichstein"
-, title =	"On the problem of translating an elliptic object through a workspace of elliptic obstacles"
-, type =	"Report"
-, number =	"SCS-TR-79"
-, institution =	"School Comput. Sci., Carleton Univ."
-, address =	"Ottawa, ON"
-, year =	1985
+, author =      "B. J. Oommen and I. Reichstein"
+, title =       "On the problem of translating an elliptic object through a workspace of elliptic obstacles"
+, type =        "Report"
+, number =      "SCS-TR-79"
+, institution = "School Comput. Sci., Carleton Univ."
+, address =     "Ottawa, ON"
+, year =        1985
 }
 
 @inproceedings{o-rtbmo-94
-, author =	"P. van Oosterom"
-, title =	"An {R}-Tree Based Map-Overlay Algorithm"
-, booktitle =	"Proc. EGIS '94"
-, year =	1994
-, pages =	"318--327"
-, update =	"96.09 kreveld"
+, author =      "P. van Oosterom"
+, title =       "An {R}-Tree Based Map-Overlay Algorithm"
+, booktitle =   "Proc. EGIS '94"
+, year =        1994
+, pages =       "318--327"
+, update =      "96.09 kreveld"
 }
 
 @article{op-csppa-94
-, author =	"K. Opitz and H. Pottmann"
-, title =	"Computing shortest paths on polyhedra: applications in geometric modeling and scientific visualization"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"165--178"
-, keywords =	"shortest paths, scattered data, interpolation, surface approximation, exponential map"
-, update =	"96.09 devillers+orourke"
+, author =      "K. Opitz and H. Pottmann"
+, title =       "Computing shortest paths on polyhedra: applications in geometric modeling and scientific visualization"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "165--178"
+, keywords =    "shortest paths, scattered data, interpolation, surface approximation, exponential map"
+, update =      "96.09 devillers+orourke"
 }
 
 @inproceedings{o-csqpt-90
-, author =	"J. Orenstein"
-, title =	"A comparison of spatial query processing techniques for native and parameter spaces"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1990
-, pages =	"343--352"
-, update =	"97.07 agarwal"
+, author =      "J. Orenstein"
+, title =       "A comparison of spatial query processing techniques for native and parameter spaces"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1990
+, pages =       "343--352"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{om-cdsas-84
-, author =	"J. Orenstein and T. H. Merrett"
-, title =	"A class of data structures for associative searching"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1984
-, pages =	"181--190"
-, update =	"97.07 agarwal"
+, author =      "J. Orenstein and T. H. Merrett"
+, title =       "A class of data structures for associative searching"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1984
+, pages =       "181--190"
+, update =      "97.07 agarwal"
 }
 
 @article{o-mtuas-82
-, author =	"J. A. Orenstein"
-, title =	"Multidimensional tries used for associative searching"
-, journal =	"Inform. Process. Lett."
-, volume =	13
-, year =	1982
-, pages =	"150--157"
+, author =      "J. A. Orenstein"
+, title =       "Multidimensional tries used for associative searching"
+, journal =     "Inform. Process. Lett."
+, volume =      13
+, year =        1982
+, pages =       "150--157"
 }
 
 @incollection{o-at-91
-, author =	"P. Orlik"
-, title =	"Arrangements in topology"
-, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
-, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
-, publisher =	"American Mathematical Society, Association for Computing Machinery"
-, address =	"Providence, RI"
-, year =	1991
-, pages =	"263--272"
-, update =	"99.11 bibrelex, 98.07 agarwal"
+, author =      "P. Orlik"
+, title =       "Arrangements in topology"
+, editor =      "J. E. Goodman and R. Pollack and W. Steiger"
+, booktitle =   "Discrete and Computational Geometry: Papers from the DIMACS Special Year"
+, publisher =   "American Mathematical Society, Association for Computing Machinery"
+, address =     "Providence, RI"
+, year =        1991
+, pages =       "263--272"
+, update =      "99.11 bibrelex, 98.07 agarwal"
 }
 
 @book{o-ia-89
-, author =	"Peter Orlik"
-, title =	"Introduction to Arrangements"
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1989
-, isbn =	"0-8218-0723-4"
-, update =	"96.01 mitchell"
-, annote =	"13.00"
+, author =      "Peter Orlik"
+, title =       "Introduction to Arrangements"
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1989
+, isbn =        "0-8218-0723-4"
+, update =      "96.01 mitchell"
+, annote =      "13.00"
 }
 
 @article{os-ctch-80
-, author =	"Peter Orlik and L. Solomon"
-, title =	"Combinatorics and topology of complements of hyperplanes"
-, journal =	"Invent. Math."
-, volume =	59
-, year =	1980
-, pages =	"77--94"
-, update =	"98.07 agarwal"
+, author =      "Peter Orlik and L. Solomon"
+, title =       "Combinatorics and topology of complements of hyperplanes"
+, journal =     "Invent. Math."
+, volume =      59
+, year =        1980
+, pages =       "77--94"
+, update =      "98.07 agarwal"
 }
 
 @book{ot-ah-91
-, author =	"Peter Orlik and Hiroaki Terao"
-, title =	"Arrangements of Hyperplanes"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	1991
-, update =	"98.07 agarwal"
+, author =      "Peter Orlik and Hiroaki Terao"
+, title =       "Arrangements of Hyperplanes"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        1991
+, update =      "98.07 agarwal"
 }
 
 @article{o-chaps-85
-, author =	"M. Orlowski"
-, title =	"A convex hull algorithm for planar simple polygons"
-, journal =	"Pattern Recogn."
-, volume =	18
-, year =	1985
-, pages =	"361--366"
+, author =      "M. Orlowski"
+, title =       "A convex hull algorithm for planar simple polygons"
+, journal =     "Pattern Recogn."
+, volume =      18
+, year =        1985
+, pages =       "361--366"
 }
 
 @article{o-naler-90
-, author =	"M. Orlowski"
-, title =	"A new algorithm for the largest empty rectangle problem"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"65--73"
-, keywords =	"area"
-, annote =	"$O(n \log n)$ expected time, $O(n)$ space"
+, author =      "M. Orlowski"
+, title =       "A new algorithm for the largest empty rectangle problem"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "65--73"
+, keywords =    "area"
+, annote =      "$O(n \log n)$ expected time, $O(n)$ space"
 }
 
 @article{o-cssch-83
-, author =	"M. Orlowski"
-, title =	"On the conditions for success of {Sklansky}'s convex hull algorithm"
-, journal =	"Pattern Recogn."
-, volume =	16
-, year =	1983
-, pages =	"579--586"
+, author =      "M. Orlowski"
+, title =       "On the conditions for success of {Sklansky}'s convex hull algorithm"
+, journal =     "Pattern Recogn."
+, volume =      16
+, year =        1983
+, pages =       "579--586"
 }
 
 @techreport{o-lbml-85
-, author =	"J. O'Rourke"
-, title =	"A lower bound on moving a ladder"
-, type =	"Report"
-, number =	"JHU/EECS-85/20"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1985
-, keywords =	"motion planning, lower bounds, ladder"
+, author =      "J. O'Rourke"
+, title =       "A lower bound on moving a ladder"
+, type =        "Report"
+, number =      "JHU/EECS-85/20"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1985
+, keywords =    "motion planning, lower bounds, ladder"
 }
 
 @techreport{o-nftvpl-97
-, author =	"J. O'Rourke"
-, title =	"A note on fully-turned vertex $\pi$-lights"
-, type =	"Technical {Report}"
-, number =	056
-, institution =	"Dept. Comput. Sci., Smith College"
-, month =	oct
-, year =	1997
-, keywords =	"art gallery theorems, floodlights"
-, update =	"97.11 orourke"
+, author =      "J. O'Rourke"
+, title =       "A note on fully-turned vertex $\pi$-lights"
+, type =        "Technical {Report}"
+, number =      056
+, institution = "Dept. Comput. Sci., Smith College"
+, month =       oct
+, year =        1997
+, keywords =    "art gallery theorems, floodlights"
+, update =      "97.11 orourke"
 }
 
 @techreport{o-nmccp-82
-, author =	"J. O'Rourke"
-, title =	"A note on minimum convex covers for polygons"
-, type =	"Report"
-, number =	"JHU-EECS 82-3"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1982
+, author =      "J. O'Rourke"
+, title =       "A note on minimum convex covers for polygons"
+, type =        "Report"
+, number =      "JHU-EECS 82-3"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1982
 }
 
 @article{o-6369-81
-, author =	"Joseph O'Rourke"
-, title =	"Advanced Problem 6369"
-, journal =	"Amer. Math. Monthly"
-, volume =	88
-, number =	10
-, year =	1981
-, pages =	769
-, comments =	"The sum of square roots problem"
-, update =	"01.11 orourke"
+, author =      "Joseph O'Rourke"
+, title =       "Advanced Problem 6369"
+, journal =     "Amer. Math. Monthly"
+, volume =      88
+, number =      10
+, year =        1981
+, pages =       769
+, comments =    "The sum of square roots problem"
+, update =      "01.11 orourke"
 }
 
 @article{o-aprag-83
-, author =	"J. O'Rourke"
-, title =	"An alternative proof of the rectilinear art gallery theorem"
-, journal =	"J. Geom."
-, volume =	21
-, year =	1983
-, pages =	"118--130"
-, keywords =	"covering, star-shaped"
+, author =      "J. O'Rourke"
+, title =       "An alternative proof of the rectilinear art gallery theorem"
+, journal =     "J. Geom."
+, volume =      21
+, year =        1983
+, pages =       "118--130"
+, keywords =    "covering, star-shaped"
 }
 
 @inproceedings{o-ecala-01
-, author =	"Joseph O'Rourke"
-, title =	"An Extension of {Cauchy}'s Arm Lemma with Application to Curve Development"
-, booktitle =	"Discrete Comput. Geom."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	2098
-, publisher =	"Springer-Verlag"
-, year =	2001
-, pages =	"280--291"
-, note =	"Papers from the Japan Conf. Discrete Comput. Geom., Tokyo, Nov. 2000"
-, update =	"01.11 orourke, 01.07 orourke"
+, author =      "Joseph O'Rourke"
+, title =       "An Extension of {Cauchy}'s Arm Lemma with Application to Curve Development"
+, booktitle =   "Discrete Comput. Geom."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      2098
+, publisher =   "Springer-Verlag"
+, year =        2001
+, pages =       "280--291"
+, note =        "Papers from the Japan Conf. Discrete Comput. Geom., Tokyo, Nov. 2000"
+, update =      "01.11 orourke, 01.07 orourke"
 }
 
 @article{o-olafs-81
-, author =	"J. O'Rourke"
-, title =	"An on-line algorithm for fitting straight lines between data ranges"
-, journal =	"Commun. ACM"
-, volume =	24
-, year =	1981
-, pages =	"574--578"
-, keywords =	"stabbing"
+, author =      "J. O'Rourke"
+, title =       "An on-line algorithm for fitting straight lines between data ranges"
+, journal =     "Commun. ACM"
+, volume =      24
+, year =        1981
+, pages =       "574--578"
+, keywords =    "stabbing"
 }
 
 @book{o-agta-87
-, author =	"J. O'Rourke"
-, title =	"Art Gallery Theorems and Algorithms"
-, series =	"The International Series of Monographs on Computer Science"
-, publisher =	"Oxford University Press"
-, address =	"New York, NY"
-, year =	1987
-, keywords =	"visibility, decomposition, covering, partition, geometric graphs"
-, update =	"98.11 bibrelex"
+, author =      "J. O'Rourke"
+, title =       "Art Gallery Theorems and Algorithms"
+, series =      "The International Series of Monographs on Computer Science"
+, publisher =   "Oxford University Press"
+, address =     "New York, NY"
+, year =        1987
+, keywords =    "visibility, decomposition, covering, partition, geometric graphs"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{o-avfdd-81
-, author =	"J. O'Rourke"
-, title =	"Automatic visual focusing via a dynamic data structure"
-, booktitle =	"Proc. 1981 Conf. Info. Sciences and Systems"
-, month =	mar
-, year =	1981
-, pages =	"301--106"
-, keywords =	"$k$-d trees, computer vision"
+, author =      "J. O'Rourke"
+, title =       "Automatic visual focusing via a dynamic data structure"
+, booktitle =   "Proc. 1981 Conf. Info. Sciences and Systems"
+, month =       mar
+, year =        1981
+, pages =       "301--106"
+, keywords =    "$k$-d trees, computer vision"
 }
 
 @article{o-cg-88
-, author =	"J. O'Rourke"
-, title =	"Computational geometry"
-, journal =	"Annu. Rev. Comput. Sci."
-, volume =	3
-, year =	1988
-, pages =	"389--411"
-, keywords =	"survey paper, convex hull, Voronoi diagrams, Delaunay triangulations, arrangements, polygons, triangulation, range search, point location, motion planning, Davenport-Schinzel sequences, parallel computation"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry"
+, journal =     "Annu. Rev. Comput. Sci."
+, volume =      3
+, year =        1988
+, pages =       "389--411"
+, keywords =    "survey paper, convex hull, Voronoi diagrams, Delaunay triangulations, arrangements, polygons, triangulation, range search, point location, motion planning, Davenport-Schinzel sequences, parallel computation"
 }
 
 % 1 through 9 use ~ placeholder to sort before 10
 @article{o-cgc1-86
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column ~1"
-, journal =	"SIGACT News"
-, volume =	18
-, number =	1
-, year =	1986
-, pages =	"17--19"
-, note =	"Also in Computer Graphics 20(1986), 232."
-, update =	"93.09 erickson"
-, annote =	"Report on the 2nd ACM Sympos. Comput. Geom."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column ~1"
+, journal =     "SIGACT News"
+, volume =      18
+, number =      1
+, year =        1986
+, pages =       "17--19"
+, note =        "Also in Computer Graphics 20(1986), 232."
+, update =      "93.09 erickson"
+, annote =      "Report on the 2nd ACM Sympos. Comput. Geom."
 }
 
 @article{o-cgc2-87
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column ~2"
-, journal =	"SIGACT News"
-, volume =	18
-, number =	2
-, year =	1987
-, pages =	"10--12"
-, note =	"Also in Computer Graphics 21(1987), 155--157."
-, annote =	"Old and new problems"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column ~2"
+, journal =     "SIGACT News"
+, volume =      18
+, number =      2
+, year =        1987
+, pages =       "10--12"
+, note =        "Also in Computer Graphics 21(1987), 155--157."
+, annote =      "Old and new problems"
 }
 
 @article{o-cgc3-87
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column ~3"
-, journal =	"SIGACT News"
-, volume =	18
-, number =	4
-, year =	1987
-, pages =	"13--15"
-, note =	"Also in Computer Graphics 21(1987), 314--315."
-, annote =	"Old and new problems"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column ~3"
+, journal =     "SIGACT News"
+, volume =      18
+, number =      4
+, year =        1987
+, pages =       "13--15"
+, note =        "Also in Computer Graphics 21(1987), 314--315."
+, annote =      "Old and new problems"
 }
 
 @article{o-cgc4-88
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column ~4"
-, journal =	"SIGACT News"
-, volume =	19
-, number =	2
-, year =	1988
-, pages =	"22--24"
-, note =	"Also in Computer Graphics 22(1988), 111--112."
-, keywords =	"hidden line elimination, Delaunay triangulations, link distance, stabbing"
-, annote =	"Old and new problems"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column ~4"
+, journal =     "SIGACT News"
+, volume =      19
+, number =      2
+, year =        1988
+, pages =       "22--24"
+, note =        "Also in Computer Graphics 22(1988), 111--112."
+, keywords =    "hidden line elimination, Delaunay triangulations, link distance, stabbing"
+, annote =      "Old and new problems"
 }
 
 @article{o-cgc5-88
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column ~5"
-, journal =	"SIGACT News"
-, volume =	19
-, number =	"3--4"
-, year =	1988
-, pages =	"21--26"
-, annote =	"Open problems from the 4th ACM Sympos. Comput. Geom."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column ~5"
+, journal =     "SIGACT News"
+, volume =      19
+, number =      "3--4"
+, year =        1988
+, pages =       "21--26"
+, annote =      "Open problems from the 4th ACM Sympos. Comput. Geom."
 }
 
 @article{o-cgc6-89
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column ~6"
-, journal =	"SIGACT News"
-, volume =	20
-, number =	2
-, year =	1989
-, pages =	"10--12"
-, annote =	"Old and new problems"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column ~6"
+, journal =     "SIGACT News"
+, volume =      20
+, number =      2
+, year =        1989
+, pages =       "10--12"
+, annote =      "Old and new problems"
 }
 
 @article{o-cgc7-89
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column ~7"
-, journal =	"SIGACT News"
-, volume =	20
-, number =	3
-, year =	1989
-, pages =	"25--26"
-, annote =	"Open problems from the 5th ACM Sympos. Comput. Geom."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column ~7"
+, journal =     "SIGACT News"
+, volume =      20
+, number =      3
+, year =        1989
+, pages =       "25--26"
+, annote =      "Open problems from the 5th ACM Sympos. Comput. Geom."
 }
 
 @article{o-cgc8-89
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column ~8"
-, journal =	"SIGACT News"
-, volume =	20
-, number =	4
-, year =	1989
-, pages =	30
-, keywords =	"distance"
-, annote =	"Error corrections"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column ~8"
+, journal =     "SIGACT News"
+, volume =      20
+, number =      4
+, year =        1989
+, pages =       30
+, keywords =    "distance"
+, annote =      "Error corrections"
 }
 
 @article{o-cgc9-90
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column ~9"
-, journal =	"SIGACT News"
-, volume =	21
-, number =	1
-, year =	1990
-, pages =	"18--20"
-, keywords =	"hidden surface elimination, visibility, triangulations, robotics, stabbing, shape"
-, annote =	"Old and new problems"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column ~9"
+, journal =     "SIGACT News"
+, volume =      21
+, number =      1
+, year =        1990
+, pages =       "18--20"
+, keywords =    "hidden surface elimination, visibility, triangulations, robotics, stabbing, shape"
+, annote =      "Old and new problems"
 }
 
 @article{o-cgc10-90
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 10"
-, journal =	"SIGACT News"
-, volume =	21
-, number =	3
-, year =	1990
-, pages =	"22--25"
-, annote =	"Open problems from the 6th ACM Sympos. Comput. Geom."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 10"
+, journal =     "SIGACT News"
+, volume =      21
+, number =      3
+, year =        1990
+, pages =       "22--25"
+, annote =      "Open problems from the 6th ACM Sympos. Comput. Geom."
 }
 
 @article{o-cgc11-91
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 11"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	1
-, year =	1991
-, pages =	"93--98"
-, note =	"Also in SIGACT News 21:4 (1990), 22--25"
-, keywords =	"shape, robotics, motion planning, arrangements, partition"
-, annote =	"Problems, old and new"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 11"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      1
+, year =        1991
+, pages =       "93--98"
+, note =        "Also in SIGACT News 21:4 (1990), 22--25"
+, keywords =    "shape, robotics, motion planning, arrangements, partition"
+, annote =      "Problems, old and new"
 }
 
 @article{o-cgc12-91
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 12"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	2
-, year =	1991
-, pages =	"197--200"
-, note =	"Also in SIGACT News 22:2 (1991), 26--29"
-, keywords =	"Voronoi diagrams, arrangements, visibility, Delaunay triangulations, path planning, shortest paths, separation"
-, annote =	"Seven open problems from various sources"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 12"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      2
+, year =        1991
+, pages =       "197--200"
+, note =        "Also in SIGACT News 22:2 (1991), 26--29"
+, keywords =    "Voronoi diagrams, arrangements, visibility, Delaunay triangulations, path planning, shortest paths, separation"
+, annote =      "Seven open problems from various sources"
 }
 
 @article{o-cgc12-91a
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 12"
-, journal =	"{SIGACT} News"
-, volume =	22
-, number =	2
-, year =	1991
-, pages =	"26--29"
-, update =	"98.11 bibrelex"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 12"
+, journal =     "{SIGACT} News"
+, volume =      22
+, number =      2
+, year =        1991
+, pages =       "26--29"
+, update =      "98.11 bibrelex"
 }
 
 @article{o-cgc13-91
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 13"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	3
-, year =	1991
-, pages =	"341--343"
-, note =	"Also in SIGACT News 22:3 (1991), 13--15"
-, annote =	"Open problems from the 7th ACM Sympos. Comput. Geom."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 13"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      3
+, year =        1991
+, pages =       "341--343"
+, note =        "Also in SIGACT News 22:3 (1991), 13--15"
+, annote =      "Open problems from the 7th ACM Sympos. Comput. Geom."
 }
 
 @article{o-cgc14-91
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 14"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	4
-, year =	1991
-, pages =	"517--522"
-, note =	"Also in SIGACT News 23:1 (1992), 5--9"
-, annote =	"Abstracts of papers from the 3rd Canad. Conf. Comput.
-		 Geom."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 14"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      4
+, year =        1991
+, pages =       "517--522"
+, note =        "Also in SIGACT News 23:1 (1992), 5--9"
+, annote =      "Abstracts of papers from the 3rd Canad. Conf. Comput.
+                 Geom."
 }
 
 @article{o-cgc15-92
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 15"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	2
-, year =	1992
-, pages =	"215--217"
-, note =	"Also in SIGACT News 23:2 (1992)"
-, keywords =	"visibility"
-, annote =	"Art gallery theorems"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 15"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      2
+, year =        1992
+, pages =       "215--217"
+, note =        "Also in SIGACT News 23:2 (1992)"
+, keywords =    "visibility"
+, annote =      "Art gallery theorems"
 }
 
 @article{o-cgc16-92
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 16"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"335--339"
-, note =	"Also in SIGACT News 23:3 (1992)"
-, annote =	"Summary of 8th ACM Sympos. Comput. Geom."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 16"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "335--339"
+, note =        "Also in SIGACT News 23:3 (1992)"
+, annote =      "Summary of 8th ACM Sympos. Comput. Geom."
 }
 
 @article{o-cgc17-92
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 17"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, year =	1992
-, pages =	"443--447"
-, note =	"Also in SIGACT News 23:4 (1992), 2--4"
-, update =	"93.05 orourke"
-, annote =	"Summary of 4th Canad. Conf. Comput. Geom."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 17"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, year =        1992
+, pages =       "443--447"
+, note =        "Also in SIGACT News 23:4 (1992), 2--4"
+, update =      "93.05 orourke"
+, annote =      "Summary of 4th Canad. Conf. Comput. Geom."
 }
 
 @article{o-cgc18-93
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 18"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, number =	1
-, year =	1993
-, pages =	"107--113"
-, note =	"Also in SIGACT News 24:1 (1993), 20--25"
-, update =	"98.11 bibrelex, 93.05 orourke"
-, annote =	"Visibility graphs"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 18"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, number =      1
+, year =        1993
+, pages =       "107--113"
+, note =        "Also in SIGACT News 24:1 (1993), 20--25"
+, update =      "98.11 bibrelex, 93.05 orourke"
+, annote =      "Visibility graphs"
 }
 
 @article{o-cgc18-93a
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 18"
-, journal =	"SIGACT News 24"
-, volume =	24
-, number =	1
-, year =	1993
-, pages =	"20--25"
-, update =	"98.11 bibrelex"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 18"
+, journal =     "SIGACT News 24"
+, volume =      24
+, number =      1
+, year =        1993
+, pages =       "20--25"
+, update =      "98.11 bibrelex"
 }
 
 @article{o-cgc19-93
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 19"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, number =	1
-, year =	1993
-, pages =	"221--224"
-, note =	"Also in SIGACT News 24:2 (1993), 15--17"
-, update =	"98.11 bibrelex, 94.01 orourke"
-, annote =	"Description of computational geometry bibliography"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 19"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, number =      1
+, year =        1993
+, pages =       "221--224"
+, note =        "Also in SIGACT News 24:2 (1993), 15--17"
+, update =      "98.11 bibrelex, 94.01 orourke"
+, annote =      "Description of computational geometry bibliography"
 }
 
 @article{o-cgc20-93
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 20"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"347--349"
-, note =	"Also in SIGACT News 24:3 (1993), 21--22"
-, update =	"94.01 orourke"
-, annote =	"Open problems from the 9th Annu. ACM Sympos. Comput. Geom."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 20"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "347--349"
+, note =        "Also in SIGACT News 24:3 (1993), 21--22"
+, update =      "94.01 orourke"
+, annote =      "Open problems from the 9th Annu. ACM Sympos. Comput. Geom."
 }
 
 @article{o-cgc21-93
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 21"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"463--465"
-, note =	"Also in SIGACT News 24:4 (1993), 14--15"
-, update =	"96.09 devillers, 94.05 devillers+orourke, 94.01 orourke"
-, annote =	"Open problems from the 5th Canad. Conf. Comput. Geom."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 21"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "463--465"
+, note =        "Also in SIGACT News 24:4 (1993), 14--15"
+, update =      "96.09 devillers, 94.05 devillers+orourke, 94.01 orourke"
+, annote =      "Open problems from the 5th Canad. Conf. Comput. Geom."
 }
 
 @article{o-cgc22-94
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 22"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"119--122"
-, note =	"Also in SIGACT News 25:1 (1994), 31--33"
-, update =	"94.09 lambert, 94.05 devillers+orourke"
-, annote =	"$n^2$-hard problems"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 22"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "119--122"
+, note =        "Also in SIGACT News 25:1 (1994), 31--33"
+, update =      "94.09 lambert, 94.05 devillers+orourke"
+, annote =      "$n^2$-hard problems"
 }
 
 @article{o-cgc23-94
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 23"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"239--242"
-, note =	"Also in SIGACT News 25:3 (1994), 24--27"
-, update =	"95.01 orourke"
-, annote =	"Open problems on tetrahedralization"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 23"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "239--242"
+, note =        "Also in SIGACT News 25:3 (1994), 24--27"
+, update =      "95.01 orourke"
+, annote =      "Open problems on tetrahedralization"
 }
 
 @article{o-cgc24-94
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 24"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"363--366"
-, note =	"Also in SIGACT News 25:4 (1994), 12--14"
-, update =	"95.01 orourke"
-, annote =	"Open problems from 10th SoCG and 6th CCCG"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 24"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "363--366"
+, note =        "Also in SIGACT News 25:4 (1994), 12--14"
+, update =      "95.01 orourke"
+, annote =      "Open problems from 10th SoCG and 6th CCCG"
 }
 
 @article{o-cgc25-95
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 25"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"215--218"
-, note =	"Also in SIGACT News 26:1 (1995), 14--16"
-, update =	"95.05 orourke"
-, annote =	"Lower envelope of surfaces: new complexity bounds"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 25"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "215--218"
+, note =        "Also in SIGACT News 26:1 (1995), 14--16"
+, update =      "95.05 orourke"
+, annote =      "Lower envelope of surfaces: new complexity bounds"
 }
 
 @article{o-cgc26-95
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 26"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"339--341"
-, note =	"Also in SIGACT News 26:2 (1995), 15--17"
-, update =	"96.01 orourke, 95.05 orourke"
-, annote =	"An advance on Conway's Thrackle conjecture"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 26"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "339--341"
+, note =        "Also in SIGACT News 26:2 (1995), 15--17"
+, update =      "96.01 orourke, 95.05 orourke"
+, annote =      "An advance on Conway's Thrackle conjecture"
 }
 
 @article{o-cgc27-96
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 27"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"123--125"
-, note =	"Also in SIGACT News 26:4 (1995), 19--21"
-, update =	"96.05 orourke, 96.01 orourke"
-, annote =	"Perfect matching between edges of triangulations"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 27"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "123--125"
+, note =        "Also in SIGACT News 26:4 (1995), 19--21"
+, update =      "96.05 orourke, 96.01 orourke"
+, annote =      "Perfect matching between edges of triangulations"
 }
 
 @article{o-cgc28-96
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 28"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"243--244"
-, note =	"Also in SIGACT News 27:2 (1996) 18--19"
-, update =	"97.03 orourke, 96.09 devillers+orourke"
-, annote =	"Web directory of Computational Geometry Software"
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 28"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "243--244"
+, note =        "Also in SIGACT News 27:2 (1996) 18--19"
+, update =      "97.03 orourke, 96.09 devillers+orourke"
+, annote =      "Web directory of Computational Geometry Software"
 }
 
 @article{o-cgc29-96
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 29"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"507--511"
-, note =	"Also in SIGACT News, 27(3):55--59 (1996), Issue 100"
-, update =	"97.03 agarwal+orourke, 96.09 orourke"
-, annote =	"Past accomplishments of Computational Geometry are reviewed
-		and future directions adumbrated."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 29"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "507--511"
+, note =        "Also in SIGACT News, 27(3):55--59 (1996), Issue 100"
+, update =      "97.03 agarwal+orourke, 96.09 orourke"
+, annote =      "Past accomplishments of Computational Geometry are reviewed
+                and future directions adumbrated."
 }
 
 @article{o-cgc30-97
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 30"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"165--166"
-, note =	"Also in SIGACT News, 28(1):7--8 (1997), Issue 102"
-, update =	"97.07 orourke, 97.03 orourke"
-, annote =	"Several results from {\em Combinatorial Geometry}
-		(J. Pach and P.K. Agarwal) are detailed."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 30"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "165--166"
+, note =        "Also in SIGACT News, 28(1):7--8 (1997), Issue 102"
+, update =      "97.07 orourke, 97.03 orourke"
+, annote =      "Several results from {\em Combinatorial Geometry}
+                (J. Pach and P.K. Agarwal) are detailed."
 }
 
 @article{o-cgc31-97
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 31"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"379--382"
-, note =	"Also in SIGACT News, 28(2):20--23 (1997), Issue 103"
-, keywords =	"packing, spheres"
-, update =	"98.03 orourke, 97.07 orourke"
-, annote =	"Sphere packing work of Neil Sloane et al."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 31"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "379--382"
+, note =        "Also in SIGACT News, 28(2):20--23 (1997), Issue 103"
+, keywords =    "packing, spheres"
+, update =      "98.03 orourke, 97.07 orourke"
+, annote =      "Sphere packing work of Neil Sloane et al."
 }
 
 @article{o-cgc32-97
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 32"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"509--513"
-, note =	"Also in SIGACT News, 28(3):12--17 (1997), Issue 104"
-, keywords =	"k-sets, arrangements"
-, update =	"98.03 orourke"
-, annote =	"Dey's new $k$-set bound is illustrated."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 32"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "509--513"
+, note =        "Also in SIGACT News, 28(3):12--17 (1997), Issue 104"
+, keywords =    "k-sets, arrangements"
+, update =      "98.03 orourke"
+, annote =      "Dey's new $k$-set bound is illustrated."
 }
 
 @article{o-cgc33-98
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 33"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1999
-, pages =	"381--384"
-, note =	"Also in SIGACT News, 29(2):12-16 (1998), Issue 107"
-, update =	"00.03 orourke"
-, annote =	"Two results in ``computational origami'' are illustrated."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 33"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1999
+, pages =       "381--384"
+, note =        "Also in SIGACT News, 29(2):12-16 (1998), Issue 107"
+, update =      "00.03 orourke"
+, annote =      "Two results in ``computational origami'' are illustrated."
 }
 
 @article{ao-cgc34-98
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 34"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	"??"
-, year =	1999
-, pages =	"??--??"
-, note =	"Also in SIGACT News, 29(3):27--32 (1998), Issue 108"
-, update =	"00.03 orourke"
-, annote =	"Problems presented at the open-problem session of the
-		14th Annual ACM Symposium on Computational Geometry are listed."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 34"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      "??"
+, year =        1999
+, pages =       "??--??"
+, note =        "Also in SIGACT News, 29(3):27--32 (1998), Issue 108"
+, update =      "00.03 orourke"
+, annote =      "Problems presented at the open-problem session of the
+                14th Annual ACM Symposium on Computational Geometry are listed."
 }
 
 @article{o-cgc35-99
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 35"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	"??"
-, year =	1999
-, pages =	"??--??"
-, note =	"Also in SIGACT News, 30(2):31-32 (1999), Issue 111"
-, keywords =	"shortest paths"
-, update =	"00.03 orourke"
-, annote =	"The subquadratic algorithm of Kapoor for finding shortest
-		paths on a polyhedron is described."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 35"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      "??"
+, year =        1999
+, pages =       "??--??"
+, note =        "Also in SIGACT News, 30(2):31-32 (1999), Issue 111"
+, keywords =    "shortest paths"
+, update =      "00.03 orourke"
+, annote =      "The subquadratic algorithm of Kapoor for finding shortest
+                paths on a polyhedron is described."
 }
 
 @article{o-cgc36-99
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 36"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, number =	6
-, year =	1999
-, pages =	"615--618"
-, note =	"Also in SIGACT News, 30(3):35--38 (1999), Issue 112"
-, update =	"00.11 smid, 00.07 orourke, 00.03 orourke"
-, annote =	"Two results in ``computational origami'' are illustrated."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 36"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, number =      6
+, year =        1999
+, pages =       "615--618"
+, note =        "Also in SIGACT News, 30(3):35--38 (1999), Issue 112"
+, update =      "00.11 smid, 00.07 orourke, 00.03 orourke"
+, annote =      "Two results in ``computational origami'' are illustrated."
 }
 
 @article{o-cgc38-00
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 38"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, number =	2
-, year =	2000
-, pages =	"221--223"
-, note =	"Also in SIGACT News, 31(1):28--30 (2000), Issue 114"
-, update =	"00.11 smid, 00.07 orourke"
-, annote =	"Recent results on curve reconstruction are described."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 38"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, number =      2
+, year =        2000
+, pages =       "221--223"
+, note =        "Also in SIGACT News, 31(1):28--30 (2000), Issue 114"
+, update =      "00.11 smid, 00.07 orourke"
+, annote =      "Recent results on curve reconstruction are described."
 }
 
 @article{o-cgc39-00
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 39"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, number =	4
-, year =	2000
-, pages =	"441--444"
-, note =	"Also in SIGACT News, 31(3):47--49 (2000), Issue 116"
-, update =	"01.04 orourke+pocchiola"
-, annote =	"The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 39"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, number =      4
+, year =        2000
+, pages =       "441--444"
+, note =        "Also in SIGACT News, 31(3):47--49 (2000), Issue 116"
+, update =      "01.04 orourke+pocchiola"
+, annote =      "The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane."
 }
 
 @article{o-cgc40-00
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 40"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, number =	6
-, year =	2000
-, pages =	"649--651"
-, note =	"Also in SIGACT News, 31(4):62--64 (2000), Issue 117"
-, update =	"01.07 orourke, 01.04 orourke"
-, annote =	"It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 40"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, number =      6
+, year =        2000
+, pages =       "649--651"
+, note =        "Also in SIGACT News, 31(4):62--64 (2000), Issue 117"
+, update =      "01.07 orourke, 01.04 orourke"
+, annote =      "It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a
 small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed."
 }
 
 @article{o-cgc41-01
-, author =	"J. O'Rourke"
-, title =	"Computational geometry column 41"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	"??"
-, number =	"??"
-, year =	2001
-, pages =	"??--??"
-, note =	"Also in SIGACT News,  32(1):53-55 (2001), Issue 118"
-, update =	"01.07 orourke"
-, annote =	"The recent result that $n$ congruent balls in $R^d$
-	have at most 4 distinct geometric permutations is described."
+, author =      "J. O'Rourke"
+, title =       "Computational geometry column 41"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      "??"
+, number =      "??"
+, year =        2001
+, pages =       "??--??"
+, note =        "Also in SIGACT News,  32(1):53-55 (2001), Issue 118"
+, update =      "01.07 orourke"
+, annote =      "The recent result that $n$ congruent balls in $R^d$
+        have at most 4 distinct geometric permutations is described."
 }
 
 @book{o-cgc-94
-, author =	"J. O'Rourke"
-, title =	"Computational Geometry in {C}"
-, edition =	"1st"
-, publisher =	"Cambridge University Press"
-, year =	1994
-, comments =	"ISBN 0-521-44592-2/Pb \$24.95,
-		ISBN 0-521-44034-3/Hc \$49.95.
-		Cambridge University Press,
-		40 West 20th Street,
-		New York, NY 10011-4211,
-		1-800-872-7423.
-		346+xi pages, 228 exercises, 200 figures, 219 references.
-		C code and errata available by anonymous ftp from
-		grendel.csc.smith.edu (131.229.222.23),
-		in the directory /pub/compgeom.
-		Third Printing: Dec. 1995.
-		Chapter titles:
-		1. Polygon triangulation
-		2. Polygon partitioning
-		3. Convex hulls in two dimensions
-		4. Convex hulls in three dimensions
-		5. Voronoi diagrams
-		6. Arrangements
-		7. Search and intersection
-		8. Motion planning
-		9. Additional topics"
-, update =	"99.11 bibrelex, 97.07 orourke, 96.05 efrat, 96.01 orourke, 95.05 orourke, 95.01 orourke, 94.05 orourke, 94.01 orourke, 95.05 orourke"
-, annote =	"Textbook"
+, author =      "J. O'Rourke"
+, title =       "Computational Geometry in {C}"
+, edition =     "1st"
+, publisher =   "Cambridge University Press"
+, year =        1994
+, comments =    "ISBN 0-521-44592-2/Pb \$24.95,
+                ISBN 0-521-44034-3/Hc \$49.95.
+                Cambridge University Press,
+                40 West 20th Street,
+                New York, NY 10011-4211,
+                1-800-872-7423.
+                346+xi pages, 228 exercises, 200 figures, 219 references.
+                C code and errata available by anonymous ftp from
+                grendel.csc.smith.edu (131.229.222.23),
+                in the directory /pub/compgeom.
+                Third Printing: Dec. 1995.
+                Chapter titles:
+                1. Polygon triangulation
+                2. Polygon partitioning
+                3. Convex hulls in two dimensions
+                4. Convex hulls in three dimensions
+                5. Voronoi diagrams
+                6. Arrangements
+                7. Search and intersection
+                8. Motion planning
+                9. Additional topics"
+, update =      "99.11 bibrelex, 97.07 orourke, 96.05 efrat, 96.01 orourke, 95.05 orourke, 95.01 orourke, 94.05 orourke, 94.01 orourke, 95.05 orourke"
+, annote =      "Textbook"
 }
 
 @book{o-cgc-98
-, author =	"J. O'Rourke"
-, title =	"Computational Geometry in {C}"
-, edition =	"2nd"
-, publisher =	"Cambridge University Press"
-, year =	1998
-, url =	"https://www.science.smith.edu/~jorourke/books/compgeom.html"
-, comments =	"Printed 28 Sep 1998"
-, update =	"01.11 orourke, 99.11 bibrelex, 98.11 orourke"
-, annote =	"Textbook"
+, author =      "J. O'Rourke"
+, title =       "Computational Geometry in {C}"
+, edition =     "2nd"
+, publisher =   "Cambridge University Press"
+, year =        1998
+, url = "https://www.science.smith.edu/~jorourke/books/compgeom.html"
+, comments =    "Printed 28 Sep 1998"
+, update =      "01.11 orourke, 99.11 bibrelex, 98.11 orourke"
+, annote =      "Textbook"
 }
 
 @article{o-crngl-82
-, author =	"J. O'Rourke"
-, title =	"Computing the relative neighborhood graph in the {$L_{1}$} and {$L_{\infty}$} metrics"
-, journal =	"Pattern Recogn."
-, volume =	15
-, year =	1982
-, pages =	"189--192"
-, keywords =	"geometric graphs"
+, author =      "J. O'Rourke"
+, title =       "Computing the relative neighborhood graph in the {$L_{1}$} and {$L_{\infty}$} metrics"
+, journal =     "Pattern Recogn."
+, volume =      15
+, year =        1982
+, pages =       "189--192"
+, keywords =    "geometric graphs"
 }
 
 @inproceedings{o-chvdt-84
-, author =	"J. O'Rourke"
-, title =	"Convex hulls, {Voronoi} diagrams, and terrain navigation"
-, booktitle =	"Proc. 9th Pecora Sympos. Spatial Inform. Tech."
-, year =	1984
-, pages =	"358--361"
-, keywords =	"shortest paths"
+, author =      "J. O'Rourke"
+, title =       "Convex hulls, {Voronoi} diagrams, and terrain navigation"
+, booktitle =   "Proc. 9th Pecora Sympos. Spatial Inform. Tech."
+, year =        1984
+, pages =       "358--361"
+, keywords =    "shortest paths"
 }
 
 @article{o-cmca-85
-, author =	"J. O'Rourke"
-, title =	"Counterexamples to a minimal circumscription algorithm"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	30
-, month =	jun
-, year =	1985
-, pages =	"364--366"
-, keywords =	"triangles, area, approximation"
+, author =      "J. O'Rourke"
+, title =       "Counterexamples to a minimal circumscription algorithm"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      30
+, month =       jun
+, year =        1985
+, pages =       "364--366"
+, keywords =    "triangles, area, approximation"
 }
 
 @techreport{o-dqsam-81
-, author =	"J. O'Rourke"
-, title =	"Dynamically quantized spaces applied to motion analysis"
-, type =	"Technical {Report}"
-, number =	"JHU-EE 81-1"
-, institution =	"Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	jan
-, year =	1981
-, keywords =	"$k$-d trees, computer vision"
+, author =      "J. O'Rourke"
+, title =       "Dynamically quantized spaces applied to motion analysis"
+, type =        "Technical {Report}"
+, number =      "JHU-EE 81-1"
+, institution = "Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       jan
+, year =        1981
+, keywords =    "$k$-d trees, computer vision"
 }
 
 @inproceedings{o-dqsfh-81
-, author =	"J. O'Rourke"
-, title =	"Dynamically quantized spaces for focusing the {Hough} transform"
-, booktitle =	"Proc. 7th Internat. Joint Conf. Artif. Intell."
-, year =	1981
-, pages =	"737--739"
-, keywords =	"cluster analysis"
+, author =      "J. O'Rourke"
+, title =       "Dynamically quantized spaces for focusing the {Hough} transform"
+, booktitle =   "Proc. 7th Internat. Joint Conf. Artif. Intell."
+, year =        1981
+, pages =       "737--739"
+, keywords =    "cluster analysis"
 }
 
 @article{o-frca-90
-, author =	"J. O'Rourke"
-, title =	"Feature {Review}: {The} complexity of arrangements"
-, journal =	"ACM Comput. Rev."
-, volume =	31
-, number =	12
-, month =	dec
-, year =	1990
-, pages =	"654--657"
-, keywords =	"arrangements, combinatorial complexity, zones"
+, author =      "J. O'Rourke"
+, title =       "Feature {Review}: {The} complexity of arrangements"
+, journal =     "ACM Comput. Rev."
+, volume =      31
+, number =      12
+, month =       dec
+, year =        1990
+, pages =       "654--657"
+, keywords =    "arrangements, combinatorial complexity, zones"
 }
 
 @techreport{o-fslps-87
-, author =	"J. O'Rourke"
-, title =	"Finding a shortest ladder path: a special case"
-, type =	"{IMA} {Preprint} {Series}"
-, number =	353
-, institution =	"Inst. Math. Appl., Univ. Minnesota"
-, address =	"Minneapolis, MN"
-, year =	1987
-, keywords =	"motion planning, ladder"
+, author =      "J. O'Rourke"
+, title =       "Finding a shortest ladder path: a special case"
+, type =        "{IMA} {Preprint} {Series}"
+, number =      353
+, institution = "Inst. Math. Appl., Univ. Minnesota"
+, address =     "Minneapolis, MN"
+, year =        1987
+, keywords =    "motion planning, ladder"
 }
 
 @techreport{o-fmeb-84
-, author =	"J. O'Rourke"
-, title =	"Finding Minimal Enclosing Boxes"
-, type =	"Technical {Report}"
-, institution =	"Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "J. O'Rourke"
+, title =       "Finding Minimal Enclosing Boxes"
+, type =        "Technical {Report}"
+, institution = "Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{o-fmeb-85
-, author =	"J. O'Rourke"
-, title =	"Finding minimal enclosing boxes"
-, journal =	"Internat. J. Comput. Inform. Sci."
-, volume =	14
-, month =	jun
-, year =	1985
-, pages =	"183--199"
-, keywords =	"approximation, volume"
+, author =      "J. O'Rourke"
+, title =       "Finding minimal enclosing boxes"
+, journal =     "Internat. J. Comput. Inform. Sci."
+, volume =      14
+, month =       jun
+, year =        1985
+, pages =       "183--199"
+, keywords =    "approximation, volume"
 }
 
 @article{o-fmeb-86
-, author =	"Joseph O'Rourke"
-, title =	"Finding Minimal Enclosing Boxes"
-, journal =	"Internat. J. Comput. Info. Sci."
-, volume =	14
-, number =	3
-, month =	feb
-, year =	1986
-, pages =	"183--199"
-, update =	"01.04 orourke"
+, author =      "Joseph O'Rourke"
+, title =       "Finding Minimal Enclosing Boxes"
+, journal =     "Internat. J. Comput. Info. Sci."
+, volume =      14
+, number =      3
+, month =       feb
+, year =        1986
+, pages =       "183--199"
+, update =      "01.04 orourke"
 }
 
 @inproceedings{o-fucg-98
-, author =	"J. O'Rourke"
-, title =	"Folding and Unfolding in Computational Geometry"
-, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '98"
-, site =	"Tokyo"
-, month =	dec
-, year =	1998
-, pages =	"142--147"
-, note =	"Revised version to appear in LNCS"
-, update =	"01.04 orourke, 00.11 smid, 00.07 icking, 00.03 orourke, 99.03 orourke, 98.11 orourke"
+, author =      "J. O'Rourke"
+, title =       "Folding and Unfolding in Computational Geometry"
+, booktitle =   "Proc. Japan Conf. Discrete Comput. Geom. '98"
+, site =        "Tokyo"
+, month =       dec
+, year =        1998
+, pages =       "142--147"
+, note =        "Revised version to appear in LNCS"
+, update =      "01.04 orourke, 00.11 smid, 00.07 icking, 00.03 orourke, 99.03 orourke, 98.11 orourke"
 }
 
 @inproceedings{o-fucg-00
-, author =	"Joseph O'Rourke"
-, title =	"Folding and unfolding in computational geometry"
-, booktitle =	"Discrete Comput. Geom."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1763
-, publisher =	"Springer-Verlag"
-, year =	2000
-, pages =	"258--266"
-, note =	"Papers from the Japan Conf. Discrete Comput. Geom., Tokyo, Dec. 1998"
-, succeeds =	"o-fucg-98"
-, update =	"01.11 orourke, 01.04 icking, 00.11 smid, 00.07 orourke"
+, author =      "Joseph O'Rourke"
+, title =       "Folding and unfolding in computational geometry"
+, booktitle =   "Discrete Comput. Geom."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1763
+, publisher =   "Springer-Verlag"
+, year =        2000
+, pages =       "258--266"
+, note =        "Papers from the Japan Conf. Discrete Comput. Geom., Tokyo, Dec. 1998"
+, succeeds =    "o-fucg-98"
+, update =      "01.11 orourke, 01.04 icking, 00.11 smid, 00.07 orourke"
 }
 
 @article{o-gnfmg-83
-, author =	"J. O'Rourke"
-, title =	"Galleries need fewer mobile guards: a variation on {Chv{\'a}tal}'s theorem"
-, journal =	"Geom. Dedicata"
-, volume =	14
-, year =	1983
-, pages =	"273--283"
-, keywords =	"covering, star-shaped"
+, author =      "J. O'Rourke"
+, title =       "Galleries need fewer mobile guards: a variation on {Chv{\'a}tal}'s theorem"
+, journal =     "Geom. Dedicata"
+, volume =      14
+, year =        1983
+, pages =       "273--283"
+, keywords =    "covering, star-shaped"
 }
 
 @incollection{o-gcs-94
-, author =	"J. O'Rourke"
-, title =	"Guarding corpulent stars"
-, booktitle =	"Snapshots of Computational and Discrete Geometry"
-, volume =	3
-, publisher =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, month =	jul
-, year =	1994
-, pages =	"63--71"
-, note =	"Technical Report SOCS-94.50"
-, keywords =	"visibility, art gallery theorems"
-, comments =	"Also Technical Report 032, Dept. Comput. Sci., Smith College"
-, update =	"96.05 orourke, 96.01 orourke, 94.09 orourke"
-, annote =	"I've been informed of an error by H. Meijer, but haven't worked on it."
+, author =      "J. O'Rourke"
+, title =       "Guarding corpulent stars"
+, booktitle =   "Snapshots of Computational and Discrete Geometry"
+, volume =      3
+, publisher =   "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, month =       jul
+, year =        1994
+, pages =       "63--71"
+, note =        "Technical Report SOCS-94.50"
+, keywords =    "visibility, art gallery theorems"
+, comments =    "Also Technical Report 032, Dept. Comput. Sci., Smith College"
+, update =      "96.05 orourke, 96.01 orourke, 94.09 orourke"
+, annote =      "I've been informed of an error by H. Meijer, but haven't worked on it."
 }
 
 @techreport{o-mccps-82
-, author =	"J. O'Rourke"
-, title =	"Minimum convex cover for polygons: some counterexamples"
-, type =	"Report"
-, number =	"JHU-EE 82-1"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1982
+, author =      "J. O'Rourke"
+, title =       "Minimum convex cover for polygons: some counterexamples"
+, type =        "Report"
+, number =      "JHU-EE 82-1"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1982
 }
 
 @inproceedings{o-mduht-81
-, author =	"J. O'Rourke"
-, title =	"Motion detection using {Hough} techniques"
-, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn. Image Process."
-, year =	1981
-, pages =	"82--87"
-, keywords =	"computer vision, cluster analysis"
+, author =      "J. O'Rourke"
+, title =       "Motion detection using {Hough} techniques"
+, booktitle =   "Proc. IEEE Internat. Conf. Pattern Recogn. Image Process."
+, year =        1981
+, pages =       "82--87"
+, keywords =    "computer vision, cluster analysis"
 }
 
 @techreport{o-dipp-00
-, author =	"J. O'Rourke"
-, title =	"On the Development of the Intersection of a Plane with a Polytope"
-, type =	"Technical {Report}"
-, number =	068
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA"
-, month =	jun
-, year =	2000
-, note =	"LANL arXiv cs.CG/0006035 v3,
-		\url{https://www.science.smith.edu/~jorourke/papers.php}"
-, url =	"https://www.science.smith.edu/~jorourke/papers.php"
-, archive =	"LANL arXiv cs.CG/0006035 v3"
-, keywords =	"polygonal chains, polytopes, polyhedra"
-, cites =	"c-cses-89, s-usedkkk-21"
-, update =	"01.04 orourke, 00.11 smid, 00.07 orourke"
+, author =      "J. O'Rourke"
+, title =       "On the Development of the Intersection of a Plane with a Polytope"
+, type =        "Technical {Report}"
+, number =      068
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA"
+, month =       jun
+, year =        2000
+, note =        "LANL arXiv cs.CG/0006035 v3,
+                \url{https://www.science.smith.edu/~jorourke/papers.php}"
+, url = "https://www.science.smith.edu/~jorourke/papers.php"
+, archive =     "LANL arXiv cs.CG/0006035 v3"
+, keywords =    "polygonal chains, polytopes, polyhedra"
+, cites =       "c-cses-89, s-usedkkk-21"
+, update =      "01.04 orourke, 00.11 smid, 00.07 orourke"
 }
 
 @techreport{o-shrs-93
-, author =	"J. O'Rourke"
-, title =	"On the scaling heuristic for reconstruction from slices"
-, type =	"Technical {Report}"
-, number =	029
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA"
-, month =	jun
-, year =	1993
-, keywords =	"triangulations, polyhedra, surface reconstruction"
-, update =	"94.01 orourke, 93.09 milone+mitchell"
-}
-
-%, number =	3
+, author =      "J. O'Rourke"
+, title =       "On the scaling heuristic for reconstruction from slices"
+, type =        "Technical {Report}"
+, number =      029
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA"
+, month =       jun
+, year =        1993
+, keywords =    "triangulations, polyhedra, surface reconstruction"
+, update =      "94.01 orourke, 93.09 milone+mitchell"
+}
+
+%, number =     3
 @article{o-shrs-94
-, author =	"J. O'Rourke"
-, title =	"On the scaling heuristic for reconstruction from slices"
-, journal =	"CVGIP: Graph. Models Image Process."
-, volume =	56
-, month =	sep
-, year =	1994
-, pages =	"420--423"
-, keywords =	"triangulations, polyhedra, surface reconstruction"
-, succeeds =	"o-shrs-93"
-, update =	"95.01 orourke"
+, author =      "J. O'Rourke"
+, title =       "On the scaling heuristic for reconstruction from slices"
+, journal =     "CVGIP: Graph. Models Image Process."
+, volume =      56
+, month =       sep
+, year =        1994
+, pages =       "420--423"
+, keywords =    "triangulations, polyhedra, surface reconstruction"
+, succeeds =    "o-shrs-93"
+, update =      "95.01 orourke"
 }
 
 @incollection{o-opcvi-99
-, author =	"J. O'Rourke"
-, title =	"Open problems in the combinatorics of visibility and illumination"
-, editor =	"B. Chazelle and J. E. Goodman and R. Pollack"
-, booktitle =	"Advances in Discrete and Computational Geometry"
-, series =	"Contemporary Mathematics"
-, volume =	223
-, publisher =	"American Mathematical Society"
-, address =	"Providence"
-, year =	1999
-, pages =	"237--243"
-, update =	"00.03 smid, 99.07 orourke, 97.11 orourke"
+, author =      "J. O'Rourke"
+, title =       "Open problems in the combinatorics of visibility and illumination"
+, editor =      "B. Chazelle and J. E. Goodman and R. Pollack"
+, booktitle =   "Advances in Discrete and Computational Geometry"
+, series =      "Contemporary Mathematics"
+, volume =      223
+, publisher =   "American Mathematical Society"
+, address =     "Providence"
+, year =        1999
+, pages =       "237--243"
+, update =      "00.03 smid, 99.07 orourke, 97.11 orourke"
 }
 
 @article{o-pdsfm-82
-, author =	"J. O'Rourke"
-, title =	"Polygon decomposition and switching function minimization"
-, journal =	"Comput. Graph. Image Process."
-, volume =	18
-, year =	1982
-, pages =	"382--391"
-, keywords =	"decomposition"
+, author =      "J. O'Rourke"
+, title =       "Polygon decomposition and switching function minimization"
+, journal =     "Comput. Graph. Image Process."
+, volume =      18
+, year =        1982
+, pages =       "382--391"
+, keywords =    "decomposition"
 }
 
 @inproceedings{o-pma3d-81
-, author =	"J. O'Rourke"
-, title =	"Polyhedra of minimal area as $3$-d object models"
-, editor =	"Patrick J. Hayes"
-, booktitle =	"Proc. 7th Internat. Joint Conf. Artif. Intell."
-, publisher =	"William Kaufmann"
-, year =	1981
-, pages =	"664--666"
-, keywords =	"polyhedra, area"
-, update =	"97.11 bibrelex"
+, author =      "J. O'Rourke"
+, title =       "Polyhedra of minimal area as $3$-d object models"
+, editor =      "Patrick J. Hayes"
+, booktitle =   "Proc. 7th Internat. Joint Conf. Artif. Intell."
+, publisher =   "William Kaufmann"
+, year =        1981
+, pages =       "664--666"
+, keywords =    "polyhedra, area"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{o-pom3d-80
-, author =	"J. O'Rourke"
-, title =	"Polyhedral Object Models from $3$-D Points"
-, type =	"Technical {Report}"
-, number =	"IFI-HH-M-77/80"
-, institution =	"Universit{\"a}t Hamburg"
-, address =	"Hamburg, Germany"
-, month =	jul
-, year =	1980
-, update =	"98.03 bibrelex"
+, author =      "J. O'Rourke"
+, title =       "Polyhedral Object Models from $3$-D Points"
+, type =        "Technical {Report}"
+, number =      "IFI-HH-M-77/80"
+, institution = "Universit{\"a}t Hamburg"
+, address =     "Hamburg, Germany"
+, month =       jul
+, year =        1980
+, update =      "98.03 bibrelex"
 }
 
 @techreport{o-ropv-85
-, author =	"J. O'Rourke"
-, title =	"Reconstruction of orthogonal polygons from vertices"
-, type =	"Report"
-, number =	"JHU-EECS 85-13"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1985
+, author =      "J. O'Rourke"
+, title =       "Reconstruction of orthogonal polygons from vertices"
+, type =        "Report"
+, number =      "JHU-EECS 85-13"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1985
 }
 
 @techreport{o-rcvg-90
-, author =	"J. O'Rourke"
-, title =	"Recovery of convexity from visibility graphs"
-, type =	"Technical {Report}"
-, number =	"90.4.6"
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA"
-, month =	apr
-, year =	1990
-, keywords =	"visibility graphs, convexity"
+, author =      "J. O'Rourke"
+, title =       "Recovery of convexity from visibility graphs"
+, type =        "Technical {Report}"
+, number =      "90.4.6"
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA"
+, month =       apr
+, year =        1990
+, keywords =    "visibility graphs, convexity"
 }
 
 @inproceedings{o-ccmcc-82
-, author =	"J. O'Rourke"
-, title =	"The complexity of computing minimum convex covers for polygons"
-, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
-, year =	1982
-, pages =	"75--84"
-, keywords =	"decomposition, covering"
+, author =      "J. O'Rourke"
+, title =       "The complexity of computing minimum convex covers for polygons"
+, booktitle =   "Proc. 20th Allerton Conf. Commun. Control Comput."
+, year =        1982
+, pages =       "75--84"
+, keywords =    "decomposition, covering"
 }
 
 @techreport{o-dccp-82
-, author =	"J. O'Rourke"
-, title =	"The decidability of covering by convex polygons"
-, type =	"Report"
-, number =	"JHU-EECS 82-4"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1982
+, author =      "J. O'Rourke"
+, title =       "The decidability of covering by convex polygons"
+, type =        "Report"
+, number =      "JHU-EECS 82-4"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1982
 }
 
 @techreport{o-ftcgc-90
-, author =	"J. O'Rourke"
-, title =	"The first ten computational geometry columns"
-, type =	"Technical Report"
-, number =	4
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA"
-, year =	1990
-, annote =	"Unedited copies of the first ten columns"
+, author =      "J. O'Rourke"
+, title =       "The first ten computational geometry columns"
+, type =        "Technical Report"
+, number =      4
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA"
+, year =        1990
+, annote =      "Unedited copies of the first ten columns"
 }
 
 @article{o-spc-86
-, author =	"J. O'Rourke"
-, title =	"The signature of a plane curve"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"34--51"
-, keywords =	"length, pattern recognition"
+, author =      "J. O'Rourke"
+, title =       "The signature of a plane curve"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "34--51"
+, keywords =    "length, pattern recognition"
 }
 
 @incollection{o-uocd-88
-, author =	"J. O'Rourke"
-, title =	"Uniqueness of orthogonal connect-the-dots"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"97--104"
-, keywords =	"pattern recognition"
+, author =      "J. O'Rourke"
+, title =       "Uniqueness of orthogonal connect-the-dots"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "97--104"
+, keywords =    "pattern recognition"
 }
 
 @techreport{o-uocd-86
-, author =	"J. O'Rourke"
-, title =	"Uniqueness of orthogonal connected-the-dots"
-, institution =	"Johns Hokins Univ."
-, address =	"Baltimore, MD"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "J. O'Rourke"
+, title =       "Uniqueness of orthogonal connected-the-dots"
+, institution = "Johns Hokins Univ."
+, address =     "Baltimore, MD"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{o-vplmm-97
-, author =	"Joseph O'Rourke"
-, title =	"Vertex $\pi$-Lights for Monotone Mountains"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"1--5"
-, keywords =	"art gallery theorems, floodlights, monotone polygons"
-, update =	"97.11 orourke, 97.07 orourke"
+, author =      "Joseph O'Rourke"
+, title =       "Vertex $\pi$-Lights for Monotone Mountains"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "1--5"
+, keywords =    "art gallery theorems, floodlights, monotone polygons"
+, update =      "97.11 orourke, 97.07 orourke"
 }
 
 @incollection{o-v-97
-, author =	"J. O'Rourke"
-, title =	"Visibility"
-, chapter =	25
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"467--480"
-, update =	"97.11 icking+orourke, 97.07 orourke, 97.03 orourke"
+, author =      "J. O'Rourke"
+, title =       "Visibility"
+, chapter =     25
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "467--480"
+, update =      "97.11 icking+orourke, 97.07 orourke, 97.03 orourke"
 }
 
 @techreport{oamb-oafme-84
-, author =	"J. O'Rourke and A. Aggarwal and S. Maddila and M. Baldwin"
-, title =	"An optimal algorithm for finding minimal enclosing triangles"
-, type =	"Technical {Report}"
-, number =	"JHU/EECS-84/08"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "J. O'Rourke and A. Aggarwal and S. Maddila and M. Baldwin"
+, title =       "An optimal algorithm for finding minimal enclosing triangles"
+, type =        "Technical {Report}"
+, number =      "JHU/EECS-84/08"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{oamb-oafme-86
-, author =	"J. O'Rourke and A. Aggarwal and S. Maddila and M. Baldwin"
-, title =	"An optimal algorithm for finding minimal enclosing triangles"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"258--269"
-, keywords =	"triangles, area, approximation"
+, author =      "J. O'Rourke and A. Aggarwal and S. Maddila and M. Baldwin"
+, title =       "An optimal algorithm for finding minimal enclosing triangles"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "258--269"
+, keywords =    "triangles, area, approximation"
 }
 
 @article{ob-dtdos-79
-, author =	"J. O'Rourke and N. I. Badler"
-, title =	"Decomposition of three-dimensional objects into spheres"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-1"
-, year =	1979
-, pages =	"295--305"
-, keywords =	"decomposition, spheres"
+, author =      "J. O'Rourke and N. I. Badler"
+, title =       "Decomposition of three-dimensional objects into spheres"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-1"
+, year =        1979
+, pages =       "295--305"
+, keywords =    "decomposition, spheres"
 }
 
 @article{ob-mbiah-80
-, author =	"J. O'Rourke and N. I. Badler"
-, title =	"Model-based image analysis of human motion using constraint propagation"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-2"
-, year =	1980
-, pages =	"522--536"
-, keywords =	"computer vision"
+, author =      "J. O'Rourke and N. I. Badler"
+, title =       "Model-based image analysis of human motion using constraint propagation"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-2"
+, year =        1980
+, pages =       "522--536"
+, keywords =    "computer vision"
 }
 
 @article{obw-cdnh-87
-, author =	"J. O'Rourke and H. Booth and R. Washington"
-, title =	"Connect-the-dots: {A} new heuristic"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	39
-, year =	1987
-, pages =	"258--266"
-, keywords =	"pattern recognition, Delaunay triangulations, Hamiltonian cycles"
-, update =	"00.03 orourke"
+, author =      "J. O'Rourke and H. Booth and R. Washington"
+, title =       "Connect-the-dots: {A} new heuristic"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      39
+, year =        1987
+, pages =       "258--266"
+, keywords =    "pattern recognition, Delaunay triangulations, Hamiltonian cycles"
+, update =      "00.03 orourke"
 }
 
 @techreport{obw-cdnh-84
-, author =	"J. O'Rourke and H. Booth and R. Washington"
-, title =	"Connected-the-Dots: {A} New Heuristic"
-, type =	"Technical {Report}"
-, number =	"JHU/EECS-84/11"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "J. O'Rourke and H. Booth and R. Washington"
+, title =       "Connected-the-Dots: {A} New Heuristic"
+, type =        "Technical {Report}"
+, number =      "JHU/EECS-84/11"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @article{ocon-nlaic-82
-, author =	"J. O'Rourke and C.-B. Chien and T. Olson and D. Naddor"
-, title =	"A new linear algorithm for intersecting convex polygons"
-, journal =	"Comput. Graph. Image Process."
-, volume =	19
-, year =	1982
-, pages =	"384--391"
-, keywords =	"intersection, polygons"
+, author =      "J. O'Rourke and C.-B. Chien and T. Olson and D. Naddor"
+, title =       "A new linear algorithm for intersecting convex polygons"
+, journal =     "Comput. Graph. Image Process."
+, volume =      19
+, year =        1982
+, pages =       "384--391"
+, keywords =    "intersection, polygons"
 }
 
 @techreport{os-ppnph3d-99
-, author =	"J. O'Rourke and {the Smith Problem Solving Group}"
-, title =	"{PushPush} is {NP}-hard in {3D}"
-, number =	064
-, institution =	"Smith College, Northampton, MA"
-, month =	nov
-, year =	1999
-, note =	"LANL XXX archive cs.CG/9911013"
-, archive =	"XXX:cs.CG/9911013"
-, cites =	"do-mpams-92"
-, update =	"00.03 orourke"
+, author =      "J. O'Rourke and {the Smith Problem Solving Group}"
+, title =       "{PushPush} is {NP}-hard in {3D}"
+, number =      064
+, institution = "Smith College, Northampton, MA"
+, month =       nov
+, year =        1999
+, note =        "LANL XXX archive cs.CG/9911013"
+, archive =     "XXX:cs.CG/9911013"
+, cites =       "do-mpams-92"
+, update =      "00.03 orourke"
 }
 
 @article{okm-ccs-86
-, author =	"J. O'Rourke and S. R. Kosaraju and N. Megiddo"
-, title =	"Computing circular separability"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"105--113"
-, keywords =	"circles, separation, design of algorithms, prune-and-search"
+, author =      "J. O'Rourke and S. R. Kosaraju and N. Megiddo"
+, title =       "Computing circular separability"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "105--113"
+, keywords =    "circles, separation, design of algorithms, prune-and-search"
 }
 
 @inproceedings{op-zps-98
-, author =	"J. O'Rourke and I. Pashchenko"
-, title =	"Zero-Parity Stabbing Information"
-, booktitle =	"Proc. Japan Conf. Discrete Comput. Geom. '98"
-, site =	"Tokyo"
-, month =	dec
-, year =	1998
-, pages =	"93--97"
-, note =	"To appear"
-, keywords =	"visibility graphs"
-, update =	"00.11 smid, 00.07 icking, 99.03 orourke, 98.11 orourke"
+, author =      "J. O'Rourke and I. Pashchenko"
+, title =       "Zero-Parity Stabbing Information"
+, booktitle =   "Proc. Japan Conf. Discrete Comput. Geom. '98"
+, site =        "Tokyo"
+, month =       dec
+, year =        1998
+, pages =       "93--97"
+, note =        "To appear"
+, keywords =    "visibility graphs"
+, update =      "00.11 smid, 00.07 icking, 99.03 orourke, 98.11 orourke"
 }
 
 @inproceedings{opt-nlrm-01
-, author =	"Joseph O'Rourke and Irena Pashchenko and Geetika Tewari"
-, title =	"Partitioning Orthogonal Polygons into Fat Rectangles"
-, booktitle =	"Proc. 13th Canad. Conf. Comput. Geom."
-, site =	"Waterloo"
-, year =	2001
-, pages =	"??--??"
-, update =	"02.03 icking, 01.07 orourke"
+, author =      "Joseph O'Rourke and Irena Pashchenko and Geetika Tewari"
+, title =       "Partitioning Orthogonal Polygons into Fat Rectangles"
+, booktitle =   "Proc. 13th Canad. Conf. Comput. Geom."
+, site =        "Waterloo"
+, year =        2001
+, pages =       "??--??"
+, update =      "02.03 icking, 01.07 orourke"
 }
 
 @inproceedings{op-nlrm-01
-, author =	"Joseph O'Rourke and Octavia Petrovici"
-, title =	"Narrowing Light Rays with Mirrors"
-, booktitle =	"Proc. 13th Canad. Conf. Comput. Geom."
-, site =	"Waterloo"
-, year =	2001
-, pages =	"137--140"
-, update =	"02.03 icking, 01.11 orourke, 01.07 orourke"
+, author =      "Joseph O'Rourke and Octavia Petrovici"
+, title =       "Narrowing Light Rays with Mirrors"
+, booktitle =   "Proc. 13th Canad. Conf. Comput. Geom."
+, site =        "Waterloo"
+, year =        2001
+, pages =       "137--140"
+, update =      "02.03 icking, 01.11 orourke, 01.07 orourke"
 }
 
 @techreport{or-cswvg-91
-, author =	"J. O'Rourke and J. Rippel"
-, title =	"A class of segments whose visibility graphs are {Hamiltonian}"
-, type =	"Technical {Report}"
-, number =	12
-, institution =	"Dept. Comput. Sci., Smith College"
-, year =	1991
-, keywords =	"visibility graphs, Hamiltonian cycles"
+, author =      "J. O'Rourke and J. Rippel"
+, title =       "A class of segments whose visibility graphs are {Hamiltonian}"
+, type =        "Technical {Report}"
+, number =      12
+, institution = "Dept. Comput. Sci., Smith College"
+, year =        1991
+, keywords =    "visibility graphs, Hamiltonian cycles"
 }
 
 @inproceedings{or-svgsr-92
-, author =	"J. O'Rourke and J. Rippel"
-, title =	"Segment visibility graphs: several results"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"35--38"
-, keywords =	"visibility graphs, Hamiltonian cycles"
-, cites =	"aek-rvgsp-91, a-srvg-89, lmw-nvg-87, m-htcpd-92, o-agta-87, or-cswvg-91, tt-uavrp-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "J. O'Rourke and J. Rippel"
+, title =       "Segment visibility graphs: several results"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "35--38"
+, keywords =    "visibility graphs, Hamiltonian cycles"
+, cites =       "aek-rvgsp-91, a-srvg-89, lmw-nvg-87, m-htcpd-92, o-agta-87, or-cswvg-91, tt-uavrp-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{or-tschv-94
-, author =	"J. O'Rourke and J. Rippel"
-, title =	"Two segment classes with {Hamiltonian} visibility graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"209--218"
-, keywords =	"visibility graphs, Hamiltonian cycles"
-, update =	"95.01 orourke"
+, author =      "J. O'Rourke and J. Rippel"
+, title =       "Two segment classes with {Hamiltonian} visibility graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "209--218"
+, keywords =    "visibility graphs, Hamiltonian cycles"
+, update =      "95.01 orourke"
 }
 
 @techreport{os-tdccc-87
-, author =	"J. O'Rourke and C. Schevon"
-, title =	"A theorem on the development of closed convex curves"
-, type =	"Report"
-, number =	"JHU-87/16"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1987
-, precedes =	"os-odcc3p-89"
-, update =	"97.11 orourke"
+, author =      "J. O'Rourke and C. Schevon"
+, title =       "A theorem on the development of closed convex curves"
+, type =        "Report"
+, number =      "JHU-87/16"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1987
+, precedes =    "os-odcc3p-89"
+, update =      "97.11 orourke"
 }
 
 @inproceedings{os-cgd3p-89
-, author =	"J. O'Rourke and C. Schevon"
-, title =	"Computing the geodesic diameter of a $3$-polytope"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"370--379"
-, keywords =	"polytopes, shortest paths, diameter"
-, cites =	"afw-fsgvd-88, cs-adpch-88, e-acg-87, egppss-acptc-88, es-vda-86, mmp-dgp-87, mo-al3sd-88, m-fspcp-85, m-nspsp-86, p-gcc-70, s-spacp-87, so-nmesc-88, so-afesp-89, ss-spps-86, s-agfnp-87, ZZZ"
-, update =	"98.07 bibrelex, 98.03 bibrelex"
+, author =      "J. O'Rourke and C. Schevon"
+, title =       "Computing the geodesic diameter of a $3$-polytope"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "370--379"
+, keywords =    "polytopes, shortest paths, diameter"
+, cites =       "afw-fsgvd-88, cs-adpch-88, e-acg-87, egppss-acptc-88, es-vda-86, mmp-dgp-87, mo-al3sd-88, m-fspcp-85, m-nspsp-86, p-gcc-70, s-spacp-87, so-nmesc-88, so-afesp-89, ss-spps-86, s-agfnp-87, ZZZ"
+, update =      "98.07 bibrelex, 98.03 bibrelex"
 }
 
 @article{os-odcc3p-89
-, author =	"J. O'Rourke and C. Schevon"
-, title =	"On the development of closed convex curves on 3-polytopes"
-, journal =	"J. Geom."
-, volume =	13
-, year =	1989
-, pages =	"152--157"
-, succeeds =	"os-tdccc-87"
-, update =	"97.11 orourke"
+, author =      "J. O'Rourke and C. Schevon"
+, title =       "On the development of closed convex curves on 3-polytopes"
+, journal =     "J. Geom."
+, volume =      13
+, year =        1989
+, pages =       "152--157"
+, succeeds =    "os-tdccc-87"
+, update =      "97.11 orourke"
 }
 
 @techreport{oss-icpvf-95t
-, author =	"J. O'Rourke and T. Shermer and I. Streinu"
-, title =	"Illuminating convex polygons with vertex floodlights"
-, type =	"Technical {Report}"
-, number =	039
-, institution =	"Dept. Comput. Sci., Smith College"
-, month =	apr
-, year =	1995
-, keywords =	"visibility, floodlights"
-, update =	"95.09 jones, 95.05 orourke, 95.05 orourke"
+, author =      "J. O'Rourke and T. Shermer and I. Streinu"
+, title =       "Illuminating convex polygons with vertex floodlights"
+, type =        "Technical {Report}"
+, number =      039
+, institution = "Dept. Comput. Sci., Smith College"
+, month =       apr
+, year =        1995
+, keywords =    "visibility, floodlights"
+, update =      "95.09 jones, 95.05 orourke, 95.05 orourke"
 }
 
 @inproceedings{oss-icpvf-95i
-, author =	"Joseph O'Rourke and Thomas Shermer and Ileana Streinu"
-, title =	"Illuminating Convex Polygons with Vertex Floodlights"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"151--156"
-, keywords =	"visibility, floodlights"
-, update =	"95.09 jones"
+, author =      "Joseph O'Rourke and Thomas Shermer and Ileana Streinu"
+, title =       "Illuminating Convex Polygons with Vertex Floodlights"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "151--156"
+, keywords =    "visibility, floodlights"
+, update =      "95.09 jones"
 }
 
 @article{os-dqtad-84
-, author =	"J. O'Rourke and K. R. {Sloan, Jr.}"
-, title =	"Dynamic quantization: two adaptive data structures for multidimensional spaces"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-6"
-, number =	3
-, month =	may
-, year =	1984
-, pages =	"266--280"
-, keywords =	"cluster analysis"
+, author =      "J. O'Rourke and K. R. {Sloan, Jr.}"
+, title =       "Dynamic quantization: two adaptive data structures for multidimensional spaces"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-6"
+, number =      3
+, month =       may
+, year =        1984
+, pages =       "266--280"
+, keywords =    "cluster analysis"
 }
 
 @techreport{os-pvgpp1-96
-, author =	"J. O'Rourke and I. Streinu"
-, title =	"Pseudo-visibility graphs in pseudo-polygons: {Part I}"
-, type =	"Technical {Report}"
-, number =	041
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA"
-, month =	jan
-, year =	1996
-, note =	"Slightly revised Apr. 1996"
-, update =	"98.07 bibrelex, 96.05 orourke"
+, author =      "J. O'Rourke and I. Streinu"
+, title =       "Pseudo-visibility graphs in pseudo-polygons: {Part I}"
+, type =        "Technical {Report}"
+, number =      041
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA"
+, month =       jan
+, year =        1996
+, note =        "Slightly revised Apr. 1996"
+, update =      "98.07 bibrelex, 96.05 orourke"
 }
 
 @techreport{os-pvgpp2-96
-, author =	"J. O'Rourke and I. Streinu"
-, title =	"Pseudo-visibility graphs in pseudo-polygons: {Part II}"
-, type =	"Technical {Report}"
-, number =	042
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA"
-, month =	apr
-, year =	1996
-, update =	"98.07 bibrelex, 96.05 orourke"
+, author =      "J. O'Rourke and I. Streinu"
+, title =       "Pseudo-visibility graphs in pseudo-polygons: {Part II}"
+, type =        "Technical {Report}"
+, number =      042
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA"
+, month =       apr
+, year =        1996
+, update =      "98.07 bibrelex, 96.05 orourke"
 }
 
 @techreport{os-vevgp-96
-, author =	"J. O'Rourke and I. Streinu"
-, title =	"The Vertex-Edge Visibility Graph of a Polygon"
-, type =	"Technical {Report}"
-, number =	047
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA"
-, month =	jun
-, year =	1996
-, note =	"Revised Feb. 1997"
-, update =	"97.03 orourke"
+, author =      "J. O'Rourke and I. Streinu"
+, title =       "The Vertex-Edge Visibility Graph of a Polygon"
+, type =        "Technical {Report}"
+, number =      047
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA"
+, month =       jun
+, year =        1996
+, note =        "Revised Feb. 1997"
+, update =      "97.03 orourke"
 }
 
 @article{os-vevgp-97
-, author =	"J. O'Rourke and I. Streinu"
-, title =	"The vertex-edge visibility graph of a polygon"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"1--17"
-, keywords =	"visibility, geometric graphs"
-, succeeds =	"os-pvgpp1-96"
-, update =	"98.07 bibrelex, 97.07 orourke"
-, annote =	"A new polygon visibility graph is introduced.  It is
+, author =      "J. O'Rourke and I. Streinu"
+, title =       "The vertex-edge visibility graph of a polygon"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "1--17"
+, keywords =    "visibility, geometric graphs"
+, succeeds =    "os-pvgpp1-96"
+, update =      "98.07 bibrelex, 97.07 orourke"
+, annote =      "A new polygon visibility graph is introduced.  It is
                  demonstrated that it encodes more geometric
-		 information about the polygon than does the vertex
+                 information about the polygon than does the vertex
                  visibility graph.  For example, it determines the
                  shortest path tree for each vertex."
 }
 
 @article{os-vevgp-98
-, author =	"Joseph O'Rourke and Ileana Streinu"
-, title =	"The vertex--edge visibility graph of a polygon"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"105--120"
-, update =	"98.11 devillers"
+, author =      "Joseph O'Rourke and Ileana Streinu"
+, title =       "The vertex--edge visibility graph of a polygon"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "105--120"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{os-vepvgcr-97
-, author =	"J. O'Rourke and I. Streinu"
-, title =	"Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"119--128"
-, keywords =	"visibility, geometric graphs, arrangements"
-, succeeds =	"os-pvgpp2-96"
-, cites =	"ak-vgom-95, blwsz-om-93, e-vgr-90, g-rcvgs-88, g-rcvgs-97, gp-sccca-84, k-ah-92, m-utoms-91, o-cgc18-93, os-pvgpp1-96, os-vevgp-97, s-spinh-91, s-cs-96, s-nspvg-96, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat+orourke"
-, annote =	"Vertex-edge visibility graphs of pseudo-polygons
-		are characterized combinatorially, showing that the
-		decision problem for them is in P.  This also establishes
-		that the decision problem for vertex-vertex
-		visibility graphs of pseudo-polygons is in NP."
+, author =      "J. O'Rourke and I. Streinu"
+, title =       "Vertex-Edge Pseudo-Visibility Graphs: Characterization and Recognition"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "119--128"
+, keywords =    "visibility, geometric graphs, arrangements"
+, succeeds =    "os-pvgpp2-96"
+, cites =       "ak-vgom-95, blwsz-om-93, e-vgr-90, g-rcvgs-88, g-rcvgs-97, gp-sccca-84, k-ah-92, m-utoms-91, o-cgc18-93, os-pvgpp1-96, os-vevgp-97, s-spinh-91, s-cs-96, s-nspvg-96, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat+orourke"
+, annote =      "Vertex-edge visibility graphs of pseudo-polygons
+                are characterized combinatorially, showing that the
+                decision problem for them is in P.  This also establishes
+                that the decision problem for vertex-vertex
+                visibility graphs of pseudo-polygons is in NP."
 }
 
 @techreport{os-rpps-91
-, author =	"J. O'Rourke and V. Subramanian"
-, title =	"On reconstructing polyhedra from parallel slices"
-, type =	"Technical {Report}"
-, number =	008
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA"
-, month =	jun
-, year =	1991
-, keywords =	"triangulations, polyhedra, surface reconstruction"
-, update =	"94.01 orourke"
+, author =      "J. O'Rourke and V. Subramanian"
+, title =       "On reconstructing polyhedra from parallel slices"
+, type =        "Technical {Report}"
+, number =      008
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA"
+, month =       jun
+, year =        1991
+, keywords =    "triangulations, polyhedra, surface reconstruction"
+, update =      "94.01 orourke"
 }
 
 @article{os-snhpd-83
-, author =	"J. O'Rourke and K. J. Supowit"
-, title =	"Some {NP}-hard polygon decomposition problems"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	"IT-30"
-, year =	1983
-, pages =	"181--190"
-, keywords =	"decomposition, NP-completeness"
-, update =	"94.09 lambert"
+, author =      "J. O'Rourke and K. J. Supowit"
+, title =       "Some {NP}-hard polygon decomposition problems"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      "IT-30"
+, year =        1983
+, pages =       "181--190"
+, keywords =    "decomposition, NP-completeness"
+, update =      "94.09 lambert"
 }
 
 @techreport{osb-spps-84
-, author =	"J. O'Rourke and Subhash Suri and H. Booth"
-, title =	"Shortest paths on polyhedral surfaces"
-, type =	"Manuscript"
-, institution =	"Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1984
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "J. O'Rourke and Subhash Suri and H. Booth"
+, title =       "Shortest paths on polyhedral surfaces"
+, type =        "Manuscript"
+, institution = "Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1984
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{osb-spps-85
-, author =	"J. O'Rourke and Subhash Suri and H. Booth"
-, title =	"Shortest paths on polyhedral surfaces"
-, booktitle =	"Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	182
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"243--254"
-, keywords =	"shortest paths"
-, update =	"98.03 mitchell"
+, author =      "J. O'Rourke and Subhash Suri and H. Booth"
+, title =       "Shortest paths on polyhedral surfaces"
+, booktitle =   "Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      182
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "243--254"
+, keywords =    "shortest paths"
+, update =      "98.03 mitchell"
 }
 
 @incollection{ot-pr-97
-, author =	"J. O'Rourke and G. T. Toussaint"
-, title =	"Pattern recognition"
-, chapter =	43
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"797--814"
-, update =	"97.11 icking+orourke, 97.07 orourke, 97.03 orourke"
+, author =      "J. O'Rourke and G. T. Toussaint"
+, title =       "Pattern recognition"
+, chapter =     43
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "797--814"
+, update =      "97.11 icking+orourke, 97.07 orourke, 97.03 orourke"
 }
 
 @techreport{ov-grp-91
-, author =	"J. O'Rourke and M. Virmani"
-, title =	"Generating random polygons"
-, number =	11
-, institution =	"Dept. Comput. Sci., Smith College"
-, year =	1991
-, keywords =	"polygons, randomness"
+, author =      "J. O'Rourke and M. Virmani"
+, title =       "Generating random polygons"
+, number =      11
+, institution = "Dept. Comput. Sci., Smith College"
+, year =        1991
+, keywords =    "polygons, randomness"
 }
 
 @incollection{ow-css-85
-, author =	"J. O'Rourke and R. Washington"
-, title =	"Curve similarity via signatures"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"295--317"
-, keywords =	"length, pattern recognition"
+, author =      "J. O'Rourke and R. Washington"
+, title =       "Curve similarity via signatures"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "295--317"
+, keywords =    "length, pattern recognition"
 }
 
 @techreport{ox-spi-96
-, author =	"J. O'Rourke and C. Xiao"
-, title =	"Some polyhedra are irreducible"
-, type =	"Technical {Report}"
-, number =	49
-, institution =	"Dept. Comput. Sci., Smith College"
-, month =	jun
-, year =	1996
-, keywords =	"morphing"
-, update =	"97.11 orourke"
-, annote =	"Proves that Guibas-Hershberger polygon morphing
-		cannot extend to an analogous morphing of polyhedra"
+, author =      "J. O'Rourke and C. Xiao"
+, title =       "Some polyhedra are irreducible"
+, type =        "Technical {Report}"
+, number =      49
+, institution = "Dept. Comput. Sci., Smith College"
+, month =       jun
+, year =        1996
+, keywords =    "morphing"
+, update =      "97.11 orourke"
+, annote =      "Proves that Guibas-Hershberger polygon morphing
+                cannot extend to an analogous morphing of polyhedra"
 }
 
 @incollection{ox-ip90v-94
-, author =	"J. O'Rourke and D. Xu"
-, title =	"Illumination of polygons with $90^\circ$ vertex lights"
-, booktitle =	"Snapshots of Computational and Discrete Geometry"
-, volume =	3
-, publisher =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, month =	jul
-, year =	1994
-, pages =	"108--117"
-, note =	"Technical Report SOCS-94.50"
-, keywords =	"visibility, floodlights"
-, update =	"94.09 orourke"
-, annote =	"Also Technical Report 034, Dept. Comput. Sci., Smith College"
+, author =      "J. O'Rourke and D. Xu"
+, title =       "Illumination of polygons with $90^\circ$ vertex lights"
+, booktitle =   "Snapshots of Computational and Discrete Geometry"
+, volume =      3
+, publisher =   "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, month =       jul
+, year =        1994
+, pages =       "108--117"
+, note =        "Technical Report SOCS-94.50"
+, keywords =    "visibility, floodlights"
+, update =      "94.09 orourke"
+, annote =      "Also Technical Report 034, Dept. Comput. Sci., Smith College"
 }
 
 @techreport{o-artpc-85
-, author =	"D. J. Orser"
-, title =	"An algebraic representation for the topology of polytope complexes"
-, type =	"Report"
-, number =	"??"
-, institution =	"Center Manufacturing Engrg., National Bureau Standards"
-, year =	1985
+, author =      "D. J. Orser"
+, title =       "An algebraic representation for the topology of polytope complexes"
+, type =        "Report"
+, number =      "??"
+, institution = "Center Manufacturing Engrg., National Bureau Standards"
+, year =        1985
 }
 
 @inproceedings{o-efo-83
-, author =	"R. H. J. Otten"
-, title =	"Efficient Floorplan Optimization"
-, booktitle =	"IEEE Int. Conf. Computer Design inVLSI in Computers"
-, year =	1983
-, pages =	"499--522"
-, update =	"98.11 bibrelex"
+, author =      "R. H. J. Otten"
+, title =       "Efficient Floorplan Optimization"
+, booktitle =   "IEEE Int. Conf. Computer Design inVLSI in Computers"
+, year =        1983
+, pages =       "499--522"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ow-grild-78
-, author =	"R. H. J. M. Otten and J. G. van Wijk"
-, title =	"Graph Representations in Interactive Layout Design"
-, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
-, year =	1978
-, pages =	"914--918"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. H. J. M. Otten and J. G. van Wijk"
+, title =       "Graph Representations in Interactive Layout Design"
+, booktitle =   "Proc. IEEE Internat. Sympos. on Circuits and Systems"
+, year =        1978
+, pages =       "914--918"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @proceedings{o-iwcg-89
-, title =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, editor =	"Thomas Ottmann"
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 5th Intern. Workshop Comput. Geom."
+, editor =      "Thomas Ottmann"
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @techreport{osh-kaoa-94
-, author =	"Thomas Ottmann and Sven Schuierer and Christoph A. Hipke"
-, title =	"Kompetitive {Analyse} f{\"u}r {Online-Algorithmen}: {Eine} kommentierte {Bibliographie}"
-, number =	61
-, institution =	"Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
-, address =	"Germany"
-, year =	1994
-, update =	"00.03 bibrelex"
+, author =      "Thomas Ottmann and Sven Schuierer and Christoph A. Hipke"
+, title =       "Kompetitive {Analyse} f{\"u}r {Online-Algorithmen}: {Eine} kommentierte {Bibliographie}"
+, number =      61
+, institution = "Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
+, address =     "Germany"
+, year =        1994
+, update =      "00.03 bibrelex"
 }
 
 @incollection{oss-eephd-95
-, author =	"T. Ottmann and S. Schuierer and S. Soundaralakshmi"
-, title =	"Enumerating extreme points in higher dimensions"
-, booktitle =	"Proc. 12th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	900
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"562--570"
-, update =	"95.05 smid"
+, author =      "T. Ottmann and S. Schuierer and S. Soundaralakshmi"
+, title =       "Enumerating extreme points in higher dimensions"
+, booktitle =   "Proc. 12th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      900
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "562--570"
+, update =      "95.05 smid"
 }
 
 @techreport{osw-dcrch-83
-, author =	"T. Ottmann and E. Soisalon-Soininen and D. Wood"
-, title =	"On the definition and computation of rectilinear convex hulls"
-, number =	"CS-83-07"
-, institution =	"Univ. Waterloo"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "T. Ottmann and E. Soisalon-Soininen and D. Wood"
+, title =       "On the definition and computation of rectilinear convex hulls"
+, number =      "CS-83-07"
+, institution = "Univ. Waterloo"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{osw-dcrch-85
-, author =	"T. Ottmann and E. Soisalon-Soininen and D. Wood"
-, title =	"On the definition and computation of rectilinear convex hulls"
-, journal =	"Inform. Sci."
-, volume =	33
-, year =	1985
-, pages =	"157--171"
+, author =      "T. Ottmann and E. Soisalon-Soininen and D. Wood"
+, title =       "On the definition and computation of rectilinear convex hulls"
+, journal =     "Inform. Sci."
+, volume =      33
+, year =        1985
+, pages =       "157--171"
 }
 
 @techreport{osw-rchps-83
-, author =	"T. Ottmann and E. Soisalon-Soininen and D. Wood"
-, title =	"Rectilinear convex hull partitioning of sets of rectilinear polygons"
-, type =	"Report"
-, number =	"CS-83-19"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	1983
+, author =      "T. Ottmann and E. Soisalon-Soininen and D. Wood"
+, title =       "Rectilinear convex hull partitioning of sets of rectilinear polygons"
+, type =        "Report"
+, number =      "CS-83-19"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        1983
 }
 
 @inproceedings{otu-nsga-87
-, author =	"T. Ottmann and G. Thiemt and C. Ullrich"
-, title =	"Numerical stability of geometric algorithms"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"119--125"
-, comments =	"parts of the results appeared in: Th. Ottmann, G. Thiemt, C. Ullrich, On Arithmetical Problems of geometric Algorithms in the plane, Computing supplement 6 (1988), 13-136"
-, cites =	"a-spapo-85, b-ipsap-84, bo-arcgi-79, bruw-pcmls-86, f-cgset-87, gs-pmgsc-85, km-catp-81, km-nasc-83, lp-cgs-84, -mrm-83, m-mdscg-84, ps-cgi-85, r-cnebf-82, r-snsls-82, rb-lsbea-83, t-dnsga-86, t-cg-85, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "T. Ottmann and G. Thiemt and C. Ullrich"
+, title =       "Numerical stability of geometric algorithms"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "119--125"
+, comments =    "parts of the results appeared in: Th. Ottmann, G. Thiemt, C. Ullrich, On Arithmetical Problems of geometric Algorithms in the plane, Computing supplement 6 (1988), 13-136"
+, cites =       "a-spapo-85, b-ipsap-84, bo-arcgi-79, bruw-pcmls-86, f-cgset-87, gs-pmgsc-85, km-catp-81, km-nasc-83, lp-cgs-84, -mrm-83, m-mdscg-84, ps-cgi-85, r-cnebf-82, r-snsls-82, rb-lsbea-83, t-dnsga-86, t-cg-85, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @book{ow-ad-90
-, author =	"Thomas Ottmann and Peter Widmayer"
-, title =	"Algorithmen und {Datenstrukturen}"
-, publisher =	"BI-Wissenschaftsverlag"
-, address =	"Mannheim"
-, year =	1990
-, update =	"00.03 bibrelex"
+, author =      "Thomas Ottmann and Peter Widmayer"
+, title =       "Algorithmen und {Datenstrukturen}"
+, publisher =   "BI-Wissenschaftsverlag"
+, address =     "Mannheim"
+, year =        1990
+, update =      "00.03 bibrelex"
 }
 
 @techreport{ow-plsss-82
-, author =	"T. Ottmann and P. Widmayer"
-, title =	"On the placement of line segments into a skeleton structure"
-, type =	"Report"
-, number =	117
-, institution =	"Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1982
+, author =      "T. Ottmann and P. Widmayer"
+, title =       "On the placement of line segments into a skeleton structure"
+, type =        "Report"
+, number =      117
+, institution = "Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1982
 }
 
 @article{ow-tsls-83
-, author =	"T. Ottmann and P. Widmayer"
-, title =	"On translating a set of line segments"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	24
-, year =	1983
-, pages =	"382--389"
+, author =      "T. Ottmann and P. Widmayer"
+, title =       "On translating a set of line segments"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      24
+, year =        1983
+, pages =       "382--389"
 }
 
 @techreport{ow-remrp-81
-, author =	"T. Ottmann and P. Widmayer"
-, title =	"Reasonable encodings make rectangle problems hard"
-, type =	"Report"
-, number =	"??"
-, institution =	"Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1981
+, author =      "T. Ottmann and P. Widmayer"
+, title =       "Reasonable encodings make rectangle problems hard"
+, type =        "Report"
+, number =      "??"
+, institution = "Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1981
 }
 
 @techreport{ow-svpus-84
-, author =	"T. Ottmann and P. Widmayer"
-, title =	"Solving visibility problems by using skeleton structures"
-, type =	"Report"
-, number =	133
-, institution =	"Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1984
+, author =      "T. Ottmann and P. Widmayer"
+, title =       "Solving visibility problems by using skeleton structures"
+, type =        "Report"
+, number =      133
+, institution = "Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1984
 }
 
 @techreport{oww-fabmo-82
-, author =	"T. Ottmann and P. Widmayer and D. Wood"
-, title =	"A fast algorithm for {Boolean} mask operations"
-, type =	"Report"
-, number =	112
-, institution =	"Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1982
-, precedes =	"oww-fabmo-85"
+, author =      "T. Ottmann and P. Widmayer and D. Wood"
+, title =       "A fast algorithm for {Boolean} mask operations"
+, type =        "Report"
+, number =      112
+, institution = "Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1982
+, precedes =    "oww-fabmo-85"
 }
 
 @article{oww-fabmo-85
-, author =	"T. Ottmann and P. Widmayer and D. Wood"
-, title =	"A fast algorithm for {Boolean} mask operations"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	30
-, year =	1985
-, pages =	"249--268"
-, succeeds =	"oww-fabmo-82"
+, author =      "T. Ottmann and P. Widmayer and D. Wood"
+, title =       "A fast algorithm for {Boolean} mask operations"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      30
+, year =        1985
+, pages =       "249--268"
+, succeeds =    "oww-fabmo-82"
 }
 
 @article{oww-wceah-85
-, author =	"T. Ottmann and P. Widmayer and D. Wood"
-, title =	"A worst-case efficient algorithm for hidden line elimination"
-, journal =	"Internat. J. Comput. Math."
-, volume =	18
-, year =	1985
-, pages =	"93--119"
+, author =      "T. Ottmann and P. Widmayer and D. Wood"
+, title =       "A worst-case efficient algorithm for hidden line elimination"
+, journal =     "Internat. J. Comput. Math."
+, volume =      18
+, year =        1985
+, pages =       "93--119"
 }
 
 @techreport{ow-dsp-84t
-, author =	"T. Ottmann and D. Wood"
-, title =	"Dynamical sets of points"
-, type =	"Technical {Report}"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, year =	1984
-, update =	"98.07 bibrelex"
+, author =      "T. Ottmann and D. Wood"
+, title =       "Dynamical sets of points"
+, type =        "Technical {Report}"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, year =        1984
+, update =      "98.07 bibrelex"
 }
 
 @article{ow-dsp-84
-, author =	"T. Ottmann and D. Wood"
-, title =	"Dynamical sets of points"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	27
-, year =	1984
-, pages =	"157--166"
+, author =      "T. Ottmann and D. Wood"
+, title =       "Dynamical sets of points"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      27
+, year =        1984
+, pages =       "157--166"
 }
 
 @techreport{ow-sepsa-84
-, author =	"T. Ottmann and D. Wood"
-, title =	"Space-economical plane-sweep algorithms"
-, type =	"Report"
-, number =	"CS-84-32"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	1984
-, precedes =	"ow-sepsa-86"
+, author =      "T. Ottmann and D. Wood"
+, title =       "Space-economical plane-sweep algorithms"
+, type =        "Report"
+, number =      "CS-84-32"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        1984
+, precedes =    "ow-sepsa-86"
 }
 
 @article{ow-sepsa-86
-, author =	"T. Ottmann and D. Wood"
-, title =	"Space-economical plane-sweep algorithms"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	34
-, year =	1986
-, pages =	"35--51"
-, succeeds =	"ow-sepsa-84"
+, author =      "T. Ottmann and D. Wood"
+, title =       "Space-economical plane-sweep algorithms"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      34
+, year =        1986
+, pages =       "35--51"
+, succeeds =    "ow-sepsa-84"
 }
 
 @techreport{ow-cpp-84
-, author =	"T. Ottmann and D. Wood"
-, title =	"The contour problem for polygons"
-, type =	"Report"
-, number =	"CS-84-33"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	1984
+, author =      "T. Ottmann and D. Wood"
+, title =       "The contour problem for polygons"
+, type =        "Report"
+, number =      "CS-84-33"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        1984
 }
 
 @techreport{o-gpbvd-84
-, author =	"T. A. Ottmann"
-, title =	"Geometrische {Probleme} beim {VLSI}-{Design}"
-, type =	"Report"
-, number =	138
-, institution =	"Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1984
+, author =      "T. A. Ottmann"
+, title =       "Geometrische {Probleme} beim {VLSI}-{Design}"
+, type =        "Report"
+, number =      138
+, institution = "Inst. Angew. Inform. Formale Beschreibungsverfahren, Univ. Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1984
 }
 
 @article{o-schle-85
-, author =	"T. A. Ottmann"
-, title =	"Special cases of the hidden-line elimination problem"
-, journal =	"Bull. EATCS"
-, volume =	26
-, year =	1985
-, pages =	"163--164"
-, update =	"96.09 devillers"
+, author =      "T. A. Ottmann"
+, title =       "Special cases of the hidden-line elimination problem"
+, journal =     "Bull. EATCS"
+, volume =      26
+, year =        1985
+, pages =       "163--164"
+, update =      "96.09 devillers"
 }
 
 @article{osw-pssop-87
-, author =	"Th. Ottmann and E. Soisalon-Soininen and D. Wood"
-, title =	"Partitioning and Separating Sets of Orthogonal Polygons"
-, journal =	"Inform. Sci."
-, volume =	42
-, year =	1987
-, pages =	"31--49"
+, author =      "Th. Ottmann and E. Soisalon-Soininen and D. Wood"
+, title =       "Partitioning and Separating Sets of Orthogonal Polygons"
+, journal =     "Inform. Sci."
+, volume =      42
+, year =        1987
+, pages =       "31--49"
 }
 
 @book{ow-ad-93
-, author =	"Th. Ottmann and P. Widmayer"
-, title =	"Algorithmen und Datenstrukturen"
-, series =	"Reihe Informatik"
-, volume =	70
-, publisher =	"BI Wissenschaftsverlag"
-, address =	"Mannheim"
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "Th. Ottmann and P. Widmayer"
+, title =       "Algorithmen und Datenstrukturen"
+, series =      "Reihe Informatik"
+, volume =      70
+, publisher =   "BI Wissenschaftsverlag"
+, address =     "Mannheim"
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @techreport{ow-ubtcl-89
-, author =	"Th. Ottmann and D. Wood"
-, title =	"Updating Binary Trees with Constant Linkage Cost"
-, type =	"Research Report"
-, number =	"CS-89-45"
-, institution =	"Data Structuring Group, University of Waterloo"
-, year =	1989
-, update =	"98.11 bibrelex"
+, author =      "Th. Ottmann and D. Wood"
+, title =       "Updating Binary Trees with Constant Linkage Cost"
+, type =        "Research Report"
+, number =      "CS-89-45"
+, institution = "Data Structuring Group, University of Waterloo"
+, year =        1989
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{o-ibgf-85
-, author =	"M. Ouksel"
-, title =	"The interpolation-based grid file"
-, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
-, year =	1985
-, pages =	"20--27"
-, update =	"97.07 agarwal"
+, author =      "M. Ouksel"
+, title =       "The interpolation-based grid file"
+, booktitle =   "Proc. Annu. ACM Sympos. Principles Database Syst."
+, year =        1985
+, pages =       "20--27"
+, update =      "97.07 agarwal"
 }
 
 @article{os-mbtad-81
-, author =	"M. Ouksel and P. Scheuermann"
-, title =	"Multidimensional {$B$}-trees: analysis of dynamic behavior"
-, journal =	"BIT"
-, volume =	21
-, year =	1981
-, pages =	"401--418"
+, author =      "M. Ouksel and P. Scheuermann"
+, title =       "Multidimensional {$B$}-trees: analysis of dynamic behavior"
+, journal =     "BIT"
+, volume =      21
+, year =        1981
+, pages =       "401--418"
 }
 
 @techreport{o-csdst-??
-, author =	"J. K. Ousterhout"
-, title =	"Corner {Stitching}: a data structuring technique for {VLSI} design tools"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
+, author =      "J. K. Ousterhout"
+, title =       "Corner {Stitching}: a data structuring technique for {VLSI} design tools"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
 }
 
 @book{o-ttt-94
-, author =	"J. K. Ousterhout"
-, title =	"Tcl and the {Tk} toolkit"
-, publisher =	"Addison-Wesley"
-, year =	1994
-, update =	"98.07 bibrelex"
+, author =      "J. K. Ousterhout"
+, title =       "Tcl and the {Tk} toolkit"
+, publisher =   "Addison-Wesley"
+, year =        1994
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{o-cp-88
-, author =	"M. Overmars"
-, title =	"Connectability problems"
-, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	318
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"105--112"
+, author =      "M. Overmars"
+, title =       "Connectability problems"
+, booktitle =   "Proc. 1st Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      318
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "105--112"
 }
 
 @inproceedings{o-fd-96
-, author =	"Mark Overmars"
-, title =	"Fixture Design"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	49
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Mark Overmars"
+, title =       "Fixture Design"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       49
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @techreport{o-tcg-93
-, author =	"M. Overmars"
-, title =	"Teaching computational geometry"
-, type =	"Technical {Report}"
-, number =	"RUU-CS-93-34"
-, institution =	"Utrecht University"
-, address =	"Utrecht, Netherlands"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "M. Overmars"
+, title =       "Teaching computational geometry"
+, type =        "Technical {Report}"
+, number =      "RUU-CS-93-34"
+, institution = "Utrecht University"
+, address =     "Utrecht, Netherlands"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{orsw-ipaw-95
-, author =	"Mark Overmars and Anil Rao and Otfried Schwarzkopf and Chantal Wentink"
-, title =	"Immobilizing Polygons against a Wall"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"29--38"
-, keywords =	"grasping, form-closure, clamping, fixtures"
-, cites =	"am-rsps-93, ab-kawff-85, by-kmafr-90, b-hjfd-89, bg-casmf-94, ccb-maacm-89, b-rsdoh-93, gt-admff-86, h-mf-87, l-matps-82, mnp-gg-90, m-wap-91, mss-esmpg-87, ps-cgi-85, r-km-76, wc-pmhf-94, zgw-emf-94, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell+schwarzkopf"
+, author =      "Mark Overmars and Anil Rao and Otfried Schwarzkopf and Chantal Wentink"
+, title =       "Immobilizing Polygons against a Wall"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "29--38"
+, keywords =    "grasping, form-closure, clamping, fixtures"
+, cites =       "am-rsps-93, ab-kawff-85, by-kmafr-90, b-hjfd-89, bg-casmf-94, ccb-maacm-89, b-rsdoh-93, gt-admff-86, h-mf-87, l-matps-82, mnp-gg-90, m-wap-91, mss-esmpg-87, ps-cgi-85, r-km-76, wc-pmhf-94, zgw-emf-94, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell+schwarzkopf"
 }
 
 @article{oss-slspt-90
-, author =	"M. Overmars and H. Schipper and Micha Sharir"
-, title =	"Storing line segments in partition trees"
-, journal =	"BIT"
-, volume =	30
-, year =	1990
-, pages =	"385--403"
-, succeeds =	"oss-slspt-89"
-, update =	"98.03 mitchell"
+, author =      "M. Overmars and H. Schipper and Micha Sharir"
+, title =       "Storing line segments in partition trees"
+, journal =     "BIT"
+, volume =      30
+, year =        1990
+, pages =       "385--403"
+, succeeds =    "oss-slspt-89"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{os-oshsr-89
-, author =	"M. Overmars and Micha Sharir"
-, title =	"Output-sensitive hidden surface removal"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"598--603"
-, comments =	"To appear as two papers in ACM Trans. Graphics and
-		 Algorithmica"
-, update =	"98.03 mitchell"
+, author =      "M. Overmars and Micha Sharir"
+, title =       "Output-sensitive hidden surface removal"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "598--603"
+, comments =    "To appear as two papers in ACM Trans. Graphics and
+                 Algorithmica"
+, update =      "98.03 mitchell"
 }
 
 @techreport{o-ramp-92
-, author =	"M. H. Overmars"
-, title =	"A Random Approach to Motion Planning"
-, type =	"Report"
-, number =	"RUU-CS-92-32"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, month =	oct
-, year =	1992
-, update =	"95.01 devillers"
+, author =      "M. H. Overmars"
+, title =       "A Random Approach to Motion Planning"
+, type =        "Report"
+, number =      "RUU-CS-92-32"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, month =       oct
+, year =        1992
+, update =      "95.01 devillers"
 }
 
 @incollection{o-cggo-88
-, author =	"M. H. Overmars"
-, title =	"Computational geometry on a grid: an overview"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"167--184"
-, update =	"99.11 bibrelex"
+, author =      "M. H. Overmars"
+, title =       "Computational geometry on a grid: an overview"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "167--184"
+, update =      "99.11 bibrelex"
 }
 
 @inproceedings{o-dcgal-96
-, author =	"Mark H. Overmars"
-, title =	"Designing the {C}omputational {G}eometry {A}lgorithms {L}ibrary {CGAL}"
-, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
-, site =	"Philadelphia, PA, USA"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1148
-, publisher =	"Springer-Verlag"
-, month =	may
-, year =	1996
-, pages =	"53--58"
-, url =	"http://www.cs.uu.nl/CGAL/Papers/panel.ps.gz"
-, update =	"00.03 vismara, 99.11 bibrelex, 98.11 bibrelex, 97.11 held"
+, author =      "Mark H. Overmars"
+, title =       "Designing the {C}omputational {G}eometry {A}lgorithms {L}ibrary {CGAL}"
+, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
+, site =        "Philadelphia, PA, USA"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1148
+, publisher =   "Springer-Verlag"
+, month =       may
+, year =        1996
+, pages =       "53--58"
+, url = "http://www.cs.uu.nl/CGAL/Papers/panel.ps.gz"
+, update =      "00.03 vismara, 99.11 bibrelex, 98.11 bibrelex, 97.11 held"
 }
 
 @incollection{o-dzdhg-82
-, author =	"M. H. Overmars"
-, title =	"Dynamische zoekstructuren die hun geschiedenis onthouden"
-, editor =	"P. M. B. Vitanyi and J. van Leeuwen and P. van {Emde Boas}"
-, booktitle =	"Colloquium Complexiteit en Algorithmen"
-, publisher =	"Mathematisch Centrum, Amsterdam"
-, year =	1982
-, pages =	"109--136"
-, update =	"94.01 smid, 93.09 rote"
+, author =      "M. H. Overmars"
+, title =       "Dynamische zoekstructuren die hun geschiedenis onthouden"
+, editor =      "P. M. B. Vitanyi and J. van Leeuwen and P. van {Emde Boas}"
+, booktitle =   "Colloquium Complexiteit en Algorithmen"
+, publisher =   "Mathematisch Centrum, Amsterdam"
+, year =        1982
+, pages =       "109--136"
+, update =      "94.01 smid, 93.09 rote"
 }
 
 @article{o-dodsp-81
-, author =	"M. H. Overmars"
-, title =	"Dynamization of order decomposable set problems"
-, journal =	"J. Algorithms"
-, volume =	2
-, year =	1981
-, pages =	"245--260"
-, note =	"Corrigendum in 4(1983), 301"
+, author =      "M. H. Overmars"
+, title =       "Dynamization of order decomposable set problems"
+, journal =     "J. Algorithms"
+, volume =      2
+, year =        1981
+, pages =       "245--260"
+, note =        "Corrigendum in 4(1983), 301"
 }
 
 @techreport{o-edsrs-87
-, author =	"M. H. Overmars"
-, title =	"Efficient data structures for range searching on a grid"
-, type =	"Report"
-, number =	"RUU-CS-87-2"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1987
-, precedes =	"o-edsrs-88"
-, update =	"94.05 schwarzkopf"
+, author =      "M. H. Overmars"
+, title =       "Efficient data structures for range searching on a grid"
+, type =        "Report"
+, number =      "RUU-CS-87-2"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1987
+, precedes =    "o-edsrs-88"
+, update =      "94.05 schwarzkopf"
 }
 
 @article{o-edsrs-88
-, author =	"M. H. Overmars"
-, title =	"Efficient data structures for range searching on a grid"
-, journal =	"J. Algorithms"
-, volume =	9
-, year =	1988
-, pages =	"254--275"
-, succeeds =	"o-edsrs-87"
+, author =      "M. H. Overmars"
+, title =       "Efficient data structures for range searching on a grid"
+, journal =     "J. Algorithms"
+, volume =      9
+, year =        1988
+, pages =       "254--275"
+, succeeds =    "o-edsrs-87"
 }
 
 @article{o-gmaea-81
-, author =	"M. H. Overmars"
-, title =	"General methods for ``all elements'' and ``all pairs'' problems"
-, journal =	"Inform. Process. Lett."
-, volume =	12
-, year =	1981
-, pages =	"99--102"
+, author =      "M. H. Overmars"
+, title =       "General methods for ``all elements'' and ``all pairs'' problems"
+, journal =     "Inform. Process. Lett."
+, volume =      12
+, year =        1981
+, pages =       "99--102"
 }
 
 @techreport{o-gdscg-85t
-, author =	"M. H. Overmars"
-, title =	"Geometric data structures for computer graphics"
-, type =	"Report"
-, number =	"RUU-CS-85-13"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1985
-, precedes =	"o-gdscg-85i"
-, update =	"94.05 schwarzkopf"
+, author =      "M. H. Overmars"
+, title =       "Geometric data structures for computer graphics"
+, type =        "Report"
+, number =      "RUU-CS-85-13"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1985
+, precedes =    "o-gdscg-85i"
+, update =      "94.05 schwarzkopf"
 }
 
 @incollection{o-gdscg-85i
-, author =	"M. H. Overmars"
-, title =	"Geometric data structures for computer graphics"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Fundamental Algorithms for Computer Graphics"
-, series =	"NATO ASI Series~F"
-, volume =	17
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"919--931"
-, succeeds =	"o-gdscg-85t"
-, precedes =	"o-gdscg-88"
-, update =	"97.03 schwarzkopf"
+, author =      "M. H. Overmars"
+, title =       "Geometric data structures for computer graphics"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Fundamental Algorithms for Computer Graphics"
+, series =      "NATO ASI Series~F"
+, volume =      17
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "919--931"
+, succeeds =    "o-gdscg-85t"
+, precedes =    "o-gdscg-88"
+, update =      "97.03 schwarzkopf"
 }
 
 @incollection{o-gdscg-88
-, author =	"M. H. Overmars"
-, title =	"Geometric data structures for computer graphics: an overview"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"21--49"
-, keywords =	"survey paper, quad trees, range trees, segment trees, dynamizing data structures"
-, succeeds =	"o-gdscg-85i"
-, update =	"97.03 schwarzkopf"
+, author =      "M. H. Overmars"
+, title =       "Geometric data structures for computer graphics: an overview"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "21--49"
+, keywords =    "survey paper, quad trees, range trees, segment trees, dynamizing data structures"
+, succeeds =    "o-gdscg-85i"
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{o-nmhsr-90
-, author =	"Mark H. Overmars"
-, title =	"New Methods for Hidden Surface Removal"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	20
-, update =	"00.03 bibrelex"
+, author =      "Mark H. Overmars"
+, title =       "New Methods for Hidden Surface Removal"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       20
+, update =      "00.03 bibrelex"
 }
 
 @techreport{o-plfs-91
-, author =	"M. H. Overmars"
-, title =	"Point location in fat subdivisions"
-, type =	"Technical {Report}"
-, number =	"RUU-CS-91-40"
-, institution =	"Univ. of Utrecht"
-, address =	"Utrecht, Netherlands"
-, month =	nov
-, year =	1991
-, update =	"93.09 milone+mitchell"
+, author =      "M. H. Overmars"
+, title =       "Point location in fat subdivisions"
+, type =        "Technical {Report}"
+, number =      "RUU-CS-91-40"
+, institution = "Univ. of Utrecht"
+, address =     "Utrecht, Netherlands"
+, month =       nov
+, year =        1991
+, update =      "93.09 milone+mitchell"
 }
 
 @article{o-plfs-92
-, author =	"M. H. Overmars"
-, title =	"Point location in fat subdivisions"
-, journal =	"Inform. Process. Lett."
-, volume =	44
-, year =	1992
-, pages =	"261--265"
-, succeeds =	"o-plfs-91"
-, update =	"94.05 matousek"
+, author =      "M. H. Overmars"
+, title =       "Point location in fat subdivisions"
+, journal =     "Inform. Process. Lett."
+, volume =      44
+, year =        1992
+, pages =       "261--265"
+, succeeds =    "o-plfs-91"
+, update =      "94.05 matousek"
 }
 
 @inproceedings{o-rssls-85
-, author =	"M. H. Overmars"
-, title =	"Range searching in a set of line segments"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"177--185"
-, cites =	"e-ndrs-81, em-ioo-81, em-sosgr-81, eos-smcga-84a, k-osps-83, l-tarrc-79, m-pst-81, o-ddds-83, ol-wcoid-81, l-gcg-82, w-sbta-79, ZZZ"
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "M. H. Overmars"
+, title =       "Range searching in a set of line segments"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "177--185"
+, cites =       "e-ndrs-81, em-ioo-81, em-sosgr-81, eos-smcga-84a, k-osps-83, l-tarrc-79, m-pst-81, o-ddds-83, ol-wcoid-81, l-gcg-82, w-sbta-79, ZZZ"
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @techreport{o-rsg-85t
-, author =	"M. H. Overmars"
-, title =	"Range searching on a grid"
-, type =	"Report"
-, number =	"RUU-CS-85-17a"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1985
-, precedes =	"o-rsg-85i"
-, update =	"94.05 schwarzkopf"
+, author =      "M. H. Overmars"
+, title =       "Range searching on a grid"
+, type =        "Report"
+, number =      "RUU-CS-85-17a"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1985
+, precedes =    "o-rsg-85i"
+, update =      "94.05 schwarzkopf"
 }
 
 @inproceedings{o-rsg-85i
-, author =	"M. H. Overmars"
-, title =	"Range searching on a grid"
-, booktitle =	"Proc. 11th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '85"
-, publisher =	"Trauner Verlag"
-, address =	"Linz, Austria"
-, year =	1985
-, pages =	"295--305"
-, succeeds =	"o-rsg-85t"
-, update =	"98.07 bibrelex, 94.05 smid"
+, author =      "M. H. Overmars"
+, title =       "Range searching on a grid"
+, booktitle =   "Proc. 11th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '85"
+, publisher =   "Trauner Verlag"
+, address =     "Linz, Austria"
+, year =        1985
+, pages =       "295--305"
+, succeeds =    "o-rsg-85t"
+, update =      "98.07 bibrelex, 94.05 smid"
 }
 
 @article{o-rciac-81
-, author =	"M. H. Overmars"
-, title =	"Reporting and counting intersections of arcs on a circle"
-, journal =	"Bull. EATCS"
-, volume =	14
-, year =	1981
-, pages =	"7--15"
+, author =      "M. H. Overmars"
+, title =       "Reporting and counting intersections of arcs on a circle"
+, journal =     "Bull. EATCS"
+, volume =      14
+, year =        1981
+, pages =       "7--15"
 }
 
 @techreport{o-sp1-81
-, author =	"M. H. Overmars"
-, title =	"Searching in the past {I}"
-, type =	"Report"
-, number =	"RUU-CS-81-7"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1981
-, update =	"94.05 schwarzkopf"
+, author =      "M. H. Overmars"
+, title =       "Searching in the past {I}"
+, type =        "Report"
+, number =      "RUU-CS-81-7"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1981
+, update =      "94.05 schwarzkopf"
 }
 
 @techreport{o-sp2gt-81
-, author =	"M. H. Overmars"
-, title =	"Searching in the past {II}: general transforms"
-, type =	"Report"
-, number =	"RUU-CS-81-9"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1981
-, update =	"94.05 schwarzkopf"
+, author =      "M. H. Overmars"
+, title =       "Searching in the past {II}: general transforms"
+, type =        "Report"
+, number =      "RUU-CS-81-9"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1981
+, update =      "94.05 schwarzkopf"
 }
 
 @book{o-ddds-83
-, author =	"M. H. Overmars"
-, title =	"The Design of Dynamic Data Structures"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	156
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg, West Germany"
-, year =	1983
-, keywords =	"book"
-, update =	"96.05 agarwal"
+, author =      "M. H. Overmars"
+, title =       "The Design of Dynamic Data Structures"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      156
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg, West Germany"
+, year =        1983
+, keywords =    "book"
+, update =      "96.05 agarwal"
 }
 
 @inproceedings{o-la-83
-, author =	"M. H. Overmars"
-, title =	"The locus approach"
-, booktitle =	"Proc. 9th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '83"
-, publisher =	"Trauner Verlag"
-, address =	"Linz, Austria"
-, year =	1983
-, pages =	"263--273"
-, update =	"98.07 bibrelex, 94.05 smid"
+, author =      "M. H. Overmars"
+, title =       "The locus approach"
+, booktitle =   "Proc. 9th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '83"
+, publisher =   "Trauner Verlag"
+, address =     "Linz, Austria"
+, year =        1983
+, pages =       "263--273"
+, update =      "98.07 bibrelex, 94.05 smid"
 }
 
 @inproceedings{o-tsdds-82
-, author =	"M. H. Overmars"
-, title =	"Transforming semi-dynamic data structures into dynamic structures"
-, booktitle =	"Proc. 7th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, nickname =	"WG '81"
-, publisher =	"Carl Hanser Verlag"
-, year =	1982
-, pages =	"173--182"
-, update =	"98.07 bibrelex"
+, author =      "M. H. Overmars"
+, title =       "Transforming semi-dynamic data structures into dynamic structures"
+, booktitle =   "Proc. 7th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, nickname =    "WG '81"
+, publisher =   "Carl Hanser Verlag"
+, year =        1982
+, pages =       "173--182"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{ok-csdp-89
-, author =	"M. H. Overmars and M. J. van Kreveld"
-, title =	"Concatenable structures for decomposable problems"
-, number =	"RUU-CS-89-16"
-, institution =	"Univ. of Utrecht"
-, address =	"Utrecht, Netherlands"
-, month =	aug
-, year =	1989
-, update =	"93.09 milone+mitchell"
+, author =      "M. H. Overmars and M. J. van Kreveld"
+, title =       "Concatenable structures for decomposable problems"
+, number =      "RUU-CS-89-16"
+, institution = "Univ. of Utrecht"
+, address =     "Utrecht, Netherlands"
+, month =       aug
+, year =        1989
+, update =      "93.09 milone+mitchell"
 }
 
 @article{ol-dmdds-82
-, author =	"M. H. Overmars and J. van Leeuwen"
-, title =	"Dynamic multi-dimensional data structures based on quad- and $k$-d trees"
-, journal =	"Acta Inform."
-, volume =	17
-, year =	1982
-, pages =	"267--285"
-, update =	"96.05 smid"
+, author =      "M. H. Overmars and J. van Leeuwen"
+, title =       "Dynamic multi-dimensional data structures based on quad- and $k$-d trees"
+, journal =     "Acta Inform."
+, volume =      17
+, year =        1982
+, pages =       "267--285"
+, update =      "96.05 smid"
 }
 
 @inproceedings{ol-dmcp-80
-, author =	"M. H. Overmars and J. van Leeuwen"
-, title =	"Dynamically maintaining configurations in the plane"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Theory Comput."
-, year =	1980
-, pages =	"135--145"
-, succeeds =	"ol-nmcp-80"
-, precedes =	"ol-mcp-81"
+, author =      "M. H. Overmars and J. van Leeuwen"
+, title =       "Dynamically maintaining configurations in the plane"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Theory Comput."
+, year =        1980
+, pages =       "135--145"
+, succeeds =    "ol-nmcp-80"
+, precedes =    "ol-mcp-81"
 }
 
 @inproceedings{ol-ddspy-81
-, author =	"M. H. Overmars and J. van Leeuwen"
-, title =	"Dynamization of decomposable searching problems yielding good worst-case bounds"
-, booktitle =	"Proc. 5th GI Conf. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	104
-, publisher =	"Springer-Verlag"
-, year =	1981
-, pages =	"224--233"
-, update =	"99.11 bibrelex, 96.05 agarwal"
+, author =      "M. H. Overmars and J. van Leeuwen"
+, title =       "Dynamization of decomposable searching problems yielding good worst-case bounds"
+, booktitle =   "Proc. 5th GI Conf. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      104
+, publisher =   "Springer-Verlag"
+, year =        1981
+, pages =       "224--233"
+, update =      "99.11 bibrelex, 96.05 agarwal"
 }
 
 @article{ol-fcbch-80
-, author =	"M. H. Overmars and J. van Leeuwen"
-, title =	"Further comments on {Bykat}'s convex hull algorithm"
-, journal =	"Inform. Process. Lett."
-, volume =	10
-, year =	1980
-, pages =	"209--212"
+, author =      "M. H. Overmars and J. van Leeuwen"
+, title =       "Further comments on {Bykat}'s convex hull algorithm"
+, journal =     "Inform. Process. Lett."
+, volume =      10
+, year =        1980
+, pages =       "209--212"
 }
 
 @article{ol-mcp-81
-, author =	"M. H. Overmars and J. van Leeuwen"
-, title =	"Maintenance of configurations in the plane"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	23
-, year =	1981
-, pages =	"166--204"
-, succeeds =	"ol-dmcp-80"
+, author =      "M. H. Overmars and J. van Leeuwen"
+, title =       "Maintenance of configurations in the plane"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      23
+, year =        1981
+, pages =       "166--204"
+, succeeds =    "ol-dmcp-80"
 }
 
 @techreport{ol-nmcp-80
-, author =	"M. H. Overmars and J. van Leeuwen"
-, title =	"Notes on maintenance of configurations in the plane"
-, type =	"Report"
-, number =	"RUU-CS-80-5"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1980
-, precedes =	"ol-dmcp-80"
-, update =	"94.05 schwarzkopf"
+, author =      "M. H. Overmars and J. van Leeuwen"
+, title =       "Notes on maintenance of configurations in the plane"
+, type =        "Report"
+, number =      "RUU-CS-80-5"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1980
+, precedes =    "ol-dmcp-80"
+, update =      "94.05 schwarzkopf"
 }
 
 @article{ol-spdds-81
-, author =	"M. H. Overmars and J. van Leeuwen"
-, title =	"Some principles for dynamizing decomposable searching problems"
-, journal =	"Inform. Process. Lett."
-, volume =	12
-, year =	1981
-, pages =	"49--54"
+, author =      "M. H. Overmars and J. van Leeuwen"
+, title =       "Some principles for dynamizing decomposable searching problems"
+, journal =     "Inform. Process. Lett."
+, volume =      12
+, year =        1981
+, pages =       "49--54"
 }
 
 @article{ol-tgmdd-81
-, author =	"M. H. Overmars and J. van Leeuwen"
-, title =	"Two general methods for dynamizing decomposable searching problems"
-, journal =	"Computing"
-, volume =	26
-, year =	1981
-, pages =	"155--166"
+, author =      "M. H. Overmars and J. van Leeuwen"
+, title =       "Two general methods for dynamizing decomposable searching problems"
+, journal =     "Computing"
+, volume =      26
+, year =        1981
+, pages =       "155--166"
 }
 
 @article{ol-wcoid-81
-, author =	"M. H. Overmars and J. van Leeuwen"
-, title =	"Worst-case optimal insertion and deletion methods for decomposable searching problems"
-, journal =	"Inform. Process. Lett."
-, volume =	12
-, year =	1981
-, pages =	"168--173"
+, author =      "M. H. Overmars and J. van Leeuwen"
+, title =       "Worst-case optimal insertion and deletion methods for decomposable searching problems"
+, journal =     "Inform. Process. Lett."
+, volume =      12
+, year =        1981
+, pages =       "168--173"
 }
 
 @techreport{oss-slspt-89
-, author =	"M. H. Overmars and H. Schipper and Micha Sharir"
-, title =	"Storing line segments in partition trees"
-, type =	"Report"
-, number =	"RUU-CS-89-17"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1989
-, precedes =	"oss-slspt-90"
-, update =	"98.03 mitchell, 94.05 schwarzkopf"
+, author =      "M. H. Overmars and H. Schipper and Micha Sharir"
+, title =       "Storing line segments in partition trees"
+, type =        "Report"
+, number =      "RUU-CS-89-17"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1989
+, precedes =    "oss-slspt-90"
+, update =      "98.03 mitchell, 94.05 schwarzkopf"
 }
 
 @techreport{osv-swec6-88
-, author =	"M. H. Overmars and B. Scholten and I. Vincent"
-, title =	"Sets without empty convex $6$-gons"
-, type =	"Report"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "M. H. Overmars and B. Scholten and I. Vincent"
+, title =       "Sets without empty convex $6$-gons"
+, type =        "Report"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @article{osv-swec6-89
-, author =	"M. H. Overmars and B. Scholten and I. Vincent"
-, title =	"Sets without Empty Convex $6$-gons"
-, journal =	"Bull. EATCS"
-, volume =	37
-, year =	1989
-, pages =	160
+, author =      "M. H. Overmars and B. Scholten and I. Vincent"
+, title =       "Sets without Empty Convex $6$-gons"
+, journal =     "Bull. EATCS"
+, volume =      37
+, year =        1989
+, pages =       160
 }
 
 @techreport{os-itosh-89
-, author =	"M. H. Overmars and Micha Sharir"
-, title =	"An improved technique for output-sensitive hidden surface removal"
-, number =	"RUU-CS-89-32"
-, institution =	"Univ. of Utrecht"
-, address =	"Utrecht, Netherlands"
-, month =	dec
-, year =	1989
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "M. H. Overmars and Micha Sharir"
+, title =       "An improved technique for output-sensitive hidden surface removal"
+, number =      "RUU-CS-89-32"
+, institution = "Univ. of Utrecht"
+, address =     "Utrecht, Netherlands"
+, month =       dec
+, year =        1989
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @inproceedings{os-mvm-90
-, author =	"M. H. Overmars and Micha Sharir"
-, title =	"Merging visibility maps"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"168--176"
-, precedes =	"os-mvm-91"
-, cites =	"b-hsrr-90, ce-oails-88, d-qbhle-86, egs-ccmfa-90, g-pahle-87i, gao-isost-90, go-nasch-87, ms-rcibt-88, m-eahsr-89, m-wcohs-87, n-flsah-85, os-oshsr-89, py-bpahs-89, rs-eoshs-88i, so-sosah-92, pvy-cavsi-88, s-tsbhl-81, sss-cthsa-74, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "M. H. Overmars and Micha Sharir"
+, title =       "Merging visibility maps"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "168--176"
+, precedes =    "os-mvm-91"
+, cites =       "b-hsrr-90, ce-oails-88, d-qbhle-86, egs-ccmfa-90, g-pahle-87i, gao-isost-90, go-nasch-87, ms-rcibt-88, m-eahsr-89, m-wcohs-87, n-flsah-85, os-oshsr-89, py-bpahs-89, rs-eoshs-88i, so-sosah-92, pvy-cavsi-88, s-tsbhl-81, sss-cthsa-74, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{os-mvm-91
-, author =	"M. H. Overmars and Micha Sharir"
-, title =	"Merging visibility maps"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, year =	1991
-, pages =	"35--49"
-, succeeds =	"os-mvm-90"
-, update =	"98.03 mitchell"
+, author =      "M. H. Overmars and Micha Sharir"
+, title =       "Merging visibility maps"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, year =        1991
+, pages =       "35--49"
+, succeeds =    "os-mvm-90"
+, update =      "98.03 mitchell"
 }
 
 @article{osbk-mrtsm-90
-, author =	"M. H. Overmars and M. H. M. Smid and M. T. de Berg and M. J. van Kreveld"
-, title =	"Maintaining range trees in secondary memory, part {I}: {P}artitions"
-, journal =	"Acta Inform."
-, volume =	27
-, year =	1990
-, pages =	"423--452"
-, update =	"97.07 agarwal"
+, author =      "M. H. Overmars and M. H. M. Smid and M. T. de Berg and M. J. van Kreveld"
+, title =       "Maintaining range trees in secondary memory, part {I}: {P}artitions"
+, journal =     "Acta Inform."
+, volume =      27
+, year =        1990
+, pages =       "423--452"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{os-rsplf-94
-, author =	"M. H. Overmars and A. F. van der Stappen"
-, title =	"Range Searching and Point Location among Fat Objects"
-, editor =	"J. van Leeuwen"
-, booktitle =	"Algorithms -- ESA'94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"240--253"
-, update =	"99.11 bibrelex, 97.03 schwarzkopf, 96.05 agarwal, 95.01 held"
+, author =      "M. H. Overmars and A. F. van der Stappen"
+, title =       "Range Searching and Point Location among Fat Objects"
+, editor =      "J. van Leeuwen"
+, booktitle =   "Algorithms -- ESA'94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "240--253"
+, update =      "99.11 bibrelex, 97.03 schwarzkopf, 96.05 agarwal, 95.01 held"
 }
 
 @article{os-rsplf-96
-, author =	"M. H. Overmars and A. F. van der Stappen"
-, title =	"Range Searching and Point Location among Fat Objects"
-, journal =	"J. Algorithms"
-, volume =	21
-, year =	1996
-, pages =	"629--656"
-, update =	"97.03 agarwal+smid, 96.05 agarwal, 95.01 held"
+, author =      "M. H. Overmars and A. F. van der Stappen"
+, title =       "Range Searching and Point Location among Fat Objects"
+, journal =     "J. Algorithms"
+, volume =      21
+, year =        1996
+, pages =       "629--656"
+, update =      "97.03 agarwal+smid, 96.05 agarwal, 95.01 held"
 }
 
 @incollection{os-plamp-94
-, author =	"M. H. Overmars and P. {\v S}vestka"
-, title =	"A Probabilistic Learning Approach to Motion Planning"
-, booktitle =	"Algorithmic Foundations of Robotics"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1995
-, keywords =	"probabilistic, motion planning, learning"
-, update =	"99.11 bibrelex, 98.07 agarwal, 97.03 schwarzkopf"
+, author =      "M. H. Overmars and P. {\v S}vestka"
+, title =       "A Probabilistic Learning Approach to Motion Planning"
+, booktitle =   "Algorithmic Foundations of Robotics"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1995
+, keywords =    "probabilistic, motion planning, learning"
+, update =      "99.11 bibrelex, 98.07 agarwal, 97.03 schwarzkopf"
 }
 
 @article{ow-sms2d-85
-, author =	"M. H. Overmars and Emo Welzl"
-, title =	"A simple method for solving $2$-dimensional static range searching"
-, journal =	"Bull. EATCS"
-, volume =	25
-, year =	1985
-, pages =	"31--33"
-, keywords =	"range search"
-, update =	"98.03 mitchell"
+, author =      "M. H. Overmars and Emo Welzl"
+, title =       "A simple method for solving $2$-dimensional static range searching"
+, journal =     "Bull. EATCS"
+, volume =      25
+, year =        1985
+, pages =       "31--33"
+, keywords =    "range search"
+, update =      "98.03 mitchell"
 }
 
 @techreport{ow-csvg-87
-, author =	"M. H. Overmars and Emo Welzl"
-, title =	"Construction of Sparse Visibility Graphs"
-, type =	"Technical {Report}"
-, number =	"RUU-CS-87-9"
-, institution =	"Department of Computer Science, University of Utrecht"
-, year =	1987
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "M. H. Overmars and Emo Welzl"
+, title =       "Construction of Sparse Visibility Graphs"
+, type =        "Technical {Report}"
+, number =      "RUU-CS-87-9"
+, institution = "Department of Computer Science, University of Utrecht"
+, year =        1987
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @inproceedings{ow-nmcvg-88
-, author =	"M. H. Overmars and Emo Welzl"
-, title =	"New methods for computing visibility graphs"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"164--171"
-, cites =	"aaghi-vdp-86, eg-tsa-86, gm-osacv-87, hs-ndssg-86, h-fvgsp-87, l-prp-78, lw-apcfp-79, ow-csvg-87, ss-spps-84, w-cvgnl-85, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "M. H. Overmars and Emo Welzl"
+, title =       "New methods for computing visibility graphs"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "164--171"
+, cites =       "aaghi-vdp-86, eg-tsa-86, gm-osacv-87, hs-ndssg-86, h-fvgsp-87, l-prp-78, lw-apcfp-79, ow-csvg-87, ss-spps-84, w-cvgnl-85, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @inproceedings{ow-ccp-85
-, author =	"M. H. Overmars and Emo Welzl"
-, title =	"The complexity of cutting paper"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"316--321"
-, keywords =	"shape, dynamic programming"
-, cites =	"ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "M. H. Overmars and Emo Welzl"
+, title =       "The complexity of cutting paper"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "316--321"
+, keywords =    "shape, dynamic programming"
+, cites =       "ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{ow-rv-88
-, author =	"M. H. Overmars and D. Wood"
-, title =	"On rectangular visibility"
-, journal =	"J. Algorithms"
-, volume =	9
-, year =	1988
-, pages =	"372--390"
-, keywords =	"isothetic rectangles"
-, succeeds =	"mow-vv-87"
-, update =	"93.09 milone+mitchell"
+, author =      "M. H. Overmars and D. Wood"
+, title =       "On rectangular visibility"
+, journal =     "J. Algorithms"
+, volume =      9
+, year =        1988
+, pages =       "372--390"
+, keywords =    "isothetic rectangles"
+, succeeds =    "mow-vv-87"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{oy-nubkm-88
-, author =	"M. H. Overmars and C.-K. Yap"
-, title =	"New upper bounds in {Klee}'s measure problem"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"550--556"
-, keywords =	"$d$-dimensional"
-, comments =	"$O(n^{d/2}\log n)$ time, $O(n)$ space"
-, succeeds =	"k-cmbbc-77"
-, precedes =	"oy-nubkm-91"
+, author =      "M. H. Overmars and C.-K. Yap"
+, title =       "New upper bounds in {Klee}'s measure problem"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "550--556"
+, keywords =    "$d$-dimensional"
+, comments =    "$O(n^{d/2}\log n)$ time, $O(n)$ space"
+, succeeds =    "k-cmbbc-77"
+, precedes =    "oy-nubkm-91"
 }
 
 @article{oy-nubkm-91
-, author =	"M. H. Overmars and C.-K. Yap"
-, title =	"New upper bounds in {Klee}'s measure problem"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"1034--1045"
-, succeeds =	"oy-nubkm-88"
+, author =      "M. H. Overmars and C.-K. Yap"
+, title =       "New upper bounds in {Klee}'s measure problem"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "1034--1045"
+, succeeds =    "oy-nubkm-88"
 }
 
 @article{o-csgtt-96
-, author =	"J. Owen"
-, title =	"Constraint on simple geometry in two and three dimensions"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"421--434"
-, update =	"97.03 devillers"
+, author =      "J. Owen"
+, title =       "Constraint on simple geometry in two and three dimensions"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "421--434"
+, update =      "97.03 devillers"
 }
 
 @mastersthesis{o-innit-92
-, author =	"S. J. Owen"
-, title =	"An implementation of natural neighbor interpolation in three dimensions"
-, journal =	"Master's thesis"
-, school =	"Brigham Young University"
-, year =	1992
-, keywords =	"master thesis"
-, update =	"01.07 devillers, 00.03 devillers"
+, author =      "S. J. Owen"
+, title =       "An implementation of natural neighbor interpolation in three dimensions"
+, journal =     "Master's thesis"
+, school =      "Brigham Young University"
+, year =        1992
+, keywords =    "master thesis"
+, update =      "01.07 devillers, 00.03 devillers"
 }
 
 @book{o-ar-85
-, author =	"T. Owen"
-, title =	"Assembly with Robots"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "T. Owen"
+, title =       "Assembly with Robots"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @article{o-sft-85
-, author =	"A. Oxley"
-, title =	"Surface Fitting by Triangulation"
-, journal =	"Comput. J."
-, volume =	28
-, number =	3
-, year =	1985
-, pages =	"335--339"
-, annote =	"Almost content-free. Implementation of Lewis-Robinson
-		 algorithm. Suggests constraining of non-boundary edges.
-		 Suggests ear cutting to construct initial
-		 triangulation."
+, author =      "A. Oxley"
+, title =       "Surface Fitting by Triangulation"
+, journal =     "Comput. J."
+, volume =      28
+, number =      3
+, year =        1985
+, pages =       "335--339"
+, annote =      "Almost content-free. Implementation of Lewis-Robinson
+                 algorithm. Suggests constraining of non-boundary edges.
+                 Suggests ear cutting to construct initial
+                 triangulation."
 }
 
 @inproceedings{o-ptilc-80
-, author =	"T. Ozawa"
-, title =	"Planarity Testing for {IC} Layout with Constraints for Pin Order and Congestion Between Pins"
-, booktitle =	"IEEE Conf. Record of the 14th Asilomar Conf. on Circuits, Systems and Computers"
-, year =	1980
-, pages =	"188--192"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "T. Ozawa"
+, title =       "Planarity Testing for {IC} Layout with Constraints for Pin Order and Congestion Between Pins"
+, booktitle =   "IEEE Conf. Record of the 14th Asilomar Conf. on Circuits, Systems and Computers"
+, year =        1980
+, pages =       "188--192"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @incollection{ot-gpaia-81
-, author =	"T. Ozawa and H. Takahashi"
-, title =	"A Graph-planarization Algorithm and its Applications to Random Graphs"
-, booktitle =	"Graph Theory and Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	108
-, publisher =	"Springer-Verlag"
-, year =	1981
-, pages =	"95--107"
-, keywords =	"graph drawing"
-, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
+, author =      "T. Ozawa and H. Takahashi"
+, title =       "A Graph-planarization Algorithm and its Applications to Random Graphs"
+, booktitle =   "Graph Theory and Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      108
+, publisher =   "Springer-Verlag"
+, year =        1981
+, pages =       "95--107"
+, keywords =    "graph drawing"
+, update =      "99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
 }
 
 @article{p-ttrms-98
-, author =	"J{\'a}nos Pach"
-, title =	"A {Tverberg}-type result on multicolored simplices"
-, chapter =	1
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1998
-, pages =	"71--76"
-, update =	"98.11 devillers, 97.11 orourke"
+, author =      "J{\'a}nos Pach"
+, title =       "A {Tverberg}-type result on multicolored simplices"
+, chapter =     1
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1998
+, pages =       "71--76"
+, update =      "98.11 devillers, 97.11 orourke"
 }
 
 @article{p-cpcp-86
-, author =	"J. Pach"
-, title =	"Covering the plane with convex polygons"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"73--81"
+, author =      "J. Pach"
+, title =       "Covering the plane with convex polygons"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "73--81"
 }
 
 @incollection{p-fpc-97
-, author =	"J. Pach"
-, title =	"Finite point configurations"
-, chapter =	1
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"3--18"
-, update =	"97.11 orourke"
+, author =      "J. Pach"
+, title =       "Finite point configurations"
+, chapter =     1
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "3--18"
+, update =      "97.11 orourke"
 }
 
 @book{p-ntdcg-93
-, title =	"New Trends in Discrete and Computational Geometry"
-, editor =	"J. Pach"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, year =	1993
-, keywords =	"discrete/computational geometry, book, survey papers"
-, comments =	"contains gs-caa-93, s-barga-93, m-encg-93, k-cpvc-93, gp-asotd-93, km-hart-93, gpw-gtt-93, b-hlcpr-93, b-gcabt-93, fk-rrtpc-93, mp-rdcg-93, and k-stces-93"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 96.05 pocchiola, 93.09 erickson"
+, title =       "New Trends in Discrete and Computational Geometry"
+, editor =      "J. Pach"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, year =        1993
+, keywords =    "discrete/computational geometry, book, survey papers"
+, comments =    "contains gs-caa-93, s-barga-93, m-encg-93, k-cpvc-93, gp-asotd-93, km-hart-93, gpw-gtt-93, b-hlcpr-93, b-gcabt-93, fk-rrtpc-93, mp-rdcg-93, and k-stces-93"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 96.05 pocchiola, 93.09 erickson"
 }
 
 @incollection{p-nggt-91
-, author =	"J{\'a}nos Pach"
-, title =	"Notes on geometric graph theory"
-, editor =	"J. E. Goodman and R. Pollack and W. Steiger"
-, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
-, publisher =	"American Mathematical Society, Association for Computing Machinery"
-, year =	1991
-, pages =	"273--285"
-, comments =	"survey paper, geometric graphs"
-, update =	"99.11 bibrelex, 97.07 agarwal"
+, author =      "J{\'a}nos Pach"
+, title =       "Notes on geometric graph theory"
+, editor =      "J. E. Goodman and R. Pollack and W. Steiger"
+, booktitle =   "Discrete and Computational Geometry: Papers from the DIMACS Special Year"
+, publisher =   "American Mathematical Society, Association for Computing Machinery"
+, year =        1991
+, pages =       "273--285"
+, comments =    "survey paper, geometric graphs"
+, update =      "99.11 bibrelex, 97.07 agarwal"
 }
 
 @article{p-ip-78
-, author =	"J. Pach"
-, title =	"On an isoperimetric problem"
-, journal =	"Studia Sci. Math. Hungar."
-, volume =	13
-, year =	1978
-, pages =	"43--45"
+, author =      "J. Pach"
+, title =       "On an isoperimetric problem"
+, journal =     "Studia Sci. Math. Hungar."
+, volume =      13
+, year =        1978
+, pages =       "43--45"
 }
 
 @inproceedings{p-ssp-98
-, author =	"J{\'a}nos Pach"
-, title =	"Systems of Segments in the Plane"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"5--6"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "J{\'a}nos Pach"
+, title =       "Systems of Segments in the Plane"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "5--6"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @book{pa-cg-95
-, author =	"Janos Pach and Pankaj K. Agarwal"
-, title =	"Combinatorial Geometry"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1995
-, isbn =	"0-471-58890-3"
-, update =	"96.05 agarwal+smid, 95.09 mitchell, 95.05 orourke"
+, author =      "Janos Pach and Pankaj K. Agarwal"
+, title =       "Combinatorial Geometry"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1995
+, isbn =        "0-471-58890-3"
+, update =      "96.05 agarwal+smid, 95.09 mitchell, 95.05 orourke"
 }
 
 @inproceedings{ppw-wplls-90
-, author =	"J. Pach and R. Pollack and Emo Welzl"
-, title =	"Weaving patterns of lines and line segments in space"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"439--446"
-, update =	"98.03 mitchell"
+, author =      "J. Pach and R. Pollack and Emo Welzl"
+, title =       "Weaving patterns of lines and line segments in space"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "439--446"
+, update =      "98.03 mitchell"
 }
 
 @article{ppw-wplls-93
-, author =	"J. Pach and R. Pollack and Emo Welzl"
-, title =	"Weaving Patterns of Lines and Line Segments in Space"
-, journal =	"Algorithmica"
-, volume =	9
-, year =	1993
-, pages =	"561--571"
-, update =	"98.03 mitchell, 97.03 gaertner+salinger"
+, author =      "J. Pach and R. Pollack and Emo Welzl"
+, title =       "Weaving Patterns of Lines and Line Segments in Space"
+, journal =     "Algorithmica"
+, volume =      9
+, year =        1993
+, pages =       "561--571"
+, update =      "98.03 mitchell, 97.03 gaertner+salinger"
 }
 
 @article{pr-cpls-98
-, author =	"J{\'a}nos Pach and Eduardo Rivera-Campo"
-, title =	"On circumscribing polygons for line segments"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"121--124"
-, update =	"98.11 devillers"
+, author =      "J{\'a}nos Pach and Eduardo Rivera-Campo"
+, title =       "On circumscribing polygons for line segments"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "121--124"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{pss-ucc3d-01
-, author =	"Janos Pach and Ido Safruit and Micha Sharir"
-, title =	"The union of congruent cubes in three dimensions"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
-, year =	2001
-, pages =	"19--28"
-, update =	"01.07 orourke"
+, author =      "Janos Pach and Ido Safruit and Micha Sharir"
+, title =       "The union of congruent cubes in three dimensions"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Comput. Geom."
+, year =        2001
+, pages =       "19--28"
+, update =      "01.07 orourke"
 }
 
 @inproceedings{pss-acn-94
-, author =	"J. Pach and F. Shahrokhi and M. Szegedy"
-, title =	"Applications of the Crossing Number"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"198--202"
-, cites =	"ddsv-espgt-88, e-sdnp-46, gm-psen-90, gkk-fdsp-, hp-an1-34, k-epcg-79, l-civ-83, lt-stpg-79, m-fsscs-86, op-eggnv-91, p-nggt-91, pt-sgadt-93, s-jttm-87, sw-cplh-94, u-cav-84, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "J. Pach and F. Shahrokhi and M. Szegedy"
+, title =       "Applications of the Crossing Number"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "198--202"
+, cites =       "ddsv-espgt-88, e-sdnp-46, gm-psen-90, gkk-fdsp-, hp-an1-34, k-epcg-79, l-civ-83, lt-stpg-79, m-fsscs-86, op-eggnv-91, p-nggt-91, pt-sgadt-93, s-jttm-87, sw-cplh-94, u-cav-84, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @article{pss-acn-96
-, author =	"J. Pach and F. Shahrokhi and M. Szegedy"
-, title =	"Applications of the Crossing Number"
-, journal =	"Algorithmica"
-, volume =	16
-, year =	1996
-, pages =	"111--117"
-, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
-, keywords =	"graph drawing, straight-line, geometric graph theory"
-, succeeds =	"pss-acn-94"
-, update =	"96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
+, author =      "J. Pach and F. Shahrokhi and M. Szegedy"
+, title =       "Applications of the Crossing Number"
+, journal =     "Algorithmica"
+, volume =      16
+, year =        1996
+, pages =       "111--117"
+, note =        "(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
+, keywords =    "graph drawing, straight-line, geometric graph theory"
+, succeeds =    "pss-acn-94"
+, update =      "96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
 }
 
 @article{ps-bupcs-99
-, author =	"J. Pach and M. Sharir"
-, title =	"On the Boundary of the Union of Planar Convex Sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	21
-, year =	1999
-, pages =	"321--328"
-, succeeds =	"ps-rivbu-97"
-, update =	"00.03 bibrelex, 98.03 agarwal"
+, author =      "J. Pach and M. Sharir"
+, title =       "On the Boundary of the Union of Planar Convex Sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      21
+, year =        1999
+, pages =       "321--328"
+, succeeds =    "ps-rivbu-97"
+, update =      "00.03 bibrelex, 98.03 agarwal"
 }
 
 @article{ps-nibpc-98
-, author =	"J. Pach and M. Sharir"
-, title =	"On the number of incidences between points and curves"
-, journal =	"Combinatorics, Probability, and Computing"
-, volume =	7
-, year =	1998
-, pages =	"in press"
-, update =	"98.03 agarwal"
+, author =      "J. Pach and M. Sharir"
+, title =       "On the number of incidences between points and curves"
+, journal =     "Combinatorics, Probability, and Computing"
+, volume =      7
+, year =        1998
+, pages =       "in press"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{ps-vvasq-89
-, author =	"J. Pach and Micha Sharir"
-, title =	"On vertical visibility in arrangements of segments and the queue size in the {Bentley}-{Ottman} line sweeping algorithm"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	48
-, precedes =	"ps-vvasq-91"
-, update =	"98.03 mitchell"
+, author =      "J. Pach and Micha Sharir"
+, title =       "On vertical visibility in arrangements of segments and the queue size in the {Bentley}-{Ottman} line sweeping algorithm"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       48
+, precedes =    "ps-vvasq-91"
+, update =      "98.03 mitchell"
 }
 
 @article{ps-vvasq-91
-, author =	"J. Pach and Micha Sharir"
-, title =	"On vertical visibility in arrangements of segments and the queue size in the {Bentley}-{Ottmann} line sweeping algorithm"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, year =	1991
-, pages =	"460--470"
-, succeeds =	"ps-vvasq-89"
-, update =	"98.03 mitchell, 97.11 icking"
+, author =      "J. Pach and Micha Sharir"
+, title =       "On vertical visibility in arrangements of segments and the queue size in the {Bentley}-{Ottmann} line sweeping algorithm"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, year =        1991
+, pages =       "460--470"
+, succeeds =    "ps-vvasq-89"
+, update =      "98.03 mitchell, 97.11 icking"
 }
 
 @techreport{ps-rivbu-97
-, author =	"Janos Pach and Micha Sharir"
-, title =	"Regular and Irregular Vertices on the Boundary of the Union of Planar Convex Sets"
-, type =	"Manuscript"
-, institution =	"Tel Aviv University"
-, year =	1997
-, precedes =	"ps-bupcs-99"
-, update =	"00.03 bibrelex, 98.03 mitchell"
+, author =      "Janos Pach and Micha Sharir"
+, title =       "Regular and Irregular Vertices on the Boundary of the Union of Planar Convex Sets"
+, type =        "Manuscript"
+, institution = "Tel Aviv University"
+, year =        1997
+, precedes =    "ps-bupcs-99"
+, update =      "00.03 bibrelex, 98.03 mitchell"
 }
 
 @techreport{ps-raprp-90
-, author =	"J. Pach and Micha Sharir"
-, title =	"Repeated Angles in the Plane and Related Problems"
-, type =	"Technical {Report}"
-, number =	"90-10"
-, institution =	"DIMACS, Rutgers Univ."
-, year =	1990
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "J. Pach and Micha Sharir"
+, title =       "Repeated Angles in the Plane and Related Problems"
+, type =        "Technical {Report}"
+, number =      "90-10"
+, institution = "DIMACS, Rutgers Univ."
+, year =        1990
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @article{ps-raprp-92
-, author =	"J. Pach and Micha Sharir"
-, title =	"Repeated angles in the plane and related problems"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	59
-, year =	1992
-, pages =	"12--22"
-, update =	"98.03 mitchell"
+, author =      "J. Pach and Micha Sharir"
+, title =       "Repeated angles in the plane and related problems"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      59
+, year =        1992
+, pages =       "12--22"
+, update =      "98.03 mitchell"
 }
 
 @techreport{ps-ueplf-87
-, author =	"J. Pach and Micha Sharir"
-, title =	"The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis"
-, type =	"Report"
-, number =	279
-, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1987
-, precedes =	"ps-ueplf-89"
-, update =	"98.03 agarwal+mitchell"
+, author =      "J. Pach and Micha Sharir"
+, title =       "The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis"
+, type =        "Report"
+, number =      279
+, institution = "Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1987
+, precedes =    "ps-ueplf-89"
+, update =      "98.03 agarwal+mitchell"
 }
 
 @article{ps-ueplf-89
-, author =	"J. Pach and Micha Sharir"
-, title =	"The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: combinatorial analysis"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"291--309"
-, keywords =	"upper envelope"
-, succeeds =	"ps-ueplf-87"
-, update =	"98.03 mitchell"
+, author =      "J. Pach and Micha Sharir"
+, title =       "The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: combinatorial analysis"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "291--309"
+, keywords =    "upper envelope"
+, succeeds =    "ps-ueplf-87"
+, update =      "98.03 mitchell"
 }
 
 @article{pst-nbcn-00
-, author =	"J. Pach and J. Spencer and G. T\'{o}th"
-, title =	"New Bounds on Crossing Numbers"
-, journal =	"Discrete Comput. Geom."
-, volume =	24
-, year =	2000
-, pages =	"623--644"
-, update =	"01.04 pocchiola"
+, author =      "J. Pach and J. Spencer and G. T\'{o}th"
+, title =       "New Bounds on Crossing Numbers"
+, journal =     "Discrete Comput. Geom."
+, volume =      24
+, year =        2000
+, pages =       "623--644"
+, update =      "01.04 pocchiola"
 }
 
 @inproceedings{pss-ubnpk-89
-, author =	"J. Pach and W. Steiger and E. Szemer{\'e}di"
-, title =	"An upper bound on the number of planar $k$-sets"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"72--79"
-, precedes =	"pss-ubnpk-92"
+, author =      "J. Pach and W. Steiger and E. Szemer{\'e}di"
+, title =       "An upper bound on the number of planar $k$-sets"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "72--79"
+, precedes =    "pss-ubnpk-92"
 }
 
 @techreport{pss-ubnpk-90
-, author =	"J. Pach and W. Steiger and E. Szemeredi"
-, title =	"An Upper Bound on the Number of Planar $k$-Sets"
-, type =	"Technical {Report}"
-, number =	"90-12"
-, institution =	"DIMACS, Rutgers Univ."
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "J. Pach and W. Steiger and E. Szemeredi"
+, title =       "An Upper Bound on the Number of Planar $k$-Sets"
+, type =        "Technical {Report}"
+, number =      "90-12"
+, institution = "DIMACS, Rutgers Univ."
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @article{pss-ubnpk-92
-, author =	"J. Pach and W. Steiger and E. Szemer{\'e}di"
-, title =	"An upper bound on the number of planar $k$-sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"109--123"
-, succeeds =	"pss-ubnpk-89"
-, update =	"93.05 jones"
-, annote =	"bound of $O(n \sqrt{k} / \log^* k)$ for any planar
+, author =      "J. Pach and W. Steiger and E. Szemer{\'e}di"
+, title =       "An upper bound on the number of planar $k$-sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "109--123"
+, succeeds =    "pss-ubnpk-89"
+, update =      "93.05 jones"
+, annote =      "bound of $O(n \sqrt{k} / \log^* k)$ for any planar
 configuration of size $n$"
 }
 
 @inproceedings{pt-cg-00
-, author =	"J{\'a}nos Pach and G{\'a}bor Tardos"
-, title =	"Cutting Glass"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"360--369"
-, update =	"00.11 jones"
+, author =      "J{\'a}nos Pach and G{\'a}bor Tardos"
+, title =       "Cutting Glass"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "360--369"
+, update =      "00.11 jones"
 }
 
 @inproceedings{ptt-tdgdg-97
-, author =	"J{\'a}nos Pach and Torsten Thiele and G{\'e}za T{\'o}th"
-, title =	"Three-dimensional Grid Drawings of Graphs"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"47--51"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "J{\'a}nos Pach and Torsten Thiele and G{\'e}za T{\'o}th"
+, title =       "Three-dimensional Grid Drawings of Graphs"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "47--51"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{pt-sgadt-93
-, author =	"J. Pach and J. T{\"o}r{\H o}csik"
-, title =	"Some geometric applications of {Dilworth's} theorem"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"264--279"
-, cites =	"acns-cfs-82, ae-degg-89, ah-g-66, clr-ia-90, d-dtpos-50, dsw-bvcnh-, e-sdnp-46, es-cpg-35, gkk-fdsp-, grs-rt-90, gl-ccpri-85, hp-an1-34, k-epcg-79, lmpt-rtrpc-94, op-eggnv-91, r-pfl-30, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "J. Pach and J. T{\"o}r{\H o}csik"
+, title =       "Some geometric applications of {Dilworth's} theorem"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "264--279"
+, cites =       "acns-cfs-82, ae-degg-89, ah-g-66, clr-ia-90, d-dtpos-50, dsw-bvcnh-, e-sdnp-46, es-cpg-35, gkk-fdsp-, grs-rt-90, gl-ccpri-85, hp-an1-34, k-epcg-79, lmpt-rtrpc-94, op-eggnv-91, r-pfl-30, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @techreport{pt-gdfcp-96
-, author =	"J. Pach and G. Toth"
-, title =	"Graphs drawn with few crossings per edge"
-, type =	"Preprint"
-, institution =	"??"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "J. Pach and G. Toth"
+, title =       "Graphs drawn with few crossings per edge"
+, type =        "Preprint"
+, institution = "??"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @article{pw-epgfv-01
-, author =	"Janos Pach and Rephael Wenger"
-, title =	"Embedding planar graphs at fixed vertex locations"
-, journal =	"Graphs Combin."
-, volume =	17
-, year =	2001
-, pages =	"717--728"
-, update =	"02.03 wenger"
+, author =      "Janos Pach and Rephael Wenger"
+, title =       "Embedding planar graphs at fixed vertex locations"
+, journal =     "Graphs Combin."
+, volume =      17
+, year =        2001
+, pages =       "717--728"
+, update =      "02.03 wenger"
 }
 
 @techreport{pw-snben-89
-, author =	"J. Pach and G. Woeginger"
-, title =	"Some new bounds for epsilon-nets"
-, type =	"Report"
-, number =	"B-89-08 Serie B"
-, institution =	"Freie Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "J. Pach and G. Woeginger"
+, title =       "Some new bounds for epsilon-nets"
+, type =        "Report"
+, number =      "B-89-08 Serie B"
+, institution = "Freie Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{pw-snben-90
-, author =	"J. Pach and G. Woeginger"
-, title =	"Some new bounds for epsilon-nets"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"10--15"
-, precedes =	"kpw-atben-92"
-, cites =	"a-dapal-89, behw-clgcv-89, cf-dvrsi-88, cw-qorss-89, c-narsc-87, cegsw-ccbac-88, e-acg-87, hw-ensrq-87, m-cen-89, msw-hnlls-90, p-cpcp-86, ZZZ"
-, update =	"97.11 bibrelex, 93.09 rote"
+, author =      "J. Pach and G. Woeginger"
+, title =       "Some new bounds for epsilon-nets"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "10--15"
+, precedes =    "kpw-atben-92"
+, cites =       "a-dapal-89, behw-clgcv-89, cf-dvrsi-88, cw-qorss-89, c-narsc-87, cegsw-ccbac-88, e-acg-87, hw-ensrq-87, m-cen-89, msw-hnlls-90, p-cpcp-86, ZZZ"
+, update =      "97.11 bibrelex, 93.09 rote"
 }
 
 @inproceedings{ph-srr-01
-, author =	"Eli Packer and Dan Halperin"
-, title =	"Snap Rounding Revisited"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"82--85"
-, update =	"01.04 icking"
+, author =      "Eli Packer and Dan Halperin"
+, title =       "Snap Rounding Revisited"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "82--85"
+, update =      "01.04 icking"
 }
 
 @book{p-gg5-95
-, title =	"Graphics Gems V"
-, editor =	"Alan W. Paeth"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1995
-, isbn =	"0-12-543455-3"
-, update =	"98.07 vismara, 95.09 mitchell"
+, title =       "Graphics Gems V"
+, editor =      "Alan W. Paeth"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1995
+, isbn =        "0-12-543455-3"
+, update =      "98.07 vismara, 95.09 mitchell"
 }
 
 @incollection{p-itsh-94
-, author =	"Alan W. Paeth"
-, title =	"Ideal Tiles for Shading and Halftoning"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"486--492"
-, keywords =	"bitblt, dither, stipple"
-, update =	"94.09 heckbert"
-, annote =	"Discusses heuristics and design techniques for top-quality
+, author =      "Alan W. Paeth"
+, title =       "Ideal Tiles for Shading and Halftoning"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "486--492"
+, keywords =    "bitblt, dither, stipple"
+, update =      "94.09 heckbert"
+, annote =      "Discusses heuristics and design techniques for top-quality
 dither and stipple patterns."
 }
 
 @article{p-mstcm-74
-, author =	"Page"
-, title =	"A minimum spanning tree clustering method"
-, journal =	"Commun. ACM"
-, volume =	17
-, number =	6
-, year =	1974
-, update =	"97.11 bibrelex"
+, author =      "Page"
+, title =       "A minimum spanning tree clustering method"
+, journal =     "Commun. ACM"
+, volume =      17
+, number =      6
+, year =        1974
+, update =      "97.11 bibrelex"
 }
 
 @incollection{pst-ttso-93
-, author =	"B.-U. Pagel and H.-W. Six and H. Toben"
-, title =	"The transformation technique for spatial objects revisited"
-, booktitle =	"Proc. 3rd Intl. Symp. on Large Spatial Databases"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	692
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"73--88"
-, update =	"97.07 agarwal"
+, author =      "B.-U. Pagel and H.-W. Six and H. Toben"
+, title =       "The transformation technique for spatial objects revisited"
+, booktitle =   "Proc. 3rd Intl. Symp. on Large Spatial Databases"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      692
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "73--88"
+, update =      "97.07 agarwal"
 }
 
 @article{pr-cpm-00
-, author =	"R. Pajarola and J. Rossignac"
-, title =	"Compressed progressive meshes"
-, journal =	"IEEE Transactions on Visualization and Computer Graphics"
-, volume =	6
-, number =	1
-, year =	2000
-, pages =	"79--93"
-, update =	"01.07 devillers"
+, author =      "R. Pajarola and J. Rossignac"
+, title =       "Compressed progressive meshes"
+, journal =     "IEEE Transactions on Visualization and Computer Graphics"
+, volume =      6
+, number =      1
+, year =        2000
+, pages =       "79--93"
+, update =      "01.07 devillers"
 }
 
 @phdthesis{p-wvrp-90
-, author =	"S. P. Pal"
-, title =	"Weak Visibility and Related Problems in simple polygons"
-, type =	"Ph.{D}. Thesis"
-, school =	"Indian Inst. Science"
-, year =	1990
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex, 94.05 ghosh"
+, author =      "S. P. Pal"
+, title =       "Weak Visibility and Related Problems in simple polygons"
+, type =        "Ph.{D}. Thesis"
+, school =      "Indian Inst. Science"
+, year =        1990
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex, 94.05 ghosh"
 }
 
 @inproceedings{pdv-oppt-90
-, author =	"S. P. Pal and B. DasGupta and C. E. {Veni Madhavan}"
-, title =	"Optimal polygon placement by translation"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"164--171"
-, cites =	"ab-scsp-87, bfm-pct-86, c-pcp-83, ce-oails-88, f-fapct-85, gjpt-tsp-78, l-spcsa-83, lw-apcfp-79, pdv-oppt-90t, ps-cgi-85, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. P. Pal and B. DasGupta and C. E. {Veni Madhavan}"
+, title =       "Optimal polygon placement by translation"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "164--171"
+, cites =       "ab-scsp-87, bfm-pct-86, c-pcp-83, ce-oails-88, f-fapct-85, gjpt-tsp-78, l-spcsa-83, lw-apcfp-79, pdv-oppt-90t, ps-cgi-85, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{pdv-oppt-90t
-, author =	"S. P. Pal and C. E. Dasgupta and C. E. {Veni Madhavan}"
-, title =	"Optimal polygon placement by translation"
-, type =	"Technical {Report}"
-, number =	"IIsc-CSA-90-7"
-, institution =	"Department of Computer Science and Automation, Indian Institute of Science"
-, address =	"Bangalore, India"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "S. P. Pal and C. E. Dasgupta and C. E. {Veni Madhavan}"
+, title =       "Optimal polygon placement by translation"
+, type =        "Technical {Report}"
+, number =      "IIsc-CSA-90-7"
+, institution = "Department of Computer Science and Automation, Indian Institute of Science"
+, address =     "Bangalore, India"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @article{pr-dhsac-90
-, author =	"Oscar Palacios-Velez and Baltasar Cuevas Renaud"
-, title =	"Dynamic Hierarchical Subdivision Algorithm For Computing {Delaunay} Triangulations And Other Closest-Point Problems"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	16
-, number =	3
-, month =	sep
-, year =	1990
-, pages =	"275--292"
-, keywords =	"search methods, closest point problems, computational geometry, Delaunay triangulation, hierarchical search, mathematical software"
-, annote =	"By keeping around all the triangles formed in the
-		 incremental algorithm, $O(\log n)$ search time is
-		 obtained, at the cost of 3 times as much space. (And
-		 worst case space is quadratic.)"
-, abstract =	"A new, dynamic, hierarchical subdivision and recursive
-		 algorithm for computing Delaunay triangulations is
-		 presented. The algorithm has four main steps: (1)
-		 location of the already formed triangle that contains
-		 the point to be inserted, (2) identification of other
-		 adjoining triangles whose circumcircle contains the
-		 point, (3) formation of the new triangles, and (4)
-		 database update. Different search procedures are
-		 analyzed. It is shown that the 'oriented walk' search
-		 has a better performance than the asymptotically
-		 optimal 'hierarchical subdivision' search, when the
-		 total number of points is less than 417 or when the
-		 points are presorted by distance or coordinates. The
-		 algorithm has point-deletion capabilities which are
-		 discussed in detail. (Author abstract) 25 Refs."
+, author =      "Oscar Palacios-Velez and Baltasar Cuevas Renaud"
+, title =       "Dynamic Hierarchical Subdivision Algorithm For Computing {Delaunay} Triangulations And Other Closest-Point Problems"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      16
+, number =      3
+, month =       sep
+, year =        1990
+, pages =       "275--292"
+, keywords =    "search methods, closest point problems, computational geometry, Delaunay triangulation, hierarchical search, mathematical software"
+, annote =      "By keeping around all the triangles formed in the
+                 incremental algorithm, $O(\log n)$ search time is
+                 obtained, at the cost of 3 times as much space. (And
+                 worst case space is quadratic.)"
+, abstract =    "A new, dynamic, hierarchical subdivision and recursive
+                 algorithm for computing Delaunay triangulations is
+                 presented. The algorithm has four main steps: (1)
+                 location of the already formed triangle that contains
+                 the point to be inserted, (2) identification of other
+                 adjoining triangles whose circumcircle contains the
+                 point, (3) formation of the new triangles, and (4)
+                 database update. Different search procedures are
+                 analyzed. It is shown that the 'oriented walk' search
+                 has a better performance than the asymptotically
+                 optimal 'hierarchical subdivision' search, when the
+                 total number of points is less than 417 or when the
+                 points are presorted by distance or coordinates. The
+                 algorithm has point-deletion capabilities which are
+                 discussed in detail. (Author abstract) 25 Refs."
 }
 
 @inproceedings{ps-crrbs-93
-, author =	"Larry Palazzi and Jack Snoeyink"
-, title =	"Counting and Reporting Red/Blue Segment Intersections"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"530--540"
-, update =	"96.05 agarwal, 93.09 smid, 93.05 jones"
+, author =      "Larry Palazzi and Jack Snoeyink"
+, title =       "Counting and Reporting Red/Blue Segment Intersections"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "530--540"
+, update =      "96.05 agarwal, 93.09 smid, 93.05 jones"
 }
 
 @article{ps-crrbs-94
-, author =	"L. Palazzi and J. Snoeyink"
-, title =	"Counting and reporting red/blue segment intersections"
-, journal =	"CVGIP: Graph. Models Image Process."
-, volume =	56
-, number =	4
-, year =	1994
-, pages =	"304--311"
-, update =	"98.03 bibrelex"
+, author =      "L. Palazzi and J. Snoeyink"
+, title =       "Counting and reporting red/blue segment intersections"
+, journal =     "CVGIP: Graph. Models Image Process."
+, volume =      56
+, number =      4
+, year =        1994
+, pages =       "304--311"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{p-ltaco-01
-, author =	"Leonidas Palios"
-, title =	"A Linear-Time Algorithm to Compute the Optimal Bridge Connecting Two Disjoint Convex Polygons"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"48--52"
-, update =	"01.04 icking"
+, author =      "Leonidas Palios"
+, title =       "A Linear-Time Algorithm to Compute the Optimal Bridge Connecting Two Disjoint Convex Polygons"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "48--52"
+, update =      "01.04 icking"
 }
 
 @inproceedings{p-nep-94
-, author =	"L. Palios"
-, title =	"On the Number of Extrema of a Polyhedron"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"320--325"
-, cites =	"bd-cdpr-92, cp-tncp-90, cp-dbnp-92, cs-bst-94, m-mdscg-84, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "L. Palios"
+, title =       "On the Number of Extrema of a Polyhedron"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "320--325"
+, cites =       "bd-cdpr-92, cp-tncp-90, cp-dbnp-92, cs-bst-94, m-mdscg-84, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @techreport{p-ot3dr-94t
-, author =	"L. Palios"
-, title =	"Optimal Tetrahedralization of the 3d-region 'between' a Convex Polyhedron and a Convex Polygon"
-, type =	"Research Report"
-, institution =	"The Geometry Center, University of Minnesota"
-, year =	1994
-, succeeds =	"p-ot3dr-94"
-, update =	"98.11 bibrelex"
+, author =      "L. Palios"
+, title =       "Optimal Tetrahedralization of the 3d-region 'between' a Convex Polyhedron and a Convex Polygon"
+, type =        "Research Report"
+, institution = "The Geometry Center, University of Minnesota"
+, year =        1994
+, succeeds =    "p-ot3dr-94"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{p-ot3dr-94
-, author =	"L. Palios"
-, title =	"Optimal Tetrahedralization of the $3$d Region ``Between'' a Convex Polyhedron and a Convex Polygon"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"350--356"
-, precedes =	"p-ot3dr-96, p-ot3dr-94t"
-, cites =	"b-prcv-75, b-ct-93, be-mgot-92t, cs-bst-94, e-acg-87, gp-cdpb-88, p-ot3dr-94t, mp-fitcp-78, ps-cgi-85, gs-pmgsc-85, ZZZ"
-, update =	"98.11 bibrelex, 97.03 devillers+smid, 94.09 jones"
+, author =      "L. Palios"
+, title =       "Optimal Tetrahedralization of the $3$d Region ``Between'' a Convex Polyhedron and a Convex Polygon"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "350--356"
+, precedes =    "p-ot3dr-96, p-ot3dr-94t"
+, cites =       "b-prcv-75, b-ct-93, be-mgot-92t, cs-bst-94, e-acg-87, gp-cdpb-88, p-ot3dr-94t, mp-fitcp-78, ps-cgi-85, gs-pmgsc-85, ZZZ"
+, update =      "98.11 bibrelex, 97.03 devillers+smid, 94.09 jones"
 }
 
 @article{p-ot3dr-96
-, author =	"L. Palios"
-, title =	"Optimal Tetrahedralization of the $3$d Region ``Between'' a Convex Polyhedron and a Convex Polygon"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"263--276"
-, succeeds =	"p-ot3dr-94"
-, update =	"97.03 devillers+smid"
+, author =      "L. Palios"
+, title =       "Optimal Tetrahedralization of the $3$d Region ``Between'' a Convex Polyhedron and a Convex Polygon"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "263--276"
+, succeeds =    "p-ot3dr-94"
+, update =      "97.03 devillers+smid"
 }
 
 @article{pg-cdaus-95
-, author =	"I. J. Palmer and R. L. Grimsdale"
-, title =	"Collision Detection for Animation Using Sphere-Trees"
-, journal =	"Comput. Graph. Forum"
-, volume =	14
-, number =	2
-, month =	jun
-, year =	1995
-, pages =	"105--116"
-, update =	"96.01 held"
+, author =      "I. J. Palmer and R. L. Grimsdale"
+, title =       "Collision Detection for Animation Using Sphere-Trees"
+, journal =     "Comput. Graph. Forum"
+, volume =      14
+, number =      2
+, month =       jun
+, year =        1995
+, pages =       "105--116"
+, update =      "96.01 held"
 }
 
 @phdthesis{p-ccmsp-87
-, author =	"R. S. Palmer"
-, title =	"Computational Complexity of Motion and Stablility of Polygons"
-, school =	"Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	jan
-, year =	1987
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "R. S. Palmer"
+, title =       "Computational Complexity of Motion and Stablility of Polygons"
+, school =      "Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       jan
+, year =        1987
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{pr-epsls-85
-, author =	"V. Pan and J. Reif"
-, title =	"Efficient parallel solution of linear systems"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
-, year =	1985
-, pages =	"143--152"
-, update =	"98.03 bibrelex"
+, author =      "V. Pan and J. Reif"
+, title =       "Efficient parallel solution of linear systems"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Theory Comput."
+, year =        1985
+, pages =       "143--152"
+, update =      "98.03 bibrelex"
 }
 
 @article{p-pcpgs-96
-, author =	"V. Y. Pan"
-, title =	"Parallel computation of polynomial {GCD} and some related parallel computations over abstract fields"
-, journal =	"Theoret. Comput. Sci."
-, volume =	162
-, number =	2
-, year =	1996
-, pages =	"173--223"
-, update =	"98.07 bibrelex"
+, author =      "V. Y. Pan"
+, title =       "Parallel computation of polynomial {GCD} and some related parallel computations over abstract fields"
+, journal =     "Theoret. Comput. Sci."
+, volume =      162
+, number =      2
+, year =        1996
+, pages =       "173--223"
+, update =      "98.07 bibrelex"
 }
 
 @article{pys-antcm-97
-, author =	"V. Y. Pan and Y. Yu and C. Steward"
-, title =	"Algebraic and numerical techniques for the computation of matrix determinants"
-, journal =	"Comput. Math. Appl."
-, volume =	"??"
-, year =	1997
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "V. Y. Pan and Y. Yu and C. Steward"
+, title =       "Algebraic and numerical techniques for the computation of matrix determinants"
+, journal =     "Comput. Math. Appl."
+, volume =      "??"
+, year =        1997
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{pd-nodec-95
-, author =	"A. Panconesi and D. Dubhashi"
-, title =	"Near optimal distributed edge coloring"
-, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	979
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"448--459"
-, update =	"97.03 gaertner+salinger"
+, author =      "A. Panconesi and D. Dubhashi"
+, title =       "Near optimal distributed edge coloring"
+, booktitle =   "Proc. 3rd Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      979
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "448--459"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{ps-lndci-95
-, author =	"A. Panconesi and A. Srinivasan"
-, title =	"The local nature of $\Delta$-colorings and its algorithmic applications"
-, journal =	"Combinatorica"
-, volume =	15
-, year =	1995
-, pages =	"255--280"
-, update =	"97.03 gaertner+salinger"
+, author =      "A. Panconesi and A. Srinivasan"
+, title =       "The local nature of $\Delta$-colorings and its algorithmic applications"
+, journal =     "Combinatorica"
+, volume =      15
+, year =        1995
+, pages =       "255--280"
+, update =      "97.03 gaertner+salinger"
 }
 
 @techreport{p-s3dps-85
-, author =	"A. T. Pang"
-, title =	"Solid: a $3$-d polygon surface program"
-, type =	"Report"
-, number =	"??"
-, institution =	"MPDI Medical Sci. Center"
-, year =	1985
+, author =      "A. T. Pang"
+, title =       "Solid: a $3$-d polygon surface program"
+, type =        "Report"
+, number =      "??"
+, institution = "MPDI Medical Sci. Center"
+, year =        1985
 }
 
 @article{pbcf-dimsc-93
-, author =	"A. Paoluzzi and F. Bernardini and C. Cattani and V. Ferrucci"
-, title =	"Dimension-independent modeling with simplical complexes"
-, journal =	"ACM Trans. Graph."
-, volume =	12
-, number =	1
-, month =	jan
-, year =	1993
-, pages =	"56--102"
-, update =	"97.11 bibrelex"
+, author =      "A. Paoluzzi and F. Bernardini and C. Cattani and V. Ferrucci"
+, title =       "Dimension-independent modeling with simplical complexes"
+, journal =     "ACM Trans. Graph."
+, volume =      12
+, number =      1
+, month =       jan
+, year =        1993
+, pages =       "56--102"
+, update =      "97.11 bibrelex"
 }
 
 @article{pp-dmtvr-90
-, author =	"N. Papadakis and A. Perakis"
-, title =	"Deterministic Minimal Time Vessel Routing"
-, journal =	"Oper. Res."
-, volume =	38
-, number =	3
-, year =	1990
-, pages =	"426--438"
+, author =      "N. Papadakis and A. Perakis"
+, title =       "Deterministic Minimal Time Vessel Routing"
+, journal =     "Oper. Res."
+, volume =      38
+, number =      3
+, year =        1990
+, pages =       "426--438"
 }
 
 @article{pp-mtvrt-89
-, author =	"N. Papadakis and A. Perakis"
-, title =	"Minimal Time Vessel Routing in a Time-Dependent Environment"
-, journal =	"Transp. Sci."
-, volume =	23
-, number =	4
-, year =	1989
-, pages =	"266--276"
+, author =      "N. Papadakis and A. Perakis"
+, title =       "Minimal Time Vessel Routing in a Time-Dependent Environment"
+, journal =     "Transp. Sci."
+, volume =      23
+, number =      4
+, year =        1989
+, pages =       "266--276"
 }
 
 @inproceedings{p-dmabq-95
-, author =	"C. Papadimitriou"
-, title =	"Database Metatheory: Asking the Big Queries"
-, booktitle =	"Proc. Principles of Distributed Systems"
-, year =	1995
-, pages =	"1--10"
-, comments =	"addresses relationship between theory and practice in computer science"
-, update =	"96.05 ramkumar"
+, author =      "C. Papadimitriou"
+, title =       "Database Metatheory: Asking the Big Queries"
+, booktitle =   "Proc. Principles of Distributed Systems"
+, year =        1995
+, pages =       "1--10"
+, comments =    "addresses relationship between theory and practice in computer science"
+, update =      "96.05 ramkumar"
 }
 
 @article{pt-ipct-86
-, author =	"C. Papadimitriou and J. Tsitsiklis"
-, title =	"Intractable Problems in Control Theory"
-, journal =	"SIAM J. Control Optimization"
-, volume =	24
-, number =	4
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "C. Papadimitriou and J. Tsitsiklis"
+, title =       "Intractable Problems in Control Theory"
+, journal =     "SIAM J. Control Optimization"
+, volume =      24
+, number =      4
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @article{p-aspmt-85
-, author =	"C. H. Papadimitriou"
-, title =	"An algorithm for shortest-path motion in three dimensions"
-, journal =	"Inform. Process. Lett."
-, volume =	20
-, year =	1985
-, pages =	"259--263"
-, keywords =	"motion planning, path planning, geodesic distance, shortest paths"
+, author =      "C. H. Papadimitriou"
+, title =       "An algorithm for shortest-path motion in three dimensions"
+, journal =     "Inform. Process. Lett."
+, volume =      20
+, year =        1985
+, pages =       "259--263"
+, keywords =    "motion planning, path planning, geodesic distance, shortest paths"
 }
 
 @book{p-cc-94
-, author =	"C. H. Papadimitriou"
-, title =	"Computational Complexity"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1994
-, keywords =	"complexity theory"
-, update =	"97.03 schwarzkopf, 96.09 agarwal"
+, author =      "C. H. Papadimitriou"
+, title =       "Computational Complexity"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1994
+, keywords =    "complexity theory"
+, update =      "97.03 schwarzkopf, 96.09 agarwal"
 }
 
 @techreport{p-cpav-91
-, author =	"C. H. Papadimitriou"
-, title =	"On certain problems in algorithmic vision"
-, type =	"Technical {Report}"
-, institution =	"UCSD"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "C. H. Papadimitriou"
+, title =       "On certain problems in algorithmic vision"
+, type =        "Technical {Report}"
+, institution = "UCSD"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @incollection{p-spm-86
-, author =	"C. H. Papadimitriou"
-, title =	"Shortest-Path Motion"
-, editor =	"G. Goos and J. Hartmanis"
-, booktitle =	"Proc. Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	"??"
-, publisher =	"Springer-Verlag"
-, month =	dec
-, year =	1986
-, update =	"93.09 milone+mitchell"
+, author =      "C. H. Papadimitriou"
+, title =       "Shortest-Path Motion"
+, editor =      "G. Goos and J. Hartmanis"
+, booktitle =   "Proc. Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      "??"
+, publisher =   "Springer-Verlag"
+, month =       dec
+, year =        1986
+, update =      "93.09 milone+mitchell"
 }
 
 @article{p-etspi-77
-, author =	"C. H. Papadimitriou"
-, title =	"The {Euclidean} traveling salesman problem is {NP}-complete"
-, journal =	"Theoret. Comput. Sci."
-, volume =	4
-, year =	1977
-, pages =	"237--244"
-, succeeds =	"ps-clsts-77"
+, author =      "C. H. Papadimitriou"
+, title =       "The {Euclidean} traveling salesman problem is {NP}-complete"
+, journal =     "Theoret. Comput. Sci."
+, volume =      4
+, year =        1977
+, pages =       "237--244"
+, succeeds =    "ps-clsts-77"
 }
 
 @article{p-ncbmp-76
-, author =	"C. H. Papadimitriou"
-, title =	"The {NP}-completeness of the bandwidth minimization problem"
-, journal =	"Computing"
-, volume =	16
-, year =	1976
-, pages =	"263--270"
-, update =	"97.11 bibrelex"
+, author =      "C. H. Papadimitriou"
+, title =       "The {NP}-completeness of the bandwidth minimization problem"
+, journal =     "Computing"
+, volume =      16
+, year =        1976
+, pages =       "263--270"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{p-pamh-77
-, author =	"C. H. Papadimitriou"
-, title =	"The probabilistic analysis of matching heuristics"
-, booktitle =	"Proc. 15th Allerton Conf. Commun. Control Comput."
-, year =	1977
-, pages =	"368--378"
+, author =      "C. H. Papadimitriou"
+, title =       "The probabilistic analysis of matching heuristics"
+, booktitle =   "Proc. 15th Allerton Conf. Commun. Control Comput."
+, year =        1977
+, pages =       "368--378"
 }
 
 @article{p-wcpag-81
-, author =	"C. H. Papadimitriou"
-, title =	"Worst-case and probabilistic analysis of a geometric location problem"
-, journal =	"SIAM J. Comput."
-, volume =	10
-, year =	1981
-, pages =	"542--557"
+, author =      "C. H. Papadimitriou"
+, title =       "Worst-case and probabilistic analysis of a geometric location problem"
+, journal =     "SIAM J. Comput."
+, volume =      10
+, year =        1981
+, pages =       "542--557"
 }
 
 @techreport{pb-wcann-80t
-, author =	"C. H. Papadimitriou and J. L. Bentley"
-, title =	"A worst-case analysis of nearest neighbor searching by projection"
-, type =	"Report"
-, number =	"CMU-CS-80-109"
-, institution =	"Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "C. H. Papadimitriou and J. L. Bentley"
+, title =       "A worst-case analysis of nearest neighbor searching by projection"
+, type =        "Report"
+, number =      "CMU-CS-80-109"
+, institution = "Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{pb-wcann-80
-, author =	"C. H. Papadimitriou and J. L. Bentley"
-, title =	"A worst-case analysis of nearest neighbor searching by projection"
-, booktitle =	"Proc. 7th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	85
-, publisher =	"Springer-Verlag"
-, year =	1980
-, pages =	"470--482"
+, author =      "C. H. Papadimitriou and J. L. Bentley"
+, title =       "A worst-case analysis of nearest neighbor searching by projection"
+, booktitle =   "Proc. 7th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      85
+, publisher =   "Springer-Verlag"
+, year =        1980
+, pages =       "470--482"
 }
 
 @inproceedings{ps-bwgg-90
-, author =	"C. H. Papadimitriou and M. Sideri"
-, title =	"The bisection width of grid graphs"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"405--410"
+, author =      "C. H. Papadimitriou and M. Sideri"
+, title =       "The bisection width of grid graphs"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "405--410"
 }
 
 @techreport{ps-ffptp-87
-, author =	"C. H. Papadimitriou and E. B. Silverberg"
-, title =	"Finding feasible paths for a two-point body"
-, type =	"Technical {Memo}"
-, number =	"45413-870603-01"
-, institution =	"Bell Lab."
-, address =	"Murray Hill, NJ"
-, year =	1987
-, keywords =	"motion planning, path planning, geodesic distance, shortest paths"
+, author =      "C. H. Papadimitriou and E. B. Silverberg"
+, title =       "Finding feasible paths for a two-point body"
+, type =        "Technical {Memo}"
+, number =      "45413-870603-01"
+, institution = "Bell Lab."
+, address =     "Murray Hill, NJ"
+, year =        1987
+, keywords =    "motion planning, path planning, geodesic distance, shortest paths"
 }
 
 @techreport{ps-oplmo-86
-, author =	"C. H. Papadimitriou and E. B. Silverberg"
-, title =	"Optimal piecewise linear motion of an object among obstacles"
-, type =	"Technical {Report}"
-, institution =	"Dept. Oper. Res., Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1986
-, update =	"98.07 bibrelex"
+, author =      "C. H. Papadimitriou and E. B. Silverberg"
+, title =       "Optimal piecewise linear motion of an object among obstacles"
+, type =        "Technical {Report}"
+, institution = "Dept. Oper. Res., Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1986
+, update =      "98.07 bibrelex"
 }
 
 @article{ps-oplmo-87
-, author =	"C. H. Papadimitriou and E. B. Silverberg"
-, title =	"Optimal piecewise linear motion of an object among obstacles"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"523--539"
-, keywords =	"motion planning, path planning, shortest paths"
+, author =      "C. H. Papadimitriou and E. B. Silverberg"
+, title =       "Optimal piecewise linear motion of an object among obstacles"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "523--539"
+, keywords =    "motion planning, path planning, shortest paths"
 }
 
 @book{ps-coac-82
-, author =	"C. H. Papadimitriou and K. Steiglitz"
-, title =	"Combinatorial Optimization: Algorithms and Complexity"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1982
+, author =      "C. H. Papadimitriou and K. Steiglitz"
+, title =       "Combinatorial Optimization: Algorithms and Complexity"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1982
 }
 
 @inproceedings{ps-scrts-76
-, author =	"C. H. Papadimitriou and K. Steiglitz"
-, title =	"Some complexity results for the traveling salesman problem"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Theory Comput."
-, year =	1976
-, pages =	"1--9"
-, comments =	"Split into two journal papers: \cite{ps-clsts-77} and
-		 \cite{p-etspi-77}"
-, precedes =	"ps-clsts-77, p-etspi-77"
-, update =	"93.09 jones"
+, author =      "C. H. Papadimitriou and K. Steiglitz"
+, title =       "Some complexity results for the traveling salesman problem"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Theory Comput."
+, year =        1976
+, pages =       "1--9"
+, comments =    "Split into two journal papers: \cite{ps-clsts-77} and
+                 \cite{p-etspi-77}"
+, precedes =    "ps-clsts-77, p-etspi-77"
+, update =      "93.09 jones"
 }
 
 @article{ps-clsts-77
-, author =	"C. H. Papadimitriou and K. Steiglitz"
-, title =	"The complexity of local search for the traveling salesman problem"
-, journal =	"SIAM J. Comput."
-, volume =	6
-, year =	1977
-, pages =	"76--83"
-, succeeds =	"ps-scrts-76"
-, precedes =	"p-etspi-77"
+, author =      "C. H. Papadimitriou and K. Steiglitz"
+, title =       "The complexity of local search for the traveling salesman problem"
+, journal =     "SIAM J. Comput."
+, volume =      6
+, year =        1977
+, pages =       "76--83"
+, succeeds =    "ps-scrts-76"
+, precedes =    "p-etspi-77"
 }
 
 @article{pv-tgprt-84
-, author =	"C. H. Papadimitriou and U. V. Vazirani"
-, title =	"On two geometric problems related to the traveling salesman problem"
-, journal =	"J. Algorithms"
-, volume =	5
-, year =	1984
-, pages =	"231--246"
+, author =      "C. H. Papadimitriou and U. V. Vazirani"
+, title =       "On two geometric problems related to the traveling salesman problem"
+, journal =     "J. Algorithms"
+, volume =      5
+, year =        1984
+, pages =       "231--246"
 }
 
 @article{py-crstp-82
-, author =	"C. H. Papadimitriou and M. Yanakakis"
-, title =	"The complexity of restricted spanning tree problems"
-, journal =	"J. ACM"
-, volume =	29
-, year =	1982
-, pages =	"285--309"
-, update =	"98.03 bibrelex"
+, author =      "C. H. Papadimitriou and M. Yanakakis"
+, title =       "The complexity of restricted spanning tree problems"
+, journal =     "J. ACM"
+, volume =      29
+, year =        1982
+, pages =       "285--309"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{py-spwm-89
-, author =	"C. H. Papadimitriou and M. Yannakakis"
-, title =	"Shortest paths without a map"
-, booktitle =	"Proc. 16th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	372
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"610--620"
-, keywords =	"path planning"
-, precedes =	"py-spwm-91"
-, update =	"98.03 icking"
+, author =      "C. H. Papadimitriou and M. Yannakakis"
+, title =       "Shortest paths without a map"
+, booktitle =   "Proc. 16th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      372
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "610--620"
+, keywords =    "path planning"
+, precedes =    "py-spwm-91"
+, update =      "98.03 icking"
 }
 
 @article{py-spwm-91
-, author =	"C. H. Papadimitriou and M. Yannakakis"
-, title =	"Shortest Paths Without a Map"
-, journal =	"Theoret. Comput. Sci."
-, volume =	84
-, number =	1
-, year =	1991
-, pages =	"127--150"
-, keywords =	"path planning, competitive ratio, unknown map"
-, succeeds =	"py-spwm-89"
-, update =	"98.03 bibrelex+icking+mitchell"
+, author =      "C. H. Papadimitriou and M. Yannakakis"
+, title =       "Shortest Paths Without a Map"
+, journal =     "Theoret. Comput. Sci."
+, volume =      84
+, number =      1
+, year =        1991
+, pages =       "127--150"
+, keywords =    "path planning, competitive ratio, unknown map"
+, succeeds =    "py-spwm-89"
+, update =      "98.03 bibrelex+icking+mitchell"
 }
 
 @inproceedings{py-cfsfc-82
-, author =	"C. H. Papadimitriou and M. Yannakakis"
-, title =	"The complexity of facets (and some facets of complexity)"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Theory Comput."
-, year =	1982
-, pages =	"255--260"
-, precedes =	"py-cfsfc-84"
+, author =      "C. H. Papadimitriou and M. Yannakakis"
+, title =       "The complexity of facets (and some facets of complexity)"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Theory Comput."
+, year =        1982
+, pages =       "255--260"
+, precedes =    "py-cfsfc-84"
 }
 
 @article{py-cfsfc-84
-, author =	"C. H. Papadimitriou and M. Yannakakis"
-, title =	"The complexity of facets (and some facets of complexity)"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	28
-, year =	1984
-, pages =	"244--259"
-, succeeds =	"py-cfsfc-82"
+, author =      "C. H. Papadimitriou and M. Yannakakis"
+, title =       "The complexity of facets (and some facets of complexity)"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      28
+, year =        1984
+, pages =       "244--259"
+, succeeds =    "py-cfsfc-82"
 }
 
 @inproceedings{py-cfr-85
-, author =	"C. H. Papadimitriou and M. Yannakakis"
-, title =	"The complexity of facets resolved"
-, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"74--78"
-, precedes =	"py-cfr-88"
+, author =      "C. H. Papadimitriou and M. Yannakakis"
+, title =       "The complexity of facets resolved"
+, booktitle =   "Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "74--78"
+, precedes =    "py-cfr-88"
 }
 
 @article{py-cfr-88
-, author =	"C. H. Papadimitriou and M. Yannakakis"
-, title =	"The complexity of facets resolved"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	37
-, year =	1988
-, pages =	"2--13"
-, succeeds =	"py-cfr-85"
+, author =      "C. H. Papadimitriou and M. Yannakakis"
+, title =       "The complexity of facets resolved"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      37
+, year =        1988
+, pages =       "2--13"
+, succeeds =    "py-cfr-85"
 }
 
 @incollection{pm-pnnqr-97
-, author =	"Apostolos Papadopoulos and Yannis Manolopoulos"
-, title =	"Performance of nearest neighbor queries in {R}-trees"
-, booktitle =	"Database Theory---ICDT'97, 6th International Conference"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1186
-, publisher =	"Springer"
-, year =	1997
-, pages =	"394--408"
-, isbn =	"3-540-62222-5"
-, update =	"98.03 mitchell, 97.07 agarwal"
+, author =      "Apostolos Papadopoulos and Yannis Manolopoulos"
+, title =       "Performance of nearest neighbor queries in {R}-trees"
+, booktitle =   "Database Theory---ICDT'97, 6th International Conference"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1186
+, publisher =   "Springer"
+, year =        1997
+, pages =       "394--408"
+, isbn =        "3-540-62222-5"
+, update =      "98.03 mitchell, 97.07 agarwal"
 }
 
 @inproceedings{pl-ecgvd-95
-, author =	"Evanthia Papadopoulou and D. T. Lee"
-, title =	"Efficient computation of the geodesic {Voronoi} diagram of points in a simple polygon"
-, booktitle =	"Algorithms---ESA~'95, Third Annual European Symposium"
-, site =	"Corfu, Greece"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	979
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"238--251"
-, issn =	"3-540-60313-1"
-, update =	"99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "Evanthia Papadopoulou and D. T. Lee"
+, title =       "Efficient computation of the geodesic {Voronoi} diagram of points in a simple polygon"
+, booktitle =   "Algorithms---ESA~'95, Third Annual European Symposium"
+, site =        "Corfu, Greece"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      979
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "238--251"
+, issn =        "3-540-60313-1"
+, update =      "99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{pl-spspp-94
-, author =	"E. Papadopoulou and D. T. Lee"
-, title =	"Shortest Paths in a Simple Polygon in the Presence of ``Forbidden'' Vertices"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"110--115"
-, cites =	"a-gvdps-89, gm-osacv-91, ghlst-ltavs-87, hs-cmlpg-91, lp-esppr-84, m-spop-93, ms-scg-, ps-cgi-85, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "E. Papadopoulou and D. T. Lee"
+, title =       "Shortest Paths in a Simple Polygon in the Presence of ``Forbidden'' Vertices"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "110--115"
+, cites =       "a-gvdps-89, gm-osacv-91, ghlst-ltavs-87, hs-cmlpg-91, lp-esppr-84, m-spop-93, ms-scg-, ps-cgi-85, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @article{pl-svdlinf-2001
@@ -115972,4399 +115972,4399 @@ @article{pl-svdlinf-2001
 }
 
 @phdthesis{p-ivodg-96
-, author =	"A. Papakostas"
-, title =	"Information Visualization: Orthogonal Drawings of Graphs"
-, type =	"Ph.{D}. Thesis"
-, school =	"Department of Computer Science, University of Texas at Dallas"
-, month =	dec
-, year =	1996
-, keywords =	"doctoral thesis, graph drawing, orthogonal, 3D"
-, update =	"98.07 patrignani"
+, author =      "A. Papakostas"
+, title =       "Information Visualization: Orthogonal Drawings of Graphs"
+, type =        "Ph.{D}. Thesis"
+, school =      "Department of Computer Science, University of Texas at Dallas"
+, month =       dec
+, year =        1996
+, keywords =    "doctoral thesis, graph drawing, orthogonal, 3D"
+, update =      "98.07 patrignani"
 }
 
 @inproceedings{p-uptod-95
-, author =	"A. Papakostas"
-, title =	"Upward Planarity Testing of Outerplanar Dags"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"298--306"
-, keywords =	"graph drawing, planar, upward"
-, update =	"95.01 tamassia"
+, author =      "A. Papakostas"
+, title =       "Upward Planarity Testing of Outerplanar Dags"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "298--306"
+, keywords =    "graph drawing, planar, upward"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{pst-etrio-97
-, author =	"Achilleas Papakostas and Janet M. Six and Ioannis G. Tollis"
-, title =	"Experimental and Theoretical Results in Interactive Graph Drawing"
-, editor =	"Stephen North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"371--386"
-, update =	"98.11 bibrelex, 98.07 tamassia+vismara"
+, author =      "Achilleas Papakostas and Janet M. Six and Ioannis G. Tollis"
+, title =       "Experimental and Theoretical Results in Interactive Graph Drawing"
+, editor =      "Stephen North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "371--386"
+, update =      "98.11 bibrelex, 98.07 tamassia+vismara"
 }
 
 @techreport{pst-iogde-99
-, author =	"A. Papakostas and J. M. Six and I. G. Tollis"
-, title =	"Interactive Orthogonal Graph Drawing: An Experimental Study"
-, type =	"Technical Report"
-, number =	"UTDCS-3-99"
-, institution =	"Dept. Comput. Sci., Univ. Texas Dallas"
-, month =	may
-, year =	1999
-, update =	"99.07 vismara"
+, author =      "A. Papakostas and J. M. Six and I. G. Tollis"
+, title =       "Interactive Orthogonal Graph Drawing: An Experimental Study"
+, type =        "Technical Report"
+, number =      "UTDCS-3-99"
+, institution = "Dept. Comput. Sci., Univ. Texas Dallas"
+, month =       may
+, year =        1999
+, update =      "99.07 vismara"
 }
 
 @article{pt-aaeod-98
-, author =	"Achilleas Papakostas and Ioannis G. Tollis"
-, title =	"Algorithms for Area-Efficient Orthogonal Drawings"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, number =	"1--2"
-, year =	1998
-, pages =	"83--110"
-, note =	"Special Issue on Geometric Representations of
+, author =      "Achilleas Papakostas and Ioannis G. Tollis"
+, title =       "Algorithms for Area-Efficient Orthogonal Drawings"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, number =      "1--2"
+, year =        1998
+, pages =       "83--110"
+, note =        "Special Issue on Geometric Representations of
                   Graphs, G.~{Di Battista} and R.~Tamassia, editors"
-, keywords =	"graph drawing, orthogonal"
-, succeeds =	"pt-iabod-95"
-, update =	"98.11 patrignani+tamassia+vismara"
+, keywords =    "graph drawing, orthogonal"
+, succeeds =    "pt-iabod-95"
+, update =      "98.11 patrignani+tamassia+vismara"
 }
 
 @techreport{pt-iabod-96
-, author =	"A. Papakostas and I. G. Tollis"
-, title =	"Improved Algorithms and Bounds for Orthogonal Drawings"
-, type =	"Manuscript"
-, year =	1995
-, keywords =	"graph drawing"
-, update =	"98.07 bibrelex, 96.09 tamassia"
+, author =      "A. Papakostas and I. G. Tollis"
+, title =       "Improved Algorithms and Bounds for Orthogonal Drawings"
+, type =        "Manuscript"
+, year =        1995
+, keywords =    "graph drawing"
+, update =      "98.07 bibrelex, 96.09 tamassia"
 }
 
 @inproceedings{pt-iabod-95
-, author =	"A. Papakostas and I. G. Tollis"
-, title =	"Improved Algorithms and Bounds for Orthogonal Drawings"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"40--51"
-, keywords =	"graph drawing, orthogonal"
-, update =	"95.01 tamassia"
+, author =      "A. Papakostas and I. G. Tollis"
+, title =       "Improved Algorithms and Bounds for Orthogonal Drawings"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "40--51"
+, keywords =    "graph drawing, orthogonal"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{pt-iogdt-97
-, author =	"Achilleas Papakostas and Ioannis G. Tollis"
-, title =	"Incremental Orthogonal Graph Drawing in Three Dimensions"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"52--63"
-, keywords =	"graph drawing, orthogonal, 3D"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Achilleas Papakostas and Ioannis G. Tollis"
+, title =       "Incremental Orthogonal Graph Drawing in Three Dimensions"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "52--63"
+, keywords =    "graph drawing, orthogonal, 3D"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{pt-iogd-98
-, author =	"A. Papakostas and I. G. Tollis"
-, title =	"Interactive Orthogonal Graph Drawing"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-47"
-, number =	11
-, year =	1998
-, pages =	"1297--1309"
-, succeeds =	"pt-iiogd-96"
-, update =	"99.07 vismara"
+, author =      "A. Papakostas and I. G. Tollis"
+, title =       "Interactive Orthogonal Graph Drawing"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-47"
+, number =      11
+, year =        1998
+, pages =       "1297--1309"
+, succeeds =    "pt-iiogd-96"
+, update =      "99.07 vismara"
 }
 
 @inproceedings{pt-iiogd-96
-, author =	"A. Papakostas and I. G. Tollis"
-, title =	"Issues in Interactive Orthogonal Graph Drawing"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"419--430"
-, update =	"98.11 bibrelex, 98.07 vismara"
+, author =      "A. Papakostas and I. G. Tollis"
+, title =       "Issues in Interactive Orthogonal Graph Drawing"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "419--430"
+, update =      "98.11 bibrelex, 98.07 vismara"
 }
 
 @book{p-mccpi-80
-, author =	"S. Papert"
-, title =	"Mindstorms: {Children}, Computers and Powerful Ideas"
-, publisher =	"Basic Books"
-, address =	"New York, NY"
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "S. Papert"
+, title =       "Mindstorms: {Children}, Computers and Powerful Ideas"
+, publisher =   "Basic Books"
+, address =     "New York, NY"
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @article{pm-cmeso-94
-, author =	"L. Parida and S. P. Mudur"
-, title =	"Computational Methods for Evaluating Swept Object Boundaries"
-, journal =	"Visual Comput."
-, volume =	10
-, number =	5
-, year =	1994
-, pages =	"266--276"
-, update =	"96.01 held"
+, author =      "L. Parida and S. P. Mudur"
+, title =       "Computational Methods for Evaluating Swept Object Boundaries"
+, journal =     "Visual Comput."
+, volume =      10
+, number =      5
+, year =        1994
+, pages =       "266--276"
+, update =      "96.01 held"
 }
 
 @mastersthesis{p-prr-89
-, author =	"P. Paripati"
-, title =	"Polyhedra: Representation and Recognition"
-, school =	"Dept. Comput. Sci., Virginia Poytechnic Inst. and State Univ."
-, address =	"Blacksburg, VA"
-, year =	1989
-, keywords =	"master thesis"
-, update =	"98.07 bibrelex"
+, author =      "P. Paripati"
+, title =       "Polyhedra: Representation and Recognition"
+, school =      "Dept. Comput. Sci., Virginia Poytechnic Inst. and State Univ."
+, address =     "Blacksburg, VA"
+, year =        1989
+, keywords =    "master thesis"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{ph-mipa-77
-, author =	"J. Paris and L. Harrington"
-, title =	"A mathematical incompleteness in {P}eano arithmetic"
-, editor =	"J. Barwise"
-, booktitle =	"Handbook of Mathematical Logic"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1977
-, pages =	"1133--1142"
-, update =	"95.09 agarwal"
+, author =      "J. Paris and L. Harrington"
+, title =       "A mathematical incompleteness in {P}eano arithmetic"
+, editor =      "J. Barwise"
+, booktitle =   "Handbook of Mathematical Logic"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1977
+, pages =       "1133--1142"
+, update =      "95.09 agarwal"
 }
 
 @inproceedings{pg-taitd-92
-, author =	"K. Park and Z. Galil"
-, title =	"Truly alphabet-independent two-dimensional pattern matching"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"247--256"
+, author =      "K. Park and Z. Galil"
+, title =       "Truly alphabet-independent two-dimensional pattern matching"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "247--256"
 }
 
 @inproceedings{plc-ccps1-01
-, author =	"Sang-Min Park and Jae-Ha Lee and Kyung-Yong Chwa"
-, title =	"A Characterizatin of the Class of Polygons Searchable by a 1-Searcher"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"133--136"
-, update =	"01.04 icking"
+, author =      "Sang-Min Park and Jae-Ha Lee and Kyung-Yong Chwa"
+, title =       "A Characterizatin of the Class of Polygons Searchable by a 1-Searcher"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "133--136"
+, update =      "01.04 icking"
 }
 
 @inproceedings{p-bbcra-96
-, author =	"L. E. Parker"
-, title =	"Behavior-based cooperative robotics applied to multi-target observation"
-, booktitle =	"Proc. Dagstuhl Seminar on Modeling and Planning for Sensor-Based Intelligent Robot Systems"
-, site =	"Dagstuhl, Germany"
-, month =	sep
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "L. E. Parker"
+, title =       "Behavior-based cooperative robotics applied to multi-target observation"
+, booktitle =   "Proc. Dagstuhl Seminar on Modeling and Planning for Sensor-Based Intelligent Robot Systems"
+, site =        "Dagstuhl, Germany"
+, month =       sep
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @article{p-culdo-96
-, author =	"P. Parodi"
-, title =	"The Complexity of Understanding Line Drawings of Origami Scenes"
-, journal =	"Internat. J. Comput. Vision"
-, volume =	18
-, number =	2
-, year =	1996
-, pages =	"139--170"
-, update =	"97.03 held"
+, author =      "P. Parodi"
+, title =       "The Complexity of Understanding Line Drawings of Origami Scenes"
+, journal =     "Internat. J. Comput. Vision"
+, volume =      18
+, number =      2
+, year =        1996
+, pages =       "139--170"
+, update =      "97.03 held"
 }
 
 @techreport{plvt-edecl-96
-, author =	"P. Parodi and R. Lancewicki and A. Vijh and J. K. Tsotsos"
-, title =	"Empirically-derived Estimates of the Complexity of Labelling Line Drawings of Polyhedral Scenes"
-, number =	"RBCV-TR-96-52"
-, institution =	"Dept. Comput. Sci., Univ. Toronto"
-, address =	"Toronto, ON"
-, year =	1996
-, update =	"98.03 mitchell, 97.03 held"
+, author =      "P. Parodi and R. Lancewicki and A. Vijh and J. K. Tsotsos"
+, title =       "Empirically-derived Estimates of the Complexity of Labelling Line Drawings of Polyhedral Scenes"
+, number =      "RBCV-TR-96-52"
+, institution = "Dept. Comput. Sci., Univ. Toronto"
+, address =     "Toronto, ON"
+, year =        1996
+, update =      "98.03 mitchell, 97.03 held"
 }
 
 @article{pp-3dsru-96
-, author =	"P. Parodi and G. Piccioli"
-, title =	"3D Shape Reconstruction by Using Vanishing Points"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	18
-, number =	2
-, month =	feb
-, year =	1996
-, pages =	"211--217"
-, update =	"97.03 held"
+, author =      "P. Parodi and G. Piccioli"
+, title =       "3D Shape Reconstruction by Using Vanishing Points"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      18
+, number =      2
+, month =       feb
+, year =        1996
+, pages =       "211--217"
+, update =      "97.03 held"
 }
 
 @article{pt-clppp-94
-, author =	"P. Parodi and V. Torre"
-, title =	"On the Complexity of Labeling Perspective Projections of Polyhedra"
-, journal =	"Artif. Intell."
-, volume =	70
-, number =	1
-, year =	1994
-, pages =	"1--38"
-, update =	"97.03 held"
+, author =      "P. Parodi and V. Torre"
+, title =       "On the Complexity of Labeling Perspective Projections of Polyhedra"
+, journal =     "Artif. Intell."
+, volume =      70
+, number =      1
+, year =        1994
+, pages =       "1--38"
+, update =      "97.03 held"
 }
 
 @inproceedings{pt-cocpc-92
-, author =	"D. Parson and C. Torras"
-, title =	"The combinatorics of overlapping convex polygons in contact"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"83--92"
-, cites =	"c-pcp-83, ls-ncfcc-87, pt-ccsbc-91, ss-pmp1c-83, s-pds-74, tt-mtcpc-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "D. Parson and C. Torras"
+, title =       "The combinatorics of overlapping convex polygons in contact"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "83--92"
+, cites =       "c-pcp-83, ls-ncfcc-87, pt-ccsbc-91, ss-pmp1c-83, s-pds-74, tt-mtcpc-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{pt-ccsbc-91
-, author =	"D. Parsons and C. Torras"
-, title =	"On the complexity of the contact space between convex polyhedra"
-, type =	"Technical {Report}"
-, institution =	"Institut de Cibern{\`e}tica, Universitat Polit{\'e}cnica de Catalunia - CSIC"
-, address =	"Barcelona, Spain"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "D. Parsons and C. Torras"
+, title =       "On the complexity of the contact space between convex polyhedra"
+, type =        "Technical {Report}"
+, institution = "Institut de Cibern{\`e}tica, Universitat Polit{\'e}cnica de Catalunia - CSIC"
+, address =     "Barcelona, Spain"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @incollection{p-peg-76
-, author =	"T. D. Parsons"
-, title =	"Pursuit-evasion in a graph"
-, editor =	"Y. Alavi and D. Lick"
-, booktitle =	"Theory and Applications of Graphs"
-, series =	"Lecture Notes Math."
-, volume =	642
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1976
-, pages =	"426--441"
-, update =	"98.07 bibrelex"
+, author =      "T. D. Parsons"
+, title =       "Pursuit-evasion in a graph"
+, editor =      "Y. Alavi and D. Lick"
+, booktitle =   "Theory and Applications of Graphs"
+, series =      "Lecture Notes Math."
+, volume =      642
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1976
+, pages =       "426--441"
+, update =      "98.07 bibrelex"
 }
 
 @article{pd-padbo-91
-, author =	"S. K. Parui and A. Datta"
-, title =	"A parallel algorithm for decomposition of binary objects through skeletonization"
-, journal =	"Pattern Recogn. Lett."
-, volume =	12
-, year =	1991
-, pages =	"235--240"
-, update =	"93.09 milone+mitchell"
+, author =      "S. K. Parui and A. Datta"
+, title =       "A parallel algorithm for decomposition of binary objects through skeletonization"
+, journal =     "Pattern Recogn. Lett."
+, volume =      12
+, year =        1991
+, pages =       "235--240"
+, update =      "93.09 milone+mitchell"
 }
 
 @phdthesis{p-kpudz-82
-, author =	"I. Paschinger"
-, title =	"{Konvexe} {Polytope} und {Dirichletsche} {Zellenkomplexe}"
-, type =	"Ph.{D}. Thesis"
-, school =	"Institut f{\"u}r Mathematik, Universit{\"a}t Salzburg"
-, address =	"Salzburg, Austria"
-, year =	1982
-, keywords =	"doctoral thesis"
+, author =      "I. Paschinger"
+, title =       "{Konvexe} {Polytope} und {Dirichletsche} {Zellenkomplexe}"
+, type =        "Ph.{D}. Thesis"
+, school =      "Institut f{\"u}r Mathematik, Universit{\"a}t Salzburg"
+, address =     "Salzburg, Austria"
+, year =        1982
+, keywords =    "doctoral thesis"
 }
 
 @inproceedings{pfp-diccb-95
-, author =	"V. Pascucci and V. Ferrucci and A. Paoluzzi"
-, title =	"Dimension-independent convex-cell based HPC: Representation scheme and implementation issues"
-, editor =	"C. Hoffmann and J. Rossignac"
-, booktitle =	"Solid Modeling '95"
-, publisher =	"ACM Press"
-, year =	1995
-, pages =	"163--174"
-, update =	"97.11 bibrelex"
+, author =      "V. Pascucci and V. Ferrucci and A. Paoluzzi"
+, title =       "Dimension-independent convex-cell based HPC: Representation scheme and implementation issues"
+, editor =      "C. Hoffmann and J. Rossignac"
+, booktitle =   "Solid Modeling '95"
+, publisher =   "ACM Press"
+, year =        1995
+, pages =       "163--174"
+, update =      "97.11 bibrelex"
 }
 
 @article{p-isnod-90
-, author =	"M. Paterson"
-, title =	"Improved sorting networks with $O(\log N)$ depth"
-, journal =	"Algorithmica"
-, volume =	5
-, number =	1
-, year =	1990
-, pages =	"75--92"
-, update =	"96.09 orourke"
+, author =      "M. Paterson"
+, title =       "Improved sorting networks with $O(\log N)$ depth"
+, journal =     "Algorithmica"
+, volume =      5
+, number =      1
+, year =        1990
+, pages =       "75--92"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{py-bpahs-89
-, author =	"M. S. Paterson and F. F. Yao"
-, title =	"Binary partitions with applications to hidden surface removal and solid modelling"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, site =	"Saarbr{\"u}cken"
-, year =	1989
-, pages =	"23--32"
-, precedes =	"py-ebsph-90"
-, cites =	"c-iies-84, cgl-pgd-83, dghs-eafcr-88, e-acg-87, fkn-vsgpt-80, g m-vlbe-59, gy-tsr-83, k-acp-73, p-hresr-84, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Binary partitions with applications to hidden surface removal and solid modelling"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, site =        "Saarbr{\"u}cken"
+, year =        1989
+, pages =       "23--32"
+, precedes =    "py-ebsph-90"
+, cites =       "c-iies-84, cgl-pgd-83, dghs-eafcr-88, e-acg-87, fkn-vsgpt-80, g m-vlbe-59, gy-tsr-83, k-acp-73, p-hresr-84, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{py-ebsph-90
-, author =	"M. S. Paterson and F. F. Yao"
-, title =	"Efficient binary space partitions for hidden-surface removal and solid modeling"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"485--503"
-, succeeds =	"py-bpahs-89"
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Efficient binary space partitions for hidden-surface removal and solid modeling"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "485--503"
+, succeeds =    "py-bpahs-89"
 }
 
 @incollection{py-nng-92
-, author =	"M. S. Paterson and F. F. Yao"
-, title =	"On Nearest-Neighbor Graphs"
-, booktitle =	"Proc. 19th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	623
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"416--426"
-, update =	"94.01 smid, 93.09 milone+mitchell"
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "On Nearest-Neighbor Graphs"
+, booktitle =   "Proc. 19th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      623
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "416--426"
+, update =      "94.01 smid, 93.09 milone+mitchell"
 }
 
 @techreport{py-obspo-90t
-, author =	"M. S. Paterson and F. F. Yao"
-, title =	"Optimal binary space partitions for orthogonal objects"
-, type =	"Research {Report}"
-, number =	158
-, institution =	"Univ. Warwick"
-, year =	1990
-, succeeds =	"py-obspo-90"
-, precedes =	"py-obspo-92"
-, update =	"98.07 bibrelex"
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Optimal binary space partitions for orthogonal objects"
+, type =        "Research {Report}"
+, number =      158
+, institution = "Univ. Warwick"
+, year =        1990
+, succeeds =    "py-obspo-90"
+, precedes =    "py-obspo-92"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{py-obspo-90
-, author =	"M. S. Paterson and F. F. Yao"
-, title =	"Optimal binary space partitions for orthogonal objects"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"100--106"
-, precedes =	"py-obspo-92"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Optimal binary space partitions for orthogonal objects"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "100--106"
+, precedes =    "py-obspo-92"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{py-obspo-92
-, author =	"M. S. Paterson and F. F. Yao"
-, title =	"Optimal binary space partitions for orthogonal objects"
-, journal =	"J. Algorithms"
-, volume =	13
-, year =	1992
-, pages =	"99--113"
-, succeeds =	"py-obspo-90, py-obspo-90t"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Optimal binary space partitions for orthogonal objects"
+, journal =     "J. Algorithms"
+, volume =      13
+, year =        1992
+, pages =       "99--113"
+, succeeds =    "py-obspo-90, py-obspo-90t"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{py-prp-86
-, author =	"M. S. Paterson and F. F. Yao"
-, title =	"Point retrieval for polygons"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"441--447"
+, author =      "M. S. Paterson and F. F. Yao"
+, title =       "Point retrieval for polygons"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "441--447"
 }
 
 @book{p-fpr-72
-, author =	"E. A. Patrick"
-, title =	"Fundamentals of Pattern Recognition"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1972
-, update =	"97.03 schwarzkopf"
+, author =      "E. A. Patrick"
+, title =       "Fundamentals of Pattern Recognition"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1972
+, update =      "97.03 schwarzkopf"
 }
 
 @article{pf-gknnd-70
-, author =	"E. A. Patrick and F. P. Fisher"
-, title =	"Generalized $k$-nearest neighbor decision rule"
-, journal =	"Inform. Control"
-, volume =	16
-, month =	apr
-, year =	1970
-, pages =	"128--152"
+, author =      "E. A. Patrick and F. P. Fisher"
+, title =       "Generalized $k$-nearest neighbor decision rule"
+, journal =     "Inform. Control"
+, volume =      16
+, month =       apr
+, year =        1970
+, pages =       "128--152"
 }
 
 @techreport{p-coc-99
-, author =	"Maurizio Patrignani"
-, title =	"On the Complexity of Orthogonal Compaction"
-, type =	"Technical {Report}"
-, number =	"RT-DIA-39-99"
-, institution =	"Dipartimento di Informatica e Automazione, Universit{\`a} di Roma Tre"
-, address =	"Rome, Italy"
-, month =	jan
-, year =	1999
-, url =	"http://www.dia.uniroma3.it/research/tech-rep/dia-39-99.ps"
-, keywords =	"graph drawing, planar, orthogonal, area, edge length, NP-completeness"
-, update =	"99.03 patrignani+vismara"
+, author =      "Maurizio Patrignani"
+, title =       "On the Complexity of Orthogonal Compaction"
+, type =        "Technical {Report}"
+, number =      "RT-DIA-39-99"
+, institution = "Dipartimento di Informatica e Automazione, Universit{\`a} di Roma Tre"
+, address =     "Rome, Italy"
+, month =       jan
+, year =        1999
+, url = "http://www.dia.uniroma3.it/research/tech-rep/dia-39-99.ps"
+, keywords =    "graph drawing, planar, orthogonal, area, edge length, NP-completeness"
+, update =      "99.03 patrignani+vismara"
 }
 
 @inproceedings{p-coc-99i
-, author =	"M. Patrignani"
-, title =	"On the Complexity of Orthogonal Compaction"
-, editor =	"F. Dehne and A. Gupta and J.-R. Sack and R. Tamassia"
-, booktitle =	"Algorithms and Data Structures"
-, nickname =	"WADS '99"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1663
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"56--61"
-, update =	"00.03 vismara"
+, author =      "M. Patrignani"
+, title =       "On the Complexity of Orthogonal Compaction"
+, editor =      "F. Dehne and A. Gupta and J.-R. Sack and R. Tamassia"
+, booktitle =   "Algorithms and Data Structures"
+, nickname =    "WADS '99"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1663
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "56--61"
+, update =      "00.03 vismara"
 }
 
 @article{p-coc-01
-, author =	"M. Patrignani"
-, title =	"On the Complexity of Orthogonal Compaction"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"47--67"
-, update =	"01.07 smid"
+, author =      "M. Patrignani"
+, title =       "On the Complexity of Orthogonal Compaction"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "47--67"
+, update =      "01.07 smid"
 }
 
 @inproceedings{pv-3dttd-97
-, author =	"Maurizio Patrignani and Francesco Vargiu"
-, title =	"{3DCube}: A Tool for Three Dimensional Graph Drawing"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"284--290"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Maurizio Patrignani and Francesco Vargiu"
+, title =       "{3DCube}: A Tool for Three Dimensional Graph Drawing"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "284--290"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{p-acrs-89
-, author =	"N. M. Patrikalakis"
-, title =	"Approximate Conversion of Rational Splines"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	6
-, number =	2
-, year =	1989
-, pages =	"155--165"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis"
+, title =       "Approximate Conversion of Rational Splines"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      6
+, number =      2
+, year =        1989
+, pages =       "155--165"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{p-gmcas-86
-, author =	"N. M. Patrikalakis"
-, title =	"Geometric Modeling in Computer Aided Ship Design"
-, booktitle =	"Proc. Marine Computers '86"
-, year =	1986
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis"
+, title =       "Geometric Modeling in Computer Aided Ship Design"
+, booktitle =   "Proc. Marine Computers '86"
+, year =        1986
+, update =      "95.05 abrams"
 }
 
 @incollection{p-isi-92
-, author =	"N. M. Patrikalakis"
-, title =	"Interrogation of Surface Intersections"
-, chapter =	8
-, editor =	"R. E. Barnhill"
-, booktitle =	"Geometry Processing for Design and Manufacturing"
-, publisher =	"Society for Industrial and Applied Mathematics"
-, address =	"Philadelphia, PA"
-, year =	1992
-, pages =	"161--185"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis"
+, title =       "Interrogation of Surface Intersections"
+, chapter =     8
+, editor =      "R. E. Barnhill"
+, booktitle =   "Geometry Processing for Design and Manufacturing"
+, publisher =   "Society for Industrial and Applied Mathematics"
+, address =     "Philadelphia, PA"
+, year =        1992
+, pages =       "161--185"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{p-si-88
-, author =	"N. M. Patrikalakis"
-, title =	"Shape Interrogation"
-, editor =	"C. Chryssostomidis"
-, booktitle =	"Proc. 16th Annual MIT Sea Grant College Program Lecture and Seminar: Automation in the Design and Manufacture of Large Marine Systems"
-, year =	1990
-, pages =	"83--104"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis"
+, title =       "Shape Interrogation"
+, editor =      "C. Chryssostomidis"
+, booktitle =   "Proc. 16th Annual MIT Sea Grant College Program Lecture and Seminar: Automation in the Design and Manufacture of Large Marine Systems"
+, year =        1990
+, pages =       "83--104"
+, update =      "95.05 abrams"
 }
 
 @article{p-ssi-93
-, author =	"N. M. Patrikalakis"
-, title =	"Surface-to-Surface Intersections"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	13
-, number =	1
-, year =	1993
-, pages =	"89--95"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis"
+, title =       "Surface-to-Surface Intersections"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      13
+, number =      1
+, year =        1993
+, pages =       "89--95"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{paht-pcagm-90
-, author =	"N. M. Patrikalakis and P. G. Alourdas and G. R. Hottel and S. T. Tuohy"
-, title =	"Praxiteles: A Computer Aided Geometric Modeling System"
-, booktitle =	"Proc. Fifth International Conference on Marine Technology"
-, year =	1990
-, pages =	"221--227"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and P. G. Alourdas and G. R. Hottel and S. T. Tuohy"
+, title =       "Praxiteles: A Computer Aided Geometric Modeling System"
+, booktitle =   "Proc. Fifth International Conference on Marine Technology"
+, year =        1990
+, pages =       "221--227"
+, update =      "95.05 abrams"
 }
 
 @article{pb-febmp-92
-, author =	"N. M. Patrikalakis and L. Bardis"
-, title =	"Feature Extraction from {B}-Spline Marine Propeller Representations"
-, journal =	"Journal of Ship Research"
-, volume =	36
-, number =	3
-, year =	1992
-, pages =	"233--247"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and L. Bardis"
+, title =       "Feature Extraction from {B}-Spline Marine Propeller Representations"
+, journal =     "Journal of Ship Research"
+, volume =      36
+, number =      3
+, year =        1992
+, pages =       "233--247"
+, update =      "95.05 abrams"
 }
 
 @article{pb-lrbs-91
-, author =	"N. M. Patrikalakis and L. Bardis"
-, title =	"Localization of Rational {B}-Spline Surfaces"
-, journal =	"Engineering with Computers"
-, volume =	7
-, number =	4
-, year =	1991
-, pages =	"237--252"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and L. Bardis"
+, title =       "Localization of Rational {B}-Spline Surfaces"
+, journal =     "Engineering with Computers"
+, volume =      7
+, number =      4
+, year =        1991
+, pages =       "237--252"
+, update =      "95.05 abrams"
 }
 
 @article{pb-ocrbs-89
-, author =	"N. M. Patrikalakis and L. Bardis"
-, title =	"Offsets of Curves on Rational {B}-Spline Surfaces"
-, journal =	"Engineering with Computers"
-, volume =	5
-, year =	1989
-, pages =	"39--46"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and L. Bardis"
+, title =       "Offsets of Curves on Rational {B}-Spline Surfaces"
+, journal =     "Engineering with Computers"
+, volume =      5
+, year =        1989
+, pages =       "39--46"
+, update =      "95.05 abrams"
 }
 
 @article{pbk-abgld-90
-, author =	"N. M. Patrikalakis and L. Bardis and G. A. Kriezis"
-, title =	"Approximation of {B}-Spline Geometries with Lower Degree Representations"
-, journal =	"Journal of Offshore Mechanics and Arctic Engineering, ASME Transactions"
-, volume =	112
-, number =	3
-, year =	1990
-, pages =	"192--198"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and L. Bardis and G. A. Kriezis"
+, title =       "Approximation of {B}-Spline Geometries with Lower Degree Representations"
+, journal =     "Journal of Offshore Mechanics and Arctic Engineering, ASME Transactions"
+, volume =      112
+, number =      3
+, year =        1990
+, pages =       "192--198"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{pchmsz-trgm1-94
-, author =	"N. M. Patrikalakis and W. Cho and C.-Y. Hu and T. Maekawa and E. C. Sherbrooke and J. Zhou"
-, title =	"Towards Robust Geometric Modellers, 1994 Progress Report"
-, booktitle =	"Proc. 1995 NSF Design and Manufacturing Grantees Conference"
-, year =	1995
-, pages =	"139--140"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and W. Cho and C.-Y. Hu and T. Maekawa and E. C. Sherbrooke and J. Zhou"
+, title =       "Towards Robust Geometric Modellers, 1994 Progress Report"
+, booktitle =   "Proc. 1995 NSF Design and Manufacturing Grantees Conference"
+, year =        1995
+, pages =       "139--140"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{pctblbmy-veoev-95
-, author =	"N. M. Patrikalakis and C. Chryssostomidis and S. T. Tuohy and J. G. Bellingham and J. J. Leonard and J. W. Bales and B. A. Moran and J. W. Yoon"
-, title =	"Virtual Environments for Ocean Exploration and Visualization"
-, booktitle =	"Proc. CES '95: Workshop on Computer Technology for the Exploration of the Sea"
-, year =	1995
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and C. Chryssostomidis and S. T. Tuohy and J. G. Bellingham and J. J. Leonard and J. W. Bales and B. A. Moran and J. W. Yoon"
+, title =       "Virtual Environments for Ocean Exploration and Visualization"
+, booktitle =   "Proc. CES '95: Workshop on Computer Technology for the Exploration of the Sea"
+, year =        1995
+, update =      "95.05 abrams"
 }
 
 @inproceedings{pg-simat-90
-, author =	"N. M. Patrikalakis and H. N. G{\"u}rsoy"
-, title =	"Shape Interrogation by Medial Axis Transform"
-, booktitle =	"Proc. 16th ASME Design Automation Conference"
-, site =	"Chicago"
-, month =	sep
-, year =	1990
-, pages =	""
-, update =	"93.09 held"
+, author =      "N. M. Patrikalakis and H. N. G{\"u}rsoy"
+, title =       "Shape Interrogation by Medial Axis Transform"
+, booktitle =   "Proc. 16th ASME Design Automation Conference"
+, site =        "Chicago"
+, month =       sep
+, year =        1990
+, pages =       ""
+, update =      "93.09 held"
 }
 
 @inproceedings{phms-trgm-94
-, author =	"N. M. Patrikalakis and C.-Y. Hu and T. Maekawa and E. C. Sherbrooke"
-, title =	"Towards Robust Geometric Modellers"
-, booktitle =	"Proc. 1994 NSF Design and Manufacturing Grantees Conference"
-, year =	1994
-, pages =	"199--200"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and C.-Y. Hu and T. Maekawa and E. C. Sherbrooke"
+, title =       "Towards Robust Geometric Modellers"
+, booktitle =   "Proc. 1994 NSF Design and Manufacturing Grantees Conference"
+, year =        1994
+, pages =       "199--200"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{pk-pcast-90
-, author =	"N. M. Patrikalakis and G. A. Kriezis"
-, title =	"Piecewise Continuous Algebraic Surfaces in Terms of {B}-Splines"
-, editor =	"M. J. Wozny and J. U. Turner and K. Preiss"
-, booktitle =	"Proc. of the 1988 International Federation of Information Processing WG 5.2 / National Science Foundation Working Conference on Geometric Modeling: Geometric Modeling for Product Engineering"
-, year =	1990
-, pages =	"3--19"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and G. A. Kriezis"
+, title =       "Piecewise Continuous Algebraic Surfaces in Terms of {B}-Splines"
+, editor =      "M. J. Wozny and J. U. Turner and K. Preiss"
+, booktitle =   "Proc. of the 1988 International Federation of Information Processing WG 5.2 / National Science Foundation Working Conference on Geometric Modeling: Geometric Modeling for Product Engineering"
+, year =        1990
+, pages =       "3--19"
+, update =      "95.05 abrams"
 }
 
 @article{pk-rpcas-89
-, author =	"N. M. Patrikalakis and G. A. Kriezis"
-, title =	"Representation of Piecewise Continuous Algebraic Surfaces in Terms of {B}-Splines"
-, journal =	"Visual Comput."
-, volume =	5
-, number =	6
-, year =	1989
-, pages =	"360--374"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and G. A. Kriezis"
+, title =       "Representation of Piecewise Continuous Algebraic Surfaces in Terms of {B}-Splines"
+, journal =     "Visual Comput."
+, volume =      5
+, number =      6
+, year =        1989
+, pages =       "360--374"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{pkp-issip-90
-, author =	"N. M. Patrikalakis and G. A. Kriezis and P. V. Prakash"
-, title =	"Investigation on Surface-to-Surface Intersection Problems"
-, booktitle =	"Proc. 16th Annual NSF Grantees Conference on Manufacturing Systems Research"
-, year =	1990
-, pages =	"169--176"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and G. A. Kriezis and P. V. Prakash"
+, title =       "Investigation on Surface-to-Surface Intersection Problems"
+, booktitle =   "Proc. 16th Annual NSF Grantees Conference on Manufacturing Systems Research"
+, year =        1990
+, pages =       "169--176"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{pmsz-csed-92
-, author =	"N. M. Patrikalakis and T. Maekawa and E. C. Sherbrooke and J. Zhou"
-, title =	"Computation of Singularities for Engineering Design"
-, editor =	"L. Kunii and Y. Shinagawa"
-, booktitle =	"Proc. International Workshop on Modern Geometric Computing for Visualization"
-, year =	1992
-, pages =	"167--191"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and T. Maekawa and E. C. Sherbrooke and J. Zhou"
+, title =       "Computation of Singularities for Engineering Design"
+, editor =      "L. Kunii and Y. Shinagawa"
+, booktitle =   "Proc. International Workshop on Modern Geometric Computing for Visualization"
+, year =        1992
+, pages =       "167--191"
+, update =      "95.05 abrams"
 }
 
 @article{pp-ffpmu-88
-, author =	"N. M. Patrikalakis and P. V. Prakash"
-, title =	"Free-Form Plate Modeling Using Offset Surfaces"
-, journal =	"Journal of Offshore Mechanics and Arctic Engineering, ASME Transactions"
-, volume =	110
-, number =	3
-, year =	1988
-, pages =	"287--294"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and P. V. Prakash"
+, title =       "Free-Form Plate Modeling Using Offset Surfaces"
+, journal =     "Journal of Offshore Mechanics and Arctic Engineering, ASME Transactions"
+, volume =      110
+, number =      3
+, year =        1988
+, pages =       "287--294"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{pp-itsp-89
-, author =	"N. M. Patrikalakis and P. V. Prakash"
-, title =	"Intersections for Trimmed Surface Patches"
-, booktitle =	"Proc. 8th International Symposium on Offshore Mechanics and Arctic Engineering"
-, year =	1989
-, pages =	"211--222"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and P. V. Prakash"
+, title =       "Intersections for Trimmed Surface Patches"
+, booktitle =   "Proc. 8th International Symposium on Offshore Mechanics and Arctic Engineering"
+, year =        1989
+, pages =       "211--222"
+, update =      "95.05 abrams"
 }
 
 @article{pp-sigm-90
-, author =	"N. M. Patrikalakis and P. V. Prakash"
-, title =	"Surface Intersections for Geometric Modeling"
-, journal =	"Journal of Mechanical Design, ASME Transactions"
-, volume =	112
-, number =	1
-, year =	1990
-, pages =	"100--107"
-, update =	"95.05 abrams"
+, author =      "N. M. Patrikalakis and P. V. Prakash"
+, title =       "Surface Intersections for Geometric Modeling"
+, journal =     "Journal of Mechanical Design, ASME Transactions"
+, volume =      112
+, number =      1
+, year =        1990
+, pages =       "100--107"
+, update =      "95.05 abrams"
 }
 
 @incollection{ppgk-rtsi-91
-, author =	"N. M. Patrikalakis and P. V. Prakash and H. N. G{\"u}rsoy and G. A. Kriezis"
-, title =	"Research Topics in Shape Interrogation"
-, chapter =	2
-, editor =	"N. Magnenat-Thalmann and D. Thalmann"
-, booktitle =	"New Trends in Animation and Visualization"
-, publisher =	"John Wiley \& Sons"
-, address =	"London, UK"
-, year =	1991
-, pages =	"13--41"
-, update =	"99.11 bibrelex, 95.05 abrams"
+, author =      "N. M. Patrikalakis and P. V. Prakash and H. N. G{\"u}rsoy and G. A. Kriezis"
+, title =       "Research Topics in Shape Interrogation"
+, chapter =     2
+, editor =      "N. Magnenat-Thalmann and D. Thalmann"
+, booktitle =   "New Trends in Animation and Visualization"
+, publisher =   "John Wiley \& Sons"
+, address =     "London, UK"
+, year =        1991
+, pages =       "13--41"
+, update =      "99.11 bibrelex, 95.05 abrams"
 }
 
 @article{p-dmdci-35
-, author =	"A. L. Patterson"
-, title =	"A direct method for the determination of the components of interatomic distances in crystals"
-, journal =	"Zeitschrift Krist."
-, volume =	90
-, year =	1935
-, pages =	"517--542"
-, update =	"97.11 bibrelex"
+, author =      "A. L. Patterson"
+, title =       "A direct method for the determination of the components of interatomic distances in crystals"
+, journal =     "Zeitschrift Krist."
+, volume =      90
+, year =        1935
+, pages =       "517--542"
+, update =      "97.11 bibrelex"
 }
 
 @article{p-axrac-44
-, author =	"A. L. Patterson"
-, title =	"Amibguities in the {X}-ray analysis of crystal structures"
-, journal =	"Physical Review"
-, volume =	65
-, year =	1944
-, pages =	"195--201"
-, update =	"97.11 bibrelex"
+, author =      "A. L. Patterson"
+, title =       "Amibguities in the {X}-ray analysis of crystal structures"
+, journal =     "Physical Review"
+, volume =      65
+, year =        1944
+, pages =       "195--201"
+, update =      "97.11 bibrelex"
 }
 
 @book{p-rmmpc-81
-, author =	"R. P. Paul"
-, title =	"Robot Manipulators, Mathematics, Programming and Control"
-, publisher =	"MIT Press"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "R. P. Paul"
+, title =       "Robot Manipulators, Mathematics, Programming and Control"
+, publisher =   "MIT Press"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @book{ps-dtram-80
-, author =	"W. Paul and J. Simon"
-, title =	"Decision trees and random access machines"
-, series =	"Logic and Algorithmic Monographs"
-, volume =	30
-, publisher =	"Enseignement Mathematique"
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "W. Paul and J. Simon"
+, title =       "Decision trees and random access machines"
+, series =      "Logic and Algorithmic Monographs"
+, volume =      30
+, publisher =   "Enseignement Mathematique"
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{pvw-pd23t-83
-, author =	"W. Paul and U. Vishkin and H. Wagener"
-, title =	"Parallel Dictionaries on 2-3 Trees"
-, booktitle =	"Proceedings of the Tenth ICALP"
-, year =	1983
-, pages =	"597--609"
-, update =	"96.09 orourke"
+, author =      "W. Paul and U. Vishkin and H. Wagener"
+, title =       "Parallel Dictionaries on 2-3 Trees"
+, booktitle =   "Proceedings of the Tenth ICALP"
+, year =        1983
+, pages =       "597--609"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{phkv-vboos-93
-, author =	"W. De Pauw and R. Helm and D. Kimelman and J. Vlissides"
-, title =	"Visualizing the Behavior of Object-Oriented Systems"
-, booktitle =	"Proc. 8th Annu. ACM Conf. Object-Oriented Program. Syst. Lang. Appl."
-, series =	"SIGPLAN Notices"
-, volume =	28
-, year =	1993
-, pages =	"326--337"
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "W. De Pauw and R. Helm and D. Kimelman and J. Vlissides"
+, title =       "Visualizing the Behavior of Object-Oriented Systems"
+, booktitle =   "Proc. 8th Annu. ACM Conf. Object-Oriented Program. Syst. Lang. Appl."
+, series =      "SIGPLAN Notices"
+, volume =      28
+, year =        1993
+, pages =       "326--337"
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @book{p-agip-82
-, author =	"T. Pavlidis"
-, title =	"Algorithms for Graphics and Image Processing"
-, publisher =	"Computer Science Press"
-, address =	"Berlin, West Germany"
-, year =	1982
+, author =      "T. Pavlidis"
+, title =       "Algorithms for Graphics and Image Processing"
+, publisher =   "Computer Science Press"
+, address =     "Berlin, West Germany"
+, year =        1982
 }
 
 @article{p-asp-68
-, author =	"T. Pavlidis"
-, title =	"Analysis of set patterns"
-, journal =	"Pattern Recogn."
-, volume =	1
-, year =	1968
-, pages =	"165--178"
+, author =      "T. Pavlidis"
+, title =       "Analysis of set patterns"
+, journal =     "Pattern Recogn."
+, volume =      1
+, year =        1968
+, pages =       "165--178"
 }
 
 @book{p-cg-78
-, author =	"T. Pavlidis"
-, title =	"Computer Graphics"
-, publisher =	"Computer Science Press"
-, address =	"Potomac, MD"
-, year =	1978
-, update =	"98.11 bibrelex"
+, author =      "T. Pavlidis"
+, title =       "Computer Graphics"
+, publisher =   "Computer Science Press"
+, address =     "Potomac, MD"
+, year =        1978
+, update =      "98.11 bibrelex"
 }
 
 @article{p-farg-79
-, author =	"T. Pavlidis"
-, title =	"Filling algorithms for raster graphics"
-, journal =	"Comput. Graph. Image Process."
-, volume =	10
-, year =	1979
-, pages =	"126--141"
-, update =	"98.07 bibrelex"
+, author =      "T. Pavlidis"
+, title =       "Filling algorithms for raster graphics"
+, journal =     "Comput. Graph. Image Process."
+, volume =      10
+, year =        1979
+, pages =       "126--141"
+, update =      "98.07 bibrelex"
 }
 
 @article{p-rflg-72
-, author =	"T. Pavlidis"
-, title =	"Representation of figures by labelled graphs"
-, journal =	"Pattern Recogn."
-, volume =	4
-, year =	1972
-, pages =	"5--17"
+, author =      "T. Pavlidis"
+, title =       "Representation of figures by labelled graphs"
+, journal =     "Pattern Recogn."
+, volume =      4
+, year =        1972
+, pages =       "5--17"
 }
 
 @article{pv-abdi-85
-, author =	"T. Pavlidis and C. J. {Van Wyk}"
-, title =	"An Automatic Beautifier for Drawings and Illustrations"
-, journal =	"Comput. Graph."
-, volume =	19
-, number =	3
-, year =	1985
-, pages =	"225--234"
-, note =	"Proc. SIGGRAPH '85"
-, update =	"94.09 lambert, 93.09 milone+mitchell"
+, author =      "T. Pavlidis and C. J. {Van Wyk}"
+, title =       "An Automatic Beautifier for Drawings and Illustrations"
+, journal =     "Comput. Graph."
+, volume =      19
+, number =      3
+, year =        1985
+, pages =       "225--234"
+, note =        "Proc. SIGGRAPH '85"
+, update =      "94.09 lambert, 93.09 milone+mitchell"
 }
 
 @article{p-mttss-67
-, author =	"A. Paz"
-, title =	"Minimization theorems and techniques for sequential stochastic machines"
-, journal =	"Inform. Control"
-, volume =	11
-, year =	1967
-, pages =	"155--166"
-, update =	"93.09 milone+mitchell"
+, author =      "A. Paz"
+, title =       "Minimization theorems and techniques for sequential stochastic machines"
+, journal =     "Inform. Control"
+, volume =      11
+, year =        1967
+, pages =       "155--166"
+, update =      "93.09 milone+mitchell"
 }
 
 @book{p-hissc-84
-, author =	"J. Pearl"
-, title =	"Heuristics: Intelligent Search Strategies for Computer Problem Solving"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1984
-, keywords =	"book"
+, author =      "J. Pearl"
+, title =       "Heuristics: Intelligent Search Strategies for Computer Problem Solving"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1984
+, keywords =    "book"
 }
 
 @article{p-icnt-86
-, author =	"J. Pecht"
-, title =	"On the index of concavity of neighborhood templates"
-, journal =	"Acta Cybern."
-, volume =	7
-, year =	1986
-, pages =	"373--376"
+, author =      "J. Pecht"
+, title =       "On the index of concavity of neighborhood templates"
+, journal =     "Acta Cybern."
+, volume =      7
+, year =        1986
+, pages =       "373--376"
 }
 
 @article{p-oksp-85
-, author =	"G. W. Peck"
-, title =	"On $k$-sets in the plane"
-, journal =	"Discrete Math."
-, volume =	56
-, year =	1985
-, pages =	"73--74"
-, update =	"98.03 agarwal"
+, author =      "G. W. Peck"
+, title =       "On $k$-sets in the plane"
+, journal =     "Discrete Math."
+, volume =      56
+, year =        1985
+, pages =       "73--74"
+, update =      "98.03 agarwal"
 }
 
 @techreport{p-crz-91
-, author =	"P. Pedersen"
-, title =	"Counting real zeros"
-, type =	"Technical {Report}"
-, number =	"545-R243"
-, institution =	"New York Univ."
-, address =	"New York, NY"
-, year =	1991
-, update =	"98.03 bibrelex"
+, author =      "P. Pedersen"
+, title =       "Counting real zeros"
+, type =        "Technical {Report}"
+, number =      "545-R243"
+, institution = "New York Univ."
+, address =     "New York, NY"
+, year =        1991
+, update =      "98.03 bibrelex"
 }
 
 @book{p-gcc-70
-, author =	"D. Pedoe"
-, title =	"Geometry, a comprehensive course"
-, publisher =	"Dover Publications"
-, address =	"New York"
-, year =	1970
+, author =      "D. Pedoe"
+, title =       "Geometry, a comprehensive course"
+, publisher =   "Dover Publications"
+, address =     "New York"
+, year =        1970
 }
 
 @inproceedings{pw-spcgs-89
-, author =	"J. Pegna and F.-E. Wolter"
-, title =	"A Simple Practical Criterion to Guarantee Second Order Smoothness of Blend Surfaces"
-, editor =	"B. Ravani"
-, booktitle =	"Proc. 15th ASME Design Automation Conference: Advances in Design Automation"
-, volume =	1
-, year =	1989
-, pages =	"93--105"
-, update =	"95.05 abrams"
+, author =      "J. Pegna and F.-E. Wolter"
+, title =       "A Simple Practical Criterion to Guarantee Second Order Smoothness of Blend Surfaces"
+, editor =      "B. Ravani"
+, booktitle =   "Proc. 15th ASME Design Automation Conference: Advances in Design Automation"
+, volume =      1
+, year =        1989
+, pages =       "93--105"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{pw-dmtcs-90
-, author =	"J. Pegna and F.-E. Wolter"
-, title =	"Designing and Mapping Trimming Curves on Surfaces Using Orthogonal Projection"
-, editor =	"B. Ravani"
-, booktitle =	"Proc. of the 16th ASME Design Automation Conference: Advances in Design Automation, Computer Aided and Computational Design"
-, volume =	"I"
-, year =	1990
-, pages =	"235--245"
-, update =	"95.05 abrams"
+, author =      "J. Pegna and F.-E. Wolter"
+, title =       "Designing and Mapping Trimming Curves on Surfaces Using Orthogonal Projection"
+, editor =      "B. Ravani"
+, booktitle =   "Proc. of the 16th ASME Design Automation Conference: Advances in Design Automation, Computer Aided and Computational Design"
+, volume =      "I"
+, year =        1990
+, pages =       "235--245"
+, update =      "95.05 abrams"
 }
 
 @article{pw-dmtcs-94
-, author =	"J. Pegna and F.-E. Wolter"
-, title =	"Designing and Mapping Trimming Curves on Surfaces Using Orthogonal Projection"
-, journal =	"Journal of Mechanical Design, ASME Transactions"
-, volume =	"??"
-, year =	1994
-, note =	"To appear"
-, update =	"95.05 abrams"
+, author =      "J. Pegna and F.-E. Wolter"
+, title =       "Designing and Mapping Trimming Curves on Surfaces Using Orthogonal Projection"
+, journal =     "Journal of Mechanical Design, ASME Transactions"
+, volume =      "??"
+, year =        1994
+, note =        "To appear"
+, update =      "95.05 abrams"
 }
 
 @article{pw-gcgcc-92
-, author =	"J. Pegna and F.-E. Wolter"
-, title =	"Geometrical Criteria to Guarantee Curvature Continuity of Blend Surfaces"
-, journal =	"Journal of Mechanical Design, ASME Transactions"
-, volume =	114
-, number =	1
-, year =	1992
-, pages =	"201--210"
-, update =	"95.05 abrams"
+, author =      "J. Pegna and F.-E. Wolter"
+, title =       "Geometrical Criteria to Guarantee Curvature Continuity of Blend Surfaces"
+, journal =     "Journal of Mechanical Design, ASME Transactions"
+, volume =      114
+, number =      1
+, year =        1992
+, pages =       "201--210"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{pw-frrp-97
-, author =	"Naixun Pei and Sue Whitesides"
-, title =	"On Folding Rulers in Regular Polygons"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"11--16"
-, update =	"97.11 jones"
+, author =      "Naixun Pei and Sue Whitesides"
+, title =       "On Folding Rulers in Regular Polygons"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "11--16"
+, update =      "97.11 jones"
 }
 
 @inproceedings{pw-rrc-96
-, author =	"N. Pei and S. Whitesides"
-, title =	"On the reachable regions of chains"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"161--166"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "N. Pei and S. Whitesides"
+, title =       "On the reachable regions of chains"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "161--166"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @article{p-rcbt-94
-, author =	"Roberto Peirone"
-, title =	"Reflections can be trapped"
-, journal =	"Amer. Math. Monthly"
-, volume =	101
-, year =	1994
-, pages =	"259--260"
-, update =	"01.04 orourke"
+, author =      "Roberto Peirone"
+, title =       "Reflections can be trapped"
+, journal =     "Amer. Math. Monthly"
+, volume =      101
+, year =        1994
+, pages =       "259--260"
+, update =      "01.04 orourke"
 }
 
 @techreport{pr-old-87
-, author =	"A. Pelc and I. Rival"
-, title =	"Orders with Level Diagrams"
-, number =	"TR-87-11"
-, institution =	"Department of Computer Science, University of Ottawa"
-, month =	mar
-, year =	1987
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "A. Pelc and I. Rival"
+, title =       "Orders with Level Diagrams"
+, number =      "TR-87-11"
+, institution = "Department of Computer Science, University of Ottawa"
+, month =       mar
+, year =        1987
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{ps-gs-89
-, author =	"D. Peleg and A. Sch{\"a}ffer"
-, title =	"Graph spanners"
-, journal =	"J. Graph Theory"
-, volume =	13
-, year =	1989
-, pages =	"99--116"
-, update =	"97.11 bibrelex"
+, author =      "D. Peleg and A. Sch{\"a}ffer"
+, title =       "Graph spanners"
+, journal =     "J. Graph Theory"
+, volume =      13
+, year =        1989
+, pages =       "99--116"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{pu-osh-87
-, author =	"D. Peleg and J. Ullman"
-, title =	"An optimal synchonizer for the hypercube"
-, booktitle =	"Proc. 6th ACM Symp. on Princ. Distr. Comp."
-, year =	1987
-, pages =	"77--85"
-, precedes =	"pu-osh-89"
-, update =	"98.07 bibrelex"
+, author =      "D. Peleg and J. Ullman"
+, title =       "An optimal synchonizer for the hypercube"
+, booktitle =   "Proc. 6th ACM Symp. on Princ. Distr. Comp."
+, year =        1987
+, pages =       "77--85"
+, precedes =    "pu-osh-89"
+, update =      "98.07 bibrelex"
 }
 
 @article{pu-osh-89
-, author =	"D. Peleg and J. Ullman"
-, title =	"An optimal synchonizer for the hypercube"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, year =	1989
-, pages =	"740--747"
-, succeeds =	"pu-osh-87"
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "D. Peleg and J. Ullman"
+, title =       "An optimal synchonizer for the hypercube"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, year =        1989
+, pages =       "740--747"
+, succeeds =    "pu-osh-87"
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{pu-tbser-88
-, author =	"D. Peleg and E. Upfal"
-, title =	"A tradeoff between space and efficiency for routing tables"
-, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
-, year =	1988
-, pages =	"43--52"
-, update =	"97.11 bibrelex"
+, author =      "D. Peleg and E. Upfal"
+, title =       "A tradeoff between space and efficiency for routing tables"
+, booktitle =   "Proc. 20th Annu. ACM Sympos. Theory Comput."
+, year =        1988
+, pages =       "43--52"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{p-bcspi-93
-, author =	"M. Pellegrini"
-, title =	"Building convex space partitions induced by pairwise interior-disjoint simplices"
-, type =	"Technical {Report}"
-, number =	"ICSI TR-93-039"
-, institution =	"ICSI"
-, month =	aug
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "M. Pellegrini"
+, title =       "Building convex space partitions induced by pairwise interior-disjoint simplices"
+, type =        "Technical {Report}"
+, number =      "ICSI TR-93-039"
+, institution = "ICSI"
+, month =       aug
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{p-caasv-91
-, author =	"M. Pellegrini"
-, title =	"Combinatorical and algorithmic analysis of stabbing and visibility problems in $3$-dimensional space"
-, school =	"Courant Inst. Math. Sci., New York University"
-, address =	"New York, NY"
-, month =	feb
-, year =	1991
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "M. Pellegrini"
+, title =       "Combinatorical and algorithmic analysis of stabbing and visibility problems in $3$-dimensional space"
+, school =      "Courant Inst. Math. Sci., New York University"
+, address =     "New York, NY"
+, month =       feb
+, year =        1991
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{p-efwst-96
-, author =	"Marco Pellegrini"
-, title =	"Electrostatic fields without singularities: {Theory} and algorithms"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"184--191"
-, keywords =	"electrostatic force between simplices, Monte Carlo method, integral geometry, approximation, charge densities"
-, update =	"96.09 agarwal, 96.01 mitchell"
+, author =      "Marco Pellegrini"
+, title =       "Electrostatic fields without singularities: {Theory} and algorithms"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "184--191"
+, keywords =    "electrostatic force between simplices, Monte Carlo method, integral geometry, approximation, charge densities"
+, update =      "96.09 agarwal, 96.01 mitchell"
 }
 
 @inproceedings{p-innpl-92
-, author =	"M. Pellegrini"
-, title =	"Incidence and nearest-neighbor problems for lines in $3$-space"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"130--137"
-, cites =	"aass-sdp-90, am-rsps-92, as-tsbac-90, as-anps-91, as-cscas-, as-zsha-91, cegpsss-ccclr-90, cegs-lscaa-89, cegs-sessr-89, cegs-dwclp-92, ck-plscc-89, c-sdsno-87, cs-agpli-88, csw-qoubs-90, bhosk-ershs-91, egs-ccmfa-90, fhs-cmsp-89, gss-gmppt-88, h-cscca-91, ho-empls-89, ks-ampsc-88, ls-esmpa-87, ls-pptmc-87, m-ept-91, m-apcad-83, p-srs3d-90, p-rsicl-91, ps-fsl3s-92, ss-smprg-89, t-epcp-91, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "M. Pellegrini"
+, title =       "Incidence and nearest-neighbor problems for lines in $3$-space"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "130--137"
+, cites =       "aass-sdp-90, am-rsps-92, as-tsbac-90, as-anps-91, as-cscas-, as-zsha-91, cegpsss-ccclr-90, cegs-lscaa-89, cegs-sessr-89, cegs-dwclp-92, ck-plscc-89, c-sdsno-87, cs-agpli-88, csw-qoubs-90, bhosk-ershs-91, egs-ccmfa-90, fhs-cmsp-89, gss-gmppt-88, h-cscca-91, ho-empls-89, ks-ampsc-88, ls-esmpa-87, ls-pptmc-87, m-ept-91, m-apcad-83, p-srs3d-90, p-rsicl-91, ps-fsl3s-92, ss-smprg-89, t-epcp-91, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{p-lbsl3-93
-, author =	"M. Pellegrini"
-, title =	"Lower bounds on stabbing lines in 3-space"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"53--58"
-, update =	"97.11 aronov"
+, author =      "M. Pellegrini"
+, title =       "Lower bounds on stabbing lines in 3-space"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "53--58"
+, update =      "97.11 aronov"
 }
 
 @inproceedings{p-mcaff-95
-, author =	"Marco Pellegrini"
-, title =	"{Monte Carlo} Approximation of Form Factors with Error Bounded a Priori"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"287--296"
-, keywords =	""
-, cites =	"a-ijpop-94, bgsss-mcm-66, bo-arcgi-79, cg-hrsce-85, dr-mni-75, ejla-csmcd-91, f-iptia-68, hsa-rhra-91, jvv-rgcsu-86, kkkll-mcaep-90, lsg-beer-94, m-sosdr-91, m-hsrrm-91, ps-cgi-85, pt-dpplo-90, s-igbmf-93, s-iggp-76, sh-trht-92, sp-gtpmi-89, s-tlpm-87, weh-rtapr-89, wrc-rtsdi-88, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Marco Pellegrini"
+, title =       "{Monte Carlo} Approximation of Form Factors with Error Bounded a Priori"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "287--296"
+, keywords =    ""
+, cites =       "a-ijpop-94, bgsss-mcm-66, bo-arcgi-79, cg-hrsce-85, dr-mni-75, ejla-csmcd-91, f-iptia-68, hsa-rhra-91, jvv-rgcsu-86, kkkll-mcaep-90, lsg-beer-94, m-sosdr-91, m-hsrrm-91, ps-cgi-85, pt-dpplo-90, s-igbmf-93, s-iggp-76, sh-trht-92, sp-gtpmi-89, s-tlpm-87, weh-rtapr-89, wrc-rtsdi-88, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @techreport{p-nrrsi-91
-, author =	"M. Pellegrini"
-, title =	"New results on ray-shooting and isotopy classes of lines in $3$-dimensional space"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "M. Pellegrini"
+, title =       "New results on ray-shooting and isotopy classes of lines in $3$-dimensional space"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @article{p-cfpsc-94
-, author =	"M. Pellegrini"
-, title =	"On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space"
-, journal =	"SIAM J. Comput."
-, volume =	23
-, number =	1
-, year =	1994
-, pages =	"133--153"
-, update =	"97.03 agarwal"
+, author =      "M. Pellegrini"
+, title =       "On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space"
+, journal =     "SIAM J. Comput."
+, volume =      23
+, number =      1
+, year =        1994
+, pages =       "133--153"
+, update =      "97.03 agarwal"
 }
 
 @inproceedings{p-lmps3-93
-, author =	"M. Pellegrini"
-, title =	"On lines missing polyhedral sets in $3$-space"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"19--28"
-, cites =	"am-rsps-92, as-anps-91, as-tsbac-90, as-car-92, c-oaitd-89, cegs-lscaa-89, cegs-ablsp-89, cegs-dwclp-92, cosw-cds-84, c-narsc-87, bhosk-ershs-91, bhok-sanvp-92, e-acg-87, egs-ccmfa-90, gy-tsr-80, m-cen-89, m-cha-90i, m-rph-91, n-pa-88, n-tsott-86, ns-spots-89, ns-tsp-89, p-srs3d-90, p-rst3s-93, p-innpl-92, ps-fsl3s-92, pss-stsps-88, ps-cgi-85, pt-espl-89, rs-eoshs-88i, ss-smprg-89, t-mss-85, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
+, author =      "M. Pellegrini"
+, title =       "On lines missing polyhedral sets in $3$-space"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "19--28"
+, cites =       "am-rsps-92, as-anps-91, as-tsbac-90, as-car-92, c-oaitd-89, cegs-lscaa-89, cegs-ablsp-89, cegs-dwclp-92, cosw-cds-84, c-narsc-87, bhosk-ershs-91, bhok-sanvp-92, e-acg-87, egs-ccmfa-90, gy-tsr-80, m-cen-89, m-cha-90i, m-rph-91, n-pa-88, n-tsott-86, ns-spots-89, ns-tsp-89, p-srs3d-90, p-rst3s-93, p-innpl-92, ps-fsl3s-92, pss-stsps-88, ps-cgi-85, pt-espl-89, rs-eoshs-88i, ss-smprg-89, t-mss-85, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 93.09 jones"
 }
 
 @article{p-lmps3-94
-, author =	"M. Pellegrini"
-, title =	"On lines missing polyhedral sets in $3$-space"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"203--221"
-, update =	"97.03 agarwal"
+, author =      "M. Pellegrini"
+, title =       "On lines missing polyhedral sets in $3$-space"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "203--221"
+, update =      "97.03 agarwal"
 }
 
 @inproceedings{p-plmps-94
-, author =	"Marco Pellegrini"
-, title =	"On Point Location and Motion Planning among Simplices"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	"95--104"
-, precedes =	"p-plmps-96"
-, update =	"97.03 smid, 96.09 orourke, 94.01 jones"
+, author =      "Marco Pellegrini"
+, title =       "On Point Location and Motion Planning among Simplices"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       "95--104"
+, precedes =    "p-plmps-96"
+, update =      "97.03 smid, 96.09 orourke, 94.01 jones"
 }
 
 @article{p-plmps-96
-, author =	"Marco Pellegrini"
-, title =	"On Point Location and Motion Planning among Simplices"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, year =	1996
-, pages =	"1061--1081"
-, succeeds =	"p-plmps-94"
-, update =	"97.03 smid"
+, author =      "Marco Pellegrini"
+, title =       "On Point Location and Motion Planning among Simplices"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, pages =       "1061--1081"
+, succeeds =    "p-plmps-94"
+, update =      "97.03 smid"
 }
 
 @inproceedings{p-zcdps-91
-, author =	"M. Pellegrini"
-, title =	"On the zone of a co-dimension $p$ surface in a hyperplane arrangement"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"233--238"
-, precedes =	"aps-zsha-93"
-, cites =	"ams-sscch-91, as-zsha-91, c-narsc-87, e-acg-87, g-cp-67, ZZZ"
-, update =	"98.07 bibrelex, 95.09 aronov"
+, author =      "M. Pellegrini"
+, title =       "On the zone of a co-dimension $p$ surface in a hyperplane arrangement"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "233--238"
+, precedes =    "aps-zsha-93"
+, cites =       "ams-sscch-91, as-zsha-91, c-narsc-87, e-acg-87, g-cp-67, ZZZ"
+, update =      "98.07 bibrelex, 95.09 aronov"
 }
 
 @inproceedings{p-rsicl-91
-, author =	"M. Pellegrini"
-, title =	"Ray-shooting and isotopy classes of lines in $3$-dimensional space"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"20--31"
-, keywords =	"ray tracing, random sampling"
+, author =      "M. Pellegrini"
+, title =       "Ray-shooting and isotopy classes of lines in $3$-dimensional space"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "20--31"
+, keywords =    "ray tracing, random sampling"
 }
 
 @incollection{p-rsls-97
-, author =	"M. Pellegrini"
-, title =	"Ray shooting and lines in space"
-, chapter =	32
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"599--614"
-, update =	"97.11 orourke"
+, author =      "M. Pellegrini"
+, title =       "Ray shooting and lines in space"
+, chapter =     32
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "599--614"
+, update =      "97.11 orourke"
 }
 
 @article{p-rst3s-93
-, author =	"M. Pellegrini"
-, title =	"Ray shooting on triangles in $3$-space"
-, journal =	"Algorithmica"
-, volume =	9
-, year =	1993
-, pages =	"471--494"
-, update =	"94.05 matousek"
+, author =      "M. Pellegrini"
+, title =       "Ray shooting on triangles in $3$-space"
+, journal =     "Algorithmica"
+, volume =      9
+, year =        1993
+, pages =       "471--494"
+, update =      "94.05 matousek"
 }
 
 @article{p-rhsrp-96
-, author =	"M. Pellegrini"
-, title =	"Repetitive hidden surface removal for polyhedra"
-, journal =	"J. Algorithms"
-, volume =	21
-, year =	1996
-, pages =	"80--101"
-, update =	"96.09 smid"
+, author =      "M. Pellegrini"
+, title =       "Repetitive hidden surface removal for polyhedra"
+, journal =     "J. Algorithms"
+, volume =      21
+, year =        1996
+, pages =       "80--101"
+, update =      "96.09 smid"
 }
 
 @inproceedings{p-rhsrp-93
-, author =	"Marco Pellegrini"
-, title =	"Repetitive Hidden Surface Removal for Polyhedral Scenes"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"541--552"
-, update =	"96.05 agarwal, 93.09 smid, 93.05 jones"
+, author =      "Marco Pellegrini"
+, title =       "Repetitive Hidden Surface Removal for Polyhedral Scenes"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "541--552"
+, update =      "96.05 agarwal, 93.09 smid, 93.05 jones"
 }
 
 @inproceedings{p-srs3d-90
-, author =	"M. Pellegrini"
-, title =	"Stabbing and ray shooting in $3$-dimensional space"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"177--186"
-, cites =	"a-dapal-89, a-rsoas-89, ak-frtrc-87, aw-alts-87, bdeg-vmpv-90, cegs-lscaa-89, c-narsc-87, cs-vppt-86, e-acg-87, egs-cmfal-88, emprww-sls-82, eos-calha-86, g-irt-89, gos-rsipl-89, hp-mag-52, hs-ndssg-86, jk-spals-88, m-ai-70, mo-al3sd-88, os-oshsr-89, s-chdch-86, sml-rtatp-88, s-agtd-34, s-pcg-88, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex, 97.11 bibrelex"
+, author =      "M. Pellegrini"
+, title =       "Stabbing and ray shooting in $3$-dimensional space"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "177--186"
+, cites =       "a-dapal-89, a-rsoas-89, ak-frtrc-87, aw-alts-87, bdeg-vmpv-90, cegs-lscaa-89, c-narsc-87, cs-vppt-86, e-acg-87, egs-cmfal-88, emprww-sls-82, eos-calha-86, g-irt-89, gos-rsipl-89, hp-mag-52, hs-ndssg-86, jk-spals-88, m-ai-70, mo-al3sd-88, os-oshsr-89, s-chdch-86, sml-rtatp-88, s-agtd-34, s-pcg-88, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{ps-fsl3d-91
-, author =	"M. Pellegrini and P. Shor"
-, title =	"Finding stabbing lines in $3$-dimensional space"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"24--31"
+, author =      "M. Pellegrini and P. Shor"
+, title =       "Finding stabbing lines in $3$-dimensional space"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "24--31"
 }
 
 @article{ps-fsl3s-92
-, author =	"M. Pellegrini and P. Shor"
-, title =	"Finding stabbing lines in $3$-space"
-, journal =	"Discrete Comput. Geom."
-, volume =	8
-, year =	1992
-, pages =	"191--208"
-, update =	"94.01 matousek"
+, author =      "M. Pellegrini and P. Shor"
+, title =       "Finding stabbing lines in $3$-space"
+, journal =     "Discrete Comput. Geom."
+, volume =      8
+, year =        1992
+, pages =       "191--208"
+, update =      "94.01 matousek"
 }
 
 @article{p-afilb-84
-, author =	"Q. S. Peng"
-, title =	"An Algorithm for Finding Intersection Lines between Two {B}-Spline Surfaces"
-, journal =	"CAD"
-, volume =	16
-, number =	4
-, month =	jul
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "Q. S. Peng"
+, title =       "An Algorithm for Finding Intersection Lines between Two {B}-Spline Surfaces"
+, journal =     "CAD"
+, volume =      16
+, number =      4
+, month =       jul
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{p-emmls-73
-, author =	"K. R. Penrose"
-, title =	"Extremal Motion of a Moved Line Segment"
-, booktitle =	"Proc. of the Montana Acad. of Sciences"
-, year =	1973
-, pages =	"46--51"
-, update =	"93.09 milone+mitchell"
+, author =      "K. R. Penrose"
+, title =       "Extremal Motion of a Moved Line Segment"
+, booktitle =   "Proc. of the Montana Acad. of Sciences"
+, year =        1973
+, pages =       "46--51"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{p-p-78
-, author =	"R. Penrose"
-, title =	"Pentaplexity"
-, journal =	"Eureka"
-, volume =	39
-, year =	1978
-, update =	"97.11 bibrelex"
+, author =      "R. Penrose"
+, title =       "Pentaplexity"
+, journal =     "Eureka"
+, volume =      39
+, year =        1978
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{pmp-ufemg-89
-, author =	"J. Peraire and K. Morgan and J. Peiro"
-, title =	"Unstructured finite element mesh generation and adaptive procedures for cfd."
-, booktitle =	"{AGARD FDP}: Specialists's Meeting"
-, month =	may
-, year =	1989
-, update =	"98.11 bibrelex"
+, author =      "J. Peraire and K. Morgan and J. Peiro"
+, title =       "Unstructured finite element mesh generation and adaptive procedures for cfd."
+, booktitle =   "{AGARD FDP}: Specialists's Meeting"
+, month =       may
+, year =        1989
+, update =      "98.11 bibrelex"
 }
 
 @book{psu-mnp-88
-, author =	"A. L. Peressini and F. E. Sullivan and J. J. Uhl"
-, title =	"The Mathematics of Nonlinear Programming"
-, series =	"Undergraduate Texts in Mathematics"
-, publisher =	"Springer-Verlag"
-, year =	1988
-, update =	"97.03 gaertner+salinger"
+, author =      "A. L. Peressini and F. E. Sullivan and J. J. Uhl"
+, title =       "The Mathematics of Nonlinear Programming"
+, series =      "Undergraduate Texts in Mathematics"
+, publisher =   "Springer-Verlag"
+, year =        1988
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{ps-cncsr-90
-, author =	"M. Perles and S. Shelah"
-, title =	"A closed $(n+1)$-convex set in {$R^{2}$} is a union of $n^{6}$ convex sets"
-, journal =	"Israel J. Math."
-, volume =	70
-, year =	1990
-, pages =	"305--312"
-, update =	"98.03 bibrelex"
+, author =      "M. Perles and S. Shelah"
+, title =       "A closed $(n+1)$-convex set in {$R^{2}$} is a union of $n^{6}$ convex sets"
+, journal =     "Israel J. Math."
+, volume =      70
+, year =        1990
+, pages =       "305--312"
+, update =      "98.03 bibrelex"
 }
 
 @article{p--92
-, author =	"G. Perrot"
-, title =	"??"
-, journal =	"J. Comp. Chem."
-, volume =	13
-, number =	1
-, year =	1992
-, pages =	"1--11"
-, update =	"98.03 bibrelex"
+, author =      "G. Perrot"
+, title =       "??"
+, journal =     "J. Comp. Chem."
+, volume =      13
+, number =      1
+, year =        1992
+, pages =       "1--11"
+, update =      "98.03 bibrelex"
 }
 
 @article{p-nmasp-78
-, author =	"H. Persson"
-, title =	"{NC} Machining of Arbitrarily Shaped Pockets"
-, journal =	"Comput. Aided Design"
-, volume =	10
-, number =	3
-, month =	may
-, year =	1978
-, pages =	"169--174"
-, update =	"93.09 held"
-, annote =	"makes use of `bisector' net"
+, author =      "H. Persson"
+, title =       "{NC} Machining of Arbitrarily Shaped Pockets"
+, journal =     "Comput. Aided Design"
+, volume =      10
+, number =      3
+, month =       may
+, year =        1978
+, pages =       "169--174"
+, update =      "93.09 held"
+, annote =      "makes use of `bisector' net"
 }
 
 @incollection{p-gsa-89
-, author =	"J. Pertin-Troccaz"
-, title =	"Grasping: {A} state of the art"
-, editor =	"O. Khatib and J. J. Craig and T. Lozano-Perez"
-, booktitle =	"The Robotics Review"
-, volume =	1
-, publisher =	"MIT Press"
-, year =	1989
-, pages =	"71--98"
-, update =	"98.03 bibrelex"
+, author =      "J. Pertin-Troccaz"
+, title =       "Grasping: {A} state of the art"
+, editor =      "O. Khatib and J. J. Craig and T. Lozano-Perez"
+, booktitle =   "The Robotics Review"
+, volume =      1
+, publisher =   "MIT Press"
+, year =        1989
+, pages =       "71--98"
+, update =      "98.03 bibrelex"
 }
 
 @article{ps-prmsw-88
-, author =	"M. A. Peshkin and A. C. Sanderson"
-, title =	"Planning robotic manipulation strategies for workpieces that slide"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	4
-, number =	5
-, year =	1988
-, pages =	"524--531"
-, update =	"98.07 bibrelex"
+, author =      "M. A. Peshkin and A. C. Sanderson"
+, title =       "Planning robotic manipulation strategies for workpieces that slide"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      4
+, number =      5
+, year =        1988
+, pages =       "524--531"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{ps-rgpcr-85
-, author =	"M. A. Peshkin and A. C. Sanderson"
-, title =	"Reachable grasps on a polygon: {The} convex rope algorithm"
-, type =	"Technical {Report}"
-, number =	"CMU-RI-TR-85-6"
-, institution =	"Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "M. A. Peshkin and A. C. Sanderson"
+, title =       "Reachable grasps on a polygon: {The} convex rope algorithm"
+, type =        "Technical {Report}"
+, number =      "CMU-RI-TR-85-6"
+, institution = "Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @article{ps-rgpcr-86
-, author =	"M. A. Peshkin and A. C. Sanderson"
-, title =	"Reachable Grasps on a Polygon: {The} Convex Rope Algorithm"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	"RA-2"
-, year =	1986
-, pages =	"53--58"
-, update =	"93.09 milone+mitchell"
+, author =      "M. A. Peshkin and A. C. Sanderson"
+, title =       "Reachable Grasps on a Polygon: {The} Convex Rope Algorithm"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      "RA-2"
+, year =        1986
+, pages =       "53--58"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{ps-mpsw-88
-, author =	"M. A. Peshkin and A. C. Sanderson"
-, title =	"The motion of a pushed sliding workpiece"
-, journal =	"Internat. J. Robot. Res."
-, volume =	4
-, number =	6
-, year =	1988
-, pages =	"569--598"
-, update =	"98.07 bibrelex"
+, author =      "M. A. Peshkin and A. C. Sanderson"
+, title =       "The motion of a pushed sliding workpiece"
+, journal =     "Internat. J. Robot. Res."
+, volume =      4
+, number =      6
+, year =        1988
+, pages =       "569--598"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{p-srdss-73
-, author =	"C. Peterkin"
-, title =	"Some results on {Davenport--Schinzel} sequences"
-, editor =	"R. Thomas and H. Williams"
-, booktitle =	"Congressus Numer. IX: Proc. 3rd Manitoba Conf. on Numer. Math. and Computing"
-, year =	1973
-, pages =	"337--344"
-, update =	"95.09 agarwal"
+, author =      "C. Peterkin"
+, title =       "Some results on {Davenport--Schinzel} sequences"
+, editor =      "R. Thomas and H. Williams"
+, booktitle =   "Congressus Numer. IX: Proc. 3rd Manitoba Conf. on Numer. Math. and Computing"
+, year =        1973
+, pages =       "337--344"
+, update =      "95.09 agarwal"
 }
 
 @techreport{p-lssic-
-, author =	"J. Peters"
-, title =	"Local smooth surface interpolation: {A} classification"
-, type =	"Preprint"
-, institution =	"Univ. Wisconsin"
-, year =	"??"
-, update =	"98.07 bibrelex"
+, author =      "J. Peters"
+, title =       "Local smooth surface interpolation: {A} classification"
+, type =        "Preprint"
+, institution = "Univ. Wisconsin"
+, year =        "??"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{psff-atsde-97
-, author =	"T. Peters and N. Stewart and P. Fussel and D. Ferguson"
-, title =	"Algorithmic tolerances and semantics in data exchange"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"403--405"
-, cites =	"ds-rnmgc-, hpy-rismp1-96, hpy-rismp2-96, -nwp-91, -sp-, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "T. Peters and N. Stewart and P. Fussel and D. Ferguson"
+, title =       "Algorithmic tolerances and semantics in data exchange"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "403--405"
+, cites =       "ds-rnmgc-, hpy-rismp1-96, hpy-rismp2-96, -nwp-91, -sp-, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @techreport{p-bcsgm-??
-, author =	"D. P. Peterson"
-, title =	"Boundary to constructive solid geometry mappings: a focus on $2$-d issues"
-, type =	"Report"
-, number =	"??"
-, institution =	"CAD Tech. Div., Sandia National Lab."
-, address =	"Albuquerque, NM"
-, year =	"??"
+, author =      "D. P. Peterson"
+, title =       "Boundary to constructive solid geometry mappings: a focus on $2$-d issues"
+, type =        "Report"
+, number =      "??"
+, institution = "CAD Tech. Div., Sandia National Lab."
+, address =     "Albuquerque, NM"
+, year =        "??"
 }
 
 @techreport{p-hresr-84
-, author =	"D. P. Peterson"
-, title =	"Halfspace representation of extrusions, solids of revolution, and pyramids"
-, type =	"Report"
-, number =	"SAND84-0572"
-, institution =	"Sandia National Lab."
-, address =	"Albuquerque, NM"
-, year =	1984
+, author =      "D. P. Peterson"
+, title =       "Halfspace representation of extrusions, solids of revolution, and pyramids"
+, type =        "Report"
+, number =      "SAND84-0572"
+, institution = "Sandia National Lab."
+, address =     "Albuquerque, NM"
+, year =        1984
 }
 
 @incollection{p-tns-94
-, author =	"John W. Peterson"
-, title =	"Tessellation of {NURB} Surfaces"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"286--320"
-, keywords =	"surface subdivision, NURB, Bezier surface, B-spline surface, polygonization"
-, update =	"94.09 heckbert"
-, annote =	"Gives code for polygonizing a very general class of
+, author =      "John W. Peterson"
+, title =       "Tessellation of {NURB} Surfaces"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "286--320"
+, keywords =    "surface subdivision, NURB, Bezier surface, B-spline surface, polygonization"
+, update =      "94.09 heckbert"
+, annote =      "Gives code for polygonizing a very general class of
 parametric surfaces: NURBs. Polygonization of parametric surfaces is useful
 both for rendering and for modeling. Contains C code."
 }
 
 @article{p-cgavh-98
-, author =	"S. Petitjean"
-, title =	"A Computational Geometric Approach to Visual Hulls"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"407--436"
-, update =	"98.11 devillers"
+, author =      "S. Petitjean"
+, title =       "A Computational Geometric Approach to Visual Hulls"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "407--436"
+, update =      "98.11 devillers"
 }
 
 @article{pb-rnrps-01
-, author =	"S. Petitjean and E. Boyer"
-, title =	"Regular and non-regular point sets: {Properties} and reconstruction"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"101--126"
-, update =	"01.11 smid"
+, author =      "S. Petitjean and E. Boyer"
+, title =       "Regular and non-regular point sets: {Properties} and reconstruction"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "101--126"
+, update =      "01.11 smid"
 }
 
 @article{po-tras-49
-, author =	"I. G. Petrovski{\u{\i}} and O. A. Ole{\u{\i}}nik"
-, title =	"On the topology of real algebraic surfaces"
-, journal =	"Isvestia Akad. Nauk SSSR. Ser. Mat."
-, volume =	13
-, year =	1949
-, pages =	"389--402"
-, note =	"In Russian."
-, update =	"98.07 agarwal"
+, author =      "I. G. Petrovski{\u{\i}} and O. A. Ole{\u{\i}}nik"
+, title =       "On the topology of real algebraic surfaces"
+, journal =     "Isvestia Akad. Nauk SSSR. Ser. Mat."
+, volume =      13
+, year =        1949
+, pages =       "389--402"
+, note =        "In Russian."
+, update =      "98.07 agarwal"
 }
 
 @article{pc-cds-75
-, author =	"T. Peucker and N. Chrisman"
-, title =	"Cartographic data structures"
-, journal =	"Amer. Cartogr."
-, volume =	2
-, year =	1975
-, pages =	"55--69"
-, update =	"98.11 bibrelex"
+, author =      "T. Peucker and N. Chrisman"
+, title =       "Cartographic data structures"
+, journal =     "Amer. Cartogr."
+, volume =      2
+, year =        1975
+, pages =       "55--69"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{pflm-tin-78
-, author =	"T. K. Peucker and R. J. Fowler and J. J. Little and D. M. Mark"
-, title =	"The triangulated irregular network"
-, booktitle =	"Amer. Soc. Photogrammetry Proc. Digital Terrain Models Symposium"
-, year =	1978
-, pages =	"516--532"
-, update =	"98.07 bibrelex"
+, author =      "T. K. Peucker and R. J. Fowler and J. J. Little and D. M. Mark"
+, title =       "The triangulated irregular network"
+, booktitle =   "Amer. Soc. Photogrammetry Proc. Digital Terrain Models Symposium"
+, year =        1978
+, pages =       "516--532"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{pm-aiecg-90
-, title =	"{ARC}/{INFO}: an example of contemporary geograhic information system"
-, editor =	"D. J. Peuquet and D. F. Marble"
-, booktitle =	"Introductory Readings in Geographic Information Systems"
-, publisher =	"Taylor \& Francis"
-, address =	"London"
-, year =	1990
-, pages =	"90--99"
-, update =	"97.11 bibrelex"
+, title =       "{ARC}/{INFO}: an example of contemporary geograhic information system"
+, editor =      "D. J. Peuquet and D. F. Marble"
+, booktitle =   "Introductory Readings in Geographic Information Systems"
+, publisher =   "Taylor \& Francis"
+, address =     "London"
+, year =        1990
+, pages =       "90--99"
+, update =      "97.11 bibrelex"
 }
 
 @book{pm-irgis-90
-, title =	"Introductory Readings in Geographic Information Systems"
-, editor =	"D. J. Peuquet and D. F. Marble"
-, publisher =	"Taylor \& Francis"
-, address =	"London"
-, year =	1990
-, update =	"96.09 kreveld"
+, title =       "Introductory Readings in Geographic Information Systems"
+, editor =      "D. J. Peuquet and D. F. Marble"
+, publisher =   "Taylor \& Francis"
+, address =     "London"
+, year =        1990
+, update =      "96.09 kreveld"
 }
 
 @incollection{pm-tdds-90
-, title =	"Technical description of the {DIME} system"
-, editor =	"D. J. Peuquet and D. F. Marble"
-, booktitle =	"Introductory Readings in Geographic Information Systems"
-, publisher =	"Taylor \& Francis"
-, address =	"London"
-, year =	1990
-, pages =	"100--111"
-, update =	"97.11 bibrelex"
+, title =       "Technical description of the {DIME} system"
+, editor =      "D. J. Peuquet and D. F. Marble"
+, booktitle =   "Introductory Readings in Geographic Information Systems"
+, publisher =   "Taylor \& Francis"
+, address =     "London"
+, year =        1990
+, pages =       "100--111"
+, update =      "97.11 bibrelex"
 }
 
 @article{p-ccdmd-83
-, author =	"J. L. Pfaltz"
-, title =	"Convex clusters in a discrete $m$-dimensional space"
-, journal =	"SIAM J. Comput."
-, volume =	12
-, year =	1983
-, pages =	"734--750"
+, author =      "J. L. Pfaltz"
+, title =       "Convex clusters in a discrete $m$-dimensional space"
+, journal =     "SIAM J. Comput."
+, volume =      12
+, year =        1983
+, pages =       "734--750"
 }
 
 @article{pbc-pmrui-80
-, author =	"J. L. Pfaltz and W. J. Berman and E. M. Cagley"
-, title =	"Partial-match retrieval using indexed descriptor files"
-, journal =	"Commun. ACM"
-, volume =	23
-, year =	1980
-, pages =	"522--528"
+, author =      "J. L. Pfaltz and W. J. Berman and E. M. Cagley"
+, title =       "Partial-match retrieval using indexed descriptor files"
+, journal =     "Commun. ACM"
+, volume =      23
+, year =        1980
+, pages =       "522--528"
 }
 
 @article{prw-sgcp-94
-, author =	"U. Pferschy and R. Rudolf and G. J. Woeginger"
-, title =	"Some geometric clustering problems"
-, journal =	"Nordic J. Comput."
-, volume =	1
-, year =	1994
-, pages =	"246--263"
-, update =	"95.01 smid"
+, author =      "U. Pferschy and R. Rudolf and G. J. Woeginger"
+, title =       "Some geometric clustering problems"
+, journal =     "Nordic J. Comput."
+, volume =      1
+, year =        1994
+, pages =       "246--263"
+, update =      "95.01 smid"
 }
 
 @inproceedings{pk-c4sar-96
-, author =	"H. Pfister and A. E. Kaufman"
-, title =	"Cube-4 -- {A} Scalable Architecture for Real-Time Volume Rendering"
-, booktitle =	"IEEE Visualization '96 Proceedings"
-, publisher =	"ACM/SIGGRAPH Press"
-, address =	"San Francisco, CA"
-, month =	oct
-, year =	1996
-, pages =	"47--54"
-, update =	"98.03 mitchell"
+, author =      "H. Pfister and A. E. Kaufman"
+, title =       "Cube-4 -- {A} Scalable Architecture for Real-Time Volume Rendering"
+, booktitle =   "IEEE Visualization '96 Proceedings"
+, publisher =   "ACM/SIGGRAPH Press"
+, address =     "San Francisco, CA"
+, month =       oct
+, year =        1996
+, pages =       "47--54"
+, update =      "98.03 mitchell"
 }
 
 @article{p-rpsts-95
-, author =	"G. Ch. Pflug"
-, title =	"Random planar shapes and their statistical recognition"
-, journal =	"Ann. Math. Artif. Intell."
-, volume =	13
-, year =	1995
-, pages =	"267--280"
-, keywords =	"matching, shape recognition, vision"
-, update =	"98.07 bibrelex, 95.09 mitchell"
+, author =      "G. Ch. Pflug"
+, title =       "Random planar shapes and their statistical recognition"
+, journal =     "Ann. Math. Artif. Intell."
+, volume =      13
+, year =        1995
+, pages =       "267--280"
+, keywords =    "matching, shape recognition, vision"
+, update =      "98.07 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{pkgh-rcsmc-97
-, author =	"M. Pharr and C. Kolb and R. Gershbein and P. Hanrahan"
-, title =	"Rendering complex scenes with memory-coherent ray tracing"
-, booktitle =	"Proc. SIGGRAPH '97"
-, series =	"Computer Graphics Proceedings, Annual Conference Series"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"Addison-Wesley"
-, year =	1997
-, pages =	"101--108"
-, update =	"98.07 agarwal, 98.03 agarwal"
+, author =      "M. Pharr and C. Kolb and R. Gershbein and P. Hanrahan"
+, title =       "Rendering complex scenes with memory-coherent ray tracing"
+, booktitle =   "Proc. SIGGRAPH '97"
+, series =      "Computer Graphics Proceedings, Annual Conference Series"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "Addison-Wesley"
+, year =        1997
+, pages =       "101--108"
+, update =      "98.07 agarwal, 98.03 agarwal"
 }
 
 @book{p-mh-85
-, author =	"C. G. Phillips"
-, title =	"Movements of the hand"
-, publisher =	"Liverpool University Press"
-, year =	1985
-, update =	"98.07 bibrelex"
+, author =      "C. G. Phillips"
+, title =       "Movements of the hand"
+, publisher =   "Liverpool University Press"
+, year =        1985
+, update =      "98.07 bibrelex"
 }
 
 @techreport{p-amasg-90
-, author =	"J. Phillips"
-, title =	"On approximate matching against sets of geometric models"
-, type =	"Technical {Report}"
-, institution =	"RUTCOR, Ruters University"
-, address =	"New Brunswick, New Jersey"
-, month =	jul
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "J. Phillips"
+, title =       "On approximate matching against sets of geometric models"
+, type =        "Technical {Report}"
+, institution = "RUTCOR, Ruters University"
+, address =     "New Brunswick, New Jersey"
+, month =       jul
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @article{pg-aldit-84
-, author =	"M. B. Phillips and M. O. Garret"
-, title =	"An algorithm for locating and displaying the intersection of two arbitary surfaces"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	"??"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "M. B. Phillips and M. O. Garret"
+, title =       "An algorithm for locating and displaying the intersection of two arbitary surfaces"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      "??"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @techreport{pbc-muccm-93
-, author =	"S. D. Phillips and B. Borchardt and G. Caskey"
-, title =	"Measurement uncertainty considerations for coordinate measuring machines"
-, type =	"Technical {Report}"
-, number =	"NISTIR 5170"
-, institution =	"Precision Engineering Division, National Institute of Standards and Technology"
-, address =	"Gaithersburg, MD"
-, month =	apr
-, year =	1993
-, update =	"98.07 bibrelex"
+, author =      "S. D. Phillips and B. Borchardt and G. Caskey"
+, title =       "Measurement uncertainty considerations for coordinate measuring machines"
+, type =        "Technical {Report}"
+, number =      "NISTIR 5170"
+, institution = "Precision Engineering Division, National Institute of Standards and Technology"
+, address =     "Gaithersburg, MD"
+, month =       apr
+, year =        1993
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{prs-crtcs-94
-, author =	"B. Piazza and R. Ringeisen and S. Stueckle"
-, title =	"On {Conway}'s reduction of the thrackle conjecture and some associated drawings"
-, year =	1994
-, note =	"To appear"
-, update =	"99.03 forrest, 98.03 bibrelex"
+, author =      "B. Piazza and R. Ringeisen and S. Stueckle"
+, title =       "On {Conway}'s reduction of the thrackle conjecture and some associated drawings"
+, year =        1994
+, note =        "To appear"
+, update =      "99.03 forrest, 98.03 bibrelex"
 }
 
 @incollection{prs-pnmcs-91
-, author =	"B. Piazza and R. Ringeisen and S. Stueckle"
-, title =	"Properties of non-minimum crossings for some classes of graphs"
-, editor =	"Y. Alavi"
-, booktitle =	"Graph Theory, Combinatorics and Applications"
-, volume =	2
-, publisher =	"John Wiley \& Sons"
-, address =	"New York, NY"
-, year =	1991
-, update =	"99.11 bibrelex, 98.03 bibrelex"
+, author =      "B. Piazza and R. Ringeisen and S. Stueckle"
+, title =       "Properties of non-minimum crossings for some classes of graphs"
+, editor =      "Y. Alavi"
+, booktitle =   "Graph Theory, Combinatorics and Applications"
+, volume =      2
+, publisher =   "John Wiley \& Sons"
+, address =     "New York, NY"
+, year =        1991
+, update =      "99.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{pq-samcn-82
-, author =	"J. C. Picard and M. Queyranne"
-, title =	"Selected applications of minimum cuts in a network"
-, journal =	"INFOR- Canad. J. Oper. Res. Inform. Process."
-, volume =	20
-, year =	1982
-, pages =	"394--422"
-, update =	"97.11 bibrelex"
+, author =      "J. C. Picard and M. Queyranne"
+, title =       "Selected applications of minimum cuts in a network"
+, journal =     "INFOR- Canad. J. Oper. Res. Inform. Process."
+, volume =      20
+, year =        1982
+, pages =       "394--422"
+, update =      "97.11 bibrelex"
 }
 
 @article{pr-cardf-78
-, author =	"J. C. Picard and H. Ratliff"
-, title =	"A cut approach to the rectilinear distance facility location problem"
-, journal =	"Oper. Res."
-, volume =	"??"
-, year =	1978
-, pages =	"422--433"
-, update =	"97.11 bibrelex"
+, author =      "J. C. Picard and H. Ratliff"
+, title =       "A cut approach to the rectilinear distance facility location problem"
+, journal =     "Oper. Res."
+, volume =      "??"
+, year =        1978
+, pages =       "422--433"
+, update =      "97.11 bibrelex"
 }
 
 @article{p-sledd-39
-, author =	"S. Piccard"
-, title =	"Sur les ensembles de Distances des Ensembles de points d'un Espace {Euclidean}"
-, journal =	"Mem. Univ. Neuchatel"
-, volume =	13
-, year =	1939
-, update =	"97.11 bibrelex"
+, author =      "S. Piccard"
+, title =       "Sur les ensembles de Distances des Ensembles de points d'un Espace {Euclidean}"
+, journal =     "Mem. Univ. Neuchatel"
+, volume =      13
+, year =        1939
+, update =      "97.11 bibrelex"
 }
 
 @article{p-gzz-99
-, author =	"G. Pick"
-, title =	"Geometrisches zur {Zahlenlehre}"
-, journal =	"Naturwissenschaftliche Zeitschrift Lotus (Prag)"
-, volume =	"??"
-, year =	1899
-, pages =	"311--319"
-, update =	"98.03 bibrelex"
+, author =      "G. Pick"
+, title =       "Geometrisches zur {Zahlenlehre}"
+, journal =     "Naturwissenschaftliche Zeitschrift Lotus (Prag)"
+, volume =      "??"
+, year =        1899
+, pages =       "311--319"
+, update =      "98.03 bibrelex"
 }
 
 @article{p-rngpg-95
-, author =	"C. A. Pickover"
-, title =	"Random Number Generators: Pretty Good Ones Are Easy to Find"
-, journal =	"Visual Comput."
-, volume =	11
-, number =	7
-, year =	1995
-, pages =	"369--377"
-, update =	"96.01 held"
+, author =      "C. A. Pickover"
+, title =       "Random Number Generators: Pretty Good Ones Are Easy to Find"
+, journal =     "Visual Comput."
+, volume =      11
+, number =      7
+, year =        1995
+, pages =       "369--377"
+, update =      "96.01 held"
 }
 
 @book{p-ota-86
-, author =	"D. Pierre"
-, title =	"Optimization theory with applications"
-, publisher =	"Dover"
-, address =	"New York, NY"
-, year =	1986
-, update =	"98.07 bibrelex"
+, author =      "D. Pierre"
+, title =       "Optimization theory with applications"
+, publisher =   "Dover"
+, address =     "New York, NY"
+, year =        1986
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{pp-pcsds-93
-, author =	"A. Pietracaprina and F. P. Preparata"
-, title =	"A Practical Constructive Scheme for Deterministic Shared-Memory Access"
-, booktitle =	"Proc. 5th ACM Sympos. Parallel Algorithms Architect."
-, year =	1993
-, pages =	"101--109"
-, update =	"96.09 orourke"
+, author =      "A. Pietracaprina and F. P. Preparata"
+, title =       "A Practical Constructive Scheme for Deterministic Shared-Memory Access"
+, booktitle =   "Proc. 5th ACM Sympos. Parallel Algorithms Architect."
+, year =        1993
+, pages =       "101--109"
+, update =      "96.09 orourke"
 }
 
 @article{p-orrc-81
-, author =	"P. Y. Pinter"
-, title =	"Optimal routing in rectilinear channels"
-, journal =	"VLSI Systems and computations"
-, volume =	"??"
-, year =	1981
-, pages =	"160--177"
-, update =	"98.07 bibrelex"
+, author =      "P. Y. Pinter"
+, title =       "Optimal routing in rectilinear channels"
+, journal =     "VLSI Systems and computations"
+, volume =      "??"
+, year =        1981
+, pages =       "160--177"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{p-gacg-99
-, author =	"Sylvain Pion"
-, title =	"De la g\'eom\'etrie algorithmique au calcul g\'eom\'etrique"
-, type =	"Th\`{e}se de doctorat en sciences"
-, school =	"Universit\'e de Nice-Sophia Antipolis"
-, address =	"France"
-, year =	1999
-, note =	"TU-0619"
-, keywords =	"doctoral thesis"
-, update =	"02.03 devillers, 00.03 devillers"
+, author =      "Sylvain Pion"
+, title =       "De la g\'eom\'etrie algorithmique au calcul g\'eom\'etrique"
+, type =        "Th\`{e}se de doctorat en sciences"
+, school =      "Universit\'e de Nice-Sophia Antipolis"
+, address =     "France"
+, year =        1999
+, note =        "TU-0619"
+, keywords =    "doctoral thesis"
+, update =      "02.03 devillers, 00.03 devillers"
 }
 
 @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 =	"https://hal.inria.fr/inria-00344513"
-, update =	"01.07 devillers, 00.03 devillers, 99.07 devillers"
+, 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 = "https://inria.hal.science/inria-00344513"
+, update =      "01.07 devillers, 00.03 devillers, 99.07 devillers"
 }
 
 @inproceedings{pw-caa3d-95
-, author =	"C. Pisupati and L. Wolff"
-, title =	"A Central Axis Algorithm for 3D Bronchial Tree Structures"
-, booktitle =	"IEEE Internat. Sympos. Comput. Vision"
-, year =	1995
-, pages =	"259--264"
-, update =	"97.11 bibrelex"
+, author =      "C. Pisupati and L. Wolff"
+, title =       "A Central Axis Algorithm for 3D Bronchial Tree Structures"
+, booktitle =   "IEEE Internat. Sympos. Comput. Vision"
+, year =        1995
+, pages =       "259--264"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{pw-cltv-96
-, author =	"C. Pisupati and L. Wolff"
-, title =	"Corresponding Lung Tree Volumes"
-, number =	"1996.03"
-, institution =	"Johns Hopkins University"
-, month =	mar
-, year =	1996
-, update =	"97.11 bibrelex"
+, author =      "C. Pisupati and L. Wolff"
+, title =       "Corresponding Lung Tree Volumes"
+, number =      "1996.03"
+, institution = "Johns Hopkins University"
+, month =       mar
+, year =        1996
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{pwmz-gtma3-96
-, author =	"Chandrasekhar Pisupati and Lawrence Wolff and Wayne Mitzner and Elias Zerhouni"
-, title =	"Geometric Tree Matching with Applications to 3D Lung Structures"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"C19--C20"
-, cites =	"gmo-pmagp-94, pw-caa3d-95, pw-cltv-96, w-igt-95, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Chandrasekhar Pisupati and Lawrence Wolff and Wayne Mitzner and Elias Zerhouni"
+, title =       "Geometric Tree Matching with Applications to 3D Lung Structures"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "C19--C20"
+, cites =       "gmo-pmagp-94, pw-caa3d-95, pw-cltv-96, w-igt-95, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @techreport{pr-ptscc-87
-, author =	"L. Pitt and R. E. Reinke"
-, title =	"Polynomial-time solvability of clustering and conceptual clustering problems: the agglomerative-hierarchical algorithm"
-, type =	"Report"
-, number =	"R-87-1371"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1987
+, author =      "L. Pitt and R. E. Reinke"
+, title =       "Polynomial-time solvability of clustering and conceptual clustering problems: the agglomerative-hierarchical algorithm"
+, type =        "Report"
+, number =      "R-87-1371"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1987
 }
 
 @inproceedings{p-cgrae-73
-, author =	"N. L. K. Pitteway"
-, title =	"Computer graphics research in an academic environment"
-, booktitle =	"Proc. Datafair '73 Conf."
-, year =	1973
-, pages =	"471--478"
+, author =      "N. L. K. Pitteway"
+, title =       "Computer graphics research in an academic environment"
+, booktitle =   "Proc. Datafair '73 Conf."
+, year =        1973
+, pages =       "471--478"
 }
 
 @article{p-hmgst-84
-, author =	"D. A. Plaisted"
-, title =	"Heuristic matching for graphs satisfying the triangle inequality"
-, journal =	"J. Algorithms"
-, volume =	5
-, year =	1984
-, pages =	"163--179"
+, author =      "D. A. Plaisted"
+, title =       "Heuristic matching for graphs satisfying the triangle inequality"
+, journal =     "J. Algorithms"
+, volume =      5
+, year =        1984
+, pages =       "163--179"
 }
 
 @article{ph-hta-87
-, author =	"D. A. Plaisted and J. Hong"
-, title =	"A heuristic triangulation algorithm"
-, journal =	"J. Algorithms"
-, volume =	8
-, year =	1987
-, pages =	"405--437"
-, abstract =	"We propose a heuristic triangulation algorithm. The
-		 algorithm runs in polynomial time and produces a
-		 triangulation within a ratio of O(log n) to the cost of
-		 an optimal triangulation of a set of n points in the
-		 Euclidean plane"
+, author =      "D. A. Plaisted and J. Hong"
+, title =       "A heuristic triangulation algorithm"
+, journal =     "J. Algorithms"
+, volume =      8
+, year =        1987
+, pages =       "405--437"
+, abstract =    "We propose a heuristic triangulation algorithm. The
+                 algorithm runs in polynomial time and produces a
+                 triangulation within a ratio of O(log n) to the cost of
+                 an optimal triangulation of a set of n points in the
+                 Euclidean plane"
 }
 
 @inproceedings{p-afwvf-92
-, author =	"H. Plantinga"
-, title =	"An algorithm for finding the weakly visible faces from a polygon in $3$-d"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"45--51"
-, cites =	"arb-tiriu-90, bdeg-vmpv-90, fdfh-cgpp-90, fst-mladi-92, kd-irssr-79, m-wcohs-87, m-eahsr-89, m-hsrrm-91, o-agta-87, pd-voag-90, pds-rthle-90, p-cvpew-92, ps-cgi-85, ss-oadwv-90, sss-cthsa-74, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "H. Plantinga"
+, title =       "An algorithm for finding the weakly visible faces from a polygon in $3$-d"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "45--51"
+, cites =       "arb-tiriu-90, bdeg-vmpv-90, fdfh-cgpp-90, fst-mladi-92, kd-irssr-79, m-wcohs-87, m-eahsr-89, m-hsrrm-91, o-agta-87, pd-voag-90, pds-rthle-90, p-cvpew-92, ps-cgi-85, ss-oadwv-90, sss-cthsa-74, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{p-cvpew-92
-, author =	"H. Plantinga"
-, title =	"Conservative visibility preprocessing for efficient walkthroughs of $3${D} Scenes"
-, type =	"Technical {Report}"
-, number =	"92-4"
-, institution =	"Dept. Comput. Sci., Univ. Pittsburgh"
-, address =	"Pittsburgh, PA"
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "H. Plantinga"
+, title =       "Conservative visibility preprocessing for efficient walkthroughs of $3${D} Scenes"
+, type =        "Technical {Report}"
+, number =      "92-4"
+, institution = "Dept. Comput. Sci., Univ. Pittsburgh"
+, address =     "Pittsburgh, PA"
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @article{pd-voag-90
-, author =	"H. Plantinga and C. R. Dyer"
-, title =	"Visibility, occlusion, and the aspect graph"
-, journal =	"Internat. J. Comput. Vision"
-, volume =	5
-, number =	2
-, year =	1990
-, pages =	"137--160"
-, update =	"93.09 rote"
+, author =      "H. Plantinga and C. R. Dyer"
+, title =       "Visibility, occlusion, and the aspect graph"
+, journal =     "Internat. J. Comput. Vision"
+, volume =      5
+, number =      2
+, year =        1990
+, pages =       "137--160"
+, update =      "93.09 rote"
 }
 
 @inproceedings{pds-rthle-90
-, author =	"H. Plantinga and C. R. Dyer and W. B. Seals"
-, title =	"Real-time hidden-line elimination for a rotating polyhedral scene using the aspect representation"
-, booktitle =	"Proc. Graphics Interface '90"
-, year =	1990
-, pages =	"9--16"
-, update =	"98.07 bibrelex"
+, author =      "H. Plantinga and C. R. Dyer and W. B. Seals"
+, title =       "Real-time hidden-line elimination for a rotating polyhedral scene using the aspect representation"
+, booktitle =   "Proc. Graphics Interface '90"
+, year =        1990
+, pages =       "9--16"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{pd-acag-86
-, author =	"W. Platinga and C. Dyer"
-, title =	"An algorithm for constructing the aspect graph"
-, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1986
-, pages =	"123--131"
-, update =	"98.11 bibrelex"
+, author =      "W. Platinga and C. Dyer"
+, title =       "An algorithm for constructing the aspect graph"
+, booktitle =   "Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1986
+, pages =       "123--131"
+, update =      "98.11 bibrelex"
 }
 
 @article{p-plpg-76
-, author =	"C. Platt"
-, title =	"Planar Lattices and Planar Graphs"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	21
-, year =	1976
-, pages =	"30--39"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "C. Platt"
+, title =       "Planar Lattices and Planar Graphs"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      21
+, year =        1976
+, pages =       "30--39"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{pb-cmfm-88
-, author =	"J. C. Platt and A. H. Barr"
-, title =	"Constraint methods for flexible models"
-, journal =	"Comput. Graph."
-, volume =	22
-, number =	4
-, year =	1988
-, pages =	"279--287"
-, note =	"Proc. SIGGRAPH '88"
-, update =	"98.03 bibrelex"
+, author =      "J. C. Platt and A. H. Barr"
+, title =       "Constraint methods for flexible models"
+, journal =     "Comput. Graph."
+, volume =      22
+, number =      4
+, year =        1988
+, pages =       "279--287"
+, note =        "Proc. SIGGRAPH '88"
+, update =      "98.03 bibrelex"
 }
 
 @article{pb-scpts-89
-, author =	"L. K. Platzman and J. J. {Bartholdi, III}"
-, title =	"Spacefilling Curves and the Planar Travelling Salesman Problem"
-, journal =	"J. ACM"
-, volume =	36
-, number =	4
-, month =	oct
-, year =	1989
-, pages =	"719--737"
-, keywords =	"graph theory, optimization, traveling salesman tours, two-dimensional, $L_{2}$ metric, heuristics, fractal geometry, empirical analysis"
-, update =	"93.09 held+jones"
+, author =      "L. K. Platzman and J. J. {Bartholdi, III}"
+, title =       "Spacefilling Curves and the Planar Travelling Salesman Problem"
+, journal =     "J. ACM"
+, volume =      36
+, number =      4
+, month =       oct
+, year =        1989
+, pages =       "719--737"
+, keywords =    "graph theory, optimization, traveling salesman tours, two-dimensional, $L_{2}$ metric, heuristics, fractal geometry, empirical analysis"
+, update =      "93.09 held+jones"
 }
 
 @inproceedings{pc-alrtg-96
-, author =	"A. Plaza and G. F. Carey"
-, title =	"About local refinement of tetrahedral grids based on bisection"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"123--136"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "A. Plaza and G. F. Carey"
+, title =       "About local refinement of tetrahedral grids based on bisection"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "123--136"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @article{p-hppg-87
-, author =	"J. Plesnik"
-, title =	"A Heuristic for the $p$-Center Problem in Graphs"
-, journal =	"Discrete Appl. Math."
-, volume =	17
-, year =	1987
-, pages =	"263--268"
-, update =	"98.07 agarwal"
+, author =      "J. Plesnik"
+, title =       "A Heuristic for the $p$-Center Problem in Graphs"
+, journal =     "Discrete Appl. Math."
+, volume =      17
+, year =        1987
+, pages =       "263--268"
+, update =      "98.07 agarwal"
 }
 
 @article{p-nchcp-79
-, author =	"J. Ples{\'n}ik"
-, title =	"The {NP}-completeness of the {Hamiltonian} cycle problem in planar digraphs with degree bound two"
-, journal =	"Inform. Process. Lett."
-, volume =	8
-, year =	1979
-, pages =	"199--201"
-, update =	"98.03 bibrelex"
+, author =      "J. Ples{\'n}ik"
+, title =       "The {NP}-completeness of the {Hamiltonian} cycle problem in planar digraphs with degree bound two"
+, journal =     "Inform. Process. Lett."
+, volume =      8
+, year =        1979
+, pages =       "199--201"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{pt-idns-90
-, author =	"S. A. Plotkin and {\'E}. Tardos"
-, title =	"Improved dual network simplex"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"367--376"
-, update =	"93.09 rote"
+, author =      "S. A. Plotkin and {\'E}. Tardos"
+, title =       "Improved dual network simplex"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "367--376"
+, update =      "93.09 rote"
 }
 
 @article{ple-togip-71
-, author =	"A. Pnueli and A. Lempel and S. Even"
-, title =	"Transitive orientation of graphs and identification of permutation graphs"
-, journal =	"Cand. J. Math."
-, volume =	23
-, year =	1971
-, pages =	"160--175"
-, update =	"98.11 bibrelex"
+, author =      "A. Pnueli and A. Lempel and S. Even"
+, title =       "Transitive orientation of graphs and identification of permutation graphs"
+, journal =     "Cand. J. Math."
+, volume =      23
+, year =        1971
+, pages =       "160--175"
+, update =      "98.11 bibrelex"
 }
 
 @article{p-afhbs-85
-, author =	"P. V. Poblete"
-, title =	"The analysis of a fringe heuristic for binary search trees"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	"336--350"
+, author =      "P. V. Poblete"
+, title =       "The analysis of a fringe heuristic for binary search trees"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "336--350"
 }
 
 @inproceedings{p-gfr-90
-, author =	"M. Pocchiola"
-, title =	"Graphics in {Flatland} revisited"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"85--96"
+, author =      "M. Pocchiola"
+, title =       "Graphics in {Flatland} revisited"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "85--96"
 }
 
 @inproceedings{p-htvpt-97
-, author =	"Michel Pocchiola"
-, title =	"Horizon Trees versus Pseudo-Triangulations"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	12
-, cites =	"agt-wat-94, eg-tsa-89, pv-tsvcpt-96, r-cve2d-97, ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Michel Pocchiola"
+, title =       "Horizon Trees versus Pseudo-Triangulations"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       12
+, cites =       "agt-wat-94, eg-tsa-89, pv-tsvcpt-96, r-cve2d-97, ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{p-vc-92
-, author =	"M. Pocchiola"
-, title =	"The visibility complex"
-, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
-, site =	"Kyoto, Japan"
-, year =	1992
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "M. Pocchiola"
+, title =       "The visibility complex"
+, booktitle =   "Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
+, site =        "Kyoto, Japan"
+, year =        1992
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{p-vc-92c
-, author =	"Michel Pocchiola"
-, title =	"The Visibility Complex"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"67--68"
-, update =	"00.03 bibrelex"
+, author =      "Michel Pocchiola"
+, title =       "The Visibility Complex"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "67--68"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{pv-cvgpt-95
-, author =	"M. Pocchiola and G. Vegter"
-, title =	"Computing the Visibility Graph via Pseudo-Triangulations"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"248--257"
-, keywords =	"topological sweep, visibility complex"
-, cites =	"ce-oails-92, eg-tsa-89, gt-ltasc-85, gm-osacv-91, hmrt-sjslt-86, ow-nmcvg-88, pv-vc-93, s-ec-86, w-cvgnl-85, ZZZ"
-, update =	"98.03 bibrelex, 96.05 pocchiola, 95.09 mitchell"
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "Computing the Visibility Graph via Pseudo-Triangulations"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "248--257"
+, keywords =    "topological sweep, visibility complex"
+, cites =       "ce-oails-92, eg-tsa-89, gt-ltasc-85, gm-osacv-91, hmrt-sjslt-86, ow-nmcvg-88, pv-vc-93, s-ec-86, w-cvgnl-85, ZZZ"
+, update =      "98.03 bibrelex, 96.05 pocchiola, 95.09 mitchell"
 }
 
 @inproceedings{pv-mtvg-94
-, author =	"M. Pocchiola and G. Vegter"
-, title =	"Minimal Tangent Visibility Graphs"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"24--29"
-, cites =	"aaghi-vdp-86, ch-mvg-91, eg-tsa-89, gm-osacv-91, gs-rwnpc-90, gh-cvgnl-85, lw-apcfp-79, o-cgc18-93, ow-nmcvg-88, pv-vc-93, pv-otvtc-94, pv-savgc-94, r-sppcp-86, r-tseas-88, sh-nmvg-93, sr-facsv-90, km-eaesp-88, se-tlbsv-87, w-cvgnl-85, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "Minimal Tangent Visibility Graphs"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "24--29"
+, cites =       "aaghi-vdp-86, ch-mvg-91, eg-tsa-89, gm-osacv-91, gs-rwnpc-90, gh-cvgnl-85, lw-apcfp-79, o-cgc18-93, ow-nmcvg-88, pv-vc-93, pv-otvtc-94, pv-savgc-94, r-sppcp-86, r-tseas-88, sh-nmvg-93, sr-facsv-90, km-eaesp-88, se-tlbsv-87, w-cvgnl-85, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @article{pv-mtvg-96
-, author =	"M. Pocchiola and G. Vegter"
-, title =	"Minimal Tangent Visibility Graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"303--314"
-, keywords =	"visibility graphs, triangulations"
-, succeeds =	"pv-mtvg-94"
-, update =	"97.03 devillers+pocchiola+smid, 96.05 pocchiola"
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "Minimal Tangent Visibility Graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "303--314"
+, keywords =    "visibility graphs, triangulations"
+, succeeds =    "pv-mtvg-94"
+, update =      "97.03 devillers+pocchiola+smid, 96.05 pocchiola"
 }
 
 @techreport{pv-pc-96
-, author =	"M. Pocchiola and G. Vegter"
-, title =	"On polygonal covers"
-, number =	"96-16"
-, institution =	"Labo. Inf. Ens"
-, address =	"45 rue d'Ulm 75230 Paris, France"
-, month =	jul
-, year =	1996
-, note =	""
-, keywords =	"illumination, covering, separation"
-, comments =	""
-, succeeds =	"pv-ptta-96"
-, update =	"97.03 pocchiola"
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "On polygonal covers"
+, number =      "96-16"
+, institution = "Labo. Inf. Ens"
+, address =     "45 rue d'Ulm 75230 Paris, France"
+, month =       jul
+, year =        1996
+, note =        ""
+, keywords =    "illumination, covering, separation"
+, comments =    ""
+, succeeds =    "pv-ptta-96"
+, update =      "97.03 pocchiola"
 }
 
 @incollection{pv-pc-99
-, author =	"M. Pocchiola and G. Vegter"
-, title =	"On polygonal covers"
-, editor =	"B. Chazelle and J. Goodman and R. Pollack"
-, booktitle =	"Advances in Discrete and Computational Geometry"
-, series =	"Contemporary Mathematics"
-, volume =	223
-, publisher =	"AMS, Providence"
-, year =	1999
-, pages =	"257--268"
-, update =	"01.04 pocchiola"
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "On polygonal covers"
+, editor =      "B. Chazelle and J. Goodman and R. Pollack"
+, booktitle =   "Advances in Discrete and Computational Geometry"
+, series =      "Contemporary Mathematics"
+, volume =      223
+, publisher =   "AMS, Providence"
+, year =        1999
+, pages =       "257--268"
+, update =      "01.04 pocchiola"
 }
 
 @techreport{pv-otvtc-94
-, author =	"M. Pocchiola and G. Vegter"
-, title =	"Order types and visibility types of configurations of disjoint convex plane sets (Extended abstract)"
-, number =	"94-4"
-, institution =	"Labo. Inf. Ens"
-, month =	jan
-, year =	1994
-, keywords =	"arrangements, visibility complexes"
-, comments =	""
-, update =	"96.05 pocchiola"
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "Order types and visibility types of configurations of disjoint convex plane sets (Extended abstract)"
+, number =      "94-4"
+, institution = "Labo. Inf. Ens"
+, month =       jan
+, year =        1994
+, keywords =    "arrangements, visibility complexes"
+, comments =    ""
+, update =      "96.05 pocchiola"
 }
 
 @inproceedings{pv-ptta-96
-, author =	"Michel Pocchiola and Gert Vegter"
-, title =	"Pseudo-Triangulations: Theory and Applications"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"291--300"
-, cites =	"pv-vc-96, pv-cvgpt-95, b-rsdoh-93, c-cgr-95, f-icd-77, ers-ccsno-90, blwsz-om-93, rz-rspu-95, pa-cg-95, gp-ms-83, bcm-anlcg-90"
-, update =	"98.07 bibrelex, 97.11 bibrelex, 96.05 efrat+pocchiola"
+, author =      "Michel Pocchiola and Gert Vegter"
+, title =       "Pseudo-Triangulations: Theory and Applications"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "291--300"
+, cites =       "pv-vc-96, pv-cvgpt-95, b-rsdoh-93, c-cgr-95, f-icd-77, ers-ccsno-90, blwsz-om-93, rz-rspu-95, pa-cg-95, gp-ms-83, bcm-anlcg-90"
+, update =      "98.07 bibrelex, 97.11 bibrelex, 96.05 efrat+pocchiola"
 }
 
 @techreport{pv-savgc-93
-, author =	"M. Pocchiola and G. Vegter"
-, title =	"Sweep algorithm for visibility graphs of curved obstacles"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1993
-, precedes =	"pv-savgc-94"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "Sweep algorithm for visibility graphs of curved obstacles"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1993
+, precedes =    "pv-savgc-94"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @techreport{pv-savgc-94
-, author =	"M. Pocchiola and G. Vegter"
-, title =	"Sweep algorithms for visibility graphs of curved obstacles"
-, type =	"Technical Report"
-, institution =	"??"
-, address =	"Liens"
-, year =	1994
-, note =	"in preparation"
-, update =	"98.11 bibrelex"
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "Sweep algorithms for visibility graphs of curved obstacles"
+, type =        "Technical Report"
+, institution = "??"
+, address =     "Liens"
+, year =        1994
+, note =        "in preparation"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{pv-vc-93
-, author =	"M. Pocchiola and G. Vegter"
-, title =	"The visibility complex"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"328--337"
-, precedes =	"pv-vc-96"
-, cites =	"cg-vippg-89, gm-osacv-91, hm-oacvp-91, p-gfr-90, v-vddsv-90, v-dmvg-91, w-cvgnl-85, ZZZ"
-, update =	"98.03 bibrelex, 97.03 devillers, 93.09 jones"
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "The visibility complex"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "328--337"
+, precedes =    "pv-vc-96"
+, cites =       "cg-vippg-89, gm-osacv-91, hm-oacvp-91, p-gfr-90, v-vddsv-90, v-dmvg-91, w-cvgnl-85, ZZZ"
+, update =      "98.03 bibrelex, 97.03 devillers, 93.09 jones"
 }
 
 @article{pv-vc-96
-, author =	"M. Pocchiola and G. Vegter"
-, title =	"The visibility complex"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, number =	3
-, year =	1996
-, pages =	"279--308"
-, keywords =	"visibility graphs, visibility complexes, triangulations"
-, succeeds =	"pv-vc-93"
-, update =	"97.11 bibrelex+orourke, 97.03 devillers+orourke+pocchiola+schwarzkopf"
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "The visibility complex"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, number =      3
+, year =        1996
+, pages =       "279--308"
+, keywords =    "visibility graphs, visibility complexes, triangulations"
+, succeeds =    "pv-vc-93"
+, update =      "97.11 bibrelex+orourke, 97.03 devillers+orourke+pocchiola+schwarzkopf"
 }
 
 @article{pv-tsvcpt-96
-, author =	"M. Pocchiola and G. Vegter"
-, title =	"Topologically sweeping visibility complexes via pseudo-triangulations"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, month =	dec
-, year =	1996
-, pages =	"419--453"
-, keywords =	"topological sweep, visibility complex, visibility graph, triangulation, pseudo-triangulation"
-, succeeds =	"pv-cvgpt-95"
-, update =	"97.03 pocchiola, 96.05 pocchiola"
+, author =      "M. Pocchiola and G. Vegter"
+, title =       "Topologically sweeping visibility complexes via pseudo-triangulations"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, month =       dec
+, year =        1996
+, pages =       "419--453"
+, keywords =    "topological sweep, visibility complex, visibility graph, triangulation, pseudo-triangulation"
+, succeeds =    "pv-cvgpt-95"
+, update =      "97.03 pocchiola, 96.05 pocchiola"
 }
 
 @inproceedings{pv-iplft-96
-, author =	"Michel Pochiola and Gert Vegter"
-, title =	"The Illumination Problem of L. Fejes T{\'o}th Revisited"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"29--30"
-, update =	"01.11 devillers, 00.03 bibrelex, 99.03 bibrelex"
+, author =      "Michel Pochiola and Gert Vegter"
+, title =       "The Illumination Problem of L. Fejes T{\'o}th Revisited"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "29--30"
+, update =      "01.11 devillers, 00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{p-smfsp-80
-, author =	"A. N. Podkorytov"
-, title =	"Summation of multiple {Fourier} series over polyhedra"
-, journal =	"Mat.,  Mekh., Astronom."
-, volume =	"N 1"
-, year =	1980
-, pages =	"51--58"
-, update =	"97.11 bibrelex"
+, author =      "A. N. Podkorytov"
+, title =       "Summation of multiple {Fourier} series over polyhedra"
+, journal =     "Mat.,  Mekh., Astronom."
+, volume =      "N 1"
+, year =        1980
+, pages =       "51--58"
+, update =      "97.11 bibrelex"
 }
 
 @book{p-egcs-73
-, author =	"A. V. Pogorelov"
-, title =	"Extrinsic Geometry of Convex Surfaces"
-, series =	"Translations of Mathematical Monographs"
-, volume =	35
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1973
-, update =	"94.09 orourke"
+, author =      "A. V. Pogorelov"
+, title =       "Extrinsic Geometry of Convex Surfaces"
+, series =      "Translations of Mathematical Monographs"
+, volume =      35
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1973
+, update =      "94.09 orourke"
 }
 
 @book{p-lfg-66
-, author =	"A. V. Pogorelov"
-, title =	"Lectures on the Foundations of Geometry"
-, publisher =	"Noordhoff"
-, year =	1966
-, update =	"98.03 bibrelex"
+, author =      "A. V. Pogorelov"
+, title =       "Lectures on the Foundations of Geometry"
+, publisher =   "Noordhoff"
+, year =        1966
+, update =      "98.03 bibrelex"
 }
 
 @article{p-qglcs-49
-, author =	"A. V. Pogorelov"
-, title =	"Quasi-geodesic lines on a convex surface"
-, journal =	"Mat. Sb."
-, volume =	25
-, number =	62
-, year =	1949
-, pages =	"275--306"
-, note =	"English transl., {\em Amer. Math. Soc. Transl.} 74, 1952."
-, update =	"94.09 orourke"
+, author =      "A. V. Pogorelov"
+, title =       "Quasi-geodesic lines on a convex surface"
+, journal =     "Mat. Sb."
+, volume =      25
+, number =      62
+, year =        1949
+, pages =       "275--306"
+, note =        "English transl., {\em Amer. Math. Soc. Transl.} 74, 1952."
+, update =      "94.09 orourke"
 }
 
 @book{p-mmp-78
-, author =	"A. V. Pogorelov"
-, title =	"The {Minkowski} Multidimensional Problem"
-, publisher =	"Winston"
-, address =	"New York, NY"
-, year =	1978
-, update =	"98.03 bibrelex"
+, author =      "A. V. Pogorelov"
+, title =       "The {Minkowski} Multidimensional Problem"
+, publisher =   "Winston"
+, address =     "New York, NY"
+, year =        1978
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ph-bmni-85
-, author =	"G. Politis and D. Herbison-Evans"
-, title =	"A {Benesh} movement notation interpreter"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Sydney"
-, address =	"Sydney, Australia"
-, year =	1985
+, author =      "G. Politis and D. Herbison-Evans"
+, title =       "A {Benesh} movement notation interpreter"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Sydney"
+, address =     "Sydney, Australia"
+, year =        1985
 }
 
 @article{pr-rn-92
-, author =	"S. Poljak and J. Rohn"
-, title =	"Radius of nonsingularity"
-, journal =	"Mathematics of Systems, Signals and Control"
-, volume =	"??"
-, year =	1992
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "S. Poljak and J. Rohn"
+, title =       "Radius of nonsingularity"
+, journal =     "Mathematics of Systems, Signals and Control"
+, volume =      "??"
+, year =        1992
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @article{pr-ncdsp-93
-, author =	"R. Pollack and M. F. Roy"
-, title =	"On the number of cells defined by a set of polynomials"
-, journal =	"C. R. Acad. Sci. Paris"
-, volume =	316
-, year =	1993
-, pages =	"573--577"
-, update =	"98.03 agarwal+bibrelex"
+, author =      "R. Pollack and M. F. Roy"
+, title =       "On the number of cells defined by a set of polynomials"
+, journal =     "C. R. Acad. Sci. Paris"
+, volume =      316
+, year =        1993
+, pages =       "573--577"
+, update =      "98.03 agarwal+bibrelex"
 }
 
 @techreport{ps-cgcsp-86
-, author =	"R. Pollack and Micha Sharir"
-, title =	"Computing the Geodesic Center of a Simple Polygon"
-, type =	"Technical Report"
-, number =	231
-, institution =	"Dept. of Computer Science, Courant Institute of Mathematical Sciences"
-, year =	1986
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "R. Pollack and Micha Sharir"
+, title =       "Computing the Geodesic Center of a Simple Polygon"
+, type =        "Technical Report"
+, number =      231
+, institution = "Dept. of Computer Science, Courant Institute of Mathematical Sciences"
+, year =        1986
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @article{psr-cgcsp-89
-, author =	"R. Pollack and Micha Sharir and G{\"u}nter Rote"
-, title =	"Computing of the geodesic center of a simple polygon"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"611--626"
-, keywords =	"polygons, simple, shortest paths"
-, update =	"98.03 mitchell"
+, author =      "R. Pollack and Micha Sharir and G{\"u}nter Rote"
+, title =       "Computing of the geodesic center of a simple polygon"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "611--626"
+, keywords =    "polygons, simple, shortest paths"
+, update =      "98.03 mitchell"
 }
 
 @techreport{pss-stsps-86
-, author =	"R. Pollack and M. Sharir and S. Sifrony"
-, title =	"Separating two simple polygons by a sequence of translations"
-, type =	"Technical {Report}"
-, number =	215
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "R. Pollack and M. Sharir and S. Sifrony"
+, title =       "Separating two simple polygons by a sequence of translations"
+, type =        "Technical {Report}"
+, number =      215
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{pss-stsps-88
-, author =	"R. Pollack and Micha Sharir and S. Sifrony"
-, title =	"Separating two simple polygons by a sequence of translations"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"123--136"
-, keywords =	"polygons, simple, Davenport-Schinzel sequences, motion planning, rays"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "R. Pollack and Micha Sharir and S. Sifrony"
+, title =       "Separating two simple polygons by a sequence of translations"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "123--136"
+, keywords =    "polygons, simple, Davenport-Schinzel sequences, motion planning, rays"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{pw-nscht-89
-, author =	"R. Pollack and R. Wenger"
-, title =	"Necessary and sufficient conditions for hyperplane transversals"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"152--155"
-, precedes =	"pw-nscht-90"
-, cites =	"dgk-htir-63, e-rt-79, gp-ms-83, gp-htthd-88, g-ts-55, hdk-cgp-64, h-uegt-57, hk-crp-71, h-umkkm-23, k-tsct-80, k-ta-03, m-eat-84, s-tsppe-40, w-ghtti-90, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "R. Pollack and R. Wenger"
+, title =       "Necessary and sufficient conditions for hyperplane transversals"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "152--155"
+, precedes =    "pw-nscht-90"
+, cites =       "dgk-htir-63, e-rt-79, gp-ms-83, gp-htthd-88, g-ts-55, hdk-cgp-64, h-uegt-57, hk-crp-71, h-umkkm-23, k-tsct-80, k-ta-03, m-eat-84, s-tsppe-40, w-ghtti-90, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{pw-nscht-90
-, author =	"R. Pollack and R. Wenger"
-, title =	"Necessary and sufficient conditions for hyperplane transversals"
-, journal =	"Combinatorica"
-, volume =	10
-, year =	1990
-, pages =	"307--311"
-, succeeds =	"pw-nscht-89"
+, author =      "R. Pollack and R. Wenger"
+, title =       "Necessary and sufficient conditions for hyperplane transversals"
+, journal =     "Combinatorica"
+, volume =      10
+, year =        1990
+, pages =       "307--311"
+, succeeds =    "pw-nscht-89"
 }
 
 @article{p-kafgg-37
-, author =	"G. Polya"
-, title =	"Kombinatorische {Anzahlbestimmungen} f{\"u}r {Gruppen}, {Graphen} und chemische {Verbindungen}"
-, journal =	"Acta Math."
-, volume =	68
-, year =	1937
-, pages =	"145--254"
-, update =	"97.11 bibrelex"
+, author =      "G. Polya"
+, title =       "Kombinatorische {Anzahlbestimmungen} f{\"u}r {Gruppen}, {Graphen} und chemische {Verbindungen}"
+, journal =     "Acta Math."
+, volume =      68
+, year =        1937
+, pages =       "145--254"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{p-sdsdp-92
-, author =	"G. H. Polychronopoulos"
-, title =	"Stochastic and dynamic shortest distance problems"
-, type =	"Ph.{D}. Thesis"
-, school =	"Operations Research Center, Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1992
-, note =	"Report 199"
-, keywords =	"weighted regions, dynamic shortest paths"
-, update =	"93.05 jones"
+, author =      "G. H. Polychronopoulos"
+, title =       "Stochastic and dynamic shortest distance problems"
+, type =        "Ph.{D}. Thesis"
+, school =      "Operations Research Center, Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1992
+, note =        "Report 199"
+, keywords =    "weighted regions, dynamic shortest paths"
+, update =      "93.05 jones"
 }
 
 @inproceedings{plm-icdpm-95
-, author =	"Madhav K. Ponamgi and Ming C. Lin and Dinesh Manocha"
-, title =	"Incremental Collision Detection for Polygonal Models"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"V7--V8"
-, keywords =	"video review"
-, cites =	"cd-icott-87, c-oaitd-89, clmp-ecdie-94, clmp-iciec-95, pml-iacdb-95, lc-eaidc-91, mp-fitcp-78, ZZZ"
-, update =	"99.03 forrest, 98.03 bibrelex, 95.09 mitchell"
+, author =      "Madhav K. Ponamgi and Ming C. Lin and Dinesh Manocha"
+, title =       "Incremental Collision Detection for Polygonal Models"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "V7--V8"
+, keywords =    "video review"
+, cites =       "cd-icott-87, c-oaitd-89, clmp-ecdie-94, clmp-iciec-95, pml-iacdb-95, lc-eaidc-91, mp-fitcp-78, ZZZ"
+, update =      "99.03 forrest, 98.03 bibrelex, 95.09 mitchell"
 }
 
 @techreport{pml-iacdb-94
-, author =	"M. K. Ponamgi and D. Manocha and M. C. Lin"
-, title =	"Incremental Algorithms for Collision Detection Between General Solid Models"
-, type =	"Technical {Report}"
-, number =	"TR94-061"
-, institution =	"Dept. Comput. Sci., Univ. North Carolina"
-, address =	"Chapel Hill, NC"
-, year =	1994
-, precedes =	"pml-iacdb-95"
-, update =	"96.05 klosowski"
+, author =      "M. K. Ponamgi and D. Manocha and M. C. Lin"
+, title =       "Incremental Algorithms for Collision Detection Between General Solid Models"
+, type =        "Technical {Report}"
+, number =      "TR94-061"
+, institution = "Dept. Comput. Sci., Univ. North Carolina"
+, address =     "Chapel Hill, NC"
+, year =        1994
+, precedes =    "pml-iacdb-95"
+, update =      "96.05 klosowski"
 }
 
 @inproceedings{pml-iacdb-95
-, author =	"M. K. Ponamgi and D. Manocha and M. C. Lin"
-, title =	"Incremental Algorithms for Collision Detection between General Solid Models"
-, booktitle =	"Proc. ACM Siggraph Sympos. Solid Modeling"
-, year =	1995
-, pages =	"293--304"
-, succeeds =	"pml-iacdb-94"
-, update =	"96.05 klosowski, 96.01 held"
+, author =      "M. K. Ponamgi and D. Manocha and M. C. Lin"
+, title =       "Incremental Algorithms for Collision Detection between General Solid Models"
+, booktitle =   "Proc. ACM Siggraph Sympos. Solid Modeling"
+, year =        1995
+, pages =       "293--304"
+, succeeds =    "pml-iacdb-94"
+, update =      "96.05 klosowski, 96.01 held"
 }
 
 @phdthesis{p-remdt-83
-, author =	"J. Ponce"
-, title =	"Representation et manipulation d'objets tridimensionnels"
-, school =	"Universite d'Orsay"
-, address =	"Orsay, France"
-, year =	1983
-, note =	"These de troisueme cycle"
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "J. Ponce"
+, title =       "Representation et manipulation d'objets tridimensionnels"
+, school =      "Universite d'Orsay"
+, address =     "Orsay, France"
+, year =        1983
+, note =        "These de troisueme cycle"
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @article{pf-ctffc-95
-, author =	"Jean Ponce and Bernard Faverjon"
-, title =	"On computing three-finger force-closure grasps of polygonal objects"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	11
-, number =	6
-, year =	1995
-, update =	"97.11 bibrelex"
+, author =      "Jean Ponce and Bernard Faverjon"
+, title =       "On computing three-finger force-closure grasps of polygonal objects"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      11
+, number =      6
+, year =        1995
+, update =      "97.11 bibrelex"
 }
 
 @article{pssbm-cffef-96
-, author =	"Jean Ponce and Steve Sullivan and Attawith Sudsang and Jean-Daniel Boissonnat and Jean-Pierre Merlet"
-, title =	"On computing four-finger equilibrium and force-closure grasps of polyhedral objects"
-, journal =	"Internat. J. Robot. Res."
-, volume =	"??"
-, year =	1996
-, update =	"97.11 bibrelex"
+, author =      "Jean Ponce and Steve Sullivan and Attawith Sudsang and Jean-Daniel Boissonnat and Jean-Pierre Merlet"
+, title =       "On computing four-finger equilibrium and force-closure grasps of polyhedral objects"
+, journal =     "Internat. J. Robot. Res."
+, volume =      "??"
+, year =        1996
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{p-sagsp-91
-, author =	"C. Ponder"
-, title =	"A search approach to general stabbing problems"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"195--202"
-, cites =	"ad-ahdsp-87, cgppsw-ccht-90, dgk-htir-63, e-ftssg-85, gl-mc-83, jk-spals-88, mkb-ma-79, pr-rn-92, pw-nscht-89, p-allpm-90, p-pcaam, r-lie-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "C. Ponder"
+, title =       "A search approach to general stabbing problems"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "195--202"
+, cites =       "ad-ahdsp-87, cgppsw-ccht-90, dgk-htir-63, e-ftssg-85, gl-mc-83, jk-spals-88, mkb-ma-79, pr-rn-92, pw-nscht-89, p-allpm-90, p-pcaam, r-lie-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{p-allpm-90
-, author =	"C. Ponder"
-, title =	"An Analytical Look at Linear Performance Models"
-, type =	"Technical Report"
-, number =	"UCRL-JC-106105"
-, institution =	"Lawrence Livermore National Laboratory"
-, month =	sep
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "C. Ponder"
+, title =       "An Analytical Look at Linear Performance Models"
+, type =        "Technical Report"
+, number =      "UCRL-JC-106105"
+, institution = "Lawrence Livermore National Laboratory"
+, month =       sep
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{p-pcaam
-, author =	"C. Ponder"
-, title =	"Principle Component Analysis Under Alternative Error-Metrics"
-, note =	"in preparation"
-, update =	"98.07 bibrelex"
+, author =      "C. Ponder"
+, title =       "Principle Component Analysis Under Alternative Error-Metrics"
+, note =        "in preparation"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{psv-srusb-97
-, author =	"Serge Pontier and Behzad Shariat and Denis Vandorpe"
-, title =	"Shape Reconstruction Using Skeleton--Based Implicit Surface"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"205--210"
-, update =	"97.11 jones"
+, author =      "Serge Pontier and Behzad Shariat and Denis Vandorpe"
+, title =       "Shape Reconstruction Using Skeleton--Based Implicit Surface"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "205--210"
+, update =      "97.11 jones"
 }
 
 @book{pbgm-mtop-62
-, author =	"L. S. Pontryagin and V. G. Boltyanskii and R. V. Gamkrelidze and E. F. Mishchenko"
-, title =	"The mathematical theory of optimal processes"
-, publisher =	"Interscience Publishers"
-, year =	1962
+, author =      "L. S. Pontryagin and V. G. Boltyanskii and R. V. Gamkrelidze and E. F. Mishchenko"
+, title =       "The mathematical theory of optimal processes"
+, publisher =   "Interscience Publishers"
+, year =        1962
 }
 
 @inproceedings{pzc-ptslr-97
-, author =	"C. Poon and B. Zhu and F. Chin"
-, title =	"A Polynomial Time Solution for Labeling a Rectilinear Map"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"451--453"
-, precedes =	"pzc-ptslr-98"
-, cites =	"bc-ap1sq-94, cms-aclp-93, df-rbsdm-92, dmmmz-mlig-97, eis-ctmfp-76, fw-ppalm-91, i-pnm-75, j-cnpp-89, kr-pcr-92, ps-cgi-85, w-amlon-94, ww-mlhpg-95, y-laml-72, ZZZ"
-, update =	"99.03 patrignani, 98.07 bibrelex, 97.07 efrat"
+, author =      "C. Poon and B. Zhu and F. Chin"
+, title =       "A Polynomial Time Solution for Labeling a Rectilinear Map"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "451--453"
+, precedes =    "pzc-ptslr-98"
+, cites =       "bc-ap1sq-94, cms-aclp-93, df-rbsdm-92, dmmmz-mlig-97, eis-ctmfp-76, fw-ppalm-91, i-pnm-75, j-cnpp-89, kr-pcr-92, ps-cgi-85, w-amlon-94, ww-mlhpg-95, y-laml-72, ZZZ"
+, update =      "99.03 patrignani, 98.07 bibrelex, 97.07 efrat"
 }
 
 @article{pzc-ptslr-98
-, author =	"Chung Keung Poon and Binhai Zhu and Francis Chin"
-, title =	"A Polynomial Time Solution for Labeling a Rectilinear Map"
-, journal =	"Inform. Process. Lett."
-, volume =	65
-, number =	4
-, pages =	"201--207"
-, succeeds =	"pzc-ptslr-97"
-, update =	"99.03 patrignani, 98.07 bibrelex, 98.03 mitchell"
+, author =      "Chung Keung Poon and Binhai Zhu and Francis Chin"
+, title =       "A Polynomial Time Solution for Labeling a Rectilinear Map"
+, journal =     "Inform. Process. Lett."
+, volume =      65
+, number =      4
+, pages =       "201--207"
+, succeeds =    "pzc-ptslr-97"
+, update =      "99.03 patrignani, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{pssw-lpw-01
-, author =	"Sheung-Hung Poon and Chan-Su Shin and Tycho Strijk and Alexander Wolff"
-, title =	"Labeling Points with Weights"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"97--100"
-, update =	"01.04 icking"
+, author =      "Sheung-Hung Poon and Chan-Su Shin and Tycho Strijk and Alexander Wolff"
+, title =       "Labeling Points with Weights"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "97--100"
+, update =      "01.04 icking"
 }
 
 % also claimed, pages = "251--258"
 @inproceedings{ph-psc-97
-, author =	"Jovan Popovi{\'c} and Hugues Hoppe"
-, title =	"Progressive Simplicial Complexes"
-, booktitle =	"Proc. SIGGRAPH '97"
-, series =	"Computer Graphics Proceedings, Annual Conference Series"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"ACM Press"
-, year =	1997
-, pages =	"217 -- 224"
-, update =	"98.07 agarwal, 98.03 agarwal+mitchell"
+, author =      "Jovan Popovi{\'c} and Hugues Hoppe"
+, title =       "Progressive Simplicial Complexes"
+, booktitle =   "Proc. SIGGRAPH '97"
+, series =      "Computer Graphics Proceedings, Annual Conference Series"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "ACM Press"
+, year =        1997
+, pages =       "217 -- 224"
+, update =      "98.07 agarwal, 98.03 agarwal+mitchell"
 }
 
 % ### others?
 @inproceedings{po-saims-91
-, author =	"M. Popovic and others"
-, title =	"Several Approaches to Implement the Merging Step of the Split and Merge Region Segmentation"
-, editor =	"F. H. Post and W. Barth"
-, booktitle =	"Proc. Eurographics '91"
-, publisher =	"Elsevier Science"
-, address =	"Vienna, Austria"
-, month =	sep
-, year =	1991
-, pages =	"399--412"
-, update =	"93.09 held"
+, author =      "M. Popovic and others"
+, title =       "Several Approaches to Implement the Merging Step of the Split and Merge Region Segmentation"
+, editor =      "F. H. Post and W. Barth"
+, booktitle =   "Proc. Eurographics '91"
+, publisher =   "Elsevier Science"
+, address =     "Vienna, Austria"
+, month =       sep
+, year =        1991
+, pages =       "399--412"
+, update =      "93.09 held"
 }
 
 @techreport{p-smtsr-79
-, author =	"R. J. Popplestone"
-, title =	"Specifying Manipulation in Terms of Spatial Relationships"
-, type =	"Research {Report}"
-, number =	117
-, institution =	"Dept. Artif. Intell., Univ. Edinburgh"
-, address =	"Edinburgh, Scotland"
-, year =	1979
-, update =	"97.11 bibrelex"
+, author =      "R. J. Popplestone"
+, title =       "Specifying Manipulation in Terms of Spatial Relationships"
+, type =        "Research {Report}"
+, number =      117
+, institution = "Dept. Artif. Intell., Univ. Edinburgh"
+, address =     "Edinburgh, Scotland"
+, year =        1979
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{p-ahart-93
-, author =	"Mary-Anne K. Posenau"
-, title =	"Approaches to High Aspect Ratio Triangulations"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"30--35"
-, cites =	"pm-dtcfd-92, b-nacvh-91, lp-gtdug-88, pmp-ufemg-89, m-amgvf-90, cd-vdbcd-85, e-acg-87, ZZZ"
-, update =	"98.11 bibrelex"
+, author =      "Mary-Anne K. Posenau"
+, title =       "Approaches to High Aspect Ratio Triangulations"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "30--35"
+, cites =       "pm-dtcfd-92, b-nacvh-91, lp-gtdug-88, pmp-ufemg-89, m-amgvf-90, cd-vdbcd-85, e-acg-87, ZZZ"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{pm-dtcfd-92
-, author =	"M.-A. K. Posenau and D. M. Mount"
-, title =	"Delaunay triangulations and computational fluid dynamics meshes"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"316--321"
-, cites =	"bgr-ntp-88, b-amgct-89, ps-cgi-85, rs-metep-90, beg-pgmg-90, ahet-nggcf-91, twm-ngg-85, w-ngg-90, c-cdt-89, c-gqtm-89, b-nacvh-91, m-amgvf-90, w-msuma-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M.-A. K. Posenau and D. M. Mount"
+, title =       "Delaunay triangulations and computational fluid dynamics meshes"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "316--321"
+, cites =       "bgr-ntp-88, b-amgct-89, ps-cgi-85, rs-metep-90, beg-pgmg-90, ahet-nggcf-91, twm-ngg-85, w-ngg-90, c-cdt-89, c-gqtm-89, b-nacvh-91, m-amgvf-90, w-msuma-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{p-msea-81
-, author =	"M. J. Post"
-, title =	"A minimum spanning ellipse algorithm"
-, booktitle =	"Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1981
-, pages =	"115--122"
+, author =      "M. J. Post"
+, title =       "A minimum spanning ellipse algorithm"
+, booktitle =   "Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1981
+, pages =       "115--122"
 }
 
 @techreport{p-cmse-82
-, author =	"M. J. Post"
-, title =	"Computing minimum spanning ellipses"
-, type =	"Technical {Report}"
-, number =	"CS-82-16"
-, institution =	"Dept. Comput. Sci., Brown Univ."
-, address =	"Providence, RI"
-, year =	1982
-, update =	"98.07 bibrelex"
+, author =      "M. J. Post"
+, title =       "Computing minimum spanning ellipses"
+, type =        "Technical {Report}"
+, number =      "CS-82-16"
+, institution = "Dept. Comput. Sci., Brown Univ."
+, address =     "Providence, RI"
+, year =        1982
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{p-mse-84
-, author =	"M. J. Post"
-, title =	"Minimum spanning ellipsoids"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"108--116"
-, annote =	"$O(n^{2})$ time"
+, author =      "M. J. Post"
+, title =       "Minimum spanning ellipsoids"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "108--116"
+, annote =      "$O(n^{2})$ time"
 }
 
 @book{p-lat-83
-, author =	"M. M. Postinov"
-, title =	"Lectures in Algebraic Topology"
-, publisher =	"Nauka"
-, address =	"Moscow"
-, year =	1983
-, update =	"98.07 bibrelex"
+, author =      "M. M. Postinov"
+, title =       "Lectures in Algebraic Topology"
+, publisher =   "Nauka"
+, address =     "Moscow"
+, year =        1983
+, update =      "98.07 bibrelex"
 }
 
 @article{p-gom3o-87
-, author =	"M. Potemesil"
-, title =	"Generating octree models of {3D} objects from their silhouettes in a sequence of images"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	40
-, year =	1987
-, pages =	"1--29"
-, update =	"98.11 bibrelex"
+, author =      "M. Potemesil"
+, title =       "Generating octree models of {3D} objects from their silhouettes in a sequence of images"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      40
+, year =        1987
+, pages =       "1--29"
+, update =      "98.11 bibrelex"
 }
 
 @article{pf-ithla-80
-, author =	"M. Potmesil and H. Freeman"
-, title =	"Implementation of two hidden-line algorithms"
-, journal =	"Computers and Graphics"
-, volume =	5
-, year =	1980
-, pages =	"31--40"
+, author =      "M. Potmesil and H. Freeman"
+, title =       "Implementation of two hidden-line algorithms"
+, journal =     "Computers and Graphics"
+, volume =      5
+, year =        1980
+, pages =       "31--40"
 }
 
 @book{pr-cap-88
-, author =	"M. B. {Pour-El} and J. I. Richards"
-, title =	"Computability in Analysis and Physics"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Heidelberg"
-, year =	1988
-, update =	"98.11 bibrelex"
+, author =      "M. B. {Pour-El} and J. I. Richards"
+, title =       "Computability in Analysis and Physics"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Heidelberg"
+, year =        1988
+, update =      "98.11 bibrelex"
 }
 
 @article{p-mrpdt-92
-, author =	"P. L. Powar"
-, title =	"Minimal roughness property of the {Delaunay} triangulation: a shorter approach"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	9
-, year =	1992
-, pages =	"491--494"
-, update =	"98.11 bibrelex"
+, author =      "P. L. Powar"
+, title =       "Minimal roughness property of the {Delaunay} triangulation: a shorter approach"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      9
+, year =        1992
+, pages =       "491--494"
+, update =      "98.11 bibrelex"
 }
 
 @article{ps-pqat-77
-, author =	"M. J. D. Powell and M. A. Sabin"
-, title =	"Piecewise quadratic approximations on triangles"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	3
-, year =	1977
-, pages =	"316--325"
+, author =      "M. J. D. Powell and M. A. Sabin"
+, title =       "Piecewise quadratic approximations on triangles"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      3
+, year =        1977
+, pages =       "316--325"
 }
 
 @techreport{p-hsp-90
-, author =	"N. Prabhu"
-, title =	"Hamiltonian Simple Polytopes"
-, type =	"Technical {Report}"
-, number =	"90-17"
-, institution =	"DIMACS, Rutgers Univ."
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "N. Prabhu"
+, title =       "Hamiltonian Simple Polytopes"
+, type =        "Technical {Report}"
+, number =      "90-17"
+, institution = "DIMACS, Rutgers Univ."
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @phdthesis{p-ssigm-88
-, author =	"P. V. Prakash"
-, title =	"Surface-to-Surface Intersections for Geometric Modeling"
-, type =	"Ph.{D}. Thesis"
-, school =	"Massachusetts Institute of Technology"
-, address =	"Cambridge, Massachusetts"
-, year =	1988
-, keywords =	"doctoral thesis"
-, update =	"95.05 abrams"
+, author =      "P. V. Prakash"
+, title =       "Surface-to-Surface Intersections for Geometric Modeling"
+, type =        "Ph.{D}. Thesis"
+, school =      "Massachusetts Institute of Technology"
+, address =     "Cambridge, Massachusetts"
+, year =        1988
+, keywords =    "doctoral thesis"
+, update =      "95.05 abrams"
 }
 
 @article{ppd-vmdr-98
-, author =	"D. Chithra Prasad and Sudebkumar P. Pal and Tamal K. Dey"
-, title =	"Visibility with multiple diffuse reflections"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"187--196"
-, update =	"98.11 devillers"
+, author =      "D. Chithra Prasad and Sudebkumar P. Pal and Tamal K. Dey"
+, title =       "Visibility with multiple diffuse reflections"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "187--196"
+, update =      "98.11 devillers"
 }
 
 @article{pr-apmb-87
-, author =	"V. K. Prasanna and C. S. Raghavendra"
-, title =	"Array Processor with Multiple Broadcasting"
-, journal =	"Journal of Parallel and Distributed Processing"
-, volume =	4
-, year =	1987
-, pages =	"173--190"
-, update =	"98.11 bibrelex"
+, author =      "V. K. Prasanna and C. S. Raghavendra"
+, title =       "Array Processor with Multiple Broadcasting"
+, journal =     "Journal of Parallel and Distributed Processing"
+, volume =      4
+, year =        1987
+, pages =       "173--190"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{pr-popp-92
-, author =	"V. K. Prasanna and A. S. Rao"
-, title =	"Parallel orientation of polygonal parts"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "V. K. Prasanna and A. S. Rao"
+, title =       "Parallel orientation of polygonal parts"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @article{ph-ddocs-92
-, author =	"J. P. Pratt and V. P. Heuring"
-, title =	"Designing digital optical computing systems: power and and crosstalk"
-, journal =	"Appl. Optics"
-, volume =	31
-, number =	23
-, year =	1992
-, pages =	"4657--4661"
-, update =	"98.03 bibrelex"
+, author =      "J. P. Pratt and V. P. Heuring"
+, title =       "Designing digital optical computing systems: power and and crosstalk"
+, journal =     "Appl. Optics"
+, volume =      31
+, number =      23
+, year =        1992
+, pages =       "4657--4661"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{p-dlsfas-87
-, author =	"V. Pratt"
-, title =	"Direct least squares fitting of algebraic surfaces"
-, booktitle =	"Proc. Siggraph '87"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "V. Pratt"
+, title =       "Direct least squares fitting of algebraic surfaces"
+, booktitle =   "Proc. Siggraph '87"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{p-tcs-85
-, author =	"V. Pratt"
-, title =	"Techniques for conic splines"
-, journal =	"Comput. Graph."
-, volume =	19
-, number =	3
-, year =	1985
-, pages =	"151--159"
-, note =	"Proc. SIGGRAPH '85"
+, author =      "V. Pratt"
+, title =       "Techniques for conic splines"
+, journal =     "Comput. Graph."
+, volume =      19
+, number =      3
+, year =        1985
+, pages =       "151--159"
+, note =        "Proc. SIGGRAPH '85"
 }
 
 @book{pl-pdavs-88
-, author =	"B. T. Preas and M. J. Lorenzetti"
-, title =	"Physical design automation of {VLSI} systems"
-, publisher =	"Benjamin Cummings"
-, address =	"Menlo Park, CA"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "B. T. Preas and M. J. Lorenzetti"
+, title =       "Physical design automation of {VLSI} systems"
+, publisher =   "Benjamin Cummings"
+, address =     "Menlo Park, CA"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{p-ptnp-92
-, author =	"Waldemar Preilowski"
-, title =	"Parallel triangulation of nonconvex polytopes"
-, booktitle =	"Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, year =	1992
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Waldemar Preilowski"
+, title =       "Parallel triangulation of nonconvex polytopes"
+, booktitle =   "Proc. 18th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, year =        1992
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{p-ptnp-92c
-, author =	"W. Preilowski"
-, title =	"Parallel Triangulation of Nonconvex Polytopes"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"97--99"
-, update =	"00.03 bibrelex"
+, author =      "W. Preilowski"
+, title =       "Parallel Triangulation of Nonconvex Polytopes"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "97--99"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{p-psdpr-93
-, author =	"Waldemar Preilowski"
-, title =	"The Pathtree: a Suitable Datastructure for Parallel Rayshooting"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"14--16"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
+, author =      "Waldemar Preilowski"
+, title =       "The Pathtree: a Suitable Datastructure for Parallel Rayshooting"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "14--16"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
 }
 
 @inproceedings{pm-toacv-89
-, author =	"W. Preilowski and W. Mumbeck"
-, title =	"A Time-Optimal Algorithm for the computing of {Voronoi} Diagrams"
-, booktitle =	"Graph-Theoretic Concepts in Computer Science. Proceedings."
-, year =	1989
-, pages =	"424--433"
+, author =      "W. Preilowski and W. Mumbeck"
+, title =       "A Time-Optimal Algorithm for the computing of {Voronoi} Diagrams"
+, booktitle =   "Graph-Theoretic Concepts in Computer Science. Proceedings."
+, year =        1989
+, pages =       "424--433"
 }
 
 @inproceedings{pdw-npach-92
-, author =	"W. Preilowsky and E. Dahlhaus and G. Wechsung"
-, title =	"New parallel algorithms for convex hull and triangulation in $3$-dimensional space"
-, booktitle =	"Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	629
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"442--450"
-, update =	"98.03 bibrelex"
+, author =      "W. Preilowsky and E. Dahlhaus and G. Wechsung"
+, title =       "New parallel algorithms for convex hull and triangulation in $3$-dimensional space"
+, booktitle =   "Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      629
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "442--450"
+, update =      "98.03 bibrelex"
 }
 
 @article{p-nappl-81
-, author =	"F. P. Preparata"
-, title =	"A new approach to planar point location"
-, journal =	"SIAM J. Comput."
-, volume =	10
-, number =	3
-, year =	1981
-, pages =	"473--482"
-, update =	"98.07 tamassia"
+, author =      "F. P. Preparata"
+, title =       "A new approach to planar point location"
+, journal =     "SIAM J. Comput."
+, volume =      10
+, number =      3
+, year =        1981
+, pages =       "473--482"
+, update =      "98.07 tamassia"
 }
 
 @article{p-nlspp-79
-, author =	"F. P. Preparata"
-, title =	"A note on locating a set of points in a planar subdivision"
-, journal =	"SIAM J. Comput."
-, volume =	8
-, year =	1979
-, pages =	"542--545"
+, author =      "F. P. Preparata"
+, title =       "A note on locating a set of points in a planar subdivision"
+, journal =     "SIAM J. Comput."
+, volume =      8
+, year =        1979
+, pages =       "542--545"
 }
 
 @article{p-ortap-79
-, author =	"F. P. Preparata"
-, title =	"An optimal real-time algorithm for planar convex hulls"
-, journal =	"Commun. ACM"
-, volume =	22
-, year =	1979
-, pages =	"402--405"
+, author =      "F. P. Preparata"
+, title =       "An optimal real-time algorithm for planar convex hulls"
+, journal =     "Commun. ACM"
+, volume =      22
+, year =        1979
+, pages =       "402--405"
 }
 
 @book{p-cg-83
-, title =	"Computational Geometry"
-, editor =	"Franco P. Preparata"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, update =	"01.04 icking"
-, annote =	"Contains the following items:
-		 c-pcp-83, eow-gfcs-83, gy-tsr-83, d-gatcl-83, l-mcprg-83, be-ewcst-83,
-		 bow-cmhds-83, ab-acddv-83, ddg-fsp-83, s-ghsgc-83, g-dpcp-83, mz-pmhfa-83"
+, title =       "Computational Geometry"
+, editor =      "Franco P. Preparata"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, update =      "01.04 icking"
+, annote =      "Contains the following items:
+                 c-pcp-83, eow-gfcs-83, gy-tsr-83, d-gatcl-83, l-mcprg-83, be-ewcst-83,
+                 bow-cmhds-83, ab-acddv-83, ddg-fsp-83, s-ghsgc-83, g-dpcp-83, mz-pmhfa-83"
 }
 
 @techreport{p-msc-77
-, author =	"F. P. Preparata"
-, title =	"Minimum spanning circle"
-, institution =	"Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1977
-, note =	"in 'Steps into Computational Geometry'"
-, update =	"01.11 devillers, 98.03 bibrelex"
+, author =      "F. P. Preparata"
+, title =       "Minimum spanning circle"
+, institution = "Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1977
+, note =        "in 'Steps into Computational Geometry'"
+, update =      "01.11 devillers, 98.03 bibrelex"
 }
 
 @article{p-otdvl-83
-, author =	"F. P. Preparata"
-, title =	"Optimal Three-Dimensional {VLSI} Layouts"
-, journal =	"Math. Syst. Theory"
-, volume =	16
-, year =	1983
-, pages =	"1--8"
-, update =	"98.07 patrignani"
+, author =      "F. P. Preparata"
+, title =       "Optimal Three-Dimensional {VLSI} Layouts"
+, journal =     "Math. Syst. Theory"
+, volume =      16
+, year =        1983
+, pages =       "1--8"
+, update =      "98.07 patrignani"
 }
 
 @book{p-pdc-87
-, title =	"Parallel and Distributed Computing"
-, editor =	"Franco P. Preparata"
-, series =	"Adv. Comput. Res."
-, volume =	4
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1987
-, update =	"01.04 icking"
+, title =       "Parallel and Distributed Computing"
+, editor =      "Franco P. Preparata"
+, series =      "Adv. Comput. Res."
+, volume =      4
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1987
+, update =      "01.04 icking"
 }
 
 @article{p-pplr-90
-, author =	"F. P. Preparata"
-, title =	"Planar point location revisited"
-, journal =	"Internat. J. Found. Comput. Sci."
-, volume =	1
-, number =	1
-, year =	1990
-, pages =	"71--86"
-, update =	"98.07 tamassia"
+, author =      "F. P. Preparata"
+, title =       "Planar point location revisited"
+, journal =     "Internat. J. Found. Comput. Sci."
+, volume =      1
+, number =      1
+, year =        1990
+, pages =       "71--86"
+, update =      "98.07 tamassia"
 }
 
 @inproceedings{p-rga-96
-, author =	"F. P. Preparata"
-, title =	"Robustness in Geometric Algorithms"
-, booktitle =	"Proc. 1st ACM Workshop on Appl. Comput. Geom."
-, site =	"Philadelphia, PA, USA"
-, month =	may
-, year =	1996
-, pages =	"29--30"
-, update =	"97.11 held"
+, author =      "F. P. Preparata"
+, title =       "Robustness in Geometric Algorithms"
+, booktitle =   "Proc. 1st ACM Workshop on Appl. Comput. Geom."
+, site =        "Philadelphia, PA, USA"
+, month =       may
+, year =        1996
+, pages =       "29--30"
+, update =      "97.11 held"
 }
 
 @techreport{p-scg-77
-, author =	"F. P. Preparata"
-, title =	"Steps into computational geometry"
-, type =	"Report"
-, number =	"R-760"
-, institution =	"Coordinated Sci. Lab., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1977
+, author =      "F. P. Preparata"
+, title =       "Steps into computational geometry"
+, type =        "Report"
+, number =      "R-760"
+, institution = "Coordinated Sci. Lab., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1977
 }
 
 @techreport{p-scgn2-77
-, author =	"F. P. Preparata"
-, title =	"Steps into computational geometry: {Notebook} {II}"
-, type =	"Report"
-, number =	"R-792"
-, institution =	"Coordinated Sci. Lab., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1977
+, author =      "F. P. Preparata"
+, title =       "Steps into computational geometry: {Notebook} {II}"
+, type =        "Report"
+, number =      "R-792"
+, institution = "Coordinated Sci. Lab., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1977
 }
 
 @inproceedings{p-masp-77
-, author =	"F. P. Preparata"
-, title =	"The medial axis of a simple polygon"
-, booktitle =	"Proc. 6th Internat. Sympos. Math. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	53
-, publisher =	"Springer-Verlag"
-, year =	1977
-, pages =	"443--450"
+, author =      "F. P. Preparata"
+, title =       "The medial axis of a simple polygon"
+, booktitle =   "Proc. 6th Internat. Sympos. Math. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      53
+, publisher =   "Springer-Verlag"
+, year =        1977
+, pages =       "443--450"
 }
 
 @book{p-vt-84
-, title =	"{VLSI} Theory"
-, editor =	"Franco P. Preparata"
-, series =	"Adv. Comput. Res."
-, volume =	2
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1984
-, update =	"01.04 icking"
+, title =       "{VLSI} Theory"
+, editor =      "Franco P. Preparata"
+, series =      "Adv. Comput. Res."
+, volume =      2
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1984
+, update =      "01.04 icking"
 }
 
 @article{ph-chfsp-77
-, author =	"F. P. Preparata and S. J. Hong"
-, title =	"Convex hulls of finite sets of points in two and three dimensions"
-, journal =	"Commun. ACM"
-, volume =	20
-, year =	1977
-, pages =	"87--93"
-, keywords =	"divide-and-conquer, worst-case analysis"
-, annote =	"Claims $O(n \log n)$ time, but actually takes $O(n^2)$
-		 time in special cases [d-iafch-90]"
+, author =      "F. P. Preparata and S. J. Hong"
+, title =       "Convex hulls of finite sets of points in two and three dimensions"
+, journal =     "Commun. ACM"
+, volume =      20
+, year =        1977
+, pages =       "87--93"
+, keywords =    "divide-and-conquer, worst-case analysis"
+, annote =      "Claims $O(n \log n)$ time, but actually takes $O(n^2)$
+                 time in special cases [d-iafch-90]"
 }
 
 @article{pl-otlcr-84
-, author =	"F. P. Preparata and W. {Lipski, Jr.}"
-, title =	"Optimal three-layer channel routing"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-33"
-, year =	1984
-, pages =	"427--437"
-, succeeds =	"pl-tlae-82"
+, author =      "F. P. Preparata and W. {Lipski, Jr.}"
+, title =       "Optimal three-layer channel routing"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-33"
+, year =        1984
+, pages =       "427--437"
+, succeeds =    "pl-tlae-82"
 }
 
 @inproceedings{pl-tlae-82
-, author =	"F. P. Preparata and W. {Lipski, Jr.}"
-, title =	"Three layers are enough"
-, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1982
-, pages =	"350--357"
-, precedes =	"pl-otlcr-84"
+, author =      "F. P. Preparata and W. {Lipski, Jr.}"
+, title =       "Three layers are enough"
+, booktitle =   "Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1982
+, pages =       "350--357"
+, precedes =    "pl-otlcr-84"
 }
 
 @article{pm-finhs-79
-, author =	"F. P. Preparata and D. E. Muller"
-, title =	"Finding the intersection of $n$ half-spaces in time {$O(n \log n)$}"
-, journal =	"Theoret. Comput. Sci."
-, volume =	8
-, year =	1979
-, pages =	"45--55"
+, author =      "F. P. Preparata and D. E. Muller"
+, title =       "Finding the intersection of $n$ half-spaces in time {$O(n \log n)$}"
+, journal =     "Theoret. Comput. Sci."
+, volume =      8
+, year =        1979
+, pages =       "45--55"
 }
 
 @book{ps-cgi-85
-, author =	"F. P. Preparata and M. I. Shamos"
-, title =	"Computational Geometry: An Introduction"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1985
-, comments =	"corrected and expanded second printing, 1988"
-, precedes =	"ps-cgi-90"
-, update =	"98.11 bibrelex, 95.09 agarwal"
+, author =      "F. P. Preparata and M. I. Shamos"
+, title =       "Computational Geometry: An Introduction"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1985
+, comments =    "corrected and expanded second printing, 1988"
+, precedes =    "ps-cgi-90"
+, update =      "98.11 bibrelex, 95.09 agarwal"
 }
 
 @book{ps-cgi-90
-, author =	"F. P. Preparata and M. I. Shamos"
-, title =	"Computational Geometry: An Introduction"
-, edition =	"3rd"
-, publisher =	"Springer-Verlag"
-, month =	oct
-, year =	1990
-, isbn =	"3-540-96131-3"
-, succeeds =	"ps-cgi-85"
-, update =	"98.11 bibrelex"
+, author =      "F. P. Preparata and M. I. Shamos"
+, title =       "Computational Geometry: An Introduction"
+, edition =     "3rd"
+, publisher =   "Springer-Verlag"
+, month =       oct
+, year =        1990
+, isbn =        "3-540-96131-3"
+, succeeds =    "ps-cgi-85"
+, update =      "98.11 bibrelex"
 }
 
 @article{ps-tspm-81
-, author =	"F. P. Preparata and K. J. Supowit"
-, title =	"Testing a simple polygon for monotonicity"
-, journal =	"Inform. Process. Lett."
-, volume =	12
-, number =	4
-, year =	1981
-, pages =	"161--164"
-, keywords =	"polygons, design of algorithms"
-, update =	"98.07 bibrelex"
+, author =      "F. P. Preparata and K. J. Supowit"
+, title =       "Testing a simple polygon for monotonicity"
+, journal =     "Inform. Process. Lett."
+, volume =      12
+, number =      4
+, year =        1981
+, pages =       "161--164"
+, keywords =    "polygons, design of algorithms"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{pt-fdppl-87
-, author =	"F. P. Preparata and R. Tamassia"
-, title =	"A fully dynamic planar point location technique"
-, type =	"Report"
-, number =	"UILU-ENG-87-2266"
-, institution =	"Coordinated Sci. Lab., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1987
-, keywords =	"point location, data structuring, on-line"
-, precedes =	"pt-dpplo-89"
+, author =      "F. P. Preparata and R. Tamassia"
+, title =       "A fully dynamic planar point location technique"
+, type =        "Report"
+, number =      "UILU-ENG-87-2266"
+, institution = "Coordinated Sci. Lab., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1987
+, keywords =    "point location, data structuring, on-line"
+, precedes =    "pt-dpplo-89"
 }
 
 @inproceedings{pt-dpplo-89
-, author =	"F. P. Preparata and R. Tamassia"
-, title =	"Dynamic planar point location with optimal query time"
-, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	349
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"84--95"
-, keywords =	"subdivisions, point location, on-line, two-dimensional"
-, succeeds =	"pt-fdppl-87"
-, precedes =	"pt-dpplo-90"
+, author =      "F. P. Preparata and R. Tamassia"
+, title =       "Dynamic planar point location with optimal query time"
+, booktitle =   "Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      349
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "84--95"
+, keywords =    "subdivisions, point location, on-line, two-dimensional"
+, succeeds =    "pt-fdppl-87"
+, precedes =    "pt-dpplo-90"
 }
 
 @article{pt-dpplo-90
-, author =	"F. P. Preparata and R. Tamassia"
-, title =	"Dynamic planar point location with optimal query time"
-, journal =	"Theoret. Comput. Sci."
-, volume =	74
-, year =	1990
-, pages =	"95--114"
-, succeeds =	"pt-dpplo-89"
+, author =      "F. P. Preparata and R. Tamassia"
+, title =       "Dynamic planar point location with optimal query time"
+, journal =     "Theoret. Comput. Sci."
+, volume =      74
+, year =        1990
+, pages =       "95--114"
+, succeeds =    "pt-dpplo-89"
 }
 
 @article{pt-eplcs-92
-, author =	"F. P. Preparata and R. Tamassia"
-, title =	"Efficient point location in a convex spatial cell-complex"
-, journal =	"SIAM J. Comput."
-, volume =	21
-, year =	1992
-, pages =	"267--280"
-, succeeds =	"pt-espl-89"
+, author =      "F. P. Preparata and R. Tamassia"
+, title =       "Efficient point location in a convex spatial cell-complex"
+, journal =     "SIAM J. Comput."
+, volume =      21
+, year =        1992
+, pages =       "267--280"
+, succeeds =    "pt-espl-89"
 }
 
 @inproceedings{pt-espl-89
-, author =	"F. P. Preparata and R. Tamassia"
-, title =	"Efficient spatial point location"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"3--11"
-, precedes =	"pt-eplcs-92"
+, author =      "F. P. Preparata and R. Tamassia"
+, title =       "Efficient spatial point location"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "3--11"
+, precedes =    "pt-eplcs-92"
 }
 
 @article{pt-fdplm-89
-, author =	"F. P. Preparata and R. Tamassia"
-, title =	"Fully dynamic point location in a monotone subdivision"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, number =	4
-, year =	1989
-, pages =	"811--830"
-, update =	"98.11 bibrelex"
+, author =      "F. P. Preparata and R. Tamassia"
+, title =       "Fully dynamic point location in a monotone subdivision"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, number =      4
+, year =        1989
+, pages =       "811--830"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{pt-fdtpl-88
-, author =	"F. P. Preparata and R. Tamassia"
-, title =	"Fully dynamic techniques for point location and transitive closure in planar structures"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"558--567"
-, comments =	"In two journal papers: \cite{tp-dmpda-90},
-		 \cite{pt-fdplm-89}"
+, author =      "F. P. Preparata and R. Tamassia"
+, title =       "Fully dynamic techniques for point location and transitive closure in planar structures"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "558--567"
+, comments =    "In two journal papers: \cite{tp-dmpda-90},
+                 \cite{pt-fdplm-89}"
 }
 
 @inproceedings{pv-sthle-92
-, author =	"F. P. Preparata and J. S. Vitter"
-, title =	"A simplified technique for hidden-line elimination in terrains"
-, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	577
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"135--146"
-, precedes =	"pv-sthle-93"
-, update =	"94.09 vitter"
+, author =      "F. P. Preparata and J. S. Vitter"
+, title =       "A simplified technique for hidden-line elimination in terrains"
+, booktitle =   "Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      577
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "135--146"
+, precedes =    "pv-sthle-93"
+, update =      "94.09 vitter"
 }
 
 @article{pv-sthle-93
-, author =	"F. P. Preparata and J. S. Vitter"
-, title =	"A Simplified Technique for Hidden-Line Elimination in Terrains"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"167--181"
-, succeeds =	"pv-sthle-92"
-, update =	"94.09 vitter"
+, author =      "F. P. Preparata and J. S. Vitter"
+, title =       "A Simplified Technique for Hidden-Line Elimination in Terrains"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "167--181"
+, succeeds =    "pv-sthle-92"
+, update =      "94.09 vitter"
 }
 
 @techreport{pvy-cavsi-88
-, author =	"F. P. Preparata and J. S. Vitter and M. Yvinec"
-, title =	"Computation of the axial view of a set of isothetic parallelepipeds"
-, type =	"Report"
-, number =	"LIENS-88-1"
-, institution =	"Lab. d'Informatique, Dept. Math. d'Informatique, Ecole Normale Sup{\'e}rieure"
-, address =	"Paris, France"
-, year =	1988
-, precedes =	"pvy-cavsi-90"
+, author =      "F. P. Preparata and J. S. Vitter and M. Yvinec"
+, title =       "Computation of the axial view of a set of isothetic parallelepipeds"
+, type =        "Report"
+, number =      "LIENS-88-1"
+, institution = "Lab. d'Informatique, Dept. Math. d'Informatique, Ecole Normale Sup{\'e}rieure"
+, address =     "Paris, France"
+, year =        1988
+, precedes =    "pvy-cavsi-90"
 }
 
 @article{pvy-cavsi-90
-, author =	"F. P. Preparata and J. S. Vitter and M. Yvinec"
-, title =	"Computation of the axial view of a set of isothetic parallelepipeds"
-, journal =	"ACM Trans. Graph."
-, volume =	9
-, year =	1990
-, pages =	"278--300"
-, succeeds =	"pvy-cavsi-88"
+, author =      "F. P. Preparata and J. S. Vitter and M. Yvinec"
+, title =       "Computation of the axial view of a set of isothetic parallelepipeds"
+, journal =     "ACM Trans. Graph."
+, volume =      9
+, year =        1990
+, pages =       "278--300"
+, succeeds =    "pvy-cavsi-88"
 }
 
 @inproceedings{pvy-osgpv-90
-, author =	"F. P. Preparata and J. S. Vitter and M. Yvinec"
-, title =	"Output-sensitive generation of the perspective view of isothetic parallelepipeds"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"71--84"
+, author =      "F. P. Preparata and J. S. Vitter and M. Yvinec"
+, title =       "Output-sensitive generation of the perspective view of isothetic parallelepipeds"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "71--84"
 }
 
 @article{pvy-osgpv-92
-, author =	"F. P. Preparata and J. S. Vitter and M. Yvinec"
-, title =	"Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"257--283"
-, keywords =	"geometric probing, polyhedral scenes"
+, author =      "F. P. Preparata and J. S. Vitter and M. Yvinec"
+, title =       "Output-Sensitive Generation of the Perspective View of Isothetic Parallelepipeds"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "257--283"
+, keywords =    "geometric probing, polyhedral scenes"
 }
 
 @book{ptvf-nrc-88
-, author =	"W. Press and S. Teukolsky and W. Vetterling and B. Flannery"
-, title =	"Numerical Recipes in {C}"
-, edition =	"1st"
-, publisher =	"Cambridge University Press"
-, year =	1988
-, succeeds =	"pftv-nr-86"
-, update =	"98.11 bibrelex, 97.11 bibrelex"
+, author =      "W. Press and S. Teukolsky and W. Vetterling and B. Flannery"
+, title =       "Numerical Recipes in {C}"
+, edition =     "1st"
+, publisher =   "Cambridge University Press"
+, year =        1988
+, succeeds =    "pftv-nr-86"
+, update =      "98.11 bibrelex, 97.11 bibrelex"
 }
 
 @book{pftv-nr-86
-, author =	"W. H. Press and B. P. Flannery and S. A. Teukolsky and W. T. Vetterling"
-, title =	"Numerical Recipes"
-, publisher =	"Cambridge University Press"
-, year =	1986
-, precedes =	"ptvf-nrc-88"
-, update =	"97.11 bibrelex"
+, author =      "W. H. Press and B. P. Flannery and S. A. Teukolsky and W. T. Vetterling"
+, title =       "Numerical Recipes"
+, publisher =   "Cambridge University Press"
+, year =        1986
+, precedes =    "ptvf-nrc-88"
+, update =      "97.11 bibrelex"
 }
 
 @book{pftv-nrc-93
-, author =	"William H. Press and Brian P. Flannery and Saul A. Teukolsky and William T. Vetterling"
-, title =	"Numerical Recipes in~{C}"
-, edition =	"2nd"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge, England"
-, year =	1993
-, update =	"98.07 tamassia+vismara, 97.11 bibrelex"
+, author =      "William H. Press and Brian P. Flannery and Saul A. Teukolsky and William T. Vetterling"
+, title =       "Numerical Recipes in~{C}"
+, edition =     "2nd"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge, England"
+, year =        1993
+, update =      "98.07 tamassia+vismara, 97.11 bibrelex"
 }
 
 @book{pu-mipa-82
-, author =	"K. Preston and L. Uhr"
-, title =	"Multicomputers and Image Processing Algorithms"
-, publisher =	"Academic Press"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "K. Preston and L. Uhr"
+, title =       "Multicomputers and Image Processing Algorithms"
+, publisher =   "Academic Press"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @incollection{p-mrisf-87
-, author =	"W. I. Pribble"
-, title =	"Molds for reaction injection, structural foam and expandable styrene molding"
-, editor =	"J. H. DuBois and W. I. Pribble"
-, booktitle =	"Plastics mold engineering handbook"
-, publisher =	"Van Nostrand Reinhold Company Inc."
-, address =	"New York, NY"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "W. I. Pribble"
+, title =       "Molds for reaction injection, structural foam and expandable styrene molding"
+, editor =      "J. H. DuBois and W. I. Pribble"
+, booktitle =   "Plastics mold engineering handbook"
+, publisher =   "Van Nostrand Reinhold Company Inc."
+, address =     "New York, NY"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @book{p-lb-71
-, author =	"K. H. Pribram"
-, title =	"Languages of the brain"
-, publisher =	"Prentice-Hall inc."
-, address =	"Englewood cliffs, New Jersey"
-, year =	1971
-, update =	"98.11 bibrelex"
+, author =      "K. H. Pribram"
+, title =       "Languages of the brain"
+, publisher =   "Prentice-Hall inc."
+, address =     "Englewood cliffs, New Jersey"
+, year =        1971
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{psb-motmo-95
-, author =	"Mark Price and Clive Stops and Geoffrey Butlin"
-, title =	"A Medial Object Toolkit for Meshing and Other Applications"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"219--230"
-, update =	"96.01 samitchell"
+, author =      "Mark Price and Clive Stops and Geoffrey Butlin"
+, title =       "A Medial Object Toolkit for Meshing and Other Applications"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "219--230"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{p-aapfp-91
-, author =	"D. Priest"
-, title =	"Algorithms for arbitrary precision floating point arithmetic"
-, booktitle =	"Proc. 10th Symp. on coputer arithmetic"
-, year =	1991
-, pages =	"132--143"
-, update =	"96.05 devillers"
+, author =      "D. Priest"
+, title =       "Algorithms for arbitrary precision floating point arithmetic"
+, booktitle =   "Proc. 10th Symp. on coputer arithmetic"
+, year =        1991
+, pages =       "132--143"
+, update =      "96.05 devillers"
 }
 
 @phdthesis{p-pfpan-92
-, author =	"D. Priest"
-, title =	"On properties of floating point arithmetics: numerical stability and the cost of accurate computations"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. of mathematics"
-, address =	"Univ. of California at Berkeley"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"96.05 devillers"
+, author =      "D. Priest"
+, title =       "On properties of floating point arithmetics: numerical stability and the cost of accurate computations"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. of mathematics"
+, address =     "Univ. of California at Berkeley"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "96.05 devillers"
 }
 
 @article{p-aicad-86
-, author =	"D. Prill"
-, title =	"On approximations and incidence in cylindrical algebraic decompositions"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"972--993"
-, update =	"98.03 bibrelex"
+, author =      "D. Prill"
+, title =       "On approximations and incidence in cylindrical algebraic decompositions"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "972--993"
+, update =      "98.03 bibrelex"
 }
 
 @article{p-scnsg-57
-, author =	"R. C. Prim"
-, title =	"Shortest connection networks and some generalizations"
-, journal =	"Bell Syst. Tech. J."
-, volume =	36
-, year =	1957
-, pages =	"1389--1401"
+, author =      "R. C. Prim"
+, title =       "Shortest connection networks and some generalizations"
+, journal =     "Bell Syst. Tech. J."
+, volume =      36
+, year =        1957
+, pages =       "1389--1401"
 }
 
 @article{psts-tagsd-91
-, author =	"L. B. Protsko and P. G. Sorenson and J. P. Tremblay and D. A. Schaefer"
-, title =	"Towards the Automatic Generation of Software Diagrams"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	"SE-17"
-, number =	1
-, year =	1991
-, pages =	"10--21"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "L. B. Protsko and P. G. Sorenson and J. P. Tremblay and D. A. Schaefer"
+, title =       "Towards the Automatic Generation of Software Diagrams"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      "SE-17"
+, number =      1
+, year =        1991
+, pages =       "10--21"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{p-cstp-88
-, author =	"J. S. Provan"
-, title =	"Convexity and the {Steiner} Tree Problem"
-, journal =	"Networks"
-, volume =	18
-, year =	1988
-, pages =	"57--72"
-, update =	"98.11 bibrelex"
+, author =      "J. S. Provan"
+, title =       "Convexity and the {Steiner} Tree Problem"
+, journal =     "Networks"
+, volume =      18
+, year =        1988
+, pages =       "57--72"
+, update =      "98.11 bibrelex"
 }
 
 @article{p-tncfs-92
-, author =	"J. S. Provan"
-, title =	"Two new criteria for finding {Steiner} hulls in {Steiner} tree problems"
-, journal =	"Algorithmica"
-, volume =	7
-, year =	1992
-, pages =	"289--302"
-, update =	"98.11 bibrelex"
+, author =      "J. S. Provan"
+, title =       "Two new criteria for finding {Steiner} hulls in {Steiner} tree problems"
+, journal =     "Algorithmica"
+, volume =      7
+, year =        1992
+, pages =       "289--302"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{p-sccps-84
-, author =	"P. Prusinkiewicz"
-, title =	"Space complexity of the contour problem for a set of iso-rectangles"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Univ. Regina"
-, address =	"Regina, SK"
-, month =	dec
-, year =	1984
-, keywords =	"isothetic rectangles, construction, plane-sweep, segment trees, worst-case analysis, output-sensitive"
-, annote =	"$O(n \log n + k)$ time, $O(n)$ space"
+, author =      "P. Prusinkiewicz"
+, title =       "Space complexity of the contour problem for a set of iso-rectangles"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Univ. Regina"
+, address =     "Regina, SK"
+, month =       dec
+, year =        1984
+, keywords =    "isothetic rectangles, construction, plane-sweep, segment trees, worst-case analysis, output-sensitive"
+, annote =      "$O(n \log n + k)$ time, $O(n)$ space"
 }
 
 @techreport{pr-ssoca-83
-, author =	"P. Prusinkiewicz and V. V. Raghavan"
-, title =	"A simple space-optimal contour algorithm for a set of iso-rectangles"
-, type =	"Report"
-, number =	"CS-83-03"
-, institution =	"Dept. Comput. Sci., Univ. Regina"
-, address =	"Regina, SK"
-, year =	1983
-, keywords =	"isothetic rectangles, construction, plane-sweep, linked lists, worst-case analysis"
-, annote =	"$O(n^{2})$ time, $O(n)$ space"
+, author =      "P. Prusinkiewicz and V. V. Raghavan"
+, title =       "A simple space-optimal contour algorithm for a set of iso-rectangles"
+, type =        "Report"
+, number =      "CS-83-03"
+, institution = "Dept. Comput. Sci., Univ. Regina"
+, address =     "Regina, SK"
+, year =        1983
+, keywords =    "isothetic rectangles, construction, plane-sweep, linked lists, worst-case analysis"
+, annote =      "$O(n^{2})$ time, $O(n)$ space"
 }
 
 @techreport{py-anfaq-84
-, author =	"C. Puech and H. Yahia"
-, title =	"Analysis of a neighbour finding algorithm in quadtrees"
-, type =	"Report"
-, number =	"??"
-, institution =	"Lab. Recherche Inform., Univ. Paris Sud"
-, address =	"Orsay, France"
-, year =	1984
+, author =      "C. Puech and H. Yahia"
+, title =       "Analysis of a neighbour finding algorithm in quadtrees"
+, type =        "Report"
+, number =      "??"
+, institution = "Lab. Recherche Inform., Univ. Paris Sud"
+, address =     "Orsay, France"
+, year =        1984
 }
 
 @inproceedings{py-qohua-85
-, author =	"C. Puech and H. Yahia"
-, title =	"Quadtrees, octrees, hyperoctrees: a unified analytical approach to tree data structures used in graphics, geometric modeling and image processing"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"272--280"
-, cites =	"achllstu-mairp-81, an-bp-72, beh-gms-79, b-gmcv-74, b-ame-74, dt-dtoeo-81, drs-rrbcq-80, e-rsp-70, fp-ochr3-84, f-addmd-79, fs-ppmta-83, ftyk-oasm-83, ftyk-eotds-83, g-ewrq-82, gd-tdsgi-81, h-ecdsg-78, hs-oiuqt-79, i-lgto-81, j-cmtdo-79, jt-otur3-82, kd-epurd-76, m-oe-80, m-gmuqe-82, mm-anrt-78, p-remdt-83, py-anfaq-84, rr-rtdo-78, r-rrstm-80, rv-smcsr-83, s-rrqba-80, s-dtdqt-80, s-rrqbc-80, s-cpirq-81, s-ccluq-81, s-acrq-81, s-nftir-82, s-qmat-83, s-qrhds-84, sw-ebq-84, s-rtddi-81, s-lfdle-81, ykf-ordsa-84, yk-lsdso-83, ys-hdsmd-83, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "C. Puech and H. Yahia"
+, title =       "Quadtrees, octrees, hyperoctrees: a unified analytical approach to tree data structures used in graphics, geometric modeling and image processing"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "272--280"
+, cites =       "achllstu-mairp-81, an-bp-72, beh-gms-79, b-gmcv-74, b-ame-74, dt-dtoeo-81, drs-rrbcq-80, e-rsp-70, fp-ochr3-84, f-addmd-79, fs-ppmta-83, ftyk-oasm-83, ftyk-eotds-83, g-ewrq-82, gd-tdsgi-81, h-ecdsg-78, hs-oiuqt-79, i-lgto-81, j-cmtdo-79, jt-otur3-82, kd-epurd-76, m-oe-80, m-gmuqe-82, mm-anrt-78, p-remdt-83, py-anfaq-84, rr-rtdo-78, r-rrstm-80, rv-smcsr-83, s-rrqba-80, s-dtdqt-80, s-rrqbc-80, s-cpirq-81, s-ccluq-81, s-acrq-81, s-nftir-82, s-qmat-83, s-qrhds-84, sw-ebq-84, s-rtddi-81, s-lfdle-81, ykf-ordsa-84, yk-lsdso-83, ys-hdsmd-83, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{p-slc-89
-, author =	"W. Pugh"
-, title =	"Skip List Cookbook"
-, type =	"Technical {Report}"
-, number =	"CS-TR-2286"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, month =	jul
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "W. Pugh"
+, title =       "Skip List Cookbook"
+, type =        "Technical {Report}"
+, number =      "CS-TR-2286"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, month =       jul
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @article{p-slpab-90
-, author =	"W. Pugh"
-, title =	"Skip lists: a probabilistic alternative to balanced trees"
-, journal =	"Commun. ACM"
-, volume =	33
-, number =	6
-, year =	1990
-, pages =	"668--676"
-, keywords =	"data structuring, randomized algorithms"
-, update =	"97.11 bibrelex, 93.05 jones"
+, author =      "W. Pugh"
+, title =       "Skip lists: a probabilistic alternative to balanced trees"
+, journal =     "Commun. ACM"
+, volume =      33
+, number =      6
+, year =        1990
+, pages =       "668--676"
+, keywords =    "data structuring, randomized algorithms"
+, update =      "97.11 bibrelex, 93.05 jones"
 }
 
 @inproceedings{p-csarg-90
-, author =	"D. Pullar"
-, title =	"Comparative study of algorithms for reporting geometrical intersections"
-, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
-, year =	1990
-, pages =	"66--76"
-, update =	"98.03 bibrelex"
+, author =      "D. Pullar"
+, title =       "Comparative study of algorithms for reporting geometrical intersections"
+, booktitle =   "Proc. 4th Internat. Sympos. Spatial Data Handling"
+, year =        1990
+, pages =       "66--76"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{p-pc-89
-, author =	"W. R. Pulleyblank"
-, title =	"Polyhedral combinatorics"
-, editor =	"G. L. Nemhauser and A. H. G. {Rinnooy Kan} and M. J. Todd"
-, booktitle =	"Optimization"
-, series =	"Handbooks in Operations Research and Management Science"
-, volume =	1
-, publisher =	"North-Holland"
-, year =	1989
-, pages =	"371--446"
-, update =	"97.11 bibrelex"
+, author =      "W. R. Pulleyblank"
+, title =       "Polyhedral combinatorics"
+, editor =      "G. L. Nemhauser and A. H. G. {Rinnooy Kan} and M. J. Todd"
+, booktitle =   "Optimization"
+, series =      "Handbooks in Operations Research and Management Science"
+, volume =      1
+, publisher =   "North-Holland"
+, year =        1989
+, pages =       "371--446"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{p-vrts-96
-, author =	"E. Puppo"
-, title =	"Variable resolution terrain surfaces"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"202--210"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "E. Puppo"
+, title =       "Variable resolution terrain surfaces"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "202--210"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{p-wageh-97
-, author =	"Helen Purchase"
-, title =	"Which Aesthetic has the Greatest Effect on Human Understanding?"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"248--261"
-, keywords =	"graph drawing"
-, update =	"99.11 bibrelex, 98.07 patrignani+tamassia+vismara"
+, author =      "Helen Purchase"
+, title =       "Which Aesthetic has the Greatest Effect on Human Understanding?"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "248--261"
+, keywords =    "graph drawing"
+, update =      "99.11 bibrelex, 98.07 patrignani+tamassia+vismara"
 }
 
 @article{p-eivsg-00
-, author =	"Helen C. Purchase"
-, title =	"Effective Information Visualisation: A Study of Graph Drawing Aesthetics and Algorithms"
-, journal =	"Interact. Comput."
-, volume =	13
-, number =	2
-, year =	2000
-, pages =	"147--162"
-, succeeds =	"p-wageh-97"
-, update =	"01.04 vismara"
+, author =      "Helen C. Purchase"
+, title =       "Effective Information Visualisation: A Study of Graph Drawing Aesthetics and Algorithms"
+, journal =     "Interact. Comput."
+, volume =      13
+, number =      2
+, year =        2000
+, pages =       "147--162"
+, succeeds =    "p-wageh-97"
+, update =      "01.04 vismara"
 }
 
 @article{p-placc-98
-, author =	"Helen C. Purchase"
-, title =	"Performance of Layout Algorithms: Comprehension, not Computation"
-, journal =	"J. Visual Lang. Comput."
-, volume =	9
-, number =	6
-, year =	1998
-, pages =	"647--657"
-, update =	"01.04 vismara"
+, author =      "Helen C. Purchase"
+, title =       "Performance of Layout Algorithms: Comprehension, not Computation"
+, journal =     "J. Visual Lang. Comput."
+, volume =      9
+, number =      6
+, year =        1998
+, pages =       "647--657"
+, update =      "01.04 vismara"
 }
 
 @inproceedings{pcj-vgda-96
-, author =	"H. C. Purchase and R. F. Cohen and M. James"
-, title =	"Validating Graph Drawing Aesthetics"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"435--446"
-, keywords =	"graph drawing, aesthetics, human-computer interaction"
-, update =	"98.07 vismara, 96.09 tamassia, 96.04 garg"
+, author =      "H. C. Purchase and R. F. Cohen and M. James"
+, title =       "Validating Graph Drawing Aesthetics"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "435--446"
+, keywords =    "graph drawing, aesthetics, human-computer interaction"
+, update =      "98.07 vismara, 96.09 tamassia, 96.04 garg"
 }
 
 @article{pcj-esbgd-97
-, author =	"H. C. Purchase and R. F. Cohen and M. I. James"
-, title =	"An Experimental Study of the Basis for Graph Drawing Algorithms"
-, journal =	"ACM J. Experim. Algorithmics"
-, volume =	2
-, number =	4
-, year =	1997
-, url =	"http://www.jea.acm.org/1997/PurchaseDrawing/"
-, succeeds =	"pcj-vgda-96"
-, update =	"99.07 vismara"
+, author =      "H. C. Purchase and R. F. Cohen and M. I. James"
+, title =       "An Experimental Study of the Basis for Graph Drawing Algorithms"
+, journal =     "ACM J. Experim. Algorithmics"
+, volume =      2
+, number =      4
+, year =        1997
+, url = "http://www.jea.acm.org/1997/PurchaseDrawing/"
+, succeeds =    "pcj-vgda-96"
+, update =      "99.07 vismara"
 }
 
 @article{p-rae-88
-, author =	"G. Purdy"
-, title =	"Repeated angles in {$E_4$}"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"73--75"
+, author =      "G. Purdy"
+, title =       "Repeated angles in {$E_4$}"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "73--75"
 }
 
 @article{p-mnet-82
-, author =	"G. B. Purdy"
-, title =	"The minimum number of empty triangles"
-, journal =	"AMS Abstracts"
-, volume =	3
-, year =	1982
-, pages =	318
-, update =	"02.03 devillers"
+, author =      "G. B. Purdy"
+, title =       "The minimum number of empty triangles"
+, journal =     "AMS Abstracts"
+, volume =      3
+, year =        1982
+, pages =       318
+, update =      "02.03 devillers"
 }
 
 @techreport{qam-spinp-91
-, author =	"K. Qiu and S. G. Akl and H. Meijer"
-, title =	"The Star and Pancake Interconnection Networks: Properties and Algorithms"
-, type =	"Technical Report"
-, number =	"91-297"
-, institution =	"Dept. Computing and Information Sci, Queen's University"
-, address =	"Canada"
-, month =	mar
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "K. Qiu and S. G. Akl and H. Meijer"
+, title =       "The Star and Pancake Interconnection Networks: Properties and Algorithms"
+, type =        "Technical Report"
+, number =      "91-297"
+, institution = "Dept. Computing and Information Sci, Queen's University"
+, address =     "Canada"
+, month =       mar
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{qma-dsgdc-90
-, author =	"K. Qiu and H. Meijer and S. Akl"
-, title =	"Decomposing a star graph into disjoint cycles"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"70--73"
-, cites =	"ak-gtmsi-86, ahk-sgaan-87, ak-ftsg-87, a-dapa-89, qma-dsgdc-90t, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "K. Qiu and H. Meijer and S. Akl"
+, title =       "Decomposing a star graph into disjoint cycles"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "70--73"
+, cites =       "ak-gtmsi-86, ahk-sgaan-87, ak-ftsg-87, a-dapa-89, qma-dsgdc-90t, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{qma-dsgdc-90t
-, author =	"K. Qiu and H. Meijer and S. G. Akl"
-, title =	"Decomposing a star graph into disjoint cycles"
-, type =	"Technical {Report}"
-, number =	"90-278"
-, institution =	"Dept. Comput. Inform. Sci., Queen's Univ."
-, address =	"Kingston, Canada"
-, month =	may
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "K. Qiu and H. Meijer and S. G. Akl"
+, title =       "Decomposing a star graph into disjoint cycles"
+, type =        "Technical {Report}"
+, number =      "90-278"
+, institution = "Dept. Comput. Inform. Sci., Queen's Univ."
+, address =     "Kingston, Canada"
+, month =       may
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{qma-prspn-91
-, author =	"K. Qiu and H. Meijer and S. G. Akl"
-, title =	"Parallel Routing and Sorting on the Pancake Network"
-, month =	may
-, year =	1991
-, note =	"Proc. International Conf. on Computing and Information, Ottawa, to appear-91"
-, update =	"98.07 bibrelex"
+, author =      "K. Qiu and H. Meijer and S. G. Akl"
+, title =       "Parallel Routing and Sorting on the Pancake Network"
+, month =       may
+, year =        1991
+, note =        "Proc. International Conf. on Computing and Information, Ottawa, to appear-91"
+, update =      "98.07 bibrelex"
 }
 
 @article{qs-csfdd-90
-, author =	"E. Quak and L. Schumaker"
-, title =	"Cubic spline fitting using data dependent triangulations"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	7
-, year =	1990
-, pages =	"293--302"
-, update =	"97.03 schwarzkopf"
+, author =      "E. Quak and L. Schumaker"
+, title =       "Cubic spline fitting using data dependent triangulations"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      7
+, year =        1990
+, pages =       "293--302"
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{qfp-dsarn-85
-, author =	"F. K. H. Quek and R. F. Franklin and F. Pont"
-, title =	"A Decision System for Autonomous Robot Navigation Over Rough Terrain"
-, booktitle =	"Proc. SPIE Applications of Artificial Intelligence"
-, volume =	"??"
-, year =	1985
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "F. K. H. Quek and R. F. Franklin and F. Pont"
+, title =       "A Decision System for Autonomous Robot Navigation Over Rough Terrain"
+, booktitle =   "Proc. SPIE Applications of Artificial Intelligence"
+, volume =      "??"
+, year =        1985
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{q-abtps-89
-, author =	"M. J. Quinn"
-, title =	"Analysis and benchmarking of two parallel sorting algorithms: hyperquicksort and quickmerge"
-, journal =	"BIT"
-, volume =	29
-, number =	2
-, year =	1989
-, pages =	"239--250"
-, update =	"96.09 orourke"
+, author =      "M. J. Quinn"
+, title =       "Analysis and benchmarking of two parallel sorting algorithms: hyperquicksort and quickmerge"
+, journal =     "BIT"
+, volume =      29
+, number =      2
+, year =        1989
+, pages =       "239--250"
+, update =      "96.09 orourke"
 }
 
 @incollection{r-fcdmc-94
-, author =	"Rich Rabbitz"
-, title =	"Fast Collision Detection of Moving Convex Polyhedra"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"83--109"
-, keywords =	"animation, collision detection, computational geometry, polyhedron"
-, update =	"94.09 heckbert"
-, annote =	"A turn-key piece of software that solves a difficult but
+, author =      "Rich Rabbitz"
+, title =       "Fast Collision Detection of Moving Convex Polyhedra"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "83--109"
+, keywords =    "animation, collision detection, computational geometry, polyhedron"
+, update =      "94.09 heckbert"
+, annote =      "A turn-key piece of software that solves a difficult but
 basic problem in physically based animation and interactive modeling.
 Contains C code."
 }
 
 @incollection{r-pa-76
-, author =	"M. O. Rabin"
-, title =	"Probabilistic algorithms"
-, editor =	"J. F. Traub"
-, booktitle =	"Algorithms and Complexity: New Directions and Recent Results"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1976
-, pages =	"21--39"
-, update =	"98.11 bibrelex"
+, author =      "M. O. Rabin"
+, title =       "Probabilistic algorithms"
+, editor =      "J. F. Traub"
+, booktitle =   "Algorithms and Complexity: New Directions and Recent Results"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1976
+, pages =       "21--39"
+, update =      "98.11 bibrelex"
 }
 
 @article{r-paff-80
-, author =	"M. O. Rabin"
-, title =	"Probabilistic algorithms in finite fields"
-, journal =	"SIAM J. Comput."
-, volume =	9
-, number =	2
-, year =	1980
-, pages =	"273--280"
-, update =	"98.03 bibrelex"
+, author =      "M. O. Rabin"
+, title =       "Probabilistic algorithms in finite fields"
+, journal =     "SIAM J. Comput."
+, volume =      9
+, number =      2
+, year =        1980
+, pages =       "273--280"
+, update =      "98.03 bibrelex"
 }
 
 @article{r-psplf-72
-, author =	"M. O. Rabin"
-, title =	"Proving simultaneous positivity of linear forms"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	6
-, year =	1972
-, pages =	"639--650"
+, author =      "M. O. Rabin"
+, title =       "Proving simultaneous positivity of linear forms"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      6
+, year =        1972
+, pages =       "639--650"
 }
 
 @techreport{rb-nbeaj-??
-, author =	"G. Radack and N. Badler"
-, title =	"A new boundary encoding with applications to jigsaw puzzles"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Inform. Sci., Univ. Pennsylvania"
-, address =	"Philadelphia, PA"
-, year =	"??"
+, author =      "G. Radack and N. Badler"
+, title =       "A new boundary encoding with applications to jigsaw puzzles"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Inform. Sci., Univ. Pennsylvania"
+, address =     "Philadelphia, PA"
+, year =        "??"
 }
 
 @book{r-lent-64
-, author =	"H. Rademacher"
-, title =	"Lectures on Elementary Number Theory"
-, publisher =	"Blaisdell"
-, address =	"New York, NY"
-, year =	1964
-, update =	"97.11 bibrelex"
+, author =      "H. Rademacher"
+, title =       "Lectures on Elementary Number Theory"
+, publisher =   "Blaisdell"
+, address =     "New York, NY"
+, year =        1964
+, update =      "97.11 bibrelex"
 }
 
 @book{rt-em-57
-, author =	"H. Rademacher and O. Toeplitz"
-, title =	"The Enjoyment of Mathematics"
-, publisher =	"Princeton University Press"
-, address =	"Princeton, NJ"
-, year =	1957
-, update =	"98.03 bibrelex"
+, author =      "H. Rademacher and O. Toeplitz"
+, title =       "The Enjoyment of Mathematics"
+, publisher =   "Princeton University Press"
+, address =     "Princeton, NJ"
+, year =        1957
+, update =      "98.03 bibrelex"
 }
 
 @incollection{rt-scfsp-57
-, author =	"H. Rademacher and O. Toeplitz"
-, title =	"The spanning circle of a finite set of points"
-, chapter =	16
-, booktitle =	"The Enjoyment of Mathematics"
-, publisher =	"Princeton University Press"
-, year =	1957
-, update =	"98.07 bibrelex"
+, author =      "H. Rademacher and O. Toeplitz"
+, title =       "The spanning circle of a finite set of points"
+, chapter =     16
+, booktitle =   "The Enjoyment of Mathematics"
+, publisher =   "Princeton University Press"
+, year =        1957
+, update =      "98.07 bibrelex"
 }
 
 @incollection{r-ssp-88
-, author =	"J. D. Radke"
-, title =	"On the shape of a set of points"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"105--136"
+, author =      "J. D. Radke"
+, title =       "On the shape of a set of points"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "105--136"
 }
 
 @incollection{r-mpg-78
-, author =	"R. Rado"
-, title =	"Monochromatic paths in graphs"
-, editor =	"B. Bollob{\'a}s"
-, booktitle =	"Advances in Graph Theory"
-, series =	"Ann. Discrete Math."
-, volume =	3
-, publisher =	"North-Holland"
-, address =	"Amsterdam"
-, year =	1978
-, pages =	"191--194"
-, update =	"97.11 bibrelex"
+, author =      "R. Rado"
+, title =       "Monochromatic paths in graphs"
+, editor =      "B. Bollob{\'a}s"
+, booktitle =   "Advances in Graph Theory"
+, series =      "Ann. Discrete Math."
+, volume =      3
+, publisher =   "North-Holland"
+, address =     "Amsterdam"
+, year =        1978
+, pages =       "191--194"
+, update =      "97.11 bibrelex"
 }
 
 @article{r-mkkde-21
-, author =	"J. Radon"
-, title =	"Mengen konvexer {K{\"o}rper}, die einen gemeinsamen {Punkt} enthalten"
-, journal =	"Math. Ann."
-, volume =	83
-, year =	1921
-, pages =	"113--115"
-, update =	"97.11 bibrelex"
+, author =      "J. Radon"
+, title =       "Mengen konvexer {K{\"o}rper}, die einen gemeinsamen {Punkt} enthalten"
+, journal =     "Math. Ann."
+, volume =      83
+, year =        1921
+, pages =       "113--115"
+, update =      "97.11 bibrelex"
 }
 
 @article{r-bfigm-17
-, author =	"J. Radon"
-, title =	"{\"Uber} die Bestimmung von Funktionen duch ihre Integralwerte {l\"angs} gewisser Mannigfaltigkeiten"
-, journal =	"Ber. Verb. {S\"achs.} Wiss., Leipzig, Math. Phys. Kl."
-, volume =	69
-, year =	1917
-, pages =	"262--277"
-, update =	"98.11 bibrelex"
+, author =      "J. Radon"
+, title =       "{\"Uber} die Bestimmung von Funktionen duch ihre Integralwerte {l\"angs} gewisser Mannigfaltigkeiten"
+, journal =     "Ber. Verb. {S\"achs.} Wiss., Leipzig, Math. Phys. Kl."
+, volume =      69
+, year =        1917
+, pages =       "262--277"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{r-pscc-90
-, author =	"P. Ragde"
-, title =	"The Parallel Simplicity of Compaction and Chaining"
-, booktitle =	"Proc. 17th International Colloquium on Automata, Languages and Programming, LNCS 443"
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"744--751"
-, update =	"97.11 bibrelex, 96.09 orourke"
+, author =      "P. Ragde"
+, title =       "The Parallel Simplicity of Compaction and Chaining"
+, booktitle =   "Proc. 17th International Colloquium on Automata, Languages and Programming, LNCS 443"
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "744--751"
+, update =      "97.11 bibrelex, 96.09 orourke"
 }
 
 @inproceedings{r-cgipb-96
-, author =	"P. Raghavan"
-, title =	"Computational geometry impact potential: {A} business and industrial perspective"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"276--276"
-, update =	"97.03 agarwal, 96.09 mitchell"
-, annote =	"Invited Lecture by P. Raghavan"
+, author =      "P. Raghavan"
+, title =       "Computational geometry impact potential: {A} business and industrial perspective"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "276--276"
+, update =      "97.03 agarwal, 96.09 mitchell"
+, annote =      "Invited Lecture by P. Raghavan"
 }
 
 @inproceedings{r-iras
-, author =	"P. Raghavan"
-, title =	"Information Retrieval Algorithms: {A} Survey"
-, booktitle =	"Proc. 18th ACM-SIAM Sympos. Discrete Algorithms"
-, month =	jan
-, year =	1997
-, pages =	"11--18"
-, update =	"98.07 agarwal"
+, author =      "P. Raghavan"
+, title =       "Information Retrieval Algorithms: {A} Survey"
+, booktitle =   "Proc. 18th ACM-SIAM Sympos. Discrete Algorithms"
+, month =       jan
+, year =        1997
+, pages =       "11--18"
+, update =      "98.07 agarwal"
 }
 
 @techreport{r-lnra-90
-, author =	"P. Raghavan"
-, title =	"Lecture notes on randomized algorithms"
-, type =	"Research {Report}"
-, number =	"RC15340"
-, institution =	"IBM"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "P. Raghavan"
+, title =       "Lecture notes on randomized algorithms"
+, type =        "Research {Report}"
+, number =      "RC15340"
+, institution = "IBM"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{rcs-mw-81
-, author =	"V. V. Raghavan and J. Cohon and S. Sahni"
-, title =	"Manhattan wiring"
-, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
-, year =	1981
-, pages =	"1--10"
+, author =      "V. V. Raghavan and J. Cohon and S. Sahni"
+, title =       "Manhattan wiring"
+, booktitle =   "Proc. 19th Allerton Conf. Commun. Control Comput."
+, year =        1981
+, pages =       "1--10"
 }
 
 @article{ry-nmsp-77
-, author =	"V. V. Raghavan and C. T. Yu"
-, title =	"A note on a multidimensional searching problem"
-, journal =	"Inform. Process. Lett."
-, volume =	6
-, year =	1977
-, pages =	"133--135"
+, author =      "V. V. Raghavan and C. T. Yu"
+, title =       "A note on a multidimensional searching problem"
+, journal =     "Inform. Process. Lett."
+, volume =      6
+, year =        1977
+, pages =       "133--135"
 }
 
 @inproceedings{rs-ncbrv-97
-, author =	"S. Raghotama and V. Shapiro"
-, title =	"Necessary conditions for boundary representation variance"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"77--86"
-, cites =	"a-at-76, adps-pptpt-95, a-bt-79, bfhcp-gcs-93, cch-gngcb-96, ch-efbd-96, hy-t-61, hr-rmsm-96, h-gsm-89, h-sggr-93, hd-pvd-94, k-ts-93, k-mpnte-95, lm-sgch-95, m-eat-84, or-sdimp-89t, p-lat-83, r-dsmbr-96, r-mmrso-79, r-rrstm-80, r-rtsmi-84, r-cfitf-96, s-mgrsd-97, sv-wipfs-95, rs-brvps-97, s-scctf-92, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "S. Raghotama and V. Shapiro"
+, title =       "Necessary conditions for boundary representation variance"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "77--86"
+, cites =       "a-at-76, adps-pptpt-95, a-bt-79, bfhcp-gcs-93, cch-gngcb-96, ch-efbd-96, hy-t-61, hr-rmsm-96, h-gsm-89, h-sggr-93, hd-pvd-94, k-ts-93, k-mpnte-95, lm-sgch-95, m-eat-84, or-sdimp-89t, p-lat-83, r-dsmbr-96, r-mmrso-79, r-rrstm-80, r-rtsmi-84, r-cfitf-96, s-mgrsd-97, sv-wipfs-95, rs-brvps-97, s-scctf-92, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @techreport{rs-brvps-97
-, author =	"S. Raghothama and V. Shapiro"
-, title =	"Boundary representation variance in parametric solid modeling"
-, type =	"Technical {Report}"
-, number =	"SAL 1997-1"
-, institution =	"Univ. Wisconsin"
-, address =	"Madison, WI"
-, month =	jan
-, year =	1997
-, update =	"98.07 bibrelex"
+, author =      "S. Raghothama and V. Shapiro"
+, title =       "Boundary representation variance in parametric solid modeling"
+, type =        "Technical {Report}"
+, number =      "SAL 1997-1"
+, institution = "Univ. Wisconsin"
+, address =     "Madison, WI"
+, month =       jan
+, year =        1997
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{r-edt-93
-, author =	"Ingemar Ragnemalm"
-, title =	"The {Euclidean} Distance Transform"
-, type =	"Link{\"o}ping Studies in Science and Technology, Ph.{D}. Dissertation"
-, school =	"Department of Electrical Engineering, Link{\"o}ping University"
-, address =	"Sweden"
-, year =	1993
-, note =	304
-, keywords =	"doctoral thesis"
-, update =	"98.03 mitchell"
+, author =      "Ingemar Ragnemalm"
+, title =       "The {Euclidean} Distance Transform"
+, type =        "Link{\"o}ping Studies in Science and Technology, Ph.{D}. Dissertation"
+, school =      "Department of Electrical Engineering, Link{\"o}ping University"
+, address =     "Sweden"
+, year =        1993
+, note =        304
+, keywords =    "doctoral thesis"
+, update =      "98.03 mitchell"
 }
 
 @article{rnn-rgdpg-98
-, author =	"Md. Saidur Rahman and Shin-ichi Nakano and Takao Nishizeki"
-, title =	"Rectangular Grid Drawings of Plane Graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, number =	3
-, year =	1998
-, pages =	"203--220"
-, update =	"98.11 devillers+vismara"
+, author =      "Md. Saidur Rahman and Shin-ichi Nakano and Takao Nishizeki"
+, title =       "Rectangular Grid Drawings of Plane Graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, number =      3
+, year =        1998
+, pages =       "203--220"
+, update =      "98.11 devillers+vismara"
 }
 
 @inproceedings{rnn-laood-97
-, author =	"Md. Saidur Rahman and {Shin-ichi} Nakano and Takao Nishizeki"
-, title =	"A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"99--110"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Md. Saidur Rahman and {Shin-ichi} Nakano and Takao Nishizeki"
+, title =       "A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "99--110"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{rh-adll-91
-, author =	"M. H. Raibert and J. K. Hodgins"
-, title =	"Animation of dynamic legged locomotion"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1991
-, pages =	"349--358"
-, note =	"Proc. SIGGRAPH '91"
-, update =	"97.11 bibrelex"
+, author =      "M. H. Raibert and J. K. Hodgins"
+, title =       "Animation of dynamic legged locomotion"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1991
+, pages =       "349--358"
+, note =        "Proc. SIGGRAPH '91"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{r-mttp-85
-, author =	"V. T. Rajan"
-, title =	"Minimum Time Trajectory Planning"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, month =	mar
-, year =	1985
-, pages =	"759--764"
-, update =	"93.09 milone+mitchell"
+, author =      "V. T. Rajan"
+, title =       "Minimum Time Trajectory Planning"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, month =       mar
+, year =        1985
+, pages =       "759--764"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{r-odtr-91
-, author =	"V. T. Rajan"
-, title =	"Optimality of the {Delaunay} triangulation in {$R^{d}$}"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"357--363"
-, keywords =	"Delaunay triangulation"
-, precedes =	"r-odtr-94"
-, cites =	"a-vds-88, b-vdch-79, e-acg-87, es-vda-86, e-atccd-89, f-savd-87, gs-pmgsc-85, l-gtgac-72, ps-cgi-85, sh-cpp-75, s-cg-78, sntm-amgus-90, ZZZ"
-, update =	"00.03 bibrelex, 97.11 bibrelex"
+, author =      "V. T. Rajan"
+, title =       "Optimality of the {Delaunay} triangulation in {$R^{d}$}"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "357--363"
+, keywords =    "Delaunay triangulation"
+, precedes =    "r-odtr-94"
+, cites =       "a-vds-88, b-vdch-79, e-acg-87, es-vda-86, e-atccd-89, f-savd-87, gs-pmgsc-85, l-gtgac-72, ps-cgi-85, sh-cpp-75, s-cg-78, sntm-amgus-90, ZZZ"
+, update =      "00.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{r-odtr-94
-, author =	"V. T. Rajan"
-, title =	"Optimality of the {Delaunay} triangulation in {$R^d$}"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"189--202"
-, succeeds =	"r-odtr-91"
-, update =	"00.03 bibrelex"
+, author =      "V. T. Rajan"
+, title =       "Optimality of the {Delaunay} triangulation in {$R^d$}"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "189--202"
+, succeeds =    "r-odtr-91"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{rr-oprav-94
-, author =	"S. Rajasekaran and S. Ramaswami"
-, title =	"Optimal Parallel Randomized Algorithms for the {Voronoi} Diagram of Line Segments in the Plane and Related Problems"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"57--66"
-, cites =	"acgoy-pcg-88, ap-np3dc-93, acg-cdctd-89, ag-epsgp-85, c-pagp-80, cs-arscg-89, c-pms-88, cg-opapp-92, dk-ppess-87, f-savd-86, gmv-ttnct-92, g-gpmee-93, goy-cvdsl-89, hw-ensrq-87, k-eccs-79, k-osps-83, ld-gvdp-81, m-fppa1-88, oy-rmpmd-85, rs-pnrst-89, rs-oprat-92, rs-orpac-92, y-oavds-87, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "S. Rajasekaran and S. Ramaswami"
+, title =       "Optimal Parallel Randomized Algorithms for the {Voronoi} Diagram of Line Segments in the Plane and Related Problems"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "57--66"
+, cites =       "acgoy-pcg-88, ap-np3dc-93, acg-cdctd-89, ag-epsgp-85, c-pagp-80, cs-arscg-89, c-pms-88, cg-opapp-92, dk-ppess-87, f-savd-86, gmv-ttnct-92, g-gpmee-93, goy-cvdsl-89, hw-ensrq-87, k-eccs-79, k-osps-83, ld-gvdp-81, m-fppa1-88, oy-rmpmd-85, rs-pnrst-89, rs-oprat-92, rs-orpac-92, y-oavds-87, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @article{rr-ostrp-89
-, author =	"S. Rajasekaran and J. H. Reif"
-, title =	"Optimal and sublogarithmic time randomized parallel sorting algorithms"
-, journal =	"SIAM J. Comput."
-, volume =	"??"
-, year =	1989
-, pages =	"594--607"
-, update =	"97.11 bibrelex"
+, author =      "S. Rajasekaran and J. H. Reif"
+, title =       "Optimal and sublogarithmic time randomized parallel sorting algorithms"
+, journal =     "SIAM J. Comput."
+, volume =      "??"
+, year =        1989
+, pages =       "594--607"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{rs-rstpa-93
-, author =	"S. Rajasekaran and S. Sen"
-, title =	"Random Sampling Techniques and Parallel Algorithms Design"
-, editor =	"J. H. Reif"
-, booktitle =	"Synthesis of Parallel Algorithms"
-, publisher =	"Morgan Kaufmann Publishers"
-, year =	1993
-, pages =	"411--452"
-, update =	"96.09 orourke"
+, author =      "S. Rajasekaran and S. Sen"
+, title =       "Random Sampling Techniques and Parallel Algorithms Design"
+, editor =      "J. H. Reif"
+, booktitle =   "Synthesis of Parallel Algorithms"
+, publisher =   "Morgan Kaufmann Publishers"
+, year =        1993
+, pages =       "411--452"
+, update =      "96.09 orourke"
 }
 
 @techreport{rr-ptp-90
-, author =	"V. Ramachandran and J. Reif"
-, title =	"Planarity Testing in Parallel"
-, number =	"TR-90-15"
-, institution =	"Department of Computer Science, University of Texas at Austin"
-, year =	1990
-, keywords =	"graph drawing"
-, update =	"98.07 patrignani, 93.09 tamassia"
+, author =      "V. Ramachandran and J. Reif"
+, title =       "Planarity Testing in Parallel"
+, number =      "TR-90-15"
+, institution = "Department of Computer Science, University of Texas at Austin"
+, year =        1990
+, keywords =    "graph drawing"
+, update =      "98.07 patrignani, 93.09 tamassia"
 }
 
 @inproceedings{rr-opagp-89
-, author =	"V. Ramachandran and J. H. Reif"
-, title =	"An Optimal Parallel Algorithm for Graph Planarity"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"282--293"
-, keywords =	"graph drawing"
-, comments =	"Submitted to J. Comput. System Sci."
-, update =	"93.09 tamassia"
+, author =      "V. Ramachandran and J. H. Reif"
+, title =       "An Optimal Parallel Algorithm for Graph Planarity"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "282--293"
+, keywords =    "graph drawing"
+, comments =    "Submitted to J. Comput. System Sci."
+, update =      "93.09 tamassia"
 }
 
 @article{rlt-pmruh-83
-, author =	"K. Ramamohanarao and J. W. Lloyd and J. A. Thom"
-, title =	"Partial-match retrieval using hashing and descriptors"
-, journal =	"ACM Trans. Database Syst."
-, volume =	8
-, year =	1983
-, pages =	"552--576"
+, author =      "K. Ramamohanarao and J. W. Lloyd and J. A. Thom"
+, title =       "Partial-match retrieval using hashing and descriptors"
+, journal =     "ACM Trans. Database Syst."
+, volume =      8
+, year =        1983
+, pages =       "552--576"
 }
 
 @article{ri-pafqp-83
-, author =	"V. Raman and S. S. Iyengar"
-, title =	"Properties and applications of forests of quadtrees for pictorial data representation"
-, journal =	"BIT"
-, volume =	23
-, year =	1983
-, pages =	"472--486"
+, author =      "V. Raman and S. S. Iyengar"
+, title =       "Properties and applications of forests of quadtrees for pictorial data representation"
+, journal =     "BIT"
+, volume =      23
+, year =        1983
+, pages =       "472--486"
 }
 
 @inproceedings{r-nlbti-91
-, author =	"P. Ramanan"
-, title =	"A new lower bound technique and its application: tight lower bound for a polygon triangulation problem"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"281--290"
-, annote =	"$\Omega(n \log n)$ for minimum-weight triangulation of
-		 simple polygon with weighted vertices"
+, author =      "P. Ramanan"
+, title =       "A new lower bound technique and its application: tight lower bound for a polygon triangulation problem"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "281--290"
+, annote =      "$\Omega(n \log n)$ for minimum-weight triangulation of
+                 simple polygon with weighted vertices"
 }
 
 @inproceedings{ra-amprc-85
-, author =	"G. Ramanathan and V. S. Alagar"
-, title =	"Algorithmic motion planning in robotics: {Coordinated} motion of several discs amidst polygonal barriers"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1985
-, pages =	"514--522"
-, update =	"98.03 bibrelex"
+, author =      "G. Ramanathan and V. S. Alagar"
+, title =       "Algorithmic motion planning in robotics: {Coordinated} motion of several discs amidst polygonal barriers"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1985
+, pages =       "514--522"
+, update =      "98.03 bibrelex"
 }
 
 @article{rn-isbmn-87
-, author =	"R. Ramaraj and G. M. Nielson"
-, title =	"Interpolation Over a Sphere Based on a Minimum Norm Network"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	4
-, year =	1987
-, pages =	"41--57"
-, annote =	"Sphere triangulation. Switching based on max-min angle
-		 test. (Is this the same as taking the convex hull?)"
+, author =      "R. Ramaraj and G. M. Nielson"
+, title =       "Interpolation Over a Sphere Based on a Minimum Norm Network"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      4
+, year =        1987
+, pages =       "41--57"
+, annote =      "Sphere triangulation. Switching based on max-min angle
+                 test. (Is this the same as taking the convex hull?)"
 }
 
 @article{rp-fkdta-92
-, author =	"V. Ramasubramanian and K. K. Paliwal"
-, title =	"Fast $k$-dimensional tree algorithms for nearest neighbor search with applications to vector quantization encoding"
-, journal =	"IEEE Trans. Signal Processing"
-, volume =	40
-, year =	1992
-, pages =	"518--531"
-, update =	"97.07 agarwal"
+, author =      "V. Ramasubramanian and K. K. Paliwal"
+, title =       "Fast $k$-dimensional tree algorithms for nearest neighbor search with applications to vector quantization encoding"
+, journal =     "IEEE Trans. Signal Processing"
+, volume =      40
+, year =        1992
+, pages =       "518--531"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{ryp-spsff-97
-, author =	"K. Ramaswami and Y. Yamaguchi and F. B. Prinz"
-, title =	"Spatial Partitioning of Solids for Freeform Fabrication"
-, booktitle =	"Proc. 4th Sympos. Solid Modeling Found. Applications"
-, site =	"Atlanta, GA, USA"
-, month =	may
-, year =	1997
-, pages =	"346--353"
-, update =	"97.07 held"
+, author =      "K. Ramaswami and Y. Yamaguchi and F. B. Prinz"
+, title =       "Spatial Partitioning of Solids for Freeform Fabrication"
+, booktitle =   "Proc. 4th Sympos. Solid Modeling Found. Applications"
+, site =        "Atlanta, GA, USA"
+, month =       may
+, year =        1997
+, pages =       "346--353"
+, update =      "97.07 held"
 }
 
 @inproceedings{rrt-ctq-95
-, author =	"Suneeta Ramaswami and Pedro Ramos and Godfried Toussaint"
-, title =	"Converting Triangulations to Quadrangulations"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"297--302"
-, precedes =	"rrt-ctq-98"
-, update =	"98.03 mitchell, 95.09 jones"
+, author =      "Suneeta Ramaswami and Pedro Ramos and Godfried Toussaint"
+, title =       "Converting Triangulations to Quadrangulations"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "297--302"
+, precedes =    "rrt-ctq-98"
+, update =      "98.03 mitchell, 95.09 jones"
 }
 
 @article{rrt-ctq-98
-, author =	"Suneeta Ramaswami and Pedro Ramos and Godfried Toussaint"
-, title =	"Converting Triangulations to Quadrangulations"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, number =	4
-, year =	1998
-, pages =	"257--276"
-, succeeds =	"rrt-ctq-95"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Suneeta Ramaswami and Pedro Ramos and Godfried Toussaint"
+, title =       "Converting Triangulations to Quadrangulations"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, number =      4
+, year =        1998
+, pages =       "257--276"
+, succeeds =    "rrt-ctq-95"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{rs-pctoe-94
-, author =	"S. Ramaswamy and S. Subramanian"
-, title =	"Path caching: A technique for optimal external searching"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Principles Database Syst."
-, year =	1994
-, pages =	"25--35"
-, update =	"96.05 agarwal"
+, author =      "S. Ramaswamy and S. Subramanian"
+, title =       "Path caching: A technique for optimal external searching"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Principles Database Syst."
+, year =        1994
+, pages =       "25--35"
+, update =      "96.05 agarwal"
 }
 
 @article{r-ippap-
-, author =	"Urs Ramer"
-, title =	"An iterative procedure for the polygonal approximation of plane curves"
-, journal =	"Comput. Graph. Image Process."
-, volume =	1
-, pages =	"244--256"
-, update =	"93.09 milone+mitchell"
+, author =      "Urs Ramer"
+, title =       "An iterative procedure for the polygonal approximation of plane curves"
+, journal =     "Comput. Graph. Image Process."
+, volume =      1
+, pages =       "244--256"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{r-acmso-96
-, author =	"G. D. Ramkumar"
-, title =	"An Algorithm to Compute the {Minkowski} Sum Outer-Face of Two Simple Polygons"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"234--241"
-, cites =	"bgrr-pttc-, cegghss-rspug-91, cegss-cfals-93, gt-drssp-93, grs-kfcg-83, gs-ccrs-87, hcahs-csfms-95, kos-cmsrp-91i, l-spcsa-83, ZZZ"
-, update =	"98.07 bibrelex, 97.11 bibrelex, 96.05 efrat"
+, author =      "G. D. Ramkumar"
+, title =       "An Algorithm to Compute the {Minkowski} Sum Outer-Face of Two Simple Polygons"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "234--241"
+, cites =       "bgrr-pttc-, cegghss-rspug-91, cegss-cfals-93, gt-drssp-93, grs-kfcg-83, gs-ccrs-87, hcahs-csfms-95, kos-cmsrp-91i, l-spcsa-83, ZZZ"
+, update =      "98.07 bibrelex, 97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{r-c1dle-97
-, author =	"E. Ramos"
-, title =	"Construction of $1$-d lower envelopes and applications"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"57--66"
-, cites =	"a-gpia-91i, am-rsss-94, agr-cfssa-95, agr-pahdc-94, ar-cvddp-96, a-sdcgp-85, c-osrch-95, csy-oscpf-95, c-chdc-93, cegs-dwclp-93, cm-dosch-92, cm-ltdao-93, cs-arscg-89, c-sdsno-87, cgo-mftpe-90, dk-fdpi-83, e-acg-87, es-otatd-91, em-sstcd-90, gg-ptpch-91, gz-odapp-95, g-uaadp-91, g-gpmee-93, g-fdplp-96, goy-cvdsl-93, gr-bidgp-97, gs-fospc-96, hr-wmhtb-92, h-bevv-56, ks-upcha-86, k-cavd-89, m-aogdc-91, m-cha-91, m-ept-92, ms-datdd-96, ms-ufetp-91, m-apcad-83, m-cgitr-93, p-plmps-94, ps-cgi-85, rr-oprav-94, r-aierb-94, rs-oprat-92, sa-dsstg-95, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "E. Ramos"
+, title =       "Construction of $1$-d lower envelopes and applications"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "57--66"
+, cites =       "a-gpia-91i, am-rsss-94, agr-cfssa-95, agr-pahdc-94, ar-cvddp-96, a-sdcgp-85, c-osrch-95, csy-oscpf-95, c-chdc-93, cegs-dwclp-93, cm-dosch-92, cm-ltdao-93, cs-arscg-89, c-sdsno-87, cgo-mftpe-90, dk-fdpi-83, e-acg-87, es-otatd-91, em-sstcd-90, gg-ptpch-91, gz-odapp-95, g-uaadp-91, g-gpmee-93, g-fdplp-96, goy-cvdsl-93, gr-bidgp-97, gs-fospc-96, hr-wmhtb-92, h-bevv-56, ks-upcha-86, k-cavd-89, m-aogdc-91, m-cha-91, m-ept-92, ms-datdd-96, ms-ufetp-91, m-apcad-83, m-cgitr-93, p-plmps-94, ps-cgi-85, rr-oprav-94, r-aierb-94, rs-oprat-92, sa-dsstg-95, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{r-iubdp-96
-, author =	"E. Ramos"
-, title =	"Intersection of unit-balls and diameter of a point set in {$R^3$}"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"in press"
-, update =	"98.07 agarwal, 97.03 agarwal, 96.05 agarwal, 95.09 agarwal"
+, author =      "E. Ramos"
+, title =       "Intersection of unit-balls and diameter of a point set in {$R^3$}"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "in press"
+, update =      "98.07 agarwal, 97.03 agarwal, 96.05 agarwal, 95.09 agarwal"
 }
 
 @article{r-iubdp-97
-, author =	"E. Ramos"
-, title =	"Intersection of unit-balls and diameter of a point set in {$R^3$}"
-, journal =	"Computat. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"57--65"
-, update =	"98.03 agarwal"
+, author =      "E. Ramos"
+, title =       "Intersection of unit-balls and diameter of a point set in {$R^3$}"
+, journal =     "Computat. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "57--65"
+, update =      "98.03 agarwal"
 }
 
 @techreport{r-n3sfp-93
-, author =	"E. Ramos"
-, title =	"The number of $3$-sets of a finite point set in the plane"
-, type =	"Technical {Report}"
-, number =	"UIUCDCS-R-93-1843"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana-Champaign , IL"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "E. Ramos"
+, title =       "The number of $3$-sets of a finite point set in the plane"
+, type =        "Technical {Report}"
+, number =      "UIUCDCS-R-93-1843"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana-Champaign , IL"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @techreport{r-aierb-94
-, author =	"E. A. Ramos"
-, title =	"An algorithm for intersecting equal radius balls ${R^3}$"
-, type =	"Technical {Report}"
-, number =	"UIUCDCS-R-94-1851"
-, institution =	"Dept. of Computer Science, University of Illinois at Urbana-Champaign"
-, year =	1994
-, update =	"97.03 agarwal, 96.09 orourke"
+, author =      "E. A. Ramos"
+, title =       "An algorithm for intersecting equal radius balls ${R^3}$"
+, type =        "Technical {Report}"
+, number =      "UIUCDCS-R-94-1851"
+, institution = "Dept. of Computer Science, University of Illinois at Urbana-Champaign"
+, year =        1994
+, update =      "97.03 agarwal, 96.09 orourke"
 }
 
 @article{r-odacd-01
-, author =	"E. A. Ramos"
-, title =	"An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set"
-, journal =	"Discrete Comput. Geom."
-, volume =	26
-, year =	2001
-, pages =	"233--244"
-, update =	"01.11 smid"
+, author =      "E. A. Ramos"
+, title =       "An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set"
+, journal =     "Discrete Comput. Geom."
+, volume =      26
+, year =        2001
+, pages =       "233--244"
+, update =      "01.11 smid"
 }
 
 @inproceedings{r-dadsl-00
-, author =	"Edgar A. Ramos"
-, title =	"Deterministic Algorithms for {3-D} Diameter and some {2-D} Lower Envelopes"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"290--299"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Edgar A. Ramos"
+, title =       "Deterministic Algorithms for {3-D} Diameter and some {2-D} Lower Envelopes"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "290--299"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @inproceedings{r-lpqr-00
-, author =	"Edgar A. Ramos"
-, title =	"Linear Programming Queries Revisited"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"176--181"
-, update =	"00.11 smid, 00.07 agarwal"
+, author =      "Edgar A. Ramos"
+, title =       "Linear Programming Queries Revisited"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "176--181"
+, update =      "00.11 smid, 00.07 agarwal"
 }
 
 @phdthesis{r-tegc
-, author =	"P. Ramos"
-, title =	"Tolerancia de Estructuras Geom{\'e}trias y Combinatorias"
-, school =	"??"
-, note =	"in spanish, in preparation"
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "P. Ramos"
+, title =       "Tolerancia de Estructuras Geom{\'e}trias y Combinatorias"
+, school =      "??"
+, note =        "in spanish, in preparation"
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{r-crp-98
-, author =	"Pedro A. Ramos"
-, title =	"Computing Roundness in Practice"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"125--126"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Pedro A. Ramos"
+, title =       "Computing Roundness in Practice"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "125--126"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{r-cresa-99
-, author =	"Pedro A. Ramos"
-, title =	"Computing Roundness is Easy if the Set is Almost Round"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Comput. Geom."
-, year =	1999
-, pages =	"307--315"
-, update =	"99.07 devillers"
+, author =      "Pedro A. Ramos"
+, title =       "Computing Roundness is Easy if the Set is Almost Round"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Comput. Geom."
+, year =        1999
+, pages =       "307--315"
+, update =      "99.07 devillers"
 }
 
 @article{r-pfl-30
-, author =	"F. P. Ramsey"
-, title =	"On a problem of formal logic"
-, journal =	"Proc. London Math. Soc."
-, volume =	30
-, year =	1930
-, pages =	"264--286"
-, update =	"98.03 bibrelex"
+, author =      "F. P. Ramsey"
+, title =       "On a problem of formal logic"
+, journal =     "Proc. London Math. Soc."
+, volume =      30
+, year =        1930
+, pages =       "264--286"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{r-bcdas-87
-, author =	"L. Ramshaw"
-, title =	"Blossoming: {A} connected-the-dots approach to splines"
-, type =	"Technical {Report}"
-, number =	19
-, institution =	"Digital Systems Research Center"
-, address =	"Palo Alto, CA"
-, year =	1987
-, update =	"98.07 bibrelex"
+, author =      "L. Ramshaw"
+, title =       "Blossoming: {A} connected-the-dots approach to splines"
+, type =        "Technical {Report}"
+, number =      19
+, institution = "Digital Systems Research Center"
+, address =     "Palo Alto, CA"
+, year =        1987
+, update =      "98.07 bibrelex"
 }
 
 @unpublished{r-cnebf-82
-, author =	"L. Ramshaw"
-, title =	"{CSL} notebook entry: {The} braiding of floating point lines"
-, year =	1982
-, note =	"Unpublished note"
-, update =	"98.03 bibrelex"
+, author =      "L. Ramshaw"
+, title =       "{CSL} notebook entry: {The} braiding of floating point lines"
+, year =        1982
+, note =        "Unpublished note"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{rs-dgtsv-00
-, author =	"Adee Ran and Nir Sochen"
-, title =	"Differential Geometry Techniques in Stereo Vision"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"98--103"
-, update =	"00.03 bibrelex"
+, author =      "Adee Ran and Nir Sochen"
+, title =       "Differential Geometry Techniques in Stereo Vision"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "98--103"
+, update =      "00.03 bibrelex"
 }
 
 @article{r-hesm-91
-, author =	"A. G. Ranade"
-, title =	"How to emulate shared memory"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	42
-, year =	1991
-, pages =	"307--326"
-, update =	"96.09 orourke"
+, author =      "A. G. Ranade"
+, title =       "How to emulate shared memory"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      42
+, year =        1991
+, pages =       "307--326"
+, update =      "96.09 orourke"
 }
 
 @techreport{rrp-uqis-80
-, author =	"S. Ranade and A. Rosenfeld and J. M. S. Prewitt"
-, title =	"Use of quadtrees for image segmentation"
-, type =	"Report"
-, number =	"TR-878"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1980
+, author =      "S. Ranade and A. Rosenfeld and J. M. S. Prewitt"
+, title =       "Use of quadtrees for image segmentation"
+, type =        "Report"
+, number =      "TR-878"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1980
 }
 
 @techreport{rrs-sauq-79
-, author =	"S. Ranade and A. Rosenfeld and H. Samet"
-, title =	"Shape approximation using quadtrees"
-, type =	"Report"
-, number =	"TR-847"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1979
+, author =      "S. Ranade and A. Rosenfeld and H. Samet"
+, title =       "Shape approximation using quadtrees"
+, type =        "Report"
+, number =      "TR-847"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1979
 }
 
 @article{rrs-sauq-82
-, author =	"S. Ranade and A. Rosenfeld and H. Samet"
-, title =	"Shape approximation using quadtrees"
-, journal =	"Pattern Recogn."
-, volume =	15
-, number =	1
-, year =	1982
-, pages =	"31--40"
-, update =	"96.05 efrat"
+, author =      "S. Ranade and A. Rosenfeld and H. Samet"
+, title =       "Shape approximation using quadtrees"
+, journal =     "Pattern Recogn."
+, volume =      15
+, number =      1
+, year =        1982
+, pages =       "31--40"
+, update =      "96.05 efrat"
 }
 
 @article{rs-uqsi-81
-, author =	"S. Ranade and M. Shneier"
-, title =	"Using quadtrees for smooth images"
-, journal =	"Pattern Recogn."
-, volume =	15
-, year =	1981
-, pages =	"31--40"
+, author =      "S. Ranade and M. Shneier"
+, title =       "Using quadtrees for smooth images"
+, journal =     "Pattern Recogn."
+, volume =      15
+, year =        1981
+, pages =       "31--40"
 }
 
 @book{r-cag-61
-, author =	"J. F. Randolph"
-, title =	"Calculus and Analytic Geometry"
-, publisher =	"Wadsworth"
-, year =	1961
-, update =	"98.03 bibrelex"
+, author =      "J. F. Randolph"
+, title =       "Calculus and Analytic Geometry"
+, publisher =   "Wadsworth"
+, year =        1961
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{rsb-ocd-88
-, author =	"K. Rangarajan and M. Shah and D. V. Brackle"
-, title =	"Optimal corner detector"
-, booktitle =	"Proc. 2nd Int. Conf. Comput. Visison"
-, year =	1988
-, pages =	"90--94"
-, update =	"98.11 bibrelex"
+, author =      "K. Rangarajan and M. Shah and D. V. Brackle"
+, title =       "Optimal corner detector"
+, booktitle =   "Proc. 2nd Int. Conf. Comput. Visison"
+, year =        1988
+, pages =       "90--94"
+, update =      "98.11 bibrelex"
 }
 
 @article{rf-cusmm-96
-, author =	"V. Ranjan and A. Fournier"
-, title =	"Creating Union of Spheres Models from Multiple Views"
-, journal =	"J. Graphics Tools"
-, volume =	1
-, number =	4
-, year =	1996
-, pages =	"21--39"
-, update =	"97.11 held"
+, author =      "V. Ranjan and A. Fournier"
+, title =       "Creating Union of Spheres Models from Multiple Views"
+, journal =     "J. Graphics Tools"
+, volume =      1
+, number =      4
+, year =        1996
+, pages =       "21--39"
+, update =      "97.11 held"
 }
 
 @inproceedings{rf-usumv-95
-, author =	"Vishwa Ranjan and Alain Fournier"
-, title =	"Union of Spheres (UoS) Model for Volumetric Data"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C2--C3"
-, keywords =	""
-, cites =	"a-pdpaa-87, e-ubids-93, em-tdas-94, rf-vmvd-94, w-sedbe-91, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Vishwa Ranjan and Alain Fournier"
+, title =       "Union of Spheres (UoS) Model for Volumetric Data"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C2--C3"
+, keywords =    ""
+, cites =       "a-pdpaa-87, e-ubids-93, em-tdas-94, rf-vmvd-94, w-sedbe-91, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{rf-vmvd-94
-, author =	"V. Ranjan and A. Fournier"
-, title =	"Volume models for volumetric data"
-, journal =	"IEEE Computer"
-, volume =	27
-, number =	7
-, month =	jul
-, year =	1994
-, pages =	"28--36"
-, update =	"98.03 bibrelex"
+, author =      "V. Ranjan and A. Fournier"
+, title =       "Volume models for volumetric data"
+, journal =     "IEEE Computer"
+, volume =      27
+, number =      7
+, month =       jul
+, year =        1994
+, pages =       "28--36"
+, update =      "98.03 bibrelex"
 }
 
 @article{r-cpscn-55
-, author =	"R. A. Rankin"
-, title =	"The closest packing of spherical caps in $n$ dimensions"
-, journal =	"Proc. Glasgow Math. Assoc."
-, volume =	2
-, year =	1955
-, pages =	"139--144"
-, update =	"97.11 bibrelex"
+, author =      "R. A. Rankin"
+, title =       "The closest packing of spherical caps in $n$ dimensions"
+, journal =     "Proc. Glasgow Math. Assoc."
+, volume =      2
+, year =        1955
+, pages =       "139--144"
+, update =      "97.11 bibrelex"
 }
 
 @article{rg-prm-94
-, author =	"Anil Rao and Ken Goldberg"
-, title =	"Placing Registration Marks"
-, journal =	"IEEE Transactions on Industrial Electronics"
-, volume =	41
-, month =	feb
-, year =	1994
-, update =	"98.03 agarwal"
+, author =      "Anil Rao and Ken Goldberg"
+, title =       "Placing Registration Marks"
+, journal =     "IEEE Transactions on Industrial Electronics"
+, volume =      41
+, month =       feb
+, year =        1994
+, update =      "98.03 agarwal"
 }
 
 @techreport{rg-rspid-91
-, author =	"A. Rao and K. Y. Goldberg"
-, title =	"Recovering the shape of a polygon from its diameter"
-, type =	"Technical {Report}"
-, institution =	"Inst. Robot. Intell. Syst., Univ. Southern California"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "A. Rao and K. Y. Goldberg"
+, title =       "Recovering the shape of a polygon from its diameter"
+, type =        "Technical {Report}"
+, institution = "Inst. Robot. Intell. Syst., Univ. Southern California"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @techreport{rkg-carpp-94
-, author =	"A. Rao and D. Kriegman and K. Goldberg"
-, title =	"Complete algorithms for reorienting polyhedral parts using a pivoting gripper"
-, type =	"Technical {Report}"
-, number =	"UU-CS-1994-49"
-, institution =	"Utrecht university"
-, address =	"Utrecht, Netherlands"
-, year =	1994
-, url =	"ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-49.ps.gz"
-, update =	"98.03 bibrelex"
+, author =      "A. Rao and D. Kriegman and K. Goldberg"
+, title =       "Complete algorithms for reorienting polyhedral parts using a pivoting gripper"
+, type =        "Technical {Report}"
+, number =      "UU-CS-1994-49"
+, institution = "Utrecht university"
+, address =     "Utrecht, Netherlands"
+, year =        1994
+, url = "ftp://ftp.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-49.ps.gz"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{rkg-carpp-95
-, author =	"Anil Rao and David Kriegman and Ken Goldberg"
-, title =	"Complete Algorithms for Reorienting Polyhedral Parts Using a Pivoting Gripper"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C22--C23"
-, keywords =	""
-, cites =	"cgrw-pgfip-94, h-fuenl-89, k-cspps-92, rkg-carpp-94, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Anil Rao and David Kriegman and Ken Goldberg"
+, title =       "Complete Algorithms for Reorienting Polyhedral Parts Using a Pivoting Gripper"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C22--C23"
+, keywords =    ""
+, cites =       "cgrw-pgfip-94, h-fuenl-89, k-cspps-92, rkg-carpp-94, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{rg-cgf-96
-, author =	"A. S. Rao and K. Y. Goldberg"
-, title =	"Computing grasp functions"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"145--168"
-, update =	"96.09 devillers"
+, author =      "A. S. Rao and K. Y. Goldberg"
+, title =       "Computing grasp functions"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "145--168"
+, update =      "96.09 devillers"
 }
 
 @article{rg-mapp-95
-, author =	"A. S. Rao and K. Y. Goldberg"
-, title =	"Manipulating Algebraic Parts in the Plane"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	11
-, number =	4
-, month =	aug
-, year =	1995
-, pages =	"598--602"
-, update =	"96.01 held"
+, author =      "A. S. Rao and K. Y. Goldberg"
+, title =       "Manipulating Algebraic Parts in the Plane"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      11
+, number =      4
+, month =       aug
+, year =        1995
+, pages =       "598--602"
+, update =      "96.01 held"
 }
 
 @inproceedings{rg-rpsid-92
-, author =	"A. S. Rao and K. Y. Goldberg"
-, title =	"On the recovery of a polygon's shapes from its diameter function"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"210--215"
-, cites =	"cy-sp-87, d-argon-92, g-sprm-90, g-oppws-93, ic-copop-91, j-atag-85, kg-srrg-92, k-oeupj-88, l-rpp-88, pr-popp-92, ps-cgi-85, rg-sdrpp-94, rg-sdrps-91, rg-ogp-92, r-cscsl-87, s-pgp-89, yb-cf-61, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "A. S. Rao and K. Y. Goldberg"
+, title =       "On the recovery of a polygon's shapes from its diameter function"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "210--215"
+, cites =       "cy-sp-87, d-argon-92, g-sprm-90, g-oppws-93, ic-copop-91, j-atag-85, kg-srrg-92, k-oeupj-88, l-rpp-88, pr-popp-92, ps-cgi-85, rg-sdrpp-94, rg-sdrps-91, rg-ogp-92, r-cscsl-87, s-pgp-89, yb-cf-61, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{rg-ogp-92
-, author =	"A. S. Rao and K. Y. Goldberg"
-, title =	"Orienting generalized polygons"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Nice, France"
-, month =	may
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "A. S. Rao and K. Y. Goldberg"
+, title =       "Orienting generalized polygons"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Nice, France"
+, month =       may
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @techreport{rg-sdrps-91
-, author =	"A. S. Rao and K. Y. Goldberg"
-, title =	"Shape from diameter: on the recovery of a polygon's shape from its diameter function"
-, type =	"Technical {Report}"
-, number =	270
-, institution =	"Inst. Robot. Intell. Syst., Univ. Southern California"
-, address =	"Los Angeles, CA"
-, month =	aug
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "A. S. Rao and K. Y. Goldberg"
+, title =       "Shape from diameter: on the recovery of a polygon's shape from its diameter function"
+, type =        "Technical {Report}"
+, number =      270
+, institution = "Inst. Robot. Intell. Syst., Univ. Southern California"
+, address =     "Los Angeles, CA"
+, month =       aug
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @article{rg-sdrpp-94
-, author =	"A. S. Rao and K. Y. Goldberg"
-, title =	"Shape from Diameter: Recognizing Polygonal Parts with a Parallel-Jaw Gripper"
-, journal =	"IRob"
-, volume =	13
-, number =	1
-, year =	1994
-, pages =	"16--37"
-, update =	"95.01 held"
+, author =      "A. S. Rao and K. Y. Goldberg"
+, title =       "Shape from Diameter: Recognizing Polygonal Parts with a Parallel-Jaw Gripper"
+, journal =     "IRob"
+, volume =      13
+, number =      1
+, year =        1994
+, pages =       "16--37"
+, update =      "95.01 held"
 }
 
 @book{r-pta-84
-, author =	"M. M. Rao"
-, title =	"Probability Theory with Applications"
-, publisher =	"Academic Press"
-, address =	"Orlando, FL"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "M. M. Rao"
+, title =       "Probability Theory with Applications"
+, publisher =   "Academic Press"
+, address =     "Orlando, FL"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @article{r-aflrv-89
-, author =	"N. S. V. Rao"
-, title =	"Algorithmic Framework for Learned Robot Navigation in Unknown Terrain"
-, journal =	"IEEE Computer"
-, volume =	22
-, year =	1989
-, pages =	"37--43"
-, keywords =	"on-line motion planning"
-, update =	"98.03 mitchell"
+, author =      "N. S. V. Rao"
+, title =       "Algorithmic Framework for Learned Robot Navigation in Unknown Terrain"
+, journal =     "IEEE Computer"
+, volume =      22
+, year =        1989
+, pages =       "37--43"
+, keywords =    "on-line motion planning"
+, update =      "98.03 mitchell"
 }
 
 @techreport{rijw-cgaar-85
-, author =	"N. S. V. Rao and S. S. Iyengar and C. C. Jorgensen and C. R. Weisbin"
-, title =	"Computational geometry approach to autonomous robot navigation in an unexplored terrain"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Louisiana State Univ. Baton Rouge"
-, address =	"Baton Rouge, LA"
-, year =	1985
+, author =      "N. S. V. Rao and S. S. Iyengar and C. C. Jorgensen and C. R. Weisbin"
+, title =       "Computational geometry approach to autonomous robot navigation in an unexplored terrain"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Louisiana State Univ. Baton Rouge"
+, address =     "Baton Rouge, LA"
+, year =        1985
 }
 
 @inproceedings{rijw-tafsm-87
-, author =	"N. S. V. Rao and S. S. Iyengar and C. C. Jorgensen and C. R. Weisbin"
-, title =	"On Terrain Acquisition by a Finite-Sized Mobile Robot in Plane"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Raleigh, NC"
-, year =	1987
-, pages =	"1314--1319"
-, update =	"93.09 milone+mitchell"
+, author =      "N. S. V. Rao and S. S. Iyengar and C. C. Jorgensen and C. R. Weisbin"
+, title =       "On Terrain Acquisition by a Finite-Sized Mobile Robot in Plane"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Raleigh, NC"
+, year =        1987
+, pages =       "1314--1319"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{rijw-rnut-86
-, author =	"N. S. V. Rao and S. S. Iyengar and C. C. Jorgensen and C. R. Weisbin"
-, title =	"Robot Navigation in an Unexplored Terrain"
-, journal =	"Journal of Robotic Systems"
-, volume =	3
-, number =	4
-, year =	1986
-, pages =	"389--407"
+, author =      "N. S. V. Rao and S. S. Iyengar and C. C. Jorgensen and C. R. Weisbin"
+, title =       "Robot Navigation in an Unexplored Terrain"
+, journal =     "Journal of Robotic Systems"
+, volume =      3
+, number =      4
+, year =        1986
+, pages =       "389--407"
 }
 
 @article{riok-tmapr-88
-, author =	"N. S. V. Rao and S. S. Iyengar and B. J. Oommen and R. L. Kashyap"
-, title =	"On Terrain Model Acquisition by a Point Robot Amidst Polyhedral Obstacles"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	4
-, number =	4
-, year =	1988
-, pages =	"450--455"
+, author =      "N. S. V. Rao and S. S. Iyengar and B. J. Oommen and R. L. Kashyap"
+, title =       "On Terrain Model Acquisition by a Point Robot Amidst Polyhedral Obstacles"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      4
+, number =      4
+, year =        1988
+, pages =       "450--455"
 }
 
 @techreport{rksi-rnut-93
-, author =	"N. S. V. Rao and S. Kareti and W. Shi and S. S. Iyengar"
-, title =	"Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms"
-, number =	"ORNL/TM-12410"
-, institution =	"Oak Ridge National Laboratory"
-, year =	1993
-, update =	"98.03 icking"
+, author =      "N. S. V. Rao and S. Kareti and W. Shi and S. S. Iyengar"
+, title =       "Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms"
+, number =      "ORNL/TM-12410"
+, institution = "Oak Ridge National Laboratory"
+, year =        1993
+, update =      "98.03 icking"
 }
 
 @techreport{rsi-rmlnu-88
-, author =	"N. S. V. Rao and N. Stoltzfus and S. S. Iyengar"
-, title =	"A ``Retraction'' Method for Learned Navigation in Unknown Terrains for a Circular Robot"
-, type =	"Technical {Report}"
-, institution =	"Computer Science, Old dominion Univ."
-, year =	1988
-, update =	"93.09 milone+mitchell"
+, author =      "N. S. V. Rao and N. Stoltzfus and S. S. Iyengar"
+, title =       "A ``Retraction'' Method for Learned Navigation in Unknown Terrains for a Circular Robot"
+, type =        "Technical {Report}"
+, institution = "Computer Science, Old dominion Univ."
+, year =        1988
+, update =      "93.09 milone+mitchell"
 }
 
 @article{rvi-dds-88
-, author =	"N. S. V. Rao and V. K. Vaishnavi and S. S. Iyengar"
-, title =	"On the dynamization of data structures"
-, journal =	"BIT"
-, volume =	28
-, year =	1988
-, pages =	"37--53"
+, author =      "N. S. V. Rao and V. K. Vaishnavi and S. S. Iyengar"
+, title =       "On the dynamization of data structures"
+, journal =     "BIT"
+, volume =      28
+, year =        1988
+, pages =       "37--53"
 }
 
 @inproceedings{rs-aggsb-98
-, author =	"Satish B. Rao and Warren D. Smith"
-, title =	"Approximating geometrical graphs via ``spanners'' and ``banyans''"
-, booktitle =	"Proc. 30th Annu. ACM Sympos. Theory Comput."
-, year =	1998
-, pages =	"540--550"
-, keywords =	"Polynomial time approximation schemes, optimal algorithms, derandomization, Traveling salesman tour, Steiner minimum tree, Minimum spanning tree, Minimum matchings, 2-matchings, Edge cover, Rectilinear Steiner minimum tree, quadtrees, spanners, banyans."
-, update =	"00.11 smid, 00.07 smid, 98.03 mitchell"
-, abstract =	"
+, author =      "Satish B. Rao and Warren D. Smith"
+, title =       "Approximating geometrical graphs via ``spanners'' and ``banyans''"
+, booktitle =   "Proc. 30th Annu. ACM Sympos. Theory Comput."
+, year =        1998
+, pages =       "540--550"
+, keywords =    "Polynomial time approximation schemes, optimal algorithms, derandomization, Traveling salesman tour, Steiner minimum tree, Minimum spanning tree, Minimum matchings, 2-matchings, Edge cover, Rectilinear Steiner minimum tree, quadtrees, spanners, banyans."
+, update =      "00.11 smid, 00.07 smid, 98.03 mitchell"
+, abstract =    "
 We give deterministic and randomized algorithms to find a Euclidean
 traveling salesman tour (TST) of length within $(1+1/s)$ times
 optimal. They run in $O(N \log N)$ time and $O(N)$ space for constant
@@ -120413,4428 +120413,4428 @@ @inproceedings{rs-aggsb-98
 }
 
 @inproceedings{rm-eacbs-97
-, author =	"S. V. Rao and A. Mukhopadhyay"
-, title =	"An Efficient Algorithm for Computing $\beta$-Skeleton and its Generalization"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"7--9"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "S. V. Rao and A. Mukhopadhyay"
+, title =       "An Efficient Algorithm for Computing $\beta$-Skeleton and its Generalization"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "7--9"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{r-dsmbr-96
-, author =	"A. Rappaport"
-, title =	"Displayable-selectable models and boundary representations in geometric operation graphs"
-, booktitle =	"Theory and Practice of Geometric Modeling"
-, site =	"T{\"u}bingen, Germany"
-, month =	oct
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "A. Rappaport"
+, title =       "Displayable-selectable models and boundary representations in geometric operation graphs"
+, booktitle =   "Theory and Practice of Geometric Modeling"
+, site =        "T{\"u}bingen, Germany"
+, month =       oct
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @article{r-chada-92
-, author =	"D. Rappaport"
-, title =	"A convex hull algorithm for discs, and applications"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, number =	3
-, year =	1992
-, pages =	"171--181"
-, keywords =	"disc, convex hull, Voronoi diagram, transversals, minimum spanning circle"
+, author =      "D. Rappaport"
+, title =       "A convex hull algorithm for discs, and applications"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, number =      3
+, year =        1992
+, pages =       "171--181"
+, keywords =    "disc, convex hull, Voronoi diagram, transversals, minimum spanning circle"
 }
 
 @article{r-laehl-86
-, author =	"D. Rappaport"
-, title =	"A linear algorithm for eliminating hidden lines from a polygonal cylinder"
-, journal =	"Visual Comput."
-, volume =	2
-, year =	1986
-, pages =	"44--53"
-, keywords =	"design of algorithms, computer graphics, visibility, hidden line/surface elimination, worst-case analysis, three-dimensional"
+, author =      "D. Rappaport"
+, title =       "A linear algorithm for eliminating hidden lines from a polygonal cylinder"
+, journal =     "Visual Comput."
+, volume =      2
+, year =        1986
+, pages =       "44--53"
+, keywords =    "design of algorithms, computer graphics, visibility, hidden line/surface elimination, worst-case analysis, three-dimensional"
 }
 
 @techreport{r-cscsl-86
-, author =	"D. Rappaport"
-, title =	"Computing simple circuits from a set of line segments is {NP}-complete"
-, number =	"SOCS-86.6"
-, institution =	"McGill University"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "D. Rappaport"
+, title =       "Computing simple circuits from a set of line segments is {NP}-complete"
+, number =      "SOCS-86.6"
+, institution = "McGill University"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{r-cscsl-87
-, author =	"D. Rappaport"
-, title =	"Computing simple circuits from a set of line segments is {NP}-complete"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"322--330"
-, keywords =	"complexity theory, visibility, NP-completeness, polygons, polygonal chains, geometric graphs, traveling salesman tours, line segments"
-, cites =	"gjt-phcpn-76, ips-hpgg-82, llrs-tsp-85, m-vcihr-82, o-uocd-86, obw-cdnh-84, r-ccops-86, r-ccscp-86, rit-cscsl-86, rt-rplbo-86, t-prgc-80, t-cgm-86, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "D. Rappaport"
+, title =       "Computing simple circuits from a set of line segments is {NP}-complete"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "322--330"
+, keywords =    "complexity theory, visibility, NP-completeness, polygons, polygonal chains, geometric graphs, traveling salesman tours, line segments"
+, cites =       "gjt-phcpn-76, ips-hpgg-82, llrs-tsp-85, m-vcihr-82, o-uocd-86, obw-cdnh-84, r-ccops-86, r-ccscp-86, rit-cscsl-86, rt-rplbo-86, t-prgc-80, t-cgm-86, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{r-cfsvd-89
-, author =	"D. Rappaport"
-, title =	"Computing the furthest-site {Voronoi} diagram for a set of discs"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"57--66"
+, author =      "D. Rappaport"
+, title =       "Computing the furthest-site {Voronoi} diagram for a set of discs"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "57--66"
 }
 
 @techreport{r-mptls-92
-, author =	"D. Rappaport"
-, title =	"Minimum Polygon Transversals of Line segments"
-, number =	"CISC-92-333"
-, institution =	"Queen's University"
-, year =	1992
-, precedes =	"r-mptls-95"
-, update =	"98.11 bibrelex"
+, author =      "D. Rappaport"
+, title =       "Minimum Polygon Transversals of Line segments"
+, number =      "CISC-92-333"
+, institution = "Queen's University"
+, year =        1992
+, precedes =    "r-mptls-95"
+, update =      "98.11 bibrelex"
 }
 
 @article{r-mptls-95
-, author =	"D. Rappaport"
-, title =	"Minimum polygon transversals of line segments"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	5
-, year =	1995
-, pages =	"243--256"
-, keywords =	"computational geometry, transversal, simple polygon, convex hull"
-, succeeds =	"r-mptls-92"
-, update =	"98.11 bibrelex, 96.09 devillers"
+, author =      "D. Rappaport"
+, title =       "Minimum polygon transversals of line segments"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      5
+, year =        1995
+, pages =       "243--256"
+, keywords =    "computational geometry, transversal, simple polygon, convex hull"
+, succeeds =    "r-mptls-92"
+, update =      "98.11 bibrelex, 96.09 devillers"
 }
 
 @techreport{r-ccops-86
-, author =	"D. Rappaport"
-, title =	"On the complexity of computing orthogonal polygons from a set of points"
-, type =	"Technical {Report}"
-, number =	"TR-SOCS-86.9"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "D. Rappaport"
+, title =       "On the complexity of computing orthogonal polygons from a set of points"
+, type =        "Technical {Report}"
+, number =      "TR-SOCS-86.9"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @proceedings{r-p9ccc-97
-, title =	"Proc. 9th Canad. Conf. Comput. Geom."
-, editor =	"David Rappaport"
-, publisher =	"Dept. Comput. Info. Sci., Queen's Univ."
-, address =	"Kingston, ON"
-, month =	aug
-, year =	1997
-, url =	"http://www.qucis.queensu.ca/cccg97"
-, comments =	"electronic proceedings online; paper copies C\$20 plus postage, order form on website"
-, update =	"97.11 jones"
+, title =       "Proc. 9th Canad. Conf. Comput. Geom."
+, editor =      "David Rappaport"
+, publisher =   "Dept. Comput. Info. Sci., Queen's Univ."
+, address =     "Kingston, ON"
+, month =       aug
+, year =        1997
+, url = "http://www.qucis.queensu.ca/cccg97"
+, comments =    "electronic proceedings online; paper copies C\$20 plus postage, order form on website"
+, update =      "97.11 jones"
 }
 
 @phdthesis{r-ccscp-86
-, author =	"D. Rappaport"
-, title =	"The complexity of computing simple circuits in the plane"
-, type =	"Ph.{D}. Thesis"
-, school =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1986
-, keywords =	"complexity theory, design of algorithms, operations research, worst-case analysis, NP-completeness, points, line segments, polygons, polygonal chains, doctoral thesis"
+, author =      "D. Rappaport"
+, title =       "The complexity of computing simple circuits in the plane"
+, type =        "Ph.{D}. Thesis"
+, school =      "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1986
+, keywords =    "complexity theory, design of algorithms, operations research, worst-case analysis, NP-completeness, points, line segments, polygons, polygonal chains, doctoral thesis"
 }
 
 @article{rit-cscsl-90
-, author =	"D. Rappaport and H. Imai and G. T. Toussaint"
-, title =	"Computing simple circuits from a set of line segments"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, number =	3
-, year =	1990
-, pages =	"289--304"
-, succeeds =	"rit-cscsl-86"
-, update =	"98.11 bibrelex"
+, author =      "D. Rappaport and H. Imai and G. T. Toussaint"
+, title =       "Computing simple circuits from a set of line segments"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, number =      3
+, year =        1990
+, pages =       "289--304"
+, succeeds =    "rit-cscsl-86"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{rit-cscsl-86
-, author =	"D. Rappaport and H. Imai and G. T. Toussaint"
-, title =	"On computing simple circuits on a set of line segments"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"52--60"
-, precedes =	"rit-cscsl-90"
-, cites =	"bo-arcgi-79, g-eadch-72, hk-nammb-73, r-cscsl-86, sh-gip-76, t-hnchf-85, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. Rappaport and H. Imai and G. T. Toussaint"
+, title =       "On computing simple circuits on a set of line segments"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "52--60"
+, precedes =    "rit-cscsl-90"
+, cites =       "bo-arcgi-79, g-eadch-72, hk-nammb-73, r-cscsl-86, sh-gip-76, t-hnchf-85, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{rr-mcp-94
-, author =	"D. Rappaport and A. Rosenbloom"
-, title =	"Moldable and castable polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"219--233"
-, succeeds =	"rr-mcp-92"
-, update =	"96.09 devillers"
+, author =      "D. Rappaport and A. Rosenbloom"
+, title =       "Moldable and castable polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "219--233"
+, succeeds =    "rr-mcp-92"
+, update =      "96.09 devillers"
 }
 
 @techreport{rt-slhla-83
-, author =	"D. Rappaport and G. T. Toussaint"
-, title =	"A Simple Linear Hidden-Line Algorithm for Star-Shaped Polygones"
-, type =	"Technical {Report}"
-, number =	"SOCS-83.23"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "D. Rappaport and G. T. Toussaint"
+, title =       "A Simple Linear Hidden-Line Algorithm for Star-Shaped Polygones"
+, type =        "Technical {Report}"
+, number =      "SOCS-83.23"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{rt-slhla-85
-, author =	"D. Rappaport and G. T. Toussaint"
-, title =	"A simple linear hidden-line algorithm for star-shaped polygons"
-, journal =	"Pattern Recogn. Lett."
-, volume =	3
-, year =	1985
-, pages =	"35--39"
-, keywords =	"design of algorithms, visibility, star-shaped"
+, author =      "D. Rappaport and G. T. Toussaint"
+, title =       "A simple linear hidden-line algorithm for star-shaped polygons"
+, journal =     "Pattern Recogn. Lett."
+, volume =      3
+, year =        1985
+, pages =       "35--39"
+, keywords =    "design of algorithms, visibility, star-shaped"
 }
 
 @article{r-eaccd-92
-, author =	"A. Rappoport"
-, title =	"An Efficient Algorithm for Constructing the Convex Differences Tree of a Simple Polygon"
-, journal =	"Comput. Graph. Forum"
-, volume =	11
-, number =	4
-, month =	oct
-, year =	1992
-, pages =	"235--240"
-, update =	"93.09 held"
+, author =      "A. Rappoport"
+, title =       "An Efficient Algorithm for Constructing the Convex Differences Tree of a Simple Polygon"
+, journal =     "Comput. Graph. Forum"
+, volume =      11
+, number =      4
+, month =       oct
+, year =        1992
+, pages =       "235--240"
+, update =      "93.09 held"
 }
 
 @article{r-ealpc-91
-, author =	"A. Rappoport"
-, title =	"An Efficient Algorithm for Line and Polygon Clipping"
-, journal =	"Visual Comput."
-, volume =	7
-, number =	1
-, month =	jan
-, year =	1991
-, pages =	"19--28"
-, update =	"93.09 held"
+, author =      "A. Rappoport"
+, title =       "An Efficient Algorithm for Line and Polygon Clipping"
+, journal =     "Visual Comput."
+, volume =      7
+, number =      1
+, month =       jan
+, year =        1991
+, pages =       "19--28"
+, update =      "93.09 held"
 }
 
 @article{r-ecdte-91
-, author =	"A. Rappoport"
-, title =	"The extended convex difference tree ({ECDT}) representation for {$N$}-dimensional polyhedra"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	3
-, year =	1991
-, pages =	"227--241"
-, keywords =	"$n$-dimensional polyhedra, constructive solid geometry, CSG, convexity, boolean operations, geometric data structures, convex difference tree, CDT"
+, author =      "A. Rappoport"
+, title =       "The extended convex difference tree ({ECDT}) representation for {$N$}-dimensional polyhedra"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      3
+, year =        1991
+, pages =       "227--241"
+, keywords =    "$n$-dimensional polyhedra, constructive solid geometry, CSG, convexity, boolean operations, geometric data structures, convex difference tree, CDT"
 }
 
 @inproceedings{r-ucdhr-90
-, author =	"Ari Rappoport"
-, title =	"Using Convex Differences for Hierarchical Representations of Polygonal Maps"
-, booktitle =	"Proc. Graphics Interface'90"
-, site =	"Halifax, Canada"
-, month =	may
-, year =	1990
-, pages =	"183--189"
-, update =	"98.03 mitchell"
+, author =      "Ari Rappoport"
+, title =       "Using Convex Differences for Hierarchical Representations of Polygonal Maps"
+, booktitle =   "Proc. Graphics Interface'90"
+, site =        "Halifax, Canada"
+, month =       may
+, year =        1990
+, pages =       "183--189"
+, update =      "98.03 mitchell"
 }
 
 @incollection{rfnw-3ddpm-93
-, author =	"Norel Raquel and Daniel Fischer and Ruth Nussinov and Haim J. Wolfson"
-, title =	"3-D Docking of Protein Molecules"
-, booktitle =	"Combinatorial Pattern Matching"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	"??"
-, institution =	"Tel Aviv University"
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Norel Raquel and Daniel Fischer and Ruth Nussinov and Haim J. Wolfson"
+, title =       "3-D Docking of Protein Molecules"
+, booktitle =   "Combinatorial Pattern Matching"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      "??"
+, institution = "Tel Aviv University"
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{r-gapzc-??
-, author =	"R. Rasala"
-, title =	"Geometric aspects of the polaroid {Zip} {Code} based mapping system"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
+, author =      "R. Rasala"
+, title =       "Geometric aspects of the polaroid {Zip} {Code} based mapping system"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
 }
 
 @phdthesis{r-aiv-94
-, author =	"R. Rasch"
-, title =	"Abstrakte inverse {Voronoidiagramme}"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"95.01 smid"
+, author =      "R. Rasch"
+, title =       "Abstrakte inverse {Voronoidiagramme}"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "95.01 smid"
 }
 
 @book{r-ra-85
-, author =	"?? Rathmill"
-, title =	"Robotics Assembly"
-, publisher =	"Springer-Verlag"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "?? Rathmill"
+, title =       "Robotics Assembly"
+, publisher =   "Springer-Verlag"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @unpublished{rr-dess-95
-, author =	"H. Ratschek and J. Rokne"
-, title =	"Determination of the exact sign of a sum"
-, address =	"Dept. of Computer Science, Univ. of Calgary, Canada"
-, year =	1995
-, note =	"Unpublished manuscript"
-, update =	"00.11 smid, 00.07 smid, 96.05 devillers"
+, author =      "H. Ratschek and J. Rokne"
+, title =       "Determination of the exact sign of a sum"
+, address =     "Dept. of Computer Science, Univ. of Calgary, Canada"
+, year =        1995
+, note =        "Unpublished manuscript"
+, update =      "00.11 smid, 00.07 smid, 96.05 devillers"
 }
 
 @article{rr-eochd-00
-, author =	"H. Ratschek and J. Rokne"
-, title =	"Exact and optimal convex hulls in 2{D}"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	10
-, year =	2000
-, pages =	"109--129"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "H. Ratschek and J. Rokne"
+, title =       "Exact and optimal convex hulls in 2{D}"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      10
+, year =        2000
+, pages =       "109--129"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @article{rpib-cppcs1-80
-, author =	"V. G. Rau and L. G. Parkomov and V. V. Ilyukhin and N. V. Belov"
-, title =	"On the calculation of possible {Patterson} cyclotomic sets, I"
-, journal =	"Doklady Akad. Nauk SSSR"
-, volume =	255
-, number =	4
-, year =	1980
-, pages =	"858--861"
-, precedes =	"rpib-cppcs2-80"
-, update =	"97.11 bibrelex"
+, author =      "V. G. Rau and L. G. Parkomov and V. V. Ilyukhin and N. V. Belov"
+, title =       "On the calculation of possible {Patterson} cyclotomic sets, I"
+, journal =     "Doklady Akad. Nauk SSSR"
+, volume =      255
+, number =      4
+, year =        1980
+, pages =       "858--861"
+, precedes =    "rpib-cppcs2-80"
+, update =      "97.11 bibrelex"
 }
 
 @article{rpib-cppcs2-80
-, author =	"V. G. Rau and L. G. Parkomov and V. V. Ilyukhin and N. V. Belov"
-, title =	"On the calculation of possible {Patterson} cyclotomic sets, II"
-, journal =	"Doklady Akad. Nauk SSSR"
-, volume =	255
-, number =	5
-, year =	1980
-, pages =	"1110--1113"
-, succeeds =	"rpib-cppcs1-80"
-, update =	"97.11 bibrelex"
+, author =      "V. G. Rau and L. G. Parkomov and V. V. Ilyukhin and N. V. Belov"
+, title =       "On the calculation of possible {Patterson} cyclotomic sets, II"
+, journal =     "Doklady Akad. Nauk SSSR"
+, volume =      255
+, number =      5
+, year =        1980
+, pages =       "1110--1113"
+, succeeds =    "rpib-cppcs1-80"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{r-fdbg-92
-, author =	"M. Rauch"
-, title =	"Fully Dynamic Biconnectivity in Graphs"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"50--59"
-, update =	"00.03 vismara, 99.07 vismara, 94.01 tamassia"
+, author =      "M. Rauch"
+, title =       "Fully Dynamic Biconnectivity in Graphs"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "50--59"
+, update =      "00.03 vismara, 99.07 vismara, 94.01 tamassia"
 }
 
 @inproceedings{r-idsfd-94
-, author =	"M. Rauch"
-, title =	"Improved Data Structures for Fully Dynamic Biconnectivity"
-, booktitle =	"Proc. 26th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	"686--695"
-, update =	"95.05 tamassia"
+, author =      "M. Rauch"
+, title =       "Improved Data Structures for Fully Dynamic Biconnectivity"
+, booktitle =   "Proc. 26th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       "686--695"
+, update =      "95.05 tamassia"
 }
 
 @techreport{rws-cmcs-96
-, author =	"Thomas Rausch and Franz-Erich Wolter and Oliver Sniehotta"
-, title =	"Computation of Medial Curves on Surfaces"
-, number =	1
-, institution =	"Welfen Laboratory, Universit{\"a}t Hannover"
-, month =	aug
-, year =	1996
-, url =	"http://www-c.informatik.uni-hannover.de"
-, keywords =	"CAD, geometric modeling, equidistantial set, medial curve, cut locus, focal curves, geodesics on surfaces, medial axis, offsets"
-, update =	"98.03 mitchell"
-, annote =	"To appear, IMA Conference Proceedings Series of the 7th
+, author =      "Thomas Rausch and Franz-Erich Wolter and Oliver Sniehotta"
+, title =       "Computation of Medial Curves on Surfaces"
+, number =      1
+, institution = "Welfen Laboratory, Universit{\"a}t Hannover"
+, month =       aug
+, year =        1996
+, url = "http://www-c.informatik.uni-hannover.de"
+, keywords =    "CAD, geometric modeling, equidistantial set, medial curve, cut locus, focal curves, geodesics on surfaces, medial axis, offsets"
+, update =      "98.03 mitchell"
+, annote =      "To appear, IMA Conference Proceedings Series of the 7th
                   IMA Conference on The Mathematics of Surfaces"
 }
 
 @inproceedings{rsmrr-stss-94
-, author =	"R. Ravi and R. Sundaram and M. V. Marathe and D. J. Rosenkrantz and S. S. Ravi"
-, title =	"Spanning trees short and small"
-, booktitle =	"Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1994
-, pages =	"546--555"
-, update =	"96.09 agarwal, 95.09 mitchell"
+, author =      "R. Ravi and R. Sundaram and M. V. Marathe and D. J. Rosenkrantz and S. S. Ravi"
+, title =       "Spanning trees short and small"
+, booktitle =   "Proc. 5th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1994
+, pages =       "546--555"
+, update =      "96.09 agarwal, 95.09 mitchell"
 }
 
 @inproceedings{rrt-fdphs-91
-, author =	"S. S. Ravi and D. J. Rosenkrantz and G. K. Tayi"
-, title =	"Facility Dispersion Problems: {Heuristics} and Special Cases"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"355--366"
-, update =	"93.09 milone+mitchell"
+, author =      "S. S. Ravi and D. J. Rosenkrantz and G. K. Tayi"
+, title =       "Facility Dispersion Problems: {Heuristics} and Special Cases"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "355--366"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{rw-rocs-89
-, author =	"G. Rawlings and D. Wood"
-, title =	"Restricted-oriented convex sets"
-, type =	"Technical {Report}"
-, number =	"CS-89-01"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "G. Rawlings and D. Wood"
+, title =       "Restricted-oriented convex sets"
+, type =        "Technical {Report}"
+, number =      "CS-89-01"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{r-erog-87
-, author =	"G. J. E. Rawlins"
-, title =	"Explorations in restricted-orientation geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	1987
-, keywords =	"doctoral thesis"
+, author =      "G. J. E. Rawlins"
+, title =       "Explorations in restricted-orientation geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        1987
+, keywords =    "doctoral thesis"
 }
 
 @inproceedings{rbc-su-88
-, author =	"G. J. E. Rawlins and R. Baeza-Yates and J. C. Culberson"
-, title =	"Searching with uncertainty"
-, editor =	"R. Karlsson and A. Lingas"
-, booktitle =	"Proc. 1st Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	318
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"176--189"
+, author =      "G. J. E. Rawlins and R. Baeza-Yates and J. C. Culberson"
+, title =       "Searching with uncertainty"
+, editor =      "R. Karlsson and A. Lingas"
+, booktitle =   "Proc. 1st Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      318
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "176--189"
 }
 
 @techreport{ro-cldph-88
-, author =	"G. J. E. Rawlins and M. Overmars"
-, title =	"Computing the link diameter of a polygon with holes"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1988
-, comments =	"Neither author has any recollection (as of May 1998) of
+, author =      "G. J. E. Rawlins and M. Overmars"
+, title =       "Computing the link diameter of a polygon with holes"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1988
+, comments =    "Neither author has any recollection (as of May 1998) of
                   this paper ever existing or what it was about.  We
                   can probably remove it from the bib file. (Comment
                   added by Joe Mitchell, after conferring with both
                   authors by email.)"
-, update =	"98.07 mitchell, 94.05 devillers+schwarzkopf"
+, update =      "98.07 mitchell, 94.05 devillers+schwarzkopf"
 }
 
 @article{rww-hprp-88
-, author =	"G. J. E. Rawlins and P. Widmayer and D. Wood"
-, title =	"Hole problems for rectangles in the plane"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	1
-, year =	1988
-, pages =	"86--97"
+, author =      "G. J. E. Rawlins and P. Widmayer and D. Wood"
+, title =       "Hole problems for rectangles in the plane"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      1
+, year =        1988
+, pages =       "86--97"
 }
 
 @article{rw-dtcs-89
-, author =	"G. J. E. Rawlins and D. Wood"
-, title =	"A decomposition theorem for convexity spaces"
-, journal =	"J. Geom."
-, volume =	36
-, year =	1989
-, pages =	"143--159"
+, author =      "G. J. E. Rawlins and D. Wood"
+, title =       "A decomposition theorem for convexity spaces"
+, journal =     "J. Geom."
+, volume =      36
+, year =        1989
+, pages =       "143--159"
 }
 
 @inproceedings{rw-cgro-88
-, author =	"G. J. E. Rawlins and D. Wood"
-, title =	"Computational geometry with restricted orientations"
-, booktitle =	"Proc. 13th IFIP Conf. System Modelling and Optimization"
-, series =	"Lecture Notes in Control and Information Science"
-, volume =	113
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"375--384"
+, author =      "G. J. E. Rawlins and D. Wood"
+, title =       "Computational geometry with restricted orientations"
+, booktitle =   "Proc. 13th IFIP Conf. System Modelling and Optimization"
+, series =      "Lecture Notes in Control and Information Science"
+, volume =      113
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "375--384"
 }
 
 @techreport{rw-gmsnv-88
-, author =	"G. J. E. Rawlins and D. Wood"
-, title =	"Guards with monotone sight: a new version of the art gallery theorem"
-, type =	"Report"
-, number =	"??"
-, institution =	"Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	1988
+, author =      "G. J. E. Rawlins and D. Wood"
+, title =       "Guards with monotone sight: a new version of the art gallery theorem"
+, type =        "Report"
+, number =      "??"
+, institution = "Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        1988
 }
 
 @article{rw-ocfoc-87
-, author =	"G. J. E. Rawlins and D. Wood"
-, title =	"Optimal computation of finitely oriented convex hulls"
-, journal =	"Inform. Comput."
-, volume =	72
-, year =	1987
-, pages =	"150--166"
+, author =      "G. J. E. Rawlins and D. Wood"
+, title =       "Optimal computation of finitely oriented convex hulls"
+, journal =     "Inform. Comput."
+, volume =      72
+, year =        1987
+, pages =       "150--166"
 }
 
 @incollection{rw-ocig-88
-, author =	"G. J. E. Rawlins and D. Wood"
-, title =	"Ortho-convexity and its generalizations"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"137--152"
+, author =      "G. J. E. Rawlins and D. Wood"
+, title =       "Ortho-convexity and its generalizations"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "137--152"
 }
 
 @techreport{rw-roc-86
-, author =	"G. J. E. Rawlins and D. Wood"
-, title =	"Restricted-orientation convexity"
-, type =	"Technical {Report}"
-, number =	"86-36"
-, institution =	"Univ. Waterloo"
-, address =	"Waterloo, ON"
-, year =	1986
+, author =      "G. J. E. Rawlins and D. Wood"
+, title =       "Restricted-orientation convexity"
+, type =        "Technical {Report}"
+, number =      "86-36"
+, institution = "Univ. Waterloo"
+, address =     "Waterloo, ON"
+, year =        1986
 }
 
 @article{rw-rocs-91
-, author =	"G. J. E. Rawlins and D. Wood"
-, title =	"Restricted-Oriented Convex Sets"
-, journal =	"Inform. Sci."
-, volume =	54
-, year =	1991
-, pages =	"263--281"
+, author =      "G. J. E. Rawlins and D. Wood"
+, title =       "Restricted-Oriented Convex Sets"
+, journal =     "Inform. Sci."
+, volume =      54
+, year =        1991
+, pages =       "263--281"
 }
 
 @article{rr-napa-91
-, author =	"B. Ray and K. Ray"
-, title =	"A new approach to polygonal approximation"
-, journal =	"Pattern Recogn. Lett."
-, volume =	12
-, year =	1991
-, pages =	"229--234"
-, update =	"93.09 milone+mitchell"
+, author =      "B. Ray and K. Ray"
+, title =       "A new approach to polygonal approximation"
+, journal =     "Pattern Recogn. Lett."
+, volume =      12
+, year =        1991
+, pages =       "229--234"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{r-slcdn-70
-, author =	"H. Raynaud"
-, title =	"Sur l'enveloppe convex des nuages de points aleatoires dans {$R^{n}$}"
-, journal =	"J. Appl. Probab."
-, volume =	7
-, year =	1970
-, pages =	"35--48"
+, author =      "H. Raynaud"
+, title =       "Sur l'enveloppe convex des nuages de points aleatoires dans {$R^{n}$}"
+, journal =     "J. Appl. Probab."
+, volume =      7
+, year =        1970
+, pages =       "35--48"
 }
 
 @article{rc-fsv-86
-, author =	"V. J. Rayward-Smith and A. Clare"
-, title =	"On finding {Steiner} vertices"
-, journal =	"Networks"
-, volume =	16
-, year =	1986
-, pages =	"283--294"
+, author =      "V. J. Rayward-Smith and A. Clare"
+, title =       "On finding {Steiner} vertices"
+, journal =     "Networks"
+, volume =      16
+, year =        1986
+, pages =       "283--294"
 }
 
 @techreport{r-mcdmg-86
-, author =	"R. Read"
-, title =	"Methods for Computer Display and Manipulation of Graphs and the Corresponding Algorithms"
-, number =	"86-12"
-, institution =	"Faculty of Mathematics, Univ. of Waterloo"
-, month =	jul
-, year =	1986
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Read"
+, title =       "Methods for Computer Display and Manipulation of Graphs and the Corresponding Algorithms"
+, number =      "86-12"
+, institution = "Faculty of Mathematics, Univ. of Waterloo"
+, month =       jul
+, year =        1986
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{r-nmdpg-87
-, author =	"R. Read"
-, title =	"New Methods for Drawing a Planar Graph Given the Cyclic Order of the Edges at Each Vertex"
-, journal =	"Congr. Numer."
-, volume =	56
-, year =	1987
-, pages =	"31--44"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Read"
+, title =       "New Methods for Drawing a Planar Graph Given the Cyclic Order of the Edges at Each Vertex"
+, journal =     "Congr. Numer."
+, volume =      56
+, year =        1987
+, pages =       "31--44"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @phdthesis{r-??-60
-, author =	"D. F. Rearick"
-, title =	"??"
-, school =	"California Inst. Tech."
-, year =	1960
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "D. F. Rearick"
+, title =       "??"
+, school =      "California Inst. Tech."
+, year =        1960
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @article{r-ert-68
-, author =	"J. Reay"
-, title =	"An extension of Radon's theorem"
-, journal =	"Illinois J. Math."
-, volume =	12
-, year =	1968
-, pages =	"184--189"
-, update =	"98.03 bibrelex"
+, author =      "J. Reay"
+, title =       "An extension of Radon's theorem"
+, journal =     "Illinois J. Math."
+, volume =      12
+, year =        1968
+, pages =       "184--189"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{r-hrpcc-97
-, author =	"Fran{\c c}ois Rebufat"
-, title =	"Handling Rotations in the Placement of Curved Convex Polygons"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"87--92"
-, update =	"00.03 bibrelex, 97.11 jones"
+, author =      "Fran{\c c}ois Rebufat"
+, title =       "Handling Rotations in the Placement of Curved Convex Polygons"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "87--92"
+, update =      "00.03 bibrelex, 97.11 jones"
 }
 
 @techreport{r-cocpt-87
-, author =	"R. Reckhow"
-, title =	"Covering Orthogonally Convex Polygons with Three Orientations of Dents"
-, type =	"Technical {Report}"
-, number =	"87-17"
-, institution =	"Dept. Comput. Sci., Univ. Alberta"
-, address =	"Edmonton, Alberta, Canada"
-, month =	aug
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "R. Reckhow"
+, title =       "Covering Orthogonally Convex Polygons with Three Orientations of Dents"
+, type =        "Technical {Report}"
+, number =      "87-17"
+, institution = "Dept. Comput. Sci., Univ. Alberta"
+, address =     "Edmonton, Alberta, Canada"
+, month =       aug
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{rc-csopm-87
-, author =	"R. A. Reckhow and J. Culberson"
-, title =	"Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"268--277"
-, precedes =	"cr-occop-89a"
-, cites =	"a-agpiv-84, fk-acrri-84, k-mchco-86, m-snpcs-79, os-snhpd-83, rw-roc-86, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 bibrelex"
+, author =      "R. A. Reckhow and J. Culberson"
+, title =       "Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "268--277"
+, precedes =    "cr-occop-89a"
+, cites =       "a-agpiv-84, fk-acrri-84, k-mchco-86, m-snpcs-79, os-snhpd-83, rw-roc-86, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 98.03 bibrelex"
 }
 
 @techreport{rr-rtdo-78
-, author =	"D. R. Reddy and S. M. Rubin"
-, title =	"Representation of three-dimensional objects"
-, type =	"Report"
-, number =	"CMU-CS-78-113"
-, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1978
+, author =      "D. R. Reddy and S. M. Rubin"
+, title =       "Representation of three-dimensional objects"
+, type =        "Report"
+, number =      "CMU-CS-78-113"
+, institution = "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1978
 }
 
 @article{rt-c3dsu-95
-, author =	"Jayachandra Reddy and George Turkiyyah"
-, title =	"Computation of {3D} Skeletons Using a Generalized {Delaunay} Triangulation Technique"
-, journal =	"Comput. Aided Design"
-, volume =	27
-, number =	9
-, year =	1995
-, pages =	"677--694"
-, update =	"98.07 mitchell"
+, author =      "Jayachandra Reddy and George Turkiyyah"
+, title =       "Computation of {3D} Skeletons Using a Generalized {Delaunay} Triangulation Technique"
+, journal =     "Comput. Aided Design"
+, volume =      27
+, number =      9
+, year =        1995
+, pages =       "677--694"
+, update =      "98.07 mitchell"
 }
 
 @article{r-pdpr-96
-, author =	"M. Reddy"
-, title =	"Perceptually-Driven Polygon Reduction"
-, journal =	"Comput. Graph. Forum"
-, volume =	15
-, number =	4
-, month =	oct
-, year =	1996
-, pages =	"191--203"
-, update =	"97.03 held"
+, author =      "M. Reddy"
+, title =       "Perceptually-Driven Polygon Reduction"
+, journal =     "Comput. Graph. Forum"
+, volume =      15
+, number =      4
+, month =       oct
+, year =        1996
+, pages =       "191--203"
+, update =      "97.03 held"
 }
 
 @article{r-slpsd-46
-, author =	"G. Reeb"
-, title =	"Sur les points singuliers d'une forme de pfaff complement integrable ou d'une fonction numerique"
-, journal =	"Comptes Rendus Acad. Sciences Paris"
-, volume =	222
-, year =	1946
-, pages =	"847--849"
-, update =	"98.07 bibrelex"
+, author =      "G. Reeb"
+, title =       "Sur les points singuliers d'une forme de pfaff complement integrable ou d'une fonction numerique"
+, journal =     "Comptes Rendus Acad. Sciences Paris"
+, volume =      222
+, year =        1946
+, pages =       "847--849"
+, update =      "98.07 bibrelex"
 }
 
 @article{rs-opctg-90
-, author =	"J. A. Reeds and L. A. Shepp"
-, title =	"Optimal paths for a car that goes both forwards and backwards"
-, journal =	"Pacific Journal of Mathematics"
-, volume =	145
-, number =	2
-, year =	1990
+, author =      "J. A. Reeds and L. A. Shepp"
+, title =       "Optimal paths for a car that goes both forwards and backwards"
+, journal =     "Pacific Journal of Mathematics"
+, volume =      145
+, number =      2
+, year =        1990
 }
 
 @article{rsfl-sudp-91
-, author =	"J. A. Reeds and L. A. Shepp and P. C. Fishburn and J. C. Lagarias"
-, title =	"Sets uniquely determined by projections"
-, journal =	"Discrete Math."
-, volume =	91
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "J. A. Reeds and L. A. Shepp and P. C. Fishburn and J. C. Lagarias"
+, title =       "Sets uniquely determined by projections"
+, journal =     "Discrete Math."
+, volume =      91
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @book{r-ng-83
-, author =	"E. G. Rees"
-, title =	"Notes on Geometry"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "E. G. Rees"
+, title =       "Notes on Geometry"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ram-tm-84
-, author =	"J. A. Rees and N. I. Adams and J. R. Meehan"
-, title =	"The {T} manual"
-, institution =	"Dept. Comput. Sci., Yale Univ."
-, address =	"New Haven, CT"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "J. A. Rees and N. I. Adams and J. R. Meehan"
+, title =       "The {T} manual"
+, institution = "Dept. Comput. Sci., Yale Univ."
+, address =     "New Haven, CT"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @article{r-pstmc-83
-, author =	"W. T. Reeves"
-, title =	"Particle systems - a technique for modeling a class of fuzzy objects"
-, journal =	"ACM Trans. Graph."
-, volume =	2
-, number =	2
-, month =	apr
-, year =	1983
-, pages =	"91--108"
-, update =	"98.07 bibrelex"
+, author =      "W. T. Reeves"
+, title =       "Particle systems - a technique for modeling a class of fuzzy objects"
+, journal =     "ACM Trans. Graph."
+, volume =      2
+, number =      2
+, month =       apr
+, year =        1983
+, pages =       "91--108"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{r-cpagt-95t
-, author =	"A. Rege"
-, title =	"A complete and practical algorithm for geometric theorem proving"
-, type =	"Technical {Report}"
-, institution =	"Univ. California"
-, address =	"Berkeley, CA"
-, year =	1995
-, update =	"98.03 bibrelex"
+, author =      "A. Rege"
+, title =       "A complete and practical algorithm for geometric theorem proving"
+, type =        "Technical {Report}"
+, institution = "Univ. California"
+, address =     "Berkeley, CA"
+, year =        1995
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{r-cpagt-95
-, author =	"Ashutosh Rege"
-, title =	"A Complete and Practical Algorithm for Geometric Theorem Proving"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"277--286"
-, keywords =	""
-, cites =	"c-crsas-91, c-isda-91, c-pegtu-84, c-mgtp-88, clo-iva-92, gm-eabwr-91, g-rgtpm-63, k-gtpuh-86, k-ragtp-89, ks-abaag-86, r-cpagt-95t, rc-slprf-95, rc-tag-95, r-ccgfo-89, r-deas-32, r-da-50, w-dpmtp-78, w-sramt-84, z-epc-93, ZZZ"
-, update =	"99.11 bibrelex, 98.03 bibrelex, 95.09 mitchell"
+, author =      "Ashutosh Rege"
+, title =       "A Complete and Practical Algorithm for Geometric Theorem Proving"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "277--286"
+, keywords =    ""
+, cites =       "c-crsas-91, c-isda-91, c-pegtu-84, c-mgtp-88, clo-iva-92, gm-eabwr-91, g-rgtpm-63, k-gtpuh-86, k-ragtp-89, ks-abaag-86, r-cpagt-95t, rc-slprf-95, rc-tag-95, r-ccgfo-89, r-deas-32, r-da-50, w-dpmtp-78, w-sramt-84, z-epc-93, ZZZ"
+, update =      "99.11 bibrelex, 98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{rc-tag-95
-, author =	"A. Rege and J. Canny"
-, title =	"A toolkit for algebra and geometry"
-, booktitle =	"Proc. ACM Sympos. Symbolic and Algebraic Computation"
-, site =	"Montreal"
-, year =	1995
-, note =	"Submitted"
-, update =	"98.03 bibrelex"
+, author =      "A. Rege and J. Canny"
+, title =       "A toolkit for algebra and geometry"
+, booktitle =   "Proc. ACM Sympos. Symbolic and Algebraic Computation"
+, site =        "Montreal"
+, year =        1995
+, note =        "Submitted"
+, update =      "98.03 bibrelex"
 }
 
 @article{rc-slprf-95
-, author =	"A. Rege and J. Canny"
-, title =	"Straight-line programs for real field extensions and perturbations"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	"??"
-, year =	1995
-, note =	"Submitted"
-, update =	"98.03 bibrelex"
+, author =      "A. Rege and J. Canny"
+, title =       "Straight-line programs for real field extensions and perturbations"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      "??"
+, year =        1995
+, note =        "Submitted"
+, update =      "98.03 bibrelex"
 }
 
 @article{rm-pmrh-88
-, author =	"M. G. Reggiani and F. E. Marchetti"
-, title =	"A Proposed Method for Representing Hierarchies"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	18
-, number =	1
-, year =	1988
-, pages =	"2--8"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. G. Reggiani and F. E. Marchetti"
+, title =       "A Proposed Method for Representing Hierarchies"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      18
+, number =      1
+, year =        1988
+, pages =       "2--8"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{rw-bspvo-89
-, author =	"Gabriele Reich and Peter Widmayer"
-, title =	"Beyond {Steiner's} problem: {A} {VLSI} oriented generalization"
-, booktitle =	"Proc. 15th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	411
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"196--210"
-, update =	"99.11 bibrelex, 98.11 smid, 98.03 mitchell, 95.01 mitchell"
+, author =      "Gabriele Reich and Peter Widmayer"
+, title =       "Beyond {Steiner's} problem: {A} {VLSI} oriented generalization"
+, booktitle =   "Proc. 15th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      411
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "196--210"
+, update =      "99.11 bibrelex, 98.11 smid, 98.03 mitchell, 95.01 mitchell"
 }
 
 @article{r-dcikc-88a
-, author =	"M. Reichling"
-, title =	"On the detection of a common intersection of $k$ convex objects in the plane"
-, journal =	"Inform. Process. Lett."
-, volume =	29
-, year =	1988
-, pages =	"25--29"
-, update =	"98.07 bibrelex, 96.05 agarwal"
+, author =      "M. Reichling"
+, title =       "On the detection of a common intersection of $k$ convex objects in the plane"
+, journal =     "Inform. Process. Lett."
+, volume =      29
+, year =        1988
+, pages =       "25--29"
+, update =      "98.07 bibrelex, 96.05 agarwal"
 }
 
 @inproceedings{r-dcikc-88i
-, author =	"M. Reichling"
-, title =	"On the detection of a common intersection of $k$ convex polyhedra"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"180--186"
-, update =	"00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "M. Reichling"
+, title =       "On the detection of a common intersection of $k$ convex polyhedra"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "180--186"
+, update =      "00.03 bibrelex, 99.11 bibrelex, 98.07 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @article{r-pfcrp-
-, author =	"M. Reid"
-, title =	"Potential field computation for robotic path planning using a microchannel SLM"
-, journal =	"??"
-, institution =	"NASA AMES Research Center"
-, pages =	"188--191"
-, update =	"93.09 milone+mitchell"
+, author =      "M. Reid"
+, title =       "Potential field computation for robotic path planning using a microchannel SLM"
+, journal =     "??"
+, institution = "NASA AMES Research Center"
+, pages =       "188--191"
+, update =      "93.09 milone+mitchell"
 }
 
 @incollection{rmm-lrptc-93
-, author =	"M. Reid-Miller and G. L. Miller and F. Modugno"
-, title =	"List Ranking and Parallel Tree Contraction"
-, editor =	"J. H. Reif"
-, booktitle =	"Synthesis of Parallel Algorithms"
-, publisher =	"Morgan Kaufmann Publishers, Inc."
-, address =	"San Mateo, CA"
-, year =	1993
-, pages =	"115--194"
-, update =	"96.09 orourke"
+, author =      "M. Reid-Miller and G. L. Miller and F. Modugno"
+, title =       "List Ranking and Parallel Tree Contraction"
+, editor =      "J. H. Reif"
+, booktitle =   "Synthesis of Parallel Algorithms"
+, publisher =   "Morgan Kaufmann Publishers, Inc."
+, address =     "San Mateo, CA"
+, year =        1993
+, pages =       "115--194"
+, update =      "96.09 orourke"
 }
 
 @techreport{rs-mppmo-85t
-, author =	"J. Reif and M. Sharir"
-, title =	"Motion planning in the presence of moving obstacles"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1985
-, update =	"98.07 bibrelex"
+, author =      "J. Reif and M. Sharir"
+, title =       "Motion planning in the presence of moving obstacles"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1985
+, update =      "98.07 bibrelex"
 }
 
 @article{rs-mppmo-94
-, author =	"John Reif and Micha Sharir"
-, title =	"Motion Planning in the Presence of Moving Obstacles"
-, journal =	"J. ACM"
-, volume =	41
-, number =	4
-, month =	jul
-, year =	1994
-, pages =	"764--790"
-, succeeds =	"rs-mppmo-85"
-, update =	"98.03 mitchell"
+, author =      "John Reif and Micha Sharir"
+, title =       "Motion Planning in the Presence of Moving Obstacles"
+, journal =     "J. ACM"
+, volume =      41
+, number =      4
+, month =       jul
+, year =        1994
+, pages =       "764--790"
+, succeeds =    "rs-mppmo-85"
+, update =      "98.03 mitchell"
 }
 
 @techreport{rs-mtdmi-85
-, author =	"J. Reif and J. Storer"
-, title =	"Minimizing turns for discrete movement in the interior of a polygon"
-, type =	"Technical {Report}"
-, institution =	"Harvard Univ.,"
-, address =	"Cambridge, MA"
-, month =	dec
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "J. Reif and J. Storer"
+, title =       "Minimizing turns for discrete movement in the interior of a polygon"
+, type =        "Technical {Report}"
+, institution = "Harvard Univ.,"
+, address =     "Cambridge, MA"
+, month =       dec
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @techreport{rt-akpul-89
-, author =	"J. Reif and S. Tate"
-, title =	"Approximate kinodynamic planning using ${L}_{2}$ norm dynamic bounds"
-, type =	"Technical {Report}"
-, institution =	"Duke Univ."
-, address =	"Durham, NC"
-, year =	1989
-, precedes =	"rt-akpul-94"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "J. Reif and S. Tate"
+, title =       "Approximate kinodynamic planning using ${L}_{2}$ norm dynamic bounds"
+, type =        "Technical {Report}"
+, institution = "Duke Univ."
+, address =     "Durham, NC"
+, year =        1989
+, precedes =    "rt-akpul-94"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @incollection{rt-epaoc-90
-, author =	"J. Reif and A. Tyagi"
-, title =	"Efficient parallel algorithms for optical computing with the {DFT} primitive"
-, booktitle =	"Proc. 10th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	472
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"149--160"
-, update =	"97.11 bibrelex"
+, author =      "J. Reif and A. Tyagi"
+, title =       "Efficient parallel algorithms for optical computing with the {DFT} primitive"
+, booktitle =   "Proc. 10th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      472
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "149--160"
+, update =      "97.11 bibrelex"
 }
 
 @article{rty-ccrt-94
-, author =	"J. Reif and J. Tygar and A. Yoshida"
-, title =	"Computability and complexity of ray tracing"
-, journal =	"Discrete Comput. Geom."
-, volume =	11
-, year =	1994
-, pages =	"265--288"
-, succeeds =	"rty-ccobt-90"
-, update =	"97.11 bibrelex, 95.01 matousek"
+, author =      "J. Reif and J. Tygar and A. Yoshida"
+, title =       "Computability and complexity of ray tracing"
+, journal =     "Discrete Comput. Geom."
+, volume =      11
+, year =        1994
+, pages =       "265--288"
+, succeeds =    "rty-ccobt-90"
+, update =      "97.11 bibrelex, 95.01 matousek"
 }
 
 @inproceedings{rw-nudkm-96
-, author =	"John Reif and Hongyan Wang"
-, title =	"Non-Uniform Discretization for Kinodynamic Motion Planning and its Applications"
-, editor =	"Jean-Paul Laumond and Mark Overmars"
-, booktitle =	"Algorithms for Robotic Motion and Manipulation"
-, nickname =	"WAFR '96"
-, publisher =	"A.K. Peters"
-, address =	"Wellesley, MA"
-, year =	1997
-, pages =	"97--112"
-, note =	"Proc. 1996 Workshop on the Algorithmic Foundations of
+, author =      "John Reif and Hongyan Wang"
+, title =       "Non-Uniform Discretization for Kinodynamic Motion Planning and its Applications"
+, editor =      "Jean-Paul Laumond and Mark Overmars"
+, booktitle =   "Algorithms for Robotic Motion and Manipulation"
+, nickname =    "WAFR '96"
+, publisher =   "A.K. Peters"
+, address =     "Wellesley, MA"
+, year =        1997
+, pages =       "97--112"
+, note =        "Proc. 1996 Workshop on the Algorithmic Foundations of
                   Robotics, Toulouse, France, July 1996"
-, update =	"98.07 agarwal, 98.03 mitchell"
+, update =      "98.07 agarwal, 98.03 mitchell"
 }
 
 @inproceedings{rw-ctdcc-98
-, author =	"John Reif and Hongyan Wang"
-, title =	"The Complexity of the Two Dimensional Curvature-Constrained Shortest-Path Problem"
-, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
-, nickname =	"WAFR '98"
-, year =	1998
-, pages =	"to appear"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "John Reif and Hongyan Wang"
+, title =       "The Complexity of the Two Dimensional Curvature-Constrained Shortest-Path Problem"
+, booktitle =   "Proc. 3rd Workshop Algorithmic Found. Robot."
+, nickname =    "WAFR '98"
+, year =        1998
+, pages =       "to appear"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @article{r-tadgc-87
-, author =	"J. H. Reif"
-, title =	"A Topological Approach to Dynamic Graph Connectivity"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"65--70"
-, update =	"94.01 tamassia"
+, author =      "J. H. Reif"
+, title =       "A Topological Approach to Dynamic Graph Connectivity"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "65--70"
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{r-opais-85
-, author =	"J. H. Reif"
-, title =	"An optimal parallel algorithm for integer sorting"
-, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"496--504"
+, author =      "J. H. Reif"
+, title =       "An optimal parallel algorithm for integer sorting"
+, booktitle =   "Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "496--504"
 }
 
 @incollection{r-cgmp-87
-, author =	"J. H. Reif"
-, title =	"Complexity of the generalized movers problem"
-, editor =	"J. Hopcroft and J. Schwartz and Micha Sharir"
-, booktitle =	"Planning, Geometry and Complexity of Robot Motion"
-, publisher =	"Ablex Publishing"
-, address =	"Norwood, NJ"
-, year =	1987
-, pages =	"267--281"
-, succeeds =	"r-cmpg-79"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "J. H. Reif"
+, title =       "Complexity of the generalized movers problem"
+, editor =      "J. Hopcroft and J. Schwartz and Micha Sharir"
+, booktitle =   "Planning, Geometry and Complexity of Robot Motion"
+, publisher =   "Ablex Publishing"
+, address =     "Norwood, NJ"
+, year =        1987
+, pages =       "267--281"
+, succeeds =    "r-cmpg-79"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{r-cmpg-79
-, author =	"J. H. Reif"
-, title =	"Complexity of the mover's problem and generalizations"
-, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1979
-, pages =	"421--427"
-, precedes =	"r-cgmp-87"
+, author =      "J. H. Reif"
+, title =       "Complexity of the mover's problem and generalizations"
+, booktitle =   "Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1979
+, pages =       "421--427"
+, precedes =    "r-cgmp-87"
 }
 
 @book{r-spa-93
-, author =	"J. H. Reif"
-, title =	"Synthesis of Parallel Algorithms"
-, publisher =	"Morgan Kaufmann Publishers, Inc."
-, address =	"San Mateo, CA"
-, year =	1993
-, update =	"96.09 orourke"
+, author =      "J. H. Reif"
+, title =       "Synthesis of Parallel Algorithms"
+, publisher =   "Morgan Kaufmann Publishers, Inc."
+, address =     "San Mateo, CA"
+, year =        1993
+, update =      "96.09 orourke"
 }
 
 @techreport{rs-eoshs-88t
-, author =	"J. H. Reif and S. Sen"
-, title =	"An Efficient Output-Sensitive Hidden-Surface Removal Algorithm and Its Parallelization"
-, number =	""
-, institution =	"CS Dept., Duke U."
-, address =	"Durham, NC 27706, USA"
-, year =	1988
-, update =	"93.09 held"
+, author =      "J. H. Reif and S. Sen"
+, title =       "An Efficient Output-Sensitive Hidden-Surface Removal Algorithm and Its Parallelization"
+, number =      ""
+, institution = "CS Dept., Duke U."
+, address =     "Durham, NC 27706, USA"
+, year =        1988
+, update =      "93.09 held"
 }
 
 @inproceedings{rs-eoshs-88i
-, author =	"J. H. Reif and S. Sen"
-, title =	"An efficient output-sensitive hidden-surface removal algorithms and its parallelization"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"193--200"
-, cites =	"cg-vippg-85, mn-dfc-86, cs-vppt-86, m-ss-84, m-mdscg-84, ps-cgi-85, c-tpca-82, m-wcohs-86, w-tsshl-83, lp-lppsi-77, p-ortap-79, cd-icott-87, m-awcdt-81, n-flsah-85, s-tsbhl-81, g-pahle-87, acg-cdctd-87, sss-cthsa-74, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "J. H. Reif and S. Sen"
+, title =       "An efficient output-sensitive hidden-surface removal algorithms and its parallelization"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "193--200"
+, cites =       "cg-vippg-85, mn-dfc-86, cs-vppt-86, m-ss-84, m-mdscg-84, ps-cgi-85, c-tpca-82, m-wcohs-86, w-tsshl-83, lp-lppsi-77, p-ortap-79, cd-icott-87, m-awcdt-81, n-flsah-85, s-tsbhl-81, g-pahle-87, acg-cdctd-87, sss-cthsa-74, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{rs-opacg-88
-, author =	"J. H. Reif and S. Sen"
-, title =	"Optimal parallel algorithms for computational geometry"
-, type =	"Report"
-, number =	"CS-1988-1"
-, institution =	"Dept. Comput. Sci., Duke Univ."
-, address =	"Durham, NC"
-, year =	1988
+, author =      "J. H. Reif and S. Sen"
+, title =       "Optimal parallel algorithms for computational geometry"
+, type =        "Report"
+, number =      "CS-1988-1"
+, institution = "Dept. Comput. Sci., Duke Univ."
+, address =     "Durham, NC"
+, year =        1988
 }
 
 @article{rs-oprat-92
-, author =	"J. H. Reif and S. Sen"
-, title =	"Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems"
-, journal =	"SIAM J. Comput."
-, volume =	21
-, year =	1992
-, pages =	"466--485"
-, update =	"96.09 orourke"
+, author =      "J. H. Reif and S. Sen"
+, title =       "Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems"
+, journal =     "SIAM J. Comput."
+, volume =      21
+, year =        1992
+, pages =       "466--485"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{rs-orpac-87
-, author =	"John H. Reif and Sandeep Sen"
-, title =	"Optimal Randomized Parallel Algorithms For Computational Geometry"
-, booktitle =	"Proc. 1987 Internat. Conf. Parallel Process."
-, publisher =	"Pennsylvania State Univ Press"
-, address =	"University Park, PA"
-, year =	1987
-, pages =	"270--277"
-, keywords =	"randomized parallel algorithms, computational geometry, concurrent-read exclusive write, parallel random-access machines"
-, annote =	"Including polygon triangulation."
-, abstract =	"The authors present parallel algorithms for some
-		 fundamental problems in computational geometry which
-		 have optimal running time with very high probability
-		 (approaching 1 as n yields infinity). These include
-		 planar point location, triangulation, trapezoidal
-		 decomposition, 3-D maxima, two- set dominance counting,
-		 and range-counting, among others. Most of these
-		 algorithms run on the CREW PRAM model with O(n)
-		 processors and execute in O(log n) time. Most of these
-		 algorithms use a novel data structure called the nested
-		 plane sweep tree. Random splitting is used very
-		 effectively to divide and conquer on the plane, raising
-		 the possibility of extending this technique to higher
-		 dimensions. 20 refs."
+, author =      "John H. Reif and Sandeep Sen"
+, title =       "Optimal Randomized Parallel Algorithms For Computational Geometry"
+, booktitle =   "Proc. 1987 Internat. Conf. Parallel Process."
+, publisher =   "Pennsylvania State Univ Press"
+, address =     "University Park, PA"
+, year =        1987
+, pages =       "270--277"
+, keywords =    "randomized parallel algorithms, computational geometry, concurrent-read exclusive write, parallel random-access machines"
+, annote =      "Including polygon triangulation."
+, abstract =    "The authors present parallel algorithms for some
+                 fundamental problems in computational geometry which
+                 have optimal running time with very high probability
+                 (approaching 1 as n yields infinity). These include
+                 planar point location, triangulation, trapezoidal
+                 decomposition, 3-D maxima, two- set dominance counting,
+                 and range-counting, among others. Most of these
+                 algorithms run on the CREW PRAM model with O(n)
+                 processors and execute in O(log n) time. Most of these
+                 algorithms use a novel data structure called the nested
+                 plane sweep tree. Random splitting is used very
+                 effectively to divide and conquer on the plane, raising
+                 the possibility of extending this technique to higher
+                 dimensions. 20 refs."
 }
 
 @article{rs-orpac-92
-, author =	"John H. Reif and Sandeep Sen"
-, title =	"Optimal Randomized Parallel Algorithms For Computational Geometry"
-, journal =	"Algorithmica"
-, volume =	7
-, number =	1
-, year =	1992
-, pages =	"91--117"
-, keywords =	"randomized algorithms, parallel algorithms, crew pram, computational geometry"
-, update =	"93.09 rote"
-, abstract =	"We present parallel algorithms for some fundamental
-		 problems in computational geometry which have a running
-		 time of O(log n) using n processors, with very high
-		 probability (approaching 1 as n yields infinity ).
-		 These include planar-point location, triangulation, and
-		 trapezoidal decomposition. We also present optimal
-		 algorithms for three-dimensional maxima and two-set
-		 dominance counting by an application of integer
-		 sorting. Most of these algorithms run on a CREW PRAM
-		 model and have optimal processor-time product which
-		 improve on the previously best-known algorithms of
-		 Atallah and Goodrich [5] for these problems. The crux
-		 of these algorithms is a useful data structure which
-		 emulates the plane- sweeping paradigm used for
-		 sequential algorithms. We extend some of the techniques
-		 used by Reischuk [26] and Reif and Valiant [25] for
-		 flashsort algorithm to perform divide and conquer in a
-		 plane very efficiently leading to the improved
-		 performance by our approach. (Author abstract) 28
-		 Refs."
+, author =      "John H. Reif and Sandeep Sen"
+, title =       "Optimal Randomized Parallel Algorithms For Computational Geometry"
+, journal =     "Algorithmica"
+, volume =      7
+, number =      1
+, year =        1992
+, pages =       "91--117"
+, keywords =    "randomized algorithms, parallel algorithms, crew pram, computational geometry"
+, update =      "93.09 rote"
+, abstract =    "We present parallel algorithms for some fundamental
+                 problems in computational geometry which have a running
+                 time of O(log n) using n processors, with very high
+                 probability (approaching 1 as n yields infinity ).
+                 These include planar-point location, triangulation, and
+                 trapezoidal decomposition. We also present optimal
+                 algorithms for three-dimensional maxima and two-set
+                 dominance counting by an application of integer
+                 sorting. Most of these algorithms run on a CREW PRAM
+                 model and have optimal processor-time product which
+                 improve on the previously best-known algorithms of
+                 Atallah and Goodrich [5] for these problems. The crux
+                 of these algorithms is a useful data structure which
+                 emulates the plane- sweeping paradigm used for
+                 sequential algorithms. We extend some of the techniques
+                 used by Reischuk [26] and Reif and Valiant [25] for
+                 flashsort algorithm to perform divide and conquer in a
+                 plane very efficiently leading to the improved
+                 performance by our approach. (Author abstract) 28
+                 Refs."
 }
 
 @incollection{rs-pcgau-00
-, author =	"John H. Reif and Sandeep Sen"
-, title =	"Parallel Computational Geometry: {An} Approach Using Randomization"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"765--828"
-, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 18 of su-hcg-00"
+, author =      "John H. Reif and Sandeep Sen"
+, title =       "Parallel Computational Geometry: {An} Approach Using Randomization"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "765--828"
+, update =      "00.03 bibrelex+smid, 99.03 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 18 of su-hcg-00"
 }
 
 @inproceedings{rs-pnrst-89
-, author =	"J. H. Reif and S. Sen"
-, title =	"Polling: a new randomized sampling technique for computational geometry"
-, booktitle =	"Proc. 21st Annu. ACM Sympos. Theory Comput."
-, year =	1989
-, pages =	"394--404"
-, comments =	"To appear in SIAM J. Comput. as Optimal parallel
-		 algorithms for {3D} convex hulls and related problems"
-, update =	"94.01 smid"
+, author =      "J. H. Reif and S. Sen"
+, title =       "Polling: a new randomized sampling technique for computational geometry"
+, booktitle =   "Proc. 21st Annu. ACM Sympos. Theory Comput."
+, year =        1989
+, pages =       "394--404"
+, comments =    "To appear in SIAM J. Comput. as Optimal parallel
+                 algorithms for {3D} convex hulls and related problems"
+, update =      "94.01 smid"
 }
 
 @inproceedings{rs-rabsl-90
-, author =	"J. H. Reif and S. Sen"
-, title =	"Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications"
-, booktitle =	"Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
-, year =	1990
-, pages =	"327--337"
-, update =	"96.09 orourke"
+, author =      "J. H. Reif and S. Sen"
+, title =       "Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications"
+, booktitle =   "Proc. 2nd ACM Sympos. Parallel Algorithms Architect."
+, year =        1990
+, pages =       "327--337"
+, update =      "96.09 orourke"
 }
 
 @article{rs-rabsl-94
-, author =	"J. H. Reif and S. Sen"
-, title =	"Randomized algorithms for binary search and Load Balancing on fixed connection networks with Geometric Applications"
-, journal =	"SIAM J. Comput."
-, volume =	23
-, number =	3
-, year =	1994
-, pages =	"633--651"
-, update =	"97.11 bibrelex"
+, author =      "J. H. Reif and S. Sen"
+, title =       "Randomized algorithms for binary search and Load Balancing on fixed connection networks with Geometric Applications"
+, journal =     "SIAM J. Comput."
+, volume =      23
+, number =      3
+, year =        1994
+, pages =       "633--651"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{rs-mppmo-85
-, author =	"J. H. Reif and Micha Sharir"
-, title =	"Motion planning in the presence of moving obstacles"
-, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"144--154"
-, keywords =	"motion planning, lower bounds, algebraic geometry"
-, precedes =	"rs-mppmo-94"
-, update =	"98.03 mitchell"
+, author =      "J. H. Reif and Micha Sharir"
+, title =       "Motion planning in the presence of moving obstacles"
+, booktitle =   "Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "144--154"
+, keywords =    "motion planning, lower bounds, algebraic geometry"
+, precedes =    "rs-mppmo-94"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{rs-dsppp-88
-, author =	"J. H. Reif and J. A. Storer"
-, title =	"3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles"
-, booktitle =	"Proc. 13th Internat. Sympos. Math. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	"3:24"
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"85--92"
-, succeeds =	"rs-spesp-85"
-, update =	"95.01 mitchell"
+, author =      "J. H. Reif and J. A. Storer"
+, title =       "3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles"
+, booktitle =   "Proc. 13th Internat. Sympos. Math. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      "3:24"
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "85--92"
+, succeeds =    "rs-spesp-85"
+, update =      "95.01 mitchell"
 }
 
 @techreport{rs-seubf-??
-, author =	"J. H. Reif and J. A. Storer"
-, title =	"A single-exponential upper bound for finding shortest paths in three dimensions"
-, type =	"Technical {Report}"
-, year =	"??"
-, comments =	"To appear, JACM. The original report was broken into two papers."
-, succeeds =	"rs-spesp-85"
-, update =	"93.09 milone+mitchell"
+, author =      "J. H. Reif and J. A. Storer"
+, title =       "A single-exponential upper bound for finding shortest paths in three dimensions"
+, type =        "Technical {Report}"
+, year =        "??"
+, comments =    "To appear, JACM. The original report was broken into two papers."
+, succeeds =    "rs-spesp-85"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{rs-seubf-94
-, author =	"J. H. Reif and J. A. Storer"
-, title =	"A single-exponential upper bound for finding shortest paths in three dimensions"
-, journal =	"J. ACM"
-, volume =	41
-, number =	5
-, year =	1994
-, pages =	"1013--1019"
-, succeeds =	"rs-spesp-85"
-, update =	"95.05 mitchell"
+, author =      "J. H. Reif and J. A. Storer"
+, title =       "A single-exponential upper bound for finding shortest paths in three dimensions"
+, journal =     "J. ACM"
+, volume =      41
+, number =      5
+, year =        1994
+, pages =       "1013--1019"
+, succeeds =    "rs-spesp-85"
+, update =      "95.05 mitchell"
 }
 
 @article{rs-mtdmi-87
-, author =	"J. H. Reif and J. A. Storer"
-, title =	"Minimizing turns for discrete movement in the interior of a polygon"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	"??"
-, year =	1987
-, pages =	"182--193"
+, author =      "J. H. Reif and J. A. Storer"
+, title =       "Minimizing turns for discrete movement in the interior of a polygon"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      "??"
+, year =        1987
+, pages =       "182--193"
 }
 
 @techreport{rs-spesp-85
-, author =	"J. H. Reif and J. A. Storer"
-, title =	"Shortest paths in {Euclidean} spaces with polyhedral obstacles"
-, type =	"Report"
-, number =	"CS-85-121"
-, institution =	"Dept. Comput. Sci., Brandeis Univ."
-, address =	"Waltham, MA"
-, year =	1985
-, precedes =	"rs-dsppp-88"
-, update =	"95.01 mitchell"
+, author =      "J. H. Reif and J. A. Storer"
+, title =       "Shortest paths in {Euclidean} spaces with polyhedral obstacles"
+, type =        "Report"
+, number =      "CS-85-121"
+, institution = "Dept. Comput. Sci., Brandeis Univ."
+, address =     "Waltham, MA"
+, year =        1985
+, precedes =    "rs-dsppp-88"
+, update =      "95.01 mitchell"
 }
 
 @article{rt-akpul-94
-, author =	"John H. Reif and Stephen R. Tate"
-, title =	"Approximate Kinodynamic Planning Using {$L_2$}-Norm Dynamic Bounds"
-, journal =	"Comput. Math. Appl."
-, volume =	27
-, number =	5
-, year =	1994
-, pages =	"29--44"
-, succeeds =	"rt-akpul-89"
-, update =	"98.03 mitchell"
+, author =      "John H. Reif and Stephen R. Tate"
+, title =       "Approximate Kinodynamic Planning Using {$L_2$}-Norm Dynamic Bounds"
+, journal =     "Comput. Math. Appl."
+, volume =      27
+, number =      5
+, year =        1994
+, pages =       "29--44"
+, succeeds =    "rt-akpul-89"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{rty-ccobt-90
-, author =	"J. H. Reif and J. D. Tyger and A. Yoshida"
-, title =	"The computability and complexity of optical beam tracing"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"106--115"
-, keywords =	"ray tracing, complexity theory"
+, author =      "J. H. Reif and J. D. Tyger and A. Yoshida"
+, title =       "The computability and complexity of optical beam tracing"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "106--115"
+, keywords =    "ray tracing, complexity theory"
 }
 
 @article{rv-ltsls-87
-, author =	"J. H. Reif and L. G. Valiant"
-, title =	"A logarithmic time sort for linear size networks"
-, journal =	"J. ACM"
-, volume =	34
-, number =	1
-, year =	1987
-, pages =	"60--76"
-, update =	"98.03 bibrelex"
+, author =      "J. H. Reif and L. G. Valiant"
+, title =       "A logarithmic time sort for linear size networks"
+, journal =     "J. ACM"
+, volume =      34
+, number =      1
+, year =        1987
+, pages =       "60--76"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{rw-olntr-93
-, author =	"J. H. Reif and H. Wang"
-, title =	"On-Line Navigation Through Weighted Regions"
-, type =	"Technical Report"
-, institution =	"Dept. Computer Science, Duke University"
-, year =	1993
-, comments =	"Presented at the fall workshop, October 1993.
+, author =      "J. H. Reif and H. Wang"
+, title =       "On-Line Navigation Through Weighted Regions"
+, type =        "Technical Report"
+, institution = "Dept. Computer Science, Duke University"
+, year =        1993
+, comments =    "Presented at the fall workshop, October 1993.
 Previous title:  On-Line Navigation Through Regions of Variable
                   Densities"
-, update =	"98.03 mitchell"
+, update =      "98.03 mitchell"
 }
 
 @article{r-fhlgt-92
-, author =	"G. Reinelt"
-, title =	"Fast heuristics for large geometric traveling salesman problems"
-, journal =	"ORSA J. Comput."
-, volume =	4
-, year =	1992
-, pages =	"206--217"
-, update =	"94.09 bernal"
+, author =      "G. Reinelt"
+, title =       "Fast heuristics for large geometric traveling salesman problems"
+, journal =     "ORSA J. Comput."
+, volume =      4
+, year =        1992
+, pages =       "206--217"
+, update =      "94.09 bernal"
 }
 
 @inproceedings{rbbcfklr-ddewp-84
-, author =	"D. Reiner and M. Brodie and G. Brown and M. Chilenskas and M. Friedell and D. Kramlich and J. Lehman and A. Rosenthal"
-, title =	"A Database Design and Evaluation Workbench: Preliminary Report"
-, booktitle =	"Proc. Internat. Conf. on Systems Development and Requirements Specification"
-, year =	1984
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. Reiner and M. Brodie and G. Brown and M. Chilenskas and M. Friedell and D. Kramlich and J. Lehman and A. Rosenthal"
+, title =       "A Database Design and Evaluation Workbench: Preliminary Report"
+, booktitle =   "Proc. Internat. Conf. on Systems Development and Requirements Specification"
+, year =        1984
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @misc{rb-hlded-85
-, author =	"D. Reiner and G. Brown"
-, title =	"Heuristic Layout for {DDEW} {ER}+ Diagrams"
-, institution =	"Computer Corporation of America"
-, year =	1985
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. Reiner and G. Brown"
+, title =       "Heuristic Layout for {DDEW} {ER}+ Diagrams"
+, institution = "Computer Corporation of America"
+, year =        1985
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{rbflmrr-ddw-87
-, author =	"D. Reiner and G. Brown and M. Friedell and J. Lehman and R. McKee and P. Rheingans and A. Rosenthal"
-, title =	"A Database Designer's Workbench"
-, editor =	"S. Spaccapietra"
-, booktitle =	"Entity-Relationship Approach: Proc. 5th Internat. Conf. on Entity-Relationship Approach (Dijon France 1987)"
-, publisher =	"North-Holland"
-, address =	"New York, NY"
-, year =	1987
-, pages =	"347--360"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. Reiner and G. Brown and M. Friedell and J. Lehman and R. McKee and P. Rheingans and A. Rosenthal"
+, title =       "A Database Designer's Workbench"
+, editor =      "S. Spaccapietra"
+, booktitle =   "Entity-Relationship Approach: Proc. 5th Internat. Conf. on Entity-Relationship Approach (Dijon France 1987)"
+, publisher =   "North-Holland"
+, address =     "New York, NY"
+, year =        1987
+, pages =       "347--360"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{rt-tdt-81
-, author =	"E. Reingold and J. Tilford"
-, title =	"Tidier Drawing of Trees"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	"SE-7"
-, number =	2
-, year =	1981
-, pages =	"223--228"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. Reingold and J. Tilford"
+, title =       "Tidier Drawing of Trees"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      "SE-7"
+, number =      2
+, year =        1981
+, pages =       "223--228"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{r-ossa-72
-, author =	"E. M. Reingold"
-, title =	"On the optimality of some set algorithms"
-, journal =	"J. ACM"
-, volume =	19
-, year =	1972
-, pages =	"649--659"
+, author =      "E. M. Reingold"
+, title =       "On the optimality of some set algorithms"
+, journal =     "J. ACM"
+, volume =      19
+, year =        1972
+, pages =       "649--659"
 }
 
 @book{rnd-catp-77
-, author =	"E. M. Reingold and J. Nievergelt and N. Deo"
-, title =	"Combinatorial Algorithms: Theory and Practice"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1977
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "E. M. Reingold and J. Nievergelt and N. Deo"
+, title =       "Combinatorial Algorithms: Theory and Practice"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1977
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{rs-padch-83
-, author =	"E. M. Reingold and K. J. Supowit"
-, title =	"Probabilistic analysis of divide-and-conquer heuristics for minimum weighted {Euclidean} matching"
-, journal =	"Networks"
-, volume =	13
-, year =	1983
-, pages =	"49--66"
-, keywords =	"matchings, average-case analysis, divide-and-conquer"
+, author =      "E. M. Reingold and K. J. Supowit"
+, title =       "Probabilistic analysis of divide-and-conquer heuristics for minimum weighted {Euclidean} matching"
+, journal =     "Networks"
+, volume =      13
+, year =        1983
+, pages =       "49--66"
+, keywords =    "matchings, average-case analysis, divide-and-conquer"
 }
 
 @article{rt-ghcm-81
-, author =	"E. M. Reingold and R. E. Tarjan"
-, title =	"On a greedy heuristic for complete matching"
-, journal =	"SIAM J. Comput."
-, volume =	10
-, year =	1981
-, pages =	"676--681"
+, author =      "E. M. Reingold and R. E. Tarjan"
+, title =       "On a greedy heuristic for complete matching"
+, journal =     "SIAM J. Comput."
+, volume =      10
+, year =        1981
+, pages =       "676--681"
 }
 
 @article{r-ppass-85
-, author =	"R. Reischuk"
-, title =	"Probabilistic parallel algorithms for sorting and selection"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, number =	2
-, month =	may
-, year =	1985
-, pages =	"396--409"
-, update =	"98.11 bibrelex"
+, author =      "R. Reischuk"
+, title =       "Probabilistic parallel algorithms for sorting and selection"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, number =      2
+, month =       may
+, year =        1985
+, pages =       "396--409"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{r-3dvpi-95
-, author =	"S. P. Reiss"
-, title =	"{3-D} Visualization of Program Information"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"12--24"
-, keywords =	"graph drawing, 3D"
-, update =	"95.01 tamassia"
+, author =      "S. P. Reiss"
+, title =       "{3-D} Visualization of Program Information"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "12--24"
+, keywords =    "graph drawing, 3D"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{r-cpe-87
-, author =	"Steven P. Reiss"
-, title =	"A Conceptual Programming Environment"
-, booktitle =	"Proc. 9th Intl. Conf. on Software Engineering"
-, year =	1987
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss"
+, title =       "A Conceptual Programming Environment"
+, booktitle =   "Proc. 9th Intl. Conf. on Software Engineering"
+, year =        1987
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{r-fa3v-93
-, author =	"S. P. Reiss"
-, title =	"A Framework for Abstract 3D Visualization"
-, booktitle =	"Proc. IEEE Sympos. on Visual Languages"
-, nickname =	"VL '93"
-, year =	1993
-, keywords =	"graph drawing"
-, update =	"95.09 agarwal, 95.01 tamassia"
+, author =      "S. P. Reiss"
+, title =       "A Framework for Abstract 3D Visualization"
+, booktitle =   "Proc. IEEE Sympos. on Visual Languages"
+, nickname =    "VL '93"
+, year =        1993
+, keywords =    "graph drawing"
+, update =      "95.09 agarwal, 95.01 tamassia"
 }
 
 @unpublished{r-rvfpe-94
-, author =	"Steven P. Reiss"
-, title =	"A retrospective view of the {FIELD} programming environment"
-, year =	1994
-, note =	"Brown {University}, submitted for publication"
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss"
+, title =       "A retrospective view of the {FIELD} programming environment"
+, year =        1994
+, note =        "Brown {University}, submitted for publication"
+, update =      "97.03 tamassia"
 }
 
 @article{r-e3vpi-95
-, author =	"S. P. Reiss"
-, title =	"An Engine for the {3D} Visualization of Program Information"
-, journal =	"J. Visual Lang. Comput."
-, volume =	6
-, number =	3
-, year =	1995
-, pages =	"299--323"
-, note =	"(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
-, keywords =	"graph drawing, 3D, system, software visualization"
-, succeeds =	"r-3dvpi-95"
-, update =	"98.07 vismara, 95.09 agarwal+devillers, 95.05 tamassia"
+, author =      "S. P. Reiss"
+, title =       "An Engine for the {3D} Visualization of Program Information"
+, journal =     "J. Visual Lang. Comput."
+, volume =      6
+, number =      3
+, year =        1995
+, pages =       "299--323"
+, note =        "(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
+, keywords =    "graph drawing, 3D, system, software visualization"
+, succeeds =    "r-3dvpi-95"
+, update =      "98.07 vismara, 95.09 agarwal+devillers, 95.05 tamassia"
 }
 
 @book{r-ffiel-94
-, author =	"Steven P. Reiss"
-, title =	"{FIELD}: A Friendly Integrated Environment for Learning and Development"
-, publisher =	"Kluwer"
-, year =	1994
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss"
+, title =       "{FIELD}: A Friendly Integrated Environment for Learning and Development"
+, publisher =   "Kluwer"
+, year =        1994
+, update =      "97.03 tamassia"
 }
 
 @unpublished{r-fmlcd-95
-, author =	"Steven P. Reiss"
-, title =	"Fragments: {A} mechanism for low cost data integration"
-, month =	may
-, year =	1995
-, note =	"Brown {U}. {Computer} {Science} {Tech} {Report}"
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss"
+, title =       "Fragments: {A} mechanism for low cost data integration"
+, month =       may
+, year =        1995
+, note =        "Brown {U}. {Computer} {Science} {Tech} {Report}"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{r-gtsgp-86
-, author =	"Steven P. Reiss"
-, title =	"{GARDEN} tools: support for graphical programming"
-, booktitle =	"Proc. Workshop on Advanced Software Development Environments"
-, year =	1986
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss"
+, title =       "{GARDEN} tools: support for graphical programming"
+, booktitle =   "Proc. Workshop on Advanced Software Development Environments"
+, year =        1986
+, update =      "97.03 tamassia"
 }
 
 @techreport{r-imfe-88
-, author =	"S. P. Reiss"
-, title =	"Integration Mechanisms in the {FIELD} Environment"
-, number =	"CS-88-18"
-, institution =	"Department of Computer Science, Brown University"
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "S. P. Reiss"
+, title =       "Integration Mechanisms in the {FIELD} Environment"
+, number =      "CS-88-18"
+, institution = "Department of Computer Science, Brown University"
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{r-pes3g-93
-, author =	"Steven P. Reiss"
-, title =	"Presentation and editing of structured 3-{D} graphics"
-, journal =	"Proc. HCI '93"
-, volume =	"??"
-, month =	aug
-, year =	1993
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss"
+, title =       "Presentation and editing of structured 3-{D} graphics"
+, journal =     "Proc. HCI '93"
+, volume =      "??"
+, month =       aug
+, year =        1993
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{r-sdidd-96
-, author =	"Steven P. Reiss"
-, title =	"Simplifying data integration: the design of the {Desert} software development environment"
-, booktitle =	"Proc. 18th Intl Conf on Software Engineering"
-, year =	1996
-, pages =	"398--407"
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss"
+, title =       "Simplifying data integration: the design of the {Desert} software development environment"
+, booktitle =   "Proc. 18th Intl Conf on Software Engineering"
+, year =        1996
+, pages =       "398--407"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{r-vlgs-86
-, author =	"Steven P. Reiss"
-, title =	"Visual Languages and the {GARDEN} system"
-, booktitle =	"Proc. Intl. Workshop on Visual Aids To Programming"
-, year =	1986
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss"
+, title =       "Visual Languages and the {GARDEN} system"
+, booktitle =   "Proc. Intl. Workshop on Visual Aids To Programming"
+, year =        1986
+, update =      "97.03 tamassia"
 }
 
 @article{r-wgecp-87
-, author =	"Steven P. Reiss"
-, title =	"Working in the {GARDEN} Garden environment for conceptual programming"
-, journal =	"IEEE Softw."
-, volume =	4
-, number =	6
-, year =	1987
-, pages =	"16--27"
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss"
+, title =       "Working in the {GARDEN} Garden environment for conceptual programming"
+, journal =     "IEEE Softw."
+, volume =      4
+, number =      6
+, year =        1987
+, pages =       "16--27"
+, update =      "97.03 tamassia"
 }
 
 @article{rc-psv-94
-, author =	"Steven P. Reiss and Isabel F. Cruz"
-, title =	"Practical software visualization"
-, journal =	"Proc. CHI Workshop on Program Visualization"
-, volume =	"??"
-, month =	apr
-, year =	1994
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss and Isabel F. Cruz"
+, title =       "Practical software visualization"
+, journal =     "Proc. CHI Workshop on Program Visualization"
+, volume =      "??"
+, month =       apr
+, year =        1994
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{rgr-pvlgs-86
-, author =	"Steven P. Reiss and Eric J. Golin and Robert V. Rubin"
-, title =	"Prototyping visual languages with the {GARDEN} system"
-, booktitle =	"Proc. IEEE Symp. on Visual Languages"
-, year =	1986
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss and Eric J. Golin and Robert V. Rubin"
+, title =       "Prototyping visual languages with the {GARDEN} system"
+, booktitle =   "Proc. IEEE Symp. on Visual Languages"
+, year =        1986
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{rmd-ugvss-89
-, author =	"S. P. Reiss and S. Meyers and C. Duby"
-, title =	"Using {GELO} to Visualize Software Systems"
-, booktitle =	"Proc. UIST"
-, year =	1989
-, pages =	"149--157"
-, keywords =	"graph drawing"
-, update =	"95.05 tamassia"
+, author =      "S. P. Reiss and S. Meyers and C. Duby"
+, title =       "Using {GELO} to Visualize Software Systems"
+, booktitle =   "Proc. UIST"
+, year =        1989
+, pages =       "149--157"
+, keywords =    "graph drawing"
+, update =      "95.05 tamassia"
 }
 
 @inproceedings{rp-dpds-87
-, author =	"S. P. Reiss and J. N. Pato"
-, title =	"Displaying Program and Data Structures"
-, booktitle =	"Proc. 20th Hawaii Internat. Conf. on System Sciences"
-, year =	1987
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "S. P. Reiss and J. N. Pato"
+, title =       "Displaying Program and Data Structures"
+, booktitle =   "Proc. 20th Hawaii Internat. Conf. on System Sciences"
+, year =        1987
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @unpublished{rs-gpauo-92
-, author =	"Steven P. Reiss and Manojit Sarkar"
-, title =	"Generating program abstractions using an object-oriented database"
-, year =	1992
-, note =	"Brown {University} {Department} of {Computer} {Science}"
-, update =	"97.03 tamassia"
+, author =      "Steven P. Reiss and Manojit Sarkar"
+, title =       "Generating program abstractions using an object-oriented database"
+, year =        1992
+, note =        "Brown {University} {Department} of {Computer} {Science}"
+, update =      "97.03 tamassia"
 }
 
 @article{rp-totmr-94
-, author =	"D. B. Reister and F. G. Pin"
-, title =	"Time-Optimal Trajectories for Mobile Robots with Two Independently Driven Wheels"
-, journal =	"Internat. J. Robot. Res."
-, volume =	13
-, year =	1994
-, pages =	"38--54"
-, update =	"98.03 mitchell"
-, annote =	"related to \cite{ci-totrp-97}, but uses methods of optimal
+, author =      "D. B. Reister and F. G. Pin"
+, title =       "Time-Optimal Trajectories for Mobile Robots with Two Independently Driven Wheels"
+, journal =     "Internat. J. Robot. Res."
+, volume =      13
+, year =        1994
+, pages =       "38--54"
+, update =      "98.03 mitchell"
+, annote =      "related to \cite{ci-totrp-97}, but uses methods of optimal
                   control"
 }
 
 @article{rrs-eges-89
-, author =	"R. Reiterman and V. R{\"o}del and E. {\v S}i{\v n}ajov{\'a}"
-, title =	"Embeddings of graphs in {Euclidean} spaces"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"349--364"
+, author =      "R. Reiterman and V. R{\"o}del and E. {\v S}i{\v n}ajov{\'a}"
+, title =       "Embeddings of graphs in {Euclidean} spaces"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "349--364"
 }
 
 @article{r-eap-88
-, author =	"F. Rendl"
-, title =	"On the {Euclidean} assignment problem"
-, journal =	"J. Comput. Appl. Math."
-, volume =	23
-, year =	1988
-, pages =	"257--265"
-, keywords =	"optimization, expected-case analysis"
-, comments =	"replaces the techreport r-eap-87"
-, update =	"93.09 rote"
-, annote =	"linear-time heuristic for the MAXIMUM bipartite matching
-		 between two sets of $n$ points in the unit square with
-		 an abolute error of $O(n^{5/6})$. For uniformly distributed
-		 points, the $z$ of the value of the maximum matching
-		 satisfies $\lim_{n\to\infty} = (\sqrt{3}+\log(1+\sqrt{2}))/3$
-		 almost surely."
+, author =      "F. Rendl"
+, title =       "On the {Euclidean} assignment problem"
+, journal =     "J. Comput. Appl. Math."
+, volume =      23
+, year =        1988
+, pages =       "257--265"
+, keywords =    "optimization, expected-case analysis"
+, comments =    "replaces the techreport r-eap-87"
+, update =      "93.09 rote"
+, annote =      "linear-time heuristic for the MAXIMUM bipartite matching
+                 between two sets of $n$ points in the unit square with
+                 an abolute error of $O(n^{5/6})$. For uniformly distributed
+                 points, the $z$ of the value of the maximum matching
+                 satisfies $\lim_{n\to\infty} = (\sqrt{3}+\log(1+\sqrt{2}))/3$
+                 almost surely."
 }
 
 @techreport{rw-rsols-90
-, author =	"F. Rendl and G. Woeginger"
-, title =	"Reconstructing sets of orthogonal line segments in the plane"
-, institution =	"Tecnische Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "F. Rendl and G. Woeginger"
+, title =       "Reconstructing sets of orthogonal line segments in the plane"
+, institution = "Tecnische Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{r-fpade-88
-, author =	"J. Renegar"
-, title =	"A faster {PSPACE} algorithm for deciding the existential theory of the reals"
-, booktitle =	"Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1988
-, pages =	"291--295"
-, update =	"97.11 bibrelex"
+, author =      "J. Renegar"
+, title =       "A faster {PSPACE} algorithm for deciding the existential theory of the reals"
+, booktitle =   "Proc. 29th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1988
+, pages =       "291--295"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{r-ccgfo-89
-, author =	"J. Renegar"
-, title =	"On the computational complexity and geometry of the first order theory of the reals"
-, type =	"Technical {Report}"
-, number =	853
-, institution =	"School Oper. Res. Indust. Engrg., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	jul
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "J. Renegar"
+, title =       "On the computational complexity and geometry of the first order theory of the reals"
+, type =        "Technical {Report}"
+, number =      853
+, institution = "School Oper. Res. Indust. Engrg., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       jul
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @article{r-ccgfo-92
-, author =	"J. Renegar"
-, title =	"On the computational complexity and geometry of the first order theory of the reals"
-, journal =	"J. Symbolic Comput."
-, volume =	13
-, number =	3
-, year =	1992
-, pages =	"255--352"
-, update =	"93.09 matousek"
+, author =      "J. Renegar"
+, title =       "On the computational complexity and geometry of the first order theory of the reals"
+, journal =     "J. Symbolic Comput."
+, volume =      13
+, number =      3
+, year =        1992
+, pages =       "255--352"
+, update =      "93.09 matousek"
 }
 
 @article{r-a623i-84
-, author =	"R. J. Renka"
-, title =	"Algorithm 623: {Interpolation} on the surface of a sphere"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	10
-, number =	4
-, year =	1984
-, pages =	"437--439"
-, succeeds =	"r-idss-84"
+, author =      "R. J. Renka"
+, title =       "Algorithm 623: {Interpolation} on the surface of a sphere"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      10
+, number =      4
+, year =        1984
+, pages =       "437--439"
+, succeeds =    "r-idss-84"
 }
 
 @article{r-a624t-84
-, author =	"R. J. Renka"
-, title =	"Algorithm 624: {Triangulation} and interpolation of arbitrary distributed points in the plane"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	10
-, year =	1984
-, pages =	"440--442"
+, author =      "R. J. Renka"
+, title =       "Algorithm 624: {Triangulation} and interpolation of arbitrary distributed points in the plane"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      10
+, year =        1984
+, pages =       "440--442"
 }
 
 @article{r-idss-84
-, author =	"R. J. Renka"
-, title =	"Interpolation of data on the surface of a sphere"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	10
-, number =	4
-, year =	1984
-, pages =	"417--436"
-, precedes =	"r-a623i-84"
-, annote =	"constructs Delaunay triangulation on sphere surface
-		 using iterative (flip) algorithm; used to fit $C^{1}$
-		 surface; $O(n^{2})$ time"
+, author =      "R. J. Renka"
+, title =       "Interpolation of data on the surface of a sphere"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      10
+, number =      4
+, year =        1984
+, pages =       "417--436"
+, precedes =    "r-a623i-84"
+, annote =      "constructs Delaunay triangulation on sphere surface
+                 using iterative (flip) algorithm; used to fit $C^{1}$
+                 surface; $O(n^{2})$ time"
 }
 
 @article{rc-tbcim-84
-, author =	"R. L. Renka and A. K. Cline"
-, title =	"A triangle-based {$C^{1}$} interpolation method"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, number =	1
-, year =	1984
-, pages =	"223--238"
+, author =      "R. L. Renka and A. K. Cline"
+, title =       "A triangle-based {$C^{1}$} interpolation method"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, number =      1
+, year =        1984
+, pages =       "223--238"
 }
 
 @article{rd-ublds-75
-, author =	"B. Rennie and A. Dobson"
-, title =	"Upper bounds for the lengths of {Davenport--Schinzel} sequences"
-, journal =	"Utilitas Math."
-, volume =	8
-, year =	1975
-, pages =	"181--185"
-, update =	"95.09 agarwal"
+, author =      "B. Rennie and A. Dobson"
+, title =       "Upper bounds for the lengths of {Davenport--Schinzel} sequences"
+, journal =     "Utilitas Math."
+, volume =      8
+, year =        1975
+, pages =       "181--185"
+, update =      "95.09 agarwal"
 }
 
 @article{rs-udkhv-63
-, author =	"A. R{\'e}nyi and R. Sulanke"
-, title =	"{\"U}ber die konvexe {H{\"u}lle} von $n$ zuf{\"a}llig gerw{\"a}hten {Punkten} {I}"
-, journal =	"Z. Wahrsch. Verw. Gebiete"
-, volume =	2
-, year =	1963
-, pages =	"75--84"
+, author =      "A. R{\'e}nyi and R. Sulanke"
+, title =       "{\"U}ber die konvexe {H{\"u}lle} von $n$ zuf{\"a}llig gerw{\"a}hten {Punkten} {I}"
+, journal =     "Z. Wahrsch. Verw. Gebiete"
+, volume =      2
+, year =        1963
+, pages =       "75--84"
 }
 
 @article{rs-zkper-68
-, author =	"A. R{\'e}nyi and R. Sulanke"
-, title =	"Zuf{\"a}llige konvexe {Polygone} in einem {Ringgebiet}"
-, journal =	"Z. Wahrsch. Verw. Gebiete"
-, volume =	9
-, year =	1968
-, pages =	"146--157"
-, update =	"93.09 rote"
+, author =      "A. R{\'e}nyi and R. Sulanke"
+, title =       "Zuf{\"a}llige konvexe {Polygone} in einem {Ringgebiet}"
+, journal =     "Z. Wahrsch. Verw. Gebiete"
+, volume =      9
+, year =        1968
+, pages =       "146--157"
+, update =      "93.09 rote"
 }
 
 @article{ro-gud-96
-, author =	"Kevin J. Renze and James H. Oliver"
-, title =	"Generalized unstructured decimation"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	16
-, number =	6
-, month =	nov
-, year =	1996
-, pages =	"24--32"
-, keywords =	"surface simplification, volume decimation, irregular grids"
-, update =	"98.03 mitchell"
+, author =      "Kevin J. Renze and James H. Oliver"
+, title =       "Generalized unstructured decimation"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      16
+, number =      6
+, month =       nov
+, year =        1996
+, pages =       "24--32"
+, keywords =    "surface simplification, volume decimation, irregular grids"
+, update =      "98.03 mitchell"
 }
 
 @book{r-glbe-84
-, author =	"T. W. Reps"
-, title =	"Generating Language-Based Environments"
-, publisher =	"MIT Press"
-, year =	1984
-, update =	"96.01 tamassia"
+, author =      "T. W. Reps"
+, title =       "Generating Language-Based Environments"
+, publisher =   "MIT Press"
+, year =        1984
+, update =      "96.01 tamassia"
 }
 
 @book{rt-sg-89
-, author =	"T. W. Reps and T. Teitelbaum"
-, title =	"The Synthesizer Generator"
-, publisher =	"Springer-Verlag"
-, year =	1989
-, update =	"96.01 tamassia"
+, author =      "T. W. Reps and T. Teitelbaum"
+, title =       "The Synthesizer Generator"
+, publisher =   "Springer-Verlag"
+, year =        1989
+, update =      "96.01 tamassia"
 }
 
 @incollection{r-rrso-80
-, author =	"A. Requicha"
-, title =	"Representations of Rigid Solid Objects"
-, booktitle =	"Comput. Aided Design"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	89
-, publisher =	"Springer-Verlag"
-, year =	1980
-, pages =	"2--78"
-, update =	"98.03 bibrelex"
+, author =      "A. Requicha"
+, title =       "Representations of Rigid Solid Objects"
+, booktitle =   "Comput. Aided Design"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      89
+, publisher =   "Springer-Verlag"
+, year =        1980
+, pages =       "2--78"
+, update =      "98.03 bibrelex"
 }
 
 @article{rv-smhsc-82
-, author =	"A. A. Requicha and H. B. Voelcker"
-, title =	"Solid Modeling: {A} Historical Summary and Contemporary Assessment"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	2
-, number =	2
-, month =	mar
-, year =	1982
-, pages =	"9--24"
-, update =	"98.03 bibrelex"
+, author =      "A. A. Requicha and H. B. Voelcker"
+, title =       "Solid Modeling: {A} Historical Summary and Contemporary Assessment"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      2
+, number =      2
+, month =       mar
+, year =        1982
+, pages =       "9--24"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{r-mmcrt-93
-, author =	"A. A. G. Requicha"
-, title =	"Mathematical Meaning and Computational Representation of Tolerance Specifications"
-, booktitle =	"Proc. 1993 Int. Forum on Dimensional Tolerancing and Metrology"
-, year =	1993
-, pages =	"61--68"
-, update =	"96.09 orourke"
+, author =      "A. A. G. Requicha"
+, title =       "Mathematical Meaning and Computational Representation of Tolerance Specifications"
+, booktitle =   "Proc. 1993 Int. Forum on Dimensional Tolerancing and Metrology"
+, year =        1993
+, pages =       "61--68"
+, update =      "96.09 orourke"
 }
 
 @techreport{r-mmrso-79
-, author =	"A. A. G. Requicha"
-, title =	"Mathematical models of rigid solid objects"
-, type =	"Report"
-, number =	"TM-28"
-, institution =	"College Engrg. Appl. Sci., Univ. Rochester"
-, address =	"Rochester, NY"
-, year =	1979
+, author =      "A. A. G. Requicha"
+, title =       "Mathematical models of rigid solid objects"
+, type =        "Report"
+, number =      "TM-28"
+, institution = "College Engrg. Appl. Sci., Univ. Rochester"
+, address =     "Rochester, NY"
+, year =        1979
 }
 
 @incollection{r-rtsmi-84
-, author =	"A. A. G. Requicha"
-, title =	"Representation of tolerances in solid modeling: {Issues} and alternative approaches"
-, editor =	"M. S. Pickett and J. W. Boyse"
-, booktitle =	"Solid Modeling by Computers"
-, publisher =	"Plenum Publishers Corp."
-, year =	1984
-, update =	"98.07 bibrelex"
+, author =      "A. A. G. Requicha"
+, title =       "Representation of tolerances in solid modeling: {Issues} and alternative approaches"
+, editor =      "M. S. Pickett and J. W. Boyse"
+, booktitle =   "Solid Modeling by Computers"
+, publisher =   "Plenum Publishers Corp."
+, year =        1984
+, update =      "98.07 bibrelex"
 }
 
 @article{r-rrstm-80
-, author =	"A. A. G. Requicha"
-, title =	"Representations of rigid solids: theory, methods, and systems"
-, journal =	"ACM Comput. Surv."
-, volume =	12
-, year =	1980
-, pages =	"437--464"
+, author =      "A. A. G. Requicha"
+, title =       "Representations of rigid solids: theory, methods, and systems"
+, journal =     "ACM Comput. Surv."
+, volume =      12
+, year =        1980
+, pages =       "437--464"
 }
 
 @techreport{rt-mfcsg-78
-, author =	"A. A. G. Requicha and R. B. Tilove"
-, title =	"Mathematical foundations of constructive solid geometry: general topology of closed regular sets"
-, type =	"Report"
-, number =	"TM-27"
-, institution =	"College Engrg. Appl. Sci., Univ. Rochester"
-, address =	"Rochester, NY"
-, year =	1978
+, author =      "A. A. G. Requicha and R. B. Tilove"
+, title =       "Mathematical foundations of constructive solid geometry: general topology of closed regular sets"
+, type =        "Report"
+, number =      "TM-27"
+, institution = "College Engrg. Appl. Sci., Univ. Rochester"
+, address =     "Rochester, NY"
+, year =        1978
 }
 
 @techreport{rv-bosmb-84
-, author =	"A. A. G. Requicha and H. B. Voelcker"
-, title =	"Boolean operations in solid modelling: boundary evaluation and merging algorithms"
-, type =	"Report"
-, number =	"??"
-, institution =	"College Engrg. Appl. Sci., Univ. Rochester"
-, address =	"Rochester, NY"
-, year =	1984
+, author =      "A. A. G. Requicha and H. B. Voelcker"
+, title =       "Boolean operations in solid modelling: boundary evaluation and merging algorithms"
+, type =        "Report"
+, number =      "??"
+, institution = "College Engrg. Appl. Sci., Univ. Rochester"
+, address =     "Rochester, NY"
+, year =        1984
 }
 
 @article{rv-bosmb-85
-, author =	"A. A. G. Requicha and H. B. Voelcker"
-, title =	"Boolean operations in solid modelling: boundary evaluation and merging algorithms"
-, journal =	"Proc. IEEE"
-, volume =	73
-, number =	1
-, year =	1985
-, update =	"93.09 goodrich"
+, author =      "A. A. G. Requicha and H. B. Voelcker"
+, title =       "Boolean operations in solid modelling: boundary evaluation and merging algorithms"
+, journal =     "Proc. IEEE"
+, volume =      73
+, number =      1
+, year =        1985
+, update =      "93.09 goodrich"
 }
 
 @techreport{rv-csg-80
-, author =	"A. A. G. Requicha and H. B. Voelcker"
-, title =	"Constructive solid geometry"
-, type =	"Report"
-, number =	"TM-25"
-, institution =	"Production Automat. Project, Univ. Rochester"
-, address =	"Rochester, NY"
-, year =	1980
+, author =      "A. A. G. Requicha and H. B. Voelcker"
+, title =       "Constructive solid geometry"
+, type =        "Report"
+, number =      "TM-25"
+, institution = "Production Automat. Project, Univ. Rochester"
+, address =     "Rochester, NY"
+, year =        1980
 }
 
 @article{rv-smcsr-83
-, author =	"A. A. G. Requicha and H. B. Voelcker"
-, title =	"Solid Modeling: {Current} status and research directions"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	3
-, month =	oct
-, year =	1983
-, pages =	"25--37"
-, update =	"97.11 bibrelex"
+, author =      "A. A. G. Requicha and H. B. Voelcker"
+, title =       "Solid Modeling: {Current} status and research directions"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      3
+, month =       oct
+, year =        1983
+, pages =       "25--37"
+, update =      "97.11 bibrelex"
 }
 
 @book{r-km-76
-, author =	"F. Reuleaux"
-, title =	"The Kinematics of Machinery"
-, publisher =	"Macmilly and Company"
-, year =	1876
-, note =	"Republished by Dover in 1963"
-, update =	"98.03 bibrelex"
+, author =      "F. Reuleaux"
+, title =       "The Kinematics of Machinery"
+, publisher =   "Macmilly and Company"
+, year =        1876
+, note =        "Republished by Dover in 1963"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{r-mfdg-93
-, author =	"Jean-Pierre Reveilles"
-, title =	"Mathematical foundations of Discrete Geometry"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"27--30"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Jean-Pierre Reveilles"
+, title =       "Mathematical foundations of Discrete Geometry"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "27--30"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @article{rw-dolml-87
-, author =	"C. Rey and R. Ward"
-, title =	"On determining the on-line minimax linear fit to a discrete point set in the plane"
-, journal =	"Inform. Process. Lett."
-, volume =	24
-, year =	1987
-, pages =	"97--101"
+, author =      "C. Rey and R. Ward"
+, title =       "On determining the on-line minimax linear fit to a discrete point set in the plane"
+, journal =     "Inform. Process. Lett."
+, volume =      24
+, year =        1987
+, pages =       "97--101"
 }
 
 @article{r-fhsdb-87
-, author =	"C. W. Reynolds"
-, title =	"Flocks, herds, and schools: A distributed behavioral model"
-, journal =	"Comput. Graph."
-, volume =	21
-, number =	4
-, year =	1987
-, pages =	"25--34"
-, note =	"Proc. SIGGRAPH '87"
-, keywords =	"bird, fish, aggregate motion, particle system, actor, flight, behavioral animation, constraints, path, planning"
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "C. W. Reynolds"
+, title =       "Flocks, herds, and schools: A distributed behavioral model"
+, journal =     "Comput. Graph."
+, volume =      21
+, number =      4
+, year =        1987
+, pages =       "25--34"
+, note =        "Proc. SIGGRAPH '87"
+, keywords =    "bird, fish, aggregate motion, particle system, actor, flight, behavioral animation, constraints, path, planning"
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @article{r-msa3d-96
-, author =	"M. Rezayat"
-, title =	"Mid-Surface Abstraction from 3D Solid Models: General Theory and Applications"
-, journal =	"Comput. Aided Design"
-, volume =	28
-, number =	11
-, month =	nov
-, year =	1996
-, pages =	"905--915"
-, update =	"97.03 held"
+, author =      "M. Rezayat"
+, title =       "Mid-Surface Abstraction from 3D Solid Models: General Theory and Applications"
+, journal =     "Comput. Aided Design"
+, volume =      28
+, number =      11
+, month =       nov
+, year =        1996
+, pages =       "905--915"
+, update =      "97.03 held"
 }
 
 @inproceedings{rj-gedac-93
-, author =	"P. de Rezende and W. Jacometti"
-, title =	"GeoLab: {An} environment for development of algorithms in computational geometry"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"175--180"
-, cites =	"ra-aeaa-, b-aa-87, b-zsaam-92, rj-agaug-93, ey-dlge-88, j-guapd-92, mn-lledt-89a, s-ooweg-90, kmmns-cgw-90, s-tfsaa-90, rj-agaug-93, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "P. de Rezende and W. Jacometti"
+, title =       "GeoLab: {An} environment for development of algorithms in computational geometry"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "175--180"
+, cites =       "ra-aeaa-, b-aa-87, b-zsaam-92, rj-agaug-93, ey-dlge-88, j-guapd-92, mn-lledt-89a, s-ooweg-90, kmmns-cgw-90, s-tfsaa-90, rj-agaug-93, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @misc{ra-aeaa-
-, author =	"P. J. de Rezende and R. V. Amorim"
-, title =	"AnimA - {An} Environment for Algorithm Animation"
-, year =	"??"
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "P. J. de Rezende and R. V. Amorim"
+, title =       "AnimA - {An} Environment for Algorithm Animation"
+, year =        "??"
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{rj-agaug-93
-, author =	"P. J. de Rezende and W. R. Jacometti"
-, title =	"Animation of Geometric Algorithms using {GeoLab}"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"401--402"
-, keywords =	"video review"
-, cites =	"b-aa-87, b-zsaam-92, ra-aeaa-, ey-dlge-88, j-guapd-92, k-iacgw-90, mn-lledt-89, s-ooweg-90, s-tfsaa-90, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "P. J. de Rezende and W. R. Jacometti"
+, title =       "Animation of Geometric Algorithms using {GeoLab}"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "401--402"
+, keywords =    "video review"
+, cites =       "b-aa-87, b-zsaam-92, ra-aeaa-, ey-dlge-88, j-guapd-92, k-iacgw-90, mn-lledt-89, s-ooweg-90, s-tfsaa-90, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{rl-pspmd-95
-, author =	"P. J. de Rezende and D. T. Lee"
-, title =	"Point set pattern matching in $d$-dimensions"
-, journal =	"Algorithmica"
-, volume =	13
-, year =	1995
-, pages =	"387--404"
-, update =	"98.07 bibrelex"
+, author =      "P. J. de Rezende and D. T. Lee"
+, title =       "Point set pattern matching in $d$-dimensions"
+, journal =     "Algorithmica"
+, volume =      13
+, year =        1995
+, pages =       "387--404"
+, update =      "98.07 bibrelex"
 }
 
 @article{rlw-rsppr-89
-, author =	"P. J. de Rezende and D. T. Lee and Y. F. Wu"
-, title =	"Rectilinear shortest paths in the presence of rectangular barriers"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"41--53"
-, succeeds =	"rlw-rsprb-85"
+, author =      "P. J. de Rezende and D. T. Lee and Y. F. Wu"
+, title =       "Rectilinear shortest paths in the presence of rectangular barriers"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "41--53"
+, succeeds =    "rlw-rsprb-85"
 }
 
 @inproceedings{rlw-rsprb-85
-, author =	"P. J. de Rezende and D. T. Lee and Y. F. Wu"
-, title =	"Rectilinear shortest paths with rectangular barriers"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"204--213"
-, precedes =	"rlw-rsppr-89"
-, cites =	"ahu-daca-74, b-lbact-83, d-ntpcg-59, egs-oplms-86, k-osps-83, ll-fmrdp-81, l-prp-78, lp-esppr-84, lw-apcfp-79, s-cg-78, ss-spps-84, v-atmtd-74, wpw-mtpr-74, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "P. J. de Rezende and D. T. Lee and Y. F. Wu"
+, title =       "Rectilinear shortest paths with rectangular barriers"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "204--213"
+, precedes =    "rlw-rsppr-89"
+, cites =       "ahu-daca-74, b-lbact-83, d-ntpcg-59, egs-oplms-86, k-osps-83, ll-fmrdp-81, l-prp-78, lp-esppr-84, lw-apcfp-79, s-cg-78, ss-spps-84, v-atmtd-74, wpw-mtpr-74, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{r-drmrc-88
-, author =	"G. Rhee"
-, title =	"{DNA} restriction mapping from random-clone data"
-, type =	"Technical {Report}"
-, number =	"WUCS-88-18"
-, institution =	"Dept. Comput. Sci., Washington Univ."
-, address =	"St. Louis, MO"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "G. Rhee"
+, title =       "{DNA} restriction mapping from random-clone data"
+, type =        "Technical {Report}"
+, number =      "WUCS-88-18"
+, institution = "Dept. Comput. Sci., Washington Univ."
+, address =     "St. Louis, MO"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @article{r-asoi-53
-, author =	"J. E. Rhodes"
-, title =	"Analysis and synthesis of optical images"
-, journal =	"Amer. J. Phys."
-, volume =	21
-, month =	may
-, year =	1953
-, pages =	"337--343"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Rhodes"
+, title =       "Analysis and synthesis of optical images"
+, journal =     "Amer. J. Phys."
+, volume =      21
+, month =       may
+, year =        1953
+, pages =       "337--343"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{r-ospft-86
-, author =	"W. T. Rhodes"
-, title =	"Optical signal processing: Fourier Transform and Convolution/Correlation"
-, booktitle =	"Proc. of SPIE"
-, volume =	634
-, year =	1986
-, pages =	"57--63"
-, update =	"98.07 bibrelex"
+, author =      "W. T. Rhodes"
+, title =       "Optical signal processing: Fourier Transform and Convolution/Correlation"
+, booktitle =   "Proc. of SPIE"
+, volume =      634
+, year =        1986
+, pages =       "57--63"
+, update =      "98.07 bibrelex"
 }
 
 @article{r-adtp-73
-, author =	"D. Rhynsburger"
-, title =	"Analytic delineation of {Thiessen} polygons"
-, journal =	"Geogr. Anal."
-, volume =	5
-, year =	1973
-, pages =	"133--144"
+, author =      "D. Rhynsburger"
+, title =       "Analytic delineation of {Thiessen} polygons"
+, journal =     "Geogr. Anal."
+, volume =      5
+, year =        1973
+, pages =       "133--144"
 }
 
 @article{r-cgcg-72
-, author =	"A. Ricci"
-, title =	"A constructive geometry for computer graphics"
-, journal =	"Comput. J."
-, volume =	"??"
-, year =	1972
-, update =	"98.03 bibrelex"
+, author =      "A. Ricci"
+, title =       "A constructive geometry for computer graphics"
+, journal =     "Comput. J."
+, volume =      "??"
+, year =        1972
+, update =      "98.03 bibrelex"
 }
 
 @article{r-arhl3-71
-, author =	"A. Ricci"
-, title =	"An algorithm for the removal of hidden lines in $3$-d scenes"
-, journal =	"Comput. J."
-, volume =	14
-, year =	1971
-, pages =	"375--377"
+, author =      "A. Ricci"
+, title =       "An algorithm for the removal of hidden lines in $3$-d scenes"
+, journal =     "Comput. J."
+, volume =      14
+, year =        1971
+, pages =       "375--377"
 }
 
 @book{r-ms3-77
-, author =	"J. Rice"
-, title =	"Mathematical Software {III}"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1977
+, author =      "J. Rice"
+, title =       "Mathematical Software {III}"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1977
 }
 
 @book{rb-sepue-85
-, author =	"J. R. Rice and R. F. Boisvert"
-, title =	"Solving Elliptical Problems Using {ELLPACK}"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1985
-, update =	"95.05 agarwal"
+, author =      "J. R. Rice and R. F. Boisvert"
+, title =       "Solving Elliptical Problems Using {ELLPACK}"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1985
+, update =      "95.05 agarwal"
 }
 
 @article{r-fhars-89
-, author =	"D. Richards"
-, title =	"Fast heuristic algorithms for rectilinear {Steiner} trees"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"191--207"
+, author =      "D. Richards"
+, title =       "Fast heuristic algorithms for rectilinear {Steiner} trees"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "191--207"
 }
 
 @techreport{rl-dcps-90
-, author =	"D. Richards and A. L. Liestman"
-, title =	"Degree-Constrained Pyramid Spanners"
-, type =	"Technical Report"
-, number =	"TR-90-16"
-, institution =	"University of Virginia"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "D. Richards and A. L. Liestman"
+, title =       "Degree-Constrained Pyramid Spanners"
+, type =        "Technical Report"
+, number =      "TR-90-16"
+, institution = "University of Virginia"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @article{rs-msttp-99
-, author =	"D. Richards and J. S. Salowe"
-, title =	"Mixed Spanning Trees in Theory and Practice"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, number =	3
-, month =	jun
-, year =	1999
-, pages =	"277--292"
-, update =	"99.07 held+smid"
+, author =      "D. Richards and J. S. Salowe"
+, title =       "Mixed Spanning Trees in Theory and Practice"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, number =      3
+, month =       jun
+, year =        1999
+, pages =       "277--292"
+, update =      "99.07 held+smid"
 }
 
 @article{rs-ltacr-92
-, author =	"D. S. Richards and J. S. Salowe"
-, title =	"A linear-time algorithm to construct a rectilinear {Steiner} minimal tree for $k$-extremal point sets"
-, journal =	"Algorithmica"
-, volume =	7
-, year =	1992
-, pages =	"247--276"
-, update =	"94.09 smid"
+, author =      "D. S. Richards and J. S. Salowe"
+, title =       "A linear-time algorithm to construct a rectilinear {Steiner} minimal tree for $k$-extremal point sets"
+, journal =     "Algorithmica"
+, volume =      7
+, year =        1992
+, pages =       "247--276"
+, update =      "94.09 smid"
 }
 
 @inproceedings{rs-rsmta-90
-, author =	"D. S. Richards and J. S. Salowe"
-, title =	"A rectilinear {Steiner} minimal tree algorithm for convex point sets"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"201--212"
+, author =      "D. S. Richards and J. S. Salowe"
+, title =       "A rectilinear {Steiner} minimal tree algorithm for convex point sets"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "201--212"
 }
 
 @article{rs-sphtr-91
-, author =	"D. S. Richards and J. S. Salowe"
-, title =	"A simple proof of {Hwang's} theorem for rectilinear {Steiner} minimal tree"
-, journal =	"Ann. Oper. Res."
-, volume =	33
-, year =	1991
-, pages =	"549--556"
-, update =	"98.11 bibrelex"
+, author =      "D. S. Richards and J. S. Salowe"
+, title =       "A simple proof of {Hwang's} theorem for rectilinear {Steiner} minimal tree"
+, journal =     "Ann. Oper. Res."
+, volume =      33
+, year =        1991
+, pages =       "549--556"
+, update =      "98.11 bibrelex"
 }
 
 @article{rs-sqdos-92
-, author =	"D. S. Richards and J. S. Salowe"
-, title =	"Stacks, queues, and deques with order-statistic operations"
-, journal =	"Acta Inform."
-, volume =	29
-, year =	1992
-, pages =	"395--414"
-, update =	"94.09 smid"
+, author =      "D. S. Richards and J. S. Salowe"
+, title =       "Stacks, queues, and deques with order-statistic operations"
+, journal =     "Acta Inform."
+, volume =      29
+, year =        1992
+, pages =       "395--414"
+, update =      "94.09 smid"
 }
 
 @article{r-avpps-77
-, author =	"F. M. Richards"
-, title =	"Areas, volumes, packing, and protein structure"
-, journal =	"Annu. Rev. Biophys. Bioeng."
-, volume =	6
-, year =	1977
-, pages =	"151--176"
-, update =	"98.03 agarwal+bibrelex"
+, author =      "F. M. Richards"
+, title =       "Areas, volumes, packing, and protein structure"
+, journal =     "Annu. Rev. Biophys. Bioeng."
+, volume =      6
+, year =        1977
+, pages =       "151--176"
+, update =      "98.03 agarwal+bibrelex"
 }
 
 @article{r-ipstv-74
-, author =	"F. M. Richards"
-, title =	"The Interpretation of Protein Structures: Total Volume, Group Volume Distributions and Packing Density"
-, journal =	"Journal of Molecular Biology"
-, volume =	82
-, year =	1974
-, pages =	"1--14"
-, annote =	"Voronoi polyhedron models volume of an atom. VP
-		 calculated with $O(N^3)$ iterative algorithm."
+, author =      "F. M. Richards"
+, title =       "The Interpretation of Protein Structures: Total Volume, Group Volume Distributions and Packing Density"
+, journal =     "Journal of Molecular Biology"
+, volume =      82
+, year =        1974
+, pages =       "1--14"
+, annote =      "Voronoi polyhedron models volume of an atom. VP
+                 calculated with $O(N^3)$ iterative algorithm."
 }
 
 @phdthesis{r-scsrp-87
-, author =	"R. F. Richbourg"
-, title =	"Solving a Class of Spatial Reasoning Problems: {Minimal}-Cost Path Planning in the Cartesian Plane"
-, school =	"Naval Postgraduate School"
-, address =	"Monterey, CA"
-, year =	1987
-, keywords =	"doctoral thesis"
-, update =	"93.09 milone+mitchell"
+, author =      "R. F. Richbourg"
+, title =       "Solving a Class of Spatial Reasoning Problems: {Minimal}-Cost Path Planning in the Cartesian Plane"
+, school =      "Naval Postgraduate School"
+, address =     "Monterey, CA"
+, year =        1987
+, keywords =    "doctoral thesis"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{rrz-eccsg-86
-, author =	"R. F. Richbourg and N. C. Rowe and M. J. Zyda"
-, title =	"Exploiting Capability Constraints To Solve Global, Two-Dimensional Path Planning Problems"
-, type =	"Technical {Report}"
-, number =	"NPS-86-006"
-, institution =	"Department of Computer Science, Naval Postgraduate School"
-, year =	1986
-, update =	"93.09 milone+mitchell"
+, author =      "R. F. Richbourg and N. C. Rowe and M. J. Zyda"
+, title =       "Exploiting Capability Constraints To Solve Global, Two-Dimensional Path Planning Problems"
+, type =        "Technical {Report}"
+, number =      "NPS-86-006"
+, institution = "Department of Computer Science, Naval Postgraduate School"
+, year =        1986
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{rrzm-sgtdr-87
-, author =	"R. F. Richbourg and N. C. Rowe and M. J. Zyda and R. McGhee"
-, title =	"Solving Global Two-Dimensional Routing Problems Using {Snell's} law"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Raleigh, NC"
-, year =	1987
-, pages =	"1631--1636"
-, update =	"93.09 milone+mitchell"
+, author =      "R. F. Richbourg and N. C. Rowe and M. J. Zyda and R. McGhee"
+, title =       "Solving Global Two-Dimensional Routing Problems Using {Snell's} law"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Raleigh, NC"
+, year =        1987
+, pages =       "1631--1636"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{rrn-arpld-80
-, author =	"M. Richetin and G. Rives and M. Naranjo"
-, title =	"Algorithm rapide pour la determination des $k$ plus proches voisins"
-, journal =	"RAIRO Inform. Theor."
-, volume =	14
-, year =	1980
-, pages =	"369--378"
+, author =      "M. Richetin and G. Rives and M. Naranjo"
+, title =       "Algorithm rapide pour la determination des $k$ plus proches voisins"
+, journal =     "RAIRO Inform. Theor."
+, volume =      14
+, year =        1980
+, pages =       "369--378"
 }
 
 @article{r-colwd-93
-, author =	"J. Richter-Gebert"
-, title =	"Combinatorial obstructions to the lifting of weaving diagrams"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"287--312"
-, update =	"96.05 pocchiola"
+, author =      "J. Richter-Gebert"
+, title =       "Combinatorial obstructions to the lifting of weaving diagrams"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "287--312"
+, update =      "96.05 pocchiola"
 }
 
 @article{r-omfm-93
-, author =	"J. Richter-Gebert"
-, title =	"Oriented matroids with few mutations"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"251--269"
-, update =	"96.05 pocchiola"
+, author =      "J. Richter-Gebert"
+, title =       "Oriented matroids with few mutations"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "251--269"
+, update =      "96.05 pocchiola"
 }
 
 @incollection{rgz-om-97
-, author =	"J. Richter-Gebert and G. M. Ziegler"
-, title =	"Oriented matroids"
-, chapter =	6
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"111--132"
-, update =	"97.11 orourke"
+, author =      "J. Richter-Gebert and G. M. Ziegler"
+, title =       "Oriented matroids"
+, chapter =     6
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "111--132"
+, update =      "97.11 orourke"
 }
 
 @article{rz-rspu-95
-, author =	"J. Richter-Gebert and G. M. Ziegler"
-, title =	"Realization spaces of $4$-polytopes are universal"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	32
-, number =	4
-, month =	oct
-, year =	1995
-, update =	"96.05 pocchiola"
+, author =      "J. Richter-Gebert and G. M. Ziegler"
+, title =       "Realization spaces of $4$-polytopes are universal"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      32
+, number =      4
+, month =       oct
+, year =        1995
+, update =      "96.05 pocchiola"
 }
 
 @article{rohg-nrgdv-88
-, author =	"R. Riedinger and P. Oelhafen and M. Habar and H. J. Guntherodt"
-, title =	"A New Realization of the Global {Delaunay}-{Voronoi} Tessellation in Arbitrary Dimension"
-, journal =	"Zeitschrift Fur Physikalische Chemie Neue Folge"
-, volume =	157
-, number =	"P1"
-, year =	1988
-, pages =	"47--51"
-, annote =	"Insertion algorithm?"
+, author =      "R. Riedinger and P. Oelhafen and M. Habar and H. J. Guntherodt"
+, title =       "A New Realization of the Global {Delaunay}-{Voronoi} Tessellation in Arbitrary Dimension"
+, journal =     "Zeitschrift Fur Physikalische Chemie Neue Folge"
+, volume =      157
+, number =      "P1"
+, year =        1988
+, pages =       "47--51"
+, annote =      "Insertion algorithm?"
 }
 
 @article{rohg-advt-88
-, author =	"R. Riedinger and P. Oelhafen and M. Habar and H. J. Guntherodt"
-, title =	"About the {Delaunay}-{Voronoi} Tessellation"
-, journal =	"J. Comput. Phys."
-, volume =	74
-, number =	1
-, year =	1988
-, pages =	"61--72"
-, annote =	"Circumsphere (selection) algorithm."
+, author =      "R. Riedinger and P. Oelhafen and M. Habar and H. J. Guntherodt"
+, title =       "About the {Delaunay}-{Voronoi} Tessellation"
+, journal =     "J. Comput. Phys."
+, volume =      74
+, number =      1
+, year =        1988
+, pages =       "61--72"
+, annote =      "Circumsphere (selection) algorithm."
 }
 
 @techreport{r-absag-73
-, author =	"R. Riesenfeld"
-, title =	"Applications of {B}-spline approximation to geometric problems of computer-aided design"
-, type =	"Technical {Report}"
-, number =	"UTEC-CS-73-126"
-, institution =	"Dept. Comput. Sci., Univ. Utah"
-, address =	"Salt Lake City, UT"
-, year =	1973
+, author =      "R. Riesenfeld"
+, title =       "Applications of {B}-spline approximation to geometric problems of computer-aided design"
+, type =        "Technical {Report}"
+, number =      "UTEC-CS-73-126"
+, institution = "Dept. Comput. Sci., Univ. Utah"
+, address =     "Salt Lake City, UT"
+, year =        1973
 }
 
 @article{r-hcppc-81
-, author =	"R. F. Riesenfeld"
-, title =	"Homogeneous Coordinates and Projective Planes in Computer Graphics"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	1
-, year =	1981
-, pages =	"50--55"
-, update =	"99.03 forrest, 98.11 ghali"
+, author =      "R. F. Riesenfeld"
+, title =       "Homogeneous Coordinates and Projective Planes in Computer Graphics"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      1
+, year =        1981
+, pages =       "50--55"
+, update =      "99.03 forrest, 98.11 ghali"
 }
 
 @article{rsp-sbmc-91
-, author =	"R. Ringeisen and S. Stueckle and B. Piazza"
-, title =	"Subgraphs and bounds on maximum crossings"
-, journal =	"Bulletin of the Institute for Combinatorics and its Applications"
-, volume =	2
-, year =	1991
-, pages =	"33--46"
-, update =	"98.03 bibrelex"
+, author =      "R. Ringeisen and S. Stueckle and B. Piazza"
+, title =       "Subgraphs and bounds on maximum crossings"
+, journal =     "Bulletin of the Institute for Combinatorics and its Applications"
+, volume =      2
+, year =        1991
+, pages =       "33--46"
+, update =      "98.03 bibrelex"
 }
 
 @book{r-mct-74
-, author =	"G. Ringel"
-, title =	"Map-color theorem"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1974
-, update =	"98.07 bibrelex"
+, author =      "G. Ringel"
+, title =       "Map-color theorem"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1974
+, update =      "98.07 bibrelex"
 }
 
 @article{r-msp-72
-, author =	"B. D. Ripley"
-, title =	"Modelling spatial patterns"
-, journal =	"J. Roy. Statist. Soc. Ser. B"
-, volume =	39
-, year =	1972
-, pages =	"172--192"
+, author =      "B. D. Ripley"
+, title =       "Modelling spatial patterns"
+, journal =     "J. Roy. Statist. Soc. Ser. B"
+, volume =      39
+, year =        1972
+, pages =       "172--192"
 }
 
 @article{r-lttcb-92
-, author =	"Samuel Rippa"
-, title =	"Long And Thin Triangles Can Be Good For Linear Interpolation"
-, journal =	"SIAM J. Numer. Anal."
-, volume =	29
-, number =	1
-, month =	feb
-, year =	1992
-, pages =	"257--270"
-, keywords =	"piecewise linear interpolation surface (plis), triangulations"
-, abstract =	"Given a set of data points in R**2 and corresponding
-		 data values, it is clear that the quality of a
-		 Piecewise Linear Interpolation Surface (PLIS) over
-		 triangles depends on the specific triangulation of the
-		 data points. In this paper, the question of what are
-		 good triangles (and triangulations) for linear
-		 interpolation is studied further. First, the model
-		 problem of constructing optimal triangulations for
-		 interpolating quadratic functions by PLIS is
-		 considered. Next, a new interpretation of existing
-		 error bounds for interpolating general smooth functions
-		 by PLIS is studied. The conclusion is that triangles
-		 should be long in directions where the magnitude of the
-		 second directional derivative of F is small and thin in
-		 directions where the magnitude of the second
-		 directional derivative of F is large. (Author abstract)
-		 17 Refs."
+, author =      "Samuel Rippa"
+, title =       "Long And Thin Triangles Can Be Good For Linear Interpolation"
+, journal =     "SIAM J. Numer. Anal."
+, volume =      29
+, number =      1
+, month =       feb
+, year =        1992
+, pages =       "257--270"
+, keywords =    "piecewise linear interpolation surface (plis), triangulations"
+, abstract =    "Given a set of data points in R**2 and corresponding
+                 data values, it is clear that the quality of a
+                 Piecewise Linear Interpolation Surface (PLIS) over
+                 triangles depends on the specific triangulation of the
+                 data points. In this paper, the question of what are
+                 good triangles (and triangulations) for linear
+                 interpolation is studied further. First, the model
+                 problem of constructing optimal triangulations for
+                 interpolating quadratic functions by PLIS is
+                 considered. Next, a new interpretation of existing
+                 error bounds for interpolating general smooth functions
+                 by PLIS is studied. The conclusion is that triangles
+                 should be long in directions where the magnitude of the
+                 second directional derivative of F is small and thin in
+                 directions where the magnitude of the second
+                 directional derivative of F is large. (Author abstract)
+                 17 Refs."
 }
 
 @article{r-mrpdt-90
-, author =	"Samuel Rippa"
-, title =	"Minimal Roughness Property of the {Delaunay} Triangulation"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	7
-, year =	1990
-, pages =	"489--497"
-, annote =	"If we use a triangulation to define a surface, the
-		 roughness measure is the $l_2$ norm squared of the
-		 surface. Proves that DT minimizes roughness,
-		 irrespective of height. Key point: is that if we call
-		 the distances between each vertex and the intersection
-		 of the diagonals a,b,c,d then quad is cyclic iff ac =
-		 bd"
+, author =      "Samuel Rippa"
+, title =       "Minimal Roughness Property of the {Delaunay} Triangulation"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      7
+, year =        1990
+, pages =       "489--497"
+, annote =      "If we use a triangulation to define a surface, the
+                 roughness measure is the $l_2$ norm squared of the
+                 surface. Proves that DT minimizes roughness,
+                 irrespective of height. Key point: is that if we call
+                 the distances between each vertex and the intersection
+                 of the diagonals a,b,c,d then quad is cyclic iff ac =
+                 bd"
 }
 
 @article{rs-metep-90
-, author =	"S. Rippa and B. Schiff"
-, title =	"Minimum Energy Triangulations for Elliptic Problems"
-, journal =	"Computer Methods in Applied Mechanics and Engineering"
-, volume =	84
-, year =	1990
-, pages =	"257--274"
-, annote =	"MET is triangulation that minimizes some energy
-		 function $J$. Shows that DT minimizes Laplace
-		 functional. Switchings to improve triangulation."
-, abstract =	"We consider the family of finite element spaces of
-		 fixed dimension, defined over all triangulations of a
-		 given polygonal domain in $R^2$, based on a common set
-		 of nodes (vertices). A minimum energy triangulation,
-		 relative to a given elliptic problem, is a
-		 triangulation for which the finite element solution has
-		 the minimal energy. The minimum energy triangulation
-		 can be considered optimal, as it minimizes the solution
-		 error in the natural norm associated with the problem.
-		 It is shown in this paper that the well-known Delaunay
-		 triangulation of a set of points in $R^2$ is a minimum
-		 energy triangulation for the energy functional
-		 associated with the nonhomogeneous Laplace equation.
-		 Minimum energy triangulations may be very expensive to
-		 compute. In this paper, therefore, we present
-		 algorithms for constructing locally minimal energy
-		 triangulations and outline efficient schemes for
-		 computing suboptimal triangulations. In both cases the
-		 basic idea is to improve an initial triangulation by
-		 using local operations on the edges of the
-		 triangulation. It is shown for several model problems
-		 that such sub- minimal energy triangulations can
-		 significantly improve the quality of the approximate
-		 solution. (Author abstract) 13 Refs."
+, author =      "S. Rippa and B. Schiff"
+, title =       "Minimum Energy Triangulations for Elliptic Problems"
+, journal =     "Computer Methods in Applied Mechanics and Engineering"
+, volume =      84
+, year =        1990
+, pages =       "257--274"
+, annote =      "MET is triangulation that minimizes some energy
+                 function $J$. Shows that DT minimizes Laplace
+                 functional. Switchings to improve triangulation."
+, abstract =    "We consider the family of finite element spaces of
+                 fixed dimension, defined over all triangulations of a
+                 given polygonal domain in $R^2$, based on a common set
+                 of nodes (vertices). A minimum energy triangulation,
+                 relative to a given elliptic problem, is a
+                 triangulation for which the finite element solution has
+                 the minimal energy. The minimum energy triangulation
+                 can be considered optimal, as it minimizes the solution
+                 error in the natural norm associated with the problem.
+                 It is shown in this paper that the well-known Delaunay
+                 triangulation of a set of points in $R^2$ is a minimum
+                 energy triangulation for the energy functional
+                 associated with the nonhomogeneous Laplace equation.
+                 Minimum energy triangulations may be very expensive to
+                 compute. In this paper, therefore, we present
+                 algorithms for constructing locally minimal energy
+                 triangulations and outline efficient schemes for
+                 computing suboptimal triangulations. In both cases the
+                 basic idea is to improve an initial triangulation by
+                 using local operations on the edges of the
+                 triangulation. It is shown for several model problems
+                 that such sub- minimal energy triangulations can
+                 significantly improve the quality of the approximate
+                 solution. (Author abstract) 13 Refs."
 }
 
 @techreport{r-nhvg-91
-, author =	"J. Rippel"
-, title =	"A non-{Hamiltonian} visibility graph"
-, number =	009
-, institution =	"Smith College"
-, year =	1991
-, update =	"93.09 milone+mitchell"
+, author =      "J. Rippel"
+, title =       "A non-{Hamiltonian} visibility graph"
+, number =      009
+, institution = "Smith College"
+, year =        1991
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{r-pcp-91
-, author =	"J. Risler"
-, title =	"Placement of Curved Polygons"
-, type =	"Report"
-, number =	"LMENS-91 -2"
-, institution =	"Laboratoire de Math{\'e}matiques, Ecole Normale Sup{\'e}rieure"
-, address =	"UA 762 du CNRS"
-, year =	1991
-, update =	"96.05 ramkumar"
+, author =      "J. Risler"
+, title =       "Placement of Curved Polygons"
+, type =        "Report"
+, number =      "LMENS-91 -2"
+, institution = "Laboratoire de Math{\'e}matiques, Ecole Normale Sup{\'e}rieure"
+, address =     "UA 762 du CNRS"
+, year =        1991
+, update =      "96.05 ramkumar"
 }
 
 @article{r-trcad-89
-, author =	"T. Risse"
-, title =	"Hough Transform for Line Recognition: Complexity of Evidence Accumulation and Cluster Detection"
-, journal =	"Computer Vision"
-, volume =	46
-, year =	1989
-, pages =	"327--345"
-, update =	"98.07 bibrelex"
+, author =      "T. Risse"
+, title =       "Hough Transform for Line Recognition: Complexity of Evidence Accumulation and Cluster Detection"
+, journal =     "Computer Vision"
+, volume =      46
+, year =        1989
+, pages =       "327--345"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{rs-rtsaf-93
-, author =	"T. Risset and S. W. Song"
-, title =	"A real-time systolic algorithm for on-the-fly hidden surface removal"
-, booktitle =	"Proc. 1993 Internat. Conf. Application-Specific Array Processors, Venice, Italy"
-, nickname =	"ASAP"
-, month =	oct
-, year =	1993
-, pages =	"??"
-, keywords =	"parallel computation"
-, comments =	"to appear"
-, update =	"93.09 rote"
+, author =      "T. Risset and S. W. Song"
+, title =       "A real-time systolic algorithm for on-the-fly hidden surface removal"
+, booktitle =   "Proc. 1993 Internat. Conf. Application-Specific Array Processors, Venice, Italy"
+, nickname =    "ASAP"
+, month =       oct
+, year =        1993
+, pages =       "??"
+, keywords =    "parallel computation"
+, comments =    "to appear"
+, update =      "93.09 rote"
 }
 
 @book{r-da-50
-, author =	"J. F. Ritt"
-, title =	"Differential Algebra"
-, series =	"Colloquium Publications"
-, volume =	33
-, publisher =	"American Mathematical Society"
-, address =	"New York, NY"
-, year =	1950
-, update =	"98.03 bibrelex"
+, author =      "J. F. Ritt"
+, title =       "Differential Algebra"
+, series =      "Colloquium Publications"
+, volume =      33
+, publisher =   "American Mathematical Society"
+, address =     "New York, NY"
+, year =        1950
+, update =      "98.03 bibrelex"
 }
 
 @book{r-deas-32
-, author =	"J. F. Ritt"
-, title =	"Differential Equations from the Algebraic Standpoint"
-, series =	"Colloquium Publications"
-, volume =	14
-, publisher =	"American Mathematical Society"
-, address =	"New York, NY"
-, year =	1932
-, update =	"98.03 bibrelex"
+, author =      "J. F. Ritt"
+, title =       "Differential Equations from the Algebraic Standpoint"
+, series =      "Colloquium Publications"
+, volume =      14
+, publisher =   "American Mathematical Society"
+, address =     "New York, NY"
+, year =        1932
+, update =      "98.03 bibrelex"
 }
 
 @article{rwli-asnnd-75
-, author =	"G. L. Ritter and H. B. Woodruff and S. R. Lowry and T. L. Isenhour"
-, title =	"An algorithm for the selective nearest neighbor decision rule"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	"IT-21"
-, year =	1975
-, pages =	"665--669"
+, author =      "G. L. Ritter and H. B. Woodruff and S. R. Lowry and T. L. Isenhour"
+, title =       "An algorithm for the selective nearest neighbor decision rule"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      "IT-21"
+, year =        1975
+, pages =       "665--669"
 }
 
 @incollection{r-gdsos-89
-, author =	"I. Rival"
-, title =	"Graphical Data Structures for Ordered Sets"
-, editor =	"I. Rival"
-, booktitle =	"Algorithms and Order"
-, publisher =	"Kluwer Academic Publishers"
-, year =	1989
-, pages =	"3--31"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "I. Rival"
+, title =       "Graphical Data Structures for Ordered Sets"
+, editor =      "I. Rival"
+, booktitle =   "Algorithms and Order"
+, publisher =   "Kluwer Academic Publishers"
+, year =        1989
+, pages =       "3--31"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @incollection{r-rdo-93
-, author =	"I. Rival"
-, title =	"Reading, Drawing, and Order"
-, editor =	"I. G. Rosenberg and G. Sabidussi"
-, booktitle =	"Algebras and Orders"
-, publisher =	"Kluwer Academic Publishers"
-, year =	1993
-, pages =	"359--404"
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia"
+, author =      "I. Rival"
+, title =       "Reading, Drawing, and Order"
+, editor =      "I. G. Rosenberg and G. Sabidussi"
+, booktitle =   "Algebras and Orders"
+, publisher =   "Kluwer Academic Publishers"
+, year =        1993
+, pages =       "359--404"
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia"
 }
 
 @incollection{r-d-85
-, author =	"I. Rival"
-, title =	"The Diagram"
-, editor =	"I. Rival"
-, booktitle =	"Graphs and Orders"
-, publisher =	"Reidel Publishing"
-, year =	1985
-, pages =	"103--133"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "I. Rival"
+, title =       "The Diagram"
+, editor =      "I. Rival"
+, booktitle =   "Graphs and Orders"
+, publisher =   "Reidel Publishing"
+, year =        1985
+, pages =       "103--133"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{ru-ommts-89
-, author =	"I. Rival and J. Urrutia"
-, title =	"Order models for motion in three-space"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	33
-, keywords =	"motion planning"
+, author =      "I. Rival and J. Urrutia"
+, title =       "Order models for motion in three-space"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       33
+, keywords =    "motion planning"
 }
 
 @article{ru-roptc-88
-, author =	"I. Rival and J. Urrutia"
-, title =	"Representing Orders on the Plane by Translating Convex Figures"
-, journal =	"Order"
-, volume =	4
-, year =	1988
-, pages =	"319--339"
-, update =	"97.11 bibrelex"
+, author =      "I. Rival and J. Urrutia"
+, title =       "Representing Orders on the Plane by Translating Convex Figures"
+, journal =     "Order"
+, volume =      4
+, year =        1988
+, pages =       "319--339"
+, update =      "97.11 bibrelex"
 }
 
 @article{rw-lfgpo-79
-, author =	"I. Rival and R. Wille"
-, title =	"Lattices Freely Generated by Partially Ordered Sets: Which can be Drawn?"
-, journal =	"J. Reine Angew. Math."
-, volume =	310
-, year =	1979
-, pages =	"56--80"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "I. Rival and R. Wille"
+, title =       "Lattices Freely Generated by Partially Ordered Sets: Which can be Drawn?"
+, journal =     "J. Reine Angew. Math."
+, volume =      310
+, year =        1979
+, pages =       "56--80"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{r-dtrp-93
-, author =	"Maria-Cecilia Rivara"
-, title =	"A Discussion on the Triangulation Refinement Problem"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"42--47"
-, cites =	"bde-tpwla-92, bc-mgrfc-92, ps-cgi-85, r-ddsfa-84, r-artgs-84, r-srdas-89, r-lmmam-91, rs-lbatc-75, ir-scstp-92, r-ggb4t-87, rl-3rasa-92, s-fcbmt-80, ZZZ"
-, update =	"98.11 bibrelex"
+, author =      "Maria-Cecilia Rivara"
+, title =       "A Discussion on the Triangulation Refinement Problem"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "42--47"
+, cites =       "bde-tpwla-92, bc-mgrfc-92, ps-cgi-85, r-ddsfa-84, r-artgs-84, r-srdas-89, r-lmmam-91, rs-lbatc-75, ir-scstp-92, r-ggb4t-87, rl-3rasa-92, s-fcbmt-80, ZZZ"
+, update =      "98.11 bibrelex"
 }
 
 @article{r-ggb4t-87
-, author =	"M. C. Rivara"
-, title =	"A Grid Generator Based on 4-Triangles Conforming Mesh-Refinement Algorithms"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	24
-, number =	7
-, year =	1987
-, pages =	"1343--1354"
-, annote =	"Works by subdividing triangles."
+, author =      "M. C. Rivara"
+, title =       "A Grid Generator Based on 4-Triangles Conforming Mesh-Refinement Algorithms"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      24
+, number =      7
+, year =        1987
+, pages =       "1343--1354"
+, annote =      "Works by subdividing triangles."
 }
 
 @article{r-artgs-84
-, author =	"M. C. Rivara"
-, title =	"Algorithms for refining triangular grids suitable for adaptive and multigrid techniques"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	20
-, year =	1984
-, pages =	"745--756"
-, update =	"94.05 orourke"
-, annote =	"Repeatedly bisects longest side of triangle"
+, author =      "M. C. Rivara"
+, title =       "Algorithms for refining triangular grids suitable for adaptive and multigrid techniques"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      20
+, year =        1984
+, pages =       "745--756"
+, update =      "94.05 orourke"
+, annote =      "Repeatedly bisects longest side of triangle"
 }
 
 @article{r-ddsfa-84
-, author =	"M. C. Rivara"
-, title =	"Design and data structure of fully adaptive multigrid, finite-element software"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	10
-, year =	1984
-, pages =	"242--264"
-, update =	"98.11 bibrelex"
+, author =      "M. C. Rivara"
+, title =       "Design and data structure of fully adaptive multigrid, finite-element software"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      10
+, year =        1984
+, pages =       "242--264"
+, update =      "98.11 bibrelex"
 }
 
 @article{r-lmmam-91
-, author =	"M. C. Rivara"
-, title =	"Local modification of meshes for adaptive and/or multigrid finite element methods"
-, journal =	"J. Comp. Appl. Math."
-, volume =	36
-, year =	1991
-, pages =	"79--89"
-, update =	"98.11 bibrelex"
+, author =      "M. C. Rivara"
+, title =       "Local modification of meshes for adaptive and/or multigrid finite element methods"
+, journal =     "J. Comp. Appl. Math."
+, volume =      36
+, year =        1991
+, pages =       "79--89"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{r-nmttr-96
-, author =	"Maria-Cecilia Rivara"
-, title =	"New mathematical tool and techniques for the refinement and/or improvement of unstructured triangulations"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"77--86"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Maria-Cecilia Rivara"
+, title =       "New mathematical tool and techniques for the refinement and/or improvement of unstructured triangulations"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "77--86"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @inproceedings{r-np3le-99
-, author =	"Mar{\'\i}a-Cecilia Rivara"
-, title =	"Nondegeneracy Properties of {3D} Longest-Edge Algorithms for the Quality Refinement of Triangulations"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"73--75"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Mar{\'\i}a-Cecilia Rivara"
+, title =       "Nondegeneracy Properties of {3D} Longest-Edge Algorithms for the Quality Refinement of Triangulations"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "73--75"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{r-ngnsg-87
-, author =	"Mar{\'\i}a-Cecilia Rivara"
-, title =	"Numerical Generation of Nested Series of General Triangular Grids"
-, editor =	"C. K. Chui and L. L. Schumaker and F. I. Utreras"
-, booktitle =	"Topics in Multivariate Approximation"
-, publisher =	"Academic Press"
-, address =	"New York"
-, year =	1987
-, pages =	"193--206"
-, annote =	"Basic idea is to split a triangle with an edge to the
-		 centre of its longest side. This can then trigger
-		 further splits to remove non conforming points.
-		 Resulting should be as good as the original one."
+, author =      "Mar{\'\i}a-Cecilia Rivara"
+, title =       "Numerical Generation of Nested Series of General Triangular Grids"
+, editor =      "C. K. Chui and L. L. Schumaker and F. I. Utreras"
+, booktitle =   "Topics in Multivariate Approximation"
+, publisher =   "Academic Press"
+, address =     "New York"
+, year =        1987
+, pages =       "193--206"
+, annote =      "Basic idea is to split a triangle with an edge to the
+                 centre of its longest side. This can then trigger
+                 further splits to remove non conforming points.
+                 Resulting should be as good as the original one."
 }
 
 @article{r-srdas-89
-, author =	"M. C. Rivara"
-, title =	"Selctive refinement/derefinement algorithms for sequences of nested triangulations"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	"??"
-, year =	1989
-, pages =	"2289--2906"
-, update =	"98.11 bibrelex"
+, author =      "M. C. Rivara"
+, title =       "Selctive refinement/derefinement algorithms for sequences of nested triangulations"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      "??"
+, year =        1989
+, pages =       "2289--2906"
+, update =      "98.11 bibrelex"
 }
 
 @article{rl-3rasa-92
-, author =	"M. C. Rivara and C. Levin"
-, title =	"A 3-{D} refinement algorithm suitable for adaptive and multigrid techniques"
-, journal =	"Comm. Applied Numer. Meth."
-, volume =	8
-, year =	1992
-, pages =	"281--290"
-, update =	"98.11 bibrelex"
+, author =      "M. C. Rivara and C. Levin"
+, title =       "A 3-{D} refinement algorithm suitable for adaptive and multigrid techniques"
+, journal =     "Comm. Applied Numer. Meth."
+, volume =      8
+, year =        1992
+, pages =       "281--290"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ri-dmlsm-95
-, author =	"Mari'a-Cecilia Rivara and Patricio Inostroza"
-, title =	"A Discussion on Mixed (Longest-Side Midpoint Insertion) {Delaunay} Techniques for the Triangulation Refinement Problem"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"335--346"
-, update =	"96.01 samitchell"
+, author =      "Mari'a-Cecilia Rivara and Patricio Inostroza"
+, title =       "A Discussion on Mixed (Longest-Side Midpoint Insertion) {Delaunay} Techniques for the Triangulation Refinement Problem"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "335--346"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{r-nspcs-90
-, author =	"E. Rivera-Campo"
-, title =	"A note on separation of plane convex sets"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"78--80"
-, cites =	"t-sppcs-79, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "E. Rivera-Campo"
+, title =       "A note on separation of plane convex sets"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "78--80"
+, cites =       "t-sppcs-79, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ru-ntgsp-97
-, author =	"Eduardo Rivera-Campo and Virginia Urrutia-Galicia"
-, title =	"A Note on the Tree Graph of a Set of Points in the Plane"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"46--49"
-, update =	"97.11 jones"
+, author =      "Eduardo Rivera-Campo and Virginia Urrutia-Galicia"
+, title =       "A Note on the Tree Graph of a Set of Points in the Plane"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "46--49"
+, update =      "97.11 jones"
 }
 
 @article{ru-hcpgs-01
-, author =	"E. Rivera-Campo and V. Urrutia-Galicia"
-, title =	"Hamilton cycles in the path graph of a set of points in convex position"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	18
-, year =	2001
-, pages =	"65--72"
-, update =	"01.07 smid"
+, author =      "E. Rivera-Campo and V. Urrutia-Galicia"
+, title =       "Hamilton cycles in the path graph of a set of points in convex position"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      18
+, year =        2001
+, pages =       "65--72"
+, update =      "01.07 smid"
 }
 
 @inproceedings{ru-pcp-91
-, author =	"E. Rivera-Campo and J. Urrutia"
-, title =	"A property of convex polygons"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"203--206"
-, cites =	"ers-ccsno-90, f-icd-77, hk-spcs-90, r-nspcs-90, t-sppcs-79, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "E. Rivera-Campo and J. Urrutia"
+, title =       "A property of convex polygons"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "203--206"
+, cites =       "ers-ccsno-90, f-icd-77, hk-spcs-90, r-nspcs-90, t-sppcs-79, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{ri-eaade-84
-, author =	"J. Rivero and A. Inselberg"
-, title =	"Extensi{\'o}n al an{\'a}sis del espacio de fase de sistemas dina{\'a}micos por las coordenadas paralelas"
-, type =	"Report"
-, number =	"??"
-, institution =	"IBM Los Angeles Sci. Center"
-, address =	"Los Angeles, CA"
-, year =	1984
+, author =      "J. Rivero and A. Inselberg"
+, title =       "Extensi{\'o}n al an{\'a}sis del espacio de fase de sistemas dina{\'a}micos por las coordenadas paralelas"
+, type =        "Report"
+, number =      "??"
+, institution = "IBM Los Angeles Sci. Center"
+, address =     "Los Angeles, CA"
+, year =        1984
 }
 
 @techreport{r-aara-74
-, author =	"R. L. Rivest"
-, title =	"Analysis of associative retrieval algorithms"
-, type =	"Report"
-, number =	"STAN-CS-74-415"
-, institution =	"Dept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1974
+, author =      "R. L. Rivest"
+, title =       "Analysis of associative retrieval algorithms"
+, type =        "Report"
+, number =      "STAN-CS-74-415"
+, institution = "Dept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1974
 }
 
 @inproceedings{r-hcapm-74
-, author =	"R. L. Rivest"
-, title =	"On hash-coding algorithms for partial-match retrieval"
-, booktitle =	"Proc. 15th Annu. IEEE Sympos. Switching Automata Theory"
-, year =	1974
-, pages =	"95--103"
-, precedes =	"r-pmra-76"
+, author =      "R. L. Rivest"
+, title =       "On hash-coding algorithms for partial-match retrieval"
+, booktitle =   "Proc. 15th Annu. IEEE Sympos. Switching Automata Theory"
+, year =        1974
+, pages =       "95--103"
+, precedes =    "r-pmra-76"
 }
 
 @incollection{r-oeapb-74
-, author =	"R. L. Rivest"
-, title =	"On the optimality of {Elias}'s algorithm for performing best-match searches"
-, booktitle =	"Information Processing"
-, publisher =	"North-Holland"
-, year =	1974
-, pages =	"678--681"
-, update =	"98.03 bibrelex"
+, author =      "R. L. Rivest"
+, title =       "On the optimality of {Elias}'s algorithm for performing best-match searches"
+, booktitle =   "Information Processing"
+, publisher =   "North-Holland"
+, year =        1974
+, pages =       "678--681"
+, update =      "98.03 bibrelex"
 }
 
 @article{r-pmra-76
-, author =	"R. L. Rivest"
-, title =	"Partial-match retrieval algorithms"
-, journal =	"SIAM J. Comput."
-, volume =	5
-, year =	1976
-, pages =	"19--50"
-, succeeds =	"r-hcapm-74"
+, author =      "R. L. Rivest"
+, title =       "Partial-match retrieval algorithms"
+, journal =     "SIAM J. Comput."
+, volume =      5
+, year =        1976
+, pages =       "19--50"
+, succeeds =    "r-hcapm-74"
 }
 
 @inproceedings{r-ppis-82
-, author =	"R. L. Rivest"
-, title =	"The ``{PI}'' (placement and interconnect) system"
-, booktitle =	"Proc. 19th ACM-IEEE Design Automation Conf."
-, year =	1982
-, pages =	"475--481"
+, author =      "R. L. Rivest"
+, title =       "The ``{PI}'' (placement and interconnect) system"
+, booktitle =   "Proc. 19th ACM-IEEE Design Automation Conf."
+, year =        1982
+, pages =       "475--481"
 }
 
 @phdthesis{r-cve2d-97
-, author =	"S. Rivi{\`e}re"
-, title =	"Calculs de Visibilit{\'e} dans un Environnement 2D"
-, school =	"Universit{\'e} Joseph Fourier"
-, address =	"Grenoble, France"
-, year =	1997
-, keywords =	"doctoral thesis"
-, update =	"01.11 pocchiola, 98.07 bibrelex"
+, author =      "S. Rivi{\`e}re"
+, title =       "Calculs de Visibilit{\'e} dans un Environnement 2D"
+, school =      "Universit{\'e} Joseph Fourier"
+, address =     "Grenoble, France"
+, year =        1997
+, keywords =    "doctoral thesis"
+, update =      "01.11 pocchiola, 98.07 bibrelex"
 }
 
 @techreport{r-cddcd-93
-, author =	"S. Rivi{\`e}re"
-, title =	"Comparison d'algorithmes de calcul de graphes de visibilit{\'e}"
-, type =	"Rapport du stage"
-, institution =	"DEA IMA"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "S. Rivi{\`e}re"
+, title =       "Comparison d'algorithmes de calcul de graphes de visibilit{\'e}"
+, type =        "Rapport du stage"
+, institution = "DEA IMA"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{r-ddnic-96
-, author =	"St{\'e}phane Rivi{\`e}re"
-, title =	"Dealing with Degeneracies and Numerical Imprecisions when Computing Visibility Graphs"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"35--38"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "St{\'e}phane Rivi{\`e}re"
+, title =       "Dealing with Degeneracies and Numerical Imprecisions when Computing Visibility Graphs"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "35--38"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{r-dvpsv-97
-, author =	"S. Rivi{\`e}re"
-, title =	"Dynamic visibility in polygonal scenes with the visibility complex"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"421--423"
-, cites =	"dy-rchyd-93, gs-iuvms-96, ol-mcp-81, pv-vc-96, r-vc2dp-97, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "S. Rivi{\`e}re"
+, title =       "Dynamic visibility in polygonal scenes with the visibility complex"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "421--423"
+, cites =       "dy-rchyd-93, gs-iuvms-96, ol-mcp-81, pv-vc-96, r-vc2dp-97, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @techreport{r-ectac-93
-, author =	"S. Rivi{\`e}re"
-, title =	"Experimental comparison of two algorithms for computing visibility graphs"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "S. Rivi{\`e}re"
+, title =       "Experimental comparison of two algorithms for computing visibility graphs"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{r-tsvcp-95
-, author =	"St{\'e}phane Rivi{\`e}re"
-, title =	"Topologically Sweeping the Visibility Complex of Polygonal Scenes"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C36--C37"
-, keywords =	"visibility graph optimal algorithm, experimental"
-, cites =	"eg-tsa-86, gm-osacv-87, ow-nmcvg-88, pv-savgc-93, pv-vc-93, pv-cvgpt-95, r-ectac-93, ZZZ"
-, update =	"98.07 icking, 98.03 bibrelex, 95.09 mitchell"
+, author =      "St{\'e}phane Rivi{\`e}re"
+, title =       "Topologically Sweeping the Visibility Complex of Polygonal Scenes"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C36--C37"
+, keywords =    "visibility graph optimal algorithm, experimental"
+, cites =       "eg-tsa-86, gm-osacv-87, ow-nmcvg-88, pv-savgc-93, pv-vc-93, pv-cvgpt-95, r-ectac-93, ZZZ"
+, update =      "98.07 icking, 98.03 bibrelex, 95.09 mitchell"
 }
 
 @phdthesis{r-vc2dp-97
-, author =	"S. Rivi{\`e}re"
-, title =	"Visibility computations in $2${D} polygonal scenes"
-, school =	"Universit{\'e} Joseph Fourier"
-, address =	"Grenoble, France"
-, year =	1997
-, keywords =	"doctoral thesis"
-, update =	"01.11 pocchiola, 98.07 bibrelex"
+, author =      "S. Rivi{\`e}re"
+, title =       "Visibility computations in $2${D} polygonal scenes"
+, school =      "Universit{\'e} Joseph Fourier"
+, address =     "Grenoble, France"
+, year =        1997
+, keywords =    "doctoral thesis"
+, update =      "01.11 pocchiola, 98.07 bibrelex"
 }
 
 @inproceedings{r-wvcav-97
-, author =	"St{\'e}phane Rivi{\`e}re"
-, title =	"Walking in the Visibility Complex with Applications to Visibility Polygons and Dynamic Visibility"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"147--152"
-, update =	"98.07 icking, 97.11 jones"
+, author =      "St{\'e}phane Rivi{\`e}re"
+, title =       "Walking in the Visibility Complex with Applications to Visibility Polygons and Dynamic Visibility"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "147--152"
+, update =      "98.07 icking, 97.11 jones"
 }
 
 @inproceedings{rodp-uvcrc-96
-, author =	"S. Rivi{\`e}re and R. Orti and F. Durand and C. Puech"
-, title =	"Using the visibility complex for radiosity computation"
-, booktitle =	"ACM Workshop Appl. Comput. Geom."
-, month =	may
-, year =	1996
-, update =	"97.11 bibrelex"
+, author =      "S. Rivi{\`e}re and R. Orti and F. Durand and C. Puech"
+, title =       "Using the visibility complex for radiosity computation"
+, booktitle =   "ACM Workshop Appl. Comput. Geom."
+, month =       may
+, year =        1996
+, update =      "97.11 bibrelex"
 }
 
 @techreport{r-ciph3-92
-, author =	"I. Rivin"
-, title =	"A characterization of ideal polyhedra in hyperbolic $3$-space"
-, type =	"Preprint"
-, institution =	"??"
-, year =	1992
-, update =	"97.11 bibrelex"
+, author =      "I. Rivin"
+, title =       "A characterization of ideal polyhedra in hyperbolic $3$-space"
+, type =        "Preprint"
+, institution = "??"
+, year =        1992
+, update =      "97.11 bibrelex"
 }
 
 @article{r-esssh-94
-, author =	"Igor Rivin"
-, title =	"Euclidean Structures on Simplicial Surfaces and Hyperbolic Volume"
-, journal =	"Ann. Math."
-, volume =	139
-, number =	3
-, year =	1994
-, pages =	"553--580"
-, update =	"98.07 tamassia+vismara"
+, author =      "Igor Rivin"
+, title =       "Euclidean Structures on Simplicial Surfaces and Hyperbolic Volume"
+, journal =     "Ann. Math."
+, volume =      139
+, number =      3
+, year =        1994
+, pages =       "553--580"
+, update =      "98.07 tamassia+vismara"
 }
 
 @phdthesis{r-gcph3-86
-, author =	"I. Rivin"
-, title =	"On geometry of convex polyhedra in hyperbolic $3$-space"
-, type =	"Ph.{D}. Thesis"
-, school =	"Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1986
-, keywords =	"doctoral thesis"
+, author =      "I. Rivin"
+, title =       "On geometry of convex polyhedra in hyperbolic $3$-space"
+, type =        "Ph.{D}. Thesis"
+, school =      "Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1986
+, keywords =    "doctoral thesis"
 }
 
 @article{r-giph3-
-, author =	"I. Rivin"
-, title =	"On the geometry of ideal polyhedra in hyperbolic $3$-space"
-, journal =	"Topology"
-, volume =	"??"
-, year =	"??"
-, note =	"To appear"
-, update =	"97.11 bibrelex"
+, author =      "I. Rivin"
+, title =       "On the geometry of ideal polyhedra in hyperbolic $3$-space"
+, journal =     "Topology"
+, volume =      "??"
+, year =        "??"
+, note =        "To appear"
+, update =      "97.11 bibrelex"
 }
 
 @misc{r-ahvfl-92
-, author =	"I. Rivin"
-, title =	"Some applications of the hyperbolic volume formula of {Lobachevskii} and {Milnor}"
-, howpublished =	"preprint"
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "I. Rivin"
+, title =       "Some applications of the hyperbolic volume formula of {Lobachevskii} and {Milnor}"
+, howpublished =        "preprint"
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @techreport{rs-iphdd-91
-, author =	"I. Rivin and W. D. Smith"
-, title =	"Ideal polyhedra in $H^3$ are determined by their dihedral angles"
-, type =	"manuscript"
-, institution =	"NEC Research Institute"
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "I. Rivin and W. D. Smith"
+, title =       "Ideal polyhedra in $H^3$ are determined by their dihedral angles"
+, type =        "manuscript"
+, institution = "NEC Research Institute"
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @techreport{rs-ig-91
-, author =	"I. Rivin and W. D. Smith"
-, title =	"Inscribable graphs"
-, type =	"Manuscript"
-, institution =	"NEC Research Institute"
-, address =	"Princeton, NJ"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "I. Rivin and W. D. Smith"
+, title =       "Inscribable graphs"
+, type =        "Manuscript"
+, institution = "NEC Research Institute"
+, address =     "Princeton, NJ"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @book{r-iaf-69
-, author =	"T. Rivlin"
-, title =	"An Introduction to the Approcimation of Functions"
-, publisher =	"Dover"
-, address =	"New York"
-, year =	1969
-, update =	"98.07 bibrelex"
+, author =      "T. Rivlin"
+, title =       "An Introduction to the Approcimation of Functions"
+, publisher =   "Dover"
+, address =     "New York"
+, year =        1969
+, update =      "98.07 bibrelex"
 }
 
 @article{r-ac-79
-, author =	"T. J. Rivlin"
-, title =	"Approximating by circles"
-, journal =	"Computing"
-, volume =	21
-, year =	1979
-, pages =	"93--104"
-, update =	"98.07 bibrelex"
+, author =      "T. J. Rivlin"
+, title =       "Approximating by circles"
+, journal =     "Computing"
+, volume =      21
+, year =        1979
+, pages =       "93--104"
+, update =      "98.07 bibrelex"
 }
 
 @article{rpw-csbsd-87
-, author =	"J. W. Roach and P. Paripati and J. Wright"
-, title =	"A {CAD} system based on spherical dual representation"
-, journal =	"IEEE Comput."
-, volume =	20
-, number =	8
-, year =	1987
-, pages =	"37--44"
-, update =	"98.07 bibrelex"
+, author =      "J. W. Roach and P. Paripati and J. Wright"
+, title =       "A {CAD} system based on spherical dual representation"
+, journal =     "IEEE Comput."
+, volume =      20
+, number =      8
+, year =        1987
+, pages =       "37--44"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{rwr-sdi3d-86
-, author =	"J. W. Roach and J. Wright and V. Ramesh"
-, title =	"Spherical dual images: {A} $3$-{D} representation method that combines dual space and {Gaussian} spheres"
-, booktitle =	"Proceedings of Workshop on Computer Vision: Representation and Control"
-, year =	1986
-, pages =	"236--241"
-, update =	"98.07 bibrelex"
+, author =      "J. W. Roach and J. Wright and V. Ramesh"
+, title =       "Spherical dual images: {A} $3$-{D} representation method that combines dual space and {Gaussian} spheres"
+, booktitle =   "Proceedings of Workshop on Computer Vision: Representation and Control"
+, year =        1986
+, pages =       "236--241"
+, update =      "98.07 bibrelex"
 }
 
 @article{r-tgs-86
-, author =	"L. Robbiano"
-, title =	"On the theory of graded structures"
-, journal =	"J. Symbolic Comput."
-, volume =	2
-, year =	1986
-, pages =	"139--170"
-, update =	"98.03 bibrelex"
+, author =      "L. Robbiano"
+, title =       "On the theory of graded structures"
+, journal =     "J. Symbolic Comput."
+, volume =      2
+, year =        1986
+, pages =       "139--170"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{r-topr-85
-, author =	"L. Robbiano"
-, title =	"Term orderings on the polynomial ring"
-, booktitle =	"European Conference on Computer Algebra"
-, nickname =	"EUROCAL '85"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	20
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"513--517"
-, update =	"98.03 bibrelex"
+, author =      "L. Robbiano"
+, title =       "Term orderings on the polynomial ring"
+, booktitle =   "European Conference on Computer Algebra"
+, nickname =    "EUROCAL '85"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      20
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "513--517"
+, update =      "98.03 bibrelex"
 }
 
 @article{rt-cvssm-91
-, author =	"M. O. Robbins and P. A. Thompson"
-, title =	"Critical Velocity of Stick-Slip Motion"
-, journal =	"Science"
-, volume =	253
-, year =	1991
-, pages =	"916--925"
-, update =	"96.09 orourke"
+, author =      "M. O. Robbins and P. A. Thompson"
+, title =       "Critical Velocity of Stick-Slip Motion"
+, journal =     "Science"
+, volume =      253
+, year =        1991
+, pages =       "916--925"
+, update =      "96.09 orourke"
 }
 
 @techreport{rt-cgfl-90
-, author =	"J. Robert and G. Toussaint"
-, title =	"Computational geometry and facility location"
-, type =	"Technical {Report}"
-, number =	"SOCS 90.20"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "J. Robert and G. Toussaint"
+, title =       "Computational geometry and facility location"
+, type =        "Technical {Report}"
+, number =      "SOCS 90.20"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{r-gohtt-93
-, author =	"J.-M. Robert"
-, title =	"Geometric orderings and {Helly}-type theorem for intersecting translates in the plane"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"61--66"
-, precedes =	"r-goita-97"
-, cites =	"ab-eact-87, es-mnwsn-90, ew-spdtl-89, gpw-gtt-93, h-uegt-57, k-cgct-86, kll-gpct-86, kll-gpdt-87, kll-gpdt-87, t-pgcct-89, w-ghtti-90, w-gpcc-90, ZZZ"
-, update =	"98.11 bibrelex, 97.03 devillers, 93.09 milone+mitchell"
+, author =      "J.-M. Robert"
+, title =       "Geometric orderings and {Helly}-type theorem for intersecting translates in the plane"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "61--66"
+, precedes =    "r-goita-97"
+, cites =       "ab-eact-87, es-mnwsn-90, ew-spdtl-89, gpw-gtt-93, h-uegt-57, k-cgct-86, kll-gpct-86, kll-gpdt-87, kll-gpdt-87, t-pgcct-89, w-ghtti-90, w-gpcc-90, ZZZ"
+, update =      "98.11 bibrelex, 97.03 devillers, 93.09 milone+mitchell"
 }
 
 @article{r-goita-97
-, author =	"J.-M. Robert"
-, title =	"Geometric orderings of intersecting translates and their applications"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"59--72"
-, succeeds =	"r-gohtt-93"
-, update =	"97.03 devillers"
+, author =      "J.-M. Robert"
+, title =       "Geometric orderings of intersecting translates and their applications"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "59--72"
+, succeeds =    "r-gohtt-93"
+, update =      "97.03 devillers"
 }
 
 @inproceedings{rt-laso-92
-, author =	"J.-M. Robert and G. Toussaint"
-, title =	"Linear approximation of simple objects"
-, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	577
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"233--244"
-, precedes =	"rt-laso-94"
-, update =	"96.09 devillers"
+, author =      "J.-M. Robert and G. Toussaint"
+, title =       "Linear approximation of simple objects"
+, booktitle =   "Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      577
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "233--244"
+, precedes =    "rt-laso-94"
+, update =      "96.09 devillers"
 }
 
 @article{rt-laso-94
-, author =	"J.-M. Robert and G. Toussaint"
-, title =	"Linear approximation of simple objects"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"27--52"
-, succeeds =	"rt-laso-92"
-, update =	"96.09 devillers"
+, author =      "J.-M. Robert and G. Toussaint"
+, title =       "Linear approximation of simple objects"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "27--52"
+, succeeds =    "rt-laso-92"
+, update =      "96.09 devillers"
 }
 
 @article{r-gtaps-78
-, author =	"Fred S. Roberts"
-, title =	"Graph Theory and Its Applications to Problems of Society"
-, journal =	"SIAM, CBMS-NSF REgional Conf. Series in Applied Mathematics, Philadelphia"
-, volume =	"??"
-, year =	1978
-, update =	"98.07 bibrelex"
+, author =      "Fred S. Roberts"
+, title =       "Graph Theory and Its Applications to Problems of Society"
+, journal =     "SIAM, CBMS-NSF REgional Conf. Series in Applied Mathematics, Philadelphia"
+, volume =      "??"
+, year =        1978
+, update =      "98.07 bibrelex"
 }
 
 @incollection{r-ig-69
-, author =	"F. S. Roberts"
-, title =	"Indifference Graphs"
-, editor =	"F. Harary"
-, booktitle =	"Proof Techniques in Graph Theory"
-, publisher =	"Academic Press"
-, address =	"New York"
-, year =	1969
-, pages =	"139--146"
-, update =	"98.11 bibrelex"
+, author =      "F. S. Roberts"
+, title =       "Indifference Graphs"
+, editor =      "F. Harary"
+, booktitle =   "Proof Techniques in Graph Theory"
+, publisher =   "Academic Press"
+, address =     "New York"
+, year =        1969
+, pages =       "139--146"
+, update =      "98.11 bibrelex"
 }
 
 @article{r-ffiss-88
-, author =	"S. Roberts"
-, title =	"On the figures formed by the intercepts of a system of straight lines in a plane, and an analogous relations in space of three dimensions"
-, journal =	"Proc. London Math. Soc."
-, volume =	19
-, year =	1888
-, pages =	"405--422"
+, author =      "S. Roberts"
+, title =       "On the figures formed by the intercepts of a system of straight lines in a plane, and an analogous relations in space of three dimensions"
+, journal =     "Proc. London Math. Soc."
+, volume =      19
+, year =        1888
+, pages =       "405--422"
 }
 
 @inproceedings{rmc-cta3v-91
-, author =	"G. G. Robertson and J. D. Mackinlay and S. K. Card"
-, title =	"Cone Trees: Animated {3D} Visualizations of Hierarchical Information"
-, booktitle =	"Proc. ACM Conf. on Human Factors in Computing Systems"
-, nickname =	"CHI"
-, year =	1991
-, pages =	"189--193"
-, keywords =	"graph drawing"
-, update =	"97.03 tamassia, 96.09 tamassia, 95.01 tamassia"
+, author =      "G. G. Robertson and J. D. Mackinlay and S. K. Card"
+, title =       "Cone Trees: Animated {3D} Visualizations of Hierarchical Information"
+, booktitle =   "Proc. ACM Conf. on Human Factors in Computing Systems"
+, nickname =    "CHI"
+, year =        1991
+, pages =       "189--193"
+, keywords =    "graph drawing"
+, update =      "97.03 tamassia, 96.09 tamassia, 95.01 tamassia"
 }
 
 @article{r-cal-70
-, author =	"H. G. Robertson"
-, title =	"Curvature and arc length"
-, journal =	"SIAM J. Appl. Math."
-, volume =	19
-, year =	1970
-, pages =	"697--699"
-, update =	"94.05 devillers"
+, author =      "H. G. Robertson"
+, title =       "Curvature and arc length"
+, journal =     "SIAM J. Appl. Math."
+, volume =      19
+, year =        1970
+, pages =       "697--699"
+, update =      "94.05 devillers"
 }
 
 @inproceedings{rsst-efcpg-96
-, author =	"N. Robertson and D. P. Sanders and P. Seymour and R. Thomas"
-, title =	"Efficiently four-coloring planar graphs"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, year =	1996
-, pages =	"571--575"
-, update =	"98.07 bibrelex"
+, author =      "N. Robertson and D. P. Sanders and P. Seymour and R. Thomas"
+, title =       "Efficiently four-coloring planar graphs"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, year =        1996
+, pages =       "571--575"
+, update =      "98.07 bibrelex"
 }
 
 @article{rs-gm2aa-86
-, author =	"N. Robertson and P. D. Seymour"
-, title =	"Graph minors {II}. {Algorithmic} aspects of tree width"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"309--322"
-, update =	"97.11 bibrelex"
+, author =      "N. Robertson and P. D. Seymour"
+, title =       "Graph minors {II}. {Algorithmic} aspects of tree width"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "309--322"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{r-igptd-87
-, author =	"G. Robins"
-, title =	"The {ISI} Grapher: {A} Portable Tool for Displaying Graphs Pictorially"
-, number =	"ISI/RS-87-196"
-, institution =	"Information Sciences Inst., University of Southern California"
-, year =	1987
-, note =	"also in Proc. Symboliikka '87 Helsinki Finland August
+, author =      "G. Robins"
+, title =       "The {ISI} Grapher: {A} Portable Tool for Displaying Graphs Pictorially"
+, number =      "ISI/RS-87-196"
+, institution = "Information Sciences Inst., University of Southern California"
+, year =        1987
+, note =        "also in Proc. Symboliikka '87 Helsinki Finland August
                  1987"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{rs-ldmst-95
-, author =	"G. Robins and J. S. Salowe"
-, title =	"Low-degree minimum spanning trees"
-, journal =	"Discrete Comput. Geom."
-, volume =	14
-, year =	1995
-, pages =	"151--165"
-, update =	"02.03 smid"
+, author =      "G. Robins and J. S. Salowe"
+, title =       "Low-degree minimum spanning trees"
+, journal =     "Discrete Comput. Geom."
+, volume =      14
+, year =        1995
+, pages =       "151--165"
+, update =      "02.03 smid"
 }
 
 @inproceedings{rs-mdmst-94
-, author =	"G. Robins and J. S. Salowe"
-, title =	"On the Maximum Degree of Minimum Spanning Trees"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"250--258"
-, cites =	"bgmrz-tsees-93, bgrz-ngnos-93, clr-ia-90, cfg-upg-90, de-eaahc-84, gj-cigtn-79, gp-1stp-87, gh-hmstp-85, gs-canen-83, h-tdicl-91, hvw-narst-90, kl-bpss-78, kr-ncist-92, k-sssgt-56, pv-tgprt-84, pl-pdavs-88, p-scnsg-57, sw-ersta-93, t-nrtpc-83, w-cbdd-65, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "G. Robins and J. S. Salowe"
+, title =       "On the Maximum Degree of Minimum Spanning Trees"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "250--258"
+, cites =       "bgmrz-tsees-93, bgrz-ngnos-93, clr-ia-90, cfg-upg-90, de-eaahc-84, gj-cigtn-79, gp-1stp-87, gh-hmstp-85, gs-canen-83, h-tdicl-91, hvw-narst-90, kl-bpss-78, kr-ncist-92, k-sssgt-56, pv-tgprt-84, pl-pdavs-88, p-scnsg-57, sw-ersta-93, t-nrtpc-83, w-cbdd-65, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @techreport{r-kdbts-81t
-, author =	"J. T. Robinson"
-, title =	"The $k$-d-{B}-tree: {A} search structure for large multidimensional dynamic indexes"
-, type =	"Report"
-, number =	"CMU-CS-81-106"
-, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1981
-, precedes =	"r-kdbts-81i"
-, update =	"97.07 agarwal, 94.05 franciosa"
+, author =      "J. T. Robinson"
+, title =       "The $k$-d-{B}-tree: {A} search structure for large multidimensional dynamic indexes"
+, type =        "Report"
+, number =      "CMU-CS-81-106"
+, institution = "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1981
+, precedes =    "r-kdbts-81i"
+, update =      "97.07 agarwal, 94.05 franciosa"
 }
 
 @inproceedings{r-kdbts-81i
-, author =	"J. T. Robinson"
-, title =	"The $k$-d-b-tree: a search structure for large multidimensional dynamic indexes"
-, booktitle =	"Proc. ACM SIGACT-SIGMOD Conf. Principles Database Systems"
-, year =	1981
-, pages =	"10--18"
-, succeeds =	"r-kdbts-81t"
-, update =	"94.05 franciosa"
+, author =      "J. T. Robinson"
+, title =       "The $k$-d-b-tree: a search structure for large multidimensional dynamic indexes"
+, booktitle =   "Proc. ACM SIGACT-SIGMOD Conf. Principles Database Systems"
+, year =        1981
+, pages =       "10--18"
+, succeeds =    "r-kdbts-81t"
+, update =      "94.05 franciosa"
 }
 
 @article{r-untp-71
-, author =	"R. M. Robinson"
-, title =	"Undecidability and nonperiodicity of tilings of the plane"
-, journal =	"Invent. Math."
-, volume =	12
-, year =	1971
-, pages =	"177--909"
-, update =	"97.11 bibrelex"
+, author =      "R. M. Robinson"
+, title =       "Undecidability and nonperiodicity of tilings of the plane"
+, journal =     "Invent. Math."
+, volume =      12
+, year =        1971
+, pages =       "177--909"
+, update =      "97.11 bibrelex"
 }
 
 @article{rwp-3dimp-88
-, author =	"Michel Roch and Jacques Weber and Christian Pellegrini"
-, title =	"3{D} images of molecular properties by triangulation of contour lines"
-, journal =	"Comput. Graph. Forum"
-, volume =	7
-, number =	3
-, month =	sep
-, year =	1988
-, pages =	"195--202"
-, annote =	"I can't understand their algorithm."
+, author =      "Michel Roch and Jacques Weber and Christian Pellegrini"
+, title =       "3{D} images of molecular properties by triangulation of contour lines"
+, journal =     "Comput. Graph. Forum"
+, volume =      7
+, number =      3
+, month =       sep
+, year =        1988
+, pages =       "195--202"
+, annote =      "I can't understand their algorithm."
 }
 
 @inproceedings{r-pdsrr-99
-, author =	"Jairo Rocha"
-, title =	"Polygonal Decomposition into Singular and Regular Regions"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"185--190"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Jairo Rocha"
+, title =       "Polygonal Decomposition into Singular and Regular Regions"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "185--190"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @book{r-ca-70
-, author =	"R. T. Rockafellar"
-, title =	"Convex Analysis"
-, publisher =	"Princeton University Press"
-, year =	1970
-, update =	"98.03 bibrelex"
+, author =      "R. T. Rockafellar"
+, title =       "Convex Analysis"
+, publisher =   "Princeton University Press"
+, year =        1970
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{rhd-rtrts-89
-, author =	"A. Rockwood and K. Heaton and T. Davis"
-, title =	"Real-time rendering of trimmed surfaces"
-, booktitle =	"Proc. SIGGRAPH '89"
-, year =	1989
-, pages =	"107--117"
-, update =	"97.11 bibrelex"
+, author =      "A. Rockwood and K. Heaton and T. Davis"
+, title =       "Real-time rendering of trimmed surfaces"
+, booktitle =   "Proc. SIGGRAPH '89"
+, year =        1989
+, pages =       "107--117"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ro-bssgm-85
-, author =	"A. Rockwood and J. Owen"
-, title =	"Blending Surfaces in Solid Geometric Modeling"
-, booktitle =	"SIAM Conf. on Geometric Modeling and Robotics"
-, site =	"Albany, NY"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "A. Rockwood and J. Owen"
+, title =       "Blending Surfaces in Solid Geometric Modeling"
+, booktitle =   "SIAM Conf. on Geometric Modeling and Robotics"
+, site =        "Albany, NY"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @techreport{rnp-falp-97
-, author =	"A. Rodriguez-Chia and S. Nickel and J. Puerto"
-, title =	"A flexible Approach to Location Problems"
-, type =	"Report in Wirtschaftsmathematik"
-, number =	26
-, institution =	"University of  Kaiserslautern, Department of Mathematics"
-, year =	1997
-, update =	"01.04 icking"
+, author =      "A. Rodriguez-Chia and S. Nickel and J. Puerto"
+, title =       "A flexible Approach to Location Problems"
+, type =        "Report in Wirtschaftsmathematik"
+, number =      26
+, institution = "University of  Kaiserslautern, Department of Mathematics"
+, year =        1997
+, update =      "01.04 icking"
 }
 
 @article{r-css-63
-, author =	"C. A. Rogers"
-, title =	"Covering a sphere with spheres"
-, journal =	"Mathematika"
-, volume =	10
-, year =	1963
-, pages =	"157--164"
-, update =	"98.03 smid, 97.11 bibrelex"
+, author =      "C. A. Rogers"
+, title =       "Covering a sphere with spheres"
+, journal =     "Mathematika"
+, volume =      10
+, year =        1963
+, pages =       "157--164"
+, update =      "98.03 smid, 97.11 bibrelex"
 }
 
 @book{r-pc-64
-, author =	"C. A. Rogers"
-, title =	"Packing and Covering"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge, England"
-, year =	1964
-, keywords =	"book"
-, update =	"98.03 smid"
+, author =      "C. A. Rogers"
+, title =       "Packing and Covering"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge, England"
+, year =        1964
+, keywords =    "book"
+, update =      "98.03 smid"
 }
 
 @book{ra-mecg-76
-, author =	"D. F. Rogers and J. A. Adams"
-, title =	"Mathematical Elements for Computer Graphics"
-, edition =	"1st"
-, publisher =	"McGraw-Hill"
-, year =	1976
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "D. F. Rogers and J. A. Adams"
+, title =       "Mathematical Elements for Computer Graphics"
+, edition =     "1st"
+, publisher =   "McGraw-Hill"
+, year =        1976
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @book{ra-mecg-90
-, author =	"D. F. Rogers and J. A. Adams"
-, title =	"Mathematical Elements for Computer Graphics"
-, edition =	"2nd"
-, publisher =	"McGraw-Hill"
-, address =	"New York"
-, year =	1990
-, update =	"98.11 bibrelex, 98.07 orourke"
+, author =      "D. F. Rogers and J. A. Adams"
+, title =       "Mathematical Elements for Computer Graphics"
+, edition =     "2nd"
+, publisher =   "McGraw-Hill"
+, address =     "New York"
+, year =        1990
+, update =      "98.11 bibrelex, 98.07 orourke"
 }
 
 @book{r-trfec-67
-, author =	"H. Rogers"
-, title =	"Theory of Recursive Functions and Effective Computability"
-, publisher =	"McGraw-Hill"
-, address =	"New York"
-, year =	1967
-, update =	"95.09 agarwal"
+, author =      "H. Rogers"
+, title =       "Theory of Recursive Functions and Effective Computability"
+, publisher =   "McGraw-Hill"
+, address =     "New York"
+, year =        1967
+, update =      "95.09 agarwal"
 }
 
 @mastersthesis{r-phsgt-97
-, author =	"Andr{\'e} Rohe"
-, title =	"{Parallele} {Heuristiken} f{\"u}r sehr gro{\ss}e {Traveling} {Saleman} {Probleme}"
-, type =	"Diplomarbeit"
-, school =	"Universit{\"a}t Bonn, Institut f{\"u}r Diskrete Mathematik"
-, year =	1997
-, url =	"http://www.or.uni-bonn.de/home/rohe/diplom.ps.gz"
-, keywords =	"master thesis"
-, update =	"00.03 bibrelex"
+, author =      "Andr{\'e} Rohe"
+, title =       "{Parallele} {Heuristiken} f{\"u}r sehr gro{\ss}e {Traveling} {Saleman} {Probleme}"
+, type =        "Diplomarbeit"
+, school =      "Universit{\"a}t Bonn, Institut f{\"u}r Diskrete Mathematik"
+, year =        1997
+, url = "http://www.or.uni-bonn.de/home/rohe/diplom.ps.gz"
+, keywords =    "master thesis"
+, update =      "00.03 bibrelex"
 }
 
 @article{r-pmsta-78
-, author =	"F. J. Rohlf"
-, title =	"A probabilistic minimum spanning tree algorithm"
-, journal =	"Inform. Process. Lett."
-, volume =	7
-, year =	1978
-, pages =	"44--48"
+, author =      "F. J. Rohlf"
+, title =       "A probabilistic minimum spanning tree algorithm"
+, journal =     "Inform. Process. Lett."
+, volume =      7
+, year =        1978
+, pages =       "44--48"
 }
 
 @techreport{r-ceaca-77
-, author =	"F. J. Rohlf"
-, title =	"Computational efficiency of agglomerative clustering algorithms"
-, type =	"Report"
-, number =	"RC 6831 (\#29312)"
-, institution =	"IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1977
+, author =      "F. J. Rohlf"
+, title =       "Computational efficiency of agglomerative clustering algorithms"
+, type =        "Report"
+, number =      "RC 6831 (\#29312)"
+, institution = "IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1977
 }
 
 @article{r-hcums-73
-, author =	"F. J. Rohlf"
-, title =	"Hierarchical clustering using the minimum spanning tree"
-, journal =	"Comput. J."
-, volume =	16
-, year =	1973
-, pages =	"93--95"
+, author =      "F. J. Rohlf"
+, title =       "Hierarchical clustering using the minimum spanning tree"
+, journal =     "Comput. J."
+, volume =      16
+, year =        1973
+, pages =       "93--95"
 }
 
 @article{r-lie-89
-, author =	"J. Rohn"
-, title =	"Linear interval equations"
-, journal =	"Linear Algebra and its applications"
-, volume =	126
-, year =	1989
-, pages =	"39--78"
-, update =	"98.03 bibrelex"
+, author =      "J. Rohn"
+, title =       "Linear interval equations"
+, journal =     "Linear Algebra and its applications"
+, volume =      126
+, year =        1989
+, pages =       "39--78"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{r-daplc-85
-, author =	"H. Rohnert"
-, title =	"A Dynamization of the All-Pairs Least Cost Problem"
-, booktitle =	"Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	182
-, publisher =	"Springer-Verlag"
-, year =	1985
-, pages =	"279--286"
-, update =	"94.01 tamassia"
+, author =      "H. Rohnert"
+, title =       "A Dynamization of the All-Pairs Least Cost Problem"
+, booktitle =   "Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      182
+, publisher =   "Springer-Verlag"
+, year =        1985
+, pages =       "279--286"
+, update =      "94.01 tamassia"
 }
 
 @techreport{r-naspa-86
-, author =	"H. Rohnert"
-, title =	"A new algorithm for shortest paths avoiding convex polygonal obstacles"
-, type =	"Report"
-, number =	"A86/02"
-, institution =	"Fachber. Inform., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1986
+, author =      "H. Rohnert"
+, title =       "A new algorithm for shortest paths avoiding convex polygonal obstacles"
+, type =        "Report"
+, number =      "A86/02"
+, institution = "Fachber. Inform., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1986
 }
 
 @inproceedings{r-mdbp-87
-, author =	"H. Rohnert"
-, title =	"Moving a disc between polygons"
-, booktitle =	"Proc. 1st Internat. Conf. Indust. Applied Math."
-, site =	"Paris, France"
-, year =	1987
-, pages =	"85--98"
-, precedes =	"r-mdbp-91"
+, author =      "H. Rohnert"
+, title =       "Moving a disc between polygons"
+, booktitle =   "Proc. 1st Internat. Conf. Indust. Applied Math."
+, site =        "Paris, France"
+, year =        1987
+, pages =       "85--98"
+, precedes =    "r-mdbp-91"
 }
 
 @article{r-mdbp-91
-, author =	"H. Rohnert"
-, title =	"Moving a disc between polygons"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"182--191"
-, succeeds =	"r-mdbp-87"
+, author =      "H. Rohnert"
+, title =       "Moving a disc between polygons"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "182--191"
+, succeeds =    "r-mdbp-87"
 }
 
 @article{r-sppcp-86
-, author =	"H. Rohnert"
-, title =	"Shortest paths in the plane with convex polygonal obstacles"
-, journal =	"Inform. Process. Lett."
-, volume =	23
-, year =	1986
-, pages =	"71--76"
+, author =      "H. Rohnert"
+, title =       "Shortest paths in the plane with convex polygonal obstacles"
+, journal =     "Inform. Process. Lett."
+, volume =      23
+, year =        1986
+, pages =       "71--76"
 }
 
 @article{r-tseas-88
-, author =	"H. Rohnert"
-, title =	"Time and space efficient algorithms for shortest paths between convex polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	27
-, year =	1988
-, pages =	"175--179"
-, update =	"98.11 bibrelex"
+, author =      "H. Rohnert"
+, title =       "Time and space efficient algorithms for shortest paths between convex polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      27
+, year =        1988
+, pages =       "175--179"
+, update =      "98.11 bibrelex"
 }
 
 @phdthesis{r-svcvc-89
-, author =	"A. S. Rojer"
-, title =	"Space-variant computer vision with a complex-logarithmic sensor geometry"
-, school =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1989
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "A. S. Rojer"
+, title =       "Space-variant computer vision with a complex-logarithmic sensor geometry"
+, school =      "Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1989
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{rs-dcsvv-90
-, author =	"A. S. Rojer and E. L. Schwartz"
-, title =	"Design considerations for a space-variant visual sensor with a complex-logarithmic sensor geometry"
-, booktitle =	"Proc. 10th IEEE Internat. Conf. Pattern Recogn."
-, volume =	2
-, year =	1990
-, pages =	"278--285"
-, update =	"98.07 bibrelex"
+, author =      "A. S. Rojer and E. L. Schwartz"
+, title =       "Design considerations for a space-variant visual sensor with a complex-logarithmic sensor geometry"
+, booktitle =   "Proc. 10th IEEE Internat. Conf. Pattern Recogn."
+, volume =      2
+, year =        1990
+, pages =       "278--285"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{rww-obps-92
-, author =	"J. Rokne and S. Wang and X. Wu"
-, title =	"Optimal bipartitions of point sets"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"11--16"
-, cites =	"aiks-fkpmd-91, abky-cabmm-88, a-dp-86, bh-cpcoe-89, c-acdl-83, dn-cgacp-85, eg-tsa-89, eos-calha-86, crw-gc-91, cgl-pgd-85, hs-ftp-91, mw-fobpp-91, ol-mcp-81, p-ortap-79, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "J. Rokne and S. Wang and X. Wu"
+, title =       "Optimal bipartitions of point sets"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "11--16"
+, cites =       "aiks-fkpmd-91, abky-cabmm-88, a-dp-86, bh-cpcoe-89, c-acdl-83, dn-cgacp-85, eg-tsa-89, eos-calha-86, crw-gc-91, cgl-pgd-85, hs-ftp-91, mw-fobpp-91, ol-mcp-81, p-ortap-79, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{rw-oasdp-92
-, author =	"J. Rokne and S. Z. Wang"
-, title =	"An optimal algorithm for the set diameter problem in three dimensions"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Univ. Calgary"
-, address =	"Calgary, AB"
-, month =	jun
-, year =	1992
-, keywords =	"diameter, antipodal pair, polyhedra, three-dimensional, geometric transformations, reciprocal search"
+, author =      "J. Rokne and S. Z. Wang"
+, title =       "An optimal algorithm for the set diameter problem in three dimensions"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Univ. Calgary"
+, address =     "Calgary, AB"
+, month =       jun
+, year =        1992
+, keywords =    "diameter, antipodal pair, polyhedra, three-dimensional, geometric transformations, reciprocal search"
 }
 
 @techreport{rww-lvirt-92
-, author =	"J. Rokne and S. Z. Wang and X. Wu"
-, title =	"The largest-volume inscribed rooted tetrahedron in a convex polyhedron"
-, type =	"Research {Report}"
-, number =	"92/471/09"
-, institution =	"Dept. Comput. Sci., Univ. Calgary"
-, address =	"Calgary, AB"
-, month =	mar
-, year =	1992
-, keywords =	"design of algorithms, three-dimensional, tetrahedra, polyhedra, geometric transformations"
-, abstract =	"Given a polyhedron with $n$ vertices, we present an
-		 algorithm for finding the maximum tetrahedron rooted on
-		 a face of the polyhedron in $O(n \log n)$ time. For the
-		 result we need to discuss a class of reciprocal search
-		 problems."
+, author =      "J. Rokne and S. Z. Wang and X. Wu"
+, title =       "The largest-volume inscribed rooted tetrahedron in a convex polyhedron"
+, type =        "Research {Report}"
+, number =      "92/471/09"
+, institution = "Dept. Comput. Sci., Univ. Calgary"
+, address =     "Calgary, AB"
+, month =       mar
+, year =        1992
+, keywords =    "design of algorithms, three-dimensional, tetrahedra, polyhedra, geometric transformations"
+, abstract =    "Given a polyhedron with $n$ vertices, we present an
+                 algorithm for finding the maximum tetrahedron rooted on
+                 a face of the polyhedron in $O(n \log n)$ time. For the
+                 result we need to discuss a class of reciprocal search
+                 problems."
 }
 
 @article{rww-flsc-90
-, author =	"J. G. Rokne and B. Wyvill and X. Wu"
-, title =	"Fast line scan-conversion"
-, journal =	"ACM Trans. Graph."
-, volume =	9
-, year =	1990
-, pages =	"376--388"
-, keywords =	"digital geometry, computer graphics, design of algorithms, approximation, incrementation, lines, two-dimensional, empirical analysis"
-, update =	"94.05 smid"
-, annote =	"``an overall gain in speed of about 4 over the
-		 original Bresenham algorithm''"
+, author =      "J. G. Rokne and B. Wyvill and X. Wu"
+, title =       "Fast line scan-conversion"
+, journal =     "ACM Trans. Graph."
+, volume =      9
+, year =        1990
+, pages =       "376--388"
+, keywords =    "digital geometry, computer graphics, design of algorithms, approximation, incrementation, lines, two-dimensional, empirical analysis"
+, update =      "94.05 smid"
+, annote =      "``an overall gain in speed of about 4 over the
+                 original Bresenham algorithm''"
 }
 
 @book{r-kl-76
-, author =	"D. Rolfsen"
-, title =	"Knots and Links"
-, publisher =	"Publish or Perish"
-, address =	"Berkeley, CA"
-, year =	1976
-, update =	"97.11 bibrelex"
+, author =      "D. Rolfsen"
+, title =       "Knots and Links"
+, publisher =   "Publish or Perish"
+, address =     "Berkeley, CA"
+, year =        1976
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{r-att-92
-, author =	"Kathleen Romanik"
-, title =	"Approximate Testing Theory"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Maryland at College Park"
-, address =	"College Park, MD"
-, month =	aug
-, year =	1992
-, note =	"Technical Report CS-TR-2947/UMIACS-TR-92-89"
-, keywords =	"doctoral thesis, probing, point probes, approximate testing"
-, update =	"96.09 romanik"
+, author =      "Kathleen Romanik"
+, title =       "Approximate Testing Theory"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Maryland at College Park"
+, address =     "College Park, MD"
+, month =       aug
+, year =        1992
+, note =        "Technical Report CS-TR-2947/UMIACS-TR-92-89"
+, keywords =    "doctoral thesis, probing, point probes, approximate testing"
+, update =      "96.09 romanik"
 }
 
 @inproceedings{r-drvgh-95
-, author =	"Kathleen Romanik"
-, title =	"Directed Rectangle-Visibility Graphs have Unbounded Dimension"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"163--167"
-, keywords =	"graph drawing, visibility, order"
-, comments =	"To appear in Discrete Appl. Math."
-, update =	"96.09 romanik, 95.09 jones"
+, author =      "Kathleen Romanik"
+, title =       "Directed Rectangle-Visibility Graphs have Unbounded Dimension"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "163--167"
+, keywords =    "graph drawing, visibility, order"
+, comments =    "To appear in Discrete Appl. Math."
+, update =      "96.09 romanik, 95.09 jones"
 }
 
 @inproceedings{r-dvrgh-95
-, author =	"K. Romanik"
-, title =	"Directed VR-Representable Graphs have Unbounded Dimension"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"177--181"
-, keywords =	"graph drawing, visibility, order"
-, update =	"95.01 tamassia"
+, author =      "K. Romanik"
+, title =       "Directed VR-Representable Graphs have Unbounded Dimension"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "177--181"
+, keywords =    "graph drawing, visibility, order"
+, update =      "95.01 tamassia"
 }
 
 @techreport{r-gpts-95t
-, author =	"Kathleen Romanik"
-, title =	"Geometric Probing and Testing - A Survey"
-, type =	"Technical {Report}"
-, number =	"95-42"
-, institution =	"DIMACS, Rutgers Univ."
-, month =	sep
-, year =	1995
-, keywords =	"probing, testing"
-, succeeds =	"r-gpts-95i"
-, update =	"96.09 romanik"
+, author =      "Kathleen Romanik"
+, title =       "Geometric Probing and Testing - A Survey"
+, type =        "Technical {Report}"
+, number =      "95-42"
+, institution = "DIMACS, Rutgers Univ."
+, month =       sep
+, year =        1995
+, keywords =    "probing, testing"
+, succeeds =    "r-gpts-95i"
+, update =      "96.09 romanik"
 }
 
 @inproceedings{r-gpts-95i
-, author =	"Kathleen Romanik"
-, title =	"Geometric Probing and Testing - A Survey"
-, booktitle =	"Proc. VI Congreso Espa{\~{n}}ol de Geometria Computacional"
-, site =	"Barcelona, Spain"
-, month =	jul
-, year =	1995
-, pages =	""
-, keywords =	"probing, testing"
-, precedes =	"r-gpts-95t"
-, update =	"96.09 romanik"
+, author =      "Kathleen Romanik"
+, title =       "Geometric Probing and Testing - A Survey"
+, booktitle =   "Proc. VI Congreso Espa{\~{n}}ol de Geometria Computacional"
+, site =        "Barcelona, Spain"
+, month =       jul
+, year =        1995
+, pages =       ""
+, keywords =    "probing, testing"
+, precedes =    "r-gpts-95t"
+, update =      "96.09 romanik"
 }
 
 @inproceedings{rs-tos-92
-, author =	"K. Romanik and S. Salzberg"
-, title =	"Testing orthogonal shapes"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"216--222"
-, keywords =	"probing, point probes, testing, orthogonal"
-, precedes =	"rs-tos-95"
-, update =	"96.09 devillers+romanik"
+, author =      "K. Romanik and S. Salzberg"
+, title =       "Testing orthogonal shapes"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "216--222"
+, keywords =    "probing, point probes, testing, orthogonal"
+, precedes =    "rs-tos-95"
+, update =      "96.09 devillers+romanik"
 }
 
 @article{rs-tos-95
-, author =	"Kathleen Romanik and Steven Salzberg"
-, title =	"Testing Orthogonal Shapes"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"33--49"
-, keywords =	"probing, point probes, testing, orthogonal"
-, succeeds =	"rs-tos-92"
-, update =	"96.09 devillers+romanik"
+, author =      "Kathleen Romanik and Steven Salzberg"
+, title =       "Testing Orthogonal Shapes"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "33--49"
+, keywords =    "probing, point probes, testing, orthogonal"
+, succeeds =    "rs-tos-92"
+, update =      "96.09 devillers+romanik"
 }
 
 @inproceedings{rs-orlt-96
-, author =	"Kathleen Romanik and Sven Schuierer"
-, title =	"Optimal Robot Localization in Trees"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"264--273"
-, keywords =	"localization, on-line"
-, cites =	"bcr-sp-93, bbfy-olnr-94, brs-plue-93, brs-nugt-91, bc-olaip-93, drw-lrmt-95, gmr-rlptd-92, kp-caasu-93, k-lpmr-94, mawm-ancmr-89, py-spwm-89, sn-anpld-89, st-aelup-85, tpbhss-mbldo-90, yd-cgalr-88, ZZZ"
-, update =	"97.11 bibrelex, 96.09 romanik, 96.05 efrat"
+, author =      "Kathleen Romanik and Sven Schuierer"
+, title =       "Optimal Robot Localization in Trees"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "264--273"
+, keywords =    "localization, on-line"
+, cites =       "bcr-sp-93, bbfy-olnr-94, brs-plue-93, brs-nugt-91, bc-olaip-93, drw-lrmt-95, gmr-rlptd-92, kp-caasu-93, k-lpmr-94, mawm-ancmr-89, py-spwm-89, sn-anpld-89, st-aelup-85, tpbhss-mbldo-90, yd-cgalr-88, ZZZ"
+, update =      "97.11 bibrelex, 96.09 romanik, 96.05 efrat"
 }
 
 @inproceedings{rs-orlt-96c
-, author =	"Kathleen Romanik and Sven Schuierer"
-, title =	"Optimal Robot Localization in Trees"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"91--93"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Kathleen Romanik and Sven Schuierer"
+, title =       "Optimal Robot Localization in Trees"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "91--93"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @techreport{rs-tgo-90t
-, author =	"K. Romanik and C. Smith"
-, title =	"Testing Geometric Objects"
-, type =	"Technical {Report}"
-, number =	"UMIACS-TR-90-69"
-, institution =	"University of Maryland, Institute for Advanced Computer Studies"
-, month =	may
-, year =	1990
-, keywords =	"probing, point probes, testing"
-, precedes =	"rs-tgo-90i"
-, update =	"96.09 romanik, 93.09 milone+mitchell"
+, author =      "K. Romanik and C. Smith"
+, title =       "Testing Geometric Objects"
+, type =        "Technical {Report}"
+, number =      "UMIACS-TR-90-69"
+, institution = "University of Maryland, Institute for Advanced Computer Studies"
+, month =       may
+, year =        1990
+, keywords =    "probing, point probes, testing"
+, precedes =    "rs-tgo-90i"
+, update =      "96.09 romanik, 93.09 milone+mitchell"
 }
 
 @inproceedings{rs-tgo-90i
-, author =	"K. Romanik and C. Smith"
-, title =	"Testing geometric objects"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"14--19"
-, keywords =	"probing, point probes, testing"
-, precedes =	"rs-tgo-94"
-, cites =	"bbehw-clgcv-86, b-dscns-86, cy-sp-87, hw-ensrq-87, s-gp-88, v-tl-84, vc-ucrfe-71, ZZZ"
-, update =	"98.07 bibrelex, 96.09 devillers+romanik, 94.05 smid"
+, author =      "K. Romanik and C. Smith"
+, title =       "Testing geometric objects"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "14--19"
+, keywords =    "probing, point probes, testing"
+, precedes =    "rs-tgo-94"
+, cites =       "bbehw-clgcv-86, b-dscns-86, cy-sp-87, hw-ensrq-87, s-gp-88, v-tl-84, vc-ucrfe-71, ZZZ"
+, update =      "98.07 bibrelex, 96.09 devillers+romanik, 94.05 smid"
 }
 
 @article{rs-tgo-94
-, author =	"Kathleen Romanik and Carl Smith"
-, title =	"Testing geometric objects"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"157--176"
-, keywords =	"probing, point probes, testing"
-, succeeds =	"rs-tgo-90i"
-, update =	"96.09 devillers+romanik"
+, author =      "Kathleen Romanik and Carl Smith"
+, title =       "Testing geometric objects"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "157--176"
+, keywords =    "probing, point probes, testing"
+, succeeds =    "rs-tgo-90i"
+, update =      "96.09 devillers+romanik"
 }
 
 @inproceedings{rv-uclta-93
-, author =	"K. Romanik and J. S. Vitter"
-, title =	"Using Computational Learning Theory to Analyze the Testing Complexity of Program Segments"
-, booktitle =	"Proceedings of the 17th Annual IEEE International Computer Software and Applications Conference"
-, nickname =	"COMPSAC '93"
-, month =	nov
-, year =	1993
-, pages =	"367--373"
-, keywords =	"random testing, software complexity, Vapnik-Chervonenkis dimension, pseudo dimension"
-, comments =	"To appear in Inform. Comput."
-, update =	"96.09 romanik, 94.09 vitter"
+, author =      "K. Romanik and J. S. Vitter"
+, title =       "Using Computational Learning Theory to Analyze the Testing Complexity of Program Segments"
+, booktitle =   "Proceedings of the 17th Annual IEEE International Computer Software and Applications Conference"
+, nickname =    "COMPSAC '93"
+, month =       nov
+, year =        1993
+, pages =       "367--373"
+, keywords =    "random testing, software complexity, Vapnik-Chervonenkis dimension, pseudo dimension"
+, comments =    "To appear in Inform. Comput."
+, update =      "96.09 romanik, 94.09 vitter"
 }
 
 @techreport{rggr-esaac-94
-, author =	"B. Romney and C. Godard and M. Goldwasser and G. Ramkumar"
-, title =	"An efficient system for analyzing assembly complexity"
-, type =	"Manuscript"
-, institution =	"Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "B. Romney and C. Godard and M. Goldwasser and G. Ramkumar"
+, title =       "An efficient system for analyzing assembly complexity"
+, type =        "Manuscript"
+, institution = "Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{r-tclir-90
-, author =	"J. T. Rompel"
-, title =	"Techniques for Computing with Low-Independence Randomness"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept.\ of EECS, M.I.T."
-, year =	1990
-, keywords =	"doctoral thesis"
-, update =	"96.09 orourke"
+, author =      "J. T. Rompel"
+, title =       "Techniques for Computing with Low-Independence Randomness"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept.\ of EECS, M.I.T."
+, year =        1990
+, keywords =    "doctoral thesis"
+, update =      "96.09 orourke"
 }
 
-%, address =	"Oslo, Norway"
-%, month =	sep
+%, address =    "Oslo, Norway"
+%, month =      sep
 @article{rr-tmcps-94
-, author =	"R. Ronfard and J. R. Rossignac"
-, title =	"Triangulating multiply-connected polygons: A simple yet efficient algorithm"
-, journal =	"Comput. Graph. Forum"
-, volume =	13
-, number =	3
-, year =	1994
-, pages =	"C281--292"
-, note =	"Proc. Eurographics '94"
-, update =	"95.05 orourke"
+, author =      "R. Ronfard and J. R. Rossignac"
+, title =       "Triangulating multiply-connected polygons: A simple yet efficient algorithm"
+, journal =     "Comput. Graph. Forum"
+, volume =      13
+, number =      3
+, year =        1994
+, pages =       "C281--292"
+, note =        "Proc. Eurographics '94"
+, update =      "95.05 orourke"
 }
 
 @article{r-bdcc-89
-, author =	"C. Ronse"
-, title =	"A bibliography on digital and computational convexity"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	11
-, year =	1989
-, pages =	"181--190"
-, keywords =	"bibliography"
-, abstract =	"This bibliography collects over 350 references of
-		 books, papers in serial journals, and conference
-		 papers, on convexity in relation to computer science.
-		 The subject is subdivided into five topics: convexity
-		 and straightness in digital images; convex hull
-		 algorithms and their complexity; other computational
-		 problems related to convexity; miscellaneous
-		 applications; general mathematical sources. These
-		 references range in time from 1961 to September 1988."
+, author =      "C. Ronse"
+, title =       "A bibliography on digital and computational convexity"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      11
+, year =        1989
+, pages =       "181--190"
+, keywords =    "bibliography"
+, abstract =    "This bibliography collects over 350 references of
+                 books, papers in serial journals, and conference
+                 papers, on convexity in relation to computer science.
+                 The subject is subdivided into five topics: convexity
+                 and straightness in digital images; convex hull
+                 algorithms and their complexity; other computational
+                 problems related to convexity; miscellaneous
+                 applications; general mathematical sources. These
+                 references range in time from 1961 to September 1988."
 }
 
 @article{r-srsrf-77
-, author =	"J. Rooney"
-, title =	"A Survey of Representations of Spatial Rotation about a Fixed Point"
-, journal =	"Environment and Planning B"
-, volume =	4
-, year =	1977
-, pages =	"185--210"
-, update =	"98.11 bibrelex"
+, author =      "J. Rooney"
+, title =       "A Survey of Representations of Spatial Rotation about a Fixed Point"
+, journal =     "Environment and Planning B"
+, volume =      4
+, year =        1977
+, pages =       "185--210"
+, update =      "98.11 bibrelex"
 }
 
 @phdthesis{r-dvd-91
-, author =	"T. Roos"
-, title =	"Dynamic {Voronoi} diagrams"
-, type =	"Ph.{D}. Thesis"
-, school =	"Bayerische Julius-Maximilians-Univ."
-, address =	"W{\"u}rzburg, Germany"
-, month =	sep
-, year =	1991
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "T. Roos"
+, title =       "Dynamic {Voronoi} diagrams"
+, type =        "Ph.{D}. Thesis"
+, school =      "Bayerische Julius-Maximilians-Univ."
+, address =     "W{\"u}rzburg, Germany"
+, month =       sep
+, year =        1991
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{r-knnvd-89
-, author =	"T. Roos"
-, title =	"$k$-Nearest-Neighbor {Voronoi} Diagrams for Sets of Convex Polygons, Line Segments and Points"
-, booktitle =	"Proc. 15th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	411
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"330--340"
-, update =	"99.11 bibrelex, 98.11 smid, 94.05 smid, 93.09 milone+mitchell"
+, author =      "T. Roos"
+, title =       "$k$-Nearest-Neighbor {Voronoi} Diagrams for Sets of Convex Polygons, Line Segments and Points"
+, booktitle =   "Proc. 15th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      411
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "330--340"
+, update =      "99.11 bibrelex, 98.11 smid, 94.05 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{r-knnvd-89c
-, author =	"T. Roos"
-, title =	"{$k$}-Nearest-Neighbor {Voronoi} Diagrams for Sets of Convex Polygons, Line Segments, and Points"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "T. Roos"
+, title =       "{$k$}-Nearest-Neighbor {Voronoi} Diagrams for Sets of Convex Polygons, Line Segments, and Points"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{r-tbvdm-93
-, author =	"T. Roos"
-, title =	"Tighter bounds on {Voronoi} diagrams of moving points"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"358--363"
-, cites =	"ar-vdmph-92, e-acg-87, fl-vdmpp-91, gs-pmgsc-85, gmr-vdmpp-92, hd-kgde-60, ii-vdmp-90, k-cddvd-80, o-cgc12-91a, r-vdds-90, r-dvd-91, r-vdds-93, ra-mphds-92, a-tddvd-91, s-cvdhd-82, ZZZ"
-, update =	"99.11 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "T. Roos"
+, title =       "Tighter bounds on {Voronoi} diagrams of moving points"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "358--363"
+, cites =       "ar-vdmph-92, e-acg-87, fl-vdmpp-91, gs-pmgsc-85, gmr-vdmpp-92, hd-kgde-60, ii-vdmp-90, k-cddvd-80, o-cgc12-91a, r-vdds-90, r-dvd-91, r-vdds-93, ra-mphds-92, a-tddvd-91, s-cvdhd-82, ZZZ"
+, update =      "99.11 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @mastersthesis{r-vd-88
-, author =	"T. Roos"
-, title =	"Voronoi {Diagramme}"
-, school =	"Universit{\"a}t W{\"u}rzburg"
-, address =	"W{\"u}rzburg, West Germany"
-, year =	1988
-, note =	"Diploma Thesis"
-, keywords =	"master thesis"
-, update =	"98.07 bibrelex"
+, author =      "T. Roos"
+, title =       "Voronoi {Diagramme}"
+, school =      "Universit{\"a}t W{\"u}rzburg"
+, address =     "W{\"u}rzburg, West Germany"
+, year =        1988
+, note =        "Diploma Thesis"
+, keywords =    "master thesis"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{r-vdds-90
-, author =	"T. Roos"
-, title =	"Voronoi diagrams over dynamic scenes"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"209--213"
-, cites =	"agss-ltacv-87, ce-iacko-87, dl-gvdp-78, e-esaa-86, e-acg-87, f-savd-86, gkln-dvd-83, gs-pmgsc-85, hd-kgde-60, l-knnvd-82, n-cgia-88, ps-cgi-85, r-vd-88, r-knnvd-89, sh-cpp-75, y-oavds-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "T. Roos"
+, title =       "Voronoi diagrams over dynamic scenes"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "209--213"
+, cites =       "agss-ltacv-87, ce-iacko-87, dl-gvdp-78, e-esaa-86, e-acg-87, f-savd-86, gkln-dvd-83, gs-pmgsc-85, hd-kgde-60, l-knnvd-82, n-cgia-88, ps-cgi-85, r-vd-88, r-knnvd-89, sh-cpp-75, y-oavds-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{r-vdds-93
-, author =	"T. Roos"
-, title =	"Voronoi diagrams over dynamic scenes"
-, journal =	"Discrete Appl. Math."
-, volume =	43
-, year =	1993
-, pages =	"243--259"
-, succeeds =	"r-vdds-90"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, author =      "T. Roos"
+, title =       "Voronoi diagrams over dynamic scenes"
+, journal =     "Discrete Appl. Math."
+, volume =      43
+, year =        1993
+, pages =       "243--259"
+, succeeds =    "r-vdds-90"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @inproceedings{ra-mphds-92
-, author =	"T. Roos and G. Albers"
-, title =	"Maintaining Proximity in Higher Dimensional Spaces"
-, booktitle =	"Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
-, site =	"Prague, Czechoslovakia"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	629
-, month =	aug
-, year =	1992
-, pages =	"483--493"
-, update =	"98.11 bibrelex"
+, author =      "T. Roos and G. Albers"
+, title =       "Maintaining Proximity in Higher Dimensional Spaces"
+, booktitle =   "Proc. 17th Internat. Sympos. Math. Found. Comput. Sci."
+, site =        "Prague, Czechoslovakia"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      629
+, month =       aug
+, year =        1992
+, pages =       "483--493"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{rn-dvdmp-91
-, author =	"Thomas Roos and Hartmut Noltemeier"
-, title =	"Dynamic {Voronoi} diagrams in motion planning"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"227--236"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Thomas Roos and Hartmut Noltemeier"
+, title =       "Dynamic {Voronoi} diagrams in motion planning"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "227--236"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @incollection{rn-dvdmp-92
-, author =	"T. Roos and H. Noltemeier"
-, title =	"Dynamic {Voronoi} diagrams in motion planning"
-, booktitle =	"Proc. 15th IFIP Conf."
-, series =	"Lecture Notes in Control and Information Science"
-, volume =	180
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"102--111"
-, update =	"94.01 rote"
+, author =      "T. Roos and H. Noltemeier"
+, title =       "Dynamic {Voronoi} diagrams in motion planning"
+, booktitle =   "Proc. 15th IFIP Conf."
+, series =      "Lecture Notes in Control and Information Science"
+, volume =      180
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "102--111"
+, update =      "94.01 rote"
 }
 
 @techreport{rw-cmkla-92
-, author =	"T. Roos and P. Widmayer"
-, title =	"Computing the minimum of the $k$-level of an arrangement with applications"
-, type =	"Report"
-, number =	185
-, institution =	"Inst. Inform., Eidgen{\"o}ssische Tech. Hochschule Z{\"u}rich"
-, address =	"Z{\"u}rich, Switzerland"
-, year =	1992
-, update =	"93.05 smid"
+, author =      "T. Roos and P. Widmayer"
+, title =       "Computing the minimum of the $k$-level of an arrangement with applications"
+, type =        "Report"
+, number =      185
+, institution = "Inst. Inform., Eidgen{\"o}ssische Tech. Hochschule Z{\"u}rich"
+, address =     "Z{\"u}rich, Switzerland"
+, year =        1992
+, update =      "93.05 smid"
 }
 
 @article{rw-cmkla-94
-, author =	"T. Roos and P. Widmayer"
-, title =	"$k$-violation linear programming"
-, journal =	"Inform. Process. Lett."
-, volume =	52
-, year =	1994
-, pages =	"109--114"
-, update =	"98.07 agarwal"
+, author =      "T. Roos and P. Widmayer"
+, title =       "$k$-violation linear programming"
+, journal =     "Inform. Process. Lett."
+, volume =      52
+, year =        1994
+, pages =       "109--114"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{rm-vvdgv-94
-, author =	"Waldir L. Roque and Clovis Maliska Jr."
-, title =	"Visualization of {Vorononi} Diagrams Generated by {VORONOI2}"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"8--11"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Waldir L. Roque and Clovis Maliska Jr."
+, title =       "Visualization of {Vorononi} Diagrams Generated by {VORONOI2}"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "8--11"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{rt-adsrc-98
-, author =	"Llu{\'\i}s Ros and Frederico Thomas"
-, title =	"Applying Delta/Star Reductions for Checking the Spatial Realizability of Line Drawings"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"127--129"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Llu{\'\i}s Ros and Frederico Thomas"
+, title =       "Applying Delta/Star Reductions for Checking the Spatial Realizability of Line Drawings"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "127--129"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{r-aadss-74
-, author =	"D. Roselle"
-, title =	"An algorithmic approach to {Davenport--Schinzel} sequences"
-, journal =	"Utilitas Math."
-, volume =	6
-, year =	1974
-, pages =	"91--93"
-, update =	"95.09 agarwal"
+, author =      "D. Roselle"
+, title =       "An algorithmic approach to {Davenport--Schinzel} sequences"
+, journal =     "Utilitas Math."
+, volume =      6
+, year =        1974
+, pages =       "91--93"
+, update =      "95.09 agarwal"
 }
 
 % ### others?
 @inproceedings{rs-rdss-70
-, author =	"D. Roselle and R. Stanton"
-, title =	"Results on {Davenport--Schinzel} sequences"
-, editor =	"R. Mullin and others"
-, booktitle =	"Congressus Numer. I, Proc. Louisiana Conf. on Combinatorics, Graph Theory, and Computing"
-, year =	1970
-, pages =	"249--267"
-, update =	"95.09 agarwal"
+, author =      "D. Roselle and R. Stanton"
+, title =       "Results on {Davenport--Schinzel} sequences"
+, editor =      "R. Mullin and others"
+, booktitle =   "Congressus Numer. I, Proc. Louisiana Conf. on Combinatorics, Graph Theory, and Computing"
+, year =        1970
+, pages =       "249--267"
+, update =      "95.09 agarwal"
 }
 
 @article{rs-spdss-71
-, author =	"D. Roselle and R. Stanton"
-, title =	"Some properties of {Davenport--Schinzel} sequences"
-, journal =	"Acta Arithmetica"
-, volume =	17
-, year =	1971
-, pages =	"355--362"
-, update =	"95.09 agarwal"
+, author =      "D. Roselle and R. Stanton"
+, title =       "Some properties of {Davenport--Schinzel} sequences"
+, journal =     "Acta Arithmetica"
+, volume =      17
+, year =        1971
+, pages =       "355--362"
+, update =      "95.09 agarwal"
 }
 
 @article{r-tdvcs-83
-, author =	"A. L. Rosenberg"
-, title =	"Three-Dimensional {VLSI}: a case study"
-, journal =	"J. ACM"
-, volume =	30
-, number =	3
-, year =	1983
-, pages =	"397--416"
-, keywords =	"graph drawing, 3D, orthogonal"
-, update =	"96.09 tamassia"
+, author =      "A. L. Rosenberg"
+, title =       "Three-Dimensional {VLSI}: a case study"
+, journal =     "J. ACM"
+, volume =      30
+, number =      3
+, year =        1983
+, pages =       "397--416"
+, keywords =    "graph drawing, 3D, orthogonal"
+, update =      "96.09 tamassia"
 }
 
 @article{rl-cvp-73
-, author =	"B. Rosenberg and D. J. Landridge"
-, title =	"A computational view of perception"
-, journal =	"Perception"
-, volume =	2
-, year =	1973
-, pages =	"415--424"
+, author =      "B. Rosenberg and D. J. Landridge"
+, title =       "A computational view of perception"
+, journal =     "Perception"
+, volume =      2
+, year =        1973
+, pages =       "415--424"
 }
 
 @mastersthesis{r-licab-90
-, author =	"C. Rosenberg"
-, title =	"A lossy image compression algorithm based on nonuniform sampling and interpolation of image intensity surfaces"
-, school =	"Electrical Engineering and Computer Science, Mass. Inst. of Tech."
-, year =	1990
-, keywords =	"master thesis"
-, update =	"98.07 bibrelex"
+, author =      "C. Rosenberg"
+, title =       "A lossy image compression algorithm based on nonuniform sampling and interpolation of image intensity surfaces"
+, school =      "Electrical Engineering and Computer Science, Mass. Inst. of Tech."
+, year =        1990
+, keywords =    "master thesis"
+, update =      "98.07 bibrelex"
 }
 
 @article{rs-lbatc-75
-, author =	"I. G. Rosenberg and F. Stenger"
-, title =	"A lower bound on the angles of triangles constructed by bisecting the longes side"
-, journal =	"Math. Comput."
-, volume =	29
-, year =	1975
-, pages =	"390--395"
-, update =	"98.11 bibrelex"
+, author =      "I. G. Rosenberg and F. Stenger"
+, title =       "A lower bound on the angles of triangles constructed by bisecting the longes side"
+, journal =     "Math. Comput."
+, volume =      29
+, year =        1975
+, pages =       "390--395"
+, update =      "98.11 bibrelex"
 }
 
 @mastersthesis{r-okvds-88
-, author =	"H. Rosenberger"
-, title =	"Order $k$ {Voronoi} diagrams of sites with additive weights in the plane"
-, type =	"M.{Sc}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1988
-, note =	"Report UIUCDCS-R-88-1431"
-, keywords =	"discrete and computational geometry, Voronoi diagrams, order-$k$, additive weight, combinatorial complexity, plane-sweep"
-, precedes =	"r-okvds-91"
-, update =	"93.05 jones"
+, author =      "H. Rosenberger"
+, title =       "Order $k$ {Voronoi} diagrams of sites with additive weights in the plane"
+, type =        "M.{Sc}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1988
+, note =        "Report UIUCDCS-R-88-1431"
+, keywords =    "discrete and computational geometry, Voronoi diagrams, order-$k$, additive weight, combinatorial complexity, plane-sweep"
+, precedes =    "r-okvds-91"
+, update =      "93.05 jones"
 }
 
 @article{r-okvds-91
-, author =	"H. Rosenberger"
-, title =	"Order $k$ {Voronoi} diagrams of sites with additive weights in the plane"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"153--181"
-, succeeds =	"r-okvds-88"
+, author =      "H. Rosenberger"
+, title =       "Order $k$ {Voronoi} diagrams of sites with additive weights in the plane"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "153--181"
+, succeeds =    "r-okvds-88"
 }
 
 @techreport{r-tvgps-85
-, author =	"H. Rosenberger"
-, title =	"Topological versus geometrical plane-sweep"
-, type =	"Manuscript"
-, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1985
+, author =      "H. Rosenberger"
+, title =       "Topological versus geometrical plane-sweep"
+, type =        "Manuscript"
+, institution = "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1985
 }
 
 @article{rs-shs-82
-, author =	"J. Rosenblatt and P. Seymour"
-, title =	"The structure of homometric sets"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	3
-, number =	3
-, year =	1982
-, pages =	"343--350"
-, update =	"97.11 bibrelex"
+, author =      "J. Rosenblatt and P. Seymour"
+, title =       "The structure of homometric sets"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      3
+, number =      3
+, year =        1982
+, pages =       "343--350"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{rr-mcp-92
-, author =	"A. Rosenbloom and D. Rappaport"
-, title =	"Moldable and castable polygons"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"322--327"
-, precedes =	"rr-mcp-94"
-, cites =	"cd-icott-87, hs-ompc-91, ll-ccmp-84, ps-cgi-85, ps-tspm-81, crs-mpc-90, ZZZ"
-, update =	"98.07 bibrelex, 96.09 devillers"
+, author =      "A. Rosenbloom and D. Rappaport"
+, title =       "Moldable and castable polygons"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "322--327"
+, precedes =    "rr-mcp-94"
+, cites =       "cd-icott-87, hs-ompc-91, ll-ccmp-84, ps-cgi-85, ps-tspm-81, crs-mpc-90, ZZZ"
+, update =      "98.07 bibrelex, 96.09 devillers"
 }
 
 @article{r-cdp-70
-, author =	"A. Rosenfeld"
-, title =	"Connectivity in digital pictures"
-, journal =	"J. ACM"
-, volume =	17
-, year =	1970
-, pages =	"146--160"
+, author =      "A. Rosenfeld"
+, title =       "Connectivity in digital pictures"
+, journal =     "J. ACM"
+, volume =      17
+, year =        1970
+, pages =       "146--160"
 }
 
 @inproceedings{r-dg-92
-, author =	"A. Rosenfeld"
-, title =	"Digital geometry"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	73
-, cites =	"ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "A. Rosenfeld"
+, title =       "Digital geometry"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       73
+, cites =       "ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{r-dsls-74
-, author =	"A. Rosenfeld"
-, title =	"Digital straight line segments"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-23"
-, year =	1974
-, pages =	"1264--1269"
-, update =	"97.11 bibrelex"
+, author =      "A. Rosenfeld"
+, title =       "Digital straight line segments"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-23"
+, year =        1974
+, pages =       "1264--1269"
+, update =      "97.11 bibrelex"
 }
 
 @article{rd-hcaat-83
-, author =	"A. Rosenfeld and P. {De La Torre}"
-, title =	"Histogram concavity analysis as an aid in threshold selection"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	"SMC-13"
-, year =	1983
-, pages =	"231--235"
+, author =      "A. Rosenfeld and P. {De La Torre}"
+, title =       "Histogram concavity analysis as an aid in threshold selection"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      "SMC-13"
+, year =        1983
+, pages =       "231--235"
 }
 
 @book{rk-dpp-82
-, author =	"A. Rosenfeld and A. C. Kak"
-, title =	"Digital picture processing"
-, volume =	"1--2"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1982
-, update =	"98.07 bibrelex"
+, author =      "A. Rosenfeld and A. C. Kak"
+, title =       "Digital picture processing"
+, volume =      "1--2"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1982
+, update =      "98.07 bibrelex"
 }
 
 @article{rp-sodpp-66
-, author =	"A. Rosenfeld and J. L. Pfaltz"
-, title =	"Sequential operations in digital picture processing"
-, journal =	"J. ACM"
-, volume =	13
-, year =	1966
-, pages =	"471--494"
+, author =      "A. Rosenfeld and J. L. Pfaltz"
+, title =       "Sequential operations in digital picture processing"
+, journal =     "J. ACM"
+, volume =      13
+, year =        1966
+, pages =       "471--494"
 }
 
 @techreport{rssw-ahdsg-82
-, author =	"A. Rosenfeld and H. Samet and C. Shaffer and R. E. Webber"
-, title =	"Application of hierarchical data structures to geographical information systems"
-, type =	"Computer Science"
-, number =	"TR--1197"
-, institution =	"University of Maryland"
-, address =	"College Park, MD"
-, month =	jun
-, year =	1982
-, update =	"96.05 efrat"
+, author =      "A. Rosenfeld and H. Samet and C. Shaffer and R. E. Webber"
+, title =       "Application of hierarchical data structures to geographical information systems"
+, type =        "Computer Science"
+, number =      "TR--1197"
+, institution = "University of Maryland"
+, address =     "College Park, MD"
+, month =       jun
+, year =        1982
+, update =      "96.05 efrat"
 }
 
 @techreport{rssw-ahdsg-83
-, author =	"A. Rosenfeld and H. Samet and C. Shaffer and R. E. Webber"
-, title =	"Application of hierarchical data structures to geographical information systems: phase II"
-, type =	"Computer Science Department"
-, number =	"TR--1327"
-, institution =	"University of Maryland"
-, address =	"College Park, MD"
-, month =	sep
-, year =	1983
-, update =	"96.05 efrat"
+, author =      "A. Rosenfeld and H. Samet and C. Shaffer and R. E. Webber"
+, title =       "Application of hierarchical data structures to geographical information systems: phase II"
+, type =        "Computer Science Department"
+, number =      "TR--1327"
+, institution = "University of Maryland"
+, address =     "College Park, MD"
+, month =       sep
+, year =        1983
+, update =      "96.05 efrat"
 }
 
 @book{rs-sp-77
-, author =	"B. A. Rosenfeld and N. D. Sergeeva"
-, title =	"Stereographic Projection"
-, publisher =	"Mir Publishers"
-, address =	"Moscow"
-, year =	1977
-, update =	"98.03 bibrelex"
+, author =      "B. A. Rosenfeld and N. D. Sergeeva"
+, title =       "Stereographic Projection"
+, publisher =   "Mir Publishers"
+, address =     "Moscow"
+, year =        1977
+, update =      "98.03 bibrelex"
 }
 
 @article{rsl-ashts-77
-, author =	"D. J. Rosenkrantz and R. E. Stearns and P. M. Lewis"
-, title =	"An analysis of several heuristics for the traveling salesman problem"
-, journal =	"SIAM J. Comput."
-, volume =	6
-, year =	1977
-, pages =	"563--581"
-, succeeds =	"rsl-aatsp-74"
+, author =      "D. J. Rosenkrantz and R. E. Stearns and P. M. Lewis"
+, title =       "An analysis of several heuristics for the traveling salesman problem"
+, journal =     "SIAM J. Comput."
+, volume =      6
+, year =        1977
+, pages =       "563--581"
+, succeeds =    "rsl-aatsp-74"
 }
 
 @inproceedings{rsl-aatsp-74
-, author =	"D. J. Rosenkrantz and R. E. Stearns and P. M. Lewis"
-, title =	"Approximate algorithms for the traveling salesperson problem"
-, booktitle =	"Proc. 15th Annu. IEEE Sympos. Switching Automata Theory"
-, year =	1974
-, pages =	"33--42"
-, precedes =	"rsl-ashts-77"
+, author =      "D. J. Rosenkrantz and R. E. Stearns and P. M. Lewis"
+, title =       "Approximate algorithms for the traveling salesperson problem"
+, booktitle =   "Proc. 15th Annu. IEEE Sympos. Switching Automata Theory"
+, year =        1974
+, pages =       "33--42"
+, precedes =    "rsl-ashts-77"
 }
 
 @incollection{r-ppdti-84
-, author =	"P. Rosenstiehl"
-, title =	"Planar permutations defined by two intersecting {Jordan} Curves"
-, booktitle =	"Graph Theory and Combinatorics"
-, publisher =	"Academic Press"
-, address =	"London, UK"
-, year =	1984
-, pages =	"259--271"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "P. Rosenstiehl"
+, title =       "Planar permutations defined by two intersecting {Jordan} Curves"
+, booktitle =   "Graph Theory and Combinatorics"
+, publisher =   "Academic Press"
+, address =     "London, UK"
+, year =        1984
+, pages =       "259--271"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{rt-gcphg-84
-, author =	"P. Rosenstiehl and R. E. Tarjan"
-, title =	"Gauss codes, planar {Hamiltonian} graphs, and stack-sortable permutations"
-, journal =	"J. Algorithms"
-, volume =	5
-, year =	1984
-, pages =	"375--390"
-, update =	"98.03 bibrelex"
+, author =      "P. Rosenstiehl and R. E. Tarjan"
+, title =       "Gauss codes, planar {Hamiltonian} graphs, and stack-sortable permutations"
+, journal =     "J. Algorithms"
+, volume =      5
+, year =        1984
+, pages =       "375--390"
+, update =      "98.03 bibrelex"
 }
 
 @article{rt-rplbo-86
-, author =	"P. Rosenstiehl and R. E. Tarjan"
-, title =	"Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, number =	4
-, year =	1986
-, pages =	"343--353"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "P. Rosenstiehl and R. E. Tarjan"
+, title =       "Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, number =      4
+, year =        1986
+, pages =       "343--353"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @phdthesis{r-bosm-85
-, author =	"J. Rossignac"
-, title =	"Blending and Offsetting Solid Models"
-, school =	"Dept. Elect. Engrg., Univ. Rochester"
-, address =	"Rochester, NY"
-, month =	jul
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "J. Rossignac"
+, title =       "Blending and Offsetting Solid Models"
+, school =      "Dept. Elect. Engrg., Univ. Rochester"
+, address =     "Rochester, NY"
+, month =       jul
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{ro-sdimp-89i
-, author =	"J. Rossignac and M. O'Connor"
-, title =	"SGC: {A} dimension-independent model for pointsets with internal structures and incomplete boundaries"
-, editor =	"M. Wozny and J. Turner and K. Preiss"
-, booktitle =	"Geometric Modeling for Product Engineering"
-, publisher =	"North-Holland"
-, year =	1989
-, precedes =	"or-sdimp-89t"
-, update =	"98.07 bibrelex"
+, author =      "J. Rossignac and M. O'Connor"
+, title =       "SGC: {A} dimension-independent model for pointsets with internal structures and incomplete boundaries"
+, editor =      "M. Wozny and J. Turner and K. Preiss"
+, booktitle =   "Geometric Modeling for Product Engineering"
+, publisher =   "North-Holland"
+, year =        1989
+, precedes =    "or-sdimp-89t"
+, update =      "98.07 bibrelex"
 }
 
 @article{rr-crbsm-84
-, author =	"J. Rossignac and A. Requicha"
-, title =	"Constant Radius Blending in Solid Modeling"
-, journal =	"Computers in Mechanical Engineering"
-, volume =	2
-, year =	1984
-, pages =	"655--673"
-, update =	"98.03 bibrelex"
+, author =      "J. Rossignac and A. Requicha"
+, title =       "Constant Radius Blending in Solid Modeling"
+, journal =     "Computers in Mechanical Engineering"
+, volume =      2
+, year =        1984
+, pages =       "655--673"
+, update =      "98.03 bibrelex"
 }
 
 @article{rr-oosm-86
-, author =	"J. Rossignac and A. Requicha"
-, title =	"Offsetting operations in solid modeling"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	3
-, year =	1986
-, pages =	"129--148"
-, update =	"98.07 bibrelex"
+, author =      "J. Rossignac and A. Requicha"
+, title =       "Offsetting operations in solid modeling"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      3
+, year =        1986
+, pages =       "129--148"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{r-cirfd-89
-, author =	"J. R. Rossignac"
-, title =	"Considerations on the interactive rendering of four-dimensional volumes"
-, booktitle =	"CH Volume Visualization Workshop"
-, year =	1989
-, pages =	"67--76"
-, update =	"98.07 bibrelex"
+, author =      "J. R. Rossignac"
+, title =       "Considerations on the interactive rendering of four-dimensional volumes"
+, booktitle =   "CH Volume Visualization Workshop"
+, year =        1989
+, pages =       "67--76"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{r-cfitf-96
-, author =	"J. R. Rossignac"
-, title =	"CSG formulations for identifying and for trimming faces of {CSG} models"
-, booktitle =	"CSG'96"
-, site =	"Winchester, UK"
-, publisher =	"Information Geometers"
-, month =	apr
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "J. R. Rossignac"
+, title =       "CSG formulations for identifying and for trimming faces of {CSG} models"
+, booktitle =   "CSG'96"
+, site =        "Winchester, UK"
+, publisher =   "Information Geometers"
+, month =       apr
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @techreport{rb-mr3da-92
-, author =	"J. R. Rossignac and P. Borrel"
-, title =	"Multi-Resolution {3D} Approximations for Rendering Complex Scenes"
-, type =	"Technical {Report}"
-, number =	"RC 17697 (\#77951)"
-, institution =	"IBM Research Division, T. J. Watson Research Center"
-, address =	"Yorktown Heights, NY 10958"
-, year =	1992
-, update =	"95.01 mitchell"
+, author =      "J. R. Rossignac and P. Borrel"
+, title =       "Multi-Resolution {3D} Approximations for Rendering Complex Scenes"
+, type =        "Technical {Report}"
+, number =      "RC 17697 (\#77951)"
+, institution = "IBM Research Division, T. J. Watson Research Center"
+, address =     "Yorktown Heights, NY 10958"
+, year =        1992
+, update =      "95.01 mitchell"
 }
 
 @article{rr-pccgm-87
-, author =	"J. R. Rossignac and A. A. G. Requicha"
-, title =	"Piecewise-circular curves for geometric modeling"
-, journal =	"IBM J. Res. Develop."
-, volume =	31
-, year =	1987
-, pages =	"296--313"
+, author =      "J. R. Rossignac and A. A. G. Requicha"
+, title =       "Piecewise-circular curves for geometric modeling"
+, journal =     "IBM J. Res. Develop."
+, volume =      31
+, year =        1987
+, pages =       "296--313"
 }
 
 @techreport{rv-azcsg-86
-, author =	"J. R. Rossignac and H. B. Voelcker"
-, title =	"Active zones in constructive solid geometry for redundancy and interference detection"
-, type =	"Report"
-, number =	"RC 11991 (\#53914)"
-, institution =	"Auto. Res. Sci., IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1986
-, keywords =	"computer graphics"
+, author =      "J. R. Rossignac and H. B. Voelcker"
+, title =       "Active zones in constructive solid geometry for redundancy and interference detection"
+, type =        "Report"
+, number =      "RC 11991 (\#53914)"
+, institution = "Auto. Res. Sci., IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1986
+, keywords =    "computer graphics"
 }
 
 @techreport{rv-azcab-88
-, author =	"J. R. Rossignac and H. B. Voelcker"
-, title =	"Active Zones in {CSG} for Accelerating Boundary Evaluation, Redundancy Evaluation, Interference Detection, and Shading Algorithms"
-, number =	"RC-13490"
-, institution =	"IBM Thomas J. Watson Research Center"
-, address =	"Yorktown Heights, NY 10598, USA"
-, month =	feb
-, year =	1988
-, comments =	"appears in ACM Trans. on Graphics, Jan '89"
-, update =	"93.09 held"
+, author =      "J. R. Rossignac and H. B. Voelcker"
+, title =       "Active Zones in {CSG} for Accelerating Boundary Evaluation, Redundancy Evaluation, Interference Detection, and Shading Algorithms"
+, number =      "RC-13490"
+, institution = "IBM Thomas J. Watson Research Center"
+, address =     "Yorktown Heights, NY 10598, USA"
+, month =       feb
+, year =        1988
+, comments =    "appears in ACM Trans. on Graphics, Jan '89"
+, update =      "93.09 held"
 }
 
 @inproceedings{r-cfecp-92
-, author =	"V. Rosta"
-, title =	"Combinatorial face enumeration in convex polytopes"
-, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
-, site =	"Kyoto, Japan"
-, year =	1992
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "V. Rosta"
+, title =       "Combinatorial face enumeration in convex polytopes"
+, booktitle =   "Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
+, site =        "Kyoto, Japan"
+, year =        1992
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{r-nmbph-92
-, author =	"G{\"u}nter Rote"
-, title =	"A new metric between polygons, and how to compute it"
-, booktitle =	"Proc. 19th Internat. Colloq. Automata Lang. Program."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	623
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"404--415"
-, keywords =	"bounded Lipschitz distance, Kantorovich Rubinshtein metric, transportation metric"
-, update =	"98.03 mitchell, 97.03 rote, 96.05 agarwal, 93.09 milone+mitchell+rote"
-, abstract =	"The bounded Lipschitz distance can be used as a distance
-		measure between polygons or between functions. It has several
-		properties which make it attractive to use from the viewpoint of
-		applications like pattern matching or quality control of woven
-		fabrics. There are several alternative definitions of the metric,
-		some of which are interesting in their own right. The bounded
-		Lipschitz distance is related to the Monge-Kantorovich mass
-		transfer problem, whose history goes back to 18th century work
-		of G. Monge and to L. Kantorovitch.
-		We also give an algorithm for computing the metric, and we
-		discuss possible implementations."
+, author =      "G{\"u}nter Rote"
+, title =       "A new metric between polygons, and how to compute it"
+, booktitle =   "Proc. 19th Internat. Colloq. Automata Lang. Program."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      623
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "404--415"
+, keywords =    "bounded Lipschitz distance, Kantorovich Rubinshtein metric, transportation metric"
+, update =      "98.03 mitchell, 97.03 rote, 96.05 agarwal, 93.09 milone+mitchell+rote"
+, abstract =    "The bounded Lipschitz distance can be used as a distance
+                measure between polygons or between functions. It has several
+                properties which make it attractive to use from the viewpoint of
+                applications like pattern matching or quality control of woven
+                fabrics. There are several alternative definitions of the metric,
+                some of which are interesting in their own right. The bounded
+                Lipschitz distance is related to the Monge-Kantorovich mass
+                transfer problem, whose history goes back to 18th century work
+                of G. Monge and to L. Kantorovitch.
+                We also give an algorithm for computing the metric, and we
+                discuss possible implementations."
 }
 
 @article{r-cmhdb-91
-, author =	"G{\"u}nter Rote"
-, title =	"Computing the minimum {Hausdorff} distance between two point sets on a line under translation"
-, journal =	"Inform. Process. Lett."
-, volume =	38
-, number =	3
-, month =	may
-, year =	1991
-, pages =	"123--127"
-, keywords =	"pattern recognition, pattern matching"
-, cites =	"hk-cmhdp-90"
-, update =	"98.11 bibrelex, 98.03 mitchell, 94.01 rote, 93.09 rote"
-, abstract =	"Given two sets of points on a line, we want to translate
-		 one of them so that their Hausdorff distance (the maximum
-		 of the distances from a point in any of the sets to the
-		 nearest point in the other set) is as small as possible.
-		 We present an optimal $O(n \log n)$ algorithm for this
-		 problem."
+, author =      "G{\"u}nter Rote"
+, title =       "Computing the minimum {Hausdorff} distance between two point sets on a line under translation"
+, journal =     "Inform. Process. Lett."
+, volume =      38
+, number =      3
+, month =       may
+, year =        1991
+, pages =       "123--127"
+, keywords =    "pattern recognition, pattern matching"
+, cites =       "hk-cmhdp-90"
+, update =      "98.11 bibrelex, 98.03 mitchell, 94.01 rote, 93.09 rote"
+, abstract =    "Given two sets of points on a line, we want to translate
+                 one of them so that their Hausdorff distance (the maximum
+                 of the distances from a point in any of the sets to the
+                 nearest point in the other set) is as small as possible.
+                 We present an optimal $O(n \log n)$ algorithm for this
+                 problem."
 }
 
 @article{r-cic-94
-, author =	"G{\"u}nther Rote"
-, title =	"Curves with increasing chords"
-, journal =	"Math. Proc. Camb. Phil. Soc."
-, volume =	115
-, year =	1994
-, pages =	"1--12"
-, update =	"99.03 bibrelex, 97.03 icking"
+, author =      "G{\"u}nther Rote"
+, title =       "Curves with increasing chords"
+, journal =     "Math. Proc. Camb. Phil. Soc."
+, volume =      115
+, year =        1994
+, pages =       "1--12"
+, update =      "99.03 bibrelex, 97.03 icking"
 }
 
 @inproceedings{r-dchhd-92
-, author =	"G{\"u}nter Rote"
-, title =	"Degenerate convex hulls in high dimensions without extra storage"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"26--32"
-, cites =	"af-pachv-91, bcn-drg-89, ck-acp-70, chj-ololv-91, cjr-cdtsp-90, mr-scmfa-80, p-pc-89, s-lpchm-90, sw-cblpr-92, s-fchff-85, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex, 93.09 rote"
+, author =      "G{\"u}nter Rote"
+, title =       "Degenerate convex hulls in high dimensions without extra storage"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "26--32"
+, cites =       "af-pachv-91, bcn-drg-89, ck-acp-70, chj-ololv-91, cjr-cdtsp-90, mr-scmfa-80, p-pc-89, s-lpchm-90, sw-cblpr-92, s-fchff-85, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex, 93.09 rote"
 }
 
 @inproceedings{r-qcsaa-90
-, author =	"G. Rote"
-, title =	"Quadratic convergence of the sandwich algorithms for approximating convex functions and convex figures in the plane"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, site =	"Ottawa, ON"
-, year =	1990
-, pages =	"120--124"
-, update =	"98.03 bibrelex"
+, author =      "G. Rote"
+, title =       "Quadratic convergence of the sandwich algorithms for approximating convex functions and convex figures in the plane"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, site =        "Ottawa, ON"
+, year =        1990
+, pages =       "120--124"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{r-crsaa-90
-, author =	"G. Rote"
-, title =	"The convergence rate of the {Sandwich} algorithm for approximating convex figures in the plane"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"287--290"
-, precedes =	"r-crsaa-92"
-, cites =	"bhr-saucf-91, c-ocfpl-71, cy-sp-87, e-acg-87, fmrwy-sioas-90, fmrwy-sioas-92, fbr-accab-89, g-acb-83, ii-oaapl-86a, m-jtlfe-62, mv-papcb-75, s-sooau-84, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 93.09 rote"
+, author =      "G. Rote"
+, title =       "The convergence rate of the {Sandwich} algorithm for approximating convex figures in the plane"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "287--290"
+, precedes =    "r-crsaa-92"
+, cites =       "bhr-saucf-91, c-ocfpl-71, cy-sp-87, e-acg-87, fmrwy-sioas-90, fmrwy-sioas-92, fbr-accab-89, g-acb-83, ii-oaapl-86a, m-jtlfe-62, mv-papcb-75, s-sooau-84, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 93.09 rote"
 }
 
 @article{r-crsaa-92
-, author =	"G{\"u}nter Rote"
-, title =	"The convergence rate of the {Sandwich} algorithm for approximating convex functions"
-, journal =	"Computing"
-, volume =	48
-, year =	1992
-, pages =	"337--361"
-, succeeds =	"r-crsaa-90"
-, cites =	"bhr-saucf-91"
-, update =	"98.03 mitchell, 97.03 rote"
-, abstract =	"The Sandwich algorithm approximates a convex function of
-		one variable over an interval by evaluating the function and its
-		derivative at a sequence of points. The connection of the
-		obtained points is a piecewise linear upper approximation, and
-		the tangents yield a piecewise linear lower approximation.
-		Similarly, a PLANAR CONVEX FIGURE can be approximated by
-		convex polygons.
-		Different versions of the Sandwich algorithm use different rules
-		for selecting the next evaluation point. We consider four natural
-		rules (interval bisection, slope bisection, maximum error rule,
-		and chord rule) and show that the global approximation error
-		with $n$ evaluation points decreases by the order of $O(1/n^2)$,
-		which is optimal."
+, author =      "G{\"u}nter Rote"
+, title =       "The convergence rate of the {Sandwich} algorithm for approximating convex functions"
+, journal =     "Computing"
+, volume =      48
+, year =        1992
+, pages =       "337--361"
+, succeeds =    "r-crsaa-90"
+, cites =       "bhr-saucf-91"
+, update =      "98.03 mitchell, 97.03 rote"
+, abstract =    "The Sandwich algorithm approximates a convex function of
+                one variable over an interval by evaluating the function and its
+                derivative at a sequence of points. The connection of the
+                obtained points is a piecewise linear upper approximation, and
+                the tangents yield a piecewise linear lower approximation.
+                Similarly, a PLANAR CONVEX FIGURE can be approximated by
+                convex polygons.
+                Different versions of the Sandwich algorithm use different rules
+                for selecting the next evaluation point. We consider four natural
+                rules (interval bisection, slope bisection, maximum error rule,
+                and chord rule) and show that the global approximation error
+                with $n$ evaluation points decreases by the order of $O(1/n^2)$,
+                which is optimal."
 }
 
 @article{r-nltsp-92
-, author =	"G{\"u}nter Rote"
-, title =	"The {$N$}-line traveling salesman problem"
-, journal =	"Networks"
-, volume =	22
-, year =	1992
-, pages =	"91--108"
-, keywords =	"optimization"
-, comments =	"replaces the techreport r-nltsp-88"
-, update =	"98.03 mitchell, 96.05 efrat, 93.09 rote"
-, annote =	"For the 3-line TSP, see ddl-chlts-92"
-, abstract =	"The special case of the Euclidean traveling salesman problem,
-		 where the $n$ given points lie on a small number ($N$)
-		 of parallel lines in the plane, is solved by a dynamic
-		 programming approach in $O(n^N)$ time, for fixed $N$, ..."
+, author =      "G{\"u}nter Rote"
+, title =       "The {$N$}-line traveling salesman problem"
+, journal =     "Networks"
+, volume =      22
+, year =        1992
+, pages =       "91--108"
+, keywords =    "optimization"
+, comments =    "replaces the techreport r-nltsp-88"
+, update =      "98.03 mitchell, 96.05 efrat, 93.09 rote"
+, annote =      "For the 3-line TSP, see ddl-chlts-92"
+, abstract =    "The special case of the Euclidean traveling salesman problem,
+                 where the $n$ given points lie on a small number ($N$)
+                 of parallel lines in the plane, is solved by a dynamic
+                 programming approach in $O(n^N)$ time, for fixed $N$, ..."
 }
 
 @inproceedings{rss-mawsp-93
-, author =	"G{\"u}nter Rote and C. Schwarz and J. Snoeyink"
-, title =	"Maintaining the approximate width of a set of points in the plane"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"258--263"
-, succeeds =	"s-sdmwp-92"
-, cites =	"hs-asdch-90, ht-cws-85, ht-cws-88, j-mwdpp-91, ks-tpscv-93, ks-ccssb-93, m-dea-86, mn-dfc-90, ol-mcp-81, p-ortap-79, s-sdmwp-92, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 rote, 94.01 rote+smid, 93.09 rote"
-, abstract =	"We maintain the set of points under insertions and deletions of
-		points and we are able to report an approximation of the width
-		of this dynamic point set. Our data structure takes linear space
-		and allows for reporting the approximation with relative
-		accuracy $\epsilon$ in $O(sqrt(1/\epsilon)log n)$ time; and the
-		update time is $O(\log^2 n)$. The method uses the tentative
-		prune-and-search strategy of Kirkpatrick and Snoeyink."
+, author =      "G{\"u}nter Rote and C. Schwarz and J. Snoeyink"
+, title =       "Maintaining the approximate width of a set of points in the plane"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "258--263"
+, succeeds =    "s-sdmwp-92"
+, cites =       "hs-asdch-90, ht-cws-85, ht-cws-88, j-mwdpp-91, ks-tpscv-93, ks-ccssb-93, m-dea-86, mn-dfc-90, ol-mcp-81, p-ortap-79, s-sdmwp-92, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 97.03 rote, 94.01 rote+smid, 93.09 rote"
+, abstract =    "We maintain the set of points under insertions and deletions of
+                points and we are able to report an approximation of the width
+                of this dynamic point set. Our data structure takes linear space
+                and allows for reporting the approximation with relative
+                accuracy $\epsilon$ in $O(sqrt(1/\epsilon)log n)$ time; and the
+                update time is $O(\log^2 n)$. The method uses the tentative
+                prune-and-search strategy of Kirkpatrick and Snoeyink."
 }
 
 @article{rt-sdapa-95
-, author =	"G{\"u}nter Rote and Robert Franz Tichy"
-, title =	"Spherical Dispersion with an Application to Polygonal Approximation of Curves"
-, journal =	"Anz. {\"O}sterreich. Akad. Wiss., Math.-natur. Kl., Abt. II"
-, volume =	132
-, year =	1995
-, pages =	"3--10"
-, update =	"97.03 rote"
-, abstract =	"We describe and analyze a procedure for the polygonal
-		approximation of spatial curves using well-distributed
-		points on the sphere. Here the dispersion of the point set
-		with respect to spherical slices (intersections of two
-		half-spheres) plays a role."
+, author =      "G{\"u}nter Rote and Robert Franz Tichy"
+, title =       "Spherical Dispersion with an Application to Polygonal Approximation of Curves"
+, journal =     "Anz. {\"O}sterreich. Akad. Wiss., Math.-natur. Kl., Abt. II"
+, volume =      132
+, year =        1995
+, pages =       "3--10"
+, update =      "97.03 rote"
+, abstract =    "We describe and analyze a procedure for the polygonal
+                approximation of spatial curves using well-distributed
+                points on the sphere. Here the dispersion of the point set
+                with respect to spherical slices (intersections of two
+                half-spheres) plays a role."
 }
 
 @techreport{rw-cmlps-89
-, author =	"G{\"u}nter Rote and G. Woeginger"
-, title =	"Computing a minimum link path among a set of obstacles in the plane"
-, type =	"Manusript"
-, institution =	"Tech. Univ. Graz"
-, year =	1989
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "G{\"u}nter Rote and G. Woeginger"
+, title =       "Computing a minimum link path among a set of obstacles in the plane"
+, type =        "Manusript"
+, institution = "Tech. Univ. Graz"
+, year =        1989
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{rw-cckgp-92
-, author =	"G{\"u}nter Rote and G. Woeginger"
-, title =	"Counting Convex $k$-gons in Planar Point Sets"
-, journal =	"Inform. Process. Lett."
-, volume =	41
-, year =	1992
-, pages =	"191--194"
-, keywords =	"convexity, combinatorics"
-, cites =	"rwzw-cksck-91"
-, update =	"98.03 mitchell, 97.11 bibrelex, 97.03 rote, 94.01 rote"
-, annote =	"complexity was improved by the techniques
-		 of eorw-fmakg-92, see mrsw-ccppp-95"
+, author =      "G{\"u}nter Rote and G. Woeginger"
+, title =       "Counting Convex $k$-gons in Planar Point Sets"
+, journal =     "Inform. Process. Lett."
+, volume =      41
+, year =        1992
+, pages =       "191--194"
+, keywords =    "convexity, combinatorics"
+, cites =       "rwzw-cksck-91"
+, update =      "98.03 mitchell, 97.11 bibrelex, 97.03 rote, 94.01 rote"
+, annote =      "complexity was improved by the techniques
+                 of eorw-fmakg-92, see mrsw-ccppp-95"
 }
 
 @techreport{rw-gc-89
-, author =	"G. Rote and G. Woeginger"
-, title =	"Geometric clusterings"
-, type =	"Technical Report"
-, number =	"B-89-04"
-, institution =	"Freie Universit{\"a}t Berlin"
-, month =	apr
-, year =	1989
-, note =	"Serie B-Informatik"
-, precedes =	"crw-gc-90, crw-gc-91"
-, update =	"98.07 bibrelex"
+, author =      "G. Rote and G. Woeginger"
+, title =       "Geometric clusterings"
+, type =        "Technical Report"
+, number =      "B-89-04"
+, institution = "Freie Universit{\"a}t Berlin"
+, month =       apr
+, year =        1989
+, note =        "Serie B-Informatik"
+, precedes =    "crw-gc-90, crw-gc-91"
+, update =      "98.07 bibrelex"
 }
 
 @article{rwzw-cksck-91
-, author =	"G{\"u}nter Rote and G. Woeginger and Binhai Zhu and Zhengyan Wang"
-, title =	"Counting $k$-subsets and convex $k$-gons in the plane"
-, journal =	"Inform. Process. Lett."
-, volume =	38
-, year =	1991
-, pages =	"149--151"
-, update =	"98.03 mitchell, 97.03 rote, 94.01 rote"
-, annote =	"improved by rw-cckgp-92, further improved by the
-		 techniques of eorw-fmakg-92, see mrsw-ccppp-95"
+, author =      "G{\"u}nter Rote and G. Woeginger and Binhai Zhu and Zhengyan Wang"
+, title =       "Counting $k$-subsets and convex $k$-gons in the plane"
+, journal =     "Inform. Process. Lett."
+, volume =      38
+, year =        1991
+, pages =       "149--151"
+, update =      "98.03 mitchell, 97.03 rote, 94.01 rote"
+, annote =      "improved by rw-cckgp-92, further improved by the
+                 techniques of eorw-fmakg-92, see mrsw-ccppp-95"
 }
 
 @article{r-id-54
-, author =	"K. F. Roth"
-, title =	"On irregularities of distribution"
-, journal =	"Mathematica"
-, volume =	1
-, year =	1954
-, pages =	"73--79"
-, update =	"98.03 bibrelex"
+, author =      "K. F. Roth"
+, title =       "On irregularities of distribution"
+, journal =     "Mathematica"
+, volume =      1
+, year =        1954
+, pages =       "73--79"
+, update =      "98.03 bibrelex"
 }
 
 @article{r-rcms-82
-, author =	"S. D. Roth"
-, title =	"Ray Casting for Modeling Solids"
-, journal =	"Comput. Graph. Image Process."
-, volume =	18
-, year =	1982
-, pages =	"109--144"
-, update =	"93.09 goodrich"
+, author =      "S. D. Roth"
+, title =       "Ray Casting for Modeling Solids"
+, journal =     "Comput. Graph. Image Process."
+, volume =      18
+, year =        1982
+, pages =       "109--144"
+, update =      "93.09 goodrich"
 }
 
 @inproceedings{r-aohr-90
-, author =	"Christoph Rothe"
-, title =	"{Algorithmen} in einem optimierten hierarchischen {Raumraster}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	21
-, update =	"00.03 bibrelex"
+, author =      "Christoph Rothe"
+, title =       "{Algorithmen} in einem optimierten hierarchischen {Raumraster}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       21
+, update =      "00.03 bibrelex"
 }
 
 @article{rs-tchnp-85
-, author =	"B. L. Rothschild and E. G. Straus"
-, title =	"On triangulations of the convex hull of $n$ points"
-, journal =	"Combinatorica"
-, volume =	5
-, year =	1985
-, pages =	"167--179"
+, author =      "B. L. Rothschild and E. G. Straus"
+, title =       "On triangulations of the convex hull of $n$ points"
+, journal =     "Combinatorica"
+, volume =      5
+, year =        1985
+, pages =       "167--179"
 }
 
 @book{r-iat-88
-, author =	"J. J. Rotman"
-, title =	"An Introduction to Algebraic Topology"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "J. J. Rotman"
+, title =       "An Introduction to Algebraic Topology"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @article{r-almnt-88
-, author =	"J.-P. Roudneff"
-, title =	"Arrangements of lines with a minimum number of triangles are simple"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"97--102"
+, author =      "J.-P. Roudneff"
+, title =       "Arrangements of lines with a minimum number of triangles are simple"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "97--102"
 }
 
 @book{rs-iplt-72
-, author =	"C. P. Rourke and B. J. Sanderson"
-, title =	"Introduction to Piecewise-Linear Topology"
-, publisher =	"Springer-Verlag"
-, year =	1972
-, update =	"97.11 bibrelex"
+, author =      "C. P. Rourke and B. J. Sanderson"
+, title =       "Introduction to Piecewise-Linear Topology"
+, publisher =   "Springer-Verlag"
+, year =        1972
+, update =      "97.11 bibrelex"
 }
 
 @article{r-msr-84
-, author =	"P. J. Rousseeuw"
-, title =	"Least median of squares regression"
-, journal =	"J. Amer. Statist. Assoc."
-, volume =	79
-, number =	388
-, month =	dec
-, year =	1984
-, pages =	"871--880"
-, update =	"98.07 bibrelex"
+, author =      "P. J. Rousseeuw"
+, title =       "Least median of squares regression"
+, journal =     "J. Amer. Statist. Assoc."
+, volume =      79
+, number =      388
+, month =       dec
+, year =        1984
+, pages =       "871--880"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{rh-dah-98
-, author =	"Peter J. Rousseeuw and Mia Hubert"
-, title =	"Depth in an Arrangement of Hyperplanes"
-, type =	"Manuscript"
-, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
-, month =	may
-, year =	1998
-, comments =	"To appear, Discrete Comput. Geom."
-, update =	"98.07 mitchell"
-, abstract =	"A collection of n hyperplanes in Rp forms a hyperplane
+, author =      "Peter J. Rousseeuw and Mia Hubert"
+, title =       "Depth in an Arrangement of Hyperplanes"
+, type =        "Manuscript"
+, institution = "Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
+, month =       may
+, year =        1998
+, comments =    "To appear, Discrete Comput. Geom."
+, update =      "98.07 mitchell"
+, abstract =    "A collection of n hyperplanes in Rp forms a hyperplane
 arrangement. The depth of any point $\theta$ in Rp is the smallest
 number of hyperplanes intersected by any halfline emanating from
 $\theta$. For p=2 we prove that there always exists a point $\theta$
@@ -124846,15 +124846,15 @@ @techreport{rh-dah-98
 }
 
 @techreport{rh-rd-96
-, author =	"Peter J. Rousseeuw and Mia Hubert"
-, title =	"Regression Depth"
-, type =	"Manuscript"
-, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
-, year =	1996
-, keywords =	"breakdown value, deepest fit, depth envelopes, halfspace depth, robust regression, simplicial depth"
-, comments =	"to appear, journal ??"
-, update =	"98.07 mitchell"
-, abstract =	"
+, author =      "Peter J. Rousseeuw and Mia Hubert"
+, title =       "Regression Depth"
+, type =        "Manuscript"
+, institution = "Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
+, year =        1996
+, keywords =    "breakdown value, deepest fit, depth envelopes, halfspace depth, robust regression, simplicial depth"
+, comments =    "to appear, journal ??"
+, update =      "98.07 mitchell"
+, abstract =    "
 In this paper we introduce a notion of depth in the regression
 setting. It provides the `rank' of any line (plane), rather than ranks
 of observations or residuals. In simple regression we can compute the
@@ -124874,36 +124874,36 @@ @techreport{rh-rd-96
 }
 
 @book{rl-rrod-87
-, author =	"P. J. Rousseeuw and A. M. Leroy"
-, title =	"Robust Regression and Outlier Detection"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1987
-, update =	"99.11 bibrelex, 98.07 bibrelex"
+, author =      "P. J. Rousseeuw and A. M. Leroy"
+, title =       "Robust Regression and Outlier Detection"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1987
+, update =      "99.11 bibrelex, 98.07 bibrelex"
 }
 
 @incollection{rnm-nscrr-93
-, author =	"P. J. Rousseeuw and N. S. Netanyahu and D. M. Mount"
-, title =	"New statistical and computational results on the repeated median line"
-, editor =	"S. Morgenthaler and E. Ronchetti and W. Stahel"
-, booktitle =	"New Directions in Data Analysis and Robustness"
-, publisher =	"Birkh{\"a}user-Verlag"
-, address =	"Basel, Switzerland"
-, year =	1993
-, pages =	"177--194"
-, update =	"98.07 mitchell, 93.09 milone+mitchell"
+, author =      "P. J. Rousseeuw and N. S. Netanyahu and D. M. Mount"
+, title =       "New statistical and computational results on the repeated median line"
+, editor =      "S. Morgenthaler and E. Ronchetti and W. Stahel"
+, booktitle =   "New Directions in Data Analysis and Robustness"
+, publisher =   "Birkh{\"a}user-Verlag"
+, address =     "Basel, Switzerland"
+, year =        1993
+, pages =       "177--194"
+, update =      "98.07 mitchell, 93.09 milone+mitchell"
 }
 
 @techreport{rh-dah-97
-, author =	"Peter J. Rousseeuw and Ida Ruts"
-, title =	"Constructing the Bivariate {Tukey} Median"
-, type =	"Manuscript"
-, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
-, year =	1997
-, keywords =	"halfplane depth, robustness, Tukey depth"
-, comments =	"Statistica Sinica, to appear"
-, update =	"98.07 mitchell"
-, abstract =	"The halfplane location depth of a point $\theta$ in R2
+, author =      "Peter J. Rousseeuw and Ida Ruts"
+, title =       "Constructing the Bivariate {Tukey} Median"
+, type =        "Manuscript"
+, institution = "Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
+, year =        1997
+, keywords =    "halfplane depth, robustness, Tukey depth"
+, comments =    "Statistica Sinica, to appear"
+, update =      "98.07 mitchell"
+, abstract =    "The halfplane location depth of a point $\theta$ in R2
 relative to a bivariate data set $X=\{x_1, x_2, ..., x_n\}$ is the
 minimal number of observations in any closed halfplane that contains
 $\theta$ (Tukey 1975). The halfplane median or Tukey median is the
@@ -124917,15 +124917,15 @@ @techreport{rh-dah-97
 }
 
 @techreport{rs-cldrd-98
-, author =	"Peter J. Rousseeuw and Anja Struyf"
-, title =	"Computing Location Depth and Regression Depth in Higher Dimensions"
-, type =	"Manuscript"
-, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
-, year =	1998
-, keywords =	"coordinate-free, multivariate ranks, robustness"
-, comments =	"to appear, Statistics and Computing"
-, update =	"98.07 mitchell"
-, abstract =	"
+, author =      "Peter J. Rousseeuw and Anja Struyf"
+, title =       "Computing Location Depth and Regression Depth in Higher Dimensions"
+, type =        "Manuscript"
+, institution = "Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
+, year =        1998
+, keywords =    "coordinate-free, multivariate ranks, robustness"
+, comments =    "to appear, Statistics and Computing"
+, update =      "98.07 mitchell"
+, abstract =    "
 The location depth (Tukey 1975) of a point $\theta$ relative to a
 p-dimensional data set Z of size n is defined as the smallest number
 of data points in a closed halfspace with boundary through
@@ -124951,515 +124951,515 @@ @techreport{rs-cldrd-98
 }
 
 @unpublished{rbd-srfcw-
-, author =	"M. Roussille and V. Bruyere and P. Dufour"
-, title =	"Search of repeated factors"
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "M. Roussille and V. Bruyere and P. Dufour"
+, title =       "Search of repeated factors"
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{rbd-sdpc-90
-, author =	"M. Roussille and V. Bruy{\`e}re and P. Dufour"
-, title =	"Structure detection for polygon composition"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"152--155"
-, cites =	"at-iacps-78, as-cvp-86, fw-utpf-81, gjpt-tsp-78, h-oafsp-86, k-dpsc-85, l-cw-83, rbd-srfcw-, t-mdsp-81, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M. Roussille and V. Bruy{\`e}re and P. Dufour"
+, title =       "Structure detection for polygon composition"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "152--155"
+, cites =       "at-iacps-78, as-cvp-86, fw-utpf-81, gjpt-tsp-78, h-oafsp-86, k-dpsc-85, l-cw-83, rbd-srfcw-, t-mdsp-81, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{rd-gcpia-87
-, author =	"M. Roussille and P. Dufour"
-, title =	"Generation of convex polygons with individual angular constraint"
-, journal =	"Inform. Process. Lett."
-, volume =	24
-, year =	1987
-, pages =	"159--164"
+, author =      "M. Roussille and P. Dufour"
+, title =       "Generation of convex polygons with individual angular constraint"
+, journal =     "Inform. Process. Lett."
+, volume =      24
+, year =        1987
+, pages =       "159--164"
 }
 
 @inproceedings{rkv-nnq-95
-, author =	"N. Roussopoulos and S. Kelley and F. Vincent"
-, title =	"Nearest Neighbor Queries"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1995
-, pages =	"71--79"
-, update =	"97.07 agarwal"
+, author =      "N. Roussopoulos and S. Kelley and F. Vincent"
+, title =       "Nearest Neighbor Queries"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1995
+, pages =       "71--79"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{rkr-cobiu-97
-, author =	"N. Roussopoulos and Y. Kotidis and M. Roussopoulos"
-, title =	"Cubetree: {O}rganization of and bulk incremental updates on the data cube"
-, booktitle =	"Proc. ACM SIGMOD Conf. on Management of Data"
-, year =	1997
-, pages =	"89--99"
-, update =	"97.07 agarwal"
+, author =      "N. Roussopoulos and Y. Kotidis and M. Roussopoulos"
+, title =       "Cubetree: {O}rganization of and bulk incremental updates on the data cube"
+, booktitle =   "Proc. ACM SIGMOD Conf. on Management of Data"
+, year =        1997
+, pages =       "89--99"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{r-cr-94
-, author =	"Jean-Christophe Roux"
-, title =	"Curve reconstruction"
-, editor =	"Pierre-Jean Laurent and A. {Le M{\'e}hant{\'e}} and L. L. Schumaker"
-, booktitle =	"Curves and Surfaces in Geometric Design"
-, publisher =	"A. K. Peters"
-, address =	"Wellesley, MA"
-, year =	1994
-, pages =	"401--408"
-, comments =	"curve reconstruction from scattered data points in the plane;
-		locally uses best approximating circles;
-		deals with cusps and self-intersections.
-		best circles are formulated in such a way that the solution leads
-		to an eigenvalue problem of a $4\times4$-matrix.
-		see also the author's 1994 dissertation from Univ. Grenoble."
-, update =	"98.07 rote"
+, author =      "Jean-Christophe Roux"
+, title =       "Curve reconstruction"
+, editor =      "Pierre-Jean Laurent and A. {Le M{\'e}hant{\'e}} and L. L. Schumaker"
+, booktitle =   "Curves and Surfaces in Geometric Design"
+, publisher =   "A. K. Peters"
+, address =     "Wellesley, MA"
+, year =        1994
+, pages =       "401--408"
+, comments =    "curve reconstruction from scattered data points in the plane;
+                locally uses best approximating circles;
+                deals with cusps and self-intersections.
+                best circles are formulated in such a way that the solution leads
+                to an eigenvalue problem of a $4\times4$-matrix.
+                see also the author's 1994 dissertation from Univ. Grenoble."
+, update =      "98.07 rote"
 }
 
 @article{rdmmst-bdg-87
-, author =	"L. A. Rowe and M. Davis and E. Messinger and C. Meyer and C. Spirakis and A. Tuan"
-, title =	"A Browser for Directed Graphs"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	17
-, number =	1
-, year =	1987
-, pages =	"61--76"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "L. A. Rowe and M. Davis and E. Messinger and C. Meyer and C. Spirakis and A. Tuan"
+, title =       "A Browser for Directed Graphs"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      17
+, number =      1
+, year =        1987
+, pages =       "61--76"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{r-oomrp-97
-, author =	"Neil C. Rowe"
-, title =	"Obtaining Optimal Mobile-Robot Paths with Non-Smooth Anisotropic Cost Functions Using Qualitative-State Reasoning"
-, journal =	"Internat. J. Robot. Res."
-, volume =	16
-, number =	3
-, month =	jun
-, year =	1997
-, pages =	"375--399"
-, keywords =	"optimal paths, anisotropism, minimum-energy, friction, gravity, qualitative physics, cylinder"
-, update =	"98.03 mitchell, 97.03 rowe"
+, author =      "Neil C. Rowe"
+, title =       "Obtaining Optimal Mobile-Robot Paths with Non-Smooth Anisotropic Cost Functions Using Qualitative-State Reasoning"
+, journal =     "Internat. J. Robot. Res."
+, volume =      16
+, number =      3
+, month =       jun
+, year =        1997
+, pages =       "375--399"
+, keywords =    "optimal paths, anisotropism, minimum-energy, friction, gravity, qualitative physics, cylinder"
+, update =      "98.03 mitchell, 97.03 rowe"
 }
 
 @article{r-rroot-90
-, author =	"N. C. Rowe"
-, title =	"Roads, rivers, and obstacles: optimal two-dimensional path planning around linear features for a mobile agent"
-, journal =	"Internat. J. Robot. Res."
-, volume =	9
-, year =	1990
-, pages =	"67--73"
-, keywords =	"shortest paths"
+, author =      "N. C. Rowe"
+, title =       "Roads, rivers, and obstacles: optimal two-dimensional path planning around linear features for a mobile agent"
+, journal =     "Internat. J. Robot. Res."
+, volume =      9
+, year =        1990
+, pages =       "67--73"
+, keywords =    "shortest paths"
 }
 
 @article{rk-nmep-94
-, author =	"N. C. Rowe and Y. Kanayama"
-, title =	"Near-minimum energy paths on a vertical-axis cone with anisotropic friction and gravity effects"
-, journal =	"Internat. J. Robot. Res."
-, volume =	13
-, year =	1994
-, pages =	"408--432"
-, keywords =	"optimal paths, minimum-energy, friction, gravity, qualitative physics, cone"
-, update =	"97.03 rowe"
+, author =      "N. C. Rowe and Y. Kanayama"
+, title =       "Near-minimum energy paths on a vertical-axis cone with anisotropic friction and gravity effects"
+, journal =     "Internat. J. Robot. Res."
+, volume =      13
+, year =        1994
+, pages =       "408--432"
+, keywords =    "optimal paths, minimum-energy, friction, gravity, qualitative physics, cone"
+, update =      "97.03 rowe"
 }
 
 @inproceedings{rl-vppuo-89
-, author =	"N. C. Rowe and D. H. Lewis"
-, title =	"Vehicle path-planning using optics analogs for optimizing visibility and energy cost"
-, booktitle =	"NASA Conference on Space Telerobotics"
-, year =	1989
-, pages =	"IV: 217--226"
-, keywords =	"weighted regions, optimal paths, three dimensions, minimum-energy, visibility, aircraft"
-, update =	"97.03 rowe"
+, author =      "N. C. Rowe and D. H. Lewis"
+, title =       "Vehicle path-planning using optics analogs for optimizing visibility and energy cost"
+, booktitle =   "NASA Conference on Space Telerobotics"
+, year =        1989
+, pages =       "IV: 217--226"
+, keywords =    "weighted regions, optimal paths, three dimensions, minimum-energy, visibility, aircraft"
+, update =      "97.03 rowe"
 }
 
 @techreport{rr-nmopp-87
-, author =	"N. C. Rowe and R. F. Richbourg"
-, title =	"A new method for optimal path planning through nonhomogeneous free space"
-, type =	"Technical {Report}"
-, number =	"NPS52-87-003"
-, institution =	"Comput. Sci. Dept., Naval Postgraduate School"
-, address =	"Monterey, CA"
-, year =	1987
-, keywords =	"shortest paths, weights"
+, author =      "N. C. Rowe and R. F. Richbourg"
+, title =       "A new method for optimal path planning through nonhomogeneous free space"
+, type =        "Technical {Report}"
+, number =      "NPS52-87-003"
+, institution = "Comput. Sci. Dept., Naval Postgraduate School"
+, address =     "Monterey, CA"
+, year =        1987
+, keywords =    "shortest paths, weights"
 }
 
 @article{rr-eslmo-90
-, author =	"N. C. Rowe and R. F. Richbourg"
-, title =	"An efficient {Snell}'s law method for optimal-path planning across multiple two-dimensional, irregular, homogeneous-cost regions"
-, journal =	"Internat. J. Robot. Res."
-, volume =	9
-, year =	1990
-, pages =	"48--66"
-, keywords =	"shortest paths, weights"
+, author =      "N. C. Rowe and R. F. Richbourg"
+, title =       "An efficient {Snell}'s law method for optimal-path planning across multiple two-dimensional, irregular, homogeneous-cost regions"
+, journal =     "Internat. J. Robot. Res."
+, volume =      9
+, year =        1990
+, pages =       "48--66"
+, keywords =    "shortest paths, weights"
 }
 
 @article{rr-ogfpp-90
-, author =	"N. C. Rowe and R. Ross"
-, title =	"Optimal grid-free path planning across arbitrarily-contoured terrain with anisotropic friction and gravity effects"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	6
-, year =	1990
-, pages =	"540--553"
-, keywords =	"optimal paths, anisotropism, minimum-energy, friction, gravity, qualitative physics, polyhedra"
-, update =	"97.03 rowe"
+, author =      "N. C. Rowe and R. Ross"
+, title =       "Optimal grid-free path planning across arbitrarily-contoured terrain with anisotropic friction and gravity effects"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      6
+, year =        1990
+, pages =       "540--553"
+, keywords =    "optimal paths, anisotropism, minimum-energy, friction, gravity, qualitative physics, polyhedra"
+, update =      "97.03 rowe"
 }
 
 @inproceedings{rs-gcumr-97
-, author =	"Tom Roxborough and Arunabha Sen"
-, title =	"Graph Clustering Using Multiway Ratio Cut"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"291--296"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Tom Roxborough and Arunabha Sen"
+, title =       "Graph Clustering Using Multiway Ratio Cut"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "291--296"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{rlw-rdtrp-91
-, author =	"U. Roy and C. R. Liu and T. C. Woo"
-, title =	"Review of dimensioning and tolerancing: representation and processing"
-, journal =	"Comput. Aided Design"
-, volume =	23
-, number =	7
-, year =	1991
-, pages =	"466--483"
-, update =	"98.07 bibrelex"
+, author =      "U. Roy and C. R. Liu and T. C. Woo"
+, title =       "Review of dimensioning and tolerancing: representation and processing"
+, journal =     "Comput. Aided Design"
+, volume =      23
+, number =      7
+, year =        1991
+, pages =       "466--483"
+, update =      "98.07 bibrelex"
 }
 
 @article{rz-epccm-92
-, author =	"U. Roy and X. Zhang"
-, title =	"Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error"
-, journal =	"Comput. Aided Design"
-, volume =	24
-, number =	3
-, year =	1992
-, pages =	"161--168"
-, update =	"97.03 agarwal"
+, author =      "U. Roy and X. Zhang"
+, title =       "Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error"
+, journal =     "Comput. Aided Design"
+, volume =      24
+, number =      3
+, year =        1992
+, pages =       "161--168"
+, update =      "97.03 agarwal"
 }
 
 @inproceedings{rb-fnipg-90
-, author =	"V. P. Roychowdhury and J. Bruck"
-, title =	"On finding non-intersecting paths in grids and its application in reconfiguring {VLSI}/{WSI} arrays"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"454--464"
+, author =      "V. P. Roychowdhury and J. Bruck"
+, title =       "On finding non-intersecting paths in grids and its application in reconfiguring {VLSI}/{WSI} arrays"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "454--464"
 }
 
 @article{rbk-earvw-90
-, author =	"V. P. Roychowdhury and J. Bruck and T. Kailath"
-, title =	"Efficient algorithms for reconfiguration in {VLSI}/{WSI} arrays"
-, journal =	"IEEE Trans. Comput."
-, volume =	"??"
-, year =	1990
-, pages =	"480--489"
-, update =	"98.07 bibrelex"
+, author =      "V. P. Roychowdhury and J. Bruck and T. Kailath"
+, title =       "Efficient algorithms for reconfiguration in {VLSI}/{WSI} arrays"
+, journal =     "IEEE Trans. Comput."
+, volume =      "??"
+, year =        1990
+, pages =       "480--489"
+, update =      "98.07 bibrelex"
 }
 
 @book{r-ra-68
-, author =	"H. Royden"
-, title =	"Real Analysis"
-, publisher =	"Macmillan"
-, address =	"New York, NY"
-, year =	1968
-, update =	"97.11 bibrelex"
+, author =      "H. Royden"
+, title =       "Real Analysis"
+, publisher =   "Macmillan"
+, address =     "New York, NY"
+, year =        1968
+, update =      "97.11 bibrelex"
 }
 
 % ### number??
 @inproceedings{rs-saapm-96
-, author =	"D. Roytenberg and J.-R. Sack"
-, title =	"A Simulator for the Alex-AVX Parallel Multi-Computer"
-, booktitle =	"Proc. HPCS '96 Conference"
-, site =	"Ottawa"
-, number =	48
-, year =	1996
-, update =	"97.11 sack"
+, author =      "D. Roytenberg and J.-R. Sack"
+, title =       "A Simulator for the Alex-AVX Parallel Multi-Computer"
+, booktitle =   "Proc. HPCS '96 Conference"
+, site =        "Ottawa"
+, number =      48
+, year =        1996
+, update =      "97.11 sack"
 }
 
 @techreport{r-ciarb-92t
-, author =	"C. R{\"u}b"
-, title =	"Computing intersections and arrangements for red-blue curve segments in parallel"
-, type =	"Technical {Report}"
-, number =	"MPI-I-92-108"
-, institution =	"Max Planck Institut f{\"u}r Informatik"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
-, precedes =	"r-ciarb-92"
-, update =	"98.07 bibrelex"
+, author =      "C. R{\"u}b"
+, title =       "Computing intersections and arrangements for red-blue curve segments in parallel"
+, type =        "Technical {Report}"
+, number =      "MPI-I-92-108"
+, institution = "Max Planck Institut f{\"u}r Informatik"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
+, precedes =    "r-ciarb-92"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{r-ciarb-92
-, author =	"C. R{\"u}b"
-, title =	"Computing intersections and arrangements for red-blue curve segments in parallel"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"115--120"
-, succeeds =	"r-ciarb-92t"
-, cites =	"abb-paa-90, acg-cdctd-89, am-dplr-91, ce-oails-88, cct-rpatd-91, g-ilspo-89, g-caop-91, gsg-pmvsp-90, hjw-epcah-90, ms-rcibt-88, r-pazbd-90, r-lsirp-92, r-ciarb-92t, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "C. R{\"u}b"
+, title =       "Computing intersections and arrangements for red-blue curve segments in parallel"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "115--120"
+, succeeds =    "r-ciarb-92t"
+, cites =       "abb-paa-90, acg-cdctd-89, am-dplr-91, ce-oails-88, cct-rpatd-91, g-ilspo-89, g-caop-91, gsg-pmvsp-90, hjw-epcah-90, ms-rcibt-88, r-pazbd-90, r-lsirp-92, r-ciarb-92t, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{r-lsirp-92
-, author =	"C. R{\"u}b"
-, title =	"Line-Segment Intersection Reporting in Parallel"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"119--144"
-, update =	"96.09 orourke"
+, author =      "C. R{\"u}b"
+, title =       "Line-Segment Intersection Reporting in Parallel"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "119--144"
+, update =      "96.09 orourke"
 }
 
 @techreport{r-plsir-89
-, author =	"C. R{\"u}b"
-, title =	"Parallel Line Segment Intersection Reporting"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "C. R{\"u}b"
+, title =       "Parallel Line Segment Intersection Reporting"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{r-pazbd-90
-, author =	"C. R{\"u}b"
-, title =	"Parallele {Algorithmen} zum {Berechnen} der {Schnittpunkte} von {Liniensegmenten}"
-, school =	"Univ. Saarbr{\"u}cken"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1990
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "C. R{\"u}b"
+, title =       "Parallele {Algorithmen} zum {Berechnen} der {Schnittpunkte} von {Liniensegmenten}"
+, school =      "Univ. Saarbr{\"u}cken"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1990
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @article{rw-3drfr-80
-, author =	"S. M. Rubin and T. Whitted"
-, title =	"A $3$-dimensional representation for fast rendering of complex scenes"
-, journal =	"Comput. Graph."
-, volume =	14
-, number =	3
-, year =	1980
-, pages =	"110--116"
-, note =	"Proc. SIGGRAPH '80"
+, author =      "S. M. Rubin and T. Whitted"
+, title =       "A $3$-dimensional representation for fast rendering of complex scenes"
+, journal =     "Comput. Graph."
+, volume =      14
+, number =      3
+, year =        1980
+, pages =       "110--116"
+, note =        "Proc. SIGGRAPH '80"
 }
 
 @unpublished{r-dcptr-94
-, author =	"R. Rubinfeld"
-, title =	"Designing Checkers for Programs that Run in Parallel"
-, year =	1994
-, note =	"Manuscript"
-, update =	"97.11 bibrelex"
+, author =      "R. Rubinfeld"
+, title =       "Designing Checkers for Programs that Run in Parallel"
+, year =        1994
+, note =        "Manuscript"
+, update =      "97.11 bibrelex"
 }
 
 @article{rt-srccp-92
-, author =	"J. H. Rubinstein and D. A. Thomas"
-, title =	"The {Steiner} ratio conjecture for cocircular points"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"77--86"
+, author =      "J. H. Rubinstein and D. A. Thomas"
+, title =       "The {Steiner} ratio conjecture for cocircular points"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "77--86"
 }
 
 @inproceedings{r-lbchd-93
-, author =	"W. Rucklidge"
-, title =	"Lower bounds for the complexity of the {Hausdorff} distance"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"145--150"
-, cites =	"ast-apsgo-92, abb-amps-91, cghkkk-gpmem-93, hks-uevsi-91, ck-igpmp-92, hhk-tirgc-88, r-cmhdb-91, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "W. Rucklidge"
+, title =       "Lower bounds for the complexity of the {Hausdorff} distance"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "145--150"
+, cites =       "ast-apsgo-92, abb-amps-91, cghkkk-gpmem-93, hks-uevsi-91, ck-igpmp-92, hhk-tirgc-88, r-cmhdb-91, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @incollection{rzz-vvagf-
-, author =	"A. Rudich and D. Zernik and G. Zodik"
-, title =	"Visage --- Visualization of Attribute Graphs: A foundation for a Parallel Programming Environment"
-, editor =	"J. J. Dongarra and B. Tourancheau"
-, booktitle =	"Environments and Tools for Parallel Scientific Computing"
-, publisher =	"North-Holland"
-, pages =	"171--192"
-, keywords =	"graph drawing"
-, update =	"95.01 tamassia"
+, author =      "A. Rudich and D. Zernik and G. Zodik"
+, title =       "Visage --- Visualization of Attribute Graphs: A foundation for a Parallel Programming Environment"
+, editor =      "J. J. Dongarra and B. Tourancheau"
+, booktitle =   "Environments and Tools for Parallel Scientific Computing"
+, publisher =   "North-Holland"
+, pages =       "171--192"
+, keywords =    "graph drawing"
+, update =      "95.01 tamassia"
 }
 
 @article{r-utt-58
-, author =	"M. E. Rudin"
-, title =	"An Unshellable Triangulation of a Tetrahedron"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	64
-, year =	1958
-, pages =	"90--91"
-, keywords =	"triangulation, three-dimensional, shellability"
-, update =	"95.09 korneenko"
-, annote =	"An example of a 3D triangulation with 14 points and 41
-		 tetrahedra that cannot be built by sequentially adding
-		 tetrahedrons."
+, author =      "M. E. Rudin"
+, title =       "An Unshellable Triangulation of a Tetrahedron"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      64
+, year =        1958
+, pages =       "90--91"
+, keywords =    "triangulation, three-dimensional, shellability"
+, update =      "95.09 korneenko"
+, annote =      "An example of a 3D triangulation with 14 points and 41
+                 tetrahedra that cannot be built by sequentially adding
+                 tetrahedrons."
 }
 
 @book{r-pma-76
-, author =	"W. Rudin"
-, title =	"Principles of Mathematical Analysis"
-, edition =	"3rd"
-, publisher =	"McGraw-Hill"
-, address =	"New York, NY"
-, year =	1976
-, update =	"98.03 bibrelex"
+, author =      "W. Rudin"
+, title =       "Principles of Mathematical Analysis"
+, edition =     "3rd"
+, publisher =   "McGraw-Hill"
+, address =     "New York, NY"
+, year =        1976
+, update =      "98.03 bibrelex"
 }
 
 @article{r-snsls-82
-, author =	"S. M. Rump"
-, title =	"Solving nonlinear systems with least significant bit accuracy"
-, journal =	"Computing"
-, volume =	29
-, year =	1982
-, pages =	"183--200"
-, update =	"98.03 bibrelex"
+, author =      "S. M. Rump"
+, title =       "Solving nonlinear systems with least significant bit accuracy"
+, journal =     "Computing"
+, volume =      29
+, year =        1982
+, pages =       "183--200"
+, update =      "98.03 bibrelex"
 }
 
 @article{rb-lsbea-83
-, author =	"S. M. Rump and H. B{\"o}hm"
-, title =	"Least significant bit evaluation of arithmetic expressions in single-precision"
-, journal =	"Computing"
-, volume =	30
-, number =	3
-, year =	1983
-, pages =	"189--199"
-, update =	"98.03 bibrelex"
+, author =      "S. M. Rump and H. B{\"o}hm"
+, title =       "Least significant bit evaluation of arithmetic expressions in single-precision"
+, journal =     "Computing"
+, volume =      30
+, number =      3
+, year =        1983
+, pages =       "189--199"
+, update =      "98.03 bibrelex"
 }
 
 @article{r-svp-66
-, author =	"H. {Rumsey, Jr.}"
-, title =	"Sets of visible points"
-, journal =	"Duke Math. J."
-, volume =	33
-, year =	1966
-, pages =	"263--274"
-, update =	"97.11 bibrelex"
+, author =      "H. {Rumsey, Jr.}"
+, title =       "Sets of visible points"
+, journal =     "Duke Math. J."
+, volume =      33
+, year =        1966
+, pages =       "263--274"
+, update =      "97.11 bibrelex"
 }
 
 @article{r-draq2d-95
-, author =	"J. Ruppert"
-, title =	"A {Delaunay} Refinement Algorithm for Quality 2-Dimensional Mesh Generation"
-, journal =	"J. Algorithms"
-, volume =	18
-, year =	1995
-, pages =	"548--585"
-, update =	"01.07 devillers, 00.03 devillers"
+, author =      "J. Ruppert"
+, title =       "A {Delaunay} Refinement Algorithm for Quality 2-Dimensional Mesh Generation"
+, journal =     "J. Algorithms"
+, volume =      18
+, year =        1995
+, pages =       "548--585"
+, update =      "01.07 devillers, 00.03 devillers"
 }
 
 @techreport{r-nsaq2-92
-, author =	"J. Ruppert"
-, title =	"A new and simple algorithm for quality $2$-dimensional mesh generation"
-, type =	"Report"
-, number =	"UCB/CSD 92/694"
-, institution =	"Univ. California"
-, address =	"Berkeley, CA"
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "J. Ruppert"
+, title =       "A new and simple algorithm for quality $2$-dimensional mesh generation"
+, type =        "Report"
+, number =      "UCB/CSD 92/694"
+, institution = "Univ. California"
+, address =     "Berkeley, CA"
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{r-nsaq2-93
-, author =	"J. Ruppert"
-, title =	"A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"83--92"
-, update =	"93.05 smid"
+, author =      "J. Ruppert"
+, title =       "A New and Simple Algorithm for Quality 2-Dimensional Mesh Generation"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "83--92"
+, update =      "93.05 smid"
 }
 
 @inproceedings{rs-addce-91
-, author =	"J. Ruppert and R. Seidel"
-, title =	"Approximating the $d$-dimensional complete {Euclidean} graph"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"207--210"
-, cites =	"c-tipga-86, dfs-dgaag-90, t-nrtpc-83, k-aceg-88, kg-dtcac-89, m-dsa-84, ps-gs-89, r-css-63, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "J. Ruppert and R. Seidel"
+, title =       "Approximating the $d$-dimensional complete {Euclidean} graph"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "207--210"
+, cites =       "c-tipga-86, dfs-dgaag-90, t-nrtpc-83, k-aceg-88, kg-dtcac-89, m-dsa-84, ps-gs-89, r-css-63, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{rs-dt3dn-89
-, author =	"J. Ruppert and R. Seidel"
-, title =	"On the difficulty of tetrahedralizing $3$-dimensional non-convex polyhedra"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"380--392"
-, precedes =	"rs-dttdn-92"
-, cites =	"ae-tpss-87, bd-cdsp-89, c-cgc-79, cp-tncp-89, ctv-flvat-88i, cr-cpih-88, epw-tpstd-86, gj-cigtn-79, o-agta-87, os-snhpd-83, ps-cgi-85, s-udzvd-28, tv-otats-88, h-fssp-81, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "J. Ruppert and R. Seidel"
+, title =       "On the difficulty of tetrahedralizing $3$-dimensional non-convex polyhedra"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "380--392"
+, precedes =    "rs-dttdn-92"
+, cites =       "ae-tpss-87, bd-cdsp-89, c-cgc-79, cp-tncp-89, ctv-flvat-88i, cr-cpih-88, epw-tpstd-86, gj-cigtn-79, o-agta-87, os-snhpd-83, ps-cgi-85, s-udzvd-28, tv-otats-88, h-fssp-81, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{rs-dttdn-92
-, author =	"J. Ruppert and R. Seidel"
-, title =	"On the difficulty of triangulating three-dimensional non-convex polyhedra"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"227--253"
-, succeeds =	"rs-dt3dn-89"
+, author =      "J. Ruppert and R. Seidel"
+, title =       "On the difficulty of triangulating three-dimensional non-convex polyhedra"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "227--253"
+, succeeds =    "rs-dt3dn-89"
 }
 
 @article{r-cmop-97
-, author =	"D. Rus"
-, title =	"Coordinated Manipulation of Objects in a Plane"
-, journal =	"Algorithmica"
-, volume =	19
-, number =	"1--2"
-, month =	sep
-, year =	1997
-, pages =	"129--147"
-, update =	"97.07 held"
+, author =      "D. Rus"
+, title =       "Coordinated Manipulation of Objects in a Plane"
+, journal =     "Algorithmica"
+, volume =      19
+, number =      "1--2"
+, month =       sep
+, year =        1997
+, pages =       "129--147"
+, update =      "97.07 held"
 }
 
 @inproceedings{r-drp-90
-, author =	"D. Rus"
-, title =	"Dexterous rotations of polygons"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"147--151"
-, precedes =	"r-drp-91"
-, cites =	"b-sgtfp-88, b-igs-85, b-edrhu-87, c-rgfm-85, e-mpu-84, kkmy-qstam-89, m-mgpo-82, ms-rhmm-85, mss-esmpg-87, ms-sdsgi-89, n-ssfcg-86, p-mh-85, y-gt-68, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "D. Rus"
+, title =       "Dexterous rotations of polygons"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "147--151"
+, precedes =    "r-drp-91"
+, cites =       "b-sgtfp-88, b-igs-85, b-edrhu-87, c-rgfm-85, e-mpu-84, kkmy-qstam-89, m-mgpo-82, ms-rhmm-85, mss-esmpg-87, ms-sdsgi-89, n-ssfcg-86, p-mh-85, y-gt-68, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{r-drp-91
-, author =	"D. Rus"
-, title =	"On dexterous rotations of polygons"
-, type =	"Technical {Report}"
-, number =	"TR~91-1258"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	dec
-, year =	1991
-, succeeds =	"r-drp-90"
+, author =      "D. Rus"
+, title =       "On dexterous rotations of polygons"
+, type =        "Technical {Report}"
+, number =      "TR~91-1258"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       dec
+, year =        1991
+, succeeds =    "r-drp-90"
 }
 
 @incollection{r-spct-97
-, author =	"J. A. Rush"
-, title =	"Sphere packing and coding theory"
-, chapter =	50
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"917--932"
-, update =	"97.11 orourke"
+, author =      "J. A. Rush"
+, title =       "Sphere packing and coding theory"
+, chapter =     50
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "917--932"
+, update =      "97.11 orourke"
 }
 
 @article{r-algcc-75
-, author =	"D. Rutovitz"
-, title =	"An algorithm for in-line generation of a convex cover"
-, journal =	"Comput. Graph. Image Process."
-, volume =	4
-, year =	1975
-, pages =	"74--78"
+, author =      "D. Rutovitz"
+, title =       "An algorithm for in-line generation of a convex cover"
+, journal =     "Comput. Graph. Image Process."
+, volume =      4
+, year =        1975
+, pages =       "74--78"
 }
 
 @article{rr-cdcbp-96
-, author =	"Ida Ruts and Peter J. Rousseeuw"
-, title =	"Computing Depth Contours of Bivariate Point Clouds"
-, journal =	"Computational Statistics and Data Analysis"
-, volume =	23
-, year =	1996
-, pages =	"153--168"
-, keywords =	"k-sets, classification, graphical display, ranks, robustness"
-, update =	"98.07 mitchell"
-, abstract =	"In this paper we construct an exact algorithm for
+, author =      "Ida Ruts and Peter J. Rousseeuw"
+, title =       "Computing Depth Contours of Bivariate Point Clouds"
+, journal =     "Computational Statistics and Data Analysis"
+, volume =      23
+, year =        1996
+, pages =       "153--168"
+, keywords =    "k-sets, classification, graphical display, ranks, robustness"
+, update =      "98.07 mitchell"
+, abstract =    "In this paper we construct an exact algorithm for
 computing depth contours of a bivariate data set.  For this we use the
 halfspace depth introduced by Tukey. The depth contours form a nested
 collection of convex sets. The deeper the contour, the more robust it
@@ -125472,2520 +125472,2520 @@ @article{rr-cdcbp-96
 }
 
 @inproceedings{rms-isdg-97
-, author =	"K. Ryall and J. Marks and S. Shieber"
-, title =	"An Interactive System for Drawing Graphs"
-, editor =	"S. North"
-, booktitle =	"Graph Drawing (Proc. GD '96)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1190
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"387--393"
-, keywords =	"graph drawing, constraints, interactive"
-, update =	"98.07 tamassia+vismara"
+, author =      "K. Ryall and J. Marks and S. Shieber"
+, title =       "An Interactive System for Drawing Graphs"
+, editor =      "S. North"
+, booktitle =   "Graph Drawing (Proc. GD '96)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1190
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "387--393"
+, keywords =    "graph drawing, constraints, interactive"
+, update =      "98.07 tamassia+vismara"
 }
 
 @book{ahet-nggcf-91
-, title =	"Numerical Grid Generation in Computational Fluid Dynamics and Related Fields"
-, editor =	"A. S.-Arcilla and J. Hauser and P. R. Eiseman and J. F. Thompson"
-, publisher =	"North-Holland"
-, address =	"New York, New York"
-, year =	1991
-, update =	"98.11 bibrelex"
+, title =       "Numerical Grid Generation in Computational Fluid Dynamics and Related Fields"
+, editor =      "A. S.-Arcilla and J. Hauser and P. R. Eiseman and J. F. Thompson"
+, publisher =   "North-Holland"
+, address =     "New York, New York"
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{s-ccops-90
-, author =	"A. Saalfeld"
-, title =	"Canonical cyclic orderings for point sets in the plane"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"32--35"
-, cites =	"ahu-dsa-83, e-acg-87, gj-cigtn-79, k-ss-65, ps-cgi-85, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "A. Saalfeld"
+, title =       "Canonical cyclic orderings for point sets in the plane"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "32--35"
+, cites =       "ahu-dsa-83, e-acg-87, gj-cigtn-79, k-ss-65, ps-cgi-85, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-der-91
-, author =	"A. Saalfeld"
-, title =	"Delaunay edge refinements"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"33--36"
-, cites =	"c-cdt-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "A. Saalfeld"
+, title =       "Delaunay edge refinements"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "33--36"
+, cites =       "c-cdt-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-dceat-89
-, author =	"A. Saalfeld"
-, title =	"Divide-and-conquer in early algebraic topology: the {Mayer}-{Vietoris} exact homology sequence revisited"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	11
+, author =      "A. Saalfeld"
+, title =       "Divide-and-conquer in early algebraic topology: the {Mayer}-{Vietoris} exact homology sequence revisited"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       11
 }
 
 @inproceedings{s-jttm-87
-, author =	"A. Saalfeld"
-, title =	"Joint triangulations and triangulation maps"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"195--204"
-, cites =	"c-tpc-79, gp-ms-83, ghlst-ltavs-86, l-aat-75, ps-cgi-85, wg-plrsm-85, w-tachm-83, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "A. Saalfeld"
+, title =       "Joint triangulations and triangulation maps"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "195--204"
+, cites =       "c-tpc-79, gp-ms-83, ghlst-ltavs-86, l-aat-75, ps-cgi-85, wg-plrsm-85, w-tachm-83, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{s-mggdp-95
-, author =	"A. Saalfeld"
-, title =	"Map Generalization as a Graph Drawing Problem"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"444--451"
-, keywords =	"graph drawing, cartography, planar"
-, update =	"95.01 tamassia"
+, author =      "A. Saalfeld"
+, title =       "Map Generalization as a Graph Drawing Problem"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "444--451"
+, keywords =    "graph drawing, cartography, planar"
+, update =      "95.01 tamassia"
 }
 
 @article{s-gm-60
-, author =	"G. Sabidussi"
-, title =	"Graph Multiplication"
-, journal =	"Math. Z."
-, volume =	72
-, year =	1960
-, pages =	"446--457"
-, update =	"97.11 bibrelex"
+, author =      "G. Sabidussi"
+, title =       "Graph Multiplication"
+, journal =     "Math. Z."
+, volume =      72
+, year =        1960
+, pages =       "446--457"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-ggggg-57
-, author =	"G. Sabidussi"
-, title =	"Graphs with a Given Group and Given Graph Theoretical Properties"
-, journal =	"Canad. J. Math."
-, volume =	9
-, year =	1957
-, pages =	"515--525"
-, update =	"97.11 bibrelex"
+, author =      "G. Sabidussi"
+, title =       "Graphs with a Given Group and Given Graph Theoretical Properties"
+, journal =     "Canad. J. Math."
+, volume =      9
+, year =        1957
+, pages =       "515--525"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-mogga-59
-, author =	"G. Sabidussi"
-, title =	"On the Minimum Order of Graphs with a Given Automorphism Group"
-, journal =	"Monatsh. Math."
-, volume =	63
-, year =	1959
-, pages =	"124--127"
-, update =	"97.11 bibrelex"
+, author =      "G. Sabidussi"
+, title =       "On the Minimum Order of Graphs with a Given Automorphism Group"
+, journal =     "Monatsh. Math."
+, volume =      63
+, year =        1959
+, pages =       "124--127"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-cg-59
-, author =	"G. Sabidussi"
-, title =	"The Composition of Graphs"
-, journal =	"Duke Math. J."
-, volume =	26
-, year =	1959
-, pages =	"693--696"
-, update =	"97.11 bibrelex"
+, author =      "G. Sabidussi"
+, title =       "The Composition of Graphs"
+, journal =     "Duke Math. J."
+, volume =      26
+, year =        1959
+, pages =       "693--696"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{s-crmsd-80
-, author =	"M. A. Sabin"
-, title =	"Contouring---{A} Review of Methods for Scattered Data"
-, editor =	"K. W. Brodlie"
-, booktitle =	"Mathematical Methods in Computer Graphics and Design"
-, publisher =	"Academic Press"
-, address =	"New York"
-, year =	1980
-, pages =	"105--121"
-, annote =	"Suggests best method is Delaunay triangulation with
-		 linear or $C^1$ interpolation on triangles."
+, author =      "M. A. Sabin"
+, title =       "Contouring---{A} Review of Methods for Scattered Data"
+, editor =      "K. W. Brodlie"
+, booktitle =   "Mathematical Methods in Computer Graphics and Design"
+, publisher =   "Academic Press"
+, address =     "New York"
+, year =        1980
+, pages =       "105--121"
+, annote =      "Suggests best method is Delaunay triangulation with
+                 linear or $C^1$ interpolation on triangles."
 }
 
 @inproceedings{s-nrsps-83
-, author =	"M. A. Sabin"
-, title =	"Non-rectangular surface patches suitable for inclusion in a B-spline surface"
-, booktitle =	"Eurographics"
-, year =	1983
-, update =	"98.03 bibrelex"
+, author =      "M. A. Sabin"
+, title =       "Non-rectangular surface patches suitable for inclusion in a B-spline surface"
+, booktitle =   "Eurographics"
+, year =        1983
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{s-shlar-83
-, author =	"J.-R. Sack"
-, title =	"A simple hidden-line algorithm for rectilinear polygons"
-, booktitle =	"Proc. 21st Allerton Conf. Commun. Control Comput."
-, year =	1983
-, pages =	"437--446"
-, keywords =	"computer graphics, visibility, convex hull, hidden line/surface elimination, polygons, two-dimensional"
+, author =      "J.-R. Sack"
+, title =       "A simple hidden-line algorithm for rectilinear polygons"
+, booktitle =   "Proc. 21st Allerton Conf. Commun. Control Comput."
+, year =        1983
+, pages =       "437--446"
+, keywords =    "computer graphics, visibility, convex hull, hidden line/surface elimination, polygons, two-dimensional"
 }
 
 @inproceedings{s-oadrp-82
-, author =	"J.-R. Sack"
-, title =	"An {$O(n \log n)$} algorithm for decomposing rectilinear polygons into convex quadrilaterals"
-, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
-, year =	1982
-, pages =	"64--75"
-, keywords =	"decomposition, partition, visibility, shape, polygons, two-dimensional, convex"
+, author =      "J.-R. Sack"
+, title =       "An {$O(n \log n)$} algorithm for decomposing rectilinear polygons into convex quadrilaterals"
+, booktitle =   "Proc. 20th Allerton Conf. Commun. Control Comput."
+, year =        1982
+, pages =       "64--75"
+, keywords =    "decomposition, partition, visibility, shape, polygons, two-dimensional, convex"
 }
 
 @phdthesis{s-rcg-84
-, author =	"J.-R. Sack"
-, title =	"Rectilinear computational geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"School Comput. Sci., Carleton Univ."
-, address =	"Ottawa, ON"
-, year =	1984
-, note =	"Report SCS-TR-54"
-, keywords =	"computer graphics, decomposition, partition, visibility, shape, convex hull, hidden line/surface elimination, polygons, two-dimensional, convex, doctoral thesis"
-, update =	"93.05 jones"
+, author =      "J.-R. Sack"
+, title =       "Rectilinear computational geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "School Comput. Sci., Carleton Univ."
+, address =     "Ottawa, ON"
+, year =        1984
+, note =        "Report SCS-TR-54"
+, keywords =    "computer graphics, decomposition, partition, visibility, shape, convex hull, hidden line/surface elimination, polygons, two-dimensional, convex, doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @article{s-r3scg-87
-, author =	"J.-R. Sack"
-, title =	"Report on 3rd {Symposium} on {Computational} {Geometry}, 1987"
-, journal =	"Bull. EATCS"
-, volume =	33
-, year =	1987
-, pages =	"165--170"
-, update =	"97.11 icking, 95.05 korneenko"
+, author =      "J.-R. Sack"
+, title =       "Report on 3rd {Symposium} on {Computational} {Geometry}, 1987"
+, journal =     "Bull. EATCS"
+, volume =      33
+, year =        1987
+, pages =       "165--170"
+, update =      "97.11 icking, 95.05 korneenko"
 }
 
 @article{ssu-cego-84
-, author =	"J.-R. Sack and N. Santoro and J. Urrutia"
-, title =	"Containment of elementary geometric objects"
-, journal =	"Congr. Numer."
-, volume =	45
-, year =	1984
-, pages =	"139--146"
-, keywords =	"polygons, triangles, rectangles, two-dimensional, domination"
+, author =      "J.-R. Sack and N. Santoro and J. Urrutia"
+, title =       "Containment of elementary geometric objects"
+, journal =     "Congr. Numer."
+, volume =      45
+, year =        1984
+, pages =       "139--146"
+, keywords =    "polygons, triangles, rectangles, two-dimensional, domination"
 }
 
 @article{ss-chia-90
-, author =	"J.-R. Sack and Th. Strothotte"
-, title =	"A Characterization of Heaps and Its Applications"
-, journal =	"Inform. Comput."
-, volume =	86
-, number =	1
-, year =	1990
-, pages =	"69--86"
-, update =	"97.11 sack"
+, author =      "J.-R. Sack and Th. Strothotte"
+, title =       "A Characterization of Heaps and Its Applications"
+, journal =     "Inform. Comput."
+, volume =      86
+, number =      1
+, year =        1990
+, pages =       "69--86"
+, update =      "97.11 sack"
 }
 
 @techreport{ss-oadwv-86
-, author =	"J.-R. Sack and Subhash Suri"
-, title =	"An optimal algorithm for detecting weak visibility of a polygon"
-, type =	"Report"
-, number =	"SCS-TR-114"
-, institution =	"School Comput. Sci., Carleton Univ."
-, address =	"Ottawa, ON"
-, year =	1986
-, keywords =	"computer graphics, visibility, hidden line/surface elimination, polygons, two-dimensional"
-, update =	"98.03 mitchell"
+, author =      "J.-R. Sack and Subhash Suri"
+, title =       "An optimal algorithm for detecting weak visibility of a polygon"
+, type =        "Report"
+, number =      "SCS-TR-114"
+, institution = "School Comput. Sci., Carleton Univ."
+, address =     "Ottawa, ON"
+, year =        1986
+, keywords =    "computer graphics, visibility, hidden line/surface elimination, polygons, two-dimensional"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ss-oadwv-88
-, author =	"J.-R. Sack and Subhash Suri"
-, title =	"An Optimal Algorithm for Detecting Weak Visibility of a Polygon"
-, editor =	"R. Cori and M. Wirsing"
-, booktitle =	"Proc. 5th Sympos. Theoret. Aspects Comput. Sci."
-, site =	"Bordeaux, France"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	294
-, year =	1988
-, pages =	"312--321"
-, update =	"98.11 bibrelex, 98.03 mitchell, 97.11 sack"
+, author =      "J.-R. Sack and Subhash Suri"
+, title =       "An Optimal Algorithm for Detecting Weak Visibility of a Polygon"
+, editor =      "R. Cori and M. Wirsing"
+, booktitle =   "Proc. 5th Sympos. Theoret. Aspects Comput. Sci."
+, site =        "Bordeaux, France"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      294
+, year =        1988
+, pages =       "312--321"
+, update =      "98.11 bibrelex, 98.03 mitchell, 97.11 sack"
 }
 
 @article{ss-oadwv-90
-, author =	"J.-R. Sack and Subhash Suri"
-, title =	"An optimal algorithm for detecting weak visibility of a polygon"
-, journal =	"IEEE Trans. Comput."
-, volume =	39
-, number =	10
-, year =	1990
-, pages =	"1213--1219"
-, keywords =	"computer graphics, visibility, hidden line/surface elimination, polygons, two-dimensional"
-, succeeds =	"ss-oadwv-86"
-, update =	"98.03 mitchell, 95.01 mitchell"
+, author =      "J.-R. Sack and Subhash Suri"
+, title =       "An optimal algorithm for detecting weak visibility of a polygon"
+, journal =     "IEEE Trans. Comput."
+, volume =      39
+, number =      10
+, year =        1990
+, pages =       "1213--1219"
+, keywords =    "computer graphics, visibility, hidden line/surface elimination, polygons, two-dimensional"
+, succeeds =    "ss-oadwv-86"
+, update =      "98.03 mitchell, 95.01 mitchell"
 }
 
 @inproceedings{st-ltadr-81
-, author =	"J.-R. Sack and G. T. Toussaint"
-, title =	"A linear-time algorithm for decomposing rectilinear polygons into convex quadrilaterals"
-, booktitle =	"Proc. 19th Allerton Conf. Commun. Control Comput."
-, year =	1981
-, pages =	"21--30"
-, keywords =	"decomposition, partition, visibility, shape, polygons, two-dimensional, convex"
+, author =      "J.-R. Sack and G. T. Toussaint"
+, title =       "A linear-time algorithm for decomposing rectilinear polygons into convex quadrilaterals"
+, booktitle =   "Proc. 19th Allerton Conf. Commun. Control Comput."
+, year =        1981
+, pages =       "21--30"
+, keywords =    "decomposition, partition, visibility, shape, polygons, two-dimensional, convex"
 }
 
 @incollection{st-gprp-88
-, author =	"J.-R. Sack and G. T. Toussaint"
-, title =	"Guard placement in rectilinear polygons"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"153--175"
-, keywords =	"decomposition, covering, partition, visibility, shape, polygons, two-dimensional, convex"
+, author =      "J.-R. Sack and G. T. Toussaint"
+, title =       "Guard placement in rectilinear polygons"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "153--175"
+, keywords =    "decomposition, covering, partition, visibility, shape, polygons, two-dimensional, convex"
 }
 
 @article{st-sppts-87
-, author =	"J.-R. Sack and G. T. Toussaint"
-, title =	"Separability of pairs of polygons through single translations"
-, journal =	"Robotica"
-, volume =	5
-, year =	1987
-, pages =	"55--63"
-, keywords =	"robotics, motion planning, decomposition, partition, separation, path planning, polygons, two-dimensional"
+, author =      "J.-R. Sack and G. T. Toussaint"
+, title =       "Separability of pairs of polygons through single translations"
+, journal =     "Robotica"
+, volume =      5
+, year =        1987
+, pages =       "55--63"
+, keywords =    "robotics, motion planning, decomposition, partition, separation, path planning, polygons, two-dimensional"
 }
 
 @book{su-hcg-00
-, title =	"Handbook of Computational Geometry"
-, editor =	"J.-R. Sack and J. Urrutia"
-, publisher =	"North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 97.03 tamassia"
-, annote =	"A collection of 22 survey articles: as-dssga-00, as-aa-00,ag-dgsmi-00, ac-dpcg-00,
-		 ak-vd-00, bp-mg-00, dmp-acggi-00, hd-mgvia-00, e-sts-00, gr-gds-00, k-pd-00, msd-ldp-00,
-		 m-dcg-00, s-rpigc-00, m-gspno-00, m-racg-00, nw-sdscd-00, rs-pcgau-00, ags-vp-00,
-		 s-cppcg-00, t-gd-00, u-agip-00"
+, title =       "Handbook of Computational Geometry"
+, editor =      "J.-R. Sack and J. Urrutia"
+, publisher =   "North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, update =      "00.03 bibrelex+smid, 99.03 bibrelex, 97.03 tamassia"
+, annote =      "A collection of 22 survey articles: as-dssga-00, as-aa-00,ag-dgsmi-00, ac-dpcg-00,
+                 ak-vd-00, bp-mg-00, dmp-acggi-00, hd-mgvia-00, e-sts-00, gr-gds-00, k-pd-00, msd-ldp-00,
+                 m-dcg-00, s-rpigc-00, m-gspno-00, m-racg-00, nw-sdscd-00, rs-pcgau-00, ags-vp-00,
+                 s-cppcg-00, t-gd-00, u-agip-00"
 }
 
 @article{sj-amksm-93
-, author =	"E. Sacks and L. Joskowicz"
-, title =	"Automated modeling and kinematic simulation of mechanisms"
-, journal =	"Comput. Aided Design"
-, volume =	25
-, number =	2
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "E. Sacks and L. Joskowicz"
+, title =       "Automated modeling and kinematic simulation of mechanisms"
+, journal =     "Comput. Aided Design"
+, volume =      25
+, number =      2
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @article{sj-ckahp-95
-, author =	"E. Sacks and L. Joskowicz"
-, title =	"Computational Kinematic Analysis of Higher Pairs with Multiple Contacts"
-, journal =	"ASME J. Mech. Design"
-, volume =	"??"
-, year =	1995
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "E. Sacks and L. Joskowicz"
+, title =       "Computational Kinematic Analysis of Higher Pairs with Multiple Contacts"
+, journal =     "ASME J. Mech. Design"
+, volume =      "??"
+, year =        1995
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{sj-cscmd-94
-, author =	"E. Sacks and L. Joskowicz"
-, title =	"Configuration space computation for mechanism design"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "E. Sacks and L. Joskowicz"
+, title =       "Configuration space computation for mechanism design"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @article{s-sagtf-80
-, author =	"E. A. Sadek"
-, title =	"A Scheme for the Automatic Generation of Triangular Finite Elements"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	15
-, year =	1980
-, pages =	"1813--1822"
-, annote =	"Triangulation of a region, no internal points
-		 specified. Builds triangles around corners and then
-		 proceeds along edges to cut off a layer and then
-		 repeats. when subdividing a quadrilateral suggests that
-		 with larger value of $R = \frac ab+
-		 \frac{b_1/b_2}{a_1/a_2}$ ($a$ and $b$ are lengths of
-		 diagonals which cut each other into $a_1\ge a_2$ and
-		 $b_1\ge b_2$)"
+, author =      "E. A. Sadek"
+, title =       "A Scheme for the Automatic Generation of Triangular Finite Elements"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      15
+, year =        1980
+, pages =       "1813--1822"
+, annote =      "Triangulation of a region, no internal points
+                 specified. Builds triangles around corners and then
+                 proceeds along edges to cut off a layer and then
+                 repeats. when subdividing a quadrilateral suggests that
+                 with larger value of $R = \frac ab+
+                 \frac{b_1/b_2}{a_1/a_2}$ ($a$ and $b$ are lengths of
+                 diagonals which cut each other into $a_1\ge a_2$ and
+                 $b_1\ge b_2$)"
 }
 
 @techreport{spd-e2dso-88
-, author =	"S. E. O. Saeed and A. de Pennington and J. R. Dodsworth"
-, title =	"An Efficient $2{D}$ Solid Offsetting Algorithm"
-, institution =	"Dept. of Mechanical Engineering, U. of Leeds"
-, address =	"Leeds, UK"
-, year =	1988
-, update =	"93.09 held"
+, author =      "S. E. O. Saeed and A. de Pennington and J. R. Dodsworth"
+, title =       "An Efficient $2{D}$ Solid Offsetting Algorithm"
+, institution = "Dept. of Mechanical Engineering, U. of Leeds"
+, address =     "Leeds, UK"
+, year =        1988
+, update =      "93.09 held"
 }
 
 @article{spd-ogm-88
-, author =	"S. E. O. Saeed and A. de Pennington and J. R. Dodsworth"
-, title =	"Offsetting in Geometric Modeling"
-, journal =	"Comput. Aided Design"
-, volume =	20
-, number =	2
-, month =	mar
-, year =	1988
-, pages =	"67--74"
-, update =	"93.09 held"
+, author =      "S. E. O. Saeed and A. de Pennington and J. R. Dodsworth"
+, title =       "Offsetting in Geometric Modeling"
+, journal =     "Comput. Aided Design"
+, volume =      20
+, number =      2
+, month =       mar
+, year =        1988
+, pages =       "67--74"
+, update =      "93.09 held"
 }
 
 @article{sl-sdtcm-91
-, author =	"S. Safavian and D. Landgrebe"
-, title =	"A survey of decision tree classifier methodology"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	21
-, number =	3
-, year =	1991
-, pages =	"660--674"
-, update =	"98.07 bibrelex"
+, author =      "S. Safavian and D. Landgrebe"
+, title =       "A survey of decision tree classifier methodology"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      21
+, number =      3
+, year =        1991
+, pages =       "660--674"
+, update =      "98.07 bibrelex"
 }
 
 @book{s-sfc-94
-, author =	"H. Sagan"
-, title =	"Space-filling curves"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1994
-, update =	"97.07 agarwal"
+, author =      "H. Sagan"
+, title =       "Space-filling curves"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1994
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{s-ansiu-87
-, author =	"J. Sage"
-, title =	"Artificial neural system implementations using {CCD} and {NMOS} technologies"
-, booktitle =	"Proc. Workshop on Artificial Neural Systems"
-, organization =	"Jet Propulsion Laboratory"
-, year =	1987
-, pages =	"72--84"
-, update =	"98.07 bibrelex"
+, author =      "J. Sage"
+, title =       "Artificial neural system implementations using {CCD} and {NMOS} technologies"
+, booktitle =   "Proc. Workshop on Artificial Neural Systems"
+, organization =        "Jet Propulsion Laboratory"
+, year =        1987
+, pages =       "72--84"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{stw-annic-86
-, author =	"J. Sage and K. Thompson and R. Withers"
-, title =	"An artificial neural network integrated circuit based on {NMOS}/{CCD} principles"
-, editor =	"J. Denker"
-, booktitle =	"Proc. AIP Conference: Neural Networks for Computing"
-, site =	"New York, NY"
-, volume =	151
-, organization =	"American Institute of Physics"
-, year =	1986
-, pages =	"381--385"
-, update =	"98.07 bibrelex"
+, author =      "J. Sage and K. Thompson and R. Withers"
+, title =       "An artificial neural network integrated circuit based on {NMOS}/{CCD} principles"
+, editor =      "J. Denker"
+, booktitle =   "Proc. AIP Conference: Neural Networks for Computing"
+, site =        "New York, NY"
+, volume =      151
+, organization =        "American Institute of Physics"
+, year =        1986
+, pages =       "381--385"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{sh-pmttr-85
-, author =	"G. Sahar and J. Hollerbach"
-, title =	"Planning of Minimum-Time Trajectories for Robot Arms"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"St. Louis"
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "G. Sahar and J. Hollerbach"
+, title =       "Planning of Minimum-Time Trajectories for Robot Arms"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "St. Louis"
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @techreport{sh-pmttr-84
-, author =	"G. Sahar and J. M. Hollerbach"
-, title =	"Planning of minimum-time trajectories for robot arms"
-, type =	"Technical {Report}"
-, number =	"A. I. Memo No. 804"
-, institution =	"Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, month =	nov
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "G. Sahar and J. M. Hollerbach"
+, title =       "Planning of minimum-time trajectories for robot arms"
+, type =        "Technical {Report}"
+, number =      "A. I. Memo No. 804"
+, institution = "Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, month =       nov
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{stv-dcasp-92
-, author =	"S. Sairam and R. Tamassia and J. S. Vitter"
-, title =	"A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs"
-, booktitle =	"Proc. 4th IEEE Symposium on Parallel and Distributed Processing"
-, year =	1992
-, pages =	"176--183"
-, precedes =	"stv-dcasp-"
-, update =	"94.09 vitter, 94.05 tamassia"
+, author =      "S. Sairam and R. Tamassia and J. S. Vitter"
+, title =       "A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs"
+, booktitle =   "Proc. 4th IEEE Symposium on Parallel and Distributed Processing"
+, year =        1992
+, pages =       "176--183"
+, precedes =    "stv-dcasp-"
+, update =      "94.09 vitter, 94.05 tamassia"
 }
 
 @article{stv-dcasp-
-, author =	"S. Sairam and R. Tamassia and J. S. Vitter"
-, title =	"A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs"
-, journal =	"Algorithmica"
-, volume =	"??"
-, year =	"to appear"
-, note =	"Preprint: Technical Report CS-92-15, Dept. of Computer Science, Brown Univ. (1992)"
-, succeeds =	"stv-dcasp-92"
-, update =	"94.05 tamassia"
+, author =      "S. Sairam and R. Tamassia and J. S. Vitter"
+, title =       "A Divide and Conquer Approach to Shortest Paths in Planar Layered Digraphs"
+, journal =     "Algorithmica"
+, volume =      "??"
+, year =        "to appear"
+, note =        "Preprint: Technical Report CS-92-15, Dept. of Computer Science, Brown Univ. (1992)"
+, succeeds =    "stv-dcasp-92"
+, update =      "94.05 tamassia"
 }
 
 @inproceedings{svt-ctaic-93
-, author =	"S. Sairam and J. S. Vitter and R. Tamassia"
-, title =	"A Complexity Theoretic Approach to Incremental Computation"
-, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	665
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"640--649"
-, keywords =	"dynamic computation, complexity theory"
-, precedes =	"msvt-cmic-94"
-, update =	"97.11 bibrelex, 94.05 tamassia"
+, author =      "S. Sairam and J. S. Vitter and R. Tamassia"
+, title =       "A Complexity Theoretic Approach to Incremental Computation"
+, booktitle =   "Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      665
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "640--649"
+, keywords =    "dynamic computation, complexity theory"
+, precedes =    "msvt-cmic-94"
+, update =      "97.11 bibrelex, 94.05 tamassia"
 }
 
 @article{st-pwvt-88
-, author =	"M. Sakamoto and M. Takagi"
-, title =	"Patterns of weighted {Voronoi} Tessellations"
-, journal =	"Science and Form"
-, volume =	3
-, year =	1988
-, pages =	"103--111"
-, update =	"00.03 bibrelex"
+, author =      "M. Sakamoto and M. Takagi"
+, title =       "Patterns of weighted {Voronoi} Tessellations"
+, journal =     "Science and Form"
+, volume =      3
+, year =        1988
+, pages =       "103--111"
+, update =      "00.03 bibrelex"
 }
 
 @techreport{s-pcpbg-81
-, author =	"B. Sakoda"
-, title =	"Parallel construction of polygonal boundaries from given vertices on a raster"
-, type =	"Technical {Report}"
-, number =	"CS81 1-21"
-, institution =	"Dept. Comput. Sci., Pennsylvania State Univ."
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "B. Sakoda"
+, title =       "Parallel construction of polygonal boundaries from given vertices on a raster"
+, type =        "Technical {Report}"
+, number =      "CS81 1-21"
+, institution = "Dept. Comput. Sci., Pennsylvania State Univ."
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @incollection{s-sh-93
-, author =	"Michael E. Saks"
-, title =	"Slicing the Hypercube"
-, editor =	"K. Walker"
-, booktitle =	"Surveys in Combinatorics"
-, series =	"London Mathematical Society Lecture Notes Series"
-, volume =	187
-, publisher =	"Cambridge University Press"
-, year =	1993
-, pages =	"211--256"
-, update =	"94.05 aich"
+, author =      "Michael E. Saks"
+, title =       "Slicing the Hypercube"
+, editor =      "K. Walker"
+, booktitle =   "Surveys in Combinatorics"
+, series =      "London Mathematical Society Lecture Notes Series"
+, volume =      187
+, publisher =   "Cambridge University Press"
+, year =        1993
+, pages =       "211--256"
+, update =      "94.05 aich"
 }
 
 @incollection{s-oiphv-82
-, author =	"B. E. A. Saleh"
-, title =	"Optical information processing and the human visual system"
-, booktitle =	"Applications of Optical Fourier Transforms"
-, year =	1982
-, pages =	"431--463"
-, update =	"98.11 bibrelex"
+, author =      "B. E. A. Saleh"
+, title =       "Optical information processing and the human visual system"
+, booktitle =   "Applications of Optical Fourier Transforms"
+, year =        1982
+, pages =       "431--463"
+, update =      "98.11 bibrelex"
 }
 
 @mastersthesis{s-sbevc-96
-, author =	"S. Salinger"
-, title =	"Struktureigenschaften von {Bereichsr{\"a}umen} endlicher {VC}-{Dimension}"
-, type =	"Masters Thesis"
-, school =	"Fachbereich Mathematik, Freie Univ. Berlin"
-, address =	"Berlin, Germany"
-, year =	1996
-, keywords =	"masters thesis"
-, update =	"97.03 gaertner+salinger"
+, author =      "S. Salinger"
+, title =       "Struktureigenschaften von {Bereichsr{\"a}umen} endlicher {VC}-{Dimension}"
+, type =        "Masters Thesis"
+, school =      "Fachbereich Mathematik, Freie Univ. Berlin"
+, address =     "Berlin, Germany"
+, year =        1996
+, keywords =    "masters thesis"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{s-dcah-84
-, author =	"J. Salisbury"
-, title =	"Design and control of an articulated hand"
-, booktitle =	"Proc. 1st Intl. Sympos. Design and Synthesis"
-, site =	"Tokyo, Japan"
-, year =	1984
-, update =	"98.11 bibrelex"
+, author =      "J. Salisbury"
+, title =       "Design and control of an articulated hand"
+, booktitle =   "Proc. 1st Intl. Sympos. Design and Synthesis"
+, site =        "Tokyo, Japan"
+, year =        1984
+, update =      "98.11 bibrelex"
 }
 
 @article{s-irp-87
-, author =	"G. T. Sallee"
-, title =	"Invertible relations on polytopes"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"395--399"
+, author =      "G. T. Sallee"
+, title =       "Invertible relations on polytopes"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "395--399"
 }
 
 @article{s-scsp-73
-, author =	"G. T. Sallee"
-, title =	"Stretching chords of space curves"
-, journal =	"Geom. Dedicata"
-, volume =	2
-, year =	1973
-, pages =	"311--315"
-, update =	"02.03 orourke"
+, author =      "G. T. Sallee"
+, title =       "Stretching chords of space curves"
+, journal =     "Geom. Dedicata"
+, volume =      2
+, year =        1973
+, pages =       "311--315"
+, update =      "02.03 orourke"
 }
 
 @book{s-limha-85
-, author =	"G. Salmon"
-, title =	"Lessons Introductory to the Modern Higher Algebra"
-, publisher =	"Chelsea Publishing Company"
-, address =	"New York, NY"
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "G. Salmon"
+, title =       "Lessons Introductory to the Modern Higher Algebra"
+, publisher =   "Chelsea Publishing Company"
+, address =     "New York, NY"
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @article{s-eppa-78
-, author =	"K. B. Salomon"
-, title =	"An efficient point-in-polygon algorithm"
-, journal =	"Comput. Geosci."
-, volume =	4
-, year =	1978
-, pages =	"173--178"
+, author =      "K. B. Salomon"
+, title =       "An efficient point-in-polygon algorithm"
+, journal =     "Comput. Geosci."
+, volume =      4
+, year =        1978
+, pages =       "173--178"
 }
 
 @article{s-lisps-89
-, author =	"J. Salowe"
-, title =	"{$L_{\infty}$} interdistance selection by parametric search"
-, journal =	"Inform. Process. Lett."
-, volume =	30
-, year =	1989
-, pages =	"9--14"
+, author =      "J. Salowe"
+, title =       "{$L_{\infty}$} interdistance selection by parametric search"
+, journal =     "Inform. Process. Lett."
+, volume =      30
+, year =        1989
+, pages =       "9--14"
 }
 
 @incollection{s-ps-97
-, author =	"J. Salowe"
-, title =	"Parametric search"
-, chapter =	37
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"683--698"
-, update =	"97.11 orourke"
+, author =      "J. Salowe"
+, title =       "Parametric search"
+, chapter =     37
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "683--698"
+, update =      "97.11 orourke"
 }
 
 @phdthesis{s-spcg-87
-, author =	"J. Salowe"
-, title =	"Selection problems in computational geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1987
-, keywords =	"doctoral thesis"
+, author =      "J. Salowe"
+, title =       "Selection problems in computational geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1987
+, keywords =    "doctoral thesis"
 }
 
 @article{s-cmsg-91
-, author =	"J. S. Salowe"
-, title =	"Constructing multidimensional spanner graphs"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	2
-, year =	1991
-, pages =	"99--107"
-, keywords =	"distance, minimum spanning tree, spanning graph, sparse"
+, author =      "J. S. Salowe"
+, title =       "Constructing multidimensional spanner graphs"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      2
+, year =        1991
+, pages =       "99--107"
+, keywords =    "distance, minimum spanning tree, spanning graph, sparse"
 }
 
 @inproceedings{s-cmsga-91
-, author =	"J. S. Salowe"
-, title =	"Construction of multidimensional spanner graphs, with applications to minimum spanning trees"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"256--261"
-, keywords =	"proximity, minimum spanning tree"
-, cites =	"aesw-emstb-90, addj-gsswg-90, c-tipga-86, c-fetaa-84, dj-wtacg-89, dfs-dgaag-90, gbt-srtgp-84, ggst-eamst-86, k-aceg-88, kg-dtcac-89, ll-tapga-89, sh-cpp-75, v-mstkd-88, v-oaann-89, y-cmstk-82, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "J. S. Salowe"
+, title =       "Construction of multidimensional spanner graphs, with applications to minimum spanning trees"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "256--261"
+, keywords =    "proximity, minimum spanning tree"
+, cites =       "aesw-emstb-90, addj-gsswg-90, c-tipga-86, c-fetaa-84, dj-wtacg-89, dfs-dgaag-90, gbt-srtgp-84, ggst-eamst-86, k-aceg-88, kg-dtcac-89, ll-tapga-89, sh-cpp-75, v-mstkd-88, v-oaann-89, y-cmstk-82, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-eis-92
-, author =	"J. S. Salowe"
-, title =	"Enumerating interdistances in space"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, year =	1992
-, pages =	"49--59"
-, keywords =	"distance, fixed-radius near neighbors, parametric search, selection"
+, author =      "J. S. Salowe"
+, title =       "Enumerating interdistances in space"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, year =        1992
+, pages =       "49--59"
+, keywords =    "distance, fixed-radius near neighbors, parametric search, selection"
 }
 
 @article{s-esgdf-94
-, author =	"J. S. Salowe"
-, title =	"Euclidean spanner graphs with degree four"
-, journal =	"Discrete Appl. Math."
-, volume =	54
-, year =	1994
-, pages =	"55--66"
-, update =	"95.01 smid"
+, author =      "J. S. Salowe"
+, title =       "Euclidean spanner graphs with degree four"
+, journal =     "Discrete Appl. Math."
+, volume =      54
+, year =        1994
+, pages =       "55--66"
+, update =      "95.01 smid"
 }
 
 @inproceedings{s-esgsd-92
-, author =	"J. S. Salowe"
-, title =	"On {Euclidean} spanner graphs with small degree"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"186--191"
-, cites =	"de-eaahc-84, dfs-dgaag-90, sv-hsiub-89, v-sgagc-91, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "J. S. Salowe"
+, title =       "On {Euclidean} spanner graphs with small degree"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "186--191"
+, cites =       "de-eaahc-84, dfs-dgaag-90, sv-hsiub-89, v-sgagc-91, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{s-sklac-89
-, author =	"J. S. Salowe"
-, title =	"Selecting the $k$th largest-area convex polygon"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"243--250"
+, author =      "J. S. Salowe"
+, title =       "Selecting the $k$th largest-area convex polygon"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "243--250"
 }
 
 @inproceedings{s-sisie-91
-, author =	"J. S. Salowe"
-, title =	"Shallow interdistance selection and interdistance enumeration"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"117--128"
-, keywords =	"proximity, distance"
+, author =      "J. S. Salowe"
+, title =       "Shallow interdistance selection and interdistance enumeration"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "117--128"
+, keywords =    "proximity, distance"
 }
 
 @inproceedings{sw-ersta-93
-, author =	"J. S. Salowe and D. M. Warme"
-, title =	"An exact rectilinear {Steiner} tree algorithm"
-, booktitle =	"Proc. IEEE Inernat. Conf. Comput. Design"
-, site =	"Cambridge, MA"
-, month =	oct
-, year =	1993
-, pages =	"472--475"
-, update =	"98.03 bibrelex"
+, author =      "J. S. Salowe and D. M. Warme"
+, title =       "An exact rectilinear {Steiner} tree algorithm"
+, booktitle =   "Proc. IEEE Inernat. Conf. Comput. Design"
+, site =        "Cambridge, MA"
+, month =       oct
+, year =        1993
+, pages =       "472--475"
+, update =      "98.03 bibrelex"
 }
 
 @article{sw-tfprs-95
-, author =	"J. S. Salowe and D. M. Warme"
-, title =	"Thirty-five point rectilinear {Steiner} minimal trees in a day"
-, journal =	"Networks"
-, volume =	25
-, year =	1995
-, pages =	"69--87"
-, update =	"98.07 bibrelex"
+, author =      "J. S. Salowe and D. M. Warme"
+, title =       "Thirty-five point rectilinear {Steiner} minimal trees in a day"
+, journal =     "Networks"
+, volume =      25
+, year =        1995
+, pages =       "69--87"
+, update =      "98.07 bibrelex"
 }
 
 @book{s-atp-89
-, author =	"G. Salton"
-, title =	"Automatic Text Processing"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1989
-, update =	"97.07 agarwal"
+, author =      "G. Salton"
+, title =       "Automatic Text Processing"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1989
+, update =      "97.07 agarwal"
 }
 
 @techreport{sdhk-lht-90
-, author =	"S. Salzberg and A. Delcher and D. Heath and S. Kasif"
-, title =	"Learning with a helpful teacher"
-, institution =	"Dept. of Comp. Sci., Johns Hopkins Univ"
-, address =	"Baltimore, MD"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "S. Salzberg and A. Delcher and D. Heath and S. Kasif"
+, title =       "Learning with a helpful teacher"
+, institution = "Dept. of Comp. Sci., Johns Hopkins Univ"
+, address =     "Baltimore, MD"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{sdhk-lht-91
-, author =	"S. Salzberg and A. Delcher and S. Heath and S. Kasif"
-, title =	"Learning with a helpful teacher"
-, booktitle =	"Proc. 12th Internat. Joint Conf. Artif. Intell."
-, site =	"Sydney, Australia"
-, year =	1991
-, note =	"To appear"
-, update =	"97.11 bibrelex"
+, author =      "S. Salzberg and A. Delcher and S. Heath and S. Kasif"
+, title =       "Learning with a helpful teacher"
+, booktitle =   "Proc. 12th Internat. Joint Conf. Artif. Intell."
+, site =        "Sydney, Australia"
+, year =        1991
+, note =        "To appear"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{skw-gpsp-89
-, author =	"K. Sambandan and K. Kedem and K. Wang"
-, title =	"Generalized planar sweeping of polygons"
-, type =	"Technical {Report}"
-, number =	"TR~89-1062"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	dec
-, year =	1989
-, update =	"93.09 milone+mitchell"
+, author =      "K. Sambandan and K. Kedem and K. Wang"
+, title =       "Generalized planar sweeping of polygons"
+, type =        "Technical {Report}"
+, number =      "TR~89-1062"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       dec
+, year =        1989
+, update =      "93.09 milone+mitchell"
 }
 
 @article{sbm-gpiid-95
-, author =	"M. Sambridge and J. Braun and H. McQueen"
-, title =	"Geophysical parameterization and interpolation of irregular data using natural neighbours"
-, journal =	"Geophys. J. Int."
-, volume =	122
-, year =	1995
-, pages =	"837--857"
-, keywords =	"natural neighbour interpolation, irregular parameterization"
-, update =	"95.09 sambridge"
-, annote =	"Presents details of algorithms for nn-interpolation of
+, author =      "M. Sambridge and J. Braun and H. McQueen"
+, title =       "Geophysical parameterization and interpolation of irregular data using natural neighbours"
+, journal =     "Geophys. J. Int."
+, volume =      122
+, year =        1995
+, pages =       "837--857"
+, keywords =    "natural neighbour interpolation, irregular parameterization"
+, update =      "95.09 sambridge"
+, annote =      "Presents details of algorithms for nn-interpolation of
 irregular data, including first derivatives. Tutorial style intended to
 introduce concepts and applications of natural neighbours to
 geophysicists."
 }
 
 @article{s-qmat-83
-, author =	"H. Samet"
-, title =	"A quadtree medial axis transform"
-, journal =	"Commun. ACM"
-, volume =	26
-, year =	1983
-, pages =	"680--693"
-, update =	"97.11 bibrelex"
+, author =      "H. Samet"
+, title =       "A quadtree medial axis transform"
+, journal =     "Commun. ACM"
+, volume =      26
+, year =        1983
+, pages =       "680--693"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{s-rhrss-92
-, author =	"H. Samet"
-, title =	"A Review of Hierarchical Representations of Shape and Some Applications"
-, editor =	"C. Arcelli and L. P. Cordella and G. Sanniti di Baja"
-, booktitle =	"Visual Form Analysis and Recognition"
-, publisher =	"Plenum Press"
-, address =	"New York"
-, year =	1992
-, pages =	"451--467"
-, update =	"96.05 efrat"
+, author =      "H. Samet"
+, title =       "A Review of Hierarchical Representations of Shape and Some Applications"
+, editor =      "C. Arcelli and L. P. Cordella and G. Sanniti di Baja"
+, booktitle =   "Visual Form Analysis and Recognition"
+, publisher =   "Plenum Press"
+, address =     "New York"
+, year =        1992
+, pages =       "451--467"
+, update =      "96.05 efrat"
 }
 
 @article{s-tdqta-85
-, author =	"H. Samet"
-, title =	"A top--down quadtree traversal algorithm"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	7
-, number =	1
-, month =	jan
-, year =	1985
-, pages =	"94--98"
-, update =	"96.05 efrat"
+, author =      "H. Samet"
+, title =       "A top--down quadtree traversal algorithm"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      7
+, number =      1
+, month =       jan
+, year =        1985
+, pages =       "94--98"
+, update =      "96.05 efrat"
 }
 
 @article{s-acqr-84
-, author =	"H. Samet"
-, title =	"Algorithms for the conversion of quadtrees to rasters"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	26
-, number =	1
-, month =	apr
-, year =	1984
-, pages =	"1--16"
-, update =	"96.05 efrat"
+, author =      "H. Samet"
+, title =       "Algorithms for the conversion of quadtrees to rasters"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      26
+, number =      1
+, month =       apr
+, year =        1984
+, pages =       "1--16"
+, update =      "96.05 efrat"
 }
 
 @article{s-acrq-81
-, author =	"H. Samet"
-, title =	"An algorithm for converting rasters to quadtrees"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-3"
-, year =	1981
-, pages =	"93--95"
+, author =      "H. Samet"
+, title =       "An algorithm for converting rasters to quadtrees"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-3"
+, year =        1981
+, pages =       "93--95"
 }
 
 @incollection{s-oqorh-88
-, author =	"H. Samet"
-, title =	"An overview of quadtrees, octrees, and related hierarchical data structures"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1988
-, pages =	"51--68"
-, keywords =	"data structuring, quad trees, oct trees, survey paper"
-, update =	"97.03 schwarzkopf"
+, author =      "H. Samet"
+, title =       "An overview of quadtrees, octrees, and related hierarchical data structures"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1988
+, pages =       "51--68"
+, keywords =    "data structuring, quad trees, oct trees, survey paper"
+, update =      "97.03 schwarzkopf"
 }
 
 @book{s-asdsc-90
-, author =	"H. Samet"
-, title =	"Applications of Spatial Data Structures: Computer Graphics, Image Processing, and {GIS}"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1990
-, isbn =	"0-201-50300-X"
-, keywords =	"octrees"
-, update =	"97.03 schwarzkopf, 93.09 held"
+, author =      "H. Samet"
+, title =       "Applications of Spatial Data Structures: Computer Graphics, Image Processing, and {GIS}"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1990
+, isbn =        "0-201-50300-X"
+, keywords =    "octrees"
+, update =      "97.03 schwarzkopf, 93.09 held"
 }
 
 @article{s-cpirq-81
-, author =	"H. Samet"
-, title =	"Computing perimeters of images represented by quadtrees"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-3"
-, year =	1981
-, pages =	"686--687"
+, author =      "H. Samet"
+, title =       "Computing perimeters of images represented by quadtrees"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-3"
+, year =        1981
+, pages =       "686--687"
 }
 
 @article{s-ccluq-81
-, author =	"H. Samet"
-, title =	"Connected component labeling using quad trees"
-, journal =	"J. ACM"
-, volume =	28
-, year =	1981
-, pages =	"487--501"
+, author =      "H. Samet"
+, title =       "Connected component labeling using quad trees"
+, journal =     "J. ACM"
+, volume =      28
+, year =        1981
+, pages =       "487--501"
 }
 
 @article{s-dsqac-84
-, author =	"H. Samet"
-, title =	"Data structures for quadtree approximation and compression"
-, journal =	"Commun. ACM"
-, volume =	27
-, year =	1984
-, pages =	"973--993"
+, author =      "H. Samet"
+, title =       "Data structures for quadtree approximation and compression"
+, journal =     "Commun. ACM"
+, volume =      27
+, year =        1984
+, pages =       "973--993"
 }
 
 @article{s-dtdqt-80
-, author =	"H. Samet"
-, title =	"Deletion in two-dimensional quad trees"
-, journal =	"Commun. ACM"
-, volume =	23
-, year =	1980
-, pages =	"703--710"
+, author =      "H. Samet"
+, title =       "Deletion in two-dimensional quad trees"
+, journal =     "Commun. ACM"
+, volume =      23
+, year =        1980
+, pages =       "703--710"
 }
 
 @article{s-dtirq-82
-, author =	"H. Samet"
-, title =	"Distance transform for images represented by quadtrees"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-4"
-, year =	1982
-, pages =	"298--303"
+, author =      "H. Samet"
+, title =       "Distance transform for images represented by quadtrees"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-4"
+, year =        1982
+, pages =       "298--303"
 }
 
 @inproceedings{s-hdssr-90
-, author =	"H. Samet"
-, title =	"Hierarchical Data Structures for Spatial Reasoning"
-, editor =	"L. F. Pau"
-, booktitle =	"Mapping and Spatial Modelling for Navigation"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Germany"
-, year =	1990
-, pages =	"41--58"
-, update =	"96.09 agarwal, 96.05 efrat"
+, author =      "H. Samet"
+, title =       "Hierarchical Data Structures for Spatial Reasoning"
+, editor =      "L. F. Pau"
+, booktitle =   "Mapping and Spatial Modelling for Navigation"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Germany"
+, year =        1990
+, pages =       "41--58"
+, update =      "96.09 agarwal, 96.05 efrat"
 }
 
 @incollection{s-hdstd-92
-, author =	"H. Samet"
-, title =	"Hierarchical Data Structures for Three-Dimensional Data"
-, editor =	"R. Vinken"
-, booktitle =	"From Geoscientific Map Series to Geo-Information Systems"
-, series =	"Geologisches Jahrbuch A"
-, volume =	122
-, publisher =	"??"
-, address =	"Hannover, Germany"
-, year =	1992
-, pages =	"45--58"
-, update =	"96.05 efrat"
+, author =      "H. Samet"
+, title =       "Hierarchical Data Structures for Three-Dimensional Data"
+, editor =      "R. Vinken"
+, booktitle =   "From Geoscientific Map Series to Geo-Information Systems"
+, series =      "Geologisches Jahrbuch A"
+, volume =      122
+, publisher =   "??"
+, address =     "Hannover, Germany"
+, year =        1992
+, pages =       "45--58"
+, update =      "96.05 efrat"
 }
 
 @article{s-hrcsr-88
-, author =	"H. Samet"
-, title =	"Hierarchical representations of collections of small rectangles"
-, journal =	"ACM Comput. Surv."
-, volume =	20
-, number =	4
-, month =	dec
-, year =	1988
-, pages =	"271--309"
-, update =	"96.05 efrat"
+, author =      "H. Samet"
+, title =       "Hierarchical representations of collections of small rectangles"
+, journal =     "ACM Comput. Surv."
+, volume =      20
+, number =      4
+, month =       dec
+, year =        1988
+, pages =       "271--309"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{s-hsds-89
-, author =	"H. Samet"
-, title =	"Hierarchical spatial data structures"
-, editor =	"A. Buchmann and O. G{\"u}nther and T. R. Smith and Y. F. Wang"
-, booktitle =	"Design and Implementation of Large Spatial Databases: First Symposium"
-, site =	"Santa Barbara, California"
-, month =	jul
-, year =	1989
-, pages =	"193--212"
-, update =	"96.05 efrat"
+, author =      "H. Samet"
+, title =       "Hierarchical spatial data structures"
+, editor =      "A. Buchmann and O. G{\"u}nther and T. R. Smith and Y. F. Wang"
+, booktitle =   "Design and Implementation of Large Spatial Databases: First Symposium"
+, site =        "Santa Barbara, California"
+, month =       jul
+, year =        1989
+, pages =       "193--212"
+, update =      "96.05 efrat"
 }
 
 @article{s-irton-89
-, author =	"H. Samet"
-, title =	"Implementing ray tracing with octrees and neighbor finding"
-, journal =	"Computers \& Graphics"
-, volume =	13
-, number =	4
-, year =	1989
-, pages =	"445--460"
-, note =	"(also University of Maryland Computer
+, author =      "H. Samet"
+, title =       "Implementing ray tracing with octrees and neighbor finding"
+, journal =     "Computers \& Graphics"
+, volume =      13
+, number =      4
+, year =        1989
+, pages =       "445--460"
+, note =        "(also University of Maryland Computer
                    Science TR--2204)"
-, update =	"96.05 efrat"
+, update =      "96.05 efrat"
 }
 
 @article{s-nfiro-89
-, author =	"H. Samet"
-, title =	"Neighbor finding in images represented by octrees"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	46
-, number =	3
-, month =	jun
-, year =	1989
-, pages =	"367--386"
-, update =	"96.05 efrat"
+, author =      "H. Samet"
+, title =       "Neighbor finding in images represented by octrees"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      46
+, number =      3
+, month =       jun
+, year =        1989
+, pages =       "367--386"
+, update =      "96.05 efrat"
 }
 
 @article{s-nftir-82
-, author =	"H. Samet"
-, title =	"Neighbor finding techniques for images represented by quadtrees"
-, journal =	"Comput. Graph. Image Process."
-, volume =	18
-, year =	1982
-, pages =	"37--57"
-, update =	"97.11 bibrelex, 96.05 efrat"
-, annote =	"also Proceedings of Pattern Recognition and
-		 Image Processing 81, Dallas, August 1981, 68--74"
+, author =      "H. Samet"
+, title =       "Neighbor finding techniques for images represented by quadtrees"
+, journal =     "Comput. Graph. Image Process."
+, volume =      18
+, year =        1982
+, pages =       "37--57"
+, update =      "97.11 bibrelex, 96.05 efrat"
+, annote =      "also Proceedings of Pattern Recognition and
+                 Image Processing 81, Dallas, August 1981, 68--74"
 }
 
 @article{s-rqqma-85
-, author =	"H. Samet"
-, title =	"Reconstruction of quadtrees from quadtree medial axis transforms"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	29
-, number =	3
-, month =	mar
-, year =	1985
-, pages =	"311--328"
-, update =	"96.05 efrat"
+, author =      "H. Samet"
+, title =       "Reconstruction of quadtrees from quadtree medial axis transforms"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      29
+, number =      3
+, month =       mar
+, year =        1985
+, pages =       "311--328"
+, update =      "96.05 efrat"
 }
 
 @techreport{s-rrqrc-79
-, author =	"H. Samet"
-, title =	"Region representation: quadtree-to-raster conversion"
-, type =	"Report"
-, number =	"TR-768"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1979
+, author =      "H. Samet"
+, title =       "Region representation: quadtree-to-raster conversion"
+, type =        "Report"
+, number =      "TR-768"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1979
 }
 
 @article{s-rrqba-80
-, author =	"H. Samet"
-, title =	"Region representation: quadtrees from binary arrays"
-, journal =	"Comput. Graph. Image Process."
-, volume =	13
-, year =	1980
-, pages =	"88--93"
+, author =      "H. Samet"
+, title =       "Region representation: quadtrees from binary arrays"
+, journal =     "Comput. Graph. Image Process."
+, volume =      13
+, year =        1980
+, pages =       "88--93"
 }
 
 @article{s-rrqbc-80
-, author =	"H. Samet"
-, title =	"Region representation: quadtrees from boundary codes"
-, journal =	"Commun. ACM"
-, volume =	23
-, year =	1980
-, pages =	"163--170"
+, author =      "H. Samet"
+, title =       "Region representation: quadtrees from boundary codes"
+, journal =     "Commun. ACM"
+, volume =      23
+, year =        1980
+, pages =       "163--170"
 }
 
 @techreport{s-rrrqc-79
-, author =	"H. Samet"
-, title =	"Region representation: raster-to-quadtree conversion"
-, type =	"Report"
-, number =	"TR-766"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1979
+, author =      "H. Samet"
+, title =       "Region representation: raster-to-quadtree conversion"
+, type =        "Report"
+, number =      "TR-766"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1979
 }
 
 @article{s-remqt-94
-, author =	"H. Samet"
-, title =	"Representaciones Especiales Mediante Quadtrees (translated by J. A. Cebrian)"
-, journal =	"Boleti\*'n del Asociacio\*'n Espan\*~ola de Sistemas de Informacio\*'n Geogra\*'fica"
-, volume =	6
-, month =	may
-, year =	1994
-, pages =	"10--12"
-, update =	"96.05 efrat"
+, author =      "H. Samet"
+, title =       "Representaciones Especiales Mediante Quadtrees (translated by J. A. Cebrian)"
+, journal =     "Boleti\*'n del Asociacio\*'n Espan\*~ola de Sistemas de Informacio\*'n Geogra\*'fica"
+, volume =      6
+, month =       may
+, year =        1994
+, pages =       "10--12"
+, update =      "96.05 efrat"
 }
 
 @incollection{s-sds-95
-, author =	"H. Samet"
-, title =	"Spatial data structures"
-, editor =	"W. Kim"
-, booktitle =	"Modern Database Systems, The Object Model, Interoperability and Beyond"
-, publisher =	"{ACM} Press and Addison-Wesley"
-, year =	1995
-, pages =	"361--385"
-, update =	"96.05 efrat"
+, author =      "H. Samet"
+, title =       "Spatial data structures"
+, editor =      "W. Kim"
+, booktitle =   "Modern Database Systems, The Object Model, Interoperability and Beyond"
+, publisher =   "{ACM} Press and Addison-Wesley"
+, year =        1995
+, pages =       "361--385"
+, update =      "96.05 efrat"
 }
 
 @book{s-sdsqo-89
-, author =	"H. Samet"
-, title =	"Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical Methods"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1989
-, update =	"97.11 bibrelex, 95.09 tamassia, 93.09 held"
+, author =      "H. Samet"
+, title =       "Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical Methods"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1989
+, update =      "97.11 bibrelex, 95.09 tamassia, 93.09 held"
 }
 
 @book{s-dasds-90
-, author =	"H. Samet"
-, title =	"The Design and Analysis of Spatial Data Structures"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1990
-, isbn =	"0-201-50255-0"
-, keywords =	"octrees"
-, update =	"93.09 held"
+, author =      "H. Samet"
+, title =       "The Design and Analysis of Spatial Data Structures"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1990
+, isbn =        "0-201-50255-0"
+, keywords =    "octrees"
+, update =      "93.09 held"
 }
 
 @article{s-qrhds-84
-, author =	"H. Samet"
-, title =	"The quadtree and related hierarchical data structures"
-, journal =	"ACM Comput. Surv."
-, volume =	16
-, number =	2
-, month =	jun
-, year =	1984
+, author =      "H. Samet"
+, title =       "The quadtree and related hierarchical data structures"
+, journal =     "ACM Comput. Surv."
+, volume =      16
+, number =      2
+, month =       jun
+, year =        1984
 }
 
 @incollection{sa-sdmqp-95
-, author =	"H. Samet and W. G. Aref"
-, title =	"Spatial data models and query processing"
-, editor =	"W. Kim"
-, booktitle =	"Modern Database Systems, The Object Model, Interoperability and Beyond"
-, publisher =	"{ACM} Press and Addison-Wesley"
-, year =	1995
-, pages =	"338--360"
-, update =	"96.05 efrat"
+, author =      "H. Samet and W. G. Aref"
+, title =       "Spatial data models and query processing"
+, editor =      "W. Kim"
+, booktitle =   "Modern Database Systems, The Object Model, Interoperability and Beyond"
+, publisher =   "{ACM} Press and Addison-Wesley"
+, year =        1995
+, pages =       "338--360"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{sr-qrbi-80
-, author =	"H. Samet and A. Rosenfeld"
-, title =	"Quadtree representations of binary images"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
-, site =	"Miami Beach"
-, month =	dec
-, year =	1980
-, pages =	"815--818"
-, update =	"96.05 efrat"
+, author =      "H. Samet and A. Rosenfeld"
+, title =       "Quadtree representations of binary images"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Pattern Recogn."
+, site =        "Miami Beach"
+, month =       dec
+, year =        1980
+, pages =       "815--818"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{sw-qrrce-83
-, author =	"H. Samet and A. Rosenfeld and C. Shaffer and R. E. Webber"
-, title =	"Quadtree Region Representation in Cartography: Experimental Results"
-, booktitle =	"Proceedings of the CVPR83 Conference"
-, site =	"Washington DC"
-, month =	jun
-, year =	1983
-, pages =	"176--177"
-, update =	"96.05 efrat"
+, author =      "H. Samet and A. Rosenfeld and C. Shaffer and R. E. Webber"
+, title =       "Quadtree Region Representation in Cartography: Experimental Results"
+, booktitle =   "Proceedings of the CVPR83 Conference"
+, site =        "Washington DC"
+, month =       jun
+, year =        1983
+, pages =       "176--177"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{srs-uhdsg-84
-, author =	"H. Samet and A. Rosenfeld and C. A. Shaffer"
-, title =	"Use of hierarchical data structures in geographical information systems"
-, booktitle =	"ssdh84"
-, site =	"Zurich, Switzerland"
-, month =	aug
-, year =	1984
-, pages =	"392--411"
-, update =	"96.05 efrat"
+, author =      "H. Samet and A. Rosenfeld and C. A. Shaffer"
+, title =       "Use of hierarchical data structures in geographical information systems"
+, booktitle =   "ssdh84"
+, site =        "Zurich, Switzerland"
+, month =       aug
+, year =        1984
+, pages =       "392--411"
+, update =      "96.05 efrat"
 }
 
 @techreport{srsnh-ahdsg-84
-, author =	"H. Samet and A. Rosenfeld and C. A. Shaffer and R. C. Nelson and Y. G. Huang"
-, title =	"Application of hierarchical data structures to geographic information systems: phase III"
-, type =	"Computer Science Department"
-, number =	"TR--1457"
-, institution =	"University of Maryland"
-, address =	"College Park, MD"
-, month =	nov
-, year =	1984
-, update =	"96.05 efrat"
+, author =      "H. Samet and A. Rosenfeld and C. A. Shaffer and R. C. Nelson and Y. G. Huang"
+, title =       "Application of hierarchical data structures to geographic information systems: phase III"
+, type =        "Computer Science Department"
+, number =      "TR--1457"
+, institution = "University of Maryland"
+, address =     "College Park, MD"
+, month =       nov
+, year =        1984
+, update =      "96.05 efrat"
 }
 
 @techreport{srsnhf-ahdsg-85
-, author =	"H. Samet and A. Rosenfeld and C. A. Shaffer and R. C. Nelson and Y. G. Huang and K. Fujimura"
-, title =	"Application of hierarchical data structures to geographic information systems: phase IV"
-, type =	"Computer Science Department"
-, number =	"TR--1578"
-, institution =	"University of Maryland"
-, address =	"College Park, MD"
-, month =	dec
-, year =	1985
-, update =	"96.05 efrat"
+, author =      "H. Samet and A. Rosenfeld and C. A. Shaffer and R. C. Nelson and Y. G. Huang and K. Fujimura"
+, title =       "Application of hierarchical data structures to geographic information systems: phase IV"
+, type =        "Computer Science Department"
+, number =      "TR--1578"
+, institution = "University of Maryland"
+, address =     "College Park, MD"
+, month =       dec
+, year =        1985
+, update =      "96.05 efrat"
 }
 
 @article{srsw-gisuq-84
-, author =	"H. Samet and A. Rosenfeld and C. A. Shaffer and R. E. Webber"
-, title =	"A geographic information system using quadtrees"
-, journal =	"Pattern Recogn."
-, volume =	17
-, number =	6
-, month =	"November/December"
-, year =	1984
-, pages =	"647--656"
-, update =	"96.05 efrat"
+, author =      "H. Samet and A. Rosenfeld and C. A. Shaffer and R. E. Webber"
+, title =       "A geographic information system using quadtrees"
+, journal =     "Pattern Recogn."
+, volume =      17
+, number =      6
+, month =       "November/December"
+, year =        1984
+, pages =       "647--656"
+, update =      "96.05 efrat"
 }
 
 @article{srsw-qrrce-83
-, author =	"H. Samet and A. Rosenfeld and C. A. Shaffer and R. E. Webber"
-, title =	"Quadtree region representation in cartography: experimental results"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	13
-, number =	6
-, month =	"November/December"
-, year =	1983
-, pages =	"1148--1154"
-, update =	"96.05 efrat"
+, author =      "H. Samet and A. Rosenfeld and C. A. Shaffer and R. E. Webber"
+, title =       "Quadtree region representation in cartography: experimental results"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      13
+, number =      6
+, month =       "November/December"
+, year =        1983
+, pages =       "1148--1154"
+, update =      "96.05 efrat"
 }
 
 @techreport{ssw-dpcnu-85
-, author =	"H. Samet and C. Shaffer and R. E. Webber"
-, title =	"Digitizing the plane with cells of non-uniform size"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"Baltimore, MD"
-, year =	1985
+, author =      "H. Samet and C. Shaffer and R. E. Webber"
+, title =       "Digitizing the plane with cells of non-uniform size"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "Baltimore, MD"
+, year =        1985
 }
 
 @article{ss-manfp-85
-, author =	"H. Samet and C. A. Shaffer"
-, title =	"A model for the analysis of neighbor finding in pointer--based quadtrees"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	7
-, number =	6
-, month =	nov
-, year =	1985
-, pages =	"717--720"
-, update =	"96.05 efrat"
+, author =      "H. Samet and C. A. Shaffer"
+, title =       "A model for the analysis of neighbor finding in pointer--based quadtrees"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      7
+, number =      6
+, month =       nov
+, year =        1985
+, pages =       "717--720"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{ssnhfr-rdqbg-86
-, author =	"H. Samet and C. A. Shaffer and R. C. Nelson and Y. Huang and K. Fujimura and A. Rosenfeld"
-, title =	"Recent developments in quadtree-based geographic information systems"
-, booktitle =	"ssdh86"
-, site =	"Seattle, WA"
-, month =	jul
-, year =	1986
-, pages =	"15--32"
-, update =	"96.05 efrat"
+, author =      "H. Samet and C. A. Shaffer and R. C. Nelson and Y. Huang and K. Fujimura and A. Rosenfeld"
+, title =       "Recent developments in quadtree-based geographic information systems"
+, booktitle =   "ssdh86"
+, site =        "Seattle, WA"
+, month =       jul
+, year =        1986
+, pages =       "15--32"
+, update =      "96.05 efrat"
 }
 
 @article{ssnhfr-rdlqb-87
-, author =	"H. Samet and C. A. Shaffer and R. C. Nelson and Y. G. Huang and K. Fujimura and A. Rosenfeld"
-, title =	"Recent developments in linear quadtree--based geographic information systems"
-, journal =	"Image Vision Comput."
-, volume =	5
-, number =	3
-, month =	aug
-, year =	1987
-, pages =	"187--197"
-, update =	"96.05 efrat"
+, author =      "H. Samet and C. A. Shaffer and R. C. Nelson and Y. G. Huang and K. Fujimura and A. Rosenfeld"
+, title =       "Recent developments in linear quadtree--based geographic information systems"
+, journal =     "Image Vision Comput."
+, volume =      5
+, number =      3
+, month =       aug
+, year =        1987
+, pages =       "187--197"
+, update =      "96.05 efrat"
 }
 
 @incollection{ssw-sqlqb-86
-, author =	"H. Samet and C. A. Shaffer and R. E. Webber"
-, title =	"The segment quadtree: a linear quadtree--based representation for linear features"
-, editor =	"F. J. Peters and L. R. A. Kessener and M. L. P. van Lierop"
-, booktitle =	"Data Structures for Raster Graphics"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1986
-, pages =	"91--123"
-, update =	"96.09 agarwal, 96.05 efrat"
-, annote =	"also Proceedings of Computer Vision and
+, author =      "H. Samet and C. A. Shaffer and R. E. Webber"
+, title =       "The segment quadtree: a linear quadtree--based representation for linear features"
+, editor =      "F. J. Peters and L. R. A. Kessener and M. L. P. van Lierop"
+, booktitle =   "Data Structures for Raster Graphics"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1986
+, pages =       "91--123"
+, update =      "96.09 agarwal, 96.05 efrat"
+, annote =      "also Proceedings of Computer Vision and
                    Pattern Recognition 85, San Francisco, June 1985,
                    385--389"
 }
 
 @techreport{st-gaccl-86
-, author =	"H. Samet and M. Tamminen"
-, title =	"A general approach to connected component labeling of images"
-, type =	"Computer Science Department"
-, number =	"TR--1649"
-, institution =	"University of Maryland"
-, address =	"College Park, MD"
-, month =	aug
-, year =	1986
-, update =	"96.05 efrat"
-, annote =	"also Proceedings of Computer Vision and
+, author =      "H. Samet and M. Tamminen"
+, title =       "A general approach to connected component labeling of images"
+, type =        "Computer Science Department"
+, number =      "TR--1649"
+, institution = "University of Maryland"
+, address =     "College Park, MD"
+, month =       aug
+, year =        1986
+, update =      "96.05 efrat"
+, annote =      "also Proceedings of Computer Vision and
                    Pattern Recognition 86, Miami Beach, June 1986,
                    312--318"
 }
 
 @inproceedings{st-iaccl-86
-, author =	"H. Samet and M. Tamminen"
-, title =	"An Improved Approach to Connected Component Labeling of Images"
-, booktitle =	"Proceedings of the CVPR86 Conference"
-, site =	"Miami Beach"
-, month =	jun
-, year =	1986
-, pages =	"312--318"
-, update =	"96.05 efrat"
+, author =      "H. Samet and M. Tamminen"
+, title =       "An Improved Approach to Connected Component Labeling of Images"
+, booktitle =   "Proceedings of the CVPR86 Conference"
+, site =        "Miami Beach"
+, month =       jun
+, year =        1986
+, pages =       "312--318"
+, update =      "96.05 efrat"
 }
 
 @article{st-actmo-90
-, author =	"H. Samet and M. Tamminen"
-, title =	"Approximating {CSG} trees of moving objects"
-, journal =	"Visual Comput."
-, volume =	6
-, number =	4
-, month =	aug
-, year =	1990
-, pages =	"182--209"
-, note =	"(also University of Maryland Computer Science TR--1472)"
-, update =	"96.05 efrat"
+, author =      "H. Samet and M. Tamminen"
+, title =       "Approximating {CSG} trees of moving objects"
+, journal =     "Visual Comput."
+, volume =      6
+, number =      4
+, month =       aug
+, year =        1990
+, pages =       "182--209"
+, note =        "(also University of Maryland Computer Science TR--1472)"
+, update =      "96.05 efrat"
 }
 
 @article{st-bctt-85
-, author =	"H. Samet and M. Tamminen"
-, title =	"Bintrees, {CSG} trees, and time"
-, journal =	"Comput. Graph."
-, volume =	19
-, number =	3
-, month =	jul
-, year =	1985
-, pages =	"121--130"
-, note =	"Proc. SIGGRAPH '85"
-, update =	"96.09 devillers, 96.05 efrat"
+, author =      "H. Samet and M. Tamminen"
+, title =       "Bintrees, {CSG} trees, and time"
+, journal =     "Comput. Graph."
+, volume =      19
+, number =      3
+, month =       jul
+, year =        1985
+, pages =       "121--130"
+, note =        "Proc. SIGGRAPH '85"
+, update =      "96.09 devillers, 96.05 efrat"
 }
 
 @article{st-cgpir-85
-, author =	"H. Samet and M. Tamminen"
-, title =	"Computing geometric properties of images represented by linear quadtrees"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	7
-, number =	2
-, month =	mar
-, year =	1985
-, pages =	"229--24"
-, note =	"(also University of Maryland Computer
+, author =      "H. Samet and M. Tamminen"
+, title =       "Computing geometric properties of images represented by linear quadtrees"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      7
+, number =      2
+, month =       mar
+, year =        1985
+, pages =       "229--24"
+, note =        "(also University of Maryland Computer
                     Science TR--1359)"
-, update =	"96.05 efrat"
+, update =      "96.05 efrat"
 }
 
 @article{st-eclia-88
-, author =	"H. Samet and M. Tamminen"
-, title =	"Efficient component labeling of images of arbitrary dimension represented by linear bintrees"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	10
-, number =	4
-, month =	jul
-, year =	1988
-, pages =	"579--586"
-, update =	"96.05 efrat"
+, author =      "H. Samet and M. Tamminen"
+, title =       "Efficient component labeling of images of arbitrary dimension represented by linear bintrees"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      10
+, number =      4
+, month =       jul
+, year =        1988
+, pages =       "579--586"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{st-enica-84
-, author =	"H. Samet and M. Tamminen"
-, title =	"Experiences with new image component algorithms"
-, editor =	"K. Bo and H. A. Tucker"
-, booktitle =	"Proceedings of the EUROGRAPHICS'84 Conference"
-, publisher =	"North-Holland"
-, address =	"Amsterdam"
-, year =	1984
-, pages =	"239--249"
-, update =	"96.05 efrat"
+, author =      "H. Samet and M. Tamminen"
+, title =       "Experiences with new image component algorithms"
+, editor =      "K. Bo and H. A. Tucker"
+, booktitle =   "Proceedings of the EUROGRAPHICS'84 Conference"
+, publisher =   "North-Holland"
+, address =     "Amsterdam"
+, year =        1984
+, pages =       "239--249"
+, update =      "96.05 efrat"
 }
 
 @article{sw-csrmd-89
-, author =	"Hanan Samet and Robert E. Webber"
-, title =	"A comparison of the space requirements of multi-dimensional quadtree-based file structures"
-, journal =	"Visual Comput."
-, volume =	5
-, number =	6
-, month =	dec
-, year =	1989
-, pages =	"349--359"
-, keywords =	"image databases, quadtrees, octrees, image compression"
+, author =      "Hanan Samet and Robert E. Webber"
+, title =       "A comparison of the space requirements of multi-dimensional quadtree-based file structures"
+, journal =     "Visual Comput."
+, volume =      5
+, number =      6
+, month =       dec
+, year =        1989
+, pages =       "349--359"
+, keywords =    "image databases, quadtrees, octrees, image compression"
 }
 
 @article{sw-dssbb-91
-, author =	"H. Samet and R. E. Webber"
-, title =	"Data structures to support {B{\'e}zier}-based modeling"
-, journal =	"Comput. Aided Design"
-, volume =	23
-, number =	3
-, month =	apr
-, year =	1991
-, pages =	"162--176"
-, update =	"96.05 efrat"
+, author =      "H. Samet and R. E. Webber"
+, title =       "Data structures to support {B{\'e}zier}-based modeling"
+, journal =     "Comput. Aided Design"
+, volume =      23
+, number =      3
+, month =       apr
+, year =        1991
+, pages =       "162--176"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{sw-hds-86
-, author =	"H. Samet and R. E. Webber"
-, title =	"Hierarchical Data Structure"
-, booktitle =	"Proceedings of the Second International Electronic Image Week"
-, site =	"Nice, France"
-, month =	apr
-, year =	1986
-, pages =	"577--584"
-, update =	"96.05 efrat"
+, author =      "H. Samet and R. E. Webber"
+, title =       "Hierarchical Data Structure"
+, booktitle =   "Proceedings of the Second International Electronic Image Week"
+, site =        "Nice, France"
+, month =       apr
+, year =        1986
+, pages =       "577--584"
+, update =      "96.05 efrat"
 }
 
 @article{sw-hdsac1-88
-, author =	"H. Samet and R. E. Webber"
-, title =	"Hierarchical data structures and algorithms for computer graphics, Part {I}: fundamentals"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	8
-, number =	5
-, month =	may
-, year =	1988
-, pages =	"48--68"
-, precedes =	"sw-hdsac2-88"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "H. Samet and R. E. Webber"
+, title =       "Hierarchical data structures and algorithms for computer graphics, Part {I}: fundamentals"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      8
+, number =      5
+, month =       may
+, year =        1988
+, pages =       "48--68"
+, precedes =    "sw-hdsac2-88"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{sw-hdsac2-88
-, author =	"H. Samet and R. E. Webber"
-, title =	"Hierarchical data structures and algorithms for computer graphics, Part {II}: applications"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	8
-, number =	4
-, month =	jul
-, year =	1988
-, pages =	"59--75"
-, keywords =	"computer graphics --- Imaging Techniques; computer programming --- Algorithms; CSG; data processing; Data Structures; hidden-surface algorithms; octree; parallel and perspective projection methods; quadtree; ray tracing; surfaces --- Computer Simulation"
-, succeeds =	"sw-hdsac1-88"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "H. Samet and R. E. Webber"
+, title =       "Hierarchical data structures and algorithms for computer graphics, Part {II}: applications"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      8
+, number =      4
+, month =       jul
+, year =        1988
+, pages =       "59--75"
+, keywords =    "computer graphics --- Imaging Techniques; computer programming --- Algorithms; CSG; data processing; Data Structures; hidden-surface algorithms; octree; parallel and perspective projection methods; quadtree; ray tracing; surfaces --- Computer Simulation"
+, succeeds =    "sw-hdsac1-88"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @techreport{sw-ebq-82
-, author =	"H. Samet and R. E. Webber"
-, title =	"On encoding boundaries with quadtrees"
-, type =	"Computer Science"
-, number =	"TR--1162"
-, institution =	"University of Maryland"
-, address =	"College Park, MD"
-, month =	feb
-, year =	1982
-, update =	"96.05 efrat"
+, author =      "H. Samet and R. E. Webber"
+, title =       "On encoding boundaries with quadtrees"
+, type =        "Computer Science"
+, number =      "TR--1162"
+, institution = "University of Maryland"
+, address =     "College Park, MD"
+, month =       feb
+, year =        1982
+, update =      "96.05 efrat"
 }
 
 @article{sw-ebq-84
-, author =	"H. Samet and R. E. Webber"
-, title =	"On encoding boundaries with quadtrees"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	6
-, number =	3
-, month =	may
-, year =	1984
-, pages =	"365--369"
-, update =	"97.11 bibrelex, 96.05 efrat"
-, abstract =	"efficient algorithms for boundary and superimposing
-		 two maps encoded as line quadtrees"
+, author =      "H. Samet and R. E. Webber"
+, title =       "On encoding boundaries with quadtrees"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      6
+, number =      3
+, month =       may
+, year =        1984
+, pages =       "365--369"
+, update =      "97.11 bibrelex, 96.05 efrat"
+, abstract =    "efficient algorithms for boundary and superimposing
+                 two maps encoded as line quadtrees"
 }
 
 @article{sw-scpuq-85
-, author =	"H. Samet and R. E. Webber"
-, title =	"Storing a Collection of Polygons Using Quadtrees"
-, journal =	"ACM Trans. Graph."
-, volume =	4
-, number =	3
-, month =	jul
-, year =	1985
-, pages =	"182--222"
-, update =	"93.09 held"
+, author =      "H. Samet and R. E. Webber"
+, title =       "Storing a Collection of Polygons Using Quadtrees"
+, journal =     "ACM Trans. Graph."
+, volume =      4
+, number =      3
+, month =       jul
+, year =        1985
+, pages =       "182--222"
+, update =      "93.09 held"
 }
 
 @inproceedings{sw-vr-91
-, author =	"H. Samet and R. E. Webber"
-, title =	"Volume Representation"
-, editor =	"A. Kaufman"
-, booktitle =	"Volume Visualization"
-, publisher =	"IEEE Computer Society Press"
-, address =	"Washington, DC"
-, year =	1991
-, pages =	"19--22"
-, update =	"96.05 efrat"
+, author =      "H. Samet and R. E. Webber"
+, title =       "Volume Representation"
+, editor =      "A. Kaufman"
+, booktitle =   "Volume Visualization"
+, publisher =   "IEEE Computer Society Press"
+, address =     "Washington, DC"
+, year =        1991
+, pages =       "19--22"
+, update =      "96.05 efrat"
 }
 
 @book{s-pg-88
-, author =	"Pierre Samuel"
-, title =	"Projective Geometry"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1988
-, update =	"00.11 smid, 00.07 icking, 99.07 orourke"
+, author =      "Pierre Samuel"
+, title =       "Projective Geometry"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1988
+, update =      "00.11 smid, 00.07 icking, 99.07 orourke"
 }
 
 @inproceedings{sk-ccmpc-92
-, author =	"N. K. Sancheti and S. S. Keerthi"
-, title =	"Computation of Certain Measures of Proximity between Convex Polytopes : A Complexity Viewpoint"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Nice, France"
-, year =	1992
-, pages =	"2508--2513"
-, update =	"98.11 bibrelex"
+, author =      "N. K. Sancheti and S. S. Keerthi"
+, title =       "Computation of Certain Measures of Proximity between Convex Polytopes : A Complexity Viewpoint"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Nice, France"
+, year =        1992
+, pages =       "2508--2513"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{s-fhhml-96
-, author =	"G. Sander"
-, title =	"A Fast Heuristic for Hierarchical {Manhattan} Layout"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"447--458"
-, keywords =	"graph drawing, system"
-, update =	"98.11 bibrelex, 98.07 tamassia+vismara, 96.09 tamassia"
+, author =      "G. Sander"
+, title =       "A Fast Heuristic for Hierarchical {Manhattan} Layout"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "447--458"
+, keywords =    "graph drawing, system"
+, update =      "98.11 bibrelex, 98.07 tamassia+vismara, 96.09 tamassia"
 }
 
 @techreport{s-gdtrw-96
-, author =	"G. Sander"
-, title =	"Graph Drawing Tools and Related Work"
-, type =	"manuscript"
-, institution =	"Universit{\"a}t des Saarlandes, Saarbr{\"u}ken, Germany"
-, year =	1996
-, url =	"http://www.cs.uni-sb.de/RW/users/sander/html/gstools.html"
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia"
+, author =      "G. Sander"
+, title =       "Graph Drawing Tools and Related Work"
+, type =        "manuscript"
+, institution = "Universit{\"a}t des Saarlandes, Saarbr{\"u}ken, Germany"
+, year =        1996
+, url = "http://www.cs.uni-sb.de/RW/users/sander/html/gstools.html"
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{s-gltvt-95
-, author =	"G. Sander"
-, title =	"Graph Layout through the {VCG} Tool"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"194--205"
-, keywords =	"graph drawing, system, layered"
-, update =	"95.01 tamassia"
+, author =      "G. Sander"
+, title =       "Graph Layout through the {VCG} Tool"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "194--205"
+, keywords =    "graph drawing, system, layered"
+, update =      "95.01 tamassia"
 }
 
 @mastersthesis{s-drpga-90
-, author =	"L. Sander"
-, title =	"The design of robust primitives for geometric algorithms: with applications to line segment intersection and planar convex hull algorithms"
-, school =	"Dept. Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1990
-, keywords =	"master thesis"
-, update =	"99.11 bibrelex, 98.07 bibrelex"
+, author =      "L. Sander"
+, title =       "The design of robust primitives for geometric algorithms: with applications to line segment intersection and planar convex hull algorithms"
+, school =      "Dept. Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1990
+, keywords =    "master thesis"
+, update =      "99.11 bibrelex, 98.07 bibrelex"
 }
 
 @incollection{s-mv-93
-, author =	"J. R. Sangwine-Yager"
-, title =	"Mixed volumes"
-, booktitle =	"Handbook of Convex Geometry"
-, volume =	"A"
-, publisher =	"North-Holland"
-, year =	1993
-, pages =	"43--71"
-, update =	"99.11 bibrelex, 97.11 bibrelex, 95.09 wenger, 95.01 matousek"
+, author =      "J. R. Sangwine-Yager"
+, title =       "Mixed volumes"
+, booktitle =   "Handbook of Convex Geometry"
+, volume =      "A"
+, publisher =   "North-Holland"
+, year =        1993
+, pages =       "43--71"
+, update =      "99.11 bibrelex, 97.11 bibrelex, 95.09 wenger, 95.01 matousek"
 }
 
 @article{sr-lvsta-75
-, author =	"D. Sankoff and P. Rousseau"
-, title =	"Locating the vertices of a {Steiner} tree in an arbitrary metric space"
-, journal =	"Math. Program."
-, volume =	9
-, year =	1975
-, pages =	"240--246"
-, update =	"97.11 bibrelex"
+, author =      "D. Sankoff and P. Rousseau"
+, title =       "Locating the vertices of a {Steiner} tree in an arbitrary metric space"
+, journal =     "Math. Program."
+, volume =      9
+, year =        1975
+, pages =       "240--246"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{s--92
-, author =	"M. F. Sanner"
-, title =	"??"
-, school =	"UHA"
-, address =	"France"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "M. F. Sanner"
+, title =       "??"
+, school =      "UHA"
+, address =     "France"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{sos-frcms-95
-, author =	"Michel F. Sanner and Arthur J. Olson and Jean-Claude Spehner"
-, title =	"Fast and Robust Computation of Molecular Surfaces"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C6--C7"
-, keywords =	"molecules, biology, visualization"
-, cites =	"lr-ipses-71, r-avpps-77, c-amsc-83, b--94, p--92, ea--93, c--93, s--90, v-hga-94, c--85, s--92, ho-smhsr-94, em-tdas-94, bh-hofca-86, do--93, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Michel F. Sanner and Arthur J. Olson and Jean-Claude Spehner"
+, title =       "Fast and Robust Computation of Molecular Surfaces"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C6--C7"
+, keywords =    "molecules, biology, visualization"
+, cites =       "lr-ipses-71, r-avpps-77, c-amsc-83, b--94, p--92, ea--93, c--93, s--90, v-hga-94, c--85, s--92, ho-smhsr-94, em-tdas-94, bh-hofca-86, do--93, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{s-vanpt-96
-, author =	"C. Sansoni"
-, title =	"Visual Analysis: {A} New Probabilistic Technique to Obtain Landscape Visibility"
-, journal =	"Comput. Aided Design"
-, volume =	28
-, number =	4
-, month =	apr
-, year =	1996
-, pages =	"289--299"
-, update =	"98.03 mitchell, 97.03 held"
+, author =      "C. Sansoni"
+, title =       "Visual Analysis: {A} New Probabilistic Technique to Obtain Landscape Visibility"
+, journal =     "Comput. Aided Design"
+, volume =      28
+, number =      4
+, month =       apr
+, year =        1996
+, pages =       "289--299"
+, update =      "98.03 mitchell, 97.03 held"
 }
 
 @book{s-ipgp-79
-, author =	"L. Santal{\'o}"
-, title =	"Integral Probability and Geometric Probability"
-, series =	"Encyclopedia of Mathematics and its Applications"
-, volume =	1
-, publisher =	"Addison-Wesley"
-, year =	1979
-, update =	"98.07 bibrelex"
+, author =      "L. Santal{\'o}"
+, title =       "Integral Probability and Geometric Probability"
+, series =      "Encyclopedia of Mathematics and its Applications"
+, volume =      1
+, publisher =   "Addison-Wesley"
+, year =        1979
+, update =      "98.07 bibrelex"
 }
 
 @article{s-tsppe-40
-, author =	"L. A. Santal{\'o}"
-, title =	"A theorem on sets of parallelepipeds with parallel edges"
-, journal =	"Publ. Inst. Mat. Univ. Nac. Litoral"
-, volume =	2
-, year =	1940
-, pages =	"49--60"
-, update =	"98.03 bibrelex"
+, author =      "L. A. Santal{\'o}"
+, title =       "A theorem on sets of parallelepipeds with parallel edges"
+, journal =     "Publ. Inst. Mat. Univ. Nac. Litoral"
+, volume =      2
+, year =        1940
+, pages =       "49--60"
+, update =      "98.03 bibrelex"
 }
 
 @inbook{s-ig4km-36
-, author =	"L. A. Santal{\'o}"
-, title =	"Integral geometry 4: on the kinematic measure in the plane"
-, series =	"Abh. Math. Senn."
-, volume =	11
-, publisher =	"Hamburg Univ."
-, year =	1936
-, pages =	"222--236"
-, update =	"98.07 bibrelex"
+, author =      "L. A. Santal{\'o}"
+, title =       "Integral geometry 4: on the kinematic measure in the plane"
+, series =      "Abh. Math. Senn."
+, volume =      11
+, publisher =   "Hamburg Univ."
+, year =        1936
+, pages =       "222--236"
+, update =      "98.07 bibrelex"
 }
 
 @book{s-ig5km-36
-, author =	"L. A. Santal{\'o}"
-, title =	"Integral geometry 5: on the kinematic measure in space"
-, series =	"Actualit{\'e}s scientifiques et industrielles"
-, volume =	357
-, publisher =	"Hermann"
-, address =	"Paris, France"
-, year =	1936
+, author =      "L. A. Santal{\'o}"
+, title =       "Integral geometry 5: on the kinematic measure in space"
+, series =      "Actualit{\'e}s scientifiques et industrielles"
+, volume =      357
+, publisher =   "Hermann"
+, address =     "Paris, France"
+, year =        1936
 }
 
 @book{s-iggp-76
-, author =	"L. A. Santal{\'o}"
-, title =	"Integral Geometry and Geometric Probability"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1976
+, author =      "L. A. Santal{\'o}"
+, title =       "Integral Geometry and Geometric Probability"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1976
 }
 
 @book{s-iig-53
-, author =	"L. A. Santal{\'o}"
-, title =	"Introduction to integral geometry"
-, series =	"Actualit{\'e}s scientifiques et industrielles"
-, volume =	1198
-, publisher =	"Hermann"
-, address =	"Paris, France"
-, year =	1953
+, author =      "L. A. Santal{\'o}"
+, title =       "Introduction to integral geometry"
+, series =      "Actualit{\'e}s scientifiques et industrielles"
+, volume =      1198
+, publisher =   "Hermann"
+, address =     "Paris, France"
+, year =        1953
 }
 
 @article{sssu-gcpo-89
-, author =	"N. Santoro and J. B. Sidney and S. J. Sidney and J. Urrutia"
-, title =	"Geometric containment and partial orders"
-, journal =	"SIAM J. Discrete Math."
-, volume =	2
-, number =	2
-, year =	1989
-, pages =	"245--254"
-, update =	"94.05 franciosa"
+, author =      "N. Santoro and J. B. Sidney and S. J. Sidney and J. Urrutia"
+, title =       "Geometric containment and partial orders"
+, journal =     "SIAM J. Discrete Math."
+, volume =      2
+, number =      2
+, year =        1989
+, pages =       "245--254"
+, update =      "94.05 franciosa"
 }
 
 @article{sssu-gcvd-87
-, author =	"N. Santoro and J. B. Sidney and S. J. Sidney and J. Urrutia"
-, title =	"Geometric containment and vector dominance"
-, journal =	"Theoret. Comput. Sci."
-, volume =	53
-, year =	1987
-, pages =	"345--352"
-, succeeds =	"sssu-gcinr-84"
+, author =      "N. Santoro and J. B. Sidney and S. J. Sidney and J. Urrutia"
+, title =       "Geometric containment and vector dominance"
+, journal =     "Theoret. Comput. Sci."
+, volume =      53
+, year =        1987
+, pages =       "345--352"
+, succeeds =    "sssu-gcinr-84"
 }
 
 @techreport{sssu-gcinr-84
-, author =	"N. Santoro and J. B. Sidney and S. J. Sidney and J. Urrutia"
-, title =	"Geometric containment is not reducible to pareto dominance"
-, type =	"Report"
-, number =	"SCS-TR-37"
-, institution =	"School Comput. Sci., Carleton Univ."
-, address =	"Ottawa, ON"
-, year =	1984
-, precedes =	"sssu-gcvd-87"
+, author =      "N. Santoro and J. B. Sidney and S. J. Sidney and J. Urrutia"
+, title =       "Geometric containment is not reducible to pareto dominance"
+, type =        "Report"
+, number =      "SCS-TR-37"
+, institution = "School Comput. Sci., Carleton Univ."
+, address =     "Ottawa, ON"
+, year =        1984
+, precedes =    "sssu-gcvd-87"
 }
 
 @article{s-pcstd-00
-, author =	"Francisco Santos"
-, title =	"A point configuration whose space of triangulations is disconnected"
-, journal =	"J. Amer. Math. Soc."
-, volume =	13
-, number =	3
-, year =	2000
-, pages =	"611--637"
-, comments =	"Example in $R^6$ is not in general position"
-, update =	"02.03 orourke"
+, author =      "Francisco Santos"
+, title =       "A point configuration whose space of triangulations is disconnected"
+, journal =     "J. Amer. Math. Soc."
+, volume =      13
+, number =      3
+, year =        2000
+, pages =       "611--637"
+, comments =    "Example in $R^6$ is not in general position"
+, update =      "02.03 orourke"
 }
 
 @inproceedings{s-acttp-01
-, author =	"Francisco Santos"
-, title =	"Applications of the {Cayley} Trick to Triangulations of Polytopes"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"150--153"
-, update =	"01.04 icking"
+, author =      "Francisco Santos"
+, title =       "Applications of the {Cayley} Trick to Triangulations of Polytopes"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "150--153"
+, update =      "01.04 icking"
 }
 
 @inproceedings{s-bftpc-98
-, author =	"Francisco Santos"
-, title =	"Bistellar Flips in Triangulations of Point Configurations"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"131--133"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Francisco Santos"
+, title =       "Bistellar Flips in Triangulations of Point Configurations"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "131--133"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{s-ctges-95
-, author =	"F. Santos"
-, title =	"Codifying the Topology of Graph Embeddings on a Surface"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"57--59"
-, update =	"00.03 bibrelex"
+, author =      "F. Santos"
+, title =       "Codifying the Topology of Graph Embeddings on a Surface"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "57--59"
+, update =      "00.03 bibrelex"
 }
 
 @unpublished{s-nromd-
-, author =	"F. Santos"
-, title =	"Non-realizable oriented matroids coming from {Delaunay} triangulations for strictly convex matrics"
-, note =	"in preparation"
-, update =	"98.11 bibrelex"
+, author =      "F. Santos"
+, title =       "Non-realizable oriented matroids coming from {Delaunay} triangulations for strictly convex matrics"
+, note =        "in preparation"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{s-dom-94
-, author =	"F. Santos"
-, title =	"On {Delaunay} Oriented Matroids"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"195--200"
-, keywords =	"convex distance"
-, cites =	"bv-om-78, b-vdch-79, cd-vdbcd-85, cmrs-tspvd-93, iklm-cdf3s-93, k-cavd-89, m-dmpcg-90, m-ddvec-92, s-nromd-, sh-cpp-75, blwsz-om-93, cl-hcdc-88, ZZZ"
-, update =	"00.03 bibrelex, 98.11 bibrelex, 94.09 jones"
+, author =      "F. Santos"
+, title =       "On {Delaunay} Oriented Matroids"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "195--200"
+, keywords =    "convex distance"
+, cites =       "bv-om-78, b-vdch-79, cd-vdbcd-85, cmrs-tspvd-93, iklm-cdf3s-93, k-cavd-89, m-dmpcg-90, m-ddvec-92, s-nromd-, sh-cpp-75, blwsz-om-93, cl-hcdc-88, ZZZ"
+, update =      "00.03 bibrelex, 98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{s-domcd-94
-, author =	"Francisco Santos"
-, title =	"On {Delaunay} Oriented Matroids for Convex Distance Functions"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"20--24"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Francisco Santos"
+, title =       "On {Delaunay} Oriented Matroids for Convex Distance Functions"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "20--24"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @article{s-tvfgb-00
-, author =	"Francisco Santos"
-, title =	"Triangulations with very few geometric bistellar neighbors"
-, journal =	"Discrete Comput. Geom."
-, volume =	23
-, number =	1
-, year =	2000
-, pages =	"15--33"
-, update =	"02.03 orourke"
+, author =      "Francisco Santos"
+, title =       "Triangulations with very few geometric bistellar neighbors"
+, journal =     "Discrete Comput. Geom."
+, volume =      23
+, number =      1
+, year =        2000
+, pages =       "15--33"
+, update =      "02.03 orourke"
 }
 
 @article{snb-vods3-99
-, author =	"C. Saona-V{\'a}zquez and I. Navazo and P. Brunet"
-, title =	"The Visibility Octree: A Data structure for 3D Navigation"
-, journal =	"Comput. \& Graphics"
-, volume =	23
-, number =	5
-, month =	oct
-, year =	1999
-, pages =	"635--643"
-, update =	"00.03 held"
+, author =      "C. Saona-V{\'a}zquez and I. Navazo and P. Brunet"
+, title =       "The Visibility Octree: A Data structure for 3D Navigation"
+, journal =     "Comput. \& Graphics"
+, volume =      23
+, number =      5
+, month =       oct
+, year =        1999
+, pages =       "635--643"
+, update =      "00.03 held"
 }
 
 @article{sp-dtasp-91
-, author =	"Nickolas Sapidis and Renato Perucchio"
-, title =	"Delaunay Triangulation Of Arbitrarily Shaped Planar Domains"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	8
-, number =	6
-, month =	dec
-, year =	1991
-, pages =	"421--437"
-, keywords =	"Delaunay triangulation, planar domains, computer aided geometric design, computational geometry"
-, abstract =	"An algorithm is presented for constructing a Domain
-		 Delaunay triangulation (DDT) of an arbitrarily shaped,
-		 multiply-connected (manifold or nonmanifold), planar
-		 domain. DDT preserves the boundary of the given region
-		 and has properties identical to those of the standard
-		 Delaunay triangulation. Construction of this
-		 triangulation involves operations (node refinement,
-		 triangulation extraction) that are based solely on
-		 properties of the standard Delaunay diagram. Examples
-		 are included that demonstrate the validity of the
-		 algorithm. (Author abstract) 22 Refs."
+, author =      "Nickolas Sapidis and Renato Perucchio"
+, title =       "Delaunay Triangulation Of Arbitrarily Shaped Planar Domains"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      8
+, number =      6
+, month =       dec
+, year =        1991
+, pages =       "421--437"
+, keywords =    "Delaunay triangulation, planar domains, computer aided geometric design, computational geometry"
+, abstract =    "An algorithm is presented for constructing a Domain
+                 Delaunay triangulation (DDT) of an arbitrarily shaped,
+                 multiply-connected (manifold or nonmanifold), planar
+                 domain. DDT preserves the boundary of the given region
+                 and has properties identical to those of the standard
+                 Delaunay triangulation. Construction of this
+                 triangulation involves operations (node refinement,
+                 triangulation extraction) that are based solely on
+                 properties of the standard Delaunay diagram. Examples
+                 are included that demonstrate the validity of the
+                 algorithm. (Author abstract) 22 Refs."
 }
 
 @phdthesis{s-dtcpd-92
-, author =	"N. S. Sapidis"
-, title =	"Domain Tetrahedrization of Curved Polyhedra Defined in a Solid Modeling System"
-, school =	"Dept. of Mech. Engg., University of Rochester, Rochester, NY 14627, USA"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"95.01 held"
+, author =      "N. S. Sapidis"
+, title =       "Domain Tetrahedrization of Curved Polyhedra Defined in a Solid Modeling System"
+, school =      "Dept. of Mech. Engg., University of Rochester, Rochester, NY 14627, USA"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "95.01 held"
 }
 
 @article{sp-ddtsm-91
-, author =	"N. S. Sapidis and R. Perucchio"
-, title =	"Domain {Delaunay} tetrahedrization of solid models"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	3
-, year =	1991
-, pages =	"299--325"
-, keywords =	"tetrahedrization, Delaunay triangulation, solid modeling, topological validity"
+, author =      "N. S. Sapidis and R. Perucchio"
+, title =       "Domain {Delaunay} tetrahedrization of solid models"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      3
+, year =        1991
+, pages =       "299--325"
+, keywords =    "tetrahedrization, Delaunay triangulation, solid modeling, topological validity"
 }
 
 @article{sp-sscor-92
-, author =	"N. S. Sapidis and R. Perucchio"
-, title =	"Solid/Solid Classification Operations for Recursive Spatial Decomposition and Domain Triangulation of Solid Models"
-, journal =	"Comput. Aided Design"
-, volume =	24
-, number =	10
-, month =	oct
-, year =	1992
-, pages =	"517--529"
-, update =	"96.09 devillers, 95.01 held"
+, author =      "N. S. Sapidis and R. Perucchio"
+, title =       "Solid/Solid Classification Operations for Recursive Spatial Decomposition and Domain Triangulation of Solid Models"
+, journal =     "Comput. Aided Design"
+, volume =      24
+, number =      10
+, month =       oct
+, year =        1992
+, pages =       "517--529"
+, update =      "96.09 devillers, 95.01 held"
 }
 
 @techreport{skskb-icsmc-93
-, author =	"G. Sapiro and R. Kimmel and D. Shaked and B. B. Kimia and A. M. Bruckstein"
-, title =	"Implementing continuous-scale morphology via curve evolution"
-, number =	"CIS 9302"
-, institution =	"Technion IIT"
-, address =	"Haifa, Israel"
-, month =	jan
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "G. Sapiro and R. Kimmel and D. Shaked and B. B. Kimia and A. M. Bruckstein"
+, title =       "Implementing continuous-scale morphology via curve evolution"
+, number =      "CIS 9302"
+, institution = "Technion IIT"
+, address =     "Haifa, Israel"
+, month =       jan
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{sk-arngv-92
-, author =	"V. Sarin and S. Kapoor"
-, title =	"Algorithms for relative neighbourhood graphs and {Voronoi} diagrams in simple polygons"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"292--298"
-, cites =	"c-cdt-87, et-crnds-88, ghlst-ltavs-86, km-eaesp-88, ps-cgi-85, s-rngam-83, t-rngfp-80, ws-oacdt-87, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "V. Sarin and S. Kapoor"
+, title =       "Algorithms for relative neighbourhood graphs and {Voronoi} diagrams in simple polygons"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "292--298"
+, cites =       "c-cdt-87, et-crnds-88, ghlst-ltavs-86, km-eaesp-88, ps-cgi-85, s-rngam-83, t-rngfp-80, ws-oacdt-87, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{sb-gfv-94
-, author =	"M. Sarkar and M. H. Brown"
-, title =	"Graphical Fisheye Views"
-, journal =	"Commun. ACM"
-, volume =	37
-, number =	12
-, year =	1994
-, pages =	"73--84"
-, keywords =	"graph drawing, fisheye view, system"
-, update =	"95.05 tamassia"
+, author =      "M. Sarkar and M. H. Brown"
+, title =       "Graphical Fisheye Views"
+, journal =     "Commun. ACM"
+, volume =      37
+, number =      12
+, year =        1994
+, pages =       "73--84"
+, keywords =    "graph drawing, fisheye view, system"
+, update =      "95.05 tamassia"
 }
 
 @techreport{sb-gfvg-91
-, author =	"M. Sarkar and Marc H. Brown"
-, title =	"Graphical Fisheye Views of Graphs"
-, number =	"CS-91-61"
-, institution =	"Department of Computer Science, Brown University"
-, year =	1991
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "M. Sarkar and Marc H. Brown"
+, title =       "Graphical Fisheye Views of Graphs"
+, number =      "CS-91-61"
+, institution = "Department of Computer Science, Brown University"
+, year =        1991
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{sstr-srsmv-93
-, author =	"Manojit Sarkar and Scott S. Snibbe and Oren J. Tversky and Steven P. Reiss"
-, title =	"Stretching the rubber sheet: a metaphor for viewing large layouts on small screens"
-, journal =	"Proc. ACM UIST"
-, volume =	"??"
-, month =	nov
-, year =	1993
-, pages =	"81--91"
-, update =	"97.03 tamassia"
+, author =      "Manojit Sarkar and Scott S. Snibbe and Oren J. Tversky and Steven P. Reiss"
+, title =       "Stretching the rubber sheet: a metaphor for viewing large layouts on small screens"
+, journal =     "Proc. ACM UIST"
+, volume =      "??"
+, month =       nov
+, year =        1993
+, pages =       "81--91"
+, update =      "97.03 tamassia"
 }
 
 @article{s-gvkft-91
-, author =	"K. Sarkaria"
-, title =	"A generalized {van Kampen}-{Flores} theorem"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	11
-, year =	1991
-, pages =	"559--565"
-, update =	"95.01 matousek"
+, author =      "K. Sarkaria"
+, title =       "A generalized {van Kampen}-{Flores} theorem"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      11
+, year =        1991
+, pages =       "559--565"
+, update =      "95.01 matousek"
 }
 
 @techreport{s-sesc-92
-, author =	"K. Sarkaria"
-, title =	"Shifting and embeddability of simplicial complexes"
-, number =	"91/51"
-, institution =	"Max-Planck Institut f{\"u}r Mathematik, Bonn"
-, year =	1992
-, comments =	"Proves that a simplicial comples on $n$ vertices
+, author =      "K. Sarkaria"
+, title =       "Shifting and embeddability of simplicial complexes"
+, number =      "91/51"
+, institution = "Max-Planck Institut f{\"u}r Mathematik, Bonn"
+, year =        1992
+, comments =    "Proves that a simplicial comples on $n$ vertices
 topologically embeddable in $d$-space has $O(n^{\lceil{d/2}\rceil})$
 simplices. Vast generalization of Upper Bound Theorem etc."
-, update =	"95.01 matousek"
+, update =      "95.01 matousek"
 }
 
 @article{s-cfazz-99
-, author =	"S. E. Sarma"
-, title =	"The crossing function and its application to zig-zag tool paths"
-, journal =	"Comput. Aided Design"
-, volume =	31
-, year =	1999
-, pages =	"881--890"
-, update =	"00.03 smid"
+, author =      "S. E. Sarma"
+, title =       "The crossing function and its application to zig-zag tool paths"
+, journal =     "Comput. Aided Design"
+, volume =      31
+, year =        1999
+, pages =       "881--890"
+, update =      "00.03 smid"
 }
 
 @article{st-pplup-86
-, author =	"N. Sarnak and R. E. Tarjan"
-, title =	"Planar point location using persistent search trees"
-, journal =	"Commun. ACM"
-, volume =	29
-, number =	7
-, month =	jul
-, year =	1986
-, pages =	"669--679"
-, update =	"98.11 bibrelex"
+, author =      "N. Sarnak and R. E. Tarjan"
+, title =       "Planar point location using persistent search trees"
+, journal =     "Commun. ACM"
+, volume =      29
+, number =      7
+, month =       jul
+, year =        1986
+, pages =       "669--679"
+, update =      "98.11 bibrelex"
 }
 
 @article{sl-rtaa-94
-, author =	"M. Sarrafzadeh and D. T. Lee"
-, title =	"Restricted track assignment with applications"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"53--68"
-, keywords =	"track assignment, circular arc model, NP-hardness, approximation algorithm"
-, update =	"96.09 devillers"
+, author =      "M. Sarrafzadeh and D. T. Lee"
+, title =       "Restricted track assignment with applications"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "53--68"
+, keywords =    "track assignment, circular arc model, NP-hardness, approximation algorithm"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{swww-wkklg-92
-, author =	"M. Sarrafzadeh and D. Wagner and F. Wagner and K. Weihe"
-, title =	"Wiring Knock-Knee Layouts: A Global Approach"
-, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '92"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	650
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"388--399"
-, update =	"94.09 smid, 93.09 milone+mitchell"
+, author =      "M. Sarrafzadeh and D. Wagner and F. Wagner and K. Weihe"
+, title =       "Wiring Knock-Knee Layouts: A Global Approach"
+, booktitle =   "Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '92"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      650
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "388--399"
+, update =      "94.09 smid, 93.09 milone+mitchell"
 }
 
 @article{swww-wkklg-94
-, author =	"M. Sarrafzadeh and D. Wagner and F. Wagner and K. Weihe"
-, title =	"Wiring Knock-Knee Layouts: A Global Approach"
-, journal =	"IEEE Trans. Comput."
-, volume =	43
-, year =	1994
-, pages =	"581--589"
-, update =	"97.03 gaertner+salinger"
+, author =      "M. Sarrafzadeh and D. Wagner and F. Wagner and K. Weihe"
+, title =       "Wiring Knock-Knee Layouts: A Global Approach"
+, journal =     "IEEE Trans. Comput."
+, volume =      43
+, year =        1994
+, pages =       "581--589"
+, update =      "97.03 gaertner+salinger"
 }
 
 @unpublished{sw-hstcu-
-, author =	"M. Sarrafzadeh and C. K. Wong"
-, title =	"Hierarchical {Steiner} tree construction in uniform orientations"
-, note =	"Unpublished manuscript"
-, update =	"98.03 bibrelex"
+, author =      "M. Sarrafzadeh and C. K. Wong"
+, title =       "Hierarchical {Steiner} tree construction in uniform orientations"
+, note =        "Unpublished manuscript"
+, update =      "98.03 bibrelex"
 }
 
 @article{s-igubc-87
-, author =	"R. Sarraga"
-, title =	"$G^1$ Interpolation of generally unrestrictedcubic bezier curves"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	"??"
-, number =	4
-, year =	1987
-, pages =	"23--39"
-, update =	"98.03 bibrelex"
+, author =      "R. Sarraga"
+, title =       "$G^1$ Interpolation of generally unrestrictedcubic bezier curves"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      "??"
+, number =      4
+, year =        1987
+, pages =       "23--39"
+, update =      "98.03 bibrelex"
 }
 
 @article{s-dfs-72
-, author =	"N. Sauer"
-, title =	"On the density of families of sets"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	13
-, year =	1972
-, pages =	"145--147"
-, update =	"94.05 matousek"
+, author =      "N. Sauer"
+, title =       "On the density of families of sets"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      13
+, year =        1972
+, pages =       "145--147"
+, update =      "94.05 matousek"
 }
 
 @article{s-rdclt-93
-, author =	"P. Sauer"
-, title =	"On the Recognition of Digital Circles in Linear Time"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	5
-, month =	mar
-, year =	1993
-, pages =	"287--302"
-, update =	"93.09 held"
+, author =      "P. Sauer"
+, title =       "On the Recognition of Digital Circles in Linear Time"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      5
+, month =       mar
+, year =        1993
+, pages =       "287--302"
+, update =      "93.09 held"
 }
 
 @inproceedings{s-hlge-83
-, author =	"J. E. Savage"
-, title =	"Heuristics for Level Graph Embeddings"
-, booktitle =	"Proc. Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, publisher =	"Trauner Verlag"
-, address =	"Linz, Austria"
-, year =	1983
-, pages =	"307--318"
-, keywords =	"graph drawing"
-, update =	"94.05 smid, 93.09 tamassia"
+, author =      "J. E. Savage"
+, title =       "Heuristics for Level Graph Embeddings"
+, booktitle =   "Proc. Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, publisher =   "Trauner Verlag"
+, address =     "Linz, Austria"
+, year =        1983
+, pages =       "307--318"
+, keywords =    "graph drawing"
+, update =      "94.05 smid, 93.09 tamassia"
 }
 
 @article{s-rbndt-70
-, author =	"W. J. Savitch"
-, title =	"Relationships between nondeterministic and deterministic tape complexities"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	4
-, number =	2
-, year =	1970
-, pages =	"177--192"
-, update =	"98.07 bibrelex"
+, author =      "W. J. Savitch"
+, title =       "Relationships between nondeterministic and deterministic tape complexities"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      4
+, number =      2
+, year =        1970
+, pages =       "177--192"
+, update =      "98.07 bibrelex"
 }
 
 @article{ssk-cpsd-87
-, author =	"D. G. Sawker and G. R. Shevare and S. P. Koruthu"
-, title =	"Contour Plotting for Scattered Data"
-, journal =	"Computers and Graphics"
-, volume =	11
-, number =	2
-, year =	1987
-, pages =	"101--104"
-, annote =	"Usual triangulation, optimization, linear
-		 interpolation. Wrinkles: data is shelled, successive
-		 convex hulls are formed. Switching DT between hulls
-		 only. A (pointless?) subdivision stage is added."
+, author =      "D. G. Sawker and G. R. Shevare and S. P. Koruthu"
+, title =       "Contour Plotting for Scattered Data"
+, journal =     "Computers and Graphics"
+, volume =      11
+, number =      2
+, year =        1987
+, pages =       "101--104"
+, annote =      "Usual triangulation, optimization, linear
+                 interpolation. Wrinkles: data is shelled, successive
+                 convex hulls are formed. Switching DT between hulls
+                 only. A (pointless?) subdivision stage is added."
 }
 
 @phdthesis{s-dspco-85
-, author =	"J. B. Saxe"
-, title =	"Decomposable searching problems and circuit optimization by retiming: two studies in general transformations of computational structures"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1985
-, note =	"Report CMU-CS-85-162"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "J. B. Saxe"
+, title =       "Decomposable searching problems and circuit optimization by retiming: two studies in general transformations of computational structures"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1985
+, note =        "Report CMU-CS-85-162"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @inproceedings{s-ewgks-79
-, author =	"J. B. Saxe"
-, title =	"Embeddability of weighted graphs in $k$-space is strongly {NP}-hard"
-, booktitle =	"Proc. 17th Allerton Conf. Commun. Control Comput."
-, year =	1979
-, pages =	"480--489"
+, author =      "J. B. Saxe"
+, title =       "Embeddability of weighted graphs in $k$-space is strongly {NP}-hard"
+, booktitle =   "Proc. 17th Allerton Conf. Commun. Control Comput."
+, year =        1979
+, pages =       "480--489"
 }
 
 @article{s-nrqks-79
-, author =	"J. B. Saxe"
-, title =	"On the number of range queries in $k$-space"
-, journal =	"Discrete Appl. Math."
-, volume =	1
-, year =	1979
-, pages =	"217--225"
+, author =      "J. B. Saxe"
+, title =       "On the number of range queries in $k$-space"
+, journal =     "Discrete Appl. Math."
+, volume =      1
+, year =        1979
+, pages =       "217--225"
 }
 
 @techreport{s-tpgep-80
-, author =	"J. B. Saxe"
-, title =	"Two papers on graph embedding problems"
-, type =	"Technical {Report}"
-, number =	"CMU-CS-80-102"
-, institution =	"Dept. Comput. Sci., Carnegie Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "J. B. Saxe"
+, title =       "Two papers on graph embedding problems"
+, type =        "Technical {Report}"
+, number =      "CMU-CS-80-102"
+, institution = "Dept. Comput. Sci., Carnegie Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{sb-tsdsd-79
-, author =	"J. B. Saxe and J. L. Bentley"
-, title =	"Transforming static data structures to dynamic structures"
-, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1979
-, pages =	"148--168"
-, precedes =	"bs-dsp1s-80"
+, author =      "J. B. Saxe and J. L. Bentley"
+, title =       "Transforming static data structures to dynamic structures"
+, booktitle =   "Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1979
+, pages =       "148--168"
+, precedes =    "bs-dsp1s-80"
 }
 
 @article{sbp-evpad-90
-, author =	"Sanjeev Saxena and P. C. P. Bhatt and V. C. Prasad"
-, title =	"Efficient {VLSI} Parallel Algorithm For {Delaunay} Triangulation On Orthogonal Tree Network In Two And Three Dimensions"
-, journal =	"IEEE Trans. Comput."
-, volume =	39
-, number =	3
-, month =	mar
-, year =	1990
-, pages =	"400--404"
-, keywords =	"computational geometry, parallel algorithms, triangulation, VLSI complexity"
-, annote =	"See correction in 40:1 (1991) p122. Uses circumcircle
-		 algorithm in parallel starting with edge to nearest
-		 neighbour. Circumcircle test is
-		 $|a^2+b^2-c^2|/4a^2b^2$."
-, abstract =	"An algorithm with worst case time complexity
-		 O(log**2N) in two dimensions and O(m**1**/**2log N) in
-		 three dimensions with N input points and m as the
-		 number of tetrahedra in triangulation is given. Its
-		 AT**2 VLSI complexity on Thompson's logarithmic delay
-		 model is O(N**2log**6N) in two dimensions and
-		 O(m**2Nlog**4 N) in three dimensions. 19 Refs."
+, author =      "Sanjeev Saxena and P. C. P. Bhatt and V. C. Prasad"
+, title =       "Efficient {VLSI} Parallel Algorithm For {Delaunay} Triangulation On Orthogonal Tree Network In Two And Three Dimensions"
+, journal =     "IEEE Trans. Comput."
+, volume =      39
+, number =      3
+, month =       mar
+, year =        1990
+, pages =       "400--404"
+, keywords =    "computational geometry, parallel algorithms, triangulation, VLSI complexity"
+, annote =      "See correction in 40:1 (1991) p122. Uses circumcircle
+                 algorithm in parallel starting with edge to nearest
+                 neighbour. Circumcircle test is
+                 $|a^2+b^2-c^2|/4a^2b^2$."
+, abstract =    "An algorithm with worst case time complexity
+                 O(log**2N) in two dimensions and O(m**1**/**2log N) in
+                 three dimensions with N input points and m as the
+                 number of tetrahedra in triangulation is given. Its
+                 AT**2 VLSI complexity on Thompson's logarithmic delay
+                 model is O(N**2log**6N) in two dimensions and
+                 O(m**2Nlog**4 N) in three dimensions. 19 Refs."
 }
 
 @inproceedings{sams-gdtoc-97
-, author =	"G. Sazaklis and E. M. Arkin and J. S. B. Mitchell and S. S. Skiena"
-, title =	"Geometric decision trees for optical character recognition"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"394--396"
-, cites =	"agmmps-ppdtg-93, ammrs-dtgm-93, bfos-crt-84, c-opcrt-91, -eera-57, fkmprs-lofp-94, msy-hrord-92, myy-rmrhc-84, n-sapr-68, rs-tgo-94, sl-sdtcm-91, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
+, author =      "G. Sazaklis and E. M. Arkin and J. S. B. Mitchell and S. S. Skiena"
+, title =       "Geometric decision trees for optical character recognition"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "394--396"
+, cites =       "agmmps-ppdtg-93, ammrs-dtgm-93, bfos-crt-84, c-opcrt-91, -eera-57, fkmprs-lofp-94, msy-hrord-92, myy-rmrhc-84, n-sapr-68, rs-tgo-94, sl-sdtcm-91, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell, 97.07 efrat"
 }
 
 @inproceedings{sams-pttcr-98
-, author =	"G. Sazaklis and Esther M. Arkin and Joseph S. B. Mitchell and Steven S. Skiena"
-, title =	"Probe Trees for Touching Character Recognition"
-, booktitle =	"Proc. 1998 International Conference on Imaging Science, Systems and Technology"
-, nickname =	"CISST'98"
-, site =	"Las Vegas, NV"
-, month =	jul
-, year =	1998
-, pages =	"282--289"
-, keywords =	"geometric decision trees, optical character recognition, text processing"
-, update =	"98.07 mitchell"
+, author =      "G. Sazaklis and Esther M. Arkin and Joseph S. B. Mitchell and Steven S. Skiena"
+, title =       "Probe Trees for Touching Character Recognition"
+, booktitle =   "Proc. 1998 International Conference on Imaging Science, Systems and Technology"
+, nickname =    "CISST'98"
+, site =        "Las Vegas, NV"
+, month =       jul
+, year =        1998
+, pages =       "282--289"
+, keywords =    "geometric decision trees, optical character recognition, text processing"
+, update =      "98.07 mitchell"
 }
 
 @inproceedings{s-igbmf-93
-, author =	"M. Sbert"
-, title =	"An integral geometry based method for fast form-factor computation"
-, editor =	"R. J. Hubbold and R. Joan"
-, booktitle =	"Proc. Eurographics '93"
-, year =	1993
-, pages =	"409--420"
-, update =	"98.03 bibrelex"
+, author =      "M. Sbert"
+, title =       "An integral geometry based method for fast form-factor computation"
+, editor =      "R. J. Hubbold and R. Joan"
+, booktitle =   "Proc. Eurographics '93"
+, year =        1993
+, pages =       "409--420"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{s-srla-??
-, author =	"H. E. Scarf"
-, title =	"Some remarks on {Lenstra}'s algorithm"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
+, author =      "H. E. Scarf"
+, title =       "Some remarks on {Lenstra}'s algorithm"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
 }
 
 @phdthesis{s-sdrrv-93
-, author =	"L. Scarlatos"
-, title =	"Spatial data representations for rapid visualization and analysis"
-, type =	"Ph.{D}. Thesis"
-, school =	"Department of Computer Science, State University of New York at Stony Brook"
-, address =	"Stony Brook, NY 11794-4400"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"95.09 mitchell"
+, author =      "L. Scarlatos"
+, title =       "Spatial data representations for rapid visualization and analysis"
+, type =        "Ph.{D}. Thesis"
+, school =      "Department of Computer Science, State University of New York at Stony Brook"
+, address =     "Stony Brook, NY 11794-4400"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "95.09 mitchell"
 }
 
 @inproceedings{sp-aht-91
-, author =	"Lori Scarlatos and Theo Pavlidis"
-, title =	"Adaptive Hierarchical Triangulation"
-, booktitle =	"Proc. 10th Internat. Sympos. Comput.-Assist. Cartog."
-, series =	"Technical Papers 1991 ACSM-ASPRS Annual Convention"
-, volume =	6
-, year =	1991
-, pages =	"234--246"
-, update =	"93.05 freimer"
-, annote =	"Hierarchical triangulation to represent surface at
-		 different levels of detail. Triangles are split in one
-		 of different ways, depending on how it deviates from
-		 underlying surface. This tends to avoid skinny
-		 triangles, are require a less deep hierarchy."
+, author =      "Lori Scarlatos and Theo Pavlidis"
+, title =       "Adaptive Hierarchical Triangulation"
+, booktitle =   "Proc. 10th Internat. Sympos. Comput.-Assist. Cartog."
+, series =      "Technical Papers 1991 ACSM-ASPRS Annual Convention"
+, volume =      6
+, year =        1991
+, pages =       "234--246"
+, update =      "93.05 freimer"
+, annote =      "Hierarchical triangulation to represent surface at
+                 different levels of detail. Triangles are split in one
+                 of different ways, depending on how it deviates from
+                 underlying surface. This tends to avoid skinny
+                 triangles, are require a less deep hierarchy."
 }
 
 @article{sp-htucc-92
-, author =	"Lori Scarlatos and Theo Pavlidis"
-, title =	"Hierarchical Triangulation Using Cartographics Coherence"
-, journal =	"CVGIP: Graph. Models Image Process."
-, volume =	54
-, number =	2
-, month =	mar
-, year =	1992
-, pages =	"147--161"
-, annote =	"Triangles where there are large deviations from the
-		 surface are split (preferably along an edge) into 2 3
-		 or 4 triangles each. Uses average ``sliveriness''
-		 ($P^2/A$) to measure mesh quality."
+, author =      "Lori Scarlatos and Theo Pavlidis"
+, title =       "Hierarchical Triangulation Using Cartographics Coherence"
+, journal =     "CVGIP: Graph. Models Image Process."
+, volume =      54
+, number =      2
+, month =       mar
+, year =        1992
+, pages =       "147--161"
+, annote =      "Triangles where there are large deviations from the
+                 surface are split (preferably along an edge) into 2 3
+                 or 4 triangles each. Uses average ``sliveriness''
+                 ($P^2/A$) to measure mesh quality."
 }
 
 @inproceedings{sp-htutf-90
-, author =	"Lori Scarlatos and Theo Pavlidis"
-, title =	"Hierarchical Triangulation Using Terrain Features"
-, booktitle =	"Proceedings of the 1st 1990 IEEE Conference on Visualization, Visualization '90"
-, publisher =	"IEEE"
-, address =	"IEEE Service Center, Piscataway, NJ, USA (IEEE cat n 90CH2914-0)"
-, year =	1990
-, pages =	"168--175"
-, keywords =	"hierarchical triangulation, terrain features, digital elevation models, visualization"
-, abstract =	"A hierarchical triangulation built from a digital
-		 elevation model in grid form is described. The authors
-		 present an algorithm that produces a hierarchy of
-		 triangulations in which each level of the hierarchy
-		 corresponds to a guaranteed level of accuracy. The
-		 number of very thin triangles (slivers) is
-		 significantly reduced. Such triangles produced
-		 undesirable effects in animation. In addition the
-		 number of levels of the triangulated irregular network
-		 (TIN) tree is reduced. This speeds up searching within
-		 the data structure. Tests on data with digital
-		 elevation input have confirmed the theoretical
-		 expectations. On eight such sets the average
-		 sliveriness with the method was between 1/5 and 1/10 of
-		 old triangulations and number of levels was about one
-		 third. There was an increase in the number of
-		 descendants at each level, but the total number of
-		 triangles was also lower. 20 Refs."
+, author =      "Lori Scarlatos and Theo Pavlidis"
+, title =       "Hierarchical Triangulation Using Terrain Features"
+, booktitle =   "Proceedings of the 1st 1990 IEEE Conference on Visualization, Visualization '90"
+, publisher =   "IEEE"
+, address =     "IEEE Service Center, Piscataway, NJ, USA (IEEE cat n 90CH2914-0)"
+, year =        1990
+, pages =       "168--175"
+, keywords =    "hierarchical triangulation, terrain features, digital elevation models, visualization"
+, abstract =    "A hierarchical triangulation built from a digital
+                 elevation model in grid form is described. The authors
+                 present an algorithm that produces a hierarchy of
+                 triangulations in which each level of the hierarchy
+                 corresponds to a guaranteed level of accuracy. The
+                 number of very thin triangles (slivers) is
+                 significantly reduced. Such triangles produced
+                 undesirable effects in animation. In addition the
+                 number of levels of the triangulated irregular network
+                 (TIN) tree is reduced. This speeds up searching within
+                 the data structure. Tests on data with digital
+                 elevation input have confirmed the theoretical
+                 expectations. On eight such sets the average
+                 sliveriness with the method was between 1/5 and 1/10 of
+                 old triangulations and number of levels was about one
+                 third. There was an increase in the number of
+                 descendants at each level, but the total number of
+                 triangles was also lower. 20 Refs."
 }
 
 @inproceedings{sp-otce-92
-, author =	"L. Scarlatos and T. Pavlidis"
-, title =	"Optimizing triangulation by curvature equalization"
-, booktitle =	"Proceedings of the 3rd 1992 IEEE Conference on Visualization, Visualization '92"
-, publisher =	"IEEE"
-, year =	1992
-, pages =	"333--339"
-, keywords =	"hierarchical triangulation, terrain features, digital elevation models, visualization"
-, update =	"95.09 mitchell"
+, author =      "L. Scarlatos and T. Pavlidis"
+, title =       "Optimizing triangulation by curvature equalization"
+, booktitle =   "Proceedings of the 3rd 1992 IEEE Conference on Visualization, Visualization '92"
+, publisher =   "IEEE"
+, year =        1992
+, pages =       "333--339"
+, keywords =    "hierarchical triangulation, terrain features, digital elevation models, visualization"
+, update =      "95.09 mitchell"
 }
 
 @article{s-dpcs-78
-, author =	"B. Schachter"
-, title =	"Decomposition of Polygons into Convex Sets"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-27"
-, number =	11
-, year =	1978
-, pages =	"1078--1082"
-, annote =	"Cuts polygon along Delaunay edges at reflex angles.
-		 $O(n)$ process to find De's at a given reflex vertex -
-		 picks one or two to eliminate reflex. $O(mn)$"
+, author =      "B. Schachter"
+, title =       "Decomposition of Polygons into Convex Sets"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-27"
+, number =      11
+, year =        1978
+, pages =       "1078--1082"
+, annote =      "Cuts polygon along Delaunay edges at reflex angles.
+                 $O(n)$ process to find De's at a given reflex vertex -
+                 picks one or two to eliminate reflex. $O(mn)$"
 }
 
 @article{srd-rmmt-78
-, author =	"B. Schachter and A. Rosenfeld and L. S. David"
-, title =	"Random mosaic models for textures"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	8
-, number =	9
-, year =	1978
-, pages =	"694--702"
+, author =      "B. Schachter and A. Rosenfeld and L. S. David"
+, title =       "Random mosaic models for textures"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      8
+, number =      9
+, year =        1978
+, pages =       "694--702"
 }
 
 @misc{s-ppmpe-
-, author =	"D. H. Schaefer"
-, title =	"The {PMMP} - a pyramid of {MPP} processing elements"
-, note =	"To appear"
-, update =	"97.11 bibrelex"
+, author =      "D. H. Schaefer"
+, title =       "The {PMMP} - a pyramid of {MPP} processing elements"
+, note =        "To appear"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-obbtr-87
-, author =	"H. M. Schaettler"
-, title =	"On the Optimality of bang-bang trajectories in ${R}^{3}$"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	18
-, number =	1
-, year =	1987
-, pages =	"113--116"
-, update =	"97.11 bibrelex"
+, author =      "H. M. Schaettler"
+, title =       "On the Optimality of bang-bang trajectories in ${R}^{3}$"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      18
+, number =      1
+, year =        1987
+, pages =       "113--116"
+, update =      "97.11 bibrelex"
 }
 
 @mastersthesis{s-tmsp-83
-, author =	"A. A. Sch{\"a}ffer"
-, title =	"Trees for multidimensional search problems"
-, type =	"M.{S}. Thesis"
-, school =	"Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1983
-, keywords =	"master thesis"
+, author =      "A. A. Sch{\"a}ffer"
+, title =       "Trees for multidimensional search problems"
+, type =        "M.{S}. Thesis"
+, school =      "Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1983
+, keywords =    "master thesis"
 }
 
 @article{sv-chpsj-87
-, author =	"A. A. Sch{\"a}ffer and C. J. {Van Wyk}"
-, title =	"Convex Hulls of Piecewise-Smooth {Jordan} Curves"
-, journal =	"J. Algorithms"
-, volume =	8
-, year =	1987
-, pages =	"66--94"
-, update =	"93.09 held"
+, author =      "A. A. Sch{\"a}ffer and C. J. {Van Wyk}"
+, title =       "Convex Hulls of Piecewise-Smooth {Jordan} Curves"
+, journal =     "J. Algorithms"
+, volume =      8
+, year =        1987
+, pages =       "66--94"
+, update =      "93.09 held"
 }
 
 @article{s-dgrg-95
-, author =	"M. Sch{\"a}ffter"
-, title =	"Drawing graphs on rectangular grids"
-, journal =	"Discrete Appl. Math."
-, volume =	63
-, year =	1995
-, pages =	"75--89"
-, keywords =	"graph drawing, orthogonal, grid"
-, update =	"96.01 tamassia"
+, author =      "M. Sch{\"a}ffter"
+, title =       "Drawing graphs on rectangular grids"
+, journal =     "Discrete Appl. Math."
+, volume =      63
+, year =        1995
+, pages =       "75--89"
+, keywords =    "graph drawing, orthogonal, grid"
+, update =      "96.01 tamassia"
 }
 
 @techreport{s-ocf-91b
-, author =	"P. Schapira"
-, title =	"Operations on Constructible Functions"
-, type =	"Report"
-, number =	"88-2"
-, institution =	"Departement de mathematique et informatique, Universite Paris-Nord"
-, address =	"93430 Villetaneuse, France"
-, year =	1988
-, comments =	"Presents an equivalent of kinetic framework, grs-kfcg-83, in 2 and higher dimensions"
-, update =	"96.05 ramkumar"
+, author =      "P. Schapira"
+, title =       "Operations on Constructible Functions"
+, type =        "Report"
+, number =      "88-2"
+, institution = "Departement de mathematique et informatique, Universite Paris-Nord"
+, address =     "93430 Villetaneuse, France"
+, year =        1988
+, comments =    "Presents an equivalent of kinetic framework, grs-kfcg-83, in 2 and higher dimensions"
+, update =      "96.05 ramkumar"
 }
 
 @incollection{ss-t-97
-, author =	"D. Schattschneider and M. Senechal"
-, title =	"Tilings"
-, chapter =	3
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"43--62"
-, update =	"97.11 orourke"
+, author =      "D. Schattschneider and M. Senechal"
+, title =       "Tilings"
+, chapter =     3
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "43--62"
+, update =      "97.11 orourke"
 }
 
 @phdthesis{s-mwcgv-91
-, author =	"B. F. Schaudt"
-, title =	"Multiplicative Weighted Crystal Growth {Voronoi} Diagrams"
-, school =	"Dartmouth College"
-, year =	1991
-, url =	"In preparation"
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "B. F. Schaudt"
+, title =       "Multiplicative Weighted Crystal Growth {Voronoi} Diagrams"
+, school =      "Dartmouth College"
+, year =        1991
+, url = "In preparation"
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{sd-hdvdc-92
-, author =	"B. F. Schaudt and R. L. Drysdale"
-, title =	"Higher-dimensional {Voronoi} diagrams for convex distance functions"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"274--279"
-, cites =	"a-vdsfg-91, cd-vdbcd-85, c-ochan-91, d-pacdt-90, e-acg-87, gs-pmgsc-85, l-tdvdl-80, lw-vdllm-80, ph-chfsp-77, rs-tchnp-85, sdt-opsal-91, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "B. F. Schaudt and R. L. Drysdale"
+, title =       "Higher-dimensional {Voronoi} diagrams for convex distance functions"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "274--279"
+, cites =       "a-vdsfg-91, cd-vdbcd-85, c-ochan-91, d-pacdt-90, e-acg-87, gs-pmgsc-85, l-tdvdl-80, lw-vdllm-80, ph-chfsp-77, rs-tchnp-85, sdt-opsal-91, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{sd-mwcgv-91
-, author =	"B. F. Schaudt and R. L. Drysdale"
-, title =	"Multiplicatively weighted crystal growth {Voronoi} diagrams"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"214--223"
-, keywords =	"Voronoi diagrams"
-, cites =	"ae-oacwv-84, a-pdpaa-87, a-vds-88, bsh-sgfgt-84, cd-vdbcd-85, f-savd-87, ft-dmtf-87, ft-csmet-88, gb-msp-78, g-nivpo-71, ghj-gpma-67, gs-cdtp-78, g-dg-63, g-ims-72, hj-gifdg-68, hl-ius-79, l-cspc-72, mhm-cacjm-80, pftv-nr-86, ps-cgi-85, sb-ina-80, s-mwcgv-91, th-gmt1m-80, wt-fcwvd-90, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "B. F. Schaudt and R. L. Drysdale"
+, title =       "Multiplicatively weighted crystal growth {Voronoi} diagrams"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "214--223"
+, keywords =    "Voronoi diagrams"
+, cites =       "ae-oacwv-84, a-pdpaa-87, a-vds-88, bsh-sgfgt-84, cd-vdbcd-85, f-savd-87, ft-dmtf-87, ft-csmet-88, gb-msp-78, g-nivpo-71, ghj-gpma-67, gs-cdtp-78, g-dg-63, g-ims-72, hj-gifdg-68, hl-ius-79, l-cspc-72, mhm-cacjm-80, pftv-nr-86, ps-cgi-85, sb-ina-80, s-mwcgv-91, th-gmt1m-80, wt-fcwvd-90, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ss-gmldp-95
-, author =	"G. Schaufler and W. Stuerzlinger"
-, title =	"Generating multiple levels of detail for polygonal geometry models"
-, booktitle =	"Virtual Environments"
-, site =	"Monte Carlo, MC"
-, month =	jan
-, year =	1995
-, pages =	"53--62"
-, keywords =	"surface simplification"
-, update =	"96.01 mitchell"
+, author =      "G. Schaufler and W. Stuerzlinger"
+, title =       "Generating multiple levels of detail for polygonal geometry models"
+, booktitle =   "Virtual Environments"
+, site =        "Monte Carlo, MC"
+, month =       jan
+, year =        1995
+, pages =       "53--62"
+, keywords =    "surface simplification"
+, update =      "96.01 mitchell"
 }
 
 @article{s-psvtd-87
-, author =	"C. F. Scheepers"
-, title =	"Polygon Shading on Vector Type Devices"
-, journal =	"Quaestiones Informaticae"
-, volume =	5
-, number =	2
-, month =	oct
-, year =	1987
-, pages =	"46--55"
-, update =	"95.01 held"
+, author =      "C. F. Scheepers"
+, title =       "Polygon Shading on Vector Type Devices"
+, journal =     "Quaestiones Informaticae"
+, volume =      5
+, number =      2
+, month =       oct
+, year =        1987
+, pages =       "46--55"
+, update =      "95.01 held"
 }
 
 @article{sg-xws-86
-, author =	"Robert W. Scheifler and Jim Gettys"
-, title =	"The {X} Window System"
-, journal =	"ACM Trans. Graph."
-, volume =	5
-, number =	2
-, year =	1986
-, pages =	"79--109"
-, keywords =	"virtual terminals, window managers"
-, update =	"96.01 tamassia"
+, author =      "Robert W. Scheifler and Jim Gettys"
+, title =       "The {X} Window System"
+, journal =     "ACM Trans. Graph."
+, volume =      5
+, number =      2
+, year =        1986
+, pages =       "79--109"
+, keywords =    "virtual terminals, window managers"
+, update =      "96.01 tamassia"
 }
 
 @techreport{s-csg-85
-, author =	"W. Schempp"
-, title =	"Computational signal geometry"
-, type =	"Report"
-, number =	"??"
-, institution =	"Lehrstuhl Math. I, Univ. Siegen"
-, address =	"Siegen, West Germany"
-, year =	1985
+, author =      "W. Schempp"
+, title =       "Computational signal geometry"
+, type =        "Report"
+, number =      "??"
+, institution = "Lehrstuhl Math. I, Univ. Siegen"
+, address =     "Siegen, West Germany"
+, year =        1985
 }
 
 @article{sc-dstcr-87
-, author =	"I. D. Scherson and E. Caspary"
-, title =	"Data structures and the time complexity of ray tracing"
-, journal =	"Visual Comput."
-, volume =	3
-, year =	1987
-, pages =	"201--213"
+, author =      "I. D. Scherson and E. Caspary"
+, title =       "Data structures and the time complexity of ray tracing"
+, journal =     "Visual Comput."
+, volume =      3
+, year =        1987
+, pages =       "201--213"
 }
 
 @techreport{so-mbtas-80
-, author =	"P. Scheuermann and M. Ouksel"
-, title =	"Multidimensional $b$-trees for associative searching in database systems"
-, type =	"Report"
-, number =	"80-12-DBM-05"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
-, address =	"Evanston, IL"
-, year =	1980
+, author =      "P. Scheuermann and M. Ouksel"
+, title =       "Multidimensional $b$-trees for associative searching in database systems"
+, type =        "Report"
+, number =      "80-12-DBM-05"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Northwestern Univ."
+, address =     "Evanston, IL"
+, year =        1980
 }
 
 @phdthesis{s-agp-89
-, author =	"C. Schevon"
-, title =	"Algorithms for geodesics on polytopes"
-, school =	"Johns Hopkins University"
-, year =	1989
-, keywords =	"polytopes, shortest paths, diameter"
-, update =	"93.05 orourke"
+, author =      "C. Schevon"
+, title =       "Algorithms for geodesics on polytopes"
+, school =      "Johns Hopkins University"
+, year =        1989
+, keywords =    "polytopes, shortest paths, diameter"
+, update =      "93.05 orourke"
 }
 
 @techreport{so-cru-87
-, author =	"C. Schevon and J. O'Rourke"
-, title =	"A conjecture on random unfoldings"
-, type =	"Technical {Report}"
-, number =	"JHU-87/20"
-, institution =	"Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	jul
-, year =	1987
-, keywords =	"polytopes, unfoldings"
+, author =      "C. Schevon and J. O'Rourke"
+, title =       "A conjecture on random unfoldings"
+, type =        "Technical {Report}"
+, number =      "JHU-87/20"
+, institution = "Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       jul
+, year =        1987
+, keywords =    "polytopes, unfoldings"
 }
 
 @techreport{so-afesp-89
-, author =	"C. Schevon and J. O'Rourke"
-, title =	"An algorithm for finding edge sequences on a polytope"
-, type =	"Technical {Report}"
-, number =	"JHU-89/03"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	feb
-, year =	1989
-, keywords =	"polytopes, shortest paths, edge sequences"
+, author =      "C. Schevon and J. O'Rourke"
+, title =       "An algorithm for finding edge sequences on a polytope"
+, type =        "Technical {Report}"
+, number =      "JHU-89/03"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       feb
+, year =        1989
+, keywords =    "polytopes, shortest paths, edge sequences"
 }
 
 @inproceedings{so-nmesc-88
-, author =	"C. Schevon and J. O'Rourke"
-, title =	"The number of maximal edge sequences on a convex polytope"
-, booktitle =	"Proc. 26th Allerton Conf. Commun. Control Comput."
-, site =	"University of Illinois at Urbana-Champaign"
-, month =	oct
-, year =	1988
-, pages =	"49--57"
-, keywords =	"shortest paths, polytopes"
-, update =	"93.05 orourke"
+, author =      "C. Schevon and J. O'Rourke"
+, title =       "The number of maximal edge sequences on a convex polytope"
+, booktitle =   "Proc. 26th Allerton Conf. Commun. Control Comput."
+, site =        "University of Illinois at Urbana-Champaign"
+, month =       oct
+, year =        1988
+, pages =       "49--57"
+, keywords =    "shortest paths, polytopes"
+, update =      "93.05 orourke"
 }
 
 @article{sv-parud-88
-, author =	"C. A. Schevon and J. S. Vitter"
-, title =	"A Parallel Algorithm for Recognizing Unordered Depth-First Search"
-, journal =	"Inform. Process. Lett."
-, volume =	"??"
-, year =	"June 24, 1988"
-, pages =	"105--110"
-, update =	"97.03 murali"
+, author =      "C. A. Schevon and J. S. Vitter"
+, title =       "A Parallel Algorithm for Recognizing Unordered Depth-First Search"
+, journal =     "Inform. Process. Lett."
+, volume =      "??"
+, year =        "June 24, 1988"
+, pages =       "105--110"
+, update =      "97.03 murali"
 }
 
 @inproceedings{s-cmwkl-95
-, author =	"Baruch Schieber"
-, title =	"Computing a Minimum-weight {$k$}-link Path in Graphs with the Concave {Monge} Property"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"405--411"
-, keywords =	"largest inscribed k-gon, smallest k-gon from set of n halfplanes, polygon containment, matrix searching"
-, update =	"96.09 agarwal, 96.05 mitchell"
+, author =      "Baruch Schieber"
+, title =       "Computing a Minimum-weight {$k$}-link Path in Graphs with the Concave {Monge} Property"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "405--411"
+, keywords =    "largest inscribed k-gon, smallest k-gon from set of n halfplanes, polygon containment, matrix searching"
+, update =      "96.09 agarwal, 96.05 mitchell"
 }
 
 @inproceedings{sv-flcas-88
-, author =	"B. Schieber and U. Vishkin"
-, title =	"On finding lowest common ancestors: {Simplification} and parallelization"
-, booktitle =	"Proc. 3rd Aegean Workshop Computing"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	319
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"111--123"
-, update =	"97.11 bibrelex"
+, author =      "B. Schieber and U. Vishkin"
+, title =       "On finding lowest common ancestors: {Simplification} and parallelization"
+, booktitle =   "Proc. 3rd Aegean Workshop Computing"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      319
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "111--123"
+, update =      "97.11 bibrelex"
 }
 
 @book{s-frac-90
-, author =	"R. J. Schilling"
-, title =	"Fundamentals of Robotics, Analysis and Control"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1990
-, update =	"97.03 schwarzkopf"
+, author =      "R. J. Schilling"
+, title =       "Fundamentals of Robotics, Analysis and Control"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1990
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{shk-amc3d-95
-, author =	"P. H. Schimpf and D. R. Haynor and Y. Kim"
-, title =	"Automated meshing of complex 3-D domains from classified images"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"193--204"
-, update =	"96.01 samitchell"
+, author =      "P. H. Schimpf and D. R. Haynor and Y. Kim"
+, title =       "Automated meshing of complex 3-D domains from classified images"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "193--204"
+, update =      "96.01 samitchell"
 }
 
 @article{s-emnas-94
-, author =	"W. Schindler"
-, title =	"Equivariant mappings: a new approach in stochastic simulations"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"327--343"
-, update =	"96.09 devillers"
+, author =      "W. Schindler"
+, title =       "Equivariant mappings: a new approach in stochastic simulations"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "327--343"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{s-dcc-92c
-, author =	"Haijo Schipper"
-, title =	"Determining Contractability of Curves"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	31
-, update =	"00.03 bibrelex"
+, author =      "Haijo Schipper"
+, title =       "Determining Contractability of Curves"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       31
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{s-dcc-92
-, author =	"H. Schipper"
-, title =	"Determining contractibility of curves"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"358--367"
-, cites =	"d-uudg-12, d-tdkaz-12, h-cit-79, hs-aacsl-91, hs-cmlpg-91, my-chthu-88, s-tacg-90, s-ctcgt-80, v-kfdp-89, vy-cccs-90, ZZZ"
-, update =	"00.03 bibrelex, 97.11 bibrelex"
+, author =      "H. Schipper"
+, title =       "Determining contractibility of curves"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "358--367"
+, cites =       "d-uudg-12, d-tdkaz-12, h-cit-79, hs-aacsl-91, hs-cmlpg-91, my-chthu-88, s-tacg-90, s-ctcgt-80, v-kfdp-89, vy-cccs-90, ZZZ"
+, update =      "00.03 bibrelex, 97.11 bibrelex"
 }
 
 @techreport{s-gt2m-90
-, author =	"H. Schipper"
-, title =	"Generating triangulations of $2$-manifolds"
-, type =	"Report"
-, number =	"CS-9008"
-, institution =	"Dept. Comput. Sci., Univ. Groningen"
-, address =	"Groningen, Netherlands"
-, year =	1990
+, author =      "H. Schipper"
+, title =       "Generating triangulations of $2$-manifolds"
+, type =        "Report"
+, number =      "CS-9008"
+, institution = "Dept. Comput. Sci., Univ. Groningen"
+, address =     "Groningen, Netherlands"
+, year =        1990
 }
 
 @inproceedings{s-gt2m-91
-, author =	"Haijo Schipper"
-, title =	"Generating triangulations of $2$-manifolds"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"237--248"
-, keywords =	"topology"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
-, abstract =	"In this paper we will show how for a given triangulation
+, author =      "Haijo Schipper"
+, title =       "Generating triangulations of $2$-manifolds"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "237--248"
+, keywords =    "topology"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
+, abstract =    "In this paper we will show how for a given triangulation
                  {$T$} of a $2$-manifold {$M$} a minimal triangulation
                  {$T_{\min}$} of {$M$} and a sequence {$S$} of
                  vertex-splittings can be calculated such that performing
@@ -127996,838 +127996,838 @@ @inproceedings{s-gt2m-91
 }
 
 @inproceedings{s-wpga-92
-, author =	"H. Schipper"
-, title =	"The word problem: a geometric approach"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"59--65"
-, cites =	"d-uudg-12, d-tdkaz-12, g-dawp-60, h-cit-79, hs-aacsl-91, hs-cmlpg-91, my-chthu-88, s-tacg-90, s-dcc-92, s-ctcgt-80, v-kfdp-89, vy-cccs-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "H. Schipper"
+, title =       "The word problem: a geometric approach"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "59--65"
+, cites =       "d-uudg-12, d-tdkaz-12, g-dawp-60, h-cit-79, hs-aacsl-91, hs-cmlpg-91, my-chthu-88, s-tacg-90, s-dcc-92, s-ctcgt-80, v-kfdp-89, vy-cccs-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{so-dpt-89
-, author =	"H. Schipper and M. H. Overmars"
-, title =	"Dynamic partition trees"
-, type =	"Report"
-, number =	"RUU-CS-89-25"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1989
-, precedes =	"so-dpt-90"
-, update =	"94.05 schwarzkopf"
+, author =      "H. Schipper and M. H. Overmars"
+, title =       "Dynamic partition trees"
+, type =        "Report"
+, number =      "RUU-CS-89-25"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1989
+, precedes =    "so-dpt-90"
+, update =      "94.05 schwarzkopf"
 }
 
 @inproceedings{so-dpt-90
-, author =	"H. Schipper and M. H. Overmars"
-, title =	"Dynamic partition trees"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"404--417"
-, succeeds =	"so-dpt-89"
+, author =      "H. Schipper and M. H. Overmars"
+, title =       "Dynamic partition trees"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "404--417"
+, succeeds =    "so-dpt-89"
 }
 
 @article{so-dpt-91
-, author =	"H. Schipper and M. H. Overmars"
-, title =	"Dynamic partition trees"
-, journal =	"BIT"
-, volume =	31
-, year =	1991
-, pages =	"421--436"
-, succeeds =	"so-dpt-90"
-, update =	"94.05 matousek"
+, author =      "H. Schipper and M. H. Overmars"
+, title =       "Dynamic partition trees"
+, journal =     "BIT"
+, volume =      31
+, year =        1991
+, pages =       "421--436"
+, succeeds =    "so-dpt-90"
+, update =      "94.05 matousek"
 }
 
 @inproceedings{s-cscgc-99
-, author =	"S. Schirra"
-, title =	"A Case Study on the Cost of Geometric Computing"
-, editor =	"M. T. Goodrich and C. C. McGeoch"
-, booktitle =	"Algorithm Engineering and Experimentation (Proc. ALENEX~'99)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1619
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"156--176"
-, update =	"00.11 smid, 00.07 vismara"
+, author =      "S. Schirra"
+, title =       "A Case Study on the Cost of Geometric Computing"
+, editor =      "M. T. Goodrich and C. C. McGeoch"
+, booktitle =   "Algorithm Engineering and Experimentation (Proc. ALENEX~'99)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1619
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "156--176"
+, update =      "00.11 smid, 00.07 vismara"
 }
 
 @techreport{s-aaac-90
-, author =	"S. Schirra"
-, title =	"Approximate algorithms for approximate congruence"
-, type =	"Report"
-, number =	"A-21/90"
-, institution =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1990
+, author =      "S. Schirra"
+, title =       "Approximate algorithms for approximate congruence"
+, type =        "Report"
+, number =      "A-21/90"
+, institution = "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1990
 }
 
 @article{s-adaac-92
-, author =	"S. Schirra"
-, title =	"Approximate decision algorithms for approximate congruence"
-, journal =	"Inform. Process. Lett."
-, volume =	43
-, year =	1992
-, pages =	"29--34"
+, author =      "S. Schirra"
+, title =       "Approximate decision algorithms for approximate congruence"
+, journal =     "Inform. Process. Lett."
+, volume =      43
+, year =        1992
+, pages =       "29--34"
 }
 
 @phdthesis{s-ab-92
-, author =	"S. Schirra"
-, title =	"Approximative {Bewegungsplanungsverfahren}"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
-, keywords =	"doctoral thesis"
+, author =      "S. Schirra"
+, title =       "Approximative {Bewegungsplanungsverfahren}"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
+, keywords =    "doctoral thesis"
 }
 
 @inproceedings{s-mdbp-93
-, author =	"S. Schirra"
-, title =	"Moving a disc between polygons"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"395--396"
-, keywords =	"video review"
-, cites =	"egs-oplms-86, ht-fafnc-84, nm-lledt-90, oy-rmpmd-85, r-mdbp-91, y-oavds-87, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "S. Schirra"
+, title =       "Moving a disc between polygons"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "395--396"
+, keywords =    "video review"
+, cites =       "egs-oplms-86, ht-fafnc-84, nm-lledt-90, oy-rmpmd-85, r-mdbp-91, y-oavds-87, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @incollection{s-rpigc-00
-, author =	"Stefan Schirra"
-, title =	"Robustness and Precision Issues in Geometric Computation"
-, chapter =	14
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"597--632"
-, update =	"00.03 bibrelex+smid+vismara, 99.03 bibrelex, 98.07 mitchell"
-, annote =	"Chapter 14 of su-hcg-00"
+, author =      "Stefan Schirra"
+, title =       "Robustness and Precision Issues in Geometric Computation"
+, chapter =     14
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "597--632"
+, update =      "00.03 bibrelex+smid+vismara, 99.03 bibrelex, 98.07 mitchell"
+, annote =      "Chapter 14 of su-hcg-00"
 }
 
 @mastersthesis{s-udbde-88
-, author =	"S. Schirra"
-, title =	"{\"U}ber die {Bitkomplexit{\"a}t} der $\epsilon$-{Kongruenz}"
-, school =	"Fachbereich Informatik, Universit{\"a}t des Saarlandes"
-, year =	1988
-, keywords =	"master thesis"
-, update =	"97.11 bibrelex"
+, author =      "S. Schirra"
+, title =       "{\"U}ber die {Bitkomplexit{\"a}t} der $\epsilon$-{Kongruenz}"
+, school =      "Fachbereich Informatik, Universit{\"a}t des Saarlandes"
+, year =        1988
+, keywords =    "master thesis"
+, update =      "97.11 bibrelex"
 }
 
 @manual{svy-crm-99
-, title =	"The {CGAL} Reference Manual"
-, editor =	"Stefan Schirra and Remco Veltkamp and Mariette Yvinec"
-, year =	1999
-, note =	"Release 2.0"
-, url =	"http://www.cs.uu.nl/CGAL/"
-, update =	"99.11 devillers, 99.07 devillers"
-, key =	"CGAL2.0"
+, title =       "The {CGAL} Reference Manual"
+, editor =      "Stefan Schirra and Remco Veltkamp and Mariette Yvinec"
+, year =        1999
+, note =        "Release 2.0"
+, url = "http://www.cs.uu.nl/CGAL/"
+, update =      "99.11 devillers, 99.07 devillers"
+, key = "CGAL2.0"
 }
 
 @incollection{s-feeri-94
-, author =	"John Schlag"
-, title =	"Fast Embossing Effects on Raster Image Data"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"433--437"
-, keywords =	"bump mapping, texture, image filter, paint program, shading"
-, update =	"94.09 heckbert"
-, annote =	"Presents a simple, fast technique that interprets an image
+, author =      "John Schlag"
+, title =       "Fast Embossing Effects on Raster Image Data"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "433--437"
+, keywords =    "bump mapping, texture, image filter, paint program, shading"
+, update =      "94.09 heckbert"
+, annote =      "Presents a simple, fast technique that interprets an image
 as a height field or bump map, and then shades it, yielding an embossing
 effect. Contains C code."
 }
 
 @incollection{slmlw-vpvlc-84
-, author =	"M. Schlag and F. Luccio and P. Maestrini and D. T. Lee and C. K. Wong"
-, title =	"A visibility problem in {VLSI} layout compaction"
-, editor =	"Franco P. Preparata"
-, booktitle =	"VLSI Theory"
-, series =	"Adv. Comput. Res."
-, volume =	2
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1984
-, pages =	"259--282"
-, keywords =	"graph drawing"
-, update =	"01.04 icking, 97.11 bibrelex"
+, author =      "M. Schlag and F. Luccio and P. Maestrini and D. T. Lee and C. K. Wong"
+, title =       "A visibility problem in {VLSI} layout compaction"
+, editor =      "Franco P. Preparata"
+, booktitle =   "VLSI Theory"
+, series =      "Adv. Comput. Res."
+, volume =      2
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1984
+, pages =       "259--282"
+, keywords =    "graph drawing"
+, update =      "01.04 icking, 97.11 bibrelex"
 }
 
 @incollection{s-fapsm-94
-, author =	"Christophe Schlick"
-, title =	"A Fast Alternative to {Phong}'s Specular Model"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"385--387"
-, keywords =	"Phong illumination, specular reflection, exponentiation"
-, update =	"94.09 heckbert"
-, annote =	"Describes a simple approximation to Phong's specular
+, author =      "Christophe Schlick"
+, title =       "A Fast Alternative to {Phong}'s Specular Model"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "385--387"
+, keywords =    "Phong illumination, specular reflection, exponentiation"
+, update =      "94.09 heckbert"
+, annote =      "Describes a simple approximation to Phong's specular
 reflection formula that does not require exponentiation or table lookup."
 }
 
 @incollection{s-fapbg-94
-, author =	"Christophe Schlick"
-, title =	"Fast Alternatives to {Perlin}'s Bias and Gain Functions"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"401--403"
-, keywords =	"hypertexture, texture synthesis"
-, update =	"94.09 heckbert"
-, annote =	"Gives a simple approximation to some formulas that are
+, author =      "Christophe Schlick"
+, title =       "Fast Alternatives to {Perlin}'s Bias and Gain Functions"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "401--403"
+, keywords =    "hypertexture, texture synthesis"
+, update =      "94.09 heckbert"
+, annote =      "Gives a simple approximation to some formulas that are
 commonly used in procedural texture synthesis and volume synthesis."
 }
 
 @incollection{s-hdrp-94
-, author =	"Christophe Schlick"
-, title =	"High Dynamic Range Pixels"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"422--429"
-, keywords =	"quantization, dynamic range"
-, update =	"94.09 heckbert"
-, annote =	"Proposes a pixel encoding technique that allows color
+, author =      "Christophe Schlick"
+, title =       "High Dynamic Range Pixels"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "422--429"
+, keywords =    "quantization, dynamic range"
+, update =      "94.09 heckbert"
+, annote =      "Proposes a pixel encoding technique that allows color
 images with high dynamic range to be stored using only 24 bits per pixel.
 Contains C code."
 }
 
 @article{st-fpact-99
-, author =	"D. Schmalstieg and R. F. Tobler"
-, title =	"Fast Projected Area Computation for Three-Dimensional Bounding Boxes"
-, journal =	"J. Graphics Tools"
-, volume =	4
-, number =	2
-, year =	1999
-, pages =	"37--43"
-, update =	"00.03 held"
+, author =      "D. Schmalstieg and R. F. Tobler"
+, title =       "Fast Projected Area Computation for Three-Dimensional Bounding Boxes"
+, journal =     "J. Graphics Tools"
+, volume =      4
+, number =      2
+, year =        1999
+, pages =       "37--43"
+, update =      "00.03 held"
 }
 
 @inproceedings{s-sltep-89
-, author =	"F. Schmid"
-, title =	"{Symbolische} {L{\"o}sungen} und {Term}-{Ersetzungssysteme} in der projektiven und affinen {Geometrie}"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "F. Schmid"
+, title =       "{Symbolische} {L{\"o}sungen} und {Term}-{Ersetzungssysteme} in der projektiven und affinen {Geometrie}"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{sss-chbal-93
-, author =	"J. P. Schmidt and A. Siegel and A. Srinivasan"
-, title =	"{Chernoff}-{Hoeffding} Bounds for Applications with Limited Idependence"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"331--340"
-, update =	"01.07 devillers, 98.03 bibrelex"
+, author =      "J. P. Schmidt and A. Siegel and A. Srinivasan"
+, title =       "{Chernoff}-{Hoeffding} Bounds for Applications with Limited Idependence"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "331--340"
+, update =      "01.07 devillers, 98.03 bibrelex"
 }
 
 @article{s-cgcsf-92
-, author =	"P.-M. Schmidt"
-, title =	"Counting and generating circular sequences of finite planar point sets"
-, journal =	"Algorithms Rev."
-, volume =	2
-, number =	3
-, year =	1992
-, pages =	"139--151"
+, author =      "P.-M. Schmidt"
+, title =       "Counting and generating circular sequences of finite planar point sets"
+, journal =     "Algorithms Rev."
+, volume =      2
+, number =      3
+, year =        1992
+, pages =       "139--151"
 }
 
 @inproceedings{s-nppsg-94
-, author =	"Peter-Michael Schmidt"
-, title =	"On the Number of Permutations of Point Sets Generated by Plane Sweeps and Sphere Sweeps"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"41--44"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Peter-Michael Schmidt"
+, title =       "On the Number of Permutations of Point Sets Generated by Plane Sweeps and Sphere Sweeps"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "41--44"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @article{s-ipcs-85
-, author =	"W. M. Schmidt"
-, title =	"Integer points on curves and surfaces"
-, journal =	"Monatsh. Math."
-, volume =	99
-, year =	1985
-, pages =	"45--72"
-, update =	"97.11 bibrelex"
+, author =      "W. M. Schmidt"
+, title =       "Integer points on curves and surfaces"
+, journal =     "Monatsh. Math."
+, volume =      99
+, year =        1985
+, pages =       "45--72"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-id7-72
-, author =	"W. M. Schmidt"
-, title =	"Irregularities of distribution VII"
-, journal =	"Acta Arithmetica"
-, volume =	21
-, year =	1972
-, pages =	"45--50"
-, update =	"98.03 bibrelex"
+, author =      "W. M. Schmidt"
+, title =       "Irregularities of distribution VII"
+, journal =     "Acta Arithmetica"
+, volume =      21
+, year =        1972
+, pages =       "45--50"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{s-tscce-81
-, author =	"A. Schmitt"
-, title =	"On the time and space complexity of certain exact hidden line algorithms"
-, type =	"Report"
-, number =	"24/81"
-, institution =	"Fakult{\"a}t Inform., Univ. Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1981
+, author =      "A. Schmitt"
+, title =       "On the time and space complexity of certain exact hidden line algorithms"
+, type =        "Report"
+, number =      "24/81"
+, institution = "Fakult{\"a}t Inform., Univ. Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1981
 }
 
 @techreport{s-rgiah-81
-, author =	"A. Schmitt"
-, title =	"Reporting geometric inclusions with an application to the hidden line problem"
-, type =	"Report"
-, number =	"18/81"
-, institution =	"Univ. Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1981
+, author =      "A. Schmitt"
+, title =       "Reporting geometric inclusions with an application to the hidden line problem"
+, type =        "Report"
+, number =      "18/81"
+, institution = "Univ. Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1981
 }
 
 @inproceedings{s-tsbhl-81
-, author =	"A. Schmitt"
-, title =	"Time and space bounds for hidden line and hidden surface algorithms"
-, booktitle =	"Proc. Eurographics 81"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1981
-, pages =	"43--56"
-, update =	"97.11 bibrelex, 93.05 smid"
+, author =      "A. Schmitt"
+, title =       "Time and space bounds for hidden line and hidden surface algorithms"
+, booktitle =   "Proc. Eurographics 81"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1981
+, pages =       "43--56"
+, update =      "97.11 bibrelex, 93.05 smid"
 }
 
 @book{sdk-egga-96
-, author =	"A. Schmitt and O. Deussen and M. Kreeb"
-, title =	"Einf{\"u}hrung in graphisch-geometrische {Algorithmen}"
-, publisher =	"B. G. Teubner"
-, address =	"Stuttgart"
-, year =	1996
-, keywords =	"textbook, in German"
-, update =	"99.11 bibrelex, 97.03 smid"
+, author =      "A. Schmitt and O. Deussen and M. Kreeb"
+, title =       "Einf{\"u}hrung in graphisch-geometrische {Algorithmen}"
+, publisher =   "B. G. Teubner"
+, address =     "Stuttgart"
+, year =        1996
+, keywords =    "textbook, in German"
+, update =      "99.11 bibrelex, 97.03 smid"
 }
 
 @proceedings{sm-iwcg-85
-, title =	"Abstracts 3rd Intern. Workshop Comput. Geom."
-, editor =	"A. Schmitt and H. M{\"u}ller"
-, nickname =	"CG '85"
-, site =	"Karlsruhe"
-, publisher =	"Universit{\"a}t Karlsruhe"
-, year =	1985
-, update =	"00.03 bibrelex"
+, title =       "Abstracts 3rd Intern. Workshop Comput. Geom."
+, editor =      "A. Schmitt and H. M{\"u}ller"
+, nickname =    "CG '85"
+, site =        "Karlsruhe"
+, publisher =   "Universit{\"a}t Karlsruhe"
+, year =        1985
+, update =      "00.03 bibrelex"
 }
 
 @incollection{sml-rtatp-88
-, author =	"A. Schmitt and H. M{\"u}ller and W. Leister"
-, title =	"Ray tracing algorithms: theory and practice"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"997--1030"
-, keywords =	"ray tracing, implementing algorithms, survey paper"
-, update =	"99.11 bibrelex"
+, author =      "A. Schmitt and H. M{\"u}ller and W. Leister"
+, title =       "Ray tracing algorithms: theory and practice"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "997--1030"
+, keywords =    "ray tracing, implementing algorithms, survey paper"
+, update =      "99.11 bibrelex"
 }
 
 @inproceedings{ss-dvdok-91
-, author =	"D. Schmitt and J.-C. Spehner"
-, title =	"On {Delaunay} and {Voronoi} diagrams of order $k$ in the plane"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, year =	1991
-, pages =	"29--32"
-, cites =	"agss-ltacv-89, a-ndrcv-90, bt-hrodt-86, bdt-dchov-90, ce-iacko-87, e-esaa-86, eos-calha-86, es-cvdpu-90, l-knnvd-82, sh-cpp-75, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "D. Schmitt and J.-C. Spehner"
+, title =       "On {Delaunay} and {Voronoi} diagrams of order $k$ in the plane"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, year =        1991
+, pages =       "29--32"
+, cites =       "agss-ltacv-89, a-ndrcv-90, bt-hrodt-86, bdt-dchov-90, ce-iacko-87, e-esaa-86, eos-calha-86, es-cvdpu-90, l-knnvd-82, sh-cpp-75, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ss-edded-93
-, author =	"D. Schmitt and J.-C. Spehner"
-, title =	"On equiangularity of {Delaunay} diagrams in every dimension"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"346--351"
-, cites =	"a-vdsfg-91, e-acg-87, ms-getcc-88, ps-cgi-85, r-odtr-91, s-let-78, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "D. Schmitt and J.-C. Spehner"
+, title =       "On equiangularity of {Delaunay} diagrams in every dimension"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "346--351"
+, cites =       "a-vdsfg-91, e-acg-87, ms-getcc-88, ps-cgi-85, r-odtr-91, s-let-78, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{sg-apads-85
-, author =	"F. Schmitt and B. Gholizadeh"
-, title =	"Adaptive Polyhedral Approximation of Digitized Surfaces"
-, booktitle =	"Proc. SPIE Conf. on Comput. Vision ind Robots"
-, site =	"Bellingham, Walsh"
-, volume =	595
-, year =	1985
-, pages =	"167--171"
-, update =	"98.11 bibrelex"
+, author =      "F. Schmitt and B. Gholizadeh"
+, title =       "Adaptive Polyhedral Approximation of Digitized Surfaces"
+, booktitle =   "Proc. SPIE Conf. on Comput. Vision ind Robots"
+, site =        "Bellingham, Walsh"
+, volume =      595
+, year =        1985
+, pages =       "167--171"
+, update =      "98.11 bibrelex"
 }
 
 @article{sbd-asmsf-86
-, author =	"F. J. Schmitt and B. A. Barsky and W. Du"
-, title =	"An Adaptive Subdivision Method for Surface-fitting from Sampled Data"
-, journal =	"Comput. Graph."
-, volume =	20
-, number =	4
-, year =	1986
-, pages =	"179--188"
-, note =	"Proc. SIGGRAPH '86"
-, update =	"96.09 devillers, 95.01 mitchell"
+, author =      "F. J. Schmitt and B. A. Barsky and W. Du"
+, title =       "An Adaptive Subdivision Method for Surface-fitting from Sampled Data"
+, journal =     "Comput. Graph."
+, volume =      20
+, number =      4
+, year =        1986
+, pages =       "179--188"
+, note =        "Proc. SIGGRAPH '86"
+, update =      "96.09 devillers, 95.01 mitchell"
 }
 
 @inproceedings{s-seaac-89
-, author =	"Michel Schmitt"
-, title =	"Some examples of Algorithms Analysis in Computational Geometry by Means of Mathematical Morphological Techniques"
-, editor =	"J.-D. Boissonnat and J.-P. Laumond"
-, booktitle =	"Proc. of the Workshop on Geometry and Robotics"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	391
-, publisher =	"Springer-Verlag"
-, year =	1989
-, update =	"00.03 devillers"
+, author =      "Michel Schmitt"
+, title =       "Some examples of Algorithms Analysis in Computational Geometry by Means of Mathematical Morphological Techniques"
+, editor =      "J.-D. Boissonnat and J.-P. Laumond"
+, booktitle =   "Proc. of the Workshop on Geometry and Robotics"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      391
+, publisher =   "Springer-Verlag"
+, year =        1989
+, update =      "00.03 devillers"
 }
 
 @article{s-dspdp-91
-, author =	"P. Schmitt"
-, title =	"Disks with special properties of densest packings"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"181--190"
+, author =      "P. Schmitt"
+, title =       "Disks with special properties of densest packings"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "181--190"
 }
 
 @article{s-smsp-87
-, author =	"P. Schmitt"
-, title =	"$\sigma$-morphic sets of prototiles"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"271--295"
+, author =      "P. Schmitt"
+, title =       "$\sigma$-morphic sets of prototiles"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "271--295"
 }
 
 @book{sb-mla-89
-, author =	"H. Schneider and G. P. Barker"
-, title =	"Matrices and Linear Algebra"
-, publisher =	"Dover Publ."
-, year =	1989
-, update =	"98.11 bibrelex"
+, author =      "H. Schneider and G. P. Barker"
+, title =       "Matrices and Linear Algebra"
+, publisher =   "Dover Publ."
+, year =        1989
+, update =      "98.11 bibrelex"
 }
 
 @book{s-cbbmt-93
-, author =	"R. Schneider"
-, title =	"Convex bodies: {The} {Brunn}-{Minkowski} theory"
-, series =	"Encyclopedia of Mathematics and its Applications"
-, volume =	44
-, publisher =	"Cambridge University Press"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "R. Schneider"
+, title =       "Convex bodies: {The} {Brunn}-{Minkowski} theory"
+, series =      "Encyclopedia of Mathematics and its Applications"
+, volume =      44
+, publisher =   "Cambridge University Press"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @incollection{s-dasg-97
-, author =	"R. Schneider"
-, title =	"Discrete aspects of stochastic geometry"
-, chapter =	9
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"167--184"
-, update =	"97.11 orourke"
+, author =      "R. Schneider"
+, title =       "Discrete aspects of stochastic geometry"
+, chapter =     9
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "167--184"
+, update =      "97.11 orourke"
 }
 
 @article{s-kkk-72
-, author =	"R. Schneider"
-, title =	"Kr{\"u}mmungsschwerpunkte konvexer {K{\"o}rper}"
-, journal =	"Abh. Math. Sem. Hamburg"
-, volume =	37
-, year =	1972
-, pages =	"112--132"
-, update =	"98.03 bibrelex"
+, author =      "R. Schneider"
+, title =       "Kr{\"u}mmungsschwerpunkte konvexer {K{\"o}rper}"
+, journal =     "Abh. Math. Sem. Hamburg"
+, volume =      37
+, year =        1972
+, pages =       "112--132"
+, update =      "98.03 bibrelex"
 }
 
 @article{s-racs-88
-, author =	"R. Schneider"
-, title =	"Random approximation of convex sets"
-, journal =	"Microscopy"
-, volume =	151
-, year =	1988
-, pages =	"211--227"
-, update =	"97.11 bibrelex"
+, author =      "R. Schneider"
+, title =       "Random approximation of convex sets"
+, journal =     "Microscopy"
+, volume =      151
+, year =        1988
+, pages =       "211--227"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-tgh-87
-, author =	"R. Schneider"
-, title =	"Tessellations generated by hyperplanes"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"223--232"
+, author =      "R. Schneider"
+, title =       "Tessellations generated by hyperplanes"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "223--232"
 }
 
 @inproceedings{sk-ttnrp-91
-, author =	"Ralf Schneider and Hans-Peter Kriegel"
-, title =	"The {TR*}-tree: A new representation of polygonal objects supporting spatial queries and operations"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"249--263"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Ralf Schneider and Hans-Peter Kriegel"
+, title =       "The {TR*}-tree: A new representation of polygonal objects supporting spatial queries and operations"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "249--263"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{s-aghfe-95
-, author =	"Robert Schneiders"
-, title =	"Automatic Generation of Hexahedral Finite Element Meshes"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"103--114"
-, update =	"96.01 samitchell"
+, author =      "Robert Schneiders"
+, title =       "Automatic Generation of Hexahedral Finite Element Meshes"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "103--114"
+, update =      "96.01 samitchell"
 }
 
 @misc{s-op-
-, author =	"R. Schneiders"
-, title =	"Open problem"
-, url =	"http://www-users.informatik.rwth-aachen.de/~roberts/open.html"
-, update =	"97.11 bibrelex"
+, author =      "R. Schneiders"
+, title =       "Open problem"
+, url = "http://www-users.informatik.rwth-aachen.de/~roberts/open.html"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ssw-obghe-96
-, author =	"R. Schneiders and R. Schindler and F. Weiler"
-, title =	"Octree-based generation of hexahedral element meshes"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"205--215"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "R. Schneiders and R. Schindler and F. Weiler"
+, title =       "Octree-based generation of hexahedral element meshes"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "205--215"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @inproceedings{s-epgg-90
-, author =	"W. Schnyder"
-, title =	"Embedding Planar Graphs on the Grid"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"138--148"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "W. Schnyder"
+, title =       "Embedding Planar Graphs on the Grid"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "138--148"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{s-pgpd-89
-, author =	"W. Schnyder"
-, title =	"Planar Graphs and Poset Dimension"
-, journal =	"Order"
-, volume =	5
-, year =	1989
-, pages =	"323--343"
-, keywords =	"graph drawing, convex polytope, order dimension"
-, update =	"95.05 tamassia"
+, author =      "W. Schnyder"
+, title =       "Planar Graphs and Poset Dimension"
+, journal =     "Order"
+, volume =      5
+, year =        1989
+, pages =       "323--343"
+, keywords =    "graph drawing, convex polytope, order dimension"
+, update =      "95.05 tamassia"
 }
 
 @article{st-ce3cp-92
-, author =	"W. Schnyder and W. T. Trotter"
-, title =	"Convex Embeddings of 3-Connected Plane Graphs"
-, journal =	"Abstracts of the AMS"
-, volume =	13
-, number =	5
-, year =	1992
-, pages =	502
-, keywords =	"graph drawing, planar, convex, straight-line"
-, update =	"98.07 tamassia+vismara, 96.09 tamassia"
+, author =      "W. Schnyder and W. T. Trotter"
+, title =       "Convex Embeddings of 3-Connected Plane Graphs"
+, journal =     "Abstracts of the AMS"
+, volume =      13
+, number =      5
+, year =        1992
+, pages =       502
+, keywords =    "graph drawing, planar, convex, straight-line"
+, update =      "98.07 tamassia+vismara, 96.09 tamassia"
 }
 
 @article{s-npscf-91
-, author =	"T. Sch{\"o}bel"
-, title =	"A new parsing strategy for context free grammars"
-, journal =	"Algorithms Rev."
-, volume =	2
-, number =	2
-, year =	1991
-, pages =	"63--76"
+, author =      "T. Sch{\"o}bel"
+, title =       "A new parsing strategy for context free grammars"
+, journal =     "Algorithms Rev."
+, volume =      2
+, number =      2
+, year =        1991
+, pages =       "63--76"
 }
 
 @inproceedings{s-dcamv-86
-, author =	"A. H. Schoen"
-, title =	"A defect-correction algorithm for minimizing the volume of a simple polyhedron which circumscribes a sphere"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"159--168"
-, cites =	"bh-vpius-70, bs-dcmta-84, g-ipp-35, gp-taafp-86, g-cp-67, k-vmafs-72, l-rmctf-82, mks-eapuc-77, m-aludk-97, s-pur-22, s-uipkp-27, wwv-oasdt-85, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "A. H. Schoen"
+, title =       "A defect-correction algorithm for minimizing the volume of a simple polyhedron which circumscribes a sphere"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "159--168"
+, cites =       "bh-vpius-70, bs-dcmta-84, g-ipp-35, gp-taafp-86, g-cp-67, k-vmafs-72, l-rmctf-82, mks-eapuc-77, m-aludk-97, s-pur-22, s-uipkp-27, wwv-oasdt-85, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{sz-clccp-67
-, author =	"I. J. Schoenberg and S. K. Zaremba"
-, title =	"On {Cauchy}'s lemma concerning convex polygons"
-, journal =	"Canad. J. Math."
-, volume =	19
-, year =	1967
-, pages =	"1062--1077"
-, update =	"00.11 smid, 00.07 orourke"
+, author =      "I. J. Schoenberg and S. K. Zaremba"
+, title =       "On {Cauchy}'s lemma concerning convex polygons"
+, journal =     "Canad. J. Math."
+, volume =      19
+, year =        1967
+, pages =       "1062--1077"
+, update =      "00.11 smid, 00.07 orourke"
 }
 
 @book{ss-gisur-90
-, title =	"Geographical Information Systems for Urban and Regional Planning"
-, editor =	"H. J. Scholten and J. C. H. Stillwell"
-, publisher =	"Kluwer Academic Publishers"
-, address =	"the Netherlands"
-, year =	1990
-, update =	"96.09 kreveld"
+, title =       "Geographical Information Systems for Urban and Regional Planning"
+, editor =      "H. J. Scholten and J. C. H. Stillwell"
+, publisher =   "Kluwer Academic Publishers"
+, address =     "the Netherlands"
+, year =        1990
+, update =      "96.09 kreveld"
 }
 
 @article{so-gmarr-89
-, author =	"H. W. Scholten and M. H. Overmars"
-, title =	"General methods for adding range restrictions to decomposable searching problems"
-, journal =	"J. Symbolic Comput."
-, volume =	7
-, year =	1989
-, pages =	"1--10"
+, author =      "H. W. Scholten and M. H. Overmars"
+, title =       "General methods for adding range restrictions to decomposable searching problems"
+, journal =     "J. Symbolic Comput."
+, volume =      7
+, year =        1989
+, pages =       "1--10"
 }
 
 @phdthesis{s-immk-94
-, author =	"E. Sch{\"o}mer"
-, title =	"Interaktive {Montagesimulation} mit {Kollisionserkennung}"
-, school =	"Universit{\"a}t des Saarlandes"
-, address =	"Saarbr{\"u}cken, Germanyy"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "E. Sch{\"o}mer"
+, title =       "Interaktive {Montagesimulation} mit {Kollisionserkennung}"
+, school =      "Universit{\"a}t des Saarlandes"
+, address =     "Saarbr{\"u}cken, Germanyy"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ssty-easec-96
-, author =	"E. Sch{\"o}mer and J. Sellen and M. Teichmann and C. Yap"
-, title =	"Efficient algorithms for the smallest enclosing cylinder problem"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"264--269"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "E. Sch{\"o}mer and J. Sellen and M. Teichmann and C. Yap"
+, title =       "Efficient algorithms for the smallest enclosing cylinder problem"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "264--269"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @techreport{ssty-sec-96t
-, author =	"Elmar Sch{\"o}mer and Jurgen Sellen and Marek Teichmann and Chee Yap"
-, title =	"Smallest Enclosing Cylinders"
-, type =	"Technical {Report}"
-, institution =	"Courant Institute, New York University"
-, year =	1996
-, url =	"https://cs.nyu.edu/"
-, update =	"97.11 bibrelex"
+, author =      "Elmar Sch{\"o}mer and Jurgen Sellen and Marek Teichmann and Chee Yap"
+, title =       "Smallest Enclosing Cylinders"
+, type =        "Technical {Report}"
+, institution = "Courant Institute, New York University"
+, year =        1996
+, url = "https://cs.nyu.edu/"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ssty-sec-96
-, author =	"Elmar Sch{\"o}mer and Jurgen Sellen and Marek Teichmann and Chee Yap"
-, title =	"Smallest Enclosing Cylinders"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"C13--C14"
-, cites =	"agr-pahdc-94, am-rsss-94, m-apcad-83, ptvf-nrc-88, ssty-sec-96t, y-ecgtm-95, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Elmar Sch{\"o}mer and Jurgen Sellen and Marek Teichmann and Chee Yap"
+, title =       "Smallest Enclosing Cylinders"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "C13--C14"
+, cites =       "agr-pahdc-94, am-rsss-94, m-apcad-83, ptvf-nrc-88, ssty-sec-96t, y-ecgtm-95, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @article{ssty-sec-00
-, author =	"E. Sch{\"o}mer and J. Sellen and M. Teichmann and C. K. Yap"
-, title =	"Smallest Enclosing Cylinders"
-, journal =	"Algorithmica"
-, volume =	27
-, number =	2
-, year =	2000
-, pages =	"170--186"
-, update =	"00.11 smid, 00.07 held"
+, author =      "E. Sch{\"o}mer and J. Sellen and M. Teichmann and C. K. Yap"
+, title =       "Smallest Enclosing Cylinders"
+, journal =     "Algorithmica"
+, volume =      27
+, number =      2
+, year =        2000
+, pages =       "170--186"
+, update =      "00.11 smid, 00.07 held"
 }
 
 @inproceedings{ssw-egcd-95
-, author =	"Elmar Sch{\"o}mer and J{\"u}rgen Sellen and Markus Welsch"
-, title =	"Exact Geometric Collision Detection"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"211--216"
-, update =	"95.09 jones"
+, author =      "Elmar Sch{\"o}mer and J{\"u}rgen Sellen and Markus Welsch"
+, title =       "Exact Geometric Collision Detection"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "211--216"
+, update =      "95.09 jones"
 }
 
 @techreport{st-ecdmp-94
-, author =	"E. Sch{\"o}mer and C. Thiel"
-, title =	"Efficient collision detection for moving polyhedra"
-, type =	"Report"
-, number =	"MPI-I-94-147"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, update =	"95.01 smid"
+, author =      "E. Sch{\"o}mer and C. Thiel"
+, title =       "Efficient collision detection for moving polyhedra"
+, type =        "Report"
+, number =      "MPI-I-94-147"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, update =      "95.01 smid"
 }
 
 @inproceedings{st-ecdmp-95
-, author =	"Elmar Sch{\"o}mer and Christian Thiel"
-, title =	"Efficient Collision Detection for Moving Polyhedra"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"51--60"
-, keywords =	"intersection detection, linearization, range queries, parametric search, Plucker coordinates"
-, cites =	"am-rsss-92, am-rsps-92, aps-zsha-93, b-idss-79, dk-ladsc-85, c-dcbp-84, dk-dsppu-90, dhks-isccd-90, k-nrdsc-92, m-rsehc-91, m-apcad-83, n-flsah-85, p-crz-91, p-innpl-92, p-rst3s-93, ps-cgi-85, s-immk-94, us-hmsss-92, yy-gaddg-85, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Elmar Sch{\"o}mer and Christian Thiel"
+, title =       "Efficient Collision Detection for Moving Polyhedra"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "51--60"
+, keywords =    "intersection detection, linearization, range queries, parametric search, Plucker coordinates"
+, cites =       "am-rsss-92, am-rsps-92, aps-zsha-93, b-idss-79, dk-ladsc-85, c-dcbp-84, dk-dsppu-90, dhks-isccd-90, k-nrdsc-92, m-rsehc-91, m-apcad-83, n-flsah-85, p-crz-91, p-innpl-92, p-rst3s-93, ps-cgi-85, s-immk-94, us-hmsss-92, yy-gaddg-85, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{st-sagcd-96
-, author =	"Elmar Sch{\"o}mer and Christian Thiel"
-, title =	"Subquadratic Algorithms for the General Collision Detection Problem"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"95--101"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Elmar Sch{\"o}mer and Christian Thiel"
+, title =       "Subquadratic Algorithms for the General Collision Detection Problem"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "95--101"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @techreport{s-ftatc-82
-, author =	"A. Sch{\"o}nhage"
-, title =	"The fundamental theorem of algebra in terms of computational complexity"
-, institution =	"Univ. T{\"u}bingen"
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "A. Sch{\"o}nhage"
+, title =       "The fundamental theorem of algebra in terms of computational complexity"
+, institution = "Univ. T{\"u}bingen"
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @article{spp-fm-76
-, author =	"A. Sch{\"o}nhage and M. Paterson and N. Pipinger"
-, title =	"Finding the median"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	13
-, year =	1976
-, pages =	"184--199"
-, update =	"97.11 bibrelex"
+, author =      "A. Sch{\"o}nhage and M. Paterson and N. Pipinger"
+, title =       "Finding the median"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      13
+, year =        1976
+, pages =       "184--199"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-udzvd-28
-, author =	"E. Sch{\"o}nhardt"
-, title =	"{\"U}ber die {Zerlegung} von {Dreieckspolyedern} in {Tetraeder}"
-, journal =	"Math. Ann."
-, volume =	98
-, year =	1928
-, pages =	"309--312"
-, update =	"97.11 bibrelex"
+, author =      "E. Sch{\"o}nhardt"
+, title =       "{\"U}ber die {Zerlegung} von {Dreieckspolyedern} in {Tetraeder}"
+, journal =     "Math. Ann."
+, volume =      98
+, year =        1928
+, pages =       "309--312"
+, update =      "97.11 bibrelex"
 }
 
 @mastersthesis{s-bkeup-94
-, author =	"S. Sch{\"o}nherr"
-, title =	"Berechnung kleinster {Ellipsoide} um {Punktmengen}"
-, school =	"Free University Berlin"
-, address =	"Berlin, Germany"
-, year =	1994
-, note =	"Diploma Thesis"
-, keywords =	"master thesis"
-, update =	"98.07 bibrelex"
+, author =      "S. Sch{\"o}nherr"
+, title =       "Berechnung kleinster {Ellipsoide} um {Punktmengen}"
+, school =      "Free University Berlin"
+, address =     "Berlin, Germany"
+, year =        1994
+, note =        "Diploma Thesis"
+, keywords =    "master thesis"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{sl-tssp-80
-, author =	"Anneke A. Schoone and J. van Leeuwen"
-, title =	"Triangulating a star-shaped polygon"
-, type =	"Report"
-, number =	"RUU-CS-80-3"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1980
-, update =	"94.05 schwarzkopf, 93.09 rote+smid"
+, author =      "Anneke A. Schoone and J. van Leeuwen"
+, title =       "Triangulating a star-shaped polygon"
+, type =        "Report"
+, number =      "RUU-CS-80-3"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1980
+, update =      "94.05 schwarzkopf, 93.09 rote+smid"
 }
 
 @inproceedings{s-adgc-90
-, author =	"Peter Schorn"
-, title =	"Accuracy and Degeneracy in Geometric Computation"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	22
-, update =	"00.03 bibrelex"
+, author =      "Peter Schorn"
+, title =       "Accuracy and Degeneracy in Geometric Computation"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       22
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{s-aeapp-90
-, author =	"P. Schorn"
-, title =	"Accurate and efficient algorithms for proximity problems"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"24--27"
-, cites =	"gy-frcg-86, h-pargc-89, hns-psscp-88, hns-arsa2-92, m-vigau-88t, m-dpggt-89, gss-egbra-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. Schorn"
+, title =       "Accurate and efficient algorithms for proximity problems"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "24--27"
+, cites =       "gy-frcg-86, h-pargc-89, hns-psscp-88, hns-arsa2-92, m-vigau-88t, m-dpggt-89, gss-egbra-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-ooweg-90
-, author =	"P. Schorn"
-, title =	"An object-oriented workbench for experimental geometric computation"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"172--175"
-, cites =	"f-savd-87, g-pacpa-88, hns-psscp-88, mn-lledt-89, ps-cgi-85, r-pa-76, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. Schorn"
+, title =       "An object-oriented workbench for experimental geometric computation"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "172--175"
+, cites =       "f-savd-87, g-pacpa-88, hns-psscp-88, mn-lledt-89, ps-cgi-85, r-pa-76, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-ixgpe-91
-, author =	"Peter Schorn"
-, title =	"Implementing the {XYZ} {GeoBench}: A programming environment for geometric algorithms"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"187--202"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Peter Schorn"
+, title =       "Implementing the {XYZ} {GeoBench}: A programming environment for geometric algorithms"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "187--202"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @phdthesis{s-raplg-91t
-, author =	"P. Schorn"
-, title =	"Robust algorithms in a program library for geometric computation"
-, type =	"Ph.{D}. Thesis"
-, school =	"ETH Z{\"u}rich, Switzerland"
-, year =	1991
-, note =	"Report 9519"
-, keywords =	"doctoral thesis"
-, precedes =	"s-raplg-91"
-, update =	"98.11 bibrelex"
+, author =      "P. Schorn"
+, title =       "Robust algorithms in a program library for geometric computation"
+, type =        "Ph.{D}. Thesis"
+, school =      "ETH Z{\"u}rich, Switzerland"
+, year =        1991
+, note =        "Report 9519"
+, keywords =    "doctoral thesis"
+, precedes =    "s-raplg-91"
+, update =      "98.11 bibrelex"
 }
 
 @book{s-raplg-91
-, author =	"P. Schorn"
-, title =	"Robust Algorithms in a Program Library for Geometric Computation"
-, series =	"Informatik-Dissertationen ETH Z{\"u}rich"
-, volume =	32
-, publisher =	"Verlag der Fachvereine"
-, address =	"Z{\"u}rich"
-, year =	1991
-, succeeds =	"s-raplg-91t"
-, update =	"98.11 bibrelex, 97.03 icking"
+, author =      "P. Schorn"
+, title =       "Robust Algorithms in a Program Library for Geometric Computation"
+, series =      "Informatik-Dissertationen ETH Z{\"u}rich"
+, volume =      32
+, publisher =   "Verlag der Fachvereine"
+, address =     "Z{\"u}rich"
+, year =        1991
+, succeeds =    "s-raplg-91t"
+, update =      "98.11 bibrelex, 97.03 icking"
 }
 
 @incollection{sf-tcp-94
-, author =	"Peter Schorn and Frederick Fisher"
-, title =	"Testing the Convexity of a Polygon"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"7--15"
-, keywords =	"computational geometry, concave polygon"
-, update =	"94.09 heckbert"
-, annote =	"Gives an algorithm and code to determine if a polygon is
+, author =      "Peter Schorn and Frederick Fisher"
+, title =       "Testing the Convexity of a Polygon"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "7--15"
+, keywords =    "computational geometry, concave polygon"
+, update =      "94.09 heckbert"
+, annote =      "Gives an algorithm and code to determine if a polygon is
 convex, non-convex (concave but not convex), or non-simple
 (self-intersecting). For many polygon operations, faster algorithms can be
 used if the polygon is known to be convex. This is true when scan converting
@@ -128836,2318 +128836,2318 @@ @incollection{sf-tcp-94
 }
 
 @article{s-acspt-83
-, author =	"Schrader"
-, title =	"Approximations of clustering and subgraph problems on trees"
-, journal =	"Discrete Appl. Math."
-, volume =	6
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "Schrader"
+, title =       "Approximations of clustering and subgraph problems on trees"
+, journal =     "Discrete Appl. Math."
+, volume =      6
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @techreport{s-hce-90
-, author =	"O. Schramm"
-, title =	"How to Cage an Egg"
-, type =	"Technical {Report}"
-, institution =	"Univ. of California, San Diego"
-, year =	1990
-, keywords =	"circumscribe, inscribe, packing, circle packing, convex, Cauchy Lemma, rigidity"
-, update =	"93.09 milone+mitchell"
+, author =      "O. Schramm"
+, title =       "How to Cage an Egg"
+, type =        "Technical {Report}"
+, institution = "Univ. of California, San Diego"
+, year =        1990
+, keywords =    "circumscribe, inscribe, packing, circle packing, convex, Cauchy Lemma, rigidity"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{s-ptdbp-??
-, author =	"O. Schramm"
-, title =	"Packing two-dimensional bodies with prescribed combinatorics and applications to the construction of conformal and Quasiconformal mappings"
-, type =	"Technical {Report}"
-, institution =	"Univ. of California, San Diego"
-, year =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "O. Schramm"
+, title =       "Packing two-dimensional bodies with prescribed combinatorics and applications to the construction of conformal and Quasiconformal mappings"
+, type =        "Technical {Report}"
+, institution = "Univ. of California, San Diego"
+, year =        "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{s-vdbak-91
-, author =	"Thomas Schreiber"
-, title =	"A {Voronoi} diagram based adaptive $k$-means-type clustering algorithm for multidimensional weighted data"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"265--275"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Thomas Schreiber"
+, title =       "A {Voronoi} diagram based adaptive $k$-means-type clustering algorithm for multidimensional weighted data"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "265--275"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{s-pa3do-97
-, author =	"Thomas Schreiber"
-, title =	"Polyhedral Approximation of 3D Objects from Scattered Boundary Points"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"43--44"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Thomas Schreiber"
+, title =       "Polyhedral Approximation of 3D Objects from Scattered Boundary Points"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "43--44"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{s-dhptp-91
-, author =	"A. Schrijver"
-, title =	"Disjoint homotopic paths and trees in a planar graph"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"527--574"
+, author =      "A. Schrijver"
+, title =       "Disjoint homotopic paths and trees in a planar graph"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "527--574"
 }
 
 @techreport{s-pccfc-??
-, author =	"A. Schrijver"
-, title =	"Packing and covering of crossing families of cuts"
-, institution =	"Instituut voor Actuariaat en Econometrie"
-, address =	"Amsterdam, Holland"
-, year =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "A. Schrijver"
+, title =       "Packing and covering of crossing families of cuts"
+, institution = "Instituut voor Actuariaat en Econometrie"
+, address =     "Amsterdam, Holland"
+, year =        "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @book{s-tlip-86
-, author =	"A. Schrijver"
-, title =	"Theory of Linear and Integer Programming"
-, publisher =	"Wiley-Interscience"
-, address =	"New York, NY"
-, year =	1986
-, update =	"97.03 schwarzkopf, 93.09 milone+mitchell"
+, author =      "A. Schrijver"
+, title =       "Theory of Linear and Integer Programming"
+, publisher =   "Wiley-Interscience"
+, address =     "New York, NY"
+, year =        1986
+, update =      "97.03 schwarzkopf, 93.09 milone+mitchell"
 }
 
 @article{sh-ffbtp-93
-, author =	"P. Schr{\"o}der and P. Hanrahan"
-, title =	"On the form factor between two polygons"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1993
-, pages =	"163--164"
-, note =	"Proc. SIGGRAPH '93"
-, update =	"98.03 bibrelex"
+, author =      "P. Schr{\"o}der and P. Hanrahan"
+, title =       "On the form factor between two polygons"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1993
+, pages =       "163--164"
+, note =        "Proc. SIGGRAPH '93"
+, update =      "98.03 bibrelex"
 }
 
 @article{ss-codmf-90
-, author =	"W. J. Schroeder and M. S. Shephard"
-, title =	"A Combined Octree {Delaunay} Method for Fully-Automatic 3-{D} Mesh Generation"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	29
-, number =	1
-, year =	1990
-, pages =	"37--55"
-, annote =	"Basically octree is used to generate nodes and
-		 Delaunay triangulation of these nodes is created."
+, author =      "W. J. Schroeder and M. S. Shephard"
+, title =       "A Combined Octree {Delaunay} Method for Fully-Automatic 3-{D} Mesh Generation"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      29
+, number =      1
+, year =        1990
+, pages =       "37--55"
+, annote =      "Basically octree is used to generate nodes and
+                 Delaunay triangulation of these nodes is created."
 }
 
 @article{ss-gbfam-88
-, author =	"W. J. Schroeder and M. S. Shephard"
-, title =	"Geometry-Based Fully-Automatic Mesh Generation and the {Delaunay} Triangulation"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	26
-, number =	11
-, year =	1988
-, pages =	"2503--2515"
-, annote =	"Adds extra points to satisfy constrained edges."
+, author =      "W. J. Schroeder and M. S. Shephard"
+, title =       "Geometry-Based Fully-Automatic Mesh Generation and the {Delaunay} Triangulation"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      26
+, number =      11
+, year =        1988
+, pages =       "2503--2515"
+, annote =      "Adds extra points to satisfy constrained edges."
 }
 
 @article{ss-oaagg-89
-, author =	"W. J. Schroeder and M. S. Shephard"
-, title =	"${O}({N})$ Algorithm To Automatically Generate Geometric Triangulations Satisfying The {Delaunay} Circumsphere Criteria"
-, journal =	"Eng. Comput. (USA)"
-, volume =	5
-, number =	"3--4"
-, year =	1989
-, pages =	"177--193"
-, keywords =	"geometric triangulations, Delaunay circumsphere criteria"
-, update =	"00.11 smid, 00.07 icking, 96.09 devillers"
-, annote =	"Generates points in an octree."
-, abstract =	"This paper presents an algorithm for the generation of
-		 Delaunay triangulations for general nonmanifold
-		 geometric models. Octree concepts are used for point
-		 placement and providing the linear, with respect to the
-		 number of elements, growth rate of the algorithm.
-		 Compatibility and classification procedures are used in
-		 conjunction with point injection procedures to ensure
-		 that the final Delaunay triangulation is a geometric
-		 triangulation of the domain of interest. (Author
-		 abstract) 23 Refs."
+, author =      "W. J. Schroeder and M. S. Shephard"
+, title =       "${O}({N})$ Algorithm To Automatically Generate Geometric Triangulations Satisfying The {Delaunay} Circumsphere Criteria"
+, journal =     "Eng. Comput. (USA)"
+, volume =      5
+, number =      "3--4"
+, year =        1989
+, pages =       "177--193"
+, keywords =    "geometric triangulations, Delaunay circumsphere criteria"
+, update =      "00.11 smid, 00.07 icking, 96.09 devillers"
+, annote =      "Generates points in an octree."
+, abstract =    "This paper presents an algorithm for the generation of
+                 Delaunay triangulations for general nonmanifold
+                 geometric models. Octree concepts are used for point
+                 placement and providing the linear, with respect to the
+                 number of elements, growth rate of the algorithm.
+                 Compatibility and classification procedures are used in
+                 conjunction with point injection procedures to ensure
+                 that the final Delaunay triangulation is a geometric
+                 triangulation of the domain of interest. (Author
+                 abstract) 23 Refs."
 }
 
 @article{szl-dtm-92
-, author =	"W. J. Schroeder and J. A. Zarge and W. E. Lorensen"
-, title =	"Decimation of Triangle Meshes"
-, journal =	"Comput. Graph."
-, volume =	26
-, number =	2
-, year =	1992
-, pages =	"65--70"
-, note =	"Proc. SIGGRAPH '92"
-, keywords =	"geometric modeling, medical imaging, terrain modeling, volume modeling"
-, update =	"93.09 milone+mitchell"
+, author =      "W. J. Schroeder and J. A. Zarge and W. E. Lorensen"
+, title =       "Decimation of Triangle Meshes"
+, journal =     "Comput. Graph."
+, volume =      26
+, number =      2
+, year =        1992
+, pages =       "65--70"
+, note =        "Proc. SIGGRAPH '92"
+, keywords =    "geometric modeling, medical imaging, terrain modeling, volume modeling"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{sb-hismd-94
-, author =	"P. Schroeter and J. Big{\"u}n"
-, title =	"Hierarchical Image Segmentation by Multi-Dimensional Clustering and Orientation-Adaptive Boundary Refinement"
-, journal =	"Pattern Recogn."
-, volume =	28
-, number =	5
-, year =	1995
-, pages =	"695--709"
-, keywords =	"hierarchical image segmentation, multi-dimensional clustering"
-, update =	"98.07 agarwal"
+, author =      "P. Schroeter and J. Big{\"u}n"
+, title =       "Hierarchical Image Segmentation by Multi-Dimensional Clustering and Orientation-Adaptive Boundary Refinement"
+, journal =     "Pattern Recogn."
+, volume =      28
+, number =      5
+, year =        1995
+, pages =       "695--709"
+, keywords =    "hierarchical image segmentation, multi-dimensional clustering"
+, update =      "98.07 agarwal"
 }
 
 @article{s-bdpvv-61
-, author =	"H. Schubert"
-, title =	"{Bestimmung} der {Primfaktorzerlegung} von {Verkettungen}"
-, journal =	"Mathematische Zeitschrift"
-, volume =	76
-, year =	1961
-, pages =	"116--148"
-, update =	"97.11 bibrelex"
+, author =      "H. Schubert"
+, title =       "{Bestimmung} der {Primfaktorzerlegung} von {Verkettungen}"
+, journal =     "Mathematische Zeitschrift"
+, volume =      76
+, year =        1961
+, pages =       "116--148"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{s-agtv-90
-, author =	"Sven Schuierer"
-, title =	"A General Theory of Visibility"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	23
-, update =	"00.03 bibrelex"
+, author =      "Sven Schuierer"
+, title =       "A General Theory of Visibility"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       23
+, update =      "00.03 bibrelex"
 }
 
 @article{s-otack-94
-, author =	"S. Schuierer"
-, title =	"An $O(\log \log n)$ Time Algorithm to Compute the Kernel of a Polygon"
-, journal =	"Nordic J. Comput."
-, volume =	1
-, year =	1994
-, pages =	"458--474"
-, update =	"95.05 smid"
+, author =      "S. Schuierer"
+, title =       "An $O(\log \log n)$ Time Algorithm to Compute the Kernel of a Polygon"
+, journal =     "Nordic J. Comput."
+, volume =      1
+, year =        1994
+, pages =       "458--474"
+, update =      "95.05 smid"
 }
 
 @article{s-odssr-96
-, author =	"S. Schuierer"
-, title =	"An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"205--226"
-, succeeds =	"s-rpqsr-93"
-, update =	"96.09 devillers"
+, author =      "S. Schuierer"
+, title =       "An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "205--226"
+, succeeds =    "s-rpqsr-93"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{s-cglds-94
-, author =	"Sven Schuierer"
-, title =	"Computing the Geodesic {$L_1$}-Diameter of a Simple Rectilinear Polygon in Parallel"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	72
-, cites =	"hs-msspm-93, psr-cgcsp-89, ZZZ"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Sven Schuierer"
+, title =       "Computing the Geodesic {$L_1$}-Diameter of a Simple Rectilinear Polygon in Parallel"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       72
+, cites =       "hs-msspm-93, psr-cgcsp-89, ZZZ"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{s-cldcs-92
-, author =	"Sven Schuierer"
-, title =	"Computing the {$L_1$}-Diameter and Center of a Simple Polygon"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"73--76"
-, update =	"00.03 bibrelex"
+, author =      "Sven Schuierer"
+, title =       "Computing the {$L_1$}-Diameter and Center of a Simple Polygon"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "73--76"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{s-ersls-97
-, author =	"Sven Schuierer"
-, title =	"Efficient Robot Self-Localization in Simple Polygons"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"20--22"
-, cites =	"drw-lrmt-95, gmr-rlptd-92 , ZZZ"
-, update =	"99.07 bibrelex, 98.07 bibrelex"
+, author =      "Sven Schuierer"
+, title =       "Efficient Robot Self-Localization in Simple Polygons"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "20--22"
+, cites =       "drw-lrmt-95, gmr-rlptd-92 , ZZZ"
+, update =      "99.07 bibrelex, 98.07 bibrelex"
 }
 
 @incollection{s-lbogs-97
-, author =	"S. Schuierer"
-, title =	"Lower Bounds in On-line Geometric Searching"
-, booktitle =	"11th International Symposium on Fundamentals of Computation Theory"
-, nickname =	"FCT '97"
-, site =	"Krakow, Poland"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1279
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"429--440"
-, update =	"99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "S. Schuierer"
+, title =       "Lower Bounds in On-line Geometric Searching"
+, booktitle =   "11th International Symposium on Fundamentals of Computation Theory"
+, nickname =    "FCT '97"
+, site =        "Krakow, Poland"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1279
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "429--440"
+, update =      "99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @article{s-lbogs-01
-, author =	"S. Schuierer"
-, title =	"Lower Bounds in On-line Geometric Searching"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	18
-, year =	2001
-, pages =	"37--53"
-, update =	"01.04 smid"
+, author =      "S. Schuierer"
+, title =       "Lower Bounds in On-line Geometric Searching"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      18
+, year =        2001
+, pages =       "37--53"
+, update =      "01.04 smid"
 }
 
 @phdthesis{s-gv-91
-, author =	"S. Schuierer"
-, title =	"On Generalized Visibility"
-, school =	"Universit{\"a}t Freiburg"
-, year =	1991
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "S. Schuierer"
+, title =       "On Generalized Visibility"
+, school =      "Universit{\"a}t Freiburg"
+, year =        1991
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{s-olsgt-97
-, author =	"Sven Schuierer"
-, title =	"On--Line Searching in Geometric Trees"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"135--140"
-, update =	"97.11 jones"
+, author =      "Sven Schuierer"
+, title =       "On--Line Searching in Geometric Trees"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "135--140"
+, update =      "97.11 jones"
 }
 
 @inproceedings{s-rpqsr-93
-, author =	"S. Schuierer"
-, title =	"Rectilinear path queries in a simple rectilinear polygon"
-, booktitle =	"Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	665
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"282--293"
-, precedes =	"s-odssr-96"
-, update =	"96.09 devillers, 93.05 smid"
+, author =      "S. Schuierer"
+, title =       "Rectilinear path queries in a simple rectilinear polygon"
+, booktitle =   "Proc. 10th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      665
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "282--293"
+, precedes =    "s-odssr-96"
+, update =      "96.09 devillers, 93.05 smid"
 }
 
 @techreport{s-smbr-98
-, author =	"Sven Schuierer"
-, title =	"Searching on $m$ Bounded Rays Optimally"
-, number =	112
-, institution =	"Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
-, address =	"Germany"
-, year =	1998
-, update =	"00.03 bibrelex"
+, author =      "Sven Schuierer"
+, title =       "Searching on $m$ Bounded Rays Optimally"
+, number =      112
+, institution = "Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
+, address =     "Germany"
+, year =        1998
+, update =      "00.03 bibrelex"
 }
 
 @techreport{srw-gtv-89
-, author =	"S. Schuierer and G. Rawlings and D. Wood"
-, title =	"A general theory of visibility"
-, type =	"Technical {Report}"
-, institution =	"Dept. Comput. Sci., Univ. Waterloo"
-, year =	1989
-, note =	"In preparation"
-, update =	"98.07 bibrelex"
+, author =      "S. Schuierer and G. Rawlings and D. Wood"
+, title =       "A general theory of visibility"
+, type =        "Technical {Report}"
+, institution = "Dept. Comput. Sci., Univ. Waterloo"
+, year =        1989
+, note =        "In preparation"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{srw-gsv-91
-, author =	"Sven Schuierer and Gregory J. E. Rawlins and Derick Wood"
-, title =	"A generalization of staircase visibility"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"277--287"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Sven Schuierer and Gregory J. E. Rawlins and Derick Wood"
+, title =       "A generalization of staircase visibility"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "277--287"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{srw-gsv-cccg-91
-, author =	"S. Schuierer and G. J. E. Rawlins and D. Wood"
-, title =	"A generalization of staircase visibility"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"96--99"
-, cites =	"cg-opapp-88, cr-uaopc-89, lp-oafkp-79, mrs-copsp-88, rw-cgro-88, rw-ocfoc-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. Schuierer and G. J. E. Rawlins and D. Wood"
+, title =       "A generalization of staircase visibility"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "96--99"
+, cites =       "cg-opapp-88, cr-uaopc-89, lp-oafkp-79, mrs-copsp-88, rw-cgro-88, rw-ocfoc-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{srw-tgtv-90
-, author =	"S. Schuierer and G. J. E. Rawlins and D. Wood"
-, title =	"Towards a general theory of visibility"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"354--357"
-, cites =	"b-cvdks-82, cr-cpih-88, ghlst-ltavs-87, h-etdf-63, j-pacca-82, k-mchco-86, l-htac-51, lp-fatsd-81, r-erog-87, s-ecsas-85, sw-oaccs-84, t-cvor-88, t-ghtt-88, v-lcls-65, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. Schuierer and G. J. E. Rawlins and D. Wood"
+, title =       "Towards a general theory of visibility"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "354--357"
+, cites =       "b-cvdks-82, cr-cpih-88, ghlst-ltavs-87, h-etdf-63, j-pacca-82, k-mchco-86, l-htac-51, lp-fatsd-81, r-erog-87, s-ecsas-85, sw-oaccs-84, t-cvor-88, t-ghtt-88, v-lcls-65, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ss-ossus-99
-, author =	"Sven Schuierer and Ines Semrau"
-, title =	"An Optimal Strategy for Searching in Unknown Streets"
-, booktitle =	"Proc. 16th Sympos. Theoret. Aspects Comput. Sci."
-, nickname =	"STACS '99"
-, site =	"Trier"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1563
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"121--131"
-, succeeds =	"ss-oss-98"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Sven Schuierer and Ines Semrau"
+, title =       "An Optimal Strategy for Searching in Unknown Streets"
+, booktitle =   "Proc. 16th Sympos. Theoret. Aspects Comput. Sci."
+, nickname =    "STACS '99"
+, site =        "Trier"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1563
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "121--131"
+, succeeds =    "ss-oss-98"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @techreport{ss-oss-98
-, author =	"Sven Schuierer and Ines Semrau"
-, title =	"Eine optimale {Suchstrategie} f{\"u}r {Stra{\ss}en}"
-, number =	97
-, institution =	"Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
-, address =	"Germany"
-, year =	1998
-, url =	"http://www.informatik.uni-freiburg.de/tr/1998/Report97/"
-, precedes =	"ss-ossus-99"
-, update =	"00.03 bibrelex"
+, author =      "Sven Schuierer and Ines Semrau"
+, title =       "Eine optimale {Suchstrategie} f{\"u}r {Stra{\ss}en}"
+, number =      97
+, institution = "Institut f{\"u}r Informatik, Universit{\"a}t Freiburg"
+, address =     "Germany"
+, year =        1998
+, url = "http://www.informatik.uni-freiburg.de/tr/1998/Report97/"
+, precedes =    "ss-ossus-99"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{sw-gkph-93
-, author =	"S. Schuierer and D. Wood"
-, title =	"Generalized kernels of polygons with holes"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"222--227"
-, cites =	"be-nlcha-84, cg-opapp-88, cr-uaopc-89, gn-mcgop-90, gy-fchsp-83, k-mchco-86, l-fchsp-83, lp-oafkp-79, ma-lafch-79, mrs-copsp-88, mrs-pgocc-88, ow-rv-88, rw-cgro-88, r-erog-87, rw-ocig-88, rc-csopm-87, s-gv-91, srw-gsv-cccg-91, ce-oails-88, mow-vv-87, nllw-xchsx-83, rw-ocfoc-87, wy-ocsp-88, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "S. Schuierer and D. Wood"
+, title =       "Generalized kernels of polygons with holes"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "222--227"
+, cites =       "be-nlcha-84, cg-opapp-88, cr-uaopc-89, gn-mcgop-90, gy-fchsp-83, k-mchco-86, l-fchsp-83, lp-oafkp-79, ma-lafch-79, mrs-copsp-88, mrs-pgocc-88, ow-rv-88, rw-cgro-88, r-erog-87, rw-ocig-88, rc-csopm-87, s-gv-91, srw-gsv-cccg-91, ce-oails-88, mow-vv-87, nllw-xchsx-83, rw-ocfoc-87, wy-ocsp-88, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{sw-svck-95
-, author =	"S. Schuierer and D. Wood"
-, title =	"Staircase visibility and computation of kernels"
-, journal =	"Algorithmica"
-, volume =	14
-, year =	1995
-, pages =	"1--26"
-, update =	"95.09 smid"
+, author =      "S. Schuierer and D. Wood"
+, title =       "Staircase visibility and computation of kernels"
+, journal =     "Algorithmica"
+, volume =      14
+, year =        1995
+, pages =       "1--26"
+, update =      "95.09 smid"
 }
 
 @article{s-eps-93
-, author =	"L. J. Schulman"
-, title =	"An equipartition of planar sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	9
-, year =	1993
-, pages =	"257--266"
-, update =	"94.05 matousek"
+, author =      "L. J. Schulman"
+, title =       "An equipartition of planar sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      9
+, year =        1993
+, pages =       "257--266"
+, update =      "94.05 matousek"
 }
 
 @incollection{s-spp-97
-, author =	"E. Schulte"
-, title =	"Symmetry of polytopes and polyhedra"
-, chapter =	16
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"311--330"
-, update =	"97.11 orourke"
+, author =      "E. Schulte"
+, title =       "Symmetry of polytopes and polyhedra"
+, chapter =     16
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "311--330"
+, update =      "97.11 orourke"
 }
 
 @incollection{s-t-93
-, author =	"E. Schulte"
-, title =	"Tilings"
-, editor =	"P. M. Gruber and J. M. Wills"
-, booktitle =	"Handbook of convex geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "E. Schulte"
+, title =       "Tilings"
+, editor =      "P. M. Gruber and J. M. Wills"
+, booktitle =   "Handbook of convex geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @article{sw-grdrm-86
-, author =	"E. Schulte and J. M. Wills"
-, title =	"Geometric realizations for {Dyck}'s regular map on a surface of genus 3"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"141--153"
+, author =      "E. Schulte and J. M. Wills"
+, title =       "Geometric realizations for {Dyck}'s regular map on a surface of genus 3"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "141--153"
 }
 
 @techreport{sbgs-sacgi-69
-, author =	"R. A. Schumacker and R. Brand and M. Gilliland and W. Sharp"
-, title =	"Study for Applying Computer-Generated Images to Visual Simulation"
-, number =	"AFHRL--TR--69--14"
-, institution =	"U.S. Air Force Human Resources Laboratory"
-, year =	1969
-, update =	"97.07 agarwal"
+, author =      "R. A. Schumacker and R. Brand and M. Gilliland and W. Sharp"
+, title =       "Study for Applying Computer-Generated Images to Visual Simulation"
+, number =      "AFHRL--TR--69--14"
+, institution = "U.S. Air Force Human Resources Laboratory"
+, year =        1969
+, update =      "97.07 agarwal"
 }
 
 @book{s-sfbt-81
-, author =	"L. Schumaker"
-, title =	"Spline functions, basic theory"
-, publisher =	"Wiley-Interscience"
-, address =	"New York, NY"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "L. Schumaker"
+, title =       "Spline functions, basic theory"
+, publisher =   "Wiley-Interscience"
+, address =     "New York, NY"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @article{s-bdsmp-84
-, author =	"L. L. Schumaker"
-, title =	"Bounds on the dimension of spaces of multivariate piecewise polynomials"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, number =	1
-, year =	1984
-, pages =	"251--264"
+, author =      "L. L. Schumaker"
+, title =       "Bounds on the dimension of spaces of multivariate piecewise polynomials"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, number =      1
+, year =        1984
+, pages =       "251--264"
 }
 
 @article{s-cotus-93
-, author =	"L. L. Schumaker"
-, title =	"Computing Optimal Triangulations Using Simulated Annealing"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	10
-, number =	"3--4"
-, month =	aug
-, year =	1993
-, pages =	"329--345"
-, update =	"95.05 held"
+, author =      "L. L. Schumaker"
+, title =       "Computing Optimal Triangulations Using Simulated Annealing"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      10
+, number =      "3--4"
+, month =       aug
+, year =        1993
+, pages =       "329--345"
+, update =      "95.05 held"
 }
 
 @incollection{s-fssd-76
-, author =	"L. L. Schumaker"
-, title =	"Fitting surfaces to scattered data"
-, editor =	"G. G. Lorentz and C. K. Chui and L. L. Schumaker"
-, booktitle =	"Approximation Theory II"
-, publisher =	"Academic Press"
-, year =	1976
-, pages =	"203--268"
-, update =	"97.11 bibrelex"
+, author =      "L. L. Schumaker"
+, title =       "Fitting surfaces to scattered data"
+, editor =      "G. G. Lorentz and C. K. Chui and L. L. Schumaker"
+, booktitle =   "Approximation Theory II"
+, publisher =   "Academic Press"
+, year =        1976
+, pages =       "203--268"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{s-r3doc-89
-, author =	"L. L. Schumaker"
-, title =	"Reconstructing $3$-d objects from cross-sections"
-, editor =	"W. Dahmen and M. Gasca and C. A. Micchelli"
-, booktitle =	"Computation of curves and surfaces"
-, publisher =	"Kluwer Academic Publishers"
-, year =	1989
-, pages =	"275--309"
-, update =	"98.03 bibrelex"
+, author =      "L. L. Schumaker"
+, title =       "Reconstructing $3$-d objects from cross-sections"
+, editor =      "W. Dahmen and M. Gasca and C. A. Micchelli"
+, booktitle =   "Computation of curves and surfaces"
+, publisher =   "Kluwer Academic Publishers"
+, year =        1989
+, pages =       "275--309"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{s-tm-87
-, author =	"L. L. Schumaker"
-, title =	"Triangulation methods"
-, editor =	"C. K. Chui and L. L. Schumaker and F. I. Utreras"
-, booktitle =	"Topics in Multivariate Approximation"
-, publisher =	"Academic Press"
-, address =	"New York"
-, year =	1987
-, pages =	"219--232"
-, update =	"98.11 bibrelex"
+, author =      "L. L. Schumaker"
+, title =       "Triangulation methods"
+, editor =      "C. K. Chui and L. L. Schumaker and F. I. Utreras"
+, booktitle =   "Topics in Multivariate Approximation"
+, publisher =   "Academic Press"
+, address =     "New York"
+, year =        1987
+, pages =       "219--232"
+, update =      "98.11 bibrelex"
 }
 
 @article{s-tc-93
-, author =	"L. L. Schumaker"
-, title =	"Triangulations in CAGD"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	"??"
-, month =	jan
-, year =	1993
-, pages =	"47--552"
-, update =	"97.11 bibrelex"
+, author =      "L. L. Schumaker"
+, title =       "Triangulations in CAGD"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      "??"
+, month =       jan
+, year =        1993
+, pages =       "47--552"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-usedkkk-21
-, author =	"A. Schur"
-, title =	"{\"U}ber die {S}chwarzche {E}xtremaleigenschaft des {K}reises unter den {K}urven konstantes {K}r{\"u}mmung"
-, journal =	"Math. Ann."
-, volume =	83
-, year =	1921
-, pages =	"143--148"
-, update =	"00.11 smid, 00.07 orourke"
+, author =      "A. Schur"
+, title =       "{\"U}ber die {S}chwarzche {E}xtremaleigenschaft des {K}reises unter den {K}urven konstantes {K}r{\"u}mmung"
+, journal =     "Math. Ann."
+, volume =      83
+, year =        1921
+, pages =       "143--148"
+, update =      "00.11 smid, 00.07 orourke"
 }
 
 @phdthesis{s-uekvm-01
-, author =	"I. Schur"
-, title =	"{\"U}ber eine {Klasse} von {Matrizen}, die sich einer gegebenen {Matrix} zuordnen lassen"
-, school =	"??"
-, address =	"Berlin"
-, year =	1901
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "I. Schur"
+, title =       "{\"U}ber eine {Klasse} von {Matrizen}, die sich einer gegebenen {Matrix} zuordnen lassen"
+, school =      "??"
+, address =     "Berlin"
+, year =        1901
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @book{s-tt-79
-, author =	"A. W. Schurle"
-, title =	"Topics in topology"
-, publisher =	"North-Holland"
-, address =	"New York, NY"
-, year =	1979
-, update =	"98.07 bibrelex"
+, author =      "A. W. Schurle"
+, title =       "Topics in topology"
+, publisher =   "North-Holland"
+, address =     "New York, NY"
+, year =        1979
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ss-astae-87
-, author =	"A. Schwartz and C. Stanton"
-, title =	"Analyzing surfaces: the truth about elimination theory"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"348--353"
-, cites =	"b-iha-07, gsa-vetii-84, g-cvrtp-81, hm-im-77, hp-mag-52, hh-qbs-86, k-eag-77, m-ssr-79, mt-cmcag-84, s-limha-85, sg-agcag-86, s-bag-77, s-agtd-34, w-rfeb-, w-ma-53, w-ac-62, ZZZ"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "A. Schwartz and C. Stanton"
+, title =       "Analyzing surfaces: the truth about elimination theory"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "348--353"
+, cites =       "b-iha-07, gsa-vetii-84, g-cvrtp-81, hm-im-77, hp-mag-52, hh-qbs-86, k-eag-77, m-ssr-79, mt-cmcag-84, s-limha-85, sg-agcag-86, s-bag-77, s-agtd-34, w-rfeb-, w-ma-53, w-ac-62, ZZZ"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{s-smpsp-77
-, author =	"E. L. Schwartz"
-, title =	"Spatial Mapping in primate sensory projection; analytic structure and relevance in perception"
-, journal =	"Biological Cybernetics"
-, volume =	25
-, year =	1977
-, pages =	"181--194"
-, update =	"98.07 bibrelex"
+, author =      "E. L. Schwartz"
+, title =       "Spatial Mapping in primate sensory projection; analytic structure and relevance in perception"
+, journal =     "Biological Cybernetics"
+, volume =      25
+, year =        1977
+, pages =       "181--194"
+, update =      "98.07 bibrelex"
 }
 
 @article{s-dsvpm-77
-, author =	"E. L. Schwartz"
-, title =	"The development of specific visual projections in the monkey and the goldfish: outline of a geometric theory of receptotopic structure"
-, journal =	"J. Theoret. Biol."
-, volume =	69
-, year =	1977
-, pages =	"655--685"
-, update =	"98.07 bibrelex"
+, author =      "E. L. Schwartz"
+, title =       "The development of specific visual projections in the monkey and the goldfish: outline of a geometric theory of receptotopic structure"
+, journal =     "J. Theoret. Biol."
+, volume =      69
+, year =        1977
+, pages =       "655--685"
+, update =      "98.07 bibrelex"
 }
 
 @article{sgb-svavd-95
-, author =	"E. L. Schwartz and D. N. Grece and G. Bonmassar"
-, title =	"Space-variant active vision: {Definition}, overview and examples"
-, journal =	"Neural Networks"
-, volume =	8
-, number =	"7-8"
-, year =	1995
-, pages =	"1297--1308"
-, update =	"98.07 bibrelex"
+, author =      "E. L. Schwartz and D. N. Grece and G. Bonmassar"
+, title =       "Space-variant active vision: {Definition}, overview and examples"
+, journal =     "Neural Networks"
+, volume =      8
+, number =      "7-8"
+, year =        1995
+, pages =       "1297--1308"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{ssw-nsgmm-87
-, author =	"E. L. Schwartz and A. Shaw and E. Wolfson"
-, title =	"A Numerical Solution to the Generalized Map-Maker's Problem: {Flattening} Non-Convex Poleyderal Surfaces"
-, type =	"Technical Report"
-, institution =	"Dept. of Computer Science, Courant Institute of Mathematical Sciences"
-, year =	1987
-, precedes =	"ssw-nsgmm-89"
-, update =	"95.01 mitchell, 93.09 milone+mitchell"
+, author =      "E. L. Schwartz and A. Shaw and E. Wolfson"
+, title =       "A Numerical Solution to the Generalized Map-Maker's Problem: {Flattening} Non-Convex Poleyderal Surfaces"
+, type =        "Technical Report"
+, institution = "Dept. of Computer Science, Courant Institute of Mathematical Sciences"
+, year =        1987
+, precedes =    "ssw-nsgmm-89"
+, update =      "95.01 mitchell, 93.09 milone+mitchell"
 }
 
 @article{ssw-nsgmm-89
-, author =	"E. L. Schwartz and A. Shaw and E. Wolfson"
-, title =	"A Numerical Solution to the Generalized Map-Maker's Problem: {Flattening} Nonconvex Poleyderal Surfaces"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	11
-, number =	9
-, year =	1989
-, pages =	"1005--1008"
-, succeeds =	"ssw-nsgmm-87"
-, update =	"95.01 mitchell, 95.01 mitchell"
+, author =      "E. L. Schwartz and A. Shaw and E. Wolfson"
+, title =       "A Numerical Solution to the Generalized Map-Maker's Problem: {Flattening} Nonconvex Poleyderal Surfaces"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      11
+, number =      9
+, year =        1989
+, pages =       "1005--1008"
+, succeeds =    "ssw-nsgmm-87"
+, update =      "95.01 mitchell, 95.01 mitchell"
 }
 
 @techreport{sw-mmpco-85
-, author =	"E. L. Schwartz and E. Wolfson"
-, title =	"On the map makers problem: computing an optimal quasi-isometry from an arbitrary polyhedron to the plane"
-, type =	"Report"
-, number =	"??"
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1985
+, author =      "E. L. Schwartz and E. Wolfson"
+, title =       "On the map makers problem: computing an optimal quasi-isometry from an arbitrary polyhedron to the plane"
+, type =        "Report"
+, number =      "??"
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1985
 }
 
 @article{s-fpavp-80
-, author =	"J. Schwartz"
-, title =	"Fast Probabilistic Algorithms for Verification of Polynomial Identities"
-, journal =	"J. ACM"
-, volume =	4
-, year =	1980
-, pages =	"701--717"
-, update =	"97.11 bibrelex"
+, author =      "J. Schwartz"
+, title =       "Fast Probabilistic Algorithms for Verification of Polynomial Identities"
+, journal =     "J. ACM"
+, volume =      4
+, year =        1980
+, pages =       "701--717"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{ss-pmp2g-82
-, author =	"J. Schwartz and C. Yap"
-, title =	"On the ``piano movers'' problem {II}: general techniques for computing topological properties of real algebraic manifolds"
-, number =	41
-, institution =	"Dept. Comput. Sci., New York Univ."
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "J. Schwartz and C. Yap"
+, title =       "On the ``piano movers'' problem {II}: general techniques for computing topological properties of real algebraic manifolds"
+, number =      41
+, institution = "Dept. Comput. Sci., New York Univ."
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @misc{s-atdgi-85
-, author =	"J. T. Schwartz"
-, title =	"Algebraic techniques for dealing with the geometry of intersecting surfaces in $n$ dimensions"
-, year =	1985
-, note =	"Invited talk at 1st Annu. ACM Sympos. Comput. Geom."
+, author =      "J. T. Schwartz"
+, title =       "Algebraic techniques for dealing with the geometry of intersecting surfaces in $n$ dimensions"
+, year =        1985
+, note =        "Invited talk at 1st Annu. ACM Sympos. Comput. Geom."
 }
 
 @article{s-fmdbt-81
-, author =	"J. T. Schwartz"
-, title =	"Finding the minimum distance between two convex polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	13
-, year =	1981
-, pages =	"168--170"
+, author =      "J. T. Schwartz"
+, title =       "Finding the minimum distance between two convex polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      13
+, year =        1981
+, pages =       "168--170"
 }
 
 @book{s-nfa-69
-, author =	"J. T. Schwartz"
-, title =	"Nonlinear Functional Analysis"
-, publisher =	"Gordon and Breach Science Publishers"
-, address =	"New York"
-, year =	1969
-, update =	"98.11 bibrelex"
+, author =      "J. T. Schwartz"
+, title =       "Nonlinear Functional Analysis"
+, publisher =   "Gordon and Breach Science Publishers"
+, address =     "New York"
+, year =        1969
+, update =      "98.11 bibrelex"
 }
 
 @article{ss-smprg-88
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"A survey of motion planning and related geometric algorithms"
-, journal =	"Artif. Intell."
-, volume =	37
-, year =	1988
-, pages =	"157--169"
-, keywords =	"motion planning, robotics, survey paper"
-, succeeds =	"ss-mprga-86"
-, precedes =	"ss-smprg-89"
-, update =	"98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "A survey of motion planning and related geometric algorithms"
+, journal =     "Artif. Intell."
+, volume =      37
+, year =        1988
+, pages =       "157--169"
+, keywords =    "motion planning, robotics, survey paper"
+, succeeds =    "ss-mprga-86"
+, precedes =    "ss-smprg-89"
+, update =      "98.03 mitchell"
 }
 
 @incollection{ss-smprg-89
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"A survey of motion planning and related geometric algorithms"
-, editor =	"D. Kapur and J. Mundy"
-, booktitle =	"Geometric Reasoning"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1989
-, pages =	"157--169"
-, keywords =	"motion planning, robotics, survey paper"
-, succeeds =	"ss-smprg-88"
-, update =	"98.03 mitchell, 94.05 devillers+sharir"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "A survey of motion planning and related geometric algorithms"
+, editor =      "D. Kapur and J. Mundy"
+, booktitle =   "Geometric Reasoning"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1989
+, pages =       "157--169"
+, keywords =    "motion planning, robotics, survey paper"
+, succeeds =    "ss-smprg-88"
+, update =      "98.03 mitchell, 94.05 devillers+sharir"
 }
 
 @incollection{ss-ampr-90
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"Algorithmic motion planning in robotics"
-, editor =	"J. van Leeuwen"
-, booktitle =	"Algorithms and Complexity"
-, series =	"Handbook of Theoretical Computer Science"
-, volume =	"A"
-, publisher =	"Elsevier"
-, address =	"Amsterdam"
-, year =	1990
-, pages =	"391--430"
-, keywords =	"motion planning, robotics, survey paper"
-, succeeds =	"s-ampr-89"
-, update =	"98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "Algorithmic motion planning in robotics"
+, editor =      "J. van Leeuwen"
+, booktitle =   "Algorithms and Complexity"
+, series =      "Handbook of Theoretical Computer Science"
+, volume =      "A"
+, publisher =   "Elsevier"
+, address =     "Amsterdam"
+, year =        1990
+, pages =       "391--430"
+, keywords =    "motion planning, robotics, survey paper"
+, succeeds =    "s-ampr-89"
+, update =      "98.03 mitchell"
 }
 
 @techreport{ss-empae-85
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"Efficient motion planning algorithms in environments of bounded local complexity"
-, type =	"Report"
-, number =	164
-, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1985
-, update =	"98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "Efficient motion planning algorithms in environments of bounded local complexity"
+, type =        "Report"
+, number =      164
+, institution = "Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1985
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ss-feftt-87
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"Finding effective ``force targets'' for two-dimensional multifinger frictional grips"
-, booktitle =	"Proc. 25th Allerton Conf. Commun. Control Comput."
-, year =	1987
-, pages =	"843--848"
-, update =	"98.03 mitchell, 94.05 sharir"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "Finding effective ``force targets'' for two-dimensional multifinger frictional grips"
+, booktitle =   "Proc. 25th Allerton Conf. Commun. Control Comput."
+, year =        1987
+, pages =       "843--848"
+, update =      "98.03 mitchell, 94.05 sharir"
 }
 
 @article{ss-feftt-92
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"Finding effective ``force targets'' for two-dimensional multifinger frictional grips"
-, journal =	"Algorithmica"
-, volume =	8
-, year =	1992
-, pages =	"1--20"
-, succeeds =	"ss-feftt-87"
-, update =	"98.03 mitchell, 94.05 sharir"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "Finding effective ``force targets'' for two-dimensional multifinger frictional grips"
+, journal =     "Algorithmica"
+, volume =      8
+, year =        1992
+, pages =       "1--20"
+, succeeds =    "ss-feftt-87"
+, update =      "98.03 mitchell, 94.05 sharir"
 }
 
 @article{ss-ipoot-87
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"Identification of partially obscured objects in two dimensions by matching of noisy ``characteristic curves''"
-, journal =	"Internat. J. Robot. Res."
-, volume =	6
-, number =	2
-, year =	1987
-, pages =	"29--44"
-, keywords =	"computer vision, curves, matchings, two-dimensional"
-, update =	"98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "Identification of partially obscured objects in two dimensions by matching of noisy ``characteristic curves''"
+, journal =     "Internat. J. Robot. Res."
+, volume =      6
+, number =      2
+, year =        1987
+, pages =       "29--44"
+, keywords =    "computer vision, curves, matchings, two-dimensional"
+, update =      "98.03 mitchell"
 }
 
 @article{ss-mptr-83
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"Mathematical problems and training in robotics"
-, journal =	"Notices Amer. Math. Soc."
-, volume =	30
-, year =	1983
-, pages =	"478--481"
-, keywords =	"survey paper, robotics"
-, update =	"98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "Mathematical problems and training in robotics"
+, journal =     "Notices Amer. Math. Soc."
+, volume =      30
+, year =        1983
+, pages =       "478--481"
+, keywords =    "survey paper, robotics"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ss-mprga-86
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"Motion planning and related geometric algorithms in robotics"
-, booktitle =	"Proc. Internat. Congress Math."
-, site =	"Berkeley, CA"
-, volume =	2
-, year =	1986
-, pages =	"1594--1611"
-, keywords =	"motion planning, robotics, survey paper"
-, precedes =	"ss-smprg-88"
-, update =	"98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "Motion planning and related geometric algorithms in robotics"
+, booktitle =   "Proc. Internat. Congress Math."
+, site =        "Berkeley, CA"
+, volume =      2
+, year =        1986
+, pages =       "1594--1611"
+, keywords =    "motion planning, robotics, survey paper"
+, precedes =    "ss-smprg-88"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ss-bfmpi-87
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"On the bivariate function minimization problem and its applications to motion planning"
-, booktitle =	"Proc. 14th Int. Colloq. Aut. Lang. Prog."
-, year =	1987
-, pages =	"357--363"
-, update =	"98.03 mitchell, 94.05 sharir"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "On the bivariate function minimization problem and its applications to motion planning"
+, booktitle =   "Proc. 14th Int. Colloq. Aut. Lang. Prog."
+, year =        1987
+, pages =       "357--363"
+, update =      "98.03 mitchell, 94.05 sharir"
 }
 
 @article{ss-pmp1c-83
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"On the ``piano movers'' problem {I}: {T}he case of a two-dimensional rigid polygonal body moving amidst polygonal barriers"
-, journal =	"Commun. Pure Appl. Math."
-, volume =	36
-, year =	1983
-, pages =	"345--398"
-, keywords =	"motion planning"
-, update =	"98.07 agarwal, 98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "On the ``piano movers'' problem {I}: {T}he case of a two-dimensional rigid polygonal body moving amidst polygonal barriers"
+, journal =     "Commun. Pure Appl. Math."
+, volume =      36
+, year =        1983
+, pages =       "345--398"
+, keywords =    "motion planning"
+, update =      "98.07 agarwal, 98.03 mitchell"
 }
 
 @article{ss-pmp2g-83
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"On the ``piano movers'' problem {II}: {G}eneral techniques for computing topological properties of real algebraic manifolds"
-, journal =	"Adv. Appl. Math."
-, volume =	4
-, year =	1983
-, pages =	"298--351"
-, keywords =	"motion planning, algebraic geometry"
-, update =	"98.07 agarwal, 98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "On the ``piano movers'' problem {II}: {G}eneral techniques for computing topological properties of real algebraic manifolds"
+, journal =     "Adv. Appl. Math."
+, volume =      4
+, year =        1983
+, pages =       "298--351"
+, keywords =    "motion planning, algebraic geometry"
+, update =      "98.07 agarwal, 98.03 mitchell"
 }
 
 @techreport{ss-pmp3c-82
-, author =	"J. T. Schwartz and M. Sharir"
-, title =	"On the ``piano movers'' problem {III}: coordinating the motion of several independent bodies: the special case of circular bodies amidst polygonal barriers"
-, type =	"Technical {Report}"
-, number =	52
-, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "J. T. Schwartz and M. Sharir"
+, title =       "On the ``piano movers'' problem {III}: coordinating the motion of several independent bodies: the special case of circular bodies amidst polygonal barriers"
+, type =        "Technical {Report}"
+, number =      52
+, institution = "Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @article{ss-pmp3c-83
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"On the ``piano movers'' problem {III}: coordinating the motion of several independent bodies: the special case of circular bodies moving amidst polygonal barriers"
-, journal =	"Internat. J. Robot. Res."
-, volume =	2
-, number =	3
-, year =	1983
-, pages =	"46--75"
-, keywords =	"motion planning"
-, update =	"98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "On the ``piano movers'' problem {III}: coordinating the motion of several independent bodies: the special case of circular bodies moving amidst polygonal barriers"
+, journal =     "Internat. J. Robot. Res."
+, volume =      2
+, number =      3
+, year =        1983
+, pages =       "46--75"
+, keywords =    "motion planning"
+, update =      "98.03 mitchell"
 }
 
 @article{ss-pmp5c-84
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"On the ``piano movers'' problem {V}: the case of a rod moving in three-dimensional space amidst polyhedral obstacles"
-, journal =	"Commun. Pure Appl. Math."
-, volume =	37
-, year =	1984
-, pages =	"815--848"
-, keywords =	"motion planning, three-dimensional"
-, update =	"98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "On the ``piano movers'' problem {V}: the case of a rod moving in three-dimensional space amidst polyhedral obstacles"
+, journal =     "Commun. Pure Appl. Math."
+, volume =      37
+, year =        1984
+, pages =       "815--848"
+, keywords =    "motion planning, three-dimensional"
+, update =      "98.03 mitchell"
 }
 
 @article{ss-tddsp-90
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"On the two-dimensional {Davenport}-{Schinzel} problem"
-, journal =	"J. Symbolic Comput."
-, volume =	10
-, year =	1990
-, pages =	"371--393"
-, keywords =	"Davenport-Schinzel sequences, upper/lower envelope"
-, succeeds =	"s-tddsp-85"
-, update =	"98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "On the two-dimensional {Davenport}-{Schinzel} problem"
+, journal =     "J. Symbolic Comput."
+, volume =      10
+, year =        1990
+, pages =       "371--393"
+, keywords =    "Davenport-Schinzel sequences, upper/lower envelope"
+, succeeds =    "s-tddsp-85"
+, update =      "98.03 mitchell"
 }
 
 @techreport{ss-srrv-84
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"Some remarks on robot vision"
-, type =	"Report"
-, number =	"TR119"
-, institution =	"Comput. Sci. Div., New York Univ."
-, address =	"New York, NY"
-, year =	1984
-, keywords =	"computer vision"
-, update =	"98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "Some remarks on robot vision"
+, type =        "Report"
+, number =      "TR119"
+, institution = "Comput. Sci. Div., New York Univ."
+, address =     "New York, NY"
+, year =        1984
+, keywords =    "computer vision"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ss-srrv-85
-, author =	"J. T. Schwartz and Micha Sharir"
-, title =	"Some remarks on robot vision"
-, booktitle =	"Trans. 3rd Army Conf. Applied Math. and Computing"
-, site =	"Atlanta, GA"
-, year =	1985
-, pages =	"1--36"
-, keywords =	"computer vision"
-, succeeds =	"ss-srrv-84"
-, update =	"98.03 mitchell, 94.05 sharir"
+, author =      "J. T. Schwartz and Micha Sharir"
+, title =       "Some remarks on robot vision"
+, booktitle =   "Trans. 3rd Army Conf. Applied Math. and Computing"
+, site =        "Atlanta, GA"
+, year =        1985
+, pages =       "1--36"
+, keywords =    "computer vision"
+, succeeds =    "ss-srrv-84"
+, update =      "98.03 mitchell, 94.05 sharir"
 }
 
 @techreport{sss-eafcc-85
-, author =	"J. T. Schwartz and Micha Sharir and A. Siegel"
-, title =	"An efficient algorithm for finding connected components in a binary image"
-, type =	"Report"
-, number =	"TR 154"
-, institution =	"Comput. Sci. Div., New York Univ."
-, address =	"New York, NY"
-, year =	1985
-, keywords =	"image processing"
-, update =	"98.03 mitchell"
+, author =      "J. T. Schwartz and Micha Sharir and A. Siegel"
+, title =       "An efficient algorithm for finding connected components in a binary image"
+, type =        "Report"
+, number =      "TR 154"
+, institution = "Comput. Sci. Div., New York Univ."
+, address =     "New York, NY"
+, year =        1985
+, keywords =    "image processing"
+, update =      "98.03 mitchell"
 }
 
 @book{sy-agar-87
-, title =	"Algorithmic and Geometric Aspects of Robotics"
-, editor =	"Jacob T. Schwartz and Chee-Keng Yap"
-, series =	"Advances in Robotics"
-, volume =	1
-, publisher =	"Lawrence Erlbaum Associates"
-, address =	"Hillsdale, New Jersey"
-, year =	1987
-, update =	"97.03 icking"
+, title =       "Algorithmic and Geometric Aspects of Robotics"
+, editor =      "Jacob T. Schwartz and Chee-Keng Yap"
+, series =      "Advances in Robotics"
+, volume =      1
+, publisher =   "Lawrence Erlbaum Associates"
+, address =     "Hillsdale, New Jersey"
+, year =        1987
+, update =      "97.03 icking"
 }
 
 @phdthesis{s-dsadc-93
-, author =	"C. Schwarz"
-, title =	"Data structures and algorithms for the dynamic closest pair problem"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"94.01 smid"
+, author =      "C. Schwarz"
+, title =       "Data structures and algorithms for the dynamic closest pair problem"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "94.01 smid"
 }
 
 @techreport{s-sdmwp-92
-, author =	"C. Schwarz"
-, title =	"Semi-dynamic maintenance of the width of a planar point set"
-, type =	"Report"
-, number =	"MPI-I-92-153"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, month =	dec
-, year =	1992
-, precedes =	"rss-mawsp-93,s-sdmwp-93"
-, update =	"98.11 bibrelex, 97.11 icking, 93.09 rote"
+, author =      "C. Schwarz"
+, title =       "Semi-dynamic maintenance of the width of a planar point set"
+, type =        "Report"
+, number =      "MPI-I-92-153"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, month =       dec
+, year =        1992
+, precedes =    "rss-mawsp-93,s-sdmwp-93"
+, update =      "98.11 bibrelex, 97.11 icking, 93.09 rote"
 }
 
 @inproceedings{s-sdmwp-93
-, author =	"Christian Schwarz"
-, title =	"Semi-dynamic Maintenance of the Width of a Planar Point Set"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"6--9"
-, succeeds =	"s-sdmwp-92"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
+, author =      "Christian Schwarz"
+, title =       "Semi-dynamic Maintenance of the Width of a Planar Point Set"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "6--9"
+, succeeds =    "s-sdmwp-92"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
 }
 
 @techreport{ss-oaolc-91
-, author =	"C. Schwarz and M. Smid"
-, title =	"An {$O(n \log n \log\log n)$} algorithm for the on-line closest pair problem"
-, type =	"Report"
-, number =	"MPI-I-91-107"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1991
-, precedes =	"ss-oaolc-92"
+, author =      "C. Schwarz and M. Smid"
+, title =       "An {$O(n \log n \log\log n)$} algorithm for the on-line closest pair problem"
+, type =        "Report"
+, number =      "MPI-I-91-107"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1991
+, precedes =    "ss-oaolc-92"
 }
 
 @inproceedings{ss-oaolc-92
-, author =	"C. Schwarz and M. Smid"
-, title =	"An {$O(n \log n \log\log n)$} algorithm for the on-line closest pair problem"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"280--285"
-, succeeds =	"ss-oaolc-91"
+, author =      "C. Schwarz and M. Smid"
+, title =       "An {$O(n \log n \log\log n)$} algorithm for the on-line closest pair problem"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "280--285"
+, succeeds =    "ss-oaolc-91"
 }
 
 @techreport{sss-oaolc-91
-, author =	"C. Schwarz and M. Smid and J. Snoeyink"
-, title =	"An optimal algorithm for the on-line closest pair problem"
-, type =	"Report"
-, number =	"MPI-I-91-123"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1991
-, precedes =	"sss-oaolc-92"
-, update =	"98.07 bibrelex"
+, author =      "C. Schwarz and M. Smid and J. Snoeyink"
+, title =       "An optimal algorithm for the on-line closest pair problem"
+, type =        "Report"
+, number =      "MPI-I-91-123"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1991
+, precedes =    "sss-oaolc-92"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{sss-oaolc-92
-, author =	"C. Schwarz and M. Smid and J. Snoeyink"
-, title =	"An optimal algorithm for the on-line closest-pair problem"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"330--336"
-, succeeds =	"sss-oaolc-91"
-, cites =	"bs-dcms-76, c-tpca-82, dd-ekdnp-91, ghlst-ltavs-87, o-ddds-83, ps-cgi-85, s-sisie-91, ss-oaolc-92, sh-cpp-75, s-mmdpsl-91a, s-drpla-91, s-mmdpsp-91t, s-ntsdc-90, v-oaann-89, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "C. Schwarz and M. Smid and J. Snoeyink"
+, title =       "An optimal algorithm for the on-line closest-pair problem"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "330--336"
+, succeeds =    "sss-oaolc-91"
+, cites =       "bs-dcms-76, c-tpca-82, dd-ekdnp-91, ghlst-ltavs-87, o-ddds-83, ps-cgi-85, s-sisie-91, ss-oaolc-92, sh-cpp-75, s-mmdpsl-91a, s-drpla-91, s-mmdpsp-91t, s-ntsdc-90, v-oaann-89, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{sss-oaolc-94
-, author =	"C. Schwarz and M. Smid and J. Snoeyink"
-, title =	"An optimal algorithm for the on-line closest-pair problem"
-, journal =	"Algorithmica"
-, volume =	12
-, year =	1994
-, pages =	"18--29"
-, update =	"94.09 smid"
+, author =      "C. Schwarz and M. Smid and J. Snoeyink"
+, title =       "An optimal algorithm for the on-line closest-pair problem"
+, journal =     "Algorithmica"
+, volume =      12
+, year =        1994
+, pages =       "18--29"
+, update =      "94.09 smid"
 }
 
 @inproceedings{stvwe-mepa-95
-, author =	"Christian Schwarz and J{\"u}rgen Teich and Alek Vainshtein and Emo Welzl and Brian L. Evans"
-, title =	"Minimal Enclosing Parallelogram with Application"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C34--C35"
-, keywords =	""
-, cites =	"acy-macp-85, da-frkec-84, ets-adtdr-94, fs-dmaer-75, oamb-oafme-86, stwe-fmep-94, v-fmep-90, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Christian Schwarz and J{\"u}rgen Teich and Alek Vainshtein and Emo Welzl and Brian L. Evans"
+, title =       "Minimal Enclosing Parallelogram with Application"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C34--C35"
+, keywords =    ""
+, cites =       "acy-macp-85, da-frkec-84, ets-adtdr-94, fs-dmaer-75, oamb-oafme-86, stwe-fmep-94, v-fmep-90, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @techreport{stwe-fmep-94
-, author =	"C. Schwarz and J. Teich and Emo Welzl and B. Evans"
-, title =	"On finding a minimal enclosing parallelogram"
-, type =	"Report"
-, number =	"TR-94-036"
-, institution =	"International Computer Science Institute"
-, address =	"Berkeley"
-, year =	1994
-, update =	"98.03 mitchell, 94.09 smid"
+, author =      "C. Schwarz and J. Teich and Emo Welzl and B. Evans"
+, title =       "On finding a minimal enclosing parallelogram"
+, type =        "Report"
+, number =      "TR-94-036"
+, institution = "International Computer Science Institute"
+, address =     "Berkeley"
+, year =        1994
+, update =      "98.03 mitchell, 94.09 smid"
 }
 
 @book{s-naci-89
-, author =	"H. R. Schwarz"
-, title =	"Numerical Analysis: A Comprehensive Introduction"
-, publisher =	"B. G. Teubner"
-, address =	"Stuttgart"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "H. R. Schwarz"
+, title =       "Numerical Analysis: A Comprehensive Introduction"
+, publisher =   "B. G. Teubner"
+, address =     "Stuttgart"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{s-ccmls-93
-, author =	"Otfried Schwarzkopf"
-, title =	"Computing Convolutions On Mesh-Like Structures"
-, booktitle =	"??"
-, publisher =	"IEEE Computer Society"
-, year =	1993
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Otfried Schwarzkopf"
+, title =       "Computing Convolutions On Mesh-Like Structures"
+, booktitle =   "??"
+, publisher =   "IEEE Computer Society"
+, year =        1993
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @phdthesis{s-dmcpr-92
-, author =	"O. Schwarzkopf"
-, title =	"Dynamic Maintenance of Convex Polytopes and Related Structures"
-, type =	"Ph.{D}. Thesis"
-, school =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, month =	jun
-, year =	1992
-, keywords =	"doctoral thesis"
-, succeeds =	"s-dmgsm-91, s-rscp-92"
+, author =      "O. Schwarzkopf"
+, title =       "Dynamic Maintenance of Convex Polytopes and Related Structures"
+, type =        "Ph.{D}. Thesis"
+, school =      "Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, month =       jun
+, year =        1992
+, keywords =    "doctoral thesis"
+, succeeds =    "s-dmgsm-91, s-rscp-92"
 }
 
 @inproceedings{s-dmgsm-91
-, author =	"O. Schwarzkopf"
-, title =	"Dynamic maintenance of geometric structures made easy"
-, booktitle =	"Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1991
-, pages =	"197--206"
-, precedes =	"s-dmcpr-92"
-, update =	"93.05 schwarzkopf"
+, author =      "O. Schwarzkopf"
+, title =       "Dynamic maintenance of geometric structures made easy"
+, booktitle =   "Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1991
+, pages =       "197--206"
+, precedes =    "s-dmcpr-92"
+, update =      "93.05 schwarzkopf"
 }
 
 @techreport{s-pop-91
-, author =	"O. Schwarzkopf"
-, title =	"On the post office problem"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1991
-, update =	"97.11 bibrelex"
+, author =      "O. Schwarzkopf"
+, title =       "On the post office problem"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1991
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{s-pcdvd-89
-, author =	"O. Schwarzkopf"
-, title =	"Parallel computation of discrete {Voronoi} diagrams"
-, booktitle =	"Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	349
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"193--204"
-, precedes =	"s-pcdt-91"
+, author =      "O. Schwarzkopf"
+, title =       "Parallel computation of discrete {Voronoi} diagrams"
+, booktitle =   "Proc. 6th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      349
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "193--204"
+, precedes =    "s-pcdt-91"
 }
 
 @article{s-pcdt-91
-, author =	"O. Schwarzkopf"
-, title =	"Parallel computation of distance transforms"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"685--697"
+, author =      "O. Schwarzkopf"
+, title =       "Parallel computation of distance transforms"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "685--697"
 }
 
 @techreport{s-riads-91
-, author =	"O. Schwarzkopf"
-, title =	"Randomized Incremental Algorithms in a Dynamic Setting"
-, type =	"Technical {Report}"
-, institution =	"Freie Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, year =	1991
-, note =	"To appear"
-, update =	"97.11 bibrelex"
+, author =      "O. Schwarzkopf"
+, title =       "Randomized Incremental Algorithms in a Dynamic Setting"
+, type =        "Technical {Report}"
+, institution = "Freie Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, year =        1991
+, note =        "To appear"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{s-rscp-92
-, author =	"O. Schwarzkopf"
-, title =	"Ray shooting in convex polytopes"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"286--295"
-, precedes =	"s-dmcpr-92"
-, cites =	"aesw-emstb-90, am-dhsrr-91, am-rsps-92, bc-hhihr-92, bdsty-arsol-92, bdt-riach-, cegs-sessr-89, cf-plhur-94, c-hsh-85, c-narsc-87, c-racpq-88, cms-frric-92i, cs-arscg-89, dmt-fddtl-92, e-acg-87, gks-ricdv-92, m-ept-91, m-rph-91, m-fppa1-88, m-rmstd-91, m-rmstf-91, m-rmstl-91, s-dmgsm-91, s-sdlpc-91, s-sfira-91, ZZZ"
-, update =	"97.11 bibrelex, 93.05 schwarzkopf"
+, author =      "O. Schwarzkopf"
+, title =       "Ray shooting in convex polytopes"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "286--295"
+, precedes =    "s-dmcpr-92"
+, cites =       "aesw-emstb-90, am-dhsrr-91, am-rsps-92, bc-hhihr-92, bdsty-arsol-92, bdt-riach-, cegs-sessr-89, cf-plhur-94, c-hsh-85, c-narsc-87, c-racpq-88, cms-frric-92i, cs-arscg-89, dmt-fddtl-92, e-acg-87, gks-ricdv-92, m-ept-91, m-rph-91, m-fppa1-88, m-rmstd-91, m-rmstf-91, m-rmstl-91, s-dmgsm-91, s-sdlpc-91, s-sfira-91, ZZZ"
+, update =      "97.11 bibrelex, 93.05 schwarzkopf"
 }
 
 @inproceedings{s-edei-95
-, author =	"Otfried Schwarzkopf"
-, title =	"The Extendible Drawing Editor {Ipe}"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C10--C11"
-, keywords =	"Latex, figure drawing, xfig, idraw"
-, cites =	"ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Otfried Schwarzkopf"
+, title =       "The Extendible Drawing Editor {Ipe}"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C10--C11"
+, keywords =    "Latex, figure drawing, xfig, idraw"
+, cites =       "ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{sfrw-acfpr-90
-, author =	"O. Schwarzkopf and U. Fuchs and G{\"u}nter Rote and Emo Welzl"
-, title =	"Approximation of convex figures by pairs of rectangles"
-, booktitle =	"Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	415
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"240--249"
-, precedes =	"sfrw-acfpr-98"
-, update =	"98.07 bibrelex+rote, 98.03 mitchell, 97.11 bibrelex, 97.03 rote, 93.09 rote, 93.05 schwarzkopf"
+, author =      "O. Schwarzkopf and U. Fuchs and G{\"u}nter Rote and Emo Welzl"
+, title =       "Approximation of convex figures by pairs of rectangles"
+, booktitle =   "Proc. 7th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      415
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "240--249"
+, precedes =    "sfrw-acfpr-98"
+, update =      "98.07 bibrelex+rote, 98.03 mitchell, 97.11 bibrelex, 97.03 rote, 93.09 rote, 93.05 schwarzkopf"
 }
 
 @article{sfrw-acfpr-98
-, author =	"O. Schwarzkopf and U. Fuchs and G{\"u}nter Rote and Emo Welzl"
-, title =	"Approximation of convex figures by pairs of rectangles"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"77--87"
-, succeeds =	"sfrw-acfpr-90"
-, cites =	"ks-tpscf-95"
-, update =	"98.07 bibrelex+rote, 98.03 mitchell, 97.03 rote"
-, abstract =	"We consider the problem of approximating a convex figure
-		in the plane by a pair $(r,R)$ of homothetic (i. e., similar and
-		parallel) rectangles with $r$ contained in $C$ and $R$
-		containing $C$. We show the existence of such pairs where the
-		sides of the outer rectangle have length at most double the
-		length of the inner rectangle, thereby solving a problem posed
-		by P\'{o}lya and Szeg\H{o}.
-		If the $n$ vertices of a convex polygon $C$ are given as a
-		sorted array, such an approximating pair of rectangles can be
-		computed in time $O(log^2 n)$."
+, author =      "O. Schwarzkopf and U. Fuchs and G{\"u}nter Rote and Emo Welzl"
+, title =       "Approximation of convex figures by pairs of rectangles"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "77--87"
+, succeeds =    "sfrw-acfpr-90"
+, cites =       "ks-tpscf-95"
+, update =      "98.07 bibrelex+rote, 98.03 mitchell, 97.03 rote"
+, abstract =    "We consider the problem of approximating a convex figure
+                in the plane by a pair $(r,R)$ of homothetic (i. e., similar and
+                parallel) rectangles with $r$ contained in $C$ and $R$
+                containing $C$. We show the existence of such pairs where the
+                sides of the outer rectangle have length at most double the
+                length of the inner rectangle, thereby solving a problem posed
+                by P\'{o}lya and Szeg\H{o}.
+                If the $n$ vertices of a convex polygon $C$ are given as a
+                sorted array, such an approximating pair of rectangles can be
+                computed in time $O(log^2 n)$."
 }
 
 @inproceedings{ss-vdsct-96
-, author =	"Otfried Schwarzkopf and Micha Sharir"
-, title =	"Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its Applications"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"20--29"
-, cites =	"ass-oleia-96, ass-sulbl-89, as-tsbac-90, as-car-94, as-tmp3s-94, bds-lric-95, cegs-sessr-89, cegsw-ccbac-90, cs-arscg-89, hs-nblet-94, hs-atubs-95, hs-nqbmp-93, hs-atarr-95, hs-ndssg-86, s-ksacs-91, s-atubl-94, sa-dsstg-95, t-ntasa-95, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Otfried Schwarzkopf and Micha Sharir"
+, title =       "Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its Applications"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "20--29"
+, cites =       "ass-oleia-96, ass-sulbl-89, as-tsbac-90, as-car-94, as-tmp3s-94, bds-lric-95, cegs-sessr-89, cegsw-ccbac-90, cs-arscg-89, hs-nblet-94, hs-atubs-95, hs-nqbmp-93, hs-atarr-95, hs-ndssg-86, s-ksacs-91, s-atubl-94, sa-dsstg-95, t-ntasa-95, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @article{ss-vdsct-97
-, author =	"Otfried Schwarzkopf and Micha Sharir"
-, title =	"Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its Applications"
-, journal =	"Discrete Comput. Geom."
-, volume =	18
-, year =	1997
-, pages =	"269--288"
-, update =	"98.03 agarwal"
+, author =      "Otfried Schwarzkopf and Micha Sharir"
+, title =       "Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its Applications"
+, journal =     "Discrete Comput. Geom."
+, volume =      18
+, year =        1997
+, pages =       "269--288"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{sv-rslde-96c
-, author =	"Otfried Schwarzkopf and Jules Vleugels"
-, title =	"Range Searching in Low-Density Environments"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	3
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Otfried Schwarzkopf and Jules Vleugels"
+, title =       "Range Searching in Low-Density Environments"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       3
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{sv-rslde-96
-, author =	"Otfried Schwarzkopf and Jules Vleugels"
-, title =	"Range Searching in Low-Density Environments"
-, journal =	"Inform. Process. Lett."
-, volume =	60
-, year =	1996
-, pages =	"121--127"
-, update =	"99.03 bibrelex, 96.09 agarwal, 98.07 bibrelex"
+, author =      "Otfried Schwarzkopf and Jules Vleugels"
+, title =       "Range Searching in Low-Density Environments"
+, journal =     "Inform. Process. Lett."
+, volume =      60
+, year =        1996
+, pages =       "121--127"
+, update =      "99.03 bibrelex, 96.09 agarwal, 98.07 bibrelex"
 }
 
 @mastersthesis{s-ddbpi-96
-, author =	"J. Schwerdt"
-, title =	"Das {Diameterproblem} einer bewegten {Punktemenge}: eine {Implementierung} mit {Hilfe} von parametric search"
-, type =	"Master's Thesis"
-, school =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1996
-, keywords =	"masters thesis"
-, update =	"97.03 smid"
+, author =      "J. Schwerdt"
+, title =       "Das {Diameterproblem} einer bewegten {Punktemenge}: eine {Implementierung} mit {Hilfe} von parametric search"
+, type =        "Master's Thesis"
+, school =      "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1996
+, keywords =    "masters thesis"
+, update =      "97.03 smid"
 }
 
 @phdthesis{s-eogpb-01
-, author =	"J. Schwerdt"
-, title =	"Entwurf von {Optimierungsalgorithmen} f{\"u}r geometrische {Probleme} im {Bereich} {Rapid} {Prototyping} und {Manufacturing}"
-, type =	"Ph.{D}. Thesis"
-, school =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	2001
-, keywords =	"doctoral thesis"
-, update =	"01.11 smid"
+, author =      "J. Schwerdt"
+, title =       "Entwurf von {Optimierungsalgorithmen} f{\"u}r geometrische {Probleme} im {Bereich} {Rapid} {Prototyping} und {Manufacturing}"
+, type =        "Ph.{D}. Thesis"
+, school =      "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        2001
+, keywords =    "doctoral thesis"
+, update =      "01.11 smid"
 }
 
 @techreport{ss-cwtdp-99
-, author =	"J. Schwerdt and M. Smid"
-, title =	"Computing the width of a three-dimensional point set: documentation"
-, type =	"Report"
-, number =	4
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1999
-, update =	"99.07 smid"
+, author =      "J. Schwerdt and M. Smid"
+, title =       "Computing the width of a three-dimensional point set: documentation"
+, type =        "Report"
+, number =      4
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1999
+, update =      "99.07 smid"
 }
 
 @techreport{sshj-cohdl-01
-, author =	"J. Schwerdt and M. Smid and M. C. Hong and R. Janardan"
-, title =	"Computing an optimal hatching direction in layered manufacturing"
-, type =	"Report"
-, number =	3
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	2001
-, update =	"01.04 smid"
+, author =      "J. Schwerdt and M. Smid and M. C. Hong and R. Janardan"
+, title =       "Computing an optimal hatching direction in layered manufacturing"
+, type =        "Report"
+, number =      3
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        2001
+, update =      "01.04 smid"
 }
 
 @techreport{ssjj-pcflm-00t
-, author =	"J. Schwerdt and M. Smid and R. Janardan and E. Johnson"
-, title =	"Protecting critical facets in layered manufacturing: implementation and experimental results"
-, type =	"Report"
-, number =	6
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	2000
-, update =	"00.11 smid, 00.07 smid"
+, author =      "J. Schwerdt and M. Smid and R. Janardan and E. Johnson"
+, title =       "Protecting critical facets in layered manufacturing: implementation and experimental results"
+, type =        "Report"
+, number =      6
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        2000
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @inproceedings{ssjj-pcflm-00i
-, author =	"J. Schwerdt and M. Smid and R. Janardan and E. Johnson"
-, title =	"Protecting critical facets in layered manufacturing: implementation and experimental results"
-, booktitle =	"Proc. 2nd Workshop on Algorithm Engineering and Experiments"
-, year =	2000
-, pages =	"43--57"
-, update =	"00.11 smid, 00.07 smid, 00.03 smid"
+, author =      "J. Schwerdt and M. Smid and R. Janardan and E. Johnson"
+, title =       "Protecting critical facets in layered manufacturing: implementation and experimental results"
+, booktitle =   "Proc. 2nd Workshop on Algorithm Engineering and Experiments"
+, year =        2000
+, pages =       "43--57"
+, update =      "00.11 smid, 00.07 smid, 00.03 smid"
 }
 
 @article{ssjjm-pcflm-00
-, author =	"J. Schwerdt and M. Smid and R. Janardan and E. Johnson and J. Majhi"
-, title =	"Protecting critical facets in layered manufacturing"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	16
-, year =	2000
-, pages =	"187--210"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "J. Schwerdt and M. Smid and R. Janardan and E. Johnson and J. Majhi"
+, title =       "Protecting critical facets in layered manufacturing"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      16
+, year =        2000
+, pages =       "187--210"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @techreport{ssjjm-pflm-99t
-, author =	"J. Schwerdt and M. Smid and R. Janardan and E. Johnson and J. Majhi"
-, title =	"Protecting facets in layered manufacturing"
-, type =	"Report"
-, number =	10
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1999
-, update =	"00.03 smid, 99.07 smid"
+, author =      "J. Schwerdt and M. Smid and R. Janardan and E. Johnson and J. Majhi"
+, title =       "Protecting facets in layered manufacturing"
+, type =        "Report"
+, number =      10
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1999
+, update =      "00.03 smid, 99.07 smid"
 }
 
 @inproceedings{ssjjm-pflm-99i
-, author =	"J. Schwerdt and M. Smid and R. Janardan and E. Johnson and J. Majhi"
-, title =	"Protecting facets in layered manufacturing"
-, booktitle =	"Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1738
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"281--292"
-, update =	"00.03 smid"
+, author =      "J. Schwerdt and M. Smid and R. Janardan and E. Johnson and J. Majhi"
+, title =       "Protecting facets in layered manufacturing"
+, booktitle =   "Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1738
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "281--292"
+, update =      "00.03 smid"
 }
 
 @techreport{ssmj-cwtdp-98t
-, author =	"J. Schwerdt and M. Smid and J. Majhi and R. Janardan"
-, title =	"Computing the width of a three-dimensional point set: an experimental study"
-, type =	"Report"
-, number =	18
-, institution =	"Department of Computer Science, University of Magdeburg"
-, address =	"Magdeburg, Germany"
-, year =	1998
-, succeeds =	"ssmj-cwtdp-98i"
-, update =	"99.07 smid"
+, author =      "J. Schwerdt and M. Smid and J. Majhi and R. Janardan"
+, title =       "Computing the width of a three-dimensional point set: an experimental study"
+, type =        "Report"
+, number =      18
+, institution = "Department of Computer Science, University of Magdeburg"
+, address =     "Magdeburg, Germany"
+, year =        1998
+, succeeds =    "ssmj-cwtdp-98i"
+, update =      "99.07 smid"
 }
 
 @inproceedings{ssmj-cwtdp-98i
-, author =	"J. Schwerdt and M. Smid and J. Majhi and R. Janardan"
-, title =	"Computing the width of a three-dimensional point set: an experimental study"
-, booktitle =	"Proc. 2nd Workshop on Algorithm Engineering"
-, nickname =	"WAE '98"
-, site =	"Saarbr{\"u}cken"
-, month =	aug
-, year =	1998
-, pages =	"62--73"
-, update =	"01.04 icking, 00.11 smid, 00.07 icking, 99.07 smid, 98.11 smid"
+, author =      "J. Schwerdt and M. Smid and J. Majhi and R. Janardan"
+, title =       "Computing the width of a three-dimensional point set: an experimental study"
+, booktitle =   "Proc. 2nd Workshop on Algorithm Engineering"
+, nickname =    "WAE '98"
+, site =        "Saarbr{\"u}cken"
+, month =       aug
+, year =        1998
+, pages =       "62--73"
+, update =      "01.04 icking, 00.11 smid, 00.07 icking, 99.07 smid, 98.11 smid"
 }
 
 @article{ssmj-cwtdp-99
-, author =	"J. Schwerdt and M. Smid and J. Majhi and R. Janardan"
-, title =	"Computing the width of a three-dimensional point set: an experimental study"
-, journal =	"ACM Journal of Experimental Algorithmics"
-, volume =	4
-, year =	1999
-, note =	"Article 8"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "J. Schwerdt and M. Smid and J. Majhi and R. Janardan"
+, title =       "Computing the width of a three-dimensional point set: an experimental study"
+, journal =     "ACM Journal of Experimental Algorithmics"
+, volume =      4
+, year =        1999
+, note =        "Article 8"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @inproceedings{sss-cmdmp-97
-, author =	"J. Schwerdt and M. Smid and S. Schirra"
-, title =	"Computing the minimum diameter for moving points: an exact implementation using parametric search"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"466--468"
-, cites =	"ast-apsgo-94, bfms-secsb-97, bkmnsu-egcl-95, bms-lcrn-96, fgkss-ckbgc-96, gjs-facpp-96, m-apcad-83, nu-lmum-95, mn-lpcgc-95, ps-cgi-85, s-ddbpi-96, ZZZ"
-, update =	"98.07 bibrelex, 97.11 smid"
+, author =      "J. Schwerdt and M. Smid and S. Schirra"
+, title =       "Computing the minimum diameter for moving points: an exact implementation using parametric search"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "466--468"
+, cites =       "ast-apsgo-94, bfms-secsb-97, bkmnsu-egcl-95, bms-lcrn-96, fgkss-ckbgc-96, gjs-facpp-96, m-apcad-83, nu-lmum-95, mn-lpcgc-95, ps-cgi-85, s-ddbpi-96, ZZZ"
+, update =      "98.07 bibrelex, 97.11 smid"
 }
 
 @article{si-ttids-86
-, author =	"D. Scott and S. Iyenger"
-, title =	"TID - {Translation} invariant data structure of storing images"
-, journal =	"Commun. ACM"
-, volume =	29
-, year =	1986
-, pages =	"418--428"
-, update =	"98.07 bibrelex"
+, author =      "D. Scott and S. Iyenger"
+, title =       "TID - {Translation} invariant data structure of storing images"
+, journal =     "Commun. ACM"
+, volume =      29
+, year =        1986
+, pages =       "418--428"
+, update =      "98.07 bibrelex"
 }
 
 @article{srm-alid-81
-, author =	"T. J. Sebok and L. E. Roemer and G. S. Malindzak"
-, title =	"An algorithm for line intersection detection"
-, journal =	"Pattern Recogn."
-, volume =	13
-, year =	1981
-, pages =	"159--166"
+, author =      "T. J. Sebok and L. E. Roemer and G. S. Malindzak"
+, title =       "An algorithm for line intersection detection"
+, journal =     "Pattern Recogn."
+, volume =      13
+, year =        1981
+, pages =       "159--166"
 }
 
 @article{sg-vpra-82
-, author =	"S. Sechrest and D. P. Greenberg"
-, title =	"A visible polygon reconstruction algorithm"
-, journal =	"ACM Trans. Graph."
-, volume =	1
-, year =	1982
-, pages =	"25--42"
+, author =      "S. Sechrest and D. P. Greenberg"
+, title =       "A visible polygon reconstruction algorithm"
+, journal =     "ACM Trans. Graph."
+, volume =      1
+, year =        1982
+, pages =       "25--42"
 }
 
 @article{s-pasp-85
-, author =	"T. Sederberg"
-, title =	"Piecewise algebraic surface patches"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	2
-, year =	1985
-, pages =	"53--59"
-, update =	"98.03 bibrelex"
+, author =      "T. Sederberg"
+, title =       "Piecewise algebraic surface patches"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      2
+, year =        1985
+, pages =       "53--59"
+, update =      "98.03 bibrelex"
 }
 
 @article{sgwm-2dsbi-93
-, author =	"T. Sederberg and P. Gao and G. Wang and H. Mu"
-, title =	"$2$-d shape blending: an intrinsic solution to the vertex path problem"
-, journal =	"Comput Graph."
-, volume =	27
-, year =	1993
-, pages =	"15--18"
-, note =	"Proc. SIGGRAPH '93"
-, update =	"98.03 bibrelex"
+, author =      "T. Sederberg and P. Gao and G. Wang and H. Mu"
+, title =       "$2$-d shape blending: an intrinsic solution to the vertex path problem"
+, journal =     "Comput Graph."
+, volume =      27
+, year =        1993
+, pages =       "15--18"
+, note =        "Proc. SIGGRAPH '93"
+, update =      "98.03 bibrelex"
 }
 
 @article{sg-agcag-86
-, author =	"T. Sederberg and R. Goldman"
-, title =	"Algebraic geometry for computer-aided geometric design"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	"??"
-, month =	jun
-, year =	1986
-, pages =	"52--59"
-, update =	"98.03 bibrelex"
+, author =      "T. Sederberg and R. Goldman"
+, title =       "Algebraic geometry for computer-aided geometric design"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      "??"
+, month =       jun
+, year =        1986
+, pages =       "52--59"
+, update =      "98.03 bibrelex"
 }
 
 @article{sg-pba2d-92
-, author =	"T. Sederberg and E. Greenwood"
-, title =	"A physically based approach to $2$-d shape blending"
-, journal =	"Comput. Graph."
-, volume =	26
-, year =	1992
-, pages =	"25--34"
-, note =	"Proc. SIGGRAPH '92"
-, update =	"98.03 bibrelex"
+, author =      "T. Sederberg and E. Greenwood"
+, title =       "A physically based approach to $2$-d shape blending"
+, journal =     "Comput. Graph."
+, volume =      26
+, year =        1992
+, pages =       "25--34"
+, note =        "Proc. SIGGRAPH '92"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{ss-pcas-87
-, author =	"T. Sederberg and J. Snively"
-, title =	"Parameterization of Cubic Algebraic Surfaces"
-, editor =	"R. Martin"
-, booktitle =	"The Mathematics of Surfaces II"
-, publisher =	"Oxford University Press"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "T. Sederberg and J. Snively"
+, title =       "Parameterization of Cubic Algebraic Surfaces"
+, editor =      "R. Martin"
+, booktitle =   "The Mathematics of Surfaces II"
+, publisher =   "Oxford University Press"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @article{sa-irpcs-84
-, author =	"T. W. Sederberg and D. C. Anderson"
-, title =	"Implicit representation of parametric curves and surfaces"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	"??"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "T. W. Sederberg and D. C. Anderson"
+, title =       "Implicit representation of parametric curves and surfaces"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      "??"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @book{s-a-83
-, author =	"R. Sedgewick"
-, title =	"Algorithms"
-, edition =	"1st"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1983
-, keywords =	"book, convex hull"
-, update =	"98.03 bibrelex"
-, annote =	"Chapter 25 treats convex hull"
+, author =      "R. Sedgewick"
+, title =       "Algorithms"
+, edition =     "1st"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1983
+, keywords =    "book, convex hull"
+, update =      "98.03 bibrelex"
+, annote =      "Chapter 25 treats convex hull"
 }
 
 @book{s-a-88
-, author =	"R. Sedgewick"
-, title =	"Algorithms"
-, edition =	"2nd"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, Mass."
-, year =	1988
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "R. Sedgewick"
+, title =       "Algorithms"
+, edition =     "2nd"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, Mass."
+, year =        1988
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @book{s-ac-90
-, author =	"R. Sedgewick"
-, title =	"Algorithms in {C}"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, Mass."
-, year =	1988
-, update =	"98.11 bibrelex"
+, author =      "R. Sedgewick"
+, title =       "Algorithms in {C}"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, Mass."
+, year =        1988
+, update =      "98.11 bibrelex"
 }
 
 @book{s-ac-92
-, author =	"R. Sedgewick"
-, title =	"Algorithms in {C}++"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1992
-, update =	"97.03 schwarzkopf"
+, author =      "R. Sedgewick"
+, title =       "Algorithms in {C}++"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1992
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{sv-speg-84
-, author =	"R. Sedgewick and J. S. Vitter"
-, title =	"Shortest paths in {Euclidean} graphs"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1984
-, pages =	"417--424"
-, precedes =	"sv-speg-86"
+, author =      "R. Sedgewick and J. S. Vitter"
+, title =       "Shortest paths in {Euclidean} graphs"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1984
+, pages =       "417--424"
+, precedes =    "sv-speg-86"
 }
 
 @article{sv-speg-86
-, author =	"R. Sedgewick and J. S. Vitter"
-, title =	"Shortest paths in {Euclidean} graphs"
-, journal =	"Algorithmica"
-, volume =	1
-, year =	1986
-, pages =	"31--48"
-, succeeds =	"sv-speg-84"
+, author =      "R. Sedgewick and J. S. Vitter"
+, title =       "Shortest paths in {Euclidean} graphs"
+, journal =     "Algorithmica"
+, volume =      1
+, year =        1986
+, pages =       "31--48"
+, succeeds =    "sv-speg-84"
 }
 
 @inproceedings{sk-btera-90
-, author =	"B. Seeger and H.-P. Kriegel"
-, title =	"The buddy-tree: {A}n efficient and robust access method for spatial data base systems"
-, booktitle =	"Proc. 16th VLDB Conference"
-, year =	1990
-, pages =	"590--601"
-, update =	"97.07 agarwal"
+, author =      "B. Seeger and H.-P. Kriegel"
+, title =       "The buddy-tree: {A}n efficient and robust access method for spatial data base systems"
+, booktitle =   "Proc. 16th VLDB Conference"
+, year =        1990
+, pages =       "590--601"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{s-esadu-97
-, author =	"Jochen Seemann"
-, title =	"Extending the Sugiyama Algorithm for Drawing {UML} Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"415--424"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Jochen Seemann"
+, title =       "Extending the Sugiyama Algorithm for Drawing {UML} Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "415--424"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @techreport{s-plga-85
-, author =	"M. Segal"
-, title =	"A programming language for geometry applications"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Univ. California Berkeley"
-, address =	"Berkeley, CA"
-, year =	1985
+, author =      "M. Segal"
+, title =       "A programming language for geometry applications"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Univ. California Berkeley"
+, address =     "Berkeley, CA"
+, year =        1985
 }
 
 @unpublished{s-pipni-
-, author =	"M. Segal"
-, title =	"Partitioning Intersecting Polyhedra into Non-Intersecting Parts"
-, note =	"In Preparation"
-, update =	"97.11 bibrelex"
+, author =      "M. Segal"
+, title =       "Partitioning Intersecting Polyhedra into Non-Intersecting Parts"
+, note =        "In Preparation"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-utgvp-90
-, author =	"M. Segal"
-, title =	"Using tolerances to guarantee valid polyhedral modeling results"
-, journal =	"Comput. Graph."
-, volume =	24
-, number =	4
-, month =	aug
-, year =	1990
-, pages =	"105--114"
-, precedes =	"ss-ccsm-85, ss-mtgdn-89"
-, update =	"93.09 milone+mitchell"
+, author =      "M. Segal"
+, title =       "Using tolerances to guarantee valid polyhedral modeling results"
+, journal =     "Comput. Graph."
+, volume =      24
+, number =      4
+, month =       aug
+, year =        1990
+, pages =       "105--114"
+, precedes =    "ss-ccsm-85, ss-mtgdn-89"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{sk-ekpsa-96
-, author =	"M. Segal and K. Kedem"
-, title =	"Enclosing {$k$} points in the smallest axis parallel rectangle"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"20--25"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "M. Segal and K. Kedem"
+, title =       "Enclosing {$k$} points in the smallest axis parallel rectangle"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "20--25"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @article{sk-ekpsa-98
-, author =	"M. Segal and K. Kedem"
-, title =	"Enclosing {$k$} points in the smallest axis parallel rectangle"
-, journal =	"Inform. Process. Lett."
-, volume =	65
-, year =	1998
-, pages =	"95--99"
-, update =	"99.11 smid"
+, author =      "M. Segal and K. Kedem"
+, title =       "Enclosing {$k$} points in the smallest axis parallel rectangle"
+, journal =     "Inform. Process. Lett."
+, volume =      65
+, year =        1998
+, pages =       "95--99"
+, update =      "99.11 smid"
 }
 
 @article{ss-pponp-88
-, author =	"M. Segal and C. H. Sequin"
-, title =	"Partitioning Polyhedral Objects into Nonintersecting Parts"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	8
-, number =	1
-, month =	jan
-, year =	1988
-, pages =	"53--67"
-, update =	"93.09 held"
+, author =      "M. Segal and C. H. Sequin"
+, title =       "Partitioning Polyhedral Objects into Nonintersecting Parts"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      8
+, number =      1
+, month =       jan
+, year =        1988
+, pages =       "53--67"
+, update =      "93.09 held"
 }
 
 @inproceedings{ss-ccsm-85
-, author =	"M. G. Segal and C. H. Sequin"
-, title =	"Consistent calculations for solids modelling"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"29--38"
-, precedes =	"ss-mtgdn-89"
-, cites =	"beh-gms-79, t-smcua-80, r-rrstm-80, gl-mc-83, ns-picg-79, w-at-42, hg-rshsa-77, sw-vfror-85, s-pipni-, ZZZ"
-, update =	"97.11 bibrelex, 93.09 milone+mitchell"
+, author =      "M. G. Segal and C. H. Sequin"
+, title =       "Consistent calculations for solids modelling"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "29--38"
+, precedes =    "ss-mtgdn-89"
+, cites =       "beh-gms-79, t-smcua-80, r-rrstm-80, gl-mc-83, ns-picg-79, w-at-42, hg-rshsa-77, sw-vfror-85, s-pipni-, ZZZ"
+, update =      "97.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @techreport{ss-mtgdn-89
-, author =	"M. G. Segal and C. H. Sequin"
-, title =	"Maintaining topology in geometric descriptions with numerical uncertainty"
-, type =	"Technical {Report}"
-, number =	"89/450"
-, institution =	"Comput. Sci. Div., Univ. California"
-, address =	"Berkeley, CA"
-, year =	1989
-, succeeds =	"ss-ccsm-85"
-, precedes =	"s-utgvp-90"
-, update =	"95.09 korneenko, 93.09 milone+mitchell"
+, author =      "M. G. Segal and C. H. Sequin"
+, title =       "Maintaining topology in geometric descriptions with numerical uncertainty"
+, type =        "Technical {Report}"
+, number =      "89/450"
+, institution = "Comput. Sci. Div., Univ. California"
+, address =     "Berkeley, CA"
+, year =        1989
+, succeeds =    "ss-ccsm-85"
+, precedes =    "s-utgvp-90"
+, update =      "95.09 korneenko, 93.09 milone+mitchell"
 }
 
 @incollection{s-pftbs-92
-, author =	"H.-P. Seidel"
-, title =	"Polar forms and triangular {B}-spline surfaces"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	1
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1992
-, pages =	"235--286"
-, keywords =	"survey paper, polar forms, triangular Bezier/B-spline surface patches"
-, precedes =	"s-pftbs-95"
-, update =	"98.07 icking, 93.09 erickson"
+, author =      "H.-P. Seidel"
+, title =       "Polar forms and triangular {B}-spline surfaces"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      1
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1992
+, pages =       "235--286"
+, keywords =    "survey paper, polar forms, triangular Bezier/B-spline surface patches"
+, precedes =    "s-pftbs-95"
+, update =      "98.07 icking, 93.09 erickson"
 }
 
 @incollection{s-pftbs-95
-, author =	"Hans-Peter Seidel"
-, title =	"Polar Forms and Triangular {B}-Spline Surfaces"
-, editor =	"Ding-Zhu Du and Frank Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1995
-, pages =	"299--350"
-, keywords =	"survey paper, polar forms, triangular Bezier/B-spline surface patches"
-, succeeds =	"s-pftbs-92"
-, update =	"98.07 icking"
+, author =      "Hans-Peter Seidel"
+, title =       "Polar Forms and Triangular {B}-Spline Surfaces"
+, editor =      "Ding-Zhu Du and Frank Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1995
+, pages =       "299--350"
+, keywords =    "survey paper, polar forms, triangular Bezier/B-spline surface patches"
+, succeeds =    "s-pftbs-92"
+, update =      "98.07 icking"
 }
 
 @mastersthesis{s-chaop-81
-, author =	"R. Seidel"
-, title =	"A convex hull algorithm optimal for point sets in even dimensions"
-, type =	"M.{Sc}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. British Columbia"
-, address =	"Vancouver, BC"
-, year =	1981
-, note =	"Report 81/14"
-, keywords =	"convex hull, $d$-dimensional, incrementation, incidence graph, polyhedra"
-, update =	"93.05 jones"
+, author =      "R. Seidel"
+, title =       "A convex hull algorithm optimal for point sets in even dimensions"
+, type =        "M.{Sc}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. British Columbia"
+, address =     "Vancouver, BC"
+, year =        1981
+, note =        "Report 81/14"
+, keywords =    "convex hull, $d$-dimensional, incrementation, incidence graph, polyhedra"
+, update =      "93.05 jones"
 }
 
 @techreport{s-mplbc-84
-, author =	"R. Seidel"
-, title =	"A Method for Proving Lower Bounds for Certain Geometric Problems"
-, type =	"Technical {Report}"
-, number =	"84-592"
-, institution =	"??"
-, month =	feb
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "R. Seidel"
+, title =       "A Method for Proving Lower Bounds for Certain Geometric Problems"
+, type =        "Technical {Report}"
+, number =      "84-592"
+, institution = "??"
+, month =       feb
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @incollection{s-mplbc-85
-, author =	"R. Seidel"
-, title =	"A method for proving lower bounds for certain geometric problems"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"319--334"
-, keywords =	"point location, triangulation, convex hull, geometric transformations, lower bounds"
+, author =      "R. Seidel"
+, title =       "A method for proving lower bounds for certain geometric problems"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "319--334"
+, keywords =    "point location, triangulation, convex hull, geometric transformations, lower bounds"
 }
 
 @techreport{s-sfira-90
-, author =	"R. Seidel"
-, title =	"A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons"
-, type =	"Technical {Report}"
-, number =	"B 90-07"
-, institution =	"Freie Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, month =	oct
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "R. Seidel"
+, title =       "A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons"
+, type =        "Technical {Report}"
+, number =      "B 90-07"
+, institution = "Freie Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, month =       oct
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @article{s-sfira-91
-, author =	"R. Seidel"
-, title =	"A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, number =	1
-, year =	1991
-, pages =	"51--64"
-, update =	"98.07 bibrelex"
+, author =      "R. Seidel"
+, title =       "A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, number =      1
+, year =        1991
+, pages =       "51--64"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{s-barga-91
-, author =	"R. Seidel"
-, title =	"Backwards Analysis of Randomized Geometric Algorithms"
-, type =	"Manuscript"
-, institution =	"ALCOM Summerschool on efficient algorithms design"
-, address =	"{\AA}rhus, Denmark"
-, year =	1991
-, precedes =	"s-barga-93, s-barg-92"
-, update =	"98.11 bibrelex, 93.09 erickson"
+, author =      "R. Seidel"
+, title =       "Backwards Analysis of Randomized Geometric Algorithms"
+, type =        "Manuscript"
+, institution = "ALCOM Summerschool on efficient algorithms design"
+, address =     "{\AA}rhus, Denmark"
+, year =        1991
+, precedes =    "s-barga-93, s-barg-92"
+, update =      "98.11 bibrelex, 93.09 erickson"
 }
 
 @techreport{s-barg-92
-, author =	"R. Seidel"
-, title =	"Backwards analysis of randomized geometric algorithms"
-, type =	"Report"
-, number =	"TR-92-014"
-, institution =	"Computer Science Division, University of California"
-, address =	"Berkeley"
-, month =	feb
-, year =	1992
-, succeeds =	"s-barga-91"
-, precedes =	"s-barga-93"
-, update =	"98.11 bibrelex"
+, author =      "R. Seidel"
+, title =       "Backwards analysis of randomized geometric algorithms"
+, type =        "Report"
+, number =      "TR-92-014"
+, institution = "Computer Science Division, University of California"
+, address =     "Berkeley"
+, month =       feb
+, year =        1992
+, succeeds =    "s-barga-91"
+, precedes =    "s-barga-93"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{s-barga-93
-, author =	"R. Seidel"
-, title =	"Backwards Analysis of Randomized Geometric Algorithms"
-, editor =	"J. Pach"
-, booktitle =	"New Trends in Discrete and Computational Geometry"
-, series =	"Algorithms and Combinatorics"
-, volume =	10
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"37--68"
-, keywords =	"survey paper, randomized algorithms, backwards analysis, Delaunay triangulation, segment intersection, convex hull, quicksort, linear programming"
-, succeeds =	"s-barg-92, s-barga-91"
-, update =	"98.11 bibrelex, 93.09 erickson+matousek"
+, author =      "R. Seidel"
+, title =       "Backwards Analysis of Randomized Geometric Algorithms"
+, editor =      "J. Pach"
+, booktitle =   "New Trends in Discrete and Computational Geometry"
+, series =      "Algorithms and Combinatorics"
+, volume =      10
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "37--68"
+, keywords =    "survey paper, randomized algorithms, backwards analysis, Delaunay triangulation, segment intersection, convex hull, quicksort, linear programming"
+, succeeds =    "s-barg-92, s-barga-91"
+, update =      "98.11 bibrelex, 93.09 erickson+matousek"
 }
 
 @techreport{s-cdtvd-88
-, author =	"R. Seidel"
-, title =	"Constrained {Delaunay} triangulations and {Voronoi} diagrams with obstacles"
-, type =	"Technical Report"
-, number =	260
-, institution =	"IIG-TU Graz"
-, address =	"Austria"
-, year =	1988
-, precedes =	"s-cdtvd-89"
-, update =	"99.03 forrest, 98.11 bibrelex"
-, annote =	"Plane sweep algorithm"
+, author =      "R. Seidel"
+, title =       "Constrained {Delaunay} triangulations and {Voronoi} diagrams with obstacles"
+, type =        "Technical Report"
+, number =      260
+, institution = "IIG-TU Graz"
+, address =     "Austria"
+, year =        1988
+, precedes =    "s-cdtvd-89"
+, update =      "99.03 forrest, 98.11 bibrelex"
+, annote =      "Plane sweep algorithm"
 }
 
 @article{s-cdtvd-89
-, author =	"R. Seidel"
-, title =	"Constrained {Delaunay} Triangulations and {Voronoi} Diagrams with Obstacles"
-, journal =	"Computer Science Division"
-, volume =	"??"
-, month =	jun
-, year =	1989
-, note =	"UC Berkeley"
-, succeeds =	"s-cdtvd-88"
-, update =	"99.03 forrest, 98.11 bibrelex, 98.07 bibrelex"
+, author =      "R. Seidel"
+, title =       "Constrained {Delaunay} Triangulations and {Voronoi} Diagrams with Obstacles"
+, journal =     "Computer Science Division"
+, volume =      "??"
+, month =       jun
+, year =        1989
+, note =        "UC Berkeley"
+, succeeds =    "s-cdtvd-88"
+, update =      "99.03 forrest, 98.11 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{s-chdch-86
-, author =	"R. Seidel"
-, title =	"Constructing higher-dimensional convex hulls at logarithmic cost per face"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"404--413"
-, keywords =	"convex hull, incidence graph, polyhedra, linear programming, $d$-dimensional, output dependent"
+, author =      "R. Seidel"
+, title =       "Constructing higher-dimensional convex hulls at logarithmic cost per face"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "404--413"
+, keywords =    "convex hull, incidence graph, polyhedra, linear programming, $d$-dimensional, output dependent"
 }
 
 @incollection{s-chc-97
-, author =	"R. Seidel"
-, title =	"Convex hull computations"
-, chapter =	19
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"361--376"
-, update =	"97.11 orourke"
+, author =      "R. Seidel"
+, title =       "Convex hull computations"
+, chapter =     19
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "361--376"
+, update =      "97.11 orourke"
 }
 
 @incollection{s-eubnf-91
-, author =	"R. Seidel"
-, title =	"Exact upper bounds for the number of faces in $d$-dimensional {V}oronoi diagrams"
-, editor =	"P. Gritzman and B. Sturmfels"
-, booktitle =	"Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
-, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
-, volume =	4
-, publisher =	"AMS Press"
-, address =	"Providence, RI"
-, year =	1991
-, pages =	"517--530"
-, update =	"98.07 agarwal, 98.03 agarwal"
+, author =      "R. Seidel"
+, title =       "Exact upper bounds for the number of faces in $d$-dimensional {V}oronoi diagrams"
+, editor =      "P. Gritzman and B. Sturmfels"
+, booktitle =   "Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
+, series =      "DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
+, volume =      4
+, publisher =   "AMS Press"
+, address =     "Providence, RI"
+, year =        1991
+, pages =       "517--530"
+, update =      "98.07 agarwal, 98.03 agarwal"
 }
 
 @inproceedings{s-lpchm-90
-, author =	"R. Seidel"
-, title =	"Linear programming and convex hulls made easy"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"211--215"
-, precedes =	"s-sdlpc-91"
-, cites =	"ck-acp-70, c-lpot-86, c-lvali-89, cs-arscg-89, d-ltatt-84, df-rafdl-87, e-acg-87, g-eadch-72, k-chahd-81, m-ltalp-83, m-lpltw-84, ph-chfsp-77, s-chaop-81, s-chdch-86, s-fchff-85, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "R. Seidel"
+, title =       "Linear programming and convex hulls made easy"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "211--215"
+, precedes =    "s-sdlpc-91"
+, cites =       "ck-acp-70, c-lpot-86, c-lvali-89, cs-arscg-89, d-ltatt-84, df-rafdl-87, e-acg-87, g-eadch-72, k-chahd-81, m-ltalp-83, m-lpltw-84, ph-chfsp-77, s-chaop-81, s-chdch-86, s-fchff-85, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{s-apspp-92
-, author =	"R. Seidel"
-, title =	"On the all-pairs-shortest-path problem"
-, booktitle =	"Proc. 24th Annu. ACM Sympos. Theory Comput."
-, year =	1992
-, pages =	"745--749"
+, author =      "R. Seidel"
+, title =       "On the all-pairs-shortest-path problem"
+, booktitle =   "Proc. 24th Annu. ACM Sympos. Theory Comput."
+, year =        1992
+, pages =       "745--749"
 }
 
 @inproceedings{s-eqcpp-98
-, author =	"Raimund Seidel"
-, title =	"On the Exact Query Complexity of Planar Point Location"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"7--8"
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Raimund Seidel"
+, title =       "On the Exact Query Complexity of Planar Point Location"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "7--8"
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{s-nfhdv-87
-, author =	"R. Seidel"
-, title =	"On the number of faces in higher-dimensional {Voronoi} diagrams"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"181--185"
-, keywords =	"$d$-dimensional, Voronoi diagrams, combinatorial geometry, polyhedra"
-, cites =	"bl-psmcf-81, b-vdch-79, ms-cpubc-71, p-kpudz-82, s-cvdhd-82, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "R. Seidel"
+, title =       "On the number of faces in higher-dimensional {Voronoi} diagrams"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "181--185"
+, keywords =    "$d$-dimensional, Voronoi diagrams, combinatorial geometry, polyhedra"
+, cites =       "bl-psmcf-81, b-vdch-79, ms-cpubc-71, p-kpudz-82, s-cvdhd-82, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{s-scpvd-82
-, author =	"R. Seidel"
-, title =	"On the size of closest-point {Voronoi} diagrams"
-, type =	"Report"
-, number =	"F94"
-, institution =	"Inst. Informationsverarb., Tech. Univ. Graz"
-, address =	"Graz, Austria"
-, year =	1982
-, keywords =	"Voronoi diagrams, lower bounds, polyhedra"
-, precedes =	"s-cvdhd-82"
+, author =      "R. Seidel"
+, title =       "On the size of closest-point {Voronoi} diagrams"
+, type =        "Report"
+, number =      "F94"
+, institution = "Inst. Informationsverarb., Tech. Univ. Graz"
+, address =     "Graz, Austria"
+, year =        1982
+, keywords =    "Voronoi diagrams, lower bounds, polyhedra"
+, precedes =    "s-cvdhd-82"
 }
 
 @phdthesis{s-ossac-86
-, author =	"R. Seidel"
-, title =	"Output-size sensitive algorithms for constructive problems in computational geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1986
-, note =	"Technical Report TR 86-784"
-, keywords =	"doctoral thesis, convex hull, incidence graph, divide-and-conquer, plane-sweep, domination, intersection, $d$-dimensional, output dependent"
-, comments =	"UMI AAC87-08959, 148 pp."
-, update =	"93.09 jones, 93.05 jones"
+, author =      "R. Seidel"
+, title =       "Output-size sensitive algorithms for constructive problems in computational geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1986
+, note =        "Technical Report TR 86-784"
+, keywords =    "doctoral thesis, convex hull, incidence graph, divide-and-conquer, plane-sweep, domination, intersection, $d$-dimensional, output dependent"
+, comments =    "UMI AAC87-08959, 148 pp."
+, update =      "93.09 jones, 93.05 jones"
 }
 
 @article{s-sdlpc-91
-, author =	"R. Seidel"
-, title =	"Small-dimensional linear programming and convex hulls made easy"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"423--434"
-, succeeds =	"s-lpchm-90"
+, author =      "R. Seidel"
+, title =       "Small-dimensional linear programming and convex hulls made easy"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "423--434"
+, succeeds =    "s-lpchm-90"
 }
 
 @inproceedings{s-tcg-93
-, author =	"Raimund Seidel"
-, title =	"Teaching Computational Geometry"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	272
-, update =	"93.09 milone+mitchell"
+, author =      "Raimund Seidel"
+, title =       "Teaching Computational Geometry"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       272
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{s-cvdhd-82
-, author =	"R. Seidel"
-, title =	"The complexity of {Voronoi} diagrams in higher dimensions"
-, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
-, year =	1982
-, pages =	"94--95"
-, keywords =	"Voronoi diagrams, lower bounds, polyhedra"
-, succeeds =	"s-scpvd-82"
+, author =      "R. Seidel"
+, title =       "The complexity of {Voronoi} diagrams in higher dimensions"
+, booktitle =   "Proc. 20th Allerton Conf. Commun. Control Comput."
+, year =        1982
+, pages =       "94--95"
+, keywords =    "Voronoi diagrams, lower bounds, polyhedra"
+, succeeds =    "s-scpvd-82"
 }
 
 @techreport{s-nmpgc-94t
-, author =	"R. Seidel"
-, title =	"The nature and meaning of perturbations in geometric computing"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "R. Seidel"
+, title =       "The nature and meaning of perturbations in geometric computing"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{s-nmpgc-94
-, author =	"R. Seidel"
-, title =	"The Nature and Meaning of Perturbations in Geometric Computing"
-, booktitle =	"Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
-, nickname =	"STACS '94"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	775
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"3--17"
-, update =	"98.11 bibrelex, 96.09 devillers"
+, author =      "R. Seidel"
+, title =       "The Nature and Meaning of Perturbations in Geometric Computing"
+, booktitle =   "Proc. 11th Sympos. Theoret. Aspects Comput. Sci."
+, nickname =    "STACS '94"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      775
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "3--17"
+, update =      "98.11 bibrelex, 96.09 devillers"
 }
 
 @article{s-nmpgc-98
-, author =	"R. Seidel"
-, title =	"The Nature and Meaning of Perturbations in Geometric Computing"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"1--17"
-, update =	"98.03 agarwal"
+, author =      "R. Seidel"
+, title =       "The Nature and Meaning of Perturbations in Geometric Computing"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "1--17"
+, update =      "98.03 agarwal"
 }
 
 @article{s-ubtpe-95
-, author =	"R. Seidel"
-, title =	"The upper bound theorem for polytopes: an easy proof of its asymptotic version"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"115--116"
-, update =	"96.09 devillers"
+, author =      "R. Seidel"
+, title =       "The upper bound theorem for polytopes: an easy proof of its asymptotic version"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "115--116"
+, update =      "96.09 devillers"
 }
 
 @article{sa-rst-96
-, author =	"R. Seidel and C. R. Aragon"
-, title =	"Randomized search trees"
-, journal =	"Algorithmica"
-, volume =	16
-, year =	1996
-, pages =	"464--497"
-, update =	"97.03 smid"
+, author =      "R. Seidel and C. R. Aragon"
+, title =       "Randomized search trees"
+, journal =     "Algorithmica"
+, volume =      16
+, year =        1996
+, pages =       "464--497"
+, update =      "97.03 smid"
 }
 
 @article{s-ndmea-54
-, author =	"A. Seidenberg"
-, title =	"A new decision method for elementary algebra"
-, journal =	"Annals Math."
-, volume =	60
-, year =	1954
-, pages =	"365--374"
-, update =	"98.03 bibrelex"
+, author =      "A. Seidenberg"
+, title =       "A new decision method for elementary algebra"
+, journal =     "Annals Math."
+, volume =      60
+, year =        1954
+, pages =       "365--374"
+, update =      "98.03 bibrelex"
 }
 
 @book{st-ldt-47
-, author =	"H. Seifert and W. Threlfall"
-, title =	"Lehrbuch der {Topologie}"
-, publisher =	"Chelsea Publishing Company"
-, year =	1947
-, update =	"98.03 bibrelex"
+, author =      "H. Seifert and W. Threlfall"
+, title =       "Lehrbuch der {Topologie}"
+, publisher =   "Chelsea Publishing Company"
+, year =        1947
+, update =      "98.03 bibrelex"
 }
 
 @book{st-vig-38
-, author =	"H. Seifert and W. Threlfall"
-, title =	"Variationsrechnung im {Grossen}"
-, publisher =	"B. G. Teubner"
-, address =	"Berlin"
-, year =	1938
-, update =	"99.11 bibrelex, 98.07 bibrelex"
+, author =      "H. Seifert and W. Threlfall"
+, title =       "Variationsrechnung im {Grossen}"
+, publisher =   "B. G. Teubner"
+, address =     "Berlin"
+, year =        1938
+, update =      "99.11 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{sd-sgslw-81
-, author =	"A. Seigel and D. Dolev"
-, title =	"The separation for general single-layer wiring barriers"
-, booktitle =	"Proc. of the CMU Conference on VLSI"
-, year =	1981
-, pages =	"143--152"
-, update =	"98.03 bibrelex"
+, author =      "A. Seigel and D. Dolev"
+, title =       "The separation for general single-layer wiring barriers"
+, booktitle =   "Proc. of the CMU Conference on VLSI"
+, year =        1981
+, pages =       "143--152"
+, update =      "98.03 bibrelex"
 }
 
 @article{sy-rafmn-93
-, author =	"K. Sekitani and Y. Yamamoto"
-, title =	"A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes"
-, journal =	"Math. Program. Ser. A"
-, volume =	61
-, number =	2
-, year =	1993
-, pages =	"233--249"
-, update =	"97.03 gaertner+salinger"
+, author =      "K. Sekitani and Y. Yamamoto"
+, title =       "A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes"
+, journal =     "Math. Program. Ser. A"
+, volume =      61
+, number =      2
+, year =        1993
+, pages =       "233--249"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{si-kmtag-84
-, author =	"S. Z. Selim and M. A. Ismail"
-, title =	"$K$-Means-Type Algorithm: A Generalized Convergence Theorem and Characterization"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"??"
-, year =	1984
-, pages =	"81--87"
-, update =	"97.11 bibrelex"
+, author =      "S. Z. Selim and M. A. Ismail"
+, title =       "$K$-Means-Type Algorithm: A Generalized Convergence Theorem and Characterization"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "??"
+, year =        1984
+, pages =       "81--87"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{s-adacc-98
-, author =	"J{\"u}rgen Sellen"
-, title =	"Approximation and Decision Algorithms for Curvature-Constrained Path Planning: {A} State-Space Approach"
-, booktitle =	"Proc. 3rd Workshop Algorithmic Found. Robot."
-, nickname =	"WAFR '98"
-, year =	1998
-, pages =	"to appear"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "J{\"u}rgen Sellen"
+, title =       "Approximation and Decision Algorithms for Curvature-Constrained Path Planning: {A} State-Space Approach"
+, booktitle =   "Proc. 3rd Workshop Algorithmic Found. Robot."
+, nickname =    "WAFR '98"
+, year =        1998
+, pages =       "to appear"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{s-dwspp-95
-, author =	"J. Sellen"
-, title =	"Direction weighted shortest path planning"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Nagoya"
-, year =	1995
-, pages =	"1970--1975"
-, update =	"96.05 mitchell"
+, author =      "J. Sellen"
+, title =       "Direction weighted shortest path planning"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Nagoya"
+, year =        1995
+, pages =       "1970--1975"
+, update =      "96.05 mitchell"
 }
 
 @article{s-lbgpp-96
-, author =	"J. Sellen"
-, title =	"Lower bounds for geometrical and physical problems"
-, journal =	"SIAM J. Comput."
-, volume =	25
-, year =	1996
-, pages =	"1231--1253"
-, update =	"97.03 smid"
+, author =      "J. Sellen"
+, title =       "Lower bounds for geometrical and physical problems"
+, journal =     "SIAM J. Comput."
+, volume =      25
+, year =        1996
+, pages =       "1231--1253"
+, update =      "97.03 smid"
 }
 
 @inproceedings{s-ppmc-95
-, author =	"J. Sellen"
-, title =	"Planning paths of minimal curvature"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Nagoya"
-, year =	1995
-, pages =	"1976--1982"
-, comments =	"also contains an interesting algorithm for the Fortune-Wilfong
-		problem, to find a minimal-length curvature-constrained
-		path in a polygonal environment."
-, update =	"96.05 mitchell"
+, author =      "J. Sellen"
+, title =       "Planning paths of minimal curvature"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Nagoya"
+, year =        1995
+, pages =       "1976--1982"
+, comments =    "also contains an interesting algorithm for the Fortune-Wilfong
+                problem, to find a minimal-length curvature-constrained
+                path in a polygonal environment."
+, update =      "96.05 mitchell"
 }
 
 @article{scy-psesp-00
-, author =	"J. Sellen and J. Choi and C.-K. Yap"
-, title =	"Precision-Sensitive {Euclidean} Shortest Path in 3-Space"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, year =	2000
-, pages =	"1577--1595"
-, update =	"00.11 smid"
+, author =      "J. Sellen and J. Choi and C.-K. Yap"
+, title =       "Precision-Sensitive {Euclidean} Shortest Path in 3-Space"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, year =        2000
+, pages =       "1577--1595"
+, update =      "00.11 smid"
 }
 
 @inproceedings{srf-rtdim-87
-, author =	"T. Sellis and N. Roussopoulos and C. Faloutsos"
-, title =	"The {$\rm R^+$}-tree: {A} dynamic index for multi-dimensional objects"
-, booktitle =	"Proc. 13th VLDB Conference"
-, year =	1987
-, pages =	"507--517"
-, update =	"97.07 agarwal"
+, author =      "T. Sellis and N. Roussopoulos and C. Faloutsos"
+, title =       "The {$\rm R^+$}-tree: {A} dynamic index for multi-dimensional objects"
+, booktitle =   "Proc. 13th VLDB Conference"
+, year =        1987
+, pages =       "507--517"
+, update =      "97.07 agarwal"
 }
 
 @book{sr-iag-49
-, author =	"J. Semple and L. Roth"
-, title =	"Introduction to Algebraic Geometry"
-, publisher =	"Clarendon Press"
-, year =	1949
-, update =	"97.11 bibrelex"
+, author =      "J. Semple and L. Roth"
+, title =       "Introduction to Algebraic Geometry"
+, publisher =   "Clarendon Press"
+, year =        1949
+, update =      "97.11 bibrelex"
 }
 
 @mastersthesis{s-aeusf-96
-, author =	"I. Semrau"
-, title =	"Analyse und experimentelle {Untersuchung} von {Strategien} zum {Finden} eines {Ziels} in {Stra{\ss}enpolygonen}"
-, type =	"Diploma thesis"
-, school =	"FernUniversit{\"a}t Hagen"
-, year =	1996
-, keywords =	"master thesis"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "I. Semrau"
+, title =       "Analyse und experimentelle {Untersuchung} von {Strategien} zum {Finden} eines {Ziels} in {Stra{\ss}enpolygonen}"
+, type =        "Diploma thesis"
+, school =      "FernUniversit{\"a}t Hagen"
+, year =        1996
+, keywords =    "master thesis"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @article{s-ercbk-68
-, author =	"P. K. Sen"
-, title =	"Estimates of the Regression Coefficient Based on Kendall's Tau"
-, journal =	"J. Amer. Statist. Assoc."
-, volume =	63
-, year =	1968
-, pages =	"1379--1389"
-, update =	"98.07 bibrelex"
+, author =      "P. K. Sen"
+, title =       "Estimates of the Regression Coefficient Based on Kendall's Tau"
+, journal =     "J. Amer. Statist. Assoc."
+, volume =      63
+, year =        1968
+, pages =       "1379--1389"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{s-dplto-95
-, author =	"S. Sen"
-, title =	"A deterministic {poly($\log\log n$)} time optimal {CRCW} {PRAM} algorithm for linear programming in fixed dimension"
-, type =	"Technical {Report}"
-, number =	"95-08"
-, institution =	"Dept. of Computer Science, University of Newcastle"
-, year =	1995
-, update =	"96.09 orourke"
+, author =      "S. Sen"
+, title =       "A deterministic {poly($\log\log n$)} time optimal {CRCW} {PRAM} algorithm for linear programming in fixed dimension"
+, type =        "Technical {Report}"
+, number =      "95-08"
+, institution = "Dept. of Computer Science, University of Newcastle"
+, year =        1995
+, update =      "96.09 orourke"
 }
 
 @inproceedings{s-fcs-92
-, author =	"S. Sen"
-, title =	"Fractional cascading simplified"
-, booktitle =	"Proc. 3rd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	621
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"212--220"
+, author =      "S. Sen"
+, title =       "Fractional cascading simplified"
+, booktitle =   "Proc. 3rd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      621
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "212--220"
 }
 
 @inproceedings{s-lbadt-94
-, author =	"S. Sen"
-, title =	"Lower bounds for algebraic decision trees, complexity of convex hulls and related problems"
-, booktitle =	"Proc. 14th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, site =	"Madras,  India"
-, year =	1994
-, update =	"97.11 bibrelex"
+, author =      "S. Sen"
+, title =       "Lower bounds for algebraic decision trees, complexity of convex hulls and related problems"
+, booktitle =   "Proc. 14th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, site =        "Madras,  India"
+, year =        1994
+, update =      "97.11 bibrelex"
 }
 
 @techreport{s-mapl-
-, author =	"S. Sen"
-, title =	"Maintaining arrangements for point location"
-, type =	"Technical {Memo}"
-, institution =	"Bell Lab."
-, update =	"97.11 bibrelex"
+, author =      "S. Sen"
+, title =       "Maintaining arrangements for point location"
+, type =        "Technical {Memo}"
+, institution = "Bell Lab."
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{s-pmsua-96
-, author =	"S. Sen"
-, title =	"Parallel multidimensional search using approximation algorithms: with applications to linear-programming and related problems"
-, booktitle =	"Proc. 8th ACM Sympos. Paral. Algorithms and Architectures"
-, year =	1996
-, pages =	"251--260"
-, keywords =	"parallel computations, linear programming"
-, update =	"96.09 agarwal, 96.05 agarwal"
+, author =      "S. Sen"
+, title =       "Parallel multidimensional search using approximation algorithms: with applications to linear-programming and related problems"
+, booktitle =   "Proc. 8th ACM Sympos. Paral. Algorithms and Architectures"
+, year =        1996
+, pages =       "251--260"
+, keywords =    "parallel computations, linear programming"
+, update =      "96.09 agarwal, 96.05 agarwal"
 }
 
 @unpublished{s-sosl-
-, author =	"S. Sen"
-, title =	"Some observations on skip lists"
-, note =	"??"
-, update =	"98.03 bibrelex"
+, author =      "S. Sen"
+, title =       "Some observations on skip lists"
+, note =        "??"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{s-tbspc-93
-, author =	"S. Sen"
-, title =	"Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range"
-, type =	"Report"
-, number =	"MPI-I-93-129"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, update =	"93.09 smid"
+, author =      "S. Sen"
+, title =       "Tight bounds for some problems in computational geometry: the complete sub-logarithmic parallel time range"
+, type =        "Report"
+, number =      "MPI-I-93-129"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, update =      "93.09 smid"
 }
 
 @incollection{s-cq-97
-, author =	"M. Senechal"
-, title =	"Crystals and quasicrystals"
-, chapter =	51
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"933--950"
-, update =	"97.11 orourke"
+, author =      "M. Senechal"
+, title =       "Crystals and quasicrystals"
+, chapter =     51
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "933--950"
+, update =      "97.11 orourke"
 }
 
 @techreport{s-ods-88
-, author =	"M. Senechal"
-, title =	"Orderly dispositions in space"
-, type =	"{IMA} {Preprint} {Series}"
-, number =	406
-, institution =	"Inst. Math. Appl., Univ. Minnesota"
-, address =	"Minneapolis, MN"
-, year =	1988
+, author =      "M. Senechal"
+, title =       "Orderly dispositions in space"
+, type =        "{IMA} {Preprint} {Series}"
+, number =      406
+, institution = "Inst. Math. Appl., Univ. Minnesota"
+, address =     "Minneapolis, MN"
+, year =        1988
 }
 
 @article{s-ttosf-88
-, author =	"M. Senechal"
-, title =	"Tiling the torus and other space forms"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"55--72"
+, author =      "M. Senechal"
+, title =       "Tiling the torus and other space forms"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "55--72"
 }
 
 @article{sw-vfror-85
-, author =	"C. H. S{\'e}quin and P. R. Wensley"
-, title =	"Visible Feature Return at Object Resolution"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	"??"
-, year =	1985
-, note =	"To be published"
-, update =	"97.11 bibrelex"
+, author =      "C. H. S{\'e}quin and P. R. Wensley"
+, title =       "Visible Feature Return at Object Resolution"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      "??"
+, year =        1985
+, note =        "To be published"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{svh-bpepa-89
-, author =	"B. Serpette and J. Vuillemin and J. C. Herv{`e}"
-, title =	"{BigNum}: a portable and efficient package for arbitrary-precision arithmetic"
-, institution =	"INRIA"
-, month =	may
-, year =	1989
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "B. Serpette and J. Vuillemin and J. C. Herv{`e}"
+, title =       "{BigNum}: a portable and efficient package for arbitrary-precision arithmetic"
+, institution = "INRIA"
+, month =       may
+, year =        1989
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @book{s-iamm-82
-, author =	"J. Serra"
-, title =	"Image Analysis and Mathematical Morphology"
-, publisher =	"Academic Press"
-, address =	"London, UK"
-, year =	1982
-, update =	"98.07 bibrelex"
+, author =      "J. Serra"
+, title =       "Image Analysis and Mathematical Morphology"
+, publisher =   "Academic Press"
+, address =     "London, UK"
+, year =        1982
+, update =      "98.07 bibrelex"
 }
 
 @book{s-iamm-88
-, title =	"Image Analysis and Mathematical Morphology, volume 2: {Theoretical} Advances"
-, editor =	"J. Serra"
-, publisher =	"Academic Press"
-, address =	"New York"
-, year =	1988
-, update =	"98.07 bibrelex"
+, title =       "Image Analysis and Mathematical Morphology, volume 2: {Theoretical} Advances"
+, editor =      "J. Serra"
+, publisher =   "Academic Press"
+, address =     "New York"
+, year =        1988
+, update =      "98.07 bibrelex"
 }
 
 @article{s-harst-81
-, author =	"M. Servit"
-, title =	"Heuristic algorithms for rectlinear {Steiner} trees"
-, journal =	"Digital Processes"
-, volume =	7
-, year =	1981
-, pages =	"21--32"
-, update =	"98.07 bibrelex"
+, author =      "M. Servit"
+, title =       "Heuristic algorithms for rectlinear {Steiner} trees"
+, journal =     "Digital Processes"
+, volume =      7
+, year =        1981
+, pages =       "21--32"
+, update =      "98.07 bibrelex"
 }
 
 @book{s-lsm-96
-, author =	"J. A. Sethian"
-, title =	"Level Set Methods"
-, publisher =	"Cambridge University Press"
-, year =	1996
-, update =	"00.03 devillers"
+, author =      "J. A. Sethian"
+, title =       "Level Set Methods"
+, publisher =   "Cambridge University Press"
+, year =        1996
+, update =      "00.03 devillers"
 }
 
 @book{s-lsmfm-01
-, author =	"J. A. Sethian"
-, title =	"Level set methods and fast marching methods"
-, publisher =	"Cambridge"
-, year =	1999
-, note =	""
-, update =	"02.03 pocchiola"
+, author =      "J. A. Sethian"
+, title =       "Level set methods and fast marching methods"
+, publisher =   "Cambridge"
+, year =        1999
+, note =        ""
+, update =      "02.03 pocchiola"
 }
 
 @inproceedings{sk-ftmsd-96
-, author =	"K. Sevcik and N. Koudas"
-, title =	"Filter trees for managing spatial data over a range of size granularities"
-, booktitle =	"Proc. 22nd VLDB Conference"
-, year =	1996
-, pages =	"16--27"
-, update =	"97.07 agarwal"
+, author =      "K. Sevcik and N. Koudas"
+, title =       "Filter trees for managing spatial data over a range of size granularities"
+, booktitle =   "Proc. 22nd VLDB Conference"
+, year =        1996
+, pages =       "16--27"
+, update =      "97.07 agarwal"
 }
 
 @article{s-dptds-86
-, author =	"Michael Sever"
-, title =	"{Delaunay} Partitioning In Three Dimensions And Semiconductor Models"
-, journal =	"COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering"
-, volume =	5
-, number =	2
-, month =	jun
-, year =	1986
-, pages =	"75--93"
-, keywords =	"Delaunay partitioning, semiconductor models, scharfetter-gummel discretization, Voronoi cross-sections"
-, annote =	"Incremental algorithm in 3D. First take a surrounding
-		 tetra. Connect new point to all points of tetra whose
-		 c-sphere it lies in. Delete edges that are only in bad
-		 tetrahedra. Yet another proof."
-, abstract =	"An algorithm for Delaunay partitioning in three
-		 dimensions is given, and its use in numerical
-		 semiconductor models is examined. In particular,
-		 tetrahedral elements are found to be compatible with
-		 the Scharfetter-Gummel discretization of the stationary
-		 continuity equations associated with such models, using
-		 the Voronoi cross-sections for each edge in the
-		 obtained network. For tetrahedral elements, however,
-		 the Voronoi cross-sections do not coincide with those
-		 previously shown to be compatible with the
-		 Scharfetter-Gummel method. (Author abstract) 16 refs."
+, author =      "Michael Sever"
+, title =       "{Delaunay} Partitioning In Three Dimensions And Semiconductor Models"
+, journal =     "COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering"
+, volume =      5
+, number =      2
+, month =       jun
+, year =        1986
+, pages =       "75--93"
+, keywords =    "Delaunay partitioning, semiconductor models, scharfetter-gummel discretization, Voronoi cross-sections"
+, annote =      "Incremental algorithm in 3D. First take a surrounding
+                 tetra. Connect new point to all points of tetra whose
+                 c-sphere it lies in. Delete edges that are only in bad
+                 tetrahedra. Yet another proof."
+, abstract =    "An algorithm for Delaunay partitioning in three
+                 dimensions is given, and its use in numerical
+                 semiconductor models is examined. In particular,
+                 tetrahedral elements are found to be compatible with
+                 the Scharfetter-Gummel discretization of the stationary
+                 continuity equations associated with such models, using
+                 the Voronoi cross-sections for each edge in the
+                 obtained network. For tetrahedral elements, however,
+                 the Voronoi cross-sections do not coincide with those
+                 previously shown to be compatible with the
+                 Scharfetter-Gummel method. (Author abstract) 16 refs."
 }
 
 @inproceedings{slsds-hicaw-96
-, author =	"Jonathan Shade and Dani Lischinski and David Salesin and Tony {DeRose} and John Snyder"
-, title =	"Hierarchical Image Caching for Accelerated Walkthroughs of Complex Environments"
-, booktitle =	"Proc. SIGGRAPH '96"
-, series =	"In {\em Comput. Graph.\/} Proceedings, Annual Conference Series"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"Addison-Wesley"
-, year =	1996
-, pages =	"75--82"
-, update =	"98.03 agarwal"
+, author =      "Jonathan Shade and Dani Lischinski and David Salesin and Tony {DeRose} and John Snyder"
+, title =       "Hierarchical Image Caching for Accelerated Walkthroughs of Complex Environments"
+, booktitle =   "Proc. SIGGRAPH '96"
+, series =      "In {\em Comput. Graph.\/} Proceedings, Annual Conference Series"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "Addison-Wesley"
+, year =        1996
+, pages =       "75--82"
+, update =      "98.03 agarwal"
 }
 
 @book{s-bag-77
-, author =	"I. R. Shafarevich"
-, title =	"Basic Algebraic Geometry"
-, edition =	2
-, publisher =	"Springer"
-, address =	"Berlin"
-, year =	1977
-, isbn =	"3-540-08264-6"
-, update =	"97.11 bibrelex"
-, annote =	"Part I. Algebraic varieties in a projective space I.
+, author =      "I. R. Shafarevich"
+, title =       "Basic Algebraic Geometry"
+, edition =     2
+, publisher =   "Springer"
+, address =     "Berlin"
+, year =        1977
+, isbn =        "3-540-08264-6"
+, update =      "97.11 bibrelex"
+, annote =      "Part I. Algebraic varieties in a projective space I.
                  Fundamental concepts II. Local properties III. Divisors
                  and differential forms IV. Intersection indices Part
                  II. Schemes and varieties V. Schemes VI. Varieties Part
@@ -131158,1885 +131158,1885 @@ @book{s-bag-77
 }
 
 @inproceedings{sa-sprint-96
-, author =	"J. Shafer and R. Agrawal and M. Mehta"
-, title =	"SPRINT: A Scalable Parallel Classifier for Data Mining."
-, booktitle =	"Proceedings of the International Conference on Very Large Databases"
-, publisher =	"Morgan Kauffman"
-, year =	1996
-, pages =	"544--555"
-, update =	"98.07 agarwal"
+, author =      "J. Shafer and R. Agrawal and M. Mehta"
+, title =       "SPRINT: A Scalable Parallel Classifier for Data Mining."
+, booktitle =   "Proceedings of the International Conference on Very Large Databases"
+, publisher =   "Morgan Kauffman"
+, year =        1996
+, pages =       "544--555"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{ss-roga-93
-, author =	"L. Shafer and W. Steiger"
-, title =	"Randomizing optimal geometric algorithms"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"133--138"
-, precedes =	"ss-roga-95"
-, cites =	"b-chfsp-78, csss-otass-89, e-nchap-77, e-acg-87, fr-etbs-75, ks-upcha-86, ls-otahs-90, lms-hscr-92, lms-ahsc-94, m-roass-91, mt-uchap-85, mt-uchap-85, fr-aasfs-75, gs-cchsp-79, ol-fcbch-80, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "L. Shafer and W. Steiger"
+, title =       "Randomizing optimal geometric algorithms"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "133--138"
+, precedes =    "ss-roga-95"
+, cites =       "b-chfsp-78, csss-otass-89, e-nchap-77, e-acg-87, fr-etbs-75, ks-upcha-86, ls-otahs-90, lms-hscr-92, lms-ahsc-94, m-roass-91, mt-uchap-85, mt-uchap-85, fr-aasfs-75, gs-cchsp-79, ol-fcbch-80, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @techreport{ss-roga-95
-, author =	"L. Shafer and W. Steiger"
-, title =	"Randomizing optimal geometric algorithms"
-, type =	"Technical {Report}"
-, number =	"94-22"
-, institution =	"DIMACS"
-, year =	1995
-, succeeds =	"ss-roga-93"
-, update =	"98.11 bibrelex, 96.09 orourke"
+, author =      "L. Shafer and W. Steiger"
+, title =       "Randomizing optimal geometric algorithms"
+, type =        "Technical {Report}"
+, number =      "94-22"
+, institution = "DIMACS"
+, year =        1995
+, succeeds =    "ss-roga-93"
+, update =      "98.11 bibrelex, 96.09 orourke"
 }
 
 @article{ss-aerrl-88
-, author =	"C. A. Shaffer and H. Samet"
-, title =	"An algorithm to expand regions represented by linear quadtrees"
-, journal =	"Image Vision Comput."
-, volume =	6
-, number =	3
-, month =	aug
-, year =	1988
-, pages =	"162--168"
-, update =	"96.05 efrat"
+, author =      "C. A. Shaffer and H. Samet"
+, title =       "An algorithm to expand regions represented by linear quadtrees"
+, journal =     "Image Vision Comput."
+, volume =      6
+, number =      3
+, month =       aug
+, year =        1988
+, pages =       "162--168"
+, update =      "96.05 efrat"
 }
 
 @techreport{ss-chdso-87
-, author =	"C. A. Shaffer and H. Samet"
-, title =	"An in--core hierarchical data structure organization for a geographic database"
-, type =	"Computer Science Department"
-, number =	"TR 1886"
-, institution =	"University of Maryland"
-, address =	"College Park, MD"
-, month =	jul
-, year =	1987
-, update =	"96.05 efrat"
+, author =      "C. A. Shaffer and H. Samet"
+, title =       "An in--core hierarchical data structure organization for a geographic database"
+, type =        "Computer Science Department"
+, number =      "TR 1886"
+, institution = "University of Maryland"
+, address =     "College Park, MD"
+, month =       jul
+, year =        1987
+, update =      "96.05 efrat"
 }
 
 @article{ss-oqca-87
-, author =	"C. A. Shaffer and H. Samet"
-, title =	"Optimal quadtree construction algorithms"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	37
-, number =	3
-, month =	mar
-, year =	1987
-, pages =	"402--419"
-, update =	"96.05 efrat"
+, author =      "C. A. Shaffer and H. Samet"
+, title =       "Optimal quadtree construction algorithms"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      37
+, number =      3
+, month =       mar
+, year =        1987
+, pages =       "402--419"
+, update =      "96.05 efrat"
 }
 
 @article{ss-soulq-90
-, author =	"C. A. Shaffer and H. Samet"
-, title =	"Set operations for unaligned linear quadtrees"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	50
-, number =	1
-, month =	apr
-, year =	1990
-, pages =	"29--4"
-, note =	"(also Virginia Polytechnic Institute and State University Computer Science TR 88--31)"
-, update =	"96.05 efrat"
+, author =      "C. A. Shaffer and H. Samet"
+, title =       "Set operations for unaligned linear quadtrees"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      50
+, number =      1
+, month =       apr
+, year =        1990
+, pages =       "29--4"
+, note =        "(also Virginia Polytechnic Institute and State University Computer Science TR 88--31)"
+, update =      "96.05 efrat"
 }
 
 @article{ssn-qgisb-90
-, author =	"C. A. Shaffer and H. Samet and R. C. Nelson"
-, title =	"{QUILT}: a geographic information system based on quadtrees"
-, journal =	"Internat. J. Geogr. Inform. Syst."
-, volume =	4
-, number =	2
-, month =	apr
-, year =	1990
-, pages =	"103--131"
-, update =	"00.11 smid, 00.07 icking, 96.09 devillers, 96.05 efrat"
-, annote =	"also University of Maryland Computer Science TR-1885.1"
+, author =      "C. A. Shaffer and H. Samet and R. C. Nelson"
+, title =       "{QUILT}: a geographic information system based on quadtrees"
+, journal =     "Internat. J. Geogr. Inform. Syst."
+, volume =      4
+, number =      2
+, month =       apr
+, year =        1990
+, pages =       "103--131"
+, update =      "00.11 smid, 00.07 icking, 96.09 devillers, 96.05 efrat"
+, annote =      "also University of Maryland Computer Science TR-1885.1"
 }
 
 @inproceedings{s-hmr-95
-, author =	"Nimish R. Shah"
-, title =	"Homeomorphic Meshes in {$\Re^3$}"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"25--30"
-, update =	"95.09 jones"
+, author =      "Nimish R. Shah"
+, title =       "Homeomorphic Meshes in {$\Re^3$}"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "25--30"
+, update =      "95.09 jones"
 }
 
 @article{smr-ddssa-88
-, author =	"Hamid Shahnasser and Ward Morgan and A. Raghuram"
-, title =	"Dynamic Date Structure Suitable For Adaptive Mesh Refinement In Finite Element Method"
-, journal =	"Finite Elements in Analysis and Design"
-, volume =	4
-, number =	3
-, month =	nov
-, year =	1988
-, pages =	"237--247"
-, keywords =	"dynamic data structure, mesh refinement"
-, annote =	"Claims that minimizing sum of the minimum angles is
-		 equal to the DT. (Not true). Claims that sum of
-		 opposite angles is cheapest way to implement DT test.
-		 Lists Pascal code. Data structure is list of triangles,
-		 with pointers to adjacent triangles. Inside flip
-		 insertion."
-, abstract =	"This paper describes a dynamic data structure and its
-		 implementation, used for an optimum mesh generator. The
-		 implementation of this mesh generator was a part of a
-		 software package implemented to solve electromagnetic
-		 field problems using the finite element method. This
-		 mesh generator takes advantage of the Delaunay
-		 algorithm, which maximizes the summation of the
-		 smallest angles in all triangles and thus creates a
-		 mesh that is proved to be an optimum mesh for use in
-		 the finite element method. The dynamic data structure
-		 is explained and the source code is reviewed. The
-		 programs have been written in Pascal programming
-		 language. (Author abstract) 8 Refs."
+, author =      "Hamid Shahnasser and Ward Morgan and A. Raghuram"
+, title =       "Dynamic Date Structure Suitable For Adaptive Mesh Refinement In Finite Element Method"
+, journal =     "Finite Elements in Analysis and Design"
+, volume =      4
+, number =      3
+, month =       nov
+, year =        1988
+, pages =       "237--247"
+, keywords =    "dynamic data structure, mesh refinement"
+, annote =      "Claims that minimizing sum of the minimum angles is
+                 equal to the DT. (Not true). Claims that sum of
+                 opposite angles is cheapest way to implement DT test.
+                 Lists Pascal code. Data structure is list of triangles,
+                 with pointers to adjacent triangles. Inside flip
+                 insertion."
+, abstract =    "This paper describes a dynamic data structure and its
+                 implementation, used for an optimum mesh generator. The
+                 implementation of this mesh generator was a part of a
+                 software package implemented to solve electromagnetic
+                 field problems using the finite element method. This
+                 mesh generator takes advantage of the Delaunay
+                 algorithm, which maximizes the summation of the
+                 smallest angles in all triangles and thus creates a
+                 mesh that is proved to be an optimum mesh for use in
+                 the finite element method. The dynamic data structure
+                 is explained and the source code is reviewed. The
+                 programs have been written in Pascal programming
+                 language. (Author abstract) 8 Refs."
 }
 
 @inproceedings{sssv-bcnmh-97
-, author =	"Farhad Shahrokhi and Ondrej S{\'y}kora and L{\'a}szl{\'o} A. Sz{\'e}kely and Imrich {Vrt'o}"
-, title =	"Bipartite Crossing Numbers of Meshes and Hypercubes"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"37--46"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Farhad Shahrokhi and Ondrej S{\'y}kora and L{\'a}szl{\'o} A. Sz{\'e}kely and Imrich {Vrt'o}"
+, title =       "Bipartite Crossing Numbers of Meshes and Hypercubes"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "37--46"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{sssv-dgsfc-96
-, author =	"F. Shahrokhi and L. A. {Sz\'ekely} and O. {S\'ykora} and I. {Vrt'o}"
-, title =	"Drawings of Graphs on Surfaces with Few Crossings"
-, journal =	"Algorithmica"
-, volume =	16
-, year =	1996
-, pages =	"118--131"
-, note =	"(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
-, keywords =	"graph drawing, 3D, topological graph theory"
-, update =	"96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
+, author =      "F. Shahrokhi and L. A. {Sz\'ekely} and O. {S\'ykora} and I. {Vrt'o}"
+, title =       "Drawings of Graphs on Surfaces with Few Crossings"
+, journal =     "Algorithmica"
+, volume =      16
+, year =        1996
+, pages =       "118--131"
+, note =        "(special issue on Graph Drawing, edited by G. {Di Battista} and R. Tamassia)"
+, keywords =    "graph drawing, 3D, topological graph theory"
+, update =      "96.09 smid, 95.09 agarwal+devillers+tamassia, 95.05 tamassia"
 }
 
 @inproceedings{ssv-cnglb-95
-, author =	"F. Shahrokhi and L. A. Sz{\'e}kely and I. Vrt'o"
-, title =	"Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: a Survey"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"131--142"
-, keywords =	"graph drawing, planarization, crossing number, survey"
-, update =	"95.01 tamassia"
+, author =      "F. Shahrokhi and L. A. Sz{\'e}kely and I. Vrt'o"
+, title =       "Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: a Survey"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "131--142"
+, keywords =    "graph drawing, planarization, crossing number, survey"
+, update =      "95.01 tamassia"
 }
 
 @article{s-scpe-80
-, author =	"A. V. Shaidenko"
-, title =	"Some Characteristic Properties of the Ellipsoid"
-, journal =	"Sibirsk Mat. Z."
-, volume =	21
-, year =	1980
-, pages =	"232--234, 240"
-, note =	"In Russian."
-, update =	"99.11 bibrelex"
+, author =      "A. V. Shaidenko"
+, title =       "Some Characteristic Properties of the Ellipsoid"
+, journal =     "Sibirsk Mat. Z."
+, volume =      21
+, year =        1980
+, pages =       "232--234, 240"
+, note =        "In Russian."
+, update =      "99.11 bibrelex"
 }
 
 @article{s-palp-93
-, author =	"R. Shamir"
-, title =	"Probabilistic analysis in linear programming"
-, journal =	"Statistical Science"
-, volume =	8
-, year =	1993
-, pages =	"57--64"
-, update =	"94.05 matousek"
+, author =      "R. Shamir"
+, title =       "Probabilistic analysis in linear programming"
+, journal =     "Statistical Science"
+, volume =      8
+, year =        1993
+, pages =       "57--64"
+, update =      "94.05 matousek"
 }
 
 @article{s-esms-87
-, author =	"R. Shamir"
-, title =	"The efficiency of the simplex method: a survey"
-, journal =	"Manage. Sci."
-, volume =	33
-, year =	1987
-, pages =	"301--334"
-, keywords =	"linear programming, Monte Carlo"
+, author =      "R. Shamir"
+, title =       "The efficiency of the simplex method: a survey"
+, journal =     "Manage. Sci."
+, volume =      33
+, year =        1987
+, pages =       "301--334"
+, keywords =    "linear programming, Monte Carlo"
 }
 
 @inproceedings{sd-cagst-90
-, author =	"R. Shamir and B. Dietrich"
-, title =	"Characterization and algorithms for greedily solvable transportation problems"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"358--366"
+, author =      "R. Shamir and B. Dietrich"
+, title =       "Characterization and algorithms for greedily solvable transportation problems"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "358--366"
 }
 
 @incollection{sffr-hpgis-78
-, author =	"M. Shamos and H. Freeman and R. Franklin and A. Rosenfeld"
-, title =	"??"
-, editor =	"G. Dutton"
-, booktitle =	"Harvard Papers on Geographical Information Systems"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1978
-, pages =	"??"
-, keywords =	"complexity theory, design of algorithms, data structuring, cartography, searching, probing, divide-and-conquer, dynamizing data structures, triangulation, polygonal chains"
+, author =      "M. Shamos and H. Freeman and R. Franklin and A. Rosenfeld"
+, title =       "??"
+, editor =      "G. Dutton"
+, booktitle =   "Harvard Papers on Geographical Information Systems"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1978
+, pages =       "??"
+, keywords =    "complexity theory, design of algorithms, data structuring, cartography, searching, probing, divide-and-conquer, dynamizing data structures, triangulation, polygonal chains"
 }
 
 @phdthesis{s-cg-78
-, author =	"M. I. Shamos"
-, title =	"Computational Geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Yale Univ."
-, address =	"New Haven, CT"
-, year =	1978
-, keywords =	"doctoral thesis"
-, comments =	"UMI 78-19047"
-, succeeds =	"s-pcg-77"
-, update =	"93.09 jones"
+, author =      "M. I. Shamos"
+, title =       "Computational Geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Yale Univ."
+, address =     "New Haven, CT"
+, year =        1978
+, keywords =    "doctoral thesis"
+, comments =    "UMI 78-19047"
+, succeeds =    "s-pcg-77"
+, update =      "93.09 jones"
 }
 
 @inproceedings{s-gc-75
-, author =	"M. I. Shamos"
-, title =	"Geometric complexity"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Theory Comput."
-, year =	1975
-, pages =	"224--233"
+, author =      "M. I. Shamos"
+, title =       "Geometric complexity"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Theory Comput."
+, year =        1975
+, pages =       "224--233"
 }
 
 @incollection{s-gspi-76
-, author =	"M. I. Shamos"
-, title =	"Geometry and statistics: problems at the interface"
-, editor =	"J. F. Traub"
-, booktitle =	"Algorithms and Complexity: New Directions and Recent Results"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1976
-, pages =	"251--280"
+, author =      "M. I. Shamos"
+, title =       "Geometry and statistics: problems at the interface"
+, editor =      "J. F. Traub"
+, booktitle =   "Algorithms and Complexity: New Directions and Recent Results"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1976
+, pages =       "251--280"
 }
 
 @techreport{s-pcg-77
-, author =	"M. I. Shamos"
-, title =	"Problems in computational geometry"
-, type =	"Report"
-, number =	""
-, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1977
-, comments =	"An early version of his thesis?"
-, precedes =	"s-cg-78"
-, update =	"94.05 devillers"
+, author =      "M. I. Shamos"
+, title =       "Problems in computational geometry"
+, type =        "Report"
+, number =      ""
+, institution = "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1977
+, comments =    "An early version of his thesis?"
+, precedes =    "s-cg-78"
+, update =      "94.05 devillers"
 }
 
 @incollection{s-eycgp-99
-, author =	"M. I. Shamos"
-, title =	"The early years of computational geometry---a personal memoir"
-, editor =	"B. Chazelle and J. E. Goodman and R. Pollack"
-, booktitle =	"Advances in Discrete and Computational Geometry"
-, series =	"Contemporary Mathematics"
-, volume =	223
-, publisher =	"American Mathematical Society"
-, address =	"Providence"
-, year =	1999
-, pages =	"313--333"
-, update =	"00.03 smid"
+, author =      "M. I. Shamos"
+, title =       "The early years of computational geometry---a personal memoir"
+, editor =      "B. Chazelle and J. E. Goodman and R. Pollack"
+, booktitle =   "Advances in Discrete and Computational Geometry"
+, series =      "Contemporary Mathematics"
+, volume =      223
+, publisher =   "American Mathematical Society"
+, address =     "Providence"
+, year =        1999
+, pages =       "313--333"
+, update =      "00.03 smid"
 }
 
 @inproceedings{sb-oasgd-77
-, author =	"M. I. Shamos and J. L. Bentley"
-, title =	"Optimal algorithms for structuring geographic data"
-, booktitle =	"Proc. Sympos. Topological Data Structures for Geographic Inform. Systems"
-, publisher =	"Harvard Univ."
-, year =	1977
-, pages =	"43--51"
+, author =      "M. I. Shamos and J. L. Bentley"
+, title =       "Optimal algorithms for structuring geographic data"
+, booktitle =   "Proc. Sympos. Topological Data Structures for Geographic Inform. Systems"
+, publisher =   "Harvard Univ."
+, year =        1977
+, pages =       "43--51"
 }
 
 @inproceedings{sh-cpp-75
-, author =	"M. I. Shamos and D. Hoey"
-, title =	"Closest-Point Problems"
-, booktitle =	"Proc. 16th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1975
-, pages =	"151--162"
-, annote =	"Uses Voronoi tessellation to get $O(N\log N)$
-		 algorithms for: all closest points; Euclidean MST;
-		 Triangulation; Convex Hull; Largest empty circle;
-		 smallest enclosing circle. Divide and Conquer algorithm
-		 for VD."
+, author =      "M. I. Shamos and D. Hoey"
+, title =       "Closest-Point Problems"
+, booktitle =   "Proc. 16th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1975
+, pages =       "151--162"
+, annote =      "Uses Voronoi tessellation to get $O(N\log N)$
+                 algorithms for: all closest points; Euclidean MST;
+                 Triangulation; Convex Hull; Largest empty circle;
+                 smallest enclosing circle. Divide and Conquer algorithm
+                 for VD."
 }
 
 @inproceedings{sh-gip-76
-, author =	"M. I. Shamos and D. Hoey"
-, title =	"Geometric intersection problems"
-, booktitle =	"Proc. 17th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1976
-, pages =	"208--215"
+, author =      "M. I. Shamos and D. Hoey"
+, title =       "Geometric intersection problems"
+, booktitle =   "Proc. 17th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1976
+, pages =       "208--215"
 }
 
 @inproceedings{sy-lbcft-76
-, author =	"M. I. Shamos and G. Yuval"
-, title =	"Lower bounds from complex function theory"
-, booktitle =	"Proc. 17th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1976
-, pages =	"268--273"
+, author =      "M. I. Shamos and G. Yuval"
+, title =       "Lower bounds from complex function theory"
+, booktitle =   "Proc. 17th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1976
+, pages =       "268--273"
 }
 
 @inproceedings{sbv-hslim-90
-, author =	"Mark Shand and Patrice Bertin and Jean Vuillemin"
-, title =	"Hardware speedups in long integer multiplication"
-, booktitle =	"2nd ACM Sympos. Parallel Algorithms Arch."
-, year =	1990
-, update =	"98.11 bibrelex"
+, author =      "Mark Shand and Patrice Bertin and Jean Vuillemin"
+, title =       "Hardware speedups in long integer multiplication"
+, booktitle =   "2nd ACM Sympos. Parallel Algorithms Arch."
+, year =        1990
+, update =      "98.11 bibrelex"
 }
 
 @article{s-frbri-80
-, author =	"U. Shani"
-, title =	"Filling regions in binary raster images: a graph-theoretical appoach"
-, journal =	"Computer graphics"
-, volume =	14
-, year =	1980
-, pages =	"321--327"
-, update =	"98.07 bibrelex"
+, author =      "U. Shani"
+, title =       "Filling regions in binary raster images: a graph-theoretical appoach"
+, journal =     "Computer graphics"
+, volume =      14
+, year =        1980
+, pages =       "321--327"
+, update =      "98.07 bibrelex"
 }
 
 @article{sp-viosd-91
-, author =	"K. Shanmukh and A. K. Pujari"
-, title =	"Volume intersection with optimal set of directions"
-, journal =	"P. Reco. Letters"
-, volume =	"??"
-, year =	1991
-, pages =	"165--170"
-, update =	"98.11 bibrelex"
+, author =      "K. Shanmukh and A. K. Pujari"
+, title =       "Volume intersection with optimal set of directions"
+, journal =     "P. Reco. Letters"
+, volume =      "??"
+, year =        1991
+, pages =       "165--170"
+, update =      "98.11 bibrelex"
 }
 
 @article{s-sdbcd-81
-, author =	"M. Shantz"
-, title =	"Surface definition for branching contour-defined objects"
-, journal =	"Comput. Graph."
-, volume =	15
-, year =	1981
-, pages =	"242--270"
-, update =	"98.03 bibrelex"
+, author =      "M. Shantz"
+, title =       "Surface definition for branching contour-defined objects"
+, journal =     "Comput. Graph."
+, volume =      15
+, year =        1981
+, pages =       "242--270"
+, update =      "98.03 bibrelex"
 }
 
 @article{sf-copva-79
-, author =	"R. Shapira and H. Freeman"
-, title =	"The cyclic order property of vertices as an aid in scene analysis"
-, journal =	"Commun. ACM"
-, volume =	22
-, year =	1979
-, pages =	"3--9"
+, author =      "R. Shapira and H. Freeman"
+, title =       "The cyclic order property of vertices as an aid in scene analysis"
+, journal =     "Commun. ACM"
+, volume =      22
+, year =        1979
+, pages =       "3--9"
 }
 
 @book{s-daela-91
-, author =	"R. E. Shapire"
-, title =	"The Design and Analysis of Efficient Learning Algorithms"
-, publisher =	"MIT Press"
-, address =	"Cambridge, MA"
-, year =	1991
+, author =      "R. E. Shapire"
+, title =       "The Design and Analysis of Efficient Learning Algorithms"
+, publisher =   "MIT Press"
+, address =     "Cambridge, MA"
+, year =        1991
 }
 
 @article{s-tleup-78
-, author =	"H. D. Shapiro"
-, title =	"Theoretical limitations on the efficient use of parallel memories"
-, journal =	"IEEE Trans. Comput."
-, volume =	"??"
-, year =	1978
-, update =	"97.11 bibrelex"
+, author =      "H. D. Shapiro"
+, title =       "Theoretical limitations on the efficient use of parallel memories"
+, journal =     "IEEE Trans. Comput."
+, volume =      "??"
+, year =        1978
+, update =      "97.11 bibrelex"
 }
 
 @article{s-nlsad-81
-, author =	"M. Shapiro"
-, title =	"A Note on {Lee} and {Schachter's} Algorithm for {Delaunay} Triangulation"
-, journal =	"Internat. J. Comput. Inform. Sci."
-, volume =	10
-, number =	6
-, year =	1981
-, pages =	"413--418"
-, annote =	"Modification of Lee and Schachter's second algorithm
-		 such that points outside the convex hull can be added.
-		 $O(n^2)$ worst case, claims $O(n^{4/3})$ in practice."
+, author =      "M. Shapiro"
+, title =       "A Note on {Lee} and {Schachter's} Algorithm for {Delaunay} Triangulation"
+, journal =     "Internat. J. Comput. Inform. Sci."
+, volume =      10
+, number =      6
+, year =        1981
+, pages =       "413--418"
+, annote =      "Modification of Lee and Schachter's second algorithm
+                 such that points outside the convex hull can be added.
+                 $O(n^2)$ worst case, claims $O(n^{4/3})$ in practice."
 }
 
 @article{s-mgrsd-97
-, author =	"V. Shapiro"
-, title =	"Maintenance of geometric representations through space decompositions"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"21--56"
-, update =	"97.07 devillers"
+, author =      "V. Shapiro"
+, title =       "Maintenance of geometric representations through space decompositions"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "21--56"
+, update =      "97.07 devillers"
 }
 
 @techreport{s-rsasf-91
-, author =	"V. Shapiro"
-, title =	"Representations of Semi-Algebraic Sets in Finite Algebras Generated by Space Decompositions"
-, type =	"Technical {Report}"
-, number =	"CPA 91-1"
-, institution =	"Cornell Univ."
-, address =	"Ithaca, New York"
-, month =	feb
-, year =	1991
-, update =	"93.09 milone+mitchell"
+, author =      "V. Shapiro"
+, title =       "Representations of Semi-Algebraic Sets in Finite Algebras Generated by Space Decompositions"
+, type =        "Technical {Report}"
+, number =      "CPA 91-1"
+, institution = "Cornell Univ."
+, address =     "Ithaca, New York"
+, month =       feb
+, year =        1991
+, update =      "93.09 milone+mitchell"
 }
 
 @article{sh-dtdsg-79
-, author =	"V. Shapiro and R. M. Haralick"
-, title =	"Decomposition of Two-Dimensinal Shapes by Graph Theoretic Clusters"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-1"
-, number =	1
-, year =	1979
-, pages =	"10--20"
-, update =	"93.09 milone+mitchell"
+, author =      "V. Shapiro and R. M. Haralick"
+, title =       "Decomposition of Two-Dimensinal Shapes by Graph Theoretic Clusters"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-1"
+, number =      1
+, year =        1979
+, pages =       "10--20"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{sv-brrcc1-90
-, author =	"V. Shapiro and D. Vossler"
-, title =	"{B}-rep $\rightarrow$ {CSG} conversion {I}: construction and optimization of {CSG} representations"
-, type =	"Technical {Report}"
-, number =	"CPA89-3a"
-, institution =	"Cornell Programmable Automation"
-, address =	"Ithaca, NY"
-, month =	sep
-, year =	1990
+, author =      "V. Shapiro and D. Vossler"
+, title =       "{B}-rep $\rightarrow$ {CSG} conversion {I}: construction and optimization of {CSG} representations"
+, type =        "Technical {Report}"
+, number =      "CPA89-3a"
+, institution = "Cornell Programmable Automation"
+, address =     "Ithaca, NY"
+, month =       sep
+, year =        1990
 }
 
 @techreport{sv-brrcc2-90
-, author =	"V. Shapiro and D. Vossler"
-, title =	"{B}-rep $\rightarrow$ {CSG} conversion {II}: efficient {CSG} representations of planar solids"
-, type =	"Technical {Report}"
-, number =	"CPA89-4a"
-, institution =	"Cornell Programmable Automation"
-, address =	"Ithaca, NY"
-, month =	may
-, year =	1990
+, author =      "V. Shapiro and D. Vossler"
+, title =       "{B}-rep $\rightarrow$ {CSG} conversion {II}: efficient {CSG} representations of planar solids"
+, type =        "Technical {Report}"
+, number =      "CPA89-4a"
+, institution = "Cornell Programmable Automation"
+, address =     "Ithaca, NY"
+, month =       may
+, year =        1990
 }
 
 @techreport{sv-ecrps-89
-, author =	"V. Shapiro and D. Vossler"
-, title =	"Efficient {CSG} representations of planar solids"
-, type =	"Technical {Report}"
-, institution =	"Sibley School of M\&AE, Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "V. Shapiro and D. Vossler"
+, title =       "Efficient {CSG} representations of planar solids"
+, type =        "Technical {Report}"
+, institution = "Sibley School of M\&AE, Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{sv-wipfs-95
-, author =	"V. Shapiro and D. L. Vossler"
-, title =	"What is a parametric family of solids?"
-, booktitle =	"Proc. 3rd ACM Symposium on Solid Modeling and Applications"
-, site =	"Salt Lake City, UT"
-, month =	may
-, year =	1995
-, update =	"98.07 bibrelex"
+, author =      "V. Shapiro and D. L. Vossler"
+, title =       "What is a parametric family of solids?"
+, booktitle =   "Proc. 3rd ACM Symposium on Solid Modeling and Applications"
+, site =        "Salt Lake City, UT"
+, month =       may
+, year =        1995
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-nlap2-96
-, author =	"Micha Sharir"
-, title =	"A Near-Linear Algorithm for the Planar $2$-Center Problem"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"106--112"
-, cites =	"as-pglp-94, d-ptctm-84, e-dtdlp-92, e-fcptc-96, e-samcp-93, h-fatcd-93, hlc-sdase-93, hs-ftp-91, jk-eaetc-94, ks-ebago-93, m-apcad-83, m-ltalp-83, ms-cscgl-84, ol-mcp-81, s-mpafo-94, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Micha Sharir"
+, title =       "A Near-Linear Algorithm for the Planar $2$-Center Problem"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "106--112"
+, cites =       "as-pglp-94, d-ptctm-84, e-dtdlp-92, e-fcptc-96, e-samcp-93, h-fatcd-93, hlc-sdase-93, hs-ftp-91, jk-eaetc-94, ks-ebago-93, m-apcad-83, m-ltalp-83, ms-cscgl-84, ol-mcp-81, s-mpafo-94, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @article{s-nlap2-97
-, author =	"Micha Sharir"
-, title =	"A Near-Linear Algorithm for the Planar $2$-Center Problem"
-, journal =	"Discrete Comput. Geom."
-, volume =	18
-, year =	1997
-, pages =	"125--134"
-, update =	"98.03 agarwal"
+, author =      "Micha Sharir"
+, title =       "A Near-Linear Algorithm for the Planar $2$-Center Problem"
+, journal =     "Discrete Comput. Geom."
+, volume =      18
+, year =        1997
+, pages =       "125--134"
+, update =      "98.03 agarwal"
 }
 
 @techreport{s-npsap-89t
-, author =	"Micha Sharir"
-, title =	"A note on the {Papadimitriou}-{Silverberg} algorithm for planning optimal piecewise-linear motion of a ladder"
-, number =	"NYU Robotics Report 188"
-, institution =	"Courant Institute, New York University"
-, year =	1989
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Micha Sharir"
+, title =       "A note on the {Papadimitriou}-{Silverberg} algorithm for planning optimal piecewise-linear motion of a ladder"
+, number =      "NYU Robotics Report 188"
+, institution = "Courant Institute, New York University"
+, year =        1989
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{s-npsap-89
-, author =	"Micha Sharir"
-, title =	"A note on the {Papadimitriou}-{Silverberg} algorithm for planning optimal piecewise linear motion of a ladder"
-, journal =	"Inform. Process. Lett."
-, volume =	32
-, year =	1989
-, pages =	"187--190"
-, keywords =	"motion planning"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "A note on the {Papadimitriou}-{Silverberg} algorithm for planning optimal piecewise linear motion of a ladder"
+, journal =     "Inform. Process. Lett."
+, volume =      32
+, year =        1989
+, pages =       "187--190"
+, keywords =    "motion planning"
+, update =      "98.03 mitchell"
 }
 
 @incollection{s-amp-97
-, author =	"Micha Sharir"
-, title =	"Algorithmic motion planning"
-, chapter =	40
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"733--754"
-, update =	"98.03 mitchell, 97.11 orourke"
+, author =      "Micha Sharir"
+, title =       "Algorithmic motion planning"
+, chapter =     40
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "733--754"
+, update =      "98.03 mitchell, 97.11 orourke"
 }
 
 @techreport{s-ampr-88
-, author =	"Micha Sharir"
-, title =	"Algorithmic motion planning in robotics"
-, type =	"Report"
-, number =	392
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1988
-, keywords =	"motion planning, robotics, survey paper"
-, precedes =	"s-ampr-89"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "Algorithmic motion planning in robotics"
+, type =        "Report"
+, number =      392
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1988
+, keywords =    "motion planning, robotics, survey paper"
+, precedes =    "s-ampr-89"
+, update =      "98.03 mitchell"
 }
 
 @article{s-ampr-89
-, author =	"Micha Sharir"
-, title =	"Algorithmic motion planning in robotics"
-, journal =	"Computer"
-, volume =	22
-, year =	1989
-, pages =	"9--20"
-, keywords =	"motion planning, robotics, survey paper"
-, succeeds =	"s-ampr-88"
-, precedes =	"ss-ampr-90"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "Algorithmic motion planning in robotics"
+, journal =     "Computer"
+, volume =      22
+, year =        1989
+, pages =       "9--20"
+, keywords =    "motion planning, robotics, survey paper"
+, succeeds =    "s-ampr-88"
+, precedes =    "ss-ampr-90"
+, update =      "98.03 mitchell"
 }
 
 @article{s-alubl-87
-, author =	"Micha Sharir"
-, title =	"Almost linear upper bounds for the length of general {Davenport}-{Schinzel} sequences"
-, journal =	"Combinatorica"
-, volume =	7
-, year =	1987
-, pages =	"131--143"
-, keywords =	"Davenport-Schinzel sequences"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "Almost linear upper bounds for the length of general {Davenport}-{Schinzel} sequences"
+, journal =     "Combinatorica"
+, volume =      7
+, year =        1987
+, pages =       "131--143"
+, keywords =    "Davenport-Schinzel sequences"
+, update =      "98.03 mitchell"
 }
 
 @techreport{s-atubl-93t
-, author =	"Micha Sharir"
-, title =	"Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions"
-, type =	"manuscript"
-, year =	1993
-, precedes =	"s-atubl-93, s-atubl-94"
-, update =	"98.11 bibrelex"
+, author =      "Micha Sharir"
+, title =       "Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions"
+, type =        "manuscript"
+, year =        1993
+, precedes =    "s-atubl-93, s-atubl-94"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{s-atubl-93
-, author =	"Micha Sharir"
-, title =	"Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions"
-, booktitle =	"Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '93"
-, year =	1993
-, pages =	"498--507"
-, succeeds =	"s-atubl-93t"
-, update =	"98.11 bibrelex, 98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Micha Sharir"
+, title =       "Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions"
+, booktitle =   "Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '93"
+, year =        1993
+, pages =       "498--507"
+, succeeds =    "s-atubl-93t"
+, update =      "98.11 bibrelex, 98.07 bibrelex, 97.03 agarwal, 94.01 smid, 93.09 milone+mitchell"
 }
 
 %, number =      3
 @article{s-atubl-94
-, author =	"Micha Sharir"
-, title =	"Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"327--345"
-, succeeds =	"s-atubl-93, s-atubl-93t"
-, update =	"98.11 bibrelex, 98.03 mitchell, 95.01 orourke+smid"
+, author =      "Micha Sharir"
+, title =       "Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "327--345"
+, succeeds =    "s-atubl-93, s-atubl-93t"
+, update =      "98.11 bibrelex, 98.03 mitchell, 95.01 orourke+smid"
 }
 
 @inproceedings{s-ahdvd-95
-, author =	"Micha Sharir"
-, title =	"Arrangements in Higher Dimensions: {Voronoi} Diagrams, Motion Planning, and Other Applications"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"109--121"
-, update =	"00.03 bibrelex"
+, author =      "Micha Sharir"
+, title =       "Arrangements in Higher Dimensions: {Voronoi} Diagrams, Motion Planning, and Other Applications"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "109--121"
+, update =      "00.03 bibrelex"
 }
 
 @incollection{s-ashd-99
-, author =	"Micha Sharir"
-, title =	"Arrangements of Surfaces in Higher Dimensions"
-, editor =	"B. Chazelle and J. E. Goodman and R. Pollack"
-, booktitle =	"Advances in Discrete and Computational Geometry"
-, series =	"Contemporary Mathematics"
-, volume =	223
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1999
-, pages =	"335--353"
-, update =	"00.03 smid"
+, author =      "Micha Sharir"
+, title =       "Arrangements of Surfaces in Higher Dimensions"
+, editor =      "B. Chazelle and J. E. Goodman and R. Pollack"
+, booktitle =   "Advances in Discrete and Computational Geometry"
+, series =      "Contemporary Mathematics"
+, volume =      223
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1999
+, pages =       "335--353"
+, update =      "00.03 smid"
 }
 
 @inproceedings{s-ashde-93
-, author =	"Micha Sharir"
-, title =	"Arrangements of Surfaces in Higher Dimensions: {Envelopes}, Single Cells, and Other Recent Developments"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"181--186"
-, cites =	"ass-sulbl-89, aps-zsha-93, as-tsbac-90, as-car-92, bhok-sanvp-91, bdsty-arsol-92, bd-olrcu-93, cegs-dwclp-93, cegss-lsca-96, cs-arscg-89, e-acg-87, es-vda-86, fl-vdmpp-91, gks-ricdv-92, gmr-vdmpp-91t, gss-gmppt-89, h-ampac-92, hs-nblet-93, hs-nqbmp-93t, hs-cscas, hs-ndssg-86, ms-eracu-91, ps-ueplf-89, p-lmps3-93, pr-ncdsp-93, ss-tddsp-90, s-ksacs-91, s-atubl-93t, cegss-cfals-93, as-dssga-00, ZZZ"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "Micha Sharir"
+, title =       "Arrangements of Surfaces in Higher Dimensions: {Envelopes}, Single Cells, and Other Recent Developments"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "181--186"
+, cites =       "ass-sulbl-89, aps-zsha-93, as-tsbac-90, as-car-92, bhok-sanvp-91, bdsty-arsol-92, bd-olrcu-93, cegs-dwclp-93, cegss-lsca-96, cs-arscg-89, e-acg-87, es-vda-86, fl-vdmpp-91, gks-ricdv-92, gmr-vdmpp-91t, gss-gmppt-89, h-ampac-92, hs-nblet-93, hs-nqbmp-93t, hs-cscas, hs-ndssg-86, ms-eracu-91, ps-ueplf-89, p-lmps3-93, pr-ncdsp-93, ss-tddsp-90, s-ksacs-91, s-atubl-93t, cegss-cfals-93, as-dssga-00, ZZZ"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @incollection{s-dsstg-88
-, author =	"Micha Sharir"
-, title =	"Davenport-{Schinzel} sequences and their geometric applications"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1988
-, pages =	"253--278"
-, keywords =	"Davenport-Schinzel sequences, survey paper"
-, update =	"99.11 bibrelex, 98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "Davenport-{Schinzel} sequences and their geometric applications"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1988
+, pages =       "253--278"
+, keywords =    "Davenport-Schinzel sequences, survey paper"
+, update =      "99.11 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{s-eappt-87
-, author =	"Micha Sharir"
-, title =	"Efficient algorithms for planning purely translational collision-free motion in two and three dimensions"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1987
-, pages =	"1326--1331"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "Efficient algorithms for planning purely translational collision-free motion in two and three dimensions"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1987
+, pages =       "1326--1331"
+, update =      "98.03 mitchell"
 }
 
 @article{s-ilbld-88
-, author =	"Micha Sharir"
-, title =	"Improved lower bounds on the length of {Davenport}-{Schinzel} sequences"
-, journal =	"Combinatorica"
-, volume =	8
-, year =	1988
-, pages =	"117--124"
-, keywords =	"Davenport-Schinzel sequences"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "Improved lower bounds on the length of {Davenport}-{Schinzel} sequences"
+, journal =     "Combinatorica"
+, volume =      8
+, year =        1988
+, pages =       "117--124"
+, keywords =    "Davenport-Schinzel sequences"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{s-ipca-96
-, author =	"Micha Sharir"
-, title =	"Improved $p$-Center Algorithms"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	85
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Micha Sharir"
+, title =       "Improved $p$-Center Algorithms"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       85
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{s-icpps-85
-, author =	"Micha Sharir"
-, title =	"Intersection and closest-pair problems for a set of planar discs"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"448--468"
-, keywords =	"Voronoi diagrams"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "Intersection and closest-pair problems for a set of planar discs"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "448--468"
+, keywords =    "Voronoi diagrams"
+, update =      "98.03 mitchell"
 }
 
 @article{s-ksrh-93
-, author =	"Micha Sharir"
-, title =	"$k$-sets and random hulls"
-, journal =	"Combinatorica"
-, volume =	13
-, year =	1993
-, pages =	"483--495"
-, update =	"98.03 mitchell, 94.05 sharir"
+, author =      "Micha Sharir"
+, title =       "$k$-sets and random hulls"
+, journal =     "Combinatorica"
+, volume =      13
+, year =        1993
+, pages =       "483--495"
+, update =      "98.03 mitchell, 94.05 sharir"
 }
 
 @article{s-ksacs-91
-, author =	"Micha Sharir"
-, title =	"On $k$-sets in arrangements of curves and surfaces"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"593--613"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "On $k$-sets in arrangements of curves and surfaces"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "593--613"
+, update =      "98.03 mitchell"
 }
 
 @techreport{s-spacp-85
-, author =	"Micha Sharir"
-, title =	"On shortest paths amdist convex polyhedra"
-, number =	181
-, institution =	"Computer Science Division, Courant Institute of Mathematical Sciences"
-, year =	1985
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Micha Sharir"
+, title =       "On shortest paths amdist convex polyhedra"
+, number =      181
+, institution = "Computer Science Division, Courant Institute of Mathematical Sciences"
+, year =        1985
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{s-spacp-87
-, author =	"Micha Sharir"
-, title =	"On shortest paths amidst convex polyhedra"
-, journal =	"SIAM J. Comput."
-, volume =	16
-, year =	1987
-, pages =	"561--572"
-, keywords =	"shortest paths, polyhedra, convex, Davenport-Schinzel sequences, Voronoi diagrams"
-, succeeds =	"sb-spacp-86"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "On shortest paths amidst convex polyhedra"
+, journal =     "SIAM J. Comput."
+, volume =      16
+, year =        1987
+, pages =       "561--572"
+, keywords =    "shortest paths, polyhedra, convex, Davenport-Schinzel sequences, Voronoi diagrams"
+, succeeds =    "sb-spacp-86"
+, update =      "98.03 mitchell"
 }
 
 @techreport{s-tddsp-85
-, author =	"Micha Sharir"
-, title =	"On the two-dimensional {Davenport}-{Schinzel} problem"
-, type =	"Report"
-, number =	193
-, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1985
-, keywords =	"Davenport-Schinzel sequences, upper/lower envelope"
-, precedes =	"ss-tddsp-90"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "On the two-dimensional {Davenport}-{Schinzel} problem"
+, type =        "Report"
+, number =      193
+, institution = "Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1985
+, keywords =    "Davenport-Schinzel sequences, upper/lower envelope"
+, precedes =    "ss-tddsp-90"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{s-rdtas-99
-, author =	"M. Sharir"
-, title =	"Recent developments in the theory of arrangements of surfaces"
-, booktitle =	"Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1738
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"1--20"
-, update =	"00.03 smid"
+, author =      "M. Sharir"
+, title =       "Recent developments in the theory of arrangements of surfaces"
+, booktitle =   "Proc. 19th Conf. Found. Softw. Tech. Theoret. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1738
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "1--20"
+, update =      "00.03 smid"
 }
 
 @inproceedings{s-cstre-01
-, author =	"Micha Sharir"
-, title =	"The Clarkson-Shor Technique Revisited and Extended"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
-, year =	2001
-, pages =	"252--256"
-, update =	"01.11 pocchiola"
+, author =      "Micha Sharir"
+, title =       "The Clarkson-Shor Technique Revisited and Extended"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Comput. Geom."
+, year =        2001
+, pages =       "252--256"
+, update =      "01.11 pocchiola"
 }
 
 @article{s-swrpp-88
-, author =	"Micha Sharir"
-, title =	"The shortest watchtower and related problems for polyhedral terrains"
-, journal =	"Inform. Process. Lett."
-, volume =	29
-, number =	5
-, year =	1988
-, pages =	"265--270"
-, keywords =	"visibility, polyhedral terrain"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Micha Sharir"
+, title =       "The shortest watchtower and related problems for polyhedral terrains"
+, journal =     "Inform. Process. Lett."
+, volume =      29
+, number =      5
+, year =        1988
+, pages =       "265--270"
+, keywords =    "visibility, polyhedral terrain"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @book{sa-dsstg-95
-, author =	"Micha Sharir and P. K. Agarwal"
-, title =	"{Davenport}-{Schinzel} Sequences and Their Geometric Applications"
-, publisher =	"Cambridge University Press"
-, address =	"New York"
-, year =	1995
-, update =	"98.03 mitchell, 95.09 agarwal, 94.05 matousek"
+, author =      "Micha Sharir and P. K. Agarwal"
+, title =       "{Davenport}-{Schinzel} Sequences and Their Geometric Applications"
+, publisher =   "Cambridge University Press"
+, address =     "New York"
+, year =        1995
+, update =      "98.03 mitchell, 95.09 agarwal, 94.05 matousek"
 }
 
 @article{sa-pmp4v-84
-, author =	"Micha Sharir and E. Ariel-Sheffi"
-, title =	"On the ``piano movers'' problem {IV}: various decomposable two-dimensional motion planning problems"
-, journal =	"Commun. Pure Appl. Math."
-, volume =	37
-, year =	1984
-, pages =	"479--493"
-, keywords =	"motion planning"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir and E. Ariel-Sheffi"
+, title =       "On the ``piano movers'' problem {IV}: various decomposable two-dimensional motion planning problems"
+, journal =     "Commun. Pure Appl. Math."
+, volume =      37
+, year =        1984
+, pages =       "479--493"
+, keywords =    "motion planning"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{sb-spacp-86
-, author =	"Micha Sharir and A. Baltsan"
-, title =	"On shortest paths amidst convex polyhedra"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"193--206"
-, precedes =	"s-spacp-87"
-, cites =	"sb-spbtc-85, hs-ndssg-84, m-fspcp-85, rs-spesp-85, s-alubl-87, s-spacp-85, ss-spps-86, s-pds-74, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Micha Sharir and A. Baltsan"
+, title =       "On shortest paths amidst convex polyhedra"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "193--206"
+, precedes =    "s-spacp-87"
+, cites =       "sb-spbtc-85, hs-ndssg-84, m-fspcp-85, rs-spesp-85, s-alubl-87, s-spacp-85, ss-spps-86, s-pds-74, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @techreport{sb-spbtc-85
-, author =	"Micha Sharir and A. Baltsan"
-, title =	"On shortest paths between two convex polyhedra"
-, type =	"Report"
-, number =	180
-, institution =	"Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1985
-, precedes =	"bs-spbtc-88"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir and A. Baltsan"
+, title =       "On shortest paths between two convex polyhedra"
+, type =        "Report"
+, number =      180
+, institution = "Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1985
+, precedes =    "bs-spbtc-88"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{scklps-gadss-86
-, author =	"Micha Sharir and R. Cole and K. Kedem and D. Leven and R. Pollack and S. Sifrony"
-, title =	"Geometric applications of {Davenport}-{Schinzel} sequences"
-, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1986
-, pages =	"77--86"
-, keywords =	"Davenport-Schinzel sequences, motion planning, visibility"
-, comments =	"In five journal papers: \cite{ls-ncfcc-87},
-		 \cite{pss-stsps-88}, \cite{ks-empac-90},
-		 \cite{cs-vppt-89}, \cite{ws-prnds-88}"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Micha Sharir and R. Cole and K. Kedem and D. Leven and R. Pollack and S. Sifrony"
+, title =       "Geometric applications of {Davenport}-{Schinzel} sequences"
+, booktitle =   "Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1986
+, pages =       "77--86"
+, keywords =    "Davenport-Schinzel sequences, motion planning, visibility"
+, comments =    "In five journal papers: \cite{ls-ncfcc-87},
+                 \cite{pss-stsps-88}, \cite{ks-empac-90},
+                 \cite{cs-vppt-89}, \cite{ws-prnds-88}"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{sl-mfipc-85
-, author =	"Micha Sharir and R. Livne"
-, title =	"On minima of functions, intersection patterns of curves and {Davenport}-{Schinzel} sequences"
-, booktitle =	"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1985
-, pages =	"312--320"
-, update =	"98.03 mitchell, 94.05 sharir"
+, author =      "Micha Sharir and R. Livne"
+, title =       "On minima of functions, intersection patterns of curves and {Davenport}-{Schinzel} sequences"
+, booktitle =   "Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1985
+, pages =       "312--320"
+, update =      "98.03 mitchell, 94.05 sharir"
 }
 
 @article{so-sosah-92
-, author =	"Micha Sharir and M. Overmars"
-, title =	"A simple output-sensitive algorithm for hidden-surface removal"
-, journal =	"ACM Trans. Graph."
-, volume =	11
-, year =	1992
-, pages =	"1--11"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir and M. Overmars"
+, title =       "A simple output-sensitive algorithm for hidden-surface removal"
+, journal =     "ACM Trans. Graph."
+, volume =      11
+, year =        1992
+, pages =       "1--11"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ss-spps-84
-, author =	"Micha Sharir and A. Schorr"
-, title =	"On shortest paths in polyhedral spaces"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1984
-, pages =	"144--153"
-, precedes =	"ss-spps-86"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir and A. Schorr"
+, title =       "On shortest paths in polyhedral spaces"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1984
+, pages =       "144--153"
+, precedes =    "ss-spps-86"
+, update =      "98.03 mitchell"
 }
 
 @article{ss-spps-86
-, author =	"Micha Sharir and A. Schorr"
-, title =	"On shortest paths in polyhedral spaces"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, year =	1986
-, pages =	"193--215"
-, keywords =	"shortest paths, three-dimensional, polyhedra"
-, succeeds =	"ss-spps-84"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir and A. Schorr"
+, title =       "On shortest paths in polyhedral spaces"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, year =        1986
+, pages =       "193--215"
+, keywords =    "shortest paths, three-dimensional, polyhedra"
+, succeeds =    "ss-spps-84"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{ss-cmpti-88
-, author =	"Micha Sharir and S. Sifrony"
-, title =	"Coordinated motion planning for two independent robots"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"319--328"
-, keywords =	"motion planning, configuration space"
-, precedes =	"ss-cmpti-91"
-, cites =	"ass-sulbl-87, as-tsbac-88, c-crmp-87, fwy-cmtra-86, gss-gmppt-88, hs-ndssg-86, hw-dt-48, klps-ujrcf-86, ko-mltdu-87, ks-empac-90, l-bc-61, ls-esmpa-87, oy-rmpmd-85, osy-gvdl-86, osy-gvdl-87, pss-stsps-88, ra-amprc-85, ss-pmp1c-83, ss-pmp2g-83, ss-pmp3c-83, ss-empae-85, ss-nempa-87, y-cmsd-84, y-oavds-87, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Micha Sharir and S. Sifrony"
+, title =       "Coordinated motion planning for two independent robots"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "319--328"
+, keywords =    "motion planning, configuration space"
+, precedes =    "ss-cmpti-91"
+, cites =       "ass-sulbl-87, as-tsbac-88, c-crmp-87, fwy-cmtra-86, gss-gmppt-88, hs-ndssg-86, hw-dt-48, klps-ujrcf-86, ko-mltdu-87, ks-empac-90, l-bc-61, ls-esmpa-87, oy-rmpmd-85, osy-gvdl-86, osy-gvdl-87, pss-stsps-88, ra-amprc-85, ss-pmp1c-83, ss-pmp2g-83, ss-pmp3c-83, ss-empae-85, ss-nempa-87, y-cmsd-84, y-oavds-87, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{ss-cmpti-91
-, author =	"Micha Sharir and S. Sifrony"
-, title =	"Coordinated motion planning for two independent robots"
-, journal =	"Ann. Math. Artif. Intell."
-, volume =	3
-, year =	1991
-, pages =	"107--130"
-, keywords =	"motion planning, configuration space"
-, succeeds =	"ss-cmpti-88"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir and S. Sifrony"
+, title =       "Coordinated motion planning for two independent robots"
+, journal =     "Ann. Math. Artif. Intell."
+, volume =      3
+, year =        1991
+, pages =       "107--130"
+, keywords =    "motion planning, configuration space"
+, succeeds =    "ss-cmpti-88"
+, update =      "98.03 mitchell"
 }
 
 @article{ss-tbpli-91
-, author =	"Micha Sharir and Steven S. Skiena"
-, title =	"Tight bounds on a problem of lines and intersections"
-, journal =	"Discrete Math."
-, volume =	89
-, year =	1991
-, pages =	"313--314"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir and Steven S. Skiena"
+, title =       "Tight bounds on a problem of lines and intersections"
+, journal =     "Discrete Math."
+, volume =      89
+, year =        1991
+, pages =       "313--314"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{sst-ibkst-00a
-, author =	"Micha Sharir and Shakhar Smorodinsky and G{\'a}bor Tardos"
-, title =	"An Improved Bound for $k$-Sets in Three Dimensions"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"43--49"
-, update =	"00.11 jones"
+, author =      "Micha Sharir and Shakhar Smorodinsky and G{\'a}bor Tardos"
+, title =       "An Improved Bound for $k$-Sets in Three Dimensions"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "43--49"
+, update =      "00.11 jones"
 }
 
 @inproceedings{sst-ibkst-00e
-, author =	"Micha Sharir and Shakhar Smorodinsky and G{\'a}bor Tardos"
-, title =	"An Improved Bound for {$k$}-Sets in Three Dimensions"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"132--135"
-, update =	"00.03 bibrelex"
+, author =      "Micha Sharir and Shakhar Smorodinsky and G{\'a}bor Tardos"
+, title =       "An Improved Bound for {$k$}-Sets in Three Dimensions"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "132--135"
+, update =      "00.03 bibrelex"
 }
 
 @techreport{st-epcp-91
-, author =	"M. Sharir and S. Toledo"
-, title =	"Extremal polygon containment problems"
-, type =	"Technical {Report}"
-, number =	"228/91"
-, institution =	"Dept. Comput. Sci., Tel Aviv Univ."
-, address =	"Tel Aviv, Israel"
-, year =	1991
-, succeeds =	"st-epcp-91t"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "M. Sharir and S. Toledo"
+, title =       "Extremal polygon containment problems"
+, type =        "Technical {Report}"
+, number =      "228/91"
+, institution = "Dept. Comput. Sci., Tel Aviv Univ."
+, address =     "Tel Aviv, Israel"
+, year =        1991
+, succeeds =    "st-epcp-91t"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @techreport{st-epcp-91t
-, author =	"M. Sharir and S. Toledo"
-, title =	"Extremal polygon containment problems"
-, type =	"manuscript"
-, year =	1991
-, precedes =	"st-epcp-91, t-epcpo-91, st-epcp-94, t-epcp-91"
-, update =	"98.11 bibrelex"
+, author =      "M. Sharir and S. Toledo"
+, title =       "Extremal polygon containment problems"
+, type =        "manuscript"
+, year =        1991
+, precedes =    "st-epcp-91, t-epcpo-91, st-epcp-94, t-epcp-91"
+, update =      "98.11 bibrelex"
 }
 
 @article{st-epcp-94
-, author =	"Micha Sharir and S. Toledo"
-, title =	"Extremal polygon containment problems"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	4
-, year =	1994
-, pages =	"99--118"
-, succeeds =	"st-epcp-91t"
-, update =	"98.11 bibrelex, 98.03 mitchell, 95.09 agarwal"
+, author =      "Micha Sharir and S. Toledo"
+, title =       "Extremal polygon containment problems"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      4
+, year =        1994
+, pages =       "99--118"
+, succeeds =    "st-epcp-91t"
+, update =      "98.11 bibrelex, 98.03 mitchell, 95.09 agarwal"
 }
 
 @inproceedings{sw-cblpr-92
-, author =	"Micha Sharir and Emo Welzl"
-, title =	"A combinatorial bound for linear programming and related problems"
-, booktitle =	"Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	577
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"569--579"
-, update =	"98.03 mitchell"
+, author =      "Micha Sharir and Emo Welzl"
+, title =       "A combinatorial bound for linear programming and related problems"
+, booktitle =   "Proc. 9th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      577
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "569--579"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{sw-rpppp-96
-, author =	"Micha Sharir and Emo Welzl"
-, title =	"Rectilinear and Polygonal $p$-Piercing and $p$-Center Problems"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"122--132"
-, cites =	"as-atgo-95, ast-apsgo-94, a-httgl-94, a-bbhdn-94, cm-ltdao-93, dg-ipbr-82, d-pcpho-84, d-rpcp-87, e-hrctt-93, eh-gssml-72, fw-fll-74, f-oatp-91, fj-csrxm-82, fj-fkppc-83, fj-gsrsm-84, gt-ltasc-85, gks-sgsop-95, g-agtpg-80, kh-aanlp-79, kn-cdg-96, kn-pso-96, kc-ltawt-92, kl-wrccp-91, klc-rmcp-87, klc-oaarm-90, msw-sblp-96, m-ltalp-83, m-we1cp-83, m-apcad-83, mt-nrcpc-83, ms-cscgl-84, ol-mcp-81, s-nlap2-96, sw-cblpr-92, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Micha Sharir and Emo Welzl"
+, title =       "Rectilinear and Polygonal $p$-Piercing and $p$-Center Problems"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "122--132"
+, cites =       "as-atgo-95, ast-apsgo-94, a-httgl-94, a-bbhdn-94, cm-ltdao-93, dg-ipbr-82, d-pcpho-84, d-rpcp-87, e-hrctt-93, eh-gssml-72, fw-fll-74, f-oatp-91, fj-csrxm-82, fj-fkppc-83, fj-gsrsm-84, gt-ltasc-85, gks-sgsop-95, g-agtpg-80, kh-aanlp-79, kn-cdg-96, kn-pso-96, kc-ltawt-92, kl-wrccp-91, klc-rmcp-87, klc-oaarm-90, msw-sblp-96, m-ltalp-83, m-we1cp-83, m-apcad-83, mt-nrcpc-83, ms-cscgl-84, ol-mcp-81, s-nlap2-96, sw-cblpr-92, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @techreport{sy-ricdd-90
-, author =	"Micha Sharir and E. Yaniv"
-, title =	"Randomized incremental construction of {Delaunay} diagrams: {Theory} and Practice"
-, institution =	"Tel Aviv Univ, Israel"
-, month =	jul
-, year =	1990
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "Micha Sharir and E. Yaniv"
+, title =       "Randomized incremental construction of {Delaunay} diagrams: {Theory} and Practice"
+, institution = "Tel Aviv Univ, Israel"
+, month =       jul
+, year =        1990
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @inproceedings{sw-tttpv-95
-, author =	"A. Shashua and M. Werman"
-, title =	"On the Trilinear Tensor of Three Perspective Views and its Underlying Geometry"
-, booktitle =	"Proc. International Conference on Computer Vision"
-, year =	1995
-, update =	"96.01 werman"
+, author =      "A. Shashua and M. Werman"
+, title =       "On the Trilinear Tensor of Three Perspective Views and its Underlying Geometry"
+, booktitle =   "Proc. International Conference on Computer Vision"
+, year =        1995
+, update =      "96.01 werman"
 }
 
 @inproceedings{sz-aqrld-96
-, author =	"H. Shatkay and S. Zdonik"
-, title =	"Approximate queries and representations for large data sequences"
-, booktitle =	"ICDE'96"
-, year =	1996
-, update =	"00.11 smid, 00.07 smid, 98.07 bibrelex"
+, author =      "H. Shatkay and S. Zdonik"
+, title =       "Approximate queries and representations for large data sequences"
+, booktitle =   "ICDE'96"
+, year =        1996
+, update =      "00.11 smid, 00.07 smid, 98.07 bibrelex"
 }
 
 @article{sp-msfmn-78
-, author =	"R. D. Shaw and R. G. Pitchen"
-, title =	"Modifications to the Suhara-Fukuda Method of Network Generation"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	12
-, year =	1978
-, pages =	"96--99"
-, annote =	"Modified S-F algorithm. Generates interior nodes on
-		 equilateral triangle grid and then triangulates
-		 resulting set. Builds triangle on each ``open'' edge in
-		 turn."
+, author =      "R. D. Shaw and R. G. Pitchen"
+, title =       "Modifications to the Suhara-Fukuda Method of Network Generation"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      12
+, year =        1978
+, pages =       "96--99"
+, annote =      "Modified S-F algorithm. Generates interior nodes on
+                 equilateral triangle grid and then triangulates
+                 resulting set. Builds triangle on each ``open'' edge in
+                 turn."
 }
 
 @article{sar-sdmsc-96
-, author =	"D. J. Sheehy and C. G. Armstrong and D. J. Robinson"
-, title =	"Shape Description by Medial Surface Construction"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	2
-, number =	1
-, month =	mar
-, year =	1996
-, pages =	"62--72"
-, update =	"96.09 held"
+, author =      "D. J. Sheehy and C. G. Armstrong and D. J. Robinson"
+, title =       "Shape Description by Medial Surface Construction"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      2
+, number =      1
+, month =       mar
+, year =        1996
+, pages =       "62--72"
+, update =      "96.09 held"
 }
 
 @inproceedings{sfyc-obdmcs-96
-, author =	"Raj Shekhar and Elias Fayyad and Roni Yagel and J. Fredrick Cornhill"
-, title =	"Octree-Based Decimation of Marching Cubes Surfaces"
-, editor =	"Roni Yagel and Gregory M. Nielson"
-, booktitle =	"Proceedings of the Conference on Visualization"
-, publisher =	"IEEE"
-, address =	"Los Alamitos"
-, year =	1996
-, pages =	"335--344"
-, isbn =	"0-7803-3673-9"
-, update =	"01.07 wenger"
+, author =      "Raj Shekhar and Elias Fayyad and Roni Yagel and J. Fredrick Cornhill"
+, title =       "Octree-Based Decimation of Marching Cubes Surfaces"
+, editor =      "Roni Yagel and Gregory M. Nielson"
+, booktitle =   "Proceedings of the Conference on Visualization"
+, publisher =   "IEEE"
+, address =     "Los Alamitos"
+, year =        1996
+, pages =       "335--344"
+, isbn =        "0-7803-3673-9"
+, update =      "01.07 wenger"
 }
 
 @inproceedings{sn-anpld-89
-, author =	"C. Shen and G. Nagy"
-, title =	"Autonomous navigation to provide long-distance surface traverses for {Mars} rover sample return missions"
-, booktitle =	"Proc. IEEE Internat. Sympos. Intelligent Control"
-, year =	1989
-, pages =	"362--367"
-, update =	"97.11 bibrelex"
+, author =      "C. Shen and G. Nagy"
+, title =       "Autonomous navigation to provide long-distance surface traverses for {Mars} rover sample return missions"
+, booktitle =   "Proc. IEEE Internat. Sympos. Intelligent Control"
+, year =        1989
+, pages =       "362--367"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{se-tlbsv-86
-, author =	"X. Shen and H. Edelsbrunner"
-, title =	"A tight lower bound on the size of visibility graphs"
-, number =	"UIUCDCS-R-86-1299"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1986
-, precedes =	"se-tlbsv-87"
-, update =	"98.11 bibrelex"
+, author =      "X. Shen and H. Edelsbrunner"
+, title =       "A tight lower bound on the size of visibility graphs"
+, number =      "UIUCDCS-R-86-1299"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1986
+, precedes =    "se-tlbsv-87"
+, update =      "98.11 bibrelex"
 }
 
 @article{se-tlbsv-87
-, author =	"X. Shen and H. Edelsbrunner"
-, title =	"A tight lower bound on the size of visibility graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	26
-, year =	1987
-, pages =	"61--64"
-, succeeds =	"se-tlbsv-86"
-, update =	"98.11 bibrelex"
+, author =      "X. Shen and H. Edelsbrunner"
+, title =       "A tight lower bound on the size of visibility graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      26
+, year =        1987
+, pages =       "61--64"
+, succeeds =    "se-tlbsv-86"
+, update =      "98.11 bibrelex"
 }
 
 @article{sh-nmvg-93
-, author =	"X. Shen and Q. Hu"
-, title =	"A note on minimal visibility graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	46
-, year =	1993
-, pages =	101
-, update =	"98.11 bibrelex"
+, author =      "X. Shen and Q. Hu"
+, title =       "A note on minimal visibility graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      46
+, year =        1993
+, pages =       101
+, update =      "98.11 bibrelex"
 }
 
 @incollection{s-cilc-94
-, author =	"Ching-Kuang Shene"
-, title =	"Computing the Intersection of a Line and a Cylinder"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"353--355"
-, keywords =	"quadric surface, ray tracing, cone"
-, update =	"94.09 heckbert"
-, annote =	"Geometric method for intersecting a ray with a cylinder."
+, author =      "Ching-Kuang Shene"
+, title =       "Computing the Intersection of a Line and a Cylinder"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "353--355"
+, keywords =    "quadric surface, ray tracing, cone"
+, update =      "94.09 heckbert"
+, annote =      "Geometric method for intersecting a ray with a cylinder."
 }
 
 @incollection{s-ecc-94
-, author =	"Ching-Kuang Shene"
-, title =	"Equations of Cylinders and Cones"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"321--323"
-, keywords =	"quadric surface"
-, update =	"94.09 heckbert"
-, annote =	"Derives the implicit equations of cylinders and cones."
+, author =      "Ching-Kuang Shene"
+, title =       "Equations of Cylinders and Cones"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "321--323"
+, keywords =    "quadric surface"
+, update =      "94.09 heckbert"
+, annote =      "Derives the implicit equations of cylinders and cones."
 }
 
 @techreport{sj-lditn-91
-, author =	"C.-K. Shene and J. K. Johnstone"
-, title =	"On the lower degree intersections of two natural quadrics, part {I}: algorithms"
-, type =	"Technical {Report}"
-, number =	"JHU-91-15"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	sep
-, year =	1991
-, succeeds =	"sj-pinq-91"
+, author =      "C.-K. Shene and J. K. Johnstone"
+, title =       "On the lower degree intersections of two natural quadrics, part {I}: algorithms"
+, type =        "Technical {Report}"
+, number =      "JHU-91-15"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       sep
+, year =        1991
+, succeeds =    "sj-pinq-91"
 }
 
 @inproceedings{sj-pinq-91
-, author =	"C.-K. Shene and J. K. Johnstone"
-, title =	"On the planar intersection of natural quadrics"
-, booktitle =	"Proc. ACM Sympos. Solid Modeling Found. CAD/CAM Appl."
-, year =	1991
-, pages =	"233--242"
-, precedes =	"sj-lditn-91"
+, author =      "C.-K. Shene and J. K. Johnstone"
+, title =       "On the planar intersection of natural quadrics"
+, booktitle =   "Proc. ACM Sympos. Solid Modeling Found. CAD/CAM Appl."
+, year =        1991
+, pages =       "233--242"
+, precedes =    "sj-lditn-91"
 }
 
 @article{sh-ttsps-92
-, author =	"X. Sheng and B. E. Hirsch"
-, title =	"Triangulation of trimmed surfaces in parametric space"
-, journal =	"Comput. Aided Design"
-, volume =	24
-, year =	1992
-, pages =	"437--444"
-, update =	"98.07 bibrelex"
+, author =      "X. Sheng and B. E. Hirsch"
+, title =       "Triangulation of trimmed surfaces in parametric space"
+, journal =     "Comput. Aided Design"
+, volume =      24
+, year =        1992
+, pages =       "437--444"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{st-tsms-91
-, author =	"X. Sheng and U. Tucholke"
-, title =	"On triangulating suface models for {SLA}"
-, booktitle =	"Proc. 2nd Internat. Conf. on Rapid Prototyping"
-, site =	"Dayton, OH"
-, year =	1991
-, pages =	"236--239"
-, update =	"98.07 bibrelex"
+, author =      "X. Sheng and U. Tucholke"
+, title =       "On triangulating suface models for {SLA}"
+, booktitle =   "Proc. 2nd Internat. Conf. on Rapid Prototyping"
+, site =        "Dayton, OH"
+, year =        1991
+, pages =       "236--239"
+, update =      "98.07 bibrelex"
 }
 
 @article{sc-mesaa-86
-, author =	"D. N. Shenton and Z. J. Cendes"
-, title =	"{MAX}---An Expert System for automatic adaptive magnetics modelling"
-, journal =	"IEEE Trans. Magn."
-, volume =	"MAG-22"
-, year =	1986
-, pages =	"805--807"
-, annote =	"DT mesh refined by adding points at circumcentre
-		 instead of centroid."
+, author =      "D. N. Shenton and Z. J. Cendes"
+, title =       "{MAX}---An Expert System for automatic adaptive magnetics modelling"
+, journal =     "IEEE Trans. Magn."
+, volume =      "MAG-22"
+, year =        1986
+, pages =       "805--807"
+, annote =      "DT mesh refined by adding points at circumcentre
+                 instead of centroid."
 }
 
 @article{sc-tdfem-85
-, author =	"D. N. Shenton and Z. J. Cendes"
-, title =	"Three-Dimensional Finite Element Mesh Generation Using {Delaunay} Tessellation"
-, journal =	"IEEE Trans. Magn."
-, volume =	"MAG-21"
-, number =	6
-, year =	1985
-, pages =	"2535--2538"
-, annote =	"Switching extended to 3D basic incremental
-		 algorithm."
+, author =      "D. N. Shenton and Z. J. Cendes"
+, title =       "Three-Dimensional Finite Element Mesh Generation Using {Delaunay} Tessellation"
+, journal =     "IEEE Trans. Magn."
+, volume =      "MAG-21"
+, number =      6
+, year =        1985
+, pages =       "2535--2538"
+, annote =      "Switching extended to 3D basic incremental
+                 algorithm."
 }
 
 @inproceedings{s-tdifi-68
-, author =	"D. Shepard"
-, title =	"A two-dimensional interpolation function for irregularly spaced data"
-, booktitle =	"Proc. 23rd Nat. Conf. ACM"
-, year =	1968
-, pages =	"517--524"
+, author =      "D. Shepard"
+, title =       "A two-dimensional interpolation function for irregularly spaced data"
+, booktitle =   "Proc. 23rd Nat. Conf. ACM"
+, year =        1968
+, pages =       "517--524"
 }
 
 @article{s-spcp-66
-, author =	"G. C. Shepard"
-, title =	"The {Steiner} point of a convex polytope"
-, journal =	"Canad. J. Math."
-, volume =	18
-, year =	1966
-, pages =	"1294--1300"
-, update =	"98.03 bibrelex"
+, author =      "G. C. Shepard"
+, title =       "The {Steiner} point of a convex polytope"
+, journal =     "Canad. J. Math."
+, volume =      18
+, year =        1966
+, pages =       "1294--1300"
+, update =      "98.03 bibrelex"
 }
 
 @article{s-cpcn-75
-, author =	"G. C. Shephard"
-, title =	"Convex Polytopes with Convex Nets"
-, journal =	"Math. Proc. Camb. Phil. Soc."
-, volume =	78
-, year =	1975
-, pages =	"389--403"
-, update =	"94.09 orourke"
+, author =      "G. C. Shephard"
+, title =       "Convex Polytopes with Convex Nets"
+, journal =     "Math. Proc. Camb. Phil. Soc."
+, volume =      78
+, year =        1975
+, pages =       "389--403"
+, update =      "94.09 orourke"
 }
 
 @article{s-aagcf-88
-, author =	"M. S. Shephard"
-, title =	"Approaches to the automatic generation and control of finite element meshes"
-, journal =	"Appl. Mech. Rev."
-, volume =	41
-, year =	1988
-, pages =	"169--185"
-, update =	"97.11 bibrelex"
+, author =      "M. S. Shephard"
+, title =       "Approaches to the automatic generation and control of finite element meshes"
+, journal =     "Appl. Mech. Rev."
+, volume =      41
+, year =        1988
+, pages =       "169--185"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-aamg-85
-, author =	"M. S. Shephard"
-, title =	"Automatic and adaptive mesh generation"
-, journal =	"IEEE Trans. Magn."
-, volume =	"MAG-21"
-, year =	1985
-, pages =	"2484--2489"
+, author =      "M. S. Shephard"
+, title =       "Automatic and adaptive mesh generation"
+, journal =     "IEEE Trans. Magn."
+, volume =      "MAG-21"
+, year =        1985
+, pages =       "2484--2489"
 }
 
 @article{sl-agctd-91
-, author =	"M. S. Shephard and J. A. Lo"
-, title =	"Automatic Generation of coarse three-dimensional meshes using the functionality of a geometric modeler"
-, journal =	"Advances in Engineering Software and Workstations"
-, volume =	13
-, number =	"5--6"
-, month =	sep
-, year =	1991
-, pages =	"273--286"
-, annote =	"Subdivides by chopping of tetrahedra. Tetra quality
-		 measure is $\mbox{Volume}^2/\mbox{Area}^3$."
+, author =      "M. S. Shephard and J. A. Lo"
+, title =       "Automatic Generation of coarse three-dimensional meshes using the functionality of a geometric modeler"
+, journal =     "Advances in Engineering Software and Workstations"
+, volume =      13
+, number =      "5--6"
+, month =       sep
+, year =        1991
+, pages =       "273--286"
+, annote =      "Subdivides by chopping of tetrahedra. Tetra quality
+                 measure is $\mbox{Volume}^2/\mbox{Area}^3$."
 }
 
 @article{syb-amgae-85
-, author =	"M. S. Shephard and M. A. Yerry and P. O. Baehmann"
-, title =	"Automatic mesh generation allowing for efficient a priori and posteriori mesh refinement"
-, journal =	"Comput. Methods Appl. Mech. Engrg."
-, volume =	55
-, year =	1985
-, pages =	"161--180"
+, author =      "M. S. Shephard and M. A. Yerry and P. O. Baehmann"
+, title =       "Automatic mesh generation allowing for efficient a priori and posteriori mesh refinement"
+, journal =     "Comput. Methods Appl. Mech. Engrg."
+, volume =      55
+, year =        1985
+, pages =       "161--180"
 }
 
 @article{sk-ctnmx-78
-, author =	"L. A. Shepp and J. B. Kruskal"
-, title =	"Computerized tomography: the new medical {X}-ray technology"
-, journal =	"Amer. Math. Monthly"
-, volume =	85
-, year =	1978
-, pages =	"420--439"
-, update =	"97.11 bibrelex"
+, author =      "L. A. Shepp and J. B. Kruskal"
+, title =       "Computerized tomography: the new medical {X}-ray technology"
+, journal =     "Amer. Math. Monthly"
+, volume =      85
+, year =        1978
+, pages =       "420--439"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{s-qrm-78
-, author =	"S. W. Sheppard"
-, title =	"Quaternion from Rotation Matrix"
-, type =	"NASA Contract"
-, number =	"NAS 9-13809"
-, institution =	"The Charles Stark Draper Laboratory, Inc."
-, address =	"Cambridge, MA"
-, year =	1978
-, update =	"98.11 bibrelex"
+, author =      "S. W. Sheppard"
+, title =       "Quaternion from Rotation Matrix"
+, type =        "NASA Contract"
+, number =      "NAS 9-13809"
+, institution = "The Charles Stark Draper Laboratory, Inc."
+, address =     "Cambridge, MA"
+, year =        1978
+, update =      "98.11 bibrelex"
 }
 
 @phdthesis{s-3dsi-95
-, author =	"E. C. Sherbrooke"
-, title =	"3-{D} Shape Interrogation by Medial Axis Transform"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Ocean Engineering, Massachusetts Institute of Technology"
-, address =	"Cambridge, Massachusetts"
-, year =	1995
-, keywords =	"doctoral thesis"
-, update =	"95.05 abrams+held"
+, author =      "E. C. Sherbrooke"
+, title =       "3-{D} Shape Interrogation by Medial Axis Transform"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Ocean Engineering, Massachusetts Institute of Technology"
+, address =     "Cambridge, Massachusetts"
+, year =        1995
+, keywords =    "doctoral thesis"
+, update =      "95.05 abrams+held"
 }
 
 @inproceedings{sp-cmat3-95
-, author =	"E. C. Sherbrooke and N. M. Patrikalakis"
-, title =	"Computation of Medial Axis Transforms of 3D Polyhedra"
-, editor =	"J. R. Rossignac and C. M. Hoffmann"
-, booktitle =	"Proc. Third ACM Solid Modeling Conference"
-, year =	1995
-, update =	"95.05 abrams"
+, author =      "E. C. Sherbrooke and N. M. Patrikalakis"
+, title =       "Computation of Medial Axis Transforms of 3D Polyhedra"
+, editor =      "J. R. Rossignac and C. M. Hoffmann"
+, booktitle =   "Proc. Third ACM Solid Modeling Conference"
+, year =        1995
+, update =      "95.05 abrams"
 }
 
 @article{sp-csnps-93
-, author =	"E. C. Sherbrooke and N. M. Patrikalakis"
-, title =	"Computation of the Solutions of Nonlinear Polynomial Systems"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	10
-, number =	5
-, year =	1993
-, pages =	"379--405"
-, update =	"95.05 abrams"
+, author =      "E. C. Sherbrooke and N. M. Patrikalakis"
+, title =       "Computation of the Solutions of Nonlinear Polynomial Systems"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      10
+, number =      5
+, year =        1993
+, pages =       "379--405"
+, update =      "95.05 abrams"
 }
 
 @article{spb-amat3-96
-, author =	"E. C. Sherbrooke and N. M. Patrikalakis and E. Brisson"
-, title =	"An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	2
-, number =	1
-, month =	mar
-, year =	1996
-, pages =	"45--61"
-, update =	"96.09 held"
+, author =      "E. C. Sherbrooke and N. M. Patrikalakis and E. Brisson"
+, title =       "An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      2
+, number =      1
+, month =       mar
+, year =        1996
+, pages =       "45--61"
+, update =      "96.09 held"
 }
 
 @article{sp-simc-90
-, author =	"D. Sherman and S. Peleg"
-, title =	"Stereo by incremental matching of contours"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	12
-, number =	11
-, year =	1990
-, pages =	"1102--1106"
-, update =	"97.11 bibrelex"
+, author =      "D. Sherman and S. Peleg"
+, title =       "Stereo by incremental matching of contours"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      12
+, number =      11
+, year =        1990
+, pages =       "1102--1106"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{s-tbceg-94
-, author =	"T. Shermer"
-, title =	"A tight bound on the combinatorial edge guarding problem"
-, booktitle =	"Snapshots of Computational and Discrete Geometry"
-, volume =	3
-, publisher =	"School Comput. Sci., McGill Univ."
-, month =	aug
-, year =	1994
-, pages =	"191--223"
-, update =	"97.11 orourke"
+, author =      "T. Shermer"
+, title =       "A tight bound on the combinatorial edge guarding problem"
+, booktitle =   "Snapshots of Computational and Discrete Geometry"
+, volume =      3
+, publisher =   "School Comput. Sci., McGill Univ."
+, month =       aug
+, year =        1994
+, pages =       "191--223"
+, update =      "97.11 orourke"
 }
 
 @inproceedings{s-cbtt-89
-, author =	"T. Shermer"
-, title =	"Computing bushy and thin triangulations"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	49
-, precedes =	"s-cbtt-91"
+, author =      "T. Shermer"
+, title =       "Computing bushy and thin triangulations"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       49
+, precedes =    "s-cbtt-91"
 }
 
 @article{s-cbtt-91
-, author =	"T. Shermer"
-, title =	"Computing bushy and thin triangulations"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, year =	1991
-, pages =	"115--125"
-, succeeds =	"s-cbtt-89"
+, author =      "T. Shermer"
+, title =       "Computing bushy and thin triangulations"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, year =        1991
+, pages =       "115--125"
+, succeeds =    "s-cbtt-89"
 }
 
 @techreport{s-cgopl-91
-, author =	"T. Shermer"
-, title =	"Convering and Guarding Orthogonal Polygons with $l_k$-Sets"
-, type =	"manuscript"
-, institution =	"Simon Fraser University"
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "T. Shermer"
+, title =       "Convering and Guarding Orthogonal Polygons with $l_k$-Sets"
+, type =        "manuscript"
+, institution = "Simon Fraser University"
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @article{s-cgpul-91
-, author =	"T. Shermer"
-, title =	"Convering and Guarding Polygons Using $L_k$-Sets"
-, journal =	"Geom. Dedicata"
-, volume =	37
-, year =	1991
-, pages =	"183--203"
-, update =	"98.11 bibrelex"
+, author =      "T. Shermer"
+, title =       "Convering and Guarding Polygons Using $L_k$-Sets"
+, journal =     "Geom. Dedicata"
+, volume =      37
+, year =        1991
+, pages =       "183--203"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{s-hpp-87
-, author =	"T. Shermer"
-, title =	"Hiding people in polygons"
-, type =	"Technical {Report}"
-, number =	"SOCS-87.18"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1987
-, precedes =	"s-hpp-89"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "T. Shermer"
+, title =       "Hiding people in polygons"
+, type =        "Technical {Report}"
+, number =      "SOCS-87.18"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1987
+, precedes =    "s-hpp-89"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @article{s-hpp-89
-, author =	"T. Shermer"
-, title =	"Hiding People in Polygons"
-, journal =	"Computing"
-, volume =	42
-, year =	1989
-, pages =	"109--131"
-, succeeds =	"s-hpp-87"
-, update =	"98.11 bibrelex"
+, author =      "T. Shermer"
+, title =       "Hiding People in Polygons"
+, journal =     "Computing"
+, volume =      42
+, year =        1989
+, pages =       "109--131"
+, succeeds =    "s-hpp-87"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{s-rvg3e-96
-, author =	"T. Shermer"
-, title =	"On rectangle visibility graphs {III}: {External} visibility and complexity"
-, institution =	"DIMACS and Simon Fraser University"
-, month =	apr
-, year =	1996
-, keywords =	"visibility graphs"
-, update =	"96.09 orourke"
+, author =      "T. Shermer"
+, title =       "On rectangle visibility graphs {III}: {External} visibility and complexity"
+, institution = "DIMACS and Simon Fraser University"
+, month =       apr
+, year =        1996
+, keywords =    "visibility graphs"
+, update =      "96.09 orourke"
 }
 
 @techreport{s-rrag-90
-, author =	"T. Shermer"
-, title =	"Recent results in art galleries"
-, type =	"Technical {Report}"
-, institution =	"Simon Fraser Univ."
-, address =	"Burnaby, BC"
-, month =	oct
-, year =	1990
-, precedes =	"s-rrag-92"
-, update =	"98.07 bibrelex"
+, author =      "T. Shermer"
+, title =       "Recent results in art galleries"
+, type =        "Technical {Report}"
+, institution = "Simon Fraser Univ."
+, address =     "Burnaby, BC"
+, month =       oct
+, year =        1990
+, precedes =    "s-rrag-92"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-cgavp-93
-, author =	"Thomas Shermer"
-, title =	"The continuous-graph approach to visibility problems"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	321
-, update =	"93.09 milone+mitchell"
+, author =      "Thomas Shermer"
+, title =       "The continuous-graph approach to visibility problems"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       321
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{s-tgtre-84
-, author =	"T. Shermer"
-, title =	"Triangulation graphs that require extra guards"
-, type =	"Technical {Memo}"
-, number =	13
-, institution =	"3-D Animation Syst. Group, Comput. Graph. Lab., New York Inst. Tech."
-, address =	"New York, NY"
-, year =	1984
+, author =      "T. Shermer"
+, title =       "Triangulation graphs that require extra guards"
+, type =        "Technical {Memo}"
+, number =      13
+, institution = "3-D Animation Syst. Group, Comput. Graph. Lab., New York Inst. Tech."
+, address =     "New York, NY"
+, year =        1984
 }
 
 @phdthesis{s-vpp-89
-, author =	"T. Shermer"
-, title =	"Visibility properties of polygons"
-, school =	"McGill Univ."
-, year =	1989
-, keywords =	"doctoral thesis"
-, update =	"94.05 devillers"
+, author =      "T. Shermer"
+, title =       "Visibility properties of polygons"
+, school =      "McGill Univ."
+, year =        1989
+, keywords =    "doctoral thesis"
+, update =      "94.05 devillers"
 }
 
 @techreport{st-ccssp-88
-, author =	"T. Shermer and G. T. Toussaint"
-, title =	"Characterizations of convex and star-shaped polygons"
-, number =	"SOCS-88.11"
-, institution =	"School of Computer Science, McGill University"
-, month =	jun
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "T. Shermer and G. T. Toussaint"
+, title =       "Characterizations of convex and star-shaped polygons"
+, number =      "SOCS-88.11"
+, institution = "School of Computer Science, McGill University"
+, month =       jun
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @article{s-labp-92
-, author =	"T. C. Shermer"
-, title =	"A linear algorithm for bisecting a polygon"
-, journal =	"Inform. Process. Lett."
-, volume =	41
-, year =	1992
-, pages =	"135--140"
+, author =      "T. C. Shermer"
+, title =       "A linear algorithm for bisecting a polygon"
+, journal =     "Inform. Process. Lett."
+, volume =      41
+, year =        1992
+, pages =       "135--140"
 }
 
 @article{s-rutcp-93
-, author =	"T. C. Shermer"
-, title =	"On recognizing unions of two convex polygons and related problems"
-, journal =	"Pattern Recogn. Lett."
-, volume =	14
-, year =	1993
-, update =	"98.07 bibrelex"
+, author =      "T. C. Shermer"
+, title =       "On recognizing unions of two convex polygons and related problems"
+, journal =     "Pattern Recogn. Lett."
+, volume =      14
+, year =        1993
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-rvgie-96
-, author =	"T. C. Shermer"
-, title =	"On rectangle visibility graphs, {III}: {External} visibility and complexity"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"234--239"
-, update =	"97.11 orourke, 97.03 agarwal, 96.09 mitchell"
+, author =      "T. C. Shermer"
+, title =       "On rectangle visibility graphs, {III}: {External} visibility and complexity"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "234--239"
+, update =      "97.11 orourke, 97.03 agarwal, 96.09 mitchell"
 }
 
 @article{s-rrag-92
-, author =	"T. C. Shermer"
-, title =	"Recent Results in Art Galleries"
-, journal =	"Proc. IEEE"
-, volume =	80
-, number =	9
-, month =	sep
-, year =	1992
-, pages =	"1384--1399"
-, succeeds =	"s-rrag-90"
-, update =	"98.07 bibrelex, 93.09 held"
+, author =      "T. C. Shermer"
+, title =       "Recent Results in Art Galleries"
+, journal =     "Proc. IEEE"
+, volume =      80
+, number =      9
+, month =       sep
+, year =        1992
+, pages =       "1384--1399"
+, succeeds =    "s-rrag-90"
+, update =      "98.07 bibrelex, 93.09 held"
 }
 
 @inproceedings{sy-pncrr-95
-, author =	"T. C. Shermer and C. K. Yap"
-, title =	"Probing for near centers and relative roundness"
-, booktitle =	"Proc. ASME Workshop on Tolerancing and Metrology"
-, year =	1995
-, update =	"97.03 agarwal"
+, author =      "T. C. Shermer and C. K. Yap"
+, title =       "Probing for near centers and relative roundness"
+, booktitle =   "Proc. ASME Workshop on Tolerancing and Metrology"
+, year =        1995
+, update =      "97.03 agarwal"
 }
 
 @techreport{s-apfpa-96
-, author =	"J. Shewchuk"
-, title =	"Adaptive precision floating point arithmetic and fast robust geometric predicates"
-, number =	"CMU-CS-96-140"
-, institution =	"Carnegie Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "J. Shewchuk"
+, title =       "Adaptive precision floating point arithmetic and fast robust geometric predicates"
+, number =      "CMU-CS-96-140"
+, institution = "Carnegie Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-cgehd-98
-, author =	"Jonathan R. Shewchuk"
-, title =	"A Condition Guaranteeing the Existence of Higher-Dimensional Constrained {Delaunay} Triangulations"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"76--85"
-, update =	"00.11 smid, 00.07 devillers"
+, author =      "Jonathan R. Shewchuk"
+, title =       "A Condition Guaranteeing the Existence of Higher-Dimensional Constrained {Delaunay} Triangulations"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "76--85"
+, update =      "00.11 smid, 00.07 devillers"
 }
 
 @article{s-apfpa-97
-, author =	"Jonathan Richard Shewchuk"
-, title =	"Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates"
-, journal =	"Discrete Comput. Geom."
-, volume =	18
-, number =	3
-, year =	1997
-, pages =	"305--363"
-, succeeds =	"s-apfpa-96,s-rafpg-96"
-, update =	"00.03 vismara"
+, author =      "Jonathan Richard Shewchuk"
+, title =       "Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates"
+, journal =     "Discrete Comput. Geom."
+, volume =      18
+, number =      3
+, year =        1997
+, pages =       "305--363"
+, succeeds =    "s-apfpa-96,s-rafpg-96"
+, update =      "00.03 vismara"
 }
 
 @inproceedings{s-mgdsa-00
-, author =	"Jonathan R. Shewchuk"
-, title =	"Mesh Generation for Domains with Small Angles"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"1--10"
-, update =	"00.11 jones"
+, author =      "Jonathan R. Shewchuk"
+, title =       "Mesh Generation for Domains with Small Angles"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "1--10"
+, update =      "00.11 jones"
 }
 
 @inproceedings{s-rafpg-96
-, author =	"Jonathan R. Shewchuk"
-, title =	"Robust Adaptive Floating-Point Geometric Predicates"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"141--150"
-, cites =	"abdpy-esdus-97, b-phpmp-93,  c-sede-92, d-fptea-71, fv-eeacg-93, fv-sayee-96, g-wecss-91, gs-pmgsc-85, kln-edtur-91, k-sa-81, ls-tacdt-80, p-aapfp-91, p-pfpan-92, s-te2dq-96, w-cnddt-81, ZZZ"
-, update =	"98.07 bibrelex, 97.11 bibrelex, 96.09 devillers+orourke, 96.05 efrat"
+, author =      "Jonathan R. Shewchuk"
+, title =       "Robust Adaptive Floating-Point Geometric Predicates"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "141--150"
+, cites =       "abdpy-esdus-97, b-phpmp-93,  c-sede-92, d-fptea-71, fv-eeacg-93, fv-sayee-96, g-wecss-91, gs-pmgsc-85, kln-edtur-91, k-sa-81, ls-tacdt-80, p-aapfp-91, p-pfpan-92, s-te2dq-96, w-cnddt-81, ZZZ"
+, update =      "98.07 bibrelex, 97.11 bibrelex, 96.09 devillers+orourke, 96.05 efrat"
 }
 
 @inproceedings{s-sachd-00
-, author =	"Jonathan Richard Shewchuk"
-, title =	"Sweep Algorithms for Constructing Higher-Dimensional Constrained {Delaunay} Triangulations"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"350--359"
-, update =	"00.11 jones"
+, author =      "Jonathan Richard Shewchuk"
+, title =       "Sweep Algorithms for Constructing Higher-Dimensional Constrained {Delaunay} Triangulations"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "350--359"
+, update =      "00.11 jones"
 }
 
 @inproceedings{s-tmgdr-98
-, author =	"Jonathan R. Shewchuk"
-, title =	"Tetrahedral mesh generation by {Delaunay} refinement"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Comput. Geom."
-, year =	1998
-, pages =	"86--95"
-, update =	"02.03 devillers, ???"
+, author =      "Jonathan R. Shewchuk"
+, title =       "Tetrahedral mesh generation by {Delaunay} refinement"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Comput. Geom."
+, year =        1998
+, pages =       "86--95"
+, update =      "02.03 devillers, ???"
 }
 
 @inproceedings{s-te2dq-96
-, author =	"J. R. Shewchuk"
-, title =	"Triangle: Engineering a $2$d quality mesh generator and {Delaunay} triangulator"
-, booktitle =	"First Workshop on Applied Computational Geometry"
-, organization =	"Association for Computing Machinery"
-, month =	may
-, year =	1996
-, update =	"01.07 devillers, 97.11 bibrelex"
+, author =      "J. R. Shewchuk"
+, title =       "Triangle: Engineering a $2$d quality mesh generator and {Delaunay} triangulator"
+, booktitle =   "First Workshop on Applied Computational Geometry"
+, organization =        "Association for Computing Machinery"
+, month =       may
+, year =        1996
+, update =      "01.07 devillers, 97.11 bibrelex"
 }
 
 @inproceedings{s-swa-92
-, author =	"J. S. Shieh"
-, title =	"Shortsighted watchman arrangement"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"192--197"
-, cites =	"os-snhpd-83, k-dpsc-83, ags-ccrpd-88, o-agta-87, ws-oacdt-87, c-cdt-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "J. S. Shieh"
+, title =       "Shortsighted watchman arrangement"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "192--197"
+, cites =       "os-snhpd-83, k-dpsc-83, ags-ccrpd-88, o-agta-87, ws-oacdt-87, c-cdt-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ss-ahmgs-96
-, author =	"Bih-Yaw Shih and Hiroshi Sakurai"
-, title =	"Automated hexahedral mesh generation by swept volume decomposition and recomposition"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"273--280"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Bih-Yaw Shih and Hiroshi Sakurai"
+, title =       "Automated hexahedral mesh generation by swept volume decomposition and recomposition"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "273--280"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @article{scl-saeap-87
-, author =	"Z. C. Shih and G. H. Chen and R. C. T. Lee"
-, title =	"Systolic algorithms to examine all pairs of elements"
-, journal =	"CACM"
-, volume =	"??"
-, month =	feb
-, year =	1987
-, pages =	"161--167"
-, update =	"98.03 bibrelex"
+, author =      "Z. C. Shih and G. H. Chen and R. C. T. Lee"
+, title =       "Systolic algorithms to examine all pairs of elements"
+, journal =     "CACM"
+, volume =      "??"
+, month =       feb
+, year =        1987
+, pages =       "161--167"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{sd-gtomr-88
-, author =	"Z. Shiller and S. Dubowsky"
-, title =	"Global Time-Optimal Motions of Robotic Manipulators in the Presence of Obstacles"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Philadelphia"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "Z. Shiller and S. Dubowsky"
+, title =       "Global Time-Optimal Motions of Robotic Manipulators in the Presence of Obstacles"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Philadelphia"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{s-apgpl-76
-, author =	"Y. Shiloach"
-, title =	"Arrangements of Planar Graphs on the Planar Lattice"
-, school =	"Weizmann Institute of Science"
-, year =	1976
-, keywords =	"doctoral thesis, graph drawing"
-, update =	"93.09 tamassia"
+, author =      "Y. Shiloach"
+, title =       "Arrangements of Planar Graphs on the Planar Lattice"
+, school =      "Weizmann Institute of Science"
+, year =        1976
+, keywords =    "doctoral thesis, graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{sv-fmmsp-81
-, author =	"Y. Shiloach and U. Vishkin"
-, title =	"Finding the maximum, merging and sorting in a parallel computation model"
-, journal =	"J. Algorithms"
-, volume =	2
-, year =	1981
-, pages =	"88--102"
-, update =	"97.11 bibrelex"
+, author =      "Y. Shiloach and U. Vishkin"
+, title =       "Finding the maximum, merging and sorting in a parallel computation model"
+, journal =     "J. Algorithms"
+, volume =      2
+, year =        1981
+, pages =       "88--102"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ssa-hdsj-97
-, author =	"K. Shim and R. Srikant and R. Agrawarl"
-, title =	"High-dimensional similarity joins"
-, booktitle =	"Proc. 13th IEEE Internat. Conf. Data Eng."
-, year =	1997
-, pages =	"301--311"
-, update =	"97.07 agarwal"
+, author =      "K. Shim and R. Srikant and R. Agrawarl"
+, title =       "High-dimensional similarity joins"
+, booktitle =   "Proc. 13th IEEE Internat. Conf. Data Eng."
+, year =        1997
+, pages =       "301--311"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{sg-cmpbf-92
-, author =	"K. Shimada and D. C. Gossard"
-, title =	"Computational methods for physically-based {FE} mesh generation"
-, booktitle =	"Proc. IFIP/TC5/WG5.3 8th Internat. Conf. PROLAMAT"
-, site =	"Tokyo, Japan"
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "K. Shimada and D. C. Gossard"
+, title =       "Computational methods for physically-based {FE} mesh generation"
+, booktitle =   "Proc. IFIP/TC5/WG5.3 8th Internat. Conf. PROLAMAT"
+, site =        "Tokyo, Japan"
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @article{s-a112p-62
-, author =	"M. Shimrat"
-, title =	"Algorithm 112: position of point relative to polygon"
-, journal =	"Commun. ACM"
-, volume =	5
-, year =	1962
-, pages =	434
+, author =      "M. Shimrat"
+, title =       "Algorithm 112: position of point relative to polygon"
+, journal =     "Commun. ACM"
+, volume =      5
+, year =        1962
+, pages =       434
 }
 
 @article{skc-aeasl-00
-, author =	"C.-S. Shin and S. K. Kim and K.-Y. Chwa"
-, title =	"Area-efficient algorithms for straight-line tree drawings"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	15
-, year =	2000
-, pages =	"175--202"
-, succeeds =	"skc-aeaus-96"
-, update =	"00.03 smid"
+, author =      "C.-S. Shin and S. K. Kim and K.-Y. Chwa"
+, title =       "Area-efficient algorithms for straight-line tree drawings"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      15
+, year =        2000
+, pages =       "175--202"
+, succeeds =    "skc-aeaus-96"
+, update =      "00.03 smid"
 }
 
 @inproceedings{skc-aeaus-96
-, author =	"C.-S. Shin and S. K. Kim and K.-Y. Chwa"
-, title =	"Area-Efficient Algorithms for Upward Straight-Line Tree Drawings"
-, booktitle =	"Proc. 2nd Ann. Internat. Conf. Computing and Combinatorics"
-, nickname =	"COCOON '96"
-, site =	"Hong Kong"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1090
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"106--116"
-, keywords =	"graph drawing, tree drawing, straight line drawing"
-, precedes =	"skc-aeasl-00"
-, update =	"00.03 smid, 99.11 bibrelex, 97.11 shin"
-, abstract =	"The presented algorithm produces an upward, straight-line
+, author =      "C.-S. Shin and S. K. Kim and K.-Y. Chwa"
+, title =       "Area-Efficient Algorithms for Upward Straight-Line Tree Drawings"
+, booktitle =   "Proc. 2nd Ann. Internat. Conf. Computing and Combinatorics"
+, nickname =    "COCOON '96"
+, site =        "Hong Kong"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1090
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "106--116"
+, keywords =    "graph drawing, tree drawing, straight line drawing"
+, precedes =    "skc-aeasl-00"
+, update =      "00.03 smid, 99.11 bibrelex, 97.11 shin"
+, abstract =    "The presented algorithm produces an upward, straight-line
                  tree drawing whose area is $O(n\log \log n)$.
                  Several related tree drawing problems are considered."
 }
 
 @inproceedings{sss-tdczr-86
-, author =	"H. Shin and A. L. Sangiovanni-Vincentelli and C. H. S{\'e}quin"
-, title =	"Two dimensional compaction by 'zone refining'"
-, booktitle =	"Proc. 23rd Design Autom. Conf."
-, year =	1986
-, pages =	"115--122"
-, update =	"98.03 bibrelex"
+, author =      "H. Shin and A. L. Sangiovanni-Vincentelli and C. H. S{\'e}quin"
+, title =       "Two dimensional compaction by 'zone refining'"
+, booktitle =   "Proc. 23rd Design Autom. Conf."
+, year =        1986
+, pages =       "115--122"
+, update =      "98.03 bibrelex"
 }
 
 @article{sm-mtcrm-85
-, author =	"K. G. Shin and N. D. McKay"
-, title =	"Minimum-time control of robotic manipulators with geometric path constraints"
-, journal =	"IEEE Trans. Autom. Control"
-, volume =	"AC-30"
-, month =	jun
-, year =	1985
-, pages =	"531--541"
-, update =	"97.11 bibrelex"
+, author =      "K. G. Shin and N. D. McKay"
+, title =       "Minimum-time control of robotic manipulators with geometric path constraints"
+, journal =     "IEEE Trans. Autom. Control"
+, volume =      "AC-30"
+, month =       jun
+, year =        1985
+, pages =       "531--541"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-paipp-93
-, author =	"S. Y. Shin"
-, title =	"A predictive algorithm for intersecting parametric polynomial surfaces"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"203--219"
-, keywords =	"computer graphics, parametric surfaces, ray-patch intersection algorithms"
-, update =	"96.09 devillers"
+, author =      "S. Y. Shin"
+, title =       "A predictive algorithm for intersecting parametric polynomial surfaces"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "203--219"
+, keywords =    "computer graphics, parametric surfaces, ray-patch intersection algorithms"
+, update =      "96.09 devillers"
 }
 
 @article{sw-fchsp-86
-, author =	"S. Y. Shin and T. C. Woo"
-, title =	"Finding the convex hull of a simple polygon in linear time"
-, journal =	"Pattern Recogn."
-, volume =	19
-, year =	1986
-, pages =	"453--458"
+, author =      "S. Y. Shin and T. C. Woo"
+, title =       "Finding the convex hull of a simple polygon in linear time"
+, journal =     "Pattern Recogn."
+, volume =      19
+, year =        1986
+, pages =       "453--458"
 }
 
 @article{sk-crgac-91
-, author =	"Y. Shinagawa and T. L. Kunii"
-, title =	"Constructing a {Reeb} graph automatically from cross sections"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	11
-, month =	nov
-, year =	1991
-, pages =	"44--51"
-, update =	"98.07 bibrelex"
+, author =      "Y. Shinagawa and T. L. Kunii"
+, title =       "Constructing a {Reeb} graph automatically from cross sections"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      11
+, month =       nov
+, year =        1991
+, pages =       "44--51"
+, update =      "98.07 bibrelex"
 }
 
 @article{skk-scbmt-91
-, author =	"Y. Shinagawa and T. L. Kunii and Y. L. Kergosien"
-, title =	"Surface coding based on morse theory"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	11
-, month =	sep
-, year =	1991
-, pages =	"66--78"
-, update =	"98.07 bibrelex"
+, author =      "Y. Shinagawa and T. L. Kunii and Y. L. Kergosien"
+, title =       "Surface coding based on morse theory"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      11
+, month =       sep
+, year =        1991
+, pages =       "66--78"
+, update =      "98.07 bibrelex"
 }
 
 @article{sf-loogp-95
-, author =	"M. Shinya and M.-C. Forgue"
-, title =	"Laying Out Objects with Geometric and Physical Constraints"
-, journal =	"Visual Comput."
-, volume =	11
-, number =	4
-, year =	1995
-, pages =	"188--201"
-, update =	"96.01 held"
+, author =      "M. Shinya and M.-C. Forgue"
+, title =       "Laying Out Objects with Geometric and Physical Constraints"
+, journal =     "Visual Comput."
+, volume =      11
+, number =      4
+, year =        1995
+, pages =       "188--201"
+, update =      "96.01 held"
 }
 
 @inproceedings{s-dqmsd-91
-, author =	"P. Shirley"
-, title =	"Discrepancy as a Quality Measure for Sample Distributions"
-, editor =	"F. H. Post and W. Barth"
-, booktitle =	"Proc. Eurographics '91"
-, publisher =	"Elsevier Science"
-, address =	"Vienna, Austria"
-, month =	sep
-, year =	1991
-, pages =	"183--194"
-, update =	"93.09 held"
+, author =      "P. Shirley"
+, title =       "Discrepancy as a Quality Measure for Sample Distributions"
+, editor =      "F. H. Post and W. Barth"
+, booktitle =   "Proc. Eurographics '91"
+, publisher =   "Elsevier Science"
+, address =     "Vienna, Austria"
+, month =       sep
+, year =        1991
+, pages =       "183--194"
+, update =      "93.09 held"
 }
 
 @inproceedings{st-padsc-90
-, author =	"P. Shirley and A. Tuchman"
-, title =	"A Polygonal Approximation to Direct Scalar Volume Rendering"
-, booktitle =	"San Diego Workshop on Volume Visualization"
-, series =	"Comput. Gr"
-, volume =	24
-, month =	dec
-, year =	1990
-, pages =	"63--70"
-, update =	"98.07 bibrelex"
+, author =      "P. Shirley and A. Tuchman"
+, title =       "A Polygonal Approximation to Direct Scalar Volume Rendering"
+, booktitle =   "San Diego Workshop on Volume Visualization"
+, series =      "Comput. Gr"
+, volume =      24
+, month =       dec
+, year =        1990
+, pages =       "63--70"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{sta-aaflp-97
-, author =	"D. Shmoys and E. Tardos and K. Aardel"
-, title =	"Approximation algorithms for facility location problems"
-, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
-, year =	1997
-, pages =	"265--274"
-, update =	"98.07 agarwal"
+, author =      "D. Shmoys and E. Tardos and K. Aardel"
+, title =       "Approximation algorithms for facility location problems"
+, booktitle =   "Proc. 29th Annu. ACM Sympos. Theory Comput."
+, year =        1997
+, pages =       "265--274"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{st-gigaa-97
-, author =	"M. Shneerson and A. Tal"
-, title =	"GASP-II: A geometric algorithm animation system for an electronic classroom"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"379--381"
-, cites =	"bclt-aawww-96, b-aa-87, b-zsaam-92a, bn-catwb-96, bs-taa-85, ekkmns-wcg-94, mn-lledt-89, s-raplg-91, s-tfsaa-90, td-vga-95, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "M. Shneerson and A. Tal"
+, title =       "GASP-II: A geometric algorithm animation system for an electronic classroom"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "379--381"
+, cites =       "bclt-aawww-96, b-aa-87, b-zsaam-92a, bn-catwb-96, bs-taa-85, ekkmns-wcg-94, mn-lledt-89, s-raplg-91, s-tfsaa-90, td-vga-95, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @article{s-rciem-77
-, author =	"B. Shneiderman"
-, title =	"Reduced combined indexes for efficient multiple attribute retrieval"
-, journal =	"Inform. Syst."
-, volume =	2
-, year =	1977
-, pages =	"149--154"
+, author =      "B. Shneiderman"
+, title =       "Reduced combined indexes for efficient multiple attribute retrieval"
+, journal =     "Inform. Syst."
+, volume =      2
+, year =        1977
+, pages =       "149--154"
 }
 
 @article{s-cgpuq-81
-, author =	"M. Shneier"
-, title =	"Calculations of geometric properties using quadtrees"
-, journal =	"Comput. Graph. Image Process."
-, volume =	16
-, year =	1981
-, pages =	"296--302"
+, author =      "M. Shneier"
+, title =       "Calculations of geometric properties using quadtrees"
+, journal =     "Comput. Graph. Image Process."
+, volume =      16
+, year =        1981
+, pages =       "296--302"
 }
 
 @article{s-pldtq-81
-, author =	"M. Shneier"
-, title =	"Path length distance transform for quadtrees"
-, journal =	"Inform. Sci."
-, volume =	23
-, year =	1981
-, pages =	"45--67"
+, author =      "M. Shneier"
+, title =       "Path length distance transform for quadtrees"
+, journal =     "Inform. Sci."
+, volume =      23
+, year =        1981
+, pages =       "45--67"
 }
 
 @article{s-thlfr-81
-, author =	"M. Shneier"
-, title =	"Two hierarchical linear feature representations: edge pyramids and edge quadtrees"
-, journal =	"Comput. Graph. Image Process."
-, volume =	17
-, year =	1981
-, pages =	"211--224"
+, author =      "M. Shneier"
+, title =       "Two hierarchical linear feature representations: edge pyramids and edge quadtrees"
+, journal =     "Comput. Graph. Image Process."
+, volume =      17
+, year =        1981
+, pages =       "211--224"
 }
 
 @inproceedings{s-updlt-79
-, author =	"M. Shneier"
-, title =	"Using pyramids to define local thresholds for blob detection"
-, booktitle =	"Proc. DARPA Image Understanding Workshop"
-, year =	1979
-, pages =	"31--35"
+, author =      "M. Shneier"
+, title =       "Using pyramids to define local thresholds for blob detection"
+, booktitle =   "Proc. DARPA Image Understanding Workshop"
+, year =        1979
+, pages =       "31--35"
 }
 
 @incollection{s-arc-94
-, author =	"Ken Shoemake"
-, title =	"Arcball Rotation Control"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"175--192"
-, keywords =	"interaction, quaternion"
-, update =	"94.09 heckbert"
-, annote =	"Asks the question: how does one control the three degrees
+, author =      "Ken Shoemake"
+, title =       "Arcball Rotation Control"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "175--192"
+, keywords =    "interaction, quaternion"
+, update =      "94.09 heckbert"
+, annote =      "Asks the question: how does one control the three degrees
 of freedom of rotation in 3D, using a 2D input device such as a mouse?
 Shoemake's answer: use a pair of points to designate a relative rotation,
 and use quaternions to make the rotation axis specification intuitive and
@@ -133044,17 +133044,17 @@ @incollection{s-arc-94
 }
 
 @incollection{s-eac-94
-, author =	"Ken Shoemake"
-, title =	"Euler Angle Conversion"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"222--229"
-, keywords =	"quaternion, rotation"
-, update =	"94.09 heckbert"
-, annote =	"Gives code to convert a rotation expressed by one triple
+, author =      "Ken Shoemake"
+, title =       "Euler Angle Conversion"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "222--229"
+, keywords =    "quaternion, rotation"
+, update =      "94.09 heckbert"
+, annote =      "Gives code to convert a rotation expressed by one triple
 of axes into another triple. Rotations in 3D are often described in terms of
 Euler angles: rotations about x, y, and z in some order. The order of
 rotations is significant, but not standardized. These routines are useful
@@ -133062,199 +133062,199 @@ @incollection{s-eac-94
 }
 
 @incollection{s-fbtr-94
-, author =	"Ken Shoemake"
-, title =	"Fiber Bundle Twist Reduction"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"230--236"
-, keywords =	"animation, camera control, quaternion, topology, rotation"
-, update =	"94.09 heckbert"
-, annote =	"Applies some advanced concepts from topology to the
+, author =      "Ken Shoemake"
+, title =       "Fiber Bundle Twist Reduction"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "230--236"
+, keywords =    "animation, camera control, quaternion, topology, rotation"
+, update =      "94.09 heckbert"
+, annote =      "Applies some advanced concepts from topology to the
 problem of minimizing twist (rotation about the z axis of screen space) in
 animation."
 }
 
 @incollection{s-pmd-94
-, author =	"Ken Shoemake"
-, title =	"Polar Matrix Decomposition"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"207--221"
-, keywords =	"quaternion, spectral decomposition, singular value decomposition"
-, update =	"94.09 heckbert"
-, annote =	"Describes a method for decomposing an affine 3D
+, author =      "Ken Shoemake"
+, title =       "Polar Matrix Decomposition"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "207--221"
+, keywords =    "quaternion, spectral decomposition, singular value decomposition"
+, update =      "94.09 heckbert"
+, annote =      "Describes a method for decomposing an affine 3D
 transformation into translation, scaling, and rotation transformations in a
 physically meaningful way. This can be useful for keyframe animation.
 Contains C code."
 }
 
 @incollection{s-urr-92
-, author =	"K. Shoemake"
-, title =	"Uniform random rotations"
-, editor =	"D. Kirk"
-, booktitle =	"Graphics Gems III"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1992
-, pages =	"124--132"
-, update =	"97.07 orourke"
+, author =      "K. Shoemake"
+, title =       "Uniform random rotations"
+, editor =      "D. Kirk"
+, booktitle =   "Graphics Gems III"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1992
+, pages =       "124--132"
+, update =      "97.07 orourke"
 }
 
 @article{sbk-mdusd-92
-, author =	"B. K. Shoichet and D. L. Bodian and I. D. Kuntz"
-, title =	"Molecular docking using shape descriptors"
-, journal =	"J. Computational Chemistry"
-, volume =	13
-, year =	1992
-, pages =	"380--397"
-, update =	"97.07 agarwal"
+, author =      "B. K. Shoichet and D. L. Bodian and I. D. Kuntz"
+, title =       "Molecular docking using shape descriptors"
+, journal =     "J. Computational Chemistry"
+, volume =      13
+, year =        1992
+, pages =       "380--397"
+, update =      "97.07 agarwal"
 }
 
 @unpublished{s-grsds-90
-, author =	"P. Shor"
-, title =	"Geometric realization of superlinear {Davenport--Schinzel} sequences: I. {L}ine segments"
-, year =	1990
-, note =	"Unpublished manuscript"
-, update =	"95.09 agarwal"
+, author =      "P. Shor"
+, title =       "Geometric realization of superlinear {Davenport--Schinzel} sequences: I. {L}ine segments"
+, year =        1990
+, note =        "Unpublished manuscript"
+, update =      "95.09 agarwal"
 }
 
 @phdthesis{s-rpmbp-85
-, author =	"P. W. Shor"
-, title =	"Random planar matching and bin packing"
-, school =	"Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "P. W. Shor"
+, title =       "Random planar matching and bin packing"
+, school =      "Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{s-spinh-91
-, author =	"P. W. Shor"
-, title =	"Stretchability of Pseudolines is {NP}-Hard"
-, editor =	"P. Gritzman and B. Sturmfels"
-, booktitle =	"Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
-, series =	"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
-, volume =	4
-, publisher =	"AMS Press"
-, year =	1991
-, pages =	"531--554"
-, keywords =	"pseudolines, stretchability, NP-hard, isotopy conjecture"
-, comments =	"includes description of Mn{\"e}v's proof that any semialgebraic set is homotopy-equivalent to the realization space of some configuration of pseudolines"
-, update =	"98.07 agarwal, 93.09 erickson"
+, author =      "P. W. Shor"
+, title =       "Stretchability of Pseudolines is {NP}-Hard"
+, editor =      "P. Gritzman and B. Sturmfels"
+, booktitle =   "Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift"
+, series =      "DIMACS Series in Discrete Mathematics and Theoretical Computer Science"
+, volume =      4
+, publisher =   "AMS Press"
+, year =        1991
+, pages =       "531--554"
+, keywords =    "pseudolines, stretchability, NP-hard, isotopy conjecture"
+, comments =    "includes description of Mn{\"e}v's proof that any semialgebraic set is homotopy-equivalent to the realization space of some configuration of pseudolines"
+, update =      "98.07 agarwal, 93.09 erickson"
 }
 
 @article{ss-fopgm-97
-, author =	"P. W. Shor and N. J. A. Sloane"
-, title =	"A family of optimal packings in {Grassmannian} manifolds"
-, journal =	"J. Algebraic Combin."
-, volume =	"??"
-, year =	1997
-, note =	"To appear."
-, update =	"97.07 orourke"
+, author =      "P. W. Shor and N. J. A. Sloane"
+, title =       "A family of optimal packings in {Grassmannian} manifolds"
+, journal =     "J. Algebraic Combin."
+, volume =      "??"
+, year =        1997
+, note =        "To appear."
+, update =      "97.07 orourke"
 }
 
 @inproceedings{sv-ddsoc-89
-, author =	"P. W. Shor and C. J. {Van Wyk}"
-, title =	"Detecting and decomposing self-overlapping curves"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"44--50"
-, precedes =	"sv-ddsoc-92"
-, cites =	"a-ca-66, ce-oails-88, fpp-sssfe-88, ll-gdtpg-86, ns-issip-80, rt-rplbo-86, w-rccp-37, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "P. W. Shor and C. J. {Van Wyk}"
+, title =       "Detecting and decomposing self-overlapping curves"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "44--50"
+, precedes =    "sv-ddsoc-92"
+, cites =       "a-ca-66, ce-oails-88, fpp-sssfe-88, ll-gdtpg-86, ns-issip-80, rt-rplbo-86, w-rccp-37, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{sv-ddsoc-92
-, author =	"P. W. Shor and C. J. {Van Wyk}"
-, title =	"Detecting and decomposing self-overlapping curves"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	1
-, year =	1992
-, pages =	"31--50"
-, keywords =	"computational topology, constrained Delaunay triangulation, dynamic programming, immersions"
-, succeeds =	"sv-ddsoc-89"
+, author =      "P. W. Shor and C. J. {Van Wyk}"
+, title =       "Detecting and decomposing self-overlapping curves"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      1
+, year =        1992
+, pages =       "31--50"
+, keywords =    "computational topology, constrained Delaunay triangulation, dynamic programming, immersions"
+, succeeds =    "sv-ddsoc-89"
 }
 
 @inproceedings{s-osdsd-97
-, author =	"A. Shoshani"
-, title =	"{OLAP} and Statistical databases: {S}imilarities and differences"
-, booktitle =	"Proc. Annu. ACM Sympos. Principles Database Syst."
-, year =	1997
-, pages =	"185--196"
-, update =	"97.07 agarwal"
+, author =      "A. Shoshani"
+, title =       "{OLAP} and Statistical databases: {S}imilarities and differences"
+, booktitle =   "Proc. Annu. ACM Sympos. Principles Database Syst."
+, year =        1997
+, pages =       "185--196"
+, update =      "97.07 agarwal"
 }
 
 @article{sl-qcia-87
-, author =	"L. Shu-Xiang and M. H. Loew"
-, title =	"The quad-codes and its applications"
-, journal =	"Commun. ACM"
-, volume =	30
-, year =	1987
-, pages =	"621--625"
-, update =	"98.07 bibrelex"
+, author =      "L. Shu-Xiang and M. H. Loew"
+, title =       "The quad-codes and its applications"
+, journal =     "Commun. ACM"
+, volume =      30
+, year =        1987
+, pages =       "621--625"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-rgrsm-90
-, author =	"G. M. Shute"
-, title =	"A reduced grid for rectilinear {Steiner} minimal trees"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"309--314"
-, precedes =	"s-rgrsm-91"
-, cites =	"b-tprrs-86, ce-lsdst-86, gj-rstpi-77, h-sprd-66, h-smtrd-76, tds-crsmt-87, w-ndsor-85, yw-ossaw-72, ZZZ"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "G. M. Shute"
+, title =       "A reduced grid for rectilinear {Steiner} minimal trees"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "309--314"
+, precedes =    "s-rgrsm-91"
+, cites =       "b-tprrs-86, ce-lsdst-86, gj-rstpi-77, h-sprd-66, h-smtrd-76, tds-crsmt-87, w-ndsor-85, yw-ossaw-72, ZZZ"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{s-rgrsm-91
-, author =	"G. M. Shute"
-, title =	"A reduced grid for rectilinear {Steiner} minimal trees"
-, type =	"Technical Report"
-, institution =	"Comput. Sci. Dept., Univ. of Minnesota"
-, year =	1991
-, succeeds =	"s-rgrsm-90"
-, update =	"98.11 bibrelex"
+, author =      "G. M. Shute"
+, title =       "A reduced grid for rectilinear {Steiner} minimal trees"
+, type =        "Technical Report"
+, institution = "Comput. Sci. Dept., Univ. of Minnesota"
+, year =        1991
+, succeeds =    "s-rgrsm-90"
+, update =      "98.11 bibrelex"
 }
 
 @article{sdt-opsal-91
-, author =	"G. M. Shute and L. L. Deneen and C. D. Thomborson"
-, title =	"An {$O(n \log n)$} plane-sweep algorithm for {$L_{1}$} and {$L_{\infty}$} {Delaunay} triangulations"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"207--221"
+, author =      "G. M. Shute and L. L. Deneen and C. D. Thomborson"
+, title =       "An {$O(n \log n)$} plane-sweep algorithm for {$L_{1}$} and {$L_{\infty}$} {Delaunay} triangulations"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "207--221"
 }
 
 @incollection{s-bdnni-81
-, author =	"R. Sibson"
-, title =	"A Brief Description of Natural Neighbour Interpolation"
-, editor =	"Vic Barnet"
-, booktitle =	"Interpreting Multivariate Data"
-, publisher =	"John Wiley \& Sons"
-, address =	"Chichester"
-, year =	1981
-, pages =	"21--36"
-, update =	"99.11 bibrelex"
-, annote =	"Weights for an interpolant at a point $p$ can be found
-		 by considering what fraction of the area of $VP(p)$ is
-		 taken from the $VP$ for $p_1,p_2,\dots,p_n$."
+, author =      "R. Sibson"
+, title =       "A Brief Description of Natural Neighbour Interpolation"
+, editor =      "Vic Barnet"
+, booktitle =   "Interpreting Multivariate Data"
+, publisher =   "John Wiley \& Sons"
+, address =     "Chichester"
+, year =        1981
+, pages =       "21--36"
+, update =      "99.11 bibrelex"
+, annote =      "Weights for an interpolant at a point $p$ can be found
+                 by considering what fraction of the area of $VP(p)$ is
+                 taken from the $VP$ for $p_1,p_2,\dots,p_n$."
 }
 
 @article{s-vidt-80
-, author =	"R. Sibson"
-, title =	"A vector identity for the {Dirichlet} Tessellation"
-, journal =	"Math. Proc. Camb. Phil. Soc."
-, volume =	87
-, year =	1980
-, pages =	"151--155"
-, update =	"98.07 rote"
-, abstract =	"Take away a site $p$ from a Voronoi diagram, and for every
+, author =      "R. Sibson"
+, title =       "A vector identity for the {Dirichlet} Tessellation"
+, journal =     "Math. Proc. Camb. Phil. Soc."
+, volume =      87
+, year =        1980
+, pages =       "151--155"
+, update =      "98.07 rote"
+, abstract =    "Take away a site $p$ from a Voronoi diagram, and for every
                  other site $q$, let $w_q$ be the fraction of $p$'s cell that
                  is taken by the cell of $q$. Then $p$ is the weighted average
                  (centroid) of the other sites $q$ with weights $w_q$.
@@ -133265,4086 +133265,4086 @@ @article{s-vidt-80
 }
 
 @article{s-let-78
-, author =	"R. Sibson"
-, title =	"Locally equiangular triangulations"
-, journal =	"Comput. J."
-, volume =	21
-, number =	3
-, year =	1978
-, pages =	"243--245"
-, keywords =	"point-set triangulation"
-, update =	"98.11 bibrelex"
-, annote =	"``Lawson has given a criterion of local equiangularity
-		 of the convex hull of a finite set of distinct points
-		 in the plane. In this note it is shown that (with
-		 suitable modifications to deal with degeneracy) there
-		 is only one such triangulation, and that it is the
-		 Delaunay triangulation.''"
+, author =      "R. Sibson"
+, title =       "Locally equiangular triangulations"
+, journal =     "Comput. J."
+, volume =      21
+, number =      3
+, year =        1978
+, pages =       "243--245"
+, keywords =    "point-set triangulation"
+, update =      "98.11 bibrelex"
+, annote =      "``Lawson has given a criterion of local equiangularity
+                 of the convex hull of a finite set of distinct points
+                 in the plane. In this note it is shown that (with
+                 suitable modifications to deal with degeneracy) there
+                 is only one such triangulation, and that it is the
+                 Delaunay triangulation.''"
 }
 
 @article{s-dtada-80
-, author =	"R. Sibson"
-, title =	"The {Dirichlet} Tessellation as an aid in data analysis"
-, journal =	"Scand. J. Statist."
-, volume =	7
-, year =	1980
-, pages =	"14--20"
+, author =      "R. Sibson"
+, title =       "The {Dirichlet} Tessellation as an aid in data analysis"
+, journal =     "Scand. J. Statist."
+, volume =      7
+, year =        1980
+, pages =       "14--20"
 }
 
 @article{sd-sggrr-88
-, author =	"A. Siegel and D. Dolev"
-, title =	"Some geometry for general river routing"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, year =	1988
-, pages =	"583--605"
+, author =      "A. Siegel and D. Dolev"
+, title =       "Some geometry for general river routing"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, year =        1988
+, pages =       "583--605"
 }
 
 @article{s-rrurm-82
-, author =	"A. F. Siegel"
-, title =	"Robust Regression Using Repeated Medians"
-, journal =	"Biometrika"
-, volume =	69
-, year =	1982
-, pages =	"242--244"
-, update =	"98.07 bibrelex"
+, author =      "A. F. Siegel"
+, title =       "Robust Regression Using Repeated Medians"
+, journal =     "Biometrika"
+, volume =      69
+, year =        1982
+, pages =       "242--244"
+, update =      "98.07 bibrelex"
 }
 
 @book{sh-trht-92
-, author =	"R. Siegel and J. R. Howell"
-, title =	"Thermal Radiation Heat Transfer"
-, edition =	"3rd"
-, publisher =	"Hemisphere Pu. Co."
-, address =	"Washington"
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "R. Siegel and J. R. Howell"
+, title =       "Thermal Radiation Heat Transfer"
+, edition =     "3rd"
+, publisher =   "Hemisphere Pu. Co."
+, address =     "Washington"
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @article{s-ecsas-85
-, author =	"G. Sierksma"
-, title =	"Extending a convexity space to an aligned space"
-, journal =	"Indagationes Mathematicae"
-, volume =	46
-, year =	1985
-, pages =	"429--435"
-, update =	"98.07 bibrelex"
+, author =      "G. Sierksma"
+, title =       "Extending a convexity space to an aligned space"
+, journal =     "Indagationes Mathematicae"
+, volume =      46
+, year =        1985
+, pages =       "429--435"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ss-nempa-86
-, author =	"S. Sifrony and Micha Sharir"
-, title =	"A new efficient motion-planning algorithm for a rod in polygonal space"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"178--186"
-, precedes =	"ss-nempa-87"
-, cites =	"bo-arcgi-79, cd-vdbcd-85, f-fapct-85, ks-empac-90, ls-esmpa-85, ls-pptmc-87, ls-ncfcc-87, m-gtd23-77, o-lbml-85, osy-gvdl1-84, osy-gvdl2-84, oy-rmpmd-85, r-cmpg-79, ss-pmp2g-83, ss-pmp3c-83, ss-empae-85, ss-pmp5c-84, sa-pmp4v-84, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "S. Sifrony and Micha Sharir"
+, title =       "A new efficient motion-planning algorithm for a rod in polygonal space"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "178--186"
+, precedes =    "ss-nempa-87"
+, cites =       "bo-arcgi-79, cd-vdbcd-85, f-fapct-85, ks-empac-90, ls-esmpa-85, ls-pptmc-87, ls-ncfcc-87, m-gtd23-77, o-lbml-85, osy-gvdl1-84, osy-gvdl2-84, oy-rmpmd-85, r-cmpg-79, ss-pmp2g-83, ss-pmp3c-83, ss-empae-85, ss-pmp5c-84, sa-pmp4v-84, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @article{ss-nempa-87
-, author =	"S. Sifrony and Micha Sharir"
-, title =	"A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"367--402"
-, keywords =	"motion planning"
-, succeeds =	"ss-nempa-86"
-, update =	"98.03 mitchell"
+, author =      "S. Sifrony and Micha Sharir"
+, title =       "A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "367--402"
+, keywords =    "motion planning"
+, succeeds =    "ss-nempa-86"
+, update =      "98.03 mitchell"
 }
 
 @manual{s-iipg-92
-, author =	"SiliconGraphics"
-, title =	"Iris Inventor Programming Guide"
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "SiliconGraphics"
+, title =       "Iris Inventor Programming Guide"
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @article{s-escae-79
-, author =	"C. B. {Silio, Jr.}"
-, title =	"An efficient simplex coverability algorithm in {$E^{2}$} with applications to stochastic sequential machines"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-28"
-, year =	1979
-, pages =	"109--120"
+, author =      "C. B. {Silio, Jr.}"
+, title =       "An efficient simplex coverability algorithm in {$E^{2}$} with applications to stochastic sequential machines"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-28"
+, year =        1979
+, pages =       "109--120"
 }
 
 @article{s--90
-, author =	"E. Silla"
-, title =	"??"
-, journal =	"J. Mol. Graphics"
-, volume =	8
-, month =	sep
-, year =	1990
-, pages =	"168--172"
-, update =	"98.03 bibrelex"
+, author =      "E. Silla"
+, title =       "??"
+, journal =     "J. Mol. Graphics"
+, volume =      8
+, month =       sep
+, year =        1990
+, pages =       "168--172"
+, update =      "98.03 bibrelex"
 }
 
 @article{sp-gtpmi-89
-, author =	"F. Sillion and C. Puech"
-, title =	"A general two-pass method integrating specular and diffuse reflection"
-, journal =	"Comput. Graph."
-, volume =	23
-, number =	3
-, year =	1989
-, pages =	"335--344"
-, note =	"Proc. SIGGRAPH '89"
-, update =	"98.03 bibrelex"
+, author =      "F. Sillion and C. Puech"
+, title =       "A general two-pass method integrating specular and diffuse reflection"
+, journal =     "Comput. Graph."
+, volume =      23
+, number =      3
+, year =        1989
+, pages =       "335--344"
+, note =        "Proc. SIGGRAPH '89"
+, update =      "98.03 bibrelex"
 }
 
 @book{sp-rgi-94
-, author =	"F. Sillion and C. Puech"
-, title =	"Radiosity Global Illumination"
-, publisher =	"Morgan Kauffmann"
-, year =	1994
-, update =	"96.05 pocchiola"
+, author =      "F. Sillion and C. Puech"
+, title =       "Radiosity Global Illumination"
+, publisher =   "Morgan Kauffmann"
+, year =        1994
+, update =      "96.05 pocchiola"
 }
 
 @article{sgg-rrde-90
-, author =	"F. X. Sillion and D. D. George and D. P. Greenberg"
-, title =	"Radiosity redistribution for dynamic environments"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	10
-, number =	4
-, month =	jul
-, year =	1990
-, pages =	"26--34"
-, update =	"97.11 bibrelex"
+, author =      "F. X. Sillion and D. D. George and D. P. Greenberg"
+, title =       "Radiosity redistribution for dynamic environments"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      10
+, number =      4
+, month =       jul
+, year =        1990
+, pages =       "26--34"
+, update =      "97.11 bibrelex"
 }
 
 @article{sd-fbcve-95
-, author =	"S. X. Sillion and G. Drettakis"
-, title =	"Feature-based control of visibility error: {A} multi-resolution clustering algorithm for global illumination"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1995
-, note =	"Proc. SIGGRAPH '95"
-, update =	"98.07 bibrelex"
+, author =      "S. X. Sillion and G. Drettakis"
+, title =       "Feature-based control of visibility error: {A} multi-resolution clustering algorithm for global illumination"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1995
+, note =        "Proc. SIGGRAPH '95"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{smk-agtin-95
-, author =	"C. Silva and Joseph S. B. Mitchell and A. E. Kaufman"
-, title =	"Automatic generation of triangular irregular networks using greedy cuts"
-, booktitle =	"Visualization 95"
-, publisher =	"IEEE Computer Society Press"
-, address =	"San Jose CA"
-, year =	1995
-, pages =	"201--208"
-, update =	"98.03 mitchell, 96.01 mitchell"
+, author =      "C. Silva and Joseph S. B. Mitchell and A. E. Kaufman"
+, title =       "Automatic generation of triangular irregular networks using greedy cuts"
+, booktitle =   "Visualization 95"
+, publisher =   "IEEE Computer Society Press"
+, address =     "San Jose CA"
+, year =        1995
+, pages =       "201--208"
+, update =      "98.03 mitchell, 96.01 mitchell"
 }
 
 @techreport{s-adfbr-81
-, author =	"C. E. Silva"
-, title =	"Alternative definitions of faces in boundary representations of solid objects"
-, type =	"Report"
-, number =	"TM-36"
-, institution =	"College Engrg. Appl. Sci., Univ. Rochester"
-, address =	"Rochester, NY"
-, year =	1981
+, author =      "C. E. Silva"
+, title =       "Alternative definitions of faces in boundary representations of solid objects"
+, type =        "Report"
+, number =      "TM-36"
+, institution = "College Engrg. Appl. Sci., Univ. Rochester"
+, address =     "Rochester, NY"
+, year =        1981
 }
 
 @inproceedings{sm-gcaft-98
-, author =	"Cl\'{a}udio T. Silva and Joseph S. B. Mitchell"
-, title =	"Greedy Cuts: {An} Advancing Front Terrain Triangulation Algorithm"
-, booktitle =	"Proc. 6th ACM Workshop on Advances in GIS"
-, year =	1998
-, pages =	"to appear"
-, update =	"98.07 mitchell"
+, author =      "Cl\'{a}udio T. Silva and Joseph S. B. Mitchell"
+, title =       "Greedy Cuts: {An} Advancing Front Terrain Triangulation Algorithm"
+, booktitle =   "Proc. 6th ACM Workshop on Advances in GIS"
+, year =        1998
+, pages =       "to appear"
+, update =      "98.07 mitchell"
 }
 
 @article{sm-lsrca-97
-, author =	"C. T. Silva and Joseph S. B. Mitchell"
-, title =	"The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	3
-, number =	2
-, month =	apr
-, year =	1997
-, pages =	"142--157"
-, keywords =	"plane sweep, space sweep, ray shooting, volume visualization, graphics"
-, succeeds =	"smk-frig-96"
-, update =	"98.03 mitchell, 97.07 held"
-, annote =	"special issue devoted to selected papers from Volume Visualization'96"
+, author =      "C. T. Silva and Joseph S. B. Mitchell"
+, title =       "The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      3
+, number =      2
+, month =       apr
+, year =        1997
+, pages =       "142--157"
+, keywords =    "plane sweep, space sweep, ray shooting, volume visualization, graphics"
+, succeeds =    "smk-frig-96"
+, update =      "98.03 mitchell, 97.07 held"
+, annote =      "special issue devoted to selected papers from Volume Visualization'96"
 }
 
 @inproceedings{smk-frig-96
-, author =	"C. T. Silva and Joseph S. B. Mitchell and A. E. Kaufman"
-, title =	"Fast Rendering of Irregular Grids"
-, booktitle =	"Proc. 1996 Symposium on Volume Visualization"
-, publisher =	"ACM SIGGRAPH"
-, address =	"San Francisco"
-, month =	oct
-, year =	1996
-, pages =	"15--22; 97 (color plate)"
-, keywords =	"plane sweep, space sweep, ray shooting, volume visualization, graphics"
-, precedes =	"sm-lsrca-97"
-, update =	"00.11 smid, 00.07 icking, 98.03 mitchell"
+, author =      "C. T. Silva and Joseph S. B. Mitchell and A. E. Kaufman"
+, title =       "Fast Rendering of Irregular Grids"
+, booktitle =   "Proc. 1996 Symposium on Volume Visualization"
+, publisher =   "ACM SIGGRAPH"
+, address =     "San Francisco"
+, month =       oct
+, year =        1996
+, pages =       "15--22; 97 (color plate)"
+, keywords =    "plane sweep, space sweep, ray shooting, volume visualization, graphics"
+, precedes =    "sm-lsrca-97"
+, update =      "00.11 smid, 00.07 icking, 98.03 mitchell"
 }
 
 @article{s-acars-79
-, author =	"Y. V. {Silva Filho}"
-, title =	"Average case analysis of region search in balanced $k$-d trees"
-, journal =	"Inform. Process. Lett."
-, volume =	8
-, year =	1979
-, pages =	"219--223"
+, author =      "Y. V. {Silva Filho}"
+, title =       "Average case analysis of region search in balanced $k$-d trees"
+, journal =     "Inform. Process. Lett."
+, volume =      8
+, year =        1979
+, pages =       "219--223"
 }
 
 @techreport{s-mstif-78
-, author =	"Y. V. {Silva Filho}"
-, title =	"Multidimensional search trees as indices of files"
-, type =	"Report"
-, number =	"??"
-, institution =	"Univ. Kent"
-, address =	"Canterbury, England"
-, year =	1978
+, author =      "Y. V. {Silva Filho}"
+, title =       "Multidimensional search trees as indices of files"
+, type =        "Report"
+, number =      "??"
+, institution = "Univ. Kent"
+, address =     "Canterbury, England"
+, year =        1978
 }
 
 @article{s-ocdbk-81
-, author =	"Y. V. {Silva Filho}"
-, title =	"Optimal choice of discriminators in a balanced $k$-d binary search tree"
-, journal =	"Inform. Process. Lett."
-, volume =	13
-, year =	1981
-, pages =	"67--70"
+, author =      "Y. V. {Silva Filho}"
+, title =       "Optimal choice of discriminators in a balanced $k$-d binary search tree"
+, journal =     "Inform. Process. Lett."
+, volume =      13
+, year =        1981
+, pages =       "67--70"
 }
 
 @phdthesis{s-ggna-88
-, author =	"D. Silver"
-, title =	"Geometry, Graphics \& Numerical Analysis"
-, school =	"Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1988
-, note =	"In preparation"
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "D. Silver"
+, title =       "Geometry, Graphics \& Numerical Analysis"
+, school =      "Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1988
+, note =        "In preparation"
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{s-mpspp-86
-, author =	"E. B. Silverberg"
-, title =	"Motion planning and shortest paths in the plane"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Oper. Res., Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1986
-, keywords =	"motion planning, path planning, geodesic distance, shortest paths"
+, author =      "E. B. Silverberg"
+, title =       "Motion planning and shortest paths in the plane"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Oper. Res., Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1986
+, keywords =    "motion planning, path planning, geodesic distance, shortest paths"
 }
 
 @techreport{s-sppbt-85
-, author =	"E. B. Silverberg"
-, title =	"Shortest Paths for Polygonal Bodies in Two Dimensions"
-, type =	"Manuscript"
-, institution =	"Dept. of Operations Research, Stanford University"
-, year =	1985
-, update =	"93.09 milone+mitchell"
+, author =      "E. B. Silverberg"
+, title =       "Shortest Paths for Polygonal Bodies in Two Dimensions"
+, type =        "Manuscript"
+, institution = "Dept. of Operations Research, Stanford University"
+, year =        1985
+, update =      "93.09 milone+mitchell"
 }
 
 @article{st-mce-80
-, author =	"B. W. Silverman and D. M. Titterington"
-, title =	"Minimum covering ellipses"
-, journal =	"SIAM J. Sci. Statist. Comput."
-, volume =	1
-, year =	1980
-, pages =	"401--409"
+, author =      "B. W. Silverman and D. M. Titterington"
+, title =       "Minimum covering ellipses"
+, journal =     "SIAM J. Sci. Statist. Comput."
+, volume =      1
+, year =        1980
+, pages =       "401--409"
 }
 
 @book{s-ansfp-90
-, author =	"P. K. Simpson"
-, title =	"Artificial Neural Systems: Foundations, Paradigms, Applications, and Implementations"
-, publisher =	"Pergamon Press"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "P. K. Simpson"
+, title =       "Artificial Neural Systems: Foundations, Paradigms, Applications, and Implementations"
+, publisher =   "Pergamon Press"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @incollection{s-cmspg-70
-, author =	"C. Sims"
-, title =	"Computational Methods in the Study of Permutation Groups"
-, editor =	"J. Leech"
-, booktitle =	"Computational Problems in Abstract Algebra"
-, publisher =	"Pergamon Press"
-, year =	1970
-, update =	"97.11 bibrelex"
+, author =      "C. Sims"
+, title =       "Computational Methods in the Study of Permutation Groups"
+, editor =      "J. Leech"
+, booktitle =   "Computational Problems in Abstract Algebra"
+, publisher =   "Pergamon Press"
+, year =        1970
+, update =      "97.11 bibrelex"
 }
 
 @article{s-evc-94
-, author =	"K. Sims"
-, title =	"Evolving virtual creatures"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1994
-, pages =	"15--22"
-, note =	"Proc. SIGGRAPH '94"
-, update =	"97.11 bibrelex"
+, author =      "K. Sims"
+, title =       "Evolving virtual creatures"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1994
+, pages =       "15--22"
+, note =        "Proc. SIGGRAPH '94"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-parud-90
-, author =	"K. Sims"
-, title =	"Particle animation and rendering using data parallel computation"
-, journal =	"Comput. Graph."
-, volume =	24
-, number =	4
-, year =	1990
-, pages =	"405--413"
-, update =	"98.07 bibrelex"
+, author =      "K. Sims"
+, title =       "Particle animation and rendering using data parallel computation"
+, journal =     "Comput. Graph."
+, volume =      24
+, number =      4
+, year =        1990
+, pages =       "405--413"
+, update =      "98.07 bibrelex"
 }
 
 @book{s-gpf-97
-, author =	"David Singer"
-, title =	"Geometry: Plane and Fancy"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	1997
-, comments =	"Describes Zaremba's proof, sz-clccp-67"
-, update =	"00.11 smid, 00.07 orourke"
+, author =      "David Singer"
+, title =       "Geometry: Plane and Fancy"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        1997
+, comments =    "Describes Zaremba's proof, sz-clccp-67"
+, update =      "00.11 smid, 00.07 orourke"
 }
 
 @article{s-tfpgs-38
-, author =	"J. Singer"
-, title =	"A theorem in finite projective geometry and some applications to number theory"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	43
-, year =	1938
-, note =	"377--385"
-, update =	"98.03 bibrelex"
+, author =      "J. Singer"
+, title =       "A theorem in finite projective geometry and some applications to number theory"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      43
+, year =        1938
+, note =        "377--385"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{s-dpg-91
-, author =	"S. Singh"
-, title =	"Documentation for {Paren-to-GDS}"
-, type =	"Manuscript"
-, institution =	"Dept. of Comp. Sci., Brown University"
-, year =	1991
-, keywords =	"graph drawing"
-, update =	"96.09 tamassia"
+, author =      "S. Singh"
+, title =       "Documentation for {Paren-to-GDS}"
+, type =        "Manuscript"
+, institution = "Dept. of Comp. Sci., Brown University"
+, year =        1991
+, keywords =    "graph drawing"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{skw-etgps-85
-, author =	"P. Sinha and E. Klassen and K. K. Wang"
-, title =	"Exploiting topological and geometric properties for selective subdivision"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"39--45"
-, cites =	"b-cbs-72, clr-dbsst-80, lr-tdcgd-80, mk-impgo-84, p-afilb-84, gp-dt-74, l-padps-76, v-ssidq-, -rpmv4-82, -t1-78, gl-mc-83, k-smrra-, c-sacdc-74, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "P. Sinha and E. Klassen and K. K. Wang"
+, title =       "Exploiting topological and geometric properties for selective subdivision"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "39--45"
+, cites =       "b-cbs-72, clr-dbsst-80, lr-tdcgd-80, mk-impgo-84, p-afilb-84, gp-dt-74, l-padps-76, v-ssidq-, -rpmv4-82, -t1-78, gl-mc-83, k-smrra-, c-sacdc-74, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{sc-aipta-86
-, author =	"J. K. Sircar and J. A. Cerbrian"
-, title =	"Application of image processing techniques to the automated labelling of raster digitized contours"
-, booktitle =	"Proc. 2nd Internat. Sympos. Spatial Data Handling"
-, year =	1986
-, pages =	"171--184"
-, update =	"98.07 bibrelex"
+, author =      "J. K. Sircar and J. A. Cerbrian"
+, title =       "Application of image processing techniques to the automated labelling of raster digitized contours"
+, booktitle =   "Proc. 2nd Internat. Sympos. Spatial Data Handling"
+, year =        1986
+, pages =       "171--184"
+, update =      "98.07 bibrelex"
 }
 
 @article{sc-rss-91
-, author =	"A. Sirjani and G. Cross"
-, title =	"On representation of a shape's skeleton"
-, journal =	"Pattern Recogn. Lett."
-, volume =	12
-, year =	1991
-, pages =	"149--154"
-, update =	"93.09 milone+mitchell"
+, author =      "A. Sirjani and G. Cross"
+, title =       "On representation of a shape's skeleton"
+, journal =     "Pattern Recogn. Lett."
+, volume =      12
+, year =        1991
+, pages =       "149--154"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{sw-tcica-95
-, author =	"A. Prasad Sistla and Ouri Wolfson"
-, title =	"Temporal Conditions and Integrity Constraints in Active Database Systems"
-, booktitle =	"Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data"
-, year =	1995
-, pages =	"269--280"
-, update =	"00.03 agarwal"
+, author =      "A. Prasad Sistla and Ouri Wolfson"
+, title =       "Temporal Conditions and Integrity Constraints in Active Database Systems"
+, booktitle =   "Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data"
+, year =        1995
+, pages =       "269--280"
+, update =      "00.03 agarwal"
 }
 
 @inproceedings{swcd-mqmo-97
-, author =	"A. P. Sistla and O. Wolfson and S. Chamberlain and S. Dao"
-, title =	"Modeling and querying moving objects"
-, booktitle =	"Proc. Intl Conf. Data Engineering"
-, year =	1997
-, pages =	"422--432"
-, update =	"00.03 agarwal"
+, author =      "A. P. Sistla and O. Wolfson and S. Chamberlain and S. Dao"
+, title =       "Modeling and querying moving objects"
+, booktitle =   "Proc. Intl Conf. Data Engineering"
+, year =        1997
+, pages =       "422--432"
+, update =      "00.03 agarwal"
 }
 
 @misc{sr-pps-97
-, author =	"Valeriu Sitaru and Tony Ruso"
-, title =	"Polygonizations of Point Sets"
-, howpublished =	"McGill University, School of Computer Science, http://www.CS.McGill.CA/$\sim$ktulu/507/"
-, year =	1997
-, url =	"http://www.CS.McGill.CA/~ktulu/507/"
-, update =	"00.03 bibrelex"
+, author =      "Valeriu Sitaru and Tony Ruso"
+, title =       "Polygonizations of Point Sets"
+, howpublished =        "McGill University, School of Computer Science, http://www.CS.McGill.CA/$\sim$ktulu/507/"
+, year =        1997
+, url = "http://www.CS.McGill.CA/~ktulu/507/"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{ss-acqsm-92
-, author =	"R. Sivan and H. Samet"
-, title =	"Algorithms for constructing quadtree surface maps"
-, booktitle =	"Proceedings of the fifth international symposium on spatial data handling"
-, site =	"Charleston, South Carolina"
-, volume =	1
-, month =	aug
-, year =	1992
-, pages =	"361--370"
-, update =	"96.05 efrat"
+, author =      "R. Sivan and H. Samet"
+, title =       "Algorithms for constructing quadtree surface maps"
+, booktitle =   "Proceedings of the fifth international symposium on spatial data handling"
+, site =        "Charleston, South Carolina"
+, volume =      1
+, month =       aug
+, year =        1992
+, pages =       "361--370"
+, update =      "96.05 efrat"
 }
 
 @inproceedings{sem-vainn-86
-, author =	"M. Sivilotti and M. Emerling and C. Mead"
-, title =	"VLSI architectures for implementation of neural networks"
-, editor =	"J. Denker"
-, booktitle =	"Proc. AIP Conference: Neural Networks for Computing"
-, site =	"New York, NY"
-, volume =	151
-, organization =	"American Institute of Physics"
-, year =	1986
-, pages =	"408--413"
-, update =	"98.07 bibrelex"
+, author =      "M. Sivilotti and M. Emerling and C. Mead"
+, title =       "VLSI architectures for implementation of neural networks"
+, editor =      "J. Denker"
+, booktitle =   "Proc. AIP Conference: Neural Networks for Computing"
+, site =        "New York, NY"
+, volume =      151
+, organization =        "American Institute of Physics"
+, year =        1986
+, pages =       "408--413"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-dg-89
-, author =	"H.-W. Six"
-, title =	"{Durchschnittsanalyse} von {Gitterdatenstrukturen}"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "H.-W. Six"
+, title =       "{Durchschnittsanalyse} von {Gitterdatenstrukturen}"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @article{sw-cridr-82
-, author =	"H.-W. Six and D. Wood"
-, title =	"Counting and reporting intersections of {$D$}-ranges"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-31"
-, year =	1982
-, pages =	"181--187"
+, author =      "H.-W. Six and D. Wood"
+, title =       "Counting and reporting intersections of {$D$}-ranges"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-31"
+, year =        1982
+, pages =       "181--187"
 }
 
 @article{sw-ripr-80
-, author =	"H.-W. Six and D. Wood"
-, title =	"The rectangle intersection problem revisited"
-, journal =	"BIT"
-, volume =	20
-, year =	1980
-, pages =	"426--433"
+, author =      "H.-W. Six and D. Wood"
+, title =       "The rectangle intersection problem revisited"
+, journal =     "BIT"
+, volume =      20
+, year =        1980
+, pages =       "426--433"
 }
 
 @inproceedings{skt-rogd-98
-, author =	"J. M. Six and K. G. Kakoulis and I. G. Tollis"
-, title =	"Refinement of Orthogonal Graph Drawings"
-, editor =	"S. H. Whitesides"
-, booktitle =	"Graph Drawing (Proc. GD~'98)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1547
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"302--315"
-, update =	"99.07 vismara, 99.03 vismara"
+, author =      "J. M. Six and K. G. Kakoulis and I. G. Tollis"
+, title =       "Refinement of Orthogonal Graph Drawings"
+, editor =      "S. H. Whitesides"
+, booktitle =   "Graph Drawing (Proc. GD~'98)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1547
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "302--315"
+, update =      "99.07 vismara, 99.03 vismara"
 }
 
 @article{s-ealcc-96
-, author =	"V. Skala"
-, title =	"An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in $E^3$"
-, journal =	"Comput. Graph. Forum"
-, volume =	15
-, number =	1
-, month =	mar
-, year =	1996
-, pages =	"61--68"
-, update =	"96.05 held"
+, author =      "V. Skala"
+, title =       "An Efficient Algorithm for Line Clipping by Convex and Non-convex Polyhedra in $E^3$"
+, journal =     "Comput. Graph. Forum"
+, volume =      15
+, number =      1
+, month =       mar
+, year =        1996
+, pages =       "61--68"
+, update =      "96.05 held"
 }
 
 @inproceedings{s-olcae-94
-, author =	"Vaclav Skala"
-, title =	"$O(\log n)$ line clipping algorithm in $E^2$"
-, booktitle =	"Winter School of Computer Graphics and CAD Systems 94"
-, publisher =	"University of West Bohemia"
-, address =	"Pilsel, Czech Republic"
-, month =	jan
-, year =	1994
-, pages =	"174--191"
-, comments =	"line in convex polygon clipping"
-, update =	"95.05 korneenko"
+, author =      "Vaclav Skala"
+, title =       "$O(\log n)$ line clipping algorithm in $E^2$"
+, booktitle =   "Winter School of Computer Graphics and CAD Systems 94"
+, publisher =   "University of West Bohemia"
+, address =     "Pilsel, Czech Republic"
+, month =       jan
+, year =        1994
+, pages =       "174--191"
+, comments =    "line in convex polygon clipping"
+, update =      "95.05 korneenko"
 }
 
 @article{s-ckpps-90
-, author =	"S. Skiena"
-, title =	"Counting {$k$}-projections of a point set"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	55
-, year =	1990
-, pages =	"153--160"
-, update =	"98.11 bibrelex"
+, author =      "S. Skiena"
+, title =       "Counting {$k$}-projections of a point set"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      55
+, year =        1990
+, pages =       "153--160"
+, update =      "98.11 bibrelex"
 }
 
 @phdthesis{s-gp-88
-, author =	"Steven S. Skiena"
-, title =	"Geometric probing"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1988
-, keywords =	"probing, doctoral thesis"
-, update =	"98.03 mitchell"
+, author =      "Steven S. Skiena"
+, title =       "Geometric probing"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1988
+, keywords =    "probing, doctoral thesis"
+, update =      "98.03 mitchell"
 }
 
 @incollection{s-grp-97
-, author =	"Steven S. Skiena"
-, title =	"Geometric reconstruction problems"
-, chapter =	26
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"481--490"
-, update =	"98.03 mitchell, 97.11 orourke"
+, author =      "Steven S. Skiena"
+, title =       "Geometric reconstruction problems"
+, chapter =     26
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "481--490"
+, update =      "98.03 mitchell, 97.11 orourke"
 }
 
 @article{s-irgp-92
-, author =	"Steven S. Skiena"
-, title =	"Interactive Reconstruction via Geometric Probing"
-, journal =	"Proc. IEEE"
-, volume =	80
-, number =	9
-, month =	sep
-, year =	1992
-, pages =	"1364--1383"
-, update =	"98.03 mitchell, 93.09 held"
+, author =      "Steven S. Skiena"
+, title =       "Interactive Reconstruction via Geometric Probing"
+, journal =     "Proc. IEEE"
+, volume =      80
+, number =      9
+, month =       sep
+, year =        1992
+, pages =       "1364--1383"
+, update =      "98.03 mitchell, 93.09 held"
 }
 
 @article{s-pcphp-91
-, author =	"Steven S. Skiena"
-, title =	"Probing convex polygons with half-planes"
-, journal =	"J. Algorithms"
-, volume =	12
-, year =	1991
-, pages =	"359--374"
-, update =	"98.03 mitchell"
+, author =      "Steven S. Skiena"
+, title =       "Probing convex polygons with half-planes"
+, journal =     "J. Algorithms"
+, volume =      12
+, year =        1991
+, pages =       "359--374"
+, update =      "98.03 mitchell"
 }
 
 @article{s-pgp-89
-, author =	"Steven S. Skiena"
-, title =	"Problems in geometric probing"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"599--605"
-, keywords =	"survey paper, problem collection"
-, update =	"98.03 mitchell"
+, author =      "Steven S. Skiena"
+, title =       "Problems in geometric probing"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "599--605"
+, keywords =    "survey paper, problem collection"
+, update =      "98.03 mitchell"
 }
 
 @article{s-rgcss-89
-, author =	"Steven S. Skiena"
-, title =	"Reconstructing graphs from cut-set sizes"
-, journal =	"Inform. Process. Lett."
-, volume =	32
-, number =	3
-, year =	1989
-, pages =	"123--7"
-, update =	"98.03 mitchell"
+, author =      "Steven S. Skiena"
+, title =       "Reconstructing graphs from cut-set sizes"
+, journal =     "Inform. Process. Lett."
+, volume =      32
+, number =      3
+, year =        1989
+, pages =       "123--7"
+, update =      "98.03 mitchell"
 }
 
 @book{s-adm-98
-, author =	"S. S. Skiena"
-, title =	"The Algorithm Design Manual"
-, publisher =	"Telos/Springer-Verlag"
-, address =	"New York"
-, year =	1998
-, update =	"98.07 orourke"
+, author =      "S. S. Skiena"
+, title =       "The Algorithm Design Manual"
+, publisher =   "Telos/Springer-Verlag"
+, address =     "New York"
+, year =        1998
+, update =      "98.07 orourke"
 }
 
 @inproceedings{ssl-rsid-90
-, author =	"Steven S. Skiena and W. D. Smith and P. Lemke"
-, title =	"Reconstructing sets from interpoint distances"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"332--339"
-, cites =	"b-nccp-49, b-ctp-77, b-hs1-61, b-hs2-64, dk-ebsrs-88, e-sdnp-46, gj-cigtn-79, gs-tde-74, l-fpq-87, lw-ciaff-88, lll-fprc-82, m-ltn-76, p-ncbmp-76, p-dmdci-35, p-axrac-44, p-sledd-39, rpib-cppcs1-80, rpib-cppcs2-80, r-drmrc-88, rs-shs-82, s-ewgks-79, s-pcg-77, s-pcouc-71, s-adwag-49, s-idssd-78, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Steven S. Skiena and W. D. Smith and P. Lemke"
+, title =       "Reconstructing sets from interpoint distances"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "332--339"
+, cites =       "b-nccp-49, b-ctp-77, b-hs1-61, b-hs2-64, dk-ebsrs-88, e-sdnp-46, gj-cigtn-79, gs-tde-74, l-fpq-87, lw-ciaff-88, lll-fprc-82, m-ltn-76, p-ncbmp-76, p-dmdci-35, p-axrac-44, p-sledd-39, rpib-cppcs1-80, rpib-cppcs2-80, r-drmrc-88, rs-shs-82, s-ewgks-79, s-pcg-77, s-pcouc-71, s-adwag-49, s-idssd-78, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{s-fchsp-82
-, author =	"J. Sklansky"
-, title =	"Finding the convex hull of a simple polygon"
-, journal =	"Pattern Recogn. Lett."
-, volume =	1
-, year =	1982
-, pages =	"79--83"
+, author =      "J. Sklansky"
+, title =       "Finding the convex hull of a simple polygon"
+, journal =     "Pattern Recogn. Lett."
+, volume =      1
+, year =        1982
+, pages =       "79--83"
 }
 
 @article{s-mcrm-72
-, author =	"J. Sklansky"
-, title =	"Measuring concavity on rectangular mosaic"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-21"
-, year =	1972
-, pages =	"1355--1364"
+, author =      "J. Sklansky"
+, title =       "Measuring concavity on rectangular mosaic"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-21"
+, year =        1972
+, pages =       "1355--1364"
 }
 
 @article{s-fcc-75
-, author =	"J. Sklansky"
-, title =	"On filling cellular concavities"
-, journal =	"Comput. Graph. Image Process."
-, volume =	4
-, year =	1975
-, pages =	"236--247"
+, author =      "J. Sklansky"
+, title =       "On filling cellular concavities"
+, journal =     "Comput. Graph. Image Process."
+, volume =      4
+, year =        1975
+, pages =       "236--247"
 }
 
 @article{s-rcb-70
-, author =	"J. Sklansky"
-, title =	"Recognition of convex blobs"
-, journal =	"Pattern Recogn."
-, volume =	2
-, year =	1970
-, pages =	"3--10"
+, author =      "J. Sklansky"
+, title =       "Recognition of convex blobs"
+, journal =     "Pattern Recogn."
+, volume =      2
+, year =        1970
+, pages =       "3--10"
 }
 
 @article{sch-mppds-72
-, author =	"J. Sklansky and R. L. Chazin and B. J. Hansen"
-, title =	"Minimum perimeter polygons of digitized silhouettes"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-21"
-, year =	1972
-, pages =	"260--268"
+, author =      "J. Sklansky and R. L. Chazin and B. J. Hansen"
+, title =       "Minimum perimeter polygons of digitized silhouettes"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-21"
+, year =        1972
+, pages =       "260--268"
 }
 
 @article{scl-pdccb-76
-, author =	"J. Sklansky and L. P. Cordella and S. Levialdi"
-, title =	"Parallel detection of concavities in cellular blobs"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-25"
-, year =	1976
-, pages =	"187--196"
+, author =      "J. Sklansky and L. P. Cordella and S. Levialdi"
+, title =       "Parallel detection of concavities in cellular blobs"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-25"
+, year =        1976
+, pages =       "187--196"
 }
 
 @article{sg-fpadc-80
-, author =	"J. Sklansky and V. Gonzalez"
-, title =	"Fast polygonal approximation of digitized curves"
-, journal =	"Pattern Recogn."
-, volume =	12
-, year =	1980
-, pages =	"327--331"
+, author =      "J. Sklansky and V. Gonzalez"
+, title =       "Fast polygonal approximation of digitized curves"
+, journal =     "Pattern Recogn."
+, volume =      12
+, year =        1980
+, pages =       "327--331"
 }
 
 @article{s-sacse-91
-, author =	"S. Skyum"
-, title =	"A simple algorithm for computing the smallest enclosing circle"
-, journal =	"Inform. Process. Lett."
-, volume =	37
-, year =	1991
-, pages =	"121--125"
-, keywords =	"computational geometry, Voronoi diagrams, convex polygons"
-, abstract =	"Presented is a simple $O(n \log n)$ algorithm for
-		 computing the smallest enclosing circle of a convex
-		 polygon. It can be easily extended to algorithms that
-		 compute the farthest- and the closest-point Voronoi
-		 diagram of a convex polygon within the same time bound.
-		 (Author abstract) 4 Refs."
+, author =      "S. Skyum"
+, title =       "A simple algorithm for computing the smallest enclosing circle"
+, journal =     "Inform. Process. Lett."
+, volume =      37
+, year =        1991
+, pages =       "121--125"
+, keywords =    "computational geometry, Voronoi diagrams, convex polygons"
+, abstract =    "Presented is a simple $O(n \log n)$ algorithm for
+                 computing the smallest enclosing circle of a convex
+                 polygon. It can be easily extended to algorithms that
+                 compute the farthest- and the closest-point Voronoi
+                 diagram of a convex polygon within the same time bound.
+                 (Author abstract) 4 Refs."
 }
 
 @techreport{s-sagdt-91
-, author =	"S. Skyum"
-, title =	"A sweepline algorithm for generalized {Delaunay} triangulations"
-, number =	"DAIMI PB-373"
-, institution =	"CS Dept., Aarhus University"
-, year =	1991
-, update =	"00.03 bibrelex"
+, author =      "S. Skyum"
+, title =       "A sweepline algorithm for generalized {Delaunay} triangulations"
+, number =      "DAIMI PB-373"
+, institution = "CS Dept., Aarhus University"
+, year =        1991
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{s-sagdt-92
-, author =	"Sven Skyum"
-, title =	"A Sweepline Algorithm for Generalized {Delaunay} Triangulations and a Simple Method for Nearest-Neighbour Search"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"41--43"
-, update =	"00.03 bibrelex"
+, author =      "Sven Skyum"
+, title =       "A Sweepline Algorithm for Generalized {Delaunay} Triangulations and a Simple Method for Nearest-Neighbour Search"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "41--43"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{sd-udfft-80
-, author =	"J. R. Slagle and J. K. Dixon"
-, title =	"Using descriptions to find figures that approximate the given points"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
-, year =	1980
-, pages =	"1049--1054"
+, author =      "J. R. Slagle and J. K. Dixon"
+, title =       "Using descriptions to find figures that approximate the given points"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Pattern Recogn."
+, year =        1980
+, pages =       "1049--1054"
 }
 
 @article{sb-2dlpc-94
-, author =	"M. Slater and B. A. Barsky"
-, title =	"2D Line and Polygon Clipping Based on Space Subdivision"
-, journal =	"Visual Comput."
-, volume =	10
-, number =	7
-, year =	1994
-, pages =	"407--422"
-, update =	"96.01 held"
+, author =      "M. Slater and B. A. Barsky"
+, title =       "2D Line and Polygon Clipping Based on Space Subdivision"
+, journal =     "Visual Comput."
+, volume =      10
+, number =      7
+, year =        1994
+, pages =       "407--422"
+, update =      "96.01 held"
 }
 
 @article{s-2toap-80
-, author =	"D. D. Sleator"
-, title =	"A $2.5$ times optimal algorithm for packing in two dimensions"
-, journal =	"Inform. Process. Lett."
-, volume =	10
-, year =	1980
-, pages =	"37--40"
+, author =      "D. D. Sleator"
+, title =       "A $2.5$ times optimal algorithm for packing in two dimensions"
+, journal =     "Inform. Process. Lett."
+, volume =      10
+, year =        1980
+, pages =       "37--40"
 }
 
 @phdthesis{s-oamnf-80
-, author =	"D. D. Sleator"
-, title =	"An {$0(nm\log n)$} algorithm for maximum network flow"
-, school =	"Stanford University"
-, year =	1980
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "D. D. Sleator"
+, title =       "An {$0(nm\log n)$} algorithm for maximum network flow"
+, school =      "Stanford University"
+, year =        1980
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @article{st-dsdt-83
-, author =	"D. D. Sleator and R. E. Tarjan"
-, title =	"A Data Structure for Dynamic Trees"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	26
-, number =	3
-, year =	1983
-, pages =	"362--381"
-, keywords =	"data structure, tree"
-, update =	"95.09 tamassia"
+, author =      "D. D. Sleator and R. E. Tarjan"
+, title =       "A Data Structure for Dynamic Trees"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      26
+, number =      3
+, year =        1983
+, pages =       "362--381"
+, keywords =    "data structure, tree"
+, update =      "95.09 tamassia"
 }
 
 @article{st-aelup-85
-, author =	"D. D. Sleator and R. E. Tarjan"
-, title =	"Amortized efficiency of list update and paging rules"
-, journal =	"Commun. ACM"
-, volume =	28
-, year =	1985
-, pages =	"202--208"
-, update =	"97.03 icking"
+, author =      "D. D. Sleator and R. E. Tarjan"
+, title =       "Amortized efficiency of list update and paging rules"
+, journal =     "Commun. ACM"
+, volume =      28
+, year =        1985
+, pages =       "202--208"
+, update =      "97.03 icking"
 }
 
 @article{st-sabst-85
-, author =	"D. D. Sleator and R. E. Tarjan"
-, title =	"Self-Adjusting Binary Search Trees"
-, journal =	"J. ACM"
-, volume =	32
-, number =	3
-, year =	1985
-, pages =	"652--686"
-, keywords =	"data structure, search tree"
-, update =	"95.09 tamassia"
+, author =      "D. D. Sleator and R. E. Tarjan"
+, title =       "Self-Adjusting Binary Search Trees"
+, journal =     "J. ACM"
+, volume =      32
+, number =      3
+, year =        1985
+, pages =       "652--686"
+, keywords =    "data structure, search tree"
+, update =      "95.09 tamassia"
 }
 
 @article{st-sah-86
-, author =	"D. D. Sleator and R. E. Tarjan"
-, title =	"Self-adjusting heaps"
-, journal =	"SIAM J. Comput."
-, volume =	15
-, number =	1
-, month =	feb
-, year =	1986
-, pages =	"52--69"
-, update =	"98.07 bibrelex"
+, author =      "D. D. Sleator and R. E. Tarjan"
+, title =       "Self-adjusting heaps"
+, journal =     "SIAM J. Comput."
+, volume =      15
+, number =      1
+, month =       feb
+, year =        1986
+, pages =       "52--69"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{stt-rdthg-86
-, author =	"D. D. Sleator and R. E. Tarjan and W. P. Thurston"
-, title =	"Rotation distance, triangulations, and hyperbolic geometry"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"122--135"
-, precedes =	"stt-rdthg-88"
+, author =      "D. D. Sleator and R. E. Tarjan and W. P. Thurston"
+, title =       "Rotation distance, triangulations, and hyperbolic geometry"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "122--135"
+, precedes =    "stt-rdthg-88"
 }
 
 @article{stt-rdthg-88
-, author =	"D. D. Sleator and R. E. Tarjan and W. P. Thurston"
-, title =	"Rotation distance, triangulations, and hyperbolic geometry"
-, journal =	"J. Amer. Math. Soc."
-, volume =	1
-, year =	1988
-, pages =	"647--682"
-, succeeds =	"stt-rdthg-86"
+, author =      "D. D. Sleator and R. E. Tarjan and W. P. Thurston"
+, title =       "Rotation distance, triangulations, and hyperbolic geometry"
+, journal =     "J. Amer. Math. Soc."
+, volume =      1
+, year =        1988
+, pages =       "647--682"
+, succeeds =    "stt-rdthg-86"
 }
 
 @inproceedings{sh-srsd-81
-, author =	"K. R. Sloan and L. M. Hrechanyk"
-, title =	"Surface reconstruction from sparse data"
-, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
-, year =	1981
-, pages =	"45--48"
-, update =	"98.03 bibrelex"
+, author =      "K. R. Sloan and L. M. Hrechanyk"
+, title =       "Surface reconstruction from sparse data"
+, booktitle =   "Proc. 6th IEEE Internat. Conf. Pattern Recogn."
+, year =        1981
+, pages =       "45--48"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{sp-cstir-87
-, author =	"K. R. Sloan and J. Painter"
-, title =	"From contours to surfaces: testbed and initial results"
-, booktitle =	"Proc. Graphics Interface '87"
-, year =	1987
-, pages =	"115--120"
-, update =	"98.03 bibrelex"
+, author =      "K. R. Sloan and J. Painter"
+, title =       "From contours to surfaces: testbed and initial results"
+, booktitle =   "Proc. Graphics Interface '87"
+, year =        1987
+, pages =       "115--120"
+, update =      "98.03 bibrelex"
 }
 
 @article{sp-pgmbo-88
-, author =	"K. R. Sloan and J. Painter"
-, title =	"Pessimal guess may be optimal: {A} counterintuitive search result"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	10
-, year =	1988
-, pages =	"949--955"
-, update =	"98.03 bibrelex"
+, author =      "K. R. Sloan and J. Painter"
+, title =       "Pessimal guess may be optimal: {A} counterintuitive search result"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      10
+, year =        1988
+, pages =       "949--955"
+, update =      "98.03 bibrelex"
 }
 
 @article{s-facdt-87
-, author =	"S. W. Sloan"
-, title =	"A fast algorithm for constructing {Delaunay} triangulations in the plane"
-, journal =	"Adv. Eng. Softw."
-, volume =	9
-, number =	1
-, month =	jan
-, year =	1987
-, pages =	"34--55"
-, annote =	"Your basic incremental switching algorithm. Points are
-		 sorted into bins to increase speed of point location
-		 (which walks the triangulation, starting at the
-		 previous triangle.)"
-, abstract =	"The primary purpose of the paper is to present a
-		 FORTRAN 77 code for the efficient triangulation of
-		 planar data points as might be required for the mesh
-		 generation of a finite element analysis. The author
-		 describes in detail the various features of the
-		 algorithm and compares them to existing routines. The
-		 efficiency of the algorithm is demonstrated for
-		 randomly distributed data points where the number of
-		 points varies between 100 and 10,000. It is shown that
-		 the proposed scheme outperforms existing routines for
-		 both large and small data sets. -G. E. Bell, St.
-		 Andrews, U"
+, author =      "S. W. Sloan"
+, title =       "A fast algorithm for constructing {Delaunay} triangulations in the plane"
+, journal =     "Adv. Eng. Softw."
+, volume =      9
+, number =      1
+, month =       jan
+, year =        1987
+, pages =       "34--55"
+, annote =      "Your basic incremental switching algorithm. Points are
+                 sorted into bins to increase speed of point location
+                 (which walks the triangulation, starting at the
+                 previous triangle.)"
+, abstract =    "The primary purpose of the paper is to present a
+                 FORTRAN 77 code for the efficient triangulation of
+                 planar data points as might be required for the mesh
+                 generation of a finite element analysis. The author
+                 describes in detail the various features of the
+                 algorithm and compares them to existing routines. The
+                 efficiency of the algorithm is demonstrated for
+                 randomly distributed data points where the number of
+                 points varies between 100 and 10,000. It is shown that
+                 the proposed scheme outperforms existing routines for
+                 both large and small data sets. -G. E. Bell, St.
+                 Andrews, U"
 }
 
 @techreport{s-fagcd-91
-, author =	"S. W. Sloan"
-, title =	"A Fast Algorithm for Generating Constrained {Delaunay} Triangulations"
-, type =	"Research Report"
-, number =	"065.07.1991"
-, institution =	"The University of Newcastle Department of Civil Engineering and Surveying"
-, address =	"New South Wales"
-, year =	1991
-, annote =	"First computes DT then constrained edges are inserted
-		 one at a time. Flips are done that decrease number of
-		 crossings with constraint edges, until no crossings
-		 remain. Then Delaunay flips are done. (DT algorithm
-		 uses bin ordering to speed point location)"
+, author =      "S. W. Sloan"
+, title =       "A Fast Algorithm for Generating Constrained {Delaunay} Triangulations"
+, type =        "Research Report"
+, number =      "065.07.1991"
+, institution = "The University of Newcastle Department of Civil Engineering and Surveying"
+, address =     "New South Wales"
+, year =        1991
+, annote =      "First computes DT then constrained edges are inserted
+                 one at a time. Flips are done that decrease number of
+                 crossings with constraint edges, until no crossings
+                 remain. Then Delaunay flips are done. (DT algorithm
+                 uses bin ordering to speed point location)"
 }
 
 @article{sh-iwac2-84
-, author =	"S. W. Sloan and G. T. Houlsby"
-, title =	"An Implementation of {Watson's} Algorithm For Computing 2-dimensional {Delaunay} Triangulations"
-, journal =	"Adv. Eng. Softw."
-, volume =	6
-, number =	4
-, year =	1984
-, pages =	"192--197"
-, annote =	"Sigh. Incremental algorithm all triangles whose cc
-		 contains new point are deleted. Points are sorted by x
-		 coord, so only those triangles whose cc includes
-		 current x coord need be included. F77 code included.
-		 Does not keep adjacency info for triangles."
+, author =      "S. W. Sloan and G. T. Houlsby"
+, title =       "An Implementation of {Watson's} Algorithm For Computing 2-dimensional {Delaunay} Triangulations"
+, journal =     "Adv. Eng. Softw."
+, volume =      6
+, number =      4
+, year =        1984
+, pages =       "192--197"
+, annote =      "Sigh. Incremental algorithm all triangles whose cc
+                 contains new point are deleted. Points are sorted by x
+                 coord, so only those triangles whose cc includes
+                 current x coord need be included. F77 code included.
+                 Does not keep adjacency info for triangles."
 }
 
 @inproceedings{s-aeqes-82
-, author =	"A. van der Sluis"
-, title =	"Asymptotic expansions for quadrature errors over a simplex"
-, booktitle =	"Proc. Conf. Numerical Integration"
-, site =	"Oberwolfach, West Germany"
-, publisher =	"Birkh{\"a}user"
-, year =	1982
-, pages =	"222--240"
-, update =	"98.07 bibrelex"
+, author =      "A. van der Sluis"
+, title =       "Asymptotic expansions for quadrature errors over a simplex"
+, booktitle =   "Proc. Conf. Numerical Integration"
+, site =        "Oberwolfach, West Germany"
+, publisher =   "Birkh{\"a}user"
+, year =        1982
+, pages =       "222--240"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{sh-gpamg-??
-, author =	"M. L. C. Sluiter and D. L. Hansen"
-, title =	"A general purpose automatic mesh generator for shell and solid finite elements"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	"??"
+, author =      "M. L. C. Sluiter and D. L. Hansen"
+, title =       "A general purpose automatic mesh generator for shell and solid finite elements"
+, type =        "Manuscript"
+, institution = "??"
+, year =        "??"
 }
 
 @inproceedings{s-caig-87
-, author =	"M. Slusarek"
-, title =	"A Coloring Algorithm for Interval Graphs"
-, booktitle =	"Proc. 1987 MCFS."
-, series =	"Lecture Notes in CS"
-, volume =	379
-, year =	1987
-, pages =	"471--480"
-, update =	"98.07 bibrelex"
+, author =      "M. Slusarek"
+, title =       "A Coloring Algorithm for Interval Graphs"
+, booktitle =   "Proc. 1987 MCFS."
+, series =      "Lecture Notes in CS"
+, volume =      379
+, year =        1987
+, pages =       "471--480"
+, update =      "98.07 bibrelex"
 }
 
 @article{s-ta-87
-, author =	"S. Smale"
-, title =	"On the topology of algorithms {I}"
-, journal =	"J. of Compl."
-, volume =	3
-, year =	1987
-, pages =	"81--89"
-, update =	"98.11 bibrelex"
+, author =      "S. Smale"
+, title =       "On the topology of algorithms {I}"
+, journal =     "J. of Compl."
+, volume =      3
+, year =        1987
+, pages =       "81--89"
+, update =      "98.11 bibrelex"
 }
 
 @article{s-rcrm-58
-, author =	"S. Smale"
-, title =	"Regular curves on Riemannian manifolds"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	87
-, year =	1958
-, pages =	"492--512"
-, update =	"98.03 bibrelex"
+, author =      "S. Smale"
+, title =       "Regular curves on Riemannian manifolds"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      87
+, year =        1958
+, pages =       "492--512"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{s-passm-83
-, author =	"S. Smale"
-, title =	"The problem of the average speed of the simplex method"
-, editor =	"A. Bachem and M. Gr{\"o}tschel and B. Korte"
-, booktitle =	"Mathematical Programming: the state of the art"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1983
-, pages =	"530--539"
+, author =      "S. Smale"
+, title =       "The problem of the average speed of the simplex method"
+, editor =      "A. Bachem and M. Gr{\"o}tschel and B. Korte"
+, booktitle =   "Mathematical Programming: the state of the art"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1983
+, pages =       "530--539"
 }
 
 @inproceedings{sv-vvtcs-92
-, author =	"J. C. Smart and V. Vemuri"
-, title =	"A-Vu: {A} Visualization Tool for Complex Software Systems"
-, booktitle =	"Proc. IEEE Symposium on Assessment of Quality Software Development Tools"
-, month =	may
-, year =	1992
-, pages =	""
-, keywords =	"graph drawing"
-, update =	"94.05 devillers, 93.09 tamassia"
+, author =      "J. C. Smart and V. Vemuri"
+, title =       "A-Vu: {A} Visualization Tool for Complex Software Systems"
+, booktitle =   "Proc. IEEE Symposium on Assessment of Quality Software Development Tools"
+, month =       may
+, year =        1992
+, pages =       ""
+, keywords =    "graph drawing"
+, update =      "94.05 devillers, 93.09 tamassia"
 }
 
 % not in J. ACM in 1981 or any nearby years
 @article{sr-nnpir-81
-, author =	"A. F. Smeaton and C. J. van Rijsbergen"
-, title =	"The nearest neighbour problem in information retrieval"
-, journal =	"J. ACM"
-, volume =	"??"
-, year =	1981
-, pages =	"83--87"
+, author =      "A. F. Smeaton and C. J. van Rijsbergen"
+, title =       "The nearest neighbour problem in information retrieval"
+, journal =     "J. ACM"
+, volume =      "??"
+, year =        1981
+, pages =       "83--87"
 }
 
 @article{skt-acc1v-95
-, author =	"A. Smellie and S. Kahn and S. Teig"
-, title =	"Analysis of conformational coverage: $1$. validation and estimation of coverage"
-, journal =	"J. Chem. Inf. Comput. Sci."
-, volume =	8
-, year =	1995
-, pages =	"290--303"
-, update =	"98.07 bibrelex"
+, author =      "A. Smellie and S. Kahn and S. Teig"
+, title =       "Analysis of conformational coverage: $1$. validation and estimation of coverage"
+, journal =     "J. Chem. Inf. Comput. Sci."
+, volume =      8
+, year =        1995
+, pages =       "290--303"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{sd-ddcps-91
-, author =	"A. Smeulders and L. Dorst"
-, title =	"Decomposition of discrete curves into piece-wise straight segments in linear time"
-, editor =	"Melter and Rosenfeld and Bhattacharya"
-, booktitle =	"Vision Geometry"
-, series =	"Proc. Amer. Math. Soc."
-, volume =	119
-, publisher =	"Contemporary Mathematics,"
-, year =	1991
-, pages =	"169--195"
-, update =	"98.11 bibrelex"
+, author =      "A. Smeulders and L. Dorst"
+, title =       "Decomposition of discrete curves into piece-wise straight segments in linear time"
+, editor =      "Melter and Rosenfeld and Bhattacharya"
+, booktitle =   "Vision Geometry"
+, series =      "Proc. Amer. Math. Soc."
+, volume =      119
+, publisher =   "Contemporary Mathematics,"
+, year =        1991
+, pages =       "169--195"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{s-wcaso-90
-, author =	"M. Smid"
-, title =	"A worst-case algorithm for semi-online updates on decomposable problems"
-, type =	"Report"
-, number =	"A-03/90"
-, institution =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1990
-, precedes =	"s-asolu-90"
+, author =      "M. Smid"
+, title =       "A worst-case algorithm for semi-online updates on decomposable problems"
+, type =        "Report"
+, number =      "A-03/90"
+, institution = "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1990
+, precedes =    "s-asolu-90"
 }
 
 @inproceedings{s-asolu-90
-, author =	"M. Smid"
-, title =	"Algorithms for semi-online updates on decomposable problems"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"347--350"
-, succeeds =	"s-wcaso-90"
-, cites =	"ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M. Smid"
+, title =       "Algorithms for semi-online updates on decomposable problems"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "347--350"
+, succeeds =    "s-wcaso-90"
+, cites =       "ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{s-oafkp-93
-, author =	"M. Smid"
-, title =	"An {$O(n \log n)$} algorithm for finding a $k$-point subset with minimal {$L_{\infty}$}-diameter"
-, type =	"Report"
-, number =	"MPI-I-93-116"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1993
-, update =	"93.09 smid, 93.05 smid"
-, annote =	"The analysis of the running time is wrong; the actual running time is very high"
+, author =      "M. Smid"
+, title =       "An {$O(n \log n)$} algorithm for finding a $k$-point subset with minimal {$L_{\infty}$}-diameter"
+, type =        "Report"
+, number =      "MPI-I-93-116"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1993
+, update =      "93.09 smid, 93.05 smid"
+, annote =      "The analysis of the running time is wrong; the actual running time is very high"
 }
 
 @techreport{s-cppcg-95
-, author =	"M. Smid"
-, title =	"Closest point problems in computational geometry"
-, type =	"Report"
-, number =	"MPI-I-95-1-026"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1995
-, keywords =	"survey paper"
-, precedes =	"s-cppcg-00"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 smid, 96.01 smid"
+, author =      "M. Smid"
+, title =       "Closest point problems in computational geometry"
+, type =        "Report"
+, number =      "MPI-I-95-1-026"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1995
+, keywords =    "survey paper"
+, precedes =    "s-cppcg-00"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.11 smid, 96.01 smid"
 }
 
 @incollection{s-cppcg-00
-, author =	"Michiel Smid"
-, title =	"Closest Point Problems in Computational Geometry"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"877--935"
-, succeeds =	"s-cppcg-95"
-, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 98.11 smid, 98.07 mitchell"
-, annote =	"Chapter 20 of su-hcg-00"
+, author =      "Michiel Smid"
+, title =       "Closest Point Problems in Computational Geometry"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "877--935"
+, succeeds =    "s-cppcg-95"
+, update =      "00.03 bibrelex+smid, 99.03 bibrelex, 98.11 smid, 98.07 mitchell"
+, annote =      "Chapter 20 of su-hcg-00"
 }
 
 @phdthesis{s-ddsms-89
-, author =	"M. Smid"
-, title =	"Dynamic data structures on multiple storage media"
-, type =	"Ph.{D}. Thesis"
-, school =	"Depts. Math. Comput. Sci., Univ. Amsterdam"
-, address =	"Amsterdam, Netherlands"
-, year =	1989
-, keywords =	"doctoral thesis"
+, author =      "M. Smid"
+, title =       "Dynamic data structures on multiple storage media"
+, type =        "Ph.{D}. Thesis"
+, school =      "Depts. Math. Comput. Sci., Univ. Amsterdam"
+, address =     "Amsterdam, Netherlands"
+, year =        1989
+, keywords =    "doctoral thesis"
 }
 
 @techreport{s-drpla-91
-, author =	"M. Smid"
-, title =	"Dynamic rectangular point location, with an application to the closest pair problem"
-, type =	"Report"
-, number =	"MPI-I-91-101"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1991
-, precedes =	"s-drpla-95"
-, update =	"95.05 smid"
+, author =      "M. Smid"
+, title =       "Dynamic rectangular point location, with an application to the closest pair problem"
+, type =        "Report"
+, number =      "MPI-I-91-101"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1991
+, precedes =    "s-drpla-95"
+, update =      "95.05 smid"
 }
 
 @article{s-drpla-95
-, author =	"M. Smid"
-, title =	"Dynamic rectangular point location, with an application to the closest pair problem"
-, journal =	"Inform. Comput."
-, volume =	116
-, year =	1995
-, pages =	"1--9"
-, succeeds =	"s-drpla-91"
-, update =	"95.05 smid"
+, author =      "M. Smid"
+, title =       "Dynamic rectangular point location, with an application to the closest pair problem"
+, journal =     "Inform. Comput."
+, volume =      116
+, year =        1995
+, pages =       "1--9"
+, succeeds =    "s-drpla-91"
+, update =      "95.05 smid"
 }
 
 @techreport{s-fkpse-92
-, author =	"M. Smid"
-, title =	"Finding $k$ points with a smallest enclosing square"
-, type =	"Report"
-, number =	"MPI-I-92-152"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
+, author =      "M. Smid"
+, title =       "Finding $k$ points with a smallest enclosing square"
+, type =        "Report"
+, number =      "MPI-I-92-152"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
 }
 
 @techreport{s-lnstd-94
-, author =	"M. Smid"
-, title =	"Lecture Notes: Selected Topics in Data Structures"
-, type =	"Report"
-, number =	"MPI-I-94-155"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, keywords =	"skip lists, union-find, range trees, post-office problem, maintaining order in a list"
-, update =	"95.01 smid"
+, author =      "M. Smid"
+, title =       "Lecture Notes: Selected Topics in Data Structures"
+, type =        "Report"
+, number =      "MPI-I-94-155"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, keywords =    "skip lists, union-find, range trees, post-office problem, maintaining order in a list"
+, update =      "95.01 smid"
 }
 
 @techreport{s-mmdpsl-90t
-, author =	"M. Smid"
-, title =	"Maintaining the minimal distance of a point set in less than linear time"
-, type =	"Report"
-, number =	"A-06/90"
-, institution =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1990
-, precedes =	"s-mmdpsl-90i"
+, author =      "M. Smid"
+, title =       "Maintaining the minimal distance of a point set in less than linear time"
+, type =        "Report"
+, number =      "A-06/90"
+, institution = "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1990
+, precedes =    "s-mmdpsl-90i"
 }
 
 @inproceedings{s-mmdpsl-90i
-, author =	"M. Smid"
-, title =	"Maintaining the minimal distance of a point set in less than linear time"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"1--4"
-, succeeds =	"s-mmdpsl-90t"
-, precedes =	"s-mmdpsl-91a"
-, cites =	"agss-ltacv-89, ds-dcmdf-89, m-mdscg-84, v-oaann-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "M. Smid"
+, title =       "Maintaining the minimal distance of a point set in less than linear time"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "1--4"
+, succeeds =    "s-mmdpsl-90t"
+, precedes =    "s-mmdpsl-91a"
+, cites =       "agss-ltacv-89, ds-dcmdf-89, m-mdscg-84, v-oaann-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{s-mmdpsl-91a
-, author =	"M. Smid"
-, title =	"Maintaining the minimal distance of a point set in less than linear time"
-, journal =	"Algorithms Rev."
-, volume =	2
-, year =	1991
-, pages =	"33--44"
-, succeeds =	"s-mmdpsl-90i"
+, author =      "M. Smid"
+, title =       "Maintaining the minimal distance of a point set in less than linear time"
+, journal =     "Algorithms Rev."
+, volume =      2
+, year =        1991
+, pages =       "33--44"
+, succeeds =    "s-mmdpsl-90i"
 }
 
 @techreport{s-mmdpsp-90t
-, author =	"M. Smid"
-, title =	"Maintaining the minimal distance of a point set in polylogarithmic time"
-, type =	"Report"
-, number =	"A-13/90"
-, institution =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, West Germany"
-, year =	1990
-, precedes =	"s-mmdpsp-91i"
+, author =      "M. Smid"
+, title =       "Maintaining the minimal distance of a point set in polylogarithmic time"
+, type =        "Report"
+, number =      "A-13/90"
+, institution = "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, West Germany"
+, year =        1990
+, precedes =    "s-mmdpsp-91i"
 }
 
 @inproceedings{s-mmdpsp-91i
-, author =	"M. Smid"
-, title =	"Maintaining the minimal distance of a point set in polylogarithmic time"
-, booktitle =	"Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1991
-, pages =	"1--6"
-, succeeds =	"s-mmdpsp-90t"
-, precedes =	"s-mmdpsp-91t"
+, author =      "M. Smid"
+, title =       "Maintaining the minimal distance of a point set in polylogarithmic time"
+, booktitle =   "Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1991
+, pages =       "1--6"
+, succeeds =    "s-mmdpsp-90t"
+, precedes =    "s-mmdpsp-91t"
 }
 
 @article{s-mmdpsp-92a
-, author =	"M. Smid"
-, title =	"Maintaining the minimal distance of a point set in polylogarithmic time"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"415--431"
-, succeeds =	"s-mmdpsp-91t"
+, author =      "M. Smid"
+, title =       "Maintaining the minimal distance of a point set in polylogarithmic time"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "415--431"
+, succeeds =    "s-mmdpsp-91t"
 }
 
 @techreport{s-mmdpsp-91t
-, author =	"M. Smid"
-, title =	"Maintaining the minimal distance of a point set in polylogarithmic time (revised version)"
-, type =	"Report"
-, number =	"MPI-I-91-103"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1991
-, succeeds =	"s-mmdpsp-91i"
-, precedes =	"s-mmdpsp-92a"
+, author =      "M. Smid"
+, title =       "Maintaining the minimal distance of a point set in polylogarithmic time (revised version)"
+, type =        "Report"
+, number =      "MPI-I-91-103"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1991
+, succeeds =    "s-mmdpsp-91i"
+, precedes =    "s-mmdpsp-92a"
 }
 
 @techreport{s-ocaps-96
-, author =	"M. Smid"
-, title =	"On the circumradius of acute point sets"
-, type =	"Report"
-, number =	"TR 96-08"
-, institution =	"Department of Computer Science, King's College"
-, address =	"London, UK"
-, year =	1996
-, update =	"96.05 smid"
+, author =      "M. Smid"
+, title =       "On the circumradius of acute point sets"
+, type =        "Report"
+, number =      "TR 96-08"
+, institution = "Department of Computer Science, King's College"
+, address =     "London, UK"
+, year =        1996
+, update =      "96.05 smid"
 }
 
 @techreport{s-rtsp-91t
-, author =	"M. Smid"
-, title =	"Range trees with slack parameter"
-, type =	"Report"
-, number =	"MPI-I-91-102"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1991
-, precedes =	"s-rtsp-91a"
+, author =      "M. Smid"
+, title =       "Range trees with slack parameter"
+, type =        "Report"
+, number =      "MPI-I-91-102"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1991
+, precedes =    "s-rtsp-91a"
 }
 
 @article{s-rtsp-91a
-, author =	"M. Smid"
-, title =	"Range trees with slack parameter"
-, journal =	"Algorithms Rev."
-, volume =	2
-, year =	1991
-, pages =	"77--87"
-, succeeds =	"s-rtsp-91t"
+, author =      "M. Smid"
+, title =       "Range trees with slack parameter"
+, journal =     "Algorithms Rev."
+, volume =      2
+, year =        1991
+, pages =       "77--87"
+, succeeds =    "s-rtsp-91t"
 }
 
 @inproceedings{s-rpldc-91
-, author =	"M. Smid"
-, title =	"Rectangular point location and the dynamic closest pair problem"
-, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"364--374"
+, author =      "M. Smid"
+, title =       "Rectangular point location and the dynamic closest pair problem"
+, booktitle =   "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "364--374"
 }
 
 @techreport{sj-wrspp-94
-, author =	"M. Smid and R. Janardan"
-, title =	"On the width and roundness of a set of points in the plane"
-, type =	"Report"
-, number =	"MPI-I-94-111"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1994
-, update =	"95.01 smid"
+, author =      "M. Smid and R. Janardan"
+, title =       "On the width and roundness of a set of points in the plane"
+, type =        "Report"
+, number =      "MPI-I-94-111"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1994
+, update =      "95.01 smid"
 }
 
 @inproceedings{sj-wrspp-95
-, author =	"Michiel Smid and Ravi Janardan"
-, title =	"On the Width and Roundness of a Set of Points in the Plane"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"193--198"
-, precedes =	"sj-wrspp-99"
-, update =	"99.07 smid, 95.09 jones"
+, author =      "Michiel Smid and Ravi Janardan"
+, title =       "On the Width and Roundness of a Set of Points in the Plane"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "193--198"
+, precedes =    "sj-wrspp-99"
+, update =      "99.07 smid, 95.09 jones"
 }
 
 @article{sj-wrspp-99
-, author =	"M. Smid and R. Janardan"
-, title =	"On the width and roundness of a set of points in the plane"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, year =	1999
-, pages =	"97--108"
-, succeeds =	"sj-wrspp-95"
-, update =	"99.07 smid"
+, author =      "M. Smid and R. Janardan"
+, title =       "On the width and roundness of a set of points in the plane"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, year =        1999
+, pages =       "97--108"
+, succeeds =    "sj-wrspp-95"
+, update =      "99.07 smid"
 }
 
 @article{s-dsufp-90
-, author =	"M. H. Smid"
-, title =	"A data structure for the Union-Find problem having good single-operation complexity"
-, journal =	"Algorithms Rev."
-, volume =	1
-, number =	1
-, year =	1990
-, pages =	"1--11"
+, author =      "M. H. Smid"
+, title =       "A data structure for the Union-Find problem having good single-operation complexity"
+, journal =     "Algorithms Rev."
+, volume =      1
+, number =      1
+, year =        1990
+, pages =       "1--11"
 }
 
 @article{so-mrtsm-90
-, author =	"M. H. M. Smid and M. H. Overmars"
-, title =	"Maintaining range trees in secondary memory, part {II}: lower bounds"
-, journal =	"Acta Inform."
-, volume =	27
-, year =	1990
-, pages =	"453--480"
+, author =      "M. H. M. Smid and M. H. Overmars"
+, title =       "Maintaining range trees in secondary memory, part {II}: lower bounds"
+, journal =     "Acta Inform."
+, volume =      27
+, year =        1990
+, pages =       "453--480"
 }
 
 @techreport{s-uesi-79
-, author =	"D. A. Smith"
-, title =	"Using Enhanced Spherical Images"
-, number =	"MIT AI Memo 530"
-, institution =	"MIT"
-, month =	may
-, year =	1979
-, update =	"97.11 bibrelex"
+, author =      "D. A. Smith"
+, title =       "Using Enhanced Spherical Images"
+, number =      "MIT AI Memo 530"
+, institution = "MIT"
+, month =       may
+, year =        1979
+, update =      "97.11 bibrelex"
 }
 
 @article{sv-hsiub-89
-, author =	"D. J. Smith and M. K. Vamanamurthy"
-, title =	"How small is a unit ball?"
-, journal =	"Math. Mag."
-, volume =	62
-, year =	1989
-, pages =	"101--107"
-, update =	"97.11 bibrelex"
+, author =      "D. J. Smith and M. K. Vamanamurthy"
+, title =       "How small is a unit ball?"
+, journal =     "Math. Mag."
+, volume =      62
+, year =        1989
+, pages =       "101--107"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-siec-61
-, author =	"H. J. Smith"
-, title =	"On systems of indeterminate equations and congruences"
-, journal =	"Philos. Trans."
-, volume =	151
-, year =	1861
-, pages =	"293--326"
-, update =	"98.03 bibrelex"
+, author =      "H. J. Smith"
+, title =       "On systems of indeterminate equations and congruences"
+, journal =     "Philos. Trans."
+, volume =      151
+, year =        1861
+, pages =       "293--326"
+, update =      "98.03 bibrelex"
 }
 
 @article{sg-smtus-82
-, author =	"J. M. Smith and M. Gross"
-, title =	"Steiner minimal trees and urban service networks"
-, journal =	"J. Socio. Econ. Plng."
-, volume =	16
-, year =	1982
-, pages =	"21--38"
-, update =	"98.03 bibrelex"
+, author =      "J. M. Smith and M. Gross"
+, title =       "Steiner minimal trees and urban service networks"
+, journal =     "J. Socio. Econ. Plng."
+, volume =      16
+, year =        1982
+, pages =       "21--38"
+, update =      "98.03 bibrelex"
 }
 
 @article{sll-ohars-80
-, author =	"J. M. Smith and D. T. Lee and J. S. Liebman"
-, title =	"An {$O(n \log n)$} algorithm for the rectilinear {Steiner} minimal tree problem"
-, journal =	"Engineering Optimization"
-, volume =	4
-, year =	1980
-, pages =	"179--192"
-, update =	"98.07 bibrelex"
+, author =      "J. M. Smith and D. T. Lee and J. S. Liebman"
+, title =       "An {$O(n \log n)$} algorithm for the rectilinear {Steiner} minimal tree problem"
+, journal =     "Engineering Optimization"
+, volume =      4
+, year =        1980
+, pages =       "179--192"
+, update =      "98.07 bibrelex"
 }
 
 @article{sll-ohasm-81
-, author =	"J. M. Smith and D. T. Lee and J. S. Liebman"
-, title =	"An {$O(n \log n)$} heuristic algorithm for {Steiner} minimal tree problems on the {Euclidean} metric"
-, journal =	"Networks"
-, volume =	11
-, year =	1981
-, pages =	"23--29"
+, author =      "J. M. Smith and D. T. Lee and J. S. Liebman"
+, title =       "An {$O(n \log n)$} heuristic algorithm for {Steiner} minimal tree problems on the {Euclidean} metric"
+, journal =     "Networks"
+, volume =      11
+, year =        1981
+, pages =       "23--29"
 }
 
 @incollection{sw-cgtnd-92
-, author =	"J. M. Smith and P. Winter"
-, title =	"Computational geometry and topological network design"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	1
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1992
-, pages =	"287--385"
-, keywords =	"survey paper"
-, comments =	"includes morphological classification of basic computational geometry"
-, precedes =	"sw-cgtnd-95"
-, update =	"98.07 icking, 93.09 erickson"
+, author =      "J. M. Smith and P. Winter"
+, title =       "Computational geometry and topological network design"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      1
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1992
+, pages =       "287--385"
+, keywords =    "survey paper"
+, comments =    "includes morphological classification of basic computational geometry"
+, precedes =    "sw-cgtnd-95"
+, update =      "98.07 icking, 93.09 erickson"
 }
 
 @incollection{sw-cgtnd-95
-, author =	"J. M. Smith and P. Winter"
-, title =	"Computational Geometry and Topological Network Design"
-, editor =	"Ding-Zhu Du and Frank Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1995
-, pages =	"351--451"
-, keywords =	"survey paper"
-, comments =	"includes morphological classification of basic computational geometry"
-, succeeds =	"sw-cgtnd-92"
-, update =	"98.07 icking"
+, author =      "J. M. Smith and P. Winter"
+, title =       "Computational Geometry and Topological Network Design"
+, editor =      "Ding-Zhu Du and Frank Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1995
+, pages =       "351--451"
+, keywords =    "survey paper"
+, comments =    "includes morphological classification of basic computational geometry"
+, succeeds =    "sw-cgtnd-92"
+, update =      "98.07 icking"
 }
 
 @article{ssw-pmapr-77
-, author =	"K. T. Smith and D. C. Solomon and S. L. Wagner"
-, title =	"Practical and mathematical aspects of the problem of reconstructing objects from radiographs"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	83
-, month =	nov
-, year =	1977
-, pages =	"1227--1270"
-, update =	"98.11 bibrelex"
+, author =      "K. T. Smith and D. C. Solomon and S. L. Wagner"
+, title =       "Practical and mathematical aspects of the problem of reconstructing objects from radiographs"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      83
+, month =       nov
+, year =        1977
+, pages =       "1227--1270"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{spg-flaip-88
-, author =	"T. Smith and G. Peng and P. Gahinet"
-, title =	"A Family of Local, Asynchronous, Iterative, and Parallel Procedures for Solving the Weighted Region Least Cost Path Problem"
-, institution =	"Department of Computer Science, University of California, Santa Barbara"
-, year =	1988
+, author =      "T. Smith and G. Peng and P. Gahinet"
+, title =       "A Family of Local, Asynchronous, Iterative, and Parallel Procedures for Solving the Weighted Region Least Cost Path Problem"
+, institution = "Department of Computer Science, University of California, Santa Barbara"
+, year =        1988
 }
 
 @inproceedings{sg-epesa-90
-, author =	"T. R. Smith and P. Gao"
-, title =	"Experimental performance evaluations on spatial access methods"
-, booktitle =	"Proc. 4th Internat. Sympos. Spatial Data Handling"
-, site =	"Z{\"u}rich"
-, month =	jul
-, year =	1990
-, pages =	"991--1002"
-, update =	"00.11 smid, 00.07 icking, 94.05 franciosa"
+, author =      "T. R. Smith and P. Gao"
+, title =       "Experimental performance evaluations on spatial access methods"
+, booktitle =   "Proc. 4th Internat. Sympos. Spatial Data Handling"
+, site =        "Z{\"u}rich"
+, month =       jul
+, year =        1990
+, pages =       "991--1002"
+, update =      "00.11 smid, 00.07 icking, 94.05 franciosa"
 }
 
 @techreport{s-ptadi-92
-, author =	"W. D. Smith"
-, title =	"A polynomial-time algorithm for deciding the inscribability of graphs"
-, type =	"Manuscript"
-, institution =	"NEC Research Institute"
-, address =	"Princeton, NJ"
-, year =	1992
-, update =	"97.11 bibrelex"
+, author =      "W. D. Smith"
+, title =       "A polynomial-time algorithm for deciding the inscribability of graphs"
+, type =        "Manuscript"
+, institution = "NEC Research Institute"
+, address =     "Princeton, NJ"
+, year =        1992
+, update =      "97.11 bibrelex"
 }
 
 @article{s-hfsmt-92
-, author =	"W. D. Smith"
-, title =	"How to find {Steiner} minimal trees in {Euclidean} $d$-space"
-, journal =	"Algorithmica"
-, volume =	7
-, year =	1992
-, pages =	"137--177"
-, update =	"98.07 bibrelex"
+, author =      "W. D. Smith"
+, title =       "How to find {Steiner} minimal trees in {Euclidean} $d$-space"
+, journal =     "Algorithmica"
+, volume =      7
+, year =        1992
+, pages =       "137--177"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{s-ptdsi-87
-, author =	"W. D. Smith"
-, title =	"Polytope triangulations in $d$-space, improving {Hadamard}'s inequality, and maximal volumes of regular polytopes in hyperbolic $d$-space"
-, type =	"Report"
-, number =	"??"
-, institution =	"Program Appl. Comput. Math., Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1987
+, author =      "W. D. Smith"
+, title =       "Polytope triangulations in $d$-space, improving {Hadamard}'s inequality, and maximal volumes of regular polytopes in hyperbolic $d$-space"
+, type =        "Report"
+, number =      "??"
+, institution = "Program Appl. Comput. Math., Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1987
 }
 
 @phdthesis{s-scgmm-88
-, author =	"W. D. Smith"
-, title =	"Studies in computational geometry motivated by mesh generation"
-, school =	"Priceton Univ."
-, address =	"Princeton, NJ"
-, year =	1988
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "W. D. Smith"
+, title =       "Studies in computational geometry motivated by mesh generation"
+, school =      "Priceton Univ."
+, address =     "Princeton, NJ"
+, year =        1988
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @article{sms-sbgpp-00
-, author =	"S. Smorodinsky and J. S. B. Mitchell and M. Sharir"
-, title =	"Sharp Bounds on Geometric Permutations for Pairwise Disjoint Balls in {$\Re^d$}"
-, journal =	"Discrete Comput. Geom."
-, volume =	23
-, year =	2000
-, pages =	"247--259"
-, update =	"01.04 orourke"
+, author =      "S. Smorodinsky and J. S. B. Mitchell and M. Sharir"
+, title =       "Sharp Bounds on Geometric Permutations for Pairwise Disjoint Balls in {$\Re^d$}"
+, journal =     "Discrete Comput. Geom."
+, volume =      23
+, year =        2000
+, pages =       "247--259"
+, update =      "01.04 orourke"
 }
 
 @article{s-pcouc-71
-, author =	"C. J. Smyth"
-, title =	"On the product of the conjugates outside the unit circle of an algebraic integer"
-, journal =	"Bull. London Math. Soc."
-, volume =	3
-, year =	1971
-, pages =	"169--175"
-, update =	"97.11 bibrelex"
+, author =      "C. J. Smyth"
+, title =       "On the product of the conjugates outside the unit circle of an algebraic integer"
+, journal =     "Bull. London Math. Soc."
+, volume =      3
+, year =        1971
+, pages =       "169--175"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-mcssp-66
-, author =	"P. H. A. Sneath"
-, title =	"A method for curve seeking from scattered points"
-, journal =	"Comput. J."
-, volume =	9
-, year =	1966
-, pages =	"383--391"
+, author =      "P. H. A. Sneath"
+, title =       "A method for curve seeking from scattered points"
+, journal =     "Comput. J."
+, volume =      9
+, year =        1966
+, pages =       "383--391"
 }
 
 @inproceedings{s-gbvtd-01
-, author =	"Jack Snoeyink"
-, title =	"A Geometric Basis for Visualizing Time-Dependent Volume Data"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"13--16"
-, update =	"01.04 icking"
+, author =      "Jack Snoeyink"
+, title =       "A Geometric Basis for Visualizing Time-Dependent Volume Data"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "13--16"
+, update =      "01.04 icking"
 }
 
 @inproceedings{s-tkwsd-90
-, author =	"J. Snoeyink"
-, title =	"A trivial knot whose spanning disks have exponential size"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"139--147"
-, cites =	"a-bt-79, cm-grdg-72, cf-ikt-65, f-pc6ck-89, h-tdnei-61, r-kl-76, rs-iplt-72, s-bdpvv-61, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "J. Snoeyink"
+, title =       "A trivial knot whose spanning disks have exponential size"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "139--147"
+, cites =       "a-bt-79, cm-grdg-72, cf-ikt-65, f-pc6ck-89, h-tdnei-61, r-kl-76, rs-iplt-72, s-bdpvv-61, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @unpublished{s-edpti-88
-, author =	"J. Snoeyink"
-, title =	"Etch: A drawing program that illustrates geometric duality"
-, year =	1988
-, note =	"Unpublished article"
-, update =	"98.03 bibrelex"
+, author =      "J. Snoeyink"
+, title =       "Etch: A drawing program that illustrates geometric duality"
+, year =        1988
+, note =        "Unpublished article"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{s-pl-97
-, author =	"J. Snoeyink"
-, title =	"Point location"
-, chapter =	30
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"559--574"
-, cites =	"a-bt-79, cm-grdg-72, cf-ikt-65, f-pc6ck-89, h-tdnei-61, r-kl-76, rs-iplt-72, s-bdpvv-61, ZZZ"
-, update =	"97.11 bibrelex+orourke"
+, author =      "J. Snoeyink"
+, title =       "Point location"
+, chapter =     30
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "559--574"
+, cites =       "a-bt-79, cm-grdg-72, cf-ikt-65, f-pc6ck-89, h-tdnei-61, r-kl-76, rs-iplt-72, s-bdpvv-61, ZZZ"
+, update =      "97.11 bibrelex+orourke"
 }
 
 @article{s-nvapo-91
-, author =	"J. Snoeyink"
-, title =	"The number of views of axis-parallel objects"
-, journal =	"Algorithms Rev."
-, volume =	2
-, year =	1991
-, pages =	"27--32"
+, author =      "J. Snoeyink"
+, title =       "The number of views of axis-parallel objects"
+, journal =     "Algorithms Rev."
+, volume =      2
+, year =        1991
+, pages =       "27--32"
 }
 
 @inproceedings{s-votcb-93
-, author =	"J. Snoeyink"
-, title =	"Video: Objects that cannot be taken apart with two hands"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	405
-, keywords =	"video review"
-, succeeds =	"ss-otcbt-93"
-, cites =	"fh-usk-63, n-pa-88, ss-otcbt-93, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "J. Snoeyink"
+, title =       "Video: Objects that cannot be taken apart with two hands"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       405
+, keywords =    "video review"
+, succeeds =    "ss-otcbt-93"
+, cites =       "fh-usk-63, n-pa-88, ss-otcbt-93, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @inproceedings{sh-sac-89
-, author =	"J. Snoeyink and J. Hershberger"
-, title =	"Sweeping arrangements of curves"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"354--363"
-, cites =	"ass-sulbl-87, bo-arcgi-79, bgs-op-74, ce-oails-88, cgl-pgd-85, dghs-eafcr-88, e-acg-87, egppss-acptc-88, eg-tsa-86, eos-calha-86, epss-lebfi-87, g-pcbgs-80, gp-pgcsc-80, gp-tpdnd-81, gp-tod-82, gp-sccca-84, gp-httpa-82, gy-frcg-86, g-cp-67, g-ah-71, g-as-72, g-ibs-70, hs-ndssg-86, jk-spals-88, l-dtdpe-26, ms-rcibt-88, mo-al3sd-88, m-vigau-88p, ow-nmcvg-88, p-hresr-84, r-kl-76, sh-gip-76, scklps-gadss-86, ws-prnds-88, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "J. Snoeyink and J. Hershberger"
+, title =       "Sweeping arrangements of curves"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "354--363"
+, cites =       "ass-sulbl-87, bo-arcgi-79, bgs-op-74, ce-oails-88, cgl-pgd-85, dghs-eafcr-88, e-acg-87, egppss-acptc-88, eg-tsa-86, eos-calha-86, epss-lebfi-87, g-pcbgs-80, gp-pgcsc-80, gp-tpdnd-81, gp-tod-82, gp-sccca-84, gp-httpa-82, gy-frcg-86, g-cp-67, g-ah-71, g-as-72, g-ibs-70, hs-ndssg-86, jk-spals-88, l-dtdpe-26, ms-rcibt-88, mo-al3sd-88, m-vigau-88p, ow-nmcvg-88, p-hresr-84, r-kl-76, sh-gip-76, scklps-gadss-86, ws-prnds-88, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{sh-sac-91
-, author =	"J. Snoeyink and J. Hershberger"
-, title =	"Sweeping arrangements of curves"
-, booktitle =	"Discrete and Computational Geometry: Papers from the DIMACS Special Year"
-, publisher =	"American Mathematical Society, Association for Computing Machinery"
-, address =	"Providence, RI"
-, year =	1991
-, pages =	"309--349"
-, update =	"99.11 bibrelex, 97.11 bibrelex"
+, author =      "J. Snoeyink and J. Hershberger"
+, title =       "Sweeping arrangements of curves"
+, booktitle =   "Discrete and Computational Geometry: Papers from the DIMACS Special Year"
+, publisher =   "American Mathematical Society, Association for Computing Machinery"
+, address =     "Providence, RI"
+, year =        1991
+, pages =       "309--349"
+, update =      "99.11 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{sk-goirc-97
-, author =	"J. Snoeyink and M. van Kreveld"
-, title =	"Good orders for incremental (re)constructions"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"400--402"
-, cites =	"bkos-cgaa-97, be-mgot-92i, cns-l5cap-81, d-gc-95, dl-cvdrp-91, gks-ricdv-92, h-pm-96, k-osps-83, m-cgitr-93, pflm-tin-78, rsst-efcpg-96, s-barga-93, s-mplbc-85, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "J. Snoeyink and M. van Kreveld"
+, title =       "Good orders for incremental (re)constructions"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "400--402"
+, cites =       "bkos-cgaa-97, be-mgot-92i, cns-l5cap-81, d-gc-95, dl-cvdrp-91, gks-ricdv-92, h-pm-96, k-osps-83, m-cgitr-93, pflm-tin-78, rsst-efcpg-96, s-barga-93, s-mplbc-85, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{sk-ltrdt-97
-, author =	"J. Snoeyink and M. van Kreveld"
-, title =	"Linear-time reconstruction of {D}elaunay triangulations with applications"
-, booktitle =	"Proc. Annu. European Sympos. Algorithms"
-, nickname =	"ESA'97"
-, series =	"Lecture Notes Comput. Sci."
-, number =	1284
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"459--471"
-, update =	"98.07 oostrum"
+, author =      "J. Snoeyink and M. van Kreveld"
+, title =       "Linear-time reconstruction of {D}elaunay triangulations with applications"
+, booktitle =   "Proc. Annu. European Sympos. Algorithms"
+, nickname =    "ESA'97"
+, series =      "Lecture Notes Comput. Sci."
+, number =      1284
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "459--471"
+, update =      "98.07 oostrum"
 }
 
 @inproceedings{ss-otcbt-93
-, author =	"J. Snoeyink and J. Stolfi"
-, title =	"Objects that cannot be taken apart with two hands"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"247--256"
-, precedes =	"s-votcb-93"
-, cites =	"c-pwpd-91, d-rbwdo-84, b-navw-54, b-p11a-55, fh-usk-63, gy-tsr-80, m-camap-91, mss-esmpg-87, n-pa-88, p-gsa-89, p-pplr-90, wm-paimt-92, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "J. Snoeyink and J. Stolfi"
+, title =       "Objects that cannot be taken apart with two hands"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "247--256"
+, precedes =    "s-votcb-93"
+, cites =       "c-pwpd-91, d-rbwdo-84, b-navw-54, b-p11a-55, fh-usk-63, gy-tsr-80, m-camap-91, mss-esmpg-87, n-pa-88, p-gsa-89, p-pplr-90, wm-paimt-92, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{ss-otcbt-94
-, author =	"J. Snoeyink and J. Stolfi"
-, title =	"Objects that cannot be taken apart with two hands"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"367--384"
-, update =	"95.01 smid"
+, author =      "J. Snoeyink and J. Stolfi"
+, title =       "Objects that cannot be taken apart with two hands"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "367--384"
+, update =      "95.01 smid"
 }
 
 @techreport{sz-grmp-93
-, author =	"Jack Snoeyink and Chong Zhu"
-, title =	"Generating random monotone polygons"
-, type =	"Technical Report"
-, number =	"93-28"
-, institution =	"Dept. of Computer Science, University of British Columbia"
-, month =	sep
-, year =	1993
-, update =	"98.11 bibrelex"
+, author =      "Jack Snoeyink and Chong Zhu"
+, title =       "Generating random monotone polygons"
+, type =        "Technical Report"
+, number =      "93-28"
+, institution = "Dept. of Computer Science, University of British Columbia"
+, month =       sep
+, year =        1993
+, update =      "98.11 bibrelex"
 }
 
 @techreport{s-tacg-90
-, author =	"J. S. Snoeyink"
-, title =	"Topological Approaches in Computational Geometry"
-, type =	"Report"
-, number =	"STAN-CS-90-1331"
-, institution =	"Stanford Univ."
-, address =	"Standford, CA"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "J. S. Snoeyink"
+, title =       "Topological Approaches in Computational Geometry"
+, type =        "Report"
+, number =      "STAN-CS-90-1331"
+, institution = "Stanford Univ."
+, address =     "Standford, CA"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @article{swfcb-immcb-93
-, author =	"J. M. Snyder and A. R. Woodbury and K. Fleischer and B. Currin and A. H. Barr"
-, title =	"Interval methods for multi-point collisions between time-dependent curved surfaces"
-, journal =	"Comput. Graph."
-, volume =	27
-, month =	aug
-, year =	1993
-, pages =	"321--334"
-, note =	"Proc. SIGGRAPH '93"
-, update =	"98.03 bibrelex"
+, author =      "J. M. Snyder and A. R. Woodbury and K. Fleischer and B. Currin and A. H. Barr"
+, title =       "Interval methods for multi-point collisions between time-dependent curved surfaces"
+, journal =     "Comput. Graph."
+, volume =      27
+, month =       aug
+, year =        1993
+, pages =       "321--334"
+, note =        "Proc. SIGGRAPH '93"
+, update =      "98.03 bibrelex"
 }
 
 @article{ss-chrw-93
-, author =	"T. Snyder and J. M. Steele"
-, title =	"Convex hulls of random walks"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	117
-, number =	4
-, year =	1993
-, pages =	"1165--1173"
-, update =	"95.01 mitchell"
+, author =      "T. Snyder and J. M. Steele"
+, title =       "Convex hulls of random walks"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      117
+, number =      4
+, year =        1993
+, pages =       "1165--1173"
+, update =      "95.01 mitchell"
 }
 
 @phdthesis{s-awcls-87
-, author =	"T. L. Snyder"
-, title =	"Asymptotic worst case lengths in some problems from classical Computational geometry and Combinatorial Optimization"
-, school =	"Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1987
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "T. L. Snyder"
+, title =       "Asymptotic worst case lengths in some problems from classical Computational geometry and Combinatorial Optimization"
+, school =      "Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1987
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @unpublished{s-lbrst-89
-, author =	"T. L. Snyder"
-, title =	"Lower bounds for rectilinear {Steiner} trees in bounded space"
-, year =	1989
-, note =	"Submitted for publication"
-, update =	"97.11 bibrelex"
+, author =      "T. L. Snyder"
+, title =       "Lower bounds for rectilinear {Steiner} trees in bounded space"
+, year =        1989
+, note =        "Submitted for publication"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-lbrst-91
-, author =	"T. L. Snyder"
-, title =	"Lower bounds for rectilinear {Steiner} trees in bounded space"
-, journal =	"Inform. Process. Lett."
-, volume =	37
-, year =	1991
-, pages =	"71--74"
-, update =	"98.03 bibrelex"
+, author =      "T. L. Snyder"
+, title =       "Lower bounds for rectilinear {Steiner} trees in bounded space"
+, journal =     "Inform. Process. Lett."
+, volume =      37
+, year =        1991
+, pages =       "71--74"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{s-mrsta-90
-, author =	"T. L. Snyder"
-, title =	"On minimal rectilinear {Steiner} trees in all dimensions"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"311--320"
-, cites =	"bhh-sptmp-59, b-tprrs-88, cg-stbps-81, ch-lmrst-79, cr-wim-41, f-splrt-55, fhp-gtadm-79, gj-rstpi-77, ggj-sncgp-76, gp-smt-68, g-qwcet-88, gr-ibtsp-87, h-sprd-66, h-smtrd-76, k-hlcet-87, m-ps-61, m-lotcs-84, sr-lvsta-75, s-scgmm-88, s-awcls-87, s-sfars-89, s-lbrst-89, ss-wcgmu-90, s-sefnl-81, ss-wcgrs-89, srp-tspmm-83, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "T. L. Snyder"
+, title =       "On minimal rectilinear {Steiner} trees in all dimensions"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "311--320"
+, cites =       "bhh-sptmp-59, b-tprrs-88, cg-stbps-81, ch-lmrst-79, cr-wim-41, f-splrt-55, fhp-gtadm-79, gj-rstpi-77, ggj-sncgp-76, gp-smt-68, g-qwcet-88, gr-ibtsp-87, h-sprd-66, h-smtrd-76, k-hlcet-87, m-ps-61, m-lotcs-84, sr-lvsta-75, s-scgmm-88, s-awcls-87, s-sfars-89, s-lbrst-89, ss-wcgmu-90, s-sefnl-81, ss-wcgrs-89, srp-tspmm-83, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{s-wcmrs-92
-, author =	"T. L. Snyder"
-, title =	"Worst-case minimal rectilinear {Steiner} trees in all dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	8
-, year =	1992
-, pages =	"73--92"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "T. L. Snyder"
+, title =       "Worst-case minimal rectilinear {Steiner} trees in all dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      8
+, year =        1992
+, pages =       "73--92"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @inproceedings{ss-piets-92
-, author =	"T. L. Snyder and J. M. Steele"
-, title =	"A priori inequalities for the {Euclidean} traveling salesman"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"344--349"
-, cites =	"f-splrt-55, k-hlcet-89, n-ps-82, s-pwcac-90, ss-wcgrs-89, v-sptnp-51, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "T. L. Snyder and J. M. Steele"
+, title =       "A priori inequalities for the {Euclidean} traveling salesman"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "344--349"
+, cites =       "f-splrt-55, k-hlcet-89, n-ps-82, s-pwcac-90, ss-wcgrs-89, v-sptnp-51, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ss-epsts-93
-, author =	"T. L. Snyder and J. M. Steele"
-, title =	"Equidistribution of Point Sets for the Traveling Salesman and Related Problems"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"462--466"
-, update =	"93.09 milone+mitchell"
+, author =      "T. L. Snyder and J. M. Steele"
+, title =       "Equidistribution of Point Sets for the Traveling Salesman and Related Problems"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "462--466"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{ss-wcgmu-90
-, author =	"T. L. Snyder and J. M. Steele"
-, title =	"Worst-Case greedy matchings in the unit $d$-cube"
-, journal =	"Networks"
-, volume =	20
-, year =	1990
-, pages =	"779--800"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "T. L. Snyder and J. M. Steele"
+, title =       "Worst-Case greedy matchings in the unit $d$-cube"
+, journal =     "Networks"
+, volume =      20
+, year =        1990
+, pages =       "779--800"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{ss-wctps-94
-, author =	"T. L. Snyder and J. M. Steele"
-, title =	"Worst-Case {TSP} Point Sets in All Dimensions are Asymptotically Equidistributed"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"147--152"
-, cites =	"bhh-sptmp-59, f-splrt-55, g-qwcet-88, hlp-i-64, k-hlcet-89, k-pascs-76, s-wcmrs-92, ss-epsts-93, ss-wcgrs-89, srp-tspmm-83, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "T. L. Snyder and J. M. Steele"
+, title =       "Worst-Case {TSP} Point Sets in All Dimensions are Asymptotically Equidistributed"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "147--152"
+, cites =       "bhh-sptmp-59, f-splrt-55, g-qwcet-88, hlp-i-64, k-hlcet-89, k-pascs-76, s-wcmrs-92, ss-epsts-93, ss-wcgrs-89, srp-tspmm-83, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @article{st-ccdac-82
-, author =	"W. E. Snyder and D. A. Tang"
-, title =	"Comments on ``{A} counterexample to a diameter algorithm for convex polygons''"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-4"
-, year =	1982
-, pages =	309
-, succeeds =	"bt-cdacp-82"
+, author =      "W. E. Snyder and D. A. Tang"
+, title =       "Comments on ``{A} counterexample to a diameter algorithm for convex polygons''"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-4"
+, year =        1982
+, pages =       309
+, succeeds =    "bt-cdacp-82"
 }
 
 @article{st-fer-80
-, author =	"W. E. Snyder and D. A. Tang"
-, title =	"Finding the extrema of a region"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	"PAMI-2"
-, year =	1980
-, pages =	"266--269"
-, keywords =	"diameter, polygons"
-, precedes =	"bt-cdacp-82"
+, author =      "W. E. Snyder and D. A. Tang"
+, title =       "Finding the extrema of a region"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      "PAMI-2"
+, year =        1980
+, pages =       "266--269"
+, keywords =    "diameter, polygons"
+, precedes =    "bt-cdacp-82"
 }
 
 @techreport{s-aedsd-92
-, author =	"J. Soares"
-, title =	"Approximating {Euclidean} distances by small degree graphs"
-, type =	"Technical {Report}"
-, number =	"92-05"
-, institution =	"Univ. Chicago"
-, year =	1992
-, update =	"97.11 bibrelex"
+, author =      "J. Soares"
+, title =       "Approximating {Euclidean} distances by small degree graphs"
+, type =        "Technical {Report}"
+, number =      "92-05"
+, institution = "Univ. Chicago"
+, year =        1992
+, update =      "97.11 bibrelex"
 }
 
 @article{s-aedsd-94
-, author =	"J. Soares"
-, title =	"Approximating {Euclidean} distances by small degree graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	11
-, year =	1994
-, pages =	"213--233"
-, update =	"94.05 smid"
+, author =      "J. Soares"
+, title =       "Approximating {Euclidean} distances by small degree graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      11
+, year =        1994
+, pages =       "213--233"
+, update =      "94.05 smid"
 }
 
 @phdthesis{s-gs-92
-, author =	"J. Soares"
-, title =	"Graph Spanners"
-, school =	"Univ. Chicago"
-, address =	"Chicago, IL"
-, year =	1992
-, note =	"Report CS 92-14"
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "J. Soares"
+, title =       "Graph Spanners"
+, school =      "Univ. Chicago"
+, address =     "Chicago, IL"
+, year =        1992
+, note =        "Report CS 92-14"
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{s-gss-92
-, author =	"J. Soares"
-, title =	"Graph spanners: a survey"
-, journal =	"Congr. Numer."
-, volume =	89
-, year =	1992
-, pages =	"225--238"
-, update =	"98.03 smid"
+, author =      "J. Soares"
+, title =       "Graph spanners: a survey"
+, journal =     "Congr. Numer."
+, volume =      89
+, year =        1992
+, pages =       "225--238"
+, update =      "98.03 smid"
 }
 
 @unpublished{s-s-91
-, author =	"J. Soares"
-, title =	"Spanners"
-, year =	1991
-, note =	"Unpublished Manuscript"
-, update =	"97.11 bibrelex"
+, author =      "J. Soares"
+, title =       "Spanners"
+, year =        1991
+, note =        "Unpublished Manuscript"
+, update =      "97.11 bibrelex"
 }
 
 @book{s-hb-70
-, author =	"H. A. Sober"
-, title =	"Handbook of Biochemistry"
-, edition =	"2nd"
-, publisher =	"The Chemical Rubber Co."
-, year =	1970
-, update =	"98.03 bibrelex"
+, author =      "H. A. Sober"
+, title =       "Handbook of Biochemistry"
+, edition =     "2nd"
+, publisher =   "The Chemical Rubber Co."
+, year =        1970
+, update =      "98.03 bibrelex"
 }
 
 @article{s-ebrtd-89
-, author =	"C. Sobhanpanah"
-, title =	"Extension of a boundary representation technique for the description of $n$-dimensional polytopes"
-, journal =	"Comput. Graph."
-, volume =	13
-, number =	1
-, year =	1989
-, pages =	"17--23"
-, update =	"98.07 bibrelex"
+, author =      "C. Sobhanpanah"
+, title =       "Extension of a boundary representation technique for the description of $n$-dimensional polytopes"
+, journal =     "Comput. Graph."
+, volume =      13
+, number =      1
+, year =        1989
+, pages =       "17--23"
+, update =      "98.07 bibrelex"
 }
 
 @article{sb-ic3dm-91
-, author =	"W. Sohrt and B. D. Br{\"u}derlin"
-, title =	"Interaction with constraints in {3D} modeling"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	4
-, year =	1991
-, pages =	"405--425"
-, keywords =	"geometric constraints, graphical interactive modeling, CAD/CAM"
+, author =      "W. Sohrt and B. D. Br{\"u}derlin"
+, title =       "Interaction with constraints in {3D} modeling"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      4
+, year =        1991
+, pages =       "405--425"
+, keywords =    "geometric constraints, graphical interactive modeling, CAD/CAM"
 }
 
 @article{s-cach-83
-, author =	"E. Soisalon-Soininen"
-, title =	"On computing approximate convex hulls"
-, journal =	"Inform. Process. Lett."
-, volume =	16
-, year =	1983
-, pages =	"121--126"
-, keywords =	"designing algorithms, convex hull, two-dimensional, approximation"
+, author =      "E. Soisalon-Soininen"
+, title =       "On computing approximate convex hulls"
+, journal =     "Inform. Process. Lett."
+, volume =      16
+, year =        1983
+, pages =       "121--126"
+, keywords =    "designing algorithms, convex hull, two-dimensional, approximation"
 }
 
 @inproceedings{sw-oatsd-82
-, author =	"E. Soisalon-Soininen and D. Wood"
-, title =	"An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems"
-, booktitle =	"Proc. ACM SIGACT-SIGMOD Conf. Principles Database Systems"
-, year =	1982
-, pages =	"108--116"
+, author =      "E. Soisalon-Soininen and D. Wood"
+, title =       "An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems"
+, booktitle =   "Proc. ACM SIGACT-SIGMOD Conf. Principles Database Systems"
+, year =        1982
+, pages =       "108--116"
 }
 
 @article{sw-oaccs-84
-, author =	"E. Soisalon-Soininen and D. Wood"
-, title =	"Optimal algorithms to compute the closure of a set of iso-rectangles"
-, journal =	"J. Algorithms"
-, volume =	5
-, year =	1984
-, pages =	"199--214"
+, author =      "E. Soisalon-Soininen and D. Wood"
+, title =       "Optimal algorithms to compute the closure of a set of iso-rectangles"
+, journal =     "J. Algorithms"
+, volume =      5
+, year =        1984
+, pages =       "199--214"
 }
 
 @inproceedings{s-tseaj-97
-, author =	"Eduard Sojka"
-, title =	"Three Simple and Efficient Algorithms for {Jordan} Sorting"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"24--26"
-, cites =	"fntv-sltjs-90, hmrt-sjslt-86, ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Eduard Sojka"
+, title =       "Three Simple and Efficient Algorithms for {Jordan} Sorting"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "24--26"
+, cites =       "fntv-sltjs-90, hmrt-sjslt-86, ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @book{ss-pnt-63
-, author =	"R. R. Sokal and P. H. Sneath"
-, title =	"Principles of Numerical Taxonomy"
-, publisher =	"W. H. Freeman"
-, address =	"San Francisco, CA"
-, year =	1963
-, update =	"98.03 bibrelex"
+, author =      "R. R. Sokal and P. H. Sneath"
+, title =       "Principles of Numerical Taxonomy"
+, publisher =   "W. H. Freeman"
+, address =     "San Francisco, CA"
+, year =        1963
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{sg-mdrpa-92
-, author =	"V. Soltan and A. Gorpinevich"
-, title =	"Minimum dissection of rectilinear polygon with arbitrary holes into rectangles"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, pages =	"296--302"
-, keywords =	"polygons, decomposition, rectangles, isothetic"
-, precedes =	"sg-mdrpa-93"
-, cites =	"l-fmprp-83, l-ompa-84, ia-eaggs-86, l-pnrh-82, ZZZ"
-, update =	"97.11 bibrelex, 95.09 korneenko, 93.09 rote"
+, author =      "V. Soltan and A. Gorpinevich"
+, title =       "Minimum dissection of rectilinear polygon with arbitrary holes into rectangles"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, pages =       "296--302"
+, keywords =    "polygons, decomposition, rectangles, isothetic"
+, precedes =    "sg-mdrpa-93"
+, cites =       "l-fmprp-83, l-ompa-84, ia-eaggs-86, l-pnrh-82, ZZZ"
+, update =      "97.11 bibrelex, 95.09 korneenko, 93.09 rote"
 }
 
 @article{sg-mdrpa-93
-, author =	"V. Soltan and A. Gorpinevich"
-, title =	"Minimum dissection of rectilinear polygon with arbitrary holes into rectangles"
-, journal =	"Discrete Comput. Geom."
-, volume =	9
-, year =	1993
-, pages =	"57--79"
-, keywords =	"polygons, decomposition, rectangles, isothetic"
-, succeeds =	"sg-mdrpa-92"
-, cites =	"l-pnrh-82"
-, update =	"95.09 korneenko, 93.09 rote"
+, author =      "V. Soltan and A. Gorpinevich"
+, title =       "Minimum dissection of rectilinear polygon with arbitrary holes into rectangles"
+, journal =     "Discrete Comput. Geom."
+, volume =      9
+, year =        1993
+, pages =       "57--79"
+, keywords =    "polygons, decomposition, rectangles, isothetic"
+, succeeds =    "sg-mdrpa-92"
+, cites =       "l-pnrh-82"
+, update =      "95.09 korneenko, 93.09 rote"
 }
 
 @phdthesis{s-cpfrt-88
-, author =	"J. Solymosi"
-, title =	"Combinatorial problems in finite {Ramsey} theory"
-, type =	"Master's Thesis"
-, school =	"E{\"{o}}tv{\"{o}}s University"
-, address =	"Budapest"
-, year =	1988
-, keywords =	"doctoral thesis"
-, update =	"02.03 devillers"
+, author =      "J. Solymosi"
+, title =       "Combinatorial problems in finite {Ramsey} theory"
+, type =        "Master's Thesis"
+, school =      "E{\"{o}}tv{\"{o}}s University"
+, address =     "Budapest"
+, year =        1988
+, keywords =    "doctoral thesis"
+, update =      "02.03 devillers"
 }
 
 @article{st-ddp-01
-, author =	"J. Solymosi and Cs. D. T\'{o}th"
-, title =	"Distinct distances in the plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	25
-, number =	4
-, year =	2001
-, pages =	"629--634"
-, update =	"02.03 orourke"
+, author =      "J. Solymosi and Cs. D. T\'{o}th"
+, title =       "Distinct distances in the plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      25
+, number =      4
+, year =        2001
+, pages =       "629--634"
+, update =      "02.03 orourke"
 }
 
 @book{s-agtd-34
-, author =	"D. M. Y. Sommerville"
-, title =	"Analytical Geometry in Three Dimensions"
-, publisher =	"Cambridge University Press"
-, address =	"Cambridge"
-, year =	1934
-, keywords =	"geometry, lines"
-, update =	"98.11 bibrelex, 98.03 agarwal, 96.05 agarwal"
+, author =      "D. M. Y. Sommerville"
+, title =       "Analytical Geometry in Three Dimensions"
+, publisher =   "Cambridge University Press"
+, address =     "Cambridge"
+, year =        1934
+, keywords =    "geometry, lines"
+, update =      "98.11 bibrelex, 98.03 agarwal, 96.05 agarwal"
 }
 
 @techreport{ss-tocm-86
-, author =	"E. Sonatg and H. Sussmann"
-, title =	"Time-Optimal Control of Manipulators"
-, institution =	"Dept. Math., Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "E. Sonatg and H. Sussmann"
+, title =       "Time-Optimal Control of Manipulators"
+, institution = "Dept. Math., Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @article{s-sooau-84
-, author =	"G. Sonnevend"
-, title =	"Sequential optimal order algorithms for the uniform approximation of functions with convex $r$-th derivates"
-, journal =	"Analysis Mathematica"
-, volume =	10
-, year =	1984
-, pages =	"311--335"
-, update =	"98.07 bibrelex"
+, author =      "G. Sonnevend"
+, title =       "Sequential optimal order algorithms for the uniform approximation of functions with convex $r$-th derivates"
+, journal =     "Analysis Mathematica"
+, volume =      10
+, year =        1984
+, pages =       "311--335"
+, update =      "98.07 bibrelex"
 }
 
 @article{s-sdbh-89
-, author =	"?? Sontag"
-, title =	"Sigmoids distinguish better than heavisides"
-, journal =	"Neural Computation"
-, volume =	1
-, year =	1989
-, pages =	"470--472"
-, update =	"98.07 bibrelex"
+, author =      "?? Sontag"
+, title =       "Sigmoids distinguish better than heavisides"
+, journal =     "Neural Computation"
+, volume =      1
+, year =        1989
+, pages =       "470--472"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ss-rtoct-85
-, author =	"E. Sontag and H. Sussmann"
-, title =	"Remarks on the Time-Optimal Control of Two-Link Manipulators"
-, booktitle =	"Proc. 24th Conf. Decision Control"
-, site =	"Ft. Lauderdale"
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "E. Sontag and H. Sussmann"
+, title =       "Remarks on the Time-Optimal Control of Two-Link Manipulators"
+, booktitle =   "Proc. 24th Conf. Decision Control"
+, site =        "Ft. Lauderdale"
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @article{s-tfga-94
-, author =	"J. Sorenson"
-, title =	"Two fast {GCD} algorithms"
-, journal =	"J. Algorithms"
-, volume =	16
-, year =	1994
-, pages =	"110--144"
-, update =	"97.11 bibrelex"
+, author =      "J. Sorenson"
+, title =       "Two fast {GCD} algorithms"
+, journal =     "J. Algorithms"
+, volume =      16
+, year =        1994
+, pages =       "110--144"
+, update =      "97.11 bibrelex"
 }
 
 @article{st-gcapr-00
-, author =	"M. Soss and G. T. Toussaint"
-, title =	"Geometric and computational aspects of polymer reconfiguration", journal = "J. Math. Chemistry"
-, volume =	27
-, number =	4
-, year =	2000
-, pages =	"303--318"
-, update =	"01.07 orourke"
+, author =      "M. Soss and G. T. Toussaint"
+, title =       "Geometric and computational aspects of polymer reconfiguration", journal = "J. Math. Chemistry"
+, volume =      27
+, number =      4
+, year =        2000
+, pages =       "303--318"
+, update =      "01.07 orourke"
 }
 
 @techreport{st-rp3dl-00
-, author =	"M. Soss and G. T. Toussaint"
-, title =	"Reconfiguring polymer-like {3D} linkages"
-, number =	"SOCS-00.2"
-, institution =	"McGill Univ., Montreal"
-, year =	2000
-, update =	"01.04 orourke"
+, author =      "M. Soss and G. T. Toussaint"
+, title =       "Reconfiguring polymer-like {3D} linkages"
+, number =      "SOCS-00.2"
+, institution = "McGill Univ., Montreal"
+, year =        2000
+, update =      "01.04 orourke"
 }
 
 @inproceedings{sfl-srpc-94
-, author =	"P. Sou{\`e}res and J.-Y. Fourquet and J.-P. Laumond"
-, title =	"Set of reachable positions for a car"
-, booktitle =	"IEEE Transaction on Automatic Control"
-, year =	1994
-, pages =	""
-, note =	"to appear"
-, update =	"94.05 devillers"
+, author =      "P. Sou{\`e}res and J.-Y. Fourquet and J.-P. Laumond"
+, title =       "Set of reachable positions for a car"
+, booktitle =   "IEEE Transaction on Automatic Control"
+, year =        1994
+, pages =       ""
+, note =        "to appear"
+, update =      "94.05 devillers"
 }
 
 @techreport{sl-sdpcc-92
-, author =	"P. Sou{\`e}res and J.-P. Laumond"
-, title =	"Synth{\`e}se des plus courts chemins pour la voiture de Reeds et Shepp"
-, type =	"Research {Report}"
-, number =	"LAAS/CNRS 92234"
-, institution =	"LAAS"
-, address =	"Toulouse, France"
-, year =	1992
+, author =      "P. Sou{\`e}res and J.-P. Laumond"
+, title =       "Synth{\`e}se des plus courts chemins pour la voiture de Reeds et Shepp"
+, type =        "Research {Report}"
+, number =      "LAAS/CNRS 92234"
+, institution = "LAAS"
+, address =     "Toulouse, France"
+, year =        1992
 }
 
 @article{sp-frsms-96
-, author =	"A. I. Sourin and A. A. Pasko"
-, title =	"Function Representation for Sweeping by a Moving Solid"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	2
-, number =	1
-, month =	mar
-, year =	1996
-, pages =	"11--18"
-, update =	"96.09 held"
+, author =      "A. I. Sourin and A. A. Pasko"
+, title =       "Function Representation for Sweeping by a Moving Solid"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      2
+, number =      1
+, month =       mar
+, year =        1996
+, pages =       "11--18"
+, update =      "96.09 held"
 }
 
 @book{s-rmes-40
-, author =	"R. V. Southwell"
-, title =	"Relaxation Methods in Engineering Science"
-, publisher =	"Oxford University Press"
-, year =	1940
-, update =	"98.03 bibrelex"
+, author =      "R. V. Southwell"
+, title =       "Relaxation Methods in Engineering Science"
+, publisher =   "Oxford University Press"
+, year =        1940
+, update =      "98.03 bibrelex"
 }
 
 @techreport{sw-cplh-94
-, author =	"Diane Souvaine and Rephael Wenger"
-, title =	"Constructing Piecewise Linear Homeomorphisms"
-, type =	"Technical Report"
-, number =	"94--52"
-, institution =	"DIMACS"
-, address =	"New Brunswick, New Jersey"
-, year =	1994
-, update =	"01.07 wenger"
+, author =      "Diane Souvaine and Rephael Wenger"
+, title =       "Constructing Piecewise Linear Homeomorphisms"
+, type =        "Technical Report"
+, number =      "94--52"
+, institution = "DIMACS"
+, address =     "New Brunswick, New Jersey"
+, year =        1994
+, update =      "01.07 wenger"
 }
 
 @phdthesis{s-cgcw-86
-, author =	"D. L. Souvaine"
-, title =	"Computational geometry in a curved world"
-, type =	"Ph.{D}. Thesis"
-, school =	"Princeton Univ."
-, address =	"Princeton, NJ"
-, year =	1986
-, keywords =	"doctoral thesis, design of algorithms"
-, comments =	"UMI AAC86-29439, 134 pp."
-, precedes =	"ds-cgcw-90"
-, update =	"93.09 jones"
+, author =      "D. L. Souvaine"
+, title =       "Computational geometry in a curved world"
+, type =        "Ph.{D}. Thesis"
+, school =      "Princeton Univ."
+, address =     "Princeton, NJ"
+, year =        1986
+, keywords =    "doctoral thesis, design of algorithms"
+, comments =    "UMI AAC86-29439, 134 pp."
+, precedes =    "ds-cgcw-90"
+, update =      "93.09 jones"
 }
 
 @inproceedings{s-cprop-89
-, author =	"D. L. Souvaine"
-, title =	"The contour problem for restricted-orientation polygons"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	38
+, author =      "D. L. Souvaine"
+, title =       "The contour problem for restricted-orientation polygons"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       38
 }
 
 @techreport{sb-cprop-89
-, author =	"D. L. Souvaine and I. Bjorling-Sachs"
-, title =	"The contour problem for restricted-orientation polygons"
-, type =	"Report"
-, number =	"LCSR-TR-137"
-, institution =	"Lab. Comput. Sci. Res., Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1989
-, keywords =	"contour of union, plane-sweep, segment tree, divide-and-conquer, VLSI"
+, author =      "D. L. Souvaine and I. Bjorling-Sachs"
+, title =       "The contour problem for restricted-orientation polygons"
+, type =        "Report"
+, number =      "LCSR-TR-137"
+, institution = "Lab. Comput. Sci. Res., Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1989
+, keywords =    "contour of union, plane-sweep, segment tree, divide-and-conquer, VLSI"
 }
 
 @article{sb-cprop-92
-, author =	"D. L. Souvaine and I. Bjorling-Sachs"
-, title =	"The Contour Problem for Restricted-Oriented Polygons"
-, journal =	"Proc. IEEE"
-, volume =	80
-, number =	9
-, month =	sep
-, year =	1992
-, pages =	"1449--1470"
-, update =	"93.09 held"
+, author =      "D. L. Souvaine and I. Bjorling-Sachs"
+, title =       "The Contour Problem for Restricted-Oriented Polygons"
+, journal =     "Proc. IEEE"
+, volume =      80
+, number =      9
+, month =       sep
+, year =        1992
+, pages =       "1449--1470"
+, update =      "93.09 held"
 }
 
 @article{ss-tseal-87
-, author =	"D. L. Souvaine and J. M. Steele"
-, title =	"Time- and space- efficient algorithms for least median of squares regression"
-, journal =	"J. Amer. Statist. Assoc."
-, volume =	82
-, year =	1987
-, pages =	"794--801"
-, keywords =	"statistics, optimization, plane-sweep, geometric transformations, points, lines"
+, author =      "D. L. Souvaine and J. M. Steele"
+, title =       "Time- and space- efficient algorithms for least median of squares regression"
+, journal =     "J. Amer. Statist. Assoc."
+, volume =      82
+, year =        1987
+, pages =       "794--801"
+, keywords =    "statistics, optimization, plane-sweep, geometric transformations, points, lines"
 }
 
 @techreport{sv-cp-89t
-, author =	"D. L. Souvaine and C. J. {Van Wyk}"
-, title =	"Clamping a polygon"
-, type =	"Report"
-, number =	"LCSR-TR-98"
-, institution =	"Lab. Comput. Sci. Res., Rutgers Univ."
-, address =	"New Brunswick, NJ"
-, year =	1989
-, keywords =	"clamp, convex polygon, simple polygon"
-, precedes =	"sv-cp-89i"
+, author =      "D. L. Souvaine and C. J. {Van Wyk}"
+, title =       "Clamping a polygon"
+, type =        "Report"
+, number =      "LCSR-TR-98"
+, institution = "Lab. Comput. Sci. Res., Rutgers Univ."
+, address =     "New Brunswick, NJ"
+, year =        1989
+, keywords =    "clamp, convex polygon, simple polygon"
+, precedes =    "sv-cp-89i"
 }
 
 @inproceedings{sv-cp-89i
-, author =	"D. L. Souvaine and C. J. {Van Wyk}"
-, title =	"Clamping a polygon"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	6
-, succeeds =	"sv-cp-89t"
+, author =      "D. L. Souvaine and C. J. {Van Wyk}"
+, title =       "Clamping a polygon"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       6
+, succeeds =    "sv-cp-89t"
 }
 
 @article{sv-cp-94
-, author =	"D. L. Souvaine and C. J. {Van Wyk}"
-, title =	"Clamping a polygon"
-, journal =	"Visual Comput."
-, volume =	10
-, year =	1994
-, pages =	"484--494"
-, update =	"95.01 smid"
+, author =      "D. L. Souvaine and C. J. {Van Wyk}"
+, title =       "Clamping a polygon"
+, journal =     "Visual Comput."
+, volume =      10
+, year =        1994
+, pages =       "484--494"
+, update =      "95.01 smid"
 }
 
 @article{sv-hhcib-90
-, author =	"D. L. Souvaine and C. J. {Van Wyk}"
-, title =	"How hard can it be to draw a pie chart?"
-, journal =	"Math. Mag."
-, volume =	63
-, year =	1990
-, pages =	"165--172"
-, keywords =	"design of algorithms, NP-hard"
+, author =      "D. L. Souvaine and C. J. {Van Wyk}"
+, title =       "How hard can it be to draw a pie chart?"
+, journal =     "Math. Mag."
+, volume =      63
+, year =        1990
+, pages =       "165--172"
+, keywords =    "design of algorithms, NP-hard"
 }
 
 @inproceedings{sy-ccsd-93
-, author =	"Diane L. Souvaine and Chee-Keng Yap"
-, title =	"Combinatorial Complexity of Signed Discs"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"577--588"
-, precedes =	"sy-ccsd-95"
-, update =	"96.09 devillers, 96.05 agarwal, 93.09 smid, 93.05 jones"
+, author =      "Diane L. Souvaine and Chee-Keng Yap"
+, title =       "Combinatorial Complexity of Signed Discs"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "577--588"
+, precedes =    "sy-ccsd-95"
+, update =      "96.09 devillers, 96.05 agarwal, 93.09 smid, 93.05 jones"
 }
 
 @article{sy-ccsd-95
-, author =	"Diane L. Souvaine and Chee-Keng Yap"
-, title =	"Combinatorial Complexity of Signed Discs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"207--223"
-, succeeds =	"sy-ccsd-93"
-, update =	"96.09 devillers"
+, author =      "Diane L. Souvaine and Chee-Keng Yap"
+, title =       "Combinatorial Complexity of Signed Discs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "207--223"
+, succeeds =    "sy-ccsd-93"
+, update =      "96.09 devillers"
 }
 
 @book{s-ac-57
-, author =	"B. Spain"
-, title =	"Analytical Conics"
-, publisher =	"Pergamon Press"
-, year =	1957
-, update =	"98.07 bibrelex"
+, author =      "B. Spain"
+, title =       "Analytical Conics"
+, publisher =   "Pergamon Press"
+, year =        1957
+, update =      "98.07 bibrelex"
 }
 
 @book{s-at-66
-, author =	"E. H. Spanier"
-, title =	"Algebraic Topology"
-, publisher =	"McGraw-Hill Book Company"
-, address =	"New York"
-, year =	1966
-, update =	"97.03 gaertner+salinger"
+, author =      "E. H. Spanier"
+, title =       "Algebraic Topology"
+, publisher =   "McGraw-Hill Book Company"
+, address =     "New York"
+, year =        1966
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{sw-qaisc-85
-, author =	"M. Spann and R. Wilson"
-, title =	"Quadtree Approach to Image Segmentation which Statistical and Spatial Information"
-, journal =	"Pattern Recogn."
-, volume =	18
-, year =	1985
-, pages =	"257--269"
-, update =	"98.07 agarwal"
+, author =      "M. Spann and R. Wilson"
+, title =       "Quadtree Approach to Image Segmentation which Statistical and Spatial Information"
+, journal =     "Pattern Recogn."
+, volume =      18
+, year =        1985
+, pages =       "257--269"
+, update =      "98.07 agarwal"
 }
 
 @inproceedings{s-olsfc-97
-, author =	"H. Sp{\"a}th"
-, title =	"Orthogonal Least Squares Fitting by Conic Sections and other Algebraic Curves and Surfaces with a Special Two-Step Descent Method"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	27
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "H. Sp{\"a}th"
+, title =       "Orthogonal Least Squares Fitting by Conic Sections and other Algebraic Curves and Surfaces with a Special Two-Step Descent Method"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       27
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{sw-olla-87
-, author =	"H. Sp{\"a}th and G. A. Watson"
-, title =	"On orthogonal linear {$L_{1}$} approximation"
-, journal =	"Numer. Math."
-, volume =	51
-, year =	1987
-, pages =	"531--543"
-, update =	"98.03 bibrelex"
+, author =      "H. Sp{\"a}th and G. A. Watson"
+, title =       "On orthogonal linear {$L_{1}$} approximation"
+, journal =     "Numer. Math."
+, volume =      51
+, year =        1987
+, pages =       "531--543"
+, update =      "98.03 bibrelex"
 }
 
 @article{s-adwag-49
-, author =	"W. Specht"
-, title =	"{Absch{\"a}tzungen} der {Wurzeln} algebraischer {Gleichungen}"
-, journal =	"Math. Z."
-, volume =	52
-, year =	1949
-, pages =	"310--321"
-, update =	"97.11 bibrelex"
+, author =      "W. Specht"
+, title =       "{Absch{\"a}tzungen} der {Wurzeln} algebraischer {Gleichungen}"
+, journal =     "Math. Z."
+, volume =      52
+, year =        1949
+, pages =       "310--321"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ss-etstt-97
-, author =	"Bettina Speckmann and Jack Snoeyink"
-, title =	"Easy Triangle Strips for {TIN} Terrain Models"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"239--244"
-, update =	"97.11 jones"
+, author =      "Bettina Speckmann and Jack Snoeyink"
+, title =       "Easy Triangle Strips for {TIN} Terrain Models"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "239--244"
+, update =      "97.11 jones"
 }
 
 @article{s-eaovs-86
-, author =	"T. Speevak"
-, title =	"An efficient algorithm for obtaining the volume of a special kind of pyramid and application to convex polyhedra"
-, journal =	"Math. Comput."
-, volume =	46
-, year =	1986
-, pages =	"531--536"
+, author =      "T. Speevak"
+, title =       "An efficient algorithm for obtaining the volume of a special kind of pyramid and application to convex polyhedra"
+, journal =     "Math. Comput."
+, volume =      46
+, year =        1986
+, pages =       "531--536"
 }
 
 @techreport{s-mmp-91
-, author =	"J.-C. Spehner"
-, title =	"Merging in maps and pavings"
-, type =	"Research {Report}"
-, number =	48
-, institution =	"Laboratoire de Math{\'e}matiques et Informatique, Universit{\'e} des Haute-Alsace"
-, address =	"Mulhouse, France"
-, year =	1991
-, update =	"98.07 bibrelex"
+, author =      "J.-C. Spehner"
+, title =       "Merging in maps and pavings"
+, type =        "Research {Report}"
+, number =      48
+, institution = "Laboratoire de Math{\'e}matiques et Informatique, Universit{\'e} des Haute-Alsace"
+, address =     "Mulhouse, France"
+, year =        1991
+, update =      "98.07 bibrelex"
 }
 
 @article{s-ssds-85
-, author =	"J. Spencer"
-, title =	"Six standard deviations suffice"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	289
-, year =	1985
-, pages =	"679--706"
-, keywords =	"discrepancy, probabilistic method"
-, update =	"94.01 matousek"
+, author =      "J. Spencer"
+, title =       "Six standard deviations suffice"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      289
+, year =        1985
+, pages =       "679--706"
+, keywords =    "discrepancy, probabilistic method"
+, update =      "94.01 matousek"
 }
 
 @book{s-tlpm-87
-, author =	"J. Spencer"
-, title =	"Ten lectures on the probabilistic method"
-, series =	"CBMS-NSF"
-, publisher =	"SIAM"
-, year =	1987
-, update =	"94.05 matousek"
+, author =      "J. Spencer"
+, title =       "Ten lectures on the probabilistic method"
+, series =      "CBMS-NSF"
+, publisher =   "SIAM"
+, year =        1987
+, update =      "94.05 matousek"
 }
 
 @incollection{sst-udep-84
-, author =	"J. Spencer and E. Szemer{\' e}di and W. T. Trotter"
-, title =	"Unit distances in the {Euclidean} plane"
-, editor =	"B. Bollob{\'a}s"
-, booktitle =	"Graph Theory and Combinatorics"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1984
-, pages =	"293--303"
-, update =	"98.07 agarwal, 98.03 agarwal"
+, author =      "J. Spencer and E. Szemer{\' e}di and W. T. Trotter"
+, title =       "Unit distances in the {Euclidean} plane"
+, editor =      "B. Bollob{\'a}s"
+, booktitle =   "Graph Theory and Combinatorics"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1984
+, pages =       "293--303"
+, update =      "98.07 agarwal, 98.03 agarwal"
 }
 
 @techreport{s-cgru-89
-, author =	"J. Spiegels"
-, title =	"Computational geometry in a restricted universe"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1989
-, keywords =	"survey paper, two-dimensional, domination, convex hull, rectangles, subdivisions, range search"
-, update =	"94.05 schwarzkopf"
+, author =      "J. Spiegels"
+, title =       "Computational geometry in a restricted universe"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1989
+, keywords =    "survey paper, two-dimensional, domination, convex hull, rectangles, subdivisions, range search"
+, update =      "94.05 schwarzkopf"
 }
 
 @inproceedings{st-dpps-96
-, author =	"Daniel A. Spielman and Shang-Hua Teng"
-, title =	"Disk Packings and Planar Separators"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"349--358"
-, cites =	"ast-ps-94, a-cpls-70, a-cpfvl-70, pa-cg-95, cgt-pumlp-96, cemst-acpir-93, d-pppg-82, e-acg-87, emt-dltag-93, f-slrpg-48, fpp-sssfe-88, gl-cslsp-81, g-iaspg-86, gm-psen-90, hlp-i-52, k-kdka-36, lt-stpg-79, lrt-gnd-79, m-fsscs-86, mtv-ugags-91, mttv-gsfem-95, mt-sttd-90, t-pssug-90, t-pdfip-80, t-gt3m-88, t-crg-60, t-hdg-63, ZZZ"
-, update =	"97.11 bibrelex, 96.05 efrat"
+, author =      "Daniel A. Spielman and Shang-Hua Teng"
+, title =       "Disk Packings and Planar Separators"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "349--358"
+, cites =       "ast-ps-94, a-cpls-70, a-cpfvl-70, pa-cg-95, cgt-pumlp-96, cemst-acpir-93, d-pppg-82, e-acg-87, emt-dltag-93, f-slrpg-48, fpp-sssfe-88, gl-cslsp-81, g-iaspg-86, gm-psen-90, hlp-i-52, k-kdka-36, lt-stpg-79, lrt-gnd-79, m-fsscs-86, mtv-ugags-91, mttv-gsfem-95, mt-sttd-90, t-pssug-90, t-pdfip-80, t-gt3m-88, t-crg-60, t-hdg-63, ZZZ"
+, update =      "97.11 bibrelex, 96.05 efrat"
 }
 
 @techreport{sy-ccmc-83
-, author =	"P. Spirakis and C. Yap"
-, title =	"On the combinatorial complexity of motion coordination"
-, type =	"Report"
-, number =	76
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1983
+, author =      "P. Spirakis and C. Yap"
+, title =       "On the combinatorial complexity of motion coordination"
+, type =        "Report"
+, number =      76
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1983
 }
 
 @article{sy-snhmd-84
-, author =	"P. Spirakis and C. Yap"
-, title =	"Strong {NP}-hardness of moving many discs"
-, journal =	"Inform. Process. Lett."
-, volume =	19
-, year =	1984
-, pages =	"55--59"
-, update =	"98.11 bibrelex"
+, author =      "P. Spirakis and C. Yap"
+, title =       "Strong {NP}-hardness of moving many discs"
+, journal =     "Inform. Process. Lett."
+, volume =      19
+, year =        1984
+, pages =       "55--59"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{s-vumsp-84
-, author =	"P. G. Spirakis"
-, title =	"The volume of the union of many spheres and point inclusion problems"
-, type =	"Report"
-, number =	"TR 133"
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1984
+, author =      "P. G. Spirakis"
+, title =       "The volume of the union of many spheres and point inclusion problems"
+, type =        "Report"
+, number =      "TR 133"
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1984
 }
 
 @techreport{s-vfaau-83
-, author =	"P. G. Spirakis"
-, title =	"Very fast algorithms for the area of the union of many circles"
-, type =	"Report"
-, number =	98
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1983
+, author =      "P. G. Spirakis"
+, title =       "Very fast algorithms for the area of the union of many circles"
+, type =        "Report"
+, number =      98
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1983
 }
 
 @book{s-cidg-79
-, author =	"M. Spivak"
-, title =	"A Comprehensive Introduction to Differential Geometry"
-, volume =	3
-, publisher =	"Publish or Perish Press"
-, address =	"Berkeley, CA"
-, year =	1979
-, update =	"97.11 bibrelex"
+, author =      "M. Spivak"
+, title =       "A Comprehensive Introduction to Differential Geometry"
+, volume =      3
+, publisher =   "Publish or Perish Press"
+, address =     "Berkeley, CA"
+, year =        1979
+, update =      "97.11 bibrelex"
 }
 
 @book{s-cm-65
-, author =	"M. Spivak"
-, title =	"Calculus on Manifolds"
-, publisher =	"W. A. Benjamin Inc."
-, address =	"New York"
-, year =	1965
-, update =	"98.03 bibrelex"
+, author =      "M. Spivak"
+, title =       "Calculus on Manifolds"
+, publisher =   "W. A. Benjamin Inc."
+, address =     "New York"
+, year =        1965
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{sa-u3tst-95
-, author =	"L. Spratt and A. Ambler"
-, title =	"Using {3D} Tubes to Solve the Intersecting Line Representation Problem"
-, booktitle =	"Proc. IEEE Symp. on Visual Languages, 1994"
-, year =	1995
-, pages =	"254--261"
-, keywords =	"graph drawing, 3D"
-, update =	"97.03 tamassia, 96.09 tamassia, 96.04 garg"
+, author =      "L. Spratt and A. Ambler"
+, title =       "Using {3D} Tubes to Solve the Intersecting Line Representation Problem"
+, booktitle =   "Proc. IEEE Symp. on Visual Languages, 1994"
+, year =        1995
+, pages =       "254--261"
+, keywords =    "graph drawing, 3D"
+, update =      "97.03 tamassia, 96.09 tamassia, 96.04 garg"
 }
 
 @article{sk-nbmlu-02
-, author =	"M. J. Spriggs and J. M. Keil"
-, title =	"A new bound for map labeling with uniform circle pairs"
-, journal =	"Inform. Process. Lett."
-, volume =	81
-, year =	2002
-, pages =	"47--53"
-, update =	"01.11 smid"
+, author =      "M. J. Spriggs and J. M. Keil"
+, title =       "A new bound for map labeling with uniform circle pairs"
+, journal =     "Inform. Process. Lett."
+, volume =      81
+, year =        2002
+, pages =       "47--53"
+, update =      "01.11 smid"
 }
 
 @book{s-irs-81
-, author =	"G. Springer"
-, title =	"Introduction to {Riemann} Surfaces"
-, publisher =	"Chelsea"
-, year =	1981
-, update =	"98.03 bibrelex"
+, author =      "G. Springer"
+, title =       "Introduction to {Riemann} Surfaces"
+, publisher =   "Chelsea"
+, year =        1981
+, update =      "98.03 bibrelex"
 }
 
 @mastersthesis{s-pma-90
-, author =	"J. Sprinzak"
-, title =	"Point Matching Algorithms"
-, type =	"Masters Thesis"
-, school =	"Dept. Comput. Sci., Hebrew Univ."
-, address =	"Jerusalem, Israel"
-, year =	1990
-, keywords =	"master thesis"
+, author =      "J. Sprinzak"
+, title =       "Point Matching Algorithms"
+, type =        "Masters Thesis"
+, school =      "Dept. Comput. Sci., Hebrew Univ."
+, address =     "Jerusalem, Israel"
+, year =        1990
+, keywords =    "master thesis"
 }
 
 @article{sw-apm-94
-, author =	"J. Sprinzak and M. Werman"
-, title =	"Affine Point Matching"
-, journal =	"Pattern Recogn. Lett."
-, volume =	15
-, year =	1994
-, pages =	"337--339"
-, update =	"96.01 werman"
+, author =      "J. Sprinzak and M. Werman"
+, title =       "Affine Point Matching"
+, journal =     "Pattern Recogn. Lett."
+, volume =      15
+, year =        1994
+, pages =       "337--339"
+, update =      "96.01 werman"
 }
 
 @inproceedings{sw-epm-90
-, author =	"J. Sprinzak and M. Werman"
-, title =	"Exact Point Matching"
-, booktitle =	"Proc. Israeli Symposium on AI, Vision and Pattern Recognition"
-, publisher =	"Elsevier Science Publishers"
-, year =	1990
+, author =      "J. Sprinzak and M. Werman"
+, title =       "Exact Point Matching"
+, booktitle =   "Proc. Israeli Symposium on AI, Vision and Pattern Recognition"
+, publisher =   "Elsevier Science Publishers"
+, year =        1990
 }
 
 @article{s-rnns-91
-, author =	"R. F. Sproull"
-, title =	"Refinements to nearest-neighbor searching"
-, journal =	"Algorithmica"
-, volume =	6
-, year =	1991
-, pages =	"579--589"
+, author =      "R. F. Sproull"
+, title =       "Refinements to nearest-neighbor searching"
+, journal =     "Algorithmica"
+, volume =      6
+, year =        1991
+, pages =       "579--589"
 }
 
 @techreport{s-rnnsk-88
-, author =	"R. F. Sproull"
-, title =	"Refinements to nearest-neighbor searching in $k$-d trees"
-, number =	"SSAPP 184"
-, institution =	"Southerland, Sproull and Associates"
-, month =	jul
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "R. F. Sproull"
+, title =       "Refinements to nearest-neighbor searching in $k$-d trees"
+, number =      "SSAPP 184"
+, institution = "Southerland, Sproull and Associates"
+, month =       jul
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 % ### others?
 @article{so-npdsb-88
-, author =	"G. Spur and others"
-, title =	"{NC} Programming and Dynamic Simulation Based on Solid Models in a {CIM} Strategy"
-, journal =	"Robotics and Computer-Integrated Manufacturing"
-, volume =	4
-, number =	"3--4"
-, year =	1988
-, pages =	"471--481"
-, update =	"93.09 held"
-, annote =	"claims to use Voronoi diagrams"
+, author =      "G. Spur and others"
+, title =       "{NC} Programming and Dynamic Simulation Based on Solid Models in a {CIM} Strategy"
+, journal =     "Robotics and Computer-Integrated Manufacturing"
+, volume =      4
+, number =      "3--4"
+, year =        1988
+, pages =       "471--481"
+, update =      "93.09 held"
+, annote =      "claims to use Voronoi diagrams"
 }
 
 @inproceedings{ssk-cdmpp-93
-, author =	"K. Sridharan and H. E. Stephanou and S. S. Deerthi"
-, title =	"On Computing a Distance Measure for Path Planning"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Atlanta Georgia"
-, year =	1993
-, pages =	"554--559"
-, update =	"98.11 bibrelex"
+, author =      "K. Sridharan and H. E. Stephanou and S. S. Deerthi"
+, title =       "On Computing a Distance Measure for Path Planning"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Atlanta Georgia"
+, year =        1993
+, pages =       "554--559"
+, update =      "98.11 bibrelex"
 }
 
 @article{s-rtddi-81
-, author =	"S. N. Srihari"
-, title =	"Representation of three-dimensional digital images"
-, journal =	"ACM Comput. Surv."
-, volume =	13
-, number =	4
-, year =	1981
-, pages =	"399--424"
-, update =	"98.11 bibrelex"
+, author =      "S. N. Srihari"
+, title =       "Representation of three-dimensional digital images"
+, journal =     "ACM Comput. Surv."
+, volume =      13
+, number =      4
+, year =        1981
+, pages =       "399--424"
+, update =      "98.11 bibrelex"
 }
 
 % ### others?
 @article{s-cgmvi-90
-, author =	"P. Srinivasan and others"
-, title =	"Computational geometric methods in volumetric intersection for {3D} reconstruction"
-, journal =	"Pattern Recogn."
-, volume =	23
-, year =	1990
-, pages =	"843--857"
-, update =	"98.11 bibrelex"
+, author =      "P. Srinivasan and others"
+, title =       "Computational geometric methods in volumetric intersection for {3D} reconstruction"
+, journal =     "Pattern Recogn."
+, volume =      23
+, year =        1990
+, pages =       "843--857"
+, update =      "98.11 bibrelex"
 }
 
 @unpublished{s-dgvm-94
-, author =	"V. Srinivasan"
-, title =	"Dealing with Geometric Variations in Manufacturing"
-, year =	1994
-, note =	"Invited lecture, NSF Workshop on Manufacturing and
+, author =      "V. Srinivasan"
+, title =       "Dealing with Geometric Variations in Manufacturing"
+, year =        1994
+, note =        "Invited lecture, NSF Workshop on Manufacturing and
               Computational Geometry, April~1"
-, update =	"95.01 mitchell"
+, update =      "95.01 mitchell"
 }
 
 @unpublished{s-gmm-94
-, author =	"V. Srinivasan"
-, title =	"Geometry, Measurements, and Manufacturing"
-, year =	1994
-, note =	"Invited lecture, Fourth MSI Workshop on
+, author =      "V. Srinivasan"
+, title =       "Geometry, Measurements, and Manufacturing"
+, year =        1994
+, note =        "Invited lecture, Fourth MSI Workshop on
               Computational Geometry, October 14-15"
-, update =	"95.01 mitchell"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{s-rsts-93
-, author =	"V. Srinivasan"
-, title =	"Role of Sweeps in Tolerance Semantics"
-, booktitle =	"Proc. 1993 Int. Forum on Dimensional Tolerancing and Metrology"
-, year =	1993
-, pages =	"69--78"
-, update =	"96.09 orourke"
+, author =      "V. Srinivasan"
+, title =       "Role of Sweeps in Tolerance Semantics"
+, booktitle =   "Proc. 1993 Int. Forum on Dimensional Tolerancing and Metrology"
+, year =        1993
+, pages =       "69--78"
+, update =      "96.09 orourke"
 }
 
 @techreport{sn-acvdm-85
-, author =	"V. Srinivasan and L. R. Nackman"
-, title =	"An algorithm to compute the {Voronoi} diagram of a multiply connected polygonal domain"
-, type =	"Report"
-, number =	"RC 11605 (\#52150)"
-, institution =	"IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1985
-, update =	"94.09 bernal"
+, author =      "V. Srinivasan and L. R. Nackman"
+, title =       "An algorithm to compute the {Voronoi} diagram of a multiply connected polygonal domain"
+, type =        "Report"
+, number =      "RC 11605 (\#52150)"
+, institution = "IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1985
+, update =      "94.09 bernal"
 }
 
 @techreport{sn-mblss-89
-, author =	"V. Srinivasan and L. R. Nackman"
-, title =	"Maximal balls of linearly separable sets"
-, type =	"Report"
-, number =	"RC 14596"
-, institution =	"IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, month =	may
-, year =	1989
-, precedes =	"sn-mblss-94"
-, update =	"96.09 devillers"
+, author =      "V. Srinivasan and L. R. Nackman"
+, title =       "Maximal balls of linearly separable sets"
+, type =        "Report"
+, number =      "RC 14596"
+, institution = "IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, month =       may
+, year =        1989
+, precedes =    "sn-mblss-94"
+, update =      "96.09 devillers"
 }
 
 @article{sn-mblss-94
-, author =	"V. Srinivasan and L. R. Nackman"
-, title =	"Maximal balls of linearly separable sets"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, year =	1994
-, pages =	"25--38"
-, keywords =	"separable sets, maximal balls, bissectors, triangulation"
-, succeeds =	"sn-mblss-89"
-, update =	"96.09 devillers"
+, author =      "V. Srinivasan and L. R. Nackman"
+, title =       "Maximal balls of linearly separable sets"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, year =        1994
+, pages =       "25--38"
+, keywords =    "separable sets, maximal balls, bissectors, triangulation"
+, succeeds =    "sn-mblss-89"
+, update =      "96.09 devillers"
 }
 
 @article{sn-vdmcp-87
-, author =	"V. Srinivasan and L. R. Nackman"
-, title =	"Voronoi diagram for multiply-connected polygonal domains {I}: algorithm"
-, journal =	"IBM J. Res. Develop."
-, volume =	31
-, year =	1987
-, pages =	"361--372"
+, author =      "V. Srinivasan and L. R. Nackman"
+, title =       "Voronoi diagram for multiply-connected polygonal domains {I}: algorithm"
+, journal =     "IBM J. Res. Develop."
+, volume =      31
+, year =        1987
+, pages =       "361--372"
 }
 
 @techreport{sntm-amgus-90
-, author =	"V. Srinivasan and L. R. Nackman and J. Tang and S. N. Meshkat"
-, title =	"Automatic Mesh Generation unsing the Symmetric Axis Transformation of Polygonal Domains"
-, number =	"RC 16132"
-, institution =	"IBM Res. Center"
-, year =	1990
-, update =	"97.11 bibrelex"
+, author =      "V. Srinivasan and L. R. Nackman and J. Tang and S. N. Meshkat"
+, title =       "Automatic Mesh Generation unsing the Symmetric Axis Transformation of Polygonal Domains"
+, number =      "RC 16132"
+, institution = "IBM Res. Center"
+, year =        1990
+, update =      "97.11 bibrelex"
 }
 
 @article{sntm-amgus-92
-, author =	"V. Srinivasan and L. R. Nackman and J.-M. Tang and S. N. Meshkat"
-, title =	"Automatic Mesh Generation Using the Symmetric Axis Transform of Polygonal Domains"
-, journal =	"Proc. IEEE"
-, volume =	80
-, number =	9
-, month =	sep
-, year =	1992
-, pages =	"1485--1501"
-, update =	"93.09 held"
+, author =      "V. Srinivasan and L. R. Nackman and J.-M. Tang and S. N. Meshkat"
+, title =       "Automatic Mesh Generation Using the Symmetric Axis Transform of Polygonal Domains"
+, journal =     "Proc. IEEE"
+, volume =      80
+, number =      9
+, month =       sep
+, year =        1992
+, pages =       "1485--1501"
+, update =      "93.09 held"
 }
 
 @article{so-oist-94
-, author =	"V. Srinivasan and M. A. O'Connor"
-, title =	"On interpreting statistical tolerancing"
-, journal =	"Manufacturing Review"
-, volume =	7
-, number =	4
-, year =	1994
-, pages =	"304--311"
-, update =	"98.03 agarwal"
+, author =      "V. Srinivasan and M. A. O'Connor"
+, title =       "On interpreting statistical tolerancing"
+, journal =     "Manufacturing Review"
+, volume =      7
+, number =      4
+, year =        1994
+, pages =       "304--311"
+, update =      "98.03 agarwal"
 }
 
 @book{sv-dtm-93
-, title =	"Dimensional Tolerancing and Metrology"
-, editor =	"V. Srinivasan and H. B. Voelcker"
-, series =	"CRTD"
-, volume =	27
-, publisher =	"The American Society of Mechanical Engineers"
-, year =	1993
-, update =	"98.07 bibrelex"
+, title =       "Dimensional Tolerancing and Metrology"
+, editor =      "V. Srinivasan and H. B. Voelcker"
+, series =      "CRTD"
+, volume =      27
+, publisher =   "The American Society of Mechanical Engineers"
+, year =        1993
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{s-vipcg-92
-, author =	"G. Srinivasaraghavan"
-, title =	"On Some Visibility and Intersection Problems in Computational Geometry"
-, school =	"Department of Computer Science and Engineering, Indian Institute of Technology"
-, address =	"Kanpur, India"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "G. Srinivasaraghavan"
+, title =       "On Some Visibility and Intersection Problems in Computational Geometry"
+, school =      "Department of Computer Science and Engineering, Indian Institute of Technology"
+, address =     "Kanpur, India"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @article{sm-nncvv-94
-, author =	"G. Srinivasaraghavan and A. Mukhopadhyay"
-, title =	"A new necessary condition for the vertex visibility graphs of simple polygons"
-, journal =	"Discrete Comput. Geom."
-, volume =	12
-, year =	1994
-, pages =	"65--82"
-, keywords =	"visibility"
-, update =	"94.09 orourke"
+, author =      "G. Srinivasaraghavan and A. Mukhopadhyay"
+, title =       "A new necessary condition for the vertex visibility graphs of simple polygons"
+, journal =     "Discrete Comput. Geom."
+, volume =      12
+, year =        1994
+, pages =       "65--82"
+, keywords =    "visibility"
+, update =      "94.09 orourke"
 }
 
 @inproceedings{sm-ncra-93
-, author =	"G. Srinivasaraghavan and A. Mukhopadhyay"
-, title =	"On the notion of completeness for reconstruction algorithms"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"315--320"
-, cites =	"o-agta-87, s-vipcg-92, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "G. Srinivasaraghavan and A. Mukhopadhyay"
+, title =       "On the notion of completeness for reconstruction algorithms"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "315--320"
+, cites =       "o-agta-87, s-vipcg-92, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @techreport{sm-ssps-92
-, author =	"G. Srinivasaraghavan and Asish Mukhopadhyay"
-, title =	"Stabbing simple planar sets"
-, type =	"Technical Report"
-, number =	"TRCS-92-152"
-, institution =	"IIT Kanpur, Computer Science and Engg. Dept."
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "G. Srinivasaraghavan and Asish Mukhopadhyay"
+, title =       "Stabbing simple planar sets"
+, type =        "Technical Report"
+, number =      "TRCS-92-152"
+, institution = "IIT Kanpur, Computer Science and Engg. Dept."
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ss-achii-94
-, author =	"A. Srivastav and P. Stangier"
-, title =	"Algorithmic {Chernoff}-{Hoeffding} Inequalities in Integer Programming"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"226--234"
-, update =	"97.03 gaertner+salinger"
+, author =      "A. Srivastav and P. Stangier"
+, title =       "Algorithmic {Chernoff}-{Hoeffding} Inequalities in Integer Programming"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "226--234"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{ss-tarcs-94
-, author =	"A. Srivastav and P. Stangier"
-, title =	"Tight Approximations of Resource Constrained Scheduling Problems"
-, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"307--318"
-, update =	"97.03 gaertner+salinger"
+, author =      "A. Srivastav and P. Stangier"
+, title =       "Tight Approximations of Resource Constrained Scheduling Problems"
+, booktitle =   "Proc. 2nd Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "307--318"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{ss-wfikm-95
-, author =	"A. Srivastav and P. Stangier"
-, title =	"Weighted fractional and integral $k$-matching in hypergraphs"
-, journal =	"Discrete Appl. Math."
-, volume =	57
-, year =	1995
-, pages =	"255--269"
-, update =	"97.03 gaertner+salinger"
+, author =      "A. Srivastav and P. Stangier"
+, title =       "Weighted fractional and integral $k$-matching in hypergraphs"
+, journal =     "Discrete Appl. Math."
+, volume =      57
+, year =        1995
+, pages =       "255--269"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{sa-agoos-87
-, author =	"S. Srivastava and N. Ahuia"
-, title =	"An algorithm for generating octrees from object silhouettes in perspective views"
-, booktitle =	"Proc. IEEE Workshop Comput. Vision"
-, site =	"Miami Beach, Fl."
-, month =	nov
-, year =	1987
-, pages =	"363--365"
-, update =	"98.11 bibrelex"
+, author =      "S. Srivastava and N. Ahuia"
+, title =       "An algorithm for generating octrees from object silhouettes in perspective views"
+, booktitle =   "Proc. IEEE Workshop Comput. Vision"
+, site =        "Miami Beach, Fl."
+, month =       nov
+, year =        1987
+, pages =       "363--365"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{s-pmspe-98
-, author =	"Ernesto Staffetti"
-, title =	"Planning the Motion of a Segment in a Polygonal Environment"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"135--137"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Ernesto Staffetti"
+, title =       "Planning the Motion of a Segment in a Polygonal Environment"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "135--137"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{s-nrdec-84
-, author =	"R. Stanley"
-, title =	"On the Number of Reduced Decompositions of Elements of {Coxeter} Groups"
-, journal =	"European J. Combin."
-, volume =	5
-, year =	1984
-, pages =	"359--372"
-, update =	"96.09 devillers, 94.09 orourke"
+, author =      "R. Stanley"
+, title =       "On the Number of Reduced Decompositions of Elements of {Coxeter} Groups"
+, journal =     "European J. Combin."
+, volume =      5
+, year =        1984
+, pages =       "359--372"
+, update =      "96.09 devillers, 94.09 orourke"
 }
 
 @article{s-nfscp-80
-, author =	"R. Stanley"
-, title =	"The number of faces of a simplical convex polytope"
-, journal =	"Adv. Math."
-, volume =	35
-, year =	1980
-, pages =	"236--238"
-, update =	"97.11 bibrelex"
+, author =      "R. Stanley"
+, title =       "The number of faces of a simplical convex polytope"
+, journal =     "Adv. Math."
+, volume =      35
+, year =        1980
+, pages =       "236--238"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-ubccr-75
-, author =	"R. Stanley"
-, title =	"The upper-bound conjecture and {Cohen-Macaulay} rings"
-, journal =	"Stud. Appl. Math."
-, volume =	54
-, year =	1975
-, pages =	"135--142"
-, update =	"98.07 bibrelex"
+, author =      "R. Stanley"
+, title =       "The upper-bound conjecture and {Cohen-Macaulay} rings"
+, journal =     "Stud. Appl. Math."
+, volume =      54
+, year =        1975
+, pages =       "135--142"
+, update =      "98.07 bibrelex"
 }
 
 @book{s-ec-86
-, author =	"R. P. Stanley"
-, title =	"Enumerative Combinatorics"
-, volume =	1
-, publisher =	"Wadsworth \& Brooks/Cole"
-, address =	"Monterey, CA"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "R. P. Stanley"
+, title =       "Enumerative Combinatorics"
+, volume =      1
+, publisher =   "Wadsworth \& Brooks/Cole"
+, address =     "Monterey, CA"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @article{s-tpp-86
-, author =	"R. P. Stanley"
-, title =	"Two poset polytopes"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"9--23"
+, author =      "R. P. Stanley"
+, title =       "Two poset polytopes"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "9--23"
 }
 
 @article{sjw-cadcs-82
-, author =	"S. M. Stanley and R. B. Jerard and P. R. White"
-, title =	"Computer-Aided Design of Curved Surfaces with Automatic Model Generation"
-, journal =	"Journal of Mechanical Design, ASME Transactions"
-, volume =	104
-, number =	3
-, month =	oct
-, year =	1982
-, pages =	"817--824"
-, update =	"98.03 bibrelex"
+, author =      "S. M. Stanley and R. B. Jerard and P. R. White"
+, title =       "Computer-Aided Design of Curved Surfaces with Automatic Model Generation"
+, journal =     "Journal of Mechanical Design, ASME Transactions"
+, volume =      104
+, number =      3
+, month =       oct
+, year =        1982
+, pages =       "817--824"
+, update =      "98.03 bibrelex"
 }
 
 @mastersthesis{s-popop-89
-, author =	"M. Stanton"
-, title =	"Pareto Optimal Paths Among Obstacles in the Plane"
-, type =	"M.{S}. Thesis"
-, school =	"Dept. Operations Research, Cornell University"
-, address =	"Ithaca, NY"
-, year =	1989
-, keywords =	"master thesis"
-, update =	"93.05 jones"
+, author =      "M. Stanton"
+, title =       "Pareto Optimal Paths Among Obstacles in the Plane"
+, type =        "M.{S}. Thesis"
+, school =      "Dept. Operations Research, Cornell University"
+, address =     "Ithaca, NY"
+, year =        1989
+, keywords =    "master thesis"
+, update =      "93.05 jones"
 }
 
 @article{sd-dss-76
-, author =	"R. Stanton and P. Dirksen"
-, title =	"{Davenport--Schinzel} sequences"
-, journal =	"Ars Combinatorica"
-, volume =	1
-, year =	1976
-, pages =	"43--51"
-, update =	"95.09 agarwal"
+, author =      "R. Stanton and P. Dirksen"
+, title =       "{Davenport--Schinzel} sequences"
+, journal =     "Ars Combinatorica"
+, volume =      1
+, year =        1976
+, pages =       "43--51"
+, update =      "95.09 agarwal"
 }
 
 @incollection{sr-rdss-69
-, author =	"R. Stanton and D. Roselle"
-, title =	"A result on {Davenport--Schinzel} sequences"
-, editor =	"P. Erd{\H o}s and others"
-, booktitle =	"Combinatorial Theory and Its Applications, Colloq. Math. Society J{\'a}nos Bolyai"
-, volume =	4
-, publisher =	"North-Holland"
-, address =	"Amsterdam"
-, year =	1969
-, pages =	"1023--1027"
-, update =	"95.09 agarwal"
+, author =      "R. Stanton and D. Roselle"
+, title =       "A result on {Davenport--Schinzel} sequences"
+, editor =      "P. Erd{\H o}s and others"
+, booktitle =   "Combinatorial Theory and Its Applications, Colloq. Math. Society J{\'a}nos Bolyai"
+, volume =      4
+, publisher =   "North-Holland"
+, address =     "Amsterdam"
+, year =        1969
+, pages =       "1023--1027"
+, update =      "95.09 agarwal"
 }
 
 @phdthesis{s-mpafo-94
-, author =	"A. F. van der Stappen"
-, title =	"Motion Planning amidst Fat Obstacles"
-, type =	"Ph.{D}. Dissertation"
-, school =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"95.01 smid"
+, author =      "A. F. van der Stappen"
+, title =       "Motion Planning amidst Fat Obstacles"
+, type =        "Ph.{D}. Dissertation"
+, school =      "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "95.01 smid"
 }
 
 @article{s-cfsmp-
-, author =	"A. F. van der Stappen"
-, title =	"The complexity of the free space for motion planning amidst fat obstacles"
-, journal =	"Journal of Intelligent \& Robotic Systems"
-, volume =	"??"
-, year =	"??"
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "A. F. van der Stappen"
+, title =       "The complexity of the free space for motion planning amidst fat obstacles"
+, journal =     "Journal of Intelligent \& Robotic Systems"
+, volume =      "??"
+, year =        "??"
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{sgo-gecmp-96
-, author =	"A. F. van der Stappen and K. Goldberg and M. H. Overmars"
-, title =	"Geometric eccentricity and the complexity of manipulation plans"
-, type =	"Report"
-, number =	"UU-CS-1996-49"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1996
-, comments =	"To appear in Algorithmica"
-, update =	"97.11 oostrum"
+, author =      "A. F. van der Stappen and K. Goldberg and M. H. Overmars"
+, title =       "Geometric eccentricity and the complexity of manipulation plans"
+, type =        "Report"
+, number =      "UU-CS-1996-49"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1996
+, comments =    "To appear in Algorithmica"
+, update =      "97.11 oostrum"
 }
 
 @inproceedings{sho-eaemp-93
-, author =	"A. F. van der Stappen and D. Halperin and M. H. Overmars"
-, title =	"Efficient algorithms for exact motion planning amidst fat obstacles"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1993
-, pages =	"297--304"
-, keywords =	"robotics, motion planning"
-, update =	"95.09 halperin"
+, author =      "A. F. van der Stappen and D. Halperin and M. H. Overmars"
+, title =       "Efficient algorithms for exact motion planning amidst fat obstacles"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1993
+, pages =       "297--304"
+, keywords =    "robotics, motion planning"
+, update =      "95.09 halperin"
 }
 
 @techreport{sho-cfsrm-92
-, author =	"A. F. van der Stappen and D. Halperin and M. H. Overmars"
-, title =	"The complexity of the free space for a robot moving amidst fat obstacles"
-, type =	"Report"
-, number =	"RUU-CS-92-05"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1992
-, keywords =	"motion planning"
-, precedes =	"sho-cfsrm-93"
-, update =	"96.09 devillers, 94.05 schwarzkopf"
+, author =      "A. F. van der Stappen and D. Halperin and M. H. Overmars"
+, title =       "The complexity of the free space for a robot moving amidst fat obstacles"
+, type =        "Report"
+, number =      "RUU-CS-92-05"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1992
+, keywords =    "motion planning"
+, precedes =    "sho-cfsrm-93"
+, update =      "96.09 devillers, 94.05 schwarzkopf"
 }
 
 @article{sho-cfsrm-93
-, author =	"A. F. van der Stappen and D. Halperin and M. H. Overmars"
-, title =	"The complexity of the free space for a robot moving amidst fat obstacles"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	3
-, year =	1993
-, pages =	"353--373"
-, succeeds =	"sho-cfsrm-92"
-, update =	"96.09 devillers"
+, author =      "A. F. van der Stappen and D. Halperin and M. H. Overmars"
+, title =       "The complexity of the free space for a robot moving amidst fat obstacles"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      3
+, year =        1993
+, pages =       "353--373"
+, succeeds =    "sho-cfsrm-92"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{so-mpafo-94
-, author =	"A. F. van der Stappen and M. H. Overmars"
-, title =	"Motion Planning amidst Fat Obstacles"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"31--40"
-, cites =	"afkmnsu-ampcb-92, abf-pempa-89, bo-arcgi-79, bgh-vdt3s-94, mmpssw-ftdlm-91, o-plfs-92, ss-pmp1c-83, ss-nempa-87, ss-pmp2g-83, ss-empae-85, sho-cfsrm-93, s-cfsmp-, sho-eaemp-93, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "A. F. van der Stappen and M. H. Overmars"
+, title =       "Motion Planning amidst Fat Obstacles"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "31--40"
+, cites =       "afkmnsu-ampcb-92, abf-pempa-89, bo-arcgi-79, bgh-vdt3s-94, mmpssw-ftdlm-91, o-plfs-92, ss-pmp1c-83, ss-nempa-87, ss-pmp2g-83, ss-empae-85, sho-cfsrm-93, s-cfsmp-, sho-eaemp-93, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @techreport{so-mpelo-95
-, author =	"A. F. van der Stappen and M. H. Overmars"
-, title =	"Motion planning in environments with low obstacle density"
-, type =	"Technical {Report}"
-, number =	"UU-CS-1995-33"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, month =	oct
-, year =	1995
-, update =	"98.07 bibrelex"
+, author =      "A. F. van der Stappen and M. H. Overmars"
+, title =       "Motion planning in environments with low obstacle density"
+, type =        "Technical {Report}"
+, number =      "UU-CS-1995-33"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, month =       oct
+, year =        1995
+, update =      "98.07 bibrelex"
 }
 
 @techreport{sobv-mpelo-97
-, author =	"A. F. van der Stappen and M. H. Overmars and M. de Berg and J. Vleugels"
-, title =	"Motion planning in environments with low obstacle density"
-, type =	"Report"
-, number =	"UU-CS-1997-19"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1997
-, update =	"97.11 oostrum"
+, author =      "A. F. van der Stappen and M. H. Overmars and M. de Berg and J. Vleugels"
+, title =       "Motion planning in environments with low obstacle density"
+, type =        "Report"
+, number =      "UU-CS-1997-19"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1997
+, update =      "97.11 oostrum"
 }
 
 @book{se-gisi-90
-, author =	"J. Star and J. Estes"
-, title =	"Geographic Information Systems: an Introduction"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs"
-, year =	1990
-, update =	"96.09 kreveld"
+, author =      "J. Star and J. Estes"
+, title =       "Geographic Information Systems: an Introduction"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs"
+, year =        1990
+, update =      "96.09 kreveld"
 }
 
 @inproceedings{s-saat-90
-, author =	"J. T. Stasko"
-, title =	"Simplifying Algorithm Animation with Tango"
-, booktitle =	"Proc. IEEE Workshop on Visual Languages"
-, year =	1990
-, pages =	"1--6"
-, update =	"96.01 tamassia"
+, author =      "J. T. Stasko"
+, title =       "Simplifying Algorithm Animation with Tango"
+, booktitle =   "Proc. IEEE Workshop on Visual Languages"
+, year =        1990
+, pages =       "1--6"
+, update =      "96.01 tamassia"
 }
 
 @article{s-tfsaa-90
-, author =	"J. T. Stasko"
-, title =	"Tango: a Framework and System for Algorithm Animation"
-, journal =	"IEEE Computer"
-, volume =	23
-, number =	9
-, year =	1990
-, pages =	"27--39"
-, url =	"https://www.cc.gatech.edu/gvu/ii/softvis/algoanim/xtango.html"
-, update =	"96.01 tamassia"
+, author =      "J. T. Stasko"
+, title =       "Tango: a Framework and System for Algorithm Animation"
+, journal =     "IEEE Computer"
+, volume =      23
+, number =      9
+, year =        1990
+, pages =       "27--39"
+, url = "https://www.cc.gatech.edu/gvu/ii/softvis/algoanim/xtango.html"
+, update =      "96.01 tamassia"
 }
 
 @article{s-ptppm-90
-, author =	"J. T. Stasko"
-, title =	"The Path-Transition Paradigm: a Practical Methodology for Adding Animation to Program Interfaces"
-, journal =	"J. Visual Lang. Comput."
-, volume =	1
-, number =	3
-, year =	1990
-, pages =	"213--236"
-, update =	"96.01 tamassia"
+, author =      "J. T. Stasko"
+, title =       "The Path-Transition Paradigm: a Practical Methodology for Adding Animation to Program Interfaces"
+, journal =     "J. Visual Lang. Comput."
+, volume =      1
+, number =      3
+, year =        1990
+, pages =       "213--236"
+, update =      "96.01 tamassia"
 }
 
 %   is this a book??
 @book{s-am-83
-, author =	"J. P. Steadman"
-, title =	"Architectural Morphology"
-, publisher =	"Pion"
-, address =	"London"
-, year =	1983
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. P. Steadman"
+, title =       "Architectural Morphology"
+, publisher =   "Pion"
+, address =     "London"
+, year =        1983
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @phdthesis{s-dicpl-80
-, author =	"G. L. {Steele, Jr.}"
-, title =	"The definition and implementation of a computer programming language based on constraints"
-, school =	"Artif. Intell. Lab., Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, month =	aug
-, year =	1980
-, note =	"Technical Report AI-TR-595"
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "G. L. {Steele, Jr.}"
+, title =       "The definition and implementation of a computer programming language based on constraints"
+, school =      "Artif. Intell. Lab., Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, month =       aug
+, year =        1980
+, note =        "Technical Report AI-TR-595"
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{s-ccspk-81
-, author =	"J. M. Steele"
-, title =	"Complete convergence of short paths and {Karp}'s algorithm for the {TSP}"
-, journal =	"Math. Oper. Res."
-, volume =	6
-, year =	1981
-, pages =	"374--378"
+, author =      "J. M. Steele"
+, title =       "Complete convergence of short paths and {Karp}'s algorithm for the {TSP}"
+, journal =     "Math. Oper. Res."
+, volume =      6
+, year =        1981
+, pages =       "374--378"
 }
 
 @article{s-otrsp-82
-, author =	"J. M. Steele"
-, title =	"Optimal triangulations of random samples in the plane"
-, journal =	"Ann. Probab."
-, volume =	10
-, number =	3
-, year =	1982
-, pages =	"548--553"
+, author =      "J. M. Steele"
+, title =       "Optimal triangulations of random samples in the plane"
+, journal =     "Ann. Probab."
+, volume =      10
+, number =      3
+, year =        1982
+, pages =       "548--553"
 }
 
 @article{s-pwcac-90
-, author =	"J. M. Steele"
-, title =	"Probabilistic and worst-case analysis of classical problems of combinatorial optimization in {Euclidean} space"
-, journal =	"Math. Oper. Res."
-, volume =	15
-, year =	1990
-, pages =	"749--770"
-, update =	"97.11 bibrelex"
+, author =      "J. M. Steele"
+, title =       "Probabilistic and worst-case analysis of classical problems of combinatorial optimization in {Euclidean} space"
+, journal =     "Math. Oper. Res."
+, volume =      15
+, year =        1990
+, pages =       "749--770"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-sefnl-81
-, author =	"J. M. Steele"
-, title =	"Subadditive {Euclidean} functionals and non-linear growth in geometric probability"
-, journal =	"Ann. Probab."
-, volume =	9
-, year =	1981
-, pages =	"365--376"
-, update =	"97.11 bibrelex"
+, author =      "J. M. Steele"
+, title =       "Subadditive {Euclidean} functionals and non-linear growth in geometric probability"
+, journal =     "Ann. Probab."
+, volume =      9
+, year =        1981
+, pages =       "365--376"
+, update =      "97.11 bibrelex"
 }
 
 @article{ss-wcgrs-89
-, author =	"J. M. Steele and T. L. Snyder"
-, title =	"Worst-case growth rates of some classical problems of combinatorial optimization"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, year =	1989
-, pages =	"278--287"
-, update =	"00.03 smid, 97.11 bibrelex"
+, author =      "J. M. Steele and T. L. Snyder"
+, title =       "Worst-case growth rates of some classical problems of combinatorial optimization"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, year =        1989
+, pages =       "278--287"
+, update =      "00.03 smid, 97.11 bibrelex"
 }
 
 @article{sy-lbadt-82
-, author =	"J. M. Steele and A. C. Yao"
-, title =	"Lower bounds for algebraic decision trees"
-, journal =	"J. Algorithms"
-, volume =	3
-, year =	1982
-, pages =	"1--8"
+, author =      "J. M. Steele and A. C. Yao"
+, title =       "Lower bounds for algebraic decision trees"
+, journal =     "J. Algorithms"
+, volume =      3
+, year =        1982
+, pages =       "1--8"
 }
 
 @article{s-idssd-78
-, author =	"M. Stefik"
-, title =	"Inferring {DNA} structures from segmentation data"
-, journal =	"Artif. Intell."
-, volume =	11
-, year =	1978
-, pages =	"85--114"
-, update =	"97.11 bibrelex"
+, author =      "M. Stefik"
+, title =       "Inferring {DNA} structures from segmentation data"
+, journal =     "Artif. Intell."
+, volume =      11
+, year =        1978
+, pages =       "85--114"
+, update =      "97.11 bibrelex"
 }
 
 @article{sb-ooptv-85
-, author =	"M. Stefik and D. G. Bobrow"
-, title =	"Object-oriented programming: themes and variations"
-, journal =	"The AI Magazine"
-, volume =	"??"
-, year =	1985
-, pages =	"40--62"
-, update =	"98.03 bibrelex"
+, author =      "M. Stefik and D. G. Bobrow"
+, title =       "Object-oriented programming: themes and variations"
+, journal =     "The AI Magazine"
+, volume =      "??"
+, year =        1985
+, pages =       "40--62"
+, update =      "98.03 bibrelex"
 }
 
 @article{s-abq-92
-, author =	"T. Stehling"
-, title =	"Ammann bars and quasicrystals"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"125--133"
+, author =      "T. Stehling"
+, title =       "Ammann bars and quasicrystals"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "125--133"
 }
 
 @inproceedings{s-ahsc-93
-, author =	"William Steiger"
-, title =	"Algorithms for Ham Sandwich Cuts"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	48
-, update =	"93.09 milone+mitchell"
+, author =      "William Steiger"
+, title =       "Algorithms for Ham Sandwich Cuts"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       48
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{s-sglbu-95
-, author =	"William Steiger"
-, title =	"Some Geometric Lower Bounds Using Connected Components"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	61
-, update =	"00.03 bibrelex"
+, author =      "William Steiger"
+, title =       "Some Geometric Lower Bounds Using Connected Components"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       61
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{s-ssttr-95
-, author =	"William Steiger"
-, title =	"Some Space/Time Tradeoffs for Ranking and Searching"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	63
-, update =	"00.03 bibrelex"
+, author =      "William Steiger"
+, title =       "Some Space/Time Tradeoffs for Ranking and Searching"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       63
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{ss-paslp-94
-, author =	"W. Steiger and I. Streinu"
-, title =	"A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"7--11"
-, cites =	"csss-otass-89, eg-ccytb-84, e-acg-87, f-hgiit-76, gp-ms-83, gp-ubcpr-86, hpss-sxoc-75, l-sxyoc-91, m-lblmp-91, pss-ubnpk-92, s-nrdec-84, gp-asotd-93, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "W. Steiger and I. Streinu"
+, title =       "A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "7--11"
+, cites =       "csss-otass-89, eg-ccytb-84, e-acg-87, f-hgiit-76, gp-ms-83, gp-ubcpr-86, hpss-sxoc-75, l-sxyoc-91, m-lblmp-91, pss-ubnpk-92, s-nrdec-84, gp-asotd-93, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @article{ss-paslp-95
-, author =	"W. Steiger and I. Streinu"
-, title =	"A pseudo-algorithmic separation of lines from pseudo-lines"
-, journal =	"Inform. Process. Lett."
-, volume =	53
-, year =	1995
-, pages =	"295--299"
-, update =	"01.07 smid"
+, author =      "W. Steiger and I. Streinu"
+, title =       "A pseudo-algorithmic separation of lines from pseudo-lines"
+, journal =     "Inform. Process. Lett."
+, volume =      53
+, year =        1995
+, pages =       "295--299"
+, update =      "01.07 smid"
 }
 
 @article{ss-if-98
-, author =	"W. Steiger and I. Streinu"
-, title =	"Illumination by Floodlights"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, number =	1
-, year =	1998
-, pages =	"57--70"
-, keywords =	"visibility, floodlights"
-, succeeds =	"ss-pnrfp-94"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "W. Steiger and I. Streinu"
+, title =       "Illumination by Floodlights"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, number =      1
+, year =        1998
+, pages =       "57--70"
+, keywords =    "visibility, floodlights"
+, succeeds =    "ss-pnrfp-94"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{ss-pnrfp-94
-, author =	"W. Steiger and I. Streinu"
-, title =	"Positive and Negative Results on the Floodlight Problem"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"87--92"
-, keywords =	"visibility, floodlights"
-, precedes =	"ss-if-98"
-, cites =	"ae-tpss-87, bglosu-fp-93, cru-ofipt-93, e-acg-87, o-agta-87, ps-cgi-85, bfprt-tbs-73, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 94.09 orourke"
+, author =      "W. Steiger and I. Streinu"
+, title =       "Positive and Negative Results on the Floodlight Problem"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "87--92"
+, keywords =    "visibility, floodlights"
+, precedes =    "ss-if-98"
+, cites =       "ae-tpss-87, bglosu-fp-93, cru-ofipt-93, e-acg-87, o-agta-87, ps-cgi-85, bfprt-tbs-73, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 94.09 orourke"
 }
 
 @inproceedings{sw-frmrl-92
-, author =	"A. Stein and M. Werman"
-, title =	"Finding the repeated median regression line"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"409--413"
+, author =      "A. Stein and M. Werman"
+, title =       "Finding the repeated median regression line"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "409--413"
 }
 
 @inproceedings{sw-rssf-92
-, author =	"A. Stein and M. Werman"
-, title =	"Robust Statistics in Shape Fitting"
-, booktitle =	"Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
-, month =	jun
-, year =	1992
-, pages =	"540--546"
-, update =	"98.11 bibrelex, 96.01 werman"
+, author =      "A. Stein and M. Werman"
+, title =       "Robust Statistics in Shape Fitting"
+, booktitle =   "Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn."
+, month =       jun
+, year =        1992
+, pages =       "540--546"
+, update =      "98.11 bibrelex, 96.01 werman"
 }
 
 @article{s-cm-51
-, author =	"S. K. Stein"
-, title =	"Convex Maps"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	2
-, number =	3
-, year =	1951
-, pages =	"464--466"
-, keywords =	"graph drawing"
-, update =	"98.07 tamassia, 93.09 tamassia"
+, author =      "S. K. Stein"
+, title =       "Convex Maps"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      2
+, number =      3
+, year =        1951
+, pages =       "464--466"
+, keywords =    "graph drawing"
+, update =      "98.07 tamassia, 93.09 tamassia"
 }
 
 @article{s-spn4-44
-, author =	"R. Steinberg"
-, title =	"Solution to Problem No 4065"
-, journal =	"Amer. Math. Monthly"
-, volume =	51
-, year =	1944
-, pages =	"169--171"
-, update =	"98.03 devillers"
+, author =      "R. Steinberg"
+, title =       "Solution to Problem No 4065"
+, journal =     "Amer. Math. Monthly"
+, volume =      51
+, year =        1944
+, pages =       "169--171"
+, update =      "98.03 devillers"
 }
 
 @article{s-egudt-26
-, author =	"J. Steiner"
-, title =	"{Einige} {Gesetze} {\"u}ber die {Theilung} der {Ebene} und des {Raumes}"
-, journal =	"J. Reine Angew. Math."
-, volume =	1
-, year =	1826
-, pages =	"349--364"
-, update =	"98.03 agarwal"
+, author =      "J. Steiner"
+, title =       "{Einige} {Gesetze} {\"u}ber die {Theilung} der {Ebene} und des {Raumes}"
+, journal =     "J. Reine Angew. Math."
+, volume =      1
+, year =        1826
+, pages =       "349--364"
+, update =      "98.03 agarwal"
 }
 
 @incollection{s-sedag-81
-, author =	"J. Steiner"
-, title =	"Systematische {Entwicklung} der {Abh{\"a}ngigkeit} geometrischer {Gestalten} voneinander"
-, booktitle =	"Jakob Steiner's Collected Works"
-, publisher =	"??"
-, year =	1881
-, update =	"97.11 bibrelex"
+, author =      "J. Steiner"
+, title =       "Systematische {Entwicklung} der {Abh{\"a}ngigkeit} geometrischer {Gestalten} voneinander"
+, booktitle =   "Jakob Steiner's Collected Works"
+, publisher =   "??"
+, year =        1881
+, update =      "97.11 bibrelex"
 }
 
 @techreport{s-sfars-89
-, author =	"T. L. Steiner"
-, title =	"A simple and faster algorithm for the rectilinear {Steiner} problem in general dimension"
-, type =	"Technical {Report}"
-, institution =	"Dept. Comput. Sci., Georgetown Univ."
-, address =	"Washington, DC"
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "T. L. Steiner"
+, title =       "A simple and faster algorithm for the rectilinear {Steiner} problem in general dimension"
+, type =        "Technical {Report}"
+, institution = "Dept. Comput. Sci., Georgetown Univ."
+, address =     "Washington, DC"
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @article{s-pur-22
-, author =	"E. Steinitz"
-, title =	"Polyeder und Raumeinteilungen"
-, journal =	"Enzykl. Math. Wiss."
-, volume =	3
-, year =	1922
-, pages =	"1--139"
-, note =	"Part 3AB12"
-, update =	"97.11 bibrelex"
+, author =      "E. Steinitz"
+, title =       "Polyeder und Raumeinteilungen"
+, journal =     "Enzykl. Math. Wiss."
+, volume =      3
+, year =        1922
+, pages =       "1--139"
+, note =        "Part 3AB12"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-uipkp-27
-, author =	"E. Steinitz"
-, title =	"{\"U}ber isoperimetrische Probleme bei konvexen Polyedern"
-, journal =	"J. Math."
-, volume =	158
-, year =	1927
-, pages =	"129--153"
-, update =	"97.11 bibrelex"
+, author =      "E. Steinitz"
+, title =       "{\"U}ber isoperimetrische Probleme bei konvexen Polyedern"
+, journal =     "J. Math."
+, volume =      158
+, year =        1927
+, pages =       "129--153"
+, update =      "97.11 bibrelex"
 }
 
 @book{sr-vudtd-34
-, author =	"E. Steinitz and H. Rademacher"
-, title =	"{V}orlesungen {\"u}ber die {T}heorie der {P}olyeder"
-, publisher =	"Julius Springer"
-, address =	"Berlin, Germany"
-, year =	1934
-, keywords =	"graph drawing"
-, update =	"98.11 bibrelex, 98.07 vismara, 93.09 tamassia"
+, author =      "E. Steinitz and H. Rademacher"
+, title =       "{V}orlesungen {\"u}ber die {T}heorie der {P}olyeder"
+, publisher =   "Julius Springer"
+, address =     "Berlin, Germany"
+, year =        1934
+, keywords =    "graph drawing"
+, update =      "98.11 bibrelex, 98.07 vismara, 93.09 tamassia"
 }
 
 @article{s-cadzp-91
-, author =	"G. Stengle"
-, title =	"Constraints on the angular distribution of the zeros of a polynomial of low complexity"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"163--169"
+, author =      "G. Stengle"
+, title =       "Constraints on the angular distribution of the zeros of a polynomial of low complexity"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "163--169"
 }
 
 @incollection{s-ramsr-86
-, author =	"H. I. Stern"
-, title =	"A Routing Algorithm for a Mobile Search Robot"
-, booktitle =	"Impacts of Microcomputers on Operations Research"
-, year =	1986
-, pages =	"73--87"
-, update =	"93.09 milone+mitchell"
+, author =      "H. I. Stern"
+, title =       "A Routing Algorithm for a Mobile Search Robot"
+, booktitle =   "Impacts of Microcomputers on Operations Research"
+, year =        1986
+, pages =       "73--87"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{sh-srppi-72
-, author =	"B. M. Steward and F. Herzog"
-, title =	"Semi-regular plane polygons of integral type"
-, journal =	"Israel J. Math."
-, volume =	11
-, year =	1972
-, pages =	"31--52"
-, update =	"97.11 bibrelex"
+, author =      "B. M. Steward and F. Herzog"
+, title =       "Semi-regular plane polygons of integral type"
+, journal =     "Israel J. Math."
+, volume =      11
+, year =        1972
+, pages =       "31--52"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{sg-osacs-93
-, author =	"A. Stewart and S. Ghali"
-, title =	"An output sensitive algorithm for the computation of shadow boundaries"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"291--296"
-, cites =	"cf-nrtsg-89, cf-aaial-91, cf-fopsg-92, h-dmr-92, ltg-dmar-92, m-eahsr-89, s-agtd-34, gcs-ecrag-91, st-pplup-86, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "A. Stewart and S. Ghali"
+, title =       "An output sensitive algorithm for the computation of shadow boundaries"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "291--296"
+, cites =       "cf-nrtsg-89, cf-aaial-91, cf-fopsg-92, h-dmr-92, ltg-dmar-92, m-eahsr-89, s-agtd-34, gcs-ecrag-91, st-pplup-86, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{s-fhcap-98
-, author =	"A. J. Stewart"
-, title =	"Fast Horizon Computation at All Points of a Terrain with Visibility and Shading Applications"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	4
-, number =	1
-, month =	jan
-, year =	1998
-, pages =	"82--93"
-, update =	"98.07 held"
+, author =      "A. J. Stewart"
+, title =       "Fast Horizon Computation at All Points of a Terrain with Visibility and Shading Applications"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      4
+, number =      1
+, month =       jan
+, year =        1998
+, pages =       "82--93"
+, update =      "98.07 held"
 }
 
 @inproceedings{s-hvt-97
-, author =	"A. James Stewart"
-, title =	"Hierarchical Visibility in Terrains"
-, booktitle =	"Eurographics Rendering Workshop"
-, month =	jun
-, year =	1997
-, url =	"http://www.dgp.toronto.edu/people/JamesStewart/papers/egrw97.html"
-, update =	"98.03 mitchell"
+, author =      "A. James Stewart"
+, title =       "Hierarchical Visibility in Terrains"
+, booktitle =   "Eurographics Rendering Workshop"
+, month =       jun
+, year =        1997
+, url = "http://www.dgp.toronto.edu/people/JamesStewart/papers/egrw97.html"
+, update =      "98.03 mitchell"
 }
 
 @article{s-lrapi-94
-, author =	"A. J. Stewart"
-, title =	"Local Robustness and its Application to Polyhedral Intersection"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, number =	1
-, year =	1994
-, pages =	"87--118"
-, update =	"96.05 pascucci"
+, author =      "A. J. Stewart"
+, title =       "Local Robustness and its Application to Polyhedral Intersection"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, number =      1
+, year =        1994
+, pages =       "87--118"
+, update =      "96.05 pascucci"
 }
 
 @techreport{s-mibap-91
-, author =	"A. J. Stewart"
-, title =	"Maximizing incidences between approximate polygons is {NP}-hard"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1991
+, author =      "A. J. Stewart"
+, title =       "Maximizing incidences between approximate polygons is {NP}-hard"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1991
 }
 
 @inproceedings{s-rplap-91
-, author =	"A. J. Stewart"
-, title =	"Robust point location in approximate polygons"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"179--182"
-, keywords =	"point location, robustness"
-, cites =	"ds-rgnap-88, f-smpst-89, hhk-tirgc-88, m-vigau-88p, gss-egbra-89, si-cvd10-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "A. J. Stewart"
+, title =       "Robust point location in approximate polygons"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "179--182"
+, keywords =    "point location, robustness"
+, cites =       "ds-rgnap-88, f-smpst-89, hhk-tirgc-88, m-vigau-88p, gss-egbra-89, si-cvd10-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{s-tprgc-91
-, author =	"A. J. Stewart"
-, title =	"The theory and practice of robust geometric computation, or, how to build robust solid modelers"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	aug
-, year =	1991
-, note =	"Technical Report TR~91-1229"
-, keywords =	"doctoral thesis, robustness"
-, update =	"93.05 jones"
+, author =      "A. J. Stewart"
+, title =       "The theory and practice of robust geometric computation, or, how to build robust solid modelers"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       aug
+, year =        1991
+, note =        "Technical Report TR~91-1229"
+, keywords =    "doctoral thesis, robustness"
+, update =      "93.05 jones"
 }
 
 @inproceedings{sg-fcsbu-94
-, author =	"A. J. Stewart and S. Ghali"
-, title =	"Fast computation of shadow boundaries using spatial coherence and backprojections"
-, editor =	"A. Glassner"
-, booktitle =	"Proc. SIGGRAPH '94"
-, site =	"Orlando, FL"
-, publisher =	"ACM Press"
-, year =	1994
-, pages =	"231--238"
-, note =	"ISBN 0-89791-667-0"
-, update =	"98.07 bibrelex"
+, author =      "A. J. Stewart and S. Ghali"
+, title =       "Fast computation of shadow boundaries using spatial coherence and backprojections"
+, editor =      "A. Glassner"
+, booktitle =   "Proc. SIGGRAPH '94"
+, site =        "Orlando, FL"
+, publisher =   "ACM Press"
+, year =        1994
+, pages =       "231--238"
+, note =        "ISBN 0-89791-667-0"
+, update =      "98.07 bibrelex"
 }
 
 @book{s-imc-73
-, author =	"G. W. Stewart"
-, title =	"Introduction to Matrix Computations"
-, publisher =	"Academic Press"
-, address =	"New ork, NY"
-, year =	1973
-, update =	"98.07 bibrelex"
+, author =      "G. W. Stewart"
+, title =       "Introduction to Matrix Computations"
+, publisher =   "Academic Press"
+, address =     "New ork, NY"
+, year =        1973
+, update =      "98.07 bibrelex"
 }
 
 @article{s-mr-96
-, author =	"Ian Stewart"
-, title =	"Mathematical Recreations"
-, journal =	"Sci. Amer."
-, volume =	275
-, number =	2
-, month =	aug
-, year =	1996
-, pages =	"100--103"
-, note =	"Includes light in circular forest problem due to Janos Pach."
-, update =	"01.04 orourke, 97.11 orourke"
+, author =      "Ian Stewart"
+, title =       "Mathematical Recreations"
+, journal =     "Sci. Amer."
+, volume =      275
+, number =      2
+, month =       aug
+, year =        1996
+, pages =       "100--103"
+, note =        "Includes light in circular forest problem due to Janos Pach."
+, update =      "01.04 orourke, 97.11 orourke"
 }
 
 @article{s-scctf-92
-, author =	"N. F. Stewart"
-, title =	"A sufficient condition for correct topological form in tolerance specification"
-, journal =	"Comput. Aided Design"
-, volume =	12
-, year =	1992
-, pages =	"39--48"
-, update =	"98.07 bibrelex"
+, author =      "N. F. Stewart"
+, title =       "A sufficient condition for correct topological form in tolerance specification"
+, journal =     "Comput. Aided Design"
+, volume =      12
+, year =        1992
+, pages =       "39--48"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-affch-90
-, author =	"W. M. Stewart"
-, title =	"An algorithm to find the facets of the convex hull in higher dimensions"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"252--256"
-, cites =	"b-icp-83, ck-acp-70, g-eadch-72, ph-chfsp-77, ps-cgi-85, s-chaop-81, s-chdch-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "W. M. Stewart"
+, title =       "An algorithm to find the facets of the convex hull in higher dimensions"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "252--256"
+, cites =       "b-icp-83, ck-acp-70, g-eadch-72, ph-chfsp-77, ps-cgi-85, s-chaop-81, s-chdch-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{s-etspv-92
-, author =	"W. R. Stewart"
-, title =	"Euclidean traveling salesman problems and {Voronoi} diagrams"
-, type =	"Manuscript"
-, institution =	"School of Business Administration, College of William and Mary"
-, year =	1992
-, update =	"94.09 bernal"
+, author =      "W. R. Stewart"
+, title =       "Euclidean traveling salesman problems and {Voronoi} diagrams"
+, type =        "Manuscript"
+, institution = "School of Business Administration, College of William and Mary"
+, year =        1992
+, update =      "94.09 bernal"
 }
 
 @inproceedings{s-lfdle-81
-, author =	"J.-M. Steyaert"
-, title =	"La formule de {Lagrange} et ses applications au denombrement de familles d'arbres"
-, booktitle =	"Seminaire d'Informatique Theorique"
-, site =	"Universite Paris-VIII"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "J.-M. Steyaert"
+, title =       "La formule de {Lagrange} et ses applications au denombrement de familles d'arbres"
+, booktitle =   "Seminaire d'Informatique Theorique"
+, site =        "Universite Paris-VIII"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{s-msrcp-88
-, author =	"S. Stifter"
-, title =	"A medley of solutions to the robot collision problem in two and three dimensions"
-, type =	"Ph.{D}. Thesis"
-, school =	"Johannes Kepler Univ."
-, address =	"Linz, Austria"
-, year =	1988
-, note =	"Report RISC-LINZ 88-12.0"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "S. Stifter"
+, title =       "A medley of solutions to the robot collision problem in two and three dimensions"
+, type =        "Ph.{D}. Thesis"
+, school =      "Johannes Kepler Univ."
+, address =     "Linz, Austria"
+, year =        1988
+, note =        "Report RISC-LINZ 88-12.0"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @techreport{s-aavd3-88
-, author =	"S. Stifter"
-, title =	"An axiomatic approach to {Voronoi}-diagrams in $3$-{D}"
-, type =	"Report"
-, number =	"RISC-LINZ 88-64.0"
-, institution =	"Johannes Kepler Univ."
-, address =	"Linz, Austria"
-, year =	1988
-, precedes =	"s-aavd3-91"
+, author =      "S. Stifter"
+, title =       "An axiomatic approach to {Voronoi}-diagrams in $3$-{D}"
+, type =        "Report"
+, number =      "RISC-LINZ 88-64.0"
+, institution = "Johannes Kepler Univ."
+, address =     "Linz, Austria"
+, year =        1988
+, precedes =    "s-aavd3-91"
 }
 
 @article{s-aavd3-91
-, author =	"S. Stifter"
-, title =	"An axiomatic approach to {Voronoi}-diagrams in $3${D}"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	43
-, year =	1991
-, pages =	"361--374"
-, keywords =	"Voronoi diagrams, retraction methods, findpath problem, computational geometry"
-, succeeds =	"s-aavd3-88"
-, abstract =	"Voronoi-diagrams were first introduced for sets of
-		 points, and later generalized to other sets. There have
-		 been very few attempts to generalize Voronoi-diagrams
-		 for non-point sets to three (or higher) dimensions. We
-		 define a Voronoi-diagram for a quite general subset of
-		 three-space which is characterized by specific axioms.
-		 This diagram is one-dimensional and connected provided
-		 that the complement of the subset is connected. These
-		 Voronoi-diagrams can be used in retraction methods to
-		 solve the Findpath Problem for a ball moving in a
-		 three-dimensional environment. (Author abstract) 14
-		 Refs."
+, author =      "S. Stifter"
+, title =       "An axiomatic approach to {Voronoi}-diagrams in $3${D}"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      43
+, year =        1991
+, pages =       "361--374"
+, keywords =    "Voronoi diagrams, retraction methods, findpath problem, computational geometry"
+, succeeds =    "s-aavd3-88"
+, abstract =    "Voronoi-diagrams were first introduced for sets of
+                 points, and later generalized to other sets. There have
+                 been very few attempts to generalize Voronoi-diagrams
+                 for non-point sets to three (or higher) dimensions. We
+                 define a Voronoi-diagram for a quite general subset of
+                 three-space which is characterized by specific axioms.
+                 This diagram is one-dimensional and connected provided
+                 that the complement of the subset is connected. These
+                 Voronoi-diagrams can be used in retraction methods to
+                 solve the Findpath Problem for a ball moving in a
+                 three-dimensional environment. (Author abstract) 14
+                 Refs."
 }
 
 @techreport{s-avdsf-88
-, author =	"S. Stifter"
-, title =	"Application of {Voronoi}-diagrams to solve the findpath problem in $3$-{D}"
-, type =	"Report"
-, number =	"RISC-LINZ 88-71.0"
-, institution =	"Johannes Kepler Univ."
-, address =	"Linz, Austria"
-, year =	1988
+, author =      "S. Stifter"
+, title =       "Application of {Voronoi}-diagrams to solve the findpath problem in $3$-{D}"
+, type =        "Report"
+, number =      "RISC-LINZ 88-71.0"
+, institution = "Johannes Kepler Univ."
+, address =     "Linz, Austria"
+, year =        1988
 }
 
 @article{s-ccega-97
-, author =	"S. Stifter"
-, title =	"Characterization of contour elements that generate abstract {Voronoi} diagrams"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	245
-, update =	"97.07 devillers"
+, author =      "S. Stifter"
+, title =       "Characterization of contour elements that generate abstract {Voronoi} diagrams"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       245
+, update =      "97.07 devillers"
 }
 
 @inproceedings{s-gtpvs-93
-, author =	"Sabine Stifter"
-, title =	"Geometry Theorem Proving in Vector Spaces"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"56--58"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
+, author =      "Sabine Stifter"
+, title =       "Geometry Theorem Proving in Vector Spaces"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "56--58"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking, 93.09 milone+mitchell"
 }
 
 @inproceedings{s-npprm-95
-, author =	"Sabine Stifter"
-, title =	"Numerical Problems in the Plane {Roider} Method"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"53--56"
-, update =	"00.03 bibrelex"
+, author =      "Sabine Stifter"
+, title =       "Numerical Problems in the Plane {Roider} Method"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "53--56"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{s-pacfp-91
-, author =	"Sabine Stifter"
-, title =	"Predictions about collision free paths from intersection tests"
-, booktitle =	"Proc. Computational Geometry: Methods, Algorithms and Applications"
-, nickname =	"CG '91"
-, site =	"Bern"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	553
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"309--320"
-, keywords =	"motion planning"
-, update =	"00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
-, annote =	"7th Intern. Workshop Comput. Geom."
+, author =      "Sabine Stifter"
+, title =       "Predictions about collision free paths from intersection tests"
+, booktitle =   "Proc. Computational Geometry: Methods, Algorithms and Applications"
+, nickname =    "CG '91"
+, site =        "Bern"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      553
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "309--320"
+, keywords =    "motion planning"
+, update =      "00.03 bibrelex, 98.03 icking, 97.11 icking, 94.01 rote"
+, annote =      "7th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{s-spp-92
-, author =	"Sabine Stifter"
-, title =	"Secure Path Planning"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"7--8"
-, update =	"00.03 bibrelex"
+, author =      "Sabine Stifter"
+, title =       "Secure Path Planning"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "7--8"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{s-tcgac-94
-, author =	"Sabine Stifter"
-, title =	"Technological Conditions in Geometric Algorithms: A Case Study for the Nesting Problem"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"78--80"
-, cites =	"ZZZ"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Sabine Stifter"
+, title =       "Technological Conditions in Geometric Algorithms: A Case Study for the Nesting Problem"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "78--80"
+, cites =       "ZZZ"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{s-vdt3d-90
-, author =	"Sabine Stifter"
-, title =	"{Voronoi}-{Diagramme} f{\"u}r {Teilmengen} des {3D} und ihre {Anwendung} auf {Kollisionsprobleme} bei {Robotern}"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	24
-, update =	"00.03 bibrelex"
+, author =      "Sabine Stifter"
+, title =       "{Voronoi}-{Diagramme} f{\"u}r {Teilmengen} des {3D} und ihre {Anwendung} auf {Kollisionsprobleme} bei {Robotern}"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       24
+, update =      "00.03 bibrelex"
 }
 
 @book{s-ctcgt-80
-, author =	"J. Stillwell"
-, title =	"Classical Topology and Combinatorial Group Theory"
-, editor =	"P. R. Halmos and F. W. Gehring and C. C. Moore"
-, series =	"Graduate Texts in Mathematics"
-, number =	72
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1980
-, isbn =	"0-387-90516-2"
-, update =	"98.07 bibrelex, 97.11 bibrelex"
+, author =      "J. Stillwell"
+, title =       "Classical Topology and Combinatorial Group Theory"
+, editor =      "P. R. Halmos and F. W. Gehring and C. C. Moore"
+, series =      "Graduate Texts in Mathematics"
+, number =      72
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1980
+, isbn =        "0-387-90516-2"
+, update =      "98.07 bibrelex, 97.11 bibrelex"
 }
 
 @book{s-ctcgt-93
-, author =	"J. Stillwell"
-, title =	"Classical Topology and Combinatorial Group Theory"
-, publisher =	"Springer-Verlag"
-, address =	"New York"
-, year =	1993
-, update =	"00.03 bibrelex"
+, author =      "J. Stillwell"
+, title =       "Classical Topology and Combinatorial Group Theory"
+, publisher =   "Springer-Verlag"
+, address =     "New York"
+, year =        1993
+, update =      "00.03 bibrelex"
 }
 
 @article{s-oocsf-83
-, author =	"L. Stockmeyer"
-, title =	"Optimal Orientation of Cells in Slicing Floorplan Design"
-, journal =	"Inform. Control"
-, volume =	57
-, year =	1983
-, pages =	"91--101"
-, update =	"96.01 tamassia"
+, author =      "L. Stockmeyer"
+, title =       "Optimal Orientation of Cells in Slicing Floorplan Design"
+, journal =     "Inform. Control"
+, volume =      57
+, year =        1983
+, pages =       "91--101"
+, update =      "96.01 tamassia"
 }
 
 @book{s-eidnm-83
-, author =	"J. Stoer"
-, title =	"Einf{\"u}hrung in die {Numerische} {Mathematik} {I}"
-, publisher =	"Springer-Verlag"
-, year =	1983
-, update =	"98.07 bibrelex"
+, author =      "J. Stoer"
+, title =       "Einf{\"u}hrung in die {Numerische} {Mathematik} {I}"
+, publisher =   "Springer-Verlag"
+, year =        1983
+, update =      "98.07 bibrelex"
 }
 
 @book{sb-ina-80
-, author =	"J. Stoer and R. Bullirsch"
-, title =	"Introduction to Numerical Analysis"
-, publisher =	"Springer-Verlag"
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "J. Stoer and R. Bullirsch"
+, title =       "Introduction to Numerical Analysis"
+, publisher =   "Springer-Verlag"
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @book{sw-cofd1-70
-, author =	"J. Stoer and C. Witzgall"
-, title =	"Convexity and optimization in finite dimensions {I}"
-, publisher =	"Springer-Verlag"
-, year =	1970
+, author =      "J. Stoer and C. Witzgall"
+, title =       "Convexity and optimization in finite dimensions {I}"
+, publisher =   "Springer-Verlag"
+, year =        1970
 }
 
 @inproceedings{sw-smca-94
-, author =	"M. Stoer and F. Wagner"
-, title =	"A Simple Min Cut Algorithm"
-, booktitle =	"Proc. 2nd Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	855
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"141--147"
-, update =	"97.03 gaertner+salinger"
+, author =      "M. Stoer and F. Wagner"
+, title =       "A Simple Min Cut Algorithm"
+, booktitle =   "Proc. 2nd Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      855
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "141--147"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{s-cgh-88
-, author =	"I. Stojmenovic"
-, title =	"Computational Geometry on a Hypercube"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, year =	1988
-, pages =	"100--103"
-, update =	"98.07 bibrelex"
+, author =      "I. Stojmenovic"
+, title =       "Computational Geometry on a Hypercube"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, year =        1988
+, pages =       "100--103"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{s-cvcpp-90t
-, author =	"I. Stojmenovi{\'c}"
-, title =	"Cutting the volumes of convex polyhedra by a plane"
-, type =	"Technical Report"
-, number =	"TR-90-23"
-, institution =	"Univ. Ottawa"
-, address =	"Ottawa, ON"
-, month =	jun
-, year =	1990
-, precedes =	"s-cvcpp-90i"
+, author =      "I. Stojmenovi{\'c}"
+, title =       "Cutting the volumes of convex polyhedra by a plane"
+, type =        "Technical Report"
+, number =      "TR-90-23"
+, institution = "Univ. Ottawa"
+, address =     "Ottawa, ON"
+, month =       jun
+, year =        1990
+, precedes =    "s-cvcpp-90i"
 }
 
 @inproceedings{s-cvcpp-90i
-, author =	"I. Stojmenovi{\'c}"
-, title =	"Cutting the volumes of convex polyhedra by a plane"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"291--295"
-, succeeds =	"s-cvcpp-90t"
-, cites =	"a-dapa-89, aw-plts-88, e-acg-87, gm-eha3s-87, m-ptlp-85, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "I. Stojmenovi{\'c}"
+, title =       "Cutting the volumes of convex polyhedra by a plane"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "291--295"
+, succeeds =    "s-cvcpp-90t"
+, cites =       "a-dapa-89, aw-plts-88, e-acg-87, gm-eha3s-87, m-ptlp-85, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-flmdc-93
-, author =	"I. Stojmenovi{\'c}"
-, title =	"Finding the largest $m$-dimensional circle in a $k$-dimensional box"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"328--333"
-, cites =	"ew-falc3-91t, ew-falc3-91, sb-mla-89, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "I. Stojmenovi{\'c}"
+, title =       "Finding the largest $m$-dimensional circle in a $k$-dimensional box"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "328--333"
+, cites =       "ew-falc3-91t, ew-falc3-91, sb-mla-89, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @techreport{s-ndcha-85
-, author =	"I. Stojmenovi{\'c}"
-, title =	"$n$-dimensional convex hull algorithm"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1985
-, keywords =	"convex hull"
-, update =	"94.05 devillers"
+, author =      "I. Stojmenovi{\'c}"
+, title =       "$n$-dimensional convex hull algorithm"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1985
+, keywords =    "convex hull"
+, update =      "94.05 devillers"
 }
 
 @article{sl-pdcms-88
-, author =	"I. Stojmenovi{\'c} and M. A. Langston"
-, title =	"On a Proposed Divide-and Conquer Minimal Spanning Tree Algorithm"
-, journal =	"BIT"
-, volume =	28
-, year =	1988
-, pages =	"755--791"
-, annote =	"Discusses errors in \cite{cl-omsta-86}"
+, author =      "I. Stojmenovi{\'c} and M. A. Langston"
+, title =       "On a Proposed Divide-and Conquer Minimal Spanning Tree Algorithm"
+, journal =     "BIT"
+, volume =      28
+, year =        1988
+, pages =       "755--791"
+, annote =      "Discusses errors in \cite{cl-omsta-86}"
 }
 
 @article{ss-nach-86
-, author =	"I. Stojmenovi{\'c} and E. Soisalon-Soininen"
-, title =	"A note on approximate convex hulls"
-, journal =	"Inform. Process. Lett."
-, volume =	22
-, year =	1986
-, pages =	"55--56"
+, author =      "I. Stojmenovi{\'c} and E. Soisalon-Soininen"
+, title =       "A note on approximate convex hulls"
+, journal =     "Inform. Process. Lett."
+, volume =      22
+, year =        1986
+, pages =       "55--56"
 }
 
 @inproceedings{s-opg-87
-, author =	"J. Stolfi"
-, title =	"Oriented projective geometry"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"76--85"
-, precedes =	"s-pcg-88"
-, cites =	"bbr-ecit-85, c-rpp-49, i-ppc-85, ir-cpc-84, r-hcppc-81, h-hgc-84, hs-cagcu-84, grs-kfcg-83, ZZZ"
-, update =	"98.03 bibrelex, 93.09 milone+mitchell"
+, author =      "J. Stolfi"
+, title =       "Oriented projective geometry"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "76--85"
+, precedes =    "s-pcg-88"
+, cites =       "bbr-ecit-85, c-rpp-49, i-ppc-85, ir-cpc-84, r-hcppc-81, h-hgc-84, hs-cagcu-84, grs-kfcg-83, ZZZ"
+, update =      "98.03 bibrelex, 93.09 milone+mitchell"
 }
 
 @book{s-opgfg-91
-, author =	"J. Stolfi"
-, title =	"Oriented Projective Geometry: A Framework for Geometric Computations"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1991
-, keywords =	"oriented projective geometry, duality, convexity, Pl{\"u}cker coordinates"
-, succeeds =	"s-pcg-88"
-, update =	"95.05 korneenko"
+, author =      "J. Stolfi"
+, title =       "Oriented Projective Geometry: A Framework for Geometric Computations"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1991
+, keywords =    "oriented projective geometry, duality, convexity, Pl{\"u}cker coordinates"
+, succeeds =    "s-pcg-88"
+, update =      "95.05 korneenko"
 }
 
 @phdthesis{s-pcg-88
-, author =	"J. Stolfi"
-, title =	"Primitives for Computational Geometry"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, month =	may
-, year =	1988
-, note =	"Reprinted as Technical Report 36, DEC Systems Research Center, January 1989"
-, keywords =	"doctoral thesis"
-, succeeds =	"s-opg-87"
-, precedes =	"s-opgfg-91"
-, update =	"95.05 jones"
+, author =      "J. Stolfi"
+, title =       "Primitives for Computational Geometry"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, month =       may
+, year =        1988
+, note =        "Reprinted as Technical Report 36, DEC Systems Research Center, January 1989"
+, keywords =    "doctoral thesis"
+, succeeds =    "s-opg-87"
+, precedes =    "s-opgfg-91"
+, update =      "95.05 jones"
 }
 
 @techreport{sg-nsdbt-83
-, author =	"J. Stolfi and Leonidas J. Guibas"
-, title =	"A note on the shortest distance between two sets of points"
-, type =	"Report"
-, number =	"??"
-, institution =	"Xerox Palo Alto Res. Center"
-, address =	"Palo Alto, CA"
-, year =	1983
-, update =	"98.03 mitchell"
+, author =      "J. Stolfi and Leonidas J. Guibas"
+, title =       "A note on the shortest distance between two sets of points"
+, type =        "Report"
+, number =      "??"
+, institution = "Xerox Palo Alto Res. Center"
+, address =     "Palo Alto, CA"
+, year =        1983
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{shs-riids-86
-, author =	"M. Stonebreaker and E. Hanson and T. Sellis"
-, title =	"Rule Indexing Implementations in Database Systems"
-, booktitle =	"Proc. 1st Int. Conf. on Expert Database Systems"
-, year =	1986
-, update =	"96.09 kreveld"
+, author =      "M. Stonebreaker and E. Hanson and T. Sellis"
+, title =       "Rule Indexing Implementations in Database Systems"
+, booktitle =   "Proc. 1st Int. Conf. on Expert Database Systems"
+, year =        1986
+, update =      "96.09 kreveld"
 }
 
 @article{s-mncpe-84
-, author =	"J. A. Storer"
-, title =	"On minimal node-cost planar embeddings"
-, journal =	"Networks"
-, volume =	14
-, year =	1984
-, pages =	"181--212"
-, keywords =	"approximation, graph drawing"
-, succeeds =	"s-ncmeg-80"
-, update =	"93.09 tamassia"
+, author =      "J. A. Storer"
+, title =       "On minimal node-cost planar embeddings"
+, journal =     "Networks"
+, volume =      14
+, year =        1984
+, pages =       "181--212"
+, keywords =    "approximation, graph drawing"
+, succeeds =    "s-ncmeg-80"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{s-ncmeg-80
-, author =	"J. A. Storer"
-, title =	"The node cost measure for embedding graphs on the planar grid"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
-, year =	1980
-, pages =	"201--210"
-, keywords =	"approximation"
-, precedes =	"s-mncpe-84"
+, author =      "J. A. Storer"
+, title =       "The node cost measure for embedding graphs on the planar grid"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Theory Comput."
+, year =        1980
+, pages =       "201--210"
+, keywords =    "approximation"
+, precedes =    "s-mncpe-84"
 }
 
 @techreport{sr-spppo-??
-, author =	"J. A. Storer and J. H. Reif"
-, title =	"Shortest paths in the plane with polygonal obstacles"
-, type =	"Technical {Report}"
-, year =	"??"
-, succeeds =	"rs-spesp-85"
-, precedes =	"sr-spppo-94"
-, update =	"99.07 smid, 93.09 milone+mitchell"
+, author =      "J. A. Storer and J. H. Reif"
+, title =       "Shortest paths in the plane with polygonal obstacles"
+, type =        "Technical {Report}"
+, year =        "??"
+, succeeds =    "rs-spesp-85"
+, precedes =    "sr-spppo-94"
+, update =      "99.07 smid, 93.09 milone+mitchell"
 }
 
 @article{sr-spppo-94
-, author =	"J. A. Storer and J. H. Reif"
-, title =	"Shortest paths in the plane with polygonal obstacles"
-, journal =	"J. ACM"
-, volume =	41
-, number =	5
-, year =	1994
-, pages =	"982--1012"
-, succeeds =	"rs-spesp-85"
-, update =	"95.05 mitchell"
+, author =      "J. A. Storer and J. H. Reif"
+, title =       "Shortest paths in the plane with polygonal obstacles"
+, journal =     "J. ACM"
+, volume =      41
+, number =      5
+, year =        1994
+, pages =       "982--1012"
+, succeeds =    "rs-spesp-85"
+, update =      "95.05 mitchell"
 }
 
 @article{s-afvio-73
-, author =	"S. Storoy"
-, title =	"An algorithm for finding a vector in the intersection of open convex polyhedral cones"
-, journal =	"BIT"
-, volume =	13
-, year =	1973
-, pages =	"114--119"
+, author =      "S. Storoy"
+, title =       "An algorithm for finding a vector in the intersection of open convex polyhedral cones"
+, journal =     "BIT"
+, volume =      13
+, year =        1973
+, pages =       "114--119"
 }
 
 @techreport{s-ctgp-89
-, author =	"Q. Stout"
-, title =	"Constant-time geometry on {PRAMs}"
-, type =	"Manuscript"
-, institution =	"Univ. of Michigan"
-, address =	"Univ. Illinois, Urbana, IL."
-, year =	1989
-, comments =	"talk was the Semi-Annual Lunch, Algorithms, and Dinner Symposium"
-, update =	"93.09 milone+mitchell"
+, author =      "Q. Stout"
+, title =       "Constant-time geometry on {PRAMs}"
+, type =        "Manuscript"
+, institution = "Univ. of Michigan"
+, address =     "Univ. Illinois, Urbana, IL."
+, year =        1989
+, comments =    "talk was the Semi-Annual Lunch, Algorithms, and Dinner Symposium"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{s-dslpc-82
-, author =	"Q. F. Stout"
-, title =	"Drawing straight lines with a pyramid cellular automaton"
-, journal =	"Inform. Process. Lett."
-, volume =	15
-, year =	1982
-, pages =	"233--237"
-, update =	"97.11 bibrelex"
+, author =      "Q. F. Stout"
+, title =       "Drawing straight lines with a pyramid cellular automaton"
+, journal =     "Inform. Process. Lett."
+, volume =      15
+, year =        1982
+, pages =       "233--237"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{s-mpcig-85
-, author =	"Q. F. Stout"
-, title =	"Mesh and pyramid computers inspired by geometric algorithms"
-, booktitle =	"Workshop on Algorithm-Guided Parallel Architectures for Automatic Target Recognition"
-, year =	1985
-, pages =	"293--315"
-, update =	"97.11 bibrelex"
+, author =      "Q. F. Stout"
+, title =       "Mesh and pyramid computers inspired by geometric algorithms"
+, booktitle =   "Workshop on Algorithm-Guided Parallel Architectures for Automatic Target Recognition"
+, year =        1985
+, pages =       "293--315"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-pcscp-85
-, author =	"Q. F. Stout"
-, title =	"Pyramid computer solutions of the closest pair problem"
-, journal =	"J. Algorithms"
-, volume =	"??"
-, year =	1985
-, note =	"To appear"
-, update =	"97.11 bibrelex"
+, author =      "Q. F. Stout"
+, title =       "Pyramid computer solutions of the closest pair problem"
+, journal =     "J. Algorithms"
+, volume =      "??"
+, year =        1985
+, note =        "To appear"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{s-smsft-83
-, author =	"Q. F. Stout"
-, title =	"Sorting, merging, selecting, and filtering on tree and pyramid machines"
-, booktitle =	"Proc. Internat. Conf. Parallel Process."
-, year =	1983
-, pages =	"214--221"
-, update =	"97.11 bibrelex"
+, author =      "Q. F. Stout"
+, title =       "Sorting, merging, selecting, and filtering on tree and pyramid machines"
+, booktitle =   "Proc. Internat. Conf. Parallel Process."
+, year =        1983
+, pages =       "214--221"
+, update =      "97.11 bibrelex"
 }
 
 @book{skm-sgia-87
-, author =	"D. Stoyan and W. S. Kendall and J. Mecke"
-, title =	"Stochastic Geometry and its Applications"
-, publisher =	"Akadamie-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1987
-, update =	"96.09 agarwal"
-, annote =	"Contains a summary of Voronoi diagram applications in
-		 a variety of areas."
+, author =      "D. Stoyan and W. S. Kendall and J. Mecke"
+, title =       "Stochastic Geometry and its Applications"
+, publisher =   "Akadamie-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1987
+, update =      "96.09 agarwal"
+, annote =      "Contains a summary of Voronoi diagram applications in
+                 a variety of areas."
 }
 
 @book{skm-sga-95
-, author =	"D. Stoyan and W. S. Kendall and J. Mecke"
-, title =	"Stochastic Geometry and its Applications"
-, edition =	"2nd"
-, publisher =	"Wiley-Interscience"
-, year =	1995
-, update =	"01.11 pocchiola"
-, annote =	"Contains a summary of Voronoi diagram applications in
-		 a variety of areas."
+, author =      "D. Stoyan and W. S. Kendall and J. Mecke"
+, title =       "Stochastic Geometry and its Applications"
+, edition =     "2nd"
+, publisher =   "Wiley-Interscience"
+, year =        1995
+, update =      "01.11 pocchiola"
+, annote =      "Contains a summary of Voronoi diagram applications in
+                 a variety of areas."
 }
 
 @article{ss-apror-81
-, author =	"Y. G. Stoyan and S. V. Smelyakov"
-, title =	"An approach to the problems of routing optimization in the regions of intricate shape"
-, journal =	"Inform. Process. Lett."
-, volume =	13
-, year =	1981
-, pages =	"39--43"
+, author =      "Y. G. Stoyan and S. V. Smelyakov"
+, title =       "An approach to the problems of routing optimization in the regions of intricate shape"
+, journal =     "Inform. Process. Lett."
+, volume =      13
+, year =        1981
+, pages =       "39--43"
 }
 
 @article{s-mftd-83
-, author =	"G. Strang"
-, title =	"Maximal flow through a domain"
-, journal =	"Math. Program."
-, volume =	26
-, year =	1983
-, pages =	"123--143"
-, update =	"98.03 bibrelex"
+, author =      "G. Strang"
+, title =       "Maximal flow through a domain"
+, journal =     "Math. Program."
+, volume =      26
+, year =        1983
+, pages =       "123--143"
+, update =      "98.03 bibrelex"
 }
 
 @article{s-wc-82
-, author =	"G. Strang"
-, title =	"The width of a chair"
-, journal =	"Amm. Math. Monthly"
-, volume =	89
-, year =	1982
-, pages =	"529--535"
-, update =	"98.03 bibrelex"
+, author =      "G. Strang"
+, title =       "The width of a chair"
+, journal =     "Amm. Math. Monthly"
+, volume =      89
+, year =        1982
+, pages =       "529--535"
+, update =      "98.03 bibrelex"
 }
 
 @book{sf-afem-73
-, author =	"G. Strang and G. Fix"
-, title =	"An Alaysis of the Finite Element Method"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1973
-, update =	"97.11 bibrelex"
+, author =      "G. Strang and G. Fix"
+, title =       "An Alaysis of the Finite Element Method"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1973
+, update =      "97.11 bibrelex"
 }
 
 @incollection{s-act-90
-, author =	"Volker Strassen"
-, title =	"Algebraic Complexity Theory"
-, chapter =	11
-, editor =	"J. van Leeuwen"
-, booktitle =	"Algorithms and Complexity"
-, series =	"Handbook of Theoretical Computer Science"
-, volume =	"A"
-, publisher =	"MIT Press"
-, year =	1990
-, pages =	"633--672"
-, update =	"97.07 agarwal"
+, author =      "Volker Strassen"
+, title =       "Algebraic Complexity Theory"
+, chapter =     11
+, editor =      "J. van Leeuwen"
+, booktitle =   "Algorithms and Complexity"
+, series =      "Handbook of Theoretical Computer Science"
+, volume =      "A"
+, publisher =   "MIT Press"
+, year =        1990
+, pages =       "633--672"
+, update =      "97.07 agarwal"
 }
 
 @incollection{s-c3do2-88
-, author =	"W. Stra{\ss}er"
-, title =	"Constructing 3${D}$ Objects from 2${D}$ Information"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series"
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"967--996"
-, isbn =	"3-540-19506-8"
-, update =	"93.09 held"
+, author =      "W. Stra{\ss}er"
+, title =       "Constructing 3${D}$ Objects from 2${D}$ Information"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series"
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "967--996"
+, isbn =        "3-540-19506-8"
+, update =      "93.09 held"
 }
 
 % now Bulletin of the Polish Academy of Sciences
 @article{s-supgd-57
-, author =	"S. Straszewicz"
-, title =	"Sur un probl{\`e}me geometrique de {P}. {Erd{\H o}s}"
-, journal =	"Bulletin de l'Acad{\'e}mie Polonaise des Sciences, Classe III"
-, volume =	5
-, year =	1957
-, pages =	"39--40"
-, update =	"93.09 rote"
+, author =      "S. Straszewicz"
+, title =       "Sur un probl{\`e}me geometrique de {P}. {Erd{\H o}s}"
+, journal =     "Bulletin de l'Acad{\'e}mie Polonaise des Sciences, Classe III"
+, volume =      5
+, year =        1957
+, pages =       "39--40"
+, update =      "93.09 rote"
 }
 
 @inproceedings{s-capnc-00
-, author =	"I. Streinu"
-, title =	"A combinatorial approach to planar non-colliding robot arm motion planning"
-, booktitle =	"Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS 2000"
-, site =	"Redondo Beach, California"
-, publisher =	"IEEE"
-, month =	nov
-, year =	2000
-, note =	"443--453"
-, update =	"01.04 orourke+pocchiola"
+, author =      "I. Streinu"
+, title =       "A combinatorial approach to planar non-colliding robot arm motion planning"
+, booktitle =   "Proc. 41st Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS 2000"
+, site =        "Redondo Beach, California"
+, publisher =   "IEEE"
+, month =       nov
+, year =        2000
+, note =        "443--453"
+, update =      "01.04 orourke+pocchiola"
 }
 
 @techreport{s-cs-96
-, author =	"I. Streinu"
-, title =	"Clusters of stars"
-, institution =	"Dept. Comput. Sci., Smith College"
-, address =	"Northampton, MA"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "I. Streinu"
+, title =       "Clusters of stars"
+, institution = "Dept. Comput. Sci., Smith College"
+, address =     "Northampton, MA"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{s-cs-97
-, author =	"I. Streinu"
-, title =	"Clusters of Stars"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"439--441"
-, cites =	"blwsz-om-93, eos-calha-86, ehn-sisp-96, gp-sccca-84, gp-asotd-93, k-ah-92, os-vepvgcr-97, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "I. Streinu"
+, title =       "Clusters of Stars"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "439--441"
+, cites =       "blwsz-om-93, eos-calha-86, ehn-sisp-96, gp-sccca-84, gp-asotd-93, k-ah-92, os-vepvgcr-97, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @techreport{s-nspvg-96
-, author =	"I. Streinu"
-, title =	"Nonstretchable pseudo-visibility graphs"
-, type =	"Technical {Report}"
-, number =	055
-, institution =	"Dept. Comput. Sci., Smith College"
-, month =	dec
-, year =	1996
-, keywords =	"visibility"
-, update =	"97.11 orourke"
+, author =      "I. Streinu"
+, title =       "Nonstretchable pseudo-visibility graphs"
+, type =        "Technical {Report}"
+, number =      055
+, institution = "Dept. Comput. Sci., Smith College"
+, month =       dec
+, year =        1996
+, keywords =    "visibility"
+, update =      "97.11 orourke"
 }
 
 @article{sk-lrmme-99
-, author =	"T. Strijk and M. van Kreveld"
-, title =	"Labeling a rectilinear map more efficiently"
-, journal =	"Inform. Process. Lett."
-, volume =	69
-, year =	1999
-, pages =	"25--30"
-, update =	"99.07 smid"
+, author =      "T. Strijk and M. van Kreveld"
+, title =       "Labeling a rectilinear map more efficiently"
+, journal =     "Inform. Process. Lett."
+, volume =      69
+, year =        1999
+, pages =       "25--30"
+, update =      "99.07 smid"
 }
 
 @article{sw-lpc-01
-, author =	"T. Strijk and A. Wolff"
-, title =	"Labeling points with circles"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"181--195"
-, update =	"01.07 smid"
+, author =      "T. Strijk and A. Wolff"
+, title =       "Labeling points with circles"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "181--195"
+, update =      "01.07 smid"
 }
 
 @techreport{sk-smmpp-91
-, author =	"D. Strip and M. Karasick"
-, title =	"Solid modeling on a massively parallel processor"
-, institution =	"IBM, Research Division"
-, month =	feb
-, year =	1991
-, precedes =	"sk-smmpp-92"
-, update =	"97.03 aronov, 93.09 milone+mitchell"
+, author =      "D. Strip and M. Karasick"
+, title =       "Solid modeling on a massively parallel processor"
+, institution = "IBM, Research Division"
+, month =       feb
+, year =        1991
+, precedes =    "sk-smmpp-92"
+, update =      "97.03 aronov, 93.09 milone+mitchell"
 }
 
 % The journal: International Journal of Supercomputer Applications
 % seems not to be in "authority" file.
 @article{sk-smmpp-92
-, author =	"David Strip and Michael Karasick"
-, title =	"Solid Modeling on a Massively Parallel Processor"
-, journal =	"Internat. J. Supercomputer Appl."
-, volume =	6
-, year =	"Summer 1992"
-, pages =	"175--92??"
-, note =	"From IBM TR index: full volume/no/pages date vol. 6, no. 2, p. 175-92, Summer 1992. Entry ID 3876. Is this the report number for IBM TRs"
-, succeeds =	"sk-smmpp-91"
-, update =	"97.03 aronov"
+, author =      "David Strip and Michael Karasick"
+, title =       "Solid Modeling on a Massively Parallel Processor"
+, journal =     "Internat. J. Supercomputer Appl."
+, volume =      6
+, year =        "Summer 1992"
+, pages =       "175--92??"
+, note =        "From IBM TR index: full volume/no/pages date vol. 6, no. 2, p. 175-92, Summer 1992. Entry ID 3876. Is this the report number for IBM TRs"
+, succeeds =    "sk-smmpp-91"
+, update =      "97.03 aronov"
 }
 
 @book{s-dg-69
-, author =	"J. J. Stroker"
-, title =	"Differential Geometry"
-, publisher =	"Wiley-Interscience"
-, year =	1969
-, update =	"95.01 schwarzkopf"
+, author =      "J. J. Stroker"
+, title =       "Differential Geometry"
+, publisher =   "Wiley-Interscience"
+, year =        1969
+, update =      "95.01 schwarzkopf"
 }
 
 @inproceedings{ss-kaud-88
-, author =	"Th. Strothotte and J.-R. Sack"
-, title =	"Knowledge Acquisition using Diagrams"
-, booktitle =	"Proc. 3rd IFIP Conference on Man-Machine Systems"
-, site =	"Oulo, Finland"
-, year =	1988
-, update =	"99.11 smid, 97.11 sack"
+, author =      "Th. Strothotte and J.-R. Sack"
+, title =       "Knowledge Acquisition using Diagrams"
+, booktitle =   "Proc. 3rd IFIP Conference on Man-Machine Systems"
+, site =        "Oulo, Finland"
+, year =        1988
+, update =      "99.11 smid, 97.11 sack"
 }
 
 @book{s-acmi-71
-, author =	"A. H. Stroud"
-, title =	"Approximate Calculation of Multiple Integrals"
-, publisher =	"Prentice Hall"
-, year =	1971
-, update =	"98.07 bibrelex"
+, author =      "A. H. Stroud"
+, title =       "Approximate Calculation of Multiple Integrals"
+, publisher =   "Prentice Hall"
+, year =        1971
+, update =      "98.07 bibrelex"
 }
 
 @book{s-cpl-86
-, author =	"B. Stroustrup"
-, title =	"The {C}++ Programming Language"
-, publisher =	"Addison-Wesley"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "B. Stroustrup"
+, title =       "The {C}++ Programming Language"
+, publisher =   "Addison-Wesley"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @techreport{sr-hdced-98
-, author =	"Anja Struyf and Peter J. Rousseeuw"
-, title =	"Halfspace Depth Characterizes the Empirical Distribution"
-, type =	"Manuscript"
-, institution =	"Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
-, year =	1998
-, keywords =	"coordinate-free, multivariate ranks, robustness, AMS Classification: 62G30, 62J05"
-, update =	"98.07 mitchell"
-, abstract =	"
+, author =      "Anja Struyf and Peter J. Rousseeuw"
+, title =       "Halfspace Depth Characterizes the Empirical Distribution"
+, type =        "Manuscript"
+, institution = "Dept. of Mathematics and Computer Science, University of Antwerp, Belgium"
+, year =        1998
+, keywords =    "coordinate-free, multivariate ranks, robustness, AMS Classification: 62G30, 62J05"
+, update =      "98.07 mitchell"
+, abstract =    "
 For any empirical multivariate distribution, we show that the
 resulting halfspace depth function determines the distribution
 completely. We do this by actually reconstructing the data points from
@@ -137354,683 +137354,683 @@ @techreport{sr-hdced-98
 }
 
 @article{sc-ctrmh-90
-, author =	"M. A. Stuff and J. N. Cederquist"
-, title =	"Coordinate transformations realizable with multiple holographic optical elements"
-, journal =	"J. Optical Soc. Amer."
-, volume =	"A7"
-, number =	6
-, year =	1990
-, pages =	"977--981"
-, update =	"97.11 bibrelex"
+, author =      "M. A. Stuff and J. N. Cederquist"
+, title =       "Coordinate transformations realizable with multiple holographic optical elements"
+, journal =     "J. Optical Soc. Amer."
+, volume =      "A7"
+, number =      6
+, year =        1990
+, pages =       "977--981"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{sw-ghdcl-95
-, author =	"G. Stumme and R. Wille"
-, title =	"A Geometrical Heuristic for Drawing Concept Lattices"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"452--459"
-, keywords =	"graph drawing, order, upward"
-, update =	"95.01 tamassia"
+, author =      "G. Stumme and R. Wille"
+, title =       "A Geometrical Heuristic for Drawing Concept Lattices"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "452--459"
+, keywords =    "graph drawing, order, upward"
+, update =      "95.01 tamassia"
 }
 
 @techreport{s-csg-87
-, author =	"B. Sturmfels"
-, title =	"Computational synthetic geometry"
-, type =	"Manuscript"
-, institution =	"Inst. Math. Appl., Univ. Minnesota"
-, address =	"Minneapolis, MN"
-, year =	1987
+, author =      "B. Sturmfels"
+, title =       "Computational synthetic geometry"
+, type =        "Manuscript"
+, institution = "Inst. Math. Appl., Univ. Minnesota"
+, address =     "Minneapolis, MN"
+, year =        1987
 }
 
 @article{s-cpdoc-87
-, author =	"Bernd Sturmfels"
-, title =	"Cyclic polytopes and d-order curves"
-, journal =	"Geom. Dedicta"
-, volume =	24
-, year =	1987
-, pages =	"103--107"
-, update =	"97.11 bibrelex"
+, author =      "Bernd Sturmfels"
+, title =       "Cyclic polytopes and d-order curves"
+, journal =     "Geom. Dedicta"
+, volume =      24
+, year =        1987
+, pages =       "103--107"
+, update =      "97.11 bibrelex"
 }
 
 @misc{s-gbcp-95
-, author =	"B. Sturmfels"
-, title =	"{Gr{\"o}bner} Bases and Convex Polytopes"
-, month =	apr
-, year =	1995
-, note =	"Expanded Lecture Notes from the Holiday Symposium at New Mexico State University"
-, update =	"97.11 bibrelex"
+, author =      "B. Sturmfels"
+, title =       "{Gr{\"o}bner} Bases and Convex Polytopes"
+, month =       apr
+, year =        1995
+, note =        "Expanded Lecture Notes from the Holiday Symposium at New Mexico State University"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-gbtv-91
-, author =	"B. Sturmfels"
-, title =	"{Gr{\"o}bner} Bases of Toric Varieties"
-, journal =	"Tohoku Math. J."
-, volume =	43
-, number =	2
-, year =	1991
-, pages =	"249--261"
-, update =	"97.11 bibrelex"
+, author =      "B. Sturmfels"
+, title =       "{Gr{\"o}bner} Bases of Toric Varieties"
+, journal =     "Tohoku Math. J."
+, volume =      43
+, number =      2
+, year =        1991
+, pages =       "249--261"
+, update =      "97.11 bibrelex"
 }
 
 @article{s-fcbmt-80
-, author =	"M. Styness"
-, title =	"On faster convergence of the bisection method for all triangles"
-, journal =	"Math. Comput."
-, volume =	35
-, year =	1980
-, pages =	"1195--1201"
-, update =	"98.11 bibrelex"
+, author =      "M. Styness"
+, title =       "On faster convergence of the bisection method for all triangles"
+, journal =     "Math. Comput."
+, volume =      35
+, year =        1980
+, pages =       "1195--1201"
+, update =      "98.11 bibrelex"
 }
 
 @article{s-ncdmc-99
-, author =	"C.-J. Su"
-, title =	"A New Collision Detection Method for CSG-represented Objects in Virtual Manufacturing"
-, journal =	"Comput. Ind."
-, volume =	40
-, number =	1
-, year =	1999
-, pages =	"1--13"
-, update =	"99.11 held"
+, author =      "C.-J. Su"
+, title =       "A New Collision Detection Method for CSG-represented Objects in Virtual Manufacturing"
+, journal =     "Comput. Ind."
+, volume =      40
+, number =      1
+, year =        1999
+, pages =       "1--13"
+, update =      "99.11 held"
 }
 
 @phdthesis{s-epacp-94
-, author =	"P. Su"
-, title =	"Efficient parallel algorithms for closest point problems"
-, school =	"Dartmouth College"
-, year =	1994
-, note =	"Number PCS-TR94-238"
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "P. Su"
+, title =       "Efficient parallel algorithms for closest point problems"
+, school =      "Dartmouth College"
+, year =        1994
+, note =        "Number PCS-TR94-238"
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @article{sd-csdta-97
-, author =	"P. Su and R. Drysdale"
-, title =	"A comparison of sequential {Delaunay} triangulation algorithms"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"361--386"
-, succeeds =	"sd-csdta-95"
-, update =	"97.07 devillers"
+, author =      "P. Su and R. Drysdale"
+, title =       "A comparison of sequential {Delaunay} triangulation algorithms"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "361--386"
+, succeeds =    "sd-csdta-95"
+, update =      "97.07 devillers"
 }
 
 @inproceedings{sd-csdta-95
-, author =	"Peter Su and Robert L. Scot Drysdale"
-, title =	"A Comparison of Sequential {Delaunay} Triangulation Algorithms"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"61--70"
-, keywords =	"experimental comparison"
-, cites =	"b-cgida-93, b-etsh-90, b-kdtsp-90, bwy-oetac-80, cs-arscg-89, d-fdcac-87, d-hdvdl-91, f-savd-87, gs-cdtp-78, gks-ricdv-92, gs-pmgsc-85, gs-pmgsc-85, kk-cdtmb-87, m-dtchn-84, m-eaa-86, oim-iimvd-84, s-iggp-76, sy-ricdd-90, too-natdv-83, w-smaa-78, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex, 95.09 mitchell"
+, author =      "Peter Su and Robert L. Scot Drysdale"
+, title =       "A Comparison of Sequential {Delaunay} Triangulation Algorithms"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "61--70"
+, keywords =    "experimental comparison"
+, cites =       "b-cgida-93, b-etsh-90, b-kdtsp-90, bwy-oetac-80, cs-arscg-89, d-fdcac-87, d-hdvdl-91, f-savd-87, gs-cdtp-78, gks-ricdv-92, gs-pmgsc-85, gs-pmgsc-85, kk-cdtmb-87, m-dtchn-84, m-eaa-86, oim-iimvd-84, s-iggp-76, sy-ricdd-90, too-natdv-83, w-smaa-78, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex, 95.09 mitchell"
 }
 
 @article{sc-ccrng-91
-, author =	"Tung-Hsin Su and Ruei-Chuan Chang"
-, title =	"Computing The Constrained Relative Neighborhood Graphs And Constrained Gabriel Graphs In {Euclidean} Plane"
-, journal =	"Pattern Recogn. Lett."
-, volume =	24
-, number =	3
-, year =	1991
-, pages =	"221--230"
-, keywords =	"constrained relative neighborhood graphs (crng), constrained gabriel graphs (cgg), euclidean plane, Delaunay triangulation"
-, update =	"93.09 rote"
-, annote =	"CRNG and CGG are subgraphs of CDT."
-, abstract =	"The original relative neighborhood graph (RNG) and
-		 Gabriel graph (GG) were defined on a vertices set in
-		 the plane. In this paper, we will extend this domain to
-		 a planar straight-line graph, and call this type of RNG
-		 and GG the constrained relative neighborhood graph
-		 (CRNG) and the constrained Gabriel graph (CGG)
-		 respectively. Given a planar straight-line graph G in
-		 the plane, the edges of the CRNG of G(CRNG(G)) satisfy
-		 the following two properties: (1) All of the edges in G
-		 (called prespecified edges) are included in the CRNG(G)
-		 and the remaining edges do not properly intersect with
-		 them; (2) If non-prespecified edge (p,q) belongs to the
-		 CRNG(G) then either there does not exist a vertex z
-		 such that d(p,z) less than d(p,q) and d(q,z) less than
-		 d(p,q), or if z satisfies the above condition then z
-		 must be invisible by p or q (i.e. if you draw the line
-		 segments from z to p and q, then at least one of the
-		 lines segments crosses a prespecified edge of G). The
-		 constrained Gabriel graph is defined similarly. The
-		 CRNG and CGG are the extensions of RNG and GG
-		 respectively for which one can specify in advance some
-		 special or important edges which must be included in
-		 the outcome graph. These variants of RNG and GG provide
-		 a new application for the original RNG and GG. In this
-		 paper, we will show that both CRNG and CGG are
-		 subgraphs of the constrained Delaunay triangulation,
-		 and propose two optimal algorithms to construct them in
-		 $\Theta (n \log n)$ time. (Author abstract) 14 Refs."
+, author =      "Tung-Hsin Su and Ruei-Chuan Chang"
+, title =       "Computing The Constrained Relative Neighborhood Graphs And Constrained Gabriel Graphs In {Euclidean} Plane"
+, journal =     "Pattern Recogn. Lett."
+, volume =      24
+, number =      3
+, year =        1991
+, pages =       "221--230"
+, keywords =    "constrained relative neighborhood graphs (crng), constrained gabriel graphs (cgg), euclidean plane, Delaunay triangulation"
+, update =      "93.09 rote"
+, annote =      "CRNG and CGG are subgraphs of CDT."
+, abstract =    "The original relative neighborhood graph (RNG) and
+                 Gabriel graph (GG) were defined on a vertices set in
+                 the plane. In this paper, we will extend this domain to
+                 a planar straight-line graph, and call this type of RNG
+                 and GG the constrained relative neighborhood graph
+                 (CRNG) and the constrained Gabriel graph (CGG)
+                 respectively. Given a planar straight-line graph G in
+                 the plane, the edges of the CRNG of G(CRNG(G)) satisfy
+                 the following two properties: (1) All of the edges in G
+                 (called prespecified edges) are included in the CRNG(G)
+                 and the remaining edges do not properly intersect with
+                 them; (2) If non-prespecified edge (p,q) belongs to the
+                 CRNG(G) then either there does not exist a vertex z
+                 such that d(p,z) less than d(p,q) and d(q,z) less than
+                 d(p,q), or if z satisfies the above condition then z
+                 must be invisible by p or q (i.e. if you draw the line
+                 segments from z to p and q, then at least one of the
+                 lines segments crosses a prespecified edge of G). The
+                 constrained Gabriel graph is defined similarly. The
+                 CRNG and CGG are the extensions of RNG and GG
+                 respectively for which one can specify in advance some
+                 special or important edges which must be included in
+                 the outcome graph. These variants of RNG and GG provide
+                 a new application for the original RNG and GG. In this
+                 paper, we will show that both CRNG and CGG are
+                 subgraphs of the constrained Delaunay triangulation,
+                 and propose two optimal algorithms to construct them in
+                 $\Theta (n \log n)$ time. (Author abstract) 14 Refs."
 }
 
 @article{sc-crnge-91
-, author =	"Tung-Hsin Su and Ruei-Chuan Chang"
-, title =	"On constructing the relative neighborhood graph in {Euclidean} $k$-dimensional spaces"
-, journal =	"Computing"
-, volume =	46
-, year =	1991
-, pages =	"121--130"
-, keywords =	"rng"
-, update =	"93.09 rote"
-, annote =	"in $O(n(n \log n)^{1-2^{-(k+1)}}$ time, under some general position assumptions"
+, author =      "Tung-Hsin Su and Ruei-Chuan Chang"
+, title =       "On constructing the relative neighborhood graph in {Euclidean} $k$-dimensional spaces"
+, journal =     "Computing"
+, volume =      46
+, year =        1991
+, pages =       "121--130"
+, keywords =    "rng"
+, update =      "93.09 rote"
+, annote =      "in $O(n(n \log n)^{1-2^{-(k+1)}}$ time, under some general position assumptions"
 }
 
 @inproceedings{sc-kggta-90
-, author =	"T. H. Su and R. C. Chang"
-, title =	"The $k$-{Gabriel} graphs and their applications"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"66--75"
+, author =      "T. H. Su and R. C. Chang"
+, title =       "The $k$-{Gabriel} graphs and their applications"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "66--75"
 }
 
 @inproceedings{sr-prtnd-95
-, author =	"Sairam Subramanian and Sridhar Ramaswamy"
-, title =	"The {$P$}-range Tree: {A} New Data Structure for Range Searching in Secondary Memory"
-, booktitle =	"Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1995
-, pages =	"378--387"
-, keywords =	"range searching, external memory algorithms"
-, update =	"96.09 agarwal, 96.05 mitchell"
+, author =      "Sairam Subramanian and Sridhar Ramaswamy"
+, title =       "The {$P$}-range Tree: {A} New Data Structure for Range Searching in Secondary Memory"
+, booktitle =   "Proc. 6th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1995
+, pages =       "378--387"
+, keywords =    "range searching, external memory algorithms"
+, update =      "96.09 agarwal, 96.05 mitchell"
 }
 
 @article{sd-csegs-91
-, author =	"R. V. Subramaniyam and A. A. Diwan"
-, title =	"A Counterexample for the Sufficiency of Edge Guards in Star Polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	40
-, year =	1991
-, pages =	"97--99"
-, update =	"98.11 bibrelex"
+, author =      "R. V. Subramaniyam and A. A. Diwan"
+, title =       "A Counterexample for the Sufficiency of Edge Guards in Star Polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      40
+, year =        1991
+, pages =       "97--99"
+, update =      "98.11 bibrelex"
 }
 
 @phdthesis{s-aasmp-91
-, author =	"R. Subramonian"
-, title =	"Asynchronous Algorithms for Shared Memory Parallel Computers"
-, type =	"Ph.{D}. Thesis"
-, school =	"Univ. California, Davis"
-, year =	1991
-, keywords =	"doctoral thesis"
-, update =	"96.09 orourke"
+, author =      "R. Subramonian"
+, title =       "Asynchronous Algorithms for Shared Memory Parallel Computers"
+, type =        "Ph.{D}. Thesis"
+, school =      "Univ. California, Davis"
+, year =        1991
+, keywords =    "doctoral thesis"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{s-dsaap-92
-, author =	"R. Subramonian"
-, title =	"Designing synchronous algorithms for asynchronous processors"
-, booktitle =	"Proc. 4th ACM Sympos. Parallel Algorithms Architect."
-, year =	1992
-, pages =	"189--198"
-, update =	"96.09 orourke"
+, author =      "R. Subramonian"
+, title =       "Designing synchronous algorithms for asynchronous processors"
+, booktitle =   "Proc. 4th ACM Sympos. Parallel Algorithms Architect."
+, year =        1992
+, pages =       "189--198"
+, update =      "96.09 orourke"
 }
 
 @article{sr-facsv-90
-, author =	"S. Sudarshan and C. P. Rangan"
-, title =	"A fast algorithm for computing sparse visibility graphs"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"201--214"
-, keywords =	"visibility graphs, segments, two-dimensional"
-, annote =	"$O(|E| \log^{2} n)$ time, $O(n)$ space"
+, author =      "S. Sudarshan and C. P. Rangan"
+, title =       "A fast algorithm for computing sparse visibility graphs"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "201--214"
+, keywords =    "visibility graphs, segments, two-dimensional"
+, annote =      "$O(|E| \log^{2} n)$ time, $O(n)$ space"
 }
 
 @article{s-rcaic-94
-, author =	"Kokichi Sugihara"
-, title =	"A robust and consistent algorithm for intersecting convex polyhedra"
-, journal =	"Comput. Graph. Forum"
-, volume =	13
-, number =	3
-, year =	1994
-, pages =	"45--54"
-, note =	"Proc. EUROGRAPHICS '94"
-, keywords =	"solid modeling, convexity, polyhedra, robustness, intersection"
-, update =	"95.09 korneenko"
+, author =      "Kokichi Sugihara"
+, title =       "A robust and consistent algorithm for intersecting convex polyhedra"
+, journal =     "Comput. Graph. Forum"
+, volume =      13
+, number =      3
+, year =        1994
+, pages =       "45--54"
+, note =        "Proc. EUROGRAPHICS '94"
+, keywords =    "solid modeling, convexity, polyhedra, robustness, intersection"
+, update =      "95.09 korneenko"
 }
 
 @article{s-smane-92
-, author =	"K. Sugihara"
-, title =	"A Simple Method for Avoiding Numerical Errors and Degeneracy in {Voronoi} Diagram Construction"
-, journal =	"IEICE Trans. Fundamentals"
-, volume =	"E75-A"
-, number =	4
-, month =	apr
-, year =	1992
-, pages =	"468--477"
-, update =	"93.09 held"
+, author =      "K. Sugihara"
+, title =       "A Simple Method for Avoiding Numerical Errors and Degeneracy in {Voronoi} Diagram Construction"
+, journal =     "IEICE Trans. Fundamentals"
+, volume =      "E75-A"
+, number =      4
+, month =       apr
+, year =        1992
+, pages =       "468--477"
+, update =      "93.09 held"
 }
 
 @incollection{s-acvd-92
-, author =	"K. Sugihara"
-, title =	"Algorithms for computing {Voronoi} diagrams"
-, editor =	"A. Okabe and B. Boots and K. Sugihara"
-, booktitle =	"Spatial Tessellations: Concepts and Applications of Voronoi Diagrams"
-, publisher =	"John Wiley \& Sons"
-, address =	"Chichester, UK"
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "K. Sugihara"
+, title =       "Algorithms for computing {Voronoi} diagrams"
+, editor =      "A. Okabe and B. Boots and K. Sugihara"
+, booktitle =   "Spatial Tessellations: Concepts and Applications of Voronoi Diagrams"
+, publisher =   "John Wiley \& Sons"
+, address =     "Chichester, UK"
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @article{s-acaal-84
-, author =	"K. Sugihara"
-, title =	"An algebraic and combinatorial approach to the analysis of line drawings of polyhedra"
-, journal =	"Discrete Appl. Math."
-, volume =	9
-, year =	1984
-, pages =	"77--104"
-, update =	"97.11 bibrelex"
+, author =      "K. Sugihara"
+, title =       "An algebraic and combinatorial approach to the analysis of line drawings of polyhedra"
+, journal =     "Discrete Appl. Math."
+, volume =      9
+, year =        1984
+, pages =       "77--104"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{s-aefsm-87t
-, author =	"K. Sugihara"
-, title =	"An approach to error-free solid modeling"
-, type =	"Note"
-, institution =	"Inst. Math. Appl., Univ. Minnesota"
-, address =	"Minneapolis, MN"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "K. Sugihara"
+, title =       "An approach to error-free solid modeling"
+, type =        "Note"
+, institution = "Inst. Math. Appl., Univ. Minnesota"
+, address =     "Minneapolis, MN"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @incollection{s-aefsm-87
-, author =	"K. Sugihara"
-, title =	"An approach to error-free solid modeling"
-, booktitle =	"IMA Summer Program on Robotics"
-, publisher =	"Institute for Mathematics and Applications, University of Minnesota"
-, address =	""
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "K. Sugihara"
+, title =       "An approach to error-free solid modeling"
+, booktitle =   "IMA Summer Program on Robotics"
+, publisher =   "Institute for Mathematics and Applications, University of Minnesota"
+, address =     ""
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{s-iabdt-92
-, author =	"Kokichi Sugihara"
-, title =	"An Intersection Algorithm Based On {Delaunay} Triangulation"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	12
-, number =	2
-, month =	mar
-, year =	1992
-, pages =	"59--67"
-, keywords =	"Delaunay triangulation, computational geometry"
-, abstract =	"A robust method for finding points of intersection of
-		 line segments in a 2- D plane is presented. The plane
-		 is subdivided by Delaunay triangulation to localize
-		 areas where points of intersection exist and to
-		 guarantee the topological consistency of the resulting
-		 arrangement. The subdivision is refined by inserting
-		 midpoints recursively until the areas containing points
-		 of intersection are sufficiently localized. The method
-		 is robust in the sense that it does not miss points of
-		 intersection that are easily detectable when costly
-		 line-pair checking is performed. The algorithm is
-		 adaptive in the sense that most of the computational
-		 cost is incurred for the areas where finding points of
-		 intersection is difficult. 6 Refs."
+, author =      "Kokichi Sugihara"
+, title =       "An Intersection Algorithm Based On {Delaunay} Triangulation"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      12
+, number =      2
+, month =       mar
+, year =        1992
+, pages =       "59--67"
+, keywords =    "Delaunay triangulation, computational geometry"
+, abstract =    "A robust method for finding points of intersection of
+                 line segments in a 2- D plane is presented. The plane
+                 is subdivided by Delaunay triangulation to localize
+                 areas where points of intersection exist and to
+                 guarantee the topological consistency of the resulting
+                 arrangement. The subdivision is refined by inserting
+                 midpoints recursively until the areas containing points
+                 of intersection are sufficiently localized. The method
+                 is robust in the sense that it does not miss points of
+                 intersection that are easily detectable when costly
+                 line-pair checking is performed. The algorithm is
+                 adaptive in the sense that most of the computational
+                 cost is incurred for the areas where finding points of
+                 intersection is difficult. 6 Refs."
 }
 
 @article{s-nadcp-84
-, author =	"K. Sugihara"
-, title =	"An $n \log n$ algorithm for determining the congruity of polyhedra"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	29
-, year =	1984
-, pages =	"36--47"
+, author =      "K. Sugihara"
+, title =       "An $n \log n$ algorithm for determining the congruity of polyhedra"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      29
+, year =        1984
+, pages =       "36--47"
 }
 
 @article{s-agvdo-93
-, author =	"K. Sugihara"
-, title =	"Approximation of generalized {Voronoi} Diagrams by ordinary {Voronoi} diagrams"
-, journal =	"CVGIP: Graph. Models Image Process."
-, volume =	55
-, year =	1993
-, pages =	"522--531"
-, update =	"94.05 smid"
+, author =      "K. Sugihara"
+, title =       "Approximation of generalized {Voronoi} Diagrams by ordinary {Voronoi} diagrams"
+, journal =     "CVGIP: Graph. Models Image Process."
+, volume =      55
+, year =        1993
+, pages =       "522--531"
+, update =      "94.05 smid"
 }
 
 @inproceedings{s-lrusv-88
-, author =	"K. Sugihara"
-, title =	"Location of a Robot Using Sparse Visual Information"
-, editor =	"R. Bolles and B. Roth"
-, booktitle =	"Robotics Research -- The Fourth Internat. Sympos."
-, year =	1988
-, pages =	"319--326"
-, update =	"93.09 held"
+, author =      "K. Sugihara"
+, title =       "Location of a Robot Using Sparse Visual Information"
+, editor =      "R. Bolles and B. Roth"
+, booktitle =   "Robotics Research -- The Fourth Internat. Sympos."
+, year =        1988
+, pages =       "319--326"
+, update =      "93.09 held"
 }
 
-%, editor =	"P. H. Winston and M. Brady"
+%, editor =     "P. H. Winston and M. Brady"
 @book{s-mild-86
-, author =	"K. Sugihara"
-, title =	"Machine Interpretation of Line Drawings"
-, series =	"MIT Press Series in Artificial Intelligence"
-, publisher =	"MIT Press"
-, year =	1986
-, isbn =	"0-262-19254-3"
-, update =	"93.09 held"
+, author =      "K. Sugihara"
+, title =       "Machine Interpretation of Line Drawings"
+, series =      "MIT Press Series in Artificial Intelligence"
+, publisher =   "MIT Press"
+, year =        1986
+, isbn =        "0-262-19254-3"
+, update =      "93.09 held"
 }
 
 @techreport{s-msldp-81
-, author =	"K. Sugihara"
-, title =	"Mathematical structures of line drawings of polyhedra - toward man-machine commonication by means of line drawings"
-, institution =	"Nagoya University"
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "K. Sugihara"
+, title =       "Mathematical structures of line drawings of polyhedra - toward man-machine commonication by means of line drawings"
+, institution = "Nagoya University"
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @techreport{s-fprgo-87
-, author =	"K. Sugihara"
-, title =	"On finite precision representations of geometric objects"
-, type =	"Res. {Memo}"
-, number =	"RMI 87-06"
-, institution =	"Dept. Math. Engrg., Univ. Tokyo"
-, address =	"Tokyo, Japan"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "K. Sugihara"
+, title =       "On finite precision representations of geometric objects"
+, type =        "Res. {Memo}"
+, number =      "RMI 87-06"
+, institution = "Dept. Math. Engrg., Univ. Tokyo"
+, address =     "Tokyo, Japan"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @article{s-fprgo-89
-, author =	"K. Sugihara"
-, title =	"On finite-precision representations of geometric objects"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	39
-, year =	1989
-, pages =	"236--247"
+, author =      "K. Sugihara"
+, title =       "On finite-precision representations of geometric objects"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      39
+, year =        1989
+, pages =       "236--247"
 }
 
 @incollection{s-rpld-88
-, author =	"K. Sugihara"
-, title =	"Realizability of polyhedrons from line drawings"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"177--206"
-, update =	"93.09 held"
-, annote =	"sehr ausfuehrlich mit vielen referenzen"
+, author =      "K. Sugihara"
+, title =       "Realizability of polyhedrons from line drawings"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "177--206"
+, update =      "93.09 held"
+, annote =      "sehr ausfuehrlich mit vielen referenzen"
 }
 
 @article{s-rgwtd-93
-, author =	"Kokichi Sugihara"
-, title =	"Robust gift-wrapping for the three-dimensional convex hull"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	"??"
-, year =	1993
-, note =	"to appear"
-, update =	"98.11 bibrelex"
+, author =      "Kokichi Sugihara"
+, title =       "Robust gift-wrapping for the three-dimensional convex hull"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      "??"
+, year =        1993
+, note =        "to appear"
+, update =      "98.11 bibrelex"
 }
 
 @article{s-slprn-88
-, author =	"K. Sugihara"
-, title =	"Some Location Problems for Robot Navigation Using a Single Camera"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	42
-, year =	1988
-, pages =	"112--129"
-, update =	"93.09 held"
+, author =      "K. Sugihara"
+, title =       "Some Location Problems for Robot Navigation Using a Single Camera"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      42
+, year =        1988
+, pages =       "112--129"
+, update =      "93.09 held"
 }
 
 @inproceedings{s-tcarc-92
-, author =	"K. Sugihara"
-, title =	"Topologically Consistent Algorithms Related to Convex Polyhedra"
-, booktitle =	"Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '92"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	650
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"209--218"
-, update =	"94.09 smid, 93.09 milone+mitchell"
+, author =      "K. Sugihara"
+, title =       "Topologically Consistent Algorithms Related to Convex Polyhedra"
+, booktitle =   "Proc. 3rd Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '92"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      650
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "209--218"
+, update =      "94.09 smid, 93.09 milone+mitchell"
 }
 
 @article{s-vdr-92
-, author =	"K. Sugihara"
-, title =	"Voronoi diagrams in a river"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	1
-, year =	1992
-, pages =	"29--48"
-, keywords =	"Generalized Voronoi diagram, boat-sail distance, smallest hitting circle, forest of cones, plane sweep algorithm"
+, author =      "K. Sugihara"
+, title =       "Voronoi diagrams in a river"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      1
+, year =        1992
+, pages =       "29--48"
+, keywords =    "Generalized Voronoi diagram, boat-sail distance, smallest hitting circle, forest of cones, plane sweep algorithm"
 }
 
 @inproceedings{sh-hdddg-97
-, author =	"Kokichi Sugihara and Tetsuya Hiroshima"
-, title =	"How to Draw a {Delaunay} Diagram with a Given Topology"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"13--15"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Kokichi Sugihara and Tetsuya Hiroshima"
+, title =       "How to Draw a {Delaunay} Diagram with a Given Topology"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "13--15"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{si-w3dtd-95
-, author =	"K. Sugihara and H. Inagaki"
-, title =	"Why is the 3{D} {Delaunay} triangulation difficult to construct?"
-, journal =	"Inform. Process. Lett."
-, volume =	54
-, year =	1995
-, pages =	"275--280"
-, update =	"95.09 smid"
+, author =      "K. Sugihara and H. Inagaki"
+, title =       "Why is the 3{D} {Delaunay} triangulation difficult to construct?"
+, journal =     "Inform. Process. Lett."
+, volume =      54
+, year =        1995
+, pages =       "275--280"
+, update =      "95.09 smid"
 }
 
 @inproceedings{si-nsmvd-88
-, author =	"K. Sugihara and M. Iri"
-, title =	"A numerically stable method for {Voronoi} diagram construction"
-, booktitle =	"Proc. of the 1988 Fall Conf. of the Operations Research Soc. of Japan"
-, site =	"Tokyo"
-, month =	sep
-, year =	1988
-, pages =	"20--21"
-, update =	"98.11 bibrelex"
+, author =      "K. Sugihara and M. Iri"
+, title =       "A numerically stable method for {Voronoi} diagram construction"
+, booktitle =   "Proc. of the 1988 Fall Conf. of the Operations Research Soc. of Japan"
+, site =        "Tokyo"
+, month =       sep
+, year =        1988
+, pages =       "20--21"
+, update =      "98.11 bibrelex"
 }
 
 @article{si-rtoia-94
-, author =	"K. Sugihara and M. Iri"
-, title =	"A robust Topology-Oriented Incremental algorithm for {Voronoi} diagrams"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	4
-, number =	2
-, year =	1994
-, pages =	"179--228"
-, keywords =	"Voronoi diagram, robust algorithm, topology oriented method, incremental construction, combinatorial abstraction, asymptotic correctness"
-, succeeds =	"si-toimc-89"
-, update =	"98.07 tamassia, 96.09 devillers"
+, author =      "K. Sugihara and M. Iri"
+, title =       "A robust Topology-Oriented Incremental algorithm for {Voronoi} diagrams"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      4
+, number =      2
+, year =        1994
+, pages =       "179--228"
+, keywords =    "Voronoi diagram, robust algorithm, topology oriented method, incremental construction, combinatorial abstraction, asymptotic correctness"
+, succeeds =    "si-toimc-89"
+, update =      "98.07 tamassia, 96.09 devillers"
 }
 
 @article{si-smsft-89
-, author =	"K. Sugihara and M. Iri"
-, title =	"A Solid Modelling System Free from Topological Inconsistency"
-, journal =	"J. Inform. Proc."
-, volume =	12
-, number =	4
-, year =	1989
-, pages =	"380--393"
-, update =	"93.09 held"
+, author =      "K. Sugihara and M. Iri"
+, title =       "A Solid Modelling System Free from Topological Inconsistency"
+, journal =     "J. Inform. Proc."
+, volume =      12
+, number =      4
+, year =        1989
+, pages =       "380--393"
+, update =      "93.09 held"
 }
 
 @techreport{si-cvdom-89
-, author =	"K. Sugihara and M. Iri"
-, title =	"Construction of the {Voronoi} Diagram for One Million Generators in Single-Precision Arithmetic"
-, number =	"RMI 89-05"
-, institution =	"Dept. Mathematical Eng., U. Tokyo"
-, address =	"Tokyo 113, Japan"
-, month =	aug
-, year =	1989
-, keywords =	"numerical precision, stability, robustness"
-, update =	"93.09 held"
+, author =      "K. Sugihara and M. Iri"
+, title =       "Construction of the {Voronoi} Diagram for One Million Generators in Single-Precision Arithmetic"
+, number =      "RMI 89-05"
+, institution = "Dept. Mathematical Eng., U. Tokyo"
+, address =     "Tokyo 113, Japan"
+, month =       aug
+, year =        1989
+, keywords =    "numerical precision, stability, robustness"
+, update =      "93.09 held"
 }
 
 @article{si-cvdom-92
-, author =	"K. Sugihara and M. Iri"
-, title =	"Construction of the {Voronoi} Diagram for `One Million' Generators in Single-Precision Arithmetic"
-, journal =	"Proc. IEEE"
-, volume =	80
-, number =	9
-, month =	sep
-, year =	1992
-, pages =	"1471--1484"
-, update =	"93.09 held"
+, author =      "K. Sugihara and M. Iri"
+, title =       "Construction of the {Voronoi} Diagram for `One Million' Generators in Single-Precision Arithmetic"
+, journal =     "Proc. IEEE"
+, volume =      80
+, number =      9
+, month =       sep
+, year =        1992
+, pages =       "1471--1484"
+, update =      "93.09 held"
 }
 
 @inproceedings{si-cvd10-89
-, author =	"K. Sugihara and M. Iri"
-, title =	"Construction of the {Voronoi} diagram for over $10^{5}$ generators in single-precision arithmetic"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1989
-, pages =	42
-, update =	"98.07 bibrelex"
+, author =      "K. Sugihara and M. Iri"
+, title =       "Construction of the {Voronoi} diagram for over $10^{5}$ generators in single-precision arithmetic"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1989
+, pages =       42
+, update =      "98.07 bibrelex"
 }
 
 @techreport{si-gafpa-88
-, author =	"K. Sugihara and M. Iri"
-, title =	"Geometric Algorithms in Finite-Precision Arithmetic"
-, type =	"Research Memorandum"
-, number =	"88-10"
-, institution =	"Math. Eng. and Physics Dept., U. of Tokyo, Japan"
-, month =	sep
-, year =	1988
-, note =	"Presented at 13th Int. Sympos. Math. Prog, Tokyo, Aug 29-Sep 2, 1988"
-, keywords =	"numerical precision, stability, robustness"
-, update =	"98.11 bibrelex, 93.09 held"
+, author =      "K. Sugihara and M. Iri"
+, title =       "Geometric Algorithms in Finite-Precision Arithmetic"
+, type =        "Research Memorandum"
+, number =      "88-10"
+, institution = "Math. Eng. and Physics Dept., U. of Tokyo, Japan"
+, month =       sep
+, year =        1988
+, note =        "Presented at 13th Int. Sympos. Math. Prog, Tokyo, Aug 29-Sep 2, 1988"
+, keywords =    "numerical precision, stability, robustness"
+, update =      "98.11 bibrelex, 93.09 held"
 }
 
 @techreport{si-toimc-89
-, author =	"K. Sugihara and M. Iri"
-, title =	"Topology-Oriented Incremental Method for Constructing {Voronoi} Diagrams Robust against Numerical Errors"
-, number =	"RMI 89-02"
-, institution =	"Dept. Mathematical Eng., U. Tokyo"
-, address =	"Tokyo 113, Japan"
-, year =	1989
-, keywords =	"numerical precision, stability, robustness"
-, precedes =	"si-rtoia-94"
-, update =	"96.09 devillers, 93.09 held"
+, author =      "K. Sugihara and M. Iri"
+, title =       "Topology-Oriented Incremental Method for Constructing {Voronoi} Diagrams Robust against Numerical Errors"
+, number =      "RMI 89-02"
+, institution = "Dept. Mathematical Eng., U. Tokyo"
+, address =     "Tokyo 113, Japan"
+, year =        1989
+, keywords =    "numerical precision, stability, robustness"
+, precedes =    "si-rtoia-94"
+, update =      "96.09 devillers, 93.09 held"
 }
 
 @article{si-tdpga-89
-, author =	"K. Sugihara and M. Iri"
-, title =	"Two Design Principles of Geometric Algorithms in Finite-Precision Arithmetic"
-, journal =	"Appl. Math. Lett."
-, volume =	2
-, number =	2
-, year =	1989
-, pages =	"203--206"
-, keywords =	"numerical precision, stability, robustness"
-, update =	"93.09 held"
+, author =      "K. Sugihara and M. Iri"
+, title =       "Two Design Principles of Geometric Algorithms in Finite-Precision Arithmetic"
+, journal =     "Appl. Math. Lett."
+, volume =      2
+, number =      2
+, year =        1989
+, pages =       "203--206"
+, keywords =    "numerical precision, stability, robustness"
+, update =      "93.09 held"
 }
 
 @techreport{si-vrm-89
-, author =	"K. Sugihara and M. Iri"
-, title =	"{Voronoi2} Reference Manual"
-, number =	"RMI 89-04"
-, institution =	"Dept. Mathematical Eng., U. Tokyo"
-, address =	"Tokyo 113, Japan"
-, month =	sep
-, year =	1989
-, update =	"93.09 held"
+, author =      "K. Sugihara and M. Iri"
+, title =       "{Voronoi2} Reference Manual"
+, number =      "RMI 89-04"
+, institution = "Dept. Mathematical Eng., U. Tokyo"
+, address =     "Tokyo 113, Japan"
+, month =       sep
+, year =        1989
+, update =      "93.09 held"
 }
 
 @article{siii-toiar-00
-, author =	"K. Sugihara and M. Iri and H. Inagaki and T. Imai"
-, title =	"Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms"
-, journal =	"Algorithmica"
-, volume =	27
-, number =	1
-, year =	2000
-, pages =	"5--20"
-, update =	"00.11 smid, 00.07 held"
+, author =      "K. Sugihara and M. Iri and H. Inagaki and T. Imai"
+, title =       "Topology-Oriented Implementation - An Approach to Robust Geometric Algorithms"
+, journal =     "Algorithmica"
+, volume =      27
+, number =      1
+, year =        2000
+, pages =       "5--20"
+, update =      "00.11 smid, 00.07 held"
 }
 
 @inproceedings{soi-toari-90
-, author =	"K. Sugihara and Y. Ooishi and T. Imai"
-, title =	"Topology-oriented approach to robustness and its applications to several {Voronoi}-diagram algorithms"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"36--39"
-, cites =	"si-cvd10-89, kk-cdtmb-88, o-nridc-90, i-nracv-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "K. Sugihara and Y. Ooishi and T. Imai"
+, title =       "Topology-oriented approach to robustness and its applications to several {Voronoi}-diagram algorithms"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "36--39"
+, cites =       "si-cvd10-89, kk-cdtmb-88, o-nridc-90, i-nracv-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{ssy-ssp-90
-, author =	"K. Sugihara and I. Suzuki and M. Yamashita"
-, title =	"The searchlight scheduling problem"
-, journal =	"SIAM J. Comput."
-, volume =	19
-, number =	6
-, year =	1990
-, pages =	"1024--1040"
-, update =	"98.07 bibrelex"
+, author =      "K. Sugihara and I. Suzuki and M. Yamashita"
+, title =       "The searchlight scheduling problem"
+, journal =     "SIAM J. Comput."
+, volume =      19
+, number =      6
+, year =        1990
+, pages =       "1024--1040"
+, update =      "98.07 bibrelex"
 }
 
 @article{s-cagd-87
-, author =	"K. Sugiyama"
-, title =	"A Cognitive Approach for Graph Drawing"
-, journal =	"Cybernetics and Systems: An International Journal"
-, volume =	18
-, year =	1987
-, pages =	"447--488"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "K. Sugiyama"
+, title =       "A Cognitive Approach for Graph Drawing"
+, journal =     "Cybernetics and Systems: An International Journal"
+, volume =      18
+, year =        1987
+, pages =       "447--488"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{s-rrddl-84
-, author =	"K. Sugiyama"
-, title =	"A Readability Requirement on Drawing Digraphs: Level Assignment and Edge Removal for Reducing the Total Length of Lines"
-, number =	45
-, institution =	"Internat. Inst. for Advanced Study of Social Information Science"
-, month =	mar
-, year =	1984
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "K. Sugiyama"
+, title =       "A Readability Requirement on Drawing Digraphs: Level Assignment and Edge Removal for Reducing the Total Length of Lines"
+, number =      45
+, institution = "Internat. Inst. for Advanced Study of Social Information Science"
+, month =       mar
+, year =        1984
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{s-aurdd-85
-, author =	"K. Sugiyama"
-, title =	"Achieving Uniqueness Requirement in Drawing Digraphs: Optimum Code Algorithm and Hierarchic Isomorphism"
-, number =	58
-, institution =	"Internat. Inst. for Advanced Study of Social Information Science"
-, month =	jul
-, year =	1985
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "K. Sugiyama"
+, title =       "Achieving Uniqueness Requirement in Drawing Digraphs: Optimum Code Algorithm and Hierarchic Isomorphism"
+, number =      58
+, institution = "Internat. Inst. for Advanced Study of Social Information Science"
+, month =       jul
+, year =        1985
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{sm-sumdg-95
-, author =	"K. Sugiyama and K. Misue"
-, title =	"A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"364--375"
-, keywords =	"graph drawing, force-directed, system"
-, update =	"95.01 tamassia"
+, author =      "K. Sugiyama and K. Misue"
+, title =       "A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "364--375"
+, keywords =    "graph drawing, force-directed, system"
+, update =      "95.01 tamassia"
 }
 
 @article{sm-gdmsm-95
-, author =	"K. Sugiyama and K. Misue"
-, title =	"Graph Drawing by the Magnetic Spring Model"
-, journal =	"J. Visual Lang. Comput."
-, volume =	6
-, number =	3
-, year =	1995
-, pages =	"217--231"
-, note =	"(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
-, keywords =	"graph drawing, 3D, system, software visualization"
-, succeeds =	"sm-sumdg-95"
-, update =	"98.07 vismara, 95.09 agarwal+devillers, 95.05 tamassia"
+, author =      "K. Sugiyama and K. Misue"
+, title =       "Graph Drawing by the Magnetic Spring Model"
+, journal =     "J. Visual Lang. Comput."
+, volume =      6
+, number =      3
+, year =        1995
+, pages =       "217--231"
+, note =        "(special issue on Graph Visualization, edited by I. F. Cruz and P. Eades)"
+, keywords =    "graph drawing, 3D, system, software visualization"
+, succeeds =    "sm-sumdg-95"
+, update =      "98.07 vismara, 95.09 agarwal+devillers, 95.05 tamassia"
 }
 
 % K. Sugiyama and K. Misue "Visualizing Structural Information:,
@@ -138038,4482 +138038,4482 @@ @article{sm-gdmsm-95
 % IEEE Transactions on Systems Man and Cybernetics,
 % Vol. 23, number = 2 1991
 @article{sm-vsiad-91
-, author =	"K. Sugiyama and K. Misue"
-, title =	"Visualization of Structural Information: Automatic Drawing of Compound Digraphs"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	21
-, number =	4
-, year =	1991
-, pages =	"876--892"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "K. Sugiyama and K. Misue"
+, title =       "Visualization of Structural Information: Automatic Drawing of Compound Digraphs"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      21
+, number =      4
+, year =        1991
+, pages =       "876--892"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{stt-mvuhs-81
-, author =	"K. Sugiyama and S. Tagawa and M. Toda"
-, title =	"Methods for Visual Understanding of Hierarchical Systems"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	"SMC-11"
-, number =	2
-, year =	1981
-, pages =	"109--125"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "K. Sugiyama and S. Tagawa and M. Toda"
+, title =       "Methods for Visual Understanding of Hierarchical Systems"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      "SMC-11"
+, number =      2
+, year =        1981
+, pages =       "109--125"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{st-siucs-85
-, author =	"K. Sugiyama and M. Toda"
-, title =	"Structuring Information for Understanding Complex Systems: {A} Basis for Decision Making"
-, journal =	"Fujitsu Scientific and Technical Journal"
-, volume =	21
-, number =	2
-, year =	1985
-, pages =	"144--164"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "K. Sugiyama and M. Toda"
+, title =       "Structuring Information for Understanding Complex Systems: {A} Basis for Decision Making"
+, journal =     "Fujitsu Scientific and Technical Journal"
+, volume =      21
+, number =      2
+, year =        1985
+, pages =       "144--164"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{ss-vdpar-88
-, author =	"S.-H. Suh and K. G. Shin"
-, title =	"A variational dynamic programming approach to robot-path planning with a distance-safety criterion"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	4
-, number =	3
-, year =	1988
-, pages =	"334--349"
-, update =	"93.09 milone+mitchell"
+, author =      "S.-H. Suh and K. G. Shin"
+, title =       "A variational dynamic programming approach to robot-path planning with a distance-safety criterion"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      4
+, number =      3
+, year =        1988
+, pages =       "334--349"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{sl-nmtpg-90
-, author =	"Y. S. Suh and K. Lee"
-, title =	"{NC} Milling Tool Path Generation for Arbitrary Pockets Defined by Sculptured Surfaces"
-, journal =	"Comput. Aided Design"
-, volume =	22
-, number =	5
-, month =	jun
-, year =	1990
-, pages =	"273--284"
-, update =	"93.09 held"
+, author =      "Y. S. Suh and K. Lee"
+, title =       "{NC} Milling Tool Path Generation for Arbitrary Pockets Defined by Sculptured Surfaces"
+, journal =     "Comput. Aided Design"
+, volume =      22
+, number =      5
+, month =       jun
+, year =        1990
+, pages =       "273--284"
+, update =      "93.09 held"
 }
 
 @incollection{sf-amgfe-72
-, author =	"J. Suhara and J. Fukuda"
-, title =	"Automatic Mesh Generation for Finite Element Analysis"
-, editor =	"J. T. Oden and R. W. Clough and Y. Yamamoto"
-, booktitle =	"Advances in Computational Methods in Structural Mechanics and Design"
-, publisher =	"UAU Press"
-, address =	"Huntsville, AL"
-, year =	1972
-, pages =	"607--624"
-, annote =	"Adds points to interior and then triangulates."
+, author =      "J. Suhara and J. Fukuda"
+, title =       "Automatic Mesh Generation for Finite Element Analysis"
+, editor =      "J. T. Oden and R. W. Clough and Y. Yamamoto"
+, booktitle =   "Advances in Computational Methods in Structural Mechanics and Design"
+, publisher =   "UAU Press"
+, address =     "Huntsville, AL"
+, year =        1972
+, pages =       "607--624"
+, annote =      "Adds points to interior and then triangulates."
 }
 
 @article{swm-ccr-95
-, author =	"G. F. Sullivan and D. S. Wilson and G. M. Masson"
-, title =	"Certification of Computational Results"
-, journal =	"IEEE Trans. Comput."
-, volume =	44
-, number =	7
-, year =	1995
-, pages =	"833--847"
-, update =	"97.03 tamassia"
+, author =      "G. F. Sullivan and D. S. Wilson and G. M. Masson"
+, title =       "Certification of Computational Results"
+, journal =     "IEEE Trans. Comput."
+, volume =      44
+, number =      7
+, year =        1995
+, pages =       "833--847"
+, update =      "97.03 tamassia"
 }
 
 @article{sl-cssbr-87
-, author =	"K. Sun and V. J. Lumelsky"
-, title =	"Computer Simulation of Sensor-Based Robot Collision Avoidance in an Unknown Environment"
-, journal =	"Robotica"
-, volume =	5
-, number =	4
-, year =	1987
-, pages =	"291--302"
+, author =      "K. Sun and V. J. Lumelsky"
+, title =       "Computer Simulation of Sensor-Based Robot Collision Avoidance in an Unknown Environment"
+, journal =     "Robotica"
+, volume =      5
+, number =      4
+, year =        1987
+, pages =       "291--302"
 }
 
 @article{s-dspca-85
-, author =	"K. J. Supowit"
-, title =	"Decomposing a set of points into chains, with applications to permutation and circle graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	21
-, year =	1985
-, pages =	"249--252"
-, keywords =	"decomposition"
+, author =      "K. J. Supowit"
+, title =       "Decomposing a set of points into chains, with applications to permutation and circle graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      21
+, year =        1985
+, pages =       "249--252"
+, keywords =    "decomposition"
 }
 
 @incollection{s-ghsgc-83
-, author =	"Kenneth J. Supowit"
-, title =	"Grid Heuristics for some Geometric Covering Problems"
-, editor =	"Franco P. Preparata"
-, booktitle =	"Computational Geometry"
-, series =	"Adv. Comput. Res."
-, volume =	1
-, publisher =	"JAI Press"
-, address =	"Greenwich, Conn."
-, year =	1983
-, pages =	"215--233"
-, keywords =	"balls, $d$-dimensional, covering, heuristics"
-, update =	"01.04 icking"
+, author =      "Kenneth J. Supowit"
+, title =       "Grid Heuristics for some Geometric Covering Problems"
+, editor =      "Franco P. Preparata"
+, booktitle =   "Computational Geometry"
+, series =      "Adv. Comput. Res."
+, volume =      1
+, publisher =   "JAI Press"
+, address =     "Greenwich, Conn."
+, year =        1983
+, pages =       "215--233"
+, keywords =    "balls, $d$-dimensional, covering, heuristics"
+, update =      "01.04 icking"
 }
 
 @inproceedings{s-ntsdc-90
-, author =	"K. J. Supowit"
-, title =	"New techniques for some dynamic closest-point and farthest-point problems"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"84--90"
+, author =      "K. J. Supowit"
+, title =       "New techniques for some dynamic closest-point and farthest-point problems"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "84--90"
 }
 
 @article{s-rngam-83
-, author =	"K. J. Supowit"
-, title =	"The relative neighborhood graph with an application to minimum spanning trees"
-, journal =	"J. ACM"
-, volume =	30
-, number =	3
-, year =	1983
-, pages =	"428--448"
-, keywords =	"plane-sweep, pattern recognition, Delaunay triangulations, minimum spanning trees, polygons, convex"
-, update =	"98.11 bibrelex"
+, author =      "K. J. Supowit"
+, title =       "The relative neighborhood graph with an application to minimum spanning trees"
+, journal =     "J. ACM"
+, volume =      30
+, number =      3
+, year =        1983
+, pages =       "428--448"
+, keywords =    "plane-sweep, pattern recognition, Delaunay triangulations, minimum spanning trees, polygons, convex"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{s-tcg-81
-, author =	"K. J. Supowit"
-, title =	"Topics in computational geometry"
-, type =	"Report"
-, number =	"UIUCDCS-R-81-1062"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1981
-, keywords =	"matchings, worst-case analysis, average-case analysis, plane-sweep"
+, author =      "K. J. Supowit"
+, title =       "Topics in computational geometry"
+, type =        "Report"
+, number =      "UIUCDCS-R-81-1062"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1981
+, keywords =    "matchings, worst-case analysis, average-case analysis, plane-sweep"
 }
 
 @article{sr-dchmw-83
-, author =	"K. J. Supowit and E. M. Reingold"
-, title =	"Divide-and-conquer heuristics for minimum weighted {Euclidean} matching"
-, journal =	"SIAM J. Comput."
-, volume =	12
-, year =	1983
-, pages =	"118--143"
-, keywords =	"matchings, worst-case analysis, divide-and-conquer"
+, author =      "K. J. Supowit and E. M. Reingold"
+, title =       "Divide-and-conquer heuristics for minimum weighted {Euclidean} matching"
+, journal =     "SIAM J. Comput."
+, volume =      12
+, year =        1983
+, pages =       "118--143"
+, keywords =    "matchings, worst-case analysis, divide-and-conquer"
 }
 
 @article{sr-cdtn-83
-, author =	"K. J. Supowit and E. M. Reingold"
-, title =	"The Complexity of Drawing Trees Nicely"
-, journal =	"Acta Inform."
-, volume =	18
-, year =	1983
-, pages =	"377--392"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "K. J. Supowit and E. M. Reingold"
+, title =       "The Complexity of Drawing Trees Nicely"
+, journal =     "Acta Inform."
+, volume =      18
+, year =        1983
+, pages =       "377--392"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{srp-tspmm-83
-, author =	"K. J. Supowit and E. M. Reingold and D. A. Plaisted"
-, title =	"The traveling salesman problem and minimum matching in the unit square"
-, journal =	"SIAM J. Comput."
-, volume =	12
-, year =	1983
-, pages =	"144--156"
-, keywords =	"traveling salesman tours, matchings, worst-case analysis"
+, author =      "K. J. Supowit and E. M. Reingold and D. A. Plaisted"
+, title =       "The traveling salesman problem and minimum matching in the unit square"
+, journal =     "SIAM J. Comput."
+, volume =      12
+, year =        1983
+, pages =       "144--156"
+, keywords =    "traveling salesman tours, matchings, worst-case analysis"
 }
 
 @inproceedings{ssbt-sbpsd-00
-, author =	"Tatiana Surazhsky and Vitaly Surazhsky and Gill Barequet and Ayellet Tal"
-, title =	"Smooth Blending of Polygonal Slices with Different Topologies"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"40--44"
-, update =	"00.03 bibrelex"
+, author =      "Tatiana Surazhsky and Vitaly Surazhsky and Gill Barequet and Ayellet Tal"
+, title =       "Smooth Blending of Polygonal Slices with Different Topologies"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "40--44"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{sg-mptpu-00
-, author =	"Vitaly Surazhsky and Craig Gotsman"
-, title =	"Morphing Planar Triangulations and Polygons Using Convex Representations"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"31--34"
-, update =	"00.03 bibrelex"
+, author =      "Vitaly Surazhsky and Craig Gotsman"
+, title =       "Morphing Planar Triangulations and Polygons Using Convex Representations"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "31--34"
+, update =      "00.03 bibrelex"
 }
 
 @article{sv-ncdma-94
-, author =	"K. Suresh and H. B. Voelcker"
-, title =	"New challenges in dimensional metrology: {A} case study based on ``size''"
-, journal =	"Manufacturing Review"
-, volume =	7
-, number =	4
-, year =	1994
-, pages =	"292--303"
-, update =	"98.03 agarwal"
+, author =      "K. Suresh and H. B. Voelcker"
+, title =       "New challenges in dimensional metrology: {A} case study based on ``size''"
+, journal =     "Manufacturing Review"
+, volume =      7
+, number =      4
+, year =        1994
+, pages =       "292--303"
+, update =      "98.03 agarwal"
 }
 
 @article{s-ltaml-86
-, author =	"Subhash Suri"
-, title =	"A linear time algorithm for minimum link paths inside a simple polygon"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	35
-, year =	1986
-, pages =	"99--110"
-, update =	"98.03 mitchell"
+, author =      "Subhash Suri"
+, title =       "A linear time algorithm for minimum link paths inside a simple polygon"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      35
+, year =        1986
+, pages =       "99--110"
+, update =      "98.03 mitchell"
 }
 
 @techreport{s-pptld-86
-, author =	"S. Suri"
-, title =	"A polygon partitioning technique for link distance problems"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	nov
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "S. Suri"
+, title =       "A polygon partitioning technique for link distance problems"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       nov
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @techreport{s-cagfn-86
-, author =	"S. Suri"
-, title =	"Computing all geodesic furthest neighbors of a simple polygon"
-, type =	"Manuscript"
-, institution =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, month =	nov
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "S. Suri"
+, title =       "Computing all geodesic furthest neighbors of a simple polygon"
+, type =        "Manuscript"
+, institution = "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, month =       nov
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{s-cgfns-89
-, author =	"Subhash Suri"
-, title =	"Computing geodesic furthest neighbors in simple polygons"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	39
-, year =	1989
-, pages =	"220--235"
-, succeeds =	"s-agfnp-87"
-, update =	"98.03 mitchell"
+, author =      "Subhash Suri"
+, title =       "Computing geodesic furthest neighbors in simple polygons"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      39
+, year =        1989
+, pages =       "220--235"
+, succeeds =    "s-agfnp-87"
+, update =      "98.03 mitchell"
 }
 
 @techreport{s-cesl-85
-, author =	"Subhash Suri"
-, title =	"Computing the envelope of a set of lines"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1985
-, update =	"98.03 mitchell"
+, author =      "Subhash Suri"
+, title =       "Computing the envelope of a set of lines"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1985
+, update =      "98.03 mitchell"
 }
 
 @techreport{s-cgdsp-86
-, author =	"Subhash Suri"
-, title =	"Computing the geodesic diameter of a simple polygon"
-, type =	"Report"
-, number =	"JHU-EECS-86/08"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1986
-, update =	"98.03 mitchell"
+, author =      "Subhash Suri"
+, title =       "Computing the geodesic diameter of a simple polygon"
+, type =        "Report"
+, number =      "JHU-EECS-86/08"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1986
+, update =      "98.03 mitchell"
 }
 
 @techreport{s-cldsp-86
-, author =	"Subhash Suri"
-, title =	"Computing the link diameter of a simple polygon"
-, type =	"Report"
-, number =	"JHU-EECS-86/09"
-, institution =	"Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1986
-, update =	"98.03 mitchell, 93.05 smid"
+, author =      "Subhash Suri"
+, title =       "Computing the link diameter of a simple polygon"
+, type =        "Report"
+, number =      "JHU-EECS-86/09"
+, institution = "Dept. Elect. Engrg. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1986
+, update =      "98.03 mitchell, 93.05 smid"
 }
 
 @phdthesis{s-mlppr-87
-, author =	"Subhash Suri"
-, title =	"Minimum link paths in polygons and related problems"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1987
-, keywords =	"doctoral thesis"
-, update =	"98.03 mitchell"
+, author =      "Subhash Suri"
+, title =       "Minimum link paths in polygons and related problems"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1987
+, keywords =    "doctoral thesis"
+, update =      "98.03 mitchell"
 }
 
 @article{s-ldpsp-88
-, author =	"S. Suri"
-, title =	"On some link distance problems in a simple polygon"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	6
-, number =	1
-, year =	1988
-, pages =	"108--113"
-, precedes =	"s-sldps-90"
-, update =	"98.07 bibrelex"
+, author =      "S. Suri"
+, title =       "On some link distance problems in a simple polygon"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      6
+, number =      1
+, year =        1988
+, pages =       "108--113"
+, precedes =    "s-sldps-90"
+, update =      "98.07 bibrelex"
 }
 
 @article{s-sldps-90
-, author =	"Subhash Suri"
-, title =	"On Some Link Distance Problems in a Simple Polygon"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	6
-, year =	1990
-, pages =	"108--113"
-, succeeds =	"s-ldpsp-88"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Subhash Suri"
+, title =       "On Some Link Distance Problems in a Simple Polygon"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      6
+, year =        1990
+, pages =       "108--113"
+, succeeds =    "s-ldpsp-88"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @incollection{s-p-97
-, author =	"Subhash Suri"
-, title =	"Polygons"
-, chapter =	23
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"429--444"
-, update =	"98.03 mitchell, 97.11 orourke"
+, author =      "Subhash Suri"
+, title =       "Polygons"
+, chapter =     23
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "429--444"
+, update =      "98.03 mitchell, 97.11 orourke"
 }
 
 @inproceedings{s-agfnp-87
-, author =	"Subhash Suri"
-, title =	"The all-geodesic-furthest neighbors problem for simple polygons"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"64--75"
-, precedes =	"s-cgfns-89"
-, cites =	"akmsw-gamsa-86, art-lbcpr-87, at-cgcsp-86, atb-mdcp-82, c-tpca-82, cg-vippg-85, gh-ospqs-87, ghlst-ltavs-86, gjpt-tsp-78, hm-ftsp-83, lm-gmqia-84, lp-annpc-78, lp-esppr-84, p-msc-77, ps-cgcsp-86, rs-mtdmi-85, sh-cpp-75, t-safnp-83, t-cgpp-86, tb-gatuf-81, tv-otats-86, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Subhash Suri"
+, title =       "The all-geodesic-furthest neighbors problem for simple polygons"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "64--75"
+, precedes =    "s-cgfns-89"
+, cites =       "akmsw-gamsa-86, art-lbcpr-87, at-cgcsp-86, atb-mdcp-82, c-tpca-82, cg-vippg-85, gh-ospqs-87, ghlst-ltavs-86, gjpt-tsp-78, hm-ftsp-83, lm-gmqia-84, lp-annpc-78, lp-esppr-84, p-msc-77, ps-cgcsp-86, rs-mtdmi-85, sh-cpp-75, t-safnp-83, t-cgpp-86, tb-gatuf-81, tv-otats-86, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @inproceedings{shh-cdasb-98
-, author =	"Subhash Suri and Philip M. Hubbard and John F. Hughes"
-, title =	"Collision Detection in Aspect and Scale Bounded Polyhedra"
-, booktitle =	"Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '98"
-, year =	1998
-, pages =	"127--136"
-, update =	"99.07 bibrelex, 98.07 mitchell"
+, author =      "Subhash Suri and Philip M. Hubbard and John F. Hughes"
+, title =       "Collision Detection in Aspect and Scale Bounded Polyhedra"
+, booktitle =   "Proc. 9th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '98"
+, year =        1998
+, pages =       "127--136"
+, update =      "99.07 bibrelex, 98.07 mitchell"
 }
 
 @techreport{so-fmnp-85t
-, author =	"Subhash Suri and J. O'Rourke"
-, title =	"Finding Minimal Nested Polygons"
-, type =	"Technical {Report}"
-, institution =	"Johns Hopkins Univ."
-, address =	"Baltimore, MD"
-, year =	1985
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Subhash Suri and J. O'Rourke"
+, title =       "Finding Minimal Nested Polygons"
+, type =        "Technical {Report}"
+, institution = "Johns Hopkins Univ."
+, address =     "Baltimore, MD"
+, year =        1985
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{so-fmnp-85
-, author =	"Subhash Suri and J. O'Rourke"
-, title =	"Finding minimal nested polygons"
-, booktitle =	"Proc. 23rd Allerton Conf. Commun. Control Comput."
-, year =	1985
-, pages =	"470--479"
-, keywords =	"packing, visibility"
-, update =	"98.03 mitchell"
+, author =      "Subhash Suri and J. O'Rourke"
+, title =       "Finding minimal nested polygons"
+, booktitle =   "Proc. 23rd Allerton Conf. Commun. Control Comput."
+, year =        1985
+, pages =       "470--479"
+, keywords =    "packing, visibility"
+, update =      "98.03 mitchell"
 }
 
 @techreport{so-wcoac-85
-, author =	"Subhash Suri and J. O'Rourke"
-, title =	"Worst-case optimal algorithms for constructing visibility polygons with holes"
-, institution =	"Johns Hopkins Univ."
-, year =	1985
-, precedes =	"so-wcoac-86"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Subhash Suri and J. O'Rourke"
+, title =       "Worst-case optimal algorithms for constructing visibility polygons with holes"
+, institution = "Johns Hopkins Univ."
+, year =        1985
+, precedes =    "so-wcoac-86"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{so-wcoac-86
-, author =	"Subhash Suri and J. O'Rourke"
-, title =	"Worst-case optimal algorithms for constructing visibility polygons with holes"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"14--23"
-, keywords =	"visibility"
-, succeeds =	"so-wcoac-85"
-, cites =	"aaghi-vpses-85, c-iies-84, cg-vippg-85, e-eacwv-84, ea-lacvp-81, ghlst-ltavs-86, aaghi-vdp-86, ll-cvpe-86, m-wcohs-87, w-cvgnl-85, so-wcoac-85, g-ttn-66, ZZZ"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Subhash Suri and J. O'Rourke"
+, title =       "Worst-case optimal algorithms for constructing visibility polygons with holes"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "14--23"
+, keywords =    "visibility"
+, succeeds =    "so-wcoac-85"
+, cites =       "aaghi-vpses-85, c-iies-84, cg-vippg-85, e-eacwv-84, ea-lacvp-81, ghlst-ltavs-86, aaghi-vdp-86, ll-cvpe-86, m-wcohs-87, w-cvgnl-85, so-wcoac-85, g-ttn-66, ZZZ"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @inproceedings{s-s3dpp-95
-, author =	"H. J. Sussman"
-, title =	"Shortest 3-Dimensional Paths with a Prescribed Curvature Bound"
-, booktitle =	"Proc. 34th IEEE Conf. Decision Control"
-, year =	1995
-, pages =	"3306--3311"
-, keywords =	"curvature-constrained shortest paths"
-, update =	"98.03 mitchell"
+, author =      "H. J. Sussman"
+, title =       "Shortest 3-Dimensional Paths with a Prescribed Curvature Bound"
+, booktitle =   "Proc. 34th IEEE Conf. Decision Control"
+, year =        1995
+, pages =       "3306--3311"
+, keywords =    "curvature-constrained shortest paths"
+, update =      "98.03 mitchell"
 }
 
 @techreport{st-sprsc-91
-, author =	"H. J. Sussmann and G. Tang"
-, title =	"Shortest paths for the {Reeds-Shepp} car: {A} worked out example of the use of geometric techniques in nonlinear optimal control"
-, type =	"Research {Report}"
-, number =	"SYCON-91-10"
-, institution =	"Rutgers University"
-, address =	"New Brunswick, NJ"
-, year =	1991
-, update =	"98.03 mitchell, 93.09 erickson"
+, author =      "H. J. Sussmann and G. Tang"
+, title =       "Shortest paths for the {Reeds-Shepp} car: {A} worked out example of the use of geometric techniques in nonlinear optimal control"
+, type =        "Research {Report}"
+, number =      "SYCON-91-10"
+, institution = "Rutgers University"
+, address =     "New Brunswick, NJ"
+, year =        1991
+, update =      "98.03 mitchell, 93.09 erickson"
 }
 
 @phdthesis{s-smmgc-63
-, author =	"I. E. Sutherland"
-, title =	"Sketchpad: {A} man-machine graphical communication system"
-, school =	"Massachusetts Inst. Tech."
-, address =	"Cambridge, MA"
-, month =	jan
-, year =	1963
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "I. E. Sutherland"
+, title =       "Sketchpad: {A} man-machine graphical communication system"
+, school =      "Massachusetts Inst. Tech."
+, address =     "Cambridge, MA"
+, month =       jan
+, year =        1963
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{sh-rpc-74
-, author =	"I. E. Sutherland and G. W. Hodgman"
-, title =	"Reentrant polygon clipping"
-, journal =	"Commun. ACM"
-, volume =	17
-, year =	1974
-, pages =	"32--42"
+, author =      "I. E. Sutherland and G. W. Hodgman"
+, title =       "Reentrant polygon clipping"
+, journal =     "Commun. ACM"
+, volume =      17
+, year =        1974
+, pages =       "32--42"
 }
 
 @article{sss-cthsa-74
-, author =	"I. E. Sutherland and R. F. Sproull and R. A. Schumacker"
-, title =	"A Characterization of Ten Hidden-Surface Algorithms"
-, journal =	"ACM Comput. Surv."
-, volume =	6
-, number =	1
-, month =	mar
-, year =	1974
-, pages =	"1--55"
-, update =	"96.01 tamassia, 93.09 held"
+, author =      "I. E. Sutherland and R. F. Sproull and R. A. Schumacker"
+, title =       "A Characterization of Ten Hidden-Surface Algorithms"
+, journal =     "ACM Comput. Surv."
+, volume =      6
+, number =      1
+, month =       mar
+, year =        1974
+, pages =       "1--55"
+, update =      "96.01 tamassia, 93.09 held"
 }
 
 @inproceedings{s-iafvd-89
-, author =	"A. Suzuki"
-, title =	"An incremental algorithm for the farthest {Voronoi} diagram"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	43
+, author =      "A. Suzuki"
+, title =       "An incremental algorithm for the farthest {Voronoi} diagram"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       43
 }
 
 @article{si-atpvd-86
-, author =	"A. Suzuki and M. Iri"
-, title =	"Approximation of a tessellation of the plane by a {Voronoi} diagram"
-, journal =	"J. Oper. Res. Soc. Japan"
-, volume =	29
-, year =	1986
-, pages =	"69--96"
-, update =	"94.09 bernal"
+, author =      "A. Suzuki and M. Iri"
+, title =       "Approximation of a tessellation of the plane by a {Voronoi} diagram"
+, journal =     "J. Oper. Res. Soc. Japan"
+, volume =      29
+, year =        1986
+, pages =       "69--96"
+, update =      "94.09 bernal"
 }
 
 @inproceedings{san-fsfpg-90
-, author =	"H. Suzuki and T. Akama and T. Nishizeki"
-, title =	"Finding {Steiner} forests in planar graphs"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"444--453"
+, author =      "H. Suzuki and T. Akama and T. Nishizeki"
+, title =       "Finding {Steiner} forests in planar graphs"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "444--453"
 }
 
 @article{sy-dmlra-96
-, author =	"I. Suzuki and M. Yamashita"
-, title =	"Designing multi-link robot arms in a convex polygon"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	6
-, year =	1996
-, pages =	"461--486"
-, update =	"97.03 devillers"
+, author =      "I. Suzuki and M. Yamashita"
+, title =       "Designing multi-link robot arms in a convex polygon"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      6
+, year =        1996
+, pages =       "461--486"
+, update =      "97.03 devillers"
 }
 
 @article{sy-smipr-92
-, author =	"I. Suzuki and M. Yamashita"
-, title =	"Searching for a mobile intruder in a polygonal region"
-, journal =	"SIAM J. Comput."
-, volume =	21
-, year =	1992
-, pages =	"863--888"
+, author =      "I. Suzuki and M. Yamashita"
+, title =       "Searching for a mobile intruder in a polygonal region"
+, journal =     "SIAM J. Comput."
+, volume =      21
+, year =        1992
+, pages =       "863--888"
 }
 
 @article{so-mpclr-95
-, author =	"Petr {\v S}vestka and Mark H. Overmars"
-, title =	"Motion Planning for Car-Like Robots Using a Probabilistic Learning Approach"
-, journal =	"Internat. J. Robot. Res."
-, volume =	16
-, number =	2
-, month =	apr
-, year =	1997
-, pages =	"119--143"
-, update =	"98.03 mitchell"
+, author =      "Petr {\v S}vestka and Mark H. Overmars"
+, title =       "Motion Planning for Car-Like Robots Using a Probabilistic Learning Approach"
+, journal =     "Internat. J. Robot. Res."
+, volume =      16
+, number =      2
+, month =       apr
+, year =        1997
+, pages =       "119--143"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{sv-emptt-95
-, author =	"Petr {\v S}vestka and Jules Vleugels"
-, title =	"Exact Motion Planning for Tractor-Trailer Robots"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1995
-, pages =	"2445--2450"
-, update =	"00.03 bibrelex, 97.11 oostrum"
+, author =      "Petr {\v S}vestka and Jules Vleugels"
+, title =       "Exact Motion Planning for Tractor-Trailer Robots"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1995
+, pages =       "2445--2450"
+, update =      "00.03 bibrelex, 97.11 oostrum"
 }
 
 @inproceedings{s-oardc-93
-, author =	"Kurt Swanson"
-, title =	"An Optimal Algorithm for Roundness Determination on Convex Polygons"
-, booktitle =	"Proc. 3rd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	709
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"601--609"
-, update =	"96.05 agarwal, 93.09 smid, 93.05 jones"
+, author =      "Kurt Swanson"
+, title =       "An Optimal Algorithm for Roundness Determination on Convex Polygons"
+, booktitle =   "Proc. 3rd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      709
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "601--609"
+, update =      "96.05 agarwal, 93.09 smid, 93.05 jones"
 }
 
 @article{slw-oardc-95
-, author =	"K. Swanson and D. T. Lee and Vanban L. Wu"
-, title =	"An optimal algorithm for roundness determination on convex polygons"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	5
-, year =	1995
-, pages =	"225--235"
-, update =	"96.09 devillers+orourke"
+, author =      "K. Swanson and D. T. Lee and Vanban L. Wu"
+, title =       "An optimal algorithm for roundness determination on convex polygons"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      5
+, year =        1995
+, pages =       "225--235"
+, update =      "96.09 devillers+orourke"
 }
 
 @techreport{s-otafb-80
-, author =	"G. F. Swart"
-, title =	"An {$O(\log n)$} time algorithm for finding bridge points of convex arcs"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Washington"
-, address =	"Seattle, WA"
-, year =	1980
+, author =      "G. F. Swart"
+, title =       "An {$O(\log n)$} time algorithm for finding bridge points of convex arcs"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Washington"
+, address =     "Seattle, WA"
+, year =        1980
 }
 
 @article{s-fchff-85
-, author =	"G. F. Swart"
-, title =	"Finding the convex hull facet by facet"
-, journal =	"J. Algorithms"
-, volume =	6
-, year =	1985
-, pages =	"17--48"
+, author =      "G. F. Swart"
+, title =       "Finding the convex hull facet by facet"
+, journal =     "J. Algorithms"
+, volume =      6
+, year =        1985
+, pages =       "17--48"
 }
 
 @article{sp-cppca-92
-, author =	"P. E. Sweeney and E. R. Paternoster"
-, title =	"Cutting and packing problems: {A} categorized, application-orientated research bibliography"
-, journal =	"J. Oper. Res. Society"
-, volume =	43
-, number =	7
-, year =	1992
-, pages =	"691--706"
-, update =	"98.03 bibrelex"
+, author =      "P. E. Sweeney and E. R. Paternoster"
+, title =       "Cutting and packing problems: {A} categorized, application-orientated research bibliography"
+, journal =     "J. Oper. Res. Society"
+, volume =      43
+, number =      7
+, year =        1992
+, pages =       "691--706"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{s-eepe-78
-, author =	"R. E. Sweet"
-, title =	"Empirical Estimates of Program Entropy"
-, number =	"STAN-CS-78-698"
-, institution =	"Department of Computer Science, Stanford University"
-, year =	1978
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. E. Sweet"
+, title =       "Empirical Estimates of Program Entropy"
+, number =      "STAN-CS-78-698"
+, institution = "Department of Computer Science, Stanford University"
+, year =        1978
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{s-nlpcc-74
-, author =	"H. P. F. Swinnerton-Dyer"
-, title =	"The number of lattice points on a convex curve"
-, journal =	"J. Number Theory"
-, volume =	6
-, year =	1974
-, pages =	"128--135"
-, update =	"97.11 bibrelex"
+, author =      "H. P. F. Swinnerton-Dyer"
+, title =       "The number of lattice points on a convex curve"
+, journal =     "J. Number Theory"
+, volume =      6
+, year =        1974
+, pages =       "128--135"
+, update =      "97.11 bibrelex"
 }
 
 @article{ssu-congo-88
-, author =	"J. B. Sydney and S. J. Sydney and J. Urrutia"
-, title =	"Circle orders, $n$-gon orders and the crossing number for partial orders"
-, journal =	"Order"
-, volume =	5
-, year =	1988
-, pages =	"1--10"
-, update =	"98.03 bibrelex"
+, author =      "J. B. Sydney and S. J. Sydney and J. Urrutia"
+, title =       "Circle orders, $n$-gon orders and the crossing number for partial orders"
+, journal =     "Order"
+, volume =      5
+, year =        1988
+, pages =       "1--10"
+, update =      "98.03 bibrelex"
 }
 
 @article{s-qgs-57
-, author =	"J. J. Sylvester"
-, title =	"A question on the geometry of situation"
-, journal =	"Quart. J. Math."
-, volume =	1
-, year =	1857
-, pages =	79
+, author =      "J. J. Sylvester"
+, title =       "A question on the geometry of situation"
+, journal =     "Quart. J. Math."
+, volume =      1
+, year =        1857
+, pages =       79
 }
 
 @article{s-mq1-93
-, author =	"J. J. Sylvester"
-, title =	"Mathematical question 11851"
-, journal =	"Educational Times"
-, volume =	59
-, year =	1893
-, pages =	98
-, update =	"98.03 devillers"
+, author =      "J. J. Sylvester"
+, title =       "Mathematical question 11851"
+, journal =     "Educational Times"
+, volume =      59
+, year =        1893
+, pages =       98
+, update =      "98.03 devillers"
 }
 
 @article{s-pavsf-60
-, author =	"J. J. Sylvester"
-, title =	"On {Poncelet}'s approximate valuation of surd forms"
-, journal =	"Philos. Magazine"
-, volume =	"XX"
-, year =	1860
-, pages =	"203--222"
+, author =      "J. J. Sylvester"
+, title =       "On {Poncelet}'s approximate valuation of surd forms"
+, journal =     "Philos. Magazine"
+, volume =      "XX"
+, year =        1860
+, pages =       "203--222"
 }
 
 @article{s-rlttc-87
-, author =	"S. Szab{\'o}"
-, title =	"A reduction of lattice tiling by translates of a cubical cluster"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"33--36"
+, author =      "S. Szab{\'o}"
+, title =       "A reduction of lattice tiling by translates of a cubical cluster"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "33--36"
 }
 
 @article{s-cnhep-97
-, author =	"L. A. Sz{\'e}kely"
-, title =	"Crossing numbers and hard {E}rd{\H o}s problems in discrete geometry"
-, journal =	"Combinatorics, Probability and Computing"
-, volume =	6
-, year =	1997
-, pages =	"353--358"
-, update =	"01.04 smid, 98.03 agarwal+devillers, 97.11 aronov"
+, author =      "L. A. Sz{\'e}kely"
+, title =       "Crossing numbers and hard {E}rd{\H o}s problems in discrete geometry"
+, journal =     "Combinatorics, Probability and Computing"
+, volume =      6
+, year =        1997
+, pages =       "353--358"
+, update =      "01.04 smid, 98.03 agarwal+devillers, 97.11 aronov"
 }
 
 @article{st-smops-92
-, author =	"R. Szeliski and D. Tonnesen"
-, title =	"Surface modeling with oriented particle systems"
-, journal =	"Comput. Graph."
-, volume =	26
-, number =	2
-, month =	jul
-, year =	1992
-, pages =	"185--194"
-, update =	"98.07 bibrelex"
+, author =      "R. Szeliski and D. Tonnesen"
+, title =       "Surface modeling with oriented particle systems"
+, journal =     "Comput. Graph."
+, volume =      26
+, number =      2
+, month =       jul
+, year =        1992
+, pages =       "185--194"
+, update =      "98.07 bibrelex"
 }
 
 @article{s-pds-74
-, author =	"E. Szemer\'{e}di"
-, title =	"On a problem of {Davenport and Schinzel}"
-, journal =	"Acta Arithmetica"
-, volume =	25
-, year =	1974
-, pages =	"213--224"
-, update =	"95.09 agarwal"
+, author =      "E. Szemer\'{e}di"
+, title =       "On a problem of {Davenport and Schinzel}"
+, journal =     "Acta Arithmetica"
+, volume =      25
+, year =        1974
+, pages =       "213--224"
+, update =      "95.09 agarwal"
 }
 
 @article{st-cdbep-83
-, author =	"E. Szemer{\'e}di and W. {Trotter, Jr.}"
-, title =	"A combinatorial distinction between {E}uclidean and projective planes"
-, journal =	"European J. Combin."
-, volume =	4
-, year =	1983
-, pages =	"385--394"
-, update =	"98.03 agarwal"
+, author =      "E. Szemer{\'e}di and W. {Trotter, Jr.}"
+, title =       "A combinatorial distinction between {E}uclidean and projective planes"
+, journal =     "European J. Combin."
+, volume =      4
+, year =        1983
+, pages =       "385--394"
+, update =      "98.03 agarwal"
 }
 
 @article{st-epdg-83
-, author =	"E. Szemer{\'e}di and W. {Trotter, Jr.}"
-, title =	"Extremal problems in discrete geometry"
-, journal =	"Combinatorica"
-, volume =	3
-, year =	1983
-, pages =	"381--392"
-, update =	"97.11 bibrelex"
+, author =      "E. Szemer{\'e}di and W. {Trotter, Jr.}"
+, title =       "Extremal problems in discrete geometry"
+, journal =     "Combinatorica"
+, volume =      3
+, year =        1983
+, pages =       "381--392"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{s-dladg-94
-, author =	"L{\'a}szl{\'o} Szirmay-Kalos"
-, title =	"Dynamic Layout Algorithm to Display General Graphs"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"505--517"
-, keywords =	"cartography, layout, graph visualization, physically-based methods"
-, update =	"94.09 heckbert"
-, annote =	"Gives code that finds aesthetic arrangements for a graph.
+, author =      "L{\'a}szl{\'o} Szirmay-Kalos"
+, title =       "Dynamic Layout Algorithm to Display General Graphs"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "505--517"
+, keywords =    "cartography, layout, graph visualization, physically-based methods"
+, update =      "94.09 heckbert"
+, annote =      "Gives code that finds aesthetic arrangements for a graph.
 This could be used to graphically display data structures. Contains C++
 code."
 }
 
 @inproceedings{s-hctoc-86
-, author =	"H. Szu"
-, title =	"Holographic coordinate transformations and optical computing"
-, booktitle =	"Optical and Hybrid Computing, Proc. SPIE"
-, volume =	634
-, year =	1986
-, pages =	"480--484"
-, update =	"98.11 bibrelex"
+, author =      "H. Szu"
+, title =       "Holographic coordinate transformations and optical computing"
+, booktitle =   "Optical and Hybrid Computing, Proc. SPIE"
+, volume =      634
+, year =        1986
+, pages =       "480--484"
+, update =      "98.11 bibrelex"
 }
 
 @article{skr-ebecs-01
-, author =	"A. Szymczak and D. King and J. Rossignac"
-, title =	"An {Edgebreaker-based} efficient compression scheme for regular meshes"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	20
-, year =	2001
-, pages =	"53--68"
-, update =	"01.11 smid"
+, author =      "A. Szymczak and D. King and J. Rossignac"
+, title =       "An {Edgebreaker-based} efficient compression scheme for regular meshes"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      20
+, year =        2001
+, pages =       "53--68"
+, update =      "01.11 smid"
 }
 
 @book{t-b-95
-, author =	"Serge Tabachnikov"
-, title =	"Billiards"
-, series =	"Panoramas et Synth\'eses"
-, publisher =	"Soci\'et\'e Math\'ematique de France"
-, year =	1995
-, update =	"01.04 orourke"
+, author =      "Serge Tabachnikov"
+, title =       "Billiards"
+, series =      "Panoramas et Synth\'eses"
+, publisher =   "Soci\'et\'e Math\'ematique de France"
+, year =        1995
+, update =      "01.04 orourke"
 }
 
 @unpublished{t-ntasa-94
-, author =	"B. Tagansky"
-, title =	"A new technique for analyzing substructures in arrangements"
-, year =	1994
-, note =	"Unpublished manuscript, Tel-Aviv University"
-, update =	"95.01 orourke"
+, author =      "B. Tagansky"
+, title =       "A new technique for analyzing substructures in arrangements"
+, year =        1994
+, note =        "Unpublished manuscript, Tel-Aviv University"
+, update =      "95.01 orourke"
 }
 
 @inproceedings{t-ntasa-95
-, author =	"Boaz Tagansky"
-, title =	"A New Technique for Analyzing Substructures in Arrangements"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"200--210"
-, keywords =	"cell complexity, zones, levels in arrangements, vertical decomposition"
-, cites =	"aa-cfi-92, ass-oletd-94, aps-zsha-93, as-tsbac-90, as-car-94, ast-ucptd-97, as-tmp3s-94, bsty-vdhdc-95, ckstw-vdl3s-95, c-narsc-87, cs-arscg-89, bds-lric-94, bgh-vdt3s-94, e-acg-87, e-ueplf-89, ess-ztha-93, ghms-vdahf-95, gs-caa-93, hs-nblet-94, hs-atarr-95, hs-ndssg-86, m-cgitr-93, ps-ueplf-89, s-atubl-94, sa-dsstg-95, ws-prnds-88, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Boaz Tagansky"
+, title =       "A New Technique for Analyzing Substructures in Arrangements"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "200--210"
+, keywords =    "cell complexity, zones, levels in arrangements, vertical decomposition"
+, cites =       "aa-cfi-92, ass-oletd-94, aps-zsha-93, as-tsbac-90, as-car-94, ast-ucptd-97, as-tmp3s-94, bsty-vdhdc-95, ckstw-vdl3s-95, c-narsc-87, cs-arscg-89, bds-lric-94, bgh-vdt3s-94, e-acg-87, e-ueplf-89, ess-ztha-93, ghms-vdahf-95, gs-caa-93, hs-nblet-94, hs-atarr-95, hs-ndssg-86, m-cgitr-93, ps-ueplf-89, s-atubl-94, sa-dsstg-95, ws-prnds-88, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{t-ntasa-96
-, author =	"Boaz Tagansky"
-, title =	"A New Technique for Analyzing Substructures in Arrangements of Piecewise Linear Surfaces"
-, journal =	"Discrete Comput. Geom."
-, volume =	16
-, year =	1996
-, pages =	"455--479"
-, succeeds =	"t-ntasa-95"
-, update =	"98.03 smid, 97.11 aronov"
-, annote =	"Special Issue: ACM Symposium on Computational Geometry, Vancouver"
+, author =      "Boaz Tagansky"
+, title =       "A New Technique for Analyzing Substructures in Arrangements of Piecewise Linear Surfaces"
+, journal =     "Discrete Comput. Geom."
+, volume =      16
+, year =        1996
+, pages =       "455--479"
+, succeeds =    "t-ntasa-95"
+, update =      "98.03 smid, 97.11 aronov"
+, annote =      "Special Issue: ACM Symposium on Computational Geometry, Vancouver"
 }
 
 @phdthesis{t-csas-96
-, author =	"B. Tagansky"
-, title =	"The Complexity of Substructures in Arrangements of Surfaces"
-, type =	"Ph.{D}. Thesis"
-, school =	"Tel Aviv University"
-, address =	"Tel Aviv"
-, year =	1996
-, keywords =	"doctoral thesis"
-, update =	"98.03 agarwal"
+, author =      "B. Tagansky"
+, title =       "The Complexity of Substructures in Arrangements of Surfaces"
+, type =        "Ph.{D}. Thesis"
+, school =      "Tel Aviv University"
+, address =     "Tel Aviv"
+, year =        1996
+, keywords =    "doctoral thesis"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{tsn-fsncr-93
-, author =	"Jun-ya Takahashi and Hitoshi Suzuki and Takao Nishizeki"
-, title =	"Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"98--107"
-, precedes =	"tsn-sncrp-97"
-, update =	"98.11 devillers, 98.07 bibrelex, 94.05 smid, 93.09 milone+mitchell"
+, author =      "Jun-ya Takahashi and Hitoshi Suzuki and Takao Nishizeki"
+, title =       "Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "98--107"
+, precedes =    "tsn-sncrp-97"
+, update =      "98.11 devillers, 98.07 bibrelex, 94.05 smid, 93.09 milone+mitchell"
 }
 
 @article{tsn-sncrp-97
-, author =	"J.-Y. Takahashi and H. Suzuki and T. Nishizeki"
-, title =	"Shortest Non-Crossing Rectilinear Paths in Plane Regions"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"419--436"
-, succeeds =	"tsn-fsncr-93"
-, update =	"98.11 devillers"
+, author =      "J.-Y. Takahashi and H. Suzuki and T. Nishizeki"
+, title =       "Shortest Non-Crossing Rectilinear Paths in Plane Regions"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "419--436"
+, succeeds =    "tsn-fsncr-93"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{tisku-aeccp-95
-, author =	"S. Takahashi and T. Ikeda and Y. Shinagawa and T. L. Kunii and M. Ueda"
-, title =	"Algorithms for extracting correct critical points and constructing topological graphs from discrete geographical elevation data"
-, booktitle =	"Eurographics'95"
-, volume =	14
-, year =	1995
-, pages =	"C--181--C--192"
-, update =	"97.11 oostrum"
+, author =      "S. Takahashi and T. Ikeda and Y. Shinagawa and T. L. Kunii and M. Ueda"
+, title =       "Algorithms for extracting correct critical points and constructing topological graphs from discrete geographical elevation data"
+, booktitle =   "Eurographics'95"
+, volume =      14
+, year =        1995
+, pages =       "C--181--C--192"
+, update =      "97.11 oostrum"
 }
 
 @inproceedings{ti-etpts-97
-, author =	"Fumihiko Takeuchi and Hiroshi Imai"
-, title =	"Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points"
-, booktitle =	"Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
-, nickname =	"COCOON '97"
-, site =	"Shanghai, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1276
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"470--481"
-, update =	"99.11 bibrelex, 98.03 mitchell"
+, author =      "Fumihiko Takeuchi and Hiroshi Imai"
+, title =       "Enumerating Triangulations for Products of Two Simplices and for Arbitrary Configurations of Points"
+, booktitle =   "Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
+, nickname =    "COCOON '97"
+, site =        "Shanghai, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1276
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "470--481"
+, update =      "99.11 bibrelex, 98.03 mitchell"
 }
 
 @article{to-lseec-89a
-, author =	"R. Takiyama and N. Ono"
-, title =	"A least square error estimation of the center and radii of concentric arcs"
-, journal =	"Pattern Recogn. Lett."
-, volume =	10
-, year =	1989
-, pages =	"237--242"
-, update =	"98.11 bibrelex"
+, author =      "R. Takiyama and N. Ono"
+, title =       "A least square error estimation of the center and radii of concentric arcs"
+, journal =     "Pattern Recogn. Lett."
+, volume =      10
+, year =        1989
+, pages =       "237--242"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{tcd-njlsm-92
-, author =	"A. Tal and B. Chazelle and D. Dobkin"
-, title =	"The New-Jersey line-segment saw massacre"
-, booktitle =	"Proc. 8th Annu. ACM Sympos. Comput. Geom."
-, year =	1992
-, keywords =	"video review"
-, update =	"98.11 bibrelex"
+, author =      "A. Tal and B. Chazelle and D. Dobkin"
+, title =       "The New-Jersey line-segment saw massacre"
+, booktitle =   "Proc. 8th Annu. ACM Sympos. Comput. Geom."
+, year =        1992
+, keywords =    "video review"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{td-gsvga-94
-, author =	"A. Tal and D. Dobkin"
-, title =	"GASP: {A} system for visualizing geometric algorithms"
-, booktitle =	"Visualization '94"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "A. Tal and D. Dobkin"
+, title =       "GASP: {A} system for visualizing geometric algorithms"
+, booktitle =   "Visualization '94"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{td-gsfag-94
-, author =	"A. Tal and D. Dobkin"
-, title =	"GASP: A System to Facilitate Animating Geometric Algorithms"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"388--389"
-, keywords =	"video review"
-, cites =	"b-aops-94, ce-oails-92, dg-crd-94, dk-ladsc-85, dk-dsppu-90, dt-buph-93, r-mdbp-91, s-mdbp-93, s-votcb-93, ss-otcbt-93, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones"
+, author =      "A. Tal and D. Dobkin"
+, title =       "GASP: A System to Facilitate Animating Geometric Algorithms"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "388--389"
+, keywords =    "video review"
+, cites =       "b-aops-94, ce-oails-92, dg-crd-94, dk-ladsc-85, dk-dsppu-90, dt-buph-93, r-mdbp-91, s-mdbp-93, s-votcb-93, ss-otcbt-93, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones"
 }
 
 @article{td-vga-95
-, author =	"A. Tal and D. P. Dobkin"
-, title =	"Visualization of Geometric Algorithms"
-, journal =	"IEEE Trans. Visualization and Computer Graphics"
-, volume =	1
-, number =	2
-, year =	1995
-, pages =	"194--204"
-, keywords =	"algorithm animation, visualization, three-dimensional geometric algorithms"
-, update =	"98.07 bibrelex, 96.09 devillers, 96.01 tamassia"
-, abstract =	"This paper investigates the visualization of geometric
-		 algorithms. We discuss how limiting the domain makes it
-		 possible to create a system that enables others to use
-		 it easily. Knowledge about the domain can be very
-		 helpful in building a system which automates large
-		 parts of the user's task. A system can be designed to
-		 isolate the user from any concern about how graphics is
-		 done. The application need only specify ``what''
-		 happens and need not be concerned with ``how'' to make
-		 it happen on the screen. We develop a conceptual model
-		 and a framework for experimenting with it. We also
-		 present a system, GASP, which implements this model.
-		 GASP allows quick generation of three-dimensional
-		 geometric algorithm visualizations, even for highly
-		 complex algorithms. It also provides a visual debugging
-		 facility for geometric computing. We show the utility
-		 of GASP by presenting a variety of examples."
+, author =      "A. Tal and D. P. Dobkin"
+, title =       "Visualization of Geometric Algorithms"
+, journal =     "IEEE Trans. Visualization and Computer Graphics"
+, volume =      1
+, number =      2
+, year =        1995
+, pages =       "194--204"
+, keywords =    "algorithm animation, visualization, three-dimensional geometric algorithms"
+, update =      "98.07 bibrelex, 96.09 devillers, 96.01 tamassia"
+, abstract =    "This paper investigates the visualization of geometric
+                 algorithms. We discuss how limiting the domain makes it
+                 possible to create a system that enables others to use
+                 it easily. Knowledge about the domain can be very
+                 helpful in building a system which automates large
+                 parts of the user's task. A system can be designed to
+                 isolate the user from any concern about how graphics is
+                 done. The application need only specify ``what''
+                 happens and need not be concerned with ``how'' to make
+                 it happen on the screen. We develop a conceptual model
+                 and a framework for experimenting with it. We also
+                 present a system, GASP, which implements this model.
+                 GASP allows quick generation of three-dimensional
+                 geometric algorithm visualizations, even for highly
+                 complex algorithms. It also provides a visual debugging
+                 facility for geometric computing. We show the utility
+                 of GASP by presenting a variety of examples."
 }
 
 @article{ta-2dfem-91
-, author =	"T. K. H. Tam and C. G. Armstrong"
-, title =	"2{D} Finite Element Mesh Generation By Medial Axis Subdivision"
-, journal =	"Advances in Engineering Software and Workstations"
-, volume =	13
-, number =	"5--6"
-, month =	sep
-, year =	1991
-, pages =	"313--324"
-, keywords =	"two-dimensional finite element mesh generation, medial axis subdivisions, quadrilateral elements, Delaunay triangulation, Voronoi diagrams, transfinite mapping techniques"
-, annote =	"Vd of shape is approximated by using extra points on
-		 the boundary. Vd is used to decompose shape into simple
-		 regions for meshing."
-, abstract =	"An algorithm for the automatic generation of
-		 two-dimensional finite element meshes using
-		 quadrilateral elements has been demonstrated. The
-		 technique uses information derived from the medial axis
-		 of a 2D region, the locus of the centre of an inscribed
-		 disc of maximal diameter as it rolls around the region
-		 interior. Using this information, an arbitrarily
-		 complex object can be subdivided into a series of
-		 meshable subregions. Within these subregions relatively
-		 conventional meshing patterns are then generated. The
-		 resulting meshes are well structured and flow smoothly
-		 round the object boundary with minimum mesh
-		 irregularity. (Author abstract) 31 Refs."
+, author =      "T. K. H. Tam and C. G. Armstrong"
+, title =       "2{D} Finite Element Mesh Generation By Medial Axis Subdivision"
+, journal =     "Advances in Engineering Software and Workstations"
+, volume =      13
+, number =      "5--6"
+, month =       sep
+, year =        1991
+, pages =       "313--324"
+, keywords =    "two-dimensional finite element mesh generation, medial axis subdivisions, quadrilateral elements, Delaunay triangulation, Voronoi diagrams, transfinite mapping techniques"
+, annote =      "Vd of shape is approximated by using extra points on
+                 the boundary. Vd is used to decompose shape into simple
+                 regions for meshing."
+, abstract =    "An algorithm for the automatic generation of
+                 two-dimensional finite element meshes using
+                 quadrilateral elements has been demonstrated. The
+                 technique uses information derived from the medial axis
+                 of a 2D region, the locus of the centre of an inscribed
+                 disc of maximal diameter as it rolls around the region
+                 interior. Using this information, an arbitrarily
+                 complex object can be subdivided into a series of
+                 meshable subregions. Within these subregions relatively
+                 conventional meshing patterns are then generated. The
+                 resulting meshes are well structured and flow smoothly
+                 round the object boundary with minimum mesh
+                 irregularity. (Author abstract) 31 Refs."
 }
 
 @article{ta-femci-93
-, author =	"T. K. H. Tam and C. G. Armstrong"
-, title =	"Finite element mesh control by integer programming"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	36
-, year =	1993
-, pages =	"2581--2605"
-, update =	"98.07 bibrelex"
+, author =      "T. K. H. Tam and C. G. Armstrong"
+, title =       "Finite element mesh control by integer programming"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      36
+, year =        1993
+, pages =       "2581--2605"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{tt-cpgpl-97
-, author =	"Hisao Tamaki and Takeshi Tokuyama"
-, title =	"A Characterization of Planar Graphs by Pseudo-Line Arrangements"
-, booktitle =	"Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '97"
-, site =	"Singapore"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1350
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"123--132"
-, update =	"98.07 agarwal, 98.03 agarwal+mitchell"
+, author =      "Hisao Tamaki and Takeshi Tokuyama"
+, title =       "A Characterization of Planar Graphs by Pseudo-Line Arrangements"
+, booktitle =   "Proc. 8th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '97"
+, site =        "Singapore"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1350
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "123--132"
+, update =      "98.07 agarwal, 98.03 agarwal+mitchell"
 }
 
 @inproceedings{tt-hcpps-95
-, author =	"Hisao Tamaki and Takeshi Tokuyama"
-, title =	"How to Cut Pseudo-Parabolas into Segments"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"230--237"
-, keywords =	"levels"
-, cites =	"a-sdcgp-85, b-gtic-79, cs-arscg-89, e-acg-87, ew-mnemf-86, e-glbpm-95, g-bpstp-79, gs-caa-93, ki-tnprc-83, ks-empac-90, kti-mmstl-92, l-roifc-75, m-gofvc-94, m-lblmp-91, s-ksacs-91, w-mt-76, w-mksfs-86, ZZZ"
-, update =	"98.03 bibrelex, 95.09 agarwal+mitchell"
+, author =      "Hisao Tamaki and Takeshi Tokuyama"
+, title =       "How to Cut Pseudo-Parabolas into Segments"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "230--237"
+, keywords =    "levels"
+, cites =       "a-sdcgp-85, b-gtic-79, cs-arscg-89, e-acg-87, ew-mnemf-86, e-glbpm-95, g-bpstp-79, gs-caa-93, ki-tnprc-83, ks-empac-90, kti-mmstl-92, l-roifc-75, m-gofvc-94, m-lblmp-91, s-ksacs-91, w-mt-76, w-mksfs-86, ZZZ"
+, update =      "98.03 bibrelex, 95.09 agarwal+mitchell"
 }
 
 @article{tt-hcpps-98
-, author =	"Hisao Tamaki and Takeshi Tokuyama"
-, title =	"How to Cut Pseudo-Parabolas into Segments"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"265--290"
-, update =	"98.03 agarwal"
+, author =      "Hisao Tamaki and Takeshi Tokuyama"
+, title =       "How to Cut Pseudo-Parabolas into Segments"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "265--290"
+, update =      "98.03 agarwal"
 }
 
 @techreport{t-ddspg-87
-, author =	"R. Tamassia"
-, title =	"A dynamic data structure for planar graph embedding"
-, type =	"Report"
-, number =	"UILU-ENG-87-2265"
-, institution =	"Coordinated Sci. Lab., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1987
+, author =      "R. Tamassia"
+, title =       "A dynamic data structure for planar graph embedding"
+, type =        "Report"
+, number =      "UILU-ENG-87-2265"
+, institution = "Coordinated Sci. Lab., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1987
 }
 
 @inproceedings{t-ddspg-88
-, author =	"R. Tamassia"
-, title =	"A Dynamic Data Structure for Planar Graph Embedding"
-, editor =	"T. Lepisto and A. Salomaa"
-, booktitle =	"Automata, Languages and Programming (Proc. 15th ICALP)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	317
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"576--590"
-, update =	"94.01 tamassia"
+, author =      "R. Tamassia"
+, title =       "A Dynamic Data Structure for Planar Graph Embedding"
+, editor =      "T. Lepisto and A. Salomaa"
+, booktitle =   "Automata, Languages and Programming (Proc. 15th ICALP)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      317
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "576--590"
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{t-uadpl-92
-, author =	"Roberto Tamassia"
-, title =	"A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	39
-, update =	"00.03 bibrelex"
+, author =      "Roberto Tamassia"
+, title =       "A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       39
+, update =      "00.03 bibrelex"
 }
 
 @article{t-atpgd-
-, author =	"R. Tamassia"
-, title =	"Advances in the Theory and Practice of Graph Drawing"
-, journal =	"Theoret. Comput. Sci."
-, note =	"to appear"
-, keywords =	"graph drawing, survey"
-, update =	"98.11 tamassia"
+, author =      "R. Tamassia"
+, title =       "Advances in the Theory and Practice of Graph Drawing"
+, journal =     "Theoret. Comput. Sci."
+, note =        "to appear"
+, keywords =    "graph drawing, survey"
+, update =      "98.11 tamassia"
 }
 
 @article{t-irmdp-91
-, author =	"R. Tamassia"
-, title =	"An incremental reconstruction method for dynamic planar point location"
-, journal =	"Inform. Process. Lett."
-, volume =	37
-, year =	1991
-, pages =	"79--83"
-, keywords =	"point location, triangulation, computational geometry, planar point location"
-, abstract =	"We present a fully dynamic technique for point
-		 location in triangulations that allows a tradeoff
-		 between query and update time, and can be used in
-		 conjunction with any of the known static point location
-		 data structures. Let $S$ be a triangulation whose
-		 current number of vertices is $n$. We show that for any
-		 smooth nondecreasing integer function $b(n)$ with $2\le
-		 b(n) \le \sqrt n$, there exists a dynamic point
-		 location data structure for $S$ with space $O(n)$,
-		 query time $O((\log^2n)/\log b(n))$, and update time
-		 $O((\log^2n)b(n)/\log b(n))$. (Author abstract) 15
-		 Refs."
+, author =      "R. Tamassia"
+, title =       "An incremental reconstruction method for dynamic planar point location"
+, journal =     "Inform. Process. Lett."
+, volume =      37
+, year =        1991
+, pages =       "79--83"
+, keywords =    "point location, triangulation, computational geometry, planar point location"
+, abstract =    "We present a fully dynamic technique for point
+                 location in triangulations that allows a tradeoff
+                 between query and update time, and can be used in
+                 conjunction with any of the known static point location
+                 data structures. Let $S$ be a triangulation whose
+                 current number of vertices is $n$. We show that for any
+                 smooth nondecreasing integer function $b(n)$ with $2\le
+                 b(n) \le \sqrt n$, there exists a dynamic point
+                 location data structure for $S$ with space $O(n)$,
+                 query time $O((\log^2n)/\log b(n))$, and update time
+                 $O((\log^2n)b(n)/\log b(n))$. (Author abstract) 15
+                 Refs."
 }
 
 @inproceedings{t-cgd-95
-, author =	"R. Tamassia"
-, title =	"Constraints in Graph Drawing"
-, booktitle =	"Proc. Int. Workshop on Constraints for Graphics and Visualization"
-, nickname =	"CGV '95"
-, year =	1995
-, pages =	85
-, keywords =	"graph drawing, constraints"
-, update =	"96.09 tamassia"
+, author =      "R. Tamassia"
+, title =       "Constraints in Graph Drawing"
+, booktitle =   "Proc. Int. Workshop on Constraints for Graphics and Visualization"
+, nickname =    "CGV '95"
+, year =        1995
+, pages =       85
+, keywords =    "graph drawing, constraints"
+, update =      "96.09 tamassia"
 }
 
 @article{t-cgd-98
-, author =	"R. Tamassia"
-, title =	"Constraints in Graph Drawing Algorithms"
-, journal =	"Constraints"
-, volume =	3
-, number =	1
-, year =	1998
-, pages =	"89--122"
-, keywords =	"graph drawing, constraints, survey"
-, update =	"98.11 tamassia"
+, author =      "R. Tamassia"
+, title =       "Constraints in Graph Drawing Algorithms"
+, journal =     "Constraints"
+, volume =      3
+, number =      1
+, year =        1998
+, pages =       "89--122"
+, keywords =    "graph drawing, constraints, survey"
+, update =      "98.11 tamassia"
 }
 
 @article{t-ds-96
-, author =	"R. Tamassia"
-, title =	"Data Structures"
-, journal =	"ACM Comput. Surv."
-, volume =	28
-, number =	1
-, year =	1996
-, pages =	"23--26"
-, url =	"https://www.cs.brown.edu/cgc/papers/t-ds-96.ps.gz"
-, keywords =	"data structures, survey"
-, update =	"97.03 tamassia"
+, author =      "R. Tamassia"
+, title =       "Data Structures"
+, journal =     "ACM Comput. Surv."
+, volume =      28
+, number =      1
+, year =        1996
+, pages =       "23--26"
+, url = "https://www.cs.brown.edu/cgc/papers/t-ds-96.ps.gz"
+, keywords =    "data structures, survey"
+, update =      "97.03 tamassia"
 }
 
 @techreport{t-dapsg
-, author =	"R. Tamassia"
-, title =	"Drawing Algorithms for Planar st-Graphs"
-, type =	"Technical Report"
-, institution =	"Brown Univ."
-, precedes =	"t-dapsg-90"
-, update =	"98.11 bibrelex"
+, author =      "R. Tamassia"
+, title =       "Drawing Algorithms for Planar st-Graphs"
+, type =        "Technical Report"
+, institution = "Brown Univ."
+, precedes =    "t-dapsg-90"
+, update =      "98.11 bibrelex"
 }
 
 @article{t-dapsg-90
-, author =	"R. Tamassia"
-, title =	"Drawing Algorithms for Planar st-Graphs"
-, journal =	"Australasian Journal of Combinatorics"
-, volume =	2
-, year =	1990
-, pages =	"217--235"
-, keywords =	"graph drawing"
-, succeeds =	"t-dapsg"
-, update =	"98.11 bibrelex, 93.09 tamassia"
+, author =      "R. Tamassia"
+, title =       "Drawing Algorithms for Planar st-Graphs"
+, journal =     "Australasian Journal of Combinatorics"
+, volume =      2
+, year =        1990
+, pages =       "217--235"
+, keywords =    "graph drawing"
+, succeeds =    "t-dapsg"
+, update =      "98.11 bibrelex, 93.09 tamassia"
 }
 
 @misc{t-gd-
-, author =	"Roberto Tamassia"
-, title =	"Graph Drawing"
-, url =	"http://graphdrawing.org/index.html"
-, update =	"98.07 tamassia"
+, author =      "Roberto Tamassia"
+, title =       "Graph Drawing"
+, url = "http://graphdrawing.org/index.html"
+, update =      "98.07 tamassia"
 }
 
 @incollection{t-gd-97
-, author =	"R. Tamassia"
-, title =	"Graph Drawing"
-, chapter =	44
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"815--832"
-, url =	"https://www.cs.brown.edu/cgc/papers/t-gd-97.ps.gz"
-, keywords =	"graph drawing, survey"
-, update =	"97.11 orourke, 97.07 orourke, 97.03 tamassia"
+, author =      "R. Tamassia"
+, title =       "Graph Drawing"
+, chapter =     44
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "815--832"
+, url = "https://www.cs.brown.edu/cgc/papers/t-gd-97.ps.gz"
+, keywords =    "graph drawing, survey"
+, update =      "97.11 orourke, 97.07 orourke, 97.03 tamassia"
 }
 
 @incollection{t-gd-00
-, author =	"Roberto Tamassia"
-, title =	"Graph Drawing"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"Elsevier Science Publishers B.V. North-Holland"
-, address =	"Amsterdam"
-, year =	2000
-, pages =	"937--971"
-, keywords =	"graph drawing, survey"
-, update =	"00.03 bibrelex, 99.03 bibrelex, 98.11 tamassia, 98.07 mitchell"
-, annote =	"Chapter 21 of su-hcg-00"
+, author =      "Roberto Tamassia"
+, title =       "Graph Drawing"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "Elsevier Science Publishers B.V. North-Holland"
+, address =     "Amsterdam"
+, year =        2000
+, pages =       "937--971"
+, keywords =    "graph drawing, survey"
+, update =      "00.03 bibrelex, 99.03 bibrelex, 98.11 tamassia, 98.07 mitchell"
+, annote =      "Chapter 21 of su-hcg-00"
 }
 
 @inproceedings{t-iadse-98
-, author =	"R. Tamassia"
-, title =	"Implementing Algorithms and Data Structures: an Educational and Research Perspective"
-, booktitle =	"Proc. Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '98"
-, series =	"Lect. Not. Comput. Sci."
-, publisher =	"Springer-Verlag"
-, year =	1998
-, update =	"98.11 tamassia"
+, author =      "R. Tamassia"
+, title =       "Implementing Algorithms and Data Structures: an Educational and Research Perspective"
+, booktitle =   "Proc. Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '98"
+, series =      "Lect. Not. Comput. Sci."
+, publisher =   "Springer-Verlag"
+, year =        1998
+, update =      "98.11 tamassia"
 }
 
 @inproceedings{t-nlter-85
-, author =	"R. Tamassia"
-, title =	"New Layout Techniques for Entity-Relationship Diagrams"
-, booktitle =	"Proc. 4th Internat. Conf. on Entity-Relationship Approach"
-, year =	1985
-, pages =	"304--311"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Tamassia"
+, title =       "New Layout Techniques for Entity-Relationship Diagrams"
+, booktitle =   "Proc. 4th Internat. Conf. on Entity-Relationship Approach"
+, year =        1985
+, pages =       "304--311"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{t-eggmn-87
-, author =	"R. Tamassia"
-, title =	"On Embedding a Graph in the Grid with the Minimum Number of Bends"
-, journal =	"SIAM J. Comput."
-, volume =	16
-, number =	3
-, year =	1987
-, pages =	"421--444"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Tamassia"
+, title =       "On Embedding a Graph in the Grid with the Minimum Number of Bends"
+, journal =     "SIAM J. Comput."
+, volume =      16
+, number =      3
+, year =        1987
+, pages =       "421--444"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{t-olpge-96
-, author =	"R. Tamassia"
-, title =	"On-Line Planar Graph Embedding"
-, journal =	"J. Algorithms"
-, volume =	21
-, number =	2
-, year =	1996
-, pages =	"201--239"
-, keywords =	"graph drawing, planar, embedding, dynamic"
-, succeeds =	"t-ddspg-88"
-, update =	"98.07 tamassia, 97.03 pocchiola+tamassia"
+, author =      "R. Tamassia"
+, title =       "On-Line Planar Graph Embedding"
+, journal =     "J. Algorithms"
+, volume =      21
+, number =      2
+, year =        1996
+, pages =       "201--239"
+, keywords =    "graph drawing, planar, embedding, dynamic"
+, succeeds =    "t-ddspg-88"
+, update =      "98.07 tamassia, 97.03 pocchiola+tamassia"
 }
 
 @inproceedings{t-podg-90
-, author =	"R. Tamassia"
-, title =	"Planar Orthogonal Drawings of Graphs"
-, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
-, year =	1990
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Tamassia"
+, title =       "Planar Orthogonal Drawings of Graphs"
+, booktitle =   "Proc. IEEE Internat. Sympos. on Circuits and Systems"
+, year =        1990
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{taacddfdhopsstvw-sdcg-96
-, author =	"R. Tamassia and P. Agarwal and N. Amato and D. Chen and D. Dobkin and R. Drysdale and S. Fortune and M. Goodrich and J. Hershberger and J. O'Rourke and F. P. Preparata and J.-R. Sack and S. Suri and I. Tollis and J. Vitter and S. Whitesides"
-, title =	"Strategic directions in computational geometry"
-, journal =	"ACM Comput. Surv."
-, volume =	28
-, number =	4
-, year =	1996
-, pages =	"591--606"
-, update =	"01.11 devillers, 98.07 tamassia, 98.03 mitchell, 97.11 sack"
-, annote =	"report of working group
+, author =      "R. Tamassia and P. Agarwal and N. Amato and D. Chen and D. Dobkin and R. Drysdale and S. Fortune and M. Goodrich and J. Hershberger and J. O'Rourke and F. P. Preparata and J.-R. Sack and S. Suri and I. Tollis and J. Vitter and S. Whitesides"
+, title =       "Strategic directions in computational geometry"
+, journal =     "ACM Comput. Surv."
+, volume =      28
+, number =      4
+, year =        1996
+, pages =       "591--606"
+, update =      "01.11 devillers, 98.07 tamassia, 98.03 mitchell, 97.11 sack"
+, annote =      "report of working group
  formed as part of ACM Workshop on Strategic Directions in Computing Research"
 }
 
 @incollection{tc-ds-
-, author =	"R. Tamassia and B. Cantrill"
-, title =	"Data Structures"
-, editor =	"A. B. Tucker Jr."
-, booktitle =	"Handbook of Computer Science and Engineering"
-, publisher =	"CRC Press"
-, year =	1997
-, pages =	"86--110"
-, url =	"https://www.cs.brown.edu/cgc/papers/tc-ds-.ps.gz"
-, keywords =	"data structures, survey"
-, update =	"97.03 tamassia"
+, author =      "R. Tamassia and B. Cantrill"
+, title =       "Data Structures"
+, editor =      "A. B. Tucker Jr."
+, booktitle =   "Handbook of Computer Science and Engineering"
+, publisher =   "CRC Press"
+, year =        1997
+, pages =       "86--110"
+, url = "https://www.cs.brown.edu/cgc/papers/tc-ds-.ps.gz"
+, keywords =    "data structures, survey"
+, update =      "97.03 tamassia"
 }
 
 @article{tdb-agdrd-88
-, author =	"R. Tamassia and G. {Di Battista} and C. Batini"
-, title =	"Automatic Graph Drawing and Readability of Diagrams"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	"SMC-18"
-, number =	1
-, year =	1988
-, pages =	"61--79"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Tamassia and G. {Di Battista} and C. Batini"
+, title =       "Automatic Graph Drawing and Readability of Diagrams"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      "SMC-18"
+, number =      1
+, year =        1988
+, pages =       "61--79"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{tlp-rpqiv-96
-, author =	"R. Tamassia and G. Liotta and F. P. Preparata"
-, title =	"Robust proximity queries in implicit {Voronoi} diagrams"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	1
-, update =	"97.03 agarwal, 96.09 mitchell"
-, annote =	"Invited Lecture by Roberto Tamassia"
+, author =      "R. Tamassia and G. Liotta and F. P. Preparata"
+, title =       "Robust proximity queries in implicit {Voronoi} diagrams"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       1
+, update =      "97.03 agarwal, 96.09 mitchell"
+, annote =      "Invited Lecture by Roberto Tamassia"
 }
 
 @article{t-sdcg-96
-, author =	"Roberto Tamassia and others"
-, title =	"Strategic Directions in Computational Geometry"
-, journal =	"ACM Comput. Surv."
-, volume =	28
-, number =	4
-, year =	1996
-, pages =	"591--606"
-, url =	"https://www.cs.brown.edu/people/rt/sdcr/report.html"
-, update =	"98.07 tamassia+vismara, 97.03 tamassia"
-, annote =	"short form of taacddfdhopsstvw-sdcg-96"
+, author =      "Roberto Tamassia and others"
+, title =       "Strategic Directions in Computational Geometry"
+, journal =     "ACM Comput. Surv."
+, volume =      28
+, number =      4
+, year =        1996
+, pages =       "591--606"
+, url = "https://www.cs.brown.edu/people/rt/sdcr/report.html"
+, update =      "98.07 tamassia+vismara, 97.03 tamassia"
+, annote =      "short form of taacddfdhopsstvw-sdcg-96"
 }
 
 @techreport{tp-dmpda-88
-, author =	"R. Tamassia and F. P. Preparata"
-, title =	"Dynamic maintenance of planar digraphs, with applications"
-, type =	"Report"
-, number =	"UILU-ENG-88-2227"
-, institution =	"Coordinated Sci. Lab., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1988
-, precedes =	"tp-dmpda-90"
+, author =      "R. Tamassia and F. P. Preparata"
+, title =       "Dynamic maintenance of planar digraphs, with applications"
+, type =        "Report"
+, number =      "UILU-ENG-88-2227"
+, institution = "Coordinated Sci. Lab., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1988
+, precedes =    "tp-dmpda-90"
 }
 
 @article{tp-dmpda-90
-, author =	"R. Tamassia and F. P. Preparata"
-, title =	"Dynamic maintenance of planar digraphs, with applications"
-, journal =	"Algorithmica"
-, volume =	5
-, year =	1990
-, pages =	"509--527"
-, succeeds =	"tp-dmpda-88"
+, author =      "R. Tamassia and F. P. Preparata"
+, title =       "Dynamic maintenance of planar digraphs, with applications"
+, journal =     "Algorithmica"
+, volume =      5
+, year =        1990
+, pages =       "509--527"
+, succeeds =    "tp-dmpda-88"
 }
 
 @article{tt-uavrp-86
-, author =	"R. Tamassia and I. G. Tollis"
-, title =	"A Unified Approach to Visibility Representations of Planar Graphs"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, number =	4
-, year =	1986
-, pages =	"321--341"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Tamassia and I. G. Tollis"
+, title =       "A Unified Approach to Visibility Representations of Planar Graphs"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, number =      4
+, year =        1986
+, pages =       "321--341"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{tt-cgvc-87
-, author =	"R. Tamassia and I. G. Tollis"
-, title =	"Centipede Graphs and Visibility on a Cylinder"
-, editor =	"G. Tinhofer and G. Schmidt"
-, booktitle =	"Graph Theoretic Concepts in Computer Science: Proc. Internat. Workshop WG '86 (Bernierd June 1986)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	246
-, publisher =	"Springer-Verlag"
-, year =	1987
-, pages =	"252--263"
-, keywords =	"graph drawing"
-, update =	"99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
+, author =      "R. Tamassia and I. G. Tollis"
+, title =       "Centipede Graphs and Visibility on a Cylinder"
+, editor =      "G. Tinhofer and G. Schmidt"
+, booktitle =   "Graph Theoretic Concepts in Computer Science: Proc. Internat. Workshop WG '86 (Bernierd June 1986)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      246
+, publisher =   "Springer-Verlag"
+, year =        1987
+, pages =       "252--263"
+, keywords =    "graph drawing"
+, update =      "99.11 bibrelex, 96.09 agarwal, 93.09 tamassia"
 }
 
 %    xxx = Philadelphia,
 @inproceedings{tt-eepgl-87
-, author =	"R. Tamassia and I. G. Tollis"
-, title =	"Efficient Embedding of Planar Graphs in Linear Time"
-, booktitle =	"Proc. IEEE Internat. Sympos. on Circuits and Systems"
-, year =	1987
-, pages =	"495--498"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Tamassia and I. G. Tollis"
+, title =       "Efficient Embedding of Planar Graphs in Linear Time"
+, booktitle =   "Proc. IEEE Internat. Sympos. on Circuits and Systems"
+, year =        1987
+, pages =       "495--498"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @proceedings{tt-gd-95
-, title =	"Graph Drawing (Proc. GD '94)"
-, editor =	"R. Tamassia and I. G. Tollis"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, keywords =	"graph drawing"
-, update =	"98.07 bibrelex+vismara, 95.01 tamassia"
+, title =       "Graph Drawing (Proc. GD '94)"
+, editor =      "R. Tamassia and I. G. Tollis"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, keywords =    "graph drawing"
+, update =      "98.07 bibrelex+vismara, 95.01 tamassia"
 }
 
 @article{tt-pgelt-89
-, author =	"R. Tamassia and I. G. Tollis"
-, title =	"Planar Grid Embedding in Linear Time"
-, journal =	"IEEE Trans. Circuits Syst."
-, volume =	"CAS-36"
-, number =	9
-, year =	1989
-, pages =	"1230--1234"
-, keywords =	"graph drawing"
-, update =	"96.09 devillers, 93.09 tamassia"
+, author =      "R. Tamassia and I. G. Tollis"
+, title =       "Planar Grid Embedding in Linear Time"
+, journal =     "IEEE Trans. Circuits Syst."
+, volume =      "CAS-36"
+, number =      9
+, year =        1989
+, pages =       "1230--1234"
+, keywords =    "graph drawing"
+, update =      "96.09 devillers, 93.09 tamassia"
 }
 
 @techreport{tt-prgvb-85
-, author =	"R. Tamassia and I. G. Tollis"
-, title =	"Plane representations of graphs and visibility between parallel segments"
-, type =	"Report"
-, number =	"UILU-ENG 85-2215"
-, institution =	"Coordinated Sci. Lab., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1985
+, author =      "R. Tamassia and I. G. Tollis"
+, title =       "Plane representations of graphs and visibility between parallel segments"
+, type =        "Report"
+, number =      "UILU-ENG 85-2215"
+, institution = "Coordinated Sci. Lab., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1985
 }
 
 @article{tt-rpdos-93
-, author =	"R. Tamassia and I. G. Tollis"
-, title =	"Reachability in Planar Digraphs with One Source and One Sink"
-, journal =	"Theoret. Comput. Sci. A"
-, volume =	119
-, year =	1993
-, pages =	"331--343"
-, update =	"94.05 tamassia"
+, author =      "R. Tamassia and I. G. Tollis"
+, title =       "Reachability in Planar Digraphs with One Source and One Sink"
+, journal =     "Theoret. Comput. Sci. A"
+, volume =      119
+, year =        1993
+, pages =       "331--343"
+, update =      "94.05 tamassia"
 }
 
 @article{tt-rgc-91
-, author =	"R. Tamassia and I. G. Tollis"
-, title =	"Representations of Graphs on a Cylinder"
-, journal =	"SIAM J. Discrete Math."
-, volume =	4
-, number =	1
-, year =	1991
-, pages =	"139--149"
-, update =	"94.01 tamassia"
+, author =      "R. Tamassia and I. G. Tollis"
+, title =       "Representations of Graphs on a Cylinder"
+, journal =     "SIAM J. Discrete Math."
+, volume =      4
+, number =      1
+, year =        1991
+, pages =       "139--149"
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{tt-trpg-89
-, author =	"R. Tamassia and I. G. Tollis"
-, title =	"Tessellation Representations of Planar Graphs"
-, booktitle =	"Proc. 27th Allerton Conf. Commun. Control Comput."
-, year =	1989
-, pages =	"48--57"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Tamassia and I. G. Tollis"
+, title =       "Tessellation Representations of Planar Graphs"
+, booktitle =   "Proc. 27th Allerton Conf. Commun. Control Comput."
+, year =        1989
+, pages =       "48--57"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @inproceedings{ttv-lbpap-91
-, author =	"R. Tamassia and I. G. Tollis and J. S. Vitter"
-, title =	"Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings"
-, booktitle =	"Proc. IEEE Symposium on Parallel and Distributed Processing"
-, year =	1991
-, pages =	"386--393"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Tamassia and I. G. Tollis and J. S. Vitter"
+, title =       "Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings"
+, booktitle =   "Proc. IEEE Symposium on Parallel and Distributed Processing"
+, year =        1991
+, pages =       "386--393"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{ttv-lbpod-91
-, author =	"R. Tamassia and I. G. Tollis and J. S. Vitter"
-, title =	"Lower Bounds for Planar Orthogonal Drawings of Graphs"
-, journal =	"Inform. Process. Lett."
-, volume =	39
-, year =	1991
-, pages =	"35--40"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. Tamassia and I. G. Tollis and J. S. Vitter"
+, title =       "Lower Bounds for Planar Orthogonal Drawings of Graphs"
+, journal =     "Inform. Process. Lett."
+, volume =      39
+, year =        1991
+, pages =       "35--40"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{tv-csaeg-97
-, author =	"R. Tamassia and L. Vismara"
-, title =	"A Case Study in Algorithm Engineering for Geometric Computing"
-, type =	"Technical Report"
-, number =	"CS-97-18"
-, institution =	"Center for Geometric Computing, Dept. Computer Science, Brown Univ."
-, month =	dec
-, year =	1997
-, url =	"ftp://ftp.cs.brown.edu/pub/techreports/97/cs97-18.ps.Z"
-, update =	"98.07 vismara"
+, author =      "R. Tamassia and L. Vismara"
+, title =       "A Case Study in Algorithm Engineering for Geometric Computing"
+, type =        "Technical Report"
+, number =      "CS-97-18"
+, institution = "Center for Geometric Computing, Dept. Computer Science, Brown Univ."
+, month =       dec
+, year =        1997
+, url = "ftp://ftp.cs.brown.edu/pub/techreports/97/cs97-18.ps.Z"
+, update =      "98.07 vismara"
 }
 
 @inproceedings{tvb-csaeg-97
-, author =	"Roberto Tamassia and Luca Vismara and James E. Baker"
-, title =	"A Case Study in Algorithm Engineering for Geometric Computing"
-, booktitle =	"Proc. Workshop on Algorithm Engineering"
-, nickname =	"WAE'97"
-, site =	"Venice"
-, month =	sep
-, year =	1997
-, pages =	"136--145"
-, url =	"http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap14.ps.gz"
-, update =	"00.11 smid, 00.07 icking, 98.11 bibrelex, 98.07 smid+tamassia+vahrenhold+vismara, 98.03 mitchell"
+, author =      "Roberto Tamassia and Luca Vismara and James E. Baker"
+, title =       "A Case Study in Algorithm Engineering for Geometric Computing"
+, booktitle =   "Proc. Workshop on Algorithm Engineering"
+, nickname =    "WAE'97"
+, site =        "Venice"
+, month =       sep
+, year =        1997
+, pages =       "136--145"
+, url = "http://www.dsi.unive.it/~wae97/proceedings/ONLY_PAPERS/pap14.ps.gz"
+, update =      "00.11 smid, 00.07 icking, 98.11 bibrelex, 98.07 smid+tamassia+vahrenhold+vismara, 98.03 mitchell"
 }
 
 @inproceedings{tv-ocsfc-90
-, author =	"R. Tamassia and J. S. Vitter"
-, title =	"Optimal Cooperative Search in Fractional Cascaded Data Structures"
-, booktitle =	"Proc. ACM Sympos. Parallel Algorithms Architect."
-, year =	1990
-, pages =	"307--316"
-, keywords =	"point location, fractional cascading"
-, precedes =	"tv-ocsfc-96"
-, update =	"97.11 bibrelex, 94.05 tamassia"
+, author =      "R. Tamassia and J. S. Vitter"
+, title =       "Optimal Cooperative Search in Fractional Cascaded Data Structures"
+, booktitle =   "Proc. ACM Sympos. Parallel Algorithms Architect."
+, year =        1990
+, pages =       "307--316"
+, keywords =    "point location, fractional cascading"
+, precedes =    "tv-ocsfc-96"
+, update =      "97.11 bibrelex, 94.05 tamassia"
 }
 
 @article{tv-ocsfc-96
-, author =	"R. Tamassia and J. S. Vitter"
-, title =	"Optimal Cooperative Search in Fractional Cascaded Data Structures"
-, journal =	"Algorithmica"
-, volume =	15
-, number =	2
-, year =	1996
-, keywords =	"point location, fractional cascading, cooperative search"
-, succeeds =	"tv-ocsfc-90"
-, update =	"95.09 tamassia, 94.05 tamassia"
+, author =      "R. Tamassia and J. S. Vitter"
+, title =       "Optimal Cooperative Search in Fractional Cascaded Data Structures"
+, journal =     "Algorithmica"
+, volume =      15
+, number =      2
+, year =        1996
+, keywords =    "point location, fractional cascading, cooperative search"
+, succeeds =    "tv-ocsfc-90"
+, update =      "95.09 tamassia, 94.05 tamassia"
 }
 
 @techreport{tv-opatc-89t
-, author =	"R. Tamassia and J. S. Vitter"
-, title =	"Optimal parallel algorithms for transitive closure and point location in planar structures"
-, type =	"Technical {Report}"
-, number =	"CS-89-20"
-, institution =	"Dept. Comput. Sci., Brown Univ."
-, address =	"Providence, RI"
-, month =	mar
-, year =	1989
-, update =	"97.11 bibrelex"
+, author =      "R. Tamassia and J. S. Vitter"
+, title =       "Optimal parallel algorithms for transitive closure and point location in planar structures"
+, type =        "Technical {Report}"
+, number =      "CS-89-20"
+, institution = "Dept. Comput. Sci., Brown Univ."
+, address =     "Providence, RI"
+, month =       mar
+, year =        1989
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{tv-opatc-89
-, author =	"R. Tamassia and J. S. Vitter"
-, title =	"Optimal parallel algorithms for transitive closure and point location in planar structures"
-, booktitle =	"Proc. ACM Sympos. Parallel Algorithms Architect."
-, year =	1989
-, pages =	"399--408"
-, keywords =	"graph drawing"
-, precedes =	"tv-ptcpl-91"
-, update =	"94.09 vitter, 93.09 tamassia"
+, author =      "R. Tamassia and J. S. Vitter"
+, title =       "Optimal parallel algorithms for transitive closure and point location in planar structures"
+, booktitle =   "Proc. ACM Sympos. Parallel Algorithms Architect."
+, year =        1989
+, pages =       "399--408"
+, keywords =    "graph drawing"
+, precedes =    "tv-ptcpl-91"
+, update =      "94.09 vitter, 93.09 tamassia"
 }
 
 @inproceedings{tv-opatc-89i
-, author =	"R. Tamassia and J. S. Vitter"
-, title =	"Optimal parallel algorithms for transitive closure and point location in planar structures"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, month =	nov
-, year =	1989
-, pages =	"169--178"
-, keywords =	"graph drawing"
-, update =	"95.09 mitchell, 94.09 vitter"
-, annote =	"invited paper"
+, author =      "R. Tamassia and J. S. Vitter"
+, title =       "Optimal parallel algorithms for transitive closure and point location in planar structures"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, month =       nov
+, year =        1989
+, pages =       "169--178"
+, keywords =    "graph drawing"
+, update =      "95.09 mitchell, 94.09 vitter"
+, annote =      "invited paper"
 }
 
 @article{tv-ptcpl-91
-, author =	"R. Tamassia and J. S. Vitter"
-, title =	"Parallel transitive closure and point location in planar structures"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, number =	4
-, year =	1991
-, pages =	"708--725"
-, keywords =	"graph drawing"
-, succeeds =	"tv-opatc-89"
-, update =	"94.09 vitter, 93.09 tamassia"
+, author =      "R. Tamassia and J. S. Vitter"
+, title =       "Parallel transitive closure and point location in planar structures"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, number =      4
+, year =        1991
+, pages =       "708--725"
+, keywords =    "graph drawing"
+, succeeds =    "tv-opatc-89"
+, update =      "94.09 vitter, 93.09 tamassia"
 }
 
 @article{t-cbmal-83
-, author =	"A. Tamir"
-, title =	"A class of balanced matrices arising from location problems"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	4
-, year =	1983
-, pages =	"363--370"
-, update =	"98.11 bibrelex"
+, author =      "A. Tamir"
+, title =       "A class of balanced matrices arising from location problems"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      4
+, year =        1983
+, pages =       "363--370"
+, update =      "98.11 bibrelex"
 }
 
 @article{t-icbcl-88
-, author =	"A. Tamir"
-, title =	"Improved complexity bounds for center location problems on networks by using dynamic data structures"
-, journal =	"SIAM J. Discrete Math."
-, volume =	1
-, year =	1988
-, pages =	"377--396"
-, update =	"95.09 agarwal"
+, author =      "A. Tamir"
+, title =       "Improved complexity bounds for center location problems on networks by using dynamic data structures"
+, journal =     "SIAM J. Discrete Math."
+, volume =      1
+, year =        1988
+, pages =       "377--396"
+, update =      "95.09 agarwal"
 }
 
 @article{t-csclp-92
-, author =	"A. Tamir"
-, title =	"On the complexity of some classes of location problems"
-, journal =	"Transp. Sci."
-, volume =	26
-, year =	1992
-, pages =	"352--354"
-, update =	"96.05 agarwal"
+, author =      "A. Tamir"
+, title =       "On the complexity of some classes of location problems"
+, journal =     "Transp. Sci."
+, volume =      26
+, year =        1992
+, pages =       "352--354"
+, update =      "96.05 agarwal"
 }
 
 @inproceedings{t-p4-87
-, author =	"A. Tamir"
-, title =	"Problem $4-2$"
-, booktitle =	"4th Computational Geometry Day"
-, organization =	"New York Univ."
-, year =	1987
-, update =	"98.07 bibrelex"
+, author =      "A. Tamir"
+, title =       "Problem $4-2$"
+, booktitle =   "4th Computational Geometry Day"
+, organization =        "New York Univ."
+, year =        1987
+, update =      "98.07 bibrelex"
 }
 
 @techreport{tm-mbmpa-95
-, author =	"A. Tamir and Joseph S. B. Mitchell"
-, title =	"A Maximum $b$-Matching Problem Arising from Median Location Models with Applications to the Roommates Problem"
-, year =	1995
-, keywords =	"geodesic distances, maximum weight matching, odd cycles, shortest paths"
-, precedes =	"tm-mbmpa-98"
-, update =	"98.03 mitchell"
+, author =      "A. Tamir and Joseph S. B. Mitchell"
+, title =       "A Maximum $b$-Matching Problem Arising from Median Location Models with Applications to the Roommates Problem"
+, year =        1995
+, keywords =    "geodesic distances, maximum weight matching, odd cycles, shortest paths"
+, precedes =    "tm-mbmpa-98"
+, update =      "98.03 mitchell"
 }
 
 @article{tm-mbmpa-98
-, author =	"A. Tamir and Joseph S. B. Mitchell"
-, title =	"A Maximum $b$-Matching Problem Arising from Median Location Models with Applications to the Roommates Problem"
-, journal =	"Math. Program."
-, volume =	80
-, year =	1998
-, pages =	"171--194"
-, keywords =	"geodesic distances, maximum weight matching, odd cycles, shortest paths"
-, succeeds =	"tm-mbmpa-95"
-, update =	"98.03 mitchell"
+, author =      "A. Tamir and Joseph S. B. Mitchell"
+, title =       "A Maximum $b$-Matching Problem Arising from Median Location Models with Applications to the Roommates Problem"
+, journal =     "Math. Program."
+, volume =      80
+, year =        1998
+, pages =       "171--194"
+, keywords =    "geodesic distances, maximum weight matching, odd cycles, shortest paths"
+, succeeds =    "tm-mbmpa-95"
+, update =      "98.03 mitchell"
 }
 
 @article{t-gdssp-??
-, author =	"M. Tamminen"
-, title =	"Geometric data structures: summary of project plan for the {Finnish} {Academy}"
-, journal =	"??"
-, volume =	"??"
-, year =	"??"
-, pages =	"??"
+, author =      "M. Tamminen"
+, title =       "Geometric data structures: summary of project plan for the {Finnish} {Academy}"
+, journal =     "??"
+, volume =      "??"
+, year =        "??"
+, pages =       "??"
 }
 
 @article{t-ecmcp-82
-, author =	"M. Tamminen"
-, title =	"The extendible cell method for closest point problems"
-, journal =	"BIT"
-, volume =	22
-, year =	1982
-, pages =	"27--41"
+, author =      "M. Tamminen"
+, title =       "The extendible cell method for closest point problems"
+, journal =     "BIT"
+, volume =      22
+, year =        1982
+, pages =       "27--41"
 }
 
 @techreport{t-ecmfg-80
-, author =	"M. Tamminen"
-, title =	"The extendible cell method for fast geometric access"
-, type =	"Report"
-, number =	"HTKK-TKP-A20"
-, institution =	"Helsinki Univ. Tech."
-, address =	"Espoo, Finland"
-, year =	1980
+, author =      "M. Tamminen"
+, title =       "The extendible cell method for fast geometric access"
+, type =        "Report"
+, number =      "HTKK-TKP-A20"
+, institution = "Helsinki Univ. Tech."
+, address =     "Espoo, Finland"
+, year =        1980
 }
 
 @article{tlsww-cmsg-86
-, author =	"M. Tamminen and W. K. Luk and P. Sipala and L. S. Woo and C. K. Wong"
-, title =	"Constructing maximal slicings from geometry"
-, journal =	"Acta Inform."
-, volume =	23
-, year =	1986
-, pages =	"267--288"
+, author =      "M. Tamminen and W. K. Luk and P. Sipala and L. S. Woo and C. K. Wong"
+, title =       "Constructing maximal slicings from geometry"
+, journal =     "Acta Inform."
+, volume =      23
+, year =        1986
+, pages =       "267--288"
 }
 
 @article{ts-eoccl-84
-, author =	"M. Tamminen and H. Samet"
-, title =	"Efficient octree conversion by connectivity labeling"
-, journal =	"Comput. Graph."
-, volume =	18
-, number =	3
-, month =	jul
-, year =	1984
-, pages =	"43--51"
-, note =	"Proc. SIGGRAPH '84"
-, update =	"96.09 devillers, 96.05 efrat"
+, author =      "M. Tamminen and H. Samet"
+, title =       "Efficient octree conversion by connectivity labeling"
+, journal =     "Comput. Graph."
+, volume =      18
+, number =      3
+, month =       jul
+, year =        1984
+, pages =       "43--51"
+, note =        "Proc. SIGGRAPH '84"
+, update =      "96.09 devillers, 96.05 efrat"
 }
 
 % ### others?
 @inproceedings{t-impbp-87
-, author =	"H. L. Tan and others"
-, title =	"Inspection of machine parts by back-projection reconstruction"
-, booktitle =	"Proc. IEEE Robotics and Automat."
-, site =	"North Carolina"
-, month =	apr
-, year =	1987
-, pages =	"503--508"
-, update =	"98.11 bibrelex"
+, author =      "H. L. Tan and others"
+, title =       "Inspection of machine parts by back-projection reconstruction"
+, booktitle =   "Proc. IEEE Robotics and Automat."
+, site =        "North Carolina"
+, month =       apr
+, year =        1987
+, pages =       "503--508"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{t-obcqt-94
-, author =	"T. S. Tan"
-, title =	"An optimal bound for conforming quality triangulations"
-, type =	"Technical {Report}"
-, institution =	"Det. Inform. Sys. \& Comput. Sci., National Univ. Singapore"
-, address =	"Singapore"
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "T. S. Tan"
+, title =       "An optimal bound for conforming quality triangulations"
+, type =        "Technical {Report}"
+, institution = "Det. Inform. Sys. \& Comput. Sci., National Univ. Singapore"
+, address =     "Singapore"
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @article{t-obhqc-96
-, author =	"T.-S. Tan"
-, title =	"An Optimal Bound for High-Quality Conforming Triangulations"
-, journal =	"Discrete Comput. Geom."
-, volume =	15
-, number =	2
-, month =	mar
-, year =	1996
-, pages =	"169--193"
-, update =	"96.09 held"
+, author =      "T.-S. Tan"
+, title =       "An Optimal Bound for High-Quality Conforming Triangulations"
+, journal =     "Discrete Comput. Geom."
+, volume =      15
+, number =      2
+, month =       mar
+, year =        1996
+, pages =       "169--193"
+, update =      "96.09 held"
 }
 
 @inproceedings{t-obqct-94
-, author =	"T.-S. Tan"
-, title =	"An Optimal Bound for Quality Conforming Triangulations"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"240--249"
-, cites =	"ba-acfem-76, bl-tfds-84, bde-tpwla-92, beg-pgmg-90, be-psntp-92, be-mgot-92i, bmr-lsntp-94, b-srpcs-88, c-atapd-74, d-dptd-91, et-ubcdt-93, etw-otama-92, g-eblit-75, l-scsi-77, ms-cinap-92, m-mgpqb-93, m-rtpsl-93, m-fctwm-94, r-nsaq2-93, t-otdt-93, t-obcqt-94, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones, 94.01 jones"
+, author =      "T.-S. Tan"
+, title =       "An Optimal Bound for Quality Conforming Triangulations"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "240--249"
+, cites =       "ba-acfem-76, bl-tfds-84, bde-tpwla-92, beg-pgmg-90, be-psntp-92, be-mgot-92i, bmr-lsntp-94, b-srpcs-88, c-atapd-74, d-dptd-91, et-ubcdt-93, etw-otama-92, g-eblit-75, l-scsi-77, ms-cinap-92, m-mgpqb-93, m-rtpsl-93, m-fctwm-94, r-nsaq2-93, t-otdt-93, t-obcqt-94, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones, 94.01 jones"
 }
 
 @phdthesis{t-otdt-93
-, author =	"T. S. Tan"
-, title =	"Optimal two-dimensional triangulations"
-, school =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1993
-, note =	"Technical Report UIUCDCS-R-92-1783"
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "T. S. Tan"
+, title =       "Optimal two-dimensional triangulations"
+, school =      "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1993
+, note =        "Technical Report UIUCDCS-R-92-1783"
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{t-obbtc-00
-, author =	"Xuehou Tan"
-, title =	"On optimal bridges between two convex regions"
-, journal =	"Inform. Process. Lett."
-, volume =	76
-, year =	2000
-, pages =	"163--168"
-, update =	"02.03 cheong"
+, author =      "Xuehou Tan"
+, title =       "On optimal bridges between two convex regions"
+, journal =     "Inform. Process. Lett."
+, volume =      76
+, year =        2000
+, pages =       "163--168"
+, update =      "02.03 cheong"
 }
 
 @inproceedings{th-cswrd-93
-, author =	"Xuehou Tan and Tomio Hirata"
-, title =	"Constructing Shortest Watchman Routes by Divide-and-conquer"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"68--77"
-, update =	"98.07 bibrelex, 94.05 smid, 93.09 milone+mitchell"
+, author =      "Xuehou Tan and Tomio Hirata"
+, title =       "Constructing Shortest Watchman Routes by Divide-and-conquer"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "68--77"
+, update =      "98.07 bibrelex, 94.05 smid, 93.09 milone+mitchell"
 }
 
 @inproceedings{th-tawra-97
-, author =	"Xuehou Tan and Tomio Hirata"
-, title =	"On the Time Analysis of Watchman Route Algorithms"
-, booktitle =	"Algorithm Workshop of the Information Processing Society of Japan"
-, year =	1997
-, pages =	"53--60"
-, keywords =	"watchman route, visibility path"
-, comments =	"Claims to address and fix an error in the analysis of
+, author =      "Xuehou Tan and Tomio Hirata"
+, title =       "On the Time Analysis of Watchman Route Algorithms"
+, booktitle =   "Algorithm Workshop of the Information Processing Society of Japan"
+, year =        1997
+, pages =       "53--60"
+, keywords =    "watchman route, visibility path"
+, comments =    "Claims to address and fix an error in the analysis of
                   time complexities in earlier watchman route
                   algorithms, as pointed out by Hammar and Nilsson;
                   this issue is still controversial"
-, update =	"98.03 mitchell"
-, annote =	"IPS of Japan Technical Report 97-AL-55-7"
+, update =      "98.03 mitchell"
+, annote =      "IPS of Japan Technical Report 97-AL-55-7"
 }
 
 @inproceedings{th-ssrsp-94
-, author =	"X. Tan and T. Hirata"
-, title =	"Shortest Safari Routes in Simple Polygon"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"523--531"
-, update =	"99.11 bibrelex, 98.03 mitchell+smid, 96.05 mitchell"
+, author =      "X. Tan and T. Hirata"
+, title =       "Shortest Safari Routes in Simple Polygon"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "523--531"
+, update =      "99.11 bibrelex, 98.03 mitchell+smid, 96.05 mitchell"
 }
 
 @article{thi-ciacs-99
-, author =	"X. Tan and T. Hirata and Y. Inagaki"
-, title =	"Corrigendum to ``An Incremental Algorithm for Constructing Shortest Watchman Routes''"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	9
-, number =	3
-, year =	1999
-, pages =	"319--323"
-, update =	"00.11 smid, 00.07 icking"
-, abstract =	"This corrigendum fixes an error that appears in the previously published papers
-		 concerning the watchman route problem. A modification to our incremental watchman
-		 route algorithm previously presented in this journal is made, which gives an
-		 $O(n^4)$ time solution to the watchman route problem."
+, author =      "X. Tan and T. Hirata and Y. Inagaki"
+, title =       "Corrigendum to ``An Incremental Algorithm for Constructing Shortest Watchman Routes''"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      9
+, number =      3
+, year =        1999
+, pages =       "319--323"
+, update =      "00.11 smid, 00.07 icking"
+, abstract =    "This corrigendum fixes an error that appears in the previously published papers
+                 concerning the watchman route problem. A modification to our incremental watchman
+                 route algorithm previously presented in this journal is made, which gives an
+                 $O(n^4)$ time solution to the watchman route problem."
 }
 
 @incollection{thi-iacsw-91
-, author =	"X. H. Tan and T. Hirata and Y. Inagaki"
-, title =	"An incremental algorithm for constructing shortest watchman routes"
-, booktitle =	"Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"163--175"
-, precedes =	"thi-iacsw-93"
-, update =	"96.05 mitchell"
+, author =      "X. H. Tan and T. Hirata and Y. Inagaki"
+, title =       "An incremental algorithm for constructing shortest watchman routes"
+, booktitle =   "Proc. 2nd Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "163--175"
+, precedes =    "thi-iacsw-93"
+, update =      "96.05 mitchell"
 }
 
 @article{thi-iacsw-93
-, author =	"X. H. Tan and T. Hirata and Y. Inagaki"
-, title =	"An incremental algorithm for constructing shortest watchman routes"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, number =	4
-, year =	1993
-, pages =	"351--365"
-, succeeds =	"thi-iacsw-91"
-, update =	"96.05 mitchell"
+, author =      "X. H. Tan and T. Hirata and Y. Inagaki"
+, title =       "An incremental algorithm for constructing shortest watchman routes"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, number =      4
+, year =        1993
+, pages =       "351--365"
+, succeeds =    "thi-iacsw-91"
+, update =      "96.05 mitchell"
 }
 
 @article{thi-ricop-90
-, author =	"X.-H. Tan and T. Hirata and Y. Inagaki"
-, title =	"Reporting intersections of $c$-oriented polygons"
-, journal =	"Trans. IECE Japan"
-, volume =	"E73"
-, number =	11
-, year =	1990
-, pages =	"1886--1892"
+, author =      "X.-H. Tan and T. Hirata and Y. Inagaki"
+, title =       "Reporting intersections of $c$-oriented polygons"
+, journal =     "Trans. IECE Japan"
+, volume =      "E73"
+, number =      11
+, year =        1990
+, pages =       "1886--1892"
 }
 
 @inproceedings{thi-splia-90
-, author =	"X.-H. Tan and T. Hirata and Y. Inagaki"
-, title =	"Spatial point location and its applications"
-, booktitle =	"Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	450
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"241--250"
+, author =      "X.-H. Tan and T. Hirata and Y. Inagaki"
+, title =       "Spatial point location and its applications"
+, booktitle =   "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      450
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "241--250"
 }
 
 @techreport{tb-esto-80
-, author =	"H. Tanaka and D. H. Ballard"
-, title =	"Extension of strip tree operations"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Univ. Rochester"
-, address =	"Rochester, NY"
-, year =	1980
-, update =	"94.05 devillers"
+, author =      "H. Tanaka and D. H. Ballard"
+, title =       "Extension of strip tree operations"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Univ. Rochester"
+, address =     "Rochester, NY"
+, year =        1980
+, update =      "94.05 devillers"
 }
 
 @article{tw-cmm-73
-, author =	"Michikazu Tanaka and Takao Wachi"
-, title =	"Computerized Marker Making"
-, journal =	"Journal of The Textile Machinery Society of Japan"
-, volume =	26
-, number =	7
-, year =	1973
-, pages =	"74--81"
-, update =	"98.07 bibrelex"
+, author =      "Michikazu Tanaka and Takao Wachi"
+, title =       "Computerized Marker Making"
+, journal =     "Journal of The Textile Machinery Society of Japan"
+, volume =      26
+, number =      7
+, year =        1973
+, pages =       "74--81"
+, update =      "98.07 bibrelex"
 }
 
 @article{th-gmt1m-80
-, author =	"M. Tanemura and M. Hasegawa"
-, title =	"Geometrical Models of Territory {I}. Models for Synchronous and Asynchronous Settlement of Territories"
-, journal =	"Journal of Theoretical Biology"
-, volume =	82
-, year =	1980
-, pages =	"477--496"
-, annote =	"VD as model of animal's territory. Centres move to
-		 equalise area. Circumcircle algorithm."
+, author =      "M. Tanemura and M. Hasegawa"
+, title =       "Geometrical Models of Territory {I}. Models for Synchronous and Asynchronous Settlement of Territories"
+, journal =     "Journal of Theoretical Biology"
+, volume =      82
+, year =        1980
+, pages =       "477--496"
+, annote =      "VD as model of animal's territory. Centres move to
+                 equalise area. Circumcircle algorithm."
 }
 
 @article{too-natdv-83
-, author =	"M. Tanemura and T. Ogawa and W. Ogita"
-, title =	"A New Algorithm for Three-Dimensional {Voronoi} Tessellation"
-, journal =	"J. Comput. Phys."
-, volume =	51
-, year =	1983
-, pages =	"191--207"
-, annote =	"Basic circumsphere algorithm (though calcs sphere
-		 centres). Compares times with Finney, Brostow
-		 algorithms."
+, author =      "M. Tanemura and T. Ogawa and W. Ogita"
+, title =       "A New Algorithm for Three-Dimensional {Voronoi} Tessellation"
+, journal =     "J. Comput. Phys."
+, volume =      51
+, year =        1983
+, pages =       "191--207"
+, annote =      "Basic circumsphere algorithm (though calcs sphere
+                 centres). Compares times with Finney, Brostow
+                 algorithms."
 }
 
 @inproceedings{tgs-crphr-95
-, author =	"P. J. Tanenbaum and M. T. Goodrich and E. R. Scheinerman"
-, title =	"Characterization and Recognition of Point-Halfspace and Related Orders"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"234--245"
-, keywords =	"graph drawing, order, containment"
-, update =	"95.01 tamassia"
+, author =      "P. J. Tanenbaum and M. T. Goodrich and E. R. Scheinerman"
+, title =       "Characterization and Recognition of Point-Halfspace and Related Orders"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "234--245"
+, keywords =    "graph drawing, order, containment"
+, update =      "95.01 tamassia"
 }
 
 @techreport{tw-sdrmp-95
-, author =	"P. J. Tanenbaum and S. Whitesides"
-, title =	"Simultaneous Dominance Representations of Multiple Posets"
-, type =	"Research {Report}"
-, number =	2624
-, institution =	"INRIA, Sophia-Antipolis"
-, address =	"BP93, 06902 Sophia-Antipolis, France"
-, year =	1995
-, update =	"97.03 tamassia"
+, author =      "P. J. Tanenbaum and S. Whitesides"
+, title =       "Simultaneous Dominance Representations of Multiple Posets"
+, type =        "Research {Report}"
+, number =      2624
+, institution = "INRIA, Sophia-Antipolis"
+, address =     "BP93, 06902 Sophia-Antipolis, France"
+, year =        1995
+, update =      "97.03 tamassia"
 }
 
 @article{tl-osupa-84
-, author =	"C. Y. Tang and R. C. T. Lee"
-, title =	"Optimal speeding up of parallel algorithms based upon the divide and conquer strategy"
-, journal =	"Inform. Sci."
-, volume =	32
-, year =	1984
-, pages =	"173--186"
+, author =      "C. Y. Tang and R. C. T. Lee"
+, title =       "Optimal speeding up of parallel algorithms based upon the divide and conquer strategy"
+, journal =     "Inform. Sci."
+, volume =      32
+, year =        1984
+, pages =       "173--186"
 }
 
 @article{tccw-tmgsb-99
-, author =	"K. Tang and S. Y. Chou and L.-L. Chen and T. C. Woo"
-, title =	"Tetrahedral Mesh Generation for Solids Based on Alternating Sum of Volumes"
-, journal =	"Comput. Ind. Engin."
-, volume =	41
-, number =	1
-, year =	1999
-, pages =	"65--81"
-, update =	"00.03 held"
+, author =      "K. Tang and S. Y. Chou and L.-L. Chen and T. C. Woo"
+, title =       "Tetrahedral Mesh Generation for Solids Based on Alternating Sum of Volumes"
+, journal =     "Comput. Ind. Engin."
+, volume =      41
+, number =      1
+, year =        1999
+, pages =       "65--81"
+, update =      "00.03 held"
 }
 
 @article{twccwj-cpspt-97
-, author =	"K. Tang and M.-E. Wang and L.-L. Chen and S.-Y. Chou and T. C. Woo and R. Janardan"
-, title =	"Computing Planar Swept Polygons under Translation"
-, journal =	"Comput. Aided Design"
-, volume =	29
-, number =	12
-, year =	1997
-, pages =	"825--836"
-, update =	"98.07 held"
+, author =      "K. Tang and M.-E. Wang and L.-L. Chen and S.-Y. Chou and T. C. Woo and R. Janardan"
+, title =       "Computing Planar Swept Polygons under Translation"
+, journal =     "Comput. Aided Design"
+, volume =      29
+, number =      12
+, year =        1997
+, pages =       "825--836"
+, update =      "98.07 held"
 }
 
 @article{tvo-ifnmu-98
-, author =	"J. W. H. Tangelder and J. S. M. Vergeest and M. H. Overmars"
-, title =	"Interference-free NC Machining Using Spatial Planning and {Minkowski} Operations"
-, journal =	"Comput. Aided Design"
-, volume =	30
-, number =	4
-, month =	apr
-, year =	1998
-, pages =	"277--286"
-, update =	"98.07 held"
+, author =      "J. W. H. Tangelder and J. S. M. Vergeest and M. H. Overmars"
+, title =       "Interference-free NC Machining Using Spatial Planning and {Minkowski} Operations"
+, journal =     "Comput. Aided Design"
+, volume =      30
+, number =      4
+, month =       apr
+, year =        1998
+, pages =       "277--286"
+, update =      "98.07 held"
 }
 
 @article{t-mdsp-81
-, author =	"S. L. Tanimoto"
-, title =	"A method for detecting structure in polygons"
-, journal =	"Pattern Recogn."
-, volume =	13
-, year =	1981
-, pages =	"389--394"
+, author =      "S. L. Tanimoto"
+, title =       "A method for detecting structure in polygons"
+, journal =     "Pattern Recogn."
+, volume =      13
+, year =        1981
+, pages =       "389--394"
 }
 
 @incollection{t-ids-80
-, author =	"S. L. Tanimoto"
-, title =	"Image data structures"
-, editor =	"S. L. Tanimoto and A. Klinger"
-, booktitle =	"Structured Computer Vision: {Machine} Perception through Hierarchical Computation Structures"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1980
-, pages =	"??"
-, update =	"99.11 bibrelex"
+, author =      "S. L. Tanimoto"
+, title =       "Image data structures"
+, editor =      "S. L. Tanimoto and A. Klinger"
+, booktitle =   "Structured Computer Vision: {Machine} Perception through Hierarchical Computation Structures"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1980
+, pages =       "??"
+, update =      "99.11 bibrelex"
 }
 
 @incollection{t-pthpi-82
-, author =	"S. L. Tanimoto"
-, title =	"Programming techniques for hierarchical parallel image processors"
-, editor =	"K. Preston and L. Uhr"
-, booktitle =	"Multicomputers and Image Processing Algorithms"
-, publisher =	"Academic Press"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "S. L. Tanimoto"
+, title =       "Programming techniques for hierarchical parallel image processors"
+, editor =      "K. Preston and L. Uhr"
+, booktitle =   "Multicomputers and Image Processing Algorithms"
+, publisher =   "Academic Press"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @book{tk-scvmp-80
-, author =	"S. L. Tanimoto and A. Klinger"
-, title =	"Structured Computer Vision: {Machine} Perception through Hierarchical Computation Structures"
-, publisher =	"Academic Press"
-, year =	1980
-, update =	"97.11 bibrelex"
+, author =      "S. L. Tanimoto and A. Klinger"
+, title =       "Structured Computer Vision: {Machine} Perception through Hierarchical Computation Structures"
+, publisher =   "Academic Press"
+, year =        1980
+, update =      "97.11 bibrelex"
 }
 
 @article{th-snona-86
-, author =	"D. Tank and J. Hopfield"
-, title =	"Simple ``neural'' optimization networks: an {A}/{D} converter, signal decision circuit, and a linear programming circuit"
-, journal =	"IEEE Trans. Circuits Syst."
-, volume =	33
-, year =	1986
-, pages =	"533--541"
-, update =	"98.07 bibrelex"
+, author =      "D. Tank and J. Hopfield"
+, title =       "Simple ``neural'' optimization networks: an {A}/{D} converter, signal decision circuit, and a linear programming circuit"
+, journal =     "IEEE Trans. Circuits Syst."
+, volume =      33
+, year =        1986
+, pages =       "533--541"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{tv-spfsa-97
-, author =	"S. Tarasov and M. Vyalyi"
-, title =	"Some PL functions on surfaces are not height functions"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"113--118"
-, cites =	"elr-ogdi-91, m-spcgt-92, bt-hftcp-75, r-mct-74, a-slddf-21, w-bzv-36, b-cpcep-67, dnf-mg-79, st-vig-38, m-mt-63, ass-ctsp-93, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "S. Tarasov and M. Vyalyi"
+, title =       "Some PL functions on surfaces are not height functions"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "113--118"
+, cites =       "elr-ogdi-91, m-spcgt-92, bt-hftcp-75, r-mct-74, a-slddf-21, w-bzv-36, b-cpcep-67, dnf-mg-79, st-vig-38, m-mt-63, ass-ctsp-93, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{t-hrc-97
-, author =	"Sergey P. Tarasov"
-, title =	"On Hardness of Roundness Calculation"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"175--180"
-, update =	"97.11 jones"
+, author =      "Sergey P. Tarasov"
+, title =       "On Hardness of Roundness Calculation"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "175--180"
+, update =      "97.11 jones"
 }
 
 @article{t-spasc-86
-, author =	"E. Tardos"
-, title =	"A strongly polynomial algorithm to solve combinatorial linear programs"
-, journal =	"Oper. Res."
-, volume =	34
-, year =	1986
-, pages =	"250--256"
-, update =	"93.09 milone+mitchell"
+, author =      "E. Tardos"
+, title =       "A strongly polynomial algorithm to solve combinatorial linear programs"
+, journal =     "Oper. Res."
+, volume =      34
+, year =        1986
+, pages =       "250--256"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{tv-epba-85
-, author =	"R. Tarjan and U. Vishkin"
-, title =	"An efficient parallel biconnectivity algorithm"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"862--874"
-, update =	"97.11 bibrelex"
+, author =      "R. Tarjan and U. Vishkin"
+, title =       "An efficient parallel biconnectivity algorithm"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "862--874"
+, update =      "97.11 bibrelex"
 }
 
 @article{t-cawrn-79
-, author =	"R. E. Tarjan"
-, title =	"A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	18
-, year =	1979
-, pages =	"110--127"
-, update =	"96.09 orourke"
+, author =      "R. E. Tarjan"
+, title =       "A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      18
+, year =        1979
+, pages =       "110--127"
+, update =      "96.09 orourke"
 }
 
 @article{t-ad-87
-, author =	"R. E. Tarjan"
-, title =	"Algorithm Design"
-, journal =	"Commun. ACM"
-, volume =	30
-, number =	3
-, year =	1987
-, pages =	"205--212"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "R. E. Tarjan"
+, title =       "Algorithm Design"
+, journal =     "Commun. ACM"
+, volume =      30
+, number =      3
+, year =        1987
+, pages =       "205--212"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{t-acc-85
-, author =	"R. E. Tarjan"
-, title =	"Amortized computational complexity"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	6
-, number =	2
-, year =	1985
-, pages =	"306--318"
-, keywords =	"design of algorithms, data structuring, amortized analysis, survey paper"
+, author =      "R. E. Tarjan"
+, title =       "Amortized computational complexity"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      6
+, number =      2
+, year =        1985
+, pages =       "306--318"
+, keywords =    "design of algorithms, data structuring, amortized analysis, survey paper"
 }
 
 @article{t-iahcu-83
-, author =	"R. E. Tarjan"
-, title =	"An improved algorithm for hierarchical clustering using strong components"
-, journal =	"Inform. Process. Lett."
-, volume =	17
-, year =	1983
-, pages =	"37--41"
+, author =      "R. E. Tarjan"
+, title =       "An improved algorithm for hierarchical clustering using strong components"
+, journal =     "Inform. Process. Lett."
+, volume =      17
+, year =        1983
+, pages =       "37--41"
 }
 
 @article{t-cmncc-78
-, author =	"R. E. Tarjan"
-, title =	"Complexity of monotone networks for computing conjunctions"
-, journal =	"Ann. Discrete Math."
-, volume =	2
-, year =	1978
-, pages =	"121--133"
-, update =	"98.03 bibrelex"
+, author =      "R. E. Tarjan"
+, title =       "Complexity of monotone networks for computing conjunctions"
+, journal =     "Ann. Discrete Math."
+, volume =      2
+, year =        1978
+, pages =       "121--133"
+, update =      "98.03 bibrelex"
 }
 
 @book{t-dsna-83
-, author =	"R. E. Tarjan"
-, title =	"Data Structures and Network Algorithms"
-, series =	"CBMS-NSF Regional Conference Series in Applied Mathematics"
-, volume =	44
-, publisher =	"Society for Industrial and Applied Mathematics"
-, address =	"Philadelphia, PA"
-, year =	1983
-, keywords =	"graph drawing, disjoint sets, heaps, search trees, linking and cutting trees, minimum spanning trees, shortest paths, network flows, matchings, analysis of algorithms"
-, update =	"98.07 tamassia+vismara, 97.11 bibrelex, 93.09 tamassia"
+, author =      "R. E. Tarjan"
+, title =       "Data Structures and Network Algorithms"
+, series =      "CBMS-NSF Regional Conference Series in Applied Mathematics"
+, volume =      44
+, publisher =   "Society for Industrial and Applied Mathematics"
+, address =     "Philadelphia, PA"
+, year =        1983
+, keywords =    "graph drawing, disjoint sets, heaps, search trees, linking and cutting trees, minimum spanning trees, shortest paths, network flows, matchings, analysis of algorithms"
+, update =      "98.07 tamassia+vismara, 97.11 bibrelex, 93.09 tamassia"
 }
 
 @article{t-dfslg-72
-, author =	"R. E. Tarjan"
-, title =	"Depth-first search and linear graph algorithms"
-, journal =	"SIAM J. Comput."
-, volume =	1
-, number =	2
-, year =	1972
-, pages =	"146--160"
-, update =	"98.07 patrignani, 98.03 bibrelex"
+, author =      "R. E. Tarjan"
+, title =       "Depth-first search and linear graph algorithms"
+, journal =     "SIAM J. Comput."
+, volume =      1
+, number =      2
+, year =        1972
+, pages =       "146--160"
+, update =      "98.07 patrignani, 98.03 bibrelex"
 }
 
 @article{t-egbnl-75
-, author =	"R. E. Tarjan"
-, title =	"Efficiency of a good but not linear set union algorithm"
-, journal =	"J. ACM"
-, volume =	22
-, year =	1975
-, pages =	"215--225"
-, update =	"98.03 bibrelex"
+, author =      "R. E. Tarjan"
+, title =       "Efficiency of a good but not linear set union algorithm"
+, journal =     "J. ACM"
+, volume =      22
+, year =        1975
+, pages =       "215--225"
+, update =      "98.03 bibrelex"
 }
 
 @article{t-ubstr-83
-, author =	"R. E. Tarjan"
-, title =	"Updating balanced search tree in $O(1)$ rotations"
-, journal =	"Inf. Proc. Letters"
-, volume =	16
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "R. E. Tarjan"
+, title =       "Updating balanced search tree in $O(1)$ rotations"
+, journal =     "Inf. Proc. Letters"
+, volume =      16
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{tv-tsp-87
-, author =	"R. E. Tarjan and C. {Van Wyk}"
-, title =	"Triangulation of a simple polygon"
-, journal =	"SIAM J. Comput."
-, volume =	"??"
-, year =	1987
-, update =	"98.07 bibrelex"
+, author =      "R. E. Tarjan and C. {Van Wyk}"
+, title =       "Triangulation of a simple polygon"
+, journal =     "SIAM J. Comput."
+, volume =      "??"
+, year =        1987
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{tv-ltats-86
-, author =	"R. E. Tarjan and C. J. {Van Wyk}"
-, title =	"A linear-time algorithm for triangulating simple polygons"
-, booktitle =	"Proc. 18th Annu. ACM Sympos. Theory Comput."
-, year =	1986
-, pages =	"380--388"
-, note =	"Erratum in SIGACT News 18:4 (1987), 63"
-, keywords =	"design of algorithms, triangulation, visibility, divide-and-conquer, finger search trees, amortized analysis"
-, precedes =	"tv-otats-88"
-, update =	"94.01 jones"
+, author =      "R. E. Tarjan and C. J. {Van Wyk}"
+, title =       "A linear-time algorithm for triangulating simple polygons"
+, booktitle =   "Proc. 18th Annu. ACM Sympos. Theory Comput."
+, year =        1986
+, pages =       "380--388"
+, note =        "Erratum in SIGACT News 18:4 (1987), 63"
+, keywords =    "design of algorithms, triangulation, visibility, divide-and-conquer, finger search trees, amortized analysis"
+, precedes =    "tv-otats-88"
+, update =      "94.01 jones"
 }
 
 @article{tv-otats-88
-, author =	"R. E. Tarjan and C. J. {Van Wyk}"
-, title =	"An {$O(n \log\log n)$}-time algorithm for triangulating a simple polygon"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, year =	1988
-, pages =	"143--178"
-, note =	"Erratum in 17 (1988), 106"
-, keywords =	"design of algorithms, triangulation, visibility, divide-and-conquer, finger search trees, amortized analysis"
-, succeeds =	"tv-ltats-86"
+, author =      "R. E. Tarjan and C. J. {Van Wyk}"
+, title =       "An {$O(n \log\log n)$}-time algorithm for triangulating a simple polygon"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, year =        1988
+, pages =       "143--178"
+, note =        "Erratum in 17 (1988), 106"
+, keywords =    "design of algorithms, triangulation, visibility, divide-and-conquer, finger search trees, amortized analysis"
+, succeeds =    "tv-ltats-86"
 }
 
 @techreport{tv-otats-86
-, author =	"R. E. Tarjan and C. J. {Van Wyk}"
-, title =	"An {$O(n \log\log n)$} Time Algorithm for Triangulating Simple Polygons"
-, type =	"Report"
-, number =	"CS-TR-052-86"
-, institution =	"Princeton Univ."
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "R. E. Tarjan and C. J. {Van Wyk}"
+, title =       "An {$O(n \log\log n)$} Time Algorithm for Triangulating Simple Polygons"
+, type =        "Report"
+, number =      "CS-TR-052-86"
+, institution = "Princeton Univ."
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @article{ty-sltat-84
-, author =	"R. E. Tarjan and M. Yannakakis"
-, title =	"Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs"
-, journal =	"SIAM J. Comput."
-, volume =	13
-, year =	1984
-, pages =	"566--579"
-, update =	"97.11 bibrelex"
+, author =      "R. E. Tarjan and M. Yannakakis"
+, title =       "Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs"
+, journal =     "SIAM J. Comput."
+, volume =      13
+, year =        1984
+, pages =       "566--579"
+, update =      "97.11 bibrelex"
 }
 
 @article{t-clc-75
-, author =	"T. G. Tarj{\'a}n"
-, title =	"Complexity of lattice-configurations"
-, journal =	"Studia Scientiarum Mathematicarum Hungarica"
-, volume =	10
-, year =	1975
-, pages =	"203--211"
-, update =	"98.03 bibrelex"
+, author =      "T. G. Tarj{\'a}n"
+, title =       "Complexity of lattice-configurations"
+, journal =     "Studia Scientiarum Mathematicarum Hungarica"
+, volume =      10
+, year =        1975
+, pages =       "203--211"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{t-ptssq-93
-, author =	"Alexander G. Tarnowski"
-, title =	"Polynomial time solvability of some quillotine cutting stock problems"
-, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
-, month =	jun
-, year =	1993
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Alexander G. Tarnowski"
+, title =       "Polynomial time solvability of some quillotine cutting stock problems"
+, booktitle =   "Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
+, month =       jun
+, year =        1993
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @book{t-dmeag-51
-, author =	"A. Tarski"
-, title =	"A decision method for elementary algebra and geometry"
-, publisher =	"Univ. of California Press"
-, address =	"Berkeley, CA"
-, year =	1951
+, author =      "A. Tarski"
+, title =       "A decision method for elementary algebra and geometry"
+, publisher =   "Univ. of California Press"
+, address =     "Berkeley, CA"
+, year =        1951
 }
 
 @article{t-wclnn-97
-, author =	"L. Tassiulas"
-, title =	"Worst case length of nearest neighbor tours for the {Euclidean} traveling salesman problem"
-, journal =	"SIAM J. Discrete Math."
-, volume =	10
-, year =	1997
-, pages =	"171--179"
-, update =	"98.03 smid"
+, author =      "L. Tassiulas"
+, title =       "Worst case length of nearest neighbor tours for the {Euclidean} traveling salesman problem"
+, journal =     "SIAM J. Discrete Math."
+, volume =      10
+, year =        1997
+, pages =       "171--179"
+, update =      "98.03 smid"
 }
 
 @inproceedings{tx-gpsda-00
-, author =	"S. R. Tate and K. Xu"
-, title =	"General-purpose spatial decomposition algorithms: {Experimental} results"
-, booktitle =	"Proc. 2nd Workshop Algorithm Eng. Exper."
-, nickname =	"ALENEX '00"
-, year =	2000
-, pages =	"197--215"
-, update =	"01.11 smid"
+, author =      "S. R. Tate and K. Xu"
+, title =       "General-purpose spatial decomposition algorithms: {Experimental} results"
+, booktitle =   "Proc. 2nd Workshop Algorithm Eng. Exper."
+, nickname =    "ALENEX '00"
+, year =        2000
+, pages =       "197--215"
+, update =      "01.11 smid"
 }
 
 @inproceedings{tghl-pfsc-98
-, author =	"G. Taubin and A. Gu{\'e}ziec and W. Horn and F. Lazarus"
-, title =	"Progressive Forest Split Compression"
-, booktitle =	"Proc. SIGGRAPH '98"
-, site =	"Orlando, FL"
-, series =	"Computer Graphics Proceedings, Annual Conference Series"
-, month =	jul
-, year =	1998
-, pages =	""
-, update =	"98.11 held"
+, author =      "G. Taubin and A. Gu{\'e}ziec and W. Horn and F. Lazarus"
+, title =       "Progressive Forest Split Compression"
+, booktitle =   "Proc. SIGGRAPH '98"
+, site =        "Orlando, FL"
+, series =      "Computer Graphics Proceedings, Annual Conference Series"
+, month =       jul
+, year =        1998
+, pages =       ""
+, update =      "98.11 held"
 }
 
 @techreport{tr-gctts-96
-, author =	"G. Taubin and J. Rossignac"
-, title =	"Geometric Compression Through Topological Surgery"
-, number =	"RC-20340"
-, institution =	"IBM T. J. Watson Research Center"
-, address =	"Yorktown Heights, NY"
-, month =	jan
-, year =	1996
-, update =	"96.05 held"
+, author =      "G. Taubin and J. Rossignac"
+, title =       "Geometric Compression Through Topological Surgery"
+, number =      "RC-20340"
+, institution = "IBM T. J. Watson Research Center"
+, address =     "Yorktown Heights, NY"
+, month =       jan
+, year =        1996
+, update =      "96.05 held"
 }
 
 @article{tr-gctts-98
-, author =	"G. Taubin and J. Rossignac"
-, title =	"Geometric Compression Through Topological Surgery"
-, journal =	"ACM Trans. Graph."
-, volume =	17
-, number =	2
-, month =	apr
-, year =	1998
-, pages =	"84--115"
-, succeeds =	"tr-gctts-96"
-, update =	"99.03 held"
+, author =      "G. Taubin and J. Rossignac"
+, title =       "Geometric Compression Through Topological Surgery"
+, journal =     "ACM Trans. Graph."
+, volume =      17
+, number =      2
+, month =       apr
+, year =        1998
+, pages =       "84--115"
+, succeeds =    "tr-gctts-96"
+, update =      "99.03 held"
 }
 
 @proceedings{t-p4imr-95
-, title =	"Proc. 4th International Meshing Roundtable"
-, editor =	"Timothy J. Tautges"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1995
-, note =	"Also Sandia Report 95-2301"
-, comments =	"copies on request from Ann Sample, wasampl<at>sandia.gov"
-, update =	"96.01 samitchell"
+, title =       "Proc. 4th International Meshing Roundtable"
+, editor =      "Timothy J. Tautges"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1995
+, note =        "Also Sandia Report 95-2301"
+, comments =    "copies on request from Ann Sample, wasampl<at>sandia.gov"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{tm-wwicr-95
-, author =	"Timothy J. Tautges and Scott Mitchell"
-, title =	"Whisker Weaving: Invalid Connectivity Resolution and Primal Construction Algorithm"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"115--128"
-, update =	"96.01 samitchell"
+, author =      "Timothy J. Tautges and Scott Mitchell"
+, title =       "Whisker Weaving: Invalid Connectivity Resolution and Primal Construction Algorithm"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "115--128"
+, update =      "96.01 samitchell"
 }
 
 @article{tmb-cbmrc-
-, author =	"T. J. Tautges and S. A. Mitchell and T. D. Blacker"
-, title =	"A connectivity based method for representing and constructing all-hexahedral finite element meshes, {Part} {II}: {Whisker} weaving"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	"??"
-, year =	"??"
-, note =	"Submitted"
-, update =	"98.03 bibrelex"
+, author =      "T. J. Tautges and S. A. Mitchell and T. D. Blacker"
+, title =       "A connectivity based method for representing and constructing all-hexahedral finite element meshes, {Part} {II}: {Whisker} weaving"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      "??"
+, year =        "??"
+, note =        "Submitted"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{t-eacbr-91
-, author =	"M. S. Tawfik"
-, title =	"An Efficient Algorithm for {CSG} to {B}-{Rep} Conversion"
-, booktitle =	"ACM SIGGRAPH Sympos. on Solid Modeling Foundations and CAD/CAM Applications"
-, site =	"Austin, TX."
-, year =	1991
-, pages =	""
-, update =	"93.09 goodrich"
+, author =      "M. S. Tawfik"
+, title =       "An Efficient Algorithm for {CSG} to {B}-{Rep} Conversion"
+, booktitle =   "ACM SIGGRAPH Sympos. on Solid Modeling Foundations and CAD/CAM Applications"
+, site =        "Austin, TX."
+, year =        1991
+, pages =       ""
+, update =      "93.09 goodrich"
 }
 
 @article{t-rprbj-83
-, author =	"T. S. Tay"
-, title =	"Review: problems on the rigidity of bar and joint frameworks and linkage of rigid bodies"
-, journal =	"Structural Topology"
-, volume =	8
-, year =	1983
-, pages =	"33--36"
-, update =	"97.11 bibrelex"
+, author =      "T. S. Tay"
+, title =       "Review: problems on the rigidity of bar and joint frameworks and linkage of rigid bodies"
+, journal =     "Structural Topology"
+, volume =      8
+, year =        1983
+, pages =       "33--36"
+, update =      "97.11 bibrelex"
 }
 
 @article{tw-rdgrs-84
-, author =	"T. S. Tay and W. Whiteley"
-, title =	"Recent developments on the generic rigidy of structures"
-, journal =	"Structural Topology"
-, volume =	9
-, year =	1984
-, pages =	"31--38"
-, update =	"97.11 bibrelex"
+, author =      "T. S. Tay and W. Whiteley"
+, title =       "Recent developments on the generic rigidy of structures"
+, journal =     "Structural Topology"
+, volume =      9
+, year =        1984
+, pages =       "31--38"
+, update =      "97.11 bibrelex"
 }
 
 @article{t-gscs-91
-, author =	"J. E. Taylor"
-, title =	"On the global structure of crystalline surfaces"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"225--262"
+, author =      "J. E. Taylor"
+, title =       "On the global structure of crystalline surfaces"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "225--262"
 }
 
 @article{t-sssbl-76
-, author =	"J. E. Taylor"
-, title =	"The structure of singularities in soap-bubble-like and soap-film-like minimal surfaces"
-, journal =	"Annals of Math."
-, volume =	103
-, year =	1976
-, pages =	"489--539"
-, update =	"97.11 bibrelex"
+, author =      "J. E. Taylor"
+, title =       "The structure of singularities in soap-bubble-like and soap-film-like minimal surfaces"
+, journal =     "Annals of Math."
+, volume =      103
+, year =        1976
+, pages =       "489--539"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{t-smcpt-76
-, author =	"R. H. Taylor"
-, title =	"The synthesis of manipulator control programs from task-level specifications"
-, number =	"AIM-282"
-, institution =	"Artificial Intelligence Laboratory, Stanford Univ."
-, address =	"Stanford, CA"
-, month =	jul
-, year =	1976
-, update =	"98.03 bibrelex"
+, author =      "R. H. Taylor"
+, title =       "The synthesis of manipulator control programs from task-level specifications"
+, number =      "AIM-282"
+, institution = "Artificial Intelligence Laboratory, Stanford Univ."
+, address =     "Stanford, CA"
+, month =       jul
+, year =        1976
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{t-paegf-96
-, author =	"M. Teichmann"
-, title =	"Probabilistic algorithms for efficient grasping and fixturing"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"277--282"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "M. Teichmann"
+, title =       "Probabilistic algorithms for efficient grasping and fixturing"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "277--282"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @incollection{t-stc-88
-, author =	"M. Teichmann"
-, title =	"Shoving a table into a corner"
-, editor =	"G. Toussaint"
-, booktitle =	"Snapshots of computational and discrete geometry"
-, publisher =	"McGill Univ."
-, year =	1988
-, pages =	"99--118"
-, note =	"TR-SOCS 88.11"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "M. Teichmann"
+, title =       "Shoving a table into a corner"
+, editor =      "G. Toussaint"
+, booktitle =   "Snapshots of computational and discrete geometry"
+, publisher =   "McGill Univ."
+, year =        1988
+, pages =       "99--118"
+, note =        "TR-SOCS 88.11"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{t-stc-89
-, author =	"M. Teichmann"
-, title =	"Shoving a table into a corner"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	9
+, author =      "M. Teichmann"
+, title =       "Shoving a table into a corner"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       9
 }
 
 @mastersthesis{t-wpop-89
-, author =	"M. Teichmann"
-, title =	"Wedge Placement Optimization Problems"
-, school =	"School of Computer Science, McGill University"
-, year =	1989
-, keywords =	"master thesis"
-, update =	"98.11 bibrelex"
+, author =      "M. Teichmann"
+, title =       "Wedge Placement Optimization Problems"
+, school =      "School of Computer Science, McGill University"
+, year =        1989
+, keywords =    "master thesis"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{tm-ragum-94
-, author =	"M. Teichmann and B. Mishra"
-, title =	"Reactive algorithms for grasping using a modified parallel jaw gripper"
-, booktitle =	"Proc. IEEE Intl. Conf. on Robotics and Automation"
-, month =	may
-, year =	1994
-, update =	"98.11 bibrelex"
+, author =      "M. Teichmann and B. Mishra"
+, title =       "Reactive algorithms for grasping using a modified parallel jaw gripper"
+, booktitle =   "Proc. IEEE Intl. Conf. on Robotics and Automation"
+, month =       may
+, year =        1994
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{t-tdtc-99
-, author =	"Monique Teillaud"
-, title =	"Three Dimensional Triangulations in {CGAL}"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"175--178"
-, url =	"https://hal.inria.fr/inria-00167199"
-, update =	"00.03 bibrelex+devillers, 99.07 bibrelex"
+, author =      "Monique Teillaud"
+, title =       "Three Dimensional Triangulations in {CGAL}"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "175--178"
+, url = "https://inria.hal.science/inria-00167199"
+, update =      "00.03 bibrelex+devillers, 99.07 bibrelex"
 }
 
 @techreport{t-tdrac-92
-, author =	"Monique Teillaud"
-, title =	"Towards dynamic randomized algorithms in computational geometry"
-, type =	"Research {Report}"
-, number =	1727
-, institution =	"INRIA"
-, address =	"BP93, 06902 Sophia-Antipolis, France"
-, year =	1992
-, note =	"English version of a French thesis"
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1727"
-, succeeds =	"t-vdard-91"
-, precedes =	"t-tdrac-93"
-, update =	"99.07 devillers, 98.07 bibrelex, 95.09 devillers, 95.01 devillers, 94.05 devillers, 93.05 devillers"
+, author =      "Monique Teillaud"
+, title =       "Towards dynamic randomized algorithms in computational geometry"
+, type =        "Research {Report}"
+, number =      1727
+, institution = "INRIA"
+, address =     "BP93, 06902 Sophia-Antipolis, France"
+, year =        1992
+, note =        "English version of a French thesis"
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1727"
+, succeeds =    "t-vdard-91"
+, precedes =    "t-tdrac-93"
+, update =      "99.07 devillers, 98.07 bibrelex, 95.09 devillers, 95.01 devillers, 94.05 devillers, 93.05 devillers"
 }
 
 @book{t-tdrac-93
-, author =	"Monique Teillaud"
-, title =	"Towards dynamic randomized algorithms in computational geometry"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	758
-, publisher =	"Springer-Verlag"
-, year =	1993
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1727"
-, succeeds =	"t-tdrac-92"
-, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
+, author =      "Monique Teillaud"
+, title =       "Towards dynamic randomized algorithms in computational geometry"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      758
+, publisher =   "Springer-Verlag"
+, year =        1993
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1727"
+, succeeds =    "t-tdrac-92"
+, update =      "99.07 devillers, 95.09 devillers, 95.01 devillers, 94.05 devillers"
 }
 
 @inproceedings{t-usodt-95
-, author =	"Monique Teillaud"
-, title =	"Union and Split Operations on Dynamic Trapezoidal Maps"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"181--186"
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=2486"
-, precedes =	"t-usodt-00"
-, update =	"01.11 devillers, 96.01 devillers, 95.09 jones"
+, author =      "Monique Teillaud"
+, title =       "Union and Split Operations on Dynamic Trapezoidal Maps"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "181--186"
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=2486"
+, precedes =    "t-usodt-00"
+, update =      "01.11 devillers, 96.01 devillers, 95.09 jones"
 }
 
 @article{t-usodt-00
-, author =	"M. Teillaud"
-, title =	"Union and split operations on dynamic trapezoidal maps"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	17
-, year =	2000
-, pages =	"153--163"
-, succeeds =	"t-usodt-95"
-, update =	"01.11 devillers, 01.04 smid"
+, author =      "M. Teillaud"
+, title =       "Union and split operations on dynamic trapezoidal maps"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      17
+, year =        2000
+, pages =       "153--163"
+, succeeds =    "t-usodt-95"
+, update =      "01.11 devillers, 01.04 smid"
 }
 
 @phdthesis{t-vdard-91
-, author =	"Monique Teillaud"
-, title =	"Vers des algorithmes randomis{\'e}s dynamiques en g{\'e}om{\'e}trie algorithmique"
-, type =	"Th{\`e}se de Doctorat en Sciences"
-, school =	"Uni\-ver\-sit{\'e} Paris-Sud"
-, address =	"Orsay, France"
-, year =	1991
-, url =	"http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1727"
-, keywords =	"doctoral thesis"
-, precedes =	"t-tdrac-92"
-, update =	"99.07 devillers, 95.09 devillers, 95.01 devillers, 93.05 devillers"
+, author =      "Monique Teillaud"
+, title =       "Vers des algorithmes randomis{\'e}s dynamiques en g{\'e}om{\'e}trie algorithmique"
+, type =        "Th{\`e}se de Doctorat en Sciences"
+, school =      "Uni\-ver\-sit{\'e} Paris-Sud"
+, address =     "Orsay, France"
+, year =        1991
+, url = "http://www.inria.fr/cgi-bin/wais_ra_sophia?question=1727"
+, keywords =    "doctoral thesis"
+, precedes =    "t-tdrac-92"
+, update =      "99.07 devillers, 95.09 devillers, 95.01 devillers, 93.05 devillers"
 }
 
 @article{t-ta-90
-, author =	"G. Tel"
-, title =	"Total algorithms"
-, journal =	"Algorithms Rev."
-, volume =	1
-, number =	1
-, year =	1990
-, pages =	"13--42"
-, keywords =	"distributed algorithms, design methods, broadcast, mutual exclusion, election, termination detection"
+, author =      "G. Tel"
+, title =       "Total algorithms"
+, journal =     "Algorithms Rev."
+, volume =      1
+, number =      1
+, year =        1990
+, pages =       "13--42"
+, keywords =    "distributed algorithms, design methods, broadcast, mutual exclusion, election, termination detection"
 }
 
 @inproceedings{th-gvaic-93
-, author =	"S. Teller and P. Hanrahan"
-, title =	"Global visibility algorithms for illumination computations"
-, booktitle =	"Proc. SIGGRAPH '93"
-, year =	1993
-, pages =	"239--246"
-, keywords =	"visibility"
-, update =	"94.09 orourke"
+, author =      "S. Teller and P. Hanrahan"
+, title =       "Global visibility algorithms for illumination computations"
+, booktitle =   "Proc. SIGGRAPH '93"
+, year =        1993
+, pages =       "239--246"
+, keywords =    "visibility"
+, update =      "94.09 orourke"
 }
 
 @inproceedings{t-mgad-93
-, author =	"S. J. Teller"
-, title =	"A Methodology for Geometric Algorithm Development"
-, booktitle =	"Communicating with Virtual Worlds"
-, nickname =	"CGI '93"
-, publisher =	"Springer-Verlag"
-, address =	"Lausanne, Switzerland"
-, month =	jun
-, year =	1993
-, pages =	"306--317"
-, update =	"98.07 bibrelex, 93.09 held"
+, author =      "S. J. Teller"
+, title =       "A Methodology for Geometric Algorithm Development"
+, booktitle =   "Communicating with Virtual Worlds"
+, nickname =    "CGI '93"
+, publisher =   "Springer-Verlag"
+, address =     "Lausanne, Switzerland"
+, month =       jun
+, year =        1993
+, pages =       "306--317"
+, update =      "98.07 bibrelex, 93.09 held"
 }
 
 @article{t-caals-92
-, author =	"S. J. Teller"
-, title =	"Computing the antipenumbra of an area light source"
-, journal =	"Comput. Graph."
-, volume =	26
-, number =	4
-, month =	jul
-, year =	1992
-, pages =	"139--148"
-, note =	"Proc. SIGGRAPH '92"
+, author =      "S. J. Teller"
+, title =       "Computing the antipenumbra of an area light source"
+, journal =     "Comput. Graph."
+, volume =      26
+, number =      4
+, month =       jul
+, year =        1992
+, pages =       "139--148"
+, note =        "Proc. SIGGRAPH '92"
 }
 
 @phdthesis{t-vcdop-92
-, author =	"S. J. Teller"
-, title =	"Visibility Computations in Densely Occluded Polyhedral Environments"
-, school =	"Dept. of Computer Science, University of California"
-, address =	"Berkeley"
-, year =	1992
-, keywords =	"graphics, visibility preprocessing, linear programming, spatial decomposition, visibility graphs, Plucker coordinates"
-, update =	"95.09 mitchell"
+, author =      "S. J. Teller"
+, title =       "Visibility Computations in Densely Occluded Polyhedral Environments"
+, school =      "Dept. of Computer Science, University of California"
+, address =     "Berkeley"
+, year =        1992
+, keywords =    "graphics, visibility preprocessing, linear programming, spatial decomposition, visibility graphs, Plucker coordinates"
+, update =      "95.09 mitchell"
 }
 
 @inproceedings{t-vfapv-93
-, author =	"S. J. Teller"
-, title =	"Visualizing {Fortune's} algorithm for planar {Voronoi} diagrams"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	393
-, keywords =	"video review"
-, cites =	"d-slsv-34, f-savd-87, ps-cgi-85, ZZZ"
-, update =	"98.03 bibrelex, 93.09 jones"
+, author =      "S. J. Teller"
+, title =       "Visualizing {Fortune's} algorithm for planar {Voronoi} diagrams"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       393
+, keywords =    "video review"
+, cites =       "d-slsv-34, f-savd-87, ps-cgi-85, ZZZ"
+, update =      "98.03 bibrelex, 93.09 jones"
 }
 
 @article{ts-vpiw-91
-, author =	"S. J. Teller and C. H. S{\'e}quin"
-, title =	"Visibility Preprocessing For Interactive Walkthroughs"
-, journal =	"Comput. Graph."
-, volume =	25
-, number =	4
-, month =	jul
-, year =	1991
-, pages =	"61--69"
-, note =	"Proc. SIGGRAPH '91"
-, update =	"93.09 milone+mitchell"
+, author =      "S. J. Teller and C. H. S{\'e}quin"
+, title =       "Visibility Preprocessing For Interactive Walkthroughs"
+, journal =     "Comput. Graph."
+, volume =      25
+, number =      4
+, month =       jul
+, year =        1991
+, pages =       "61--69"
+, note =        "Proc. SIGGRAPH '91"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{t-cagg-98
-, author =	"Shang-Hua Teng"
-, title =	"Combinatorial aspects of geometric graphs"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	9
-, year =	1998
-, pages =	"277--287"
-, update =	"98.11 devillers"
+, author =      "Shang-Hua Teng"
+, title =       "Combinatorial aspects of geometric graphs"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      9
+, year =        1998
+, pages =       "277--287"
+, update =      "98.11 devillers"
 }
 
 @phdthesis{t-pssug-90
-, author =	"S.-H. Teng"
-, title =	"Points, Spheres, and Separators: a unified geometric approach to graph partitioning"
-, school =	"School of Computer Science, Carnegie-Mellon University"
-, year =	1990
-, note =	"Report CMU-CS-91-184"
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "S.-H. Teng"
+, title =       "Points, Spheres, and Separators: a unified geometric approach to graph partitioning"
+, school =      "School of Computer Science, Carnegie-Mellon University"
+, year =        1990
+, note =        "Report CMU-CS-91-184"
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @article{tmpd-pavpt-97
-, author =	"Y. Teng and D. Mount and E. Puppo and L. Davis"
-, title =	"Parallelizing an algorithm for visibility on polyhedral terrain"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"75--84"
-, update =	"99.11 bibrelex, 97.07 devillers"
+, author =      "Y. Teng and D. Mount and E. Puppo and L. Davis"
+, title =       "Parallelizing an algorithm for visibility on polyhedral terrain"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "75--84"
+, update =      "99.11 bibrelex, 97.07 devillers"
 }
 
 @phdthesis{t-ppgsv-93
-, author =	"Y. Ansel Teng"
-, title =	"Parallel Processing of Geometric Structures: Visibility and Triangulation Algorithms"
-, school =	"University of Maryland"
-, address =	"College Park"
-, year =	1993
-, note =	"Also published as Center for Automation Research technical report CAR-TR-680"
-, keywords =	"doctoral thesis"
-, update =	"94.01 teng"
+, author =      "Y. Ansel Teng"
+, title =       "Parallel Processing of Geometric Structures: Visibility and Triangulation Algorithms"
+, school =      "University of Maryland"
+, address =     "College Park"
+, year =        1993
+, note =        "Also published as Center for Automation Research technical report CAR-TR-680"
+, keywords =    "doctoral thesis"
+, update =      "94.01 teng"
 }
 
 @techreport{td-vadtm-92
-, author =	"Y. A. Teng and L. S. Davies"
-, title =	"Visibility Analysis on Digital Terrain Models and its Parallel Implementation"
-, number =	"CAR-TR-625"
-, institution =	"Center for Automation Research, University of Maryland"
-, year =	1992
-, update =	"96.09 kreveld"
+, author =      "Y. A. Teng and L. S. Davies"
+, title =       "Visibility Analysis on Digital Terrain Models and its Parallel Implementation"
+, number =      "CAR-TR-625"
+, institution = "Center for Automation Research, University of Maryland"
+, year =        1992
+, update =      "96.09 kreveld"
 }
 
 @techreport{tdd-stn-91
-, author =	"Y. Ansel Teng and D. {DeMenthon} and L. S. Davis"
-, title =	"Stealth terrain navigation"
-, number =	"CAR-TR-532"
-, institution =	"Center for Automation Research, University of Maryland"
-, month =	jan
-, year =	1991
+, author =      "Y. Ansel Teng and D. {DeMenthon} and L. S. Davis"
+, title =       "Stealth terrain navigation"
+, number =      "CAR-TR-532"
+, institution = "Center for Automation Research, University of Maryland"
+, month =       jan
+, year =        1991
 }
 
 @article{tdd-stn-93
-, author =	"Y. Ansel Teng and Daniel DeMenthon and Larry S. Davis"
-, title =	"Stealth terrain navigation"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	23
-, number =	1
-, year =	1993
-, pages =	"96--110"
-, succeeds =	"tdd-stn-91"
-, update =	"94.01 teng"
+, author =      "Y. Ansel Teng and Daniel DeMenthon and Larry S. Davis"
+, title =       "Stealth terrain navigation"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      23
+, number =      1
+, year =        1993
+, pages =       "96--110"
+, succeeds =    "tdd-stn-91"
+, update =      "94.01 teng"
 }
 
 @article{tsbp-dpatd-93
-, author =	"Y. A. Teng and F. Sullivan and I. Beichl and E. Puppo"
-, title =	"A data-parallel algorithm for three-dimensional {Delaunay} triangulation and its implementation"
-, journal =	"SuperComputing 93"
-, volume =	"??"
-, year =	1993
-, pages =	"112--121"
-, update =	"97.11 bibrelex"
+, author =      "Y. A. Teng and F. Sullivan and I. Beichl and E. Puppo"
+, title =       "A data-parallel algorithm for three-dimensional {Delaunay} triangulation and its implementation"
+, journal =     "SuperComputing 93"
+, volume =      "??"
+, year =        1993
+, pages =       "112--121"
+, update =      "97.11 bibrelex"
 }
 
 @article{tt-tubni-91
-, author =	"K. H. Teo and T. C. Tuan"
-, title =	"A tight upper bound for the number of intersections between two rectangular paths"
-, journal =	"BIT"
-, volume =	31
-, month =	nov
-, year =	1991
-, pages =	"598--606"
-, keywords =	"interference, intersection, rectangular path"
-, update =	"94.01 tuan"
+, author =      "K. H. Teo and T. C. Tuan"
+, title =       "A tight upper bound for the number of intersections between two rectangular paths"
+, journal =     "BIT"
+, volume =      31
+, month =       nov
+, year =        1991
+, pages =       "598--606"
+, keywords =    "interference, intersection, rectangular path"
+, update =      "94.01 tuan"
 }
 
 @article{tt-iubni-91
-, author =	"K. H. Teo and T. C. Tuan"
-, title =	"An improved upper bound on the number of intersections between two rectangular paths"
-, journal =	"Inform. Process. Lett."
-, volume =	37
-, number =	6
-, month =	mar
-, year =	1991
-, pages =	"305--309"
-, keywords =	"interference, intersection, rectangular path"
-, update =	"94.01 tuan"
+, author =      "K. H. Teo and T. C. Tuan"
+, title =       "An improved upper bound on the number of intersections between two rectangular paths"
+, journal =     "Inform. Process. Lett."
+, volume =      37
+, number =      6
+, month =       mar
+, year =        1991
+, pages =       "305--309"
+, keywords =    "interference, intersection, rectangular path"
+, update =      "94.01 tuan"
 }
 
 @techreport{t-fanhp-80
-, author =	"R. Terada"
-, title =	"Fast algorithms for {NP}-hard problems which are optimal or near-optimal with probability one"
-, type =	"Report"
-, number =	"RT-MAP-8003"
-, institution =	"Dept. Matema{\'a}tica Aplicada, Univ. Sao Paulo"
-, address =	"Sao Paulo, Brazil"
-, year =	1980
+, author =      "R. Terada"
+, title =       "Fast algorithms for {NP}-hard problems which are optimal or near-optimal with probability one"
+, type =        "Report"
+, number =      "RT-MAP-8003"
+, institution = "Dept. Matema{\'a}tica Aplicada, Univ. Sao Paulo"
+, address =     "Sao Paulo, Brazil"
+, year =        1980
 }
 
 @article{t-cccm-85
-, author =	"T. Terlaky"
-, title =	"A Convergent Criss-Cross Method"
-, journal =	"Math. Oper. and Stat. ser. Optimization"
-, volume =	16
-, year =	1985
-, pages =	"683--690"
-, update =	"97.11 bibrelex"
+, author =      "T. Terlaky"
+, title =       "A Convergent Criss-Cross Method"
+, journal =     "Math. Oper. and Stat. ser. Optimization"
+, volume =      16
+, year =        1985
+, pages =       "683--690"
+, update =      "97.11 bibrelex"
 }
 
 @article{t-fccmo-87
-, author =	"T. Terlaky"
-, title =	"A Finite Criss-Cross Method for Oriented Matroids"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	42
-, year =	1987
-, pages =	"319--327"
-, update =	"97.11 bibrelex"
+, author =      "T. Terlaky"
+, title =       "A Finite Criss-Cross Method for Oriented Matroids"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      42
+, year =        1987
+, pages =       "319--327"
+, update =      "97.11 bibrelex"
 }
 
 %%% What is Norwell's first initial?
 @incollection{twv-dmgbl-93
-, author =	"M. T. Terlien and C. J. Van Westen and T. W. Van Asch"
-, title =	"Deterministic modeling in GIS-based landslide hazard assessment"
-, editor =	"Norwell"
-, booktitle =	"Geographical Information Systemss in Accessing Natural Hazards"
-, publisher =	"Kluwer"
-, year =	1993
-, pages =	"57--78"
-, update =	"98.03 agarwal"
+, author =      "M. T. Terlien and C. J. Van Westen and T. W. Van Asch"
+, title =       "Deterministic modeling in GIS-based landslide hazard assessment"
+, editor =      "Norwell"
+, booktitle =   "Geographical Information Systemss in Accessing Natural Hazards"
+, publisher =   "Kluwer"
+, year =        1993
+, pages =       "57--78"
+, update =      "98.03 agarwal"
 }
 
 @article{t-brtgi-80
-, author =	"W. C. Thacker"
-, title =	"A Brief Review of Techniques for Generating Irregular Computational Grids"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	15
-, year =	1980
-, pages =	"1335--1341"
-, annote =	"Title says it all."
+, author =      "W. C. Thacker"
+, title =       "A Brief Review of Techniques for Generating Irregular Computational Grids"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      15
+, year =        1980
+, pages =       "1335--1341"
+, annote =      "Title says it all."
 }
 
 @article{t-ita-79
-, author =	"W. C. Thacker"
-, title =	"An Improved Triangulation Algorithm"
-, journal =	"Appl. Math. Modelling"
-, volume =	3
-, month =	dec
-, year =	1979
-, pages =	"471--472"
-, annote =	"Wants to use triangulation defined by joining two
-		 nodes if there is no shorter intersecting segment. This
-		 is the same as GT. Proposes $O(n^2)$ algorithm (which I
-		 don't think should work.)"
+, author =      "W. C. Thacker"
+, title =       "An Improved Triangulation Algorithm"
+, journal =     "Appl. Math. Modelling"
+, volume =      3
+, month =       dec
+, year =        1979
+, pages =       "471--472"
+, annote =      "Wants to use triangulation defined by joining two
+                 nodes if there is no shorter intersecting segment. This
+                 is the same as GT. Proposes $O(n^2)$ algorithm (which I
+                 don't think should work.)"
 }
 
 @inproceedings{t-mlpra1-50
-, author =	"H. Theil"
-, title =	"A rank-invariant method of linear and polynomial regression analysis I"
-, booktitle =	"Proc. Koninklijke Nederlandse Akademie van Wetenschappen"
-, volume =	53
-, year =	1950
-, pages =	"386--392"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "H. Theil"
+, title =       "A rank-invariant method of linear and polynomial regression analysis I"
+, booktitle =   "Proc. Koninklijke Nederlandse Akademie van Wetenschappen"
+, volume =      53
+, year =        1950
+, pages =       "386--392"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{t-mlpra2-50
-, author =	"H. Theil"
-, title =	"A rank-invariant method of linear and polynomial regression analysis II"
-, booktitle =	"Proc. Koninklijke Nederlandse Akademie van Wetenschappen"
-, volume =	53
-, year =	1990
-, pages =	"521--525"
-, update =	"98.11 bibrelex"
+, author =      "H. Theil"
+, title =       "A rank-invariant method of linear and polynomial regression analysis II"
+, booktitle =   "Proc. Koninklijke Nederlandse Akademie van Wetenschappen"
+, volume =      53
+, year =        1990
+, pages =       "521--525"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{t-mlpra3-50
-, author =	"H. Theil"
-, title =	"A rank-invariant method of linear and polynomial regression analysis III"
-, booktitle =	"Proc. Koninklijke Nederlandse Akademie van Wetenschappen"
-, volume =	53
-, year =	1990
-, pages =	"1397--1412"
-, update =	"98.11 bibrelex"
+, author =      "H. Theil"
+, title =       "A rank-invariant method of linear and polynomial regression analysis III"
+, booktitle =   "Proc. Koninklijke Nederlandse Akademie van Wetenschappen"
+, volume =      53
+, year =        1990
+, pages =       "1397--1412"
+, update =      "98.11 bibrelex"
 }
 
 @article{tn-sopub-87
-, author =	"W. C. Thibault and B. F. Naylor"
-, title =	"Set Operations on Polyhedra Using Binary Space Partitioning Trees"
-, journal =	"Comput. Graph."
-, volume =	21
-, number =	4
-, year =	1987
-, pages =	"153--162"
-, note =	"Proc. SIGGRAPH '87"
-, update =	"93.09 held"
+, author =      "W. C. Thibault and B. F. Naylor"
+, title =       "Set Operations on Polyhedra Using Binary Space Partitioning Trees"
+, journal =     "Comput. Graph."
+, volume =      21
+, number =      4
+, year =        1987
+, pages =       "153--162"
+, note =        "Proc. SIGGRAPH '87"
+, update =      "93.09 held"
 }
 
 @phdthesis{t-eapkg-96
-, author =	"C. Thiel"
-, title =	"Effiziente {Algorithmen} f{\"u}r {Probleme} der {Kollisionserkennung} und der geometrischen {Optimierung}"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Saarlandes"
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1996
-, keywords =	"doctoral thesis"
-, update =	"96.01 smid"
+, author =      "C. Thiel"
+, title =       "Effiziente {Algorithmen} f{\"u}r {Probleme} der {Kollisionserkennung} und der geometrischen {Optimierung}"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Saarlandes"
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1996
+, keywords =    "doctoral thesis"
+, update =      "96.01 smid"
 }
 
 @mastersthesis{t-ep-91
-, author =	"T. Thiele"
-, title =	"Extremalprobleme f{\"u}r {Punktemengen}"
-, type =	"Masters Thesis"
-, school =	"Fachbereich Mathematik, Freie Univ. Berlin"
-, address =	"Berlin, Germany"
-, year =	1991
-, keywords =	"masters thesis"
-, update =	"97.03 gaertner+salinger"
+, author =      "T. Thiele"
+, title =       "Extremalprobleme f{\"u}r {Punktemengen}"
+, type =        "Masters Thesis"
+, school =      "Fachbereich Mathematik, Freie Univ. Berlin"
+, address =     "Berlin, Germany"
+, year =        1991
+, keywords =    "masters thesis"
+, update =      "97.03 gaertner+salinger"
 }
 
 @mastersthesis{t-dnsga-86
-, author =	"G. Thiemt"
-, title =	"Die numerische {Stabilit{\"a}t} geometrischer {Algorithmen}"
-, school =	"Universit{\"a}t Karlsruhe"
-, address =	"Karlsruhe, Germany"
-, month =	oct
-, year =	1986
-, note =	"Diploma Thesis"
-, keywords =	"master thesis"
-, update =	"98.03 bibrelex"
+, author =      "G. Thiemt"
+, title =       "Die numerische {Stabilit{\"a}t} geometrischer {Algorithmen}"
+, school =      "Universit{\"a}t Karlsruhe"
+, address =     "Karlsruhe, Germany"
+, month =       oct
+, year =        1986
+, note =        "Diploma Thesis"
+, keywords =    "master thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{t-pala-11
-, author =	"A. H. Thiessen"
-, title =	"Precipitation Averages for Large Areas"
-, journal =	"Monthly Weather Review"
-, volume =	39
-, month =	jul
-, year =	1911
-, pages =	"1082--1084"
-, update =	"93.09 held"
+, author =      "A. H. Thiessen"
+, title =       "Precipitation Averages for Large Areas"
+, journal =     "Monthly Weather Review"
+, volume =      39
+, month =       jul
+, year =        1911
+, pages =       "1082--1084"
+, update =      "93.09 held"
 }
 
 @incollection{t-sldva-65
-, author =	"R. Thom"
-, title =	"Sur l'homologie des vari\'et\'es alg\'ebriques re\'elles"
-, editor =	"S. S. Cairns"
-, booktitle =	"Differential and Combinatorial Topology"
-, publisher =	"Princeton University Press"
-, address =	"Princeton, NJ"
-, year =	1965
-, pages =	"255--265"
-, update =	"99.07 smid, 98.07 agarwal, 95.01 matousek"
+, author =      "R. Thom"
+, title =       "Sur l'homologie des vari\'et\'es alg\'ebriques re\'elles"
+, editor =      "S. S. Cairns"
+, booktitle =   "Differential and Combinatorial Topology"
+, publisher =   "Princeton University Press"
+, address =     "Princeton, NJ"
+, year =        1965
+, pages =       "255--265"
+, update =      "99.07 smid, 98.07 agarwal, 95.01 matousek"
 }
 
 @article{tc-saeca-89
-, author =	"Samuel M. Thomas and Y. T. Chan"
-, title =	"A simple approach for the estimation of circular arc and its radius"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	45
-, year =	1989
-, pages =	"362--370"
-, update =	"98.11 bibrelex, 97.03 agarwal"
+, author =      "Samuel M. Thomas and Y. T. Chan"
+, title =       "A simple approach for the estimation of circular arc and its radius"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      45
+, year =        1989
+, pages =       "362--370"
+, update =      "98.11 bibrelex, 97.03 agarwal"
 }
 
 @article{t-tppg-83
-, author =	"C. Thomassen"
-, title =	"A theorem on paths in planar graphs"
-, journal =	"J. Graph Theory"
-, volume =	7
-, number =	2
-, year =	1983
-, pages =	"169--176"
-, update =	"98.11 bibrelex"
+, author =      "C. Thomassen"
+, title =       "A theorem on paths in planar graphs"
+, journal =     "J. Graph Theory"
+, volume =      7
+, number =      2
+, year =        1983
+, pages =       "169--176"
+, update =      "98.11 bibrelex"
 }
 
 @article{t-dpg-83
-, author =	"C. Thomassen"
-, title =	"Deformations of plane graphs"
-, journal =	"J. Combin. Theory"
-, volume =	"??"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "C. Thomassen"
+, title =       "Deformations of plane graphs"
+, journal =     "J. Combin. Theory"
+, volume =      "??"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{t-irpg-86
-, author =	"C. Thomassen"
-, title =	"Interval representation of planar graphs"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	40
-, year =	1986
-, pages =	"9--20"
-, keywords =	"graph drawing"
-, update =	"94.05 franciosa"
+, author =      "C. Thomassen"
+, title =       "Interval representation of planar graphs"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      40
+, year =        1986
+, pages =       "9--20"
+, keywords =    "graph drawing"
+, update =      "94.05 franciosa"
 }
 
 @article{t-paog-89
-, author =	"C. Thomassen"
-, title =	"Planar Acyclic Oriented Graphs"
-, journal =	"Order"
-, volume =	5
-, number =	4
-, year =	1989
-, pages =	"349--361"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "C. Thomassen"
+, title =       "Planar Acyclic Oriented Graphs"
+, journal =     "Order"
+, volume =      5
+, number =      4
+, year =        1989
+, pages =       "349--361"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{t-pihhg-76
-, author =	"C. Thomassen"
-, title =	"Planar and infinite hypohamiltonian and hypotraceable graphs"
-, journal =	"Discrete Math."
-, volume =	14
-, number =	4
-, month =	apr
-, year =	1976
-, pages =	"377--389"
-, update =	"98.11 bibrelex"
+, author =      "C. Thomassen"
+, title =       "Planar and infinite hypohamiltonian and hypotraceable graphs"
+, journal =     "Discrete Math."
+, volume =      14
+, number =      4
+, month =       apr
+, year =        1976
+, pages =       "377--389"
+, update =      "98.11 bibrelex"
 }
 
 @article{t-pdfip-80
-, author =	"C. Thomassen"
-, title =	"Planarity and Duality of Finite and Infinite Planar Graphs"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	29
-, number =	2
-, year =	1980
-, pages =	"244--271"
-, keywords =	"graph drawing"
-, update =	"98.07 tamassia, 93.09 tamassia"
+, author =      "C. Thomassen"
+, title =       "Planarity and Duality of Finite and Infinite Planar Graphs"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      29
+, number =      2
+, year =        1980
+, pages =       "244--271"
+, keywords =    "graph drawing"
+, update =      "98.07 tamassia, 93.09 tamassia"
 }
 
 @incollection{t-prg-84
-, author =	"C. Thomassen"
-, title =	"Plane Representations of Graphs"
-, editor =	"J. A. Bondy and U. S. R. Murty"
-, booktitle =	"Progress in Graph Theory"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1984
-, pages =	"43--69"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "C. Thomassen"
+, title =       "Plane Representations of Graphs"
+, editor =      "J. A. Bondy and U. S. R. Murty"
+, booktitle =   "Progress in Graph Theory"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1984
+, pages =       "43--69"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{t-rdg-88
-, author =	"C. Thomassen"
-, title =	"Rectilinear drawings of graphs"
-, journal =	"J. Graph Theory"
-, volume =	12
-, year =	1988
-, pages =	"335--341"
-, update =	"97.11 bibrelex"
+, author =      "C. Thomassen"
+, title =       "Rectilinear drawings of graphs"
+, journal =     "J. Graph Theory"
+, volume =      12
+, year =        1988
+, pages =       "335--341"
+, update =      "97.11 bibrelex"
 }
 
 @article{t-jstcs-92
-, author =	"C. Thomassen"
-, title =	"The Jordan-Sch{\"o}nflies Theorem and the Classification of Surfaces"
-, journal =	"Amer. Math. Monthly"
-, volume =	99
-, year =	1992
-, pages =	"116--130"
-, update =	"95.09 devillers"
+, author =      "C. Thomassen"
+, title =       "The Jordan-Sch{\"o}nflies Theorem and the Classification of Surfaces"
+, journal =     "Amer. Math. Monthly"
+, volume =      99
+, year =        1992
+, pages =       "116--130"
+, update =      "95.09 devillers"
 }
 
 @inproceedings{tac-rsmw-92
-, author =	"C. D. Thomborson and B. Alpern and L. Carter"
-, title =	"Rectilinear {Steiner} tree minimzation on a workstation"
-, booktitle =	"Proc. of the DIMACS Workshop on Comput. Support for Discr. Math."
-, year =	1992
-, update =	"98.11 bibrelex"
+, author =      "C. D. Thomborson and B. Alpern and L. Carter"
+, title =       "Rectilinear {Steiner} tree minimzation on a workstation"
+, booktitle =   "Proc. of the DIMACS Workshop on Comput. Support for Discr. Math."
+, year =        1992
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{tds-crsmt-87
-, author =	"C. D. Thomborson and L. L. Deneen and G. M. Shute"
-, title =	"Computing a Rectilinear {Steiner} Minimal Tree in $n^{O(\sqrt{n})}$ Time"
-, editor =	"A. Albrecht and H. Jung and K. Mehlhorn"
-, booktitle =	"Parallel Algorithms and Architectures"
-, publisher =	"Akademie-Verlag Berlin"
-, month =	may
-, year =	1987
-, pages =	"176--83"
-, update =	"93.09 held"
+, author =      "C. D. Thomborson and L. L. Deneen and G. M. Shute"
+, title =       "Computing a Rectilinear {Steiner} Minimal Tree in $n^{O(\sqrt{n})}$ Time"
+, editor =      "A. Albrecht and H. Jung and K. Mehlhorn"
+, booktitle =   "Parallel Algorithms and Architectures"
+, publisher =   "Akademie-Verlag Berlin"
+, month =       may
+, year =        1987
+, pages =       "176--83"
+, update =      "93.09 held"
 }
 
 @inproceedings{t-atcv-79
-, author =	"C. D. Thompson"
-, title =	"Area-time complexity for {VLSI}"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
-, year =	1979
-, pages =	"81--88"
-, precedes =	"t-ftv-83"
+, author =      "C. D. Thompson"
+, title =       "Area-time complexity for {VLSI}"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Theory Comput."
+, year =        1979
+, pages =       "81--88"
+, precedes =    "t-ftv-83"
 }
 
 @article{t-ftv-83
-, author =	"C. D. Thompson"
-, title =	"Fourier transforms in {VLSI}"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-32"
-, year =	1983
-, pages =	"1047--1057"
-, succeeds =	"t-atcv-79"
-, precedes =	"t-vcs-83"
-, annote =	"Model and upper bounds only"
+, author =      "C. D. Thompson"
+, title =       "Fourier transforms in {VLSI}"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-32"
+, year =        1983
+, pages =       "1047--1057"
+, succeeds =    "t-atcv-79"
+, precedes =    "t-vcs-83"
+, annote =      "Model and upper bounds only"
 }
 
 @article{t-vcs-83
-, author =	"C. D. Thompson"
-, title =	"The {VLSI} complexity of sorting"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-32"
-, year =	1983
-, pages =	"1171--1184"
-, succeeds =	"t-ftv-83"
-, annote =	"Model and upper bounds only"
+, author =      "C. D. Thompson"
+, title =       "The {VLSI} complexity of sorting"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-32"
+, year =        1983
+, pages =       "1171--1184"
+, succeeds =    "t-ftv-83"
+, annote =      "Model and upper bounds only"
 }
 
 @article{tk-smcpc-77
-, author =	"C. D. Thompson and H. T. Kung"
-, title =	"Sorting on a mesh-connected parallel computer"
-, journal =	"Commun. ACM"
-, volume =	20
-, year =	1977
-, pages =	"263--271"
-, update =	"97.11 bibrelex"
+, author =      "C. D. Thompson and H. T. Kung"
+, title =       "Sorting on a mesh-connected parallel computer"
+, journal =     "Commun. ACM"
+, volume =      20
+, year =        1977
+, pages =       "263--271"
+, update =      "97.11 bibrelex"
 }
 
 @book{twm-ngg-85
-, author =	"Joe F. Thompson and Z. U. A. Warsi and C. Wayne Mastin"
-, title =	"Numerical Grid Generation"
-, publisher =	"Elsevier Science Publishing Co., Inc."
-, address =	"New York, New York"
-, year =	1985
-, update =	"98.11 bibrelex"
+, author =      "Joe F. Thompson and Z. U. A. Warsi and C. Wayne Mastin"
+, title =       "Numerical Grid Generation"
+, publisher =   "Elsevier Science Publishing Co., Inc."
+, address =     "New York, New York"
+, year =        1985
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{tpbhss-mbldo-90
-, author =	"W. Thompson and H. Pick and B. Bennett and M. Heinrichs and S. Savitt an K. Smith"
-, title =	"Map-based localization: the 'drop-off' problem"
-, booktitle =	"Proc. DARPA Image Understanding Workshop"
-, year =	1990
-, pages =	"706--719"
-, update =	"97.11 bibrelex"
+, author =      "W. Thompson and H. Pick and B. Bennett and M. Heinrichs and S. Savitt an K. Smith"
+, title =       "Map-based localization: the 'drop-off' problem"
+, booktitle =   "Proc. DARPA Image Understanding Workshop"
+, year =        1990
+, pages =       "706--719"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{t-fvnrr-84
-, author =	"C. E. Thorpe"
-, title =	"FIDO: {Vision} and Navigation for a Robot Rover"
-, type =	"Ph.{D}. Thesis"
-, school =	"Department of Computer Science, Carnegie-Mellon University"
-, year =	1984
-, note =	"CMU-CS-84-168"
-, keywords =	"doctoral thesis"
-, update =	"93.09 milone+mitchell"
+, author =      "C. E. Thorpe"
+, title =       "FIDO: {Vision} and Navigation for a Robot Rover"
+, type =        "Ph.{D}. Thesis"
+, school =      "Department of Computer Science, Carnegie-Mellon University"
+, year =        1984
+, note =        "CMU-CS-84-168"
+, keywords =    "doctoral thesis"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{t-prppm-84
-, author =	"C. E. Thorpe"
-, title =	"Path Relaxation: {Path} Planning for a Mobile Robot"
-, booktitle =	"Proc. AAAI National Conference on Artificial Intelligence"
-, year =	1984
-, pages =	"318--321"
-, update =	"93.09 milone+mitchell"
+, author =      "C. E. Thorpe"
+, title =       "Path Relaxation: {Path} Planning for a Mobile Robot"
+, booktitle =   "Proc. AAAI National Conference on Artificial Intelligence"
+, year =        1984
+, pages =       "318--321"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{t-usssp-97
-, author =	"Mikkel Thorup"
-, title =	"Undirected Single Source Shortest Path in Linear Time"
-, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '97"
-, year =	1997
-, pages =	"To appear"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Mikkel Thorup"
+, title =       "Undirected Single Source Shortest Path in Linear Time"
+, booktitle =   "Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '97"
+, year =        1997
+, pages =       "To appear"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @misc{t-hdp-93
-, author =	"W. Thurston"
-, title =	"Hexahedral decomposition of polyhedra"
-, month =	oct
-, year =	1993
-, url =	"https://www.ics.uci.edu/~eppstein/gina/Thurston-hexahedra"
-, update =	"97.11 bibrelex"
+, author =      "W. Thurston"
+, title =       "Hexahedral decomposition of polyhedra"
+, month =       oct
+, year =        1993
+, url = "https://www.ics.uci.edu/~eppstein/gina/Thurston-hexahedra"
+, update =      "97.11 bibrelex"
 }
 
 @book{t-tdgt1-97
-, author =	"William Thurston"
-, title =	"Three-Dimensional Geometry and Topology, Volume 1"
-, publisher =	"Princeton University Press"
-, address =	"New Jersey"
-, year =	1997
-, update =	"00.11 smid, 00.07 icking, 99.07 orourke"
+, author =      "William Thurston"
+, title =       "Three-Dimensional Geometry and Topology, Volume 1"
+, publisher =   "Princeton University Press"
+, address =     "New Jersey"
+, year =        1997
+, update =      "00.11 smid, 00.07 icking, 99.07 orourke"
 }
 
 @techreport{t-gt3m-88
-, author =	"W. P. Thurston"
-, title =	"The geometry and topology of 3-manifolds"
-, type =	"Note"
-, institution =	"Princeton University"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "W. P. Thurston"
+, title =       "The geometry and topology of 3-manifolds"
+, type =        "Note"
+, institution = "Princeton University"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @techreport{t-gcvdm-86
-, author =	"W. P. Thurston"
-, title =	"The geometry of circles: {Voronoi} diagrams, {Moebius} transformations, convex hulls, {Fortune}'s algorithm, the cut locus, and parametrization of shapes"
-, institution =	"Princeton University"
-, year =	1986
-, update =	"00.03 bibrelex"
+, author =      "W. P. Thurston"
+, title =       "The geometry of circles: {Voronoi} diagrams, {Moebius} transformations, convex hulls, {Fortune}'s algorithm, the cut locus, and parametrization of shapes"
+, institution = "Princeton University"
+, year =        1986
+, update =      "00.03 bibrelex"
 }
 
 @article{t-tdmkg-82
-, author =	"W. P. Thurston"
-, title =	"Three dimensional manifolds, {Kleinian} groups, and hyperbolic geometry"
-, journal =	"Bull. Amer. Math. Soc."
-, volume =	6
-, number =	3
-, year =	1982
-, pages =	"357--381"
+, author =      "W. P. Thurston"
+, title =       "Three dimensional manifolds, {Kleinian} groups, and hyperbolic geometry"
+, journal =     "Bull. Amer. Math. Soc."
+, volume =      6
+, number =      3
+, year =        1982
+, pages =       "357--381"
 }
 
 @inproceedings{tn-kbedg-87
-, author =	"W. F. Tichy and F. J. Newbery"
-, title =	"Knowledge-based Editors for Directed Graphs"
-, editor =	"H. K. Nichols and D. Simpson"
-, booktitle =	"Proc. 1st European Software Engineering Conference"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1987
-, pages =	"109--117"
-, keywords =	"graph drawing"
-, update =	"96.09 agarwal, 93.09 tamassia"
+, author =      "W. F. Tichy and F. J. Newbery"
+, title =       "Knowledge-based Editors for Directed Graphs"
+, editor =      "H. K. Nichols and D. Simpson"
+, booktitle =   "Proc. 1st European Software Engineering Conference"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1987
+, pages =       "109--117"
+, keywords =    "graph drawing"
+, update =      "96.09 agarwal, 93.09 tamassia"
 }
 
 % P. J. W. ten Hagen, editor, Elsevier North-Holland, 1983
 @article{tmt-gdgdm-83
-, author =	"M. Tikkanen and M. J. M{\"a}ntyl{\"a} and M. Tamminen"
-, title =	"{GWB}/{DMS}: {A} Geometric Data Manager"
-, journal =	"Proc. Eurographics '83"
-, volume =	"??"
-, year =	1983
-, pages =	"99--112"
-, update =	"97.07 forrest, 94.05 devillers"
+, author =      "M. Tikkanen and M. J. M{\"a}ntyl{\"a} and M. Tamminen"
+, title =       "{GWB}/{DMS}: {A} Geometric Data Manager"
+, journal =     "Proc. Eurographics '83"
+, volume =      "??"
+, year =        1983
+, pages =       "99--112"
+, update =      "97.07 forrest, 94.05 devillers"
 }
 
 @article{t-aciho-88
-, author =	"V. S. Tikunov"
-, title =	"Anamorphated cartographic images: historical outline and construction technique"
-, journal =	"Cartography (Austral.)"
-, volume =	17
-, year =	1988
-, pages =	"1--8"
-, update =	"98.03 bibrelex"
+, author =      "V. S. Tikunov"
+, title =       "Anamorphated cartographic images: historical outline and construction technique"
+, journal =     "Cartography (Austral.)"
+, volume =      17
+, year =        1988
+, pages =       "1--8"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{t-tda-81
-, author =	"J. S. Tilford"
-, title =	"Tree Drawing Algorithms"
-, number =	"UIUCDCS-R-81-1055"
-, institution =	"Department of Computer Science, University of Illinois at Urbana-Champaign"
-, year =	1981
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. S. Tilford"
+, title =       "Tree Drawing Algorithms"
+, number =      "UIUCDCS-R-81-1055"
+, institution = "Department of Computer Science, University of Illinois at Urbana-Champaign"
+, year =        1981
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{th-otdp-84
-, author =	"W. Tiller and E. Hanson"
-, title =	"Offsets of Two Dimensional Profiles"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	4
-, number =	9
-, month =	sep
-, year =	1984
-, pages =	"36--46"
-, update =	"93.09 held"
+, author =      "W. Tiller and E. Hanson"
+, title =       "Offsets of Two Dimensional Profiles"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      4
+, number =      9
+, month =       sep
+, year =        1984
+, pages =       "36--46"
+, update =      "93.09 held"
 }
 
 @article{t-nodac-84
-, author =	"R. B. Tilove"
-, title =	"A null-object detection algorithm for constructive solid geometry"
-, journal =	"Commun. ACM"
-, volume =	27
-, year =	1984
-, pages =	"684--694"
+, author =      "R. B. Tilove"
+, title =       "A null-object detection algorithm for constructive solid geometry"
+, journal =     "Commun. ACM"
+, volume =      27
+, year =        1984
+, pages =       "684--694"
 }
 
 @techreport{t-sgsmc-80
-, author =	"R. B. Tilove"
-, title =	"A study of geometric set-membership classification"
-, type =	"Report"
-, number =	"TM-30"
-, institution =	"Production Automat. Project, Univ. Rochester"
-, address =	"Rochester, NY"
-, year =	1980
+, author =      "R. B. Tilove"
+, title =       "A study of geometric set-membership classification"
+, type =        "Report"
+, number =      "TM-30"
+, institution = "Production Automat. Project, Univ. Rochester"
+, address =     "Rochester, NY"
+, year =        1980
 }
 
 @techreport{t-lpccs-80
-, author =	"R. B. Tilove"
-, title =	"Line/polygon classification: a case study of the complexity of geometric computation"
-, type =	"Report"
-, number =	"TM-37"
-, institution =	"Production Automat. Project, Univ. Rochester"
-, address =	"Rochester, NY"
-, year =	1980
+, author =      "R. B. Tilove"
+, title =       "Line/polygon classification: a case study of the complexity of geometric computation"
+, type =        "Report"
+, number =      "TM-37"
+, institution = "Production Automat. Project, Univ. Rochester"
+, address =     "Rochester, NY"
+, year =        1980
 }
 
 @article{t-smcua-80
-, author =	"R. B. Tilove"
-, title =	"Set membership classification: a unified approach to geometric intersection problems"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-29"
-, year =	1980
-, pages =	"874--883"
+, author =      "R. B. Tilove"
+, title =       "Set membership classification: a unified approach to geometric intersection problems"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-29"
+, year =        1980
+, pages =       "874--883"
 }
 
 @article{tr-cboge-80
-, author =	"R. B. Tilove and A. A. G. Requicha"
-, title =	"Closure of boolean operations on geometric entities"
-, journal =	"Comput. Aided Design"
-, volume =	12
-, year =	1980
-, pages =	"219--220"
+, author =      "R. B. Tilove and A. A. G. Requicha"
+, title =       "Closure of boolean operations on geometric entities"
+, journal =     "Comput. Aided Design"
+, volume =      12
+, year =        1980
+, pages =       "219--220"
 }
 
 @article{ts-cggps-80
-, author =	"?? Timmer and ?? Stern"
-, title =	"Computation of global geometric properties of solid objects"
-, journal =	"Comput. Aided Design"
-, volume =	12
-, year =	1980
-, pages =	"301--304"
-, update =	"98.07 bibrelex"
+, author =      "?? Timmer and ?? Stern"
+, title =       "Computation of global geometric properties of solid objects"
+, journal =     "Comput. Aided Design"
+, volume =      12
+, year =        1980
+, pages =       "301--304"
+, update =      "98.07 bibrelex"
 }
 
 @article{t-fpcpv-91
-, author =	"John C. Tipper"
-, title =	"{FORTRAN} Programs To Construct The Planar {Voronoi} Diagram"
-, journal =	"Comput. Geosci."
-, volume =	17
-, number =	5
-, year =	1991
-, pages =	"597--632"
-, keywords =	"Voronoi diagrams, Delaunay triangulation, spatial data structures"
-, annote =	"Incremental flip algorithm. Points are sorted so that
-		 they are outside CH. Triangulates inside polygon by
-		 slicing it up into convex pieces, triangulating, then
-		 gluing it back together and flipping."
-, abstract =	"The Voronoi diagram and its geometric dual, the
-		 Delaunay triangulation, both have been applied
-		 extensively in spatial modeling and analysis. This
-		 paper gives two FORTRAN programs which use a new
-		 algorithm that creates the Voronoi diagram and Delaunay
-		 triangulation rapidly and efficiently for large data
-		 sets (N greater than 1000). The first program applies
-		 to the special situation of data points lying either in
-		 an open domain or in a simply connected closed domain
-		 bounded by their convex hull: under certain conditions
-		 the running time of this program is linear in the
-		 number of data points. The second program applies to
-		 the general situation of data points lying in a domain
-		 that may be open or closed, simply or multiply
-		 connected, and have convex or reentrant boundaries. A
-		 GKS-based plotting program to give graphic output also
-		 is provided. (Author abstract) 24 Refs."
+, author =      "John C. Tipper"
+, title =       "{FORTRAN} Programs To Construct The Planar {Voronoi} Diagram"
+, journal =     "Comput. Geosci."
+, volume =      17
+, number =      5
+, year =        1991
+, pages =       "597--632"
+, keywords =    "Voronoi diagrams, Delaunay triangulation, spatial data structures"
+, annote =      "Incremental flip algorithm. Points are sorted so that
+                 they are outside CH. Triangulates inside polygon by
+                 slicing it up into convex pieces, triangulating, then
+                 gluing it back together and flipping."
+, abstract =    "The Voronoi diagram and its geometric dual, the
+                 Delaunay triangulation, both have been applied
+                 extensively in spatial modeling and analysis. This
+                 paper gives two FORTRAN programs which use a new
+                 algorithm that creates the Voronoi diagram and Delaunay
+                 triangulation rapidly and efficiently for large data
+                 sets (N greater than 1000). The first program applies
+                 to the special situation of data points lying either in
+                 an open domain or in a simply connected closed domain
+                 bounded by their convex hull: under certain conditions
+                 the running time of this program is linear in the
+                 number of data points. The second program applies to
+                 the general situation of data points lying in a domain
+                 that may be open or closed, simply or multiply
+                 connected, and have convex or reentrant boundaries. A
+                 GKS-based plotting program to give graphic output also
+                 is provided. (Author abstract) 24 Refs."
 }
 
 @article{t-siapv-90
-, author =	"John C. Tipper"
-, title =	"Straightforward Iterative Algorithm For The Planar {Voronoi} Diagram"
-, journal =	"Inform. Process. Lett."
-, volume =	34
-, number =	3
-, month =	apr
-, year =	1990
-, pages =	"155--160"
-, keywords =	"spatial data structures, triangulation, Voronoi diagrams, iterative algorithms, Delaunay triangulation"
-, annote =	"Your basic incremental algorithm. Points are sorted by
-		 X coordinate."
-, abstract =	"Several published algorithms construct the planar
-		 N-point Voronoi diagram by adding the points in turn to
-		 a digram already constructed for a subset of those
-		 points. The algorithm described here works in this way,
-		 but stipulates that every added point be outside the
-		 convex hull of the already constructed partial diagram.
-		 This stipulation, which is implemented by presorting
-		 the points by increasing x-coordinate, ensures that the
-		 core of the algorithm runs in almost linear time. The
-		 algorithm is inherently iterative, not recursive, and
-		 provides a rapid, efficient way to construct the
-		 Voronoi diagram for large data sets. (Author abstract)
-		 16 Refs."
+, author =      "John C. Tipper"
+, title =       "Straightforward Iterative Algorithm For The Planar {Voronoi} Diagram"
+, journal =     "Inform. Process. Lett."
+, volume =      34
+, number =      3
+, month =       apr
+, year =        1990
+, pages =       "155--160"
+, keywords =    "spatial data structures, triangulation, Voronoi diagrams, iterative algorithms, Delaunay triangulation"
+, annote =      "Your basic incremental algorithm. Points are sorted by
+                 X coordinate."
+, abstract =    "Several published algorithms construct the planar
+                 N-point Voronoi diagram by adding the points in turn to
+                 a digram already constructed for a subset of those
+                 points. The algorithm described here works in this way,
+                 but stipulates that every added point be outside the
+                 convex hull of the already constructed partial diagram.
+                 This stipulation, which is implemented by presorting
+                 the points by increasing x-coordinate, ensures that the
+                 core of the algorithm runs in almost linear time. The
+                 algorithm is inherently iterative, not recursive, and
+                 provides a rapid, efficient way to construct the
+                 Voronoi diagram for large data sets. (Author abstract)
+                 16 Refs."
 }
 
 @article{t-odsga-75
-, author =	"D. M. Titterington"
-, title =	"Optimal design: some geometrical aspects of {D}-optimality"
-, journal =	"Biometrika"
-, volume =	62
-, number =	2
-, year =	1975
-, pages =	"313--320"
-, update =	"98.07 bibrelex"
+, author =      "D. M. Titterington"
+, title =       "Optimal design: some geometrical aspects of {D}-optimality"
+, journal =     "Biometrika"
+, volume =      62
+, number =      2
+, year =        1975
+, pages =       "313--320"
+, update =      "98.07 bibrelex"
 }
 
 @article{t-ctud-73
-, author =	"W. R. Tobler"
-, title =	"A continous transformation useful for districting"
-, journal =	"Ann. New York Acad. Sci."
-, volume =	219
-, year =	1973
-, pages =	"215--220"
-, update =	"98.03 bibrelex"
+, author =      "W. R. Tobler"
+, title =       "A continous transformation useful for districting"
+, journal =     "Ann. New York Acad. Sci."
+, volume =      219
+, year =        1973
+, pages =       "215--220"
+, update =      "98.03 bibrelex"
 }
 
 @article{t-lqpom-85
-, author =	"M. Todd"
-, title =	"Linear and Quadratic Programming in Oriented Matroids"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	39
-, year =	1985
-, pages =	"105--133"
-, update =	"97.11 bibrelex"
+, author =      "M. Todd"
+, title =       "Linear and Quadratic Programming in Oriented Matroids"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      39
+, year =        1985
+, pages =       "105--133"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{t-mp-97
-, author =	"M. J. Todd"
-, title =	"Mathematical programming"
-, chapter =	39
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"711--732"
-, update =	"97.11 orourke"
+, author =      "M. J. Todd"
+, title =       "Mathematical programming"
+, chapter =     39
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "711--732"
+, update =      "97.11 orourke"
 }
 
 @book{t-cfpa-76
-, author =	"M. J. Todd"
-, title =	"The Computation of Fixed Points and Applications"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin"
-, year =	1976
-, update =	"97.11 bibrelex"
+, author =      "M. J. Todd"
+, title =       "The Computation of Fixed Points and Applications"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin"
+, year =        1976
+, update =      "97.11 bibrelex"
 }
 
 @article{t-ktgtc-89
-, author =	"P. Todd"
-, title =	"A $k$-tree generalization that characterizes consistency of dimensioned engineering drawings"
-, journal =	"SIAM J. Discrete Math."
-, volume =	2
-, year =	1989
-, pages =	"255--261"
-, update =	"97.11 bibrelex"
+, author =      "P. Todd"
+, title =       "A $k$-tree generalization that characterizes consistency of dimensioned engineering drawings"
+, journal =     "SIAM J. Discrete Math."
+, volume =      2
+, year =        1989
+, pages =       "255--261"
+, update =      "97.11 bibrelex"
 }
 
-% , number =	10
-% , month =	dec
+% , number =    10
+% , month =     dec
 @article{t-prnie-95
-, author =	"George W. Tokarsky"
-, title =	"Polygonal Rooms Not Illuminable from Every Point"
-, journal =	"Amer. Math. Monthly"
-, volume =	102
-, year =	1995
-, pages =	"867--879"
-, keywords =	"billiards, visibility with reflection, geometric optics, simple polygons"
-, comments =	"Solves an old geometric problem originally published in
+, author =      "George W. Tokarsky"
+, title =       "Polygonal Rooms Not Illuminable from Every Point"
+, journal =     "Amer. Math. Monthly"
+, volume =      102
+, year =        1995
+, pages =       "867--879"
+, keywords =    "billiards, visibility with reflection, geometric optics, simple polygons"
+, comments =    "Solves an old geometric problem originally published in
 \cite{k-iepri-69} by giving an example of a simple polygon in which there is
 a placement of a single point light source that does not light up the polygon,
 if the light is allowed to reflect off the polygon walls according to the laws
 of geometric optics."
-, update =	"99.07 orourke, 96.01 aronov"
+, update =      "99.07 orourke, 96.01 aronov"
 }
 
 @techreport{t-dmvdt-88
-, author =	"T. Tokuyama"
-, title =	"Deformation of merged {Voronoi} diagrams with translation"
-, type =	"Report"
-, number =	"Rep. TR87-0049"
-, institution =	"IBM Tokyo Research Laboratory"
-, year =	1988
-, update =	"94.09 bernal"
+, author =      "T. Tokuyama"
+, title =       "Deformation of merged {Voronoi} diagrams with translation"
+, type =        "Report"
+, number =      "Rep. TR87-0049"
+, institution = "IBM Tokyo Research Laboratory"
+, year =        1988
+, update =      "94.09 bernal"
 }
 
 @inproceedings{t-mpopm-01
-, author =	"Takeshi Tokuyama"
-, title =	"Minimax parametric optimization problems and multi-dimensional parametric searching"
-, booktitle =	"Proc. 33rd Annu. ACM Sympos. Theory Comput."
-, year =	2001
-, pages =	"75--83"
-, update =	"02.03 cheong"
+, author =      "Takeshi Tokuyama"
+, title =       "Minimax parametric optimization problems and multi-dimensional parametric searching"
+, booktitle =   "Proc. 33rd Annu. ACM Sympos. Theory Comput."
+, year =        2001
+, pages =       "75--83"
+, update =      "02.03 cheong"
 }
 
 @article{t-oqs-97
-, author =	"T. Tokuyama"
-, title =	"Orthogonal Queries in Segments"
-, journal =	"Algorithmica"
-, volume =	18
-, year =	1997
-, pages =	"229--245"
-, update =	"97.11 smid"
+, author =      "T. Tokuyama"
+, title =       "Orthogonal Queries in Segments"
+, journal =     "Algorithmica"
+, volume =      18
+, year =        1997
+, pages =       "229--245"
+, update =      "97.11 smid"
 }
 
 @inproceedings{t-oqst-94
-, author =	"T. Tokuyama"
-, title =	"Orthogonal Queries in Segments and Triangles"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"505--513"
-, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
+, author =      "T. Tokuyama"
+, title =       "Orthogonal Queries in Segments and Triangles"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "505--513"
+, update =      "99.11 bibrelex, 98.03 smid, 96.05 mitchell"
 }
 
 @inproceedings{tn-gamca-91
-, author =	"T. Tokuyama and J. Nakano"
-, title =	"Geometric algorithms for a minimum cost assignment problem"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"262--271"
-, keywords =	"optimization"
-, cites =	"ae-tpss-87, clr-ia-90, cw-mmap-87, ff-fn-62, fr-etbs-75, ft-fhtui-87, gt-fsanp-89, nt-scs-90, r-lnra-90, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "T. Tokuyama and J. Nakano"
+, title =       "Geometric algorithms for a minimum cost assignment problem"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "262--271"
+, keywords =    "optimization"
+, cites =       "ae-tpss-87, clr-ia-90, cw-mmap-87, ff-fn-62, fr-etbs-75, ft-fhtui-87, gt-fsanp-89, nt-scs-90, r-lnra-90, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{t-aps-93
-, author =	"S. Toledo"
-, title =	"Approximate parametric search"
-, journal =	"Inform. Process. Lett."
-, volume =	47
-, year =	1993
-, pages =	"1--4"
-, update =	"96.05 agarwal"
+, author =      "S. Toledo"
+, title =       "Approximate parametric search"
+, journal =     "Inform. Process. Lett."
+, volume =      47
+, year =        1993
+, pages =       "1--4"
+, update =      "96.05 agarwal"
 }
 
 @inproceedings{t-epcp-91
-, author =	"S. Toledo"
-, title =	"Extremal point containment problems"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"176--185"
-, keywords =	"optimization, prune and search, lower envelopes"
-, cites =	"ab-pcp1s-87, ab-pptr-88, acgoy-pcg-88, ass-sulbl-89, c-pcp-83, c-rcsi-86, ck-plscc-89, ck-hcmpc-90, c-pms-86, e-acg-87, f-fapct-85, grs-kfcg-83, hs-ndssg-86, ks-empac-90, ls-ncfcc-87, ls-pptmc-87, m-apcad-83, py-prp-86, ss-pmp2g-83, v-pcp-75, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "S. Toledo"
+, title =       "Extremal point containment problems"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "176--185"
+, keywords =    "optimization, prune and search, lower envelopes"
+, cites =       "ab-pcp1s-87, ab-pptr-88, acgoy-pcg-88, ass-sulbl-89, c-pcp-83, c-rcsi-86, ck-plscc-89, ck-hcmpc-90, c-pms-86, e-acg-87, f-fapct-85, grs-kfcg-83, hs-ndssg-86, ks-empac-90, ls-ncfcc-87, ls-pptmc-87, m-apcad-83, py-prp-86, ss-pmp2g-83, v-pcp-75, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @mastersthesis{t-epcpo-91
-, author =	"S. Toledo"
-, title =	"Extremal Polygon Containment Problems and Other Issues in Parametric Searching"
-, type =	"M.S. Thesis"
-, school =	"Dept. Comput. Sci., Tel Aviv Univ."
-, address =	"Tel Aviv"
-, year =	1991
-, keywords =	"master thesis"
-, succeeds =	"st-epcp-91t"
-, update =	"98.11 bibrelex, 96.05 agarwal"
+, author =      "S. Toledo"
+, title =       "Extremal Polygon Containment Problems and Other Issues in Parametric Searching"
+, type =        "M.S. Thesis"
+, school =      "Dept. Comput. Sci., Tel Aviv Univ."
+, address =     "Tel Aviv"
+, year =        1991
+, keywords =    "master thesis"
+, succeeds =    "st-epcp-91t"
+, update =      "98.11 bibrelex, 96.05 agarwal"
 }
 
 @inproceedings{t-mnlcf-92
-, author =	"Sivan Toledo"
-, title =	"Maximizing non-linear concave functions in fixed dimension"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"676--685"
-, update =	"94.01 smid, 93.09 milone+mitchell"
+, author =      "Sivan Toledo"
+, title =       "Maximizing non-linear concave functions in fixed dimension"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "676--685"
+, update =      "94.01 smid, 93.09 milone+mitchell"
 }
 
 @incollection{t-mnlcf-93
-, author =	"Sivan Toledo"
-, title =	"Maximizing non-linear concave functions in fixed dimension"
-, editor =	"Panos M. Pardalos"
-, booktitle =	"Complexity in Numerical Computations"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1993
-, pages =	"429--447"
-, update =	"97.03 agarwal"
+, author =      "Sivan Toledo"
+, title =       "Maximizing non-linear concave functions in fixed dimension"
+, editor =      "Panos M. Pardalos"
+, booktitle =   "Complexity in Numerical Computations"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1993
+, pages =       "429--447"
+, update =      "97.03 agarwal"
 }
 
 @inproceedings{tx-dtn-95
-, author =	"I. G. Tollis and C. Xia"
-, title =	"Drawing Telecommunication Networks"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"206--217"
-, keywords =	"graph drawing, network visualization"
-, update =	"95.01 tamassia"
+, author =      "I. G. Tollis and C. Xia"
+, title =       "Drawing Telecommunication Networks"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "206--217"
+, keywords =    "graph drawing, network visualization"
+, update =      "95.01 tamassia"
 }
 
 @book{t-giscm-90
-, author =	"C. D. Tomlin"
-, title =	"Geographic Information Systems and Cartographic Modeling"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs"
-, year =	1990
-, update =	"96.09 kreveld"
+, author =      "C. D. Tomlin"
+, title =       "Geographic Information Systems and Cartographic Modeling"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs"
+, year =        1990
+, update =      "96.09 kreveld"
 }
 
 @book{tcm-chgd-76
-, author =	"R. F. Tomlinson and H. W. Calkins and D. F. Marble"
-, title =	"Computer Handling of Geographical Data"
-, publisher =	"The UNESCO Press"
-, address =	"Paris"
-, year =	1976
-, update =	"98.11 bibrelex"
+, author =      "R. F. Tomlinson and H. W. Calkins and D. F. Marble"
+, title =       "Computer Handling of Geographical Data"
+, publisher =   "The UNESCO Press"
+, address =     "Paris"
+, year =        1976
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{t-oswrp-80
-, author =	"M. Tompa"
-, title =	"An optimal solution to a wire-routing problem"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
-, year =	1980
-, pages =	"161--176"
-, precedes =	"t-oswrp-81"
+, author =      "M. Tompa"
+, title =       "An optimal solution to a wire-routing problem"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Theory Comput."
+, year =        1980
+, pages =       "161--176"
+, precedes =    "t-oswrp-81"
 }
 
 @article{t-oswrp-81
-, author =	"M. Tompa"
-, title =	"An optimal solution to a wire-routing problem"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	23
-, year =	1981
-, pages =	"127--150"
-, succeeds =	"t-oswrp-80"
+, author =      "M. Tompa"
+, title =       "An optimal solution to a wire-routing problem"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      23
+, year =        1981
+, pages =       "127--150"
+, succeeds =    "t-oswrp-80"
 }
 
 @techreport{tj-adoak-82
-, author =	"K. T{\"o}nnies and D. Jack{\'e}l"
-, title =	"Automatische dreidimensionale {Oberfl{\"a}chenrekonstruktion} aus {Konturlinien} zur {Visualisierung} von komplexen anatomischen"
-, type =	"Manuscript"
-, institution =	"Inst. Tech. Inform."
-, year =	1982
+, author =      "K. T{\"o}nnies and D. Jack{\'e}l"
+, title =       "Automatische dreidimensionale {Oberfl{\"a}chenrekonstruktion} aus {Konturlinien} zur {Visualisierung} von komplexen anatomischen"
+, type =        "Manuscript"
+, institution = "Inst. Tech. Inform."
+, year =        1982
 }
 
 @article{t-dmwhf-63
-, author =	"A. Toomre"
-, title =	"On the distibution of matter within highly flattened galaxies"
-, journal =	"The astrophysical J."
-, volume =	138
-, year =	1963
-, pages =	"385--392"
-, update =	"97.11 bibrelex"
+, author =      "A. Toomre"
+, title =       "On the distibution of matter within highly flattened galaxies"
+, journal =     "The astrophysical J."
+, volume =      138
+, year =        1963
+, pages =       "385--392"
+, update =      "97.11 bibrelex"
 }
 
 @article{tm-cdsp-84
-, author =	"S. B. Tor and A. E. Middleditch"
-, title =	"Convex decomposition of simple polygons"
-, journal =	"ACM Trans. Graph."
-, volume =	3
-, year =	1984
-, pages =	"244--265"
+, author =      "S. B. Tor and A. E. Middleditch"
+, title =       "Convex decomposition of simple polygons"
+, journal =     "ACM Trans. Graph."
+, volume =      3
+, year =        1984
+, pages =       "244--265"
 }
 
 @article{t-cvor-88
-, author =	"F. A. Toranzos"
-, title =	"Critical Visibility and Outward Rays"
-, journal =	"J. Geom."
-, volume =	33
-, year =	1988
-, pages =	"155--167"
-, update =	"98.07 bibrelex"
+, author =      "F. A. Toranzos"
+, title =       "Critical Visibility and Outward Rays"
+, journal =     "J. Geom."
+, volume =      33
+, year =        1988
+, pages =       "155--167"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{ty-vrndt-88
-, author =	"J. Toriwaki and S. Yokoi"
-, title =	"Voronoi and related neighbours on digitized two-dimensional space with applications to texture analysis"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"207--228"
+, author =      "J. Toriwaki and S. Yokoi"
+, title =       "Voronoi and related neighbours on digitized two-dimensional space with applications to texture analysis"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "207--228"
 }
 
 @techreport{tt-mtcpc-89
-, author =	"C. Torras and F. Thomas"
-, title =	"Motion of Two Convex Polyhedra in Contact"
-, type =	"Technical {Report}"
-, institution =	"Institut de Cibernetica"
-, address =	"Barcelona, Spain"
-, month =	jul
-, year =	1989
-, keywords =	"Spatial Reasoning, Motion Representation, Fine Motion Planning, Contact space, Stratification"
-, update =	"93.09 milone+mitchell"
+, author =      "C. Torras and F. Thomas"
+, title =       "Motion of Two Convex Polyhedra in Contact"
+, type =        "Technical {Report}"
+, institution = "Institut de Cibernetica"
+, address =     "Barcelona, Spain"
+, month =       jul
+, year =        1989
+, keywords =    "Spatial Reasoning, Motion Representation, Fine Motion Planning, Contact space, Stratification"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{t-obspa-90
-, author =	"Enric Torres"
-, title =	"Optimization of the Binary Space Partition Algorithm ({BSP}) for the Visualization of Dynamic Scenes"
-, booktitle =	"Eurographics '90"
-, publisher =	"North-Holland"
-, year =	1990
-, pages =	"507--518"
-, update =	"97.07 agarwal"
+, author =      "Enric Torres"
+, title =       "Optimization of the Binary Space Partition Algorithm ({BSP}) for the Visualization of Dynamic Scenes"
+, booktitle =   "Eurographics '90"
+, publisher =   "North-Holland"
+, year =        1990
+, pages =       "507--518"
+, update =      "97.07 agarwal"
 }
 
 @article{ts-ppp-91
-, author =	"Ratko To{\v s}i{\'c} and Ivan Stojmenovi{\'c}"
-, title =	"On pairing points in the plane"
-, journal =	"Zb. Rad. Prirod.-Mat. Fak. Univ. u Novom Sadu, Ser. Mat."
-, volume =	21
-, number =	2
-, year =	1991
-, pages =	"157--160"
-, keywords =	"points, matching, segments, intersection"
-, update =	"96.09 agarwal, 95.09 korneenko"
-, abstract =	"Given a set of $n$ red and $n$ blue points in the plane,
-	it is requred to find a nonintersecting red-blue matching,
-	i.e., a set of $n$ nonintersecting line segments that connect
-	red and blue points in pairs.
-	\par
-	An $O(n \log^2 n)$ time algorithm for the problem was proposed
-	in a-mpp-85.
-	The paper under review presents a simpler
-	algorithm within the same time complexity bound."
+, author =      "Ratko To{\v s}i{\'c} and Ivan Stojmenovi{\'c}"
+, title =       "On pairing points in the plane"
+, journal =     "Zb. Rad. Prirod.-Mat. Fak. Univ. u Novom Sadu, Ser. Mat."
+, volume =      21
+, number =      2
+, year =        1991
+, pages =       "157--160"
+, keywords =    "points, matching, segments, intersection"
+, update =      "96.09 agarwal, 95.09 korneenko"
+, abstract =    "Given a set of $n$ red and $n$ blue points in the plane,
+        it is requred to find a nonintersecting red-blue matching,
+        i.e., a set of $n$ nonintersecting line segments that connect
+        red and blue points in pairs.
+        \par
+        An $O(n \log^2 n)$ time algorithm for the problem was proposed
+        in a-mpp-85.
+        The paper under review presents a simpler
+        algorithm within the same time complexity bound."
 }
 
 @inproceedings{t-nbpp-01
-, author =	"Csaba David T\'oth"
-, title =	"A Note on Binary Plane Partitions"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Comput. Geom."
-, year =	2001
-, pages =	"151--156"
-, update =	"01.07 orourke"
+, author =      "Csaba David T\'oth"
+, title =       "A Note on Binary Plane Partitions"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Comput. Geom."
+, year =        2001
+, pages =       "151--156"
+, update =      "01.07 orourke"
 }
 
 @article{t-agpgr-00
-, author =	"C. D. T{\'o}th"
-, title =	"Art gallery problem with guards whose range of vision is $180^\circ$"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	17
-, year =	2000
-, pages =	"121--134"
-, update =	"01.04 smid"
+, author =      "C. D. T{\'o}th"
+, title =       "Art gallery problem with guards whose range of vision is $180^\circ$"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      17
+, year =        2000
+, pages =       "121--134"
+, update =      "01.04 smid"
 }
 
 @inproceedings{t-gdtcp-01
-, author =	"Csaba D. T{\'o}th"
-, title =	"Guarding Disjoint Triangles and Claws in the Plane"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"137--139"
-, update =	"01.04 icking"
+, author =      "Csaba D. T{\'o}th"
+, title =       "Guarding Disjoint Triangles and Claws in the Plane"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "137--139"
+, update =      "01.04 icking"
 }
 
 @inproceedings{t-ipvpl-01
-, author =	"Csaba D. T{\'o}th"
-, title =	"Illuminating polygons with vertex $\pi$-floodlights"
-, editor =	"V. N. Alexandrov and others"
-, booktitle =	"Proc. Int. Conf. on Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	2073
-, publisher =	"Springer-Verlag"
-, year =	2001
-, pages =	"772--781"
-, comments =	"~(3/4)n"
-, update =	"01.11 orourke"
+, author =      "Csaba D. T{\'o}th"
+, title =       "Illuminating polygons with vertex $\pi$-floodlights"
+, editor =      "V. N. Alexandrov and others"
+, booktitle =   "Proc. Int. Conf. on Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      2073
+, publisher =   "Springer-Verlag"
+, year =        2001
+, pages =       "772--781"
+, comments =    "~(3/4)n"
+, update =      "01.11 orourke"
 }
 
 @article{t-rtps-86
-, author =	"D. L. Toth"
-, title =	"On Ray Tracing Parametric Surfaces"
-, journal =	"Comput. Graph."
-, volume =	19
-, number =	3
-, month =	jul
-, year =	1986
-, pages =	"171--179"
-, update =	"98.03 bibrelex"
+, author =      "D. L. Toth"
+, title =       "On Ray Tracing Parametric Surfaces"
+, journal =     "Comput. Graph."
+, volume =      19
+, number =      3
+, month =       jul
+, year =        1986
+, pages =       "171--179"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{t-psmks-00
-, author =	"G{\'e}za Toth"
-, title =	"Point Sets with Many $k$-Sets"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"37--42"
-, update =	"00.11 jones"
+, author =      "G{\'e}za Toth"
+, title =       "Point Sets with Many $k$-Sets"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "37--42"
+, update =      "00.11 jones"
 }
 
 @article{t-psmks-01
-, author =	"G{\'e}za Toth"
-, title =	"Point Sets with Many $k$-Sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	26
-, number =	2
-, year =	2001
-, pages =	"187--194"
-, update =	"01.11 pocchiola"
+, author =      "G{\'e}za Toth"
+, title =       "Point Sets with Many $k$-Sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      26
+, number =      2
+, year =        2001
+, pages =       "187--194"
+, update =      "01.11 pocchiola"
 }
 
 @article{t-sdpgp-97
-, author =	"G. {T{\'o}th}"
-, title =	"The shortest distance among points in general position"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, year =	1997
-, pages =	"33--38"
-, update =	"97.07 devillers"
+, author =      "G. {T{\'o}th}"
+, title =       "The shortest distance among points in general position"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, year =        1997
+, pages =       "33--38"
+, update =      "97.07 devillers"
 }
 
 @article{tv-nest-98
-, author =	"G. T{\'o}th and P. Valtr"
-, title =	"Note on the {Erd{\H{o}}s-Szekeres} theorem"
-, journal =	"Discrete Comput. Geom."
-, volume =	19
-, year =	1998
-, pages =	"457--450"
-, update =	"02.03 devillers"
+, author =      "G. T{\'o}th and P. Valtr"
+, title =       "Note on the {Erd{\H{o}}s-Szekeres} theorem"
+, journal =     "Discrete Comput. Geom."
+, volume =      19
+, year =        1998
+, pages =       "457--450"
+, update =      "02.03 devillers"
 }
 
 @incollection{t-nrtpc-83
-, author =	"G. F. T{\'o}th"
-, title =	"New results in the theory of packing and covering"
-, editor =	"P. M. Gruber and J. M. Wills"
-, booktitle =	"Convexity and its applications"
-, publisher =	"Birkh{\"a}user"
-, address =	"Basel, Switzerland"
-, year =	1983
-, pages =	"318--359"
-, update =	"98.07 bibrelex, 98.03 bibrelex"
+, author =      "G. F. T{\'o}th"
+, title =       "New results in the theory of packing and covering"
+, editor =      "P. M. Gruber and J. M. Wills"
+, booktitle =   "Convexity and its applications"
+, publisher =   "Birkh{\"a}user"
+, address =     "Basel, Switzerland"
+, year =        1983
+, pages =       "318--359"
+, update =      "98.07 bibrelex, 98.03 bibrelex"
 }
 
 @incollection{ft-pc-97
-, author =	"G. Fejes T{\'o}th"
-, title =	"Packing and covering"
-, chapter =	2
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"19--42"
-, update =	"97.11 orourke"
+, author =      "G. Fejes T{\'o}th"
+, title =       "Packing and covering"
+, chapter =     2
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "19--42"
+, update =      "97.11 orourke"
 }
 
 @inproceedings{tg-tmc-98
-, author =	"C. Touma and C. Gotsman"
-, title =	"Triangle mesh compression"
-, booktitle =	"Graphics Interface"
-, year =	1998
-, pages =	"26--34"
-, update =	"01.07 devillers"
+, author =      "C. Touma and C. Gotsman"
+, title =       "Triangle mesh compression"
+, booktitle =   "Graphics Interface"
+, year =        1998
+, pages =       "26--34"
+, update =      "01.07 devillers"
 }
 
 @techreport{t-srct-73
-, author =	"G. Tourlakis"
-, title =	"Some results in computational topology"
-, type =	"Report"
-, number =	50
-, institution =	"Dept. Comput. Sci., Univ. Toronto"
-, address =	"Toronto, ON"
-, year =	1973
-, precedes =	"tm-srct-72"
+, author =      "G. Tourlakis"
+, title =       "Some results in computational topology"
+, type =        "Report"
+, number =      50
+, institution = "Dept. Comput. Sci., Univ. Toronto"
+, address =     "Toronto, ON"
+, year =        1973
+, precedes =    "tm-srct-72"
 }
 
 @inproceedings{tm-srct-72
-, author =	"G. Tourlakis and J. Mylopoulos"
-, title =	"Some results in computational topology"
-, booktitle =	"Proc. 13th Annu. IEEE Sympos. Switching Automata Theory"
-, year =	1972
-, pages =	"40--51"
-, succeeds =	"t-srct-73"
-, precedes =	"tm-srct-73"
+, author =      "G. Tourlakis and J. Mylopoulos"
+, title =       "Some results in computational topology"
+, booktitle =   "Proc. 13th Annu. IEEE Sympos. Switching Automata Theory"
+, year =        1972
+, pages =       "40--51"
+, succeeds =    "t-srct-73"
+, precedes =    "tm-srct-73"
 }
 
 @article{tm-srct-73
-, author =	"G. Tourlakis and J. Mylopoulos"
-, title =	"Some results in computational topology"
-, journal =	"J. ACM"
-, volume =	20
-, year =	1973
-, pages =	"439--455"
-, succeeds =	"tm-srct-72"
+, author =      "G. Tourlakis and J. Mylopoulos"
+, title =       "Some results in computational topology"
+, journal =     "J. ACM"
+, volume =      20
+, year =        1973
+, pages =       "439--455"
+, succeeds =    "tm-srct-72"
 }
 
 @techreport{t-ocspt-88
-, author =	"G. Toussaint"
-, title =	"An output-complexity-sensitive polygon triangulation algorithm"
-, type =	"Technical {Report}"
-, number =	"SOCS-88.11"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "G. Toussaint"
+, title =       "An output-complexity-sensitive polygon triangulation algorithm"
+, type =        "Technical {Report}"
+, number =      "SOCS-88.11"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @techreport{t-apctd-
-, author =	"G. Toussaint"
-, title =	"Approximating polygonal curves in three-dimensions"
-, type =	"Manuscript"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	"??"
-, update =	"97.11 bibrelex"
+, author =      "G. Toussaint"
+, title =       "Approximating polygonal curves in three-dimensions"
+, type =        "Manuscript"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        "??"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{t-cgcv-90
-, author =	"G. Toussaint"
-, title =	"Computational geometry and computer vision"
-, type =	"Technical {Report}"
-, number =	"SOCS 90.7"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "G. Toussaint"
+, title =       "Computational geometry and computer vision"
+, type =        "Technical {Report}"
+, number =      "SOCS 90.7"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{t-cgm-86
-, author =	"G. Toussaint"
-, title =	"Computational geometry and morphology"
-, type =	"Technical {Report}"
-, number =	"SOCS-86.3"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "G. Toussaint"
+, title =       "Computational geometry and morphology"
+, type =        "Technical {Report}"
+, number =      "SOCS-86.3"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @book{t-cm-88
-, title =	"Computational Morphology"
-, editor =	"G. Toussaint"
-, publisher =	"North-Holland"
-, year =	1988
-, update =	"97.11 bibrelex"
+, title =       "Computational Morphology"
+, editor =      "G. Toussaint"
+, publisher =   "North-Holland"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @techreport{t-cgpis-90
-, author =	"G. Toussaint"
-, title =	"Computing Geodesic Properties inside a Simple Polygon"
-, number =	"??"
-, institution =	"School of Computer Science, McGill University"
-, year =	1990
+, author =      "G. Toussaint"
+, title =       "Computing Geodesic Properties inside a Simple Polygon"
+, number =      "??"
+, institution = "School of Computer Science, McGill University"
+, year =        1990
 }
 
 @article{t-etsp-91
-, author =	"G. Toussaint"
-, title =	"Efficient triangulation of simple polygons"
-, journal =	"Visual Comput."
-, volume =	7
-, year =	1991
-, pages =	"280--295"
-, keywords =	"computational geometry, triangulation"
-, abstract =	"This paper considers the topic of efficiently
-		 triangulating a simple polygon with emphasis on
-		 practical and easy-to-implement algorithms. It also
-		 describes a new adaptive algorithms for triangulating a
-		 simple n-sided polygon. The algorithm runs in time
-		 O(n(1 plus t//0)) with t//0 less than n. The quantity
-		 t//0 measures the shape-complexity of the triangulation
-		 delivered by the algorithm. More precisely t//0 is the
-		 number of obtained triangles contained in the
-		 triangulation that share zero edges with the input
-		 polygon and is, furthermore, related to the
-		 shape-complexity of the input polygon. Although the
-		 worst-case complexity of the algorithm is O(n**2), for
-		 several classes of polygons it runs in linear time. The
-		 practical advantages of the algorithm are that it is
-		 simple and does not require sorting or the use of
-		 balanced tree structures. On the theoretical side, it
-		 is of interest because it is the first polygon
-		 triangulation algorithm where the computational
-		 complexity is a function of the output complexity. As a
-		 side benefit, we introduce a new measure of the
-		 complexity of a polygon triangulation that should find
-		 application in other contexts as well. (Author
-		 abstract) Refs."
+, author =      "G. Toussaint"
+, title =       "Efficient triangulation of simple polygons"
+, journal =     "Visual Comput."
+, volume =      7
+, year =        1991
+, pages =       "280--295"
+, keywords =    "computational geometry, triangulation"
+, abstract =    "This paper considers the topic of efficiently
+                 triangulating a simple polygon with emphasis on
+                 practical and easy-to-implement algorithms. It also
+                 describes a new adaptive algorithms for triangulating a
+                 simple n-sided polygon. The algorithm runs in time
+                 O(n(1 plus t//0)) with t//0 less than n. The quantity
+                 t//0 measures the shape-complexity of the triangulation
+                 delivered by the algorithm. More precisely t//0 is the
+                 number of obtained triangles contained in the
+                 triangulation that share zero edges with the input
+                 polygon and is, furthermore, related to the
+                 shape-complexity of the input polygon. Although the
+                 worst-case complexity of the algorithm is O(n**2), for
+                 several classes of polygons it runs in linear time. The
+                 practical advantages of the algorithm are that it is
+                 simple and does not require sorting or the use of
+                 balanced tree structures. On the theoretical side, it
+                 is of interest because it is the first polygon
+                 triangulation algorithm where the computational
+                 complexity is a function of the output complexity. As a
+                 side benefit, we introduce a new measure of the
+                 complexity of a polygon triangulation that should find
+                 application in other contexts as well. (Author
+                 abstract) Refs."
 }
 
 @article{t-stsps-89
-, author =	"G. Toussaint"
-, title =	"On separating two simple polygons by a single translation"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"265--278"
+, author =      "G. Toussaint"
+, title =       "On separating two simple polygons by a single translation"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "265--278"
 }
 
 @inproceedings{t-qps-95
-, author =	"G. Toussaint"
-, title =	"Quadrangulations of planar sets"
-, booktitle =	"Proc. 4th Workshop Algorithms Data Struct."
-, nickname =	"WADS '95"
-, site =	"Kingston, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	955
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"218--227"
-, update =	"99.07 bibrelex, 98.07 bibrelex"
+, author =      "G. Toussaint"
+, title =       "Quadrangulations of planar sets"
+, booktitle =   "Proc. 4th Workshop Algorithms Data Struct."
+, nickname =    "WADS '95"
+, site =        "Kingston, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      955
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "218--227"
+, update =      "99.07 bibrelex, 98.07 bibrelex"
 }
 
 @techreport{td-chrl-90
-, author =	"G. Toussaint and L. Devroye"
-, title =	"Convex Hulls for Random Lines"
-, type =	"Technical {Report}"
-, number =	"SOCS 90.11"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "G. Toussaint and L. Devroye"
+, title =       "Convex Hulls for Random Lines"
+, type =        "Technical {Report}"
+, number =      "SOCS 90.11"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{tvwz-tsnsp-93
-, author =	"G. Toussaint and C. Verbrugge and C. Wang and B. Zhu"
-, title =	"Tetrahedralization of simple and non-simple polyhedra"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"24--29"
-, cites =	"aap-ptem-86, b-ip-48a, c-tsplt-91a, cp-tncp-90, gp-cdpb-88, l-tsfpp-11, o-agta-87, rs-dttdn-92, s-udzvd-28, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "G. Toussaint and C. Verbrugge and C. Wang and B. Zhu"
+, title =       "Tetrahedralization of simple and non-simple polyhedra"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "24--29"
+, cites =       "aap-ptem-86, b-ip-48a, c-tsplt-91a, cp-tncp-90, gp-cdpb-88, l-tsfpp-11, o-agta-87, rs-dttdn-92, s-udzvd-28, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @incollection{t-ghtt-88
-, author =	"G. T. Toussaint"
-, title =	"A geodesic {Helly}-type theorem"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Snapshots of Computational and Discrete Geometry"
-, publisher =	"McGill University"
-, address =	"Montreal, PQ"
-, year =	1988
-, note =	"Technical Report SOCS-88.11"
-, update =	"98.07 bibrelex"
+, author =      "G. T. Toussaint"
+, title =       "A geodesic {Helly}-type theorem"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Snapshots of Computational and Discrete Geometry"
+, publisher =   "McGill University"
+, address =     "Montreal, PQ"
+, year =        1988
+, note =        "Technical Report SOCS-88.11"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{t-gtps-88
-, author =	"G. T. Toussaint"
-, title =	"A graph-theoretical primal sketch"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Morphology"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1988
-, pages =	"229--260"
+, author =      "G. T. Toussaint"
+, title =       "A graph-theoretical primal sketch"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Morphology"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1988
+, pages =       "229--260"
 }
 
 @article{t-hnchf-85
-, author =	"G. T. Toussaint"
-, title =	"A historical note on convex hull finding algorithms"
-, journal =	"Pattern Recogn. Lett."
-, volume =	3
-, year =	1985
-, pages =	"21--28"
+, author =      "G. T. Toussaint"
+, title =       "A historical note on convex hull finding algorithms"
+, journal =     "Pattern Recogn. Lett."
+, volume =      3
+, year =        1985
+, pages =       "21--28"
 }
 
 @techreport{t-ltass-86t
-, author =	"G. T. Toussaint"
-, title =	"A linear-time algorithm for solving the strong hidden-line problem in a simple polygon"
-, type =	"Report"
-, number =	"SOCS-86.2"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1986
-, precedes =	"t-ltass-86a"
+, author =      "G. T. Toussaint"
+, title =       "A linear-time algorithm for solving the strong hidden-line problem in a simple polygon"
+, type =        "Report"
+, number =      "SOCS-86.2"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1986
+, precedes =    "t-ltass-86a"
 }
 
 @article{t-ltass-86a
-, author =	"Godfried T. Toussaint"
-, title =	"A linear-time algorithm for solving the strong hidden-line problem in a simple polygon"
-, journal =	"Pattern Recogn. Lett."
-, volume =	4
-, year =	1986
-, pages =	"449--451"
-, succeeds =	"t-ltass-86t"
-, abstract =	"A linear-time algorithm is presented for solving the
-		 strong hidden-line problem in a simple polygon P, or
-		 alternately, determining the region in P weakly visible
-		 from a specified edge of P. The algorithm combines
-		 results from visibility and shortest paths with the
-		 linear-time polygon triangulation algorithm discovered
-		 recently by Tarjan and Van Wyk. Previous published
-		 algorithms for the strong hidden-line problem require
-		 O(n log n) steps even after triangulation, where n is
-		 the cardinality of P"
+, author =      "Godfried T. Toussaint"
+, title =       "A linear-time algorithm for solving the strong hidden-line problem in a simple polygon"
+, journal =     "Pattern Recogn. Lett."
+, volume =      4
+, year =        1986
+, pages =       "449--451"
+, succeeds =    "t-ltass-86t"
+, abstract =    "A linear-time algorithm is presented for solving the
+                 strong hidden-line problem in a simple polygon P, or
+                 alternately, determining the region in P weakly visible
+                 from a specified edge of P. The algorithm combines
+                 results from visibility and shortest paths with the
+                 linear-time polygon triangulation algorithm discovered
+                 recently by Tarjan and Van Wyk. Previous published
+                 algorithms for the strong hidden-line problem require
+                 O(n log n) steps even after triangulation, where n is
+                 the cardinality of P"
 }
 
 @article{t-ncsup-01
-, author =	"Godfried T. Toussaint"
-, title =	"A new class of stuck unknots in Pol-6"
-, journal =	"Contributions to Algebra and Geometry"
-, volume =	42
-, number =	2
-, year =	2001
-, pages =	"301--306"
-, update =	"02.03 orourke"
+, author =      "Godfried T. Toussaint"
+, title =       "A new class of stuck unknots in Pol-6"
+, journal =     "Contributions to Algebra and Geometry"
+, volume =      42
+, number =      2
+, year =        2001
+, pages =       "301--306"
+, update =      "02.03 orourke"
 }
 
 @techreport{t-ncsup6-99
-, author =	"G. T. Toussaint"
-, title =	"A new class of stuck unknots in {${\rm Pol}_6$}"
-, number =	"SOCS-99.1"
-, institution =	"School of Comput. Sci., McGill Univ."
-, month =	apr
-, year =	1999
-, update =	"99.07 orourke"
+, author =      "G. T. Toussaint"
+, title =       "A new class of stuck unknots in {${\rm Pol}_6$}"
+, number =      "SOCS-99.1"
+, institution = "School of Comput. Sci., McGill Univ."
+, month =       apr
+, year =        1999
+, update =      "99.07 orourke"
 }
 
 @techreport{t-nlatm-83
-, author =	"G. T. Toussaint"
-, title =	"A New Linear Algorithm for Triangulating Monotone Polygons"
-, number =	"SOCS 83.9"
-, institution =	"McGill University"
-, year =	1983
-, annote =	"$O(n)$ algorithm for decomposing monotone into
-		 edge-visible (which can be done in linear time)."
+, author =      "G. T. Toussaint"
+, title =       "A New Linear Algorithm for Triangulating Monotone Polygons"
+, number =      "SOCS 83.9"
+, institution = "McGill University"
+, year =        1983
+, annote =      "$O(n)$ algorithm for decomposing monotone into
+                 edge-visible (which can be done in linear time)."
 }
 
 @techreport{t-nlesp-90
-, author =	"G. T. Toussaint"
-, title =	"A new look at {Euclid}'s second proposition"
-, type =	"Report"
-, number =	"SOCS-90.21"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1990
+, author =      "G. T. Toussaint"
+, title =       "A new look at {Euclid}'s second proposition"
+, type =        "Report"
+, number =      "SOCS-90.21"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1990
 }
 
 @article{t-slaic-85
-, author =	"G. T. Toussaint"
-, title =	"A simple linear algorithm for intersecting convex polygons"
-, journal =	"Visual Comput."
-, volume =	1
-, year =	1985
-, pages =	"118--123"
+, author =      "G. T. Toussaint"
+, title =       "A simple linear algorithm for intersecting convex polygons"
+, journal =     "Visual Comput."
+, volume =      1
+, year =        1985
+, pages =       "118--123"
 }
 
 @article{t-sppet-82
-, author =	"G. T. Toussaint"
-, title =	"A simple proof of {Pach}'s extremal theorem for convex polygons"
-, journal =	"Pattern Recogn. Lett."
-, volume =	1
-, year =	1982
-, pages =	"85--86"
+, author =      "G. T. Toussaint"
+, title =       "A simple proof of {Pach}'s extremal theorem for convex polygons"
+, journal =     "Pattern Recogn. Lett."
+, volume =      1
+, year =        1982
+, pages =       "85--86"
 }
 
 @article{t-acrng-80
-, author =	"G. T. Toussaint"
-, title =	"Algorithms for computing relative neighbourhood graph"
-, journal =	"Electron. Lett."
-, volume =	16
-, number =	22
-, year =	1980
-, pages =	860
+, author =      "G. T. Toussaint"
+, title =       "Algorithms for computing relative neighbourhood graph"
+, journal =     "Electron. Lett."
+, volume =      16
+, number =      22
+, year =        1980
+, pages =       860
 }
 
 @inproceedings{t-oacmv-83
-, author =	"G. T. Toussaint"
-, title =	"An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons"
-, editor =	"457--458"
-, booktitle =	"Proc. 21st Allerton Conf. Commun. Control Comput."
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "G. T. Toussaint"
+, title =       "An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons"
+, editor =      "457--458"
+, booktitle =   "Proc. 21st Allerton Conf. Commun. Control Comput."
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{t-oacmv-84i
-, author =	"G. T. Toussaint"
-, title =	"An Optimal Algorithm For Computing the Minimum Vertex Distance Between Two Crossing Convex Polygons"
-, booktitle =	"Proc. IEEE Internat. Conf. Pattern Recogn."
-, year =	1984
-, pages =	"465--467"
-, precedes =	"t-oacmv-84a"
+, author =      "G. T. Toussaint"
+, title =       "An Optimal Algorithm For Computing the Minimum Vertex Distance Between Two Crossing Convex Polygons"
+, booktitle =   "Proc. IEEE Internat. Conf. Pattern Recogn."
+, year =        1984
+, pages =       "465--467"
+, precedes =    "t-oacmv-84a"
 }
 
 @article{t-oacmv-84a
-, author =	"G. T. Toussaint"
-, title =	"An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons"
-, journal =	"Computing"
-, volume =	32
-, year =	1984
-, pages =	"357--364"
-, keywords =	"Voronoi diagrams"
-, succeeds =	"t-oacmv-84i"
-, annote =	"Linear algorithm. Exploits the fact that VD outside
-		 and above semi-circle polygon can be constructed in
-		 linear time."
+, author =      "G. T. Toussaint"
+, title =       "An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons"
+, journal =     "Computing"
+, volume =      32
+, year =        1984
+, pages =       "357--364"
+, keywords =    "Voronoi diagrams"
+, succeeds =    "t-oacmv-84i"
+, annote =      "Linear algorithm. Exploits the fact that VD outside
+                 and above semi-circle polygon can be constructed in
+                 linear time."
 }
 
 @incollection{t-oacrc-86
-, author =	"G. T. Toussaint"
-, title =	"An optimal algorithm for computing the relative convex hull of a set of points in a polygon"
-, booktitle =	"Signal Processing III: Theories and Applications"
-, publisher =	"Proc. 3rd European Signal Process. Conf."
-, year =	1986
-, pages =	"853--856"
+, author =      "G. T. Toussaint"
+, title =       "An optimal algorithm for computing the relative convex hull of a set of points in a polygon"
+, booktitle =   "Signal Processing III: Theories and Applications"
+, publisher =   "Proc. 3rd European Signal Process. Conf."
+, year =        1986
+, pages =       "853--856"
 }
 
 @techreport{t-ocspt-90
-, author =	"G. T. Toussaint"
-, title =	"An output-complexity-sensitive polygon triangulation algorithm"
-, type =	"Report"
-, number =	"SOCS-90.1"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, month =	feb
-, year =	1990
-, comments =	"Replaces report SOCS-88.10 (June 1988)"
+, author =      "G. T. Toussaint"
+, title =       "An output-complexity-sensitive polygon triangulation algorithm"
+, type =        "Report"
+, number =      "SOCS-90.1"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, month =       feb
+, year =        1990
+, comments =    "Replaces report SOCS-88.10 (June 1988)"
 }
 
 % ### one of t-acrng-80 and t-cacrn-80 is duplicate
 @article{t-cacrn-80
-, author =	"G. T. Toussaint"
-, title =	"Comment on algorithms for computing relative neighbourhood graph"
-, journal =	"Electron. Lett."
-, volume =	16
-, year =	1980
-, pages =	860
+, author =      "G. T. Toussaint"
+, title =       "Comment on algorithms for computing relative neighbourhood graph"
+, journal =     "Electron. Lett."
+, volume =      16
+, year =        1980
+, pages =       860
 }
 
 @inproceedings{t-ccu-84
-, author =	"G. T. Toussaint"
-, title =	"Complexity, convexity, and unimodality"
-, booktitle =	"Proc. 2nd World Conf. Math."
-, site =	"Las Palmas, Spain"
-, year =	1984
-, update =	"99.11 bibrelex"
+, author =      "G. T. Toussaint"
+, title =       "Complexity, convexity, and unimodality"
+, booktitle =   "Proc. 2nd World Conf. Math."
+, site =        "Las Palmas, Spain"
+, year =        1984
+, update =      "99.11 bibrelex"
 }
 
 @article{t-ccu-84a
-, author =	"G. T. Toussaint"
-, title =	"Complexity, convexity, and unimodality"
-, journal =	"Internat. J. Comput. Inform. Sci."
-, volume =	13
-, number =	3
-, month =	jun
-, year =	1984
-, pages =	"197--217"
-, update =	"98.03 bibrelex"
+, author =      "G. T. Toussaint"
+, title =       "Complexity, convexity, and unimodality"
+, journal =     "Internat. J. Comput. Inform. Sci."
+, volume =      13
+, number =      3
+, month =       jun
+, year =        1984
+, pages =       "197--217"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{t-cgppr-82
-, author =	"G. T. Toussaint"
-, title =	"Computational geometric problems in pattern recognition"
-, editor =	"J. Kittler and K. S. Fu and L. F. Pau"
-, booktitle =	"Pattern Recognition Theory and Application"
-, publisher =	"D. Reidel Publishing Company"
-, address =	"Boston, MA"
-, year =	1982
-, pages =	"73--91"
+, author =      "G. T. Toussaint"
+, title =       "Computational geometric problems in pattern recognition"
+, editor =      "J. Kittler and K. S. Fu and L. F. Pau"
+, booktitle =   "Pattern Recognition Theory and Application"
+, publisher =   "D. Reidel Publishing Company"
+, address =     "Boston, MA"
+, year =        1982
+, pages =       "73--91"
 }
 
 @book{t-cg-85
-, title =	"Computational Geometry"
-, editor =	"G. T. Toussaint"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, keywords =	"book"
+, title =       "Computational Geometry"
+, editor =      "G. T. Toussaint"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, keywords =    "book"
 }
 
 @inproceedings{t-cgrd-89
-, author =	"G. T. Toussaint"
-, title =	"Computational geometry: recent developments"
-, booktitle =	"New Advances in Computer Graphics: Proceedings of Computer Graphics International '89"
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"23--51"
-, keywords =	"survey paper"
+, author =      "G. T. Toussaint"
+, title =       "Computational geometry: recent developments"
+, booktitle =   "New Advances in Computer Graphics: Proceedings of Computer Graphics International '89"
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "23--51"
+, keywords =    "survey paper"
 }
 
 @article{t-cgpis-89
-, author =	"Godfried T. Toussaint"
-, title =	"Computing Geodesic Properties inside a Simple Polygon"
-, journal =	"Revue D'Intelligence Artificielle"
-, volume =	3
-, number =	2
-, year =	1989
-, pages =	"9--42"
-, note =	"also available as technical report SOCS 88.20, School of Computer Science, McGill University"
-, update =	"98.11 bibrelex"
+, author =      "Godfried T. Toussaint"
+, title =       "Computing Geodesic Properties inside a Simple Polygon"
+, journal =     "Revue D'Intelligence Artificielle"
+, volume =      3
+, number =      2
+, year =        1989
+, pages =       "9--42"
+, note =        "also available as technical report SOCS 88.20, School of Computer Science, McGill University"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{t-cgpp-86
-, author =	"G. T. Toussaint"
-, title =	"Computing geodesic properties of polygons"
-, type =	"Manuscript"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "G. T. Toussaint"
+, title =       "Computing geodesic properties of polygons"
+, type =        "Manuscript"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{t-clecl-83
-, author =	"G. T. Toussaint"
-, title =	"Computing largest empty circles with location constraints"
-, journal =	"Internat. J. Comput. Inform. Sci."
-, volume =	12
-, year =	1983
-, pages =	"347--358"
-, update =	"97.07 kuehn"
+, author =      "G. T. Toussaint"
+, title =       "Computing largest empty circles with location constraints"
+, journal =     "Internat. J. Comput. Inform. Sci."
+, volume =      12
+, year =        1983
+, pages =       "347--358"
+, update =      "97.07 kuehn"
 }
 
 @inproceedings{t-dsprn-80
-, author =	"G. T. Toussaint"
-, title =	"Decomposing a simple polygon with the relative neighborhood graph"
-, booktitle =	"Proc. 18th Allerton Conf. Commun. Control Comput."
-, year =	1980
-, pages =	"20--28"
+, author =      "G. T. Toussaint"
+, title =       "Decomposing a simple polygon with the relative neighborhood graph"
+, booktitle =   "Proc. 18th Allerton Conf. Commun. Control Comput."
+, year =        1980
+, pages =       "20--28"
 }
 
 @techreport{t-mss-84
-, author =	"G. T. Toussaint"
-, title =	"Movable Separability of Sets"
-, type =	"Technical {Report}"
-, number =	"SOCS-84.17"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, month =	nov
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "G. T. Toussaint"
+, title =       "Movable Separability of Sets"
+, type =        "Technical {Report}"
+, number =      "SOCS-84.17"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, month =       nov
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @incollection{t-mss-85
-, author =	"G. T. Toussaint"
-, title =	"Movable separability of sets"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"335--375"
+, author =      "G. T. Toussaint"
+, title =       "Movable separability of sets"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "335--375"
 }
 
 @incollection{t-nrcgr-86
-, author =	"G. T. Toussaint"
-, title =	"New results in computational geometry relevant to pattern recognition in practice"
-, editor =	"E. S. Gelsema and L. N. Kanal"
-, booktitle =	"Pattern Recognition in Practice II"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1986
-, pages =	"135--146"
+, author =      "G. T. Toussaint"
+, title =       "New results in computational geometry relevant to pattern recognition in practice"
+, editor =      "E. S. Gelsema and L. N. Kanal"
+, booktitle =   "Pattern Recognition in Practice II"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1986
+, pages =       "135--146"
 }
 
 @article{t-achha-83
-, author =	"G. T. Toussaint"
-, title =	"On the application of the convex hull to histogram analysis in threshold selection"
-, journal =	"Pattern Recogn. Lett."
-, volume =	2
-, year =	1983
-, pages =	"75--77"
+, author =      "G. T. Toussaint"
+, title =       "On the application of the convex hull to histogram analysis in threshold selection"
+, journal =     "Pattern Recogn. Lett."
+, volume =      2
+, year =        1983
+, pages =       "75--77"
 }
 
 @inproceedings{t-capcp-85
-, author =	"G. T. Toussaint"
-, title =	"On the complexity of approximating polygonal curves in the plane"
-, booktitle =	"Proc. IASTED, International Symposium on Robotics and Automation"
-, site =	"Lugano, Switzerland"
-, year =	1985
-, pages =	""
-, update =	"96.09 orourke"
+, author =      "G. T. Toussaint"
+, title =       "On the complexity of approximating polygonal curves in the plane"
+, booktitle =   "Proc. IASTED, International Symposium on Robotics and Automation"
+, site =        "Lugano, Switzerland"
+, year =        1985
+, pages =       ""
+, update =      "96.09 orourke"
 }
 
 @inproceedings{t-prgc-80
-, author =	"G. T. Toussaint"
-, title =	"Pattern recognition and geometrical complexity"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
-, year =	1980
-, pages =	"1324--1347"
+, author =      "G. T. Toussaint"
+, title =       "Pattern recognition and geometrical complexity"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Pattern Recogn."
+, year =        1980
+, pages =       "1324--1347"
 }
 
 @techreport{t-spsee-85
-, author =	"G. T. Toussaint"
-, title =	"Shortest Path Solves Edge-to-Edge Visibility in a Polygon"
-, type =	"Technical {Report}"
-, number =	"SOCS-85.19"
-, institution =	"School of Computer Science, McGill University"
-, address =	"Montreal, Quebec, Canada"
-, year =	1985
-, update =	"93.09 milone+mitchell"
+, author =      "G. T. Toussaint"
+, title =       "Shortest Path Solves Edge-to-Edge Visibility in a Polygon"
+, type =        "Technical {Report}"
+, number =      "SOCS-85.19"
+, institution = "School of Computer Science, McGill University"
+, address =     "Montreal, Quebec, Canada"
+, year =        1985
+, update =      "93.09 milone+mitchell"
 }
 
 @article{t-spsee-86
-, author =	"G. T. Toussaint"
-, title =	"Shortest path solves edge-to-edge visibility in a polygon"
-, journal =	"Pattern Recogn. Lett."
-, volume =	4
-, year =	1986
-, pages =	"165--170"
-, update =	"98.07 bibrelex"
+, author =      "G. T. Toussaint"
+, title =       "Shortest path solves edge-to-edge visibility in a polygon"
+, journal =     "Pattern Recogn. Lett."
+, volume =      4
+, year =        1986
+, pages =       "165--170"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{t-spsts-85
-, author =	"G. T. Toussaint"
-, title =	"Shortest path solves translation separability of polygons"
-, type =	"Report"
-, number =	"SOCS-85.27"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1985
+, author =      "G. T. Toussaint"
+, title =       "Shortest path solves translation separability of polygons"
+, type =        "Report"
+, number =      "SOCS-85.27"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1985
 }
 
 @inproceedings{t-sgprc-83
-, author =	"G. T. Toussaint"
-, title =	"Solving geometric problems with the rotating calipers"
-, booktitle =	"Proc. IEEE MELECON '83"
-, site =	"Athens, Greece"
-, year =	1983
-, pages =	"A10.02/1--4"
-, update =	"97.11 bibrelex, 93.05 jones"
-, abstract =	"M. I. Shamos (1978) recently showed that the diameter of
-		 a convex $n$-sided polygon could be computed in $O(n)$ time using an
-		 elegant and simple procedure which resembles rotating a set of calipers
-		 once around the polygon.  It is shown that this simple idea can be
-		 generalized in two ways:  several sets of calipers can be used
-		 simultaneously on one convex polygon, or one set of calipers can be used
-		 on several convex polygons simultaneously.  These generalizations make it
-		 possible to obtain simple $O(n)$ algorithms for solving a variety of
-		 problems defined on convex polygons.  Such problems include (1) finding
-		 the minimum-area rectangle enclosing a convex polygon, (2) computing the
-		 maximum distance between two polygons, (3) performing the vector-sum of
-		 two convex polygons, (4) merging convex polygons in convex hull finding
-		 algorithms, and (5) finding the critical support lines between two convex
-		 polygons.  Finding the critical support lines leads to obtaining solutions
-		 of several additional problems concerned with visibility, collision
-		 avoidance, range fitting, linear separability, and computing the Grenander
-		 distance between sets."
+, author =      "G. T. Toussaint"
+, title =       "Solving geometric problems with the rotating calipers"
+, booktitle =   "Proc. IEEE MELECON '83"
+, site =        "Athens, Greece"
+, year =        1983
+, pages =       "A10.02/1--4"
+, update =      "97.11 bibrelex, 93.05 jones"
+, abstract =    "M. I. Shamos (1978) recently showed that the diameter of
+                 a convex $n$-sided polygon could be computed in $O(n)$ time using an
+                 elegant and simple procedure which resembles rotating a set of calipers
+                 once around the polygon.  It is shown that this simple idea can be
+                 generalized in two ways:  several sets of calipers can be used
+                 simultaneously on one convex polygon, or one set of calipers can be used
+                 on several convex polygons simultaneously.  These generalizations make it
+                 possible to obtain simple $O(n)$ algorithms for solving a variety of
+                 problems defined on convex polygons.  Such problems include (1) finding
+                 the minimum-area rectangle enclosing a convex polygon, (2) computing the
+                 maximum distance between two polygons, (3) performing the vector-sum of
+                 two convex polygons, (4) merging convex polygons in convex hull finding
+                 algorithms, and (5) finding the critical support lines between two convex
+                 polygons.  Finding the critical support lines leads to obtaining solutions
+                 of several additional problems concerned with visibility, collision
+                 avoidance, range fitting, linear separability, and computing the Grenander
+                 distance between sets."
 }
 
 @incollection{t-scapp-88
-, author =	"G. T. Toussaint"
-, title =	"Some collision avoidance problems in the plane"
-, editor =	"R. A. Earnshaw"
-, booktitle =	"Theoretical Foundations of Computer Graphics and CAD"
-, series =	"NATO ASI Series~F"
-, volume =	40
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, West Germany"
-, year =	1988
-, pages =	"639--672"
-, update =	"99.11 bibrelex"
+, author =      "G. T. Toussaint"
+, title =       "Some collision avoidance problems in the plane"
+, editor =      "R. A. Earnshaw"
+, booktitle =   "Theoretical Foundations of Computer Graphics and CAD"
+, series =      "NATO ASI Series~F"
+, volume =      40
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, West Germany"
+, year =        1988
+, pages =       "639--672"
+, update =      "99.11 bibrelex"
 }
 
 @inproceedings{t-chtpr-78
-, author =	"G. T. Toussaint"
-, title =	"The convex hull as a tool in pattern recognition"
-, booktitle =	"Proc. AFOSR Workshop Comm. Theory Appl."
-, site =	"Princetown, MA"
-, year =	1978
-, pages =	"43--46"
+, author =      "G. T. Toussaint"
+, title =       "The convex hull as a tool in pattern recognition"
+, booktitle =   "Proc. AFOSR Workshop Comm. Theory Appl."
+, site =        "Princetown, MA"
+, year =        1978
+, pages =       "43--46"
 }
 
 @inproceedings{t-entir-99
-, author =	"G. T. Toussaint"
-, title =	"The {E}rd{\H o}s-{N}agy theorem and its ramifications"
-, booktitle =	"Proc. 11th Canad. Conf. Comput. Geom."
-, year =	1999
-, pages =	"9--12"
-, comments =	"Fuller version in Electronic proceedings
-		http://www.cs.ubc.ca/conferences/CCCG/elecproc.html"
-, update =	"00.03 orourke"
+, author =      "G. T. Toussaint"
+, title =       "The {E}rd{\H o}s-{N}agy theorem and its ramifications"
+, booktitle =   "Proc. 11th Canad. Conf. Comput. Geom."
+, year =        1999
+, pages =       "9--12"
+, comments =    "Fuller version in Electronic proceedings
+                http://www.cs.ubc.ca/conferences/CCCG/elecproc.html"
+, update =      "00.03 orourke"
 }
 
 @techreport{t-pfpvd-81
-, author =	"G. T. Toussaint"
-, title =	"The planar furthest-point {Voronoi} diagram in the {$L_{1}$} ({$L_{\infty}$}) metrics can be computed in {$O(n)$} worst-case time"
-, type =	"Report"
-, number =	"SOCS 81.10"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1981
+, author =      "G. T. Toussaint"
+, title =       "The planar furthest-point {Voronoi} diagram in the {$L_{1}$} ({$L_{\infty}$}) metrics can be computed in {$O(n)$} worst-case time"
+, type =        "Report"
+, number =      "SOCS 81.10"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1981
 }
 
 @article{t-rngfp-80
-, author =	"G. T. Toussaint"
-, title =	"The relative neighbourhood graph of a finite planar set"
-, journal =	"Pattern Recogn."
-, volume =	12
-, year =	1980
-, pages =	"261--268"
+, author =      "G. T. Toussaint"
+, title =       "The relative neighbourhood graph of a finite planar set"
+, journal =     "Pattern Recogn."
+, volume =      12
+, year =        1980
+, pages =       "261--268"
 }
 
 @techreport{t-safnp-81
-, author =	"G. T. Toussaint"
-, title =	"The symmetric all-furthest-neighbor problem"
-, type =	"Report"
-, number =	"SOCS 81.5"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1981
+, author =      "G. T. Toussaint"
+, title =       "The symmetric all-furthest-neighbor problem"
+, type =        "Report"
+, number =      "SOCS 81.5"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1981
 }
 
 @article{t-safnp-83
-, author =	"G. T. Toussaint"
-, title =	"The symmetric all-furthest neighbor problem"
-, journal =	"J. Comp. Math. Appl."
-, volume =	9
-, number =	6
-, year =	1983
-, pages =	"747--754"
-, update =	"98.03 bibrelex"
+, author =      "G. T. Toussaint"
+, title =       "The symmetric all-furthest neighbor problem"
+, journal =     "J. Comp. Math. Appl."
+, volume =      9
+, number =      6
+, year =        1983
+, pages =       "747--754"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{tad-echap-78
-, author =	"G. T. Toussaint and S. G. Akl and L. P. Devroye"
-, title =	"Efficient convex hull algorithms for points in two and more dimensions"
-, type =	"Report"
-, number =	"SOCS 78.5"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1978
+, author =      "G. T. Toussaint and S. G. Akl and L. P. Devroye"
+, title =       "Efficient convex hull algorithms for points in two and more dimensions"
+, type =        "Report"
+, number =      "SOCS 78.5"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1978
 }
 
 @article{ta-chapi-82
-, author =	"G. T. Toussaint and D. Avis"
-, title =	"On a convex hull algorithm for polygons and its application to triangulation problems"
-, journal =	"Pattern Recogn."
-, volume =	15
-, number =	1
-, year =	1982
-, pages =	"23--29"
-, keywords =	"polygons, triangulation, convex hull"
-, update =	"98.11 bibrelex"
+, author =      "G. T. Toussaint and D. Avis"
+, title =       "On a convex hull algorithm for polygons and its application to triangulation problems"
+, journal =     "Pattern Recogn."
+, volume =      15
+, number =      1
+, year =        1982
+, pages =       "23--29"
+, keywords =    "polygons, triangulation, convex hull"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{tb-facdf-??
-, author =	"G. T. Toussaint and B. K. Bhattacharya"
-, title =	"Fast algorithms for computing the diameter of a finite planar set"
-, type =	"Report"
-, number =	"??"
-, institution =	"??"
-, year =	"??"
-, update =	"94.05 devillers"
+, author =      "G. T. Toussaint and B. K. Bhattacharya"
+, title =       "Fast algorithms for computing the diameter of a finite planar set"
+, type =        "Report"
+, number =      "??"
+, institution = "??"
+, year =        "??"
+, update =      "94.05 devillers"
 }
 
 @techreport{tb-gaufn-81
-, author =	"G. T. Toussaint and B. K. Bhattacharya"
-, title =	"On geometric algorithms that use the furthest-neighbor pair of a finite planar set"
-, institution =	"School of Computer Science, McGill University"
-, year =	1981
-, update =	"98.03 bibrelex"
+, author =      "G. T. Toussaint and B. K. Bhattacharya"
+, title =       "On geometric algorithms that use the furthest-neighbor pair of a finite planar set"
+, institution = "School of Computer Science, McGill University"
+, year =        1981
+, update =      "98.03 bibrelex"
 }
 
 @techreport{tb-gatuf-81
-, author =	"G. T. Toussaint and B. K. Bhattacharya"
-, title =	"On geometric algorithms that use the furthest-point {Voronoi} diagram"
-, type =	"Report"
-, number =	"81.3"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1981
-, precedes =	"bt-gatuf-85"
+, author =      "G. T. Toussaint and B. K. Bhattacharya"
+, title =       "On geometric algorithms that use the furthest-point {Voronoi} diagram"
+, type =        "Report"
+, number =      "81.3"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1981
+, precedes =    "bt-gatuf-85"
 }
 
 @article{tb-oacmd-83
-, author =	"G. T. Toussaint and B. K. Bhattacharya"
-, title =	"Optimal algorithms for computing the minimum distance between two finite planar sets"
-, journal =	"Pattern Recogn. Lett."
-, volume =	2
-, year =	1983
-, pages =	"79--82"
+, author =      "G. T. Toussaint and B. K. Bhattacharya"
+, title =       "Optimal algorithms for computing the minimum distance between two finite planar sets"
+, journal =     "Pattern Recogn. Lett."
+, volume =      2
+, year =        1983
+, pages =       "79--82"
 }
 
 @inproceedings{tbp-avdnd-85
-, author =	"G. T. Toussaint and B. K. Bhattacharya and R. S. Poulsen"
-, title =	"The Application of {Voronoi} Diagrams to Nonparametric Decision Rules"
-, booktitle =	"Computer Science and Statistics: The Interface"
-, year =	1985
-, pages =	"97--108"
-, annote =	"NN-rule classifies a point according to class of
-		 nearest point. That is VD of point sets. Redundant
-		 points for this can be discarded."
+, author =      "G. T. Toussaint and B. K. Bhattacharya and R. S. Poulsen"
+, title =       "The Application of {Voronoi} Diagrams to Nonparametric Decision Rules"
+, booktitle =   "Computer Science and Statistics: The Interface"
+, year =        1985
+, pages =       "97--108"
+, annote =      "NN-rule classifies a point according to class of
+                 nearest point. That is VD of point sets. Redundant
+                 points for this can be discarded."
 }
 
 @article{te-cacmh-83
-, author =	"G. T. Toussaint and H. ElGindy"
-, title =	"A counterexample to an algorithm for computing monotone hulls of simple polygons"
-, journal =	"Pattern Recogn. Lett."
-, volume =	1
-, year =	1983
-, pages =	"219--222"
+, author =      "G. T. Toussaint and H. ElGindy"
+, title =       "A counterexample to an algorithm for computing monotone hulls of simple polygons"
+, journal =     "Pattern Recogn. Lett."
+, volume =      1
+, year =        1983
+, pages =       "219--222"
 }
 
 @article{te-stmpl-84
-, author =	"G. T. Toussaint and H. ElGindy"
-, title =	"Separation of two monotone polygons in linear time"
-, journal =	"Robotica"
-, volume =	2
-, year =	1984
-, pages =	"215--220"
+, author =      "G. T. Toussaint and H. ElGindy"
+, title =       "Separation of two monotone polygons in linear time"
+, journal =     "Robotica"
+, volume =      2
+, year =        1984
+, pages =       "215--220"
 }
 
 @techreport{te-tgass-81
-, author =	"G. T. Toussaint and H. ElGindy"
-, title =	"Traditional galleries are star-shaped if every two paintings are visible from some common point"
-, type =	"Report"
-, number =	"SOCS-81.10"
-, institution =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1981
+, author =      "G. T. Toussaint and H. ElGindy"
+, title =       "Traditional galleries are star-shaped if every two paintings are visible from some common point"
+, type =        "Report"
+, number =      "SOCS-81.10"
+, institution = "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1981
 }
 
 @article{tm-soafm-82
-, author =	"G. T. Toussaint and M. A. McAlear"
-, title =	"A simple {$O(n \log n)$} algorithm for finding the maximum distance between two finite planar sets"
-, journal =	"Pattern Recogn. Lett."
-, volume =	1
-, year =	1982
-, pages =	"21--24"
+, author =      "G. T. Toussaint and M. A. McAlear"
+, title =       "A simple {$O(n \log n)$} algorithm for finding the maximum distance between two finite planar sets"
+, journal =     "Pattern Recogn. Lett."
+, volume =      1
+, year =        1982
+, pages =       "21--24"
 }
 
 @inproceedings{tm-facpr-80
-, author =	"G. T. Toussaint and R. Menard"
-, title =	"Fast algorithms for computing the planar relative neighborhood graph"
-, booktitle =	"Proc. 5th Sympos. Methods Oper. Res."
-, site =	"K{\"o}ln, West Germany"
-, year =	1980
-, pages =	"??"
+, author =      "G. T. Toussaint and R. Menard"
+, title =       "Fast algorithms for computing the planar relative neighborhood graph"
+, booktitle =   "Proc. 5th Sympos. Methods Oper. Res."
+, site =        "K{\"o}ln, West Germany"
+, year =        1980
+, pages =       "??"
 }
 
 @inproceedings{tp-snasi-79
-, author =	"G. T. Toussaint and R. S. Poulsen"
-, title =	"Some new algorithms and software implementation methods for pattern recognition research"
-, booktitle =	"Proc. IEEE Internat. Comput. Software Applications Conf."
-, year =	1979
-, pages =	"55--63"
+, author =      "G. T. Toussaint and R. S. Poulsen"
+, title =       "Some new algorithms and software implementation methods for pattern recognition research"
+, booktitle =   "Proc. IEEE Internat. Comput. Software Applications Conf."
+, year =        1979
+, pages =       "55--63"
 }
 
 @inproceedings{ts-snrmp-83
-, author =	"G. T. Toussaint and J.-R. Sack"
-, title =	"Some new results on moving polygons in the plane"
-, booktitle =	"Proc. Robotics, Intelligence and Productivity Conf."
-, site =	"Detroit, MI"
-, year =	1983
-, pages =	"158--163"
-, keywords =	"robotics, motion planning, separation, path planning, polygons, two-dimensional"
+, author =      "G. T. Toussaint and J.-R. Sack"
+, title =       "Some new results on moving polygons in the plane"
+, booktitle =   "Proc. Robotics, Intelligence and Productivity Conf."
+, site =        "Detroit, MI"
+, year =        1983
+, pages =       "158--163"
+, keywords =    "robotics, motion planning, separation, path planning, polygons, two-dimensional"
 }
 
 @phdthesis{t-iaf-84
-, author =	"B. M. Trager"
-, title =	"Integration of algebraic functions"
-, school =	"MIT"
-, year =	1984
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "B. M. Trager"
+, title =       "Integration of algebraic functions"
+, school =      "MIT"
+, year =        1984
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{t-nmaud-96
-, author =	"L. Trevisan"
-, title =	"A note on minimum-area upward drawing of complete and {Fibonacci} trees"
-, journal =	"Inform. Process. Lett."
-, volume =	57
-, number =	5
-, year =	1996
-, pages =	"231--236"
-, update =	"96.09 orourke"
+, author =      "L. Trevisan"
+, title =       "A note on minimum-area upward drawing of complete and {Fibonacci} trees"
+, journal =     "Inform. Process. Lett."
+, volume =      57
+, number =      5
+, year =        1996
+, pages =       "231--236"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{t-whmet-97
-, author =	"L. Trevisan"
-, title =	"When {Hamming} meets {Euclid}: The approximability of geometric {TSP} and {MST}"
-, booktitle =	"Proc. 29th Annu. ACM Sympos. Theory Comput."
-, nickname =	"STOC '97"
-, year =	1997
-, pages =	"21--29"
-, update =	"98.07 bibrelex, 98.03 mitchell+smid"
+, author =      "L. Trevisan"
+, title =       "When {Hamming} meets {Euclid}: The approximability of geometric {TSP} and {MST}"
+, booktitle =   "Proc. 29th Annu. ACM Sympos. Theory Comput."
+, nickname =    "STOC '97"
+, year =        1997
+, pages =       "21--29"
+, update =      "98.07 bibrelex, 98.03 mitchell+smid"
 }
 
 @inproceedings{t-dgds-88
-, author =	"H. Trickey"
-, title =	"Drag: {A} Graph Drawing System"
-, booktitle =	"Proc. Internat. Conf. on Electronic Publishing"
-, publisher =	"Cambridge University Press"
-, year =	1988
-, pages =	"171--182"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "H. Trickey"
+, title =       "Drag: {A} Graph Drawing System"
+, booktitle =   "Proc. Internat. Conf. on Electronic Publishing"
+, publisher =   "Cambridge University Press"
+, year =        1988
+, pages =       "171--182"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article {tk-frqmpq-20,
@@ -142527,968 +142527,968 @@ @article {tk-frqmpq-20
 }
 
 @book{td-cm-88
-, author =	"Anne Sjerp Troelstra and Dirk {van Dalen}"
-, title =	"Constructivism in Mathematics"
-, series =	"Studies in Logic and the Foundations of Mathematics"
-, publisher =	"Elsevier Science Publishers, North Holland"
-, address =	"Amsterdam"
-, year =	1988
-, update =	"98.11 bibrelex"
+, author =      "Anne Sjerp Troelstra and Dirk {van Dalen}"
+, title =       "Constructivism in Mathematics"
+, series =      "Studies in Logic and the Foundations of Mathematics"
+, publisher =   "Elsevier Science Publishers, North Holland"
+, address =     "Amsterdam"
+, year =        1988
+, update =      "98.11 bibrelex"
 }
 
 @book{t-cpos-92
-, author =	"William T. Trotter"
-, title =	"Combinatorics and Partially Ordered Sets: Dimension Theory"
-, series =	"Johns Hopkins Series in the Mathematical Sciences"
-, publisher =	"The Johns Hopkins University Press"
-, year =	1992
-, update =	"96.05 pascucci"
+, author =      "William T. Trotter"
+, title =       "Combinatorics and Partially Ordered Sets: Dimension Theory"
+, series =      "Johns Hopkins Series in the Mathematical Sciences"
+, publisher =   "The Johns Hopkins University Press"
+, year =        1992
+, update =      "96.05 pascucci"
 }
 
 @article{tm-dpp-77
-, author =	"W. T. Trotter and J. Moore"
-, title =	"The Dimension of Planar Posets"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	22
-, year =	1977
-, pages =	"54--67"
-, update =	"95.01 tamassia"
+, author =      "W. T. Trotter and J. Moore"
+, title =       "The Dimension of Planar Posets"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      22
+, year =        1977
+, pages =       "54--67"
+, update =      "95.01 tamassia"
 }
 
 @inproceedings{tw-oacp-97
-, author =	"Kuo-Hui Tsai and Da-Wei Wang"
-, title =	"Optimal Algorithm for Circle Partitioning"
-, booktitle =	"Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
-, nickname =	"COCOON '97"
-, site =	"Shanghai, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1276
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"304--310"
-, update =	"99.11 bibrelex, 98.03 mitchell"
+, author =      "Kuo-Hui Tsai and Da-Wei Wang"
+, title =       "Optimal Algorithm for Circle Partitioning"
+, booktitle =   "Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
+, nickname =    "COCOON '97"
+, site =        "Shanghai, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1276
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "304--310"
+, update =      "99.11 bibrelex, 98.03 mitchell"
 }
 
 @phdthesis{t-pvldp-93
-, author =	"L.-H. Tseng"
-, title =	"Some Polygon Visibility and Link Distance Problems"
-, school =	"Department of Electrical Engineering and Computer Science, Northwest University"
-, month =	jun
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "L.-H. Tseng"
+, title =       "Some Polygon Visibility and Link Distance Problems"
+, school =      "Department of Electrical Engineering and Computer Science, Northwest University"
+, month =       jun
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @article{thl-tgwsp-98
-, author =	"L. H. Tseng and P. Heffernan and D. T. Lee"
-, title =	"Two-Guard Walkability of Simple Polygons"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, number =	1
-, year =	1998
-, pages =	"85--116"
-, url =	"http://www.ece.nwu.edu/~dtlee/IJCGA_twoguard.ps.Z"
-, succeeds =	"tl-tgwsp-93"
-, update =	"98.11 bibrelex, 98.07 icking"
+, author =      "L. H. Tseng and P. Heffernan and D. T. Lee"
+, title =       "Two-Guard Walkability of Simple Polygons"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, number =      1
+, year =        1998
+, pages =       "85--116"
+, url = "http://www.ece.nwu.edu/~dtlee/IJCGA_twoguard.ps.Z"
+, succeeds =    "tl-tgwsp-93"
+, update =      "98.11 bibrelex, 98.07 icking"
 }
 
 @techreport{tl-tgwsp-93
-, author =	"L. H. Tseng and D. T. Lee"
-, title =	"Two-Guard Walkability of Simple Polygons"
-, type =	"Manuscript"
-, institution =	"Department of Electrical and Computer Engineering, Northwestern University"
-, year =	1993
-, precedes =	"thl-tgwsp-98"
-, update =	"98.11 bibrelex, 98.03 bibrelex"
+, author =      "L. H. Tseng and D. T. Lee"
+, title =       "Two-Guard Walkability of Simple Polygons"
+, type =        "Manuscript"
+, institution = "Department of Electrical and Computer Engineering, Northwestern University"
+, year =        1993
+, precedes =    "thl-tgwsp-98"
+, update =      "98.11 bibrelex, 98.03 bibrelex"
 }
 
 @article{tj-dftad-91
-, author =	"Y.-J. Tseng and S. Joshi"
-, title =	"Determining feasible tool-approach directions for machining {B{\'e}zier} curves and surfaces"
-, journal =	"Comput. Aided Design"
-, volume =	23
-, year =	1991
-, pages =	"367--379"
-, update =	"98.11 bibrelex"
+, author =      "Y.-J. Tseng and S. Joshi"
+, title =       "Determining feasible tool-approach directions for machining {B{\'e}zier} curves and surfaces"
+, journal =     "Comput. Aided Design"
+, volume =      23
+, year =        1991
+, pages =       "367--379"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{t-ltawv-89
-, author =	"N. Tsikopoulos"
-, title =	"A Linear Triangulation Algorithm for Weakly-Visible Polygons"
-, type =	"Technical {Report}"
-, number =	"89.03.81"
-, institution =	"Univ. of Patras"
-, address =	"Greece"
-, year =	1989
-, update =	"93.09 milone+mitchell"
+, author =      "N. Tsikopoulos"
+, title =       "A Linear Triangulation Algorithm for Weakly-Visible Polygons"
+, type =        "Technical {Report}"
+, number =      "89.03.81"
+, institution = "Univ. of Patras"
+, address =     "Greece"
+, year =        1989
+, update =      "93.09 milone+mitchell"
 }
 
 @article{t-hmao-84
-, author =	"T. Tsiligirides"
-, title =	"Heuristic Methods Applied to Orienteering"
-, journal =	"Journal of the Operational Research Society"
-, volume =	35
-, number =	9
-, year =	1984
-, pages =	"797--809"
-, update =	"98.03 mitchell"
+, author =      "T. Tsiligirides"
+, title =       "Heuristic Methods Applied to Orienteering"
+, journal =     "Journal of the Operational Research Society"
+, volume =      35
+, number =      9
+, year =        1984
+, pages =       "797--809"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{tw-fgvdp-90
-, author =	"Y. H. Tsin and C. A. Wang"
-, title =	"Finding geodesic {Voronoi} diagrams of points in the presence of rectilinear barriers"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"227--231"
-, cites =	"ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "Y. H. Tsin and C. A. Wang"
+, title =       "Finding geodesic {Voronoi} diagrams of points in the presence of rectilinear barriers"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "227--231"
+, cites =       "ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{tt-afplp-94
-, author =	"X. Tu and D. Terzopoulos"
-, title =	"Artificial fishes: Physics, locomotion, perception, behavior"
-, journal =	"Comput. Graph."
-, volume =	"??"
-, year =	1994
-, pages =	"43--50"
-, note =	"Proc. SIGGRAPH '94"
-, update =	"97.11 bibrelex"
+, author =      "X. Tu and D. Terzopoulos"
+, title =       "Artificial fishes: Physics, locomotion, perception, behavior"
+, journal =     "Comput. Graph."
+, volume =      "??"
+, year =        1994
+, pages =       "43--50"
+, note =        "Proc. SIGGRAPH '94"
+, update =      "97.11 bibrelex"
 }
 
 @article{tc-rsfcp-90
-, author =	"M. Tuceryan and T. Chorzempa"
-, title =	"Relative sensitivity of a family of closest-point graphs in computer vision applications"
-, journal =	"Pattern Recogn."
-, volume =	"??"
-, year =	1990
-, pages =	"361--373"
-, keywords =	"Voronoi tessellation, Delaunay triangulation, minimum spanning tree, relative neighborhood graph, Gabriel graph, closest-point graph, Hough transform, perceptual grouping, computer vision"
-, update =	"93.09 milone+mitchell"
+, author =      "M. Tuceryan and T. Chorzempa"
+, title =       "Relative sensitivity of a family of closest-point graphs in computer vision applications"
+, journal =     "Pattern Recogn."
+, volume =      "??"
+, year =        1990
+, pages =       "361--373"
+, keywords =    "Voronoi tessellation, Delaunay triangulation, minimum spanning tree, relative neighborhood graph, Gabriel graph, closest-point graph, Hough transform, perceptual grouping, computer vision"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{tj-tsuvp-90
-, author =	"M. Tuceryan and A. K. Jain"
-, title =	"Texture Segmentation Using {Voronoi} Polygons"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	12
-, number =	2
-, year =	1990
-, pages =	"211--216"
-, annote =	"Compute DT of points and area elongation etc for VPs.
-		 Break edges connecting dissimilar polygons."
+, author =      "M. Tuceryan and A. K. Jain"
+, title =       "Texture Segmentation Using {Voronoi} Polygons"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      12
+, number =      2
+, year =        1990
+, pages =       "211--216"
+, annote =      "Compute DT of points and area elongation etc for VPs.
+                 Break edges connecting dissimilar polygons."
 }
 
 @article{tw-oacpp-84
-, author =	"A. Tucker and D. Wilson"
-, title =	"An {$O(N^{2})$} algorithm for coloring perfect planar graphs"
-, journal =	"J. Algorithms"
-, volume =	5
-, year =	1984
-, pages =	"60--68"
+, author =      "A. Tucker and D. Wilson"
+, title =       "An {$O(N^{2})$} algorithm for coloring perfect planar graphs"
+, journal =     "J. Algorithms"
+, volume =      5
+, year =        1984
+, pages =       "60--68"
 }
 
 @book{t-ei-90
-, author =	"E. R. Tufte"
-, title =	"Envisioning Information"
-, publisher =	"Graphics Press"
-, address =	"Cheshire, Connecticut"
-, year =	1990
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "E. R. Tufte"
+, title =       "Envisioning Information"
+, publisher =   "Graphics Press"
+, address =     "Cheshire, Connecticut"
+, year =        1990
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @book{t-vdqi-83
-, author =	"E. R. Tufte"
-, title =	"The Visual Display of Quantative Information"
-, publisher =	"Graphics Press"
-, address =	"Cheshire, Connecticut"
-, year =	1983
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "E. R. Tufte"
+, title =       "The Visual Display of Quantative Information"
+, publisher =   "Graphics Press"
+, address =     "Cheshire, Connecticut"
+, year =        1983
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @techreport{t-padug-94
-, author =	"D. Tunkelang"
-, title =	"A practical approach to drawing undirected graphs"
-, type =	"Technical Report"
-, number =	"CMU-CS-94-161"
-, institution =	"School Comput. Sci., Carnegie Mellon University"
-, month =	jun
-, year =	1994
-, update =	"98.07 vismara"
+, author =      "D. Tunkelang"
+, title =       "A practical approach to drawing undirected graphs"
+, type =        "Technical Report"
+, number =      "CMU-CS-94-161"
+, institution = "School Comput. Sci., Carnegie Mellon University"
+, month =       jun
+, year =        1994
+, update =      "98.07 vismara"
 }
 
 @inproceedings{tbc-lnuig-97
-, author =	"Daniel Tunkelang and Roy J. Byrd and James W. Cooper"
-, title =	"Lexical Navigation: Using Incremental Graph Drawing for Query Refinement"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"316--321"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Daniel Tunkelang and Roy J. Byrd and James W. Cooper"
+, title =       "Lexical Navigation: Using Incremental Graph Drawing for Query Refinement"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "316--321"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @inproceedings{t-sman-94
-, author =	"S. T. Tuohy"
-, title =	"A Simulation Model for AUV Navigation"
-, booktitle =	"Proc. 1994 Symposium on Autonomous Underwater Vehicle Technology"
-, year =	1994
-, pages =	"470--478"
-, update =	"95.05 abrams"
+, author =      "S. T. Tuohy"
+, title =       "A Simulation Model for AUV Navigation"
+, booktitle =   "Proc. 1994 Symposium on Autonomous Underwater Vehicle Technology"
+, year =        1994
+, pages =       "470--478"
+, update =      "95.05 abrams"
 }
 
 @phdthesis{t-gmrai
-, author =	"S. T. Tuohy"
-, title =	"Geophysical Map Representation, Abstraction and Interrogation for Autonomous Underwater Vehicle Navigation"
-, type =	"Ph.{D}. Thesis"
-, school =	"Massachusetts Institute of Technology"
-, address =	"Cambridge, Massachusetts"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"95.05 abrams"
+, author =      "S. T. Tuohy"
+, title =       "Geophysical Map Representation, Abstraction and Interrogation for Autonomous Underwater Vehicle Navigation"
+, type =        "Ph.{D}. Thesis"
+, school =      "Massachusetts Institute of Technology"
+, address =     "Cambridge, Massachusetts"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "95.05 abrams"
 }
 
 @article{tb-ldahd-93
-, author =	"S. T. Tuohy and L. Bardis"
-, title =	"Low Degree Approximation of High Degree {B}-Spline Surfaces"
-, journal =	"Engineering with Computers"
-, volume =	9
-, number =	4
-, year =	1993
-, pages =	"198--209"
-, update =	"95.05 abrams"
+, author =      "S. T. Tuohy and L. Bardis"
+, title =       "Low Degree Approximation of High Degree {B}-Spline Surfaces"
+, journal =     "Engineering with Computers"
+, volume =      9
+, number =      4
+, year =        1993
+, pages =       "198--209"
+, update =      "95.05 abrams"
 }
 
 @article{tlbpc-mbnau-94
-, author =	"S. T. Tuohy and J. J. Leonard and J. G. Bellingham and N. M. Patrikalakis and C. Chryssostomidis"
-, title =	"Map Based Navigation for Autonomous Underwater Vehicles"
-, journal =	"International Journal of Offshore and Polar Engineering"
-, volume =	"??"
-, month =	"June/September"
-, year =	1995
-, note =	"To appear"
-, update =	"95.05 abrams"
+, author =      "S. T. Tuohy and J. J. Leonard and J. G. Bellingham and N. M. Patrikalakis and C. Chryssostomidis"
+, title =       "Map Based Navigation for Autonomous Underwater Vehicles"
+, journal =     "International Journal of Offshore and Polar Engineering"
+, volume =      "??"
+, month =       "June/September"
+, year =        1995
+, note =        "To appear"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{tmp-igmua-93
-, author =	"S. T. Tuohy and T. Maekawa and N. M. Patrikalakis"
-, title =	"Interrogation of Geophysical Maps with Uncertainty for AUV Micro-Navigation"
-, booktitle =	"Proc. Oceans '93: Engineering in Harmony with the Ocean"
-, year =	1993
-, update =	"95.05 abrams"
+, author =      "S. T. Tuohy and T. Maekawa and N. M. Patrikalakis"
+, title =       "Interrogation of Geophysical Maps with Uncertainty for AUV Micro-Navigation"
+, booktitle =   "Proc. Oceans '93: Engineering in Harmony with the Ocean"
+, year =        1993
+, update =      "95.05 abrams"
 }
 
 @inproceedings{tp-grmp-91
-, author =	"S. T. Tuohy and N. M. Patrikalakis"
-, title =	"Geometric Representation of Marine Propulsors"
-, booktitle =	"Proc. Marine Computers '91"
-, year =	1991
-, pages =	"CC5"
-, update =	"95.05 abrams"
+, author =      "S. T. Tuohy and N. M. Patrikalakis"
+, title =       "Geometric Representation of Marine Propulsors"
+, booktitle =   "Proc. Marine Computers '91"
+, year =        1991
+, pages =       "CC5"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{tp-rgmu-93
-, author =	"S. T. Tuohy and N. M. Patrikalakis"
-, title =	"Representation of Geophysical Maps with Uncertainty"
-, editor =	"N. Magnenat-Thalmann and D. Thalmann"
-, booktitle =	"Proc. CG International '93"
-, year =	1993
-, pages =	"179--192"
-, update =	"95.05 abrams"
+, author =      "S. T. Tuohy and N. M. Patrikalakis"
+, title =       "Representation of Geophysical Maps with Uncertainty"
+, editor =      "N. Magnenat-Thalmann and D. Thalmann"
+, booktitle =   "Proc. CG International '93"
+, year =        1993
+, pages =       "179--192"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{tplbc-anugm-93
-, author =	"S. T. Tuohy and N. M. Patrikalakis and J. J. Leonard and J. G. Bellingham and C. Chryssostomidis"
-, title =	"AUV Navigation Using Geophysical Maps with Uncertainty"
-, booktitle =	"Proc. 8th International Symposium on Unmanned Untethered Submersible Technology"
-, year =	1993
-, pages =	"265--276"
-, update =	"95.05 abrams"
+, author =      "S. T. Tuohy and N. M. Patrikalakis and J. J. Leonard and J. G. Bellingham and C. Chryssostomidis"
+, title =       "AUV Navigation Using Geophysical Maps with Uncertainty"
+, booktitle =   "Proc. 8th International Symposium on Unmanned Untethered Submersible Technology"
+, year =        1993
+, pages =       "265--276"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{typ-i3dng-95
-, author =	"S. T. Tuohy and J. W. Yoon and N. M. Patrikalakis"
-, title =	"Interrogation of 3-D Nonlinear Geophysical Databases"
-, editor =	"J. A. Vince and R. A. Earnshaw"
-, booktitle =	"Proc. CG International '95"
-, year =	1995
-, note =	"To appear"
-, update =	"95.05 abrams"
+, author =      "S. T. Tuohy and J. W. Yoon and N. M. Patrikalakis"
+, title =       "Interrogation of 3-D Nonlinear Geophysical Databases"
+, editor =      "J. A. Vince and R. A. Earnshaw"
+, booktitle =   "Proc. CG International '95"
+, year =        1995
+, note =        "To appear"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{typ-vsvod-95
-, author =	"S. T. Tuohy and J. W. Yoon and N. M. Patrikalakis"
-, title =	"Volumetric Splines for Visualization of Ocean Data"
-, booktitle =	"Proc. of Oceans '95"
-, year =	1995
-, note =	"To appear"
-, update =	"95.05 abrams"
+, author =      "S. T. Tuohy and J. W. Yoon and N. M. Patrikalakis"
+, title =       "Volumetric Splines for Visualization of Ocean Data"
+, booktitle =   "Proc. of Oceans '95"
+, year =        1995
+, note =        "To appear"
+, update =      "95.05 abrams"
 }
 
 @article{t-nw-77
-, author =	"P. Tur{\'a}n"
-, title =	"A note of welcome"
-, journal =	"J. Graph Theory"
-, volume =	1
-, year =	1977
-, pages =	"7--9"
-, update =	"98.03 bibrelex"
+, author =      "P. Tur{\'a}n"
+, title =       "A note of welcome"
+, journal =     "J. Graph Theory"
+, volume =      1
+, year =        1977
+, pages =       "7--9"
+, update =      "98.03 bibrelex"
 }
 
 @article{t-frnns-91
-, author =	"V. Turau"
-, title =	"Fixed-radius near neighbors search"
-, journal =	"Inform. Process. Lett."
-, volume =	39
-, year =	1991
-, pages =	"201--203"
-, update =	"98.03 devillers"
+, author =      "V. Turau"
+, title =       "Fixed-radius near neighbors search"
+, journal =     "Inform. Process. Lett."
+, volume =      39
+, year =        1991
+, pages =       "201--203"
+, update =      "98.03 devillers"
 }
 
 @techreport{t-icdmg-90
-, author =	"G. Turk"
-, title =	"Interactive collision detection for molecular graphics"
-, type =	"Technical {Report}"
-, number =	"90-014"
-, institution =	"Dept. Comput. Sci., Univ. North Carolina"
-, address =	"Chapel Hill, NC"
-, month =	jan
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "G. Turk"
+, title =       "Interactive collision detection for molecular graphics"
+, type =        "Technical {Report}"
+, number =      "90-014"
+, institution = "Dept. Comput. Sci., Univ. North Carolina"
+, address =     "Chapel Hill, NC"
+, month =       jan
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @article{t-rtps-92
-, author =	"G. Turk"
-, title =	"Re-tiling polygonal surfaces"
-, journal =	"Comput. Graphics"
-, volume =	26
-, number =	2
-, year =	1992
-, pages =	"55--64"
-, note =	"Proc. SIGGRAPH '92"
-, keywords =	"model simplification, automatic mesh generation, constrained triangulation, levels-of-detail, shape interpolation, approximation"
-, update =	"95.01 mitchell"
-, annote =	""
+, author =      "G. Turk"
+, title =       "Re-tiling polygonal surfaces"
+, journal =     "Comput. Graphics"
+, volume =      26
+, number =      2
+, year =        1992
+, pages =       "55--64"
+, note =        "Proc. SIGGRAPH '92"
+, keywords =    "model simplification, automatic mesh generation, constrained triangulation, levels-of-detail, shape interpolation, approximation"
+, update =      "95.01 mitchell"
+, annote =      ""
 }
 
 @article{tsgcv-atmcs-97
-, author =	"G. M. Turkiyyah and D. W. Storti and M. Ganter and H. Chen and M. Vimawala"
-, title =	"An Accelerated Triangulation Method for Computing the Skeletons of Free-Form Solid Models"
-, journal =	"Comput. Aided Design"
-, volume =	29
-, number =	1
-, month =	jan
-, year =	1997
-, pages =	"5--19"
-, update =	"97.11 held"
+, author =      "G. M. Turkiyyah and D. W. Storti and M. Ganter and H. Chen and M. Vimawala"
+, title =       "An Accelerated Triangulation Method for Computing the Skeletons of Free-Form Solid Models"
+, journal =     "Comput. Aided Design"
+, volume =      29
+, number =      1
+, month =       jan
+, year =        1997
+, pages =       "5--19"
+, update =      "97.11 held"
 }
 
 @techreport{t-psmfm-85
-, author =	"J. U. Turner"
-, title =	"Precise solid modeling with a faceted modeler"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. A74, IBM Corporation"
-, year =	1985
+, author =      "J. U. Turner"
+, title =       "Precise solid modeling with a faceted modeler"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. A74, IBM Corporation"
+, year =        1985
 }
 
 @article{t-flg-47
-, author =	"W. Tutte"
-, title =	"The factorization of linear graphs"
-, journal =	"J. London Math. Soc."
-, volume =	22
-, year =	1947
-, pages =	"107--111"
-, update =	"98.07 bibrelex"
+, author =      "W. Tutte"
+, title =       "The factorization of linear graphs"
+, journal =     "J. London Math. Soc."
+, volume =      22
+, year =        1947
+, pages =       "107--111"
+, update =      "98.07 bibrelex"
 }
 
 @article{t-cpt-62
-, author =	"W. T. Tutte"
-, title =	"A Census of Planar Triangulation"
-, journal =	"Canad. J. Math."
-, volume =	14
-, year =	1962
-, pages =	"21--38"
-, update =	"97.11 bibrelex"
+, author =      "W. T. Tutte"
+, title =       "A Census of Planar Triangulation"
+, journal =     "Canad. J. Math."
+, volume =      14
+, year =        1962
+, pages =       "21--38"
+, update =      "97.11 bibrelex"
 }
 
 @article{t-tpg-56
-, author =	"W. T. Tutte"
-, title =	"A theorem on planar graphs"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	82
-, year =	1956
-, pages =	"99--116"
-, update =	"98.11 bibrelex"
+, author =      "W. T. Tutte"
+, title =       "A theorem on planar graphs"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      82
+, year =        1956
+, pages =       "99--116"
+, update =      "98.11 bibrelex"
 }
 
 @article{t-bhcpg-77
-, author =	"W. T. Tutte"
-, title =	"Bridges and {Hamiltonian} circuits in planar graphs"
-, journal =	"Aequationes Mathematicae"
-, volume =	15
-, year =	1977
-, pages =	"1--33"
-, update =	"98.11 bibrelex"
+, author =      "W. T. Tutte"
+, title =       "Bridges and {Hamiltonian} circuits in planar graphs"
+, journal =     "Aequationes Mathematicae"
+, volume =      15
+, year =        1977
+, pages =       "1--33"
+, update =      "98.11 bibrelex"
 }
 
 @book{t-cg-66
-, author =	"W. T. Tutte"
-, title =	"Connectivity in Graphs"
-, publisher =	"University of Toronto Press"
-, year =	1966
-, update =	"97.11 bibrelex"
+, author =      "W. T. Tutte"
+, title =       "Connectivity in Graphs"
+, publisher =   "University of Toronto Press"
+, year =        1966
+, update =      "97.11 bibrelex"
 }
 
 @article{t-crg-60
-, author =	"W. T. Tutte"
-, title =	"Convex Representations of Graphs"
-, journal =	"Proceedings London Mathematical Society"
-, volume =	10
-, number =	38
-, year =	1960
-, pages =	"304--320"
-, keywords =	"graph drawing"
-, update =	"98.07 tamassia, 95.09 tamassia, 93.09 tamassia"
+, author =      "W. T. Tutte"
+, title =       "Convex Representations of Graphs"
+, journal =     "Proceedings London Mathematical Society"
+, volume =      10
+, number =      38
+, year =        1960
+, pages =       "304--320"
+, keywords =    "graph drawing"
+, update =      "98.07 tamassia, 95.09 tamassia, 93.09 tamassia"
 }
 
 @book{t-gt-84
-, author =	"W. T. Tutte"
-, title =	"Graph Theory"
-, publisher =	"Addison-Wesley"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "W. T. Tutte"
+, title =       "Graph Theory"
+, publisher =   "Addison-Wesley"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{t-hdg-63
-, author =	"W. T. Tutte"
-, title =	"How to Draw a Graph"
-, journal =	"Proceedings London Mathematical Society"
-, volume =	13
-, number =	52
-, year =	1963
-, pages =	"743--768"
-, keywords =	"graph drawing"
-, update =	"98.07 tamassia, 95.09 tamassia, 93.09 tamassia"
+, author =      "W. T. Tutte"
+, title =       "How to Draw a Graph"
+, journal =     "Proceedings London Mathematical Society"
+, volume =      13
+, number =      52
+, year =        1963
+, pages =       "743--768"
+, keywords =    "graph drawing"
+, update =      "98.07 tamassia, 95.09 tamassia, 93.09 tamassia"
 }
 
 @article{t-scg-59
-, author =	"W. T. Tutte"
-, title =	"On the Symmetry of Cubic Graphs"
-, journal =	"Proc. London Math. Soc."
-, volume =	10
-, year =	1959
-, pages =	"304--320"
-, update =	"97.11 bibrelex"
+, author =      "W. T. Tutte"
+, title =       "On the Symmetry of Cubic Graphs"
+, journal =     "Proc. London Math. Soc."
+, volume =      10
+, year =        1959
+, pages =       "304--320"
+, update =      "97.11 bibrelex"
 }
 
 @article{t-ttcn-70
-, author =	"W. T. Tutte"
-, title =	"Toward a theory of crossing numbers"
-, journal =	"J. Combin. Theory"
-, volume =	8
-, year =	1970
-, pages =	"45--53"
-, update =	"97.11 bibrelex"
+, author =      "W. T. Tutte"
+, title =       "Toward a theory of crossing numbers"
+, journal =     "J. Combin. Theory"
+, volume =      8
+, year =        1970
+, pages =       "45--53"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{t-wim-73
-, author =	"W. T. Tutte"
-, title =	"What is a Map?"
-, booktitle =	"New Directions in the Theory of Graphs"
-, publisher =	"Academic Press"
-, year =	1973
-, update =	"97.11 bibrelex"
+, author =      "W. T. Tutte"
+, title =       "What is a Map?"
+, booktitle =   "New Directions in the Theory of Graphs"
+, publisher =   "Academic Press"
+, year =        1973
+, update =      "97.11 bibrelex"
 }
 
 @article{t-cgcbs-84
-, author =	"Z. Tuza"
-, title =	"Covering of graphs by complete bipartite subgraphs: complexity of $0-1$ matrices"
-, journal =	"Combinatorica"
-, volume =	4
-, year =	1984
-, pages =	"111--116"
-, update =	"98.03 bibrelex"
+, author =      "Z. Tuza"
+, title =       "Covering of graphs by complete bipartite subgraphs: complexity of $0-1$ matrices"
+, journal =     "Combinatorica"
+, volume =      4
+, year =        1984
+, pages =       "111--116"
+, update =      "98.03 bibrelex"
 }
 
 @article{t-grt-66
-, author =	"H. Tverberg"
-, title =	"A generalization of {Radon}'s theorem"
-, journal =	"J. London Math. Soc."
-, volume =	41
-, year =	1966
-, pages =	"123--128"
-, update =	"97.11 bibrelex"
+, author =      "H. Tverberg"
+, title =       "A generalization of {Radon}'s theorem"
+, journal =     "J. London Math. Soc."
+, volume =      41
+, year =        1966
+, pages =       "123--128"
+, update =      "97.11 bibrelex"
 }
 
 @article{t-sppcs-79
-, author =	"H. Tverberg"
-, title =	"A separation property of plane convex sets"
-, journal =	"Math. Scand."
-, volume =	45
-, year =	1979
-, pages =	"225--260"
+, author =      "H. Tverberg"
+, title =       "A separation property of plane convex sets"
+, journal =     "Math. Scand."
+, volume =      45
+, year =        1979
+, pages =       "225--260"
 }
 
 @article{t-pgcct-89
-, author =	"H. Tverberg"
-, title =	"Proof of {Gr{\"u}nbaum}'s conjecture on common transversals for translates"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"191--203"
-, update =	"93.09 rote"
+, author =      "H. Tverberg"
+, title =       "Proof of {Gr{\"u}nbaum}'s conjecture on common transversals for translates"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "191--203"
+, update =      "93.09 rote"
 }
 
 @article{uot-cdms-83
-, author =	"T. Uchiki and T. Ohashi and M. Tokoro"
-, title =	"Collision Detection in Motion Simulation"
-, journal =	"Comput. \& Graphics"
-, volume =	7
-, number =	"3--4"
-, year =	1983
-, pages =	"285--293"
-, update =	"95.01 mitchell"
+, author =      "T. Uchiki and T. Ohashi and M. Tokoro"
+, title =       "Collision Detection in Motion Simulation"
+, journal =     "Comput. \& Graphics"
+, volume =      7
+, number =      "3--4"
+, year =        1983
+, pages =       "285--293"
+, update =      "95.01 mitchell"
 }
 
 @inproceedings{ut-r3dso-97
-, author =	"G{\"o}kt{\"u}rk {\"U}{\c c}oluk and {\.I}. Hakk{\i} Toroslu"
-, title =	"Reconstruction of 3--{D} Surface Object from its Pieces"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"187--192"
-, update =	"97.11 jones"
+, author =      "G{\"o}kt{\"u}rk {\"U}{\c c}oluk and {\.I}. Hakk{\i} Toroslu"
+, title =       "Reconstruction of 3--{D} Surface Object from its Pieces"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "187--192"
+, update =      "97.11 jones"
 }
 
 @inproceedings{u-cdacc-77
-, author =	"S. Udupa"
-, title =	"Collision detection and avoidance in computer controlled manipulators"
-, booktitle =	"Proc. Internat. Joint Conf. Artif. Intell."
-, year =	1977
-, pages =	"737--748"
-, update =	"98.03 bibrelex"
+, author =      "S. Udupa"
+, title =       "Collision detection and avoidance in computer controlled manipulators"
+, booktitle =   "Proc. Internat. Joint Conf. Artif. Intell."
+, year =        1977
+, pages =       "737--748"
+, update =      "98.03 bibrelex"
 }
 
 % ### others?
 @article{uo-cibtd-88
-, author =	"J. L. Udy and others"
-, title =	"Computation of Interferences between Three-Dimensional Objects and the Optimal Packing Problem"
-, journal =	"Adv. Eng. Softw."
-, volume =	10
-, number =	1
-, year =	1988
-, pages =	"8--12"
-, update =	"93.09 held"
+, author =      "J. L. Udy and others"
+, title =       "Computation of Interferences between Three-Dimensional Objects and the Optimal Packing Problem"
+, journal =     "Adv. Eng. Softw."
+, volume =      10
+, number =      1
+, year =        1988
+, pages =       "8--12"
+, update =      "93.09 held"
 }
 
 @book{u-ascan-84
-, author =	"L. Uhr"
-, title =	"Algorithms- Structured Computer Arrays and Networks"
-, publisher =	"Academic Press"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "L. Uhr"
+, title =       "Algorithms- Structured Computer Arrays and Networks"
+, publisher =   "Academic Press"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{u-lrcnt-72
-, author =	"L. Uhr"
-, title =	"Layered ``recognition cone'' networks that preprocess, classify and describe"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-21"
-, year =	1972
-, pages =	"758--768"
-, update =	"97.11 bibrelex"
+, author =      "L. Uhr"
+, title =       "Layered ``recognition cone'' networks that preprocess, classify and describe"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-21"
+, year =        1972
+, pages =       "758--768"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{u-pcv-60
-, author =	"S. M. Ulam"
-, title =	"A Problem in the Calculus of Variations"
-, chapter =	"VI, Section 9"
-, booktitle =	"A Collection of Mathematical Problems"
-, publisher =	"Interscience Publishers"
-, year =	1960
-, update =	"98.03 bibrelex"
+, author =      "S. M. Ulam"
+, title =       "A Problem in the Calculus of Variations"
+, chapter =     "VI, Section 9"
+, booktitle =   "A Collection of Mathematical Problems"
+, publisher =   "Interscience Publishers"
+, year =        1960
+, update =      "98.03 bibrelex"
 }
 
 @book{u-pmm-64
-, author =	"S. M. Ulam"
-, title =	"Problems of Modern Mathematics"
-, publisher =	"Science Editions"
-, address =	"New York"
-, year =	1964
-, update =	"97.11 bibrelex"
+, author =      "S. M. Ulam"
+, title =       "Problems of Modern Mathematics"
+, publisher =   "Science Editions"
+, address =     "New York"
+, year =        1964
+, update =      "97.11 bibrelex"
 }
 
 @book{u-cav-84
-, author =	"J. D. Ullman"
-, title =	"Computational Aspects of {VLSI}"
-, publisher =	"Computer Science Press"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "J. D. Ullman"
+, title =       "Computational Aspects of {VLSI}"
+, publisher =   "Computer Science Press"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @book{u-cav-92
-, author =	"J. D. Ullman"
-, title =	"Computational Aspects of {VLSI}"
-, publisher =	"Morgan-Kaufmann"
-, address =	"San Mateo, CA"
-, year =	1992
-, update =	"96.09 orourke"
+, author =      "J. D. Ullman"
+, title =       "Computational Aspects of {VLSI}"
+, publisher =   "Morgan-Kaufmann"
+, address =     "San Mateo, CA"
+, year =        1992
+, update =      "96.09 orourke"
 }
 
 @inproceedings{ul-hcsgg-97
-, author =	"Christopher Umans and William Lenhart"
-, title =	"Hamiltonian Cycles in Solid Grid Graphs"
-, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '97"
-, year =	1997
-, pages =	"496--507"
-, update =	"99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
+, author =      "Christopher Umans and William Lenhart"
+, title =       "Hamiltonian Cycles in Solid Grid Graphs"
+, booktitle =   "Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '97"
+, year =        1997
+, pages =       "496--507"
+, update =      "99.11 bibrelex, 98.07 bibrelex, 98.03 mitchell"
 }
 
 @mastersthesis{u-sp1s-95
-, author =	"H. Umemoto"
-, title =	"Searching a polygon by $1$-searchers"
-, school =	"Hiroshima Univ."
-, address =	"Hiroshima, Japan"
-, year =	1995
-, keywords =	"master thesis"
-, update =	"98.07 bibrelex"
+, author =      "H. Umemoto"
+, title =       "Searching a polygon by $1$-searchers"
+, school =      "Hiroshima Univ."
+, address =     "Hiroshima, Japan"
+, year =        1995
+, keywords =    "master thesis"
+, update =      "98.07 bibrelex"
 }
 
 @article{u-2nnpd-82
-, author =	"P. Ungar"
-, title =	"$2$n noncollinear points determine at least $2$n directions"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	33
-, year =	1982
-, pages =	"343--347"
-, update =	"97.11 bibrelex"
+, author =      "P. Ungar"
+, title =       "$2$n noncollinear points determine at least $2$n directions"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      33
+, year =        1982
+, pages =       "343--347"
+, update =      "97.11 bibrelex"
 }
 
 @article{u-opcp-96
-, author =	"M. Urabe"
-, title =	"On a partition into convex polygons"
-, journal =	"Discrete Appl. Math."
-, volume =	64
-, year =	1996
-, pages =	"179--191"
-, update =	"99.11 smid"
+, author =      "M. Urabe"
+, title =       "On a partition into convex polygons"
+, journal =     "Discrete Appl. Math."
+, volume =      64
+, year =        1996
+, pages =       "179--191"
+, update =      "99.11 smid"
 }
 
 @inproceedings{u-ppscp-97
-, author =	"Masatsugu Urabe"
-, title =	"On a Partition of Point Sets into Convex Polygons"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"21--24"
-, update =	"97.11 jones"
+, author =      "Masatsugu Urabe"
+, title =       "On a Partition of Point Sets into Convex Polygons"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "21--24"
+, update =      "97.11 jones"
 }
 
 @article{u-ppsdc-99
-, author =	"M. Urabe"
-, title =	"Partitioning point sets into disjoint convex polytopes"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	13
-, year =	1999
-, pages =	"173--178"
-, update =	"99.11 smid"
+, author =      "M. Urabe"
+, title =       "Partitioning point sets into disjoint convex polytopes"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      13
+, year =        1999
+, pages =       "173--178"
+, update =      "99.11 smid"
 }
 
 @article{uw-ccm-92
-, author =	"M. Urabe and M. Watanabe"
-, title =	"On a counterexample to a conjecture of {Mirzaian}"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	2
-, number =	1
-, year =	1992
-, pages =	"51--53"
-, update =	"95.01 mitchell"
+, author =      "M. Urabe and M. Watanabe"
+, title =       "On a counterexample to a conjecture of {Mirzaian}"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      2
+, number =      1
+, year =        1992
+, pages =       "51--53"
+, update =      "95.01 mitchell"
 }
 
 @techreport{u-gtcbl-??
-, author =	"R. Urquhart"
-, title =	"Graph theoretical clustering based on limited neighbourhood sets {II}"
-, type =	"Manuscript"
-, institution =	"Dept. Electron. Elect. Engrg., Univ. Glasgow"
-, address =	"Glasgow, Scotland"
-, year =	"??"
+, author =      "R. Urquhart"
+, title =       "Graph theoretical clustering based on limited neighbourhood sets {II}"
+, type =        "Manuscript"
+, institution = "Dept. Electron. Elect. Engrg., Univ. Glasgow"
+, address =     "Glasgow, Scotland"
+, year =        "??"
 }
 
 @techreport{u-ngdr-80
-, author =	"R. B. Urquhart"
-, title =	"A note on graphs defined by a region"
-, type =	"Internal {Report}"
-, number =	""
-, institution =	"Dept. Electron. Elect. Engrg., Univ. Glasgow"
-, address =	"Glasgow, Scotland"
-, year =	1980
-, update =	"94.05 devillers"
+, author =      "R. B. Urquhart"
+, title =       "A note on graphs defined by a region"
+, type =        "Internal {Report}"
+, number =      ""
+, institution = "Dept. Electron. Elect. Engrg., Univ. Glasgow"
+, address =     "Glasgow, Scotland"
+, year =        1980
+, update =      "94.05 devillers"
 }
 
 @techreport{u-ncsdt-80
-, author =	"R. B. Urquhart"
-, title =	"A note on the computation of subgraphs of the {Delaunay} triangulation"
-, type =	"Internal {Report}"
-, number =	""
-, institution =	"Dept. Electron. Elect. Engrg., Univ. Glasgow"
-, address =	"Glasgow, Scotland"
-, year =	1980
-, update =	"94.05 devillers"
+, author =      "R. B. Urquhart"
+, title =       "A note on the computation of subgraphs of the {Delaunay} triangulation"
+, type =        "Internal {Report}"
+, number =      ""
+, institution = "Dept. Electron. Elect. Engrg., Univ. Glasgow"
+, address =     "Glasgow, Scotland"
+, year =        1980
+, update =      "94.05 devillers"
 }
 
 @article{u-acrng-80
-, author =	"R. B. Urquhart"
-, title =	"Algorithms for computation of relative neighborhood graph"
-, journal =	"Electron. Lett."
-, volume =	16
-, year =	1980
-, pages =	"556--557"
+, author =      "R. B. Urquhart"
+, title =       "Algorithms for computation of relative neighborhood graph"
+, journal =     "Electron. Lett."
+, volume =      16
+, year =        1980
+, pages =       "556--557"
 }
 
 @article{u-gtcbl-82
-, author =	"R. B. Urquhart"
-, title =	"Graph theoretical clustering based on limited neighbourhood sets"
-, journal =	"Pattern Recogn."
-, volume =	15
-, year =	1982
-, pages =	"173--187"
+, author =      "R. B. Urquhart"
+, title =       "Graph theoretical clustering based on limited neighbourhood sets"
+, journal =     "Pattern Recogn."
+, volume =      15
+, year =        1982
+, pages =       "173--187"
 }
 
 @article{u-spper-83
-, author =	"R. B. Urquhart"
-, title =	"Some Properties of the Planar {Euclidean} Relative Neighbourhood Graph"
-, journal =	"Pattern Recogn. Lett."
-, volume =	1
-, year =	1983
-, pages =	"317--332"
-, update =	"98.11 bibrelex"
+, author =      "R. B. Urquhart"
+, title =       "Some Properties of the Planar {Euclidean} Relative Neighbourhood Graph"
+, journal =     "Pattern Recogn. Lett."
+, volume =      1
+, year =        1983
+, pages =       "317--332"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{um-ihcdb-81
-, author =	"R. B. Urquhart and J. E. S. Macleod"
-, title =	"Interactive hierarchic clustering: a display based on graph-theoretical methods"
-, booktitle =	"Proc. Internat. Conf. Cybernet. Soc."
-, year =	1981
-, pages =	"11--15"
+, author =      "R. B. Urquhart and J. E. S. Macleod"
+, title =       "Interactive hierarchic clustering: a display based on graph-theoretical methods"
+, booktitle =   "Proc. Internat. Conf. Cybernet. Soc."
+, year =        1981
+, pages =       "11--15"
 }
 
 @incollection{u-agip-00
-, author =	"Jorge Urrutia"
-, title =	"Art Gallery and Illumination Problems"
-, editor =	"J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
-, booktitle =	"Handbook of Computational Geometry"
-, publisher =	"North-Holland"
-, year =	2000
-, pages =	"973--1027"
-, keywords =	"visibility"
-, update =	"00.03 bibrelex+smid, 99.03 bibrelex, 96.09 orourke"
-, annote =	"Chapter 22 of su-hcg-00"
+, author =      "Jorge Urrutia"
+, title =       "Art Gallery and Illumination Problems"
+, editor =      "J{\"o}rg-R{\"u}diger Sack and Jorge Urrutia"
+, booktitle =   "Handbook of Computational Geometry"
+, publisher =   "North-Holland"
+, year =        2000
+, pages =       "973--1027"
+, keywords =    "visibility"
+, update =      "00.03 bibrelex+smid, 99.03 bibrelex, 96.09 orourke"
+, annote =      "Chapter 22 of su-hcg-00"
 }
 
 @phdthesis{u-igfpc-80
-, author =	"J. Urrutia"
-, title =	"Intersection Graphs of Some Families of Plane Curves"
-, school =	"University of Waterloo"
-, year =	1980
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "J. Urrutia"
+, title =       "Intersection Graphs of Some Families of Plane Curves"
+, school =      "University of Waterloo"
+, year =        1980
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{u-nieve-97
-, author =	"Jorge Urrutia"
-, title =	"On the Number of Internal and External Visibility Edges of Polygons"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"17--20"
-, update =	"97.11 jones"
+, author =      "Jorge Urrutia"
+, title =       "On the Number of Internal and External Visibility Edges of Polygons"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "17--20"
+, update =      "97.11 jones"
 }
 
 @incollection{u-poeg-89
-, author =	"J. Urrutia"
-, title =	"Partial orders and {Euclidean} geometry"
-, editor =	"I. Rival"
-, booktitle =	"Algorithms and Order"
-, publisher =	"Kluwer Academic Publishers"
-, year =	1989
-, pages =	"387--434"
-, keywords =	"combinatorial geometry, two-dimensional, three-dimensional"
-, annote =	"studies containment relations arising from families of
-		 points, circles, spheres, triangles, rectangles, etc."
+, author =      "J. Urrutia"
+, title =       "Partial orders and {Euclidean} geometry"
+, editor =      "I. Rival"
+, booktitle =   "Algorithms and Order"
+, publisher =   "Kluwer Academic Publishers"
+, year =        1989
+, pages =       "387--434"
+, keywords =    "combinatorial geometry, two-dimensional, three-dimensional"
+, annote =      "studies containment relations arising from families of
+                 points, circles, spheres, triangles, rectangles, etc."
 }
 
 @techreport{uz-ics-89
-, author =	"J. Urrutia and J. Zaks"
-, title =	"Illuminating convex sets"
-, type =	"Technical {Report}"
-, number =	"TR-89-31"
-, institution =	"Dept. Comput. Sci., Univ. Ottawa"
-, address =	"Ottawa, ON"
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "J. Urrutia and J. Zaks"
+, title =       "Illuminating convex sets"
+, type =        "Technical {Report}"
+, number =      "TR-89-31"
+, institution = "Dept. Comput. Sci., Univ. Ottawa"
+, address =     "Ottawa, ON"
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{u-ealie-82
-, author =	"S. Ursic"
-, title =	"The ellipsoid algorithm for linear inequalities in exact arithmetic"
-, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1982
-, pages =	"321--326"
+, author =      "S. Ursic"
+, title =       "The ellipsoid algorithm for linear inequalities in exact arithmetic"
+, booktitle =   "Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1982
+, pages =       "321--326"
 }
 
 @book{u-te-48
-, author =	"J. V. Uspensky"
-, title =	"Theory of Equations"
-, publisher =	"McGraw-Hill"
-, year =	1948
-, update =	"98.03 bibrelex"
+, author =      "J. V. Uspensky"
+, title =       "Theory of Equations"
+, publisher =   "McGraw-Hill"
+, year =        1948
+, update =      "98.03 bibrelex"
 }
 
 @article{us-hmsss-92
-, author =	"A. Y. Uteshev and S. G. Shulyak"
-, title =	"Hermite's method of separation of solutions of systems of algebraic equations and its applications"
-, journal =	"Linear Algebra and its Applications"
-, volume =	177
-, year =	1992
-, pages =	"49--88"
-, update =	"98.03 bibrelex"
+, author =      "A. Y. Uteshev and S. G. Shulyak"
+, title =       "Hermite's method of separation of solutions of systems of algebraic equations and its applications"
+, journal =     "Linear Algebra and its Applications"
+, volume =      177
+, year =        1992
+, pages =       "49--88"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{v-atmtd-74
-, author =	"H. Vaccaro"
-, title =	"Alternative Techniques for Modeling Travel Distance"
-, school =	"MIT"
-, year =	1974
-, keywords =	"doctoral thesis"
-, update =	"93.09 milone+mitchell"
+, author =      "H. Vaccaro"
+, title =       "Alternative Techniques for Modeling Travel Distance"
+, school =      "MIT"
+, year =        1974
+, keywords =    "doctoral thesis"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{vp-iopsp-91
-, author =	"M.-E. Vafiadou and N. M. Patrikalakis"
-, title =	"Interrogation of Offsets of Polynomial Surface Patches"
-, editor =	"F. H. Post and W. Barth"
-, booktitle =	"Eurographics '91, Proc. 12th Annual European Association for Computer Graphics Conference and Exhibition"
-, year =	1991
-, pages =	"247--259"
-, update =	"95.05 abrams"
+, author =      "M.-E. Vafiadou and N. M. Patrikalakis"
+, title =       "Interrogation of Offsets of Polynomial Surface Patches"
+, editor =      "F. H. Post and W. Barth"
+, booktitle =   "Eurographics '91, Proc. 12th Annual European Association for Computer Graphics Conference and Exhibition"
+, year =        1991
+, pages =       "247--259"
+, update =      "95.05 abrams"
 }
 
 @inproceedings{vh-fsemp-98
-, author =	"Jan Vahrenhold and Klaus H. Hinrichs"
-, title =	"Fast and Simple External-Memory Planar Point-Location"
-, booktitle =	"Abstracts 14th European Workshop Comput. Geom."
-, nickname =	"CG '98"
-, site =	"Barcelona"
-, publisher =	"Universitat Polyt{\`e}nica de Catalunya, Barcelona"
-, year =	1998
-, pages =	"139--140"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Jan Vahrenhold and Klaus H. Hinrichs"
+, title =       "Fast and Simple External-Memory Planar Point-Location"
+, booktitle =   "Abstracts 14th European Workshop Comput. Geom."
+, nickname =    "CG '98"
+, site =        "Barcelona"
+, publisher =   "Universitat Polyt{\`e}nica de Catalunya, Barcelona"
+, year =        1998
+, pages =       "139--140"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{v-famst-84
-, author =	"P. M. Vaidya"
-, title =	"A fast approximation for minimum spanning trees in $k$-dimensional space"
-, booktitle =	"Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1984
-, pages =	"403--407"
-, precedes =	"v-mstkd-88"
+, author =      "P. M. Vaidya"
+, title =       "A fast approximation for minimum spanning trees in $k$-dimensional space"
+, booktitle =   "Proc. 25th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1984
+, pages =       "403--407"
+, precedes =    "v-mstkd-88"
 }
 
 @inproceedings{v-namcf-89
-, author =	"P. M. Vaidya"
-, title =	"A new algorithm for minimizing convex functions over convex sets"
-, booktitle =	"Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1989
-, pages =	"338--343"
+, author =      "P. M. Vaidya"
+, title =       "A new algorithm for minimizing convex functions over convex sets"
+, booktitle =   "Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1989
+, pages =       "338--343"
 }
 
 @article{v-sgagc-91
-, author =	"P. M. Vaidya"
-, title =	"A sparse graph almost as good as the complete graph on points in {$K$} dimensions"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"369--381"
+, author =      "P. M. Vaidya"
+, title =       "A sparse graph almost as good as the complete graph on points in {$K$} dimensions"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "369--381"
 }
 
 @inproceedings{v-alpwr-87
-, author =	"P. M. Vaidya"
-, title =	"An algorithm for linear programming which requires {$O(((m+n)n^2+(m+n)^{1.5}n)L)$} arithmetic operations"
-, booktitle =	"Proc. 19th Annu. ACM Sympos. Theory Comput."
-, year =	1987
-, pages =	"29--38"
-, precedes =	"v-alpwr-90"
+, author =      "P. M. Vaidya"
+, title =       "An algorithm for linear programming which requires {$O(((m+n)n^2+(m+n)^{1.5}n)L)$} arithmetic operations"
+, booktitle =   "Proc. 19th Annu. ACM Sympos. Theory Comput."
+, year =        1987
+, pages =       "29--38"
+, precedes =    "v-alpwr-90"
 }
 
 @article{v-alpwr-90
-, author =	"P. M. Vaidya"
-, title =	"An algorithm for linear programming which requires {$O(((m+n)n^2+(m+n)^{1.5}n)L)$} arithmetic operations"
-, journal =	"Math. Program."
-, volume =	47
-, year =	1990
-, pages =	"175--201"
-, succeeds =	"v-alpwr-87"
+, author =      "P. M. Vaidya"
+, title =       "An algorithm for linear programming which requires {$O(((m+n)n^2+(m+n)^{1.5}n)L)$} arithmetic operations"
+, journal =     "Math. Program."
+, volume =      47
+, year =        1990
+, pages =       "175--201"
+, succeeds =    "v-alpwr-87"
 }
 
 @article{v-oaann-89
-, author =	"P. M. Vaidya"
-, title =	"An {$O(n \log n)$} algorithm for the all-nearest-neighbors problem"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"101--115"
-, succeeds =	"v-oaann-86"
+, author =      "P. M. Vaidya"
+, title =       "An {$O(n \log n)$} algorithm for the all-nearest-neighbors problem"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "101--115"
+, succeeds =    "v-oaann-86"
 }
 
 @inproceedings{v-oaann-86
-, author =	"P. M. Vaidya"
-, title =	"An optimal algorithm for the all-nearest-neighbors problem"
-, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1986
-, pages =	"117--122"
-, precedes =	"v-oaann-89"
+, author =      "P. M. Vaidya"
+, title =       "An optimal algorithm for the all-nearest-neighbors problem"
+, booktitle =   "Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1986
+, pages =       "117--122"
+, precedes =    "v-oaann-89"
 }
 
 @article{v-amwmp-89
-, author =	"P. M. Vaidya"
-, title =	"Approximate minimum weight matching on points in $k$-dimensional space"
-, journal =	"Algorithmica"
-, volume =	4
-, year =	1989
-, pages =	"569--583"
-, keywords =	"matchings, approximation, $d$-dimensional"
+, author =      "P. M. Vaidya"
+, title =       "Approximate minimum weight matching on points in $k$-dimensional space"
+, journal =     "Algorithmica"
+, volume =      4
+, year =        1989
+, pages =       "569--583"
+, keywords =    "matchings, approximation, $d$-dimensional"
 }
 
 @inproceedings{v-ghm-88
-, author =	"P. M. Vaidya"
-, title =	"Geometry helps in matching"
-, booktitle =	"Proc. 20th Annu. ACM Sympos. Theory Comput."
-, year =	1988
-, pages =	"422--435"
-, precedes =	"v-ghm-89"
+, author =      "P. M. Vaidya"
+, title =       "Geometry helps in matching"
+, booktitle =   "Proc. 20th Annu. ACM Sympos. Theory Comput."
+, year =        1988
+, pages =       "422--435"
+, precedes =    "v-ghm-89"
 }
 
 @article{v-ghm-89
-, author =	"P. M. Vaidya"
-, title =	"Geometry helps in matching"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, year =	1989
-, pages =	"1201--1225"
-, succeeds =	"v-ghm-88"
+, author =      "P. M. Vaidya"
+, title =       "Geometry helps in matching"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, year =        1989
+, pages =       "1201--1225"
+, succeeds =    "v-ghm-88"
 }
 
 @article{v-mstkd-88
-, author =	"P. M. Vaidya"
-, title =	"Minimum spanning trees in $k$-dimensional space"
-, journal =	"SIAM J. Comput."
-, volume =	17
-, year =	1988
-, pages =	"572--582"
-, succeeds =	"v-famst-84"
-, update =	"98.03 mitchell"
-, annote =	"He gives an $O(\epsilon^{-d} n\log n)$ algorithm to get
+, author =      "P. M. Vaidya"
+, title =       "Minimum spanning trees in $k$-dimensional space"
+, journal =     "SIAM J. Comput."
+, volume =      17
+, year =        1988
+, pages =       "572--582"
+, succeeds =    "v-famst-84"
+, update =      "98.03 mitchell"
+, annote =      "He gives an $O(\epsilon^{-d} n\log n)$ algorithm to get
                   within factor $(1+\epsilon)$ of optimal, for the
                   $L_q$ metrics.  He also gives a nearly linear
                   expected time algorithm for $n$
@@ -143499,969 +143499,969 @@ @article{v-mstkd-88
 }
 
 @inproceedings{v-rpccl-90
-, author =	"P. M. Vaidya"
-, title =	"Reducing the parallel complexity of certain linear programming problems"
-, booktitle =	"Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1990
-, pages =	"583--589"
+, author =      "P. M. Vaidya"
+, title =       "Reducing the parallel complexity of certain linear programming problems"
+, booktitle =   "Proc. 31st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1990
+, pages =       "583--589"
 }
 
 @inproceedings{v-sttor-85
-, author =	"P. M. Vaidya"
-, title =	"Space-time tradeoffs for orthogonal range queries"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
-, year =	1985
-, pages =	"169--174"
-, precedes =	"v-sttor-89"
+, author =      "P. M. Vaidya"
+, title =       "Space-time tradeoffs for orthogonal range queries"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Theory Comput."
+, year =        1985
+, pages =       "169--174"
+, precedes =    "v-sttor-89"
 }
 
 @article{v-sttor-89
-, author =	"P. M. Vaidya"
-, title =	"Space-time tradeoffs for orthogonal range queries"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, year =	1989
-, pages =	"748--758"
-, succeeds =	"v-sttor-85"
+, author =      "P. M. Vaidya"
+, title =       "Space-time tradeoffs for orthogonal range queries"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, year =        1989
+, pages =       "748--758"
+, succeeds =    "v-sttor-85"
 }
 
 @article{v-fmep-90
-, author =	"A. Vainshtein"
-, title =	"Finding minimal enclosing parallelograms"
-, journal =	"Diskretnaya Matematika"
-, volume =	2
-, year =	1990
-, pages =	"72--81"
-, note =	"In Russian"
-, update =	"98.03 bibrelex"
+, author =      "A. Vainshtein"
+, title =       "Finding minimal enclosing parallelograms"
+, journal =     "Diskretnaya Matematika"
+, volume =      2
+, year =        1990
+, pages =       "72--81"
+, note =        "In Russian"
+, update =      "98.03 bibrelex"
 }
 
 @article{v-cpe-82
-, author =	"V. K. Vaishnavi"
-, title =	"Computing point enclosures"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-31"
-, year =	1982
-, pages =	"22--29"
+, author =      "V. K. Vaishnavi"
+, title =       "Computing point enclosures"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-31"
+, year =        1982
+, pages =       "22--29"
 }
 
 @article{v-mhbt-83
-, author =	"V. K. Vaishnavi"
-, title =	"Multidimensional height-balanced trees"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-32"
-, year =	1983
-, pages =	"334--343"
+, author =      "V. K. Vaishnavi"
+, title =       "Multidimensional height-balanced trees"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-32"
+, year =        1983
+, pages =       "334--343"
 }
 
 @techreport{v-owcar-79
-, author =	"V. K. Vaishnavi"
-, title =	"Optimal worst-case algorithms for rectangle intersection and batched range searching problems"
-, type =	"Report"
-, number =	"79-CS-12"
-, institution =	"Unit Comput. Sci., McMaster Univ."
-, address =	"Hamilton, ON"
-, year =	1979
+, author =      "V. K. Vaishnavi"
+, title =       "Optimal worst-case algorithms for rectangle intersection and batched range searching problems"
+, type =        "Report"
+, number =      "79-CS-12"
+, institution = "Unit Comput. Sci., McMaster Univ."
+, address =     "Hamilton, ON"
+, year =        1979
 }
 
 @article{vkw-stoac-80
-, author =	"V. K. Vaishnavi and H. P. Kriegel and D. Wood"
-, title =	"Space and time optimal algorithms for a class of rectangle intersection problems"
-, journal =	"Inform. Sci."
-, volume =	21
-, year =	1980
-, pages =	"59--67"
+, author =      "V. K. Vaishnavi and H. P. Kriegel and D. Wood"
+, title =       "Space and time optimal algorithms for a class of rectangle intersection problems"
+, journal =     "Inform. Sci."
+, volume =      21
+, year =        1980
+, pages =       "59--67"
 }
 
 @article{vw-dsrce-80
-, author =	"V. K. Vaishnavi and D. Wood"
-, title =	"Data structures for the rectangle containment and enclosure problems"
-, journal =	"Comput. Graph. Image Process."
-, volume =	13
-, year =	1980
-, pages =	"372--384"
+, author =      "V. K. Vaishnavi and D. Wood"
+, title =       "Data structures for the rectangle containment and enclosure problems"
+, journal =     "Comput. Graph. Image Process."
+, volume =      13
+, year =        1980
+, pages =       "372--384"
 }
 
 @article{vw-rlsil-82
-, author =	"V. K. Vaishnavi and D. Wood"
-, title =	"Rectilinear line segment intersection, layered segment trees and dynamization"
-, journal =	"J. Algorithms"
-, volume =	3
-, year =	1982
-, pages =	"160--176"
+, author =      "V. K. Vaishnavi and D. Wood"
+, title =       "Rectilinear line segment intersection, layered segment trees and dynamization"
+, journal =     "J. Algorithms"
+, volume =      3
+, year =        1982
+, pages =       "160--176"
 }
 
 @article{vtl-rspd-82
-, author =	"J. Valdes and R. E. Tarjan and E. L. Lawler"
-, title =	"The Recognition of Series-Parallel Digraphs"
-, journal =	"SIAM J. Comput."
-, volume =	11
-, number =	2
-, year =	1982
-, pages =	"298--313"
-, update =	"94.05 tamassia"
+, author =      "J. Valdes and R. E. Tarjan and E. L. Lawler"
+, title =       "The Recognition of Series-Parallel Digraphs"
+, journal =     "SIAM J. Comput."
+, volume =      11
+, number =      2
+, year =        1982
+, pages =       "298--313"
+, update =      "94.05 tamassia"
 }
 
 @inproceedings{v-msv-53
-, author =	"F. Valentine"
-, title =	"Minimal Sets of Visibility"
-, booktitle =	"Proc. Amer. Math. Soc."
-, volume =	4
-, year =	1953
-, pages =	"917--921"
-, update =	"98.07 bibrelex"
+, author =      "F. Valentine"
+, title =       "Minimal Sets of Visibility"
+, booktitle =   "Proc. Amer. Math. Soc."
+, volume =      4
+, year =        1953
+, pages =       "917--921"
+, update =      "98.07 bibrelex"
 }
 
 @book{v-cs-64
-, author =	"Frederick Albert Valentine"
-, title =	"Convex Sets"
-, publisher =	"McGraw-Hill"
-, address =	"New York"
-, year =	1964
-, update =	"98.07 icking"
+, author =      "Frederick Albert Valentine"
+, title =       "Convex Sets"
+, publisher =   "McGraw-Hill"
+, address =     "New York"
+, year =        1964
+, update =      "98.07 icking"
 }
 
 @article{v-lcls-65
-, author =	"F. A. Valentine"
-, title =	"Local convexity and {$L_{n}$} sets"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	16
-, year =	1965
-, pages =	"1305--1310"
-, update =	"98.07 bibrelex"
+, author =      "F. A. Valentine"
+, title =       "Local convexity and {$L_{n}$} sets"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      16
+, year =        1965
+, pages =       "1305--1310"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{v-cca-79
-, author =	"L. Valiant"
-, title =	"Completeness classes in algebra"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Theory Comput."
-, year =	1979
-, pages =	"249--261"
-, update =	"95.01 devillers"
+, author =      "L. Valiant"
+, title =       "Completeness classes in algebra"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Theory Comput."
+, year =        1979
+, pages =       "249--261"
+, update =      "95.01 devillers"
 }
 
 @article{v-pcp-75
-, author =	"L. Valiant"
-, title =	"Parallelism in comparison problems"
-, journal =	"SIAM J. Comput."
-, volume =	4
-, number =	3
-, year =	1975
-, pages =	"348--355"
+, author =      "L. Valiant"
+, title =       "Parallelism in comparison problems"
+, journal =     "SIAM J. Comput."
+, volume =      4
+, number =      3
+, year =        1975
+, pages =       "348--355"
 }
 
 @article{v-smfmf-84
-, author =	"L. Valiant"
-, title =	"Short monotone formulae for the majority function"
-, journal =	"J. Algorithms"
-, volume =	5
-, year =	1984
-, pages =	"363--366"
-, update =	"98.03 bibrelex"
+, author =      "L. Valiant"
+, title =       "Short monotone formulae for the majority function"
+, journal =     "J. Algorithms"
+, volume =      5
+, year =        1984
+, pages =       "363--366"
+, update =      "98.03 bibrelex"
 }
 
 @article{v-ucvc-81
-, author =	"L. Valiant"
-, title =	"Universality Considerations in {VLSI} Circuits"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-30"
-, number =	2
-, year =	1981
-, pages =	"135--140"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "L. Valiant"
+, title =       "Universality Considerations in {VLSI} Circuits"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-30"
+, number =      2
+, year =        1981
+, pages =       "135--140"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{v-bmpc-90
-, author =	"L. G. Valiant"
-, title =	"A Bridging Model for Parallel Computation"
-, journal =	"Commun. ACM"
-, volume =	33
-, number =	8
-, year =	1990
-, pages =	"103--111"
-, update =	"98.11 kuehn, 96.09 orourke"
+, author =      "L. G. Valiant"
+, title =       "A Bridging Model for Parallel Computation"
+, journal =     "Commun. ACM"
+, volume =      33
+, number =      8
+, year =        1990
+, pages =       "103--111"
+, update =      "98.11 kuehn, 96.09 orourke"
 }
 
 @article{v-tl-84
-, author =	"L. G. Valiant"
-, title =	"A theory of the learnable"
-, journal =	"Commun. ACM"
-, volume =	27
-, number =	11
-, year =	1984
-, pages =	"1134--1142"
-, update =	"98.07 bibrelex"
+, author =      "L. G. Valiant"
+, title =       "A theory of the learnable"
+, journal =     "Commun. ACM"
+, volume =      27
+, number =      11
+, year =        1984
+, pages =       "1134--1142"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{v-gppa-90
-, author =	"L. G. Valiant"
-, title =	"General Purpose Parallel Architectures"
-, editor =	"J. van Leeuwen"
-, booktitle =	"Handbook of Theoretical Computer Science"
-, publisher =	"Elsevier/The MIT Press"
-, address =	"Amsterdam"
-, year =	1990
-, pages =	"943--972"
-, update =	"96.09 orourke"
+, author =      "L. G. Valiant"
+, title =       "General Purpose Parallel Architectures"
+, editor =      "J. van Leeuwen"
+, booktitle =   "Handbook of Theoretical Computer Science"
+, publisher =   "Elsevier/The MIT Press"
+, address =     "Amsterdam"
+, year =        1990
+, pages =       "943--972"
+, update =      "96.09 orourke"
 }
 
 @article{vv-niedu-86
-, author =	"L. G. Valiant and V. V. Vazirani"
-, title =	"NP is as easy as detecting unique solutions"
-, journal =	"Theoret. Comput. Sci."
-, volume =	47
-, year =	1986
-, pages =	"85--93"
-, update =	"98.03 bibrelex"
+, author =      "L. G. Valiant and V. V. Vazirani"
+, title =       "NP is as easy as detecting unique solutions"
+, journal =     "Theoret. Comput. Sci."
+, volume =      47
+, year =        1986
+, pages =       "85--93"
+, update =      "98.03 bibrelex"
 }
 
 @article{v-ubmmk-76
-, author =	"O. Vallarino"
-, title =	"On the use of bit maps for multiple key retrieval"
-, journal =	"SIGPLAN Notices"
-, volume =	11
-, year =	1976
-, pages =	"108--114"
+, author =      "O. Vallarino"
+, title =       "On the use of bit maps for multiple key retrieval"
+, journal =     "SIGPLAN Notices"
+, volume =      11
+, year =        1976
+, pages =       "108--114"
 }
 
 @article{v-cis7h-92
-, author =	"P. Valtr"
-, title =	"Convex independent sets and $7$-holes in restricted planar point sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"135--152"
+, author =      "P. Valtr"
+, title =       "Convex independent sets and $7$-holes in restricted planar point sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "135--152"
 }
 
 @inproceedings{v-gdkpc-97
-, author =	"Pavel Valtr"
-, title =	"Graph Drawings with no $k$ Pairwise Crossing Edges"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"205--218"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Pavel Valtr"
+, title =       "Graph Drawings with no $k$ Pairwise Crossing Edges"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "205--218"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{v-llpic-96
-, author =	"P. Valtr"
-, title =	"Lines, line-point incidences and crossing families in dense sets"
-, journal =	"Combinatorica"
-, volume =	16
-, year =	1996
-, pages =	"269--294"
-, update =	"98.03 agarwal"
+, author =      "P. Valtr"
+, title =       "Lines, line-point incidences and crossing families in dense sets"
+, journal =     "Combinatorica"
+, volume =      16
+, year =        1996
+, pages =       "269--294"
+, update =      "98.03 agarwal"
 }
 
 @article{v-mnepp-92
-, author =	"P. Valtr"
-, title =	"On the minimum number of empty polygons in planar point sets"
-, journal =	"Studia Sci. Math. Hungar."
-, volume =	30
-, year =	1995
-, pages =	"155--163"
-, update =	"02.03 devillers"
+, author =      "P. Valtr"
+, title =       "On the minimum number of empty polygons in planar point sets"
+, journal =     "Studia Sci. Math. Hungar."
+, volume =      30
+, year =        1995
+, pages =       "155--163"
+, update =      "02.03 devillers"
 }
 
 @phdthesis{v-ppsbr-94
-, author =	"P. Valtr"
-, title =	"Planar point sets with bounded rations of distances"
-, school =	"Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
-, address =	"Berlin, Germany"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "P. Valtr"
+, title =       "Planar point sets with bounded rations of distances"
+, school =      "Fachbereich Mathematik, Freie Universit{\"a}t Berlin"
+, address =     "Berlin, Germany"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{v-srnle-92
-, author =	"P. Valtr"
-, title =	"Sets in ${R}^d$ with No Large Empty Convex Subsets"
-, journal =	"Discrete Appl. Math."
-, volume =	108
-, year =	1992
-, pages =	"115--124"
-, update =	"97.03 gaertner+salinger"
+, author =      "P. Valtr"
+, title =       "Sets in ${R}^d$ with No Large Empty Convex Subsets"
+, journal =     "Discrete Appl. Math."
+, volume =      108
+, year =        1992
+, pages =       "115--124"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{v-usias-94
-, author =	"P. Valtr"
-, title =	"Unit squares intersecting all secants of a square"
-, journal =	"Discrete Comput. Geom."
-, volume =	11
-, year =	1994
-, pages =	"235--239"
-, update =	"97.03 gaertner+salinger"
+, author =      "P. Valtr"
+, title =       "Unit squares intersecting all secants of a square"
+, journal =     "Discrete Comput. Geom."
+, volume =      11
+, year =        1994
+, pages =       "235--239"
+, update =      "97.03 gaertner+salinger"
 }
 
 @incollection{l-ga-90
-, author =	"J. {van Leeuwen}"
-, title =	"Graph algorithms"
-, editor =	"J. {van Leeuwen}"
-, booktitle =	"Handbook of Theoretical Computer Science"
-, volume =	"A"
-, publisher =	"Elsevier"
-, address =	"Amsterdam"
-, year =	1990
-, pages =	"525--631"
-, update =	"98.11 bibrelex"
+, author =      "J. {van Leeuwen}"
+, title =       "Graph algorithms"
+, editor =      "J. {van Leeuwen}"
+, booktitle =   "Handbook of Theoretical Computer Science"
+, volume =      "A"
+, publisher =   "Elsevier"
+, address =     "Amsterdam"
+, year =        1990
+, pages =       "525--631"
+, update =      "98.11 bibrelex"
 }
 
 @phdthesis{v-ltg-80
-, author =	"C. J. {Van Wyk}"
-, title =	"A language for typesetting graphics"
-, school =	"Sept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, month =	jun
-, year =	1980
-, note =	"Technical Report STAN-CS-80-803"
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "C. J. {Van Wyk}"
+, title =       "A language for typesetting graphics"
+, school =      "Sept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, month =       jun
+, year =        1980
+, note =        "Technical Report STAN-CS-80-803"
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{vv-chld-86
-, author =	"C. J. {Van Wyk} and J. S. Vitter"
-, title =	"The complexity of hashing with lazy deletion"
-, journal =	"Algorithmica"
-, volume =	1
-, year =	1986
-, pages =	"17--29"
-, update =	"94.09 vitter"
+, author =      "C. J. {Van Wyk} and J. S. Vitter"
+, title =       "The complexity of hashing with lazy deletion"
+, journal =     "Algorithmica"
+, volume =      1
+, year =        1986
+, pages =       "17--29"
+, update =      "94.09 vitter"
 }
 
 @book{v-inc-78
-, author =	"J. Vandergraft"
-, title =	"Introduction to Numerical Computation"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1978
-, update =	"98.03 bibrelex"
+, author =      "J. Vandergraft"
+, title =       "Introduction to Numerical Computation"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1978
+, update =      "98.03 bibrelex"
 }
 
 @article{v-sdcsf-64
-, author =	"A. B. {VanderLugt}"
-, title =	"Signal detection by complex spatial filtering"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	"IT-10"
-, number =	2
-, month =	apr
-, year =	1964
-, pages =	"139--145"
-, update =	"97.11 bibrelex"
+, author =      "A. B. {VanderLugt}"
+, title =       "Signal detection by complex spatial filtering"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      "IT-10"
+, number =      2
+, month =       apr
+, year =        1964
+, pages =       "139--145"
+, update =      "97.11 bibrelex"
 }
 
 @book{v-noted-84
-, author =	"G. N. Vanderplaats"
-, title =	"Numerical Optimization Techniques for Engineering Design"
-, publisher =	"McGraw-Hill"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "G. N. Vanderplaats"
+, title =       "Numerical Optimization Techniques for Engineering Design"
+, publisher =   "McGraw-Hill"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{v-bfcac-94
-, author =	"G. {Van{\v e}{\v c}ek, Jr.}"
-, title =	"Back-face Culling Applied to Collision Detection of Polyhedra"
-, journal =	"J. Visualizat. and Comput. Animation"
-, volume =	5
-, number =	1
-, year =	1994
-, update =	"97.03 held"
+, author =      "G. {Van{\v e}{\v c}ek, Jr.}"
+, title =       "Back-face Culling Applied to Collision Detection of Polyhedra"
+, journal =     "J. Visualizat. and Comput. Animation"
+, volume =      5
+, number =      1
+, year =        1994
+, update =      "97.03 held"
 }
 
 @article{v-bimsp-91
-, author =	"G. {Van{\v e}{\v c}ek Jr.}"
-, title =	"Brep-index: a multidimensional space partitioning tree"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	3
-, year =	1991
-, pages =	"243--261"
-, keywords =	"classification, Brep, BSP tree, data structures"
+, author =      "G. {Van{\v e}{\v c}ek Jr.}"
+, title =       "Brep-index: a multidimensional space partitioning tree"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      3
+, year =        1991
+, pages =       "243--261"
+, keywords =    "classification, Brep, BSP tree, data structures"
 }
 
 @article{vc-ucrfe-71
-, author =	"V. N. Vapnik and A. Y. Chervonenkis"
-, title =	"On the uniform convergence of relative frequencies of events to their probabilities"
-, journal =	"Theory Probab. Appl."
-, volume =	16
-, year =	1971
-, pages =	"264--280"
-, update =	"96.09 orourke"
+, author =      "V. N. Vapnik and A. Y. Chervonenkis"
+, title =       "On the uniform convergence of relative frequencies of events to their probabilities"
+, journal =     "Theory Probab. Appl."
+, volume =      16
+, year =        1971
+, pages =       "264--280"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{v-dcamc-98
-, author =	"K. Varadarajan"
-, title =	"A divide and conquer algorithm for min-cost perfect matching in the plane"
-, booktitle =	"Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '98"
-, year =	1998
-, pages =	"320--329"
-, update =	"01.11 orourke+smid"
+, author =      "K. Varadarajan"
+, title =       "A divide and conquer algorithm for min-cost perfect matching in the plane"
+, booktitle =   "Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '98"
+, year =        1998
+, pages =       "320--329"
+, update =      "01.11 orourke+smid"
 }
 
 @unpublished{va-aspp-96
-, author =	"K. Varadarajan and P. K. Agarwal"
-, title =	"Approximating shortest paths on a polyhedron"
-, year =	1996
-, note =	"unpublished manuscript"
-, update =	"97.03 agarwal"
+, author =      "K. Varadarajan and P. K. Agarwal"
+, title =       "Approximating shortest paths on a polyhedron"
+, year =        1996
+, note =        "unpublished manuscript"
+, update =      "97.03 agarwal"
 }
 
 @inproceedings{v-ampcu-96
-, author =	"Kasturi R. Varadarajan"
-, title =	"Approximating Monotone Polygonal Curves Using the Uniform Metric"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Comput. Geom."
-, year =	1996
-, pages =	"311--318"
-, cites =	"aaas-cvgbr-93, abosy-fmcnp-85, as-anspt-93, as-pm-92, ak-nthld-93, bks-lsctp-95, b-tcl-85, c-vsanl-88, cc-apcmn-92, dp-arnpr-73, et-apctt-94, fm-cpgcs-91, g-eplfa-94, ghms-apsml-93, h-patmn-93, hs-cmlpg-91, hs-sudpl-92, hs-fpfsp-91, ii-pacfa-88, kd-pamm-82, ks-ebago-93, lo-aalgb-92, m-alg-87, m-olcch-87, m-roass-91, mo-pca-88, s-ltaml-86, t-capcp-85, ZZZ"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 96.05 efrat"
+, author =      "Kasturi R. Varadarajan"
+, title =       "Approximating Monotone Polygonal Curves Using the Uniform Metric"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Comput. Geom."
+, year =        1996
+, pages =       "311--318"
+, cites =       "aaas-cvgbr-93, abosy-fmcnp-85, as-anspt-93, as-pm-92, ak-nthld-93, bks-lsctp-95, b-tcl-85, c-vsanl-88, cc-apcmn-92, dp-arnpr-73, et-apctt-94, fm-cpgcs-91, g-eplfa-94, ghms-apsml-93, h-patmn-93, hs-cmlpg-91, hs-sudpl-92, hs-fpfsp-91, ii-pacfa-88, kd-pamm-82, ks-ebago-93, lo-aalgb-92, m-alg-87, m-olcch-87, m-roass-91, mo-pca-88, s-ltaml-86, t-capcp-85, ZZZ"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 96.05 efrat"
 }
 
 @inproceedings{va-aspnp-97
-, author =	"Kasturi R. Varadarajan and Pankaj Agarwal"
-, title =	"Approximating Shortest Paths on an Nonconvex Polyhedron"
-, booktitle =	"Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '97"
-, year =	1997
-, pages =	"To appear"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "Kasturi R. Varadarajan and Pankaj Agarwal"
+, title =       "Approximating Shortest Paths on an Nonconvex Polyhedron"
+, booktitle =   "Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '97"
+, year =        1997
+, pages =       "To appear"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{va-aabnb-99
-, author =	"K. R. Varadarajan and Pankaj K. Agarwal"
-, title =	"Approximation algorithms for bipartite and non-bipartite matching in the plane"
-, booktitle =	"Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1999
-, pages =	"805--814"
-, update =	"99.03 agarwal"
+, author =      "K. R. Varadarajan and Pankaj K. Agarwal"
+, title =       "Approximation algorithms for bipartite and non-bipartite matching in the plane"
+, booktitle =   "Proc. 10th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1999
+, pages =       "805--814"
+, update =      "99.03 agarwal"
 }
 
 @inproceedings{va-laso-95
-, author =	"Kasturi R. Varadarajan and P. K. Agarwal"
-, title =	"Linear Approximation of Simple Objects"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"13--18"
-, update =	"96.05 agarwal, 95.09 jones"
+, author =      "Kasturi R. Varadarajan and P. K. Agarwal"
+, title =       "Linear Approximation of Simple Objects"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "13--18"
+, update =      "96.05 agarwal, 95.09 jones"
 }
 
 @article{va-laso-97
-, author =	"Kasturi R. Varadarajan and P. K. Agarwal"
-, title =	"Linear Approximation of Simple Objects"
-, journal =	"Inform. Process. Lett."
-, volume =	62
-, year =	1997
-, pages =	"89--94"
-, update =	"99.03 agarwal"
+, author =      "Kasturi R. Varadarajan and P. K. Agarwal"
+, title =       "Linear Approximation of Simple Objects"
+, journal =     "Inform. Process. Lett."
+, volume =      62
+, year =        1997
+, pages =       "89--94"
+, update =      "99.03 agarwal"
 }
 
 @techreport{v-ssidq-
-, author =	"T. Varady"
-, title =	"Surface-surface Intersections for Double-quadratic Parametric Patches in a Solid Modeller"
-, institution =	"Comput. Automation Res. Inst., Hungarian Academy of Science"
-, year =	"??"
-, update =	"97.11 bibrelex"
+, author =      "T. Varady"
+, title =       "Surface-surface Intersections for Double-quadratic Parametric Patches in a Solid Modeller"
+, institution = "Comput. Automation Res. Inst., Hungarian Academy of Science"
+, year =        "??"
+, update =      "97.11 bibrelex"
 }
 
 @article{v-ctdah-87
-, author =	"A. N. Varchenko"
-, title =	"Combinatorics and topology of the disposition of affine hyperplanes in real space"
-, journal =	"Funk. Anal. i Prilozhen."
-, volume =	21
-, number =	"N 1"
-, year =	1987
-, pages =	"11--22"
-, update =	"97.11 bibrelex"
+, author =      "A. N. Varchenko"
+, title =       "Combinatorics and topology of the disposition of affine hyperplanes in real space"
+, journal =     "Funk. Anal. i Prilozhen."
+, volume =      21
+, number =      "N 1"
+, year =        1987
+, pages =       "11--22"
+, update =      "97.11 bibrelex"
 }
 
 @article{vg-hfch-87
-, author =	"A. N. Varchenko and I. M. Gel\'fand"
-, title =	"On {Heavyside} functions of a configuration of hyperplanes"
-, journal =	"Funk. Anal. i Prilozhen."
-, volume =	21
-, number =	"N-4"
-, year =	1987
-, pages =	"1--18"
-, update =	"97.11 bibrelex"
+, author =      "A. N. Varchenko and I. M. Gel\'fand"
+, title =       "On {Heavyside} functions of a configuration of hyperplanes"
+, journal =     "Funk. Anal. i Prilozhen."
+, volume =      21
+, number =      "N-4"
+, year =        1987
+, pages =       "1--18"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{v-hga-94
-, author =	"A. Varshney"
-, title =	"Hierarchical Geometric Approximations"
-, type =	"Ph.{D}. Thesis"
-, school =	"Department of Computer Science, University of North Carolina"
-, address =	"Chapel Hill, NC 27599-3175"
-, year =	1994
-, note =	"TR-050-1994"
-, keywords =	"doctoral thesis"
-, update =	"95.01 mitchell"
+, author =      "A. Varshney"
+, title =       "Hierarchical Geometric Approximations"
+, type =        "Ph.{D}. Thesis"
+, school =      "Department of Computer Science, University of North Carolina"
+, address =     "Chapel Hill, NC 27599-3175"
+, year =        1994
+, note =        "TR-050-1994"
+, keywords =    "doctoral thesis"
+, update =      "95.01 mitchell"
 }
 
 @misc{vabww-mhgpm-94
-, author =	"A. Varshney and P. K. Agarwal and F. P. {Brooks, Jr.} and W. Wright and H. Weber"
-, title =	"Multiresolution hierarchy generation for polygonal models"
-, year =	1994
-, note =	"Manuscript"
-, update =	"95.09 agarwal, 95.05 agarwal"
+, author =      "A. Varshney and P. K. Agarwal and F. P. {Brooks, Jr.} and W. Wright and H. Weber"
+, title =       "Multiresolution hierarchy generation for polygonal models"
+, year =        1994
+, note =        "Manuscript"
+, update =      "95.09 agarwal, 95.05 agarwal"
 }
 
 @inproceedings{vb-facrs-93
-, author =	"A. Varshney and F. P. {Brooks, Jr.}"
-, title =	"Fast analytical computation of {Richard}'s smooth molecular surface"
-, booktitle =	"Proc. Visualization '93"
-, year =	1993
-, pages =	"300--307"
-, update =	"98.03 bibrelex"
+, author =      "A. Varshney and F. P. {Brooks, Jr.}"
+, title =       "Fast analytical computation of {Richard}'s smooth molecular surface"
+, booktitle =   "Proc. Visualization '93"
+, year =        1993
+, pages =       "300--307"
+, update =      "98.03 bibrelex"
 }
 
 @article{vbw-csms-94
-, author =	"A. Varshney and F. P. {Brooks, Jr.} and W. V. Wright"
-, title =	"Computing Smooth Molecular Surfaces"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	15
-, number =	5
-, month =	sep
-, year =	1994
-, pages =	"19--25"
-, keywords =	"Connolly surfaces, solvent-accessible surfaces, alpha shapes, alpha hulls"
-, update =	"98.03 agarwal+mitchell"
+, author =      "A. Varshney and F. P. {Brooks, Jr.} and W. V. Wright"
+, title =       "Computing Smooth Molecular Surfaces"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      15
+, number =      5
+, month =       sep
+, year =        1994
+, pages =       "19--25"
+, keywords =    "Connolly surfaces, solvent-accessible surfaces, alpha shapes, alpha hulls"
+, update =      "98.03 agarwal+mitchell"
 }
 
 @inproceedings{vbw-ivwtd-94
-, author =	"A. Varshney and F. P. {Brooks, Jr.} and W. V. Wright"
-, title =	"Interactive Visualization of Weighted Three-dimensional Alpha Hulls"
-, booktitle =	"Proc. 10th Annu. ACM Sympos. Comput. Geom."
-, year =	1994
-, pages =	"395--396"
-, keywords =	"video review"
-, cites =	"a-pdpaa-87, c-amsc-83, e-was-92, eks-sspp-83, em-tdas-94, ec-eargd-92, fpeggemtti-pp5hm-89, r-avpps-77, s-lpchm-90, vb-facrs-93, vwb-bnusi-93, ZZZ"
-, update =	"98.03 bibrelex, 94.09 jones"
+, author =      "A. Varshney and F. P. {Brooks, Jr.} and W. V. Wright"
+, title =       "Interactive Visualization of Weighted Three-dimensional Alpha Hulls"
+, booktitle =   "Proc. 10th Annu. ACM Sympos. Comput. Geom."
+, year =        1994
+, pages =       "395--396"
+, keywords =    "video review"
+, cites =       "a-pdpaa-87, c-amsc-83, e-was-92, eks-sspp-83, em-tdas-94, ec-eargd-92, fpeggemtti-pp5hm-89, r-avpps-77, s-lpchm-90, vb-facrs-93, vwb-bnusi-93, ZZZ"
+, update =      "98.03 bibrelex, 94.09 jones"
 }
 
 @techreport{vwb-bnusi-93
-, author =	"A. Varshney and W. V. Wright and F. P. {Brooks, Jr.}"
-, title =	"Bounding the number of unit spheres inside a larger sphere"
-, type =	"Technical {Report}"
-, number =	"UNC-CS-TR-93-039"
-, institution =	"Dept. Comput. Sci., Univ. North Carolina"
-, address =	"Chapel Hill, NC"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "A. Varshney and W. V. Wright and F. P. {Brooks, Jr.}"
+, title =       "Bounding the number of unit spheres inside a larger sphere"
+, type =        "Technical {Report}"
+, number =      "UNC-CS-TR-93-039"
+, institution = "Dept. Comput. Sci., Univ. North Carolina"
+, address =     "Chapel Hill, NC"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @article{v-cdsmt-92
-, author =	"V. A. Vassiliev"
-, title =	"Complements of discriminants of smooth maps: topology and applications"
-, journal =	"Tansl. of math. monographs"
-, volume =	98
-, year =	1992
-, note =	"Am. Math. Soc., Providence, Rhode Island"
-, update =	"98.11 bibrelex"
+, author =      "V. A. Vassiliev"
+, title =       "Complements of discriminants of smooth maps: topology and applications"
+, journal =     "Tansl. of math. monographs"
+, volume =      98
+, year =        1992
+, note =        "Am. Math. Soc., Providence, Rhode Island"
+, update =      "98.11 bibrelex"
 }
 
 @article{v-gspc-92
-, author =	"B. R. Vatti"
-, title =	"A generic solution to polygon clipping"
-, journal =	"Commun. ACM"
-, volume =	35
-, number =	7
-, year =	1992
-, pages =	"56--63"
+, author =      "B. R. Vatti"
+, title =       "A generic solution to polygon clipping"
+, journal =     "Commun. ACM"
+, volume =      35
+, number =      7
+, year =        1992
+, pages =       "56--63"
 }
 
 @article{v-ppt-80
-, author =	"J. Vaucher"
-, title =	"Pretty Printing of Trees"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	10
-, number =	7
-, year =	1980
-, pages =	"553--561"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Vaucher"
+, title =       "Pretty Printing of Trees"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      10
+, number =      7
+, year =        1980
+, pages =       "553--561"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @misc{v-qfemg-95
-, author =	"S. Vavasis"
-, title =	"QMG: a finite element mesh generation package"
-, url =	"https://www.cs.cornell.edu/info/people/vavasis/qmg-home.html"
-, update =	"97.11 bibrelex"
+, author =      "S. Vavasis"
+, title =       "QMG: a finite element mesh generation package"
+, url = "https://www.cs.cornell.edu/info/people/vavasis/qmg-home.html"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{v-adptd-90
-, author =	"S. A. Vavasis"
-, title =	"Automatic domain partitioning in three dimensions"
-, type =	"Technical {Report}"
-, number =	"TR~90-1082"
-, institution =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	jan
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "S. A. Vavasis"
+, title =       "Automatic domain partitioning in three dimensions"
+, type =        "Technical {Report}"
+, number =      "TR~90-1082"
+, institution = "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       jan
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @article{v-adptd-91
-, author =	"S. A. Vavasis"
-, title =	"Automatic domain partitioning in three dimensions"
-, journal =	"SIAM J. Sci. Statist. Comput."
-, volume =	"??"
-, year =	1991
-, note =	"To appear"
-, update =	"98.03 bibrelex"
+, author =      "S. A. Vavasis"
+, title =       "Automatic domain partitioning in three dimensions"
+, journal =     "SIAM J. Sci. Statist. Comput."
+, volume =      "??"
+, year =        1991
+, note =        "To appear"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{v-sfepw-93
-, author =	"S. A. Vavasis"
-, title =	"Stable finite elements for problems with wild coefficients"
-, number =	"93-1364"
-, institution =	"Cornell University"
-, address =	"Ithaca, NY"
-, year =	1993
-, update =	"97.11 bibrelex"
+, author =      "S. A. Vavasis"
+, title =       "Stable finite elements for problems with wild coefficients"
+, number =      "93-1364"
+, institution = "Cornell University"
+, address =     "Ithaca, NY"
+, year =        1993
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{vy-aipmw-94
-, author =	"Stephen A. Vavasis and Yinyu Ye"
-, title =	"An Accelerated Interior Point Method whose Running Time Depends only on $A$"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	""
-, update =	"94.01 jones"
+, author =      "Stephen A. Vavasis and Yinyu Ye"
+, title =       "An Accelerated Interior Point Method whose Running Time Depends only on $A$"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       ""
+, update =      "94.01 jones"
 }
 
 @inproceedings{vg-mlt-97
-, author =	"Eric Veach and Leonidas J. Guibas"
-, title =	"Metropolis Light Transport"
-, booktitle =	"SIGGRAPH 97 Conference Proceedings"
-, series =	"Annual Conference Series"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"Addison-Wesley"
-, year =	1997
-, pages =	"65--76"
-, update =	"98.03 agarwal"
+, author =      "Eric Veach and Leonidas J. Guibas"
+, title =       "Metropolis Light Transport"
+, booktitle =   "SIGGRAPH 97 Conference Proceedings"
+, series =      "Annual Conference Series"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "Addison-Wesley"
+, year =        1997
+, pages =       "65--76"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{vg-ocstm-95
-, author =	"Eric Veach and Leonidas J. Guibas"
-, title =	"Optimally Combining Sampling Techniques for {Monte} {Carlo} Rendering"
-, editor =	"Robert Cook"
-, booktitle =	"SIGGRAPH 95 Conference Proceedings"
-, series =	"Annual Conference Series"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"Addison-Wesley"
-, month =	aug
-, year =	1995
-, pages =	"419--428"
-, update =	"98.03 agarwal"
+, author =      "Eric Veach and Leonidas J. Guibas"
+, title =       "Optimally Combining Sampling Techniques for {Monte} {Carlo} Rendering"
+, editor =      "Robert Cook"
+, booktitle =   "SIGGRAPH 95 Conference Proceedings"
+, series =      "Annual Conference Series"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "Addison-Wesley"
+, month =       aug
+, year =        1995
+, pages =       "419--428"
+, update =      "98.03 agarwal"
 }
 
 @article{va-ldoro-88
-, author =	"J. Veenstra and N. Ahuja"
-, title =	"Line drawings of octree-represented objects"
-, journal =	"ACM Trans. Graph."
-, volume =	7
-, year =	1988
-, pages =	"61--75"
+, author =      "J. Veenstra and N. Ahuja"
+, title =       "Line drawings of octree-represented objects"
+, journal =     "ACM Trans. Graph."
+, volume =      7
+, year =        1988
+, pages =       "61--75"
 }
 
 @inproceedings{v-cccs-90
-, author =	"Gert Vegter"
-, title =	"Computational Complexity of Combinatorial Surfaces"
-, booktitle =	"Abstracts 6th Intern. Workshop Comput. Geom."
-, nickname =	"CG '90"
-, site =	"Siegen"
-, publisher =	"Universit{\"a}t Siegen"
-, year =	1990
-, pages =	25
-, update =	"00.03 bibrelex"
+, author =      "Gert Vegter"
+, title =       "Computational Complexity of Combinatorial Surfaces"
+, booktitle =   "Abstracts 6th Intern. Workshop Comput. Geom."
+, nickname =    "CG '90"
+, site =        "Siegen"
+, publisher =   "Universit{\"a}t Siegen"
+, year =        1990
+, pages =       25
+, update =      "00.03 bibrelex"
 }
 
 @incollection{v-ct-97
-, author =	"G. Vegter"
-, title =	"Computational topology"
-, chapter =	28
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"517--536"
-, update =	"97.11 orourke"
+, author =      "G. Vegter"
+, title =       "Computational topology"
+, chapter =     28
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "517--536"
+, update =      "97.11 orourke"
 }
 
 @techreport{v-cbrdf-87
-, author =	"G. Vegter"
-, title =	"Computing the bounded region determined by finitely many lines in the plane"
-, type =	"Report"
-, number =	"CS 8703"
-, institution =	"Dept. Math. and Comput. Sci., Univ. of Groningen"
-, address =	"Groningen, Netherlands"
-, year =	1987
-, update =	"95.01 smid"
+, author =      "G. Vegter"
+, title =       "Computing the bounded region determined by finitely many lines in the plane"
+, type =        "Report"
+, number =      "CS 8703"
+, institution = "Dept. Math. and Comput. Sci., Univ. of Groningen"
+, address =     "Groningen, Netherlands"
+, year =        1987
+, update =      "95.01 smid"
 }
 
 @inproceedings{v-dmvg-91
-, author =	"G. Vegter"
-, title =	"Dynamically maintaining the visibility graph"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"425--436"
-, keywords =	"visibility, geometric graph"
+, author =      "G. Vegter"
+, title =       "Dynamically maintaining the visibility graph"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "425--436"
+, keywords =    "visibility, geometric graph"
 }
 
 @article{v-kfdp-90
-, author =	"G. Vegter"
-, title =	"Kink-free deformation of polygons"
-, journal =	"Algorithms Rev."
-, volume =	1
-, number =	3
-, year =	1990
-, pages =	"125--137"
+, author =      "G. Vegter"
+, title =       "Kink-free deformation of polygons"
+, journal =     "Algorithms Rev."
+, volume =      1
+, number =      3
+, year =        1990
+, pages =       "125--137"
 }
 
 @inproceedings{v-kfdp-89
-, author =	"G. Vegter"
-, title =	"Kink-free deformations of polygons"
-, booktitle =	"Proc. 5th Annu. ACM Sympos. Comput. Geom."
-, year =	1989
-, pages =	"61--68"
-, cites =	"d-tdkaz-12, gkp-cm-89, my-chthu-88, s-rcrm-58, w-rccp-37, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "G. Vegter"
+, title =       "Kink-free deformations of polygons"
+, booktitle =   "Proc. 5th Annu. ACM Sympos. Comput. Geom."
+, year =        1989
+, pages =       "61--68"
+, cites =       "d-tdkaz-12, gkp-cm-89, my-chthu-88, s-rcrm-58, w-rccp-37, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{v-vddsv-90
-, author =	"G. Vegter"
-, title =	"The visibility diagram: {A} data structure for visibility problems and motion planning"
-, booktitle =	"Proc. 2nd Scand. Workshop Algorithm Theory"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	447
-, publisher =	"Springer-Verlag"
-, year =	1990
-, pages =	"97--110"
+, author =      "G. Vegter"
+, title =       "The visibility diagram: {A} data structure for visibility problems and motion planning"
+, booktitle =   "Proc. 2nd Scand. Workshop Algorithm Theory"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      447
+, publisher =   "Springer-Verlag"
+, year =        1990
+, pages =       "97--110"
 }
 
 @inproceedings{vy-mcs-91
-, author =	"G. Vegter and C. Yap"
-, title =	"Minimal circumscribing simplices"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"58--61"
-, cites =	"k-fcvm-86, kl-fstcg-85, mc-uafet-88, o-fmeb-84, oamb-oafme-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "G. Vegter and C. Yap"
+, title =       "Minimal circumscribing simplices"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "58--61"
+, cites =       "k-fcvm-86, kl-fstcg-85, mc-uafet-88, o-fmeb-84, oamb-oafme-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{vy-cccs-90
-, author =	"G. Vegter and C. K. Yap"
-, title =	"Computational complexity of combinatorial surfaces"
-, booktitle =	"Proc. 6th Annu. ACM Sympos. Comput. Geom."
-, year =	1990
-, pages =	"102--111"
-, cites =	"b-sctdm-22, ff-ict-34, h-gt-69, m-ati-77, my-chthu-88, m-eat-84, s-ctcgt-80, v-kfdp-89, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "G. Vegter and C. K. Yap"
+, title =       "Computational complexity of combinatorial surfaces"
+, booktitle =   "Proc. 6th Annu. ACM Sympos. Comput. Geom."
+, year =        1990
+, pages =       "102--111"
+, cites =       "b-sctdm-22, ff-ict-34, h-gt-69, m-ati-77, my-chthu-88, m-eat-84, s-ctcgt-80, v-kfdp-89, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{v-bnfp-90
-, author =	"M. Veldhorst"
-, title =	"A bibliography on network flow problems"
-, journal =	"Algorithms Rev."
-, volume =	1
-, number =	2
-, year =	1990
-, pages =	"97--117"
-, keywords =	"bibliography, network flow"
+, author =      "M. Veldhorst"
+, title =       "A bibliography on network flow problems"
+, journal =     "Algorithms Rev."
+, volume =      1
+, number =      2
+, year =        1990
+, pages =       "97--117"
+, keywords =    "bibliography, network flow"
 }
 
 @article{v-ordio-86
-, author =	"M. Veldhorst"
-, title =	"The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"1--34"
+, author =      "M. Veldhorst"
+, title =       "The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "1--34"
 }
 
 @article{vdg-hgts-99
-, author =	"L. Velho and L. H. de Figueiredo and J. Gomes"
-, title =	"Hierarchical Generalized Triangle Strips"
-, journal =	"Visual Comput."
-, volume =	15
-, number =	1
-, year =	1999
-, pages =	"21--35"
-, update =	"99.07 held"
+, author =      "L. Velho and L. H. de Figueiredo and J. Gomes"
+, title =       "Hierarchical Generalized Triangle Strips"
+, journal =     "Visual Comput."
+, volume =      15
+, number =      1
+, year =        1999
+, pages =       "21--35"
+, update =      "99.07 held"
 }
 
 @article{v-3dcm-93
-, author =	"R. C. Veltkamp"
-, title =	"3D Computational Morphology"
-, journal =	"Comput. Graph. Forum"
-, volume =	12
-, number =	3
-, year =	1993
-, pages =	"115--127"
-, update =	"97.11 oostrum"
+, author =      "R. C. Veltkamp"
+, title =       "3D Computational Morphology"
+, journal =     "Comput. Graph. Forum"
+, volume =      12
+, number =      3
+, year =        1993
+, pages =       "115--127"
+, update =      "97.11 oostrum"
 }
 
 @article{v-bspud-95
-, author =	"R. C. Veltkamp"
-, title =	"Boundaries through Scattered Points of Unknown Density"
-, journal =	"Graphics Models and Image Processing"
-, volume =	57
-, number =	6
-, month =	nov
-, year =	1995
-, pages =	"441--452"
-, update =	"97.11 oostrum"
+, author =      "R. C. Veltkamp"
+, title =       "Boundaries through Scattered Points of Unknown Density"
+, journal =     "Graphics Models and Image Processing"
+, volume =      57
+, number =      6
+, month =       nov
+, year =        1995
+, pages =       "441--452"
+, update =      "97.11 oostrum"
 }
 
 @phdthesis{v-cobsp-92
-, author =	"R. C. Veltkamp"
-, title =	"Closed object boundaries from scattered points"
-, school =	"Center for Mathematics and Computer Science, Amsterdam"
-, year =	1992
-, keywords =	"doctoral thesis"
-, precedes =	"v-cobsp-94"
-, update =	"97.11 oostrum, 93.05 orourke"
-, annote =	"Reconstruction of polyhedra from points in space"
+, author =      "R. C. Veltkamp"
+, title =       "Closed object boundaries from scattered points"
+, school =      "Center for Mathematics and Computer Science, Amsterdam"
+, year =        1992
+, keywords =    "doctoral thesis"
+, precedes =    "v-cobsp-94"
+, update =      "97.11 oostrum, 93.05 orourke"
+, annote =      "Reconstruction of polyhedra from points in space"
 }
 
 @book{v-cobsp-94
-, author =	"R. C. Veltkamp"
-, title =	"Closed Object Boundaries from Scattered Points"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	885
-, publisher =	"Springer-Verlag"
-, year =	1994
-, isbn =	"3-540-58808-6"
-, succeeds =	"v-cobsp-92"
-, update =	"98.07 bibrelex, 97.11 oostrum"
+, author =      "R. C. Veltkamp"
+, title =       "Closed Object Boundaries from Scattered Points"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      885
+, publisher =   "Springer-Verlag"
+, year =        1994
+, isbn =        "3-540-58808-6"
+, succeeds =    "v-cobsp-92"
+, update =      "98.07 bibrelex, 97.11 oostrum"
 }
 
 @inproceedings{v-gpccg-97
-, author =	"Remco C. Veltkamp"
-, title =	"Generic programming in {CGAL}, the {C}omputational {G}eometry {A}lgorithms {L}ibrary"
-, editor =	"F. Arbab and Ph. Slusallek"
-, booktitle =	"Proceedings of the 6th Eurographics Workshop on Programming Paradigms in Graphics, Budapest, Hungary, 8 September 1997"
-, year =	1997
-, pages =	"127--138"
-, issn =	"1024-0861"
-, update =	"98.07 bibrelex, 98.03 bibrelex, 97.11 oostrum"
+, author =      "Remco C. Veltkamp"
+, title =       "Generic programming in {CGAL}, the {C}omputational {G}eometry {A}lgorithms {L}ibrary"
+, editor =      "F. Arbab and Ph. Slusallek"
+, booktitle =   "Proceedings of the 6th Eurographics Workshop on Programming Paradigms in Graphics, Budapest, Hungary, 8 September 1997"
+, year =        1997
+, pages =       "127--138"
+, issn =        "1024-0861"
+, update =      "98.07 bibrelex, 98.03 bibrelex, 97.11 oostrum"
 }
 
 @inproceedings{v-fhal-92
-, author =	"Remco C. Veltkamp"
-, title =	"The Flintstones: Hierarchical Approximation and Localization"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"69--72"
-, update =	"00.03 bibrelex"
+, author =      "Remco C. Veltkamp"
+, title =       "The Flintstones: Hierarchical Approximation and Localization"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "69--72"
+, update =      "00.03 bibrelex"
 }
 
 @article{v-gng-92
-, author =	"R. C. Veltkamp"
-, title =	"The $\gamma$-neighborhood graph"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	1
-, number =	4
-, year =	1992
-, pages =	"227--246"
-, keywords =	"neighborhood graph, Delaunay triangulation, Hamilton cycle"
+, author =      "R. C. Veltkamp"
+, title =       "The $\gamma$-neighborhood graph"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      1
+, number =      4
+, year =        1992
+, pages =       "227--246"
+, keywords =    "neighborhood graph, Delaunay triangulation, Hamilton cycle"
 }
 
 @article{vcc-fcdaa-98
-, author =	"B. C. Vemuri and Y. Cao and L. Chen"
-, title =	"Fast Collision Detection Algorithms with Applications to Particle Flows"
-, journal =	"Comput. Graph. Forum"
-, volume =	17
-, number =	2
-, month =	jun
-, year =	1998
-, pages =	"121--134"
-, update =	"99.03 held"
+, author =      "B. C. Vemuri and Y. Cao and L. Chen"
+, title =       "Fast Collision Detection Algorithms with Applications to Particle Flows"
+, journal =     "Comput. Graph. Forum"
+, volume =      17
+, number =      2
+, month =       jun
+, year =        1998
+, pages =       "121--134"
+, update =      "99.03 held"
 }
 
 @inproceedings{vvm-eetpa-92
-, author =	"B. C. Vemuri and R. Varadarajan and N. Mayya"
-, title =	"An Efficient Expected Time Parallel Algorithm for {Voronoi} Construction"
-, booktitle =	"Proc. 4th ACM Sympos. Parallel Algorithms Architect."
-, year =	1992
-, pages =	"392--400"
-, update =	"97.11 bibrelex"
+, author =      "B. C. Vemuri and R. Varadarajan and N. Mayya"
+, title =       "An Efficient Expected Time Parallel Algorithm for {Voronoi} Construction"
+, booktitle =   "Proc. 4th ACM Sympos. Parallel Algorithms Architect."
+, year =        1992
+, pages =       "392--400"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{vv-e3drs-96
-, author =	"D. E. Vengroff and J. S. Vitter"
-, title =	"Efficient 3-D Range Searching in External Memory"
-, booktitle =	"Proc. 28th Annu. ACM Sympos. Theory Comput."
-, site =	"Philadelphia, PA"
-, month =	may
-, year =	1996
-, update =	"97.03 murali"
+, author =      "D. E. Vengroff and J. S. Vitter"
+, title =       "Efficient 3-D Range Searching in External Memory"
+, booktitle =   "Proc. 28th Annu. ACM Sympos. Theory Comput."
+, site =        "Philadelphia, PA"
+, month =       may
+, year =        1996
+, update =      "97.03 murali"
 }
 
 @inproceedings{vv-ioect-96
-, author =	"D. E. Vengroff and J. S. Vitter"
-, title =	"{I/O}-Efficient Computation: The {TPIE} Approach"
-, booktitle =	"Proceedings of the Goddard Conference on Mass Storage Systems and Technologies"
-, site =	"College Park, MD"
-, series =	"NASA Conference Publication 3340, Volume II"
-, month =	sep
-, year =	1996
-, pages =	"553--570"
-, update =	"97.03 murali"
+, author =      "D. E. Vengroff and J. S. Vitter"
+, title =       "{I/O}-Efficient Computation: The {TPIE} Approach"
+, booktitle =   "Proceedings of the Goddard Conference on Mass Storage Systems and Technologies"
+, site =        "College Park, MD"
+, series =      "NASA Conference Publication 3340, Volume II"
+, month =       sep
+, year =        1996
+, pages =       "553--570"
+, update =      "97.03 murali"
 }
 
 @article{v-sarut-84
-, author =	"C. E. {Veni Madhavan}"
-, title =	"Secondary attribute retrieval using tree data structures"
-, journal =	"Theoret. Comput. Sci."
-, volume =	33
-, year =	1984
-, pages =	"107--116"
+, author =      "C. E. {Veni Madhavan}"
+, title =       "Secondary attribute retrieval using tree data structures"
+, journal =     "Theoret. Comput. Sci."
+, volume =      33
+, year =        1984
+, pages =       "107--116"
 }
 
 @article{v-aitco-95
-, author =	"R. Venkatasubramanian"
-, title =	"On the area of intersection of two closed 2D objects"
-, journal =	"Inform. Sci."
-, volume =	82
-, year =	1995
-, pages =	"25--44"
-, update =	"99.11 devillers"
+, author =      "R. Venkatasubramanian"
+, title =       "On the area of intersection of two closed 2D objects"
+, journal =     "Inform. Sci."
+, volume =      82
+, year =        1995
+, pages =       "25--44"
+, update =      "99.11 devillers"
 }
 
 @inproceedings{vc-gicp-93
-, author =	"R. Venkatasubramanian and A. Cullum"
-, title =	"Grazing inside a convex polygon"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"228--234"
-, cites =	"o-agta-87, nt-opg-91, nt-opg, gv-oacmg-92, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "R. Venkatasubramanian and A. Cullum"
+, title =       "Grazing inside a convex polygon"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "228--234"
+, cites =       "o-agta-87, nt-opg-91, nt-opg, gv-oacmg-92, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{vc-nadpd-92
-, author =	"Jose A. Ventura and Jen-Ming Chen"
-, title =	"A new approach to determine the pose and dimension of polygonal shapes"
-, editor =	"G{\"u}nter Fandel and Thomas Gulledge and Albert Jones"
-, booktitle =	"Operations Research in Production Planning and Control, Proc. Joint German/US Conf., Hagen, Germany, June 25--26, 1992"
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"151--166"
-, update =	"98.07 rote"
-, abstract =	"\dots\ Algorithmically, the image boundary data is partitioned into $n$
+, author =      "Jose A. Ventura and Jen-Ming Chen"
+, title =       "A new approach to determine the pose and dimension of polygonal shapes"
+, editor =      "G{\"u}nter Fandel and Thomas Gulledge and Albert Jones"
+, booktitle =   "Operations Research in Production Planning and Control, Proc. Joint German/US Conf., Hagen, Germany, June 25--26, 1992"
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "151--166"
+, update =      "98.07 rote"
+, abstract =    "\dots\ Algorithmically, the image boundary data is partitioned into $n$
                  segments, and the best-fitting polygon is found using a non-ordinary
                  least-squares technique. The algorithm is well-suited for on-line
                  implementation in an automated environment due to its flexibility and
@@ -144469,931 +144469,931 @@ @inproceedings{vc-nadpd-92
 }
 
 @inproceedings{v-acpdp-95
-, author =	"Knut Verbarg"
-, title =	"Approximate Center Points in Dense Point Sets"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	65
-, update =	"00.03 bibrelex"
+, author =      "Knut Verbarg"
+, title =       "Approximate Center Points in Dense Point Sets"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       65
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{v-acpdp-97
-, author =	"Knut Verbarg"
-, title =	"Approximate Center Points in Dense Point Sets"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	"55--56"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Knut Verbarg"
+, title =       "Approximate Center Points in Dense Point Sets"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       "55--56"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{vh-hmpus-96
-, author =	"Knut Verbarg and A. Hensel"
-, title =	"Hierarchical Motion Planning Using a Spatial Index"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"87--90"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Knut Verbarg and A. Hensel"
+, title =       "Hierarchical Motion Planning Using a Spatial Index"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "87--90"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @article{v-sptnp-51
-, author =	"S. Verblunsky"
-, title =	"On the shortest path through a number of points"
-, journal =	"Proc. Amer. Math. Soc."
-, volume =	2
-, year =	1951
-, pages =	"904--913"
-, update =	"97.11 bibrelex"
+, author =      "S. Verblunsky"
+, title =       "On the shortest path through a number of points"
+, journal =     "Proc. Amer. Math. Soc."
+, volume =      2
+, year =        1951
+, pages =       "904--913"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{v-ivdt-92
-, author =	"J. J. Verkuil"
-, title =	"Idual: Visualizing Duality Transformations"
-, institution =	"Dept. Comput. Sci., Univ. Utrecht"
-, year =	1992
-, update =	"97.03 icking"
+, author =      "J. J. Verkuil"
+, title =       "Idual: Visualizing Duality Transformations"
+, institution = "Dept. Comput. Sci., Univ. Utrecht"
+, year =        1992
+, update =      "97.03 icking"
 }
 
 @inproceedings{v-aotpc-97
-, author =	"P. Vermeer"
-, title =	"Assembling objects through parts correlation"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"385--387"
-, cites =	"dh-ceg-95, hv-scp-95, nwm-dkssp-90, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "P. Vermeer"
+, title =       "Assembling objects through parts correlation"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "385--387"
+, cites =       "dh-ceg-95, hv-scp-95, nwm-dkssp-90, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @phdthesis{v-matbr-94
-, author =	"P. J. Vermeer"
-, title =	"Medial Axis Transform to Boundary Representation Conversion"
-, school =	"CS Dept., Purdue University"
-, address =	"West Lafayette, Indiana 47907-1398, USA"
-, year =	1994
-, keywords =	"doctoral thesis"
-, update =	"95.05 held"
+, author =      "P. J. Vermeer"
+, title =       "Medial Axis Transform to Boundary Representation Conversion"
+, school =      "CS Dept., Purdue University"
+, address =     "West Lafayette, Indiana 47907-1398, USA"
+, year =        1994
+, keywords =    "doctoral thesis"
+, update =      "95.05 held"
 }
 
 @book{v-mvavi-91
-, author =	"D. Vernon"
-, title =	"Machine Vision, automated visual inspection and robot vision"
-, publisher =	"Prentice Hall"
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "D. Vernon"
+, title =       "Machine Vision, automated visual inspection and robot vision"
+, publisher =   "Prentice Hall"
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @mastersthesis{v-osvdb-84
-, author =	"Colin Verrilli"
-, title =	"One source {Voronoi} diagrams with barriers: a computer implementation"
-, school =	"Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
-, month =	may
-, year =	1984
-, keywords =	"master thesis, Voronoi diagrams"
-, update =	"93.09 franklin"
+, author =      "Colin Verrilli"
+, title =       "One source {Voronoi} diagrams with barriers: a computer implementation"
+, school =      "Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
+, month =       may
+, year =        1984
+, keywords =    "master thesis, Voronoi diagrams"
+, update =      "93.09 franklin"
 }
 
 @book{v-htiat-73
-, author =	"J. W. Vick"
-, title =	"Homology Theory: {An} Introduction to Algebraic Topology"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	1973
-, update =	"98.03 bibrelex"
+, author =      "J. W. Vick"
+, title =       "Homology Theory: {An} Introduction to Algebraic Topology"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        1973
+, update =      "98.03 bibrelex"
 }
 
 @article{vh-fsppp-85
-, author =	"J. Viegas and P. Hansen"
-, title =	"Finding Shortest Paths in the Plane in the Presence of Barriers"
-, journal =	"European J. Oper. Res."
-, volume =	20
-, year =	1985
-, pages =	"373--381"
-, update =	"93.09 milone+mitchell"
+, author =      "J. Viegas and P. Hansen"
+, title =       "Finding Shortest Paths in the Plane in the Presence of Barriers"
+, journal =     "European J. Oper. Res."
+, volume =      20
+, year =        1985
+, pages =       "373--381"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{v-nmevr-78
-, author =	"J. Vignes"
-, title =	"New Methods for Evaluating the Validity of the Results of Mathematical Computations"
-, journal =	"Mathematics and Computers in Simulation"
-, volume =	20
-, year =	1978
-, pages =	"227--249"
-, update =	"98.03 bibrelex"
+, author =      "J. Vignes"
+, title =       "New Methods for Evaluating the Validity of the Results of Mathematical Computations"
+, journal =     "Mathematics and Computers in Simulation"
+, volume =      20
+, year =        1978
+, pages =       "227--249"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{vl-eac-74
-, author =	"J. Vignes and M. {La Porte}"
-, title =	"Error Analysis in Computing"
-, booktitle =	"Proc. IFIP Congress"
-, site =	"Stockholm, Sweden"
-, year =	1974
-, pages =	"610--614"
-, update =	"98.03 bibrelex"
+, author =      "J. Vignes and M. {La Porte}"
+, title =       "Error Analysis in Computing"
+, booktitle =   "Proc. IFIP Congress"
+, site =        "Stockholm, Sweden"
+, year =        1974
+, pages =       "610--614"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{v-ditvl-83
-, author =	"G. Vijayan"
-, title =	"Design implementation and theory of a VLSI layout language"
-, school =	"Department of EECS, Princeton University"
-, year =	1983
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "G. Vijayan"
+, title =       "Design implementation and theory of a VLSI layout language"
+, school =      "Department of EECS, Princeton University"
+, year =        1983
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{vt-ftcr-90
-, author =	"G. Vijayan and R. S. Tsay"
-, title =	"Floorplan by Topological Constraint Reduction"
-, booktitle =	"IEEE Int. Conf. On Computer-Aided-Design"
-, year =	1990
-, pages =	"106--109"
-, update =	"98.11 bibrelex"
+, author =      "G. Vijayan and R. S. Tsay"
+, title =       "Floorplan by Topological Constraint Reduction"
+, booktitle =   "IEEE Int. Conf. On Computer-Aided-Design"
+, year =        1990
+, pages =       "106--109"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{vw-peog-82
-, author =	"G. Vijayan and A. Wigderso"
-, title =	"Planarity of edge-ordered graphs"
-, institution =	"Department of EECS, Princeton University"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "G. Vijayan and A. Wigderso"
+, title =       "Planarity of edge-ordered graphs"
+, institution = "Department of EECS, Princeton University"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @article{vw-rgte-85
-, author =	"G. Vijayan and A. Wigderson"
-, title =	"Rectilinear Graphs and their Embeddings"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"355--372"
-, update =	"94.05 tamassia"
+, author =      "G. Vijayan and A. Wigderson"
+, title =       "Rectilinear Graphs and their Embeddings"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "355--372"
+, update =      "94.05 tamassia"
 }
 
 @inproceedings{v-gpga-86
-, author =	"V. Vijayan"
-, title =	"Geometry of planar graphs with angles"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"116--124"
-, keywords =	"graph drawing"
-, cites =	"as-ptass-79, b-aancp-83, bm-gta-76, c-ig-61, f-slrpg-48, gs-gpg-81, j-nccog-82, k-nptal-84i, lns-vlp-83, mc-ivs-80, t-dpg-83, v-ditvl-83, vw-rgte-85, vw-peog-82, y-gt-61, y-gt-68, ZZZ"
-, update =	"97.11 bibrelex, 93.09 tamassia"
+, author =      "V. Vijayan"
+, title =       "Geometry of planar graphs with angles"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "116--124"
+, keywords =    "graph drawing"
+, cites =       "as-ptass-79, b-aancp-83, bm-gta-76, c-ig-61, f-slrpg-48, gs-gpg-81, j-nccog-82, k-nptal-84i, lns-vlp-83, mc-ivs-80, t-dpg-83, v-ditvl-83, vw-rgte-85, vw-peog-82, y-gt-61, y-gt-68, ZZZ"
+, update =      "97.11 bibrelex, 93.09 tamassia"
 }
 
 @article{vnb-odcc-91
-, author =	"A. Vinacua and I. Navazo and B. Brunet"
-, title =	"Octree detection of closed compartments"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	1
-, number =	3
-, year =	1991
-, pages =	"263--280"
-, keywords =	"connected component, octree, geometric model, nonmanifold boundary"
+, author =      "A. Vinacua and I. Navazo and B. Brunet"
+, title =       "Octree detection of closed compartments"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      1
+, number =      3
+, year =        1991
+, pages =       "263--280"
+, keywords =    "connected component, octree, geometric model, nonmanifold boundary"
 }
 
 @article{v-etrec-39
-, author =	"P. Vincensini"
-, title =	"Sur une extension d'un th{\'e}or{\`e}me de {M. J. Radon} sur les ensembles de corps convexes"
-, journal =	"Bull. Soc. Math. France"
-, volume =	67
-, year =	1939
-, pages =	"115--119"
-, update =	"98.07 bibrelex"
+, author =      "P. Vincensini"
+, title =       "Sur une extension d'un th{\'e}or{\`e}me de {M. J. Radon} sur les ensembles de corps convexes"
+, journal =     "Bull. Soc. Math. France"
+, volume =      67
+, year =        1939
+, pages =       "115--119"
+, update =      "98.07 bibrelex"
 }
 
 @article{v-nips-63
-, author =	"I. M. Vinogradov"
-, title =	"On the number of integer points in a sphere"
-, journal =	"1 zv. Akad. Nauk SSSR, Ser. Mat."
-, volume =	27
-, year =	1963
-, pages =	"957--968"
-, update =	"97.11 bibrelex"
+, author =      "I. M. Vinogradov"
+, title =       "On the number of integer points in a sphere"
+, journal =     "1 zv. Akad. Nauk SSSR, Ser. Mat."
+, volume =      27
+, year =        1963
+, pages =       "957--968"
+, update =      "97.11 bibrelex"
 }
 
 @article{v-ismaa-83
-, author =	"U. Vishkin"
-, title =	"Implementation of simultaneous memory address access in models that forbid it"
-, journal =	"J. Algorithms"
-, volume =	4
-, year =	1983
-, pages =	"45--50"
-, update =	"98.07 bibrelex"
+, author =      "U. Vishkin"
+, title =       "Implementation of simultaneous memory address access in models that forbid it"
+, journal =     "J. Algorithms"
+, volume =      4
+, year =        1983
+, pages =       "45--50"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{v-spa-91
-, author =	"U. Vishkin"
-, title =	"Structural parallel algorithmics"
-, type =	"Technical Report"
-, number =	"UMIACS-TR-91-53"
-, month =	apr
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "U. Vishkin"
+, title =       "Structural parallel algorithmics"
+, type =        "Technical Report"
+, number =      "UMIACS-TR-91-53"
+, month =       apr
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @techreport{v-spcs-83
-, author =	"U. Vishkin"
-, title =	"Synchronous parallel computation - a survey"
-, type =	"Technical {Report}"
-, number =	71
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "U. Vishkin"
+, title =       "Synchronous parallel computation - a survey"
+, type =        "Technical {Report}"
+, number =      71
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{vdgltv-esgda-00
-, author =	"L. Vismara and G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and F. Vargiu"
-, title =	"Experimental Studies on Graph Drawing Algorithms"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	30
-, number =	11
-, year =	2000
-, pages =	"1235--1284"
-, update =	"01.04 vismara"
-, annote =	"Special Issue on Discrete Algorithm Engineering"
+, author =      "L. Vismara and G. {Di Battista} and A. Garg and G. Liotta and R. Tamassia and F. Vargiu"
+, title =       "Experimental Studies on Graph Drawing Algorithms"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      30
+, number =      11
+, year =        2000
+, pages =       "1235--1284"
+, update =      "01.04 vismara"
+, annote =      "Special Issue on Discrete Algorithm Engineering"
 }
 
 @inproceedings{vm-eadip-86
-, author =	"V. Visvanathan and L. S. Milor"
-, title =	"An efficient algorithm to determine the image of a parallelepiped under a linear transformation"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"207--215"
-, cites =	"mv-psafs-86, vst-rsbtt-84, ls-smm-85, w-rsbtt-84, lp-cgs-84, r-ca-70, s-cm-65, lsv-cacsc-86, lsv-cacsc-86, dmbs-lug-79, ck-acp-70, s-fchff-85, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "V. Visvanathan and L. S. Milor"
+, title =       "An efficient algorithm to determine the image of a parallelepiped under a linear transformation"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "207--215"
+, cites =       "mv-psafs-86, vst-rsbtt-84, ls-smm-85, w-rsbtt-84, lp-cgs-84, r-ca-70, s-cm-65, lsv-cacsc-86, lsv-cacsc-86, dmbs-lug-79, ck-acp-70, s-fchff-85, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{vst-rsbtt-84
-, author =	"V. Visvanathan and E. Szeto and A. Tits"
-, title =	"A robust simulation-before-test technique for DC analog fault diagnosis"
-, booktitle =	"Proc. of the International Symposium of Circuits and Systems"
-, nickname =	"ISCAS"
-, site =	"Montreal, Canada"
-, year =	1984
-, pages =	"689--692"
-, update =	"98.03 bibrelex"
+, author =      "V. Visvanathan and E. Szeto and A. Tits"
+, title =       "A robust simulation-before-test technique for DC analog fault diagnosis"
+, booktitle =   "Proc. of the International Symposium of Circuits and Systems"
+, nickname =    "ISCAS"
+, site =        "Montreal, Canada"
+, year =        1984
+, pages =       "689--692"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{v-egpsp-93
-, author =	"S. Viswanathan"
-, title =	"The edge guard problem for spiral polygons"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"103--108"
-, keywords =	"Computational Geometry, visibility, edge guards, spiral polygon"
-, cites =	"c-ctpg-75, o-agta-87, b-vagt-93, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "S. Viswanathan"
+, title =       "The edge guard problem for spiral polygons"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "103--108"
+, keywords =    "Computational Geometry, visibility, edge guards, spiral polygon"
+, cites =       "c-ctpg-75, o-agta-87, b-vagt-93, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @techreport{vw-cpsr-79
-, author =	"P. M. B. Vitanyi and D. Wood"
-, title =	"Computing the perimeter of a set of rectangles"
-, type =	"Report"
-, number =	"79-CS-23"
-, institution =	"Unit Comput. Sci., McMaster Univ."
-, address =	"Hamilton, ON"
-, year =	1979
+, author =      "P. M. B. Vitanyi and D. Wood"
+, title =       "Computing the perimeter of a set of rectangles"
+, type =        "Report"
+, number =      "79-CS-23"
+, institution = "Unit Comput. Sci., McMaster Univ."
+, address =     "Hamilton, ON"
+, year =        1979
 }
 
 @techreport{vs-apm1t-93
-, author =	"J. Vitter and E. Shriver"
-, title =	"Algorithms for parallel memory {I}: two-level memories"
-, type =	"Research Report"
-, number =	"CS-1993-01"
-, institution =	"Dept. of Comp. Sc., Duke Univ."
-, address =	"Durham, NC"
-, year =	1993
-, update =	"95.01 devillers"
+, author =      "J. Vitter and E. Shriver"
+, title =       "Algorithms for parallel memory {I}: two-level memories"
+, type =        "Research Report"
+, number =      "CS-1993-01"
+, institution = "Dept. of Comp. Sc., Duke Univ."
+, address =     "Durham, NC"
+, year =        1993
+, update =      "95.01 devillers"
 }
 
 @techreport{vs-apm2h-93
-, author =	"J. Vitter and E. Shriver"
-, title =	"Algorithms for parallel memory {II}: hierarchical multilevel memories"
-, type =	"Research Report"
-, number =	"CS-1993-01"
-, institution =	"Dept. of Comp. Sc., Duke Univ."
-, address =	"Durham, NC"
-, year =	1993
-, update =	"95.01 devillers"
+, author =      "J. Vitter and E. Shriver"
+, title =       "Algorithms for parallel memory {II}: hierarchical multilevel memories"
+, type =        "Research Report"
+, number =      "CS-1993-01"
+, institution = "Dept. of Comp. Sc., Duke Univ."
+, address =     "Durham, NC"
+, year =        1993
+, update =      "95.01 devillers"
 }
 
 @article{v-cilsg-96
-, author =	"J. S. Vitter"
-, title =	"Communication Issues in Large-Scale Geometric Computation"
-, journal =	"ACM Comput. Surv."
-, volume =	"28A"
-, number =	4
-, month =	dec
-, year =	1996
-, update =	"97.03 murali"
+, author =      "J. S. Vitter"
+, title =       "Communication Issues in Large-Scale Geometric Computation"
+, journal =     "ACM Comput. Surv."
+, volume =      "28A"
+, number =      4
+, month =       dec
+, year =        1996
+, update =      "97.03 murali"
 }
 
 @incollection{v-emals-91
-, author =	"J. S. Vitter"
-, title =	"Efficient Memory Access in Large-Scale Computation"
-, booktitle =	"Proc. 8th Sympos. Theoret. Aspects Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	""
-, update =	"96.09 orourke"
+, author =      "J. S. Vitter"
+, title =       "Efficient Memory Access in Large-Scale Computation"
+, booktitle =   "Proc. 8th Sympos. Theoret. Aspects Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       ""
+, update =      "96.09 orourke"
 }
 
 @inproceedings{v-gsmd-99
-, author =	"Jeffrey Scott Vitter"
-, title =	"Geometric Searching in Massive Data"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"25--30"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Jeffrey Scott Vitter"
+, title =       "Geometric Searching in Massive Data"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "25--30"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @incollection{vf-acaad-90
-, author =	"J. S. Vitter and Ph. Flajolet"
-, title =	"Average-case analysis of algorithms and data structures"
-, editor =	"J. van Leeuwen"
-, booktitle =	"Algorithms and Complexity"
-, series =	"Handbook of Theoretical Computer Science"
-, volume =	"A"
-, publisher =	"Elsevier"
-, address =	"Amsterdam"
-, year =	1990
-, pages =	"431--524"
-, update =	"94.09 vitter"
+, author =      "J. S. Vitter and Ph. Flajolet"
+, title =       "Average-case analysis of algorithms and data structures"
+, editor =      "J. van Leeuwen"
+, booktitle =   "Algorithms and Complexity"
+, series =      "Handbook of Theoretical Computer Science"
+, volume =      "A"
+, publisher =   "Elsevier"
+, address =     "Amsterdam"
+, year =        1990
+, pages =       "431--524"
+, update =      "94.09 vitter"
 }
 
 @inproceedings{vl-lp-88
-, author =	"J. S. Vitter and J.-H. Lin"
-, title =	"Learning in Parallel"
-, booktitle =	"Proceedings of the 1st Annual ACM Workshop on Computational Learning Theory"
-, nickname =	"COLT '88"
-, year =	1988
-, pages =	"106--124"
-, precedes =	"vl-lp-92"
-, update =	"94.09 vitter"
+, author =      "J. S. Vitter and J.-H. Lin"
+, title =       "Learning in Parallel"
+, booktitle =   "Proceedings of the 1st Annual ACM Workshop on Computational Learning Theory"
+, nickname =    "COLT '88"
+, year =        1988
+, pages =       "106--124"
+, precedes =    "vl-lp-92"
+, update =      "94.09 vitter"
 }
 
 @article{vl-lp-92
-, author =	"J. S. Vitter and J.-H. Lin"
-, title =	"Learning in Parallel"
-, journal =	"Inform. Comput."
-, volume =	92
-, year =	1992
-, pages =	"179--202"
-, succeeds =	"vl-lp-88"
-, update =	"94.09 vitter"
+, author =      "J. S. Vitter and J.-H. Lin"
+, title =       "Learning in Parallel"
+, journal =     "Inform. Comput."
+, volume =      92
+, year =        1992
+, pages =       "179--202"
+, succeeds =    "vl-lp-88"
+, update =      "94.09 vitter"
 }
 
 @article{vn-lssum-93
-, author =	"J. S. Vitter and M. H. Nodine"
-, title =	"Large-Scale Sorting in Uniform Memory Hierarchies"
-, journal =	"J. Parallel Distrib. Comput."
-, volume =	17
-, year =	1993
-, pages =	"107--114"
-, update =	"98.07 bibrelex, 97.03 murali"
+, author =      "J. S. Vitter and M. H. Nodine"
+, title =       "Large-Scale Sorting in Uniform Memory Hierarchies"
+, journal =     "J. Parallel Distrib. Comput."
+, volume =      17
+, year =        1993
+, pages =       "107--114"
+, update =      "98.07 bibrelex, 97.03 murali"
 }
 
 @article{vs-apm1t-94
-, author =	"J. S. Vitter and E. A. M. Shriver"
-, title =	"Algorithms for Parallel Memory {I}: Two-Level Memories"
-, journal =	"Algorithmica"
-, volume =	12
-, number =	"2--3"
-, year =	1994
-, pages =	"110--147"
-, update =	"97.11 bibrelex, 97.03 murali"
+, author =      "J. S. Vitter and E. A. M. Shriver"
+, title =       "Algorithms for Parallel Memory {I}: Two-Level Memories"
+, journal =     "Algorithmica"
+, volume =      12
+, number =      "2--3"
+, year =        1994
+, pages =       "110--147"
+, update =      "97.11 bibrelex, 97.03 murali"
 }
 
 @article{vs-apmhm-94
-, author =	"J. S. Vitter and E. A. M. Shriver"
-, title =	"Algorithms for Parallel Memory {II}: Hierarchical Multilevel Memories"
-, journal =	"Algorithmica"
-, volume =	12
-, year =	1994
-, pages =	"148--169"
-, update =	"96.09 tamassia"
+, author =      "J. S. Vitter and E. A. M. Shriver"
+, title =       "Algorithms for Parallel Memory {II}: Hierarchical Multilevel Memories"
+, journal =     "Algorithmica"
+, volume =      12
+, year =        1994
+, pages =       "148--169"
+, update =      "96.09 tamassia"
 }
 
 @inproceedings{vs-odiop-90
-, author =	"J. S. Vitter and E. A. M. Shriver"
-, title =	"Optimal Disk {I/O} with Parallel Block Transfer"
-, booktitle =	"Proc. 22nd Annu. ACM Sympos. Theory Comput."
-, year =	1990
-, pages =	"159--169"
-, update =	"96.09 orourke"
+, author =      "J. S. Vitter and E. A. M. Shriver"
+, title =       "Optimal Disk {I/O} with Parallel Block Transfer"
+, booktitle =   "Proc. 22nd Annu. ACM Sympos. Theory Comput."
+, year =        1990
+, pages =       "159--169"
+, update =      "96.09 orourke"
 }
 
 @phdthesis{v-ffrim-97
-, author =	"J. Vleugels"
-, title =	"On Fatness and Fitness --- Realistic Input Models for Geometric Algorithms"
-, type =	"Ph.{D}. Thesis"
-, school =	"Dept. Comput. Sci., Univ. Utrecht"
-, address =	"Utrecht, The Netherlands"
-, year =	1997
-, keywords =	"doctoral thesis"
-, update =	"97.07 smid"
+, author =      "J. Vleugels"
+, title =       "On Fatness and Fitness --- Realistic Input Models for Geometric Algorithms"
+, type =        "Ph.{D}. Thesis"
+, school =      "Dept. Comput. Sci., Univ. Utrecht"
+, address =     "Utrecht, The Netherlands"
+, year =        1997
+, keywords =    "doctoral thesis"
+, update =      "97.07 smid"
 }
 
 @article{vfor-hvv-96
-, author =	"J. Vleugels and V. Ferrucci and M. Overmars and A. Rao"
-, title =	"Hunting {Voronoi} Vertices"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"329--354"
-, succeeds =	"forv-hvvnp-94"
-, update =	"97.03 devillers+smid"
+, author =      "J. Vleugels and V. Ferrucci and M. Overmars and A. Rao"
+, title =       "Hunting {Voronoi} Vertices"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "329--354"
+, succeeds =    "forv-hvvnp-94"
+, update =      "97.03 devillers+smid"
 }
 
 @article{vo-avdcs-98
-, author =	"J. Vleugels and M. Overmars"
-, title =	"Approximating {Voronoi} Diagrams of Convex Sites in any Dimension"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	8
-, year =	1998
-, pages =	"201--222"
-, update =	"98.11 devillers"
+, author =      "J. Vleugels and M. Overmars"
+, title =       "Approximating {Voronoi} Diagrams of Convex Sites in any Dimension"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      8
+, year =        1998
+, pages =       "201--222"
+, update =      "98.11 devillers"
 }
 
 @article{v-cptm-93
-, author =	"H. Voelcker"
-, title =	"Current perspective on tolerancing and metrology"
-, journal =	"Manufacturing Review"
-, volume =	6
-, number =	4
-, year =	1993
-, pages =	"258--268"
-, update =	"97.03 agarwal"
+, author =      "H. Voelcker"
+, title =       "Current perspective on tolerancing and metrology"
+, journal =     "Manufacturing Review"
+, volume =      6
+, number =      4
+, year =        1993
+, pages =       "258--268"
+, update =      "97.03 agarwal"
 }
 
 @techreport{vh-rsmmp-81
-, author =	"H. B. Voelcker and W. A. Hunt"
-, title =	"The Role of Solid Modeling in Machining - Process Modeling and {NC} Verification"
-, type =	"SAE {Technical} {Paper}"
-, number =	810195
-, institution =	"SAE"
-, year =	1981
-, update =	"98.03 bibrelex"
+, author =      "H. B. Voelcker and W. A. Hunt"
+, title =       "The Role of Solid Modeling in Machining - Process Modeling and {NC} Verification"
+, type =        "SAE {Technical} {Paper}"
+, number =      810195
+, institution = "SAE"
+, year =        1981
+, update =      "98.03 bibrelex"
 }
 
 @article{vr-gmmpp-78
-, author =	"H. B. Voelcker and A. A. G. Requicha"
-, title =	"Geometric modeling of mechanical parts and processes"
-, journal =	"Computer"
-, volume =	1977
-, year =	1978
-, pages =	"48--57"
+, author =      "H. B. Voelcker and A. A. G. Requicha"
+, title =       "Geometric modeling of mechanical parts and processes"
+, journal =     "Computer"
+, volume =      1977
+, year =        1978
+, pages =       "48--57"
 }
 
 @inproceedings{vw-tgtae-95
-, author =	"F. Vogt and R. Wille"
-, title =	"{TOSCANA} --- a Graphical Tool for Analyzing and Exploring Data"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"226--233"
-, keywords =	"graph drawing, nested diagram, order, system"
-, update =	"95.01 tamassia"
+, author =      "F. Vogt and R. Wille"
+, title =       "{TOSCANA} --- a Graphical Tool for Analyzing and Exploring Data"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "226--233"
+, keywords =    "graph drawing, nested diagram, order, system"
+, update =      "95.01 tamassia"
 }
 
 @mastersthesis{v-hrdgd-93
-, author =	"A. Voigtmann"
-, title =	"Hierarchische Repr{\"a}sentation diskreter geometrischer Daten"
-, school =	"Fachbereich Mathematik, Universit{\"a}t-GH Siegen"
-, year =	1993
-, note =	"Diplomarbeit"
-, keywords =	"master thesis"
-, update =	"98.11 bibrelex"
+, author =      "A. Voigtmann"
+, title =       "Hierarchische Repr{\"a}sentation diskreter geometrischer Daten"
+, school =      "Fachbereich Mathematik, Universit{\"a}t-GH Siegen"
+, year =        1993
+, note =        "Diplomarbeit"
+, keywords =    "master thesis"
+, update =      "98.11 bibrelex"
 }
 
 @article{vbh-hmmsr-97
-, author =	"A. Voigtmann and L. Becker and K. Hinrichs"
-, title =	"A Hierarchical Model for Multiresolution Surface Reconstruction"
-, journal =	"Graph. Models Image Process."
-, volume =	59
-, number =	5
-, month =	sep
-, year =	1997
-, pages =	"333--348"
-, update =	"98.07 held"
+, author =      "A. Voigtmann and L. Becker and K. Hinrichs"
+, title =       "A Hierarchical Model for Multiresolution Surface Reconstruction"
+, journal =     "Graph. Models Image Process."
+, volume =      59
+, number =      5
+, month =       sep
+, year =        1997
+, pages =       "333--348"
+, update =      "98.07 held"
 }
 
 @inproceedings{vbh-hsruc-94
-, author =	"Andreas Voigtmann and Ludger Becker and Klaus Hinrichs"
-, title =	"Hierachical Surface Representation Using Constrained {Delaunay} Triangulations"
-, booktitle =	"Abstracts 10th European Workshop Comput. Geom."
-, nickname =	"CG '94"
-, site =	"Santander"
-, publisher =	"Universidad de Cantabria, Santander"
-, year =	1994
-, pages =	"16--19"
-, update =	"00.11 smid, 00.07 icking"
+, author =      "Andreas Voigtmann and Ludger Becker and Klaus Hinrichs"
+, title =       "Hierachical Surface Representation Using Constrained {Delaunay} Triangulations"
+, booktitle =   "Abstracts 10th European Workshop Comput. Geom."
+, nickname =    "CG '94"
+, site =        "Santander"
+, publisher =   "Universidad de Cantabria, Santander"
+, year =        1994
+, pages =       "16--19"
+, update =      "00.11 smid, 00.07 icking"
 }
 
 @inproceedings{vbh-cdpmr-94
-, author =	"A. Voigtmann and L. Becker and K. Hinrichs"
-, title =	"The Constrained {Delaunay} Pyramid: a Model for ReconstructingSurfaces at Multiple Resolutions"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"177--182"
-, cites =	"bkss-rtera-90, bv-hmrr-84, c-cdt-89, ct-qrdt-86, dfnp-hssa-84, d-srbtg-87, d-pdstb-89, dp-olacd-92, gg-dmtds-79, g-rtdis-84, ls-tacdt-80, mv-cdtr-93, nhs-gfasm-84, fp-ochr3-84, ps-cgi-85, s-asdsc-90, s-dasds-90, sg-apads-85, w-cabds-85, sp-htucc-92, w-ebdss-85, v-hrdgd-93, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "A. Voigtmann and L. Becker and K. Hinrichs"
+, title =       "The Constrained {Delaunay} Pyramid: a Model for ReconstructingSurfaces at Multiple Resolutions"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "177--182"
+, cites =       "bkss-rtera-90, bv-hmrr-84, c-cdt-89, ct-qrdt-86, dfnp-hssa-84, d-srbtg-87, d-pdstb-89, dp-olacd-92, gg-dmtds-79, g-rtdis-84, ls-tacdt-80, mv-cdtr-93, nhs-gfasm-84, fp-ochr3-84, ps-cgi-85, s-asdsc-90, s-dasds-90, sg-apads-85, w-cabds-85, sp-htucc-92, w-ebdss-85, v-hrdgd-93, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @article{v-tpshp-86
-, author =	"A. Vol{\v c}i{\v c}"
-, title =	"A three-point solution to {Hammer's} x-ray problem"
-, journal =	"J. London Math. Soc."
-, volume =	2
-, number =	27
-, year =	1986
-, pages =	"349--359"
-, update =	"98.11 bibrelex"
+, author =      "A. Vol{\v c}i{\v c}"
+, title =       "A three-point solution to {Hammer's} x-ray problem"
+, journal =     "J. London Math. Soc."
+, volume =      2
+, number =      27
+, year =        1986
+, pages =       "349--359"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{vk-apeic-87
-, author =	"R. Volpe and P. Khosla"
-, title =	"Artificial potential with elliptical isopotential contours for obstacle avoidance"
-, booktitle =	"Proc. 26th IEEE Conf. on Decision and Control"
-, year =	1987
-, pages =	"180--185"
-, update =	"97.03 schwarzkopf"
+, author =      "R. Volpe and P. Khosla"
+, title =       "Artificial potential with elliptical isopotential contours for obstacle avoidance"
+, booktitle =   "Proc. 26th IEEE Conf. on Decision and Control"
+, year =        1987
+, pages =       "180--185"
+, update =      "97.03 schwarzkopf"
 }
 
 @incollection{r-hrrc-83
-, author =	"S. M. {von Rump}"
-, title =	"How reliable are results of computers"
-, booktitle =	"Jahrbuch {\"U}berblicke Mahtematik"
-, year =	1983
-, pages =	"163--168"
-, note =	"Trans. from German: Wie zuverl{\"a}ssig sind die Ergebnisse unserer Rechenanlagen"
-, update =	"98.11 bibrelex"
+, author =      "S. M. {von Rump}"
+, title =       "How reliable are results of computers"
+, booktitle =   "Jahrbuch {\"U}berblicke Mahtematik"
+, year =        1983
+, pages =       "163--168"
+, note =        "Trans. from German: Wie zuverl{\"a}ssig sind die Ergebnisse unserer Rechenanlagen"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{v-plcpt-
-, author =	"K. Vophi"
-, title =	"Perturbation de lines et circles et pr{\\xb4e}servation de la topologie"
-, booktitle =	"Journ{\\xb4e}es de g{\\xb4e}ometrie algorithmique du Val d'Ajol"
-, update =	"98.11 bibrelex"
+, author =      "K. Vophi"
+, title =       "Perturbation de lines et circles et pr{\\xb4e}servation de la topologie"
+, booktitle =   "Journ{\\xb4e}es de g{\\xb4e}ometrie algorithmique du Val d'Ajol"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{v-ilbtm-95
-, author =	"Nicolai Vorobjov"
-, title =	"Improved lower bound on testing membership to a polyhedron by algebraic decision trees"
-, booktitle =	"Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
-, nickname =	"FOCS '95"
-, year =	1995
-, pages =	"To appear"
-, update =	"98.07 bibrelex, 97.03 agarwal, 95.09 mitchell"
+, author =      "Nicolai Vorobjov"
+, title =       "Improved lower bound on testing membership to a polyhedron by algebraic decision trees"
+, booktitle =   "Proc. 36th Annu. IEEE Sympos. Found. Comput. Sci."
+, nickname =    "FOCS '95"
+, year =        1995
+, pages =       "To appear"
+, update =      "98.07 bibrelex, 97.03 agarwal, 95.09 mitchell"
 }
 
 @article{v-dmrsl-09
-, author =	"G. F. Vorono{\"\i}"
-, title =	"Deuxi{\`e}me m{\'e}moire: recherches sur les parall{\'e}loedres primitifs"
-, journal =	"J. Reine Angew. Math."
-, volume =	136
-, year =	1909
-, pages =	"67--181"
+, author =      "G. F. Vorono{\"\i}"
+, title =       "Deuxi{\`e}me m{\'e}moire: recherches sur les parall{\'e}loedres primitifs"
+, journal =     "J. Reine Angew. Math."
+, volume =      136
+, year =        1909
+, pages =       "67--181"
 }
 
 @article{v-nadpc-08
-, author =	"G. M. Voronoi"
-, title =	"Nouvelles applications des param{\`e}tres continus {\`a} la th{\'e}orie des formes quadratiques. Deuxi{\`e}me {M{\'e}moire}: Recherches sur les parall{\'e}llo{\`e}dres primitifs"
-, journal =	"J. Reine Angew. Math."
-, volume =	134
-, year =	1908
-, pages =	"198--287"
-, keywords =	"Voronoi diagrams"
-, update =	"93.09 held"
+, author =      "G. M. Voronoi"
+, title =       "Nouvelles applications des param{\`e}tres continus {\`a} la th{\'e}orie des formes quadratiques. Deuxi{\`e}me {M{\'e}moire}: Recherches sur les parall{\'e}llo{\`e}dres primitifs"
+, journal =     "J. Reine Angew. Math."
+, volume =      134
+, year =        1908
+, pages =       "198--287"
+, keywords =    "Voronoi diagrams"
+, update =      "93.09 held"
 }
 
 @article{v-nadpc-07
-, author =	"G. M. Voronoi"
-, title =	"Nouvelles applications des param{\`e}tres continus {\`a} la th{\'e}orie des formes quadratiques. Premier {M{\'e}moire}: Sur quelques propri{\'e}t{\'e}s des formes quadratiques positives parfaites"
-, journal =	"J. Reine Angew. Math."
-, volume =	133
-, year =	1907
-, pages =	"97--178"
-, update =	"93.09 held"
+, author =      "G. M. Voronoi"
+, title =       "Nouvelles applications des param{\`e}tres continus {\`a} la th{\'e}orie des formes quadratiques. Premier {M{\'e}moire}: Sur quelques propri{\'e}t{\'e}s des formes quadratiques positives parfaites"
+, journal =     "J. Reine Angew. Math."
+, volume =      133
+, year =        1907
+, pages =       "97--178"
+, update =      "93.09 held"
 }
 
 @techreport{vk-mnecd-82
-, author =	"K. Voss and R. Klette"
-, title =	"In the maximum number of edges of convex digital polygons included into a square"
-, number =	"N/82/6"
-, institution =	"Friedrich Schiller Univ., Jena"
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "K. Voss and R. Klette"
+, title =       "In the maximum number of edges of convex digital polygons included into a square"
+, number =      "N/82/6"
+, institution = "Friedrich Schiller Univ., Jena"
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @article{v-sccup-85
-, author =	"D. L. Vossler"
-, title =	"Sweep-to-{CSG} conversion using pattern recognition techniques"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	5
-, number =	8
-, month =	aug
-, year =	1985
-, pages =	"61--66"
+, author =      "D. L. Vossler"
+, title =       "Sweep-to-{CSG} conversion using pattern recognition techniques"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      5
+, number =      8
+, month =       aug
+, year =        1985
+, pages =       "61--66"
 }
 
 @article{vz-ctpci-92
-, author =	"S. Vre{\'c}ica and R. {\v Z}ivaljevi{\'c}"
-, title =	"The colored {T}verberg's problem and complexes of injective functions"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	61
-, year =	1992
-, pages =	"309--318"
-, comments =	"implies $o(n^d)$ bound for k-sets in any dimension d"
-, update =	"98.03 agarwal, 93.09 matousek"
+, author =      "S. Vre{\'c}ica and R. {\v Z}ivaljevi{\'c}"
+, title =       "The colored {T}verberg's problem and complexes of injective functions"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      61
+, year =        1992
+, pages =       "309--318"
+, comments =    "implies $o(n^d)$ bound for k-sets in any dimension d"
+, update =      "98.03 agarwal, 93.09 matousek"
 }
 
 @article{vs-dctds-91
-, author =	"G. Vriend and C. Sander"
-, title =	"Detection of common three-dimensional substructures in proteins"
-, journal =	"PROTEINS: Structure, Funcion, and Genetics"
-, volume =	11
-, year =	1991
-, pages =	"52--58"
-, update =	"98.07 bibrelex"
+, author =      "G. Vriend and C. Sander"
+, title =       "Detection of common three-dimensional substructures in proteins"
+, journal =     "PROTEINS: Structure, Funcion, and Genetics"
+, volume =      11
+, year =        1991
+, pages =       "52--58"
+, update =      "98.07 bibrelex"
 }
 
 @article{v-ulds-80
-, author =	"J. Vuillemin"
-, title =	"A unifying look at data structures"
-, journal =	"Commun. ACM"
-, volume =	23
-, year =	1980
-, pages =	"229--239"
+, author =      "J. Vuillemin"
+, title =       "A unifying look at data structures"
+, journal =     "Commun. ACM"
+, volume =      23
+, year =        1980
+, pages =       "229--239"
 }
 
 @book{w-rfeb-
-, author =	"E. Wachspress"
-, title =	"A Rational Finite Elemente Basis"
-, publisher =	"Academic Press"
-, address =	"New York, NY"
-, year =	"??"
-, update =	"98.03 bibrelex"
+, author =      "E. Wachspress"
+, title =       "A Rational Finite Elemente Basis"
+, publisher =   "Academic Press"
+, address =     "New York, NY"
+, year =        "??"
+, update =      "98.03 bibrelex"
 }
 
 @book{w-eidag-73
-, author =	"B. L. van der Waerden"
-, title =	"Einf{\"u}hrung in die {Algebraische} {Geometrie}"
-, edition =	"2nd"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1973
-, update =	"98.03 bibrelex"
+, author =      "B. L. van der Waerden"
+, title =       "Einf{\"u}hrung in die {Algebraische} {Geometrie}"
+, edition =     "2nd"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1973
+, update =      "98.03 bibrelex"
 }
 
 @book{w-ma-53
-, author =	"B. von der Waerden"
-, title =	"Modern Algebras"
-, publisher =	"Ungar"
-, year =	1953
-, note =	"Volumes 1-2"
-, update =	"98.03 bibrelex"
+, author =      "B. von der Waerden"
+, title =       "Modern Algebras"
+, publisher =   "Ungar"
+, year =        1953
+, note =        "Volumes 1-2"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{w-ophcs-92
-, author =	"H. Wagener"
-, title =	"Optimal parallel hull construction for simple polygons in {$O(\log\log n)$} time"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"593--599"
+, author =      "H. Wagener"
+, title =       "Optimal parallel hull construction for simple polygons in {$O(\log\log n)$} time"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "593--599"
 }
 
 @techreport{w-opach-85
-, author =	"H. Wagener"
-, title =	"Optimally parallel algorithms for convex hull determination"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1985
+, author =      "H. Wagener"
+, title =       "Optimally parallel algorithms for convex hull determination"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1985
 }
 
 @phdthesis{w-pcgup-85
-, author =	"H. Wagener"
-, title =	"Parallel Computational Geometry Using Polygonal Order"
-, school =	"Technical University of Berlin"
-, address =	"FRG"
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"93.09 held"
+, author =      "H. Wagener"
+, title =       "Parallel Computational Geometry Using Polygonal Order"
+, school =      "Technical University of Berlin"
+, address =     "FRG"
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "93.09 held"
 }
 
 @inproceedings{w-ptep-89
-, author =	"H. Wagener"
-, title =	"{Parallele} {Triangulierung} von einfachen {Polygonen}"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "H. Wagener"
+, title =       "{Parallele} {Triangulierung} von einfachen {Polygonen}"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{w-tmpp-88
-, author =	"H. Wagener"
-, title =	"Triangulating a monotone polygon in parallel"
-, booktitle =	"Computational Geometry and its Applications"
-, nickname =	"CG '88"
-, site =	"W{\"u}rzburg"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	333
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"136--147"
-, update =	"00.03 bibrelex, 99.11 bibrelex"
-, annote =	"4th Intern. Workshop Comput. Geom."
+, author =      "H. Wagener"
+, title =       "Triangulating a monotone polygon in parallel"
+, booktitle =   "Computational Geometry and its Applications"
+, nickname =    "CG '88"
+, site =        "W{\"u}rzburg"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      333
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "136--147"
+, update =      "00.03 bibrelex, 99.11 bibrelex"
+, annote =      "4th Intern. Workshop Comput. Geom."
 }
 
 @inproceedings{w-nakkc-91
-, author =	"Dorothea Wagner"
-, title =	"A New Approach to Knock-Knee Channel Routing"
-, booktitle =	"Proc. 2nd Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"83--93"
-, precedes =	"w-ortdc-93"
-, update =	"96.09 devillers, 94.01 smid, 93.09 milone+mitchell"
+, author =      "Dorothea Wagner"
+, title =       "A New Approach to Knock-Knee Channel Routing"
+, booktitle =   "Proc. 2nd Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "83--93"
+, precedes =    "w-ortdc-93"
+, update =      "96.09 devillers, 94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{w-ortdc-93
-, author =	"D. Wagner"
-, title =	"Optimal routing through dense chanels"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	3
-, year =	1993
-, pages =	"269--289"
-, keywords =	"VLSI design, knock knee chanel routing, wire length, number of bends, layer assignment"
-, succeeds =	"w-nakkc-91"
-, update =	"96.09 devillers"
+, author =      "D. Wagner"
+, title =       "Optimal routing through dense chanels"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      3
+, year =        1993
+, pages =       "269--289"
+, keywords =    "VLSI design, knock knee chanel routing, wire length, number of bends, layer assignment"
+, succeeds =    "w-nakkc-91"
+, update =      "96.09 devillers"
 }
 
 % ### verify year: 1992 ?
 @article{ww-gzops-91
-, author =	"D. Wagner and F. Wagner"
-, title =	"A Generalization of the Zero-One-Principle for Sorting Algorithms"
-, journal =	"Discrete Appl. Math."
-, volume =	30
-, year =	1991
-, pages =	"265--273"
-, update =	"97.03 gaertner+salinger"
+, author =      "D. Wagner and F. Wagner"
+, title =       "A Generalization of the Zero-One-Principle for Sorting Algorithms"
+, journal =     "Discrete Appl. Math."
+, volume =      30
+, year =        1991
+, pages =       "265--273"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{ww-eplta-92
-, author =	"D. Wagner and F. Wagner"
-, title =	"An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem"
-, journal =	"Discrete Appl. Math."
-, volume =	40
-, year =	1992
-, pages =	"73--81"
-, update =	"97.03 gaertner+salinger"
+, author =      "D. Wagner and F. Wagner"
+, title =       "An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem"
+, journal =     "Discrete Appl. Math."
+, volume =      40
+, year =        1992
+, pages =       "73--81"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{ww-bmcgb-93
-, author =	"D. Wagner and F. Wagner"
-, title =	"Between Min Cut and Graph Bisection"
-, booktitle =	"Proc. 18th Internat. Sympos. Math. Found. Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	711
-, year =	1993
-, pages =	"744--750"
-, update =	"97.03 gaertner+salinger"
+, author =      "D. Wagner and F. Wagner"
+, title =       "Between Min Cut and Graph Bisection"
+, booktitle =   "Proc. 18th Internat. Sympos. Math. Found. Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      711
+, year =        1993
+, pages =       "744--750"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{ww-ltaed-93
-, author =	"D. Wagner and K. Weihe"
-, title =	"A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs"
-, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
-, nickname =	"ESA '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	726
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"384--395"
-, update =	"95.05 tamassia"
+, author =      "D. Wagner and K. Weihe"
+, title =       "A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs"
+, booktitle =   "Proc. 1st Annu. European Sympos. Algorithms"
+, nickname =    "ESA '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      726
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "384--395"
+, update =      "95.05 tamassia"
 }
 
 @article{ww-ltaed-95
-, author =	"D. Wagner and K. Weihe"
-, title =	"A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs"
-, journal =	"Combinatorica"
-, volume =	15
-, number =	1
-, year =	1995
-, pages =	"135--150"
-, succeeds =	"ww-ltaed-93"
-, update =	"98.07 tamassia+vismara"
+, author =      "D. Wagner and K. Weihe"
+, title =       "A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs"
+, journal =     "Combinatorica"
+, volume =      15
+, number =      1
+, year =        1995
+, pages =       "135--150"
+, succeeds =    "ww-ltaed-93"
+, update =      "98.07 tamassia+vismara"
 }
 
 @inproceedings{ww-alcvr-95
-, author =	"Dorothea Wagner and Karsten Weihe"
-, title =	"An Animated Library of Combinatorial {VLSI}-Routing Algorithms"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"C28--C29"
-, keywords =	""
-, cites =	"bb-vrfls-84, fww-rtdcm-93, f-dprg-82, kww-aotlc-89, l-caicl-90, mp-rtr-86, mps-crkkm-86, pl-otlcr-84, swww-wkklg-94, w-ortdc-93, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Dorothea Wagner and Karsten Weihe"
+, title =       "An Animated Library of Combinatorial {VLSI}-Routing Algorithms"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "C28--C29"
+, keywords =    ""
+, cites =       "bb-vrfls-84, fww-rtdcm-93, f-dprg-82, kww-aotlc-89, l-caicl-90, mp-rtr-86, mps-crkkm-86, pl-otlcr-84, swww-wkklg-94, w-ortdc-93, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{w-amlon-94
-, author =	"F. Wagner"
-, title =	"Approximate map labeling is in {$\Omega(n \log n)$}"
-, journal =	"Inform. Process. Lett."
-, volume =	52
-, year =	1994
-, pages =	"161--165"
-, update =	"95.01 smid"
+, author =      "F. Wagner"
+, title =       "Approximate map labeling is in {$\Omega(n \log n)$}"
+, journal =     "Inform. Process. Lett."
+, volume =      52
+, year =        1994
+, pages =       "161--165"
+, update =      "95.01 smid"
 }
 
 @inproceedings{ww-swrcg-91
-, author =	"Frank Wagner and Barbara Wolfers"
-, title =	"Short Wire Routing in Convex Grids"
-, booktitle =	"Proc. 2nd Internat. Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	557
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"72--82"
-, update =	"94.01 smid, 93.09 milone+mitchell"
+, author =      "Frank Wagner and Barbara Wolfers"
+, title =       "Short Wire Routing in Convex Grids"
+, booktitle =   "Proc. 2nd Internat. Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      557
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "72--82"
+, update =      "94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{ww-pmla-97
-, author =	"F. Wagner and A. Wolff"
-, title =	"A practical map labeling algorithm"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, year =	1997
-, pages =	"387--404"
-, update =	"97.07 devillers"
+, author =      "F. Wagner and A. Wolff"
+, title =       "A practical map labeling algorithm"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, year =        1997
+, pages =       "387--404"
+, update =      "97.07 devillers"
 }
 
 @inproceedings{ww-eeaam-95
-, author =	"F. Wagner and A. Wolff"
-, title =	"An Efficient and Effective Approximation Algorithm for the Map Labeling Problem"
-, booktitle =	"Proc. 3rd Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	979
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"420--433"
-, update =	"97.07 agarwal, 97.03 gaertner+salinger"
+, author =      "F. Wagner and A. Wolff"
+, title =       "An Efficient and Effective Approximation Algorithm for the Map Labeling Problem"
+, booktitle =   "Proc. 3rd Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      979
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "420--433"
+, update =      "97.07 agarwal, 97.03 gaertner+salinger"
 }
 
 @inproceedings{ww-frml-95
-, author =	"F. Wagner and A. Wolff"
-, title =	"Fast and Reliable Map Labeling"
-, booktitle =	"Proc. 9th Internat. Symp. on Computer Science for Environment Protection"
-, year =	1995
-, pages =	"667--675"
-, update =	"97.03 gaertner+salinger"
+, author =      "F. Wagner and A. Wolff"
+, title =       "Fast and Reliable Map Labeling"
+, booktitle =   "Proc. 9th Internat. Symp. on Computer Science for Environment Protection"
+, year =        1995
+, pages =       "667--675"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{ww-mlhpg-95
-, author =	"Frank Wagner and Alexander Wolff"
-, title =	"Map Labeling Heuristics: {Provably} Good and Practically Useful"
-, booktitle =	"Proc. 11th Annu. ACM Sympos. Comput. Geom."
-, year =	1995
-, pages =	"109--118"
-, keywords =	"experimental, approximation algorithm"
-, cites =	"aik-vspca-89, eis-ctmfp-76, f-agpsp-92, fw-ppalm-91, i-pnm-75, kr-pcr-92, mn-lledt-89, ia-eaggs-86, kmps-eagpp-93, w-amlon-94, wka-appma-94, ZZZ"
-, update =	"98.03 bibrelex, 95.09 mitchell"
+, author =      "Frank Wagner and Alexander Wolff"
+, title =       "Map Labeling Heuristics: {Provably} Good and Practically Useful"
+, booktitle =   "Proc. 11th Annu. ACM Sympos. Comput. Geom."
+, year =        1995
+, pages =       "109--118"
+, keywords =    "experimental, approximation algorithm"
+, cites =       "aik-vspca-89, eis-ctmfp-76, f-agpsp-92, fw-ppalm-91, i-pnm-75, kr-pcr-92, mn-lledt-89, ia-eaggs-86, kmps-eagpp-93, w-amlon-94, wka-appma-94, ZZZ"
+, update =      "98.03 bibrelex, 95.09 mitchell"
 }
 
 @article{w-bzv-36
-, author =	"K. Wagner"
-, title =	"{B}emerkungen zum {V}ierfarbenproblem"
-, journal =	"Jahresbericht der Deutschen Mathematiker-Vereinigung"
-, volume =	46
-, year =	1936
-, pages =	"26--32"
-, keywords =	"graph drawing"
-, update =	"98.11 bibrelex, 98.07 vismara, 93.09 tamassia"
-, annote =	"Shows that any triangulation can be transformed into
-		 any other by flips."
+, author =      "K. Wagner"
+, title =       "{B}emerkungen zum {V}ierfarbenproblem"
+, journal =     "Jahresbericht der Deutschen Mathematiker-Vereinigung"
+, volume =      46
+, year =        1936
+, pages =       "26--32"
+, keywords =    "graph drawing"
+, update =      "98.11 bibrelex, 98.07 vismara, 93.09 tamassia"
+, annote =      "Shows that any triangulation can be transformed into
+                 any other by flips."
 }
 
 @article{w-sf-76
-, author =	{Neal R. Wagner}
+, author =      {Neal R. Wagner}
 , title =       {The Sofa Problem}
 , year =        {1976}
 , journal =     {The American Mathematical Monthly}
@@ -145404,767 +145404,767 @@ @article{w-sf-76
 }
 
 @inproceedings{ww-oedca-00
-, author =	"Uli Wagner and Emo Welzl"
-, title =	"Origin-Embracing Distributions, or A Continuous Analogue of the Upper Bound Theorem"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"50--56"
-, update =	"00.11 jones"
+, author =      "Uli Wagner and Emo Welzl"
+, title =       "Origin-Embracing Distributions, or A Continuous Analogue of the Upper Bound Theorem"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "50--56"
+, update =      "00.11 jones"
 }
 
 @article{w-sfsnd-84
-, author =	"G. Wahba"
-, title =	"Surface fitting with scattered noisy data on {Euclidean} $d$-space and on the sphere"
-, journal =	"Rocky Mountain J. Math."
-, volume =	14
-, number =	1
-, year =	1984
-, pages =	"281--299"
+, author =      "G. Wahba"
+, title =       "Surface fitting with scattered noisy data on {Euclidean} $d$-space and on the sphere"
+, journal =     "Rocky Mountain J. Math."
+, volume =      14
+, number =      1
+, year =        1984
+, pages =       "281--299"
 }
 
 @article{wc-stp2t-83
-, author =	"J. A. Wald and C. J. Colbourn"
-, title =	"Steiner trees, partial $2$-trees, and minimum {IFI} networks"
-, journal =	"Networks"
-, volume =	13
-, year =	1983
-, pages =	"159--167"
+, author =      "J. A. Wald and C. J. Colbourn"
+, title =       "Steiner trees, partial $2$-trees, and minimum {IFI} networks"
+, journal =     "Networks"
+, volume =      13
+, year =        1983
+, pages =       "159--167"
 }
 
 @article{ws-rqipu-86
-, author =	"J. A. Wald and P. G. Sorenson"
-, title =	"Resolving the query inference problem using {Steiner} trees"
-, journal =	"ACM Trans. Database Syst."
-, volume =	9
-, year =	1986
-, pages =	"348--368"
+, author =      "J. A. Wald and P. G. Sorenson"
+, title =       "Resolving the query inference problem using {Steiner} trees"
+, journal =     "ACM Trans. Database Syst."
+, volume =      9
+, year =        1986
+, pages =       "348--368"
 }
 
 @book{w-gimk-57
-, author =	"A. Walfisz"
-, title =	"Gitterpunkte in mehrdimensionalischen {Kugeln}"
-, publisher =	"Panstwowe Wydawnictwo Naukowe"
-, address =	"Warszawa, Poland"
-, year =	1957
-, update =	"97.11 bibrelex"
+, author =      "A. Walfisz"
+, title =       "Gitterpunkte in mehrdimensionalischen {Kugeln}"
+, publisher =   "Panstwowe Wydawnictwo Naukowe"
+, address =     "Warszawa, Poland"
+, year =        1957
+, update =      "97.11 bibrelex"
 }
 
 @article{w-npagt-90
-, author =	"J. Q. {Walker II}"
-, title =	"A Node-positioning Algorithm for General Trees"
-, journal =	"Softw. -- Pract. Exp."
-, volume =	20
-, number =	7
-, year =	1990
-, pages =	"685--705"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Q. {Walker II}"
+, title =       "A Node-positioning Algorithm for General Trees"
+, journal =     "Softw. -- Pract. Exp."
+, volume =      20
+, number =      7
+, year =        1990
+, pages =       "685--705"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{w-ac-62
-, author =	"R. Walker"
-, title =	"Algebraic Curves"
-, publisher =	"Dover"
-, year =	1962
-, update =	"98.03 bibrelex"
+, author =      "R. Walker"
+, title =       "Algebraic Curves"
+, publisher =   "Dover"
+, year =        1962
+, update =      "98.03 bibrelex"
 }
 
 @book{w-ac-78
-, author =	"R. Walker"
-, title =	"Algebraic Curves"
-, publisher =	"Springer-Verlag"
-, address =	"New York, NY"
-, year =	1978
-, update =	"98.03 bibrelex"
+, author =      "R. Walker"
+, title =       "Algebraic Curves"
+, publisher =   "Springer-Verlag"
+, address =     "New York, NY"
+, year =        1978
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ws-ppptu-99
-, author =	"R. J. Walker and J. Snoeyink"
-, title =	"Practical Point-in-Polygon Tests Using {CSG} Representations of Polygons"
-, editor =	"M. T. Goodrich and C. C. McGeoch"
-, booktitle =	"Algorithm Engineering and Experimentation (Proc. ALENEX~'99)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1619
-, publisher =	"Springer-Verlag"
-, year =	1999
-, pages =	"114--123"
-, update =	"00.11 smid, 00.07 vismara"
+, author =      "R. J. Walker and J. Snoeyink"
+, title =       "Practical Point-in-Polygon Tests Using {CSG} Representations of Polygons"
+, editor =      "M. T. Goodrich and C. C. McGeoch"
+, booktitle =   "Algorithm Engineering and Experimentation (Proc. ALENEX~'99)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1619
+, publisher =   "Springer-Verlag"
+, year =        1999
+, pages =       "114--123"
+, update =      "00.11 smid, 00.07 vismara"
 }
 
 @inproceedings{ws-ceays-93
-, author =	"R. K. Walker and V. Srinivasan"
-, title =	"Creation and Evolution of the {ASME} {Y14.5.1M} Standard"
-, booktitle =	"Proc. 1993 Int. Forum on Dimensional Tolerancing and Metrology"
-, year =	1993
-, pages =	"19--30"
-, update =	"96.09 orourke"
+, author =      "R. K. Walker and V. Srinivasan"
+, title =       "Creation and Evolution of the {ASME} {Y14.5.1M} Standard"
+, booktitle =   "Proc. 1993 Int. Forum on Dimensional Tolerancing and Metrology"
+, year =        1993
+, pages =       "19--30"
+, update =      "96.09 orourke"
 }
 
 @article{ws-ceays-94
-, author =	"R. K. Walker and V. Srinivasan"
-, title =	"Creation and evolution of the {ASME Y14.5.1M} standard"
-, journal =	"Manufacturing Review"
-, volume =	7
-, number =	4
-, year =	1994
-, pages =	"16--23"
-, update =	"98.03 agarwal"
+, author =      "R. K. Walker and V. Srinivasan"
+, title =       "Creation and evolution of the {ASME Y14.5.1M} standard"
+, journal =     "Manufacturing Review"
+, volume =      7
+, number =      4
+, year =        1994
+, pages =       "16--23"
+, update =      "98.03 agarwal"
 }
 
 @article{weh-rtapr-89
-, author =	"J. R. Wallace and K. A. Elmquist and E. A. Haines"
-, title =	"A ray tracing algorithm for progressive radiosity"
-, journal =	"Comput. Graph."
-, volume =	23
-, number =	3
-, year =	1989
-, pages =	"315--324"
-, note =	"Proc. SIGGRAPH '89"
-, update =	"98.03 bibrelex"
+, author =      "J. R. Wallace and K. A. Elmquist and E. A. Haines"
+, title =       "A ray tracing algorithm for progressive radiosity"
+, journal =     "Comput. Graph."
+, volume =      23
+, number =      3
+, year =        1989
+, pages =       "315--324"
+, note =        "Proc. SIGGRAPH '89"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{wbs-vbvct-92
-, author =	"R. S. Wallace and B. B. Bederson and E. L. Schwartz"
-, title =	"Voice bandwidth visual communication through logmaps: {The} {Telecortex}"
-, booktitle =	"Workshop on Applications of Computer Vision"
-, year =	1992
-, pages =	"4--10"
-, update =	"98.07 bibrelex"
+, author =      "R. S. Wallace and B. B. Bederson and E. L. Schwartz"
+, title =       "Voice bandwidth visual communication through logmaps: {The} {Telecortex}"
+, booktitle =   "Workshop on Applications of Computer Vision"
+, year =        1992
+, pages =       "4--10"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{wc-pmhf-94
-, author =	"A. Wallack and J. Canny"
-, title =	"Planning for modular and hybrid fixtures"
-, booktitle =	"Proc. 11th IEEE Internat. Conf. Robot. Autom."
-, month =	may
-, year =	1994
-, update =	"98.03 bibrelex"
+, author =      "A. Wallack and J. Canny"
+, title =       "Planning for modular and hybrid fixtures"
+, booktitle =   "Proc. 11th IEEE Internat. Conf. Robot. Autom."
+, month =       may
+, year =        1994
+, update =      "98.03 bibrelex"
 }
 
 @article{wc-pmhf-97
-, author =	"A. S. Wallack and J. F. Canny"
-, title =	"Planning for Modular and Hybrid Fixtures"
-, journal =	"Algorithmica"
-, volume =	19
-, number =	"1--2"
-, month =	sep
-, year =	1997
-, pages =	"40--60"
-, update =	"97.07 held"
+, author =      "A. S. Wallack and J. F. Canny"
+, title =       "Planning for Modular and Hybrid Fixtures"
+, journal =     "Algorithmica"
+, volume =      19
+, number =      "1--2"
+, month =       sep
+, year =        1997
+, pages =       "40--60"
+, update =      "97.07 held"
 }
 
 @mastersthesis{w-sdssr-79
-, author =	"J. Walsh"
-, title =	"The Simulation of Directional Sound Sources in Rooms by Means of a Digital Computer"
-, school =	"Univ. Western Ontario"
-, address =	"London, Ontario, Canada"
-, year =	1979
-, note =	"M. Mus. Thesis"
-, keywords =	"master thesis"
-, update =	"97.11 bibrelex"
+, author =      "J. Walsh"
+, title =       "The Simulation of Directional Sound Sources in Rooms by Means of a Digital Computer"
+, school =      "Univ. Western Ontario"
+, address =     "London, Ontario, Canada"
+, year =        1979
+, note =        "M. Mus. Thesis"
+, keywords =    "master thesis"
+, update =      "97.11 bibrelex"
 }
 
 @misc{wd-ddgsr-81
-, author =	"J. Walsh and N. Dadoun"
-, title =	"The Design and Development of {GODOT}: {A} System for Room Acoustics Modelling"
-, howpublished =	"Presented at 101st Meeting of the Acoustical Society of America"
-, month =	may
-, year =	1981
-, update =	"97.11 bibrelex"
+, author =      "J. Walsh and N. Dadoun"
+, title =       "The Design and Development of {GODOT}: {A} System for Room Acoustics Modelling"
+, howpublished =        "Presented at 101st Meeting of the Acoustical Society of America"
+, month =       may
+, year =        1981
+, update =      "97.11 bibrelex"
 }
 
 @misc{wd-wawwd-82
-, author =	"J. Walsh and N. Dadoun"
-, title =	"What Are We Waiting for? {Development} of {GODOT} {II}"
-, howpublished =	"Presented at 103rd Meeting of the Acoustical Society of America"
-, month =	apr
-, year =	1982
-, update =	"97.11 bibrelex"
+, author =      "J. Walsh and N. Dadoun"
+, title =       "What Are We Waiting for? {Development} of {GODOT} {II}"
+, howpublished =        "Presented at 103rd Meeting of the Acoustical Society of America"
+, month =       apr
+, year =        1982
+, update =      "97.11 bibrelex"
 }
 
 @book{wo-ich-81
-, title =	"Iron castings handbook"
-, editor =	"C. F. Walton and T. J. Opar"
-, publisher =	"Iron Casting Society, Inc."
-, year =	1981
-, update =	"98.03 bibrelex"
+, title =       "Iron castings handbook"
+, editor =      "C. F. Walton and T. J. Opar"
+, publisher =   "Iron Casting Society, Inc."
+, year =        1981
+, update =      "98.03 bibrelex"
 }
 
 @article{wwp-amdc-88
-, author =	"S. J. Wan and S. K. M. Wong and P. Prusinkiewicz"
-, title =	"An algorithm for multidimensional data clustering"
-, journal =	"ACM Trans. Math. Softw."
-, volume =	14
-, number =	2
-, year =	1988
-, pages =	"153--162"
-, update =	"97.11 bibrelex"
+, author =      "S. J. Wan and S. K. M. Wong and P. Prusinkiewicz"
+, title =       "An algorithm for multidimensional data clustering"
+, journal =     "ACM Trans. Math. Softw."
+, volume =      14
+, number =      2
+, year =        1988
+, pages =       "153--162"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{w-ngvdp-87
-, author =	"C. Wang"
-, title =	"A new generalization of {Voronoi} diagrams in the plane"
-, school =	"University of Alberta"
-, address =	"Edmonton, Alberta, Canada"
-, year =	1987
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "C. Wang"
+, title =       "A new generalization of {Voronoi} diagrams in the plane"
+, school =      "University of Alberta"
+, address =     "Edmonton, Alberta, Canada"
+, year =        1987
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{w-oagts-93
-, author =	"C. Wang"
-, title =	"An optimal algorithm for greedy triangulation of a set of points"
-, institution =	"Memorial University of Newfoundland"
-, year =	1983
-, succeeds =	"w-oagts-94"
-, update =	"98.11 bibrelex"
+, author =      "C. Wang"
+, title =       "An optimal algorithm for greedy triangulation of a set of points"
+, institution = "Memorial University of Newfoundland"
+, year =        1983
+, succeeds =    "w-oagts-94"
+, update =      "98.11 bibrelex"
 }
 
 @phdthesis{w-imdpp-83
-, author =	"C. Wang"
-, title =	"Intersection and minimum distance problems for planar polygons"
-, school =	"University of Alberta"
-, address =	"Department of Computing Science"
-, year =	1983
-, keywords =	"doctoral thesis"
-, update =	"97.11 bibrelex"
+, author =      "C. Wang"
+, title =       "Intersection and minimum distance problems for planar polygons"
+, school =      "University of Alberta"
+, address =     "Department of Computing Science"
+, year =        1983
+, keywords =    "doctoral thesis"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{w-oagts-94
-, author =	"C. A. Wang"
-, title =	"An Optimal Algorithm for Greedy Triangulation of a Set of Points"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"332--338"
-, succeeds =	"w-oagts-93"
-, cites =	"a-lncg-88, cg-vippg-89, ddmw-fgta-94, g-segta-89, k-ndot-80, l-seagt-87a, ll-abgtc-87, ll-fagt-92, ll-gtaoc-91, ps-cgi-85, s-cdtvd-88, hs-parss-93, w-eucdt-93, w-oagts-93, g-nrpt-79, ls-tacdt-80, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "C. A. Wang"
+, title =       "An Optimal Algorithm for Greedy Triangulation of a Set of Points"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "332--338"
+, succeeds =    "w-oagts-93"
+, cites =       "a-lncg-88, cg-vippg-89, ddmw-fgta-94, g-segta-89, k-ndot-80, l-seagt-87a, ll-abgtc-87, ll-fagt-92, ll-gtaoc-91, ps-cgi-85, s-cdtvd-88, hs-parss-93, w-eucdt-93, w-oagts-93, g-nrpt-79, ls-tacdt-80, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{w-cdmpp-89
-, author =	"C. A. Wang"
-, title =	"Collision detection of a moving polygon in the presence of polygonal obstacles in the plane"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	35
+, author =      "C. A. Wang"
+, title =       "Collision detection of a moving polygon in the presence of polygonal obstacles in the plane"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       35
 }
 
 @article{w-eucdt-93
-, author =	"C. A. Wang"
-, title =	"Efficiently updating the constrained {Delaunay} triangulations"
-, journal =	"BIT"
-, volume =	33
-, year =	1993
-, pages =	"238--252"
-, update =	"94.05 drysdale"
+, author =      "C. A. Wang"
+, title =       "Efficiently updating the constrained {Delaunay} triangulations"
+, journal =     "BIT"
+, volume =      33
+, year =        1993
+, pages =       "238--252"
+, update =      "94.05 drysdale"
 }
 
 @techreport{wc-fmvvd-86t
-, author =	"C. A. Wang and E. P. F. Chan"
-, title =	"Finding the minimum visible vertex distance between two nonintersecting simple polygons"
-, institution =	"Department of Computing Science, University of Alberta"
-, year =	1986
-, precedes =	"wc-fmvvd-86"
-, update =	"97.11 bibrelex"
+, author =      "C. A. Wang and E. P. F. Chan"
+, title =       "Finding the minimum visible vertex distance between two nonintersecting simple polygons"
+, institution = "Department of Computing Science, University of Alberta"
+, year =        1986
+, precedes =    "wc-fmvvd-86"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{wc-fmvvd-86
-, author =	"C. A. Wang and E. P. F. Chan"
-, title =	"Finding the minimum visible vertex distance between two nonintersecting simple polygons"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"34--42"
-, succeeds =	"wc-fmvvd-86t"
-, cites =	"abosy-fmcnp-85, bo-arcgi-79, be-nlcha-84, cd-diec-80, cw-oaimd-83, csw-uacpc-85, e-cedbt-82, fm-tspep-84, gjpt-tsp-78, k-eccs-79, lp-cgs-84, ld-gvdp-81, mt-fmvdb-83, so-fmnp-85t, t-oacmv-83, w-imdpp-83, www-dpcgf-85, wc-fmvvd-86t, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "C. A. Wang and E. P. F. Chan"
+, title =       "Finding the minimum visible vertex distance between two nonintersecting simple polygons"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "34--42"
+, succeeds =    "wc-fmvvd-86t"
+, cites =       "abosy-fmcnp-85, bo-arcgi-79, be-nlcha-84, cd-diec-80, cw-oaimd-83, csw-uacpc-85, e-cedbt-82, fm-tspep-84, gjpt-tsp-78, k-eccs-79, lp-cgs-84, ld-gvdp-81, mt-fmvdb-83, so-fmnp-85t, t-oacmv-83, w-imdpp-83, www-dpcgf-85, wc-fmvvd-86t, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{wc-gtp3d-94
-, author =	"C. A. Wang and F. Y. Chin"
-, title =	"On Greedy Tetrahedralization of Points in 3-{D}"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"532--540"
-, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
+, author =      "C. A. Wang and F. Y. Chin"
+, title =       "On Greedy Tetrahedralization of Points in 3-{D}"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "532--540"
+, update =      "99.11 bibrelex, 98.03 smid, 96.05 mitchell"
 }
 
 @inproceedings{ws-oacdt-87
-, author =	"C. A. Wang and L. Schubert"
-, title =	"An optimal algorithm for constructing the {Delaunay} triangulation of a set of line segments"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"223--232"
-, cites =	"ahu-daca-74, ae-oacwv-84, bo-arcgi-79, c-tpca-82, cgl-pgd-83, cw-oaimd-83, dk-ladsc-85, egs-oplms-86, eos-calha-83, f-savd-86, gjpt-tsp-78, k-eccs-79, k-osps-83, l-ccit-76, ls-tacdt-80, lp-cgs-84, l-prp-78, l-tdvdl-80, ll-gdtpg-86, ph-chfsp-77, ps-cgi-85, sh-cpp-75, ta-chapi-82, w-ngvdp-87, y-oavds-84, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "C. A. Wang and L. Schubert"
+, title =       "An optimal algorithm for constructing the {Delaunay} triangulation of a set of line segments"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "223--232"
+, cites =       "ahu-daca-74, ae-oacwv-84, bo-arcgi-79, c-tpca-82, cgl-pgd-83, cw-oaimd-83, dk-ladsc-85, egs-oplms-86, eos-calha-83, f-savd-86, gjpt-tsp-78, k-eccs-79, k-osps-83, l-ccit-76, ls-tacdt-80, lp-cgs-84, l-prp-78, l-tdvdl-80, ll-gdtpg-86, ph-chfsp-77, ps-cgi-85, sh-cpp-75, ta-chapi-82, w-ngvdp-87, y-oavds-84, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{wt-fcwvd-90
-, author =	"C. A. Wang and P. Y. Tsin"
-, title =	"Finding constrained and weighted {Voronoi} diagrams in the place"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"200--203"
-, cites =	"ae-oacwv-84, eos-calha-86, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "C. A. Wang and P. Y. Tsin"
+, title =       "Finding constrained and weighted {Voronoi} diagrams in the place"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "200--203"
+, cites =       "ae-oacwv-84, eos-calha-86, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{wt-otpat-87
-, author =	"C. A. Wang and Y. H. Tsin"
-, title =	"An {$O(\log n)$} time parallel algorithm for triangulating a set of points in the plane"
-, journal =	"Inform. Process. Lett."
-, volume =	25
-, year =	1987
-, pages =	"55--60"
+, author =      "C. A. Wang and Y. H. Tsin"
+, title =       "An {$O(\log n)$} time parallel algorithm for triangulating a set of points in the plane"
+, journal =     "Inform. Process. Lett."
+, volume =      25
+, year =        1987
+, pages =       "55--60"
 }
 
 @inproceedings{wt-eucdt-92
-, author =	"C. A. Wang and Y. H. Tsin"
-, title =	"Efficiently updating constrained {Delaunay} triangulations"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"176--181"
-, cites =	"aw-cg-88, agss-ltacv-89, a-vdsfg-91, c-cdt-87, dl-cvdrp-91, jw-dcvdd-88, ll-gdtpg-86, ll-abgtc-87, ll-fagt-90, l-seagt-87, l-vdbsd-89, ps-cgi-85, s-cdtvd-88, ws-oacdt-87, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "C. A. Wang and Y. H. Tsin"
+, title =       "Efficiently updating constrained {Delaunay} triangulations"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "176--181"
+, cites =       "aw-cg-88, agss-ltacv-89, a-vdsfg-91, c-cdt-87, dl-cvdrp-91, jw-dcvdd-88, ll-gdtpg-86, ll-abgtc-87, ll-fagt-90, l-seagt-87, l-vdbsd-89, ps-cgi-85, s-cdtvd-88, ws-oacdt-87, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{wt-fcwvd-98
-, author =	"Cao An Wang and Yung H. Tsin"
-, title =	"Finding constrained and weighted {Voronoi} diagrams in the plane"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	10
-, year =	1998
-, pages =	"89--104"
-, succeeds =	"wt-fcwvd-90"
-, update =	"98.11 devillers"
+, author =      "Cao An Wang and Yung H. Tsin"
+, title =       "Finding constrained and weighted {Voronoi} diagrams in the plane"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      10
+, year =        1998
+, pages =       "89--104"
+, succeeds =    "wt-fcwvd-90"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{wt-fcvsl-91
-, author =	"C. A. Wang and Y. H. Tsin"
-, title =	"Finding the closest and visible sites for a line in the presenc e of barriers"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"92--95"
-, cites =	"aaghi-vdp-86, at-oadvp-81, ea-lacvp-81, bkt-dsvp-89, ps-cgi-85, gt-ltasc-83, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "C. A. Wang and Y. H. Tsin"
+, title =       "Finding the closest and visible sites for a line in the presenc e of barriers"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "92--95"
+, cites =       "aaghi-vdp-86, at-oadvp-81, ea-lacvp-81, bkt-dsvp-89, ps-cgi-85, gt-ltasc-83, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{wy-lbbsb-01
-, author =	"C. A. Wang and B. Yang"
-, title =	"A lower bound for {$\beta$}-skeleton belonging to minimum weight triangulations"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	19
-, year =	2001
-, pages =	"35--46"
-, update =	"01.07 smid"
+, author =      "C. A. Wang and B. Yang"
+, title =       "A lower bound for {$\beta$}-skeleton belonging to minimum weight triangulations"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      19
+, year =        2001
+, pages =       "35--46"
+, update =      "01.07 smid"
 }
 
 @inproceedings{wy-otscp-00
-, author =	"Cao An Wang and Boting Yang"
-, title =	"Optimal Tetrahedralizations of Some Convex Polyhedra"
-, booktitle =	"Abstracts 16th European Workshop Comput. Geom."
-, nickname =	"CG 2000"
-, site =	"Eilat"
-, publisher =	"Ben-Gurion University of the Negev"
-, year =	2000
-, pages =	"5--9"
-, update =	"00.03 bibrelex"
+, author =      "Cao An Wang and Boting Yang"
+, title =       "Optimal Tetrahedralizations of Some Convex Polyhedra"
+, booktitle =   "Abstracts 16th European Workshop Comput. Geom."
+, nickname =    "CG 2000"
+, site =        "Eilat"
+, publisher =   "Ben-Gurion University of the Negev"
+, year =        2000
+, pages =       "5--9"
+, update =      "00.03 bibrelex"
 }
 
 @inproceedings{wy-pcp-99
-, author =	"Cao An Wang and Bo-Ting Yang"
-, title =	"On some Polyhedra Covering Problems"
-, booktitle =	"Abstracts 15th European Workshop Comput. Geom."
-, nickname =	"CG '99"
-, site =	"Antibes"
-, publisher =	"INRIA Sophia-Antipolis"
-, year =	1999
-, pages =	"119--122"
-, update =	"00.03 bibrelex, 99.07 bibrelex"
+, author =      "Cao An Wang and Bo-Ting Yang"
+, title =       "On some Polyhedra Covering Problems"
+, booktitle =   "Abstracts 15th European Workshop Comput. Geom."
+, nickname =    "CG '99"
+, site =        "Antibes"
+, publisher =   "INRIA Sophia-Antipolis"
+, year =        1999
+, pages =       "119--122"
+, update =      "00.03 bibrelex, 99.07 bibrelex"
 }
 
 @inproceedings{wz-slpr-97
-, author =	"Cao An Wang and Binhai Zhu"
-, title =	"Shooter Location Problems Revisited"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"223--228"
-, update =	"97.11 jones"
+, author =      "Cao An Wang and Binhai Zhu"
+, title =       "Shooter Location Problems Revisited"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "223--228"
+, update =      "97.11 jones"
 }
 
 @phdthesis{w-mddsmp-97
-, author =	"C.-H. Wang"
-, title =	"Manufacturability-driven decomposition of sheet metal products"
-, school =	"Carnegie Mellon University, The Robotics Institute"
-, year =	1997
-, keywords =	"manufacturing,polytopes"
-, update =	"98.11 orourke"
+, author =      "C.-H. Wang"
+, title =       "Manufacturability-driven decomposition of sheet metal products"
+, school =      "Carnegie Mellon University, The Robotics Institute"
+, year =        1997
+, keywords =    "manufacturing,polytopes"
+, update =      "98.11 orourke"
 }
 
 @inproceedings{wg-ctdt-96
-, author =	"D. Wang and J. A. Goldak"
-, title =	"Correcting topological defects of tessellations"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"50--55"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "D. Wang and J. A. Goldak"
+, title =       "Correcting topological defects of tessellations"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "50--55"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{wl-oasrm-93
-, author =	"D. Wang and R. Lee"
-, title =	"An optimal algorithm for solving the restricted minimal convex nested polygonal section problem"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"334--339"
-, succeeds =	"wl-oasrm-92"
-, cites =	"abosy-fmcnp-89, ll-ccmp-84, ps-cgi-85, wl-oasrm-92, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "D. Wang and R. Lee"
+, title =       "An optimal algorithm for solving the restricted minimal convex nested polygonal section problem"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "334--339"
+, succeeds =    "wl-oasrm-92"
+, cites =       "abosy-fmcnp-89, ll-ccmp-84, ps-cgi-85, wl-oasrm-92, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @article{w-oacob-01
-, author =	"D. P. Wang"
-, title =	"An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	79
-, year =	2001
-, pages =	"229--236"
-, update =	"02.03 cheong"
+, author =      "D. P. Wang"
+, title =       "An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      79
+, year =        2001
+, pages =       "229--236"
+, update =      "02.03 cheong"
 }
 
 @inproceedings{whcl-psapa-93
-, author =	"D. P. Wang and N. F. Huang and H. S. Chao and R. C. T. Lee"
-, title =	"Plane Sweep Algorithms for Polygonal Approximation Problems with Applications"
-, booktitle =	"Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '93"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	762
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"515--522"
-, update =	"98.07 bibrelex, 94.05 smid, 93.09 milone+mitchell"
+, author =      "D. P. Wang and N. F. Huang and H. S. Chao and R. C. T. Lee"
+, title =       "Plane Sweep Algorithms for Polygonal Approximation Problems with Applications"
+, booktitle =   "Proc. 4th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '93"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      762
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "515--522"
+, update =      "98.07 bibrelex, 94.05 smid, 93.09 milone+mitchell"
 }
 
 @techreport{wl-oasrm-92
-, author =	"D. P. Wang and R. C. T. Lee"
-, title =	"An Optimal Algorithm for Solving the Restricted minimal Convex nested Polygonal Separation Problem"
-, type =	"Technical Report"
-, year =	1992
-, precedes =	"wl-oasrm-93"
-, update =	"98.11 bibrelex"
+, author =      "D. P. Wang and R. C. T. Lee"
+, title =       "An Optimal Algorithm for Solving the Restricted minimal Convex nested Polygonal Separation Problem"
+, type =        "Technical Report"
+, year =        1992
+, precedes =    "wl-oasrm-93"
+, update =      "98.11 bibrelex"
 }
 
 @article{wk-stglp-88
-, author =	"D. W. Wang and Y. S. Kuo"
-, title =	"A Study of Two Geometric Location Problems"
-, journal =	"Inf. Proc. Letters"
-, volume =	28
-, number =	6
-, month =	aug
-, year =	1988
-, pages =	"281--286"
-, update =	"98.07 bibrelex"
+, author =      "D. W. Wang and Y. S. Kuo"
+, title =       "A Study of Two Geometric Location Problems"
+, journal =     "Inf. Proc. Letters"
+, volume =      28
+, number =      6
+, month =       aug
+, year =        1988
+, pages =       "281--286"
+, update =      "98.07 bibrelex"
 }
 
 @article{w-piavp-93
-, author =	"F. Wang"
-, title =	"A Parallel Intersection Algorithm for Vector Polygon Overlay"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	13
-, number =	2
-, month =	mar
-, year =	1993
-, pages =	"74--81"
-, update =	"93.09 held"
+, author =      "F. Wang"
+, title =       "A Parallel Intersection Algorithm for Vector Polygon Overlay"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      13
+, number =      2
+, month =       mar
+, year =        1993
+, pages =       "74--81"
+, update =      "93.09 held"
 }
 
 @article{w-smfib-84
-, author =	"G. Wang"
-, title =	"The subdivision method of finding the intersection between two {Bezier} curves or surfaces"
-, journal =	"Zhejiang Univ. J., Special issue on Computational Geometry"
-, volume =	"??"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "G. Wang"
+, title =       "The subdivision method of finding the intersection between two {Bezier} curves or surfaces"
+, journal =     "Zhejiang Univ. J., Special issue on Computational Geometry"
+, volume =      "??"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{w-glc-65
-, author =	"H. Wang"
-, title =	"Games, logic and computers"
-, journal =	"Scientific Amer."
-, volume =	"??"
-, year =	1965
-, update =	"97.11 bibrelex"
+, author =      "H. Wang"
+, title =       "Games, logic and computers"
+, journal =     "Scientific Amer."
+, volume =      "??"
+, year =        1965
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{wa-aaccs-96
-, author =	"H. Wang and P. K. Agarwal"
-, title =	"Approximation algorithms for curvature constrained shortest paths"
-, booktitle =	"Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1996
-, pages =	"409--418"
-, keywords =	"shortest paths, approximation, configuration space, path planning, curvature, robust paths"
-, update =	"96.09 agarwal, 96.05 agarwal, 96.01 mitchell"
+, author =      "H. Wang and P. K. Agarwal"
+, title =       "Approximation algorithms for curvature constrained shortest paths"
+, booktitle =   "Proc. 7th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1996
+, pages =       "409--418"
+, keywords =    "shortest paths, approximation, configuration space, path planning, curvature, robust paths"
+, update =      "96.09 agarwal, 96.05 agarwal, 96.01 mitchell"
 }
 
 % ### others?
 @article{wo-entpp-87
-, author =	"H.-P. Wang and others"
-, title =	"On the Efficiency of {NC} Tool Path Planning for Face Milling Operations"
-, journal =	"Trans. of the ASME, J. of Engineering for Industry"
-, volume =	109
-, number =	4
-, month =	nov
-, year =	1987
-, pages =	"370--376"
-, update =	"93.09 held"
+, author =      "H.-P. Wang and others"
+, title =       "On the Efficiency of {NC} Tool Path Planning for Face Milling Operations"
+, journal =     "Trans. of the ASME, J. of Engineering for Industry"
+, volume =      109
+, number =      4
+, month =       nov
+, year =        1987
+, pages =       "370--376"
+, update =      "93.09 held"
 }
 
 @inproceedings{wlb-gssnv-97
-, author =	"L. Wang and M. C. Leu and D. Blackmore"
-, title =	"Generating Swept Solids for {NC} Verification Using the {SEDE} Method"
-, booktitle =	"Proc. 4th Sympos. Solid Modeling Found. Applications"
-, site =	"Atlanta, GA, USA"
-, month =	may
-, year =	1997
-, pages =	"364--375"
-, update =	"97.07 held"
+, author =      "L. Wang and M. C. Leu and D. Blackmore"
+, title =       "Generating Swept Solids for {NC} Verification Using the {SEDE} Method"
+, booktitle =   "Proc. 4th Sympos. Solid Modeling Found. Applications"
+, site =        "Atlanta, GA, USA"
+, month =       may
+, year =        1997
+, pages =       "364--375"
+, update =      "97.07 held"
 }
 
 @article{wwcc-cslst-96
-, author =	"M.-E. Wang and T. C. Woo and L.-L. Chen and S.-Y. Chou"
-, title =	"Computing Spanning Line Segments in Three Dimensions"
-, journal =	"Visual Comput."
-, volume =	12
-, number =	4
-, year =	1996
-, pages =	"173--180"
-, update =	"96.09 held"
+, author =      "M.-E. Wang and T. C. Woo and L.-L. Chen and S.-Y. Chou"
+, title =       "Computing Spanning Line Segments in Three Dimensions"
+, journal =     "Visual Comput."
+, volume =      12
+, number =      4
+, year =        1996
+, pages =       "173--180"
+, update =      "96.09 held"
 }
 
 @article{w-cqsis-92
-, author =	"T. Wang"
-, title =	"A {$C^{2}$}-quintic spline interpolation scheme on triangulation"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	9
-, year =	1992
-, pages =	"379--386"
-, update =	"97.11 bibrelex"
+, author =      "T. Wang"
+, title =       "A {$C^{2}$}-quintic spline interpolation scheme on triangulation"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      9
+, year =        1992
+, pages =       "379--386"
+, update =      "97.11 bibrelex"
 }
 
 @article{wg-s3dsr-93
-, author =	"W. Wang and G. G. Grinstein"
-, title =	"A Survey of 3{D} Solid Reconstruction from 2{D} Projection Line Drawings"
-, journal =	"Comput. Graph. Forum"
-, volume =	12
-, number =	2
-, month =	jun
-, year =	1993
-, pages =	"137--158"
-, update =	"93.09 held"
+, author =      "W. Wang and G. G. Grinstein"
+, title =       "A Survey of 3{D} Solid Reconstruction from 2{D} Projection Line Drawings"
+, journal =     "Comput. Graph. Forum"
+, volume =      12
+, number =      2
+, month =       jun
+, year =        1993
+, pages =       "137--158"
+, update =      "93.09 held"
 }
 
 @article{wjg-rqpq-97
-, author =	"W. Wang and B. Joe and R. Goldman"
-, title =	"Rational Quadratic Parameterizations of Quadrics"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"599--"
-, update =	"98.11 devillers"
+, author =      "W. Wang and B. Joe and R. Goldman"
+, title =       "Rational Quadratic Parameterizations of Quadrics"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "599--"
+, update =      "98.11 devillers"
 }
 
 @inproceedings{wgcpp-ipsng-90
-, author =	"Y. Wang and E. L. Gursoz and J.-M. Chen and F. B. Prinz and N. M. Patrikalakis"
-, title =	"Intersections of Parametric Surfaces for Next Generation Geometric Modeling Systems"
-, editor =	"J. Turner, J. Pegna and M. Wozny"
-, booktitle =	"Proc. of the International Federation of Information Processing TC5/WG 5.2 Working Conference on Geometric Modeling for Product Engineering: Product Modeling for Computer-Aided Design and Manufacturing"
-, year =	1990
-, pages =	"75--96"
-, update =	"95.05 abrams"
+, author =      "Y. Wang and E. L. Gursoz and J.-M. Chen and F. B. Prinz and N. M. Patrikalakis"
+, title =       "Intersections of Parametric Surfaces for Next Generation Geometric Modeling Systems"
+, editor =      "J. Turner, J. Pegna and M. Wozny"
+, booktitle =   "Proc. of the International Federation of Information Processing TC5/WG 5.2 Working Conference on Geometric Modeling for Product Engineering: Product Modeling for Computer-Aided Design and Manufacturing"
+, year =        1990
+, pages =       "75--96"
+, update =      "95.05 abrams"
 }
 
 @article{wa-srr3d-86
-, author =	"Y. F. Wang and J. K. Aggarwal"
-, title =	"Surface reconstruction and representation for 3-D scenes"
-, journal =	"Pattern Recogn."
-, volume =	19
-, year =	1986
-, pages =	"197--207"
-, update =	"94.05 drysdale"
+, author =      "Y. F. Wang and J. K. Aggarwal"
+, title =       "Surface reconstruction and representation for 3-D scenes"
+, journal =     "Pattern Recogn."
+, volume =      19
+, year =        1986
+, pages =       "197--207"
+, update =      "94.05 drysdale"
 }
 
 @article{wlc-nibtr-89
-, author =	"Y. L. Wang and R. C. T. Lee and J. S. Chang"
-, title =	"The number of intersections between two rectangular paths"
-, journal =	"IEEE Trans. Comput."
-, volume =	38
-, number =	11
-, year =	1989
-, pages =	"1564--1571"
-, update =	"94.01 tuan"
+, author =      "Y. L. Wang and R. C. T. Lee and J. S. Chang"
+, title =       "The number of intersections between two rectangular paths"
+, journal =     "IEEE Trans. Comput."
+, volume =      38
+, number =      11
+, year =        1989
+, pages =       "1564--1571"
+, update =      "94.01 tuan"
 }
 
 @article{w-cefao-87
-, author =	"Z. Wang"
-, title =	"A Conformal Elimination Free Algorithm for Oriented Matroid Programming"
-, journal =	"Chinese Annals of Mathematics"
-, volume =	8
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "Z. Wang"
+, title =       "A Conformal Elimination Free Algorithm for Oriented Matroid Programming"
+, journal =     "Chinese Annals of Mathematics"
+, volume =      8
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{w-pcacc-95
-, author =	"Z. J. Wang"
-, title =	"Proof of Concept: An Automated CFD Computing Environment with a Cartesian/Prism Grid Generator, Grid Adaptor and Flow Solver"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"87--101"
-, update =	"96.01 samitchell"
+, author =      "Z. J. Wang"
+, title =       "Proof of Concept: An Automated CFD Computing Environment with a Cartesian/Prism Grid Generator, Grid Adaptor and Flow Solver"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "87--101"
+, update =      "96.01 samitchell"
 }
 
 @article{wpw-mtpr-74
-, author =	"G. E. Wangdahl and S. M. Pollock and J. B. Woodward"
-, title =	"Minimum-Trajectory Pipe Routing"
-, journal =	"Journal of Ship Research"
-, volume =	18
-, number =	1
-, month =	mar
-, year =	1974
-, pages =	"46--49"
-, update =	"93.09 milone+mitchell"
+, author =      "G. E. Wangdahl and S. M. Pollock and J. B. Woodward"
+, title =       "Minimum-Trajectory Pipe Routing"
+, journal =     "Journal of Ship Research"
+, volume =      18
+, number =      1
+, month =       mar
+, year =        1974
+, pages =       "46--49"
+, update =      "93.09 milone+mitchell"
 }
 
 @article{w-wcach-93
-, author =	"A. R. Warburton"
-, title =	"Worst-case Analysis of some Convex Hull Heuristics for the {Euclidean} Travelling Salesman Problem"
-, journal =	"Oper. Res. Lett."
-, volume =	13
-, year =	1993
-, pages =	"37--42"
-, keywords =	"travelling salesman problem, heuristic, approximation algorithms, convex hulls"
-, comments =	"It is well known that the nearest insertion and cheapest
+, author =      "A. R. Warburton"
+, title =       "Worst-case Analysis of some Convex Hull Heuristics for the {Euclidean} Travelling Salesman Problem"
+, journal =     "Oper. Res. Lett."
+, volume =      13
+, year =        1993
+, pages =       "37--42"
+, keywords =    "travelling salesman problem, heuristic, approximation algorithms, convex hulls"
+, comments =    "It is well known that the nearest insertion and cheapest
 insertion are a factor 2 apx for TSP, and this is tight.
 Interestingly, for pts in the plane, if you start with a tour
 consisting of the convex hull vertices, and continue with nearest or
 cheapest insertion this is a factor 3 apx, and this is tight!"
-, update =	"98.07 mitchell"
+, update =      "98.07 mitchell"
 }
 
 @incollection{w-cbsld-94
-, author =	"Greg Ward"
-, title =	"A Contrast-Based Scalefactor for Luminance Display"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"415--421"
-, keywords =	"brightness, color, image display, perception, Radiance system"
-, update =	"94.09 heckbert"
-, annote =	"Presents a simple technique for displaying pictures that
+, author =      "Greg Ward"
+, title =       "A Contrast-Based Scalefactor for Luminance Display"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "415--421"
+, keywords =    "brightness, color, image display, perception, Radiance system"
+, update =      "94.09 heckbert"
+, annote =      "Presents a simple technique for displaying pictures that
 have a dynamic range (ratio of brightest to dimmest pixel) beyond that of
 the display."
 }
 
 @article{wrc-rtsdi-88
-, author =	"G. J. Ward and F. M. Rubinstein and R. D. Clear"
-, title =	"A ray tracing solution for diffuse interreflection"
-, journal =	"Comput. Graph."
-, volume =	22
-, number =	4
-, year =	1988
-, pages =	"85--92"
-, note =	"Proc. SIGGRAPH '88"
-, update =	"98.03 bibrelex"
+, author =      "G. J. Ward and F. M. Rubinstein and R. D. Clear"
+, title =       "A ray tracing solution for diffuse interreflection"
+, journal =     "Comput. Graph."
+, volume =      22
+, number =      4
+, year =        1988
+, pages =       "85--92"
+, note =        "Proc. SIGGRAPH '88"
+, update =      "98.03 bibrelex"
 }
 
 @article{ww-ubnlm-85
-, author =	"James E. Ward and Richard E. Wendell"
-, title =	"Using Block Norms for Location Modeling"
-, journal =	"Oper. Res."
-, volume =	33
-, year =	1985
-, pages =	"1074--1090"
-, update =	"98.07 icking"
+, author =      "James E. Ward and Richard E. Wendell"
+, title =       "Using Block Norms for Location Modeling"
+, journal =     "Oper. Res."
+, volume =      33
+, year =        1985
+, pages =       "1074--1090"
+, update =      "98.07 icking"
 }
 
 @inproceedings{wc-atvit-80
-, author =	"M. O. Ward and Y. T. Chien"
-, title =	"Analysis of time-varying imagery through the representation of position and shape changes"
-, booktitle =	"Proc. 5th IEEE Internat. Conf. Pattern Recogn."
-, year =	1980
-, pages =	"1236--1238"
+, author =      "M. O. Ward and Y. T. Chien"
+, title =       "Analysis of time-varying imagery through the representation of position and shape changes"
+, booktitle =   "Proc. 5th IEEE Internat. Conf. Pattern Recogn."
+, year =        1980
+, pages =       "1236--1238"
 }
 
 @article{wt-ommsl-83
-, author =	"C. Warde and J. Thackara"
-, title =	"Operating modes of the microchannel spatial light modulator"
-, journal =	"Optical Engineering"
-, volume =	22
-, number =	6
-, year =	1983
-, pages =	"695--703"
-, update =	"97.11 bibrelex"
+, author =      "C. Warde and J. Thackara"
+, title =       "Operating modes of the microchannel spatial light modulator"
+, journal =     "Optical Engineering"
+, volume =      22
+, number =      6
+, year =        1983
+, pages =       "695--703"
+, update =      "97.11 bibrelex"
 }
 
 @article{w-cthm-77
-, author =	"J. Warfield"
-, title =	"Crossing Theory and Hierarchy Mapping"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	"SMC-7"
-, number =	7
-, year =	1977
-, pages =	"502--523"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "J. Warfield"
+, title =       "Crossing Theory and Hierarchy Mapping"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      "SMC-7"
+, number =      7
+, year =        1977
+, pages =       "502--523"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @book{w-ocdfe-72
-, author =	"J. Warga"
-, title =	"Optimal Control of differential and functional equations"
-, publisher =	"Academic Press"
-, year =	1972
+, author =      "J. Warga"
+, title =       "Optimal Control of differential and functional equations"
+, publisher =   "Academic Press"
+, year =        1972
 }
 
 @incollection{w-cildp-71
-, author =	"T. T. Warnock"
-, title =	"Computational investigations of low-discrepancy point sets"
-, editor =	"S. K. Zaremba"
-, booktitle =	"Applications of Number Theory to Numerical Analysis"
-, publisher =	"Academic Press"
-, year =	1971
-, pages =	"319--344"
-, update =	"98.03 bibrelex"
+, author =      "T. T. Warnock"
+, title =       "Computational investigations of low-discrepancy point sets"
+, editor =      "S. K. Zaremba"
+, booktitle =   "Applications of Number Theory to Numerical Analysis"
+, publisher =   "Academic Press"
+, year =        1971
+, pages =       "319--344"
+, update =      "98.03 bibrelex"
 }
 
 @article{w-tsplr-57
-, author =	"William Warntz"
-, title =	"Transportation, Social Physics, and the Law of Refraction"
-, journal =	"The Professional Geographer"
-, volume =	9
-, number =	4
-, year =	1957
-, pages =	"2--7"
-, keywords =	"weighted region problem, shortest paths, GIS, Snell's Law"
-, update =	"98.03 mitchell"
+, author =      "William Warntz"
+, title =       "Transportation, Social Physics, and the Law of Refraction"
+, journal =     "The Professional Geographer"
+, volume =      9
+, number =      4
+, year =        1957
+, pages =       "2--7"
+, keywords =    "weighted region problem, shortest paths, GIS, Snell's Law"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{w-vbarp-91
-, author =	"Charles W. Warren"
-, title =	"A vector based approach to robot path planning"
-, booktitle =	"Proc. 1991 IEEE Internat. Conf. Robot. Autom."
-, month =	apr
-, year =	1991
-, pages =	"1021--1026"
-, update =	"96.05 efrat, 93.09 milone+mitchell"
-, abstract =	"A vector-based algorithm for planning the path of a robot among
+, author =      "Charles W. Warren"
+, title =       "A vector based approach to robot path planning"
+, booktitle =   "Proc. 1991 IEEE Internat. Conf. Robot. Autom."
+, month =       apr
+, year =        1991
+, pages =       "1021--1026"
+, update =      "96.05 efrat, 93.09 milone+mitchell"
+, abstract =    "A vector-based algorithm for planning the path of a robot among
 irregularly shaped obstacles is presented.  This algorithm combines many of the
 desirable features of graph searching and potential field approaches to path
 planning.  In this technique, a vector is created from the start position to
@@ -146179,506 +146179,506 @@ @inproceedings{w-vbarp-91
 }
 
 @article{w-lbanm-68
-, author =	"H. E. Warren"
-, title =	"Lower bound for approximation by nonlinear manifolds"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	133
-, year =	1968
-, pages =	"167--178"
-, update =	"98.03 agarwal"
+, author =      "H. E. Warren"
+, title =       "Lower bound for approximation by nonlinear manifolds"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      133
+, year =        1968
+, pages =       "167--178"
+, update =      "98.03 agarwal"
 }
 
 @inproceedings{w-bqsqc-87
-, author =	"J. Warren"
-, title =	"Blending quadric surfaces with quadric and cubic surfaces"
-, booktitle =	"Proc. 3rd Annu. ACM Sympos. Comput. Geom."
-, year =	1987
-, pages =	"341--347"
-, cites =	"d-sagd-64, l-padps-76, hh-asgca-85a, hh-qbs-85, hh-pmbsc-85, ms-bsstv-85a, ro-bssgm-85, r-bosm-85, rr-crbsm-84, w-asmgc-86, w-cpgvl-70, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "J. Warren"
+, title =       "Blending quadric surfaces with quadric and cubic surfaces"
+, booktitle =   "Proc. 3rd Annu. ACM Sympos. Comput. Geom."
+, year =        1987
+, pages =       "341--347"
+, cites =       "d-sagd-64, l-padps-76, hh-asgca-85a, hh-qbs-85, hh-pmbsc-85, ms-bsstv-85a, ro-bssgm-85, r-bosm-85, rr-crbsm-84, w-asmgc-86, w-cpgvl-70, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{w-asmgc-86
-, author =	"J. Warren"
-, title =	"On Algebraic Surfaces Meeting with Geometric Continousity"
-, school =	"Dept. Comput. Sci., Cornell Univ."
-, address =	"Ithaca, NY"
-, month =	aug
-, year =	1986
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "J. Warren"
+, title =       "On Algebraic Surfaces Meeting with Geometric Continousity"
+, school =      "Dept. Comput. Sci., Cornell Univ."
+, address =     "Ithaca, NY"
+, month =       aug
+, year =        1986
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{wg-otmsr-86
-, author =	"Glen Y. Watabayishi and J. A. Galt"
-, title =	"An Optimized Triangular Mesh System from Random Points"
-, editor =	"J. H{\"a}user and C. Taylor"
-, booktitle =	"Numerical Grid Generation in Computational Fluid Dynamics"
-, year =	1986
-, pages =	"437--448"
-, annote =	"Algorithm is generate initial triangulation and
-		 improve with flips. Flip criterion is to maximize
-		 minimum value of area over perimeter squared. One
-		 method of generating initial triangulation is straight
-		 insertion, join to visible points. Other method is to
-		 construct greedy triangulation by a rather involved
-		 $O(n^6)$ algorithm. (Authors make two mistakes in their
-		 analysis and claim $O((n!)^2)$.) This is a bit a slow
-		 so they compute an approximation to GT by only looking
-		 at $O(n)$ short lines, giving an $O(n^2)$ algorithm."
+, author =      "Glen Y. Watabayishi and J. A. Galt"
+, title =       "An Optimized Triangular Mesh System from Random Points"
+, editor =      "J. H{\"a}user and C. Taylor"
+, booktitle =   "Numerical Grid Generation in Computational Fluid Dynamics"
+, year =        1986
+, pages =       "437--448"
+, annote =      "Algorithm is generate initial triangulation and
+                 improve with flips. Flip criterion is to maximize
+                 minimum value of area over perimeter squared. One
+                 method of generating initial triangulation is straight
+                 insertion, join to visible points. Other method is to
+                 construct greedy triangulation by a rather involved
+                 $O(n^6)$ algorithm. (Authors make two mistakes in their
+                 analysis and claim $O((n!)^2)$.) This is a bit a slow
+                 so they compute an approximation to GT by only looking
+                 at $O(n)$ short lines, giving an $O(n^2)$ algorithm."
 }
 
 @techreport{w-hgdgb-88
-, author =	"H. Watanabe"
-, title =	"Heuristic Graph Displayer for {G}-{BASE}"
-, number =	17
-, institution =	"Ricoh Software Research Center, Tokyo, Japan"
-, year =	1988
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "H. Watanabe"
+, title =       "Heuristic Graph Displayer for {G}-{BASE}"
+, number =      17
+, institution = "Ricoh Software Research Center, Tokyo, Japan"
+, year =        1988
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @techreport{w-rtvsa-70
-, author =	"G. S. Watkins"
-, title =	"A real-time visible surface algorithm"
-, type =	"Report"
-, number =	"UTEC-CS-70-101"
-, institution =	"Dept. Comput. Sci., Univ. Utah"
-, address =	"Salt Lake City, UT"
-, year =	1970
+, author =      "G. S. Watkins"
+, title =       "A real-time visible surface algorithm"
+, type =        "Report"
+, number =      "UTEC-CS-70-101"
+, institution = "Dept. Comput. Sci., Univ. Utah"
+, address =     "Salt Lake City, UT"
+, year =        1970
 }
 
 @article{w-grras-
-, author =	"M. E. Watkins"
-, title =	"Graphical Regular Representations of Alt., Symm., and Misc. Small Groups"
-, journal =	"Aequationes Math."
-, volume =	11
-, year =	"??"
-, pages =	"40--50"
-, update =	"97.11 bibrelex"
+, author =      "M. E. Watkins"
+, title =       "Graphical Regular Representations of Alt., Symm., and Misc. Small Groups"
+, journal =     "Aequationes Math."
+, volume =      11
+, year =        "??"
+, pages =       "40--50"
+, update =      "97.11 bibrelex"
 }
 
 @article{w-anagg-71
-, author =	"M. E. Watkins"
-, title =	"On the Action of Non-abelian Groups on Graphs"
-, journal =	"J. Combin. Theory Ser. B"
-, volume =	1
-, year =	1971
-, pages =	"95--104"
-, update =	"97.11 bibrelex"
+, author =      "M. E. Watkins"
+, title =       "On the Action of Non-abelian Groups on Graphs"
+, journal =     "J. Combin. Theory Ser. B"
+, volume =      1
+, year =        1971
+, pages =       "95--104"
+, update =      "97.11 bibrelex"
 }
 
 @article{w-acrd-82
-, author =	"D. F. Watson"
-, title =	"Automatic Contouring of Raw Data"
-, journal =	"Comput. Geosci."
-, volume =	8
-, number =	1
-, year =	1982
-, pages =	"97--101"
-, annote =	"FORTRAN used for DT f point set. $O(N^2)$ on average,
-		 $O(N^3)$ worst case. Stores in array for each triangle
-		 indices of vertices, circumcentre, circumradius. No
-		 adjacency information. Incremental---new point is
-		 checked against every circumcircle."
+, author =      "D. F. Watson"
+, title =       "Automatic Contouring of Raw Data"
+, journal =     "Comput. Geosci."
+, volume =      8
+, number =      1
+, year =        1982
+, pages =       "97--101"
+, annote =      "FORTRAN used for DT f point set. $O(N^2)$ on average,
+                 $O(N^3)$ worst case. Stores in array for each triangle
+                 indices of vertices, circumcentre, circumradius. No
+                 adjacency information. Incremental---new point is
+                 checked against every circumcircle."
 }
 
 @article{w-cnddt-81
-, author =	"D. F. Watson"
-, title =	"Computing the $n$-Dimensional {Delaunay} Tessellation with Applications to {Voronoi} Polytopes"
-, journal =	"Comput. J."
-, volume =	24
-, number =	2
-, year =	1981
-, pages =	"167--172"
-, update =	"93.09 held"
+, author =      "D. F. Watson"
+, title =       "Computing the $n$-Dimensional {Delaunay} Tessellation with Applications to {Voronoi} Polytopes"
+, journal =     "Comput. J."
+, volume =      24
+, number =      2
+, year =        1981
+, pages =       "167--172"
+, update =      "93.09 held"
 }
 
 @book{w-cgads-92
-, author =	"David F. Watson"
-, title =	"Contouring: {A} Guide to the Analysis and Display of Spatial Data"
-, publisher =	"Pergamon"
-, year =	1992
-, comments =	"source code to calculate Voronoi diagram in $2$-d or
+, author =      "David F. Watson"
+, title =       "Contouring: {A} Guide to the Analysis and Display of Spatial Data"
+, publisher =   "Pergamon"
+, year =        1992
+, comments =    "source code to calculate Voronoi diagram in $2$-d or
 $3$-d available from Watson at maths.uwa.edu.au"
-, update =	"93.09 jones"
+, update =      "93.09 jones"
 }
 
 @article{w-nnsnd-88
-, author =	"D. F. Watson"
-, title =	"Natural Neighbor Sorting on the {N}-Dimensional Sphere"
-, journal =	"Pattern Recogn."
-, volume =	21
-, number =	1
-, year =	1988
-, pages =	"63--67"
-, annote =	"Your basic Watson algorithm for DT on $n$-dimensional
-		 sphere."
+, author =      "D. F. Watson"
+, title =       "Natural Neighbor Sorting on the {N}-Dimensional Sphere"
+, journal =     "Pattern Recogn."
+, volume =      21
+, number =      1
+, year =        1988
+, pages =       "63--67"
+, annote =      "Your basic Watson algorithm for DT on $n$-dimensional
+                 sphere."
 }
 
 @article{w-nns-85
-, author =	"D. F. Watson"
-, title =	"Natural Neighbour Sorting"
-, journal =	"Australian Computer Journal"
-, volume =	17
-, number =	4
-, year =	1985
-, pages =	"189--193"
-, annote =	"Survey of algorithms for DT."
+, author =      "D. F. Watson"
+, title =       "Natural Neighbour Sorting"
+, journal =     "Australian Computer Journal"
+, volume =      17
+, number =      4
+, year =        1985
+, pages =       "189--193"
+, annote =      "Survey of algorithms for DT."
 }
 
 @book{w-ninni-94
-, author =	"D. F. Watson"
-, title =	"nngridr: An implementation of natural neighbor interpolation"
-, publisher =	"David Watson"
-, year =	1994
-, comments =	"source code and discussion about the natural neighbor
+, author =      "D. F. Watson"
+, title =       "nngridr: An implementation of natural neighbor interpolation"
+, publisher =   "David Watson"
+, year =        1994
+, comments =    "source code and discussion about the natural neighbor
 gridding package nngridr, available from Watson at maths.uwa.edu.au"
-, update =	"94.05 watson"
+, update =      "94.05 watson"
 }
 
 @article{wp-sst-84
-, author =	"D. F. Watson and C. M. Philip"
-, title =	"Survey: Systematic Triangulations"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	26
-, year =	1984
-, pages =	"217--223"
-, annote =	"Compares Optimal, Greedy and Delaunay triangulations.
-		 Shows that they are different and suggests Delaunay is
-		 best because of the equiangular property and efficient
-		 implementation."
+, author =      "D. F. Watson and C. M. Philip"
+, title =       "Survey: Systematic Triangulations"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      26
+, year =        1984
+, pages =       "217--223"
+, annote =      "Compares Optimal, Greedy and Delaunay triangulations.
+                 Shows that they are different and suggests Delaunay is
+                 best because of the equiangular property and efficient
+                 implementation."
 }
 
 @article{wp-nbi-87
-, author =	"D. F. Watson and G. M. Philip"
-, title =	"Neighborhood-based interpolation"
-, journal =	"Geobyte"
-, volume =	2
-, number =	2
-, year =	1987
-, pages =	"12--16"
-, update =	"94.05 watson"
-, annote =	"Description of natural neighbor interpolation"
+, author =      "D. F. Watson and G. M. Philip"
+, title =       "Neighborhood-based interpolation"
+, journal =     "Geobyte"
+, volume =      2
+, number =      2
+, year =        1987
+, pages =       "12--16"
+, update =      "94.05 watson"
+, annote =      "Description of natural neighbor interpolation"
 }
 
 @book{w-3dcg-93
-, author =	"A. Watt"
-, title =	"3D Computer Graphics"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, MA"
-, year =	1993
-, update =	"97.03 schwarzkopf"
+, author =      "A. Watt"
+, title =       "3D Computer Graphics"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, MA"
+, year =        1993
+, update =      "97.03 schwarzkopf"
 }
 
 @article{w-igbtd-90
-, author =	"N. P. Weatherill"
-, title =	"Integrity Of Geometrical Boundaries In The Two-Dimensional {Delaunay} Triangulation"
-, journal =	"Communications in Applied Numerical Methods"
-, volume =	6
-, number =	2
-, month =	feb
-, year =	1990
-, pages =	"101--109"
-, keywords =	"geometrical boundaries, Delaunay triangulation, computational meshes"
-, annote =	"Adds extra points so that boundary is part of DT."
-, abstract =	"The Delaunay triangulation has recently received
-		 attention as a viable method for constructing
-		 computational meshes. However, an arbitrary boundary
-		 definition which must be preserved in the triangulation
-		 process will not, in general, satisfy the geometrical
-		 definition on which the Delaunay construction is
-		 founded. The effect of this is that the integrity of
-		 the given boundary edges will be violated and the
-		 computational mesh will not conform to the applied
-		 geometrical shape. A method is proposed whereby
-		 boundary data are supplemented with points to ensure
-		 that imposed boundary edges are preserved during the
-		 Delaunay triangulation. The method is illustrated on a
-		 geometry of an estuary which exhibits highly complex
-		 geometrical features. (Author abstract) 12 Refs."
+, author =      "N. P. Weatherill"
+, title =       "Integrity Of Geometrical Boundaries In The Two-Dimensional {Delaunay} Triangulation"
+, journal =     "Communications in Applied Numerical Methods"
+, volume =      6
+, number =      2
+, month =       feb
+, year =        1990
+, pages =       "101--109"
+, keywords =    "geometrical boundaries, Delaunay triangulation, computational meshes"
+, annote =      "Adds extra points so that boundary is part of DT."
+, abstract =    "The Delaunay triangulation has recently received
+                 attention as a viable method for constructing
+                 computational meshes. However, an arbitrary boundary
+                 definition which must be preserved in the triangulation
+                 process will not, in general, satisfy the geometrical
+                 definition on which the Delaunay construction is
+                 founded. The effect of this is that the integrity of
+                 the given boundary edges will be violated and the
+                 computational mesh will not conform to the applied
+                 geometrical shape. A method is proposed whereby
+                 boundary data are supplemented with points to ensure
+                 that imposed boundary edges are preserved during the
+                 Delaunay triangulation. The method is illustrated on a
+                 geometry of an estuary which exhibits highly complex
+                 geometrical features. (Author abstract) 12 Refs."
 }
 
 @article{w-msuma-90
-, author =	"N. P. Weatherill"
-, title =	"Mixed structured-unstructured meshes for aerodynamic flow simulation"
-, journal =	"Aeronautical Journal"
-, volume =	"??"
-, month =	apr
-, year =	1990
-, pages =	"111--123"
-, update =	"98.07 bibrelex"
+, author =      "N. P. Weatherill"
+, title =       "Mixed structured-unstructured meshes for aerodynamic flow simulation"
+, journal =     "Aeronautical Journal"
+, volume =      "??"
+, month =       apr
+, year =        1990
+, pages =       "111--123"
+, update =      "98.07 bibrelex"
 }
 
 @article{w-ngg-90
-, author =	"N. P. Weatherill"
-, title =	"Numerical Grid Generation"
-, journal =	"Lecture Series"
-, volume =	1990
-, number =	06
-, month =	jun
-, year =	1990
-, pages =	"66--135"
-, note =	"Rhode Saint Genese, Belgium. von Karman Institute for Fluid Dynamics"
-, update =	"98.11 bibrelex"
+, author =      "N. P. Weatherill"
+, title =       "Numerical Grid Generation"
+, journal =     "Lecture Series"
+, volume =      1990
+, number =      06
+, month =       jun
+, year =        1990
+, pages =       "66--135"
+, note =        "Rhode Saint Genese, Belgium. von Karman Institute for Fluid Dynamics"
+, update =      "98.11 bibrelex"
 }
 
 @article{wg-udbvh-92
-, author =	"R. Webb and M. Gigante"
-, title =	"Using dynamic bounding volume hierarchies to improve efficiency of rigid body simulation"
-, journal =	"Visual Comput."
-, volume =	"??"
-, year =	1992
-, pages =	"825--842"
-, update =	"98.07 bibrelex"
+, author =      "R. Webb and M. Gigante"
+, title =       "Using dynamic bounding volume hierarchies to improve efficiency of rigid body simulation"
+, journal =     "Visual Comput."
+, volume =      "??"
+, year =        1992
+, pages =       "825--842"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ws-ggove-96
-, author =	"R. Webber and A. Scott"
-, title =	"{GOVE}: {Grammar}-{Oriented} {Visualisation} {Environment}"
-, editor =	"F. J. Brandenburg"
-, booktitle =	"Graph Drawing (Proc. GD '95)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1027
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"516--519"
-, keywords =	"graph drawing, 3D"
-, update =	"98.07 patrignani"
+, author =      "R. Webber and A. Scott"
+, title =       "{GOVE}: {Grammar}-{Oriented} {Visualisation} {Environment}"
+, editor =      "F. J. Brandenburg"
+, booktitle =   "Graph Drawing (Proc. GD '95)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1027
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "516--519"
+, keywords =    "graph drawing, 3D"
+, update =      "98.07 patrignani"
 }
 
 @article{ws-ltbta-92
-, author =	"R. E. Webber and H. Samet"
-, title =	"Linear-time border-tracing algorithms for quadtrees"
-, journal =	"Algorithmica"
-, volume =	8
-, number =	"?"
-, year =	1992
-, pages =	"39--54"
-, note =	"(also Computer Science TR 2309)"
-, update =	"96.05 efrat"
+, author =      "R. E. Webber and H. Samet"
+, title =       "Linear-time border-tracing algorithms for quadtrees"
+, journal =     "Algorithmica"
+, volume =      8
+, number =      "?"
+, year =        1992
+, pages =       "39--54"
+, note =        "(also Computer Science TR 2309)"
+, update =      "96.05 efrat"
 }
 
 @article{wka-appma-94
-, author =	"G. Weber and L. Knipping and H. Alt"
-, title =	"An Application of Point Pattern Matching in Astronautics"
-, journal =	"J. Symbolic Comput."
-, volume =	17
-, year =	1994
-, pages =	"321--340"
-, update =	"95.05 held"
+, author =      "G. Weber and L. Knipping and H. Alt"
+, title =       "An Application of Point Pattern Matching in Astronautics"
+, journal =     "J. Symbolic Comput."
+, volume =      17
+, year =        1994
+, pages =       "321--340"
+, update =      "95.05 held"
 }
 
 @article{wg-ebr-95
-, author =	"C. E. Wee and R. N. Goldman"
-, title =	"Elimination and Bivariate Resultants"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	15
-, number =	1
-, month =	jan
-, year =	1995
-, pages =	"69--77"
-, update =	"95.05 held"
+, author =      "C. E. Wee and R. N. Goldman"
+, title =       "Elimination and Bivariate Resultants"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      15
+, number =      1
+, month =       jan
+, year =        1995
+, pages =       "69--77"
+, update =      "95.05 held"
 }
 
 @inproceedings{wc-oplmv-90
-, author =	"Y. C. Wee and S. Chaiken"
-, title =	"An optimal parallel {$L_{1}$}-metric {Voronoi} diagram algorithm"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"60--65"
-, cites =	"b-dsp-79, acgoy-pcg-88, cd-vdbcd-85, cg-opapp-88, c-aaspm-87, c-pms-86, e-acg-87, es-vda-86, es-vda-86, gbt-srtgp-84, gs-canen-83, k-racrn-88, k-cavd-89, l-tdvdl-80, pm-toacv-89, sh-cpp-75, s-rngam-83, wcr-sagnn-89, ww-qvrqi-88, y-cmstk-82, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "Y. C. Wee and S. Chaiken"
+, title =       "An optimal parallel {$L_{1}$}-metric {Voronoi} diagram algorithm"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "60--65"
+, cites =       "b-dsp-79, acgoy-pcg-88, cd-vdbcd-85, cg-opapp-88, c-aaspm-87, c-pms-86, e-acg-87, es-vda-86, es-vda-86, gbt-srtgp-84, gs-canen-83, k-racrn-88, k-cavd-89, l-tdvdl-80, pm-toacv-89, sh-cpp-75, s-rngam-83, wcr-sagnn-89, ww-qvrqi-88, y-cmstk-82, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{wcr-sagnn-89
-, author =	"Y. C. Wee and S. Chaiken and S. S. Ravi"
-, title =	"Some applications of geographic nearest neighbor approach"
-, booktitle =	"Proc. 27th Allerton Conf. Commun. Control Comput."
-, year =	1989
-, update =	"98.07 bibrelex"
+, author =      "Y. C. Wee and S. Chaiken and S. S. Ravi"
+, title =       "Some applications of geographic nearest neighbor approach"
+, booktitle =   "Proc. 27th Allerton Conf. Commun. Control Comput."
+, year =        1989
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{wcw-gmarv-89
-, author =	"Y. C. Wee and S. Chaiken and D. E. Willard"
-, title =	"General metrics and angle restricted {Voronoi} diagrams"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	44
+, author =      "Y. C. Wee and S. Chaiken and D. E. Willard"
+, title =       "General metrics and angle restricted {Voronoi} diagrams"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       44
 }
 
 @article{whg-icmrt-84
-, author =	"H. Weghorst and G. Hooper and D. P. Greenberg"
-, title =	"Improved Computational Methods for Ray Tracing"
-, journal =	"ACM Trans. Graph."
-, volume =	3
-, number =	1
-, year =	1984
-, pages =	"52--69"
-, update =	"98.03 mitchell"
+, author =      "H. Weghorst and G. Hooper and D. P. Greenberg"
+, title =       "Improved Computational Methods for Ray Tracing"
+, journal =     "ACM Trans. Graph."
+, volume =      3
+, number =      1
+, year =        1984
+, pages =       "52--69"
+, update =      "98.03 mitchell"
 }
 
 @article{w-picpp-93
-, author =	"Bernd Wegner"
-, title =	"Partial inflation of closed polygons in the plane"
-, journal =	"Beitr{\"a}ge zur Algebra und Geometrie"
-, volume =	34
-, number =	1
-, year =	1993
-, pages =	"77--85"
-, update =	"02.03 orourke"
+, author =      "Bernd Wegner"
+, title =       "Partial inflation of closed polygons in the plane"
+, journal =     "Beitr{\"a}ge zur Algebra und Geometrie"
+, volume =      34
+, number =      1
+, year =        1993
+, pages =       "77--85"
+, update =      "02.03 orourke"
 }
 
 @article{w-dcnfc-75
-, author =	"G. Wegner"
-, title =	"$d$-collapsing and nerves of families of convex sets"
-, journal =	"Arch. Math."
-, volume =	26
-, year =	1975
-, pages =	"317--321"
-, update =	"97.11 bibrelex"
+, author =      "G. Wegner"
+, title =       "$d$-collapsing and nerves of families of convex sets"
+, journal =     "Arch. Math."
+, volume =      26
+, year =        1975
+, pages =       "317--321"
+, update =      "97.11 bibrelex"
 }
 
 @article{w-uekgf-65
-, author =	"G. Wegner"
-, title =	"{\"U}ber eine kombinatorisch-geometrische {Frage} von {Hadwiger} und {Debrunner}"
-, journal =	"Israel J. Math."
-, volume =	3
-, year =	1965
-, pages =	"187--198"
-, update =	"97.11 bibrelex"
+, author =      "G. Wegner"
+, title =       "{\"U}ber eine kombinatorisch-geometrische {Frage} von {Hadwiger} und {Debrunner}"
+, journal =     "Israel J. Math."
+, volume =      3
+, year =        1965
+, pages =       "187--198"
+, update =      "97.11 bibrelex"
 }
 
 @article{w-uhgs-85
-, author =	"G. Wegner"
-, title =	"{\"U}ber {Helly}-{Gallaische} {Stichzahlprobleme}"
-, journal =	"Koll. Diskrete Geom. Salzburg"
-, volume =	3
-, year =	1985
-, pages =	"277--282"
-, update =	"97.11 bibrelex"
+, author =      "G. Wegner"
+, title =       "{\"U}ber {Helly}-{Gallaische} {Stichzahlprobleme}"
+, journal =     "Koll. Diskrete Geom. Salzburg"
+, volume =      3
+, year =        1985
+, pages =       "277--282"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{w-gsdps-96
-, author =	"R. Weibel"
-, title =	"Generalization of spatial data: {Principles} and Selected Algorithms"
-, booktitle =	"Lecture notes from CISM Advanced School on Algorithmic Foundations of Geographic Information Systems"
-, publisher =	"Springer-Verlag"
-, year =	1996
-, pages =	"99--152"
-, update =	"98.03 agarwal"
+, author =      "R. Weibel"
+, title =       "Generalization of spatial data: {Principles} and Selected Algorithms"
+, booktitle =   "Lecture notes from CISM Advanced School on Algorithmic Foundations of Geographic Information Systems"
+, publisher =   "Springer-Verlag"
+, year =        1996
+, pages =       "99--152"
+, update =      "98.03 agarwal"
 }
 
 @phdthesis{w-smaa-78
-, author =	"B. Weide"
-, title =	"Statistical methods for the analysis of algorithms"
-, school =	"School Comput. Sci., Carnegie Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1978
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "B. Weide"
+, title =       "Statistical methods for the analysis of algorithms"
+, school =      "School Comput. Sci., Carnegie Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1978
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{w-smada-78
-, author =	"B. W. Weide"
-, title =	"Statistical methods in algorithm design and analysis"
-, type =	"Report"
-, number =	"CMU-CS-78-142"
-, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1978
+, author =      "B. W. Weide"
+, title =       "Statistical methods in algorithm design and analysis"
+, type =        "Report"
+, number =      "CMU-CS-78-142"
+, institution = "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1978
 }
 
 @inproceedings{w-vfiur-79
-, author =	"B. W. Weide"
-, title =	"Very fast information update and retrieval using cells"
-, booktitle =	"Proc. 17th Allerton Conf. Commun. Control Comput."
-, year =	1979
-, pages =	"245--254"
+, author =      "B. W. Weide"
+, title =       "Very fast information update and retrieval using cells"
+, booktitle =   "Proc. 17th Allerton Conf. Commun. Control Comput."
+, year =        1979
+, pages =       "245--254"
 }
 
 @article{w-blsf-87
-, author =	"J. Weight"
-, title =	"Binary logic by spatial filtering"
-, journal =	"Optical Engineering"
-, volume =	26
-, number =	1
-, year =	1987
-, pages =	"28--33"
-, update =	"97.11 bibrelex"
+, author =      "J. Weight"
+, title =       "Binary logic by spatial filtering"
+, journal =     "Optical Engineering"
+, volume =      26
+, number =      1
+, year =        1987
+, pages =       "28--33"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{wb-cvcm-96
-, author =	"C. Weigle and D. Banks"
-, title =	"Complex-valued contour meshing"
-, booktitle =	"Proceedings of Visualization `96"
-, publisher =	"IEEE Computer Society Press"
-, year =	1996
-, update =	"01.07 wenger"
+, author =      "C. Weigle and D. Banks"
+, title =       "Complex-valued contour meshing"
+, booktitle =   "Proceedings of Visualization `96"
+, publisher =   "IEEE Computer Society Press"
+, year =        1996
+, update =      "01.07 wenger"
 }
 
 @inproceedings{w-ra-97
-, author =	"Karsten Weihe"
-, title =	"Reuse of algorithms: Still a challenge to object-oriented programming"
-, booktitle =	"Proc. OOPSLA '97"
-, year =	1997
-, pages =	"34--48"
-, update =	"98.11 tamassia"
+, author =      "Karsten Weihe"
+, title =       "Reuse of algorithms: Still a challenge to object-oriented programming"
+, booktitle =   "Proc. OOPSLA '97"
+, year =        1997
+, pages =       "34--48"
+, update =      "98.11 tamassia"
 }
 
 @article{ww-rtcmd-00
-, author =	"K. Weihe and T. Willhalm"
-, title =	"Reconstructing the Topology of a CAD Model - a Discrete Approach"
-, journal =	"Algorithmica"
-, volume =	26
-, number =	1
-, year =	2000
-, pages =	"126--147"
-, update =	"00.03 held"
+, author =      "K. Weihe and T. Willhalm"
+, title =       "Reconstructing the Topology of a CAD Model - a Discrete Approach"
+, journal =     "Algorithmica"
+, volume =      26
+, number =      1
+, year =        2000
+, pages =       "126--147"
+, update =      "00.03 held"
 }
 
 @book{w-c-87
-, author =	"K. Weihrauch"
-, title =	"Computability"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Heidelberg"
-, year =	1987
-, update =	"98.11 bibrelex"
+, author =      "K. Weihrauch"
+, title =       "Computability"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Heidelberg"
+, year =        1987
+, update =      "98.11 bibrelex"
 }
 
 @incollection{wk-uacra-84
-, author =	"K. Weihrauch and Ch. Kreitz"
-, title =	"A unified approach to constructive and recursive analysis"
-, editor =	"M. M. Richter and others"
-, booktitle =	"Computation and proof theory"
-, publisher =	"Springer-Verlag"
-, address =	"Berlin, Heidelberg"
-, year =	1984
-, update =	"98.11 bibrelex"
+, author =      "K. Weihrauch and Ch. Kreitz"
+, title =       "A unified approach to constructive and recursive analysis"
+, editor =      "M. M. Richter and others"
+, booktitle =   "Computation and proof theory"
+, publisher =   "Springer-Verlag"
+, address =     "Berlin, Heidelberg"
+, year =        1984
+, update =      "98.11 bibrelex"
 }
 
 @article{w-sltdd-52
-, author =	"A. Weil"
-, title =	"Sur les th{\'e}or{\`e}mes de de {Rham}"
-, journal =	"Comment. Math. Helvetici"
-, volume =	26
-, year =	1952
-, pages =	"119--145"
-, update =	"98.03 bibrelex"
+, author =      "A. Weil"
+, title =       "Sur les th{\'e}or{\`e}mes de de {Rham}"
+, journal =     "Comment. Math. Helvetici"
+, volume =      26
+, year =        1952
+, pages =       "119--145"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{w-iappt-94
-, author =	"Kevin Weiler"
-, title =	"An Incremental Angle Point in Polygon Test"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"16--23"
-, keywords =	"computational geometry, inclusion testing"
-, update =	"94.09 heckbert"
-, annote =	"Provides an algorithm for testing if a point is inside a
+, author =      "Kevin Weiler"
+, title =       "An Incremental Angle Point in Polygon Test"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "16--23"
+, keywords =    "computational geometry, inclusion testing"
+, update =      "94.09 heckbert"
+, annote =      "Provides an algorithm for testing if a point is inside a
 concave polygon, a task known as point inclusion testing in computational
 geometry. Point-in-polygon testing is a basic task when ray tracing
 polygonal models, so these methods are useful for 3D as well as 2D graphics.
@@ -146686,3394 +146686,3394 @@ @incollection{w-iappt-94
 }
 
 @article{w-ebdss-85
-, author =	"K. Weiler"
-, title =	"Edge-Based Data Structures for Solid Modeling in a Curved Surface Environment"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	5
-, number =	1
-, year =	1985
-, pages =	"21--40"
-, update =	"98.03 agarwal+bibrelex"
+, author =      "K. Weiler"
+, title =       "Edge-Based Data Structures for Solid Modeling in a Curved Surface Environment"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      5
+, number =      1
+, year =        1985
+, pages =       "21--40"
+, update =      "98.03 agarwal+bibrelex"
 }
 
 @techreport{w-nmgm-85
-, author =	"K. Weiler"
-, title =	"Non-manifold geometric modeling"
-, type =	"Report"
-, number =	"??"
-, institution =	"General Electric Corporate Res. and Develop."
-, address =	"Schenectady, NY"
-, year =	1985
+, author =      "K. Weiler"
+, title =       "Non-manifold geometric modeling"
+, type =        "Report"
+, number =      "??"
+, institution = "General Electric Corporate Res. and Develop."
+, address =     "Schenectady, NY"
+, year =        1985
 }
 
 @article{w-pcugr-80
-, author =	"K. Weiler"
-, title =	"Polygon comparison using a graph representation"
-, journal =	"Comput. Graph."
-, volume =	14
-, number =	3
-, year =	1980
-, pages =	"10--18"
-, note =	"Proc. SIGGRAPH '80"
+, author =      "K. Weiler"
+, title =       "Polygon comparison using a graph representation"
+, journal =     "Comput. Graph."
+, volume =      14
+, number =      3
+, year =        1980
+, pages =       "10--18"
+, note =        "Proc. SIGGRAPH '80"
 }
 
 @inproceedings{w-redst-86
-, author =	"K. Weiler"
-, title =	"The radial-edge data structure: {A} topological representation for non-manifold geometric boundary modeling"
-, booktitle =	"Proc. IFIP WG 5.2 Working Conference"
-, site =	"Rensselaerville"
-, year =	1986
-, update =	"98.07 bibrelex"
+, author =      "K. Weiler"
+, title =       "The radial-edge data structure: {A} topological representation for non-manifold geometric boundary modeling"
+, booktitle =   "Proc. IFIP WG 5.2 Working Conference"
+, site =        "Rensselaerville"
+, year =        1986
+, update =      "98.07 bibrelex"
 }
 
 @incollection{w-restr-88
-, author =	"K. Weiler"
-, title =	"The radial edge structure: a topological representation for non-manifold geometric boundary modeling"
-, editor =	"M. J. Wozny and H. W. McLaughlin and J. L. Encarnacao"
-, booktitle =	"Geometric Modeling for CAD Applications"
-, publisher =	"North-Holland"
-, year =	1988
-, pages =	"217--254"
-, update =	"98.07 bibrelex"
+, author =      "K. Weiler"
+, title =       "The radial edge structure: a topological representation for non-manifold geometric boundary modeling"
+, editor =      "M. J. Wozny and H. W. McLaughlin and J. L. Encarnacao"
+, booktitle =   "Geometric Modeling for CAD Applications"
+, publisher =   "North-Holland"
+, year =        1988
+, pages =       "217--254"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{w-tsgm-86
-, author =	"K. Weiler"
-, title =	"Topological Structures for Geometric Modeling"
-, school =	"Rensselaer Polytechnic Institute"
-, address =	"Troy, NY"
-, month =	aug
-, year =	1986
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "K. Weiler"
+, title =       "Topological Structures for Geometric Modeling"
+, school =      "Rensselaer Polytechnic Institute"
+, address =     "Troy, NY"
+, month =       aug
+, year =        1986
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{w-tfsm-84
-, author =	"K. Weiler"
-, title =	"Topology as a Framework for Solid Modeling"
-, booktitle =	"Proc. Graphics Interface '84"
-, year =	1984
-, pages =	"53--56"
-, update =	"98.11 ghali"
+, author =      "K. Weiler"
+, title =       "Topology as a Framework for Solid Modeling"
+, booktitle =   "Proc. Graphics Interface '84"
+, year =        1984
+, pages =       "53--56"
+, update =      "98.11 ghali"
 }
 
 @article{wa-hsrup-77
-, author =	"K. Weiler and P. Atherton"
-, title =	"Hidden surface removal using polygon area sorting"
-, journal =	"Comput. Graph."
-, volume =	11
-, number =	2
-, year =	1977
-, pages =	"214--222"
-, note =	"Proc. SIGGRAPH '77"
+, author =      "K. Weiler and P. Atherton"
+, title =       "Hidden surface removal using polygon area sorting"
+, journal =     "Comput. Graph."
+, volume =      11
+, number =      2
+, year =        1977
+, pages =       "214--222"
+, note =        "Proc. SIGGRAPH '77"
 }
 
 @article{w-moagp-66
-, author =	"L. Weinberg"
-, title =	"On the Maximum Order of the Automorphism Group of a Planar Triply Connected Graph"
-, journal =	"SIAM J."
-, volume =	14
-, year =	1966
-, pages =	"729--738"
-, update =	"97.11 bibrelex"
+, author =      "L. Weinberg"
+, title =       "On the Maximum Order of the Automorphism Group of a Planar Triply Connected Graph"
+, journal =     "SIAM J."
+, volume =      14
+, year =        1966
+, pages =       "729--738"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{wwt-slvtd-96
-, author =	"D. Weinshall and M. Werman and N. Tishby"
-, title =	"Stability and Likelihood of Views of Three Dimensional Objects"
-, booktitle =	"Computing Supplement"
-, volume =	11
-, year =	1996
-, pages =	"237--256"
-, update =	"96.01 werman"
+, author =      "D. Weinshall and M. Werman and N. Tishby"
+, title =       "Stability and Likelihood of Views of Three Dimensional Objects"
+, booktitle =   "Computing Supplement"
+, volume =      11
+, year =        1996
+, pages =       "237--256"
+, update =      "96.01 werman"
 }
 
 @inproceedings{w-naqer-93
-, author =	"Volker Weispfennig"
-, title =	"A New Approach to Quantifier Elimination for Real Algebra and Geometry"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	"31--35"
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
+, author =      "Volker Weispfennig"
+, title =       "A New Approach to Quantifier Elimination for Real Algebra and Geometry"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       "31--35"
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
 }
 
 @inproceedings{w-plqoe-95
-, author =	"Volker Weispfennig"
-, title =	"Parametric Linear and Quadratic Optimization by Elimination"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	41
-, update =	"00.03 bibrelex"
+, author =      "Volker Weispfennig"
+, title =       "Parametric Linear and Quadratic Optimization by Elimination"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       41
+, update =      "00.03 bibrelex"
 }
 
 @article{w-iptc-89
-, author =	"A. I. Weiss"
-, title =	"Incidence-polytopes with toroidal cells"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"55--73"
+, author =      "A. I. Weiss"
+, title =       "Incidence-polytopes with toroidal cells"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "55--73"
 }
 
 @inproceedings{wgs-cudg-93
-, author =	"Gerhard Weiss and Albert Gr{\"a}f and Martin Stumpf"
-, title =	"On Coloring Unit Disk Graphs"
-, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
-, month =	jun
-, year =	1993
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Gerhard Weiss and Albert Gr{\"a}f and Martin Stumpf"
+, title =       "On Coloring Unit Disk Graphs"
+, booktitle =   "Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
+, month =       jun
+, year =        1993
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{w-panns-80
-, author =	"S. F. Weiss"
-, title =	"A probabilistic algorithm for nearest neighbour searching"
-, booktitle =	"Proc. ACM-BCS Sympos. Res. Develop. Inform. Retrieval"
-, year =	1980
-, pages =	"??"
+, author =      "S. F. Weiss"
+, title =       "A probabilistic algorithm for nearest neighbour searching"
+, booktitle =   "Proc. ACM-BCS Sympos. Res. Develop. Inform. Retrieval"
+, year =        1980
+, pages =       "??"
 }
 
 @book{w-cem-99
-, author =	"E. W. Weisstein"
-, title =	"CRC Concise Encylopedia of Mathematics"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1999
-, update =	"02.03 icking, 01.07 orourke"
+, author =      "E. W. Weisstein"
+, title =       "CRC Concise Encylopedia of Mathematics"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1999
+, update =      "02.03 icking, 01.07 orourke"
 }
 
 @inproceedings{ww-agmdu-95
-, author =	"L. Weitzman and K. Wittenburg"
-, title =	"Automatic Generation of Multimedia Documents using Relational Grammars"
-, booktitle =	"Proc. ACM MultiMedia '94"
-, year =	1995
-, pages =	"254--261"
-, keywords =	"graph drawing, planar, visual language"
-, update =	"96.09 tamassia, 96.04 garg"
+, author =      "L. Weitzman and K. Wittenburg"
+, title =       "Automatic Generation of Multimedia Documents using Relational Grammars"
+, booktitle =   "Proc. ACM MultiMedia '94"
+, year =        1995
+, pages =       "254--261"
+, keywords =    "graph drawing, planar, visual language"
+, update =      "96.09 tamassia, 96.04 garg"
 }
 
 @techreport{w-bires-71
-, author =	"T. Welch"
-, title =	"Bounds on the information retrieval efficiency of static file structures"
-, type =	"Technical {Report}"
-, number =	88
-, institution =	"Massachsetts Inst. Tech."
-, address =	"Cambridge, MA"
-, month =	jun
-, year =	1971
-, update =	"98.03 bibrelex"
+, author =      "T. Welch"
+, title =       "Bounds on the information retrieval efficiency of static file structures"
+, type =        "Technical {Report}"
+, number =      88
+, institution = "Massachsetts Inst. Tech."
+, address =     "Cambridge, MA"
+, month =       jun
+, year =        1971
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{w-s5nps-97
-, author =	"Frank Weller"
-, title =	"Stability of {V}oronoi Neighborship under Perturbations of the Sites"
-, booktitle =	"Proc. 9th Canad. Conf. Comput. Geom."
-, year =	1997
-, pages =	"251--256"
-, update =	"97.11 jones"
+, author =      "Frank Weller"
+, title =       "Stability of {V}oronoi Neighborship under Perturbations of the Sites"
+, booktitle =   "Proc. 9th Canad. Conf. Comput. Geom."
+, year =        1997
+, pages =       "251--256"
+, update =      "97.11 jones"
 }
 
 @inproceedings{wk-cchsp-96
-, author =	"Frank Weller and Carsten Kirstein"
-, title =	"Computing the Convex Hull of a Simple Polygon on the Sphere"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	"5--6"
-, cites =	"l-fchsp-83, g-eadch-72, ZZZ"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Frank Weller and Carsten Kirstein"
+, title =       "Computing the Convex Hull of a Simple Polygon on the Sphere"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       "5--6"
+, cites =       "l-fchsp-83, g-eadch-72, ZZZ"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @book{w-pdcig-91
-, author =	"David Wells"
-, title =	"The Penguin Directory of Curious and Interesting Geometry"
-, publisher =	"Penguin"
-, address =	"London"
-, year =	1991
-, update =	"98.11 bibrelex"
+, author =      "David Wells"
+, title =       "The Penguin Directory of Curious and Interesting Geometry"
+, publisher =   "Penguin"
+, address =     "London"
+, year =        1991
+, update =      "98.11 bibrelex"
 }
 
 @book{w-mt-76
-, author =	"D. J. A. Welsh"
-, title =	"Matroid Theory"
-, publisher =	"Academic Press"
-, address =	"London, UK"
-, year =	1976
-, update =	"98.03 bibrelex"
+, author =      "D. J. A. Welsh"
+, title =       "Matroid Theory"
+, publisher =   "Academic Press"
+, address =     "London, UK"
+, year =        1976
+, update =      "98.03 bibrelex"
 }
 
 @techreport{w-csedb-91
-, author =	"Emo Welzl"
-, title =	"Constructing smallest enclosing disks (balls and ellipsoids)"
-, type =	"Technical {Report}"
-, institution =	"Freie Universit{\"a}t Berlin"
-, year =	1991
-, note =	"To appear"
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Emo Welzl"
+, title =       "Constructing smallest enclosing disks (balls and ellipsoids)"
+, type =        "Technical {Report}"
+, institution = "Freie Universit{\"a}t Berlin"
+, year =        1991
+, note =        "To appear"
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @techreport{w-cvgnl-84
-, author =	"Emo Welzl"
-, title =	"Constructing the visibility graph for $n$ line segments in {$O(n^{2})$} time"
-, type =	"Technical {Report}"
-, institution =	"Inst. Appl. Math. Comput. Sci., Univ. Leiden"
-, address =	"Leiden, Netherlands"
-, year =	1984
-, update =	"98.03 mitchell, 97.11 bibrelex"
+, author =      "Emo Welzl"
+, title =       "Constructing the visibility graph for $n$ line segments in {$O(n^{2})$} time"
+, type =        "Technical {Report}"
+, institution = "Inst. Appl. Math. Comput. Sci., Univ. Leiden"
+, address =     "Leiden, Netherlands"
+, year =        1984
+, update =      "98.03 mitchell, 97.11 bibrelex"
 }
 
 @article{w-cvgnl-85
-, author =	"Emo Welzl"
-, title =	"Constructing the visibility graph for $n$ line segments in {$O(n^{2})$} time"
-, journal =	"Inform. Process. Lett."
-, volume =	20
-, year =	1985
-, pages =	"167--171"
-, keywords =	"motion planning, construction, detection, visibility, plane-sweep, line segments"
-, update =	"98.03 mitchell"
+, author =      "Emo Welzl"
+, title =       "Constructing the visibility graph for $n$ line segments in {$O(n^{2})$} time"
+, journal =     "Inform. Process. Lett."
+, volume =      20
+, year =        1985
+, pages =       "167--171"
+, keywords =    "motion planning, construction, detection, visibility, plane-sweep, line segments"
+, update =      "98.03 mitchell"
 }
 
 @article{w-eljf-01
-, author =	"E. Welzl"
-, title =	"Entering and leaving $j$-facets"
-, journal =	"Discrete Comput. Geom."
-, volume =	25
-, number =	3
-, year =	2001
-, pages =	"351--364"
-, update =	"01.11 pocchiola"
+, author =      "E. Welzl"
+, title =       "Entering and leaving $j$-facets"
+, journal =     "Discrete Comput. Geom."
+, volume =      25
+, number =      3
+, year =        2001
+, pages =       "351--364"
+, update =      "01.11 pocchiola"
 }
 
 @incollection{w-ggssn-93
-, author =	"Emo Welzl"
-, title =	"Geometric Graphs with Small Stabbing Numbers: {Combinatorics} and Applications"
-, booktitle =	"Proc. 9th Internat. Conf. Fund. Comput. Theory"
-, site =	"Szeged, Hungary"
-, series =	"Lecture Notes Comput. Sci."
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"??"
-, update =	"99.11 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
+, author =      "Emo Welzl"
+, title =       "Geometric Graphs with Small Stabbing Numbers: {Combinatorics} and Applications"
+, booktitle =   "Proc. 9th Internat. Conf. Fund. Comput. Theory"
+, site =        "Szeged, Hungary"
+, series =      "Lecture Notes Comput. Sci."
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "??"
+, update =      "99.11 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @article{w-mksfs-86
-, author =	"Emo Welzl"
-, title =	"More on $k$-sets of finite sets in the plane"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"95--100"
-, keywords =	"combinatorial geometry"
-, update =	"98.03 mitchell"
+, author =      "Emo Welzl"
+, title =       "More on $k$-sets of finite sets in the plane"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "95--100"
+, keywords =    "combinatorial geometry"
+, update =      "98.03 mitchell"
 }
 
 @techreport{w-stlcn-92t
-, author =	"E. Welzl"
-, title =	"On spanning trees with low crossing numbers"
-, type =	"Technical {Report}"
-, number =	"B92-02"
-, institution =	"Free University Berlin"
-, address =	"Berlin, Germany"
-, year =	1992
-, update =	"98.07 agarwal, 98.03 bibrelex"
+, author =      "E. Welzl"
+, title =       "On spanning trees with low crossing numbers"
+, type =        "Technical {Report}"
+, number =      "B92-02"
+, institution = "Free University Berlin"
+, address =     "Berlin, Germany"
+, year =        1992
+, update =      "98.07 agarwal, 98.03 bibrelex"
 }
 
 @incollection{w-stlcn-92
-, author =	"Emo Welzl"
-, title =	"On spanning trees with low crossing numbers"
-, booktitle =	"Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	594
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"233--249"
-, update =	"98.03 mitchell, 97.03 aronov, 96.05 agarwal, 94.05 matousek"
+, author =      "Emo Welzl"
+, title =       "On spanning trees with low crossing numbers"
+, booktitle =   "Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      594
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "233--249"
+, update =      "98.03 mitchell, 97.03 aronov, 96.05 agarwal, 94.05 matousek"
 }
 
 @inproceedings{w-pttco-88
-, author =	"Emo Welzl"
-, title =	"Partition trees for triangle counting and other range searching problems"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"23--33"
-, cites =	"ahw-pgers-87, a-ded-83, c-prsig-87, d-cltem-78, d-brdnc-79, e-acg-87, ew-hrsls-86, hw-ensrq-87, m-mdscg-84, ps-cgi-85, s-dfs-72, vc-ucrfe-71, ww-sfrs-87, w-pr-82, ZZZ"
-, update =	"98.03 bibrelex+mitchell"
+, author =      "Emo Welzl"
+, title =       "Partition trees for triangle counting and other range searching problems"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "23--33"
+, cites =       "ahw-pgers-87, a-ded-83, c-prsig-87, d-cltem-78, d-brdnc-79, e-acg-87, ew-hrsls-86, hw-ensrq-87, m-mdscg-84, ps-cgi-85, s-dfs-72, vc-ucrfe-71, ww-sfrs-87, w-pr-82, ZZZ"
+, update =      "98.03 bibrelex+mitchell"
 }
 
 @incollection{w-sedbe-91a
-, author =	"Emo Welzl"
-, title =	"Smallest enclosing disks (balls and ellipsoids)"
-, editor =	"H. Maurer"
-, booktitle =	"New Results and New Trends in Computer Science"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	555
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"359--370"
-, succeeds =	"w-sedbe-91"
-, update =	"98.03 mitchell, 94.01 rote, 93.09 matousek"
+, author =      "Emo Welzl"
+, title =       "Smallest enclosing disks (balls and ellipsoids)"
+, editor =      "H. Maurer"
+, booktitle =   "New Results and New Trends in Computer Science"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      555
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "359--370"
+, succeeds =    "w-sedbe-91"
+, update =      "98.03 mitchell, 94.01 rote, 93.09 matousek"
 }
 
 @techreport{w-sedbe-91
-, author =	"Emo Welzl"
-, title =	"Smallest enclosing disks, balls and ellipsoids"
-, type =	"Report"
-, number =	"B 91-09"
-, institution =	"Fachbereich Mathematik, Freie Universit{\"at} Berlin"
-, address =	"Berlin, Germany"
-, year =	1991
-, update =	"98.03 mitchell"
+, author =      "Emo Welzl"
+, title =       "Smallest enclosing disks, balls and ellipsoids"
+, type =        "Report"
+, number =      "B 91-09"
+, institution = "Fachbereich Mathematik, Freie Universit{\"at} Berlin"
+, address =     "Berlin, Germany"
+, year =        1991
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{w-usoc-01
-, author =	"Emo Welzl"
-, title =	"Unique Sink Orientations of Cubes"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	11
-, update =	"01.04 icking"
+, author =      "Emo Welzl"
+, title =       "Unique Sink Orientations of Cubes"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       11
+, update =      "01.04 icking"
 }
 
 @techreport{ww-sfrs-87
-, author =	"E. Welzl and G. W{\"o}ginger"
-, title =	"On shatter functions of range spaces"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1987
-, update =	"98.03 bibrelex"
+, author =      "E. Welzl and G. W{\"o}ginger"
+, title =       "On shatter functions of range spaces"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1987
+, update =      "98.03 bibrelex"
 }
 
 @incollection{ww-srbsp-93
-, author =	"Emo Welzl and Barbara Wolfers"
-, title =	"Surface Reconstruction Between Simple Polygons via Angle Criteria"
-, booktitle =	"Proc. 1st Annu. European Sympos. Algorithms"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	726
-, publisher =	"Springer-Verlag"
-, year =	1993
-, pages =	"397--408"
-, update =	"94.01 smid, 93.09 milone+mitchell"
+, author =      "Emo Welzl and Barbara Wolfers"
+, title =       "Surface Reconstruction Between Simple Polygons via Angle Criteria"
+, booktitle =   "Proc. 1st Annu. European Sympos. Algorithms"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      726
+, publisher =   "Springer-Verlag"
+, year =        1993
+, pages =       "397--408"
+, update =      "94.01 smid, 93.09 milone+mitchell"
 }
 
 @article{ww-srbsp-94
-, author =	"Emo Welzl and B. Wolfers"
-, title =	"Surface Reconstruction Between Simple Polygons via Angle Criteria"
-, journal =	"J. Symbolic Comput."
-, volume =	17
-, year =	1994
-, pages =	"351--369"
-, update =	"98.03 mitchell, 97.03 gaertner+salinger+wolfers"
+, author =      "Emo Welzl and B. Wolfers"
+, title =       "Surface Reconstruction Between Simple Polygons via Angle Criteria"
+, journal =     "J. Symbolic Comput."
+, volume =      17
+, year =        1994
+, pages =       "351--369"
+, update =      "98.03 mitchell, 97.03 gaertner+salinger+wolfers"
 }
 
 @unpublished{w-tdbvo-92
-, author =	"James Wen"
-, title =	"A three dimensional browser for visualizing orthogonal hierarchies"
-, year =	1992
-, note =	"Brown {University}"
-, update =	"97.03 tamassia"
+, author =      "James Wen"
+, title =       "A three dimensional browser for visualizing orthogonal hierarchies"
+, year =        1992
+, note =        "Brown {University}"
+, update =      "97.03 tamassia"
 }
 
 @article{w-ghtti-90
-, author =	"R. Wenger"
-, title =	"A generalization of {Hadwiger}'s transversal theorem to intersecting sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"383--388"
+, author =      "R. Wenger"
+, title =       "A generalization of {Hadwiger}'s transversal theorem to intersecting sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "383--388"
 }
 
 @article{w-egncf-91
-, author =	"Rephael Wenger"
-, title =	"Extremal Graphs with No {$C^4$'s}, {$C^6$'s} or {$C^{10}$'s}"
-, journal =	"J. Combin. Theory Ser. A"
-, volume =	52
-, year =	1991
-, pages =	"113--116"
-, update =	"95.09 wenger"
+, author =      "Rephael Wenger"
+, title =       "Extremal Graphs with No {$C^4$'s}, {$C^6$'s} or {$C^{10}$'s}"
+, journal =     "J. Combin. Theory Ser. A"
+, volume =      52
+, year =        1991
+, pages =       "113--116"
+, update =      "95.09 wenger"
 }
 
 @techreport{w-gpcc-90
-, author =	"R. Wenger"
-, title =	"Geometric Permutations and Connected Components"
-, type =	"Technical {Report}"
-, number =	"90-50"
-, institution =	"DIMACS, Rutgers Univ."
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "R. Wenger"
+, title =       "Geometric Permutations and Connected Components"
+, type =        "Technical {Report}"
+, number =      "90-50"
+, institution = "DIMACS, Rutgers Univ."
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @incollection{w-httgt-97
-, author =	"R. Wenger"
-, title =	"Helly-type theorems and geometric transversals"
-, chapter =	4
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"63--82"
-, update =	"97.11 orourke"
+, author =      "R. Wenger"
+, title =       "Helly-type theorems and geometric transversals"
+, chapter =     4
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "63--82"
+, update =      "97.11 orourke"
 }
 
 @article{w-rqh-97
-, author =	"Rephael Wenger"
-, title =	"Randomized Quickhull"
-, journal =	"Algorithmica"
-, volume =	17
-, year =	1997
-, pages =	"322--329"
-, update =	"01.07 wenger"
+, author =      "Rephael Wenger"
+, title =       "Randomized Quickhull"
+, journal =     "Algorithmica"
+, volume =      17
+, year =        1997
+, pages =       "322--329"
+, update =      "01.07 wenger"
 }
 
 @article{w-ubgpc-90
-, author =	"R. Wenger"
-, title =	"Upper bounds on geometric permutations for convex sets"
-, journal =	"Discrete Comput. Geom."
-, volume =	5
-, year =	1990
-, pages =	"27--33"
+, author =      "R. Wenger"
+, title =       "Upper bounds on geometric permutations for convex sets"
+, journal =     "Discrete Comput. Geom."
+, volume =      5
+, year =        1990
+, pages =       "27--33"
 }
 
 @techreport{w-ublo-86
-, author =	"R. Wenger"
-, title =	"Upper bounds on linear orderings"
-, type =	"Technical {Report}"
-, number =	"SOCS 86.19"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, month =	oct
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "R. Wenger"
+, title =       "Upper bounds on linear orderings"
+, type =        "Technical {Report}"
+, number =      "SOCS 86.19"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, month =       oct
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{wd-ssvcc-81
-, author =	"R. S. Wenocur and R. M. Dudley"
-, title =	"Some special Vapnik-Chervonenkis classes"
-, journal =	"Discrete Math."
-, volume =	"??"
-, year =	1981
-, pages =	"313--318"
-, update =	"97.11 bibrelex"
+, author =      "R. S. Wenocur and R. M. Dudley"
+, title =       "Some special Vapnik-Chervonenkis classes"
+, journal =     "Discrete Math."
+, volume =      "??"
+, year =        1981
+, pages =       "313--318"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ws-mpvcr-94
-, author =	"C. Wentink and O. Schwarzkopf"
-, title =	"Motion Planning for Vacuum Cleaner Robots"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"51--56"
-, cites =	"ab-pptr-88, abf-pempa-88, ks-empac-90, l-rmp-91, oww-fabmo-85, ss-pmp1c-83, w-mpvcr-93, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "C. Wentink and O. Schwarzkopf"
+, title =       "Motion Planning for Vacuum Cleaner Robots"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "51--56"
+, cites =       "ab-pptr-88, abf-pempa-88, ks-empac-90, l-rmp-91, oww-fabmo-85, ss-pmp1c-83, w-mpvcr-93, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @techreport{wso-afd-96
-, author =	"C. Wentink and A. F. van der Stappen and M. Overmars"
-, title =	"Algorithms for fixture design"
-, type =	"Report"
-, number =	"UU-CS-1996-38"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1996
-, update =	"97.11 oostrum"
+, author =      "C. Wentink and A. F. van der Stappen and M. Overmars"
+, title =       "Algorithms for fixture design"
+, type =        "Report"
+, number =      "UU-CS-1996-38"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1996
+, update =      "97.11 oostrum"
 }
 
 @mastersthesis{w-mpvcr-93
-, author =	"C. J. Wentink"
-, title =	"Motion planning for vacuum cleaners and related problems"
-, school =	"Utrecht University"
-, month =	aug
-, year =	1993
-, keywords =	"master thesis"
-, update =	"98.11 bibrelex"
+, author =      "C. J. Wentink"
+, title =       "Motion planning for vacuum cleaners and related problems"
+, school =      "Utrecht University"
+, month =       aug
+, year =        1993
+, keywords =    "master thesis"
+, update =      "98.11 bibrelex"
 }
 
 @mastersthesis{w-vfgi-94
-, author =	"M. Wenzel"
-, title =	"Verschneidungsoperationen f{\"u}r {Geo}-{Informationssysteme}"
-, school =	"University of M{\"u}nster"
-, address =	"M{\"u}nster, Germany"
-, year =	1994
-, keywords =	"master thesis"
-, update =	"98.03 bibrelex"
+, author =      "M. Wenzel"
+, title =       "Verschneidungsoperationen f{\"u}r {Geo}-{Informationssysteme}"
+, school =      "University of M{\"u}nster"
+, address =     "M{\"u}nster, Germany"
+, year =        1994
+, keywords =    "master thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{wbg-vpocp-89
-, author =	"M. Werman and E. S. Baugher and A. Gualtieri"
-, title =	"The Visual Potential: One Convex Polygon"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	"??"
-, year =	1989
-, pages =	"96--130"
-, update =	"96.01 werman"
+, author =      "M. Werman and E. S. Baugher and A. Gualtieri"
+, title =       "The Visual Potential: One Convex Polygon"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      "??"
+, year =        1989
+, pages =       "96--130"
+, update =      "96.01 werman"
 }
 
 @article{wpmk-bgmpl-86
-, author =	"M. Werman and S. Peleg and R. Melter and T. Y. Kong"
-, title =	"Bipartite graph matching for points on a line or a circle"
-, journal =	"J. Algorithms"
-, volume =	7
-, year =	1986
-, pages =	"277--284"
+, author =      "M. Werman and S. Peleg and R. Melter and T. Y. Kong"
+, title =       "Bipartite graph matching for points on a line or a circle"
+, journal =     "J. Algorithms"
+, volume =      7
+, year =        1986
+, pages =       "277--284"
 }
 
 @article{wpr-dmmh-85
-, author =	"M. Werman and S. Peleg and A. Rosenfeld"
-, title =	"A Distance Metric for Multidimensional Histograms"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	32
-, year =	1985
-, pages =	"328--336"
-, update =	"96.01 werman"
+, author =      "M. Werman and S. Peleg and A. Rosenfeld"
+, title =       "A Distance Metric for Multidimensional Histograms"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      32
+, year =        1985
+, pages =       "328--336"
+, update =      "96.01 werman"
 }
 
 @inproceedings{ms-eas3d-95
-, author =	"M. Werman and A. Shashua"
-, title =	"Elimination: An Approach to the Study of 3D-from-2D"
-, booktitle =	"Proc. International Conference on Computer Vision"
-, year =	1995
-, update =	"96.01 werman"
+, author =      "M. Werman and A. Shashua"
+, title =       "Elimination: An Approach to the Study of 3D-from-2D"
+, booktitle =   "Proc. International Conference on Computer Vision"
+, year =        1995
+, update =      "96.01 werman"
 }
 
 @article{ww-saidb-95
-, author =	"M. Werman and D. Weinshall"
-, title =	"Similarity and Affine Invariant Distance Between Point Sets"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	17
-, year =	1995
-, pages =	"810--814"
-, update =	"96.01 werman"
+, author =      "M. Werman and D. Weinshall"
+, title =       "Similarity and Affine Invariant Distance Between Point Sets"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      17
+, year =        1995
+, pages =       "810--814"
+, update =      "96.01 werman"
 }
 
 @article{w-cchsp-86
-, author =	"G. Werner"
-, title =	"The Computation of the Convex Hull of a Simple Polygon in Linear Time"
-, journal =	"Computers and Artificial Intelligence"
-, volume =	5
-, number =	5
-, year =	1986
-, pages =	"451--458"
-, update =	"93.09 held"
+, author =      "G. Werner"
+, title =       "The Computation of the Convex Hull of a Simple Polygon in Linear Time"
+, journal =     "Computers and Artificial Intelligence"
+, volume =      5
+, number =      5
+, year =        1986
+, pages =       "451--458"
+, update =      "93.09 held"
 }
 
 @techreport{wk-rpsav-84
-, author =	"M. Wesley and G. Koppelman"
-, title =	"A robot planning system applied to {VLSI} manufacturing processes"
-, type =	"Report"
-, number =	"RC 10510 (\#45389)"
-, institution =	"IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1984
+, author =      "M. Wesley and G. Koppelman"
+, title =       "A robot planning system applied to {VLSI} manufacturing processes"
+, type =        "Report"
+, number =      "RC 10510 (\#45389)"
+, institution = "IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1984
 }
 
 @techreport{wm-fop-81
-, author =	"M. A. Wesley and G. Markowsky"
-, title =	"Fleshing out projections"
-, type =	"Report"
-, number =	"RC 8884"
-, institution =	"Dept. Comput. Sci., IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1981
+, author =      "M. A. Wesley and G. Markowsky"
+, title =       "Fleshing out projections"
+, type =        "Report"
+, number =      "RC 8884"
+, institution = "Dept. Comput. Sci., IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1981
 }
 
 @techreport{wm-gsmtt-84
-, author =	"M. A. Wesley and G. Markowsky"
-, title =	"Generation of solid models from two and three dimensional data"
-, type =	"Report"
-, number =	"RC 10328 (\#46080)"
-, institution =	"IBM T. J. Watson Res. Center"
-, address =	"Yorktown Heights, NY"
-, year =	1984
+, author =      "M. A. Wesley and G. Markowsky"
+, title =       "Generation of solid models from two and three dimensional data"
+, type =        "Report"
+, number =      "RC 10328 (\#46080)"
+, institution = "IBM T. J. Watson Res. Center"
+, address =     "Yorktown Heights, NY"
+, year =        1984
 }
 
 @article{w-wphp-93
-, author =	"G. Wesolowsky"
-, title =	"The {Weber} problem: {History} and perspective"
-, journal =	"Location Science"
-, volume =	1
-, year =	1993
-, pages =	"5--23"
-, keywords =	"facility location, Weber problem"
-, update =	"96.05 agarwal"
+, author =      "G. Wesolowsky"
+, title =       "The {Weber} problem: {History} and perspective"
+, journal =     "Location Science"
+, volume =      1
+, year =        1993
+, pages =       "5--23"
+, keywords =    "facility location, Weber problem"
+, update =      "96.05 agarwal"
 }
 
 @book{w-igt-95
-, author =	"D. West"
-, title =	"An Introduction to Graph Theory"
-, publisher =	"Prentice Hall"
-, year =	1995
-, update =	"97.11 bibrelex"
+, author =      "D. West"
+, title =       "An Introduction to Graph Theory"
+, publisher =   "Prentice Hall"
+, year =        1995
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{w-fipt-92
-, author =	"J. Westbrook"
-, title =	"Fast Incremental Planarity Testing"
-, booktitle =	"Automata, Languages and Programming (Proc. 19th ICALP)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	623
-, publisher =	"Springer-Verlag"
-, year =	1992
-, pages =	"342--353"
-, update =	"96.05 agarwal, 95.05 tamassia, 94.01 tamassia"
+, author =      "J. Westbrook"
+, title =       "Fast Incremental Planarity Testing"
+, booktitle =   "Automata, Languages and Programming (Proc. 19th ICALP)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      623
+, publisher =   "Springer-Verlag"
+, year =        1992
+, pages =       "342--353"
+, update =      "96.05 agarwal, 95.05 tamassia, 94.01 tamassia"
 }
 
 @article{wt-mbcbc-92
-, author =	"J. Westbrook and R. E. Tarjan"
-, title =	"Maintaining Bridge-Connected and Biconnected Components On-Line"
-, journal =	"Algorithmica"
-, volume =	7
-, year =	1992
-, pages =	"433--464"
-, update =	"94.01 tamassia"
+, author =      "J. Westbrook and R. E. Tarjan"
+, title =       "Maintaining Bridge-Connected and Biconnected Components On-Line"
+, journal =     "Algorithmica"
+, volume =      7
+, year =        1992
+, pages =       "433--464"
+, update =      "94.01 tamassia"
 }
 
 @article{ws-tdt-79
-, author =	"C. Wetherell and A. Shannon"
-, title =	"Tidy Drawing of Trees"
-, journal =	"IEEE Trans. Softw. Eng."
-, volume =	"SE-5"
-, number =	5
-, year =	1979
-, pages =	"514--520"
-, keywords =	"graph drawing"
-, update =	"93.09 tamassia"
+, author =      "C. Wetherell and A. Shannon"
+, title =       "Tidy Drawing of Trees"
+, journal =     "IEEE Trans. Softw. Eng."
+, volume =      "SE-5"
+, number =      5
+, year =        1979
+, pages =       "514--520"
+, keywords =    "graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @article{w-dpl-78
-, author =	"J. E. Wetzel"
-, title =	"On the division of the plane by lines"
-, journal =	"Amer. Math. Monthly"
-, volume =	85
-, year =	1978
-, pages =	"648--656"
-, update =	"98.07 agarwal"
+, author =      "J. E. Wetzel"
+, title =       "On the division of the plane by lines"
+, journal =     "Amer. Math. Monthly"
+, volume =      85
+, year =        1978
+, pages =       "648--656"
+, update =      "98.07 agarwal"
 }
 
 @incollection{w-etcp-50
-, author =	"H. Weyl"
-, title =	"Elementary Theory of Convex Polyhedra"
-, editor =	"W. Kuhn and A. W. Tucker"
-, booktitle =	"Contributions to the Theory of Games"
-, series =	"Annals of Mathematical Studies"
-, volume =	24
-, publisher =	"Princeton University Press"
-, address =	"Princeton, NJ"
-, year =	1950
-, pages =	"3--18"
-, update =	"97.11 bibrelex"
+, author =      "H. Weyl"
+, title =       "Elementary Theory of Convex Polyhedra"
+, editor =      "W. Kuhn and A. W. Tucker"
+, booktitle =   "Contributions to the Theory of Games"
+, series =      "Annals of Mathematical Studies"
+, volume =      24
+, publisher =   "Princeton University Press"
+, address =     "Princeton, NJ"
+, year =        1950
+, pages =       "3--18"
+, update =      "97.11 bibrelex"
 }
 
 @article{w-rhmfa-24
-, author =	"H. Weyl"
-, title =	"Randbemerkungen zu {H}auptproblemen der {M}athematik, {II}, {F}undamentalsatz der {A}legbra und {G}rundlagen der {M}athematik"
-, journal =	"Math. Z."
-, volume =	20
-, year =	1924
-, pages =	"131--151"
-, update =	"97.07 agarwal"
+, author =      "H. Weyl"
+, title =       "Randbemerkungen zu {H}auptproblemen der {M}athematik, {II}, {F}undamentalsatz der {A}legbra und {G}rundlagen der {M}athematik"
+, journal =     "Math. Z."
+, volume =      20
+, year =        1924
+, pages =       "131--151"
+, update =      "97.07 agarwal"
 }
 
 @book{w-s-51
-, author =	"H. Weyl"
-, title =	"Symmetry"
-, publisher =	"Princeton"
-, year =	1951
-, update =	"97.11 bibrelex"
+, author =      "H. Weyl"
+, title =       "Symmetry"
+, publisher =   "Princeton"
+, year =        1951
+, update =      "97.11 bibrelex"
 }
 
 @article{wsckcps-oaoer-96
-, author =	"K. Y. Whang and J. W. Song and J. W. Chang and J. Y. Kim and W. S. Cho and C. M. Park and I. Y. Song"
-, title =	"Octree-{R}: {An} Adaptible octree for efficient ray tracing"
-, journal =	"IEEE Trans. Visual. and Comp. Graphics"
-, volume =	1
-, year =	1995
-, pages =	"343--349"
-, keywords =	"octree, ray tracing"
-, update =	"97.07 agarwal, 96.05 agarwal"
+, author =      "K. Y. Whang and J. W. Song and J. W. Chang and J. Y. Kim and W. S. Cho and C. M. Park and I. Y. Song"
+, title =       "Octree-{R}: {An} Adaptible octree for efficient ray tracing"
+, journal =     "IEEE Trans. Visual. and Comp. Graphics"
+, volume =      1
+, year =        1995
+, pages =       "343--349"
+, keywords =    "octree, ray tracing"
+, update =      "97.07 agarwal, 96.05 agarwal"
 }
 
 @book{w-imm-84
-, author =	"A. Whelan"
-, title =	"Injection moulding machines"
-, publisher =	"Elsevier"
-, address =	"London, UK"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "A. Whelan"
+, title =       "Injection moulding machines"
+, publisher =   "Elsevier"
+, address =     "London, UK"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @article{w-rit-86
-, author =	"T. Whelan"
-, title =	"A representation of a {$C^2$} interpolant over triangles"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	3
-, year =	1986
-, pages =	"53--66"
-, update =	"98.07 bibrelex"
+, author =      "T. Whelan"
+, title =       "A representation of a {$C^2$} interpolant over triangles"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      3
+, year =        1986
+, pages =       "53--66"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{wb-tgt-78
-, author =	"A. T. White and L. W. Beineke"
-, title =	"Topological graph theory"
-, editor =	"L. Beineke and R. Wilson"
-, booktitle =	"Selected Topics in Graph Theory"
-, publisher =	"Academic Press"
-, address =	"London, UK"
-, year =	1978
-, pages =	"15--49"
-, update =	"98.03 bibrelex"
+, author =      "A. T. White and L. W. Beineke"
+, title =       "Topological graph theory"
+, editor =      "L. Beineke and R. Wilson"
+, booktitle =   "Selected Topics in Graph Theory"
+, publisher =   "Academic Press"
+, address =     "London, UK"
+, year =        1978
+, pages =       "15--49"
+, update =      "98.03 bibrelex"
 }
 
 @article{w-dpo-78
-, author =	"D. White"
-, title =	"A design for polygon overlay"
-, journal =	"Harvard Papers on Geographic Inform. Sys."
-, volume =	6
-, year =	1978
-, update =	"98.11 bibrelex"
+, author =      "D. White"
+, title =       "A design for polygon overlay"
+, journal =     "Harvard Papers on Geographic Inform. Sys."
+, volume =      6
+, year =        1978
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{w-nmpo-77
-, author =	"D. White"
-, title =	"A New Method of Polygon Overlay"
-, booktitle =	"An Advanced Study Symposium on Topological Data Structures for Geographic Information Systems"
-, site =	"Cambridge, MA"
-, organization =	"Laboratory for Computer Graphics and Spatial Analysis, Harvard Univ."
-, month =	oct
-, year =	1977
-, update =	"98.03 bibrelex"
+, author =      "D. White"
+, title =       "A New Method of Polygon Overlay"
+, booktitle =   "An Advanced Study Symposium on Topological Data Structures for Geographic Information Systems"
+, site =        "Cambridge, MA"
+, organization =        "Laboratory for Computer Graphics and Spatial Analysis, Harvard Univ."
+, month =       oct
+, year =        1977
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{wmbs-ahmgv-95
-, author =	"David White and Lai Mingwu and Steven E. Benzley and Gregory D. Sjaardema"
-, title =	"Automated Hexahedral Mesh Generation by Virtual Decomposition"
-, booktitle =	"Proc. 4th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"Albuquerque, NM"
-, year =	1995
-, pages =	"165--177"
-, update =	"96.01 samitchell"
+, author =      "David White and Lai Mingwu and Steven E. Benzley and Gregory D. Sjaardema"
+, title =       "Automated Hexahedral Mesh Generation by Virtual Decomposition"
+, booktitle =   "Proc. 4th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "Albuquerque, NM"
+, year =        1995
+, pages =       "165--177"
+, update =      "96.01 samitchell"
 }
 
 @inproceedings{wj-siwst-96
-, author =	"D. A. White and R. Jain"
-, title =	"Similarity indexing with the {SS}-tree"
-, booktitle =	"Proc. 12th IEEE Internat. Conf. Data Eng."
-, year =	1996
-, pages =	"516--523"
-, update =	"97.07 agarwal"
+, author =      "D. A. White and R. Jain"
+, title =       "Similarity indexing with the {SS}-tree"
+, booktitle =   "Proc. 12th IEEE Internat. Conf. Data Eng."
+, year =        1996
+, pages =       "516--523"
+, update =      "97.07 agarwal"
 }
 
 @techreport{wj-assr-96
-, author =	"D. A. White and S. Zdonik"
-, title =	"Algorithms and strategies for similarity retrieval"
-, type =	"Technical {Report}"
-, number =	"VCL-96-1101"
-, institution =	"Univ. California Davis"
-, address =	"Davis, CA"
-, year =	1996
-, update =	"98.07 bibrelex"
+, author =      "D. A. White and S. Zdonik"
+, title =       "Algorithms and strategies for similarity retrieval"
+, type =        "Technical {Report}"
+, number =      "VCL-96-1101"
+, institution = "Univ. California Davis"
+, address =     "Davis, CA"
+, year =        1996
+, update =      "98.07 bibrelex"
 }
 
 @article{w-algau-85
-, author =	"E. R. White"
-, title =	"Assessment of line-generalization algorithms using characteristic points"
-, journal =	"Amer. Cartogr."
-, volume =	12
-, number =	1
-, year =	1985
-, pages =	"17--27"
-, update =	"98.03 bibrelex"
+, author =      "E. R. White"
+, title =       "Assessment of line-generalization algorithms using characteristic points"
+, journal =     "Amer. Cartogr."
+, volume =      12
+, number =      1
+, year =        1985
+, pages =       "17--27"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{w-ntloi-82
-, author =	"M. White"
-, title =	"{N}-trees: {L}arge ordered indexes for multidimensional space"
-, type =	"Tech.\ Report"
-, institution =	"US Bureau of the Census, Statistical Research Division"
-, address =	"Washington, DC"
-, year =	1982
-, update =	"97.07 agarwal"
+, author =      "M. White"
+, title =       "{N}-trees: {L}arge ordered indexes for multidimensional space"
+, type =        "Tech.\ Report"
+, institution = "US Bureau of the Census, Statistical Research Division"
+, address =     "Washington, DC"
+, year =        1982
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{w-tachm-83
-, author =	"M. S. White"
-, title =	"Tribulations of Automated Carthography and How Mathematics Helps"
-, booktitle =	"Proc. 6th International Symposium on Automated Carthography"
-, site =	"Ottawa"
-, year =	1983
-, pages =	"408--418"
-, update =	"98.03 bibrelex"
+, author =      "M. S. White"
+, title =       "Tribulations of Automated Carthography and How Mathematics Helps"
+, booktitle =   "Proc. 6th International Symposium on Automated Carthography"
+, site =        "Ottawa"
+, year =        1983
+, pages =       "408--418"
+, update =      "98.03 bibrelex"
 }
 
 @article{wg-plrsm-85
-, author =	"M. S. White and P. Griffin"
-, title =	"Piecewise Linear Rubber-Sheet Map Transformation"
-, journal =	"Amer. Cartogr."
-, volume =	12
-, number =	2
-, year =	1985
-, pages =	"123--131"
-, update =	"98.03 bibrelex"
+, author =      "M. S. White and P. Griffin"
+, title =       "Piecewise Linear Rubber-Sheet Map Transformation"
+, journal =     "Amer. Cartogr."
+, volume =      12
+, number =      2
+, year =        1985
+, pages =       "123--131"
+, update =      "98.03 bibrelex"
 }
 
 @unpublished{w-cgpsl-87
-, author =	"N. White"
-, title =	"Comments on {Goodman}'s problem on skew lines"
-, year =	1987
-, note =	"Unpublished Note"
-, update =	"98.03 bibrelex"
+, author =      "N. White"
+, title =       "Comments on {Goodman}'s problem on skew lines"
+, year =        1987
+, note =        "Unpublished Note"
+, update =      "98.03 bibrelex"
 }
 
 @article{ww-agmf-84
-, author =	"N. White and W. Whiteley"
-, title =	"the algebraic geometry of motions of frameworks"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	"??"
-, year =	1984
-, note =	"to appear (preprint 1984)"
-, update =	"97.11 bibrelex"
+, author =      "N. White and W. Whiteley"
+, title =       "the algebraic geometry of motions of frameworks"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      "??"
+, year =        1984
+, note =        "to appear (preprint 1984)"
+, update =      "97.11 bibrelex"
 }
 
 @article{w-nmwvi-89
-, author =	"N. L. White"
-, title =	"A nonuniform matroid which violates the isotopy conjecture"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"1--2"
+, author =      "N. L. White"
+, title =       "A nonuniform matroid which violates the isotopy conjecture"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "1--2"
 }
 
 @incollection{w-gagca-97
-, author =	"N. L. White"
-, title =	"Geometric applications of the {Grassmann-Cayley} algebra"
-, chapter =	48
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"881--892"
-, update =	"97.11 orourke"
+, author =      "N. L. White"
+, title =       "Geometric applications of the {Grassmann-Cayley} algebra"
+, chapter =     48
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "881--892"
+, update =      "97.11 orourke"
 }
 
 @article{w-ms-
-, author =	"W. Whiteley"
-, title =	"A matrix for splines"
-, journal =	"J. Approx. Theory"
-, volume =	"??"
-, year =	"??"
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "W. Whiteley"
+, title =       "A matrix for splines"
+, journal =     "J. Approx. Theory"
+, volume =      "??"
+, year =        "??"
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @article{w-mhasa-89
-, author =	"W. Whiteley"
-, title =	"A matroid on hypergraphs, with applications in scene analysis and geometry"
-, journal =	"Discrete Comput. Geom."
-, volume =	4
-, year =	1989
-, pages =	"75--95"
-, succeeds =	"w-tapp-86"
-, update =	"93.09 milone+mitchell"
+, author =      "W. Whiteley"
+, title =       "A matroid on hypergraphs, with applications in scene analysis and geometry"
+, journal =     "Discrete Comput. Geom."
+, volume =      4
+, year =        1989
+, pages =       "75--95"
+, succeeds =    "w-tapp-86"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{w-gbs-90
-, author =	"W. Whiteley"
-, title =	"Geometry of bivariate splines"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"351--353"
-, cites =	"a-csmpp-87, b-htssg-88, c-mss-88, s-mild-86, w-tapp-86, w-ms-, w-mrs-, w-mhasa-89, w-cbs-90, w-gbcs-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "W. Whiteley"
+, title =       "Geometry of bivariate splines"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "351--353"
+, cites =       "a-csmpp-87, b-htssg-88, c-mss-88, s-mild-86, w-tapp-86, w-ms-, w-mrs-, w-mhasa-89, w-cbs-90, w-gbcs-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{w-mrs-
-, author =	"W. Whiteley"
-, title =	"Matroids and rigid structures"
-, editor =	"N. White"
-, booktitle =	"Applications of Matroid Theory"
-, publisher =	"Cambridge University Press"
-, year =	"??"
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "W. Whiteley"
+, title =       "Matroids and rigid structures"
+, editor =      "N. White"
+, booktitle =   "Applications of Matroid Theory"
+, publisher =   "Cambridge University Press"
+, year =        "??"
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @article{w-rp-79
-, author =	"W. Whiteley"
-, title =	"Realizability of Polyhedra"
-, journal =	"Structural Topology"
-, volume =	1
-, year =	1979
-, pages =	"46--58"
-, update =	"97.11 bibrelex"
+, author =      "W. Whiteley"
+, title =       "Realizability of Polyhedra"
+, journal =     "Structural Topology"
+, volume =      1
+, year =        1979
+, pages =       "46--58"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{w-rsa-97
-, author =	"W. Whiteley"
-, title =	"Rigidity and scene analysis"
-, chapter =	49
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"893--916"
-, update =	"97.11 orourke"
+, author =      "W. Whiteley"
+, title =       "Rigidity and scene analysis"
+, chapter =     49
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "893--916"
+, update =      "97.11 orourke"
 }
 
 @techreport{w-cbs-90
-, author =	"W. Whiteley"
-, title =	"The combinatorics of bivariate splines"
-, type =	"Preprint"
-, institution =	"Champlain Regional College"
-, address =	"St. Lambert, Quebec"
-, month =	jan
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "W. Whiteley"
+, title =       "The combinatorics of bivariate splines"
+, type =        "Preprint"
+, institution = "Champlain Regional College"
+, address =     "St. Lambert, Quebec"
+, month =       jan
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @techreport{w-gbcs-90
-, author =	"W. Whiteley"
-, title =	"The geometry of bivariate {${C^{1}}_{2}$}-splines"
-, type =	"Preprint"
-, institution =	"Champlain Regional College"
-, address =	"St. Lambert, Quebec"
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "W. Whiteley"
+, title =       "The geometry of bivariate {${C^{1}}_{2}$}-splines"
+, type =        "Preprint"
+, institution = "Champlain Regional College"
+, address =     "St. Lambert, Quebec"
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @incollection{w-pgrf-85
-, author =	"W. Whiteley"
-, title =	"The projective geometry of rigid frameworks"
-, editor =	"C. A. Baker and L. M. Batten"
-, booktitle =	"Finite Geometries"
-, series =	"Lecture Notes in Pure and Applied Mathematics"
-, volume =	103
-, publisher =	"Marcel Dekker"
-, address =	"New York, NY"
-, year =	1985
-, pages =	"353--375"
+, author =      "W. Whiteley"
+, title =       "The projective geometry of rigid frameworks"
+, editor =      "C. A. Baker and L. M. Batten"
+, booktitle =   "Finite Geometries"
+, series =      "Lecture Notes in Pure and Applied Mathematics"
+, volume =      103
+, publisher =   "Marcel Dekker"
+, address =     "New York, NY"
+, year =        1985
+, pages =       "353--375"
 }
 
 @inproceedings{w-tapp-86
-, author =	"W. Whiteley"
-, title =	"Two algorithms for polyhedral pictures"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"142--149"
-, precedes =	"w-mhasa-89, cw-pspp-86"
-, cites =	"ab-gdt-86, ab-rdt-85, abcw-cpdts-88, cw-pspp-86, c-gs-90, es-vda-86, h-ions-71, h-dcaps-77, i-csldp-85, k-tow-80, m-ipps-73, m-orfdf-64, s-acaal-84, s-mild-86, w-mhasa-89, ww-agmf-84, w-mspp-82, ZZZ"
-, update =	"97.11 bibrelex, 93.09 ne+mitchell"
+, author =      "W. Whiteley"
+, title =       "Two algorithms for polyhedral pictures"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "142--149"
+, precedes =    "w-mhasa-89, cw-pspp-86"
+, cites =       "ab-gdt-86, ab-rdt-85, abcw-cpdts-88, cw-pspp-86, c-gs-90, es-vda-86, h-ions-71, h-dcaps-77, i-csldp-85, k-tow-80, m-ipps-73, m-orfdf-64, s-acaal-84, s-mild-86, w-mhasa-89, ww-agmf-84, w-mspp-82, ZZZ"
+, update =      "97.11 bibrelex, 93.09 ne+mitchell"
 }
 
 @article{w-aigpl-92
-, author =	"S. Whitesides"
-, title =	"Algorithmic issues in the geometry of planar linkage movement"
-, journal =	"Australian Comput. J."
-, volume =	"??"
-, month =	may
-, year =	1992
-, pages =	"42--50"
-, note =	"Special Issue on Algorithms"
-, update =	"98.11 bibrelex"
+, author =      "S. Whitesides"
+, title =       "Algorithmic issues in the geometry of planar linkage movement"
+, journal =     "Australian Comput. J."
+, volume =      "??"
+, month =       may
+, year =        1992
+, pages =       "42--50"
+, note =        "Special Issue on Algorithms"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{we-mbsbg-90
-, author =	"S. Whitesides and P. Eades"
-, title =	"Maximal Biplanar Subgraphs of Bipartite Graphs"
-, type =	"Technical {Report}"
-, number =	"SOCS 90.24"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "S. Whitesides and P. Eades"
+, title =       "Maximal Biplanar Subgraphs of Bipartite Graphs"
+, type =        "Technical {Report}"
+, number =      "SOCS 90.24"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{wz-kacjc-90
-, author =	"S. Whitesides and R. Zhao"
-, title =	"$K$-Admissible Collections of {Jordan} Curves and Offsets of Circular Arc Figures"
-, type =	"Technical {Report}"
-, number =	"SOCS 90.08"
-, institution =	"McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1990
-, update =	"93.09 milone+mitchell"
+, author =      "S. Whitesides and R. Zhao"
+, title =       "$K$-Admissible Collections of {Jordan} Curves and Offsets of Circular Arc Figures"
+, type =        "Technical {Report}"
+, number =      "SOCS 90.08"
+, institution = "McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1990
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{wz-pet-89
-, author =	"S. Whitesides and R. Zhao"
-, title =	"On the placement of {Euclidean} trees"
-, booktitle =	"Abstracts 1st Canad. Conf. Comput. Geom."
-, year =	1989
-, pages =	28
+, author =      "S. Whitesides and R. Zhao"
+, title =       "On the placement of {Euclidean} trees"
+, booktitle =   "Abstracts 1st Canad. Conf. Comput. Geom."
+, year =        1989
+, pages =       28
 }
 
 @inproceedings{wz-ocaf-90
-, author =	"S. Whitesides and R. Y. Zhao"
-, title =	"Offsets of circular arc figures"
-, booktitle =	"Proc. 2nd Canad. Conf. Comput. Geom."
-, year =	1990
-, pages =	"362--365"
-, cites =	"bo-arcgi-79, eghppsss-ajati-89, f-eopss-85, klps-ujrcf-86, oww-fabmo-85, rr-oosm-86, sh-gip-76, spd-ogm-88, s-cgcw-86, z-pet-90, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "S. Whitesides and R. Y. Zhao"
+, title =       "Offsets of circular arc figures"
+, booktitle =   "Proc. 2nd Canad. Conf. Comput. Geom."
+, year =        1990
+, pages =       "362--365"
+, cites =       "bo-arcgi-79, eghppsss-ajati-89, f-eopss-85, klps-ujrcf-86, oww-fabmo-85, rr-oosm-86, sh-gip-76, spd-ogm-88, s-cgcw-86, z-pet-90, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{w-cgmp-85
-, author =	"S. H. Whitesides"
-, title =	"Computational geometry and motion planning"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"377--427"
+, author =      "S. H. Whitesides"
+, title =       "Computational geometry and motion planning"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "377--427"
 }
 
 % ### verify, published in 1998 ??
 @proceedings{w-gd-98
-, title =	"Graph Drawing (Proc. GD '98)"
-, editor =	"Sue H. Whitesides"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1547
-, publisher =	"Springer-Verlag"
-, year =	1998
-, keywords =	"graph drawing, collection"
-, update =	"99.07 vismara, 99.03 patrignani+vismari"
+, title =       "Graph Drawing (Proc. GD '98)"
+, editor =      "Sue H. Whitesides"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1547
+, publisher =   "Springer-Verlag"
+, year =        1998
+, keywords =    "graph drawing, collection"
+, update =      "99.07 vismara, 99.03 patrignani+vismari"
 }
 
 @inproceedings{w-pgr-95
-, author =	"S. H. Whitesides"
-, title =	"Poster Gallery Report"
-, editor =	"R. Tamassia and I. G. Tollis"
-, booktitle =	"Graph Drawing (Proc. GD '94)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	894
-, publisher =	"Springer-Verlag"
-, year =	1995
-, pages =	"461--469"
-, keywords =	"graph drawing, poster, system"
-, update =	"95.01 tamassia"
+, author =      "S. H. Whitesides"
+, title =       "Poster Gallery Report"
+, editor =      "R. Tamassia and I. G. Tollis"
+, booktitle =   "Graph Drawing (Proc. GD '94)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      894
+, publisher =   "Springer-Verlag"
+, year =        1995
+, pages =       "461--469"
+, keywords =    "graph drawing, poster, system"
+, update =      "95.01 tamassia"
 }
 
 @article{w-ffcmf-77
-, author =	"D. Whitney"
-, title =	"Force feedback control of manipulator fine motions"
-, journal =	"Journal of Dynamic Systems, Measurment and Control"
-, volume =	"??"
-, month =	jun
-, year =	1977
-, pages =	"91--97"
-, update =	"98.03 bibrelex"
+, author =      "D. Whitney"
+, title =       "Force feedback control of manipulator fine motions"
+, journal =     "Journal of Dynamic Systems, Measurment and Control"
+, volume =      "??"
+, month =       jun
+, year =        1977
+, pages =       "91--97"
+, update =      "98.03 bibrelex"
 }
 
 @article{w-tg-31
-, author =	"H. Whitney"
-, title =	"A heorem on graphs"
-, journal =	"Annu. Math."
-, volume =	32
-, year =	1931
-, pages =	"378--390"
-, update =	"98.11 bibrelex"
+, author =      "H. Whitney"
+, title =       "A heorem on graphs"
+, journal =     "Annu. Math."
+, volume =      32
+, year =        1931
+, pages =       "378--390"
+, update =      "98.11 bibrelex"
 }
 
 @article{w-aedfd-34
-, author =	"H. Whitney"
-, title =	"Analytic extensions of differentiable functions defined in closed sets"
-, journal =	"Trans. Amer. Math. Soc."
-, volume =	36
-, year =	1934
-, pages =	"63--89"
-, update =	"98.07 bibrelex"
+, author =      "H. Whitney"
+, title =       "Analytic extensions of differentiable functions defined in closed sets"
+, journal =     "Trans. Amer. Math. Soc."
+, volume =      36
+, year =        1934
+, pages =       "63--89"
+, update =      "98.07 bibrelex"
 }
 
 @article{w-esrav-57
-, author =	"H. Whitney"
-, title =	"Elementary structure of real algebraic varieties"
-, journal =	"Ann. Math."
-, volume =	66
-, number =	3
-, year =	1975
-, update =	"98.03 bibrelex"
+, author =      "H. Whitney"
+, title =       "Elementary structure of real algebraic varieties"
+, journal =     "Ann. Math."
+, volume =      66
+, number =      3
+, year =        1975
+, update =      "98.03 bibrelex"
 }
 
 @article{w-rccp-37
-, author =	"H. Whitney"
-, title =	"On regular closed curves in the plane"
-, journal =	"Compos. Math."
-, volume =	4
-, year =	1937
-, pages =	"276--284"
-, update =	"98.03 bibrelex"
+, author =      "H. Whitney"
+, title =       "On regular closed curves in the plane"
+, journal =     "Compos. Math."
+, volume =      4
+, year =        1937
+, pages =       "276--284"
+, update =      "98.03 bibrelex"
 }
 
 @article{w-mspp-82
-, author =	"W. Whitney"
-, title =	"Motions and Stresses of Projected Polyhedra"
-, journal =	"Structural Topology"
-, volume =	7
-, year =	1982
-, pages =	"13--38"
-, keywords =	"graph drawing, convex, straight-line"
-, update =	"96.09 tamassia"
+, author =      "W. Whitney"
+, title =       "Motions and Stresses of Projected Polyhedra"
+, journal =     "Structural Topology"
+, volume =      7
+, year =        1982
+, pages =       "13--38"
+, keywords =    "graph drawing, convex, straight-line"
+, update =      "96.09 tamassia"
 }
 
 @article{w-mcp-66
-, author =	"J. V. Whittaker"
-, title =	"A mountain-climbing problem"
-, journal =	"Canad. J. Math."
-, volume =	18
-, year =	1966
-, pages =	"873--882"
+, author =      "J. V. Whittaker"
+, title =       "A mountain-climbing problem"
+, journal =     "Canad. J. Math."
+, volume =      18
+, year =        1966
+, pages =       "873--882"
 }
 
 @article{w-iimsd-80
-, author =	"T. Whitted"
-, title =	"An Improved Illumination Model for Shaded Display"
-, journal =	"Commun. ACM"
-, volume =	23
-, number =	6
-, month =	jun
-, year =	1980
-, pages =	"343--349"
-, update =	"97.11 bibrelex"
+, author =      "T. Whitted"
+, title =       "An Improved Illumination Model for Shaded Display"
+, journal =     "Commun. ACM"
+, volume =      23
+, number =      6
+, month =       jun
+, year =        1980
+, pages =       "343--349"
+, update =      "97.11 bibrelex"
 }
 
 @book{w-at-42
-, author =	"G. T. Whyburn"
-, title =	"Analytic Topology"
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1942
-, update =	"97.11 bibrelex"
+, author =      "G. T. Whyburn"
+, title =       "Analytic Topology"
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1942
+, update =      "97.11 bibrelex"
 }
 
 @techreport{w-etfes-86
-, author =	"A. B. Widlund"
-, title =	"An extension theorem for finite element spaces with three applications"
-, type =	"Report"
-, number =	233
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1986
+, author =      "A. B. Widlund"
+, title =       "An extension theorem for finite element spaces with three applications"
+, type =        "Report"
+, number =      233
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1986
 }
 
 @techreport{w-imepr-84
-, author =	"A. B. Widlund"
-, title =	"Iterative methods for elliptic problems on regions partitioned into substructures and the biharmonic {Dirichlet} problem"
-, type =	"Report"
-, number =	101
-, institution =	"Dept. Comput. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1984
+, author =      "A. B. Widlund"
+, title =       "Iterative methods for elliptic problems on regions partitioned into substructures and the biharmonic {Dirichlet} problem"
+, type =        "Report"
+, number =      101
+, institution = "Dept. Comput. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1984
 }
 
 @phdthesis{w-cccgv-83
-, author =	"P. Widmayer"
-, title =	"Computational complexity in computer graphics and {VLSI} design"
-, type =	"Ph.{D}. Thesis"
-, school =	"Univ. Fridericiana Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1983
-, keywords =	"doctoral thesis"
+, author =      "P. Widmayer"
+, title =       "Computational complexity in computer graphics and {VLSI} design"
+, type =        "Ph.{D}. Thesis"
+, school =      "Univ. Fridericiana Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1983
+, keywords =    "doctoral thesis"
 }
 
 @inproceedings{w-gdsfs-92
-, author =	"Peter Widmayer"
-, title =	"Guard Data Structures for Fat Spatial Objects"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	89
-, update =	"00.03 bibrelex"
+, author =      "Peter Widmayer"
+, title =       "Guard Data Structures for Fat Spatial Objects"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       89
+, update =      "00.03 bibrelex"
 }
 
 @techreport{w-ndiv-89
-, author =	"P. Widmayer"
-, title =	"Network Design Issues in {VLSI}"
-, institution =	"Institut {f\"ur} Informatik, University Freiburg"
-, address =	"{Rheinstrasse} 10-12, 7800, Freiburg, West Germany"
-, year =	1989
+, author =      "P. Widmayer"
+, title =       "Network Design Issues in {VLSI}"
+, institution = "Institut {f\"ur} Informatik, University Freiburg"
+, address =     "{Rheinstrasse} 10-12, 7800, Freiburg, West Germany"
+, year =        1989
 }
 
 @techreport{ww-tsoab-86
-, author =	"P. Widmayer and D. Wood"
-, title =	"A time and space optimal algorithm for boolean mask operations for orthogonal polygons"
-, type =	"Report"
-, number =	161
-, institution =	"Universit{\"a}t Karlsruhe"
-, address =	"Karlsruhe, West Germany"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "P. Widmayer and D. Wood"
+, title =       "A time and space optimal algorithm for boolean mask operations for orthogonal polygons"
+, type =        "Report"
+, number =      161
+, institution = "Universit{\"a}t Karlsruhe"
+, address =     "Karlsruhe, West Germany"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{ww-tsoab-88
-, author =	"P. Widmayer and D. Wood"
-, title =	"A time- and space-optimal algorithm for {Boolean} masking operations"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	41
-, year =	1988
-, pages =	"14--27"
+, author =      "P. Widmayer and D. Wood"
+, title =       "A time- and space-optimal algorithm for {Boolean} masking operations"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      41
+, year =        1988
+, pages =       "14--27"
 }
 
 @article{ww-tsocc-87
-, author =	"P. Widmayer and D. Wood"
-, title =	"Time- and space-optimal contour computation for a set of rectangles"
-, journal =	"Inform. Process. Lett."
-, volume =	24
-, year =	1987
-, pages =	"335--338"
-, keywords =	"complexity theory, design of algorithms, combinatorial geometry"
+, author =      "P. Widmayer and D. Wood"
+, title =       "Time- and space-optimal contour computation for a set of rectangles"
+, journal =     "Inform. Process. Lett."
+, volume =      24
+, year =        1987
+, pages =       "335--338"
+, keywords =    "complexity theory, design of algorithms, combinatorial geometry"
 }
 
 @article{wwsw-suipp-86
-, author =	"P. Widmayer and Y. F. Wu and M. D. F. Schlag and C. K. Wong"
-, title =	"On some union and intersection problems for polygons with fixed orientation"
-, journal =	"Computing"
-, volume =	36
-, year =	1986
-, pages =	"183--197"
-, update =	"98.07 bibrelex"
+, author =      "P. Widmayer and Y. F. Wu and M. D. F. Schlag and C. K. Wong"
+, title =       "On some union and intersection problems for polygons with fixed orientation"
+, journal =     "Computing"
+, volume =      36
+, year =        1986
+, pages =       "183--197"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{www-dpcgf-85
-, author =	"P. Widmayer and Y. F. Wu and C. K. Wong"
-, title =	"Distance problems in computational geometry with fixed orientations"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"186--195"
-, precedes =	"www-sdpfo-87"
-, cites =	"bt-eacmd-83, ct-fmst-76, cw-oaimd-83, cw-mvdbs-84, e-ipcg-82, e-cedbt-82, gbt-srtgp-84, g-cceac-83, ht-fafnc-84, h-oarms-79, k-osps-83, l-tdvdl-80, lp-cgs-84, lw-vdllm-80, mt-fmvdb-83, nllw-xchsx-83, osw-dcrch-83, s-fmdbt-81, sh-cpp-75, t-oacmv-84a, tb-oacmd-83, tm-soafm-82, v-ulds-80, ZZZ"
-, update =	"97.11 bibrelex, 93.05 jones"
+, author =      "P. Widmayer and Y. F. Wu and C. K. Wong"
+, title =       "Distance problems in computational geometry with fixed orientations"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "186--195"
+, precedes =    "www-sdpfo-87"
+, cites =       "bt-eacmd-83, ct-fmst-76, cw-oaimd-83, cw-mvdbs-84, e-ipcg-82, e-cedbt-82, gbt-srtgp-84, g-cceac-83, ht-fafnc-84, h-oarms-79, k-osps-83, l-tdvdl-80, lp-cgs-84, lw-vdllm-80, mt-fmvdb-83, nllw-xchsx-83, osw-dcrch-83, s-fmdbt-81, sh-cpp-75, t-oacmv-84a, tb-oacmd-83, tm-soafm-82, v-ulds-80, ZZZ"
+, update =      "97.11 bibrelex, 93.05 jones"
 }
 
 @article{www-sdpfo-87
-, author =	"P. Widmayer and Y. F. Wu and C. K. Wong"
-, title =	"On some distance problems in fixed orientations"
-, journal =	"SIAM J. Comput."
-, volume =	16
-, year =	1987
-, pages =	"728--746"
-, succeeds =	"www-dpcgf-85"
-, annote =	"VD for metric where paths are limited to a fixed
-		 number of orientations"
+, author =      "P. Widmayer and Y. F. Wu and C. K. Wong"
+, title =       "On some distance problems in fixed orientations"
+, journal =     "SIAM J. Comput."
+, volume =      16
+, year =        1987
+, pages =       "728--746"
+, succeeds =    "www-dpcgf-85"
+, annote =      "VD for metric where paths are limited to a fixed
+                 number of orientations"
 }
 
 @inproceedings{wgpb-cadpf-96
-, author =	"J. Wiegley and K. Goldberg and M. Peshkin and M. Brokowski"
-, title =	"A complete algorithm for designing passive fences to orient parts"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, site =	"Minneapolis, MN"
-, year =	1996
-, pages =	"1133--1139"
-, update =	"98.07 bibrelex"
+, author =      "J. Wiegley and K. Goldberg and M. Peshkin and M. Brokowski"
+, title =       "A complete algorithm for designing passive fences to orient parts"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, site =        "Minneapolis, MN"
+, year =        1996
+, pages =       "1133--1139"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{wrg-csdsp-92
-, author =	"J. Wiegley and A. Rao and K. Goldberg"
-, title =	"Computing a statistical distribution of stable poses for a polyhedron"
-, booktitle =	"Proc. 30th Allerton Conf. Commun. Control Comput."
-, site =	"Urbana-Champaign, IL"
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "J. Wiegley and A. Rao and K. Goldberg"
+, title =       "Computing a statistical distribution of stable poses for a polyhedron"
+, booktitle =   "Proc. 30th Allerton Conf. Commun. Control Comput."
+, site =        "Urbana-Champaign, IL"
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @book{w-fpg-64
-, author =	"Wielandt"
-, title =	"Finite Permutation Groups"
-, publisher =	"Academic Press"
-, year =	1964
-, update =	"97.11 bibrelex"
+, author =      "Wielandt"
+, title =       "Finite Permutation Groups"
+, publisher =   "Academic Press"
+, year =        1964
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{w-mcrgt-90
-, author =	"C. Wieners-Lummer"
-, title =	"Manhattan channel routing with good theoretical and practical performance"
-, booktitle =	"Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1990
-, pages =	"465--474"
+, author =      "C. Wieners-Lummer"
+, title =       "Manhattan channel routing with good theoretical and practical performance"
+, booktitle =   "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1990
+, pages =       "465--474"
 }
 
 @inproceedings{ws-prnds-86
-, author =	"A. Wiernik and Micha Sharir"
-, title =	"Planar realization of nonlinear {Davenport}-{Schinzel} sequences by segments"
-, booktitle =	"Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1986
-, pages =	"97--106"
-, precedes =	"ws-prnds-88"
-, update =	"98.03 mitchell"
+, author =      "A. Wiernik and Micha Sharir"
+, title =       "Planar realization of nonlinear {Davenport}-{Schinzel} sequences by segments"
+, booktitle =   "Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1986
+, pages =       "97--106"
+, precedes =    "ws-prnds-88"
+, update =      "98.03 mitchell"
 }
 
 @article{ws-prnds-88
-, author =	"A. Wiernik and Micha Sharir"
-, title =	"Planar Realizations of Nonlinear {Davenport}-{Schinzel} Sequences by Segments"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"15--47"
-, keywords =	"Davenport-Schinzel sequences, line segments, lower bounds"
-, succeeds =	"ws-prnds-86"
-, update =	"98.03 mitchell, 93.09 milone+mitchell"
+, author =      "A. Wiernik and Micha Sharir"
+, title =       "Planar Realizations of Nonlinear {Davenport}-{Schinzel} Sequences by Segments"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "15--47"
+, keywords =    "Davenport-Schinzel sequences, line segments, lower bounds"
+, succeeds =    "ws-prnds-86"
+, update =      "98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @article{wl-avpss-84
-, author =	"H. A. G. Wijshoff and J. van Leeuwen"
-, title =	"Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino"
-, journal =	"Inform. Control"
-, volume =	62
-, year =	1984
-, pages =	"1--25"
-, update =	"97.11 bibrelex"
+, author =      "H. A. G. Wijshoff and J. van Leeuwen"
+, title =       "Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino"
+, journal =     "Inform. Control"
+, volume =      62
+, year =        1984
+, pages =       "1--25"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{wl-pvatp-82
-, author =	"H. A. G. Wijshoff and J. van Leeuwen"
-, title =	"Periodic versus arbitrary Tessellations of the plane using polyominos of a single type"
-, type =	"Report"
-, number =	"RUU-CS-82-11"
-, institution =	"Dept. Comput. Sci., Utrecht Univ."
-, address =	"Utrecht, Netherlands"
-, year =	1982
-, update =	"94.05 schwarzkopf"
+, author =      "H. A. G. Wijshoff and J. van Leeuwen"
+, title =       "Periodic versus arbitrary Tessellations of the plane using polyominos of a single type"
+, type =        "Report"
+, number =      "RUU-CS-82-11"
+, institution = "Dept. Comput. Sci., Utrecht Univ."
+, address =     "Utrecht, Netherlands"
+, year =        1982
+, update =      "94.05 schwarzkopf"
 }
 
 @inproceedings{w-mpav-88
-, author =	"G. Wilfong"
-, title =	"Motion Planning for an Autonomous Vehicle"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1988
-, pages =	"529--533"
+, author =      "G. Wilfong"
+, title =       "Motion Planning for an Autonomous Vehicle"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1988
+, pages =       "529--533"
 }
 
 @inproceedings{w-mppmo-88
-, author =	"G. Wilfong"
-, title =	"Motion planning in the presence of movable obstacles"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"279--288"
-, cites =	"a-usppe-87, afw-msm-87, c-namrm-87, fw-pcm-88, fwy-cmtra-86, gj-cigtn-79, hss-cmpmi-84, kz-tetpp-86, ks-eapcf-85, k-osps-83, lw-apcfp-79, ls-ppspm-87, o-mpic-87, oy-rmpmd-85, rs-mppmo-85, st-pplup-86, ss-pmp2g-83, s-a-83, y-amp-87, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "G. Wilfong"
+, title =       "Motion planning in the presence of movable obstacles"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "279--288"
+, cites =       "a-usppe-87, afw-msm-87, c-namrm-87, fw-pcm-88, fwy-cmtra-86, gj-cigtn-79, hss-cmpmi-84, kz-tetpp-86, ks-eapcf-85, k-osps-83, lw-apcfp-79, ls-ppspm-87, o-mpic-87, oy-rmpmd-85, rs-mppmo-85, st-pplup-86, ss-pmp2g-83, s-a-83, y-amp-87, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{w-mppmo-91
-, author =	"G. Wilfong"
-, title =	"Motion planning in the presence of movable obstacles"
-, journal =	"Ann. Math. Artif. Intell."
-, volume =	3
-, year =	1991
-, pages =	"131--150"
-, update =	"96.09 orourke"
+, author =      "G. Wilfong"
+, title =       "Motion planning in the presence of movable obstacles"
+, journal =     "Ann. Math. Artif. Intell."
+, volume =      3
+, year =        1991
+, pages =       "131--150"
+, update =      "96.09 orourke"
 }
 
 @inproceedings{w-nnp-91
-, author =	"G. Wilfong"
-, title =	"Nearest neighbor problems"
-, booktitle =	"Proc. 7th Annu. ACM Sympos. Comput. Geom."
-, year =	1991
-, pages =	"224--233"
-, keywords =	"proximity"
-, precedes =	"w-nnp-92"
-, cites =	"ce-iacko-85, c-papop-85, de-eaahc-84, ds-cgug-87, e-acg-87, h-cnnr-68, hd-kgde-60, mih-ccmcp-81, rwli-asnnd-75, ZZZ"
-, update =	"97.11 bibrelex, 96.09 devillers"
+, author =      "G. Wilfong"
+, title =       "Nearest neighbor problems"
+, booktitle =   "Proc. 7th Annu. ACM Sympos. Comput. Geom."
+, year =        1991
+, pages =       "224--233"
+, keywords =    "proximity"
+, precedes =    "w-nnp-92"
+, cites =       "ce-iacko-85, c-papop-85, de-eaahc-84, ds-cgug-87, e-acg-87, h-cnnr-68, hd-kgde-60, mih-ccmcp-81, rwli-asnnd-75, ZZZ"
+, update =      "97.11 bibrelex, 96.09 devillers"
 }
 
 @article{w-nnp-92
-, author =	"G. Wilfong"
-, title =	"Nearest neighbor problems"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, year =	1992
-, pages =	"283--416"
-, keywords =	"pattern recognition, NP complete"
-, succeeds =	"w-nnp-91"
-, update =	"96.09 devillers"
+, author =      "G. Wilfong"
+, title =       "Nearest neighbor problems"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, year =        1992
+, pages =       "283--416"
+, keywords =    "pattern recognition, NP complete"
+, succeeds =    "w-nnp-91"
+, update =      "96.09 devillers"
 }
 
 @inproceedings{w-olacp-97
-, author =	"G. Wilfong"
-, title =	"On-line Algorithms for Compressing Planar Curves"
-, booktitle =	"Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
-, month =	jan
-, year =	1997
-, pages =	"158--167"
-, update =	"97.03 held"
+, author =      "G. Wilfong"
+, title =       "On-line Algorithms for Compressing Planar Curves"
+, booktitle =   "Proc. 8th ACM-SIAM Sympos. Discrete Algorithms"
+, month =       jan
+, year =        1997
+, pages =       "158--167"
+, update =      "97.03 held"
 }
 
 @inproceedings{w-raamp-87
-, author =	"G. Wilfong"
-, title =	"Recent advances in algorithmic motion planning"
-, booktitle =	"Proc. 1st Internat. Conf. Indust. Applied Math."
-, site =	"Paris, France"
-, year =	1987
-, pages =	"99--110"
+, author =      "G. Wilfong"
+, title =       "Recent advances in algorithmic motion planning"
+, booktitle =   "Proc. 1st Internat. Conf. Indust. Applied Math."
+, site =        "Paris, France"
+, year =        1987
+, pages =       "99--110"
 }
 
 @techreport{w-spav-88
-, author =	"G. Wilfong"
-, title =	"Shortest Paths for Autonomous Vehicles"
-, type =	"Technical {Report}"
-, institution =	"AT\& T Bell Labs"
-, year =	1988
-, precedes =	"w-spav-89"
-, update =	"96.01 devillers"
+, author =      "G. Wilfong"
+, title =       "Shortest Paths for Autonomous Vehicles"
+, type =        "Technical {Report}"
+, institution = "AT\& T Bell Labs"
+, year =        1988
+, precedes =    "w-spav-89"
+, update =      "96.01 devillers"
 }
 
 @inproceedings{w-spav-89
-, author =	"G. Wilfong"
-, title =	"Shortest Paths for Autonomous Vehicles"
-, booktitle =	"Proc. 6th IEEE Internat. Conf. Robot. Autom."
-, year =	1989
-, pages =	"15--20"
-, succeeds =	"w-spav-88"
-, update =	"96.01 devillers"
+, author =      "G. Wilfong"
+, title =       "Shortest Paths for Autonomous Vehicles"
+, booktitle =   "Proc. 6th IEEE Internat. Conf. Robot. Autom."
+, year =        1989
+, pages =       "15--20"
+, succeeds =    "w-spav-88"
+, update =      "96.01 devillers"
 }
 
 @techreport{w-tlmcs-93
-, author =	"G. Wilfong"
-, title =	"Two-label minimum consistent subsets"
-, type =	"Technical {Report}"
-, institution =	"AT\& T Bell Labs"
-, year =	1993
-, update =	"93.09 milone+mitchell"
+, author =      "G. Wilfong"
+, title =       "Two-label minimum consistent subsets"
+, type =        "Technical {Report}"
+, institution = "AT\& T Bell Labs"
+, year =        1993
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{w-cpadv-90
-, author =	"J. Wilhelms"
-, title =	"A Coherent Projection Appoach for Direct Volume Rendering"
-, type =	"Technical Report"
-, number =	"UCSC-CRL-90-38"
-, institution =	"Computer Research Laboratory, University of California"
-, address =	"Santa Cruz"
-, month =	aug
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "J. Wilhelms"
+, title =       "A Coherent Projection Appoach for Direct Volume Rendering"
+, type =        "Technical Report"
+, number =      "UCSC-CRL-90-38"
+, institution = "Computer Research Laboratory, University of California"
+, address =     "Santa Cruz"
+, month =       aug
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @article{wv-ofig-92
-, author =	"J. Wilhelms and A. {Van Gelder}"
-, title =	"Octrees for faster isosurface generation"
-, journal =	"ACM Trans. Graph."
-, volume =	11
-, year =	1992
-, pages =	"201--227"
-, update =	"98.07 bibrelex"
+, author =      "J. Wilhelms and A. {Van Gelder}"
+, title =       "Octrees for faster isosurface generation"
+, journal =     "ACM Trans. Graph."
+, volume =      11
+, year =        1992
+, pages =       "201--227"
+, update =      "98.07 bibrelex"
 }
 
 @book{w-reap-63
-, author =	"J. Wilkinson"
-, title =	"Rounding Errors in Algebraic Processes"
-, publisher =	"Prentice Hall"
-, address =	"Englewood Cliffs, NJ"
-, year =	1963
-, update =	"98.03 bibrelex"
+, author =      "J. Wilkinson"
+, title =       "Rounding Errors in Algebraic Processes"
+, publisher =   "Prentice Hall"
+, address =     "Englewood Cliffs, NJ"
+, year =        1963
+, update =      "98.03 bibrelex"
 }
 
 @book{w-aep-65
-, author =	"J. H. Wilkinson"
-, title =	"The Algebraic Eigenvalue Problem"
-, publisher =	"Clarendon Press"
-, address =	"Oxford, UK"
-, year =	1965
-, update =	"98.03 bibrelex"
+, author =      "J. H. Wilkinson"
+, title =       "The Algebraic Eigenvalue Problem"
+, publisher =   "Clarendon Press"
+, address =     "Oxford, UK"
+, year =        1965
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{w-fecaw-98
-, author =	"Hans-Martin Will"
-, title =	"Fast and Efficient Computation of Additively Weighted {Voronoi} Cells for Applications in Molecular Biology"
-, booktitle =	"Proc. 6th Scand. Workshop Algorithm Theory"
-, nickname =	"SWAT '98"
-, site =	"Stockholm"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1432
-, publisher =	"Springer-Verlag"
-, year =	1998
-, pages =	"310--321"
-, update =	"99.03 bibrelex, 98.07 mitchell"
+, author =      "Hans-Martin Will"
+, title =       "Fast and Efficient Computation of Additively Weighted {Voronoi} Cells for Applications in Molecular Biology"
+, booktitle =   "Proc. 6th Scand. Workshop Algorithm Theory"
+, nickname =    "SWAT '98"
+, site =        "Stockholm"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1432
+, publisher =   "Springer-Verlag"
+, year =        1998
+, pages =       "310--321"
+, update =      "99.03 bibrelex, 98.07 mitchell"
 }
 
 @article{w-lbaso-89
-, author =	"D. Willard"
-, title =	"Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems"
-, journal =	"Inform. Comput."
-, volume =	82
-, year =	1989
-, pages =	"45--64"
-, update =	"97.07 agarwal"
+, author =      "D. Willard"
+, title =       "Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems"
+, journal =     "Inform. Comput."
+, volume =      82
+, year =        1989
+, pages =       "45--64"
+, update =      "97.07 agarwal"
 }
 
 @inproceedings{w-ntcor-82
-, author =	"D. E. Willard"
-, title =	"A new time complexity for orthogonal range queries"
-, booktitle =	"Proc. 20th Allerton Conf. Commun. Control Comput."
-, year =	1982
-, pages =	"462--471"
+, author =      "D. E. Willard"
+, title =       "A new time complexity for orthogonal range queries"
+, booktitle =   "Proc. 20th Allerton Conf. Commun. Control Comput."
+, year =        1982
+, pages =       "462--471"
 }
 
 @techreport{w-aprt-83
-, author =	"D. E. Willard"
-, title =	"Abstract predicate retrieval theory"
-, type =	"Report"
-, number =	"83-3"
-, institution =	"Dept. Comput. Sci., State Univ. New York Albany"
-, address =	"Albany, NY"
-, year =	1983
+, author =      "D. E. Willard"
+, title =       "Abstract predicate retrieval theory"
+, type =        "Report"
+, number =      "83-3"
+, institution = "Dept. Comput. Sci., State Univ. New York Albany"
+, address =     "Albany, NY"
+, year =        1983
 }
 
 @techreport{w-isbt-79
-, author =	"D. E. Willard"
-, title =	"An introduction to super-$b$-trees"
-, type =	"Report"
-, number =	"79-01"
-, institution =	"Dept. Comput. Sci., Univ. Iowa"
-, address =	"Iowa City, IA"
-, year =	1979
-, update =	"97.11 bibrelex"
+, author =      "D. E. Willard"
+, title =       "An introduction to super-$b$-trees"
+, type =        "Report"
+, number =      "79-01"
+, institution = "Dept. Comput. Sci., Univ. Iowa"
+, address =     "Iowa City, IA"
+, year =        1979
+, update =      "97.11 bibrelex"
 }
 
 @article{w-arqtr-96
-, author =	"D. E. Willard"
-, title =	"Applications of range query theory to relational data base join and selection operations"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	52
-, year =	1996
-, pages =	"157--169"
-, update =	"96.05 agarwal"
+, author =      "D. E. Willard"
+, title =       "Applications of range query theory to relational data base join and selection operations"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      52
+, year =        1996
+, pages =       "157--169"
+, update =      "96.05 agarwal"
 }
 
 @inproceedings{w-aftmc-92
-, author =	"D. E. Willard"
-, title =	"Applications of the fusion tree method to computational geometry and searching"
-, booktitle =	"Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1992
-, pages =	"286--295"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "D. E. Willard"
+, title =       "Applications of the fusion tree method to computational geometry and searching"
+, booktitle =   "Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1992
+, pages =       "286--295"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @techreport{w-ataba-86
-, author =	"D. E. Willard"
-, title =	"Applied and theoretical algorithms based on the application of sheared retrieval to orthogonal range queries"
-, institution =	"SUNY Albany"
-, year =	1986
-, update =	"97.11 bibrelex"
+, author =      "D. E. Willard"
+, title =       "Applied and theoretical algorithms based on the application of sheared retrieval to orthogonal range queries"
+, institution = "SUNY Albany"
+, year =        1986
+, update =      "97.11 bibrelex"
 }
 
 @techreport{w-bfkdt-78
-, author =	"D. E. Willard"
-, title =	"Balanced forests of $k$-d* trees as a dynamic data structure"
-, type =	"Report"
-, number =	"TR-23-78"
-, institution =	"Aiken Comput. Lab., Harvard Univ."
-, address =	"Cambridge, MA"
-, year =	1978
+, author =      "D. E. Willard"
+, title =       "Balanced forests of $k$-d* trees as a dynamic data structure"
+, type =        "Report"
+, number =      "TR-23-78"
+, institution = "Aiken Comput. Lab., Harvard Univ."
+, address =     "Cambridge, MA"
+, year =        1978
 }
 
 @inproceedings{w-eprce-84
-, author =	"D. E. Willard"
-, title =	"Efficient processing of relational calculus expressions using range query theory"
-, booktitle =	"Proceedings of ACM SIGMOD Conference"
-, year =	1984
-, pages =	"160--172"
-, update =	"97.11 bibrelex"
+, author =      "D. E. Willard"
+, title =       "Efficient processing of relational calculus expressions using range query theory"
+, booktitle =   "Proceedings of ACM SIGMOD Conference"
+, year =        1984
+, pages =       "160--172"
+, update =      "97.11 bibrelex"
 }
 
 @article{w-ecgve-00
-, author =	"D. E. Willard"
-, title =	"Examining computational geometry, {Van Emde Boas} trees, and hashing from the perspective of the fusion tree"
-, journal =	"SIAM J. Comput."
-, volume =	29
-, year =	2000
-, pages =	"1030--1049"
-, update =	"00.11 smid, 00.07 smid"
+, author =      "D. E. Willard"
+, title =       "Examining computational geometry, {Van Emde Boas} trees, and hashing from the perspective of the fusion tree"
+, journal =     "SIAM J. Comput."
+, volume =      29
+, year =        2000
+, pages =       "1030--1049"
+, update =      "00.11 smid, 00.07 smid"
 }
 
 @techreport{w-kdtde-80
-, author =	"D. E. Willard"
-, title =	"{$K$}-d trees in a dynamic environment"
-, type =	"Report"
-, number =	"80-01"
-, institution =	"Dept. Comput. Sci., Univ. Iowa"
-, address =	"Iowa City, IA"
-, year =	1980
+, author =      "D. E. Willard"
+, title =       "{$K$}-d trees in a dynamic environment"
+, type =        "Report"
+, number =      "80-01"
+, institution = "Dept. Comput. Sci., Univ. Iowa"
+, address =     "Iowa City, IA"
+, year =        1980
 }
 
 @article{w-llwcr-83
-, author =	"D. E. Willard"
-, title =	"Log-logarithmic worst case range queries are possible in space {$O(n)$}"
-, journal =	"Inform. Process. Lett."
-, volume =	17
-, year =	1983
-, pages =	"81--89"
+, author =      "D. E. Willard"
+, title =       "Log-logarithmic worst case range queries are possible in space {$O(n)$}"
+, journal =     "Inform. Process. Lett."
+, volume =      17
+, year =        1983
+, pages =       "81--89"
 }
 
 @inproceedings{w-lbdrq-86
-, author =	"D. E. Willard"
-, title =	"Lower bounds for dynamic range query problems that permit subtraction"
-, booktitle =	"Proc. 13th Internat. Coll. on Autom., Langu. and Program."
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "D. E. Willard"
+, title =       "Lower bounds for dynamic range query problems that permit subtraction"
+, booktitle =   "Proc. 13th Internat. Coll. on Autom., Langu. and Program."
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @techreport{w-lasoo-85
-, author =	"D. E. Willard"
-, title =	"Lower bounds for the addition-subtraction operations in orthogonal range queries"
-, institution =	"SUNY Albany"
-, year =	1985
-, update =	"97.11 bibrelex"
+, author =      "D. E. Willard"
+, title =       "Lower bounds for the addition-subtraction operations in orthogonal range queries"
+, institution = "SUNY Albany"
+, year =        1985
+, update =      "97.11 bibrelex"
 }
 
 @article{w-mstpt-87
-, author =	"D. E. Willard"
-, title =	"Multidimensional Search Trees That Provide New Type of Memory Reductions"
-, journal =	"J. AMC"
-, volume =	34
-, number =	4
-, year =	1987
-, pages =	"846--858"
-, update =	"98.11 bibrelex"
+, author =      "D. E. Willard"
+, title =       "Multidimensional Search Trees That Provide New Type of Memory Reductions"
+, journal =     "J. AMC"
+, volume =      34
+, number =      4
+, year =        1987
+, pages =       "846--858"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{w-ndsor-78
-, author =	"D. E. Willard"
-, title =	"New Data Structures for Orthogonal Range Queries"
-, type =	"Technical {Report}"
-, institution =	"Havard Univ."
-, year =	1978
-, update =	"97.11 bibrelex"
+, author =      "D. E. Willard"
+, title =       "New Data Structures for Orthogonal Range Queries"
+, type =        "Technical {Report}"
+, institution = "Havard Univ."
+, year =        1978
+, update =      "97.11 bibrelex"
 }
 
 @article{w-ndsor-85
-, author =	"D. E. Willard"
-, title =	"New data structures for orthogonal range queries"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"232--253"
+, author =      "D. E. Willard"
+, title =       "New data structures for orthogonal range queries"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "232--253"
 }
 
 @article{w-ntdsw-84
-, author =	"D. E. Willard"
-, title =	"New trie data structures which support very fast search operations"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	28
-, year =	1984
-, pages =	"379--394"
+, author =      "D. E. Willard"
+, title =       "New trie data structures which support very fast search operations"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      28
+, year =        1984
+, pages =       "379--394"
 }
 
 @inproceedings{w-asror-86
-, author =	"D. E. Willard"
-, title =	"On the application of sheared retrieval to orthogonal range queries"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"80--89"
-, cites =	"amm-cpmr-81, b-mbstu-75, b-mdc-80, bm-ewcds-80, bs-pmsad-77, bs-dsp1s-80, bw-owcar-80, c-fsnaq-83, c-sdssf-85, c-fadsi-85, cg-fc-85, ce-lsdst-86, e-ndrs-81, eo-esrp-82, fks-sstwc-82, f-icdds-80, f-lbcor-81, f-lbcor-81, fmn-dgds-85, gbt-srtgp-84, j-pqiqo-82, k-aru-84, kmr-nnpbd-85, lp-cgs-84, lw-wcarp-77, lw-qtfsm-80, lw-dsdrq-82, m-dsa-84, ms-idsfs-80, nhs-gfasm-84, o-rsg-85t, ol-tgmdd-81, ps-cgi-85, v-sttor-85, e-pofll-77, ekz-diepq-77, w-ndsor-78, w-ndsor-85, w-llwcr-83, wl-arrcd-85, w-sadbr-84, w-rmsmd-85, w-lasoo-85, w-ataba-86, y-sttoa-82, y-cmps-85, ZZZ"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "D. E. Willard"
+, title =       "On the application of sheared retrieval to orthogonal range queries"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "80--89"
+, cites =       "amm-cpmr-81, b-mbstu-75, b-mdc-80, bm-ewcds-80, bs-pmsad-77, bs-dsp1s-80, bw-owcar-80, c-fsnaq-83, c-sdssf-85, c-fadsi-85, cg-fc-85, ce-lsdst-86, e-ndrs-81, eo-esrp-82, fks-sstwc-82, f-icdds-80, f-lbcor-81, f-lbcor-81, fmn-dgds-85, gbt-srtgp-84, j-pqiqo-82, k-aru-84, kmr-nnpbd-85, lp-cgs-84, lw-wcarp-77, lw-qtfsm-80, lw-dsdrq-82, m-dsa-84, ms-idsfs-80, nhs-gfasm-84, o-rsg-85t, ol-tgmdd-81, ps-cgi-85, v-sttor-85, e-pofll-77, ekz-diepq-77, w-ndsor-78, w-ndsor-85, w-llwcr-83, wl-arrcd-85, w-sadbr-84, w-rmsmd-85, w-lasoo-85, w-ataba-86, y-sttoa-82, y-cmps-85, ZZZ"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{w-oscrd-91
-, author =	"D. E. Willard"
-, title =	"Optimal sample cost residues for differential database batch query problems"
-, journal =	"J. ACM"
-, volume =	38
-, year =	1991
-, pages =	"104--119"
+, author =      "D. E. Willard"
+, title =       "Optimal sample cost residues for differential database batch query problems"
+, journal =     "J. ACM"
+, volume =      38
+, year =        1991
+, pages =       "104--119"
 }
 
 @article{w-pr-82
-, author =	"D. E. Willard"
-, title =	"Polygon retrieval"
-, journal =	"SIAM J. Comput."
-, volume =	11
-, year =	1982
-, pages =	"149--165"
+, author =      "D. E. Willard"
+, title =       "Polygon retrieval"
+, journal =     "SIAM J. Comput."
+, volume =      11
+, year =        1982
+, pages =       "149--165"
 }
 
 @phdthesis{w-podsa-78
-, author =	"D. E. Willard"
-, title =	"Predicate-oriented database search algorithms"
-, type =	"Ph.{D}. Thesis"
-, school =	"Aiken Comput. Lab., Harvard Univ."
-, address =	"Cambridge, MA"
-, year =	1978
-, note =	"Report TR-20-78"
-, keywords =	"doctoral thesis"
-, update =	"93.05 jones"
+, author =      "D. E. Willard"
+, title =       "Predicate-oriented database search algorithms"
+, type =        "Ph.{D}. Thesis"
+, school =      "Aiken Comput. Lab., Harvard Univ."
+, address =     "Cambridge, MA"
+, year =        1978
+, note =        "Report TR-20-78"
+, keywords =    "doctoral thesis"
+, update =      "93.05 jones"
 }
 
 @inproceedings{w-rmsmd-85
-, author =	"D. E. Willard"
-, title =	"Reduced memory space for multi-dimensional search trees"
-, booktitle =	"Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
-, year =	1985
-, pages =	"363--374"
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "D. E. Willard"
+, title =       "Reduced memory space for multi-dimensional search trees"
+, booktitle =   "Proc. 2nd Sympos. Theoret. Aspects Comput. Sci."
+, year =        1985
+, pages =       "363--374"
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @inproceedings{w-sadbr-84
-, author =	"D. E. Willard"
-, title =	"Sampling algorithms for differentiable batch retrieval problems"
-, booktitle =	"Proceedings of ICALP"
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "D. E. Willard"
+, title =       "Sampling algorithms for differentiable batch retrieval problems"
+, booktitle =   "Proceedings of ICALP"
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{w-sungf-85
-, author =	"D. E. Willard"
-, title =	"Searching unindexed and nonuniformly generated files in {$\log\log N$} time"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"1013--1029"
+, author =      "D. E. Willard"
+, title =       "Searching unindexed and nonuniformly generated files in {$\log\log N$} time"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "1013--1029"
 }
 
 @techreport{w-sbta-79
-, author =	"D. E. Willard"
-, title =	"The super-$b$-tree algorithm"
-, type =	"Report"
-, number =	"TR-03-79"
-, institution =	"Aiken Comput. Lab., Harvard Univ."
-, address =	"Cambridge, MA"
-, year =	1979
+, author =      "D. E. Willard"
+, title =       "The super-$b$-tree algorithm"
+, type =        "Report"
+, number =      "TR-03-79"
+, institution = "Aiken Comput. Lab., Harvard Univ."
+, address =     "Cambridge, MA"
+, year =        1979
 }
 
 @article{wl-arrcd-85
-, author =	"D. E. Willard and G. S. Lueker"
-, title =	"Adding range restriction capability to dynamic data structures"
-, journal =	"J. ACM"
-, volume =	32
-, year =	1985
-, pages =	"597--617"
+, author =      "D. E. Willard and G. S. Lueker"
+, title =       "Adding range restriction capability to dynamic data structures"
+, journal =     "J. ACM"
+, volume =      32
+, year =        1985
+, pages =       "597--617"
 }
 
 @inproceedings{ww-qvrqi-88
-, author =	"D. E. Willard and Y. C. Wee"
-, title =	"Quasi-valid range querying and its implications for nearest neighbor problems"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"34--43"
-, cites =	"cg-opapp-88, acg-dctdp-87, acg-cdctd-87, ag-epssg-86, aks-osn-83, b-mbstu-75, b-mdc-80, bm-ewcds-80, bs-pmsad-77, bs-dsp1s-80, c-sdssf-85, c-fsnaq-86, c-lbcms-86, c-prsig-87, c-pms-86, dk-ppess-87, e-acg-87, eo-bdsds-85, ew-hrsls-86, f-icdds-80, f-lbcor-81, f-sbmrq-81, hw-ensrq-87, kmr-nnpbd-85, lp-cgs-84, lw-wcarp-77, lw-dsdrq-82, m-mdscg-84, ol-tgmdd-81, o-ddds-83, ps-cgi-85, v-sttor-85, v-oaann-86, w-pr-82, w-ndsor-85, w-asror-86, w-rmsmd-85, wl-arrcd-85, y-cmps-85, yy-gaddg-85, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "D. E. Willard and Y. C. Wee"
+, title =       "Quasi-valid range querying and its implications for nearest neighbor problems"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "34--43"
+, cites =       "cg-opapp-88, acg-dctdp-87, acg-cdctd-87, ag-epssg-86, aks-osn-83, b-mbstu-75, b-mdc-80, bm-ewcds-80, bs-pmsad-77, bs-dsp1s-80, c-sdssf-85, c-fsnaq-86, c-lbcms-86, c-prsig-87, c-pms-86, dk-ppess-87, e-acg-87, eo-bdsds-85, ew-hrsls-86, f-icdds-80, f-lbcor-81, f-sbmrq-81, hw-ensrq-87, kmr-nnpbd-85, lp-cgs-84, lw-wcarp-77, lw-dsdrq-82, m-mdscg-84, ol-tgmdd-81, o-ddds-83, ps-cgi-85, v-sttor-85, v-oaann-86, w-pr-82, w-ndsor-85, w-asror-86, w-rmsmd-85, wl-arrcd-85, y-cmps-85, yy-gaddg-85, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{w-sppdt-95
-, author =	"P. Willet"
-, title =	"Searching for pharmacophoric patterns in databases of three-dimensional chemical structures"
-, journal =	"J. Molecular Recognition"
-, volume =	8
-, year =	1995
-, pages =	"290--303"
-, update =	"98.07 bibrelex"
+, author =      "P. Willet"
+, title =       "Searching for pharmacophoric patterns in databases of three-dimensional chemical structures"
+, journal =     "J. Molecular Recognition"
+, volume =      8
+, year =        1995
+, pages =       "290--303"
+, update =      "98.07 bibrelex"
 }
 
 @article{w-cmc-80
-, author =	"M. H. Williams"
-, title =	"Cubic map configurations"
-, journal =	"Inform. Process. Lett."
-, volume =	11
-, year =	1980
-, pages =	"189--185"
+, author =      "M. H. Williams"
+, title =       "Cubic map configurations"
+, journal =     "Inform. Process. Lett."
+, volume =      11
+, year =        1980
+, pages =       "189--185"
 }
 
 @techreport{w-idpvr-90
-, author =	"P. Williams"
-, title =	"Issues in Interactive Direct Projection Volume Rendering of Nonrectilinear Meshed Data Sets"
-, type =	"Work in Progress Report"
-, number =	1059
-, institution =	"Center for Supercomputing Research and Development, University of Illinois"
-, address =	"Urbana-Champaign"
-, month =	dec
-, year =	1990
-, update =	"98.07 bibrelex"
+, author =      "P. Williams"
+, title =       "Issues in Interactive Direct Projection Volume Rendering of Nonrectilinear Meshed Data Sets"
+, type =        "Work in Progress Report"
+, number =      1059
+, institution = "Center for Supercomputing Research and Development, University of Illinois"
+, address =     "Urbana-Champaign"
+, month =       dec
+, year =        1990
+, update =      "98.07 bibrelex"
 }
 
 @techreport{ws-vomp-91
-, author =	"P. Williams and P. Shirley"
-, title =	"Visibility Ordering Meshed Polyhedra"
-, type =	"Report"
-, number =	1097
-, institution =	"Center for Supercomputing Research and Development, Universityof Illinois"
-, address =	"Urbana-Champaign"
-, month =	apr
-, year =	1991
-, precedes =	"w-vomp-92"
-, update =	"98.11 bibrelex, 98.07 bibrelex"
+, author =      "P. Williams and P. Shirley"
+, title =       "Visibility Ordering Meshed Polyhedra"
+, type =        "Report"
+, number =      1097
+, institution = "Center for Supercomputing Research and Development, Universityof Illinois"
+, address =     "Urbana-Champaign"
+, month =       apr
+, year =        1991
+, precedes =    "w-vomp-92"
+, update =      "98.11 bibrelex, 98.07 bibrelex"
 }
 
 @inproceedings{w-acgvv-91
-, author =	"P. L. Williams"
-, title =	"Applications of computational geometry to volume visualization"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"247--251"
-, cites =	"e-atccd-90, e-acg-87, fkn-vsgpt-80, mhc-avcev-90, st-padsc-90, w-cpadv-90, ws-vomp-91, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "P. L. Williams"
+, title =       "Applications of computational geometry to volume visualization"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "247--251"
+, cites =       "e-atccd-90, e-acg-87, fkn-vsgpt-80, mhc-avcev-90, st-padsc-90, w-cpadv-90, ws-vomp-91, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{w-vomp-92
-, author =	"P. L. Williams"
-, title =	"Visibility ordering meshed polyhedra"
-, journal =	"ACM Transaction on Graphics"
-, volume =	11
-, number =	2
-, month =	apr
-, year =	1992
-, pages =	"103--125"
-, succeeds =	"ws-vomp-91"
-, update =	"98.11 bibrelex"
+, author =      "P. L. Williams"
+, title =       "Visibility ordering meshed polyhedra"
+, journal =     "ACM Transaction on Graphics"
+, volume =      11
+, number =      2
+, month =       apr
+, year =        1992
+, pages =       "103--125"
+, succeeds =    "ws-vomp-91"
+, update =      "98.11 bibrelex"
 }
 
 @article{wg-ceaal-96
-, author =	"David P. Williamson and Michel X. Goemans"
-, title =	"Computational Experience with an Approximation Algorithm on Large-Scale {Euclidean} Matching Instances"
-, journal =	"INFORMS J. Comput."
-, volume =	8
-, number =	1
-, year =	1996
-, pages =	"29--40"
-, keywords =	"matching, experimental analysis"
-, update =	"98.03 mitchell"
+, author =      "David P. Williamson and Michel X. Goemans"
+, title =       "Computational Experience with an Approximation Algorithm on Large-Scale {Euclidean} Matching Instances"
+, journal =     "INFORMS J. Comput."
+, volume =      8
+, number =      1
+, year =        1996
+, pages =       "29--40"
+, keywords =    "matching, experimental analysis"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{w-nivvl-97
-, author =	"Graham J. Wills"
-, title =	"{NicheWorks} - Interactive Visualization of Very Large Graphs"
-, editor =	"G. {Di Battista}"
-, booktitle =	"Graph Drawing (Proc. GD '97)"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1353
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"403--414"
-, keywords =	"graph drawing"
-, update =	"99.07 patrignani, 98.07 patrignani"
+, author =      "Graham J. Wills"
+, title =       "{NicheWorks} - Interactive Visualization of Very Large Graphs"
+, editor =      "G. {Di Battista}"
+, booktitle =   "Graph Drawing (Proc. GD '97)"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1353
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "403--414"
+, keywords =    "graph drawing"
+, update =      "99.07 patrignani, 98.07 patrignani"
 }
 
 @article{w-ptp-86
-, author =	"J. M. Wills"
-, title =	"On polyhedra with transitivity properties"
-, journal =	"Discrete Comput. Geom."
-, volume =	1
-, year =	1986
-, pages =	"195--199"
+, author =      "J. M. Wills"
+, title =       "On polyhedra with transitivity properties"
+, journal =     "Discrete Comput. Geom."
+, volume =      1
+, year =        1986
+, pages =       "195--199"
 }
 
 @article{wgs-ltino-90
-, author =	"F. Wesley Wilson and R. Kent Goodrich and Wendy Spratte"
-, title =	"Lawson's Triangulation Is Nearly Optimal For Controlling Error Bounds"
-, journal =	"SIAM J. Numer. Anal."
-, volume =	27
-, number =	1
-, month =	feb
-, year =	1990
-, pages =	"190--197"
-, keywords =	"Lawson's triangulation, error bounds"
-, annote =	"If a triangle has side lengths $a \le b \le c$ then
-		 condition number $C$ is
-		 $1+\sqrt{(1-\lambda^2})/\lambda$, where
-		 $\lambda=(4\mbox{Area})/(b^2+c^2)$. One wants $C$ to be
-		 small. Another error bound looks like
-		 $kc^n_S/\sin\alpha_S$, where $\alpha_S$ is the smallest
-		 angle, $c_S$ is the longest side, and $n$ a positive
-		 integer. Also gives another error bound which is really
-		 hairy."
-, abstract =	"One way of evaluating a triangulation method is to
-		 study how well it controls error bounds and stability
-		 in computations. Lawson's method, which maximizes the
-		 smallest angle over all triangulations, controls error
-		 bounds for linear interpolates as well as for certain
-		 derivative estimates. In particular, no other
-		 triangulation improves these bounds by more than a
-		 factor of 2. Although Lawson's triangulation method
-		 does not minimize the largest edge over all
-		 triangulations, it nearly does; this edge is no longer
-		 than 2/ root 3 times the longest edge in any other
-		 triangulation. Thus, Lawson's triangulation method
-		 controls error bounds in polynomial interpolation
-		 schemes. (Author abstract) 7 Refs."
+, author =      "F. Wesley Wilson and R. Kent Goodrich and Wendy Spratte"
+, title =       "Lawson's Triangulation Is Nearly Optimal For Controlling Error Bounds"
+, journal =     "SIAM J. Numer. Anal."
+, volume =      27
+, number =      1
+, month =       feb
+, year =        1990
+, pages =       "190--197"
+, keywords =    "Lawson's triangulation, error bounds"
+, annote =      "If a triangle has side lengths $a \le b \le c$ then
+                 condition number $C$ is
+                 $1+\sqrt{(1-\lambda^2})/\lambda$, where
+                 $\lambda=(4\mbox{Area})/(b^2+c^2)$. One wants $C$ to be
+                 small. Another error bound looks like
+                 $kc^n_S/\sin\alpha_S$, where $\alpha_S$ is the smallest
+                 angle, $c_S$ is the longest side, and $n$ a positive
+                 integer. Also gives another error bound which is really
+                 hairy."
+, abstract =    "One way of evaluating a triangulation method is to
+                 study how well it controls error bounds and stability
+                 in computations. Lawson's method, which maximizes the
+                 smallest angle over all triangulations, controls error
+                 bounds for linear interpolates as well as for certain
+                 derivative estimates. In particular, no other
+                 triangulation improves these bounds by more than a
+                 factor of 2. Although Lawson's triangulation method
+                 does not minimize the largest edge over all
+                 triangulations, it nearly does; this edge is no longer
+                 than 2/ root 3 times the longest edge in any other
+                 triangulation. Thus, Lawson's triangulation method
+                 controls error bounds in polynomial interpolation
+                 schemes. (Author abstract) 7 Refs."
 }
 
 @article{w-tbcav-87
-, author =	"P. M. H. Wilson"
-, title =	"Towards Birational Classfication of Algebraic Varieties"
-, journal =	"Bull. London Math. Soc."
-, volume =	19
-, year =	1987
-, pages =	"1--48"
-, update =	"97.11 bibrelex"
+, author =      "P. M. H. Wilson"
+, title =       "Towards Birational Classfication of Algebraic Varieties"
+, journal =     "Bull. London Math. Soc."
+, volume =      19
+, year =        1987
+, pages =       "1--48"
+, update =      "97.11 bibrelex"
 }
 
 @incollection{w-epa-91
-, author =	"R. H. Wilson"
-, title =	"Efficiently Partitioning an Assembly"
-, editor =	"L. S. Honem de Mello and S. Lee"
-, booktitle =	"Computer-Aided Mechanical Assembling Planning"
-, publisher =	"Kluwer Academic Publishers"
-, year =	1991
+, author =      "R. H. Wilson"
+, title =       "Efficiently Partitioning an Assembly"
+, editor =      "L. S. Honem de Mello and S. Lee"
+, booktitle =   "Computer-Aided Mechanical Assembling Planning"
+, publisher =   "Kluwer Academic Publishers"
+, year =        1991
 }
 
 @phdthesis{w-fap-92
-, author =	"R. H. Wilson"
-, title =	"On Geometric Assembly Planning"
-, school =	"Stanford University"
-, month =	mar
-, year =	1992
-, note =	"Stanford Technical Report STAN-CS-92-1416"
-, keywords =	"doctoral thesis"
-, update =	"98.11 bibrelex"
+, author =      "R. H. Wilson"
+, title =       "On Geometric Assembly Planning"
+, school =      "Stanford University"
+, month =       mar
+, year =        1992
+, note =        "Stanford Technical Report STAN-CS-92-1416"
+, keywords =    "doctoral thesis"
+, update =      "98.11 bibrelex"
 }
 
 @article{wl-grama-94
-, author =	"R. H. Wilson and J.-C. Latombe"
-, title =	"Geometric reasoning about mechanical assembly"
-, journal =	"Artif. Intell."
-, volume =	71
-, year =	1994
-, pages =	"371--396"
-, update =	"98.07 bibrelex"
+, author =      "R. H. Wilson and J.-C. Latombe"
+, title =       "Geometric reasoning about mechanical assembly"
+, journal =     "Artif. Intell."
+, volume =      71
+, year =        1994
+, pages =       "371--396"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{wll-cpa-92
-, author =	"R. H. Wilson and J.-C. Latombe and T. Lozano-P{\'e}rez"
-, title =	"On the complexity of partitioning an assembly"
-, type =	"Technical Report"
-, number =	"STAN-CS-92-1458"
-, institution =	"Dept. of Computer Science, Stanford University"
-, year =	1992
-, update =	"99.11 bibrelex, 98.11 bibrelex"
+, author =      "R. H. Wilson and J.-C. Latombe and T. Lozano-P{\'e}rez"
+, title =       "On the complexity of partitioning an assembly"
+, type =        "Technical Report"
+, number =      "STAN-CS-92-1458"
+, institution = "Dept. of Computer Science, Stanford University"
+, year =        1992
+, update =      "99.11 bibrelex, 98.11 bibrelex"
 }
 
 @inproceedings{wm-paimt-92
-, author =	"R. H. Wilson and T. Matsui"
-, title =	"Partitioning an assembly for infinitesimal motions in translation and rotation"
-, booktitle =	"Proc. IEEE Internat. Conf. Intell. Robots Syst."
-, year =	1992
-, pages =	"1311--1318"
-, update =	"98.03 bibrelex"
+, author =      "R. H. Wilson and T. Matsui"
+, title =       "Partitioning an assembly for infinitesimal motions in translation and rotation"
+, booktitle =   "Proc. IEEE Internat. Conf. Intell. Robots Syst."
+, year =        1992
+, pages =       "1311--1318"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ws-apst-91
-, author =	"R. H. Wilson and A. Schweikard"
-, title =	"Assembling polyhedra with single translations"
-, number =	"STAN-CS-91-1387"
-, institution =	"Dept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, month =	oct
-, year =	1991
+, author =      "R. H. Wilson and A. Schweikard"
+, title =       "Assembling polyhedra with single translations"
+, number =      "STAN-CS-91-1387"
+, institution = "Dept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, month =       oct
+, year =        1991
 }
 
 @inproceedings{wkc-oarbb-89
-, author =	"S. Wimer and I. Koren and I. Cederbaum"
-, title =	"Optimal Aspect Ratios of Building Blocks inVLSI"
-, booktitle =	"IEEE Trans. Computer Aided Design of Integrated Circuits and Systems"
-, year =	1989
-, pages =	"139--145"
-, update =	"98.11 bibrelex"
+, author =      "S. Wimer and I. Koren and I. Cederbaum"
+, title =       "Optimal Aspect Ratios of Building Blocks inVLSI"
+, booktitle =   "IEEE Trans. Computer Aided Design of Integrated Circuits and Systems"
+, year =        1989
+, pages =       "139--145"
+, update =      "98.11 bibrelex"
 }
 
 @article{wkc-fpgl-88
-, author =	"W. Wimer and I. Koren and I. Cederbaum"
-, title =	"Floorplans, Planar Graphs and Layouts"
-, journal =	"IEEE Trans. Circuits Syst."
-, volume =	"CAS-35"
-, year =	1988
-, pages =	"267--278"
-, update =	"99.03 vismara, 98.11 bibrelex"
+, author =      "W. Wimer and I. Koren and I. Cederbaum"
+, title =       "Floorplans, Planar Graphs and Layouts"
+, journal =     "IEEE Trans. Circuits Syst."
+, volume =      "CAS-35"
+, year =        1988
+, pages =       "267--278"
+, update =      "99.03 vismara, 98.11 bibrelex"
 }
 
 @inproceedings{w-ipac-95
-, author =	"Franz Winkler"
-, title =	"Issues in Parametrization of Algebraic Curves"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	"37--40"
-, update =	"00.03 bibrelex"
+, author =      "Franz Winkler"
+, title =       "Issues in Parametrization of Algebraic Curves"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       "37--40"
+, update =      "00.03 bibrelex"
 }
 
 @article{w-aspep-85
-, author =	"P. Winter"
-, title =	"An algortihm for the {Steiner} problem in the {Euclidean} plane"
-, journal =	"Networks"
-, volume =	15
-, year =	1985
-, pages =	"323--345"
-, update =	"98.11 bibrelex"
+, author =      "P. Winter"
+, title =       "An algortihm for the {Steiner} problem in the {Euclidean} plane"
+, journal =     "Networks"
+, volume =      15
+, year =        1985
+, pages =       "323--345"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{w-esmt3-95
-, author =	"Pawel Winter"
-, title =	"Euclidean {Steiner} Minimal Trees for $3$ Terminals in a Simple Polygon"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"247--253"
-, update =	"95.09 jones"
+, author =      "Pawel Winter"
+, title =       "Euclidean {Steiner} Minimal Trees for $3$ Terminals in a Simple Polygon"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "247--253"
+, update =      "95.09 jones"
 }
 
 @inproceedings{w-shtt-01
-, author =	"Pawel Winter"
-, title =	"{Steiner} Hull in {$\Theta(n\log n)$} Time"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"170--173"
-, update =	"01.04 icking"
+, author =      "Pawel Winter"
+, title =       "{Steiner} Hull in {$\Theta(n\log n)$} Time"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "170--173"
+, update =      "01.04 icking"
 }
 
 @article{w-spns-87
-, author =	"P. Winter"
-, title =	"Steiner problem in networks, a survey"
-, journal =	"Networks"
-, volume =	17
-, year =	1987
-, pages =	"129--167"
-, update =	"97.11 bibrelex"
+, author =      "P. Winter"
+, title =       "Steiner problem in networks, a survey"
+, journal =     "Networks"
+, volume =      17
+, year =        1987
+, pages =       "129--167"
+, update =      "97.11 bibrelex"
 }
 
 @article{w-rmqpp-85
-, author =	"D. S. Wise"
-, title =	"Representing matrices as quadtrees for parallel processors"
-, journal =	"Inform. Process. Lett."
-, volume =	20
-, year =	1985
-, pages =	"195--199"
+, author =      "D. S. Wise"
+, title =       "Representing matrices as quadtrees for parallel processors"
+, journal =     "Inform. Process. Lett."
+, volume =      20
+, year =        1985
+, pages =       "195--199"
 }
 
 @article{ww-stcs-88
-, author =	"J. A. Wiseman and P. R. Wilson"
-, title =	"A {Sylvester} theorem for conic sections"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, year =	1988
-, pages =	"295--305"
+, author =      "J. A. Wiseman and P. R. Wilson"
+, title =       "A {Sylvester} theorem for conic sections"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, year =        1988
+, pages =       "295--305"
 }
 
 @article{w-cfvgs-92
-, author =	"S. Wismath"
-, title =	"Computing the full visibility graph of a set of line segments"
-, journal =	"Inform. Process. Lett."
-, volume =	42
-, number =	5
-, month =	jul
-, year =	1992
-, pages =	"257--??"
-, update =	"98.07 bibrelex"
+, author =      "S. Wismath"
+, title =       "Computing the full visibility graph of a set of line segments"
+, journal =     "Inform. Process. Lett."
+, volume =      42
+, number =      5
+, month =       jul
+, year =        1992
+, pages =       "257--??"
+, update =      "98.07 bibrelex"
 }
 
 @phdthesis{w-brvgr-89
-, author =	"S. K. Wismath"
-, title =	"Bar-Representable Visibility Graphs and Related Flow Problems"
-, type =	"Ph.{D.} Thesis"
-, school =	"Dept. Comput. Sci., Univ. British Columbia"
-, year =	1989
-, keywords =	"graph drawing, visibility, planar"
-, update =	"97.03 tamassia"
+, author =      "S. K. Wismath"
+, title =       "Bar-Representable Visibility Graphs and Related Flow Problems"
+, type =        "Ph.{D.} Thesis"
+, school =      "Dept. Comput. Sci., Univ. British Columbia"
+, year =        1989
+, keywords =    "graph drawing, visibility, planar"
+, update =      "97.03 tamassia"
 }
 
 @inproceedings{w-cblsg-85
-, author =	"S. K. Wismath"
-, title =	"Characterizing bar line-of-sight graphs"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"147--152"
-, keywords =	"visibility, graph theory, geometric graphs, graph drawing"
-, precedes =	"kw-wvgbr-89"
-, cites =	"a-aac-78, et-csn-76, gjs-agcpc-76, ZZZ"
-, update =	"01.04 icking, 97.11 bibrelex, 93.09 milone+mitchell+tamassia"
+, author =      "S. K. Wismath"
+, title =       "Characterizing bar line-of-sight graphs"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "147--152"
+, keywords =    "visibility, graph theory, geometric graphs, graph drawing"
+, precedes =    "kw-wvgbr-89"
+, cites =       "a-aac-78, et-csn-76, gjs-agcpc-76, ZZZ"
+, update =      "01.04 icking, 97.11 bibrelex, 93.09 milone+mitchell+tamassia"
 }
 
 @inproceedings{w-rplse-94
-, author =	"S. K. Wismath"
-, title =	"Reconstruction of Parallel Line Segments From Endpoint Visibility Information"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"369--374"
-, cites =	"cl-dvg-92, ec-rvgsp-90, elo-rchev-93, o-cgc18-93a, s-spinh-91, tt-uavrp-86, w-cblsg-85, a-srvg-92, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "S. K. Wismath"
+, title =       "Reconstruction of Parallel Line Segments From Endpoint Visibility Information"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "369--374"
+, cites =       "cl-dvg-92, ec-rvgsp-90, elo-rchev-93, o-cgc18-93a, s-spinh-91, tt-uavrp-86, w-cblsg-85, a-srvg-92, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @mastersthesis{w-tas-80
-, author =	"S. K. Wismath"
-, title =	"Triangulations: {An} algorithmic study"
-, type =	"M.{Sc}. Thesis"
-, school =	"Dept. Comput. Inform. Sci., Queen's Univ."
-, address =	"Kingston, ON"
-, month =	jul
-, year =	1980
-, note =	"Report 80-106"
-, keywords =	"master thesis, Delaunay triangulations, point-set triangulation, implementing algorithms, empirical analysis"
-, update =	"93.05 jones"
+, author =      "S. K. Wismath"
+, title =       "Triangulations: {An} algorithmic study"
+, type =        "M.{Sc}. Thesis"
+, school =      "Dept. Comput. Inform. Sci., Queen's Univ."
+, address =     "Kingston, ON"
+, month =       jul
+, year =        1980
+, note =        "Report 80-106"
+, keywords =    "master thesis, Delaunay triangulations, point-set triangulation, implementing algorithms, empirical analysis"
+, update =      "93.05 jones"
 }
 
 @article{w-sacui-80
-, author =	"H. S. Witsenhausen"
-, title =	"Some aspects of convexity useful in information theory"
-, journal =	"IEEE Trans. Inform. Theory"
-, volume =	"IT-26"
-, year =	1980
-, pages =	"265--271"
+, author =      "H. S. Witsenhausen"
+, title =       "Some aspects of convexity useful in information theory"
+, journal =     "IEEE Trans. Inform. Theory"
+, volume =      "IT-26"
+, year =        1980
+, pages =       "265--271"
 }
 
 @techreport{w-enh-88
-, author =	"G. Woeginger"
-, title =	"Epsilon-nets for Halfplanes"
-, number =	"B-88-02"
-, institution =	"Dep. of Mathematics, Free University Berlin"
-, month =	mar
-, year =	1988
-, update =	"98.03 bibrelex"
+, author =      "G. Woeginger"
+, title =       "Epsilon-nets for Halfplanes"
+, number =      "B-88-02"
+, institution = "Dep. of Mathematics, Free University Berlin"
+, month =       mar
+, year =        1988
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{w-enh-89
-, author =	"G. Woeginger"
-, title =	"Epsilon-nets for Halfplanes"
-, booktitle =	"Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	344
-, year =	1989
-, pages =	"243--252"
-, update =	"97.03 gaertner+salinger"
+, author =      "G. Woeginger"
+, title =       "Epsilon-nets for Halfplanes"
+, booktitle =   "Proc. 14th Internat. Workshop Graph-Theoret. Concepts Comput. Sci."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      344
+, year =        1989
+, pages =       "243--252"
+, update =      "97.03 gaertner+salinger"
 }
 
 @inproceedings{w-avpmm-89
-, author =	"G. W{\"o}ginger"
-, title =	"{Auffinden} von {Vier}-{Punkte}-{Mengen} mit minimaler {Fl{\"a}che}"
-, booktitle =	"Abstracts 5th Intern. Workshop Comput. Geom."
-, nickname =	"CG '89"
-, site =	"Freiburg"
-, publisher =	"Universit{\"a}t Freiburg"
-, year =	1989
-, update =	"00.03 bibrelex"
+, author =      "G. W{\"o}ginger"
+, title =       "{Auffinden} von {Vier}-{Punkte}-{Mengen} mit minimaler {Fl{\"a}che}"
+, booktitle =   "Abstracts 5th Intern. Workshop Comput. Geom."
+, nickname =    "CG '89"
+, site =        "Freiburg"
+, publisher =   "Universit{\"a}t Freiburg"
+, year =        1989
+, update =      "00.03 bibrelex"
 }
 
 @misc{w-sve-96
-, author =	"T. T. Wohlers"
-, title =	"STL viewers and Editors"
-, year =	1996
-, url =	"http://lamar.colstate.edu/~wohlers/stl_view.html"
-, update =	"98.07 bibrelex"
+, author =      "T. T. Wohlers"
+, title =       "STL viewers and Editors"
+, year =        1996
+, url = "http://lamar.colstate.edu/~wohlers/stl_view.html"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{wm-fcplt-94
-, author =	"George Wolberg and Henry Massalin"
-, title =	"Fast Convolution with Packed Lookup Tables"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"447--464"
-, keywords =	"image filter, image magnification, image resampling"
-, update =	"94.09 heckbert"
-, annote =	"Gives optimized code for convolution of discrete signals.
+, author =      "George Wolberg and Henry Massalin"
+, title =       "Fast Convolution with Packed Lookup Tables"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "447--464"
+, keywords =    "image filter, image magnification, image resampling"
+, update =      "94.09 heckbert"
+, annote =      "Gives optimized code for convolution of discrete signals.
 This is useful for image resampling and filtering. Contains C code."
 }
 
 @article{w-fnpp-76
-, author =	"P. Wolfe"
-, title =	"Finding the nearest point in a polytope"
-, journal =	"Math. Program."
-, volume =	11
-, year =	1976
-, pages =	"128--149"
+, author =      "P. Wolfe"
+, title =       "Finding the nearest point in a polytope"
+, journal =     "Math. Program."
+, volume =      11
+, year =        1976
+, pages =       "128--149"
 }
 
 @article{wwkgf-smpd-87
-, author =	"R. N. Wolfe and M. A. Wesley and J. C. {Kyle, Jr.} and F. Gracer and W. J. Fitzgerald"
-, title =	"Solid modeling for production design"
-, journal =	"IBM J. Res. Develop."
-, volume =	31
-, year =	1987
-, pages =	"277--295"
+, author =      "R. N. Wolfe and M. A. Wesley and J. C. {Kyle, Jr.} and F. Gracer and W. J. Fitzgerald"
+, title =       "Solid modeling for production design"
+, journal =     "IBM J. Res. Develop."
+, volume =      31
+, year =        1987
+, pages =       "277--295"
 }
 
 @book{w-msdmc-88
-, author =	"S. Wolfram"
-, title =	"Mathematica: a system for doing mathematics by computer"
-, publisher =	"Addison-Wesley"
-, address =	"Reading, Mass."
-, year =	1988
-, update =	"97.03 schwarzkopf, 95.05 agarwal"
+, author =      "S. Wolfram"
+, title =       "Mathematica: a system for doing mathematics by computer"
+, publisher =   "Addison-Wesley"
+, address =     "Reading, Mass."
+, year =        1988
+, update =      "97.03 schwarzkopf, 95.05 agarwal"
 }
 
 @inproceedings{w-rfoli-96
-, author =	"Michael Wolfrath"
-, title =	"Results on Fat Objects with a Low Intersection Proportion"
-, booktitle =	"Abstracts 12th European Workshop Comput. Geom."
-, nickname =	"CG '96"
-, site =	"M{\"u}nster"
-, publisher =	"Universit{\"a}t M{\"u}nster"
-, year =	1996
-, pages =	1
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 99.03 bibrelex"
+, author =      "Michael Wolfrath"
+, title =       "Results on Fat Objects with a Low Intersection Proportion"
+, booktitle =   "Abstracts 12th European Workshop Comput. Geom."
+, nickname =    "CG '96"
+, site =        "M{\"u}nster"
+, publisher =   "Universit{\"a}t M{\"u}nster"
+, year =        1996
+, pages =       1
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 99.03 bibrelex"
 }
 
 @inproceedings{w-vdsta-95
-, author =	"Michael Wolfrath"
-, title =	"{Voronoi} Diagrams for Spheres and Their Application in Motion Planning"
-, booktitle =	"Abstracts 11th European Workshop Comput. Geom."
-, nickname =	"CG '95"
-, site =	"Linz"
-, publisher =	"Universit{\"a}t Linz"
-, year =	1995
-, pages =	29
-, update =	"00.03 bibrelex"
+, author =      "Michael Wolfrath"
+, title =       "{Voronoi} Diagrams for Spheres and Their Application in Motion Planning"
+, booktitle =   "Abstracts 11th European Workshop Comput. Geom."
+, nickname =    "CG '95"
+, site =        "Linz"
+, publisher =   "Universit{\"a}t Linz"
+, year =        1995
+, pages =       29
+, update =      "00.03 bibrelex"
 }
 
 @techreport{ws-cmdap-87
-, author =	"E. Wolfson and E. L. Schwartz"
-, title =	"Computing Minimal Distances on Arbitrary Polyhedral Surfaces"
-, type =	"Technical report"
-, institution =	"Dept. of Computer Science, Courant Institute of Mathematical Sciences"
-, year =	1987
-, precedes =	"ws-cmdps-89"
-, update =	"95.01 mitchell, 93.09 milone+mitchell"
+, author =      "E. Wolfson and E. L. Schwartz"
+, title =       "Computing Minimal Distances on Arbitrary Polyhedral Surfaces"
+, type =        "Technical report"
+, institution = "Dept. of Computer Science, Courant Institute of Mathematical Sciences"
+, year =        1987
+, precedes =    "ws-cmdps-89"
+, update =      "95.01 mitchell, 93.09 milone+mitchell"
 }
 
 @article{ws-cmdps-89
-, author =	"E. Wolfson and E. L. Schwartz"
-, title =	"Computing Minimal Distances on Polyhedral Surfaces"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	11
-, number =	9
-, year =	1989
-, pages =	"1001--1005"
-, comments =	"presents an algorithm that has been implemented for the
-		discrete geodesic problem; the algorithm is worst-case exponential"
-, succeeds =	"ws-cmdap-87"
-, update =	"95.01 mitchell, 95.01 mitchell"
+, author =      "E. Wolfson and E. L. Schwartz"
+, title =       "Computing Minimal Distances on Polyhedral Surfaces"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      11
+, number =      9
+, year =        1989
+, pages =       "1001--1005"
+, comments =    "presents an algorithm that has been implemented for the
+                discrete geodesic problem; the algorithm is worst-case exponential"
+, succeeds =    "ws-cmdap-87"
+, update =      "95.01 mitchell, 95.01 mitchell"
 }
 
 @techreport{ws-dimps-92
-, author =	"E. Wolfson and M. Sharir"
-, title =	"Design and implementation of a motion planning system in three dimensions"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1992
-, update =	"98.03 bibrelex"
+, author =      "E. Wolfson and M. Sharir"
+, title =       "Design and implementation of a motion planning system in three dimensions"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1992
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{ws-impst-93
-, author =	"E. Wolfson and Micha Sharir"
-, title =	"Implementation of a motion planning system in three dimensions"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Comput. Geom."
-, year =	1993
-, pages =	"399--400"
-, keywords =	"video review"
-, cites =	"as-car-92, cp-tncp-90, ws-dimps-92, ZZZ"
-, update =	"98.03 bibrelex+mitchell, 93.09 jones"
+, author =      "E. Wolfson and Micha Sharir"
+, title =       "Implementation of a motion planning system in three dimensions"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Comput. Geom."
+, year =        1993
+, pages =       "399--400"
+, keywords =    "video review"
+, cites =       "as-car-92, cp-tncp-90, ws-dimps-92, ZZZ"
+, update =      "98.03 bibrelex+mitchell, 93.09 jones"
 }
 
 @inproceedings{w-mborg-90
-, author =	"H. J. Wolfson"
-, title =	"Model based object recognition by `geometric hashing'"
-, booktitle =	"Proc. 1st European Conf. Comput. Vision"
-, year =	1990
-, pages =	"526--536"
-, update =	"97.11 bibrelex"
+, author =      "H. J. Wolfson"
+, title =       "Model based object recognition by `geometric hashing'"
+, booktitle =   "Proc. 1st European Conf. Comput. Vision"
+, year =        1990
+, pages =       "526--536"
+, update =      "97.11 bibrelex"
 }
 
 @article{w-cm-90
-, author =	"H. J. Wolfson"
-, title =	"On curve matching"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	12
-, year =	1990
-, pages =	"483--489"
-, update =	"98.03 bibrelex"
+, author =      "H. J. Wolfson"
+, title =       "On curve matching"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      12
+, year =        1990
+, pages =       "483--489"
+, update =      "98.03 bibrelex"
 }
 
 @phdthesis{w-clbur-85
-, author =	"F. E. Wolter"
-, title =	"Cut Loci in Bordered and Unbordered Riemannian Manifolds"
-, school =	"TU Berlin, FB Mathematik"
-, address =	"Berlin, Germany"
-, year =	1985
-, keywords =	"doctoral thesis"
-, update =	"95.05 held"
+, author =      "F. E. Wolter"
+, title =       "Cut Loci in Bordered and Unbordered Riemannian Manifolds"
+, school =      "TU Berlin, FB Mathematik"
+, address =     "Berlin, Germany"
+, year =        1985
+, keywords =    "doctoral thesis"
+, update =      "95.05 held"
 }
 
 @article{w-clmag-??
-, author =	"F.-E. Wolter"
-, title =	"Cut Locus and Medial Axis in Global Shape Interrogation and Representation"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	"??"
-, year =	"??"
-, note =	"To appear"
-, update =	"95.05 abrams"
+, author =      "F.-E. Wolter"
+, title =       "Cut Locus and Medial Axis in Global Shape Interrogation and Representation"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      "??"
+, year =        "??"
+, note =        "To appear"
+, update =      "95.05 abrams"
 }
 
 @techreport{w-clmag-92
-, author =	"F. E. Wolter"
-, title =	"Cut Locus and Medial Axis in Global Shape Interrogation and Representation"
-, number =	"92-2"
-, institution =	"MIT, Dept. Ocean Engg., Design Lab"
-, address =	"Cambridge, MA 02139, USA"
-, month =	jan
-, year =	1992
-, update =	"95.05 held"
+, author =      "F. E. Wolter"
+, title =       "Cut Locus and Medial Axis in Global Shape Interrogation and Representation"
+, number =      "92-2"
+, institution = "MIT, Dept. Ocean Engg., Design Lab"
+, address =     "Cambridge, MA 02139, USA"
+, month =       jan
+, year =        1992
+, update =      "95.05 held"
 }
 
 @article{wt-ahdpc-92
-, author =	"F.-E. Wolter and S. T. Tuohy"
-, title =	"Approximation of High Degree and Procedural Curves"
-, journal =	"Engineering with Computers"
-, volume =	8
-, year =	1992
-, pages =	"61--80"
-, update =	"95.05 abrams"
+, author =      "F.-E. Wolter and S. T. Tuohy"
+, title =       "Approximation of High Degree and Procedural Curves"
+, journal =     "Engineering with Computers"
+, volume =      8
+, year =        1992
+, pages =       "61--80"
+, update =      "95.05 abrams"
 }
 
 @article{wt-ccdsp-92
-, author =	"F.-E. Wolter and S. T. Tuohy"
-, title =	"Curvature Computations for Degenerate Surface Patches"
-, journal =	"Comput. Aided Geom. Design"
-, volume =	9
-, number =	4
-, year =	1992
-, pages =	"241--270"
-, update =	"95.05 abrams"
+, author =      "F.-E. Wolter and S. T. Tuohy"
+, title =       "Curvature Computations for Degenerate Surface Patches"
+, journal =     "Comput. Aided Geom. Design"
+, volume =      9
+, number =      4
+, year =        1992
+, pages =       "241--270"
+, update =      "95.05 abrams"
 }
 
 @article{wwv-oasdt-85
-, author =	"Jan D. Wolter and Tony C. Woo and Richard A. Volz"
-, title =	"Optimal algorithms for symmetry detection in two and three dimensions"
-, journal =	"Visual Comput."
-, volume =	1
-, number =	1
-, month =	jul
-, year =	1985
-, pages =	"37--48"
-, keywords =	"similarity, pattern matching, graph isomorphism"
+, author =      "Jan D. Wolter and Tony C. Woo and Richard A. Volz"
+, title =       "Optimal algorithms for symmetry detection in two and three dimensions"
+, journal =     "Visual Comput."
+, volume =      1
+, number =      1
+, month =       jul
+, year =        1985
+, pages =       "37--48"
+, keywords =    "similarity, pattern matching, graph isomorphism"
 }
 
 @article{ws-bbshm-88
-, author =	"Y. Won and S. Sahni"
-, title =	"A balanced bin sort for hypercube multicomputers"
-, journal =	"J. of Supercomputing"
-, volume =	2
-, year =	1988
-, pages =	"435--448"
-, update =	"96.09 orourke"
+, author =      "Y. Won and S. Sahni"
+, title =       "A balanced bin sort for hypercube multicomputers"
+, journal =     "J. of Supercomputing"
+, volume =      2
+, year =        1988
+, pages =       "435--448"
+, update =      "96.09 orourke"
 }
 
 @incollection{w-otdcs-85
-, author =	"C. K. Wong"
-, title =	"An optimal two-dimensional compaction scheme"
-, editor =	"P. Bertolazzi and F. Luccio"
-, booktitle =	"VLSI: {Algorithms} and Architectures"
-, publisher =	"Elsevier"
-, year =	1985
-, pages =	"205--211"
-, update =	"98.03 bibrelex"
+, author =      "C. K. Wong"
+, title =       "An optimal two-dimensional compaction scheme"
+, editor =      "P. Bertolazzi and F. Luccio"
+, booktitle =   "VLSI: {Algorithms} and Architectures"
+, publisher =   "Elsevier"
+, year =        1985
+, pages =       "205--211"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{w-mrdpb-79
-, author =	"T. Wong"
-, title =	"Minimum Rectangular Distance Paths Between Two Points on a Plane with barriers"
-, institution =	"Electrical Engineering and Computer Science, MIT"
-, month =	may
-, year =	1979
-, update =	"93.09 milone+mitchell"
+, author =      "T. Wong"
+, title =       "Minimum Rectangular Distance Paths Between Two Points on a Plane with barriers"
+, institution = "Electrical Engineering and Computer Science, MIT"
+, month =       may
+, year =        1979
+, update =      "93.09 milone+mitchell"
 }
 
 @article{wt-agseo-84
-, author =	"R. C. Woo and T. Thomasma"
-, title =	"An algorithm for generating solid elements in objects with holes"
-, journal =	"Comput. Struct."
-, volume =	18
-, year =	1984
-, pages =	"333--342"
+, author =      "R. C. Woo and T. Thomasma"
+, title =       "An algorithm for generating solid elements in objects with holes"
+, journal =     "Comput. Struct."
+, volume =      18
+, year =        1984
+, pages =       "333--342"
 }
 
 @techreport{w-csp-83
-, author =	"T. Woo"
-, title =	"The Convex Skull Problem"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "T. Woo"
+, title =       "The Convex Skull Problem"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{w-cabds-85
-, author =	"T. C. Woo"
-, title =	"A combinatorial analysis of boundary data structure schemata"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	5
-, number =	3
-, year =	1985
-, pages =	"19--27"
+, author =      "T. C. Woo"
+, title =       "A combinatorial analysis of boundary data structure schemata"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      5
+, number =      3
+, year =        1985
+, pages =       "19--27"
 }
 
 @inproceedings{w-fevd-82
-, author =	"T. C. Woo"
-, title =	"Feature Extraction by Volume Decomposition"
-, booktitle =	"Proceedings of Conference on CAD/CAM Technology in Mechanical Engineering"
-, organization =	"MIT"
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "T. C. Woo"
+, title =       "Feature Extraction by Volume Decomposition"
+, booktitle =   "Proceedings of Conference on CAD/CAM Technology in Mechanical Engineering"
+, organization =        "MIT"
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @article{wl-tcccp-85
-, author =	"T. C. Woo and H.-C. Lee"
-, title =	"On the time complexity for circumscribing a convex polygon"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	30
-, year =	1985
-, pages =	"362--363"
+, author =      "T. C. Woo and H.-C. Lee"
+, title =       "On the time complexity for circumscribing a convex polygon"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      30
+, year =        1985
+, pages =       "362--363"
 }
 
 @article{ws-ltatp-85
-, author =	"T. C. Woo and S. Y. Shin"
-, title =	"A linear time algorithm for triangulating a point-visible polygon"
-, journal =	"ACM Trans. Graph."
-, volume =	4
-, number =	1
-, year =	1985
-, pages =	"60--70"
+, author =      "T. C. Woo and S. Y. Shin"
+, title =       "A linear time algorithm for triangulating a point-visible polygon"
+, journal =     "ACM Trans. Graph."
+, volume =      4
+, number =      1
+, year =        1985
+, pages =       "60--70"
 }
 
 @incollection{w-ivcg-85
-, author =	"D. Wood"
-, title =	"An isothetic view of computational geometry"
-, editor =	"G. T. Toussaint"
-, booktitle =	"Computational Geometry"
-, publisher =	"North-Holland"
-, address =	"Amsterdam, Netherlands"
-, year =	1985
-, pages =	"429--459"
+, author =      "D. Wood"
+, title =       "An isothetic view of computational geometry"
+, editor =      "G. T. Toussaint"
+, booktitle =   "Computational Geometry"
+, publisher =   "North-Holland"
+, address =     "Amsterdam, Netherlands"
+, year =        1985
+, pages =       "429--459"
 }
 
 @book{w-dsap-93
-, author =	"D. Wood"
-, title =	"Data Structures, Algorithms, and Performance"
-, publisher =	"Addison-Wesley"
-, year =	1993
-, update =	"97.03 tamassia"
+, author =      "D. Wood"
+, title =       "Data Structures, Algorithms, and Performance"
+, publisher =   "Addison-Wesley"
+, year =        1993
+, update =      "97.03 tamassia"
 }
 
 @article{w-cprp-84
-, author =	"D. Wood"
-, title =	"The contour problem for rectilinear polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	19
-, year =	1984
-, pages =	"229--236"
+, author =      "D. Wood"
+, title =       "The contour problem for rectilinear polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      19
+, year =        1984
+, pages =       "229--236"
 }
 
 @incollection{w-rr-88
-, author =	"D. Wood"
-, title =	"The riches of rectangles"
-, booktitle =	"Proc. 5th Internat. Meeting Young Comput. Scientists"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	381
-, publisher =	"Springer-Verlag"
-, year =	1988
-, pages =	"161--168"
+, author =      "D. Wood"
+, title =       "The riches of rectangles"
+, booktitle =   "Proc. 5th Internat. Meeting Young Comput. Scientists"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      381
+, publisher =   "Springer-Verlag"
+, year =        1988
+, pages =       "161--168"
 }
 
 @inproceedings{wy-dsv-93
-, author =	"D. Wood and P. Yamamoto"
-, title =	"Dent and staircase visibility"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"297--302"
-, cites =	"bs-parpv-92, cr-occop-89a, b-rld-91, srw-gsv-cccg-91, ZZZ"
-, update =	"98.11 bibrelex, 93.09 milone+mitchell"
+, author =      "D. Wood and P. Yamamoto"
+, title =       "Dent and staircase visibility"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "297--302"
+, cites =       "bs-parpv-92, cr-occop-89a, b-rld-91, srw-gsv-cccg-91, ZZZ"
+, update =      "98.11 bibrelex, 93.09 milone+mitchell"
 }
 
 @inproceedings{wy-ccsop-85
-, author =	"D. Wood and C. K. Yap"
-, title =	"Computing a convex skull of an orthogonal polygon"
-, booktitle =	"Proc. 1st Annu. ACM Sympos. Comput. Geom."
-, year =	1985
-, pages =	"311--315"
-, succeeds =	"wy-rcsp-84"
-, precedes =	"wy-ocsp-88"
-, cites =	"cy-psppo-84, g-lcpcn-81, osw-dcrch-85, s-mcrm-72, w-csp-83, ZZZ"
-, update =	"97.11 bibrelex"
+, author =      "D. Wood and C. K. Yap"
+, title =       "Computing a convex skull of an orthogonal polygon"
+, booktitle =   "Proc. 1st Annu. ACM Sympos. Comput. Geom."
+, year =        1985
+, pages =       "311--315"
+, succeeds =    "wy-rcsp-84"
+, precedes =    "wy-ocsp-88"
+, cites =       "cy-psppo-84, g-lcpcn-81, osw-dcrch-85, s-mcrm-72, w-csp-83, ZZZ"
+, update =      "97.11 bibrelex"
 }
 
 @article{wy-ocsp-88
-, author =	"D. Wood and C. K. Yap"
-, title =	"The orthogonal convex skull problem"
-, journal =	"Discrete Comput. Geom."
-, volume =	3
-, number =	4
-, year =	1988
-, pages =	"349--365"
-, succeeds =	"wy-ccsop-85"
-, update =	"98.11 bibrelex"
+, author =      "D. Wood and C. K. Yap"
+, title =       "The orthogonal convex skull problem"
+, journal =     "Discrete Comput. Geom."
+, volume =      3
+, number =      4
+, year =        1988
+, pages =       "349--365"
+, succeeds =    "wy-ccsop-85"
+, update =      "98.11 bibrelex"
 }
 
 @techreport{wy-rcsp-84
-, author =	"D. Wood and C. K. Yap"
-, title =	"The rectilinear convex skull problem"
-, type =	"Report"
-, number =	"TR 132"
-, institution =	"Comput. Sci. Div., New York Univ."
-, address =	"New York, NY"
-, year =	1984
-, precedes =	"wy-ccsop-85"
+, author =      "D. Wood and C. K. Yap"
+, title =       "The rectilinear convex skull problem"
+, type =        "Report"
+, number =      "TR 132"
+, institution = "Comput. Sci. Div., New York Univ."
+, address =     "New York, NY"
+, year =        1984
+, precedes =    "wy-ccsop-85"
 }
 
 @techreport{w-tbtdo-98
-, author =	"D. R. Wood"
-, title =	"Two-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs"
-, type =	"Technical Report"
-, number =	"98/03"
-, institution =	"School of Computer Science and Software Engineering, Monash University"
-, year =	1998
-, url =	"ftp://ftp.cs.monash.edu.au//publications/1998/tr98_03.ps.gz"
-, keywords =	"graph drawing, orthogonal, 3D"
-, update =	"98.07 patrignani"
+, author =      "D. R. Wood"
+, title =       "Two-Bend Three-Dimensional Orthogonal Grid Drawing of Maximum Degree Five Graphs"
+, type =        "Technical Report"
+, number =      "98/03"
+, institution = "School of Computer Science and Software Engineering, Monash University"
+, year =        1998
+, url = "ftp://ftp.cs.monash.edu.au//publications/1998/tr98_03.ps.gz"
+, keywords =    "graph drawing, orthogonal, 3D"
+, update =      "98.07 patrignani"
 }
 
 @inproceedings{w-op-72
-, author =	"D. R. Woodall"
-, title =	"Open problems"
-, editor =	"D. J. A. Welsh and D. R. Woodall"
-, booktitle =	"Combinatorics, Proc. Conference on Combinatorial Mathematics"
-, publisher =	"Institute of Mathematics and its Applications"
-, address =	"Southend-on-Sea, UK"
-, year =	1972
-, pages =	"341--350"
-, update =	"98.03 bibrelex"
+, author =      "D. R. Woodall"
+, title =       "Open problems"
+, editor =      "D. J. A. Welsh and D. R. Woodall"
+, booktitle =   "Combinatorics, Proc. Conference on Combinatorial Mathematics"
+, publisher =   "Institute of Mathematics and its Applications"
+, address =     "Southend-on-Sea, UK"
+, year =        1972
+, pages =       "341--350"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{w-td-69
-, author =	"D. R. Woodall"
-, title =	"Thrackles and deadlock"
-, editor =	"D. J. A. Welsh"
-, booktitle =	"Combinatorial Mathematics and its Applications"
-, publisher =	"Academic Press"
-, address =	"London"
-, year =	1969
-, pages =	"335--348"
-, update =	"98.03 bibrelex"
+, author =      "D. R. Woodall"
+, title =       "Thrackles and deadlock"
+, editor =      "D. J. A. Welsh"
+, booktitle =   "Combinatorial Mathematics and its Applications"
+, publisher =   "Academic Press"
+, address =     "London"
+, year =        1969
+, pages =       "335--348"
+, update =      "98.03 bibrelex"
 }
 
 @article{w-pmdso-80
-, author =	"R. J. Woodham"
-, title =	"Photometric Method for Determining Surface Orientation from Multiple Images"
-, journal =	"Optical Engineering"
-, volume =	19
-, year =	1980
-, pages =	"139--144"
-, update =	"97.11 bibrelex"
+, author =      "R. J. Woodham"
+, title =       "Photometric Method for Determining Surface Orientation from Multiple Images"
+, journal =     "Optical Engineering"
+, volume =      19
+, year =        1980
+, pages =       "139--144"
+, update =      "97.11 bibrelex"
 }
 
 @phdthesis{w-dpg-82
-, author =	"D. Woods"
-, title =	"Drawing Planar Graphs"
-, school =	"Department of Computer Science, Stanford University"
-, year =	1982
-, note =	"Technical Report STAN-CS-82-943"
-, keywords =	"doctoral thesis, graph drawing"
-, update =	"93.09 tamassia"
+, author =      "D. Woods"
+, title =       "Drawing Planar Graphs"
+, school =      "Department of Computer Science, Stanford University"
+, year =        1982
+, note =        "Technical Report STAN-CS-82-943"
+, keywords =    "doctoral thesis, graph drawing"
+, update =      "93.09 tamassia"
 }
 
 @incollection{w-bgm-87
-, author =	"J. Woodwark"
-, title =	"Blends in geometric modeling"
-, editor =	"R. Martin"
-, booktitle =	"The Mathematics of Surfaces II"
-, year =	1987
-, pages =	"255--297"
-, update =	"98.03 bibrelex"
+, author =      "J. Woodwark"
+, title =       "Blends in geometric modeling"
+, editor =      "R. Martin"
+, booktitle =   "The Mathematics of Surfaces II"
+, year =        1987
+, pages =       "255--297"
+, update =      "98.03 bibrelex"
 }
 
 @article{w-cqt-84
-, author =	"J. R. Woodwark"
-, title =	"Compressed quad trees"
-, journal =	"Comput. J."
-, volume =	27
-, number =	3
-, year =	1984
-, pages =	"225--229"
+, author =      "J. R. Woodwark"
+, title =       "Compressed quad trees"
+, journal =     "Comput. J."
+, volume =      27
+, number =      3
+, year =        1984
+, pages =       "225--229"
 }
 
 @book{w-cs-86
-, author =	"J. R. Woodwark"
-, title =	"Computing Shape"
-, publisher =	"Butterwoths"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "J. R. Woodwark"
+, title =       "Computing Shape"
+, publisher =   "Butterwoths"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{w-erpst-88
-, author =	"J. R. Woodwark"
-, title =	"Eliminating Redundant Primitives from Set-Theoretic Solid Models by a Consideration of Constituents"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	8
-, number =	3
-, month =	may
-, year =	1988
-, pages =	"38--47"
-, update =	"93.09 held"
+, author =      "J. R. Woodwark"
+, title =       "Eliminating Redundant Primitives from Set-Theoretic Solid Models by a Consideration of Constituents"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      8
+, number =      3
+, month =       may
+, year =        1988
+, pages =       "38--47"
+, update =      "93.09 held"
 }
 
 @article{wb-bfpsm-86
-, author =	"J. R. Woodwark and A. Bowyer"
-, title =	"Better and faster pictures from solid models"
-, journal =	"IEE Compter Aided Engineering Journal"
-, volume =	"??"
-, year =	1986
-, update =	"98.03 bibrelex"
+, author =      "J. R. Woodwark and A. Bowyer"
+, title =       "Better and faster pictures from solid models"
+, journal =     "IEE Compter Aided Engineering Journal"
+, volume =      "??"
+, year =        1986
+, update =      "98.03 bibrelex"
 }
 
 @article{wq-recvm-82
-, author =	"J. R. Woodwark and K. M. Quinlan"
-, title =	"Reducing the effect of complexity on volume model evaluation"
-, journal =	"Compter Aided Design"
-, volume =	"??"
-, year =	1982
-, update =	"98.03 bibrelex"
+, author =      "J. R. Woodwark and K. M. Quinlan"
+, title =       "Reducing the effect of complexity on volume model evaluation"
+, journal =     "Compter Aided Design"
+, volume =      "??"
+, year =        1982
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{wq-dgvmr-80
-, author =	"J. R. Woodwark and K. M. Quinlan"
-, title =	"The derivation of graphics from volume models by recursive subdivision of the object space"
-, booktitle =	"Proc. CG"
-, year =	1980
-, update =	"98.03 bibrelex"
+, author =      "J. R. Woodwark and K. M. Quinlan"
+, title =       "The derivation of graphics from volume models by recursive subdivision of the object space"
+, booktitle =   "Proc. CG"
+, year =        1980
+, update =      "98.03 bibrelex"
 }
 
 @techreport{w-cpgvl-70
-, author =	"P. Woon"
-, title =	"A Computer Procedure for Generating Visible-Line Drawings of Solids Bounded by Quadratic Surfaces"
-, type =	"Technical {Report}"
-, number =	"403-15"
-, institution =	"Dept. Elect. Engrg., New York Univ."
-, address =	"New York, NY"
-, month =	nov
-, year =	1970
-, update =	"98.03 bibrelex"
+, author =      "P. Woon"
+, title =       "A Computer Procedure for Generating Visible-Line Drawings of Solids Bounded by Quadratic Surfaces"
+, type =        "Technical {Report}"
+, number =      "403-15"
+, institution = "Dept. Elect. Engrg., New York Univ."
+, address =     "New York, NY"
+, month =       nov
+, year =        1970
+, update =      "98.03 bibrelex"
 }
 
 @techreport{w-st-80
-, author =	"B. W{\"o}rdenweber"
-, title =	"Surface-triangulation"
-, type =	"Document"
-, number =	107
-, institution =	"CAD Group, Cambridge Univ."
-, address =	"Cambridge, England"
-, year =	1980
+, author =      "B. W{\"o}rdenweber"
+, title =       "Surface-triangulation"
+, type =        "Document"
+, number =      107
+, institution = "CAD Group, Cambridge Univ."
+, address =     "Cambridge, England"
+, year =        1980
 }
 
 @article{w-stpp-83
-, author =	"B. W{\"o}rdenweber"
-, title =	"Surface Triangulation for Picture Production"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	3
-, month =	nov
-, year =	1983
-, pages =	"45--51"
-, annote =	"Triangulation of polyhedra for representation. Claims
-		 $N\log N$ for triangulation of a polygon. (I don't
-		 believe this.)"
+, author =      "B. W{\"o}rdenweber"
+, title =       "Surface Triangulation for Picture Production"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      3
+, month =       nov
+, year =        1983
+, pages =       "45--51"
+, annote =      "Triangulation of polyhedra for representation. Claims
+                 $N\log N$ for triangulation of a polygon. (I don't
+                 believe this.)"
 }
 
 @techreport{w-vt-??
-, author =	"B. W{\"o}rdenweber"
-, title =	"Volume-triangulation"
-, type =	"Document"
-, number =	110
-, institution =	"CAD Group, Cambridge Univ."
-, address =	"Cambridge, England"
-, year =	"??"
+, author =      "B. W{\"o}rdenweber"
+, title =       "Volume-triangulation"
+, type =        "Document"
+, number =      110
+, institution = "CAD Group, Cambridge Univ."
+, address =     "Cambridge, England"
+, year =        "??"
 }
 
 @inproceedings{ws-msadp-92
-, author =	"Marcel Worring and Arnold W. M. Smeulders"
-, title =	"Multi-Scale Analysis of Discrete Point Sets"
-, booktitle =	"Abstracts 8th European Workshop Comput. Geom."
-, nickname =	"CG '92"
-, site =	"Utrecht"
-, publisher =	"Utrecht University"
-, year =	1992
-, pages =	"33--37"
-, update =	"00.03 bibrelex"
+, author =      "Marcel Worring and Arnold W. M. Smeulders"
+, title =       "Multi-Scale Analysis of Discrete Point Sets"
+, booktitle =   "Abstracts 8th European Workshop Comput. Geom."
+, nickname =    "CG '92"
+, site =        "Utrecht"
+, publisher =   "Utrecht University"
+, year =        1992
+, pages =       "33--37"
+, update =      "00.03 bibrelex"
 }
 
 @phdthesis{w-pdtpu-93
-, author =	"B. Darce Wright"
-, title =	"Planification de trajectoires pour un robot mobile sur un terrain accident{\'e}"
-, school =	"Ecole Nationale Sup{\'e}rieure des T{\'e}lecommunications"
-, year =	1993
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "B. Darce Wright"
+, title =       "Planification de trajectoires pour un robot mobile sur un terrain accident{\'e}"
+, school =      "Ecole Nationale Sup{\'e}rieure des T{\'e}lecommunications"
+, year =        1993
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{w-tsshl-83
-, author =	"T. J. Wright"
-, title =	"A two-space solution to the hidden line problem for plotting functions of two variables"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-32"
-, number =	1
-, year =	1983
-, pages =	"28--33"
-, update =	"98.03 bibrelex"
+, author =      "T. J. Wright"
+, title =       "A two-space solution to the hidden line problem for plotting functions of two variables"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-32"
+, number =      1
+, year =        1983
+, pages =       "28--33"
+, update =      "98.03 bibrelex"
 }
 
 @article{wbr-cgpma-86
-, author =	"A. Y. Wu and S. K. Bhaskar and A. Rosenfeld"
-, title =	"Computation of geometric properties from the medial axis transform in {$O(n \log n)$} time"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	34
-, year =	1986
-, pages =	"76--92"
-, update =	"98.07 bibrelex"
+, author =      "A. Y. Wu and S. K. Bhaskar and A. Rosenfeld"
+, title =       "Computation of geometric properties from the medial axis transform in {$O(n \log n)$} time"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      34
+, year =        1986
+, pages =       "76--92"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{whr-tsuq-80
-, author =	"A. Y. Wu and T. H. Hong and A. Rosenfeld"
-, title =	"Threshold selection using quadtrees"
-, type =	"Report"
-, number =	"TR-886"
-, institution =	"Dept. Comput. Sci., Univ. Maryland"
-, address =	"College Park, MD"
-, year =	1980
+, author =      "A. Y. Wu and T. H. Hong and A. Rosenfeld"
+, title =       "Threshold selection using quadtrees"
+, type =        "Report"
+, number =      "TR-886"
+, institution = "Dept. Comput. Sci., Univ. Maryland"
+, address =     "College Park, MD"
+, year =        1980
 }
 
 @incollection{w-filap-94
-, author =	"Kevin Wu"
-, title =	"Fast Inversion of Length- and Angle-Preserving Matrices"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"199--206"
-, keywords =	"eigenvalue, 4x4 matrix"
-, update =	"94.09 heckbert"
-, annote =	"Presents optimized formulas and code to compute the
+, author =      "Kevin Wu"
+, title =       "Fast Inversion of Length- and Angle-Preserving Matrices"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "199--206"
+, keywords =    "eigenvalue, 4x4 matrix"
+, update =      "94.09 heckbert"
+, annote =      "Presents optimized formulas and code to compute the
 inverse of a 4x4 matrix that is known to be length- and angle-preserving
 (consisting of only rotation, translation, and uniform scaling). Contains C
 code."
 }
 
 @phdthesis{w-pop-87
-, author =	"Peter Yick Fai Wu"
-, title =	"Polygon Overlay in {Prolog}"
-, school =	"Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
-, year =	1987
-, keywords =	"doctoral thesis, intersection, artificial intelligence"
-, update =	"93.09 franklin"
+, author =      "Peter Yick Fai Wu"
+, title =       "Polygon Overlay in {Prolog}"
+, school =      "Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute"
+, year =        1987
+, keywords =    "doctoral thesis, intersection, artificial intelligence"
+, update =      "93.09 franklin"
 }
 
 @article{wf-lpacm-90
-, author =	"Peter Y. F. Wu and Wm. Randolph Franklin"
-, title =	"A Logic Programming Approach to Cartographic Map Overlay"
-, journal =	"Canadian Computational Intelligence Journal"
-, volume =	6
-, number =	2
-, year =	1990
-, pages =	"61--70"
-, keywords =	"artificial intelligence, intersection"
-, update =	"93.09 franklin"
+, author =      "Peter Y. F. Wu and Wm. Randolph Franklin"
+, title =       "A Logic Programming Approach to Cartographic Map Overlay"
+, journal =     "Canadian Computational Intelligence Journal"
+, volume =      6
+, number =      2
+, year =        1990
+, pages =       "61--70"
+, keywords =    "artificial intelligence, intersection"
+, update =      "93.09 franklin"
 }
 
 @article{w-dpmtp-78
-, author =	"W. Wu"
-, title =	"On the decision problem and mechanization of theorem proving in elementary geometry"
-, journal =	"Sci. Sinica"
-, volume =	21
-, year =	1978
-, pages =	"150--172"
-, update =	"98.03 bibrelex"
+, author =      "W. Wu"
+, title =       "On the decision problem and mechanization of theorem proving in elementary geometry"
+, journal =     "Sci. Sinica"
+, volume =      21
+, year =        1978
+, pages =       "150--172"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{w-sramt-84
-, author =	"W. Wu"
-, title =	"Some recent advances in mechanical theorem proving of geometries"
-, editor =	"W. W. Bledsoe"
-, booktitle =	"Theorem Proving: After 25 Years"
-, publisher =	"American Mathematical Society"
-, year =	1984
-, update =	"98.03 bibrelex"
+, author =      "W. Wu"
+, title =       "Some recent advances in mechanical theorem proving of geometries"
+, editor =      "W. W. Bledsoe"
+, booktitle =   "Theorem Proving: After 25 Years"
+, publisher =   "American Mathematical Society"
+, year =        1984
+, update =      "98.03 bibrelex"
 }
 
 @mastersthesis{w-rsbtt-84
-, author =	"W. C. Wu"
-, title =	"A robust simulation-before-test technique for nonlinear analog fault diagnosis"
-, school =	"Electrical Engineering Department, University of Maryland"
-, year =	1984
-, keywords =	"master thesis"
-, update =	"98.03 bibrelex"
+, author =      "W. C. Wu"
+, title =       "A robust simulation-before-test technique for nonlinear analog fault diagnosis"
+, school =      "Electrical Engineering Department, University of Maryland"
+, year =        1984
+, keywords =    "master thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{w-bpmtp-84
-, author =	"W. T. Wu"
-, title =	"Basic Principles of Mechanical Theorem Proving in Elementary Geometrics"
-, journal =	"J. Syst. Sci. Math. Sci."
-, volume =	4
-, year =	1984
-, pages =	"207--235"
-, update =	"98.03 bibrelex"
+, author =      "W. T. Wu"
+, title =       "Basic Principles of Mechanical Theorem Proving in Elementary Geometrics"
+, journal =     "J. Syst. Sci. Math. Sci."
+, volume =      4
+, year =        1984
+, pages =       "207--235"
+, update =      "98.03 bibrelex"
 }
 
 @article{w-tl-62
-, author =	"W.-T. Wu"
-, title =	"On a theorem of {Leray}"
-, journal =	"Chinese Math."
-, volume =	2
-, year =	1962
-, pages =	"398--410"
-, update =	"98.03 bibrelex"
+, author =      "W.-T. Wu"
+, title =       "On a theorem of {Leray}"
+, journal =     "Chinese Math."
+, volume =      2
+, year =        1962
+, pages =       "398--410"
+, update =      "98.03 bibrelex"
 }
 
 @incollection{w-ltsbv-92
-, author =	"X. Wu"
-, title =	"A linear-time simple bounding volume algorithm"
-, editor =	"D. Kirk"
-, booktitle =	"Graphics Gems III"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1992
-, update =	"98.07 bibrelex"
+, author =      "X. Wu"
+, title =       "A linear-time simple bounding volume algorithm"
+, editor =      "D. Kirk"
+, booktitle =   "Graphics Gems III"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1992
+, update =      "98.07 bibrelex"
 }
 
 @article{w-oqms-91
-, author =	"X. Wu"
-, title =	"Optimal Quantization by Matrix Searching"
-, journal =	"J. Algorithms"
-, volume =	12
-, year =	1991
-, pages =	"663--673"
-, update =	"98.03 bibrelex"
+, author =      "X. Wu"
+, title =       "Optimal Quantization by Matrix Searching"
+, journal =     "J. Algorithms"
+, volume =      12
+, year =        1991
+, pages =       "663--673"
+, update =      "98.03 bibrelex"
 }
 
 @article{wr-dsge-89
-, author =	"X. Wu and J. G. Rokne"
-, title =	"Double-step generation of ellipses"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	9
-, year =	1989
-, pages =	"56--69"
-, keywords =	"design of algorithms, computer graphics, discrete geometry, approximation, incrementation, average-case analysis, curves, two-dimensional"
+, author =      "X. Wu and J. G. Rokne"
+, title =       "Double-step generation of ellipses"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      9
+, year =        1989
+, pages =       "56--69"
+, keywords =    "design of algorithms, computer graphics, discrete geometry, approximation, incrementation, average-case analysis, curves, two-dimensional"
 }
 
 @article{wr-dsigl-87
-, author =	"X. Wu and J. G. Rokne"
-, title =	"Double-step incremental generation of lines and circles"
-, journal =	"Comput. Vision Graph. Image Process."
-, volume =	37
-, year =	1987
-, pages =	"331--344"
-, keywords =	"design of algorithms, computer graphics, discrete geometry, approximation, incrementation, average-case analysis, lines, circles, two-dimensional"
+, author =      "X. Wu and J. G. Rokne"
+, title =       "Double-step incremental generation of lines and circles"
+, journal =     "Comput. Vision Graph. Image Process."
+, volume =      37
+, year =        1987
+, pages =       "331--344"
+, keywords =    "design of algorithms, computer graphics, discrete geometry, approximation, incrementation, average-case analysis, lines, circles, two-dimensional"
 }
 
 @article{wr-pdcc-89
-, author =	"X. Wu and J. G. Rokne"
-, title =	"On properties of discretized convex curves"
-, journal =	"IEEE Trans. Pattern Anal. Mach. Intell."
-, volume =	11
-, year =	1989
-, pages =	"217--223"
-, keywords =	"discrete geometry, approximation, incrementation, curves, two-dimensional, convex"
+, author =      "X. Wu and J. G. Rokne"
+, title =       "On properties of discretized convex curves"
+, journal =     "IEEE Trans. Pattern Anal. Mach. Intell."
+, volume =      11
+, year =        1989
+, pages =       "217--223"
+, keywords =    "discrete geometry, approximation, incrementation, curves, two-dimensional, convex"
 }
 
 @article{wwsw-rspms-87
-, author =	"Y.-F. Wu and P. Widmayer and M. D. F. Schlag and C. K. Wong"
-, title =	"Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-36"
-, number =	3
-, month =	mar
-, year =	1987
-, update =	"93.09 milone+mitchell"
+, author =      "Y.-F. Wu and P. Widmayer and M. D. F. Schlag and C. K. Wong"
+, title =       "Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-36"
+, number =      3
+, month =       mar
+, year =        1987
+, update =      "93.09 milone+mitchell"
 }
 
 @article{w-cbdd-65
-, author =	"A. D. Wyner"
-, title =	"Capabilities of bounded discrepancy decoding"
-, journal =	"AT\&T Tech. J."
-, volume =	44
-, year =	1965
-, pages =	"1061--1122"
-, update =	"98.03 bibrelex"
+, author =      "A. D. Wyner"
+, title =       "Capabilities of bounded discrepancy decoding"
+, journal =     "AT\&T Tech. J."
+, volume =      44
+, year =        1965
+, pages =       "1061--1122"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{wm-sptrr-93
-, author =	"E. Wynters and Joseph S. B. Mitchell"
-, title =	"Shortest paths for a two-robot rendez-vous"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"216--221"
-, cites =	"gm-osacv-87, m-lpltw-84, mrw-mlpop-90, mw-omcpo-90i, psr-cgcsp-89, ps-cgi-85, rs-spesp-85, w-cvgnl-85, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
+, author =      "E. Wynters and Joseph S. B. Mitchell"
+, title =       "Shortest paths for a two-robot rendez-vous"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "216--221"
+, cites =       "gm-osacv-87, m-lpltw-84, mrw-mlpop-90, mw-omcpo-90i, psr-cgcsp-89, ps-cgi-85, rs-spesp-85, w-cvgnl-85, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 93.09 milone+mitchell"
 }
 
 @phdthesis{w-ompmp-91
-, author =	"E. L. Wynters"
-, title =	"Optimal motion planning for multiple point robots in the plane"
-, type =	"Ph.{D}. Thesis"
-, school =	"App. Math., Cornell Univ."
-, address =	"Ithaca, NY"
-, year =	1991
-, keywords =	"doctoral thesis"
+, author =      "E. L. Wynters"
+, title =       "Optimal motion planning for multiple point robots in the plane"
+, type =        "Ph.{D}. Thesis"
+, school =      "App. Math., Cornell Univ."
+, address =     "Ithaca, NY"
+, year =        1991
+, keywords =    "doctoral thesis"
 }
 
 @inproceedings{x-gachr-96
-, author =	"Patrick G. Xavier"
-, title =	"A Generic Algorithm for Constructing Hierarchical Representations of Geometric Objects"
-, booktitle =	"Proc. IEEE Internat. Conf. Robot. Autom."
-, year =	1996
-, pages =	"3644--3651"
-, keywords =	"BV trees, bounding volume trees, bottom-up construction, collision detection"
-, update =	"98.03 mitchell"
+, author =      "Patrick G. Xavier"
+, title =       "A Generic Algorithm for Constructing Hierarchical Representations of Geometric Objects"
+, booktitle =   "Proc. IEEE Internat. Conf. Robot. Autom."
+, year =        1996
+, pages =       "3644--3651"
+, keywords =    "BV trees, bounding volume trees, bottom-up construction, collision detection"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{xv-dvdsp-96
-, author =	"J. Xia and A. Varshney"
-, title =	"Dynamic View-Dependent Simplification for Polygonal Models"
-, booktitle =	"IEEE Visualization '96 Proceedings"
-, publisher =	"ACM/SIGGRAPH Press"
-, address =	"San Francisco, CA"
-, month =	oct
-, year =	1996
-, pages =	"327--334"
-, update =	"98.03 mitchell"
+, author =      "J. Xia and A. Varshney"
+, title =       "Dynamic View-Dependent Simplification for Polygonal Models"
+, booktitle =   "IEEE Visualization '96 Proceedings"
+, publisher =   "ACM/SIGGRAPH Press"
+, address =     "San Francisco, CA"
+, month =       oct
+, year =        1996
+, pages =       "327--334"
+, update =      "98.03 mitchell"
 }
 
 @article{xev-artld-97
-, author =	"J. C. Xia and J. El-Sana and A. Varshney"
-, title =	"Adaptive Real-Time Level-of-Detail Based Rendering for Polygonal Meshes"
-, journal =	"IEEE Trans. Visualizat. Comput. Graph."
-, volume =	3
-, number =	2
-, month =	apr
-, year =	1997
-, pages =	"171--183"
-, update =	"97.07 held"
+, author =      "J. C. Xia and J. El-Sana and A. Varshney"
+, title =       "Adaptive Real-Time Level-of-Detail Based Rendering for Polygonal Meshes"
+, journal =     "IEEE Trans. Visualizat. Comput. Graph."
+, volume =      3
+, number =      2
+, month =       apr
+, year =        1997
+, pages =       "171--183"
+, update =      "97.07 held"
 }
 
 @inproceedings{xhm-fesps-99
-, author =	"Xinyu Xiang and Martin Held and Joseph S. B. Mitchell"
-, title =	"Fast and Effective Stripification of Polygonal Surface Models"
-, booktitle =	"ACM Sympos. Interactive 3D Graphics"
-, year =	1999
-, update =	"01.07 orourke"
+, author =      "Xinyu Xiang and Martin Held and Joseph S. B. Mitchell"
+, title =       "Fast and Effective Stripification of Polygonal Surface Models"
+, booktitle =   "ACM Sympos. Interactive 3D Graphics"
+, year =        1999
+, update =      "01.07 orourke"
 }
 
 @phdthesis{x-mwtpp-92
-, author =	"Y. Xu"
-, title =	"Minimum weight triangulation problem of a planar point set"
-, school =	"Institute of Applied Mathematics, Academia Sinica"
-, address =	"Beijing, China"
-, year =	1992
-, keywords =	"doctoral thesis"
-, update =	"98.03 bibrelex"
+, author =      "Y. Xu"
+, title =       "Minimum weight triangulation problem of a planar point set"
+, school =      "Institute of Applied Mathematics, Academia Sinica"
+, address =     "Beijing, China"
+, year =        1992
+, keywords =    "doctoral thesis"
+, update =      "98.03 bibrelex"
 }
 
 @article{x-dis-90
-, author =	"Zhiming Xu"
-, title =	"Discrete Interpolation Surface"
-, journal =	"Journal of Computer Science and Technology"
-, volume =	5
-, number =	4
-, month =	oct
-, year =	1990
-, pages =	"329--332"
-, keywords =	"discrete interpolation surface, Voronoi diagram, scattered interpolation surface"
-, abstract =	"In this paper, a method to construct a surface with
-		 point interpolation and normal interpolation is
-		 presented. An algorithm to construct the discrete
-		 interpolation is also presented, which has the time
-		 complexity O(Nlog N), where N in the number of
-		 scattered points. (Author abstract) 6 Refs."
+, author =      "Zhiming Xu"
+, title =       "Discrete Interpolation Surface"
+, journal =     "Journal of Computer Science and Technology"
+, volume =      5
+, number =      4
+, month =       oct
+, year =        1990
+, pages =       "329--332"
+, keywords =    "discrete interpolation surface, Voronoi diagram, scattered interpolation surface"
+, abstract =    "In this paper, a method to construct a surface with
+                 point interpolation and normal interpolation is
+                 presented. An algorithm to construct the discrete
+                 interpolation is also presented, which has the time
+                 complexity O(Nlog N), where N in the number of
+                 scattered points. (Author abstract) 6 Refs."
 }
 
 @article{xs-rrppu-95
-, author =	"Z. Xu and M. Suk"
-, title =	"Representation and reconstruction of polygons and polyhedra using hierarchical extended {Gaussian} images"
-, journal =	"Ann. Math. Artif. Intell."
-, volume =	13
-, year =	1995
-, pages =	"377--400"
-, keywords =	"matching, shape recognition, vision"
-, update =	"98.07 bibrelex, 95.09 mitchell"
+, author =      "Z. Xu and M. Suk"
+, title =       "Representation and reconstruction of polygons and polyhedra using hierarchical extended {Gaussian} images"
+, journal =     "Ann. Math. Artif. Intell."
+, volume =      13
+, year =        1995
+, pages =       "377--400"
+, keywords =    "matching, shape recognition, vision"
+, update =      "98.07 bibrelex, 95.09 mitchell"
 }
 
 @inproceedings{xrp-ptdae-92
-, author =	"G. L. Xue and J. B. Rosen and P. M. Pardalos"
-, title =	"A Polynomial Time Dual Algorithm for the {Euclidean} Multifacility Location Problem"
-, booktitle =	"INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION"
-, year =	1992
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "G. L. Xue and J. B. Rosen and P. M. Pardalos"
+, title =       "A Polynomial Time Dual Algorithm for the {Euclidean} Multifacility Location Problem"
+, booktitle =   "INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION"
+, year =        1992
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @techreport{yd-cgalr-88
-, author =	"Y. Yacoob and L. Davis"
-, title =	"Computational ground and airborne localization over rough terrain"
-, type =	"Technical {Report}"
-, number =	"CS-TR-2788"
-, institution =	"University of Maryland"
-, year =	1988
-, update =	"97.11 bibrelex"
+, author =      "Y. Yacoob and L. Davis"
+, title =       "Computational ground and airborne localization over rough terrain"
+, type =        "Technical {Report}"
+, number =      "CS-TR-2788"
+, institution = "University of Maryland"
+, year =        1988
+, update =      "97.11 bibrelex"
 }
 
 @article{yr-vcewc-96
-, author =	"R. Yagel and W. Ray"
-, title =	"Visibility computations for efficient walkthrough of complex environments"
-, journal =	"Presence"
-, volume =	5
-, number =	1
-, year =	1996
-, pages =	"1--16"
-, update =	"98.07 bibrelex"
+, author =      "R. Yagel and W. Ray"
+, title =       "Visibility computations for efficient walkthrough of complex environments"
+, journal =     "Presence"
+, volume =      5
+, number =      1
+, year =        1996
+, pages =       "1--16"
+, update =      "98.07 bibrelex"
 }
 
 @book{y-snegi-79
-, author =	"I. M. Yaglom"
-, title =	"A simple non-euclidean geometry and its physical basis"
-, publisher =	"Springer-Verlag"
-, year =	1979
-, update =	"98.03 bibrelex"
+, author =      "I. M. Yaglom"
+, title =       "A simple non-euclidean geometry and its physical basis"
+, publisher =   "Springer-Verlag"
+, year =        1979
+, update =      "98.03 bibrelex"
 }
 
 @book{y-gt-61
-, author =	"I. M. Yaglom"
-, title =	"Geometric Transformations"
-, volume =	1
-, publisher =	"Random House"
-, year =	1961
-, precedes =	"y-gt-68"
-, update =	"97.11 bibrelex"
+, author =      "I. M. Yaglom"
+, title =       "Geometric Transformations"
+, volume =      1
+, publisher =   "Random House"
+, year =        1961
+, precedes =    "y-gt-68"
+, update =      "97.11 bibrelex"
 }
 
 @book{y-gt-68
-, author =	"I. M. Yaglom"
-, title =	"Geometric Transformations"
-, volume =	2
-, publisher =	"Random House"
-, year =	1968
-, succeeds =	"y-gt-61"
-, update =	"97.11 bibrelex"
+, author =      "I. M. Yaglom"
+, title =       "Geometric Transformations"
+, volume =      2
+, publisher =   "Random House"
+, year =        1968
+, succeeds =    "y-gt-61"
+, update =      "97.11 bibrelex"
 }
 
 @book{yb-cf-61
-, author =	"I. M. Yaglom and V. G. Bolyanski"
-, title =	"Convex Figures"
-, publisher =	"English Translation, Holt, Rinehart and Winston"
-, address =	"New York, NY"
-, year =	1961
+, author =      "I. M. Yaglom and V. G. Bolyanski"
+, title =       "Convex Figures"
+, publisher =   "English Translation, Holt, Rinehart and Winston"
+, address =     "New York, NY"
+, year =        1961
 }
 
 @inproceedings{ysi-emamc-96
-, author =	"Atsushi Yamada and Kenji Shimada and Takayuki Iboh"
-, title =	"Energy-minimizing approach to meshing curved wire-frame models"
-, booktitle =	"Proc. 5th International Meshing Roundtable"
-, publisher =	"Sandia National Laboratories"
-, address =	"PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
-, year =	1996
-, pages =	"179--191"
-, note =	"Also Sand. Report 96-2301"
-, url =	"http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
-, update =	"97.03 samitchell"
+, author =      "Atsushi Yamada and Kenji Shimada and Takayuki Iboh"
+, title =       "Energy-minimizing approach to meshing curved wire-frame models"
+, booktitle =   "Proc. 5th International Meshing Roundtable"
+, publisher =   "Sandia National Laboratories"
+, address =     "PO Box 5800, MS 0441, Albuquerque, NM, 87185-0441"
+, year =        1996
+, pages =       "179--191"
+, note =        "Also Sand. Report 96-2301"
+, url = "http://sass577.endo.sandia.gov:80/9225/Personnel/samitch/roundtable96/accept-list.html"
+, update =      "97.03 samitchell"
 }
 
 @article{y-uaipu-85
-, author =	"F. Yamaguchi"
-, title =	"A unified approach to interference problems using a triangle processor"
-, journal =	"Comput. Graph."
-, volume =	19
-, number =	3
-, year =	1985
-, pages =	"141--149"
-, note =	"Proc. SIGGRAPH '85"
+, author =      "F. Yamaguchi"
+, title =       "A unified approach to interference problems using a triangle processor"
+, journal =     "Comput. Graph."
+, volume =      19
+, number =      3
+, year =        1985
+, pages =       "141--149"
+, note =        "Proc. SIGGRAPH '85"
 }
 
 % ### others?
 @inproceedings{y-cfdgp-89
-, author =	"F. Yamaguchi"
-, title =	"The Completely Four-Dimensional Geometric Processing Based on the $4 \times 4$ Determinant Method"
-, editor =	"L. Yonchun and others"
-, booktitle =	"Proc. Internat. Conf. on Computer-Aided Design and Computer Graphics"
-, publisher =	"Internat. Academic Publ."
-, address =	"Beijing, China"
-, month =	aug
-, year =	1989
-, pages =	"183--188"
-, update =	"93.09 held"
+, author =      "F. Yamaguchi"
+, title =       "The Completely Four-Dimensional Geometric Processing Based on the $4 \times 4$ Determinant Method"
+, editor =      "L. Yonchun and others"
+, booktitle =   "Proc. Internat. Conf. on Computer-Aided Design and Computer Graphics"
+, publisher =   "Internat. Academic Publ."
+, address =     "Beijing, China"
+, month =       aug
+, year =        1989
+, pages =       "183--188"
+, update =      "93.09 held"
 }
 
 @article{y-tf4dm-87
-, author =	"Fujio Yamaguchi"
-, title =	"Theoretical foundations for the $4 \times 4$ determinant method in computer graphics and geometric modelling"
-, journal =	"Visual Comput."
-, volume =	3
-, number =	2
-, month =	aug
-, year =	1987
-, pages =	"88--97"
-, keywords =	"interference problems, geometric modelling, solid modelling, hidden line, surface detections, matrix, matrices"
+, author =      "Fujio Yamaguchi"
+, title =       "Theoretical foundations for the $4 \times 4$ determinant method in computer graphics and geometric modelling"
+, journal =     "Visual Comput."
+, volume =      3
+, number =      2
+, month =       aug
+, year =        1987
+, pages =       "88--97"
+, keywords =    "interference problems, geometric modelling, solid modelling, hidden line, surface detections, matrix, matrices"
 }
 
 @article{yn-sbgtc-97
-, author =	"F. Yamaguchi and M. Niizeki"
-, title =	"Some Basic Geometric Test Conditions in Terms of Pluecker Coordinates and Pluecker Coefficients"
-, journal =	"Visual Comput."
-, volume =	13
-, number =	1
-, year =	1997
-, pages =	"29--41"
-, update =	"97.03 held"
+, author =      "F. Yamaguchi and M. Niizeki"
+, title =       "Some Basic Geometric Test Conditions in Terms of Pluecker Coordinates and Pluecker Coefficients"
+, journal =     "Visual Comput."
+, volume =      13
+, number =      1
+, year =        1997
+, pages =       "29--41"
+, update =      "97.03 held"
 }
 
 @article{yt-uabso-84
-, author =	"F. Yamaguchi and T. Tokieda"
-, title =	"A Unified Algorithm for {Boolean} Shape Operations"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	4
-, month =	jun
-, year =	1984
-, pages =	"24--27"
-, annote =	"Intersection etc. of polyhedra. Faces are triangulated
-		 and winged edge data structure used. Face triangulation
-		 algorithm: take concave vertex and cut adjacent ear(s).
-		 Repeat for all concave vertices."
+, author =      "F. Yamaguchi and T. Tokieda"
+, title =       "A Unified Algorithm for {Boolean} Shape Operations"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      4
+, month =       jun
+, year =        1984
+, pages =       "24--27"
+, annote =      "Intersection etc. of polyhedra. Faces are triangulated
+                 and winged edge data structure used. Face triangulation
+                 algorithm: take concave vertex and cut adjacent ear(s).
+                 Repeat for all concave vertices."
 }
 
 @article{ytsn-aefcb-93
-, author =	"F. Yamaguchi and K. Toshimitsu and H. Sato and J. Nakagawa"
-, title =	"An Adaptive, Error-free Computation Based on the $4 \times 4$ Determinant Method"
-, journal =	"Visual Comput."
-, volume =	9
-, number =	4
-, month =	jan
-, year =	1993
-, pages =	"173--181"
-, keywords =	"robustness, numerical stability"
-, update =	"93.09 held"
+, author =      "F. Yamaguchi and K. Toshimitsu and H. Sato and J. Nakagawa"
+, title =       "An Adaptive, Error-free Computation Based on the $4 \times 4$ Determinant Method"
+, journal =     "Visual Comput."
+, volume =      9
+, number =      4
+, month =       jan
+, year =        1993
+, pages =       "173--181"
+, keywords =    "robustness, numerical stability"
+, update =      "93.09 held"
 }
 
 @inproceedings{yk-lsdso-83
-, author =	"K. Yamaguchi and T. L. Kunii"
-, title =	"A layerded data structure for an octree model"
-, booktitle =	"Proc. IEEE CAPAIDIM '83"
-, site =	"Pasadena, CA"
-, year =	1983
-, update =	"97.11 bibrelex"
+, author =      "K. Yamaguchi and T. L. Kunii"
+, title =       "A layerded data structure for an octree model"
+, booktitle =   "Proc. IEEE CAPAIDIM '83"
+, site =        "Pasadena, CA"
+, year =        1983
+, update =      "97.11 bibrelex"
 }
 
 @article{ykf-ordsa-84
-, author =	"K. Yamaguchi and T. L. Kunii and K. Fujimura"
-, title =	"Octree-related data structures and algorithms"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	4
-, month =	jan
-, year =	1984
-, pages =	"53--59"
-, update =	"97.11 bibrelex"
+, author =      "K. Yamaguchi and T. L. Kunii and K. Fujimura"
+, title =       "Octree-related data structures and algorithms"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      4
+, month =       jan
+, year =        1984
+, pages =       "53--59"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{y-cddp-94
-, author =	"P. Yamamoto"
-, title =	"Computing the Dent Diameter of a Polygon"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"116--121"
-, cites =	"bs-parpv-92, ci-tpdc-83, cr-occop-89a, b-rld-91, dls-oaclc-89, ds-ehlec-85, k-ealdp-89, lpsssstwy-clcsp-87, ns-oarlc-91, ns-crldp-91, srw-gsv-91, s-mlppr-87, wy-dsv-93, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "P. Yamamoto"
+, title =       "Computing the Dent Diameter of a Polygon"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "116--121"
+, cites =       "bs-parpv-92, ci-tpdc-83, cr-occop-89a, b-rld-91, dls-oaclc-89, ds-ehlec-85, k-ealdp-89, lpsssstwy-clcsp-87, ns-oarlc-91, ns-crldp-91, srw-gsv-91, s-mlppr-87, wy-dsv-93, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{ykii-avoll-88
-, author =	"P. Yamamoto and K. Kato and K. Imai and H. Imai"
-, title =	"Algorithms for vertical and orthogonal {$L_{1}$} linear approximation of points"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"352--361"
-, cites =	"as-lce-73, b-lbact-83, c-lp-83, csy-khrp-87, eg-tsa-86, ew-cbtda-86, elss-dgpps-73, iky-ltall-87, lw-gcslp-86, m-ltalp-83, m-lpltw-84, mn-salfl-80, sw-olla-87, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "P. Yamamoto and K. Kato and K. Imai and H. Imai"
+, title =       "Algorithms for vertical and orthogonal {$L_{1}$} linear approximation of points"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "352--361"
+, cites =       "as-lce-73, b-lbact-83, c-lp-83, csy-khrp-87, eg-tsa-86, ew-cbtda-86, elss-dgpps-73, iky-ltall-87, lw-gcslp-86, m-ltalp-83, m-lpltw-84, mn-salfl-80, sw-olla-87, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{yusk-smipr-97
-, author =	"M. Yamashita and H. Umemoto and I. Suzuki and T. Kameda"
-, title =	"Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers"
-, booktitle =	"Proc. 13th Annu. ACM Sympos. Comput. Geom."
-, year =	1997
-, pages =	"448--450"
-, cites =	"csy-smico-95, ik-tgp-91, llglm-futwo-97, mhgjp-csg-88, o-agta-87, p-bbcra-96, p-peg-76, ssy-ssp-90, sy-smipr-92, u-sp1s-95, ZZZ"
-, update =	"98.07 bibrelex, 97.07 efrat"
+, author =      "M. Yamashita and H. Umemoto and I. Suzuki and T. Kameda"
+, title =       "Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers"
+, booktitle =   "Proc. 13th Annu. ACM Sympos. Comput. Geom."
+, year =        1997
+, pages =       "448--450"
+, cites =       "csy-smico-95, ik-tgp-91, llglm-futwo-97, mhgjp-csg-88, o-agta-87, p-bbcra-96, p-peg-76, ssy-ssp-90, sy-smipr-92, u-sp1s-95, ZZZ"
+, update =      "98.07 bibrelex, 97.07 efrat"
 }
 
 @inproceedings{yl-olpar-82
-, author =	"B. Yamnitsky and L. A. Levin"
-, title =	"An old linear programming algorithm runs in polynomial time"
-, booktitle =	"Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1982
-, pages =	"327--328"
+, author =      "B. Yamnitsky and L. A. Levin"
+, title =       "An old linear programming algorithm runs in polynomial time"
+, booktitle =   "Proc. 23rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1982
+, pages =       "327--328"
 }
 
 @inproceedings{y-csosm-92
-, author =	"H. H. Yanasse"
-, title =	"Cutting stock: {Open} stack minimization"
-, booktitle =	"Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
-, site =	"Kyoto, Japan"
-, year =	1992
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "H. H. Yanasse"
+, title =       "Cutting stock: {Open} stack minimization"
+, booktitle =   "Proc. 5th Franco-Japanese Days on Combinatorics and Optimization"
+, site =        "Kyoto, Japan"
+, year =        1992
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{y-bsmwt-95
-, author =	"B. Yang"
-, title =	"A better subgraph of the minimum weight triangulation"
-, booktitle =	"Proc. Internat. Conf. Comput. Combinatorics"
-, year =	1995
-, pages =	"452--455"
-, update =	"97.11 bibrelex"
+, author =      "B. Yang"
+, title =       "A better subgraph of the minimum weight triangulation"
+, booktitle =   "Proc. Internat. Conf. Comput. Combinatorics"
+, year =        1995
+, pages =       "452--455"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{yxy-cdapp-94
-, author =	"B.-T. Yang and Y.-F. Xu and Z.-Y. You"
-, title =	"A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"423--427"
-, update =	"99.11 bibrelex, 97.11 bibrelex, 96.05 mitchell"
+, author =      "B.-T. Yang and Y.-F. Xu and Z.-Y. You"
+, title =       "A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "423--427"
+, update =      "99.11 bibrelex, 97.11 bibrelex, 96.05 mitchell"
 }
 
 @techreport{ylw-rpror-92
-, author =	"C. Yang and D. Lee and C. Wong"
-, title =	"Rectilinear Paths Among Rectilinear Obstacles Revisited"
-, institution =	"Dept. of EE \& CS, Northwestern Univ."
-, year =	1992
-, precedes =	"ylw-rppro-95"
-, update =	"96.05 mitchell"
+, author =      "C. Yang and D. Lee and C. Wong"
+, title =       "Rectilinear Paths Among Rectilinear Obstacles Revisited"
+, institution = "Dept. of EE \& CS, Northwestern Univ."
+, year =        1992
+, precedes =    "ylw-rppro-95"
+, update =      "96.05 mitchell"
 }
 
 @article{yl-nannp-79
-, author =	"C. C. Yang and D. T. Lee"
-, title =	"A note on the all nearest-neighbor problem for convex polygons"
-, journal =	"Inform. Process. Lett."
-, volume =	8
-, year =	1979
-, pages =	"193--194"
+, author =      "C. C. Yang and D. T. Lee"
+, title =       "A note on the all nearest-neighbor problem for convex polygons"
+, journal =     "Inform. Process. Lett."
+, volume =      8
+, year =        1979
+, pages =       "193--194"
 }
 
 @inproceedings{ycl-srpaw-89
-, author =	"C. D. Yang and T. H. Chen and D. T. Lee"
-, title =	"Shortest rectilinear path among weighted rectangles"
-, booktitle =	"Proceedings of the International Workshop on Discrete Algorithms and Complexity"
-, publisher =	"Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
-, address =	"Fukuoka, Japan"
-, year =	1989
-, pages =	"1--8"
-, keywords =	"weighted regions, segment trees, plane sweep"
-, update =	"95.09 mitchell"
+, author =      "C. D. Yang and T. H. Chen and D. T. Lee"
+, title =       "Shortest rectilinear path among weighted rectangles"
+, booktitle =   "Proceedings of the International Workshop on Discrete Algorithms and Complexity"
+, publisher =   "Institute of Electronics, Information and Communication Engineers (IEICE), Tokyo"
+, address =     "Fukuoka, Japan"
+, year =        1989
+, pages =       "1--8"
+, keywords =    "weighted regions, segment trees, plane sweep"
+, update =      "95.09 mitchell"
 }
 
 @article{ycl-srpwr-90
-, author =	"C. D. Yang and T. H. Chen and D. T. Lee"
-, title =	"Shortest rectilinear paths among weighted rectangles"
-, journal =	"J. Inform. Proc."
-, volume =	13
-, number =	4
-, year =	1990
-, pages =	"456--462"
-, update =	"98.03 bibrelex"
+, author =      "C. D. Yang and T. H. Chen and D. T. Lee"
+, title =       "Shortest rectilinear paths among weighted rectangles"
+, journal =     "J. Inform. Proc."
+, volume =      13
+, number =      4
+, year =        1990
+, pages =       "456--462"
+, update =      "98.03 bibrelex"
 }
 
 @techreport{ylw-bdpot-91
-, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
-, title =	"On bends and distances of paths among obstacles in two-layer interconnection model"
-, type =	"Technical {Report}"
-, institution =	"Northwestern University"
-, year =	1991
-, update =	"96.05 mitchell, 93.09 milone+mitchell"
+, author =      "C. D. Yang and D. T. Lee and C. K. Wong"
+, title =       "On bends and distances of paths among obstacles in two-layer interconnection model"
+, type =        "Technical {Report}"
+, institution = "Northwestern University"
+, year =        1991
+, update =      "96.05 mitchell, 93.09 milone+mitchell"
 }
 
 @article{ylw-bdpot-94
-, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
-, title =	"On bends and distances of paths among obstacles in two-layer interconnection model"
-, journal =	"IEEE Trans. Comput."
-, volume =	43
-, number =	6
-, year =	1994
-, pages =	"711--724"
-, succeeds =	"ylw-bdpot-91"
-, update =	"96.05 mitchell"
+, author =      "C. D. Yang and D. T. Lee and C. K. Wong"
+, title =       "On bends and distances of paths among obstacles in two-layer interconnection model"
+, journal =     "IEEE Trans. Comput."
+, volume =      43
+, number =      6
+, year =        1994
+, pages =       "711--724"
+, succeeds =    "ylw-bdpot-91"
+, update =      "96.05 mitchell"
 }
 
 @inproceedings{ylw-blrpg-91
-, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
-, title =	"On bends and lengths of rectilinear paths: a graph-theoretic approach"
-, booktitle =	"Proc. 2nd Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	519
-, publisher =	"Springer-Verlag"
-, year =	1991
-, pages =	"320--330"
-, precedes =	"ylw-blrpg-92"
+, author =      "C. D. Yang and D. T. Lee and C. K. Wong"
+, title =       "On bends and lengths of rectilinear paths: a graph-theoretic approach"
+, booktitle =   "Proc. 2nd Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      519
+, publisher =   "Springer-Verlag"
+, year =        1991
+, pages =       "320--330"
+, precedes =    "ylw-blrpg-92"
 }
 
 @article{ylw-blrpg-92
-, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
-, title =	"On bends and lengths of rectilinear paths: a graph theoretic approach"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	2
-, number =	1
-, year =	1992
-, pages =	"61--74"
-, keywords =	"path planning, shortest path, minimum-bend path, rectilinear obstacles, graph-theoretic approach"
-, succeeds =	"ylw-blrpg-91"
+, author =      "C. D. Yang and D. T. Lee and C. K. Wong"
+, title =       "On bends and lengths of rectilinear paths: a graph theoretic approach"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      2
+, number =      1
+, year =        1992
+, pages =       "61--74"
+, keywords =    "path planning, shortest path, minimum-bend path, rectilinear obstacles, graph-theoretic approach"
+, succeeds =    "ylw-blrpg-91"
 }
 
 @techreport{ylw-ptfrp-92
-, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
-, title =	"Problem transformation for finding rectilinear paths among obstacles in two-layer interconnection model"
-, type =	"Technical {Report}"
-, institution =	"Northwestern University"
-, year =	1992
-, update =	"96.05 mitchell, 93.09 milone+mitchell"
-, annote =	"This is under revision now (Jan, 1996) for a journal."
+, author =      "C. D. Yang and D. T. Lee and C. K. Wong"
+, title =       "Problem transformation for finding rectilinear paths among obstacles in two-layer interconnection model"
+, type =        "Technical {Report}"
+, institution = "Northwestern University"
+, year =        1992
+, update =      "96.05 mitchell, 93.09 milone+mitchell"
+, annote =      "This is under revision now (Jan, 1996) for a journal."
 }
 
 @techreport{ylw-rppro-92
-, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
-, title =	"Rectilinear paths problems among rectilinear obstacles revisited"
-, type =	"Technical {Report}"
-, institution =	"Northwestern University"
-, year =	1992
-, update =	"93.09 milone+mitchell"
+, author =      "C. D. Yang and D. T. Lee and C. K. Wong"
+, title =       "Rectilinear paths problems among rectilinear obstacles revisited"
+, type =        "Technical {Report}"
+, institution = "Northwestern University"
+, year =        1992
+, update =      "93.09 milone+mitchell"
 }
 
 @article{ylw-rppro-95
-, author =	"C. D. Yang and D. T. Lee and C. K. Wong"
-, title =	"Rectilinear paths problems among rectilinear obstacles revisited"
-, journal =	"SIAM J. Comput."
-, volume =	24
-, year =	1995
-, pages =	"457--472"
-, keywords =	"shortest paths, rectilinear geometry, bicriteria paths, VLSI, wire routing"
-, succeeds =	"ylw-rpror-92"
-, update =	"98.03 mitchell, 96.05 mitchell"
-, annote =	"They consider shortest paths (also MST) in the $L_1$ geodesic
+, author =      "C. D. Yang and D. T. Lee and C. K. Wong"
+, title =       "Rectilinear paths problems among rectilinear obstacles revisited"
+, journal =     "SIAM J. Comput."
+, volume =      24
+, year =        1995
+, pages =       "457--472"
+, keywords =    "shortest paths, rectilinear geometry, bicriteria paths, VLSI, wire routing"
+, succeeds =    "ylw-rpror-92"
+, update =      "98.03 mitchell, 96.05 mitchell"
+, annote =      "They consider shortest paths (also MST) in the $L_1$ geodesic
 metric.  They use a path-preserving graph approach, together with
 segment draggin.  For a set of disjoint rectilinear obstacles
 having $m$ edges, $t$ of which are ``extreme'' (locally -- having
@@ -150089,1139 +150089,1139 @@ @article{ylw-rppro-95
 }
 
 @unpublished{ygkm-mdidq-
-, author =	"J. Yang and H. Gould and W. Klein and R. Mountain"
-, title =	"Molecular dynamics investigation of deeply quenched liquids"
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "J. Yang and H. Gould and W. Klein and R. Mountain"
+, title =       "Molecular dynamics investigation of deeply quenched liquids"
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @article{yl-nvweu-96
-, author =	"M. Yang and E. Lee"
-, title =	"{NC} Verification for Wire-EDM Using an R-Map"
-, journal =	"Comput. Aided Design"
-, volume =	28
-, number =	9
-, month =	sep
-, year =	1996
-, pages =	"733--740"
-, update =	"97.03 held"
+, author =      "M. Yang and E. Lee"
+, title =       "{NC} Verification for Wire-EDM Using an R-Map"
+, journal =     "Comput. Aided Design"
+, volume =      28
+, number =      9
+, month =       sep
+, year =        1996
+, pages =       "733--740"
+, update =      "97.03 held"
 }
 
 @article{ysc-rdta-92
-, author =	"T.-C. Yang and S. Y. Shin and K.-Y. Chwa"
-, title =	"Rolling Discs and Their Applications"
-, journal =	"J. of Design and Manufacturing"
-, volume =	2
-, year =	1992
-, pages =	"71--82"
-, keywords =	"Voronoi diagrams, offsetting"
-, update =	"93.09 held"
+, author =      "T.-C. Yang and S. Y. Shin and K.-Y. Chwa"
+, title =       "Rolling Discs and Their Applications"
+, journal =     "J. of Design and Manufacturing"
+, volume =      2
+, year =        1992
+, pages =       "71--82"
+, keywords =    "Voronoi diagrams, offsetting"
+, update =      "93.09 held"
 }
 
 @inproceedings{yw-ossaw-72
-, author =	"Y. Y. Yang and O. Wing"
-, title =	"Optimal and suboptimal solution algorithms for the wiring problem"
-, booktitle =	"IEEE International Symposium on Circuit Theory"
-, year =	1972
-, pages =	"154--158"
-, update =	"98.07 bibrelex"
+, author =      "Y. Y. Yang and O. Wing"
+, title =       "Optimal and suboptimal solution algorithms for the wiring problem"
+, booktitle =   "IEEE International Symposium on Circuit Theory"
+, year =        1972
+, pages =       "154--158"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{y-satif-97
-, author =	"Zaifu Yang"
-, title =	"A Simplicial Algorithm for Testing the Integral Feasibility of Arbitrary Simplices"
-, booktitle =	"Abstracts 13th European Workshop Comput. Geom."
-, nickname =	"CG '97"
-, site =	"W{\"u}rzburg"
-, publisher =	"Universit{\"a}t W{\"u}rzburg"
-, year =	1997
-, pages =	45
-, cites =	"ZZZ"
-, update =	"00.03 bibrelex, 98.07 bibrelex"
+, author =      "Zaifu Yang"
+, title =       "A Simplicial Algorithm for Testing the Integral Feasibility of Arbitrary Simplices"
+, booktitle =   "Abstracts 13th European Workshop Comput. Geom."
+, nickname =    "CG '97"
+, site =        "W{\"u}rzburg"
+, publisher =   "Universit{\"a}t W{\"u}rzburg"
+, year =        1997
+, pages =       45
+, cites =       "ZZZ"
+, update =      "00.03 bibrelex, 98.07 bibrelex"
 }
 
 @article{y-edp-81
-, author =	"M. Yannakakis"
-, title =	"Edge deletion problems"
-, journal =	"SIAM J. Comput."
-, volume =	"??"
-, year =	1981
-, pages =	"297--309"
-, update =	"97.11 bibrelex"
+, author =      "M. Yannakakis"
+, title =       "Edge deletion problems"
+, journal =     "SIAM J. Comput."
+, volume =      "??"
+, year =        1981
+, pages =       "297--309"
+, update =      "97.11 bibrelex"
 }
 
 @article{y-cpodp-82
-, author =	"M. Yannakakis"
-, title =	"The complexity of the partial order dimension problem"
-, journal =	"SIAM J. Algebraic Discrete Methods"
-, volume =	3
-, number =	3
-, year =	1982
-, pages =	"351--358"
-, update =	"98.11 bibrelex"
+, author =      "M. Yannakakis"
+, title =       "The complexity of the partial order dimension problem"
+, journal =     "SIAM J. Algebraic Discrete Methods"
+, volume =      3
+, number =      3
+, year =        1982
+, pages =       "351--358"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{ypk-lpsfd-79
-, author =	"M. Yannakakis and C. H. Papadimitriou and H. T. Kung"
-, title =	"Locking policies: safety and freedom from deadlock"
-, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1979
-, pages =	"286--297"
-, keywords =	"database theory"
-, annote =	"closure of union of isooriented rectangles"
+, author =      "M. Yannakakis and C. H. Papadimitriou and H. T. Kung"
+, title =       "Locking policies: safety and freedom from deadlock"
+, booktitle =   "Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1979
+, pages =       "286--297"
+, keywords =    "database theory"
+, annote =      "closure of union of isooriented rectangles"
 }
 
 @inproceedings{y-pctum-77
-, author =	"A. Yao"
-, title =	"Probabilistic computation: towards a unified measure of complexity"
-, booktitle =	"Proc. 18th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1977
-, pages =	"222--227"
-, update =	"97.03 gaertner+salinger"
+, author =      "A. Yao"
+, title =       "Probabilistic computation: towards a unified measure of complexity"
+, booktitle =   "Proc. 18th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1977
+, pages =       "222--227"
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{y-lbfch-81
-, author =	"A. C. Yao"
-, title =	"A lower bound to finding convex hulls"
-, journal =	"J. ACM"
-, volume =	28
-, year =	1981
-, pages =	"780--787"
+, author =      "A. C. Yao"
+, title =       "A lower bound to finding convex hulls"
+, journal =     "J. ACM"
+, volume =      28
+, year =        1981
+, pages =       "780--787"
 }
 
 @article{y-oafms-75
-, author =	"A. C. Yao"
-, title =	"An {$O(|E| \log\log |V|)$} algorithm for finding minimum spanning trees"
-, journal =	"Inform. Process. Lett."
-, volume =	4
-, year =	1975
-, succeeds =	"y-oamst-74"
-, update =	"93.05 jones"
+, author =      "A. C. Yao"
+, title =       "An {$O(|E| \log\log |V|)$} algorithm for finding minimum spanning trees"
+, journal =     "Inform. Process. Lett."
+, volume =      4
+, year =        1975
+, succeeds =    "y-oamst-74"
+, update =      "93.05 jones"
 }
 
 @techreport{y-oamst-74
-, author =	"A. C. Yao"
-, title =	"An {$O(|E| \log\log |V|)$} algorithm for minimum spanning trees"
-, type =	"Report"
-, number =	"UIUCDCS-R-74-691"
-, institution =	"Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1974
-, precedes =	"y-oafms-75"
-, update =	"93.05 jones"
+, author =      "A. C. Yao"
+, title =       "An {$O(|E| \log\log |V|)$} algorithm for minimum spanning trees"
+, type =        "Report"
+, number =      "UIUCDCS-R-74-691"
+, institution = "Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1974
+, precedes =    "y-oafms-75"
+, update =      "93.05 jones"
 }
 
 @inproceedings{y-fafms-77
-, author =	"A. C. Yao"
-, title =	"Fast algorithms for finding minimum spanning trees in $k$ dimensions"
-, booktitle =	"Proc. 15th Allerton Conf. Commun. Control Comput."
-, year =	1977
-, pages =	"553--556"
-, precedes =	"y-cmstk-82"
-, update =	"93.09 jones"
+, author =      "A. C. Yao"
+, title =       "Fast algorithms for finding minimum spanning trees in $k$ dimensions"
+, booktitle =   "Proc. 15th Allerton Conf. Commun. Control Comput."
+, year =        1977
+, pages =       "553--556"
+, precedes =    "y-cmstk-82"
+, update =      "93.09 jones"
 }
 
 @article{y-lbact-91
-, author =	"A. C. Yao"
-, title =	"Lower bounds for algebraic computation trees with integer inputs"
-, journal =	"SIAM J. Comput."
-, volume =	20
-, number =	4
-, year =	1991
-, pages =	"655--668"
-, update =	"98.11 bibrelex, 96.05 smid"
+, author =      "A. C. Yao"
+, title =       "Lower bounds for algebraic computation trees with integer inputs"
+, journal =     "SIAM J. Comput."
+, volume =      20
+, number =      4
+, year =        1991
+, pages =       "655--668"
+, update =      "98.11 bibrelex, 96.05 smid"
 }
 
 @article{y-cmstk-82
-, author =	"A. C. Yao"
-, title =	"On constructing minimum spanning trees in $k$-dimensional spaces and related problems"
-, journal =	"SIAM J. Comput."
-, volume =	11
-, number =	4
-, year =	1982
-, pages =	"721--736"
-, succeeds =	"y-fafms-77"
-, update =	"98.11 bibrelex, 93.09 jones"
+, author =      "A. C. Yao"
+, title =       "On constructing minimum spanning trees in $k$-dimensional spaces and related problems"
+, journal =     "SIAM J. Comput."
+, volume =      11
+, number =      4
+, year =        1982
+, pages =       "721--736"
+, succeeds =    "y-fafms-77"
+, update =      "98.11 bibrelex, 93.09 jones"
 }
 
 @inproceedings{y-ccpul-75
-, author =	"A. C. Yao"
-, title =	"On the complexity of comparison problems using linear functions"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Theory Comput."
-, year =	1975
-, pages =	"85--89"
+, author =      "A. C. Yao"
+, title =       "On the complexity of comparison problems using linear functions"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Theory Comput."
+, year =        1975
+, pages =       "85--89"
 }
 
 @article{y-cmps-85
-, author =	"A. C. Yao"
-, title =	"On the complexity of maintaining partial sums"
-, journal =	"SIAM J. Comput."
-, volume =	14
-, year =	1985
-, pages =	"277--288"
-, succeeds =	"y-sttoa-82"
+, author =      "A. C. Yao"
+, title =       "On the complexity of maintaining partial sums"
+, journal =     "SIAM J. Comput."
+, volume =      14
+, year =        1985
+, pages =       "277--288"
+, succeeds =    "y-sttoa-82"
 }
 
 @inproceedings{y-sttoa-82
-, author =	"A. C. Yao"
-, title =	"Space-time trade-off for answering range queries"
-, booktitle =	"Proc. 14th Annu. ACM Sympos. Theory Comput."
-, year =	1982
-, pages =	"128--136"
-, precedes =	"y-cmps-85"
+, author =      "A. C. Yao"
+, title =       "Space-time trade-off for answering range queries"
+, booktitle =   "Proc. 14th Annu. ACM Sympos. Theory Comput."
+, year =        1982
+, pages =       "128--136"
+, precedes =    "y-cmps-85"
 }
 
 @inproceedings{yar-olbsp-77
-, author =	"A. C. Yao and D. M. Avis and R. L. Rivest"
-, title =	"An {$\Omega(n^2 \log n)$} lower bound to the shortest paths problem"
-, booktitle =	"Proc. 9th Annu. ACM Sympos. Theory Comput."
-, year =	1977
-, pages =	"11--17"
-, precedes =	"yr-pdp-80"
-, annote =	"Lower bound is incorrect"
+, author =      "A. C. Yao and D. M. Avis and R. L. Rivest"
+, title =       "An {$\Omega(n^2 \log n)$} lower bound to the shortest paths problem"
+, booktitle =   "Proc. 9th Annu. ACM Sympos. Theory Comput."
+, year =        1977
+, pages =       "11--17"
+, precedes =    "yr-pdp-80"
+, annote =      "Lower bound is incorrect"
 }
 
 @article{yr-pdp-80
-, author =	"A. C. Yao and R. L. Rivest"
-, title =	"On the polyhedral decision problem"
-, journal =	"SIAM J. Comput."
-, volume =	9
-, year =	1980
-, pages =	"343--347"
-, succeeds =	"yar-olbsp-77"
+, author =      "A. C. Yao and R. L. Rivest"
+, title =       "On the polyhedral decision problem"
+, journal =     "SIAM J. Comput."
+, volume =      9
+, year =        1980
+, pages =       "343--347"
+, succeeds =    "yar-olbsp-77"
 }
 
 @inproceedings{yy-gaddg-85
-, author =	"A. C. Yao and F. F. Yao"
-, title =	"A general approach to {$D$}-dimensional geometric queries"
-, booktitle =	"Proc. 17th Annu. ACM Sympos. Theory Comput."
-, year =	1985
-, pages =	"163--168"
-, update =	"97.11 bibrelex, 93.09 jones"
+, author =      "A. C. Yao and F. F. Yao"
+, title =       "A general approach to {$D$}-dimensional geometric queries"
+, booktitle =   "Proc. 17th Annu. ACM Sympos. Theory Comput."
+, year =        1985
+, pages =       "163--168"
+, update =      "97.11 bibrelex, 93.09 jones"
 }
 
 @techreport{yy-crfsv-75
-, author =	"A. C. Yao and F. F. Yao"
-, title =	"On computing the rank function for a set of vectors"
-, type =	"Report"
-, number =	"R-699"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1975
+, author =      "A. C. Yao and F. F. Yao"
+, title =       "On computing the rank function for a set of vectors"
+, type =        "Report"
+, number =      "R-699"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1975
 }
 
 @inproceedings{y-dtcbn-94
-, author =	"Andrew Chi-Chih Yao"
-, title =	"Decision Tree Complexity and {Betti} Numbers"
-, booktitle =	"Proc. 25th Annu. ACM Sympos. Theory Comput."
-, year =	1994
-, pages =	""
-, update =	"98.03 mitchell, 94.01 jones"
+, author =      "Andrew Chi-Chih Yao"
+, title =       "Decision Tree Complexity and {Betti} Numbers"
+, booktitle =   "Proc. 25th Annu. ACM Sympos. Theory Comput."
+, year =        1994
+, pages =       ""
+, update =      "98.03 mitchell, 94.01 jones"
 }
 
 @inproceedings{y-lbact-89
-, author =	"A. C. C. Yao"
-, title =	"Lower bounds for algebraic computation rees with integer inputs"
-, booktitle =	"Proc. 30th IEEE FOCS"
-, year =	1989
-, pages =	"308--313"
-, update =	"98.07 bibrelex"
+, author =      "A. C. C. Yao"
+, title =       "Lower bounds for algebraic computation rees with integer inputs"
+, booktitle =   "Proc. 30th IEEE FOCS"
+, year =        1989
+, pages =       "308--313"
+, update =      "98.07 bibrelex"
 }
 
 @article{yr-sacma-91
-, author =	"C. Yao and J. G. Rokne"
-, title =	"A straightforward algorithm for computing the medial axis of a simple polygon"
-, journal =	"Internat. J. Comput. Math."
-, volume =	39
-, year =	1991
-, pages =	"51--60"
-, keywords =	"design of algorithms, Voronoi diagrams, medial axis, two-dimensional"
-, annote =	"$O(k n)$ time"
+, author =      "C. Yao and J. G. Rokne"
+, title =       "A straightforward algorithm for computing the medial axis of a simple polygon"
+, journal =     "Internat. J. Comput. Math."
+, volume =      39
+, year =        1991
+, pages =       "51--60"
+, keywords =    "design of algorithms, Voronoi diagrams, medial axis, two-dimensional"
+, annote =      "$O(k n)$ time"
 }
 
 @article{yr-fc-91
-, author =	"C. Yao and J. G. Rokne"
-, title =	"Fat curves"
-, journal =	"Comput. Graph. Forum"
-, volume =	10
-, year =	1991
-, pages =	"237--248"
-, keywords =	"digital geometry, computer graphics, design of algorithms, approximation, incrementation, curves, two-dimensional"
+, author =      "C. Yao and J. G. Rokne"
+, title =       "Fat curves"
+, journal =     "Comput. Graph. Forum"
+, volume =      10
+, year =        1991
+, pages =       "237--248"
+, keywords =    "digital geometry, computer graphics, design of algorithms, approximation, incrementation, curves, two-dimensional"
 }
 
 @inproceedings{y-3spia-83
-, author =	"F. F. Yao"
-, title =	"A $3$-space partition and its applications"
-, booktitle =	"Proc. 15th Annu. ACM Sympos. Theory Comput."
-, year =	1983
-, pages =	"258--263"
-, precedes =	"ydep-psrq-89"
+, author =      "F. F. Yao"
+, title =       "A $3$-space partition and its applications"
+, booktitle =   "Proc. 15th Annu. ACM Sympos. Theory Comput."
+, year =        1983
+, pages =       "258--263"
+, precedes =    "ydep-psrq-89"
 }
 
 @incollection{y-cg-90
-, author =	"F. F. Yao"
-, title =	"Computational Geometry"
-, editor =	"R. A. Earnshaw and B. Wyvill"
-, booktitle =	"Algorithms in Complexity"
-, publisher =	"Elsevier"
-, address =	"Amsterdam"
-, year =	1990
-, pages =	"345--490"
-, keywords =	"survey paper"
-, update =	"97.03 pocchiola, 93.09 goodrich"
+, author =      "F. F. Yao"
+, title =       "Computational Geometry"
+, editor =      "R. A. Earnshaw and B. Wyvill"
+, booktitle =   "Algorithms in Complexity"
+, publisher =   "Elsevier"
+, address =     "Amsterdam"
+, year =        1990
+, pages =       "345--490"
+, keywords =    "survey paper"
+, update =      "97.03 pocchiola, 93.09 goodrich"
 }
 
 @inproceedings{y-edpuq-80
-, author =	"F. F. Yao"
-, title =	"Efficient dynamic programming using quadrangle inequalities"
-, booktitle =	"Proc. 12th Annu. ACM Sympos. Theory Comput."
-, year =	1980
-, pages =	"429--435"
+, author =      "F. F. Yao"
+, title =       "Efficient dynamic programming using quadrangle inequalities"
+, booktitle =   "Proc. 12th Annu. ACM Sympos. Theory Comput."
+, year =        1980
+, pages =       "429--435"
 }
 
 @techreport{y-fmesp-74
-, author =	"F. F. Yao"
-, title =	"On finding the maximal elements in a set of plane vectors"
-, type =	"Report"
-, number =	"R-667"
-, institution =	"Dept. Comput. Sci., Univ. Illinois"
-, address =	"Urbana, IL"
-, year =	1974
+, author =      "F. F. Yao"
+, title =       "On finding the maximal elements in a set of plane vectors"
+, type =        "Report"
+, number =      "R-667"
+, institution = "Dept. Comput. Sci., Univ. Illinois"
+, address =     "Urbana, IL"
+, year =        1974
 }
 
 @inproceedings{y-pahsa-80
-, author =	"F. F. Yao"
-, title =	"On the priority approach to hidden-surface algorithms"
-, booktitle =	"Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1980
-, pages =	"301--307"
+, author =      "F. F. Yao"
+, title =       "On the priority approach to hidden-surface algorithms"
+, booktitle =   "Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1980
+, pages =       "301--307"
 }
 
 @article{ydep-psrq-89
-, author =	"F. F. Yao and D. P. Dobkin and H. Edelsbrunner and M. S. Paterson"
-, title =	"Partitioning space for range queries"
-, journal =	"SIAM J. Comput."
-, volume =	18
-, number =	2
-, year =	1989
-, pages =	"371--384"
-, keywords =	"$d$-dimensional, searching, range search"
-, succeeds =	"y-3spia-83"
-, update =	"97.11 bibrelex"
+, author =      "F. F. Yao and D. P. Dobkin and H. Edelsbrunner and M. S. Paterson"
+, title =       "Partitioning space for range queries"
+, journal =     "SIAM J. Comput."
+, volume =      18
+, number =      2
+, year =        1989
+, pages =       "371--384"
+, keywords =    "$d$-dimensional, searching, range search"
+, succeeds =    "y-3spia-83"
+, update =      "97.11 bibrelex"
 }
 
 @techreport{y-amp-85
-, author =	"C. Yap"
-, title =	"Algorithmic Motion Planning"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1985
-, update =	"98.03 bibrelex"
+, author =      "C. Yap"
+, title =       "Algorithmic Motion Planning"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1985
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{y-elr-93
-, author =	"Chee Yap"
-, title =	"Euclidean Lattice Reduction"
-, booktitle =	"Abstracts 9th European Workshop Comput. Geom."
-, nickname =	"CG '93"
-, site =	"Hagen"
-, publisher =	"FernUniversit{\"a}t Hagen"
-, year =	1993
-, pages =	26
-, update =	"00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
+, author =      "Chee Yap"
+, title =       "Euclidean Lattice Reduction"
+, booktitle =   "Abstracts 9th European Workshop Comput. Geom."
+, nickname =    "CG '93"
+, site =        "Hagen"
+, publisher =   "FernUniversit{\"a}t Hagen"
+, year =        1993
+, pages =       26
+, update =      "00.03 bibrelex, 98.07 bibrelex, 97.11 icking"
 }
 
 @article{y-tegc-97
-, author =	"C. Yap"
-, title =	"Towards exact geometric computation"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	7
-, number =	1
-, year =	1997
-, pages =	"3--23"
-, succeeds =	"y-tegc-93"
-, update =	"98.07 tamassia, 97.03 devillers, 96.09 devillers"
+, author =      "C. Yap"
+, title =       "Towards exact geometric computation"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      7
+, number =      1
+, year =        1997
+, pages =       "3--23"
+, succeeds =    "y-tegc-93"
+, update =      "98.07 tamassia, 97.03 devillers, 96.09 devillers"
 }
 
 @inproceedings{y-wcbpc-87
-, author =	"C. Yap"
-, title =	"What can be parallelized in Computational Geometry?"
-, editor =	"A. Albrecht and H. Jung and K. Mehlhorn"
-, booktitle =	"Parallel Algorithms and Architectures. Proc. Internat. Workshop Suhl (Germany), May 25--30, 1987"
-, series =	"Math. Res."
-, volume =	38
-, publisher =	"Akademie-Verlag"
-, address =	"Berlin, East Germany"
-, year =	1987
-, pages =	"184--195"
-, comments =	"Zbl. 625.68052"
-, update =	"93.09 rote"
+, author =      "C. Yap"
+, title =       "What can be parallelized in Computational Geometry?"
+, editor =      "A. Albrecht and H. Jung and K. Mehlhorn"
+, booktitle =   "Parallel Algorithms and Architectures. Proc. Internat. Workshop Suhl (Germany), May 25--30, 1987"
+, series =      "Math. Res."
+, volume =      38
+, publisher =   "Akademie-Verlag"
+, address =     "Berlin, East Germany"
+, year =        1987
+, pages =       "184--195"
+, comments =    "Zbl. 625.68052"
+, update =      "93.09 rote"
 }
 
 @inproceedings{y-gctsp-88
-, author =	"C. K. Yap"
-, title =	"A geometric consistency theorem for a symbolic perturbation scheme"
-, booktitle =	"Proc. 4th Annu. ACM Sympos. Comput. Geom."
-, year =	1988
-, pages =	"134--142"
-, precedes =	"y-gctsp-90"
-, cites =	"b-gbamp-85, c-odlp-52, c-lp-83, dmy-aobgn-86, e-esaa-86, em-sstcd-87, ew-chsct-86, my-ngb-86, r-tgs-86, r-topr-85, y-stgd-87, ZZZ"
-, update =	"98.03 bibrelex"
+, author =      "C. K. Yap"
+, title =       "A geometric consistency theorem for a symbolic perturbation scheme"
+, booktitle =   "Proc. 4th Annu. ACM Sympos. Comput. Geom."
+, year =        1988
+, pages =       "134--142"
+, precedes =    "y-gctsp-90"
+, cites =       "b-gbamp-85, c-odlp-52, c-lp-83, dmy-aobgn-86, e-esaa-86, em-sstcd-87, ew-chsct-86, my-ngb-86, r-tgs-86, r-topr-85, y-stgd-87, ZZZ"
+, update =      "98.03 bibrelex"
 }
 
 @article{y-gctsp-90
-, author =	"C. K. Yap"
-, title =	"A geometric consistency theorem for a symbolic perturbation scheme"
-, journal =	"J. Comput. Syst. Sci."
-, volume =	40
-, number =	1
-, year =	1990
-, pages =	"2--18"
-, succeeds =	"y-gctsp-88"
-, update =	"98.11 bibrelex"
+, author =      "C. K. Yap"
+, title =       "A geometric consistency theorem for a symbolic perturbation scheme"
+, journal =     "J. Comput. Syst. Sci."
+, volume =      40
+, number =      1
+, year =        1990
+, pages =       "2--18"
+, succeeds =    "y-gctsp-88"
+, update =      "98.11 bibrelex"
 }
 
 @incollection{y-amp-87
-, author =	"C.-K. Yap"
-, title =	"Algorithmic motion planning"
-, editor =	"J. T. Schwartz and C.-K. Yap"
-, booktitle =	"Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
-, publisher =	"Lawrence Erlbaum Associates"
-, address =	"Hillsdale, NJ"
-, year =	1987
-, pages =	"95--143"
-, keywords =	"survey paper, motion planning, Voronoi diagrams, decomposition, cell complexes, lower bounds"
+, author =      "C.-K. Yap"
+, title =       "Algorithmic motion planning"
+, editor =      "J. T. Schwartz and C.-K. Yap"
+, booktitle =   "Advances in Robotics 1: Algorithmic and Geometric Aspects of Robotics"
+, publisher =   "Lawrence Erlbaum Associates"
+, address =     "Hillsdale, NJ"
+, year =        1987
+, pages =       "95--143"
+, keywords =    "survey paper, motion planning, Voronoi diagrams, decomposition, cell complexes, lower bounds"
 }
 
 @techreport{y-oavds-84
-, author =	"C. K. Yap"
-, title =	"An {$O(n \log n)$} algorithm for the {Voronoi} diagram of a set of simple curve segments"
-, type =	"Technical {Report}"
-, institution =	"Courant Inst., New York Univ."
-, address =	"New York, NY"
-, month =	oct
-, year =	1984
-, update =	"97.11 bibrelex"
+, author =      "C. K. Yap"
+, title =       "An {$O(n \log n)$} algorithm for the {Voronoi} diagram of a set of simple curve segments"
+, type =        "Technical {Report}"
+, institution = "Courant Inst., New York Univ."
+, address =     "New York, NY"
+, month =       oct
+, year =        1984
+, update =      "97.11 bibrelex"
 }
 
 @article{y-oavds-87
-, author =	"C. K. Yap"
-, title =	"An {$O(n \log n)$} algorithm for the {Voronoi} diagram of a set of simple curve segments"
-, journal =	"Discrete Comput. Geom."
-, volume =	2
-, year =	1987
-, pages =	"365--393"
+, author =      "C. K. Yap"
+, title =       "An {$O(n \log n)$} algorithm for the {Voronoi} diagram of a set of simple curve segments"
+, journal =     "Discrete Comput. Geom."
+, volume =      2
+, year =        1987
+, pages =       "365--393"
 }
 
 @techreport{y-cmsd-84
-, author =	"C. K. Yap"
-, title =	"Coordinating the motion of several discs"
-, type =	"Report"
-, number =	"TR 105"
-, institution =	"Comput. Sci. Div., New York Univ."
-, address =	"New York, NY"
-, year =	1984
+, author =      "C. K. Yap"
+, title =       "Coordinating the motion of several discs"
+, type =        "Report"
+, number =      "TR 105"
+, institution = "Comput. Sci. Div., New York Univ."
+, address =     "New York, NY"
+, year =        1984
 }
 
 @incollection{y-ecgtm-95
-, author =	"C. K. Yap"
-, title =	"Exact computational geometry and tolerancing metrology"
-, editor =	"D. Avis and J. Bose"
-, booktitle =	"Snapshots of Computational and Discrete Geometry, Vol.~3, Tech. Rep. SOCS-94.50"
-, publisher =	"McGill School of Comp. Sci."
-, year =	1995
-, update =	"96.09 orourke"
+, author =      "C. K. Yap"
+, title =       "Exact computational geometry and tolerancing metrology"
+, editor =      "D. Avis and J. Bose"
+, booktitle =   "Snapshots of Computational and Discrete Geometry, Vol.~3, Tech. Rep. SOCS-94.50"
+, publisher =   "McGill School of Comp. Sci."
+, year =        1995
+, update =      "96.09 orourke"
 }
 
 @techreport{y-fabor-82
-, author =	"C. K. Yap"
-, title =	"Fast algorithms for boolean operations on rectilinear regions"
-, type =	"Report"
-, number =	"??"
-, institution =	"Courant Inst. Math. Sci., New York Univ."
-, address =	"New York, NY"
-, year =	1982
+, author =      "C. K. Yap"
+, title =       "Fast algorithms for boolean operations on rectilinear regions"
+, type =        "Report"
+, number =      "??"
+, institution = "Courant Inst. Math. Sci., New York Univ."
+, address =     "New York, NY"
+, year =        1982
 }
 
 @inproceedings{y-furpi-92
-, author =	"Chee K. Yap"
-, title =	"Fast Unimodular Reduction: {Planar} Integer Lattices"
-, booktitle =	"Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1992
-, pages =	"437--446"
-, update =	"94.01 smid, 93.09 milone+mitchell"
+, author =      "Chee K. Yap"
+, title =       "Fast Unimodular Reduction: {Planar} Integer Lattices"
+, booktitle =   "Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1992
+, pages =       "437--446"
+, update =      "94.01 smid, 93.09 milone+mitchell"
 }
 
 @book{y-fpaa-93
-, author =	"C. K. Yap"
-, title =	"Fundamental Problems in Algorithmic Algebra"
-, publisher =	"Princeton University Press"
-, year =	1993
-, update =	"98.07 bibrelex, 98.03 bibrelex"
+, author =      "C. K. Yap"
+, title =       "Fundamental Problems in Algorithmic Algebra"
+, publisher =   "Princeton University Press"
+, year =        1993
+, update =      "98.07 bibrelex, 98.03 bibrelex"
 }
 
 @article{y-hmctd-87
-, author =	"C. K. Yap"
-, title =	"How to move a chair through a door"
-, journal =	"Internat. J. Robot. Autom."
-, volume =	"RA-3"
-, number =	3
-, year =	1987
-, pages =	"172--181"
-, keywords =	"motion planning"
+, author =      "C. K. Yap"
+, title =       "How to move a chair through a door"
+, journal =     "Internat. J. Robot. Autom."
+, volume =      "RA-3"
+, number =      3
+, year =        1987
+, pages =       "172--181"
+, keywords =    "motion planning"
 }
 
 @article{y-mcgwr-95
-, author =	"C. K. Yap"
-, title =	"Manufacturing and Computational Geometry Workshop Report"
-, journal =	"Computational Science and Engineering"
-, volume =	"??"
-, year =	1995
-, pages =	"82--84"
-, update =	"98.07 bibrelex, 95.09 mitchell"
+, author =      "C. K. Yap"
+, title =       "Manufacturing and Computational Geometry Workshop Report"
+, journal =     "Computational Science and Engineering"
+, volume =      "??"
+, year =        1995
+, pages =       "82--84"
+, update =      "98.07 bibrelex, 95.09 mitchell"
 }
 
 @unpublished{y-nwmcg-94
-, author =	"C. K. Yap"
-, title =	"NSF Workshop on Manufacturing and Computational Geometry"
-, month =	jun
-, year =	1994
-, note =	"April 1, 1994; preliminary report"
-, update =	"95.01 mitchell"
+, author =      "C. K. Yap"
+, title =       "NSF Workshop on Manufacturing and Computational Geometry"
+, month =       jun
+, year =        1994
+, note =        "April 1, 1994; preliminary report"
+, update =      "95.01 mitchell"
 }
 
 @techreport{y-ptptc-87
-, author =	"C. K. Yap"
-, title =	"Parallel Triangulation of a Polygon in Two Calls to the Trapezoidal Map"
-, type =	"Manuscript"
-, institution =	"??"
-, year =	1987
-, update =	"97.11 bibrelex"
+, author =      "C. K. Yap"
+, title =       "Parallel Triangulation of a Polygon in Two Calls to the Trapezoidal Map"
+, type =        "Manuscript"
+, institution = "??"
+, year =        1987
+, update =      "97.11 bibrelex"
 }
 
 @article{y-ptptc-88
-, author =	"C. K. Yap"
-, title =	"Parallel triangulation of a polygon in two calls to the trapezoidal map"
-, journal =	"Algorithmica"
-, volume =	3
-, year =	1988
-, pages =	"279--288"
-, keywords =	"parallel computation, triangulation, polygon"
+, author =      "C. K. Yap"
+, title =       "Parallel triangulation of a polygon in two calls to the trapezoidal map"
+, journal =     "Algorithmica"
+, volume =      3
+, year =        1988
+, pages =       "279--288"
+, keywords =    "parallel computation, triangulation, polygon"
 }
 
 @techreport{y-ptspt-87
-, author =	"C. K. Yap"
-, title =	"Parallel Triangulation of a Simple Polygon in Three Calls to the Trapezoidal Map"
-, institution =	"Robotics Lab, Courant Institute of Mathematical Sciences, New York University"
-, address =	"NY 10012, USA"
-, month =	mar
-, year =	1987
-, update =	"93.09 held"
+, author =      "C. K. Yap"
+, title =       "Parallel Triangulation of a Simple Polygon in Three Calls to the Trapezoidal Map"
+, institution = "Robotics Lab, Courant Institute of Mathematical Sciences, New York University"
+, address =     "NY 10012, USA"
+, month =       mar
+, year =        1987
+, update =      "93.09 held"
 }
 
 @incollection{y-rgc-97
-, author =	"C. K. Yap"
-, title =	"Robust geometric computation"
-, chapter =	35
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"653--668"
-, update =	"97.11 orourke"
+, author =      "C. K. Yap"
+, title =       "Robust geometric computation"
+, chapter =     35
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "653--668"
+, update =      "97.11 orourke"
 }
 
 @article{y-stgd-
-, author =	"C. K. Yap"
-, title =	"Symbolic treatment of geometric degeneracies"
-, journal =	"Lecture Notes in Control and Information Science"
-, volume =	113
-, pages =	"348--358"
-, succeeds =	"y-stgd-87"
-, update =	"98.11 bibrelex"
+, author =      "C. K. Yap"
+, title =       "Symbolic treatment of geometric degeneracies"
+, journal =     "Lecture Notes in Control and Information Science"
+, volume =      113
+, pages =       "348--358"
+, succeeds =    "y-stgd-87"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{y-stgd-87
-, author =	"C. K. Yap"
-, title =	"Symbolic treatment of geometric degeneracies"
-, booktitle =	"Proc. 13th IFIP Conf. System Modelling and Optimization"
-, site =	"Tokyo, Japan"
-, year =	1987
-, pages =	"348--358"
-, precedes =	"y-stgd-, y-stgd-90"
-, update =	"98.11 bibrelex"
+, author =      "C. K. Yap"
+, title =       "Symbolic treatment of geometric degeneracies"
+, booktitle =   "Proc. 13th IFIP Conf. System Modelling and Optimization"
+, site =        "Tokyo, Japan"
+, year =        1987
+, pages =       "348--358"
+, precedes =    "y-stgd-, y-stgd-90"
+, update =      "98.11 bibrelex"
 }
 
 @article{y-stgd-90
-, author =	"C. K. Yap"
-, title =	"Symbolic treatment of geometric degeneracies"
-, journal =	"J. Symbolic Comput."
-, volume =	10
-, year =	1990
-, pages =	"349--370"
-, succeeds =	"y-stgd-87"
+, author =      "C. K. Yap"
+, title =       "Symbolic treatment of geometric degeneracies"
+, journal =     "J. Symbolic Comput."
+, volume =      10
+, year =        1990
+, pages =       "349--370"
+, succeeds =    "y-stgd-87"
 }
 
 @inproceedings{y-tegc-93
-, author =	"C. K. Yap"
-, title =	"Towards Exact Geometric Computation"
-, booktitle =	"Proc. 5th Canad. Conf. Comput. Geom."
-, site =	"Waterloo, Canada"
-, year =	1993
-, pages =	"405--419"
-, precedes =	"y-tegc-97"
-, cites =	"brv-ipam-89, cot-liais-87, dst-casaa-88, ds-rgnap-88, dy-biecg-93, e-acg-87, em-sstcd-88, ft-ousls-86, f-nsa2d-92, fv-eeacg-93, h-gsm-89, kln-edtur-91, ps-cgi-85, ss-pmp2g-83, sbv-hslim-90, si-tdpga-89, si-gafpa-88, si-nsmvd-88, s-rgwtd-93, svh-bpepa-89, r-hrrc-83, y-gctsp-90, y-stgd-90, y-fpaa-93, y-easm-92, ZZZ"
-, update =	"98.11 bibrelex, 97.11 bibrelex, 97.03 devillers, 96.09 orourke"
+, author =      "C. K. Yap"
+, title =       "Towards Exact Geometric Computation"
+, booktitle =   "Proc. 5th Canad. Conf. Comput. Geom."
+, site =        "Waterloo, Canada"
+, year =        1993
+, pages =       "405--419"
+, precedes =    "y-tegc-97"
+, cites =       "brv-ipam-89, cot-liais-87, dst-casaa-88, ds-rgnap-88, dy-biecg-93, e-acg-87, em-sstcd-88, ft-ousls-86, f-nsa2d-92, fv-eeacg-93, h-gsm-89, kln-edtur-91, ps-cgi-85, ss-pmp2g-83, sbv-hslim-90, si-tdpga-89, si-gafpa-88, si-nsmvd-88, s-rgwtd-93, svh-bpepa-89, r-hrrc-83, y-gctsp-90, y-stgd-90, y-fpaa-93, y-easm-92, ZZZ"
+, update =      "98.11 bibrelex, 97.11 bibrelex, 97.03 devillers, 96.09 orourke"
 }
 
 @inproceedings{ya-mpce-89
-, author =	"Chee K. Yap and Helmut Alt"
-, title =	"Motion Planning in the CL-Environment"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, site =	"Ottawa, Canada"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"373--380"
-, update =	"98.11 bibrelex, 96.05 agarwal, 95.01 schwarzkopf"
+, author =      "Chee K. Yap and Helmut Alt"
+, title =       "Motion Planning in the CL-Environment"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, site =        "Ottawa, Canada"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "373--380"
+, update =      "98.11 bibrelex, 96.05 agarwal, 95.01 schwarzkopf"
 }
 
 @inproceedings{yc-imgt-96
-, author =	"C. K. Yap and E.-C. Chang"
-, title =	"Issues in the metrology of geometric tolerancing"
-, editor =	"M. Overmars"
-, booktitle =	"Proc. Workshop on Algorithmic Robotics"
-, series =	"Lecture Notes Comput. Sci."
-, publisher =	"Springer-Verlag"
-, year =	1996
-, note =	"To appear"
-, update =	"98.07 bibrelex"
+, author =      "C. K. Yap and E.-C. Chang"
+, title =       "Issues in the metrology of geometric tolerancing"
+, editor =      "M. Overmars"
+, booktitle =   "Proc. Workshop on Algorithmic Robotics"
+, series =      "Lecture Notes Comput. Sci."
+, publisher =   "Springer-Verlag"
+, year =        1996
+, note =        "To appear"
+, update =      "98.07 bibrelex"
 }
 
 @incollection{yc-imgt-97
-, author =	"C. K. Yap and E.-C. Chang"
-, title =	"Issues in the metrology of geometric tolerancing"
-, editor =	"J.-P. Laumond and M. H. Overmars"
-, booktitle =	"Robotics Motion and Manipulation"
-, publisher =	"A.K. Peters"
-, year =	1997
-, pages =	"393--400"
-, update =	"98.03 agarwal"
+, author =      "C. K. Yap and E.-C. Chang"
+, title =       "Issues in the metrology of geometric tolerancing"
+, editor =      "J.-P. Laumond and M. H. Overmars"
+, booktitle =   "Robotics Motion and Manipulation"
+, publisher =   "A.K. Peters"
+, year =        1997
+, pages =       "393--400"
+, update =      "98.03 agarwal"
 }
 
 @incollection{yd-ecp-95
-, author =	"C. K. Yap and T. Dub{\'e}"
-, title =	"The exact computation paradigm"
-, editor =	"D.-Z. Du and F. K. Hwang"
-, booktitle =	"Computing in Euclidean Geometry"
-, series =	"Lecture Notes Series on Computing"
-, volume =	4
-, edition =	"2nd"
-, publisher =	"World Scientific"
-, address =	"Singapore"
-, year =	1995
-, pages =	"452--492"
-, keywords =	"survey paper, numeral computing, exact compuation, fixed-precision, multiprecision number packages"
-, update =	"98.07 icking+vismara, 97.11 icking, 97.03 devillers+pocchiola"
-, abstract =	"A survey of the approaches to non-robustness of geometric algorithms, and especially the exact computation approach. Also surveys available big-number packages."
+, author =      "C. K. Yap and T. Dub{\'e}"
+, title =       "The exact computation paradigm"
+, editor =      "D.-Z. Du and F. K. Hwang"
+, booktitle =   "Computing in Euclidean Geometry"
+, series =      "Lecture Notes Series on Computing"
+, volume =      4
+, edition =     "2nd"
+, publisher =   "World Scientific"
+, address =     "Singapore"
+, year =        1995
+, pages =       "452--492"
+, keywords =    "survey paper, numeral computing, exact compuation, fixed-precision, multiprecision number packages"
+, update =      "98.07 icking+vismara, 97.11 icking, 97.03 devillers+pocchiola"
+, abstract =    "A survey of the approaches to non-robustness of geometric algorithms, and especially the exact computation approach. Also surveys available big-number packages."
 }
 
 @inproceedings{ys-dchhd-81
-, author =	"M. Yau and S. N. Srihari"
-, title =	"Digital convex hulls from hierarchical data structures"
-, booktitle =	"Proc. Canadian Man-Comput. Comm. Soc. Conf."
-, year =	1981
-, pages =	"163--171"
+, author =      "M. Yau and S. N. Srihari"
+, title =       "Digital convex hulls from hierarchical data structures"
+, booktitle =   "Proc. Canadian Man-Comput. Comm. Soc. Conf."
+, year =        1981
+, pages =       "163--171"
 }
 
 @article{ys-hdsmd-83
-, author =	"M.-M. Yau and S. N. Srihari"
-, title =	"A hierarchical data structure for multidimensional digital images"
-, journal =	"Commun. ACM"
-, volume =	26
-, number =	7
-, year =	1983
-, pages =	"504--515"
-, update =	"97.11 bibrelex"
+, author =      "M.-M. Yau and S. N. Srihari"
+, title =       "A hierarchical data structure for multidimensional digital images"
+, journal =     "Commun. ACM"
+, volume =      26
+, number =      7
+, year =        1983
+, pages =       "504--515"
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{yo-smi-96
-, author =	"N. Yazdani and Z. M. Ozsoyoglu"
-, title =	"Sequence matching of images"
-, booktitle =	"Proc. 8th Internat Conf. on Scientific and Statistical Database Management"
-, year =	1996
-, pages =	"53--62"
-, update =	"98.07 bibrelex"
+, author =      "N. Yazdani and Z. M. Ozsoyoglu"
+, title =       "Sequence matching of images"
+, booktitle =   "Proc. 8th Internat Conf. on Scientific and Statistical Database Management"
+, year =        1996
+, pages =       "53--62"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{yn-gircc-94
-, author =	"X. Ye and H. Nowacki"
-, title =	"{$G^1$} Interpolation of Rectangular Cubic Curve Meshes Using Biquintic {B{\'e}zier} Patches"
-, booktitle =	"The 6th IMA Conference on Mathematics of Surface VI"
-, year =	1994
-, update =	"95.05 abrams"
+, author =      "X. Ye and H. Nowacki"
+, title =       "{$G^1$} Interpolation of Rectangular Cubic Curve Meshes Using Biquintic {B{\'e}zier} Patches"
+, booktitle =   "The 6th IMA Conference on Mathematics of Surface VI"
+, year =        1994
+, update =      "95.05 abrams"
 }
 
 @article{ys-fpgdc-93
-, author =	"K. Yeap and M. Sarrafzadeh"
-, title =	"Floor-planning by graph dualization: 2-concave rectiliear modules"
-, journal =	"SIAM J. Comput."
-, volume =	22
-, number =	3
-, month =	jun
-, year =	1993
-, pages =	"500--526"
-, update =	"98.11 bibrelex"
+, author =      "K. Yeap and M. Sarrafzadeh"
+, title =       "Floor-planning by graph dualization: 2-concave rectiliear modules"
+, journal =     "SIAM J. Comput."
+, volume =      22
+, number =      3
+, month =       jun
+, year =        1993
+, pages =       "500--526"
+, update =      "98.11 bibrelex"
 }
 
 @article{yws-opmtd-84
-, author =	"Y. Yeh and J. Wilson and S. C. Schwartz"
-, title =	"Outage Probability in Mobile Telephony with Directive Antennas and Macrodiversity"
-, journal =	"IEEE Trans. Selected Areas in Communication"
-, volume =	2
-, year =	1984
-, pages =	"507--511"
-, update =	"98.07 bibrelex"
+, author =      "Y. Yeh and J. Wilson and S. C. Schwartz"
+, title =       "Outage Probability in Mobile Telephony with Directive Antennas and Macrodiversity"
+, journal =     "IEEE Trans. Selected Areas in Communication"
+, volume =      2
+, year =        1984
+, pages =       "507--511"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{y-dtca-88
-, author =	"D. Yellin"
-, title =	"A Dynamic Transitive Closure Algorithm"
-, institution =	"IBM T. J. Watson Research Center"
-, year =	1988
-, update =	"94.01 tamassia"
+, author =      "D. Yellin"
+, title =       "A Dynamic Transitive Closure Algorithm"
+, institution = "IBM T. J. Watson Research Center"
+, year =        1988
+, update =      "94.01 tamassia"
 }
 
 @inproceedings{y-stapl-79
-, author =	"Y. Yemini"
-, title =	"Some theoretical aspects of position-location problems"
-, booktitle =	"Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
-, year =	1979
-, pages =	"1--8"
+, author =      "Y. Yemini"
+, title =       "Some theoretical aspects of position-location problems"
+, booktitle =   "Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci."
+, year =        1979
+, pages =       "1--8"
 }
 
 @article{ys-mqafe-83
-, author =	"M. A. Yerry and M. S. Shephard"
-, title =	"A Modified Quadtree Approach to Finite Element Mesh Generation"
-, journal =	"IEEE Comput. Graph. Appl."
-, volume =	3
-, number =	1
-, year =	1983
-, pages =	"39--46"
-, annote =	"Generates a FEM from a modified (blocks with cut
-		 corners are allowed) quadtree. Mesh is smoothed by
-		 moving each node to the centroid of surrounding ones."
+, author =      "M. A. Yerry and M. S. Shephard"
+, title =       "A Modified Quadtree Approach to Finite Element Mesh Generation"
+, journal =     "IEEE Comput. Graph. Appl."
+, volume =      3
+, number =      1
+, year =        1983
+, pages =       "39--46"
+, annote =      "Generates a FEM from a modified (blocks with cut
+                 corners are allowed) quadtree. Mesh is smoothed by
+                 moving each node to the centroid of surrounding ones."
 }
 
 @inproceedings{y-dsann-93
-, author =	"P. N. Yianilos"
-, title =	"Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces"
-, booktitle =	"Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
-, year =	1993
-, pages =	"311--321"
-, update =	"93.05 smid"
+, author =      "P. N. Yianilos"
+, title =       "Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces"
+, booktitle =   "Proc. 4th ACM-SIAM Sympos. Discrete Algorithms"
+, year =        1993
+, pages =       "311--321"
+, update =      "93.05 smid"
 }
 
 @inproceedings{y-gfpuk-95
-, author =	"S. M. Yiu"
-, title =	"A Generalized Fortress Problem using $k$-Consecutive Vertex Guards"
-, booktitle =	"Proc. 7th Canad. Conf. Comput. Geom."
-, year =	1995
-, pages =	"139--144"
-, update =	"95.09 jones"
+, author =      "S. M. Yiu"
+, title =       "A Generalized Fortress Problem using $k$-Consecutive Vertex Guards"
+, booktitle =   "Proc. 7th Canad. Conf. Comput. Geom."
+, year =        1995
+, pages =       "139--144"
+, update =      "95.09 jones"
 }
 
 @techreport{yc-egf-94t
-, author =	"S. M. Yiu and A. Choi"
-, title =	"Edge Guards on A Fortress"
-, type =	"Technical Report"
-, number =	"94-06"
-, institution =	"Dept. of Computer Science, University of Hong Kong"
-, year =	1994
-, succeeds =	"yc-egf-94"
-, update =	"98.11 bibrelex"
+, author =      "S. M. Yiu and A. Choi"
+, title =       "Edge Guards on A Fortress"
+, type =        "Technical Report"
+, number =      "94-06"
+, institution = "Dept. of Computer Science, University of Hong Kong"
+, year =        1994
+, succeeds =    "yc-egf-94"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{yc-egf-94
-, author =	"S. M. Yiu and A. Choi"
-, title =	"Edge Guards on a Fortress"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"296--301"
-, precedes =	"yc-egf-94t"
-, cites =	"bs-tbegm-92t, bs-tbegm-92, o-agta-87, s-rrag-92, sd-csegs-91, v-egpsp-93, yc-egf-94t, ghks-ggprp-94t, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "S. M. Yiu and A. Choi"
+, title =       "Edge Guards on a Fortress"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "296--301"
+, precedes =    "yc-egf-94t"
+, cites =       "bs-tbegm-92t, bs-tbegm-92, o-agta-87, s-rrag-92, sd-csegs-91, v-egpsp-93, yc-egf-94t, ghks-ggprp-94t, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @incollection{y-cdcrc-75
-, author =	"P. Yoeli"
-, title =	"Compilation of data for computer-assisted relief cartography"
-, editor =	"J. C. Davis and M. J. McCullagh"
-, booktitle =	"Display and Analysis of Spatial Data"
-, publisher =	"John Wiley \& Sons"
-, address =	"New York"
-, year =	1995
-, pages =	"352--367"
-, keywords =	"minimum-weight triangulations, data interpolation"
-, update =	"99.11 bibrelex, 98.07 bibrelex, 97.11 bibrelex, 97.03 rote"
+, author =      "P. Yoeli"
+, title =       "Compilation of data for computer-assisted relief cartography"
+, editor =      "J. C. Davis and M. J. McCullagh"
+, booktitle =   "Display and Analysis of Spatial Data"
+, publisher =   "John Wiley \& Sons"
+, address =     "New York"
+, year =        1995
+, pages =       "352--367"
+, keywords =    "minimum-weight triangulations, data interpolation"
+, update =      "99.11 bibrelex, 98.07 bibrelex, 97.11 bibrelex, 97.03 rote"
 }
 
 @article{y-laml-72
-, author =	"P. Yoeli"
-, title =	"The Logic of Automated Map Lettering"
-, journal =	"Cardographic J."
-, volume =	9
-, year =	1972
-, pages =	"99--108"
-, update =	"97.11 bibrelex"
+, author =      "P. Yoeli"
+, title =       "The Logic of Automated Map Lettering"
+, journal =     "Cardographic J."
+, volume =      9
+, year =        1972
+, pages =       "99--108"
+, update =      "97.11 bibrelex"
 }
 
 @article{ysy-smbnp-94
-, author =	"Norimasa Yoshida and Masato Shyokawa and Fujio Yamaguchi"
-, title =	"Solid modeling based on a new paradigm"
-, journal =	"Comput. Graph. Forum"
-, volume =	13
-, number =	3
-, year =	1994
-, pages =	"55--64"
-, note =	"Proc. EUROGRAPHICS '94"
-, keywords =	"solid modeling, robustness, boundary representation"
-, update =	"95.09 korneenko"
+, author =      "Norimasa Yoshida and Masato Shyokawa and Fujio Yamaguchi"
+, title =       "Solid modeling based on a new paradigm"
+, journal =     "Comput. Graph. Forum"
+, volume =      13
+, number =      3
+, year =        1994
+, pages =       "55--64"
+, note =        "Proc. EUROGRAPHICS '94"
+, keywords =    "solid modeling, robustness, boundary representation"
+, update =      "95.09 korneenko"
 }
 
 @techreport{y-vsrt-87
-, author =	"S. Youssef"
-, title =	"Vectorized simulation and ray tracing"
-, type =	"Report"
-, number =	"FSU-SCRI-87-63"
-, institution =	"Supercomputer Comput. Res. Inst., Florida State Univ."
-, address =	"Tallahassee, FL"
-, year =	1987
+, author =      "S. Youssef"
+, title =       "Vectorized simulation and ray tracing"
+, type =        "Report"
+, number =      "FSU-SCRI-87-63"
+, institution = "Supercomputer Comput. Res. Inst., Florida State Univ."
+, address =     "Tallahassee, FL"
+, year =        1987
 }
 
 @phdthesis{y-easm-91
-, author =	"J. Yu"
-, title =	"Exact Arithmetic Solid Modeling"
-, school =	"Purdue University, CS Dept., West Lafayette, IN 47907, USA"
-, month =	dec
-, year =	1991
-, keywords =	"numerical precision, stability, robustness"
-, precedes =	"y-easm-92"
-, update =	"98.11 bibrelex, 93.09 held"
+, author =      "J. Yu"
+, title =       "Exact Arithmetic Solid Modeling"
+, school =      "Purdue University, CS Dept., West Lafayette, IN 47907, USA"
+, month =       dec
+, year =        1991
+, keywords =    "numerical precision, stability, robustness"
+, precedes =    "y-easm-92"
+, update =      "98.11 bibrelex, 93.09 held"
 }
 
 @techreport{y-easm-92
-, author =	"Jiaxun Yu"
-, title =	"Exact arithmetic solid modeling"
-, type =	"Technical Report"
-, number =	"CSD-TR-92-037"
-, institution =	"Comput. Sci. Dept., Purdue University"
-, month =	jun
-, year =	1992
-, succeeds =	"y-easm-91"
-, update =	"98.11 bibrelex"
+, author =      "Jiaxun Yu"
+, title =       "Exact arithmetic solid modeling"
+, type =        "Technical Report"
+, number =      "CSD-TR-92-037"
+, institution = "Comput. Sci. Dept., Purdue University"
+, month =       jun
+, year =        1992
+, succeeds =    "y-easm-91"
+, update =      "98.11 bibrelex"
 }
 
 @inproceedings{yd-slfrr-95
-, author =	"M.-F. Yu and W. W.-M. Dai"
-, title =	"Single-layer fanout routing and routability analysis for ball grid arrays"
-, booktitle =	"Proc. IEEE/ACM Internat. Conf. on CAD"
-, year =	1995
-, pages =	"581--586"
-, update =	"98.07 bibrelex"
+, author =      "M.-F. Yu and W. W.-M. Dai"
+, title =       "Single-layer fanout routing and routability analysis for ball grid arrays"
+, booktitle =   "Proc. IEEE/ACM Internat. Conf. on CAD"
+, year =        1995
+, pages =       "581--586"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{ydd-iprap-96
-, author =	"M.-F. Yu and J. Darnauer and W. W.-M. Dai"
-, title =	"Interchangeable pin routing with applications to package layout"
-, booktitle =	"Proc. IEEE/ACM Internat. Conf. on CAD"
-, year =	1996
-, pages =	"668--673"
-, update =	"98.07 bibrelex"
+, author =      "M.-F. Yu and J. Darnauer and W. W.-M. Dai"
+, title =       "Interchangeable pin routing with applications to package layout"
+, booktitle =   "Proc. IEEE/ACM Internat. Conf. on CAD"
+, year =        1996
+, pages =       "668--673"
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{yks-dqtfl-96
-, author =	"S. Yu and M. van Kreveld and J. Snoeyink"
-, title =	"Drainage queries in {TINs}: from local to global and back again"
-, booktitle =	"Proc. 7th Internat. Sympos. Spatial Data Handling"
-, year =	1996
-, pages =	"13A.1--13A.14"
-, update =	"98.07 oostrum"
+, author =      "S. Yu and M. van Kreveld and J. Snoeyink"
+, title =       "Drainage queries in {TINs}: from local to global and back again"
+, booktitle =   "Proc. 7th Internat. Sympos. Spatial Data Handling"
+, year =        1996
+, pages =       "13A.1--13A.14"
+, update =      "98.07 oostrum"
 }
 
 @inproceedings{ygd-c3ddm-91
-, author =	"X. Yu and J. A. Goldack and L. Dong"
-, title =	"Constructing 3D Discrete Medial Axis"
-, booktitle =	"Proc. ACM Sympos. Solid Modeling Found. and CAD/CAM Applic."
-, site =	"Austin, TX, USA"
-, year =	1991
-, pages =	"481--492"
-, update =	"95.09 agarwal, 95.01 held"
+, author =      "X. Yu and J. A. Goldack and L. Dong"
+, title =       "Constructing 3D Discrete Medial Axis"
+, booktitle =   "Proc. ACM Sympos. Solid Modeling Found. and CAD/CAM Applic."
+, site =        "Austin, TX, USA"
+, year =        1991
+, pages =       "481--492"
+, update =      "95.09 agarwal, 95.01 held"
 }
 
 @article{yth-haafe-91
-, author =	"M. M. F. Yuen and S. T. Tan and K. Y. Hung"
-, title =	"A Hierarchical Approach to Automatic Finite-Element Mesh Generation"
-, journal =	"Internat. J. Numer. Methods Eng."
-, volume =	32
-, number =	3
-, year =	1991
-, pages =	"501--525"
-, annote =	"Uses Watson's for 3DDT. Fixes slivers with local
-		 changes."
-, abstract =	"A point-based two-stage hierarchical method for
-		 automatic finite element mesh generation from a solid
-		 model is presented. Given the solid model of a
-		 component and the required nodal density distribution,
-		 nodes are generated according to the hierarchy -
-		 vertex, edge, face and solid. At the vertices, nodes
-		 are established naturally. Nodes on the edges, faces
-		 and inside the solid model are generated by recursive
-		 subdivision. The nodes are then connected to form a
-		 valid and well-conditioned finite element mesh of
-		 tetrahedron elements using modified Delaunay
-		 Triangulation. Checks are conducted to ensure the
-		 compatibility of geometry and topology between the
-		 solid model and the mesh. (Author abstract) 35 Refs."
+, author =      "M. M. F. Yuen and S. T. Tan and K. Y. Hung"
+, title =       "A Hierarchical Approach to Automatic Finite-Element Mesh Generation"
+, journal =     "Internat. J. Numer. Methods Eng."
+, volume =      32
+, number =      3
+, year =        1991
+, pages =       "501--525"
+, annote =      "Uses Watson's for 3DDT. Fixes slivers with local
+                 changes."
+, abstract =    "A point-based two-stage hierarchical method for
+                 automatic finite element mesh generation from a solid
+                 model is presented. Given the solid model of a
+                 component and the required nodal density distribution,
+                 nodes are generated according to the hierarchy -
+                 vertex, edge, face and solid. At the vertices, nodes
+                 are established naturally. Nodes on the edges, faces
+                 and inside the solid model are generated by recursive
+                 subdivision. The nodes are then connected to form a
+                 valid and well-conditioned finite element mesh of
+                 tetrahedron elements using modified Delaunay
+                 Triangulation. Checks are conducted to ensure the
+                 compatibility of geometry and topology between the
+                 solid model and the mesh. (Author abstract) 35 Refs."
 }
 
 @article{y-tinn-76
-, author =	"T. P. Yunck"
-, title =	"A technique to identify nearest neighbors"
-, journal =	"IEEE Trans. Syst. Man Cybern."
-, volume =	"SMC-6"
-, year =	1976
-, pages =	"678--683"
+, author =      "T. P. Yunck"
+, title =       "A technique to identify nearest neighbors"
+, journal =     "IEEE Trans. Syst. Man Cybern."
+, volume =      "SMC-6"
+, year =        1976
+, pages =       "678--683"
 }
 
 @article{y-fnnkd-75
-, author =	"G. Yuval"
-, title =	"Finding near neighbors in $k$-dimensional space"
-, journal =	"Inform. Process. Lett."
-, volume =	3
-, year =	1975
-, pages =	"113--114"
+, author =      "G. Yuval"
+, title =       "Finding near neighbors in $k$-dimensional space"
+, journal =     "Inform. Process. Lett."
+, volume =      3
+, year =        1975
+, pages =       "113--114"
 }
 
 @article{y-fnn-76
-, author =	"G. Yuval"
-, title =	"Finding nearest neighbors"
-, journal =	"Inform. Process. Lett."
-, volume =	5
-, year =	1976
-, pages =	"63--65"
+, author =      "G. Yuval"
+, title =       "Finding nearest neighbors"
+, journal =     "Inform. Process. Lett."
+, volume =      5
+, year =        1976
+, pages =       "63--65"
 }
 
 @techreport{y-md2s-76
-, author =	"G. Yuval"
-, title =	"The mean distance in $2$-space"
-, type =	"Report"
-, number =	"??"
-, institution =	"Dept. Comput. Sci., Carnegie-Mellon Univ."
-, address =	"Pittsburgh, PA"
-, year =	1976
+, author =      "G. Yuval"
+, title =       "The mean distance in $2$-space"
+, type =        "Report"
+, number =      "??"
+, institution = "Dept. Comput. Sci., Carnegie-Mellon Univ."
+, address =     "Pittsburgh, PA"
+, year =        1976
 }
 
 @inproceedings{y-t2d3d-89
-, author =	"Mariette Yvinec"
-, title =	"Triangulation in {2D} and {3D} Space"
-, booktitle =	"Proc. of the Workshop on Geometry and Robotics"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	391
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"275--291"
-, update =	"99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 96.09 agarwal, 93.09 smid"
-, annote =	"Survey paper"
+, author =      "Mariette Yvinec"
+, title =       "Triangulation in {2D} and {3D} Space"
+, booktitle =   "Proc. of the Workshop on Geometry and Robotics"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      391
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "275--291"
+, update =      "99.11 bibrelex, 99.07 devillers, 98.07 bibrelex, 96.09 agarwal, 93.09 smid"
+, annote =      "Survey paper"
 }
 
 @inproceedings{z-rcdda-98
-, author =	"Gabriel Zachmann"
-, title =	"Rapid Collision Detection by Dynamically Aligned {DOP}-Trees"
-, booktitle =	"Proc. of IEEE Virtual Reality Annual International Symposium; VRAIS '98"
-, site =	"Atlanta, Georgia"
-, month =	mar
-, year =	1998
-, update =	"00.11 smid, 00.07 zachmann"
+, author =      "Gabriel Zachmann"
+, title =       "Rapid Collision Detection by Dynamically Aligned {DOP}-Trees"
+, booktitle =   "Proc. of IEEE Virtual Reality Annual International Symposium; VRAIS '98"
+, site =        "Atlanta, Georgia"
+, month =       mar
+, year =        1998
+, update =      "00.11 smid, 00.07 zachmann"
 }
 
 @techreport{z-wwcbs-80
-, author =	"N. Zadeh"
-, title =	"What is the worst case behavior of the simplex algorithm?"
-, type =	"Technical Report"
-, number =	27
-, institution =	"Dept. Operations Research, Stanford University"
-, year =	1980
-, update =	"97.03 gaertner+salinger"
+, author =      "N. Zadeh"
+, title =       "What is the worst case behavior of the simplex algorithm?"
+, type =        "Technical Report"
+, number =      27
+, institution = "Dept. Operations Research, Stanford University"
+, year =        1980
+, update =      "97.03 gaertner+salinger"
 }
 
 @article{z-gtmdg-71
-, author =	"C. T. Zahn"
-, title =	"Graph-therorectical methods for detecting gestalt clusters"
-, journal =	"IEEE Trans. Comput."
-, volume =	"C-20"
-, year =	1971
-, pages =	"68--86"
-, update =	"97.11 bibrelex"
+, author =      "C. T. Zahn"
+, title =       "Graph-therorectical methods for detecting gestalt clusters"
+, journal =     "IEEE Trans. Comput."
+, volume =      "C-20"
+, year =        1971
+, pages =       "68--86"
+, update =      "97.11 bibrelex"
 }
 
 @article{zc-utapp-99
-, author =	"B. {\v Z}alik and G. J. Clapworthy"
-, title =	"A Universal Trapezoidation Algorithm for Planar Polygons"
-, journal =	"Comput. \& Graphics"
-, volume =	23
-, number =	3
-, month =	jun
-, year =	1999
-, pages =	"353--363"
-, update =	"00.03 held"
+, author =      "B. {\v Z}alik and G. J. Clapworthy"
+, title =       "A Universal Trapezoidation Algorithm for Planar Polygons"
+, journal =     "Comput. \& Graphics"
+, volume =      23
+, number =      3
+, month =       jun
+, year =        1999
+, pages =       "353--363"
+, update =      "00.03 held"
 }
 
 @article{z-tcfha-91
-, author =	"T. Zamfirescu"
-, title =	"On two conjectures of {Franz} {Hering} about convex surfaces"
-, journal =	"Discrete Comput. Geom."
-, volume =	6
-, year =	1991
-, pages =	"163--169"
+, author =      "T. Zamfirescu"
+, title =       "On two conjectures of {Franz} {Hering} about convex surfaces"
+, journal =     "Discrete Comput. Geom."
+, volume =      6
+, year =        1991
+, pages =       "163--169"
 }
 
 @inproceedings{z-asbim-78
-, author =	"P. Zamperoni"
-, title =	"Analysis and synthesis of binary images by means of convex blobs"
-, booktitle =	"Proc. Internat. Conf. on Digital Signal Processing"
-, site =	"Florence, Italy"
-, year =	1978
-, pages =	"181--188"
+, author =      "P. Zamperoni"
+, title =       "Analysis and synthesis of binary images by means of convex blobs"
+, booktitle =   "Proc. Internat. Conf. on Digital Signal Processing"
+, site =        "Florence, Italy"
+, year =        1978
+, pages =       "181--188"
 }
 
 @inproceedings{z-bdkeb-78
-, author =	"P. Zamperoni"
-, title =	"Bilddarstellung durch konvexe elementarmuster {Bildverarbeitung} und {Musterekennung}"
-, editor =	"E. Triendl"
-, booktitle =	"DAGM Sympos."
-, publisher =	"Informatik-Fachberichte, Springer-Verlag"
-, year =	1978
-, pages =	"145--154"
+, author =      "P. Zamperoni"
+, title =       "Bilddarstellung durch konvexe elementarmuster {Bildverarbeitung} und {Musterekennung}"
+, editor =      "E. Triendl"
+, booktitle =   "DAGM Sympos."
+, publisher =   "Informatik-Fachberichte, Springer-Verlag"
+, year =        1978
+, pages =       "145--154"
 }
 
 @inproceedings{z-sgcrg-82
-, author =	"P. Zamperoni"
-, title =	"Sequential growth of convex regions for grey-scale image analysis"
-, booktitle =	"Proc. 6th IEEE Internat. Conf. Pattern Recogn."
-, year =	1982
-, pages =	"912--914"
+, author =      "P. Zamperoni"
+, title =       "Sequential growth of convex regions for grey-scale image analysis"
+, booktitle =   "Proc. 6th IEEE Internat. Conf. Pattern Recogn."
+, year =        1982
+, pages =       "912--914"
 }
 
 @book{zs-ca1-58
-, author =	"O. Zariski and P. Samuel"
-, title =	"Commutative Algebra"
-, volume =	1
-, publisher =	"Springer-Verlag"
-, year =	1958
-, precedes =	"zs-ca2-58"
-, update =	"97.11 bibrelex"
+, author =      "O. Zariski and P. Samuel"
+, title =       "Commutative Algebra"
+, volume =      1
+, publisher =   "Springer-Verlag"
+, year =        1958
+, precedes =    "zs-ca2-58"
+, update =      "97.11 bibrelex"
 }
 
 @book{zs-ca2-58
-, author =	"O. Zariski and P. Samuel"
-, title =	"Commutative Algebra"
-, volume =	2
-, publisher =	"Springer-Verlag"
-, year =	1958
-, succeeds =	"zs-ca1-58"
-, update =	"97.11 bibrelex"
+, author =      "O. Zariski and P. Samuel"
+, title =       "Commutative Algebra"
+, volume =      2
+, publisher =   "Springer-Verlag"
+, year =        1958
+, succeeds =    "zs-ca1-58"
+, update =      "97.11 bibrelex"
 }
 
 @article{z-catd-77
-, author =	"T. Zaslavsky"
-, title =	"A combinatorial analysis of topological dissections"
-, journal =	"Adv. Math."
-, volume =	25
-, year =	1977
-, pages =	"267--285"
-, update =	"98.03 agarwal"
+, author =      "T. Zaslavsky"
+, title =       "A combinatorial analysis of topological dissections"
+, journal =     "Adv. Math."
+, volume =      25
+, year =        1977
+, pages =       "267--285"
+, update =      "98.03 agarwal"
 }
 
 @book{z-fuafc-75
-, author =	"T. Zaslavsky"
-, title =	"Facing up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes"
-, series =	"Memoirs Amer. Math. Soc."
-, volume =	154
-, publisher =	"American Mathematical Society"
-, address =	"Providence, RI"
-, year =	1975
-, isbn =	"0-8218-1854-6"
-, keywords =	"doctoral thesis"
-, comments =	"substantially the author's thesis, Massachusetts Inst. Tech."
-, update =	"97.11 bibrelex, 95.09 korneenko+mitchell"
+, author =      "T. Zaslavsky"
+, title =       "Facing up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes"
+, series =      "Memoirs Amer. Math. Soc."
+, volume =      154
+, publisher =   "American Mathematical Society"
+, address =     "Providence, RI"
+, year =        1975
+, isbn =        "0-8218-1854-6"
+, keywords =    "doctoral thesis"
+, comments =    "substantially the author's thesis, Massachusetts Inst. Tech."
+, update =      "97.11 bibrelex, 95.09 korneenko+mitchell"
 }
 
 @book{z-tdm-96
-, title =	"Teubner-Taschenbuch der {Mathematik}"
-, editor =	"E. Zeidler"
-, publisher =	"B. G. Teubner"
-, address =	"Leipzig"
-, year =	1996
-, note =	"Begr{\"u}ndet von {I.} {N.} {Bronstein} und {K.} {A.} {Semendjajew},
-		 weitergef{\"u}hrt von {G.} {Grosche}, {V.} {Ziegler} und {D.} {Ziegler}"
-, update =	"00.03 bibrelex"
+, title =       "Teubner-Taschenbuch der {Mathematik}"
+, editor =      "E. Zeidler"
+, publisher =   "B. G. Teubner"
+, address =     "Leipzig"
+, year =        1996
+, note =        "Begr{\"u}ndet von {I.} {N.} {Bronstein} und {K.} {A.} {Semendjajew},
+                 weitergef{\"u}hrt von {G.} {Grosche}, {V.} {Ziegler} und {D.} {Ziegler}"
+, update =      "00.03 bibrelex"
 }
 
 @techreport{z-f11aa-92
-, author =	"A. Zelikovsky"
-, title =	"A faster $11/6$-approximation algorithm for the {Steiner} tree problem in graphs"
-, type =	"Report"
-, number =	"MPI-I-92-122"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
+, author =      "A. Zelikovsky"
+, title =       "A faster $11/6$-approximation algorithm for the {Steiner} tree problem in graphs"
+, type =        "Report"
+, number =      "MPI-I-92-122"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
 }
 
 @techreport{z-mbwkp-92
-, author =	"A. Zelikovsky"
-, title =	"Minimum base of weighted $k$-polymatroid and {Steiner} tree problem"
-, type =	"Report"
-, number =	"MPI-I-92-121"
-, institution =	"Max-Planck-Institut Inform."
-, address =	"Saarbr{\"u}cken, Germany"
-, year =	1992
+, author =      "A. Zelikovsky"
+, title =       "Minimum base of weighted $k$-polymatroid and {Steiner} tree problem"
+, type =        "Report"
+, number =      "MPI-I-92-121"
+, institution = "Max-Planck-Institut Inform."
+, address =     "Saarbr{\"u}cken, Germany"
+, year =        1992
 }
 
 @inproceedings{zl-mbt-93
-, author =	"A. Zelikovsky and D. Lozevanu"
-, title =	"Minimal and bounded trees"
-, booktitle =	"Tezele Cong. XVIII Acad. Romano-Americane, Kishinev"
-, year =	1993
-, pages =	"25--26"
-, update =	"95.09 mitchell"
+, author =      "A. Zelikovsky and D. Lozevanu"
+, title =       "Minimal and bounded trees"
+, booktitle =   "Tezele Cong. XVIII Acad. Romano-Americane, Kishinev"
+, year =        1993
+, pages =       "25--26"
+, update =      "95.09 mitchell"
 }
 
 @incollection{z-1aasp-92
-, author =	"A. Z. Zelikovsky"
-, title =	"An $11/8$-approximation algorithm for the {Steiner} problem on networks with rectilinear distance"
-, booktitle =	"Sets, Graphs and Nubers"
-, series =	"Colloquia Mathematica Societatis J{\'a}nos Bolyai"
-, volume =	60
-, publisher =	"??"
-, year =	1992
-, pages =	"733--745"
-, update =	"98.07 bibrelex"
+, author =      "A. Z. Zelikovsky"
+, title =       "An $11/8$-approximation algorithm for the {Steiner} problem on networks with rectilinear distance"
+, booktitle =   "Sets, Graphs and Nubers"
+, series =      "Colloquia Mathematica Societatis J{\'a}nos Bolyai"
+, volume =      60
+, publisher =   "??"
+, year =        1992
+, pages =       "733--745"
+, update =      "98.07 bibrelex"
 }
 
 @techreport{z-babne-96
-, author =	"A. Z. Zelikovsky"
-, title =	"Better Approximation Bounds for the Network and {Euclidean} {Steiner} Tree Problems"
-, type =	"Technical Report"
-, number =	"CS-96-06"
-, institution =	"University of Virginia, Charlottesville, VA"
-, year =	1996
-, update =	"98.03 mitchell"
-, annote =	"Was written in 1994 at Institute of Mathematics, Kishinev Moldova
+, author =      "A. Z. Zelikovsky"
+, title =       "Better Approximation Bounds for the Network and {Euclidean} {Steiner} Tree Problems"
+, type =        "Technical Report"
+, number =      "CS-96-06"
+, institution = "University of Virginia, Charlottesville, VA"
+, year =        1996
+, update =      "98.03 mitchell"
+, annote =      "Was written in 1994 at Institute of Mathematics, Kishinev Moldova
 and submitted for publication"
-, abstract =	"
+, abstract =    "
 The network and Euclidean Steiner tree problems require a shortest
 tree spanning a given vertex subset within a network G=(V,E,d) and
 Euclidean plane, respectively. For these problems, we present a series of
@@ -151232,347 +151232,347 @@ @techreport{z-babne-96
 }
 
 @article{z-ltras-87
-, author =	"E. Zemel"
-, title =	"A linear time randomizing algorithm for searching ranked functions"
-, journal =	"Algorithmica"
-, volume =	2
-, year =	1987
-, pages =	"81--90"
-, update =	"97.03 agarwal, 96.05 agarwal"
+, author =      "E. Zemel"
+, title =       "A linear time randomizing algorithm for searching ranked functions"
+, journal =     "Algorithmica"
+, volume =      2
+, year =        1987
+, pages =       "81--90"
+, update =      "97.03 agarwal, 96.05 agarwal"
 }
 
 @inproceedings{z-hpspp-93
-, author =	"Zhenbing Zeng"
-, title =	"Heilbronn Problem for Six Points in a Planar Convex Body"
-, booktitle =	"Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
-, month =	jun
-, year =	1993
-, pages =	"??"
-, update =	"93.09 milone+mitchell"
+, author =      "Zhenbing Zeng"
+, title =       "Heilbronn Problem for Six Points in a Planar Convex Body"
+, booktitle =   "Proc. 3rd Twente Workshop on Graphs and Combinatorial Optimization"
+, month =       jun
+, year =        1993
+, pages =       "??"
+, update =      "93.09 milone+mitchell"
 }
 
 @inproceedings{ze-cacha-01
-, author =	"Kyriakos Zervoudakis and Ioannis Z. Emiris"
-, title =	"A Comparative Application of Convex Hull Algorithms in Two and Three Dimensions"
-, booktitle =	"Abstracts 17th European Workshop Comput. Geom."
-, nickname =	"CG 2001"
-, site =	"Berlin"
-, publisher =	"Freie Universit{\"a}t Berlin"
-, year =	2001
-, pages =	"101--104"
-, update =	"01.04 icking"
+, author =      "Kyriakos Zervoudakis and Ioannis Z. Emiris"
+, title =       "A Comparative Application of Convex Hull Algorithms in Two and Three Dimensions"
+, booktitle =   "Abstracts 17th European Workshop Comput. Geom."
+, nickname =    "CG 2001"
+, site =        "Berlin"
+, publisher =   "Freie Universit{\"a}t Berlin"
+, year =        2001
+, pages =       "101--104"
+, update =      "01.04 icking"
 }
 
 @inproceedings{zb-cstsm-86
-, author =	"D. Zhang and A. Bowyer"
-, title =	"{CSG} set-theoretic solid modeling and {NC} machining of blend surfaces"
-, booktitle =	"Proc. 2nd Annu. ACM Sympos. Comput. Geom."
-, year =	1986
-, pages =	"236--245"
+, author =      "D. Zhang and A. Bowyer"
+, title =       "{CSG} set-theoretic solid modeling and {NC} machining of blend surfaces"
+, booktitle =   "Proc. 2nd Annu. ACM Sympos. Comput. Geom."
+, year =        1986
+, pages =       "236--245"
 }
 
 @techreport{zmhh-vcuho-97t
-, author =	"H. Zhang and D. Manocha and T. Hudson and K. Hoff"
-, title =	"Visibility culling using hierarchical occlusion maps"
-, type =	"Technical {Report}"
-, number =	"TR97-004"
-, institution =	"Dept. Comput. Sci., Univ. North Carolina"
-, address =	"Chapel Hill, NC"
-, year =	1997
-, update =	"98.07 bibrelex"
+, author =      "H. Zhang and D. Manocha and T. Hudson and K. Hoff"
+, title =       "Visibility culling using hierarchical occlusion maps"
+, type =        "Technical {Report}"
+, number =      "TR97-004"
+, institution = "Dept. Comput. Sci., Univ. North Carolina"
+, address =     "Chapel Hill, NC"
+, year =        1997
+, update =      "98.07 bibrelex"
 }
 
 @inproceedings{zmhh-vcuho-97
-, author =	"Hansong Zhang and Dinesh Manocha and Tom Hudson and Kenneth E. Hoff III"
-, title =	"Visibility Culling using Hierarchical Occlusion Maps"
-, booktitle =	"SIGGRAPH 97 Conference Proceedings"
-, series =	"Annual Conference Series"
-, organization =	"ACM SIGGRAPH"
-, publisher =	"ACM Press"
-, year =	1997
-, pages =	"77--88"
-, cites =	"hh-asgca-85t, hh-qbs-85, hh-pmbsc-85, l-pagaa-44, ms-bsstv-85a, pg-aldit-84, r-cgcg-72, sa-irpcs-84, wb-bfpsm-86, wq-recvm-82, wq-dgvmr-80, w-cs-86, ZZZ"
-, update =	"99.11 bibrelex, 98.03 agarwal+bibrelex+mitchell"
+, author =      "Hansong Zhang and Dinesh Manocha and Tom Hudson and Kenneth E. Hoff III"
+, title =       "Visibility Culling using Hierarchical Occlusion Maps"
+, booktitle =   "SIGGRAPH 97 Conference Proceedings"
+, series =      "Annual Conference Series"
+, organization =        "ACM SIGGRAPH"
+, publisher =   "ACM Press"
+, year =        1997
+, pages =       "77--88"
+, cites =       "hh-asgca-85t, hh-qbs-85, hh-pmbsc-85, l-pagaa-44, ms-bsstv-85a, pg-aldit-84, r-cgcg-72, sa-irpcs-84, wb-bfpsm-86, wq-recvm-82, wq-dgvmr-80, w-cs-86, ZZZ"
+, update =      "99.11 bibrelex, 98.03 agarwal+bibrelex+mitchell"
 }
 
 @article{zomk-insru-00
-, author =	"H.-K. Zhao and S. Osher and B. Merriman and M. Kang"
-, title =	"Implicit Nonparametric Shape Reconstruction from Unorganized Points Using a Variational Level Set Method"
-, journal =	"Computer Vision and Image Understanding"
-, volume =	80
-, number =	3
-, year =	2000
-, pages =	""
-, update =	"01.07 devillers"
+, author =      "H.-K. Zhao and S. Osher and B. Merriman and M. Kang"
+, title =       "Implicit Nonparametric Shape Reconstruction from Unorganized Points Using a Variational Level Set Method"
+, journal =     "Computer Vision and Image Understanding"
+, volume =      80
+, number =      3
+, year =        2000
+, pages =       ""
+, update =      "01.07 devillers"
 }
 
 @article{zb-ikpnp-94
-, author =	"Jianmin Zhao and Norman I. Badler"
-, title =	"Inverse Kinematics Positioning Using Nonlinear Programming for Highly Articulated Figures"
-, journal =	"ACM Trans. Graph."
-, volume =	13
-, number =	4
-, year =	1994
-, pages =	"313--336"
-, update =	"02.03 orourke"
+, author =      "Jianmin Zhao and Norman I. Badler"
+, title =       "Inverse Kinematics Positioning Using Nonlinear Programming for Highly Articulated Figures"
+, journal =     "ACM Trans. Graph."
+, volume =      13
+, number =      4
+, year =        1994
+, pages =       "313--336"
+, update =      "02.03 orourke"
 }
 
 @inproceedings{z-ltacr-89
-, author =	"R. Zhao"
-, title =	"Linear-time algorithms for computing reachability regions from polygonal figures"
-, booktitle =	"Proc. 1st Workshop Algorithms Data Struct."
-, series =	"Lecture Notes Comput. Sci."
-, volume =	382
-, publisher =	"Springer-Verlag"
-, year =	1989
-, pages =	"163--170"
+, author =      "R. Zhao"
+, title =       "Linear-time algorithms for computing reachability regions from polygonal figures"
+, booktitle =   "Proc. 1st Workshop Algorithms Data Struct."
+, series =      "Lecture Notes Comput. Sci."
+, volume =      382
+, publisher =   "Springer-Verlag"
+, year =        1989
+, pages =       "163--170"
 }
 
 @phdthesis{z-pet-90
-, author =	"R. Y. Zhao"
-, title =	"Placements of {Euclidean} trees"
-, school =	"School Comput. Sci., McGill Univ."
-, address =	"Montreal, PQ"
-, year =	1990
-, keywords =	"doctoral thesis"
-, update =	"98.07 bibrelex"
+, author =      "R. Y. Zhao"
+, title =       "Placements of {Euclidean} trees"
+, school =      "School Comput. Sci., McGill Univ."
+, address =     "Montreal, PQ"
+, year =        1990
+, keywords =    "doctoral thesis"
+, update =      "98.07 bibrelex"
 }
 
 @article{zsp-cspdf-93
-, author =	"J. Zhou and E. C. Sherbrooke and N. M. Patrikalakis"
-, title =	"Computation of Stationary Points of Distance Functions"
-, journal =	"Engineering with Computers"
-, volume =	9
-, number =	4
-, year =	1993
-, pages =	"231--246"
-, update =	"95.05 abrams"
+, author =      "J. Zhou and E. C. Sherbrooke and N. M. Patrikalakis"
+, title =       "Computation of Stationary Points of Distance Functions"
+, journal =     "Engineering with Computers"
+, volume =      9
+, number =      4
+, year =        1993
+, pages =       "231--246"
+, update =      "95.05 abrams"
 }
 
 @article{zszz-cctdt-90
-, author =	"Jian-Ming Zhou and Ke-Ran Shao and Ke-Ding Zhou and Qiong-Hua Zhan"
-, title =	"Computing Constrained Triangulation And {Delaunay} Triangulation: {A} New Algorithm"
-, journal =	"IEEE Trans. Magn."
-, volume =	26
-, number =	2
-, month =	mar
-, year =	1990
-, pages =	"694--697"
-, keywords =	"triangulation, finite-element mesh generation, constrained triangulation, Delaunay triangulation"
-, annote =	"CDT in 3D. Generalized Watson's algorithm."
-, abstract =	"A novel algorithm for computing optimal constrained
-		 triangulation is presented which is equally applicable
-		 to 2-D and 3-D optimal constrained triangulation and
-		 Delaunay triangulation. This algorithm has no
-		 degenerate and near-degenerate problems. The same
-		 amount of time is needed to add a new point to an
-		 existing mesh of any element number provided that the
-		 element it belongs to has been predetermined, as in the
-		 self-adaptive finite-element analysis process. This
-		 algorithm has been applied to finite- element mesh
-		 generation. Test results are given. 11 Refs."
+, author =      "Jian-Ming Zhou and Ke-Ran Shao and Ke-Ding Zhou and Qiong-Hua Zhan"
+, title =       "Computing Constrained Triangulation And {Delaunay} Triangulation: {A} New Algorithm"
+, journal =     "IEEE Trans. Magn."
+, volume =      26
+, number =      2
+, month =       mar
+, year =        1990
+, pages =       "694--697"
+, keywords =    "triangulation, finite-element mesh generation, constrained triangulation, Delaunay triangulation"
+, annote =      "CDT in 3D. Generalized Watson's algorithm."
+, abstract =    "A novel algorithm for computing optimal constrained
+                 triangulation is presented which is equally applicable
+                 to 2-D and 3-D optimal constrained triangulation and
+                 Delaunay triangulation. This algorithm has no
+                 degenerate and near-degenerate problems. The same
+                 amount of time is needed to add a new point to an
+                 existing mesh of any element number provided that the
+                 element it belongs to has been predetermined, as in the
+                 self-adaptive finite-element analysis process. This
+                 algorithm has been applied to finite- element mesh
+                 generation. Test results are given. 11 Refs."
 }
 
 @article{zzs-ag3dm-92
-, author =	"J. M. Zhou and K. D. Zhou and K. R. Shao"
-, title =	"Automatic-Generation of 3{D} Meshes for Complicated Solids"
-, journal =	"IEEE Trans. Magn."
-, volume =	28
-, number =	2
-, year =	1992
-, pages =	"1759--1762"
+, author =      "J. M. Zhou and K. D. Zhou and K. R. Shao"
+, title =       "Automatic-Generation of 3{D} Meshes for Complicated Solids"
+, journal =     "IEEE Trans. Magn."
+, volume =      28
+, number =      2
+, year =        1992
+, pages =       "1759--1762"
 }
 
 @phdthesis{z-ssgc-00
-, author =	"Y. Zhou"
-, title =	"Shape Sensitive Geometric Complexity"
-, school =	"Washington University"
-, year =	2000
-, note =	"St. Louis, MO, USA."
-, keywords =	"doctoral thesis"
-, update =	"01.04 orourke"
+, author =      "Y. Zhou"
+, title =       "Shape Sensitive Geometric Complexity"
+, school =      "Washington University"
+, year =        2000
+, note =        "St. Louis, MO, USA."
+, keywords =    "doctoral thesis"
+, update =      "01.04 orourke"
 }
 
 @article{zkt-tdscg-98
-, author =	"Y. Zhou and A. Kaufman and A. W. Toga"
-, title =	"Three-Dimensional Skeleton and Centerline Generation Based on an Approximate Minimum Distance Field"
-, journal =	"Visual Comput."
-, volume =	14
-, number =	7
-, year =	1998
-, pages =	"303--314"
-, update =	"99.03 held"
+, author =      "Y. Zhou and A. Kaufman and A. W. Toga"
+, title =       "Three-Dimensional Skeleton and Centerline Generation Based on an Approximate Minimum Distance Field"
+, journal =     "Visual Comput."
+, volume =      14
+, number =      7
+, year =        1998
+, pages =       "303--314"
+, update =      "99.03 held"
 }
 
 @inproceedings{zs-ssgp-01
-, author =	"Y. Zhou and S. Suri"
-, title =	"Shape Sensitive Geometric Permutations"
-, booktitle =	"Proc. 12th ACM-SIAM Sympos. Discrete Algorithms"
-, nickname =	"SODA '01"
-, year =	2001
-, pages =	"234--243"
-, update =	"01.04 orourke"
+, author =      "Y. Zhou and S. Suri"
+, title =       "Shape Sensitive Geometric Permutations"
+, booktitle =   "Proc. 12th ACM-SIAM Sympos. Discrete Algorithms"
+, nickname =    "SODA '01"
+, year =        2001
+, pages =       "234--243"
+, update =      "01.04 orourke"
 }
 
 @article{z-rtatd-85
-, author =	"Z. Y. Zhou"
-, title =	"A real time algorithm for two-dimensional convex hull problem ({Chinese} {English} summary)"
-, journal =	"Chinese J. Comput."
-, volume =	8
-, year =	1985
-, pages =	"136--143"
+, author =      "Z. Y. Zhou"
+, title =       "A real time algorithm for two-dimensional convex hull problem ({Chinese} {English} summary)"
+, journal =     "Chinese J. Comput."
+, volume =      8
+, year =        1985
+, pages =       "136--143"
 }
 
 @article{z-acpap-97
-, author =	"B. Zhu"
-, title =	"Approximating convex polyhedra with axis-parallel boxes"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	7
-, year =	1997
-, pages =	"253--267"
-, update =	"97.07 devillers"
+, author =      "B. Zhu"
+, title =       "Approximating convex polyhedra with axis-parallel boxes"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      7
+, year =        1997
+, pages =       "253--267"
+, update =      "97.07 devillers"
 }
 
 @article{z-cswpt-97
-, author =	"Binhai Zhu"
-, title =	"Computing the shortest watchtower of a polyhedral terrain in {$O(n \log n)$} time"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	8
-, number =	4
-, year =	1997
-, pages =	"181--193"
-, succeeds =	"z-iacsw-92"
-, update =	"98.03 mitchell"
+, author =      "Binhai Zhu"
+, title =       "Computing the shortest watchtower of a polyhedral terrain in {$O(n \log n)$} time"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      8
+, number =      4
+, year =        1997
+, pages =       "181--193"
+, succeeds =    "z-iacsw-92"
+, update =      "98.03 mitchell"
 }
 
 @inproceedings{z-frsdt-97
-, author =	"Binhai Zhu"
-, title =	"Fast Range Searching with {Delaunay} Triangulations"
-, booktitle =	"Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
-, nickname =	"COCOON '97"
-, site =	"Shanghai, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	1276
-, publisher =	"Springer-Verlag"
-, year =	1997
-, pages =	"52--61"
-, update =	"99.11 bibrelex, 98.03 mitchell"
+, author =      "Binhai Zhu"
+, title =       "Fast Range Searching with {Delaunay} Triangulations"
+, booktitle =   "Proc. 3rd Ann. Internat. Conf. Computing and Combinatorics"
+, nickname =    "COCOON '97"
+, site =        "Shanghai, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      1276
+, publisher =   "Springer-Verlag"
+, year =        1997
+, pages =       "52--61"
+, update =      "99.11 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{z-fcgsm-94
-, author =	"B. Zhu"
-, title =	"Further Computational Geometry in Secondary Memory"
-, booktitle =	"Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
-, nickname =	"ISAAC '94"
-, site =	"Beijing, China"
-, series =	"Lecture Notes Comput. Sci."
-, volume =	834
-, publisher =	"Springer-Verlag"
-, year =	1994
-, pages =	"514--522"
-, update =	"99.11 bibrelex, 98.03 smid, 96.05 mitchell"
+, author =      "B. Zhu"
+, title =       "Further Computational Geometry in Secondary Memory"
+, booktitle =   "Proc. 5th Annu. Internat. Sympos. Algorithms Comput."
+, nickname =    "ISAAC '94"
+, site =        "Beijing, China"
+, series =      "Lecture Notes Comput. Sci."
+, volume =      834
+, publisher =   "Springer-Verlag"
+, year =        1994
+, pages =       "514--522"
+, update =      "99.11 bibrelex, 98.03 smid, 96.05 mitchell"
 }
 
 @inproceedings{z-iacsw-92
-, author =	"B. Zhu"
-, title =	"Improved algorithms for computing the shortest watchtower of polyhedral terrains"
-, booktitle =	"Proc. 4th Canad. Conf. Comput. Geom."
-, year =	1992
-, pages =	"286--291"
-, precedes =	"z-cswpt-97"
-, cites =	"ce-oails-88, cg-fc1ds-86, cs-vppt-89, cs-agpli-90, dk-ladsc-85, dz-irls-94, k-osps-83, s-swrpp-88, ZZZ"
-, update =	"98.07 bibrelex, 98.03 mitchell"
+, author =      "B. Zhu"
+, title =       "Improved algorithms for computing the shortest watchtower of polyhedral terrains"
+, booktitle =   "Proc. 4th Canad. Conf. Comput. Geom."
+, year =        1992
+, pages =       "286--291"
+, precedes =    "z-cswpt-97"
+, cites =       "ce-oails-88, cg-fc1ds-86, cs-vppt-89, cs-agpli-90, dk-ladsc-85, dz-irls-94, k-osps-83, s-swrpp-88, ZZZ"
+, update =      "98.07 bibrelex, 98.03 mitchell"
 }
 
 @inproceedings{z-idcmt-94
-, author =	"B. Zhu"
-, title =	"Intersection Detection and Computation of {Manhattan} Terrains"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"256--262"
-, cites =	"b-akrp-77, ce-oails-92, cegs-lscaa-89, cg-fc1ds-86, c-oaitd-92, b-earsh-92, egs-oplms-86, gp-narlp-92, ht-fafnc-84, k-osps-83, p-lmps3-93, ps-cgi-85, pt-fdplm-89, s-swrpp-88, st-pplup-86, t-dsna-83, wl-arrcd-85, vw-rlsil-82, ZZZ"
-, update =	"98.11 bibrelex, 94.09 jones"
+, author =      "B. Zhu"
+, title =       "Intersection Detection and Computation of {Manhattan} Terrains"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "256--262"
+, cites =       "b-akrp-77, ce-oails-92, cegs-lscaa-89, cg-fc1ds-86, c-oaitd-92, b-earsh-92, egs-oplms-86, gp-narlp-92, ht-fafnc-84, k-osps-83, p-lmps3-93, ps-cgi-85, pt-fdplm-89, s-swrpp-88, st-pplup-86, t-dsna-83, wl-arrcd-85, vw-rlsil-82, ZZZ"
+, update =      "98.11 bibrelex, 94.09 jones"
 }
 
 @inproceedings{z-owlbs-96
-, author =	"B. Zhu"
-, title =	"On the {$\Omega (n^{4/3})$} weak lower bounds for some {3D} geometric problems"
-, booktitle =	"Proc. 8th Canad. Conf. Comput. Geom."
-, year =	1996
-, pages =	"270--275"
-, update =	"97.03 agarwal, 96.09 mitchell"
+, author =      "B. Zhu"
+, title =       "On the {$\Omega (n^{4/3})$} weak lower bounds for some {3D} geometric problems"
+, booktitle =   "Proc. 8th Canad. Conf. Comput. Geom."
+, year =        1996
+, pages =       "270--275"
+, update =      "97.03 agarwal, 96.09 mitchell"
 }
 
 @inproceedings{zm-sdnah-91
-, author =	"B. Zhu and A. Mirzaian"
-, title =	"Sorting does not always help in computational geometry"
-, booktitle =	"Proc. 3rd Canad. Conf. Comput. Geom."
-, month =	aug
-, year =	1991
-, pages =	"239--242"
-, cites =	"agss-ltacv-89, aw-cg-88, f-savd-87, gs-pmgsc-85, lp-cgs-84, ps-cgi-85, s-mplbc-85, y-lbact-89, ZZZ"
-, update =	"98.07 bibrelex"
+, author =      "B. Zhu and A. Mirzaian"
+, title =       "Sorting does not always help in computational geometry"
+, booktitle =   "Proc. 3rd Canad. Conf. Comput. Geom."
+, month =       aug
+, year =        1991
+, pages =       "239--242"
+, cites =       "agss-ltacv-89, aw-cg-88, f-savd-87, gs-pmgsc-85, lp-cgs-84, ps-cgi-85, s-mplbc-85, y-lbact-89, ZZZ"
+, update =      "98.07 bibrelex"
 }
 
 @article{zp-eaatl-01
-, author =	"B. Zhu and C. K. Poon"
-, title =	"Efficient approximation algorithms for two-label point labeling"
-, journal =	"Internat. J. Comput. Geom. Appl."
-, volume =	11
-, year =	2001
-, pages =	"455--464"
-, update =	"01.11 smid"
+, author =      "B. Zhu and C. K. Poon"
+, title =       "Efficient approximation algorithms for two-label point labeling"
+, journal =     "Internat. J. Comput. Geom. Appl."
+, volume =      11
+, year =        2001
+, pages =       "455--464"
+, update =      "01.11 smid"
 }
 
 @article{zssm-grpgv-96
-, author =	"C. Zhu and G. Sundaram and J. Snoeyink and Joseph S. B. Mitchell"
-, title =	"Generating Random Polygons with Given Vertices"
-, journal =	"Comput. Geom. Theory Appl."
-, volume =	6
-, year =	1996
-, pages =	"277--290"
-, succeeds =	"zssm-grxmp-94"
-, update =	"98.03 mitchell, 97.03 devillers+smid"
+, author =      "C. Zhu and G. Sundaram and J. Snoeyink and Joseph S. B. Mitchell"
+, title =       "Generating Random Polygons with Given Vertices"
+, journal =     "Comput. Geom. Theory Appl."
+, volume =      6
+, year =        1996
+, pages =       "277--290"
+, succeeds =    "zssm-grxmp-94"
+, update =      "98.03 mitchell, 97.03 devillers+smid"
 }
 
 @inproceedings{zssm-grxmp-94
-, author =	"C. Zhu and G. Sundaram and J. Snoeyink and Joseph S. B. Mitchell"
-, title =	"Generating Random $x$-Monotone Polygons with Given Vertices"
-, booktitle =	"Proc. 6th Canad. Conf. Comput. Geom."
-, year =	1994
-, pages =	"189--194"
-, precedes =	"zssm-grpgv-96"
-, cites =	"es-gtr-92, g-eadch-72, ghlst-ltavs-87, gh-ospqs-89, mr-ulbnm-90, ov-grp-91, sz-grmp-93, ls-utstp-82, t-cgpis-89, ZZZ"
-, update =	"98.11 bibrelex, 98.03 mitchell, 97.03 devillers+smid, 94.09 jones"
+, author =      "C. Zhu and G. Sundaram and J. Snoeyink and Joseph S. B. Mitchell"
+, title =       "Generating Random $x$-Monotone Polygons with Given Vertices"
+, booktitle =   "Proc. 6th Canad. Conf. Comput. Geom."
+, year =        1994
+, pages =       "189--194"
+, precedes =    "zssm-grpgv-96"
+, cites =       "es-gtr-92, g-eadch-72, ghlst-ltavs-87, gh-ospqs-89, mr-ulbnm-90, ov-grp-91, sz-grmp-93, ls-utstp-82, t-cgpis-89, ZZZ"
+, update =      "98.11 bibrelex, 98.03 mitchell, 97.03 devillers+smid, 94.09 jones"
 }
 
 @article{zl-nhaeh-91
-, author =	"David Zhu and Jean-Claude Latombe"
-, title =	"New heuristic algorithms for efficient hierarchical path planning"
-, journal =	"IEEE Trans. Robot. Autom."
-, volume =	7
-, year =	1991
-, pages =	"9--20"
-, update =	"97.03 schwarzkopf"
+, author =      "David Zhu and Jean-Claude Latombe"
+, title =       "New heuristic algorithms for efficient hierarchical path planning"
+, journal =     "IEEE Trans. Robot. Autom."
+, volume =      7
+, year =        1991
+, pages =       "9--20"
+, update =      "97.03 schwarzkopf"
 }
 
 @inproceedings{zgw-emf-94
-, author =	"Y. Zhuang and K. Y. Goldberg and Y.-C. Wong"
-, title =	"On the existence of modular fixtures"
-, booktitle =	"Proc. 11th IEEE Internat. Conf. Robot. Autom."
-, month =	may
-, year =	1994
-, pages =	"543--549"
-, update =	"98.03 bibrelex"
+, author =      "Y. Zhuang and K. Y. Goldberg and Y.-C. Wong"
+, title =       "On the existence of modular fixtures"
+, booktitle =   "Proc. 11th IEEE Internat. Conf. Robot. Autom."
+, month =       may
+, year =        1994
+, pages =       "543--549"
+, update =      "98.03 bibrelex"
 }
 
 @inproceedings{zik-eprtn-98
-, author =	"Sergey Zhukov and Andrei Iones and G. Kronin"
-, title =	"Environment Preprocessing for Real-Time Navigation of Intelligent Agents"
-, booktitle =	"Proc. SCCG'98 Conference in Bratislava ??"
-, month =	apr
-, year =	1998
-, comments =	"
+, author =      "Sergey Zhukov and Andrei Iones and G. Kronin"
+, title =       "Environment Preprocessing for Real-Time Navigation of Intelligent Agents"
+, booktitle =   "Proc. SCCG'98 Conference in Bratislava ??"
+, month =       apr
+, year =        1998
+, comments =    "
 This is Andrei Iones and Sergey Zhukov from St-Petersburg State Technical
 University, Russia.
 \par
@@ -151600,205 +151600,205 @@ @inproceedings{zik-eprtn-98
 We base our technology on accessibility graphs, not on
 road maps/visibility graphs since these methods prove to be
 inefficient in our context."
-, update =	"98.07 mitchell"
+, update =      "98.07 mitchell"
 }
 
 @book{z-lp-94
-, author =	"G. M. Ziegler"
-, title =	"Lectures on Polytopes"
-, series =	"Graduate Texts in Mathematics"
-, volume =	152
-, publisher =	"Springer-Verlag"
-, address =	"Heidelberg"
-, year =	1994
-, keywords =	"polytope, Fourier-Motzkin elimination, Schlegel diagram, shellability, Gale transform, oriented matroid, cyclic polytope, zonotope, permutahedron, associhedron, neighborly polytope, fiber polytope, Lawrence construction, diameter, non-rational polytope, tiling"
-, update =	"98.07 agarwal, 95.09 jones, 95.01 korneenko"
-, annote =	"advanced textbook on modern theory of convex polytopes"
+, author =      "G. M. Ziegler"
+, title =       "Lectures on Polytopes"
+, series =      "Graduate Texts in Mathematics"
+, volume =      152
+, publisher =   "Springer-Verlag"
+, address =     "Heidelberg"
+, year =        1994
+, keywords =    "polytope, Fourier-Motzkin elimination, Schlegel diagram, shellability, Gale transform, oriented matroid, cyclic polytope, zonotope, permutahedron, associhedron, neighborly polytope, fiber polytope, Lawrence construction, diameter, non-rational polytope, tiling"
+, update =      "98.07 agarwal, 95.09 jones, 95.01 korneenko"
+, annote =      "advanced textbook on modern theory of convex polytopes"
 }
 
 @article{z-wcm-93
-, author =	"G. M. Ziegler"
-, title =	"``What is a complex matroid''"
-, journal =	"Discrete Comput. Geom."
-, volume =	10
-, year =	1993
-, pages =	"313--348"
-, update =	"96.05 pocchiola"
+, author =      "G. M. Ziegler"
+, title =       "``What is a complex matroid''"
+, journal =     "Discrete Comput. Geom."
+, volume =      10
+, year =        1993
+, pages =       "313--348"
+, update =      "96.05 pocchiola"
 }
 
 @book{z-fem-77
-, author =	"O. C. Zienkiewicz"
-, title =	"The Finite Element Method"
-, edition =	"3rd"
-, publisher =	"McGraw-Hill"
-, year =	1977
-, update =	"98.03 bibrelex"
+, author =      "O. C. Zienkiewicz"
+, title =       "The Finite Element Method"
+, edition =     "3rd"
+, publisher =   "McGraw-Hill"
+, year =        1977
+, update =      "98.03 bibrelex"
 }
 
 @book{zt-fem-89
-, author =	"O. C. Zienkiewicz and R. L. Taylor"
-, title =	"The Finite Element Method"
-, edition =	"4th"
-, publisher =	"McGraw-Hill"
-, year =	1989
-, update =	"98.03 bibrelex, 97.11 bibrelex"
+, author =      "O. C. Zienkiewicz and R. L. Taylor"
+, title =       "The Finite Element Method"
+, edition =     "4th"
+, publisher =   "McGraw-Hill"
+, year =        1989
+, update =      "98.03 bibrelex, 97.11 bibrelex"
 }
 
 @article{z-udezk-70
-, author =	"H. Ziezold"
-, title =	"{\"U}ber die {Eckenzahl} zuf{\"a}lliger konvexer {Polygone}"
-, journal =	"Izv. Akad. Nauk. Armanj. SSR. Ser. Mat."
-, volume =	5
-, year =	1970
-, pages =	"296--312"
+, author =      "H. Ziezold"
+, title =       "{\"U}ber die {Eckenzahl} zuf{\"a}lliger konvexer {Polygone}"
+, journal =     "Izv. Akad. Nauk. Armanj. SSR. Ser. Mat."
+, volume =      5
+, year =        1970
+, pages =       "296--312"
 }
 
 @article{z-lsir-91
-, author =	"K. Zikan"
-, title =	"Least-Squares Image Registration"
-, journal =	"ORSA J. Comput."
-, volume =	3
-, year =	1991
-, pages =	"169--172"
+, author =      "K. Zikan"
+, title =       "Least-Squares Image Registration"
+, journal =     "ORSA J. Comput."
+, volume =      3
+, year =        1991
+, pages =       "169--172"
 }
 
 @techreport{zs-fmir-88
-, author =	"K. Zikan and T. M. Silberberg"
-, title =	"The {Frobenius} Metric in Image Registration"
-, type =	"Report"
-, number =	"88-13"
-, institution =	"Department of Operations Research, Stanford University"
-, year =	1988
-, precedes =	"zs-fmir-92"
-, update =	"98.07 rote"
+, author =      "K. Zikan and T. M. Silberberg"
+, title =       "The {Frobenius} Metric in Image Registration"
+, type =        "Report"
+, number =      "88-13"
+, institution = "Department of Operations Research, Stanford University"
+, year =        1988
+, precedes =    "zs-fmir-92"
+, update =      "98.07 rote"
 }
 
 @incollection{zs-fmir-92
-, author =	"Karel Zikan and Theresa M. Silberberg"
-, title =	"The {Frobenius} Metric in Image Registration"
-, editor =	"L. Shapiro and A. Rosenfeld"
-, booktitle =	"Computer Vision and Image Processing"
-, publisher =	"Academic Press"
-, year =	1992
-, pages =	"385--420"
-, succeeds =	"zs-fmir-88"
-, update =	"98.07 rote"
+, author =      "Karel Zikan and Theresa M. Silberberg"
+, title =       "The {Frobenius} Metric in Image Registration"
+, editor =      "L. Shapiro and A. Rosenfeld"
+, booktitle =   "Computer Vision and Image Processing"
+, publisher =   "Academic Press"
+, year =        1992
+, pages =       "385--420"
+, succeeds =    "zs-fmir-88"
+, update =      "98.07 rote"
 }
 
 @book{z-epc-93
-, author =	"R. Zippel"
-, title =	"Effective Polynomial Computation"
-, publisher =	"Kluwer Academic Publishers"
-, year =	1993
-, update =	"98.03 bibrelex"
+, author =      "R. Zippel"
+, title =       "Effective Polynomial Computation"
+, publisher =   "Kluwer Academic Publishers"
+, year =        1993
+, update =      "98.03 bibrelex"
 }
 
 @techreport{z-gcema-92
-, author =	"C. Zirkelbach"
-, title =	"Geometrisches Clustern --- ein metrischer Ansatz"
-, type =	"Dissertation"
-, institution =	"Department of Computer Science"
-, address =	"Universit{\"a}t W{\"u}rzburg, Germany"
-, year =	1992
-, update =	"94.05 franciosa"
+, author =      "C. Zirkelbach"
+, title =       "Geometrisches Clustern --- ein metrischer Ansatz"
+, type =        "Dissertation"
+, institution = "Department of Computer Science"
+, address =     "Universit{\"a}t W{\"u}rzburg, Germany"
+, year =        1992
+, update =      "94.05 franciosa"
 }
 
 @techreport{z-mbtcp-90
-, author =	"C. Zirkelbach"
-, title =	"Monotonous bisector trees and clustering problems"
-, type =	"Technical Report"
-, institution =	"Department of Computer Science"
-, address =	"Universit{\"a}t W{\"u}rzburg, Germany"
-, year =	1990
-, precedes =	"nvz-mbtte-92"
-, update =	"94.05 franciosa"
+, author =      "C. Zirkelbach"
+, title =       "Monotonous bisector trees and clustering problems"
+, type =        "Technical Report"
+, institution = "Department of Computer Science"
+, address =     "Universit{\"a}t W{\"u}rzburg, Germany"
+, year =        1990
+, precedes =    "nvz-mbtte-92"
+, update =      "94.05 franciosa"
 }
 
 @incollection{z-tm-97
-, author =	"R. T. {\v Zivaljevi\'c}"
-, title =	"Topological methods"
-, chapter =	11
-, editor =	"Jacob E. Goodman and Joseph O'Rourke"
-, booktitle =	"Handbook of Discrete and Computational Geometry"
-, publisher =	"CRC Press LLC"
-, address =	"Boca Raton, FL"
-, year =	1997
-, pages =	"209--224"
-, update =	"97.11 orourke"
+, author =      "R. T. {\v Zivaljevi\'c}"
+, title =       "Topological methods"
+, chapter =     11
+, editor =      "Jacob E. Goodman and Joseph O'Rourke"
+, booktitle =   "Handbook of Discrete and Computational Geometry"
+, publisher =   "CRC Press LLC"
+, address =     "Boca Raton, FL"
+, year =        1997
+, pages =       "209--224"
+, update =      "97.11 orourke"
 }
 
 @article{zv-ehst-90
-, author =	"R. T. {\v Z}ivaljevi{\'c} and S. T. Vre{\'c}ica"
-, title =	"An extension of the ham sandwich theorem"
-, journal =	"Bull. London Math. Soc."
-, volume =	22
-, year =	1990
-, pages =	"183--186"
-, update =	"95.01 matousek"
+, author =      "R. T. {\v Z}ivaljevi{\'c} and S. T. Vre{\'c}ica"
+, title =       "An extension of the ham sandwich theorem"
+, journal =     "Bull. London Math. Soc."
+, volume =      22
+, year =        1990
+, pages =       "183--186"
+, update =      "95.01 matousek"
 }
 
 @techreport{z-tcg-78
-, author =	"J. E. Zolnowsky"
-, title =	"Topics in computational geometry"
-, type =	"Report"
-, number =	"STAN-CS-78-659"
-, institution =	"Dept. Comput. Sci., Stanford Univ."
-, address =	"Stanford, CA"
-, year =	1978
-, update =	"97.11 bibrelex"
+, author =      "J. E. Zolnowsky"
+, title =       "Topics in computational geometry"
+, type =        "Report"
+, number =      "STAN-CS-78-659"
+, institution = "Dept. Comput. Sci., Stanford Univ."
+, address =     "Stanford, CA"
+, year =        1978
+, update =      "97.11 bibrelex"
 }
 
 @inproceedings{ze-fsbi-00
-, author =	"Afra Zomorodian and Herbert Edelsbrunner"
-, title =	"Fast Software for Box Intersections"
-, booktitle =	"Proc. 16th Annu. ACM Sympos. Comput. Geom."
-, year =	2000
-, pages =	"129--138"
-, update =	"00.11 jones"
+, author =      "Afra Zomorodian and Herbert Edelsbrunner"
+, title =       "Fast Software for Box Intersections"
+, booktitle =   "Proc. 16th Annu. ACM Sympos. Comput. Geom."
+, year =        2000
+, pages =       "129--138"
+, update =      "00.11 jones"
 }
 
 @article{z-gccbc-92
-, author =	"A. Zucco"
-, title =	"The generic contact of convex bodies with circumscribed homothets of a convex surface"
-, journal =	"Discrete Comput. Geom."
-, volume =	7
-, year =	1992
-, pages =	"319--323"
+, author =      "A. Zucco"
+, title =       "The generic contact of convex bodies with circumscribed homothets of a convex surface"
+, journal =     "Discrete Comput. Geom."
+, volume =      7
+, year =        1992
+, pages =       "319--323"
 }
 
 @incollection{z-clahe-94
-, author =	"Karel Zuiderveld"
-, title =	"Contrast Limited Adaptive Histogram Equalization"
-, editor =	"Paul Heckbert"
-, booktitle =	"Graphics Gems IV"
-, publisher =	"Academic Press"
-, address =	"Boston, MA"
-, year =	1994
-, pages =	"474--485"
-, keywords =	"contrast enhancement"
-, update =	"94.09 heckbert"
-, annote =	"Presents a contrast enhancement technique that overcomes
+, author =      "Karel Zuiderveld"
+, title =       "Contrast Limited Adaptive Histogram Equalization"
+, editor =      "Paul Heckbert"
+, booktitle =   "Graphics Gems IV"
+, publisher =   "Academic Press"
+, address =     "Boston, MA"
+, year =        1994
+, pages =       "474--485"
+, keywords =    "contrast enhancement"
+, update =      "94.09 heckbert"
+, annote =      "Presents a contrast enhancement technique that overcomes
 some of the flaws of simple histogram equalization, such as noise
 amplification and suppression of local contrast. Contains C code."
 }
 
 @article{z-pmris-80
-, author =	"N. Zvegintzov"
-, title =	"Partial-match retrieval in an index sequential directory"
-, journal =	"Comput. J."
-, volume =	23
-, year =	1980
-, pages =	"37--40"
+, author =      "N. Zvegintzov"
+, title =       "Partial-match retrieval in an index sequential directory"
+, journal =     "Comput. J."
+, volume =      23
+, year =        1980
+, pages =       "37--40"
 }
 
 @article{zjh-scpc-87
-, author =	"M. J. Zyda and A. R. Jones and P. G. Hogan"
-, title =	"Surface construction from planar contours"
-, journal =	"Computers and Graphics"
-, volume =	11
-, year =	1987
-, pages =	"393--408"
-, update =	"98.03 bibrelex"
+, author =      "M. J. Zyda and A. R. Jones and P. G. Hogan"
+, title =       "Surface construction from planar contours"
+, journal =     "Computers and Graphics"
+, volume =      11
+, year =        1987
+, pages =       "393--408"
+, update =      "98.03 bibrelex"
 }
 
 @book{gg-mca-99
@@ -151938,7 +151938,7 @@ @TechReport{Devillers2014Generator
 , number = "RR-8467"
 , month = "Feb"
 , year = "2014"
-, url = "https://hal.inria.fr/hal-00943409"
+, url = "https://inria.hal.science/hal-00943409"
 }
 
 @article{XinWang2009improvingchenandhan,
@@ -152006,13 +152006,13 @@ @inproceedings{cignoni1998metro
 @inproceedings{boissonnat2009Delaunay,
   TITLE = {{Incremental construction of the Delaunay graph in medium dimension}},
   AUTHOR = {Boissonnat, Jean-Daniel and Devillers, Olivier and Hornus, Samuel},
-  URL = {https://hal.inria.fr/inria-00412437},
+  URL = {https://inria.hal.science/inria-00412437},
   BOOKTITLE = {{Annual Symposium on Computational Geometry}},
   ADDRESS = {Aarhus, Denmark},
   PAGES = {208-216},
   YEAR = {2009},
   MONTH = Jun,
-  PDF = {https://hal.inria.fr/inria-00412437/file/socg09.pdf},
+  PDF = {https://inria.hal.science/inria-00412437/file/socg09.pdf},
   HAL_ID = {inria-00412437},
   HAL_VERSION = {v1},
 }
@@ -152037,12 +152037,12 @@ @InProceedings{lr-hts-12
 
 @article{cvl-ew-12,
   Author                   = {Cabello, Sergio and de Verdière, {\'E}ric Colin and Lazarus, Francis},
-	Title                    = {Algorithms for the edge-width of an embedded graph},
-	Journal                  = {Computational Geometry},
-	Volume                   = {45},
-	Pages                    = {215--224},
-	Year                     = {2012},
-	Url                      = {https://monge.univ-mlv.fr/~colinde/pub/09edgewidth.pdf}
+        Title                    = {Algorithms for the edge-width of an embedded graph},
+        Journal                  = {Computational Geometry},
+        Volume                   = {45},
+        Pages                    = {215--224},
+        Year                     = {2012},
+        Url                      = {https://monge.univ-mlv.fr/~colinde/pub/09edgewidth.pdf}
 
 @inproceedings{tang2009interactive,
   title={Interactive Hausdorff distance computation for general polygonal models},
diff --git a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
index 192e66ddf64f..c37ee06bf592 100644
--- a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
+++ b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
@@ -495,7 +495,7 @@ A precise specification of the format is available
 The Medit format, using file extension `.mesh`, is a format used by the Medit software.
 In \cgal, it is used to represent 3D meshes.
 
-A precise specification of the format is available <a href="https://hal.inria.fr/inria-00069921/document">in this report</a>,
+A precise specification of the format is available <a href="https://inria.hal.science/inria-00069921/document">in this report</a>,
 in the appendices (section 7.2.1, page 36).
 
 Only the `CGAL::Mesh_complex_3_in_triangulation_3` \cgal data structure can be exported into `.mesh`

From adde733cd5dcddad2a26945114c7f8f4af4faaec Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 19 Oct 2023 13:06:37 +0100
Subject: [PATCH 0916/1398] one more

---
 .../Hyperbolic_triangulation_2/long_description.txt           | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Hyperbolic_triangulation_2/package_info/Hyperbolic_triangulation_2/long_description.txt b/Hyperbolic_triangulation_2/package_info/Hyperbolic_triangulation_2/long_description.txt
index a2b66caeffdf..f2e339fd84e2 100644
--- a/Hyperbolic_triangulation_2/package_info/Hyperbolic_triangulation_2/long_description.txt
+++ b/Hyperbolic_triangulation_2/package_info/Hyperbolic_triangulation_2/long_description.txt
@@ -8,5 +8,5 @@ is available in:
         Mikhail Bogdanov, Olivier Devillers, and Monique Teillaud. Hyperbolic
         Delaunay complexes and Voronoi diagrams made practical. Journal of
         Computational Geometry, 5(1):56–85, 2014.
-        URL: https://hal.inria.fr/hal-00961390,
-        doi:10.20382/jocg.v5i1a4.
\ No newline at end of file
+        URL: https://inria.hal.science/hal-00961390,
+        doi:10.20382/jocg.v5i1a4.

From ff2d8b49b2c072f9ffdd4ef421f89589331cb615 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 19 Oct 2023 13:36:45 +0100
Subject: [PATCH 0917/1398] PMP: Remove doc of deprecated code

---
 .../include/CGAL/polygon_mesh_processing.h     | 18 ------------------
 1 file changed, 18 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/polygon_mesh_processing.h b/Polygon_mesh_processing/include/CGAL/polygon_mesh_processing.h
index 4eec2ff467fd..b9892a67f163 100644
--- a/Polygon_mesh_processing/include/CGAL/polygon_mesh_processing.h
+++ b/Polygon_mesh_processing/include/CGAL/polygon_mesh_processing.h
@@ -49,21 +49,3 @@
 #include <CGAL/Polygon_mesh_processing/smooth_mesh.h>
 #include <CGAL/Polygon_mesh_processing/smooth_shape.h>
 #include <CGAL/Polygon_mesh_processing/manifoldness.h>
-
-// the named parameter header being not documented the doc is put here for now
-#ifdef DOXYGEN_RUNNING
-namespace CGAL {
-namespace Polygon_mesh_processing {
-namespace parameters {
-
-/*! \ingroup namedparameters
-\deprecated This function is deprecated and `default_values()` should be used instead.
-This function can be used to indicate that all optional named parameters
-to be used are the default ones. This is particularly useful when a function
-requires more than one sequence of named parameters and default values is
-fine only for some of them.
-*/
-unspecified_type all_default();
-
-} } } // end of namespace CGAL::Polygon_mesh_processing::parameters
-#endif

From 08fa9f8a58fb24ae9119e06e1d188b3a21b1c568 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 20 Oct 2023 08:57:07 +0200
Subject: [PATCH 0918/1398] fix wording

---
 .../CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h     | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
index 8cd6dc4f6ccc..f1ceb6e59d33 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
@@ -46,7 +46,8 @@ namespace Polygon_mesh_processing {
  *
  * \cgalNamedParamsBegin
  *   \cgalParamNBegin{edge_is_constrained_map}
- *     \cgalParamDescription{an output property map associating `true` to all new edges added by the cut, and `false` to input edges.}
+ *     \cgalParamDescription{an output property map associating `true` to all new edges connecting vertices on the isolevel,
+ *                           and `false` for all other edges.}
  *     \cgalParamType{a class model of `WritablePropertyMap` with `boost::graph_traits<PolygonMesh>::%edge_descriptor`
  *                    as key type and `bool` as value type}
  *     \cgalParamDefault{No marks on edges will be put}

From fe28c0d64acd1fc151a7792a934f05155350a520 Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Fri, 20 Oct 2023 11:46:39 +0200
Subject: [PATCH 0919/1398] doc bugs

Co-authored-by: Andreas Fabri <andreas.fabri@geometryfactory.com>
---
 .../CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h    | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
index f1ceb6e59d33..293d791a47cd 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
@@ -46,7 +46,7 @@ namespace Polygon_mesh_processing {
  *
  * \cgalNamedParamsBegin
  *   \cgalParamNBegin{edge_is_constrained_map}
- *     \cgalParamDescription{an output property map associating `true` to all new edges connecting vertices on the isolevel,
+ *     \cgalParamDescription{an output property map associating `true` to all edges connecting vertices on the isolevel,
  *                           and `false` for all other edges.}
  *     \cgalParamType{a class model of `WritablePropertyMap` with `boost::graph_traits<PolygonMesh>::%edge_descriptor`
  *                    as key type and `bool` as value type}
@@ -55,7 +55,7 @@ namespace Polygon_mesh_processing {
  *
  *   \cgalParamNBegin{vertex_point_map}
  *     \cgalParamDescription{a property map associating points to the vertices of `pm`}
- *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+ *     \cgalParamType{a class model of `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
  *                    as key type and `%Point_3` as value type}
  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pm)`}
  *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`

From a9e1fb885ca238057603f4818ae4367171f59b05 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 20 Oct 2023 15:09:31 +0200
Subject: [PATCH 0920/1398] apply Monique's review

---
 Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
index 7222277125b6..e0299c893339 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
@@ -1304,17 +1304,17 @@ Finite_vertex_handles finite_vertex_handles() const;
 Points points() const;
 
 /*!
-* returns an array of `Vertex_handle`s containing the end-vertices of `e`
+* returns an array containing the vertices of `e`
 */
 std::array<Vertex_handle, 2> vertices(const Edge& e) const;
 
 /*!
-* returns an array of `Vertex_handle`s containing the vertices of `f`
+* returns an array containing the vertices of `f`
 */
 std::array<Vertex_handle, 3> vertices(const Facet& f) const;
 
 /*!
-* returns an array of `Vertex_handle`s containing the vertices of `c`
+* returns an array containing the vertices of `c`
 */
 std::array<Vertex_handle, 4> vertices(const Cell_handle c) const;
 

From 86502db00a85ae05d4656d7c43bb56bbedd5d992 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 20 Oct 2023 14:44:17 +0100
Subject: [PATCH 0921/1398] Parameterization: cleanup

---
 OpenNL/include/CGAL/OpenNL/bicgstab.h         | 332 ------------------
 OpenNL/include/CGAL/OpenNL/blas.h             |  67 ----
 .../include/CGAL/OpenNL/conjugate_gradient.h  | 240 -------------
 OpenNL/include/CGAL/OpenNL/full_vector.h      | 148 --------
 OpenNL/include/CGAL/OpenNL/linear_solver.h    | 179 ----------
 OpenNL/include/CGAL/OpenNL/preconditioner.h   | 214 -----------
 OpenNL/include/CGAL/OpenNL/sparse_matrix.h    | 256 --------------
 .../LSCM_parameterizer_3.h                    |   7 +-
 8 files changed, 1 insertion(+), 1442 deletions(-)
 delete mode 100644 OpenNL/include/CGAL/OpenNL/bicgstab.h
 delete mode 100644 OpenNL/include/CGAL/OpenNL/blas.h
 delete mode 100644 OpenNL/include/CGAL/OpenNL/conjugate_gradient.h
 delete mode 100644 OpenNL/include/CGAL/OpenNL/full_vector.h
 delete mode 100644 OpenNL/include/CGAL/OpenNL/preconditioner.h
 delete mode 100644 OpenNL/include/CGAL/OpenNL/sparse_matrix.h

diff --git a/OpenNL/include/CGAL/OpenNL/bicgstab.h b/OpenNL/include/CGAL/OpenNL/bicgstab.h
deleted file mode 100644
index a9cef2c92e81..000000000000
--- a/OpenNL/include/CGAL/OpenNL/bicgstab.h
+++ /dev/null
@@ -1,332 +0,0 @@
-// Copyright (c) 2005-2008  Inria Loria (France).
-/*
- * author:  Bruno Levy, INRIA, project ALICE
- * website: https://www.loria.fr/~levy/software
- *
- * This file is part of CGAL (www.cgal.org)
- *
- * Scientific work that use this software can reference the website and
- * the following publication:
- *
- * @INPROCEEDINGS {levy:NMDGP:05,
- *    AUTHOR = Bruno Levy,
- *    TITLE  = Numerical Methods for Digital Geometry Processing,
- *    BOOKTITLE =Israel Korea Bi-National Conference,
- *    YEAR=November 2005,
- *    URL=https://www.loria.fr/~levy/php/article.php?pub=../publications/papers/2005/Numerics
- * }
- *
- *  Laurent Saboret 2005-2008: Changes for CGAL:
- *      - Added OpenNL namespace
- *      - solve() returns true on success
- *      - check divisions by zero
- *      - added comments and traces
- *      - copied BICGSTAB algorithm WITH preconditioner from Graphite 1.9 code
- *
- * $URL$
- * $Id$
- * SPDX-License-Identifier: LGPL-3.0-or-later
- */
-
-#ifndef __OPENNL_BICGSTAB__
-#define __OPENNL_BICGSTAB__
-
-#include <CGAL/OpenNL/blas.h>
-#include <CGAL/assertions.h>
-
-#include <cmath>
-#include <cfloat>
-#include <climits>
-#include <limits>
-
-namespace OpenNL {
-
-
-/**
-    *  The BICGSTAB algorithm without preconditioner:
- *  Ashby, Manteuffel, Saylor
- *     A taxononmy for conjugate gradient methods
- *     SIAM J Numer Anal 27, 1542-1568 (1990)
- *
- * This implementation is inspired by the lsolver library,
- * by Christian Badura, available from:
- * http://www.mathematik.uni-freiburg.de/IAM/Research/projectskr/lin_solver/
- *
- * @param A generic square matrix; a function
- *   mult(const MATRIX& M, const double* x, double* y)
- * and a member function
- *   int dimension() const
- * must to be defined.
- * @param b right hand side of the system.
- * @param x initial value.
- * @param eps threshold for the residual.
- * @param max_iter maximum number of iterations.
- */
-
-template <class MATRIX, class VECTOR> class Solver_BICGSTAB {
-public:
-    typedef MATRIX Matrix ;
-    typedef VECTOR Vector ;
-    typedef typename Vector::CoeffType CoeffType ;
-
-public:
-    Solver_BICGSTAB() {
-        epsilon_ = 1e-6 ;
-        max_iter_ = 0 ;
-    }
-
-    // Default copy constructor, operator =() and destructor are fine
-
-    void set_epsilon(CoeffType eps) { epsilon_ = eps ; }
-    void set_max_iter(unsigned int max_iter) { max_iter_ = max_iter ; }
-
-    // Solve the sparse linear system "A*x = b". Return true on success.
-    bool solve(const MATRIX &A, const VECTOR& b, VECTOR& x)
-    {
-#ifdef DEBUG_TRACE
-        std::cerr << "  Call BICGSTAB" << std::endl;
-#endif
-        CGAL_assertion(A.dimension() > 0);
-        unsigned int n = A.dimension() ;                        // (Square) matrix dimension
-
-        unsigned int max_iter = max_iter_ ;                     // Max number of iterations
-        if(max_iter == 0) {
-            max_iter = 5 * n ;
-        }
-
-        Vector rT(n) ;                                          // Initial residue rT=Ax-b
-        Vector d(n) ;
-        Vector h(n) ;
-        Vector u(n) ;
-        Vector Ad(n) ;
-        Vector t(n) ;
-        Vector& s = h ;
-        CoeffType rTh, rTAd, rTr, alpha, beta, omega, st, tt;
-        unsigned int its=0;                                     // Loop counter
-        CoeffType err=epsilon_*epsilon_*BLAS<Vector>::dot(b,b); // Error to reach
-        Vector r(n) ;                                           // residue r=A*x-b
-        mult(A,x,r);
-        BLAS<Vector>::axpy(-1,b,r);
-        BLAS<Vector>::copy(r,d);
-        BLAS<Vector>::copy(d,h);
-        BLAS<Vector>::copy(h,rT);
-        //CGAL_assertion(BLAS<Vector>::dot(rT,rT) == 0.0);      // may happen for small systems
-        rTh=BLAS<Vector>::dot(rT,h);                            // rTh = (rT|h)
-        rTr=BLAS<Vector>::dot(r,r);                             // error rTr = (r|r)
-
-        while ( rTr>err && its < max_iter) {
-            mult(A,d,Ad);
-            rTAd=BLAS<Vector>::dot(rT,Ad);
-            CGAL_assertion(rTAd != 0.0);
-            alpha=rTh/rTAd;
-            BLAS<Vector>::axpy(-alpha,Ad,r);
-            BLAS<Vector>::copy(h,s);
-            BLAS<Vector>::axpy(-alpha,Ad,s);
-            mult(A,s,t);
-            BLAS<Vector>::axpy(1,t,u);
-            BLAS<Vector>::scal(alpha,u);
-            st=BLAS<Vector>::dot(s,t);
-            tt=BLAS<Vector>::dot(t,t);
-            if (st == 0.0 || tt == 0.0)
-                omega = 0 ;
-            else
-                omega = st/tt;
-            BLAS<Vector>::axpy(-omega,t,r);
-            BLAS<Vector>::axpy(-alpha,d,x);
-            BLAS<Vector>::axpy(-omega,s,x);
-            rTr=BLAS<Vector>::dot(r,r);
-            BLAS<Vector>::copy(s,h);
-            BLAS<Vector>::axpy(-omega,t,h);
-            if (omega == 0.0)                                   // stop if omega==0 (success)
-            {
-#ifdef DEBUG_TRACE
-                std::cerr << "  BICGSTAB: omega=0" << std::endl;
-#endif
-                break;
-            }
-            if (rTh == 0.0)                                     // stop if rTh==0 (failure)
-            {
-#ifdef DEBUG_TRACE
-                std::cerr << "  BICGSTAB: rTh=0" << std::endl;
-#endif
-                break;
-            }
-            beta=(alpha/omega)/rTh;                             // beta = (rTh/"old rTh") * (alpha/omega)
-            rTh=BLAS<Vector>::dot(rT,h);
-            beta*=rTh;
-            BLAS<Vector>::scal(beta,d);
-            BLAS<Vector>::axpy(1,h,d);
-            BLAS<Vector>::axpy(-beta*omega,Ad,d);
-            ++its;
-        }
-
-        bool success = (rTr <= err);
-        return success;
-    }
-
-private:
-    // Test if a floating point number is (close to) 0.0
-    static bool IsZero(CoeffType a)
-    {
-        return (std::fabs(a) < 10.0 * (std::numeric_limits<CoeffType>::min)());
-    }
-
-private:
-    CoeffType epsilon_ ;
-    unsigned int max_iter_ ;
-} ;
-
-
-/**
- *  The BICGSTAB algorithm WITH preconditioner:
- *  Ashby, Manteuffel, Saylor
- *     A taxononmy for conjugate gradient methods
- *     SIAM J Numer Anal 27, 1542-1568 (1990)
- *
- * This implementation is inspired by the lsolver library,
- * by Christian Badura, available from:
- * http://www.mathematik.uni-freiburg.de/IAM/Research/projectskr/lin_solver/
- *
- * @param A generic square matrix; a function
- *   mult(const MATRIX& M, const double* x, double* y)
- * and a member function
- *   int dimension() const
- * must to be defined.
- * @param C preconditioner; a function
- *   mult(const PC_MATRIX& C, const double* x, double* y)
- * needs to be defined.
- * @param b right hand side of the system.
- * @param x initial value.
- * @param eps threshold for the residual.
- * @param max_iter maximum number of iterations.
- */
-
-template< class MATRIX, class PC_MATRIX, class VECTOR >
-class Solver_preconditioned_BICGSTAB
-{
-public:
-    typedef MATRIX Matrix ;
-    typedef PC_MATRIX Preconditioner ;
-    typedef VECTOR Vector ;
-    typedef typename Vector::CoeffType CoeffType ;
-
-public:
-    Solver_preconditioned_BICGSTAB() {
-        epsilon_ = 1e-6 ;
-        max_iter_ = 0 ;
-    }
-
-    // Default copy constructor, operator =() and destructor are fine
-
-    void set_epsilon(CoeffType eps) { epsilon_ = eps ; }
-    void set_max_iter(unsigned int max_iter) { max_iter_ = max_iter ; }
-
-    // Solve the sparse linear system "A*x = b". Return true on success.
-    bool solve(const MATRIX &A, const PC_MATRIX &C, const VECTOR& b, VECTOR& x)
-    {
-#ifdef DEBUG_TRACE
-        std::cerr << "  Call BICGSTAB with preconditioner" << std::endl;
-#endif
-        CGAL_assertion(A.dimension() > 0);
-        unsigned int n = A.dimension() ;                        // (Square) matrix dimension
-
-        unsigned int max_iter = max_iter_ ;                     // Max number of iterations
-        if(max_iter == 0) {
-            max_iter = 5 * n ;
-        }
-
-        Vector rT(n) ;                                          // Initial residue rT=Ax-b
-        Vector d(n) ;
-        Vector h(n) ;
-        Vector u(n) ;
-        Vector Sd(n) ;
-        Vector t(n) ;
-        Vector aux(n) ;
-        Vector& s = h ;
-        CoeffType rTh, rTSd, rTr, alpha, beta, omega, st, tt;
-        unsigned int its=0;                                     // Loop counter
-        CoeffType err=epsilon_*epsilon_*BLAS<Vector>::dot(b,b); // Error to reach
-        Vector r(n) ;                                           // residue r=A*x-b
-        mult(A,x,r);
-        BLAS<Vector>::axpy(-1,b,r);
-        mult(C,r,d);
-        BLAS<Vector>::copy(d,h);
-        BLAS<Vector>::copy(h,rT);
-        //CGAL_assertion(BLAS<Vector>::dot(rT,rT) == 0.0);      // may happen for small systems
-        rTh=BLAS<Vector>::dot(rT,h);                            // rTh = (rT|h)
-        rTr=BLAS<Vector>::dot(r,r);                             // error rTr = (r|r)
-
-        while (rTr>err && its < max_iter) {
-            mult(A,d,aux);
-            mult(C,aux,Sd);
-            rTSd=BLAS<Vector>::dot(rT,Sd);
-            if (rTSd == 0.0)                                     // stop if rTSd==0 (failure)
-            {
-#ifdef DEBUG_TRACE
-                std::cerr << "  BICGSTAB with preconditioner: rTSd=0" << std::endl;
-#endif
-                break;
-            }
-            alpha=rTh/rTSd;
-            BLAS<Vector>::axpy(-alpha,aux,r);
-            BLAS<Vector>::copy(h,s);
-            BLAS<Vector>::axpy(-alpha,Sd,s);
-            mult(A,s,aux);
-            mult(C,aux,t);
-            BLAS<Vector>::axpy(1,t,u);
-            BLAS<Vector>::scal(alpha,u);
-            st=BLAS<Vector>::dot(s,t);
-            tt=BLAS<Vector>::dot(t,t);
-            if (st == 0.0 || tt == 0.0)
-                omega = 0 ;
-            else
-                omega = st/tt;
-            BLAS<Vector>::axpy(-omega,aux,r);
-            BLAS<Vector>::axpy(-alpha,d,x);
-            BLAS<Vector>::axpy(-omega,s,x);
-            rTr=BLAS<Vector>::dot(r,r);
-            BLAS<Vector>::copy(s,h);
-            BLAS<Vector>::axpy(-omega,t,h);
-            if (omega == 0.0)                                   // stop if omega==0 (success)
-            {
-#ifdef DEBUG_TRACE
-                std::cerr << "  BICGSTAB with preconditioner: omega=0" << std::endl;
-#endif
-                break;
-            }
-            if (rTh == 0.0)                                     // stop if rTh==0 (failure)
-            {
-#ifdef DEBUG_TRACE
-                std::cerr << "  BICGSTAB with preconditioner: rTh=0" << std::endl;
-#endif
-                break;
-            }
-            beta=(alpha/omega)/rTh;                             // beta = (rTh/"old rTh") * (alpha/omega)
-            rTh=BLAS<Vector>::dot(rT,h);
-            beta*=rTh;
-            BLAS<Vector>::scal(beta,d);                         // d = h + beta * (d - omega * Sd);
-            BLAS<Vector>::axpy(1,h,d);
-            BLAS<Vector>::axpy(-beta*omega,Sd,d);
-            ++its;
-        }
-
-        bool success = (rTr <= err);
-        return success;
-    }
-
-private:
-    // Test if a floating point number is (close to) 0.0
-    static bool IsZero(CoeffType a)
-    {
-        return (std::fabs(a) < 10.0 * (std::numeric_limits<CoeffType>::min)());
-    }
-
-private:
-    CoeffType epsilon_ ;
-    unsigned int max_iter_ ;
-} ;
-
-
-} // namespace OpenNL
-
-#endif // __OPENNL_BICGSTAB__
diff --git a/OpenNL/include/CGAL/OpenNL/blas.h b/OpenNL/include/CGAL/OpenNL/blas.h
deleted file mode 100644
index 8cea9da67ad9..000000000000
--- a/OpenNL/include/CGAL/OpenNL/blas.h
+++ /dev/null
@@ -1,67 +0,0 @@
-// Copyright (c) 2005-2008  Inria Loria (France).
-/*
- * author:  Bruno Levy, INRIA, project ALICE
- * website: https://www.loria.fr/~levy/software
- *
- * This file is part of CGAL (www.cgal.org)
- *
- * Scientific work that use this software can reference the website and
- * the following publication:
- *
- * @INPROCEEDINGS {levy:NMDGP:05,
- *    AUTHOR = Bruno Levy,
- *    TITLE  = Numerical Methods for Digital Geometry Processing,
- *    BOOKTITLE =Israel Korea Bi-National Conference,
- *    YEAR=November 2005,
- *    URL=https://www.loria.fr/~levy/php/article.php?pub=../publications/papers/2005/Numerics
- * }
- *
- *  Laurent Saboret 01/2005: Change for CGAL:
- *      - Added OpenNL namespace
- *  Andreas Meyer 2007 changes for CGAL:
- *      - replaced assert with CGAL_assertion/CGAL_error etc.
- *
- * $URL$
- * $Id$
- * SPDX-License-Identifier: LGPL-3.0-or-later
-*/
-
-#ifndef __OPENNL_BLAS__
-#define __OPENNL_BLAS__
-
-#include <CGAL/assertions.h>
-
-namespace OpenNL {
-
-
-/** Basic Linear Algebra Subroutines */
-template <class VECTOR> class BLAS {
-public:
-    typedef VECTOR VectorType ;
-    typedef typename VECTOR::CoeffType CoeffType ;
-
-    /** y <- y + a*x  */
-    static void axpy(CoeffType /*a*/, const VectorType& /*x*/, VectorType& /*y*/) {
-        CGAL_error();
-    }
-
-    /** x <- a*x */
-    static void scal(CoeffType /*a*/, VectorType& /*x*/) {
-        CGAL_error();
-    }
-
-    /** y <- x */
-    static void copy(const VectorType& /*x*/, VectorType& /*y*/) {
-        CGAL_error();
-    }
-
-    /** returns x^t * y */
-    static CoeffType dot(const VectorType& /*x*/, const VectorType& /*y*/) {
-        CGAL_error();
-    }
-} ;
-
-
-} // namespace OpenNL
-
-#endif
diff --git a/OpenNL/include/CGAL/OpenNL/conjugate_gradient.h b/OpenNL/include/CGAL/OpenNL/conjugate_gradient.h
deleted file mode 100644
index 6f2e6f5b2e88..000000000000
--- a/OpenNL/include/CGAL/OpenNL/conjugate_gradient.h
+++ /dev/null
@@ -1,240 +0,0 @@
-// Copyright (c) 2005-2008  Inria Loria (France).
-/*
- * author:  Bruno Levy, INRIA, project ALICE
- * website: https://www.loria.fr/~levy/software
- *
- * This file is part of CGAL (www.cgal.org)
- *
- * Scientific work that use this software can reference the website and
- * the following publication:
- *
- * @INPROCEEDINGS {levy:NMDGP:05,
- *    AUTHOR = Bruno Levy,
- *    TITLE  = Numerical Methods for Digital Geometry Processing,
- *    BOOKTITLE =Israel Korea Bi-National Conference,
- *    YEAR=November 2005,
- *    URL=https://www.loria.fr/~levy/php/article.php?pub=../publications/papers/2005/Numerics
- * }
- *
- *  Laurent Saboret 2005-2006: Changes for CGAL:
- *      - Added OpenNL namespace
- *      - solve() returns true on success
- *      - check divisions by zero
- *      - added comments
- *      - copied Conjugate Gradient algorithm WITH preconditioner from Graphite 1.9 code
- *
- * $URL$
- * $Id$
- * SPDX-License-Identifier: LGPL-3.0-or-later
- */
-
-#ifndef __OPENNL_CONJUGATE_GRADIENT__
-#define __OPENNL_CONJUGATE_GRADIENT__
-
-#include <CGAL/OpenNL/blas.h>
-#include <CGAL/assertions.h>
-
-#include <cmath>
-#include <cfloat>
-#include <climits>
-
-namespace OpenNL {
-
-
-/**
- *  The Conjugate Gradient algorithm WITHOUT preconditioner:
- *  Ashby, Manteuffel, Saylor
- *     A taxononmy for conjugate gradient methods
- *     SIAM J Numer Anal 27, 1542-1568 (1990)
- *
- * This implementation is inspired by the lsolver library,
- * by Christian Badura, available from:
- * http://www.mathematik.uni-freiburg.de/IAM/Research/projectskr/lin_solver/
- *
- * @param A generic square matrix; a function
- *   mult(const MATRIX& M, const double* x, double* y)
- * and a member function
- *   int dimension() const
- * must to be defined.
- * @param b right hand side of the system.
- * @param x initial value.
- * @param eps threshold for the residual.
- * @param max_iter maximum number of iterations.
- */
-
-template<class MATRIX, class VECTOR> class Solver_CG {
-public:
-    typedef MATRIX Matrix ;
-    typedef VECTOR Vector ;
-    typedef typename Vector::CoeffType CoeffType ;
-
-public:
-    Solver_CG() {
-        epsilon_ = 1e-6 ;
-        max_iter_ = 0 ;
-    }
-
-    // Default copy constructor, operator =() and destructor are fine
-
-    void set_epsilon(CoeffType eps) { epsilon_ = eps ; }
-    void set_max_iter(unsigned int max_iter) { max_iter_ = max_iter ; }
-
-    // Solve the sparse linear system "A*x = b" for A symmetric positive definite
-    // Return true on success
-    bool solve(const MATRIX &A, const VECTOR& b, VECTOR& x)
-    {
-#ifdef DEBUG_TRACE
-        std::cerr << "  Call Conjugate Gradient" << std::endl;
-#endif
-        CGAL_assertion(A.dimension() > 0);
-        unsigned int n = A.dimension() ;                        // (Square) matrix dimension
-
-        unsigned int max_iter = max_iter_ ;                     // Max number of iterations
-        if(max_iter == 0) {
-            max_iter = 5 * n ;
-        }
-
-        Vector g(n) ;
-        Vector r(n) ;
-        Vector p(n) ;
-        unsigned int its=0;                                     // Loop counter
-        CoeffType t, tau, sig, rho, gam;
-        CoeffType bnorm2 = BLAS<Vector>::dot(b,b) ;
-        CoeffType err=epsilon_*epsilon_*bnorm2 ;                // Error to reach
-        // residue g=b-A*x
-        mult(A,x,g);
-        BLAS<Vector>::axpy(-1,b,g);
-        BLAS<Vector>::scal(-1,g);
-        // Initially, r=g=b-A*x
-        BLAS<Vector>::copy(g,r);                                // r = g
-
-        CoeffType gg=BLAS<Vector>::dot(g,g);                    // error gg = (g|g)
-        while ( gg>err && its < max_iter) {
-            mult(A,r,p);
-            rho=BLAS<Vector>::dot(p,p);
-            sig=BLAS<Vector>::dot(r,p);
-            tau=BLAS<Vector>::dot(g,r);
-            CGAL_assertion(sig != 0.0);
-            t=tau/sig;
-            BLAS<Vector>::axpy(t,r,x);
-            BLAS<Vector>::axpy(-t,p,g);
-            CGAL_assertion(tau != 0.0);
-            gam=(t*t*rho-tau)/tau;
-            BLAS<Vector>::scal(gam,r);
-            BLAS<Vector>::axpy(1,g,r);
-            gg=BLAS<Vector>::dot(g,g);                          // Update error gg = (g|g)
-            ++its;
-        }
-
-        bool success = (gg <= err);
-        return success;
-    }
-
-private:
-    CoeffType epsilon_ ;
-    unsigned int max_iter_ ;
-} ;
-
-
-/**
- *  The Conjugate Gradient algorithm WITH preconditioner:
- *  Ashby, Manteuffel, Saylor
- *     A taxononmy for conjugate gradient methods
- *     SIAM J Numer Anal 27, 1542-1568 (1990)
- *
- * This implementation is inspired by the lsolver library,
- * by Christian Badura, available from:
- * http://www.mathematik.uni-freiburg.de/IAM/Research/projectskr/lin_solver/
- *
- * @param A generic square matrix; a function
- *   mult(const MATRIX& M, const double* x, double* y)
- * and a member function
- *   int dimension() const
- * must to be defined.
- * @param C preconditioner; a function
- *   mult(const PC_MATRIX& C, const double* x, double* y)
- * needs to be defined.
- * @param b right hand side of the system.
- * @param x initial value.
- * @param eps threshold for the residual.
- * @param max_iter maximum number of iterations.
- */
-
-template< class MATRIX, class PC_MATRIX, class VECTOR >
-class Solver_preconditioned_CG
-{
-public:
-    typedef MATRIX Matrix ;
-    typedef PC_MATRIX Preconditioner ;
-    typedef VECTOR Vector ;
-    typedef typename Vector::CoeffType CoeffType ;
-
-public:
-    Solver_preconditioned_CG() {
-        epsilon_ = 1e-6 ;
-        max_iter_ = 0 ;
-    }
-
-    // Default copy constructor, operator =() and destructor are fine
-
-    void set_epsilon(CoeffType eps) { epsilon_ = eps ; }
-    void set_max_iter(unsigned int max_iter) { max_iter_ = max_iter ; }
-
-    // Solve the sparse linear system "A*x = b" for A symmetric positive definite
-    // Return true on success
-    bool solve(const MATRIX &A, const PC_MATRIX &C, const VECTOR& b, VECTOR& x)
-    {
-#ifdef DEBUG_TRACE
-        std::cerr << "  Call Conjugate Gradient with preconditioner" << std::endl;
-#endif
-        CGAL_assertion(A.dimension() > 0);
-        unsigned int n = A.dimension() ;                        // (Square) matrix dimension
-
-        unsigned int max_iter = max_iter_ ;                     // Max number of iterations
-        if(max_iter == 0) {
-            max_iter = 5 * n ;
-        }
-
-        Vector r(n) ;                                           // residue r=Ax-b
-        Vector d(n) ;
-        Vector h(n) ;
-        Vector Ad = h ;
-        unsigned int its=0;                                     // Loop counter
-        CoeffType rh, alpha, beta;
-        CoeffType bnorm2 = BLAS<Vector>::dot(b,b) ;
-        CoeffType err=epsilon_*epsilon_*bnorm2 ;                // Error to reach
-        mult(A,x,r);
-        BLAS<Vector>::axpy(-1,b,r);
-        mult(C,r,d);
-        BLAS<Vector>::copy(d,h);
-        rh=BLAS<Vector>::dot(r,h);
-
-        CoeffType rr=BLAS<Vector>::dot(r,r);                    // error rr = (r|r)
-        while ( rr>err && its < max_iter) {
-            mult(A,d,Ad);
-            CGAL_assertion(BLAS<Vector>::dot(d,Ad) != 0.0);
-            alpha=rh/BLAS<Vector>::dot(d,Ad);
-            BLAS<Vector>::axpy(-alpha,d,x);
-            BLAS<Vector>::axpy(-alpha,Ad,r);
-            mult(C,r,h);
-            CGAL_assertion(rh != 0.0);
-            beta=1/rh; rh=BLAS<Vector>::dot(r,h); beta*=rh;
-            BLAS<Vector>::scal(beta,d);
-            BLAS<Vector>::axpy(1,h,d);
-            rr=BLAS<Vector>::dot(r,r);                          // Update error rr = (r|r)
-            ++its;
-        }
-
-        bool success = (rr <= err);
-        return success;
-    }
-
-private:
-    CoeffType epsilon_ ;
-    unsigned int max_iter_ ;
-} ;
-
-
-} // namespace OpenNL
-
-#endif // __OPENNL_CONJUGATE_GRADIENT__
diff --git a/OpenNL/include/CGAL/OpenNL/full_vector.h b/OpenNL/include/CGAL/OpenNL/full_vector.h
deleted file mode 100644
index 0459808b6380..000000000000
--- a/OpenNL/include/CGAL/OpenNL/full_vector.h
+++ /dev/null
@@ -1,148 +0,0 @@
-// Copyright (c) 2005-2008  Inria Loria (France).
-/*
- * author:  Bruno Levy, INRIA, project ALICE
- * website: https://www.loria.fr/~levy/software
- *
- * This file is part of CGAL (www.cgal.org)
- *
- * Scientific work that use this software can reference the website and
- * the following publication:
- *
- * @INPROCEEDINGS {levy:NMDGP:05,
- *    AUTHOR = Bruno Levy,
- *    TITLE  = Numerical Methods for Digital Geometry Processing,
- *    BOOKTITLE =Israel Korea Bi-National Conference,
- *    YEAR=November 2005,
- *    URL=https://www.loria.fr/~levy/php/article.php?pub=../publications/papers/2005/Numerics
- * }
- *
- *  Laurent Saboret 01/2005: Change for CGAL:
- *      - Added OpenNL namespace
- *      - FullVector is now a model of the SparseLinearAlgebraTraits_d::Vector concept
- *      - Coefficients are initialized with zeros
- *
- * $URL$
- * $Id$
- * SPDX-License-Identifier: LGPL-3.0-or-later
- */
-
-
-#ifndef __OPENNL_FULL_VECTOR__
-#define __OPENNL_FULL_VECTOR__
-
-#include <CGAL/OpenNL/blas.h>
-#include <CGAL/assertions.h>
-
-#include <cstdlib>
-
-namespace OpenNL {
-
-
-// Class FullVector
-// Model of the SparseLinearAlgebraTraits_d::Vector concept
-template <class T> class FullVector
-{
-// Public types
-public:
-    typedef T CoeffType ;
-
-    // for SparseLinearAlgebraTraits_d::Vector concept
-    typedef T NT;
-
-    // Create a vector initialized with zeros
-    FullVector(unsigned int dim) {
-        dimension_ = dim ; coeff_ = new T[dim] ;
-
-        // init with zeros (for SparseLinearAlgebraTraits_d::Vector concept)
-        for (unsigned int i=0; i < dimension_; i++)
-            coeff_[i] = 0;
-    }
-    // Copy constructor
-    FullVector(const FullVector& toCopy) {
-        dimension_ = toCopy.dimension_ ;
-        coeff_ = new T[dimension_] ;
-        for (unsigned int i=0; i < dimension_; i++)
-            coeff_[i] = toCopy.coeff_[i];
-    }
-    // operator =()
-    FullVector& operator =(const FullVector& toCopy) {
-        delete[] coeff_ ;
-
-        dimension_ = toCopy.dimension_ ;
-        coeff_ = new T[dimension_] ;
-        for (unsigned int i=0; i < dimension_; i++)
-            coeff_[i] = toCopy.coeff_[i];
-
-        return *this;
-    }
-
-    ~FullVector() {
-        delete[] coeff_ ;
-        coeff_ = nullptr ;
-    }
-
-    // Return the vector's number of coefficients
-    unsigned int dimension() const {
-        return dimension_ ;
-    }
-    // Read/write access to 1 vector coefficient.
-    //
-    // Preconditions:
-    // * 0 <= i < dimension()
-    const T& operator[](unsigned int i) const {
-        CGAL_assertion(i < dimension_) ;
-        return coeff_[i] ;
-    }
-    T& operator[](unsigned int i) {
-        CGAL_assertion(i < dimension_) ;
-        return coeff_[i] ;
-    }
-
-private:
-    unsigned int dimension_ ;
-    T* coeff_ ;
-} ;
-
-template <class T> class BLAS< FullVector<T> > {
-public:
-    typedef FullVector<T> VectorType ;
-    typedef T CoeffType ;
-
-    /** y <- y + a*x  */
-    static void axpy(CoeffType a, const VectorType& x, VectorType& y) {
-        CGAL_assertion(x.dimension() == y.dimension()) ;
-        for(unsigned int i=0; i<x.dimension(); i++) {
-            y[i] += a * x[i] ;
-        }
-    }
-
-    /** x <- a*x */
-    static void scal(CoeffType a, VectorType& x) {
-        for(unsigned int i=0; i<x.dimension(); i++) {
-            x[i] *= a ;
-        }
-    }
-
-    /** y <- x */
-    static void copy(const VectorType& x, VectorType& y) {
-        CGAL_assertion(x.dimension() == y.dimension()) ;
-        for(unsigned int i=0; i<x.dimension(); i++) {
-            y[i] = x[i] ;
-        }
-    }
-
-    /** returns x^t * y */
-    static CoeffType dot(const VectorType& x, const VectorType& y) {
-        CoeffType result = 0 ;
-        CGAL_assertion(x.dimension() == y.dimension()) ;
-        for(unsigned int i=0; i<x.dimension(); i++) {
-            result += y[i] * x[i] ;
-        }
-        return result ;
-    }
-} ;
-
-
-} // namespace OpenNL
-
-#endif // __OPENNL_FULL_VECTOR__
diff --git a/OpenNL/include/CGAL/OpenNL/linear_solver.h b/OpenNL/include/CGAL/OpenNL/linear_solver.h
index cb405afef11f..47a52dfecebf 100644
--- a/OpenNL/include/CGAL/OpenNL/linear_solver.h
+++ b/OpenNL/include/CGAL/OpenNL/linear_solver.h
@@ -31,12 +31,6 @@
 #ifndef __OPENNL_LINEAR_SOLVER__
 #define __OPENNL_LINEAR_SOLVER__
 
-#include <CGAL/OpenNL/conjugate_gradient.h>
-#include <CGAL/OpenNL/bicgstab.h>
-#include <CGAL/OpenNL/preconditioner.h>
-#include <CGAL/OpenNL/sparse_matrix.h>
-#include <CGAL/OpenNL/full_vector.h>
-
 #include <vector>
 #include <iostream>
 #include <cstdlib>
@@ -47,128 +41,6 @@ namespace OpenNL {
 
 
 
-// Class DefaultLinearSolverTraits
-// is a traits class for solving general sparse linear systems.
-// It uses BICGSTAB solver with Jacobi preconditioner.
-//
-// Concept: Model of the SparseLinearAlgebraTraits_d concept.
-
-template
-<
-    class COEFFTYPE,                        // type of matrix and vector coefficients
-    class MATRIX = SparseMatrix<COEFFTYPE>, // model of SparseLinearSolverTraits_d::Matrix
-    class VECTOR = FullVector<COEFFTYPE>    // model of SparseLinearSolverTraits_d::Vector
->
-class DefaultLinearSolverTraits
-{
-// Public types
-public:
-    typedef COEFFTYPE                       CoeffType ;
-    typedef COEFFTYPE                       NT;
-    typedef MATRIX                          Matrix ;
-    typedef VECTOR                          Vector ;
-
-// Private types
-private:
-    typedef Jacobi_Preconditioner<NT>       Preconditioner ;
-    typedef Solver_preconditioned_BICGSTAB<Matrix, Preconditioner, Vector>
-                                            Preconditioned_solver ;
-    typedef Solver_BICGSTAB<Matrix, Vector> Solver ;
-
-// Public operations
-public:
-    // Default constructor, copy constructor, operator=() and destructor are fine
-
-    // Solve the sparse linear system "A*X = B"
-    // Return true on success. The solution is then (1/D) * X.
-    //
-    // Preconditions:
-    // - A.row_dimension()    == B.dimension()
-    // - A.column_dimension() == X.dimension()
-    bool linear_solver (const Matrix& A, const Vector& B, Vector& X, NT& D)
-    {
-        D = 1;              // OpenNL does not support homogeneous coordinates
-
-        // Solve using BICGSTAB solver with preconditioner
-        Preconditioned_solver preconditioned_solver ;
-        NT omega = 1.5;
-        Preconditioner C(A, omega);
-        X = B;
-        if (preconditioned_solver.solve(A, C, B, X))
-            return true;
-
-        // On error, solve using BICGSTAB solver without preconditioner
-#ifdef DEBUG_TRACE
-        std::cerr << "  Failure of BICGSTAB solver with Jacobi preconditioner. "
-                  << "Trying BICGSTAB." << std::endl;
-#endif
-        Solver solver ;
-        X = B;
-        return solver.solve(A, B, X) ;
-    }
-} ;
-
-// Class SymmetricLinearSolverTraits
-// is a traits class for solving symmetric positive definite sparse linear systems.
-// It uses Conjugate Gradient solver with Jacobi preconditioner.
-//
-// Concept: Model of the SparseLinearAlgebraTraits_d concept.
-
-template
-<
-    class COEFFTYPE,                        // type of matrix and vector coefficients
-    class MATRIX = SparseMatrix<COEFFTYPE>, // model of SparseLinearSolverTraits_d::Matrix
-    class VECTOR = FullVector<COEFFTYPE>    // model of SparseLinearSolverTraits_d::Vector
->
-class SymmetricLinearSolverTraits
-{
-// Public types
-public:
-    typedef COEFFTYPE                       CoeffType ;
-    typedef COEFFTYPE                       NT;
-    typedef MATRIX                          Matrix ;
-    typedef VECTOR                          Vector ;
-
-// Private types
-private:
-    typedef Jacobi_Preconditioner<NT>       Preconditioner ;
-    typedef Solver_preconditioned_CG<Matrix, Preconditioner, Vector>
-                                            Preconditioned_solver ;
-    typedef Solver_CG<Matrix, Vector>       Solver ;
-
-// Public operations
-public:
-    // Default constructor, copy constructor, operator=() and destructor are fine
-
-    // Solve the sparse linear system "A*X = B"
-    // Return true on success. The solution is then (1/D) * X.
-    //
-    // Preconditions:
-    // - A.row_dimension()    == B.dimension()
-    // - A.column_dimension() == X.dimension()
-    bool linear_solver (const Matrix& A, const Vector& B, Vector& X, NT& D)
-    {
-        D = 1;              // OpenNL does not support homogeneous coordinates
-
-        // Solve using Conjugate Gradient solver with preconditioner
-        Preconditioned_solver preconditioned_solver ;
-        NT omega = 1.5;
-        Preconditioner C(A, omega);
-        X = B;
-        if (preconditioned_solver.solve(A, C, B, X))
-            return true;
-
-        // On error, solve using Conjugate Gradient solver without preconditioner
-#ifdef DEBUG_TRACE
-        std::cerr << "  Failure of Conjugate Gradient solver with Jacobi preconditioner. "
-                  << "Trying Conjugate Gradient." << std::endl;
-#endif
-        Solver solver ;
-        X = B;
-        return solver.solve(A, B, X) ;
-    }
-};
-
 
 /*
  * Solves a linear system or minimizes a quadratic form.
@@ -280,11 +152,6 @@ class LinearSolver
         bk_ = 0 ;
     }
 
-    void set_right_hand_side(double b) {
-        check_state(IN_ROW) ;
-        bk_ = b ;
-    }
-
     void add_coefficient(unsigned int iv, double a) {
         check_state(IN_ROW) ;
         Variable& v = variable(iv) ;
@@ -297,34 +164,6 @@ class LinearSolver
         }
     }
 
-    void normalize_row(CoeffType weight = 1) {
-        check_state(IN_ROW) ;
-        CoeffType norm = 0.0 ;
-        unsigned int nf = af_.size() ;
-        for(unsigned int i=0; i<nf; i++) {
-            norm += af_[i] * af_[i] ;
-        }
-        unsigned int nl = al_.size() ;
-        for(unsigned int i=0; i<nl; i++) {
-            norm += al_[i] * al_[i] ;
-        }
-        norm = sqrt(norm) ;
-        CGAL_assertion( fabs(norm)>1e-40 );
-        scale_row(weight / norm) ;
-    }
-
-    void scale_row(CoeffType s) {
-        check_state(IN_ROW) ;
-        unsigned int nf = af_.size() ;
-         for(unsigned int i=0; i<nf; i++) {
-             af_[i] *= s ;
-         }
-         unsigned int nl = al_.size() ;
-         for(unsigned int i=0; i<nl; i++) {
-             al_[i] *= s ;
-         }
-         bk_ *= s ;
-    }
 
     void end_row() {
         if(least_squares_) {
@@ -411,24 +250,6 @@ class LinearSolver
 
     // ----------- Finite state automaton (checks that calling sequence is respected) ---------
 
-    std::string state_to_string(State s) {
-            switch(s) {
-            case INITIAL:
-                return "initial" ;
-            case IN_SYSTEM:
-                return "in system" ;
-            case IN_ROW:
-                return "in row" ;
-            case CONSTRUCTED:
-                return "constructed" ;
-            case SOLVED:
-                return "solved" ;
-            }
-            // Should not go there.
-            CGAL_error();
-            return "undefined" ;
-    }
-
     void check_state(State s) {
             CGAL_USE(s);
             CGAL_assertion(state_ == s) ;
diff --git a/OpenNL/include/CGAL/OpenNL/preconditioner.h b/OpenNL/include/CGAL/OpenNL/preconditioner.h
deleted file mode 100644
index 808b6f39eb1d..000000000000
--- a/OpenNL/include/CGAL/OpenNL/preconditioner.h
+++ /dev/null
@@ -1,214 +0,0 @@
-// Copyright (c) 2005-2008  Inria Loria (France).
-/*
- * author:  Bruno Levy, INRIA, project ALICE
- * website: https://www.loria.fr/~levy/software
- *
- * This file is part of CGAL (www.cgal.org)
- *
- * Scientific work that use this software can reference the website and
- * the following publication:
- *
- * @INPROCEEDINGS {levy:NMDGP:05,
- *    AUTHOR = Bruno Levy,
- *    TITLE  = Numerical Methods for Digital Geometry Processing,
- *    BOOKTITLE =Israel Korea Bi-National Conference,
- *    YEAR=November 2005,
- *    URL=https://www.loria.fr/~levy/php/article.php?pub=../publications/papers/2005/Numerics
- * }
- *
- *  Laurent Saboret 2006: Changes for CGAL:
- *      - copied Jacobi preconditioner from Graphite 1.9 code
- *      - Added OpenNL namespace
- *
- * $URL$
- * $Id$
- * SPDX-License-Identifier: LGPL-3.0-or-later
- */
-
-#ifndef __OPENNL_PRECONDITIONER__
-#define __OPENNL_PRECONDITIONER__
-
-#include <CGAL/OpenNL/blas.h>
-#include <CGAL/OpenNL/sparse_matrix.h>
-#include <CGAL/OpenNL/full_vector.h>
-
-#include <CGAL/assertions.h>
-#include <CGAL/tss.h>
-
-namespace OpenNL {
-
-
-/**
- * Base class for some preconditioners.
- */
-
-template <class T>
-class Preconditioner {
-public:
-    typedef T CoeffType ;
-
-public:
-    /**
-     * The matrix A should be square.
-     */
-    Preconditioner(
-        const SparseMatrix<T>& A, CoeffType omega = 1.0
-    ) ;
-
-    const SparseMatrix<T>& A() const { return A_ ; }
-    CoeffType omega() const { return omega_ ; }
-
-    /**
-     * To use this function, the matrix A should be symmetric.
-     */
-    void mult_upper_inverse(const FullVector<T>& x, FullVector<T>& y) const ;
-
-    /**
-     * To use this function, the matrix A should be symmetric.
-     */
-    void mult_lower_inverse(const FullVector<T>& x, FullVector<T>& y) const ;
-
-    void mult_diagonal(FullVector<T>& xy) const ;
-    void mult_diagonal_inverse(FullVector<T>& xy) const ;
-
-private:
-    const SparseMatrix<T>& A_ ;
-    CoeffType omega_ ;
-} ;
-
-template <class T>
-Preconditioner<T>::Preconditioner(
-    const SparseMatrix<T>& A, CoeffType omega
-) : A_(A), omega_(omega) {
-    //CGAL_assertion(A.is_square()) ;
-}
-
-template <class T>
-void Preconditioner<T>::mult_lower_inverse(
-    const FullVector<T>& x, FullVector<T>& y
-) const {
-    //CGAL_assertion(A_.has_symmetric_storage()) ;
-    //CGAL_assertion(A_.rows_are_stored()) ;
-    int n = A_.dimension() ;
-    for(int i=0; i<n; i++) {
-        double S = 0 ;
-        const typename SparseMatrix<T>::Row& Ri = A_.row(i) ;
-        for(int ij=0; ij < Ri.size(); ij++) {
-            const typename SparseMatrix<T>::Coeff& c = Ri[ij] ;
-            if (c.index < i) // traverse only lower half matrix
-                S += c.a * y[c.index] ;
-        }
-        y[i] = (x[i] - S) * omega_ / A_.get_coef(i,i) ;
-    }
-}
-template <class T>
-void Preconditioner<T>::mult_upper_inverse(
-    const FullVector<T>& x, FullVector<T>& y
-) const {
-    //CGAL_assertion(A_.has_symmetric_storage()) ;
-    //CGAL_assertion(A_.columns_are_stored()) ;
-    int n = A_.dimension() ;
-    for(int i=n-1; i>=0; i--) {
-        double S = 0 ;
-        const typename SparseMatrix<T>::Row& Ci = A_.row(i) ; // column i == row i
-        for(int ij=0; ij < Ci.size(); ij++) {
-            const typename SparseMatrix<T>::Coeff& c = Ci[ij] ;
-            if(c.index > i) // traverse only upper half matrix
-                S += c.a * y[c.index] ;
-        }
-        y[i] = (x[i] - S) * omega_ / A_.get_coef(i,i) ;
-    }
-}
-
-template <class T>
-void Preconditioner<T>::mult_diagonal(FullVector<T>& xy) const {
-    int n = A_.dimension() ;
-    for(int i=0; i<n; i++) {
-        xy[i] *= ( A_.get_coef(i,i) / omega_ ) ;
-    }
-}
-
-template <class T>
-void Preconditioner<T>::mult_diagonal_inverse(FullVector<T>& xy) const {
-    int n = A_.dimension() ;
-    for(int i=0; i<n; i++) {
-        xy[i] *= ( omega_ / A_.get_coef(i,i) ) ;
-    }
-}
-
-/**
- * Jacobi preconditioner
- */
-
-template <class T>
-class Jacobi_Preconditioner : public Preconditioner<T> {
-public:
-    typedef T CoeffType ;
-
-public:
-    Jacobi_Preconditioner(
-        const SparseMatrix<T>& A, CoeffType omega = 1.0
-    ) ;
-} ;
-
-template <class T>
-Jacobi_Preconditioner<T>::Jacobi_Preconditioner(
-    const SparseMatrix<T>& A, CoeffType omega
-) : Preconditioner<T>(A, omega) {
-}
-
-template <class T>
-void mult(const Jacobi_Preconditioner<T>& M, const FullVector<T>& x, FullVector<T>& y) {
-    BLAS< FullVector<T> >::copy(x, y) ;
-    M.mult_diagonal_inverse(y) ;
-}
-
-
-/**
- * The SSOR preconditioner, sharing storage with the matrix.
- */
-
-template <class T>
-class SSOR_Preconditioner : public Preconditioner<T> {
-public:
-    typedef T CoeffType ;
-
-public:
-    /**
-     * The matrix A should be symmetric.
-     */
-    SSOR_Preconditioner(
-        const SparseMatrix<T>& A, CoeffType omega = 1.0
-    ) ;
-} ;
-
-template <class T>
-SSOR_Preconditioner<T>::SSOR_Preconditioner(
-    const SparseMatrix<T>& A, CoeffType omega
-) : Preconditioner<T>(A, omega) {
-}
-
-/** y <- M*x */
-template <class T>
-void mult(const SSOR_Preconditioner<T>& M, const FullVector<T>& x, FullVector<T>& y) {
-
-    CGAL_STATIC_THREAD_LOCAL_VARIABLE(FullVector<T>, work,0) ;
-
-    const SparseMatrix<T>& A = M.A() ;
-    int n = A.dimension() ;
-
-    if(work.dimension() != n) {
-        work = FullVector<T>(n) ;
-    }
-
-    M.mult_lower_inverse(x, work) ;
-    M.mult_diagonal(work) ;
-    M.mult_upper_inverse(work, y) ;
-
-    BLAS< FullVector<T> >::scal(2 - M.omega(), y) ;
-}
-
-
-} // namespace OpenNL
-
-#endif // __OPENNL_PRECONDITIONER__
diff --git a/OpenNL/include/CGAL/OpenNL/sparse_matrix.h b/OpenNL/include/CGAL/OpenNL/sparse_matrix.h
deleted file mode 100644
index 4e4c01f46d46..000000000000
--- a/OpenNL/include/CGAL/OpenNL/sparse_matrix.h
+++ /dev/null
@@ -1,256 +0,0 @@
-// Copyright (c) 2005-2008  Inria Loria (France).
-/*
- * author:  Bruno Levy, INRIA, project ALICE
- * website: https://www.loria.fr/~levy/software
- *
- * This file is part of CGAL (www.cgal.org)
- *
- * Scientific work that use this software can reference the website and
- * the following publication:
- *
- * @INPROCEEDINGS {levy:NMDGP:05,
- *    AUTHOR = Bruno Levy,
- *    TITLE  = Numerical Methods for Digital Geometry Processing,
- *    BOOKTITLE =Israel Korea Bi-National Conference,
- *    YEAR=November 2005,
- *    URL=https://www.loria.fr/~levy/php/article.php?pub=../publications/papers/2005/Numerics
- * }
- *
- *  Laurent Saboret 01/2005: Change for CGAL:
- *      - Added OpenNL namespace
- *      - SparseMatrix is now a model of the SparseLinearAlgebraTraits_d::Matrix concept
- *
- * $URL$
- * $Id$
- * SPDX-License-Identifier: LGPL-3.0-or-later
-*/
-
-#ifndef __OPENNL_SPARSE_MATRIX__
-#define __OPENNL_SPARSE_MATRIX__
-
-#include <CGAL/OpenNL/full_vector.h>
-#include <CGAL/assertions.h>
-#include <CGAL/use.h>
-
-#include <vector>
-#include <cstdlib>
-
-namespace OpenNL {
-
-
-//________________________________________________________________
-// Class SparseMatrix
-// Model of the SparseLinearAlgebraTraits_d::Matrix concept
-template <class T> class SparseMatrix
-{
-// Public types
-public:
-
-    typedef T CoeffType ;
-
-    // added for SparseLinearAlgebraTraits_d::Matrix concept
-    typedef T NT;
-
-    struct Coeff {
-        Coeff() { }
-        Coeff(unsigned int i, T val) : index(i), a(val) { }
-        unsigned int index ;
-        T a ;
-    } ;
-
-//__________________________________________________
-
-   /**
-    * A row or a column of a SparseMatrix. The row/column is
-    * compressed, and stored in the form of a list of
-    * (value,index) couples.
-    */
-    class Row : public std::vector<Coeff> {
-        typedef typename std::vector<Coeff> superclass ;
-    public:
-        /** a_{index} <- a_{index} + val */
-        void add_coef(unsigned int index, T val)
-        {
-            // search for coefficient in superclass vector
-            for(typename superclass::iterator it = superclass::begin() ;
-                it != superclass::end() ;
-                it++)
-            {
-                if(it->index == index) {
-                    it->a += val ;                      // +=
-                    return ;
-                }
-            }
-            // coefficient doesn't exist yet if we reach this point
-            superclass::push_back(Coeff(index, val)) ;
-        }
-
-        // a_{index} <- val
-        // (added for SparseLinearAlgebraTraits_d::Matrix concept)
-        //
-        // Optimization:
-        // - Caller can optimize this call by setting 'new_coef' to true
-        //   if the coefficient does not already exists in the matrix.
-        void set_coef(unsigned int index, T val, bool new_coef)
-        {
-            if (!new_coef)
-            {
-              // search for coefficient in superclass vector
-              for(typename superclass::iterator it = superclass::begin() ;
-                  it != superclass::end() ;
-                  it++)
-              {
-                  if(it->index == index) {
-                      it->a = val ;                       // =
-                      return ;
-                  }
-              }
-            }
-            // coefficient doesn't exist yet if we reach this point
-            superclass::push_back(Coeff(index, val)) ;
-        }
-
-        // return a_{index} (0 by default)
-        // (added for SparseLinearAlgebraTraits_d::Matrix concept)
-        T get_coef(unsigned int index) const
-        {
-            // search for coefficient in superclass vector
-            for(typename superclass::const_iterator it = superclass::begin() ;
-                it != superclass::end() ;
-                it++)
-            {
-                if(it->index == index)
-                    return it->a ;                      // return value
-            }
-            // coefficient doesn't exist if we reach this point
-            return 0 ;
-        }
-    } ;
-
-// Public operations
-public:
-
-    //__________ constructors / destructor _____
-
-    // Create a square matrix initialized with zeros
-    SparseMatrix(unsigned int dim) {
-        CGAL_assertion(dim > 0);
-        dimension_ = dim ;
-        row_ = new Row[dimension_] ;
-    }
-    // Create a rectangular matrix initialized with zeros
-    // (added for SparseLinearAlgebraTraits_d::Matrix concept)
-    // WARNING: this class supports square matrices only
-    SparseMatrix (unsigned int rows, unsigned int columns ) {
-        CGAL_USE(rows);
-        CGAL_assertion(rows == columns);
-        CGAL_assertion(columns > 0);
-        dimension_ = columns ;
-        row_ = new Row[dimension_] ;
-    }
-
-    ~SparseMatrix() {
-        delete[] row_ ;
-        row_ = nullptr ;
-    }
-
-    //___________ access ________________________
-
-    // Return the matrix dimension
-    unsigned int dimension() const {  return dimension_ ;  }
-
-    // Added for SparseLinearAlgebraTraits_d::Matrix concept:
-    // Return the matrix number of rows
-    unsigned int row_dimension() const    { return dimension(); }
-    // Return the matrix number of columns
-    unsigned int column_dimension() const { return dimension(); }
-
-    Row& row(unsigned int i) {
-        CGAL_assertion(i < dimension_) ;
-        return row_[i] ;
-    }
-
-    const Row& row(unsigned int i) const {
-        CGAL_assertion(i < dimension_) ;
-        return row_[i] ;
-    }
-
-    // Read access to 1 matrix coefficient
-    // (added for SparseLinearAlgebraTraits_d::Matrix concept)
-    //
-    // Preconditions:
-    // * 0 <= i < row_dimension()
-    // * 0 <= j < column_dimension()
-    NT  get_coef (unsigned int i, unsigned int j) const {
-        CGAL_assertion(i < dimension_) ;
-        CGAL_assertion(j < dimension_) ;
-        return row(i).get_coef(j) ;
-    }
-
-    // Write access to 1 matrix coefficient: a_ij <- a_ij + val
-    //
-    // Preconditions:
-    // * 0 <= i < row_dimension()
-    // * 0 <= j < column_dimension()
-    void add_coef(unsigned int i, unsigned int j, T val) {
-        CGAL_assertion(i < dimension_) ;
-        CGAL_assertion(j < dimension_) ;
-        row(i).add_coef(j, val) ;
-    }
-
-    // Write access to 1 matrix coefficient: a_ij <- val
-    //(added for SparseLinearAlgebraTraits_d::Matrix concept)
-    //
-    // Optimization:
-    // - Caller can optimize this call by setting 'new_coef' to true
-    //   if the coefficient does not already exists in the matrix.
-    //
-    // Preconditions:
-    // - 0 <= i < row_dimension().
-    // - 0 <= j < column_dimension().
-    void set_coef(unsigned int i, unsigned int j, NT  val, bool new_coef = false) {
-        CGAL_assertion(i < dimension_) ;
-        CGAL_assertion(j < dimension_) ;
-        row(i).set_coef(j, val, new_coef) ;
-    }
-
-    /**
-     * removes all the coefficients and frees the allocated
-     * space.
-     */
-    void clear() {
-        for(unsigned int i=0; i<dimension_; i++) {
-            row(i).clear() ;
-        }
-    }
-
-private:
-    unsigned int dimension_ ;
-    Row* row_ ;
-
-    // SparseMatrix cannot be copied
-    // (for the moment, could be implemented if needed).
-    SparseMatrix(const SparseMatrix& rhs) ;
-    SparseMatrix& operator=(const SparseMatrix& rhs) ;
-} ;
-
-/** y <- M*x */
-template <class T>
-void mult(const SparseMatrix<T>& M, const FullVector<T>& x, FullVector<T>& y) {
-    unsigned int N = M.dimension() ;
-    CGAL_assertion(x.dimension() == N) ;
-    CGAL_assertion(y.dimension() == N) ;
-    for(unsigned int i=0; i<N; i++) {
-        y[i] = 0 ;
-        const typename SparseMatrix<T>::Row& R = M.row(i) ;
-        for(unsigned int jj=0; jj<R.size(); jj++) {
-            unsigned int j = R[jj].index ;
-            y[i] += R[jj].a * x[j] ;
-        }
-    }
-}
-
-
-} // namespace OpenNL
-
-#endif // __OPENNL_SPARSE_MATRIX__
diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
index 33252883f1d5..abe84862e04d 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
@@ -77,10 +77,7 @@ namespace Surface_mesh_parameterization {
 /// \code
 ///   CGAL::Eigen_solver_traits<Eigen::SimplicialLDLT< Eigen::SparseMatrix<double> > >
 /// \endcode
-///         Otherwise, it uses CGAL's wrapping function to the OpenNL library:
-/// \code
-///   OpenNL::SymmetricLinearSolverTraits<typename TriangleMesh::NT>
-/// \endcode
+///
 ///
 /// \sa `CGAL::Surface_mesh_parameterization::Two_vertices_parameterizer_3<TriangleMesh, BorderParameterizer, SolverTraits>`
 ///
@@ -103,8 +100,6 @@ class LSCM_parameterizer_3
     // is always used...
     CGAL::Eigen_solver_traits<
             Eigen::SimplicialLDLT<Eigen_sparse_symmetric_matrix<double>::EigenType> >
-  #else
-    OpenNL::SymmetricLinearSolverTraits<typename TriangleMesh::NT>
   #endif
   >::type                                                     Solver_traits;
 #else

From f3d08effe5dfe74bc81886d484cf17162c4f39ac Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 20 Oct 2023 14:56:27 +0100
Subject: [PATCH 0922/1398] Cleanup of Usage.txt

---
 Documentation/doc/Documentation/Usage.txt | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/Documentation/doc/Documentation/Usage.txt b/Documentation/doc/Documentation/Usage.txt
index 1c02423cf496..24a4d6fc84a5 100644
--- a/Documentation/doc/Documentation/Usage.txt
+++ b/Documentation/doc/Documentation/Usage.txt
@@ -97,11 +97,6 @@ distribution of the <a href="https://cs.nyu.edu/exact/">Core library</a> version
 dealing with algebraic numbers. Note that \core is not part of \cgal and has its
 own license.
 
-The directory `include/CGAL/OpenNL` contains a distribution of the
-<a href="http://alice.loria.fr/index.php/software/4-library/23-opennl.html">Open Numerical Library</a>,
-which provides solvers for sparse linear systems, especially designed for the Computer Graphics community.
-\opennl is not part of \cgal and has its own license.
-
 The only documentation shipped within \cgal sources is the present manual.
 The \cgal manual can also be accessed online at
 <a href="https://doc.cgal.org/latest/Manual/index.html">`https://doc.cgal.org`</a>

From 6785c5cb7b1df4a4788a0005f0ed403a9bf467a4 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 20 Oct 2023 15:57:58 +0200
Subject: [PATCH 0923/1398] document the order of vertices

---
 .../doc/Triangulation_3/CGAL/Triangulation_3.h        | 11 ++++++++---
 1 file changed, 8 insertions(+), 3 deletions(-)

diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
index e0299c893339..94f5d467485e 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
@@ -1304,17 +1304,22 @@ Finite_vertex_handles finite_vertex_handles() const;
 Points points() const;
 
 /*!
-* returns an array containing the vertices of `e`
+* returns an array containing the vertices of `e`,
+* in the order of their indices `e.second` and `e.third`
+* in the cell `e.first`.
 */
 std::array<Vertex_handle, 2> vertices(const Edge& e) const;
 
 /*!
-* returns an array containing the vertices of `f`
+* returns an array containing the vertices of `f`,
+* in counterclockwise order on the face of `f.first`
+* opposite to vertex `f.first->vertex(f.second)`.
 */
 std::array<Vertex_handle, 3> vertices(const Facet& f) const;
 
 /*!
-* returns an array containing the vertices of `c`
+* returns an array containing the vertices of `c`,
+* in the same order as the indices of `c`.
 */
 std::array<Vertex_handle, 4> vertices(const Cell_handle c) const;
 

From f1fda7b01e8f783a3dcd76a97b3731c97d8812e4 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 20 Oct 2023 14:59:06 +0100
Subject: [PATCH 0924/1398] Add to changes.md

---
 Installation/CHANGES.md | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 8ee04d38577d..fffd84fad87e 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -14,6 +14,7 @@ Release date: October 2023
 - **Breaking change**: The usage of `boost::optional` has been replaced by `std::optional`. Packages affected are 2D Straight Line Skeleton, 3D Fast Intersection and Distance Computation (AABB Tree), and the Kernel intersection.
 - **Breaking change**: The usage of `boost::variant` has been replaced by `std::variant`. Packages affected are 2D Arrangements, and the Kernel intersection.
 
+
 #### 2D Arrangements
 
 - **Breaking change**: The type of the result of point location queries changed to
@@ -52,6 +53,10 @@ Release date: October 2023
     `CGAL::Simplicial_mesh_cell_base_3`
     have been modified to enable passing a geometric traits and a custom cell base class.
 
+### [Surface Mesh Parameterization](https://doc.cgal.org/6.0/Manual/packages.html#PkgSurfaceMeshParameterization)
+- **Breaking change**: LSCM_parameterizer_3 needs Eigen
+
+
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------
 

From c4270c62c2c08508bda2e548eda42360170edda2 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 20 Oct 2023 15:26:03 +0100
Subject: [PATCH 0925/1398] static_assert

---
 .../Surface_mesh_parameterization/LSCM_parameterizer_3.h   | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
index abe84862e04d..2dcaab67b804 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
@@ -92,6 +92,11 @@ class LSCM_parameterizer_3
     BorderParameterizer_,
     Two_vertices_parameterizer_3<TriangleMesh_> >::type  Border_parameterizer;
 
+#if !defined(CGAL_EIGEN3_ENABLED)
+  static_assert(!(std::is_same<SolverTraits_, Default>::value),
+                            "Error: You must either provide 'SolverTraits_' or link CGAL with the Eigen library");
+  #endif
+
   typedef typename Default::Get<
     SolverTraits_,
   #if defined(CGAL_EIGEN3_ENABLED)
@@ -100,6 +105,8 @@ class LSCM_parameterizer_3
     // is always used...
     CGAL::Eigen_solver_traits<
             Eigen::SimplicialLDLT<Eigen_sparse_symmetric_matrix<double>::EigenType> >
+  #else
+    SolverTraits_ // no parameter provided, and Eigen is not enabled: so don't compile!
   #endif
   >::type                                                     Solver_traits;
 #else

From 9f9a6f600f65282796c3e8de3dc8841dc3024aac Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Mon, 23 Oct 2023 09:07:43 +0200
Subject: [PATCH 0926/1398] Apply suggestions from code review

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 .../PackageDescription.txt                     |  2 +-
 .../Polygon_mesh_processing.txt                | 18 +++++++++---------
 .../interpolated_corrected_curvatures.h        |  4 ++--
 3 files changed, 12 insertions(+), 12 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 0a1c08909eeb..035781b35c7e 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -79,7 +79,7 @@
 \cgalPkgPicture{hole_filling_ico.png}
 
 \cgalPkgSummaryBegin
-\cgalPkgAuthors{David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katriopla, Sébastien Loriot, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz}
+\cgalPkgAuthors{David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz}
 \cgalPkgDesc{This package provides a collection of methods and classes for polygon mesh processing,
 ranging from basic operations on simplices, to complex geometry processing algorithms such as
 Boolean operations, remeshing, repairing, collision and intersection detection, and more.}
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 1f6249c0ee89..fa1e527cd775 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -4,7 +4,7 @@ namespace CGAL {
 \anchor Chapter_PolygonMeshProcessing
 
 \cgalAutoToc
-\authors David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katriopla, Sébastien Loriot, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz
+\authors David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz
 
 \image html neptun_head.jpg
 \image latex neptun_head.jpg
@@ -944,7 +944,7 @@ Corrected Curvatures on Polyhedral Surfaces \cgalCite{cgal:lrtc-iccmps-20}. This
 Gaussian curvature, principal curvatures and directions. These can be computed on triangle meshes,
 quad meshes, and meshes with n-gon faces (for n-gons, the centroid must be inside the n-gon face).
 The algorithms used prove to work well in general. Also, on meshes with noise on vertex positions,
-they give accurate results, on the condition that the correct vertex normals are provided.
+they give accurate results, under the condition that the correct vertex normals are provided.
 
 \subsection ICCBackground Brief Background
 
@@ -959,7 +959,7 @@ The algorithms are based on the two papers \cgalCite{cgal:lrt-ccm-22} and \cgalC
 introduce a new way to compute curvatures on polygonal meshes. The main idea in \cgalCite{cgal:lrt-ccm-22} is
 based on decoupling the normal information from the position information, which is useful for dealing with
 digital surfaces, or meshes with noise on vertex positions. \cgalCite{cgal:lrtc-iccmps-20} introduces some
-extensions to this framework. As it uses linear interpolation on the corrected normal vector field
+extensions to this framework, as it uses linear interpolation on the corrected normal vector field
 to derive new closed form equations for the corrected curvature measures. These <b>interpolated</b>
 curvature measures are the first step for computing the curvatures. For a triangle \f$ \tau_{ijk} \f$,
 with vertices \a i, \a j, \a k:
@@ -984,7 +984,7 @@ solver.
 
 The interpolated curvature measures are then computed for each vertex \f$ v \f$ as the sum of
 the curvature measures of the faces in a ball around \f$ v \f$ weighted by the inclusion ratio of the
-triangle in the ball. if the ball radius is not specified, the sum is instead over the incident faces
+triangle in the ball. If the ball radius is not specified, the sum is instead computed over the incident faces
 of \f$ v \f$.
 
 To get the final curvature value for a vertex \f$ v \f$, the respective interpolated curvature measure
@@ -1000,14 +1000,14 @@ The implementation is generic in terms of mesh data structure. It can be used on
 `Polyhedron_3` and other polygonal mesh structures based on the concept `FaceGraph`.
 
 These computations are performed using (on all vertices of the mesh) `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
-where function named parameters are use to select the curvatures (and possibly directions) to be computed. An overlay with the same named
-but accepting and accepting a given vertex is also available in case the computation should be done only for that vertex.
+where function named parameters are used to select the curvatures (and possibly directions) to be computed. An overlay with the same name
+but taking a given vertex is also available in case the computation should be done only for that vertex.
 
 \subsection ICCResults Results & Performance
 
 **To be updated**
 
-First, \cgalFigureRef{icc_measures} first illustrates various curvature measure on a triangular mesh.
+First, \cgalFigureRef{icc_measures} illustrates various curvature measures on a triangular mesh.
 
 \cgalFigureAnchor{icc_measures}
 <center>
@@ -1024,7 +1024,7 @@ First, \cgalFigureRef{icc_measures} first illustrates various curvature measure
 
 
 \cgalFigureCaptionBegin{icc_measures}
-Mean curvature, Gaussian curvature, minimal principal curvature direction and minimal principal curvature direction on a mesh (ball radius set to 0.04).
+Mean curvature, Gaussian curvature, minimal principal curvature direction and maximal principal curvature direction on a mesh (ball radius set to 0.04).
 \cgalFigureCaptionEnd
 
 \cgalFigureAnchor{icc_various_ball_radii}
@@ -1073,7 +1073,7 @@ not provide storage for the curvatures.
 \subsection ICCExampleSV Interpolated Corrected Curvatures on a Vertex Example
 
 The following example illustrates how to
-compute the curvatures on a specific vertex
+compute the curvatures on a specific vertex.
 
 \cgalExample{Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp}
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 438bdaad2625..e5587f27aa07 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -1135,7 +1135,7 @@ void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
 *
 * @param pmesh the polygon mesh.
 * @param v the vertex of `pmesh` to compute the curvatures at.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below.
 *        `GT` stands for the type of the object provided to the named parameter `geom_traits()`.
 *
 * \cgalNamedParamsBegin
@@ -1153,7 +1153,7 @@ void interpolated_corrected_curvatures(const PolygonMesh& pmesh,
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{vertex_principal_curvatures_and_directions}
-*     \cgalParamDescription{a reference to an`Principal_curvatures_and_directions<GT>` object to store the principal curvatures and directions at the vertex `v`.}
+*     \cgalParamDescription{a reference to a `Principal_curvatures_and_directions<GT>` object to store the principal curvatures and directions at the vertex `v`.}
 *     \cgalParamType{`std::reference_wrapper<Principal_curvatures_and_directions<GT>>`.}
 *     \cgalParamExtra{If this parameter is omitted, principal curvatures and directions will not be computed.}
 *  \cgalParamNEnd

From 28b99d55ce5e22143d7fb02ce207bde06fcef1da Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 23 Oct 2023 10:43:25 +0100
Subject: [PATCH 0927/1398] Make filenames unique to avoid IO errors when
 executing two tests in parallel threads

---
 .../test/Apollonius_graph_2/include/test.h         | 14 ++++++++++----
 1 file changed, 10 insertions(+), 4 deletions(-)

diff --git a/Apollonius_graph_2/test/Apollonius_graph_2/include/test.h b/Apollonius_graph_2/test/Apollonius_graph_2/include/test.h
index 69064b0c7813..680b69e4a648 100644
--- a/Apollonius_graph_2/test/Apollonius_graph_2/include/test.h
+++ b/Apollonius_graph_2/test/Apollonius_graph_2/include/test.h
@@ -4,6 +4,7 @@
 #include <cassert>
 #include <CGAL/enum.h>
 #include <CGAL/use.h>
+#include <CGAL/Random.h>
 
 #include <CGAL/Vector_2.h> // this is done in order to avoid error
 // when the  Segment_2_Segment_2_intersection.h file is included from
@@ -839,24 +840,29 @@ bool test_algo_generic(InputStream& is)
   // file I/O methods
   //--------------------------------------------------------------------
   {
-    std::ofstream ofs("ag_testsuite.tmp");
+    std::string fname  =  "ag_testsuite_" + std::to_string(CGAL::Random().get_seed())  + ".tmp";
+    std::cout << "writing to " << fname << std::endl;
+
+    std::ofstream ofs(fname);
     assert( ofs );
     ag.file_output(ofs);
     ofs.close();
 
-    std::ifstream ifs("ag_testsuite.tmp");
+    std::ifstream ifs(fname);
     assert( ifs );
     ag.file_input(ifs);
     ifs.close();
     assert( ag.is_valid() );
   }
   {
-    std::ofstream ofs("ag_testsuite.tmp");
+    std::string fname = "ag_testsuite_" + std::to_string(CGAL::Random().get_seed()) + ".tmp";
+    std::cout << "writing to " << fname << std::endl;
+    std::ofstream ofs(fname);
     assert( ofs );
     ofs << ag;
     ofs.close();
 
-    std::ifstream ifs("ag_testsuite.tmp");
+    std::ifstream ifs(fname);
     assert( ifs );
     ifs >> ag;
     ifs.close();

From e253e317fe7569efde7821569aa000b1bf8ca2ed Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 23 Oct 2023 10:47:21 +0100
Subject: [PATCH 0928/1398] cleanup of the test.h

---
 .../test/Apollonius_graph_2/include/test.h         | 14 +++++---------
 1 file changed, 5 insertions(+), 9 deletions(-)

diff --git a/Apollonius_graph_2/test/Apollonius_graph_2/include/test.h b/Apollonius_graph_2/test/Apollonius_graph_2/include/test.h
index 680b69e4a648..7d9e98171e9b 100644
--- a/Apollonius_graph_2/test/Apollonius_graph_2/include/test.h
+++ b/Apollonius_graph_2/test/Apollonius_graph_2/include/test.h
@@ -1,20 +1,16 @@
 #ifndef CGAL_APOLLONIUS_GRAPH_2_TEST_H
 #define CGAL_APOLLONIUS_GRAPH_2_TEST_H
 
+#include <CGAL/Apollonius_graph_2.h>
+#include <CGAL/Apollonius_graph_hierarchy_2.h>
+#include <CGAL/Apollonius_graph_traits_2.h>
+#include <CGAL/Apollonius_graph_filtered_traits_2.h>
+
 #include <cassert>
 #include <CGAL/enum.h>
 #include <CGAL/use.h>
 #include <CGAL/Random.h>
 
-#include <CGAL/Vector_2.h> // this is done in order to avoid error
-// when the  Segment_2_Segment_2_intersection.h file is included from
-// the Triangulation_euclidean_traits_2.h file.
-
-#include <CGAL/Apollonius_graph_2.h>
-#include <CGAL/Apollonius_graph_hierarchy_2.h>
-#include <CGAL/Apollonius_graph_traits_2.h>
-#include <CGAL/Apollonius_graph_filtered_traits_2.h>
-//#include <CGAL/new_traits/Apollonius_graph_new_filtered_traits_2.h>
 
 #include "IO/Null_output_stream.h"
 

From b8ce7d12f0fa309dcf6dbc20326cf0196883ae15 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 23 Oct 2023 15:55:22 +0300
Subject: [PATCH 0929/1398] Fixed comment

---
 .../include/CGAL/Surface_sweep_2/Default_visitor_base.h         | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Default_visitor_base.h b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Default_visitor_base.h
index 87710c95ec30..441e96824887 100644
--- a/Surface_sweep_2/include/CGAL/Surface_sweep_2/Default_visitor_base.h
+++ b/Surface_sweep_2/include/CGAL/Surface_sweep_2/Default_visitor_base.h
@@ -84,7 +84,7 @@ class Default_visitor_base {
   /*! Destructor */
   virtual ~Default_visitor_base() {}
 
-  /*! Attach the a sweep-line object. */
+  /*! Attach a sweep-line object. */
   void attach(Surface_sweep_2* sl) { m_surface_sweep = sl; }
 
   /*!

From 4c3363601249630ad31f060febaff90e176aed6f Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 23 Oct 2023 15:56:51 +0300
Subject: [PATCH 0930/1398] Removed redundant include statement

---
 Surface_sweep_2/include/CGAL/Surface_sweep_2.h | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Surface_sweep_2/include/CGAL/Surface_sweep_2.h b/Surface_sweep_2/include/CGAL/Surface_sweep_2.h
index a816ba72255e..1c1d0df3a067 100644
--- a/Surface_sweep_2/include/CGAL/Surface_sweep_2.h
+++ b/Surface_sweep_2/include/CGAL/Surface_sweep_2.h
@@ -24,7 +24,6 @@
 #include <list>
 #include <vector>
 
-#include <CGAL/Object.h>
 #include <CGAL/No_intersection_surface_sweep_2.h>
 #include <CGAL/Surface_sweep_2/Random_access_output_iterator.h>
 #include <CGAL/algorithm.h>

From 042629e464ca0cbc130aff934df529794402426c Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 23 Oct 2023 16:03:07 +0300
Subject: [PATCH 0931/1398] Fixed inserter; introduced extractor

---
 .../include/CGAL/IO/Gps_iostream.h            | 57 ++++++++++++++-----
 1 file changed, 44 insertions(+), 13 deletions(-)

diff --git a/Boolean_set_operations_2/include/CGAL/IO/Gps_iostream.h b/Boolean_set_operations_2/include/CGAL/IO/Gps_iostream.h
index eae28c242a14..85847e0574f7 100644
--- a/Boolean_set_operations_2/include/CGAL/IO/Gps_iostream.h
+++ b/Boolean_set_operations_2/include/CGAL/IO/Gps_iostream.h
@@ -19,30 +19,61 @@
 
 #include <iostream>
 #include <list>
+#include <algorithm>
 
 #include <CGAL/basic.h>
 #include <CGAL/General_polygon_set_2.h>
 
 namespace CGAL {
 
-template <typename Traits>
-std::ostream & operator<< (std::ostream& os,
-                           const CGAL::General_polygon_set_2<Traits> & pgn_set)
-{
-  typedef typename CGAL::General_polygon_set_2<Traits>::Polygon_with_holes_2
-                                                        Polygon_with_holes_2;
-  typedef std::list<Polygon_with_holes_2>               Pgn_with_holes_container;
-
-  Pgn_with_holes_container res;
-  pgn_set.polygons_with_holes (std::back_inserter (res));
+/*! Inserter operator for general polygons sets.
+ * Inserts a general polygon set into an output stream.
+ * \param os the output stream.
+ * \param pgn_set the general polygon set.
+ * \return the output stream.
+ */
+template <typename GeomTraits_, typename Dcel_>
+std::ostream&
+operator<<(std::ostream& os,
+           const CGAL::General_polygon_set_2<GeomTraits_, Dcel_>& pgn_set) {
+  using Geometry_traits_2 = GeomTraits_;
+  using Dcel = Dcel_;
+  using Gps = CGAL::General_polygon_set_2<Geometry_traits_2, Dcel>;
+  using Pwh_2 = typename Gps::Polygon_with_holes_2;
+  using Pgn_with_holes_container = std::list<Pwh_2>;
 
+  Pgn_with_holes_container pwhs;
+  pgn_set.polygons_with_holes(std::back_inserter(pwhs));
   std::cout << pgn_set.number_of_polygons_with_holes() << std::endl;
-  std::copy(res.begin(), res.end(),
-            std::ostream_iterator<Polygon_with_holes_2>(std::cout, "\n"));
-
+  std::copy(pwhs.begin(), pwhs.end(), std::ostream_iterator<Pwh_2>(os, "\n"));
   return os;
 }
 
+/*! Extractor operator for general polygons sets.
+ * Extracts a general polygon set from an input stream.
+ * \param is the input stream.
+ * \param pgn_set the general polygon set.
+ * \return the input stream.
+ */
+template <typename GeomTraits_, typename Dcel_>
+std::istream&
+operator>>(std::istream& is,
+           CGAL::General_polygon_set_2<GeomTraits_, Dcel_>& pgn_set) {
+  using Geometry_traits_2 = GeomTraits_;
+  using Dcel = Dcel_;
+  using Gps = CGAL::General_polygon_set_2<Geometry_traits_2, Dcel>;
+  using Pwh_2 = typename Gps::Polygon_with_holes_2;
+
+  int n;
+  is >> n;
+  for (int i = 0; i < n; ++i) {
+    Pwh_2 pwh;
+    is >> pwh;
+    pgn_set.insert(pwh);
+  }
+  return is;
+}
+
 } //namespace CGAL
 
 #include <CGAL/enable_warnings.h>

From 2e32820dd370e8da68dd91959844629b8b3e34ce Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 23 Oct 2023 16:07:57 +0300
Subject: [PATCH 0932/1398] ixed parameter types if interface functions

---
 .../include/CGAL/Arr_conic_traits_2.h                 | 11 +++++------
 1 file changed, 5 insertions(+), 6 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
index 3576237f6996..6d89990e202c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
@@ -2258,7 +2258,7 @@ class Arr_conic_traits_2 {
      */
     Curve_2 operator()(const Rational& r, const Rational& s, const Rational& t,
                        const Rational& u, const Rational& v, const Rational& w,
-                       const Orientation& orient,
+                       Orientation orient,
                        const Point_2& source, const Point_2& target) const {
       // Make sure that the source and the taget are not the same.
       const auto alg_kernel = m_traits.m_alg_kernel;
@@ -2280,7 +2280,7 @@ class Arr_conic_traits_2 {
      * \pre The three points must not be collinear.
      */
     Curve_2 operator()(const Rat_point_2& p1, const Rat_point_2& p2,
-                       const Rat_point_2& p3) {
+                       const Rat_point_2& p3) const {
       Curve_2 arc;
 
       // Set the source and target.
@@ -2363,7 +2363,7 @@ class Arr_conic_traits_2 {
      */
     Curve_2 operator()(const Rat_point_2& p1, const Rat_point_2& p2,
                        const Rat_point_2& p3, const Rat_point_2& p4,
-                       const Rat_point_2& p5) {
+                       const Rat_point_2& p5) const {
       Curve_2 arc;
 
       // Make sure that no three points are collinear.
@@ -2457,7 +2457,7 @@ class Arr_conic_traits_2 {
      */
     Curve_2 operator()(const Rational& r, const Rational& s, const Rational& t,
                        const Rational& u, const Rational& v, const Rational& w,
-                       const Orientation& orient,
+                       Orientation orient,
                        const Point_2& app_source,
                        const Rational& r_1, const Rational& s_1,
                        const Rational& t_1, const Rational& u_1,
@@ -2724,9 +2724,8 @@ class Arr_conic_traits_2 {
      * \pre The source and the target must be on the conic boundary and must
      *      not be the same.
      */
-    Curve_2 operator()(const Rat_circle_2& circ, const Orientation& orient,
+    Curve_2 operator()(const Rat_circle_2& circ, Orientation orient,
                        const Point_2& source, const Point_2& target) const {
-
       // Make sure that the source and the taget are not the same.
       CGAL_precondition_code(auto cmp_xy =
                                m_traits.m_alg_kernel->compare_xy_2_object());

From 3f8ea79eb792f7fcd50922a955473e3da73049bc Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 23 Oct 2023 16:20:07 +0300
Subject: [PATCH 0933/1398] Added min_area_tri.tex and jeep.tex

---
 .../Arrangement_on_surface_2/fig_src/jeep.tex   | 11 +++++++++++
 .../Arrangement_on_surface_2/fig_src/makefile   |  4 +++-
 .../fig_src/min_area_tri.tex                    | 17 +++++++++++++++++
 3 files changed, 31 insertions(+), 1 deletion(-)
 create mode 100644 Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/jeep.tex
 create mode 100644 Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/min_area_tri.tex

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/jeep.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/jeep.tex
new file mode 100644
index 000000000000..abd944d4d68d
--- /dev/null
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/jeep.tex
@@ -0,0 +1,11 @@
+\documentclass[tikz, border=5mm]{standalone}
+\usepackage{tikz}
+\usetikzlibrary{patterns.meta}
+\usetikzlibrary{shapes.geometric}
+\begin{document}
+\begin{tikzpicture}
+    \draw[line width=0.2pt,draw=black,
+      pattern={Hatch[angle=45,distance={6pt},line width=0.4pt]},
+      pattern color=black](0,0) rectangle (10,6);
+\end{tikzpicture}
+\end{document}
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/makefile b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/makefile
index c0fa903663d8..5d139e1af614 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/makefile
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/makefile
@@ -49,7 +49,9 @@ TARGETS = \
   overlay_color.pdf \
   bgl_primal_adapter.pdf \
   bgl_dual_adapter.pdf \
-  unb_asymptote.pdf
+  unb_asymptote.pdf \
+  min_area_tri.pdf \
+  jeep.pdf
 
 .DEFAULT_GOAL = all
 .PHONY: all clean
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/min_area_tri.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/min_area_tri.tex
new file mode 100644
index 000000000000..aff139201b0a
--- /dev/null
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/min_area_tri.tex
@@ -0,0 +1,17 @@
+\documentclass[11pt]{report}
+\input{header}
+\pagestyle{empty}
+\begin{document}
+\begin{tikzpicture}[scale=1.0,thick]
+  \myAxes[4pt]{-2.5}{-1.5}{2.5}{2.5}
+  \foreach \x in {-2,...,2} \node[label={[label distance=-6pt]-45:{\scriptsize $\x$}}] at (\x,0) {};
+  \foreach \y in {-1,...,2} \node[label={[label distance=-6pt]135:{\scriptsize $\y$}}] at (0,\y) {};
+  \draw[step=1.0,dotted](-2,-1)grid(2,2);
+  \filldraw[fill=lightred,draw=darkred](-1,0)--(-0.5,1)--( 1,1)--cycle;
+  \arrpZ[45](-2,2.25){1}
+  \arrpZ[135](-1,0){2}
+  \arrpZ[135](-0.5,1){3}
+  \arrpZ[45]( 0.5,-1){4}
+  \arrpZ[45]( 1,1){5}
+\end{tikzpicture}%
+\end{document}

From dedb100fa83821544ce4ba07529f8b932ebc9001 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 23 Oct 2023 16:23:04 +0300
Subject: [PATCH 0934/1398] Ported to tikz

---
 .../fig_src/arr_segs.tex                      | 175 +++++++++--------
 .../fig_src/bezier_curves.tex                 |   2 +-
 .../fig_src/header.tex                        |  65 ++++++-
 .../fig_src/insert.tex                        | 180 +++++++++---------
 4 files changed, 236 insertions(+), 186 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/arr_segs.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/arr_segs.tex
index e6198387b5f0..e25fa3fd2be2 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/arr_segs.tex
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/arr_segs.tex
@@ -2,98 +2,95 @@
 \input{header}
 \pagestyle{empty}
 \begin{document}
-\psscalebox{1.8}{\arrset{0.8}
-  \pspicture[](-0.2,-0.2)(12.2,12.2)
-  %\psgrid(0,0)(12,12)
-  \arrMainVertex( 1, 3){a}
-  \arrMainVertex( 2, 4){b}
-  \arrMainVertex( 0, 6){c}
-  \arrv[90](5,11){1}
-  \arrMainVertex(9,11){f}
-  \arrMainVertex(12, 8){g}
-  \arrv[-60](8,8){2}
-  \arrMainVertex( 8, 4){i}
-  \arrMainVertex( 6, 4){j}
-  \arrMainVertex( 6, 2){k}
-  \arrMainVertex( 4, 0){m}
-  \arrMainVertex( 9, 0){n}
-  \arrMainVertex(11, 2){o}
-  \arrMainVertex(12, 4){p}
-  \arrMainVertex(12, 0){q}
-  \arrMainVertex( 4, 2){r}
-  \arrMainVertex( 3, 3){s}
-  \arrMainVertex( 5, 3){t}
+\begin{tikzpicture}[scale=1.0,thick]
+  \node[point] at ( 1, 3) (a) {};
+  \node[point] at ( 2, 4) (b) {};
+  \node[point] at ( 0, 6) (c) {};
+  \node [point,label={[label distance=0pt]90:{$v_1$}}] at ( 5,11) (1) {};
+  \node[point] at ( 9,11) (f) {};
+  \node[point] at (12, 8) (g) {};
+  \node [point,label={[label distance=0pt]-45:{$v_2$}}] at ( 8, 8) (2) {};
+  \node[point] at ( 8, 4) (i) {};
+  \node[point] at ( 6, 4) (j) {};
+  \node[point] at ( 6, 2) (k) {};
+  \node[point] at ( 4, 0) (m) {};
+  \node[point] at ( 9, 0) (n) {};
+  \node[point] at (11, 2) (o) {};
+  \node[point] at (12, 4) (p) {};
+  \node[point] at (12, 0) (q) {};
+  \node[point] at ( 4, 2) (r) {};
+  \node[point] at ( 3, 3) (s) {};
+  \node[point] at ( 5, 3) (t) {};
   %
-  \ncline[linewidth=0.5pt,linecolor=blue]{a}{b}
-  \ncline[linewidth=0.5pt,linecolor=blue]{b}{c}
-  \ncline[linewidth=0.5pt,linecolor=blue]{c}{1}
-  \ncline[linewidth=0.5pt,linecolor=blue]{1}{f}
-  \ncline[linewidth=0.5pt,offset=3pt,nodesepB=6pt]{->}{f}{1}\Aput[1pt]{$e_{\mathrm{prev}}$}
-  \ncline[linewidth=0.5pt,linecolor=blue]{f}{g}
-  \ncline[linewidth=0.5pt,linecolor=blue]{g}{2}
-  \ncline[linewidth=0.5pt,linecolor=blue]{g}{2}
-  \ncline[linewidth=0.5pt,offset=3pt,nodesepB=4pt]{->}{2}{g}\Aput[1pt]{$e_{\mathrm{next}}$}
-  \ncline[linewidth=0.5pt,linecolor=blue]{2}{i}
-  \ncline[linewidth=0.5pt,linecolor=blue]{i}{j}
-  \ncline[linewidth=0.5pt,linecolor=blue]{j}{k}
-  \ncline[linewidth=0.5pt,linecolor=blue]{k}{m}
-  \ncline[linewidth=0.5pt,linecolor=blue]{m}{a}
-  \ncline[linewidth=0.5pt,linecolor=blue]{1}{2}
-  \ncline[linewidth=0.5pt,linecolor=blue]{g}{i}
-  \ncline[linewidth=0.5pt,linecolor=blue]{m}{n}
-  \ncline[linewidth=0.5pt,linecolor=blue]{n}{i}
-  \ncline[linewidth=0.5pt,linecolor=blue]{g}{n}
-  \ncline[linewidth=0.5pt,linecolor=blue]{n}{o}
-  \ncline[linewidth=0.5pt,linecolor=blue]{o}{p}
-  \ncline[linewidth=0.5pt,linecolor=blue]{p}{q}
-  \ncline[linewidth=0.5pt,linecolor=blue]{q}{o}
-  \ncline[linewidth=0.5pt,linecolor=blue]{r}{s}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{r}{s}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{s}{r}
-  \ncline[linewidth=0.5pt,linecolor=blue]{r}{t}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{r}{t}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{t}{r}
+  \draw[blue] (a)--(b);
+  \draw[blue] (b)--(c);
+  \draw[blue] (c)--(1);
+  \draw[blue] (1)--(f);
+  \draw [halfedge,shorten >=4pt] (f) to node[sloped,below]{$e_{\mathrm{prev}}$} (1);
+  \draw[blue] (f)--(g);
+  \draw[blue] (g)--(2);
+  \draw [halfedge,shorten >=4pt] (2) to node[sloped,above]{$e_{\mathrm{next}}$} (g);
+  \draw[blue] (2)--(i);
+  \draw[blue] (i)--(j);
+  \draw[blue] (j)--(k);
+  \draw[blue] (k)--(m);
+  \draw[blue] (m)--(a);
+  \draw[blue] (1)--(2);
+  \draw[blue] (g)--(i);
+  \draw[blue] (m)--(n);
+  \draw[blue] (n)--(i);
+  \draw[blue] (g)--(n);
+  \draw[blue] (n)--(o);
+  \draw[blue] (o)--(p);
+  \draw[blue] (p)--(q);
+  \draw[blue] (q)--(o);
+  \draw[blue] (r)--(s);
   %
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{b}{a}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{c}{b}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{1}{c}
-  \ncline[linewidth=0.5pt,offset=3pt,nodesepA=4pt]{->}{g}{f}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{i}{2}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{j}{i}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{k}{j}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{m}{k}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{a}{m}
-  \ncline[linewidth=0.5pt,offset=3pt,nodesepA=6pt]{->}{1}{2}\Aput[1pt]{$e$}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{2}{1}\Aput[1pt]{$e'$}
+  \path [halfedge] (r) edge (s);
+  \path [halfedge] (s) edge (r);
+  \draw [blue] (r)--(t);
+  \path [halfedge] (r) edge (t);
+  \path [halfedge] (t) edge (r);
   %
-  \rput(2,10){$f_0$}
-  \rput(3,4){$f_1$}
-  \rput(8.5,9.5){$f_2$}
-  \rput(5,7){$f_3$}
-  \rput(4.5,5.6){$f_4$}
+  \path [halfedge] (b) edge (a);
+  \path [halfedge] (c) edge (b);
+  \path [halfedge] (1) edge (c);
+  \path [halfedge,shorten <=4pt] (g) edge (f);
+  \path [halfedge] (i) edge (2);
+  \path [halfedge] (j) edge (i);
+  \path [halfedge] (k) edge (j);
+  \path [halfedge] (m) edge (k);
+  \path [halfedge] (a) edge (m);
+  \draw [halfedge,shorten <=4pt] (1) to node[sloped,above=-1pt]{$e$} (2);
+  \draw [halfedge] (2) to node[sloped,below=-1pt]{$e'$} (1);
   %
-  \arru[90](2,6){1}
-  \arru[90](5,9){2}
+  \node at (2,10){$f_0$};
+  \node at (3,4){$f_1$};
+  \node at (8.5,9.5){$f_2$};
+  \node at (5,7){$f_3$};
+  \node at (4.5,5.6){$f_4$};
   %
-  \arrMainVertex(4,5){a}
-  \arrMainVertex(4,7){b}
-  \arrMainVertex(5,8){c}
-  \arrMainVertex(5,4){f}
-  \arrMainVertex(5,6){e}
-  \arrMainVertex(6,7){d}
-  \ncline[linewidth=0.5pt,linecolor=blue]{a}{b}
-  \ncline[linewidth=0.5pt,linecolor=blue]{b}{c}
-  \ncline[linewidth=0.5pt,linecolor=blue]{c}{d}
-  \ncline[linewidth=0.5pt,linecolor=blue]{d}{e}
-  \ncline[linewidth=0.5pt,linecolor=blue]{e}{f}
-  \ncline[linewidth=0.5pt,linecolor=blue]{f}{a}
-  \ncline[linewidth=0.5pt,linecolor=blue]{b}{e}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{a}{b}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{b}{c}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{c}{d}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{d}{e}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{e}{f}
-  \ncline[linewidth=0.5pt,offset=3pt]{->}{f}{a}
-  \endpspicture
-}
+  \node [point,label={[label distance=0pt]90:{$u_1$}}] at (2,6) (1) {};
+  \node [point,label={[label distance=0pt]90:{$u_2$}}] at (5,9) (1) {};
+  %
+  \node[point] at (4,5) (a) {};
+  \node[point] at (4,7) (b) {};
+  \node[point] at (5,8) (c) {};
+  \node[point] at (5,4) (f) {};
+  \node[point] at (5,6) (e) {};
+  \node[point] at (6,7) (d) {};
+  \draw[blue] (a)--(b);
+  \draw[blue] (b)--(c);
+  \draw[blue] (c)--(d);
+  \draw[blue] (d)--(e);
+  \draw[blue] (e)--(f);
+  \draw[blue] (f)--(a);
+  \draw[blue] (b)--(e);
+  \path [halfedge] (a) edge (b);
+  \path [halfedge] (b) edge (c);
+  \path [halfedge] (c) edge (d);
+  \path [halfedge] (d) edge (e);
+  \path [halfedge] (e) edge (f);
+  \path [halfedge] (f) edge (a);
+\end{tikzpicture}%
 \end{document}
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/bezier_curves.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/bezier_curves.tex
index e0013b99d728..6266e6524d04 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/bezier_curves.tex
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/bezier_curves.tex
@@ -2,7 +2,7 @@
 \input{header}
 \pagestyle{empty}
 \begin{document}
-\psscalebox{1.8}{\arrset{1}%
+\psscalebox{1}{\arrset{1}%
 \def\bodyBezier{
 \psline[linecolor=blue](2295,5175)(2492.01,5062.83)(2677.89,4983.16)(2854.44,4929.86)(3023.31,4897.62)(3185.98,4881.79)(3343.77,4878.41)(3497.83,4884.1)(3649.2,4896.04)(3798.76,4911.9)(3947.28,4929.78)(4095.39,4948.19)(4243.63,4965.94)(4392.4,4982.15)(4542.04,4996.13)(4692.77,5007.39)(4844.74,5015.54)(4998.01,5020.26)(5152.6,5021.23)(5308.42,5018.09)(5465.37,5010.38)(5623.29,4997.49)(5781.96,4978.58)(5941.15,4952.58)(6100.6,4918.08)(6260.03,4873.33)(6419.14,4816.11)(6577.65,4743.77)(6735.25,4653.1)(6891.68,4540.32)(7046.68,4400.99)(7200,4230)
 \psline[linecolor=blue](8460,6165)(8622.25,6003.86)(8725.83,5853.19)(8782.58,5711.47)(8802.7,5577.35)(8794.88,5449.63)(8766.41,5327.29)(8723.29,5209.44)(8670.37,5095.32)(8611.44,4984.3)(8549.35,4875.84)(8486.17,4769.53)(8423.24,4665.02)(8361.36,4562.04)(8300.84,4460.4)(8241.66,4359.96)(8183.58,4260.61)(8126.25,4162.29)(8069.34,4064.94)(8012.64,3968.53)(7956.2,3873.02)(7900.41,3778.35)(7846.17,3684.44)(7794.97,3591.19)(7749.02,3498.44)(7711.36,3405.97)(7685.99,3313.49)(7677.98,3220.65)(7693.59,3127)(7740.38,3031.97)(7827.34,2934.9)(7965,2835)
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex
index b75164d2a5cb..26980faab6f0 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex
@@ -43,10 +43,25 @@
 \usepackage{tikz}
 \usepackage{pgfplots}
 \usepackage{mathptmx}
-\usetikzlibrary{calc,patterns,decorations.pathmorphing,decorations.markings,matrix,fit,decorations.pathreplacing,arrows,automata,positioning,shapes,chains,spy}
-%\usetikzlibrary{quotes,angles,graph}
-\usetikzlibrary{intersections,through,backgrounds}
+\usetikzlibrary{calc}
+\usetikzlibrary{backgrounds}
+\usetikzlibrary{decorations.pathmorphing}
+\usetikzlibrary{decorations.markings}
+\usetikzlibrary{decorations.pathreplacing}
+\usetikzlibrary{patterns}
+\usetikzlibrary{matrix}
+\usetikzlibrary{fit}
+\usetikzlibrary{arrows,arrows.meta}
+\usetikzlibrary{automata}
+\usetikzlibrary{positioning}
+\usetikzlibrary{shapes}
+\usetikzlibrary{chains}
+\usetikzlibrary{spy}
+\usetikzlibrary{intersections}
+\usetikzlibrary{through}
+\usetikzlibrary{cd}
 \usepackage{tikz-3dplot}
+%\usetikzlibrary{quotes,angles,graph}
 \tikzset{%
   invisible/.style={opacity=0},
   only/.code args={<#1>#2}{\only<#1>{\pgfkeysalso{#2}}},
@@ -54,8 +69,49 @@
   temporal/.code args={<#1>#2#3#4}{%
     \temporal<#1>{\pgfkeysalso{#2}}{\pgfkeysalso{#3}}{\pgfkeysalso{#4}}},
   point/.style={circle,inner sep=1.5pt,minimum size=1.5pt,draw,fill=#1},
-  point/.default=red
+  point/.default=red,
+  halfedge/.style={-{Stealth[left,scale=1.5]},commutative diagrams/shift left=#1},
+  halfedge/.default=3pt
 }
+% ------------------------------------------------------------------------------
+% #1 half length of tick
+% #2 min x
+% #3 min y
+% #4 max x
+% #5 max y
+\NewDocumentCommand{\myAxes}{O{4pt}mmmmO{0.001}}{%
+  %axis
+  \draw[-{Stealth[scale=1.5]}] (#2,0)--(#4,0);
+  \draw[-{Stealth[scale=1.5]}] (0,#3)--(0,#5);
+  %ticks
+  \pgfmathtruncatemacro{\xs}{int(#2)};
+  \pgfmathtruncatemacro{\xe}{int(#4-#6)};
+  \pgfmathtruncatemacro{\ys}{int(#3)};
+  \pgfmathtruncatemacro{\ye}{int(#5-#6)};
+  \foreach \x in {\xs,...,\xe} \draw (\x,#1)--(\x,-#1);
+  \foreach \y in {\ys,...,\ye} \draw (#1,\y)--(-#1,\y);%
+}
+% ------------------------------------------------------------------------------
+%Syntax: [draw options] (center) (initial angle:final angle:radius)
+\def\centerarc[#1](#2)(#3:#4:#5){\draw[#1]([shift=(#3:#5)]#2) arc (#3:#4:#5)}
+% ------------------------------------------------------------------------------
+\def\arrCrossVertexZ(#1)#2#3{\node[cross=#3] at (#1) (#2) {};}
+\def\arrQueryVertexZ(#1)#2{\arrCrossVertexZ(#1){#2}{red}}
+\def\arrCrossLabeledVertexZ[#1](#2)#3#4#5{\node [cross=#5,label={[label distance=-3pt]#1:{#4}}] at (#2) (#3) {};}
+\def\arrQueryLabeledVertexZ[#1](#2)#3#4{\arrCrossLabeledVertexZ[#1](#2){#3}{#4}{red}}
+%
+\def\arrColorVertexZ(#1)#2#3{\node[point=#3] at (#1) (#2) {};}
+\def\arrMinorVertexZ(#1)#2{\arrColorVertexZ(#1){#2}{cyan}}
+\def\arrMainVertexZ(#1)#2{\arrColorVertexZ(#1){#2}{red}}
+\def\arrIntersectionVertexZ(#1)#2{\arrColorVertexZ(#1){#2}{white}}
+\def\arrColoredLabeledVertexZ[#1](#2)#3#4#5{\node [point=#5,label={[label distance=-3pt]#1:{#4}}] at (#2) (#3) {};}
+\def\arrMainLabeledVertexZ[#1](#2)#3#4{\arrColoredLabeledVertexZ[#1](#2){#3}{#4}{red}}
+\def\arrMinorLabeledVertexZ[#1](#2)#3#4{\arrColoredLabeledVertexZ[#1](#2){#3}{#4}{cyan}}
+% ------------------------------------------------------------------------------
+\def\arrvZ[#1](#2)#3{\arrColoredLabeledVertexZ[#1](#2){#3}{$v_{#3}$}{red}}
+\def\arruZ[#1](#2)#3{\arrColoredLabeledVertexZ[#1](#2){#3}{$u_{#3}$}{red}}
+\def\arrpZ[#1](#2)#3{\arrColoredLabeledVertexZ[#1](#2){#3}{$p_{#3}$}{red}}
+% ==============================================================================
 \makeatletter
 \def\nodesDef{\@ifnextchar[{\@nodesDefWith}{\@nodesDefWithout}}
 \def\@nodesDefWith[#1]#2{\foreach \c in #2 { \node[point=#1] (n\c) at (\c) {}; }}
@@ -81,6 +137,7 @@
 % \usepackage{picins}
 \usepackage[absolute,overlay]{textpos}
 \usepackage{ifthen}
+\usepackage{xparse}
 \usepackage{etoolbox}
 %
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/insert.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/insert.tex
index 44f58b9c38a4..060f751f1335 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/insert.tex
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/insert.tex
@@ -2,96 +2,92 @@
 \input{header}
 \pagestyle{empty}
 \begin{document}
-\psscalebox{1.8}{\arrset{0.5}%
-  \begin{tabular}{ccc}
-    \pspicture[](0.5,0)(10,7)
-    \arrMainVertex(1,4){a}
-    \arrMainVertex(5,6){b}
-    \arrMainVertex(9,4){c}
-    \arrMainVertex(7,2){d}
-    \arrMainVertex(3,1){e}
-    \arrMainVertex(3,2){f}
-    \ncline[linewidth=0.5pt,linecolor=blue]{a}{b}
-    \ncline[linewidth=0.5pt,linecolor=blue]{b}{c}
-    \ncline[linewidth=0.5pt,linecolor=blue]{c}{d}
-    \ncline[linewidth=0.5pt,linecolor=blue]{d}{e}
-    \ncline[linewidth=0.5pt,linecolor=blue]{e}{f}
-    \ncline[linewidth=0.5pt,linecolor=blue]{f}{a}
-    \arrMinorVertex(3,3){1}\uput[135]{0}(3,3){$v_1$}
-    \arrMinorVertex(6,4){2}\uput[-45]{0}(6,4){$v_2$}
-    \ncline[linestyle=dashed,linewidth=0.5pt,linecolor=blue]{1}{2}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{1}{2}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{2}{1}
-    \rput(5,5){$f$}
-    \psframe[linewidth=0.5pt](0.5,0)(10,7)
-    \endpspicture &
-    %
-    \pspicture[](0.5,0)(10,7)
-    \arrMainVertex(1,3){a}
-    \arrMainVertex(2,5){b}
-    \arrMainVertex(5,6){c}
-    \arrMainVertex(7,3){u}
-    \uput[180]{0}(7,3){$u$}
-    \arrMainVertex(5,1){e}
-    \arrMainVertex(3,2){f}
-    \arrMainVertex(2,1){g}
-    \ncline[linewidth=0.5pt,linecolor=blue]{a}{b}
-    \ncline[linewidth=0.5pt,linecolor=blue]{b}{c}
-    \ncline[linewidth=0.5pt,linecolor=blue]{c}{u}
-    \ncline[linewidth=0.5pt,linecolor=blue]{u}{e}
-    \ncline[linewidth=0.5pt,linecolor=blue]{e}{f}
-    \ncline[linewidth=0.5pt,linecolor=blue]{f}{g}
-    \ncline[linewidth=0.5pt,linecolor=blue]{g}{a}
-    \arrMinorVertex(9,4){v}
-    \uput[90]{0}(9,4){$v$}
-    \ncline[linestyle=dashed,linewidth=0.5pt,linecolor=blue]{u}{v}
-    \ncline[linestyle=dashed,linewidth=0.5pt,offset=3pt]{->}{c}{u}
-    \ncline[linestyle=dashed,linewidth=0.5pt,offset=3pt]{->}{u}{e}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{u}{v}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{v}{u}
-    \psframe[linewidth=0.5pt](0.5,0)(10,7)
-    \endpspicture &
-    %
-    \pspicture[](0.5,0)(10,7)
-    \arrMainVertex(1,3){a}
-    \arrMainVertex(2,6){b}
-    \arru[45](5,6){1}
-    \arru[-45](7,1){2}
-    \arrMainVertex(4,2){e}
-    \arrMainVertex(2,1){f}
-    \ncline[linewidth=0.5pt,linecolor=blue]{a}{b}
-    \ncline[linewidth=0.5pt,linecolor=blue]{b}{1}
-    \ncline[linestyle=dashed,linewidth=0.5pt,offset=3pt]{->}{b}{1}
-    \ncline[linestyle=dashed,linewidth=0.5pt,offset=3pt]{->}{1}{b}
-    \ncline[linestyle=dashed,linewidth=0.5pt,linecolor=blue]{1}{2}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{1}{2}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepA=6pt]{->}{2}{1}
-    \ncline[linewidth=0.5pt,linecolor=blue]{2}{e}
-    \ncline[linestyle=dashed,linewidth=0.5pt,offset=3pt]{->}{2}{e}
-    \ncline[linestyle=dashed,linewidth=0.5pt,offset=3pt,nodesepB=4pt]{->}{e}{2}
-    \ncline[linewidth=0.5pt,linecolor=blue]{e}{f}
-    \ncline[linewidth=0.5pt,linecolor=blue]{f}{a}
-    \arrMainVertex(2.5,4){a}
-    \arrMainVertex(3.5,5){b}
-    \arrMainVertex(4.5,4){c}
-    \arrMainVertex(3.5,3){d}
-    \ncline[linewidth=0.5pt,linecolor=blue]{a}{b}
-    \ncline[linewidth=0.5pt,linecolor=blue]{b}{c}
-    \ncline[linewidth=0.5pt,linecolor=blue]{c}{d}\Aput[1pt]{$h_1$}
-    \ncline[linewidth=0.5pt,linecolor=blue]{d}{a}
-    \ncline[linewidth=0.5pt,linecolor=blue]{a}{c}
-    \rput(1,5){$f$}
-    \rput(2.5,5){$f'$}
-    \arrMainVertex(7,4){a}
-    \arrMainVertex(8,4){b}
-    \arrMainVertex(8,5){c}
-    \arrMainVertex(9,3){d}
-    \ncline[linewidth=0.5pt,linecolor=blue]{a}{b}
-    \ncline[linewidth=0.5pt,linecolor=blue]{b}{c}
-    \ncline[linewidth=0.5pt,linecolor=blue]{c}{a}
-    \ncline[linewidth=0.5pt,linecolor=blue]{b}{d}\Aput[1pt]{$h_2$}
-    \psframe[linewidth=0.5pt](0.5,0)(10,7)
-    \endpspicture
-  \end{tabular}
-}
+\begin{tabular}{ccc}
+  \begin{tikzpicture}
+    \node[point] at (1,4) (a) {};
+    \node[point] at (5,6) (b) {};
+    \node[point] at (9,4) (c) {};
+    \node[point] at (7,2) (d) {};
+    \node[point] at (3,1) (e) {};
+    \node[point] at (3,2) (f) {};
+    \draw[blue,very thick](a)--(b);
+    \draw[blue,very thick](b)--(c);
+    \draw[blue,very thick](c)--(d);
+    \draw[blue,very thick](d)--(e);
+    \draw[blue,very thick](e)--(f);
+    \draw[blue,very thick](f)--(a);
+    \node[point=cyan,label={[label distance=0pt]135:{$v_1$}}] at (3,3) (1) {};
+    \node[point=cyan,label={[label distance=0pt]135:{$v_2$}}] at (6,4) (2) {};
+    \draw[dashed,blue,very thick] (1)--(2);
+    \draw[halfedge] (1) to (2);
+    \draw[halfedge] (2) to (1);
+    \node at (5,5) {$f$};
+    \draw[thin](0.5,0) rectangle (10,7);
+  \end{tikzpicture} &
+  %
+  \begin{tikzpicture}
+    \node[point] at (1,3) (a) {};
+    \node[point] at (2,5) (b) {};
+    \node[point] at (5,6) (c) {};
+    \node[point,label={[label distance=0pt]180:{$u$}}] at (7,3) (u) {};
+    \node[point] at (5,1) (e) {};
+    \node[point] at (3,2) (f) {};
+    \node[point] at (2,1) (g) {};
+    \draw[blue,very thick](a)--(b);
+    \draw[blue,very thick](b)--(c);
+    \draw[blue,very thick](c)--(u);
+    \draw[blue,very thick](u)--(e);
+    \draw[blue,very thick](e)--(f);
+    \draw[blue,very thick](f)--(g);
+    \draw[blue,very thick](g)--(a);
+    \node[point=cyan,label={[label distance=0pt]90:{$v$}}] at (9,4) (v) {};
+    \draw[dashed,blue,very thick] (u)--(v);
+    \draw[dashed,halfedge] (c) to (u);
+    \draw[dashed,halfedge] (u) to (e);
+    \draw[halfedge] (u) to (v);
+    \draw[halfedge] (v) to (u);
+    \draw[thin] (0.5,0) rectangle (10,7);
+  \end{tikzpicture} &
+  %
+  \begin{tikzpicture}
+    \node[point] at (1,3) (a) {};
+    \node[point] at (2,6) (b) {};
+    \node[point,label={[label distance=0pt]45:{$u_1$}}] at (5,6) (1) {};
+    \node[point,label={[label distance=0pt]45:{$u_2$}}] at (7,1) (2) {};
+    \node[point] at (4,2) (e) {};
+    \node[point] at (2,1) (f) {};
+    \draw[blue,very thick](a)--(b);
+    \draw[blue,very thick](b)--(1);
+    \draw[dashed,thick,halfedge] (b) to (1);
+    \draw[dashed,thick,halfedge] (1) to (b);
+    \draw[dashed,blue,very thick](1)--(2);
+    \draw[thick,halfedge] (1) to (2);
+    \draw[thick,halfedge,shorten <=4pt] (2) to (1);
+    \draw[blue,very thick] (2)--(e);
+    \draw[dashed,halfedge] (2) to (e);
+    \draw[dashed,halfedge,shorten >=4pt] (e) to (2);
+    \draw[blue,very thick] (e)--(f);
+    \draw[blue,very thick] (f)--(a);
+    \node[point] at (2.5,4) (a) {};
+    \node[point] at (3.5,5) (b) {};
+    \node[point] at (4.5,4) (c) {};
+    \node[point] at (3.5,3) (d) {};
+    \draw[blue,very thick](a)--(b);
+    \draw[blue,very thick](b)--(c);
+    \draw[blue,very thick](c)-- node[midway,below,sloped] {$h_1$} (d);
+    \draw[blue,very thick](d)--(a);
+    \draw[blue,very thick](a)--(c);
+    \node at (1,5) {$f$};
+    \node at (2.5,5) {$f'$};
+    \node[point] at (7,4) (a) {};
+    \node[point] at (8,4) (b) {};
+    \node[point] at (8,5) (c) {};
+    \node[point] at (9,3) (d) {};
+    \draw[blue,very thick] (a)--(b);
+    \draw[blue,very thick] (b)--(c);
+    \draw[blue,very thick] (c)--(a);
+    \draw[blue,very thick] (b)-- node[midway,below,sloped] {$h_2$} (d);
+    \draw[thin] (0.5,0) rectangle (10,7);
+  \end{tikzpicture}
+\end{tabular}
 \end{document}

From 25ad1dc0641f01a1eb70dfa2d449c372315f502e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 23 Oct 2023 14:45:26 +0100
Subject: [PATCH 0935/1398] Kernel_23: Exploit Uncertain in collinear_3()

---
 Cartesian_kernel/include/CGAL/predicates/kernel_ftC3.h | 8 +++++---
 1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/Cartesian_kernel/include/CGAL/predicates/kernel_ftC3.h b/Cartesian_kernel/include/CGAL/predicates/kernel_ftC3.h
index 5d210da549dc..86bf5f74bd23 100644
--- a/Cartesian_kernel/include/CGAL/predicates/kernel_ftC3.h
+++ b/Cartesian_kernel/include/CGAL/predicates/kernel_ftC3.h
@@ -102,12 +102,14 @@ collinearC3(const FT &px, const FT &py, const FT &pz,
   FT dqx = qx-rx;
   FT dpy = py-ry;
   FT dqy = qy-ry;
-  if (sign_of_determinant(dpx, dqx, dpy, dqy) != ZERO)
+
+  auto is_zero = sign_of_determinant(dpx, dqx, dpy, dqy) == ZERO;
+  if (certainly_not(is_zero))
       return false;
   FT dpz = pz-rz;
   FT dqz = qz-rz;
-  return CGAL_AND( sign_of_determinant(dpx, dqx, dpz, dqz) == ZERO ,
-                   sign_of_determinant(dpy, dqy, dpz, dqz) == ZERO );
+      return is_zero & CGAL_AND( sign_of_determinant(dpx, dqx, dpz, dqz) == ZERO ,
+                                 sign_of_determinant(dpy, dqy, dpz, dqz) == ZERO );
 }
 
 template < class FT >

From 655a86a3f687bb9b67a904625625faf56e64b0d2 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 24 Oct 2023 12:32:41 +0200
Subject: [PATCH 0936/1398] of/in

---
 Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
index 94f5d467485e..58a7b2299176 100644
--- a/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
+++ b/Triangulation_3/doc/Triangulation_3/CGAL/Triangulation_3.h
@@ -1319,7 +1319,7 @@ std::array<Vertex_handle, 3> vertices(const Facet& f) const;
 
 /*!
 * returns an array containing the vertices of `c`,
-* in the same order as the indices of `c`.
+* in the same order as the indices in `c`.
 */
 std::array<Vertex_handle, 4> vertices(const Cell_handle c) const;
 

From bd9b861cb630896560df1b8bad1d651e3bd73203 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 24 Oct 2023 12:32:55 +0200
Subject: [PATCH 0937/1398] CHANGES.md

---
 Installation/CHANGES.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 8ee04d38577d..974e3d75345e 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -52,6 +52,10 @@ Release date: October 2023
     `CGAL::Simplicial_mesh_cell_base_3`
     have been modified to enable passing a geometric traits and a custom cell base class.
 
+### [3D Triangulations](https://doc.cgal.org/6.0/Manual/packages.html#PkgTriangulation3)
+-   Added three functions `vertices()` to the class `Triangulation_3`.
+    Each of them returns an array containing the vertices of the given triangulation simplex.
+
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------
 

From 4bbbc482cf5490c1940c61f042267ee9346fedbf Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 24 Oct 2023 17:21:29 +0200
Subject: [PATCH 0938/1398] reduce the target dihedral angle to fit in the
 testsuite timeout

---
 .../test/Mesh_3/test_meshing_without_features_determinism.cpp   | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/test/Mesh_3/test_meshing_without_features_determinism.cpp b/Mesh_3/test/Mesh_3/test_meshing_without_features_determinism.cpp
index 0dd8fb468882..e40409951b41 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_without_features_determinism.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_without_features_determinism.cpp
@@ -31,7 +31,7 @@ void test()
   std::size_t nb_runs   = 2;
   unsigned int nb_lloyd = 2;
   unsigned int nb_odt   = 2;
-  double perturb_bound  = 10.;
+  double perturb_bound  = 9.;
   double exude_bound    = 15.;
 
   // Domain

From 48ee7cad903bee2dc37049782755344ad5b8b419 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 25 Oct 2023 10:03:14 +0100
Subject: [PATCH 0939/1398] Add read_VTK() so that we can also read non-xml  
 *.vtk files

---
 Stream_support/include/CGAL/IO/VTK.h | 58 ++++++++++++++++++++++++++++
 1 file changed, 58 insertions(+)

diff --git a/Stream_support/include/CGAL/IO/VTK.h b/Stream_support/include/CGAL/IO/VTK.h
index 585cc9d96854..49cdb33da9ce 100644
--- a/Stream_support/include/CGAL/IO/VTK.h
+++ b/Stream_support/include/CGAL/IO/VTK.h
@@ -26,8 +26,10 @@
 #include <vtkCommand.h>
 #include <vtkCell.h>
 #include <vtkXMLPolyDataReader.h>
+#include <vtkDataSetReader.h>
 #include <vtkPointSet.h>
 #include <vtkPolyData.h>
+#include <vtkUnstructuredGrid.h>
 #endif
 
 #if defined(CGAL_USE_VTK) || defined(DOXYGEN_RUNNING)
@@ -140,6 +142,62 @@ bool read_VTP(const std::string& fname, PointRange& points, PolygonRange& polygo
   return read_VTP(fname, points, polygons, parameters::default_values());
 }
 
+
+template <typename PointRange, typename PolygonRange, typename NamedParameters>
+bool read_VTK(const std::string& fname,
+              PointRange& points,
+              PolygonRange& polygons,
+              const NamedParameters& np)
+{
+  std::ifstream test(fname);
+  if(!test.good())
+  {
+    std::cerr<<"File doesn't exist."<<std::endl;
+    return false;
+  }
+
+  vtkSmartPointer<vtkPointSet> data;
+  vtkSmartPointer<internal::ErrorObserverVtk> obs =
+      vtkSmartPointer<internal::ErrorObserverVtk>::New();
+  vtkSmartPointer<vtkDataSetReader> reader =
+    CGAL::IO::internal::read_vtk_file<vtkDataSetReader>(fname,obs);
+  data = vtkPolyData::SafeDownCast(reader->GetOutput());
+  if (!data)
+    data = vtkUnstructuredGrid::SafeDownCast(reader->GetOutput());
+
+  if (obs->GetError())
+    return false;
+
+  return internal::vtkPointSet_to_polygon_soup(data, points, polygons, np);
+}
+
+/*!
+ * \ingroup PkgStreamSupportIoFuncsVTP
+ *
+ * \brief reads the content of the input file into `points` and `polygons`, using the \ref IOStreamVTK.
+ *
+ * \attention The polygon soup is not cleared, and the data from the file are appended.
+ *
+ * \tparam PointRange a model of the concepts `RandomAccessContainer` and `BackInsertionSequence`
+ *                    whose value type is the point type
+ * \tparam PolygonRange a model of the concepts `SequenceContainer` and `BackInsertionSequence`
+ *                      whose `value_type` is itself a model of the concept `SequenceContainer`
+ *                      and `BackInsertionSequence` whose `value_type` is an unsigned integer type
+ *                      convertible to `std::size_t`
+ *
+ * \param fname the path to the input file
+ * \param points points of the soup of polygons
+ * \param polygons a range of polygons. Each element in it describes a polygon
+ *        using the indices of the points in `points`.
+ *
+ * \returns `true` if the reading was successful, `false` otherwise.
+ */
+template <typename PointRange, typename PolygonRange>
+bool read_VTK(const std::string& fname, PointRange& points, PolygonRange& polygons)
+{
+  return read_VTK(fname, points, polygons, parameters::default_values());
+}
+
 ////////////////////////////////////////////////////////////////////////////////////////////////////
 ////////////////////////////////////////////////////////////////////////////////////////////////////
 // Write

From c7ab4718fd581eaabe920d79255035934844e22f Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 25 Oct 2023 16:10:14 +0100
Subject: [PATCH 0940/1398] remove unused variable

---
 .../Static_filters/Power_side_of_oriented_power_sphere_3.h       | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
index 9f0554bc9e19..f4adbbe18cf7 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h
@@ -293,7 +293,6 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
         double drt = (((square( drx ) + square( dry )) + square( drz )) + twt_rwt);
         int cmp;
         int int_tmp_result;
-        double eps;
         double RT_tmp_result = CGAL::determinant( dpx, dpy, dpt, dqx, dqy, dqt, drx, dry, drt );
 
         double max7 = CGAL::abs(dpz);

From e07eb9c0c4b392d6afc632fbfcfa18d3dd63dcce Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 26 Oct 2023 12:04:40 +0200
Subject: [PATCH 0941/1398] fix double/int conversion warning

---
 .../tetrahedral_remeshing_of_one_subdomain.cpp                  | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
index aae9673430a5..fb14e9316f9b 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
@@ -62,7 +62,7 @@ int main(int argc, char* argv[])
 
   /// Use vertical plane to split the mesh into two subdomains
   const K::Plane_3 plane(0, 0, 1, 0);
-  CGAL::Tetrahedral_remeshing::insert_points_on_plane(plane, 0.1*nbv, tr);
+  CGAL::Tetrahedral_remeshing::insert_points_on_plane(plane, nbv/10, tr);
 
   /// A subdomain index 0 is considered outside and is not remeshed
   /// so we set finite cells to a non-zero `Subdomain_index`

From 8aa8fb9397a2232e809597a4847766595c1865f9 Mon Sep 17 00:00:00 2001
From: ange-clement <ange.clement@etu.umontpellier.fr>
Date: Thu, 26 Oct 2023 14:22:38 +0200
Subject: [PATCH 0942/1398] Fixed issue (minimal)

---
 Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp
index 7b3051fdd3e7..47bfe0edbb73 100644
--- a/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_c3t3_item.cpp
@@ -334,6 +334,8 @@ void Scene_c3t3_item::drawEdges(Viewer_interface *viewer) const
 {
   Scene_triangulation_3_item::drawEdges(viewer);
 //add cnc
+  if(!visible())
+    return;
   if(d->cnc_are_shown)
   {
     getEdgeContainer(CNC)->setColor(QColor(Qt::black));

From c9eed8c4ece829b195013aa3723358e62bfe29db Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 26 Oct 2023 16:04:05 +0100
Subject: [PATCH 0943/1398] backtick

---
 Stream_support/include/CGAL/IO/VTK.h | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Stream_support/include/CGAL/IO/VTK.h b/Stream_support/include/CGAL/IO/VTK.h
index 49cdb33da9ce..d0f605834db2 100644
--- a/Stream_support/include/CGAL/IO/VTK.h
+++ b/Stream_support/include/CGAL/IO/VTK.h
@@ -123,7 +123,7 @@ bool read_VTP(const std::string& fname,
  * \attention The polygon soup is not cleared, and the data from the file are appended.
  *
  * \tparam PointRange a model of the concepts `RandomAccessContainer` and `BackInsertionSequence`
- *                    whose value type is the point type
+ *                    whose `value_type` is the point type
  * \tparam PolygonRange a model of the concepts `SequenceContainer` and `BackInsertionSequence`
  *                      whose `value_type` is itself a model of the concept `SequenceContainer`
  *                      and `BackInsertionSequence` whose `value_type` is an unsigned integer type
@@ -179,7 +179,7 @@ bool read_VTK(const std::string& fname,
  * \attention The polygon soup is not cleared, and the data from the file are appended.
  *
  * \tparam PointRange a model of the concepts `RandomAccessContainer` and `BackInsertionSequence`
- *                    whose value type is the point type
+ *                    whose `value_type` is the point type
  * \tparam PolygonRange a model of the concepts `SequenceContainer` and `BackInsertionSequence`
  *                      whose `value_type` is itself a model of the concept `SequenceContainer`
  *                      and `BackInsertionSequence` whose `value_type` is an unsigned integer type
@@ -402,7 +402,7 @@ void write_soup_polys_points(std::ostream& os,
  *
  * \brief writes the content of `points` and `polygons` in `out`, using the \ref IOStreamVTK.
  *
- * \tparam PointRange a model of the concept `RandomAccessContainer` whose value type is the point type
+ * \tparam PointRange a model of the concept `RandomAccessContainer` whose `value_type` is the point type
  * \tparam PolygonRange a model of the concept `SequenceContainer`
  *                      whose `value_type` is itself a model of the concept `SequenceContainer`
  *                      whose `value_type` is an unsigned integer type convertible to `std::size_t`
@@ -490,7 +490,7 @@ bool write_VTP(std::ostream& os,
  *
  * \brief writes the content of `points` and `polygons` in a file named `fname`, using the \ref IOStreamVTK.
  *
- * \tparam PointRange a model of the concept `RandomAccessContainer` whose value type is the point type
+ * \tparam PointRange a model of the concept `RandomAccessContainer` whose `valuetype` is the point type
  * \tparam PolygonRange a model of the concept `SequenceContainer`
  *                      whose `value_type` is itself a model of the concept `SequenceContainer`
  *                      whose `value_type` is an unsigned integer type convertible to `std::size_t`

From 2c22df45f3072abdd3f376c485aad1d6b9d26ad4 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 30 Oct 2023 10:23:21 +0100
Subject: [PATCH 0944/1398] fix conversion warning

---
 .../tetrahedral_remeshing_of_one_subdomain.cpp                 | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
index fb14e9316f9b..46feca51a486 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
@@ -55,6 +55,7 @@ int main(int argc, char* argv[])
 {
   const double target_edge_length = (argc > 1) ? atof(argv[1]) : 0.05;
   const std::size_t nbv = (argc > 2) ? atoi(argv[2]) : 1000;
+  const std::size_t nbv_on_plane = (argc > 3) ? atoi(argv[3]) : 100;
 
   /// Create a randomly generated triangulation of a sphere
   Remeshing_triangulation tr;
@@ -62,7 +63,7 @@ int main(int argc, char* argv[])
 
   /// Use vertical plane to split the mesh into two subdomains
   const K::Plane_3 plane(0, 0, 1, 0);
-  CGAL::Tetrahedral_remeshing::insert_points_on_plane(plane, nbv/10, tr);
+  CGAL::Tetrahedral_remeshing::insert_points_on_plane(plane, nbv_on_plane, tr);
 
   /// A subdomain index 0 is considered outside and is not remeshed
   /// so we set finite cells to a non-zero `Subdomain_index`

From 3204b527e8bba12b497a706fe4a38b893d139710 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 30 Oct 2023 12:11:24 +0100
Subject: [PATCH 0945/1398] reduce perturb_mesh_3 angle bound to fit timeout on
 more platforms

---
 .../test/Mesh_3/test_meshing_without_features_determinism.cpp  | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Mesh_3/test/Mesh_3/test_meshing_without_features_determinism.cpp b/Mesh_3/test/Mesh_3/test_meshing_without_features_determinism.cpp
index e40409951b41..e58b0e12d025 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_without_features_determinism.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_without_features_determinism.cpp
@@ -24,6 +24,7 @@
 // To avoid verbose function and named parameters call
 using namespace CGAL::parameters;
 
+
 template <typename Concurrency_tag>
 void test()
 {
@@ -31,7 +32,7 @@ void test()
   std::size_t nb_runs   = 2;
   unsigned int nb_lloyd = 2;
   unsigned int nb_odt   = 2;
-  double perturb_bound  = 9.;
+  double perturb_bound  = 7.;
   double exude_bound    = 15.;
 
   // Domain

From 7dc4b624aaae6c0270deb67a5efbf993a65a97c5 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Mon, 30 Oct 2023 15:04:24 +0100
Subject: [PATCH 0946/1398] fix a link error about ~Scene_item_with_properties

```
            Creating library C:/CGAL_ROOT/CGAL-6.0-Ic-93/cmake/platforms/MSVC-2022-Community-Release/test/Polyhedron_Demo/Release/scene_points_with_normal_item.lib and object C:/CGAL_ROOT/CGAL-6.0-Ic-93/cmake/platforms/MSVC-2022-Community-Release/test/Polyhedron_Demo/Release/scene_points_with_normal_item.exp
   158>Scene_points_with_normal_item.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: virtual __cdecl CGAL::Three::Scene_item_with_properties::~Scene_item_with_properties(void)" (__imp_??1Scene_item_with_properties@Three@CGAL@@UEAA@XZ) referenced in function "int `public: __cdecl Scene_points_with_normal_item::Scene_points_with_normal_item(class dtor$1 const &)'::`1'::dtor$1" (?dtor$1@?0???0Scene_points_with_normal_item@@QEAA@AEBV0@@Z@4HA) [C:\CGAL_ROOT\CGAL-6.0-Ic-93\cmake\platforms\MSVC-2022-Community-Release\test\Polyhedron_Demo\scene_points_with_normal_item.vcxproj]
   158>Scene_points_with_normal_item.obj : error LNK2019: unresolved external symbol "__declspec(dllimport) public: __cdecl CGAL::Three::Scene_item_with_properties::Scene_item_with_properties(void)" (__imp_??0Scene_item_with_properties@Three@CGAL@@QEAA@XZ) referenced in function "public: __cdecl Scene_points_with_normal_item::Scene_points_with_normal_item(class Scene_points_with_normal_item const &)" (??0Scene_points_with_normal_item@@QEAA@AEBV0@@Z) [C:\CGAL_ROOT\CGAL-6.0-Ic-93\cmake\platforms\MSVC-2022-Community-Release\test\Polyhedron_Demo\scene_points_with_normal_item.vcxproj]
   158>C:\CGAL_ROOT\CGAL-6.0-Ic-93\cmake\platforms\MSVC-2022-Community-Release\test\Polyhedron_Demo\Release\scene_points_with_normal_item.dll : fatal error LNK1120: 2 unresolved externals [C:\CGAL_ROOT\CGAL-6.0-Ic-93\cmake\platforms\MSVC-2022-Community-Release\test\Polyhedron_Demo\scene_points_with_normal_item.vcxproj]
```
https://cgal.geometryfactory.com/CGAL/testsuite/CGAL-6.0-Ic-93/Polyhedron_Demo/TestReport_Christo_MSVC-2022-Community-Release.gz
---
 Polyhedron/demo/Polyhedron/CMakeLists.txt          |  1 +
 .../demo/Polyhedron/Scene_item_with_properties.cpp | 14 ++++++++++++++
 .../CGAL/Three/Scene_item_with_properties.h        |  4 ++--
 3 files changed, 17 insertions(+), 2 deletions(-)
 create mode 100644 Polyhedron/demo/Polyhedron/Scene_item_with_properties.cpp

diff --git a/Polyhedron/demo/Polyhedron/CMakeLists.txt b/Polyhedron/demo/Polyhedron/CMakeLists.txt
index 325a670e8096..0e1d3034dd19 100644
--- a/Polyhedron/demo/Polyhedron/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/CMakeLists.txt
@@ -179,6 +179,7 @@ if(CGAL_Qt5_FOUND AND Qt5_FOUND)
     Viewer_interface_moc.cpp
     Scene_item_moc.cpp
     Scene_item.cpp
+    Scene_item_with_properties.cpp
     Triangle_container.cpp
     Edge_container.cpp
     Point_container.cpp
diff --git a/Polyhedron/demo/Polyhedron/Scene_item_with_properties.cpp b/Polyhedron/demo/Polyhedron/Scene_item_with_properties.cpp
new file mode 100644
index 000000000000..81c8b2647581
--- /dev/null
+++ b/Polyhedron/demo/Polyhedron/Scene_item_with_properties.cpp
@@ -0,0 +1,14 @@
+// Copyright (c) 2023  GeometryFactory Sarl (France)
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Laurent Rineau
+
+#include <CGAL/Three/Scene_item_with_properties.h>
+
+CGAL::Three::Scene_item_with_properties::~Scene_item_with_properties() {}
diff --git a/Three/include/CGAL/Three/Scene_item_with_properties.h b/Three/include/CGAL/Three/Scene_item_with_properties.h
index e900fad06a51..35ca2d427550 100644
--- a/Three/include/CGAL/Three/Scene_item_with_properties.h
+++ b/Three/include/CGAL/Three/Scene_item_with_properties.h
@@ -13,7 +13,7 @@
 #define SCENE_ITEM_WITH_PROPERTIES_H
 
 #include <CGAL/license/Three.h>
-
+#include <QtGlobal>
 #ifdef demo_framework_EXPORTS
 #  define DEMO_FRAMEWORK_EXPORT Q_DECL_EXPORT
 #else
@@ -30,7 +30,7 @@ namespace Three {
 //! the position of its manipulated frame, ...
 class DEMO_FRAMEWORK_EXPORT Scene_item_with_properties {
 public:
-  virtual ~Scene_item_with_properties(){}
+  virtual ~Scene_item_with_properties();
  //!\brief Copies properties from another Scene_item.
  //!
  //! Override this function to specify what must be copied.

From 21fddd1c13fc1bf57d701246891e5df894fa6e94 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 30 Oct 2023 23:40:12 +0100
Subject: [PATCH 0947/1398] Fix default values' bbox not being computed for
 point set items

---
 .../Alpha_wrap_3/Alpha_wrap_3_plugin.cpp      | 19 +++++++++----------
 1 file changed, 9 insertions(+), 10 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index f9eba756bf83..86a879835623 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -547,8 +547,6 @@ public Q_SLOTS:
           triangles.emplace_back(get(vpm, target(h, *pMesh)),
                                  get(vpm, target(next(h, *pMesh), *pMesh)),
                                  get(vpm, source(h, *pMesh)));
-
-          m_wrap_bbox += triangles.back().bbox();
         }
 
         continue;
@@ -571,8 +569,6 @@ public Q_SLOTS:
           triangles.emplace_back(soup_item->points()[p[0]],
                                  soup_item->points()[p[1]],
                                  soup_item->points()[p[2]]);
-
-          m_wrap_bbox += triangles.back().bbox();
         }
 
         continue;
@@ -599,8 +595,6 @@ public Q_SLOTS:
           triangles.emplace_back(get(vpm, target(h, *pMesh)),
                                  get(vpm, target(next(h, *pMesh), *pMesh)),
                                  get(vpm, source(h, *pMesh)));
-
-          m_wrap_bbox += triangles.back().bbox();
         }
 
         segments.reserve(segments.size() + selection_item->selected_edges.size());
@@ -608,16 +602,12 @@ public Q_SLOTS:
         {
           segments.emplace_back(get(vpm, target(halfedge(e, *pMesh), *pMesh)),
                                 get(vpm, target(opposite(halfedge(e, *pMesh), *pMesh), *pMesh)));
-
-          m_wrap_bbox += segments.back().bbox();
         }
 
         points.reserve(points.size() + selection_item->selected_vertices.size());
         for(const auto& v : selection_item->selected_vertices)
         {
           points.push_back(get(vpm, v));
-
-          m_wrap_bbox += points.back().bbox();
         }
 
         continue;
@@ -656,6 +646,15 @@ public Q_SLOTS:
     std::cout << segments.size() << " edges" << std::endl;
     std::cout << points.size() << " points" << std::endl;
 
+    for(const Kernel::Triangle_3& tr : triangles)
+      m_wrap_bbox += tr.bbox();
+    for(const Kernel::Segment_3& sg : segments)
+      m_wrap_bbox += sg.bbox();
+    for(const Kernel::Point_3& pt : points)
+      m_wrap_bbox += pt.bbox();
+
+    std::cout << "Bbox:\n" << m_wrap_bbox << std::endl;
+
     // The relative value uses the bbox of the full scene and not that of selected items to wrap
     // This is intentional, both because it's tedious to make it otherwise, and because it seems
     // to be simpler to compare between "all wrapped" / "some wrapped"

From fb682fe9eb7a24339a6e4004da6a07bffbdfe639 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 30 Oct 2023 23:43:54 +0100
Subject: [PATCH 0948/1398] Fix memory issues in PS/SS oracles after no longer
 taking oracles by const&

---
 .../Alpha_wrap_3/internal/Point_set_oracle.h  | 27 +++++++++++--------
 .../internal/Segment_soup_oracle.h            | 27 +++++++++++--------
 2 files changed, 32 insertions(+), 22 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
index 8ccbf049a33e..37ff14955604 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
@@ -28,6 +28,7 @@
 #include <iostream>
 #include <iterator>
 #include <functional>
+#include <memory>
 #include <vector>
 
 namespace CGAL {
@@ -41,6 +42,7 @@ struct PS_oracle_traits
   using Geom_traits = Alpha_wrap_AABB_geom_traits<GT_>; // Wrap the kernel to add Ball_3 + custom Do_intersect_3
 
   using Points = std::vector<typename GT_::Point_3>;
+  using Points_ptr = std::shared_ptr<Points>;
   using PR_iterator = typename Points::const_iterator;
 
   using Primitive = AABB_primitive<PR_iterator,
@@ -69,26 +71,29 @@ class Point_set_oracle
 
 private:
   using Points = typename PSOT::Points;
+  using Points_ptr = typename PSOT::Points_ptr;
   using AABB_tree = typename PSOT::AABB_tree;
   using Oracle_base = AABB_tree_oracle<Geom_traits, AABB_tree, CGAL::Default, BaseOracle>;
 
 private:
-  Points m_points;
+  Points_ptr m_points_ptr;
 
 public:
   // Constructors
-  Point_set_oracle()
-    : Oracle_base(BaseOracle(), Base_GT())
-  { }
-
   Point_set_oracle(const BaseOracle& base_oracle,
                    const Base_GT& gt = Base_GT())
     : Oracle_base(base_oracle, gt)
-  { }
+  {
+    m_points_ptr = std::make_shared<Points>();
+  }
 
   Point_set_oracle(const Base_GT& gt,
                    const BaseOracle& base_oracle = BaseOracle())
-    : Oracle_base(base_oracle, gt)
+    : Point_set_oracle(gt, base_oracle)
+  { }
+
+  Point_set_oracle()
+    : Point_set_oracle(BaseOracle(), Base_GT())
   { }
 
 public:
@@ -106,14 +111,14 @@ class Point_set_oracle
       return;
     }
 
-    const std::size_t old_size = m_points.size();
-    m_points.insert(std::cend(m_points), std::cbegin(points), std::cend(points));
+    const std::size_t old_size = m_points_ptr->size();
+    m_points_ptr->insert(std::cend(*m_points_ptr), std::cbegin(points), std::cend(points));
 
 #ifdef CGAL_AW3_DEBUG
     std::cout << "Insert into AABB tree (points)..." << std::endl;
 #endif
 
-    this->tree().insert(std::next(std::cbegin(m_points), old_size), std::cend(m_points));
+    this->tree().insert(std::next(std::cbegin(*m_points_ptr), old_size), std::cend(*m_points_ptr));
 
     // Manually constructing it here purely for profiling reasons: if we keep the lazy approach,
     // it will be done at the first treatment of a facet that needs a Steiner point.
@@ -121,7 +126,7 @@ class Point_set_oracle
     // to accelerate the tree.
     this->tree().accelerate_distance_queries();
 
-    CGAL_postcondition(this->tree().size() == m_points.size());
+    CGAL_postcondition(this->tree().size() == m_points_ptr->size());
   }
 };
 
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
index 63f3532cf67e..f4d1c338b62f 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
@@ -28,6 +28,7 @@
 #include <iostream>
 #include <iterator>
 #include <functional>
+#include <memory>
 #include <vector>
 
 namespace CGAL {
@@ -42,6 +43,7 @@ struct SS_oracle_traits
 
   using Segment = typename GT_::Segment_3;
   using Segments = std::vector<Segment>;
+  using Segments_ptr = std::shared_ptr<Segments>;
   using SR_iterator = typename Segments::const_iterator;
 
   using Primitive = AABB_primitive<SR_iterator,
@@ -71,26 +73,29 @@ class Segment_soup_oracle
 private:
   using Segment = typename SSOT::Segment;
   using Segments = typename SSOT::Segments;
+  using Segments_ptr = typename SSOT::Segments_ptr;
   using AABB_tree = typename SSOT::AABB_tree;
   using Oracle_base = AABB_tree_oracle<Geom_traits, AABB_tree, CGAL::Default, BaseOracle>;
 
 private:
-  Segments m_segments;
+  Segments_ptr m_segments_ptr;
 
 public:
   // Constructors
-  Segment_soup_oracle()
-    : Oracle_base(BaseOracle(), Base_GT())
-  { }
-
   Segment_soup_oracle(const BaseOracle& base_oracle,
                       const Base_GT& gt = Base_GT())
     : Oracle_base(base_oracle, gt)
-  { }
+  {
+    m_segments_ptr = std::make_shared<Segments>();
+  }
 
   Segment_soup_oracle(const Base_GT& gt,
                       const BaseOracle& base_oracle = BaseOracle())
-    : Oracle_base(base_oracle, gt)
+    : Segment_soup_oracle(base_oracle, gt)
+  { }
+
+  Segment_soup_oracle()
+    : Segment_soup_oracle(BaseOracle(), Base_GT())
   { }
 
 public:
@@ -109,7 +114,7 @@ class Segment_soup_oracle
 
     typename Geom_traits::Is_degenerate_3 is_degenerate = this->geom_traits().is_degenerate_3_object();
 
-    const std::size_t old_size = m_segments.size();
+    const std::size_t old_size = m_segments_ptr->size();
 
     for(const Segment& s : segments)
     {
@@ -121,13 +126,13 @@ class Segment_soup_oracle
         continue;
       }
 
-      m_segments.push_back(s);
+      m_segments_ptr->push_back(s);
     }
 
 #ifdef CGAL_AW3_DEBUG
     std::cout << "Insert into AABB tree (segments)..." << std::endl;
 #endif
-    this->tree().insert(std::next(std::cbegin(m_segments), old_size), std::cend(m_segments));
+    this->tree().insert(std::next(std::cbegin(*m_segments_ptr), old_size), std::cend(*m_segments_ptr));
 
     // Manually constructing it here purely for profiling reasons: if we keep the lazy approach,
     // it will be done at the first treatment of a facet that needs a Steiner point.
@@ -135,7 +140,7 @@ class Segment_soup_oracle
     // to accelerate the tree.
     this->tree().accelerate_distance_queries();
 
-    CGAL_postcondition(this->tree().size() == m_segments.size());
+    CGAL_postcondition(this->tree().size() == m_segments_ptr->size());
   }
 };
 

From 3879b13c0ed8b4f4677065b8b7ae6e5d0d4e93a2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 30 Oct 2023 23:46:46 +0100
Subject: [PATCH 0949/1398] Misc minor improvements

---
 .../CGAL/Alpha_wrap_3/internal/Oracle_base.h     |  1 -
 .../Alpha_wrap_3/internal/Point_set_oracle.h     |  2 +-
 .../Alpha_wrap_3/internal/Segment_soup_oracle.h  |  2 +-
 .../Alpha_wrap_3/internal/Triangle_mesh_oracle.h |  2 +-
 .../Alpha_wrap_3/internal/Triangle_soup_oracle.h | 16 +++++++++++++++-
 .../Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp |  4 ++--
 6 files changed, 20 insertions(+), 7 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Oracle_base.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Oracle_base.h
index 85bd11c00b6c..7f3534a484cf 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Oracle_base.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Oracle_base.h
@@ -321,7 +321,6 @@ class AABB_tree_oracle<GT, AABBTree, AABBTraversalTraits, int>
   typename AABB_tree::Bounding_box bbox() const
   {
     CGAL_precondition(!empty());
-
     return tree().bbox();
   }
 
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
index 37ff14955604..ad04a43f720e 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
@@ -106,7 +106,7 @@ class Point_set_oracle
     if(points.empty())
     {
 #ifdef CGAL_AW3_DEBUG
-      std::cout << "Warning: Input is empty " << std::endl;
+      std::cout << "Warning: Input is empty (PS)" << std::endl;
 #endif
       return;
     }
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
index f4d1c338b62f..349cd012ef7a 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Segment_soup_oracle.h
@@ -107,7 +107,7 @@ class Segment_soup_oracle
     if(segments.empty())
     {
 #ifdef CGAL_AW3_DEBUG
-      std::cout << "Warning: Input is empty " << std::endl;
+      std::cout << "Warning: Input is empty (SS)" << std::endl;
 #endif
       return;
     }
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
index ffd8326a44f6..d7f325e1428f 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_mesh_oracle.h
@@ -135,7 +135,7 @@ class Triangle_mesh_oracle
     if(is_empty(tmesh))
     {
 #ifdef CGAL_AW3_DEBUG
-      std::cout << "Warning: Input is empty " << std::endl;
+      std::cout << "Warning: Input is empty (TM)" << std::endl;
 #endif
       return;
     }
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
index 27322a554e36..dadfb5d8be10 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Triangle_soup_oracle.h
@@ -133,7 +133,7 @@ class Triangle_soup_oracle
     if(points.empty() || faces.empty())
     {
 #ifdef CGAL_AW3_DEBUG
-      std::cout << "Warning: Input is empty " << std::endl;
+      std::cout << "Warning: Input is empty (TS)" << std::endl;
 #endif
       return;
     }
@@ -190,8 +190,22 @@ class Triangle_soup_oracle
   void add_triangle_soup(const TriangleRange& triangles,
                          const CGAL_NP_CLASS& /*np*/ = CGAL::parameters::default_values())
   {
+    if(triangles.empty())
+    {
+#ifdef CGAL_AW3_DEBUG
+      std::cout << "Warning: Input is empty (TS)" << std::endl;
+#endif
+      return;
+    }
+
+#ifdef CGAL_AW3_DEBUG
+    std::cout << "Insert into AABB Tree (triangles)..." << std::endl;
+#endif
+
     typename Geom_traits::Is_degenerate_3 is_degenerate = this->geom_traits().is_degenerate_3_object();
 
+    Splitter_base::reserve(triangles.size());
+
     for(const Triangle_3& tr : triangles)
     {
       if(is_degenerate(tr))
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index 86a879835623..383d1103778f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -687,8 +687,8 @@ public Q_SLOTS:
 
     const bool use_message_box = ui.enableMessageBox->isChecked();
 
-    std::cout << "Wrapping edges? " << std::boolalpha << wrap_segments << std::endl;
     std::cout << "Wrapping faces? " << std::boolalpha << wrap_triangles << std::endl;
+    std::cout << "Wrapping edges? " << std::boolalpha << wrap_segments << std::endl;
 
     if(!wrap_triangles)
     {
@@ -740,7 +740,7 @@ public Q_SLOTS:
 
     if(alpha <= 0. || offset <= 0.)
     {
-      print_message("Warning: alpha/offset must be strictly positive - nothing to wrap");
+      print_message("Warning: alpha/offset must be strictly positive");
       QApplication::restoreOverrideCursor();
       return;
     }

From 4444fdf2d43f55eee71e16c111502ac742772904 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 31 Oct 2023 10:59:05 +0100
Subject: [PATCH 0950/1398] Fix compilation

---
 .../include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
index ad04a43f720e..33f8a52b178b 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Point_set_oracle.h
@@ -89,7 +89,7 @@ class Point_set_oracle
 
   Point_set_oracle(const Base_GT& gt,
                    const BaseOracle& base_oracle = BaseOracle())
-    : Point_set_oracle(gt, base_oracle)
+    : Point_set_oracle(base_oracle, gt)
   { }
 
   Point_set_oracle()

From 4324b71e506812a789b8ce3bbebc1fea1256fb4a Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 1 Nov 2023 18:11:51 +0200
Subject: [PATCH 0951/1398] Replaced 'typedef' with 'using'

---
 .../Arrangement_on_surface_2/Edge_length.h    | 12 +++---
 .../Extended_face_property_map.h              | 10 ++---
 .../Overlay_color_traits.h                    | 14 +++----
 .../algebraic_curves.cpp                      |  8 ++--
 .../algebraic_segments.cpp                    | 18 ++++----
 .../Arrangement_on_surface_2/arr_Bezier.h     | 24 +++++------
 .../Arrangement_on_surface_2/arr_circular.h   | 22 +++++-----
 .../arr_exact_construction_segments.h         | 24 +++++------
 .../arr_geodesic_on_sphere.h                  | 27 ++++++------
 .../arr_inexact_construction_segments.h       | 18 ++++----
 .../Arrangement_on_surface_2/arr_linear.h     | 30 ++++++-------
 .../Arrangement_on_surface_2/arr_polylines.h  | 16 +++----
 .../arr_rat_functions.h                       | 14 +++----
 .../batched_point_location.cpp                |  4 +-
 .../bgl_dual_adapter.cpp                      | 12 +++---
 .../bgl_primal_adapter.cpp                    |  4 +-
 .../bounded_vertical_decomposition.cpp        |  6 +--
 .../circular_line_arcs.cpp                    | 28 ++++++-------
 .../conic_multiplicities.cpp                  |  2 +-
 .../consolidated_curve_data.cpp               |  8 ++--
 .../curve_history.cpp                         |  6 +--
 .../dcel_extension.cpp                        |  4 +-
 .../dcel_extension_io.cpp                     |  6 +--
 .../dual_with_data.cpp                        |  6 +--
 .../edge_manipulation_curve_history.cpp       |  6 +--
 .../face_extension.cpp                        |  4 +-
 .../face_extension_overlay.cpp                | 11 +++--
 .../generic_curve_data.cpp                    | 12 +++---
 .../incremental_insertion.cpp                 |  4 +-
 .../Arrangement_on_surface_2/integer_type.h   |  6 +--
 .../io_curve_history.cpp                      |  2 +-
 .../overlay_color.cpp                         |  6 +--
 .../overlay_unbounded.cpp                     | 18 ++++----
 .../point_location.cpp                        |  4 +-
 .../point_location_utils.h                    | 30 ++++++-------
 .../polycurve_bezier.cpp                      | 10 ++---
 .../polycurve_circular_arc.cpp                | 10 ++---
 .../polycurve_conic.cpp                       |  8 ++--
 .../polycurve_geodesic.cpp                    | 41 +++++++++---------
 .../polycurves_basic.cpp                      | 16 +++----
 .../predefined_kernel_non_intersecting.cpp    | 24 +++++------
 ...tional_functions_rational_coefficients.cpp | 17 ++++----
 .../sgm_point_location.cpp                    | 42 +++++++++----------
 .../spherical_degenerate_sweep.cpp            | 29 +++++++------
 .../spherical_insert.cpp                      | 13 +++---
 .../spherical_overlay.cpp                     |  2 +-
 .../tracing_counting.cpp                      |  6 +--
 .../unb_planar_vertical_decomposition.cpp     | 12 +++---
 .../vertical_ray_shooting.cpp                 |  4 +-
 49 files changed, 326 insertions(+), 334 deletions(-)

diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Edge_length.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Edge_length.h
index 7ac8eb85dbc0..fe533d91c193 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Edge_length.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Edge_length.h
@@ -4,15 +4,15 @@
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 #include <CGAL/property_map.h>
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel Kernel;
-typedef Kernel::FT                                        Number_type;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
+using Number_type = Kernel::FT;
 
 template <typename Arrangement> struct Edge_length {
   // Boost property-type definitions.
-  typedef boost::readable_property_map_tag      category;
-  typedef Number_type                           value_type;
-  typedef value_type                            reference;
-  typedef typename Arrangement::Halfedge_handle key_type;
+  using category = boost::readable_property_map_tag;
+  using value_type = Number_type;
+  using reference = value_type;
+  using key_type = typename Arrangement::Halfedge_handle;
 
   value_type operator()(typename Arrangement::Halfedge_handle e) const {
     const auto diff_x = e->target()->point().x() - e->source()->point().x();
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Extended_face_property_map.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Extended_face_property_map.h
index d85ce59f669d..e98b15799cf2 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Extended_face_property_map.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Extended_face_property_map.h
@@ -4,13 +4,13 @@
 // A property map that reads/writes the information to/from the extended face.
 template <typename Arrangement, class Type> class Extended_face_property_map {
 public:
-  typedef typename Arrangement::Face_handle       Face_handle;
+  using Face_handle = typename Arrangement::Face_handle;
 
   // Boost property type definitions.
-  typedef boost::read_write_property_map_tag      category;
-  typedef Type                                    value_type;
-  typedef value_type&                             reference;
-  typedef Face_handle                             key_type;
+  using category = boost::read_write_property_map_tag;
+  using value_type = Type;
+  using reference = value_type&;
+  using key_type = Face_handle;
 
   // The get function is required by the property map concept.
   friend reference get(const Extended_face_property_map& /* map */, key_type key)
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Overlay_color_traits.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Overlay_color_traits.h
index 66d31c7c6506..6c04c312cb4f 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Overlay_color_traits.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/Overlay_color_traits.h
@@ -2,13 +2,13 @@
 #define OVERLAY_COLOR_TRAITS_H
 
 template <typename Arrangement> struct Overlay_color_traits {
-  typedef unsigned int                                  Color;
-  typedef typename Arrangement::Vertex_const_handle     V_const_handle;
-  typedef typename Arrangement::Halfedge_const_handle   H_const_handle;
-  typedef typename Arrangement::Face_const_handle       F_const_handle;
-  typedef typename Arrangement::Vertex_handle           V_handle;
-  typedef typename Arrangement::Halfedge_handle         H_handle;
-  typedef typename Arrangement::Face_handle             F_handle;
+  using Color = unsigned int;
+  using V_const_handle = typename Arrangement::Vertex_const_handle;
+  using H_const_handle = typename Arrangement::Halfedge_const_handle;
+  using F_const_handle = typename Arrangement::Face_const_handle;
+  using V_handle = typename Arrangement::Vertex_handle;
+  using H_handle = typename Arrangement::Halfedge_handle;
+  using F_handle = typename Arrangement::Face_handle;
 
   // Compute the average of the red, green, and blue components separately.
   Color blend(Color color1, Color color2) const
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_curves.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_curves.cpp
index 8d0a27ae5705..f8bc222897b7 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_curves.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_curves.cpp
@@ -21,10 +21,10 @@ int main ()
 #include "integer_type.h"
 #include "arr_print.h"
 
-typedef CGAL::Arr_algebraic_segment_traits_2<Integer> Traits;
-typedef CGAL::Arrangement_2<Traits>                   Arrangement;
-typedef Traits::Curve_2                               Curve;
-typedef Traits::Polynomial_2                          Polynomial;
+using Traits = CGAL::Arr_algebraic_segment_traits_2<Integer>;
+using Arrangement = CGAL::Arrangement_2<Traits>;
+using Curve = Traits::Curve_2;
+using Polynomial = Traits::Polynomial_2;
 
 int main() {
   CGAL::IO::set_pretty_mode(std::cout);             // for nice printouts.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp
index 69c4a66ea689..aba48b9f2224 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/algebraic_segments.cpp
@@ -21,15 +21,15 @@ int main ()
 #include "integer_type.h"
 #include "arr_print.h"
 
-typedef CGAL::Arr_algebraic_segment_traits_2<Integer> Traits;
-typedef CGAL::Arrangement_2<Traits>                   Arrangement;
-typedef Traits::Curve_2                               Curve;
-typedef Traits::Polynomial_2                          Polynomial;
-typedef Traits::Algebraic_real_1                      Algebraic_real;
-typedef Traits::X_monotone_curve_2                    X_monotone_curve;
-typedef Traits::Point_2                               Point;
-
-typedef std::variant<Point, X_monotone_curve>       Make_x_monotone_result;
+using Traits = CGAL::Arr_algebraic_segment_traits_2<Integer>;
+using Arrangement = CGAL::Arrangement_2<Traits>;
+using Curve = Traits::Curve_2;
+using Polynomial = Traits::Polynomial_2;
+using Algebraic_real = Traits::Algebraic_real_1;
+using X_monotone_curve = Traits::X_monotone_curve_2;
+using Point = Traits::Point_2;
+
+using Make_x_monotone_result = std::variant<Point, X_monotone_curve>;
 
 int main() {
   Traits traits;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_Bezier.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_Bezier.h
index 30d978942c8d..b78d0192ca44 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_Bezier.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_Bezier.h
@@ -6,17 +6,17 @@
 #include <CGAL/Arr_Bezier_curve_traits_2.h>
 #include <CGAL/Arrangement_2.h>
 
-typedef CGAL::CORE_algebraic_number_traits              Nt_traits;
-typedef Nt_traits::Rational                             NT;
-typedef Nt_traits::Rational                             Rational;
-typedef Nt_traits::Algebraic                            Algebraic;
-typedef CGAL::Cartesian<Rational>                       Rat_kernel;
-typedef CGAL::Cartesian<Algebraic>                      Alg_kernel;
-typedef Rat_kernel::Point_2                             Rat_point;
-typedef CGAL::Arr_Bezier_curve_traits_2<Rat_kernel, Alg_kernel, Nt_traits>
-                                                        Traits;
-typedef Traits::X_monotone_curve_2                      Bezier_x_monotone_curve;
-typedef Traits::Curve_2                                 Bezier_curve;
-typedef CGAL::Arrangement_2<Traits>                     Arrangement;
+using Nt_traits = CGAL::CORE_algebraic_number_traits;
+using NT = Nt_traits::Rational;
+using Rational = Nt_traits::Rational;
+using Algebraic = Nt_traits::Algebraic;
+using Rat_kernel = CGAL::Cartesian<Rational>;
+using Alg_kernel = CGAL::Cartesian<Algebraic>;
+using Rat_point = Rat_kernel::Point_2;
+using Traits =
+  CGAL::Arr_Bezier_curve_traits_2<Rat_kernel, Alg_kernel, Nt_traits>;
+using Bezier_x_monotone_curve = Traits::X_monotone_curve_2;
+using Bezier_curve = Traits::Curve_2;
+using Arrangement = CGAL::Arrangement_2<Traits>;
 
 #endif
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_circular.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_circular.h
index 752a1e84a2df..da88c3dfeb15 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_circular.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_circular.h
@@ -5,16 +5,16 @@
 #include <CGAL/Arr_circle_segment_traits_2.h>
 #include <CGAL/Arrangement_2.h>
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel  Kernel;
-typedef Kernel::FT                                         Number_type;
-typedef CGAL::Arr_circle_segment_traits_2<Kernel>          Traits;
-typedef Traits::CoordNT                                    CoordNT;
-typedef Traits::Point_2                                    Point;
-typedef Traits::Curve_2                                    Curve;
-typedef Traits::X_monotone_curve_2                         X_monotone_curve;
-typedef Traits::Rational_point_2                           Rational_point;
-typedef Traits::Rational_segment_2                         Segment;
-typedef Traits::Rational_circle_2                          Circle;
-typedef CGAL::Arrangement_2<Traits>                        Arrangement;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
+using Number_type = Kernel::FT;
+using Traits = CGAL::Arr_circle_segment_traits_2<Kernel>;
+using CoordNT = Traits::CoordNT;
+using Point = Traits::Point_2;
+using Curve = Traits::Curve_2;
+using X_monotone_curve = Traits::X_monotone_curve_2;
+using Rational_point = Traits::Rational_point_2;
+using Segment = Traits::Rational_segment_2;
+using Circle = Traits::Rational_circle_2;
+using Arrangement = CGAL::Arrangement_2<Traits>;
 
 #endif
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_exact_construction_segments.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_exact_construction_segments.h
index 9a80ccddf386..8673bf88d2a8 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_exact_construction_segments.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_exact_construction_segments.h
@@ -5,19 +5,19 @@
 #include <CGAL/Arr_segment_traits_2.h>
 #include <CGAL/Arrangement_2.h>
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel Kernel;
-typedef Kernel::FT                                        Number_type;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
+using Number_type = Kernel::FT;
 
-typedef CGAL::Arr_segment_traits_2<Kernel>                Traits;
-typedef Traits::Point_2                                   Point;
-typedef Traits::X_monotone_curve_2                        Segment;
+using Traits = CGAL::Arr_segment_traits_2<Kernel>;
+using Point = Traits::Point_2;
+using Segment = Traits::X_monotone_curve_2;
 
-typedef CGAL::Arrangement_2<Traits>                       Arrangement;
-typedef Arrangement::Vertex_handle                        Vertex_handle;
-typedef Arrangement::Halfedge_handle                      Halfedge_handle;
-typedef Arrangement::Face_handle                          Face_handle;
-typedef Arrangement::Vertex_const_handle                  Vertex_const_handle;
-typedef Arrangement::Halfedge_const_handle                Halfedge_const_handle;
-typedef Arrangement::Face_const_handle                    Face_const_handle;
+using Arrangement = CGAL::Arrangement_2<Traits>;
+using Vertex_handle = Arrangement::Vertex_handle;
+using Halfedge_handle = Arrangement::Halfedge_handle;
+using Face_handle = Arrangement::Face_handle;
+using Vertex_const_handle = Arrangement::Vertex_const_handle;
+using Halfedge_const_handle = Arrangement::Halfedge_const_handle;
+using Face_const_handle = Arrangement::Face_const_handle;
 
 #endif
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_geodesic_on_sphere.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_geodesic_on_sphere.h
index 5223a580111e..295c43cde6cf 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_geodesic_on_sphere.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_geodesic_on_sphere.h
@@ -6,21 +6,20 @@
 #include <CGAL/Arr_geodesic_arc_on_sphere_traits_2.h>
 #include <CGAL/Arr_spherical_topology_traits_2.h>
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel  Kernel;
-typedef Kernel::FT                                         Number_type;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
+using Number_type = Kernel::FT;
 
-typedef CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel>  Geom_traits;
-typedef Geom_traits::Point_2                               Point;
-typedef Geom_traits::X_monotone_curve_2                    X_monotone_curve;
-typedef CGAL::Arr_spherical_topology_traits_2<Geom_traits> Topol_traits;
-typedef CGAL::Arrangement_on_surface_2<Geom_traits, Topol_traits>
-                                                           Arrangement;
+using Geom_traits = CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel>;
+using Point = Geom_traits::Point_2;
+using X_monotone_curve = Geom_traits::X_monotone_curve_2;
+using Topol_traits = CGAL::Arr_spherical_topology_traits_2<Geom_traits>;
+using Arrangement = CGAL::Arrangement_on_surface_2<Geom_traits, Topol_traits>;
 
-typedef Arrangement::Vertex_handle                         Vertex_handle;
-typedef Arrangement::Halfedge_handle                       Halfedge_handle;
-typedef Arrangement::Face_handle                           Face_handle;
-typedef Arrangement::Vertex_const_handle                   Vertex_const_handle;
-typedef Arrangement::Halfedge_const_handle                 Halfedge_const_handle;
-typedef Arrangement::Face_const_handle                     Face_const_handle;
+using Vertex_handle = Arrangement::Vertex_handle;
+using Halfedge_handle = Arrangement::Halfedge_handle;
+using Face_handle = Arrangement::Face_handle;
+using Vertex_const_handle = Arrangement::Vertex_const_handle;
+using Halfedge_const_handle = Arrangement::Halfedge_const_handle;
+using Face_const_handle = Arrangement::Face_const_handle;
 
 #endif
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_inexact_construction_segments.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_inexact_construction_segments.h
index d38181e0f330..a6c2f4d9d8c0 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_inexact_construction_segments.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_inexact_construction_segments.h
@@ -5,16 +5,16 @@
 #include <CGAL/Arr_non_caching_segment_traits_2.h>
 #include <CGAL/Arrangement_2.h>
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
-typedef Kernel::FT                                          Number_type;
+using Kernel = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Number_type = Kernel::FT;
 
-typedef CGAL::Arr_non_caching_segment_traits_2<Kernel>      Traits;
-typedef Traits::Point_2                                     Point;
-typedef Traits::X_monotone_curve_2                          Segment;
+using Traits = CGAL::Arr_non_caching_segment_traits_2<Kernel>;
+using Point = Traits::Point_2;
+using Segment = Traits::X_monotone_curve_2;
 
-typedef CGAL::Arrangement_2<Traits>                         Arrangement;
-typedef Arrangement::Vertex_handle                          Vertex_handle;
-typedef Arrangement::Halfedge_handle                        Halfedge_handle;
-typedef Arrangement::Face_handle                            Face_handle;
+using Arrangement = CGAL::Arrangement_2<Traits>;
+using Vertex_handle = Arrangement::Vertex_handle;
+using Halfedge_handle = Arrangement::Halfedge_handle;
+using Face_handle = Arrangement::Face_handle;
 
 #endif
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_linear.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_linear.h
index 8dad9c70f593..d30ad3ae4dbd 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_linear.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_linear.h
@@ -5,22 +5,22 @@
 #include <CGAL/Arr_linear_traits_2.h>
 #include <CGAL/Arrangement_2.h>
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel Kernel;
-typedef Kernel::FT                                        Number_type;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
+using Number_type = Kernel::FT;
 
-typedef CGAL::Arr_linear_traits_2<Kernel>                 Traits;
-typedef Traits::Point_2                                   Point;
-typedef Traits::Segment_2                                 Segment;
-typedef Traits::Ray_2                                     Ray;
-typedef Traits::Line_2                                    Line;
-typedef Traits::X_monotone_curve_2                        X_monotone_curve;
+using Traits = CGAL::Arr_linear_traits_2<Kernel>;
+using Point = Traits::Point_2;
+using Segment = Traits::Segment_2;
+using Ray = Traits::Ray_2;
+using Line = Traits::Line_2;
+using X_monotone_curve = Traits::X_monotone_curve_2;
 
-typedef CGAL::Arrangement_2<Traits>                       Arrangement;
-typedef Arrangement::Vertex_handle                        Vertex_handle;
-typedef Arrangement::Halfedge_handle                      Halfedge_handle;
-typedef Arrangement::Face_handle                          Face_handle;
-typedef Arrangement::Vertex_const_handle                  Vertex_const_handle;
-typedef Arrangement::Halfedge_const_handle                Halfedge_const_handle;
-typedef Arrangement::Face_const_handle                    Face_const_handle;
+using Arrangement = CGAL::Arrangement_2<Traits>;
+using Vertex_handle = Arrangement::Vertex_handle;
+using Halfedge_handle = Arrangement::Halfedge_handle;
+using Face_handle = Arrangement::Face_handle;
+using Vertex_const_handle = Arrangement::Vertex_const_handle;
+using Halfedge_const_handle = Arrangement::Halfedge_const_handle;
+using Face_const_handle = Arrangement::Face_const_handle;
 
 #endif
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_polylines.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_polylines.h
index 710f3f05f8b2..97f0413c5216 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_polylines.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_polylines.h
@@ -6,14 +6,14 @@
 #include <CGAL/Arr_polyline_traits_2.h>
 #include <CGAL/Arrangement_2.h>
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel Kernel;
-typedef Kernel::FT                                        Number_type;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
+using Number_type = Kernel::FT;
 
-typedef CGAL::Arr_segment_traits_2<Kernel>                Segment_traits;
-typedef CGAL::Arr_polyline_traits_2<Segment_traits>       Traits;
-typedef Traits::Point_2                                   Point;
-typedef Traits::Segment_2                                 Segment;
-typedef Traits::Curve_2                                   My_polyline;
-typedef CGAL::Arrangement_2<Traits>                       Arrangement;
+using Segment_traits = CGAL::Arr_segment_traits_2<Kernel>;
+using Traits = CGAL::Arr_polyline_traits_2<Segment_traits>;
+using Point = Traits::Point_2;
+using Segment = Traits::Segment_2;
+using My_polyline = Traits::Curve_2;
+using Arrangement = CGAL::Arrangement_2<Traits>;
 
 #endif
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_rat_functions.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_rat_functions.h
index 79abccb062ca..f3d42944e805 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_rat_functions.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/arr_rat_functions.h
@@ -7,14 +7,14 @@
 #include <CGAL/Arr_rational_function_traits_2.h>
 #include <CGAL/Arrangement_2.h>
 
-typedef CORE::BigInt                               Number_type;
-typedef CGAL::Algebraic_kernel_d_1<Number_type>    AK1;
-typedef CGAL::Arr_rational_function_traits_2<AK1>  Traits;
+using Number_type = CORE::BigInt;
+using AK1 = CGAL::Algebraic_kernel_d_1<Number_type>;
+using Traits = CGAL::Arr_rational_function_traits_2<AK1>;
 
-typedef Traits::Polynomial_1                       Polynomial;
-typedef Traits::Algebraic_real_1                   Alg_real;
-typedef Traits::Bound                              Bound;
+using Polynomial = Traits::Polynomial_1;
+using Alg_real = Traits::Algebraic_real_1;
+using Bound = Traits::Bound;
 
-typedef CGAL::Arrangement_2<Traits>                Arrangement;
+using Arrangement = CGAL::Arrangement_2<Traits>;
 
 #endif
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/batched_point_location.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/batched_point_location.cpp
index f2cbc29815d4..a88e118f38c0 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/batched_point_location.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/batched_point_location.cpp
@@ -10,8 +10,8 @@
 #include "arr_inexact_construction_segments.h"
 #include "point_location_utils.h"
 
-typedef CGAL::Arr_point_location_result<Arrangement>    Point_location_result;
-typedef std::pair<Point, Point_location_result::Type>   Query_result;
+using Point_location_result = CGAL::Arr_point_location_result<Arrangement>;
+using Query_result = std::pair<Point, Point_location_result::Type>;
 
 int main() {
   // Construct the arrangement.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bgl_dual_adapter.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bgl_dual_adapter.cpp
index d059facf8f95..3d0f0b65c314 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bgl_dual_adapter.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bgl_dual_adapter.cpp
@@ -15,12 +15,12 @@
 #include "arr_exact_construction_segments.h"
 #include "arr_print.h"
 
-typedef CGAL::Arr_face_extended_dcel<Traits, unsigned int> Dcel;
-typedef CGAL::Arrangement_2<Traits, Dcel>                  Ex_arrangement;
-typedef CGAL::Dual<Ex_arrangement>                         Dual_arrangement;
-typedef CGAL::Arr_face_index_map<Ex_arrangement>           Face_index_map;
-typedef Extended_face_property_map<Ex_arrangement,unsigned int>
-                                                           Face_property_map;
+using Dcel = CGAL::Arr_face_extended_dcel<Traits, unsigned int>;
+using Ex_arrangement = CGAL::Arrangement_2<Traits, Dcel>;
+using Dual_arrangement = CGAL::Dual<Ex_arrangement>;
+using Face_index_map = CGAL::Arr_face_index_map<Ex_arrangement>;
+using Face_property_map =
+  Extended_face_property_map<Ex_arrangement,unsigned int>;
 
 int main() {
   // Construct an arrangement of seven intersecting line segments.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bgl_primal_adapter.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bgl_primal_adapter.cpp
index 163125c0e3df..e7d6720af5db 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bgl_primal_adapter.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bgl_primal_adapter.cpp
@@ -15,8 +15,8 @@
 #include "arr_exact_construction_segments.h"
 #include "Edge_length.h"
 
-typedef CGAL::Arr_vertex_index_map<Arrangement>  Vertex_index_map;
-typedef Edge_length<Arrangement>                 My_edge_length;
+using Vertex_index_map = CGAL::Arr_vertex_index_map<Arrangement>;
+using My_edge_length = Edge_length<Arrangement>;
 
 int main() {
   // Construct an arrangement of seven intersecting line segments.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bounded_vertical_decomposition.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bounded_vertical_decomposition.cpp
index 3f1403ecebdb..77137ced4873 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bounded_vertical_decomposition.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/bounded_vertical_decomposition.cpp
@@ -8,9 +8,9 @@
 
 #include "arr_exact_construction_segments.h"
 
-typedef std::pair<CGAL::Object, CGAL::Object>           Object_pair;
-typedef std::pair<Vertex_const_handle, Object_pair>     Vert_decomp_entry;
-typedef std::list<Vert_decomp_entry>                    Vert_decomp_list;
+using Object_pair = std::pair<CGAL::Object, CGAL::Object>;
+using Vert_decomp_entry = std::pair<Vertex_const_handle, Object_pair>;
+using Vert_decomp_list = std::list<Vert_decomp_entry>;
 
 int main() {
   // Construct the arrangement.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp
index 750986dda1eb..0d3e8cc3d169 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/circular_line_arcs.cpp
@@ -15,23 +15,23 @@
 #include <CGAL/Random.h>
 
 
-typedef CGAL::Quotient<CGAL::MP_Float>                      NT;
-typedef CGAL::Cartesian<NT>                                 Linear_k;
-typedef CGAL::Algebraic_kernel_for_circles_2_2<NT>          Algebraic_k;
-typedef CGAL::Circular_kernel_2<Linear_k,Algebraic_k>       Circular_k;
+using NT = CGAL::Quotient<CGAL::MP_Float>;
+using Linear_k = CGAL::Cartesian<NT>;
+using Algebraic_k = CGAL::Algebraic_kernel_for_circles_2_2<NT>;
+using Circular_k = CGAL::Circular_kernel_2<Linear_k,Algebraic_k>;
 
-typedef Circular_k::Point_2                                 Point_2;
-typedef Circular_k::Circle_2                                Circle_2;
-typedef Circular_k::Circular_arc_2                          Circular_arc_2;
-typedef Circular_k::Line_arc_2                              Line_arc_2;
+using Point_2 = Circular_k::Point_2;
+using Circle_2 = Circular_k::Circle_2;
+using Circular_arc_2 = Circular_k::Circular_arc_2;
+using Line_arc_2 = Circular_k::Line_arc_2;
 
-typedef std::variant< Circular_arc_2, Line_arc_2>         Arc_2;
-typedef std::vector< Arc_2>                                 ArcContainer;
+using Arc_2 = std::variant< Circular_arc_2, Line_arc_2>;
+using ArcContainer = std::vector< Arc_2>;
 
-typedef CGAL::Arr_circular_line_arc_traits_2<Circular_k>    Traits;
+using Traits = CGAL::Arr_circular_line_arc_traits_2<Circular_k>;
 
-typedef CGAL::Arrangement_2<Traits>                         Arrangement;
-typedef CGAL::Arr_naive_point_location<Arrangement>         Point_location;
+using Arrangement = CGAL::Arrangement_2<Traits>;
+using Point_location = CGAL::Arr_naive_point_location<Arrangement>;
 
 int main() {
   CGAL::Random generatorOfgenerator;
@@ -46,7 +46,7 @@ int main() {
   for (int i = 0; i < 10; i++) {
     x1 = theRandom.get_int(random_min,random_max);
     y1 = theRandom.get_int(random_min,random_max);
-    do{
+    do {
       x2 = theRandom.get_int(random_min,random_max);
       y2 = theRandom.get_int(random_min,random_max);
     } while((x1 == x2) && (y1 == y2));
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/conic_multiplicities.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/conic_multiplicities.cpp
index 752f6e21f9dd..5eaccf5db9ef 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/conic_multiplicities.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/conic_multiplicities.cpp
@@ -11,7 +11,7 @@
 #include "arr_conics.h"
 #include "arr_print.h"
 
-typedef CGAL::Arr_naive_point_location<Arrangement>             Naive_pl;
+using Naive_pl = CGAL::Arr_naive_point_location<Arrangement>;
 
 int main() {
   Traits traits;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/consolidated_curve_data.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/consolidated_curve_data.cpp
index 2bb6b9084758..55ea5aada147 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/consolidated_curve_data.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/consolidated_curve_data.cpp
@@ -9,10 +9,10 @@
 
 enum Segment_color {RED, BLUE};
 
-typedef CGAL::Arr_consolidated_curve_data_traits_2<Traits, Segment_color>
-                                                           Data_traits;
-typedef Data_traits::Curve_2                               Colored_segment;
-typedef CGAL::Arrangement_2<Data_traits>                   Colored_arr;
+using Data_traits =
+  CGAL::Arr_consolidated_curve_data_traits_2<Traits, Segment_color>;
+using Colored_segment = Data_traits::Curve_2;
+using Colored_arr = CGAL::Arrangement_2<Data_traits>;
 
 int main() {
   Colored_arr arr;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/curve_history.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/curve_history.cpp
index 49fa78bff2bf..4a7b7a57bdb4 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/curve_history.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/curve_history.cpp
@@ -8,9 +8,9 @@
 #include "arr_exact_construction_segments.h"
 #include "point_location_utils.h"
 
-typedef CGAL::Arrangement_with_history_2<Traits>              Arr_with_hist;
-typedef Arr_with_hist::Curve_handle                           Curve_handle;
-typedef CGAL::Arr_trapezoid_ric_point_location<Arr_with_hist> Point_location;
+using Arr_with_hist = CGAL::Arrangement_with_history_2<Traits>;
+using Curve_handle = Arr_with_hist::Curve_handle;
+using Point_location = CGAL::Arr_trapezoid_ric_point_location<Arr_with_hist>;
 
 int main() {
   // Insert 3 curves incrementally.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dcel_extension.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dcel_extension.cpp
index 3801d3126ae8..88140318fd22 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dcel_extension.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dcel_extension.cpp
@@ -8,8 +8,8 @@
 
 enum Color {BLUE, RED, WHITE};
 
-typedef CGAL::Arr_extended_dcel<Traits, Color, bool, size_t> Dcel;
-typedef CGAL::Arrangement_2<Traits, Dcel>                    Ex_arrangement;
+using Dcel = CGAL::Arr_extended_dcel<Traits, Color, bool, size_t>;
+using Ex_arrangement = CGAL::Arrangement_2<Traits, Dcel>;
 
 int main() {
   // Construct the arrangement containing two intersecting triangles.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dcel_extension_io.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dcel_extension_io.cpp
index 2be07e6bf1bb..441e4f7b6cac 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dcel_extension_io.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dcel_extension_io.cpp
@@ -31,9 +31,9 @@ std::istream& operator>>(std::istream& is, Color& color) {
   return is;
 }
 
-typedef CGAL::Arr_extended_dcel<Traits, Color, bool, int>       Ext_dcel;
-typedef CGAL::Arrangement_2<Traits, Ext_dcel>                   Ext_arrangement;
-typedef CGAL::Arr_extended_dcel_text_formatter<Ext_arrangement> Formatter;
+using Ext_dcel = CGAL::Arr_extended_dcel<Traits, Color, bool, int>;
+using Ext_arrangement = CGAL::Arrangement_2<Traits, Ext_dcel>;
+using Formatter = CGAL::Arr_extended_dcel_text_formatter<Ext_arrangement>;
 
 int main() {
   // Construct the arrangement containing two intersecting triangles.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dual_with_data.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dual_with_data.cpp
index e81a00c5d58d..8ffb6688971e 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dual_with_data.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/dual_with_data.cpp
@@ -10,9 +10,9 @@
 #include "arr_linear.h"
 #include "read_objects.h"
 
-typedef CGAL::Arr_curve_data_traits_2<Traits, size_t>   Data_traits;
-typedef Data_traits::X_monotone_curve_2                 Data_x_monotone_curve_2;
-typedef CGAL::Arrangement_2<Data_traits>                Data_arrangement;
+using Data_traits = CGAL::Arr_curve_data_traits_2<Traits, size_t>;
+using Data_x_monotone_curve_2 = Data_traits::X_monotone_curve_2;
+using Data_arrangement = CGAL::Arrangement_2<Data_traits>;
 
 int main(int argc, char* argv[]) {
   // Get the name of the input file from the command line, or use the default
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp
index bd636bc94fe5..bf1d504d4f6b 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/edge_manipulation_curve_history.cpp
@@ -8,9 +8,9 @@
 #include "arr_circular.h"
 #include "arr_print.h"
 
-typedef CGAL::Arrangement_with_history_2<Traits>                Arr_with_hist;
-typedef Arr_with_hist::Curve_handle                             Curve_handle;
-typedef CGAL::Arr_walk_along_line_point_location<Arr_with_hist> Point_location;
+using Arr_with_hist = CGAL::Arrangement_with_history_2<Traits>;
+using Curve_handle = Arr_with_hist::Curve_handle;
+using Point_location = CGAL::Arr_walk_along_line_point_location<Arr_with_hist>;
 
 int main() {
   // Construct an arrangement containing nine circles: C[0] of radius 2 and
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp
index 5778412a8dc0..8befee7dafcf 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp
@@ -7,8 +7,8 @@
 
 #include "arr_exact_construction_segments.h"
 
-typedef CGAL::Arr_face_extended_dcel<Traits, size_t>       Dcel;
-typedef CGAL::Arrangement_2<Traits, Dcel>                  Ex_arrangement;
+using Dcel = CGAL::Arr_face_extended_dcel<Traits, size_t>;
+using Ex_arrangement = CGAL::Arrangement_2<Traits, Dcel>;
 
 // An arrangement observer, used to receive notifications of face splits and
 // to update the indices of the newly created faces.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension_overlay.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension_overlay.cpp
index 7eda7deea852..27459e6ff9e2 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension_overlay.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension_overlay.cpp
@@ -9,12 +9,11 @@
 
 #include "arr_exact_construction_segments.h"
 
-typedef CGAL::Arr_face_extended_dcel<Traits, bool>       Dcel;
-typedef CGAL::Arrangement_2<Traits, Dcel>                Ex_arrangement;
-typedef CGAL::Arr_face_overlay_traits<Ex_arrangement, Ex_arrangement,
-                                      Ex_arrangement,
-                                      std::logical_and<bool> >
-                                                         Overlay_traits;
+using Dcel = CGAL::Arr_face_extended_dcel<Traits, bool>;
+using Ex_arrangement = CGAL::Arrangement_2<Traits, Dcel>;
+using Overlay_traits =
+  CGAL::Arr_face_overlay_traits<Ex_arrangement, Ex_arrangement,
+                                Ex_arrangement, std::logical_and<bool>>;
 
 int main() {
   // Construct the first arrangement, containing a square-shaped face.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/generic_curve_data.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/generic_curve_data.cpp
index 5756885a48ee..72710580dee3 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/generic_curve_data.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/generic_curve_data.cpp
@@ -7,18 +7,18 @@
 
 #include "arr_polylines.h"
 
-typedef std::string Name;               // The name-field type.
+using Name = std::string;               // The name-field type.
 
 struct Merge_names {
   Name operator() (const Name& s1, const Name& s2) const
   { return (s1 + " " + s2); }
 };
 
-typedef CGAL::Arr_curve_data_traits_2<Traits, Name, Merge_names>
-                                                    Ex_traits;
-typedef Ex_traits::Curve_2                          Ex_polyline;
-typedef Ex_traits::X_monotone_curve_2               Ex_x_monotone_polyline;
-typedef CGAL::Arrangement_2<Ex_traits>              Ex_arrangement;
+using Ex_traits = CGAL::Arr_curve_data_traits_2<Traits, Name, Merge_names>;
+
+using Ex_polyline = Ex_traits::Curve_2;
+using Ex_x_monotone_polyline = Ex_traits::X_monotone_curve_2;
+using Ex_arrangement = CGAL::Arrangement_2<Ex_traits>;
 
 int main() {
   // Construct an arrangement of four polylines named A--D.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp
index 59a0203a4b45..857a5ecdf01d 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/incremental_insertion.cpp
@@ -7,8 +7,8 @@
 #include "arr_exact_construction_segments.h"
 #include "arr_print.h"
 
-typedef CGAL::Arr_naive_point_location<Arrangement>             Naive_pl;
-typedef CGAL::Arr_point_location_result<Arrangement>::Type      Pl_result_type;
+using Naive_pl = CGAL::Arr_naive_point_location<Arrangement>;
+using Pl_result_type = CGAL::Arr_point_location_result<Arrangement>::Type;
 
 int main() {
   // Construct the arrangement of five intersecting segments.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/integer_type.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/integer_type.h
index 994567478152..b03f83fd832d 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/integer_type.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/integer_type.h
@@ -5,13 +5,13 @@
 
 #if CGAL_USE_GMP && CGAL_USE_MPFI
 #include <CGAL/Gmpz.h>
-typedef CGAL::Gmpz      Integer;
+using Integer = CGAL::Gmpz;
 #elif CGAL_USE_CORE
 #include <CGAL/CORE_BigInt.h>
-typedef CORE::BigInt    Integer;
+using Integer = CORE::BigInt;
 #else
 #include <CGAL/leda_integer.h>
-typedef LEDA::integer   Integer;
+using Integer = LEDA::integer;
 #endif
 
 #endif
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/io_curve_history.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/io_curve_history.cpp
index de866be3ada2..b62c6a93ff99 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/io_curve_history.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/io_curve_history.cpp
@@ -10,7 +10,7 @@
 #include "arr_exact_construction_segments.h"
 #include "arr_print.h"
 
-typedef CGAL::Arrangement_with_history_2<Traits>        Arr_with_hist;
+using Arr_with_hist = CGAL::Arrangement_with_history_2<Traits>;
 
 int main() {
   // Insert six additional segments aggregately:
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/overlay_color.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/overlay_color.cpp
index 6cb7f17f477b..42c7f69aaffc 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/overlay_color.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/overlay_color.cpp
@@ -11,9 +11,9 @@
 #include "arr_exact_construction_segments.h"
 #include "Overlay_color_traits.h"
 
-typedef unsigned int                                         Color;
-typedef CGAL::Arr_extended_dcel<Traits, Color, Color, Color> Dcel;
-typedef CGAL::Arrangement_2<Traits, Dcel>                    Ex_arrangement;
+using Color = unsigned int;
+using Dcel = CGAL::Arr_extended_dcel<Traits, Color, Color, Color>;
+using Ex_arrangement = CGAL::Arrangement_2<Traits, Dcel>;
 
 int main() {
   const Color vcol1(0x00000080), hcol1(0x000000ff), fcol1(0x00ccccff);
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/overlay_unbounded.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/overlay_unbounded.cpp
index 866c66016d1d..40d06f4f712c 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/overlay_unbounded.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/overlay_unbounded.cpp
@@ -16,15 +16,15 @@ struct Overlay_label {
   { return c + std::to_string(i); }
 };
 
-typedef CGAL::Arr_face_extended_dcel<Traits, char>         Dcel_dlue;
-typedef CGAL::Arrangement_2<Traits, Dcel_dlue>             Arrangement_blue;
-typedef CGAL::Arr_face_extended_dcel<Traits, unsigned int> Dcel_red;
-typedef CGAL::Arrangement_2<Traits, Dcel_red>              Arrangement_red;
-typedef CGAL::Arr_face_extended_dcel<Traits, std::string>  Dcel_res;
-typedef CGAL::Arrangement_2<Traits, Dcel_res>              Arrangement_res;
-typedef CGAL::Arr_face_overlay_traits<Arrangement_blue, Arrangement_red,
-                                      Arrangement_res, Overlay_label>
-                                                           Overlay_traits;
+using Dcel_dlue = CGAL::Arr_face_extended_dcel<Traits, char>;
+using Arrangement_blue = CGAL::Arrangement_2<Traits, Dcel_dlue>;
+using Dcel_red = CGAL::Arr_face_extended_dcel<Traits, unsigned int>;
+using Arrangement_red = CGAL::Arrangement_2<Traits, Dcel_red>;
+using Dcel_res = CGAL::Arr_face_extended_dcel<Traits, std::string>;
+using Arrangement_res = CGAL::Arrangement_2<Traits, Dcel_res>;
+using Overlay_traits =
+  CGAL::Arr_face_overlay_traits<Arrangement_blue, Arrangement_red,
+                                Arrangement_res, Overlay_label>;
 
 int main() {
   // Construct the first arrangement, induced by two lines y = x and y = -x.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location.cpp
index 31224d3363c8..8f9c0458d55e 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location.cpp
@@ -8,8 +8,8 @@
 #include "arr_inexact_construction_segments.h"
 #include "point_location_utils.h"
 
-typedef CGAL::Arr_naive_point_location<Arrangement>         Naive_pl;
-typedef CGAL::Arr_landmarks_point_location<Arrangement>     Landmarks_pl;
+using Naive_pl = CGAL::Arr_naive_point_location<Arrangement>;
+using Landmarks_pl = CGAL::Arr_landmarks_point_location<Arrangement>;
 
 int main() {
   // Construct the arrangement.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
index d5a729edc6d9..8dd199fde072 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/point_location_utils.h
@@ -9,10 +9,10 @@ void print_point_location
 (const typename Arrangement_::Point_2& q,
  typename CGAL::Arr_point_location_result<Arrangement_>::Type obj)
 {
-  typedef Arrangement_                                  Arrangement_2;
-  typedef typename Arrangement_2::Vertex_const_handle   Vertex_const_handle;
-  typedef typename Arrangement_2::Halfedge_const_handle Halfedge_const_handle;
-  typedef typename Arrangement_2::Face_const_handle     Face_const_handle;
+  using Arrangement_2 = Arrangement_;
+  using Vertex_const_handle = typename Arrangement_2::Vertex_const_handle;
+  using Halfedge_const_handle = typename Arrangement_2::Halfedge_const_handle;
+  using Face_const_handle = typename Arrangement_2::Face_const_handle;
 
   const Vertex_const_handle* v;
   const Halfedge_const_handle* e;
@@ -39,8 +39,8 @@ void locate_point(const PointLocation& pl,
                   const typename PointLocation::Arrangement_2::Point_2& q)
 {
   // Perform the point-location query.
-  typedef PointLocation                                 Point_location;
-  typedef typename Point_location::Arrangement_2        Arrangement_2;
+  using Point_location = PointLocation;
+  using Arrangement_2 = typename Point_location::Arrangement_2;
   typename CGAL::Arr_point_location_result<Arrangement_2>::Type obj =
     pl.locate(q);
 
@@ -56,16 +56,16 @@ void shoot_vertical_ray(const VerticalRayShooting& vrs,
                         const typename
                         VerticalRayShooting::Arrangement_2::Point_2& q)
 {
-  typedef VerticalRayShooting                           Vertical_ray_shooting;
+  using Vertical_ray_shooting = VerticalRayShooting;
 
   // Perform the point-location query.
   typename Vertical_ray_shooting::result_type obj = vrs.ray_shoot_up(q);
 
   // Print the result.
-  typedef typename Vertical_ray_shooting::Arrangement_2 Arrangement_2;
-  typedef typename Arrangement_2::Vertex_const_handle   Vertex_const_handle;
-  typedef typename Arrangement_2::Halfedge_const_handle Halfedge_const_handle;
-  typedef typename Arrangement_2::Face_const_handle     Face_const_handle;
+  using Arrangement_2 = typename Vertical_ray_shooting::Arrangement_2;
+  using Vertex_const_handle = typename Arrangement_2::Vertex_const_handle;
+  using Halfedge_const_handle = typename Arrangement_2::Halfedge_const_handle;
+  using Face_const_handle = typename Arrangement_2::Face_const_handle;
 
   const Vertex_const_handle* v;
   const Halfedge_const_handle* e;
@@ -94,10 +94,10 @@ void shoot_vertical_ray(const VerticalRayShooting& vrs,
 template <typename Arrangement_>
 void construct_segments_arr(Arrangement_& arr)
 {
-  typedef Arrangement_                                Arrangement_2;
-  typedef typename Arrangement_2::Point_2             Point_2;
-  typedef typename Arrangement_2::X_monotone_curve_2  Segment_2;
-  typedef typename Arrangement_2::Halfedge_handle     Halfedge_handle;
+  using Arrangement_2 = Arrangement_;
+  using Point_2 = typename Arrangement_2::Point_2;
+  using Segment_2 = typename Arrangement_2::X_monotone_curve_2;
+  using Halfedge_handle = typename Arrangement_2::Halfedge_handle;
 
   Point_2 p0(3,2), p1(0,3), p2(2,5), p3(4,5), p4(6,3), p5(3,0);
   Segment_2 s1(p1, p2), s2(p2, p3), s3(p3, p4), s4(p4, p5), s5(p5, p1);
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp
index 70184f7f4bb5..309a849e64bd 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_bezier.cpp
@@ -19,12 +19,12 @@ int main() {
 #include "arr_Bezier.h"
 #include "arr_print.h"
 
-typedef CGAL::Arr_polycurve_traits_2<Traits>            Polycurve_bezier_traits;
-typedef Polycurve_bezier_traits::Point_2                Point;
-typedef Polycurve_bezier_traits::X_monotone_curve_2     X_mono_polycurve;
-typedef CGAL::Arrangement_2<Polycurve_bezier_traits>    Arrangement_2;
+using Polycurve_bezier_traits = CGAL::Arr_polycurve_traits_2<Traits>;
+using Point = Polycurve_bezier_traits::Point_2;
+using X_mono_polycurve = Polycurve_bezier_traits::X_monotone_curve_2;
+using Arrangement_2 = CGAL::Arrangement_2<Polycurve_bezier_traits>;
 
-typedef std::variant<Point, Bezier_x_monotone_curve>  Make_x_monotone_result;
+using Make_x_monotone_result = std::variant<Point, Bezier_x_monotone_curve>;
 
 int main() {
   Polycurve_bezier_traits pc_traits;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_circular_arc.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_circular_arc.cpp
index 00827b0da577..742473a79bfa 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_circular_arc.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_circular_arc.cpp
@@ -22,11 +22,11 @@ int main() {
 #include "arr_circular.h"
 #include "arr_print.h"
 
-typedef CGAL::Arr_polycurve_traits_2<Traits>    Polycurve_traits;
-typedef Polycurve_traits::X_monotone_curve_2    X_monotone_polycurve;
-typedef Polycurve_traits::Curve_2               Polycurve;
-typedef Kernel::Circle_2                        Circle_2;
-typedef CGAL::Arrangement_2<Polycurve_traits>   Polycurve_circ_arc_arrangment;
+using Polycurve_traits = CGAL::Arr_polycurve_traits_2<Traits>;
+using X_monotone_polycurve = Polycurve_traits::X_monotone_curve_2;
+using Polycurve = Polycurve_traits::Curve_2;
+using Circle_2 = Kernel::Circle_2;
+using Polycurve_circ_arc_arrangment = CGAL::Arrangement_2<Polycurve_traits>;
 
 int main() {
   Polycurve_traits traits;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_conic.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_conic.cpp
index 803a0696bd28..bdaafb9ebb0c 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_conic.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_conic.cpp
@@ -21,10 +21,10 @@ int main() {
 #include "arr_conics.h"
 #include "arr_print.h"
 
-typedef CGAL::Arr_polycurve_traits_2<Traits>          Polycurve_conic_traits_2;
-typedef Polycurve_conic_traits_2::X_monotone_curve_2  X_monotone_polycurve;
-typedef Polycurve_conic_traits_2::Curve_2             Polycurve;
-typedef CGAL::Arrangement_2<Polycurve_conic_traits_2> Polycurve_conic_arrangment;
+using Polycurve_conic_traits_2 = CGAL::Arr_polycurve_traits_2<Traits>;
+using X_monotone_polycurve = Polycurve_conic_traits_2::X_monotone_curve_2;
+using Polycurve = Polycurve_conic_traits_2::Curve_2;
+using Polycurve_conic_arrangment = CGAL::Arrangement_2<Polycurve_conic_traits_2>;
 
 int main() {
   Traits sub_traits;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_geodesic.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_geodesic.cpp
index fdf6a5d0a5a7..008730bba159 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_geodesic.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurve_geodesic.cpp
@@ -10,31 +10,29 @@
 #include <CGAL/Arr_polyline_traits_2.h>
 #include <CGAL/Arrangement_on_surface_2.h>
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel    Kernel;
-typedef CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel>    Segment_traits_2;
-typedef CGAL::Arr_polyline_traits_2<Segment_traits_2>        Poly_traits_2;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
+using Segment_traits_2 = CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel>;
+using Poly_traits_2 = CGAL::Arr_polyline_traits_2<Segment_traits_2>;
 
-typedef Poly_traits_2::Point_2                               Point_2;
-typedef Poly_traits_2::Curve_2                               Poly_curve_2;
-typedef Poly_traits_2::X_monotone_curve_2                    X_poly_curve_2;
-typedef CGAL::Arr_spherical_topology_traits_2<Poly_traits_2>
-  Topol_poly_traits_2;
-typedef CGAL::Arrangement_on_surface_2<Poly_traits_2, Topol_poly_traits_2>
-                                                             Poly_arr;
+using Point_2 = Poly_traits_2::Point_2;
+using Poly_curve_2 = Poly_traits_2::Curve_2;
+using X_poly_curve_2 = Poly_traits_2::X_monotone_curve_2;
+using Topol_poly_traits_2 =
+  CGAL::Arr_spherical_topology_traits_2<Poly_traits_2>;
+using Poly_arr =
+  CGAL::Arrangement_on_surface_2<Poly_traits_2, Topol_poly_traits_2>;
 
-typedef Segment_traits_2::Curve_2                            Seg_curve_2;
-typedef Segment_traits_2::X_monotone_curve_2                 X_seg_curve_2;
-typedef CGAL::Arr_spherical_topology_traits_2<Segment_traits_2>
-  Topol_segment_traits_2;
-typedef CGAL::Arrangement_on_surface_2<Segment_traits_2, Topol_segment_traits_2>
-                                                             Segment_arr;
+using Seg_curve_2 = Segment_traits_2::Curve_2;
+using X_seg_curve_2 = Segment_traits_2::X_monotone_curve_2;
+using Topol_segment_traits_2 =
+  CGAL::Arr_spherical_topology_traits_2<Segment_traits_2>;
+using Segment_arr =
+  CGAL::Arrangement_on_surface_2<Segment_traits_2, Topol_segment_traits_2>;
 
 int main() {
   Segment_traits_2 seg_traits;
-  Segment_traits_2::Construct_point_2 ctr_p =
-    seg_traits.construct_point_2_object();
-  Segment_traits_2::Construct_x_monotone_curve_2 ctr_seg =
-    seg_traits.construct_x_monotone_curve_2_object();
+  auto ctr_p = seg_traits.construct_point_2_object();
+  auto ctr_seg = seg_traits.construct_x_monotone_curve_2_object();
 
   Point_2 p1 = ctr_p(0, 1, -1);
   Point_2 p2 = ctr_p(-11, 7, -7);
@@ -62,8 +60,7 @@ int main() {
   points.push_back(p5);
 
   Poly_traits_2 poly_traits;
-  Poly_traits_2::Construct_x_monotone_curve_2 ctr =
-    poly_traits.construct_x_monotone_curve_2_object();
+  auto ctr = poly_traits.construct_x_monotone_curve_2_object();
   Poly_arr poly_arr(&poly_traits);
   insert(poly_arr, ctr(seg_cv1));
   insert(poly_arr, ctr(seg_cv2));
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurves_basic.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurves_basic.cpp
index 016c0ef74de5..90bfde3c0a00 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurves_basic.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/polycurves_basic.cpp
@@ -10,14 +10,14 @@
 
 #include "arr_print.h"
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel Kernel;
-typedef CGAL::Arr_directional_non_caching_segment_basic_traits_2<Kernel>
-                                                            Subcurve_traits;
-typedef CGAL::Arr_polycurve_basic_traits_2<Subcurve_traits> Geom_traits;
-typedef Geom_traits::Point_2                                Point;
-typedef Subcurve_traits::X_monotone_curve_2                 X_monotone_subcurve;
-typedef Geom_traits::X_monotone_curve_2                     X_monotone_curve;
-typedef CGAL::Arrangement_2<Geom_traits>                    Arrangement;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
+using Subcurve_traits =
+  CGAL::Arr_directional_non_caching_segment_basic_traits_2<Kernel>;
+using Geom_traits = CGAL::Arr_polycurve_basic_traits_2<Subcurve_traits>;
+using Point = Geom_traits::Point_2;
+using X_monotone_subcurve = Subcurve_traits::X_monotone_curve_2;
+using X_monotone_curve = Geom_traits::X_monotone_curve_2;
+using Arrangement = CGAL::Arrangement_2<Geom_traits>;
 
 int main() {
   Geom_traits traits;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp
index 87b05dcbb15a..e4474ae57678 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp
@@ -9,12 +9,12 @@
 #include <list>
 #include <fstream>
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel   Kernel;
-typedef Kernel::FT                                            Number_type;
-typedef CGAL::Arr_non_caching_segment_basic_traits_2<Kernel>  Traits_2;
-typedef Traits_2::Point_2                                     Point_2;
-typedef Traits_2::X_monotone_curve_2                          Segment_2;
-typedef CGAL::Arrangement_2<Traits_2>                         Arrangement_2;
+using Kernel = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Number_type = Kernel::FT;
+using Traits_2 = CGAL::Arr_non_caching_segment_basic_traits_2<Kernel>;
+using Point_2 = Traits_2::Point_2;
+using Segment_2 = Traits_2::X_monotone_curve_2;
+using Arrangement_2 = CGAL::Arrangement_2<Traits_2>;
 
 int main(int argc, char* argv[]) {
   // Get the name of the input file from the command line, or use the default
@@ -39,14 +39,14 @@ int main(int argc, char* argv[]) {
   // <sx_n> <sy_n>  <tx_n> <ty_n>        // source and target of segment #n.
   std::list<Segment_2>  segments;
 
-  unsigned int n;
+  std::size_t n;
   in_file >> n;
   unsigned int i;
-  for (i = 0; i < n; ++i) {
+  for (std::size_t i = 0; i < n; ++i) {
     double sx, sy, tx, ty;
     in_file >> sx >> sy >> tx >> ty;
-    segments.push_back (Segment_2 (Point_2 (Number_type(sx), Number_type(sy)),
-                                   Point_2 (Number_type(tx), Number_type(ty))));
+    segments.push_back(Segment_2(Point_2 (Number_type(sx), Number_type(sy)),
+                                 Point_2 (Number_type(tx), Number_type(ty))));
   }
   in_file.close();
 
@@ -62,8 +62,8 @@ int main(int argc, char* argv[]) {
 
   // Print the arrangement dimensions.
   std::cout << "V = " << arr.number_of_vertices()
-            << ",  E = " << arr.number_of_edges()
-            << ",  F = " << arr.number_of_faces() << std::endl;
+            << ", E = " << arr.number_of_edges()
+            << ", F = " << arr.number_of_faces() << std::endl;
 
   std::cout << "Construction took " << timer.time() << " seconds.\n";
 
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/rational_functions_rational_coefficients.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/rational_functions_rational_coefficients.cpp
index 2419a5868bbb..4267a229f7c0 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/rational_functions_rational_coefficients.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/rational_functions_rational_coefficients.cpp
@@ -18,23 +18,22 @@ int main() {
 #include <CGAL/Arr_rational_function_traits_2.h>   // Traits
 #include <CGAL/Arrangement_2.h>                    // Arrangement
 
-typedef CORE::BigInt                               Integer;
-typedef CORE::BigRat                               Rational;
-typedef CGAL::Algebraic_kernel_d_1<Integer>           AK1;
-typedef CGAL::Arr_rational_function_traits_2<AK1>  Traits_2;
+using Integer = CORE::BigInt;
+using Rational = CORE::BigRat;
+using AK1 = CGAL::Algebraic_kernel_d_1<Integer>;
+using Traits_2 = CGAL::Arr_rational_function_traits_2<AK1>;
 
-typedef std::vector<Rational>                      Rat_vec;
-typedef Traits_2::Algebraic_real_1                 Alg_real_1;
+using Rat_vec = std::vector<Rational>;
+using Alg_real_1 = Traits_2::Algebraic_real_1;
 
-typedef CGAL::Arrangement_2<Traits_2>              Arrangement_2;
+using Arrangement_2 = CGAL::Arrangement_2<Traits_2>;
 
 int main () {
   CGAL::IO::set_pretty_mode(std::cout);             // for nice printouts.
 
   // Traits class object
   Traits_2 traits;
-  Traits_2::Construct_x_monotone_curve_2 construct_arc
-    = traits.construct_x_monotone_curve_2_object();
+  auto construct_arc = traits.construct_x_monotone_curve_2_object();
 
   // container storing all arcs
   std::vector<Traits_2::X_monotone_curve_2>  arcs;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
index 98515d5d0c9d..1b27e3bdda0e 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
@@ -14,36 +14,36 @@
 
 #include "point_location_utils.h"
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel       Kernel;
-typedef Kernel::Point_3                                         Point_3;
-typedef Kernel::Direction_3                                     Direction_3;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
+using Point_3 = Kernel::Point_3;
+using Direction_3 = Kernel::Direction_3;
 
 #if 0
-typedef CGAL::Arr_polyhedral_sgm_traits<Kernel, -8, 6>          Gm_traits;
+using Gm_traits = CGAL::Arr_polyhedral_sgm_traits<Kernel, -8, 6>;
 #elif 0
-typedef CGAL::Arr_polyhedral_sgm_traits<Kernel, -11, 7>         Gm_traits;
+using Gm_traits = CGAL::Arr_polyhedral_sgm_traits<Kernel, -11, 7>;
 #else
-typedef CGAL::Arr_polyhedral_sgm_traits<Kernel, -1, 0>          Gm_traits;
+using Gm_traits = CGAL::Arr_polyhedral_sgm_traits<Kernel, -1, 0>;
 #endif
 
-typedef CGAL::Arr_polyhedral_sgm<Gm_traits>                     Gm;
-typedef CGAL::Arr_polyhedral_sgm_polyhedron_3<Gm, Kernel>       Gm_polyhedron;
-typedef CGAL::Arr_polyhedral_sgm_initializer<Gm, Gm_polyhedron> Gm_initializer;
+using Gm = CGAL::Arr_polyhedral_sgm<Gm_traits>;
+using Gm_polyhedron = CGAL::Arr_polyhedral_sgm_polyhedron_3<Gm, Kernel>;
+using Gm_initializer = CGAL::Arr_polyhedral_sgm_initializer<Gm, Gm_polyhedron>;
 
-typedef CGAL::Arr_naive_point_location<Gm>              Naive_pl;
-typedef CGAL::Arr_walk_along_line_point_location<Gm>    Walk_pl;
-typedef CGAL::Arr_landmarks_point_location<Gm>          Landmarks_pl;
-typedef CGAL::Arr_trapezoid_ric_point_location<Gm>      Trap_pl;
+using Naive_pl = CGAL::Arr_naive_point_location<Gm>;
+using Walk_pl = CGAL::Arr_walk_along_line_point_location<Gm>;
+using Landmarks_pl = CGAL::Arr_landmarks_point_location<Gm>;
+using Trap_pl = CGAL::Arr_trapezoid_ric_point_location<Gm>;
 
-typedef Gm::Geometry_traits_2                           Geom_traits;
-typedef Geom_traits::Point_2                            Point_2;
+using Geom_traits = Gm::Geometry_traits_2;
+using Point_2 = Geom_traits::Point_2;
 
-typedef CGAL::Arr_point_location_result<Gm>             Point_location_result;
-typedef std::pair<Point_2, Point_location_result::Type> Query_result;
+using Point_location_result = CGAL::Arr_point_location_result<Gm>;
+using Query_result = std::pair<Point_2, Point_location_result::Type>;
 
-typedef Gm::Vertex_const_handle                 Vertex_const_handle;
-typedef Gm::Halfedge_const_handle               Halfedge_const_handle;
-typedef Gm::Face_const_handle                   Face_const_handle;
+using Vertex_const_handle = Gm::Vertex_const_handle;
+using Halfedge_const_handle = Gm::Halfedge_const_handle;
+using Face_const_handle = Gm::Face_const_handle;
 
 int main() {
   Gm_polyhedron p;
@@ -77,7 +77,7 @@ int main() {
   gm_initializer(p);
   if (! gm.is_valid()) return -1;
 
-  Geom_traits::Construct_point_2 ctr_point = traits.construct_point_2_object();
+  auto ctr_point = traits.construct_point_2_object();
   Point_2 points[] = {
     ctr_point(-1, 0, 0),
     ctr_point(0, -1, 0),
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_degenerate_sweep.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_degenerate_sweep.cpp
index 8c6f46dfeb61..62d7b46654c6 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_degenerate_sweep.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_degenerate_sweep.cpp
@@ -15,31 +15,30 @@
 
 #include "arr_print.h"
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel  Kernel;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
 
 #if 0
-typedef CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, -8, 6>  Geom_traits_2;
+using Geom_traits_2 = CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, -8, 6>;
 #elif 0
-typedef CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, -11, 7> Geom_traits_2;
+using Geom_traits_2 = CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, -11, 7>;
 #else
-typedef CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, -1, 0>  Geom_traits_2;
+using Geom_traits_2 = CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel, -1, 0>;
 #endif
 
-typedef Geom_traits_2::Point_2                             Point_2;
-typedef Geom_traits_2::X_monotone_curve_2                  X_monotone_curve_2;
-typedef CGAL::Arr_spherical_topology_traits_2<Geom_traits_2> Topol_traits_2;
-typedef CGAL::Arrangement_on_surface_2<Geom_traits_2, Topol_traits_2>
-                                                           Arrangement_2;
-typedef Arrangement_2::Vertex_handle                       Vertex_handle;
+using Point_2 = Geom_traits_2::Point_2;
+using X_monotone_curve_2 = Geom_traits_2::X_monotone_curve_2;
+using Topol_traits_2 = CGAL::Arr_spherical_topology_traits_2<Geom_traits_2>;
+using Arrangement_2 =
+  CGAL::Arrangement_on_surface_2<Geom_traits_2, Topol_traits_2>;
+using Vertex_handle = Arrangement_2::Vertex_handle;
 
 int main() {
   Geom_traits_2 traits;
-  Geom_traits_2::Construct_point_2 ctr_p = traits.construct_point_2_object();
-  Geom_traits_2::Construct_x_monotone_curve_2 ctr_xcv =
-    traits.construct_x_monotone_curve_2_object();
+  auto ctr_p = traits.construct_point_2_object();
+  auto ctr_xcv = traits.construct_x_monotone_curve_2_object();
 
-  std::vector< Point_2 > points;
-  std::vector< X_monotone_curve_2 > xcvs;
+  std::vector<Point_2> points;
+  std::vector<X_monotone_curve_2> xcvs;
 
   CGAL::IO::set_pretty_mode(std::cout);
 
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_insert.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_insert.cpp
index 783ef0a48f3e..e341758c75ec 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_insert.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_insert.cpp
@@ -10,12 +10,12 @@
 
 #include "arr_print.h"
 
-typedef CGAL::Exact_predicates_exact_constructions_kernel         Kernel;
-typedef CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel>         Geom_traits;
-typedef Geom_traits::Point_2                                      Point;
-typedef Geom_traits::Curve_2                                      Curve;
-typedef CGAL::Arr_spherical_topology_traits_2<Geom_traits>        Topol_traits;
-typedef CGAL::Arrangement_on_surface_2<Geom_traits, Topol_traits> Arrangement;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
+using Geom_traits = CGAL::Arr_geodesic_arc_on_sphere_traits_2<Kernel>;
+using Point = Geom_traits::Point_2;
+using Curve = Geom_traits::Curve_2;
+using Topol_traits = CGAL::Arr_spherical_topology_traits_2<Geom_traits>;
+using Arrangement = CGAL::Arrangement_on_surface_2<Geom_traits, Topol_traits>;
 
 int main() {
   // Construct the arrangement from 12 geodesic arcs.
@@ -46,7 +46,6 @@ int main() {
 
   CGAL::insert(arr, arcs.begin(), arcs.end());
   print_arrangement_size(arr);          // print the arrangement size
-  // print_arrangement(arr);
 
   return 0;
 }
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_overlay.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_overlay.cpp
index 2f5f6430dee9..ba27599b22d3 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_overlay.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/spherical_overlay.cpp
@@ -7,7 +7,7 @@
 
 #include "arr_geodesic_on_sphere.h"
 
-typedef CGAL::Arr_default_overlay_traits<Arrangement>         Overlay_traits;
+using Overlay_traits = CGAL::Arr_default_overlay_traits<Arrangement>;
 
 int main() {
   Geom_traits traits;
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/tracing_counting.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/tracing_counting.cpp
index 351e5c7e004f..100c8828e398 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/tracing_counting.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/tracing_counting.cpp
@@ -9,9 +9,9 @@
 
 #include "arr_exact_construction_segments.h"
 
-typedef CGAL::Arr_tracing_traits_2<Traits>              Tracing_traits;
-typedef CGAL::Arr_counting_traits_2<Tracing_traits>     Geom_traits;
-typedef CGAL::Arrangement_2<Geom_traits>                My_arrangement;
+using Tracing_traits = CGAL::Arr_tracing_traits_2<Traits>;
+using Geom_traits = CGAL::Arr_counting_traits_2<Tracing_traits>;
+using My_arrangement = CGAL::Arrangement_2<Geom_traits>;
 
 int main() {
   const Segment s1(Point(0, 0), Point(2, 2));
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
index 0b31dc9655bf..e870a714ccc1 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/unb_planar_vertical_decomposition.cpp
@@ -8,12 +8,12 @@
 
 #include "arr_linear.h"
 
-typedef std::variant<Vertex_const_handle, Halfedge_const_handle,
-                         Face_const_handle>              Cell_type;
-typedef std::optional<Cell_type>                       Vert_decomp_type;
-typedef std::pair<Vert_decomp_type, Vert_decomp_type>    Vert_decomp_pair;
-typedef std::pair<Vertex_const_handle, Vert_decomp_pair> Vert_decomp_entry;
-typedef std::list<Vert_decomp_entry>                     Vert_decomp_list;
+using Cell_type = std::variant<Vertex_const_handle, Halfedge_const_handle,
+                               Face_const_handle>;
+using Vert_decomp_type = std::optional<Cell_type>;
+using Vert_decomp_pair = std::pair<Vert_decomp_type, Vert_decomp_type>;
+using Vert_decomp_entry = std::pair<Vertex_const_handle, Vert_decomp_pair>;
+using Vert_decomp_list = std::list<Vert_decomp_entry>;
 
 int main() {
   // Construct the arrangement.
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/vertical_ray_shooting.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/vertical_ray_shooting.cpp
index a0b0912a6d63..e4e415bd8254 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/vertical_ray_shooting.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/vertical_ray_shooting.cpp
@@ -8,8 +8,8 @@
 #include "arr_inexact_construction_segments.h"
 #include "point_location_utils.h"
 
-typedef CGAL::Arr_walk_along_line_point_location<Arrangement> Walk_pl;
-typedef CGAL::Arr_trapezoid_ric_point_location<Arrangement>   Trap_pl;
+using Walk_pl = CGAL::Arr_walk_along_line_point_location<Arrangement>;
+using Trap_pl = CGAL::Arr_trapezoid_ric_point_location<Arrangement>;
 
 int main() {
   // Construct the arrangement.

From 51500440eaf5455335a6bf5f39b1e1e4902b1285 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 1 Nov 2023 18:13:11 +0200
Subject: [PATCH 0952/1398] Added missing 'conct' qualifier

---
 Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
index 6d89990e202c..a850f5ef3c88 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_conic_traits_2.h
@@ -141,15 +141,15 @@ class Arr_conic_traits_2 {
 
   /*! Obtain the rational kernel.
    */
-  Shared_rat_kernel rat_kernel() { return m_rat_kernel; }
+  Shared_rat_kernel rat_kernel() const { return m_rat_kernel; }
 
   /*! Obtain the algebraic kernel.
    */
-  Shared_alg_kernel alg_kernel() { return m_alg_kernel; }
+  Shared_alg_kernel alg_kernel() const { return m_alg_kernel; }
 
   /*! Obtain the nt traits.
    */
-  Shared_nt_traits nt_traits() { return m_nt_traits; }
+  Shared_nt_traits nt_traits() const { return m_nt_traits; }
 
   /*! Obtain the next conic index. */
   static size_t get_index() {

From 04cbb6ae794a076d28dcc0b9e91b023de69c4bfd Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 1 Nov 2023 18:21:06 +0200
Subject: [PATCH 0953/1398] Replaced CGAL timer with std (chrono)

---
 .../Arrangement_on_surface_2/predefined_kernel.cpp |  9 ++++-----
 .../predefined_kernel_non_intersecting.cpp         | 14 +++++++-------
 2 files changed, 11 insertions(+), 12 deletions(-)

diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel.cpp
index cca02d632103..f0ed969d845a 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel.cpp
@@ -3,9 +3,9 @@
 // predefined kernel with exact constructions and exact predicates.
 
 #include <list>
+#include <chrono>
 
 #include <CGAL/basic.h>
-#include <CGAL/Timer.h>
 
 #include "arr_exact_construction_segments.h"
 #include "arr_print.h"
@@ -28,18 +28,17 @@ int main (int argc, char* argv[]) {
 
   // Construct the arrangement by aggregately inserting all segments.
   Arrangement arr;
-  CGAL::Timer timer;
 
   std::cout << "Performing aggregated insertion of "
             << segments.size() << " segments.\n";
 
-  timer.start();
+  auto start = std::chrono::system_clock::now();
   insert(arr, segments.begin(), segments.end());
-  timer.stop();
+  std::chrono::duration<double> secs = std::chrono::system_clock::now() - start;
 
   print_arrangement_size(arr);
 
-  std::cout << "Construction took " << timer.time() << " seconds.\n";
+  std::cout << "Construction took " << secs.count() << " seconds.\n";
 
   return 0;
 }
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp
index e4474ae57678..0f91300cd605 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp
@@ -2,12 +2,13 @@
 // Constructing an arrangement of non-intersecting line segments using the
 // predefined kernel with exact predicates.
 
+#include <list>
+#include <fstream>
+#include <chrono>
+
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Arr_non_caching_segment_basic_traits_2.h>
 #include <CGAL/Arrangement_2.h>
-#include <CGAL/Timer.h>
-#include <list>
-#include <fstream>
 
 using Kernel = CGAL::Exact_predicates_inexact_constructions_kernel;
 using Number_type = Kernel::FT;
@@ -52,20 +53,19 @@ int main(int argc, char* argv[]) {
 
   // Construct the arrangement by aggregately inserting all segments.
   Arrangement_2 arr;
-  CGAL::Timer timer;
 
   std::cout << "Performing aggregated insertion of " << n << " segments.\n";
 
-  timer.start();
+  auto start = std::chrono::system_clock::now();
   insert_non_intersecting_curves (arr, segments.begin(), segments.end());
-  timer.stop();
+  std::chrono::duration<double> secs = std::chrono::system_clock::now() - start;
 
   // Print the arrangement dimensions.
   std::cout << "V = " << arr.number_of_vertices()
             << ", E = " << arr.number_of_edges()
             << ", F = " << arr.number_of_faces() << std::endl;
 
-  std::cout << "Construction took " << timer.time() << " seconds.\n";
+  std::cout << "Construction took " << secs.count() << " seconds.\n";
 
   return 0;
 }

From 7458d6adf316bf9b870ba4f053ad5a8b89b2c590 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 1 Nov 2023 19:12:25 +0200
Subject: [PATCH 0954/1398] used epec (and not epic)

---
 .../examples/Arrangement_on_surface_2/draw_arr.cpp            | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
index ea99cca39a85..df84f9727337 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/draw_arr.cpp
@@ -1,9 +1,9 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 #include <CGAL/Arrangement_2.h>
 #include <CGAL/Arr_segment_traits_2.h>
 #include <CGAL/draw_arrangement_2.h>
 
-using Kernel = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Kernel = CGAL::Exact_predicates_exact_constructions_kernel;
 using Traits = CGAL::Arr_segment_traits_2<Kernel>;
 using Point = Traits::Point_2;
 using Arrangement_2 = CGAL::Arrangement_2<Traits>;

From dda4bf84490757fb6fa9525e8588de0ac9e08942 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 1 Nov 2023 20:52:10 +0100
Subject: [PATCH 0955/1398] fix regression about MOC compilations

The commit b05e1e9e4604aa8663366f6f6aed416c215cce7e was indeed the
cause of the regression. But the root cause was an incorrect
usage of `qt6_generate_moc`.

The addition of `TARGET ${plugin_name}` triggered the use of the
property `INCLUDE_DIRECTORIES` of the target.

See https://doc.qt.io/qt-6/qt-generate-moc.html#arguments
---
 Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
index 6bdda967ab8b..2fd16a15c200 100644
--- a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
+++ b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
@@ -19,7 +19,7 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
       set(moc_file_name "")
     else()
       set(moc_file_name ${plugin_implementation_base_name}.moc )
-      qt6_generate_moc( ${plugin_implementation_base_name}.cpp "${CMAKE_CURRENT_BINARY_DIR}/${moc_file_name}" )
+      qt6_generate_moc( ${plugin_implementation_base_name}.cpp "${CMAKE_CURRENT_BINARY_DIR}/${moc_file_name}" TARGET ${plugin_name})
       add_file_dependencies( ${moc_file_name} "${CMAKE_CURRENT_SOURCE_DIR}/${plugin_implementation_base_name}.cpp" )
     endif()
 

From 980b04e09b4d98a7305a2dbb4aa1be3141a622eb Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 1 Nov 2023 21:17:19 +0100
Subject: [PATCH 0956/1398] fix the Arrangement demo

---
 .../demo/Arrangement_on_surface_2/CMakeLists.txt                | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt
index b1de5935340d..1ad374a61033 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/CMakeLists.txt
@@ -17,7 +17,7 @@ find_package(Qt6 QUIET COMPONENTS Widgets)
 
 if (CGAL_Qt6_FOUND AND Qt6_FOUND)
   add_compile_definitions(QT_NO_KEYWORDS)
-  include_directories( BEFORE ./ )
+  set(CMAKE_INCLUDE_CURRENT_DIR ON)
 
   # Arrangement package includes
   add_definitions(-DQT_NO_KEYWORDS)

From dea756ed0f77da3f1ebe7b756510e2b8fef8c6e6 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 1 Nov 2023 21:29:41 +0100
Subject: [PATCH 0957/1398] fix test/Installation on Windows

---
 Installation/test/Installation/CMakeLists.txt |  7 +--
 .../Installation/display_dll_version_info.cpp | 55 -------------------
 2 files changed, 1 insertion(+), 61 deletions(-)
 delete mode 100644 Installation/test/Installation/display_dll_version_info.cpp

diff --git a/Installation/test/Installation/CMakeLists.txt b/Installation/test/Installation/CMakeLists.txt
index cf090c2d39ad..183527601e32 100644
--- a/Installation/test/Installation/CMakeLists.txt
+++ b/Installation/test/Installation/CMakeLists.txt
@@ -48,13 +48,8 @@ endif()
 
 
 if(WIN32 OR CMAKE_SYSTEM_NAME STREQUAL Windows)
-  add_executable(display_dll_version_info display_dll_version_info.cpp)
-  target_link_libraries(display_dll_version_info PRIVATE version)
-  add_executable(test_gmp_mpfr_dll test_gmp_mpfr_dll.cpp)
+  create_single_source_cgal_program(test_gmp_mpfr_dll.cpp)
   target_link_libraries(test_gmp_mpfr_dll PRIVATE version)
-  use_CGAL_GMP_support(test_gmp_mpfr_dll)
-  CGAL_add_test(test_gmp_mpfr_dll)
-  add_to_cached_list( CGAL_EXECUTABLE_TARGETS test_gmp_mpfr_dll )
   string(RANDOM RDM_DIR)#5 random chars to avoid conflicts in parallel testsuites
   set(NON_STANDARD_INSTALL_PREFIX $ENV{TEMP}/${RDM_DIR})
 else()
diff --git a/Installation/test/Installation/display_dll_version_info.cpp b/Installation/test/Installation/display_dll_version_info.cpp
deleted file mode 100644
index ac826198f747..000000000000
--- a/Installation/test/Installation/display_dll_version_info.cpp
+++ /dev/null
@@ -1,55 +0,0 @@
-// This program is for MSVC only.
-#ifndef WIN32
-int main() {
-  return 0;
-}
-#else
-
-#include <iostream>
-#include <cassert>
-#include <windows.h>
-
-bool get_version_info(const char* fileName,
-                      int& major,
-                      int& minor,
-                      int& patch,
-                      int& build)
-{
-  std::cout << "Query FileVersion of \"" << fileName << "\"\n";
-  DWORD handle = 0;
-  DWORD size = GetFileVersionInfoSize(fileName, &handle);
-  BYTE* versionInfo = new BYTE[size];
-  if (!GetFileVersionInfo(fileName, handle, size, versionInfo))
-  {
-    delete[] versionInfo;
-    return false;
-  }
-  // we have version information
-  UINT len = 0;
-  VS_FIXEDFILEINFO*   vsfi = NULL;
-  VerQueryValue(versionInfo, "\\", (void**)&vsfi, &len);
-  major = HIWORD(vsfi->dwFileVersionMS);
-  minor = LOWORD(vsfi->dwFileVersionMS);
-  patch = HIWORD(vsfi->dwFileVersionLS);
-  build = LOWORD(vsfi->dwFileVersionLS);
-  delete[] versionInfo;
-  return true;
-}
-
-int main(int argc, char** argv) {
-  if(argc == 2) {
-    int major, minor, patch, build;
-    bool result = get_version_info(argv[1], major, minor, patch, build);
-    assert(result);
-    std::cout << "version "
-              << major << "."
-              << minor << "."
-              << patch << "."
-              << build << "\n";
-  } else {
-    std::cerr << "Usage:\n"
-              << "  display_dll_version_info /path/to/a.dll\n";
-  }
-  return 0;
-}
-#endif

From f76161be3c8a8f53f5fa327cad286146c183ee1a Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 2 Nov 2023 09:27:27 +0100
Subject: [PATCH 0958/1398] store squared min_size instead of min_size

---
 Mesh_3/include/CGAL/Mesh_facet_criteria_3.h | 13 +++++--------
 1 file changed, 5 insertions(+), 8 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
index 927083511ed1..1ddf10fc4d66 100644
--- a/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_facet_criteria_3.h
@@ -133,12 +133,12 @@ class Mesh_facet_criteria_3
                         const DistanceField& distance_bound,
                         const Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE,
                         const FT& min_radius_bound = 0.)
-    : min_radius_bound_(std::nullopt)
+    : squared_min_radius_bound_(std::nullopt)
   {
     if (FT(0) != min_radius_bound)
     {
       init_min_radius(min_radius_bound);
-      min_radius_bound_ = min_radius_bound;
+      squared_min_radius_bound_ = CGAL::square(min_radius_bound);
     }
 
     if ( FT(0) != angle_bound )
@@ -179,12 +179,9 @@ class Mesh_facet_criteria_3
     return topology_;
   }
 
-  std::optional<FT> min_radius_bound() const {
-    return min_radius_bound_;
-  }
   std::optional<FT> squared_min_radius_bound() const {
-    if(min_radius_bound_)
-      return CGAL::square(*min_radius_bound_);
+    if(squared_min_radius_bound_)
+      return *squared_min_radius_bound_;
     else
       return std::nullopt;
   }
@@ -258,7 +255,7 @@ class Mesh_facet_criteria_3
 private:
   Criteria criteria_;
   Mesh_facet_topology topology_;
-  std::optional<FT> min_radius_bound_;
+  std::optional<FT> squared_min_radius_bound_;
 };  // end class Mesh_facet_criteria_3
 
 }  // end namespace CGAL

From 18c6d238eed6a662400d1fa08a5dd65a9e366be5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 2 Nov 2023 11:14:21 +0100
Subject: [PATCH 0959/1398] Do not rely on OpenNL's linear solver

---
 .../LSCM_parameterizer_3.h                    | 222 +++++++++---------
 1 file changed, 115 insertions(+), 107 deletions(-)

diff --git a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
index 2dcaab67b804..dae714391435 100644
--- a/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
+++ b/Surface_mesh_parameterization/include/CGAL/Surface_mesh_parameterization/LSCM_parameterizer_3.h
@@ -29,7 +29,6 @@
 #ifdef CGAL_EIGEN3_ENABLED
 #include <CGAL/Eigen_solver_traits.h>
 #endif
-#include <CGAL/OpenNL/linear_solver.h>
 
 #include <boost/iterator/function_output_iterator.hpp>
 
@@ -100,9 +99,6 @@ class LSCM_parameterizer_3
   typedef typename Default::Get<
     SolverTraits_,
   #if defined(CGAL_EIGEN3_ENABLED)
-    // WARNING: at the moment, the choice of SolverTraits_ is completely
-    // ignored (see LeastSquaresSolver typedef) and `OpenNL::LinearSolver<SolverTraits_>`
-    // is always used...
     CGAL::Eigen_solver_traits<
             Eigen::SimplicialLDLT<Eigen_sparse_symmetric_matrix<double>::EigenType> >
   #else
@@ -143,7 +139,13 @@ class LSCM_parameterizer_3
   typedef typename Solver_traits::Vector                            Vector;
   typedef typename Solver_traits::Matrix                            Matrix;
 
-  typedef typename OpenNL::LinearSolver<Solver_traits>              LeastSquaresSolver;
+// Fields
+private:
+  // %Object that maps (at least two) border vertices onto a 2D space
+  Border_parameterizer m_borderParameterizer;
+
+  // Traits object to solve a sparse linear system
+  Solver_traits m_linearAlgebra;
 
 // Public operations
 public:
@@ -157,6 +159,15 @@ class LSCM_parameterizer_3
 
   // Default copy constructor and operator =() are fine
 
+// Private accessors
+private:
+  // Get the object that maps the surface's border onto a 2D space.
+  Border_parameterizer& get_border_parameterizer() { return m_borderParameterizer; }
+
+  // Get the sparse linear algebra (traits object to access the linear system).
+  Solver_traits& get_linear_algebra_traits() { return m_linearAlgebra; }
+
+public:
   /// returns whether the 3D -> 2D mapping is one-to-one.
   template <typename VertexUVMap>
   bool is_one_to_one_mapping(const Triangle_mesh& mesh,
@@ -220,88 +231,59 @@ class LSCM_parameterizer_3
 
     // Compute (u,v) for (at least two) border vertices
     // and mark them as "parameterized"
-    Error_code status =
-        get_border_parameterizer().parameterize(mesh, bhd, uvmap, vimap, vpmap);
+    Error_code status = get_border_parameterizer().parameterize(mesh, bhd, uvmap, vimap, vpmap);
 
     if(status != OK)
       return status;
 
-    // Create sparse linear system "A*X = B" of size 2*nbVertices x 2*nbVertices
-    // (in fact, we need only 2 lines per triangle x 1 column per vertex)
-    LeastSquaresSolver solver(2 * nbVertices);
-    solver.set_least_squares(true) ;
-
-    // Initialize the "A*X = B" linear system after
-    // (at least two) border vertices parameterization
-    initialize_system_from_mesh_border(solver, ccvertices, uvmap, vimap, vpmap);
+    // Vertices that are already parameterized are not part of the system
+    std::vector<int> fvi(nbVertices); // vimap to free vertex index
+    int index = 0;
+    for(vertex_descriptor vd : ccvertices) {
+      if(get(vpmap,vd)) {
+        fvi[get(vimap, vd)] = -1;
+      } else {
+        fvi[get(vimap, vd)] = index++;
+      }
+    }
 
-    // Fill the matrix for the other vertices
-    solver.begin_system();
+    // Create sparse linear system "A*X = B"
+    int nbFreeVertices = index;
+    int nbVariables = 2 * nbFreeVertices;
+    Matrix A(nbVariables, nbVariables); // the constant matrix used in the linear system A*X = B
+    Vector X(nbVariables), B(nbVariables);
 
     for(face_descriptor fd : ccfaces) {
       // Create two lines in the linear system per triangle (one for u, one for v)
-      status = setup_triangle_relations(solver, mesh, fd, vimap);
+      status = setup_triangle_relations(mesh, fd, uvmap, vimap, vpmap, fvi, A, B);
       if (status != OK)
         return status;
     }
 
-    solver.end_system();
-
     // Solve the "A*X = B" linear system in the least squares sense
-    if(!solver.solve())
+    double D;
+    if(!get_linear_algebra_traits().linear_solver(A, B, X, D)) {
+      std::cerr << "Could not solve linear system" << std::endl;
       status = ERROR_CANNOT_SOLVE_LINEAR_SYSTEM;
-
-    if(status != OK)
       return status;
+    }
 
     // Copy X coordinates into the (u,v) pair of each vertex
-    //set_mesh_uv_from_system(mesh, solver, uvmap);
-
     for(vertex_descriptor vd : ccvertices) {
+      if(get(vpmap,vd))
+        continue;
+
       int index = get(vimap,vd);
-      NT u = solver.variable(2 * index).value();
-      NT v = solver.variable(2 * index + 1).value();
+      NT u = X[2 * fvi[index]];
+      NT v = X[2 * fvi[index] + 1];
       put(uvmap, vd, Point_2(u,v));
     }
+
     return status;
   }
 
 // Private operations
 private:
-  // Initialize "A*X = B" linear system after
-  // (at least two) border vertices are parameterized.
-  //
-  // \pre Vertices must be indexed.
-  // \pre X and B must be allocated and empty.
-  // \pre At least 2 border vertices must be parameterized.
-  template <typename UVmap, typename VertexIndexMap, typename VertexParameterizedMap>
-  void initialize_system_from_mesh_border(LeastSquaresSolver& solver,
-                                          const std::unordered_set<vertex_descriptor>& ccvertices,
-                                          UVmap uvmap,
-                                          VertexIndexMap vimap,
-                                          VertexParameterizedMap vpmap) const
-  {
-    for(vertex_descriptor v : ccvertices) {
-      // Get vertex index in sparse linear system
-      int index = get(vimap, v);
-
-      // Get vertex (u,v) (meaningless if vertex is not parameterized)
-      const Point_2& uv = get(uvmap, v);
-      // TODO: it is meaningless but must it be called for non-border vertices??
-      // Write (u,v) in X (meaningless if vertex is not parameterized)
-      // Note  : 2*index     --> u
-      //         2*index + 1 --> v
-      solver.variable(2 * index    ).set_value(uv.x());
-      solver.variable(2 * index + 1).set_value(uv.y());
-
-      // Copy (u,v) in B if vertex is parameterized
-      if (get(vpmap,v)) {
-        solver.variable(2 * index    ).lock();
-        solver.variable(2 * index + 1).lock();
-      }
-    }
-  }
-
   // Utility for setup_triangle_relations():
   // Computes the coordinates of the vertices of a triangle
   // in a local 2D orthonormal basis of the triangle's plane.
@@ -344,11 +326,18 @@ class LSCM_parameterizer_3
   //       Zk = xk + i.yk is the complex number corresponding to local (x,y) coords
   // cool: no divide with this expression; makes it more numerically stable
   // in presence of degenerate triangles
-  template <typename VertexIndexMap >
-  Error_code setup_triangle_relations(LeastSquaresSolver& solver,
-                                      const Triangle_mesh& mesh,
+  template <typename UVmap,
+            typename VertexIndexMap,
+            typename VertexParameterizedMap,
+            typename FreeVertexIndices>
+  Error_code setup_triangle_relations(const Triangle_mesh& mesh,
                                       face_descriptor facet,
-                                      VertexIndexMap vimap) const
+                                      UVmap uvmap,
+                                      VertexIndexMap vimap,
+                                      VertexParameterizedMap vpmap,
+                                      const FreeVertexIndices& fvi,
+                                      Matrix& A,
+                                      Vector& B) const
   {
     const PPM ppmap = get(vertex_point, mesh);
 
@@ -361,11 +350,6 @@ class LSCM_parameterizer_3
     halfedge_descriptor h2 = next(h1, mesh);
     v2 = target(h2, mesh);
 
-    // Get the vertices index
-    int id0 = get(vimap, v0);
-    int id1 = get(vimap, v1);
-    int id2 = get(vimap, v2);
-
     // Get the vertices position
     const Point_3& p0 = get(ppmap, v0);
     const Point_3& p1 = get(ppmap, v1);
@@ -392,51 +376,75 @@ class LSCM_parameterizer_3
     //
     // Note  : 2*index     --> u
     //         2*index + 1 --> v
-    int u0_id = 2*id0    ;
-    int v0_id = 2*id0 + 1;
-    int u1_id = 2*id1    ;
-    int v1_id = 2*id1 + 1;
-    int u2_id = 2*id2    ;
-    int v2_id = 2*id2 + 1;
+
+    std::vector<double> vals;
+    std::vector<unsigned int> ids;
+    std::vector<double> fvals;
+    std::vector<double> pvals;
+
+    auto add_coefficient = [&](const vertex_descriptor v, const double a, const bool is_u)
+    {
+      if(get(vpmap, v)) {
+        const Point_2& uv = get(uvmap, v);
+        fvals.push_back(a);
+        pvals.push_back(is_u ? uv.x() : uv.y());
+      } else {
+        const int index = 2 * fvi[get(vimap, v)] + !is_u;
+        CGAL_assertion(index >= 0);
+        vals.push_back(a);
+        ids.push_back(index);
+      }
+    };
+
+    auto add_u_coefficient = [&](const vertex_descriptor v, const double a) {
+      return add_coefficient(v, a, true /*is u*/);
+    };
+    auto add_v_coefficient = [&](const vertex_descriptor v, const double a) {
+      return add_coefficient(v, a, false /*is not u*/);
+    };
+
+    auto accumulate = [&]()
+    {
+      const std::size_t nf = vals.size();
+      const std::size_t nl = fvals.size();
+
+      for(std::size_t i=0; i<nf; ++i)
+        for(std::size_t j=0; j<nf; ++j)
+          A.add_coef(ids[i], ids[j], vals[i] * vals[j]);
+
+      double s = 0.;
+      for(std::size_t i=0; i<nl; ++i)
+        s += fvals[i] * pvals[i];
+
+      for(std::size_t i=0; i<nf; ++i)
+        B[ids[i]] -= vals[i] * s;
+
+      vals.clear();
+      ids.clear();
+      fvals.clear();
+      pvals.clear();
+    };
 
     // Real part
     // Note: b = 0
-    solver.begin_row();
-    solver.add_coefficient(u0_id, -a+c);
-    solver.add_coefficient(v0_id,  b-d);
-    solver.add_coefficient(u1_id,   -c);
-    solver.add_coefficient(v1_id,    d);
-    solver.add_coefficient(u2_id,    a);
-    solver.end_row();
-    //
+    add_u_coefficient(v0, -a+c);
+    add_v_coefficient(v0,  b-d);
+    add_u_coefficient(v1, -c);
+    add_v_coefficient(v1,  d);
+    add_u_coefficient(v2,  a);
+    accumulate();
+
     // Imaginary part
     // Note: b = 0
-    solver.begin_row();
-    solver.add_coefficient(u0_id, -b+d);
-    solver.add_coefficient(v0_id, -a+c);
-    solver.add_coefficient(u1_id,   -d);
-    solver.add_coefficient(v1_id,   -c);
-    solver.add_coefficient(v2_id,    a);
-    solver.end_row();
+    add_u_coefficient(v0, -b+d);
+    add_v_coefficient(v0, -a+c);
+    add_u_coefficient(v1, -d);
+    add_v_coefficient(v1, -c);
+    add_v_coefficient(v2,  a);
+    accumulate();
 
     return OK;
   }
-
-// Private accessors
-private:
-  // Get the object that maps the surface's border onto a 2D space.
-  Border_parameterizer& get_border_parameterizer() { return m_borderParameterizer; }
-
-  // Get the sparse linear algebra (traits object to access the linear system).
-  Solver_traits& get_linear_algebra_traits() { return m_linearAlgebra; }
-
-// Fields
-private:
-  // %Object that maps (at least two) border vertices onto a 2D space
-  Border_parameterizer m_borderParameterizer;
-
-  // Traits object to solve a sparse linear system
-  Solver_traits m_linearAlgebra;
 };
 
 } // namespace Surface_mesh_parameterization

From a77d8b36d1da687670f812ae8ce891d287dea16d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 2 Nov 2023 12:21:07 +0100
Subject: [PATCH 0960/1398] cleanup

---
 .../doc/resources/1.8.13/BaseDoxyfile.in      |   2 -
 OpenNL/include/CGAL/OpenNL/linear_solver.h    | 291 ------------------
 OpenNL/package_info/OpenNL/dependencies       |   0
 OpenNL/package_info/OpenNL/description.txt    |   1 -
 OpenNL/package_info/OpenNL/license.txt        |   1 -
 .../package_info/OpenNL/long_description.txt  |  23 --
 OpenNL/package_info/OpenNL/maintainer         |   1 -
 .../dependencies                              |   1 -
 8 files changed, 320 deletions(-)
 delete mode 100644 OpenNL/include/CGAL/OpenNL/linear_solver.h
 delete mode 100644 OpenNL/package_info/OpenNL/dependencies
 delete mode 100644 OpenNL/package_info/OpenNL/description.txt
 delete mode 100644 OpenNL/package_info/OpenNL/license.txt
 delete mode 100644 OpenNL/package_info/OpenNL/long_description.txt
 delete mode 100644 OpenNL/package_info/OpenNL/maintainer

diff --git a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
index 91112fc97809..58d604b35c9d 100644
--- a/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.8.13/BaseDoxyfile.in
@@ -106,7 +106,6 @@ ALIASES                = "cgal=%CGAL" \
                          "taucs=TAUCS" \
                          "lapack=LAPACK" \
                          "blas=BLAS" \
-                         "opennl=OpenNL" \
                          "cpp=C++" \
                          "cpp11=C++11" \
                          "CC=C++" \
@@ -768,4 +767,3 @@ DIRECTORY_GRAPH        = NO
 # This tag requires that the tag HAVE_DOT is set to YES.
 
 INTERACTIVE_SVG        = YES
-
diff --git a/OpenNL/include/CGAL/OpenNL/linear_solver.h b/OpenNL/include/CGAL/OpenNL/linear_solver.h
deleted file mode 100644
index 47a52dfecebf..000000000000
--- a/OpenNL/include/CGAL/OpenNL/linear_solver.h
+++ /dev/null
@@ -1,291 +0,0 @@
-// Copyright (c) 2005-2008  Inria Loria (France).
-/*
- * author:  Bruno Levy, INRIA, project ALICE
- * website: https://www.loria.fr/~levy/software
- *
- * This file is part of CGAL (www.cgal.org)
- *
- * Scientific work that use this software can reference the website and
- * the following publication:
- *
- * @INPROCEEDINGS {levy:NMDGP:05,
- *    AUTHOR = Bruno Levy,
- *    TITLE  = Numerical Methods for Digital Geometry Processing,
- *    BOOKTITLE =Israel Korea Bi-National Conference,
- *    YEAR=November 2005,
- *    URL=https://www.loria.fr/~levy/php/article.php?pub=../publications/papers/2005/Numerics
- * }
- *
- *  Laurent Saboret 2005-2006: Changes for CGAL:
- *      - Added OpenNL namespace
- *      - DefaultLinearSolverTraits is now a model of the SparseLinearAlgebraTraits_d concept
- *      - Added SymmetricLinearSolverTraits
- *      - copied Jacobi preconditioner from Graphite 1.9 code
- *
- * $URL$
- * $Id$
- * SPDX-License-Identifier: LGPL-3.0-or-later
- */
-
-
-#ifndef __OPENNL_LINEAR_SOLVER__
-#define __OPENNL_LINEAR_SOLVER__
-
-#include <vector>
-#include <iostream>
-#include <cstdlib>
-
-#include <CGAL/use.h>
-
-namespace OpenNL {
-
-
-
-
-/*
- * Solves a linear system or minimizes a quadratic form.
- *
- * Requirements for its traits class: must be a model of SparseLinearSolverTraits_d concept
- */
-template <class TRAITS>
-class LinearSolver
-{
-protected:
-    enum State {
-        INITIAL, IN_SYSTEM, IN_ROW, CONSTRUCTED, SOLVED
-    } ;
-
-public:
-    typedef TRAITS Traits ;
-    typedef typename Traits::Matrix Matrix ;
-    typedef typename Traits::Vector Vector ;
-    typedef typename Traits::NT CoeffType ;
-
-    class Variable {
-    public:
-        Variable() : x_(0), index_(-1), locked_(false) { }
-        double value() const { return x_; }
-        void set_value(double x_in) { x_ = x_in ; }
-        void lock()   { locked_ = true ; }
-        void unlock() { locked_ = false ; }
-        bool is_locked() const { return locked_ ; }
-        unsigned int index() const {
-            CGAL_assertion(index_ != -1) ;
-            return (unsigned int)(index_) ;
-        }
-        void set_index(unsigned int index_in) {
-            index_ = index_in ;
-        }
-    private:
-        CoeffType x_ ;
-        int index_ ;
-        bool locked_ ;
-    }  ;
-
-
-    LinearSolver(unsigned int nb_variables) {
-        state_ = INITIAL ;
-        least_squares_ = false ;
-        nb_variables_ = nb_variables ;
-        variable_ = new Variable[nb_variables] ;
-        A_ = nullptr ;
-        x_ = nullptr ;
-        b_ = nullptr ;
-    }
-
-    ~LinearSolver() {
-        delete[] variable_ ;
-        delete A_ ;
-        delete x_ ;
-        delete b_ ;
-    }
-
-    // __________________ Parameters ________________________
-
-    void set_least_squares(bool x) { least_squares_ = x ; }
-
-    // __________________ Access ____________________________
-
-    int nb_variables() const { return nb_variables_ ; }
-
-    Variable& variable(unsigned int idx) {
-        CGAL_assertion(idx < nb_variables_) ;
-        return variable_[idx] ;
-    }
-
-    const Variable& variable(unsigned int idx) const {
-        CGAL_assertion(idx < nb_variables_) ;
-        return variable_[idx] ;
-    }
-
-    // _________________ Construction _______________________
-
-    void begin_system() {
-        current_row_ = 0 ;
-        transition(INITIAL, IN_SYSTEM) ;
-        // Enumerate free variables.
-        unsigned int index = 0 ;
-        for(int ii=0; ii < nb_variables() ; ii++) {
-            Variable& v = variable(ii) ;
-            if(!v.is_locked()) {
-                v.set_index(index) ;
-                index++ ;
-            }
-        }
-        unsigned int n = index ;
-        A_ = new Matrix(static_cast<int>(n)) ;
-        x_ = new Vector(n) ;
-        b_ = new Vector(n) ;
-        for(unsigned int i=0; i<n; i++) {
-            (*x_)[i] = 0 ;
-            (*b_)[i] = 0 ;
-        }
-        variables_to_vector() ;
-    }
-
-    void begin_row() {
-        transition(IN_SYSTEM, IN_ROW) ;
-        af_.clear() ;
-        if_.clear() ;
-        al_.clear() ;
-        xl_.clear() ;
-        bk_ = 0 ;
-    }
-
-    void add_coefficient(unsigned int iv, double a) {
-        check_state(IN_ROW) ;
-        Variable& v = variable(iv) ;
-        if(v.is_locked()) {
-            al_.push_back(a) ;
-            xl_.push_back(v.value()) ;
-        } else {
-            af_.push_back(a) ;
-            if_.push_back(v.index()) ;
-        }
-    }
-
-
-    void end_row() {
-        if(least_squares_) {
-            std::size_t nf = af_.size() ;
-            std::size_t nl = al_.size() ;
-            for(std::size_t i=0; i<nf; i++) {
-                for(std::size_t j=0; j<nf; j++) {
-                    A_->add_coef(if_[i], if_[j], af_[i] * af_[j]) ;
-                }
-            }
-            CoeffType S = - bk_ ;
-            for(std::size_t j=0; j<nl; j++) {
-                S += al_[j] * xl_[j] ;
-            }
-            for(std::size_t i=0; i<nf; i++) {
-                (*b_)[if_[i]] -= af_[i] * S ;
-            }
-        } else {
-            std::size_t nf = af_.size() ;
-            std::size_t nl = al_.size() ;
-            for(std::size_t i=0; i<nf; i++) {
-                A_->add_coef(current_row_, if_[i], af_[i]) ;
-            }
-            (*b_)[current_row_] = bk_ ;
-            for(std::size_t i=0; i<nl; i++) {
-                (*b_)[current_row_] -= al_[i] * xl_[i] ;
-            }
-        }
-        current_row_++ ;
-        transition(IN_ROW, IN_SYSTEM) ;
-    }
-
-    void end_system() {
-        transition(IN_SYSTEM, CONSTRUCTED) ;
-    }
-
-    // ----------------------------- Solver -------------------------------
-
-    // Solves a linear system or minimizes a quadratic form.
-    // Return true on success.
-    // (modified for SparseLinearAlgebraTraits_d concept)
-    bool solve()
-    {
-        check_state(CONSTRUCTED) ;
-
-        // Solve the sparse linear system "A*X = B". On success, the solution is (1/D) * X.
-        Traits solver_traits;
-        CoeffType D;
-        bool success = solver_traits.linear_solver(*A_, *b_, *x_, D) ;
-        CGAL_assertion(D == 1.0);   // WARNING: this library does not support homogeneous coordinates!
-
-        vector_to_variables() ;
-
-        transition(CONSTRUCTED, SOLVED) ;
-
-        delete A_ ; A_ = nullptr ;
-        delete b_ ; b_ = nullptr ;
-        delete x_ ; x_ = nullptr ;
-
-        return success;
-    }
-
-protected:
-
-    // ----------- Converting between user representation and the internal representation -----
-
-    void vector_to_variables() {
-        for(int ii=0; ii < nb_variables(); ii++) {
-            Variable& v = variable(ii) ;
-            if(!v.is_locked()) {
-                v.set_value( (*x_)[v.index()] ) ;
-            }
-        }
-    }
-
-    void variables_to_vector() {
-        for(int ii=0; ii < nb_variables(); ii++) {
-            Variable& v = variable(ii) ;
-            if(!v.is_locked()) {
-                (*x_)[v.index()] = v.value() ;
-            }
-        }
-    }
-
-    // ----------- Finite state automaton (checks that calling sequence is respected) ---------
-
-    void check_state(State s) {
-            CGAL_USE(s);
-            CGAL_assertion(state_ == s) ;
-    }
-
-    void transition(State from, State to) {
-            check_state(from) ;
-            state_ = to ;
-    }
-
-private:
-
-    // --------------- parameters --------------------------
-    bool least_squares_ ;
-
-    // --------------- user representation --------------
-    unsigned int nb_variables_ ;
-    Variable* variable_ ;
-
-    // --------------- construction -----------------------
-    State state_ ;
-    unsigned int current_row_ ;
-    std::vector<CoeffType> af_ ;
-    std::vector<unsigned int> if_ ;
-    std::vector<CoeffType> al_ ;
-    std::vector<CoeffType> xl_ ;
-    double bk_ ;
-
-    // --------------- internal representation ---------
-    Matrix* A_ ;
-    Vector* x_ ;
-    Vector* b_ ;
-
-} ;
-
-
-} // namespace OpenNL
-
-#endif
diff --git a/OpenNL/package_info/OpenNL/dependencies b/OpenNL/package_info/OpenNL/dependencies
deleted file mode 100644
index e69de29bb2d1..000000000000
diff --git a/OpenNL/package_info/OpenNL/description.txt b/OpenNL/package_info/OpenNL/description.txt
deleted file mode 100644
index a04c250612ca..000000000000
--- a/OpenNL/package_info/OpenNL/description.txt
+++ /dev/null
@@ -1 +0,0 @@
-OpenNL (Open Numerical Library) is a library to easily construct and solve sparse linear systems.
diff --git a/OpenNL/package_info/OpenNL/license.txt b/OpenNL/package_info/OpenNL/license.txt
deleted file mode 100644
index 5c1c5d8436f8..000000000000
--- a/OpenNL/package_info/OpenNL/license.txt
+++ /dev/null
@@ -1 +0,0 @@
-LGPL (v3 or later)
diff --git a/OpenNL/package_info/OpenNL/long_description.txt b/OpenNL/package_info/OpenNL/long_description.txt
deleted file mode 100644
index 645de7254ee2..000000000000
--- a/OpenNL/package_info/OpenNL/long_description.txt
+++ /dev/null
@@ -1,23 +0,0 @@
-
-   --------------------- Open Numerical Library <T> -------------------------
-
-General information
-===================
-
-This is OpenNL<T>, a library to easily construct and solve sparse linear systems.
-
-* OpenNL<T> is supplied with a set of built-in iterative solvers
-   (Conjugate gradient and BICGSTAB)
-
-* OpenNL can also use other solvers (by writing a SolverTraits class)
-
-Contact
-=======
-
-The author is Bruno Levy <bruno.levy@loria.fr>.
-OpenNL main page is https://www.loria.fr/~levy/software/.
-
-Caution
-=======
-
-CGAL includes a version of OpenNL in C++, made especially for CGAL by Bruno Levy.
diff --git a/OpenNL/package_info/OpenNL/maintainer b/OpenNL/package_info/OpenNL/maintainer
deleted file mode 100644
index b4c1056278b5..000000000000
--- a/OpenNL/package_info/OpenNL/maintainer
+++ /dev/null
@@ -1 +0,0 @@
-Bruno Levy <Bruno.Levy@loria.fr>
diff --git a/Surface_mesh_parameterization/package_info/Surface_mesh_parameterization/dependencies b/Surface_mesh_parameterization/package_info/Surface_mesh_parameterization/dependencies
index e21fc4d23192..19c7b2f79832 100644
--- a/Surface_mesh_parameterization/package_info/Surface_mesh_parameterization/dependencies
+++ b/Surface_mesh_parameterization/package_info/Surface_mesh_parameterization/dependencies
@@ -15,7 +15,6 @@ Interval_support
 Kernel_23
 Modular_arithmetic
 Number_types
-OpenNL
 Polygon_mesh_processing
 Profiling_tools
 Property_map

From da1fd6ee5bfcfa4c0d844ce5dd1be6b322d88867 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 2 Nov 2023 12:40:10 +0100
Subject: [PATCH 0961/1398] Remove very old test platforms, revealed bry grep
 OpenNL

---
 .../reference-platforms/boostrap              |    8 -
 .../reference-platforms/common-setup          |   18 -
 .../CMakeCache.txt                            | 1532 ------------
 .../setup                                     |    4 -
 .../CMakeCache.txt                            | 2092 ----------------
 .../setup                                     |    4 -
 .../CMakeCache.txt                            | 2092 ----------------
 .../setup                                     |    6 -
 .../CMakeCache.txt                            | 2092 ----------------
 .../i686_Linux-2.6_g++-4.1.2_CentOS-5.1/setup |    4 -
 .../CMakeCache.txt                            | 1535 ------------
 .../setup                                     |    5 -
 .../CMakeCache.txt                            | 1535 ------------
 .../setup                                     |    5 -
 .../CMakeCache.txt                            | 1535 ------------
 .../i686_Linux-2.6_g++-4.3.3_CentOS-5.1/setup |    5 -
 .../CMakeCache.txt                            | 2100 -----------------
 .../setup                                     |    5 -
 18 files changed, 14577 deletions(-)
 delete mode 100755 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/boostrap
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/common-setup
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/setup
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/setup
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/setup
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/setup
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/setup
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/setup
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/setup
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/setup

diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/boostrap b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/boostrap
deleted file mode 100755
index 9c3aa3a2b3ac..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/boostrap
+++ /dev/null
@@ -1,8 +0,0 @@
-#!/bin/sh
-
-rm -rf CMakeCache.txt
-rm -rf CMakeFiles/
-
-. ./setup
-
-cmake ~/CGAL/releases-and-testsuites-with-cmake/CGAL-I -DWITH_examples=OFF -DCMAKE_CXX_FLAGS_DEBUG:STRING="" -DCMAKE_BUILD_TYPE:STRING=Debug
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/common-setup b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/common-setup
deleted file mode 100644
index 7d99248d5b42..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/common-setup
+++ /dev/null
@@ -1,18 +0,0 @@
-export QTDIR=/usr/lib/qt-3.3
-
-source /home/lrineau/CGAL/RS-3.1/setup-rs
-
-PATH=/usr/local/packages/qt4.7/bin:$PATH
-PATH=$HOME/CGAL/path-cmake-2.6:$PATH
-
-export PATH
-
-LD_LIBRARY_PATH=/usr/local/packages/qt4.7/lib:$LD_LIBRARY_PATH
-
-export LD_LIBRARY_PATH
-
-ESBTL_INC_DIR=$HOME/CGAL/esbtl/trunk/include
-export ESBTL_INC_DIR
-
-EIGEN3_INC_DIR=/usr/local/Eigen-3.2.1
-export EIGEN3_INC_DIR
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/CMakeCache.txt b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/CMakeCache.txt
deleted file mode 100644
index b06f3a84dc35..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/CMakeCache.txt
+++ /dev/null
@@ -1,1532 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIRS:FILEPATH=/usr/lib
-
-//The Boost THREAD library
-Boost_THREAD_LIBRARY:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Path to a library.
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=Boost_THREAD_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/src/CGALCore
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-Ic-92
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/src/CGALimageIO
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;/usr/lib/libz.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALimageIO
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/src/CGALQt
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/qt-3.3/lib/libqassistantclient.a;general;/usr/lib/qt-3.3/lib/libqt-mt.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;dl;general;-lpthread;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALQt
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/src/CGALQt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;general;-lGLU -lGL;optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so;general;/usr/lib/libpng.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libXrender.so;general;/usr/lib/libfreetype.so;general;/usr/lib/libfontconfig.so;general;/usr/lib/libXext.so;general;/usr/lib/libX11.so;general;/usr/lib/libm.so;optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so;general;/usr/lib/libz.so;general;/lib/libgthread-2.0.so;general;/lib/libglib-2.0.so;general;/usr/lib/librt.so;general;-lpthread;general;-ldl;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALQt4
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//No help, variable specified on the command line.
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/bin/g++34
-
-//Flags used by the compiler during all build types.
-CMAKE_CXX_FLAGS:STRING='-Wall -m32 -O2 '
-
-//No help, variable specified on the command line.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/bin/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/uic
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=QT_DBUSCPP2XML_EXECUTABLE-NOTFOUND
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=QT_DBUSXML2CPP_EXECUTABLE-NOTFOUND
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/local/packages/qt4.7/doc
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/lib/libglib-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/lib/libgthread-2.0.so
-
-QT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include
-
-//Qt library dir
-QT_LIBRARY_DIR:PATH=/usr/local/packages/qt4.7/lib
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=QT_LRELEASE_EXECUTABLE-NOTFOUND
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=QT_LUPDATE_EXECUTABLE-NOTFOUND
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/local/packages/qt4.7/mkspecs
-
-//The moc executable
-QT_MOC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/moc
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libphonon.so;debug;/usr/local/packages/qt4.7/lib/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libphonon.so
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/local/packages/qt4.7/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib/libpng.so
-
-//Path to a program.
-QT_QMAKE_EXECUTABLE:FILEPATH=/home/local/packages/qt4.7/bin/qmake
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQt3Support.so;debug;/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=QT_QT3SUPPORT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=QT_QTASSISTANTCLIENT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=QT_QTASSISTANT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=QT_QTCLUCENE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=QT_QTCLUCENE_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=QT_QTCORE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtDBus.so;debug;/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=QT_QTDBUS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=QT_QTDESIGNER_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNER_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=QT_QTDESIGNER_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=QT_QTGUI_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=QT_QTHELP_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=QT_QTHELP_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=QT_QTHELP_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtNetwork.so;debug;/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=QT_QTNETWORK_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=QT_QTOPENGL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=QT_QTSCRIPT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=QT_QTSCRIPT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=QT_QTSCRIPT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtSql.so;debug;/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=QT_QTSQL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=QT_QTSVG_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=QT_QTSVG_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=QT_QTSVG_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtTest.so;debug;/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=QT_QTTEST_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=QT_QTUITOOLS_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=QT_QTUITOOLS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=QT_QTUITOOLS_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=QT_QTWEBKIT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=QT_QTWEBKIT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=QT_QTWEBKIT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so;debug;/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=QT_QTXMLPATTERNS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtXml.so;debug;/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=QT_QTXML_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a file.
-QT_QT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/Qt
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib/librt.so
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic3
-
-//The uic executable
-QT_UIC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib/libm.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-//Enable CGAL component Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Use the GMP number types if available.
-WITH_GMP:BOOL=ON
-
-//Search for GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Use the LEDA number types if available.
-WITH_LEDA:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib/libICE.so
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib/libX11.so
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=X11_XTest_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=X11_Xaccessrules_INCLUDE_PATH-NOTFOUND
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=X11_Xcomposite_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=X11_Xcomposite_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=X11_Xdamage_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=X11_Xdamage_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib/libXft.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=X11_Xscreensaver_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=X11_Xxf86misc_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Advanced flag for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_LIBRARY_DIRS
-Boost_LIBRARY_DIRS-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_39
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//Advanced flag for variable: Boost_THREAD_LIBRARY
-Boost_THREAD_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=103900
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include;/usr/include;/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libgmpxx.so;/usr/lib/libmpfr.so;/usr/lib/libgmp.so;/usr/lib/libboost_thread-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib;/usr/lib;/usr/lib
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=FALSE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=libCGAL_Core.so
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;/usr/lib/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//Variable hidden from user
-CGAL_LIBRARY:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/qt-3.3/lib/libqassistantclient.a;/usr/lib/qt-3.3/lib/libqt-mt.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;dl;-lpthread;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_DLL
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/local/packages/qt4.7/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;-lGLU -lGL;optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so;/usr/lib/libpng.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libXrender.so;/usr/lib/libfreetype.so;/usr/lib/libfontconfig.so;/usr/lib/libXext.so;/usr/lib/libX11.so;/usr/lib/libm.so;optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so;/usr/lib/libz.so;/lib/libgthread-2.0.so;/lib/libglib-2.0.so;/usr/lib/librt.so;-lpthread;-ldl;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-//Advanced flag for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCahe.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=6
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 1
-//Advanced flag for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//Advanced flag for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_CXX_COMPILER_WORKS:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_C_COMPILER_WORKS:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//Advanced flag for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//Advanced flag for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake-2.6.1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//Advanced flag for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib/libX11.so][/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/libz.so][/usr/include]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//Advanced flag for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-QT_BINARY_DIR:INTERNAL=/usr/local/packages/qt4.7/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/local/packages/qt4.7/include
-//Advanced flag for variable: QT_INCLUDE_DIR
-QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT_INCLUDE_DIR
-QT_QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//Advanced flag for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//Advanced flag for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib/libX11.so;/usr/lib/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//Advanced flag for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/setup b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/setup
deleted file mode 100644
index 40ef1edad60d..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-3.4.6_CentOS-5.1-O2/setup
+++ /dev/null
@@ -1,4 +0,0 @@
-. $HOME/CGAL/releases-and-testsuites-with-cmake/reference-platforms/common-setup
-
-export CXXFLAGS="-Wall -m32 -O2"
-export CXX=/usr/bin/g++34
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/CMakeCache.txt b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/CMakeCache.txt
deleted file mode 100644
index db5ff10d33c2..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/CMakeCache.txt
+++ /dev/null
@@ -1,2092 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIR:PATH=/usr/lib
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib/libboost_system-mt.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_system-mt.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-4.5-Ic-136
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;/usr/lib/libz.so;
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;general;/usr/lib/qt-3.3/lib/libqassistantclient.a;general;/usr/lib/qt-3.3/lib/libqt-mt.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;dl;general;-lpthread;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;general;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;general;/usr/local/packages/qt4.7/lib/libQtGui.so;general;/usr/local/packages/qt4.7/lib/libQtCore.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/bin/g++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-O2 -Wall -m32  -frounding-math
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/bin/cc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING='-m32 '
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/designer
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/local/packages/qt4.7/doc
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/local/packages/qt4.7/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/linguist
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/lrelease
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/lupdate
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/local/packages/qt4.7/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libphonon.so
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/local/packages/qt4.7/plugins
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqkrcodecs.so
-
-//The qmake executable for the Qt installation to use
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qmake
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlodbc.so
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlpsql.so
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqltds.so
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=QT_QT3SUPPORT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=QT_QTASSISTANTCLIENT_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=QT_QTASSISTANT_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANT_LIBRARY_RELEASE-NOTFOUND
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtCLucene.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=QT_QTCLUCENE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=QT_QTCORE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=QT_QTDBUS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDeclarative.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=QT_QTDECLARATIVE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDesignerComponents.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDesigner.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNER_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=QT_QTGUI_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtHelp.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=QT_QTHELP_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtMultimedia.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=QT_QTMULTIMEDIA_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=QT_QTNETWORK_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=QT_QTOPENGL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtScriptTools.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtScript.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=QT_QTSCRIPT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=QT_QTSQL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtSvg.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=QT_QTSVG_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=QT_QTTEST_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtUiTools.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=QT_QTUITOOLS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtWebKit.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=QT_QTWEBKIT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=QT_QTXMLPATTERNS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=QT_QTXML_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/rcc
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/local/packages/qt4.7/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libworldtimeclockplugin.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=X11_XRes_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=X11_XTest_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=X11_XTest_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=X11_Xaccessrules_INCLUDE_PATH-NOTFOUND
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=X11_Xau_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=X11_Xcomposite_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=X11_Xcomposite_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=X11_Xcursor_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=X11_Xdamage_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=X11_Xdmcp_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=X11_Xdmcp_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=X11_Xfixes_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=X11_Xft_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=X11_Xi_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=X11_Xinerama_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=X11_Xinput_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=X11_Xkbfile_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=X11_Xkbfile_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=X11_Xmu_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=X11_Xmu_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=X11_Xpm_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=X11_Xpm_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=X11_Xrandr_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=X11_Xrender_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=X11_Xscreensaver_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=X11_Xscreensaver_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=X11_Xt_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=X11_Xv_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=X11_Xxf86misc_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=X11_Xxf86vm_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR
-Boost_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libboost_thread-mt.so;/usr/lib/libboost_system-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;/usr/lib/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/qt-3.3/lib/libqassistantclient.a;/usr/lib/qt-3.3/lib/libqt-mt.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;dl;-lpthread;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/local/packages/qt4.7/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=/usr/local/packages/qt4.7/lib/libQtOpenGL.so;/usr/local/packages/qt4.7/lib/libQtGui.so;/usr/local/packages/qt4.7/lib/libQtCore.so;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=11
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include pthread.h
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/usr/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL=-O2 -Wall -m32  -frounding-math
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding GMP
-FIND_PACKAGE_MESSAGE_DETAILS_GMP:INTERNAL=[/usr/lib/libgmp.so][/usr/include][v()]
-//Details about finding GMPXX
-FIND_PACKAGE_MESSAGE_DETAILS_GMPXX:INTERNAL=[/usr/lib/libgmpxx.so][/usr/include][v()]
-//Details about finding MPFR
-FIND_PACKAGE_MESSAGE_DETAILS_MPFR:INTERNAL=[/usr/lib/libmpfr.so][/usr/include][v()]
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib/libGL.so][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/libz.so][/usr/include][v1.2.7()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/local/packages/qt4.7/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/local/packages/qt4.7/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/local/packages/qt4.7/lib
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib/libX11.so;/usr/lib/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/usr/include
-//Last used Boost_LIBRARY_DIR value.
-_Boost_LIBRARY_DIR_LAST:INTERNAL=/usr/lib
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/setup b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/setup
deleted file mode 100644
index b78477a955ba..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O2/setup
+++ /dev/null
@@ -1,4 +0,0 @@
-. $HOME/CGAL/releases-and-testsuites-with-cmake/reference-platforms/common-setup
-
-export CXXFLAGS="-O2 -Wall -m32" 
-export CXX=/usr/bin/g++ 
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/CMakeCache.txt b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/CMakeCache.txt
deleted file mode 100644
index 6736ac14c17b..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/CMakeCache.txt
+++ /dev/null
@@ -1,2092 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIR:PATH=/usr/lib
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib/libboost_system-mt.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_system-mt.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-4.5-Ic-136
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;/usr/lib/libz.so;
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;general;/usr/lib/qt-3.3/lib/libqassistantclient.a;general;/usr/lib/qt-3.3/lib/libqt-mt.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;dl;general;-lpthread;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;general;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;general;/usr/local/packages/qt4.7/lib/libQtGui.so;general;/usr/local/packages/qt4.7/lib/libQtCore.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/bin/g++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-O3 -Wall -m32  -frounding-math
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/bin/cc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING='-m32 '
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/designer
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/local/packages/qt4.7/doc
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/local/packages/qt4.7/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/linguist
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/lrelease
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/lupdate
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/local/packages/qt4.7/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libphonon.so
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/local/packages/qt4.7/plugins
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqkrcodecs.so
-
-//The qmake executable for the Qt installation to use
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qmake
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlodbc.so
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlpsql.so
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqltds.so
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=QT_QT3SUPPORT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=QT_QTASSISTANTCLIENT_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=QT_QTASSISTANT_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANT_LIBRARY_RELEASE-NOTFOUND
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtCLucene.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=QT_QTCLUCENE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=QT_QTCORE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=QT_QTDBUS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDeclarative.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=QT_QTDECLARATIVE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDesignerComponents.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDesigner.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNER_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=QT_QTGUI_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtHelp.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=QT_QTHELP_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtMultimedia.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=QT_QTMULTIMEDIA_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=QT_QTNETWORK_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=QT_QTOPENGL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtScriptTools.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtScript.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=QT_QTSCRIPT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=QT_QTSQL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtSvg.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=QT_QTSVG_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=QT_QTTEST_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtUiTools.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=QT_QTUITOOLS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtWebKit.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=QT_QTWEBKIT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=QT_QTXMLPATTERNS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=QT_QTXML_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/rcc
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/local/packages/qt4.7/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libworldtimeclockplugin.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=X11_XRes_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=X11_XTest_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=X11_XTest_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=X11_Xaccessrules_INCLUDE_PATH-NOTFOUND
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=X11_Xau_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=X11_Xcomposite_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=X11_Xcomposite_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=X11_Xcursor_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=X11_Xdamage_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=X11_Xdmcp_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=X11_Xdmcp_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=X11_Xfixes_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=X11_Xft_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=X11_Xi_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=X11_Xinerama_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=X11_Xinput_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=X11_Xkbfile_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=X11_Xkbfile_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=X11_Xmu_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=X11_Xmu_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=X11_Xpm_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=X11_Xpm_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=X11_Xrandr_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=X11_Xrender_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=X11_Xscreensaver_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=X11_Xscreensaver_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=X11_Xt_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=X11_Xv_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=X11_Xxf86misc_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=X11_Xxf86vm_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR
-Boost_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libboost_thread-mt.so;/usr/lib/libboost_system-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;/usr/lib/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/qt-3.3/lib/libqassistantclient.a;/usr/lib/qt-3.3/lib/libqt-mt.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;dl;-lpthread;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/local/packages/qt4.7/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=/usr/local/packages/qt4.7/lib/libQtOpenGL.so;/usr/local/packages/qt4.7/lib/libQtGui.so;/usr/local/packages/qt4.7/lib/libQtCore.so;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=11
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include pthread.h
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/usr/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL=-O3 -Wall -m32  -frounding-math
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding GMP
-FIND_PACKAGE_MESSAGE_DETAILS_GMP:INTERNAL=[/usr/lib/libgmp.so][/usr/include][v()]
-//Details about finding GMPXX
-FIND_PACKAGE_MESSAGE_DETAILS_GMPXX:INTERNAL=[/usr/lib/libgmpxx.so][/usr/include][v()]
-//Details about finding MPFR
-FIND_PACKAGE_MESSAGE_DETAILS_MPFR:INTERNAL=[/usr/lib/libmpfr.so][/usr/include][v()]
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib/libGL.so][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/libz.so][/usr/include][v1.2.7()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/local/packages/qt4.7/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/local/packages/qt4.7/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/local/packages/qt4.7/lib
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib/libX11.so;/usr/lib/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/usr/include
-//Last used Boost_LIBRARY_DIR value.
-_Boost_LIBRARY_DIR_LAST:INTERNAL=/usr/lib
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/setup b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/setup
deleted file mode 100644
index 5eed1446631f..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1-O3/setup
+++ /dev/null
@@ -1,6 +0,0 @@
-. $HOME/CGAL/releases-and-testsuites-with-cmake/reference-platforms/common-setup
-
-export TESTSUITE_CXXFLAGS="-O3"
-export TESTSUITE_CXXFLAGS_DEBUG="-g0"
-export CXXFLAGS="-O3 -Wall -m32" 
-export CXX=/usr/bin/g++ 
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/CMakeCache.txt b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/CMakeCache.txt
deleted file mode 100644
index 49507207139c..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/CMakeCache.txt
+++ /dev/null
@@ -1,2092 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIR:PATH=/usr/lib
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib/libboost_system-mt.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_system-mt.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-4.5-Ic-136
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;/usr/lib/libz.so;
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;general;/usr/lib/qt-3.3/lib/libqassistantclient.a;general;/usr/lib/qt-3.3/lib/libqt-mt.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;dl;general;-lpthread;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libboost_system-mt.so;general;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;general;/usr/local/packages/qt4.7/lib/libQtGui.so;general;/usr/local/packages/qt4.7/lib/libQtCore.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/bin/g++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-Wall -m32  -frounding-math
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/bin/cc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING='-m32 '
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/designer
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/local/packages/qt4.7/doc
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/local/packages/qt4.7/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/linguist
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/lrelease
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/lupdate
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/local/packages/qt4.7/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libphonon.so
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/local/packages/qt4.7/plugins
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqkrcodecs.so
-
-//The qmake executable for the Qt installation to use
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/qmake
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlodbc.so
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqlpsql.so
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/sqldrivers/libqsqltds.so
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=QT_QT3SUPPORT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=QT_QTASSISTANTCLIENT_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=QT_QTASSISTANT_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANT_LIBRARY_RELEASE-NOTFOUND
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtCLucene.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=QT_QTCLUCENE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=QT_QTCORE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=QT_QTDBUS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDeclarative.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=QT_QTDECLARATIVE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDesignerComponents.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtDesigner.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNER_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=QT_QTGUI_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtHelp.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=QT_QTHELP_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtMultimedia.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=QT_QTMULTIMEDIA_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=QT_QTNETWORK_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=QT_QTOPENGL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtScriptTools.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtScript.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=QT_QTSCRIPT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=QT_QTSQL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtSvg.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=QT_QTSVG_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=QT_QTTEST_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtUiTools.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=QT_QTUITOOLS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtWebKit.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=QT_QTWEBKIT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=QT_QTXMLPATTERNS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=QT_QTXML_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/rcc
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/local/packages/qt4.7/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/local/packages/qt4.7/plugins/designer/libworldtimeclockplugin.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=X11_XRes_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=X11_XTest_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=X11_XTest_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=X11_Xaccessrules_INCLUDE_PATH-NOTFOUND
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=X11_Xau_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=X11_Xcomposite_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=X11_Xcomposite_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=X11_Xcursor_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=X11_Xdamage_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=X11_Xdmcp_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=X11_Xdmcp_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=X11_Xfixes_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=X11_Xft_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=X11_Xi_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=X11_Xinerama_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=X11_Xinput_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=X11_Xkbfile_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=X11_Xkbfile_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=X11_Xmu_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=X11_Xmu_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=X11_Xpm_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=X11_Xpm_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=X11_Xrandr_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=X11_Xrender_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=X11_Xscreensaver_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=X11_Xscreensaver_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=X11_Xt_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=X11_Xv_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=X11_Xxf86misc_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=X11_Xxf86vm_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR
-Boost_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libboost_thread-mt.so;/usr/lib/libboost_system-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;/usr/lib/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/qt-3.3/lib/libqassistantclient.a;/usr/lib/qt-3.3/lib/libqt-mt.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;dl;-lpthread;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/local/packages/qt4.7/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=/usr/local/packages/qt4.7/lib/libQtOpenGL.so;/usr/local/packages/qt4.7/lib/libQtGui.so;/usr/local/packages/qt4.7/lib/libQtCore.so;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=11
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include pthread.h
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/usr/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL=-Wall -m32  -frounding-math
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding GMP
-FIND_PACKAGE_MESSAGE_DETAILS_GMP:INTERNAL=[/usr/lib/libgmp.so][/usr/include][v()]
-//Details about finding GMPXX
-FIND_PACKAGE_MESSAGE_DETAILS_GMPXX:INTERNAL=[/usr/lib/libgmpxx.so][/usr/include][v()]
-//Details about finding MPFR
-FIND_PACKAGE_MESSAGE_DETAILS_MPFR:INTERNAL=[/usr/lib/libmpfr.so][/usr/include][v()]
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib/libGL.so][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/libz.so][/usr/include][v1.2.7()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/local/packages/qt4.7/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/local/packages/qt4.7/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/local/packages/qt4.7/lib
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib/libX11.so;/usr/lib/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/usr/include
-//Last used Boost_LIBRARY_DIR value.
-_Boost_LIBRARY_DIR_LAST:INTERNAL=/usr/lib
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/setup b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/setup
deleted file mode 100644
index dedc3d6dc824..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.1.2_CentOS-5.1/setup
+++ /dev/null
@@ -1,4 +0,0 @@
-. $HOME/CGAL/releases-and-testsuites-with-cmake/reference-platforms/common-setup
-
-export CXXFLAGS="-Wall -m32"
-export CXX=/usr/bin/g++ 
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/CMakeCache.txt b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/CMakeCache.txt
deleted file mode 100644
index 52b33419902d..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/CMakeCache.txt
+++ /dev/null
@@ -1,1535 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIRS:FILEPATH=/usr/lib
-
-//The Boost THREAD library
-Boost_THREAD_LIBRARY:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Path to a library.
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=Boost_THREAD_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/src/CGALCore
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-Ic-92
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/src/CGALimageIO
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;/usr/lib/libz.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALimageIO
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/src/CGALQt
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/qt-3.3/lib/libqassistantclient.a;general;/usr/lib/qt-3.3/lib/libqt-mt.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;dl;general;-lpthread;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALQt
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/src/CGALQt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;general;-lGLU -lGL;optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so;general;/usr/lib/libpng.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libXrender.so;general;/usr/lib/libfreetype.so;general;/usr/lib/libfontconfig.so;general;/usr/lib/libXext.so;general;/usr/lib/libX11.so;general;/usr/lib/libm.so;optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so;general;/usr/lib/libz.so;general;/lib/libgthread-2.0.so;general;/lib/libglib-2.0.so;general;/usr/lib/librt.so;general;-lpthread;general;-ldl;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALQt4
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//No help, variable specified on the command line.
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/local/bin/g++43
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-Wall -m32  -frounding-math -DCGAL_NO_DEPRECATED_CODE
-
-//No help, variable specified on the command line.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/bin/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/uic
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=QT_DBUSCPP2XML_EXECUTABLE-NOTFOUND
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=QT_DBUSXML2CPP_EXECUTABLE-NOTFOUND
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/local/packages/qt4.7/doc
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/lib/libglib-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/lib/libgthread-2.0.so
-
-QT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include
-
-//Qt library dir
-QT_LIBRARY_DIR:PATH=/usr/local/packages/qt4.7/lib
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=QT_LRELEASE_EXECUTABLE-NOTFOUND
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=QT_LUPDATE_EXECUTABLE-NOTFOUND
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/local/packages/qt4.7/mkspecs
-
-//The moc executable
-QT_MOC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/moc
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libphonon.so;debug;/usr/local/packages/qt4.7/lib/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libphonon.so
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/local/packages/qt4.7/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib/libpng.so
-
-//Path to a program.
-QT_QMAKE_EXECUTABLE:FILEPATH=/home/local/packages/qt4.7/bin/qmake
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQt3Support.so;debug;/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=QT_QT3SUPPORT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=QT_QTASSISTANTCLIENT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=QT_QTASSISTANT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=QT_QTCLUCENE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=QT_QTCLUCENE_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=QT_QTCORE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtDBus.so;debug;/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=QT_QTDBUS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=QT_QTDESIGNER_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNER_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=QT_QTDESIGNER_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=QT_QTGUI_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=QT_QTHELP_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=QT_QTHELP_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=QT_QTHELP_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtNetwork.so;debug;/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=QT_QTNETWORK_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=QT_QTOPENGL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=QT_QTSCRIPT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=QT_QTSCRIPT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=QT_QTSCRIPT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtSql.so;debug;/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=QT_QTSQL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=QT_QTSVG_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=QT_QTSVG_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=QT_QTSVG_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtTest.so;debug;/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=QT_QTTEST_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=QT_QTUITOOLS_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=QT_QTUITOOLS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=QT_QTUITOOLS_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=QT_QTWEBKIT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=QT_QTWEBKIT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=QT_QTWEBKIT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so;debug;/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=QT_QTXMLPATTERNS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtXml.so;debug;/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=QT_QTXML_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a file.
-QT_QT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/Qt
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib/librt.so
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic3
-
-//The uic executable
-QT_UIC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib/libm.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-//Enable CGAL component Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Use the GMP number types if available.
-WITH_GMP:BOOL=ON
-
-//Search for GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Use the LEDA number types if available.
-WITH_LEDA:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib/libICE.so
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib/libX11.so
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=X11_XTest_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=X11_Xaccessrules_INCLUDE_PATH-NOTFOUND
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=X11_Xcomposite_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=X11_Xcomposite_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=X11_Xdamage_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=X11_Xdamage_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib/libXft.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=X11_Xscreensaver_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=X11_Xxf86misc_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Advanced flag for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_LIBRARY_DIRS
-Boost_LIBRARY_DIRS-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_39
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//Advanced flag for variable: Boost_THREAD_LIBRARY
-Boost_THREAD_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=103900
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include;/usr/include;/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libgmpxx.so;/usr/lib/libmpfr.so;/usr/lib/libgmp.so;/usr/lib/libboost_thread-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib;/usr/lib;/usr/lib
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=FALSE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=libCGAL_Core.so
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;/usr/lib/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//Variable hidden from user
-CGAL_LIBRARY:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/qt-3.3/lib/libqassistantclient.a;/usr/lib/qt-3.3/lib/libqt-mt.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;dl;-lpthread;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_DLL
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/local/packages/qt4.7/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;-lGLU -lGL;optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so;/usr/lib/libpng.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libXrender.so;/usr/lib/libfreetype.so;/usr/lib/libfontconfig.so;/usr/lib/libXext.so;/usr/lib/libX11.so;/usr/lib/libm.so;optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so;/usr/lib/libz.so;/lib/libgthread-2.0.so;/lib/libglib-2.0.so;/usr/lib/librt.so;-lpthread;-ldl;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-//Advanced flag for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCahe.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=6
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 1
-//Advanced flag for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//Advanced flag for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_CXX_COMPILER_WORKS:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_C_COMPILER_WORKS:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//Advanced flag for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//Advanced flag for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake-2.6.1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//Advanced flag for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib/libX11.so][/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/libz.so][/usr/include]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//Advanced flag for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-QT_BINARY_DIR:INTERNAL=/usr/local/packages/qt4.7/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/local/packages/qt4.7/include
-//Advanced flag for variable: QT_INCLUDE_DIR
-QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT_INCLUDE_DIR
-QT_QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//Advanced flag for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//Advanced flag for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib/libX11.so;/usr/lib/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//Advanced flag for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/setup b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/setup
deleted file mode 100644
index 2f0b4b8c4c12..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O2-NO-DEPRECATED/setup
+++ /dev/null
@@ -1,5 +0,0 @@
-. $HOME/CGAL/releases-and-testsuites-with-cmake/reference-platforms/common-setup
-
-export CXX=/usr/local/bin/g++43
-export CXXFLAGS="-Wall -m32 -DCGAL_NO_DEPRECATED_CODE"
-export LD_LIBRARY_PATH=/usr/local/gcc43/lib/
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/CMakeCache.txt b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/CMakeCache.txt
deleted file mode 100644
index 3c8062db8f02..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/CMakeCache.txt
+++ /dev/null
@@ -1,1535 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIRS:FILEPATH=/usr/lib
-
-//The Boost THREAD library
-Boost_THREAD_LIBRARY:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Path to a library.
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=Boost_THREAD_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/src/CGALCore
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-Ic-92
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/src/CGALimageIO
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;/usr/lib/libz.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALimageIO
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/src/CGALQt
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/qt-3.3/lib/libqassistantclient.a;general;/usr/lib/qt-3.3/lib/libqt-mt.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;dl;general;-lpthread;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALQt
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/src/CGALQt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;general;-lGLU -lGL;optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so;general;/usr/lib/libpng.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libXrender.so;general;/usr/lib/libfreetype.so;general;/usr/lib/libfontconfig.so;general;/usr/lib/libXext.so;general;/usr/lib/libX11.so;general;/usr/lib/libm.so;optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so;general;/usr/lib/libz.so;general;/lib/libgthread-2.0.so;general;/lib/libglib-2.0.so;general;/usr/lib/librt.so;general;-lpthread;general;-ldl;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALQt4
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//No help, variable specified on the command line.
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/local/bin/g++43
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-O3 -Wall -m32  -frounding-math
-
-//No help, variable specified on the command line.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/bin/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/uic
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=QT_DBUSCPP2XML_EXECUTABLE-NOTFOUND
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=QT_DBUSXML2CPP_EXECUTABLE-NOTFOUND
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/local/packages/qt4.7/doc
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/lib/libglib-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/lib/libgthread-2.0.so
-
-QT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include
-
-//Qt library dir
-QT_LIBRARY_DIR:PATH=/usr/local/packages/qt4.7/lib
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=QT_LRELEASE_EXECUTABLE-NOTFOUND
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=QT_LUPDATE_EXECUTABLE-NOTFOUND
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/local/packages/qt4.7/mkspecs
-
-//The moc executable
-QT_MOC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/moc
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libphonon.so;debug;/usr/local/packages/qt4.7/lib/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libphonon.so
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/local/packages/qt4.7/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib/libpng.so
-
-//Path to a program.
-QT_QMAKE_EXECUTABLE:FILEPATH=/home/local/packages/qt4.7/bin/qmake
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQt3Support.so;debug;/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=QT_QT3SUPPORT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=QT_QTASSISTANTCLIENT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=QT_QTASSISTANT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=QT_QTCLUCENE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=QT_QTCLUCENE_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=QT_QTCORE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtDBus.so;debug;/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=QT_QTDBUS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=QT_QTDESIGNER_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNER_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=QT_QTDESIGNER_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=QT_QTGUI_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=QT_QTHELP_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=QT_QTHELP_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=QT_QTHELP_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtNetwork.so;debug;/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=QT_QTNETWORK_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=QT_QTOPENGL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=QT_QTSCRIPT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=QT_QTSCRIPT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=QT_QTSCRIPT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtSql.so;debug;/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=QT_QTSQL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=QT_QTSVG_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=QT_QTSVG_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=QT_QTSVG_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtTest.so;debug;/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=QT_QTTEST_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=QT_QTUITOOLS_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=QT_QTUITOOLS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=QT_QTUITOOLS_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=QT_QTWEBKIT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=QT_QTWEBKIT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=QT_QTWEBKIT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so;debug;/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=QT_QTXMLPATTERNS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtXml.so;debug;/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=QT_QTXML_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a file.
-QT_QT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/Qt
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib/librt.so
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic3
-
-//The uic executable
-QT_UIC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib/libm.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-//Enable CGAL component Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Use the GMP number types if available.
-WITH_GMP:BOOL=ON
-
-//Search for GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Use the LEDA number types if available.
-WITH_LEDA:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib/libICE.so
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib/libX11.so
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=X11_XTest_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=X11_Xaccessrules_INCLUDE_PATH-NOTFOUND
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=X11_Xcomposite_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=X11_Xcomposite_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=X11_Xdamage_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=X11_Xdamage_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib/libXft.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=X11_Xscreensaver_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=X11_Xxf86misc_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Advanced flag for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_LIBRARY_DIRS
-Boost_LIBRARY_DIRS-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_39
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//Advanced flag for variable: Boost_THREAD_LIBRARY
-Boost_THREAD_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=103900
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include;/usr/include;/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libgmpxx.so;/usr/lib/libmpfr.so;/usr/lib/libgmp.so;/usr/lib/libboost_thread-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib;/usr/lib;/usr/lib
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=FALSE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=libCGAL_Core.so
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;/usr/lib/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//Variable hidden from user
-CGAL_LIBRARY:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/qt-3.3/lib/libqassistantclient.a;/usr/lib/qt-3.3/lib/libqt-mt.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;dl;-lpthread;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_DLL
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/local/packages/qt4.7/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;-lGLU -lGL;optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so;/usr/lib/libpng.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libXrender.so;/usr/lib/libfreetype.so;/usr/lib/libfontconfig.so;/usr/lib/libXext.so;/usr/lib/libX11.so;/usr/lib/libm.so;optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so;/usr/lib/libz.so;/lib/libgthread-2.0.so;/lib/libglib-2.0.so;/usr/lib/librt.so;-lpthread;-ldl;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-//Advanced flag for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCahe.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=6
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 1
-//Advanced flag for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//Advanced flag for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_CXX_COMPILER_WORKS:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_C_COMPILER_WORKS:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//Advanced flag for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//Advanced flag for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake-2.6.1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//Advanced flag for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib/libX11.so][/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/libz.so][/usr/include]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//Advanced flag for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-QT_BINARY_DIR:INTERNAL=/usr/local/packages/qt4.7/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/local/packages/qt4.7/include
-//Advanced flag for variable: QT_INCLUDE_DIR
-QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT_INCLUDE_DIR
-QT_QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//Advanced flag for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//Advanced flag for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib/libX11.so;/usr/lib/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//Advanced flag for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/setup b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/setup
deleted file mode 100644
index 3397835d5693..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1-O3/setup
+++ /dev/null
@@ -1,5 +0,0 @@
-. $HOME/CGAL/releases-and-testsuites-with-cmake/reference-platforms/common-setup
-
-export CXX=/usr/local/bin/g++43
-export CXXFLAGS="-O3 -Wall -m32"
-export LD_LIBRARY_PATH=/usr/local/gcc43/lib/
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/CMakeCache.txt b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/CMakeCache.txt
deleted file mode 100644
index 1088492a0bcb..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/CMakeCache.txt
+++ /dev/null
@@ -1,1535 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIRS:FILEPATH=/usr/lib
-
-//The Boost THREAD library
-Boost_THREAD_LIBRARY:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Path to a library.
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=Boost_THREAD_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_thread-mt.so
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/src/CGALCore
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-Ic-92
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/src/CGALimageIO
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;/usr/lib/libz.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALimageIO
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/src/CGALQt
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/usr/lib/qt-3.3/lib/libqassistantclient.a;general;/usr/lib/qt-3.3/lib/libqt-mt.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;general;dl;general;-lpthread;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALQt
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/src/CGALQt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libmpfr.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread-mt.so;optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;general;-lGLU -lGL;optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so;general;/usr/lib/libpng.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libXrender.so;general;/usr/lib/libfreetype.so;general;/usr/lib/libfontconfig.so;general;/usr/lib/libXext.so;general;/usr/lib/libX11.so;general;/usr/lib/libm.so;optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so;general;/usr/lib/libz.so;general;/lib/libgthread-2.0.so;general;/lib/libglib-2.0.so;general;/usr/lib/librt.so;general;-lpthread;general;-ldl;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libSM.so;general;/usr/lib/libICE.so;general;/usr/lib/libX11.so;general;/usr/lib/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/src/CGALQt4
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//No help, variable specified on the command line.
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/local/bin/g++43
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-Wall -m32  -frounding-math
-
-//No help, variable specified on the command line.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/bin/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/uic
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=QT_DBUSCPP2XML_EXECUTABLE-NOTFOUND
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=QT_DBUSXML2CPP_EXECUTABLE-NOTFOUND
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/local/packages/qt4.7/doc
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/lib/libglib-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/lib/libgthread-2.0.so
-
-QT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include
-
-//Qt library dir
-QT_LIBRARY_DIR:PATH=/usr/local/packages/qt4.7/lib
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=QT_LRELEASE_EXECUTABLE-NOTFOUND
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=QT_LUPDATE_EXECUTABLE-NOTFOUND
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/local/packages/qt4.7/mkspecs
-
-//The moc executable
-QT_MOC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/moc
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libphonon.so;debug;/usr/local/packages/qt4.7/lib/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libphonon.so
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/local/packages/qt4.7/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib/libpng.so
-
-//Path to a program.
-QT_QMAKE_EXECUTABLE:FILEPATH=/home/local/packages/qt4.7/bin/qmake
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQt3Support.so;debug;/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=QT_QT3SUPPORT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQt3Support.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=QT_QTASSISTANTCLIENT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=QT_QTASSISTANT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=QT_QTCLUCENE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=QT_QTCLUCENE_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=QT_QTCORE_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtDBus.so;debug;/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=QT_QTDBUS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtDBus.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=QT_QTDESIGNER_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=QT_QTDESIGNER_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=QT_QTDESIGNER_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=QT_QTGUI_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=QT_QTHELP_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=QT_QTHELP_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=QT_QTHELP_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtNetwork.so;debug;/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=QT_QTNETWORK_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=QT_QTOPENGL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtOpenGL.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=QT_QTSCRIPT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=QT_QTSCRIPT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=QT_QTSCRIPT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtSql.so;debug;/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=QT_QTSQL_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=QT_QTSVG_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=QT_QTSVG_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=QT_QTSVG_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtTest.so;debug;/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=QT_QTTEST_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=QT_QTUITOOLS_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=QT_QTUITOOLS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=QT_QTUITOOLS_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=QT_QTWEBKIT_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=QT_QTWEBKIT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=QT_QTWEBKIT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so;debug;/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=QT_QTXMLPATTERNS_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:FILEPATH=optimized;/usr/local/packages/qt4.7/lib/libQtXml.so;debug;/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=QT_QTXML_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/local/packages/qt4.7/lib/libQtXml.so
-
-//Path to a file.
-QT_QT_INCLUDE_DIR:PATH=/usr/local/packages/qt4.7/include/Qt
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib/librt.so
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic3
-
-//The uic executable
-QT_UIC_EXECUTABLE:FILEPATH=/usr/local/packages/qt4.7/bin/uic
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib/libm.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-//Enable CGAL component Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Use the GMP number types if available.
-WITH_GMP:BOOL=ON
-
-//Search for GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Use the LEDA number types if available.
-WITH_LEDA:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib/libICE.so
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib/libX11.so
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=X11_XTest_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=X11_Xaccessrules_INCLUDE_PATH-NOTFOUND
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=X11_Xcomposite_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=X11_Xcomposite_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=X11_Xdamage_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=X11_Xdamage_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib/libXft.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=X11_Xscreensaver_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=X11_Xxf86misc_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Advanced flag for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_LIBRARY_DIRS
-Boost_LIBRARY_DIRS-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_39
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//Advanced flag for variable: Boost_THREAD_LIBRARY
-Boost_THREAD_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=103900
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include;/usr/include;/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libgmpxx.so;/usr/lib/libmpfr.so;/usr/lib/libgmp.so;/usr/lib/libboost_thread-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib;/usr/lib;/usr/lib
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=FALSE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=libCGAL_Core.so
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;/usr/lib/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//Variable hidden from user
-CGAL_LIBRARY:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/qt-3.3/lib/libqassistantclient.a;/usr/lib/qt-3.3/lib/libqt-mt.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so;dl;-lpthread;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_DLL
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/local/packages/qt4.7/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;debug;/usr/local/packages/qt4.7/lib/libQtOpenGL.so;-lGLU -lGL;optimized;/usr/local/packages/qt4.7/lib/libQtGui.so;debug;/usr/local/packages/qt4.7/lib/libQtGui.so;/usr/lib/libpng.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libXrender.so;/usr/lib/libfreetype.so;/usr/lib/libfontconfig.so;/usr/lib/libXext.so;/usr/lib/libX11.so;/usr/lib/libm.so;optimized;/usr/local/packages/qt4.7/lib/libQtCore.so;debug;/usr/local/packages/qt4.7/lib/libQtCore.so;/usr/lib/libz.so;/lib/libgthread-2.0.so;/lib/libglib-2.0.so;/usr/lib/librt.so;-lpthread;-ldl;/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libSM.so;/usr/lib/libICE.so;/usr/lib/libX11.so;/usr/lib/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Advanced flag for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-//Advanced flag for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCahe.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=6
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 1
-//Advanced flag for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//Advanced flag for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_CXX_COMPILER_WORKS:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_C_COMPILER_WORKS:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//Advanced flag for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//Advanced flag for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake-2.6.1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//Advanced flag for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//Advanced flag for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib/libX11.so][/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/libz.so][/usr/include]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//Advanced flag for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-QT_BINARY_DIR:INTERNAL=/usr/local/packages/qt4.7/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/local/packages/qt4.7/include
-//Advanced flag for variable: QT_INCLUDE_DIR
-QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_QT_INCLUDE_DIR
-QT_QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//Advanced flag for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//Advanced flag for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//Advanced flag for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib/libX11.so;/usr/lib/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//Advanced flag for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Advanced flag for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//Advanced flag for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Advanced flag for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/setup b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/setup
deleted file mode 100644
index 2d3253c4e213..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/i686_Linux-2.6_g++-4.3.3_CentOS-5.1/setup
+++ /dev/null
@@ -1,5 +0,0 @@
-. $HOME/CGAL/releases-and-testsuites-with-cmake/reference-platforms/common-setup
-
-export CXXFLAGS="-Wall -m32"
-export CXX=/usr/local/bin/g++43
-export LD_LIBRARY_PATH=/usr/local/gcc43/lib/
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/CMakeCache.txt b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/CMakeCache.txt
deleted file mode 100644
index aa46b38efa9f..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/CMakeCache.txt
+++ /dev/null
@@ -1,2100 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIR:PATH=/usr/lib64
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_system-mt.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_system-mt.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_thread-mt.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_thread-mt.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -fp-model strict
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/lib/libCGAL.so;general;/usr/lib64/libboost_thread-mt.so;general;/usr/lib64/libboost_system-mt.so;
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-4.6-I-135
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/lib/libCGAL.so;general;/usr/lib64/libboost_thread-mt.so;general;/usr/lib64/libboost_system-mt.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;/usr/lib64/libz.so;
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread-mt.so;general;/usr/lib64/libboost_system-mt.so;
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/lib/libCGAL.so;general;/usr/lib64/libboost_thread-mt.so;general;/usr/lib64/libboost_system-mt.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/lib/libCGAL.so;general;/usr/lib64/libboost_thread-mt.so;general;/usr/lib64/libboost_system-mt.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/opt/intel/composer_xe_2015/bin/icpc
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING= -fp-model strict -w1
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/opt/intel/composer_xe_2015/bin/icc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease-qt4
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate-qt4
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=QT_PHONONWIDGETS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=QT_PHONON_INCLUDE_DIR-NOTFOUND
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=QT_PHONON_LIBRARY_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can the qmake-qt4 library be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLMYSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=QT_QTASSISTANTCLIENT_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=QT_QTASSISTANT_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=QT_QTASSISTANT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=QT_QTASSISTANT_LIBRARY_RELEASE-NOTFOUND
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=QT_QTWEBKIT_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=QT_QTWEBKIT_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=QT_QTWEBKIT_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=QT_QWEBVIEW_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic-qt4
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=OFF
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=X11_XRes_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=X11_XTest_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=X11_XTest_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=X11_Xaccessrules_INCLUDE_PATH-NOTFOUND
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=X11_Xcomposite_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=X11_Xcomposite_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=X11_Xdmcp_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=X11_Xdmcp_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=X11_Xkbfile_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=X11_Xkbfile_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=X11_Xmu_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=X11_Xmu_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=X11_Xpm_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=X11_Xpm_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=X11_Xscreensaver_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=X11_Xscreensaver_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=X11_Xxf86misc_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=/usr/lib64/libXxf86vm.so
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a program.
-XIAR:FILEPATH=/opt/intel/composer_xe_2015/bin/xiar
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR
-Boost_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libboost_thread-mt.so;/usr/lib64/libboost_system-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib64
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//MODIFIED property for variable: CMAKE_BUILD_TYPE
-CMAKE_BUILD_TYPE-MODIFIED:INTERNAL=ON
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=11
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//MODIFIED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-MODIFIED:INTERNAL=ON
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//MODIFIED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-MODIFIED:INTERNAL=ON
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include pthread.h
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/releases-and-testsuites-with-cmake/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/usr/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL= -fp-model strict -w1
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding GMP
-FIND_PACKAGE_MESSAGE_DETAILS_GMP:INTERNAL=[/usr/lib64/libgmp.so][/usr/include][v()]
-//Details about finding MPFR
-FIND_PACKAGE_MESSAGE_DETAILS_MPFR:INTERNAL=[/usr/lib64/libmpfr.so][/usr/include][v()]
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.7()]
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-IntelCompiler_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-IntelCompiler_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: XIAR
-XIAR-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/usr/include
-//Last used Boost_LIBRARY_DIR value.
-_Boost_LIBRARY_DIR_LAST:INTERNAL=/usr/lib64
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/setup b/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/setup
deleted file mode 100644
index 32965d669cc8..000000000000
--- a/Maintenance/infrastructure/cgal.geometryfactory.com/reference-platforms/x86_64_Linux-x.y_IntelCompiler-15.0_CentOS-7.x/setup
+++ /dev/null
@@ -1,5 +0,0 @@
-source /opt/intel/composerxe/bin/compilervars.sh intel64
-CC=icc
-CXX=icpc
-export CC CXX
-

From 361c5c50094a36bda8d09ba8a2aedd7d2cf4c42d Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 2 Nov 2023 14:13:07 +0100
Subject: [PATCH 0962/1398] remove all the _sizing_field parameters that have
 never been used

they were removed from the documentation before being merged in the master branch
see SVN commit
https://github.com/CGAL/cgal-attic/commit/1614a89e32693a9f33394083d75ed11f06209947
---
 Mesh_3/include/CGAL/Mesh_criteria_3.h                | 12 +++---------
 .../STL_Extension/internal/parameters_interface.h    |  4 ----
 2 files changed, 3 insertions(+), 13 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_criteria_3.h b/Mesh_3/include/CGAL/Mesh_criteria_3.h
index 96511da5520c..d950cfb6d828 100644
--- a/Mesh_3/include/CGAL/Mesh_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_criteria_3.h
@@ -70,22 +70,16 @@ class Mesh_criteria_3_impl
   // is not a problem
   template <typename CGAL_NP_TEMPLATE_PARAMETERS>
   Mesh_criteria_3_impl(const CGAL_NP_CLASS& np)
-    :edge_criteria_(parameters::choose_parameter(parameters::get_parameter(np, internal_np::edge_size_param),
-                                                 parameters::choose_parameter(parameters::get_parameter_reference(np, internal_np::edge_sizing_field_param),
-                                                                              parameters::choose_parameter(parameters::get_parameter(np, internal_np::sizing_field_param), FT(DBL_MAX)))),
+    :edge_criteria_(parameters::choose_parameter(parameters::get_parameter(np, internal_np::edge_size_param), FT(DBL_MAX)),
                     parameters::choose_parameter(parameters::get_parameter(np, internal_np::edge_min_size_param), FT(0))),
     facet_criteria_(parameters::choose_parameter(parameters::get_parameter(np, internal_np::facet_angle_param), FT(0)),
-                    parameters::choose_parameter(parameters::get_parameter(np, internal_np::facet_size_param),
-                                                 parameters::choose_parameter(parameters::get_parameter_reference(np, internal_np::facet_sizing_field_param),
-                                                                              parameters::choose_parameter(parameters::get_parameter(np, internal_np::sizing_field_param), FT(0)))),
+                    parameters::choose_parameter(parameters::get_parameter(np, internal_np::facet_size_param), FT(0)),
                     parameters::choose_parameter(parameters::get_parameter_reference(np, internal_np::facet_distance_param), FT(0)),
                     parameters::choose_parameter(parameters::get_parameter(np, internal_np::facet_topology_param), CGAL::FACET_VERTICES_ON_SURFACE),
                     parameters::choose_parameter(parameters::get_parameter(np, internal_np::facet_min_size_param), FT(0))),
     cell_criteria_(parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_radius_edge_ratio_param),
                                                 parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_radius_edge_param), FT(0))),
-                   parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_size_param),
-                                                parameters::choose_parameter(parameters::get_parameter_reference(np, internal_np::cell_sizing_field_param),
-                                                                             parameters::choose_parameter(parameters::get_parameter_reference(np, internal_np::sizing_field_param), FT(0)))),
+                   parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_size_param), FT(0)),
                    parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_min_size_param), FT(0)))
   { }
 
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index 7792ad5cdb60..621e551c40f4 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -337,19 +337,15 @@ CGAL_add_named_parameter_with_compatibility(features_detector_param_t, features_
 CGAL_add_named_parameter_with_compatibility(input_features_param_t, input_features_param, input_features)
 
 CGAL_add_named_parameter_with_compatibility(edge_size_param_t, edge_size_param, edge_size)
-CGAL_add_named_parameter_with_compatibility_cref_only(edge_sizing_field_param_t, edge_sizing_field_param, edge_sizing_field)
 CGAL_add_named_parameter_with_compatibility(edge_min_size_param_t, edge_min_size_param, edge_min_size)
 CGAL_add_named_parameter_with_compatibility(facet_angle_param_t, facet_angle_param, facet_angle)
 CGAL_add_named_parameter_with_compatibility(facet_size_param_t, facet_size_param, facet_size)
-CGAL_add_named_parameter_with_compatibility_cref_only(facet_sizing_field_param_t, facet_sizing_field_param, facet_sizing_field)
 CGAL_add_named_parameter_with_compatibility_cref_only(facet_distance_param_t, facet_distance_param, facet_distance)
 CGAL_add_named_parameter_with_compatibility(facet_min_size_param_t, facet_min_size_param, facet_min_size)
 CGAL_add_named_parameter_with_compatibility(facet_topology_param_t, facet_topology_param, facet_topology)
 CGAL_add_named_parameter_with_compatibility(cell_radius_edge_param_t, cell_radius_edge_param, cell_radius_edge)
 CGAL_add_named_parameter_with_compatibility(cell_radius_edge_ratio_param_t, cell_radius_edge_ratio_param, cell_radius_edge_ratio)
 CGAL_add_named_parameter_with_compatibility(cell_size_param_t, cell_size_param, cell_size)
-CGAL_add_named_parameter_with_compatibility_cref_only(cell_sizing_field_param_t, cell_sizing_field_param, cell_sizing_field)
-CGAL_add_named_parameter_with_compatibility_cref_only(sizing_field_param_t, sizing_field_param, sizing_field)
 CGAL_add_named_parameter_with_compatibility(cell_min_size_param_t, cell_min_size_param, cell_min_size)
 
 CGAL_add_named_parameter_with_compatibility(function_param_t, function_param, function)

From 093660ce4343e3a3b8ca65fe8e2a860907e7d69f Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 2 Nov 2023 14:27:31 +0100
Subject: [PATCH 0963/1398] remove unused and undocumented criterion
 cell_radius_edge

---
 Mesh_3/include/CGAL/Mesh_criteria_3.h                          | 3 +--
 .../include/CGAL/STL_Extension/internal/parameters_interface.h | 1 -
 2 files changed, 1 insertion(+), 3 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_criteria_3.h b/Mesh_3/include/CGAL/Mesh_criteria_3.h
index d950cfb6d828..12e0e4222075 100644
--- a/Mesh_3/include/CGAL/Mesh_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_criteria_3.h
@@ -77,8 +77,7 @@ class Mesh_criteria_3_impl
                     parameters::choose_parameter(parameters::get_parameter_reference(np, internal_np::facet_distance_param), FT(0)),
                     parameters::choose_parameter(parameters::get_parameter(np, internal_np::facet_topology_param), CGAL::FACET_VERTICES_ON_SURFACE),
                     parameters::choose_parameter(parameters::get_parameter(np, internal_np::facet_min_size_param), FT(0))),
-    cell_criteria_(parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_radius_edge_ratio_param),
-                                                parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_radius_edge_param), FT(0))),
+    cell_criteria_(parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_radius_edge_ratio_param), FT(0)),
                    parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_size_param), FT(0)),
                    parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_min_size_param), FT(0)))
   { }
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index 621e551c40f4..d656b63a0069 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -343,7 +343,6 @@ CGAL_add_named_parameter_with_compatibility(facet_size_param_t, facet_size_param
 CGAL_add_named_parameter_with_compatibility_cref_only(facet_distance_param_t, facet_distance_param, facet_distance)
 CGAL_add_named_parameter_with_compatibility(facet_min_size_param_t, facet_min_size_param, facet_min_size)
 CGAL_add_named_parameter_with_compatibility(facet_topology_param_t, facet_topology_param, facet_topology)
-CGAL_add_named_parameter_with_compatibility(cell_radius_edge_param_t, cell_radius_edge_param, cell_radius_edge)
 CGAL_add_named_parameter_with_compatibility(cell_radius_edge_ratio_param_t, cell_radius_edge_ratio_param, cell_radius_edge_ratio)
 CGAL_add_named_parameter_with_compatibility(cell_size_param_t, cell_size_param, cell_size)
 CGAL_add_named_parameter_with_compatibility(cell_min_size_param_t, cell_min_size_param, cell_min_size)

From 3efb936be85a522dcd98e3e660780dfb71f018bb Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 2 Nov 2023 14:33:17 +0100
Subject: [PATCH 0964/1398] Scale_space_reconstructionL Doc Fixes

---
 .../doc/Scale_space_reconstruction_3/dependencies         | 2 ++
 .../CGAL/Scale_space_reconstruction_3/Jet_smoother.h      | 8 ++++----
 .../Scale_space_reconstruction_3/Weighted_PCA_smoother.h  | 4 ++--
 3 files changed, 8 insertions(+), 6 deletions(-)

diff --git a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/dependencies b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/dependencies
index a787bfab4a8d..8435af3db159 100644
--- a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/dependencies
+++ b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/dependencies
@@ -7,3 +7,5 @@ Spatial_searching
 Solver_interface
 Advancing_front_surface_reconstruction
 Point_set_processing_3
+Polygon_mesh_processing_3
+Algebraic_foundations
diff --git a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Jet_smoother.h b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Jet_smoother.h
index 40c28918831d..4ec790d3e054 100644
--- a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Jet_smoother.h
+++ b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Jet_smoother.h
@@ -52,8 +52,8 @@ template <typename Geom_traits,
 class Jet_smoother
 {
 public:
-  typedef typename Geom_traits::FT FT; ///< defines the point type.
-  typedef typename Geom_traits::Point_3 Point; ///< defines the point typ.e
+  typedef typename Geom_traits::FT FT; ///< defines the field number type.
+  typedef typename Geom_traits::Point_3 Point; ///< defines the point type.
 private:
 
   unsigned int m_k;
@@ -65,9 +65,9 @@ class Jet_smoother
   /**
    * Constructs a jet smoother.
    *
-   * \param k number of neighbors used.
+   * \param k number of neighbors used
    * \param degree_fitting fitting degree
-   * \param degree_monge monge degree
+   * \param degree_monge Monge degree
    */
   Jet_smoother (unsigned int k = 12,
                 unsigned int degree_fitting = 2,
diff --git a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
index 648b8480886c..f749b82ccf50 100644
--- a/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
+++ b/Scale_space_reconstruction_3/include/CGAL/Scale_space_reconstruction_3/Weighted_PCA_smoother.h
@@ -70,8 +70,8 @@ template <typename Geom_traits,
 class Weighted_PCA_smoother
 {
 public:
-  typedef typename Geom_traits::FT FT; ///< defines the point type.
-  typedef typename Geom_traits::Point_3 Point; ///< defines the point typ.e
+  typedef typename Geom_traits::FT FT; ///< defines the field number type.
+  typedef typename Geom_traits::Point_3 Point; ///< defines the point type.
   typedef typename Geom_traits::Vector_3 Vector; ///< defines the vector type.
 private:
 

From 5b6bf127457be9335b79ef73d0443fa6c9612e4c Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 2 Nov 2023 14:39:34 +0100
Subject: [PATCH 0965/1398] use get_parameter_reference for all the
 possibly-field parameters

---
 Mesh_3/include/CGAL/Mesh_criteria_3.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Mesh_3/include/CGAL/Mesh_criteria_3.h b/Mesh_3/include/CGAL/Mesh_criteria_3.h
index 12e0e4222075..c2d5d3d9b139 100644
--- a/Mesh_3/include/CGAL/Mesh_criteria_3.h
+++ b/Mesh_3/include/CGAL/Mesh_criteria_3.h
@@ -70,15 +70,15 @@ class Mesh_criteria_3_impl
   // is not a problem
   template <typename CGAL_NP_TEMPLATE_PARAMETERS>
   Mesh_criteria_3_impl(const CGAL_NP_CLASS& np)
-    :edge_criteria_(parameters::choose_parameter(parameters::get_parameter(np, internal_np::edge_size_param), FT(DBL_MAX)),
+    :edge_criteria_(parameters::choose_parameter(parameters::get_parameter_reference(np, internal_np::edge_size_param), FT(DBL_MAX)),
                     parameters::choose_parameter(parameters::get_parameter(np, internal_np::edge_min_size_param), FT(0))),
     facet_criteria_(parameters::choose_parameter(parameters::get_parameter(np, internal_np::facet_angle_param), FT(0)),
-                    parameters::choose_parameter(parameters::get_parameter(np, internal_np::facet_size_param), FT(0)),
+                    parameters::choose_parameter(parameters::get_parameter_reference(np, internal_np::facet_size_param), FT(0)),
                     parameters::choose_parameter(parameters::get_parameter_reference(np, internal_np::facet_distance_param), FT(0)),
                     parameters::choose_parameter(parameters::get_parameter(np, internal_np::facet_topology_param), CGAL::FACET_VERTICES_ON_SURFACE),
                     parameters::choose_parameter(parameters::get_parameter(np, internal_np::facet_min_size_param), FT(0))),
     cell_criteria_(parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_radius_edge_ratio_param), FT(0)),
-                   parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_size_param), FT(0)),
+                   parameters::choose_parameter(parameters::get_parameter_reference(np, internal_np::cell_size_param), FT(0)),
                    parameters::choose_parameter(parameters::get_parameter(np, internal_np::cell_min_size_param), FT(0)))
   { }
 

From 08b25d8778a06ffc5c82118a3dd4c1a41bf8da6e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 2 Nov 2023 16:08:37 +0100
Subject: [PATCH 0966/1398] prevent a warning with older versions of TBB

---
 .../CGAL/Polygon_mesh_processing/autorefinement.h      | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 5b9cad98277d..d25ea95fe905 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -46,6 +46,10 @@
 
 #ifdef CGAL_LINKED_WITH_TBB
 #include <tbb/concurrent_vector.h>
+#if TBB_INTERFACE_VERSION < 12010 && !defined(TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS)
+#define CGAL_HAS_DEFINED_TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS
+#define TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS
+#endif
 #include <tbb/concurrent_map.h>
 #include <tbb/parallel_for.h>
 #ifdef SET_POINT_IDS_USING_MUTEX
@@ -1770,4 +1774,10 @@ autorefine(      TriangleMesh& tm,
 
 } } // end of CGAL::Polygon_mesh_processing
 
+#ifdef CGAL_LINKED_WITH_TBB
+#ifdef CGAL_HAS_DEFINED_TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS
+#undef TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS
+#endif
+#endif
+
 #endif // CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_H

From 79444410686379d50a24244ba300e52e6a8340f1 Mon Sep 17 00:00:00 2001
From: Puneet Matharu <puneet.matharu@hotmail.co.uk>
Date: Thu, 2 Nov 2023 18:06:24 +0000
Subject: [PATCH 0967/1398] Patch usage of BUILD_TESTING to handle the case
 that CGAL is a subproject.

---
 .github/workflows/cmake-all.yml                    |  4 ++--
 .../test/Arrangement_on_surface_2/cgal_test.cmake  | 14 +++++++-------
 CMakeLists.txt                                     | 10 +++++-----
 .../test/Circular_kernel_2/CMakeLists.txt          |  2 +-
 Installation/CMakeLists.txt                        |  6 +++---
 .../CGAL_CreateSingleSourceCGALProgram.cmake       |  2 +-
 Installation/cmake/modules/CGAL_add_test.cmake     |  4 ++--
 .../CGAL_enable_end_of_configuration_hook.cmake    |  2 +-
 Installation/test/Installation/CMakeLists.txt      |  2 +-
 .../test/Installation/cgal_test_with_cmake         |  2 +-
 Mesh_3/test/Mesh_3/CMakeLists.txt                  |  4 ++--
 Nef_3/test/Nef_3/CMakeLists.txt                    |  2 +-
 .../test/Polygon_mesh_processing/CMakeLists.txt    |  2 +-
 .../Plugins/Classification/CMakeLists.txt          |  2 +-
 .../Polyhedron/Plugins/Convex_hull/CMakeLists.txt  |  2 +-
 .../demo/Polyhedron/Plugins/PCA/CMakeLists.txt     |  2 +-
 .../demo/Polyhedron/Plugins/PMP/CMakeLists.txt     |  4 ++--
 .../Polyhedron/Plugins/Surface_mesh/CMakeLists.txt |  4 ++--
 .../Surface_mesh_deformation/CMakeLists.txt        |  2 +-
 .../demo/Polyhedron/polyhedron_demo_macros.cmake   |  2 +-
 Scripts/developer_scripts/run_testsuite_with_ctest |  6 +++---
 .../test/Snap_rounding_2/CMakeLists.txt            |  2 +-
 .../test/Surface_sweep_2/CMakeLists.txt            |  2 +-
 .../test/Triangulation_2/CMakeLists.txt            |  2 +-
 .../examples/Triangulation_3/CMakeLists.txt        |  2 +-
 .../test/Triangulation_3/CMakeLists.txt            |  4 ++--
 26 files changed, 46 insertions(+), 46 deletions(-)

diff --git a/.github/workflows/cmake-all.yml b/.github/workflows/cmake-all.yml
index b9e7226c62dd..b70418b16a34 100644
--- a/.github/workflows/cmake-all.yml
+++ b/.github/workflows/cmake-all.yml
@@ -17,7 +17,7 @@ jobs:
     - name: configure all
       run: |
         set -e
-        mkdir build && cd build && CXX=clang++ cmake -DWITH_examples=ON -DWITH_tests=ON -DWITH_demos=ON -DBUILD_TESTING=ON ..
+        mkdir build && cd build && CXX=clang++ cmake -DWITH_examples=ON -DWITH_tests=ON -DWITH_demos=ON -DCGAL_ENABLE_TESTING=ON ..
         ctest -L Installation -j $(getconf _NPROCESSORS_ONLN)
 
   cmake-testsuite-with-qt5:
@@ -31,5 +31,5 @@ jobs:
     - name: configure all
       run: |
         set -e
-        mkdir build && cd build && CXX=clang++ cmake -DWITH_examples=ON -DWITH_tests=ON -DWITH_demos=ON -DBUILD_TESTING=ON ..
+        mkdir build && cd build && CXX=clang++ cmake -DWITH_examples=ON -DWITH_tests=ON -DWITH_demos=ON -DCGAL_ENABLE_TESTING=ON ..
         ctest -L Installation -j $(getconf _NPROCESSORS_ONLN)
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
index 783ba994ab88..6ce6ad5b5d30 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
@@ -160,16 +160,16 @@ function(cgal_arr_2_add_target exe_name source_file)
   target_compile_options(${name} PRIVATE ${flags})
   cgal_debug_message(STATUS "#      -> target ${name} with TESTSUITE_CXXFLAGS: ${flags}")
 
-  if(BUILD_TESTING)
+  if(CGAL_ENABLE_TESTING)
     cgal_add_compilation_test(${name})
-  endif(BUILD_TESTING)
+  endif(CGAL_ENABLE_TESTING)
 
   # Add a compatibility-mode with the shell script `cgal_test_base`
   if(NOT TARGET ${exe_name})
     create_single_source_cgal_program( "${source_file}" NO_TESTING)
-    if(BUILD_TESTING)
+    if(CGAL_ENABLE_TESTING)
       cgal_add_compilation_test(${exe_name})
-    endif(BUILD_TESTING)
+    endif(CGAL_ENABLE_TESTING)
   endif()
 endfunction()
 
@@ -182,7 +182,7 @@ endfunction()
 function(run_test_with_flags)
   # ${ARGV0} - executable name
   # ${ARGV1} - test substring name
-  if(NOT BUILD_TESTING)
+  if(NOT CGAL_ENABLE_TESTING)
     return()
   endif()
   cgal_debug_message(STATUS "# run_test_with_flags(${ARGN})")
@@ -190,7 +190,7 @@ function(run_test_with_flags)
 endfunction()
 
 function(run_test_alt name datafile)
-  if(NOT BUILD_TESTING)
+  if(NOT CGAL_ENABLE_TESTING)
     return()
   endif()
   if(suffix)
@@ -214,7 +214,7 @@ function(compile_and_run)
   cgal_debug_message(STATUS "# compile_and_run(${ARGN})")
 #  message("   successful compilation of ${name}")
   cgal_arr_2_add_target(${name} ${name}.cpp)
-  if(BUILD_TESTING)
+  if(CGAL_ENABLE_TESTING)
     cgal_add_test(${name})
   endif()
 endfunction()
diff --git a/CMakeLists.txt b/CMakeLists.txt
index f021ea345f3b..d6c175594acc 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -46,14 +46,14 @@ option(
 
 message("== CMake setup (DONE) ==\n")
 
-# Enable testing with BUILD_TESTING
-option(BUILD_TESTING "Build the testing tree." OFF)
-if(BUILD_TESTING AND NOT POLICY CMP0064)
+# Enable testing with CGAL_ENABLE_TESTING
+option(CGAL_ENABLE_TESTING "Build the testing tree." OFF)
+if(CGAL_ENABLE_TESTING AND NOT POLICY CMP0064)
   message(
     FATAL_ERROR "CGAL support of CTest requires CMake version 3.4 or later.
-The variable BUILD_TESTING must be set of OFF.")
+The variable CGAL_ENABLE_TESTING must be set of OFF.")
 endif()
-if(BUILD_TESTING)
+if(CGAL_ENABLE_TESTING)
   enable_testing()
 endif()
 
diff --git a/Circular_kernel_2/test/Circular_kernel_2/CMakeLists.txt b/Circular_kernel_2/test/Circular_kernel_2/CMakeLists.txt
index c59104595f13..84c04f4accec 100644
--- a/Circular_kernel_2/test/Circular_kernel_2/CMakeLists.txt
+++ b/Circular_kernel_2/test/Circular_kernel_2/CMakeLists.txt
@@ -22,7 +22,7 @@ create_single_source_cgal_program("test_Line_arc.cpp")
 create_single_source_cgal_program("test_Circular_kernel_basic.cpp")
 create_single_source_cgal_program("test_Exact_circular_kernel_basic.cpp")
 
-if(BUILD_TESTING)
+if(CGAL_ENABLE_TESTING)
   set_tests_properties(
     "execution   of  test_Circular_kernel_basic"
     "execution   of  test_Exact_circular_kernel_basic"
diff --git a/Installation/CMakeLists.txt b/Installation/CMakeLists.txt
index 00ce9e422dee..5fea17ecb9ac 100644
--- a/Installation/CMakeLists.txt
+++ b/Installation/CMakeLists.txt
@@ -105,9 +105,9 @@ else(CGAL_BRANCH_BUILD)
       "${CGAL_SOURCE_DIR}"
       CACHE INTERNAL "Directory containing the GraphicsView package")
 
-  # Enable testing with BUILD_TESTING
-  option(BUILD_TESTING "Build the testing tree." OFF)
-  if(BUILD_TESTING)
+  # Enable testing with CGAL_ENABLE_TESTING
+  option(CGAL_ENABLE_TESTING "Build the testing tree." OFF)
+  if(CGAL_ENABLE_TESTING)
     enable_testing()
   endif()
 endif(CGAL_BRANCH_BUILD)
diff --git a/Installation/cmake/modules/CGAL_CreateSingleSourceCGALProgram.cmake b/Installation/cmake/modules/CGAL_CreateSingleSourceCGALProgram.cmake
index 1eb308fbe1cc..2a9fdc4bd870 100644
--- a/Installation/cmake/modules/CGAL_CreateSingleSourceCGALProgram.cmake
+++ b/Installation/cmake/modules/CGAL_CreateSingleSourceCGALProgram.cmake
@@ -53,7 +53,7 @@ function(create_single_source_cgal_program firstfile )
 
     get_directory_property(folder_NO_TESTING CGAL_NO_TESTING)
 
-    if(folder_NO_TESTING OR NOT BUILD_TESTING)
+    if(folder_NO_TESTING OR NOT CGAL_ENABLE_TESTING)
       set(NO_TESTING TRUE)
     endif()
 
diff --git a/Installation/cmake/modules/CGAL_add_test.cmake b/Installation/cmake/modules/CGAL_add_test.cmake
index 0591b7266d60..1f2d35ade0c7 100644
--- a/Installation/cmake/modules/CGAL_add_test.cmake
+++ b/Installation/cmake/modules/CGAL_add_test.cmake
@@ -3,9 +3,9 @@ if(CGAL_add_test_included)
 endif(CGAL_add_test_included)
 set(CGAL_add_test_included TRUE)
 
-option(BUILD_TESTING "Build the testing tree." OFF)
+option(CGAL_ENABLE_TESTING "Build the testing tree." OFF)
 
-if(BUILD_TESTING)
+if(CGAL_ENABLE_TESTING)
   enable_testing()
 endif()
 
diff --git a/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake b/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
index 81f62d9aab45..a5b7228c7e1b 100644
--- a/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
+++ b/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
@@ -119,7 +119,7 @@ endfunction()
 function(CGAL_hooks_at_end_of_all_directories)
   CGAL_hook_check_targets()
   CGAL_hook_check_unused_cpp_files()
-  if(BUILD_TESTING)
+  if(CGAL_ENABLE_TESTING)
     CGAL_hook_fix_ctest_depending_on_Qt5()
   endif()
 endfunction()
diff --git a/Installation/test/Installation/CMakeLists.txt b/Installation/test/Installation/CMakeLists.txt
index ad6166865a1f..250745d841eb 100644
--- a/Installation/test/Installation/CMakeLists.txt
+++ b/Installation/test/Installation/CMakeLists.txt
@@ -43,7 +43,7 @@ create_single_source_cgal_program("deprecation_warning.cpp")
 create_single_source_cgal_program("test_use_h.cpp")
 
 create_single_source_cgal_program(will_fail.cpp will_fail_aux.cpp)
-if(BUILD_TESTING)
+if(CGAL_ENABLE_TESTING)
   set_property(TEST "execution   of  will_fail" PROPERTY WILL_FAIL TRUE)
 endif()
 
diff --git a/Installation/test/Installation/cgal_test_with_cmake b/Installation/test/Installation/cgal_test_with_cmake
index 728cf75d3494..afafb02d7d7c 100755
--- a/Installation/test/Installation/cgal_test_with_cmake
+++ b/Installation/test/Installation/cgal_test_with_cmake
@@ -27,7 +27,7 @@ echo "Configuring... "
 mkdir build_dir
 cd build_dir
 if eval 'cmake --no-warn-unused-cli ${INIT_FILE:+"-C${INIT_FILE}"} -DRUNNING_CGAL_AUTO_TEST=TRUE  \
-                                   -DCGAL_DIR="$CGAL_RELEASE_DIR" -DBUILD_TESTING=ON -DWITH_tests=ON \
+                                   -DCGAL_DIR="$CGAL_RELEASE_DIR" -DCGAL_ENABLE_TESTING=ON -DWITH_tests=ON \
                                    ..' ; then
 
   echo "   successful configuration" >> ../$ERRORFILE
diff --git a/Mesh_3/test/Mesh_3/CMakeLists.txt b/Mesh_3/test/Mesh_3/CMakeLists.txt
index b0e9e250c27a..331caddbdd1a 100644
--- a/Mesh_3/test/Mesh_3/CMakeLists.txt
+++ b/Mesh_3/test/Mesh_3/CMakeLists.txt
@@ -112,7 +112,7 @@ if(TARGET CGAL::TBB_support)
     endif()
   endforeach()
 
-  if(BUILD_TESTING)
+  if(CGAL_ENABLE_TESTING)
     set_property(TEST
       "execution   of  test_meshing_verbose"
       "execution   of  test_meshing_polyhedron_with_features"
@@ -141,7 +141,7 @@ if(TARGET ITT::ITT)
   target_compile_definitions(test_meshing_verbose PRIVATE CGAL_MESH_3_USE_INTEL_ITT)
 endif()
 
-if(BUILD_TESTING)
+if(CGAL_ENABLE_TESTING)
   set_tests_properties(
     "execution   of  test_meshing_polyhedron_with_features"
     "execution   of  test_meshing_verbose"
diff --git a/Nef_3/test/Nef_3/CMakeLists.txt b/Nef_3/test/Nef_3/CMakeLists.txt
index 4e41d32b5c2d..fce9d8ba6357 100644
--- a/Nef_3/test/Nef_3/CMakeLists.txt
+++ b/Nef_3/test/Nef_3/CMakeLists.txt
@@ -17,7 +17,7 @@ foreach(cppfile ${cppfiles})
   create_single_source_cgal_program("${cppfile}")
 endforeach()
 
-if(BUILD_TESTING)
+if(CGAL_ENABLE_TESTING)
   set_tests_properties(
     "execution   of  Nef_3_problematic_construction"
     "execution   of  test_nef_3_io_Cartesian"
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index eb9b98cbe593..23c18dd0a2a1 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -125,7 +125,7 @@ else()
   message(STATUS "NOTICE: Tests are not using Ceres.")
 endif()
 
-if(BUILD_TESTING)
+if(CGAL_ENABLE_TESTING)
   set_tests_properties(
     "execution   of  triangulate_hole_Polyhedron_3_no_delaunay_test"
     "execution   of  triangulate_hole_Polyhedron_3_test"
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Classification/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Classification/CMakeLists.txt
index f70698d872cf..cab6d3f546de 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Classification/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Classification/CMakeLists.txt
@@ -41,7 +41,7 @@ if(TARGET CGAL::Eigen3_support)
     scene_color_ramp
     CGAL::Eigen3_support)
 
-    if(BUILD_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
+    if(CGAL_ENABLE_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
       set_tests_properties(
         "compilation of  classification_plugin"
         PROPERTIES RESOURCE_LOCK Selection_test_resources)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Convex_hull/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Convex_hull/CMakeLists.txt
index 0bbbd3633451..9897d0bb7894 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Convex_hull/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Convex_hull/CMakeLists.txt
@@ -10,7 +10,7 @@ polyhedron_demo_plugin(kernel_plugin Kernel_plugin)
 target_link_libraries(kernel_plugin PUBLIC scene_surface_mesh_item)
 
 
-if(BUILD_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
+if(CGAL_ENABLE_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
   set_tests_properties(
     "compilation of  convex_hull_plugin"
     PROPERTIES RESOURCE_LOCK Selection_test_resources)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/PCA/CMakeLists.txt
index dc58f28947f2..76a427bf9b13 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/CMakeLists.txt
@@ -42,7 +42,7 @@ target_link_libraries(
   PUBLIC scene_surface_mesh_item scene_points_with_normal_item
          scene_polylines_item)
 
-     if(BUILD_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
+     if(CGAL_ENABLE_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
        set_tests_properties(
          "compilation of  create_obb_mesh_plugin"
          PROPERTIES RESOURCE_LOCK Selection_test_resources)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
index 152d84952ae7..b3881484acce 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/CMakeLists.txt
@@ -54,7 +54,7 @@ if(TARGET CGAL::Eigen3_support)
                            ${remeshPlanarPatchesUI_FILES} KEYWORDS PMP)
     target_link_libraries(remesh_planar_patches_plugin PUBLIC scene_surface_mesh_item CGAL::Eigen3_support)
 
-    if(BUILD_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
+    if(CGAL_ENABLE_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
       set_tests_properties(
         "compilation of  extrude_plugin"
         "compilation of  fairing_plugin"
@@ -159,7 +159,7 @@ target_link_libraries(
   engrave_text_plugin PUBLIC scene_surface_mesh_item scene_selection_item
                              scene_polylines_item)
 
-if(BUILD_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
+if(CGAL_ENABLE_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
   set_tests_properties(
     "compilation of  join_and_split_plugin"
     "compilation of  selection_plugin"
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
index 845dedbc31f3..69170d8aac73 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/CMakeLists.txt
@@ -16,7 +16,7 @@ if(NOT CGAL_DISABLE_GMP)
       parameterization_plugin PUBLIC scene_surface_mesh_item scene_textured_item
                                      scene_selection_item CGAL::Eigen3_support)
 
-    if(BUILD_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
+    if(CGAL_ENABLE_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
       set_tests_properties(
         "compilation of  parameterization_plugin"
         PROPERTIES RESOURCE_LOCK Selection_test_resources)
@@ -31,7 +31,7 @@ if(NOT CGAL_DISABLE_GMP)
                          ${segmentationUI_FILES})
   target_link_libraries(mesh_segmentation_plugin PUBLIC scene_surface_mesh_item)
 
-  if(BUILD_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
+  if(CGAL_ENABLE_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
     set_tests_properties(
       "compilation of  mesh_segmentation_plugin"
       PROPERTIES RESOURCE_LOCK Selection_test_resources)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/CMakeLists.txt
index ce9c7e682094..be671f51e784 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/CMakeLists.txt
@@ -6,7 +6,7 @@ if(TARGET CGAL::Eigen3_support AND "${EIGEN3_VERSION}" VERSION_GREATER "3.1.90")
   target_link_libraries(edit_plugin PUBLIC scene_surface_mesh_item
                                            scene_edit_item scene_selection_item)
 
-  if(BUILD_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
+  if(CGAL_ENABLE_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
     set_tests_properties(
       "compilation of  edit_plugin"
       PROPERTIES RESOURCE_LOCK Selection_test_resources)
diff --git a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
index 02cff1948ad8..9b17d621c07b 100644
--- a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
+++ b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
@@ -35,7 +35,7 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
     if(TARGET demo_framework)
       target_link_libraries( ${plugin_name} PUBLIC demo_framework)
       add_dependencies(${plugin_name} demo_framework)
-      if(BUILD_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
+      if(CGAL_ENABLE_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
         if(NOT TARGET "compilation_of__demo_framework")
               # This custom target is useless. It is used only as a flag to
               # detect that the test has already been created.
diff --git a/Scripts/developer_scripts/run_testsuite_with_ctest b/Scripts/developer_scripts/run_testsuite_with_ctest
index 43674242e987..1785c96e63b4 100644
--- a/Scripts/developer_scripts/run_testsuite_with_ctest
+++ b/Scripts/developer_scripts/run_testsuite_with_ctest
@@ -312,16 +312,16 @@ run_test_on_platform()
   if [ ! -f "${INIT_FILE}" ]; then
     echo "error NEED A INIT FILE !"
   fi
-  cmake ${INIT_FILE:+"-C${INIT_FILE}"} -DBUILD_TESTING=ON -DWITH_tests=ON -DCGAL_TEST_SUITE=ON $CGAL_DIR>installation.log 2>&1
+  cmake ${INIT_FILE:+"-C${INIT_FILE}"} -DCGAL_ENABLE_TESTING=ON -DWITH_tests=ON -DCGAL_TEST_SUITE=ON $CGAL_DIR>installation.log 2>&1
   rm CMakeCache.txt
   CMAKE_OPTS="-DCGAL_TEST_SUITE=ON -DCMAKE_VERBOSE_MAKEFILE=ON -DWITH_tests=ON"
   if [ -n "${SCRIPTS_DIR}" ]; then
     CMAKE_OPTS="${CMAKE_OPTS} -DWITH_examples=ON -DWITH_demos=ON"
   fi
   if [ -z "${SHOW_PROGRESS}" ]; then
-    cmake ${INIT_FILE:+"-C${INIT_FILE}"} -DBUILD_TESTING=ON ${CMAKE_OPTS} $CGAL_DIR  >package_installation.log 2>&1
+    cmake ${INIT_FILE:+"-C${INIT_FILE}"} -DCGAL_ENABLE_TESTING=ON ${CMAKE_OPTS} $CGAL_DIR  >package_installation.log 2>&1
   else
-    cmake ${INIT_FILE:+"-C${INIT_FILE}"} -DBUILD_TESTING=ON ${CMAKE_OPTS} $CGAL_DIR 2>&1 |tee package_installation.log
+    cmake ${INIT_FILE:+"-C${INIT_FILE}"} -DCGAL_ENABLE_TESTING=ON ${CMAKE_OPTS} $CGAL_DIR 2>&1 |tee package_installation.log
   fi
   LIST_TEST_FILE="${CGAL_HOME}/list_test_packages"
   if [ -f ${LIST_TEST_FILE} ]; then
diff --git a/Snap_rounding_2/test/Snap_rounding_2/CMakeLists.txt b/Snap_rounding_2/test/Snap_rounding_2/CMakeLists.txt
index 467b45ee861c..d243a9dd6e65 100644
--- a/Snap_rounding_2/test/Snap_rounding_2/CMakeLists.txt
+++ b/Snap_rounding_2/test/Snap_rounding_2/CMakeLists.txt
@@ -35,7 +35,7 @@ function(add_Snap_rounding_tests name)
   endforeach()
 endfunction(add_Snap_rounding_tests)
 
-if(BUILD_TESTING)
+if(CGAL_ENABLE_TESTING)
   cgal_add_compilation_test(test_snap_rounding_2)
   add_snap_rounding_tests(test_snap_rounding_2)
 endif()
diff --git a/Surface_sweep_2/test/Surface_sweep_2/CMakeLists.txt b/Surface_sweep_2/test/Surface_sweep_2/CMakeLists.txt
index da5748057b13..2c9363b2d681 100644
--- a/Surface_sweep_2/test/Surface_sweep_2/CMakeLists.txt
+++ b/Surface_sweep_2/test/Surface_sweep_2/CMakeLists.txt
@@ -31,7 +31,7 @@ endfunction()
 
 function(compile_and_run_sweep name source_file point_location traits data_set)
   compile(${ARGV})
-  if(NOT BUILD_TESTING)
+  if(NOT CGAL_ENABLE_TESTING)
     return()
   endif()
   cgal_add_compilation_test(${name})
diff --git a/Triangulation_2/test/Triangulation_2/CMakeLists.txt b/Triangulation_2/test/Triangulation_2/CMakeLists.txt
index 4d9078092373..ac024e2eefb6 100644
--- a/Triangulation_2/test/Triangulation_2/CMakeLists.txt
+++ b/Triangulation_2/test/Triangulation_2/CMakeLists.txt
@@ -17,7 +17,7 @@ foreach(cppfile ${cppfiles})
   create_single_source_cgal_program("${cppfile}")
 endforeach()
 
-if(BUILD_TESTING)
+if(CGAL_ENABLE_TESTING)
   set_tests_properties(
     "execution   of  test_constrained_triangulation_2"
     "execution   of  test_delaunay_triangulation_2"
diff --git a/Triangulation_3/examples/Triangulation_3/CMakeLists.txt b/Triangulation_3/examples/Triangulation_3/CMakeLists.txt
index 4cd1bb015aff..ec3e8e06c082 100644
--- a/Triangulation_3/examples/Triangulation_3/CMakeLists.txt
+++ b/Triangulation_3/examples/Triangulation_3/CMakeLists.txt
@@ -42,7 +42,7 @@ if(TARGET CGAL::TBB_support)
   target_link_libraries(parallel_insertion_in_delaunay_3 PUBLIC CGAL::TBB_support)
   target_link_libraries(sequential_parallel PUBLIC CGAL::TBB_support)
 
-  if(BUILD_TESTING)
+  if(CGAL_ENABLE_TESTING)
     set_property(TEST
       "execution   of  parallel_insertion_and_removal_in_regular_3"
       "execution   of  parallel_insertion_in_delaunay_3"
diff --git a/Triangulation_3/test/Triangulation_3/CMakeLists.txt b/Triangulation_3/test/Triangulation_3/CMakeLists.txt
index 709d2f6d1333..4998791123e5 100644
--- a/Triangulation_3/test/Triangulation_3/CMakeLists.txt
+++ b/Triangulation_3/test/Triangulation_3/CMakeLists.txt
@@ -50,7 +50,7 @@ if(TARGET CGAL::TBB_support)
     target_link_libraries(${target} PUBLIC CGAL::TBB_support)
   endforeach()
 
-  if(BUILD_TESTING)
+  if(CGAL_ENABLE_TESTING)
     set_property(TEST
       "execution   of  test_delaunay_3"
       "execution   of  test_regular_3"
@@ -61,7 +61,7 @@ else()
   message(STATUS "NOTICE: The TBB library was not found. Some tests will not be available.")
 endif()
 
-if(BUILD_TESTING)
+if(CGAL_ENABLE_TESTING)
   set_tests_properties(
     "execution   of  test_delaunay_hierarchy_3"
     "execution   of  test_delaunay_hierarchy_3_old"

From b6d770f30b2f0442dbdb9eecddb7bcaca868a97f Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 3 Nov 2023 09:05:17 +0100
Subject: [PATCH 0968/1398] add data for Mesh_3 test manifold_and_min_size

---
 .../Intersection12.off                        |  821 ++
 .../Intersection23.off                        |  833 ++
 .../polyhedral_complex_of_spheres/Sphere1.off | 6626 +++++++++++++++
 .../polyhedral_complex_of_spheres/Sphere2.off | 7185 +++++++++++++++++
 .../polyhedral_complex_of_spheres/Sphere3.off | 6735 +++++++++++++++
 5 files changed, 22200 insertions(+)
 create mode 100644 Data/data/meshes/polyhedral_complex_of_spheres/Intersection12.off
 create mode 100644 Data/data/meshes/polyhedral_complex_of_spheres/Intersection23.off
 create mode 100644 Data/data/meshes/polyhedral_complex_of_spheres/Sphere1.off
 create mode 100644 Data/data/meshes/polyhedral_complex_of_spheres/Sphere2.off
 create mode 100644 Data/data/meshes/polyhedral_complex_of_spheres/Sphere3.off

diff --git a/Data/data/meshes/polyhedral_complex_of_spheres/Intersection12.off b/Data/data/meshes/polyhedral_complex_of_spheres/Intersection12.off
new file mode 100644
index 000000000000..76557b56a72f
--- /dev/null
+++ b/Data/data/meshes/polyhedral_complex_of_spheres/Intersection12.off
@@ -0,0 +1,821 @@
+NOFF
+331 486 0
+
+0.7543766356118875 0.43510778217590995 -0.23778877920326758  -0.25098113386125442 -0.57611676249591892 0.77788041909855277
+0.74416681593888767 0.37811394098752249 -0.28711353530938599  -0.26123864468751851 -0.63469945426951124 0.72726265769102505
+0.81085466860836364 0.38791883075529854 -0.25839317298936149  -0.19358827458119576 -0.62484261256047735 0.75636980999592562
+0.23484719550275523 0.42236282692723082 -0.79683385603280099  -0.78085960551688738 -0.58928970592655849 0.20735457304096572
+0.22882364378366471 0.45886020497699476 -0.73008380957164554  -0.78691259802683167 -0.55218785652865787 0.27542173873706588
+0.19177788682311969 0.48472204902454452 -0.79587834752179276  -0.8248245035506494 -0.52568280774650544 0.20813967421463764
+0.28832514482274552 0.57052582071169811 -0.48089420169576869  -0.72592006295091105 -0.43849581670457061 0.52986930552536926
+0.33020050982234728 0.50638270952520359 -0.48220601248944894  -0.6837079082305223 -0.5033061399972395 0.52841879760671162
+0.34172502430316598 0.55775866770488691 -0.42424253336914886  -0.67165289641182357 -0.45152335920120623 0.58737470394737512
+0.54881477307315141 0.17578736338136591 -0.72160204626986268  -0.46019616855581241 -0.84103034646625352 0.28440717777405633
+0.60674851766146465 0.16310183281189838 -0.67541606725572378  -0.40118660278746826 -0.85394740027497851 0.3313957563208314
+0.54374625724929748 0.20493337999462402 -0.6534432341171178  -0.4655048671593241 -0.8112190206795088 0.35387698305874415
+0.194653418534527 0.60701517323697041 -0.60328875784028047  -0.82172156155092013 -0.40115992505181969 0.40477696304846167
+0.16310183281189838 0.67541606725572378 -0.60674851766146465  -0.85394740027497895 -0.33139575632083074 0.40118660278746782
+0.15494158249918433 0.63155843766247499 -0.6675438583011275  -0.86229745711633776 -0.37608264246842488 0.33912378489965056
+0.61677884992242127 0.77652668866688823 -0.1269941119120791  -0.38585850377001185 -0.25115833516475705 0.88771206240854661
+0.6121850337924204 0.78019791562438101 -0.12795219708842923  -0.40347958770451747 -0.2408461695144006 0.88272155572186706
+0.58998070131491009 0.7308249227963397 -0.15157265925820684  -0.41835586417422205 -0.27447137325094889 0.8658197480866201
+0.60328875784028035 0.19465341853452689 -0.60701517323697041  -0.40477696304846306 -0.82172156155091958 0.40115992505181941
+0.66754385830112761 0.15494158249918422 -0.6315584376624751  -0.33912378489965 -0.86229745711633854 0.37608264246842382
+0.38578733356857997 0.49474798580051771 -0.42740659928482283  -0.62647295099493594 -0.51565247738810516 0.58449479401890869
+0.80387442246342544 0.33342289586318663 -0.30890686439776815  -0.20029565457621235 -0.68040299513329272 0.70493504308661736
+0.73719191275168683 0.32448937007110357 -0.34044158853824891  -0.26836446324215074 -0.68937955050281274 0.67285685715261323
+0.37662182205162742 0.44468510739264255 -0.4867505311193725  -0.63632626043050522 -0.56632219140540241 0.52380155193385169
+0.67817235393879538 0.37219775365464591 -0.3197858383461637  -0.32871571883365086 -0.64057192708348321 0.6939838488208705
+0.68833716584422411 0.42830047444496377 -0.26758896083815364  -0.31837608818572133 -0.58341134180693566 0.74717325482286145
+0.48751950377457764 0.21949717894867493 -0.70237760951254313  -0.52285425410030584 -0.79638679287412917 0.30395970967362079
+0.33342289586318652 0.30890686439776804 -0.80387442246342533  -0.68040299513329283 -0.70493504308661725 0.20029565457621235
+0.34663877975122226 0.28109386699234573 -0.87079826704332097  -0.66711974931205642 -0.73311225719230455 0.13227871496285135
+0.38791883075529854 0.25839317298936149 -0.81085466860836364  -0.62484261256047635 -0.7563698099959264 0.19358827458119621
+0.32266080240935691 0.45887453700173475 -0.54305925471438132  -0.69097715483087263 -0.55222595833073063 0.46647300291392874
+0.27854118464368072 0.52177412017159019 -0.54043805030551129  -0.73602315194220436 -0.48809649929758547 0.4690753960489773
+0.66033202687554549 0.73295414361857025 -0.120390894417848  -0.34672764240956921 -0.27221405186827935 0.8975964861531911
+0.66305236795085609 0.73862883390665335 -0.11792173385748356  -0.33091024020139254 -0.23862737818778135 0.91299254504573157
+0.65013123053773547 0.74924502909339952 -0.12021569384478618  -0.36748531964496783 -0.23977066491305971 0.89859032272364525
+0.3329730441306975 0.86688049898359798 -0.29448299907594322  -0.68041269101920487 -0.13609530337963727 0.72008099426245697
+0.28109386699234573 0.87079826704332097 -0.34663877975122226  -0.73311225719230455 -0.13227871496285276 0.6671197493120562
+0.30890686439776815 0.80387442246342544 -0.33342289586318663  -0.70493504308661736 -0.20029565457621229 0.68040299513329272
+0.37763360430690207 0.89031208027748232 -0.25188956429094089  -0.63913636447117517 -0.10365825365837174 0.76207589783371688
+0.38906581543970098 0.86449179145637545 -0.24581371826786724  -0.62320039727703724 -0.13836216352689484 0.76972539034249077
+0.26758896083815364 0.68833716584422411 -0.42830047444496377  -0.74717325482286145 -0.31837608818572133 0.58341134180693566
+0.28711353530938599 0.74416681593888767 -0.37811394098752249  -0.72726265769102505 -0.26123864468751851 0.63469945426951124
+0.23778877920326758 0.7543766356118875 -0.43510778217590995  -0.77788041909855277 -0.25098113386125442 0.57611676249591892
+0.25144044466552118 0.63593257766966582 -0.48278292360441799  -0.76364675610270605 -0.37176976328896033 0.52785497534633929
+0.23918763497858653 0.58691160345630577 -0.54073697963859202  -0.77616877106981585 -0.42177409750733486 0.46868822204941857
+0.66309584332239968 0.73859273426435279 -0.11791670171500288  -0.31277536903781777 -0.24890531892608236 0.91663390223881769
+0.23131618639376361 0.54069649116233642 -0.60179718550820993  -0.78424095119900905 -0.46877433341208891 0.40646863937642869
+0.83663689274508746 0.50393156097935532 -0.17076625792504019  -0.16746624198175153 -0.5059383111947604 0.84615689033529906
+0.85321734737321941 0.48823773095257161 -0.17791687149582575  -0.14218930946431363 -0.53087421189741091 0.83543687458500693
+0.84527243958550158 0.50534202492392921 -0.16859355460826972  -0.13337026124727985 -0.50082503649440957 0.85521146872291509
+0.18894401454864007 0.56326642977303365 -0.66555721401063139  -0.82760959526572664 -0.44564173451716838 0.34127086350966085
+0.16851360390451708 0.5059938921163909 -0.84582765048432262  -0.84145097432228078 -0.5115273725441013 0.17406896607440508
+0.17116987629986469 0.50112519727619198 -0.84800457692533193  -0.83349120264032472 -0.52781055754245743 0.16342714116053544
+0.49459829134159439 0.19246164044552572 -0.77010674056590323  -0.5156231815186233 -0.82387113061171735 0.23530638500725742
+0.55569157508051703 0.15189213403566626 -0.79094720467070556  -0.4530882925139989 -0.86539097215515881 0.21403145679805585
+0.42424253336914886 0.34172502430316598 -0.55775866770488691  -0.58737470394737501 -0.67165289641182346 0.45152335920120668
+0.3713193261111345 0.39873225090399556 -0.54873765482186954  -0.64149399833800957 -0.61382359089386285 0.46011525660260116
+0.36991837160270158 0.35691197974999433 -0.61291481587751639  -0.64279095563231359 -0.65613064511909636 0.39536358442944075
+0.33677331501517244 0.28707208578415278 -0.89617895883531995  -0.67452766723137503 -0.73279395097326627 0.089584884642385607
+0.34835979735444111 0.27649633775399213 -0.89544715323589474  -0.67452766723137458 -0.73279395097326738 0.089584884642381388
+0.70206746101856976 0.6710461359539861 -0.12625772819138759  -0.30422052318316622 -0.33550256744406737 0.89156486051918815
+0.6315584376624751 0.66754385830112761 -0.15494158249918422  -0.37608264246842482 -0.33912378489965067 0.86229745711633787
+0.20493337999462402 0.6534432341171178 -0.54374625724929748  -0.81121902067950913 -0.35387698305874443 0.46550486715932315
+0.57052582071169811 0.48089420169576869 -0.28832514482274552  -0.43849581670457061 -0.52986930552536926 0.72592006295091105
+0.58691160345630577 0.54073697963859213 -0.23918763497858664  -0.4217740975073348 -0.46868822204941851 0.77616877106981597
+0.52177412017159019 0.54043805030551129 -0.27854118464368072  -0.4880964992975842 -0.46907539604897647 0.73602315194220569
+0.52277287854647114 0.72978602950671356 -0.18781856417458553  -0.48692804957249181 -0.27563277583938878 0.82881098413486431
+0.45886020497699476 0.73008380957164554 -0.22882364378366471  -0.55218785652865776 -0.27542173873706688 0.78691259802683133
+0.49804426762820242 0.6650456856281145 -0.22783029713491565  -0.51223335844459539 -0.34188293456237356 0.787866134283985
+0.30220034825124553 0.62265094488008987 -0.42460158444828167  -0.71231212670919675 -0.3845705542759712 0.58712598556603979
+0.66886984046648634 0.73334447965428895 -0.11737161430462231  -0.30990719304796133 -0.27087574504909673 0.91136373772562973
+0.67480921403038341 0.72790861885278146 -0.11711592517486362  -0.3068782679831476 -0.29270566773562062 0.90562084821138478
+0.7308249227963397 0.15157265925820684 -0.58998070131491009  -0.27447137325094884 -0.86581974808661999 0.41835586417422199
+0.79622199346122757 0.15327245833771197 -0.55063712409498888  0.11143127652206664 -0.5462728554716807 0.83016205525636932
+0.72978602950671356 0.18781856417458553 -0.52277287854647114  -0.27563277583938744 -0.82881098413486465 0.48692804957249192
+0.21949717894867493 0.70237760951254313 -0.48751950377457764  -0.79638679287412906 -0.30395970967362079 0.52285425410030573
+0.16859355460826972 0.84527243958550158 -0.50534202492392921  -0.85521146872291509 -0.13337026124727985 0.50082503649440957
+0.16718041590241167 0.84386234521524095 -0.50828765077834703  -0.86526167125339337 -0.13902973540250266 0.48165648852028864
+0.17076625792504019 0.83663689274508746 -0.50393156097935532  -0.84615689033529906 -0.16746624198175153 0.5059383111947604
+0.31922707014459717 0.41525708906780423 -0.6062691959083808  -0.69455121880115744 -0.5966714298400102 0.40197239864759926
+0.27291559350329064 0.47669360004206351 -0.60263533424272331  -0.74178975530654778 -0.53404105644655731 0.40564529943251781
+0.27152141395867613 0.43543783887197085 -0.66685061023366288  -0.74324570666303824 -0.57610127698437386 0.34013694034011471
+0.14509843055414051 0.55935332483523337 -0.81537692950694307  -0.53077402771795057 -0.83361988814005983 -0.15282936104498543
+0.15327245833771197 0.55063712409498888 -0.79622199346122757  -0.54669933216720379 -0.82946371429884458 -0.11449797757820061
+0.14509843055414046 0.55935332483523337 -0.81537692950694307  -0.54699716260005027 -0.82500541278991668 -0.14198652391981875
+0.42460158444828167 0.30220034825124553 -0.62265094488008987  -0.58712598556603979 -0.71231212670919675 0.3845705542759712
+0.48089420169576869 0.28832514482274552 -0.57052582071169811  -0.52986930552536926 -0.72592006295091105 0.43849581670457061
+0.3197858383461637 0.67817235393879538 -0.37219775365464591  -0.6939838488208705 -0.32871571883365086 0.64057192708348321
+0.12625772819138759 0.70206746101856976 -0.6710461359539861  -0.89156486051918737 -0.30422052318316639 0.33550256744406953
+0.13684746659412272 0.74566822600279203 -0.61182084959332417  -0.88070834559541789 -0.2598848257066434 0.39599581735923622
+0.19079270763906322 0.46535820959984769 -0.86344103623700996  -0.83662429167606578 -0.52971449507546198 0.13950752053014723
+0.19867800845978539 0.45162969623720939 -0.86929523101799799  -0.83034168959693988 -0.54729298896538514 0.10489548487248543
+0.20106900651413739 0.4491139872592852 -0.86349407113854104  -0.8154158644589895 -0.56187930322158219 0.13924301275047238
+0.55775866770488669 0.42424253336914874 -0.34172502430316587  -0.45152335920120668 -0.5873747039473749 0.67165289641182357
+0.50638270952520359 0.48220601248944894 -0.33020050982234728  -0.5033061399972405 -0.5284187976067114 0.68370790823052174
+0.49474798580051771 0.42740659928482294 -0.38578733356857997  -0.51565247738810616 -0.58449479401890925 0.62647295099493439
+0.35691197974999433 0.61291481587751639 -0.36991837160270158  -0.65613064511909636 -0.39536358442944081 0.64279095563231359
+0.87604956907685072 0.40074783475520082 -0.23453730781743154  -0.12697533232365851 -0.61194488891504917 0.7806412222731034
+0.82089742115417219 0.4448828382530976 -0.21249304575461847  -0.1809544666175604 -0.52197712123390316 0.83354385962558752
+0.48823773095257161 0.17791687149582575 -0.85321734737321941  -0.53087421189740946 -0.83543687458500782 0.14218930946431385
+0.50534202492392921 0.16859355460826975 -0.84527243958550158  -0.50082503649441779 -0.85521146872291109 0.1333702612472748
+0.50393156097935532 0.17076625792504019 -0.83663689274508746  -0.50593831119475963 -0.84615689033529973 0.16746624198175047
+0.22783029713491565 0.49804426762820242 -0.6650456856281145  -0.78786613428398511 -0.51223335844459539 0.34188293456237351
+0.4867505311193725 0.37662182205162742 -0.44468510739264255  -0.52380155193385225 -0.63632626043050455 0.56632219140540263
+0.48220601248944894 0.33020050982234728 -0.50638270952520359  -0.52841879760671218 -0.6837079082305223 0.50330613999723894
+0.54305925471438132 0.3226608024093568 -0.45887453700173464  -0.46647300291392874 -0.69097715483087263 0.55222595833073085
+0.39873225090399556 0.54873765482186954 -0.3713193261111345  -0.61382359089386385 -0.46011525660260016 0.64149399833800924
+0.25839317298936149 0.81085466860836364 -0.38791883075529854  -0.75636980999592562 -0.19358827458119576 0.62484261256047735
+0.18781856417458553 0.52277287854647114 -0.72978602950671356  -0.82881098413486431 -0.48692804957249181 0.27563277583938878
+0.81537692950694307 0.14509843055414046 -0.55935332483523337  0.13893839354958223 -0.54662188402952105 0.82577275245546711
+0.81537692950694307 0.14509843055414051 -0.55935332483523337  0.14982263298494042 -0.53042608529865665 0.83438680878846727
+0.54073697963859202 0.23918763497858653 -0.58691160345630577  -0.46868822204941857 -0.77616877106981585 0.42177409750733486
+0.48278292360441799 0.25144044466552118 -0.63593257766966582  -0.52785497534633929 -0.76364675610270605 0.37176976328896033
+0.41525708906780423 0.6062691959083808 -0.31922707014459717  -0.59667142984001054 -0.40197239864759837 0.69455121880115778
+0.6728298875984875 0.11747817726746855 -0.72952718400936922  -0.33340690397516509 -0.904068372598963 0.26739523938910698
+0.6710461359539861 0.12625772819138759 -0.70206746101856976  -0.3355025674440677 -0.89156486051918793 0.30422052318316667
+0.61182084959332406 0.1368474665941225 -0.74566822600279192  -0.3959958173592375 -0.88070834559541711 0.25988482570664406
+0.45887453700173464 0.54305925471438132 -0.3226608024093568  -0.55222595833073085 -0.46647300291392874 0.69097715483087263
+0.63593257766966582 0.48278292360441799 -0.25144044466552118  -0.37176976328896066 -0.52785497534633841 0.76364675610270649
+0.62265094488008987 0.42460158444828167 -0.30220034825124553  -0.3845705542759712 -0.58712598556603979 0.71231212670919675
+0.86688049898359798 0.29448299907594322 -0.3329730441306975  -0.13609530337963627 -0.72008099426245742 0.68041269101920454
+0.89636075196488652 0.33255046319168835 -0.29093694366030731  -0.10033016823458282 -0.68572398718656735 0.72091363611668269
+0.87079826704332097 0.34663877975122226 -0.28109386699234573  -0.13227871496285351 -0.6671197493120562 0.73311225719230444
+0.37219775365464591 0.3197858383461637 -0.67817235393879538  -0.64057192708348321 -0.6939838488208705 0.32871571883365086
+0.31986574707487569 0.37569356384004582 -0.67127690715856303  -0.69398814937561693 -0.63692575831934406 0.33571718293160824
+0.32448937007110357 0.34044158853824891 -0.73719191275168683  -0.68937955050281241 -0.67285685715261301 0.26836446324215207
+0.54069649116233642 0.60179718550820993 -0.23131618639376361  -0.46877433341208941 -0.40646863937643002 0.78424095119900816
+0.60701517323697041 0.60328875784028035 -0.19465341853452689  -0.40115992505181969 -0.40477696304846172 0.82172156155092013
+0.23850243715387073 0.88643041244943777 -0.39433212071905294  -0.76918721291849945 -0.09659658711841787 0.63168040245027779
+0.23453730781743154 0.87604956907685072 -0.40074783475520082  -0.78064122227310317 -0.12697533232365765 0.61194488891504961
+0.44468510739264255 0.4867505311193725 -0.37662182205162742  -0.56632219140540263 -0.52380155193385225 0.63632626043050455
+0.42740659928482294 0.38578733356857997 -0.49474798580051771  -0.58449479401890869 -0.62647295099493583 0.51565247738810516
+0.120390894417848 0.66033202687554549 -0.73295414361857025  -0.89759648615319021 -0.34672764240956944 0.27221405186828185
+0.11792173385748358 0.66305236795085598 -0.73862883390665335  -0.91299254504582916 -0.33091024020093185 0.23862737818804663
+0.12021569384478618 0.65013123053773569 -0.74924502909339907  -0.89859032272364481 -0.36748531964496806 0.23977066491306137
+0.28707208578415266 0.89617895883531973 -0.33677331501517238  -0.73279395097326361 -0.089584884642392407 0.67452766723137714
+0.27649633775399207 0.89544715323589452 -0.34835979735444111  -0.73279395097327316 -0.089584884642385398 0.67452766723136759
+0.43419673619416665 0.43419673619416677 -0.43419673619416677  -0.5770272532621572 -0.57739733617063249 0.57762605998672512
+0.6534432341171178 0.54374625724929748 -0.20493337999462402  -0.35387698305874393 -0.46550486715932382 0.81121902067950891
+0.67541606725572378 0.60674851766146465 -0.16310183281189838  -0.33139575632083113 -0.40118660278746965 0.85394740027497795
+0.27455903153809769 0.39781956250172623 -0.73257875557195395  -0.74028370995146897 -0.61436698850995353 0.27300775118977894
+0.28216458491718832 0.36370573544997109 -0.79939609736192763  -0.73258235910830072 -0.64913355914122617 0.20481384113375034
+0.73257875557195395 0.27455903153809769 -0.39781956250172623  -0.27300775118977899 -0.74028370995146897 0.61436698850995353
+0.79939609736192763 0.28216458491718832 -0.36370573544997109  -0.20481384113375128 -0.73258235910829894 0.64913355914122761
+0.35258069914739359 0.2726767817340372 -0.89490947890189543  -0.67452766723136126 -0.7327939509732786 0.089584884642390131
+0.73008380957164554 0.22882364378366471 -0.45886020497699476  -0.27542173873706688 -0.78691259802683133 0.55218785652865776
+0.6650456856281145 0.22783029713491565 -0.49804426762820242  -0.34188293456237412 -0.78786613428398422 0.51223335844459639
+0.40074783475520082 0.23453730781743154 -0.87604956907685072  -0.61194488891504906 -0.7806412222731034 0.1269753323236586
+0.40287199693957931 0.2319235147307509 -0.88441250744737021  -0.6038022951196057 -0.79156802282425653 0.094036448520741681
+0.41967269015334829 0.22029239714976911 -0.87940686251849942  -0.58292813064721194 -0.80326578355000455 0.12230648174951403
+0.73295414361857025 0.120390894417848 -0.66033202687554549  -0.27221405186828029 -0.8975964861531911 0.34672764240956827
+0.73862883390665335 0.1179217338574836 -0.66305236795085609  -0.23862737818795468 -0.91299254504579996 0.33091024020107906
+0.74924502909339918 0.12021569384478618 -0.65013123053773569  -0.23977066491305848 -0.89859032272364658 0.36748531964496522
+0.35285937995032879 0.27242640822753861 -0.8948591833539592  -0.65866036402229156 -0.74597391594558315 0.098434961242611502
+0.19246164044552572 0.77010674056590323 -0.49459829134159439  -0.82387113061171724 -0.2353063850072574 0.51562318151862319
+0.67127690715856303 0.31986574707487569 -0.37569356384004582  -0.33571718293160824 -0.69398814937561693 0.63692575831934406
+0.51431240435194236 0.16435054388889231 -0.84060202208152668  -0.47538384129543065 -0.86578380003691946 0.15629656115485166
+0.15157265925820684 0.58998070131491009 -0.7308249227963397  -0.86581974808661999 -0.41835586417422205 0.27447137325094906
+0.79587834752179276 0.19177788682311969 -0.48472204902454452  -0.20813967421463714 -0.82482450355065007 0.52568280774650467
+0.86349407113854104 0.20106900651413739 -0.4491139872592852  -0.13924301275047235 -0.8154158644589895 0.5618793032215823
+0.79683385603280099 0.23484719550275512 -0.42236282692723071  -0.20735457304096572 -0.78085960551688738 0.58928970592655849
+0.21249304575461847 0.82089742115417219 -0.4448828382530976  -0.83354385962558752 -0.1809544666175604 0.52197712123390316
+0.29093694366030726 0.89636075196488629 -0.33255046319168846  -0.7209136361166818 -0.10033016823458347 0.68572398718656813
+0.17578736338136591 0.72160204626986268 -0.54881477307315141  -0.84103034646625352 -0.28440717777405633 0.46019616855581241
+0.20277464391867589 0.44528180619467961 -0.8715294843120418  -0.80855713981694077 -0.57905836064065186 0.10453117536509755
+0.20721724721609527 0.43892089049513849 -0.87369562034679449  -0.79565076497466114 -0.59478368364253864 0.11477033531295963
+0.16435054388889223 0.84060202208152668 -0.51431240435194248  -0.86578380003691913 -0.15629656115484611 0.47538384129543321
+0.24581371826786724 0.38906581543970098 -0.86449179145637545  -0.76972539034249055 -0.62320039727703713 0.13836216352689598
+0.2362278827902799 0.39778573137580309 -0.88575611557358469  -0.78585236795602897 -0.60955597917048376 0.10429556095738096
+0.23886152721069628 0.39436998908781284 -0.88670186362811831  -0.77572080867111382 -0.62406985332091136 0.093776570478180804
+0.25148743609350815 0.37814612485058707 -0.89022773714167358  -0.77572080867109028 -0.62406985332093745 0.093776570478203869
+0.61291481587751639 0.36991837160270158 -0.35691197974999433  -0.3953635844294407 -0.64279095563231359 0.65613064511909625
+0.54873765482186954 0.3713193261111345 -0.39873225090399556  -0.46011525660260155 -0.64149399833800969 0.61382359089386229
+0.6062691959083808 0.31922707014459717 -0.41525708906780423  -0.40197239864759837 -0.69455121880115778 0.59667142984001043
+0.32062283970672506 0.89703653361847402 -0.30224127238435727  -0.69503929178688939 -0.101531839029395 0.71176658290178818
+0.34044158853824891 0.73719191275168683 -0.32448937007110357  -0.67285685715261323 -0.26836446324215074 0.68937955050281274
+0.2726767817340372 0.89490947890189521 -0.35258069914739365  -0.73279395097325861 -0.089584884642376197 0.6745276672313848
+0.27242640822753872 0.89485918335395898 -0.35285937995032868  -0.7459739159455594 -0.098434961242595487 0.65866036402232075
+0.54043805030551129 0.27854118464368072 -0.52177412017159019  -0.46907539604897691 -0.73602315194220502 0.48809649929758486
+0.60973189193295318 0.78195841301613345 -0.12866675979645326  -0.4209224351297528 -0.23042761042597518 0.87734110809753696
+0.37569356384004582 0.67127690715856303 -0.31986574707487569  -0.63692575831934406 -0.33571718293160824 0.69398814937561693
+0.39781956250172623 0.73257875557195395 -0.27455903153809769  -0.61436698850995353 -0.27300775118977888 0.74028370995146897
+0.81620158702216783 0.55878764062032715 -0.14515574388933145  -0.17844712110942465 -0.44918580997771146 0.87543631012337242
+0.79094720467070556 0.55569157508051703 -0.15189213403566626  -0.2140314567980578 -0.45308829251400029 0.8653909721551577
+0.84060202208152668 0.51431240435194236 -0.16435054388889228  -0.15629656115484672 -0.47538384129543421 0.86578380003691835
+0.43543783887197085 0.66685061023366288 -0.27152141395867613  -0.57610127698437397 -0.34013694034011477 0.74324570666303824
+0.20758482553277546 0.87360645106449408 -0.43871922724759471  -0.8027893542373844 -0.14246063051294294 0.57899414632358603
+0.22029239714976942 0.87940686251849931 -0.41967269015334785  -0.803265783550004 -0.12230648174951353 0.58292813064721294
+0.42830047444496377 0.26758896083815364 -0.68833716584422411  -0.58341134180693566 -0.74717325482286145 0.31837608818572133
+0.12699411191207913 0.6167788499224216 -0.77652668866688779  -0.88771206240854672 -0.38585850377001235 0.25115833516475594
+0.47669360004206351 0.60263533424272331 -0.27291559350329064  -0.53404105644655731 -0.40564529943251787 0.74178975530654778
+0.8844125074473701 0.40287199693957926 -0.23192351473075096  -0.094036448520741611 -0.60380229511960581 0.79156802282425642
+0.87940686251849942 0.41967269015334852 -0.22029239714976895  -0.12230648174951401 -0.58292813064721205 0.80326578355000455
+0.19760570896389246 0.86841627964248769 -0.4538325469504022  -0.84318764111161182 -0.16797909143371911 0.51070307098913947
+0.56326642977303365 0.66555721401063139 -0.18894401454864007  -0.4456417345171686 -0.34127086350965996 0.82760959526572697
+0.43510778217590995 0.23778877920326758 -0.7543766356118875  -0.57611676249591881 -0.77788041909855277 0.25098113386125442
+0.37811394098752249 0.28711353530938599 -0.74416681593888767  -0.63469945426951124 -0.72726265769102505 0.26123864468751851
+0.60179718550820993 0.23131618639376361 -0.54069649116233642  -0.40646863937642913 -0.7842409511990085 0.46877433341208957
+0.66555721401063139 0.18894401454863996 -0.56326642977303343  -0.34127086350965985 -0.82760959526572708 0.44564173451716876
+0.36370573544997098 0.79939609736192763 -0.28216458491718843  -0.64913355914122772 -0.20481384113375128 0.73258235910829894
+0.15704160896220443 0.53091371423475153 -0.83176958998158268  -0.8610861145698091 -0.47782642632713501 0.17381774822643589
+0.66685061023366288 0.27152141395867613 -0.43543783887197085  -0.34013694034011471 -0.74324570666303824 0.57610127698437386
+0.60263533424272331 0.27291559350329064 -0.47669360004206351  -0.40564529943251781 -0.74178975530654778 0.53404105644655731
+0.88643041244943765 0.39433212071905299 -0.23850243715387068  -0.096596587118422908 -0.63168040245028201 0.76918721291849534
+0.50828765077834692 0.16718041590241167 -0.84386234521524095  -0.48165648852029513 -0.86526167125338949 0.13902973540250427
+0.75801153469018845 0.63940401305021388 -0.12231492616193564  -0.24555619785558183 -0.36356562872995896 0.89862238304022901
+0.72952718400936911 0.6728298875984875 -0.11747817726746862  -0.2673952393891102 -0.33340690397513861 0.90406837259897177
+0.74566822600279192 0.61182084959332406 -0.1368474665941225  -0.25988482570664434 -0.39599581735923761 0.88070834559541689
+0.16732110273651729 0.50853350830307131 -0.84450245370595112  -0.84903903628469479 -0.49501822108781263 0.18463389628075974
+0.86841627964248769 0.4538325469504022 -0.19760570896389246  -0.16797909143371911 -0.51070307098913936 0.84318764111161182
+0.86841627964248769 0.45383254695040243 -0.19760570896389235  -0.17482109513942065 -0.49121775846011029 0.85331277880251999
+0.13547524888319312 0.58737517793522209 -0.79687448636012359  -0.881833875344882 -0.42350808342754243 0.20738833035095494
+0.25188956429094089 0.37763360430690207 -0.89031208027748232  -0.76207589783371688 -0.63913636447117517 0.10365825365837174
+0.12666505292171068 0.77481094206321921 -0.6186418487627664  -0.89982453013548147 -0.22723563663235147 0.37239734211021147
+0.12428439751345347 0.76628597990831748 -0.62959613569072714  -0.89982453013547969 -0.22723563663235363 0.37239734211021469
+0.29448299907594322 0.3329730441306975 -0.86688049898359798  -0.7200809942624572 -0.68041269101920487 0.13609530337963555
+0.12866675979645353 0.60973189193295285 -0.78195841301613322  -0.87734110809753718 -0.42092243512975314 0.23042761042597412
+0.39433212071905299 0.23850243715387071 -0.88643041244943765  -0.63168040245028312 -0.76918721291849435 0.0965965871184227
+0.40011344807791571 0.23403574987719886 -0.885181213940885  -0.62068622392278294 -0.7793365693277472 0.085925101925656416
+0.83176958998158268 0.15704160896220443 -0.53091371423475153  -0.17381774822643611 -0.8610861145698091 0.4778264263271349
+0.4448828382530976 0.21249304575461847 -0.82089742115417219  -0.52197712123390316 -0.83354385962558752 0.1809544666175604
+0.43871922724759471 0.20758482553277546 -0.87360645106449408  -0.57899414632358659 -0.80278935423738396 0.14246063051294297
+0.4538325469504022 0.19760570896389246 -0.86841627964248769  -0.51070307098913947 -0.84318764111161171 0.16797909143371909
+0.58737517793522231 0.79687448636012359 -0.13547524888319296  -0.42350808342754392 -0.20738833035095489 0.88183387534488133
+0.55935332483523337 0.81537692950694307 -0.14509843055414046  -0.82500541278991701 0.14198652391981914 0.54699716260004971
+0.55063712409498888 0.79622199346122757 -0.15327245833771197  -0.82946371429884502 0.1144979775782002 0.54669933216720323
+0.45383254695040243 0.19760570896389235 -0.86841627964248769  -0.49121775846011029 -0.85331277880251999 0.17482109513942065
+0.46917118018407 0.18876448359422154 -0.86197484006657277  -0.54178151488020343 -0.825788025280218 0.15667459091349173
+0.48472204902454452 0.79587834752179276 -0.19177788682311969  -0.52568280774650467 -0.20813967421463714 0.82482450355065007
+0.50112519727619176 0.84800457692533193 -0.17116987629986491  -0.52781055754245576 -0.16342714116053514 0.83349120264032583
+0.46535820959984747 0.86344103623700996 -0.19079270763906347  -0.52971449507546009 -0.13950752053014592 0.83662429167606722
+0.58078956308164631 0.13751674259163305 -0.80154185314360293  -0.42149610172113045 -0.88421545010983982 0.20125623970685685
+0.15189213403566626 0.79094720467070556 -0.55569157508051703  -0.86539097215515981 -0.21403145679805635 0.4530882925139969
+0.14515574388933142 0.81620158702216794 -0.55878764062032715  -0.87543631012338807 -0.17844712110943328 0.4491858099776776
+0.1450399309579464 0.81602556690527261 -0.5591014619201069  -0.88441806965926173 -0.18329374350457811 0.4291946896832059
+0.80470051208864024 0.57626699783602664 -0.13905684970997817  -0.18329374350459335 -0.42919468968314395 0.8844180696592886
+0.80154185314360282 0.5807895630816462 -0.1375167425916331  -0.20125623970685494 -0.42149610172113033 0.88421545010984026
+0.42236282692723071 0.79683385603280099 -0.23484719550275512  -0.5892897059265586 -0.20735457304096577 0.78085960551688727
+0.4491139872592852 0.86349407113854104 -0.20106900651413739  -0.56187930322157775 -0.13924301275046694 0.8154158644589935
+0.61450990334845845 0.12763021215051265 -0.77776053021058522  -0.39311654818377234 -0.89197584375895622 0.22324532177533774
+0.61864184876276629 0.12666505292171057 -0.77481094206321943  -0.37239734211020448 -0.89982453013548525 0.2272356366323483
+0.62959613569072737 0.12428439751345335 -0.76628597990831759  -0.37239734211021208 -0.89982453013548303 0.22723563663234447
+0.50853350830307154 0.8445024537059509 -0.16732110273651735  -0.49501822108781024 -0.18463389628075921 0.84903903628469624
+0.53091371423475153 0.83176958998158268 -0.15704160896220448  -0.47782642632713568 -0.17381774822643495 0.86108611456980888
+0.6394040130502141 0.12231492616193554 -0.75801153469018856  -0.36356562872995879 -0.89862238304022923 0.24555619785558092
+0.77652668866688834 0.1269941119120791 -0.61677884992242116  -0.25115833516475583 -0.88771206240854605 0.38585850377001396
+0.78019791562438101 0.1279521970884292 -0.61218503379242051  -0.24084616951440058 -0.88272155572186739 0.40347958770451692
+0.78195841301613345 0.12866675979645331 -0.60973189193295307  -0.23042761042597665 -0.87734110809753796 0.42092243512974992
+0.79687448636012359 0.13547524888319296 -0.58737517793522231  -0.20738833035095483 -0.88183387534488133 0.42350808342754387
+0.19760570896389235 0.86841627964248769 -0.45383254695040243  -0.85331277880251999 -0.17482109513942065 0.49121775846011018
+0.18876448359422154 0.86197484006657277 -0.46917118018407  -0.825788025280218 -0.15667459091349173 0.54178151488020343
+0.84450245370595112 0.16732110273651729 -0.50853350830307131  -0.18463389628075999 -0.8490390362846949 0.49501822108781218
+0.77010674056590323 0.49459829134159439 -0.19246164044552572  -0.23530638500725776 -0.51562318151862208 0.82387113061171802
+0.84582765048432274 0.16851360390451706 -0.5059938921163909  -0.17406896607440442 -0.84145097432228033 0.51152737254410252
+0.84800457692533204 0.17116987629986469 -0.50112519727619198  -0.16342714116053442 -0.83349120264032406 0.52781055754245876
+0.86344103623700996 0.19079270763906322 -0.46535820959984769  -0.13950752053014712 -0.836624291676066 0.52971449507546176
+0.86449179145637545 0.24581371826786724 -0.38906581543970098  -0.13836216352689487 -0.76972539034249077 0.62320039727703724
+0.87369562034679449 0.20721724721609527 -0.43892089049513849  -0.11477033531295816 -0.79565076497466225 0.5947836836425372
+0.88575611557358458 0.23622788279027992 -0.39778573137580303  -0.10429556095738191 -0.78585236795602875 0.60955597917048376
+0.88670186362811831 0.23886152721069626 -0.39436998908781284  -0.09377657047818147 -0.77572080867111348 0.62406985332091203
+0.89022773714167358 0.25148743609350815 -0.37814612485058707  -0.093776570478204146 -0.77572080867108983 0.6240698533209379
+0.89031208027748232 0.25188956429094089 -0.37763360430690207  -0.10365825365837178 -0.76207589783371699 0.63913636447117517
+0.89514882917194938 0.28037391497176023 -0.34420772975862846  -0.10275236361910091 -0.73743092048487979 0.66756092552179158
+0.89633045717514337 0.28913527415696405 -0.33470078178039075  -0.091975091050971292 -0.72651404777911366 0.6809683700479584
+0.89701448999197952 0.29870880673944478 -0.32439454701627179  -0.091975091050972055 -0.72651404777911421 0.68096837004795774
+0.8970365336184738 0.30224127238435722 -0.32062283970672523  -0.10153183902939227 -0.71176658290178985 0.69503929178688817
+0.55935332483523337 0.81537692950694307 -0.14509843055414051  -0.83361988814006005 0.15282936104498576 0.53077402771794979
+0.89617895883531973 0.33677331501517238 -0.28707208578415266  -0.089584884642391838 -0.67452766723137614 0.73279395097326461
+0.89544715323589452 0.34835979735444111 -0.27649633775399207  -0.089584884642385412 -0.6745276672313677 0.73279395097327316
+0.89490947890189521 0.35258069914739365 -0.2726767817340372  -0.089584884642376003 -0.67452766723138569 0.73279395097325783
+0.89485918335395898 0.35285937995032868 -0.27242640822753872  -0.09843496124259532 -0.65866036402232175 0.74597391594555851
+0.5059938921163909 0.84582765048432262 -0.1685136039045172  -0.51152737254409653 -0.17406896607440647 0.84145097432228355
+0.885181213940885 0.40011344807791571 -0.23403574987719886  -0.085925101925656389 -0.62068622392278194 0.77933656932774809
+0.70237760951254313 0.48751950377457764 -0.21949717894867493  -0.30395970967362079 -0.52285425410030573 0.79638679287412917
+0.13751674259163299 0.80154185314360293 -0.58078956308164642  -0.88421545010983915 -0.2012562397068613 0.42149610172112967
+0.84386234521524095 0.50828765077834703 -0.16718041590241167  -0.13902973540250244 -0.48165648852028886 0.86526167125339315
+0.33255046319168835 0.29093694366030742 -0.89636075196488663  -0.68572398718656402 -0.72091363611668646 0.10033016823457788
+0.72160204626986268 0.54881477307315141 -0.17578736338136614  -0.28440717777405633 -0.46019616855581241 0.84103034646625363
+0.77776053021058522 0.61450990334845845 -0.12763021215051262  -0.22324532177533885 -0.39311654818377018 0.89197584375895678
+0.77481094206321943 0.61864184876276629 -0.12666505292171057  -0.22723563663234897 -0.3723973421102027 0.8998245301354858
+0.7662859799083177 0.62959613569072725 -0.12428439751345335  -0.22723563663234433 -0.37239734211021291 0.8998245301354828
+0.30224127238435727 0.32062283970672523 -0.8970365336184738  -0.71176658290178729 -0.69503929178689061 0.10153183902939264
+0.12795219708842931 0.6121850337924204 -0.7801979156243809  -0.88272155572186706 -0.40347958770451797 0.24084616951439944
+0.45162969623720939 0.86929523101799799 -0.19867800845978542  -0.54729298896538436 -0.104895484872483 0.83034168959694077
+0.45158454031321349 0.86931390852880774 -0.19870683045973392  -0.56303267966672976 -0.094237795024242899 0.82104411551162748
+0.44528180619467961 0.87152948431204191 -0.20277464391867595  -0.57905836064064919 -0.10453117536508859 0.80855713981694399
+0.43892089049513849 0.87369562034679449 -0.20721724721609527  -0.59478368364253509 -0.11477033531295144 0.79565076497466491
+0.32439454701627168 0.89701448999197964 -0.29870880673944478  -0.68096837004795685 -0.091975091050973928 0.72651404777911499
+0.86929523101799799 0.19867800845978539 -0.45162969623720939  -0.10489548487238186 -0.83034168959685195 0.54729298896553857
+0.86931390852880774 0.19870683045973392 -0.45158454031321349  -0.094237795024141494 -0.82104411551153711 0.56303267966687842
+0.34420772975862846 0.89514882917194938 -0.28037391497176023  -0.66756092552179158 -0.10275236361910092 0.73743092048487979
+0.33470078178039075 0.89633045717514337 -0.28913527415696405  -0.68096837004795674 -0.09197509105097168 0.72651404777911532
+0.23403574987719894 0.88518121394088489 -0.40011344807791577  -0.77933656932774575 -0.085925101925646716 0.62068622392278616
+0.2319235147307509 0.88441250744737032 -0.40287199693957931  -0.79156802282425009 -0.094036448520736088 0.60380229511961492
+0.17791687149582575 0.85321734737321941 -0.48823773095257161  -0.83543687458500693 -0.14218930946431363 0.53087421189741091
+0.14336877717919261 0.81316979596130778 -0.5637647152038272  -0.88441806965928904 -0.18329374350459332 0.42919468968314289
+0.13905684970997817 0.80470051208864013 -0.57626699783602664  -0.88441806965928849 -0.1832937435045966 0.42919468968314278
+0.12763021215051282 0.777760530210585 -0.61450990334845845  -0.89197584375895411 -0.22324532177534218 0.39311654818377439
+0.12231492616193582 0.75801153469018856 -0.63940401305021388  -0.89862238304022746 -0.24555619785558835 0.36356562872995812
+0.11747817726746856 0.72952718400936922 -0.6728298875984875  -0.904068372598959 -0.26739523938910431 0.33340690397517753
+0.1174351724559944 0.72909950732245954 -0.67332661830731499  -0.91062768981370645 -0.27087905317336791 0.31206048948313186
+0.11642208455468789 0.71492061152483621 -0.68859068384710342  -0.91062768981370579 -0.27087905317337013 0.31206048948313181
+0.11629154482667345 0.71178314065071913 -0.69169504426227524  -0.90831680955776484 -0.28893990864387104 0.30244718988225799
+0.86197484006657277 0.46917118018407 -0.18876448359422154  -0.15667459091349173 -0.54178151488020343 0.825788025280218
+0.11711592517486366 0.6748092140303833 -0.72790861885278146  -0.90562084821138367 -0.30687826798314888 0.29270566773562279
+0.11791670171500293 0.66309584332239968 -0.73859273426435279  -0.91663390223890606 -0.31277536903735376 0.2489053189263396
+0.11737161430462231 0.66886984046648634 -0.73334447965428895  -0.91136373772563073 -0.30990719304796188 0.27087574504909262
+0.37814612485058707 0.89022773714167358 -0.25148743609350815  -0.62406985332093812 -0.093776570478204258 0.77572080867108961
+0.39436998908781284 0.8867018636281182 -0.23886152721069626  -0.62406985332090925 -0.093776570478183191 0.77572080867111537
+0.39778573137580309 0.88575611557358469 -0.2362278827902799  -0.6095559791704811 -0.10429556095738292 0.78585236795603086
+0.7385927342643529 0.11791670171500293 -0.66309584332239968  -0.24890531892624906 -0.91663390223887919 0.31277536903750436
+0.87360645106449408 0.43871922724759471 -0.20758482553277546  -0.14246063051294294 -0.57899414632358637 0.80278935423738407
+0.57626699783602664 0.13905684970997817 -0.80470051208864024  -0.42919468968314289 -0.88441806965928871 0.18329374350459482
+0.71178314065071913 0.69169504426227513 -0.11629154482667345  -0.28893990864387398 -0.30244718988225777 0.90831680955776406
+0.7149206115248361 0.68859068384710331 -0.1164220845546879  -0.27087905317337091 -0.3120604894831337 0.9106276898137049
+0.72909950732245954 0.67332661830731499 -0.11743517245599447  -0.27087905317337202 -0.312060489483097 0.91062768981371711
+0.81316979596130778 0.5637647152038272 -0.14336877717919261  -0.18329374350459457 -0.42919468968314056 0.88441806965928993
+0.81602556690527261 0.5591014619201069 -0.14503993095794637  -0.18329374350457062 -0.42919468968323837 0.88441806965924741
+0.87152948431204191 0.20277464391867592 -0.44528180619467961  -0.10453117536509179 -0.80855713981694322 0.57905836064064964
+0.73334447965428895 0.11737161430462233 -0.66886984046648634  -0.27087574504909184 -0.9113637377256314 0.30990719304796072
+0.72790861885278146 0.11711592517486366 -0.67480921403038341  -0.29270566773562112 -0.90562084821138544 0.30687826798314533
+0.69169504426227513 0.11629154482667348 -0.71178314065071902  -0.30244718988226188 -0.90831680955776473 0.28893990864386698
+0.68859068384710331 0.11642208455468794 -0.71492061152483621  -0.31206048948313503 -0.91062768981370623 0.27087905317336491
+0.67332661830731499 0.1174351724559944 -0.72909950732245954  -0.31206048948312065 -0.91062768981370967 0.27087905317336997
+0.5637647152038272 0.14336877717919261 -0.81316979596130778  -0.42919468968314056 -0.88441806965928993 0.18329374350459457
+0.5591014619201069 0.14503993095794637 -0.81602556690527261  -0.42919468968323438 -0.88441806965924918 0.18329374350457187
+0.55878764062032715 0.14515574388933142 -0.81620158702216794  -0.4491858099777078 -0.87543631012337408 0.17844712110942595
+0.29870880673944478 0.32439454701627179 -0.89701448999197964  -0.72651404777911199 -0.68096837004796007 0.091975091050972749
+0.28913527415696405 0.33470078178039075 -0.89633045717514337  -0.72651404777911444 -0.68096837004795763 0.091975091050971486
+0.28037391497176029 0.34420772975862846 -0.89514882917194938  -0.73743092048488068 -0.66756092552179092 0.1027523636191002
+0.19870683045973389 0.45158454031321349 -0.86931390852880774  -0.82104411551162859 -0.56303267966672721 0.094237795024247395
+3  0 1 2
+3  3 4 5
+3  6 7 8
+3  9 10 11
+3  12 13 14
+3  15 16 17
+3  18 10 19
+3  8 7 20
+3  21 1 22
+3  20 7 23
+3  24 1 25
+3  11 26 9
+3  27 28 29
+3  30 7 31
+3  32 33 34
+3  35 36 37
+3  38 35 39
+3  23 7 30
+3  40 41 42
+3  43 44 6
+3  33 32 45
+3  31 44 46
+3  47 48 49
+3  12 50 46
+3  51 52 5
+3  31 7 6
+3  53 54 9
+3  6 44 31
+3  46 44 12
+3  55 56 57
+3  28 58 59
+3  60 32 61
+3  12 44 62
+3  62 44 43
+3  63 64 65
+3  66 67 68
+3  6 69 43
+3  70 32 71
+3  43 69 40
+3  72 73 74
+3  42 75 40
+3  76 77 78
+3  79 80 81
+3  82 83 84
+3  55 85 86
+3  40 69 87
+3  88 13 89
+3  90 91 92
+3  93 94 95
+3  87 69 96
+3  97 98 2
+3  96 69 8
+3  99 100 101
+3  102 80 46
+3  8 69 6
+3  103 104 105
+3  8 106 96
+3  42 41 107
+3  102 50 108
+3  73 109 110
+3  11 111 112
+3  96 106 113
+3  114 115 116
+3  113 106 117
+3  118 119 25
+3  120 121 122
+3  116 10 9
+3  123 124 125
+3  46 80 31
+3  126 64 127
+3  36 128 129
+3  117 106 130
+3  131 104 103
+3  46 50 102
+3  132 133 134
+3  130 106 20
+3  21 122 2
+3  36 135 136
+3  20 106 8
+3  14 13 88
+3  103 137 131
+3  138 139 127
+3  140 141 125
+3  20 137 130
+3  130 137 95
+3  95 137 103
+3  81 80 102
+3  23 137 20
+3  142 143 22
+3  131 137 23
+3  28 59 144
+3  23 56 131
+3  74 145 146
+3  147 148 149
+3  131 56 55
+3  150 151 152
+3  57 56 79
+3  28 144 153
+3  79 56 30
+3  154 75 42
+3  24 155 22
+3  30 56 23
+3  101 156 54
+3  93 119 63
+3  112 26 11
+3  157 50 14
+3  158 159 160
+3  30 80 79
+3  107 161 42
+3  31 80 30
+3  162 36 35
+3  163 75 154
+3  164 165 92
+3  108 50 157
+3  78 77 166
+3  14 50 12
+3  89 13 163
+3  127 139 61
+3  163 13 62
+3  62 13 12
+3  167 168 169
+3  62 75 163
+3  167 169 170
+3  171 172 173
+3  40 75 43
+3  43 75 62
+3  174 162 35
+3  107 41 37
+3  37 41 175
+3  36 176 177
+3  178 104 86
+3  175 41 87
+3  71 32 60
+3  87 41 40
+3  16 179 17
+3  11 10 18
+3  87 180 175
+3  93 172 171
+3  175 180 181
+3  182 183 184
+3  181 180 185
+3  186 161 187
+3  188 26 112
+3  185 180 113
+3  113 180 96
+3  160 145 158
+3  112 111 86
+3  189 157 134
+3  96 180 87
+3  113 190 185
+3  126 190 65
+3  185 190 68
+3  191 192 97
+3  68 190 126
+3  65 190 117
+3  193 161 186
+3  86 85 112
+3  117 190 113
+3  126 194 68
+3  117 94 65
+3  65 94 63
+3  66 194 17
+3  195 196 29
+3  63 94 93
+3  61 194 127
+3  27 196 125
+3  95 94 130
+3  115 150 19
+3  130 94 117
+3  61 32 17
+3  95 172 93
+3  173 172 105
+3  108 4 102
+3  105 172 103
+3  103 172 95
+3  105 104 178
+3  197 198 146
+3  86 104 55
+3  37 199 35
+3  175 199 37
+3  200 5 83
+3  55 104 131
+3  112 85 188
+3  188 85 123
+3  123 85 57
+3  201 202 146
+3  57 85 55
+3  57 124 123
+3  125 124 140
+3  140 124 81
+3  142 155 201
+3  81 124 79
+3  108 83 5
+3  79 124 57
+3  122 203 97
+3  81 4 140
+3  101 204 156
+3  140 4 3
+3  5 4 108
+3  102 4 81
+3  68 194 66
+3  205 206 207
+3  208 5 200
+3  61 139 60
+3  51 5 208
+3  209 210 98
+3  90 5 52
+3  90 92 5
+3  5 92 3
+3  211 83 157
+3  3 92 167
+3  165 167 92
+3  128 36 177
+3  168 167 165
+3  167 170 212
+3  89 213 214
+3  212 215 167
+3  211 157 216
+3  215 141 167
+3  167 141 3
+3  3 141 140
+3  125 141 27
+3  27 141 215
+3  215 28 27
+3  29 28 147
+3  217 147 28
+3  217 218 147
+3  73 110 219
+3  148 147 218
+3  181 199 175
+3  147 149 220
+3  221 220 149
+3  129 161 107
+3  221 222 220
+3  223 224 225
+3  222 226 220
+3  173 202 201
+3  227 220 226
+3  99 220 227
+3  146 145 201
+3  99 101 220
+3  53 220 101
+3  66 225 228
+3  195 220 53
+3  229 230 228
+3  29 220 195
+3  171 119 93
+3  147 220 29
+3  54 231 116
+3  29 196 27
+3  125 196 123
+3  232 233 234
+3  123 196 188
+3  188 196 195
+3  195 26 188
+3  183 235 236
+3  237 67 228
+3  9 26 53
+3  53 26 195
+3  237 238 39
+3  9 54 116
+3  239 116 231
+3  116 239 240
+3  116 240 241
+3  242 228 243
+3  241 244 116
+3  244 114 116
+3  35 199 39
+3  115 10 116
+3  19 10 115
+3  228 67 66
+3  19 150 72
+3  152 72 150
+3  245 72 152
+3  246 72 245
+3  153 217 28
+3  247 72 246
+3  248 72 247
+3  248 73 72
+3  249 250 161
+3  74 73 158
+3  63 119 118
+3  73 219 158
+3  251 158 219
+3  252 98 47
+3  251 253 158
+3  253 254 158
+3  255 158 254
+3  255 159 158
+3  160 159 256
+3  107 36 129
+3  257 256 159
+3  257 258 256
+3  256 258 259
+3  256 259 260
+3  256 260 261
+3  256 261 120
+3  120 122 21
+3  262 120 261
+3  120 262 263
+3  120 263 264
+3  120 264 265
+3  187 161 129
+3  121 120 265
+3  266 225 224
+3  121 267 122
+3  268 122 267
+3  269 122 268
+3  270 122 269
+3  203 122 270
+3  101 54 53
+3  229 228 271
+3  97 203 272
+3  97 272 191
+3  0 273 25
+3  192 98 97
+3  2 98 0
+3  0 98 252
+3  274 89 232
+3  48 47 98
+3  49 275 47
+3  47 275 184
+3  184 183 47
+3  28 276 58
+3  47 183 252
+3  252 183 277
+3  277 183 207
+3  236 207 183
+3  278 207 236
+3  278 279 207
+3  207 279 280
+3  207 280 205
+3  206 60 207
+3  60 139 207
+3  207 139 277
+3  277 139 138
+3  32 34 17
+3  15 17 34
+3  179 223 17
+3  281 276 215
+3  282 216 157
+3  17 223 225
+3  142 145 160
+3  225 266 243
+3  225 243 228
+3  242 271 228
+3  228 230 238
+3  238 230 283
+3  17 194 61
+3  283 284 238
+3  238 284 285
+3  238 285 286
+3  36 162 135
+3  174 35 287
+3  286 39 238
+3  228 238 237
+3  159 288 289
+3  68 67 185
+3  173 155 171
+3  185 67 181
+3  181 67 237
+3  24 119 171
+3  237 199 181
+3  39 199 237
+3  127 64 138
+3  290 35 38
+3  290 291 35
+3  287 35 291
+3  19 198 18
+3  37 36 107
+3  129 128 292
+3  129 292 293
+3  293 187 129
+3  42 161 154
+3  154 161 78
+3  120 143 256
+3  161 294 78
+3  78 294 76
+3  201 145 142
+3  78 166 232
+3  233 232 166
+3  232 234 295
+3  138 64 118
+3  232 295 296
+3  232 296 274
+3  163 232 89
+3  154 232 163
+3  78 232 154
+3  297 89 274
+3  297 213 89
+3  298 89 214
+3  298 299 89
+3  299 88 89
+3  299 300 88
+3  18 198 197
+3  118 64 63
+3  301 88 300
+3  252 273 0
+3  302 88 301
+3  48 98 303
+3  302 304 88
+3  304 132 88
+3  18 111 11
+3  88 132 14
+3  14 132 157
+3  132 134 157
+3  189 282 157
+3  157 83 108
+3  211 84 83
+3  83 82 200
+3  178 111 197
+3  133 132 305
+3  306 305 132
+3  306 132 304
+3  250 294 161
+3  249 161 193
+3  36 136 176
+3  39 307 38
+3  39 308 307
+3  309 308 39
+3  286 309 39
+3  151 150 310
+3  127 194 126
+3  65 64 126
+3  25 119 24
+3  171 155 24
+3  22 155 142
+3  201 155 173
+3  146 202 197
+3  197 202 178
+3  178 202 105
+3  105 202 173
+3  17 225 66
+3  197 111 18
+3  86 111 178
+3  311 98 192
+3  146 198 74
+3  74 198 72
+3  72 198 19
+3  158 145 74
+3  160 143 142
+3  21 143 120
+3  22 143 21
+3  256 143 160
+3  2 122 97
+3  2 1 21
+3  22 1 24
+3  25 1 0
+3  25 273 118
+3  70 45 32
+3  118 273 138
+3  138 273 277
+3  54 312 231
+3  277 273 252
+3  313 71 60
+3  313 60 314
+3  314 60 315
+3  206 315 60
+3  183 316 235
+3  183 317 316
+3  182 317 183
+3  303 98 210
+3  209 98 311
+3  159 318 257
+3  159 289 318
+3  159 255 288
+3  73 248 109
+3  319 310 150
+3  319 150 320
+3  320 150 115
+3  321 320 115
+3  321 115 322
+3  322 115 323
+3  114 323 115
+3  54 324 312
+3  54 325 324
+3  54 326 325
+3  326 54 156
+3  101 100 204
+3  276 28 215
+3  215 327 281
+3  215 328 327
+3  215 329 328
+3  329 215 212
+3  92 330 164
+3  92 91 330
+
diff --git a/Data/data/meshes/polyhedral_complex_of_spheres/Intersection23.off b/Data/data/meshes/polyhedral_complex_of_spheres/Intersection23.off
new file mode 100644
index 000000000000..6b73abe61e11
--- /dev/null
+++ b/Data/data/meshes/polyhedral_complex_of_spheres/Intersection23.off
@@ -0,0 +1,833 @@
+NOFF
+337 492 0
+
+0.65340002742402614 0.72750422818221494 0.10243968818147731  -0.3467276424095721 -0.27221405186828174 -0.89759648615318921
+0.62479622481419628 0.77318510024650322 0.10194841255523895  -0.36748531964497938 -0.23977066491306484 -0.89859032272363926
+0.62688758712066828 0.77156308049914157 0.10155294642477933  -0.34889693998411886 -0.22824258748330767 -0.90894237800239175
+0.31070343884806484 0.3269812127941315 0.73182848239968035  -0.68937955050281363 -0.67285685715261212 -0.26836446324215141
+0.36542238876277799 0.27256483194835279 0.73894573054988522  -0.63469945426951102 -0.72726265769102494 -0.26123864468751956
+0.3198192814930475 0.29480292285486542 0.79987185965655649  -0.68040299513329328 -0.70493504308661681 -0.2002956545762121
+0.30533374504550748 0.40332356027326954 0.59823387337589862  -0.694551218801158 -0.59667142984000998 -0.40197239864759859
+0.35848910827666791 0.38646148051428109 0.53952821920598915  -0.64149399833800991 -0.61382359089386174 -0.46011525660260222
+0.3570595628598997 0.34378773443876975 0.60501511824236331  -0.64279095563231392 -0.65613064511909658 -0.39536358442943981
+0.48780027309000251 0.65820988329399444 0.21207173177032235  -0.51223335844459628 -0.34188293456237473 -0.787866134283984
+0.44781653569081092 0.72457531588943425 0.21308535079965785  -0.55218785652865843 -0.27542173873706899 -0.78691259802683011
+0.51303354953721536 0.72427145868031995 0.17124343283120957  -0.4869280495724907 -0.27563277583938711 -0.82881098413486542
+0.37325238119242876 0.48443672020460948 0.41572101967839103  -0.62647295099493516 -0.51565247738810571 -0.5844947940189088
+0.31653113247178299 0.49630888727061573 0.47163878825453964  -0.68370790823052163 -0.50330613999724017 -0.52841879760671173
+0.32829084112567974 0.5487333343927413 0.41249238098892749  -0.67149417441485404 -0.45142526361231916 -0.58763152153323239
+0.86816149698298051 0.33330487729716585 0.26642231325749555  -0.13227871496285307 -0.66711974931205487 -0.73311225719230566
+0.90442701067601738 0.33903474443581871 0.25671454238163005  -0.089584884642383594 -0.67452766723137247 -0.73279395097326894
+0.90595336478045685 0.32286639405373119 0.271410708194047  -0.089584884642384358 -0.67452766723137214 -0.73279395097326927
+0.36389981842002816 0.43335215040065556 0.47627605216262481  -0.63609627313050632 -0.56692430597377941 -0.52342942466547371
+0.27380116818647493 0.56176104154254891 0.47030020581200904  -0.72592006295091172 -0.43849581670457083 -0.52986930552536793
+0.3864614805142812 0.53952821920598915 0.35848910827666791  -0.61382359089386263 -0.460115256602602 -0.64149399833800913
+0.43335215040065556 0.47627605216262481 0.36389981842002816  -0.56692430597378007 -0.52342942466547338 -0.63609627313050598
+0.68197669984104492 0.41663313718873862 0.25264179677362608  -0.31838810336562567 -0.58337988565756416 -0.74719269579232839
+0.73894573054988522 0.36542238876277799 0.27256483194835279  -0.26123864468751978 -0.63469945426951047 -0.72726265769102527
+0.67160444279468889 0.35938546291290396 0.30590391667975914  -0.32871571883365308 -0.64057192708348243 -0.69398384882087027
+0.33330487729716574 0.26642231325749544 0.86816149698298051  -0.66711974931205442 -0.73311225719230599 -0.13227871496285382
+0.3390347444358186 0.25671454238163 0.90442701067601727  -0.67452766723137392 -0.73279395097326772 -0.089584884642382206
+0.32286639405373108 0.271410708194047 0.90595336478045674  -0.67452766723137203 -0.7327939509732696 -0.089584884642382387
+0.26381753535069452 0.51201440833835754 0.5310592350056238  -0.73602315194220458 -0.48809649929758581 -0.46907539604897669
+0.80699455980445267 0.37542737832173312 0.24325833978506273  -0.19358827458119329 -0.62484261256047746 -0.75636980999592618
+0.74936391388968104 0.42357936956725517 0.22223344816659951  -0.25098113386125442 -0.57611676249591837 -0.7778804190985531
+0.30883755347893571 0.44783116020585167 0.53373393338202169  -0.69097715483087363 -0.55222595833073029 -0.46647300291392774
+0.59823387337589862 0.30533374504550748 0.40332356027326954  -0.40197239864759965 -0.69455121880115767 -0.59667142984000976
+0.53952821920598915 0.35848910827666791 0.3864614805142812  -0.46011525660260222 -0.64149399833800991 -0.61382359089386174
+0.60501511824236331 0.3570595628598997 0.34378773443876975  -0.39536358442944003 -0.64279095563231414 -0.65613064511909613
+0.23616371904645006 0.62850263027516917 0.47222747306573276  -0.76364675610270716 -0.37176976328895933 -0.52785497534633863
+0.22366085201896557 0.57848122801663848 0.53136426493733913  -0.77616877106981574 -0.42177409750733541 -0.46868822204941812
+0.18870753060675904 0.64637064705828329 0.53443495637683447  -0.81121902067950891 -0.3538769830587431 -0.46550486715932449
+0.72712117915505503 0.2597541138143854 0.38553016581808786  -0.2730077511897781 -0.74028370995146919 -0.61436698850995353
+0.79530214016523215 0.2675148825685596 0.35072013821425629  -0.20481384113375134 -0.73258235910829961 -0.64913355914122706
+0.79268760819673556 0.21923183214566855 0.41057431319105175  -0.20735457304096661 -0.78085960551688671 -0.58928970592655916
+0.41572101967839103 0.37325238119242854 0.48443672020460959  -0.5840346780896517 -0.62675731827798065 -0.51582822603431755
+0.42264973081037427 0.42264973081037416 0.42264973081037427  -0.57702725326215776 -0.57739733617063238 -0.57762605998672467
+0.47627605216262492 0.36389981842002816 0.43335215040065567  -0.52380155193385225 -0.636326260430505 -0.56632219140540219
+0.66005164309557429 0.25665450403946544 0.42391616211425598  -0.34013694034011555 -0.74324570666303835 -0.5761012769843733
+0.66456827261077822 0.30598545619885287 0.36295261616331198  -0.33571718293160907 -0.69398814937561637 -0.63692575831934428
+0.17821777401482319 0.59899507473160241 0.59519261004110269  -0.82172156155091991 -0.40115992505181985 -0.40477696304846217
+0.14602227837948789 0.66879190536298361 0.59872297720557655  -0.85394740027497873 -0.33139575632083107 -0.40118660278746798
+0.48443672020460959 0.41572101967839092 0.37325238119242865  -0.51565247738810638 -0.58449479401890947 -0.62647295099493405
+0.28795953903188309 0.61494994375519363 0.41285875964110375  -0.71231212670919686 -0.38457055427597059 -0.58712598556604001
+0.53443495637683447 0.18870753060675904 0.64637064705828329  -0.4655048671593236 -0.81121902067950946 -0.35387698305874338
+0.53136426493733913 0.22366085201896557 0.57848122801663848  -0.46868822204941812 -0.77616877106981574 -0.42177409750733541
+0.59519261004110269 0.17821777401482319 0.59899507473160241  -0.40477696304846217 -0.82172156155091991 -0.40115992505181985
+0.2156287616262893 0.53132295016564957 0.59367059745735717  -0.78424095119900827 -0.46877433341209018 -0.40646863937642869
+0.11923210876951273 0.74047778163550204 0.60389882611563683  -0.88070834559541733 -0.25988482570664379 -0.39599581735923706
+0.09842494161536669 0.758150485750266 0.64339140453754151  -0.8986223830402289 -0.24555619785558386 -0.36356562872995768
+0.098941938751961223 0.76032257344343512 0.64081678241520534  -0.89982453013548214 -0.22723563663234903 -0.37239734211021136
+0.095362650095153129 0.74011618472454044 0.66455433327713243  -0.89704722922209224 -0.26377483182397365 -0.35458300388089892
+0.10842625325651789 0.69598720512098966 0.66433279178978177  -0.89156486051918749 -0.30422052318316711 -0.33550256744406848
+0.44783116020585167 0.53373393338202169 0.30883755347893571  -0.55222595833073074 -0.46647300291392757 -0.69097715483087341
+0.13599230442623667 0.54146645315815212 0.79206325863390559  -0.54975000439653132 -0.82421016874017694 0.13584009132543551
+0.11874744154864894 0.56789366986248413 0.81389356246462441  -0.8858348623928205 -0.42585755017737525 -0.18423339416733664
+0.10851189307750805 0.59819314586024896 0.79307076339523386  -0.88183387534488133 -0.4235080834275432 -0.20738833035095594
+0.86172631781262787 0.23042216149782369 0.37659777085683765  -0.13836216352688824 -0.76972539034250098 -0.62320039727702603
+0.86070823585565381 0.18476429236136471 0.43787141557069931  -0.13924301275047277 -0.81541586445899072 -0.56187930322158031
+0.47163878825453964 0.31653113247178277 0.49630888727061573  -0.52841879760671084 -0.68370790823052174 -0.50330613999724094
+0.41249238098892738 0.32829084112567963 0.54873333439274119  -0.58737470394737457 -0.67165289641182357 -0.45152335920120706
+0.40332356027326954 0.59823387337589862 0.30533374504550748  -0.59667142984000976 -0.40197239864759959 -0.69455121880115767
+0.34378773443876975 0.60501511824236331 0.3570595628598997  -0.65613064511909591 -0.39536358442943997 -0.64279095563231448
+0.58161296052541844 0.72533155387381609 0.13425781556959904  -0.41835586417422144 -0.27447137325094861 -0.86581974808662043
+0.55435349976840143 0.65873185103125653 0.17239185158024484  -0.44564173451716937 -0.34127086350966229 -0.82760959526572564
+0.35938546291290396 0.30590391667975914 0.67160444279468889  -0.64057192708348321 -0.69398384882086983 -0.32871571883365264
+0.30598545619885309 0.36295261616331198 0.66456827261077822  -0.69398814937561637 -0.63692575831934428 -0.33571718293160907
+0.81724226648384946 0.43355391658479348 0.19642147525981468  -0.18137511328579292 -0.5662130069615704 -0.80405590541211902
+0.88125255845135109 0.43210633013751554 0.18610643753537598  -0.1223064817495161 -0.58292813064721183 -0.80326578355000444
+0.87351996844576607 0.38851819872979687 0.21891562022186895  -0.12697533232365854 -0.61194488891505017 -0.78064122227310251
+0.46601387759394231 0.5945258512680851 0.25807713622784767  -0.53404105644655731 -0.40564529943251815 -0.74178975530654756
+0.42391616211425598 0.66005164309557429 0.25665450403946544  -0.5761012769843723 -0.34013694034011455 -0.74324570666303946
+0.37659777085683754 0.86172631781262776 0.2304221614978238  -0.62320039727703713 -0.13836216352689507 -0.76972539034249077
+0.41582096722616779 0.88692657891222382 0.1974660445788706  -0.59478368364253598 -0.1147703353129565 -0.79565076497466358
+0.43787141557069931 0.86070823585565381 0.18476429236136471  -0.56187930322157953 -0.13924301275047141 -0.8154158644589915
+0.30590391667975914 0.67160444279468889 0.35938546291290396  -0.69398384882087027 -0.32871571883365297 -0.64057192708348243
+0.31222404809805682 0.2811508450273621 0.90641151615731874  -0.68572398718655958 -0.72091363611669124 -0.10033016823457401
+0.280084692934636 0.31936024911295635 0.86416377447305925  -0.72008099426245742 -0.68041269101920465 -0.13609530337963549
+0.25665450403946544 0.42391616211425598 0.66005164309557429  -0.74324570666303769 -0.57610127698437408 -0.3401369403401156
+0.25807713622784767 0.46601387759394231 0.5945258512680851  -0.74178975530654756 -0.53404105644655719 -0.40564529943251809
+0.82226795238624728 0.12310298935169572 0.55521070025011254  0.1419865239198129 -0.54699716260005027 -0.82500541278991768
+0.81389356246462441 0.11874744154864894 0.56789366986248413  -0.18423339416733697 -0.8858348623928205 -0.42585755017737503
+0.79206325863390559 0.13599230442623667 0.54146645315815212  0.11449797757819402 -0.54669933216720235 -0.82946371429884647
+0.35072013821425607 0.79530214016523215 0.26751488256855971  -0.6491335591412275 -0.2048138411337509 -0.73258235910829916
+0.31936024911295646 0.86416377447305925 0.28008469293463611  -0.6804126910192041 -0.13609530337963491 -0.72008099426245797
+0.25264179677362608 0.68197669984104492 0.41663313718873862  -0.74719269579232828 -0.31838810336562579 -0.58337988565756427
+0.47420617247402475 0.79171259951203332 0.17528355798277528  -0.52568280774650489 -0.20813967421463556 -0.82482450355065029
+0.54146645315815212 0.79206325863390559 0.13599230442623667  -0.82946371429884591 0.11449797757819456 -0.54669933216720301
+0.41285875964110375 0.2879595390318832 0.61494994375519374  -0.58712598556604001 -0.71231212670919686 -0.38457055427597059
+0.43210633013751587 0.18610643753537565 0.88125255845135109  -0.58292813064721261 -0.803265783550004 -0.12230648174951494
+0.38851819872979687 0.21891562022186895 0.87351996844576596  -0.61194488891504684 -0.78064122227310462 -0.12697533232366096
+0.43355391658479348 0.19642147525981468 0.81724226648384946  -0.52197712123390316 -0.83354385962558797 -0.18095446661755885
+0.13769549234610645 0.6240392221045663 0.66075903908278333  -0.86229745711633887 -0.37608264246842443 -0.33912378489964845
+0.17239185158024484 0.55435349976840143 0.65873185103125675  -0.82760959526572686 -0.44564173451716843 -0.34127086350966052
+0.13425781556959904 0.58161296052541844 0.72533155387381609  -0.86581974808662043 -0.41835586417422144 -0.27447137325094861
+0.17528355798277528 0.47420617247402475 0.79171259951203332  -0.82482450355065018 -0.52568280774650478 -0.20813967421463553
+0.1418121948905855 0.51101182387798272 0.84695178356442291  -0.86108611456980833 -0.4778264263271364 -0.17381774822643573
+0.49630888727061573 0.47163878825453953 0.31653113247178299  -0.50330613999724105 -0.52841879760671095 -0.68370790823052163
+0.2675148825685596 0.35072013821425618 0.79530214016523215  -0.73258235910829939 -0.64913355914122706 -0.20481384113375187
+0.37542737832173312 0.24325833978506273 0.80699455980445267  -0.62484261256047746 -0.75636980999592618 -0.19358827458119343
+0.21207173177032212 0.4878002730900024 0.65820988329399444  -0.78786613428398433 -0.51223335844459605 -0.3418829345623744
+0.51201440833835754 0.5310592350056238 0.26381753535069452  -0.48809649929758581 -0.46907539604897669 -0.73602315194220458
+0.53132295016564957 0.59367059745735695 0.21562876162628941  -0.46877433341208991 -0.40646863937642685 -0.7842409511990095
+0.64339140453754151 0.098424941615366662 0.75815048575026611  -0.36356562872995773 -0.89862238304022901 -0.24555619785558336
+0.64081678241520534 0.098941938751961223 0.76032257344343512  -0.37239734211021208 -0.89982453013548236 -0.2272356366323475
+0.60389882611563683 0.11923210876951273 0.74047778163550204  -0.39599581735923794 -0.88070834559541689 -0.25988482570664401
+0.76541504139377881 0.48428397075672935 0.17598126576074047  -0.23530638500725762 -0.51562318151862252 -0.82387113061171768
+0.5310592350056238 0.26381753535069452 0.51201440833835754  -0.46907539604897669 -0.73602315194220458 -0.48809649929758581
+0.47030020581200904 0.27380116818647493 0.56176104154254891  -0.52986930552536826 -0.72592006295091216 -0.43849581670456983
+0.54873333439274119 0.41249238098892738 0.32829084112567963  -0.45152335920120729 -0.5873747039473749 -0.67165289641182324
+0.53373393338202169 0.30883755347893571 0.44783116020585167  -0.46647300291392696 -0.69097715483087374 -0.55222595833073085
+0.21923183214566855 0.41057431319105175 0.79268760819673556  -0.78085960551688671 -0.58928970592655905 -0.20735457304096666
+0.18476429236136471 0.43787141557069931 0.86070823585565381  -0.81541586445899161 -0.56187930322157953 -0.13924301275047143
+0.2222334481665994 0.74936391388968104 0.42357936956725517  -0.77788041909855365 -0.2509811338612542 -0.57611676249591792
+0.20356854994762741 0.69630368317606428 0.47706071813732465  -0.79638679287413017 -0.30395970967362007 -0.52285425410030462
+0.17598126576074047 0.76541504139377881 0.48428397075672935  -0.82387113061171668 -0.23530638500725837 -0.51562318151862363
+0.78668082109255688 0.54662405620460941 0.13458381024047572  -0.21403145679805563 -0.45308829251399879 -0.86539097215515903
+0.84282425105969128 0.51873480041451114 0.13843733448120865  -0.1562965611548511 -0.47538384129542932 -0.86578380003692024
+0.83330295178070157 0.4938077152850564 0.15384312033167369  -0.16746624198175186 -0.50593831119476151 -0.8461568903352984
+0.30186484921791523 0.90688305806336122 0.29107512591583129  -0.69503929178689383 -0.10153183902939461 -0.71176658290178396
+0.2811508450273621 0.90641151615731863 0.31222404809805682  -0.72091363611669168 -0.10033016823457386 -0.68572398718655914
+0.79171259951203343 0.17528355798277517 0.47420617247402497  -0.20813967421463564 -0.8248245035506504 -0.52568280774650478
+0.15896669732792423 0.71592045537741111 0.53960691129913441  -0.84103034646625374 -0.28440717777405522 -0.46019616855581275
+0.66096525556418162 0.74328545761836984 0.095572989323982588  -0.33091024020101656 -0.23862737818799956 -0.91299254504581084
+0.6771336059462687 0.72858929180595311 0.094046635219543206  -0.30990719304796521 -0.27087574504909745 -0.91136373772562818
+0.69630368317606428 0.47706071813732431 0.20356854994762741  -0.3039597096736199 -0.52285425410030484 -0.79638679287413017
+0.74047778163550204 0.60389882611563683 0.11923210876951273  -0.25988482570664423 -0.39599581735923733 -0.88070834559541711
+0.71592045537741122 0.53960691129913418 0.15896669732792434  -0.2844071777740555 -0.46019616855581313 -0.84103034646625341
+0.56176104154254891 0.47030020581200904 0.27380116818647493  -0.4384958167045705 -0.52986930552536815 -0.72592006295091183
+0.37311241287933189 0.22843691950085854 0.8984470535752207  -0.63168040245028423 -0.76918721291849312 -0.096596587118426461
+0.36295261616331187 0.66456827261077822 0.30598545619885298  -0.63692575831934428 -0.33571718293160902 -0.69398814937561637
+0.58417903277383199 0.11307342108777627 0.80253395542112949  -0.42149610172113233 -0.88421545010983937 -0.20125623970685472
+0.54662405620460941 0.13458381024047572 0.78668082109255688  -0.45308829251399874 -0.86539097215515914 -0.21403145679805555
+0.38553016581808774 0.72712117915505492 0.25975411381438562  -0.61436698850995353 -0.27300775118977855 -0.74028370995146908
+0.3269812127941315 0.73182848239968035 0.31070343884806484  -0.67285685715261234 -0.26836446324214985 -0.68937955050281408
+0.89148810692249181 0.40180685413975104 0.20692923660476614  -0.10210073274615554 -0.58661618171386265 -0.80340332070769194
+0.89390471712616404 0.39369586600014284 0.21254447256850698  -0.094036448520743485 -0.60380229511960959 -0.79156802282425331
+0.61494994375519374 0.41285875964110363 0.2879595390318832  -0.38457055427597053 -0.58712598556604001 -0.71231212670919686
+0.27256483194835279 0.73894573054988522 0.36542238876277799  -0.72726265769102505 -0.26123864468751845 -0.63469945426951124
+0.29480292285486553 0.79987185965655649 0.3198192814930475  -0.70493504308661747 -0.2002956545762126 -0.68040299513329239
+0.21891562022186883 0.87351996844576596 0.38851819872979676  -0.78064122227310362 -0.12697533232365998 -0.6119448889150485
+0.21439421228553288 0.89457789356401529 0.39128013241131548  -0.77933656932774009 -0.085925101925648492 -0.62068622392279305
+0.22681489975349647 0.89805158744476077 0.37520377518580428  -0.77933656932774031 -0.085925101925652003 -0.62068622392279227
+0.24325833978506284 0.80699455980445267 0.37542737832173323  -0.75636980999592596 -0.19358827458119465 -0.62484261256047735
+0.26642231325749544 0.86816149698298051 0.33330487729716574  -0.73311225719230455 -0.13227871496285301 -0.6671197493120562
+0.90387507728811056 0.34253810440658683 0.25355721782048274  -0.098434961242603175 -0.65866036402230721 -0.74597391594557039
+0.8104943439581207 0.5727813550993911 0.11695476797072311  -0.18329374350459399 -0.42919468968314656 -0.88441806965928715
+0.82188503772742783 0.55513243511370003 0.12315882465233799  -0.18329374350458896 -0.42919468968315838 -0.88441806965928249
+0.17124343283120957 0.51303354953721536 0.72427145868031995  -0.82881098413486531 -0.48692804957249064 -0.27563277583938756
+0.82416586116838464 0.5512195414246408 0.12458499692215486  -0.17844712110944497 -0.44918580997762658 -0.87543631012341183
+0.14564781357706014 0.50275426427774217 0.85145286645038376  -0.84903903628469102 -0.49501822108782229 -0.18463389628075103
+0.18950565604187924 0.42721864490060907 0.88304523202927676  -0.80855713981694355 -0.57905836064064831 -0.1045311753650965
+0.17811496227257201 0.44486756488630003 0.87684117534766193  -0.83034168959697252 -0.54729298896532863 -0.10489548487252294
+0.21308535079965785 0.44781653569081092 0.72457531588943425  -0.78691259802683056 -0.55218785652865865 -0.27542173873706743
+0.80253395542112949 0.58417903277383187 0.11307342108777627  -0.20125623970685647 -0.42149610172113344 -0.88421545010983849
+0.57278135509939099 0.11695476797072324 0.8104943439581207  -0.42919468968314656 -0.8844180696592876 -0.18329374350459177
+0.55513243511370003 0.12315882465233802 0.82188503772742816  -0.42919468968314917 -0.88441806965928671 -0.1832937435045901
+0.25975411381438562 0.38553016581808774 0.72712117915505492  -0.74028370995146908 -0.61436698850995353 -0.2730077511897786
+0.69598720512098966 0.66433279178978177 0.10842625325651789  -0.3042205231831675 -0.3355025674440662 -0.89156486051918826
+0.71089969747156689 0.69602657944578872 0.093129265416474039  -0.28893990864387442 -0.30244718988225744 -0.90831680955776384
+0.73781627941851213 0.66704995977036097 0.095052466200525487  -0.26739523938910531 -0.33340690397517547 -0.90406837259895956
+0.59899507473160241 0.59519261004110258 0.17821777401482342  -0.40115992505181963 -0.40477696304846328 -0.82172156155091947
+0.57848122801663848 0.53136426493733913 0.22366085201896557  -0.42177409750733513 -0.46868822204941807 -0.77616877106981597
+0.15384312033167369 0.83330295178070157 0.4938077152850564  -0.84615689033530117 -0.1674662419817517 -0.50593831119475696
+0.19642147525981468 0.81724226648384946 0.43355391658479359  -0.83354385962558741 -0.18095446661756134 -0.52197712123390316
+0.6240392221045663 0.66075903908278333 0.13769549234610645  -0.37608264246842399 -0.33912378489964834 -0.86229745711633909
+0.34253810440658672 0.25355721782048268 0.90387507728811034  -0.65866036402230654 -0.74597391594557094 -0.098434961242603078
+0.41663313718873862 0.25264179677362608 0.68197669984104492  -0.5833798856575646 -0.74719269579232772 -0.3183881033656264
+0.47222747306573276 0.23616371904645006 0.62850263027516917  -0.52785497534633896 -0.76364675610270649 -0.37176976328896
+0.44478929974988746 0.17773204761375266 0.87689701064830428  -0.51070307098913981 -0.84318764111161182 -0.16797909143371778
+0.44478929974988757 0.17773204761375261 0.87689701064830428  -0.49121775846011023 -0.85331277880252021 -0.1748210951394196
+0.59367059745735717 0.2156287616262893 0.53132295016564957  -0.40646863937642869 -0.78424095119900827 -0.46877433341209018
+0.5945258512680851 0.25807713622784767 0.46601387759394231  -0.40564529943251809 -0.74178975530654756 -0.53404105644655719
+0.65820988329399444 0.21207173177032212 0.4878002730900024  -0.34188293456237429 -0.78786613428398433 -0.51223335844459605
+0.87684117534766193 0.17811496227257195 0.44486756488630008  -0.10489548487252756 -0.83034168959697552 -0.54729298896532308
+0.87541500307784526 0.17583413883161553 0.44878045857535936  -0.11550620576389463 -0.83926746233112071 -0.53130823737479327
+0.11307342108777632 0.80253395542112949 0.58417903277383187  -0.88421545010983937 -0.20125623970685502 -0.42149610172113222
+0.13458381024047572 0.78668082109255688 0.54662405620460941  -0.86539097215515881 -0.21403145679805588 -0.4530882925139989
+0.73182848239968035 0.31070343884806484 0.3269812127941315  -0.26836446324215035 -0.68937955050281352 -0.67285685715261245
+0.1974660445788706 0.41582096722616779 0.88692657891222382  -0.79565076497466403 -0.59478368364253509 -0.11477033531295806
+0.86055952199012919 0.15594877494016784 0.48342144068564108  -0.13950752053012494 -0.83662429167606878 -0.52971449507546309
+0.62850263027516917 0.47222747306573276 0.23616371904645006  -0.37176976328896016 -0.52785497534633918 -0.76364675610270627
+0.90641151615731874 0.31222404809805687 0.28115084502736221  -0.10033016823457513 -0.68572398718655969 -0.72091363611669101
+0.86416377447305925 0.280084692934636 0.31936024911295635  -0.13609530337963746 -0.72008099426245564 -0.68041269101920621
+0.64637064705828351 0.53443495637683425 0.18870753060675916  -0.35387698305874338 -0.46550486715932277 -0.81121902067950991
+0.66879190536298361 0.59872297720557632 0.146022278379488  -0.33139575632083168 -0.40118660278746882 -0.85394740027497806
+0.2284369195008584 0.89844705357522048 0.37311241287933194  -0.7691872129184949 -0.096596587118420188 -0.6316804024502829
+0.88304523202927687 0.18950565604187924 0.42721864490060901  -0.10453117536509793 -0.80855713981694277 -0.57905836064064919
+0.86156266551879135 0.15717574894030889 0.48126519958548886  -0.11550620576387223 -0.8392674623311227 -0.53130823737479504
+0.10243968818147731 0.65340002742402614 0.72750422818221494  -0.89759648615318954 -0.34672764240957105 -0.27221405186828218
+0.09404663521954322 0.6771336059462687 0.72858929180595311  -0.91136373772562829 -0.30990719304796466 -0.27087574504909778
+0.093588483842681258 0.68777595190194329 0.7188491549726379  -0.90562084821138222 -0.30687826798314843 -0.29270566773562745
+0.79307076339523386 0.10851189307750797 0.59819314586024919  -0.20738833035095577 -0.88183387534488111 -0.42350808342754381
+0.72533155387381609 0.13425781556959904 0.58161296052541844  -0.27447137325094861 -0.86581974808662043 -0.41835586417422144
+0.2304221614978238 0.37659777085683754 0.86172631781262776  -0.76972539034249332 -0.62320039727703413 -0.13836216352689382
+0.21405999957086966 0.39229183849441451 0.893825128737608  -0.79565076497466514 -0.5947836836425332 -0.11477033531296049
+0.41057431319105175 0.79268760819673556 0.21923183214566855  -0.58928970592655916 -0.20735457304096672 -0.78085960551688671
+0.10563529941394462 0.78429103445404746 0.61001812379817821  -0.89982453013547881 -0.22723563663234655 -0.37239734211022091
+0.10617487126239181 0.78594000042913048 0.60770816150558549  -0.89197584375895012 -0.22324532177533457 -0.39311654818378772
+0.30397342055421117 0.90687073458352596 0.28910030252843322  -0.68096837004796495 -0.091975091050975982 -0.726514047779107
+0.33295004022963903 0.90494753379947446 0.2621837205814882  -0.68096837004796074 -0.091975091050969779 -0.72651404777911177
+0.90688305806336122 0.29107512591583123 0.30186484921791512  -0.10153183902938931 -0.71176658290179085 -0.6950392917868875
+0.33544566672286746 0.90463734990484679 0.25988381527545978  -0.66756092552179358 -0.10275236361909904 -0.73743092048487824
+0.35660859546245854 0.90157505838463314 0.24184951424973428  -0.65387638494521072 -0.11348698498785352 -0.74804169499390172
+0.65873185103125675 0.17239185158024484 0.55435349976840143  -0.34127086350966052 -0.82760959526572686 -0.44564173451716843
+0.66075903908278333 0.13769549234610645 0.6240392221045663  -0.33912378489964845 -0.86229745711633887 -0.37608264246842443
+0.66433279178978177 0.10842625325651789 0.69598720512098966  -0.33550256744406565 -0.89156486051918848 -0.30422052318316761
+0.59872297720557655 0.14602227837948789 0.66879190536298361  -0.40118660278746798 -0.85394740027497873 -0.33139575632083107
+0.35918321758479477 0.90105806124803856 0.2396774265565649  -0.6391363644711574 -0.10365825365836158 -0.76207589783373331
+0.38998187620182156 0.89436470058605533 0.2157089655459527  -0.60955597917046789 -0.10429556095739143 -0.78585236795603985
+0.39229183849441457 0.893825128737608 0.21405999957086966  -0.59478368364252665 -0.11477033531296484 -0.79565076497466936
+0.4938077152850564 0.15384312033167369 0.83330295178070157  -0.50593831119476118 -0.8461568903352984 -0.16746624198175186
+0.48428397075672935 0.17598126576074047 0.76541504139377881  -0.51562318151862274 -0.82387113061171757 -0.23530638500725776
+0.87149140923129176 0.45766135056489032 0.17031256632806041  -0.1421893094643126 -0.5308742118974118 -0.83543687458500648
+0.42721864490060907 0.88304523202927676 0.18950565604187924  -0.57905836064064853 -0.1045311753650965 -0.80855713981694344
+0.44486756488630003 0.87684117534766193 0.17811496227257201  -0.54729298896532785 -0.10489548487252347 -0.83034168959697296
+0.44878045857535931 0.87541500307784514 0.17583413883161553  -0.53130823737479782 -0.11550620576389242 -0.83926746233111804
+0.48126519958548886 0.86156266551879135 0.15717574894030889  -0.53130823737479482 -0.11550620576387369 -0.8392674623311227
+0.48342144068564108 0.86055952199012919 0.15594877494016784  -0.5297144950754632 -0.13950752053012463 -0.83662429167606889
+0.50017470245974227 0.85269038907862327 0.14688267020077073  -0.51152737254410519 -0.17406896607439884 -0.84145097432227989
+0.50275426427774217 0.85145286645038376 0.14564781357706019  -0.49501822108782267 -0.18463389628074997 -0.84903903628469102
+0.51101182387798261 0.84695178356442291 0.1418121948905855  -0.47782642632713779 -0.1738177482264345 -0.86108611456980788
+0.72457531588943425 0.21308535079965785 0.44781653569081092  -0.27542173873706716 -0.78691259802683089 -0.55218785652865821
+0.13843733448120882 0.84282425105969117 0.51873480041451081  -0.86578380003691935 -0.15629656115484478 -0.47538384129543304
+0.12458499692215494 0.8241658611683842 0.55121954142464069  -0.8754363101234176 -0.17844712110944952 -0.44918580997761376
+0.59819314586024919 0.79307076339523386 0.10851189307750808  -0.42350808342754237 -0.20738833035095647 -0.88183387534488167
+0.60630413399985716 0.78745552743149316 0.10609528287383588  -0.42092243512975569 -0.23042761042597448 -0.87734110809753574
+0.60871986758868468 0.7856057877144671 0.10542210643598449  -0.40347958770452141 -0.24084616951439972 -0.88272155572186539
+0.68777595190194318 0.71884915497263779 0.093588483842681258  -0.30687826798314988 -0.2927056677356259 -0.90562084821138222
+0.70892487408416871 0.69813515078208477 0.093116941936638775  -0.30687826798315454 -0.29270566773562146 -0.90562084821138211
+0.53960691129913441 0.15896669732792423 0.71592045537741111  -0.46019616855581275 -0.84103034646625374 -0.28440717777405522
+0.74011618472454055 0.66455433327713243 0.095362650095153087  -0.26377483182397443 -0.35458300388089659 -0.8970472292220929
+0.095052466200525557 0.7378162794185118 0.66704995977036108  -0.90406837259896011 -0.26739523938910531 -0.33340690397517397
+0.61001812379817832 0.1056352994139447 0.78429103445404746  -0.37239734211019399 -0.89982453013548891 -0.2272356366323508
+0.39128013241131554 0.21439421228553296 0.89457789356401551  -0.62068622392279083 -0.77933656932774165 -0.085925101925650879
+0.37520377518580433 0.2268148997534965 0.89805158744476099  -0.62068622392279449 -0.77933656932773798 -0.085925101925657416
+0.42357936956725517 0.2222334481665994 0.74936391388968104  -0.57611676249591803 -0.77788041909855332 -0.25098113386125454
+0.47706071813732454 0.2035685499476273 0.69630368317606428  -0.52285425410030473 -0.79638679287413017 -0.30395970967362002
+0.84405122505983243 0.51657855931435837 0.13944047800987086  -0.13902973540250699 -0.48165648852028187 -0.86526167125339637
+0.85311732979922938 0.49982529754025784 0.14730961092137679  -0.13902973540250152 -0.48165648852027632 -0.86526167125340026
+0.85435218642293986 0.49724573572225761 0.14854713354961632  -0.13337026124728302 -0.50082503649439758 -0.85521146872292175
+0.85818780510941439 0.48898817612201739 0.15304821643557714  -0.12764403935076005 -0.51974293683794126 -0.84473325897900675
+0.093116941936638664 0.70892487408416871 0.69813515078208499  -0.90562084821138389 -0.30687826798314355 -0.29270566773562745
+0.89457789356401518 0.39128013241131554 0.21439421228553296  -0.085925101925655112 -0.62068622392278239 -0.77933656932774786
+0.89805158744476099 0.37520377518580428 0.22681489975349656  -0.085925101925653266 -0.62068622392278971 -0.7793365693277422
+0.89844705357522048 0.37311241287933194 0.22843691950085848  -0.096596587118421631 -0.63168040245028001 -0.76918721291849712
+0.79987185965655649 0.3198192814930475 0.29480292285486542  -0.20029565457621079 -0.68040299513329394 -0.7049350430866167
+0.90687073458352596 0.28910030252843322 0.30397342055421112  -0.091975091050968044 -0.72651404777911632 -0.68096837004795607
+0.90494753379947435 0.26218372058148809 0.33295004022963903  -0.09197509105096896 -0.72651404777911277 -0.68096837004795985
+0.90463734990484679 0.25988381527545973 0.33544566672286741  -0.10275236361909779 -0.7374309204848789 -0.66756092552179302
+0.90157505838463314 0.24184951424973419 0.35660859546245843  -0.11348698498785316 -0.74804169499390172 -0.65387638494521072
+0.12850859076870802 0.5423386494351099 0.82968743367193953  -0.8726529832451867 -0.46036815782147361 -0.16290466567087283
+0.85269038907862327 0.14688267020077067 0.50017470245974227  -0.17406896607440767 -0.84145097432228499 -0.51152737254409342
+0.85145286645038376 0.14564781357706019 0.50275426427774228  -0.18463389628075721 -0.84903903628469579 -0.49501822108781179
+0.84695178356442291 0.1418121948905855 0.51101182387798261  -0.17381774822643642 -0.86108611456980844 -0.4778264263271359
+0.72427145868031995 0.17124343283120957 0.51303354953721536  -0.27563277583938722 -0.82881098413486542 -0.48692804957249064
+0.25355721782048268 0.90387507728811056 0.34253810440658672  -0.74597391594556905 -0.098434961242601149 -0.65866036402230899
+0.25671454238163 0.90442701067601727 0.33903474443581866  -0.73279395097326672 -0.089584884642380694 -0.67452766723137525
+0.78745552743149327 0.10609528287383579 0.60630413399985716  -0.23042761042597421 -0.87734110809753507 -0.42092243512975747
+0.7856057877144671 0.1054221064359844 0.60871986758868468  -0.24084616951439833 -0.88272155572186395 -0.40347958770452563
+0.77318510024650355 0.10194841255523886 0.62479622481419606  -0.23977066491307256 -0.89859032272363271 -0.36748531964499037
+0.72750422818221494 0.10243968818147731 0.65340002742402614  -0.27221405186828201 -0.89759648615318943 -0.3467276424095711
+0.78429103445404746 0.6100181237981781 0.10563529941394456  -0.22723563663234803 -0.37239734211022291 -0.8998245301354777
+0.78594000042913048 0.60770816150558526 0.10617487126239181  -0.22324532177533571 -0.3931165481837911 -0.89197584375894834
+0.7188491549726379 0.093588483842681258 0.68777595190194329  -0.29270566773562778 -0.90562084821138222 -0.30687826798314849
+0.69813515078208488 0.093116941936638664 0.70892487408416871  -0.29270566773562989 -0.90562084821138422 -0.30687826798314011
+0.69602657944578872 0.09312926541647408 0.71089969747156689  -0.30244718988226571 -0.90831680955776661 -0.28893990864385721
+0.66704995977036097 0.095052466200525487 0.73781627941851213  -0.33340690397517442 -0.90406837259895989 -0.26739523938910548
+0.66455433327713243 0.095362650095153115 0.74011618472454044  -0.35458300388089614 -0.89704722922209301 -0.26377483182397454
+0.4576613505648901 0.17031256632806047 0.87149140923129198  -0.53087421189741213 -0.83543687458500637 -0.14218930946431241
+0.51873480041451092 0.13843733448120876 0.84282425105969128  -0.47538384129543526 -0.86578380003691979 -0.15629656115483562
+0.51657855931435848 0.13944047800987086 0.84405122505983243  -0.48165648852028631 -0.86526167125339626 -0.1390297354024923
+0.49982529754025784 0.14730961092137679 0.85311732979922927  -0.48165648852027843 -0.86526167125339926 -0.13902973540250141
+0.49724573572225761 0.14854713354961635 0.85435218642293975  -0.50082503649440013 -0.85521146872292031 -0.13337026124728185
+0.5512195414246408 0.12458499692215487 0.82416586116838453  -0.44918580997761759 -0.87543631012341605 -0.17844712110944738
+0.4889881761220175 0.15304821643557709 0.85818780510941428  -0.51974293683794004 -0.84473325897900731 -0.12764403935075999
+0.18610643753537565 0.88125255845135109 0.43210633013751576  -0.803265783550005 -0.12230648174951479 -0.58292813064721116
+0.40180685413975104 0.20692923660476614 0.89148810692249203  -0.5866161817138611 -0.80340332070769316 -0.10210073274615575
+0.39369586600014284 0.21254447256850689 0.89390471712616426  -0.60380229511961647 -0.79156802282424821 -0.094036448520741819
+0.29107512591583118 0.30186484921791523 0.90688305806336111  -0.71176658290178951 -0.69503929178688884 -0.10153183902938953
+0.28910030252843322 0.30397342055421112 0.90687073458352596  -0.72651404777911321 -0.68096837004795918 -0.091975091050969751
+0.26218372058148809 0.33295004022963903 0.90494753379947435  -0.72651404777911355 -0.68096837004795885 -0.091975091050969598
+0.25988381527545967 0.33544566672286746 0.9046373499048469  -0.73743092048488035 -0.66756092552179125 -0.10275236361909888
+0.13944047800987086 0.84405122505983243 0.51657855931435837  -0.86526167125339581 -0.13902973540250196 -0.48165648852028409
+0.14730961092137673 0.85311732979922927 0.49982529754025784  -0.86526167125339193 -0.13902973540249708 -0.48165648852029269
+0.24184951424973422 0.35660859546245849 0.90157505838463314  -0.74804169499390449 -0.65387638494520794 -0.11348698498785119
+0.23967742655656488 0.35918321758479488 0.90105806124803856  -0.76207589783374741 -0.6391363644711423 -0.10365825365835028
+0.21570896554595276 0.38998187620182156 0.89436470058605511  -0.78585236795603508 -0.60955597917047488 -0.10429556095738585
+0.5423386494351099 0.82968743367193953 0.12850859076870802  -0.46036815782147295 -0.16290466567087286 -0.87265298324518703
+0.17031256632806052 0.87149140923129198 0.45766135056488999  -0.83543687458500626 -0.14218930946431413 -0.5308742118974118
+0.15594877494016784 0.48342144068564108 0.86055952199012919  -0.83662429167606489 -0.52971449507545842 -0.13950752053016663
+0.14688267020077073 0.50017470245974227 0.85269038907862316  -0.841450974322278 -0.51152737254410885 -0.17406896607439667
+0.12310298935169575 0.55521070025011254 0.82226795238624728  -0.53327406489332096 -0.82790895881410698 0.17373982740723351
+0.12310298935169572 0.55521070025011254 0.82226795238624728  -0.54968722070380216 -0.8192764596721801 0.16318713804080384
+0.60770816150558538 0.10617487126239183 0.78594000042913037  -0.39311654818376113 -0.89197584375896022 -0.22324532177534065
+0.10609528287383586 0.60630413399985694 0.78745552743149316  -0.8773411080975384 -0.42092243512974681 -0.23042761042598092
+0.1054221064359845 0.60871986758868468 0.78560578771446687  -0.88272155572186761 -0.40347958770451392 -0.24084616951440482
+0.10194841255523887 0.62479622481419628 0.77318510024650311  -0.89859032272365447 -0.36748531964495296 -0.23977066491304833
+0.093129265416474122 0.71089969747156689 0.69602657944578861  -0.90831680955776617 -0.28893990864386143 -0.30244718988226327
+0.11695476797072325 0.81049434395812059 0.57278135509939099  -0.8844180696592876 -0.18329374350459199 -0.42919468968314661
+0.12315882465233809 0.82188503772742783 0.55513243511370003  -0.88441806965928849 -0.18329374350459163 -0.42919468968314495
+0.14854713354961635 0.85435218642293975 0.49724573572225772  -0.85521146872291565 -0.13337026124727644 -0.50082503649440979
+0.15304821643557709 0.8581878051094145 0.48898817612201739  -0.84473325897900953 -0.12764403935076055 -0.51974293683793649
+0.90105806124803867 0.23967742655656488 0.35918321758479488  -0.10365825365834472 -0.76207589783375485 -0.63913636447113442
+0.20692923660476614 0.89148810692249181 0.40180685413975092  -0.80340332070769493 -0.10210073274615485 -0.58661618171385899
+0.21254447256850684 0.89390471712616404 0.39369586600014272  -0.79156802282424854 -0.094036448520740834 -0.60380229511961614
+0.271410708194047 0.90595336478045674 0.32286639405373113  -0.73279395097327094 -0.089584884642380916 -0.67452766723137081
+0.17773204761375266 0.87689701064830428 0.44478929974988746  -0.8431876411116126 -0.16797909143371931 -0.51070307098913825
+0.17773204761375261 0.87689701064830428 0.44478929974988757  -0.85331277880251977 -0.17482109513942032 -0.49121775846011068
+0.095572989323982657 0.66096525556418162 0.74328545761836984  -0.91299254504581251 -0.33091024020101323 -0.23862737818799784
+0.096124922711889493 0.65746189559341328 0.74644278217951743  -0.90894237800239819 -0.3488969399841057 -0.22824258748330259
+0.10155294642477933 0.62688758712066828 0.77156308049914146  -0.90894237800240729 -0.34889693998408949 -0.22824258748329093
+0.15717574894030886 0.48126519958548875 0.86156266551879135  -0.83926746233111815 -0.53130823737479316 -0.11550620576391485
+0.1758341388316155 0.44878045857535931 0.87541500307784526  -0.83926746233111738 -0.53130823737479949 -0.11550620576389151
+0.65746189559341328 0.74644278217951743 0.096124922711889452  -0.34889693998411037 -0.22824258748330298 -0.9089423780023963
+0.55521070025011254 0.82226795238624728 0.12310298935169572  -0.82500541278991768 0.14198652391981292 -0.54699716260005027
+0.56789366986248413 0.81389356246462441 0.11874744154864894  -0.42585755017737426 -0.18423339416733803 -0.88583486239282072
+0.82226795238624728 0.12310298935169575 0.55521070025011254  0.15282936104497993 -0.53077402771794835 -0.83361988814006216
+0.82968743367193953 0.12850859076870802 0.5423386494351099  -0.16290466567087286 -0.87265298324518703 -0.46036815782147295
+0.72858929180595311 0.094046635219543179 0.67713360594626881  -0.27087574504909789 -0.91136373772562818 -0.30990719304796477
+0.74328545761837006 0.095572989323982602 0.66096525556418162  -0.23862737818799901 -0.91299254504581306 -0.3309102402010109
+0.74644278217951743 0.096124922711889466 0.65746189559341328  -0.22824258748330467 -0.90894237800239863 -0.34889693998410287
+0.77156308049914157 0.1015529464247792 0.62688758712066828  -0.2282425874833155 -0.90894237800238642 -0.34889693998412763
+0.88692657891222382 0.1974660445788706 0.41582096722616779  -0.11477033531295869 -0.79565076497466314 -0.5947836836425362
+0.893825128737608 0.21405999957086963 0.39229183849441451  -0.11477033531296069 -0.79565076497466491 -0.59478368364253331
+0.89436470058605533 0.2157089655459527 0.38998187620182156  -0.10429556095738564 -0.78585236795603453 -0.60955597917047577
+0.87689701064830428 0.44478929974988757 0.17773204761375266  -0.14246063051294039 -0.57899414632358714 -0.80278935423738407
+0.87689701064830428 0.44478929974988757 0.17773204761375266  -0.15667459091348981 -0.54178151488020398 -0.82578802528021811
+0.76032257344343512 0.64081678241520534 0.098941938751961195  -0.2272356366323571 -0.37239734211020747 -0.8998245301354818
+0.758150485750266 0.64339140453754151 0.098424941615366718  -0.24555619785558999 -0.36356562872995413 -0.89862238304022868
+0.55521070025011254 0.82226795238624728 0.12310298935169575  -0.83361988814006216 0.15282936104497993 -0.53077402771794835
+3  0 1 2
+3  3 4 5
+3  6 7 8
+3  9 10 11
+3  12 13 14
+3  15 16 17
+3  18 13 12
+3  14 13 19
+3  12 20 21
+3  22 23 24
+3  25 26 27
+3  19 13 28
+3  29 23 30
+3  28 13 31
+3  32 33 34
+3  35 36 37
+3  38 39 40
+3  31 13 18
+3  41 42 43
+3  44 45 38
+3  46 47 37
+3  12 42 18
+3  18 42 41
+3  43 42 48
+3  48 42 21
+3  35 49 19
+3  21 42 12
+3  50 51 52
+3  46 36 53
+3  54 55 56
+3  57 54 58
+3  21 20 59
+3  60 61 62
+3  63 64 40
+3  41 65 66
+3  37 36 46
+3  59 20 67
+3  67 20 68
+3  69 70 11
+3  71 72 8
+3  68 20 14
+3  14 20 12
+3  73 74 75
+3  14 49 68
+3  9 76 77
+3  78 79 80
+3  68 49 81
+3  25 82 83
+3  84 85 6
+3  86 87 88
+3  78 89 90
+3  81 49 91
+3  31 85 28
+3  91 49 35
+3  30 23 22
+3  92 93 11
+3  66 94 8
+3  19 49 14
+3  95 96 97
+3  98 99 100
+3  53 36 28
+3  19 36 35
+3  101 102 60
+3  59 103 21
+3  83 104 5
+3  28 36 19
+3  105 25 5
+3  28 85 53
+3  53 85 106
+3  106 85 84
+3  107 76 108
+3  109 110 111
+3  112 73 30
+3  113 51 114
+3  6 85 31
+3  31 7 6
+3  34 33 115
+3  113 65 116
+3  117 118 101
+3  119 120 121
+3  8 7 66
+3  116 65 43
+3  122 123 124
+3  66 7 41
+3  125 90 126
+3  48 33 43
+3  43 65 41
+3  40 64 127
+3  128 120 37
+3  41 7 18
+3  0 129 130
+3  22 131 30
+3  18 7 31
+3  116 33 32
+3  66 65 114
+3  114 65 113
+3  48 103 115
+3  43 33 116
+3  128 47 54
+3  115 33 48
+3  132 122 133
+3  115 103 134
+3  134 103 107
+3  107 103 59
+3  21 103 48
+3  59 76 107
+3  108 76 9
+3  96 135 25
+3  77 76 67
+3  67 76 59
+3  67 136 77
+3  111 137 138
+3  77 136 139
+3  139 136 140
+3  75 141 142
+3  140 136 81
+3  81 136 68
+3  34 143 24
+3  68 136 67
+3  81 144 140
+3  140 144 145
+3  146 147 148
+3  145 144 149
+3  149 144 119
+3  119 144 91
+3  91 144 81
+3  91 120 119
+3  121 120 128
+3  37 120 35
+3  145 150 90
+3  35 120 91
+3  37 47 128
+3  151 16 15
+3  54 47 58
+3  58 47 98
+3  98 47 46
+3  122 152 153
+3  46 99 98
+3  100 99 154
+3  1 0 69
+3  154 99 106
+3  122 153 155
+3  3 72 71
+3  106 99 53
+3  156 102 101
+3  53 99 46
+3  157 158 118
+3  106 159 154
+3  122 160 152
+3  154 159 101
+3  101 159 117
+3  138 161 162
+3  117 159 163
+3  164 165 166
+3  167 168 108
+3  163 159 84
+3  84 159 106
+3  169 170 121
+3  114 94 66
+3  84 72 163
+3  167 70 171
+3  163 72 3
+3  172 26 25
+3  8 72 6
+3  9 70 108
+3  6 72 84
+3  8 94 71
+3  71 94 173
+3  173 94 174
+3  174 94 114
+3  114 51 174
+3  175 97 176
+3  174 51 50
+3  52 51 177
+3  177 51 113
+3  113 178 177
+3  177 178 179
+3  179 178 44
+3  180 181 64
+3  44 178 32
+3  32 178 116
+3  54 182 183
+3  116 178 113
+3  32 45 44
+3  38 45 184
+3  184 45 24
+3  24 45 34
+3  34 45 32
+3  157 118 185
+3  24 143 22
+3  64 186 127
+3  22 143 187
+3  15 188 189
+3  190 191 133
+3  187 143 134
+3  146 192 150
+3  134 143 115
+3  115 143 34
+3  134 168 187
+3  187 168 190
+3  64 193 180
+3  190 168 167
+3  64 194 186
+3  108 168 107
+3  112 131 133
+3  107 168 134
+3  108 70 167
+3  171 70 69
+3  195 196 197
+3  198 199 88
+3  63 39 189
+3  11 70 9
+3  11 10 92
+3  185 200 201
+3  92 10 202
+3  202 10 139
+3  54 203 204
+3  139 10 77
+3  77 10 9
+3  139 89 202
+3  202 89 78
+3  90 89 145
+3  145 89 140
+3  140 89 139
+3  126 90 150
+3  125 205 90
+3  90 205 206
+3  207 189 188
+3  90 206 208
+3  208 209 90
+3  52 210 211
+3  209 78 90
+3  212 213 211
+3  214 78 209
+3  214 215 78
+3  216 78 215
+3  52 213 50
+3  216 79 78
+3  217 97 218
+3  219 73 124
+3  79 220 80
+3  80 220 221
+3  221 222 80
+3  80 222 223
+3  78 80 202
+3  80 223 224
+3  224 92 80
+3  202 80 92
+3  225 92 224
+3  225 226 92
+3  227 92 226
+3  227 93 92
+3  127 228 40
+3  57 55 54
+3  11 93 69
+3  229 183 230
+3  231 69 93
+3  232 69 231
+3  233 69 232
+3  233 1 69
+3  71 4 3
+3  69 0 171
+3  171 0 164
+3  234 164 0
+3  235 164 234
+3  130 234 0
+3  165 164 235
+3  111 138 236
+3  166 237 164
+3  237 132 164
+3  123 122 155
+3  58 238 57
+3  132 191 164
+3  239 111 110
+3  5 104 3
+3  164 191 171
+3  171 191 167
+3  167 191 190
+3  50 213 236
+3  133 191 132
+3  96 240 241
+3  133 122 112
+3  242 243 218
+3  112 122 124
+3  124 123 244
+3  124 244 245
+3  124 245 246
+3  124 246 247
+3  124 247 219
+3  124 73 112
+3  197 248 58
+3  30 73 29
+3  29 73 75
+3  75 74 141
+3  75 142 249
+3  75 249 250
+3  75 250 251
+3  251 15 75
+3  75 15 29
+3  29 15 252
+3  252 15 189
+3  218 97 242
+3  207 253 189
+3  189 253 254
+3  255 189 254
+3  255 256 189
+3  256 63 189
+3  189 39 252
+3  252 39 184
+3  184 39 38
+3  40 39 63
+3  50 243 174
+3  60 102 257
+3  258 127 186
+3  258 259 127
+3  260 127 259
+3  260 88 127
+3  127 88 261
+3  262 263 150
+3  261 88 199
+3  264 199 198
+3  265 199 264
+3  265 266 199
+3  266 267 199
+3  199 267 211
+3  132 268 269
+3  211 267 212
+3  96 241 135
+3  270 212 267
+3  270 271 212
+3  271 272 212
+3  212 272 273
+3  212 273 274
+3  274 111 212
+3  111 213 212
+3  100 195 98
+3  211 213 52
+3  236 213 111
+3  176 97 275
+3  236 138 218
+3  218 138 217
+3  276 217 138
+3  217 276 277
+3  217 277 278
+3  217 278 279
+3  280 276 138
+3  279 281 217
+3  217 281 275
+3  170 282 146
+3  275 97 217
+3  242 97 105
+3  105 97 96
+3  95 283 96
+3  284 96 283
+3  284 240 96
+3  172 25 135
+3  184 23 252
+3  25 27 82
+3  285 83 82
+3  83 285 286
+3  83 286 287
+3  83 287 288
+3  169 289 290
+3  291 83 288
+3  83 291 200
+3  291 292 200
+3  24 23 184
+3  292 293 200
+3  227 294 93
+3  293 201 200
+3  187 131 22
+3  185 118 200
+3  200 118 117
+3  295 170 169
+3  118 296 101
+3  151 15 251
+3  297 101 296
+3  156 101 297
+3  60 257 298
+3  60 298 299
+3  300 111 239
+3  60 299 61
+3  60 62 100
+3  301 100 62
+3  301 302 100
+3  15 17 188
+3  302 303 100
+3  303 195 100
+3  98 195 58
+3  197 58 195
+3  248 304 58
+3  58 304 238
+3  54 56 203
+3  182 54 204
+3  183 182 305
+3  183 305 306
+3  183 306 230
+3  183 229 169
+3  169 229 289
+3  169 290 307
+3  307 308 169
+3  169 308 295
+3  121 170 119
+3  119 170 149
+3  309 63 256
+3  149 170 146
+3  146 282 310
+3  146 310 311
+3  311 147 146
+3  146 148 192
+3  262 150 192
+3  150 263 312
+3  150 312 126
+3  88 87 198
+3  146 150 149
+3  149 150 145
+3  282 170 313
+3  313 170 314
+3  314 170 295
+3  211 210 199
+3  121 183 169
+3  128 183 121
+3  54 183 128
+3  195 315 196
+3  315 195 316
+3  316 195 317
+3  303 317 195
+3  154 60 100
+3  101 60 154
+3  118 318 296
+3  118 319 318
+3  118 158 319
+3  117 104 200
+3  200 104 83
+3  3 104 163
+3  242 4 173
+3  163 104 117
+3  5 4 105
+3  105 4 242
+3  0 2 320
+3  173 4 71
+3  173 243 242
+3  218 243 236
+3  236 243 50
+3  93 321 322
+3  174 243 173
+3  5 25 83
+3  96 25 105
+3  175 95 97
+3  261 228 127
+3  138 162 280
+3  40 228 38
+3  138 137 161
+3  137 111 300
+3  274 109 111
+3  199 210 261
+3  261 210 179
+3  179 210 177
+3  323 88 324
+3  177 210 52
+3  179 228 261
+3  38 228 44
+3  44 228 179
+3  267 325 270
+3  326 325 267
+3  267 327 326
+3  267 328 327
+3  267 266 328
+3  86 88 323
+3  260 324 88
+3  64 181 194
+3  193 64 329
+3  329 64 63
+3  329 63 330
+3  331 330 63
+3  309 331 63
+3  252 23 29
+3  30 131 112
+3  133 131 190
+3  190 131 187
+3  74 73 332
+3  332 73 333
+3  333 73 219
+3  160 122 132
+3  269 160 132
+3  132 334 268
+3  132 335 334
+3  335 132 237
+3  0 320 129
+3  93 322 231
+3  321 93 336
+3  336 93 294
+
diff --git a/Data/data/meshes/polyhedral_complex_of_spheres/Sphere1.off b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere1.off
new file mode 100644
index 000000000000..5fdcdf1dfbf0
--- /dev/null
+++ b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere1.off
@@ -0,0 +1,6626 @@
+NOFF
+2352 4270 0
+
+1.2256505459452103e-18 0.52573111211913359 0.85065080835203988  1.388661766875189e-17 0.52573111211913404 0.85065080835203954
+1.2256505459452101e-18 0.52573111211913348 -0.85065080835203999  -1.0484396339907674e-15 0.52573111211913315 -0.85065080835204021
+-1.2256505459452103e-18 -0.52573111211913359 0.85065080835203988  -9.9611599730051306e-17 -0.52573111211913437 0.85065080835203932
+1.2256505459452103e-18 -0.52573111211913359 -0.85065080835203988  9.9611599730051306e-17 -0.52573111211913437 -0.85065080835203932
+0.52573111211913348 0.8506508083520401 2.4513010918904207e-18  0.5257311121191327 0.85065080835204043 6.9433088343759452e-18
+0.65693999760682842 -0.28335434223766309 0.69755165300174249  0.64093662140152763 -0.29301330949338761 0.70946701671474999
+-0.52573111211913359 0.85065080835203988 -1.2256505459452105e-18  -0.52573111211913337 0.8506508083520401 -1.388661766875189e-17
+-0.52573111211913359 -0.85065080835203988 1.2256505459452103e-18  -0.52573111211913337 -0.8506508083520401 6.9433088343759452e-18
+0.65068017874670425 -0.29325931385704496 0.69911600851089584  0.64093662140152674 -0.29301330949339122 0.7094670167147491
+0.5673118184816528 -0.42664579118104884 0.70294074606773105  0.56065793252598239 -0.42546670457134783 0.71038071904922118
+-0.85065080835203988 -1.2256505459452103e-18 0.52573111211913359  -0.85065080835204032 0 0.52573111211913282
+-0.85065080835203988 0 -0.52573111211913359  -0.8506508083520401 1.388661766875189e-17 -0.52573111211913337
+0.35682208977308999 -6.1608256340360548e-19 0.93417235896271567  0.35662245495100658 0.00037008290847638232 0.9342485149377322
+0.096124922711889493 0.65746189559341328 0.74644278217951743  0.098434961242597513 0.65866036402231631 0.74597391594556317
+-1.2321651268072113e-18 0.93417235896271567 0.35682208977308999  6.2516454557622656e-17 0.9340197911216388 0.35722126167557611
+-0.57735026918962573 0.57735026918962573 0.57735026918962573  -0.57762605998672456 0.57702725326215809 0.57739733617063216
+-0.3568220897730901 -1.2321651268072113e-18 0.93417235896271567  -0.35662245495100664 -0.00037008290847641539 0.9342485149377322
+0.3568220897730901 -1.2321651268072113e-18 -0.93417235896271567  0.35662245495100664 -0.00037008290847641539 -0.9342485149377322
+-0.35682208977308999 -6.1608256340360548e-19 -0.93417235896271567  -0.35662245495100658 0.00037008290847638232 -0.9342485149377322
+-0.57735026918962573 0.57735026918962573 -0.57735026918962584  -0.5773973361706326 0.57762605998672578 -0.57702725326215654
+1.232165126807211e-18 0.93417235896271567 -0.35682208977308988  0.00037008290847623823 0.93424851493773231 -0.35662245495100647
+0.57735026918962573 0.57735026918962584 -0.57735026918962573  0.57739733617063249 0.57762605998672567 -0.57702725326215687
+0.57556494808430092 -0.41363385795819674 0.70422028778974766  0.56065793252598373 -0.42546670457134467 0.71038071904922195
+-1.2321651268072113e-18 -0.93417235896271567 0.3568220897730901  -8.6828409107809262e-17 -0.93401979112163858 0.35722126167557655
+-6.1608256340360548e-19 -0.93417235896271567 -0.35682208977308999  -0.00037008290847624512 -0.9342485149377322 -0.35662245495100653
+0.53310523682898847 -0.4813361142748796 0.69462568959831961  0.51449014281491778 -0.48894277869645536 0.70443938852599275
+0.52912853141459681 -0.48757002987147369 0.69320320770179855  0.51449014281491923 -0.48894277869645164 0.7044393885259943
+0.93417235896271567 0.35682208977308999 -6.1608256340360548e-19  0.93401979112163858 0.35722126167557655 6.5989590921935035e-17
+-0.57735026918962573 -0.57735026918962584 -0.57735026918962573  -0.57739733617063249 -0.57762605998672567 -0.57702725326215687
+-0.93417235896271567 -0.3568220897730901 1.2321651268072113e-18  -0.93424851493773231 -0.35662245495100647 0.000370082908476167
+-0.57735026918962584 -0.57735026918962573 0.57735026918962573  -0.57702725326215654 -0.5773973361706326 0.57762605998672578
+-0.93417235896271567 0.35682208977308988 1.232165126807211e-18  -0.93424851493773231 0.35662245495100647 0.00037008290847623823
+0.093116941936638636 0.70892487408416871 0.69813515078208488  0.10153183902938243 0.71176658290179906 0.69503929178688006
+0.098941938751961223 0.76032257344343512 0.64081678241520534  0.10365825365834723 0.76207589783375107 0.63913636447113853
+-0.20469785983476813 0.7324851174314404 0.64927986178574382  -0.20481384113375084 0.73258235910829972 0.64913355914122695
+-0.33120809463701684 0.40127702279442379 0.85397772162051189  -0.33139575632083101 0.40118660278746837 0.85394740027497851
+0 0.19657916295965558 0.98048795642276054  0 0.19637276165371687 0.98052931546205824
+0 0.19657916295965555 -0.98048795642276054  0 0.19637276165371681 -0.98052931546205824
+-0.33120809463701684 0.40127702279442373 -0.85397772162051189  -0.33139575632083124 0.40118660278746759 -0.85394740027497884
+-0.20469785983476813 0.7324851174314404 -0.64927986178574382  -0.20481384113375198 0.73258235910829961 -0.64913355914122683
+0.20469785983476813 0.7324851174314404 -0.64927986178574382  0.20481384113375084 0.73258235910829972 -0.64913355914122695
+0.33120809463701684 0.40127702279442368 -0.85397772162051189  0.33139575632083101 0.40118660278746837 -0.85394740027497862
+0.6921217709628692 -0.22700206765185593 0.68413337702600874  0.675316374147652 -0.22527759233948189 0.70228042917184774
+0.19657916295965552 -0.98048795642276054 0  0.19637276165371559 -0.98052931546205846 1.2846466075503158e-15
+0.79848519772427506 -0.057250790914286052 0.59888293763788747  0.78019094274164136 -0.041329938271313364 0.62417459822264354
+0.36517401588679055 -0.75 0.54975734503310159  0.36351224121617881 -0.75900083470875102 0.54016347840020607
+0.35314170479917451 -0.76928684914828649 0.53075413092765567  0.36351224121614184 -0.75900083470875135 0.54016347840023049
+0.78745552743149327 0.10609528287383579 0.60630413399985716  0.79156802282425154 0.094036448520738461 0.6038022951196127
+-0.33120809463701678 -0.40127702279442368 -0.85397772162051189  -0.33139575632083101 -0.40118660278746837 -0.85394740027497862
+-0.98048795642276054 0 -0.19657916295965552  -0.98052931546205824 0 -0.19637276165371681
+-0.64927986178574371 -0.20469785983476807 0.7324851174314404  -0.6491335591412265 -0.20481384113375173 0.73258235910829994
+-0.7324851174314404 0.64927986178574382 0.20469785983476813  -0.73258235910829972 0.64913355914122695 0.20481384113375084
+0 -0.19657916295965555 0.98048795642276054  0 -0.19637276165371681 0.98052931546205824
+0.64927986178574382 -0.20469785983476813 0.7324851174314404  0.64913355914122695 -0.20481384113375084 0.73258235910829972
+0.26218372058148809 0.33295004022963903 0.90494753379947435  0.2673952393891102 0.33340690397516021 0.90406837259896367
+0.82226795238624728 0.12310298935169575 0.55521070025011254  0.68977993107147029 0.080588876905648907 0.71952003419649402
+0.11695476797072325 0.81049434395812059 0.57278135509939099  0.10453117536509926 0.80855713981694211 0.57905836064064986
+-0.19657916295965552 0.98048795642276054 0  -0.19637276165371681 0.98052931546205824 0
+-0.40127702279442368 0.85397772162051189 0.33120809463701684  -0.40118660278746832 0.85394740027497862 0.33139575632083096
+-0.85397772162051189 0.33120809463701684 0.40127702279442379  -0.85394740027497851 0.33139575632083101 0.40118660278746837
+-0.64927986178574382 0.20469785983476813 0.7324851174314404  -0.64913355914122695 0.20481384113375084 0.73258235910829972
+-0.33120809463701684 -0.40127702279442373 0.85397772162051189  -0.33139575632083124 -0.40118660278746759 0.85394740027497884
+0.64927986178574382 0.20469785983476813 -0.7324851174314404  0.64913355914122695 0.20481384113375084 -0.73258235910829972
+0.33120809463701684 -0.40127702279442373 -0.85397772162051189  0.33139575632083124 -0.40118660278746759 -0.85394740027497884
+0 -0.19657916295965558 -0.98048795642276054  0 -0.19637276165371687 -0.98052931546205824
+-0.64927986178574382 -0.20469785983476813 -0.7324851174314404  -0.64913355914122695 -0.20481384113375084 -0.73258235910829972
+-0.64927986178574371 0.20469785983476807 -0.7324851174314404  -0.6491335591412265 0.20481384113375173 -0.73258235910829994
+-0.7324851174314404 0.64927986178574382 -0.20469785983476813  -0.73258235910829961 0.64913355914122695 -0.20481384113375198
+-0.40127702279442362 0.85397772162051189 -0.33120809463701684  -0.40118660278746765 0.85394740027497884 -0.33139575632083129
+0.19657916295965558 0.98048795642276054 0  0.19637276165371687 0.98052931546205824 0
+0.40127702279442368 0.85397772162051189 -0.33120809463701678  0.40118660278746832 0.85394740027497862 -0.33139575632083096
+0.85397772162051189 0.33120809463701684 -0.40127702279442379  0.85394740027497851 0.33139575632083101 -0.40118660278746837
+0.94302798180440095 0.1743284862276076 0.28050566540029331  0.94624082570117141 0.15592580676949422 0.28339979280099681
+0.33120809463701678 -0.40127702279442368 0.85397772162051189  0.33139575632083101 -0.40118660278746837 0.85394740027497862
+0.20469785983476813 -0.7324851174314404 0.64927986178574382  0.20481384113375084 -0.73258235910829972 0.64913355914122695
+-0.40127702279442373 -0.85397772162051189 0.33120809463701684  -0.40118660278746765 -0.85394740027497884 0.33139575632083129
+-0.19657916295965555 -0.98048795642276054 0  -0.19637276165371681 -0.98052931546205824 0
+-0.20469785983476813 -0.7324851174314404 -0.64927986178574382  -0.20481384113375084 -0.73258235910829972 -0.64913355914122695
+0.20469785983476813 -0.7324851174314404 -0.64927986178574382  0.2048138411337522 -0.73258235910829916 -0.64913355914122728
+0.64927986178574371 -0.20469785983476807 -0.7324851174314404  0.6491335591412265 -0.20481384113375173 -0.73258235910829994
+0.25313054028719528 -0.92991689161909563 0.26460466631117985  0.22507894965092784 -0.93495764835209438 0.27421462800506569
+0.97011813854669349 0.21732927410114633 0.09963433104745141  0.97545429555208396 0.20136271833024827 0.089117747702917693
+0.22762677949308696 -0.97053761901938218 0.067701629511043929  0.24109601889303409 -0.96718604322533863 0.08014903283286233
+0.7324851174314404 0.64927986178574382 -0.20469785983476813  0.73258235910829972 0.64913355914122695 -0.20481384113375084
+-0.40127702279442368 -0.85397772162051189 -0.33120809463701678  -0.40118660278746832 -0.85394740027497862 -0.33139575632083096
+-0.85397772162051189 -0.33120809463701684 -0.40127702279442368  -0.85394740027497862 -0.33139575632083096 -0.40118660278746832
+-0.7324851174314404 -0.64927986178574382 -0.20469785983476813  -0.73258235910829972 -0.64913355914122695 -0.20481384113375084
+-0.85397772162051189 -0.33120809463701678 0.40127702279442362  -0.85394740027497884 -0.33139575632083129 0.40118660278746759
+-0.7324851174314404 -0.64927986178574382 0.20469785983476813  -0.73258235910829916 -0.64913355914122728 0.2048138411337522
+-0.20469785983476813 -0.7324851174314404 0.64927986178574382  -0.2048138411337522 -0.73258235910829916 0.64913355914122728
+-0.85397772162051189 0.33120809463701684 -0.40127702279442362  -0.85394740027497884 0.33139575632083129 -0.40118660278746765
+-0.98048795642276054 0 0.19657916295965558  -0.98052931546205824 0 0.19637276165371687
+0.1473096109213767 0.85311732979922927 0.49982529754025778  0.17406896607441485 0.84145097432228222 0.51152737254409586
+0.13944047800987086 0.84405122505983243 0.51657855931435837  0.13950752053007628 0.83662429167607366 0.52971449507546831
+-0.40547414873191501 0.74192286377215211 0.53398612240605781  -0.40564529943251931 0.74178975530654589 0.53404105644655853
+-0.45853354684184838 0.20793674136609452 0.86400769557376311  -0.45845128128591367 0.20774869885998945 0.86409658071843187
+0.12208483180161088 2.4628875390745807e-18 0.9925196692479058  0.12230682541188538 -1.3892362040527919e-17 0.99249233773247159
+-0.12208483180161088 2.4628875390745807e-18 -0.9925196692479058  -0.12230682541188538 -1.3892362040527919e-17 -0.99249233773247159
+-0.53398612240605769 0.40547414873191501 -0.74192286377215222  -0.53404105644655864 0.40564529943251854 -0.74178975530654634
+-0.20793674136609455 0.86400769557376311 -0.45853354684184816  -0.2077486988599887 0.86409658071843221 -0.45845128128591356
+0.40547414873191501 0.74192286377215211 -0.53398612240605781  0.40564529943251931 0.74178975530654589 -0.53404105644655853
+0.45853354684184838 0.20793674136609452 -0.86400769557376311  0.45845128128591367 0.20774869885998945 -0.86409658071843187
+0.20793674136609452 -0.86400769557376311 0.45853354684184838  0.20774869885998945 -0.86409658071843187 0.45845128128591367
+2.4628875390745807e-18 -0.9925196692479058 -0.12208483180161088  -1.0419271530395937e-17 -0.99249233773247181 -0.12230682541188402
+0.97371394847093473 0.22313250261608547 0.018534606855888314  0.97011569110293328 0.24165005293363567 0.021927101793196353
+0.22762677949308696 -0.97053761901938218 -0.067701629511043929  0.24109601889303389 -0.96718604322533897 -0.080149032832859957
+0.9610594275501394 0.20306848001363986 -0.18186355091081907  0.96305716105845063 0.20064914867262926 -0.17961298302457651
+0.87541500307784514 0.17583413883161553 0.44878045857535925  0.87543631012341683 0.1784471211094488 0.44918580997761559
+-0.45853354684184838 -0.20793674136609452 -0.86400769557376311  -0.45845128128591367 -0.20774869885998945 -0.86409658071843187
+-0.9925196692479058 0.12208483180161094 -2.4628875390745819e-18  -0.99249233773247181 0.12230682541188409 0
+-0.45853354684184816 -0.20793674136609455 0.86400769557376311  -0.45845128128591472 -0.20774869885998942 0.86409658071843132
+-0.74192286377215222 0.53398612240605792 0.40547414873191506  -0.74178975530654712 0.53404105644655764 0.40564529943251859
+-0.12208483180161088 -2.4628875390745807e-18 0.9925196692479058  -0.12230682541188546 1.3892362040527919e-17 0.99249233773247159
+0.53398612240605781 -0.40547414873191501 0.74192286377215233  0.53404105644655786 -0.40564529943251887 0.74178975530654678
+0.90494753379947435 0.26218372058148803 0.33295004022963903  0.90406837259895934 0.26739523938910581 0.33340690397517558
+0.90595336478045685 0.32286639405373119 0.271410708194047  0.91136373772562917 0.30990719304796283 0.27087574504909689
+0.84405122505983243 0.51657855931435837 0.13944047800987086  0.83662429167605645 0.52971449507545787 0.13950752053021956
+-2.4628875390745819e-18 0.9925196692479058 -0.12208483180161094  0 0.99249233773247181 -0.12230682541188409
+-0.20793674136609452 0.86400769557376311 0.45853354684184838  -0.20774869885999001 0.86409658071843165 0.45845128128591378
+-0.86400769557376311 0.45853354684184838 0.20793674136609452  -0.86409658071843165 0.45845128128591378 0.20774869885999001
+-0.53398612240605781 0.40547414873191501 0.74192286377215233  -0.53404105644655753 0.40564529943251865 0.74178975530654712
+-0.53398612240605769 -0.40547414873191501 0.74192286377215222  -0.53404105644655864 -0.40564529943251854 0.74178975530654634
+0.53398612240605781 0.40547414873191501 -0.74192286377215233  0.53404105644655753 0.40564529943251865 -0.74178975530654712
+0.53398612240605769 -0.40547414873191501 -0.74192286377215222  0.53404105644655864 -0.40564529943251848 -0.74178975530654634
+0.12208483180161088 -2.4628875390745807e-18 -0.9925196692479058  0.12230682541188546 1.3892362040527919e-17 -0.99249233773247159
+-0.53398612240605781 -0.40547414873191501 -0.74192286377215233  -0.53404105644655753 -0.40564529943251865 -0.74178975530654712
+-0.45853354684184816 0.20793674136609455 -0.86400769557376311  -0.45845128128591472 0.20774869885998942 -0.86409658071843132
+-0.86400769557376311 0.45853354684184816 -0.20793674136609455  -0.86409658071843221 0.45845128128591356 -0.2077486988599887
+-0.40547414873191512 0.74192286377215233 -0.53398612240605781  -0.40564529943251854 0.74178975530654634 -0.53404105644655864
+2.4628875390745819e-18 0.9925196692479058 0.12208483180161094  0 0.99249233773247181 0.12230682541188409
+0.20793674136609452 0.86400769557376311 -0.45853354684184838  0.20774869885999001 0.86409658071843165 -0.45845128128591378
+0.86400769557376311 0.45853354684184838 -0.20793674136609452  0.86409658071843187 0.45845128128591367 -0.20774869885998945
+0.24152064540259116 -0.94857068261001021 -0.2007220816032094  0.22151649240577817 -0.95495693252433878 -0.19745303394971236
+0.45853354684184838 -0.20793674136609452 0.86400769557376311  0.45845128128591367 -0.20774869885998945 0.86409658071843187
+0.25313054028719528 -0.92991689161909552 -0.26460466631117996  0.22507894965084035 -0.9349576483520694 -0.27421462800522284
+-0.40547414873191512 -0.74192286377215233 0.53398612240605781  -0.40564529943251854 -0.74178975530654634 0.53404105644655864
+-2.4628875390745807e-18 -0.9925196692479058 0.12208483180161088  1.0419271530395939e-17 -0.99249233773247181 0.12230682541188409
+-0.40547414873191501 -0.74192286377215233 -0.53398612240605781  -0.40564529943251926 -0.74178975530654601 -0.53404105644655853
+0.20793674136609455 -0.86400769557376311 -0.45853354684184816  0.2077486988599887 -0.86409658071843221 -0.45845128128591356
+0.45853354684184816 -0.20793674136609455 -0.86400769557376311  0.45845128128591472 -0.20774869885998942 -0.86409658071843132
+0.94302798180440095 0.17432848622760783 -0.28050566540029331  0.94624082570117263 0.15592580676949283 -0.28339979280099331
+0.88317063762809189 0.078036377421090597 -0.46105412139556579  0.87829625280902335 0.071121388581572048 -0.47279746233229425
+0.69607577061268988 -0.22054081151140004 -0.68235511400187066  0.70341121140131047 -0.2431708442768484 -0.66789266216108834
+0.74192286377215222 0.53398612240605769 -0.40547414873191495  0.74178975530654701 0.53404105644655753 -0.4056452994325187
+-0.20793674136609452 -0.86400769557376311 -0.45853354684184838  -0.20774869885998945 -0.86409658071843187 -0.45845128128591367
+-0.86400769557376311 -0.45853354684184838 -0.20793674136609452  -0.86409658071843187 -0.45845128128591367 -0.20774869885998945
+-0.74192286377215222 -0.53398612240605769 -0.40547414873191495  -0.74178975530654701 -0.53404105644655753 -0.4056452994325187
+-0.74192286377215222 -0.53398612240605769 0.40547414873191501  -0.74178975530654634 -0.53404105644655864 0.40564529943251854
+-0.86400769557376311 -0.45853354684184816 0.20793674136609455  -0.86409658071843221 -0.45845128128591356 0.2077486988599887
+-0.20793674136609455 -0.86400769557376311 0.45853354684184816  -0.2077486988599887 -0.86409658071843221 0.45845128128591356
+-0.74192286377215222 0.53398612240605769 -0.40547414873191501  -0.74178975530654634 0.53404105644655864 -0.40564529943251854
+-0.9925196692479058 -0.12208483180161092 2.4628875390745815e-18  -0.99249233773247181 -0.12230682541188409 0
+0.14564781357706014 0.50275426427774228 0.85145286645038376  0.13337026124728052 0.50082503649439947 0.85521146872292098
+0.23797402212934904 0.20209118411408983 0.95001448309746583  0.23767767361493708 0.20255543129006909 0.94998980032413272
+-3.6838438251301899e-18 0.67939657443508372 0.73377128224391142  6.2160324274018349e-16 0.67830899168555392 0.73477677685030784
+0.61001812379817832 0.1056352994139447 0.78429103445404746  0.609555979170463 0.10429556095738847 0.78585236795604396
+-0.18275773351615091 0.56644608341520675 0.80357852474018521  -0.18137511328579306 0.56621300696157051 0.80405590541211891
+-4.927907460000931e-18 0.82511526248824529 0.56496442685265946  4.4454892311676981e-16 0.82480365918097698 0.56541924604816085
+-0.1129504910198771 0.38368834989905565 0.91652901576006229  -0.11209598472398358 0.38483789367577614 0.9161518901361021
+-0.38505005624480637 0.58714124035889637 0.7120404609681168  -0.38457055427597131 0.58712598556603979 0.71231212670919652
+0.11295049101987709 0.38368834989905559 0.91652901576006229  0.11209598472398341 0.38483789367577625 0.9161518901361021
+-0.23797402212934904 0.20209118411408986 0.95001448309746583  -0.23767767361493694 0.202555431290069 0.94998980032413272
+-0.11295049101987709 0.38368834989905559 -0.91652901576006229  -0.11209598472398341 0.38483789367577625 -0.9161518901361021
+0.23797402212934904 0.20209118411408986 -0.95001448309746583  0.23767767361493694 0.202555431290069 -0.94998980032413272
+-0.18275773351615091 0.56644608341520641 -0.80357852474018532  -0.1813751132857937 0.56621300696157073 -0.80405590541211858
+-0.23797402212934904 0.20209118411408983 -0.95001448309746583  -0.23767767361493708 0.20255543129006909 -0.94998980032413272
+3.6838438251301899e-18 0.67939657443508372 -0.73377128224391142  -8.8899681643288797e-16 0.67830899168555425 -0.73477677685030751
+-0.38505005624480643 0.58714124035889637 -0.71204046096811668  -0.38457055427597048 0.58712598556604001 -0.71231212670919697
+0.18275773351615091 0.56644608341520675 -0.80357852474018521  0.18137511328579306 0.56621300696157051 -0.80405590541211891
+4.927907460000931e-18 0.82511526248824529 -0.56496442685265946  -4.4454892311676981e-16 0.82480365918097698 -0.56541924604816085
+0.1129504910198771 0.38368834989905565 -0.91652901576006229  0.11209598472398358 0.38483789367577614 -0.9161518901361021
+0.38505005624480637 0.58714124035889637 -0.7120404609681168  0.38457055427597131 0.58712598556603979 -0.71231212670919652
+0.69531998299352837 -0.2217116289121196 -0.68272481536695306  0.70341121140124718 -0.24317084427681135 -0.66789266216116849
+0.76687916779802356 -0.10789205109760849 0.63136143448574888  0.75877805430304368 -0.10723544565538377 0.64246122334595301
+0.73203596503112123 -0.16333083529035372 0.66003296952840662  0.73315795129589978 -0.17491713444450813 0.65717837344918839
+0.20209118411408986 -0.95001448309746583 0.23797402212934904  0.20255543129017947 -0.94998980032415736 0.23767767361474501
+0.45944041532897167 -0.59972505245462004 0.65399889841309089  0.47623926703787134 -0.60557549052406701 0.63755351603435351
+0.20209118411408983 -0.95001448309746583 -0.23797402212934904  0.20255543129008949 -0.94998980032413749 -0.23767767361490061
+0.22589145876869662 -0.97323020415808847 -0  0.24034326043217732 -0.97068796076021813 0
+0.40065939257699124 -0.69413734830776375 0.59790562905682232  0.37763414062759415 -0.67726348918454282 0.63143219909190329
+0.42861413394522369 -0.64891100701386606 0.62717432611494872  0.41977894187289982 -0.66093884463189856 0.622049422165731
+0.40435813432554857 -0.6879005781223142 0.60211592452938867  0.4197789418728895 -0.66093884463190489 0.622049422165731
+0.56789366986248413 0.81389356246462441 0.11874744154864894  0.58292813064720961 0.80326578355000555 0.12230648174951961
+0.95001448309746583 0.23797402212934904 0.20209118411408983  0.94998980032413238 0.23767767361493988 0.20255543129006717
+-0.1129504910198771 -0.38368834989905565 -0.91652901576006229  -0.11209598472398358 -0.38483789367577614 -0.9161518901361021
+-0.38505005624480637 -0.58714124035889637 -0.7120404609681168  -0.38457055427597131 -0.58712598556603979 -0.71231212670919652
+-0.91652901576006229 0.11295049101987709 -0.38368834989905559  -0.9161518901361021 0.11209598472398341 -0.38483789367577625
+-0.95001448309746583 -0.23797402212934904 -0.20209118411408986  -0.94998980032413272 -0.23767767361493694 -0.202555431290069
+-0.73377128224391142 3.6838438251301899e-18 0.67939657443508372  -0.73477677685030751 -3.5420966904747881e-16 0.67830899168555425
+-0.71204046096811668 -0.38505005624480643 0.58714124035889637  -0.71231212670919686 -0.38457055427597092 0.58712598556603979
+-0.56644608341520675 0.80357852474018521 0.18275773351615091  -0.56621300696156995 0.80405590541211891 0.18137511328579495
+-0.82511526248824529 0.56496442685265946 4.927907460000931e-18  -0.82480365918097698 0.56541924604816096 -4.4107588465492006e-16
+-0.11295049101987709 -0.38368834989905559 0.91652901576006229  -0.11209598472398341 -0.38483789367577625 0.9161518901361021
+0.23797402212934904 -0.20209118411408986 0.95001448309746583  0.23767767361493694 -0.202555431290069 0.94998980032413272
+0.85711100340627278 0.037134436368273127 0.51257565524045945  0.85590248058786045 0.033910248167193832 0.51602426182572703
+0.56496442685265946 -4.927907460000931e-18 0.82511526248824529  0.56541924604816285 -3.54249923108676e-16 0.82480365918097576
+0.73377128224391142 -3.6838438251301899e-18 0.67939657443508372  0.73477677685030751 3.5420966904747881e-16 0.67830899168555425
+0.10609528287383586 0.60630413399985694 0.78745552743149316  0.094036448520745178 0.60380229511960815 0.79156802282425409
+0.67939657443508372 0.73377128224391142 -3.6838438251301899e-18  0.67830899168555314 0.73477677685030873 6.2507588655437443e-16
+0.71884915497263779 0.093588483842681203 0.68777595190194329  0.7209136361166899 0.10033016823457219 0.68572398718656136
+0.66455433327713243 0.095362650095153129 0.74011618472454044  0.66756092552177693 0.1027523636191123 0.73743092048489145
+0.20209118411408983 0.95001448309746583 0.23797402212934904  0.20255543129006906 0.9499898003241326 0.23767767361493716
+-0.38368834989905559 0.91652901576006229 -0.11295049101987709  -0.38483789367577625 0.91615189013610199 -0.1120959847239834
+-0.20209118411408986 0.95001448309746583 0.23797402212934904  -0.20255543129006939 0.94998980032413272 0.23767767361493675
+-0.38368834989905565 0.91652901576006229 0.1129504910198771  -0.38483789367577614 0.9161518901361021 0.11209598472398358
+-0.58714124035889637 0.7120404609681168 0.38505005624480637  -0.58712598556603979 0.71231212670919652 0.38457055427597131
+-0.91652901576006229 0.1129504910198771 0.38368834989905565  -0.9161518901361021 0.11209598472398358 0.38483789367577614
+-0.7120404609681168 0.38505005624480637 0.58714124035889637  -0.71231212670919652 0.38457055427597131 0.58712598556603979
+-0.80357852474018521 0.18275773351615091 0.56644608341520675  -0.80405590541211891 0.18137511328579495 0.56621300696156995
+-0.56496442685265946 4.927907460000931e-18 0.82511526248824529  -0.56541924604816252 1.1461026924104223e-16 0.82480365918097598
+-0.18275773351615091 -0.56644608341520641 0.80357852474018532  -0.1813751132857937 -0.56621300696157073 0.80405590541211858
+-0.23797402212934904 -0.20209118411408983 0.95001448309746583  -0.23767767361493719 -0.20255543129006909 0.94998980032413272
+0.80357852474018521 0.18275773351615091 -0.56644608341520675  0.80405590541211891 0.18137511328579495 -0.56621300696156995
+0.56496442685265946 4.927907460000931e-18 -0.82511526248824529  0.56541924604816252 1.1461026924104223e-16 -0.82480365918097598
+0.18275773351615091 -0.56644608341520641 -0.80357852474018532  0.1813751132857937 -0.56621300696157073 -0.80405590541211858
+0.23797402212934904 -0.20209118411408983 -0.95001448309746583  0.23767767361493719 -0.20255543129006909 -0.94998980032413272
+0.11295049101987709 -0.38368834989905559 -0.91652901576006229  0.11209598472398341 -0.38483789367577625 -0.9161518901361021
+-0.23797402212934904 -0.20209118411408986 -0.95001448309746583  -0.23767767361493694 -0.202555431290069 -0.94998980032413272
+-0.80357852474018521 -0.18275773351615091 -0.56644608341520675  -0.80405590541211891 -0.18137511328579495 -0.56621300696156995
+-0.56496442685265946 -4.927907460000931e-18 -0.82511526248824529  -0.56541924604816285 -3.54249923108676e-16 -0.82480365918097576
+-0.73377128224391142 -3.6838438251301899e-18 -0.67939657443508372  -0.73477677685030751 3.5420966904747881e-16 -0.67830899168555425
+-0.71204046096811668 0.38505005624480643 -0.58714124035889637  -0.71231212670919686 0.38457055427597092 -0.58712598556603979
+-0.67939657443508372 0.73377128224391142 3.6838438251301899e-18  -0.67830899168555359 0.73477677685030829 -3.264285185339511e-16
+-0.58714124035889637 0.71204046096811668 -0.38505005624480643  -0.58712598556603957 0.71231212670919664 -0.38457055427597159
+-0.56644608341520641 0.80357852474018532 -0.18275773351615091  -0.56621300696157029 0.80405590541211847 -0.18137511328579559
+-0.20209118411408983 0.95001448309746583 -0.23797402212934904  -0.20255543129006906 0.9499898003241326 -0.23767767361493716
+0.38368834989905559 0.91652901576006229 0.11295049101987709  0.38483789367577625 0.91615189013610199 0.1120959847239834
+0.20209118411408986 0.95001448309746583 -0.23797402212934904  0.20255543129006939 0.94998980032413272 -0.23767767361493675
+0.38368834989905565 0.91652901576006229 -0.1129504910198771  0.38483789367577614 0.9161518901361021 -0.11209598472398358
+0.58714124035889637 0.7120404609681168 -0.38505005624480637  0.58712598556603979 0.71231212670919652 -0.38457055427597131
+0.85822228618686625 0.03887113359859222 0.51061830246204121  0.85590248058786189 0.03391024816720907 0.51602426182572358
+0.7120404609681168 0.38505005624480637 -0.58714124035889637  0.71231212670919652 0.38457055427597131 -0.58712598556603979
+0.85756840681366708 0.037892913779084658 0.51176714118576794  0.85590248058785079 0.033910248167155335 0.51602426182574557
+0.94691066341902042 0.17998804508785277 0.2643958831644852  0.95675731372090722 0.15958439167178995 0.24320416233341552
+0.1129504910198771 -0.38368834989905565 0.91652901576006229  0.11209598472398358 -0.38483789367577614 0.9161518901361021
+0.38505005624480637 -0.58714124035889637 0.7120404609681168  0.38457055427597131 -0.58712598556603979 0.71231212670919652
+0.18275773351615091 -0.56644608341520675 0.80357852474018521  0.18137511328579306 -0.56621300696157051 0.80405590541211891
+4.927907460000931e-18 -0.82511526248824529 0.56496442685265946  1.18083307702892e-16 -0.82480365918097598 0.5654192460481624
+-0.56644608341520641 -0.80357852474018532 0.18275773351615091  -0.56621300696157029 -0.80405590541211847 0.18137511328579559
+-0.20209118411408983 -0.95001448309746583 0.23797402212934904  -0.20255543129006906 -0.9499898003241326 0.23767767361493716
+-0.38368834989905559 -0.91652901576006229 0.11295049101987709  -0.38483789367577625 -0.91615189013610199 0.1120959847239834
+-0.20209118411408986 -0.95001448309746583 -0.23797402212934904  -0.202555431290069 -0.94998980032413272 -0.23767767361493694
+-0.18275773351615091 -0.56644608341520675 -0.80357852474018521  -0.18137511328579306 -0.56621300696157051 -0.80405590541211891
+-4.927907460000931e-18 -0.82511526248824529 -0.56496442685265946  -3.54249923108676e-16 -0.82480365918097576 -0.56541924604816285
+-3.6838438251301899e-18 -0.67939657443508372 -0.73377128224391142  6.2160324274018339e-16 -0.6783089916855547 -0.73477677685030718
+0.38505005624480643 -0.58714124035889637 -0.71204046096811668  0.38457055427597092 -0.58712598556603979 -0.71231212670919686
+0.73377128224391142 3.6838438251301899e-18 -0.67939657443508372  0.73477677685030751 -3.5420966904747881e-16 -0.67830899168555425
+0.23440017510432309 -0.9594775020158709 0.15035899655759533  0.24320416233348721 -0.95675731372089035 0.15958439167178237
+0.97011813854669382 0.21732927410114633 -0.099634331047451452  0.9754542955520713 0.20136271833029701 -0.089117747702945227
+0.44633019100468213 -0.6204277684668269 0.64334361719230826  0.4361156007101773 -0.62405012717396158 0.64835532047740907
+0.37506412073313489 -0.73422479552976916 0.5641719337434894  0.38232288700972444 -0.72686052081253516 0.57052869634460968
+0.39411849558532497 -0.70426794627197542 0.58956860097969033  0.38232288700971667 -0.72686052081252572 0.57052869634462677
+0.50622685812276469 -0.5257151024560045 0.68341702461536258  0.54199242061156017 -0.5062447854721529 0.67079090123664897
+0.95001448309746583 0.23797402212934904 -0.20209118411408986  0.94998980032413283 0.23767767361493602 -0.2025554312900695
+0.56644608341520675 0.80357852474018521 -0.18275773351615091  0.56621300696156995 0.80405590541211891 -0.18137511328579495
+0.82511526248824529 0.56496442685265946 -4.927907460000931e-18  0.82480365918097664 0.56541924604816152 5.4874007697226281e-16
+-0.38368834989905565 -0.91652901576006229 -0.1129504910198771  -0.38483789367577614 -0.9161518901361021 -0.11209598472398358
+-0.58714124035889637 -0.7120404609681168 -0.38505005624480637  -0.58712598556603979 -0.71231212670919652 -0.38457055427597131
+-0.91652901576006229 -0.1129504910198771 -0.38368834989905565  -0.9161518901361021 -0.11209598472398358 -0.38483789367577614
+-0.7120404609681168 -0.38505005624480637 -0.58714124035889637  -0.71231212670919652 -0.38457055427597131 -0.58712598556603979
+-0.56644608341520675 -0.80357852474018521 -0.18275773351615091  -0.56621300696156995 -0.80405590541211891 -0.18137511328579495
+-0.82511526248824529 -0.56496442685265946 -4.927907460000931e-18  -0.82480365918097598 -0.5654192460481624 -1.18083307702892e-16
+-0.80357852474018532 -0.18275773351615091 0.56644608341520641  -0.80405590541211847 -0.18137511328579559 0.56621300696157029
+-0.95001448309746583 -0.23797402212934904 0.20209118411408983  -0.9499898003241326 -0.23767767361493716 0.20255543129006906
+-0.67939657443508372 -0.73377128224391142 -3.6838438251301899e-18  -0.67830899168555314 -0.73477677685030873 6.2507588655437443e-16
+-0.58714124035889637 -0.71204046096811668 0.38505005624480643  -0.58712598556603979 -0.71231212670919686 0.38457055427597092
+3.6838438251301899e-18 -0.67939657443508372 0.73377128224391142  -6.2160324274018339e-16 -0.6783089916855547 0.73477677685030718
+-0.38505005624480643 -0.58714124035889637 0.71204046096811668  -0.38457055427597092 -0.58712598556603979 0.71231212670919686
+-0.80357852474018532 0.18275773351615091 -0.56644608341520641  -0.80405590541211847 0.18137511328579559 -0.56621300696157029
+-0.95001448309746583 0.23797402212934904 -0.20209118411408983  -0.9499898003241326 0.23767767361493716 -0.20255543129006906
+-0.91652901576006229 -0.11295049101987709 0.38368834989905559  -0.9161518901361021 -0.11209598472398341 0.38483789367577625
+-0.95001448309746583 0.23797402212934904 0.20209118411408986  -0.94998980032413272 0.23767767361493675 0.20255543129006939
+0.74644278217951743 0.096124922711889466 0.65746189559341328  0.74597391594556683 0.098434961242602592 0.65866036402231121
+0.69813515078208477 0.093116941936638692 0.70892487408416871  0.69503929178689594 0.10153183902939614 0.71176658290178163
+-0.3412681489687433 0.82760814841975494 0.44564650023159885  -0.34127086350966057 0.82760959526572631 0.44564173451716937
+-0.5521834643091893 0.27542468411056592 0.78691464920034204  -0.55218785652865843 0.2754217387370671 0.78691259802683067
+1.2310405966106288e-18 -0.065843464858177478 0.99782996454078776  0 -0.065849124772593706 0.99782959104582747
+-1.2310405966106288e-18 -0.065843464858177478 -0.99782996454078776  0 -0.065849124772593706 -0.99782959104582747
+-0.55218346430918919 0.27542468411056592 -0.78691464920034204  -0.55218785652865843 0.27542173873706749 -0.78691259802683067
+-0.34126814896874336 0.82760814841975505 -0.44564650023159863  -0.34127086350966107 0.82760959526572653 -0.44564173451716882
+0.3412681489687433 0.82760814841975494 -0.44564650023159885  0.34127086350966057 0.82760959526572631 -0.44564173451716937
+0.5521834643091893 0.27542468411056592 -0.78691464920034204  0.55218785652865843 0.2754217387370671 -0.78691259802683067
+0.27542468411056592 -0.78691464920034204 0.5521834643091893  0.2754217387370671 -0.78691259802683067 0.55218785652865843
+-0.065843464858177478 -0.99782996454078776 -1.2310405966106288e-18  -0.065849124772593706 -0.99782959104582747 0
+0.27542468411056592 -0.78691464920034204 -0.55218346430918919  0.27542173873706743 -0.78691259802683056 -0.55218785652865843
+0.22648000271342919 -0.97241808576487498 -0.034988854233130702  0.21668703966435401 -0.97542959357555248 -0.039797422259879874
+0.23440017510432298 -0.95947750201587068 -0.15035899655759499  0.24320416233349618 -0.95675731372088713 -0.15958439167178784
+0.55513243511370003 0.123158824652338 0.82188503772742816  0.54729298896532652 0.10489548487252408 0.83034168959697374
+-0.5521834643091893 -0.27542468411056592 -0.78691464920034204  -0.55218785652865843 -0.2754217387370671 -0.78691259802683067
+-0.99782996454078776 1.231040596610629e-18 0.065843464858177492  -0.99782959104582747 0 0.06584912477259372
+-0.44564650023159863 -0.34126814896874336 0.82760814841975505  -0.44564173451716882 -0.34127086350966107 0.82760959526572653
+-0.82760814841975494 0.44564650023159885 0.34126814896874336  -0.82760959526572597 0.44564173451716915 0.34127086350966152
+-1.2310405966106288e-18 0.065843464858177478 0.99782996454078776  0 0.065849124772593706 0.99782959104582747
+0.4456465002315988 -0.3412681489687433 0.82760814841975494  0.4456417345171691 -0.3412708635096619 0.82760959526572597
+0.77156308049914157 0.10155294642477924 0.62688758712066828  0.76918721291847925 0.096596587118441227 0.63168040245029877
+0.81389356246462441 0.11874744154864894 0.56789366986248413  0.803265783550005 0.12230648174951998 0.58292813064721027
+0.12315882465233809 0.82188503772742794 0.55513243511370003  0.10489548487253526 0.83034168959698129 0.54729298896531298
+0.065843464858177492 0.99782996454078776 -1.231040596610629e-18  0.06584912477259372 0.99782959104582747 0
+-0.27542468411056592 0.78691464920034204 0.5521834643091893  -0.2754217387370666 0.78691259802683156 0.55218785652865754
+-0.78691464920034204 0.5521834643091893 0.27542468411056592  -0.786912598026831 0.55218785652865821 0.27542173873706705
+-0.4456465002315988 0.3412681489687433 0.82760814841975494  -0.4456417345171691 0.3412708635096619 0.82760959526572597
+-0.55218346430918919 -0.27542468411056592 0.78691464920034204  -0.55218785652865843 -0.27542173873706749 0.78691259802683067
+0.4456465002315988 0.3412681489687433 -0.82760814841975494  0.4456417345171691 0.3412708635096619 -0.82760959526572597
+0.55218346430918919 -0.27542468411056592 -0.78691464920034204  0.55218785652865843 -0.27542173873706749 -0.78691259802683067
+1.2310405966106288e-18 0.065843464858177478 -0.99782996454078776  0 0.065849124772593706 -0.99782959104582747
+-0.4456465002315988 -0.3412681489687433 -0.82760814841975494  -0.4456417345171691 -0.3412708635096619 -0.82760959526572597
+-0.44564650023159863 0.34126814896874336 -0.82760814841975505  -0.44564173451716882 0.34127086350966107 -0.82760959526572653
+-0.82760814841975505 0.44564650023159863 -0.34126814896874336  -0.82760959526572653 0.44564173451716882 -0.34127086350966107
+-0.27542468411056592 0.78691464920034204 -0.55218346430918919  -0.27542173873706743 0.78691259802683056 -0.55218785652865843
+-0.065843464858177492 0.99782996454078776 1.231040596610629e-18  -0.06584912477259372 0.99782959104582747 0
+0.27542468411056592 0.78691464920034204 -0.5521834643091893  0.2754217387370666 0.78691259802683156 -0.55218785652865754
+0.78691464920034204 0.5521834643091893 -0.27542468411056592  0.78691259802683067 0.55218785652865843 -0.2754217387370671
+0.95663400990185377 0.19602936533555493 0.21094260961626571  0.954956932524338 0.19745303394971148 0.22151649240578231
+0.5521834643091893 -0.27542468411056592 0.78691464920034204  0.55218785652865843 -0.2754217387370671 0.78691259802683067
+0.61696807586665514 -0.34742682425518856 0.70495163176324005  0.6028570865599705 -0.35990150486609274 0.71206336795228153
+-0.27542468411056592 -0.78691464920034204 0.55218346430918919  -0.27542173873706743 -0.78691259802683056 0.55218785652865843
+0.065843464858177478 -0.99782996454078776 1.2310405966106288e-18  0.065849124772593706 -0.99782959104582747 0
+-0.3412681489687433 -0.82760814841975505 -0.44564650023159885  -0.34127086350966185 -0.82760959526572597 -0.4456417345171691
+0.60785615600797449 -0.36184045701812123 0.70538094374692573  0.6028570865599715 -0.35990150486609057 0.71206336795228176
+0.44564650023159863 -0.34126814896874336 -0.82760814841975505  0.44564173451716882 -0.34127086350966107 -0.82760959526572653
+0.26758089404998375 -0.9059728893652188 -0.32585692434233748  0.24890531892630735 -0.91663390223890306 -0.31277536903738834
+0.26660413751883788 -0.90759811547986158 -0.32187126056253335  0.24890531892629519 -0.91663390223889096 -0.31277536903743325
+0.26791287934591512 -0.90549608434201145 -0.32699007860623575  0.24890531892630424 -0.91663390223890118 -0.31277536903739622
+0.82760814841975505 0.44564650023159885 -0.34126814896874336  0.82760959526572597 0.44564173451716915 -0.3412708635096619
+-0.27542468411056592 -0.78691464920034204 -0.5521834643091893  -0.2754217387370671 -0.78691259802683067 -0.55218785652865843
+-0.78691464920034204 -0.5521834643091893 -0.27542468411056592  -0.78691259802683067 -0.55218785652865843 -0.2754217387370671
+-0.82760814841975505 -0.44564650023159885 -0.34126814896874336  -0.82760959526572597 -0.44564173451716915 -0.3412708635096619
+-0.78691464920034204 -0.55218346430918919 0.27542468411056592  -0.78691259802683067 -0.55218785652865843 0.27542173873706749
+-0.82760814841975505 -0.44564650023159863 0.34126814896874336  -0.82760959526572653 -0.44564173451716882 0.34127086350966107
+-0.34126814896874336 -0.82760814841975505 0.44564650023159863  -0.34127086350966107 -0.82760959526572653 0.44564173451716882
+-0.78691464920034204 0.55218346430918919 -0.27542468411056592  -0.78691259802683067 0.55218785652865843 -0.27542173873706749
+-0.99782996454078776 -1.231040596610629e-18 -0.065843464858177492  -0.99782959104582747 0 -0.06584912477259372
+0.51657855931435848 0.13944047800987086 0.84405122505983243  0.52971449507546142 0.13950752053014198 0.83662429167606711
+0.1186983640546234 0.26188501241256062 0.95777186148081694  0.11873329660574115 0.261615609412787 0.95784115446597362
+-0.068996282000725467 0.75327597529184531 0.65407554465688111  -0.069124135183105104 0.7534327508752533 0.65388144479235411
+0.57278135509939099 0.11695476797072324 0.8104943439581207  0.57905836064065497 0.10453117536509578 0.80855713981693889
+-0.30369631682393589 0.52293928186267569 0.79643145005237237  -0.30395970967362002 0.52285425410030417 0.7963867928741305
+0.068996282000725426 0.75327597529184531 0.65407554465688111  0.069124135183103744 0.75343275087525319 0.65388144479235433
+-0.11869836405462342 0.26188501241256068 0.95777186148081694  -0.11873329660574071 0.26161560941278683 0.95784115446597373
+-0.26105426945011495 0.63457761123722189 0.7274351680516471  -0.26123864468751851 0.6346994542695118 0.72726265769102449
+0.23033669342916974 0.33088129441328601 0.9151298141069959  0.23057849677495015 0.33073974459589178 0.91512008947987178
+-0.23033669342916982 0.33088129441328606 0.9151298141069959  -0.23057849677494924 0.33073974459589167 0.91512008947987211
+-0.23033669342916974 0.33088129441328601 -0.9151298141069959  -0.23057849677494924 0.33073974459589123 -0.91512008947987233
+0.23033669342916982 0.33088129441328606 -0.9151298141069959  0.23057849677494924 0.33073974459589167 -0.91512008947987211
+-0.26105426945011484 0.63457761123722189 -0.7274351680516471  -0.26123864468751856 0.63469945426951135 -0.72726265769102494
+-0.1186983640546234 0.26188501241256062 -0.95777186148081694  -0.11873329660574115 0.261615609412787 -0.95784115446597362
+0.068996282000725467 0.75327597529184531 -0.65407554465688111  0.069124135183105104 0.7534327508752533 -0.65388144479235411
+-0.30369631682393589 0.52293928186267558 -0.79643145005237248  -0.30395970967361996 0.52285425410030439 -0.79638679287413028
+0.30369631682393589 0.52293928186267569 -0.79643145005237237  0.30395970967362002 0.52285425410030417 -0.7963867928741305
+-0.068996282000725426 0.75327597529184531 -0.65407554465688111  -0.069124135183103994 0.75343275087525308 -0.65388144479235433
+0.11869836405462342 0.26188501241256068 -0.95777186148081694  0.11873329660574071 0.26161560941278683 -0.95784115446597373
+0.26105426945011495 0.63457761123722189 -0.7274351680516471  0.26123864468751851 0.6346994542695118 -0.72726265769102449
+0.90598861546737175 0.11471241548978534 -0.40567809407889899  0.89961957659540837 0.11104418275858105 -0.42231955541009114
+0.89637854466934042 0.099164106023202955 -0.43023759412454343  0.89961957659540881 0.11104418275857367 -0.42231955541009181
+0.37506412073313466 -0.73422479552976916 -0.56417193374348928  0.38232288700972666 -0.72686052081252872 -0.57052869634461623
+0.39411849558532475 -0.7042679462719752 -0.58956860097969033  0.38232288700972988 -0.72686052081253349 -0.57052869634460812
+0.30729748704039861 -0.84278707285381271 -0.43974499787970978  0.29815500373095882 -0.84204499011931333 -0.44951510360071051
+0.31474205002823552 -0.83109069623026077 -0.45671715648324684  0.29815500373095516 -0.8420449901193181 -0.44951510360070401
+0.96705050472527376 0.21194916611186071 0.13775142693846479  0.95825269159637927 0.23889893330366113 0.1570957628794212
+0.40065939257699101 -0.69413734830776352 -0.59790562905682221  0.37763414062761885 -0.67726348918450008 -0.63143219909193449
+0.32993533901945349 -0.80654749644509327 -0.4886330537542477  0.31909818315151789 -0.81512028618526433 -0.48348243872828833
+0.3395133710973568 -0.79211156275892003 -0.50664961250726259  0.31909818315152677 -0.81512028618527188 -0.48348243872826996
+0.85145286645038376 0.14564781357706019 0.50275426427774228  0.85521146872291642 0.13337026124727785 0.50082503649440779
+0.24930895838975131 -0.93567470552212884 0.24579255546759937  0.2461133071928723 -0.9397552649709302 0.2372515162902103
+-0.11869836405462342 -0.26188501241256068 -0.95777186148081694  -0.11873329660574071 -0.26161560941278683 -0.95784115446597373
+-0.26105426945011495 -0.63457761123722189 -0.7274351680516471  -0.26123864468751851 -0.6346994542695118 -0.72726265769102449
+-0.9151298141069959 0.23033669342916974 -0.33088129441328601  -0.91512008947987233 0.23057849677494924 -0.33073974459589123
+-0.9151298141069959 -0.23033669342916982 -0.33088129441328606  -0.91512008947987211 -0.23057849677494924 -0.33073974459589173
+-0.65407554465688111 0.068996282000725467 0.75327597529184531  -0.65388144479235299 0.069124135183103133 0.75343275087525441
+-0.79643145005237248 -0.30369631682393589 0.52293928186267558  -0.79638679287412995 -0.30395970967361974 0.52285425410030517
+-0.52293928186267569 0.79643145005237237 0.30369631682393589  -0.52285425410030517 0.79638679287412995 0.30395970967361968
+-0.75327597529184531 0.65407554465688111 -0.068996282000725426  -0.75343275087525319 0.65388144479235433 -0.069124135183104007
+-0.23033669342916974 -0.33088129441328601 0.9151298141069959  -0.23057849677494924 -0.33073974459589123 0.91512008947987233
+0.23033669342916982 -0.33088129441328606 0.9151298141069959  0.23057849677494924 -0.33073974459589167 0.91512008947987211
+0.88317063762809178 0.078036377421090528 0.46105412139556579  0.87829625280902357 0.071121388581566997 0.47279746233229458
+0.65407554465688111 0.068996282000725426 0.75327597529184531  0.65388144479235399 0.069124135183103508 0.75343275087525352
+0.65407554465688111 -0.068996282000725467 0.75327597529184531  0.65388144479235299 -0.069124135183103133 0.75343275087525441
+0.55521070025011254 0.82226795238624728 0.12310298935169575  0.71981609291735338 0.68947006137042033 0.080596692556612101
+0.75327597529184531 0.65407554465688111 -0.068996282000725467  0.75343275087525441 0.65388144479235299 -0.069124135183103133
+0.86156266551879135 0.15717574894030889 0.48126519958548886  0.86578380003691935 0.15629656115483412 0.4753838412954367
+0.44478929974988757 0.17773204761375261 0.87689701064830428  0.31590490687894768 0.24715310335759 0.91603462451509754
+0.26188501241256062 0.95777186148081694 0.1186983640546234  0.261615609412787 0.95784115446597362 0.11873329660574115
+-0.33088129441328601 0.9151298141069959 -0.23033669342916974  -0.33073974459589123 0.91512008947987233 -0.23057849677494924
+-0.33088129441328606 0.9151298141069959 0.23033669342916982  -0.3307397445958915 0.91512008947987211 0.23057849677494932
+-0.26188501241256068 0.95777186148081694 0.11869836405462342  -0.26161560941278683 0.95784115446597373 0.11873329660574071
+-0.63457761123722189 0.7274351680516471 0.26105426945011495  -0.63469945426951091 0.72726265769102516 0.26123864468751895
+-0.95777186148081694 0.11869836405462342 0.26188501241256068  -0.95784115446597373 0.11873329660574071 0.26161560941278683
+-0.7274351680516471 0.26105426945011495 0.63457761123722189  -0.72726265769102516 0.2612386446875189 0.6346994542695108
+-0.79643145005237237 0.30369631682393589 0.52293928186267569  -0.79638679287412995 0.30395970967361968 0.52285425410030517
+-0.65407554465688111 -0.068996282000725426 0.75327597529184531  -0.65388144479235388 -0.069124135183103744 0.75343275087525352
+-0.26105426945011484 -0.63457761123722201 0.7274351680516471  -0.2612386446875179 -0.6346994542695118 0.72726265769102483
+-0.1186983640546234 -0.26188501241256062 0.95777186148081694  -0.11873329660574115 -0.261615609412787 0.95784115446597362
+0.79643145005237237 0.30369631682393589 -0.52293928186267569  0.79638679287412995 0.30395970967361968 -0.52285425410030517
+0.65407554465688111 -0.068996282000725426 -0.75327597529184531  0.65388144479235388 -0.069124135183103744 -0.75343275087525352
+0.26105426945011484 -0.63457761123722201 -0.7274351680516471  0.2612386446875179 -0.6346994542695118 -0.72726265769102483
+0.1186983640546234 -0.26188501241256062 -0.95777186148081694  0.11873329660574115 -0.261615609412787 -0.95784115446597362
+0.23033669342916974 -0.33088129441328601 -0.9151298141069959  0.23057849677494924 -0.33073974459589123 -0.91512008947987233
+-0.23033669342916982 -0.33088129441328606 -0.9151298141069959  -0.23057849677494924 -0.33073974459589167 -0.91512008947987211
+-0.79643145005237237 -0.30369631682393589 -0.52293928186267569  -0.79638679287412995 -0.30395970967361968 -0.52285425410030517
+-0.65407554465688111 0.068996282000725426 -0.75327597529184531  -0.65388144479235388 0.069124135183103744 -0.75343275087525352
+-0.65407554465688111 -0.068996282000725467 -0.75327597529184531  -0.65388144479235299 -0.069124135183103133 -0.75343275087525441
+-0.79643145005237248 0.30369631682393589 -0.52293928186267558  -0.79638679287412995 0.30395970967361974 -0.52285425410030517
+-0.75327597529184531 0.65407554465688111 0.068996282000725467  -0.7534327508752533 0.65388144479235411 0.069124135183105104
+-0.52293928186267558 0.79643145005237248 -0.30369631682393589  -0.52285425410030539 0.79638679287412983 -0.30395970967361963
+-0.63457761123722201 0.72743516805164721 -0.2610542694501149  -0.63469945426951069 0.72726265769102572 -0.26123864468751773
+-0.26188501241256062 0.95777186148081694 -0.1186983640546234  -0.261615609412787 0.95784115446597362 -0.11873329660574115
+0.33088129441328601 0.9151298141069959 0.23033669342916974  0.3307397445958915 0.915120089479872 0.23057849677494963
+0.33088129441328606 0.9151298141069959 -0.23033669342916982  0.3307397445958915 0.91512008947987211 -0.23057849677494932
+0.26188501241256068 0.95777186148081694 -0.11869836405462342  0.26161560941278683 0.95784115446597373 -0.11873329660574071
+0.63457761123722189 0.7274351680516471 -0.26105426945011495  0.63469945426951091 0.72726265769102516 -0.26123864468751895
+0.49314081475211935 -0.54531814984023863 -0.67677227421098896  0.49105853440619962 -0.56677814486533662 -0.66153159432474795
+0.7274351680516471 0.26105426945011495 -0.63457761123722189  0.72726265769102516 0.2612386446875189 -0.6346994542695108
+0.48978532609687886 -0.55056521742650477 -0.67476755984413894  0.49105853440622205 -0.56677814486535127 -0.66153159432471864
+0.79848519772427495 -0.05725079091428624 -0.59888293763788791  0.78019094274165357 -0.041329938271299098 -0.62417459822262911
+0.11869836405462342 -0.26188501241256068 0.95777186148081694  0.11873329660574071 -0.26161560941278683 0.95784115446597373
+0.26105426945011495 -0.63457761123722189 0.7274351680516471  0.26123864468751851 -0.6346994542695118 0.72726265769102449
+0.30369631682393589 -0.52293928186267569 0.79643145005237237  0.30395970967362002 -0.52285425410030417 0.7963867928741305
+-0.068996282000725426 -0.75327597529184531 0.65407554465688111  -0.069124135183103744 -0.75343275087525352 0.65388144479235388
+-0.63457761123722201 -0.7274351680516471 0.26105426945011484  -0.6346994542695118 -0.72726265769102483 0.2612386446875179
+-0.26188501241256062 -0.95777186148081694 0.1186983640546234  -0.261615609412787 -0.95784115446597362 0.11873329660574115
+-0.33088129441328601 -0.9151298141069959 0.23033669342916974  -0.33073974459589123 -0.91512008947987233 0.23057849677494924
+-0.33088129441328606 -0.9151298141069959 -0.23033669342916982  -0.33073974459589173 -0.91512008947987211 -0.23057849677494924
+-0.30369631682393589 -0.52293928186267569 -0.79643145005237237  -0.30395970967362002 -0.52285425410030417 -0.7963867928741305
+0.068996282000725426 -0.75327597529184531 -0.65407554465688111  0.069124135183103744 -0.75343275087525352 -0.65388144479235388
+-0.068996282000725467 -0.75327597529184531 -0.65407554465688111  -0.069124135183103133 -0.75343275087525441 -0.65388144479235299
+0.30369631682393589 -0.52293928186267558 -0.79643145005237248  0.30395970967361974 -0.52285425410030517 -0.79638679287412995
+0.65407554465688111 0.068996282000725467 -0.75327597529184531  0.65388144479235299 0.069124135183103133 -0.75343275087525441
+0.44633019100468208 -0.62042776846682712 -0.64334361719230815  0.43611560071017003 -0.62405012717396335 -0.64835532047741207
+0.80104197563456969 -0.053122466844444174 -0.59574101077153174  0.79967159059344373 -0.0225286749783494 -0.60001483815108403
+0.79963678018449613 -0.055347528090576067 -0.59753024518837072  0.79967159059337956 -0.022528674978414182 -0.60001483815116718
+0.9151298141069959 0.23033669342916974 0.33088129441328601  0.91512008947987911 0.23057849677495398 0.33073974459586886
+0.24152064540259122 -0.94857068261000999 0.20072208160320942  0.22151649240577717 -0.95495693252433789 0.19745303394971786
+0.96105942755013962 0.20306848001363992 0.18186355091081879  0.96305716105844952 0.20064914867263406 0.17961298302457657
+0.9151298141069959 0.23033669342916982 -0.33088129441328606  0.91512008947987855 0.23057849677495176 -0.33073974459587202
+0.52293928186267569 0.79643145005237237 -0.30369631682393589  0.52285425410030517 0.79638679287412995 -0.30395970967361968
+0.75327597529184531 0.65407554465688111 0.068996282000725426  0.75343275087525341 0.65388144479235388 0.069124135183103522
+-0.26188501241256068 -0.95777186148081694 -0.11869836405462342  -0.26161560941278683 -0.95784115446597373 -0.11873329660574071
+-0.63457761123722189 -0.7274351680516471 -0.26105426945011495  -0.63469945426951091 -0.72726265769102516 -0.26123864468751895
+-0.95777186148081694 -0.11869836405462342 -0.26188501241256068  -0.95784115446597373 -0.11873329660574071 -0.26161560941278683
+-0.7274351680516471 -0.26105426945011495 -0.63457761123722189  -0.72726265769102516 -0.2612386446875189 -0.6346994542695108
+-0.52293928186267569 -0.79643145005237237 -0.30369631682393589  -0.52285425410030517 -0.79638679287412995 -0.30395970967361968
+-0.75327597529184531 -0.65407554465688111 0.068996282000725426  -0.75343275087525352 -0.65388144479235388 0.069124135183103758
+-0.7274351680516471 -0.26105426945011484 0.63457761123722201  -0.72726265769102483 -0.2612386446875179 0.6346994542695118
+-0.95777186148081694 -0.1186983640546234 0.26188501241256062  -0.95784115446597362 -0.11873329660574115 0.261615609412787
+-0.75327597529184531 -0.65407554465688111 -0.068996282000725467  -0.75343275087525441 -0.65388144479235299 -0.069124135183103133
+-0.52293928186267558 -0.79643145005237248 0.30369631682393589  -0.52285425410030517 -0.79638679287412995 0.30395970967361974
+0.068996282000725467 -0.75327597529184531 0.65407554465688111  0.069124135183103133 -0.75343275087525441 0.65388144479235299
+-0.30369631682393589 -0.52293928186267558 0.79643145005237248  -0.30395970967361974 -0.52285425410030517 0.79638679287412995
+-0.7274351680516471 0.26105426945011484 -0.63457761123722201  -0.72726265769102483 0.2612386446875179 -0.6346994542695118
+-0.95777186148081694 0.1186983640546234 -0.26188501241256062  -0.95784115446597362 0.11873329660574115 -0.261615609412787
+-0.9151298141069959 -0.23033669342916974 0.33088129441328601  -0.91512008947987233 -0.23057849677494924 0.33073974459589123
+-0.9151298141069959 0.23033669342916982 0.33088129441328606  -0.91512008947987211 0.23057849677494932 0.3307397445958915
+0.17773204761375261 0.87689701064830428 0.44478929974988757  0.24715310335759094 0.91603462451509665 0.31590490687894951
+0.22681489975349639 0.89805158744476077 0.37520377518580433  0.23977066491307356 0.89859032272363215 0.36748531964499087
+0.13781977899394779 0.92483674698373319 0.35451755943338792  0.1381878583407713 0.92488389215866995 0.35425118465944577
+0.39128013241131554 0.21439421228553296 0.89457789356401551  0.40347958770451259 0.24084616951440777 0.88272155572186739
+-0.52836121174546025 0.68346886752821701 0.50369111272938427  -0.52841879760671129 0.6837079082305223 0.50330613999723983
+-0.33543172738922172 0.69401454380114691 0.63704738383668813  -0.3357171829316089 0.6939881493756167 0.63692575831934395
+-0.46436496618972234 0.069930348042498203 0.88287877117884817  -0.4647686355560689 0.069884317336659021 0.88266998226615767
+-0.34659997257597441 0.27249577181778545 0.89756031181852258  -0.34672764240957243 0.27221405186828118 0.89759648615318932
+0.24136787945551616 -0.067889430951449614 0.96805607891910661  0.24117598392814743 -0.068303541004110332 0.96807477555330912
+0.12122116383748825 0.13320400767343915 0.98364735641266243  0.12142771508337384 0.13297103911780941 0.98365340072891583
+-0.24136787945551616 -0.067889430951449614 -0.96805607891910661  -0.24117598392814743 -0.068303541004110332 -0.96807477555330912
+-0.12122116383748825 0.13320400767343915 -0.98364735641266243  -0.12142771508337384 0.13297103911780941 -0.98365340072891583
+-0.61353851948571891 0.4604717807940108 -0.64151089172333209  -0.61382359089386196 0.46011525660260122 -0.64149399833801035
+-0.42151877198336163 0.46863573506266104 -0.77633914798103421  -0.42177409750733547 0.46868822204941935 -0.77616877106981497
+-0.13781977899394779 0.92483674698373319 -0.35451755943338792  -0.1381878583407713 0.92488389215866995 -0.35425118465944577
+-0.13929176414434621 0.81523570763863507 -0.5621285844293008  -0.13924301275047207 0.81541586445899128 -0.56187930322157986
+0.52836121174546025 0.68346886752821701 -0.50369111272938427  0.52841879760671118 0.68370790823052263 -0.5033061399972395
+0.33543172738922172 0.69401454380114691 -0.63704738383668813  0.3357171829316089 0.6939881493756167 -0.63692575831934395
+0.46436496618972234 0.069930348042498203 -0.88287877117884817  0.4647686355560689 0.069884317336659021 -0.88266998226615767
+0.34659997257597441 0.27249577181778545 -0.89756031181852258  0.34672764240957243 0.27221405186828118 -0.89759648615318932
+0.069930348042498203 -0.88287877117884817 0.46436496618972234  0.069884317336659021 -0.88266998226615767 0.4647686355560689
+0.27249577181778539 -0.89756031181852236 0.34659997257597436  0.27221405186830722 -0.89759648615318299 0.34672764240956827
+-0.067889430951449614 -0.96805607891910661 -0.24136787945551616  -0.068303541004109902 -0.9680747755533089 -0.2411759839281481
+0.13320400767343915 -0.98364735641266243 -0.12122116383748825  0.13297103911780983 -0.98365340072891594 -0.12142771508337313
+0.23259475183323844 -0.96237493457549972 -0.13494008765512316  0.21828391900492708 -0.96858479771763284 -0.11914537479123034
+0.23052646968895496 -0.9659260788205124 -0.10986054425367295  0.21828391900495353 -0.96858479771762251 -0.11914537479126541
+0.92600274487022971 0.1474180208074326 -0.34558774394436148  0.91762341400860992 0.15318437572857962 -0.36674489375563069
+0.92538907765393952 0.14644305776905853 -0.34753041451074101  0.91762341400883485 0.15318437572789123 -0.36674489375535524
+0.92780338960280884 0.1498743490715298 -0.34005641981910184  0.91762341400861536 0.15318437572861929 -0.36674489375560032
+0.73203596503112101 -0.16333083529035375 -0.66003296952840662  0.733157951295905 -0.17491713444451862 -0.65717837344917984
+0.10563529941394462 0.78429103445404746 0.61001812379817821  0.10429556095738519 0.78585236795603686 0.60955597917047288
+0.21439421228553288 0.89457789356401529 0.39128013241131548  0.24084616951440724 0.88272155572186584 0.40347958770451631
+-0.46436496618972245 -0.069930348042498203 -0.88287877117884817  -0.46476863555606873 -0.069884317336659119 -0.88266998226615778
+-0.34659997257597441 -0.27249577181778545 -0.89756031181852258  -0.34672764240957243 -0.27221405186828118 -0.89759648615318932
+-0.96805607891910661 0.24136787945551613 0.067889430951449614  -0.9680747755533089 0.24117598392814801 0.068303541004109847
+-0.98364735641266243 0.12122116383748827 -0.13320400767343918  -0.98365340072891583 0.12142771508337317 -0.13297103911780986
+-0.35451755943338792 -0.13781977899394779 0.92483674698373319  -0.35425118465944588 -0.13818785834076969 0.92488389215867017
+-0.5621285844293008 -0.13929176414434621 0.81523570763863529  -0.56187930322157975 -0.13924301275047163 0.81541586445899139
+-0.68346886752821701 0.50369111272938438 0.52836121174546036  -0.68370790823052208 0.50330613999724039 0.52841879760671107
+-0.69401454380114691 0.63704738383668813 0.33543172738922172  -0.69398814937561681 0.63692575831934384 0.33571718293160896
+-0.24136787945551613 0.067889430951449614 0.96805607891910661  -0.24117598392814732 0.068303541004110277 0.96807477555330912
+-0.12122116383748825 -0.13320400767343915 0.98364735641266243  -0.12142771508337388 -0.13297103911780939 0.98365340072891583
+0.50369111272938438 -0.52836121174546036 0.68346886752821701  0.50330613999724083 -0.52841879760671229 0.68370790823052086
+0.23259475183323847 -0.96237493457550005 0.13494008765512316  0.21828391900495392 -0.96858479771762052 0.11914537479128116
+0.35451755943338792 0.13781977899394779 0.92483674698373319  0.35425118465944633 0.13818785834076935 0.92488389215866995
+0.40180685413975104 0.20692923660476614 0.89148810692249203  0.4235080834275432 0.20738833035095472 0.88183387534488167
+0.92483674698373319 0.35451755943338792 0.13781977899394779  0.92488389215866984 0.35425118465944622 0.13818785834077099
+0.20692923660476614 0.89148810692249181 0.40180685413975092  0.20738833035095774 0.88183387534488222 0.42350808342754048
+0.85311732979922938 0.49982529754025784 0.14730961092137676  0.84145097432229177 0.51152737254408243 0.17406896607440822
+0.90687073458352596 0.28910030252843322 0.30397342055421106  0.90831680955776362 0.28893990864387653 0.30244718988225616
+0.067889430951449614 0.96805607891910661 -0.24136787945551613  0.068303541004109847 0.9680747755533089 -0.24117598392814801
+-0.13320400767343918 0.98364735641266243 -0.12122116383748827  -0.13297103911780986 0.98365340072891583 -0.12142771508337317
+-0.069930348042498217 0.88287877117884817 0.46436496618972245  -0.069884317336659146 0.88266998226615756 0.46476863555606907
+-0.27249577181778539 0.89756031181852236 0.34659997257597436  -0.27221405186828151 0.8975964861531891 0.34672764240957249
+-0.88287877117884817 0.46436496618972245 0.069930348042498217  -0.88266998226615767 0.4647686355560689 0.069884317336659035
+-0.89756031181852236 0.34659997257597436 0.27249577181778539  -0.8975964861531891 0.34672764240957255 0.27221405186828151
+-0.50369111272938427 0.52836121174546025 0.68346886752821701  -0.50330613999723928 0.52841879760671162 0.68370790823052252
+-0.63704738383668813 0.33543172738922172 0.69401454380114691  -0.63692575831934395 0.3357171829316089 0.6939881493756167
+-0.61353851948571891 -0.46047178079401074 0.64151089172333209  -0.61382359089386307 -0.4601152566026 0.64149399833801013
+-0.42151877198336163 -0.46863573506266104 0.77633914798103421  -0.42177409750733547 -0.46868822204941935 0.77616877106981497
+0.50369111272938427 0.52836121174546025 -0.68346886752821701  0.50330613999723928 0.52841879760671162 -0.68370790823052252
+0.63704738383668813 0.33543172738922172 -0.69401454380114691  0.63692575831934395 0.3357171829316089 -0.6939881493756167
+0.23052646968895496 -0.96592607882051262 0.10986054425367281  0.21828391900495209 -0.96858479771762296 0.11914537479126489
+0.42151877198336163 -0.46863573506266104 -0.77633914798103421  0.42177409750733547 -0.46868822204941935 -0.77616877106981497
+0.24136787945551613 0.067889430951449614 -0.96805607891910661  0.24117598392814732 0.068303541004110277 -0.96807477555330912
+0.12122116383748825 -0.13320400767343915 -0.98364735641266243  0.12142771508337388 -0.13297103911780939 -0.98365340072891583
+-0.50369111272938427 -0.52836121174546025 -0.68346886752821701  -0.50330613999723928 -0.52841879760671162 -0.68370790823052252
+-0.63704738383668813 -0.33543172738922172 -0.69401454380114691  -0.63692575831934395 -0.3357171829316089 -0.6939881493756167
+-0.35451755943338792 0.13781977899394779 -0.92483674698373319  -0.35425118465944633 0.13818785834076935 -0.92488389215866995
+-0.5621285844293008 0.13929176414434621 -0.81523570763863529  -0.56187930322157975 0.13924301275047163 -0.81541586445899139
+-0.92483674698373319 0.35451755943338792 -0.13781977899394779  -0.92488389215866995 0.35425118465944577 -0.1381878583407713
+-0.81523570763863507 0.5621285844293008 -0.13929176414434621  -0.81541586445899128 0.56187930322157975 -0.13924301275047204
+-0.46047178079401074 0.64151089172333209 -0.61353851948571891  -0.46011525660260011 0.64149399833801013 -0.61382359089386307
+-0.46863573506266104 0.77633914798103421 -0.42151877198336163  -0.46868822204941929 0.77616877106981508 -0.42177409750733547
+-0.067889430951449614 0.96805607891910661 0.24136787945551613  -0.068303541004109847 0.9680747755533089 0.24117598392814801
+0.13320400767343918 0.98364735641266243 0.12122116383748827  0.13297103911780986 0.98365340072891583 0.12142771508337317
+0.069930348042498217 0.88287877117884817 -0.46436496618972245  0.069884317336659035 0.88266998226615767 -0.4647686355560689
+0.27249577181778539 0.89756031181852236 -0.34659997257597436  0.27221405186828151 0.8975964861531891 -0.34672764240957249
+0.88287877117884817 0.46436496618972245 -0.069930348042498203  0.88266998226615778 0.46476863555606873 -0.069884317336659119
+0.89756031181852236 0.34659997257597436 -0.27249577181778539  0.89759648615318921 0.34672764240957232 -0.27221405186828113
+0.74532674141002397 -0.14250706129079604 0.65018159643527595  0.75649082974192605 -0.15162411868601797 0.63618531195639905
+0.96705050472527376 0.21194916611186074 -0.13775142693846454  0.95825269159637916 0.23889893330366063 -0.15709576287942265
+0.46436496618972245 -0.069930348042498203 0.88287877117884817  0.46476863555606873 -0.069884317336659119 0.88266998226615778
+0.34659997257597441 -0.27249577181778545 0.89756031181852258  0.34672764240957243 -0.27221405186828118 0.89759648615318932
+0.90598861546737153 0.11471241548978531 0.40567809407889893  0.89961957659540848 0.11104418275857067 0.42231955541009364
+0.33543172738922172 -0.69401454380114691 0.63704738383668813  0.33571718293160929 -0.69398814937561659 0.63692575831934384
+-0.4604717807940108 -0.64151089172333209 0.61353851948571891  -0.46011525660260011 -0.64149399833801013 0.61382359089386307
+-0.46863573506266104 -0.77633914798103421 0.42151877198336163  -0.46868822204941929 -0.77616877106981508 0.42177409750733547
+0.067889430951449614 -0.96805607891910661 0.24136787945551613  0.068303541004109847 -0.9680747755533089 0.24117598392814801
+-0.13320400767343915 -0.98364735641266243 0.12122116383748825  -0.13297103911780983 -0.98365340072891583 0.12142771508337317
+-0.52836121174546025 -0.68346886752821701 -0.50369111272938427  -0.52841879760671118 -0.68370790823052263 -0.5033061399972395
+-0.33543172738922172 -0.69401454380114691 -0.63704738383668813  -0.3357171829316089 -0.6939881493756167 -0.63692575831934395
+0.13781977899394779 -0.92483674698373319 -0.35451755943338792  0.13818785834077099 -0.92488389215866984 -0.35425118465944622
+0.13929176414434621 -0.81523570763863529 -0.5621285844293008  0.13924301275047163 -0.81541586445899139 -0.56187930322157975
+0.35451755943338792 -0.13781977899394779 -0.92483674698373319  0.35425118465944588 -0.13818785834076969 -0.92488389215867017
+0.5621285844293008 -0.13929176414434621 -0.81523570763863529  0.56187930322157975 -0.13924301275047163 -0.81541586445899139
+0.89637854466934042 0.099164106023202803 0.43023759412454371  0.89961957659540848 0.11104418275857633 0.42231955541009214
+0.29057971437419006 -0.8695923485436825 0.39708487175152696  0.29603762580284054 -0.87653155169613028 0.37954467851649776
+0.96805607891910661 0.24136787945551616 -0.067889430951449614  0.96807477555330879 0.24117598392814713 -0.068303541004116106
+0.28617291708332143 -0.87638371280443872 0.38483791504434911  0.29603762580283904 -0.87653155169613239 0.37954467851649404
+0.69212177096286931 -0.22700206765185557 -0.68413337702600874  0.67531637414765366 -0.22527759233947589 -0.70228042917184819
+0.35314170479917451 -0.76928684914828649 -0.53075413092765567  0.36351224121620684 -0.7590008347087519 -0.54016347840018608
+0.68346886752821701 0.50369111272938438 -0.52836121174546036  0.68370790823052208 0.50330613999724039 -0.52841879760671107
+0.69401454380114691 0.63704738383668813 -0.33543172738922172  0.69398814937561681 0.63692575831934384 -0.33571718293160896
+-0.069930348042498203 -0.88287877117884817 -0.46436496618972245  -0.069884317336659119 -0.88266998226615778 -0.46476863555606873
+-0.27249577181778539 -0.89756031181852236 -0.34659997257597436  -0.27221405186828113 -0.89759648615318921 -0.34672764240957232
+-0.88287877117884817 -0.46436496618972234 -0.069930348042498203  -0.88266998226615756 -0.46476863555606895 -0.069884317336659119
+-0.89756031181852236 -0.34659997257597436 -0.27249577181778539  -0.89759648615318921 -0.34672764240957232 -0.27221405186828113
+-0.68346886752821701 -0.50369111272938438 -0.52836121174546036  -0.68370790823052208 -0.50330613999724039 -0.52841879760671107
+-0.69401454380114691 -0.63704738383668813 -0.33543172738922172  -0.69398814937561681 -0.63692575831934384 -0.33571718293160896
+-0.64151089172333209 -0.61353851948571891 0.4604717807940108  -0.64149399833800991 -0.61382359089386296 0.46011525660260055
+-0.77633914798103421 -0.42151877198336163 0.46863573506266104  -0.77616877106981497 -0.42177409750733547 0.46868822204941935
+-0.92483674698373319 -0.35451755943338792 0.13781977899394779  -0.92488389215866995 -0.35425118465944577 0.1381878583407713
+-0.81523570763863529 -0.5621285844293008 0.13929176414434621  -0.81541586445899139 -0.56187930322157975 0.13924301275047163
+-0.13781977899394779 -0.92483674698373319 0.35451755943338792  -0.1381878583407713 -0.92488389215866995 0.35425118465944577
+-0.13929176414434621 -0.81523570763863529 0.5621285844293008  -0.13924301275047163 -0.81541586445899139 0.56187930322157975
+-0.64151089172333209 0.61353851948571891 -0.4604717807940108  -0.64149399833801013 0.61382359089386307 -0.46011525660260011
+-0.77633914798103421 0.42151877198336163 -0.46863573506266104  -0.77616877106981497 0.42177409750733547 -0.46868822204941935
+-0.96805607891910661 -0.24136787945551613 -0.067889430951449614  -0.9680747755533089 -0.24117598392814801 -0.068303541004109847
+-0.98364735641266243 -0.12122116383748827 0.13320400767343918  -0.98365340072891583 -0.12142771508337317 0.13297103911780986
+0.061653318916405575 0.59501600355390494 0.80134563315795981  0.0624103178944031 0.59583045652862043 0.80068159669947159
+0.30397342055421117 0.90687073458352585 0.28910030252843327  0.3024471898822651 0.90831680955776517 0.28893990864386243
+0.24136787945551613 0.067889430951449614 0.96805607891910661  0.24117598392814746 0.068303541004110249 0.96807477555330901
+0.271410708194047 0.90595336478045674 0.32286639405373119  0.27087574504910017 0.91136373772562762 0.30990719304796471
+-0.06165331891640554 0.59501600355390483 0.8013456331579597  -0.062410317894398985 0.59583045652862765 0.80068159669946648
+0.25671454238163 0.90442701067601727 0.33903474443581866  0.23862737818799382 0.91299254504580907 0.33091024020102572
+0.093588483842681203 0.68777595190194329 0.71884915497263779  0.10033016823456969 0.6857239871865588 0.72091363611669257
+0.89805158744476088 0.37520377518580417 0.22681489975349667  0.89859032272365158 0.36748531964495962 0.23977066491304894
+-0.099757165525981073 0.49525883802792381 0.86299895207436528  -0.10098201560182304 0.4948484409268058 0.86309191459386458
+-0.13183850301701977 0.66669512270283438 0.73357768674250445  -0.13227871496285437 0.6671197493120552 0.73311225719230522
+0.069930348042498217 0.88287877117884817 0.46436496618972251  0.069884317336659049 0.88266998226615712 0.46476863555606984
+-0.13929176414434621 0.81523570763863507 0.5621285844293008  -0.13924301275047377 0.81541586445899017 0.56187930322158108
+-1.2262216765384848e-18 0.43360551911151823 0.90110279868394083  0 0.43243812303240703 0.90166361230128866
+-0.21331917890744348 0.45337594379539092 0.86541618975952417  -0.2140314567980563 0.45308829251399863 0.86539097215515892
+-0.46047178079401074 0.64151089172333209 0.61353851948571902  -0.46011525660260089 0.64149399833800969 0.61382359089386285
+-0.42151877198336168 0.46863573506266087 0.77633914798103421  -0.4217740975073358 0.46868822204941818 0.77616877106981552
+0.099757165525981059 0.49525883802792381 0.86299895207436528  0.10098201560182403 0.49484844092680619 0.86309191459386425
+-1.2287154012371122e-18 0.32153744077837104 0.94689686564994791  0 0.32080957755114525 0.94714371399036157
+-0.35451755943338797 0.13781977899394779 0.92483674698373319  -0.35425118465944633 0.13818785834077102 0.92488389215866984
+-0.12122116383748827 0.13320400767343918 0.98364735641266243  -0.12142771508337373 0.13297103911780947 0.98365340072891583
+-0.099757165525981059 0.49525883802792381 -0.86299895207436528  -0.10098201560182213 0.4948484409268048 -0.86309191459386525
+1.2287154012371122e-18 0.32153744077837104 -0.94689686564994791  0 0.32080957755114525 -0.94714371399036157
+0.35451755943338797 0.13781977899394779 -0.92483674698373319  0.35425118465944633 0.13818785834077102 -0.92488389215866984
+0.12122116383748827 0.13320400767343918 -0.98364735641266243  0.12142771508337373 0.13297103911780947 -0.98365340072891583
+-0.061653318916405575 0.59501600355390494 -0.80134563315795981  -0.062410317894398999 0.59583045652862787 -0.80068159669946648
+-0.21331917890744351 0.45337594379539092 -0.86541618975952417  -0.21403145679805605 0.4530882925139984 -0.86539097215515914
+-0.24136787945551613 0.067889430951449614 -0.96805607891910661  -0.24117598392814746 0.068303541004110249 -0.96807477555330901
+-0.34659997257597425 0.27249577181778528 -0.89756031181852247  -0.34672764240957155 0.27221405186828268 -0.8975964861531891
+0.061653318916405561 0.59501600355390494 -0.8013456331579597  0.062410317894399187 0.59583045652862754 -0.8006815966994667
+-0.13183850301701969 0.66669512270283426 -0.73357768674250456  -0.13227871496285429 0.66711974931205509 -0.73311225719230533
+-0.50369111272938427 0.52836121174546036 -0.68346886752821701  -0.50330613999724005 0.52841879760671107 -0.6837079082305223
+-0.33543172738922172 0.69401454380114713 -0.63704738383668802  -0.33571718293161007 0.69398814937561648 -0.63692575831934362
+0.099757165525981087 0.49525883802792392 -0.86299895207436528  0.10098201560182304 0.4948484409268058 -0.86309191459386458
+0.13183850301701977 0.66669512270283438 -0.73357768674250434  0.13227871496285484 0.66711974931205509 -0.73311225719230511
+-0.069930348042498217 0.88287877117884817 -0.46436496618972251  -0.069884317336658938 0.88266998226615723 -0.46476863555606968
+0.13929176414434621 0.81523570763863507 -0.5621285844293008  0.13924301275047377 0.81541586445899017 -0.56187930322158108
+1.2262216765384848e-18 0.43360551911151823 -0.90110279868394083  -1.1076796126959499e-15 0.43243812303240758 -0.90166361230128844
+0.21331917890744348 0.45337594379539092 -0.86541618975952417  0.2140314567980563 0.45308829251399863 -0.86539097215515892
+0.46047178079401074 0.64151089172333209 -0.61353851948571902  0.46011525660260089 0.64149399833800969 -0.61382359089386285
+0.42151877198336168 0.46863573506266087 -0.77633914798103421  0.4217740975073358 0.46868822204941818 -0.77616877106981552
+0.36517401588679055 -0.75000000000000011 -0.54975734503310147  0.36351224121617498 -0.75900083470875257 -0.54016347840020651
+0.97371394847093473 0.22313250261608547 -0.018534606855888307  0.97011569110293328 0.24165005293363567 -0.021927101793196371
+0.22648000271342913 -0.97241808576487487 0.034988854233130556  0.21668703966435113 -0.97542959357555314 0.039797422259881816
+0.50622685812276524 -0.52571510245600384 -0.6834170246153628  0.54199242061149877 -0.50624478547213547 -0.67079090123671159
+0.49314081475211924 -0.54531814984023841 0.67677227421098896  0.49105853440620695 -0.56677814486533507 0.66153159432474384
+0.48978532609687886 -0.55056521742650477 0.67476755984413894  0.49105853440620217 -0.56677814486533251 0.66153159432474951
+0.13781977899394779 -0.92483674698373319 0.35451755943338797  0.13818785834077099 -0.92488389215866973 0.35425118465944627
+0.13320400767343918 -0.98364735641266243 0.12122116383748827  0.13297103911780991 -0.98365340072891594 0.12142771508337302
+0.69531998299352837 -0.22171162891211948 0.68272481536695295  0.70341121140141549 -0.24317084427691493 0.66789266216095355
+0.69607577061268988 -0.22054081151139987 0.68235511400187043  0.70341121140139107 -0.24317084427690094 0.66789266216098442
+0.067889430951449614 -0.96805607891910661 -0.24136787945551613  0.068303541004109819 -0.9680747755533089 -0.24117598392814821
+0.27249577181778528 -0.89756031181852247 -0.34659997257597425  0.27221405186828412 -0.89759648615318754 -0.34672764240957432
+0.97256579272521648 0.22114863140943247 0.060907607905721736  0.97824013612619498 0.2023295205475559 0.045923862934206007
+0.30729748704039866 -0.84278707285381271 0.43974499787970989  0.29815500373095982 -0.84204499011931699 0.44951510360070301
+0.31474205002823563 -0.83109069623026088 0.45671715648324701  0.29815500373095521 -0.84204499011931666 0.44951510360070684
+0.94691066341902053 0.17998804508785299 -0.26439588316448503  0.95675731372081363 0.1595843916717562 -0.24320416233380587
+0.45944041532897173 -0.59972505245462004 -0.653998898413091  0.47623926703786867 -0.60557549052406512 -0.63755351603435739
+0.61696807586665503 -0.34742682425518878 -0.70495163176324005  0.60285708655996961 -0.35990150486609107 -0.71206336795228298
+0.6078561560079746 -0.36184045701812123 -0.70538094374692584  0.60285708655996939 -0.35990150486608774 -0.71206336795228498
+0.40435813432554835 -0.6879005781223142 -0.60211592452938856  0.41977894187290826 -0.66093884463189856 -0.62204942216572534
+0.80134563315795981 0.061653318916405575 0.59501600355390494  0.80068159669946759 0.062410317894398069 0.59583045652862632
+0.89457789356401518 0.39128013241131554 0.21439421228553296  0.8827215557218655 0.40347958770451159 0.24084616951441637
+0.96805607891910661 0.24136787945551613 0.067889430951449614  0.96807477555330812 0.24117598392814721 0.068303541004124849
+0.15717574894030886 0.48126519958548875 0.86156266551879135  0.15629656115482837 0.47538384129543992 0.86578380003691857
+-1.2262216765384848e-18 -0.43360551911151823 -0.90110279868394083  0 -0.43243812303240703 -0.90166361230128866
+-0.21331917890744348 -0.45337594379539092 -0.86541618975952417  -0.2140314567980563 -0.45308829251399863 -0.86539097215515892
+-0.46047178079401074 -0.64151089172333209 -0.61353851948571902  -0.46011525660260089 -0.64149399833800969 -0.61382359089386285
+-0.42151877198336168 -0.46863573506266087 -0.77633914798103421  -0.4217740975073358 -0.46868822204941818 -0.77616877106981552
+-0.86299895207436528 0.099757165525981059 -0.49525883802792381  -0.86309191459386514 0.10098201560182231 -0.49484844092680491
+-0.94689686564994791 -1.2287154012371122e-18 -0.32153744077837104  -0.94714371399036157 0 -0.32080957755114525
+-0.92483674698373297 -0.35451755943338792 -0.13781977899394779  -0.92488389215866973 -0.35425118465944627 -0.13818785834077105
+-0.98364735641266243 -0.12122116383748827 -0.13320400767343918  -0.98365340072891594 -0.12142771508337305 -0.13297103911780991
+-0.8013456331579597 0.06165331891640554 0.59501600355390483  -0.80068159669946648 0.062410317894397077 0.59583045652862787
+-0.73357768674250456 -0.13183850301701969 0.66669512270283426  -0.73311225719230411 -0.13227871496285351 0.66711974931205642
+-0.68346886752821701 -0.50369111272938427 0.52836121174546036  -0.6837079082305223 -0.50330613999724005 0.52841879760671107
+-0.63704738383668802 -0.33543172738922172 0.69401454380114713  -0.6369257583193435 -0.33571718293160868 0.69398814937561715
+-0.49525883802792392 0.86299895207436528 0.099757165525981087  -0.49484844092680513 0.86309191459386492 0.10098201560182224
+-0.66669512270283438 0.73357768674250434 0.13183850301701977  -0.66711974931205664 0.73311225719230422 0.13227871496285293
+-0.88287877117884817 0.46436496618972251 -0.069930348042498217  -0.88266998226615723 0.46476863555606968 -0.069884317336658938
+-0.81523570763863507 0.5621285844293008 0.13929176414434621  -0.81541586445899006 0.56187930322158097 0.13924301275047377
+-0.099757165525981059 -0.49525883802792381 0.86299895207436528  -0.10098201560182309 -0.49484844092680558 0.8630919145938647
+1.2287154012371122e-18 -0.32153744077837104 0.94689686564994791  0 -0.32080957755114525 0.94714371399036157
+0.35451755943338797 -0.13781977899394779 0.92483674698373319  0.35425118465944633 -0.13818785834077102 0.92488389215866984
+0.12122116383748827 -0.13320400767343918 0.98364735641266243  0.12142771508337367 -0.1329710391178095 0.98365340072891583
+0.42861413394522363 -0.64891100701386606 -0.6271743261149485  0.41977894187289888 -0.66093884463190555 -0.62204942216572423
+0.73357768674250445 -0.13183850301701977 0.66669512270283438  0.73311225719230477 -0.13227871496285407 0.66711974931205564
+0.46436496618972256 0.069930348042498217 0.88287877117884817  0.46476863555606907 0.069884317336659313 0.88266998226615745
+0.5621285844293008 -0.13929176414434621 0.81523570763863507  0.56187930322157997 -0.13924301275047157 0.81541586445899106
+0.26758089404998364 -0.9059728893652188 0.32585692434233743  0.24890531892629392 -0.91663390223888863 0.31277536903744108
+0.095362650095153129 0.74011618472454033 0.66455433327713254  0.10275236361909811 0.73743092048487702 0.66756092552179502
+0.39229183849441457 0.893825128737608 0.21405999957086966  0.39311654818379393 0.89197584375894701 0.22324532177533571
+0.41582096722616779 0.88692657891222382 0.1974660445788706  0.42149610172113317 0.88421545010984037 0.201256239706849
+0.59501600355390494 0.8013456331579597 -0.061653318916405561  0.59583045652862865 0.80068159669946604 -0.062410317894396571
+0.88692657891222382 0.1974660445788706 0.41582096722616779  0.88421545010984026 0.20125623970685644 0.42149610172112989
+0.87689701064830428 0.44478929974988757 0.17773204761375266  0.8726529832451837 0.46036815782148133 0.162904665670867
+0.35660859546245854 0.90157505838463314 0.24184951424973428  0.36356562872996251 0.89862238304022868 0.24555619785557764
+0.59501600355390494 0.80134563315795981 0.061653318916405575  0.59583045652862732 0.80068159669946681 0.062410317894397924
+0.85818780510941439 0.48898817612201739 0.15304821643557714  0.86108611456980655 0.47782642632713784 0.17381774822644047
+0.067889430951449614 0.96805607891910661 0.24136787945551613  0.068303541004109777 0.9680747755533089 0.24117598392814812
+0.82968743367193953 0.12850859076870802 0.5423386494351099  0.83543687458500482 0.14218930946431604 0.53087421189741346
+-0.49525883802792381 0.86299895207436528 -0.099757165525981059  -0.49484844092680491 0.86309191459386514 -0.10098201560182231
+-0.32153744077837104 0.94689686564994791 1.2287154012371122e-18  -0.32080957755114525 0.94714371399036157 0
+-0.13781977899394779 0.92483674698373319 0.35451755943338797  -0.1381878583407708 0.92488389215866984 0.35425118465944627
+-0.13320400767343918 0.98364735641266243 0.12122116383748827  -0.13297103911780991 0.98365340072891594 0.12142771508337305
+-0.43360551911151823 0.90110279868394083 1.2262216765384848e-18  -0.43243812303240797 0.90166361230128833 0
+-0.45337594379539092 0.86541618975952417 0.21331917890744348  -0.45308829251399857 0.86539097215515892 0.21403145679805627
+-0.64151089172333209 0.61353851948571902 0.46047178079401074  -0.64149399833800991 0.61382359089386251 0.46011525660260127
+-0.46863573506266099 0.77633914798103421 0.42151877198336174  -0.46868822204941957 0.77616877106981486 0.42177409750733541
+-0.90110279868394083 1.2262216765384848e-18 0.43360551911151823  -0.90166361230128833 0 0.43243812303240797
+-0.86541618975952417 0.21331917890744348 0.45337594379539092  -0.86539097215515892 0.21403145679805627 0.45308829251399857
+-0.61353851948571902 0.46047178079401074 0.64151089172333209  -0.61382359089386329 0.46011525660260061 0.64149399833800946
+-0.77633914798103421 0.42151877198336174 0.46863573506266099  -0.77616877106981552 0.4217740975073358 0.46868822204941812
+-0.86299895207436528 0.099757165525981073 0.49525883802792381  -0.86309191459386503 0.10098201560182225 0.49484844092680519
+-0.73357768674250445 0.13183850301701977 0.66669512270283438  -0.73311225719230411 0.13227871496285362 0.66711974931205642
+-0.46436496618972251 -0.069930348042498217 0.88287877117884817  -0.46476863555606968 -0.069884317336658938 0.88266998226615723
+-0.5621285844293008 0.13929176414434621 0.81523570763863507  -0.56187930322157997 0.13924301275047157 0.81541586445899106
+-0.061653318916405582 -0.59501600355390505 0.80134563315795981  -0.062410317894398978 -0.59583045652862754 0.8006815966994667
+-0.21331917890744351 -0.45337594379539092 0.86541618975952417  -0.21403145679805605 -0.4530882925139984 0.86539097215515914
+-0.24136787945551613 -0.067889430951449614 0.96805607891910661  -0.24117598392814743 -0.068303541004110221 0.96807477555330912
+-0.34659997257597425 -0.27249577181778528 0.89756031181852247  -0.34672764240957155 -0.27221405186828268 0.8975964861531891
+0.86299895207436528 0.099757165525981073 -0.49525883802792381  0.86309191459386503 0.10098201560182218 -0.49484844092680508
+0.73357768674250445 0.13183850301701977 -0.66669512270283438  0.73311225719230411 0.13227871496285362 -0.66711974931205642
+0.46436496618972251 -0.069930348042498217 -0.88287877117884817  0.46476863555606968 -0.069884317336658938 -0.88266998226615723
+0.5621285844293008 0.13929176414434621 -0.81523570763863507  0.56187930322157997 0.13924301275047157 -0.81541586445899106
+0.061653318916405582 -0.59501600355390505 -0.80134563315795981  0.062410317894398978 -0.59583045652862754 -0.8006815966994667
+0.21331917890744351 -0.45337594379539092 -0.86541618975952417  0.21403145679805605 -0.4530882925139984 -0.86539097215515914
+0.24136787945551613 -0.067889430951449614 -0.96805607891910661  0.24117598392814743 -0.068303541004110221 -0.96807477555330912
+0.34659997257597425 -0.27249577181778528 -0.89756031181852247  0.34672764240957155 -0.27221405186828268 -0.8975964861531891
+0.099757165525981059 -0.49525883802792381 -0.86299895207436528  0.10098201560182309 -0.49484844092680558 -0.8630919145938647
+-1.2287154012371122e-18 -0.32153744077837104 -0.94689686564994791  0 -0.32080957755114525 -0.94714371399036157
+-0.35451755943338797 -0.13781977899394779 -0.92483674698373319  -0.35425118465944633 -0.13818785834077102 -0.92488389215866984
+-0.12122116383748827 -0.13320400767343918 -0.98364735641266243  -0.12142771508337367 -0.1329710391178095 -0.98365340072891583
+-0.86299895207436528 -0.099757165525981073 -0.49525883802792381  -0.86309191459386503 -0.10098201560182225 -0.49484844092680519
+-0.73357768674250445 -0.13183850301701977 -0.66669512270283438  -0.73311225719230411 -0.13227871496285362 -0.66711974931205642
+-0.46436496618972256 0.069930348042498217 -0.88287877117884817  -0.46476863555606907 0.069884317336659313 -0.88266998226615745
+-0.5621285844293008 -0.13929176414434621 -0.81523570763863507  -0.56187930322157997 -0.13924301275047157 -0.81541586445899106
+-0.8013456331579597 -0.06165331891640554 -0.59501600355390483  -0.80068159669946637 -0.062410317894396848 -0.59583045652862809
+-0.73357768674250456 0.13183850301701969 -0.66669512270283426  -0.73311225719230411 0.13227871496285351 -0.66711974931205642
+-0.68346886752821701 0.50369111272938438 -0.52836121174546036  -0.68370790823052185 0.50330613999724083 -0.52841879760671095
+-0.63704738383668802 0.33543172738922172 -0.69401454380114713  -0.6369257583193435 0.33571718293160868 -0.69398814937561715
+-0.59501600355390494 0.8013456331579597 0.061653318916405561  -0.59583045652862865 0.80068159669946604 0.062410317894396571
+-0.66669512270283426 0.73357768674250456 -0.13183850301701969  -0.66711974931205642 0.73311225719230422 -0.13227871496285357
+-0.52836121174546025 0.68346886752821701 -0.50369111272938438  -0.52841879760671151 0.68370790823052274 -0.50330613999723905
+-0.69401454380114724 0.63704738383668813 -0.33543172738922178  -0.69398814937561737 0.63692575831934306 -0.33571718293160957
+-0.59501600355390505 0.80134563315795981 -0.061653318916405582  -0.59583045652862798 0.80068159669946648 -0.062410317894396924
+-0.45337594379539092 0.86541618975952417 -0.21331917890744351  -0.4530882925139984 0.86539097215515914 -0.21403145679805605
+-0.067889430951449614 0.96805607891910661 -0.24136787945551613  -0.068303541004109777 0.9680747755533089 -0.24117598392814812
+-0.27249577181778528 0.89756031181852247 -0.34659997257597425  -0.27221405186828107 0.89759648615318954 -0.34672764240957177
+0.49525883802792381 0.86299895207436528 0.099757165525981059  0.49484844092680819 0.86309191459386347 0.10098201560182053
+0.32153744077837104 0.94689686564994791 -1.2287154012371122e-18  0.32080957755114525 0.94714371399036157 0
+0.13781977899394779 0.92483674698373319 -0.35451755943338797  0.1381878583407708 0.92488389215866984 -0.35425118465944627
+0.13320400767343918 0.98364735641266243 -0.12122116383748827  0.13297103911780991 0.98365340072891594 -0.12142771508337305
+0.43360551911151823 0.90110279868394083 -1.2262216765384848e-18  0.43243812303240797 0.90166361230128833 0
+0.45337594379539092 0.86541618975952417 -0.21331917890744348  0.45308829251399857 0.86539097215515892 -0.21403145679805627
+0.64151089172333209 0.61353851948571902 -0.46047178079401074  0.64149399833801013 0.61382359089386251 -0.46011525660260078
+0.46863573506266099 0.77633914798103421 -0.42151877198336174  0.46868822204941957 0.77616877106981486 -0.42177409750733541
+0.26791287934591501 -0.90549608434201145 0.3269900786062353  0.24890531892650397 -0.91663390223885366 0.31277536903737635
+0.86541618975952417 0.21331917890744348 -0.45337594379539092  0.86539097215515892 0.21403145679805627 -0.45308829251399857
+0.61353851948571902 0.46047178079401074 -0.64151089172333209  0.61382359089386329 0.46011525660260061 -0.64149399833800946
+0.77633914798103421 0.42151877198336168 -0.46863573506266087  0.77616877106981552 0.4217740975073358 -0.46868822204941818
+0.26660413751883805 -0.90759811547986113 0.3218712605625344  0.24890531892629586 -0.9166339022388903 0.31277536903743486
+0.74532674141002375 -0.14250706129079604 -0.65018159643527595  0.75649082974193027 -0.15162411868602041 -0.6361853119563935
+0.97256579272521637 0.22114863140943242 -0.060907607905721597  0.97824013612619609 0.20232952054755199 -0.045923862934199415
+0.56731181848165257 -0.42664579118104862 -0.70294074606773127  0.56065793252598195 -0.42546670457134661 -0.71038071904922218
+1.2262216765384848e-18 -0.43360551911151823 0.90110279868394083  0 -0.43243812303240703 0.90166361230128866
+0.21331917890744348 -0.45337594379539092 0.86541618975952417  0.2140314567980563 -0.45308829251399863 0.86539097215515892
+0.57556494808430081 -0.41363385795819674 -0.70422028778974766  0.56065793252598206 -0.42546670457134622 -0.7103807190492224
+0.42151877198336168 -0.46863573506266087 0.77633914798103421  0.4217740975073358 -0.46868822204941818 0.77616877106981552
+0.099757165525981087 -0.49525883802792392 0.86299895207436528  0.10098201560182304 -0.4948484409268058 0.86309191459386458
+0.13183850301701977 -0.66669512270283438 0.73357768674250434  0.13227871496285484 -0.66711974931205509 0.73311225719230511
+-0.069930348042498217 -0.88287877117884817 0.46436496618972251  -0.069884317336658938 -0.88266998226615723 0.46476863555606968
+0.13929176414434621 -0.81523570763863507 0.5621285844293008  0.13924301275047157 -0.81541586445899106 0.56187930322157997
+-0.59501600355390505 -0.80134563315795981 0.061653318916405582  -0.59583045652862865 -0.80068159669946604 0.062410317894396668
+-0.45337594379539092 -0.86541618975952417 0.21331917890744351  -0.4530882925139984 -0.86539097215515914 0.21403145679805605
+-0.067889430951449614 -0.96805607891910661 0.24136787945551613  -0.068303541004109777 -0.9680747755533089 0.24117598392814812
+-0.27249577181778528 -0.89756031181852247 0.34659997257597425  -0.27221405186828107 -0.89759648615318954 0.34672764240957177
+-0.49525883802792381 -0.86299895207436528 0.099757165525981059  -0.49484844092680491 -0.86309191459386514 0.10098201560182231
+-0.32153744077837104 -0.94689686564994791 -1.2287154012371122e-18  -0.32080957755114525 -0.94714371399036157 0
+-0.13781977899394779 -0.92483674698373319 -0.35451755943338797  -0.13818785834077099 -0.92488389215866973 -0.35425118465944627
+-0.13320400767343918 -0.98364735641266243 -0.12122116383748827  -0.13297103911780991 -0.98365340072891594 -0.12142771508337298
+-0.099757165525981087 -0.49525883802792392 -0.86299895207436528  -0.10098201560182304 -0.4948484409268058 -0.86309191459386458
+-0.13183850301701977 -0.66669512270283438 -0.73357768674250434  -0.13227871496285484 -0.66711974931205509 -0.73311225719230511
+0.069930348042498217 -0.88287877117884817 -0.46436496618972256  0.069884317336659313 -0.88266998226615756 -0.46476863555606912
+-0.13929176414434621 -0.81523570763863507 -0.5621285844293008  -0.13924301275047157 -0.81541586445899106 -0.56187930322157997
+-0.061653318916405561 -0.59501600355390494 -0.8013456331579597  -0.062410317894398937 -0.59583045652862754 -0.80068159669946659
+0.13183850301701969 -0.66669512270283426 -0.73357768674250456  0.13227871496285543 -0.66711974931205498 -0.73311225719230522
+0.50369111272938438 -0.52836121174546036 -0.68346886752821701  0.50330613999722795 -0.5284187976067054 -0.68370790823053562
+0.33543172738922172 -0.69401454380114713 -0.63704738383668802  0.33571718293160957 -0.69398814937561559 -0.63692575831934484
+0.8013456331579597 0.06165331891640554 -0.59501600355390483  0.80068159669946648 0.062410317894397077 -0.59583045652862787
+0.73357768674250456 -0.13183850301701969 -0.66669512270283426  0.73311225719230488 -0.13227871496285401 -0.66711974931205553
+0.95663400990185354 0.19602936533555493 -0.2109426096162656  0.95495693252433866 0.19745303394970615 -0.22151649240578419
+0.33951337109735685 -0.79211156275891992 0.50664961250726281  0.31909818315152372 -0.81512028618526733 0.48348243872827956
+0.32993533901945349 -0.80654749644509338 0.4886330537542477  0.31909818315151811 -0.81512028618526333 0.48348243872828994
+0.24930895838975137 -0.93567470552212906 -0.24579255546759976  0.24611330719286467 -0.93975526497093065 -0.23725151629021604
+0.9253890776539393 0.14644305776905842 0.34753041451074107  0.91762341400861369 0.15318437572858953 0.36674489375561692
+0.92600274487022949 0.1474180208074326 0.34558774394436131  0.91762341400881287 0.15318437572798788 0.36674489375536989
+0.86299895207436528 0.099757165525981059 0.49525883802792381  0.86309191459386403 0.10098201560182078 0.49484844092680708
+0.92780338960280884 0.14987434907153019 0.34005641981910062  0.91762341400881287 0.15318437572798788 0.36674489375536989
+0.83001349060802176 -0.0073066631575244394 -0.55678551944213672  0.83494479465357463 -0.020957685934281423 -0.5499345099929448
+0.76687916779802345 -0.10789205109760858 -0.63136143448574888  0.7587780543030439 -0.10723544565538685 -0.64246122334595235
+0.83001349060802165 -0.0073066631575244463 0.55678551944213661  0.83494479465357618 -0.020957685934293872 0.54993450999294191
+0.85822228618686602 0.038871133598592081 -0.51061830246204121  0.85590248058787277 0.033910248167246401 -0.51602426182570316
+0.92483674698373297 0.35451755943338792 -0.13781977899394779  0.92488389215866973 0.35425118465944627 -0.13818785834077105
+0.85756840681366708 0.037892913779084561 -0.51176714118576794  0.85590248058785579 0.033910248167175396 -0.51602426182573624
+0.49525883802792392 0.86299895207436528 -0.099757165525981087  0.49484844092680513 0.86309191459386492 -0.10098201560182224
+0.66669512270283438 0.73357768674250434 -0.13183850301701977  0.66711974931205664 0.73311225719230422 -0.13227871496285293
+0.88287877117884817 0.46436496618972256 0.069930348042498217  0.88266998226615745 0.46476863555606907 0.069884317336659313
+0.81523570763863507 0.5621285844293008 -0.13929176414434621  0.81541586445899117 0.56187930322158008 -0.1392430127504716
+-0.43360551911151823 -0.90110279868394083 -1.2262216765384848e-18  -0.43243812303240797 -0.90166361230128833 0
+-0.45337594379539092 -0.86541618975952417 -0.21331917890744348  -0.45308829251399857 -0.86539097215515892 -0.21403145679805627
+-0.64151089172333209 -0.61353851948571902 -0.46047178079401074  -0.64149399833801013 -0.61382359089386251 -0.46011525660260078
+-0.46863573506266087 -0.77633914798103421 -0.42151877198336168  -0.46868822204941957 -0.77616877106981486 -0.42177409750733547
+-0.90110279868394083 -1.2262216765384848e-18 -0.43360551911151823  -0.90166361230128833 0 -0.43243812303240797
+-0.86541618975952417 -0.21331917890744348 -0.45337594379539092  -0.86539097215515892 -0.21403145679805627 -0.45308829251399857
+-0.61353851948571902 -0.46047178079401074 -0.64151089172333209  -0.61382359089386329 -0.46011525660260061 -0.64149399833800946
+-0.77633914798103421 -0.42151877198336168 -0.46863573506266087  -0.77616877106981552 -0.4217740975073358 -0.46868822204941818
+-0.49525883802792392 -0.86299895207436528 -0.099757165525981087  -0.49484844092680513 -0.86309191459386492 -0.10098201560182224
+-0.66669512270283438 -0.73357768674250434 -0.13183850301701977  -0.66711974931205664 -0.73311225719230422 -0.13227871496285293
+-0.88287877117884817 -0.46436496618972251 0.069930348042498217  -0.88266998226615712 -0.46476863555606984 0.069884317336659049
+-0.81523570763863507 -0.5621285844293008 -0.13929176414434621  -0.81541586445899117 -0.56187930322158008 -0.1392430127504716
+-0.80134563315795981 -0.061653318916405575 0.59501600355390494  -0.80068159669946681 -0.06241031789439732 0.59583045652862754
+-0.86541618975952417 -0.21331917890744351 0.45337594379539092  -0.86539097215515914 -0.21403145679805605 0.4530882925139984
+-0.96805607891910661 -0.24136787945551613 0.067889430951449614  -0.9680747755533089 -0.24117598392814812 0.068303541004109777
+-0.89756031181852258 -0.3465999725759743 0.27249577181778534  -0.89759648615318943 -0.34672764240957177 0.27221405186828118
+-0.59501600355390494 -0.8013456331579597 -0.061653318916405561  -0.59583045652862865 -0.80068159669946604 -0.062410317894396571
+-0.66669512270283426 -0.73357768674250456 0.13183850301701969  -0.66711974931205642 -0.73311225719230411 0.13227871496285348
+-0.52836121174546036 -0.68346886752821701 0.50369111272938438  -0.52841879760671151 -0.68370790823052208 0.50330613999723994
+-0.69401454380114724 -0.63704738383668813 0.33543172738922178  -0.69398814937561726 -0.6369257583193435 0.33571718293160868
+0.061653318916405561 -0.59501600355390494 0.8013456331579597  0.062410317894398937 -0.59583045652862754 0.80068159669946659
+-0.13183850301701969 -0.66669512270283426 0.73357768674250456  -0.13227871496285543 -0.66711974931205498 0.73311225719230522
+-0.50369111272938438 -0.52836121174546025 0.68346886752821701  -0.50330613999723905 -0.52841879760671151 0.68370790823052274
+-0.33543172738922172 -0.69401454380114713 0.63704738383668802  -0.33571718293160874 -0.69398814937561726 0.6369257583193435
+-0.80134563315795981 0.061653318916405582 -0.59501600355390505  -0.8006815966994667 0.062410317894397119 -0.59583045652862776
+-0.86541618975952417 0.21331917890744351 -0.45337594379539092  -0.86539097215515914 0.21403145679805605 -0.4530882925139984
+-0.96805607891910661 0.24136787945551613 -0.067889430951449614  -0.9680747755533089 0.24117598392814812 -0.068303541004109777
+-0.89756031181852258 0.3465999725759743 -0.27249577181778534  -0.89759648615318943 0.34672764240957177 -0.27221405186828118
+-0.86299895207436528 -0.099757165525981059 0.49525883802792381  -0.86309191459386514 -0.10098201560182231 0.49484844092680491
+-0.94689686564994791 1.2287154012371122e-18 0.32153744077837104  -0.94714371399036157 0 0.32080957755114525
+-0.92483674698373297 0.35451755943338792 0.13781977899394779  -0.92488389215866984 0.35425118465944633 0.13818785834077082
+-0.98364735641266243 0.12122116383748827 0.13320400767343918  -0.98365340072891594 0.12142771508337305 0.13297103911780991
+0.5423386494351099 0.82968743367193953 0.12850859076870802  0.53087421189741346 0.83543687458500482 0.14218930946431604
+0.50275426427774228 0.85145286645038376 0.14564781357706019  0.5008250364944089 0.85521146872291598 0.13337026124727755
+-0.27572854131968011 0.82875656716879009 0.48696645046278492  -0.275632775839387 0.82881098413486565 0.48692804957249042
+-0.51219972690999771 0.34179011670600545 0.78792826822967776  -0.51223335844459583 0.34188293456237462 0.78786613428398444
+-0.040828298939112564 0 0.99916617737278246  -0.040944849850879372 6.9461252307533092e-18 0.99916140801708753
+0.040828298939112564 0 -0.99916617737278246  0.040944849850879372 6.9461252307533092e-18 -0.99916140801708753
+-0.48696645046278469 0.27572854131968005 -0.82875656716879031  -0.4869280495724912 0.2756327758393875 -0.82881098413486509
+-0.34179011670600551 0.78792826822967776 -0.5121997269099976  -0.34188293456237351 0.78786613428398444 -0.5122333584445965
+0.27572854131968011 0.82875656716879009 -0.48696645046278492  0.275632775839387 0.82881098413486565 -0.48692804957249042
+0.51219972690999771 0.34179011670600545 -0.78792826822967776  0.51223335844459583 0.34188293456237462 -0.78786613428398444
+0.34179011670600545 -0.78792826822967776 0.51219972690999771  0.34188293456236002 -0.78786613428397467 0.51223335844462059
+0 -0.99916617737278246 0.040828298939112564  1.0419187846129966e-17 -0.99916140801708753 0.040944849850879379
+0.27572854131968005 -0.82875656716879031 -0.48696645046278469  0.27563277583938733 -0.82881098413486509 -0.48692804957249125
+0.85711100340627266 0.037134436368273085 -0.51257565524045945  0.85590248058785268 0.033910248167156591 -0.51602426182574257
+0.79963678018449613 -0.05534752809057629 0.5975302451883705  0.79967159059339421 -0.022528674978401525 0.60001483815114809
+0.90442701067601738 0.33903474443581871 0.25671454238163005  0.91299254504580829 0.33091024020103199 0.23862737818798813
+-0.51219972690999771 -0.34179011670600545 -0.78792826822967776  -0.51223335844459583 -0.34188293456237462 -0.78786613428398444
+-0.99916617737278246 -0.040828298939112578 0  -0.99916140801708753 -0.040944849850879379 3.4730626153766554e-18
+-0.5121997269099976 -0.34179011670600551 0.78792826822967776  -0.5122333584445965 -0.34188293456237351 0.78786613428398444
+-0.8287565671687902 0.48696645046278497 0.27572854131968016  -0.82881098413486565 0.48692804957249042 0.27563277583938689
+0.040828298939112564 0 0.99916617737278246  0.040944849850879372 -6.9461252307533092e-18 0.99916140801708753
+0.48696645046278492 -0.27572854131968011 0.82875656716879031  0.48692804957249064 -0.27563277583938733 0.82881098413486542
+0.48126519958548886 0.86156266551879135 0.15717574894030889  0.47538384129544203 0.8657838000369189 0.15629656115481971
+0.89148810692249181 0.40180685413975104 0.20692923660476614  0.88183387534488211 0.42350808342754109 0.20738833035095716
+0.44878045857535931 0.87541500307784514 0.17583413883161553  0.44918580997761198 0.8754363101234186 0.17844712110944896
+0 0.99916617737278246 0.040828298939112578  3.4730626153766554e-18 0.99916140801708753 0.040944849850879379
+-0.34179011670600545 0.78792826822967776 0.51219972690999771  -0.34188293456237318 0.78786613428398489 0.51223335844459617
+-0.78792826822967776 0.51219972690999771 0.34179011670600545  -0.78786613428398422 0.51223335844459605 0.34188293456237484
+-0.48696645046278492 0.27572854131968011 0.82875656716879031  -0.48692804957249064 0.27563277583938733 0.82881098413486542
+-0.48696645046278469 -0.27572854131968005 0.82875656716879031  -0.4869280495724912 -0.2756327758393875 0.82881098413486509
+0.48696645046278492 0.27572854131968011 -0.82875656716879031  0.48692804957249064 0.27563277583938733 -0.82881098413486542
+0.48696645046278469 -0.27572854131968005 -0.82875656716879031  0.4869280495724912 -0.2756327758393875 -0.82881098413486509
+-0.040828298939112564 0 -0.99916617737278246  -0.040944849850879372 -6.9461252307533092e-18 -0.99916140801708753
+-0.48696645046278492 -0.27572854131968011 -0.82875656716879031  -0.48692804957249064 -0.27563277583938733 -0.82881098413486542
+-0.5121997269099976 0.34179011670600551 -0.78792826822967776  -0.5122333584445965 0.34188293456237351 -0.78786613428398444
+-0.78792826822967776 0.5121997269099976 -0.34179011670600551  -0.78786613428398444 0.5122333584445965 -0.34188293456237351
+-0.27572854131968005 0.82875656716879031 -0.48696645046278469  -0.2756327758393875 0.82881098413486509 -0.4869280495724912
+0 0.99916617737278246 -0.040828298939112578  -3.4730626153766554e-18 0.99916140801708753 -0.040944849850879379
+0.34179011670600545 0.78792826822967776 -0.51219972690999771  0.34188293456237318 0.78786613428398489 -0.51223335844459617
+0.78792826822967776 0.51219972690999771 -0.34179011670600545  0.78786613428398389 0.51223335844459639 -0.34188293456237512
+0.80104197563456969 -0.053122466844444549 0.59574101077153174  0.79967159059343529 -0.022528674978358774 0.60001483815109502
+0.51219972690999771 -0.34179011670600545 0.78792826822967776  0.51223335844459583 -0.34188293456237462 0.78786613428398444
+0.27572854131968011 -0.82875656716879031 0.48696645046278492  0.27563277583938511 -0.82881098413486654 0.48692804957249003
+-0.27572854131968005 -0.82875656716879031 0.48696645046278469  -0.2756327758393875 -0.82881098413486509 0.4869280495724912
+0 -0.99916617737278246 -0.040828298939112564  -1.0419187846129966e-17 -0.99916140801708753 -0.040944849850879379
+-0.27572854131968011 -0.82875656716879031 -0.48696645046278492  -0.27563277583938645 -0.82881098413486565 -0.48692804957249075
+0.34179011670600551 -0.78792826822967776 -0.5121997269099976  0.34188293456239371 -0.78786613428398256 -0.51223335844458573
+0.5121997269099976 -0.34179011670600551 -0.78792826822967776  0.5122333584445965 -0.34188293456237351 -0.78786613428398444
+0.52912853141459681 -0.48757002987147363 -0.69320320770179844  0.51449014281491645 -0.48894277869645841 -0.70443938852599164
+0.53310523682898858 -0.48133611427487955 -0.69462568959831961  0.51449014281491423 -0.48894277869646163 -0.70443938852599108
+0.6569399976068282 -0.28335434223766326 -0.69755165300174249  0.64093662140152607 -0.29301330949338966 -0.70946701671475043
+0.82875656716879031 0.48696645046278492 -0.27572854131968011  0.82881098413486565 0.48692804957249081 -0.27563277583938639
+-0.34179011670600545 -0.78792826822967776 -0.51219972690999771  -0.34188293456237351 -0.78786613428398444 -0.51223335844459661
+-0.78792826822967776 -0.51219972690999771 -0.34179011670600545  -0.78786613428398389 -0.51223335844459639 -0.34188293456237512
+-0.82875656716879031 -0.48696645046278492 -0.27572854131968011  -0.82881098413486565 -0.48692804957249081 -0.27563277583938639
+-0.82875656716879031 -0.48696645046278469 0.27572854131968005  -0.82881098413486498 -0.48692804957249114 0.2756327758393875
+-0.78792826822967776 -0.5121997269099976 0.34179011670600551  -0.78786613428398444 -0.5122333584445965 0.34188293456237351
+-0.34179011670600551 -0.78792826822967776 0.5121997269099976  -0.34188293456237351 -0.78786613428398444 0.5122333584445965
+-0.82875656716879031 0.48696645046278469 -0.27572854131968005  -0.82881098413486498 0.48692804957249114 -0.2756327758393875
+-0.99916617737278246 0.040828298939112578 0  -0.99916140801708753 0.040944849850879379 -3.4730626153766554e-18
+0.82188503772742805 0.55513243511369992 0.12315882465233803  0.83034168959696508 0.54729298896534218 0.10489548487251191
+0.15490162002342259 0.32578454432242576 0.93266817185682316  0.15536789040624846 0.32579804135609525 0.93258589678337089
+-6.5652635294160463e-18 0.77991607152390563 0.62588411178006298  -1.9440969464970338e-05 0.78016657033104042 0.62557183613071188
+0.893825128737608 0.21405999957086963 0.39229183849441451  0.89197584375894634 0.22324532177533643 0.39311654818379543
+-0.31802330015895514 0.58336686281126149 0.74735820322637392  -0.31837608818572194 0.58341134180693455 0.74717325482286201
+-6.5571195165482265e-18 0.73132225045616739 0.68203208574650398  -0.00040939357642421546 0.73148465290216658 0.68185778206712322
+-0.19654920871264409 0.26534356265230635 0.94390741193901806  -0.19675522852410679 0.26500379747184388 0.94395993949633716
+-0.25063608611031912 0.57642063043274483 0.7777665518334006  -0.25072811471624851 0.57677917521734889 0.77747102552212866
+0.19654920871264411 0.2653435626523063 0.94390741193901806  0.19678668467347618 0.26502323844130948 0.94394792431643315
+-0.15490162002342261 0.32578454432242587 0.93266817185682316  -0.15536789040624827 0.32579804135609508 0.932585896783371
+-0.19654920871264411 0.2653435626523063 -0.94390741193901806  -0.19678668467347618 0.26502323844130948 -0.94394792431643315
+0.15490162002342261 0.32578454432242587 -0.93266817185682316  0.15536789040624827 0.32579804135609508 -0.932585896783371
+-0.31802330015895514 0.58336686281126149 -0.74735820322637392  -0.31838810336562612 0.58337988565756571 -0.74719269579232694
+-0.15490162002342259 0.32578454432242576 -0.93266817185682316  -0.15536789040624846 0.32579804135609525 -0.93258589678337089
+6.5652635294160463e-18 0.77991607152390563 -0.62588411178006298  1.9440969464970338e-05 0.78016657033104042 -0.62557183613071188
+-0.25063608611031912 0.57642063043274483 -0.7777665518334006  -0.25072811471624767 0.57677917521734945 -0.77747102552212866
+0.31802330015895514 0.58336686281126149 -0.74735820322637392  0.31837608818572194 0.58341134180693455 -0.74717325482286201
+6.5571195165482265e-18 0.73132225045616739 -0.68203208574650398  0.00040939357642421546 0.73148465290216658 -0.68185778206712322
+0.19654920871264409 0.26534356265230635 -0.94390741193901806  0.19675522852410679 0.26500379747184388 -0.94395993949633716
+0.25063608611031912 0.57642063043274483 -0.7777665518334006  0.25072811471624851 0.57677917521734889 -0.77747102552212866
+0.65068017874670403 -0.29325931385704512 -0.69911600851089584  0.6409366214015273 -0.29301330949338833 -0.70946701671474988
+0.28617291708332143 -0.87638371280443894 -0.38483791504434911  0.29603762580284088 -0.87653155169613006 -0.37954467851649776
+0.29057971437418995 -0.86959234854368261 -0.39708487175152679  0.29603762580284343 -0.87653155169612973 -0.37954467851649676
+0.59214384399202546 -0.3881595429818786 0.70538094374692573  0.58682250543788184 -0.37119418317776848 0.71962089011270136
+0.58303192413334481 -0.40257317574481138 0.70495163176324016  0.56575106816925003 -0.4040074490177426 0.71882105562061049
+0.63268818151834738 -0.32335420881895094 0.70294074606773105  0.62602060935196313 -0.30459772848493116 0.7178568244910799
+0.66689476317101137 -0.26866388572512034 0.69462568959831961  0.64422625268360367 -0.27076651461112533 0.71530275402698185
+0.62443505191569892 -0.33636614204180326 0.70422028778974766  0.60701252203429068 -0.33806887798060109 0.71919763058182229
+0.5493198212532957 -0.45674068614295493 0.69911600851089584  0.5435262718016699 -0.43623030388675926 0.71713479474380748
+0.54306000239317154 -0.46664565776233696 0.69755165300174249  0.52046695699576939 -0.46800238770905855 0.71420439075532438
+0.49982529754025784 0.14730961092137676 0.85311732979922927  0.51152737254408287 0.17406896607441888 0.84145097432228932
+0.50787822903712998 -0.52299793234814529 0.68413337702600852  0.5283858120552043 -0.4977299270657245 0.68780328097640742
+-0.19654920871264409 -0.26534356265230635 -0.94390741193901806  -0.19675522852410679 -0.26500379747184388 -0.94395993949633716
+-0.25063608611031912 -0.57642063043274483 -0.7777665518334006  -0.25072811471624851 -0.57677917521734889 -0.77747102552212866
+-0.94390741193901806 0.19654920871264411 -0.2653435626523063  -0.94394792431643315 0.19678668467347618 -0.26502323844130948
+-0.93266817185682316 -0.15490162002342261 -0.32578454432242587  -0.932585896783371 -0.15536789040624827 -0.32579804135609508
+-0.62588411178006298 6.5652635294160463e-18 0.77991607152390563  -0.62557183613071199 1.9440969466552267e-05 0.78016657033104053
+-0.77776655183340049 -0.25063608611031907 0.57642063043274483  -0.77747102552212888 -0.25072811471624795 0.576779175217349
+-0.58336686281126149 0.74735820322637392 0.31802330015895514  -0.58341134180693488 0.74717325482286223 0.31837608818572077
+-0.73132225045616739 0.68203208574650398 6.5571195165482265e-18  -0.73148465290216658 0.68185778206712322 0.00040939357642421893
+-0.19654920871264411 -0.2653435626523063 0.94390741193901806  -0.19678668467347618 -0.26502323844130948 0.94394792431643315
+0.15490162002342261 -0.32578454432242587 0.93266817185682316  0.15536789040624827 -0.32579804135609508 0.932585896783371
+0.401514802275725 -0.69274920908571369 0.59888293763788769  0.39881277493422562 -0.66927944610492407 0.62690780308650529
+0.68203208574650398 -6.5571195165482265e-18 0.73132225045616739  0.68185778206712322 -0.00040939357642421546 0.73148465290216658
+0.62588411178006298 -6.5652635294160463e-18 0.77991607152390563  0.62557183613071199 -1.9440969466552267e-05 0.78016657033104053
+0.90157505838463314 0.24184951424973419 0.35660859546245843  0.8986223830402249 0.24555619785561711 0.36356562872994519
+0.77991607152390563 0.62588411178006298 -6.5652635294160463e-18  0.78016657033104053 0.62557183613071199 -1.9440969466552267e-05
+0.8104943439581207 0.5727813550993911 0.11695476797072311  0.80855713981693988 0.57905836064065308 0.104531175365098
+0.78429103445404746 0.6100181237981781 0.10563529941394456  0.78585236795604285 0.60955597917046411 0.10429556095739166
+0.32578454432242576 0.93266817185682316 0.15490162002342259  0.32579804135609525 0.93258589678337089 0.15536789040624846
+-0.2653435626523063 0.94390741193901806 -0.19654920871264411  -0.26502323844130948 0.94394792431643315 -0.19678668467347618
+-0.32578454432242587 0.93266817185682316 0.15490162002342261  -0.32579804135609508 0.932585896783371 0.15536789040624827
+-0.26534356265230635 0.94390741193901806 0.19654920871264409  -0.26500379747184388 0.94395993949633716 0.19675522852410679
+-0.57642063043274472 0.77776655183340049 0.25063608611031907  -0.57677917521734889 0.77747102552212877 0.25072811471624851
+-0.94390741193901806 0.19654920871264409 0.26534356265230635  -0.94395993949633716 0.19675522852410679 0.26500379747184388
+-0.77776655183340049 0.25063608611031907 0.57642063043274472  -0.77747102552212877 0.25072811471624851 0.57677917521734889
+-0.74735820322637392 0.31802330015895514 0.58336686281126149  -0.74717325482286223 0.31837608818572077 0.58341134180693488
+-0.68203208574650398 6.5571195165482265e-18 0.73132225045616739  -0.68185778206712322 0.00040939357642421546 0.73148465290216658
+-0.31802330015895514 -0.58336686281126149 0.74735820322637392  -0.31838810336562573 -0.58337988565756493 0.74719269579232772
+-0.15490162002342259 -0.32578454432242576 0.93266817185682316  -0.15536789040624846 -0.32579804135609525 0.93258589678337089
+0.74735820322637392 0.31802330015895514 -0.58336686281126149  0.74717325482286223 0.31837608818572077 -0.58341134180693488
+0.68203208574650398 6.5571195165482265e-18 -0.73132225045616739  0.68185778206712322 0.00040939357642421546 -0.73148465290216658
+0.31802330015895514 -0.58336686281126149 -0.74735820322637392  0.31838810336562573 -0.58337988565756493 -0.74719269579232772
+0.15490162002342259 -0.32578454432242576 -0.93266817185682316  0.15536789040624846 -0.32579804135609525 -0.93258589678337089
+0.19654920871264411 -0.2653435626523063 -0.94390741193901806  0.19678668467347618 -0.26502323844130948 -0.94394792431643315
+-0.15490162002342261 -0.32578454432242587 -0.93266817185682316  -0.15536789040624827 -0.32579804135609508 -0.932585896783371
+-0.74735820322637392 -0.31802330015895514 -0.58336686281126149  -0.74717325482286223 -0.31837608818572077 -0.58341134180693488
+-0.68203208574650398 -6.5571195165482265e-18 -0.73132225045616739  -0.68185778206712322 -0.00040939357642421546 -0.73148465290216658
+-0.62588411178006298 -6.5652635294160463e-18 -0.77991607152390563  -0.62557183613071199 -1.9440969466552267e-05 -0.78016657033104053
+-0.77776655183340049 0.25063608611031907 -0.57642063043274483  -0.77747102552212888 0.25072811471624795 -0.576779175217349
+-0.77991607152390563 0.62588411178006298 6.5652635294160463e-18  -0.78016657033104053 0.62557183613071199 1.9440969464970338e-05
+-0.57642063043274472 0.77776655183340049 -0.25063608611031907  -0.57677917521734845 0.77747102552212921 -0.25072811471624817
+-0.58336686281126149 0.74735820322637392 -0.31802330015895514  -0.58337988565756416 0.74719269579232839 -0.31838810336562562
+-0.32578454432242576 0.93266817185682316 -0.15490162002342259  -0.32579804135609525 0.93258589678337089 -0.15536789040624846
+0.2653435626523063 0.94390741193901806 0.19654920871264411  0.26502323844130948 0.94394792431643315 0.19678668467347618
+0.32578454432242587 0.93266817185682316 -0.15490162002342261  0.32579804135609508 0.932585896783371 -0.15536789040624827
+0.26534356265230635 0.94390741193901806 -0.19654920871264409  0.26500379747184388 0.94395993949633716 -0.19675522852410679
+0.57642063043274472 0.77776655183340049 -0.25063608611031907  0.57677917521734889 0.77747102552212877 -0.25072811471624851
+0.94390741193901806 0.19654920871264409 -0.26534356265230635  0.94395993949633672 0.19675522852410773 -0.26500379747184438
+0.77776655183340049 0.25063608611031907 -0.57642063043274472  0.77747102552212877 0.25072811471624851 -0.57677917521734889
+0.40036321981550405 -0.6946524719094237 0.59753024518837061  0.36887582764815346 -0.69486688193515034 0.61732539245248252
+0.82493587926686529 -0.015775204470230869 0.56417193374348917  0.8279301584881833 -0.029879307227409672 0.56003471291103168
+0.19654920871264409 -0.26534356265230635 0.94390741193901806  0.19675522852410679 -0.26500379747184388 0.94395993949633716
+0.25063608611031912 -0.57642063043274483 0.7777665518334006  0.25072811471624851 -0.57677917521734889 0.77747102552212866
+0.31802330015895514 -0.58336686281126149 0.74735820322637392  0.31837608818572194 -0.58341134180693455 0.74717325482286201
+6.5571195165482265e-18 -0.73132225045616739 0.68203208574650398  0.00040939357642421546 -0.73148465290216658 0.68185778206712322
+-0.58336686281126149 -0.74735820322637392 0.31802330015895514  -0.58337988565756493 -0.74719269579232772 0.31838810336562573
+-0.32578454432242576 -0.93266817185682316 0.15490162002342259  -0.32579804135609525 -0.93258589678337089 0.15536789040624846
+-0.2653435626523063 -0.94390741193901806 0.19654920871264411  -0.26502323844130948 -0.94394792431643315 0.19678668467347618
+-0.32578454432242587 -0.93266817185682316 -0.15490162002342261  -0.32579804135609508 -0.932585896783371 -0.15536789040624827
+-0.31802330015895514 -0.58336686281126149 -0.74735820322637392  -0.31837608818572194 -0.58341134180693455 -0.74717325482286201
+-6.5571195165482265e-18 -0.73132225045616739 -0.68203208574650398  -0.00040939357642421546 -0.73148465290216658 -0.68185778206712322
+-6.5652635294160463e-18 -0.77991607152390563 -0.62588411178006298  -1.9440969466552264e-05 -0.78016657033104042 -0.62557183613071199
+0.25063608611031907 -0.57642063043274483 -0.77776655183340049  0.25072811471624795 -0.576779175217349 -0.77747102552212888
+0.62588411178006298 6.5652635294160463e-18 -0.77991607152390563  0.62557183613071199 1.9440969466552267e-05 -0.78016657033104053
+0.34288899659372707 -0.78713443636827329 0.51257565524045945  0.37394295240635489 -0.76556189758092696 0.52352807882472641
+0.83482598411320952 6.1457978060812172e-19 0.54975734503310147  0.83512821922583758 -1.3620570859839113e-15 0.55005532217467101
+0.89270251295960135 0.092787072853812713 0.43974499787970978  0.8911436096358254 0.10776065380062258 0.44073882118290203
+0.94390741193901806 0.19654920871264411 0.2653435626523063  0.94394792431643249 0.19678668467347774 0.26502323844131048
+0.91382708291667858 0.12638371280443894 0.38483791504434894  0.91004478602604755 0.14997570917340425 0.38642693240086129
+0.27461092234606033 -0.8964430577690583 0.34753041451074085  0.30595468057201475 -0.8805901343329211 0.36187394041517323
+0.93241910595001631 0.15597288936521894 0.32585692434233732  0.92464256115119581 0.19278508535824121 0.32843575470885145
+0.58336686281126149 0.74735820322637392 -0.31802330015895514  0.58341134180693488 0.74717325482286223 -0.31837608818572077
+0.73132225045616739 0.68203208574650398 -6.5571195165482265e-18  0.73148465290216658 0.68185778206712322 -0.00040939357642421893
+-0.26534356265230635 -0.94390741193901806 -0.19654920871264409  -0.26500379747184388 -0.94395993949633716 -0.19675522852410679
+-0.57642063043274472 -0.77776655183340049 -0.25063608611031907  -0.57677917521734889 -0.77747102552212877 -0.25072811471624851
+-0.94390741193901806 -0.19654920871264409 -0.26534356265230635  -0.94395993949633716 -0.19675522852410679 -0.26500379747184388
+-0.77776655183340049 -0.25063608611031907 -0.57642063043274472  -0.77747102552212877 -0.25072811471624851 -0.57677917521734889
+-0.58336686281126149 -0.74735820322637392 -0.31802330015895514  -0.58341134180693488 -0.74717325482286223 -0.31837608818572077
+-0.73132225045616739 -0.68203208574650398 -6.5571195165482265e-18  -0.73148465290216658 -0.68185778206712322 -0.00040939357642421893
+-0.74735820322637392 -0.31802330015895514 0.58336686281126149  -0.74719269579232772 -0.31838810336562573 0.58337988565756493
+-0.93266817185682316 -0.15490162002342259 0.32578454432242576  -0.93258589678337089 -0.15536789040624846 0.32579804135609525
+-0.77991607152390563 -0.62588411178006298 -6.5652635294160463e-18  -0.78016657033104053 -0.62557183613071199 -1.9440969466552267e-05
+-0.57642063043274483 -0.77776655183340049 0.25063608611031907  -0.576779175217349 -0.77747102552212888 0.25072811471624795
+6.5652635294160463e-18 -0.77991607152390563 0.62588411178006298  1.9440969466552264e-05 -0.78016657033104042 0.62557183613071199
+-0.25063608611031907 -0.57642063043274483 0.77776655183340049  -0.25072811471624795 -0.576779175217349 0.77747102552212888
+-0.74735820322637392 0.31802330015895514 -0.58336686281126149  -0.74719269579232772 0.31838810336562573 -0.58337988565756493
+-0.93266817185682316 0.15490162002342259 -0.32578454432242576  -0.93258589678337089 0.15536789040624846 -0.32579804135609525
+-0.94390741193901806 -0.19654920871264411 0.2653435626523063  -0.94394792431643315 -0.19678668467347618 0.26502323844130948
+-0.93266817185682316 0.15490162002342261 0.32578454432242587  -0.932585896783371 0.15536789040624827 0.32579804135609508
+0.11874744154864894 0.56789366986248413 0.81389356246462441  0.12230648174951998 0.58292813064721027 0.803265783550005
+0.68777595190194307 0.71884915497263779 0.093588483842681286  0.68572398718656102 0.72091363611668946 0.10033016823457762
+0.20470147868264915 0.9270588370822882 0.31410064822087247  0.20429513892774459 0.9271359637671639 0.31413755092319934
+0.069986566252294838 0.84380044240886354 0.53207395532465163  0.069789417831815359 0.84400685644856743 0.53177237933772359
+-0.52969979418799107 0.72619883181352496 0.43823895845745114  -0.52986930552536837 0.72592006295091116 0.43849581670457133
+-0.39498488175763657 0.64294043714010041 0.65621226556123025  -0.39536358442943986 0.64279095563231481 0.65613064511909558
+-0.53207395532465163 0.069986566252294838 0.84380044240886354  -0.5317723793377237 0.06978941783181504 0.84400685644856732
+-0.31410064822087258 0.20470147868264921 0.9270588370822882  -0.31413755092319934 0.20429513892774451 0.9271359637671639
+0.20086000526876321 -0.13471491243035441 0.97031291378210283  0.20121590081625387 -0.13450572109592704 0.97026819604229442
+0.20086000526876321 0.13471491243035441 0.97031291378210283  0.20121590081625396 0.13450572109592707 0.97026819604229431
+-0.20086000526876321 -0.13471491243035441 -0.97031291378210283  -0.20121590081625387 -0.13450572109592704 -0.97026819604229442
+-0.20086000526876321 0.13471491243035441 -0.97031291378210283  -0.20121590081625396 0.13450572109592707 -0.97026819604229431
+-0.65621226556123025 0.39498488175763669 -0.64294043714010041  -0.65613064511909558 0.39536358442943997 -0.64279095563231492
+-0.43823895845745109 0.52969979418799096 -0.72619883181352507  -0.43849581670457083 0.52986930552536859 -0.72592006295091127
+-0.20470147868264915 0.9270588370822882 -0.31410064822087247  -0.20429513892774459 0.9271359637671639 -0.31413755092319934
+-0.069986566252294838 0.84380044240886354 -0.53207395532465163  -0.069789417831815359 0.84400685644856743 -0.53177237933772359
+0.52969979418799107 0.72619883181352496 -0.43823895845745114  0.52986930552536837 0.72592006295091116 -0.43849581670457133
+0.39498488175763657 0.64294043714010041 -0.65621226556123025  0.39536358442943986 0.64279095563231481 -0.65613064511909558
+0.53207395532465163 0.069986566252294838 -0.84380044240886354  0.5317723793377237 0.06978941783181504 -0.84400685644856732
+0.31410064822087258 0.20470147868264921 -0.9270588370822882  0.31413755092319934 0.20429513892774451 -0.9271359637671639
+0.069986566252294838 -0.84380044240886354 0.53207395532465163  0.06978941783181504 -0.84400685644856732 0.5317723793377237
+0.20470147868264921 -0.9270588370822882 0.31410064822087258  0.20429513892774726 -0.92713596376716201 0.31413755092320306
+-0.13471491243035441 -0.97031291378210283 -0.20086000526876321  -0.13450572109592746 -0.9702681960422942 -0.20121590081625454
+0.13471491243035441 -0.97031291378210283 -0.20086000526876321  0.13450572109592748 -0.9702681960422942 -0.20121590081625462
+0.39498488175763669 -0.64294043714010041 -0.65621226556123025  0.39536358442944125 -0.64279095563231481 -0.65613064511909491
+0.93208712065408506 0.15549608434201159 0.3269900786062353  0.91789704785097648 0.17153707639041282 0.35782683098098128
+0.94686945971280478 0.17991689161909552 0.26460466631117979  0.95170604908224476 0.15778941565066537 0.26335925358507084
+0.95847935459740885 0.19857068261001021 0.20072208160320931  0.95922670283599698 0.19909668302557901 0.20061067612316646
+0.2389405724498605 -0.95306848001363997 0.18186355091081885  0.23241575440058335 -0.95608513245170412 0.17856129650967195
+0.96740524816676143 0.21237493457549983 0.13494008765512311  0.96126367789070066 0.24008359059386952 0.13539575730279987
+0.70892487408416871 0.69813515078208477 0.093116941936638747  0.71176658290178085 0.69503929178689661 0.1015318390293964
+0.65746189559341328 0.74644278217951743 0.096124922711889452  0.65866036402231731 0.74597391594556262 0.098434961242594501
+-0.53207395532465163 -0.069986566252294838 -0.84380044240886354  -0.53177237933772392 -0.069789417831815234 -0.84400685644856699
+-0.31410064822087258 -0.20470147868264921 -0.9270588370822882  -0.31413755092319934 -0.20429513892774451 -0.9271359637671639
+-0.97031291378210283 0.20086000526876321 0.13471491243035441  -0.9702681960422942 0.20121590081625454 0.1345057210959274
+-0.97031291378210283 0.20086000526876321 -0.13471491243035441  -0.9702681960422942 0.20121590081625457 -0.13450572109592743
+-0.31410064822087247 -0.20470147868264915 0.9270588370822882  -0.31413755092319801 -0.20429513892774376 0.92713596376716445
+-0.53207395532465163 -0.069986566252294838 0.84380044240886354  -0.53177237933772392 -0.069789417831815581 0.8440068564485671
+-0.72619883181352496 0.43823895845745114 0.52969979418799107  -0.72592006295091172 0.43849581670457072 0.52986930552536793
+-0.64294043714010041 0.65621226556123025 0.39498488175763657  -0.64279095563231481 0.65613064511909558 0.39536358442943986
+-0.20086000526876321 0.13471491243035441 0.97031291378210283  -0.20121590081625385 0.13450572109592696 0.97026819604229442
+-0.20086000526876321 -0.13471491243035441 0.97031291378210283  -0.2012159008162539 -0.13450572109592701 0.97026819604229442
+0.43823895845745114 -0.52969979418799107 0.72619883181352496  0.43849581670457077 -0.52986930552536793 0.72592006295091172
+0.97237322050691288 0.22053761901938193 0.067701629511043915  0.97707617250292256 0.20189342879636515 0.067536631067046174
+0.31410064822087252 0.20470147868264915 0.9270588370822882  0.31413755092319801 0.20429513892774373 0.92713596376716445
+0.53207395532465174 0.069986566252294838 0.84380044240886354  0.53177237933772403 0.069789417831815651 0.84400685644856688
+0.9270588370822882 0.31410064822087252 0.20470147868264915  0.9271359637671639 0.31413755092319934 0.20429513892774454
+0.84380044240886332 0.53207395532465163 0.069986566252294824  0.84400685644856699 0.53177237933772403 0.069789417831815609
+0.62688758712066828 0.77156308049914157 0.10155294642477933  0.63168040245028012 0.76918721291849756 0.096596587118418148
+0.33295004022963903 0.90494753379947435 0.26218372058148826  0.33340690397517875 0.90406837259895811 0.26739523938910625
+0.13471491243035441 0.97031291378210283 -0.20086000526876321  0.1345057210959274 0.9702681960422942 -0.20121590081625454
+-0.13471491243035441 0.97031291378210283 -0.20086000526876321  -0.13450572109592743 0.9702681960422942 -0.20121590081625457
+-0.069986566252294838 0.84380044240886354 0.53207395532465163  -0.069789417831814429 0.84400685644856788 0.53177237933772281
+-0.20470147868264923 0.9270588370822882 0.31410064822087264  -0.2042951389277447 0.9271359637671639 0.31413755092319923
+-0.84380044240886354 0.53207395532465163 0.069986566252294838  -0.84400685644856788 0.53177237933772281 0.069789417831814443
+-0.9270588370822882 0.31410064822087264 0.20470147868264923  -0.92713596376716423 0.31413755092319934 0.20429513892774315
+-0.43823895845745114 0.52969979418799107 0.72619883181352496  -0.43849581670457133 0.52986930552536837 0.72592006295091116
+-0.65621226556123025 0.39498488175763657 0.64294043714010041  -0.65613064511909558 0.39536358442943986 0.64279095563231481
+-0.65621226556123025 -0.39498488175763669 0.64294043714010041  -0.65613064511909547 -0.39536358442944008 0.64279095563231481
+-0.43823895845745109 -0.52969979418799096 0.72619883181352507  -0.43849581670457094 -0.52986930552536859 0.72592006295091127
+0.43823895845745114 0.52969979418799107 -0.72619883181352496  0.43849581670457133 0.52986930552536837 -0.72592006295091116
+0.65621226556123025 0.39498488175763657 -0.64294043714010041  0.65613064511909558 0.39536358442943986 -0.64279095563231481
+0.22988186145330614 -0.96732927410114633 0.099634331047451258  0.22974865031682642 -0.96813269657427803 0.099672661755434766
+0.43823895845745109 -0.52969979418799096 -0.72619883181352507  0.43849581670457061 -0.52986930552536848 -0.72592006295091149
+0.20086000526876321 0.13471491243035441 -0.97031291378210283  0.20121590081625385 0.13450572109592696 -0.97026819604229442
+0.20086000526876321 -0.13471491243035441 -0.97031291378210283  0.2012159008162539 -0.13450572109592701 -0.97026819604229442
+-0.43823895845745114 -0.52969979418799107 -0.72619883181352496  -0.43849581670457133 -0.52986930552536837 -0.72592006295091116
+-0.65621226556123025 -0.39498488175763657 -0.64294043714010041  -0.65613064511909558 -0.39536358442943986 -0.64279095563231481
+-0.31410064822087252 0.20470147868264915 -0.9270588370822882  -0.31413755092319801 0.20429513892774373 -0.92713596376716445
+-0.53207395532465174 0.069986566252294838 -0.84380044240886354  -0.53177237933772403 0.069789417831815651 -0.84400685644856688
+-0.9270588370822882 0.31410064822087247 -0.20470147868264915  -0.9271359637671639 0.31413755092319928 -0.20429513892774456
+-0.84380044240886354 0.53207395532465163 -0.069986566252294838  -0.84400685644856732 0.53177237933772359 -0.069789417831815345
+-0.39498488175763669 0.64294043714010041 -0.65621226556123025  -0.39536358442943964 0.64279095563231503 -0.65613064511909558
+-0.52969979418799096 0.72619883181352507 -0.43823895845745109  -0.52986930552536859 0.72592006295091127 -0.43849581670457094
+-0.13471491243035441 0.97031291378210283 0.20086000526876321  -0.1345057210959274 0.9702681960422942 0.20121590081625454
+0.13471491243035441 0.97031291378210283 0.20086000526876321  0.13450572109592743 0.9702681960422942 0.20121590081625457
+0.069986566252294838 0.84380044240886354 -0.53207395532465163  0.069789417831814429 0.84400685644856788 -0.53177237933772281
+0.20470147868264923 0.9270588370822882 -0.31410064822087264  0.2042951389277447 0.9271359637671639 -0.31413755092319923
+0.84380044240886354 0.53207395532465163 -0.069986566252294838  0.84400685644856699 0.53177237933772392 -0.069789417831815234
+0.9270588370822882 0.31410064822087258 -0.20470147868264921  0.92713596376716423 0.31413755092319956 -0.20429513892774293
+0.22628605152906522 -0.97313250261608553 0.01853460685588823  0.22857704379632371 -0.97332233192471651 0.019904100732397755
+0.97237322050691288 0.2205376190193819 -0.067701629511043915  0.97707617250292356 0.20189342879636493 -0.067536631067032102
+0.53207395532465163 -0.069986566252294838 0.84380044240886354  0.53177237933772392 -0.069789417831815234 0.84400685644856699
+0.31410064822087258 -0.20470147868264921 0.9270588370822882  0.31413755092319934 -0.20429513892774451 0.9271359637671639
+0.22988186145330608 -0.96732927410114655 -0.09963433104745123  0.22974865031681105 -0.96813269657427992 -0.099672661755452405
+0.39498488175763657 -0.64294043714010041 0.65621226556123025  0.39536358442943098 -0.64279095563231847 0.65613064511909736
+-0.39498488175763669 -0.64294043714010041 0.65621226556123025  -0.39536358442943992 -0.64279095563231492 0.65613064511909558
+-0.52969979418799096 -0.72619883181352507 0.43823895845745109  -0.52986930552536859 -0.72592006295091149 0.43849581670457066
+0.13471491243035441 -0.97031291378210283 0.20086000526876321  0.1345057210959274 -0.9702681960422942 0.20121590081625454
+-0.13471491243035441 -0.97031291378210283 0.20086000526876321  -0.13450572109592743 -0.9702681960422942 0.20121590081625457
+-0.52969979418799107 -0.72619883181352496 -0.43823895845745114  -0.52986930552536837 -0.72592006295091116 -0.43849581670457133
+-0.39498488175763657 -0.64294043714010041 -0.65621226556123025  -0.39536358442943986 -0.64279095563231481 -0.65613064511909558
+0.20470147868264915 -0.9270588370822882 -0.31410064822087252  0.20429513892774667 -0.92713596376716256 -0.31413755092320195
+0.069986566252294838 -0.84380044240886354 -0.53207395532465174  0.069789417831815651 -0.84400685644856688 -0.53177237933772403
+0.31410064822087247 -0.20470147868264915 -0.9270588370822882  0.31413755092319801 -0.20429513892774376 -0.92713596376716445
+0.53207395532465163 -0.069986566252294838 -0.84380044240886354  0.53177237933772392 -0.069789417831815581 -0.8440068564485671
+0.96740524816676143 0.21237493457549977 -0.13494008765512311  0.96126367789070077 0.24008359059386938 -0.13539575730279924
+0.95847935459740874 0.19857068261001024 -0.20072208160320937  0.95922670283599665 0.19909668302557637 -0.20061067612317074
+0.9324191059500162 0.15597288936521903 -0.32585692434233743  0.92464256115119159 0.1927850853582381 -0.32843575470886532
+0.25697201819559901 -0.92432848622760766 -0.28050566540029298  0.23706297888618794 -0.92607252553187147 -0.2935827336486736
+0.84685829520082545 0.019286849148286413 0.53075413092765555  0.84560936423415078 0.027439993872777707 0.53309647331020416
+0.91382708291667858 0.12638371280443889 -0.38483791504434905  0.91004478602604566 0.14997570917340444 -0.38642693240086545
+0.72619883181352496 0.43823895845745114 -0.52969979418799107  0.72592006295091172 0.43849581670457072 -0.52986930552536793
+0.64294043714010041 0.65621226556123025 -0.39498488175763657  0.64279095563231481 0.65613064511909558 -0.39536358442943986
+-0.069986566252294838 -0.84380044240886354 -0.53207395532465163  -0.069789417831815234 -0.84400685644856699 -0.53177237933772392
+-0.20470147868264921 -0.9270588370822882 -0.31410064822087258  -0.20429513892774451 -0.9271359637671639 -0.31413755092319934
+-0.84380044240886354 -0.53207395532465163 -0.069986566252294838  -0.84400685644856732 -0.5317723793377237 -0.06978941783181504
+-0.9270588370822882 -0.31410064822087258 -0.20470147868264921  -0.92713596376716423 -0.31413755092319956 -0.20429513892774293
+-0.72619883181352496 -0.43823895845745114 -0.52969979418799107  -0.72592006295091172 -0.43849581670457072 -0.52986930552536793
+-0.64294043714010041 -0.65621226556123025 -0.39498488175763657  -0.64279095563231481 -0.65613064511909558 -0.39536358442943986
+-0.64294043714010041 -0.65621226556123025 0.39498488175763669  -0.64279095563231492 -0.65613064511909558 0.39536358442943992
+-0.72619883181352507 -0.43823895845745109 0.52969979418799096  -0.72592006295091127 -0.43849581670457083 0.52986930552536859
+-0.9270588370822882 -0.31410064822087247 0.20470147868264915  -0.9271359637671639 -0.31413755092319928 0.20429513892774456
+-0.84380044240886354 -0.53207395532465163 0.069986566252294838  -0.84400685644856699 -0.53177237933772392 0.069789417831815595
+-0.20470147868264915 -0.9270588370822882 0.31410064822087247  -0.20429513892774459 -0.9271359637671639 0.31413755092319934
+-0.069986566252294838 -0.84380044240886354 0.53207395532465163  -0.069789417831815581 -0.8440068564485671 0.53177237933772392
+-0.64294043714010041 0.65621226556123025 -0.39498488175763669  -0.6427909556323147 0.65613064511909536 -0.39536358442944064
+-0.72619883181352507 0.43823895845745109 -0.52969979418799096  -0.72592006295091149 0.43849581670457061 -0.52986930552536848
+-0.97031291378210283 -0.20086000526876321 -0.13471491243035441  -0.9702681960422942 -0.20121590081625454 -0.1345057210959274
+-0.97031291378210283 -0.20086000526876321 0.13471491243035441  -0.9702681960422942 -0.20121590081625457 0.13450572109592743
+0.06507249989019516 0.64943374300381451 0.75762878984770377  0.06551566806219479 0.64992905036579185 0.75716571946238054
+0.14324145828887103 0.44478475305090454 0.88410882140193769  0.14399073917102956 0.44447864693329647 0.88414105178604085
+0.16208565674454739 0.067174638370274917 0.984487586431394  0.16230850425355234 0.067102997401376471 0.98445575684574338
+0.38781114670466377 0.20668066329285001 0.89826812139385281  0.38778432700575033 0.20645471950358354 0.89833165619574706
+-0.1264800315542341 0.61148180127020313 0.78108437977813105  -0.12697533232365865 0.6119448889150485 0.78064122227310373
+0.76032257344343512 0.64081678241520534 0.098941938751961195  0.76207589783372764 0.6391363644711634 0.10365825365836547
+0.74011618472454033 0.66455433327713243 0.095362650095153101  0.73743092048489867 0.66756092552176716 0.10275236361912306
+0.15304821643557709 0.8581878051094145 0.48898817612201739  0.17381774822644128 0.86108611456980322 0.47782642632714362
+-0.14324145828887105 0.44478475305090459 0.88410882140193769  -0.14399073917102873 0.44447864693329692 0.88414105178604063
+-0.06507249989019516 0.64943374300381451 0.75762878984770377  -0.065515668062194402 0.64992905036579007 0.75716571946238209
+0.13950602492257505 0.85675191169903997 0.49650199476975138  0.13935172210219587 0.85685972305470759 0.49635925754816157
+-0.13950602492257505 0.85675191169903997 0.49650199476975149  -0.13935172210219487 0.85685972305470948 0.49635925754815852
+0.037951941733611459 0.37971225316070945 0.92432583806700219  0.037984161450743424 0.37896297887110203 0.92463196144413284
+-0.16669704821929851 0.50619228471494349 0.84615687966832631  -0.16746624198175136 0.50593831119476196 0.84615689033529806
+-0.40176612662410133 0.69466625495449252 0.59667643972673035  -0.40197239864759854 0.69455121880115844 0.59667142984000965
+-0.48798559166164268 0.46894076499437626 0.73618246464930526  -0.48809649929758481 0.46907539604897669 0.73602315194220513
+0.60630413399985716 0.78745552743149316 0.10609528287383588  0.60380229511961403 0.79156802282425032 0.094036448520739543
+-0.037951941733611459 0.37971225316070945 0.92432583806700219  -0.037984161450743445 0.37896297887110203 0.92463196144413295
+-0.38781114670466377 0.20668066329284993 0.89826812139385259  -0.38778432700573318 0.20645471950357089 0.89833165619575739
+-0.16208565674454734 0.067174638370274917 0.984487586431394  -0.16230850425355245 0.067102997401376416 0.98445575684574338
+-0.16669704821929851 0.50619228471494349 -0.84615687966832631  -0.16746624198175133 0.50593831119476196 -0.84615689033529817
+0.037951941733611459 0.37971225316070945 -0.92432583806700219  0.037984161450743445 0.37896297887110203 -0.92463196144413295
+0.38781114670466377 0.20668066329284993 -0.89826812139385259  0.38778432700573318 0.20645471950357089 -0.89833165619575739
+0.16208565674454734 0.067174638370274917 -0.984487586431394  0.16230850425355245 0.067102997401376416 -0.98445575684574338
+-0.06507249989019516 0.64943374300381451 -0.75762878984770377  -0.065515668062193375 0.64992905036579196 -0.75716571946238065
+-0.14324145828887103 0.44478475305090454 -0.88410882140193769  -0.14399073917102864 0.44447864693329692 -0.88414105178604085
+-0.16208565674454739 0.067174638370274917 -0.984487586431394  -0.16230850425355234 0.067102997401376471 -0.98445575684574338
+-0.38781114670466377 0.20668066329285001 -0.89826812139385281  -0.38778432700573329 0.20645471950357264 -0.89833165619575683
+0.1264800315542341 0.61148180127020313 -0.78108437977813105  0.12697533232365898 0.61194488891504895 -0.78064122227310351
+-0.1264800315542341 0.61148180127020313 -0.78108437977813105  -0.12697533232366071 0.61194488891504817 -0.78064122227310373
+-0.48798559166164257 0.46894076499437626 -0.73618246464930537  -0.48809649929758558 0.46907539604897625 -0.73602315194220491
+-0.40176612662410133 0.69466625495449263 -0.59667643972673012  -0.40197239864759909 0.69455121880115767 -0.59667142984001009
+0.14324145828887105 0.44478475305090459 -0.88410882140193769  0.14399073917102881 0.44447864693329647 -0.88414105178604085
+0.065072499890195173 0.64943374300381473 -0.75762878984770365  0.065515668062194887 0.64992905036579063 -0.75716571946238165
+-0.13950602492257505 0.85675191169903997 -0.49650199476975138  -0.13935172210219585 0.85685972305470925 -0.49635925754815879
+0.13950602492257505 0.85675191169903997 -0.49650199476975149  0.13935172210219487 0.85685972305470948 -0.49635925754815852
+-0.037951941733611459 0.37971225316070945 -0.92432583806700219  -0.037984161450743424 0.37896297887110203 -0.92463196144413284
+0.16669704821929851 0.50619228471494349 -0.84615687966832631  0.16746624198175172 0.50593831119476229 -0.84615689033529795
+0.40176612662410133 0.69466625495449252 -0.59667643972673035  0.40197239864759854 0.69455121880115844 -0.59667142984000965
+0.48798559166164268 0.46894076499437626 -0.73618246464930526  0.48809649929758481 0.46907539604897669 -0.73602315194220513
+0.27399725512977041 -0.89741802080743249 -0.34558774394436126  0.30431345936385057 -0.89521176696950899 -0.32555984200963023
+0.27461092234606044 -0.89644305776905853 -0.34753041451074085  0.30595468057192821 -0.88059013433294808 -0.36187394041518095
+0.89270251295960135 0.092787072853812741 -0.43974499787970978  0.89114360963582795 0.10776065380062308 -0.44073882118289653
+0.31682936237190801 -0.8280363774210906 -0.46105412139556579  0.30871603125497732 -0.82882275556679164 -0.46663395922376483
+0.34243159318633287 -0.78789291377908466 -0.51176714118576783  0.37438115159301083 -0.78669229841286881 -0.4908706356564515
+0.34177771381313393 -0.78887113359859207 -0.51061830246204121  0.34181621487256558 -0.80836571705727378 -0.47927710433179627
+0.20668066329284993 -0.89826812139385259 0.38781114670466377  0.20645471950357258 -0.89833165619575706 0.38778432700573306
+0.067174638370274931 -0.98448758643139411 0.16208565674454736  0.067102997401376416 -0.98445575684574338 0.16230850425355242
+0.82493587926686529 -0.015775204470230772 -0.56417193374348928  0.82793015848818063 -0.029879307227409412 -0.56003471291103579
+0.34288899659372696 -0.78713443636827329 -0.51257565524045923  0.37394295240647391 -0.76556189758091031 -0.52352807882466579
+0.067174638370274931 -0.98448758643139411 -0.16208565674454742  0.067102997401376457 -0.98445575684574338 -0.16230850425355231
+0.20668066329284998 -0.89826812139385259 -0.38781114670466371  0.20645471950357255 -0.89833165619575694 -0.38778432700573334
+0.70685918524788072 -0.20468185015976154 -0.67677227421098896  0.71657063832564438 -0.23106145751843249 -0.65813153938938074
+0.71021467390312099 -0.19943478257349526 -0.67476755984413894  0.73148064944407343 -0.19693655197206719 -0.65280322761627774
+0.50468001700647158 -0.52828837108788052 -0.68272481536695295  0.5355740072109787 -0.52649133823230054 -0.66027823950690356
+0.5039242293873103 -0.52945918848859996 -0.68235511400187066  0.51008352708669591 -0.55674863743608982 -0.65562622744049326
+0.70685918524788072 -0.20468185015976154 0.67677227421098896  0.71657063832563017 -0.23106145751843316 0.65813153938939606
+0.74055958467102845 -0.15027494754537984 0.65399889841309089  0.74496666446894622 -0.16330181399315044 0.64680536978024461
+0.71021467390312121 -0.19943478257349531 0.67476755984413883  0.73148064944405822 -0.19693655197206084 0.65280322761629672
+0.50468001700647158 -0.52828837108788052 0.68272481536695295  0.53557400721097814 -0.52649133823230254 0.66027823950690256
+0.75762878984770377 0.06507249989019516 0.64943374300381462  0.75716571946238109 0.065515668062194998 0.64992905036579118
+0.88410882140193769 0.14324145828887103 0.44478475305090454  0.88414105178603863 0.14399073917102936 0.44447864693330108
+0.46796403496887878 -0.58666916470964625 0.66003296952840662  0.48378799724665122 -0.58634540105761646 0.64972936241073254
+0.89826812139385259 0.38781114670466371 0.20668066329284998  0.89833165619575805 0.38778432700573129 0.20645471950357161
+0.037951941733611459 -0.37971225316070945 -0.92432583806700219  0.037984161450743424 -0.37896297887110203 -0.92463196144413284
+-0.16669704821929851 -0.50619228471494349 -0.84615687966832631  -0.16746624198175172 -0.50593831119476229 -0.84615689033529795
+-0.40176612662410133 -0.69466625495449252 -0.59667643972673035  -0.40197239864759893 -0.69455121880115778 -0.5966714298400102
+-0.48798559166164268 -0.46894076499437626 -0.73618246464930526  -0.48809649929758481 -0.46907539604897669 -0.73602315194220513
+-0.84615687966832631 0.16669704821929851 -0.50619228471494349  -0.84615689033529806 0.16746624198175136 -0.50593831119476196
+-0.92432583806700219 -0.037951941733611459 -0.37971225316070945  -0.92463196144413295 -0.037984161450743445 -0.37896297887110203
+-0.89826812139385259 -0.38781114670466377 -0.20668066329284993  -0.89833165619575706 -0.38778432700573306 -0.20645471950357258
+-0.98448758643139411 -0.16208565674454736 -0.067174638370274931  -0.98445575684574338 -0.16230850425355248 -0.067102997401376444
+-0.78108437977813128 0.12648003155423412 0.61148180127020324  -0.78064122227310373 0.1269753323236586 0.61194488891504861
+-0.78108437977813128 -0.1264800315542341 0.61148180127020324  -0.78064122227310373 -0.12697533232366062 0.61194488891504817
+-0.73618246464930537 -0.48798559166164257 0.46894076499437626  -0.73602315194220502 -0.48809649929758558 0.46907539604897625
+-0.59667643972673012 -0.40176612662410133 0.69466625495449263  -0.5966714298400092 -0.40197239864759854 0.69455121880115867
+-0.44478475305090459 0.88410882140193769 0.14324145828887105  -0.44447864693329647 0.88414105178604085 0.14399073917102881
+-0.64943374300381462 0.75762878984770354 0.06507249989019516  -0.64992905036579052 0.75716571946238165 0.065515668062194804
+-0.85675191169903997 0.49650199476975138 -0.13950602492257505  -0.85685972305470925 0.49635925754815879 -0.13935172210219585
+-0.85675191169903997 0.49650199476975149 0.13950602492257505  -0.85685972305470948 0.49635925754815846 0.13935172210219487
+-0.16669704821929851 -0.50619228471494349 0.84615687966832631  -0.16746624198175133 -0.50593831119476196 0.84615689033529817
+0.037951941733611459 -0.37971225316070945 0.92432583806700219  0.037984161450743445 -0.37896297887110203 0.92463196144413295
+0.38781114670466377 -0.20668066329284993 0.89826812139385259  0.38778432700573318 -0.20645471950357089 0.89833165619575739
+0.16208565674454739 -0.067174638370274917 0.984487586431394  0.16230850425355237 -0.06710299740137643 0.98445575684574338
+0.4331208322019765 -0.64210794890239153 0.63136143448574877  0.42807141203226762 -0.64268086340021435 0.63538663349165247
+0.75762878984770377 -0.06507249989019516 0.64943374300381451  0.75716571946238165 -0.06551566806219411 0.64992905036579063
+0.49650199476975138 0.13950602492257505 0.85675191169903997  0.49635925754815763 0.13935172210219912 0.85685972305470937
+0.49650199476975149 -0.13950602492257505 0.85675191169903997  0.49635925754815857 -0.1393517221021949 0.85685972305470948
+0.79934060742300872 -0.055862651692236226 0.5979056290568221  0.79006130932891394 -0.031934562996140711 0.61219548445551919
+-0.96679589706089264 0.15985780358782284 0.19937696972895624  -0.96680424297825784 0.16010344242024357 0.19913925651268632
+-0.99043061207734606 0.040522281668716874 0.13192856911395229  -0.99044963097837846 0.040575895565417609 0.13176921185868209
+-0.9506072962094394 0.27889813733511903 0.13624095340381404  -0.95055095711572857 0.27915487828976127 0.13610816233202497
+0.61148180127020324 0.78108437977813128 -0.12648003155423412  0.61194488891504895 0.7806412222731034 -0.12697533232365887
+-0.9168554803037775 0.39313153246640237 0.069452331980627585  -0.91670068154564377 0.39350124418016624 0.069401954456725687
+-0.94330265629374277 -0.077704403643809677 0.32271058904772337  -0.94351526412634279 -0.077926023088562835 0.32203490693742848
+-0.96471929550963276 0.039734588558411582 0.26026494835742225  -0.96481986879326076 0.039677999129164934 0.25990051397960151
+0.64943374300381451 0.75762878984770365 0.065072499890195146  0.64992905036579174 0.75716571946238054 0.065515668062194499
+0.44478475305090454 0.88410882140193769 0.14324145828887103  0.44447864693329459 0.88414105178604174 0.14399073917102978
+0.067174638370274931 0.98448758643139411 0.16208565674454736  0.067102997401376444 0.98445575684574338 0.16230850425355248
+0.20668066329284998 0.89826812139385259 0.38781114670466371  0.20645471950358563 0.89833165619574651 0.38778432700575044
+-0.50619228471494349 0.84615687966832631 -0.16669704821929851  -0.50593831119476196 0.84615689033529817 -0.16746624198175136
+-0.37971225316070945 0.92432583806700219 0.037951941733611459  -0.37896297887110203 0.92463196144413295 0.037984161450743445
+-0.20668066329284998 0.89826812139385259 0.38781114670466382  -0.20645471950357261 0.89833165619575706 0.38778432700573312
+-0.067174638370274931 0.98448758643139411 0.16208565674454736  -0.067102997401376457 0.98445575684574338 0.16230850425355248
+-0.37971225316070945 0.92432583806700219 -0.037951941733611459  -0.37896297887110203 0.92463196144413284 -0.037984161450743424
+-0.50619228471494349 0.84615687966832631 0.16669704821929851  -0.50593831119476229 0.84615689033529795 0.16746624198175172
+-0.69466625495449252 0.59667643972673035 0.40176612662410133  -0.69455121880115733 0.59667142984001009 0.40197239864759959
+-0.46894076499437626 0.73618246464930526 0.48798559166164268  -0.46907539604897619 0.7360231519422048 0.48809649929758586
+-0.92432583806700219 -0.037951941733611459 0.37971225316070945  -0.92463196144413284 -0.037984161450743424 0.37896297887110203
+-0.84615687966832631 0.16669704821929851 0.50619228471494349  -0.84615689033529806 0.16746624198175136 0.50593831119476196
+-0.59667643972673035 0.40176612662410133 0.69466625495449252  -0.5966714298400102 0.40197239864759848 0.69455121880115789
+-0.73618246464930526 0.48798559166164268 0.46894076499437626  -0.73602315194220391 0.48809649929758597 0.46907539604897747
+-0.88410882140193769 0.14324145828887105 0.44478475305090459  -0.88414105178604074 0.14399073917102875 0.44447864693329697
+-0.75762878984770377 0.06507249989019516 0.64943374300381451  -0.75716571946238209 0.065515668062194402 0.64992905036579007
+-0.49650199476975138 -0.13950602492257505 0.85675191169903997  -0.4963592575481578 -0.13935172210219521 0.85685972305470992
+-0.49650199476975149 0.13950602492257505 0.85675191169903997  -0.49635925754815857 0.1393517221021949 0.85685972305470948
+-0.06507249989019516 -0.64943374300381462 0.75762878984770377  -0.065515668062193153 -0.64992905036579229 0.7571657194623802
+-0.14324145828887103 -0.44478475305090454 0.88410882140193769  -0.14399073917102864 -0.44447864693329692 0.88414105178604085
+-0.16208565674454734 -0.067174638370274917 0.984487586431394  -0.16230850425355239 -0.06710299740137643 0.98445575684574338
+-0.38781114670466377 -0.20668066329285001 0.89826812139385281  -0.38778432700573318 -0.20645471950357308 0.89833165619575683
+0.88410882140193769 0.14324145828887105 -0.44478475305090459  0.88414105178604063 0.14399073917102884 -0.44447864693329697
+0.75762878984770377 0.06507249989019516 -0.64943374300381451  0.75716571946238209 0.065515668062194402 -0.64992905036579007
+0.49650199476975138 -0.13950602492257505 -0.85675191169903997  0.4963592575481578 -0.13935172210219521 -0.85685972305470992
+0.49650199476975149 0.13950602492257505 -0.85675191169903997  0.49635925754815857 0.1393517221021949 -0.85685972305470948
+0.06507249989019516 -0.64943374300381462 -0.75762878984770377  0.065515668062193153 -0.64992905036579229 -0.7571657194623802
+0.14324145828887103 -0.44478475305090454 -0.88410882140193769  0.14399073917102864 -0.44447864693329692 -0.88414105178604085
+0.16208565674454734 -0.067174638370274917 -0.984487586431394  0.16230850425355239 -0.06710299740137643 -0.98445575684574338
+0.38781114670466377 -0.20668066329285001 -0.89826812139385281  0.38778432700573318 -0.20645471950357308 -0.89833165619575683
+0.16669704821929851 -0.50619228471494349 -0.84615687966832631  0.16746624198175133 -0.50593831119476196 -0.84615689033529817
+-0.037951941733611459 -0.37971225316070945 -0.92432583806700219  -0.037984161450743445 -0.37896297887110203 -0.92463196144413295
+-0.38781114670466377 -0.20668066329284993 -0.89826812139385259  -0.38778432700573318 -0.20645471950357089 -0.89833165619575739
+-0.16208565674454739 -0.067174638370274917 -0.984487586431394  -0.16230850425355237 -0.06710299740137643 -0.98445575684574338
+-0.88410882140193769 -0.14324145828887105 -0.44478475305090459  -0.88414105178604074 -0.14399073917102875 -0.44447864693329697
+-0.75762878984770377 -0.06507249989019516 -0.64943374300381451  -0.75716571946238209 -0.065515668062194402 -0.64992905036579007
+-0.49650199476975138 0.13950602492257505 -0.85675191169903997  -0.49635925754815741 0.1393517221021954 -0.85685972305471014
+-0.49650199476975149 -0.13950602492257505 -0.85675191169903997  -0.49635925754815857 -0.1393517221021949 -0.85685972305470948
+-0.78108437977813128 -0.12648003155423412 -0.61148180127020324  -0.78064122227310373 -0.1269753323236586 -0.61194488891504861
+-0.78108437977813128 0.1264800315542341 -0.61148180127020324  -0.78064122227310373 0.12697533232366118 -0.61194488891504806
+-0.73618246464930537 0.48798559166164257 -0.46894076499437626  -0.73602315194220502 0.48809649929758558 -0.46907539604897625
+-0.59667643972673012 0.40176612662410133 -0.69466625495449263  -0.59667142984000909 0.40197239864759921 -0.69455121880115833
+-0.61148180127020324 0.78108437977813128 0.12648003155423412  -0.61194488891504895 0.7806412222731034 0.12697533232365887
+-0.61148180127020324 0.78108437977813128 -0.1264800315542341  -0.61194488891504806 0.78064122227310373 -0.12697533232366118
+-0.46894076499437626 0.73618246464930537 -0.48798559166164257  -0.46907539604897724 0.7360231519422048 -0.48809649929758492
+-0.69466625495449263 0.59667643972673012 -0.40176612662410133  -0.694551218801158 0.59667142984000887 -0.40197239864760032
+-0.64943374300381451 0.75762878984770377 -0.06507249989019516  -0.64992905036579229 0.75716571946238032 -0.065515668062193097
+-0.44478475305090454 0.88410882140193769 -0.14324145828887103  -0.44447864693329692 0.88414105178604085 -0.14399073917102864
+-0.067174638370274931 0.98448758643139411 -0.16208565674454736  -0.067102997401376444 0.98445575684574338 -0.16230850425355248
+-0.20668066329284998 0.89826812139385259 -0.38781114670466371  -0.20645471950357303 0.89833165619575694 -0.38778432700573312
+-0.8962672300889245 -0.071858277492354974 0.43765447584202588  -0.89666746009116993 -0.072917516439698196 0.4366583353262784
+0.37971225316070945 0.92432583806700219 -0.037951941733611459  0.37896297887110203 0.92463196144413295 -0.037984161450743445
+0.20668066329284998 0.89826812139385259 -0.38781114670466382  0.20645471950357261 0.89833165619575706 -0.38778432700573312
+0.067174638370274931 0.98448758643139411 -0.16208565674454736  0.067102997401376457 0.98445575684574338 -0.16230850425355248
+0.37971225316070945 0.92432583806700219 0.037951941733611459  0.37896297887110203 0.92463196144413284 0.037984161450743424
+0.50619228471494349 0.84615687966832631 -0.16669704821929851  0.50593831119476229 0.84615689033529795 -0.16746624198175172
+0.69466625495449252 0.59667643972673035 -0.40176612662410133  0.69455121880115822 0.59667142984000943 -0.40197239864759909
+0.46894076499437626 0.73618246464930526 -0.48798559166164268  0.46907539604897619 0.7360231519422048 -0.48809649929758586
+0.7956418656744515 -0.062099421877685829 0.60211592452938856  0.77995892884278373 -0.0636434458986644 0.62258620376021934
+0.84615687966832631 0.16669704821929851 -0.50619228471494349  0.84615689033529806 0.16746624198175136 -0.50593831119476196
+0.59667643972673035 0.40176612662410133 -0.69466625495449252  0.5966714298400102 0.40197239864759848 -0.69455121880115789
+0.73618246464930526 0.48798559166164268 -0.46894076499437626  0.7360231519422048 0.48809649929758586 -0.46907539604897613
+0.45467325858997609 -0.60749293870920384 0.65018159643527607  0.45629539576528944 -0.61497179190323881 0.64312067838526032
+0.23894057244986044 -0.95306848001363997 -0.18186355091081888  0.23241575440058948 -0.95608513245170468 -0.1785612965096614
+0.39895802436543049 -0.69687753315555545 0.59574101077153174  0.3711941831777546 -0.71962089011270503 0.58682250543788594
+0.80588150441467499 -0.045732053728024698 0.58956860097969011  0.8103609401492794 -0.030667519535216053 0.58512789193981596
+-0.037951941733611459 -0.37971225316070945 0.92432583806700219  -0.037984161450743424 -0.37896297887110203 0.92463196144413284
+0.16669704821929851 -0.50619228471494349 0.84615687966832631  0.16746624198175172 -0.50593831119476229 0.84615689033529795
+0.36998650939197836 -0.74269333684247552 0.55678551944213661  0.37302523877669347 -0.74314518846920541 0.5555064356878866
+0.48798559166164268 -0.46894076499437626 0.73618246464930526  0.48809649929758531 -0.46907539604897708 0.73602315194220469
+0.14324145828887105 -0.44478475305090459 0.88410882140193769  0.14399073917102881 -0.44447864693329647 0.88414105178604085
+0.065072499890195173 -0.64943374300381473 0.75762878984770365  0.065515668062194887 -0.64992905036579063 0.75716571946238165
+-0.13950602492257505 -0.85675191169903997 0.49650199476975138  -0.13935172210219521 -0.85685972305470992 0.4963592575481578
+0.13950602492257505 -0.85675191169903997 0.49650199476975149  0.13935172210219487 -0.85685972305470948 0.49635925754815852
+-0.64943374300381451 -0.75762878984770365 0.065072499890195146  -0.64992905036579229 -0.75716571946238032 0.065515668062193111
+-0.44478475305090454 -0.88410882140193769 0.14324145828887103  -0.44447864693329692 -0.88414105178604085 0.14399073917102864
+-0.067174638370274931 -0.98448758643139411 0.16208565674454736  -0.06710299740137643 -0.98445575684574338 0.16230850425355237
+-0.20668066329284998 -0.89826812139385259 0.38781114670466371  -0.20645471950357303 -0.89833165619575694 0.38778432700573312
+-0.50619228471494349 -0.84615687966832631 0.16669704821929851  -0.50593831119476196 -0.84615689033529817 0.16746624198175136
+-0.37971225316070945 -0.92432583806700219 -0.037951941733611459  -0.37896297887110203 -0.92463196144413295 -0.037984161450743445
+-0.20668066329284993 -0.89826812139385259 -0.38781114670466377  -0.20645471950357258 -0.89833165619575706 -0.38778432700573306
+-0.067174638370274931 -0.98448758643139411 -0.16208565674454742  -0.067102997401376444 -0.98445575684574338 -0.16230850425355237
+-0.14324145828887105 -0.44478475305090459 -0.88410882140193769  -0.14399073917102881 -0.44447864693329647 -0.88414105178604085
+-0.065072499890195173 -0.64943374300381473 -0.75762878984770365  -0.065515668062194887 -0.64992905036579063 -0.75716571946238165
+0.13950602492257505 -0.85675191169903997 -0.49650199476975138  0.1393517221021954 -0.85685972305471014 -0.49635925754815741
+-0.13950602492257505 -0.85675191169903997 -0.49650199476975149  -0.13935172210219487 -0.85685972305470948 -0.49635925754815852
+-0.1264800315542341 -0.61148180127020313 -0.78108437977813105  -0.12697533232365898 -0.61194488891504895 -0.78064122227310351
+0.1264800315542341 -0.61148180127020313 -0.78108437977813105  0.12697533232366126 -0.61194488891504806 -0.78064122227310373
+0.48798559166164257 -0.46894076499437626 -0.73618246464930537  0.48809649929758553 -0.46907539604897625 -0.73602315194220491
+0.87006466098054647 0.056547496445093395 0.48863305375424759  0.8690820938250331 0.066959188365444275 0.49011506943383953
+0.78108437977813128 0.12648003155423412 -0.61148180127020324  0.78064122227310373 0.1269753323236586 -0.61194488891504861
+0.88525794997176432 0.0810906962302608 0.4567171564832469  0.88043888279482108 0.087790975218743975 0.4659614987669573
+0.34243159318633287 -0.78789291377908466 0.51176714118576805  0.37438115159292812 -0.78669229841287636 0.4908706356565023
+0.34177771381313388 -0.78887113359859229 0.51061830246204121  0.34181621487243674 -0.80836571705727855 0.47927710433188003
+0.75762878984770377 -0.06507249989019516 -0.64943374300381462  0.75716571946238087 -0.065515668062193555 -0.64992905036579174
+0.31682936237190812 -0.8280363774210906 0.46105412139556601  0.30871603125497998 -0.82882275556678786 0.46663395922376977
+0.9094202856258099 0.11959234854368264 0.39708487175152674  0.90100988165586193 0.12889639121159815 0.41420636582640341
+0.27399725512977041 -0.89741802080743227 0.34558774394436154  0.30431345936390647 -0.89521176696948712 0.32555984200963828
+-0.83986385056568236 -0.054857140713616914 0.54001796879892028  -0.83909253130010442 -0.056307189018219773 0.54106674669697596
+0.27219661039719134 -0.89987434907152952 0.34005641981910195  0.27087574504912154 -0.91136373772562251 0.30990719304796066
+0.96559982489567697 0.20947750201587079 0.15035899655759488  0.96089435748012486 0.2198288169025045 0.16839633316109695
+0.24336599009814622 -0.94602936533555493 0.21094260961626568  0.23388566130185726 -0.94764280563006065 0.21741805439056802
+0.96947353031104511 0.21592607882051257 0.10986054425367309  0.96991439832022719 0.2213218831876424 0.10140356972704373
+0.97351999728657068 0.22241808576487493 0.034988854233130445  0.97444445519668965 0.22205052462856237 0.033934764602200893
+0.89826812139385259 0.38781114670466377 -0.20668066329284993  0.89833165619575706 0.38778432700573306 -0.20645471950357258
+0.22743420727478347 -0.97114863140943242 0.060907607905721757  0.22895713509378088 -0.9715862185724935 0.059990417315193827
+0.44478475305090459 0.88410882140193769 -0.14324145828887105  0.44447864693329647 0.88414105178604085 -0.14399073917102881
+0.64943374300381462 0.75762878984770354 -0.06507249989019516  0.64992905036579052 0.75716571946238165 -0.065515668062194804
+0.85675191169903997 0.49650199476975138 0.13950602492257505  0.85685972305469982 0.49635925754815302 0.13935172210227365
+0.85675191169903997 0.49650199476975149 -0.13950602492257505  0.85685972305470948 0.49635925754815846 -0.13935172210219487
+-0.37971225316070945 -0.92432583806700219 0.037951941733611459  -0.37896297887110203 -0.92463196144413284 0.037984161450743424
+-0.50619228471494349 -0.84615687966832631 -0.16669704821929851  -0.50593831119476229 -0.84615689033529795 -0.16746624198175172
+-0.69466625495449252 -0.59667643972673035 -0.40176612662410133  -0.69455121880115822 -0.59667142984000943 -0.40197239864759909
+-0.46894076499437626 -0.73618246464930526 -0.48798559166164268  -0.46907539604897691 -0.7360231519422048 -0.4880964992975852
+-0.92432583806700219 0.037951941733611459 -0.37971225316070945  -0.92463196144413284 0.037984161450743424 -0.37896297887110203
+-0.84615687966832631 -0.16669704821929851 -0.50619228471494349  -0.84615689033529806 -0.16746624198175136 -0.50593831119476196
+-0.59667643972673035 -0.40176612662410133 -0.69466625495449252  -0.5966714298400102 -0.40197239864759848 -0.69455121880115789
+-0.73618246464930526 -0.48798559166164268 -0.46894076499437626  -0.7360231519422048 -0.48809649929758586 -0.46907539604897613
+-0.44478475305090459 -0.88410882140193769 -0.14324145828887105  -0.44447864693329647 -0.88414105178604085 -0.14399073917102881
+-0.64943374300381462 -0.75762878984770354 -0.06507249989019516  -0.64992905036579052 -0.75716571946238165 -0.065515668062194804
+-0.85675191169903997 -0.49650199476975138 0.13950602492257505  -0.85685972305470992 -0.4963592575481578 0.13935172210219521
+-0.85675191169903997 -0.49650199476975149 -0.13950602492257505  -0.85685972305470948 -0.49635925754815846 -0.13935172210219487
+-0.75762878984770377 -0.06507249989019516 0.64943374300381462  -0.75716571946238065 -0.06551566806219343 0.64992905036579196
+-0.88410882140193769 -0.14324145828887103 0.44478475305090454  -0.88414105178604085 -0.14399073917102864 0.44447864693329692
+-0.98448758643139411 -0.16208565674454736 0.067174638370274931  -0.98445575684574338 -0.16230850425355248 0.067102997401376444
+-0.89826812139385259 -0.38781114670466371 0.20668066329284998  -0.89833165619575717 -0.38778432700573329 0.20645471950357211
+-0.61148180127020324 -0.78108437977813128 -0.12648003155423412  -0.61194488891504895 -0.7806412222731034 -0.12697533232365887
+-0.61148180127020324 -0.78108437977813128 0.1264800315542341  -0.61194488891504806 -0.78064122227310373 0.12697533232366118
+-0.46894076499437626 -0.73618246464930537 0.48798559166164257  -0.46907539604897752 -0.73602315194220436 0.48809649929758531
+-0.69466625495449263 -0.59667643972673012 0.40176612662410133  -0.694551218801158 -0.59667142984000887 0.40197239864760032
+0.1264800315542341 -0.61148180127020313 0.78108437977813105  0.12697533232365898 -0.61194488891504895 0.78064122227310351
+-0.1264800315542341 -0.61148180127020313 0.78108437977813105  -0.12697533232366126 -0.61194488891504806 0.78064122227310373
+-0.48798559166164257 -0.46894076499437626 0.73618246464930537  -0.4880964992975852 -0.46907539604897597 0.73602315194220536
+-0.40176612662410133 -0.69466625495449263 0.59667643972673012  -0.4019723986475997 -0.69455121880115744 0.59667142984000987
+-0.75762878984770377 0.06507249989019516 -0.64943374300381462  -0.7571657194623802 0.065515668062193153 -0.64992905036579229
+-0.88410882140193769 0.14324145828887103 -0.44478475305090454  -0.88414105178604085 0.14399073917102864 -0.44447864693329692
+-0.98448758643139411 0.16208565674454736 -0.067174638370274931  -0.98445575684574338 0.16230850425355248 -0.067102997401376444
+-0.89826812139385259 0.38781114670466371 -0.20668066329284998  -0.89833165619575717 0.38778432700573329 -0.20645471950357211
+-0.84615687966832631 -0.16669704821929851 0.50619228471494349  -0.84615689033529806 -0.16746624198175136 0.50593831119476196
+-0.92432583806700219 0.037951941733611459 0.37971225316070945  -0.92463196144413295 0.037984161450743445 0.37896297887110203
+-0.89826812139385259 0.38781114670466382 0.20668066329284998  -0.89833165619575706 0.38778432700573312 0.20645471950357261
+-0.98448758643139411 0.16208565674454736 0.067174638370274931  -0.98445575684574338 0.16230850425355248 0.067102997401376457
+-0.9236940845413727 0.2726998137406515 -0.26911716736226499  -0.92375019852295026 0.27282039415738751 -0.26880216379452304
+-0.86230450765389344 0.37596077789543381 -0.33924096091721673  -0.86229745711633865 0.37608264246842449 -0.33912378489964901
+-0.9506072962094394 0.27889813733511903 -0.13624095340381404  -0.95055095711572846 0.27915487828976165 -0.13610816233202513
+-0.95977938206574664 0.28075529872380572 0  -0.95982343558557004 0.28060440841513712 -0.0003721272683770178
+-0.33924096091721678 0.86230450765389344 0.37596077789543403  -0.33912378489964823 0.86229745711633854 0.37608264246842515
+-0.40632940254264294 0.78437123837371081 0.46867704983435066  -0.40646863937642841 0.78424095119900827 0.46877433341209035
+-0.61446983418191226 0.27287882084494519 0.74024588618561449  -0.61436698850995408 0.27300775118977955 0.74028370995146808
+-0.52579382752597525 0.20828740048796671 0.8247164420172246  -0.52568280774650589 0.20813967421463492 0.82482450355064985
+-0.040522281668716867 -0.13192856911395229 0.99043061207734606  -0.040575895565417484 -0.13176921185868204 0.99044963097837846
+0.081370946056690235 -0.066381045638217215 0.9944708773603258  0.081578796887611729 -0.06633169903631253 0.99445714115859518
+0.040522281668716867 -0.13192856911395229 -0.99043061207734606  0.040575895565417512 -0.13176921185868204 -0.99044963097837846
+-0.081370946056690235 -0.066381045638217215 -0.9944708773603258  -0.081578796887611729 -0.06633169903631253 -0.99445714115859518
+-0.58942568680894825 0.20731239180326447 -0.78076816785433134  -0.58928970592655872 0.20735457304096713 -0.78085960551688693
+-0.57608383788574391 0.33994835690442565 -0.74334549596053456  -0.57610127698437297 0.34013694034011499 -0.74324570666303891
+-0.40480738995889742 0.82178222598517658 -0.40100492526839771  -0.40477696304846161 0.82172156155092047 -0.4011599250518193
+-0.27466844612618396 0.86574218443040096 -0.41838703947458172  -0.274471373250949 0.8658197480866201 -0.41835586417422199
+0.33924096091721678 0.86230450765389344 -0.37596077789543403  0.3391237848996484 0.86229745711633854 -0.3760826424684251
+0.40632940254264294 0.78437123837371081 -0.46867704983435066  0.40646863937642841 0.78424095119900827 -0.46877433341209035
+0.61446983418191226 0.27287882084494519 -0.74024588618561449  0.61436698850995408 0.27300775118977955 -0.74028370995146808
+0.52579382752597525 0.20828740048796671 -0.8247164420172246  0.52568280774650589 0.20813967421463492 -0.82482450355064985
+0.27287882084494519 -0.74024588618561449 0.61446983418191226  0.2730077511897796 -0.74028370995146819 0.61436698850995419
+0.20828740048796671 -0.8247164420172246 0.52579382752597525  0.20813967421463489 -0.82482450355064973 0.52568280774650589
+-0.13192856911395229 -0.99043061207734606 0.040522281668716867  -0.13176921185868204 -0.99044963097837846 0.040575895565417484
+-0.066381045638217215 -0.9944708773603258 -0.081370946056690235  -0.066331699036312516 -0.99445714115859507 -0.081578796887611729
+0.20731239180326447 -0.78076816785433134 -0.58942568680894825  0.20735457304096688 -0.78085960551688727 -0.58928970592655838
+0.33994835690442565 -0.74334549596053456 -0.57608383788574391  0.34013694034011205 -0.7432457066630398 -0.57610127698437341
+0.30362145533065943 -0.84916410602320291 0.43023759412454349  0.30820444126016605 -0.84736796744948895 0.43240900791730824
+0.96559982489567697 0.20947750201587081 -0.15035899655759494  0.96089435748012531 0.21982881690250081 -0.16839633316109939
+0.95069104161024875 0.18567470552212903 -0.24579255546759926  0.95608513245170379 0.17856129650966704 -0.2324157544005887
+0.25308933658097965 -0.92998804508785282 0.26439588316448515  0.23565009060488876 -0.93757115374048894 0.25579164660253478
+-0.82401873423925942 0.23458495860622128 -0.51571602924327076  -0.82387113061171735 0.23530638500725787 -0.51562318151862285
+-0.88076789123048704 0.25952221836449818 -0.39610117388436322  -0.880708345595418 0.25988482570664373 -0.39599581735923572
+-0.61446983418191226 -0.27287882084494519 -0.74024588618561449  -0.61436698850995408 -0.27300775118977955 -0.74028370995146808
+-0.52579382752597525 -0.20828740048796671 -0.8247164420172246  -0.52568280774650589 -0.20813967421463492 -0.82482450355064985
+-0.99043061207734606 -0.040522281668716874 0.13192856911395229  -0.99044963097837846 -0.040575895565417512 0.13176921185868204
+-0.9944708773603258 0.081370946056690249 0.066381045638217229  -0.99445714115859507 0.081578796887611688 0.066331699036312544
+-0.40100492526839771 -0.40480738995889742 0.82178222598517658  -0.40115992505181952 -0.40477696304846178 0.82172156155092024
+-0.41838703947458172 -0.27466844612618396 0.86574218443040096  -0.41835586417422199 -0.274471373250949 0.8658197480866201
+-0.86230450765389344 0.37596077789543403 0.33924096091721678  -0.86229745711633876 0.37608264246842515 0.33912378489964795
+-0.78437123837371059 0.46867704983435055 0.40632940254264294  -0.78424095119900905 0.46877433341208957 0.40646863937642802
+0.040522281668716867 0.13192856911395229 0.99043061207734606  0.040575895565417512 0.13176921185868204 0.99044963097837846
+-0.081370946056690235 0.066381045638217215 0.9944708773603258  -0.081578796887611729 0.06633169903631253 0.99445714115859518
+0.37596077789543403 -0.33924096091721678 0.86230450765389344  0.37608264246842515 -0.33912378489964889 0.86229745711633843
+0.46867704983435055 -0.40632940254264294 0.78437123837371059  0.46877433341208941 -0.40646863937642841 0.78424095119900894
+-0.82440895259656954 0.11626913535565189 -0.55392361119767786  -0.823895301648223 0.11760246779863361 -0.55440616112165897
+-0.81891028733871629 0 -0.57392154628557124  -0.81788534298629756 0.00078604920685375042 -0.57538069819453541
+-0.32839555720531111 -0.64061453708709615 0.69409608332024086  -0.32871571883365175 -0.64057192708348332 0.69398384882087005
+-0.27287882084494514 -0.74024588618561449 0.61446983418191203  -0.27300775118978016 -0.74028370995146797 0.61436698850995408
+-0.45126666560725864 -0.58750761901107262 0.67170915887432026  -0.45152335920120684 -0.58737470394737479 0.67165289641182357
+-0.56664784959934422 -0.52372394783737508 0.63610018157997195  -0.56692430597377863 -0.5234294246654746 0.63609627313050632
+0.13192856911395229 0.99043061207734606 0.040522281668716874  0.13176921185868204 0.99044963097837846 0.040575895565417512
+0.066381045638217229 0.9944708773603258 -0.081370946056690249  0.066331699036312544 0.99445714115859507 -0.081578796887611688
+-0.27287882084494519 0.74024588618561449 0.61446983418191226  -0.2730077511897796 0.74028370995146819 0.61436698850995419
+-0.20828740048796671 0.8247164420172246 0.52579382752597525  -0.20813967421463625 0.82482450355064962 0.52568280774650578
+-0.74024588618561449 0.61446983418191226 0.27287882084494519  -0.74028370995146808 0.61436698850995408 0.27300775118977955
+-0.8247164420172246 0.52579382752597525 0.20828740048796671  -0.82482450355064973 0.52568280774650578 0.20813967421463528
+-0.37596077789543403 0.33924096091721678 0.86230450765389344  -0.37608264246842527 0.33912378489964845 0.86229745711633854
+-0.46867704983435055 0.40632940254264294 0.78437123837371059  -0.46877433341208941 0.40646863937642841 0.78424095119900894
+-0.58942568680894825 -0.20731239180326447 0.78076816785433134  -0.58928970592655872 -0.20735457304096713 0.78085960551688693
+-0.57608383788574391 -0.33994835690442565 0.74334549596053456  -0.57610127698437297 -0.34013694034011499 0.74324570666303891
+0.37596077789543403 0.33924096091721678 -0.86230450765389344  0.37608264246842515 0.33912378489964873 -0.86229745711633843
+0.46867704983435055 0.40632940254264294 -0.78437123837371059  0.46877433341208941 0.40646863937642841 -0.78424095119900894
+0.58942568680894825 -0.20731239180326447 -0.78076816785433134  0.58928970592655872 -0.20735457304096713 -0.78085960551688693
+0.57608383788574391 -0.33994835690442565 -0.74334549596053456  0.57610127698437297 -0.34013694034011493 -0.74324570666303891
+-0.040522281668716867 0.13192856911395229 -0.99043061207734606  -0.040575895565417484 0.13176921185868204 -0.99044963097837846
+0.081370946056690235 0.066381045638217215 -0.9944708773603258  0.081578796887611729 0.06633169903631253 -0.99445714115859518
+-0.37596077789543403 -0.33924096091721678 -0.86230450765389344  -0.37608264246842515 -0.33912378489964889 -0.86229745711633843
+-0.46867704983435055 -0.40632940254264294 -0.78437123837371059  -0.46877433341208941 -0.40646863937642841 -0.78424095119900894
+-0.40100492526839771 0.40480738995889742 -0.82178222598517658  -0.40115992505181952 0.40477696304846178 -0.82172156155092024
+-0.41838703947458172 0.27466844612618396 -0.86574218443040096  -0.41835586417422199 0.274471373250949 -0.8658197480866201
+-0.82178222598517658 0.40100492526839771 -0.40480738995889742  -0.82172156155092047 0.4011599250518193 -0.40477696304846161
+-0.86574218443040096 0.41838703947458172 -0.27466844612618396  -0.86581974808661955 0.41835586417422266 -0.27447137325094939
+-0.20731239180326447 0.78076816785433134 -0.58942568680894825  -0.20735457304096688 0.78085960551688727 -0.58928970592655838
+-0.33994835690442565 0.74334549596053456 -0.57608383788574391  -0.34013694034011366 0.74324570666303924 -0.57610127698437308
+-0.13192856911395229 0.99043061207734606 -0.040522281668716874  -0.13176921185868207 0.99044963097837846 -0.040575895565417457
+-0.066381045638217229 0.9944708773603258 0.081370946056690249  -0.066331699036312544 0.99445714115859507 0.081578796887611688
+0.27287882084494519 0.74024588618561449 -0.61446983418191226  0.2730077511897796 0.74028370995146819 -0.61436698850995419
+0.20828740048796671 0.8247164420172246 -0.52579382752597525  0.20813967421463625 0.82482450355064962 -0.52568280774650578
+0.74024588618561449 0.61446983418191226 -0.27287882084494519  0.74028370995146808 0.61436698850995408 -0.27300775118977955
+0.8247164420172246 0.52579382752597525 -0.20828740048796671  0.82482450355064973 0.52568280774650589 -0.20813967421463489
+0.2530893365809796 -0.92998804508785282 -0.26439588316448515  0.23565009060479358 -0.93757115374046784 -0.25579164660269982
+0.2274342072747835 -0.97114863140943242 -0.060907607905721785  0.22895713509378299 -0.97158621857249283 -0.059990417315196665
+0.61446983418191226 -0.27287882084494519 0.74024588618561449  0.6143669885099543 -0.27300775118977966 0.74028370995146797
+0.52579382752597525 -0.20828740048796671 0.8247164420172246  0.52568280774650589 -0.20813967421463492 0.82482450355064985
+0.94686945971280467 0.17991689161909563 -0.26460466631117985  0.95170604908214473 0.15778941565062543 -0.26335925358545598
+0.93208712065408494 0.15549608434201162 -0.32699007860623541  0.91789704785097681 0.17153707639043031 -0.35782683098097218
+-0.20731239180326447 -0.78076816785433134 0.58942568680894825  -0.20735457304096688 -0.78085960551688727 0.58928970592655838
+-0.33994835690442565 -0.74334549596053456 0.57608383788574391  -0.34013694034011366 -0.74324570666303924 0.57610127698437308
+0.13192856911395229 -0.99043061207734606 -0.040522281668716867  0.13176921185868207 -0.99044963097837846 -0.04057589556541745
+0.066381045638217215 -0.9944708773603258 0.081370946056690235  0.066331699036312516 -0.99445714115859507 0.081578796887611729
+-0.33924096091721678 -0.86230450765389344 -0.37596077789543403  -0.33912378489964845 -0.86229745711633887 -0.37608264246842454
+-0.40632940254264294 -0.78437123837371081 -0.46867704983435066  -0.40646863937642835 -0.78424095119900894 -0.46877433341208941
+0.93339586248116191 0.15759811547986141 -0.32187126056253423  0.93893517079361377 0.17584665747242345 -0.29576798018471079
+0.27466844612618396 -0.86574218443040096 -0.41838703947458172  0.27447137325094473 -0.8658197480866211 -0.41835586417422249
+0.40100492526839771 -0.40480738995889742 -0.82178222598517658  0.40115992505181952 -0.40477696304846178 -0.82172156155092024
+0.41838703947458172 -0.27466844612618396 -0.86574218443040096  0.41835586417422199 -0.274471373250949 -0.8658197480866201
+0.9094202856258099 0.11959234854368263 -0.39708487175152668  0.90100988165586215 0.12889639121161173 -0.41420636582639886
+0.86048662890264316 0.042111562758920092 0.50664961250726259  0.85780946571559435 0.048345734654264332 0.5116889782567785
+0.97351999728657068 0.22241808576487493 -0.034988854233130418  0.97444445519669032 0.22205052462855904 -0.033934764602203973
+0.29401138453262826 -0.86471241548978539 -0.40567809407889899  0.30717055145208322 -0.86468532536854159 -0.39744878967349023
+0.96947353031104488 0.21592607882051251 -0.10986054425367317  0.96991439832021309 0.2213218831876913 -0.1014035697270716
+0.25697201819559901 -0.92432848622760766 0.28050566540029309  0.23706297888618891 -0.92607252553187069 0.29358273364867526
+0.86230450765389344 0.37596077789543403 -0.33924096091721678  0.86229745711633898 0.3760826424684246 -0.33912378489964801
+0.78437123837371059 0.46867704983435055 -0.40632940254264294  0.78424095119900816 0.46877433341209018 -0.40646863937642891
+-0.27287882084494519 -0.74024588618561449 -0.61446983418191226  -0.2730077511897796 -0.74028370995146819 -0.61436698850995419
+-0.20828740048796671 -0.8247164420172246 -0.52579382752597525  -0.20813967421463489 -0.82482450355064973 -0.52568280774650589
+-0.74024588618561449 -0.61446983418191226 -0.27287882084494519  -0.74028370995146808 -0.61436698850995408 -0.27300775118977955
+-0.8247164420172246 -0.52579382752597525 -0.20828740048796671  -0.82482450355064973 -0.52568280774650589 -0.20813967421463489
+-0.86230450765389344 -0.37596077789543403 -0.33924096091721678  -0.86229745711633887 -0.37608264246842449 -0.33912378489964828
+-0.78437123837371059 -0.46867704983435055 -0.40632940254264294  -0.78424095119900816 -0.46877433341209018 -0.40646863937642891
+-0.78076816785433134 -0.58942568680894825 0.20731239180326447  -0.78085960551688727 -0.58928970592655838 0.20735457304096688
+-0.74334549596053456 -0.57608383788574391 0.33994835690442565  -0.74324570666303957 -0.57610127698437219 0.34013694034011444
+-0.82178222598517658 -0.40100492526839771 0.40480738995889742  -0.82172156155092047 -0.40115992505181913 0.4047769630484615
+-0.86574218443040096 -0.41838703947458172 0.27466844612618396  -0.86581974808661955 -0.41835586417422266 0.27447137325094939
+-0.40480738995889742 -0.82178222598517658 0.40100492526839771  -0.40477696304846178 -0.82172156155092024 0.40115992505181952
+-0.27466844612618396 -0.86574218443040096 0.41838703947458172  -0.274471373250949 -0.8658197480866201 0.41835586417422199
+-0.78076816785433134 0.58942568680894825 -0.20731239180326447  -0.78085960551688727 0.58928970592655838 -0.20735457304096688
+-0.74334549596053456 0.57608383788574391 -0.33994835690442565  -0.74324570666303957 0.57610127698437219 -0.34013694034011444
+-0.99043061207734606 0.040522281668716874 -0.13192856911395229  -0.99044963097837846 0.040575895565417457 -0.13176921185868207
+-0.9944708773603258 -0.081370946056690249 -0.066381045638217229  -0.99445714115859507 -0.081578796887611701 -0.066331699036312544
+-0.067277074024322203 -0.70227702532207648 0.70871769768752158  -0.067501320615791602 -0.70276863564904046 0.7082088791190847
+-0.20012814034344359 -0.68018071850695239 0.70519707714513447  -0.20029565457621396 -0.68040299513329183 0.7049350430866177
+0.039734588558411582 0.26026494835742225 0.96471929550963276  0.039677999129164823 0.25990051397960157 0.96481986879326076
+0.15985780358782287 0.19937696972895619 0.96679589706089264  0.16010344242024352 0.19913925651268635 0.96680424297825784
+-0.13827368218737232 0.7695778385021762 0.62340222914316235  -0.13836216352689651 0.76972539034249154 0.62320039727703591
+-0.067277074024322245 0.70227702532207659 0.70871769768752169  -0.067501320615791949 0.70276863564904002 0.70820887911908514
+0 -0.62578188869003271 0.77999809473327264  0.00023519417927802882 -0.62694312538533059 0.77906499229253756
+0.054857140713616921 -0.54001796879892028 0.83986385056568236  0.0567929941448857 -0.53979489236345579 0.83987858050695885
+-0.35362935294171682 0.46556504362316581 0.81129246939324073  -0.35387698305874399 0.46550486715932438 0.81121902067950868
+-0.23458495860622128 0.51571602924327076 0.82401873423925942  -0.23530638500725828 0.51562318151862241 0.82387113061171746
+-0.64061453708709615 -0.69409608332024086 0.32839555720531111  -0.64057192708348243 -0.69398384882087072 0.32871571883365219
+0.069740197633308867 0.8004723406749189 0.59529852733606159  0.069662907281838701 0.80067536950372598 0.5950344796892979
+-0.080281277350241251 0.19739352602284607 0.97703158208487906  -0.080345839839677427 0.19714040391717316 0.97707738033578018
+-0.077704403643809677 0.32271058904772337 0.94330265629374277  -0.077926023088562599 0.32203490693742853 0.9435152641263429
+-0.20012814034344362 0.68018071850695239 0.70519707714513458  -0.20029565457621312 0.6804029951332925 0.70493504308661725
+-0.32839555720531116 0.64061453708709593 0.69409608332024109  -0.32871571883365153 0.64057192708348365 0.69398384882086983
+-0.74024588618561449 -0.61446983418191203 0.27287882084494514  -0.74028370995146797 -0.61436698850995408 0.27300775118978016
+0.18656099607880564 0.38998766307204552 0.90172313788306913  0.18714545413042 0.38953622755321998 0.90179715370027913
+-0.25952221836449818 0.39610117388436322 0.88076789123048704  -0.25988482570664329 0.395995817359236 0.880708345595418
+-0.27269981374065155 0.26911716736226504 0.9236940845413727  -0.27282039415738729 0.26880216379452299 0.92375019852295037
+-0.30401279487901051 0.33566720821021828 -0.891573746743482  -0.30422052318316722 0.33550256744406942 -0.89156486051918715
+-0.18656099607880564 0.38998766307204552 -0.90172313788306913  -0.18714545413041722 0.38953622755321954 -0.90179715370027991
+0.25952221836449818 0.39610117388436322 -0.88076789123048704  0.25988482570664351 0.39599581735923611 -0.88070834559541777
+0.27269981374065155 0.26911716736226504 -0.9236940845413727  0.27282039415738729 0.26880216379452299 -0.92375019852295037
+-0.26817151760031976 0.68929656115193516 -0.6730187872058685  -0.2683644632421503 0.68937955050281352 -0.67285685715261256
+-0.19300544019554741 0.62457262167826677 -0.75674166021493716  -0.19358827458119449 0.62484261256047757 -0.75636980999592573
+-0.039734588558411582 0.26026494835742225 -0.96471929550963276  -0.039677999129164775 0.25990051397960157 -0.96481986879326076
+-0.15985780358782287 0.19937696972895619 -0.96679589706089264  -0.16010344242024352 0.19913925651268635 -0.96680424297825784
+0.13827368218737232 0.7695778385021762 -0.62340222914316235  0.13836216352689651 0.76972539034249154 -0.62320039727703591
+0.067277074024322245 0.70227702532207659 -0.70871769768752169  0.067501320615791671 0.70276863564904035 -0.7082088791190847
+-0.28407954462258928 0.46039308870086582 -0.84103330267207554  -0.28440717777405611 0.46019616855581397 -0.84103034646625274
+-0.37149736972483099 0.52777252693426735 -0.76383628095354983  -0.37176976328896 0.52785497534633807 -0.76364675610270705
+0.35362935294171682 0.46556504362316581 -0.81129246939324073  0.35387698305874399 0.46550486715932438 -0.81121902067950868
+0.23458495860622128 0.51571602924327076 -0.82401873423925942  0.23530638500725828 0.51562318151862241 -0.82387113061171746
+-0.135836225526941 0.719915307065364 -0.68063975088704354  -0.13609530337963532 0.72008099426245686 -0.68041269101920521
+-0.069740197633308867 0.8004723406749189 -0.59529852733606159  -0.069662907281838521 0.80067536950372609 -0.59503447968929801
+0.080281277350241251 0.19739352602284607 -0.97703158208487906  0.080345839839677427 0.19714040391717316 -0.97707738033578018
+0.077704403643809677 0.32271058904772337 -0.94330265629374277  0.077926023088562599 0.32203490693742853 -0.9435152641263429
+0.20012814034344362 0.68018071850695239 -0.70519707714513458  0.20029565457621254 0.68040299513329261 -0.70493504308661725
+0.32839555720531116 0.64061453708709593 -0.69409608332024109  0.32871571883365153 0.64057192708348365 -0.69398384882086983
+0.19739352602284607 -0.97703158208487906 0.080281277350241251  0.19714040391716239 -0.97707738033578384 0.080345839839657915
+0.88525794997176432 0.081090696230260814 -0.45671715648324701  0.88043888279482208 0.087790975218749304 -0.46596149876695442
+0.69377314187723504 -0.22428489754399578 0.68341702461536258  0.68956138101058795 -0.23429135260016812 0.68528290794062152
+0.30362145533065937 -0.84916410602320314 -0.43023759412454321  0.30820444126016194 -0.84736796744948673 -0.43240900791731557
+0.84685829520082545 0.019286849148286479 -0.53075413092765555  0.84560936423415123 0.027439993872777964 -0.53309647331020338
+0.86048662890264316 0.042111562758920099 -0.50664961250726259  0.85780946571559225 0.048345734654243647 -0.51168897825678417
+0.93339586248116191 0.15759811547986138 0.32187126056253412  0.93893517079361677 0.17584665747242473 0.29576798018470041
+0.67087146858540314 -0.2624299701285262 0.69320320770179844  0.66138007935865273 -0.23687493927937106 0.71166470600201659
+0.77138586605477633 -0.1010889929861338 -0.62717432611494872  0.76918721291849768 -0.096596587118420896 -0.63168040245027945
+0.24336599009814619 -0.94602936533555493 -0.21094260961626565  0.23388566130186011 -0.94764280563005887 -0.21741805439057252
+0.79564186567445128 -0.06209942187768587 -0.60211592452938889  0.77995892884278062 -0.063643445898667397 -0.62258620376022278
+0.19937696972895619 -0.96679589706089264 -0.15985780358782287  0.19913925651268788 -0.96680424297825807 -0.16010344242024077
+0.79934060742300872 -0.055862651692236032 -0.59790562905682221  0.79006130932890728 -0.031934562996145929 -0.61219548445552729
+0.39895802436542988 -0.69687753315555612 -0.5957410107715313  0.37119418317777397 -0.71962089011270369 -0.5868225054378754
+0.40036321981550371 -0.69465247190942381 -0.5975302451883705  0.36887582764820903 -0.69486688193504553 -0.61732539245256723
+0.36998650939197825 -0.74269333684247574 -0.5567855194421365  0.37302523877669252 -0.74314518846920119 -0.55550643568789271
+0.23294949527472619 -0.96194916611186088 -0.13775142693846473  0.23081318598024428 -0.96295953203001483 -0.13940664564569327
+0.77138586605477644 -0.10108899298613383 0.62717432611494861  0.76918721291849901 -0.096596587118417288 0.63168040245027857
+0.27219661039719123 -0.89987434907152986 -0.34005641981910134  0.27087574504909701 -0.91136373772562662 -0.30990719304797043
+0.8348259841132093 -6.1457978060811826e-19 -0.5497573450331017  0.83512821922583769 1.1838618468367161e-14 -0.5500553221746709
+-0.58750761901107262 -0.67170915887432026 0.45126666560725864  -0.58737470394737457 -0.67165289641182346 0.45152335920120723
+-0.52372394783737519 -0.63610018157997184 0.56664784959934422  -0.52380155193385258 -0.63632626043050489 0.56632219140540196
+0.74055958467102845 -0.15027494754537968 -0.65399889841309089  0.74496666446894877 -0.16330181399314903 -0.64680536978024206
+0.23294949527472616 -0.96194916611186088 0.13775142693846476  0.23081318598027054 -0.96295953203000251 0.13940664564573535
+-0.080281277350241251 -0.19739352602284607 -0.97703158208487906  -0.080345839839677427 -0.19714040391717316 -0.97707738033578018
+-0.077704403643809677 -0.32271058904772337 -0.94330265629374277  -0.077926023088562599 -0.32203490693742853 -0.9435152641263429
+-0.20012814034344362 -0.68018071850695239 -0.70519707714513458  -0.20029565457621254 -0.68040299513329261 -0.70493504308661725
+-0.32839555720531116 -0.64061453708709593 -0.69409608332024109  -0.32871571883365153 -0.64057192708348365 -0.69398384882086983
+-0.891573746743482 0.30401279487901051 -0.33566720821021828  -0.89156486051918693 0.30422052318316706 -0.33550256744407037
+-0.90172313788306913 0.18656099607880564 -0.38998766307204552  -0.90179715370027991 0.18714545413041722 -0.38953622755321954
+-0.88076789123048704 -0.25952221836449818 -0.39610117388436322  -0.88070834559541789 -0.25988482570664351 -0.39599581735923606
+-0.9236940845413727 -0.27269981374065155 -0.26911716736226504  -0.92375019852294982 -0.27282039415738868 -0.26880216379452387
+-0.62340222914316235 0.13827368218737232 0.76957783850217643  -0.6232003972770358 0.13836216352689656 0.76972539034249154
+-0.70871769768752169 0.067277074024322245 0.70227702532207659  -0.70820887911908514 0.067501320615791949 0.70276863564904002
+-0.84103330267207554 -0.28407954462258928 0.46039308870086582  -0.84103034646625308 -0.28440717777405616 0.46019616855581352
+-0.76383628095354983 -0.37149736972483099 0.52777252693426735  -0.76364675610270705 -0.37176976328896005 0.52785497534633807
+-0.46556504362316581 0.81129246939324073 0.35362935294171682  -0.46550486715932415 0.81121902067950902 0.35387698305874365
+-0.51571602924327076 0.82401873423925942 0.23458495860622128  -0.51562318151862241 0.82387113061171757 0.23530638500725828
+-0.719915307065364 0.68063975088704354 -0.135836225526941  -0.72008099426245686 0.68041269101920521 -0.13609530337963532
+-0.8004723406749189 0.59529852733606159 -0.069740197633308867  -0.80067536950372609 0.59503447968929801 -0.069662907281838521
+-0.30401279487901051 -0.33566720821021828 0.891573746743482  -0.30422052318316722 -0.33550256744406942 0.89156486051918715
+-0.18656099607880564 -0.38998766307204552 0.90172313788306913  -0.18714545413041722 -0.38953622755321954 0.90179715370027991
+0.25952221836449818 -0.39610117388436322 0.88076789123048704  0.25988482570664362 -0.39599581735923617 0.88070834559541789
+0.27269981374065155 -0.26911716736226504 0.9236940845413727  0.27282039415738729 -0.26880216379452299 0.92375019852295037
+0.50392422938731019 -0.52945918848859996 0.68235511400187066  0.51008352708670168 -0.55674863743611447 0.65562622744046795
+0.75366980899531777 -0.12957223153317302 -0.64334361719230837  0.75782534074317554 -0.12946239417784902 -0.63948435588466823
+-0.70227702532207648 -0.70871769768752158 0.067277074024322203  -0.70276863564903969 -0.70820887911908548 0.067501320615792171
+0.59529852733606148 0.069740197633308854 0.8004723406749189  0.59503447968929823 0.069662907281837758 0.80067536950372598
+0.62340222914316235 -0.13827368218737232 0.76957783850217643  0.6232003972770358 -0.13836216352689656 0.76972539034249154
+0.70871769768752169 -0.067277074024322245 0.70227702532207659  0.70820887911908514 -0.067501320615791949 0.70276863564904002
+-0.68018071850695239 -0.70519707714513447 0.20012814034344359  -0.68040299513329183 -0.7049350430866177 0.20029565457621396
+-0.62578188869003271 -0.77999809473327264 0  -0.6269431253853307 -0.77906499229253756 -0.0002351941792792563
+0.76957783850217643 0.62340222914316235 -0.13827368218737232  0.76972539034249154 0.6232003972770358 -0.13836216352689656
+0.70227702532207659 0.70871769768752169 -0.067277074024322245  0.70276863564903969 0.70820887911908559 -0.06750132061579224
+-0.54001796879892028 -0.83986385056568236 -0.054857140713616921  -0.53979489236345579 -0.83987858050695896 -0.056792994144885707
+-0.9236940845413727 -0.2726998137406515 0.26911716736226499  -0.92375019852295026 -0.27282039415738751 0.26880216379452304
+-0.86230450765389344 -0.37596077789543381 0.33924096091721673  -0.86229745711633865 -0.37608264246842443 0.33912378489964906
+-0.9506072962094394 -0.27889813733511903 0.13624095340381404  -0.95055095711572846 -0.27915487828976165 0.13610816233202513
+0.26026494835742225 0.96471929550963276 0.039734588558411582  0.25990051397960157 0.96481986879326076 0.039677999129164823
+0.19937696972895619 0.96679589706089264 0.15985780358782287  0.19913925651268638 0.96680424297825784 0.1601034424202436
+-0.33566720821021828 0.891573746743482 -0.30401279487901051  -0.33550256744406942 0.89156486051918715 -0.30422052318316722
+-0.38998766307204552 0.90172313788306913 -0.18656099607880564  -0.38953622755321954 0.90179715370027991 -0.18714545413041722
+-0.39610117388436322 0.88076789123048704 0.25952221836449818  -0.39599581735923606 0.88070834559541789 0.25988482570664351
+-0.26911716736226515 0.92369408454137258 0.27269981374065166  -0.26880216379452399 0.92375019852294971 0.27282039415738862
+-0.19739352602284607 0.97703158208487906 0.080281277350241251  -0.19714040391717316 0.97707738033578018 0.080345839839677427
+-0.32271058904772337 0.94330265629374277 0.077704403643809677  -0.32203490693742853 0.9435152641263429 0.077926023088562599
+-0.68018071850695239 0.70519707714513458 0.20012814034344362  -0.68040299513329272 0.70493504308661736 0.20029565457621257
+-0.64061453708709593 0.69409608332024109 0.32839555720531116  -0.64057192708348365 0.69398384882086983 0.32871571883365153
+-0.97703158208487906 0.080281277350241251 0.19739352602284607  -0.97707738033578018 0.080345839839677427 0.19714040391717316
+-0.94330265629374277 0.077704403643809677 0.32271058904772337  -0.9435152641263429 0.077926023088562585 0.32203490693742848
+-0.70519707714513458 0.20012814034344362 0.68018071850695239  -0.70493504308661725 0.20029565457621315 0.68040299513329261
+-0.69409608332024109 0.32839555720531116 0.64061453708709593  -0.69398384882086983 0.32871571883365153 0.64057192708348365
+-0.81129246939324073 0.35362935294171682 0.46556504362316581  -0.81121902067950902 0.35387698305874365 0.46550486715932415
+-0.82401873423925942 0.23458495860622128 0.51571602924327076  -0.82387113061171757 0.23530638500725828 0.51562318151862241
+-0.68063975088704343 -0.13583622552694097 0.71991530706536411  -0.6804126910192051 -0.13609530337963596 0.72008099426245686
+-0.59529852733606148 -0.069740197633308854 0.8004723406749189  -0.5950344796892979 -0.069662907281837216 0.8006753695037262
+-0.26817151760031971 -0.68929656115193505 0.67301878720586839  -0.26836446324214952 -0.68937955050281408 0.67285685715261245
+-0.19300544019554741 -0.62457262167826677 0.75674166021493716  -0.19358827458119374 -0.62484261256047813 0.75636980999592551
+-0.039734588558411582 -0.26026494835742225 0.96471929550963276  -0.039677999129164775 -0.25990051397960157 0.96481986879326076
+-0.15985780358782287 -0.19937696972895619 0.96679589706089264  -0.16010344242024352 -0.19913925651268635 0.96680424297825784
+0.81129246939324073 0.35362935294171682 -0.46556504362316581  0.81121902067950868 0.35387698305874399 -0.46550486715932432
+0.82401873423925942 0.23458495860622128 -0.51571602924327076  0.82387113061171757 0.23530638500725828 -0.51562318151862241
+0.68063975088704343 -0.13583622552694097 -0.71991530706536411  0.6804126910192051 -0.13609530337963596 -0.72008099426245686
+0.59529852733606148 -0.069740197633308854 -0.8004723406749189  0.5950344796892979 -0.069662907281837216 -0.8006753695037262
+0.26817151760031971 -0.68929656115193505 -0.67301878720586839  0.26836446324214952 -0.68937955050281408 -0.67285685715261245
+0.19300544019554741 -0.62457262167826677 -0.75674166021493716  0.19358827458119374 -0.62484261256047813 -0.75636980999592551
+0.039734588558411582 -0.26026494835742225 -0.96471929550963276  0.039677999129164823 -0.25990051397960157 -0.96481986879326076
+0.15985780358782287 -0.19937696972895619 -0.96679589706089264  0.16010344242024352 -0.19913925651268635 -0.96680424297825784
+0.30401279487901051 -0.33566720821021828 -0.891573746743482  0.30422052318316722 -0.33550256744406942 -0.89156486051918715
+0.18656099607880564 -0.38998766307204552 -0.90172313788306913  0.18714545413041722 -0.38953622755321954 -0.90179715370027991
+-0.25952221836449818 -0.39610117388436322 -0.88076789123048704  -0.25988482570664362 -0.39599581735923617 -0.88070834559541789
+-0.27269981374065155 -0.26911716736226504 -0.9236940845413727  -0.27282039415738729 -0.26880216379452299 -0.92375019852295037
+-0.81129246939324073 -0.35362935294171682 -0.46556504362316581  -0.81121902067950868 -0.35387698305874399 -0.46550486715932432
+-0.82401873423925942 -0.23458495860622128 -0.51571602924327076  -0.82387113061171757 -0.23530638500725828 -0.51562318151862241
+-0.68063975088704343 0.13583622552694097 -0.71991530706536411  -0.6804126910192051 0.13609530337963596 -0.72008099426245686
+-0.59529852733606148 0.069740197633308854 -0.8004723406749189  -0.59503447968929823 0.069662907281837425 -0.80067536950372598
+-0.62340222914316235 -0.13827368218737232 -0.76957783850217643  -0.6232003972770358 -0.13836216352689656 -0.76972539034249154
+-0.70871769768752169 -0.067277074024322245 -0.70227702532207659  -0.70820887911908514 -0.067501320615791949 -0.70276863564904002
+-0.84103330267207554 0.28407954462258928 -0.46039308870086582  -0.84103034646625296 0.28440717777405616 -0.46019616855581363
+-0.76383628095354983 0.37149736972483099 -0.52777252693426735  -0.76364675610270705 0.37176976328896005 -0.52785497534633807
+-0.7695778385021762 0.62340222914316235 0.13827368218737232  -0.76972539034249143 0.62320039727703591 0.13836216352689651
+-0.70227702532207659 0.70871769768752169 0.067277074024322245  -0.70276863564903969 0.70820887911908559 0.06750132061579224
+-0.46039308870086582 0.84103330267207554 -0.28407954462258928  -0.46019616855581363 0.84103034646625296 -0.28440717777405616
+-0.52777252693426735 0.76383628095354983 -0.37149736972483099  -0.52785497534633807 0.76364675610270705 -0.37176976328896
+-0.68929656115193516 0.6730187872058685 -0.26817151760031976  -0.68937955050281463 0.67285685715261212 -0.26836446324214869
+-0.62457262167826677 0.75674166021493716 -0.19300544019554741  -0.62484261256047735 0.75636980999592596 -0.19358827458119518
+-0.26026494835742225 0.96471929550963276 -0.039734588558411582  -0.25990051397960157 0.96481986879326076 -0.03967799912916474
+-0.19937696972895619 0.96679589706089264 -0.15985780358782287  -0.19913925651268638 0.96680424297825784 -0.1601034424202436
+-0.95977938206574664 -0.28075529872380572 0  -0.95982343558557026 -0.28060440841513667 0.00037212726837728354
+0.38998766307204552 0.90172313788306913 0.18656099607880564  0.38953622755323608 0.90179715370027325 0.18714545413041478
+0.39610117388436322 0.88076789123048704 -0.25952221836449818  0.39599581735923617 0.88070834559541789 -0.25988482570664362
+0.26911716736226515 0.92369408454137258 -0.27269981374065166  0.26880216379452399 0.92375019852294971 -0.27282039415738862
+0.19739352602284607 0.97703158208487906 -0.080281277350241251  0.19714040391717316 0.97707738033578018 -0.080345839839677427
+0.32271058904772337 0.94330265629374277 -0.077704403643809677  0.32203490693742853 0.9435152641263429 -0.077926023088562599
+0.68018071850695239 0.70519707714513458 -0.20012814034344362  0.68040299513329272 0.70493504308661736 -0.20029565457621257
+0.64061453708709593 0.69409608332024109 -0.32839555720531116  0.64057192708348365 0.69398384882086983 -0.32871571883365153
+0.69377314187723493 -0.22428489754399594 -0.68341702461536258  0.68956138101050557 -0.23429135260011255 -0.68528290794072344
+0.67087146858540314 -0.2624299701285262 -0.69320320770179855  0.66138007935864784 -0.23687493927937248 -0.71166470600202048
+0.70519707714513458 0.20012814034344362 -0.68018071850695239  0.70493504308661725 0.20029565457621315 -0.68040299513329261
+0.69409608332024109 0.32839555720531116 -0.64061453708709593  0.69398384882086983 0.32871571883365153 -0.64057192708348365
+0.63268818151834738 -0.32335420881895127 -0.70294074606773105  0.62602060935196258 -0.30459772848492761 -0.71785682449108168
+0.59214384399202524 -0.38815954298187871 -0.70538094374692584  0.58682250543787806 -0.37119418317777025 -0.71962089011270336
+0.70519707714513458 -0.20012814034344362 0.68018071850695239  0.70493504308661492 -0.20029565457621035 0.68040299513329583
+0.54306000239317154 -0.46664565776233691 -0.69755165300174249  0.52046695699577006 -0.46800238770905833 -0.71420439075532405
+0.080281277350241251 -0.19739352602284607 0.97703158208487906  0.080345839839677427 -0.19714040391717316 0.97707738033578018
+0.077704403643809677 -0.32271058904772337 0.94330265629374277  0.077926023088562599 -0.32203490693742853 0.9435152641263429
+0.20012814034344362 -0.68018071850695239 0.70519707714513458  0.20029565457621254 -0.68040299513329261 0.70493504308661725
+0.32839555720531116 -0.64061453708709593 0.69409608332024109  0.32871571883365153 -0.64057192708348365 0.69398384882086983
+0.35362935294171682 -0.46556504362316581 0.81129246939324073  0.35387698305874399 -0.46550486715932438 0.81121902067950868
+0.23458495860622128 -0.51571602924327076 0.82401873423925942  0.23530638500725828 -0.51562318151862241 0.82387113061171746
+-0.13583622552694097 -0.71991530706536411 0.68063975088704343  -0.13609530337963532 -0.72008099426245686 0.68041269101920521
+-0.069740197633308854 -0.8004723406749189 0.59529852733606148  -0.069662907281837216 -0.8006753695037262 0.5950344796892979
+-0.68929656115193505 -0.67301878720586839 0.26817151760031971  -0.6893795505028143 -0.67285685715261256 0.26836446324214835
+-0.62457262167826677 -0.75674166021493716 0.19300544019554741  -0.62484261256047768 -0.75636980999592551 0.19358827458119562
+-0.26026494835742225 -0.96471929550963276 0.039734588558411582  -0.25990051397960157 -0.96481986879326076 0.039677999129164775
+-0.19937696972895619 -0.96679589706089264 0.15985780358782287  -0.19913925651268635 -0.96680424297825784 0.16010344242024355
+-0.33566720821021828 -0.891573746743482 0.30401279487901051  -0.33550256744406942 -0.89156486051918715 0.30422052318316722
+-0.38998766307204552 -0.90172313788306913 0.18656099607880564  -0.38953622755321954 -0.90179715370027991 0.18714545413041722
+-0.39610117388436322 -0.88076789123048704 -0.25952221836449818  -0.39599581735923617 -0.88070834559541789 -0.25988482570664362
+-0.26911716736226504 -0.9236940845413727 -0.27269981374065155  -0.26880216379452387 -0.92375019852294982 -0.27282039415738868
+-0.35362935294171682 -0.46556504362316581 -0.81129246939324073  -0.35387698305874399 -0.46550486715932438 -0.81121902067950868
+-0.23458495860622128 -0.51571602924327076 -0.82401873423925942  -0.23530638500725828 -0.51562318151862241 -0.82387113061171746
+0.13583622552694097 -0.71991530706536411 -0.68063975088704343  0.13609530337963532 -0.72008099426245686 -0.68041269101920521
+0.069740197633308854 -0.8004723406749189 -0.59529852733606148  0.069662907281837425 -0.80067536950372598 -0.59503447968929823
+-0.13827368218737232 -0.76957783850217643 -0.62340222914316235  -0.13836216352689656 -0.76972539034249154 -0.6232003972770358
+-0.067277074024322245 -0.70227702532207659 -0.70871769768752169  -0.067501320615791671 -0.70276863564904035 -0.7082088791190847
+0.28407954462258928 -0.46039308870086582 -0.84103330267207554  0.28440717777405611 -0.46019616855581397 -0.84103034646625274
+0.37149736972483099 -0.52777252693426735 -0.76383628095354983  0.37176976328896 -0.52785497534633807 -0.76364675610270705
+0.62340222914316235 0.13827368218737232 -0.76957783850217643  0.6232003972770358 0.13836216352689656 -0.76972539034249154
+0.70871769768752169 0.067277074024322245 -0.70227702532207659  0.70820887911908514 0.067501320615791949 -0.70276863564904002
+0.9741085412313033 0.22323020415808842 -0  0.97034898997513441 0.24170816629612724 -3.4702813040504568e-18
+0.80588150441467521 -0.045732053728024212 -0.58956860097968999  0.81036094014927451 -0.03066751953522092 -0.58512789193982251
+0.58303192413334481 -0.40257317574481138 -0.70495163176324016  0.56575106816924781 -0.40400744901774382 -0.71882105562061149
+0.87006466098054647 0.056547496445093395 -0.48863305375424759  0.86908209382503243 0.066959188365443956 -0.49011506943384087
+0.50787822903713031 -0.52299793234814496 -0.68413337702600852  0.52838581205514679 -0.49772992706568958 -0.68780328097647692
+0.4546732585899762 -0.60749293870920396 -0.65018159643527595  0.45629539576528333 -0.61497179190323992 -0.64312067838526354
+-0.82401873423925942 -0.23458495860622128 0.51571602924327076  -0.82387113061171735 -0.23530638500725787 0.51562318151862285
+0.90172313788306913 0.18656099607880564 0.38998766307204552  0.90179715370027269 0.18714545413041447 0.38953622755323752
+0.46796403496887884 -0.58666916470964625 -0.66003296952840651  0.48378799724665339 -0.58634540105761357 -0.64972936241073365
+0.75366980899531777 -0.12957223153317304 0.64334361719230837  0.75782534074317576 -0.12946239417784181 0.63948435588466934
+0.4331208322019765 -0.64210794890239153 -0.63136143448574877  0.42807141203226518 -0.64268086340022179 -0.6353866334916467
+0.22628605152906522 -0.97313250261608553 -0.01853460685588823  0.22857704379632604 -0.97332233192471607 -0.019904100732393872
+0.88076789123048704 0.25952221836449818 -0.39610117388436322  0.880708345595418 0.25988482570664329 -0.395995817359236
+0.9236940845413727 0.27269981374065155 -0.26911716736226504  0.92375019852294982 0.27282039415738868 -0.26880216379452387
+0.46556504362316581 0.81129246939324073 -0.35362935294171682  0.46550486715932415 0.81121902067950902 -0.35387698305874365
+0.51571602924327076 0.82401873423925942 -0.23458495860622128  0.51562318151862241 0.82387113061171757 -0.23530638500725828
+-0.88076789123048704 -0.25952221836449818 0.39610117388436322  -0.880708345595418 -0.25988482570664379 0.39599581735923578
+0.8004723406749189 0.59529852733606148 0.069740197633308854  0.80067536950372697 0.59503447968929701 0.069662907281836411
+-0.19739352602284607 -0.97703158208487906 -0.080281277350241251  -0.19714040391717316 -0.97707738033578018 -0.080345839839677427
+-0.32271058904772337 -0.94330265629374277 -0.077704403643809677  -0.32203490693742853 -0.9435152641263429 -0.077926023088562599
+-0.68018071850695239 -0.70519707714513458 -0.20012814034344362  -0.68040299513329272 -0.70493504308661736 -0.20029565457621257
+-0.64061453708709593 -0.69409608332024109 -0.32839555720531116  -0.64057192708348365 -0.69398384882086983 -0.32871571883365153
+-0.97703158208487906 -0.080281277350241251 -0.19739352602284607  -0.97707738033578018 -0.080345839839677427 -0.19714040391717316
+-0.94330265629374277 -0.077704403643809677 -0.32271058904772337  -0.9435152641263429 -0.077926023088562585 -0.32203490693742848
+-0.70519707714513458 -0.20012814034344362 -0.68018071850695239  -0.70493504308661725 -0.20029565457621315 -0.68040299513329261
+-0.69409608332024109 -0.32839555720531116 -0.64061453708709593  -0.69398384882086983 -0.32871571883365153 -0.64057192708348365
+-0.46556504362316581 -0.81129246939324073 -0.35362935294171682  -0.46550486715932438 -0.81121902067950868 -0.35387698305874399
+-0.51571602924327076 -0.82401873423925942 -0.23458495860622128  -0.51562318151862241 -0.82387113061171757 -0.23530638500725828
+-0.71991530706536411 -0.68063975088704343 0.13583622552694097  -0.72008099426245686 -0.68041269101920521 0.13609530337963532
+-0.8004723406749189 -0.59529852733606148 0.069740197633308854  -0.8006753695037262 -0.5950344796892979 0.069662907281837216
+-0.67301878720586839 -0.26817151760031971 0.68929656115193505  -0.67285685715261223 -0.26836446324215069 0.68937955050281374
+-0.75674166021493716 -0.19300544019554741 0.62457262167826677  -0.75636980999592607 -0.19358827458119601 0.6248426125604768
+-0.96471929550963276 -0.039734588558411582 0.26026494835742225  -0.96481986879326076 -0.039677999129164823 0.25990051397960157
+-0.96679589706089264 -0.15985780358782287 0.19937696972895619  -0.96680424297825784 -0.1601034424202436 0.19913925651268638
+-0.76957783850217643 -0.62340222914316235 -0.13827368218737232  -0.76972539034249154 -0.6232003972770358 -0.13836216352689656
+-0.70227702532207659 -0.70871769768752169 -0.067277074024322245  -0.70276863564903969 -0.70820887911908559 -0.06750132061579224
+-0.46039308870086582 -0.84103330267207554 0.28407954462258928  -0.46019616855581397 -0.84103034646625274 0.28440717777405611
+-0.52777252693426735 -0.76383628095354983 0.37149736972483099  -0.52785497534633807 -0.76364675610270705 0.37176976328896
+0.13827368218737232 -0.76957783850217643 0.62340222914316235  0.13836216352689656 -0.76972539034249154 0.6232003972770358
+0.067277074024322245 -0.70227702532207659 0.70871769768752169  0.067501320615791671 -0.70276863564904035 0.7082088791190847
+-0.28407954462258928 -0.46039308870086582 0.84103330267207554  -0.28440717777405611 -0.46019616855581397 0.84103034646625274
+-0.37149736972483099 -0.52777252693426735 0.76383628095354983  -0.37176976328896 -0.52785497534633807 0.76364675610270705
+-0.67301878720586839 0.26817151760031971 -0.68929656115193505  -0.67285685715261223 0.26836446324215069 -0.68937955050281374
+-0.75674166021493716 0.19300544019554741 -0.62457262167826677  -0.75636980999592607 0.19358827458119601 -0.6248426125604768
+-0.96471929550963276 0.039734588558411582 -0.26026494835742225  -0.96481986879326076 0.03967799912916474 -0.25990051397960157
+-0.96679589706089264 0.15985780358782287 -0.19937696972895619  -0.96680424297825784 0.1601034424202436 -0.19913925651268638
+-0.891573746743482 -0.30401279487901051 0.33566720821021828  -0.89156486051918693 -0.30422052318316706 0.33550256744407037
+-0.90172313788306913 -0.18656099607880564 0.38998766307204552  -0.90179715370027991 -0.18714545413041722 0.38953622755321954
+-0.88076789123048704 0.25952221836449818 0.39610117388436322  -0.880708345595418 0.25988482570664329 0.395995817359236
+-0.92369408454137258 0.27269981374065166 0.26911716736226515  -0.92375019852294971 0.27282039415738862 0.26880216379452399
+-0.82440895259656954 -0.11626913535565189 0.55392361119767786  -0.823895301648223 -0.11760246779863359 0.55440616112165897
+-0.8189102873387164 0 0.57392154628557113  -0.81788534298629756 -0.00078604920685430759 0.57538069819453519
+-0.80047234067491879 -0.59529852733606159 -0.069740197633308854  -0.8006753695037262 -0.59503447968929801 -0.069662907281838451
+-0.78076816785433134 -0.58942568680894825 -0.20731239180326447  -0.78085960551688738 -0.58928970592655827 -0.20735457304096649
+0.068715700526218768 0.9453832490724946 0.3186356302649232  0.068382200701545173 0.94544807568691736 0.31851500876272482
+0.13899360672691591 0.89342795031552769 0.42716188369754926  0.22370787894634703 0.9211836066081267 0.31839526977291976
+-0.86640575634619166 -0.4993406306021807 0  -0.86652958223713705 -0.49912569350341029 0.00015872199696746758
+-0.9168554803037775 -0.39313153246640248 0.069452331980627613  -0.91670068154564333 -0.3935012441801673 0.069401954456725035
+-0.58427898032160919 0.62674761880757135 0.51556327979539029  -0.5844947940189088 0.62647295099493483 0.51565247738810616
+-0.46626606661797826 0.69116244652106429 0.55216883979414844  -0.4664730029139274 0.69097715483087396 0.5522259583307304
+-0.26817151760031971 0.68929656115193505 0.6730187872058685  -0.2683644632421513 0.68937955050281263 0.67285685715261312
+-0.33994835690442576 0.74334549596053445 0.57608383788574413  -0.34013694034011649 0.74324570666303791 0.57610127698437341
+-0.42981996927710414 0 0.90291461058653233  -0.42961984965260047 -0.00028436728304534936 0.9030098027816339
+-0.42716188369754932 0.13899360672691585 0.89342795031552757  -0.42704736713517844 0.1387511965001427 0.89352037004910567
+-0.30401279487901056 0.33566720821021839 0.891573746743482  -0.30422052318316667 0.3355025674440707 0.89156486051918682
+-0.41838703947458189 0.27466844612618385 0.86574218443040085  -0.41835586417422255 0.27447137325094917 0.86581974808661977
+0.31863563026492325 -0.068715700526218768 0.9453832490724946  0.31897512469198191 -0.068666567984591254 0.94527232704070629
+0.20226550379446337 0 0.97933072349169759  0.20254321521823354 2.0838667697410136e-17 0.97927332546590906
+0.080281277350241265 0.19739352602284616 0.97703158208487906  0.080345839839677552 0.19714040391717327 0.97707738033578018
+0.081370946056690249 0.066381045638217229 0.9944708773603258  0.081578796887611757 0.066331699036312544 0.99445714115859518
+-0.31863563026492325 -0.068715700526218768 -0.9453832490724946  -0.31897512469198191 -0.068666567984591254 -0.94527232704070629
+-0.20226550379446337 0 -0.97933072349169759  -0.20254321521823354 2.0838667697410136e-17 -0.97927332546590906
+-0.080281277350241265 0.19739352602284616 -0.97703158208487906  -0.080345839839677552 0.19714040391717327 -0.97707738033578018
+-0.081370946056690249 0.066381045638217229 -0.9944708773603258  -0.081578796887611757 0.066331699036312544 -0.99445714115859518
+-0.62674761880757135 0.51556327979539029 -0.58427898032160919  -0.62647295099493472 0.51565247738810682 -0.58449479401890847
+-0.55216883979414833 0.46626606661797837 -0.69116244652106429  -0.55222595833073074 0.46647300291392696 -0.69097715483087396
+-0.35362935294171677 0.46556504362316592 -0.81129246939324073  -0.35387698305874388 0.46550486715932382 -0.81121902067950891
+-0.46867704983435055 0.40632940254264294 -0.78437123837371081  -0.46877433341209007 0.40646863937642824 -0.78424095119900861
+-0.068715700526218768 0.9453832490724946 -0.3186356302649232  -0.068382200701545062 0.94544807568691724 -0.31851500876272504
+-0.13899360672691591 0.89342795031552769 -0.42716188369754926  -0.13875119650014353 0.89352037004910556 -0.4270473671351786
+-0.13827368218737227 0.76957783850217643 -0.62340222914316235  -0.13836216352689656 0.76972539034249154 -0.62320039727703591
+-0.20828740048796671 0.8247164420172246 -0.52579382752597525  -0.20813967421463545 0.82482450355065018 -0.52568280774650522
+0.58427898032160919 0.62674761880757146 -0.51556327979539029  0.58449479401890791 0.62647295099493572 -0.51565247738810627
+0.46626606661797826 0.69116244652106429 -0.55216883979414844  0.4664730029139274 0.69097715483087396 -0.5522259583307304
+0.26817151760031971 0.68929656115193505 -0.6730187872058685  0.2683644632421513 0.68937955050281263 -0.67285685715261312
+0.33994835690442576 0.74334549596053445 -0.57608383788574413  0.34013694034011649 0.74324570666303791 -0.57610127698437341
+0.42981996927710414 0 -0.90291461058653233  0.42961984965260047 -0.00028436728304534936 -0.9030098027816339
+0.42716188369754932 0.13899360672691585 -0.89342795031552757  0.42704736713517844 0.1387511965001427 -0.89352037004910567
+0.30401279487901056 0.33566720821021839 -0.891573746743482  0.30422052318316667 0.3355025674440707 -0.89156486051918682
+0.41838703947458189 0.27466844612618385 -0.86574218443040085  0.41835586417422255 0.27447137325094917 -0.86581974808661977
+0 -0.90291461058653233 0.42981996927710414  -0.00028436728304534936 -0.9030098027816339 0.42961984965260047
+0.13899360672691585 -0.89342795031552757 0.42716188369754932  0.1387511965001427 -0.89352037004910567 0.42704736713517844
+0.40151480227572495 -0.69274920908571347 -0.59888293763788791  0.39881277493422806 -0.66927944610495271 -0.62690780308647331
+0.27466844612618385 -0.86574218443040085 0.41838703947458189  0.274471373250952 -0.86581974808661777 0.4183558641742246
+-0.068715700526218768 -0.9453832490724946 -0.31863563026492325  -0.068382200701545368 -0.94544807568691724 -0.31851500876272509
+0 -0.97933072349169759 -0.20226550379446337  2.7784890263213511e-17 -0.97927332546590873 -0.20254321521823496
+0.19739352602284616 -0.97703158208487906 -0.080281277350241265  0.19714040391716284 -0.97707738033578373 -0.080345839839658581
+0.066381045638217229 -0.9944708773603258 -0.081370946056690249  0.066331699036312544 -0.99445714115859507 -0.081578796887611743
+0.95069104161024875 0.185674705522129 0.24579255546759909  0.95608513245170423 0.17856129650966351 0.23241575440058895
+0.66689476317101137 -0.26866388572512034 -0.69462568959831961  0.64422625268359979 -0.27076651461112894 -0.71530275402698396
+0.62443505191569915 -0.33636614204180315 -0.70422028778974766  0.60701252203428802 -0.33806887798060248 -0.71919763058182384
+0.29401138453262832 -0.86471241548978517 0.4056780940788991  0.30717055145208833 -0.86468532536853859 0.39744878967349306
+0.5493198212532957 -0.45674068614295493 -0.69911600851089584  0.5435262718016699 -0.43623030388675949 -0.71713479474380737
+0.21254447256850684 0.89390471712616404 0.39369586600014284  0.23042761042598114 0.87734110809753774 0.42092243512974803
+0.90387507728811034 0.34253810440658677 0.25355721782048279  0.90894237800239264 0.3488969399841263 0.22824258748329265
+0.89844705357522048 0.37311241287933194 0.22843691950085848  0.90894237800239619 0.34889693998411053 0.22824258748330289
+0.87149140923129176 0.45766135056489032 0.17031256632806041  0.87265298324518492 0.4603681578214775 0.16290466567087158
+0.75815048575026589 0.64339140453754129 0.098424941615366732  0.7480416949938824 0.65387638494523026 0.1134869849878684
+0.6771336059462687 0.72858929180595311 0.094046635219543206  0.67452766723137314 0.73279395097326827 0.089584884642384455
+0.66096525556418162 0.74328545761836973 0.095572989323982643  0.67452766723138358 0.73279395097325961 0.089584884642376475
+-0.62457262167826666 -0.75674166021493738 -0.19300544019554747  -0.62484261256047768 -0.75636980999592551 -0.19358827458119579
+-0.719915307065364 -0.68063975088704354 -0.135836225526941  -0.72008099426245631 -0.68041269101920543 -0.13609530337963674
+-0.55392361119767786 -0.82440895259656954 -0.11626913535565189  -0.55402560894563302 -0.82413049582749986 -0.11774782579538202
+-0.48516082808530336 -0.87376742805233321 -0.033903577486650911  -0.48348770334523589 -0.87467833713118348 -0.034313951497558594
+-0.42981996927710414 0 -0.90291461058653233  -0.42961984965260003 0.00028436728304541534 -0.90300980278163412
+-0.42716188369754932 -0.13899360672691585 -0.89342795031552757  -0.42704736713517844 -0.13875119650014309 -0.89352037004910567
+-0.30401279487901056 -0.33566720821021839 -0.891573746743482  -0.30422052318316667 -0.3355025674440707 -0.89156486051918682
+-0.41838703947458189 -0.27466844612618385 -0.86574218443040085  -0.41835586417422255 -0.27447137325094917 -0.86581974808661977
+-0.9453832490724946 0.31863563026492325 0.068715700526218768  -0.94544807568691736 0.31851500876272509 0.068382200701545048
+-0.97933072349169759 0.20226550379446331 0  -0.97927332546590884 0.20254321521823487 0
+-0.97703158208487906 0.080281277350241265 -0.19739352602284616  -0.97707738033578007 0.080345839839677496 -0.1971404039171733
+-0.9944708773603258 0.081370946056690249 -0.066381045638217229  -0.99445714115859507 0.081578796887611701 -0.066331699036312544
+-0.3186356302649232 -0.068715700526218768 0.9453832490724946  -0.31851500876272504 -0.068382200701545631 0.94544807568691724
+-0.42716188369754926 -0.13899360672691591 0.89342795031552769  -0.42704736713517871 -0.13875119650014189 0.89352037004910567
+-0.62340222914316235 -0.13827368218737227 0.76957783850217643  -0.62320039727703669 -0.13836216352689706 0.76972539034249077
+-0.52579382752597525 -0.20828740048796671 0.8247164420172246  -0.52568280774650511 -0.20813967421463669 0.82482450355064985
+-0.62674761880757135 0.51556327979539029 0.58427898032160919  -0.62647295099493483 0.51565247738810616 0.5844947940189088
+-0.69116244652106418 0.55216883979414833 0.46626606661797837  -0.6909771548308743 0.55222595833073052 0.46647300291392674
+-0.68929656115193505 0.6730187872058685 0.26817151760031971  -0.68937955050281263 0.67285685715261312 0.2683644632421513
+-0.74334549596053445 0.57608383788574413 0.33994835690442576  -0.74324570666303813 0.57610127698437352 0.34013694034011532
+-0.31863563026492325 0.068715700526218768 0.9453832490724946  -0.31897512469198169 0.068666567984591392 0.94527232704070641
+-0.20226550379446331 0 0.97933072349169759  -0.20254321521823346 0 0.97927332546590906
+-0.080281277350241265 -0.19739352602284616 0.97703158208487906  -0.080345839839677552 -0.19714040391717327 0.97707738033578018
+-0.081370946056690249 -0.066381045638217229 0.9944708773603258  -0.081578796887611757 -0.066331699036312544 0.99445714115859518
+0.31222404809805682 0.2811508450273621 0.90641151615731874  0.30687826798314805 0.2927056677356295 0.90562084821138178
+0.29107512591583118 0.30186484921791523 0.90688305806336111  0.30687826798317108 0.29270566773561474 0.90562084821137867
+0.25988381527545967 0.33544566672286746 0.9046373499048469  0.26377483182397715 0.35458300388088293 0.89704722922209745
+0.57608383788574413 -0.33994835690442576 0.74334549596053445  0.57610127698437374 -0.34013694034011549 0.74324570666303802
+0.3186356302649232 0.068715700526218768 0.9453832490724946  0.31897512469198191 0.068666567984591337 0.94527232704070629
+0.42716188369754932 0.13899360672691591 0.89342795031552757  0.31839526977291882 0.22370787894634658 0.92118360660812726
+-0.76383628095354983 -0.37149736972483099 -0.52777252693426735  -0.76364675610270738 -0.37176976328896 -0.52785497534633763
+-0.82178222598517658 -0.40100492526839776 -0.40480738995889742  -0.82172156155091924 -0.40115992505182002 -0.404776963048463
+0.9453832490724946 0.3186356302649232 0.068715700526218768  0.94544807568691724 0.31851500876272504 0.06838220070154534
+0.89342795031552757 0.42716188369754932 0.13899360672691591  0.89352037004910545 0.42704736713517855 0.13875119650014364
+-0.67170915887432037 -0.45126666560725853 -0.58750761901107262  -0.67165289641182357 -0.45152335920120762 -0.58737470394737412
+-0.56664784959934433 -0.52372394783737519 -0.63610018157997195  -0.56692430597377874 -0.5234294246654746 -0.6360962731305061
+-0.90172313788306901 -0.18656099607880575 -0.38998766307204569  -0.9017971537002798 -0.18714545413041742 -0.38953622755321987
+-0.84103330267207554 -0.28407954462258922 -0.46039308870086582  -0.84103034646625274 -0.28440717777405622 -0.46019616855581386
+-0.8962672300889245 -0.071858277492354974 -0.43765447584202588  -0.89681281808791957 -0.072536964263670914 -0.43642314114700098
+-0.87376742805233321 0.033903577486650911 -0.48516082808530336  -0.87467833713118348 0.034313951497558608 -0.48348770334523583
+0.068715700526218768 0.9453832490724946 -0.31863563026492325  0.068666567984591129 0.94527232704070629 -0.31897512469198203
+0 0.97933072349169759 -0.20226550379446331  0 0.97927332546590884 -0.20254321521823487
+-0.19739352602284616 0.97703158208487906 -0.080281277350241265  -0.1971404039171733 0.97707738033578007 -0.080345839839677496
+-0.066381045638217229 0.9944708773603258 -0.081370946056690249  -0.066331699036312544 0.99445714115859507 -0.081578796887611701
+0 0.90291461058653233 0.4298199692771042  0.00028436728304585471 0.90300980278163401 0.42961984965260025
+-0.13899360672691585 0.89342795031552757 0.42716188369754932  -0.13875119650014286 0.89352037004910567 0.42704736713517849
+-0.33566720821021839 0.891573746743482 0.30401279487901056  -0.33550256744406903 0.89156486051918726 0.30422052318316689
+-0.27466844612618391 0.86574218443040074 0.41838703947458195  -0.274471373250949 0.86581974808661977 0.41835586417422232
+-0.90291461058653233 0.42981996927710414 0  -0.90300980278163412 0.42961984965259997 -0.00028436728304565326
+-0.89342795031552757 0.42716188369754932 0.13899360672691585  -0.89352037004910645 0.42704736713517727 0.13875119650014212
+-0.891573746743482 0.30401279487901056 0.33566720821021839  -0.89156486051918737 0.30422052318316695 0.33550256744406909
+-0.86574218443040074 0.41838703947458195 0.27466844612618391  -0.86581974808662021 0.4183558641742216 0.27447137325094856
+-0.51556327979539029 0.58427898032160919 0.62674761880757135  -0.51565247738810616 0.5844947940189088 0.62647295099493483
+-0.55216883979414844 0.46626606661797843 0.69116244652106429  -0.55222595833073018 0.46647300291392751 0.69097715483087396
+-0.6730187872058685 0.26817151760031971 0.68929656115193505  -0.67285685715261312 0.2683644632421513 0.68937955050281263
+-0.57608383788574413 0.33994835690442576 0.74334549596053445  -0.57610127698437363 0.34013694034011532 0.74324570666303824
+-0.62674761880757146 -0.51556327979539029 0.58427898032160919  -0.62675731827798087 -0.51582822603431722 0.58403467808965182
+-0.55216883979414844 -0.46626606661797826 0.6911624465210644  -0.55222595833073085 -0.46647300291392696 0.69097715483087385
+-0.35362935294171677 -0.46556504362316592 0.81129246939324073  -0.35387698305874388 -0.46550486715932382 0.81121902067950891
+-0.46867704983435055 -0.40632940254264294 0.78437123837371081  -0.46877433341209007 -0.40646863937642824 0.78424095119900861
+0.51556327979539029 0.58427898032160919 -0.62674761880757135  0.51565247738810593 0.58449479401890858 -0.62647295099493516
+0.55216883979414844 0.46626606661797843 -0.69116244652106429  0.55222595833073018 0.46647300291392751 -0.69097715483087396
+0.6730187872058685 0.26817151760031971 -0.68929656115193505  0.67285685715261312 0.2683644632421513 -0.68937955050281263
+0.57608383788574413 0.33994835690442576 -0.74334549596053445  0.57610127698437363 0.34013694034011532 -0.74324570666303824
+0.51873480041451092 0.13843733448120876 0.84282425105969128  0.53130823737479249 0.11550620576389506 0.83926746233112115
+0.5512195414246408 0.12458499692215487 0.82416586116838453  0.53130823737479238 0.11550620576389389 0.83926746233112148
+0.35362935294171677 -0.46556504362316592 -0.81129246939324073  0.35387698305874388 -0.46550486715932382 -0.81121902067950891
+0.46867704983435055 -0.40632940254264294 -0.78437123837371081  0.46877433341209007 -0.40646863937642824 -0.78424095119900861
+0.31863563026492325 0.068715700526218768 -0.9453832490724946  0.31897512469198169 0.068666567984591392 -0.94527232704070641
+0.20226550379446331 0 -0.97933072349169759  0.20254321521823346 0 -0.97927332546590906
+0.080281277350241265 -0.19739352602284616 -0.97703158208487906  0.080345839839677552 -0.19714040391717327 -0.97707738033578018
+0.081370946056690249 -0.066381045638217229 -0.9944708773603258  0.081578796887611757 -0.066331699036312544 -0.99445714115859518
+-0.51556327979539029 -0.58427898032160919 -0.62674761880757135  -0.51565247738810593 -0.58449479401890858 -0.62647295099493516
+-0.55216883979414844 -0.46626606661797843 -0.69116244652106429  -0.55222595833073018 -0.46647300291392751 -0.69097715483087396
+-0.6730187872058685 -0.26817151760031971 -0.68929656115193505  -0.67285685715261312 -0.2683644632421513 -0.68937955050281263
+-0.57608383788574413 -0.33994835690442576 -0.74334549596053445  -0.57610127698437363 -0.34013694034011532 -0.74324570666303824
+-0.3186356302649232 0.068715700526218768 -0.9453832490724946  -0.31897512469198191 0.068666567984591337 -0.94527232704070629
+-0.42716188369754932 0.13899360672691591 -0.89342795031552757  -0.42704736713517866 0.13875119650014203 -0.89352037004910567
+-0.62340222914316235 0.13827368218737227 -0.76957783850217643  -0.62320039727703669 0.13836216352689706 -0.76972539034249077
+-0.52579382752597525 0.20828740048796671 -0.8247164420172246  -0.52568280774650511 0.20813967421463669 -0.82482450355064985
+-0.9453832490724946 0.3186356302649232 -0.068715700526218768  -0.94544807568691724 0.31851500876272504 -0.068382200701545062
+-0.89342795031552769 0.42716188369754926 -0.13899360672691591  -0.89352037004910556 0.4270473671351786 -0.13875119650014353
+-0.76957783850217643 0.62340222914316235 -0.13827368218737227  -0.76972539034249154 0.62320039727703591 -0.13836216352689656
+-0.8247164420172246 0.52579382752597525 -0.20828740048796671  -0.82482450355065018 0.52568280774650522 -0.20813967421463545
+-0.51556327979539029 0.58427898032160919 -0.62674761880757146  -0.51582822603431722 0.58403467808965182 -0.62675731827798087
+-0.46626606661797826 0.6911624465210644 -0.55216883979414844  -0.4664730029139269 0.69097715483087385 -0.55222595833073085
+-0.46556504362316592 0.81129246939324073 -0.35362935294171677  -0.46550486715932382 0.81121902067950891 -0.35387698305874388
+-0.40632940254264294 0.78437123837371081 -0.46867704983435055  -0.40646863937642774 0.78424095119900938 -0.46877433341208924
+-0.068715700526218768 0.9453832490724946 0.31863563026492325  -0.068382200701545173 0.94544807568691736 0.31851500876272476
+0 0.97933072349169759 0.20226550379446331  0 0.97927332546590884 0.20254321521823487
+0.19739352602284616 0.97703158208487906 0.080281277350241265  0.1971404039171733 0.97707738033578007 0.080345839839677496
+0.066381045638217229 0.9944708773603258 0.081370946056690249  0.066331699036312544 0.99445714115859507 0.081578796887611701
+0 0.90291461058653233 -0.42981996927710414  -0.00028436728304565326 0.90300980278163412 -0.42961984965259997
+0.13899360672691585 0.89342795031552757 -0.42716188369754932  0.13875119650014286 0.89352037004910567 -0.42704736713517849
+0.33566720821021839 0.891573746743482 -0.30401279487901056  0.33550256744406903 0.89156486051918726 -0.30422052318316689
+0.27466844612618391 0.86574218443040074 -0.41838703947458195  0.274471373250949 0.86581974808661977 -0.41835586417422232
+0.90291461058653233 0.42981996927710414 0  0.90300980278163412 0.42961984965260003 0.00028436728304541534
+0.89342795031552757 0.42716188369754932 -0.13899360672691585  0.89352037004910645 0.42704736713517727 -0.13875119650014231
+0.891573746743482 0.30401279487901056 -0.33566720821021839  0.89156486051918737 0.30422052318316695 -0.33550256744406909
+0.86574218443040085 0.41838703947458189 -0.27466844612618385  0.86581974808662054 0.41835586417422127 -0.27447137325094839
+0.15594877494016779 0.48342144068564119 0.86055952199012919  0.13902973540248587 0.4816564885202882 0.86526167125339615
+0.14688267020077073 0.50017470245974227 0.85269038907862316  0.13902973540250271 0.48165648852027348 0.8652616712534017
+0.098424941615366676 0.758150485750266 0.64339140453754151  0.11348698498784857 0.74804169499390571 0.65387638494520695
+0.14854713354961635 0.85435218642293975 0.49724573572225772  0.18463389628076735 0.84903903628469102 0.49501822108781618
+0.42981996927710414 0 0.90291461058653233  0.42961984965260003 0.00028436728304541534 0.90300980278163412
+0.42716188369754932 -0.13899360672691585 0.89342795031552757  0.42704736713517844 -0.13875119650014309 0.89352037004910567
+0.30401279487901056 -0.33566720821021839 0.891573746743482  0.30422052318316667 -0.3355025674440707 0.89156486051918682
+0.41838703947458189 -0.27466844612618385 0.86574218443040085  0.41835586417422255 -0.27447137325094917 0.86581974808661977
+0.66704995977036097 0.095052466200525487 0.73781627941851213  0.68096837004796118 0.091975091050968211 0.72651404777911166
+0.69602657944578872 0.09312926541647408 0.71089969747156689  0.68096837004796906 0.091975091050976843 0.72651404777910311
+0.26817151760031971 -0.68929656115193505 0.6730187872058685  0.2683644632421513 -0.68937955050281263 0.67285685715261312
+0.33994835690442576 -0.74334549596053445 0.57608383788574413  0.34013694034011793 -0.74324570666303691 0.57610127698437374
+-0.51556327979539029 -0.58427898032160919 0.62674761880757146  -0.51565247738810605 -0.58449479401890814 0.62647295099493561
+-0.46626606661797837 -0.69116244652106429 0.55216883979414833  -0.46647300291392657 -0.69097715483087407 0.55222595833073074
+-0.46556504362316592 -0.81129246939324073 0.35362935294171677  -0.46550486715932382 -0.81121902067950891 0.35387698305874388
+-0.40632940254264294 -0.78437123837371081 0.46867704983435055  -0.40646863937642774 -0.78424095119900938 0.46877433341208924
+0.068715700526218768 -0.9453832490724946 0.31863563026492325  0.068666567984591392 -0.94527232704070641 0.31897512469198169
+0 -0.97933072349169759 0.20226550379446331  0 -0.97927332546590884 0.20254321521823487
+-0.19739352602284616 -0.97703158208487906 0.080281277350241265  -0.19714040391717327 -0.97707738033578007 0.080345839839677538
+-0.066381045638217229 -0.9944708773603258 0.081370946056690249  -0.066331699036312544 -0.99445714115859507 0.081578796887611743
+-0.58427898032160919 -0.62674761880757146 -0.51556327979539029  -0.58449479401890791 -0.62647295099493572 -0.51565247738810627
+-0.46626606661797826 -0.69116244652106429 -0.55216883979414844  -0.4664730029139274 -0.69097715483087396 -0.5522259583307304
+-0.26817151760031971 -0.68929656115193505 -0.6730187872058685  -0.2683644632421513 -0.68937955050281263 -0.67285685715261312
+-0.33994835690442576 -0.74334549596053445 -0.57608383788574413  -0.34013694034011527 -0.74324570666303813 -0.57610127698437352
+0.068715700526218768 -0.9453832490724946 -0.3186356302649232  0.068666567984591337 -0.94527232704070629 -0.31897512469198191
+0.13899360672691591 -0.89342795031552757 -0.42716188369754932  0.13875119650014367 -0.89352037004910556 -0.4270473671351786
+0.13827368218737227 -0.76957783850217643 -0.62340222914316235  0.13836216352689706 -0.76972539034249077 -0.62320039727703669
+0.20828740048796671 -0.8247164420172246 -0.52579382752597525  0.20813967421463669 -0.82482450355064985 -0.52568280774650511
+0.3186356302649232 -0.068715700526218768 -0.9453832490724946  0.31851500876272504 -0.068382200701545631 -0.94544807568691724
+0.42716188369754926 -0.13899360672691591 -0.89342795031552769  0.42704736713517871 -0.13875119650014189 -0.89352037004910567
+0.62340222914316235 -0.13827368218737227 -0.76957783850217643  0.62320039727703669 -0.13836216352689706 -0.76972539034249077
+0.52579382752597525 -0.20828740048796671 -0.8247164420172246  0.52568280774650511 -0.20813967421463669 -0.82482450355064985
+0.88304523202927676 0.18950565604187922 0.42721864490060907  0.88441806965928871 0.18329374350459135 0.4291946896831445
+0.87684117534766193 0.17811496227257195 0.44486756488630008  0.8844180696592876 0.18329374350459152 0.42919468968314661
+0.90105806124803878 0.23967742655656488 0.35918321758479488  0.89982453013548236 0.22723563663234575 0.37239734211021303
+0.89436470058605533 0.21570896554595267 0.38998187620182156  0.89982453013547437 0.22723563663234558 0.37239734211023262
+0.9453832490724946 0.31863563026492325 -0.068715700526218768  0.94544807568691724 0.31851500876272509 -0.068382200701545368
+0.34253810440658672 0.25355721782048268 0.90387507728811034  0.34889693998411497 0.22824258748330126 0.90894237800239497
+0.37311241287933189 0.22843691950085854 0.8984470535752207  0.3488969399841278 0.22824258748331513 0.90894237800238653
+0.89390471712616404 0.39369586600014284 0.21254447256850695  0.87734110809754062 0.42092243512973737 0.23042761042598958
+0.87689701064830428 0.44478929974988757 0.17773204761375266  0.88583486239282283 0.42585755017736876 0.1842333941673405
+0.88125255845135109 0.43210633013751554 0.18610643753537598  0.88583486239282105 0.42585755017737281 0.18423339416733958
+0.30186484921791523 0.90688305806336122 0.29107512591583129  0.29270566773562828 0.90562084821138356 0.30687826798314405
+0.2811508450273621 0.90641151615731863 0.31222404809805682  0.29270566773562823 0.90562084821138122 0.3068782679831506
+0.62674761880757135 0.51556327979539029 -0.58427898032160919  0.62647295099493561 0.51565247738810638 -0.5844947940189078
+0.69116244652106418 0.55216883979414833 -0.46626606661797837  0.6909771548308743 0.55222595833073052 -0.46647300291392674
+0.68929656115193505 0.6730187872058685 -0.26817151760031971  0.68937955050281263 0.67285685715261312 -0.2683644632421513
+0.74334549596053445 0.57608383788574413 -0.33994835690442576  0.7432457066630378 0.57610127698437341 -0.34013694034011649
+0 -0.90291461058653233 -0.42981996927710414  0.00028436728304541534 -0.90300980278163412 -0.42961984965260003
+-0.13899360672691585 -0.89342795031552757 -0.42716188369754932  -0.13875119650014309 -0.89352037004910567 -0.42704736713517844
+-0.33566720821021839 -0.891573746743482 -0.30401279487901056  -0.33550256744406903 -0.89156486051918726 -0.30422052318316689
+-0.27466844612618385 -0.86574218443040085 -0.41838703947458189  -0.27447137325094839 -0.86581974808662054 -0.41835586417422127
+-0.90291461058653233 -0.4298199692771042 0  -0.9030098027816339 -0.42961984965260047 -0.00028436728304622979
+-0.89342795031552757 -0.42716188369754932 -0.13899360672691585  -0.89352037004910645 -0.42704736713517727 -0.13875119650014195
+-0.891573746743482 -0.30401279487901056 -0.33566720821021839  -0.89156486051918737 -0.30422052318316695 -0.33550256744406909
+-0.86574218443040085 -0.41838703947458189 -0.27466844612618385  -0.86581974808662054 -0.41835586417422127 -0.27447137325094839
+-0.62674761880757135 -0.51556327979539029 -0.58427898032160919  -0.62647295099493561 -0.51565247738810638 -0.5844947940189078
+-0.69116244652106418 -0.55216883979414833 -0.46626606661797837  -0.6909771548308743 -0.55222595833073052 -0.46647300291392674
+-0.68929656115193505 -0.6730187872058685 -0.26817151760031971  -0.68937955050281263 -0.67285685715261312 -0.2683644632421513
+-0.74334549596053445 -0.57608383788574413 -0.33994835690442576  -0.7432457066630378 -0.57610127698437341 -0.34013694034011649
+-0.58427898032160919 -0.62674761880757135 0.51556327979539029  -0.58449479401890803 -0.62647295099493561 0.51565247738810616
+-0.69116244652106429 -0.55216883979414833 0.46626606661797837  -0.69097715483087396 -0.55222595833073074 0.46647300291392696
+-0.81129246939324073 -0.35362935294171677 0.46556504362316592  -0.81121902067950891 -0.35387698305874388 0.46550486715932382
+-0.78437123837371081 -0.46867704983435055 0.40632940254264294  -0.78424095119900861 -0.46877433341209007 0.40646863937642824
+-0.9453832490724946 -0.3186356302649232 0.068715700526218768  -0.94544807568691736 -0.31851500876272482 0.068382200701545479
+-0.89342795031552769 -0.42716188369754926 0.13899360672691591  -0.89352037004910556 -0.4270473671351786 0.13875119650014353
+-0.76957783850217643 -0.62340222914316235 0.13827368218737227  -0.76972539034249077 -0.62320039727703669 0.13836216352689706
+-0.8247164420172246 -0.52579382752597525 0.20828740048796671  -0.82482450355064985 -0.52568280774650511 0.20813967421463669
+-0.068715700526218768 -0.9453832490724946 0.3186356302649232  -0.068382200701545631 -0.94544807568691724 0.31851500876272504
+-0.13899360672691591 -0.89342795031552769 0.42716188369754926  -0.13875119650014353 -0.89352037004910556 0.4270473671351786
+-0.13827368218737227 -0.76957783850217643 0.62340222914316235  -0.13836216352689706 -0.76972539034249077 0.62320039727703669
+-0.20828740048796671 -0.8247164420172246 0.52579382752597525  -0.20813967421463669 -0.82482450355064985 0.52568280774650511
+-0.58427898032160919 0.62674761880757146 -0.51556327979539029  -0.58449479401890814 0.62647295099493561 -0.51565247738810605
+-0.69116244652106429 0.55216883979414833 -0.46626606661797837  -0.69097715483087407 0.55222595833073074 -0.46647300291392657
+-0.81129246939324073 0.35362935294171677 -0.46556504362316592  -0.81121902067950891 0.35387698305874388 -0.46550486715932382
+-0.78437123837371081 0.46867704983435055 -0.40632940254264294  -0.78424095119900861 0.46877433341209007 -0.40646863937642824
+-0.9453832490724946 -0.31863563026492325 -0.068715700526218768  -0.94527232704070596 -0.31897512469198297 -0.068666567984592197
+-0.97933072349169759 -0.20226550379446331 0  -0.97927332546590884 -0.20254321521823487 0
+-0.97703158208487906 -0.080281277350241265 0.19739352602284616  -0.97707738033578007 -0.080345839839677496 0.1971404039171733
+-0.9944708773603258 -0.081370946056690249 0.066381045638217229  -0.99445714115859507 -0.081578796887611701 0.066331699036312544
+0 0.57392154628557113 0.8189102873387164  -0.00078604920685557318 0.5753806981945353 0.81788534298629756
+0.11626913535565189 0.55392361119767786 0.82440895259656954  0.065815526689251905 0.70990039054589715 0.70122018792202434
+-0.52777252693426735 -0.76383628095354983 -0.37149736972483099  -0.52785497534633763 -0.76364675610270738 -0.37176976328896
+-0.40480738995889742 -0.82178222598517658 -0.40100492526839776  -0.40477696304846211 -0.82172156155092035 -0.4011599250518188
+0.28075529872380572 0 0.95977938206574664  0.28060440841513695 0.0003721272683771568 0.95982343558557015
+0.27889813733511903 0.13624095340381404 0.9506072962094394  0.27889806070390522 0.13594944033505713 0.95064905270461686
+-0.58750761901107262 -0.67170915887432037 -0.45126666560725853  -0.58737470394737434 -0.67165289641182369 -0.45152335920120712
+0.2726998137406515 0.26911716736226499 0.9236940845413727  0.27282039415738785 0.26880216379452343 0.92375019852295015
+-0.054857140713616914 0.54001796879892028 0.83986385056568236  -0.05679299414488595 0.53979489236345513 0.83987858050695929
+0 0.62578188869003271 0.77999809473327264  -0.00023519417927787435 0.6269431253853307 0.77906499229253756
+-0.63610018157997184 -0.56664784959934433 -0.52372394783737508  -0.63632626043050544 -0.56632219140540152 -0.52380155193385247
+0.067277074024322203 0.70227702532207648 0.70871769768752158  0.067501320615792407 0.70276863564904002 0.70820887911908503
+-0.38998766307204569 -0.90172313788306901 -0.18656099607880575  -0.38953622755321987 -0.9017971537002798 -0.18714545413041742
+-0.46039308870086582 -0.84103330267207554 -0.28407954462258922  -0.4601961685558138 -0.84103034646625274 -0.28440717777405627
+-0.43765447584202588 -0.8962672300889245 -0.071858277492354974  -0.43642314114700076 -0.89681281808791968 -0.072536964263670553
+-0.48516082808530336 -0.87376742805233321 0.033903577486650911  -0.48348770334523583 -0.87467833713118348 0.034313951497558608
+-0.033903577486650918 0.48516082808530342 0.87376742805233332  -0.034313951497558351 0.48348770334523589 0.87467833713118359
+-0.11626913535565189 0.55392361119767786 0.82440895259656954  -0.11760246779863226 0.55440616112166063 0.82389530164822211
+-0.135836225526941 0.719915307065364 0.68063975088704354  -0.13609530337963602 0.72008099426245753 0.68041269101920443
+-0.19300544019554747 0.62457262167826666 0.75674166021493738  -0.1935882745811939 0.62484261256047813 0.75636980999592551
+0.069452331980627613 0.9168554803037775 0.39313153246640248  0.069774081725102591 0.91693066884564145 0.3928991296117913
+0 0.86640575634619166 0.4993406306021807  0.00015872199696782705 0.86652958223713705 0.49912569350341041
+-0.20731239180326447 0.78076816785433134 0.58942568680894825  -0.20735457304096533 0.78085960551688749 0.5892897059265586
+-0.069740197633308881 0.8004723406749189 0.59529852733606181  -0.069662907281838451 0.80067536950372598 0.59503447968929801
+0.033903577486650918 0.48516082808530342 0.87376742805233332  0.034313951497558344 0.48348770334523583 0.87467833713118359
+-0.071858277492354974 0.43765447584202588 0.8962672300889245  -0.072536964263671941 0.43642314114700054 0.89681281808791968
+-0.28407954462258922 0.46039308870086582 0.84103330267207554  -0.28440717777405611 0.46019616855581419 0.84103034646625263
+-0.18656099607880575 0.38998766307204569 0.90172313788306901  -0.18714545413041742 0.38953622755321987 0.9017971537002798
+-0.52372394783737519 0.63610018157997195 0.56664784959934433  -0.5234294246654746 0.63609627313050621 0.56692430597377874
+-0.45126666560725853 0.58750761901107262 0.67170915887432037  -0.45152335920120762 0.58737470394737412 0.67165289641182357
+-0.40100492526839776 0.40480738995889742 0.82178222598517658  -0.40115992505182058 0.40477696304846233 0.82172156155091935
+-0.37149736972483099 0.52777252693426735 0.76383628095354983  -0.37176976328896005 0.52785497534633763 0.76364675610270738
+0.054857140713616914 0.54001796879892028 0.83986385056568236  0.056307189018219413 0.54106674669697685 0.83909253130010386
+0.071858277492354974 0.43765447584202588 0.8962672300889245  0.072917516439698266 0.4366583353262774 0.89666746009117038
+-0.039734588558411582 0.26026494835742225 0.96471929550963276  -0.039677999129164934 0.25990051397960151 0.96481986879326076
+0.077704403643809677 0.32271058904772337 0.94330265629374277  0.077926023088562835 0.32203490693742848 0.94351526412634279
+-0.39313153246640237 0.069452331980627585 0.9168554803037775  -0.39289912961179174 0.069774081725103118 0.91693066884564123
+-0.27889813733511903 0.13624095340381404 0.9506072962094394  -0.27889806070390516 0.13594944033505715 0.95064905270461686
+-0.040522281668716874 0.13192856911395229 0.99043061207734606  -0.040575895565417616 0.13176921185868207 0.99044963097837835
+-0.15985780358782284 0.19937696972895624 0.96679589706089264  -0.16010344242024357 0.19913925651268632 0.96680424297825784
+-0.054857140713616914 0.54001796879892028 -0.83986385056568236  -0.056307189018220224 0.54106674669697574 -0.83909253130010464
+-0.071858277492354974 0.43765447584202588 -0.8962672300889245  -0.072917516439698168 0.43665833532627857 -0.89666746009116982
+0.039734588558411582 0.26026494835742225 -0.96471929550963276  0.0396779991291649 0.25990051397960151 -0.96481986879326076
+-0.077704403643809677 0.32271058904772337 -0.94330265629374277  -0.077926023088562835 0.32203490693742848 -0.94351526412634279
+0.39313153246640237 0.069452331980627585 -0.9168554803037775  0.39289912961179174 0.069774081725103118 -0.91693066884564123
+0.27889813733511903 0.13624095340381404 -0.9506072962094394  0.27889806070390516 0.13594944033505715 -0.95064905270461686
+0.040522281668716874 0.13192856911395229 -0.99043061207734606  0.040575895565417575 0.13176921185868209 -0.99044963097837835
+0.15985780358782284 0.19937696972895624 -0.96679589706089264  0.16010344242024357 0.19913925651268632 -0.96680424297825784
+0 0.57392154628557113 -0.8189102873387164  0.00078604920685477976 0.57538069819453541 -0.81788534298629734
+-0.11626913535565189 0.55392361119767786 -0.82440895259656954  -0.11760246779863304 0.55440616112166041 -0.82389530164822211
+-0.25952221836449818 0.39610117388436322 -0.88076789123048704  -0.25988482570664351 0.39599581735923556 -0.88070834559541811
+-0.23458495860622128 0.51571602924327076 -0.82401873423925942  -0.23530638500725787 0.51562318151862285 -0.82387113061171735
+-0.28075529872380572 0 -0.95977938206574664  -0.28060440841513695 0.0003721272683771568 -0.95982343558557015
+-0.27889813733511903 0.13624095340381404 -0.9506072962094394  -0.27889806070390522 0.13594944033505713 -0.95064905270461686
+-0.37596077789543381 0.33924096091721673 -0.86230450765389344  -0.37608264246842454 0.33912378489964873 -0.86229745711633865
+-0.2726998137406515 0.26911716736226499 -0.9236940845413727  -0.27282039415738829 0.26880216379452371 -0.92375019852294993
+0.054857140713616914 0.54001796879892028 -0.83986385056568236  0.056792994144885985 0.53979489236345579 -0.83987858050695885
+0 0.62578188869003271 -0.77999809473327264  0.00023519417927737779 0.6269431253853307 -0.77906499229253756
+-0.20012814034344362 0.68018071850695239 -0.70519707714513458  -0.20029565457621276 0.68040299513329217 -0.7049350430866177
+-0.067277074024322203 0.70227702532207648 -0.70871769768752158  -0.067501320615791865 0.70276863564904002 -0.70820887911908503
+-0.56664784959934422 0.52372394783737519 -0.63610018157997195  -0.56632219140540241 0.52380155193385225 -0.63632626043050478
+-0.45126666560725853 0.58750761901107273 -0.67170915887432037  -0.45152335920120679 0.5873747039473749 -0.67165289641182357
+-0.27287882084494514 0.74024588618561449 -0.61446983418191203  -0.27300775118977977 0.74028370995146886 -0.6143669885099533
+-0.32839555720531111 0.64061453708709604 -0.69409608332024086  -0.3287157188336513 0.64057192708348343 -0.69398384882087016
+0.033903577486650918 0.48516082808530342 -0.87376742805233332  0.034313951497558712 0.48348770334523578 -0.87467833713118359
+0.11626913535565189 0.55392361119767786 -0.82440895259656954  0.11774782579538202 0.55402560894563302 -0.82413049582749998
+0.135836225526941 0.719915307065364 -0.68063975088704354  0.13609530337963627 0.72008099426245709 -0.68041269101920487
+0.19300544019554747 0.62457262167826666 -0.75674166021493738  0.1935882745811939 0.62484261256047813 -0.75636980999592551
+-0.069452331980627585 0.9168554803037775 -0.39313153246640237  -0.069774081725102299 0.91693066884564156 -0.39289912961179124
+0 0.86640575634619166 -0.4993406306021807  -0.00015872199696793297 0.86652958223713705 -0.49912569350341024
+0.20731239180326447 0.78076816785433134 -0.58942568680894825  0.20735457304096533 0.78085960551688749 -0.5892897059265586
+0.069740197633308881 0.8004723406749189 -0.59529852733606181  0.069662907281838451 0.80067536950372598 -0.59503447968929801
+-0.033903577486650904 0.48516082808530331 -0.87376742805233321  -0.035585805831080376 0.48427375255209071 -0.87419253200451719
+0.071858277492354974 0.43765447584202588 -0.8962672300889245  0.07253696426367158 0.43642314114700032 -0.89681281808791979
+0.28407954462258922 0.46039308870086582 -0.84103330267207554  0.28440717777405627 0.46019616855581391 -0.84103034646625285
+0.18656099607880575 0.38998766307204569 -0.90172313788306901  0.18714545413041742 0.38953622755321987 -0.9017971537002798
+0.52372394783737508 0.63610018157997195 -0.56664784959934422  0.52380155193385236 0.63632626043050489 -0.56632219140540219
+0.45126666560725853 0.58750761901107262 -0.67170915887432037  0.45152335920120762 0.58737470394737412 -0.67165289641182357
+0.40100492526839776 0.40480738995889742 -0.82178222598517658  0.4011599250518203 0.40477696304846222 -0.82172156155091958
+0.37149736972483099 0.52777252693426735 -0.76383628095354983  0.37176976328896005 0.52785497534633763 -0.76364675610270738
+0.74328545761836984 0.095572989323982616 0.66096525556418162  0.73279395097326416 0.089584884642383344 0.6745276672313778
+0.72858929180595311 0.094046635219543179 0.67713360594626881  0.73279395097326727 0.089584884642385565 0.67452766723137403
+0.80253395542112949 0.58417903277383187 0.11307342108777621  0.79565076497465947 0.59478368364254086 0.11477033531295991
+0.78594000042913037 0.60770816150558526 0.10617487126239183  0.79565076497467102 0.5947836836425241 0.11477033531296656
+0.4576613505648901 0.17031256632806047 0.87149140923129198  0.46036815782147578 0.16290466567087075 0.87265298324518592
+0.33544566672286746 0.90463734990484679 0.25988381527545978  0.35458300388090036 0.89704722922209146 0.26377483182397471
+0.82416586116838464 0.5512195414246408 0.12458499692215486  0.8392674623311116 0.53130823737481137 0.11550620576387746
+0.84282425105969128 0.51873480041451114 0.13843733448120865  0.83926746233112337 0.53130823737479038 0.11550620576388952
+0.10617487126239186 0.78594000042913037 0.60770816150558549  0.11477033531296087 0.79565076497466702 0.59478368364253054
+0.11307342108777627 0.80253395542112949 0.58417903277383187  0.11477033531295956 0.79565076497466403 0.59478368364253487
+0.85435218642293986 0.49724573572225761 0.14854713354961632  0.84903903628470268 0.49501822108779592 0.18463389628076832
+0.21570896554595276 0.38998187620182151 0.89436470058605511  0.22723563663235583 0.37239734211019476 0.89982453013548735
+0.069452331980627585 -0.9168554803037775 0.39313153246640237  0.069774081725103118 -0.91693066884564123 0.39289912961179174
+0.13624095340381404 -0.9506072962094394 0.27889813733511903  0.13594944033505715 -0.95064905270461686 0.27889806070390516
+0.13192856911395229 -0.99043061207734606 0.040522281668716874  0.13176921185868212 -0.99044963097837846 0.040575895565417554
+0.19937696972895624 -0.96679589706089264 0.15985780358782284  0.19913925651268402 -0.96680424297825862 0.16010344242024122
+0.23967742655656482 0.35918321758479488 0.90105806124803833  0.22723563663231983 0.37239734211023184 0.89982453013548114
+0.12458499692215494 0.8241658611683842 0.55121954142464069  0.11550620576390451 0.8392674623311267 0.53130823737478172
+0.13843733448120885 0.84282425105969117 0.5187348004145107  0.11550620576389807 0.8392674623311176 0.53130823737479738
+0.35918321758479488 0.90105806124803856 0.23967742655656488  0.37239734211021447 0.8998245301354828 0.22723563663234123
+0 -0.95977938206574664 -0.28075529872380572  0.00037212726837715501 -0.95982343558557015 -0.28060440841513695
+0.13624095340381404 -0.9506072962094394 -0.27889813733511903  0.13594944033505713 -0.95064905270461686 -0.27889806070390522
+0.38998187620182156 0.89436470058605533 0.21570896554595276  0.37239734211022768 0.89982453013547636 0.22723563663234547
+0.12310298935169572 0.55521070025011254 0.82226795238624728  0.072892092607679745 0.73477483045466507 0.6743831932704073
+0.2284369195008584 0.89844705357522048 0.37311241287933194  0.22824258748331525 0.90894237800238609 0.34889693998412885
+0.25355721782048268 0.90387507728811034 0.34253810440658672  0.2282425874832984 0.90894237800239419 0.34889693998411864
+0.86055952199012919 0.15594877494016762 0.48342144068564141  0.86526167125339559 0.13902973540249128 0.48165648852028786
+0.85269038907862327 0.14688267020077067 0.50017470245974227  0.86526167125339637 0.13902973540249855 0.48165648852028436
+0.64339140453754151 0.098424941615366676 0.75815048575026589  0.65387638494521527 0.11348698498785581 0.74804169499389728
+0.51101182387798261 0.84695178356442291 0.1418121948905855  0.51974293683793993 0.84473325897900786 0.12764403935075805
+0.84695178356442291 0.1418121948905855 0.51101182387798261  0.84473325897900786 0.12764403935075805 0.51974293683793993
+0.50017470245974227 0.85269038907862327 0.14688267020077073  0.48165648852028398 0.86526167125339648 0.13902973540249844
+0.48342144068564125 0.86055952199012919 0.15594877494016779  0.48165648852028875 0.86526167125339737 0.13902973540247704
+0.1418121948905855 0.51101182387798283 0.84695178356442269  0.12764403935075835 0.51974293683794204 0.84473325897900642
+0.62479622481419628 0.77318510024650322 0.10194841255523895  0.6206862239227865 0.7793365693277452 0.085925101925648908
+0.60871986758868468 0.78560578771446699 0.10542210643598451  0.62068622392278427 0.77933656932774686 0.085925101925650921
+0.77318510024650355 0.10194841255523886 0.62479622481419606  0.77933656932772744 0.08592510192567096 0.62068622392280592
+0.78560578771446699 0.10542210643598442 0.60871986758868479  0.77933656932774609 0.085925101925648867 0.6206862239227855
+0.90463734990484679 0.25988381527545973 0.33544566672286741  0.8970472292220919 0.26377483182397643 0.35458300388089781
+0.10542210643598447 0.60871986758868468 0.78560578771446687  0.085925101925656111 0.62068622392277861 0.77933656932775075
+0.8189102873387164 0 0.57392154628557113  0.81788534298629723 0.00078604920685285812 0.57538069819453586
+0.82440895259656954 0.11626913535565189 0.55392361119767786  0.70122018792202434 0.065815526689251877 0.70990039054589715
+0.80047234067491879 0.59529852733606159 -0.069740197633308854  0.8006753695037262 0.59503447968929801 -0.069662907281838451
+0.78076816785433134 0.58942568680894825 -0.20731239180326447  0.78085960551688738 0.58928970592655827 -0.20735457304096649
+0.95977938206574664 0.28075529872380572 0  0.95982343558557026 0.2806044084151364 0.00037212726837936223
+0.9506072962094394 0.27889813733511903 0.13624095340381404  0.95064905270461697 0.27889806070390505 0.13594944033505701
+0.86640575634619166 0.49934063060218076 0  0.86652958223713716 0.49912569350341024 -0.00015872199696830458
+0.9236940845413727 0.2726998137406515 0.26911716736226499  0.92375019852295026 0.27282039415738757 0.26880216379452326
+0.033903577486650918 -0.48516082808530342 -0.87376742805233332  0.034313951497558337 -0.48348770334523583 -0.87467833713118359
+-0.071858277492354974 -0.43765447584202588 -0.8962672300889245  -0.07253696426367158 -0.43642314114700032 -0.89681281808791979
+-0.28407954462258922 -0.46039308870086582 -0.84103330267207554  -0.28440717777405627 -0.4601961685558138 -0.84103034646625285
+-0.18656099607880575 -0.38998766307204569 -0.90172313788306901  -0.18714545413041742 -0.38953622755321987 -0.9017971537002798
+-0.52372394783737508 -0.63610018157997195 -0.56664784959934422  -0.52380155193385236 -0.63632626043050489 -0.56632219140540219
+-0.45126666560725853 -0.58750761901107262 -0.67170915887432037  -0.45152335920120762 -0.58737470394737412 -0.67165289641182357
+-0.40100492526839776 -0.40480738995889742 -0.82178222598517658  -0.40115992505182019 -0.40477696304846211 -0.82172156155091969
+-0.37149736972483099 -0.52777252693426735 -0.76383628095354983  -0.37176976328896005 -0.52785497534633763 -0.76364675610270738
+-0.83986385056568236 0.054857140713616921 -0.54001796879892028  -0.83987858050695918 0.05679299414488586 -0.53979489236345535
+-0.8962672300889245 0.071858277492354974 -0.43765447584202588  -0.89666746009116993 0.072917516439698196 -0.4366583353262784
+-0.96471929550963276 -0.039734588558411582 -0.26026494835742225  -0.96481986879326076 -0.039677999129164865 -0.25990051397960146
+-0.94330265629374277 0.077704403643809677 -0.32271058904772337  -0.94351526412634279 0.077926023088562835 -0.32203490693742848
+-0.9168554803037775 -0.39313153246640248 -0.069452331980627613  -0.91670068154564355 -0.39350124418016658 -0.069401954456726103
+-0.9506072962094394 -0.27889813733511903 -0.13624095340381404  -0.95055095711572857 -0.27915487828976138 -0.13610816233202502
+-0.99043061207734606 -0.040522281668716874 -0.13192856911395229  -0.99044963097837846 -0.040575895565417547 -0.13176921185868212
+-0.96679589706089264 -0.15985780358782284 -0.19937696972895624  -0.96680424297825784 -0.16010344242024357 -0.19913925651268632
+-0.83986385056568236 0.054857140713616914 0.54001796879892028  -0.83987858050695929 0.05679299414488595 0.53979489236345513
+-0.77999809473327264 0 0.62578188869003271  -0.77906499229253745 0.00023519417927787259 0.62694312538533081
+-0.70519707714513458 -0.20012814034344362 0.6801807185069525  -0.70493504308661714 -0.20029565457621371 0.68040299513329239
+-0.70871769768752158 -0.067277074024322203 0.70227702532207648  -0.7082088791190847 -0.067501320615791602 0.70276863564904046
+-0.63610018157997195 -0.56664784959934422 0.52372394783737519  -0.63632626043050478 -0.56632219140540241 0.52380155193385225
+-0.67170915887432037 -0.45126666560725853 0.58750761901107273  -0.67165289641182357 -0.45152335920120673 0.5873747039473749
+-0.61446983418191203 -0.27287882084494514 0.74024588618561449  -0.61436698850995408 -0.2730077511897796 0.74028370995146808
+-0.69409608332024086 -0.32839555720531111 0.64061453708709615  -0.69398384882087005 -0.32871571883365175 0.64057192708348332
+-0.48516082808530336 0.87376742805233321 0.033903577486650911  -0.48348770334523589 0.87467833713118348 0.034313951497558594
+-0.55392361119767786 0.82440895259656954 0.11626913535565189  -0.55402560894563302 0.82413049582749986 0.11774782579538202
+-0.719915307065364 0.68063975088704354 0.135836225526941  -0.72008099426245709 0.68041269101920487 0.13609530337963627
+-0.62457262167826666 0.75674166021493738 0.19300544019554747  -0.62484261256047768 0.75636980999592551 0.19358827458119579
+-0.9168554803037775 0.39313153246640237 -0.069452331980627585  -0.91693066884564156 0.39289912961179124 -0.069774081725102299
+-0.86640575634619166 0.4993406306021807 0  -0.86652958223713705 0.49912569350341024 -0.00015872199696793297
+-0.78076816785433134 0.58942568680894825 0.20731239180326447  -0.78085960551688749 0.58928970592655849 0.20735457304096533
+-0.8004723406749189 0.59529852733606181 0.069740197633308881  -0.80067536950372598 0.59503447968929801 0.069662907281838451
+-0.054857140713616921 -0.54001796879892028 0.83986385056568236  -0.056792994144885853 -0.53979489236345535 0.83987858050695907
+-0.071858277492354974 -0.43765447584202588 0.8962672300889245  -0.072917516439698266 -0.4366583353262774 0.89666746009117038
+0.039734588558411582 -0.26026494835742225 0.96471929550963276  0.0396779991291649 -0.25990051397960151 0.96481986879326076
+-0.077704403643809677 -0.32271058904772337 0.94330265629374277  -0.077926023088562835 -0.32203490693742848 0.94351526412634279
+0.39313153246640237 -0.069452331980627585 0.9168554803037775  0.39289912961179146 -0.069774081725103021 0.91693066884564145
+0.27889813733511903 -0.13624095340381404 0.9506072962094394  0.27889806070390516 -0.13594944033505715 0.95064905270461686
+0.040522281668716874 -0.13192856911395229 0.99043061207734606  0.040575895565417575 -0.13176921185868209 0.99044963097837835
+0.15985780358782284 -0.19937696972895624 0.96679589706089264  0.16010344242024357 -0.19913925651268632 0.96680424297825784
+0.10194841255523887 0.62479622481419628 0.77318510024650311  0.085925101925653558 0.62068622392278772 0.77933656932774364
+0.59819314586024919 0.79307076339523386 0.10851189307750808  0.58661618171386287 0.80340332070769238 0.10210073274615192
+0.68063975088704354 -0.135836225526941 0.719915307065364  0.6804126910192051 -0.13609530337963646 0.72008099426245675
+0.095052466200525557 0.7378162794185118 0.66704995977036108  0.091975091050971861 0.7265140477791121 0.68096837004796018
+0.39313153246640237 0.069452331980627585 0.9168554803037775  0.39289912961179108 0.069774081725103229 0.91693066884564156
+0.49934063060218076 0 0.86640575634619166  0.49912569350341018 0.00015872199696750577 0.86652958223713716
+0.58942568680894825 -0.20731239180326447 0.78076816785433134  0.58928970592655827 -0.20735457304096649 0.78085960551688738
+0.59529852733606159 -0.069740197633308854 0.80047234067491879  0.59503447968929801 -0.069662907281838465 0.8006753695037262
+0.093129265416474122 0.71089969747156689 0.69602657944578861  0.091975091050964602 0.72651404777912154 0.68096837004795108
+0.77999809473327264 0 0.62578188869003271  0.77906499229250015 0.00023519417923989705 0.62694312538537711
+0.9168554803037775 0.39313153246640237 0.069452331980627585  0.91693066884564156 0.39289912961179108 0.069774081725103229
+0.70871769768752158 0.067277074024322203 0.70227702532207648  0.7082088791190857 0.067501320615791935 0.70276863564903957
+0.62457262167826666 0.75674166021493738 -0.19300544019554747  0.62484261256047768 0.75636980999592551 -0.19358827458119579
+0.719915307065364 0.68063975088704354 -0.135836225526941  0.72008099426245631 0.68041269101920543 -0.13609530337963674
+0.55392361119767786 0.82440895259656954 -0.11626913535565189  0.55402560894563302 0.82413049582749986 -0.11774782579538204
+0.48516082808530336 0.87376742805233321 -0.033903577486650911  0.48348770334523555 0.8746783371311837 -0.034313951497559961
+0.54001796879892028 0.83986385056568236 -0.054857140713616914  0.53979489236345657 0.83987858050695829 -0.056792994144886484
+0.62578188869003271 0.77999809473327264 0  0.6269431253853307 0.77906499229253756 -0.00023519417927871463
+0.10155294642477927 0.62688758712066828 0.77156308049914146  0.096596587118422172 0.63168040245027901 0.7691872129184979
+0.70227702532207648 0.70871769768752158 0.067277074024322203  0.70276863564903225 0.70820887911909236 0.067501320615797611
+0.64081678241520534 0.098941938751961223 0.76032257344343512  0.63913636447114808 0.10365825365835347 0.7620758978337423
+0.9506072962094394 0.27889813733511903 -0.13624095340381404  0.95055095711572857 0.27915487828976138 -0.13610816233202508
+0.9168554803037775 0.39313153246640237 -0.069452331980627585  0.91693066884564145 0.39289912961179146 -0.069774081725103021
+0.12310298935169575 0.55521070025011254 0.82226795238624728  0.080588876905648865 0.71952003419649402 0.68977993107147029
+0.57392154628557124 0.81891028733871629 0  0.57538069819453619 0.81788534298629689 0.00078604920685351092
+0.55392361119767786 0.82440895259656954 0.11626913535565189  0.71020085023251078 0.70091523749936702 0.065822353119778854
+0.12850859076870802 0.5423386494351099 0.82968743367193953  0.14218930946431643 0.53087421189741324 0.83543687458500493
+0.4889881761220175 0.15304821643557709 0.85818780510941428  0.47782642632714101 0.17381774822644638 0.86108611456980366
+0 0.95977938206574664 0.28075529872380572  0.00037212726837716195 0.95982343558557015 0.2806044084151369
+0.13624095340381404 0.9506072962094394 0.27889813733511903  0.13610816233202513 0.95055095711572846 0.27915487828976165
+0.17583413883161547 0.44878045857535925 0.87541500307784514  0.17844712110944902 0.44918580997761587 0.87543631012341661
+0.26911716736226499 0.9236940845413727 0.2726998137406515  0.26880216379452371 0.92375019852294993 0.27282039415738846
+-0.54001796879892028 0.83986385056568236 -0.054857140713616921  -0.53979489236345535 0.83987858050695918 -0.05679299414488586
+-0.43765447584202588 0.8962672300889245 -0.071858277492354974  -0.4366583353262784 0.89666746009116993 -0.072917516439698196
+-0.26026494835742225 0.96471929550963276 0.039734588558411582  -0.25990051397960146 0.96481986879326076 0.039677999129164865
+-0.32271058904772337 0.94330265629374277 -0.077704403643809677  -0.32203490693742848 0.94351526412634279 -0.077926023088562835
+-0.069452331980627613 0.9168554803037775 0.39313153246640248  -0.069774081725103049 0.91693066884564145 0.39289912961179158
+-0.13624095340381404 0.9506072962094394 0.27889813733511903  -0.13610816233202497 0.95055095711572857 0.27915487828976127
+-0.13192856911395229 0.99043061207734606 0.040522281668716874  -0.13176921185868212 0.99044963097837846 0.040575895565417547
+-0.19937696972895624 0.96679589706089264 0.15985780358782284  -0.19913925651268632 0.96680424297825784 0.16010344242024357
+-0.48516082808530336 0.87376742805233321 -0.033903577486650911  -0.48348770334523583 0.87467833713118348 -0.034313951497558608
+-0.43765447584202588 0.8962672300889245 0.071858277492354974  -0.43642314114700076 0.89681281808791968 0.072536964263670553
+-0.46039308870086582 0.84103330267207554 0.28407954462258922  -0.46019616855581386 0.84103034646625274 0.28440717777405622
+-0.38998766307204569 0.90172313788306901 0.18656099607880575  -0.38953622755321987 0.9017971537002798 0.18714545413041742
+-0.63610018157997195 0.56664784959934433 0.52372394783737519  -0.63609627313050621 0.56692430597377952 0.52342942466547371
+-0.58750761901107262 0.67170915887432037 0.45126666560725853  -0.58737470394737412 0.67165289641182357 0.45152335920120762
+-0.40480738995889742 0.82178222598517658 0.40100492526839776  -0.40477696304846156 0.82172156155092058 0.40115992505181908
+-0.52777252693426735 0.76383628095354983 0.37149736972483099  -0.52785497534633807 0.76364675610270716 0.37176976328895989
+-0.87376742805233321 -0.033903577486650911 0.48516082808530336  -0.8741925320045173 -0.035585805831079474 0.48427375255209065
+-0.8962672300889245 0.071858277492354974 0.43765447584202588  -0.89681281808791957 0.072536964263670914 0.43642314114700098
+-0.84103330267207554 0.28407954462258922 0.46039308870086582  -0.84103034646625263 0.28440717777405616 0.46019616855581419
+-0.90172313788306901 0.18656099607880575 0.38998766307204569  -0.9017971537002798 0.18714545413041742 0.38953622755321987
+-0.56664784959934433 0.52372394783737519 0.63610018157997195  -0.56632219140540241 0.52380155193385303 0.63632626043050411
+-0.67170915887432037 0.45126666560725853 0.58750761901107262  -0.67165289641182357 0.45152335920120762 0.58737470394737412
+-0.82178222598517658 0.40100492526839776 0.40480738995889742  -0.82172156155091935 0.40115992505182047 0.40477696304846261
+-0.76383628095354983 0.37149736972483099 0.52777252693426735  -0.76364675610270705 0.37176976328895983 0.52785497534633807
+-0.87376742805233321 0.033903577486650911 0.48516082808530336  -0.87467833713118348 0.034313951497558594 0.48348770334523589
+-0.82440895259656954 0.11626913535565189 0.55392361119767786  -0.82389530164822311 0.11760246779863283 0.55440616112165908
+-0.68063975088704354 0.135836225526941 0.719915307065364  -0.6804126910192051 0.13609530337963646 0.72008099426245675
+-0.75674166021493738 0.19300544019554747 0.62457262167826666  -0.7563698099959254 0.19358827458119579 0.62484261256047768
+-0.39313153246640237 -0.069452331980627585 0.9168554803037775  -0.39289912961179119 -0.069774081725102868 0.91693066884564156
+-0.4993406306021807 0 0.86640575634619166  -0.49912569350341029 0.00015872199696811011 0.86652958223713716
+-0.58942568680894825 0.20731239180326447 0.78076816785433134  -0.58928970592655827 0.20735457304096649 0.78085960551688738
+-0.59529852733606159 0.069740197633308854 0.80047234067491879  -0.59503447968929801 0.069662907281838465 0.8006753695037262
+0 -0.57392154628557124 0.81891028733871629  -0.00078604920685375031 -0.5753806981945353 0.81788534298629745
+-0.11626913535565189 -0.55392361119767786 0.82440895259656954  -0.11760246779863304 -0.55440616112166052 0.82389530164822211
+-0.25952221836449818 -0.39610117388436322 0.88076789123048704  -0.25988482570664351 -0.39599581735923556 0.88070834559541811
+-0.23458495860622128 -0.51571602924327076 0.82401873423925942  -0.23530638500725787 -0.51562318151862285 0.82387113061171735
+-0.28075529872380572 0 0.95977938206574664  -0.28060440841513667 0.00037212726837714639 0.95982343558557015
+-0.27889813733511903 -0.13624095340381404 0.9506072962094394  -0.27915487828976165 -0.13610816233202513 0.95055095711572846
+-0.37596077789543381 -0.33924096091721673 0.86230450765389344  -0.37608264246842454 -0.33912378489964873 0.86229745711633865
+-0.2726998137406515 -0.26911716736226499 0.9236940845413727  -0.27282039415738829 -0.2688021637945236 0.92375019852294993
+0.10851189307750805 0.59819314586024896 0.79307076339523386  0.10210073274615436 0.58661618171386465 0.80340332070769072
+0.82440895259656954 0.11626913535565189 -0.55392361119767786  0.82389530164822311 0.11760246779863283 -0.55440616112165908
+0.68063975088704354 0.135836225526941 -0.719915307065364  0.6804126910192051 0.13609530337963646 -0.72008099426245675
+0.75674166021493738 0.19300544019554747 -0.62457262167826666  0.7563698099959254 0.19358827458119579 -0.62484261256047768
+0.39313153246640237 -0.069452331980627585 -0.9168554803037775  0.39289912961179119 -0.069774081725102868 -0.91693066884564156
+0.4993406306021807 0 -0.86640575634619166  0.49912569350341029 0.00015872199696811011 -0.86652958223713716
+0.58942568680894825 0.20731239180326447 -0.78076816785433134  0.58928970592655827 0.20735457304096649 -0.78085960551688738
+0.59529852733606159 0.069740197633308854 -0.80047234067491879  0.59503447968929801 0.069662907281838465 -0.8006753695037262
+0 -0.57392154628557124 -0.81891028733871629  0.00078604920685375031 -0.5753806981945353 -0.81788534298629745
+0.11626913535565189 -0.55392361119767786 -0.82440895259656954  0.11760246779863304 -0.55440616112166052 -0.82389530164822211
+0.25952221836449818 -0.39610117388436322 -0.88076789123048704  0.25988482570664351 -0.39599581735923556 -0.88070834559541811
+0.23458495860622128 -0.51571602924327076 -0.82401873423925942  0.23530638500725787 -0.51562318151862285 -0.82387113061171735
+0.28075529872380572 0 -0.95977938206574664  0.28060440841513667 0.00037212726837714639 -0.95982343558557015
+0.27889813733511903 -0.13624095340381404 -0.9506072962094394  0.27915487828976165 -0.13610816233202513 -0.95055095711572846
+0.37596077789543381 -0.33924096091721673 -0.86230450765389344  0.37608264246842454 -0.33912378489964873 -0.86229745711633865
+0.2726998137406515 -0.26911716736226499 -0.9236940845413727  0.27282039415738829 -0.2688021637945236 -0.92375019852294993
+0.054857140713616921 -0.54001796879892028 -0.83986385056568236  0.056792994144885853 -0.53979489236345535 -0.83987858050695907
+0.071858277492354974 -0.43765447584202588 -0.8962672300889245  0.072917516439698266 -0.4366583353262774 -0.89666746009117038
+-0.039734588558411582 -0.26026494835742225 -0.96471929550963276  -0.039677999129164934 -0.25990051397960151 -0.96481986879326076
+0.077704403643809677 -0.32271058904772337 -0.94330265629374277  0.077926023088562835 -0.32203490693742848 -0.94351526412634279
+-0.39313153246640237 -0.069452331980627585 -0.9168554803037775  -0.39289912961179146 -0.069774081725103021 -0.91693066884564145
+-0.27889813733511903 -0.13624095340381404 -0.9506072962094394  -0.27889806070390516 -0.13594944033505715 -0.95064905270461686
+-0.040522281668716874 -0.13192856911395229 -0.99043061207734606  -0.040575895565417616 -0.13176921185868207 -0.99044963097837835
+-0.15985780358782284 -0.19937696972895624 -0.96679589706089264  -0.16010344242024357 -0.19913925651268632 -0.96680424297825784
+-0.87376742805233321 -0.033903577486650911 -0.48516082808530336  -0.87467833713118348 -0.034313951497558594 -0.48348770334523589
+-0.82440895259656954 -0.11626913535565189 -0.55392361119767786  -0.82389530164822311 -0.11760246779863283 -0.55440616112165897
+-0.68063975088704354 -0.135836225526941 -0.719915307065364  -0.6804126910192051 -0.13609530337963646 -0.72008099426245675
+-0.75674166021493738 -0.19300544019554747 -0.62457262167826666  -0.7563698099959254 -0.19358827458119579 -0.62484261256047768
+-0.39313153246640237 0.069452331980627585 -0.9168554803037775  -0.39289912961179108 0.069774081725103229 -0.91693066884564156
+-0.49934063060218076 0 -0.86640575634619166  -0.49912569350341018 0.00015872199696750577 -0.86652958223713716
+-0.58942568680894825 -0.20731239180326447 -0.78076816785433134  -0.58928970592655827 -0.20735457304096649 -0.78085960551688738
+-0.59529852733606159 -0.069740197633308854 -0.80047234067491879  -0.59503447968929801 -0.069662907281838465 -0.8006753695037262
+-0.83986385056568236 -0.054857140713616921 -0.54001796879892028  -0.83987858050695918 -0.056792994144885853 -0.53979489236345535
+-0.77999809473327264 0 -0.62578188869003271  -0.77906499229253756 -0.00023519417927852539 -0.6269431253853307
+-0.70519707714513458 0.20012814034344362 -0.6801807185069525  -0.70493504308661714 0.20029565457621371 -0.68040299513329239
+-0.70871769768752158 0.067277074024322203 -0.70227702532207648  -0.7082088791190847 0.067501320615791602 -0.70276863564904046
+-0.63610018157997184 0.56664784959934422 -0.52372394783737519  -0.63609627313050632 0.56692430597377919 -0.52342942466547393
+-0.67170915887432037 0.4512666656072587 -0.58750761901107273  -0.67149417441485493 0.45142526361231849 -0.58763152153323184
+-0.61446983418191203 0.27287882084494514 -0.74024588618561449  -0.61436698850995408 0.2730077511897796 -0.74028370995146808
+-0.69409608332024086 0.32839555720531111 -0.64061453708709615  -0.69398384882087005 0.32871571883365175 -0.64057192708348332
+-0.54001796879892028 0.83986385056568236 0.054857140713616921  -0.53979489236345579 0.83987858050695896 0.056792994144885707
+-0.62578188869003271 0.77999809473327264 0  -0.6269431253853307 0.77906499229253756 0.0002351941792792563
+-0.68018071850695239 0.70519707714513458 -0.20012814034344362  -0.68040299513329217 0.7049350430866177 -0.20029565457621276
+-0.70227702532207648 0.70871769768752158 -0.067277074024322203  -0.70276863564904013 0.70820887911908503 -0.067501320615791879
+-0.52372394783737508 0.63610018157997195 -0.56664784959934422  -0.5234294246654746 0.63609627313050632 -0.56692430597377863
+-0.58750761901107262 0.67170915887432026 -0.45126666560725864  -0.58737470394737479 0.67165289641182357 -0.45152335920120684
+-0.74024588618561449 0.61446983418191203 -0.27287882084494514  -0.74028370995146886 0.6143669885099533 -0.27300775118977977
+-0.64061453708709615 0.69409608332024098 -0.32839555720531116  -0.6405719270834821 0.6939838488208705 -0.32871571883365286
+-0.57392154628557124 0.81891028733871629 0  -0.57538069819453541 0.81788534298629756 -0.00078604920685375042
+-0.55392361119767786 0.82440895259656954 -0.11626913535565189  -0.55440616112165897 0.823895301648223 -0.11760246779863361
+-0.39610117388436322 0.88076789123048704 -0.25952221836449818  -0.39599581735923572 0.880708345595418 -0.25988482570664373
+-0.51571602924327076 0.82401873423925942 -0.23458495860622128  -0.51562318151862307 0.82387113061171735 -0.2353063850072579
+0 0.95977938206574664 -0.28075529872380572  -0.0003721272683770178 0.95982343558557004 -0.28060440841513712
+-0.13624095340381404 0.9506072962094394 -0.27889813733511903  -0.13610816233202513 0.95055095711572846 -0.27915487828976165
+-0.33924096091721673 0.86230450765389344 -0.37596077789543381  -0.33912378489964901 0.86229745711633865 -0.37608264246842449
+-0.26911716736226499 0.9236940845413727 -0.2726998137406515  -0.2688021637945236 0.92375019852294993 -0.27282039415738829
+0.54001796879892028 0.83986385056568236 0.054857140713616914  0.54106674669697563 0.83909253130010464 0.056307189018221113
+0.43765447584202588 0.8962672300889245 0.071858277492354974  0.4366583353262784 0.89666746009116993 0.072917516439698196
+0.26026494835742225 0.96471929550963276 -0.039734588558411582  0.25990051397960151 0.96481986879326076 -0.039677999129164934
+0.32271058904772337 0.94330265629374277 0.077704403643809677  0.32203490693742848 0.94351526412634279 0.077926023088562835
+0.069452331980627585 0.9168554803037775 -0.39313153246640237  0.069401954456724882 0.91670068154564321 -0.39350124418016752
+0.13624095340381404 0.9506072962094394 -0.27889813733511903  0.13610816233202497 0.95055095711572857 -0.27915487828976127
+0.13192856911395229 0.99043061207734606 -0.040522281668716874  0.13176921185868209 0.99044963097837846 -0.040575895565417609
+0.19937696972895624 0.96679589706089264 -0.15985780358782284  0.19913925651268632 0.96680424297825784 -0.16010344242024357
+0.48516082808530336 0.87376742805233321 0.033903577486650911  0.48348770334523544 0.8746783371311837 0.034313951497559954
+0.43765447584202588 0.8962672300889245 -0.071858277492354974  0.43642314114700076 0.89681281808791968 -0.072536964263670553
+0.46039308870086582 0.84103330267207554 -0.28407954462258922  0.4601961685558138 0.84103034646625274 -0.28440717777405627
+0.38998766307204569 0.90172313788306901 -0.18656099607880575  0.38953622755321987 0.9017971537002798 -0.18714545413041742
+0.63610018157997184 0.56664784959934433 -0.52372394783737508  0.63632626043050544 0.56632219140540152 -0.52380155193385247
+0.58750761901107262 0.67170915887432037 -0.45126666560725853  0.58737470394737434 0.67165289641182369 -0.45152335920120712
+0.40480738995889742 0.82178222598517658 -0.40100492526839776  0.4047769630484615 0.82172156155092069 -0.40115992505181902
+0.52777252693426735 0.76383628095354983 -0.37149736972483099  0.52785497534633807 0.76364675610270716 -0.37176976328895989
+0.82226795238624728 0.12310298935169572 0.55521070025011254  0.6743831932704073 0.072892092607679745 0.73477483045466507
+0.39369586600014295 0.21254447256850689 0.89390471712616426  0.42092243512974509 0.23042761042598023 0.8773411080975394
+0.84103330267207554 0.28407954462258922 -0.46039308870086582  0.84103034646625263 0.28440717777405616 -0.46019616855581419
+0.90172313788306901 0.18656099607880575 -0.38998766307204569  0.90179715370028013 0.18714545413041661 -0.38953622755321932
+0.56664784959934433 0.52372394783737519 -0.63610018157997195  0.56692430597377874 0.5234294246654746 -0.6360962731305061
+0.67170915887432037 0.45126666560725853 -0.58750761901107262  0.67165289641182357 0.45152335920120762 -0.58737470394737412
+0.82178222598517658 0.40100492526839776 -0.40480738995889742  0.82172156155091913 0.40115992505182035 -0.40477696304846322
+0.76383628095354983 0.37149736972483099 -0.52777252693426735  0.76364675610270738 0.37176976328896 -0.52785497534633763
+0.17031256632806052 0.87149140923129198 0.45766135056488999  0.16290466567087381 0.87265298324518525 0.46036815782147589
+0.55521070025011254 0.82226795238624728 0.12310298935169572  0.73506403715197666 0.67406726425876351 0.07289845362244457
+0.79307076339523386 0.10851189307750797 0.59819314586024919  0.80340332070769471 0.10210073274615283 0.58661618171385932
+0.44486756488630003 0.87684117534766193 0.17811496227257201  0.42919468968313912 0.88441806965929093 0.18329374350459265
+0.42721864490060912 0.88304523202927654 0.18950565604187919  0.429194689683149 0.88441806965928738 0.18329374350458694
+0.18950565604187924 0.42721864490060907 0.88304523202927665  0.18329374350458899 0.42919468968314683 0.88441806965928804
+0.17811496227257201 0.44486756488630003 0.87684117534766193  0.18329374350459213 0.42919468968314456 0.88441806965928849
+0.73781627941851213 0.66704995977036097 0.095052466200525487  0.72651404777913131 0.68096837004793687 0.091975091050992136
+-0.033903577486650918 -0.48516082808530342 0.87376742805233332  -0.034313951497558337 -0.48348770334523583 0.87467833713118359
+0.071858277492354974 -0.43765447584202588 0.8962672300889245  0.07253696426367158 -0.43642314114700032 0.89681281808791979
+0.28407954462258922 -0.46039308870086582 0.84103330267207554  0.28440717777405627 -0.4601961685558138 0.84103034646625285
+0.18656099607880575 -0.38998766307204569 0.90172313788306901  0.18714545413041742 -0.38953622755321987 0.9017971537002798
+0.71089969747156689 0.69602657944578872 0.093129265416474039  0.72651404777910411 0.68096837004796806 0.091975091050976149
+0.45126666560725853 -0.58750761901107262 0.67170915887432037  0.4514252636123024 -0.58763152153321818 0.67149417441487758
+0.40100492526839776 -0.40480738995889742 0.82178222598517658  0.40115992505182019 -0.40477696304846211 0.82172156155091969
+0.37149736972483099 -0.52777252693426735 0.76383628095354983  0.37176976328896005 -0.52785497534633763 0.76364675610270738
+0.033903577486650918 -0.48516082808530342 0.87376742805233332  0.034313951497558351 -0.48348770334523589 0.87467833713118359
+0.11626913535565189 -0.55392361119767786 0.82440895259656954  0.11760246779863211 -0.55440616112166108 0.82389530164822189
+0.135836225526941 -0.719915307065364 0.68063975088704354  0.13609530337963674 -0.72008099426245631 0.68041269101920543
+0.19300544019554747 -0.62457262167826666 0.75674166021493738  0.1935882745811939 -0.62484261256047813 0.75636980999592551
+-0.069452331980627585 -0.9168554803037775 0.39313153246640237  -0.069774081725102868 -0.91693066884564156 0.39289912961179119
+0 -0.86640575634619166 0.4993406306021807  0.00015872199696811011 -0.86652958223713705 0.49912569350341024
+0.20731239180326447 -0.78076816785433134 0.58942568680894825  0.20735457304096652 -0.78085960551688727 0.58928970592655827
+0.069740197633308854 -0.80047234067491879 0.59529852733606159  0.069662907281838451 -0.8006753695037262 0.59503447968929801
+-0.57392154628557124 -0.81891028733871629 0  -0.57538069819453541 -0.81788534298629756 0.00078604920685375042
+-0.55392361119767786 -0.82440895259656954 0.11626913535565189  -0.55440616112165897 -0.823895301648223 0.11760246779863361
+-0.39610117388436322 -0.88076789123048704 0.25952221836449818  -0.39599581735923556 -0.88070834559541811 0.25988482570664351
+-0.51571602924327076 -0.82401873423925942 0.23458495860622128  -0.51562318151862307 -0.82387113061171735 0.2353063850072579
+0 -0.95977938206574664 0.28075529872380572  0.00037212726837714466 -0.95982343558557026 0.28060440841513667
+-0.13624095340381404 -0.9506072962094394 0.27889813733511903  -0.13610816233202513 -0.95055095711572846 0.27915487828976165
+-0.33924096091721673 -0.86230450765389344 0.37596077789543381  -0.33912378489964873 -0.86229745711633865 0.37608264246842454
+-0.26911716736226499 -0.9236940845413727 0.2726998137406515  -0.2688021637945236 -0.92375019852294993 0.27282039415738829
+-0.54001796879892028 -0.83986385056568236 0.054857140713616921  -0.54106674669697552 -0.83909253130010475 0.05630718901821994
+-0.43765447584202588 -0.8962672300889245 0.071858277492354974  -0.4366583353262784 -0.89666746009116993 0.072917516439698196
+-0.26026494835742225 -0.96471929550963276 -0.039734588558411582  -0.25990051397960151 -0.96481986879326076 -0.0396779991291649
+-0.32271058904772337 -0.94330265629374277 0.077704403643809677  -0.32203490693742848 -0.94351526412634279 0.077926023088562835
+-0.069452331980627585 -0.9168554803037775 -0.39313153246640237  -0.069774081725103021 -0.91693066884564145 -0.39289912961179146
+-0.13624095340381404 -0.9506072962094394 -0.27889813733511903  -0.13594944033505715 -0.95064905270461686 -0.27889806070390516
+-0.13192856911395229 -0.99043061207734606 -0.040522281668716874  -0.13176921185868212 -0.99044963097837846 -0.040575895565417582
+-0.19937696972895624 -0.96679589706089264 -0.15985780358782284  -0.19913925651268632 -0.96680424297825784 -0.16010344242024357
+-0.033903577486650918 -0.48516082808530342 -0.87376742805233332  -0.034313951497558351 -0.48348770334523589 -0.87467833713118359
+-0.11626913535565189 -0.55392361119767786 -0.82440895259656954  -0.11760246779863211 -0.55440616112166108 -0.82389530164822189
+-0.135836225526941 -0.719915307065364 -0.68063975088704354  -0.13609530337963674 -0.72008099426245631 -0.68041269101920543
+-0.19300544019554747 -0.62457262167826666 -0.75674166021493738  -0.1935882745811939 -0.62484261256047813 -0.75636980999592551
+0.069452331980627585 -0.9168554803037775 -0.39313153246640237  0.069401954456725076 -0.9167006815456431 -0.39350124418016769
+0 -0.86640575634619166 -0.49934063060218076  0.00015872199696750577 -0.86652958223713716 -0.49912569350341018
+-0.20731239180326447 -0.78076816785433134 -0.58942568680894825  -0.20735457304096652 -0.78085960551688727 -0.58928970592655827
+-0.069740197633308854 -0.80047234067491879 -0.59529852733606159  -0.069662907281838451 -0.8006753695037262 -0.59503447968929801
+-0.054857140713616921 -0.54001796879892028 -0.83986385056568236  -0.0567929941448857 -0.53979489236345579 -0.83987858050695885
+0 -0.62578188869003271 -0.77999809473327264  -0.00023519417927802882 -0.62694312538533059 -0.77906499229253756
+0.20012814034344359 -0.68018071850695239 -0.70519707714513447  0.20029565457621396 -0.68040299513329183 -0.7049350430866177
+0.067277074024322203 -0.70227702532207648 -0.70871769768752158  0.067501320615791602 -0.70276863564904046 -0.7082088791190847
+0.58417903277383187 0.11307342108777625 0.80253395542112949  0.59478368364253731 0.11477033531295872 0.79565076497466225
+0.45126666560725864 -0.58750761901107262 -0.67170915887432026  0.45142526361231183 -0.58763152153322762 -0.67149417441486303
+0.27287882084494514 -0.74024588618561449 -0.61446983418191203  0.27300775118978016 -0.74028370995146797 -0.61436698850995408
+0.32839555720531111 -0.64061453708709615 -0.69409608332024086  0.32871571883365175 -0.64057192708348332 -0.69398384882087005
+0.83986385056568236 0.054857140713616914 -0.54001796879892028  0.83909253130010808 0.056307189018238654 -0.54106674669696841
+0.77999809473327264 0 -0.62578188869003271  0.77906499229247361 0.00023519417921545848 -0.62694312538540997
+0.70519707714513458 -0.20012814034344362 -0.6801807185069525  0.70493504308662136 -0.20029565457622006 -0.68040299513328628
+0.70871769768752158 -0.067277074024322203 -0.70227702532207648  0.7082088791190847 -0.067501320615791602 -0.70276863564904046
+0.60770816150558549 0.10617487126239183 0.78594000042913037  0.59478368364251988 0.1147703353129657 0.79565076497467435
+0.09404663521954322 0.6771336059462687 0.72858929180595311  0.089584884642380763 0.67452766723137114 0.7327939509732706
+0.61446983418191203 -0.27287882084494514 -0.74024588618561449  0.61436698850995386 -0.27300775118977944 -0.74028370995146842
+0.095572989323982643 0.66096525556418151 0.74328545761836984  0.089584884642378876 0.67452766723138347 0.73279395097325939
+0.8189102873387164 0 -0.57392154628557113  0.81788534298629767 0.00078604920686769326 -0.57538069819453486
+0.43210633013751587 0.18610643753537565 0.88125255845135109  0.42585755017737748 0.18423339416733694 0.88583486239281939
+0.44478929974988746 0.17773204761375266 0.87689701064830428  0.29734765556272624 0.2570794374759548 0.91950776753565111
+0.17773204761375266 0.87689701064830428 0.44478929974988746  0.25707943747595702 0.91950776753565056 0.29734765556272574
+0.18610643753537565 0.88125255845135109 0.43210633013751576  0.18423339416734003 0.88583486239282005 0.42585755017737459
+0.90688305806336122 0.29107512591583123 0.30186484921791512  0.90562084821138122 0.30687826798315732 0.29270566773562112
+0.90641151615731874 0.31222404809805687 0.28115084502736221  0.90562084821138256 0.30687826798314766 0.29270566773562745
+0.49724573572225761 0.14854713354961635 0.85435218642293975  0.4950182210878013 0.18463389628077642 0.84903903628469779
+0.83986385056568236 0.054857140713616914 0.54001796879892028  0.83909253130010686 0.056307189018238085 0.54106674669697041
+0.37520377518580433 0.22681489975349645 0.89805158744476099  0.36748531964499009 0.23977066491307367 0.89859032272363248
+0.3390347444358186 0.25671454238163 0.90442701067601727  0.33091024020102594 0.23862737818799426 0.91299254504580885
+0.32286639405373108 0.271410708194047 0.90595336478045685  0.30990719304796632 0.27087574504909739 0.91136373772562795
+0.28910030252843322 0.30397342055421106 0.90687073458352596  0.28893990864389041 0.30244718988224867 0.90831680955776173
+0.24184951424973422 0.35660859546245849 0.90157505838463314  0.24555619785555041 0.36356562872997694 0.89862238304023034
+0.21405999957086966 0.39229183849441451 0.893825128737608  0.22324532177534337 0.39311654818375885 0.89197584375896055
+0.1974660445788706 0.41582096722616779 0.88692657891222382  0.20125623970685266 0.42149610172113156 0.88421545010984026
+3  1604 787 1803
+3  1460 85 1803
+3  838 298 814
+3  840 300 815
+3  832 292 816
+3  844 304 817
+3  846 306 818
+3  848 308 819
+3  850 310 820
+3  842 302 821
+3  897 1434 899
+3  856 316 823
+3  1157 361 858
+3  973 430 1017
+3  2072 968 2344
+3  1059 786 1806
+3  845 305 828
+3  871 331 829
+3  841 301 830
+3  839 299 831
+3  816 276 832
+3  853 313 833
+3  1100 259 1806
+3  1928 786 1807
+3  1844 28 1807
+3  849 309 837
+3  814 274 838
+3  831 291 839
+3  815 275 840
+3  830 290 841
+3  821 281 842
+3  859 319 843
+3  817 277 844
+3  828 288 845
+3  818 278 846
+3  870 330 847
+3  819 279 848
+3  837 297 849
+3  820 280 850
+3  863 323 851
+3  1156 1157 858
+3  833 293 853
+3  822 282 854
+3  869 329 855
+3  823 283 856
+3  864 324 857
+3  824 284 858
+3  843 303 859
+3  858 1161 1156
+3  2330 1165 1164
+3  1166 1167 758
+3  851 311 863
+3  857 317 864
+3  866 326 865
+3  865 325 866
+3  868 328 867
+3  867 327 868
+3  855 315 869
+3  847 307 870
+3  829 289 871
+3  1244 785 1808
+3  880 340 873
+3  877 337 874
+3  907 258 1808
+3  879 339 876
+3  874 334 877
+3  881 341 878
+3  876 336 879
+3  873 333 880
+3  878 338 881
+3  885 345 882
+3  890 350 883
+3  887 347 884
+3  882 342 885
+3  889 349 886
+3  884 344 887
+3  891 351 888
+3  886 346 889
+3  883 343 890
+3  888 348 891
+3  1168 1170 1634
+3  952 537 1274
+3  2072 1275 953
+3  969 1173 1301
+3  822 1302 967
+3  822 1303 1302
+3  971 1669 1306
+3  473 1307 972
+3  473 1309 1307
+3  2077 1312 634
+3  1542 785 1809
+3  1518 430 973
+3  937 397 904
+3  962 422 905
+3  989 449 906
+3  978 438 907
+3  929 389 908
+3  982 442 909
+3  925 385 910
+3  942 402 911
+3  931 391 912
+3  954 414 913
+3  433 1437 2267
+3  916 376 915
+3  915 375 916
+3  1604 85 1809
+3  975 435 918
+3  1181 784 1810
+3  1244 258 1810
+3  946 406 921
+3  945 405 922
+3  924 384 923
+3  923 383 924
+3  910 370 925
+3  991 451 926
+3  928 388 927
+3  927 387 928
+3  908 368 929
+3  987 447 930
+3  912 372 931
+3  951 411 932
+3  966 426 933
+3  965 425 934
+3  936 396 935
+3  935 395 936
+3  904 364 937
+3  979 439 938
+3  940 400 939
+3  939 399 940
+3  988 448 941
+3  911 371 942
+3  944 404 943
+3  943 403 944
+3  922 382 945
+3  921 381 946
+3  948 408 947
+3  947 407 948
+3  974 434 949
+3  1444 433 950
+3  932 392 951
+3  1090 433 1444
+3  2267 1448 1232
+3  913 373 954
+3  956 416 955
+3  955 415 956
+3  986 446 957
+3  985 445 958
+3  960 420 959
+3  959 419 960
+3  976 436 961
+3  905 365 962
+3  964 424 963
+3  963 423 964
+3  934 394 965
+3  933 393 966
+3  1299 768 1449
+3  1088 2141 1452
+3  1232 1513 692
+3  1445 1515 1451
+3  1434 898 53
+3  1525 1377 759
+3  1197 1529 1268
+3  949 409 974
+3  918 378 975
+3  961 421 976
+3  980 440 977
+3  907 367 978
+3  938 398 979
+3  977 437 980
+3  984 444 981
+3  909 369 982
+3  990 450 983
+3  981 441 984
+3  958 418 985
+3  957 417 986
+3  930 390 987
+3  941 401 988
+3  906 366 989
+3  983 443 990
+3  926 386 991
+3  2216 784 1811
+3  2088 11 1811
+3  577 994 2057
+3  1122 582 995
+3  1219 679 996
+3  1126 586 997
+3  1227 687 998
+3  1130 590 999
+3  1195 655 1000
+3  1114 574 1001
+3  1243 703 1002
+3  1138 598 1003
+3  1251 711 1004
+3  1142 602 1005
+3  1259 719 1006
+3  1146 606 1007
+3  1267 727 1008
+3  1150 610 1009
+3  1235 695 1010
+3  1134 594 1011
+3  1283 743 1012
+3  1158 618 1013
+3  1291 751 1014
+3  1162 622 1015
+3  1754 759 1016
+3  1152 1530 623
+3  2328 1531 2336
+3  494 1556 1171
+3  1160 1663 2336
+3  1517 2328 692
+3  1082 783 1954
+3  980 257 1954
+3  1247 707 1024
+3  1242 702 1025
+3  1351 811 1026
+3  1346 806 1027
+3  1231 691 1028
+3  1226 686 1029
+3  1223 683 1030
+3  1218 678 1031
+3  1131 591 1032
+3  1230 690 1033
+3  1279 739 1034
+3  79 1761 2334
+3  2346 1036 1909
+3  1198 658 1037
+3  827 1038 1766
+3  1318 778 1039
+3  1688 783 1955
+3  1442 84 1955
+3  1263 723 1042
+3  1258 718 1043
+3  1123 583 1044
+3  1214 674 1045
+3  1191 651 1046
+3  1350 810 1047
+3  1127 587 1048
+3  1222 682 1049
+3  1187 647 1050
+3  1342 802 1051
+3  1151 611 1052
+3  1270 730 1053
+3  2334 1762 1415
+3  1298 758 1055
+3  1135 595 1056
+3  1238 698 1057
+3  1179 639 1058
+3  1326 786 1059
+3  1139 599 1060
+3  1246 706 1061
+3  1347 807 1062
+3  1190 650 1063
+3  1143 603 1064
+3  1254 714 1065
+3  1215 675 1066
+3  1210 670 1067
+3  1147 607 1068
+3  1262 722 1069
+3  1319 779 1070
+3  1314 774 1071
+3  430 1518 970
+3  1755 1763 1378
+3  1199 659 1074
+3  1194 654 1075
+3  1635 1298 1764
+3  8 5 1434
+3  1343 803 1078
+3  1338 798 1079
+3  1159 619 1080
+3  1286 746 1081
+3  1323 783 1082
+3  1178 638 1083
+3  1163 623 1084
+3  1294 754 1085
+3  1239 699 1086
+3  1234 694 1087
+3  5 898 1434
+3  897 8 1434
+3  623 1153 1152
+3  113 9 22
+3  113 22 896
+3  113 900 9
+3  1271 731 1094
+3  1266 726 1095
+3  1295 755 1096
+3  1290 750 1097
+3  1331 791 1098
+3  1182 642 1099
+3  1327 787 1100
+3  1322 782 1101
+3  1339 799 1102
+3  1186 646 1103
+3  1335 795 1104
+3  1330 790 1105
+3  1287 747 1106
+3  1282 742 1107
+3  1255 715 1108
+3  1250 710 1109
+3  1183 643 1110
+3  1334 794 1111
+3  1101 782 1958
+3  635 1872 1113
+3  1001 461 1114
+3  1036 496 1115
+3  1121 581 1116
+3  1082 257 1958
+3  1892 782 1962
+3  1928 28 1962
+3  1125 585 1120
+3  1116 576 1121
+3  1328 781 1964
+3  1044 504 1123
+3  1129 589 1124
+3  1120 580 1125
+3  997 457 1126
+3  1048 508 1127
+3  961 256 1964
+3  1124 584 1129
+3  999 459 1130
+3  1032 492 1131
+3  1137 597 1132
+3  1148 608 1133
+3  1011 471 1134
+3  1056 516 1135
+3  1141 601 1136
+3  1132 592 1137
+3  1003 463 1138
+3  1060 520 1139
+3  1145 605 1140
+3  1136 596 1141
+3  1005 465 1142
+3  1064 524 1143
+3  1149 609 1144
+3  1140 600 1145
+3  1007 467 1146
+3  1068 528 1147
+3  1133 593 1148
+3  1144 604 1149
+3  1009 469 1150
+3  1052 512 1151
+3  25 1279 26
+3  26 1279 903
+3  901 1279 25
+3  1519 42 53
+3  42 1514 53
+3  1514 1634 53
+3  1013 473 1158
+3  1080 540 1159
+3  44 2129 1268
+3  1200 2129 44
+3  1015 475 1162
+3  1084 544 1163
+3  45 1883 46
+3  46 1883 822
+3  822 967 46
+3  970 72 1018
+3  970 1518 72
+3  80 1013 175
+3  175 1381 80
+3  634 81 1035
+3  1650 781 1965
+3  379 2058 1173
+3  634 1312 81
+3  1038 498 1175
+3  1241 701 1176
+3  1292 752 1177
+3  1083 543 1178
+3  1058 518 1179
+3  1345 805 1180
+3  1324 784 1181
+3  1099 559 1182
+3  1110 570 1183
+3  1225 685 1184
+3  1332 792 1185
+3  1103 563 1186
+3  1050 510 1187
+3  1217 677 1188
+3  1252 712 1189
+3  1063 523 1190
+3  1046 506 1191
+3  1229 689 1192
+3  1276 736 1193
+3  1075 535 1194
+3  1000 460 1195
+3  1512 82 1054
+3  1512 1315 82
+3  332 1198 1836
+3  1074 534 1199
+3  1671 1197 657
+3  294 1172 2068
+3  1688 84 1965
+3  1289 780 1966
+3  1317 777 1204
+3  1328 256 1966
+3  1775 780 1967
+3  2304 7 1967
+3  1070 779 2074
+3  834 2064 1209
+3  1067 527 1210
+3  994 454 1211
+3  1257 717 1212
+3  1216 676 1213
+3  1045 505 1214
+3  1066 526 1215
+3  1213 673 1216
+3  1188 648 1217
+3  1031 491 1218
+3  996 456 1219
+3  1349 809 1220
+3  1224 684 1221
+3  1049 509 1222
+3  1030 490 1223
+3  1221 681 1224
+3  1184 644 1225
+3  1029 489 1226
+3  998 458 1227
+3  1341 801 1228
+3  1192 652 1229
+3  1033 493 1230
+3  1028 488 1231
+3  1269 729 1232
+3  1300 760 1233
+3  1087 547 1234
+3  1010 470 1235
+3  1297 757 1236
+3  1240 700 1237
+3  1057 517 1238
+3  1086 546 1239
+3  1237 697 1240
+3  1176 636 1241
+3  1025 485 1242
+3  1002 462 1243
+3  1325 785 1244
+3  1248 708 1245
+3  1061 521 1246
+3  1024 484 1247
+3  1245 705 1248
+3  1344 804 1249
+3  1109 569 1250
+3  1004 464 1251
+3  1189 649 1252
+3  1256 716 1253
+3  1065 525 1254
+3  1108 568 1255
+3  1253 713 1256
+3  1212 672 1257
+3  1043 503 1258
+3  1006 466 1259
+3  918 255 2074
+3  1264 724 1261
+3  1069 529 1262
+3  1042 502 1263
+3  1261 721 1264
+3  1316 776 1265
+3  1095 555 1266
+3  1008 468 1267
+3  104 2076 1313
+3  1232 692 1269
+3  1053 513 1270
+3  1094 554 1271
+3  634 1313 2076
+3  1076 105 1758
+3  105 1433 1758
+3  253 106 1089
+3  1193 653 1276
+3  1280 740 1277
+3  253 1379 106
+3  1034 494 1279
+3  1277 737 1280
+3  1340 800 1281
+3  1107 567 1282
+3  1012 472 1283
+3  1337 797 1284
+3  1288 748 1285
+3  1081 541 1286
+3  1106 566 1287
+3  1285 745 1288
+3  1320 780 1289
+3  1097 557 1290
+3  1014 474 1291
+3  1177 637 1292
+3  1296 756 1293
+3  1085 545 1294
+3  1096 556 1295
+3  1293 753 1296
+3  1236 696 1297
+3  1055 515 1298
+3  1521 132 177
+3  1233 693 1300
+3  132 1273 1523
+3  132 1523 177
+3  134 1084 1091
+3  1557 1304 771
+3  1084 134 177
+3  1436 140 950
+3  140 1444 950
+3  1564 779 2075
+3  1513 141 692
+3  141 1665 692
+3  1164 142 2330
+3  142 172 2330
+3  172 1628 2330
+3  1071 531 1314
+3  173 1197 1671
+3  1265 725 1316
+3  1204 664 1317
+3  1430 83 2075
+3  1070 530 1319
+3  1289 749 1320
+3  1328 788 1321
+3  1101 561 1322
+3  1082 542 1323
+3  1181 641 1324
+3  1244 704 1325
+3  1059 519 1326
+3  1100 560 1327
+3  1321 781 1328
+3  1336 796 1329
+3  1105 565 1330
+3  1098 558 1331
+3  1185 645 1332
+3  1348 808 1333
+3  1111 571 1334
+3  1104 564 1335
+3  1329 789 1336
+3  1284 744 1337
+3  1079 539 1338
+3  1102 562 1339
+3  1281 741 1340
+3  1228 688 1341
+3  1051 511 1342
+3  1078 538 1343
+3  1249 709 1344
+3  1180 640 1345
+3  1027 487 1346
+3  1062 522 1347
+3  1333 793 1348
+3  1220 680 1349
+3  1047 507 1350
+3  1026 486 1351
+3  1039 778 2078
+3  1070 255 2078
+3  1868 778 2130
+3  1804 27 2130
+3  1819 505 1356
+3  2166 679 1357
+3  1827 509 1358
+3  2182 687 1359
+3  1795 493 1360
+3  2118 655 1361
+3  1843 517 1362
+3  2214 703 1363
+3  1851 521 1364
+3  2230 711 1365
+3  1859 525 1366
+3  2246 719 1367
+3  1867 529 1368
+3  2262 727 1369
+3  1835 513 1370
+3  2198 695 1371
+3  1883 537 1372
+3  2294 743 1373
+3  1891 541 1374
+3  2310 751 1375
+3  1899 545 1376
+3  2326 759 1377
+3  1529 1197 173
+3  174 657 1634
+3  1169 657 174
+3  2285 176 1174
+3  1204 777 2132
+3  949 254 2132
+3  1847 519 1384
+3  2222 707 1385
+3  1951 571 1386
+3  1202 811 1387
+3  1831 511 1388
+3  2190 691 1389
+3  1823 507 1390
+3  2174 683 1391
+3  1731 461 1392
+3  1990 591 1393
+3  1879 535 1394
+3  2286 739 1395
+3  1626 777 2133
+3  1564 83 2133
+3  1265 776 2134
+3  1204 254 2134
+3  2136 776 2135
+3  2256 4 2135
+3  1863 527 1402
+3  2254 723 1403
+3  1723 457 1404
+3  1974 583 1405
+3  1791 491 1406
+3  2110 651 1407
+3  1727 459 1408
+3  1982 587 1409
+3  1787 489 1410
+3  2102 647 1411
+3  1751 471 1412
+3  2030 611 1413
+3  1903 547 1414
+3  1762 2334 1632
+3  1735 463 1416
+3  1998 595 1417
+3  1779 485 1418
+3  2086 639 1419
+3  1739 465 1420
+3  2006 599 1421
+3  1947 569 1422
+3  1353 807 1423
+3  1743 467 1424
+3  2014 603 1425
+3  1815 503 1426
+3  2158 675 1427
+3  1747 469 1428
+3  2022 607 1429
+3  1919 555 1430
+3  2075 779 1431
+3  2285 1272 176
+3  43 178 1072
+3  899 1434 1799
+3  2126 659 1435
+3  1763 1755 549
+3  43 1673 178
+3  1943 567 1438
+3  1399 803 1439
+3  1759 475 1440
+3  2046 619 1441
+3  1923 557 1442
+3  1955 783 1443
+3  952 179 537
+3  179 914 537
+3  1839 515 1446
+3  2206 699 1447
+3  914 1077 537
+3  181 180 1077
+3  180 1196 1077
+3  914 181 1077
+3  1092 194 2344
+3  194 232 2344
+3  1871 531 1454
+3  2270 731 1455
+3  1895 543 1456
+3  2318 755 1457
+3  1931 561 1458
+3  1715 791 1459
+3  1927 559 1460
+3  1803 787 1461
+3  1939 565 1462
+3  1488 799 1463
+3  1935 563 1464
+3  1568 795 1465
+3  1887 539 1466
+3  2302 747 1467
+3  1855 523 1468
+3  2238 715 1469
+3  1783 487 1470
+3  2094 643 1471
+3  938 259 1802
+3  1380 253 762
+3  1987 589 1474
+3  1730 461 1475
+3  1975 583 1476
+3  1970 581 1477
+3  1100 787 1802
+3  1967 7 1775
+3  1983 587 1480
+3  1978 585 1481
+3  1071 774 2141
+3  1379 2141 533
+3  1991 591 1484
+3  1986 589 1485
+3  1971 581 1486
+3  1722 457 1487
+3  1908 774 2142
+3  1868 27 2142
+3  1979 585 1490
+3  1726 459 1491
+3  2007 599 1492
+3  2002 597 1493
+3  2027 609 1494
+3  1750 471 1495
+3  2015 603 1496
+3  2010 601 1497
+3  1995 593 1498
+3  1734 463 1499
+3  2023 607 1500
+3  2018 605 1501
+3  2003 597 1502
+3  1738 465 1503
+3  2031 611 1504
+3  2026 609 1505
+3  2011 601 1506
+3  1742 467 1507
+3  1999 595 1508
+3  1994 593 1509
+3  2019 605 1510
+3  1746 469 1511
+3  2047 619 1512
+3  232 230 2344
+3  230 1449 2344
+3  1018 233 970
+3  233 1760 970
+3  2047 247 1020
+3  2047 1535 247
+3  1073 248 550
+3  248 1452 550
+3  249 1077 1196
+3  1077 249 2285
+3  1758 475 1523
+3  1883 250 251
+3  1883 251 1274
+3  1883 1278 250
+3  494 252 903
+3  494 1171 252
+3  285 1758 1433
+3  1758 285 43
+3  1273 286 1523
+3  1566 788 1775
+3  1336 260 1774
+3  286 1528 1523
+3  312 183 1760
+3  2215 703 1536
+3  2210 701 1537
+3  2315 753 1538
+3  1894 543 1539
+3  1352 807 1540
+3  1383 805 1541
+3  1808 785 1542
+3  1926 559 1543
+3  2183 687 1544
+3  2178 685 1545
+3  1668 793 1546
+3  1934 563 1547
+3  2167 679 1548
+3  2162 677 1549
+3  2235 713 1550
+3  1854 523 1551
+3  2191 691 1552
+3  2186 689 1553
+3  2283 737 1554
+3  1878 535 1555
+3  1019 183 312
+3  318 314 1799
+3  1321 788 1774
+3  1696 86 1773
+3  2127 659 1560
+3  2122 657 1561
+3  1682 789 1773
+3  977 260 1772
+3  2074 779 1564
+3  2133 777 1565
+3  1336 789 1772
+3  1936 29 1719
+3  1924 790 1719
+3  1098 261 1718
+3  2251 721 1570
+3  1862 527 1571
+3  2247 719 1572
+3  2242 717 1573
+3  2163 677 1574
+3  1818 505 1575
+3  2159 675 1576
+3  2154 673 1577
+3  2107 649 1578
+3  1790 491 1579
+3  1201 811 1580
+3  1207 809 1581
+3  2179 685 1582
+3  1826 509 1583
+3  2175 683 1584
+3  2170 681 1585
+3  2099 645 1586
+3  1786 489 1587
+3  1398 803 1588
+3  1473 801 1589
+3  2115 653 1590
+3  1794 493 1591
+3  2271 731 1592
+3  2266 729 1593
+3  2331 761 1594
+3  1902 547 1595
+3  2327 759 1596
+3  2322 757 1597
+3  2211 701 1598
+3  1842 517 1599
+3  2207 699 1600
+3  2202 697 1601
+3  2083 637 1602
+3  1778 485 1603
+3  1802 787 1604
+3  1809 785 1605
+3  2227 709 1606
+3  1850 521 1607
+3  2223 707 1608
+3  2218 705 1609
+3  1382 805 1610
+3  1946 569 1611
+3  2111 651 1612
+3  2106 649 1613
+3  2243 717 1614
+3  1858 525 1615
+3  2239 715 1616
+3  2234 713 1617
+3  2155 673 1618
+3  1814 503 1619
+3  1105 790 1718
+3  1458 86 1715
+3  2259 725 1622
+3  1866 529 1623
+3  2255 723 1624
+3  2250 721 1625
+3  2132 777 1626
+3  1918 555 1627
+3  314 899 1799
+3  895 318 1799
+3  2195 693 1630
+3  1834 513 1631
+3  321 320 322
+3  320 1084 322
+3  1170 174 1634
+3  321 1084 320
+3  2119 655 1636
+3  2114 653 1637
+3  2291 741 1638
+3  1882 537 1639
+3  2287 739 1640
+3  2282 737 1641
+3  1472 801 1642
+3  1942 567 1643
+3  1482 799 1644
+3  1562 797 1645
+3  2307 749 1646
+3  1890 541 1647
+3  2303 747 1648
+3  2298 745 1649
+3  1964 781 1650
+3  1922 557 1651
+3  2087 639 1652
+3  2082 637 1653
+3  2323 757 1654
+3  1898 545 1655
+3  2319 755 1656
+3  2314 753 1657
+3  2203 697 1658
+3  1838 515 1659
+3  2199 695 1660
+3  2194 693 1661
+3  322 1084 623
+3  1091 1084 321
+3  1232 352 353
+3  1232 353 1154
+3  1232 1448 352
+3  355 354 1377
+3  1696 791 1715
+3  984 261 1714
+3  354 1527 1377
+3  1525 355 1377
+3  356 824 357
+3  357 824 1155
+3  2267 729 1674
+3  1870 531 1675
+3  2263 727 1676
+3  2258 725 1677
+3  1098 791 1714
+3  2096 10 1713
+3  2311 751 1680
+3  2306 749 1681
+3  1772 789 1682
+3  1930 561 1683
+3  2095 643 1684
+3  2090 641 1685
+3  2219 705 1686
+3  1846 519 1687
+3  1954 783 1688
+3  1965 781 1689
+3  1558 797 1690
+3  1938 565 1691
+3  2103 647 1692
+3  2098 645 1693
+3  1206 809 1694
+3  1950 571 1695
+3  1714 791 1696
+3  1773 789 1697
+3  2299 745 1698
+3  1886 539 1699
+3  2295 743 1700
+3  2290 741 1701
+3  2187 689 1702
+3  1830 511 1703
+3  2231 711 1704
+3  2226 709 1705
+3  2091 641 1706
+3  1782 487 1707
+3  1567 795 1708
+3  1678 793 1709
+3  2171 681 1710
+3  1822 507 1711
+3  1308 792 1713
+3  1348 262 1712
+3  1185 792 1712
+3  1708 87 1678
+3  2149 670 1716
+3  1972 582 1717
+3  482 1483 33
+3  1301 1173 768
+3  2165 678 1720
+3  1980 586 1721
+3  1487 339 1722
+3  1404 298 1723
+3  2181 686 1724
+3  1988 590 1725
+3  1491 341 1726
+3  1408 300 1727
+3  2117 654 1728
+3  1956 574 1729
+3  1475 333 1730
+3  1392 292 1731
+3  2213 702 1732
+3  2004 598 1733
+3  1499 345 1734
+3  1416 304 1735
+3  2229 710 1736
+3  2012 602 1737
+3  1503 347 1738
+3  1420 306 1739
+3  2245 718 1740
+3  2020 606 1741
+3  1507 349 1742
+3  1424 308 1743
+3  2261 726 1744
+3  2028 610 1745
+3  1511 351 1746
+3  1428 310 1747
+3  2197 694 1748
+3  1996 594 1749
+3  1495 343 1750
+3  1412 302 1751
+3  2293 742 1752
+3  2044 618 1753
+3  824 356 1445
+3  358 2077 1310
+3  2309 750 1756
+3  2052 622 1757
+3  1021 2077 358
+3  1440 316 1759
+3  1670 2325 412
+3  359 759 1754
+3  1526 759 359
+3  360 824 361
+3  361 824 858
+3  1155 824 360
+3  1311 363 175
+3  363 1381 175
+3  1299 374 768
+3  374 1301 768
+3  2325 410 412
+3  410 2325 758
+3  1546 793 1678
+3  1449 768 2344
+3  1092 2344 968
+3  909 262 1668
+3  2221 706 1776
+3  2212 702 1777
+3  1603 397 1778
+3  1418 305 1779
+3  1203 810 1780
+3  1355 806 1781
+3  1707 449 1782
+3  1470 331 1783
+3  2189 690 1784
+3  2180 686 1785
+3  1587 389 1786
+3  1410 301 1787
+3  2173 682 1788
+3  2164 678 1789
+3  1579 385 1790
+3  1406 299 1791
+3  1989 590 1792
+3  2188 690 1793
+3  1591 391 1794
+3  1360 276 1795
+3  758 1167 410
+3  1524 413 2329
+3  413 1522 2329
+3  1434 313 1799
+3  1957 574 1800
+3  2124 658 1801
+3  155 1559 2140
+3  1348 793 1668
+3  2077 634 1804
+3  2130 778 1805
+3  1117 1679 435
+3  1948 29 1620
+3  1936 794 1620
+3  1104 263 1569
+3  1111 794 1569
+3  1464 87 1568
+3  2253 722 1812
+3  2244 718 1813
+3  1619 405 1814
+3  1426 309 1815
+3  1973 582 1816
+3  2156 674 1817
+3  1575 383 1818
+3  1356 274 1819
+3  2109 650 1820
+3  1205 810 1821
+3  1711 451 1822
+3  1390 291 1823
+3  1981 586 1824
+3  2172 682 1825
+3  1583 387 1826
+3  1358 275 1827
+3  2101 646 1828
+3  1401 802 1829
+3  1703 447 1830
+3  1388 290 1831
+3  2029 610 1832
+3  2268 730 1833
+3  1631 411 1834
+3  1370 281 1835
+3  1522 1304 2329
+3  427 1016 2325
+3  1659 425 1838
+3  1446 319 1839
+3  1997 594 1840
+3  2204 698 1841
+3  1599 395 1842
+3  1362 277 1843
+3  2085 638 1844
+3  1807 786 1845
+3  1687 439 1846
+3  1384 288 1847
+3  2005 598 1848
+3  2220 706 1849
+3  1607 399 1850
+3  1364 278 1851
+3  1354 806 1852
+3  2108 650 1853
+3  1551 371 1854
+3  1468 330 1855
+3  2013 602 1856
+3  2236 714 1857
+3  1615 403 1858
+3  1366 279 1859
+3  2157 674 1860
+3  2148 670 1861
+3  1571 381 1862
+3  1402 297 1863
+3  2021 606 1864
+3  2252 722 1865
+3  1623 407 1866
+3  1368 280 1867
+3  2078 778 1868
+3  2142 774 1869
+3  1675 433 1870
+3  1454 323 1871
+3  2325 1667 427
+3  428 2329 1663
+3  429 2329 428
+3  1524 2329 429
+3  2125 658 1876
+3  2116 654 1877
+3  1555 373 1878
+3  1394 293 1879
+3  431 175 2047
+3  2047 1020 431
+3  1639 415 1882
+3  1372 282 1883
+3  1400 802 1884
+3  1533 798 1885
+3  1699 445 1886
+3  1466 329 1887
+3  2045 618 1888
+3  2300 746 1889
+3  1647 419 1890
+3  1374 283 1891
+3  1958 782 1892
+3  2084 638 1893
+3  1539 365 1894
+3  1456 324 1895
+3  2053 622 1896
+3  2316 754 1897
+3  1655 423 1898
+3  1376 284 1899
+3  2205 698 1900
+3  2196 694 1901
+3  1595 393 1902
+3  1414 303 1903
+3  1019 432 183
+3  432 1310 183
+3  900 113 1279
+3  1528 476 1523
+3  2141 774 1908
+3  1662 2076 104
+3  476 477 1523
+3  477 1076 1758
+3  477 1758 1523
+3  2267 478 479
+3  478 480 479
+3  2267 479 1093
+3  2269 730 1916
+3  2260 726 1917
+3  1627 409 1918
+3  1430 311 1919
+3  2317 754 1920
+3  2308 750 1921
+3  1651 421 1922
+3  1442 317 1923
+3  1718 790 1924
+3  2092 642 1925
+3  1543 367 1926
+3  1460 326 1927
+3  1806 786 1928
+3  1962 782 1929
+3  1683 437 1930
+3  1458 325 1931
+3  1532 798 1932
+3  2100 646 1933
+3  1547 369 1934
+3  1464 328 1935
+3  1569 794 1936
+3  1719 790 1937
+3  1691 441 1938
+3  1462 327 1939
+3  2301 746 1940
+3  2292 742 1941
+3  1643 417 1942
+3  1438 315 1943
+3  2237 714 1944
+3  2228 710 1945
+3  1611 401 1946
+3  1422 307 1947
+3  2093 642 1948
+3  1620 794 1949
+3  1695 443 1950
+3  1386 289 1951
+3  1961 576 1952
+3  1984 588 1953
+3  2350 1489 2043
+3  1708 795 1568
+3  1729 460 1956
+3  1800 496 1957
+3  990 263 1567
+3  54 1959 2348
+3  1969 580 1960
+3  1952 572 1961
+3  1104 795 1567
+3  661 337 2123
+3  1775 7 1566
+3  2296 796 1566
+3  1284 264 1563
+3  1329 796 1563
+3  1977 584 1968
+3  1960 576 1969
+3  1477 334 1970
+3  1486 339 1971
+3  1717 454 1972
+3  1816 504 1973
+3  1405 298 1974
+3  1476 334 1975
+3  1985 588 1976
+3  1968 580 1977
+3  1481 336 1978
+3  1490 341 1979
+3  1721 456 1980
+3  1824 508 1981
+3  1409 300 1982
+3  1480 336 1983
+3  1953 572 1984
+3  1976 584 1985
+3  1485 338 1986
+3  1474 333 1987
+3  1725 458 1988
+3  1792 492 1989
+3  1393 292 1990
+3  1484 338 1991
+3  2001 596 1992
+3  2024 608 1993
+3  1509 350 1994
+3  1498 345 1995
+3  1749 470 1996
+3  1840 516 1997
+3  1417 304 1998
+3  1508 350 1999
+3  2009 600 2000
+3  1992 592 2001
+3  1493 342 2002
+3  1502 347 2003
+3  1733 462 2004
+3  1848 520 2005
+3  1421 306 2006
+3  1492 342 2007
+3  2017 604 2008
+3  2000 596 2009
+3  1497 344 2010
+3  1506 349 2011
+3  1737 464 2012
+3  1856 524 2013
+3  1425 308 2014
+3  1496 344 2015
+3  2025 608 2016
+3  2008 600 2017
+3  1501 346 2018
+3  1510 351 2019
+3  1741 466 2020
+3  1864 528 2021
+3  1429 310 2022
+3  1500 346 2023
+3  1993 592 2024
+3  2016 604 2025
+3  1505 348 2026
+3  1494 343 2027
+3  1745 468 2028
+3  1832 512 2029
+3  1413 302 2030
+3  1504 348 2031
+3  2267 480 478
+3  2267 1437 480
+3  1534 481 761
+3  481 1165 2330
+3  481 2330 761
+3  495 2047 514
+3  514 2047 1512
+3  1512 1054 514
+3  1169 532 657
+3  532 1671 657
+3  533 2141 1088
+3  2141 1379 253
+3  1753 472 2044
+3  1888 540 2045
+3  1441 316 2046
+3  1535 2047 495
+3  548 536 1173
+3  536 1306 1173
+3  969 548 1173
+3  549 1755 551
+3  1757 474 2052
+3  1896 544 2053
+3  551 1755 473
+3  473 972 551
+3  552 79 1628
+3  2330 1628 79
+3  612 553 1377
+3  553 1161 858
+3  1527 612 1377
+3  553 858 1377
+3  1662 613 2076
+3  613 1450 2076
+3  1450 550 2076
+3  614 1512 43
+3  43 1072 614
+3  895 1799 113
+3  758 615 1166
+3  758 1666 615
+3  616 494 2285
+3  617 2285 1174
+3  1275 2129 852
+3  2344 768 2073
+3  1644 88 1562
+3  1531 2328 1516
+3  2285 617 616
+3  1804 498 2077
+3  1690 797 1562
+3  501 114 2079
+3  2209 700 2080
+3  2312 752 2081
+3  1653 422 2082
+3  1602 397 2083
+3  1893 542 2084
+3  1844 518 2085
+3  1419 305 2086
+3  1652 422 2087
+3  1396 804 2088
+3  1811 784 2089
+3  1685 438 2090
+3  1706 449 2091
+3  1925 558 2092
+3  1948 570 2093
+3  1471 331 2094
+3  1684 438 2095
+3  2177 684 2096
+3  1713 792 2097
+3  1693 442 2098
+3  1586 389 2099
+3  1933 562 2100
+3  1828 510 2101
+3  1411 301 2102
+3  1692 442 2103
+3  2161 676 2104
+3  2232 712 2105
+3  1613 402 2106
+3  1578 385 2107
+3  1853 522 2108
+3  1820 506 2109
+3  1407 299 2110
+3  1612 402 2111
+3  2185 688 2112
+3  2280 736 2113
+3  1637 414 2114
+3  1590 391 2115
+3  1877 534 2116
+3  1728 460 2117
+3  1361 276 2118
+3  1636 414 2119
+3  1634 620 621
+3  1634 621 1168
+3  1561 376 2122
+3  1634 1514 620
+3  1801 496 2124
+3  1876 534 2125
+3  1435 313 2126
+3  1560 376 2127
+3  1035 624 634
+3  2072 632 2129
+3  981 264 1558
+3  1284 797 1558
+3  1414 79 2334
+3  1884 30 1533
+3  1932 798 1533
+3  1102 265 1532
+3  2134 776 2136
+3  2144 668 2137
+3  1079 798 1532
+3  1118 435 2279
+3  1304 761 2331
+3  933 246 2331
+3  1594 761 2330
+3  1629 79 552
+3  2137 664 2144
+3  2248 720 2145
+3  1233 760 2329
+3  1304 246 2329
+3  1861 526 2148
+3  1716 454 2149
+3  2336 760 2328
+3  1041 2151 573
+3  2241 716 2152
+3  2160 676 2153
+3  1577 384 2154
+3  1618 405 2155
+3  1817 504 2156
+3  1860 526 2157
+3  1427 309 2158
+3  1576 384 2159
+3  2153 672 2160
+3  2104 648 2161
+3  1549 370 2162
+3  1574 383 2163
+3  1789 490 2164
+3  1720 456 2165
+3  1357 274 2166
+3  1548 370 2167
+3  1260 808 2168
+3  2176 684 2169
+3  1585 388 2170
+3  1710 451 2171
+3  1825 508 2172
+3  1788 490 2173
+3  1391 291 2174
+3  1584 388 2175
+3  2169 680 2176
+3  2096 644 2177
+3  1545 368 2178
+3  1582 387 2179
+3  1785 488 2180
+3  1724 458 2181
+3  1359 275 2182
+3  1544 368 2183
+3  1478 800 2184
+3  2112 652 2185
+3  1553 372 2186
+3  1702 447 2187
+3  1793 492 2188
+3  1784 488 2189
+3  1389 290 2190
+3  1552 372 2191
+3  624 1313 634
+3  2328 760 2193
+3  1661 426 2194
+3  1630 411 2195
+3  1901 546 2196
+3  1748 470 2197
+3  1371 281 2198
+3  1660 426 2199
+3  2321 756 2200
+3  2208 700 2201
+3  1601 396 2202
+3  1658 425 2203
+3  1841 516 2204
+3  1900 546 2205
+3  1447 319 2206
+3  1600 396 2207
+3  2201 696 2208
+3  2080 636 2209
+3  1537 364 2210
+3  1598 395 2211
+3  1777 484 2212
+3  1732 462 2213
+3  1363 277 2214
+3  1536 364 2215
+3  1810 784 2216
+3  2224 708 2217
+3  1609 400 2218
+3  1686 439 2219
+3  1849 520 2220
+3  1776 484 2221
+3  1385 288 2222
+3  1608 400 2223
+3  2217 704 2224
+3  1397 804 2225
+3  1705 448 2226
+3  1606 399 2227
+3  1945 568 2228
+3  1736 464 2229
+3  1365 278 2230
+3  1704 448 2231
+3  2105 648 2232
+3  2240 716 2233
+3  1617 404 2234
+3  1550 371 2235
+3  1857 524 2236
+3  1944 568 2237
+3  1469 330 2238
+3  1616 404 2239
+3  2233 712 2240
+3  2152 672 2241
+3  1573 382 2242
+3  1614 403 2243
+3  1813 502 2244
+3  1740 466 2245
+3  1367 279 2246
+3  1572 382 2247
+3  2145 668 2248
+3  2256 724 2249
+3  1625 408 2250
+3  1570 381 2251
+3  1865 528 2252
+3  1812 502 2253
+3  1403 297 2254
+3  1624 408 2255
+3  2249 720 2256
+3  2135 776 2257
+3  1677 434 2258
+3  1622 407 2259
+3  1917 554 2260
+3  1744 468 2261
+3  1369 280 2262
+3  1676 434 2263
+3  625 854 1755
+3  626 854 625
+3  1593 392 2266
+3  1674 433 2267
+3  1833 512 2268
+3  1916 554 2269
+3  1455 323 2270
+3  1592 392 2271
+3  1305 854 626
+3  1380 627 950
+3  627 1436 950
+3  2325 628 1667
+3  2325 1670 628
+3  1304 1522 1520
+3  1415 629 630
+3  1415 630 1633
+3  2113 652 2280
+3  2288 740 2281
+3  1641 416 2282
+3  1554 373 2283
+3  1415 1762 629
+3  1556 494 616
+3  1395 293 2286
+3  1640 416 2287
+3  2281 736 2288
+3  1479 800 2289
+3  1701 446 2290
+3  1638 415 2291
+3  1941 566 2292
+3  1752 472 2293
+3  1373 282 2294
+3  1700 446 2295
+3  1563 796 2296
+3  2304 748 2297
+3  1649 420 2298
+3  1698 445 2299
+3  1889 540 2300
+3  1940 566 2301
+3  1467 329 2302
+3  1648 420 2303
+3  2297 744 2304
+3  1967 780 2305
+3  1681 436 2306
+3  1646 419 2307
+3  1921 556 2308
+3  1756 474 2309
+3  1375 283 2310
+3  1680 436 2311
+3  2081 636 2312
+3  2320 756 2313
+3  1657 424 2314
+3  1538 365 2315
+3  1897 544 2316
+3  1920 556 2317
+3  1457 324 2318
+3  1656 424 2319
+3  2313 752 2320
+3  2200 696 2321
+3  1597 394 2322
+3  1654 423 2323
+3  656 631 1016
+3  631 1754 1016
+3  1377 284 2326
+3  1596 394 2327
+3  2193 692 2328
+3  1663 2329 2336
+3  1672 656 1016
+3  1594 393 2331
+3  732 660 1013
+3  660 728 1013
+3  1415 303 2334
+3  732 728 660
+3  2329 760 2336
+3  728 1309 473
+3  1453 732 1013
+3  728 473 1013
+3  761 733 1534
+3  761 1557 733
+3  550 734 1073
+3  550 1450 734
+3  2073 632 2344
+3  738 735 123
+3  735 1764 123
+3  1664 738 123
+3  762 253 1089
+3  253 1380 950
+3  854 763 822
+3  763 1303 822
+3  1305 764 854
+3  764 763 854
+3  1432 765 177
+3  765 1521 177
+3  1869 530 2142
+3  1908 550 2141
+3  971 766 1669
+3  766 767 1669
+3  2257 724 2135
+3  2136 664 2134
+3  1565 378 2133
+3  1626 409 2132
+3  1805 498 2130
+3  1868 530 2078
+3  1431 311 2075
+3  1564 378 2074
+3  2305 748 1967
+3  1775 788 1966
+3  1689 440 1965
+3  1650 421 1964
+3  1929 560 1962
+3  1892 542 1958
+3  1443 317 1955
+3  1688 440 1954
+3  2089 640 1811
+3  2216 704 1810
+3  1605 398 1809
+3  1542 367 1808
+3  1845 518 1807
+3  1928 560 1806
+3  1461 326 1803
+3  1604 398 1802
+3  1966 780 1775
+3  1566 796 1774
+3  1697 444 1773
+3  1682 437 1772
+3  1937 564 1719
+3  1924 558 1718
+3  1459 325 1715
+3  1696 444 1714
+3  2097 644 1713
+3  1308 808 1712
+3  1709 450 1678
+3  1546 369 1668
+3  1949 570 1620
+3  1936 564 1569
+3  1465 328 1568
+3  1708 450 1567
+3  1774 788 1566
+3  2296 744 1563
+3  1645 418 1562
+3  1690 441 1558
+3  1885 538 1533
+3  1932 562 1532
+3  1463 327 1488
+3  1644 418 1482
+3  2289 740 1479
+3  2184 688 1478
+3  1589 390 1473
+3  1642 417 1472
+3  1829 510 1401
+3  1884 538 1400
+3  1439 315 1399
+3  1588 390 1398
+3  2225 708 1397
+3  2088 640 1396
+3  1541 366 1383
+3  1610 401 1382
+3  1781 486 1355
+3  1852 522 1354
+3  1423 307 1353
+3  1540 366 1352
+3  1712 792 1308
+3  2168 680 1260
+3  1581 386 1207
+3  1694 443 1206
+3  1821 506 1205
+3  1780 486 1203
+3  1387 289 1202
+3  1580 386 1201
+3  1462 88 1488
+3  1016 759 2327
+3  934 245 2327
+3  1596 759 2326
+3  1405 118 814
+3  1819 274 814
+3  1409 120 815
+3  1827 275 815
+3  1393 112 816
+3  1795 276 816
+3  1417 124 817
+3  1843 277 817
+3  1421 126 818
+3  1851 278 818
+3  1425 128 819
+3  1859 279 819
+3  1429 130 820
+3  1867 280 820
+3  1413 122 821
+3  1835 281 821
+3  767 769 1669
+3  1883 282 822
+3  1441 136 823
+3  1891 283 823
+3  1445 138 824
+3  1899 284 824
+3  769 1017 1669
+3  767 766 769
+3  1415 1633 123
+3  2336 770 1160
+3  1376 78 2326
+3  1055 758 2325
+3  1419 125 828
+3  1847 288 828
+3  1471 151 829
+3  1951 289 829
+3  1411 121 830
+3  1831 290 830
+3  1407 119 831
+3  1823 291 831
+3  1361 96 832
+3  1731 292 832
+3  1435 133 833
+3  1879 293 833
+3  1016 245 2325
+3  1644 799 1488
+3  958 265 1482
+3  1236 757 2323
+3  963 244 2323
+3  1654 757 2322
+3  1427 129 837
+3  1863 297 837
+3  1357 94 838
+3  1723 298 838
+3  1391 111 839
+3  1791 299 839
+3  1359 95 840
+3  1727 300 840
+3  1389 110 841
+3  1787 301 841
+3  1371 101 842
+3  1751 302 842
+3  1447 139 843
+3  1903 303 843
+3  1363 97 844
+3  1735 304 844
+3  1385 108 845
+3  1779 305 845
+3  1365 98 846
+3  1739 306 846
+3  1469 150 847
+3  1947 307 847
+3  1367 99 848
+3  1743 308 848
+3  1403 117 849
+3  1815 309 849
+3  1369 100 850
+3  1747 310 850
+3  1455 143 851
+3  1919 311 851
+3  2336 1531 770
+3  771 1304 1520
+3  1395 113 853
+3  1799 313 853
+3  1373 102 854
+3  1378 625 1755
+3  1467 149 855
+3  1943 315 855
+3  1375 103 856
+3  1759 316 856
+3  1457 144 857
+3  1923 317 857
+3  1304 1557 761
+3  953 772 2072
+3  1415 123 859
+3  1839 319 859
+3  772 968 2072
+3  2328 773 775
+3  2328 775 825
+3  2328 825 1516
+3  2328 1517 773
+3  826 2129 1200
+3  1431 131 863
+3  1871 323 863
+3  1443 137 864
+3  1895 324 864
+3  1461 146 865
+3  1931 325 865
+3  1459 145 866
+3  1927 326 866
+3  1465 148 867
+3  1939 327 867
+3  1463 147 868
+3  1935 328 868
+3  1439 135 869
+3  1887 329 869
+3  1423 127 870
+3  1855 330 870
+3  1387 109 871
+3  1783 331 871
+3  1596 78 2322
+3  1293 756 2321
+3  1489 160 873
+3  1987 333 873
+3  1483 157 874
+3  1975 334 874
+3  1236 244 2321
+3  2200 756 2320
+3  1487 159 876
+3  1983 336 876
+3  1477 154 877
+3  1963 337 877
+3  1491 161 878
+3  1991 338 878
+3  1481 156 879
+3  1971 339 879
+3  1475 153 880
+3  1959 340 880
+3  1485 158 881
+3  1979 341 881
+3  1499 165 882
+3  2007 342 882
+3  1509 170 883
+3  2027 343 883
+3  1503 167 884
+3  2015 344 884
+3  1493 162 885
+3  1995 345 885
+3  1507 169 886
+3  2023 346 886
+3  1497 164 887
+3  2003 347 887
+3  1511 171 888
+3  2031 348 888
+3  1501 166 889
+3  2011 349 889
+3  1495 163 890
+3  1999 350 890
+3  1505 168 891
+3  2019 351 891
+3  852 2129 826
+3  2129 1275 2072
+3  860 1298 861
+3  861 1298 1635
+3  1298 1666 758
+3  2334 862 892
+3  2334 892 1632
+3  2334 1761 862
+3  894 893 1445
+3  893 623 1445
+3  1451 894 1445
+3  893 1153 623
+3  2312 3 2320
+3  1036 2347 1959
+3  1096 755 2319
+3  2146 2143 1953
+3  964 243 2319
+3  2138 13 1112
+3  1656 755 2318
+3  1959 54 340
+3  1456 77 2318
+3  1085 754 2317
+3  1122 93 92
+3  1096 243 2317
+3  1603 217 904
+3  2215 364 904
+3  1653 242 905
+3  2315 365 905
+3  1707 269 906
+3  1352 366 906
+3  1685 258 907
+3  1808 367 907
+3  1587 209 908
+3  2183 368 908
+3  1693 262 909
+3  1668 369 909
+3  1579 205 910
+3  2167 370 910
+3  1613 222 911
+3  2235 371 911
+3  1591 211 912
+3  2191 372 912
+3  1637 234 913
+3  2283 373 913
+3  1920 754 2316
+3  375 2140 1559
+3  1561 196 915
+3  2131 375 915
+3  1559 195 916
+3  2127 376 916
+3  1896 24 2316
+3  1296 753 2315
+3  1679 255 918
+3  2074 378 918
+3  905 242 2315
+3  1538 753 2314
+3  1656 77 2314
+3  1177 752 2313
+3  1621 226 921
+3  2251 381 921
+3  1619 225 922
+3  2247 382 922
+3  1577 204 923
+3  2163 383 923
+3  1575 203 924
+3  2159 384 924
+3  1549 190 925
+3  2107 385 925
+3  1711 271 926
+3  1201 386 926
+3  1585 208 927
+3  2179 387 927
+3  1583 207 928
+3  2175 388 928
+3  1545 188 929
+3  2099 389 929
+3  1703 267 930
+3  1398 390 930
+3  1553 192 931
+3  2115 391 931
+3  1631 231 932
+3  2271 392 932
+3  1661 246 933
+3  2331 393 933
+3  1659 245 934
+3  2327 394 934
+3  1601 216 935
+3  2211 395 935
+3  1599 215 936
+3  2207 396 936
+3  1537 184 937
+3  2083 397 937
+3  1687 259 938
+3  1802 398 938
+3  1609 220 939
+3  2227 399 939
+3  1607 219 940
+3  2223 400 940
+3  1705 268 941
+3  1382 401 941
+3  1551 191 942
+3  2111 402 942
+3  1617 224 943
+3  2243 403 943
+3  1615 223 944
+3  2239 404 944
+3  1573 202 945
+3  2155 405 945
+3  1571 201 946
+3  2151 406 946
+3  1625 228 947
+3  2259 407 947
+3  1623 227 948
+3  2255 408 948
+3  1677 254 949
+3  2132 409 949
+3  1675 253 950
+3  1172 294 272
+3  1593 212 951
+3  2195 411 951
+3  1296 242 2313
+3  2320 752 2312
+3  1483 56 995
+3  287 1037 335
+3  1555 193 954
+3  2119 414 954
+3  1641 236 955
+3  2291 415 955
+3  1639 235 956
+3  2287 416 956
+3  1701 266 957
+3  1472 417 957
+3  1699 265 958
+3  1482 418 958
+3  1649 240 959
+3  2307 419 959
+3  1647 239 960
+3  2303 420 960
+3  1681 256 961
+3  1964 421 961
+3  1539 185 962
+3  2087 422 962
+3  1657 244 963
+3  2323 423 963
+3  1655 243 964
+3  2319 424 964
+3  1597 214 965
+3  2203 425 965
+3  1595 213 966
+3  2199 426 966
+3  2080 3 2312
+3  1014 751 2311
+3  107 379 1173
+3  976 241 2311
+3  337 33 1483
+3  1211 483 453
+3  1760 183 970
+3  2079 430 970
+3  1680 751 2310
+3  114 430 2079
+3  1374 76 2310
+3  575 2151 994
+3  1097 750 2309
+3  1437 433 1090
+3  1627 229 974
+3  2263 434 974
+3  1565 198 975
+3  2139 435 975
+3  1651 241 976
+3  2311 436 976
+3  1689 260 977
+3  1772 437 977
+3  1543 187 978
+3  2095 438 978
+3  1605 218 979
+3  2219 439 979
+3  1683 257 980
+3  1954 440 980
+3  1697 264 981
+3  1558 441 981
+3  1547 189 982
+3  2103 442 982
+3  1709 270 983
+3  1206 443 983
+3  1691 261 984
+3  1714 444 984
+3  1645 238 985
+3  2299 445 985
+3  1643 237 986
+3  2295 446 986
+3  1589 210 987
+3  2187 447 987
+3  1611 221 988
+3  2231 448 988
+3  1541 186 989
+3  2091 449 989
+3  1695 263 990
+3  1567 450 990
+3  1581 206 991
+3  2171 451 991
+3  1014 241 2309
+3  1756 750 2308
+3  1920 24 2308
+3  1320 749 2307
+3  2151 201 994
+3  2149 454 994
+3  1973 157 995
+3  296 995 56
+3  2167 205 996
+3  2165 456 996
+3  1981 159 997
+3  1487 457 997
+3  2183 209 998
+3  2181 458 998
+3  1989 161 999
+3  1491 459 999
+3  2119 193 1000
+3  2117 460 1000
+3  1957 153 1001
+3  1475 461 1001
+3  2215 217 1002
+3  2213 462 1002
+3  2005 165 1003
+3  1499 463 1003
+3  2231 221 1004
+3  2229 464 1004
+3  2013 167 1005
+3  1503 465 1005
+3  2247 225 1006
+3  2245 466 1006
+3  2021 169 1007
+3  1507 467 1007
+3  2263 229 1008
+3  2261 468 1008
+3  2029 171 1009
+3  1511 469 1009
+3  2199 213 1010
+3  2197 470 1010
+3  1997 163 1011
+3  1495 471 1011
+3  2295 237 1012
+3  2293 472 1012
+3  2045 175 1013
+3  1963 578 32
+3  2311 241 1014
+3  2309 474 1014
+3  2053 177 1015
+3  1523 475 1015
+3  2327 245 1016
+3  1672 1016 427
+3  959 240 2307
+3  1175 633 579
+3  1646 749 2306
+3  1680 76 2306
+3  2150 635 1113
+3  1285 748 2305
+3  662 663 1621
+3  2073 671 55
+3  1320 240 2305
+3  2145 812 377
+3  1967 748 2304
+3  2296 7 2304
+3  1106 747 2303
+3  960 239 2303
+3  2223 219 1024
+3  2221 484 1024
+3  2213 217 1025
+3  1603 485 1025
+3  1201 271 1026
+3  1203 486 1026
+3  1354 269 1027
+3  1707 487 1027
+3  2191 211 1028
+3  2189 488 1028
+3  2181 209 1029
+3  1587 489 1029
+3  2175 207 1030
+3  2173 490 1030
+3  2165 205 1031
+3  1579 491 1031
+3  1991 161 1032
+3  1989 492 1032
+3  2189 211 1033
+3  1591 493 1033
+3  2287 235 1034
+3  2285 494 1034
+3  1648 747 2302
+3  115 2079 1038
+3  1959 153 1036
+3  1957 496 1036
+3  2125 195 1037
+3  335 1037 1559
+3  2079 183 1038
+3  2077 498 1038
+3  2078 255 1039
+3  919 1039 1679
+3  1466 75 2302
+3  1081 746 2301
+3  1106 239 2301
+3  1940 746 2300
+3  2255 227 1042
+3  2253 502 1042
+3  2245 225 1043
+3  1619 503 1043
+3  1975 157 1044
+3  1973 504 1044
+3  2157 203 1045
+3  1575 505 1045
+3  2111 191 1046
+3  2109 506 1046
+3  1203 271 1047
+3  1711 507 1047
+3  1983 159 1048
+3  1981 508 1048
+3  2173 207 1049
+3  1583 509 1049
+3  2103 189 1050
+3  2101 510 1050
+3  1400 267 1051
+3  1703 511 1051
+3  2031 171 1052
+3  2029 512 1052
+3  2269 231 1053
+3  1631 513 1053
+3  1888 23 2300
+3  1209 836 834
+3  2325 245 1055
+3  1659 515 1055
+3  1999 163 1056
+3  1997 516 1056
+3  2205 215 1057
+3  1599 517 1057
+3  2087 185 1058
+3  2085 518 1058
+3  1806 259 1059
+3  1687 519 1059
+3  2007 165 1060
+3  2005 520 1060
+3  2221 219 1061
+3  1607 521 1061
+3  1352 269 1062
+3  1354 522 1062
+3  2109 191 1063
+3  1551 523 1063
+3  2015 167 1064
+3  2013 524 1064
+3  2237 223 1065
+3  1615 525 1065
+3  2159 203 1066
+3  2157 526 1066
+3  2149 201 1067
+3  1571 527 1067
+3  2023 169 1068
+3  2021 528 1068
+3  2253 227 1069
+3  1623 529 1069
+3  2074 255 1070
+3  2078 530 1070
+3  2141 253 1071
+3  1675 531 1071
+3  1288 745 2299
+3  872 1039 919
+3  985 238 2299
+3  1698 745 2298
+3  2127 195 1074
+3  2125 534 1074
+3  2117 193 1075
+3  1555 535 1075
+3  116 500 1318
+3  1208 1040 1023
+3  2285 235 1077
+3  1639 537 1077
+3  1398 267 1078
+3  1400 538 1078
+3  1532 265 1079
+3  1699 539 1079
+3  2047 175 1080
+3  2045 540 1080
+3  2301 239 1081
+3  1647 541 1081
+3  1954 257 1082
+3  1958 542 1082
+3  2085 185 1083
+3  1539 543 1083
+3  1432 177 134
+3  2053 544 1084
+3  2317 243 1085
+3  1655 545 1085
+3  2207 215 1086
+3  2205 546 1086
+3  2197 213 1087
+3  1595 547 1087
+3  1648 75 2298
+3  1337 744 2297
+3  2151 1041 406
+3  1211 1765 483
+3  1288 238 2297
+3  1452 2141 550
+3  1310 2077 183
+3  1211 499 1765
+3  2304 744 2296
+3  1566 7 2296
+3  1766 1038 1767
+3  1012 743 2295
+3  2271 231 1094
+3  2269 554 1094
+3  2261 229 1095
+3  1627 555 1095
+3  2319 243 1096
+3  2317 556 1096
+3  2309 241 1097
+3  1651 557 1097
+3  1714 261 1098
+3  1718 558 1098
+3  2093 187 1099
+3  1543 559 1099
+3  1802 259 1100
+3  1806 560 1100
+3  1958 257 1101
+3  1683 561 1101
+3  1482 265 1102
+3  1532 562 1102
+3  2101 189 1103
+3  1547 563 1103
+3  1567 263 1104
+3  1569 564 1104
+3  1718 261 1105
+3  1691 565 1105
+3  2303 239 1106
+3  2301 566 1106
+3  2293 237 1107
+3  1643 567 1107
+3  2239 223 1108
+3  2237 568 1108
+3  2229 221 1109
+3  1611 569 1109
+3  2095 187 1110
+3  2093 570 1110
+3  1569 263 1111
+3  1695 571 1111
+3  1963 154 1112
+3  1961 572 1112
+3  1985 160 1113
+3  2150 1113 2278
+3  1731 96 1114
+3  1729 574 1114
+3  497 1801 2337
+3  986 237 2295
+3  1971 156 1116
+3  1969 576 1116
+3  1700 743 2294
+3  1372 74 2294
+3  1107 742 2293
+3  1012 237 2293
+3  1752 742 2292
+3  1940 23 2292
+3  1979 158 1120
+3  1977 580 1120
+3  1961 154 1121
+3  1477 581 1121
+3  1340 741 2291
+3  1717 582 1122
+3  1817 118 1123
+3  1405 583 1123
+3  1987 160 1124
+3  1985 584 1124
+3  1969 156 1125
+3  1481 585 1125
+3  1723 94 1126
+3  1721 586 1126
+3  1825 120 1127
+3  1409 587 1127
+3  955 236 2291
+3  1638 741 2290
+3  1977 158 1129
+3  1485 589 1129
+3  1727 95 1130
+3  1725 590 1130
+3  1793 112 1131
+3  1393 591 1131
+3  2003 164 1132
+3  2001 592 1132
+3  2025 170 1133
+3  1509 593 1133
+3  1751 101 1134
+3  1749 594 1134
+3  1841 124 1135
+3  1417 595 1135
+3  2011 166 1136
+3  2009 596 1136
+3  1993 162 1137
+3  1493 597 1137
+3  1735 97 1138
+3  1733 598 1138
+3  1849 126 1139
+3  1421 599 1139
+3  2019 168 1140
+3  2017 600 1140
+3  2001 164 1141
+3  1497 601 1141
+3  1739 98 1142
+3  1737 602 1142
+3  1857 128 1143
+3  1425 603 1143
+3  2027 170 1144
+3  2025 604 1144
+3  2009 166 1145
+3  1501 605 1145
+3  1743 99 1146
+3  1741 606 1146
+3  1865 130 1147
+3  1429 607 1147
+3  1995 162 1148
+3  1993 608 1148
+3  2017 168 1149
+3  1505 609 1149
+3  1747 100 1150
+3  1745 610 1150
+3  1833 122 1151
+3  1413 611 1151
+3  1767 1038 1175
+3  1700 74 2290
+3  1175 579 1767
+3  920 1679 1117
+3  1277 740 2289
+3  1340 236 2289
+3  993 1022 2139
+3  1479 740 2288
+3  1768 1805 669
+3  666 1805 1768
+3  2280 2 2288
+3  435 1769 1117
+3  1755 102 1158
+3  1753 618 1158
+3  1889 136 1159
+3  1441 619 1159
+3  1034 739 2287
+3  435 1118 1769
+3  956 235 2287
+3  1669 875 665
+3  1759 103 1162
+3  1757 622 1162
+3  1897 138 1163
+3  1445 623 1163
+3  1640 739 2286
+3  1771 1770 1208
+3  1770 993 2139
+3  1023 1771 1208
+3  1394 73 2286
+3  1770 2139 1208
+3  1272 2285 249
+3  1115 455 2345
+3  1034 235 2285
+3  2347 1796 1959
+3  1796 1797 1959
+3  1102 799 1482
+3  1797 2348 1959
+3  2288 2 1479
+3  1280 737 2283
+3  340 1798 2349
+3  2131 196 1172
+3  2129 632 1172
+3  913 234 2283
+3  665 1904 1669
+3  340 54 1798
+3  1554 737 2282
+3  835 1805 1913
+3  1640 73 2282
+3  2211 216 1176
+3  2209 636 1176
+3  2313 242 1177
+3  1653 637 1177
+3  1895 137 1178
+3  1893 638 1178
+3  1845 125 1179
+3  1419 639 1179
+3  1382 268 1180
+3  1396 640 1180
+3  1810 258 1181
+3  1685 641 1181
+3  1927 145 1182
+3  1925 642 1182
+3  1949 151 1183
+3  1471 643 1183
+3  2179 208 1184
+3  2177 644 1184
+3  1712 262 1185
+3  1693 645 1185
+3  1935 147 1186
+3  1933 646 1186
+3  1829 121 1187
+3  1411 647 1187
+3  2163 204 1188
+3  2161 648 1188
+3  2233 222 1189
+3  1613 649 1189
+3  1855 127 1190
+3  1853 650 1190
+3  1821 119 1191
+3  1407 651 1191
+3  2187 210 1192
+3  2185 652 1192
+3  2281 234 1193
+3  1637 653 1193
+3  1879 133 1194
+3  1877 654 1194
+3  1729 96 1195
+3  1361 655 1195
+3  1193 736 2281
+3  1836 1037 1837
+3  2129 196 1197
+3  1561 657 1197
+3  1280 234 2281
+3  1801 658 1198
+3  1877 133 1199
+3  1435 659 1199
+3  2288 736 2280
+3  1837 1037 287
+3  2112 2 2280
+3  2184 800 1479
+3  1228 266 1478
+3  1281 800 1478
+3  1588 89 1473
+3  1642 801 1473
+3  2132 254 1204
+3  2134 664 1204
+3  957 266 1472
+3  1228 801 1472
+3  1828 30 1401
+3  1884 802 1401
+3  1078 267 1400
+3  1051 802 1400
+3  2139 198 1208
+3  2137 668 1208
+3  2249 226 1209
+3  836 1209 2275
+3  1863 129 1210
+3  1861 670 1210
+3  499 1717 2340
+3  1438 89 1399
+3  2243 224 1212
+3  2241 672 1212
+3  2161 204 1213
+3  1577 673 1213
+3  1819 118 1214
+3  1817 674 1214
+3  1861 129 1215
+3  1427 675 1215
+3  2155 202 1216
+3  2153 676 1216
+3  2105 190 1217
+3  1549 677 1217
+3  1791 111 1218
+3  1789 678 1218
+3  1721 94 1219
+3  1357 679 1219
+3  1206 270 1220
+3  1260 680 1220
+3  2177 208 1221
+3  1585 681 1221
+3  1827 120 1222
+3  1825 682 1222
+3  1789 111 1223
+3  1391 683 1223
+3  2171 206 1224
+3  2169 684 1224
+3  2097 188 1225
+3  1545 685 1225
+3  1787 110 1226
+3  1785 686 1226
+3  1725 95 1227
+3  1359 687 1227
+3  1472 266 1228
+3  1478 688 1228
+3  2113 192 1229
+3  1553 689 1229
+3  1795 112 1230
+3  1793 690 1230
+3  1785 110 1231
+3  1389 691 1231
+3  1448 2267 1093
+3  1513 1232 1154
+3  2329 246 1233
+3  1661 693 1233
+3  1903 139 1234
+3  1901 694 1234
+3  1749 101 1235
+3  1371 695 1235
+3  2323 244 1236
+3  2321 696 1236
+3  2209 216 1237
+3  1601 697 1237
+3  1843 124 1238
+3  1841 698 1238
+3  1901 139 1239
+3  1447 699 1239
+3  2203 214 1240
+3  2201 700 1240
+3  2081 184 1241
+3  1537 701 1241
+3  1779 108 1242
+3  1777 702 1242
+3  1733 97 1243
+3  1363 703 1243
+3  1808 258 1244
+3  1810 704 1244
+3  2225 220 1245
+3  1609 705 1245
+3  1851 126 1246
+3  1849 706 1246
+3  1777 108 1247
+3  1385 707 1247
+3  2219 218 1248
+3  2217 708 1248
+3  1396 268 1249
+3  1705 709 1249
+3  1947 150 1250
+3  1945 710 1250
+3  1737 98 1251
+3  1365 711 1251
+3  2107 190 1252
+3  2105 712 1252
+3  2241 224 1253
+3  1617 713 1253
+3  1859 128 1254
+3  1857 714 1254
+3  1945 150 1255
+3  1469 715 1255
+3  2235 222 1256
+3  2233 716 1256
+3  2153 202 1257
+3  1573 717 1257
+3  1815 117 1258
+3  1813 718 1258
+3  1741 99 1259
+3  1367 719 1259
+3  1588 803 1399
+3  930 267 1398
+3  2257 228 1261
+3  1625 721 1261
+3  1867 130 1262
+3  1865 722 1262
+3  1813 117 1263
+3  1403 723 1263
+3  2251 226 1264
+3  2249 724 1264
+3  2134 254 1265
+3  1677 725 1265
+3  1919 143 1266
+3  1917 726 1266
+3  1745 100 1267
+3  1369 727 1267
+3  1078 803 1398
+3  1037 1836 1198
+3  2193 212 1269
+3  1593 729 1269
+3  1835 122 1270
+3  1833 730 1270
+3  1917 143 1271
+3  1455 731 1271
+3  2224 11 1397
+3  1872 588 1113
+3  1094 731 2271
+3  1873 588 1872
+3  896 895 113
+3  152 588 1873
+3  932 231 2271
+3  337 1874 33
+3  2115 192 1276
+3  2113 736 1276
+3  2289 236 1277
+3  1641 737 1277
+3  1592 731 2270
+3  337 661 1874
+3  901 900 1279
+3  1395 739 1279
+3  2283 234 1280
+3  2281 740 1280
+3  1478 266 1281
+3  1701 741 1281
+3  1943 149 1282
+3  1941 742 1282
+3  1753 102 1283
+3  1373 743 1283
+3  1558 264 1284
+3  1563 744 1284
+3  2305 240 1285
+3  1649 745 1285
+3  1891 136 1286
+3  1889 746 1286
+3  1941 149 1287
+3  1467 747 1287
+3  2299 238 1288
+3  2297 748 1288
+3  1966 256 1289
+3  1681 749 1289
+3  1923 144 1290
+3  1921 750 1290
+3  1757 103 1291
+3  1375 751 1291
+3  2083 184 1292
+3  2081 752 1292
+3  2321 244 1293
+3  1657 753 1293
+3  1899 138 1294
+3  1897 754 1294
+3  1921 144 1295
+3  1457 755 1295
+3  2315 242 1296
+3  2313 756 1296
+3  2201 214 1297
+3  1597 757 1297
+3  1839 123 1298
+3  1666 1298 860
+3  1454 71 2270
+3  1526 1525 759
+3  2195 212 1300
+3  2193 760 1300
+3  92 1875 1122
+3  1875 1119 1122
+3  1053 730 2269
+3  1094 231 2269
+3  2131 1880 375
+3  1880 200 375
+3  2331 246 1304
+3  273 1881 2131
+3  1916 730 2268
+3  1881 1880 2131
+3  1832 21 2268
+3  1232 729 2267
+3  1904 1173 1669
+3  2088 804 1397
+3  1674 729 2266
+3  671 768 2062
+3  1905 1173 1904
+3  107 1173 1905
+3  1592 71 2266
+3  917 1906 430
+3  1906 1907 1669
+3  1180 268 1396
+3  1906 1669 430
+3  875 1669 1907
+3  1249 804 1396
+3  1540 90 1383
+3  1871 131 1314
+3  1869 774 1314
+3  1909 1036 1910
+3  1610 805 1383
+3  2259 228 1316
+3  2257 776 1316
+3  2137 198 1317
+3  1565 777 1317
+3  1008 727 2263
+3  1805 778 1318
+3  1869 131 1319
+3  1431 779 1319
+3  2307 240 1320
+3  2305 780 1320
+3  1774 260 1321
+3  1689 781 1321
+3  1931 146 1322
+3  1929 782 1322
+3  1893 137 1323
+3  1443 783 1323
+3  2091 186 1324
+3  2089 784 1324
+3  2217 218 1325
+3  1605 785 1325
+3  1847 125 1326
+3  1845 786 1326
+3  1929 146 1327
+3  1461 787 1327
+3  1964 256 1328
+3  1966 788 1328
+3  1563 264 1329
+3  1697 789 1329
+3  1939 148 1330
+3  1937 790 1330
+3  1925 145 1331
+3  1459 791 1331
+3  2099 188 1332
+3  2097 792 1332
+3  1260 270 1333
+3  1709 793 1333
+3  1951 151 1334
+3  1949 794 1334
+3  1937 148 1335
+3  1465 795 1335
+3  1772 260 1336
+3  1774 796 1336
+3  2297 238 1337
+3  1645 797 1337
+3  1887 135 1338
+3  1885 798 1338
+3  1933 147 1339
+3  1463 799 1339
+3  2291 236 1340
+3  2289 800 1340
+3  2185 210 1341
+3  1589 801 1341
+3  1831 121 1342
+3  1829 802 1342
+3  1885 135 1343
+3  1439 803 1343
+3  2227 220 1344
+3  2225 804 1344
+3  2089 186 1345
+3  1541 805 1345
+3  1783 109 1346
+3  1781 806 1346
+3  1853 127 1347
+3  1423 807 1347
+3  1668 262 1348
+3  1712 808 1348
+3  2169 206 1349
+3  1581 809 1349
+3  1823 119 1350
+3  1821 810 1350
+3  1781 109 1351
+3  1387 811 1351
+3  974 229 2263
+3  1676 727 2262
+3  1368 70 2262
+3  1095 726 2261
+3  1008 229 2261
+3  1744 726 2260
+3  1916 21 2260
+3  1316 725 2259
+3  1818 58 1356
+3  2166 274 1356
+3  1219 94 1357
+3  838 274 1357
+3  1826 60 1358
+3  2182 275 1358
+3  1227 95 1359
+3  840 275 1359
+3  1794 52 1360
+3  2118 276 1360
+3  1195 96 1361
+3  832 276 1361
+3  1842 64 1362
+3  2214 277 1362
+3  1243 97 1363
+3  844 277 1363
+3  1850 66 1364
+3  2230 278 1364
+3  1251 98 1365
+3  846 278 1365
+3  1858 68 1366
+3  2246 279 1366
+3  1259 99 1367
+3  848 279 1367
+3  1866 70 1368
+3  2262 280 1368
+3  1267 100 1369
+3  850 280 1369
+3  1834 62 1370
+3  2198 281 1370
+3  1235 101 1371
+3  842 281 1371
+3  1882 74 1372
+3  2294 282 1372
+3  1283 102 1373
+3  854 282 1373
+3  1890 76 1374
+3  2310 283 1374
+3  1291 103 1375
+3  856 283 1375
+3  1898 78 1376
+3  2326 284 1376
+3  1910 1036 1115
+3  858 284 1377
+3  947 228 2259
+3  1115 2345 1910
+3  1175 1911 633
+3  1622 725 2258
+3  1175 835 1911
+3  1676 70 2258
+3  1261 724 2257
+3  199 273 2131
+3  1316 228 2257
+3  2135 724 2256
+3  2248 4 2256
+3  1042 723 2255
+3  1846 65 1384
+3  2222 288 1384
+3  1247 108 1385
+3  845 288 1385
+3  1950 91 1386
+3  1202 289 1386
+3  1351 109 1387
+3  871 289 1387
+3  1830 61 1388
+3  2190 290 1388
+3  1231 110 1389
+3  841 290 1389
+3  1822 59 1390
+3  2174 291 1390
+3  1223 111 1391
+3  839 291 1391
+3  1730 36 1392
+3  1990 292 1392
+3  1131 112 1393
+3  816 292 1393
+3  1878 73 1394
+3  2286 293 1394
+3  1279 113 1395
+3  853 293 1395
+3  948 227 2255
+3  1624 723 2254
+3  1402 69 2254
+3  1069 722 2253
+3  1042 227 2253
+3  1812 722 2252
+3  1864 20 2252
+3  1264 721 2251
+3  921 226 2251
+3  1570 721 2250
+3  1624 69 2250
+3  1209 720 2249
+3  1862 69 1402
+3  2254 297 1402
+3  1263 117 1403
+3  849 297 1403
+3  1722 34 1404
+3  1974 298 1404
+3  1123 118 1405
+3  814 298 1405
+3  1790 51 1406
+3  2110 299 1406
+3  1191 119 1407
+3  831 299 1407
+3  1726 35 1408
+3  1982 300 1408
+3  1127 120 1409
+3  815 300 1409
+3  1786 50 1410
+3  2102 301 1410
+3  1187 121 1411
+3  830 301 1411
+3  1750 41 1412
+3  2030 302 1412
+3  1151 122 1413
+3  821 302 1413
+3  1902 79 1414
+3  2334 303 1414
+3  1664 123 1633
+3  859 303 1415
+3  1734 37 1416
+3  1998 304 1416
+3  1135 124 1417
+3  817 304 1417
+3  1778 48 1418
+3  2086 305 1418
+3  1179 125 1419
+3  828 305 1419
+3  1738 38 1420
+3  2006 306 1420
+3  1139 126 1421
+3  818 306 1421
+3  1946 90 1422
+3  1353 307 1422
+3  1347 127 1423
+3  870 307 1423
+3  1742 39 1424
+3  2014 308 1424
+3  1143 128 1425
+3  819 308 1425
+3  1814 57 1426
+3  2158 309 1426
+3  1215 129 1427
+3  837 309 1427
+3  1746 40 1428
+3  2022 310 1428
+3  1147 130 1429
+3  820 310 1429
+3  1918 83 1430
+3  2075 311 1430
+3  1319 131 1431
+3  863 311 1431
+3  1264 226 2249
+3  1912 1805 666
+3  2256 720 2248
+3  1913 1805 1912
+3  1519 53 898
+3  2126 313 1434
+3  1199 133 1435
+3  833 313 1435
+3  2144 4 2248
+3  1805 835 1175
+3  2151 1914 573
+3  1006 719 2247
+3  1942 89 1438
+3  1399 315 1438
+3  1343 135 1439
+3  869 315 1439
+3  1758 43 1440
+3  2046 316 1440
+3  1159 136 1441
+3  823 316 1441
+3  1922 84 1442
+3  1955 317 1442
+3  1323 137 1443
+3  864 317 1443
+3  2151 1915 1914
+3  922 225 2247
+3  1163 138 1445
+3  1515 1445 356
+3  1838 63 1446
+3  2206 319 1446
+3  1239 139 1447
+3  843 319 1447
+3  2151 575 1915
+3  1572 719 2246
+3  272 2032 1172
+3  2032 2033 1172
+3  1366 68 2246
+3  2033 199 2131
+3  2033 2131 1172
+3  1043 718 2245
+3  1679 2034 919
+3  1006 225 2245
+3  1679 2035 2034
+3  1740 718 2244
+3  1870 71 1454
+3  2270 323 1454
+3  1271 143 1455
+3  851 323 1455
+3  1894 77 1456
+3  2318 324 1456
+3  1295 144 1457
+3  857 324 1457
+3  1930 86 1458
+3  1715 325 1458
+3  1331 145 1459
+3  866 325 1459
+3  1926 85 1460
+3  1803 326 1460
+3  1327 146 1461
+3  865 326 1461
+3  1938 88 1462
+3  1488 327 1462
+3  1339 147 1463
+3  868 327 1463
+3  1934 87 1464
+3  1568 328 1464
+3  1335 148 1465
+3  867 328 1465
+3  1886 75 1466
+3  2302 329 1466
+3  1287 149 1467
+3  855 329 1467
+3  1854 67 1468
+3  2238 330 1468
+3  1255 150 1469
+3  847 330 1469
+3  1782 49 1470
+3  2094 331 1470
+3  1183 151 1471
+3  829 331 1471
+3  1812 20 2244
+3  1212 717 2243
+3  943 224 2243
+3  1614 717 2242
+3  1986 36 1474
+3  1730 333 1474
+3  1001 153 1475
+3  880 333 1475
+3  1974 34 1476
+3  1970 334 1476
+3  1121 154 1477
+3  877 334 1477
+3  1572 68 2242
+3  1253 716 2241
+3  1212 224 2241
+3  2152 716 2240
+3  1982 35 1480
+3  1978 336 1480
+3  1125 156 1481
+3  879 336 1481
+3  2232 6 2240
+3  1108 715 2239
+3  995 157 1483
+3  874 337 1483
+3  1990 36 1484
+3  1986 338 1484
+3  1129 158 1485
+3  881 338 1485
+3  1970 34 1486
+3  1722 339 1486
+3  997 159 1487
+3  876 339 1487
+3  944 223 2239
+3  1616 715 2238
+3  1113 160 1489
+3  873 340 1489
+3  1978 35 1490
+3  1726 341 1490
+3  999 161 1491
+3  878 341 1491
+3  2006 38 1492
+3  2002 342 1492
+3  1137 162 1493
+3  885 342 1493
+3  2026 41 1494
+3  1750 343 1494
+3  1011 163 1495
+3  890 343 1495
+3  2014 39 1496
+3  2010 344 1496
+3  1141 164 1497
+3  887 344 1497
+3  1994 37 1498
+3  1734 345 1498
+3  1003 165 1499
+3  882 345 1499
+3  2022 40 1500
+3  2018 346 1500
+3  1145 166 1501
+3  889 346 1501
+3  2002 38 1502
+3  1738 347 1502
+3  1005 167 1503
+3  884 347 1503
+3  2030 41 1504
+3  2026 348 1504
+3  1149 168 1505
+3  891 348 1505
+3  2010 39 1506
+3  1742 349 1506
+3  1007 169 1507
+3  886 349 1507
+3  1998 37 1508
+3  1994 350 1508
+3  1133 170 1509
+3  883 350 1509
+3  2018 40 1510
+3  1746 351 1510
+3  1009 171 1511
+3  888 351 1511
+3  2046 43 1512
+3  1679 920 2035
+3  1468 67 2238
+3  1065 714 2237
+3  2036 1801 2147
+3  1108 223 2237
+3  1198 2147 1801
+3  406 2037 667
+3  1944 714 2236
+3  406 1041 2037
+3  1856 19 2236
+3  1256 713 2235
+3  2350 2351 1489
+3  872 2038 1039
+3  1453 1013 80
+3  2038 2039 1039
+3  911 222 2235
+3  2039 116 1318
+3  2039 1318 1039
+3  1550 713 2234
+3  1483 2040 2041
+3  1616 67 2234
+3  1015 177 1523
+3  1483 2041 56
+3  1189 712 2233
+3  1483 482 2040
+3  1256 222 2233
+3  500 2042 1318
+3  2042 669 1318
+3  2240 712 2232
+3  2104 6 2232
+3  1004 711 2231
+3  2043 1489 2048
+3  988 221 2231
+3  2048 1489 340
+3  1704 711 2230
+3  340 2349 2048
+3  296 2049 995
+3  2049 2050 995
+3  1364 66 2230
+3  1109 710 2229
+3  1004 221 2229
+3  1736 710 2228
+3  1944 19 2228
+3  2050 93 1122
+3  2050 1122 995
+3  1344 709 2227
+3  667 2051 406
+3  2214 64 1536
+3  2210 364 1536
+3  1241 184 1537
+3  937 364 1537
+3  2314 77 1538
+3  1894 365 1538
+3  1083 185 1539
+3  962 365 1539
+3  1353 90 1540
+3  1383 366 1540
+3  1345 186 1541
+3  989 366 1541
+3  1809 85 1542
+3  1926 367 1542
+3  1099 187 1543
+3  978 367 1543
+3  2182 60 1544
+3  2178 368 1544
+3  1225 188 1545
+3  929 368 1545
+3  1678 87 1546
+3  1934 369 1546
+3  1103 189 1547
+3  982 369 1547
+3  2166 58 1548
+3  2162 370 1548
+3  1217 190 1549
+3  925 370 1549
+3  2234 67 1550
+3  1854 371 1550
+3  1063 191 1551
+3  942 371 1551
+3  2190 61 1552
+3  2186 372 1552
+3  1229 192 1553
+3  931 372 1553
+3  2282 73 1554
+3  1878 373 1554
+3  1075 193 1555
+3  954 373 1555
+3  2051 2054 1621
+3  939 220 2227
+3  2051 1621 406
+3  662 1621 2054
+3  1606 709 2226
+3  1704 66 2226
+3  1037 195 1559
+3  916 375 1559
+3  2126 53 1560
+3  2122 376 1560
+3  1197 196 1561
+3  915 376 1561
+3  1245 708 2225
+3  1344 220 2225
+3  1397 708 2224
+3  2216 11 2224
+3  2075 83 1564
+3  2133 378 1564
+3  1317 198 1565
+3  975 378 1565
+3  1024 707 2223
+3  940 219 2223
+3  1608 707 2222
+3  1384 65 2222
+3  1061 706 2221
+3  1024 219 2221
+3  1776 706 2220
+3  1848 18 2220
+3  2250 69 1570
+3  1862 381 1570
+3  1067 201 1571
+3  946 381 1571
+3  2246 68 1572
+3  2242 382 1572
+3  1257 202 1573
+3  945 382 1573
+3  2162 58 1574
+3  1818 383 1574
+3  1045 203 1575
+3  924 383 1575
+3  2158 57 1576
+3  2154 384 1576
+3  1213 204 1577
+3  923 384 1577
+3  2106 51 1578
+3  1790 385 1578
+3  1031 205 1579
+3  910 385 1579
+3  1202 91 1580
+3  1207 386 1580
+3  1349 206 1581
+3  991 386 1581
+3  2178 60 1582
+3  1826 387 1582
+3  1049 207 1583
+3  928 387 1583
+3  2174 59 1584
+3  2170 388 1584
+3  1221 208 1585
+3  927 388 1585
+3  2098 50 1586
+3  1786 389 1586
+3  1029 209 1587
+3  908 389 1587
+3  1399 89 1588
+3  1473 390 1588
+3  1341 210 1589
+3  987 390 1589
+3  2114 52 1590
+3  1794 391 1590
+3  1033 211 1591
+3  912 391 1591
+3  2270 71 1592
+3  2266 392 1592
+3  1269 212 1593
+3  951 392 1593
+3  2330 79 1594
+3  1902 393 1594
+3  1087 213 1595
+3  966 393 1595
+3  2326 78 1596
+3  2322 394 1596
+3  1297 214 1597
+3  965 394 1597
+3  2210 64 1598
+3  1842 395 1598
+3  1057 215 1599
+3  936 395 1599
+3  2206 63 1600
+3  2202 396 1600
+3  1237 216 1601
+3  935 396 1601
+3  2082 48 1602
+3  1778 397 1602
+3  1025 217 1603
+3  904 397 1603
+3  1803 85 1604
+3  1809 398 1604
+3  1325 218 1605
+3  979 398 1605
+3  2226 66 1606
+3  1850 399 1606
+3  1061 219 1607
+3  940 399 1607
+3  2222 65 1608
+3  2218 400 1608
+3  1245 220 1609
+3  939 400 1609
+3  1383 90 1610
+3  1946 401 1610
+3  1109 221 1611
+3  988 401 1611
+3  2110 51 1612
+3  2106 402 1612
+3  1189 222 1613
+3  911 402 1613
+3  2242 68 1614
+3  1858 403 1614
+3  1065 223 1615
+3  944 403 1615
+3  2238 67 1616
+3  2234 404 1616
+3  1253 224 1617
+3  943 404 1617
+3  2154 57 1618
+3  1814 405 1618
+3  1043 225 1619
+3  922 405 1619
+3  1248 705 2219
+3  979 218 2219
+3  1209 226 1621
+3  921 406 1621
+3  2258 70 1622
+3  1866 407 1622
+3  1069 227 1623
+3  948 407 1623
+3  2254 69 1624
+3  2250 408 1624
+3  1261 228 1625
+3  947 408 1625
+3  2133 83 1626
+3  1918 409 1626
+3  1095 229 1627
+3  974 409 1627
+3  1686 705 2218
+3  2143 2055 1953
+3  2055 992 1953
+3  1608 65 2218
+3  2194 62 1630
+3  1834 411 1630
+3  1053 231 1631
+3  932 411 1631
+3  1325 704 2217
+3  1248 218 2217
+3  2056 994 1211
+3  2224 704 2216
+3  2122 53 1634
+3  2057 994 2056
+3  1811 11 2216
+3  1211 453 2056
+3  2118 52 1636
+3  2114 414 1636
+3  1193 234 1637
+3  913 414 1637
+3  2290 74 1638
+3  1882 415 1638
+3  1077 235 1639
+3  956 415 1639
+3  2286 73 1640
+3  2282 416 1640
+3  1277 236 1641
+3  955 416 1641
+3  1473 89 1642
+3  1942 417 1642
+3  1107 237 1643
+3  986 417 1643
+3  1488 88 1644
+3  1562 418 1644
+3  1337 238 1645
+3  985 418 1645
+3  2306 76 1646
+3  1890 419 1646
+3  1081 239 1647
+3  960 419 1647
+3  2302 75 1648
+3  2298 420 1648
+3  1285 240 1649
+3  959 420 1649
+3  1965 84 1650
+3  1922 421 1650
+3  1097 241 1651
+3  976 421 1651
+3  2086 48 1652
+3  2082 422 1652
+3  1177 242 1653
+3  905 422 1653
+3  2322 78 1654
+3  1898 423 1654
+3  1085 243 1655
+3  964 423 1655
+3  2318 77 1656
+3  2314 424 1656
+3  1293 244 1657
+3  963 424 1657
+3  2202 63 1658
+3  1838 425 1658
+3  1055 245 1659
+3  934 425 1659
+3  2198 62 1660
+3  2194 426 1660
+3  1233 246 1661
+3  933 426 1661
+3  1002 703 2215
+3  2058 768 1173
+3  904 217 2215
+3  2059 768 2058
+3  1761 79 1629
+3  362 768 2059
+3  1536 703 2214
+3  375 2060 2140
+3  1362 64 2214
+3  375 200 2060
+3  1025 702 2213
+3  813 2061 720
+3  1002 217 2213
+3  1732 702 2212
+3  1306 1669 1173
+3  1017 430 1669
+3  2061 812 720
+3  812 2145 720
+3  1776 18 2212
+3  1176 701 2211
+3  2062 768 362
+3  935 216 2211
+3  768 671 2073
+3  1598 701 2210
+3  2266 71 1674
+3  1870 433 1674
+3  1071 253 1675
+3  950 433 1675
+3  2262 70 1676
+3  2258 434 1676
+3  1265 254 1677
+3  949 434 1677
+3  1536 64 2210
+3  1237 700 2209
+3  1039 255 1679
+3  918 435 1679
+3  2310 76 1680
+3  2306 436 1680
+3  1289 256 1681
+3  961 436 1681
+3  1773 86 1682
+3  1930 437 1682
+3  1101 257 1683
+3  980 437 1683
+3  2094 49 1684
+3  2090 438 1684
+3  1181 258 1685
+3  907 438 1685
+3  2218 65 1686
+3  1846 439 1686
+3  1059 259 1687
+3  938 439 1687
+3  1955 84 1688
+3  1965 440 1688
+3  1321 260 1689
+3  977 440 1689
+3  1562 88 1690
+3  1938 441 1690
+3  1105 261 1691
+3  984 441 1691
+3  2102 50 1692
+3  2098 442 1692
+3  1185 262 1693
+3  909 442 1693
+3  1207 91 1694
+3  1950 443 1694
+3  1111 263 1695
+3  990 443 1695
+3  1715 86 1696
+3  1773 444 1696
+3  1329 264 1697
+3  981 444 1697
+3  2298 75 1698
+3  1886 445 1698
+3  1079 265 1699
+3  958 445 1699
+3  2294 74 1700
+3  2290 446 1700
+3  1281 266 1701
+3  957 446 1701
+3  2186 61 1702
+3  1830 447 1702
+3  1051 267 1703
+3  930 447 1703
+3  2230 66 1704
+3  2226 448 1704
+3  1249 268 1705
+3  941 448 1705
+3  2090 49 1706
+3  1782 449 1706
+3  1027 269 1707
+3  906 449 1707
+3  1568 87 1708
+3  1678 450 1708
+3  1333 270 1709
+3  983 450 1709
+3  2170 59 1710
+3  1822 451 1710
+3  1047 271 1711
+3  926 451 1711
+3  1176 216 2209
+3  2080 700 2208
+3  2200 3 2208
+3  1086 699 2207
+3  936 215 2207
+3  1600 699 2206
+3  1446 63 2206
+3  1057 698 2205
+3  2148 14 1716
+3  1972 454 1716
+3  1119 1717 1122
+3  1211 454 1717
+3  1086 215 2205
+3  1900 698 2204
+3  1840 17 2204
+3  1240 697 2203
+3  2164 15 1720
+3  1980 456 1720
+3  1126 94 1721
+3  1219 456 1721
+3  1486 34 1722
+3  1404 457 1722
+3  838 94 1723
+3  1126 457 1723
+3  2180 16 1724
+3  1988 458 1724
+3  1130 95 1725
+3  1227 458 1725
+3  1490 35 1726
+3  1408 459 1726
+3  840 95 1727
+3  1130 459 1727
+3  2116 12 1728
+3  1956 460 1728
+3  1114 96 1729
+3  1195 460 1729
+3  1474 36 1730
+3  1392 461 1730
+3  832 96 1731
+3  1114 461 1731
+3  2212 18 1732
+3  2004 462 1732
+3  1138 97 1733
+3  1243 462 1733
+3  1498 37 1734
+3  1416 463 1734
+3  844 97 1735
+3  1138 463 1735
+3  2228 19 1736
+3  2012 464 1736
+3  1142 98 1737
+3  1251 464 1737
+3  1502 38 1738
+3  1420 465 1738
+3  846 98 1739
+3  1142 465 1739
+3  2244 20 1740
+3  2020 466 1740
+3  1146 99 1741
+3  1259 466 1741
+3  1506 39 1742
+3  1424 467 1742
+3  848 99 1743
+3  1146 467 1743
+3  2260 21 1744
+3  2028 468 1744
+3  1150 100 1745
+3  1267 468 1745
+3  1510 40 1746
+3  1428 469 1746
+3  850 100 1747
+3  1150 469 1747
+3  2196 17 1748
+3  1996 470 1748
+3  1134 101 1749
+3  1235 470 1749
+3  1494 41 1750
+3  1412 471 1750
+3  842 101 1751
+3  1134 471 1751
+3  2292 23 1752
+3  2044 472 1752
+3  1158 102 1753
+3  1283 472 1753
+3  2063 720 2064
+3  965 214 2203
+3  854 102 1755
+3  1158 473 1755
+3  2308 24 1756
+3  2052 474 1756
+3  1162 103 1757
+3  1291 474 1757
+3  1673 43 285
+3  1440 475 1758
+3  856 103 1759
+3  1162 475 1759
+3  2064 720 1209
+3  813 720 2063
+3  1658 697 2202
+3  152 2065 588
+3  2065 2146 588
+3  2146 1953 588
+3  1600 63 2202
+3  2067 2066 668
+3  2066 1040 1208
+3  1128 2067 668
+3  1297 696 2201
+3  2066 1208 668
+3  1240 214 2201
+3  2208 696 2200
+3  2068 632 2069
+3  2320 3 2200
+3  2069 632 47
+3  1010 695 2199
+3  632 2068 1172
+3  114 2070 430
+3  2070 917 430
+3  966 213 2199
+3  1660 695 2198
+3  197 2071 572
+3  1370 62 2198
+3  1087 694 2197
+3  1010 213 2197
+3  1748 694 2196
+3  1900 17 2196
+3  1300 693 2195
+3  951 212 2195
+3  1630 693 2194
+3  2220 18 1776
+3  2212 484 1776
+3  1242 108 1777
+3  1247 484 1777
+3  1602 48 1778
+3  1418 485 1778
+3  845 108 1779
+3  1242 485 1779
+3  1205 31 1780
+3  1355 486 1780
+3  1346 109 1781
+3  1351 486 1781
+3  1706 49 1782
+3  1470 487 1782
+3  871 109 1783
+3  1346 487 1783
+3  2188 16 1784
+3  2180 488 1784
+3  1226 110 1785
+3  1231 488 1785
+3  1586 50 1786
+3  1410 489 1786
+3  841 110 1787
+3  1226 489 1787
+3  2172 15 1788
+3  2164 490 1788
+3  1218 111 1789
+3  1223 490 1789
+3  1578 51 1790
+3  1406 491 1790
+3  839 111 1791
+3  1218 491 1791
+3  1988 16 1792
+3  2188 492 1792
+3  1230 112 1793
+3  1131 492 1793
+3  1590 52 1794
+3  1360 493 1794
+3  816 112 1795
+3  1230 493 1795
+3  2071 2120 572
+3  1660 62 2194
+3  2120 2138 1112
+3  903 1279 494
+3  2120 1112 572
+3  1269 692 2193
+3  853 113 1799
+3  1300 212 2193
+3  1956 12 1800
+3  2124 496 1800
+3  380 1801 2036
+3  1115 496 1801
+3  1665 1517 692
+3  941 268 1382
+3  1028 691 2191
+3  912 211 2191
+3  2076 27 1804
+3  2130 498 1804
+3  669 1805 1318
+3  1175 498 1805
+3  1552 691 2190
+3  1388 61 2190
+3  1033 690 2189
+3  1028 211 2189
+3  1784 690 2188
+3  1792 16 2188
+3  1192 689 2187
+3  987 210 2187
+3  1702 689 2186
+3  1552 61 2186
+3  1341 688 2185
+3  1192 210 2185
+3  2252 20 1812
+3  2244 502 1812
+3  1258 117 1813
+3  1263 502 1813
+3  1618 57 1814
+3  1426 503 1814
+3  849 117 1815
+3  1258 503 1815
+3  1972 14 1816
+3  2156 504 1816
+3  1214 118 1817
+3  1123 504 1817
+3  1574 58 1818
+3  1356 505 1818
+3  814 118 1819
+3  1214 505 1819
+3  2108 31 1820
+3  1205 506 1820
+3  1350 119 1821
+3  1191 506 1821
+3  1710 59 1822
+3  1390 507 1822
+3  831 119 1823
+3  1350 507 1823
+3  1980 15 1824
+3  2172 508 1824
+3  1222 120 1825
+3  1127 508 1825
+3  1582 60 1826
+3  1358 509 1826
+3  815 120 1827
+3  1222 509 1827
+3  2100 30 1828
+3  1401 510 1828
+3  1342 121 1829
+3  1187 510 1829
+3  1702 61 1830
+3  1388 511 1830
+3  830 121 1831
+3  1342 511 1831
+3  2028 21 1832
+3  2268 512 1832
+3  1270 122 1833
+3  1151 512 1833
+3  1630 62 1834
+3  1370 513 1834
+3  821 122 1835
+3  1270 513 1835
+3  2121 668 182
+3  2112 688 2184
+3  1764 1298 123
+3  2145 182 668
+3  1658 63 1838
+3  1446 515 1838
+3  859 123 1839
+3  1298 515 1839
+3  1996 17 1840
+3  2204 516 1840
+3  1238 124 1841
+3  1135 516 1841
+3  1598 64 1842
+3  1362 517 1842
+3  817 124 1843
+3  1238 517 1843
+3  2084 28 1844
+3  1807 518 1844
+3  1326 125 1845
+3  1179 518 1845
+3  1686 65 1846
+3  1384 519 1846
+3  828 125 1847
+3  1326 519 1847
+3  2004 18 1848
+3  2220 520 1848
+3  1246 126 1849
+3  1139 520 1849
+3  1606 66 1850
+3  1364 521 1850
+3  818 126 1851
+3  1246 521 1851
+3  1355 31 1852
+3  2108 522 1852
+3  1190 127 1853
+3  1347 522 1853
+3  1550 67 1854
+3  1468 523 1854
+3  870 127 1855
+3  1190 523 1855
+3  2012 19 1856
+3  2236 524 1856
+3  1254 128 1857
+3  1143 524 1857
+3  1614 68 1858
+3  1366 525 1858
+3  819 128 1859
+3  1254 525 1859
+3  2156 14 1860
+3  2148 526 1860
+3  1210 129 1861
+3  1215 526 1861
+3  1570 69 1862
+3  1402 527 1862
+3  837 129 1863
+3  1210 527 1863
+3  2020 20 1864
+3  2252 528 1864
+3  1262 130 1865
+3  1147 528 1865
+3  1622 70 1866
+3  1368 529 1866
+3  820 130 1867
+3  1262 529 1867
+3  2130 27 1868
+3  2142 530 1868
+3  1314 131 1869
+3  1319 530 1869
+3  1674 71 1870
+3  1454 531 1870
+3  863 131 1871
+3  1314 531 1871
+3  1479 2 2184
+3  2123 337 1963
+3  998 687 2183
+3  2128 1963 32
+3  908 209 2183
+3  1963 2128 2123
+3  1544 687 2182
+3  2192 572 992
+3  2124 12 1876
+3  2116 534 1876
+3  1194 133 1877
+3  1199 534 1877
+3  1554 73 1878
+3  1394 535 1878
+3  833 133 1879
+3  1194 535 1879
+3  197 572 2192
+3  1358 60 2182
+3  55 2264 2073
+3  2264 295 2073
+3  1638 74 1882
+3  1372 537 1882
+3  1278 1883 45
+3  1274 537 1883
+3  1401 30 1884
+3  1533 538 1884
+3  1338 135 1885
+3  1343 538 1885
+3  1698 75 1886
+3  1466 539 1886
+3  869 135 1887
+3  1338 539 1887
+3  2044 23 1888
+3  2300 540 1888
+3  1286 136 1889
+3  1159 540 1889
+3  1646 76 1890
+3  1374 541 1890
+3  823 136 1891
+3  1286 541 1891
+3  1962 28 1892
+3  2084 542 1892
+3  1178 137 1893
+3  1323 542 1893
+3  1538 77 1894
+3  1456 543 1894
+3  864 137 1895
+3  1178 543 1895
+3  2052 24 1896
+3  2316 544 1896
+3  1294 138 1897
+3  1163 544 1897
+3  1654 78 1898
+3  1376 545 1898
+3  824 138 1899
+3  1294 545 1899
+3  2204 17 1900
+3  2196 546 1900
+3  1234 139 1901
+3  1239 546 1901
+3  1594 79 1902
+3  1414 547 1902
+3  843 139 1903
+3  1234 547 1903
+3  1029 686 2181
+3  998 209 2181
+3  1115 2265 455
+3  1724 686 2180
+3  1115 497 2265
+3  1784 16 2180
+3  1184 685 2179
+3  2272 1717 1119
+3  2142 27 1908
+3  2076 550 1908
+3  452 1717 2272
+3  927 208 2179
+3  2145 2273 182
+3  1582 685 2178
+3  2145 377 2273
+3  1544 60 2178
+3  1221 684 2177
+3  2274 632 295
+3  47 632 2274
+3  1184 208 2177
+3  2096 684 2176
+3  2275 1209 2276
+3  2168 10 2176
+3  2276 1209 1621
+3  2268 21 1916
+3  2260 554 1916
+3  1266 143 1917
+3  1271 554 1917
+3  1626 83 1918
+3  1430 555 1918
+3  851 143 1919
+3  1266 555 1919
+3  2316 24 1920
+3  2308 556 1920
+3  1290 144 1921
+3  1295 556 1921
+3  1650 84 1922
+3  1442 557 1922
+3  857 144 1923
+3  1290 557 1923
+3  1719 29 1924
+3  2092 558 1924
+3  1182 145 1925
+3  1331 558 1925
+3  1542 85 1926
+3  1460 559 1926
+3  866 145 1927
+3  1182 559 1927
+3  1807 28 1928
+3  1962 560 1928
+3  1322 146 1929
+3  1327 560 1929
+3  1682 86 1930
+3  1458 561 1930
+3  865 146 1931
+3  1322 561 1931
+3  1533 30 1932
+3  2100 562 1932
+3  1186 147 1933
+3  1339 562 1933
+3  1546 87 1934
+3  1464 563 1934
+3  868 147 1935
+3  1186 563 1935
+3  1620 29 1936
+3  1719 564 1936
+3  1330 148 1937
+3  1335 564 1937
+3  1690 88 1938
+3  1462 565 1938
+3  867 148 1939
+3  1330 565 1939
+3  2300 23 1940
+3  2292 566 1940
+3  1282 149 1941
+3  1287 566 1941
+3  1642 89 1942
+3  1438 567 1942
+3  855 149 1943
+3  1282 567 1943
+3  2236 19 1944
+3  2228 568 1944
+3  1250 150 1945
+3  1255 568 1945
+3  1610 90 1946
+3  1422 569 1946
+3  847 150 1947
+3  1250 569 1947
+3  2092 29 1948
+3  1620 570 1948
+3  1334 151 1949
+3  1183 570 1949
+3  1694 91 1950
+3  1386 571 1950
+3  829 151 1951
+3  1334 571 1951
+3  1960 0 1952
+3  1984 572 1952
+3  1030 683 2175
+3  992 572 1953
+3  928 207 2175
+3  1584 683 2174
+3  1390 59 2174
+3  1049 682 2173
+3  1728 12 1956
+3  1800 574 1956
+3  1036 153 1957
+3  1001 574 1957
+3  1030 207 2173
+3  1788 682 2172
+3  880 153 1959
+3  2347 1036 2346
+3  1968 0 1960
+3  1952 576 1960
+3  1112 154 1961
+3  1121 576 1961
+3  1824 15 2172
+3  1224 681 2171
+3  877 154 1963
+3  578 1963 2333
+3  991 206 2171
+3  1710 681 2170
+3  1584 59 2170
+3  1349 680 2169
+3  1224 206 2169
+3  2176 680 2168
+3  1308 10 2168
+3  996 679 2167
+3  1976 0 1968
+3  1960 580 1968
+3  1116 156 1969
+3  1125 580 1969
+3  1476 34 1970
+3  1486 581 1970
+3  879 156 1971
+3  1116 581 1971
+3  1716 14 1972
+3  1816 582 1972
+3  1044 157 1973
+3  995 582 1973
+3  1404 34 1974
+3  1476 583 1974
+3  874 157 1975
+3  1044 583 1975
+3  1984 0 1976
+3  1968 584 1976
+3  1120 158 1977
+3  1129 584 1977
+3  1480 35 1978
+3  1490 585 1978
+3  881 158 1979
+3  1120 585 1979
+3  1720 15 1980
+3  1824 586 1980
+3  1048 159 1981
+3  997 586 1981
+3  1408 35 1982
+3  1480 587 1982
+3  876 159 1983
+3  1048 587 1983
+3  1952 0 1984
+3  1976 588 1984
+3  1124 160 1985
+3  1113 588 1985
+3  1484 36 1986
+3  1474 589 1986
+3  873 160 1987
+3  1124 589 1987
+3  1724 16 1988
+3  1792 590 1988
+3  1032 161 1989
+3  999 590 1989
+3  1392 36 1990
+3  1484 591 1990
+3  878 161 1991
+3  1032 591 1991
+3  2000 1 1992
+3  2024 592 1992
+3  1148 162 1993
+3  1137 592 1993
+3  1508 37 1994
+3  1498 593 1994
+3  885 162 1995
+3  1148 593 1995
+3  1748 17 1996
+3  1840 594 1996
+3  1056 163 1997
+3  1011 594 1997
+3  1416 37 1998
+3  1508 595 1998
+3  890 163 1999
+3  1056 595 1999
+3  2008 1 2000
+3  1992 596 2000
+3  1132 164 2001
+3  1141 596 2001
+3  1492 38 2002
+3  1502 597 2002
+3  887 164 2003
+3  1132 597 2003
+3  1732 18 2004
+3  1848 598 2004
+3  1060 165 2005
+3  1003 598 2005
+3  1420 38 2006
+3  1492 599 2006
+3  882 165 2007
+3  1060 599 2007
+3  2016 1 2008
+3  2000 600 2008
+3  1136 166 2009
+3  1145 600 2009
+3  1496 39 2010
+3  1506 601 2010
+3  889 166 2011
+3  1136 601 2011
+3  1736 19 2012
+3  1856 602 2012
+3  1064 167 2013
+3  1005 602 2013
+3  1424 39 2014
+3  1496 603 2014
+3  884 167 2015
+3  1064 603 2015
+3  2024 1 2016
+3  2008 604 2016
+3  1140 168 2017
+3  1149 604 2017
+3  1500 40 2018
+3  1510 605 2018
+3  891 168 2019
+3  1140 605 2019
+3  1740 20 2020
+3  1864 606 2020
+3  1068 169 2021
+3  1007 606 2021
+3  1428 40 2022
+3  1500 607 2022
+3  886 169 2023
+3  1068 607 2023
+3  1992 1 2024
+3  2016 608 2024
+3  1144 170 2025
+3  1133 608 2025
+3  1504 41 2026
+3  1494 609 2026
+3  883 170 2027
+3  1144 609 2027
+3  1744 21 2028
+3  1832 610 2028
+3  1052 171 2029
+3  1009 610 2029
+3  1412 41 2030
+3  1504 611 2030
+3  888 171 2031
+3  1052 611 2031
+3  910 205 2167
+3  1621 663 2276
+3  1548 679 2166
+3  2277 1113 1489
+3  1356 58 2166
+3  2278 1113 2277
+3  1031 678 2165
+3  1489 2351 2277
+3  996 205 2165
+3  2279 435 2139
+3  1720 678 2164
+3  2284 2139 1022
+3  1788 15 2164
+3  2139 2284 2279
+3  2332 2324 1559
+3  2324 335 1559
+3  155 2332 1559
+3  1188 677 2163
+3  923 204 2163
+3  1574 677 2162
+3  1315 1512 614
+3  1548 58 2162
+3  2333 1112 2335
+3  1213 676 2161
+3  1752 23 2044
+3  1888 618 2044
+3  1080 175 2045
+3  1013 618 2045
+3  1440 43 2046
+3  1512 619 2046
+3  1311 175 431
+3  1080 619 2047
+3  2335 1112 13
+3  1188 204 2161
+3  1112 2333 1963
+3  2104 676 2160
+3  332 902 1198
+3  2152 6 2160
+3  2337 1801 2338
+3  1066 675 2159
+3  1756 24 2052
+3  1896 622 2052
+3  1084 177 2053
+3  1015 622 2053
+3  2338 1801 380
+3  924 203 2159
+3  1801 497 1115
+3  1530 322 623
+3  1576 675 2158
+3  2339 1717 452
+3  1426 57 2158
+3  2340 1717 2339
+3  1045 674 2157
+3  1717 499 1211
+3  2342 2341 2079
+3  2341 501 2079
+3  115 2342 2079
+3  1066 203 2157
+3  1860 674 2156
+3  1816 14 2156
+3  1198 2343 2147
+3  1216 673 2155
+3  1198 902 2343
+3  945 202 2155
+3  1026 811 1201
+3  926 271 1201
+3  1580 811 1202
+3  1386 91 1202
+3  1047 810 1203
+3  1026 271 1203
+3  1780 810 1205
+3  1820 31 1205
+3  1220 809 1206
+3  983 270 1206
+3  1694 809 1207
+3  1580 91 1207
+3  1333 808 1260
+3  1220 270 1260
+3  2168 808 1308
+3  1713 10 1308
+3  1062 807 1352
+3  2344 632 2072
+3  1618 673 2154
+3  295 632 2073
+3  1576 57 2154
+3  1257 672 2153
+3  1216 202 2153
+3  2160 672 2152
+3  1908 27 2076
+3  1804 634 2076
+3  1038 183 2077
+3  1312 2077 1021
+3  2240 6 2152
+3  577 575 994
+3  970 183 2079
+3  827 115 1038
+3  2208 3 2080
+3  2312 636 2080
+3  1292 184 2081
+3  1241 636 2081
+3  1652 48 2082
+3  1602 637 2082
+3  937 184 2083
+3  1292 637 2083
+3  1892 28 2084
+3  1844 638 2084
+3  1058 185 2085
+3  1083 638 2085
+3  1418 48 2086
+3  1652 639 2086
+3  962 185 2087
+3  1058 639 2087
+3  1397 11 2088
+3  1811 640 2088
+3  1324 186 2089
+3  1345 640 2089
+3  1684 49 2090
+3  1706 641 2090
+3  989 186 2091
+3  1324 641 2091
+3  1924 29 2092
+3  1948 642 2092
+3  1110 187 2093
+3  1099 642 2093
+3  1470 49 2094
+3  1684 643 2094
+3  978 187 2095
+3  1110 643 2095
+3  2176 10 2096
+3  1713 644 2096
+3  1332 188 2097
+3  1225 644 2097
+3  1692 50 2098
+3  1586 645 2098
+3  929 188 2099
+3  1332 645 2099
+3  1932 30 2100
+3  1828 646 2100
+3  1050 189 2101
+3  1103 646 2101
+3  1410 50 2102
+3  1692 647 2102
+3  982 189 2103
+3  1050 647 2103
+3  2160 6 2104
+3  2232 648 2104
+3  1252 190 2105
+3  1217 648 2105
+3  1612 51 2106
+3  1578 649 2106
+3  925 190 2107
+3  1252 649 2107
+3  1852 31 2108
+3  1820 650 2108
+3  1046 191 2109
+3  1063 650 2109
+3  1406 51 2110
+3  1612 651 2110
+3  942 191 2111
+3  1046 651 2111
+3  2184 2 2112
+3  2280 652 2112
+3  1276 192 2113
+3  1229 652 2113
+3  1636 52 2114
+3  1590 653 2114
+3  931 192 2115
+3  1276 653 2115
+3  1876 12 2116
+3  1728 654 2116
+3  1000 193 2117
+3  1075 654 2117
+3  1360 52 2118
+3  1636 655 2118
+3  954 193 2119
+3  1000 655 2119
+3  906 269 1352
+3  1540 807 1353
+3  1422 90 1353
+3  1027 806 1354
+3  1560 53 2122
+3  1634 657 2122
+3  1062 269 1354
+3  1852 806 1355
+3  1800 12 2124
+3  1876 658 2124
+3  1074 195 2125
+3  1037 658 2125
+3  1434 53 2126
+3  1560 659 2126
+3  916 195 2127
+3  1074 659 2127
+3  1780 31 1355
+3  1180 805 1382
+3  1172 196 2129
+3  1268 2129 1197
+3  946 201 2151
+3  1067 670 2149
+3  915 196 2131
+3  994 201 2149
+3  1716 670 2148
+3  1860 14 2148
+3  1128 668 2121
+3  2248 668 2144
+3  2136 4 2144
+3  975 198 2139
+3  1317 664 2137
+3  1208 198 2137
+3  2135 4 2136
+3  2144 664 2136
+
diff --git a/Data/data/meshes/polyhedral_complex_of_spheres/Sphere2.off b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere2.off
new file mode 100644
index 000000000000..5a937e8fe2c8
--- /dev/null
+++ b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere2.off
@@ -0,0 +1,7185 @@
+NOFF
+2454 4727 0
+
+0.99999999999999989 1.5257311121191339 1.8506508083520397  -6.318411039282109e-16 0.52573111211913615 0.85065080835203821
+1 1.5257311121191335 0.14934919164796001  3.8188198589067693e-17 0.52573111211913426 -0.85065080835203943
+0.99999999999999989 0.47426888788086619 1.8506508083520397  -3.6105205938754909e-16 -0.5257311121191337 0.85065080835203977
+0.99999999999999967 0.4742688878808663 0.14934919164796012  -1.6663941202502267e-16 -0.52573111211913293 -0.85065080835204032
+1.5257311121191339 1.8506508083520397 1  0.52573111211913437 0.85065080835203932 9.0263014846887274e-17
+1.5257311121191337 0.14934919164796012 0.99999999999999967  0.52573111211913315 -0.85065080835204021 -1.9441264736252645e-16
+0.4742688878808663 1.8506508083520399 0.99999999999999989  -0.52573111211913437 0.85065080835203932 -6.1795448625945903e-16
+0.4742688878808663 0.14934919164796012 0.99999999999999967  -0.52573111211913282 -0.85065080835204043 -2.1177091944846629e-16
+1.8506508083520397 0.99999999999999989 1.5257311121191339  0.8506508083520391 -4.75300471383251e-16 0.52573111211913492
+1.8506508083520397 0.99999999999999989 0.47426888788086619  0.85065080835203921 -3.6105205938754909e-16 -0.52573111211913459
+0.14934919164796023 0.99999999999999989 1.5257311121191337  -0.85065080835204032 -2.7773235337503781e-17 0.52573111211913293
+0.1493491916479599 0.99999999999999989 0.47426888788086663  -0.85065080835203943 -5.9712455975633122e-16 -0.52573111211913426
+1.3568220897730903 1.0000000000000002 1.9341723589627156  0.35662245495100681 -0.00037008290847438354 0.9342485149377322
+1.5773502691896257 1.5773502691896257 1.5773502691896257  0.57739733617063194 0.57762605998672589 0.57702725326215698
+1.0000000000000007 1.9341723589627156 1.3568220897730903  -0.00037008290847277551 0.9342485149377322 0.35662245495100664
+0.4226497308103746 1.5773502691896262 1.5773502691896257  -0.57702725326215742 0.57739733617063282 0.57762605998672478
+0.6431779102269104 1.0000000000000002 1.9341723589627158  -0.35662245495100636 -0.00037008290847433145 0.93424851493773231
+1.35682208977309 1.0000000000000002 0.065827641037284335  0.35662245495100692 -0.00037008290847577804 -0.9342485149377322
+0.6431779102269104 1.0000000000000002 0.065827641037284113  -0.35722126167557366 4.5150772736060815e-17 -0.93401979112163969
+0.42264973081037427 1.577350269189626 0.42264973081037438  -0.57702725326215676 0.57739733617063282 -0.57762605998672534
+1.0000000000000007 1.9341723589627158 0.6431779102269104  0.00037008290847432798 0.93424851493773231 -0.35662245495100647
+1.5773502691896257 1.5773502691896262 0.4226497308103746  0.57702725326215665 0.57739733617063282 -0.57762605998672534
+1.577350269189626 0.4226497308103746 1.577350269189626  0.57739733617063282 -0.57762605998672534 0.57702725326215676
+1.0000000000000002 0.065827641037284335 1.35682208977309  0.000370082908475811 -0.93424851493773209 0.35662245495100692
+1.0000000000000002 0.065827641037284113 0.6431779102269104  -0.00037008290847425506 -0.9342485149377322 -0.3566224549510067
+1.5773502691896262 0.42264973081037449 0.42264973081037416  0.57762605998672523 -0.57702725326215698 -0.57739733617063271
+1.9341723589627158 0.6431779102269104 1.0000000000000002  0.93424851493773242 -0.3566224549510062 -0.0003700829084745781
+1.9341723589627156 1.3568220897730903 1.0000000000000002  0.93424851493773209 0.35662245495100681 -0.00037008290847286924
+0.21405999957086966 0.39229183849441451 0.893825128737608  -0.79565076497466791 -0.59478368364252876 -0.11477033531296353
+0.065827641037284113 0.6431779102269104 1.0000000000000002  -0.9342485149377322 -0.3566224549510067 -0.00037008290847423419
+0.42264973081037438 0.42264973081037427 1.577350269189626  -0.57762605998672523 -0.57702725326215676 0.57739733617063294
+0.065827641037284446 1.3568220897730903 1.0000000000000002  -0.93401979112163935 0.35722126167557461 1.1496081365873945e-15
+1.3312080946370168 1.4012770227944238 1.8539777216205118  0.33139575632083185 0.4011866027874687 0.85394740027497806
+1.2046978598347684 1.7324851174314406 1.6492798617857436  0.20481384113375387 0.73258235910829939 0.6491335591412265
+0.79530214016523215 1.7324851174314406 1.6492798617857436  -0.20481384113375173 0.73258235910829927 0.64913355914122717
+0.66879190536298383 1.4012770227944238 1.853977721620512  -0.33139575632083168 0.40118660278746887 0.85394740027497806
+1.0000000000000002 1.1965791629596558 1.9804879564227607  0 0.196372761653717 0.98052931546205813
+1.0000000000000002 1.1965791629596558 0.019512043577239568  0 0.196372761653717 -0.98052931546205813
+0.66879190536298361 1.4012770227944238 0.146022278379488  -0.33139575632083101 0.40118660278746843 -0.85394740027497851
+0.79530214016523226 1.7324851174314406 0.35072013821425641  -0.20481384113375264 0.73258235910829961 -0.6491335591412265
+1.2046978598347684 1.7324851174314404 0.35072013821425629  0.20481384113375153 0.73258235910829905 -0.6491335591412275
+1.3312080946370171 1.401277022794424 0.14602227837948833  0.33139575632083135 0.40118660278746726 -0.85394740027497895
+1.401277022794424 0.14602227837948833 1.3312080946370171  0.40118660278746898 -0.85394740027497829 0.3313957563208309
+1.1965791629596561 0.019512043577239457 1.0000000000000002  0.19637276165371714 -0.98052931546205813 0
+1.4012770227944238 0.146022278379488 0.66879190536298361  0.40118660278746804 -0.85394740027497862 -0.33139575632083129
+1.7324851174314406 0.35072013821425641 0.79530214016523226  0.73258235910829961 -0.6491335591412265 -0.20481384113375264
+1.7324851174314406 0.35072013821425641 1.2046978598347684  0.73258235910829916 -0.64913355914122739 0.20481384113375165
+1.8539777216205118 1.3312080946370168 1.4012770227944238  0.85394740027497817 0.33139575632083174 0.40118660278746876
+0.1974660445788706 0.41582096722616779 0.88692657891222382  -0.79565076497466325 -0.59478368364253609 -0.11477033531295829
+0.019512043577239346 1.0000000000000002 0.80342083704034495  -0.98052931546205824 0 -0.19637276165371648
+0.35072013821425629 0.79530214016523215 1.7324851174314406  -0.64913355914122772 -0.2048138411337517 0.73258235910829883
+0.26751488256855993 1.649279861785744 1.2046978598347684  -0.73258235910829883 0.64913355914122717 0.20481384113375317
+1.0000000000000002 0.80342083704034495 1.9804879564227607  -1.0422004117939917e-16 -0.19637276165371575 0.98052931546205846
+1.6492798617857436 0.79530214016523215 1.7324851174314406  0.64913355914122861 -0.20481384113375267 0.73258235910829772
+1.6492798617857436 1.2046978598347686 1.7324851174314406  0.64913355914122639 0.20481384113375387 0.7325823591082995
+1.7324851174314406 1.6492798617857436 1.2046978598347684  0.73258235910829939 0.6491335591412265 0.20481384113375387
+1.4012770227944238 1.8539777216205118 1.3312080946370168  0.40118660278746876 0.85394740027497817 0.33139575632083174
+0.80342083704034506 1.9804879564227607 1.0000000000000002  -0.19637276165371562 0.98052931546205846 0
+0.59872297720557688 1.8539777216205122 1.3312080946370171  -0.40118660278746876 0.85394740027497795 0.33139575632083201
+0.14602227837948833 1.3312080946370171 1.401277022794424  -0.85394740027497884 0.33139575632083113 0.40118660278746771
+0.35072013821425641 1.2046978598347684 1.7324851174314406  -0.64913355914122739 0.20481384113375165 0.73258235910829916
+0.66879190536298383 0.59872297720557643 1.8539777216205122  -0.33139575632083085 -0.40118660278746721 0.85394740027497917
+1.649279861785744 1.2046978598347684 0.26751488256855982  0.64913355914122706 0.20481384113375306 -0.73258235910829916
+1.3312080946370175 0.59872297720557643 0.14602227837948822  0.33139575632083124 -0.40118660278746804 -0.85394740027497862
+1.0000000000000002 0.80342083704034484 0.019512043577239457  0 -0.19637276165371659 -0.98052931546205824
+0.10155294642477927 0.62688758712066828 0.77156308049914146  -0.9089423780023973 -0.34889693998410792 -0.22824258748330262
+0.35072013821425641 1.2046978598347684 0.26751488256855949  -0.64913355914122695 0.20481384113375189 -0.7325823591082995
+0.26751488256855938 1.6492798617857436 0.79530214016523215  -0.73258235910830005 0.64913355914122683 -0.20481384113375023
+0.59872297720557666 1.8539777216205122 0.66879190536298361  -0.40118660278746709 0.85394740027497917 -0.33139575632083096
+1.1965791629596561 1.9804879564227607 1  0.19637276165371698 0.98052931546205824 -3.3611241228009335e-16
+1.401277022794424 1.8539777216205118 0.66879190536298383  0.40118660278746887 0.85394740027497817 -0.33139575632083151
+1.853977721620512 1.3312080946370168 0.59872297720557677  0.85394740027497806 0.33139575632083185 -0.4011866027874687
+1.853977721620512 0.66879190536298383 1.4012770227944238  0.85394740027497806 -0.33139575632083168 0.40118660278746887
+1.3312080946370171 0.59872297720557688 1.8539777216205122  0.33139575632083201 -0.40118660278746876 0.85394740027497795
+1.2046978598347684 0.26751488256855982 1.649279861785744  0.20481384113375259 -0.73258235910830005 0.64913355914122617
+0.59872297720557643 0.14602227837948822 1.3312080946370175  -0.40118660278746776 -0.85394740027497862 0.33139575632083168
+0.80342083704034495 0.019512043577239346 1.0000000000000002  -0.19637276165371648 -0.98052931546205824 0
+0.096124922711889493 0.65746189559341328 0.74644278217951743  -0.90894237800239686 -0.34889693998411031 -0.22824258748330079
+1.2046978598347686 0.2675148825685596 0.35072013821425641  0.20481384113375192 -0.7325823591082995 -0.64913355914122695
+1.6492798617857436 0.79530214016523215 0.26751488256855938  0.64913355914122683 -0.20481384113375023 -0.73258235910830005
+1.8539777216205122 0.66879190536298383 0.59872297720557643  0.85394740027497917 -0.33139575632083079 -0.40118660278746726
+1.9804879564227607 1.0000000000000002 1.1965791629596558  0.98052931546205813 0 0.19637276165371695
+1.9804879564227607 1.0000000000000002 0.80342083704034484  0.98052931546205846 0 -0.19637276165371578
+1.7324851174314402 1.649279861785744 0.79530214016523226  0.73258235910829905 0.6491335591412275 -0.20481384113375153
+0.78745552743149327 0.10609528287383579 0.60630413399985716  -0.2304276104259802 -0.87734110809753463 -0.42092243512975486
+0.28910030252843322 0.30397342055421106 0.90687073458352596  -0.726514047779109 -0.6809683700479634 -0.091975091050971569
+0.26218372058148809 0.33295004022963903 0.90494753379947435  -0.72651404777911421 -0.68096837004795852 -0.091975091050967947
+0.14602227837948811 0.66879190536298361 1.401277022794424  -0.85394740027497862 -0.33139575632083124 0.40118660278746804
+0.2675148825685596 0.35072013821425641 1.2046978598347686  -0.7325823591082995 -0.64913355914122695 0.20481384113375192
+0.79530214016523215 0.26751488256855938 1.6492798617857436  -0.20481384113375023 -0.73258235910830005 0.64913355914122683
+0.14602227837948811 1.3312080946370171 0.59872297720557643  -0.85394740027497829 0.33139575632083146 -0.40118660278746848
+0.019512043577239457 1.0000000000000002 1.1965791629596561  -0.98052931546205813 0 0.19637276165371714
+1.5339861224060576 1.4054741487319156 1.7419228637721522  0.53404105644655853 0.40564529943251842 0.74178975530654656
+1.2079367413660946 1.8640076955737634 1.4585335468418474  0.20774869885998731 0.86409658071843209 0.45845128128591411
+0.59452585126808544 1.7419228637721522 1.533986122406058  -0.40564529943251854 0.74178975530654634 0.53404105644655853
+0.54146645315815245 1.2079367413660949 1.8640076955737634  -0.45845128128591289 0.20774869885998976 0.86409658071843232
+1.1220848318016112 1.0000000000000002 1.9925196692479057  0.12230682541188717 1.0419271530395937e-17 0.99249233773247136
+0.87791516819838944 1.0000000000000002 0.0074803307520941997  -0.1223068254118834 3.6814759407398977e-16 -0.99249233773247192
+0.46601387759394242 1.4054741487319158 0.25807713622784789  -0.53404105644655753 0.40564529943251815 -0.74178975530654745
+0.79206325863390559 1.8640076955737634 0.54146645315815256  -0.20774869885998828 0.86409658071843198 -0.45845128128591417
+1.4054741487319156 1.7419228637721522 0.46601387759394231  0.40564529943251898 0.74178975530654656 -0.53404105644655808
+1.4585335468418481 1.2079367413660951 0.13599230442623689  0.45845128128591389 0.20774869885998942 -0.86409658071843176
+1.2079367413660951 0.135992304426237 1.4585335468418483  0.20774869885999012 -0.86409658071843165 0.45845128128591389
+1.0000000000000002 0.0074803307520941997 0.87791516819838944  -4.5150176631715731e-17 -0.99249233773247181 -0.12230682541188409
+1.4054741487319158 0.258077136227848 0.46601387759394253  0.40564529943251815 -0.74178975530654734 -0.53404105644655753
+1.8640076955737634 0.54146645315815256 0.79206325863390559  0.86409658071843198 -0.45845128128591417 -0.20774869885998828
+1.7419228637721522 0.46601387759394275 1.4054741487319153  0.74178975530654689 -0.53404105644655808 0.40564529943251831
+1.7419228637721522 1.5339861224060576 1.4054741487319156  0.74178975530654678 0.53404105644655786 0.4056452994325187
+0.14564781357706014 0.50275426427774228 0.85145286645038376  -0.84903903628469291 -0.49501822108781729 -0.18463389628075594
+0.0074803307520941997 1.1220848318016112 1.0000000000000002  -0.99249233773247181 0.12230682541188395 -1.3892362040527919e-17
+0.54146645315815245 0.79206325863390548 1.8640076955737634  -0.458451281285915 -0.20774869885998923 0.86409658071843132
+0.25807713622784823 1.5339861224060583 1.4054741487319156  -0.74178975530654656 0.53404105644655775 0.40564529943251931
+0.87791516819838944 1.0000000000000002 1.9925196692479057  -0.12230682541188399 3.4730905101319789e-18 0.99249233773247181
+1.533986122406058 0.59452585126808544 1.7419228637721522  0.53404105644655864 -0.40564529943251854 0.74178975530654645
+1.4585335468418477 1.2079367413660946 1.8640076955737634  0.45845128128591472 0.2077486988599905 0.8640965807184311
+1.8640076955737634 1.4585335468418477 1.2079367413660946  0.8640965807184311 0.45845128128591467 0.20774869885999048
+1.4054741487319156 1.7419228637721522 1.5339861224060576  0.4056452994325182 0.74178975530654701 0.53404105644655797
+1.0000000000000002 1.9925196692479057 0.87791516819838922  8.5438026549246697e-16 0.99249233773247192 -0.1223068254118827
+0.7920632586339057 1.8640076955737634 1.4585335468418479  -0.20774869885998981 0.86409658071843187 0.45845128128591361
+0.135992304426237 1.4585335468418483 1.2079367413660951  -0.86409658071843176 0.45845128128591378 0.20774869885999001
+0.46601387759394275 1.4054741487319153 1.7419228637721522  -0.53404105644655875 0.40564529943251865 0.74178975530654623
+0.46601387759394253 0.59452585126808521 1.7419228637721527  -0.53404105644655886 -0.40564529943251743 0.74178975530654678
+1.5339861224060583 1.4054741487319153 0.25807713622784811  0.53404105644655808 0.40564529943251759 -0.74178975530654723
+1.533986122406058 0.5945258512680851 0.25807713622784789  0.53404105644655786 -0.40564529943251637 -0.741789755306548
+1.1220848318016112 1.0000000000000002 0.0074803307520941997  0.12230682541188462 3.9245922764491371e-16 -0.9924923377324717
+0.12850859076870802 0.5423386494351099 0.82968743367193953  -0.87265298324518692 -0.4603681578214735 -0.16290466567087195
+0.54146645315815223 1.2079367413660949 0.13599230442623678  -0.458451281285913 0.20774869885998931 -0.86409658071843221
+0.13599230442623678 1.4585335468418479 0.79206325863390536  -0.86409658071843176 0.45845128128591395 -0.20774869885998948
+0.59452585126808533 1.7419228637721524 0.46601387759394242  -0.40564529943251737 0.74178975530654634 -0.53404105644655953
+1.0000000000000002 1.9925196692479057 1.1220848318016112  5.904253867224365e-17 0.99249233773247181 0.12230682541188408
+1.2079367413660951 1.8640076955737632 0.54146645315815234  0.20774869885999017 0.86409658071843176 -0.45845128128591367
+1.8640076955737634 1.4585335468418479 0.7920632586339057  0.86409658071843076 0.45845128128591522 -0.20774869885999078
+1.8640076955737634 0.54146645315815256 1.2079367413660949  0.86409658071843232 -0.45845128128591284 0.20774869885998976
+1.4585335468418479 0.7920632586339057 1.8640076955737634  0.45845128128591522 -0.20774869885999078 0.86409658071843076
+1.4054741487319153 0.25807713622784811 1.5339861224060583  0.40564529943251804 -0.74178975530654723 0.53404105644655797
+0.5945258512680851 0.25807713622784789 1.533986122406058  -0.40564529943251643 -0.74178975530654812 0.53404105644655786
+1.0000000000000002 0.0074803307520941997 1.1220848318016112  -1.3892362040527919e-17 -0.99249233773247181 0.12230682541188395
+0.12310298935169575 0.55521070025011254 0.82226795238624728  -0.53077402771794857 -0.83361988814006172 0.15282936104498174
+1.2079367413660949 0.13599230442623678 0.54146645315815223  0.20774869885998931 -0.86409658071843221 -0.45845128128591306
+1.4585335468418479 0.79206325863390536 0.13599230442623678  0.45845128128591295 -0.20774869885998887 -0.86409658071843243
+1.7419228637721527 0.46601387759394253 0.59452585126808521  0.74178975530654678 -0.53404105644655886 -0.40564529943251743
+1.9925196692479057 1.1220848318016112 1.0000000000000002  0.99249233773247136 0.12230682541188717 1.0419271530395937e-17
+1.9925196692479057 0.87791516819838944 1.0000000000000002  0.99249233773247159 -0.12230682541188531 9.0647662314444641e-16
+1.7419228637721522 1.533986122406058 0.59452585126808544  0.74178975530654645 0.53404105644655864 -0.40564529943251859
+0.10609528287383586 0.60630413399985694 0.78745552743149316  -0.87734110809753796 -0.42092243512974953 -0.23042761042597798
+0.71884915497263779 0.093588483842681203 0.68777595190194329  -0.29270566773562345 -0.90562084821138311 -0.30687826798314943
+0.69813515078208477 0.093116941936638692 0.70892487408416871  -0.29270566773563078 -0.90562084821138489 -0.30687826798313739
+0.258077136227848 0.46601387759394253 1.4054741487319158  -0.74178975530654734 -0.53404105644655764 0.4056452994325182
+0.13599230442623678 0.54146645315815223 1.2079367413660949  -0.86409658071843221 -0.45845128128591306 0.20774869885998931
+0.79206325863390536 0.13599230442623678 1.4585335468418479  -0.20774869885998887 -0.86409658071843243 0.45845128128591295
+0.25807713622784789 1.533986122406058 0.59452585126808488  -0.74178975530654812 0.53404105644655786 -0.40564529943251648
+0.0074803307520941997 0.87791516819838944 1.0000000000000002  -0.99249233773247181 -0.12230682541188409 -4.5150176631715731e-17
+1.1827577335161514 1.5664460834152063 1.8035785247401852  0.18137511328579206 0.56621300696156995 0.80405590541211946
+1.2379740221293494 1.20209118411409 1.9500144830974655  0.23767767361493702 0.20255543129006781 0.94998980032413294
+1 1.6793965744350836 1.7337712822439113  -9.376138298315617e-17 0.6783089916855547 0.73477677685030718
+1.3850500562448067 1.5871412403588967 1.7120404609681164  0.38457055427597053 0.58712598556604023 0.71231212670919675
+0.81724226648384946 1.5664460834152067 1.8035785247401852  -0.18137511328579153 0.56621300696157062 0.80405590541211913
+1 1.8251152624882454 1.5649644268526592  3.438308077231267e-16 0.82480365918097642 0.56541924604816174
+0.88704950898012358 1.3836883498990562 1.9165290157600621  -0.11209598472398226 0.38483789367577698 0.91615189013610188
+0.61494994375519396 1.5871412403588967 1.7120404609681168  -0.38457055427597275 0.58712598556604123 0.71231212670919475
+1.1129504910198773 1.3836883498990558 1.9165290157600623  0.1120959847239837 0.38483789367577748 0.91615189013610154
+0.76202597787065152 1.20209118411409 1.9500144830974659  -0.23767767361493677 0.2025554312900677 0.94998980032413305
+0.88704950898012358 1.3836883498990558 0.083470984239937707  -0.1120959847239813 0.38483789367577687 -0.9161518901361021
+1.2379740221293494 1.20209118411409 0.049985516902534388  0.23767767361493577 0.20255543129006892 -0.94998980032413305
+0.81724226648384946 1.5664460834152065 0.19642147525981468  -0.18137511328579259 0.56621300696157051 -0.80405590541211902
+0.76202597787065152 1.20209118411409 0.049985516902534055  -0.23767767361493672 0.20255543129006834 -0.94998980032413294
+1 1.6793965744350834 0.26622871775608836  -7.4661842005105821e-16 0.67830899168555392 -0.73477677685030796
+0.61494994375519396 1.5871412403588969 0.28795953903188354  -0.38457055427597092 0.58712598556604167 -0.7123121267091953
+1.1827577335161514 1.5664460834152067 0.1964214752598149  0.18137511328579306 0.56621300696157151 -0.80405590541211813
+1 1.8251152624882456 0.43503557314734087  -3.2299257695202805e-16 0.82480365918097664 -0.56541924604816129
+1.1129504910198773 1.3836883498990562 0.08347098423993804  0.1120959847239832 0.38483789367577731 -0.91615189013610165
+1.3850500562448065 1.5871412403588967 0.28795953903188365  0.38457055427596948 0.58712598556604079 -0.71231212670919675
+1.3836883498990562 0.08347098423993804 1.1129504910198773  0.3848378936757787 -0.91615189013610121 0.11209598472398163
+1.5871412403588967 0.28795953903188365 1.3850500562448065  0.58712598556604045 -0.71231212670919652 0.38457055427597064
+1.3836883498990558 0.083470984239937596 0.88704950898012358  0.38483789367577764 -0.91615189013610177 -0.11209598472398113
+1.20209118411409 0.049985516902534388 1.2379740221293494  0.20255543129006892 -0.94998980032413305 0.23767767361493577
+1.5664460834152067 0.19642147525981479 0.81724226648384946  0.56621300696157051 -0.80405590541211891 -0.18137511328579287
+1.20209118411409 0.049985516902534055 0.76202597787065152  0.20255543129006834 -0.94998980032413294 -0.23767767361493672
+1.6793965744350836 0.26622871775608847 1  0.67830899168555392 -0.73477677685030796 -7.7092692675039513e-16
+1.5871412403588971 0.28795953903188365 0.61494994375519385  0.58712598556604101 -0.71231212670919575 -0.38457055427597103
+1.5664460834152067 0.19642147525981501 1.1827577335161514  0.56621300696157129 -0.80405590541211813 0.18137511328579395
+1.8251152624882456 0.43503557314734087 1  0.82480365918097664 -0.56541924604816129 -3.2299257695202805e-16
+1.803578524740185 1.1827577335161514 1.5664460834152067  0.80405590541211924 0.18137511328579298 0.56621300696157006
+1.9500144830974655 1.2379740221293494 1.20209118411409  0.94998980032413294 0.23767767361493702 0.20255543129006781
+0.88704950898012358 0.61631165010094424 0.083470984239937707  -0.11209598472398068 -0.38483789367577892 -0.91615189013610132
+0.11695476797072325 0.81049434395812059 0.57278135509939099  -0.88441806965928826 -0.18329374350458946 -0.42919468968314645
+0.083470984239937707 1.1129504910198773 0.61631165010094446  -0.91615189013610143 0.11209598472398319 -0.38483789367577775
+0.049985516902534055 0.76202597787065152 0.79790881588591023  -0.94998980032413294 -0.23767767361493683 -0.2025554312900682
+0.26622871775608847 1 1.6793965744350836  -0.73477677685030796 -7.7092692675039513e-16 0.67830899168555392
+0.28795953903188365 0.61494994375519385 1.5871412403588971  -0.71231212670919564 -0.38457055427597181 0.58712598556604068
+0.4335539165847937 1.8035785247401852 1.1827577335161514  -0.5662130069615704 0.80405590541211858 0.18137511328579492
+0.17488473751175482 1.5649644268526597 1  -0.8248036591809762 0.56541924604816207 5.5568615389596231e-16
+0.88704950898012358 0.61631165010094435 1.9165290157600623  -0.1120959847239814 -0.38483789367577786 0.91615189013610154
+1.2379740221293494 0.79790881588591023 1.9500144830974657  0.23767767361493719 -0.20255543129006753 0.94998980032413294
+1.8035785247401852 0.81724226648384946 1.5664460834152067  0.80405590541211902 -0.18137511328579381 0.56621300696156995
+1.5649644268526592 1 1.8251152624882454  0.56541924604816174 3.438308077231267e-16 0.82480365918097642
+1.7337712822439113 1 1.6793965744350836  0.73477677685030718 -9.376138298315617e-17 0.6783089916855547
+1.7120404609681164 1.3850500562448067 1.5871412403588967  0.71231212670919519 0.38457055427597214 0.58712598556604101
+1.6793965744350836 1.7337712822439113 1  0.67830899168555459 0.73477677685030729 -1.7363219070954845e-17
+1.5871412403588967 1.7120404609681164 1.3850500562448067  0.58712598556604001 0.71231212670919664 0.38457055427597087
+1.5664460834152067 1.803578524740185 1.1827577335161514  0.56621300696156995 0.80405590541211935 0.18137511328579267
+1.20209118411409 1.9500144830974655 1.2379740221293494  0.20255543129006781 0.94998980032413294 0.23767767361493702
+0.61631165010094446 1.9165290157600623 0.88704950898012325  -0.38483789367577803 0.91615189013610154 -0.11209598472398145
+0.79790881588591023 1.9500144830974657 1.2379740221293494  -0.20255543129006748 0.94998980032413305 0.23767767361493711
+0.61631165010094424 1.9165290157600623 1.1129504910198773  -0.38483789367577592 0.91615189013610221 0.11209598472398261
+0.41285875964110408 1.712040460968117 1.3850500562448065  -0.58712598556604001 0.71231212670919664 0.38457055427597098
+0.08347098423993804 1.1129504910198773 1.3836883498990562  -0.91615189013610132 0.11209598472398308 0.38483789367577803
+0.28795953903188365 1.3850500562448065 1.5871412403588967  -0.71231212670919619 0.38457055427597098 0.58712598556604068
+0.19642147525981501 1.1827577335161514 1.5664460834152067  -0.80405590541211813 0.18137511328579395 0.56621300696157129
+0.43503557314734087 1 1.8251152624882456  -0.56541924604816129 -3.2299257695202805e-16 0.82480365918097664
+0.81724226648384946 0.43355391658479348 1.8035785247401854  -0.18137511328579439 -0.56621300696157062 0.80405590541211847
+0.76202597787065152 0.79790881588591056 1.9500144830974659  -0.23767767361493689 -0.20255543129006748 0.94998980032413316
+1.8035785247401852 1.1827577335161514 0.4335539165847937  0.80405590541211858 0.18137511328579328 -0.56621300696157084
+1.5649644268526597 1 0.17488473751175482  0.56541924604816207 5.6263223081966191e-16 -0.8248036591809762
+1.1827577335161514 0.43355391658479359 0.19642147525981479  0.18137511328579375 -0.56621300696157095 -0.80405590541211847
+1.2379740221293494 0.79790881588591067 0.049985516902534166  0.23767767361493766 -0.20255543129006781 -0.94998980032413283
+1.1129504910198773 0.61631165010094446 0.083470984239937707  0.11209598472398249 -0.38483789367577809 -0.91615189013610143
+0.76202597787065152 0.79790881588591023 0.049985516902534055  -0.2376776736149355 -0.202555431290069 -0.94998980032413316
+0.12315882465233809 0.82188503772742794 0.55513243511370003  -0.88441806965928915 -0.18329374350459193 -0.42919468968314334
+0.43503557314734065 1 0.1748847375117546  -0.56541924604816052 6.9460769236995282e-18 -0.8248036591809772
+0.26622871775608858 1 0.32060342556491639  -0.73477677685030895 1.805774783379304e-16 -0.67830899168555292
+0.28795953903188343 1.3850500562448067 0.41285875964110363  -0.7123121267091963 0.38457055427597114 -0.58712598556604034
+0.32060342556491628 1.7337712822439113 1  -0.67830899168555359 0.73477677685030818 1.5279632782440261e-16
+0.41285875964110386 1.7120404609681168 0.61494994375519374  -0.58712598556604001 0.71231212670919686 -0.38457055427597087
+0.43355391658479348 1.8035785247401854 0.81724226648384946  -0.56621300696157029 0.80405590541211891 -0.18137511328579398
+0.79790881588591056 1.9500144830974659 0.76202597787065107  -0.20255543129006695 0.94998980032413305 -0.23767767361493727
+1.3836883498990558 1.9165290157600623 1.1129504910198773  0.3848378936757757 0.9161518901361021 0.11209598472398441
+1.20209118411409 1.9500144830974657 0.76202597787065107  0.20255543129006906 0.9499898003241326 -0.23767767361493711
+1.3836883498990562 1.9165290157600621 0.88704950898012325  0.38483789367577703 0.91615189013610188 -0.11209598472398222
+1.5871412403588967 1.7120404609681168 0.61494994375519396  0.58712598556604123 0.71231212670919475 -0.3845705542759727
+1.9165290157600623 1.1129504910198773 0.61631165010094424  0.91615189013610221 0.11209598472398261 -0.38483789367577592
+1.712040460968117 1.3850500562448065 0.41285875964110408  0.71231212670919664 0.38457055427597103 -0.58712598556604001
+1.9165290157600621 0.88704950898012358 1.3836883498990562  0.91615189013610188 -0.11209598472398227 0.38483789367577698
+1.7120404609681168 0.61494994375519396 1.5871412403588967  0.71231212670919475 -0.38457055427597275 0.58712598556604123
+1.1129504910198773 0.61631165010094424 1.9165290157600623  0.11209598472398245 -0.38483789367577781 0.91615189013610154
+1.3850500562448065 0.41285875964110408 1.712040460968117  0.38457055427597103 -0.58712598556604001 0.71231212670919664
+1.1827577335161514 0.43355391658479359 1.8035785247401852  0.18137511328579506 -0.5662130069615704 0.80405590541211847
+1 0.17488473751175482 1.5649644268526597  5.6263223081966191e-16 -0.8248036591809762 0.56541924604816207
+0.43355391658479359 0.19642147525981479 1.1827577335161514  -0.5662130069615704 -0.80405590541211902 0.18137511328579242
+0.79790881588591067 0.049985516902534166 1.2379740221293494  -0.20255543129006781 -0.94998980032413283 0.23767767361493766
+0.61631165010094446 0.083470984239937707 1.1129504910198773  -0.38483789367577714 -0.91615189013610177 0.11209598472398331
+0.79790881588591023 0.049985516902534055 0.76202597787065152  -0.2025554312900682 -0.94998980032413294 -0.23767767361493683
+0.17773204761375261 0.87689701064830428 0.44478929974988757  -0.85331277880251888 -0.17482109513942348 -0.49121775846011101
+1 0.1748847375117546 0.43503557314734065  3.4730384618497641e-18 -0.8248036591809772 -0.56541924604816052
+1 0.3206034255649165 0.26622871775608858  -9.0288739168965187e-17 -0.67830899168555236 -0.73477677685030929
+1.3850500562448067 0.41285875964110363 0.28795953903188343  0.38457055427597059 -0.5871259855660399 -0.71231212670919697
+1.7337712822439113 1 0.32060342556491628  0.73477677685030851 -8.3343451540583259e-17 -0.67830899168555336
+1.712040460968117 0.61494994375519374 0.41285875964110375  0.71231212670919664 -0.38457055427597159 -0.58712598556603957
+1.8035785247401854 0.81724226648384946 0.43355391658479348  0.80405590541211858 -0.18137511328579436 -0.56621300696157051
+1.9500144830974659 0.76202597787065152 0.79790881588591056  0.94998980032413316 -0.23767767361493677 -0.2025554312900672
+1.9165290157600623 1.1129504910198773 1.3836883498990558  0.9161518901361021 0.11209598472398385 0.38483789367577603
+1.9500144830974659 0.76202597787065152 1.20209118411409  0.94998980032413283 -0.23767767361493666 0.202555431290069
+1.9165290157600623 0.88704950898012358 0.61631165010094435  0.91615189013610165 -0.1120959847239814 -0.38483789367577792
+1.9500144830974657 1.2379740221293494 0.79790881588591023  0.94998980032413294 0.23767767361493719 -0.20255543129006753
+1.5664460834152067 1.8035785247401852 0.81724226648384946  0.56621300696156995 0.80405590541211902 -0.18137511328579381
+1.8251152624882454 1.5649644268526592 1  0.82480365918097653 0.56541924604816174 3.4035776926127695e-16
+0.61631165010094424 0.083470984239937596 0.88704950898012358  -0.38483789367577803 -0.91615189013610143 -0.11209598472398227
+0.22681489975349639 0.89805158744476077 0.37520377518580433  -0.7793365693277361 -0.08592510192565847 -0.62068622392279671
+0.083470984239937707 0.88704950898012358 0.61631165010094424  -0.91615189013610143 -0.1120959847239823 -0.38483789367577798
+0.21439421228553288 0.89457789356401529 0.39128013241131548  -0.77933656932774698 -0.085925101925651531 -0.62068622392278394
+0.098941938751961223 0.76032257344343512 0.64081678241520534  -0.89982453013548314 -0.22723563663234561 -0.3723973421102113
+0.1748847375117546 0.43503557314734065 1  -0.8248036591809772 -0.56541924604816052 6.9460769236995282e-18
+0.19642147525981468 0.81724226648384946 1.5664460834152065  -0.80405590541211902 -0.18137511328579295 0.56621300696157051
+0.049985516902534055 0.76202597787065152 1.20209118411409  -0.94998980032413294 -0.23767767361493672 0.20255543129006834
+0.32060342556491639 0.26622871775608858 1  -0.67830899168555359 -0.73477677685030829 -3.8199081956100662e-16
+0.41285875964110363 0.28795953903188343 1.3850500562448067  -0.5871259855660399 -0.71231212670919697 0.38457055427597059
+1 0.32060342556491628 1.7337712822439113  -8.3343451540583259e-17 -0.67830899168555336 0.73477677685030851
+0.61494994375519374 0.41285875964110375 1.712040460968117  -0.38457055427597159 -0.58712598556603957 0.71231212670919664
+0.19642147525981479 1.1827577335161514 0.43355391658479359  -0.80405590541211847 0.18137511328579375 -0.56621300696157095
+0.049985516902534277 1.2379740221293494 0.79790881588591067  -0.94998980032413283 0.23767767361493755 -0.20255543129006789
+0.083470984239937707 0.88704950898012358 1.3836883498990558  -0.91615189013610143 -0.11209598472398105 0.38483789367577831
+0.049985516902534388 1.2379740221293494 1.20209118411409  -0.94998980032413305 0.23767767361493577 0.20255543129006892
+1.552183464309189 1.2754246841105661 1.786914649200342  0.55218785652865954 0.2754217387370686 0.78691259802682945
+1.3412681489687435 1.8276081484197548 1.4456465002315988  0.34127086350966168 0.82760959526572564 0.44564173451716987
+0.65873185103125687 1.8276081484197551 1.4456465002315988  -0.34127086350966257 0.82760959526572575 0.44564173451716904
+0.44781653569081104 1.2754246841105661 1.7869146492003423  -0.55218785652865776 0.27542173873706816 0.78691259802683089
+1.0000000000000002 0.93415653514182273 1.997829964540788  -7.6294444242543294e-17 -0.065849124772593692 0.99782959104582747
+1.0000000000000002 0.93415653514182284 0.0021700354592122384  0 -0.065849124772593678 -0.99782959104582747
+0.44781653569081092 1.2754246841105661 0.21308535079965796  -0.55218785652865854 0.2754217387370701 -0.78691259802682967
+0.65873185103125698 1.8276081484197553 0.55435349976840165  -0.34127086350966024 0.82760959526572697 -0.44564173451716849
+1.3412681489687435 1.8276081484197551 0.55435349976840154  0.34127086350966152 0.82760959526572653 -0.44564173451716826
+1.5521834643091894 1.2754246841105661 0.21308535079965818  0.55218785652865821 0.2754217387370686 -0.78691259802683033
+1.2754246841105661 0.21308535079965818 1.5521834643091894  0.27542173873706804 -0.78691259802683 0.55218785652865909
+0.93415653514182284 0.0021700354592122384 1.0000000000000002  -0.065849124772593678 -0.99782959104582747 0
+1.2754246841105661 0.21308535079965796 0.44781653569081092  0.27542173873706854 -0.78691259802682989 -0.55218785652865887
+1.8276081484197553 0.55435349976840165 0.65873185103125698  0.82760959526572697 -0.44564173451716849 -0.34127086350966024
+1.8276081484197553 0.55435349976840165 1.3412681489687435  0.82760959526572664 -0.4456417345171681 0.34127086350966146
+1.786914649200342 1.552183464309189 1.2754246841105661  0.78691259802682945 0.55218785652865954 0.2754217387370686
+0.10563529941394462 0.78429103445404746 0.61001812379817821  -0.89982453013547758 -0.22723563663234511 -0.37239734211022485
+0.0021700354592122384 1.0000000000000002 1.0658434648581778  -0.99782959104582747 0 0.065849124772594289
+0.55435349976840165 0.65873185103125698 1.8276081484197553  -0.44564173451716849 -0.34127086350966024 0.82760959526572697
+0.17239185158024528 1.4456465002315988 1.3412681489687437  -0.82760959526572597 0.4456417345171691 0.34127086350966152
+1.0000000000000002 1.0658434648581778 1.9978299645407878  0 0.06584912477259347 0.99782959104582758
+1.4456465002315988 0.65873185103125687 1.8276081484197551  0.44564173451716993 -0.34127086350966312 0.82760959526572497
+1.4456465002315988 1.3412681489687435 1.8276081484197548  0.44564173451716982 0.34127086350966168 0.82760959526572564
+1.8276081484197548 1.4456465002315988 1.3412681489687435  0.82760959526572564 0.44564173451716987 0.34127086350966168
+1.2754246841105661 1.786914649200342 1.552183464309189  0.2754217387370686 0.78691259802682945 0.55218785652865954
+1.0658434648581778 1.9978299645407878 1.0000000000000002  0.06584912477259347 0.99782959104582758 0
+0.72457531588943436 1.7869146492003418 1.5521834643091896  -0.27542173873706821 0.78691259802683022 0.55218785652865865
+0.21308535079965829 1.5521834643091896 1.2754246841105661  -0.78691259802682945 0.55218785652865909 0.27542173873706954
+0.55435349976840165 1.3412681489687435 1.8276081484197553  -0.4456417345171681 0.34127086350966146 0.82760959526572664
+0.44781653569081104 0.72457531588943436 1.7869146492003423  -0.55218785652865798 -0.27542173873706749 0.78691259802683089
+1.4456465002315988 1.3412681489687435 0.17239185158024506  0.44564173451716954 0.34127086350965968 -0.82760959526572664
+1.5521834643091892 0.72457531588943436 0.21308535079965796  0.55218785652865821 -0.27542173873706799 -0.78691259802683056
+1.0000000000000002 1.0658434648581778 0.0021700354592122384  0 0.065849124772594289 -0.99782959104582747
+0.4889881761220175 0.15304821643557709 0.85818780510941428  -0.51974293683793993 -0.84473325897900753 -0.12764403935075921
+0.55435349976840154 1.3412681489687437 0.17239185158024495  -0.44564173451716915 0.34127086350966218 -0.82760959526572586
+0.17239185158024495 1.4456465002315988 0.65873185103125698  -0.82760959526572564 0.44564173451716976 -0.3412708635096619
+0.72457531588943436 1.7869146492003423 0.44781653569081092  -0.27542173873706755 0.786912598026831 -0.55218785652865809
+0.93415653514182273 1.997829964540788 1  -0.065849124772593734 0.99782959104582747 0
+1.2754246841105661 1.7869146492003423 0.44781653569081104  0.27542173873706871 0.78691259802683 -0.55218785652865865
+1.7869146492003418 1.5521834643091896 0.72457531588943436  0.78691259802683022 0.55218785652865865 -0.27542173873706821
+1.7869146492003423 0.44781653569081104 1.2754246841105661  0.78691259802683078 -0.55218785652865787 0.27542173873706816
+1.5521834643091896 0.72457531588943436 1.7869146492003418  0.55218785652865843 -0.27542173873706949 0.78691259802682989
+1.3412681489687435 0.17239185158024517 1.4456465002315988  0.34127086350966207 -0.82760959526572531 0.44564173451716999
+0.72457531588943436 0.21308535079965796 1.5521834643091892  -0.27542173873706804 -0.78691259802683067 0.55218785652865821
+1.0658434648581778 0.0021700354592122384 1.0000000000000002  0.065849124772594289 -0.99782959104582747 0
+0.3390347444358186 0.25671454238163 0.90442701067601727  -0.67452766723137414 -0.7327939509732676 -0.089584884642381846
+1.3412681489687437 0.17239185158024495 0.55435349976840154  0.34127086350966152 -0.82760959526572664 -0.4456417345171681
+1.4456465002315988 0.65873185103125698 0.17239185158024495  0.4456417345171701 -0.34127086350966135 -0.82760959526572564
+1.7869146492003423 0.44781653569081104 0.72457531588943436  0.78691259802683089 -0.55218785652865798 -0.27542173873706749
+1.997829964540788 1.0000000000000002 0.93415653514182273  0.99782959104582747 0 -0.065849124772593734
+1.9978299645407878 1.0000000000000002 1.0658434648581778  0.99782959104582758 0 0.06584912477259347
+1.8276081484197551 1.4456465002315988 0.65873185103125687  0.82760959526572575 0.44564173451716904 -0.34127086350966257
+0.32286639405373108 0.271410708194047 0.90595336478045685  -0.67452766723137181 -0.73279395097326983 -0.089584884642381429
+0.37520377518580433 0.22681489975349645 0.89805158744476099  -0.62068622392278694 -0.77933656932774453 -0.085925101925651837
+0.39128013241131554 0.21439421228553296 0.89457789356401551  -0.62068622392278161 -0.77933656932774842 -0.085925101925655431
+0.21308535079965796 0.44781653569081092 1.2754246841105661  -0.78691259802682989 -0.55218785652865887 0.27542173873706854
+0.17239185158024495 0.55435349976840154 1.3412681489687437  -0.82760959526572664 -0.4456417345171681 0.34127086350966152
+0.65873185103125698 0.17239185158024495 1.4456465002315988  -0.34127086350966135 -0.82760959526572564 0.4456417345171701
+0.21308535079965796 1.5521834643091892 0.72457531588943436  -0.78691259802683078 0.55218785652865821 -0.27542173873706777
+0.0021700354592122384 1.0000000000000002 0.93415653514182284  -0.99782959104582747 0 -0.065849124772593678
+1.2610542694501152 1.6345776112372217 1.7274351680516471  0.26123864468751945 0.63469945426951213 0.72726265769102394
+1.1186983640546238 1.2618850124125609 1.9577718614808168  0.11873329660574328 0.26161560941278683 0.9578411544659734
+0.93100371799927484 1.7532759752918454 1.6540755446568809  -0.069124135183107907 0.7534327508752533 0.65388144479235366
+1.3036963168239359 1.5229392818626755 1.7964314500523726  0.30395970967362101 0.52285425410030451 0.79638679287412995
+0.69630368317606461 1.5229392818626757 1.7964314500523726  -0.30395970967362018 0.52285425410030428 0.79638679287413039
+1.0689962820007257 1.7532759752918454 1.6540755446568809  0.069124135183106533 0.75343275087525341 0.65388144479235377
+0.88130163594537692 1.2618850124125609 1.9577718614808168  -0.11873329660574362 0.26161560941278666 0.9578411544659734
+0.73894573054988544 1.6345776112372219 1.7274351680516471  -0.2612386446875189 0.63469945426951158 0.72726265769102461
+1.2303366934291702 1.3308812944132862 1.9151298141069959  0.23057849677494968 0.33073974459589323 0.91512008947987133
+0.76966330657083071 1.3308812944132864 1.9151298141069959  -0.23057849677494727 0.33073974459589128 0.91512008947987278
+0.7696633065708306 1.3308812944132864 0.084870185893004102  -0.23057849677494846 0.33073974459589056 -0.91512008947987278
+1.2303366934291695 1.3308812944132864 0.084870185893004102  0.23057849677494913 0.33073974459589173 -0.91512008947987211
+0.73894573054988522 1.6345776112372219 0.27256483194835279  -0.26123864468751884 0.63469945426951091 -0.72726265769102516
+0.88130163594537714 1.2618850124125609 0.042228138519183167  -0.11873329660574164 0.26161560941278661 -0.95784115446597373
+1.0689962820007257 1.7532759752918454 0.34592445534311911  0.069124135183105159 0.75343275087525352 -0.65388144479235366
+0.6963036831760645 1.5229392818626757 0.20356854994762752  -0.30395970967362029 0.52285425410030351 -0.79638679287413072
+1.3036963168239355 1.5229392818626759 0.20356854994762763  0.30395970967362085 0.52285425410030362 -0.7963867928741305
+0.93100371799927484 1.7532759752918454 0.34592445534311911  -0.069124135183105534 0.75343275087525263 -0.65388144479235466
+1.1186983640546233 1.2618850124125609 0.042228138519183167  0.11873329660574364 0.26161560941278567 -0.95784115446597373
+1.2610542694501152 1.6345776112372221 0.27256483194835313  0.26123864468751828 0.63469945426951246 -0.72726265769102405
+1.2618850124125609 0.042228138519183167 1.1186983640546233  0.26161560941278567 -0.95784115446597373 0.11873329660574364
+1.6345776112372221 0.27256483194835313 1.2610542694501152  0.63469945426951224 -0.72726265769102416 0.2612386446875184
+1.3308812944132864 0.084870185893004102 0.7696633065708306  0.33073974459589056 -0.91512008947987278 -0.23057849677494846
+1.3308812944132866 0.084870185893004213 1.2303366934291695  0.33073974459589012 -0.91512008947987278 0.23057849677494896
+1.6345776112372219 0.27256483194835279 0.73894573054988522  0.63469945426951102 -0.72726265769102538 -0.26123864468751817
+1.2618850124125609 0.042228138519183167 0.88130163594537714  0.26161560941278661 -0.95784115446597373 -0.11873329660574164
+1.7532759752918454 0.34592445534311911 1.0689962820007257  0.75343275087525352 -0.65388144479235366 0.069124135183105159
+1.5229392818626757 0.20356854994762752 0.69630368317606439  0.52285425410030506 -0.79638679287412995 -0.30395970967361963
+1.5229392818626759 0.20356854994762763 1.3036963168239355  0.52285425410030439 -0.79638679287413017 0.30395970967362029
+1.7532759752918454 0.34592445534311911 0.93100371799927484  0.75343275087525263 -0.65388144479235466 -0.069124135183105534
+1.7274351680516471 1.2610542694501152 1.6345776112372219  0.72726265769102394 0.26123864468751956 0.63469945426951202
+1.9577718614808168 1.1186983640546238 1.2618850124125609  0.9578411544659734 0.11873329660574189 0.26161560941278761
+0.88130163594537692 0.73811498758743943 0.042228138519183056  -0.11873329660574239 -0.26161560941278583 -0.95784115446597384
+0.093116941936638636 0.70892487408416871 0.69813515078208488  -0.90562084821138567 -0.3068782679831335 -0.29270566773563267
+0.084870185893004102 1.2303366934291702 0.66911870558671405  -0.91512008947987167 0.2305784967749494 -0.33073974459589267
+0.084870185893003991 0.7696633065708306 0.66911870558671405  -0.91512008947987267 -0.23057849677494854 -0.33073974459589062
+0.34592445534311922 1.0689962820007257 1.7532759752918454  -0.65388144479235377 0.069124135183105173 0.75343275087525341
+0.20356854994762752 0.69630368317606439 1.5229392818626757  -0.79638679287412995 -0.30395970967361963 0.52285425410030506
+0.47706071813732487 1.7964314500523728 1.3036963168239355  -0.52285425410030451 0.79638679287413061 0.30395970967361896
+0.24672402470815469 1.6540755446568811 0.93100371799927484  -0.7534327508752533 0.65388144479235388 -0.069124135183105853
+0.7696633065708306 0.66911870558671405 1.9151298141069959  -0.23057849677494704 -0.33073974459588984 0.91512008947987322
+1.2303366934291695 0.66911870558671405 1.9151298141069959  0.23057849677494729 -0.33073974459589001 0.91512008947987311
+1.7964314500523726 0.69630368317606461 1.5229392818626757  0.79638679287413161 -0.30395970967361863 0.52285425410030317
+1.6540755446568807 1.0689962820007257 1.7532759752918454  0.65388144479235377 0.069124135183105298 0.75343275087525352
+1.6540755446568809 0.93100371799927484 1.7532759752918454  0.65388144479235366 -0.069124135183107907 0.7534327508752533
+1.7964314500523724 1.3036963168239359 1.5229392818626757  0.79638679287413128 0.30395970967361957 0.52285425410030317
+1.7532759752918454 1.6540755446568809 0.93100371799927484  0.75343275087525341 0.65388144479235366 -0.069124135183107907
+1.5229392818626755 1.7964314500523726 1.3036963168239359  0.52285425410030451 0.79638679287412995 0.30395970967362101
+1.6345776112372219 1.7274351680516471 1.2610542694501152  0.63469945426951224 0.72726265769102383 0.26123864468751951
+1.2618850124125609 1.9577718614808168 1.1186983640546238  0.26161560941278761 0.9578411544659734 0.11873329660574189
+0.66911870558671405 1.9151298141069959 0.76966330657083049  -0.33073974459588978 0.91512008947987333 -0.23057849677494716
+0.66911870558671405 1.9151298141069959 1.2303366934291695  -0.33073974459589001 0.91512008947987311 0.23057849677494729
+0.73811498758743943 1.9577718614808171 1.1186983640546233  -0.26161560941278694 0.9578411544659734 0.11873329660574256
+0.36542238876277822 1.7274351680516471 1.2610542694501152  -0.63469945426950991 0.72726265769102549 0.26123864468752028
+0.042228138519183167 1.1186983640546233 1.2618850124125609  -0.95784115446597373 0.11873329660574364 0.26161560941278567
+0.27256483194835313 1.2610542694501152 1.6345776112372221  -0.72726265769102483 0.26123864468751878 0.63469945426951146
+0.20356854994762763 1.3036963168239355 1.5229392818626759  -0.79638679287413039 0.30395970967362002 0.52285425410030417
+0.34592445534311911 0.93100371799927484 1.7532759752918454  -0.65388144479235477 -0.069124135183105548 0.75343275087525263
+0.73894573054988544 0.36542238876277811 1.7274351680516471  -0.2612386446875189 -0.63469945426951069 0.72726265769102549
+0.88130163594537703 0.73811498758743976 1.9577718614808171  -0.11873329660574437 -0.26161560941278605 0.95784115446597351
+1.796431450052373 1.3036963168239355 0.47706071813732487  0.79638679287413061 0.30395970967361896 -0.52285425410030451
+1.6540755446568811 0.93100371799927484 0.24672402470815469  0.65388144479235388 -0.069124135183105853 -0.7534327508752533
+1.2610542694501152 0.36542238876277799 0.27256483194835313  0.26123864468751856 -0.63469945426951135 -0.72726265769102494
+1.1186983640546238 0.73811498758743954 0.042228138519183167  0.11873329660574192 -0.26161560941278578 -0.95784115446597384
+1.2303366934291702 0.66911870558671405 0.084870185893004102  0.23057849677494952 -0.33073974459589195 -0.91512008947987189
+0.7696633065708306 0.66911870558671405 0.084870185893003991  -0.23057849677494849 -0.33073974459589001 -0.91512008947987289
+0.093588483842681203 0.68777595190194329 0.71884915497263779  -0.90562084821138322 -0.30687826798314966 -0.29270566773562301
+0.345924455343119 1.0689962820007257 0.24672402470815469  -0.65388144479235411 0.069124135183104896 -0.7534327508752533
+0.345924455343119 0.93100371799927484 0.24672402470815469  -0.65388144479235411 -0.06912413518310527 -0.75343275087525319
+0.20356854994762752 1.3036963168239362 0.47706071813732454  -0.79638679287412961 0.30395970967362035 -0.52285425410030539
+0.24672402470815469 1.6540755446568811 1.0689962820007257  -0.75343275087525374 0.65388144479235344 0.069124135183105659
+0.47706071813732487 1.7964314500523728 0.6963036831760645  -0.52285425410030473 0.79638679287413039 -0.30395970967361946
+0.36542238876277799 1.7274351680516471 0.73894573054988533  -0.63469945426951047 0.72726265769102516 -0.26123864468751962
+0.73811498758743976 1.9577718614808171 0.88130163594537658  -0.26161560941278594 0.95784115446597362 -0.11873329660574408
+1.3308812944132862 1.9151298141069959 1.2303366934291702  0.33073974459589323 0.91512008947987145 0.23057849677494968
+1.3308812944132866 1.9151298141069959 0.76966330657083049  0.33073974459589062 0.91512008947987233 -0.23057849677494996
+1.2618850124125609 1.9577718614808168 0.88130163594537692  0.26161560941278672 0.9578411544659734 -0.11873329660574344
+1.6345776112372219 1.7274351680516471 0.73894573054988544  0.63469945426951158 0.72726265769102461 -0.2612386446875189
+1.9577718614808171 1.1186983640546233 0.73811498758743943  0.9578411544659734 0.1187332966057424 -0.26161560941278705
+1.7274351680516471 1.2610542694501152 0.36542238876277822  0.72726265769102549 0.26123864468752028 -0.63469945426950991
+1.9577718614808168 0.88130163594537692 1.2618850124125609  0.9578411544659734 -0.11873329660574362 0.26161560941278666
+1.7274351680516471 0.73894573054988544 1.6345776112372219  0.72726265769102461 -0.2612386446875189 0.63469945426951158
+1.1186983640546233 0.73811498758743943 1.9577718614808171  0.11873329660574403 -0.26161560941278617 0.95784115446597351
+1.2610542694501152 0.36542238876277833 1.7274351680516471  0.26123864468752028 -0.63469945426950991 0.7272626576910256
+1.3036963168239355 0.47706071813732487 1.796431450052373  0.30395970967361896 -0.52285425410030451 0.79638679287413061
+0.93100371799927484 0.24672402470815469 1.6540755446568811  -0.069124135183105853 -0.7534327508752533 0.65388144479235388
+0.36542238876277799 0.27256483194835313 1.2610542694501152  -0.63469945426951102 -0.72726265769102472 0.26123864468751967
+0.73811498758743976 0.042228138519183056 1.1186983640546238  -0.26161560941278561 -0.95784115446597395 0.11873329660574193
+0.66911870558671405 0.084870185893004102 1.2303366934291702  -0.33073974459589267 -0.91512008947987167 0.2305784967749494
+0.66911870558671394 0.084870185893003991 0.76966330657083049  -0.33073974459589167 -0.91512008947987178 -0.23057849677495032
+0.89805158744476088 0.37520377518580417 0.22681489975349667  -0.08592510192565074 -0.62068622392278905 -0.77933656932774298
+1.0689962820007257 0.24672402470815469 0.345924455343119  0.069124135183104896 -0.7534327508752533 -0.65388144479235411
+0.93100371799927484 0.24672402470815469 0.345924455343119  -0.069124135183105631 -0.75343275087525308 -0.65388144479235422
+1.3036963168239362 0.47706071813732476 0.20356854994762752  0.30395970967362101 -0.52285425410030562 -0.79638679287412917
+1.6540755446568811 1.0689962820007257 0.24672402470815469  0.65388144479235344 0.069124135183105659 -0.75343275087525374
+1.796431450052373 0.6963036831760645 0.47706071813732487  0.79638679287413039 -0.30395970967361946 -0.52285425410030462
+1.7274351680516471 0.73894573054988533 0.36542238876277799  0.72726265769102538 -0.26123864468751895 -0.63469945426951069
+1.9577718614808171 0.88130163594537703 0.73811498758743976  0.95784115446597362 -0.11873329660574432 -0.26161560941278583
+1.9151298141069959 1.2303366934291702 1.3308812944132862  0.91512008947987133 0.23057849677494968 0.33073974459589323
+1.9151298141069959 0.76966330657083071 1.3308812944132864  0.91512008947987322 -0.23057849677494754 0.33073974459588967
+1.9151298141069959 0.7696633065708306 0.66911870558671405  0.91512008947987333 -0.23057849677494707 -0.3307397445958899
+1.9151298141069959 1.2303366934291695 0.66911870558671405  0.91512008947987311 0.23057849677494729 -0.33073974459589001
+1.5229392818626757 1.7964314500523726 0.69630368317606461  0.52285425410030406 0.79638679287413117 -0.30395970967361852
+1.7532759752918454 1.6540755446568809 1.0689962820007257  0.75343275087525341 0.65388144479235377 0.069124135183106533
+0.73811498758743943 0.042228138519183056 0.88130163594537692  -0.26161560941278494 -0.95784115446597418 -0.11873329660574088
+0.89457789356401518 0.39128013241131554 0.21439421228553296  -0.08592510192565278 -0.62068622392278505 -0.77933656932774587
+0.042228138519183056 0.88130163594537692 0.73811498758743943  -0.95784115446597384 -0.11873329660574239 -0.26161560941278583
+0.66455433327713243 0.095362650095153129 0.74011618472454044  -0.35458300388089825 -0.89704722922209201 -0.26377483182397543
+0.095362650095153129 0.74011618472454033 0.66455433327713254  -0.8970472292220929 -0.26377483182397399 -0.35458300388089697
+0.24672402470815469 0.345924455343119 1.0689962820007257  -0.7534327508752533 -0.65388144479235411 0.069124135183104896
+0.27256483194835279 0.73894573054988522 1.6345776112372219  -0.72726265769102538 -0.26123864468751817 0.63469945426951102
+0.042228138519183167 0.88130163594537714 1.2618850124125609  -0.95784115446597373 -0.11873329660574164 0.26161560941278661
+0.24672402470815469 0.345924455343119 0.93100371799927484  -0.75343275087525319 -0.65388144479235422 -0.069124135183104271
+0.47706071813732465 0.20356854994762741 1.3036963168239364  -0.52285425410030584 -0.79638679287412883 0.30395970967362151
+1.0689962820007257 0.24672402470815469 1.6540755446568811  0.069124135183105659 -0.75343275087525374 0.65388144479235344
+0.6963036831760645 0.47706071813732487 1.796431450052373  -0.30395970967361957 -0.52285425410030428 0.79638679287413061
+0.27256483194835313 1.2610542694501152 0.36542238876277799  -0.72726265769102494 0.26123864468751856 -0.63469945426951135
+0.042228138519183056 1.1186983640546238 0.73811498758743976  -0.95784115446597395 0.11873329660574193 -0.26161560941278561
+0.084870185893004102 0.7696633065708306 1.3308812944132864  -0.91512008947987267 -0.23057849677494843 0.33073974459589051
+0.084870185893004213 1.2303366934291695 1.3308812944132866  -0.91512008947987222 0.23057849677494877 0.33073974459589162
+1.6135385194857188 1.4604717807940106 1.6415108917233323  0.6138235908938624 0.46011525660260011 0.6414939983380108
+1.4215187719833615 1.4686357350626609 1.7763391479810346  0.42177409750733502 0.46868822204941951 0.77616877106981519
+1.1378197789939481 1.9248367469837331 1.3545175594333883  0.13818785834076686 0.92488389215866984 0.35425118465944799
+1.1392917641443467 1.815235707638635 1.5621285844293009  0.1392430127504716 0.81541586445899106 0.5618793032215802
+0.47163878825454009 1.6834688675282172 1.5036911127293844  -0.52841879760671073 0.68370790823052197 0.50330613999724094
+0.66456827261077844 1.6940145438011469 1.6370473838366881  -0.33571718293160879 0.69398814937561715 0.6369257583193435
+0.53563503381027788 1.0699303480424984 1.8828787711788482  -0.4647686355560689 0.069884317336660604 0.88266998226615745
+0.65340002742402636 1.2724957718177858 1.8975603118185225  -0.3467276424095731 0.2722140518682809 0.89759648615318899
+1.2413678794555165 0.9321105690485505 1.9680560789191066  0.24117598392814818 -0.068303541004110763 0.9680747755533089
+1.1212211638374885 1.1332040076734393 1.9836473564126622  0.1214277150833757 0.13297103911780997 0.98365340072891549
+0.75863212054448437 0.9321105690485505 0.031943921080893056  -0.24117598392814793 -0.068303541004109389 -0.96807477555330901
+0.87877883616251229 1.1332040076734393 0.016352643587337568  -0.12142771508337222 0.1329710391178095 -0.98365340072891605
+0.3864614805142812 1.4604717807940109 0.35848910827666791  -0.61382359089386196 0.46011525660260205 -0.6414939983380098
+0.57848122801663848 1.4686357350626613 0.22366085201896579  -0.42177409750733397 0.46868822204941757 -0.77616877106981685
+0.86218022100605274 1.9248367469837333 0.64548244056661219  -0.13818785834076858 0.9248838921586704 -0.35425118465944572
+0.86070823585565392 1.8152357076386352 0.4378714155706992  -0.13924301275047188 0.81541586445899139 -0.56187930322157942
+1.5283612117454606 1.6834688675282172 0.49630888727061606  0.52841879760671129 0.68370790823052285 -0.50330613999723905
+1.335431727389222 1.6940145438011469 0.3629526161633122  0.33571718293160868 0.69398814937561693 -0.63692575831934384
+1.4643649661897227 1.0699303480424984 0.11712122882115183  0.46476863555606979 0.069884317336660118 -0.88266998226615712
+1.3465999725759743 1.2724957718177858 0.10243968818147775  0.34672764240957221 0.27221405186828318 -0.89759648615318866
+1.0699303480424984 0.11712122882115183 1.4643649661897227  0.069884317336659743 -0.88266998226615745 0.46476863555606923
+1.2724957718177858 0.10243968818147775 1.3465999725759745  0.27221405186828257 -0.89759648615318877 0.34672764240957232
+0.9321105690485505 0.031943921080893056 0.75863212054448437  -0.068303541004109278 -0.96807477555330901 -0.24117598392814815
+1.1332040076734393 0.016352643587337568 0.87877883616251229  0.13297103911780989 -0.98365340072891594 -0.12142771508337287
+1.4604717807940109 0.35848910827666791 0.38646148051428109  0.46011525660260194 -0.64149399833800969 -0.61382359089386218
+1.4686357350626613 0.22366085201896579 0.57848122801663837  0.46868822204941835 -0.77616877106981552 -0.42177409750733547
+1.9248367469837333 0.64548244056661219 0.86218022100605274  0.9248838921586704 -0.35425118465944577 -0.13818785834076816
+1.8152357076386352 0.4378714155706992 0.86070823585565392  0.8154158644589915 -0.56187930322157942 -0.13924301275047188
+1.6834688675282172 0.49630888727061606 1.5283612117454606  0.68370790823052241 -0.5033061399972395 0.52841879760671151
+1.6940145438011469 0.3629526161633122 1.335431727389222  0.69398814937561693 -0.63692575831934384 0.33571718293160868
+1.6415108917233321 1.6135385194857186 1.4604717807940111  0.64149399833800913 0.61382359089386218 0.46011525660260266
+1.7763391479810346 1.4215187719833615 1.4686357350626609  0.77616877106981519 0.42177409750733574 0.4686882220494189
+0.53563503381027777 0.93006965195750191 0.11712122882115172  -0.46476863555606868 -0.069884317336659479 -0.88266998226615778
+0.17583413883161547 0.44878045857535925 0.87541500307784514  -0.83926746233111538 -0.53130823737480382 -0.11550620576388627
+0.031943921080893389 1.2413678794555165 1.0678894309514502  -0.96807477555330868 0.24117598392814926 0.068303541004109306
+0.016352643587337568 1.1212211638374885 0.86679599232656146  -0.98365340072891605 0.12142771508337268 -0.13297103911780872
+0.64548244056661219 0.86218022100605274 1.9248367469837333  -0.35425118465944655 -0.13818785834076672 0.9248838921586704
+0.43787141557069909 0.86070823585565392 1.8152357076386352  -0.56187930322157953 -0.13924301275047185 0.8154158644589915
+0.31653113247178344 1.5036911127293846 1.5283612117454608  -0.68370790823052163 0.50330613999723994 0.52841879760671195
+0.30598545619885331 1.6370473838366881 1.335431727389222  -0.69398814937561626 0.63692575831934395 0.33571718293160996
+0.75863212054448415 1.0678894309514502 1.9680560789191068  -0.24117598392814935 0.068303541004109944 0.96807477555330868
+0.87877883616251218 0.86679599232656135 1.9836473564126624  -0.12142771508337401 -0.13297103911781055 0.98365340072891572
+1.5036911127293844 0.47163878825454009 1.6834688675282172  0.50330613999724028 -0.52841879760671029 0.68370790823052274
+1.6370473838366881 0.66456827261077844 1.6940145438011469  0.6369257583193435 -0.33571718293160879 0.69398814937561715
+1.3545175594333883 1.1378197789939481 1.9248367469837331  0.35425118465944705 0.13818785834076788 0.92488389215866984
+1.5621285844293009 1.1392917641443467 1.815235707638635  0.5618793032215792 0.13924301275047099 0.81541586445899183
+1.9248367469837331 1.3545175594333883 1.1378197789939481  0.92488389215867006 0.35425118465944716 0.13818785834076641
+1.815235707638635 1.5621285844293009 1.1392917641443467  0.81541586445899106 0.5618793032215802 0.1392430127504716
+1.4604717807940113 1.6415108917233316 1.6135385194857188  0.46011525660260288 0.64149399833800991 0.61382359089386129
+1.4686357350626609 1.7763391479810346 1.4215187719833615  0.46868822204941951 0.77616877106981519 0.42177409750733502
+1.0678894309514502 1.9680560789191066 0.75863212054448392  0.068303541004111568 0.9680747755533089 -0.24117598392814785
+0.86679599232656135 1.9836473564126624 0.87877883616251218  -0.13297103911780978 0.98365340072891594 -0.12142771508337255
+0.93006965195750202 1.8828787711788482 1.4643649661897225  -0.069884317336659313 0.88266998226615656 0.4647686355560709
+0.72750422818221505 1.8975603118185225 1.3465999725759743  -0.27221405186828301 0.89759648615318843 0.34672764240957316
+0.11712122882115183 1.4643649661897227 1.0699303480424984  -0.88266998226615745 0.46476863555606934 0.069884317336659701
+0.10243968818147775 1.3465999725759745 1.2724957718177858  -0.89759648615318877 0.34672764240957232 0.27221405186828257
+0.49630888727061606 1.5283612117454606 1.6834688675282172  -0.50330613999724017 0.52841879760671207 0.68370790823052141
+0.3629526161633122 1.335431727389222 1.6940145438011469  -0.6369257583193435 0.33571718293161068 0.69398814937561626
+0.3864614805142812 0.53952821920598926 1.6415108917233321  -0.61382359089386196 -0.46011525660260144 0.64149399833801024
+0.5784812280166387 0.53136426493733957 1.7763391479810346  -0.42177409750733463 -0.46868822204941818 0.77616877106981619
+1.5036911127293848 1.5283612117454606 0.31653113247178333  0.5033061399972405 0.52841879760671251 -0.68370790823052086
+1.6370473838366881 1.335431727389222 0.30598545619885331  0.63692575831934384 0.33571718293160879 -0.69398814937561693
+1.613538519485719 0.53952821920598926 0.35848910827666802  0.61382359089386251 -0.46011525660260244 -0.64149399833800902
+1.421518771983362 0.53136426493733913 0.22366085201896568  0.42177409750733486 -0.46868822204941879 -0.77616877106981574
+1.2413678794555163 1.0678894309514502 0.031943921080893389  0.24117598392814787 0.068303541004110027 -0.96807477555330901
+1.1212211638374885 0.86679599232656113 0.016352643587337568  0.12142771508337334 -0.13297103911780936 -0.98365340072891594
+0.15717574894030886 0.48126519958548875 0.86156266551879135  -0.83926746233111915 -0.53130823737479094 -0.11550620576391649
+0.85145286645038376 0.14564781357706019 0.50275426427774228  -0.18463389628076177 -0.84903903628469379 -0.49501822108781335
+0.64548244056661241 1.1378197789939481 0.075163253016266696  -0.35425118465944572 0.1381878583407696 -0.92488389215867017
+0.43787141557069942 1.1392917641443465 0.18476429236136482  -0.56187930322157997 0.13924301275047202 -0.81541586445899095
+0.075163253016266807 1.3545175594333883 0.86218022100605274  -0.92488389215867006 0.35425118465944622 -0.13818785834076866
+0.18476429236136493 1.5621285844293009 0.86070823585565404  -0.81541586445899084 0.56187930322158064 -0.13924301275047107
+0.53952821920598926 1.6415108917233321 0.3864614805142812  -0.46011525660260083 0.64149399833801002 -0.61382359089386263
+0.53136426493733957 1.7763391479810346 0.5784812280166387  -0.46868822204941873 0.77616877106981597 -0.42177409750733447
+0.9321105690485505 1.9680560789191066 1.2413678794555165  -0.068303541004110763 0.9680747755533089 0.24117598392814818
+1.1332040076734391 1.9836473564126622 1.1212211638374885  0.13297103911780886 0.98365340072891583 0.1214277150833741
+1.0699303480424984 1.8828787711788482 0.53563503381027788  0.069884317336660604 0.88266998226615756 -0.46476863555606895
+1.2724957718177858 1.8975603118185225 0.65340002742402592  0.27221405186828351 0.89759648615318866 -0.34672764240957199
+1.8828787711788482 1.4643649661897225 0.93006965195750202  0.88266998226615645 0.4647686355560709 -0.069884317336659341
+1.8975603118185225 1.3465999725759743 0.72750422818221505  0.89759648615318843 0.34672764240957316 -0.27221405186828301
+1.8828787711788482 0.53563503381027788 1.0699303480424984  0.88266998226615767 -0.46476863555606868 0.069884317336660798
+1.8975603118185225 0.65340002742402636 1.2724957718177858  0.89759648615318977 -0.34672764240957188 0.27221405186828018
+1.4643649661897225 0.93006965195750202 1.8828787711788482  0.46476863555607095 -0.069884317336659341 0.88266998226615656
+1.3465999725759743 0.72750422818221505 1.8975603118185225  0.34672764240957316 -0.27221405186828301 0.89759648615318843
+1.5283612117454606 0.31653113247178333 1.5036911127293848  0.5284187976067124 -0.68370790823052108 0.50330613999724028
+1.335431727389222 0.30598545619885331 1.6370473838366881  0.33571718293160879 -0.69398814937561693 0.63692575831934384
+0.53952821920598926 0.35848910827666802 1.613538519485719  -0.46011525660260294 -0.64149399833800935 0.61382359089386185
+0.53136426493733913 0.22366085201896568 1.421518771983362  -0.46868822204941873 -0.77616877106981563 0.4217740975073348
+1.0678894309514502 0.031943921080893389 1.2413678794555163  0.06830354100410925 -0.96807477555330868 0.24117598392814921
+0.86679599232656146 0.016352643587337568 1.1212211638374885  -0.13297103911780872 -0.98365340072891605 0.12142771508337268
+0.56789366986248413 0.81389356246462441 0.11874744154864894  -0.42585755017737392 -0.18423339416733742 -0.88583486239282094
+0.74644278217951743 0.096124922711889466 0.65746189559341328  -0.22824258748330262 -0.90894237800239763 -0.34889693998410698
+1.1378197789939481 0.075163253016266696 0.64548244056661241  0.13818785834076924 -0.92488389215866995 -0.35425118465944633
+1.1392917641443465 0.18476429236136482 0.43787141557069942  0.13924301275047202 -0.81541586445899095 -0.56187930322157997
+1.3545175594333883 0.86218022100605274 0.075163253016266807  0.35425118465944599 -0.13818785834077008 -0.92488389215866995
+1.5621285844293009 0.86070823585565404 0.18476429236136482  0.56187930322158064 -0.1392430127504711 -0.81541586445899084
+1.6415108917233321 0.3864614805142812 0.53952821920598926  0.64149399833801024 -0.61382359089386196 -0.46011525660260144
+1.7763391479810346 0.5784812280166387 0.53136426493733957  0.77616877106981585 -0.42177409750733486 -0.46868822204941835
+1.9680560789191066 1.2413678794555165 0.9321105690485505  0.9680747755533089 0.24117598392814818 -0.068303541004110763
+1.9836473564126622 1.1212211638374885 1.1332040076734393  0.98365340072891549 0.1214277150833757 0.13297103911780997
+1.9680560789191066 0.75863212054448415 1.0678894309514502  0.96807477555330879 -0.24117598392814829 0.06830354100411086
+1.9836473564126624 0.87877883616251218 0.86679599232656135  0.98365340072891572 -0.12142771508337397 -0.13297103911781066
+1.6834688675282172 1.5036911127293844 0.47163878825454009  0.68370790823052274 0.50330613999724028 -0.52841879760671029
+1.6940145438011469 1.6370473838366881 0.66456827261077844  0.69398814937561726 0.6369257583193435 -0.33571718293160879
+0.93006965195750191 0.11712122882115172 0.53563503381027777  -0.069884317336659479 -0.88266998226615778 -0.46476863555606868
+0.77156308049914157 0.10155294642477924 0.62688758712066828  -0.22824258748330201 -0.90894237800239752 -0.34889693998410765
+0.11712122882115172 0.53563503381027777 0.93006965195750191  -0.88266998226615778 -0.46476863555606868 -0.069884317336659466
+0.90494753379947435 0.26218372058148803 0.33295004022963903  -0.091975091050970403 -0.72651404777911677 -0.68096837004795541
+0.90687073458352596 0.28910030252843322 0.30397342055421106  -0.091975091050969376 -0.72651404777911188 -0.68096837004796074
+0.87541500307784514 0.17583413883161553 0.44878045857535925  -0.11550620576389015 -0.83926746233111826 -0.53130823737479815
+0.35848910827666802 0.3864614805142812 1.4604717807940109  -0.64149399833800957 -0.61382359089386229 0.46011525660260189
+0.22366085201896579 0.57848122801663837 1.4686357350626613  -0.77616877106981552 -0.42177409750733547 0.46868822204941835
+0.075163253016266807 0.64548244056661219 1.1378197789939481  -0.92488389215867006 -0.35425118465944611 0.13818785834076958
+0.18476429236136482 0.43787141557069942 1.1392917641443465  -0.81541586445899095 -0.56187930322157997 0.13924301275047202
+0.86218022100605274 0.075163253016266807 1.3545175594333883  -0.13818785834077008 -0.92488389215866995 0.35425118465944599
+0.86070823585565404 0.18476429236136493 1.5621285844293009  -0.13924301275047107 -0.81541586445899084 0.56187930322158064
+0.35848910827666813 1.613538519485719 0.53952821920598937  -0.64149399833800946 0.61382359089386185 -0.4601152566026025
+0.22366085201896579 1.4215187719833617 0.53136426493733901  -0.77616877106981574 0.42177409750733497 -0.4686882220494184
+0.031943921080893167 0.75863212054448415 0.9321105690485505  -0.9680747755533089 -0.24117598392814821 -0.068303541004108889
+0.016352643587337568 0.87877883616251229 1.1332040076734393  -0.98365340072891594 -0.12142771508337287 0.13297103911780989
+1.0616533189164057 1.5950160035539049 1.8013456331579596  0.062410317894398326 0.59583045652862732 0.80068159669946692
+1.2133191789074431 1.4533759437953908 1.8654161897595243  0.2140314567980553 0.45308829251399929 0.86539097215515881
+1.2413678794555163 1.0678894309514497 1.9680560789191066  0.24117598392814793 0.068303541004110568 0.9680747755533089
+1.3465999725759743 1.2724957718177854 1.8975603118185225  0.34672764240957316 0.27221405186828523 0.89759648615318766
+0.93834668108359465 1.5950160035539049 1.8013456331579598  -0.062410317894397521 0.59583045652862732 0.80068159669946692
+1.1318385030170197 1.6666951227028342 1.7335776867425046  0.1322787149628544 0.66711974931205453 0.73311225719230577
+1.5036911127293844 1.5283612117454601 1.683468867528217  0.50330613999724128 0.52841879760671084 0.68370790823052163
+1.335431727389222 1.6940145438011469 1.6370473838366881  0.33571718293160741 0.69398814937561792 0.63692575831934339
+0.9002428344740192 1.4952588380279237 1.8629989520743653  -0.10098201560182218 0.49484844092680796 0.86309191459386347
+0.86816149698298051 1.6666951227028339 1.7335776867425046  -0.13227871496285329 0.66711974931205487 0.73311225719230577
+1.0699303480424984 1.8828787711788482 1.4643649661897227  0.069884317336660284 0.88266998226615667 0.46476863555607056
+0.86070823585565392 1.8152357076386347 1.5621285844293014  -0.13924301275046991 0.81541586445898995 0.56187930322158208
+1.0000000000000002 1.4336055191115187 1.9011027986839406  0 0.4324381230324067 0.901663612301289
+0.78668082109255699 1.453375943795391 1.8654161897595243  -0.21403145679805691 0.45308829251399974 0.86539097215515826
+0.53952821920598959 1.6415108917233323 1.6135385194857188  -0.46011525660260089 0.64149399833800969 0.61382359089386296
+0.57848122801663893 1.4686357350626611 1.7763391479810344  -0.42177409750733436 0.46868822204941818 0.77616877106981641
+1.099757165525981 1.4952588380279241 1.8629989520743653  0.10098201560182252 0.4948484409268068 0.86309191459386403
+1 1.3215374407783715 1.9468968656499477  0 0.32080957755114675 0.94714371399036101
+0.6454824405666123 1.1378197789939481 1.9248367469837333  -0.35425118465944627 0.13818785834077046 0.92488389215866984
+0.87877883616251218 1.1332040076734395 1.9836473564126624  -0.12142771508337412 0.132971039117811 0.98365340072891561
+0.9002428344740192 1.4952588380279244 0.13700104792563483  -0.1009820156018217 0.49484844092680591 -0.86309191459386458
+1.0000000000000002 1.3215374407783713 0.053103134350052095  0 0.32080957755114586 -0.94714371399036135
+1.354517559433388 1.1378197789939481 0.075163253016267029  0.35425118465944716 0.13818785834076946 -0.92488389215866962
+1.1212211638374883 1.1332040076734395 0.01635264358733779  0.12142771508337433 0.13297103911781027 -0.98365340072891572
+0.93834668108359476 1.5950160035539049 0.19865436684204019  -0.062410317894396827 0.59583045652862898 -0.8006815966994657
+0.78668082109255688 1.453375943795391 0.13458381024047572  -0.21403145679805741 0.45308829251400018 -0.86539097215515792
+0.75863212054448437 1.0678894309514497 0.031943921080893056  -0.24117598392814799 0.068303541004109902 -0.96807477555330901
+0.65340002742402614 1.2724957718177854 0.10243968818147742  -0.34672764240957199 0.27221405186828196 -0.8975964861531891
+1.0616533189164057 1.5950160035539047 0.19865436684204019  0.062410317894397195 0.59583045652862876 -0.80068159669946581
+0.86816149698298051 1.6666951227028342 0.26642231325749555  -0.13227871496285282 0.66711974931205509 -0.73311225719230555
+0.49630888727061584 1.5283612117454606 0.31653113247178299  -0.50330613999724039 0.52841879760671184 -0.68370790823052141
+0.66456827261077822 1.6940145438011469 0.36295261616331187  -0.33571718293160935 0.69398814937561759 -0.63692575831934273
+1.0997571655259812 1.4952588380279237 0.13700104792563461  0.10098201560182198 0.49484844092680536 -0.86309191459386492
+1.1318385030170197 1.6666951227028342 0.26642231325749555  0.13227871496285309 0.66711974931205587 -0.73311225719230488
+0.93006965195750224 1.8828787711788482 0.53563503381027777  -0.06988431733666034 0.88266998226615723 -0.46476863555606956
+1.1392917641443463 1.8152357076386352 0.4378714155706992  0.13924301275047238 0.81541586445899106 -0.56187930322157997
+1 1.4336055191115187 0.09889720131605928  0 0.43243812303240753 -0.90166361230128855
+1.2133191789074438 1.453375943795391 0.13458381024047594  0.2140314567980566 0.45308829251399907 -0.8653909721551587
+1.4604717807940109 1.6415108917233325 0.38646148051428153  0.46011525660260216 0.64149399833800946 -0.61382359089386218
+1.421518771983362 1.4686357350626613 0.22366085201896613  0.42177409750733463 0.46868822204941818 -0.77616877106981619
+1.4336055191115187 0.09889720131605928 1  0.43243812303240753 -0.90166361230128855 0
+1.4533759437953913 0.13458381024047605 1.2133191789074438  0.45308829251399851 -0.86539097215515892 0.21403145679805666
+1.6415108917233325 0.38646148051428153 1.4604717807940109  0.64149399833800946 -0.61382359089386218 0.46011525660260216
+1.4686357350626613 0.22366085201896613 1.421518771983362  0.46868822204941873 -0.77616877106981541 0.42177409750733547
+1.4952588380279244 0.13700104792563483 0.9002428344740192  0.49484844092680524 -0.86309191459386503 -0.10098201560182191
+1.3215374407783713 0.053103134350052095 1.0000000000000002  0.32080957755114586 -0.94714371399036135 0
+1.1378197789939481 0.075163253016267029 1.3545175594333883  0.13818785834076808 -0.92488389215866973 0.35425118465944749
+1.1332040076734395 0.01635264358733779 1.1212211638374883  0.13297103911781027 -0.98365340072891572 0.12142771508337433
+1.5950160035539049 0.19865436684204019 0.93834668108359476  0.59583045652862876 -0.8006815966994657 -0.062410317894398201
+1.453375943795391 0.13458381024047572 0.78668082109255688  0.45308829251399974 -0.86539097215515837 -0.21403145679805646
+1.0678894309514497 0.031943921080893056 0.75863212054448437  0.068303541004109125 -0.96807477555330901 -0.24117598392814799
+1.2724957718177854 0.10243968818147742 0.65340002742402614  0.27221405186828196 -0.8975964861531891 -0.34672764240957199
+1.5950160035539052 0.19865436684204041 1.0616533189164057  0.59583045652862876 -0.8006815966994657 0.062410317894398298
+1.6666951227028344 0.26642231325749555 0.86816149698298051  0.66711974931205509 -0.73311225719230555 -0.13227871496285284
+1.5283612117454606 0.31653113247178311 0.49630888727061584  0.52841879760671173 -0.68370790823052119 -0.50330613999724083
+1.6940145438011469 0.36295261616331198 0.66456827261077822  0.69398814937561826 -0.63692575831934217 -0.33571718293160913
+1.4952588380279237 0.13700104792563472 1.0997571655259812  0.49484844092680469 -0.86309191459386525 0.10098201560182217
+1.6666951227028342 0.26642231325749555 1.1318385030170197  0.6671197493120562 -0.73311225719230466 0.13227871496285293
+1.8828787711788482 0.53563503381027777 0.93006965195750224  0.88266998226615723 -0.46476863555606956 -0.06988431733666034
+1.8152357076386352 0.4378714155706992 1.1392917641443463  0.81541586445899106 -0.56187930322157997 0.13924301275047238
+1.8013456331579596 1.0616533189164057 1.5950160035539049  0.80068159669946681 0.062410317894399416 0.59583045652862721
+1.8654161897595243 1.2133191789074431 1.4533759437953908  0.86539097215515892 0.21403145679805533 0.45308829251399935
+1.9680560789191066 1.2413678794555163 1.0678894309514497  0.96807477555330868 0.24117598392814929 0.068303541004109777
+1.8975603118185225 1.3465999725759743 1.2724957718177854  0.89759648615318766 0.34672764240957316 0.27221405186828523
+1.0000000000000002 0.56639448088848177 0.098897201316059169  1.967631691996596e-16 -0.43243812303240659 -0.901663612301289
+0.86156266551879135 0.15717574894030889 0.48126519958548886  -0.11550620576386515 -0.8392674623311237 -0.53130823737479504
+0.39229183849441457 0.893825128737608 0.21405999957086966  -0.59478368364253276 -0.11477033531296195 -0.79565076497466514
+0.41582096722616779 0.88692657891222382 0.1974660445788706  -0.59478368364253731 -0.11477033531295863 -0.79565076497466225
+0.13700104792563472 1.0997571655259812 0.50474116197207608  -0.86309191459386503 0.1009820156018227 -0.49484844092680508
+0.053103134350052095 1 0.67846255922162868  -0.94714371399036146 1.0591425737136428e-15 -0.32080957755114559
+0.075163253016266696 0.6454824405666123 0.86218022100605241  -0.92488389215867006 -0.35425118465944672 -0.13818785834076835
+0.016352643587337568 0.87877883616251229 0.86679599232656124  -0.98365340072891594 -0.12142771508337288 -0.13297103911780972
+0.19865436684204008 1.0616533189164057 1.5950160035539049  -0.80068159669946581 0.062410317894396806 0.59583045652862887
+0.26642231325749555 0.86816149698298051 1.6666951227028344  -0.73311225719230444 -0.1322787149628539 0.66711974931205609
+0.31653113247178311 0.49630888727061584 1.5283612117454606  -0.68370790823052119 -0.50330613999724083 0.52841879760671184
+0.36295261616331187 0.66456827261077822 1.6940145438011469  -0.63692575831934228 -0.33571718293160913 0.69398814937561815
+0.5047411619720763 1.8629989520743653 1.0997571655259812  -0.49484844092680508 0.86309191459386525 0.10098201560182087
+0.33330487729716596 1.7335776867425046 1.1318385030170197  -0.66711974931205509 0.73311225719230555 0.13227871496285298
+0.11712122882115195 1.4643649661897229 0.93006965195750224  -0.88266998226615712 0.46476863555606984 -0.069884317336658758
+0.18476429236136516 1.5621285844293014 1.1392917641443463  -0.81541586445899072 0.56187930322158075 0.13924301275047096
+0.9002428344740192 0.50474116197207619 1.8629989520743653  -0.10098201560182128 -0.49484844092680597 0.86309191459386458
+1.0000000000000002 0.67846255922162868 1.9468968656499477  -7.9435693028522569e-16 -0.32080957755114653 0.94714371399036112
+1.3545175594333883 0.86218022100605252 1.9248367469837331  0.35425118465944705 -0.13818785834076738 0.92488389215867006
+1.1212211638374883 0.86679599232656113 1.9836473564126624  0.12142771508337551 -0.13297103911780989 0.98365340072891561
+1.8629989520743653 0.9002428344740192 1.4952588380279237  0.86309191459386403 -0.10098201560182096 0.49484844092680702
+1.7335776867425046 0.86816149698298051 1.6666951227028339  0.73311225719230566 -0.13227871496285556 0.66711974931205442
+1.4643649661897227 1.0699303480424984 1.8828787711788482  0.46476863555607134 0.069884317336659812 0.88266998226615634
+1.5621285844293014 0.86070823585565392 1.8152357076386347  0.56187930322158197 -0.13924301275047204 0.81541586445898973
+1.8013456331579594 0.93834668108359476 1.5950160035539054  0.80068159669946681 -0.062410317894398784 0.59583045652862732
+1.7335776867425046 1.1318385030170197 1.6666951227028342  0.73311225719230577 0.1322787149628544 0.66711974931205453
+1.6834688675282168 1.5036911127293844 1.5283612117454606  0.68370790823052341 0.50330613999723939 0.52841879760671029
+1.6370473838366881 1.335431727389222 1.6940145438011469  0.63692575831934328 0.33571718293160902 0.69398814937561737
+1.5950160035539054 1.8013456331579594 0.93834668108359476  0.59583045652862743 0.8006815966994667 -0.062410317894398784
+1.6666951227028342 1.7335776867425046 1.1318385030170197  0.6671197493120552 0.73311225719230533 0.13227871496285365
+1.5283612117454601 1.683468867528217 1.5036911127293844  0.52841879760671184 0.68370790823052141 0.5033061399972405
+1.6940145438011469 1.6370473838366881 1.335431727389222  0.69398814937561792 0.63692575831934339 0.33571718293160741
+1.5950160035539049 1.8013456331579596 1.0616533189164057  0.59583045652862765 0.80068159669946648 0.062410317894398423
+1.4533759437953908 1.8654161897595243 1.2133191789074431  0.45308829251399935 0.86539097215515892 0.21403145679805533
+1.0678894309514497 1.9680560789191066 1.2413678794555163  0.068303541004109777 0.96807477555330868 0.24117598392814929
+1.2724957718177854 1.8975603118185225 1.3465999725759743  0.2722140518682829 0.89759648615318921 0.34672764240957116
+0.50474116197207619 1.8629989520743653 0.9002428344740192  -0.49484844092680574 0.86309191459386481 -0.10098201560182095
+0.67846255922162868 1.9468968656499477 1.0000000000000002  -0.32080957755114653 0.94714371399036112 -7.9435693028522224e-16
+0.86218022100605252 1.9248367469837331 1.3545175594333883  -0.13818785834076738 0.92488389215866995 0.35425118465944699
+0.86679599232656124 1.9836473564126624 1.1212211638374883  -0.13297103911780894 0.98365340072891583 0.12142771508337413
+0.56639448088848177 1.9011027986839408 1  -0.43243812303240775 0.90166361230128844 -8.689430092271666e-16
+0.54662405620460952 1.8654161897595243 1.2133191789074438  -0.45308829251399796 0.86539097215515903 0.21403145679805741
+0.35848910827666824 1.613538519485719 1.4604717807940111  -0.64149399833800924 0.6138235908938624 0.46011525660260216
+0.53136426493733957 1.7763391479810346 1.4215187719833617  -0.46868822204941807 0.77616877106981552 0.42177409750733597
+0.09889720131605928 1 1.4336055191115187  -0.90166361230128855 0 0.43243812303240753
+0.13458381024047605 1.2133191789074438 1.4533759437953913  -0.86539097215515892 0.21403145679805666 0.45308829251399851
+0.38646148051428164 1.4604717807940109 1.6415108917233323  -0.61382359089386207 0.46011525660260139 0.64149399833801013
+0.22366085201896613 1.421518771983362 1.4686357350626613  -0.7761687710698153 0.42177409750733597 0.46868822204941829
+0.13700104792563472 1.0997571655259812 1.4952588380279237  -0.86309191459386525 0.10098201560182217 0.49484844092680474
+0.26642231325749555 1.1318385030170197 1.6666951227028342  -0.73311225719230466 0.13227871496285293 0.6671197493120562
+0.53563503381027777 0.93006965195750224 1.8828787711788482  -0.46476863555606912 -0.069884317336660631 0.88266998226615745
+0.4378714155706992 1.1392917641443463 1.8152357076386352  -0.56187930322157997 0.13924301275047238 0.81541586445899106
+0.93834668108359465 0.40498399644609495 1.8013456331579598  -0.062410317894398194 -0.59583045652862798 0.80068159669946637
+0.78668082109255699 0.54662405620460941 1.8654161897595245  -0.21403145679805616 -0.4530882925139979 0.86539097215515937
+0.75863212054448437 0.93211056904855083 1.9680560789191071  -0.24117598392814946 -0.068303541004109611 0.96807477555330868
+0.65340002742402614 0.72750422818221505 1.8975603118185227  -0.34672764240957199 -0.27221405186828279 0.89759648615318888
+1.8629989520743653 1.0997571655259812 0.5047411619720763  0.86309191459386447 0.10098201560182143 -0.49484844092680624
+1.7335776867425046 1.1318385030170197 0.33330487729716596  0.73311225719230644 0.13227871496285357 -0.66711974931205398
+1.4643649661897227 0.93006965195750224 0.11712122882115183  0.46476863555606984 -0.069884317336658786 -0.88266998226615712
+1.5621285844293009 1.1392917641443463 0.18476429236136493  0.56187930322158008 0.13924301275047107 -0.81541586445899128
+1.0616533189164057 0.40498399644609517 0.19865436684204019  0.062410317894399089 -0.59583045652862909 -0.80068159669946548
+1.2133191789074433 0.54662405620460941 0.13458381024047572  0.21403145679805635 -0.4530882925139984 -0.86539097215515914
+1.2413678794555163 0.93211056904855083 0.031943921080893167  0.24117598392814768 -0.068303541004110069 -0.96807477555330901
+1.3465999725759745 0.72750422818221494 0.10243968818147742  0.34672764240957282 -0.2722140518682819 -0.89759648615318888
+1.0997571655259812 0.50474116197207608 0.13700104792563472  0.10098201560182246 -0.49484844092680491 -0.86309191459386514
+1 0.67846255922162868 0.053103134350052095  1.1189552832304316e-16 -0.32080957755114614 -0.94714371399036124
+0.64548244056661241 0.86218022100605241 0.075163253016266696  -0.35425118465944616 -0.13818785834076958 -0.92488389215867006
+0.87877883616251229 0.86679599232656113 0.016352643587337568  -0.12142771508337286 -0.13297103911780978 -0.98365340072891594
+0.13700104792563472 0.9002428344740192 0.50474116197207619  -0.86309191459385659 -0.10098201560181821 -0.49484844092682057
+0.35660859546245854 0.90157505838463314 0.24184951424973428  -0.65387638494521683 -0.11348698498785796 -0.74804169499389572
+0.53563503381027766 1.0699303480424984 0.11712122882115172  -0.46476863555606851 0.069884317336659452 -0.88266998226615789
+0.55521070025011254 0.82226795238624728 0.12310298935169575  -0.83361988814006172 0.15282936104498174 -0.53077402771794857
+0.19865436684204019 0.93834668108359476 0.40498399644609495  -0.80068159669946903 -0.062410317894398964 -0.59583045652862432
+0.26642231325749555 1.1318385030170197 0.33330487729716562  -0.73311225719230511 0.13227871496285284 -0.66711974931205564
+0.31653113247178322 1.5036911127293848 0.47163878825453964  -0.68370790823052086 0.50330613999724183 -0.52841879760671129
+0.36295261616331198 1.335431727389222 0.30598545619885309  -0.63692575831934384 0.3357171829316084 -0.69398814937561704
+0.40498399644609528 1.8013456331579598 1.0616533189164057  -0.59583045652862843 0.80068159669946615 0.062410317894396293
+0.33330487729716574 1.7335776867425046 0.86816149698298051  -0.6671197493120562 0.73311225719230444 -0.13227871496285309
+0.47163878825453998 1.6834688675282172 0.49630888727061595  -0.52841879760671129 0.68370790823052163 -0.50330613999724094
+0.30598545619885309 1.6370473838366881 0.66456827261077822  -0.69398814937561759 0.6369257583193435 -0.33571718293160813
+0.40498399644609495 1.8013456331579598 0.93834668108359465  -0.59583045652862776 0.80068159669946659 -0.062410317894396786
+0.54662405620460952 1.8654161897595243 0.78668082109255688  -0.45308829251399785 0.86539097215515937 -0.2140314567980563
+0.93211056904855083 1.9680560789191068 0.75863212054448415  -0.068303541004110235 0.96807477555330868 -0.24117598392814935
+0.72750422818221505 1.8975603118185227 0.65340002742402614  -0.27221405186828113 0.89759648615318932 -0.3467276424095721
+1.4952588380279241 1.8629989520743653 1.099757165525981  0.49484844092680591 0.8630919145938647 0.1009820156018213
+1.3215374407783715 1.9468968656499477 1  0.32080957755114636 0.94714371399036112 -3.9056046362122319e-16
+1.1378197789939481 1.9248367469837331 0.64548244056661219  0.13818785834077008 0.92488389215866995 -0.35425118465944616
+1.1332040076734395 1.9836473564126622 0.87877883616251196  0.13297103911780914 0.98365340072891583 -0.1214277150833743
+1.4336055191115187 1.9011027986839406 1.0000000000000002  0.43243812303240886 0.90166361230128789 0
+1.453375943795391 1.8654161897595241 0.78668082109255688  0.45308829251400068 0.86539097215515781 -0.2140314567980568
+1.6415108917233319 1.613538519485719 0.53952821920598937  0.64149399833801002 0.6138235908938634 -0.46011525660259989
+1.4686357350626613 1.7763391479810342 0.5784812280166387  0.46868822204941918 0.77616877106981508 -0.42177409750733541
+1.9011027986839408 1 0.56639448088848177  0.90166361230128866 -1.2527504869364849e-15 -0.43243812303240708
+1.8654161897595243 1.2133191789074438 0.54662405620460952  0.86539097215515903 0.21403145679805741 -0.45308829251399796
+1.613538519485719 1.4604717807940111 0.35848910827666824  0.6138235908938624 0.46011525660260194 -0.64149399833800957
+1.7763391479810346 1.4215187719833617 0.53136426493733957  0.77616877106981552 0.42177409750733597 -0.46868822204941807
+1.9011027986839406 1.0000000000000002 1.4336055191115187  0.90166361230128855 -1.4477442699732785e-15 0.43243812303240742
+1.8654161897595243 0.78668082109255699 1.453375943795391  0.86539097215515814 -0.21403145679805691 0.45308829251399968
+1.613538519485719 0.53952821920598937 1.6415108917233319  0.6138235908938634 -0.46011525660259978 0.64149399833800991
+1.7763391479810344 0.57848122801663893 1.4686357350626611  0.7761687710698163 -0.4217740975073343 0.46868822204941812
+1 0.56639448088848177 1.9011027986839408  -1.2527504869364849e-15 -0.43243812303240708 0.90166361230128866
+1.2133191789074438 0.54662405620460952 1.8654161897595243  0.21403145679805741 -0.45308829251399796 0.86539097215515903
+1.4604717807940111 0.35848910827666824 1.613538519485719  0.46011525660260189 -0.64149399833800946 0.6138235908938624
+1.4215187719833617 0.53136426493733957 1.7763391479810346  0.42177409750733597 -0.46868822204941807 0.77616877106981552
+1.0997571655259812 0.50474116197207619 1.8629989520743653  0.10098201560182141 -0.49484844092680619 0.86309191459386447
+1.1318385030170197 0.33330487729716596 1.7335776867425046  0.13227871496285284 -0.66711974931205531 0.73311225719230533
+0.93006965195750224 0.11712122882115183 1.4643649661897227  -0.069884317336658786 -0.88266998226615712 0.46476863555606984
+1.1392917641443463 0.18476429236136493 1.5621285844293009  0.13924301275047143 -0.81541586445899072 0.56187930322158053
+0.40498399644609517 0.19865436684204019 1.0616533189164057  -0.59583045652862809 -0.80068159669946615 0.062410317894399513
+0.5466240562046093 0.13458381024047572 1.2133191789074433  -0.4530882925139989 -0.8653909721551587 0.21403145679805652
+0.93211056904855083 0.031943921080893167 1.2413678794555163  -0.068303541004110055 -0.96807477555330901 0.24117598392814768
+0.72750422818221494 0.10243968818147742 1.3465999725759745  -0.2722140518682819 -0.89759648615318888 0.34672764240957282
+0.50474116197207608 0.13700104792563472 1.0997571655259812  -0.49484844092680558 -0.86309191459386481 0.10098201560182224
+0.67846255922162868 0.053103134350052095 1  -0.32080957755114559 -0.94714371399036146 1.0591425737136428e-15
+0.86218022100605241 0.075163253016266696 0.64548244056661241  -0.13818785834076858 -0.92488389215867017 -0.35425118465944616
+0.86679599232656124 0.016352643587337568 0.87877883616251229  -0.13297103911780972 -0.98365340072891594 -0.12142771508337288
+0.9002428344740192 0.50474116197207608 0.13700104792563472  -0.1009820156018221 -0.49484844092680447 -0.86309191459386547
+0.5423386494351099 0.82968743367193953 0.12850859076870802  -0.46036815782147283 -0.16290466567087261 -0.87265298324518714
+1.0699303480424984 0.11712122882115172 0.53563503381027766  0.069884317336659438 -0.88266998226615778 -0.46476863555606845
+0.82226795238624728 0.12310298935169575 0.55521070025011254  0.15282936104498174 -0.53077402771794857 -0.83361988814006172
+0.93834668108359476 0.40498399644609495 0.19865436684204019  -0.062410317894401025 -0.59583045652862499 -0.80068159669946837
+1.1318385030170197 0.33330487729716562 0.26642231325749555  0.13227871496285284 -0.66711974931205564 -0.73311225719230511
+1.5036911127293848 0.47163878825453998 0.31653113247178311  0.50330613999724105 -0.52841879760671151 -0.6837079082305213
+1.335431727389222 0.30598545619885309 0.36295261616331198  0.3357171829316084 -0.69398814937561704 -0.63692575831934384
+1.8013456331579596 1.0616533189164057 0.40498399644609495  0.80068159669946637 0.06241031789439988 -0.59583045652862787
+1.7335776867425046 0.86816149698298051 0.33330487729716574  0.73311225719230455 -0.13227871496285257 -0.66711974931205631
+1.6834688675282172 0.49630888727061595 0.47163878825453998  0.68370790823052152 -0.50330613999724094 -0.52841879760671129
+1.6370473838366881 0.66456827261077822 0.30598545619885309  0.6369257583193435 -0.33571718293160813 -0.69398814937561759
+1.8013456331579598 0.93834668108359465 0.40498399644609495  0.80068159669946637 -0.062410317894398194 -0.59583045652862798
+1.8654161897595245 0.78668082109255699 0.54662405620460941  0.86539097215515937 -0.21403145679805616 -0.4530882925139979
+1.9680560789191071 0.75863212054448437 0.93211056904855083  0.96807477555330868 -0.24117598392814929 -0.068303541004109763
+1.8975603118185227 0.65340002742402614 0.72750422818221505  0.89759648615318932 -0.34672764240957188 -0.27221405186828146
+1.8629989520743653 1.099757165525981 1.4952588380279241  0.86309191459386403 0.10098201560182252 0.4948484409268068
+1.9468968656499477 1 1.3215374407783715  0.94714371399036101 0 0.32080957755114675
+1.9248367469837333 0.6454824405666123 1.1378197789939481  0.92488389215866995 -0.35425118465944644 0.13818785834076994
+1.9836473564126624 0.87877883616251229 1.1332040076734395  0.98365340072891561 -0.12142771508337535 0.13297103911781
+1.8629989520743653 0.9002428344740192 0.50474116197207619  0.86309191459386458 -0.10098201560182128 -0.49484844092680597
+1.9468968656499477 1.0000000000000002 0.67846255922162868  0.94714371399036112 -7.9435693028522569e-16 -0.32080957755114653
+1.9248367469837331 1.3545175594333883 0.86218022100605252  0.92488389215866995 0.35425118465944699 -0.13818785834076738
+1.9836473564126624 1.1212211638374883 0.86679599232656124  0.98365340072891561 0.12142771508337551 -0.1329710391178098
+1.4952588380279237 1.8629989520743653 0.9002428344740192  0.49484844092680708 0.86309191459386414 -0.10098201560182099
+1.6666951227028339 1.7335776867425046 0.86816149698298051  0.66711974931205476 0.73311225719230577 -0.13227871496285329
+1.8828787711788482 1.4643649661897227 1.0699303480424984  0.88266998226615634 0.46476863555607129 0.069884317336659799
+1.8152357076386347 1.5621285844293014 0.86070823585565392  0.81541586445898973 0.56187930322158197 -0.13924301275047204
+0.56639448088848177 0.098897201316059169 1.0000000000000002  -0.43243812303240714 -0.90166361230128866 1.1585906789695613e-15
+0.82968743367193953 0.12850859076870802 0.5423386494351099  -0.16290466567087261 -0.87265298324518714 -0.46036815782147283
+0.50275426427774228 0.85145286645038376 0.14564781357706019  -0.49501822108782007 -0.18463389628076027 -0.84903903628469024
+0.44478929974988757 0.17773204761375261 0.87689701064830428  -0.49123021957364593 -0.85333806289874636 -0.17466259412319191
+0.098897201316059169 1.0000000000000002 0.56639448088848177  -0.90166361230128889 1.1585906789695613e-15 -0.43243812303240675
+0.88692657891222382 0.1974660445788706 0.41582096722616779  -0.11477033531295829 -0.79565076497466325 -0.59478368364253609
+0.893825128737608 0.21405999957086963 0.39229183849441451  -0.11477033531296192 -0.79565076497466702 -0.59478368364253043
+0.48126519958548886 0.86156266551879135 0.15717574894030889  -0.53130823737479427 -0.11550620576389276 -0.83926746233112037
+0.50474116197207608 0.13700104792563472 0.9002428344740192  -0.4948484409268048 -0.86309191459386525 -0.10098201560182263
+0.44878045857535931 0.87541500307784514 0.17583413883161553  -0.5313082373747976 -0.11550620576389102 -0.8392674623311186
+0.11712122882115172 0.53563503381027766 1.0699303480424984  -0.88266998226615778 -0.46476863555606851 0.069884317336659466
+0.89148810692249181 0.40180685413975104 0.20692923660476614  -0.10210073274615528 -0.58661618171386176 -0.80340332070769271
+0.19865436684204019 0.93834668108359476 1.5950160035539049  -0.8006815966994657 -0.062410317894396827 0.59583045652862898
+0.13458381024047572 0.78668082109255688 1.453375943795391  -0.86539097215515859 -0.21403145679805591 0.45308829251399935
+0.031943921080893056 0.75863212054448437 1.0678894309514497  -0.96807477555330901 -0.24117598392814799 0.06830354100410968
+0.10243968818147742 0.65340002742402614 1.2724957718177854  -0.8975964861531891 -0.34672764240957199 0.27221405186828196
+0.40498399644609495 0.19865436684204019 0.93834668108359476  -0.59583045652862321 -0.80068159669946959 -0.062410317894402448
+0.33330487729716562 0.26642231325749555 1.1318385030170197  -0.66711974931205542 -0.73311225719230511 0.13227871496285401
+0.47163878825453986 0.31653113247178322 1.5036911127293848  -0.52841879760671118 -0.68370790823052097 0.50330613999724172
+0.30598545619885309 0.36295261616331198 1.335431727389222  -0.69398814937561704 -0.63692575831934384 0.3357171829316084
+1.0616533189164057 0.40498399644609495 1.8013456331579596  0.062410317894397979 -0.59583045652862809 0.80068159669946626
+0.86816149698298051 0.33330487729716585 1.7335776867425046  -0.13227871496285251 -0.6671197493120562 0.73311225719230455
+0.49630888727061595 0.47163878825453998 1.6834688675282172  -0.50330613999724094 -0.52841879760671129 0.68370790823052152
+0.66456827261077822 0.30598545619885309 1.6370473838366881  -0.33571718293160813 -0.69398814937561759 0.6369257583193435
+0.19865436684204019 1.0616533189164057 0.40498399644609517  -0.80068159669946548 0.062410317894397452 -0.5958304565286292
+0.13458381024047572 1.2133191789074433 0.54662405620460941  -0.86539097215515914 0.21403145679805632 -0.45308829251399835
+0.031943921080893167 1.2413678794555163 0.93211056904855083  -0.96807477555330901 0.24117598392814765 -0.068303541004109986
+0.10243968818147742 1.3465999725759745 0.72750422818221494  -0.89759648615318854 0.34672764240957266 -0.27221405186828312
+0.13700104792563483 0.9002428344740192 1.4952588380279244  -0.86309191459386536 -0.10098201560182207 0.49484844092680463
+0.053103134350052095 1.0000000000000002 1.3215374407783713  -0.94714371399036135 0 0.32080957755114586
+0.075163253016267029 1.3545175594333883 1.1378197789939481  -0.92488389215866973 0.3542511846594476 0.13818785834076797
+0.01635264358733779 1.1212211638374883 1.1332040076734395  -0.98365340072891572 0.12142771508337433 0.13297103911781027
+1.4869664504627846 1.2757285413196802 1.8287565671687904  0.48692804957249064 0.27563277583938867 0.82881098413486498
+1.3417901167060058 1.7879282682296775 1.5121997269099978  0.34188293456237351 0.78786613428398422 0.51223335844459672
+0.72427145868032006 1.8287565671687904 1.4869664504627849  -0.27563277583938928 0.82881098413486498 0.48692804957249036
+0.48780027309000262 1.3417901167060056 1.787928268229678  -0.51223335844459661 0.34188293456237429 0.787866134283984
+0.95917170106088778 1.0000000000000002 1.9991661773727825  -0.040944849850879386 7.9185827630587721e-16 0.99916140801708753
+1.0408282989391127 1.0000000000000002 0.00083382262721753975  0.040944849850880191 3.6467157461454874e-16 -0.99916140801708742
+0.51303354953721536 1.2757285413196804 0.17124343283120957  -0.48692804957249081 0.27563277583938856 -0.82881098413486487
+0.65820988329399455 1.787928268229678 0.48780027309000262  -0.34188293456237323 0.78786613428398444 -0.51223335844459661
+1.2757285413196804 1.8287565671687904 0.51303354953721536  0.2756327758393875 0.82881098413486598 -0.4869280495724897
+1.5121997269099978 1.3417901167060056 0.21207173177032246  0.51223335844459683 0.34188293456237367 -0.78786613428398422
+1.3417901167060056 0.21207173177032246 1.5121997269099978  0.3418829345623734 -0.78786613428398455 0.51223335844459639
+1.0000000000000002 0.00083382262721753975 1.0408282989391127  -4.8622876615273169e-17 -0.99916140801708742 0.040944849850880878
+1.2757285413196804 0.17124343283120957 0.51303354953721536  0.27563277583938856 -0.82881098413486487 -0.48692804957249081
+1.787928268229678 0.48780027309000262 0.65820988329399455  0.78786613428398444 -0.5122333584445965 -0.34188293456237345
+1.8287565671687904 0.51303354953721558 1.2757285413196802  0.8288109841348662 -0.48692804957248981 0.27563277583938656
+1.8287565671687904 1.4869664504627846 1.2757285413196802  0.82881098413486498 0.48692804957249064 0.27563277583938867
+0.82188503772742805 0.55513243511369992 0.12315882465233803  -0.18329374350458857 -0.42919468968315555 -0.88441806965928382
+0.00083382262721753975 0.95917170106088778 1.0000000000000002  -0.99916140801708753 -0.040944849850879393 -5.5569001846026486e-17
+0.48780027309000262 0.65820988329399455 1.787928268229678  -0.5122333584445965 -0.34188293456237345 0.78786613428398444
+0.17124343283120991 1.4869664504627851 1.2757285413196804  -0.82881098413486476 0.48692804957249086 0.27563277583938922
+1.0408282989391127 1.0000000000000002 1.9991661773727825  0.040944849850879324 8.0227746415200712e-16 0.99916140801708753
+1.4869664504627849 0.72427145868032006 1.8287565671687904  0.4869280495724907 -0.27563277583938717 0.82881098413486554
+1.5121997269099978 1.3417901167060058 1.7879282682296775  0.51223335844459672 0.34188293456237351 0.78786613428398422
+1.7879282682296775 1.5121997269099978 1.3417901167060058  0.78786613428398422 0.51223335844459672 0.34188293456237351
+1.2757285413196802 1.8287565671687904 1.4869664504627846  0.27563277583938983 0.82881098413486343 0.48692804957249253
+1.0000000000000002 1.9991661773727825 1.0408282989391127  8.0227746415200722e-16 0.99916140801708742 0.040944849850882141
+0.65820988329399466 1.7879282682296778 1.5121997269099978  -0.3418829345623734 0.78786613428398444 0.5122333584445965
+0.21207173177032257 1.5121997269099978 1.3417901167060058  -0.78786613428398455 0.51223335844459572 0.34188293456237429
+0.51303354953721558 1.2757285413196802 1.8287565671687904  -0.48692804957248981 0.27563277583938656 0.8288109841348662
+0.51303354953721558 0.72427145868032006 1.8287565671687904  -0.48692804957249058 -0.27563277583938756 0.82881098413486542
+1.4869664504627849 1.2757285413196802 0.17124343283120991  0.48692804957249114 0.27563277583938811 -0.82881098413486487
+1.4869664504627846 0.72427145868031995 0.17124343283120957  0.48692804957249103 -0.27563277583938883 -0.82881098413486465
+0.95917170106088778 1.0000000000000002 0.00083382262721753975  -0.040944849850880066 3.6119851199917208e-16 -0.99916140801708742
+0.8104943439581207 0.5727813550993911 0.11695476797072311  -0.18329374350458949 -0.42919468968314711 -0.88441806965928782
+0.48780027309000262 1.3417901167060058 0.21207173177032246  -0.51223335844459639 0.34188293456237423 -0.78786613428398411
+0.21207173177032246 1.5121997269099978 0.65820988329399444  -0.78786613428398433 0.5122333584445965 -0.34188293456237356
+0.72427145868032006 1.8287565671687904 0.51303354953721558  -0.27563277583938739 0.82881098413486554 -0.48692804957249036
+1.0000000000000002 1.9991661773727825 0.95917170106088745  8.4048115292115045e-16 0.99916140801708742 -0.040944849850882155
+1.3417901167060056 1.787928268229678 0.48780027309000262  0.34188293456237384 0.78786613428398466 -0.51223335844459594
+1.7879282682296778 1.5121997269099978 0.65820988329399466  0.78786613428398444 0.5122333584445965 -0.3418829345623734
+1.787928268229678 0.48780027309000262 1.3417901167060056  0.787866134283984 -0.51223335844459661 0.34188293456237429
+1.5121997269099978 0.65820988329399466 1.7879282682296775  0.51223335844459672 -0.34188293456237334 0.78786613428398444
+1.2757285413196804 0.17124343283120991 1.4869664504627851  0.27563277583938872 -0.82881098413486476 0.48692804957249108
+0.72427145868031995 0.17124343283120957 1.4869664504627846  -0.27563277583938883 -0.82881098413486476 0.48692804957249108
+1.0000000000000002 0.00083382262721753975 0.95917170106088778  -5.5569001846026486e-17 -0.99916140801708753 -0.040944849850879393
+0.55513243511370003 0.123158824652338 0.82188503772742816  -0.42919468968315033 -0.88441806965928604 -0.18329374350459032
+1.341790116706006 0.21207173177032235 0.48780027309000251  0.34188293456237451 -0.78786613428398411 -0.51223335844459639
+1.5121997269099978 0.65820988329399455 0.21207173177032246  0.51223335844459672 -0.3418829345623734 -0.78786613428398444
+1.8287565671687904 0.51303354953721558 0.72427145868032006  0.82881098413486531 -0.4869280495724907 -0.27563277583938756
+1.9991661773727825 0.95917170106088778 1.0000000000000002  0.99916140801708753 -0.040944849850879504 8.3700809030577384e-16
+1.9991661773727825 1.0408282989391127 1.0000000000000002  0.99916140801708753 0.040944849850879317 8.0575052676738392e-16
+1.8287565671687904 1.4869664504627849 0.72427145868032006  0.82881098413486542 0.48692804957249064 -0.27563277583938711
+0.57278135509939099 0.11695476797072324 0.8104943439581207  -0.42919468968314667 -0.88441806965928826 -0.1832937435045886
+0.90157505838463314 0.24184951424973419 0.35660859546245843  -0.11348698498784407 -0.74804169499391326 -0.65387638494519917
+0.84405122505983243 0.51657855931435837 0.13944047800987086  -0.13902973540250935 -0.48165648852028198 -0.86526167125339581
+0.17124343283120957 0.51303354953721536 1.2757285413196804  -0.82881098413486487 -0.48692804957249081 0.27563277583938856
+0.21207173177032235 0.48780027309000251 1.341790116706006  -0.78786613428398411 -0.51223335844459639 0.34188293456237451
+0.65820988329399455 0.21207173177032246 1.5121997269099978  -0.3418829345623734 -0.78786613428398433 0.51223335844459661
+0.17124343283120957 1.4869664504627846 0.72427145868031995  -0.82881098413486476 0.48692804957249108 -0.27563277583938883
+0.00083382262721753975 1.0408282989391127 1.0000000000000002  -0.99916140801708742 0.040944849850880878 -4.8622876615273169e-17
+1.3180233001589552 1.5833668628112614 1.7473582032263737  0.31837608818572172 0.58341134180693532 0.74717325482286157
+1.154901620023423 1.3257845443224259 1.932668171856823  0.15470547768481949 0.32538864777967036 0.93283891592837687
+1.0000000000000002 1.7799160715239055 1.6258841117800629  -1.9440969465064108e-05 0.78016657033104153 0.62557183613071055
+1.2506360861103192 1.5764206304327446 1.7777665518334007  0.25098113386125548 0.57611676249591781 0.77788041909855321
+0.68197669984104503 1.5833668628112616 1.7473582032263737  -0.31838810336562495 0.58337988565756627 0.74719269579232706
+1 1.7313222504561676 1.6820320857465041  -0.00040939357642492746 0.73148465290216669 0.68185778206712322
+0.80345079128735619 1.2653435626523064 1.9439074119390181  -0.1967866846734746 0.26502323844130937 0.94394792431643348
+0.74936391388968104 1.5764206304327451 1.7777665518334005  -0.25098113386125537 0.57611676249591781 0.77788041909855332
+1.1965492087126446 1.2653435626523064 1.9439074119390178  0.19675522852410743 0.26500379747184277 0.94395993949633727
+0.84509837997657777 1.3257845443224261 1.932668171856823  -0.1553678904062491 0.3257980413560963 0.93258589678337034
+0.80345079128735619 1.2653435626523064 0.056092588060981941  -0.19678668467347479 0.26502323844130921 -0.94394792431643348
+1.1549016200234223 1.3257845443224259 0.067331828143176842  0.15470547768481682 0.32538864777967058 -0.9328389159283772
+0.68197669984104503 1.5833668628112614 0.25264179677362608  -0.3183881033656254 0.58337988565756549 -0.7471926957923275
+0.84509837997657777 1.3257845443224259 0.067331828143176842  -0.15536789040624877 0.32579804135609564 -0.93258589678337067
+1 1.7799160715239055 0.37411588821993702  1.9440969465197814e-05 0.78016657033104042 -0.62557183613071199
+0.74936391388968104 1.5764206304327446 0.22223344816659929  -0.25098113386125498 0.57611676249591759 -0.77788041909855354
+1.318023300158955 1.5833668628112618 0.25264179677362619  0.3183881033656264 0.58337988565756582 -0.74719269579232672
+1.0000000000000002 1.7313222504561674 0.31796791425349591  0.0004093935764240383 0.73148465290216658 -0.68185778206712311
+1.1965492087126439 1.2653435626523064 0.056092588060981941  0.19678668467347576 0.26502323844130871 -0.94394792431643337
+1.2506360861103192 1.5764206304327451 0.22223344816659951  0.2507281147162479 0.57677917521735 -0.7774710255221281
+1.2653435626523064 0.056092588060981941 1.1965492087126439  0.26502323844130876 -0.94394792431643337 0.19678668467347579
+1.5764206304327453 0.22223344816659973 1.2506360861103192  0.57677917521735 -0.77747102552212821 0.25072811471624751
+1.2653435626523064 0.056092588060981941 0.80345079128735619  0.26502323844130921 -0.94394792431643348 -0.19678668467347479
+1.3257845443224259 0.067331828143176842 1.1549016200234223  0.32538864777966992 -0.93283891592837775 0.1547054776848156
+1.5833668628112616 0.25264179677362608 0.68197669984104492  0.58341134180693432 -0.74717325482286268 -0.31837608818572105
+1.3257845443224259 0.067331828143176842 0.84509837997657777  0.32579804135609486 -0.93258589678337089 -0.15536789040624885
+1.7799160715239055 0.37411588821993702 1  0.78016657033104053 -0.62557183613071199 1.944096946520129e-05
+1.5764206304327446 0.22223344816659929 0.74936391388968104  0.57677917521734945 -0.77747102552212866 -0.25072811471624729
+1.5833668628112618 0.25264179677362619 1.318023300158955  0.58337988565756582 -0.74719269579232683 0.31838810336562634
+1.7313222504561674 0.31796791425349591 1.0000000000000002  0.73148465290216691 -0.68185778206712278 0.00040939357642373793
+1.7473582032263737 1.3180233001589552 1.5833668628112614  0.74717325482286168 0.31837608818572238 0.58341134180693466
+1.932668171856823 1.154901620023423 1.3257845443224259  0.93283891592837687 0.15470547768481949 0.32538864777967036
+0.80345079128735619 0.73465643734769381 0.056092588060981829  -0.19678668467347549 -0.26502323844130932 -0.94394792431643337
+0.85311732979922938 0.49982529754025784 0.14730961092137676  -0.13902973540250163 -0.48165648852027954 -0.86526167125339848
+0.056092588060981941 1.1965492087126446 0.73465643734769381  -0.94394792431643382 0.19678668467347557 -0.26502323844130737
+0.067331828143176842 0.84509837997657777 0.67421545567757424  -0.93283891592837742 -0.15470547768481616 -0.32538864777967025
+0.37411588821993702 1 1.7799160715239055  -0.62557183613071199 1.9440969465197814e-05 0.78016657033104042
+0.22223344816659929 0.74936391388968104 1.5764206304327446  -0.77747102552212877 -0.25072811471624706 0.57677917521734956
+0.41663313718873862 1.7473582032263741 1.318023300158955  -0.58337988565756549 0.74719269579232761 0.31838810336562501
+0.26867774954383239 1.6820320857465041 1.0000000000000002  -0.73148465290216669 0.68185778206712311 0.00040939357642482668
+0.80345079128735619 0.73465643734769381 1.9439074119390183  -0.19678668467347538 -0.26502323844130976 0.94394792431643326
+1.1549016200234223 0.67421545567757413 1.932668171856823  0.1553678904062501 -0.32579804135609519 0.93258589678337056
+1.7473582032263737 0.68197669984104503 1.5833668628112616  0.74719269579232706 -0.31838810336562495 0.58337988565756627
+1.6820320857465041 1 1.7313222504561676  0.68185778206712322 -0.00040939357642492746 0.73148465290216669
+1.6258841117800629 1.0000000000000002 1.7799160715239055  0.62557183613071055 -1.9440969464025697e-05 0.78016657033104153
+1.7777665518334005 1.2506360861103192 1.5764206304327451  0.77747102552212888 0.25072811471625006 0.57677917521734801
+1.7799160715239055 1.6258841117800629 1.0000000000000002  0.78016657033104164 0.62557183613071043 1.9440969464694239e-05
+1.5764206304327446 1.7777665518334007 1.2506360861103192  0.57611676249591814 0.77788041909855277 0.25098113386125592
+1.5833668628112614 1.7473582032263737 1.3180233001589552  0.58341134180693532 0.74717325482286157 0.31837608818572172
+1.3257845443224259 1.932668171856823 1.154901620023423  0.32538864777967036 0.93283891592837687 0.15470547768481949
+0.73465643734769381 1.9439074119390181 0.80345079128735586  -0.26500379747184416 0.94395993949633739 -0.19675522852410532
+0.67421545567757413 1.932668171856823 1.1549016200234223  -0.32538864777966992 0.93283891592837731 0.15470547768481824
+0.73465643734769381 1.9439074119390181 1.1965492087126439  -0.26502323844130993 0.94394792431643315 0.19678668467347582
+0.42357936956725528 1.7777665518334005 1.2506360861103192  -0.57677917521734934 0.77747102552212888 0.25072811471624717
+0.056092588060981941 1.1965492087126439 1.2653435626523064  -0.94394792431643337 0.19678668467347579 0.26502323844130876
+0.22223344816659973 1.2506360861103192 1.5764206304327453  -0.77747102552212821 0.25072811471624751 0.57677917521735
+0.25264179677362619 1.318023300158955 1.5833668628112618  -0.7471926957923265 0.31838810336562612 0.58337988565756638
+0.31796791425349591 1.0000000000000002 1.7313222504561674  -0.68185778206712278 0.00040939357642426756 0.73148465290216691
+0.68197669984104503 0.41663313718873862 1.7473582032263741  -0.31838810336562445 -0.58337988565756549 0.74719269579232783
+0.84509837997657777 0.67421545567757435 1.932668171856823  -0.1547054776848153 -0.3253886477796708 0.93283891592837742
+1.7473582032263741 1.318023300158955 0.41663313718873862  0.74719269579232761 0.31838810336562501 -0.58337988565756549
+1.6820320857465041 1.0000000000000002 0.26867774954383239  0.68185778206712311 0.00040939357642482668 -0.73148465290216669
+1.3180233001589552 0.41663313718873873 0.25264179677362608  0.31837608818572138 -0.58341134180693455 -0.74717325482286234
+1.154901620023423 0.67421545567757435 0.067331828143176842  0.15536789040624938 -0.32579804135609586 -0.93258589678337045
+1.1965492087126446 0.73465643734769381 0.056092588060981941  0.19678668467347524 -0.26502323844130793 -0.94394792431643371
+0.84509837997657777 0.67421545567757424 0.067331828143176842  -0.15470547768481568 -0.32538864777966997 -0.93283891592837764
+0.40180685413975104 0.20692923660476614 0.89148810692249203  -0.58661618171386376 -0.80340332070769127 -0.10210073274615536
+0.31796791425349591 1 0.26867774954383261  -0.68185778206712322 0.0004093935764252486 -0.73148465290216658
+0.37411588821993691 1.0000000000000002 0.22008392847609459  -0.62557183613071188 -1.9440969464680348e-05 -0.78016657033104053
+0.22223344816659951 1.2506360861103192 0.42357936956725528  -0.77747102552212832 0.25072811471624878 -0.57677917521734934
+0.22008392847609459 1.6258841117800631 1  -0.7801665703310412 0.6255718361307111 1.9440969465668402e-05
+0.42357936956725517 1.7777665518334005 0.74936391388968104  -0.57677917521734912 0.77747102552212877 -0.2507281147162479
+0.41663313718873862 1.7473582032263741 0.68197669984104503  -0.5833798856575656 0.74719269579232717 -0.31838810336562584
+0.67421545567757435 1.932668171856823 0.84509837997657744  -0.32579804135609636 0.93258589678337023 -0.15536789040624996
+1.2653435626523064 1.9439074119390178 1.1965492087126446  0.26500379747184277 0.94395993949633727 0.19675522852410743
+1.3257845443224261 1.932668171856823 0.84509837997657744  0.32579804135609641 0.93258589678337034 -0.15536789040624846
+1.2653435626523066 1.9439074119390181 0.80345079128735586  0.26500379747184327 0.9439599394963375 -0.1967552285241061
+1.5764206304327451 1.7777665518334005 0.74936391388968104  0.57611676249591781 0.77788041909855321 -0.25098113386125531
+1.9439074119390181 1.1965492087126439 0.73465643734769381  0.94394792431643315 0.19678668467347582 -0.26502323844130993
+1.7777665518334005 1.2506360861103192 0.42357936956725528  0.77747102552212888 0.25072811471624717 -0.57677917521734934
+1.9439074119390181 0.80345079128735619 1.2653435626523064  0.94394792431643304 -0.19678668467347601 0.26502323844131026
+1.7777665518334005 0.74936391388968104 1.5764206304327451  0.77788041909855321 -0.25098113386125531 0.57611676249591781
+1.1965492087126439 0.73465643734769381 1.9439074119390181  0.19678668467347582 -0.26502323844130993 0.94394792431643315
+1.2506360861103192 0.42357936956725528 1.7777665518334005  0.2509811338612542 -0.57611676249591748 0.77788041909855388
+1.318023300158955 0.41663313718873862 1.7473582032263741  0.3183881033656249 -0.58337988565756593 0.74719269579232728
+1.0000000000000002 0.26867774954383239 1.6820320857465041  -0.00040939357642494475 -0.73148465290216658 0.68185778206712311
+0.41663313718873873 0.25264179677362608 1.3180233001589552  -0.58341134180693588 -0.74717325482286145 0.31837608818572088
+0.67421545567757435 0.067331828143176842 1.154901620023423  -0.32579804135609586 -0.93258589678337045 0.15536789040624938
+0.73465643734769381 0.056092588060981941 1.1965492087126446  -0.26500379747184338 -0.94395993949633727 0.19675522852410698
+0.67421545567757413 0.06733182814317662 0.84509837997657777  -0.32538864777966992 -0.93283891592837753 -0.15470547768481679
+0.51657855931435848 0.13944047800987086 0.84405122505983243  -0.48165648852028675 -0.86526167125339581 -0.13902973540249375
+1 0.26867774954383261 0.31796791425349591  -0.00040939357642570527 -0.73148465290216624 -0.68185778206712344
+1.0000000000000002 0.22008392847609459 0.37411588821993691  -1.9440969464680348e-05 -0.78016657033104053 -0.62557183613071188
+1.2506360861103192 0.42357936956725528 0.22223344816659951  0.25098113386125509 -0.57611676249591803 -0.77788041909855321
+1.6258841117800631 1 0.22008392847609459  0.6255718361307111 1.9440969465666664e-05 -0.7801665703310412
+1.7777665518334005 0.74936391388968104 0.42357936956725517  0.77747102552212877 -0.2507281147162479 -0.57677917521734912
+1.7473582032263741 0.68197669984104503 0.41663313718873862  0.74717325482286201 -0.31837608818572022 -0.58341134180693555
+1.932668171856823 0.84509837997657777 0.67421545567757435  0.93258589678336989 -0.15536789040624968 -0.32579804135609747
+1.9439074119390178 1.1965492087126446 1.2653435626523064  0.94395993949633727 0.19675522852410743 0.26500379747184277
+1.932668171856823 0.84509837997657777 1.3257845443224261  0.93283891592837731 -0.15470547768481616 0.32538864777967047
+1.9439074119390183 0.80345079128735619 0.73465643734769381  0.94394792431643326 -0.19678668467347538 -0.26502323844130976
+1.932668171856823 1.1549016200234223 0.67421545567757413  0.93283891592837731 0.15470547768481824 -0.32538864777966992
+1.5833668628112616 1.7473582032263737 0.68197669984104503  0.58337988565756627 0.74719269579232706 -0.31838810336562495
+1.7313222504561676 1.6820320857465041 1  0.73148465290216669 0.68185778206712322 -0.00040939357642492746
+0.73465643734769381 0.056092588060981829 0.80345079128735619  -0.26500379747184266 -0.94395993949633739 -0.19675522852410707
+0.49982529754025784 0.14730961092137676 0.85311732979922927  -0.48165648852028142 -0.86526167125339759 -0.13902973540250096
+0.056092588060981829 0.80345079128735619 0.73465643734769381  -0.94395993949633739 -0.19675522852410574 -0.26500379747184372
+0.20692923660476614 0.89148810692249181 0.40180685413975092  -0.80340332070769305 -0.10210073274615397 -0.58661618171386143
+0.24184951424973422 0.35660859546245849 0.90157505838463314  -0.74804169499389739 -0.65387638494521549 -0.11348698498785463
+0.26867774954383261 0.31796791425349591 1  -0.73148465290216647 -0.68185778206712322 0.00040939357642524513
+0.25264179677362608 0.68197669984104492 1.5833668628112616  -0.74719269579232783 -0.31838810336562501 0.58337988565756516
+0.067331828143176842 0.84509837997657777 1.3257845443224259  -0.93258589678337067 -0.15536789040624877 0.32579804135609564
+0.22008392847609459 0.37411588821993691 1.0000000000000002  -0.78016657033104053 -0.62557183613071188 -1.9440969464683821e-05
+0.42357936956725528 0.22223344816659951 1.2506360861103192  -0.57677917521734989 -0.7774710255221281 0.25072811471624856
+1 0.22008392847609459 1.6258841117800631  -1.9440969465128357e-05 -0.7801665703310412 0.6255718361307111
+0.74936391388968104 0.42357936956725517 1.7777665518334005  -0.25072811471624762 -0.57677917521734978 0.77747102552212832
+0.25264179677362608 1.3180233001589552 0.41663313718873873  -0.7471732548228619 0.31837608818572111 -0.58341134180693521
+0.067331828143176842 1.154901620023423 0.67421545567757435  -0.93258589678337045 0.15536789040624938 -0.32579804135609586
+0.056092588060981941 0.80345079128735619 1.2653435626523064  -0.94394792431643348 -0.19678668467347479 0.26502323844130921
+0.067331828143176842 1.1549016200234223 1.3257845443224259  -0.93283891592837731 0.15470547768481682 0.32538864777967064
+1.6562122655612299 1.3949848817576367 1.6429404371401004  0.65613064511909525 0.3953635844294397 0.64279095563231536
+1.4382389584574513 1.5296997941879908 1.7261988318135251  0.43849581670457083 0.52986930552536793 0.72592006295091172
+1.2047014786826495 1.9270588370822881 1.3141006482208728  0.20429513892774237 0.92713596376716523 0.31413755092319701
+1.0699865662522952 1.8438004424088632 1.5320739553246518  0.069789417831816108 0.84400685644856677 0.53177237933772425
+0.47030020581200926 1.7261988318135253 1.4382389584574511  -0.52986930552536826 0.72592006295091105 0.43849581670457166
+0.60501511824236354 1.6429404371401004 1.6562122655612299  -0.39536358442944064 0.64279095563231525 0.6561306451190948
+0.46792604467534848 1.0699865662522952 1.8438004424088636  -0.53177237933772226 0.069789417831815984 0.8440068564485681
+0.68589935177912764 1.2047014786826495 1.9270588370822881  -0.31413755092319928 0.20429513892774442 0.9271359637671639
+1.2008600052687632 0.86528508756964573 1.9703129137821027  0.20121590081625335 -0.13450572109592765 0.97026819604229442
+1.2008600052687632 1.1347149124303546 1.9703129137821027  0.20121590081625498 0.13450572109592823 0.97026819604229397
+0.79913999473123709 0.86528508756964573 0.029687086217897174  -0.20121590081625246 -0.13450572109592823 -0.97026819604229453
+0.79913999473123709 1.1347149124303546 0.029687086217897174  -0.20121590081625268 0.13450572109592809 -0.97026819604229442
+0.34378773443876987 1.3949848817576367 0.3570595628598997  -0.65613064511909591 0.39536358442944042 -0.64279095563231414
+0.56176104154254902 1.5296997941879913 0.27380116818647482  -0.43849581670457066 0.52986930552536926 -0.72592006295091094
+0.7952985213173509 1.9270588370822881 0.68589935177912764  -0.20429513892774312 0.92713596376716456 -0.31413755092319812
+0.93001343374770529 1.8438004424088634 0.46792604467534826  -0.069789417831816344 0.84400685644856788 -0.53177237933772259
+1.5296997941879913 1.7261988318135248 0.56176104154254891  0.52986930552536782 0.72592006295091183 -0.43849581670457094
+1.3949848817576367 1.6429404371401006 0.34378773443876998  0.3953635844294397 0.64279095563231481 -0.6561306451190958
+1.5320739553246518 1.0699865662522952 0.15619955759113668  0.5317723793377247 0.069789417831816816 -0.84400685644856654
+1.3141006482208728 1.2047014786826495 0.07294116291771191  0.31413755092319812 0.20429513892774287 -0.92713596376716467
+1.0699865662522952 0.15619955759113668 1.5320739553246518  0.069789417831816025 -0.84400685644856654 0.5317723793377247
+1.2047014786826495 0.07294116291771191 1.3141006482208728  0.20429513892774351 -0.92713596376716445 0.31413755092319806
+0.86528508756964573 0.029687086217897174 0.79913999473123709  -0.13450572109592823 -0.97026819604229453 -0.20121590081625246
+1.1347149124303546 0.029687086217897174 0.79913999473123709  0.13450572109592809 -0.97026819604229442 -0.20121590081625268
+1.3949848817576367 0.3570595628598997 0.34378773443876987  0.39536358442944003 -0.64279095563231436 -0.65613064511909602
+1.5296997941879913 0.27380116818647482 0.56176104154254902  0.52986930552536893 -0.72592006295091072 -0.43849581670457122
+1.9270588370822881 0.68589935177912764 0.7952985213173509  0.92713596376716489 -0.3141375509231974 -0.20429513892774293
+1.8438004424088634 0.46792604467534826 0.93001343374770529  0.84400685644856788 -0.53177237933772259 -0.069789417831816358
+1.7261988318135253 0.56176104154254913 1.5296997941879908  0.72592006295091149 -0.43849581670457066 0.52986930552536848
+1.6429404371401006 0.34378773443876998 1.3949848817576367  0.64279095563231481 -0.6561306451190958 0.3953635844294397
+1.6429404371401004 1.6562122655612299 1.3949848817576369  0.6427909556323147 0.65613064511909547 0.3953635844294407
+1.7261988318135248 1.4382389584574513 1.5296997941879911  0.72592006295091149 0.43849581670457166 0.52986930552536771
+0.46792604467534826 0.93001343374770529 0.15619955759113657  -0.53177237933772314 -0.069789417831815331 -0.84400685644856765
+0.68589935177912764 0.7952985213173509 0.072941162917711577  -0.31413755092319845 -0.20429513892774354 -0.92713596376716445
+0.029687086217897396 1.2008600052687632 1.1347149124303546  -0.97026819604229431 0.20121590081625271 0.13450572109592898
+0.029687086217897174 1.2008600052687632 0.86528508756964573  -0.97026819604229431 0.20121590081625348 -0.13450572109592815
+0.68589935177912764 0.7952985213173509 1.9270588370822881  -0.31413755092319667 -0.20429513892774248 0.92713596376716523
+0.46792604467534826 0.93001343374770529 1.8438004424088634  -0.53177237933772259 -0.069789417831816344 0.84400685644856788
+0.27380116818647515 1.4382389584574511 1.5296997941879913  -0.72592006295091105 0.43849581670457111 0.52986930552536859
+0.3570595628598997 1.6562122655612304 1.3949848817576367  -0.64279095563231425 0.65613064511909602 0.39536358442944025
+0.79913999473123698 1.1347149124303548 1.9703129137821027  -0.20121590081625307 0.13450572109592912 0.9702681960422942
+0.79913999473123698 0.86528508756964573 1.9703129137821027  -0.20121590081625254 -0.13450572109592954 0.97026819604229431
+1.4382389584574511 0.47030020581200926 1.7261988318135253  0.43849581670457166 -0.52986930552536826 0.72592006295091105
+1.6562122655612299 0.60501511824236354 1.6429404371401004  0.65613064511909469 -0.39536358442944097 0.64279095563231514
+1.3141006482208728 1.2047014786826495 1.9270588370822881  0.31413755092319628 0.20429513892774195 0.92713596376716545
+1.5320739553246518 1.0699865662522952 1.8438004424088632  0.53177237933772425 0.069789417831816108 0.84400685644856677
+1.9270588370822881 1.3141006482208728 1.2047014786826495  0.92713596376716545 0.31413755092319628 0.20429513892774195
+1.8438004424088632 1.5320739553246518 1.0699865662522952  0.84400685644856688 0.53177237933772437 0.069789417831816108
+1.3949848817576369 1.6429404371401004 1.6562122655612299  0.39536358442944108 0.64279095563231448 0.65613064511909536
+1.5296997941879911 1.7261988318135248 1.4382389584574513  0.52986930552536793 0.72592006295091183 0.43849581670457083
+1.1347149124303548 1.9703129137821027 0.79913999473123687  0.13450572109592798 0.9702681960422942 -0.20121590081625382
+0.86528508756964584 1.9703129137821027 0.79913999473123709  -0.13450572109592848 0.9702681960422942 -0.20121590081625337
+0.93001343374770529 1.8438004424088634 1.5320739553246518  -0.069789417831815317 0.84400685644856699 0.53177237933772403
+0.7952985213173509 1.9270588370822881 1.3141006482208728  -0.20429513892774187 0.92713596376716512 0.31413755092319728
+0.15619955759113668 1.5320739553246518 1.0699865662522952  -0.84400685644856654 0.5317723793377247 0.069789417831816039
+0.07294116291771191 1.3141006482208728 1.2047014786826495  -0.92713596376716445 0.31413755092319806 0.20429513892774351
+0.56176104154254913 1.5296997941879908 1.7261988318135253  -0.43849581670457066 0.52986930552536848 0.72592006295091149
+0.34378773443876998 1.3949848817576367 1.6429404371401006  -0.65613064511909502 0.39536358442944081 0.64279095563231492
+0.34378773443876998 0.60501511824236354 1.6429404371401006  -0.65613064511909447 -0.39536358442944114 0.64279095563231536
+0.56176104154254913 0.47030020581200926 1.7261988318135253  -0.43849581670457161 -0.52986930552536848 0.72592006295091094
+1.4382389584574513 1.5296997941879913 0.27380116818647504  0.43849581670457027 0.52986930552536882 -0.72592006295091138
+1.6562122655612304 1.3949848817576367 0.3570595628598997  0.65613064511909658 0.39536358442944047 -0.64279095563231359
+1.6562122655612304 0.60501511824236343 0.3570595628598997  0.65613064511909602 -0.39536358442944036 -0.64279095563231414
+1.4382389584574513 0.47030020581200915 0.27380116818647493  0.43849581670457005 -0.52986930552536859 -0.72592006295091183
+1.2008600052687632 1.1347149124303546 0.029687086217897396  0.20121590081625301 0.13450572109592879 -0.97026819604229431
+1.2008600052687632 0.86528508756964573 0.029687086217897174  0.20121590081625285 -0.13450572109592773 -0.97026819604229453
+0.30397342055421117 0.90687073458352585 0.28910030252843327  -0.68096837004796129 -0.091975091050974067 -0.72651404777911077
+0.33295004022963903 0.90494753379947435 0.26218372058148826  -0.68096837004795807 -0.091975091050972152 -0.72651404777911399
+0.68589935177912764 1.2047014786826495 0.072941162917711799  -0.31413755092319828 0.2042951389277439 -0.92713596376716445
+0.46792604467534848 1.0699865662522952 0.15619955759113646  -0.53177237933772326 0.069789417831815442 -0.84400685644856743
+0.07294116291771191 1.3141006482208728 0.7952985213173509  -0.92713596376716512 0.3141375509231974 -0.20429513892774237
+0.15619955759113657 1.5320739553246518 0.93001343374770529  -0.84400685644856699 0.53177237933772403 -0.069789417831815359
+0.60501511824236354 1.6429404371401004 0.34378773443876998  -0.39536358442944058 0.64279095563231503 -0.65613064511909491
+0.47030020581200915 1.7261988318135253 0.56176104154254902  -0.52986930552537015 0.72592006295091005 -0.43849581670457105
+0.86528508756964584 1.9703129137821027 1.2008600052687632  -0.13450572109592765 0.97026819604229442 0.20121590081625323
+1.1347149124303546 1.9703129137821027 1.2008600052687632  0.13450572109592823 0.97026819604229397 0.20121590081625498
+1.0699865662522952 1.8438004424088636 0.46792604467534848  0.069789417831815984 0.8440068564485681 -0.53177237933772226
+1.2047014786826495 1.9270588370822881 0.68589935177912764  0.20429513892774379 0.92713596376716445 -0.31413755092319812
+1.8438004424088634 1.5320739553246518 0.93001343374770529  0.84400685644856699 0.53177237933772403 -0.069789417831815317
+1.9270588370822881 1.3141006482208728 0.7952985213173509  0.92713596376716512 0.31413755092319728 -0.20429513892774187
+1.8438004424088636 0.46792604467534848 1.0699865662522952  0.8440068564485681 -0.53177237933772226 0.069789417831815984
+1.9270588370822881 0.68589935177912764 1.2047014786826495  0.92713596376716356 -0.31413755092319917 0.20429513892774614
+1.5320739553246518 0.93001343374770529 1.8438004424088634  0.53177237933772403 -0.069789417831815317 0.84400685644856699
+1.3141006482208728 0.7952985213173509 1.9270588370822881  0.31413755092319728 -0.20429513892774187 0.92713596376716512
+1.5296997941879913 0.27380116818647515 1.4382389584574511  0.52986930552536859 -0.7259200629509116 0.43849581670457033
+1.3949848817576367 0.3570595628598997 1.6562122655612304  0.39536358442944047 -0.64279095563231359 0.65613064511909658
+0.60501511824236343 0.3570595628598997 1.6562122655612304  -0.39536358442944036 -0.64279095563231414 0.65613064511909602
+0.47030020581200915 0.27380116818647493 1.4382389584574513  -0.52986930552536871 -0.7259200629509116 0.43849581670457016
+1.1347149124303546 0.029687086217897396 1.2008600052687632  0.13450572109592879 -0.97026819604229431 0.20121590081625301
+0.86528508756964573 0.029687086217897174 1.2008600052687632  -0.13450572109592773 -0.97026819604229453 0.20121590081625285
+0.81389356246462441 0.11874744154864894 0.56789366986248413  -0.18423339416733714 -0.88583486239282039 -0.42585755017737514
+0.65746189559341328 0.74644278217951743 0.096124922711889452  -0.34889693998410853 -0.228242587483305 -0.90894237800239641
+1.2047014786826495 0.072941162917711799 0.68589935177912764  0.2042951389277439 -0.92713596376716445 -0.31413755092319828
+1.0699865662522952 0.15619955759113646 0.46792604467534848  0.069789417831815442 -0.84400685644856754 -0.53177237933772337
+1.3141006482208724 0.7952985213173509 0.072941162917711799  0.31413755092319873 -0.20429513892774345 -0.92713596376716434
+1.5320739553246518 0.93001343374770529 0.15619955759113657  0.53177237933772392 -0.06978941783181529 -0.8440068564485671
+1.6429404371401006 0.34378773443876998 0.60501511824236354  0.64279095563231536 -0.65613064511909447 -0.39536358442944114
+1.7261988318135253 0.56176104154254913 0.47030020581200926  0.72592006295091094 -0.43849581670457161 -0.52986930552536848
+1.9703129137821027 1.2008600052687632 0.86528508756964573  0.97026819604229442 0.20121590081625335 -0.13450572109592765
+1.9703129137821027 1.2008600052687632 1.1347149124303546  0.97026819604229397 0.20121590081625498 0.13450572109592823
+1.9703129137821027 0.79913999473123709 1.1347149124303546  0.97026819604229453 -0.20121590081625301 0.13450572109592734
+1.9703129137821027 0.79913999473123709 0.86528508756964584  0.97026819604229431 -0.20121590081625226 -0.13450572109592943
+1.7261988318135253 1.4382389584574511 0.47030020581200926  0.72592006295091105 0.43849581670457166 -0.52986930552536826
+1.6429404371401004 1.6562122655612299 0.60501511824236354  0.64279095563231503 0.65613064511909469 -0.39536358442944092
+0.93001343374770529 0.15619955759113657 0.46792604467534826  -0.069789417831815331 -0.84400685644856765 -0.53177237933772314
+0.7952985213173509 0.072941162917711799 0.68589935177912764  -0.20429513892774315 -0.92713596376716467 -0.31413755092319795
+0.15619955759113657 0.46792604467534826 0.93001343374770529  -0.84400685644856765 -0.53177237933772314 -0.069789417831815331
+0.072941162917711799 0.68589935177912764 0.7952985213173509  -0.92713596376716467 -0.31413755092319784 -0.2042951389277434
+0.62688758712066828 0.77156308049914157 0.10155294642477933  -0.34889693998411109 -0.22824258748330314 -0.90894237800239597
+0.87689701064830428 0.44478929974988757 0.17773204761375266  -0.14960718247367027 -0.56053609487440781 -0.8145041296980875
+0.3570595628598997 0.34378773443876987 1.3949848817576367  -0.64279095563231403 -0.6561306451190958 0.39536358442944103
+0.27380116818647504 0.56176104154254891 1.5296997941879913  -0.72592006295091083 -0.43849581670457122 0.52986930552536893
+0.072941162917711799 0.68589935177912764 1.2047014786826495  -0.92713596376716445 -0.31413755092319828 0.2042951389277437
+0.15619955759113646 0.46792604467534848 1.0699865662522952  -0.84400685644856754 -0.53177237933772337 0.069789417831815442
+0.7952985213173509 0.072941162917711799 1.3141006482208724  -0.20429513892774345 -0.92713596376716434 0.31413755092319873
+0.93001343374770529 0.15619955759113657 1.5320739553246518  -0.06978941783181529 -0.8440068564485671 0.53177237933772392
+0.3570595628598997 1.6562122655612304 0.60501511824236343  -0.6427909556323127 0.65613064511909669 -0.39536358442944169
+0.27380116818647493 1.4382389584574513 0.47030020581200915  -0.72592006295091149 0.43849581670457022 -0.52986930552536882
+0.029687086217897174 0.79913999473123709 0.86528508756964573  -0.97026819604229442 -0.20121590081625285 -0.13450572109592798
+0.029687086217897174 0.79913999473123709 1.1347149124303546  -0.97026819604229442 -0.20121590081625268 0.13450572109592809
+1.0650724998901953 1.6494337430038146 1.7576287898477037  0.065515668062196997 0.64992905036579063 0.75716571946238143
+1.143241458288871 1.4447847530509046 1.8841088214019377  0.1439907391710287 0.4444786469332952 0.88414105178604163
+1.1620856567445474 1.0671746383702749 1.984487586431394  0.16230850425355084 0.067102997401377637 0.9844557568457436
+1.3878111467046637 1.20668066329285 1.898268121393853  0.38778432700573318 0.20645471950357228 0.89833165619575694
+0.87351996844576596 1.6114818012702035 1.7810843797781308  -0.12697533232365799 0.61194488891505094 0.78064122227310206
+1.1264800315542343 1.611481801270203 1.7810843797781311  0.12697533232365701 0.61194488891505006 0.78064122227310273
+1.4879855916616425 1.4689407649943766 1.7361824646493051  0.48809649929758631 0.46907539604897797 0.73602315194220347
+1.4017661266241019 1.6946662549544924 1.5966764397267301  0.40197239864760087 0.69455121880115667 0.59667142984000998
+0.8567585417111292 1.444784753050905 1.8841088214019377  -0.143990739171028 0.44447864693329792 0.88414105178604041
+0.93492750010980485 1.6494337430038146 1.7576287898477037  -0.065515668062197524 0.64992905036579163 0.75716571946238043
+1.1395060249225755 1.8567519116990399 1.4965019947697513  0.1393517221021944 0.85685972305471014 0.49635925754815746
+0.86049397507742498 1.8567519116990399 1.4965019947697515  -0.1393517221021946 0.8568597230547097 0.49635925754815835
+1.0379519417336116 1.3797122531607096 1.9243258380670021  0.037984161450742231 0.37896297887110292 0.92463196144413262
+0.83330295178070157 1.5061922847149436 1.8461568796683263  -0.16746624198174989 0.50593831119476029 0.84615689033529951
+0.59823387337589862 1.6946662549544926 1.5966764397267301  -0.40197239864759882 0.69455121880115733 0.59667142984001076
+0.51201440833835776 1.4689407649943764 1.7361824646493056  -0.48809649929758536 0.46907539604897563 0.73602315194220547
+1.1666970482192984 1.5061922847149436 1.8461568796683263  0.16746624198175214 0.50593831119476107 0.84615689033529862
+0.96204805826638895 1.3797122531607096 1.9243258380670021  -0.037984161450741578 0.37896297887110258 0.92463196144413273
+0.61218885329533657 1.2066806632928504 1.8982681213938526  -0.38778432700573218 0.20645471950357264 0.89833165619575739
+0.83791434325545278 1.0671746383702752 1.9844875864313942  -0.16230850425355117 0.06710299740137686 0.9844557568457436
+0.83330295178070157 1.5061922847149436 0.15384312033167369  -0.167466241981751 0.50593831119476318 -0.8461568903352974
+1.0379519417336116 1.3797122531607096 0.075674161932997919  0.037984161450743188 0.37896297887110275 -0.92463196144413262
+1.3878111467046634 1.2066806632928504 0.10173187860614719  0.38778432700573318 0.20645471950357275 -0.89833165619575694
+1.1620856567445474 1.0671746383702752 0.015512413568605998  0.16230850425355273 0.067102997401378234 -0.98445575684574316
+0.93492750010980485 1.6494337430038146 0.24237121015229646  -0.065515668062195248 0.64992905036579229 -0.75716571946238009
+0.8567585417111292 1.4447847530509046 0.11589117859806208  -0.14399073917102873 0.44447864693329753 -0.88414105178604041
+0.83791434325545289 1.0671746383702749 0.015512413568605887  -0.16230850425355201 0.067102997401376541 -0.98445575684574349
+0.61218885329533657 1.2066806632928497 0.10173187860614707  -0.3877843270057334 0.2064547195035728 -0.89833165619575683
+1.1264800315542343 1.611481801270203 0.21891562022186883  0.12697533232365968 0.61194488891504861 -0.78064122227310351
+0.87351996844576596 1.6114818012702032 0.21891562022186895  -0.12697533232365921 0.61194488891504872 -0.78064122227310362
+0.51201440833835754 1.4689407649943766 0.26381753535069474  -0.48809649929758581 0.46907539604897669 -0.73602315194220458
+0.59823387337589873 1.6946662549544924 0.40332356027326965  -0.40197239864759921 0.69455121880115767 -0.59667142984001009
+1.143241458288871 1.4447847530509048 0.11589117859806231  0.14399073917102889 0.44447864693329692 -0.88414105178604063
+1.0650724998901953 1.6494337430038146 0.24237121015229646  0.065515668062196192 0.64992905036579041 -0.75716571946238154
+0.86049397507742531 1.8567519116990399 0.50349800523024868  -0.13935172210219521 0.85685972305470981 -0.4963592575481578
+1.1395060249225755 1.8567519116990399 0.50349800523024868  0.13935172210219604 0.85685972305470992 -0.49635925754815746
+0.96204805826638895 1.3797122531607096 0.075674161932997919  -0.037984161450742487 0.37896297887110214 -0.92463196144413284
+1.1666970482192986 1.5061922847149436 0.15384312033167369  0.1674662419817505 0.50593831119476218 -0.84615689033529828
+1.401766126624101 1.6946662549544926 0.40332356027326954  0.40197239864759843 0.69455121880115755 -0.59667142984001054
+1.4879855916616427 1.4689407649943764 0.26381753535069474  0.48809649929758553 0.46907539604897636 -0.73602315194220491
+1.3797122531607096 0.075674161932997919 0.96204805826638895  0.3789629788711022 -0.92463196144413295 -0.037984161450742494
+1.5061922847149436 0.15384312033167369 1.1666970482192986  0.50593831119476196 -0.8461568903352984 0.16746624198175047
+1.6946662549544926 0.40332356027326954 1.401766126624101  0.69455121880115944 -0.59667142984000909 0.40197239864759748
+1.4689407649943764 0.26381753535069496 1.4879855916616429  0.46907539604897752 -0.73602315194220436 0.48809649929758536
+1.5061922847149436 0.15384312033167369 0.83330295178070157  0.50593831119476174 -0.84615689033529806 -0.16746624198175178
+1.3797122531607096 0.075674161932997919 1.0379519417336116  0.37896297887110275 -0.92463196144413262 0.037984161450743188
+1.2066806632928504 0.1017318786061473 1.3878111467046637  0.20645471950357205 -0.89833165619575706 0.38778432700573334
+1.0671746383702752 0.015512413568605998 1.1620856567445474  0.067102997401378234 -0.98445575684574316 0.16230850425355273
+1.6494337430038146 0.24237121015229646 0.93492750010980485  0.6499290503657924 -0.75716571946238009 -0.065515668062194124
+1.4447847530509046 0.11589117859806219 0.8567585417111292  0.44447864693329742 -0.88414105178604052 -0.1439907391710287
+1.0671746383702749 0.015512413568605887 0.83791434325545289  0.067102997401376541 -0.98445575684574349 -0.16230850425355201
+1.2066806632928497 0.10173187860614707 0.61218885329533657  0.20645471950357278 -0.89833165619575683 -0.38778432700573334
+1.6114818012702032 0.21891562022186895 1.1264800315542343  0.61194488891504872 -0.78064122227310329 0.12697533232366032
+1.6114818012702032 0.21891562022186895 0.87351996844576596  0.61194488891504961 -0.78064122227310295 -0.12697533232365879
+1.4689407649943766 0.26381753535069474 0.51201440833835754  0.46907539604897569 -0.73602315194220502 -0.48809649929758603
+1.6946662549544924 0.40332356027326965 0.59823387337589873  0.69455121880115789 -0.5966714298400102 -0.40197239864759871
+1.4447847530509048 0.11589117859806242 1.143241458288871  0.44447864693329897 -0.88414105178603974 0.14399073917102839
+1.6494337430038146 0.24237121015229646 1.0650724998901953  0.64992905036579118 -0.75716571946238098 0.065515668062195817
+1.8567519116990399 0.50349800523024868 0.86049397507742531  0.85685972305470981 -0.4963592575481578 -0.13935172210219521
+1.8567519116990399 0.50349800523024868 1.1395060249225755  0.85685972305471014 -0.49635925754815724 0.13935172210219549
+1.7576287898477037 1.0650724998901953 1.6494337430038146  0.75716571946238143 0.065515668062196997 0.64992905036579063
+1.8841088214019377 1.143241458288871 1.4447847530509046  0.88414105178604152 0.14399073917102873 0.4444786469332952
+1.984487586431394 1.1620856567445474 1.0671746383702749  0.9844557568457436 0.16230850425355084 0.067102997401377637
+1.898268121393853 1.3878111467046637 1.20668066329285  0.89833165619575706 0.38778432700573323 0.2064547195035723
+1.0379519417336116 0.62028774683929067 0.075674161932997919  0.037984161450742605 -0.37896297887110292 -0.92463196144413262
+0.11874744154864894 0.56789366986248413 0.81389356246462441  -0.88583486239282028 -0.42585755017737542 -0.18423339416733708
+0.60630413399985716 0.78745552743149316 0.10609528287383588  -0.42092243512975502 -0.23042761042597287 -0.87734110809753652
+0.74011618472454033 0.66455433327713243 0.095362650095153101  -0.26377483182397443 -0.35458300388088787 -0.89704722922209634
+0.15384312033167369 1.1666970482192984 0.4938077152850564  -0.84615689033529851 0.16746624198175161 -0.5059383111947614
+0.075674161932997919 0.96204805826638895 0.62028774683929022  -0.92463196144413251 -0.037984161450742515 -0.37896297887110314
+0.10173187860614707 0.61218885329533657 0.79331933670715005  -0.89833165619575817 -0.38778432700573134 -0.20645471950357069
+0.015512413568605887 0.83791434325545289 0.93282536162972529  -0.98445575684574349 -0.16230850425355176 -0.067102997401376721
+0.21891562022186895 1.1264800315542343 1.6114818012702032  -0.78064122227310229 0.12697533232366082 0.61194488891505006
+0.21891562022186895 0.87351996844576596 1.6114818012702032  -0.78064122227310295 -0.12697533232365879 0.61194488891504961
+0.26381753535069474 0.51201440833835754 1.4689407649943766  -0.73602315194220458 -0.48809649929758586 0.46907539604897652
+0.40332356027326965 0.59823387337589873 1.6946662549544924  -0.59667142984001009 -0.40197239864759915 0.69455121880115767
+0.55521524694909519 1.8841088214019377 1.143241458288871  -0.44447864693329769 0.88414105178604052 0.14399073917102762
+0.35056625699618549 1.7576287898477037 1.0650724998901953  -0.64992905036579041 0.75716571946238154 0.06551566806219597
+0.14324808830096003 1.4965019947697515 0.86049397507742531  -0.85685972305470948 0.49635925754815841 -0.13935172210219565
+0.14324808830096014 1.4965019947697515 1.1395060249225755  -0.85685972305471025 0.49635925754815741 0.13935172210219432
+0.83330295178070157 0.49380771528505629 1.8461568796683263  -0.16746624198175108 -0.50593831119476129 0.84615689033529862
+1.0379519417336116 0.62028774683929033 1.9243258380670021  0.0379841614507423 -0.37896297887110325 0.92463196144413251
+1.3878111467046637 0.79331933670715005 1.898268121393853  0.38778432700573245 -0.20645471950357219 0.89833165619575739
+1.1620856567445474 0.93282536162972529 1.984487586431394  0.16230850425355184 -0.067102997401377096 0.98445575684574338
+1.8841088214019377 0.8567585417111292 1.444784753050905  0.8841410517860403 -0.143990739171028 0.44447864693329786
+1.7576287898477037 0.93492750010980485 1.6494337430038146  0.75716571946238087 -0.065515668062197788 0.64992905036579129
+1.4965019947697513 1.1395060249225755 1.8567519116990399  0.49635925754815818 0.13935172210219413 0.85685972305470992
+1.4965019947697515 0.86049397507742498 1.8567519116990399  0.49635925754815835 -0.1393517221021946 0.8568597230547097
+1.7810843797781308 0.87351996844576596 1.6114818012702035  0.78064122227310206 -0.12697533232365713 0.61194488891505106
+1.7810843797781311 1.1264800315542343 1.611481801270203  0.78064122227310273 0.12697533232365701 0.61194488891505006
+1.7361824646493051 1.4879855916616425 1.4689407649943764  0.73602315194220291 0.48809649929758647 0.46907539604897841
+1.5966764397267301 1.4017661266241017 1.6946662549544924  0.59667142984001054 0.40197239864760048 0.69455121880115633
+1.6114818012702035 1.7810843797781308 0.87351996844576596  0.61194488891505106 0.78064122227310206 -0.12697533232365713
+1.6114818012702035 1.7810843797781308 1.1264800315542343  0.61194488891504928 0.78064122227310329 0.12697533232365751
+1.4689407649943766 1.7361824646493051 1.4879855916616425  0.46907539604897841 0.73602315194220291 0.48809649929758642
+1.6946662549544924 1.5966764397267301 1.4017661266241019  0.69455121880115667 0.59667142984001009 0.40197239864760087
+1.6494337430038151 1.7576287898477032 1.0650724998901953  0.64992905036579085 0.75716571946238109 0.065515668062197163
+1.4447847530509046 1.8841088214019377 1.143241458288871  0.44447864693329636 0.88414105178604074 0.14399073917103053
+1.0671746383702749 1.984487586431394 1.1620856567445474  0.067102997401377734 0.9844557568457436 0.16230850425355067
+1.2066806632928497 1.898268121393853 1.3878111467046634  0.20645471950357158 0.89833165619575683 0.38778432700573384
+0.49380771528505629 1.8461568796683263 0.83330295178070157  -0.50593831119475974 0.84615689033529939 -0.16746624198175153
+0.62028774683929033 1.9243258380670021 1.0379519417336116  -0.37896297887110225 0.92463196144413284 0.03798416145074391
+0.79331933670715005 1.898268121393853 1.3878111467046637  -0.20645471950357219 0.89833165619575739 0.38778432700573245
+0.93282536162972529 1.984487586431394 1.1620856567445474  -0.067102997401377193 0.98445575684574338 0.16230850425355184
+0.62028774683929067 1.9243258380670021 0.96204805826638862  -0.37896297887110292 0.92463196144413262 -0.037984161450742369
+0.49380771528505629 1.8461568796683263 1.1666970482192989  -0.50593831119476051 0.84615689033529906 0.16746624198175156
+0.30533374504550748 1.5966764397267301 1.4017661266241017  -0.69455121880115767 0.59667142984001031 0.40197239864759854
+0.53105923500562402 1.7361824646493054 1.4879855916616427  -0.46907539604897591 0.73602315194220469 0.48809649929758631
+0.075674161932997919 0.96204805826638895 1.3797122531607096  -0.92463196144413295 -0.037984161450742494 0.3789629788711022
+0.15384312033167369 1.1666970482192986 1.5061922847149436  -0.84615689033529917 0.16746624198175086 0.50593831119476051
+0.40332356027326965 1.4017661266241013 1.6946662549544924  -0.59667142984000909 0.4019723986475976 0.69455121880115944
+0.26381753535069508 1.4879855916616427 1.4689407649943766  -0.73602315194220436 0.48809649929758508 0.46907539604897769
+0.11589117859806242 1.143241458288871 1.4447847530509048  -0.88414105178604041 0.14399073917102875 0.44447864693329764
+0.24237121015229646 1.0650724998901953 1.6494337430038146  -0.75716571946238043 0.065515668062195359 0.64992905036579174
+0.50349800523024868 0.86049397507742531 1.8567519116990399  -0.49635925754815718 -0.13935172210219426 0.85685972305471036
+0.50349800523024868 1.1395060249225755 1.8567519116990399  -0.49635925754815757 0.13935172210219526 0.85685972305471003
+0.93492750010980485 0.35056625699618549 1.7576287898477037  -0.065515668062194915 -0.64992905036579185 0.75716571946238054
+0.8567585417111292 0.55521524694909519 1.8841088214019377  -0.143990739171027 -0.44447864693329669 0.88414105178604108
+0.83791434325545278 0.93282536162972529 1.9844875864313942  -0.16230850425355092 -0.067102997401377082 0.9844557568457436
+0.61218885329533645 0.79331933670715005 1.898268121393853  -0.38778432700573218 -0.20645471950357122 0.89833165619575761
+1.8841088214019377 1.143241458288871 0.55521524694909519  0.88414105178604052 0.14399073917102762 -0.44447864693329769
+1.7576287898477037 1.0650724998901953 0.35056625699618549  0.75716571946238143 0.06551566806219504 -0.64992905036579074
+1.4965019947697515 0.86049397507742531 0.14324808830096003  0.49635925754815785 -0.13935172210219532 -0.85685972305470992
+1.4965019947697513 1.1395060249225755 0.14324808830096014  0.49635925754815757 0.13935172210219454 -0.85685972305471014
+1.0650724998901953 0.35056625699618549 0.24237121015229646  0.065515668062195706 -0.64992905036579085 -0.7571657194623812
+1.143241458288871 0.55521524694909541 0.11589117859806231  0.14399073917102936 -0.44447864693329703 -0.88414105178604063
+1.1620856567445474 0.93282536162972529 0.015512413568605998  0.16230850425355278 -0.067102997401376527 -0.98445575684574327
+1.3878111467046634 0.79331933670715005 0.10173187860614719  0.38778432700573295 -0.20645471950357144 -0.89833165619575728
+1.1666970482192984 0.4938077152850564 0.15384312033167369  0.16746624198175161 -0.5059383111947614 -0.84615689033529851
+0.96204805826638895 0.62028774683929033 0.07567416193299803  -0.037984161450742585 -0.37896297887110308 -0.92463196144413251
+0.61218885329533657 0.79331933670715005 0.10173187860614719  -0.38778432700574184 -0.20645471950357805 -0.89833165619575206
+0.83791434325545289 0.93282536162972529 0.015512413568605887  -0.16230850425355187 -0.067102997401376666 -0.98445575684574349
+0.11589117859806231 0.85675854171112931 0.55521524694909541  -0.88414105178603941 -0.14399073917102917 -0.44447864693329936
+0.24237121015229635 0.93492750010980485 0.35056625699618549  -0.75716571946237998 -0.065515668062194277 -0.6499290503657924
+0.50349800523024868 1.1395060249225755 0.14324808830096003  -0.49635925754815807 0.13935172210219565 -0.8568597230547097
+0.50349800523024868 0.86049397507742498 0.14324808830096003  -0.49635925754815802 -0.13935172210219071 -0.85685972305471059
+0.1473096109213767 0.85311732979922927 0.49982529754025778  -0.86526167125338915 -0.13902973540249458 -0.48165648852029841
+0.21891562022186895 1.1264800315542343 0.38851819872979687  -0.78064122227310362 0.12697533232366026 -0.6119448889150485
+0.26381753535069463 1.4879855916616429 0.5310592350056238  -0.73602315194220413 0.48809649929758597 -0.46907539604897697
+0.40332356027326977 1.4017661266241015 0.30533374504550737  -0.59667142984001065 0.4019723986475997 -0.69455121880115689
+0.38851819872979698 1.7810843797781313 1.1264800315542343  -0.61194488891504983 0.78064122227310284 0.1269753323236579
+0.38851819872979698 1.7810843797781313 0.87351996844576596  -0.61194488891504895 0.7806412222731034 -0.12697533232365929
+0.53105923500562391 1.7361824646493056 0.51201440833835743  -0.46907539604897519 0.73602315194220569 -0.48809649929758531
+0.30533374504550737 1.5966764397267303 0.59823387337589851  -0.69455121880115733 0.5966714298400102 -0.40197239864759954
+0.35056625699618538 1.7576287898477037 0.93492750010980485  -0.64992905036579185 0.75716571946238054 -0.065515668062194138
+0.55521524694909519 1.8841088214019377 0.8567585417111292  -0.44447864693329786 0.88414105178604041 -0.14399073917102828
+0.93282536162972529 1.9844875864313942 0.83791434325545266  -0.067102997401377457 0.98445575684574349 -0.16230850425355106
+0.79331933670715016 1.898268121393853 0.61218885329533679  -0.20645471950357205 0.89833165619575739 -0.3877843270057324
+1.5061922847149436 1.8461568796683263 1.1666970482192984  0.50593831119476174 0.84615689033529806 0.16746624198175189
+1.3797122531607098 1.9243258380670021 0.96204805826638862  0.37896297887110236 0.92463196144413284 -0.037984161450740857
+1.2066806632928504 1.8982681213938526 0.61218885329533623  0.20645471950357189 0.89833165619575717 -0.38778432700573306
+1.0671746383702752 1.984487586431394 0.83791434325545278  0.067102997401377748 0.98445575684574371 -0.16230850425354995
+1.3797122531607098 1.9243258380670021 1.0379519417336116  0.37896297887110109 0.9246319614441334 0.037984161450741599
+1.5061922847149436 1.8461568796683263 0.83330295178070157  0.50593831119476029 0.84615689033529906 -0.16746624198175192
+1.6946662549544926 1.5966764397267301 0.59823387337589862  0.69455121880115733 0.59667142984001076 -0.40197239864759882
+1.4689407649943764 1.7361824646493054 0.51201440833835765  0.46907539604897786 0.73602315194220436 -0.48809649929758503
+1.9243258380670021 0.96204805826638895 0.62028774683929067  0.92463196144413262 -0.037984161450742376 -0.37896297887110297
+1.8461568796683263 1.1666970482192989 0.49380771528505629  0.84615689033529906 0.16746624198175156 -0.50593831119476051
+1.5966764397267303 1.4017661266241015 0.30533374504550737  0.59667142984001043 0.40197239864759859 -0.69455121880115778
+1.7361824646493054 1.4879855916616427 0.53105923500562402  0.73602315194220469 0.48809649929758631 -0.46907539604897591
+1.9243258380670021 1.0379519417336116 1.3797122531607096  0.92463196144413295 0.037984161450743605 0.37896297887110214
+1.8461568796683263 0.83330295178070157 1.5061922847149436  0.84615689033529851 -0.16746624198175161 0.5059383111947614
+1.5966764397267301 0.59823387337589862 1.6946662549544926  0.59667142984001065 -0.40197239864759882 0.69455121880115733
+1.7361824646493056 0.51201440833835776 1.4689407649943764  0.73602315194220547 -0.48809649929758536 0.46907539604897563
+0.96204805826638895 0.62028774683929067 1.9243258380670021  -0.037984161450742376 -0.37896297887110297 0.92463196144413262
+1.1666970482192989 0.49380771528505629 1.8461568796683263  0.16746624198175186 -0.50593831119476085 0.84615689033529884
+1.4017661266241015 0.30533374504550737 1.5966764397267303  0.40197239864759848 -0.69455121880115778 0.59667142984001043
+1.4879855916616427 0.53105923500562402 1.7361824646493054  0.48809649929758631 -0.46907539604897591 0.73602315194220469
+1.143241458288871 0.55521524694909519 1.8841088214019377  0.1439907391710277 -0.44447864693329725 0.88414105178604063
+1.0650724998901953 0.35056625699618549 1.7576287898477037  0.06551566806219615 -0.64992905036579074 0.75716571946238143
+0.86049397507742531 0.14324808830096003 1.4965019947697515  -0.13935172210219565 -0.85685972305470948 0.49635925754815841
+1.1395060249225755 0.14324808830096014 1.4965019947697515  0.13935172210219443 -0.85685972305471014 0.49635925754815763
+0.35056625699618538 0.24237121015229635 1.0650724998901953  -0.64992905036579096 -0.7571657194623812 0.065515668062195775
+0.55521524694909519 0.11589117859806231 1.143241458288871  -0.4444786469332962 -0.88414105178604108 0.14399073917102925
+0.93282536162972529 0.015512413568605998 1.1620856567445474  -0.067102997401376679 -0.98445575684574338 0.16230850425355256
+0.79331933670715005 0.10173187860614719 1.3878111467046634  -0.20645471950357144 -0.89833165619575728 0.38778432700573295
+0.4938077152850564 0.15384312033167369 1.1666970482192984  -0.5059383111947614 -0.84615689033529851 0.16746624198175114
+0.62028774683929022 0.075674161932997919 0.96204805826638895  -0.37896297887110314 -0.92463196144413251 -0.037984161450742515
+0.79331933670715005 0.10173187860614707 0.61218885329533657  -0.20645471950357444 -0.89833165619575495 -0.3877843270057369
+0.93282536162972529 0.015512413568605887 0.83791434325545289  -0.067102997401376721 -0.98445575684574349 -0.16230850425355176
+0.85675854171112931 0.55521524694909541 0.11589117859806231  -0.14399073917102739 -0.44447864693330652 -0.88414105178603619
+0.93492750010980485 0.35056625699618549 0.24237121015229646  -0.065515668062196844 -0.64992905036579152 -0.75716571946238065
+1.1395060249225755 0.14324808830096003 0.50349800523024868  0.13935172210219565 -0.8568597230547097 -0.49635925754815807
+0.86049397507742498 0.14324808830096003 0.50349800523024868  -0.13935172210219227 -0.85685972305471036 -0.49635925754815791
+0.13944047800987086 0.84405122505983243 0.51657855931435837  -0.86526167125339726 -0.13902973540249861 -0.48165648852028276
+1.1264800315542343 0.38851819872979687 0.21891562022186895  0.12697533232366026 -0.6119448889150485 -0.78064122227310362
+1.4879855916616429 0.5310592350056238 0.26381753535069463  0.48809649929758614 -0.46907539604897636 -0.73602315194220458
+1.4017661266241017 0.30533374504550759 0.40332356027326965  0.40197239864759887 -0.69455121880115778 -0.5966714298400102
+1.7810843797781308 1.1264800315542343 0.38851819872979676  0.78064122227310273 0.12697533232365821 -0.61194488891504994
+1.7810843797781313 0.87351996844576596 0.38851819872979698  0.7806412222731034 -0.12697533232365993 -0.61194488891504883
+1.7361824646493056 0.51201440833835754 0.53105923500562391  0.73602315194220502 -0.48809649929758481 -0.46907539604897686
+1.5966764397267303 0.59823387337589851 0.30533374504550737  0.59667142984000987 -0.40197239864759843 -0.69455121880115811
+1.7576287898477037 0.93492750010980485 0.35056625699618549  0.75716571946238054 -0.065515668062193264 -0.64992905036579207
+1.8841088214019377 0.8567585417111292 0.55521524694909519  0.88414105178604108 -0.143990739171027 -0.44447864693329669
+1.9844875864313942 0.83791434325545289 0.93282536162972529  0.98445575684574349 -0.16230850425355109 -0.067102997401377179
+1.898268121393853 0.61218885329533679 0.79331933670715016  0.89833165619575739 -0.3877843270057324 -0.20645471950357205
+1.8461568796683263 1.1666970482192984 1.5061922847149436  0.84615689033529806 0.16746624198175303 0.50593831119476163
+1.9243258380670021 0.96204805826638895 1.3797122531607096  0.92463196144413273 -0.037984161450741578 0.37896297887110258
+1.8982681213938526 0.61218885329533657 1.2066806632928504  0.89833165619575728 -0.38778432700573251 0.20645471950357247
+1.984487586431394 0.83791434325545289 1.0671746383702752  0.98445575684574349 -0.16230850425355134 0.067102997401377082
+1.8461568796683263 0.83330295178070157 0.49380771528505629  0.84615689033529873 -0.16746624198175111 -0.50593831119476129
+1.9243258380670021 1.0379519417336116 0.62028774683929033  0.92463196144413284 0.03798416145074391 -0.37896297887110225
+1.898268121393853 1.3878111467046637 0.79331933670715005  0.89833165619575739 0.38778432700573245 -0.20645471950357216
+1.984487586431394 1.1620856567445474 0.93282536162972529  0.98445575684574338 0.16230850425355176 -0.067102997401377137
+1.444784753050905 1.8841088214019377 0.8567585417111292  0.44447864693329997 0.88414105178603908 -0.14399073917102956
+1.6494337430038146 1.7576287898477037 0.93492750010980485  0.64992905036579129 0.75716571946238087 -0.065515668062197788
+1.8567519116990399 1.4965019947697513 1.1395060249225755  0.85685972305470981 0.49635925754815813 0.13935172210219413
+1.8567519116990399 1.4965019947697515 0.86049397507742498  0.8568597230547097 0.49635925754815835 -0.1393517221021946
+0.62028774683929067 0.075674161932997919 1.0379519417336116  -0.37896297887110292 -0.92463196144413262 0.037984161450742605
+0.15304821643557709 0.8581878051094145 0.48898817612201739  -0.84473325897900975 -0.12764403935075935 -0.51974293683793626
+0.85818780510941439 0.48898817612201739 0.15304821643557714  -0.12764403935075883 -0.51974293683794082 -0.8447332589790072
+0.78429103445404746 0.6100181237981781 0.10563529941394456  -0.22723563663234525 -0.37239734211022069 -0.89982453013547925
+0.075674161932997919 1.0379519417336116 0.62028774683929067  -0.92463196144413262 0.037984161450742605 -0.37896297887110292
+0.76032257344343512 0.64081678241520534 0.098941938751961195  -0.22723563663234739 -0.3723973421102092 -0.89982453013548358
+0.271410708194047 0.90595336478045674 0.32286639405373119  -0.73279395097327127 -0.089584884642379445 -0.67452766723137059
+0.25671454238163 0.90442701067601727 0.33903474443581866  -0.73279395097326483 -0.089584884642380458 -0.67452766723137736
+0.55521524694909541 0.11589117859806231 0.85675854171112931  -0.44447864693330141 -0.88414105178603852 -0.14399073917102853
+0.35056625699618549 0.24237121015229635 0.93492750010980485  -0.64992905036579296 -0.75716571946237954 -0.06551566806219436
+0.14324808830096003 0.50349800523024868 1.1395060249225755  -0.8568597230547097 -0.49635925754815807 0.13935172210219565
+0.14324808830096003 0.50349800523024868 0.86049397507742498  -0.85685972305470748 -0.49635925754815546 -0.13935172210221758
+0.24237121015229646 0.93492750010980485 1.6494337430038146  -0.75716571946238009 -0.065515668062194124 0.6499290503657924
+0.11589117859806231 0.8567585417111292 1.4447847530509046  -0.88414105178604052 -0.1439907391710287 0.44447864693329747
+0.015512413568605887 0.83791434325545289 1.0671746383702749  -0.98445575684574349 -0.16230850425355201 0.067102997401376541
+0.10173187860614707 0.61218885329533657 1.2066806632928497  -0.89833165619575683 -0.3877843270057334 0.2064547195035728
+0.68777595190194307 0.71884915497263779 0.093588483842681286  -0.30687826798314916 -0.2927056677356249 -0.90562084821138278
+0.38851819872979687 0.21891562022186895 1.1264800315542343  -0.61194488891504861 -0.78064122227310373 0.12697533232365907
+0.5310592350056238 0.26381753535069463 1.4879855916616429  -0.46907539604897669 -0.73602315194220391 0.48809649929758669
+0.30533374504550759 0.40332356027326965 1.4017661266241017  -0.69455121880115778 -0.5966714298400102 0.40197239864759887
+1.1264800315542343 0.38851819872979665 1.7810843797781311  0.12697533232365815 -0.61194488891505006 0.78064122227310273
+0.87351996844576596 0.38851819872979698 1.7810843797781313  -0.12697533232365973 -0.61194488891504917 0.78064122227310306
+0.51201440833835754 0.53105923500562391 1.7361824646493056  -0.48809649929758481 -0.46907539604897686 0.73602315194220502
+0.59823387337589851 0.30533374504550737 1.5966764397267303  -0.40197239864759932 -0.69455121880115789 0.59667142984000965
+0.24237121015229646 1.0650724998901953 0.35056625699618549  -0.75716571946238131 0.065515668062194596 -0.64992905036579096
+0.11589117859806231 1.143241458288871 0.55521524694909541  -0.88414105178604085 0.14399073917102956 -0.44447864693329636
+0.015512413568605998 1.1620856567445474 0.93282536162972529  -0.98445575684574338 0.16230850425355256 -0.067102997401376679
+0.10173187860614707 1.3878111467046637 0.79331933670715005  -0.89833165619575717 0.38778432700573334 -0.20645471950357158
+0.15384312033167369 0.83330295178070157 1.5061922847149436  -0.84615689033529817 -0.16746624198175178 0.50593831119476174
+0.075674161932997919 1.0379519417336116 1.3797122531607096  -0.92463196144413262 0.037984161450743181 0.37896297887110275
+0.1017318786061473 1.3878111467046637 1.2066806632928504  -0.89833165619575706 0.38778432700573334 0.206454719503572
+0.015512413568605998 1.1620856567445474 1.0671746383702752  -0.98445575684574316 0.16230850425355273 0.067102997401378234
+1.589425686808948 1.2073123918032649 1.7807681678543315  0.58928970592655772 0.20735457304096819 0.78085960551688727
+1.5760838378857436 1.3399483569044259 1.7433454959605346  0.5761012769843733 0.34013694034011327 0.74324570666303924
+1.4048073899588975 1.8217822259851766 1.4010049252683978  0.40477696304846178 0.82172156155092024 0.40115992505181941
+1.2746684461261839 1.8657421844304012 1.4183870394745819  0.27447137325094723 0.86581974808662054 0.41835586417422205
+0.66075903908278355 1.8623045076538935 1.3759607778954341  -0.33912378489964728 0.86229745711633865 0.37608264246842604
+0.59367059745735751 1.7843712383737109 1.4686770498343507  -0.40646863937642724 0.78424095119900916 0.46877433341208991
+0.38553016581808797 1.2728788208449453 1.7402458861856145  -0.6143669885099533 0.27300775118978038 0.74028370995146842
+0.47420617247402486 1.2082874004879671 1.8247164420172246  -0.52568280774650444 0.208139674214636 0.82482450355065051
+0.95947771833128337 0.86807143088604799 1.9904306120773461  -0.04057589556541806 -0.13176921185868271 0.99044963097837824
+1.0813709460566905 0.93361895436178288 1.9944708773603259  0.08157879688761252 -0.066331699036312225 0.99445714115859507
+1.0405222816687167 0.86807143088604799 0.009569387922653938  0.040575895565417595 -0.13176921185868218 -0.99044963097837835
+0.91862905394331018 0.93361895436178288 0.0055291226396741999  -0.081578796887611896 -0.066331699036312711 -0.99445714115859507
+0.41057431319105175 1.2073123918032649 0.21923183214566866  -0.58928970592655894 0.20735457304096755 -0.7808596055168866
+0.42391616211425609 1.3399483569044259 0.25665450403946555  -0.57610127698437241 0.34013694034011416 -0.74324570666303957
+0.5951926100411028 1.8217822259851768 0.59899507473160252  -0.40477696304846117 0.82172156155092091 -0.40115992505181874
+0.72533155387381631 1.8657421844304012 0.58161296052541867  -0.2744713732509485 0.86581974808662021 -0.41835586417422188
+1.3392409609172167 1.8623045076538935 0.6240392221045663  0.33912378489964923 0.86229745711633876 -0.37608264246842382
+1.4063294025426429 1.7843712383737109 0.53132295016564957  0.40646863937642858 0.78424095119900894 -0.46877433341208929
+1.6144698341819124 1.2728788208449453 0.25975411381438585  0.61436698850995342 0.27300775118978016 -0.74028370995146853
+1.5257938275259753 1.2082874004879671 0.1752835579827754  0.52568280774650489 0.20813967421463658 -0.82482450355065007
+1.2728788208449453 0.25975411381438585 1.6144698341819124  0.27300775118978016 -0.74028370995146853 0.61436698850995342
+1.2082874004879671 0.1752835579827754 1.5257938275259753  0.20813967421463603 -0.8248245035506494 0.525682807746506
+0.86807143088604799 0.009569387922653938 1.0405222816687167  -0.13176921185868143 -0.99044963097837846 0.040575895565418837
+0.93361895436178288 0.0055291226396741999 0.91862905394331018  -0.066331699036312766 -0.99445714115859507 -0.081578796887611951
+1.2073123918032649 0.21923183214566866 0.41057431319105175  0.20735457304096766 -0.78085960551688627 -0.58928970592655927
+1.3399483569044259 0.25665450403946555 0.42391616211425609  0.34013694034011571 -0.74324570666303824 -0.5761012769843733
+1.8217822259851768 0.59899507473160252 0.5951926100411028  0.82172156155092047 -0.4011599250518193 -0.4047769630484615
+1.8657421844304012 0.58161296052541867 0.72533155387381631  0.86581974808662021 -0.41835586417422188 -0.2744713732509485
+1.8623045076538935 0.6240392221045663 1.3392409609172167  0.86229745711633843 -0.37608264246842488 0.33912378489964895
+1.7843712383737111 0.53132295016564979 1.4063294025426427  0.78424095119900827 -0.46877433341208979 0.40646863937642919
+1.7807681678543315 1.589425686808948 1.2073123918032649  0.78085960551688727 0.58928970592655805 0.20735457304096708
+1.7433454959605346 1.5760838378857436 1.3399483569044259  0.74324570666303935 0.57610127698437341 0.34013694034011333
+0.70892487408416871 0.69813515078208477 0.093116941936638747  -0.30687826798315099 -0.29270566773562362 -0.90562084821138278
+0.64081678241520534 0.098941938751961223 0.76032257344343512  -0.37239734211021625 -0.89982453013548147 -0.227235636632344
+0.009569387922654049 0.95947771833128337 1.1319285691139529  -0.99044963097837835 -0.040575895565418178 0.13176921185868237
+0.0055291226396743109 1.0813709460566903 1.0663810456382175  -0.99445714115859496 0.08157879688761259 0.066331699036313585
+0.59899507473160252 0.5951926100411028 1.8217822259851768  -0.40115992505181913 -0.40477696304846172 0.82172156155092035
+0.58161296052541844 0.72533155387381609 1.865742184430401  -0.41835586417422188 -0.274471373250949 0.8658197480866201
+0.1376954923461069 1.3759607778954341 1.3392409609172171  -0.86229745711633821 0.37608264246842543 0.33912378489964906
+0.21562876162628963 1.4686770498343507 1.4063294025426434  -0.78424095119900883 0.46877433341208991 0.40646863937642791
+1.0405222816687167 1.1319285691139529 1.9904306120773461  0.040575895565417158 0.13176921185868218 0.99044963097837835
+0.91862905394331007 1.0663810456382177 1.9944708773603259  -0.081578796887612715 0.066331699036312017 0.99445714115859507
+1.3759607778954341 0.66075903908278355 1.8623045076538935  0.37608264246842604 -0.33912378489964728 0.86229745711633865
+1.4686770498343507 0.59367059745735751 1.7843712383737109  0.46877433341209013 -0.40646863937642613 0.78424095119900972
+1.4010049252683978 1.4048073899588975 1.8217822259851766  0.40115992505181941 0.40477696304846178 0.82172156155092024
+1.4183870394745819 1.2746684461261839 1.8657421844304007  0.41835586417422194 0.27447137325094784 0.86581974808662043
+1.8217822259851766 1.4010049252683978 1.4048073899588975  0.82172156155092024 0.40115992505181941 0.40477696304846172
+1.8657421844304007 1.4183870394745819 1.2746684461261839  0.86581974808662043 0.41835586417422188 0.27447137325094778
+1.2073123918032649 1.7807681678543315 1.589425686808948  0.20735457304096708 0.78085960551688738 0.58928970592655816
+1.3399483569044259 1.7433454959605346 1.5760838378857436  0.34013694034011333 0.74324570666303935 0.57610127698437341
+1.1319285691139529 1.9904306120773461 1.0405222816687167  0.13176921185868118 0.99044963097837846 0.0405758955654189
+1.0663810456382175 1.9944708773603257 0.91862905394330985  0.066331699036312725 0.99445714115859496 -0.081578796887614116
+0.72712117915505503 1.7402458861856145 1.6144698341819124  -0.27300775118977944 0.74028370995146831 0.61436698850995397
+0.79171259951203343 1.8247164420172246 1.5257938275259759  -0.20813967421463386 0.82482450355065062 0.525682807746505
+0.25975411381438585 1.6144698341819124 1.2728788208449453  -0.74028370995146864 0.61436698850995364 0.27300775118977916
+0.17528355798277562 1.5257938275259757 1.2082874004879671  -0.82482450355065007 0.52568280774650511 0.20813967421463572
+0.6240392221045663 1.3392409609172167 1.8623045076538935  -0.37608264246842488 0.33912378489964895 0.86229745711633843
+0.53132295016564979 1.4063294025426427 1.7843712383737111  -0.46877433341208979 0.40646863937642919 0.78424095119900827
+0.41057431319105175 0.79268760819673556 1.7807681678543315  -0.58928970592655816 -0.20735457304096597 0.7808596055168876
+0.4239161621142562 0.66005164309557451 1.7433454959605346  -0.57610127698437363 -0.34013694034011427 0.74324570666303869
+1.3759607778954341 1.3392409609172167 0.13769549234610667  0.37608264246842449 0.3391237848996484 -0.86229745711633887
+1.4686770498343509 1.4063294025426429 0.21562876162628941  0.46877433341209057 0.40646863937642802 -0.7842409511990085
+1.589425686808948 0.79268760819673556 0.21923183214566844  0.58928970592655916 -0.20735457304096744 -0.78085960551688649
+1.5760838378857438 0.66005164309557429 0.25665450403946544  0.57610127698437286 -0.34013694034011538 -0.74324570666303869
+0.95947771833128337 1.1319285691139529 0.009569387922654049  -0.040575895565417922 0.13176921185868251 -0.99044963097837835
+1.0813709460566903 1.0663810456382175 0.0055291226396743109  0.08157879688761259 0.066331699036313585 -0.99445714115859496
+0.61001812379817832 0.1056352994139447 0.78429103445404746  -0.37239734211020237 -0.89982453013548536 -0.22723563663235108
+0.90595336478045685 0.32286639405373119 0.271410708194047  -0.089584884642385398 -0.67452766723137236 -0.73279395097326894
+0.59899507473160241 1.4048073899588978 0.17821777401482342  -0.40115992505181897 0.40477696304846394 -0.82172156155091935
+0.58161296052541844 1.2746684461261841 0.13425781556959904  -0.41835586417422088 0.27447137325094884 -0.86581974808662066
+0.17821777401482353 1.401004925268398 0.59519261004110269  -0.8217215615509198 0.40115992505182052 -0.40477696304846172
+0.13425781556959915 1.4183870394745819 0.72533155387381609  -0.86581974808661999 0.41835586417422255 -0.27447137325094828
+0.79268760819673556 1.7807681678543315 0.41057431319105175  -0.20735457304096583 0.78085960551688727 -0.58928970592655872
+0.66005164309557451 1.7433454959605346 0.4239161621142562  -0.34013694034011521 0.74324570666303824 -0.57610127698437341
+0.86807143088604799 1.9904306120773461 0.95947771833128337  -0.13176921185868209 0.99044963097837835 -0.040575895565419483
+0.93361895436178288 1.9944708773603257 1.0813709460566903  -0.066331699036312475 0.99445714115859507 0.081578796887612298
+1.2728788208449453 1.7402458861856145 0.38553016581808797  0.27300775118978021 0.74028370995146786 -0.61436698850995419
+1.2082874004879671 1.8247164420172246 0.47420617247402486  0.20813967421463464 0.82482450355065107 -0.52568280774650411
+1.7402458861856145 1.6144698341819124 0.72712117915505503  0.74028370995146831 0.61436698850995408 -0.27300775118977905
+1.8247164420172244 1.5257938275259757 0.79171259951203343  0.82482450355065062 0.52568280774650489 -0.20813967421463392
+1.7402458861856145 0.38553016581808797 1.2728788208449453  0.74028370995146764 -0.61436698850995397 0.27300775118978082
+1.8247164420172246 0.47420617247402486 1.2082874004879671  0.82482450355065073 -0.52568280774650411 0.20813967421463583
+1.6144698341819124 0.72712117915505503 1.7402458861856145  0.61436698850995397 -0.27300775118977944 0.74028370995146831
+1.5257938275259757 0.79171259951203343 1.8247164420172244  0.52568280774650489 -0.20813967421463392 0.82482450355065062
+1.3392409609172169 0.13769549234610667 1.3759607778954344  0.33912378489964889 -0.86229745711633821 0.37608264246842549
+1.4063294025426429 0.21562876162628941 1.4686770498343509  0.4064686393764278 -0.78424095119900883 0.46877433341209013
+0.79268760819673556 0.21923183214566844 1.589425686808948  -0.20735457304096744 -0.78085960551688649 0.58928970592655916
+0.66005164309557429 0.25665450403946544 1.5760838378857438  -0.34013694034011538 -0.74324570666303869 0.57610127698437286
+1.1319285691139529 0.009569387922654049 0.95947771833128337  0.13176921185868237 -0.99044963097837835 -0.040575895565418178
+1.0663810456382175 0.0055291226396743109 1.0813709460566903  0.066331699036313585 -0.99445714115859496 0.08157879688761259
+0.90442701067601738 0.33903474443581871 0.25671454238163005  -0.089584884642383483 -0.67452766723137381 -0.73279395097326772
+0.43210633013751587 0.18610643753537565 0.88125255845135109  -0.58292813064721283 -0.80326578355000344 -0.12230648174951704
+1.4048073899588978 0.17821777401482342 0.59899507473160241  0.40477696304846228 -0.82172156155092002 -0.40115992505181963
+1.2746684461261841 0.13425781556959904 0.58161296052541844  0.27447137325094884 -0.86581974808662066 -0.41835586417422088
+1.401004925268398 0.59519261004110269 0.17821777401482342  0.40115992505182074 -0.40477696304846195 -0.82172156155091947
+1.4183870394745819 0.72533155387381609 0.13425781556959915  0.41835586417422255 -0.27447137325094828 -0.86581974808661999
+1.7807681678543315 0.41057431319105175 0.79268760819673556  0.78085960551688716 -0.5892897059265586 -0.20735457304096627
+1.7433454959605346 0.4239161621142562 0.66005164309557451  0.74324570666303835 -0.57610127698437386 -0.34013694034011444
+1.9904306120773461 0.95947771833128337 0.86807143088604799  0.99044963097837824 -0.040575895565418393 -0.13176921185868273
+1.9944708773603259 1.0813709460566905 0.93361895436178288  0.99445714115859507 0.08157879688761252 -0.066331699036312322
+1.9904306120773461 1.0405222816687167 1.1319285691139529  0.99044963097837835 0.040575895565417151 0.13176921185868218
+1.9944708773603259 0.91862905394331018 1.0663810456382175  0.99445714115859507 -0.081578796887612715 0.066331699036311934
+1.8623045076538935 1.3759607778954341 0.66075903908278355  0.8622974571163381 0.37608264246842577 -0.33912378489964878
+1.7843712383737109 1.4686770498343507 0.59367059745735751  0.78424095119900927 0.46877433341208991 -0.40646863937642724
+0.15594877494016779 0.48342144068564119 0.86055952199012919  -0.83662429167606378 -0.52971449507545854 -0.13950752053017287
+0.10851189307750805 0.59819314586024896 0.79307076339523386  -0.88183387534488278 -0.42350808342754087 -0.20738833035095483
+0.09404663521954322 0.6771336059462687 0.72858929180595311  -0.9113637377256294 -0.30990719304796421 -0.27087574504909456
+0.095052466200525557 0.7378162794185118 0.66704995977036108  -0.90406837259895945 -0.26739523938910503 -0.33340690397517614
+0.10617487126239186 0.78594000042913037 0.60770816150558549  -0.89197584375894823 -0.22324532177533518 -0.39311654818379149
+0.12458499692215494 0.8241658611683842 0.55121954142464069  -0.87543631012341916 -0.17844712110944894 -0.44918580997761093
+0.21923183214566866 0.41057431319105175 1.2073123918032649  -0.78085960551688627 -0.58928970592655927 0.20735457304096766
+0.25665450403946555 0.42391616211425609 1.3399483569044259  -0.74324570666303813 -0.5761012769843733 0.34013694034011566
+0.17821777401482342 0.59899507473160241 1.4048073899588978  -0.82172156155091991 -0.40115992505181963 0.40477696304846228
+0.13425781556959904 0.58161296052541844 1.2746684461261841  -0.86581974808662054 -0.41835586417422083 0.27447137325094884
+0.59519261004110269 0.17821777401482342 1.401004925268398  -0.40477696304846195 -0.82172156155091958 0.40115992505182074
+0.72533155387381609 0.13425781556959915 1.4183870394745819  -0.27447137325094828 -0.86581974808661999 0.41835586417422255
+0.21923183214566844 1.589425686808948 0.79268760819673556  -0.78085960551688649 0.58928970592655916 -0.20735457304096744
+0.25665450403946544 1.5760838378857438 0.66005164309557429  -0.74324570666303857 0.57610127698437308 -0.34013694034011499
+0.009569387922653938 1.0405222816687167 0.86807143088604799  -0.99044963097837846 0.040575895565418837 -0.13176921185868143
+0.0055291226396741999 0.91862905394331018 0.93361895436178288  -0.99445714115859507 -0.081578796887611951 -0.066331699036312766
+1.2681715176003199 1.6892965611519348 1.6730187872058684  0.26836446324215041 0.68937955050281385 0.67285685715261201
+1.1930054401955474 1.624572621678267 1.7567416602149373  0.19358827458119485 0.62484261256047702 0.75636980999592618
+1.0397345885584115 1.2602649483574222 1.9647192955096329  0.039677999129163623 0.25990051397960201 0.96481986879326065
+1.1598578035878231 1.1993769697289565 1.9667958970608925  0.16010344242024382 0.19913925651268607 0.96680424297825784
+0.86172631781262787 1.7695778385021761 1.6234022291431622  -0.13836216352689407 0.7697253903424921 0.6232003972770358
+0.93272292597567796 1.7022770253220765 1.7087176976875216  -0.067501320615789479 0.70276863564904057 0.7082088791190847
+1.2840795446225892 1.4603930887008656 1.8410333026720758  0.2844071777740565 0.46019616855581291 0.84103034646625319
+1.3714973697248309 1.527772526934267 1.7638362809535499  0.37176976328895928 0.52785497534634074 0.7636467561027056
+0.64637064705828351 1.4655650436231658 1.8112924693932408  -0.3538769830587436 0.46550486715932332 0.81121902067950946
+0.76541504139377881 1.515716029243271 1.8240187342392595  -0.23530638500725812 0.51562318151862252 0.82387113061171746
+1.1358362255269414 1.7199153070653641 1.6806397508870434  0.13609530337963516 0.72008099426245709 0.6804126910192051
+1.069740197633309 1.800472340674919 1.5952985273360614  0.069662907281837133 0.80067536950372653 0.59503447968929735
+0.91971872264975896 1.1973935260228461 1.9770315820848792  -0.080345839839678926 0.19714040391717355 0.97707738033577995
+0.92229559635619029 1.3227105890477233 1.943302656293743  -0.077926023088563279 0.32203490693742909 0.94351526412634257
+0.79987185965655649 1.6801807185069524 1.7051970771451348  -0.20029565457621065 0.68040299513329383 0.70493504308661681
+0.671604442794689 1.6406145370870961 1.694096083320241  -0.32871571883365269 0.64057192708348298 0.69398384882086983
+1.3040127948790106 1.3356672082102183 1.8915737467434819  0.30422052318316728 0.33550256744406826 0.89156486051918749
+1.1865609960788062 1.3899876630720454 1.901723137883069  0.18714545413041681 0.38953622755322004 0.9017971537002798
+0.74047778163550215 1.3961011738843632 1.8807678912304873  -0.25988482570664379 0.39599581735923722 0.88070834559541733
+0.72730018625934878 1.2691171673622654 1.9236940845413728  -0.27282039415738818 0.26880216379452343 0.92375019852295004
+0.69598720512098966 1.3356672082102183 0.10842625325651789  -0.30422052318316778 0.33550256744406898 -0.89156486051918715
+0.81343900392119461 1.3899876630720456 0.098276862116930652  -0.18714545413041631 0.38953622755321826 -0.90179715370028068
+1.2595222183644981 1.3961011738843632 0.11923210876951273  0.25988482570664384 0.39599581735923561 -0.880708345595418
+1.2726998137406516 1.2691171673622654 0.076305915458627416  0.27282039415738835 0.26880216379452399 -0.92375019852294971
+0.73182848239968035 1.6892965611519353 0.32698121279413161  -0.26836446324215124 0.68937955050281363 -0.67285685715261212
+0.80699455980445256 1.624572621678267 0.24325833978506284  -0.19358827458119462 0.62484261256047724 -0.75636980999592607
+0.96026541144158861 1.2602649483574222 0.035280704490367243  -0.039677999129163956 0.25990051397960023 -0.96481986879326109
+0.84014219641217736 1.1993769697289565 0.033204102939107361  -0.16010344242024258 0.19913925651268685 -0.96680424297825795
+1.1382736821873722 1.7695778385021763 0.37659777085683765  0.13836216352689579 0.76972539034249088 -0.62320039727703691
+1.0672770740243225 1.7022770253220765 0.29128230231247831  0.06750132061579224 0.70276863564903991 -0.70820887911908514
+0.71592045537741122 1.4603930887008656 0.15896669732792434  -0.28440717777405777 0.46019616855581397 -0.8410303464662523
+0.62850263027516917 1.5277725269342675 0.23616371904645006  -0.37176976328895817 0.52785497534633852 -0.76364675610270771
+1.3536293529417167 1.4655650436231658 0.18870753060675938  0.35387698305874377 0.46550486715932554 -0.81121902067950813
+1.2345849586062212 1.515716029243271 0.17598126576074047  0.23530638500725851 0.51562318151862285 -0.82387113061171713
+0.86416377447305925 1.7199153070653641 0.31936024911295635  -0.13609530337963502 0.72008099426245653 -0.68041269101920565
+0.93025980236669126 1.800472340674919 0.40470147266393852  -0.069662907281837452 0.80067536950372609 -0.59503447968929812
+1.0802812773502413 1.1973935260228461 0.022968417915120942  0.080345839839678773 0.19714040391717294 -0.97707738033578007
+1.0777044036438097 1.3227105890477233 0.056697343706257008  0.077926023088562973 0.32203490693742876 -0.94351526412634279
+1.2001281403434438 1.6801807185069524 0.29480292285486542  0.20029565457621254 0.68040299513329228 -0.7049350430866177
+1.3283955572053112 1.6406145370870961 0.30590391667975925  0.32871571883365136 0.64057192708348476 -0.69398384882086883
+1.1973935260228461 0.022968417915120942 1.0802812773502413  0.19714040391717294 -0.97707738033578007 0.080345839839678773
+1.3227105890477233 0.056697343706257008 1.0777044036438097  0.32203490693742876 -0.94351526412634279 0.077926023088562973
+1.6801807185069524 0.29480292285486542 1.2001281403434438  0.68040299513329183 -0.70493504308661803 0.20029565457621279
+1.6406145370870961 0.30590391667975925 1.3283955572053112  0.64057192708348487 -0.69398384882086883 0.32871571883365136
+1.3356672082102183 0.10842625325651789 0.69598720512098966  0.33550256744406898 -0.89156486051918715 -0.30422052318316783
+1.3899876630720456 0.098276862116930652 0.81343900392119461  0.38953622755321932 -0.90179715370028013 -0.18714545413041672
+1.3961011738843634 0.11923210876951296 1.2595222183644981  0.39599581735923683 -0.88070834559541722 0.25988482570664478
+1.2691171673622654 0.076305915458627416 1.2726998137406516  0.26880216379452404 -0.92375019852294993 0.27282039415738796
+1.6892965611519353 0.32698121279413161 0.73182848239968035  0.68937955050281352 -0.67285685715261212 -0.2683644632421518
+1.624572621678267 0.24325833978506284 0.80699455980445256  0.62484261256047746 -0.75636980999592596 -0.19358827458119449
+1.2602649483574222 0.035280704490367243 0.96026541144158861  0.25990051397960084 -0.96481986879326098 -0.039677999129164913
+1.1993769697289565 0.033204102939107361 0.84014219641217736  0.19913925651268685 -0.96680424297825795 -0.16010344242024258
+1.7695778385021763 0.37659777085683765 1.1382736821873722  0.76972539034249088 -0.62320039727703691 0.13836216352689579
+1.7022770253220765 0.29128230231247831 1.0672770740243225  0.70276863564903991 -0.70820887911908514 0.067501320615792754
+1.4603930887008658 0.15896669732792446 0.715920455377411  0.4601961685558133 -0.84103034646625308 -0.28440717777405633
+1.5277725269342675 0.23616371904645006 0.62850263027516917  0.52785497534633796 -0.76364675610270782 -0.37176976328895855
+1.465565043623166 0.18870753060675938 1.3536293529417167  0.46550486715932482 -0.81121902067950868 0.35387698305874349
+1.5157160292432712 0.17598126576074069 1.2345849586062212  0.51562318151862307 -0.82387113061171713 0.23530638500725842
+1.7199153070653641 0.31936024911295635 0.86416377447305925  0.72008099426245731 -0.68041269101920498 -0.13609530337963452
+1.800472340674919 0.40470147266393852 0.93025980236669126  0.80067536950372609 -0.59503447968929812 -0.069662907281837452
+1.6730187872058684 1.2681715176003199 1.689296561151935  0.67285685715261145 0.26836446324215008 0.68937955050281474
+1.7567416602149373 1.1930054401955474 1.624572621678267  0.75636980999592585 0.19358827458119357 0.62484261256047779
+1.9647192955096329 1.0397345885584115 1.2602649483574222  0.96481986879326043 0.039677999129164962 0.25990051397960284
+1.9667958970608925 1.1598578035878231 1.1993769697289565  0.96680424297825784 0.16010344242024382 0.19913925651268607
+0.91971872264975896 0.80260647397715423 0.022968417915120942  -0.080345839839677718 -0.19714040391717277 -0.97707738033578018
+0.92229559635619041 0.67728941095227668 0.056697343706257008  -0.077926023088561627 -0.32203490693742876 -0.94351526412634279
+0.17773204761375266 0.87689701064830428 0.44478929974988746  -0.84318764111161215 -0.16797909143372139 -0.51070307098913825
+0.88304523202927676 0.18950565604187922 0.42721864490060907  -0.10453117536509746 -0.80855713981694288 -0.57905836064064908
+0.108426253256518 1.3040127948790108 0.66433279178978188  -0.89156486051918693 0.30422052318316734 -0.33550256744406998
+0.098276862116931096 1.1865609960788062 0.61001233692795442  -0.90179715370027969 0.18714545413041742 -0.38953622755321982
+0.21254447256850684 0.89390471712616404 0.39369586600014284  -0.79156802282425309 -0.094036448520742069 -0.60380229511961003
+0.076305915458627194 0.72730018625934878 0.73088283263773501  -0.92375019852295015 -0.27282039415738796 -0.2688021637945231
+0.37659777085683765 1.1382736821873722 1.7695778385021763  -0.62320039727703691 0.13836216352689526 0.76972539034249088
+0.29128230231247831 1.0672770740243225 1.7022770253220765  -0.70820887911908481 0.067501320615792504 0.70276863564904024
+0.15896669732792446 0.715920455377411 1.4603930887008658  -0.84103034646625308 -0.28440717777405627 0.4601961685558133
+0.23616371904645006 0.62850263027516917 1.5277725269342675  -0.76364675610270738 -0.37176976328895911 0.5278549753463383
+0.53443495637683469 1.8112924693932411 1.3536293529417167  -0.4655048671593231 0.81121902067950979 0.35387698305874316
+0.48428397075672935 1.8240187342392595 1.2345849586062212  -0.51562318151862385 0.82387113061171635 0.2353063850072592
+0.280084692934636 1.6806397508870434 0.86416377447305925  -0.72008099426245697 0.68041269101920498 -0.13609530337963563
+0.1995276593250811 1.5952985273360616 0.93025980236669126  -0.80067536950372598 0.59503447968929823 -0.069662907281837577
+0.69598720512098988 0.66433279178978188 1.8915737467434823  -0.30422052318316639 -0.3355025674440687 0.89156486051918771
+0.81343900392119473 0.61001233692795442 1.9017231378830692  -0.18714545413041667 -0.38953622755321821 0.90179715370028057
+1.2595222183644981 0.60389882611563706 1.8807678912304873  0.25988482570664329 -0.39599581735923711 0.88070834559541755
+1.2726998137406516 0.73088283263773501 1.9236940845413728  0.27282039415738824 -0.26880216379452393 0.92375019852294982
+1.8112924693932408 0.64637064705828351 1.4655650436231658  0.81121902067950946 -0.3538769830587436 0.46550486715932332
+1.8240187342392593 0.76541504139377881 1.5157160292432708  0.82387113061171735 -0.2353063850072582 0.51562318151862263
+1.6806397508870434 1.1358362255269414 1.7199153070653641  0.68041269101920587 0.13609530337963541 0.72008099426245631
+1.5952985273360614 1.069740197633309 1.800472340674919  0.59503447968929812 0.069662907281837633 0.80067536950372609
+1.6234022291431622 0.86172631781262787 1.7695778385021761  0.6232003972770358 -0.13836216352689407 0.7697253903424921
+1.7087176976875216 0.93272292597567796 1.7022770253220765  0.7082088791190847 -0.067501320615789479 0.70276863564904057
+1.8410333026720758 1.2840795446225892 1.4603930887008656  0.84103034646625274 0.28440717777405616 0.46019616855581397
+1.7638362809535497 1.3714973697248309 1.5277725269342677  0.7636467561027056 0.37176976328895911 0.52785497534634074
+1.7695778385021761 1.6234022291431622 0.86172631781262787  0.7697253903424921 0.6232003972770358 -0.13836216352689407
+1.7022770253220765 1.7087176976875216 0.93272292597567796  0.70276863564904057 0.7082088791190847 -0.067501320615789479
+1.4603930887008656 1.8410333026720758 1.2840795446225892  0.46019616855581291 0.8410303464662533 0.2844071777740565
+1.527772526934267 1.7638362809535499 1.3714973697248309  0.52785497534634085 0.76364675610270538 0.37176976328895955
+1.6892965611519348 1.6730187872058684 1.2681715176003199  0.68937955050281474 0.67285685715261145 0.26836446324214996
+1.624572621678267 1.7567416602149373 1.1930054401955474  0.62484261256047757 0.75636980999592585 0.19358827458119429
+1.2602649483574224 1.9647192955096329 1.0397345885584115  0.25990051397960312 0.96481986879326032 0.039677999129165198
+1.1993769697289565 1.9667958970608925 1.1598578035878231  0.19913925651268596 0.96680424297825795 0.16010344242024366
+0.66433279178978188 1.8915737467434823 0.69598720512098966  -0.33550256744406876 0.89156486051918749 -0.30422052318316672
+0.61001233692795442 1.9017231378830692 0.8134390039211945  -0.38953622755321837 0.90179715370028057 -0.18714545413041681
+0.60389882611563706 1.8807678912304873 1.2595222183644981  -0.39599581735923706 0.88070834559541744 0.25988482570664329
+0.73088283263773501 1.9236940845413728 1.2726998137406516  -0.26880216379452393 0.92375019852294982 0.27282039415738824
+0.80260647397715423 1.9770315820848792 1.0802812773502413  -0.19714040391717205 0.9770773803357804 0.080345839839677455
+0.67728941095227668 1.9433026562937428 1.0777044036438097  -0.32203490693742876 0.9435152641263429 0.077926023088562071
+0.3198192814930475 1.7051970771451346 1.2001281403434438  -0.68040299513329328 0.70493504308661703 0.2002956545762111
+0.35938546291290407 1.694096083320241 1.3283955572053112  -0.64057192708348432 0.69398384882086939 0.32871571883365119
+0.022968417915120942 1.0802812773502413 1.1973935260228461  -0.97707738033578007 0.080345839839678773 0.19714040391717294
+0.056697343706257008 1.0777044036438097 1.3227105890477233  -0.94351526412634279 0.077926023088562973 0.32203490693742876
+0.29480292285486542 1.2001281403434438 1.6801807185069524  -0.70493504308661814 0.20029565457621162 0.68040299513329205
+0.30590391667975925 1.3283955572053112 1.6406145370870961  -0.69398384882086872 0.3287157188336513 0.64057192708348476
+0.18870753060675938 1.3536293529417167 1.465565043623166  -0.81121902067950868 0.35387698305874349 0.46550486715932482
+0.17598126576074069 1.2345849586062212 1.5157160292432712  -0.82387113061171702 0.23530638500725842 0.51562318151862307
+0.31936024911295646 0.86416377447305925 1.7199153070653639  -0.68041269101920498 -0.1360953033796338 0.72008099426245742
+0.40470147266393852 0.93025980236669126 1.800472340674919  -0.59503447968929812 -0.069662907281837008 0.80067536950372609
+0.73182848239968035 0.31070343884806495 1.6730187872058686  -0.26836446324215152 -0.6893795505028123 0.67285685715261345
+0.80699455980445256 0.37542737832173323 1.7567416602149373  -0.19358827458119554 -0.62484261256047757 0.75636980999592562
+0.96026541144158861 0.73973505164257791 1.9647192955096329  -0.039677999129162395 -0.25990051397960112 0.96481986879326098
+0.84014219641217736 0.80062303027104387 1.9667958970608925  -0.16010344242024249 -0.19913925651268491 0.96680424297825829
+1.8112924693932411 1.3536293529417167 0.53443495637683469  0.81121902067951035 0.35387698305874343 -0.46550486715932188
+1.8240187342392595 1.2345849586062212 0.48428397075672935  0.82387113061171702 0.2353063850072582 -0.51562318151862319
+1.6806397508870434 0.86416377447305925 0.280084692934636  0.68041269101920498 -0.13609530337963563 -0.72008099426245709
+1.5952985273360616 0.93025980236669126 0.1995276593250811  0.59503447968929823 -0.069662907281836925 -0.80067536950372609
+1.2681715176003199 0.31070343884806495 0.32698121279413161  0.26836446324215141 -0.68937955050281308 -0.67285685715261256
+1.1930054401955474 0.37542737832173323 0.24325833978506284  0.19358827458119487 -0.62484261256047735 -0.75636980999592596
+1.0397345885584115 0.73973505164257791 0.035280704490367243  0.03967799912916415 -0.25990051397959979 -0.9648198687932612
+1.1598578035878231 0.80062303027104398 0.033204102939107361  0.16010344242024271 -0.19913925651268632 -0.96680424297825795
+1.3040127948790108 0.66433279178978188 0.108426253256518  0.30422052318316734 -0.33550256744406998 -0.89156486051918693
+1.1865609960788062 0.61001233692795442 0.098276862116930985  0.18714545413041747 -0.38953622755321993 -0.9017971537002798
+0.90105806124803878 0.23967742655656488 0.35918321758479488  -0.10365825365834329 -0.76207589783375607 -0.6391363644711332
+0.72730018625934878 0.73088283263773501 0.076305915458627194  -0.27282039415738768 -0.26880216379452448 -0.92375019852294993
+0.90688305806336122 0.29107512591583123 0.30186484921791512  -0.10153183902939053 -0.71176658290178618 -0.69503929178689206
+0.30186484921791523 0.90688305806336122 0.29107512591583129  -0.69503929178689017 -0.10153183902939387 -0.71176658290178751
+0.31936024911295646 1.1358362255269414 0.28008469293463611  -0.68041269101920498 0.13609530337963624 -0.72008099426245697
+0.4047014726639383 1.069740197633309 0.1995276593250811  -0.59503447968929801 0.069662907281837952 -0.80067536950372598
+0.90387507728811034 0.34253810440658677 0.25355721782048279  -0.09843496124260244 -0.65866036402230843 -0.74597391594556939
+0.29128230231247842 0.93272292597567807 0.29772297467792341  -0.70820887911908814 -0.067501320615794697 -0.7027686356490368
+0.15896669732792446 1.2840795446225892 0.53960691129913418  -0.84103034646625341 0.28440717777405561 -0.46019616855581308
+0.23616371904645017 1.3714973697248309 0.47222747306573265  -0.76364675610270683 0.37176976328895972 -0.52785497534633874
+0.23042216149782391 1.6234022291431627 1.1382736821873722  -0.76972539034249132 0.62320039727703636 0.13836216352689557
+0.29772297467792341 1.7087176976875216 1.0672770740243225  -0.7027686356490398 0.70820887911908548 0.0675013206157907
+0.53960691129913418 1.8410333026720758 0.71592045537741122  -0.46019616855581297 0.84103034646625374 -0.28440717777405489
+0.47222747306573287 1.7638362809535502 0.62850263027516928  -0.52785497534633652 0.76364675610270849 -0.37176976328895933
+0.31070343884806495 1.6730187872058686 0.73182848239968035  -0.68937955050281285 0.6728568571526129 -0.2683644632421513
+0.37542737832173312 1.7567416602149373 0.80699455980445245  -0.62484261256047768 0.75636980999592562 -0.19358827458119485
+0.73973505164257791 1.9647192955096329 0.96026541144158861  -0.25990051397960101 0.96481986879326098 -0.039677999129162367
+0.80062303027104398 1.9667958970608925 0.84014219641217713  -0.19913925651268505 0.96680424297825807 -0.16010344242024419
+1.3356672082102183 1.8915737467434819 1.3040127948790106  0.33550256744406826 0.89156486051918749 0.30422052318316728
+1.3899876630720454 1.901723137883069 1.1865609960788062  0.38953622755322004 0.9017971537002798 0.18714545413041681
+1.3961011738843634 1.8807678912304873 0.74047778163550193  0.39599581735923711 0.88070834559541677 -0.25988482570664545
+1.2691171673622654 1.9236940845413726 0.72730018625934867  0.26880216379452254 0.92375019852295026 -0.27282039415738835
+1.1973935260228461 1.9770315820848792 0.91971872264975862  0.19714040391717286 0.97707738033577995 -0.0803458398396803
+1.3227105890477233 1.943302656293743 0.92229559635619029  0.32203490693742853 0.94351526412634268 -0.077926023088563834
+1.6801807185069524 1.7051970771451348 0.79987185965655649  0.68040299513329394 0.7049350430866167 -0.20029565457621054
+1.6406145370870961 1.694096083320241 0.671604442794689  0.64057192708348298 0.69398384882086983 -0.32871571883365269
+1.9770315820848792 1.0802812773502413 0.80260647397715423  0.97707738033578029 0.080345839839677663 -0.19714040391717216
+1.9433026562937428 1.0777044036438097 0.67728941095227668  0.9435152641263429 0.077926023088562071 -0.32203490693742876
+1.7051970771451346 1.2001281403434438 0.3198192814930475  0.70493504308661725 0.20029565457621135 -0.68040299513329305
+1.694096083320241 1.3283955572053112 0.35938546291290407  0.69398384882086939 0.32871571883365119 -0.6405719270834842
+1.9770315820848792 0.91971872264975896 1.1973935260228461  0.97707738033577995 -0.080345839839678926 0.19714040391717347
+1.943302656293743 0.92229559635619029 1.3227105890477233  0.94351526412634257 -0.077926023088563293 0.32203490693742914
+1.7051970771451346 0.79987185965655649 1.6801807185069522  0.7049350430866167 -0.20029565457621065 0.68040299513329383
+1.694096083320241 0.671604442794689 1.6406145370870961  0.69398384882086983 -0.32871571883365269 0.64057192708348298
+1.0802812773502413 0.80260647397715423 1.9770315820848792  0.080345839839677677 -0.1971404039171723 0.97707738033578029
+1.0777044036438097 0.67728941095227657 1.943302656293743  0.077926023088562002 -0.32203490693742876 0.94351526412634279
+1.2001281403434438 0.3198192814930475 1.7051970771451346  0.20029565457621135 -0.68040299513329305 0.70493504308661725
+1.3283955572053112 0.35938546291290407 1.694096083320241  0.32871571883365075 -0.64057192708348443 0.69398384882086939
+1.3536293529417167 0.53443495637683469 1.8112924693932411  0.35387698305874343 -0.46550486715932188 0.81121902067951035
+1.2345849586062212 0.48428397075672935 1.8240187342392595  0.23530638500725834 -0.51562318151862285 0.82387113061171724
+0.86416377447305925 0.280084692934636 1.6806397508870434  -0.13609530337963588 -0.72008099426245675 0.68041269101920532
+0.93025980236669126 0.1995276593250811 1.5952985273360616  -0.069662907281837577 -0.80067536950372598 0.59503447968929823
+0.31070343884806495 0.32698121279413161 1.2681715176003199  -0.68937955050281319 -0.67285685715261268 0.26836446324215141
+0.37542737832173312 0.24325833978506273 1.1930054401955474  -0.62484261256047735 -0.75636980999592596 0.19358827458119482
+0.73973505164257791 0.035280704490367243 1.0397345885584115  -0.25990051397960007 -0.96481986879326109 0.039677999129164684
+0.80062303027104398 0.033204102939107361 1.1598578035878231  -0.19913925651268602 -0.96680424297825807 0.1601034424202428
+0.66433279178978188 0.108426253256518 1.3040127948790108  -0.33550256744406964 -0.89156486051918704 0.30422052318316734
+0.61001233692795442 0.098276862116931096 1.1865609960788062  -0.38953622755321898 -0.90179715370028013 0.1871454541304173
+0.89844705357522048 0.37311241287933194 0.22843691950085848  -0.096596587118419092 -0.63168040245027901 -0.76918721291849834
+0.73088283263773501 0.076305915458627194 0.72730018625934878  -0.26880216379452265 -0.92375019852295026 -0.27282039415738796
+0.35918321758479488 0.90105806124803856 0.23967742655656488  -0.6391363644711513 -0.10365825365835668 -0.76207589783373908
+0.87149140923129176 0.45766135056489032 0.17031256632806041  -0.14218930946431163 -0.5308742118974128 -0.83543687458500604
+1.1358362255269414 0.28008469293463611 0.31936024911295646  0.1360953033796366 -0.72008099426245686 -0.68041269101920498
+1.069740197633309 0.1995276593250811 0.4047014726639383  0.069662907281837952 -0.80067536950372598 -0.59503447968929801
+0.11307342108777627 0.80253395542112949 0.58417903277383187  -0.88421545010983993 -0.2012562397068535 -0.42149610172113178
+0.93272292597567807 0.29772297467792341 0.29128230231247842  -0.067501320615791366 -0.70276863564903769 -0.70820887911908736
+1.2840795446225892 0.53960691129913418 0.15896669732792446  0.28440717777405555 -0.46019616855581341 -0.84103034646625319
+1.3714973697248309 0.47222747306573287 0.23616371904645017  0.37176976328895889 -0.52785497534633918 -0.76364675610270694
+1.6234022291431627 1.1382736821873722 0.23042216149782391  0.6232003972770358 0.13836216352689565 -0.76972539034249166
+1.7087176976875216 1.0672770740243225 0.29772297467792341  0.70820887911908548 0.067501320615790686 -0.70276863564903969
+1.8410333026720758 0.71592045537741122 0.53960691129913418  0.84103034646625285 -0.284407177774056 -0.46019616855581397
+1.7638362809535502 0.62850263027516928 0.47222747306573287  0.76364675610270727 -0.37176976328896061 -0.52785497534633741
+1.6730187872058686 0.73182848239968035 0.31070343884806495  0.6728568571526129 -0.2683644632421513 -0.68937955050281285
+1.7567416602149373 0.80699455980445256 0.37542737832173323  0.75636980999592573 -0.19358827458119479 -0.62484261256047757
+1.9647192955096329 0.96026541144158861 0.73973505164257791  0.96481986879326098 -0.039677999129162721 -0.25990051397960112
+1.9667958970608925 0.84014219641217736 0.80062303027104398  0.96680424297825829 -0.16010344242024274 -0.19913925651268469
+1.8915737467434819 1.3040127948790106 1.3356672082102183  0.89156486051918749 0.30422052318316728 0.33550256744406826
+1.901723137883069 1.1865609960788062 1.3899876630720454  0.9017971537002798 0.18714545413041681 0.38953622755322004
+1.8807678912304873 0.74047778163550215 1.3961011738843632  0.88070834559541733 -0.25988482570664379 0.39599581735923722
+1.9236940845413726 0.72730018625934889 1.2691171673622654  0.92375019852295004 -0.27282039415738818 0.26880216379452349
+1.8915737467434823 0.69598720512098988 0.66433279178978188  0.89156486051918771 -0.30422052318316639 -0.3355025674440687
+1.9017231378830692 0.81343900392119473 0.61001233692795442  0.90179715370028057 -0.18714545413041667 -0.38953622755321815
+1.8807678912304873 1.2595222183644981 0.60389882611563706  0.88070834559541689 0.25988482570664451 -0.39599581735923783
+1.9236940845413728 1.2726998137406516 0.73088283263773501  0.92375019852294982 0.27282039415738824 -0.26880216379452393
+1.465565043623166 1.8112924693932408 0.64637064705828351  0.46550486715932449 0.81121902067950902 -0.35387698305874316
+1.5157160292432708 1.8240187342392593 0.76541504139377881  0.51562318151862263 0.82387113061171735 -0.2353063850072582
+1.7199153070653641 1.6806397508870434 1.1358362255269414  0.72008099426245709 0.6804126910192051 0.13609530337963516
+1.800472340674919 1.5952985273360614 1.069740197633309  0.80067536950372664 0.59503447968929746 0.069662907281837147
+0.80260647397715423 0.022968417915120942 0.91971872264975896  -0.19714040391717269 -0.97707738033578018 -0.080345839839677829
+0.67728941095227668 0.056697343706257008 0.92229559635619041  -0.32203490693742781 -0.94351526412634312 -0.077926023088561974
+0.80253395542112949 0.58417903277383187 0.11307342108777621  -0.20125623970685386 -0.42149610172113305 -0.88421545010983926
+0.78594000042913037 0.60770816150558526 0.10617487126239183  -0.22324532177533477 -0.39311654818378927 -0.89197584375894945
+0.022968417915120942 0.91971872264975896 0.80260647397715423  -0.97707738033578018 -0.080345839839677829 -0.19714040391717269
+0.056697343706257008 0.92229559635619041 0.67728941095227668  -0.9435152641263429 -0.077926023088562626 -0.3220349069374282
+0.62479622481419628 0.77318510024650322 0.10194841255523895  -0.36748531964497921 -0.23977066491306492 -0.89859032272363926
+0.75815048575026589 0.64339140453754129 0.098424941615366732  -0.24555619785557528 -0.36356562872995929 -0.89862238304023057
+0.73781627941851213 0.66704995977036097 0.095052466200525487  -0.2673952393891062 -0.33340690397516742 -0.90406837259896233
+0.71089969747156689 0.69602657944578872 0.093129265416474039  -0.28893990864387004 -0.30244718988225927 -0.90831680955776473
+0.28008469293463611 0.31936024911295646 1.1358362255269414  -0.72008099426245686 -0.68041269101920498 0.1360953033796366
+0.1995276593250811 0.4047014726639383 1.069740197633309  -0.80067536950372598 -0.59503447968929801 0.069662907281837952
+0.32698121279413161 0.73182848239968035 1.6892965611519353  -0.67285685715261234 -0.26836446324214963 0.68937955050281408
+0.24325833978506284 0.80699455980445256 1.624572621678267  -0.75636980999592518 -0.19358827458119407 0.62484261256047846
+0.035280704490367243 0.96026541144158861 1.2602649483574222  -0.96481986879326098 -0.039677999129164913 0.25990051397960084
+0.033204102939107361 0.84014219641217736 1.1993769697289565  -0.96680424297825795 -0.16010344242024258 0.19913925651268685
+0.6771336059462687 0.72858929180595311 0.094046635219543206  -0.30990719304796399 -0.27087574504909673 -0.91136373772562884
+0.29772297467792341 0.29128230231247842 0.93272292597567807  -0.70276863564903491 -0.70820887911908992 -0.067501320615794169
+0.53960691129913396 0.15896669732792457 1.2840795446225894  -0.46019616855581319 -0.8410303464662533 0.284407177774056
+0.47222747306573287 0.23616371904645017 1.3714973697248309  -0.52785497534633985 -0.76364675610270594 0.37176976328896005
+1.1382736821873722 0.23042216149782391 1.6234022291431627  0.13836216352689693 -0.76972539034249154 0.6232003972770358
+1.0672770740243225 0.29772297467792341 1.7087176976875216  0.067501320615790686 -0.70276863564903969 0.70820887911908548
+0.71592045537741122 0.53960691129913418 1.8410333026720758  -0.28440717777405627 -0.46019616855581413 0.84103034646625263
+0.62850263027516928 0.47222747306573287 1.7638362809535502  -0.37176976328896061 -0.52785497534633741 0.76364675610270727
+0.32698121279413161 1.2681715176003199 0.31070343884806495  -0.67285685715261256 0.26836446324215141 -0.68937955050281308
+0.24325833978506284 1.1930054401955474 0.37542737832173323  -0.75636980999592596 0.19358827458119485 -0.62484261256047724
+0.035280704490367243 1.0397345885584115 0.73973505164257791  -0.96481986879326109 0.039677999129164684 -0.25990051397960007
+0.033204102939107361 1.1598578035878231 0.80062303027104398  -0.96680424297825807 0.1601034424202428 -0.19913925651268602
+0.10842625325651789 0.69598720512098966 1.3356672082102183  -0.89156486051918715 -0.30422052318316783 0.33550256744406898
+0.098276862116930652 0.81343900392119461 1.3899876630720456  -0.90179715370028013 -0.18714545413041603 0.3895362275532197
+0.11923210876951296 1.2595222183644981 1.3961011738843634  -0.88070834559541789 0.25988482570664367 0.39599581735923611
+0.076305915458627416 1.2726998137406516 1.2691171673622654  -0.92375019852294993 0.27282039415738796 0.26880216379452404
+1.6267476188075718 1.5155632797953902 1.5842789803216091  0.62675731827798098 0.51582822603431755 0.58403467808965137
+1.5521688397941482 1.4662660666179783 1.6911624465210644  0.5522259583307304 0.46647300291392729 0.69097715483087396
+1.3536293529417165 1.4655650436231658 1.8112924693932408  0.35387698305874277 0.46550486715932354 0.81121902067950968
+1.4686770498343504 1.4063294025426432 1.7843712383737107  0.46877433341209002 0.40646863937642691 0.78424095119900938
+1.0687157005262189 1.9453832490724943 1.3186356302649234  0.068382200701545187 0.94544807568691724 0.31851500876272532
+1.1389936067269157 1.8934279503155276 1.427161883697549  0.13875119650014295 0.89352037004910512 0.42704736713517949
+1.1382736821873727 1.7695778385021763 1.6234022291431622  0.13836216352689629 0.76972539034249166 0.6232003972770358
+1.2082874004879671 1.8247164420172246 1.5257938275259753  0.20813967421463503 0.82482450355065051 0.52568280774650467
+0.41572101967839148 1.6267476188075716 1.5155632797953906  -0.58449479401890791 0.62647295099493494 0.51565247738810704
+0.53373393338202191 1.6911624465210644 1.5521688397941484  -0.46647300291392713 0.69097715483087374 0.55222595833073085
+0.73182848239968057 1.6892965611519348 1.6730187872058688  -0.26836446324215263 0.68937955050281163 0.67285685715261367
+0.66005164309557451 1.7433454959605346 1.576083837885744  -0.34013694034011638 0.74324570666303758 0.57610127698437386
+0.57018003072289591 1.0000000000000002 1.9029146105865324  -0.42961984965259903 -0.00028436728304797682 0.90300980278163467
+0.57283811630245085 1.1389936067269162 1.8934279503155276  -0.42704736713517938 0.13875119650014325 0.89352037004910523
+0.69598720512098988 1.3356672082102183 1.8915737467434823  -0.30422052318316695 0.33550256744406853 0.89156486051918749
+0.58161296052541855 1.2746684461261846 1.8657421844304007  -0.41835586417422121 0.27447137325094922 0.86581974808662021
+1.3186356302649234 0.93128429947378155 1.9453832490724945  0.31851500876272471 -0.068382200701544701 0.94544807568691747
+1.2022655037944634 1 1.9793307234916977  0.20254321521823299 9.3774004638345608e-17 0.97927332546590917
+1.0802812773502413 1.1973935260228461 1.9770315820848792  0.080345839839679772 0.19714040391717261 0.97707738033578007
+1.0813709460566905 1.0663810456382177 1.9944708773603259  0.081578796887613741 0.066331699036313058 0.99445714115859496
+0.68136436973507708 0.93128429947378122 0.054616750927505398  -0.31851500876272504 -0.06838220070154602 -0.94544807568691724
+0.79773449620553682 1 0.020669276508302414  -0.20254321521823149 -7.2935336940935469e-17 -0.97927332546590951
+0.91971872264975907 1.1973935260228461 0.022968417915120942  -0.080345839839677774 0.19714040391717347 -0.97707738033578007
+0.91862905394330996 1.0663810456382175 0.0055291226396743109  -0.081578796887611521 0.066331699036312863 -0.99445714115859518
+0.37325238119242876 1.5155632797953904 0.41572101967839081  -0.62675731827798042 0.51582822603431766 -0.58403467808965193
+0.44783116020585179 1.4662660666179785 0.30883755347893571  -0.55222595833073085 0.46647300291392785 -0.6909771548308733
+0.64637064705828351 1.4655650436231658 0.18870753060675938  -0.35387698305874221 0.46550486715932415 -0.81121902067950957
+0.53132295016564979 1.4063294025426434 0.2156287616262893  -0.46877433341208985 0.40646863937642658 -0.78424095119900961
+0.93128429947378166 1.9453832490724945 0.68136436973507686  -0.068382200701545257 0.94544807568691724 -0.31851500876272504
+0.86100639327308448 1.8934279503155278 0.57283811630245107  -0.13875119650014139 0.89352037004910545 -0.42704736713517955
+0.86172631781262787 1.7695778385021763 0.37659777085683765  -0.13836216352689501 0.76972539034249188 -0.62320039727703569
+0.79171259951203332 1.8247164420172246 0.47420617247402475  -0.20813967421463572 0.82482450355065062 -0.52568280774650411
+1.5842789803216091 1.6267476188075718 0.48443672020460993  0.58403467808965315 0.62675731827798065 -0.51582822603431588
+1.4662660666179783 1.6911624465210644 0.44783116020585179  0.46647300291392657 0.69097715483087452 -0.55222595833073029
+1.2681715176003199 1.689296561151935 0.32698121279413161  0.26836446324215224 0.68937955050281319 -0.67285685715261212
+1.3399483569044259 1.7433454959605346 0.4239161621142562  0.34013694034011477 0.74324570666303791 -0.57610127698437419
+1.4298199692771043 1.0000000000000002 0.097085389413467671  0.42961984965260058 0.00028436728304489438 -0.9030098027816339
+1.427161883697549 1.1389936067269162 0.10657204968447243  0.42704736713517832 0.13875119650014309 -0.89352037004910567
+1.3040127948790103 1.3356672082102183 0.108426253256518  0.30422052318316772 0.33550256744406864 -0.89156486051918726
+1.4183870394745819 1.2746684461261846 0.13425781556959937  0.41835586417422216 0.27447137325094995 -0.86581974808661966
+1.0000000000000002 0.097085389413467671 1.4298199692771043  0.00028436728304636 -0.9030098027816339 0.42961984965260058
+1.1389936067269162 0.10657204968447254 1.4271618836975493  0.13875119650014303 -0.89352037004910567 0.42704736713517832
+1.3356672082102183 0.108426253256518 1.3040127948790106  0.33550256744406942 -0.89156486051918726 0.30422052318316667
+1.2746684461261846 0.13425781556959937 1.4183870394745819  0.27447137325094867 -0.8658197480866201 0.41835586417422194
+0.93128429947378155 0.054616750927505398 0.68136436973507708  -0.068666567984591781 -0.94527232704070629 -0.31897512469198175
+1 0.020669276508302414 0.79773449620553682  -7.2935336940935469e-17 -0.97927332546590951 -0.20254321521823149
+1.1973935260228461 0.022968417915120942 0.91971872264975907  0.19714040391717347 -0.97707738033578007 -0.080345839839677774
+1.0663810456382175 0.0055291226396741999 0.91862905394330996  0.066331699036312863 -0.99445714115859518 -0.081578796887611507
+1.5155632797953904 0.41572101967839092 0.37325238119242865  0.51582822603431722 -0.5840346780896517 -0.62675731827798109
+1.4662660666179785 0.30883755347893571 0.44783116020585167  0.46647300291392818 -0.6909771548308733 -0.55222595833073063
+1.465565043623166 0.18870753060675916 0.64637064705828351  0.46550486715932421 -0.81121902067950946 -0.35387698305874238
+1.4063294025426436 0.21562876162628952 0.53132295016564968  0.40646863937642819 -0.7842409511990085 -0.46877433341209029
+1.9453832490724945 0.68136436973507708 0.93128429947378155  0.9454480756869168 -0.31851500876272626 -0.068382200701546297
+1.8934279503155278 0.57283811630245107 0.86100639327308448  0.89352037004910545 -0.42704736713517949 -0.13875119650014142
+1.7695778385021763 0.37659777085683765 0.86172631781262787  0.76972539034249188 -0.62320039727703569 -0.13836216352689501
+1.8247164420172246 0.47420617247402475 0.79171259951203332  0.82482450355065073 -0.52568280774650422 -0.20813967421463575
+1.6267476188075718 0.48443672020460993 1.5842789803216091  0.62647295099493516 -0.51565247738810538 0.58449479401890936
+1.6911624465210644 0.44783116020585179 1.4662660666179783  0.69097715483087396 -0.55222595833073063 0.46647300291392685
+1.689296561151935 0.32698121279413161 1.2681715176003199  0.68937955050281319 -0.67285685715261212 0.26836446324215224
+1.7433454959605346 0.4239161621142562 1.3399483569044259  0.74324570666303713 -0.57610127698437386 0.34013694034011699
+1.5842789803216091 1.6267476188075709 1.5155632797953906  0.5844947940189088 0.62647295099493494 0.51565247738810616
+1.6911624465210642 1.552168839794148 1.4662660666179788  0.69097715483087396 0.55222595833072996 0.46647300291392763
+1.8112924693932408 1.3536293529417165 1.4655650436231658  0.81121902067950946 0.35387698305874271 0.46550486715932404
+1.7843712383737107 1.4686770498343504 1.4063294025426432  0.78424095119900938 0.46877433341209002 0.40646863937642691
+0.57018003072289591 1 0.097085389413467671  -0.42961984965260003 0.00028436728304627148 -0.90300980278163412
+0.57283811630245096 0.86100639327308426 0.10657204968447231  -0.80988964354812454 0.15741543596758825 -0.56506561193601745
+0.66096525556418162 0.74328545761836973 0.095572989323982643  -0.33091024020101545 -0.23862737818800145 -0.91299254504581084
+0.51873480041451092 0.13843733448120876 0.84282425105969128  -0.47538384129543554 -0.86578380003691946 -0.1562965611548367
+0.05461675092750562 1.3186356302649231 1.0687157005262189  -0.94544807568691691 0.31851500876272604 0.068382200701545576
+0.020669276508302414 1.2022655037944634 1.0000000000000002  -0.97927332546590939 0.20254321521823168 5.418053601326634e-16
+0.022968417915120942 1.0802812773502413 0.80260647397715423  -0.97707738033578018 0.080345839839677816 -0.19714040391717297
+0.0055291226396743109 1.0813709460566903 0.9336189543617831  -0.99445714115859507 0.081578796887611674 -0.066331699036312766
+0.68136436973507708 0.93128429947378155 1.9453832490724945  -0.31851500876272582 -0.068382200701545937 0.94544807568691702
+0.57283811630245085 0.86100639327308437 1.8934279503155276  -0.42704736713517966 -0.13875119650014026 0.89352037004910556
+0.37659777085683765 0.86172631781262787 1.7695778385021763  -0.62320039727703724 -0.13836216352689595 0.76972539034249055
+0.47420617247402475 0.79171259951203332 1.8247164420172246  -0.52568280774650455 -0.20813967421463644 0.82482450355065029
+0.37325238119242898 1.5155632797953906 1.5842789803216091  -0.62647295099493439 0.51565247738810649 0.58449479401890891
+0.30883755347893593 1.5521688397941484 1.4662660666179788  -0.69097715483087396 0.55222595833073052 0.46647300291392707
+0.31070343884806517 1.6730187872058688 1.2681715176003199  -0.68937955050281274 0.67285685715261256 0.2683644632421523
+0.25665450403946555 1.576083837885744 1.3399483569044259  -0.74324570666303857 0.57610127698437363 0.34013694034011438
+0.68136436973507686 1.0687157005262189 1.9453832490724945  -0.31851500876272537 0.068382200701545479 0.94544807568691713
+0.79773449620553671 1.0000000000000002 1.9793307234916977  -0.20254321521823285 5.418053601326634e-16 0.97927332546590917
+0.91971872264975907 0.80260647397715423 1.9770315820848792  -0.080345839839678343 -0.19714040391717227 0.97707738033578029
+0.91862905394330996 0.93361895436178299 1.9944708773603259  -0.081578796887612645 -0.066331699036312267 0.99445714115859507
+1.5155632797953908 0.41572101967839115 1.6267476188075713  0.51565247738810716 -0.5844947940189078 0.62647295099493494
+1.5521688397941484 0.53373393338202191 1.6911624465210644  0.55222595833073107 -0.46647300291392729 0.6909771548308733
+1.6730187872058688 0.73182848239968057 1.6892965611519348  0.6728568571526139 -0.26836446324215041 0.6893795505028123
+1.576083837885744 0.66005164309557451 1.7433454959605346  0.57610127698437297 -0.34013694034011599 0.74324570666303835
+1.3186356302649234 1.0687157005262189 1.9453832490724945  0.3189751246919833 0.068666567984591712 0.94527232704070585
+1.4271618836975493 1.138993606726916 1.8934279503155276  0.4270473671351796 0.13875119650014209 0.89352037004910523
+1.6234022291431622 1.1382736821873727 1.7695778385021765  0.6232003972770358 0.13836216352689526 0.76972539034249177
+1.5257938275259753 1.2082874004879671 1.8247164420172246  0.52568280774650522 0.20813967421463539 0.82482450355065018
+1.9453832490724943 1.3186356302649234 1.0687157005262189  0.94544807568691713 0.31851500876272548 0.068382200701545118
+1.8934279503155276 1.4271618836975493 1.138993606726916  0.89352037004910523 0.4270473671351796 0.13875119650014209
+1.7695778385021763 1.6234022291431622 1.1382736821873727  0.76972539034249166 0.6232003972770358 0.13836216352689629
+1.8247164420172246 1.5257938275259753 1.2082874004879671  0.82482450355065018 0.52568280774650522 0.20813967421463539
+1.5155632797953906 1.5842789803216091 1.6267476188075711  0.51582822603431877 0.58403467808965048 0.62675731827798087
+1.4662660666179788 1.6911624465210642 1.552168839794148  0.46647300291392846 0.69097715483087296 0.55222595833073063
+1.4655650436231658 1.8112924693932408 1.3536293529417165  0.4655048671593236 0.81121902067950968 0.35387698305874282
+1.4063294025426432 1.7843712383737107 1.4686770498343504  0.40646863937642691 0.78424095119900938 0.46877433341209002
+1.0687157005262193 1.9453832490724945 0.68136436973507686  0.068382200701545298 0.94544807568691758 -0.31851500876272415
+1.0000000000000002 1.9793307234916977 0.79773449620553649  1.4309218485554959e-15 0.97927332546590906 -0.20254321521823371
+0.80260647397715434 1.9770315820848792 0.91971872264975896  -0.19714040391717205 0.97707738033578029 -0.080345839839678121
+0.9336189543617831 1.9944708773603257 0.91862905394330985  -0.066331699036312378 0.99445714115859507 -0.081578796887612728
+1.0000000000000002 1.9029146105865324 1.4298199692771043  0.0002843672830459537 0.90300980278163367 0.42961984965260097
+0.86100639327308426 1.8934279503155274 1.4271618836975497  -0.13875119650014023 0.89352037004910578 0.42704736713517905
+0.66433279178978188 1.8915737467434823 1.3040127948790103  -0.33550256744406765 0.89156486051918815 0.30422052318316617
+0.72533155387381609 1.8657421844304007 1.4183870394745819  -0.27447137325094778 0.86581974808662088 0.41835586417422083
+0.097085389413467671 1.4298199692771043 1.0000000000000002  -0.9030098027816339 0.42961984965260047 -0.00028436728304480059
+0.10657204968447276 1.4271618836975497 1.1389936067269162  -0.89352037004910567 0.42704736713517855 0.13875119650014289
+0.108426253256518 1.3040127948790106 1.3356672082102183  -0.89156486051918671 0.30422052318316789 0.33550256744407009
+0.13425781556959937 1.4183870394745819 1.2746684461261846  -0.86581974808661977 0.41835586417422177 0.27447137325095017
+0.48443672020460971 1.5842789803216091 1.6267476188075713  -0.515828226034316 0.58403467808965326 0.62675731827798054
+0.44783116020585179 1.4662660666179783 1.6911624465210644  -0.55222595833073185 0.46647300291392668 0.69097715483087319
+0.32698121279413161 1.2681715176003199 1.6892965611519353  -0.67285685715261212 0.26836446324215224 0.68937955050281319
+0.4239161621142562 1.3399483569044259 1.7433454959605346  -0.57610127698437386 0.34013694034011699 0.74324570666303713
+0.37325238119242876 0.48443672020460959 1.5842789803216091  -0.62647295099493427 -0.51565247738810671 0.58449479401890891
+0.44783116020585179 0.53373393338202169 1.6911624465210644  -0.55222595833073096 -0.46647300291392774 0.69097715483087319
+0.64637064705828351 0.53443495637683469 1.8112924693932411  -0.35387698305874443 -0.46550486715932343 0.81121902067950902
+0.53132295016564979 0.5936705974573574 1.7843712383737111  -0.46877433341208907 -0.40646863937642846 0.78424095119900905
+1.5155632797953902 1.5842789803216091 0.37325238119242876  0.51565247738810593 0.5844947940189088 -0.62647295099493505
+1.5521688397941484 1.4662660666179785 0.30883755347893582  0.55222595833073107 0.46647300291392751 -0.6909771548308733
+1.6730187872058688 1.2681715176003199 0.31070343884806517  0.67285685715261256 0.2683644632421523 -0.68937955050281274
+1.576083837885744 1.3399483569044259 0.25665450403946566  0.57610127698437386 0.34013694034011438 -0.74324570666303846
+1.6267476188075713 0.48443672020460959 0.41572101967839103  0.6264729509949355 -0.51565247738810582 -0.58449479401890836
+1.5521688397941484 0.53373393338202157 0.30883755347893571  0.55222595833073118 -0.4664730029139284 -0.69097715483087252
+1.3536293529417167 0.53443495637683447 0.18870753060675904  0.35387698305874282 -0.46550486715932432 -0.81121902067950913
+1.4686770498343509 0.59367059745735729 0.21562876162628941  0.46877433341209102 -0.4064686393764268 -0.78424095119900883
+1.3186356302649231 1.0687157005262189 0.054616750927505398  0.31897512469198369 0.068666567984592183 -0.94527232704070563
+1.2022655037944634 1.0000000000000002 0.020669276508302414  0.20254321521823199 7.0504159042904293e-16 -0.97927332546590939
+1.0802812773502413 0.80260647397715423 0.022968417915120942  0.080345839839677802 -0.19714040391717336 -0.97707738033578007
+1.0813709460566903 0.9336189543617831 0.0055291226396741999  0.081578796887611452 -0.066331699036312614 -0.99445714115859518
+0.31222404809805682 0.2811508450273621 0.90641151615731874  -0.68572398718655969 -0.72091363611669146 -0.10033016823457222
+0.29107512591583118 0.30186484921791523 0.90688305806336111  -0.71176658290178463 -0.69503929178689339 -0.10153183902939247
+0.25988381527545967 0.33544566672286746 0.9046373499048469  -0.73743092048488046 -0.66756092552179136 -0.10275236361909755
+0.21570896554595276 0.38998187620182151 0.89436470058605511  -0.78585236795603841 -0.60955597917047022 -0.10429556095738801
+0.68136436973507708 1.0687157005262189 0.054616750927505398  -0.31897512469198097 0.068666567984592072 -0.94527232704070652
+0.57283811630245096 1.138993606726916 0.10657204968447231  -0.42704736713517855 0.13875119650014281 -0.89352037004910567
+0.37659777085683765 1.1382736821873727 0.23042216149782369  -0.62320039727703613 0.13836216352689593 -0.76972539034249143
+0.47420617247402497 1.2082874004879671 0.17528355798277517  -0.52568280774650455 0.20813967421463439 -0.82482450355065084
+0.054616750927505398 1.3186356302649231 0.93128429947378155  -0.94544807568691702 0.31851500876272598 -0.068382200701545659
+0.10657204968447231 1.4271618836975493 0.86100639327308448  -0.89352037004910567 0.42704736713517882 -0.1387511965001417
+0.23042216149782357 1.6234022291431622 0.86172631781262776  -0.76972539034249099 0.62320039727703647 -0.13836216352689645
+0.17528355798277517 1.5257938275259753 0.79171259951203343  -0.82482450355065051 0.52568280774650489 -0.20813967421463486
+0.48443672020460971 1.5842789803216091 0.37325238119242865  -0.51582822603431666 0.58403467808965259 -0.62675731827798054
+0.53373393338202169 1.6911624465210644 0.44783116020585179  -0.4664730029139279 0.69097715483087296 -0.55222595833073118
+0.53443495637683458 1.8112924693932411 0.64637064705828351  -0.46550486715932454 0.81121902067950857 -0.3538769830587441
+0.5936705974573574 1.7843712383737111 0.53132295016564957  -0.4064686393764288 0.78424095119900838 -0.46877433341208996
+0.93128429947378155 1.9453832490724945 1.3186356302649234  -0.068666567984591767 0.94527232704070574 0.31897512469198358
+1 1.9793307234916977 1.2022655037944634  9.3774004638345608e-17 0.97927332546590917 0.20254321521823299
+1.1973935260228461 1.9770315820848792 1.0802812773502413  0.1971404039171723 0.97707738033578007 0.080345839839680327
+1.0663810456382175 1.9944708773603257 1.0813709460566903  0.066331699036313002 0.99445714115859496 0.081578796887613922
+1.0000000000000002 1.9029146105865324 0.57018003072289591  0.00028436728304837792 0.90300980278163467 -0.42961984965259897
+1.1389936067269162 1.8934279503155276 0.57283811630245085  0.13875119650014178 0.89352037004910589 -0.42704736713517855
+1.3356672082102183 1.8915737467434819 0.69598720512098966  0.33550256744406909 0.89156486051918704 -0.30422052318316789
+1.2746684461261846 1.8657421844304007 0.58161296052541855  0.27447137325094867 0.86581974808662043 -0.41835586417422133
+1.9029146105865324 1.4298199692771043 1  0.90300980278163367 0.42961984965260103 0.00028436728304587899
+1.8934279503155274 1.4271618836975497 0.86100639327308426  0.89352037004910578 0.42704736713517905 -0.13875119650014023
+1.8915737467434823 1.3040127948790103 0.66433279178978188  0.89156486051918815 0.30422052318316617 -0.33550256744406765
+1.8657421844304007 1.4183870394745819 0.72533155387381609  0.86581974808662088 0.41835586417422083 -0.27447137325094778
+1.9029146105865324 0.57018003072289591 1.0000000000000002  0.90300980278163456 -0.42961984965259897 -0.00028436728304734988
+1.8934279503155276 0.57283811630245096 1.1389936067269162  0.89352037004910523 -0.42704736713517927 0.13875119650014325
+1.8915737467434823 0.69598720512098988 1.3356672082102183  0.8915648605191876 -0.304220523183167 0.33550256744406859
+1.8657421844304007 0.58161296052541855 1.2746684461261846  0.86581974808662043 -0.41835586417422133 0.27447137325094889
+1.4298199692771043 1 1.9029146105865324  0.42961984965260097 0.00028436728304587731 0.90300980278163367
+1.4271618836975497 0.86100639327308426 1.8934279503155274  0.42704736713517905 -0.13875119650014023 0.89352037004910578
+1.3040127948790103 0.66433279178978188 1.8915737467434823  0.30422052318316617 -0.33550256744406765 0.89156486051918815
+1.4183870394745819 0.72533155387381609 1.8657421844304007  0.41835586417422088 -0.27447137325094784 0.86581974808662099
+1.5842789803216091 0.37325238119242876 1.5155632797953902  0.58449479401890869 -0.62647295099493505 0.51565247738810605
+1.4662660666179785 0.30883755347893582 1.5521688397941484  0.4664730029139274 -0.69097715483087352 0.55222595833073085
+1.2681715176003199 0.31070343884806517 1.6730187872058688  0.26836446324215257 -0.68937955050281241 0.67285685715261279
+1.3399483569044259 0.25665450403946566 1.576083837885744  0.34013694034011438 -0.74324570666303846 0.57610127698437386
+0.48443672020460959 0.41572101967839103 1.6267476188075713  -0.51565247738810671 -0.58449479401890791 0.62647295099493516
+0.53373393338202169 0.30883755347893582 1.5521688397941484  -0.46647300291392857 -0.69097715483087241 0.55222595833073118
+0.53443495637683447 0.18870753060675904 1.3536293529417167  -0.46550486715932327 -0.81121902067950935 0.35387698305874365
+0.59367059745735729 0.21562876162628941 1.4686770498343509  -0.4064686393764268 -0.78424095119900883 0.46877433341209102
+1.0687157005262189 0.05461675092750562 1.3186356302649231  0.068666567984591961 -0.94527232704070585 0.31897512469198336
+1.0000000000000002 0.020669276508302414 1.2022655037944634  7.0156847914614115e-16 -0.97927332546590939 0.20254321521823196
+0.80260647397715423 0.022968417915120942 1.0802812773502413  -0.19714040391717297 -0.97707738033578018 0.080345839839677816
+0.9336189543617831 0.0055291226396743109 1.0813709460566903  -0.066331699036312766 -0.99445714115859507 0.081578796887611674
+0.18950565604187924 0.42721864490060907 0.88304523202927665  -0.80855713981694299 -0.57905836064064875 -0.1045311753650975
+0.17811496227257201 0.44486756488630003 0.87684117534766193  -0.83034168959696941 -0.54729298896533396 -0.1048954848725201
+0.5512195414246408 0.12458499692215487 0.82416586116838453  -0.44918580997761925 -0.87543631012341494 -0.17844712110944824
+0.14688267020077073 0.50017470245974227 0.85269038907862316  -0.84145097432227922 -0.51152737254410363 -0.17406896607440639
+1.0687157005262189 0.054616750927505398 0.68136436973507708  0.068666567984591698 -0.94527232704070641 -0.31897512469198158
+1.138993606726916 0.10657204968447231 0.57283811630245096  0.13875119650014281 -0.89352037004910567 -0.42704736713517855
+1.1382736821873727 0.23042216149782369 0.37659777085683765  0.13836216352689593 -0.76972539034249143 -0.62320039727703613
+1.2082874004879671 0.17528355798277517 0.47420617247402497  0.20813967421463439 -0.82482450355065084 -0.52568280774650455
+1.3186356302649231 0.93128429947378155 0.054616750927505398  0.31897512469198219 -0.068666567984591462 -0.94527232704070618
+1.4271618836975493 0.86100639327308448 0.10657204968447231  0.42704736713517877 -0.138751196500143 -0.89352037004910545
+1.6234022291431622 0.86172631781262776 0.23042216149782357  0.62320039727703691 -0.13836216352689676 -0.76972539034249066
+1.5257938275259753 0.79171259951203343 0.17528355798277517  0.52568280774650478 -0.20813967421463547 -0.82482450355065029
+1.5842789803216091 0.37325238119242876 0.48443672020460959  0.58449479401890903 -0.62647295099493472 -0.51565247738810616
+1.6911624465210644 0.44783116020585179 0.53373393338202169  0.69097715483087319 -0.55222595833073096 -0.46647300291392774
+1.8112924693932411 0.64637064705828351 0.53443495637683458  0.81121902067950902 -0.35387698305874443 -0.46550486715932343
+1.7843712383737111 0.53132295016564979 0.5936705974573574  0.78424095119900905 -0.46877433341208907 -0.40646863937642846
+1.9453832490724945 1.3186356302649234 0.93128429947378155  0.94544807568691747 0.31851500876272471 -0.068382200701544701
+1.9793307234916977 1.2022655037944634 1  0.97927332546590917 0.20254321521823299 9.3774004638345608e-17
+1.9770315820848792 1.0802812773502413 1.1973935260228461  0.97707738033578007 0.080345839839679772 0.19714040391717261
+1.9944708773603259 1.0813709460566905 1.0663810456382177  0.99445714115859496 0.081578796887613741 0.066331699036313058
+1.9453832490724945 0.68136436973507708 1.0687157005262189  0.94527232704070641 -0.31897512469198164 0.068666567984591462
+1.9793307234916977 0.79773449620553671 1.0000000000000002  0.97927332546590928 -0.20254321521823254 2.142909661550342e-15
+1.9770315820848792 0.91971872264975918 0.80260647397715434  0.97707738033578029 -0.080345839839678343 -0.19714040391717214
+1.9944708773603259 0.91862905394330996 0.9336189543617831  0.99445714115859507 -0.081578796887612645 -0.066331699036312183
+1.6267476188075713 1.5155632797953908 0.41572101967839115  0.62647295099493483 0.51565247738810716 -0.58449479401890791
+1.6911624465210644 1.5521688397941484 0.53373393338202191  0.6909771548308733 0.55222595833073107 -0.46647300291392729
+1.6892965611519348 1.6730187872058688 0.73182848239968057  0.68937955050281163 0.67285685715261367 -0.26836446324215263
+1.7433454959605346 1.576083837885744 0.66005164309557451  0.74324570666303746 0.57610127698437374 -0.34013694034011632
+1 0.097085389413467671 0.57018003072289591  0.00028436728304626969 -0.90300980278163412 -0.42961984965260003
+0.86100639327308426 0.10657204968447231 0.57283811630245096  0.15741543596758908 -0.56506561193601734 -0.80988964354812443
+0.1418121948905855 0.51101182387798283 0.84695178356442269  -0.86108611456980888 -0.47782642632713573 -0.17381774822643467
+0.12310298935169572 0.55521070025011254 0.82226795238624728  -0.54699716260005082 -0.8250054127899169 0.14198652391981534
+0.097085389413467671 0.57018003072289591 1.0000000000000002  -0.90300980278163401 -0.42961984965260008 0.00028436728304630964
+0.10657204968447231 0.57283811630245096 0.86100639327308426  -0.56506561193601723 -0.80988964354812465 0.15741543596758889
+0.66704995977036097 0.095052466200525487 0.73781627941851213  -0.33340690397517719 -0.90406837259895867 -0.26739523938910653
+0.69602657944578872 0.09312926541647408 0.71089969747156689  -0.30244718988226732 -0.90831680955776628 -0.28893990864385699
+0.82416586116838464 0.5512195414246408 0.12458499692215486  -0.17844712110944724 -0.44918580997762436 -0.8754363101234125
+0.10542210643598447 0.60871986758868468 0.78560578771446687  -0.88272155572186639 -0.40347958770451692 -0.24084616951440374
+0.58417903277383187 0.11307342108777625 0.80253395542112949  -0.42149610172113205 -0.88421545010984015 -0.20125623970685214
+0.74328545761836984 0.095572989323982616 0.66096525556418162  -0.23862737818799848 -0.91299254504581195 -0.3309102402010145
+0.41572101967839092 0.37325238119242865 1.5155632797953904  -0.58403467808965159 -0.62675731827798065 0.51582822603431766
+0.30883755347893571 0.44783116020585167 1.4662660666179785  -0.69097715483087263 -0.55222595833073107 0.46647300291392857
+0.18870753060675916 0.64637064705828351 1.465565043623166  -0.81121902067950946 -0.35387698305874238 0.46550486715932421
+0.21562876162628952 0.53132295016564968 1.4063294025426436  -0.7842409511990085 -0.46877433341209029 0.40646863937642819
+0.054616750927505398 0.68136436973507708 1.0687157005262189  -0.94544807568691724 -0.31851500876272487 0.068382200701546339
+0.10657204968447231 0.57283811630245096 1.138993606726916  -0.89352037004910578 -0.42704736713517849 0.13875119650014278
+0.23042216149782369 0.37659777085683765 1.1382736821873727  -0.76972539034249143 -0.62320039727703613 0.13836216352689593
+0.17528355798277517 0.47420617247402497 1.2082874004879671  -0.82482450355065084 -0.52568280774650455 0.20813967421463439
+0.93128429947378155 0.054616750927505398 1.3186356302649231  -0.068666567984591462 -0.94527232704070618 0.31897512469198219
+0.86100639327308448 0.10657204968447231 1.4271618836975493  -0.138751196500143 -0.89352037004910545 0.42704736713517877
+0.86172631781262776 0.23042216149782357 1.6234022291431622  -0.13836216352689648 -0.76972539034249099 0.62320039727703647
+0.79171259951203343 0.17528355798277517 1.5257938275259753  -0.20813967421463486 -0.82482450355065051 0.52568280774650489
+0.41572101967839103 1.6267476188075713 0.48443672020460948  -0.58449479401890869 0.62647295099493472 -0.51565247738810649
+0.30883755347893582 1.5521688397941484 0.53373393338202169  -0.69097715483087219 0.55222595833073196 -0.46647300291392818
+0.18870753060675916 1.3536293529417167 0.53443495637683425  -0.81121902067950924 0.35387698305874377 -0.46550486715932354
+0.21562876162628952 1.4686770498343509 0.59367059745735706  -0.78424095119900927 0.46877433341208979 -0.40646863937642735
+0.054616750927505398 0.68136436973507708 0.93128429947378155  -0.94527232704070629 -0.31897512469198197 -0.068666567984591406
+0.020669276508302414 0.79773449620553682 1  -0.97927332546590939 -0.20254321521823182 -3.0910690417825027e-16
+0.022968417915120942 0.91971872264975907 1.1973935260228461  -0.97707738033578007 -0.080345839839677774 0.19714040391717347
+0.0055291226396741999 0.91862905394330996 1.0663810456382175  -0.99445714115859518 -0.081578796887611507 0.066331699036312863
+1 1.5739215462855711 1.8189102873387162  0.00078604920685526928 0.57538069819453364 0.81788534298629867
+1.116269135355652 1.553923611197678 1.8244089525965697  0.11760246779863172 0.55440616112166219 0.823895301648221
+1.2595222183644983 1.3961011738843632 1.8807678912304873  0.25988482570664379 0.39599581735923556 0.880708345595418
+1.2345849586062214 1.5157160292432703 1.8240187342392598  0.23530638500725778 0.51562318151862341 0.82387113061171702
+1.280755298723806 1 1.9597793820657468  0.28060440841513784 0.00037212726837773511 0.95982343558556982
+1.2788981373351191 1.1362409534038143 1.9506072962094394  0.27889806070390455 0.13594944033505804 0.95064905270461697
+1.3759607778954341 1.3392409609172167 1.8623045076538935  0.37608264246842493 0.33912378489964834 0.86229745711633865
+1.2726998137406516 1.2691171673622652 1.9236940845413728  0.27282039415738768 0.26880216379452282 0.92375019852295037
+0.94514285928638309 1.5400179687989204 1.8398638505656821  -0.056307189018218164 0.5410667466969773 0.83909253130010375
+1 1.625781888690033 1.7799980947332728  -0.00023519417927709139 0.62694312538533037 0.77906499229253767
+1.2001281403434438 1.6801807185069526 1.7051970771451344  0.20029565457621398 0.68040299513329283 0.7049350430866167
+1.0672770740243225 1.7022770253220765 1.7087176976875216  0.067501320615790325 0.70276863564904046 0.70820887911908481
+1.5666478495993443 1.5237239478373752 1.6361001815799718  0.56632219140540208 0.52380155193385269 0.63632626043050466
+1.451266665607259 1.5875076190110726 1.6717091588743203  0.45142526361231922 0.58763152153323206 0.67149417441485415
+1.2728788208449453 1.7402458861856145 1.6144698341819117  0.27300775118978182 0.74028370995146753 0.61436698850995375
+1.3283955572053112 1.6406145370870959 1.694096083320241  0.32871571883365275 0.64057192708348176 0.69398384882087094
+0.96609642251334915 1.4851608280853035 1.8737674280523333  -0.034313951497558837 0.48348770334523666 0.87467833713118315
+0.88373086464434814 1.553923611197678 1.8244089525965697  -0.11774782579538165 0.55402560894563235 0.82413049582750042
+0.86416377447305925 1.7199153070653639 1.6806397508870439  -0.13609530337963499 0.7200809942624572 0.68041269101920498
+0.80699455980445267 1.624572621678267 1.7567416602149373  -0.19358827458119529 0.62484261256047691 0.75636980999592618
+1.0694523319806282 1.9168554803037774 1.3931315324664026  0.069401954456726395 0.91670068154564299 0.39350124418016791
+1.0000000000000002 1.8664057563461913 1.499340630602181  0.00015872199696848172 0.86652958223713639 0.49912569350341157
+0.79268760819673556 1.7807681678543315 1.5894256868089485  -0.20735457304096547 0.78085960551688605 0.58928970592656038
+0.93025980236669126 1.8004723406749188 1.5952985273360616  -0.069662907281837369 0.80067536950372575 0.59503447968929846
+1.0339035774866507 1.4851608280853035 1.8737674280523333  0.035585805831079731 0.48427375255209087 0.8741925320045173
+0.92814172250764548 1.437654475842026 1.8962672300889245  -0.072917516439696836 0.43665833532627646 0.89666746009117093
+0.71592045537741122 1.4603930887008656 1.8410333026720758  -0.28440717777405683 0.46019616855581263 0.8410303464662533
+0.81343900392119473 1.3899876630720456 1.9017231378830692  -0.18714545413041628 0.38953622755321821 0.90179715370028068
+0.47627605216262503 1.6361001815799718 1.5666478495993443  -0.5234294246654736 0.63609627313050621 0.56692430597377952
+0.54873333439274141 1.5875076190110726 1.6717091588743203  -0.45142526361231849 0.5876315215332345 0.67149417441485248
+0.59899507473160263 1.4048073899588975 1.8217822259851766  -0.40115992505181813 0.40477696304846245 0.82172156155092047
+0.62850263027516928 1.5277725269342672 1.7638362809535502  -0.37176976328895944 0.52785497534633885 0.76364675610270694
+1.0548571407136167 1.5400179687989204 1.8398638505656821  0.056307189018217581 0.5410667466969783 0.83909253130010319
+1.0718582774923548 1.4376544758420258 1.8962672300889245  0.07291751643969803 0.43665833532627779 0.89666746009117015
+0.96026541144158839 1.2602649483574222 1.9647192955096329  -0.039677999129163588 0.2599005139796019 0.96481986879326076
+1.0777044036438097 1.3227105890477233 1.943302656293743  0.077926023088562446 0.32203490693742859 0.94351526412634279
+0.60686846753359758 1.0694523319806275 1.9168554803037776  -0.39350124418016746 0.069401954456725104 0.91670068154564333
+0.72110186266488108 1.1362409534038143 1.9506072962094394  -0.27889806070390422 0.13594944033505585 0.95064905270461741
+0.95947771833128326 1.1319285691139529 1.9904306120773461  -0.040575895565417137 0.13176921185868215 0.99044963097837846
+0.84014219641217736 1.1993769697289565 1.9667958970608925  -0.16010344242024352 0.19913925651268669 0.96680424297825784
+0.94514285928638309 1.5400179687989204 0.16013614943431764  -0.056307189018220856 0.54106674669697641 -0.83909253130010419
+0.92814172250764526 1.4376544758420258 0.10373276991107527  -0.072536964263669665 0.43642314114699976 -0.89681281808792024
+1.0397345885584115 1.2602649483574222 0.035280704490367243  0.039677999129163984 0.25990051397960023 -0.9648198687932612
+0.92229559635619074 1.3227105890477233 0.056697343706257008  -0.077926023088562335 0.32203490693742837 -0.9435152641263429
+1.3931315324664024 1.0694523319806275 0.083144519696222496  0.39289912961179058 0.069774081725104437 -0.91693066884564167
+1.2788981373351191 1.1362409534038143 0.049392703790560599  0.27915487828976138 0.13610816233202574 -0.95055095711572846
+1.0405222816687172 1.1319285691139529 0.009569387922654049  0.040575895565418019 0.13176921185868254 -0.99044963097837835
+1.1598578035878229 1.1993769697289562 0.033204102939107583  0.16010344242024346 0.19913925651268541 -0.96680424297825807
+1 1.5739215462855709 0.1810897126612836  0.00078604920685582482 0.57538069819453475 -0.81788534298629789
+0.88373086464434825 1.5539236111976775 0.17559104740343034  -0.11774782579538297 0.55402560894563369 -0.82413049582749931
+0.74047778163550204 1.3961011738843632 0.11923210876951273  -0.25988482570664434 0.39599581735923634 -0.88070834559541755
+0.76541504139377881 1.5157160292432705 0.17598126576074025  -0.23530638500725864 0.51562318151862241 -0.82387113061171746
+0.71924470127619444 1 0.040220617934253244  -0.28060440841513601 0.00037212726837965399 -0.95982343558557037
+0.7211018626648813 1.1362409534038143 0.049392703790560599  -0.2788980607039046 0.13594944033505643 -0.95064905270461719
+0.6240392221045663 1.3392409609172167 0.13769549234610656  -0.3760826424684246 0.33912378489964895 -0.86229745711633865
+0.72730018625934878 1.2691171673622652 0.076305915458627194  -0.27282039415738779 0.26880216379452376 -0.92375019852295004
+1.0548571407136167 1.5400179687989204 0.16013614943431764  0.056792994144885971 0.5397948923634569 -0.83987858050695807
+1 1.6257818886900326 0.22000190526672714  0.00023519417927899073 0.62694312538533015 -0.77906499229253801
+0.79987185965655661 1.6801807185069528 0.29480292285486565  -0.20029565457621096 0.68040299513329372 -0.7049350430866167
+0.93272292597567807 1.7022770253220765 0.29128230231247854  -0.067501320615790408 0.70276863564904013 -0.70820887911908514
+0.43335215040065567 1.5237239478373752 0.36389981842002816  -0.56692430597377952 0.52342942466547393 -0.6360962731305061
+0.54873333439274141 1.5875076190110726 0.32829084112567963  -0.45142526361231822 0.58763152153323361 -0.67149417441485348
+0.72712117915505492 1.7402458861856145 0.38553016581808797  -0.27300775118978005 0.74028370995146853 -0.61436698850995342
+0.671604442794689 1.6406145370870961 0.30590391667975902  -0.32871571883365341 0.64057192708348243 -0.69398384882087005
+1.0339035774866507 1.4851608280853033 0.12623257194766668  0.035585805831079308 0.4842737525520906 -0.87419253200451741
+1.116269135355652 1.5539236111976775 0.17559104740343034  0.11774782579538226 0.55402560894563413 -0.8241304958274992
+1.135836225526941 1.7199153070653639 0.31936024911295646  0.13609530337963652 0.72008099426245631 -0.68041269101920554
+1.1930054401955479 1.6245726216782668 0.24325833978506295  0.19358827458119438 0.62484261256047802 -0.75636980999592551
+0.93054766801937283 1.9168554803037776 0.60686846753359758  -0.06940195445672484 0.91670068154564366 -0.3935012441801668
+1.0000000000000002 1.8664057563461918 0.50065936939781919  -0.00015872199696717758 0.86652958223713727 -0.49912569350340996
+1.2073123918032649 1.7807681678543315 0.41057431319105175  0.20735457304096586 0.78085960551688727 -0.5892897059265586
+1.069740197633309 1.800472340674919 0.40470147266393852  0.069662907281837591 0.80067536950372598 -0.59503447968929846
+0.96609642251334915 1.4851608280853033 0.12623257194766668  -0.035585805831078642 0.48427375255209082 -0.87419253200451719
+1.0718582774923548 1.437654475842026 0.1037327699110755  0.072536964263670914 0.4364231411470002 -0.89681281808791991
+1.2840795446225894 1.4603930887008656 0.15896669732792434  0.28440717777405761 0.46019616855581352 -0.84103034646625252
+1.1865609960788057 1.3899876630720458 0.098276862116930985  0.18714545413041625 0.38953622755321882 -0.90179715370028046
+1.5237239478373752 1.6361001815799718 0.43335215040065567  0.52380155193385236 0.63632626043050511 -0.56632219140540196
+1.4512666656072588 1.5875076190110726 0.32829084112567986  0.45152335920120801 0.58737470394737523 -0.67165289641182235
+1.401004925268398 1.4048073899588978 0.17821777401482353  0.40115992505181947 0.40477696304846317 -0.82172156155091958
+1.3714973697248309 1.5277725269342675 0.23616371904645017  0.37176976328895894 0.5278549753463373 -0.76364675610270816
+1.4851608280853033 0.12623257194766668 0.96609642251334915  0.48348770334523633 -0.87467833713118337 -0.034313951497558476
+1.437654475842026 0.1037327699110755 1.0718582774923548  0.43642314114700065 -0.89681281808791968 0.072536964263671552
+1.4603930887008658 0.15896669732792457 1.2840795446225894  0.46019616855581374 -0.84103034646625263 0.284407177774057
+1.3899876630720458 0.098276862116930763 1.1865609960788057  0.38953622755321993 -0.90179715370027991 0.18714545413041681
+1.6361001815799718 0.43335215040065567 1.5237239478373752  0.63632626043050511 -0.56632219140540196 0.52380155193385236
+1.5875076190110726 0.32829084112567986 1.4512666656072588  0.58763152153323306 -0.67149417441485337 0.45142526361231905
+1.4048073899588978 0.17821777401482364 1.401004925268398  0.40477696304846195 -0.82172156155092002 0.40115992505181974
+1.5277725269342675 0.23616371904645017 1.3714973697248309  0.52785497534633785 -0.76364675610270727 0.37176976328895983
+1.5400179687989204 0.16013614943431764 0.94514285928638309  0.54106674669697652 -0.83909253130010431 -0.056307189018218975
+1.4376544758420258 0.10373276991107527 0.92814172250764526  0.4366583353262789 -0.89666746009116971 -0.072917516439698085
+1.2602649483574222 0.035280704490367243 1.0397345885584115  0.25990051397960084 -0.96481986879326098 0.039677999129164941
+1.3227105890477233 0.056697343706257008 0.92229559635619074  0.32203490693742803 -0.94351526412634312 -0.077926023088561711
+1.0694523319806275 0.083144519696222496 1.3931315324664024  0.069401954456725812 -0.9167006815456431 0.39350124418016769
+1.1362409534038143 0.049392703790560599 1.2788981373351191  0.13610816233202494 -0.95055095711572812 0.27915487828976271
+1.1319285691139529 0.009569387922654049 1.0405222816687172  0.13176921185868193 -0.99044963097837835 0.040575895565418935
+1.1993769697289562 0.033204102939107583 1.1598578035878229  0.19913925651268541 -0.96680424297825807 0.16010344242024346
+1.5739215462855713 0.18108971266128371 1  0.57538069819453497 -0.81788534298629778 -0.00078604920685504712
+1.553923611197678 0.17559104740343034 0.88373086464434814  0.55402560894563335 -0.82413049582749964 -0.11774782579538265
+1.3961011738843634 0.11923210876951285 0.74047778163550193  0.39599581735923639 -0.88070834559541744 -0.2598848257066444
+1.5157160292432708 0.17598126576074047 0.76541504139377869  0.51562318151862241 -0.82387113061171735 -0.23530638500725837
+1 0.040220617934253244 0.71924470127619444  -0.0003721272683797147 -0.95982343558557037 -0.28060440841513612
+1.1362409534038143 0.049392703790560488 0.7211018626648813  0.13610816233202566 -0.95055095711572812 -0.27915487828976282
+1.3392409609172167 0.13769549234610656 0.6240392221045663  0.33912378489964895 -0.86229745711633865 -0.3760826424684246
+1.2691171673622652 0.076305915458627194 0.72730018625934878  0.26880216379452376 -0.92375019852295004 -0.27282039415738779
+1.5400179687989204 0.16013614943431764 1.0548571407136167  0.54106674669697641 -0.83909253130010419 0.056307189018220412
+1.6257818886900326 0.22000190526672714 1  0.62694312538533081 -0.77906499229253745 -0.0002351941792781122
+1.6801807185069528 0.29480292285486565 0.79987185965655661  0.6804029951332935 -0.70493504308661659 -0.20029565457621204
+1.7022770253220765 0.29128230231247854 0.93272292597567807  0.70276863564904013 -0.70820887911908503 -0.067501320615790922
+1.5237239478373752 0.36389981842002816 0.43335215040065567  0.5238015519338528 -0.63632626043050533 -0.5663221914054013
+1.5875076190110728 0.32829084112567974 0.5487333343927413  0.5873747039473759 -0.67165289641182191 -0.45152335920120767
+1.7402458861856145 0.38553016581808797 0.72712117915505492  0.74028370995146875 -0.61436698850995308 -0.27300775118977982
+1.6406145370870964 0.30590391667975914 0.67160444279468889  0.64057192708348409 -0.69398384882086916 -0.32871571883365186
+1.4851608280853033 0.12623257194766668 1.0339035774866507  0.48348770334523605 -0.87467833713118348 0.034313951497558996
+1.5539236111976777 0.17559104740343046 1.116269135355652  0.55402560894563402 -0.8241304958274992 0.11774782579538288
+1.7199153070653639 0.31936024911295646 1.135836225526941  0.72008099426245642 -0.68041269101920565 0.13609530337963585
+1.6245726216782668 0.24325833978506295 1.1930054401955479  0.62484261256047746 -0.75636980999592585 0.19358827458119496
+1.9168554803037776 0.6068684675335978 0.93054766801937272  0.91670068154564366 -0.39350124418016685 -0.069401954456724965
+1.8664057563461918 0.50065936939781919 1.0000000000000002  0.86652958223713727 -0.49912569350340996 -0.00015872199696717758
+1.7807681678543315 0.41057431319105175 1.2073123918032649  0.7808596055168876 -0.58928970592655816 0.20735457304096555
+1.800472340674919 0.40470147266393852 1.069740197633309  0.80067536950372598 -0.59503447968929846 0.069662907281837591
+1.8189102873387162 1 1.5739215462855713  0.81788534298629878 -0.00078604920685488569 0.57538069819453364
+1.8244089525965697 1.116269135355652 1.553923611197678  0.82413049582749975 0.11774782579538146 0.55402560894563346
+1.8807678912304873 1.2595222183644983 1.3961011738843632  0.880708345595418 0.25988482570664379 0.39599581735923556
+1.8240187342392593 1.2345849586062214 1.5157160292432708  0.82387113061171691 0.23530638500725823 0.51562318151862341
+1.9597793820657468 1.280755298723806 1  0.95982343558556982 0.28060440841513784 0.00037212726837924942
+1.9506072962094394 1.2788981373351191 1.1362409534038143  0.95064905270461708 0.2788980607039046 0.13594944033505654
+1.8623045076538935 1.3759607778954341 1.3392409609172167  0.86229745711633865 0.37608264246842493 0.33912378489964834
+1.9236940845413728 1.2726998137406516 1.2691171673622652  0.92375019852295037 0.27282039415738768 0.26880216379452282
+1.0339035774866507 0.51483917191469653 0.12623257194766679  0.035585805831079294 -0.4842737525520906 -0.87419253200451741
+0.92814172250764548 0.56234552415797401 0.1037327699110755  -0.072917516439697974 -0.43665833532627818 -0.89666746009117004
+0.34253810440658672 0.25355721782048268 0.90387507728811034  -0.65866036402230654 -0.74597391594557105 -0.09843496124260237
+0.81343900392119461 0.6100123369279542 0.098276862116930763  -0.18714545413041345 -0.3895362275532307 -0.90179715370027591
+0.098424941615366676 0.758150485750266 0.64339140453754151  -0.89862238304022934 -0.24555619785558172 -0.36356562872995801
+0.77318510024650355 0.10194841255523886 0.62479622481419606  -0.23977066491306379 -0.89859032272364059 -0.3674853196449766
+0.093129265416474122 0.71089969747156689 0.69602657944578861  -0.90831680955776672 -0.28893990864385294 -0.30244718988226948
+0.14854713354961635 0.85435218642293975 0.49724573572225772  -0.85521146872291121 -0.13337026124727611 -0.50082503649441745
+0.16013614943431764 1.0548571407136167 0.45998203120107961  -0.83987858050695829 0.056792994144885638 -0.53979489236345668
+0.1037327699110755 1.0718582774923548 0.56234552415797401  -0.89666746009117027 0.072917516439698071 -0.43665833532627762
+0.035280704490367243 0.96026541144158839 0.73973505164257791  -0.9648198687932612 -0.039677999129164657 -0.25990051397960007
+0.056697343706257008 1.0777044036438097 0.67728941095227668  -0.9435152641263429 0.077926023088562127 -0.32203490693742853
+0.083144519696222274 0.6068684675335978 0.93054766801937272  -0.91670068154564299 -0.39350124418016813 -0.069401954456725076
+0.049392703790560488 0.72110186266488108 0.86375904659618619  -0.95064905270461719 -0.27889806070390466 -0.13594944033505613
+0.009569387922653938 0.95947771833128337 0.86807143088604799  -0.99044963097837846 -0.040575895565417984 -0.13176921185868187
+0.033204102939107361 0.84014219641217736 0.80062303027104398  -0.96680424297825818 -0.16010344242024252 -0.19913925651268555
+0.16013614943431764 1.0548571407136167 1.5400179687989204  -0.83909253130010475 0.056307189018218066 0.54106674669697585
+0.22000190526672714 1 1.6257818886900326  -0.77906499229253823 -0.0002351941792800324 0.6269431253853297
+0.29480292285486576 0.79987185965655661 1.6801807185069526  -0.70493504308661714 -0.20029565457621229 0.68040299513329294
+0.29128230231247854 0.93272292597567807 1.7022770253220765  -0.70820887911908503 -0.067501320615792657 0.70276863564904002
+0.36389981842002828 0.43335215040065567 1.5237239478373752  -0.63632626043050422 -0.56632219140540263 0.52380155193385269
+0.32829084112567974 0.5487333343927413 1.5875076190110728  -0.6714941744148536 -0.45142526361231916 0.58763152153323273
+0.38553016581808797 0.72712117915505492 1.7402458861856145  -0.61436698850995308 -0.27300775118978055 0.74028370995146875
+0.30590391667975914 0.67160444279468889 1.6406145370870964  -0.69398384882086939 -0.32871571883365208 0.64057192708348376
+0.51483917191469653 1.8737674280523331 1.0339035774866507  -0.48427375255208899 0.87419253200451819 0.03558580583107953
+0.44607638880232214 1.8244089525965697 1.116269135355652  -0.5540256089456348 0.82413049582749864 0.11774782579538236
+0.28008469293463611 1.6806397508870439 1.135836225526941  -0.72008099426245598 0.68041269101920598 0.13609530337963682
+0.37542737832173323 1.7567416602149373 1.1930054401955479  -0.62484261256047635 0.7563698099959264 0.19358827458119596
+0.083144519696222496 1.3931315324664026 0.93054766801937272  -0.91693066884564167 0.39289912961179096 -0.069774081725102965
+0.13359424365380856 1.499340630602181 1.0000000000000002  -0.86652958223713694 0.49912569350341057 -0.00015872199696842786
+0.21923183214566888 1.5894256868089487 1.2073123918032649  -0.78085960551688627 0.5892897059265596 0.20735457304096697
+0.19952765932508121 1.5952985273360616 1.069740197633309  -0.80067536950372642 0.59503447968929779 0.069662907281836647
+0.94514285928638309 0.4599820312010795 1.8398638505656821  -0.056307189018218594 -0.54106674669697619 0.83909253130010453
+0.92814172250764526 0.56234552415797401 1.8962672300889243  -0.072536964263670414 -0.4364231411470002 0.89681281808791991
+1.0397345885584115 0.73973505164257791 1.9647192955096329  0.039677999129162471 -0.25990051397960112 0.96481986879326098
+0.92229559635619063 0.67728941095227657 1.943302656293743  -0.077926023088562266 -0.32203490693742931 0.94351526412634257
+1.3931315324664026 0.93054766801937272 1.9168554803037776  0.39350124418016702 -0.069401954456725756 0.91670068154564333
+1.2788981373351191 0.86375904659618619 1.9506072962094394  0.27915487828976282 -0.13610816233202519 0.95055095711572812
+1.0405222816687172 0.86807143088604788 1.9904306120773461  0.040575895565418026 -0.13176921185868287 0.99044963097837824
+1.1598578035878231 0.80062303027104387 1.9667958970608925  0.16010344242024496 -0.19913925651268566 0.96680424297825773
+1.8737674280523331 0.96609642251334915 1.4851608280853035  0.87467833713118304 -0.034313951497559204 0.48348770334523677
+1.8244089525965697 0.88373086464434814 1.553923611197678  0.82413049582749998 -0.11774782579538136 0.55402560894563324
+1.6806397508870439 0.86416377447305925 1.7199153070653639  0.68041269101920498 -0.13609530337963499 0.7200809942624572
+1.7567416602149373 0.80699455980445267 1.624572621678267  0.75636980999592485 -0.19358827458119449 0.62484261256047868
+1.3931315324664026 1.0694523319806277 1.9168554803037774  0.39350124418016719 0.069401954456725631 0.91670068154564333
+1.499340630602181 1.0000000000000002 1.8664057563461913  0.49912569350341157 0.00015872199696846261 0.86652958223713639
+1.5894256868089485 0.79268760819673556 1.7807681678543315  0.58928970592655894 -0.20735457304096452 0.78085960551688738
+1.5952985273360616 0.93025980236669126 1.8004723406749188  0.59503447968929846 -0.069662907281837383 0.80067536950372575
+1.8398638505656821 0.94514285928638309 1.5400179687989204  0.83909253130010408 -0.056307189018218372 0.54106674669697674
+1.7799980947332728 1 1.625781888690033  0.77906499229253701 -0.00023519417927646462 0.62694312538533126
+1.7051970771451344 1.2001281403434438 1.6801807185069526  0.70493504308661703 0.20029565457621298 0.68040299513329283
+1.7087176976875216 1.0672770740243225 1.7022770253220765  0.70820887911908414 0.067501320615789839 0.70276863564904124
+1.6361001815799718 1.5666478495993443 1.5237239478373752  0.63609627313050587 0.56692430597378018 0.52342942466547326
+1.6717091588743203 1.4512666656072586 1.5875076190110728  0.67165289641182346 0.45152335920120673 0.5873747039473749
+1.6144698341819117 1.2728788208449453 1.7402458861856145  0.61436698850995297 0.27300775118978177 0.74028370995146831
+1.694096083320241 1.3283955572053112 1.6406145370870959  0.69398384882087072 0.32871571883365419 0.64057192708348132
+1.5400179687989204 1.8398638505656821 0.94514285928638309  0.54106674669697674 0.83909253130010408 -0.05630718901821833
+1.625781888690033 1.7799980947332728 1  0.62694312538533126 0.77906499229253701 -0.00023519417927646462
+1.6801807185069526 1.7051970771451344 1.2001281403434438  0.68040299513329283 0.7049350430866167 0.20029565457621398
+1.7022770253220765 1.7087176976875216 1.0672770740243225  0.70276863564904035 0.70820887911908503 0.067501320615790408
+1.5237239478373752 1.6361001815799718 1.5666478495993443  0.52342942466547404 0.63609627313050632 0.56692430597377896
+1.5875076190110726 1.67170915887432 1.4512666656072588  0.58737470394737423 0.67165289641182258 0.45152335920120901
+1.7402458861856145 1.6144698341819117 1.2728788208449453  0.74028370995146753 0.61436698850995375 0.27300775118978182
+1.6406145370870959 1.694096083320241 1.3283955572053112  0.64057192708348165 0.69398384882087072 0.32871571883365364
+1.5739215462855713 1.8189102873387162 1  0.57538069819453364 0.81788534298629878 -0.00078604920685487007
+1.5539236111976777 1.8244089525965697 1.116269135355652  0.55440616112166174 0.82389530164822156 0.11760246779863132
+1.3961011738843632 1.8807678912304873 1.2595222183644983  0.39599581735923556 0.880708345595418 0.25988482570664373
+1.5157160292432703 1.8240187342392598 1.2345849586062214  0.51562318151862307 0.82387113061171724 0.2353063850072579
+1 1.9597793820657468 1.280755298723806  0.0003721272683792859 0.95982343558556993 0.28060440841513778
+1.1362409534038143 1.9506072962094394 1.2788981373351191  0.13594944033505654 0.95064905270461708 0.2788980607039046
+1.3392409609172167 1.8623045076538935 1.3759607778954341  0.33912378489965089 0.86229745711633787 0.37608264246842449
+1.2691171673622652 1.9236940845413728 1.2726998137406516  0.26880216379452282 0.92375019852295037 0.27282039415738768
+0.4599820312010795 1.8398638505656821 0.94514285928638309  -0.5410667466969753 0.83909253130010486 -0.056307189018220093
+0.56234552415797401 1.8962672300889243 0.92814172250764526  -0.43642314114700048 0.89681281808791979 -0.072536964263670289
+0.73973505164257791 1.9647192955096329 1.0397345885584115  -0.25990051397960201 0.96481986879326076 0.039677999129163886
+0.67728941095227657 1.943302656293743 0.92229559635619063  -0.32203490693742948 0.94351526412634257 -0.077926023088562335
+0.93054766801937272 1.9168554803037776 1.3931315324664026  -0.069401954456725715 0.91670068154564344 0.39350124418016696
+0.86375904659618619 1.9506072962094394 1.2788981373351191  -0.13610816233202519 0.95055095711572812 0.27915487828976282
+0.86807143088604799 1.9904306120773461 1.0405222816687167  -0.13176921185868198 0.99044963097837835 0.040575895565419275
+0.80062303027104398 1.9667958970608925 1.1598578035878231  -0.19913925651268546 0.96680424297825784 0.16010344242024499
+0.51483917191469653 1.8737674280523331 0.96609642251334915  -0.4834877033452355 0.8746783371311837 -0.034313951497560995
+0.56234552415797401 1.8962672300889243 1.0718582774923548  -0.43642314114700154 0.89681281808791924 0.072536964263670359
+0.53960691129913463 1.8410333026720758 1.2840795446225892  -0.46019616855581419 0.84103034646625274 0.28440717777405577
+0.61001233692795442 1.9017231378830692 1.1865609960788057  -0.38953622755321837 0.90179715370028024 0.18714545413041764
+0.36389981842002839 1.5666478495993443 1.5237239478373752  -0.63632626043050433 0.56632219140540208 0.52380155193385314
+0.41249238098892749 1.6717091588743205 1.4512666656072588  -0.58763152153323117 0.67149417441485504 0.45142526361231899
+0.59519261004110291 1.8217822259851766 1.4010049252683978  -0.404776963048462 0.82172156155091969 0.4011599250518203
+0.47222747306573287 1.7638362809535502 1.3714973697248309  -0.52785497534633763 0.76364675610270771 0.37176976328895911
+0.12623257194766668 0.96609642251334915 1.4851608280853033  -0.87419253200451685 -0.035585805831078648 0.48427375255209165
+0.1037327699110755 1.0718582774923548 1.437654475842026  -0.89681281808791968 0.072536964263671552 0.43642314114700065
+0.15896669732792457 1.2840795446225894 1.4603930887008658  -0.84103034646625263 0.284407177774057 0.46019616855581374
+0.098276862116930985 1.1865609960788057 1.3899876630720458  -0.9017971537002798 0.18714545413041681 0.38953622755321982
+0.43335215040065567 1.5237239478373752 1.6361001815799718  -0.56692430597378018 0.52342942466547338 0.63609627313050587
+0.32829084112567997 1.4512666656072586 1.5875076190110731  -0.67165289641182224 0.45152335920120762 0.58737470394737579
+0.17821777401482364 1.401004925268398 1.4048073899588978  -0.82172156155091958 0.4011599250518203 0.40477696304846228
+0.23616371904645039 1.3714973697248309 1.5277725269342679  -0.76364675610270738 0.37176976328895972 0.52785497534633796
+0.12623257194766668 1.0339035774866507 1.4851608280853033  -0.87467833713118337 0.034313951497558101 0.48348770334523627
+0.17559104740343034 1.116269135355652 1.553923611197678  -0.82413049582749986 0.11774782579538312 0.5540256089456328
+0.31936024911295646 1.135836225526941 1.7199153070653639  -0.68041269101920565 0.13609530337963585 0.72008099426245642
+0.24325833978506295 1.1930054401955479 1.6245726216782668  -0.75636980999592573 0.19358827458119499 0.62484261256047757
+0.60686846753359758 0.93054766801937272 1.9168554803037776  -0.39350124418016741 -0.069401954456725312 0.91670068154564333
+0.50065936939781919 1.0000000000000002 1.8664057563461918  -0.49912569350341002 -0.00015872199696717761 0.86652958223713739
+0.41057431319105175 1.2073123918032649 1.7807681678543315  -0.58928970592655816 0.20735457304096558 0.78085960551688771
+0.40470147266393852 1.069740197633309 1.800472340674919  -0.59503447968929879 0.069662907281837827 0.80067536950372564
+1 0.42607845371442854 1.8189102873387162  -0.00078604920685408902 -0.57538069819453419 0.81788534298629822
+0.88373086464434814 0.44607638880232214 1.8244089525965697  -0.11774782579538169 -0.55402560894563246 0.82413049582750031
+0.74047778163550215 0.60389882611563706 1.8807678912304873  -0.2598848257066434 -0.39599581735923622 0.88070834559541789
+0.76541504139377881 0.48428397075672935 1.8240187342392595  -0.23530638500725778 -0.51562318151862263 0.82387113061171757
+0.71924470127619433 1.0000000000000002 1.9597793820657468  -0.28060440841513751 0.00037212726837982762 0.95982343558556993
+0.72110186266488108 0.8637590465961863 1.9506072962094394  -0.27889806070390427 -0.13594944033505543 0.95064905270461741
+0.6240392221045663 0.66075903908278344 1.8623045076538935  -0.37608264246842532 -0.33912378489964851 0.86229745711633843
+0.72730018625934878 0.73088283263773501 1.9236940845413728  -0.27282039415738879 -0.26880216379452365 0.92375019852294971
+1.8737674280523331 1.0339035774866507 0.5148391719146963  0.87467833713118337 0.03431395149755935 -0.48348770334523616
+1.8244089525965697 1.116269135355652 0.44607638880232214  0.82413049582749898 0.11774782579538207 -0.55402560894563446
+1.6806397508870439 1.135836225526941 0.28008469293463611  0.68041269101920598 0.13609530337963621 -0.72008099426245609
+1.7567416602149373 1.1930054401955479 0.37542737832173323  0.75636980999592651 0.19358827458119438 -0.62484261256047668
+1.3931315324664024 0.93054766801937272 0.083144519696222496  0.39350124418016758 -0.069401954456724785 -0.91670068154564321
+1.499340630602181 1.0000000000000002 0.13359424365380856  0.49912569350341057 -0.00015872199696842786 -0.86652958223713694
+1.5894256868089485 1.2073123918032649 0.21923183214566877  0.58928970592655883 0.20735457304096683 -0.78085960551688693
+1.5952985273360616 1.069740197633309 0.19952765932508121  0.59503447968929779 0.069662907281837133 -0.80067536950372642
+1 0.42607845371442854 0.18108971266128371  -0.00078604920685503151 -0.5753806981945343 -0.81788534298629811
+1.116269135355652 0.44607638880232214 0.17559104740343046  0.11774782579538288 -0.55402560894563369 -0.82413049582749931
+1.2595222183644985 0.60389882611563694 0.11923210876951296  0.25988482570664367 -0.39599581735923617 -0.88070834559541777
+1.2345849586062214 0.48428397075672935 0.17598126576074047  0.23530638500725881 -0.5156231815186233 -0.82387113061171691
+1.2807552987238058 1.0000000000000002 0.040220617934253244  0.2806044084151369 0.00037212726837912603 -0.95982343558557015
+1.2788981373351191 0.86375904659618641 0.049392703790560599  0.27889806070390505 -0.1359494403350564 -0.95064905270461708
+1.3759607778954341 0.66075903908278333 0.13769549234610656  0.37608264246842521 -0.33912378489964806 -0.86229745711633865
+1.2726998137406516 0.73088283263773501 0.076305915458627194  0.27282039415738812 -0.26880216379452238 -0.92375019852295037
+1.0548571407136167 0.45998203120107961 0.16013614943431764  0.056307189018219801 -0.54106674669697652 -0.83909253130010408
+1.0718582774923548 0.56234552415797401 0.1037327699110755  0.072917516439698057 -0.43665833532627801 -0.89666746009117004
+0.96026541144158839 0.73973505164257791 0.035280704490367243  -0.039677999129164136 -0.25990051397959973 -0.96481986879326131
+1.0777044036438097 0.67728941095227668 0.056697343706257008  0.077926023088562404 -0.32203490693742831 -0.9435152641263429
+0.6068684675335978 0.93054766801937272 0.083144519696222274  -0.39289912961179058 -0.069774081725103937 -0.91693066884564178
+0.7211018626648813 0.86375904659618619 0.049392703790560488  -0.27915487828976177 -0.13610816233202491 -0.95055095711572846
+0.95947771833128337 0.86807143088604799 0.009569387922653938  -0.040575895565417408 -0.13176921185868221 -0.99044963097837835
+0.84014219641217736 0.80062303027104398 0.033204102939107361  -0.16010344242024263 -0.19913925651268563 -0.96680424297825818
+0.12623257194766668 0.96609642251334915 0.51483917191469664  -0.87467833713118359 -0.034313951497558948 -0.48348770334523572
+0.17559104740343046 0.88373086464434814 0.44607638880232214  -0.84432049058386183 -0.14787325815197258 -0.51503049298439285
+0.13843733448120885 0.84282425105969117 0.5187348004145107  -0.86578380003692001 -0.15629656115483617 -0.47538384129543476
+0.87684117534766193 0.17811496227257195 0.44486756488630008  -0.10489548487252331 -0.8303416895969723 -0.54729298896532885
+0.6068684675335978 1.0694523319806277 0.083144519696222274  -0.39350124418016819 0.069401954456725243 -0.91670068154564299
+0.50065936939781919 1.0000000000000002 0.13359424365380834  -0.49912569350341002 0.00015872199696851823 -0.86652958223713739
+0.86055952199012919 0.15594877494016762 0.48342144068564141  -0.13950752053011936 -0.83662429167607066 -0.52971449507546176
+0.4047014726639383 0.93025980236669126 0.1995276593250811  -0.59503447968929823 -0.069662907281836689 -0.80067536950372598
+0.16013614943431764 0.94514285928638309 0.45998203120107972  -0.83987858050695852 -0.056792994144886172 -0.53979489236345624
+0.22000190526672725 1 0.37421811130996729  -0.77906499229253767 0.00023519417927984665 -0.62694312538533059
+0.29480292285486553 1.2001281403434438 0.3198192814930475  -0.70493504308661747 0.20029565457621371 -0.68040299513329217
+0.29128230231247842 1.0672770740243225 0.29772297467792341  -0.70820887911908548 0.067501320615792157 -0.70276863564903957
+0.36389981842002828 1.5666478495993443 0.47627605216262503  -0.63632626043050478 0.56632219140540274 -0.52380155193385192
+0.32829084112567963 1.4512666656072588 0.41249238098892738  -0.67149417441485382 0.45142526361231827 -0.58763152153323317
+0.38553016581808797 1.2728788208449453 0.25975411381438551  -0.61436698850995375 0.27300775118978016 -0.74028370995146831
+0.30590391667975902 1.3283955572053112 0.35938546291290407  -0.69398384882087027 0.32871571883365264 -0.64057192708348265
+0.45998203120107972 1.8398638505656824 1.0548571407136167  -0.53979489236345624 0.83987858050695852 0.056792994144885117
+0.37421811130996729 1.7799980947332728 1  -0.62694312538533004 0.77906499229253801 0.00023519417927956365
+0.3198192814930475 1.7051970771451346 0.79987185965655649  -0.68040299513329339 0.70493504308661681 -0.20029565457621201
+0.29772297467792341 1.7087176976875216 0.93272292597567807  -0.70276863564904024 0.70820887911908503 -0.067501320615791935
+0.47627605216262503 1.6361001815799718 0.43335215040065567  -0.52380155193385214 0.63632626043050489 -0.56632219140540241
+0.41249238098892749 1.6717091588743205 0.5487333343927413  -0.58763152153323051 0.67149417441485615 -0.45142526361231844
+0.25975411381438529 1.6144698341819119 0.72712117915505481  -0.74028370995146919 0.61436698850995297 -0.2730077511897796
+0.35938546291290396 1.694096083320241 0.67160444279468889  -0.64057192708348376 0.69398384882086983 -0.32871571883365147
+0.42607845371442887 1.8189102873387162 1  -0.5753806981945353 0.81788534298629756 -0.00078604920685339621
+0.44607638880232214 1.8244089525965697 0.88373086464434814  -0.55402560894563246 0.82413049582750031 -0.11774782579538169
+0.60389882611563706 1.8807678912304873 0.74047778163550215  -0.39599581735923833 0.880708345595417 -0.25988482570664329
+0.48428397075672935 1.8240187342392595 0.76541504139377881  -0.5156231815186233 0.82387113061171691 -0.23530638500725876
+1.0000000000000002 1.9597793820657468 0.71924470127619433  -0.00037212726837731829 0.95982343558556982 -0.2806044084151379
+0.86375904659618641 1.9506072962094394 0.72110186266488108  -0.13594944033505488 0.95064905270461753 -0.27889806070390405
+0.66075903908278344 1.8623045076538935 0.6240392221045663  -0.33912378489964895 0.86229745711633821 -0.37608264246842565
+0.73088283263773501 1.9236940845413728 0.72730018625934867  -0.26880216379452293 0.92375019852295015 -0.27282039415738812
+1.5400179687989204 1.8398638505656821 1.0548571407136167  0.53979489236345679 0.83987858050695818 0.056792994144884937
+1.437654475842026 1.8962672300889247 1.0718582774923548  0.43642314114700087 0.89681281808791968 0.072536964263669026
+1.2602649483574222 1.9647192955096329 0.96026541144158839  0.25990051397960212 0.96481986879326065 -0.039677999129163845
+1.3227105890477233 1.9433026562937428 1.0777044036438097  0.32203490693742864 0.94351526412634268 0.077926023088563473
+1.0694523319806282 1.9168554803037776 0.60686846753359758  0.069774081725103326 0.91693066884564134 -0.39289912961179169
+1.1362409534038143 1.9506072962094394 0.72110186266488119  0.13610816233202577 0.95055095711572835 -0.27915487828976199
+1.1319285691139529 1.9904306120773461 0.95947771833128304  0.13176921185868104 0.99044963097837846 -0.040575895565418782
+1.1993769697289565 1.9667958970608925 0.84014219641217713  0.19913925651268566 0.96680424297825829 -0.16010344242024166
+1.4851608280853035 1.8737674280523331 1.0339035774866507  0.48348770334523766 0.87467833713118248 0.034313951497557831
+1.4376544758420262 1.8962672300889245 0.92814172250764526  0.4366583353262784 0.89666746009117004 -0.072917516439696753
+1.4603930887008656 1.8410333026720758 0.71592045537741122  0.46019616855581302 0.84103034646625363 -0.28440717777405511
+1.3899876630720458 1.9017231378830692 0.8134390039211945  0.38953622755321887 0.90179715370028057 -0.18714545413041569
+1.6361001815799718 1.5666478495993443 0.47627605216262503  0.63609627313050654 0.56692430597377874 -0.52342942466547415
+1.5875076190110726 1.6717091588743203 0.54873333439274141  0.58763152153323406 0.6714941744148536 -0.45142526361231766
+1.4048073899588978 1.8217822259851766 0.59899507473160241  0.40477696304846061 0.82172156155092146 -0.40115992505181808
+1.5277725269342675 1.7638362809535499 0.62850263027516917  0.52785497534633918 0.7636467561027066 -0.37176976328895933
+1.8737674280523331 0.96609642251334915 0.51483917191469641  0.8741925320045173 -0.035585805831080321 -0.48427375255209076
+1.8962672300889243 1.0718582774923548 0.56234552415797401  0.89681281808791935 0.072536964263671261 -0.43642314114700126
+1.8410333026720758 1.2840795446225892 0.53960691129913463  0.84103034646625341 0.28440717777405616 -0.46019616855581286
+1.9017231378830692 1.1865609960788057 0.61001233692795442  0.90179715370028035 0.18714545413041767 -0.38953622755321843
+1.5666478495993446 1.5237239478373752 0.36389981842002828  0.56692430597377963 0.52342942466547426 -0.63609627313050576
+1.6717091588743205 1.4512666656072588 0.41249238098892749  0.67165289641182346 0.45152335920120679 -0.5873747039473749
+1.8217822259851766 1.4010049252683978 0.59519261004110291  0.82172156155092069 0.40115992505181919 -0.40477696304846128
+1.7638362809535502 1.3714973697248309 0.47222747306573287  0.76364675610270705 0.37176976328895994 -0.52785497534633818
+1.8737674280523333 1.0339035774866507 1.4851608280853035  0.87419253200451774 0.035585805831078302 0.48427375255208993
+1.8962672300889245 0.92814172250764548 1.437654475842026  0.89666746009117015 -0.072917516439696684 0.43665833532627801
+1.8410333026720758 0.71592045537741122 1.4603930887008656  0.84103034646625241 -0.28440717777405633 0.46019616855581452
+1.9017231378830692 0.81343900392119473 1.3899876630720456  0.90179715370028068 -0.18714545413041628 0.38953622755321821
+1.5666478495993443 0.47627605216262503 1.6361001815799718  0.56692430597377874 -0.52342942466547415 0.63609627313050665
+1.6717091588743203 0.54873333439274141 1.5875076190110726  0.6714941744148536 -0.45142526361231766 0.58763152153323406
+1.8217822259851766 0.59899507473160263 1.4048073899588975  0.82172156155092047 -0.40115992505181813 0.40477696304846245
+1.7638362809535502 0.62850263027516928 1.5277725269342672  0.76364675610270694 -0.37176976328895944 0.52785497534633885
+0.96609642251334915 0.51483917191469641 1.8737674280523331  -0.034313951497559551 -0.48348770334523605 0.87467833713118348
+1.0718582774923548 0.56234552415797401 1.8962672300889243  0.072536964263670886 -0.43642314114700098 0.89681281808791946
+1.2840795446225892 0.53960691129913463 1.8410333026720758  0.28440717777405577 -0.46019616855581419 0.84103034646625274
+1.1865609960788057 0.61001233692795442 1.9017231378830692  0.18714545413041769 -0.38953622755321848 0.90179715370028035
+1.5237239478373752 0.36389981842002828 1.5666478495993446  0.52342942466547426 -0.63609627313050576 0.56692430597377963
+1.4512666656072588 0.41249238098892749 1.6717091588743205  0.45152335920120679 -0.5873747039473749 0.67165289641182346
+1.4010049252683978 0.59519261004110291 1.8217822259851766  0.4011599250518203 -0.404776963048462 0.82172156155091969
+1.3714973697248309 0.47222747306573287 1.7638362809535502  0.37176976328895994 -0.52785497534633818 0.76364675610270705
+1.0339035774866507 0.5148391719146963 1.8737674280523331  0.03431395149755935 -0.48348770334523616 0.87467833713118337
+1.116269135355652 0.44607638880232214 1.8244089525965697  0.11774782579538173 -0.55402560894563424 0.8241304958274992
+1.135836225526941 0.28008469293463611 1.6806397508870439  0.13609530337963621 -0.72008099426245609 0.68041269101920598
+1.1930054401955479 0.37542737832173323 1.7567416602149373  0.19358827458119657 -0.62484261256047657 0.75636980999592607
+0.93054766801937272 0.083144519696222274 1.3931315324664024  -0.069401954456724771 -0.91670068154564321 0.39350124418016763
+1.0000000000000002 0.13359424365380856 1.499340630602181  -0.00015872199696842786 -0.86652958223713694 0.49912569350341057
+1.2073123918032649 0.21923183214566899 1.5894256868089485  0.2073545730409668 -0.78085960551688693 0.58928970592655883
+1.069740197633309 0.19952765932508121 1.5952985273360616  0.069662907281837133 -0.80067536950372642 0.59503447968929779
+0.42607845371442854 0.18108971266128371 1  -0.57538069819453441 -0.81788534298629822 -0.00078604920685503151
+0.44607638880232214 0.17559104740343046 1.116269135355652  -0.55440616112166086 -0.82389530164822189 0.11760246779863336
+0.60389882611563683 0.11923210876951296 1.2595222183644985  -0.3959958173592355 -0.88070834559541822 0.25988482570664312
+0.48428397075672913 0.17598126576074058 1.2345849586062216  -0.51562318151862285 -0.82387113061171746 0.23530638500725751
+1.0000000000000002 0.040220617934253244 1.2807552987238058  -0.00037212726837763092 -0.95982343558557015 0.28060440841513695
+0.86375904659618641 0.049392703790560599 1.2788981373351191  -0.1359494403350564 -0.95064905270461708 0.27889806070390505
+0.66075903908278333 0.13769549234610656 1.3759607778954341  -0.33912378489964806 -0.86229745711633865 0.37608264246842521
+0.73088283263773501 0.076305915458627194 1.2726998137406516  -0.26880216379452238 -0.92375019852295037 0.27282039415738812
+0.45998203120107961 0.16013614943431764 1.0548571407136167  -0.54106674669697652 -0.83909253130010408 0.056307189018219801
+0.56234552415797401 0.1037327699110755 1.0718582774923548  -0.43665833532627762 -0.89666746009117027 0.072917516439697475
+0.73973505164257791 0.035280704490367243 0.96026541144158839  -0.25990051397960007 -0.9648198687932612 -0.039677999129164657
+0.67728941095227668 0.056697343706257008 1.0777044036438097  -0.32203490693742853 -0.9435152641263429 0.077926023088562127
+0.93054766801937272 0.083144519696222274 0.6068684675335978  -0.069401954456725243 -0.9167006815456431 -0.39350124418016785
+0.86375904659618619 0.049392703790560488 0.7211018626648813  -0.13594944033505629 -0.95064905270461719 -0.27889806070390472
+0.86807143088604799 0.009569387922653938 0.95947771833128337  -0.13176921185868187 -0.99044963097837846 -0.040575895565417984
+0.80062303027104398 0.033204102939107361 0.84014219641217736  -0.19913925651268555 -0.96680424297825818 -0.16010344242024252
+0.96609642251334915 0.51483917191469653 0.12623257194766679  -0.034313951497558455 -0.48348770334523561 -0.8746783371311837
+0.88373086464434825 0.44607638880232225 0.17559104740343046  -0.1176024677986339 -0.55440616112166108 -0.82389530164822167
+0.37311241287933189 0.22843691950085854 0.8984470535752207  -0.63168040245029089 -0.76918721291848657 -0.096596587118434288
+0.17031256632806052 0.87149140923129198 0.45766135056488999  -0.83543687458500582 -0.14218930946431352 -0.5308742118974128
+1.0694523319806277 0.083144519696222274 0.6068684675335978  0.069401954456725243 -0.91670068154564299 -0.39350124418016819
+1.0000000000000002 0.13359424365380834 0.50065936939781919  0.0001587219969685182 -0.86652958223713727 -0.49912569350340996
+0.89436470058605533 0.21570896554595267 0.38998187620182156  -0.10429556095738572 -0.78585236795603663 -0.60955597917047311
+0.93025980236669126 0.1995276593250811 0.4047014726639383  -0.069662907281836842 -0.80067536950372598 -0.59503447968929823
+0.94514285928638309 0.45998203120107961 0.16013614943431764  -0.056792994144886942 -0.53979489236345535 -0.83987858050695896
+1 0.37421811130996707 0.22000190526672725  0.00023519417927879278 -0.62694312538533215 -0.77906499229253634
+1.2001281403434438 0.3198192814930475 0.29480292285486553  0.20029565457621359 -0.68040299513329228 -0.70493504308661725
+1.0672770740243225 0.29772297467792341 0.29128230231247842  0.067501320615791588 -0.70276863564903957 -0.70820887911908559
+1.5666478495993443 0.47627605216262503 0.36389981842002828  0.56632219140540208 -0.52380155193385236 -0.63632626043050511
+1.4512666656072588 0.41249238098892738 0.32829084112567963  0.45142526361231855 -0.5876315215332325 -0.67149417441485426
+1.2728788208449453 0.25975411381438551 0.38553016581808797  0.27300775118977999 -0.74028370995146831 -0.61436698850995386
+1.3283955572053112 0.35938546291290407 0.30590391667975902  0.32871571883365264 -0.64057192708348265 -0.69398384882087027
+1.8398638505656821 1.0548571407136167 0.4599820312010795  0.83987858050696007 0.056792994144884826 -0.53979489236345402
+1.7799980947332725 1 0.37421811130996718  0.7790649922925369 0.00023519417927860353 -0.62694312538533137
+1.7051970771451346 0.79987185965655649 0.3198192814930475  0.70493504308661714 -0.20029565457621229 -0.68040299513329294
+1.7087176976875216 0.93272292597567807 0.29772297467792341  0.70820887911908526 -0.067501320615792171 -0.70276863564903969
+1.6361001815799721 0.43335215040065578 0.47627605216262492  0.63632626043050589 -0.56632219140540152 -0.52380155193385203
+1.6717091588743205 0.5487333343927413 0.41249238098892749  0.67165289641182335 -0.45152335920120851 -0.58737470394737379
+1.6144698341819119 0.72712117915505481 0.25975411381438529  0.61436698850995297 -0.2730077511897796 -0.74028370995146919
+1.694096083320241 0.67160444279468889 0.35938546291290396  0.69398384882086972 -0.32871571883365142 -0.64057192708348365
+1.8189102873387162 1 0.42607845371442854  0.81788534298629767 -0.00078604920685363235 -0.57538069819453508
+1.8244089525965697 0.88373086464434814 0.44607638880232214  0.82413049582750031 -0.11774782579538169 -0.55402560894563246
+1.8807678912304873 0.74047778163550215 0.60389882611563706  0.88070834559541789 -0.2598848257066434 -0.39599581735923622
+1.8240187342392595 0.76541504139377881 0.48428397075672935  0.82387113061171757 -0.23530638500725778 -0.51562318151862252
+1.9597793820657468 0.71924470127619444 1.0000000000000002  0.95982343558556993 -0.28060440841513751 0.00037212726838032608
+1.9506072962094394 0.72110186266488108 0.86375904659618641  0.95055095711572746 -0.27915487828976454 -0.13610816233202591
+1.8623045076538935 0.6240392221045663 0.66075903908278344  0.86229745711633832 -0.37608264246842527 -0.33912378489964867
+1.9236940845413728 0.72730018625934878 0.73088283263773501  0.92375019852294971 -0.27282039415738879 -0.26880216379452365
+1.8398638505656821 1.0548571407136167 1.5400179687989204  0.83909253130010319 0.056307189018217581 0.5410667466969783
+1.8962672300889245 1.0718582774923548 1.4376544758420258  0.89666746009117015 0.07291751643969803 0.43665833532627779
+1.9647192955096329 0.96026541144158839 1.2602649483574222  0.96481986879326076 -0.039677999129163588 0.2599005139796019
+1.9433026562937428 1.0777044036438097 1.3227105890477233  0.94351526412634279 0.077926023088562529 0.3220349069374287
+1.9168554803037776 0.6068684675335978 1.0694523319806275  0.9167006815456431 -0.39350124418016769 0.069401954456725243
+1.9506072962094394 0.72110186266488119 1.1362409534038143  0.95064905270461764 -0.27889806070390388 0.13594944033505513
+1.9904306120773461 0.95947771833128337 1.1319285691139529  0.99044963097837846 -0.04057589556541729 0.13176921185868207
+1.9667958970608925 0.84014219641217736 1.1993769697289565  0.96680424297825784 -0.16010344242024374 0.19913925651268641
+1.8398638505656821 0.94514285928638309 0.4599820312010795  0.83909253130010453 -0.056307189018218594 -0.54106674669697619
+1.8962672300889243 0.92814172250764526 0.56234552415797401  0.89666746009117027 -0.072917516439697475 -0.43665833532627751
+1.9647192955096329 1.0397345885584115 0.73973505164257791  0.96481986879326065 0.039677999129164171 -0.25990051397960212
+1.943302656293743 0.92229559635619063 0.67728941095227657  0.94351526412634268 -0.07792602308856228 -0.32203490693742937
+1.9168554803037776 1.3931315324664026 0.93054766801937272  0.91670068154564344 0.39350124418016708 -0.06940195445672577
+1.9506072962094394 1.2788981373351191 0.86375904659618619  0.95055095711572812 0.27915487828976282 -0.13610816233202519
+1.9904306120773461 1.0405222816687172 0.86807143088604799  0.99044963097837824 0.040575895565418144 -0.13176921185868273
+1.9667958970608925 1.1598578035878231 0.80062303027104387  0.96680424297825784 0.16010344242024488 -0.19913925651268563
+1.4851608280853035 1.8737674280523331 0.96609642251334915  0.48348770334523716 0.87467833713118281 -0.034313951497558379
+1.553923611197678 1.8244089525965697 0.88373086464434814  0.55402560894563324 0.82413049582749998 -0.11774782579538136
+1.7199153070653639 1.6806397508870439 0.86416377447305925  0.72008099426245709 0.6804126910192051 -0.13609530337963541
+1.624572621678267 1.7567416602149373 0.80699455980445267  0.62484261256047691 0.75636980999592618 -0.19358827458119529
+1.9168554803037774 1.3931315324664026 1.0694523319806277  0.91670068154564333 0.39350124418016724 0.069401954456725631
+1.8664057563461913 1.499340630602181 1.0000000000000002  0.86652958223713639 0.49912569350341157 0.00015872199696846261
+1.7807681678543315 1.5894256868089485 0.79268760819673556  0.78085960551688705 0.58928970592655927 -0.20735457304096475
+1.8004723406749188 1.5952985273360616 0.93025980236669126  0.80067536950372586 0.59503447968929857 -0.069662907281837383
+0.51483917191469653 0.12623257194766679 1.0339035774866507  -0.48348770334523578 -0.87467833713118359 0.034313951497558337
+0.56234552415797401 0.1037327699110755 0.92814172250764548  -0.43642314114700098 -0.89681281808791946 -0.072536964263670373
+0.2284369195008584 0.89844705357522048 0.37311241287933194  -0.76918721291849057 -0.09659658711842789 -0.63168040245028712
+0.61001233692795442 0.098276862116930763 0.81343900392119461  -0.38953622755322043 -0.90179715370027946 -0.18714545413041711
+0.90641151615731874 0.31222404809805687 0.28115084502736221  -0.10033016823457604 -0.68572398718655903 -0.72091363611669157
+0.18610643753537565 0.88125255845135109 0.43210633013751576  -0.80326578355000511 -0.12230648174951686 -0.58292813064721083
+0.25355721782048268 0.90387507728811034 0.34253810440658672  -0.74597391594556806 -0.098434961242600316 -0.65866036402231021
+0.88125255845135109 0.43210633013751554 0.18610643753537598  -0.12230648174951586 -0.58292813064721183 -0.80326578355000444
+0.12623257194766668 1.0339035774866507 0.51483917191469664  -0.8741925320045173 0.035585805831079689 -0.48427375255209054
+0.1037327699110755 0.92814172250764548 0.56234552415797401  -0.89681281808791957 -0.072536964263671788 -0.4364231411470007
+0.2811508450273621 0.90641151615731863 0.31222404809805682  -0.72091363611669201 -0.10033016823457114 -0.68572398718655914
+0.098276862116930763 0.81343900392119461 0.61001233692795442  -0.90179715370027458 -0.18714545413041395 -0.38953622755323347
+0.89390471712616404 0.39369586600014284 0.21254447256850695  -0.094036448520743235 -0.60380229511961159 -0.79156802282425176
+0.4576613505648901 0.17031256632806047 0.87149140923129198  -0.53087421189741257 -0.83543687458500571 -0.14218930946431427
+0.72858929180595311 0.094046635219543179 0.67713360594626881  -0.27087574504909467 -0.91136373772562929 -0.30990719304796438
+0.38998187620182156 0.89436470058605533 0.21570896554595276  -0.60955597917047388 -0.10429556095738692 -0.78585236795603575
+0.51483917191469653 0.12623257194766679 0.96609642251334915  -0.48427375255209049 -0.87419253200451741 -0.035585805831079634
+0.44607638880232214 0.17559104740343046 0.88373086464434814  -0.51504067953570687 -0.84434219359547069 -0.14771377233618424
+0.39369586600014295 0.21254447256850689 0.89390471712616426  -0.60380229511961048 -0.79156802282425243 -0.09403644852074472
+0.64339140453754151 0.098424941615366676 0.75815048575026589  -0.36356562872996051 -0.89862238304022901 -0.24555619785557939
+0.083144519696222274 0.6068684675335978 1.0694523319806282  -0.91693066884564178 -0.39289912961179041 0.069774081725104325
+0.13359424365380834 0.50065936939781919 1.0000000000000002  -0.86652958223713739 -0.49912569350340985 -0.00015872199696876133
+0.33544566672286746 0.90463734990484679 0.25988381527545978  -0.6675609255217968 -0.10275236361909576 -0.73743092048487568
+0.1995276593250811 0.4047014726639383 0.93025980236669126  -0.80067536950372598 -0.59503447968929823 -0.069662907281836953
+0.1810897126612836 1 1.5739215462855709  -0.81788534298629811 0.00078604920685441341 0.57538069819453441
+0.17559104740343034 0.88373086464434814 1.553923611197678  -0.82413049582749953 -0.11774782579538282 0.55402560894563346
+0.11923210876951285 0.74047778163550193 1.3961011738843634  -0.88070834559541744 -0.25988482570664445 0.3959958173592365
+0.17598126576074047 0.76541504139377869 1.5157160292432708  -0.82387113061171735 -0.23530638500725837 0.51562318151862274
+0.040220617934253244 0.71924470127619444 1  -0.95982343558557037 -0.28060440841513612 -0.0003721272683797147
+0.049392703790560599 0.72110186266488119 1.1362409534038143  -0.95064905270461708 -0.27889806070390483 0.13594944033505654
+0.13769549234610656 0.6240392221045663 1.3392409609172167  -0.86229745711633854 -0.37608264246842454 0.33912378489964901
+0.076305915458627194 0.72730018625934878 1.2691171673622652  -0.92375019852295004 -0.27282039415738779 0.26880216379452376
+0.45998203120107961 0.16013614943431764 0.94514285928638309  -0.53979489236345513 -0.83987858050695918 -0.056792994144886491
+0.37421811130996707 0.22000190526672725 1  -0.62694312538533181 -0.77906499229253667 0.00023519417927783789
+0.3198192814930475 0.29480292285486553 1.2001281403434438  -0.68040299513329305 -0.7049350430866167 0.20029565457621315
+0.29772297467792341 0.29128230231247842 1.0672770740243225  -0.70276863564904046 -0.70820887911908481 0.067501320615791588
+0.47627605216262503 0.36389981842002828 1.5666478495993443  -0.52380155193385225 -0.636326260430505 0.56632219140540208
+0.41249238098892738 0.32829084112567963 1.4512666656072588  -0.58763152153323239 -0.67149417441485437 0.45142526361231855
+0.25975411381438551 0.38553016581808797 1.2728788208449453  -0.74028370995146831 -0.61436698850995386 0.27300775118977999
+0.35938546291290407 0.30590391667975902 1.3283955572053112  -0.64057192708348265 -0.69398384882087027 0.32871571883365264
+1.0548571407136167 0.4599820312010795 1.8398638505656821  0.056307189018217844 -0.54106674669697763 0.83909253130010364
+1 0.37421811130996696 1.7799980947332725  0.00023519417927876329 -0.62694312538533148 0.77906499229253701
+0.79987185965655649 0.3198192814930475 1.7051970771451346  -0.20029565457621173 -0.68040299513329294 0.70493504308661725
+0.93272292597567807 0.29772297467792341 1.7087176976875216  -0.067501320615792171 -0.70276863564903969 0.70820887911908526
+0.43335215040065567 0.47627605216262503 1.6361001815799718  -0.56632219140540208 -0.52380155193385225 0.63632626043050511
+0.5487333343927413 0.41249238098892749 1.6717091588743205  -0.45152335920120851 -0.58737470394737379 0.67165289641182335
+0.72712117915505481 0.25975411381438529 1.6144698341819119  -0.2730077511897796 -0.74028370995146919 0.61436698850995297
+0.67160444279468889 0.35938546291290396 1.694096083320241  -0.32871571883365069 -0.64057192708348398 0.69398384882086983
+0.18108971266128371 1 0.42607845371442887  -0.81788534298629756 -0.00078604920685410268 -0.57538069819453519
+0.17559104740343046 1.116269135355652 0.44607638880232214  -0.82389530164822189 0.11760246779863336 -0.55440616112166086
+0.11923210876951296 1.2595222183644985 0.60389882611563694  -0.880708345595418 0.25988482570664329 -0.39599581735923595
+0.17598126576074047 1.2345849586062214 0.48428397075672935  -0.82387113061171724 0.23530638500725817 -0.51562318151862274
+0.040220617934253355 1.280755298723806 1.0000000000000002  -0.95982343558557004 0.28060440841513723 -0.00037212726837797992
+0.049392703790560599 1.2788981373351191 0.8637590465961863  -0.95055095711572812 0.27915487828976271 -0.13610816233202605
+0.13769549234610656 1.3759607778954341 0.66075903908278333  -0.86229745711633854 0.37608264246842515 -0.33912378489964845
+0.076305915458627194 1.2726998137406516 0.73088283263773501  -0.92375019852295037 0.27282039415738812 -0.26880216379452265
+0.16013614943431764 0.94514285928638309 1.5400179687989204  -0.83909253130010408 -0.056307189018217935 0.54106674669697674
+0.10373276991107527 0.92814172250764526 1.4376544758420258  -0.89681281808792024 -0.072536964263669665 0.43642314114699976
+0.035280704490367243 1.0397345885584115 1.2602649483574222  -0.96481986879326098 0.039677999129164941 0.25990051397960084
+0.056697343706257008 0.92229559635619074 1.3227105890477233  -0.9435152641263429 -0.077926023088562335 0.32203490693742837
+0.083144519696222607 1.3931315324664026 1.0694523319806275  -0.9167006815456431 0.3935012441801678 0.069401954456725867
+0.049392703790560599 1.2788981373351191 1.1362409534038143  -0.95055095711572801 0.27915487828976304 0.13610816233202516
+0.009569387922654049 1.0405222816687172 1.1319285691139529  -0.99044963097837835 0.040575895565418935 0.13176921185868193
+0.033204102939107583 1.1598578035878229 1.1993769697289562  -0.96680424297825807 0.16010344242024346 0.19913925651268541
+0.82226795238624728 0.12310298935169572 0.55521070025011254  0.14198652391981534 -0.54699716260005082 -0.8250054127899169
+0.55521070025011254 0.82226795238624728 0.12310298935169572  -0.8250054127899169 0.14198652391981534 -0.54699716260005082
+0.49724573572225761 0.14854713354961635 0.85435218642293975  -0.50082503649440324 -0.85521146872291864 -0.1333702612472803
+0.44478929974988746 0.17773204761375266 0.87689701064830428  -0.51071495040769577 -0.84321209134395914 -0.16782016696872723
+0.60770816150558549 0.10617487126239183 0.78594000042913037  -0.3931165481837664 -0.89197584375895844 -0.22324532177533926
+0.42721864490060912 0.88304523202927654 0.18950565604187919  -0.57905836064064964 -0.10453117536509726 -0.80855713981694255
+0.59819314586024919 0.79307076339523386 0.10851189307750808  -0.42350808342754215 -0.20738833035095586 -0.881833875344882
+0.79307076339523386 0.10851189307750797 0.59819314586024919  -0.20738833035095922 -0.88183387534488133 -0.42350808342754154
+0.095572989323982643 0.66096525556418151 0.74328545761836984  -0.91299254504581129 -0.33091024020101767 -0.23862737818799643
+0.44486756488630003 0.87684117534766193 0.17811496227257201  -0.54729298896532741 -0.10489548487252455 -0.83034168959697308
+0.60871986758868468 0.78560578771446699 0.10542210643598451  -0.40347958770452025 -0.24084616951439783 -0.88272155572186639
+0.78560578771446699 0.10542210643598442 0.60871986758868479  -0.2408461695144028 -0.88272155572186384 -0.40347958770452308
+0.10194841255523887 0.62479622481419628 0.77318510024650311  -0.89859032272364381 -0.36748531964497128 -0.23977066491305993
+0.48342144068564125 0.86055952199012919 0.15594877494016779  -0.52971449507546131 -0.13950752053014914 -0.83662429167606589
+0.90463734990484679 0.25988381527545973 0.33544566672286741  -0.10275236361909962 -0.73743092048488268 -0.66756092552178858
+0.51101182387798261 0.84695178356442291 0.1418121948905855  -0.47782642632714106 -0.17381774822643653 -0.86108611456980566
+0.84695178356442291 0.1418121948905855 0.51101182387798261  -0.17381774822643653 -0.86108611456980566 -0.47782642632714106
+0.50017470245974227 0.85269038907862327 0.14688267020077073  -0.51152737254410108 -0.1740689660744103 -0.84145097432227989
+0.85269038907862327 0.14688267020077067 0.50017470245974227  -0.17406896607440964 -0.84145097432228455 -0.51152737254409375
+0.85435218642293986 0.49724573572225761 0.14854713354961632  -0.13337026124728099 -0.50082503649440047 -0.85521146872292031
+0.23967742655656482 0.35918321758479488 0.90105806124803833  -0.76207589783374052 -0.63913636447115008 -0.10365825365835343
+0.84282425105969128 0.51873480041451114 0.13843733448120865  -0.15629656115485271 -0.47538384129542982 -0.86578380003691968
+3  834 294 812
+3  836 296 813
+3  838 298 814
+3  840 300 815
+3  832 292 816
+3  844 304 817
+3  846 306 818
+3  848 308 819
+3  850 310 820
+3  842 302 821
+3  854 314 822
+3  856 316 823
+3  858 318 824
+3  860 320 825
+3  852 312 826
+3  835 295 827
+3  1608 1650 1293
+3  871 331 829
+3  841 301 830
+3  839 299 831
+3  816 276 832
+3  853 313 833
+3  812 272 834
+3  827 287 835
+3  813 273 836
+3  849 309 837
+3  814 274 838
+3  831 291 839
+3  815 275 840
+3  830 290 841
+3  821 281 842
+3  859 319 843
+3  817 277 844
+3  1682 1683 2083
+3  818 278 846
+3  870 330 847
+3  819 279 848
+3  837 297 849
+3  820 280 850
+3  863 323 851
+3  826 286 852
+3  833 293 853
+3  822 282 854
+3  869 329 855
+3  823 283 856
+3  397 1688 1603
+3  824 284 858
+3  843 303 859
+3  825 285 860
+3  862 322 861
+3  861 321 862
+3  851 311 863
+3  1603 1696 1025
+3  1697 1845 1844
+3  1892 2391 1098
+3  868 328 867
+3  867 327 868
+3  855 315 869
+3  847 307 870
+3  829 289 871
+3  875 335 872
+3  880 340 873
+3  877 337 874
+3  872 332 875
+3  879 339 876
+3  874 334 877
+3  881 341 878
+3  876 336 879
+3  873 333 880
+3  878 338 881
+3  885 345 882
+3  890 350 883
+3  887 347 884
+3  882 342 885
+3  889 349 886
+3  884 344 887
+3  891 351 888
+3  886 346 889
+3  883 343 890
+3  888 348 891
+3  895 355 892
+3  900 360 893
+3  897 357 894
+3  892 352 895
+3  899 359 896
+3  894 354 897
+3  901 361 898
+3  896 356 899
+3  893 353 900
+3  898 358 901
+3  917 377 902
+3  970 430 903
+3  937 397 904
+3  1779 1894 1328
+3  989 449 906
+3  978 438 907
+3  929 389 908
+3  982 442 909
+3  925 385 910
+3  942 402 911
+3  931 391 912
+3  954 414 913
+3  953 413 914
+3  916 376 915
+3  915 375 916
+3  902 362 917
+3  975 435 918
+3  920 380 919
+3  919 379 920
+3  946 406 921
+3  945 405 922
+3  924 384 923
+3  923 383 924
+3  910 370 925
+3  991 451 926
+3  928 388 927
+3  927 387 928
+3  908 368 929
+3  987 447 930
+3  912 372 931
+3  951 411 932
+3  966 426 933
+3  965 425 934
+3  936 396 935
+3  935 395 936
+3  904 364 937
+3  1331 1895 1456
+3  940 400 939
+3  939 399 940
+3  988 448 941
+3  911 371 942
+3  944 404 943
+3  943 403 944
+3  922 382 945
+3  921 381 946
+3  948 408 947
+3  947 407 948
+3  974 434 949
+3  973 433 950
+3  932 392 951
+3  971 431 952
+3  914 374 953
+3  913 373 954
+3  956 416 955
+3  955 415 956
+3  986 446 957
+3  985 445 958
+3  960 420 959
+3  959 419 960
+3  976 436 961
+3  367 1459 1543
+3  964 424 963
+3  963 423 964
+3  934 394 965
+3  933 393 966
+3  968 428 967
+3  967 427 968
+3  972 432 969
+3  903 363 970
+3  952 412 971
+3  969 429 972
+3  950 410 973
+3  949 409 974
+3  918 378 975
+3  961 421 976
+3  2082 2314 1329
+3  907 367 978
+3  1604 2372 1657
+3  2217 2373 1538
+3  984 444 981
+3  909 369 982
+3  990 450 983
+3  981 441 984
+3  958 418 985
+3  957 417 986
+3  930 390 987
+3  941 401 988
+3  906 366 989
+3  983 443 990
+3  926 386 991
+3  1203 663 992
+3  1118 578 993
+3  1211 671 994
+3  1122 582 995
+3  1219 679 996
+3  1126 586 997
+3  1227 687 998
+3  1130 590 999
+3  1195 655 1000
+3  1114 574 1001
+3  1243 703 1002
+3  1138 598 1003
+3  1251 711 1004
+3  1142 602 1005
+3  1259 719 1006
+3  1146 606 1007
+3  1267 727 1008
+3  1150 610 1009
+3  1235 695 1010
+3  1134 594 1011
+3  1283 743 1012
+3  1158 618 1013
+3  1291 751 1014
+3  1162 622 1015
+3  1299 759 1016
+3  1166 626 1017
+3  1307 767 1018
+3  1170 630 1019
+3  1275 735 1020
+3  1154 614 1021
+3  1207 667 1022
+3  1202 662 1023
+3  2441 1024 789
+3  1242 702 1025
+3  1351 811 1026
+3  1346 806 1027
+3  1231 691 1028
+3  1226 686 1029
+3  1223 683 1030
+3  1218 678 1031
+3  1131 591 1032
+3  1230 690 1033
+3  1279 739 1034
+3  1274 734 1035
+3  1115 575 1036
+3  1198 658 1037
+3  1175 635 1038
+3  1318 778 1039
+3  1119 579 1040
+3  1206 666 1041
+3  1263 723 1042
+3  1258 718 1043
+3  1123 583 1044
+3  1214 674 1045
+3  1191 651 1046
+3  1350 810 1047
+3  1127 587 1048
+3  1222 682 1049
+3  1187 647 1050
+3  1342 802 1051
+3  1151 611 1052
+3  1270 730 1053
+3  1303 763 1054
+3  1298 758 1055
+3  1135 595 1056
+3  1238 698 1057
+3  1245 2374 2370
+3  1101 2313 2375
+3  1139 599 1060
+3  1246 706 1061
+3  1347 807 1062
+3  1190 650 1063
+3  1143 603 1064
+3  1254 714 1065
+3  1215 675 1066
+3  1210 670 1067
+3  1147 607 1068
+3  1262 722 1069
+3  1319 779 1070
+3  1314 774 1071
+3  1171 631 1072
+3  1310 770 1073
+3  1199 659 1074
+3  1194 654 1075
+3  1155 615 1076
+3  1278 738 1077
+3  1343 803 1078
+3  1338 798 1079
+3  1159 619 1080
+3  1286 746 1081
+3  1605 2378 1609
+3  1931 1097 2382
+3  1163 623 1084
+3  1294 754 1085
+3  1239 699 1086
+3  1234 694 1087
+3  1167 627 1088
+3  1302 762 1089
+3  1315 775 1090
+3  1174 634 1091
+3  1311 771 1092
+3  1306 766 1093
+3  1271 731 1094
+3  1266 726 1095
+3  2222 637 1295
+3  1290 750 1097
+3  1893 1098 485
+3  1182 642 1099
+3  1652 400 2223
+3  2379 1656 1460
+3  1339 799 1102
+3  1186 646 1103
+3  1335 795 1104
+3  1330 790 1105
+3  1287 747 1106
+3  1282 742 1107
+3  1255 715 1108
+3  1250 710 1109
+3  1183 643 1110
+3  1334 794 1111
+3  1117 577 1112
+3  1128 588 1113
+3  1001 461 1114
+3  1036 496 1115
+3  1121 581 1116
+3  1112 572 1117
+3  993 453 1118
+3  1040 500 1119
+3  1125 585 1120
+3  1116 576 1121
+3  995 455 1122
+3  1044 504 1123
+3  1129 589 1124
+3  1120 580 1125
+3  997 457 1126
+3  1048 508 1127
+3  1113 573 1128
+3  1124 584 1129
+3  999 459 1130
+3  1032 492 1131
+3  1137 597 1132
+3  1148 608 1133
+3  1011 471 1134
+3  1056 516 1135
+3  1141 601 1136
+3  1132 592 1137
+3  1003 463 1138
+3  1060 520 1139
+3  1145 605 1140
+3  1136 596 1141
+3  1005 465 1142
+3  1064 524 1143
+3  1149 609 1144
+3  1140 600 1145
+3  1007 467 1146
+3  1068 528 1147
+3  1133 593 1148
+3  1144 604 1149
+3  1009 469 1150
+3  1052 512 1151
+3  1157 617 1152
+3  1168 628 1153
+3  1021 481 1154
+3  1076 536 1155
+3  1161 621 1156
+3  1152 612 1157
+3  1013 473 1158
+3  1080 540 1159
+3  1165 625 1160
+3  1156 616 1161
+3  1015 475 1162
+3  1084 544 1163
+3  1169 629 1164
+3  1160 620 1165
+3  1017 477 1166
+3  1088 548 1167
+3  1153 613 1168
+3  1164 624 1169
+3  1019 479 1170
+3  1072 532 1171
+3  1201 661 1172
+3  1308 768 1173
+3  1091 551 1174
+3  1038 498 1175
+3  1241 701 1176
+3  1292 2453 1928
+3  2391 2452 444
+3  1295 2450 2222
+3  1345 805 1180
+3  1324 784 1181
+3  1539 2319 1096
+3  1110 570 1183
+3  1225 685 1184
+3  1332 792 1185
+3  1103 563 1186
+3  1050 510 1187
+3  1217 677 1188
+3  1252 712 1189
+3  1063 523 1190
+3  1046 506 1191
+3  1229 689 1192
+3  1276 736 1193
+3  1075 535 1194
+3  1000 460 1195
+3  1273 733 1196
+3  1200 660 1197
+3  1037 497 1198
+3  1074 534 1199
+3  1197 657 1200
+3  1172 632 1201
+3  1023 483 1202
+3  992 452 1203
+3  1317 777 1204
+3  1208 668 1205
+3  1041 501 1206
+3  1022 482 1207
+3  1205 665 1208
+3  1260 720 1209
+3  1067 527 1210
+3  994 454 1211
+3  1257 717 1212
+3  1216 676 1213
+3  1045 505 1214
+3  1066 526 1215
+3  1213 673 1216
+3  1188 648 1217
+3  1031 491 1218
+3  996 456 1219
+3  1349 809 1220
+3  1224 684 1221
+3  1049 509 1222
+3  1030 490 1223
+3  1221 681 1224
+3  1184 644 1225
+3  1029 489 1226
+3  998 458 1227
+3  1341 801 1228
+3  1192 652 1229
+3  1033 493 1230
+3  1028 488 1231
+3  1269 729 1232
+3  1300 760 1233
+3  1087 547 1234
+3  1010 470 1235
+3  1297 757 1236
+3  1240 700 1237
+3  1057 517 1238
+3  1086 546 1239
+3  1237 697 1240
+3  1176 636 1241
+3  2449 2445 1247
+3  1002 462 1243
+3  1182 2444 1929
+3  2370 257 1245
+3  1061 521 1246
+3  1024 484 1247
+3  1686 2442 1242
+3  1344 804 1249
+3  1109 569 1250
+3  1004 464 1251
+3  1189 649 1252
+3  1256 716 1253
+3  1065 525 1254
+3  1108 568 1255
+3  1253 713 1256
+3  1212 672 1257
+3  1043 503 1258
+3  1006 466 1259
+3  1209 669 1260
+3  1264 724 1261
+3  1069 529 1262
+3  1042 502 1263
+3  1261 721 1264
+3  1316 776 1265
+3  1095 555 1266
+3  1008 468 1267
+3  1313 773 1268
+3  1232 692 1269
+3  1053 513 1270
+3  1094 554 1271
+3  1309 769 1272
+3  1196 656 1273
+3  1035 495 1274
+3  1020 480 1275
+3  1193 653 1276
+3  1280 740 1277
+3  1077 537 1278
+3  1034 494 1279
+3  1277 737 1280
+3  1340 800 1281
+3  1107 567 1282
+3  1012 472 1283
+3  1337 797 1284
+3  1288 748 1285
+3  1081 541 1286
+3  1106 566 1287
+3  1285 745 1288
+3  1320 780 1289
+3  2085 1290 557
+3  1014 474 1291
+3  1602 424 2319
+3  2380 756 437
+3  1085 545 1294
+3  1096 556 1295
+3  2391 28 1847
+3  1236 696 1297
+3  1055 515 1298
+3  1016 476 1299
+3  1233 693 1300
+3  1304 764 1301
+3  1089 549 1302
+3  1054 514 1303
+3  1301 761 1304
+3  1312 772 1305
+3  1093 553 1306
+3  1018 478 1307
+3  1173 633 1308
+3  1272 732 1309
+3  1073 533 1310
+3  1092 552 1311
+3  1305 765 1312
+3  1268 728 1313
+3  1071 531 1314
+3  1090 550 1315
+3  1265 725 1316
+3  1204 664 1317
+3  1039 499 1318
+3  1070 530 1319
+3  1289 749 1320
+3  2391 48 28
+3  2391 1892 48
+3  77 65 1099
+3  1181 641 1324
+3  2218 1244 1296
+3  65 2444 1182
+3  2440 77 1099
+3  65 1182 1099
+3  2386 796 326
+3  1105 565 1330
+3  1098 558 1331
+3  1185 645 1332
+3  1348 808 1333
+3  1111 571 1334
+3  1104 564 1335
+3  2443 84 1290
+3  1284 744 1337
+3  1079 539 1338
+3  1102 562 1339
+3  1281 741 1340
+3  1228 688 1341
+3  1051 511 1342
+3  1078 538 1343
+3  1249 709 1344
+3  1180 640 1345
+3  1027 487 1346
+3  1062 522 1347
+3  1333 793 1348
+3  1220 680 1349
+3  1047 507 1350
+3  1026 486 1351
+3  1803 497 1352
+3  2134 663 1353
+3  1811 501 1354
+3  2150 671 1355
+3  1819 505 1356
+3  2166 679 1357
+3  1827 509 1358
+3  2182 687 1359
+3  1795 493 1360
+3  2118 655 1361
+3  1843 517 1362
+3  2214 703 1363
+3  1851 521 1364
+3  2230 711 1365
+3  1859 525 1366
+3  2246 719 1367
+3  1867 529 1368
+3  2262 727 1369
+3  1835 513 1370
+3  2198 695 1371
+3  1883 537 1372
+3  2294 743 1373
+3  1891 541 1374
+3  2310 751 1375
+3  1899 545 1376
+3  2326 759 1377
+3  1907 549 1378
+3  2342 767 1379
+3  1875 533 1380
+3  2278 735 1381
+3  1807 499 1382
+3  2142 667 1383
+3  84 2439 1290
+3  85 1697 86
+3  1951 571 1386
+3  2430 811 1387
+3  1831 511 1388
+3  2190 691 1389
+3  1823 507 1390
+3  2174 683 1391
+3  1731 461 1392
+3  1990 591 1393
+3  1879 535 1394
+3  2286 739 1395
+3  1715 453 1396
+3  1958 575 1397
+3  1775 483 1398
+3  2078 635 1399
+3  1719 455 1400
+3  1966 579 1401
+3  1863 527 1402
+3  2254 723 1403
+3  1723 457 1404
+3  1974 583 1405
+3  1791 491 1406
+3  2110 651 1407
+3  1727 459 1408
+3  1982 587 1409
+3  1787 489 1410
+3  2102 647 1411
+3  1751 471 1412
+3  2030 611 1413
+3  1903 547 1414
+3  2334 763 1415
+3  1735 463 1416
+3  1998 595 1417
+3  86 1697 444
+3  1845 1697 85
+3  1739 465 1420
+3  2006 599 1421
+3  1947 569 1422
+3  2422 807 1423
+3  1743 467 1424
+3  2014 603 1425
+3  1815 503 1426
+3  2158 675 1427
+3  1747 469 1428
+3  2022 607 1429
+3  1919 555 1430
+3  2366 779 1431
+3  1771 481 1432
+3  2070 631 1433
+3  1799 495 1434
+3  2126 659 1435
+3  1755 473 1436
+3  2038 615 1437
+3  1943 567 1438
+3  2414 803 1439
+3  1759 475 1440
+3  2046 619 1441
+3  1331 108 1895
+3  1331 1922 108
+3  1763 477 1444
+3  2054 623 1445
+3  1839 515 1446
+3  2206 699 1447
+3  1767 479 1448
+3  2062 627 1449
+3  1915 553 1450
+3  2358 775 1451
+3  1911 551 1452
+3  2350 771 1453
+3  1871 531 1454
+3  2270 731 1455
+3  137 125 1925
+3  125 1922 1925
+3  1923 137 1925
+3  1922 1331 1925
+3  1182 144 1457
+3  1182 1929 144
+3  1939 565 1462
+3  2406 799 1463
+3  1935 563 1464
+3  2398 795 1465
+3  1887 539 1466
+3  2302 747 1467
+3  1855 523 1468
+3  2238 715 1469
+3  1783 487 1470
+3  2094 643 1471
+3  1967 579 1472
+3  1962 577 1473
+3  1987 589 1474
+3  1730 461 1475
+3  1975 583 1476
+3  1970 581 1477
+3  1955 573 1478
+3  1714 453 1479
+3  1983 587 1480
+3  1978 585 1481
+3  1963 577 1482
+3  1718 455 1483
+3  1991 591 1484
+3  1986 589 1485
+3  1971 581 1486
+3  1722 457 1487
+3  1959 575 1488
+3  1954 573 1489
+3  1979 585 1490
+3  1726 459 1491
+3  2007 599 1492
+3  2002 597 1493
+3  2027 609 1494
+3  1750 471 1495
+3  2015 603 1496
+3  2010 601 1497
+3  1995 593 1498
+3  1734 463 1499
+3  2023 607 1500
+3  2018 605 1501
+3  2003 597 1502
+3  1738 465 1503
+3  2031 611 1504
+3  2026 609 1505
+3  2011 601 1506
+3  1742 467 1507
+3  1999 595 1508
+3  1994 593 1509
+3  2019 605 1510
+3  1746 469 1511
+3  2047 619 1512
+3  2042 617 1513
+3  2067 629 1514
+3  1770 481 1515
+3  2055 623 1516
+3  2050 621 1517
+3  2035 613 1518
+3  1754 473 1519
+3  2063 627 1520
+3  2058 625 1521
+3  2043 617 1522
+3  1758 475 1523
+3  2071 631 1524
+3  2066 629 1525
+3  2051 621 1526
+3  1762 477 1527
+3  2039 615 1528
+3  2034 613 1529
+3  2059 625 1530
+3  1766 479 1531
+3  2135 663 1532
+3  2130 661 1533
+3  2347 769 1534
+3  1910 551 1535
+3  2215 703 1536
+3  2210 701 1537
+3  146 145 1651
+3  145 2382 1651
+3  2423 807 1540
+3  2418 805 1541
+3  1927 146 1651
+3  1543 1458 1099
+3  2183 687 1544
+3  2178 685 1545
+3  2395 793 1546
+3  1934 563 1547
+3  2167 679 1548
+3  2162 677 1549
+3  2235 713 1550
+3  1854 523 1551
+3  2191 691 1552
+3  2186 689 1553
+3  2283 737 1554
+3  1878 535 1555
+3  2279 735 1556
+3  2274 733 1557
+3  2131 661 1558
+3  1802 497 1559
+3  2127 659 1560
+3  2122 657 1561
+3  2075 633 1562
+3  1774 483 1563
+3  2367 779 1564
+3  2362 777 1565
+3  2147 669 1566
+3  1810 501 1567
+3  2143 667 1568
+3  2138 665 1569
+3  2251 721 1570
+3  1862 527 1571
+3  2247 719 1572
+3  2242 717 1573
+3  2163 677 1574
+3  1818 505 1575
+3  2159 675 1576
+3  2154 673 1577
+3  2107 649 1578
+3  1790 491 1579
+3  2431 811 1580
+3  2426 809 1581
+3  2179 685 1582
+3  1826 509 1583
+3  2175 683 1584
+3  2170 681 1585
+3  2099 645 1586
+3  1786 489 1587
+3  2415 803 1588
+3  2410 801 1589
+3  2115 653 1590
+3  1794 493 1591
+3  2271 731 1592
+3  2266 729 1593
+3  2331 761 1594
+3  1902 547 1595
+3  2327 759 1596
+3  2322 757 1597
+3  2211 701 1598
+3  1842 517 1599
+3  2207 699 1600
+3  2202 697 1601
+3  185 1244 218
+3  218 1244 1461
+3  1244 185 2379
+3  1538 242 2217
+3  2227 709 1606
+3  1850 521 1607
+3  242 2315 2217
+3  421 1926 1651
+3  2419 805 1610
+3  1946 569 1611
+3  2111 651 1612
+3  2106 649 1613
+3  2243 717 1614
+3  1858 525 1615
+3  2239 715 1616
+3  2234 713 1617
+3  2155 673 1618
+3  1814 503 1619
+3  2151 671 1620
+3  2146 669 1621
+3  2259 725 1622
+3  1866 529 1623
+3  2255 723 1624
+3  2250 721 1625
+3  2363 777 1626
+3  1918 555 1627
+3  2359 775 1628
+3  2354 773 1629
+3  2195 693 1630
+3  1834 513 1631
+3  2351 771 1632
+3  2346 769 1633
+3  2123 657 1634
+3  1798 495 1635
+3  2119 655 1636
+3  2114 653 1637
+3  2291 741 1638
+3  1882 537 1639
+3  2287 739 1640
+3  2282 737 1641
+3  2411 801 1642
+3  1942 567 1643
+3  2407 799 1644
+3  2402 797 1645
+3  2307 749 1646
+3  1890 541 1647
+3  2303 747 1648
+3  2298 745 1649
+3  257 708 1245
+3  259 708 257
+3  1542 708 259
+3  260 367 2379
+3  2323 757 1654
+3  1898 545 1655
+3  288 2379 1460
+3  2379 288 260
+3  2203 697 1658
+3  1838 515 1659
+3  2199 695 1660
+3  2194 693 1661
+3  2339 765 1662
+3  1906 549 1663
+3  2335 763 1664
+3  2330 761 1665
+3  2355 773 1666
+3  1914 553 1667
+3  2079 635 1668
+3  2074 633 1669
+3  2275 733 1670
+3  1874 533 1671
+3  2343 767 1672
+3  2338 765 1673
+3  2267 729 1674
+3  1870 531 1675
+3  2263 727 1676
+3  2258 725 1677
+3  2139 665 1678
+3  1806 499 1679
+3  2311 751 1680
+3  2306 749 1681
+3  305 788 2381
+3  2385 2381 788
+3  2095 643 1684
+3  2090 641 1685
+3  317 1329 324
+3  324 1329 1697
+3  1697 1844 324
+3  325 796 1329
+3  2403 797 1690
+3  1938 565 1691
+3  2103 647 1692
+3  2098 645 1693
+3  2427 809 1694
+3  1950 571 1695
+3  326 796 325
+3  1329 2314 325
+3  2299 745 1698
+3  1886 539 1699
+3  2295 743 1700
+3  2290 741 1701
+3  2187 689 1702
+3  1830 511 1703
+3  2231 711 1704
+3  2226 709 1705
+3  2091 641 1706
+3  1782 487 1707
+3  2399 795 1708
+3  2394 793 1709
+3  2171 681 1710
+3  1822 507 1711
+3  2133 662 1712
+3  1964 578 1713
+3  1479 335 1714
+3  1396 294 1715
+3  2149 670 1716
+3  1972 582 1717
+3  1483 337 1718
+3  1400 296 1719
+3  2165 678 1720
+3  1980 586 1721
+3  1487 339 1722
+3  1404 298 1723
+3  2181 686 1724
+3  1988 590 1725
+3  1491 341 1726
+3  1408 300 1727
+3  2117 654 1728
+3  1956 574 1729
+3  1475 333 1730
+3  1392 292 1731
+3  2213 702 1732
+3  2004 598 1733
+3  1499 345 1734
+3  1416 304 1735
+3  2229 710 1736
+3  2012 602 1737
+3  1503 347 1738
+3  1420 306 1739
+3  2245 718 1740
+3  2020 606 1741
+3  1507 349 1742
+3  1424 308 1743
+3  2261 726 1744
+3  2028 610 1745
+3  1511 351 1746
+3  1428 310 1747
+3  2197 694 1748
+3  1996 594 1749
+3  1495 343 1750
+3  1412 302 1751
+3  2293 742 1752
+3  2044 618 1753
+3  1519 355 1754
+3  1436 314 1755
+3  2309 750 1756
+3  2052 622 1757
+3  1523 357 1758
+3  1440 316 1759
+3  2325 758 1760
+3  2060 626 1761
+3  1527 359 1762
+3  1444 318 1763
+3  2341 766 1764
+3  2068 630 1765
+3  1531 361 1766
+3  1448 320 1767
+3  2277 734 1768
+3  2036 614 1769
+3  1515 353 1770
+3  1432 312 1771
+3  2141 666 1772
+3  2132 662 1773
+3  1563 377 1774
+3  1398 295 1775
+3  2221 706 1776
+3  2212 702 1777
+3  1689 1603 1688
+3  1543 365 398
+3  2429 810 1780
+3  2420 806 1781
+3  1707 449 1782
+3  1470 331 1783
+3  2189 690 1784
+3  2180 686 1785
+3  1587 389 1786
+3  1410 301 1787
+3  2173 682 1788
+3  2164 678 1789
+3  1579 385 1790
+3  1406 299 1791
+3  1989 590 1792
+3  2188 690 1793
+3  1591 391 1794
+3  1360 276 1795
+3  2285 738 1796
+3  2276 734 1797
+3  1635 413 1798
+3  1434 313 1799
+3  1957 574 1800
+3  2124 658 1801
+3  1559 375 1802
+3  1352 272 1803
+3  2077 634 1804
+3  2364 778 1805
+3  1679 435 1806
+3  1382 287 1807
+3  1965 578 1808
+3  2140 666 1809
+3  1567 379 1810
+3  1354 273 1811
+3  2253 722 1812
+3  2244 718 1813
+3  1619 405 1814
+3  1426 309 1815
+3  1973 582 1816
+3  2156 674 1817
+3  1575 383 1818
+3  1356 274 1819
+3  2109 650 1820
+3  2428 810 1821
+3  1711 451 1822
+3  1390 291 1823
+3  1981 586 1824
+3  2172 682 1825
+3  1583 387 1826
+3  1358 275 1827
+3  2101 646 1828
+3  2412 802 1829
+3  1703 447 1830
+3  1388 290 1831
+3  2029 610 1832
+3  2268 730 1833
+3  1631 411 1834
+3  1370 281 1835
+3  2333 762 1836
+3  2324 758 1837
+3  1659 425 1838
+3  1446 319 1839
+3  1997 594 1840
+3  2204 698 1841
+3  1599 395 1842
+3  1362 277 1843
+3  1543 398 1458
+3  1543 2086 365
+3  1024 2437 2223
+3  422 756 1293
+3  2005 598 1848
+3  2220 706 1849
+3  1607 399 1850
+3  1364 278 1851
+3  2421 806 1852
+3  2108 650 1853
+3  1551 371 1854
+3  1468 330 1855
+3  2013 602 1856
+3  2236 714 1857
+3  1615 403 1858
+3  1366 279 1859
+3  2157 674 1860
+3  2148 670 1861
+3  1571 381 1862
+3  1402 297 1863
+3  2021 606 1864
+3  2252 722 1865
+3  1623 407 1866
+3  1368 280 1867
+3  2365 778 1868
+3  2356 774 1869
+3  1675 433 1870
+3  1454 323 1871
+3  2069 630 1872
+3  2348 770 1873
+3  1671 431 1874
+3  1380 286 1875
+3  2125 658 1876
+3  2116 654 1877
+3  1555 373 1878
+3  1394 293 1879
+3  2037 614 1880
+3  2284 738 1881
+3  1639 415 1882
+3  1372 282 1883
+3  2413 802 1884
+3  2404 798 1885
+3  1699 445 1886
+3  1466 329 1887
+3  2045 618 1888
+3  2300 746 1889
+3  1647 419 1890
+3  1374 283 1891
+3  437 756 422
+3  1293 1650 422
+3  421 439 1926
+3  421 2387 439
+3  2053 622 1896
+3  2316 754 1897
+3  1655 423 1898
+3  1376 284 1899
+3  2205 698 1900
+3  2196 694 1901
+3  1595 393 1902
+3  1414 303 1903
+3  2061 626 1904
+3  2332 762 1905
+3  1663 427 1906
+3  1378 285 1907
+3  2357 774 1908
+3  2076 634 1909
+3  1535 363 1910
+3  1452 322 1911
+3  2349 770 1912
+3  2340 766 1913
+3  1667 429 1914
+3  1450 321 1915
+3  2269 730 1916
+3  2260 726 1917
+3  1627 409 1918
+3  1430 311 1919
+3  2317 754 1920
+3  2308 750 1921
+3  1927 1651 1926
+3  367 440 1459
+3  2389 790 1924
+3  2092 642 1925
+3  2086 1543 1459
+3  367 2084 440
+3  485 1098 518
+3  518 1098 1331
+3  1331 1456 518
+3  1295 519 2450
+3  2405 798 1932
+3  2100 646 1933
+3  1547 369 1934
+3  1464 328 1935
+3  2397 794 1936
+3  2388 790 1937
+3  1691 441 1938
+3  1462 327 1939
+3  2301 746 1940
+3  2292 742 1941
+3  1643 417 1942
+3  1438 315 1943
+3  2237 714 1944
+3  2228 710 1945
+3  1611 401 1946
+3  1422 307 1947
+3  2093 642 1948
+3  2396 794 1949
+3  1695 443 1950
+3  1386 289 1951
+3  1961 576 1952
+3  1984 588 1953
+3  1489 340 1954
+3  1478 335 1955
+3  1729 460 1956
+3  1800 496 1957
+3  1397 294 1958
+3  1488 340 1959
+3  1969 580 1960
+3  1952 572 1961
+3  1473 332 1962
+3  1482 337 1963
+3  1713 452 1964
+3  1808 500 1965
+3  1401 296 1966
+3  1472 332 1967
+3  1977 584 1968
+3  1960 576 1969
+3  1477 334 1970
+3  1486 339 1971
+3  1717 454 1972
+3  1816 504 1973
+3  1405 298 1974
+3  1476 334 1975
+3  1985 588 1976
+3  1968 580 1977
+3  1481 336 1978
+3  1490 341 1979
+3  1721 456 1980
+3  1824 508 1981
+3  1409 300 1982
+3  1480 336 1983
+3  1953 572 1984
+3  1976 584 1985
+3  1485 338 1986
+3  1474 333 1987
+3  1725 458 1988
+3  1792 492 1989
+3  1393 292 1990
+3  1484 338 1991
+3  2001 596 1992
+3  2024 608 1993
+3  1509 350 1994
+3  1498 345 1995
+3  1749 470 1996
+3  1840 516 1997
+3  1417 304 1998
+3  1508 350 1999
+3  2009 600 2000
+3  1992 592 2001
+3  1493 342 2002
+3  1502 347 2003
+3  1733 462 2004
+3  1848 520 2005
+3  1421 306 2006
+3  1492 342 2007
+3  2017 604 2008
+3  2000 596 2009
+3  1497 344 2010
+3  1506 349 2011
+3  1737 464 2012
+3  1856 524 2013
+3  1425 308 2014
+3  1496 344 2015
+3  2025 608 2016
+3  2008 600 2017
+3  1501 346 2018
+3  1510 351 2019
+3  1741 466 2020
+3  1864 528 2021
+3  1429 310 2022
+3  1500 346 2023
+3  1993 592 2024
+3  2016 604 2025
+3  1505 348 2026
+3  1494 343 2027
+3  1745 468 2028
+3  1832 512 2029
+3  1413 302 2030
+3  1504 348 2031
+3  2041 616 2032
+3  2064 628 2033
+3  1529 360 2034
+3  1518 355 2035
+3  1769 480 2036
+3  1880 536 2037
+3  1437 314 2038
+3  1528 360 2039
+3  2049 620 2040
+3  2032 612 2041
+3  1513 352 2042
+3  1522 357 2043
+3  1753 472 2044
+3  1888 540 2045
+3  1441 316 2046
+3  1512 352 2047
+3  2057 624 2048
+3  2040 616 2049
+3  1517 354 2050
+3  1526 359 2051
+3  1757 474 2052
+3  1896 544 2053
+3  1445 318 2054
+3  1516 354 2055
+3  2065 628 2056
+3  2048 620 2057
+3  1521 356 2058
+3  1530 361 2059
+3  1761 476 2060
+3  1904 548 2061
+3  1449 320 2062
+3  1520 356 2063
+3  2033 612 2064
+3  2056 624 2065
+3  1525 358 2066
+3  1514 353 2067
+3  1765 478 2068
+3  1872 532 2069
+3  1433 312 2070
+3  1524 358 2071
+3  2129 660 2072
+3  2344 768 2073
+3  1669 430 2074
+3  1562 377 2075
+3  1909 550 2076
+3  1804 498 2077
+3  1399 295 2078
+3  1668 430 2079
+3  2209 700 2080
+3  2312 752 2081
+3  1295 2448 519
+3  1687 397 1325
+3  542 1777 2438
+3  1242 2438 1777
+3  543 1097 1931
+3  557 1097 543
+3  2417 804 2088
+3  2376 784 2089
+3  1685 438 2090
+3  1706 449 2091
+3  1925 558 2092
+3  1948 570 2093
+3  1471 331 2094
+3  1684 438 2095
+3  2177 684 2096
+3  2392 792 2097
+3  1693 442 2098
+3  1586 389 2099
+3  1933 562 2100
+3  1828 510 2101
+3  1411 301 2102
+3  1692 442 2103
+3  2161 676 2104
+3  2232 712 2105
+3  1613 402 2106
+3  1578 385 2107
+3  1853 522 2108
+3  1820 506 2109
+3  1407 299 2110
+3  1612 402 2111
+3  2185 688 2112
+3  2280 736 2113
+3  1637 414 2114
+3  1590 391 2115
+3  1877 534 2116
+3  1728 460 2117
+3  1361 276 2118
+3  1636 414 2119
+3  2273 732 2120
+3  2128 660 2121
+3  1561 376 2122
+3  1634 413 2123
+3  1801 496 2124
+3  1876 534 2125
+3  1435 313 2126
+3  1560 376 2127
+3  2121 656 2128
+3  2072 632 2129
+3  1533 362 2130
+3  1558 375 2131
+3  1773 482 2132
+3  1712 452 2133
+3  1353 272 2134
+3  1532 362 2135
+3  2361 776 2136
+3  2144 668 2137
+3  1569 380 2138
+3  1678 435 2139
+3  1809 500 2140
+3  1772 482 2141
+3  1383 287 2142
+3  1568 380 2143
+3  2137 664 2144
+3  2248 720 2145
+3  1621 406 2146
+3  1566 379 2147
+3  1861 526 2148
+3  1716 454 2149
+3  1355 273 2150
+3  1620 406 2151
+3  2241 716 2152
+3  2160 676 2153
+3  1577 384 2154
+3  1618 405 2155
+3  1817 504 2156
+3  1860 526 2157
+3  1427 309 2158
+3  1576 384 2159
+3  2153 672 2160
+3  2104 648 2161
+3  1549 370 2162
+3  1574 383 2163
+3  1789 490 2164
+3  1720 456 2165
+3  1357 274 2166
+3  1548 370 2167
+3  2425 808 2168
+3  2176 684 2169
+3  1585 388 2170
+3  1710 451 2171
+3  1825 508 2172
+3  1788 490 2173
+3  1391 291 2174
+3  1584 388 2175
+3  2169 680 2176
+3  2096 644 2177
+3  1545 368 2178
+3  1582 387 2179
+3  1785 488 2180
+3  1724 458 2181
+3  1359 275 2182
+3  1544 368 2183
+3  2409 800 2184
+3  2112 652 2185
+3  1553 372 2186
+3  1702 447 2187
+3  1793 492 2188
+3  1784 488 2189
+3  1389 290 2190
+3  1552 372 2191
+3  2265 728 2192
+3  2328 760 2193
+3  1661 426 2194
+3  1630 411 2195
+3  1901 546 2196
+3  1748 470 2197
+3  1371 281 2198
+3  1660 426 2199
+3  2321 756 2200
+3  2208 700 2201
+3  1601 396 2202
+3  1658 425 2203
+3  1841 516 2204
+3  1900 546 2205
+3  1447 319 2206
+3  1600 396 2207
+3  2201 696 2208
+3  2080 636 2209
+3  1537 364 2210
+3  1598 395 2211
+3  1777 484 2212
+3  1732 462 2213
+3  1363 277 2214
+3  1536 364 2215
+3  2377 784 2216
+3  2224 708 2217
+3  2390 1059 400
+3  1097 557 1290
+3  1849 520 2220
+3  1776 484 2221
+3  2446 559 424
+3  2383 1652 2223
+3  2217 704 2224
+3  2416 804 2225
+3  1705 448 2226
+3  1606 399 2227
+3  1945 568 2228
+3  1736 464 2229
+3  1365 278 2230
+3  1704 448 2231
+3  2105 648 2232
+3  2240 716 2233
+3  1617 404 2234
+3  1550 371 2235
+3  1857 524 2236
+3  1944 568 2237
+3  1469 330 2238
+3  1616 404 2239
+3  2233 712 2240
+3  2152 672 2241
+3  1573 382 2242
+3  1614 403 2243
+3  1813 502 2244
+3  1740 466 2245
+3  1367 279 2246
+3  1572 382 2247
+3  2145 668 2248
+3  2256 724 2249
+3  1625 408 2250
+3  1570 381 2251
+3  1865 528 2252
+3  1812 502 2253
+3  1403 297 2254
+3  1624 408 2255
+3  2249 720 2256
+3  2360 776 2257
+3  1677 434 2258
+3  1622 407 2259
+3  1917 554 2260
+3  1744 468 2261
+3  1369 280 2262
+3  1676 434 2263
+3  2353 772 2264
+3  2192 692 2265
+3  1593 392 2266
+3  1674 433 2267
+3  1833 512 2268
+3  1916 554 2269
+3  1455 323 2270
+3  1592 392 2271
+3  2345 768 2272
+3  2120 656 2273
+3  1557 374 2274
+3  1670 431 2275
+3  1797 494 2276
+3  1768 480 2277
+3  1381 286 2278
+3  1556 374 2279
+3  2113 652 2280
+3  2288 740 2281
+3  1641 416 2282
+3  1554 373 2283
+3  1881 536 2284
+3  1796 494 2285
+3  1395 293 2286
+3  1640 416 2287
+3  2281 736 2288
+3  2408 800 2289
+3  1701 446 2290
+3  1638 415 2291
+3  1941 566 2292
+3  1752 472 2293
+3  1373 282 2294
+3  1700 446 2295
+3  2401 796 2296
+3  2304 748 2297
+3  1649 420 2298
+3  1698 445 2299
+3  1889 540 2300
+3  1940 566 2301
+3  1467 329 2302
+3  1648 420 2303
+3  2297 744 2304
+3  2368 780 2305
+3  1681 436 2306
+3  1646 419 2307
+3  1921 556 2308
+3  1756 474 2309
+3  1375 283 2310
+3  1680 436 2311
+3  2081 636 2312
+3  2320 756 2313
+3  559 560 1657
+3  559 1657 424
+3  1897 544 2316
+3  1920 556 2317
+3  1604 1657 560
+3  2318 1602 2319
+3  2313 752 2320
+3  2200 696 2321
+3  1597 394 2322
+3  1654 423 2323
+3  1837 514 2324
+3  1760 476 2325
+3  1377 284 2326
+3  1596 394 2327
+3  2193 692 2328
+3  2336 764 2329
+3  1665 428 2330
+3  1594 393 2331
+3  1905 548 2332
+3  1836 514 2333
+3  1415 303 2334
+3  1664 428 2335
+3  2329 760 2336
+3  2352 772 2337
+3  1673 432 2338
+3  1662 427 2339
+3  1913 552 2340
+3  1764 478 2341
+3  1379 285 2342
+3  1672 432 2343
+3  2073 632 2344
+3  2272 732 2345
+3  1633 412 2346
+3  1534 363 2347
+3  1873 532 2348
+3  1912 552 2349
+3  1453 322 2350
+3  1632 412 2351
+3  2337 764 2352
+3  2264 728 2353
+3  1629 410 2354
+3  1666 429 2355
+3  1869 530 2356
+3  1908 550 2357
+3  1451 321 2358
+3  1628 410 2359
+3  2257 724 2360
+3  2136 664 2361
+3  1565 378 2362
+3  1626 409 2363
+3  1805 498 2364
+3  1868 530 2365
+3  1431 311 2366
+3  1564 378 2367
+3  2305 748 2368
+3  2384 788 2369
+3  1443 2435 2385
+3  561 1096 637
+3  637 1096 1295
+3  2219 1096 561
+3  2223 638 2383
+3  2223 639 638
+3  2089 640 2376
+3  2216 704 2377
+3  2223 2437 639
+3  2084 367 260
+3  1652 705 400
+3  705 2390 400
+3  2433 707 1777
+3  707 753 1777
+3  2369 780 2384
+3  2400 796 2385
+3  1846 86 444
+3  753 2447 1777
+3  1937 564 2388
+3  1924 558 2389
+3  2447 1247 1777
+3  2452 2391 1847
+3  2097 644 2392
+3  2424 808 2393
+3  1709 450 2394
+3  1546 369 2395
+3  1949 570 2396
+3  1936 564 2397
+3  1465 328 2398
+3  1708 450 2399
+3  2385 788 2400
+3  2296 744 2401
+3  1645 418 2402
+3  1690 441 2403
+3  1885 538 2404
+3  1932 562 2405
+3  1463 327 2406
+3  1644 418 2407
+3  2289 740 2408
+3  2184 688 2409
+3  1589 390 2410
+3  1642 417 2411
+3  1829 510 2412
+3  1884 538 2413
+3  1439 315 2414
+3  1588 390 2415
+3  2225 708 2416
+3  2088 640 2417
+3  1541 366 2418
+3  1610 401 2419
+3  1781 486 2420
+3  1852 522 2421
+3  1423 307 2422
+3  1540 366 2423
+3  2393 792 2424
+3  2168 680 2425
+3  1581 386 2426
+3  1694 443 2427
+3  1821 506 2428
+3  1780 486 2429
+3  1387 289 2430
+3  1580 386 2431
+3  1397 114 812
+3  1803 272 812
+3  1401 116 813
+3  1811 273 813
+3  1405 118 814
+3  1819 274 814
+3  1409 120 815
+3  1827 275 815
+3  1393 112 816
+3  1795 276 816
+3  1417 124 817
+3  1843 277 817
+3  1421 126 818
+3  1851 278 818
+3  1425 128 819
+3  1859 279 819
+3  1429 130 820
+3  1867 280 820
+3  1413 122 821
+3  1835 281 821
+3  1437 134 822
+3  1883 282 822
+3  1441 136 823
+3  1891 283 823
+3  1445 138 824
+3  1899 284 824
+3  1449 140 825
+3  1907 285 825
+3  1433 132 826
+3  1875 286 826
+3  1399 115 827
+3  1807 287 827
+3  2432 755 1921
+3  755 781 1921
+3  1471 151 829
+3  1951 289 829
+3  1411 121 830
+3  1831 290 830
+3  1407 119 831
+3  1823 291 831
+3  1361 96 832
+3  1731 292 832
+3  1435 133 833
+3  1879 293 833
+3  1353 92 834
+3  1715 294 834
+3  1383 107 835
+3  1775 295 835
+3  1355 93 836
+3  1719 296 836
+3  1427 129 837
+3  1863 297 837
+3  1357 94 838
+3  1723 298 838
+3  1391 111 839
+3  1791 299 839
+3  1359 95 840
+3  1727 300 840
+3  1389 110 841
+3  1787 301 841
+3  1371 101 842
+3  1751 302 842
+3  1447 139 843
+3  1903 303 843
+3  1363 97 844
+3  1735 304 844
+3  781 2448 1921
+3  2448 1295 1921
+3  1365 98 846
+3  1739 306 846
+3  1469 150 847
+3  1947 307 847
+3  1367 99 848
+3  1743 308 848
+3  1403 117 849
+3  1815 309 849
+3  1369 100 850
+3  1747 310 850
+3  1455 143 851
+3  1919 311 851
+3  1381 106 852
+3  1771 312 852
+3  1395 113 853
+3  1799 313 853
+3  1373 102 854
+3  1755 314 854
+3  1467 149 855
+3  1943 315 855
+3  1375 103 856
+3  1759 316 856
+3  1247 782 2449
+3  1247 2447 782
+3  1377 104 858
+3  1763 318 858
+3  1415 123 859
+3  1839 319 859
+3  1379 105 860
+3  1767 320 860
+3  1453 142 861
+3  1915 321 861
+3  1451 141 862
+3  1911 322 862
+3  1431 131 863
+3  1871 323 863
+3  2385 783 2381
+3  2385 2435 783
+3  1539 785 2319
+3  785 786 2319
+3  786 2318 2319
+3  787 1024 1247
+3  1465 148 867
+3  1939 327 867
+3  1463 147 868
+3  1935 328 868
+3  1439 135 869
+3  1887 329 869
+3  1423 127 870
+3  1855 330 870
+3  1387 109 871
+3  1783 331 871
+3  1479 155 872
+3  1967 332 872
+3  1489 160 873
+3  1987 333 873
+3  1483 157 874
+3  1975 334 874
+3  1473 152 875
+3  1955 335 875
+3  1487 159 876
+3  1983 336 876
+3  1477 154 877
+3  1963 337 877
+3  1491 161 878
+3  1991 338 878
+3  1481 156 879
+3  1971 339 879
+3  1475 153 880
+3  1959 340 880
+3  1485 158 881
+3  1979 341 881
+3  1499 165 882
+3  2007 342 882
+3  1509 170 883
+3  2027 343 883
+3  1503 167 884
+3  2015 344 884
+3  1493 162 885
+3  1995 345 885
+3  1507 169 886
+3  2023 346 886
+3  1497 164 887
+3  2003 347 887
+3  1511 171 888
+3  2031 348 888
+3  1501 166 889
+3  2011 349 889
+3  1495 163 890
+3  1999 350 890
+3  1505 168 891
+3  2019 351 891
+3  1519 175 892
+3  2047 352 892
+3  1529 180 893
+3  2067 353 893
+3  1523 177 894
+3  2055 354 894
+3  1513 172 895
+3  2035 355 895
+3  1527 179 896
+3  2063 356 896
+3  1517 174 897
+3  2043 357 897
+3  1531 181 898
+3  2071 358 898
+3  1521 176 899
+3  2051 359 899
+3  1515 173 900
+3  2039 360 900
+3  1525 178 901
+3  2059 361 901
+3  1563 197 902
+3  2135 362 902
+3  1669 250 903
+3  2347 363 903
+3  1603 217 904
+3  2215 364 904
+3  789 1024 787
+3  1247 2445 787
+3  1707 269 906
+3  2423 366 906
+3  1685 258 907
+3  2379 367 907
+3  1587 209 908
+3  2183 368 908
+3  1693 262 909
+3  2395 369 909
+3  1579 205 910
+3  2167 370 910
+3  1613 222 911
+3  2235 371 911
+3  1591 211 912
+3  2191 372 912
+3  1637 234 913
+3  2283 373 913
+3  1635 233 914
+3  2279 374 914
+3  1561 196 915
+3  2131 375 915
+3  1559 195 916
+3  2127 376 916
+3  1533 182 917
+3  2075 377 917
+3  1679 255 918
+3  2367 378 918
+3  1569 200 919
+3  2147 379 919
+3  1567 199 920
+3  2143 380 920
+3  1621 226 921
+3  2251 381 921
+3  1619 225 922
+3  2247 382 922
+3  1577 204 923
+3  2163 383 923
+3  1575 203 924
+3  2159 384 924
+3  1549 190 925
+3  2107 385 925
+3  1711 271 926
+3  2431 386 926
+3  1585 208 927
+3  2179 387 927
+3  1583 207 928
+3  2175 388 928
+3  1545 188 929
+3  2099 389 929
+3  1703 267 930
+3  2415 390 930
+3  1553 192 931
+3  2115 391 931
+3  1631 231 932
+3  2271 392 932
+3  1661 246 933
+3  2331 393 933
+3  1659 245 934
+3  2327 394 934
+3  1601 216 935
+3  2211 395 935
+3  1599 215 936
+3  2207 396 936
+3  1537 184 937
+3  2083 397 937
+3  2380 791 756
+3  791 2375 756
+3  1609 220 939
+3  2227 399 939
+3  1607 219 940
+3  2223 400 940
+3  1705 268 941
+3  2419 401 941
+3  1551 191 942
+3  2111 402 942
+3  1617 224 943
+3  2243 403 943
+3  1615 223 944
+3  2239 404 944
+3  1573 202 945
+3  2155 405 945
+3  1571 201 946
+3  2151 406 946
+3  1625 228 947
+3  2259 407 947
+3  1623 227 948
+3  2255 408 948
+3  1677 254 949
+3  2363 409 949
+3  1675 253 950
+3  2359 410 950
+3  1593 212 951
+3  2195 411 951
+3  1671 251 952
+3  2351 412 952
+3  1557 194 953
+3  2123 413 953
+3  1555 193 954
+3  2119 414 954
+3  1641 236 955
+3  2291 415 955
+3  1639 235 956
+3  2287 416 956
+3  1701 266 957
+3  2411 417 957
+3  1699 265 958
+3  2407 418 958
+3  1649 240 959
+3  2307 419 959
+3  1647 239 960
+3  2303 420 960
+3  1681 256 961
+3  2371 421 961
+3  2375 2313 756
+3  1928 828 1292
+3  1657 244 963
+3  2323 423 963
+3  1655 243 964
+3  2319 424 964
+3  1597 214 965
+3  2203 425 965
+3  1595 213 966
+3  2199 426 966
+3  1665 248 967
+3  2339 427 967
+3  1663 247 968
+3  2335 428 968
+3  1673 252 969
+3  2355 429 969
+3  1535 183 970
+3  2079 430 970
+3  1633 232 971
+3  2275 431 971
+3  1667 249 972
+3  2343 432 972
+3  1629 230 973
+3  2267 433 973
+3  1627 229 974
+3  2263 434 974
+3  1565 198 975
+3  2139 435 975
+3  1651 241 976
+3  2311 436 976
+3  828 845 1292
+3  845 1682 2083
+3  1543 187 978
+3  2095 438 978
+3  845 2083 1292
+3  857 1328 1894
+3  864 1328 857
+3  1328 864 2371
+3  1697 264 981
+3  2403 441 981
+3  1547 189 982
+3  2103 442 982
+3  1709 270 983
+3  2427 443 983
+3  1691 261 984
+3  2391 444 984
+3  1645 238 985
+3  2299 445 985
+3  1643 237 986
+3  2295 446 986
+3  1589 210 987
+3  2187 447 987
+3  1611 221 988
+3  2231 448 988
+3  1541 186 989
+3  2091 449 989
+3  1695 263 990
+3  2399 450 990
+3  1581 206 991
+3  2171 451 991
+3  2135 197 992
+3  2133 452 992
+3  1965 155 993
+3  1479 453 993
+3  2151 201 994
+3  2149 454 994
+3  1973 157 995
+3  1483 455 995
+3  2167 205 996
+3  2165 456 996
+3  1981 159 997
+3  1487 457 997
+3  2183 209 998
+3  2181 458 998
+3  1989 161 999
+3  1491 459 999
+3  2119 193 1000
+3  2117 460 1000
+3  1957 153 1001
+3  1475 461 1001
+3  2215 217 1002
+3  2213 462 1002
+3  2005 165 1003
+3  1499 463 1003
+3  2231 221 1004
+3  2229 464 1004
+3  2013 167 1005
+3  1503 465 1005
+3  2247 225 1006
+3  2245 466 1006
+3  2021 169 1007
+3  1507 467 1007
+3  2263 229 1008
+3  2261 468 1008
+3  2029 171 1009
+3  1511 469 1009
+3  2199 213 1010
+3  2197 470 1010
+3  1997 163 1011
+3  1495 471 1011
+3  2295 237 1012
+3  2293 472 1012
+3  2045 175 1013
+3  1519 473 1013
+3  2311 241 1014
+3  2309 474 1014
+3  2053 177 1015
+3  1523 475 1015
+3  2327 245 1016
+3  2325 476 1016
+3  2061 179 1017
+3  1527 477 1017
+3  2343 249 1018
+3  2341 478 1018
+3  2069 181 1019
+3  1531 479 1019
+3  2279 233 1020
+3  2277 480 1020
+3  2037 173 1021
+3  1515 481 1021
+3  2143 199 1022
+3  2141 482 1022
+3  2133 197 1023
+3  1563 483 1023
+3  2223 219 1024
+3  2221 484 1024
+3  2213 217 1025
+3  1778 1025 1696
+3  2431 271 1026
+3  2429 486 1026
+3  2421 269 1027
+3  1707 487 1027
+3  2191 211 1028
+3  2189 488 1028
+3  2181 209 1029
+3  1587 489 1029
+3  2175 207 1030
+3  2173 490 1030
+3  2165 205 1031
+3  1579 491 1031
+3  1991 161 1032
+3  1989 492 1032
+3  2189 211 1033
+3  1591 493 1033
+3  2287 235 1034
+3  2285 494 1034
+3  2277 233 1035
+3  1635 495 1035
+3  1959 153 1036
+3  1957 496 1036
+3  2125 195 1037
+3  1559 497 1037
+3  2079 183 1038
+3  2077 498 1038
+3  2365 255 1039
+3  1679 499 1039
+3  1967 155 1040
+3  1965 500 1040
+3  2141 199 1041
+3  1567 501 1041
+3  2255 227 1042
+3  2253 502 1042
+3  2245 225 1043
+3  1619 503 1043
+3  1975 157 1044
+3  1973 504 1044
+3  2157 203 1045
+3  1575 505 1045
+3  2111 191 1046
+3  2109 506 1046
+3  2429 271 1047
+3  1711 507 1047
+3  1983 159 1048
+3  1981 508 1048
+3  2173 207 1049
+3  1583 509 1049
+3  2103 189 1050
+3  2101 510 1050
+3  2413 267 1051
+3  1703 511 1051
+3  2031 171 1052
+3  2029 512 1052
+3  2269 231 1053
+3  1631 513 1053
+3  2335 247 1054
+3  2333 514 1054
+3  2325 245 1055
+3  1659 515 1055
+3  1999 163 1056
+3  1997 516 1056
+3  2205 215 1057
+3  1599 517 1057
+3  2085 2443 1290
+3  1602 865 424
+3  865 2446 424
+3  905 866 752
+3  2007 165 1060
+3  2005 520 1060
+3  2221 219 1061
+3  1607 521 1061
+3  2423 269 1062
+3  2421 522 1062
+3  2109 191 1063
+3  1551 523 1063
+3  2015 167 1064
+3  2013 524 1064
+3  2237 223 1065
+3  1615 525 1065
+3  2159 203 1066
+3  2157 526 1066
+3  2149 201 1067
+3  1571 527 1067
+3  2023 169 1068
+3  2021 528 1068
+3  2253 227 1069
+3  1623 529 1069
+3  2367 255 1070
+3  2365 530 1070
+3  2357 253 1071
+3  1675 531 1071
+3  2071 181 1072
+3  2069 532 1072
+3  2349 251 1073
+3  1671 533 1073
+3  2127 195 1074
+3  2125 534 1074
+3  2117 193 1075
+3  1555 535 1075
+3  2039 173 1076
+3  2037 536 1076
+3  2285 235 1077
+3  1639 537 1077
+3  2415 267 1078
+3  2413 538 1078
+3  2405 265 1079
+3  1699 539 1079
+3  2047 175 1080
+3  2045 540 1080
+3  2301 239 1081
+3  1647 541 1081
+3  866 2453 1292
+3  2451 905 752
+3  866 1292 752
+3  2386 938 796
+3  2055 177 1084
+3  2053 544 1084
+3  2317 243 1085
+3  1655 545 1085
+3  2207 215 1086
+3  2205 546 1086
+3  2197 213 1087
+3  1595 547 1087
+3  2063 179 1088
+3  2061 548 1088
+3  2333 247 1089
+3  1663 549 1089
+3  2359 253 1090
+3  2357 550 1090
+3  2077 183 1091
+3  1535 551 1091
+3  2351 251 1092
+3  2349 552 1092
+3  2341 249 1093
+3  1667 553 1093
+3  2271 231 1094
+3  2269 554 1094
+3  2261 229 1095
+3  1627 555 1095
+3  2319 243 1096
+3  2317 556 1096
+3  2309 241 1097
+3  2382 1097 1651
+3  2391 261 1098
+3  2389 558 1098
+3  2093 187 1099
+3  2440 1099 1458
+3  938 1443 796
+3  1443 2385 796
+3  977 962 788
+3  962 1779 1328
+3  2407 265 1102
+3  2405 562 1102
+3  2101 189 1103
+3  1547 563 1103
+3  2399 263 1104
+3  2397 564 1104
+3  2389 261 1105
+3  1691 565 1105
+3  2303 239 1106
+3  2301 566 1106
+3  2293 237 1107
+3  1643 567 1107
+3  2239 223 1108
+3  2237 568 1108
+3  2229 221 1109
+3  1611 569 1109
+3  2095 187 1110
+3  2093 570 1110
+3  2397 263 1111
+3  1695 571 1111
+3  1963 154 1112
+3  1961 572 1112
+3  1985 160 1113
+3  1489 573 1113
+3  1731 96 1114
+3  1729 574 1114
+3  1801 114 1115
+3  1397 575 1115
+3  1971 156 1116
+3  1969 576 1116
+3  1953 152 1117
+3  1473 577 1117
+3  1715 92 1118
+3  1713 578 1118
+3  1809 116 1119
+3  1401 579 1119
+3  1979 158 1120
+3  1977 580 1120
+3  1961 154 1121
+3  1477 581 1121
+3  1719 93 1122
+3  1717 582 1122
+3  1817 118 1123
+3  1405 583 1123
+3  1987 160 1124
+3  1985 584 1124
+3  1969 156 1125
+3  1481 585 1125
+3  1723 94 1126
+3  1721 586 1126
+3  1825 120 1127
+3  1409 587 1127
+3  1955 152 1128
+3  1953 588 1128
+3  1977 158 1129
+3  1485 589 1129
+3  1727 95 1130
+3  1725 590 1130
+3  1793 112 1131
+3  1393 591 1131
+3  2003 164 1132
+3  2001 592 1132
+3  2025 170 1133
+3  1509 593 1133
+3  1751 101 1134
+3  1749 594 1134
+3  1841 124 1135
+3  1417 595 1135
+3  2011 166 1136
+3  2009 596 1136
+3  1993 162 1137
+3  1493 597 1137
+3  1735 97 1138
+3  1733 598 1138
+3  1849 126 1139
+3  1421 599 1139
+3  2019 168 1140
+3  2017 600 1140
+3  2001 164 1141
+3  1497 601 1141
+3  1739 98 1142
+3  1737 602 1142
+3  1857 128 1143
+3  1425 603 1143
+3  2027 170 1144
+3  2025 604 1144
+3  2009 166 1145
+3  1501 605 1145
+3  1743 99 1146
+3  1741 606 1146
+3  1865 130 1147
+3  1429 607 1147
+3  1995 162 1148
+3  1993 608 1148
+3  2017 168 1149
+3  1505 609 1149
+3  1747 100 1150
+3  1745 610 1150
+3  1833 122 1151
+3  1413 611 1151
+3  2043 174 1152
+3  2041 612 1152
+3  2065 180 1153
+3  1529 613 1153
+3  1771 106 1154
+3  1769 614 1154
+3  1881 134 1155
+3  1437 615 1155
+3  2051 176 1156
+3  2049 616 1156
+3  2033 172 1157
+3  1513 617 1157
+3  1755 102 1158
+3  1753 618 1158
+3  1889 136 1159
+3  1441 619 1159
+3  2059 178 1160
+3  2057 620 1160
+3  2041 174 1161
+3  1517 621 1161
+3  1759 103 1162
+3  1757 622 1162
+3  1897 138 1163
+3  1445 623 1163
+3  2067 180 1164
+3  2065 624 1164
+3  2049 176 1165
+3  1521 625 1165
+3  1763 104 1166
+3  1761 626 1166
+3  1905 140 1167
+3  1449 627 1167
+3  2035 172 1168
+3  2033 628 1168
+3  2057 178 1169
+3  1525 629 1169
+3  1767 105 1170
+3  1765 630 1170
+3  1873 132 1171
+3  1433 631 1171
+3  2131 196 1172
+3  2129 632 1172
+3  2345 250 1173
+3  1669 633 1173
+3  1911 141 1174
+3  1909 634 1174
+3  1805 115 1175
+3  1399 635 1175
+3  2211 216 1176
+3  2209 636 1176
+3  2434 977 788
+3  962 1328 788
+3  979 708 1542
+3  708 2373 2217
+3  444 980 1846
+3  444 2452 980
+3  2419 268 1180
+3  2417 640 1180
+3  2377 258 1181
+3  1685 641 1181
+3  1058 1609 1059
+3  1925 642 1182
+3  1949 151 1183
+3  1471 643 1183
+3  2179 208 1184
+3  2177 644 1184
+3  2393 262 1185
+3  1693 645 1185
+3  1935 147 1186
+3  1933 646 1186
+3  1829 121 1187
+3  1411 647 1187
+3  2163 204 1188
+3  2161 648 1188
+3  2233 222 1189
+3  1613 649 1189
+3  1855 127 1190
+3  1853 650 1190
+3  1821 119 1191
+3  1407 651 1191
+3  2187 210 1192
+3  2185 652 1192
+3  2281 234 1193
+3  1637 653 1193
+3  1879 133 1194
+3  1877 654 1194
+3  1729 96 1195
+3  1361 655 1195
+3  2275 232 1196
+3  2273 656 1196
+3  2129 196 1197
+3  1561 657 1197
+3  1803 114 1198
+3  1801 658 1198
+3  1877 133 1199
+3  1435 659 1199
+3  2123 194 1200
+3  2121 660 1200
+3  2073 182 1201
+3  1533 661 1201
+3  1775 107 1202
+3  1773 662 1202
+3  1713 92 1203
+3  1353 663 1203
+3  2363 254 1204
+3  2361 664 1204
+3  2145 200 1205
+3  1569 665 1205
+3  1811 116 1206
+3  1809 666 1206
+3  1773 107 1207
+3  1383 667 1207
+3  2139 198 1208
+3  2137 668 1208
+3  2249 226 1209
+3  1621 669 1209
+3  1863 129 1210
+3  1861 670 1210
+3  1717 93 1211
+3  1355 671 1211
+3  2243 224 1212
+3  2241 672 1212
+3  2161 204 1213
+3  1577 673 1213
+3  1819 118 1214
+3  1817 674 1214
+3  1861 129 1215
+3  1427 675 1215
+3  2155 202 1216
+3  2153 676 1216
+3  2105 190 1217
+3  1549 677 1217
+3  1791 111 1218
+3  1789 678 1218
+3  1721 94 1219
+3  1357 679 1219
+3  2427 270 1220
+3  2425 680 1220
+3  2177 208 1221
+3  1585 681 1221
+3  1827 120 1222
+3  1825 682 1222
+3  1789 111 1223
+3  1391 683 1223
+3  2171 206 1224
+3  2169 684 1224
+3  2097 188 1225
+3  1545 685 1225
+3  1787 110 1226
+3  1785 686 1226
+3  1725 95 1227
+3  1359 687 1227
+3  2411 266 1228
+3  2409 688 1228
+3  2113 192 1229
+3  1553 689 1229
+3  1795 112 1230
+3  1793 690 1230
+3  1785 110 1231
+3  1389 691 1231
+3  2267 230 1232
+3  2265 692 1232
+3  2329 246 1233
+3  1661 693 1233
+3  1903 139 1234
+3  1901 694 1234
+3  1749 101 1235
+3  1371 695 1235
+3  2323 244 1236
+3  2321 696 1236
+3  2209 216 1237
+3  1601 697 1237
+3  1843 124 1238
+3  1841 698 1238
+3  1901 139 1239
+3  1447 699 1239
+3  2203 214 1240
+3  2201 700 1240
+3  2081 184 1241
+3  1537 701 1241
+3  1059 1609 400
+3  1777 702 1242
+3  1733 97 1243
+3  1363 703 1243
+3  2379 258 1244
+3  2377 704 1244
+3  2225 220 1245
+3  2378 1326 1609
+3  1851 126 1246
+3  1849 706 1246
+3  1605 1609 1058
+3  1082 1921 2439
+3  1290 2439 1921
+3  2373 708 979
+3  2417 268 1249
+3  1705 709 1249
+3  1947 150 1250
+3  1945 710 1250
+3  1737 98 1251
+3  1365 711 1251
+3  2107 190 1252
+3  2105 712 1252
+3  2241 224 1253
+3  1617 713 1253
+3  1859 128 1254
+3  1857 714 1254
+3  1945 150 1255
+3  1469 715 1255
+3  2235 222 1256
+3  2233 716 1256
+3  2153 202 1257
+3  1573 717 1257
+3  1815 117 1258
+3  1813 718 1258
+3  1741 99 1259
+3  1367 719 1259
+3  2147 200 1260
+3  2145 720 1260
+3  2257 228 1261
+3  1625 721 1261
+3  1867 130 1262
+3  1865 722 1262
+3  1813 117 1263
+3  1403 723 1263
+3  2251 226 1264
+3  2249 724 1264
+3  2361 254 1265
+3  1677 725 1265
+3  1919 143 1266
+3  1917 726 1266
+3  1745 100 1267
+3  1369 727 1267
+3  2355 252 1268
+3  2353 728 1268
+3  2193 212 1269
+3  1593 729 1269
+3  1835 122 1270
+3  1833 730 1270
+3  1917 143 1271
+3  1455 731 1271
+3  2347 250 1272
+3  2345 732 1272
+3  2121 194 1273
+3  1557 733 1273
+3  1799 113 1274
+3  1797 734 1274
+3  1769 106 1275
+3  1381 735 1275
+3  2115 192 1276
+3  2113 736 1276
+3  2289 236 1277
+3  1641 737 1277
+3  1883 134 1278
+3  1881 738 1278
+3  1797 113 1279
+3  1395 739 1279
+3  2283 234 1280
+3  2281 740 1280
+3  2409 266 1281
+3  1701 741 1281
+3  1943 149 1282
+3  1941 742 1282
+3  1753 102 1283
+3  1373 743 1283
+3  2403 264 1284
+3  2401 744 1284
+3  2305 240 1285
+3  1649 745 1285
+3  1891 136 1286
+3  1889 746 1286
+3  1941 149 1287
+3  1467 747 1287
+3  2299 238 1288
+3  2297 748 1288
+3  2369 256 1289
+3  1681 749 1289
+3  1778 1083 1025
+3  1921 750 1290
+3  1757 103 1291
+3  1375 751 1291
+3  2083 184 1292
+3  2081 752 1292
+3  2321 244 1293
+3  2372 1419 1657
+3  1899 138 1294
+3  1897 754 1294
+3  1083 1100 1025
+3  1100 1686 1242
+3  1100 1242 1025
+3  2313 1101 1653
+3  2201 214 1297
+3  1597 757 1297
+3  1839 123 1298
+3  1837 758 1298
+3  1761 104 1299
+3  1377 759 1299
+3  2195 212 1300
+3  2193 760 1300
+3  2337 248 1301
+3  1665 761 1301
+3  1907 140 1302
+3  1905 762 1302
+3  1837 123 1303
+3  1415 763 1303
+3  2331 246 1304
+3  2329 764 1304
+3  2353 252 1305
+3  1673 765 1305
+3  1915 142 1306
+3  1913 766 1306
+3  1765 105 1307
+3  1379 767 1307
+3  2075 182 1308
+3  2073 768 1308
+3  2273 232 1309
+3  1633 769 1309
+3  1875 132 1310
+3  1873 770 1310
+3  1913 142 1311
+3  1453 771 1311
+3  2339 248 1312
+3  2337 772 1312
+3  2265 230 1313
+3  1629 773 1313
+3  1871 131 1314
+3  1869 774 1314
+3  1909 141 1315
+3  1451 775 1315
+3  2259 228 1316
+3  2257 776 1316
+3  2137 198 1317
+3  1565 777 1317
+3  1807 115 1318
+3  1805 778 1318
+3  1869 131 1319
+3  1431 779 1319
+3  2307 240 1320
+3  2305 780 1320
+3  1039 778 2365
+3  1177 1925 1457
+3  1182 1457 1925
+3  1930 2436 2371
+3  2442 1178 1242
+3  1178 2438 1242
+3  2091 186 1324
+3  2089 784 1324
+3  1244 2218 1461
+3  1687 1179 397
+3  1179 1688 397
+3  1248 704 2087
+3  1296 704 1248
+3  704 1296 1244
+3  2371 256 1328
+3  2369 788 1328
+3  2401 264 1329
+3  2082 1329 317
+3  1939 148 1330
+3  1937 790 1330
+3  1321 704 2315
+3  2087 704 1321
+3  2099 188 1332
+3  2097 792 1332
+3  2425 270 1333
+3  1709 793 1333
+3  1951 151 1334
+3  1949 794 1334
+3  1937 148 1335
+3  1465 795 1335
+3  1322 752 1653
+3  2313 1653 752
+3  2297 238 1337
+3  1645 797 1337
+3  1887 135 1338
+3  1885 798 1338
+3  1933 147 1339
+3  1463 799 1339
+3  2291 236 1340
+3  2289 800 1340
+3  2185 210 1341
+3  1589 801 1341
+3  1831 121 1342
+3  1829 802 1342
+3  1885 135 1343
+3  1439 803 1343
+3  2227 220 1344
+3  2225 804 1344
+3  2089 186 1345
+3  1541 805 1345
+3  1783 109 1346
+3  1781 806 1346
+3  1853 127 1347
+3  1423 807 1347
+3  2395 262 1348
+3  2393 808 1348
+3  2169 206 1349
+3  1581 809 1349
+3  1823 119 1350
+3  1821 810 1350
+3  1781 109 1351
+3  1387 811 1351
+3  1802 54 1352
+3  2134 272 1352
+3  1203 92 1353
+3  834 272 1353
+3  1810 56 1354
+3  2150 273 1354
+3  1211 93 1355
+3  836 273 1355
+3  1818 58 1356
+3  2166 274 1356
+3  1219 94 1357
+3  838 274 1357
+3  1826 60 1358
+3  2182 275 1358
+3  1227 95 1359
+3  840 275 1359
+3  1794 52 1360
+3  2118 276 1360
+3  1195 96 1361
+3  832 276 1361
+3  1842 64 1362
+3  2214 277 1362
+3  1243 97 1363
+3  844 277 1363
+3  1850 66 1364
+3  2230 278 1364
+3  1251 98 1365
+3  846 278 1365
+3  1858 68 1366
+3  2246 279 1366
+3  1259 99 1367
+3  848 279 1367
+3  1866 70 1368
+3  2262 280 1368
+3  1267 100 1369
+3  850 280 1369
+3  1834 62 1370
+3  2198 281 1370
+3  1235 101 1371
+3  842 281 1371
+3  1882 74 1372
+3  2294 282 1372
+3  1283 102 1373
+3  854 282 1373
+3  1890 76 1374
+3  2310 283 1374
+3  1291 103 1375
+3  856 283 1375
+3  1898 78 1376
+3  2326 284 1376
+3  1299 104 1377
+3  858 284 1377
+3  1906 80 1378
+3  2342 285 1378
+3  1307 105 1379
+3  860 285 1379
+3  1874 72 1380
+3  2278 286 1380
+3  1275 106 1381
+3  852 286 1381
+3  1806 55 1382
+3  2142 287 1382
+3  1207 107 1383
+3  835 287 1383
+3  1323 2083 1683
+3  1325 2083 1323
+3  2083 1325 397
+3  1326 1245 1609
+3  1950 91 1386
+3  2430 289 1386
+3  1351 109 1387
+3  871 289 1387
+3  1830 61 1388
+3  2190 290 1388
+3  1231 110 1389
+3  841 290 1389
+3  1822 59 1390
+3  2174 291 1390
+3  1223 111 1391
+3  839 291 1391
+3  1730 36 1392
+3  1990 292 1392
+3  1131 112 1393
+3  816 292 1393
+3  1878 73 1394
+3  2286 293 1394
+3  1279 113 1395
+3  853 293 1395
+3  1714 32 1396
+3  1958 294 1396
+3  1115 114 1397
+3  812 294 1397
+3  1774 47 1398
+3  2078 295 1398
+3  1175 115 1399
+3  827 295 1399
+3  1718 33 1400
+3  1966 296 1400
+3  1119 116 1401
+3  813 296 1401
+3  1862 69 1402
+3  2254 297 1402
+3  1263 117 1403
+3  849 297 1403
+3  1722 34 1404
+3  1974 298 1404
+3  1123 118 1405
+3  814 298 1405
+3  1790 51 1406
+3  2110 299 1406
+3  1191 119 1407
+3  831 299 1407
+3  1726 35 1408
+3  1982 300 1408
+3  1127 120 1409
+3  815 300 1409
+3  1786 50 1410
+3  2102 301 1410
+3  1187 121 1411
+3  830 301 1411
+3  1750 41 1412
+3  2030 302 1412
+3  1151 122 1413
+3  821 302 1413
+3  1902 79 1414
+3  2334 303 1414
+3  1303 123 1415
+3  859 303 1415
+3  1734 37 1416
+3  1998 304 1416
+3  1135 124 1417
+3  817 304 1417
+3  1327 1245 1326
+3  2374 1245 1327
+3  1384 1336 1603
+3  1336 1696 1603
+3  1738 38 1420
+3  2006 306 1420
+3  1139 126 1421
+3  818 306 1421
+3  1946 90 1422
+3  2422 307 1422
+3  1347 127 1423
+3  870 307 1423
+3  1742 39 1424
+3  2014 308 1424
+3  1143 128 1425
+3  819 308 1425
+3  1814 57 1426
+3  2158 309 1426
+3  1215 129 1427
+3  837 309 1427
+3  1746 40 1428
+3  2022 310 1428
+3  1147 130 1429
+3  820 310 1429
+3  1918 83 1430
+3  2366 311 1430
+3  1319 131 1431
+3  863 311 1431
+3  1770 46 1432
+3  2070 312 1432
+3  1171 132 1433
+3  826 312 1433
+3  1798 53 1434
+3  2126 313 1434
+3  1199 133 1435
+3  833 313 1435
+3  1754 42 1436
+3  2038 314 1436
+3  1155 134 1437
+3  822 314 1437
+3  1942 89 1438
+3  2414 315 1438
+3  1343 135 1439
+3  869 315 1439
+3  1758 43 1440
+3  2046 316 1440
+3  1159 136 1441
+3  823 316 1441
+3  1689 1384 1603
+3  2371 1385 421
+3  1385 2387 421
+3  2436 1418 2371
+3  1762 44 1444
+3  2054 318 1444
+3  1163 138 1445
+3  824 318 1445
+3  1838 63 1446
+3  2206 319 1446
+3  1239 139 1447
+3  843 319 1447
+3  1766 45 1448
+3  2062 320 1448
+3  1167 140 1449
+3  825 320 1449
+3  1914 82 1450
+3  2358 321 1450
+3  1315 141 1451
+3  862 321 1451
+3  1910 81 1452
+3  2350 322 1452
+3  1311 142 1453
+3  861 322 1453
+3  1870 71 1454
+3  2270 323 1454
+3  1271 143 1455
+3  851 323 1455
+3  1418 1385 2371
+3  1419 1293 1657
+3  1442 1293 1419
+3  1608 1293 1442
+3  1026 811 2431
+3  926 271 2431
+3  1580 811 2430
+3  1386 91 2430
+3  1047 810 2429
+3  1026 271 2429
+3  1780 810 2428
+3  1820 31 2428
+3  1938 88 1462
+3  2406 327 1462
+3  1339 147 1463
+3  868 327 1463
+3  1934 87 1464
+3  2398 328 1464
+3  1335 148 1465
+3  867 328 1465
+3  1886 75 1466
+3  2302 329 1466
+3  1287 149 1467
+3  855 329 1467
+3  1854 67 1468
+3  2238 330 1468
+3  1255 150 1469
+3  847 330 1469
+3  1782 49 1470
+3  2094 331 1470
+3  1183 151 1471
+3  829 331 1471
+3  1966 33 1472
+3  1962 332 1472
+3  1117 152 1473
+3  875 332 1473
+3  1986 36 1474
+3  1730 333 1474
+3  1001 153 1475
+3  880 333 1475
+3  1974 34 1476
+3  1970 334 1476
+3  1121 154 1477
+3  877 334 1477
+3  1954 32 1478
+3  1714 335 1478
+3  993 155 1479
+3  872 335 1479
+3  1982 35 1480
+3  1978 336 1480
+3  1125 156 1481
+3  879 336 1481
+3  1962 33 1482
+3  1718 337 1482
+3  995 157 1483
+3  874 337 1483
+3  1990 36 1484
+3  1986 338 1484
+3  1129 158 1485
+3  881 338 1485
+3  1970 34 1486
+3  1722 339 1486
+3  997 159 1487
+3  876 339 1487
+3  1958 32 1488
+3  1954 340 1488
+3  1113 160 1489
+3  873 340 1489
+3  1978 35 1490
+3  1726 341 1490
+3  999 161 1491
+3  878 341 1491
+3  2006 38 1492
+3  2002 342 1492
+3  1137 162 1493
+3  885 342 1493
+3  2026 41 1494
+3  1750 343 1494
+3  1011 163 1495
+3  890 343 1495
+3  2014 39 1496
+3  2010 344 1496
+3  1141 164 1497
+3  887 344 1497
+3  1994 37 1498
+3  1734 345 1498
+3  1003 165 1499
+3  882 345 1499
+3  2022 40 1500
+3  2018 346 1500
+3  1145 166 1501
+3  889 346 1501
+3  2002 38 1502
+3  1738 347 1502
+3  1005 167 1503
+3  884 347 1503
+3  2030 41 1504
+3  2026 348 1504
+3  1149 168 1505
+3  891 348 1505
+3  2010 39 1506
+3  1742 349 1506
+3  1007 169 1507
+3  886 349 1507
+3  1998 37 1508
+3  1994 350 1508
+3  1133 170 1509
+3  883 350 1509
+3  2018 40 1510
+3  1746 351 1510
+3  1009 171 1511
+3  888 351 1511
+3  2046 43 1512
+3  2042 352 1512
+3  1157 172 1513
+3  895 352 1513
+3  2066 46 1514
+3  1770 353 1514
+3  1021 173 1515
+3  900 353 1515
+3  2054 44 1516
+3  2050 354 1516
+3  1161 174 1517
+3  897 354 1517
+3  2034 42 1518
+3  1754 355 1518
+3  1013 175 1519
+3  892 355 1519
+3  2062 45 1520
+3  2058 356 1520
+3  1165 176 1521
+3  899 356 1521
+3  2042 43 1522
+3  1758 357 1522
+3  1015 177 1523
+3  894 357 1523
+3  2070 46 1524
+3  2066 358 1524
+3  1169 178 1525
+3  901 358 1525
+3  2050 44 1526
+3  1762 359 1526
+3  1017 179 1527
+3  896 359 1527
+3  2038 42 1528
+3  2034 360 1528
+3  1153 180 1529
+3  893 360 1529
+3  2058 45 1530
+3  1766 361 1530
+3  1019 181 1531
+3  898 361 1531
+3  2134 54 1532
+3  2130 362 1532
+3  1201 182 1533
+3  917 362 1533
+3  2346 81 1534
+3  1910 363 1534
+3  1091 183 1535
+3  970 363 1535
+3  2214 64 1536
+3  2210 364 1536
+3  1241 184 1537
+3  937 364 1537
+3  1220 809 2427
+3  983 270 2427
+3  1694 809 2426
+3  1580 91 2426
+3  2422 90 1540
+3  2418 366 1540
+3  1345 186 1541
+3  989 366 1541
+3  1333 808 2425
+3  1220 270 2425
+3  1099 187 1543
+3  978 367 1543
+3  2182 60 1544
+3  2178 368 1544
+3  1225 188 1545
+3  929 368 1545
+3  2394 87 1546
+3  1934 369 1546
+3  1103 189 1547
+3  982 369 1547
+3  2166 58 1548
+3  2162 370 1548
+3  1217 190 1549
+3  925 370 1549
+3  2234 67 1550
+3  1854 371 1550
+3  1063 191 1551
+3  942 371 1551
+3  2190 61 1552
+3  2186 372 1552
+3  1229 192 1553
+3  931 372 1553
+3  2282 73 1554
+3  1878 373 1554
+3  1075 193 1555
+3  954 373 1555
+3  2278 72 1556
+3  2274 374 1556
+3  1273 194 1557
+3  953 374 1557
+3  2130 54 1558
+3  1802 375 1558
+3  1037 195 1559
+3  916 375 1559
+3  2126 53 1560
+3  2122 376 1560
+3  1197 196 1561
+3  915 376 1561
+3  2074 47 1562
+3  1774 377 1562
+3  1023 197 1563
+3  902 377 1563
+3  2366 83 1564
+3  2362 378 1564
+3  1317 198 1565
+3  975 378 1565
+3  2146 56 1566
+3  1810 379 1566
+3  1041 199 1567
+3  920 379 1567
+3  2142 55 1568
+3  2138 380 1568
+3  1205 200 1569
+3  919 380 1569
+3  2250 69 1570
+3  1862 381 1570
+3  1067 201 1571
+3  946 381 1571
+3  2246 68 1572
+3  2242 382 1572
+3  1257 202 1573
+3  945 382 1573
+3  2162 58 1574
+3  1818 383 1574
+3  1045 203 1575
+3  924 383 1575
+3  2158 57 1576
+3  2154 384 1576
+3  1213 204 1577
+3  923 384 1577
+3  2106 51 1578
+3  1790 385 1578
+3  1031 205 1579
+3  910 385 1579
+3  2430 91 1580
+3  2426 386 1580
+3  1349 206 1581
+3  991 386 1581
+3  2178 60 1582
+3  1826 387 1582
+3  1049 207 1583
+3  928 387 1583
+3  2174 59 1584
+3  2170 388 1584
+3  1221 208 1585
+3  927 388 1585
+3  2098 50 1586
+3  1786 389 1586
+3  1029 209 1587
+3  908 389 1587
+3  2414 89 1588
+3  2410 390 1588
+3  1341 210 1589
+3  987 390 1589
+3  2114 52 1590
+3  1794 391 1590
+3  1033 211 1591
+3  912 391 1591
+3  2270 71 1592
+3  2266 392 1592
+3  1269 212 1593
+3  951 392 1593
+3  2330 79 1594
+3  1902 393 1594
+3  1087 213 1595
+3  966 393 1595
+3  2326 78 1596
+3  2322 394 1596
+3  1297 214 1597
+3  965 394 1597
+3  2210 64 1598
+3  1842 395 1598
+3  1057 215 1599
+3  936 395 1599
+3  2206 63 1600
+3  2202 396 1600
+3  1237 216 1601
+3  935 396 1601
+3  2168 808 2424
+3  2392 10 2424
+3  1025 217 1603
+3  904 397 1603
+3  1062 807 2423
+3  906 269 2423
+3  1540 807 2422
+3  1422 90 2422
+3  2226 66 1606
+3  1850 399 1606
+3  1061 219 1607
+3  940 399 1607
+3  1027 806 2421
+3  1062 269 2421
+3  1245 220 1609
+3  939 400 1609
+3  2418 90 1610
+3  1946 401 1610
+3  1109 221 1611
+3  988 401 1611
+3  2110 51 1612
+3  2106 402 1612
+3  1189 222 1613
+3  911 402 1613
+3  2242 68 1614
+3  1858 403 1614
+3  1065 223 1615
+3  944 403 1615
+3  2238 67 1616
+3  2234 404 1616
+3  1253 224 1617
+3  943 404 1617
+3  2154 57 1618
+3  1814 405 1618
+3  1043 225 1619
+3  922 405 1619
+3  2150 56 1620
+3  2146 406 1620
+3  1209 226 1621
+3  921 406 1621
+3  2258 70 1622
+3  1866 407 1622
+3  1069 227 1623
+3  948 407 1623
+3  2254 69 1624
+3  2250 408 1624
+3  1261 228 1625
+3  947 408 1625
+3  2362 83 1626
+3  1918 409 1626
+3  1095 229 1627
+3  974 409 1627
+3  2358 82 1628
+3  2354 410 1628
+3  1313 230 1629
+3  973 410 1629
+3  2194 62 1630
+3  1834 411 1630
+3  1053 231 1631
+3  932 411 1631
+3  2350 81 1632
+3  2346 412 1632
+3  1309 232 1633
+3  971 412 1633
+3  2122 53 1634
+3  1798 413 1634
+3  1035 233 1635
+3  914 413 1635
+3  2118 52 1636
+3  2114 414 1636
+3  1193 234 1637
+3  913 414 1637
+3  2290 74 1638
+3  1882 415 1638
+3  1077 235 1639
+3  956 415 1639
+3  2286 73 1640
+3  2282 416 1640
+3  1277 236 1641
+3  955 416 1641
+3  2410 89 1642
+3  1942 417 1642
+3  1107 237 1643
+3  986 417 1643
+3  2406 88 1644
+3  2402 418 1644
+3  1337 238 1645
+3  985 418 1645
+3  2306 76 1646
+3  1890 419 1646
+3  1081 239 1647
+3  960 419 1647
+3  2302 75 1648
+3  2298 420 1648
+3  1285 240 1649
+3  959 420 1649
+3  1852 806 2420
+3  1780 31 2420
+3  1097 241 1651
+3  976 421 1651
+3  1180 805 2419
+3  941 268 2419
+3  1610 805 2418
+3  1540 90 2418
+3  2322 78 1654
+3  1898 423 1654
+3  1085 243 1655
+3  964 423 1655
+3  1249 804 2417
+3  1180 268 2417
+3  1293 244 1657
+3  963 424 1657
+3  2202 63 1658
+3  1838 425 1658
+3  1055 245 1659
+3  934 425 1659
+3  2198 62 1660
+3  2194 426 1660
+3  1233 246 1661
+3  933 426 1661
+3  2338 80 1662
+3  1906 427 1662
+3  1089 247 1663
+3  968 427 1663
+3  2334 79 1664
+3  2330 428 1664
+3  1301 248 1665
+3  967 428 1665
+3  2354 82 1666
+3  1914 429 1666
+3  1093 249 1667
+3  972 429 1667
+3  2078 47 1668
+3  2074 430 1668
+3  1173 250 1669
+3  903 430 1669
+3  2274 72 1670
+3  1874 431 1670
+3  1073 251 1671
+3  952 431 1671
+3  2342 80 1672
+3  2338 432 1672
+3  1305 252 1673
+3  969 432 1673
+3  2266 71 1674
+3  1870 433 1674
+3  1071 253 1675
+3  950 433 1675
+3  2262 70 1676
+3  2258 434 1676
+3  1265 254 1677
+3  949 434 1677
+3  2138 55 1678
+3  1806 435 1678
+3  1039 255 1679
+3  918 435 1679
+3  2310 76 1680
+3  2306 436 1680
+3  1289 256 1681
+3  961 436 1681
+3  2088 804 2416
+3  2224 11 2416
+3  1078 803 2415
+3  930 267 2415
+3  2094 49 1684
+3  2090 438 1684
+3  1181 258 1685
+3  907 438 1685
+3  1588 803 2414
+3  1438 89 2414
+3  1051 802 2413
+3  1078 267 2413
+3  1884 802 2412
+3  1828 30 2412
+3  1228 801 2411
+3  957 266 2411
+3  2402 88 1690
+3  1938 441 1690
+3  1105 261 1691
+3  984 441 1691
+3  2102 50 1692
+3  2098 442 1692
+3  1185 262 1693
+3  909 442 1693
+3  2426 91 1694
+3  1950 443 1694
+3  1111 263 1695
+3  990 443 1695
+3  1642 801 2410
+3  1588 89 2410
+3  1329 264 1697
+3  981 444 1697
+3  2298 75 1698
+3  1886 445 1698
+3  1079 265 1699
+3  958 445 1699
+3  2294 74 1700
+3  2290 446 1700
+3  1281 266 1701
+3  957 446 1701
+3  2186 61 1702
+3  1830 447 1702
+3  1051 267 1703
+3  930 447 1703
+3  2230 66 1704
+3  2226 448 1704
+3  1249 268 1705
+3  941 448 1705
+3  2090 49 1706
+3  1782 449 1706
+3  1027 269 1707
+3  906 449 1707
+3  2398 87 1708
+3  2394 450 1708
+3  1333 270 1709
+3  983 450 1709
+3  2170 59 1710
+3  1822 451 1710
+3  1047 271 1711
+3  926 451 1711
+3  2132 13 1712
+3  1964 452 1712
+3  1118 92 1713
+3  1203 452 1713
+3  1478 32 1714
+3  1396 453 1714
+3  834 92 1715
+3  1118 453 1715
+3  2148 14 1716
+3  1972 454 1716
+3  1122 93 1717
+3  1211 454 1717
+3  1482 33 1718
+3  1400 455 1718
+3  836 93 1719
+3  1122 455 1719
+3  2164 15 1720
+3  1980 456 1720
+3  1126 94 1721
+3  1219 456 1721
+3  1486 34 1722
+3  1404 457 1722
+3  838 94 1723
+3  1126 457 1723
+3  2180 16 1724
+3  1988 458 1724
+3  1130 95 1725
+3  1227 458 1725
+3  1490 35 1726
+3  1408 459 1726
+3  840 95 1727
+3  1130 459 1727
+3  2116 12 1728
+3  1956 460 1728
+3  1114 96 1729
+3  1195 460 1729
+3  1474 36 1730
+3  1392 461 1730
+3  832 96 1731
+3  1114 461 1731
+3  2212 18 1732
+3  2004 462 1732
+3  1138 97 1733
+3  1243 462 1733
+3  1498 37 1734
+3  1416 463 1734
+3  844 97 1735
+3  1138 463 1735
+3  2228 19 1736
+3  2012 464 1736
+3  1142 98 1737
+3  1251 464 1737
+3  1502 38 1738
+3  1420 465 1738
+3  846 98 1739
+3  1142 465 1739
+3  2244 20 1740
+3  2020 466 1740
+3  1146 99 1741
+3  1259 466 1741
+3  1506 39 1742
+3  1424 467 1742
+3  848 99 1743
+3  1146 467 1743
+3  2260 21 1744
+3  2028 468 1744
+3  1150 100 1745
+3  1267 468 1745
+3  1510 40 1746
+3  1428 469 1746
+3  850 100 1747
+3  1150 469 1747
+3  2196 17 1748
+3  1996 470 1748
+3  1134 101 1749
+3  1235 470 1749
+3  1494 41 1750
+3  1412 471 1750
+3  842 101 1751
+3  1134 471 1751
+3  2292 23 1752
+3  2044 472 1752
+3  1158 102 1753
+3  1283 472 1753
+3  1518 42 1754
+3  1436 473 1754
+3  854 102 1755
+3  1158 473 1755
+3  2308 24 1756
+3  2052 474 1756
+3  1162 103 1757
+3  1291 474 1757
+3  1522 43 1758
+3  1440 475 1758
+3  856 103 1759
+3  1162 475 1759
+3  2324 25 1760
+3  2060 476 1760
+3  1166 104 1761
+3  1299 476 1761
+3  1526 44 1762
+3  1444 477 1762
+3  858 104 1763
+3  1166 477 1763
+3  2340 26 1764
+3  2068 478 1764
+3  1170 105 1765
+3  1307 478 1765
+3  1530 45 1766
+3  1448 479 1766
+3  860 105 1767
+3  1170 479 1767
+3  2276 22 1768
+3  2036 480 1768
+3  1154 106 1769
+3  1275 480 1769
+3  1514 46 1770
+3  1432 481 1770
+3  852 106 1771
+3  1154 481 1771
+3  2140 13 1772
+3  2132 482 1772
+3  1202 107 1773
+3  1207 482 1773
+3  1562 47 1774
+3  1398 483 1774
+3  835 107 1775
+3  1202 483 1775
+3  2220 18 1776
+3  2212 484 1776
+3  2433 1777 542
+3  1247 484 1777
+3  1281 800 2409
+3  1228 266 2409
+3  2184 800 2408
+3  2288 2 2408
+3  2428 31 1780
+3  2420 486 1780
+3  1346 109 1781
+3  1351 486 1781
+3  1706 49 1782
+3  1470 487 1782
+3  871 109 1783
+3  1346 487 1783
+3  2188 16 1784
+3  2180 488 1784
+3  1226 110 1785
+3  1231 488 1785
+3  1586 50 1786
+3  1410 489 1786
+3  841 110 1787
+3  1226 489 1787
+3  2172 15 1788
+3  2164 490 1788
+3  1218 111 1789
+3  1223 490 1789
+3  1578 51 1790
+3  1406 491 1790
+3  839 111 1791
+3  1218 491 1791
+3  1988 16 1792
+3  2188 492 1792
+3  1230 112 1793
+3  1131 492 1793
+3  1590 52 1794
+3  1360 493 1794
+3  816 112 1795
+3  1230 493 1795
+3  2284 22 1796
+3  2276 494 1796
+3  1274 113 1797
+3  1279 494 1797
+3  1634 53 1798
+3  1434 495 1798
+3  853 113 1799
+3  1274 495 1799
+3  1956 12 1800
+3  2124 496 1800
+3  1198 114 1801
+3  1115 496 1801
+3  1558 54 1802
+3  1352 497 1802
+3  812 114 1803
+3  1198 497 1803
+3  2076 27 1804
+3  2364 498 1804
+3  1318 115 1805
+3  1175 498 1805
+3  1678 55 1806
+3  1382 499 1806
+3  827 115 1807
+3  1318 499 1807
+3  1964 13 1808
+3  2140 500 1808
+3  1206 116 1809
+3  1119 500 1809
+3  1566 56 1810
+3  1354 501 1810
+3  813 116 1811
+3  1206 501 1811
+3  2252 20 1812
+3  2244 502 1812
+3  1258 117 1813
+3  1263 502 1813
+3  1618 57 1814
+3  1426 503 1814
+3  849 117 1815
+3  1258 503 1815
+3  1972 14 1816
+3  2156 504 1816
+3  1214 118 1817
+3  1123 504 1817
+3  1574 58 1818
+3  1356 505 1818
+3  814 118 1819
+3  1214 505 1819
+3  2108 31 1820
+3  2428 506 1820
+3  1350 119 1821
+3  1191 506 1821
+3  1710 59 1822
+3  1390 507 1822
+3  831 119 1823
+3  1350 507 1823
+3  1980 15 1824
+3  2172 508 1824
+3  1222 120 1825
+3  1127 508 1825
+3  1582 60 1826
+3  1358 509 1826
+3  815 120 1827
+3  1222 509 1827
+3  2100 30 1828
+3  2412 510 1828
+3  1342 121 1829
+3  1187 510 1829
+3  1702 61 1830
+3  1388 511 1830
+3  830 121 1831
+3  1342 511 1831
+3  2028 21 1832
+3  2268 512 1832
+3  1270 122 1833
+3  1151 512 1833
+3  1630 62 1834
+3  1370 513 1834
+3  821 122 1835
+3  1270 513 1835
+3  2332 25 1836
+3  2324 514 1836
+3  1298 123 1837
+3  1303 514 1837
+3  1658 63 1838
+3  1446 515 1838
+3  859 123 1839
+3  1298 515 1839
+3  1996 17 1840
+3  2204 516 1840
+3  1238 124 1841
+3  1135 516 1841
+3  1598 64 1842
+3  1362 517 1842
+3  817 124 1843
+3  1238 517 1843
+3  1102 799 2407
+3  958 265 2407
+3  1644 799 2406
+3  1462 88 2406
+3  1079 798 2405
+3  1102 265 2405
+3  1932 798 2404
+3  1884 30 2404
+3  2004 18 1848
+3  2220 520 1848
+3  1246 126 1849
+3  1139 520 1849
+3  1606 66 1850
+3  1364 521 1850
+3  818 126 1851
+3  1246 521 1851
+3  2420 31 1852
+3  2108 522 1852
+3  1190 127 1853
+3  1347 522 1853
+3  1550 67 1854
+3  1468 523 1854
+3  870 127 1855
+3  1190 523 1855
+3  2012 19 1856
+3  2236 524 1856
+3  1254 128 1857
+3  1143 524 1857
+3  1614 68 1858
+3  1366 525 1858
+3  819 128 1859
+3  1254 525 1859
+3  2156 14 1860
+3  2148 526 1860
+3  1210 129 1861
+3  1215 526 1861
+3  1570 69 1862
+3  1402 527 1862
+3  837 129 1863
+3  1210 527 1863
+3  2020 20 1864
+3  2252 528 1864
+3  1262 130 1865
+3  1147 528 1865
+3  1622 70 1866
+3  1368 529 1866
+3  820 130 1867
+3  1262 529 1867
+3  2364 27 1868
+3  2356 530 1868
+3  1314 131 1869
+3  1319 530 1869
+3  1674 71 1870
+3  1454 531 1870
+3  863 131 1871
+3  1314 531 1871
+3  2068 26 1872
+3  2348 532 1872
+3  1310 132 1873
+3  1171 532 1873
+3  1670 72 1874
+3  1380 533 1874
+3  826 132 1875
+3  1310 533 1875
+3  2124 12 1876
+3  2116 534 1876
+3  1194 133 1877
+3  1199 534 1877
+3  1554 73 1878
+3  1394 535 1878
+3  833 133 1879
+3  1194 535 1879
+3  2036 22 1880
+3  2284 536 1880
+3  1278 134 1881
+3  1155 536 1881
+3  1638 74 1882
+3  1372 537 1882
+3  822 134 1883
+3  1278 537 1883
+3  2412 30 1884
+3  2404 538 1884
+3  1338 135 1885
+3  1343 538 1885
+3  1698 75 1886
+3  1466 539 1886
+3  869 135 1887
+3  1338 539 1887
+3  2044 23 1888
+3  2300 540 1888
+3  1286 136 1889
+3  1159 540 1889
+3  1646 76 1890
+3  1374 541 1890
+3  823 136 1891
+3  1286 541 1891
+3  1284 797 2403
+3  981 264 2403
+3  1690 797 2402
+3  1644 88 2402
+3  1329 796 2401
+3  1284 264 2401
+3  2296 796 2400
+3  2384 7 2400
+3  2052 24 1896
+3  2316 544 1896
+3  1294 138 1897
+3  1163 544 1897
+3  1654 78 1898
+3  1376 545 1898
+3  824 138 1899
+3  1294 545 1899
+3  2204 17 1900
+3  2196 546 1900
+3  1234 139 1901
+3  1239 546 1901
+3  1594 79 1902
+3  1414 547 1902
+3  843 139 1903
+3  1234 547 1903
+3  2060 25 1904
+3  2332 548 1904
+3  1302 140 1905
+3  1167 548 1905
+3  1662 80 1906
+3  1378 549 1906
+3  825 140 1907
+3  1302 549 1907
+3  2356 27 1908
+3  2076 550 1908
+3  1174 141 1909
+3  1315 550 1909
+3  1534 81 1910
+3  1452 551 1910
+3  862 141 1911
+3  1174 551 1911
+3  2348 26 1912
+3  2340 552 1912
+3  1306 142 1913
+3  1311 552 1913
+3  1666 82 1914
+3  1450 553 1914
+3  861 142 1915
+3  1306 553 1915
+3  2268 21 1916
+3  2260 554 1916
+3  1266 143 1917
+3  1271 554 1917
+3  1626 83 1918
+3  1430 555 1918
+3  851 143 1919
+3  1266 555 1919
+3  2316 24 1920
+3  2308 556 1920
+3  2432 1921 1082
+3  1295 556 1921
+3  1104 795 2399
+3  990 263 2399
+3  1708 795 2398
+3  1464 87 2398
+3  2388 29 1924
+3  2092 558 1924
+3  1923 1925 1177
+3  1331 558 1925
+3  1111 794 2397
+3  1104 263 2397
+3  1936 794 2396
+3  1948 29 2396
+3  1348 793 2395
+3  909 262 2395
+3  1546 793 2394
+3  1708 87 2394
+3  1185 792 2393
+3  1348 262 2393
+3  2424 792 2392
+3  2096 10 2392
+3  2404 30 1932
+3  2100 562 1932
+3  1186 147 1933
+3  1339 562 1933
+3  1546 87 1934
+3  1464 563 1934
+3  868 147 1935
+3  1186 563 1935
+3  2396 29 1936
+3  2388 564 1936
+3  1330 148 1937
+3  1335 564 1937
+3  1690 88 1938
+3  1462 565 1938
+3  867 148 1939
+3  1330 565 1939
+3  2300 23 1940
+3  2292 566 1940
+3  1282 149 1941
+3  1287 566 1941
+3  1642 89 1942
+3  1438 567 1942
+3  855 149 1943
+3  1282 567 1943
+3  2236 19 1944
+3  2228 568 1944
+3  1250 150 1945
+3  1255 568 1945
+3  1610 90 1946
+3  1422 569 1946
+3  847 150 1947
+3  1250 569 1947
+3  2092 29 1948
+3  2396 570 1948
+3  1334 151 1949
+3  1183 570 1949
+3  1694 91 1950
+3  1386 571 1950
+3  829 151 1951
+3  1334 571 1951
+3  1960 0 1952
+3  1984 572 1952
+3  1128 152 1953
+3  1117 572 1953
+3  1488 32 1954
+3  1478 573 1954
+3  875 152 1955
+3  1128 573 1955
+3  1728 12 1956
+3  1800 574 1956
+3  1036 153 1957
+3  1001 574 1957
+3  1396 32 1958
+3  1488 575 1958
+3  880 153 1959
+3  1036 575 1959
+3  1968 0 1960
+3  1952 576 1960
+3  1112 154 1961
+3  1121 576 1961
+3  1472 33 1962
+3  1482 577 1962
+3  877 154 1963
+3  1112 577 1963
+3  1712 13 1964
+3  1808 578 1964
+3  1040 155 1965
+3  993 578 1965
+3  1400 33 1966
+3  1472 579 1966
+3  872 155 1967
+3  1040 579 1967
+3  1976 0 1968
+3  1960 580 1968
+3  1116 156 1969
+3  1125 580 1969
+3  1476 34 1970
+3  1486 581 1970
+3  879 156 1971
+3  1116 581 1971
+3  1716 14 1972
+3  1816 582 1972
+3  1044 157 1973
+3  995 582 1973
+3  1404 34 1974
+3  1476 583 1974
+3  874 157 1975
+3  1044 583 1975
+3  1984 0 1976
+3  1968 584 1976
+3  1120 158 1977
+3  1129 584 1977
+3  1480 35 1978
+3  1490 585 1978
+3  881 158 1979
+3  1120 585 1979
+3  1720 15 1980
+3  1824 586 1980
+3  1048 159 1981
+3  997 586 1981
+3  1408 35 1982
+3  1480 587 1982
+3  876 159 1983
+3  1048 587 1983
+3  1952 0 1984
+3  1976 588 1984
+3  1124 160 1985
+3  1113 588 1985
+3  1484 36 1986
+3  1474 589 1986
+3  873 160 1987
+3  1124 589 1987
+3  1724 16 1988
+3  1792 590 1988
+3  1032 161 1989
+3  999 590 1989
+3  1392 36 1990
+3  1484 591 1990
+3  878 161 1991
+3  1032 591 1991
+3  2000 1 1992
+3  2024 592 1992
+3  1148 162 1993
+3  1137 592 1993
+3  1508 37 1994
+3  1498 593 1994
+3  885 162 1995
+3  1148 593 1995
+3  1748 17 1996
+3  1840 594 1996
+3  1056 163 1997
+3  1011 594 1997
+3  1416 37 1998
+3  1508 595 1998
+3  890 163 1999
+3  1056 595 1999
+3  2008 1 2000
+3  1992 596 2000
+3  1132 164 2001
+3  1141 596 2001
+3  1492 38 2002
+3  1502 597 2002
+3  887 164 2003
+3  1132 597 2003
+3  1732 18 2004
+3  1848 598 2004
+3  1060 165 2005
+3  1003 598 2005
+3  1420 38 2006
+3  1492 599 2006
+3  882 165 2007
+3  1060 599 2007
+3  2016 1 2008
+3  2000 600 2008
+3  1136 166 2009
+3  1145 600 2009
+3  1496 39 2010
+3  1506 601 2010
+3  889 166 2011
+3  1136 601 2011
+3  1736 19 2012
+3  1856 602 2012
+3  1064 167 2013
+3  1005 602 2013
+3  1424 39 2014
+3  1496 603 2014
+3  884 167 2015
+3  1064 603 2015
+3  2024 1 2016
+3  2008 604 2016
+3  1140 168 2017
+3  1149 604 2017
+3  1500 40 2018
+3  1510 605 2018
+3  891 168 2019
+3  1140 605 2019
+3  1740 20 2020
+3  1864 606 2020
+3  1068 169 2021
+3  1007 606 2021
+3  1428 40 2022
+3  1500 607 2022
+3  886 169 2023
+3  1068 607 2023
+3  1992 1 2024
+3  2016 608 2024
+3  1144 170 2025
+3  1133 608 2025
+3  1504 41 2026
+3  1494 609 2026
+3  883 170 2027
+3  1144 609 2027
+3  1744 21 2028
+3  1832 610 2028
+3  1052 171 2029
+3  1009 610 2029
+3  1412 41 2030
+3  1504 611 2030
+3  888 171 2031
+3  1052 611 2031
+3  2040 5 2032
+3  2064 612 2032
+3  1168 172 2033
+3  1157 612 2033
+3  1528 42 2034
+3  1518 613 2034
+3  895 172 2035
+3  1168 613 2035
+3  1768 22 2036
+3  1880 614 2036
+3  1076 173 2037
+3  1021 614 2037
+3  1436 42 2038
+3  1528 615 2038
+3  900 173 2039
+3  1076 615 2039
+3  2048 5 2040
+3  2032 616 2040
+3  1152 174 2041
+3  1161 616 2041
+3  1512 43 2042
+3  1522 617 2042
+3  897 174 2043
+3  1152 617 2043
+3  1752 23 2044
+3  1888 618 2044
+3  1080 175 2045
+3  1013 618 2045
+3  1440 43 2046
+3  1512 619 2046
+3  892 175 2047
+3  1080 619 2047
+3  2056 5 2048
+3  2040 620 2048
+3  1156 176 2049
+3  1165 620 2049
+3  1516 44 2050
+3  1526 621 2050
+3  899 176 2051
+3  1156 621 2051
+3  1756 24 2052
+3  1896 622 2052
+3  1084 177 2053
+3  1015 622 2053
+3  1444 44 2054
+3  1516 623 2054
+3  894 177 2055
+3  1084 623 2055
+3  2064 5 2056
+3  2048 624 2056
+3  1160 178 2057
+3  1169 624 2057
+3  1520 45 2058
+3  1530 625 2058
+3  901 178 2059
+3  1160 625 2059
+3  1760 25 2060
+3  1904 626 2060
+3  1088 179 2061
+3  1017 626 2061
+3  1448 45 2062
+3  1520 627 2062
+3  896 179 2063
+3  1088 627 2063
+3  2032 5 2064
+3  2056 628 2064
+3  1164 180 2065
+3  1153 628 2065
+3  1524 46 2066
+3  1514 629 2066
+3  893 180 2067
+3  1164 629 2067
+3  1764 26 2068
+3  1872 630 2068
+3  1072 181 2069
+3  1019 630 2069
+3  1432 46 2070
+3  1524 631 2070
+3  898 181 2071
+3  1072 631 2071
+3  2128 8 2072
+3  2344 632 2072
+3  1308 182 2073
+3  1201 632 2073
+3  1668 47 2074
+3  1562 633 2074
+3  917 182 2075
+3  1308 633 2075
+3  1908 27 2076
+3  1804 634 2076
+3  1038 183 2077
+3  1091 634 2077
+3  1398 47 2078
+3  1668 635 2078
+3  970 183 2079
+3  1038 635 2079
+3  2208 3 2080
+3  2312 636 2080
+3  1292 184 2081
+3  1241 636 2081
+3  1893 1892 1098
+3  984 261 2391
+3  937 184 2083
+3  1105 790 2389
+3  1098 261 2389
+3  1924 790 2388
+3  1936 29 2388
+3  2434 788 305
+3  2400 788 2384
+3  2368 7 2384
+3  1656 2379 185
+3  907 258 2379
+3  2416 11 2088
+3  2376 640 2088
+3  1324 186 2089
+3  1345 640 2089
+3  1684 49 2090
+3  1706 641 2090
+3  989 186 2091
+3  1324 641 2091
+3  1924 29 2092
+3  1948 642 2092
+3  1110 187 2093
+3  1099 642 2093
+3  1470 49 2094
+3  1684 643 2094
+3  978 187 2095
+3  1110 643 2095
+3  2176 10 2096
+3  2392 644 2096
+3  1332 188 2097
+3  1225 644 2097
+3  1692 50 2098
+3  1586 645 2098
+3  929 188 2099
+3  1332 645 2099
+3  1932 30 2100
+3  1828 646 2100
+3  1050 189 2101
+3  1103 646 2101
+3  1410 50 2102
+3  1692 647 2102
+3  982 189 2103
+3  1050 647 2103
+3  2160 6 2104
+3  2232 648 2104
+3  1252 190 2105
+3  1217 648 2105
+3  1612 51 2106
+3  1578 649 2106
+3  925 190 2107
+3  1252 649 2107
+3  1852 31 2108
+3  1820 650 2108
+3  1046 191 2109
+3  1063 650 2109
+3  1406 51 2110
+3  1612 651 2110
+3  942 191 2111
+3  1046 651 2111
+3  2184 2 2112
+3  2280 652 2112
+3  1276 192 2113
+3  1229 652 2113
+3  1636 52 2114
+3  1590 653 2114
+3  931 192 2115
+3  1276 653 2115
+3  1876 12 2116
+3  1728 654 2116
+3  1000 193 2117
+3  1075 654 2117
+3  1360 52 2118
+3  1636 655 2118
+3  954 193 2119
+3  1000 655 2119
+3  2272 8 2120
+3  2128 656 2120
+3  1200 194 2121
+3  1273 656 2121
+3  1560 53 2122
+3  1634 657 2122
+3  953 194 2123
+3  1200 657 2123
+3  1800 12 2124
+3  1876 658 2124
+3  1074 195 2125
+3  1037 658 2125
+3  1434 53 2126
+3  1560 659 2126
+3  916 195 2127
+3  1074 659 2127
+3  2120 8 2128
+3  2072 660 2128
+3  1172 196 2129
+3  1197 660 2129
+3  1532 54 2130
+3  1558 661 2130
+3  915 196 2131
+3  1172 661 2131
+3  1772 13 2132
+3  1712 662 2132
+3  992 197 2133
+3  1023 662 2133
+3  1352 54 2134
+3  1532 663 2134
+3  902 197 2135
+3  992 663 2135
+3  2360 4 2136
+3  2144 664 2136
+3  1208 198 2137
+3  1317 664 2137
+3  1568 55 2138
+3  1678 665 2138
+3  975 198 2139
+3  1208 665 2139
+3  1808 13 2140
+3  1772 666 2140
+3  1022 199 2141
+3  1041 666 2141
+3  1382 55 2142
+3  1568 667 2142
+3  920 199 2143
+3  1022 667 2143
+3  2136 4 2144
+3  2248 668 2144
+3  1260 200 2145
+3  1205 668 2145
+3  1620 56 2146
+3  1566 669 2146
+3  919 200 2147
+3  1260 669 2147
+3  1860 14 2148
+3  1716 670 2148
+3  994 201 2149
+3  1067 670 2149
+3  1354 56 2150
+3  1620 671 2150
+3  946 201 2151
+3  994 671 2151
+3  2240 6 2152
+3  2160 672 2152
+3  1216 202 2153
+3  1257 672 2153
+3  1576 57 2154
+3  1618 673 2154
+3  945 202 2155
+3  1216 673 2155
+3  1816 14 2156
+3  1860 674 2156
+3  1066 203 2157
+3  1045 674 2157
+3  1426 57 2158
+3  1576 675 2158
+3  924 203 2159
+3  1066 675 2159
+3  2152 6 2160
+3  2104 676 2160
+3  1188 204 2161
+3  1213 676 2161
+3  1548 58 2162
+3  1574 677 2162
+3  923 204 2163
+3  1188 677 2163
+3  1788 15 2164
+3  1720 678 2164
+3  996 205 2165
+3  1031 678 2165
+3  1356 58 2166
+3  1548 679 2166
+3  910 205 2167
+3  996 679 2167
+3  2424 10 2168
+3  2176 680 2168
+3  1224 206 2169
+3  1349 680 2169
+3  1584 59 2170
+3  1710 681 2170
+3  991 206 2171
+3  1224 681 2171
+3  1824 15 2172
+3  1788 682 2172
+3  1030 207 2173
+3  1049 682 2173
+3  1390 59 2174
+3  1584 683 2174
+3  928 207 2175
+3  1030 683 2175
+3  2168 10 2176
+3  2096 684 2176
+3  1184 208 2177
+3  1221 684 2177
+3  1544 60 2178
+3  1582 685 2178
+3  927 208 2179
+3  1184 685 2179
+3  1784 16 2180
+3  1724 686 2180
+3  998 209 2181
+3  1029 686 2181
+3  1358 60 2182
+3  1544 687 2182
+3  908 209 2183
+3  998 687 2183
+3  2408 2 2184
+3  2112 688 2184
+3  1192 210 2185
+3  1341 688 2185
+3  1552 61 2186
+3  1702 689 2186
+3  987 210 2187
+3  1192 689 2187
+3  1792 16 2188
+3  1784 690 2188
+3  1028 211 2189
+3  1033 690 2189
+3  1388 61 2190
+3  1552 691 2190
+3  912 211 2191
+3  1028 691 2191
+3  2264 9 2192
+3  2328 692 2192
+3  1300 212 2193
+3  1269 692 2193
+3  1660 62 2194
+3  1630 693 2194
+3  951 212 2195
+3  1300 693 2195
+3  1900 17 2196
+3  1748 694 2196
+3  1010 213 2197
+3  1087 694 2197
+3  1370 62 2198
+3  1660 695 2198
+3  966 213 2199
+3  1010 695 2199
+3  2320 3 2200
+3  2208 696 2200
+3  1240 214 2201
+3  1297 696 2201
+3  1600 63 2202
+3  1658 697 2202
+3  965 214 2203
+3  1240 697 2203
+3  1840 17 2204
+3  1900 698 2204
+3  1086 215 2205
+3  1057 698 2205
+3  1446 63 2206
+3  1600 699 2206
+3  936 215 2207
+3  1086 699 2207
+3  2200 3 2208
+3  2080 700 2208
+3  1176 216 2209
+3  1237 700 2209
+3  1536 64 2210
+3  1598 701 2210
+3  935 216 2211
+3  1176 701 2211
+3  1776 18 2212
+3  1732 702 2212
+3  1002 217 2213
+3  1025 702 2213
+3  1362 64 2214
+3  1536 703 2214
+3  904 217 2215
+3  1002 703 2215
+3  2376 11 2216
+3  2224 704 2216
+3  1181 784 2377
+3  2315 704 2217
+3  1244 258 2377
+3  2216 784 2376
+3  2088 11 2376
+3  1930 2371 864
+3  1848 18 2220
+3  1776 706 2220
+3  1024 219 2221
+3  1061 706 2221
+3  961 256 2371
+3  1289 780 2369
+3  940 219 2223
+3  2437 1024 2441
+3  2216 11 2224
+3  2416 708 2224
+3  1344 220 2225
+3  1245 708 2225
+3  1704 66 2226
+3  1606 709 2226
+3  939 220 2227
+3  1344 709 2227
+3  1944 19 2228
+3  1736 710 2228
+3  1004 221 2229
+3  1109 710 2229
+3  1364 66 2230
+3  1704 711 2230
+3  988 221 2231
+3  1004 711 2231
+3  2104 6 2232
+3  2240 712 2232
+3  1256 222 2233
+3  1189 712 2233
+3  1616 67 2234
+3  1550 713 2234
+3  911 222 2235
+3  1256 713 2235
+3  1856 19 2236
+3  1944 714 2236
+3  1108 223 2237
+3  1065 714 2237
+3  1468 67 2238
+3  1616 715 2238
+3  944 223 2239
+3  1108 715 2239
+3  2232 6 2240
+3  2152 716 2240
+3  1212 224 2241
+3  1253 716 2241
+3  1572 68 2242
+3  1614 717 2242
+3  943 224 2243
+3  1212 717 2243
+3  1812 20 2244
+3  1740 718 2244
+3  1006 225 2245
+3  1043 718 2245
+3  1366 68 2246
+3  1572 719 2246
+3  922 225 2247
+3  1006 719 2247
+3  2144 4 2248
+3  2256 720 2248
+3  1264 226 2249
+3  1209 720 2249
+3  1624 69 2250
+3  1570 721 2250
+3  921 226 2251
+3  1264 721 2251
+3  1864 20 2252
+3  1812 722 2252
+3  1042 227 2253
+3  1069 722 2253
+3  1402 69 2254
+3  1624 723 2254
+3  948 227 2255
+3  1042 723 2255
+3  2248 4 2256
+3  2360 724 2256
+3  1316 228 2257
+3  1261 724 2257
+3  1676 70 2258
+3  1622 725 2258
+3  947 228 2259
+3  1316 725 2259
+3  1916 21 2260
+3  1744 726 2260
+3  1008 229 2261
+3  1095 726 2261
+3  1368 70 2262
+3  1676 727 2262
+3  974 229 2263
+3  1008 727 2263
+3  2352 9 2264
+3  2192 728 2264
+3  1232 230 2265
+3  1313 728 2265
+3  1592 71 2266
+3  1674 729 2266
+3  973 230 2267
+3  1232 729 2267
+3  1832 21 2268
+3  1916 730 2268
+3  1094 231 2269
+3  1053 730 2269
+3  1454 71 2270
+3  1592 731 2270
+3  932 231 2271
+3  1094 731 2271
+3  2344 8 2272
+3  2120 732 2272
+3  1196 232 2273
+3  1309 732 2273
+3  1556 72 2274
+3  1670 733 2274
+3  971 232 2275
+3  1196 733 2275
+3  1796 22 2276
+3  1768 734 2276
+3  1020 233 2277
+3  1035 734 2277
+3  1380 72 2278
+3  1556 735 2278
+3  914 233 2279
+3  1020 735 2279
+3  2112 2 2280
+3  2288 736 2280
+3  1280 234 2281
+3  1193 736 2281
+3  1640 73 2282
+3  1554 737 2282
+3  913 234 2283
+3  1280 737 2283
+3  1880 22 2284
+3  1796 738 2284
+3  1034 235 2285
+3  1077 738 2285
+3  1394 73 2286
+3  1640 739 2286
+3  956 235 2287
+3  1034 739 2287
+3  2280 2 2288
+3  2408 740 2288
+3  1340 236 2289
+3  1277 740 2289
+3  1700 74 2290
+3  1638 741 2290
+3  955 236 2291
+3  1340 741 2291
+3  1940 23 2292
+3  1752 742 2292
+3  1012 237 2293
+3  1107 742 2293
+3  1372 74 2294
+3  1700 743 2294
+3  986 237 2295
+3  1012 743 2295
+3  2400 7 2296
+3  2304 744 2296
+3  1288 238 2297
+3  1337 744 2297
+3  1648 75 2298
+3  1698 745 2298
+3  985 238 2299
+3  1288 745 2299
+3  1888 23 2300
+3  1940 746 2300
+3  1106 239 2301
+3  1081 746 2301
+3  1466 75 2302
+3  1648 747 2302
+3  960 239 2303
+3  1106 747 2303
+3  2296 7 2304
+3  2368 748 2304
+3  1320 240 2305
+3  1285 748 2305
+3  1680 76 2306
+3  1646 749 2306
+3  959 240 2307
+3  1320 749 2307
+3  1920 24 2308
+3  1756 750 2308
+3  1014 241 2309
+3  1097 750 2309
+3  1374 76 2310
+3  1680 751 2310
+3  976 241 2311
+3  1014 751 2311
+3  2080 3 2312
+3  2320 752 2312
+3  1328 256 2369
+3  2451 752 1322
+3  2384 780 2368
+3  2304 7 2368
+3  1070 779 2367
+3  918 255 2367
+3  1896 24 2316
+3  1920 754 2316
+3  1096 243 2317
+3  1085 754 2317
+3  1564 779 2366
+3  1430 83 2366
+3  964 243 2319
+3  2219 1539 1096
+3  2312 3 2320
+3  2200 756 2320
+3  1236 244 2321
+3  1293 756 2321
+3  1596 78 2322
+3  1654 757 2322
+3  963 244 2323
+3  1236 757 2323
+3  1836 25 2324
+3  1760 758 2324
+3  1016 245 2325
+3  1055 758 2325
+3  1376 78 2326
+3  1596 759 2326
+3  934 245 2327
+3  1016 759 2327
+3  2192 9 2328
+3  2336 760 2328
+3  1304 246 2329
+3  1233 760 2329
+3  1664 79 2330
+3  1594 761 2330
+3  933 246 2331
+3  1304 761 2331
+3  1904 25 2332
+3  1836 762 2332
+3  1054 247 2333
+3  1089 762 2333
+3  1414 79 2334
+3  1664 763 2334
+3  968 247 2335
+3  1054 763 2335
+3  2328 9 2336
+3  2352 764 2336
+3  1312 248 2337
+3  1301 764 2337
+3  1672 80 2338
+3  1662 765 2338
+3  967 248 2339
+3  1312 765 2339
+3  1912 26 2340
+3  1764 766 2340
+3  1018 249 2341
+3  1093 766 2341
+3  1378 80 2342
+3  1672 767 2342
+3  972 249 2343
+3  1018 767 2343
+3  2072 8 2344
+3  2272 768 2344
+3  1272 250 2345
+3  1173 768 2345
+3  1632 81 2346
+3  1534 769 2346
+3  903 250 2347
+3  1272 769 2347
+3  1872 26 2348
+3  1912 770 2348
+3  1092 251 2349
+3  1073 770 2349
+3  1452 81 2350
+3  1632 771 2350
+3  952 251 2351
+3  1092 771 2351
+3  2336 9 2352
+3  2264 772 2352
+3  1268 252 2353
+3  1305 772 2353
+3  1628 82 2354
+3  1666 773 2354
+3  969 252 2355
+3  1268 773 2355
+3  1868 27 2356
+3  1908 774 2356
+3  1090 253 2357
+3  1071 774 2357
+3  1450 82 2358
+3  1628 775 2358
+3  950 253 2359
+3  1090 775 2359
+3  2256 4 2360
+3  2136 776 2360
+3  1204 254 2361
+3  1265 776 2361
+3  1564 83 2362
+3  1626 777 2362
+3  949 254 2363
+3  1204 777 2363
+3  1804 27 2364
+3  1868 778 2364
+3  1070 255 2365
+
diff --git a/Data/data/meshes/polyhedral_complex_of_spheres/Sphere3.off b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere3.off
new file mode 100644
index 000000000000..b4e2b64032a0
--- /dev/null
+++ b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere3.off
@@ -0,0 +1,6735 @@
+NOFF
+2329 4402 0
+
+1.2000000000000002 -0.22426888788086641 0.85065080835203988  7.984805159532336e-16 0.52573111211913326 0.8506508083520401
+1.2 -0.22426888788086652 -0.8506508083520401  1.7011106644221067e-16 0.52573111211913259 -0.85065080835204054
+1.2000000000000002 -1.2757311121191335 0.85065080835203988  -7.6376397178135386e-17 -0.52573111211913293 0.85065080835204032
+1.2 -1.2757311121191335 -0.85065080835203988  -1.7358272085939859e-17 -0.52573111211913315 -0.8506508083520401
+1.7257311121191339 0.10065080835203966 2.4513010918904203e-18  0.52573111211913393 0.85065080835203966 -3.4369378730160925e-16
+1.7257311121191339 -1.6006508083520399 -2.4513010918904203e-18  0.52573111211913248 -0.85065080835204054 2.1524257386565428e-16
+0.59214384399202546 -0.3881595429818786 0.70538094374692573  -0.60285708655996961 0.35990150486609074 0.7120633679522832
+0.67426888788086625 -1.6006508083520399 1.2256505459452107e-18  -0.52573111211913282 -0.85065080835204032 1.388661766875189e-17
+2.0506508083520396 -0.75000000000000011 0.52573111211913359  0.85065080835204054 1.2332864728485448e-16 0.52573111211913259
+2.0506508083520396 -0.75 -0.52573111211913359  0.85065080835203988 3.4716544171879717e-16 -0.5257311121191337
+0.58303192413334481 -0.40257317574481138 0.70495163176324016  -0.60285708655996884 0.35990150486609146 0.71206336795228342
+0.63268818151834738 -0.32335420881895094 0.70294074606773105  -0.5606579325259814 0.42546670457134944 0.71038071904922107
+1.5568220897730902 -0.75 0.93417235896271555  0.35722126167557472 6.9462727286247402e-18 0.93401979112163924
+1.7773502691896259 -0.17264973081037449 0.57735026918962595  0.57739733617063294 0.57762605998672589 0.5770272532621562
+1.2 0.18417235896271567 0.35682208977308999  7.6061686378440902e-16 0.93401979112163913 0.35722126167557494
+0.62443505191569892 -0.33636614204180326 0.70422028778974766  -0.5606579325259835 0.42546670457134278 0.7103807190492234
+0.84317791022691035 -0.75 0.93417235896271589  -0.35662245495100625 -0.00037008290847543424 0.93424851493773242
+1.55682208977309 -0.74999999999999989 -0.93417235896271567  0.35722126167557505 2.5006581823049062e-16 -0.93401979112163913
+0.84317791022691035 -0.75 -0.93417235896271567  -0.35722126167557405 -1.1114036365799584e-16 -0.93401979112163958
+0.5493198212532957 -0.45674068614295493 0.69911600851089584  -0.64093662140152596 0.29301330949339005 0.70946701671475032
+1.2000000000000002 0.18417235896271567 -0.35682208977308999  0.00037008290847612011 0.93424851493773231 -0.35662245495100636
+1.7773502691896261 -0.17264973081037449 -0.57735026918962551  0.57739733617063238 0.57762605998672589 -0.57702725326215654
+1.7773502691896264 -1.3273502691896253 0.57735026918962551  0.57702725326215831 -0.57739733617063227 0.57762605998672423
+1.2000000000000002 -1.6841723589627158 0.3568220897730901  -0.00037008290847335556 -0.93424851493773231 0.35662245495100653
+1.2000000000000002 -1.6841723589627158 -0.3568220897730901  2.6048522732342782e-16 -0.93401979112164046 -0.35722126167557183
+1.7773502691896259 -1.3273502691896257 -0.57735026918962551  0.57739733617063216 -0.57762605998672556 -0.5770272532621572
+2.134172358962716 -1.1068220897730896 1.2321651268072106e-18  0.93424851493773209 -0.35662245495100681 0.00037008290847519973
+2.1341723589627155 -0.39317791022691029 -6.1608256340360548e-19  0.93424851493773242 0.35662245495100597 0.00037008290847328595
+0.62264973081037422 -1.3273502691896257 -0.57735026918962584  -0.57702725326215698 -0.57739733617063183 -0.57762605998672611
+0.26582764103728429 -1.1068220897730898 1.2321651268072117e-18  -0.93424851493773209 -0.35662245495100692 0.00037008290847504171
+0.62264973081037422 -1.3273502691896257 0.57735026918962595  -0.57702725326215787 -0.57739733617063271 0.57762605998672423
+0.54306000239317154 -0.46664565776233696 0.69755165300174249  -0.64093662140152685 0.29301330949338805 0.70946701671475032
+1.531208094637017 -0.34872297720557643 0.85397772162051189  0.33139575632083174 0.40118660278746704 0.85394740027497895
+1.4046978598347686 -0.01751488256855982 0.64927986178574382  0.20481384113375192 0.73258235910829927 0.64913355914122706
+0.99530214016523222 -0.017514882568559709 0.64927986178574393  -0.20481384113375062 0.73258235910829983 0.64913355914122695
+0.86879190536298356 -0.34872297720557643 0.85397772162051211  -0.33139575632083107 0.40118660278746743 0.85394740027497895
+1.2000000000000002 -0.55342083704034473 0.98048795642276054  -1.0422004117940045e-16 0.19637276165371687 0.98052931546205824
+1.2 -0.55342083704034473 -0.98048795642276054  1.0422004117940017e-16 0.19637276165371687 -0.98052931546205824
+0.86879190536298345 -0.34872297720557638 -0.853977721620512  -0.33139575632083001 0.40118660278746782 -0.85394740027497917
+0.99530214016523211 -0.017514882568559598 -0.64927986178574393  -0.20481384113375048 0.73258235910829961 -0.64913355914122728
+1.4046978598347681 -0.017514882568559709 -0.64927986178574393  0.20481384113375253 0.73258235910829894 -0.64913355914122728
+1.531208094637017 -0.34872297720557655 -0.85397772162051189  0.33139575632083162 0.40118660278746832 -0.8539474002749784
+1.6012770227944242 -1.6039777216205118 0.33120809463701661  0.40118660278746981 -0.85394740027497795 0.3313957563208309
+1.3965791629596556 -1.7304879564227607 0  0.19637276165371553 -0.98052931546205846 0
+1.6012770227944237 -1.6039777216205118 -0.33120809463701673  0.40118660278746865 -0.8539474002749784 -0.33139575632083129
+1.9324851174314406 -1.3992798617857436 -0.20469785983476813  0.73258235910829894 -0.64913355914122728 -0.20481384113375273
+1.9324851174314408 -1.3992798617857432 0.20469785983476801  0.73258235910829872 -0.64913355914122717 0.20481384113375398
+2.053977721620512 -0.41879190536298327 0.40127702279442357  0.85394740027497706 0.33139575632083451 0.40118660278746859
+0.86879190536298334 -1.1512770227944236 -0.853977721620512  -0.33139575632083118 -0.40118660278746837 -0.85394740027497851
+0.50787822903712998 -0.52299793234814529 0.68413337702600852  -0.675316374147651 0.22527759233947955 0.70228042917184952
+0.55072013821425636 -0.95469785983476807 0.73248511743144062  -0.64913355914122728 -0.20481384113375187 0.73258235910829927
+0.94686945971280478 0.17991689161909552 0.26460466631117979  -0.22507894965080849 0.93495764835206185 0.27421462800527469
+1.2000000000000002 -0.94657916295965572 0.98048795642276054  1.021363855103833e-15 -0.1963727616537177 0.98052931546205802
+1.8492798617857442 -0.95469785983476818 0.73248511743143996  0.64913355914122739 -0.20481384113375128 0.73258235910829927
+1.849279861785744 -0.54530214016523193 0.73248511743144029  0.64913355914122772 0.20481384113375339 0.73258235910829828
+1.9324851174314406 -0.10072013821425641 0.20469785983476813  0.73258235910829994 0.64913355914122695 0.20481384113375017
+1.601277022794424 0.10397772162051178 0.33120809463701673  0.40118660278746743 0.85394740027497895 0.33139575632083129
+1.0034208370403446 0.23048795642276054 0  -0.19637276165371617 0.98052931546205835 1.478555529444688e-15
+0.95847935459740885 0.19857068261001021 0.20072208160320931  -0.22151649240577825 0.95495693252433944 0.19745303394970934
+0.22988186145330614 -0.96732927410114633 0.099634331047451258  -0.97545429555207486 -0.20136271833028208 0.08911774770294062
+0.55072013821425636 -0.54530214016523193 0.73248511743144051  -0.64913355914122683 0.20481384113375087 0.73258235910829994
+0.86879190536298379 -1.151277022794424 0.85397772162051189  -0.33139575632083107 -0.40118660278746854 0.85394740027497851
+1.8492798617857438 -0.54530214016523182 -0.73248511743144007  0.64913355914122717 0.20481384113375148 -0.73258235910829939
+1.531208094637017 -1.151277022794424 -0.85397772162051178  0.33139575632083035 -0.40118660278746909 -0.85394740027497851
+1.2000000000000002 -0.94657916295965583 -0.98048795642276054  3.3611241228009172e-16 -0.196372761653717 -0.98052931546205813
+0.55072013821425636 -0.95469785983476829 -0.73248511743144051  -0.64913355914122661 -0.20481384113375029 -0.73258235910830016
+0.55072013821425636 -0.54530214016523204 -0.73248511743144062  -0.64913355914122695 0.20481384113375187 -0.7325823591082995
+0.22628605152906522 -0.97313250261608553 0.01853460685588823  -0.97011569110293383 -0.24165005293363398 0.021927101793193664
+0.97237322050691288 0.2205376190193819 -0.067701629511043915  -0.2410960188930456 0.96718604322533452 -0.080149032832876443
+1.3965791629596556 0.23048795642276054 0  0.19637276165371675 0.98052931546205824 0
+1.601277022794424 0.10397772162051178 -0.33120809463701673  0.40118660278746793 0.85394740027497873 -0.33139575632083113
+2.053977721620512 -0.41879190536298344 -0.40127702279442368  0.8539474002749784 0.33139575632083257 -0.40118660278746737
+2.053977721620512 -1.0812080946370166 0.40127702279442351  0.85394740027497751 -0.33139575632083157 0.40118660278747026
+1.531208094637017 -1.151277022794424 0.85397772162051167  0.33139575632083174 -0.40118660278746887 0.85394740027497806
+1.4046978598347688 -1.4824851174314402 0.64927986178574359  0.20481384113375084 -0.73258235910829972 0.64913355914122695
+0.79872297720557661 -1.6039777216205122 0.33120809463701684  -0.40118660278746981 -0.85394740027497729 0.33139575632083251
+1.0034208370403446 -1.7304879564227607 0  -0.19637276165371578 -0.98052931546205846 0
+0.99530214016523222 -1.4824851174314406 -0.64927986178574371  -0.20481384113375262 -0.73258235910829927 -0.64913355914122695
+1.4046978598347686 -1.4824851174314402 -0.64927986178574359  0.20481384113375251 -0.73258235910829894 -0.64913355914122739
+1.8492798617857438 -0.95469785983476796 -0.73248511743144029  0.64913355914122783 -0.20481384113375339 -0.73258235910829828
+2.053977721620512 -1.0812080946370168 -0.40127702279442357  0.85394740027497795 -0.33139575632083285 -0.40118660278746815
+2.1804879564227604 -0.74999999999999989 0.19657916295965536  0.98052931546205768 0 0.19637276165371936
+2.1804879564227604 -0.74999999999999989 -0.19657916295965536  0.98052931546205768 0 -0.19637276165371936
+1.9324851174314406 -0.10072013821425641 -0.20469785983476813  0.73258235910829916 0.64913355914122717 -0.20481384113375223
+0.79872297720557672 -1.6039777216205122 -0.33120809463701678  -0.40118660278747048 -0.85394740027497729 -0.33139575632083179
+0.34602227837948807 -1.0812080946370166 -0.40127702279442368  -0.85394740027497884 -0.33139575632083074 -0.40118660278746815
+0.46751488256855955 -1.3992798617857436 -0.20469785983476818  -0.7325823591083005 -0.64913355914122639 -0.2048138411337502
+0.34602227837948807 -1.0812080946370168 0.40127702279442368  -0.85394740027497873 -0.33139575632083085 0.40118660278746832
+0.46751488256855955 -1.3992798617857436 0.20469785983476818  -0.7325823591083005 -0.64913355914122639 0.20481384113375023
+0.99530214016523222 -1.4824851174314406 0.64927986178574371  -0.20481384113375237 -0.73258235910829894 0.6491335591412275
+0.22988186145330608 -0.96732927410114655 -0.09963433104745123  -0.97545429555207175 -0.20136271833029415 -0.089117747702946865
+0.95847935459740874 0.19857068261001024 -0.20072208160320937  -0.22151649240577892 0.954956932524339 -0.19745303394971003
+1.7339861224060584 -0.34452585126808544 0.741922863772152  0.53404105644655964 0.40564529943251687 0.74178975530654645
+1.4079367413660944 0.11400769557376311 0.45853354684184816  0.20774869885998892 0.86409658071843198 0.45845128128591373
+0.25697201819559901 -0.92432848622760766 -0.28050566540029298  -0.94624082570117252 -0.15592580676948942 -0.28339979280099542
+0.74146645315815196 -0.54206325863390559 0.86400769557376322  -0.45845128128591361 0.20774869885998853 0.86409658071843209
+1.322084831801611 -0.74999999999999989 0.9925196692479058  0.1223068254118857 -2.0838543060791878e-17 0.99249233773247159
+1.0779151681983894 -0.74999999999999989 -0.9925196692479058  -0.12230682541188453 -3.2994359846253809e-16 -0.9924923377324717
+0.66601387759394226 -0.34452585126808516 -0.74192286377215244  -0.53404105644655797 0.40564529943252342 -0.74178975530654412
+0.99206325863390588 0.11400769557376322 -0.45853354684184827  -0.2077486988599887 0.86409658071843187 -0.45845128128591395
+1.6054741487319153 -0.008077136227848003 -0.53398612240605781  0.40564529943251759 0.74178975530654712 -0.53404105644655842
+1.6585335468418489 -0.5420632586339057 -0.86400769557376278  0.45845128128591411 0.2077486988599905 -0.86409658071843143
+1.4079367413660953 -1.6140076955737628 0.45853354684184833  0.20774869885998881 -0.86409658071843209 0.45845128128591361
+1.2 -1.7425196692479057 -0.12208483180161099  7.2934900712771562e-16 -0.99249233773247159 -0.12230682541188537
+1.6054741487319149 -1.4919228637721522 -0.53398612240605758  0.40564529943251887 -0.74178975530654701 -0.53404105644655753
+2.0640076955737632 -1.2085335468418479 -0.20793674136609444  0.86409658071843243 -0.45845128128591328 -0.20774869885998787
+1.9419228637721528 -1.2839861224060569 0.40547414873191484  0.74178975530654812 -0.53404105644655753 0.40564529943251665
+1.9419228637721524 -0.21601387759394264 0.40547414873191501  0.74178975530654756 0.53404105644655697 0.40564529943251842
+0.74146645315815196 -0.95793674136609475 -0.86400769557376322  -0.45845128128591356 -0.20774869885998851 -0.86409658071843221
+0.401514802275725 -0.69274920908571369 0.59888293763788769  -0.7801909427416257 0.041329938271327006 0.62417459822266219
+0.74146645315815207 -0.95793674136609486 0.86400769557376322  -0.45845128128591311 -0.20774869885998848 0.86409658071843243
+0.83482598411320952 6.1457978060812172e-19 0.54975734503310147  -0.36351224121617404 0.75900083470875446 0.54016347840020462
+1.0779151681983894 -0.74999999999999989 0.9925196692479058  -0.12230682541188406 3.4730905101319794e-17 0.99249233773247181
+1.7339861224060584 -1.1554741487319149 0.741922863772152  0.53404105644655908 -0.40564529943251793 0.74178975530654645
+1.6585335468418487 -0.54206325863390559 0.86400769557376289  0.45845128128591478 0.20774869885998962 0.86409658071843132
+2.0640076955737632 -0.29146645315815217 0.20793674136609444  0.86409658071843365 0.45845128128591139 0.20774869885998701
+1.6054741487319151 -0.008077136227847892 0.53398612240605792  0.40564529943251865 0.74178975530654712 0.53404105644655731
+1.2 0.2425196692479058 -0.12208483180161095  2.3964324519910656e-16 0.99249233773247181 -0.12230682541188358
+0.99206325863390554 0.11400769557376311 0.45853354684184833  -0.20774869885998912 0.86409658071843187 0.45845128128591373
+0.84685829520082545 0.019286849148286413 0.53075413092765555  -0.36351224121616488 0.75900083470875046 0.54016347840021628
+0.66601387759394237 -0.34452585126808494 0.74192286377215244  -0.53404105644655742 0.40564529943252242 0.74178975530654501
+0.66601387759394248 -1.1554741487319153 0.74192286377215233  -0.53404105644655708 -0.40564529943251937 0.74178975530654689
+1.7339861224060584 -0.34452585126808516 -0.741922863772152  0.53404105644655864 0.40564529943251865 -0.74178975530654623
+1.7339861224060584 -1.1554741487319149 -0.741922863772152  0.53404105644655842 -0.40564529943251715 -0.74178975530654723
+1.322084831801611 -0.74999999999999989 -0.9925196692479058  0.12230682541188573 4.1677086121583756e-17 -0.99249233773247159
+0.66601387759394248 -1.1554741487319151 -0.74192286377215233  -0.53404105644655731 -0.40564529943251704 -0.74178975530654823
+0.74146645315815185 -0.54206325863390548 -0.86400769557376322  -0.45845128128591384 0.20774869885998898 -0.86409658071843187
+0.31682936237190801 -0.8280363774210906 -0.46105412139556579  -0.8782962528090239 -0.071121388581574935 -0.4727974623322927
+0.34243159318633287 -0.78789291377908466 -0.51176714118576783  -0.85590248058787433 -0.033910248167251439 -0.51602426182570016
+1.2 0.2425196692479058 0.12208483180161095  -7.640799122290355e-17 0.99249233773247192 0.12230682541188283
+1.4079367413660944 0.11400769557376311 -0.45853354684184833  0.20774869885998962 0.86409658071843187 -0.45845128128591373
+2.0640076955737632 -0.29146645315815212 -0.20793674136609447  0.86409658071843187 0.4584512812859135 -0.20774869885998987
+2.0640076955737636 -1.2085335468418477 0.20793674136609439  0.86409658071843243 -0.45845128128591239 0.20774869885999017
+1.6585335468418487 -0.95793674136609475 0.86400769557376267  0.45845128128591395 -0.20774869885999089 0.86409658071843143
+1.6054741487319153 -1.491922863772152 0.53398612240605781  0.40564529943251759 -0.74178975530654778 0.53404105644655731
+0.79452585126808539 -1.4919228637721524 0.53398612240605769  -0.40564529943251698 -0.74178975530654778 0.53404105644655797
+1.2 -1.7425196692479057 0.12208483180161099  6.8072573998586795e-16 -0.99249233773247159 0.12230682541188549
+0.79452585126808528 -1.4919228637721522 -0.53398612240605792  -0.4056452994325187 -0.74178975530654545 -0.53404105644655964
+1.4079367413660944 -1.614007695573763 -0.45853354684184833  0.20774869885998909 -0.86409658071843176 -0.45845128128591417
+1.6585335468418487 -0.95793674136609452 -0.86400769557376267  0.4584512812859145 -0.20774869885998953 -0.86409658071843143
+1.9419228637721524 -1.2839861224060574 -0.40547414873191495  0.74178975530654701 -0.53404105644655786 -0.40564529943251831
+2.1925196692479059 -0.62791516819838922 2.4628875390745807e-18  0.99249233773247181 0.12230682541188423 -5.2096357651979694e-17
+2.1925196692479059 -0.87208483180161089 -2.4628875390745799e-18  0.99249233773247181 -0.12230682541188413 -6.9461810202639609e-18
+1.9419228637721524 -0.21601387759394264 -0.40547414873191495  0.74178975530654789 0.53404105644655719 -0.40564529943251754
+0.99206325863390588 -1.614007695573763 -0.45853354684184849  -0.20774869885998934 -0.86409658071843087 -0.45845128128591556
+0.33599230442623673 -1.2085335468418481 -0.20793674136609458  -0.86409658071843209 -0.45845128128591345 -0.2077486988599889
+0.45807713622784751 -1.2839861224060574 -0.40547414873191506  -0.74178975530654689 -0.53404105644655819 -0.40564529943251804
+0.45807713622784763 -1.2839861224060576 0.40547414873191512  -0.74178975530654645 -0.5340410564465583 0.40564529943251881
+0.33599230442623684 -1.2085335468418481 0.20793674136609461  -0.86409658071843176 -0.45845128128591395 0.20774869885998978
+0.99206325863390588 -1.614007695573763 0.45853354684184833  -0.20774869885998906 -0.86409658071843165 0.45845128128591439
+0.34177771381313393 -0.78887113359859207 -0.51061830246204121  -0.85590248058786922 -0.033910248167229561 -0.51602426182571026
+0.34288899659372696 -0.78713443636827329 -0.51257565524045923  -0.85590248058787344 -0.033910248167249565 -0.51602426182570194
+1.3827577335161512 -0.18355391658479392 0.80357852474018532  0.18137511328579431 0.56621300696157095 0.80405590541211835
+1.4379740221293495 -0.54790881588591045 0.95001448309746583  0.23767767361493644 0.20255543129006817 0.94998980032413305
+1.2000000000000002 -0.0706034255649165 0.73377128224391142  8.7163359736193314e-16 0.67830899168555436 0.73477677685030751
+1.5850500562448067 -0.16285875964110386 0.71204046096811657  0.3845705542759717 0.58712598556604001 0.71231212670919619
+1.0172422664838487 -0.18355391658479348 0.80357852474018532  -0.18137511328579392 0.56621300696157051 0.8040559054121188
+1.2000000000000002 0.075115262488245294 0.56496442685265946  5.5221311543411251e-16 0.82480365918097698 0.56541924604816096
+1.0870495089801231 -0.36631165010094457 0.9165290157600624  -0.11209598472398208 0.38483789367577798 0.91615189013610143
+0.81494994375519358 -0.16285875964110375 0.7120404609681168  -0.3845705542759722 0.58712598556604001 0.71231212670919597
+1.3129504910198773 -0.36631165010094457 0.91652901576006229  0.11209598472398373 0.38483789367577581 0.91615189013610221
+0.96202597787065125 -0.54790881588591023 0.95001448309746594  -0.23767767361493694 0.20255543129006864 0.94998980032413283
+1.0870495089801231 -0.36631165010094452 -0.9165290157600624  -0.11209598472398326 0.38483789367577603 -0.91615189013610221
+1.4379740221293495 -0.54790881588591023 -0.95001448309746561  0.23767767361493697 0.20255543129006795 -0.94998980032413294
+1.017242266483849 -0.18355391658479381 -0.80357852474018554  -0.18137511328579417 0.56621300696157051 -0.80405590541211869
+0.96202597787065125 -0.54790881588591045 -0.95001448309746594  -0.23767767361493575 0.20255543129006887 -0.94998980032413305
+1.2000000000000002 -0.0706034255649165 -0.73377128224391142  5.764588731557008e-16 0.67830899168555392 -0.73477677685030796
+0.81494994375519336 -0.16285875964110375 -0.71204046096811668  -0.38457055427597042 0.58712598556604023 -0.71231212670919664
+1.3827577335161514 -0.18355391658479359 -0.80357852474018521  0.18137511328579328 0.56621300696157029 -0.80405590541211902
+1.2000000000000002 0.075115262488245294 -0.56496442685265946  -3.299386538757276e-16 0.82480365918097698 -0.56541924604816096
+1.3129504910198775 -0.36631165010094457 -0.9165290157600624  0.1120959847239841 0.3848378936757767 -0.91615189013610177
+1.5850500562448067 -0.16285875964110386 -0.71204046096811668  0.38457055427597114 0.58712598556604023 -0.71231212670919641
+1.5836883498990559 -1.6665290157600621 0.11295049101987709  0.38483789367577709 -0.91615189013610177 0.11209598472398286
+1.7871412403588969 -1.4620404609681164 0.38505005624480626  0.58712598556604179 -0.71231212670919564 0.38457055427597003
+1.5836883498990559 -1.6665290157600623 -0.11295049101987707  0.38483789367577775 -0.91615189013610154 -0.11209598472398273
+1.40209118411409 -1.7000144830974659 0.23797402212934909  0.20255543129007092 -0.9499898003241326 0.23767767361493622
+1.7664460834152065 -1.553578524740185 -0.18275773351615091  0.56621300696157206 -0.80405590541211724 -0.18137511328579567
+1.4020911841140902 -1.7000144830974655 -0.23797402212934918  0.20255543129006892 -0.9499898003241326 -0.23767767361493738
+1.8793965744350842 -1.4837712822439109 3.6838438251301876e-18  0.67830899168555292 -0.73477677685030884 -2.0835862885145818e-17
+1.7871412403588964 -1.4620404609681166 -0.38505005624480632  0.58712598556603934 -0.71231212670919797 -0.38457055427596953
+1.7664460834152067 -1.553578524740185 0.18275773351615077  0.56621300696157284 -0.80405590541211724 0.18137511328579339
+2.0251152624882458 -1.3149644268526588 4.9279074600009303e-18  0.82480365918097787 -0.56541924604815963 3.959263846508732e-16
+2.0035785247401852 -0.56724226648384923 0.56644608341520641  0.80405590541211902 0.18137511328579364 0.56621300696157018
+2.1500144830974657 -0.51202597787065107 0.2020911841140898  0.94998980032413249 0.2376776736149368 0.20255543129007017
+1.0870495089801231 -1.1336883498990558 -0.91652901576006229  -0.11209598472398448 -0.38483789367577503 -0.91615189013610243
+0.81494994375519347 -1.3371412403588963 -0.71204046096811691  -0.38457055427597137 -0.58712598556603912 -0.71231212670919708
+0.50468001700647158 -0.52828837108788052 -0.68272481536695295  -0.70341121140138541 0.24317084427689514 -0.66789266216099252
+0.24998551690253412 -0.98797402212934915 -0.20209118411408994  -0.9499898003241326 -0.23767767361493736 -0.20255543129006948
+0.46622871775608876 -0.75 0.67939657443508383  -0.73477677685030829 -3.9588139481777045e-16 0.67830899168555359
+0.48795953903188338 -1.1350500562448065 0.58714124035889637  -0.71231212670919686 -0.38457055427597164 0.58712598556603945
+0.5039242293873103 -0.52945918848859996 -0.68235511400187066  -0.70341121140136365 0.24317084427688193 -0.66789266216102017
+0.74055958467102845 -0.15027494754537984 0.65399889841309089  -0.47623926703786856 0.60557549052406867 0.63755351603435406
+1.0870495089801235 -1.1336883498990558 0.9165290157600624  -0.11209598472398359 -0.38483789367577514 0.91615189013610243
+1.4379740221293495 -0.95209118411408999 0.95001448309746561  0.23767767361493705 -0.20255543129006778 0.94998980032413294
+2.0035785247401856 -0.93275773351615066 0.5664460834152063  0.80405590541211935 -0.18137511328579281 0.56621300696156995
+1.7649644268526601 -0.75 0.82511526248824485  0.56541924604816107 -3.4730384618497649e-18 0.82480365918097698
+1.9337712822439117 -0.75000000000000011 0.67939657443508328  0.73477677685030851 -1.2675149921797036e-15 0.67830899168555325
+1.9120404609681168 -0.3649499437551938 0.58714124035889637  0.71231212670919697 0.38457055427597076 0.58712598556603979
+1.8793965744350838 -0.016228717756088806 -3.6838438251301884e-18  0.67830899168555203 0.73477677685030962 3.1948323090556916e-16
+1.7871412403588964 -0.037959539031883538 0.38505005624480637  0.58712598556604001 0.71231212670919664 0.38457055427597098
+1.7664460834152065 0.053578524740185096 0.18275773351615091  0.56621300696157051 0.8040559054121188 0.18137511328579331
+1.40209118411409 0.20001448309746583 0.23797402212934918  0.20255543129007034 0.94998980032413272 0.23767767361493608
+0.70685918524788072 -0.20468185015976154 0.67677227421098896  -0.4910585344062261 0.56677814486535194 0.6615315943247152
+0.99790881588590996 0.20001448309746583 0.23797402212934915  -0.20255543129007028 0.94998980032413283 0.23767767361493566
+0.71021467390312121 -0.19943478257349531 0.67476755984413883  -0.49105853440622815 0.56677814486535261 0.66153159432471309
+0.46796403496887878 -0.58666916470964625 0.66003296952840662  -0.73315795129590233 0.17491713444451357 0.65717837344918428
+0.79934060742300872 -0.055862651692236226 0.5979056290568221  -0.3776341406275795 0.67726348918457735 0.63143219909187531
+0.2389405724498605 -0.95306848001363997 0.18186355091081885  -0.96305716105844952 -0.20064914867263259 0.1796129830245782
+0.82493587926686529 -0.015775204470230869 0.56417193374348917  -0.38232288700972672 0.72686052081252872 0.57052869634461612
+0.63503557314734083 -0.75 0.82511526248824552  -0.56541924604816163 -1.0766419231734269e-16 0.82480365918097653
+1.0172422664838496 -1.3164460834152063 0.80357852474018554  -0.18137511328579276 -0.56621300696157029 0.80405590541211913
+0.96202597787065158 -0.95209118411408999 0.95001448309746594  -0.23767767361493594 -0.20255543129006862 0.94998980032413305
+2.0035785247401852 -0.56724226648384934 -0.56644608341520641  0.80405590541211858 0.18137511328579409 -0.56621300696157051
+1.7649644268526601 -0.75 -0.82511526248824485  0.56541924604816107 5.7999742312891081e-16 -0.82480365918097698
+1.3827577335161512 -1.3164460834152063 -0.80357852474018521  0.18137511328579306 -0.56621300696157095 -0.80405590541211858
+1.4379740221293491 -0.95209118411408988 -0.95001448309746583  0.23767767361493636 -0.20255543129006795 -0.94998980032413316
+1.312950491019877 -1.1336883498990558 -0.91652901576006229  0.11209598472398394 -0.38483789367577526 -0.91615189013610243
+0.96202597787065103 -0.95209118411408988 -0.95001448309746583  -0.23767767361493705 -0.20255543129006864 -0.94998980032413283
+0.39642147525981475 -0.93275773351615077 -0.56644608341520675  -0.80405590541211891 -0.18137511328579489 -0.56621300696156995
+0.63503557314734083 -0.75 -0.82511526248824552  -0.56541924604816163 1.0766419231734269e-16 -0.82480365918097653
+0.46622871775608876 -0.75000000000000011 -0.67939657443508383  -0.73477677685030829 7.8134485819296787e-16 -0.67830899168555348
+0.80588150441467499 -0.045732053728024698 0.58956860097969011  -0.38232288700972333 0.72686052081253028 0.57052869634461656
+0.34288899659372707 -0.78713443636827329 0.51257565524045945  -0.85590248058786422 -0.033910248167211242 0.51602426182571981
+0.34243159318633287 -0.78789291377908466 0.51176714118576805  -0.85590248058786889 -0.033910248167232739 0.5160242618257106
+0.34177771381313388 -0.78887113359859229 0.51061830246204121  -0.85590248058787288 -0.033910248167247574 0.51602426182570293
+0.99790881588591029 0.20001448309746583 -0.23797402212934918  -0.20255543129006723 0.94998980032413294 -0.23767767361493783
+1.5836883498990559 0.16652901576006207 0.11295049101987709  0.38483789367577637 0.9161518901361021 0.11209598472398305
+1.40209118411409 0.20001448309746583 -0.23797402212934915  0.20255543129007114 0.9499898003241326 -0.2376776736149358
+1.5836883498990559 0.16652901576006207 -0.11295049101987709  0.38483789367577648 0.91615189013610199 -0.11209598472398297
+1.7871412403588964 -0.037959539031883538 -0.38505005624480637  0.5871259855660409 0.71231212670919597 -0.38457055427597087
+2.1165290157600625 -0.6370495089801228 -0.38368834989905554  0.91615189013610099 0.1120959847239822 -0.38483789367577931
+1.9120404609681168 -0.36494994375519357 -0.58714124035889637  0.71231212670919641 0.3845705542759717 -0.58712598556603979
+2.1165290157600625 -0.86295049101987698 0.38368834989905543  0.91615189013610165 -0.11209598472398331 0.3848378936757772
+1.9120404609681168 -1.135050056244806 0.58714124035889637  0.71231212670919819 -0.38457055427596898 0.58712598556603957
+1.3129504910198773 -1.1336883498990558 0.91652901576006229  0.11209598472398363 -0.38483789367577614 0.9161518901361021
+1.5850500562448071 -1.3371412403588963 0.71204046096811657  0.38457055427597236 -0.58712598556603968 0.71231212670919608
+1.3827577335161514 -1.3164460834152065 0.80357852474018521  0.18137511328579295 -0.56621300696157051 0.80405590541211891
+1.2000000000000002 -1.5751152624882452 0.56496442685265946  1.3892153847399058e-16 -0.82480365918097576 0.56541924604816274
+0.63355391658479354 -1.5535785247401852 0.18275773351615093  -0.56621300696157051 -0.8040559054121188 0.18137511328579331
+0.99790881588591018 -1.7000144830974657 0.23797402212934921  -0.20255543129006723 -0.94998980032413316 0.2376776736149368
+0.81631165010094464 -1.6665290157600627 0.1129504910198771  -0.38483789367577681 -0.91615189013610188 0.1120959847239833
+0.99790881588591029 -1.7000144830974659 -0.23797402212934909  -0.20255543129006776 -0.94998980032413294 -0.23767767361493697
+1.017242266483849 -1.3164460834152065 -0.80357852474018521  -0.18137511328579398 -0.56621300696157084 -0.80405590541211847
+1.1999999999999997 -1.5751152624882452 -0.56496442685265946  -4.9664450004451621e-16 -0.82480365918097553 -0.56541924604816296
+1.2 -1.4293965744350836 -0.73377128224391142  -2.1183127266564911e-16 -0.6783089916855537 -0.73477677685030818
+1.5850500562448067 -1.3371412403588963 -0.71204046096811657  0.38457055427597253 -0.58712598556604045 -0.71231212670919553
+1.9337712822439117 -0.75 -0.67939657443508328  0.73477677685030751 2.0488598503726717e-16 -0.67830899168555447
+1.9120404609681168 -1.1350500562448065 -0.58714124035889637  0.71231212670919686 -0.38457055427597125 -0.58712598556603968
+2.0035785247401852 -0.93275773351615077 -0.56644608341520641  0.80405590541211902 -0.18137511328579364 -0.56621300696157018
+2.1500144830974657 -0.98797402212934904 -0.2020911841140898  0.94998980032413249 -0.23767767361493719 -0.20255543129006995
+2.1165290157600625 -0.63704950898012302 0.38368834989905543  0.91615189013610077 0.11209598472398245 0.38483789367577964
+2.1500144830974657 -0.98797402212934915 0.20209118411408972  0.94998980032413227 -0.23767767361493719 0.20255543129007089
+2.1165290157600625 -0.86295049101987698 -0.38368834989905543  0.91615189013610088 -0.11209598472398295 -0.38483789367577903
+2.1500144830974657 -0.51202597787065129 -0.2020911841140898  0.94998980032413249 0.2376776736149368 -0.20255543129007036
+1.7664460834152065 0.053578524740185096 -0.18275773351615085  0.56621300696157051 0.8040559054121188 -0.18137511328579331
+2.0251152624882454 -0.18503557314734087 -4.9279074600009318e-18  0.82480365918097698 0.56541924604816085 -1.3892153847399056e-17
+0.81631165010094442 -1.6665290157600623 -0.11295049101987711  -0.38483789367577609 -0.91615189013610221 -0.11209598472398241
+0.61285875964110381 -1.4620404609681166 -0.38505005624480643  -0.58712598556603934 -0.71231212670919697 -0.38457055427597125
+0.36998650939197836 -0.74269333684247552 0.55678551944213661  -0.8349447946535743 0.020957685934292217 0.54993450999294469
+0.48795953903188327 -1.1350500562448065 -0.58714124035889637  -0.71231212670919597 -0.38457055427597131 -0.58712598556604068
+0.63355391658479376 -1.5535785247401854 -0.18275773351615088  -0.56621300696156951 -0.80405590541211902 -0.18137511328579553
+0.37488473751175444 -1.3149644268526592 -4.9279074600009341e-18  -0.82480365918097676 -0.56541924604816129 0
+0.39642147525981486 -0.93275773351615077 0.56644608341520686  -0.80405590541211891 -0.18137511328579314 0.56621300696157051
+0.24998551690253423 -0.98797402212934882 0.20209118411408999  -0.9499898003241326 -0.23767767361493708 0.20255543129006939
+0.52060342556491623 -1.4837712822439113 -3.6838438251301899e-18  -0.67830899168555481 -0.73477677685030718 3.4726438141909694e-18
+0.6128587596411037 -1.4620404609681166 0.38505005624480643  -0.58712598556603934 -0.71231212670919719 0.38457055427597109
+1.2000000000000002 -1.4293965744350836 0.73377128224391142  2.0835862885145816e-16 -0.67830899168555336 0.7347767768503084
+0.8149499437551937 -1.3371412403588963 0.71204046096811668  -0.38457055427597064 -0.58712598556604068 0.71231212670919641
+0.40036321981550405 -0.6946524719094237 0.59753024518837061  -0.79967159059349457 0.022528674978302438 0.60001483815101819
+0.39895802436543049 -0.69687753315555545 0.59574101077153174  -0.79967159059343473 0.022528674978363441 0.60001483815109546
+0.96559982489567697 0.20947750201587079 0.15035899655759488  -0.24320416233348857 0.9567573137208899 0.1595843916717827
+0.24336599009814622 -0.94602936533555493 0.21094260961626568  -0.95495693252433855 -0.19745303394971275 0.22151649240577886
+1.7521834643091894 -0.47457531588943436 0.78691464920034182  0.55218785652865943 0.27542173873706771 0.78691259802682978
+1.5412681489687436 0.077608148419754941 0.44564650023159863  0.34127086350966185 0.82760959526572608 0.4456417345171691
+0.96559982489567697 0.20947750201587081 -0.15035899655759494  -0.24320416233349013 0.95675731372088979 -0.1595843916717804
+0.64781653569081088 -0.47457531588943408 0.78691464920034226  -0.55218785652865776 0.2754217387370676 0.78691259802683111
+1.2000000000000002 -0.81584346485817771 0.99782996454078776  0 -0.065849124772593817 0.99782959104582747
+1.2000000000000002 -0.81584346485817771 -0.99782996454078776  0 -0.065849124772593817 -0.99782959104582747
+0.64781653569081088 -0.47457531588943419 -0.78691464920034226  -0.55218785652865798 0.2754217387370681 -0.78691259802683067
+0.95069104161024875 0.18567470552212903 -0.24579255546759926  -0.24611330719286928 0.93975526497093065 -0.23725151629021102
+1.5412681489687436 0.077608148419754941 -0.44564650023159885  0.34127086350966235 0.82760959526572575 -0.44564173451716921
+1.7521834643091894 -0.47457531588943419 -0.78691464920034182  0.55218785652865887 0.27542173873706827 -0.78691259802683
+1.4754246841105663 -1.5369146492003418 0.55218346430918919  0.27542173873706677 -0.78691259802683144 0.55218785652865754
+1.1341565351418224 -1.7478299645407878 -1.2310405966106296e-18  -0.065849124772593665 -0.99782959104582747 0
+1.4754246841105658 -1.5369146492003423 -0.55218346430918908  0.27542173873706888 -0.78691259802682978 -0.55218785652865909
+2.0276081484197555 -1.1956465002315984 -0.34126814896874325  0.82760959526572642 -0.44564173451716815 -0.34127086350966207
+2.027608148419755 -1.1956465002315986 0.34126814896874302  0.82760959526572597 -0.4456417345171691 0.3412708635096619
+1.986914649200342 -0.19781653569081092 0.27542468411056586  0.78691259802683011 0.55218785652865876 0.27542173873706821
+0.64781653569081088 -1.0254246841105659 -0.78691464920034226  -0.55218785652865832 -0.27542173873706799 -0.78691259802683045
+0.2530893365809796 -0.92998804508785282 -0.26439588316448515  -0.95675731372090322 -0.15958439167178515 -0.24320416233343448
+0.7543534997684016 -1.0912681489687439 0.82760814841975494  -0.44564173451716949 -0.34127086350966251 0.82760959526572553
+0.25308933658097965 -0.92998804508785282 0.26439588316448515  -0.95675731372092687 -0.1595843916717935 0.24320416233333605
+1.2000000000000002 -0.68415653514182251 0.99782996454078776  -7.6294444242541125e-17 0.06584912477259372 0.99782959104582747
+1.645646500231599 -1.0912681489687435 0.82760814841975483  0.44564173451716993 -0.34127086350966274 0.8276095952657252
+1.645646500231599 -0.40873185103125675 0.82760814841975483  0.44564173451716893 0.34127086350966063 0.82760959526572653
+2.027608148419755 -0.30435349976840131 0.34126814896874336  0.82760959526572586 0.44564173451716782 0.34127086350966385
+1.4754246841105658 0.036914649200342042 0.55218346430918919  0.27542173873706799 0.78691259802683033 0.55218785652865843
+1.2658434648581776 0.24782996454078776 -1.2310405966106292e-18  0.065849124772593665 0.99782959104582747 0
+0.92457531588943409 0.036914649200342042 0.5521834643091893  -0.27542173873706743 0.78691259802683056 0.55218785652865843
+0.94686945971280467 0.17991689161909563 -0.26460466631117985  -0.22507894965081496 0.93495764835206541 -0.27421462800525709
+0.75435349976840138 -0.40873185103125664 0.82760814841975505  -0.4456417345171686 0.3412708635096614 0.82760959526572653
+0.6478165356908111 -1.0254246841105663 0.78691464920034215  -0.55218785652865843 -0.27542173873706882 0.78691259802683011
+1.645646500231599 -0.40873185103125675 -0.82760814841975483  0.44564173451716993 0.34127086350966246 -0.82760959526572531
+1.7521834643091894 -1.0254246841105659 -0.78691464920034182  0.55218785652865932 -0.27542173873706838 -0.78691259802682978
+1.2000000000000002 -0.68415653514182251 -0.99782996454078776  7.6294444242540927e-17 0.06584912477259372 -0.99782959104582747
+0.75435349976840138 -1.0912681489687435 -0.82760814841975505  -0.44564173451716949 -0.34127086350966229 -0.82760959526572564
+0.75435349976840138 -0.40873185103125664 -0.82760814841975505  -0.44564173451716982 0.34127086350966096 -0.82760959526572597
+0.97351999728657068 0.22241808576487493 -0.034988854233130418  -0.2166870396643529 0.97542959357555281 -0.039797422259878493
+0.92457531588943409 0.036914649200342042 -0.55218346430918919  -0.2754217387370671 0.78691259802683144 -0.55218785652865743
+1.1341565351418224 0.24782996454078776 1.2310405966106292e-18  -0.065849124772593665 0.99782959104582747 0
+1.4754246841105658 0.036914649200342042 -0.5521834643091893  0.27542173873706866 0.78691259802682956 -0.55218785652865932
+1.986914649200342 -0.19781653569081104 -0.27542468411056586  0.78691259802682911 0.55218785652865943 -0.27542173873706954
+1.9869146492003424 -1.3021834643091887 0.27542468411056575  0.78691259802682978 -0.55218785652865932 0.27542173873706816
+1.7521834643091894 -1.0254246841105661 0.78691464920034182  0.55218785652865898 -0.27542173873706888 0.78691259802682978
+1.5412681489687439 -1.5776081484197546 0.44564650023159885  0.34127086350966063 -0.82760959526572619 0.44564173451716954
+0.92457531588943409 -1.5369146492003423 0.55218346430918908  -0.27542173873706716 -0.78691259802683056 0.55218785652865865
+1.2658434648581776 -1.7478299645407878 1.2310405966106296e-18  0.065849124772593665 -0.99782959104582747 0
+0.85873185103125671 -1.5776081484197548 -0.44564650023159907  -0.34127086350966263 -0.82760959526572475 -0.44564173451717054
+1.5412681489687436 -1.5776081484197548 -0.44564650023159874  0.34127086350966196 -0.82760959526572642 -0.44564173451716832
+1.645646500231599 -1.0912681489687435 -0.82760814841975483  0.4456417345171701 -0.3412708635096614 -0.82760959526572564
+1.986914649200342 -1.302183464309189 -0.27542468411056586  0.78691259802683 -0.55218785652865876 -0.27542173873706866
+2.1978299645407877 -0.75 -0.065843464858177436  0.99782959104582769 0 -0.065849124772590362
+2.1978299645407877 -0.75 0.065843464858177464  0.99782959104582769 0 0.065849124772590376
+2.027608148419755 -0.30435349976840137 -0.34126814896874336  0.82760959526572575 0.44564173451716782 -0.34127086350966401
+0.92457531588943409 -1.536914649200342 -0.5521834643091893  -0.27542173873706982 -0.78691259802682956 -0.55218785652865887
+0.41308535079965791 -1.3021834643091892 -0.27542468411056586  -0.78691259802683033 -0.55218785652865887 -0.2754217387370676
+0.37239185158024513 -1.195646500231599 -0.34126814896874341  -0.82760959526572564 -0.44564173451716932 -0.34127086350966235
+0.41308535079965802 -1.3021834643091892 0.27542468411056598  -0.78691259802683089 -0.55218785652865832 0.27542173873706671
+0.3723918515802449 -1.1956465002315986 0.34126814896874336  -0.82760959526572608 -0.44564173451716882 0.34127086350966174
+0.85873185103125671 -1.5776081484197548 0.44564650023159885  -0.34127086350966107 -0.82760959526572653 0.4456417345171686
+0.23894057244986044 -0.95306848001363997 -0.18186355091081888  -0.9630571610584503 -0.20064914867263101 -0.17961298302457609
+0.89270251295960135 0.092787072853812741 -0.43974499787970978  -0.29815500373095538 0.84204499011931544 -0.4495151036007089
+1.461054269450115 -0.11542238876277822 0.7274351680516471  0.26123864468751806 0.63469945426951135 0.72726265769102505
+1.3186983640546239 -0.48811498758743949 0.95777186148081694  0.11873329660574243 0.26161560941278617 0.95784115446597373
+1.1310037179992745 0.0032759752918453122 0.65407554465688122  -0.06912413518310466 0.7534327508752533 0.65388144479235411
+1.5036963168239361 -0.22706071813732454 0.79643145005237248  0.30395970967362052 0.52285425410030495 0.79638679287412983
+0.89630368317606424 -0.22706071813732454 0.79643145005237248  -0.30395970967361929 0.52285425410030439 0.7963867928741305
+1.2689962820007255 0.0032759752918453122 0.65407554465688122  0.069124135183106131 0.75343275087525274 0.65388144479235455
+1.0813016359453766 -0.48811498758743949 0.95777186148081694  -0.118733296605742 0.26161560941278611 0.95784115446597384
+0.93894573054988506 -0.11542238876277811 0.72743516805164721  -0.26123864468751856 0.63469945426951035 0.72726265769102583
+1.4303366934291697 -0.41911870558671405 0.9151298141069959  0.23057849677494927 0.33073974459589145 0.91512008947987211
+0.96966330657083066 -0.41911870558671399 0.91512981410699601  -0.23057849677494835 0.33073974459588995 0.915120089479873
+0.96966330657083044 -0.41911870558671399 -0.91512981410699601  -0.23057849677494902 0.33073974459589195 -0.91512008947987211
+1.4303366934291701 -0.41911870558671405 -0.9151298141069959  0.2305784967749491 0.33073974459589156 -0.91512008947987211
+0.93894573054988506 -0.11542238876277811 -0.72743516805164721  -0.26123864468751845 0.63469945426951091 -0.72726265769102549
+1.0813016359453766 -0.48811498758743949 -0.95777186148081694  -0.11873329660574221 0.26161560941278611 -0.95784115446597373
+1.2689962820007261 0.0032759752918452012 -0.65407554465688111  0.069124135183106089 0.75343275087525252 -0.65388144479235466
+0.89630368317606401 -0.22706071813732454 -0.79643145005237248  -0.30395970967361979 0.52285425410030539 -0.79638679287412972
+1.5036963168239366 -0.22706071813732454 -0.79643145005237237  0.30395970967362079 0.52285425410030473 -0.79638679287412983
+1.1310037179992749 0.0032759752918453122 -0.65407554465688122  -0.069124135183104382 0.75343275087525341 -0.65388144479235388
+1.3186983640546237 -0.48811498758743949 -0.95777186148081694  0.11873329660574333 0.2616156094127855 -0.95784115446597384
+1.461054269450115 -0.11542238876277822 -0.7274351680516471  0.26123864468751934 0.63469945426951124 -0.72726265769102472
+1.4618850124125609 -1.7077718614808168 0.11869836405462342  0.26161560941278728 -0.95784115446597351 0.11873329660574186
+1.8345776112372221 -1.4774351680516467 0.26105426945011473  0.63469945426951191 -0.72726265769102461 0.26123864468751806
+1.5308812944132866 -1.6651298141069957 -0.23033669342916982  0.33073974459589145 -0.91512008947987211 -0.23057849677494963
+1.530881294413287 -1.6651298141069955 0.23033669342916985  0.33073974459589006 -0.91512008947987245 0.2305784967749499
+1.8345776112372223 -1.4774351680516467 -0.26105426945011484  0.63469945426951324 -0.72726265769102416 -0.26123864468751634
+1.4618850124125611 -1.7077718614808168 -0.1186983640546234  0.26161560941278583 -0.95784115446597407 -0.11873329660574009
+1.9532759752918458 -1.4040755446568804 0.068996282000725453  0.75343275087525374 -0.65388144479235344 0.069124135183105562
+1.7229392818626761 -1.5464314500523721 -0.30369631682393577  0.52285425410030362 -0.7963867928741305 -0.30395970967362118
+1.7229392818626763 -1.5464314500523719 0.30369631682393572  0.5228542541003065 -0.79638679287412883 0.30395970967362029
+1.9532759752918458 -1.4040755446568807 -0.068996282000725426  0.75343275087525352 -0.65388144479235377 -0.069124135183104743
+1.9274351680516473 -0.48894573054988527 0.63457761123722167  0.72726265769102405 0.2612386446875189 0.63469945426951224
+2.1577718614808168 -0.63130163594537647 0.26188501241256051  0.95784115446597407 0.11873329660574208 0.26161560941278489
+1.0813016359453766 -1.0118850124125607 -0.95777186148081683  -0.11873329660574054 -0.26161560941278716 -0.95784115446597373
+0.93894573054988506 -1.3845776112372217 -0.72743516805164732  -0.26123864468751773 -0.63469945426951191 -0.72726265769102483
+0.88525794997176432 0.081090696230260814 -0.45671715648324701  -0.29815500373095694 0.84204499011931366 -0.44951510360071101
+0.28487018589300406 -0.98033669342916963 -0.33088129441328618  -0.91512008947987944 -0.23057849677495143 -0.33073974459586986
+0.54592445534311906 -0.6810037179992745 0.75327597529184542  -0.65388144479235311 0.069124135183104313 0.75343275087525419
+0.40356854994762748 -1.0536963168239357 0.52293928186267569  -0.79638679287412972 -0.30395970967362018 0.52285425410030517
+0.91382708291667858 0.12638371280443889 -0.38483791504434905  -0.29603762580284126 0.87653155169613006 -0.37954467851649781
+0.9094202856258099 0.11959234854368263 -0.39708487175152668  -0.29603762580284099 0.87653155169612995 -0.37954467851649804
+0.969663306570831 -1.0808812944132864 0.91512981410699601  -0.23057849677494785 -0.33073974459589195 0.91512008947987233
+1.4303366934291701 -1.0808812944132864 0.91512981410699579  0.23057849677494982 -0.33073974459589167 0.91512008947987189
+1.9964314500523728 -1.0536963168239355 0.52293928186267535  0.79638679287413006 -0.30395970967362124 0.52285425410030406
+1.8540755446568815 -0.68100371799927473 0.75327597529184498  0.65388144479235344 0.069124135183104507 0.75343275087525385
+1.8540755446568815 -0.81899628200072538 0.75327597529184498  0.65388144479235388 -0.069124135183104785 0.75343275087525341
+1.9964314500523725 -0.44630368317606428 0.52293928186267558  0.79638679287413028 0.30395970967361963 0.52285425410030462
+1.9532759752918452 -0.095924455343118997 -0.068996282000725481  0.75343275087525419 0.65388144479235299 -0.069124135183104882
+1.7229392818626761 0.046431450052372147 0.30369631682393577  0.52285425410030628 0.79638679287412928 0.30395970967361957
+1.8345776112372223 -0.022564831948353237 0.26105426945011484  0.6346994542695108 0.72726265769102516 0.26123864468751951
+1.4618850124125611 0.20777186148081683 0.1186983640546234  0.26161560941278689 0.95784115446597351 0.11873329660574237
+0.69377314187723504 -0.22428489754399578 0.68341702461536258  -0.54199242061149078 0.50624478547212293 0.67079090123672747
+0.97351999728657068 0.22241808576487493 0.034988854233130445  -0.21668703966435238 0.97542959357555303 0.039797422259877605
+0.25697201819559901 -0.92432848622760766 0.28050566540029309  -0.94624082570117252 -0.1559258067694915 0.28339979280099437
+0.29401138453262826 -0.86471241548978539 -0.40567809407889899  -0.89961957659540737 -0.11104418275857356 -0.42231955541009525
+0.30362145533065937 -0.84916410602320314 -0.43023759412454321  -0.89961957659540792 -0.11104418275857478 -0.42231955541009381
+0.93241910595001631 0.15597288936521894 0.32585692434233732  -0.24890531892629236 0.91663390223888808 0.3127753690374443
+0.93208712065408506 0.15549608434201159 0.3269900786062353  -0.2489053189262907 0.91663390223888952 0.3127753690374413
+0.54592445534311906 -0.81899628200072527 0.75327597529184542  -0.65388144479235311 -0.069124135183104313 0.75343275087525419
+0.93894573054988539 -1.3845776112372221 0.7274351680516471  -0.26123864468751845 -0.63469945426951091 0.72726265769102538
+1.0813016359453769 -1.0118850124125609 0.95777186148081694  -0.118733296605741 -0.26161560941278728 0.95784115446597362
+1.9964314500523725 -0.44630368317606417 -0.52293928186267558  0.79638679287412983 0.30395970967361996 -0.52285425410030517
+1.8540755446568815 -0.81899628200072527 -0.75327597529184498  0.65388144479235399 -0.069124135183104743 -0.7534327508752533
+1.461054269450115 -1.3845776112372219 -0.72743516805164699  0.26123864468751895 -0.63469945426951135 -0.72726265769102472
+1.3186983640546237 -1.0118850124125607 -0.95777186148081683  0.11873329660574095 -0.2616156094127855 -0.95784115446597407
+1.4303366934291697 -1.0808812944132864 -0.9151298141069959  0.23057849677494993 -0.33073974459589245 -0.91512008947987156
+0.96966330657083044 -1.0808812944132864 -0.9151298141069959  -0.23057849677494854 -0.3307397445958925 -0.91512008947987189
+0.40356854994762748 -1.0536963168239357 -0.52293928186267569  -0.79638679287413106 -0.30395970967361924 -0.52285425410030384
+0.54592445534311895 -0.68100371799927473 -0.75327597529184542  -0.65388144479235355 0.069124135183104618 -0.75343275087525374
+0.54592445534311906 -0.8189962820007255 -0.75327597529184531  -0.65388144479235311 -0.06912413518310434 -0.75343275087525408
+0.93339586248116191 0.15759811547986138 0.32187126056253412  -0.24890531892629342 0.9166339022388893 0.3127753690374398
+0.77138586605477633 -0.1010889929861338 -0.62717432611494872  -0.41977894187289966 0.6609388446318949 -0.62204942216573489
+0.79564186567445128 -0.06209942187768587 -0.60211592452938889  -0.41977894187289211 0.66093884463190167 -0.62204942216573267
+0.9324191059500162 0.15597288936521903 -0.32585692434233743  -0.24890531892628645 0.91663390223888519 -0.31277536903745745
+0.93208712065408494 0.15549608434201162 -0.32699007860623541  -0.24890531892628462 0.91663390223888308 -0.31277536903746511
+1.5308812944132866 0.16512981410699579 0.23033669342916971  0.33073974459589195 0.91512008947987211 0.2305784967749489
+1.5308812944132868 0.16512981410699579 -0.23033669342916979  0.33073974459589117 0.91512008947987222 -0.23057849677494904
+1.4618850124125609 0.20777186148081683 -0.11869836405462342  0.26161560941278672 0.95784115446597362 -0.1187332966057424
+1.8345776112372223 -0.022564831948353237 -0.2610542694501149  0.6346994542695108 0.72726265769102516 -0.26123864468751956
+2.1577718614808168 -0.63130163594537669 -0.26188501241256057  0.9578411544659734 0.11873329660574439 -0.26161560941278617
+1.9274351680516475 -0.48894573054988527 -0.63457761123722156  0.72726265769102494 0.26123864468751845 -0.63469945426951124
+2.1577718614808168 -0.86869836405462331 0.26188501241256057  0.95784115446597395 -0.11873329660574229 0.26161560941278522
+1.9274351680516475 -1.0110542694501148 0.63457761123722156  0.72726265769102483 -0.26123864468751862 0.63469945426951135
+1.3186983640546237 -1.0118850124125609 0.95777186148081683  0.11873329660574097 -0.26161560941278544 0.95784115446597407
+1.4610542694501154 -1.3845776112372215 0.72743516805164721  0.26123864468751906 -0.63469945426951135 0.72726265769102472
+1.5036963168239363 -1.2729392818626759 0.79643145005237215  0.30395970967362046 -0.52285425410030517 0.79638679287412972
+1.1310037179992749 -1.5032759752918454 0.65407554465688122  -0.069124135183103216 -0.75343275087525341 0.65388144479235411
+0.56542238876277806 -1.4774351680516471 0.2610542694501149  -0.63469945426951235 -0.72726265769102405 0.26123864468751862
+0.93811498758743972 -1.7077718614808171 0.11869836405462342  -0.26161560941278633 -0.9578411544659734 0.11873329660574466
+0.86911870558671378 -1.6651298141069959 0.23033669342916985  -0.33073974459589256 -0.91512008947987211 0.2305784967749481
+0.86911870558671411 -1.6651298141069959 -0.23033669342916996  -0.33073974459589112 -0.91512008947987222 -0.23057849677494971
+0.89630368317606424 -1.2729392818626755 -0.79643145005237259  -0.30395970967362035 -0.52285425410030406 -0.7963867928741305
+1.2689962820007255 -1.5032759752918454 -0.65407554465688122  0.069124135183103272 -0.75343275087525341 -0.65388144479235399
+1.1310037179992742 -1.5032759752918454 -0.65407554465688122  -0.069124135183102828 -0.7534327508752543 -0.65388144479235299
+1.5036963168239361 -1.2729392818626759 -0.79643145005237226  0.30395970967362002 -0.52285425410030251 -0.79638679287413161
+1.8540755446568815 -0.68100371799927462 -0.75327597529184498  0.65388144479235388 0.069124135183104771 -0.75343275087525341
+1.9964314500523725 -1.0536963168239355 -0.52293928186267535  0.7963867928741305 -0.30395970967362024 -0.52285425410030406
+1.9274351680516473 -1.0110542694501146 -0.63457761123722178  0.72726265769102438 -0.26123864468751906 -0.63469945426951169
+2.1577718614808168 -0.86869836405462353 -0.26188501241256051  0.95784115446597418 -0.11873329660574188 -0.26161560941278472
+2.1151298141069961 -0.51966330657083049 0.33088129441328584  0.91512008947987278 0.23057849677494929 0.33073974459588984
+2.1151298141069961 -0.98033669342916963 0.33088129441328579  0.91512008947987278 -0.23057849677494949 0.33073974459588962
+2.1151298141069961 -0.98033669342916974 -0.33088129441328584  0.91512008947987245 -0.23057849677494999 -0.33073974459589017
+2.1151298141069956 -0.51966330657083037 -0.3308812944132859  0.91512008947987389 0.23057849677494746 -0.33073974459588784
+1.7229392818626761 0.046431450052372147 -0.30369631682393572  0.52285425410030584 0.79638679287412983 -0.30395970967361896
+1.9532759752918456 -0.095924455343119219 0.068996282000725412  0.75343275087525408 0.65388144479235322 0.069124135183104798
+0.93811498758743939 -1.7077718614808171 -0.11869836405462345  -0.26161560941278678 -0.95784115446597351 -0.11873329660574286
+0.56542238876277817 -1.4774351680516471 -0.26105426945011495  -0.63469945426951146 -0.72726265769102461 -0.26123864468751906
+0.93339586248116191 0.15759811547986141 -0.32187126056253423  -0.24890531892696513 0.91663390223878349 -0.31277536903721526
+0.47256483194835297 -1.0110542694501148 -0.63457761123722201  -0.72726265769102472 -0.26123864468751967 -0.63469945426951113
+0.67706071813732449 -1.5464314500523724 -0.30369631682393589  -0.52285425410030395 -0.79638679287413083 -0.30395970967361974
+0.44672402470815431 -1.4040755446568807 0.068996282000725453  -0.75343275087525341 -0.65388144479235355 0.069124135183106797
+0.47256483194835297 -1.0110542694501148 0.63457761123722212  -0.72726265769102472 -0.26123864468751851 0.63469945426951158
+0.24336599009814619 -0.94602936533555493 -0.21094260961626565  -0.95495693252433878 -0.19745303394970987 -0.22151649240578075
+0.44672402470815431 -1.4040755446568807 -0.068996282000725495  -0.75343275087525352 -0.65388144479235355 -0.069124135183106797
+0.67706071813732438 -1.5464314500523724 0.30369631682393589  -0.52285425410030462 -0.79638679287412983 0.30395970967362074
+1.2689962820007261 -1.5032759752918452 0.65407554465688111  0.069124135183104188 -0.7534327508752543 0.65388144479235299
+0.89630368317606457 -1.2729392818626759 0.79643145005237248  -0.30395970967361879 -0.52285425410030428 0.79638679287413083
+0.87006466098054647 0.056547496445093395 0.48863305375424759  -0.31909818315151856 0.81512028618526478 0.48348243872828733
+0.86048662890264316 0.042111562758920092 0.50664961250726259  -0.31909818315149469 0.81512028618527133 0.48348243872829194
+0.28487018589300406 -0.98033669342916951 0.33088129441328606  -0.91512008947987256 -0.2305784967749484 0.33073974459589089
+0.79934060742300872 -0.055862651692236032 -0.59790562905682221  -0.3776341406276017 0.67726348918452928 -0.6314321990919135
+1.813538519485719 -0.28952821920598959 0.64151089172333209  0.61382359089386351 0.46011525660259994 0.6414939983380098
+1.6215187719833619 -0.28136426493733929 0.77633914798103421  0.4217740975073348 0.46868822204941907 0.77616877106981552
+1.3378197789939481 0.17483674698373319 0.35451755943338797  0.13818785834076916 0.92488389215866984 0.35425118465944683
+1.3392917641443463 0.065235707638635065 0.56212858442930091  0.13924301275047288 0.81541586445899028 0.56187930322158097
+0.36998650939197825 -0.74269333684247574 -0.5567855194421365  -0.83494479465357796 0.020957685934287547 -0.54993450999293936
+0.86456827261077818 -0.05598545619885309 0.63704738383668813  -0.33571718293160885 0.69398814937561948 0.63692575831934095
+0.73563503381027773 -0.6800696519575018 0.88287877117884839  -0.46476863555606884 0.069884317336659077 0.88266998226615767
+0.85340002742402565 -0.47750422818221461 0.89756031181852258  -0.34672764240957121 0.27221405186828174 0.89759648615318943
+1.4413678794555167 -0.81788943095144961 0.9680560789191065  0.24117598392814868 -0.068303541004111096 0.96807477555330868
+1.3212211638374884 -0.6167959923265609 0.98364735641266221  0.12142771508337506 0.13297103911781064 0.98365340072891549
+0.9586321205444841 -0.81788943095144961 -0.96805607891910683  -0.24117598392814762 -0.068303541004109888 -0.96807477555330901
+1.0787788361625117 -0.6167959923265609 -0.98364735641266243  -0.12142771508337302 0.13297103911781002 -0.98365340072891583
+0.31682936237190812 -0.8280363774210906 0.46105412139556601  -0.87829625280902435 -0.071121388581576156 0.47279746233229181
+0.77848122801663844 -0.28136426493733918 -0.77633914798103432  -0.42177409750733558 0.46868822204941951 -0.77616877106981486
+1.0621802210060525 0.17483674698373319 -0.35451755943338797  -0.13818785834076996 0.92488389215866984 -0.35425118465944661
+1.0607082358556541 0.065235707638635065 -0.56212858442930091  -0.13924301275047191 0.81541586445899095 -0.56187930322158008
+1.7283612117454608 -0.066531132471783216 -0.50369111272938416  0.52841879760671218 0.68370790823052074 -0.50330613999724105
+1.535431727389222 -0.055985456198853201 -0.63704738383668802  0.33571718293160874 0.69398814937561726 -0.63692575831934339
+1.6643649661897226 -0.68006965195750169 -0.88287877117884805  0.46476863555606884 0.069884317336658813 -0.88266998226615767
+1.5465999725759745 -0.47750422818221466 -0.89756031181852236  0.34672764240957321 0.27221405186828163 -0.89759648615318877
+1.269930348042499 -1.6328787711788482 0.46436496618972256  0.069884317336661395 -0.88266998226615756 0.46476863555606868
+1.472495771817786 -1.6475603118185222 0.3465999725759743  0.27221405186828207 -0.89759648615318977 0.34672764240957044
+1.1321105690485505 -1.7180560789191066 -0.24136787945551619  -0.06830354100410907 -0.96807477555330834 -0.24117598392815071
+1.3332040076734395 -1.7336473564126622 -0.12122116383748834  0.13297103911781141 -0.98365340072891572 -0.12142771508337305
+1.6604717807940104 -1.3915108917233319 -0.61353851948571902  0.46011525660260238 -0.64149399833800946 -0.61382359089386218
+1.6686357350626613 -1.5263391479810342 -0.42151877198336174  0.46868822204941957 -0.77616877106981552 -0.42177409750733424
+2.1248367469837333 -1.1045175594333876 -0.13781977899394773  0.92488389215866973 -0.35425118465944666 -0.13818785834077044
+2.0152357076386354 -1.3121285844293 -0.13929176414434613  0.81541586445899117 -0.56187930322157997 -0.1392430127504713
+1.8834688675282174 -1.2536911127293839 0.52836121174546025  0.68370790823052174 -0.50330613999723939 0.5284187976067124
+1.8940145438011475 -1.3870473838366877 0.33543172738922156  0.69398814937561737 -0.63692575831934373 0.33571718293160802
+1.8415108917233325 -0.13646148051428153 0.46047178079401069  0.64149399833800991 0.61382359089386218 0.46011525660260166
+1.9763391479810344 -0.32848122801663865 0.46863573506266099  0.77616877106981563 0.42177409750733585 0.4686882220494179
+0.73563503381027773 -0.81993034804249798 -0.88287877117884839  -0.46476863555606895 -0.069884317336658938 -0.88266998226615767
+0.85340002742402565 -1.0224957718177852 -0.89756031181852258  -0.34672764240957199 -0.27221405186828146 -0.89759648615318932
+0.39895802436542988 -0.69687753315555612 -0.5957410107715313  -0.7996715905934344 0.02252867497836334 -0.60001483815109602
+0.40036321981550371 -0.69465247190942381 -0.5975302451883705  -0.79967159059346238 0.022528674978334662 -0.60001483815105972
+0.84548244056661248 -0.88781977899394804 0.9248367469837333  -0.35425118465944566 -0.13818785834076999 0.92488389215867017
+0.6378714155706996 -0.88929176414434641 0.8152357076386354  -0.56187930322157897 -0.13924301275047021 0.81541586445899217
+0.74055958467102845 -0.15027494754537968 -0.65399889841309089  -0.476239267037872 0.60557549052406878 -0.63755351603435151
+0.84685829520082545 0.019286849148286479 -0.53075413092765555  -0.36351224121617526 0.75900083470875201 -0.54016347840020695
+0.9586321205444841 -0.6821105690485505 0.96805607891910683  -0.24117598392814787 0.068303541004110624 0.9680747755533089
+1.0787788361625121 -0.88320400767343932 0.98364735641266243  -0.12142771508337306 -0.13297103911780989 0.98365340072891583
+1.7036911127293846 -1.2783612117454606 0.68346886752821678  0.5033061399972415 -0.52841879760671184 0.68370790823052063
+1.8370473838366883 -1.0854317273892216 0.69401454380114669  0.63692575831934417 -0.33571718293160874 0.69398814937561659
+1.5545175594333884 -0.61218022100605229 0.92483674698373297  0.35425118465944661 0.13818785834076955 0.92488389215866984
+1.7621285844293011 -0.61070823585565404 0.81523570763863507  0.56187930322158131 0.13924301275047232 0.81541586445899017
+2.1248367469837333 -0.39548244056661236 0.13781977899394779  0.92488389215867051 0.35425118465944377 0.13818785834077252
+2.0152357076386354 -0.18787141557069942 0.13929176414434624  0.81541586445899117 0.5618793032215802 0.13924301275047049
+1.6604717807940104 -0.10848910827666802 0.61353851948571902  0.46011525660260155 0.64149399833800957 0.61382359089386263
+1.6686357350626613 0.026339147981034206 0.42151877198336174  0.46868822204941946 0.77616877106981474 0.42177409750733585
+1.2678894309514497 0.21805607891910661 -0.24136787945551616  0.06830354100410925 0.96807477555330879 -0.24117598392814882
+1.0667959923265611 0.23364735641266243 -0.12122116383748828  -0.13297103911780939 0.98365340072891605 -0.12142771508337256
+1.130069651957502 0.13287877117884817 0.46436496618972245  -0.069884317336658841 0.88266998226615756 0.46476863555606901
+0.92750422818221478 0.14756031181852258 0.34659997257597436  -0.27221405186827224 0.89759648615319176 0.34672764240957293
+0.8348259841132093 -6.1457978060811826e-19 -0.5497573450331017  -0.3635122412161757 0.75900083470875102 -0.5401634784002084
+0.27399725512977041 -0.89741802080743249 -0.34558774394436126  -0.91762341400860226 -0.15318437572866117 -0.36674489375561553
+0.6963088872706158 -0.22163878825453964 0.68346886752821701  -0.50330613999723917 0.52841879760671318 0.68370790823052141
+0.27461092234606044 -0.89644305776905853 -0.34753041451074085  -0.91762341400861724 -0.15318437572861182 -0.36674489375559871
+0.58646148051428126 -1.2104717807940111 0.64151089172333209  -0.61382359089386329 -0.46011525660260089 0.64149399833800924
+0.77848122801663866 -1.2186357350626613 0.77633914798103421  -0.42177409750733541 -0.4686882220494189 0.7761687710698153
+1.7036911127293846 -0.22163878825453975 -0.68346886752821689  0.50330613999723972 0.52841879760671195 -0.68370790823052185
+1.8370473838366883 -0.41456827261077839 -0.69401454380114669  0.63692575831934395 0.33571718293160824 -0.69398814937561704
+1.813538519485719 -1.2104717807940109 -0.64151089172333209  0.61382359089386318 -0.46011525660260083 -0.64149399833800946
+1.6215187719833617 -1.2186357350626611 -0.77633914798103409  0.42177409750733474 -0.46868822204941712 -0.77616877106981674
+1.4413678794555165 -0.6821105690485505 -0.96805607891910661  0.24117598392814851 0.068303541004111096 -0.96807477555330879
+1.3212211638374884 -0.88320400767343932 -0.98364735641266221  0.12142771508337399 -0.13297103911781122 -0.98365340072891561
+0.69630888727061557 -1.2783612117454601 -0.68346886752821723  -0.50330613999723961 -0.52841879760671184 -0.68370790823052208
+0.56295261616331194 -1.085431727389222 -0.69401454380114702  -0.63692575831934406 -0.33571718293160863 -0.6939881493756167
+0.84548244056661226 -0.61218022100605229 -0.92483674698373319  -0.35425118465944577 0.13818785834076949 -0.92488389215867028
+0.63787141557069948 -0.61070823585565404 -0.81523570763863551  -0.56187930322158008 0.1392430127504711 -0.81541586445899106
+0.27219661039719123 -0.89987434907152986 -0.34005641981910134  -0.91762341400861669 -0.15318437572860499 -0.36674489375560293
+0.23294949527472619 -0.96194916611186088 -0.13775142693846473  -0.95825269159637794 -0.23889893330366177 -0.15709576287942825
+0.7956418656744515 -0.062099421877685829 0.60211592452938856  -0.41977894187290332 0.66093884463189934 0.62204942216572778
+0.77138586605477644 -0.10108899298613383 0.62717432611494861  -0.41977894187289733 0.66093884463190189 0.62204942216572912
+1.1321105690485505 0.21805607891910661 0.24136787945551616  -0.068303541004109528 0.96807477555330901 0.24117598392814815
+1.3332040076734395 0.23364735641266221 0.12122116383748827  0.13297103911781022 0.98365340072891572 0.12142771508337367
+1.2699303480424986 0.13287877117884817 -0.46436496618972245  0.069884317336659327 0.88266998226615756 -0.46476863555606901
+1.4724957718177856 0.14756031181852225 -0.34659997257597425  0.27221405186828102 0.89759648615318954 -0.34672764240957166
+2.0828787711788483 -0.28563503381027772 -0.069930348042498203  0.88266998226615612 0.4647686355560719 -0.069884317336658563
+2.0975603118185226 -0.40340002742402592 -0.27249577181778528  0.89759648615318943 0.34672764240957138 -0.27221405186828163
+2.0828787711788483 -1.214364966189722 0.069930348042498189  0.882669982266157 -0.46476863555607045 0.069884317336658466
+2.0975603118185226 -1.0965999725759743 0.27249577181778517  0.89759648615318977 -0.34672764240957166 0.27221405186828074
+1.6643649661897226 -0.8199303480424982 0.88287877117884805  0.46476863555606768 -0.069884317336659424 0.88266998226615823
+1.5465999725759745 -1.0224957718177856 0.89756031181852236  0.34672764240957343 -0.27221405186828251 0.89759648615318843
+1.7283612117454608 -1.4334688675282168 0.50369111272938427  0.52841879760671107 -0.6837079082305203 0.50330613999724272
+1.5354317273892222 -1.4440145438011467 0.63704738383668802  0.33571718293160768 -0.69398814937561715 0.63692575831934406
+0.73952821920598932 -1.3915108917233319 0.61353851948571902  -0.46011525660260205 -0.64149399833800935 0.6138235908938624
+0.73136426493733908 -1.5263391479810342 0.42151877198336185  -0.46868822204941846 -0.77616877106981585 0.42177409750733491
+1.2678894309514497 -1.7180560789191066 0.24136787945551616  0.068303541004109777 -0.96807477555330868 0.2411759839281494
+1.0667959923265609 -1.7336473564126624 0.12122116383748836  -0.13297103911781086 -0.98365340072891561 0.12142771508337438
+0.6716387882545396 -1.4334688675282168 -0.50369111272938449  -0.52841879760671095 -0.68370790823052274 -0.50330613999723961
+0.86456827261077818 -1.4440145438011469 -0.63704738383668824  -0.33571718293160935 -0.69398814937561693 -0.6369257583193435
+1.3378197789939481 -1.6748367469837331 -0.35451755943338797  0.13818785834076763 -0.92488389215866973 -0.35425118465944772
+1.3392917641443463 -1.5652357076386352 -0.56212858442930091  0.13924301275047099 -0.81541586445899183 -0.56187930322157909
+1.5545175594333882 -0.88781977899394793 -0.92483674698373297  0.35425118465944549 -0.13818785834077002 -0.92488389215867028
+1.7621285844293011 -0.8892917641443463 -0.81523570763863507  0.56187930322158108 -0.13924301275047279 -0.81541586445899028
+1.8415108917233325 -1.3635385194857186 -0.46047178079401058  0.64149399833801046 -0.61382359089386207 -0.46011525660260105
+1.9763391479810344 -1.1715187719833615 -0.46863573506266087  0.77616877106981574 -0.42177409750733497 -0.46868822204941857
+2.1680560789191068 -0.50863212054448415 -0.067889430951449614  0.9680747755533089 0.24117598392814829 -0.068303541004110124
+2.1836473564126626 -0.62877883616251184 0.13320400767343912  0.98365340072891605 0.12142771508337218 0.13297103911780914
+2.1680560789191068 -0.99136787945551619 0.067889430951449573  0.96807477555330879 -0.2411759839281484 0.068303541004110568
+2.1836473564126626 -0.87122116383748793 -0.13320400767343907  0.98365340072891616 -0.12142771508337166 -0.13297103911780908
+1.8834688675282174 -0.24630888727061584 -0.52836121174546025  0.6837079082305223 0.50330613999724005 -0.52841879760671107
+1.8940145438011473 -0.1129526161633122 -0.33543172738922167  0.69398814937561726 0.63692575831934362 -0.33571718293160829
+1.130069651957502 -1.6328787711788482 -0.46436496618972267  -0.069884317336660201 -0.88266998226615734 -0.4647686355560694
+0.92750422818221478 -1.6475603118185225 -0.34659997257597441  -0.27221405186828429 -0.89759648615318854 -0.34672764240957188
+0.31712122882115168 -1.2143649661897222 -0.06993034804249823  -0.88266998226615745 -0.4647686355560694 -0.069884317336659077
+0.30243968818147737 -1.0965999725759743 -0.27249577181778545  -0.89759648615318932 -0.34672764240957199 -0.27221405186828124
+0.51653113247178317 -1.2536911127293844 -0.52836121174546036  -0.68370790823052185 -0.50330613999724083 -0.52841879760671084
+0.50598545619885282 -1.3870473838366881 -0.33543172738922172  -0.69398814937561759 -0.6369257583193435 -0.33571718293160802
+0.55848910827666798 -1.3635385194857188 0.46047178079401091  -0.64149399833800957 -0.61382359089386285 0.46011525660260122
+0.42366085201896597 -1.1715187719833617 0.46863573506266121  -0.77616877106981463 -0.42177409750733569 0.46868822204941984
+0.27516325301626676 -1.104517559433388 0.13781977899394782  -0.92488389215866995 -0.35425118465944622 0.1381878583407698
+0.38476429236136467 -1.3121285844293005 0.13929176414434624  -0.81541586445899006 -0.56187930322158131 0.13924301275047321
+1.0621802210060525 -1.6748367469837331 0.35451755943338797  -0.13818785834076944 -0.92488389215866995 0.35425118465944638
+1.0607082358556541 -1.5652357076386352 0.56212858442930091  -0.13924301275047085 -0.81541586445899195 0.56187930322157909
+0.75366980899531777 -0.12957223153317302 -0.64334361719230837  -0.43611560071017613 0.62405012717396391 -0.64835532047740763
+0.97237322050691288 0.22053761901938193 0.067701629511043915  -0.24109601889304647 0.96718604322533441 0.080149032832876388
+0.23194392108089312 -0.99136787945551608 -0.067889430951449628  -0.9680747755533089 -0.24117598392814812 -0.068303541004111068
+0.23294949527472616 -0.96194916611186088 0.13775142693846476  -0.95825269159637749 -0.23889893330366066 0.15709576287943319
+1.2616533189164061 -0.15498399644609528 0.80134563315795981  0.062410317894398951 0.59583045652862776 0.80068159669946648
+1.4133191789074442 -0.29662405620460919 0.86541618975952417  0.21403145679805605 0.4530882925139984 0.86539097215515914
+1.441367879455516 -0.6821105690485505 0.96805607891910661  0.24117598392814843 0.06830354100411086 0.96807477555330879
+1.5465999725759745 -0.47750422818221472 0.89756031181852247  0.34672764240957199 0.27221405186828224 0.8975964861531891
+1.1383466810835945 -0.15498399644609528 0.8013456331579597  -0.062410317894398472 0.59583045652862832 0.80068159669946615
+1.3318385030170197 -0.083304877297165847 0.73357768674250456  0.13227871496285457 0.66711974931205487 0.73311225719230544
+1.7036911127293843 -0.22163878825453986 0.68346886752821701  0.50330613999724005 0.5284187976067114 0.68370790823052208
+1.535431727389222 -0.05598545619885309 0.63704738383668813  0.33571718293160813 0.69398814937561681 0.63692575831934428
+1.1002428344740192 -0.25474116197207619 0.86299895207436539  -0.10098201560182286 0.49484844092680497 0.86309191459386503
+1.0681614969829809 -0.083304877297165625 0.73357768674250445  -0.13227871496285332 0.66711974931205542 0.73311225719230522
+1.2699303480424986 0.13287877117884817 0.46436496618972251  0.069884317336659757 0.88266998226615756 0.4647686355560689
+1.0607082358556541 0.065235707638635065 0.56212858442930091  -0.13924301275047329 0.8154158644589905 0.56187930322158053
+1.2000000000000006 -0.31639448088848182 0.90110279868394094  9.157758738413012e-16 0.43243812303240742 0.90166361230128855
+0.98668082109255706 -0.29662405620460913 0.86541618975952428  -0.21403145679805541 0.45308829251399813 0.86539097215515937
+0.96740524816676143 0.21237493457549977 -0.13494008765512311  -0.21828391900495059 0.96858479771762296 -0.11914537479126736
+0.77848122801663822 -0.28136426493733913 0.77633914798103421  -0.42177409750733569 0.46868822204941801 0.77616877106981574
+1.2997571655259812 -0.25474116197207625 0.86299895207436539  0.10098201560182227 0.49484844092680502 0.86309191459386503
+1.2000000000000002 -0.42846255922162907 0.94689686564994791  0 0.32080957755114498 0.94714371399036168
+0.84548244056661226 -0.61218022100605229 0.92483674698373319  -0.35425118465944555 0.13818785834076991 0.92488389215867028
+1.0787788361625121 -0.61679599232656102 0.98364735641266243  -0.12142771508337273 0.13297103911781 0.98365340072891594
+1.1002428344740194 -0.25474116197207625 -0.86299895207436539  -0.10098201560182141 0.49484844092680558 -0.86309191459386492
+1.2000000000000002 -0.42846255922162907 -0.94689686564994791  0 0.32080957755114492 -0.94714371399036157
+1.5545175594333882 -0.61218022100605218 -0.92483674698373297  0.35425118465944533 0.13818785834077094 -0.92488389215867017
+1.3212211638374884 -0.61679599232656102 -0.98364735641266243  0.12142771508337498 0.13297103911781041 -0.98365340072891561
+1.1383466810835945 -0.15498399644609517 -0.80134563315795992  -0.06241031789439843 0.59583045652862821 -0.80068159669946615
+0.98668082109255639 -0.29662405620460919 -0.86541618975952417  -0.21403145679805724 0.45308829251399907 -0.86539097215515848
+0.9586321205444841 -0.6821105690485505 -0.96805607891910683  -0.24117598392814807 0.068303541004110485 -0.9680747755533089
+0.85340002742402576 -0.47750422818221466 -0.89756031181852258  -0.3467276424095721 0.27221405186828296 -0.89759648615318877
+1.2616533189164061 -0.15498399644609495 -0.80134563315795981  0.062410317894398756 0.59583045652862843 -0.80068159669946604
+1.0681614969829805 -0.083304877297165847 -0.73357768674250456  -0.13227871496285418 0.66711974931205509 -0.73311225719230522
+0.69630888727061568 -0.22163878825453975 -0.68346886752821712  -0.5033061399972365 0.52841879760671595 -0.68370790823052119
+0.86456827261077818 -0.055985456198852979 -0.63704738383668824  -0.33571718293160824 0.69398814937561681 -0.63692575831934406
+1.2997571655259814 -0.25474116197207619 -0.86299895207436528  0.10098201560182249 0.49484844092680558 -0.8630919145938647
+1.3318385030170203 -0.083304877297165625 -0.73357768674250434  0.13227871496285412 0.6671197493120552 -0.73311225719230522
+1.130069651957502 0.13287877117884817 -0.46436496618972251  -0.069884317336659202 0.88266998226615734 -0.46476863555606962
+1.3392917641443458 0.065235707638635065 -0.56212858442930091  0.13924301275047374 0.81541586445899017 -0.56187930322158108
+1.2 -0.31639448088848182 -0.90110279868394094  -1.9190373885465895e-16 0.43243812303240803 -0.90166361230128833
+1.4133191789074437 -0.29662405620460919 -0.86541618975952417  0.21403145679805624 0.4530882925139984 -0.86539097215515903
+1.660471780794011 -0.10848910827666802 -0.61353851948571891  0.46011525660260161 0.64149399833800957 -0.61382359089386251
+1.6215187719833619 -0.28136426493733918 -0.77633914798103409  0.42177409750733585 0.46868822204941907 -0.77616877106981497
+1.6336055191115184 -1.6511027986839406 1.2262216765384848e-18  0.43243812303240881 -0.901663612301288 0
+1.6533759437953914 -1.6154161897595238 0.21331917890744345  0.45308829251399907 -0.86539097215515859 0.21403145679805674
+1.8415108917233329 -1.3635385194857184 0.46047178079401052  0.64149399833801035 -0.6138235908938614 0.46011525660260194
+1.6686357350626613 -1.5263391479810342 0.42151877198336157  0.46868822204941846 -0.77616877106981552 0.42177409750733541
+1.6952588380279243 -1.6129989520743651 -0.099757165525981017  0.49484844092680391 -0.86309191459386592 -0.10098201560182096
+1.5215374407783711 -1.6968968656499479 1.2287154012371122e-18  0.32080957755114675 -0.94714371399036101 0
+1.3378197789939481 -1.6748367469837331 0.35451755943338803  0.13818785834076741 -0.92488389215866973 0.35425118465944772
+1.3332040076734395 -1.7336473564126622 0.12122116383748834  0.13297103911780994 -0.98365340072891549 0.12142771508337556
+1.7950160035539056 -1.5513456331579594 -0.061653318916405561  0.5958304565286302 -0.80068159669946459 -0.062410317894398229
+1.6533759437953917 -1.6154161897595238 -0.21331917890744354  0.45308829251399879 -0.8653909721551587 -0.2140314567980571
+1.2678894309514499 -1.7180560789191066 -0.24136787945551624  0.068303541004109722 -0.96807477555330856 -0.24117598392814962
+1.4724957718177856 -1.6475603118185225 -0.34659997257597425  0.27221405186828235 -0.89759648615318899 -0.34672764240957232
+1.7950160035539053 -1.5513456331579594 0.06165331891640554  0.59583045652862943 -0.80068159669946526 0.062410317894399124
+1.8666951227028346 -1.4835776867425041 -0.13183850301701966  0.66711974931205498 -0.73311225719230544 -0.13227871496285429
+1.7283612117454605 -1.433468867528217 -0.50369111272938405  0.5284187976067114 -0.68370790823052219 -0.50330613999723994
+1.8940145438011475 -1.3870473838366877 -0.33543172738922156  0.69398814937561792 -0.63692575831934295 -0.33571718293160829
+1.6952588380279243 -1.6129989520743651 0.099757165525981017  0.49484844092680469 -0.86309191459386547 0.10098201560182077
+1.8666951227028352 -1.4835776867425037 0.13183850301701966  0.66711974931205487 -0.73311225719230544 0.13227871496285468
+2.0828787711788483 -1.214364966189722 -0.069930348042498189  0.88266998226615656 -0.4647686355560709 -0.069884317336658744
+2.0152357076386354 -1.3121285844293002 0.13929176414434616  0.81541586445899006 -0.56187930322158142 0.13924301275047221
+2.00134563315796 -0.68834668108359442 0.5950160035539046  0.80068159669946726 0.06241031789439886 0.59583045652862676
+2.0654161897595245 -0.53668082109255666 0.45337594379539081  0.8653909721551587 0.21403145679805544 0.45308829251399957
+2.1680560789191068 -0.50863212054448403 0.067889430951449614  0.9680747755533089 0.2411759839281481 0.068303541004110152
+2.0975603118185226 -0.40340002742402592 0.27249577181778528  0.89759648615319054 0.34672764240957116 0.27221405186827852
+1.2 -1.1836055191115182 -0.90110279868394083  0 -0.43243812303240803 -0.90166361230128822
+0.98668082109255706 -1.203375943795391 -0.86541618975952428  -0.21403145679805596 -0.45308829251399907 -0.86539097215515881
+0.73952821920598932 -1.3915108917233323 -0.61353851948571902  -0.46011525660259944 -0.64149399833801035 -0.61382359089386329
+0.77848122801663822 -1.2186357350626609 -0.77633914798103421  -0.42177409750733474 -0.46868822204941779 -0.7761687710698163
+0.96947353031104488 0.21592607882051251 -0.10986054425367317  -0.21828391900495039 0.96858479771762307 -0.11914537479126724
+0.27461092234606033 -0.8964430577690583 0.34753041451074085  -0.91762341400861691 -0.15318437572861171 0.36674489375559954
+0.27516325301626687 -1.104517559433388 -0.13781977899394784  -0.92488389215867006 -0.35425118465944566 -0.13818785834077024
+0.27399725512977041 -0.89741802080743227 0.34558774394436154  -0.91762341400861713 -0.15318437572861274 0.3667448937555986
+0.27219661039719134 -0.89987434907152952 0.34005641981910195  -0.91762341400860037 -0.15318437572866428 0.36674489375561903
+0.46642231325749572 -0.8818385030170196 0.66669512270283449  -0.73311225719230444 -0.13227871496285387 0.66711974931205609
+0.51653113247178306 -1.2536911127293846 0.52836121174546025  -0.68370790823052296 -0.50330613999723894 0.52841879760671118
+0.56295261616331205 -1.085431727389222 0.69401454380114724  -0.6369257583193435 -0.33571718293160818 0.69398814937561748
+0.89270251295960135 0.092787072853812713 0.43974499787970978  -0.29815500373095838 0.84204499011931433 0.44951510360070884
+0.88525794997176432 0.0810906962302608 0.4567171564832469  -0.29815500373095821 0.84204499011931477 0.44951510360070823
+0.50468001700647158 -0.52828837108788052 0.68272481536695295  -0.70341121140136764 0.24317084427688976 0.66789266216101317
+0.50392422938731019 -0.52945918848859996 0.68235511400187066  -0.70341121140129059 0.24317084427684102 0.66789266216111209
+1.1002428344740194 -1.2452588380279237 0.86299895207436539  -0.10098201560182121 -0.49484844092680513 0.86309191459386514
+1.2000000000000002 -1.0715374407783713 0.94689686564994791  9.5216402656098607e-16 -0.32080957755114448 0.94714371399036179
+1.5545175594333882 -0.88781977899394793 0.92483674698373297  0.35425118465944611 -0.13818785834077024 0.92488389215866995
+1.3212211638374884 -0.88320400767343932 0.98364735641266221  0.12142771508337376 -0.13297103911781119 0.98365340072891561
+2.0629989520743655 -0.84975716552598102 0.4952588380279237  0.86309191459386403 -0.10098201560182107 0.49484844092680708
+1.9335776867425047 -0.88183850301701949 0.66669512270283382  0.73311225719230544 -0.13227871496285235 0.66711974931205531
+1.6643649661897226 -0.6800696519575018 0.88287877117884805  0.46476863555606757 0.06988431733665959 0.88266998226615834
+1.7621285844293006 -0.88929176414434641 0.81523570763863507  0.56187930322158097 -0.13924301275047249 0.81541586445899028
+2.00134563315796 -0.81165331891640569 0.5950160035539046  0.80068159669946659 -0.062410317894398798 0.59583045652862765
+1.9335776867425047 -0.61816149698298051 0.66669512270283404  0.73311225719230522 0.13227871496285562 0.66711974931205487
+1.8834688675282174 -0.24630888727061595 0.52836121174546036  0.68370790823052219 0.50330613999724005 0.52841879760671107
+1.8370473838366879 -0.41456827261077828 0.69401454380114713  0.63692575831934306 0.33571718293160768 0.69398814937561815
+1.7950160035539053 0.051345633157959369 -0.06165331891640554  0.59583045652862876 0.8006815966994657 -0.062410317894399089
+1.8666951227028343 -0.016422313257495658 0.13183850301701971  0.66711974931205553 0.73311225719230511 0.13227871496285307
+1.7283612117454608 -0.066531132471783327 0.50369111272938427  0.52841879760671207 0.68370790823052185 0.5033061399972395
+1.8940145438011475 -0.11295261616331242 0.33543172738922156  0.6939881493756167 0.63692575831934406 0.33571718293160885
+1.7950160035539053 0.051345633157959369 0.061653318916405554  0.59583045652862876 0.8006815966994657 0.062410317894399124
+1.6533759437953914 0.11541618975952384 0.21331917890744345  0.45308829251399868 0.86539097215515892 0.21403145679805605
+1.2678894309514495 0.21805607891910661 0.24136787945551616  0.068303541004108681 0.96807477555330868 0.24117598392814948
+1.4724957718177856 0.14756031181852225 0.34659997257597425  0.27221405186828113 0.89759648615318943 0.34672764240957193
+0.69377314187723493 -0.22428489754399594 -0.68341702461536258  -0.54199242061157393 0.50624478547216567 -0.6707909012366281
+0.59214384399202524 -0.38815954298187871 -0.70538094374692584  -0.60285708655996906 0.35990150486608763 -0.71206336795228531
+1.062180221006052 0.17483674698373297 0.35451755943338792  -0.13818785834077096 0.92488389215866973 0.35425118465944622
+1.0667959923265609 0.23364735641266243 0.12122116383748828  -0.13297103911781005 0.98365340072891583 0.12142771508337347
+0.58303192413334481 -0.40257317574481138 -0.70495163176324016  -0.60285708655996983 0.35990150486608918 -0.71206336795228375
+0.96740524816676143 0.21237493457549983 0.13494008765512311  -0.21828391900495075 0.96858479771762207 0.11914537479127493
+0.96947353031104511 0.21592607882051257 0.10986054425367309  -0.21828391900494698 0.96858479771762385 0.11914537479126754
+0.45467325858997609 -0.60749293870920384 0.65018159643527607  -0.75649082974192372 0.15162411868602205 0.63618531195640071
+0.82493587926686529 -0.015775204470230772 -0.56417193374348928  -0.38232288700972605 0.72686052081253227 -0.57052869634461212
+0.80588150441467521 -0.045732053728024212 -0.58956860097968999  -0.38232288700972528 0.72686052081253316 -0.57052869634461145
+0.75366980899531777 -0.12957223153317304 0.64334361719230837  -0.43611560071017774 0.62405012717396091 0.64835532047740918
+0.2274342072747835 -0.97114863140943242 -0.060907607905721785  -0.97824013612619698 -0.20232952054754855 -0.045923862934193996
+0.4546732585899762 -0.60749293870920396 -0.65018159643527595  -0.75649082974192772 0.15162411868601747 -0.63618531195639716
+0.46642231325749561 -0.61816149698298017 0.66669512270283449  -0.73311225719230466 0.13227871496285407 0.66711974931205575
+0.73563503381027773 -0.8199303480424982 0.88287877117884828  -0.46476863555606918 -0.069884317336659715 0.88266998226615745
+0.63787141557069948 -0.6107082358556537 0.81523570763863529  -0.56187930322157953 0.13924301275047068 0.81541586445899161
+1.1383466810835952 -1.3450160035539049 0.80134563315795981  -0.062410317894399513 -0.59583045652862798 0.80068159669946626
+0.98668082109255706 -1.203375943795391 0.86541618975952428  -0.2140314567980553 -0.45308829251399824 0.86539097215515937
+0.9586321205444841 -0.81788943095144961 0.96805607891910683  -0.24117598392814796 -0.068303541004110541 0.9680747755533089
+0.85340002742402632 -1.0224957718177858 0.89756031181852258  -0.34672764240957188 -0.27221405186828213 0.8975964861531891
+2.0629989520743655 -0.65024283447401887 -0.49525883802792381  0.86309191459386492 0.10098201560182167 -0.49484844092680547
+1.9335776867425047 -0.61816149698298029 -0.66669512270283404  0.73311225719230511 0.13227871496285412 -0.66711974931205542
+1.6643649661897224 -0.81993034804249787 -0.88287877117884817  0.46476863555606873 -0.069884317336658605 -0.88266998226615778
+1.7621285844293006 -0.6107082358556537 -0.81523570763863507  0.56187930322158097 0.13924301275047257 -0.81541586445899028
+1.2616533189164061 -1.3450160035539049 -0.80134563315795981  0.06241031789439986 -0.59583045652862832 -0.80068159669946593
+1.4133191789074437 -1.203375943795391 -0.86541618975952417  0.21403145679805768 -0.45308829251399863 -0.86539097215515859
+1.441367879455516 -0.8178894309514495 -0.96805607891910661  0.24117598392814854 -0.068303541004110901 -0.96807477555330879
+1.5465999725759745 -1.0224957718177854 -0.89756031181852247  0.34672764240957232 -0.27221405186828262 -0.89759648615318888
+1.2997571655259812 -1.2452588380279237 -0.86299895207436539  0.10098201560182229 -0.49484844092680536 -0.86309191459386492
+1.2 -1.0715374407783713 -0.94689686564994791  3.9056046362121732e-16 -0.32080957755114525 -0.94714371399036157
+0.84548244056661226 -0.88781977899394804 -0.92483674698373319  -0.35425118465944622 -0.13818785834076933 -0.92488389215866995
+1.0787788361625117 -0.88320400767343921 -0.98364735641266243  -0.12142771508337365 -0.13297103911780928 -0.98365340072891594
+0.33700104792563468 -0.84975716552598102 -0.49525883802792392  -0.86309191459386503 -0.1009820156018222 -0.49484844092680502
+0.46642231325749561 -0.88183850301701971 -0.66669512270283449  -0.73311225719230377 -0.13227871496285343 -0.66711974931205698
+0.73563503381027773 -0.6800696519575018 -0.88287877117884828  -0.46476863555606873 0.069884317336659216 -0.88266998226615778
+0.63787141557069948 -0.8892917641443463 -0.81523570763863529  -0.56187930322158008 -0.13924301275047099 -0.81541586445899117
+0.39865436684204025 -0.8116533189164058 -0.59501600355390494  -0.80068159669946659 -0.062410317894397348 -0.59583045652862776
+0.46642231325749572 -0.6181614969829804 -0.66669512270283449  -0.73311225719230511 0.13227871496285382 -0.66711974931205531
+0.66689476317101137 -0.26866388572512034 0.69462568959831961  -0.51449014281491467 0.4889427786964583 0.70443938852599297
+0.67087146858540314 -0.2624299701285262 0.69320320770179844  -0.51449014281491512 0.48894277869645764 0.70443938852599319
+0.50787822903713031 -0.52299793234814496 -0.68413337702600852  -0.67531637414764811 0.22527759233949179 -0.70228042917184841
+0.9741085412313033 0.22323020415808842 -0  -0.24034326043217777 0.97068796076021802 -3.944304526105059e-31
+0.91382708291667858 0.12638371280443894 0.38483791504434894  -0.29603762580284138 0.87653155169613073 0.37954467851649576
+0.9094202856258099 0.11959234854368264 0.39708487175152674  -0.29603762580284188 0.87653155169612995 0.37954467851649726
+0.86048662890264316 0.042111562758920099 -0.50664961250726259  -0.319098183151515 0.81512028618526744 -0.48348243872828511
+0.87006466098054647 0.056547496445093395 -0.48863305375424759  -0.31909818315151706 0.81512028618526466 -0.48348243872828828
+1.1321105690485507 0.21805607891910683 -0.24136787945551619  -0.068303541004108806 0.96807477555330901 -0.24117598392814826
+0.92750422818221478 0.14756031181852258 -0.34659997257597436  -0.27221405186827768 0.89759648615318965 -0.34672764240957404
+1.6952588380279245 0.11299895207436506 0.099757165525981045  0.4948484409268063 0.86309191459386436 0.1009820156018217
+1.5215374407783711 0.19689686564994791 -1.2287154012371122e-18  0.32080957755114636 0.94714371399036124 0
+1.3378197789939481 0.17483674698373297 -0.35451755943338792  0.13818785834076958 0.92488389215866995 -0.35425118465944638
+1.3332040076734395 0.23364735641266221 -0.12122116383748827  0.13297103911780989 0.98365340072891572 -0.12142771508337429
+1.6336055191115184 0.15110279868394072 -1.2262216765384848e-18  0.43243812303240725 0.90166361230128866 0
+1.6533759437953914 0.11541618975952384 -0.2133191789074434  0.45308829251399885 0.86539097215515892 -0.21403145679805616
+1.8415108917233325 -0.13646148051428131 -0.46047178079401069  0.6414939983380098 0.61382359089386185 -0.46011525660260222
+1.6686357350626615 0.026339147981033872 -0.42151877198336163  0.46868822204941846 0.77616877106981563 -0.42177409750733541
+2.1011027986839408 -0.74999999999999989 -0.43360551911151807  0.90166361230128833 0 -0.43243812303240775
+2.0654161897595245 -0.53668082109255666 -0.45337594379539081  0.86539097215515925 0.21403145679805685 -0.45308829251399779
+1.8135385194857194 -0.28952821920598959 -0.64151089172333187  0.61382359089386374 0.46011525660260022 -0.64149399833800946
+1.9763391479810344 -0.32848122801663854 -0.46863573506266076  0.77616877106981574 0.42177409750733563 -0.46868822204941807
+2.1011027986839408 -0.74999999999999989 0.43360551911151807  0.901663612301288 0 0.43243812303240864
+2.0654161897595245 -0.96331917890744334 0.45337594379539059  0.86539097215515692 -0.21403145679805807 0.45308829251400151
+1.8135385194857192 -1.2104717807940104 0.64151089172333176  0.61382359089386351 -0.46011525660260016 0.64149399833800969
+1.9763391479810346 -1.1715187719833613 0.46863573506266054  0.77616877106981685 -0.42177409750733297 0.46868822204941857
+1.2000000000000002 -1.1836055191115182 0.90110279868394083  0 -0.43243812303240797 0.90166361230128833
+1.4133191789074437 -1.203375943795391 0.86541618975952417  0.21403145679805641 -0.4530882925139994 0.86539097215515848
+1.6604717807940113 -1.3915108917233319 0.6135385194857188  0.46011525660260405 -0.64149399833800913 0.61382359089386107
+1.6215187719833617 -1.2186357350626613 0.77633914798103398  0.4217740975073353 -0.46868822204941846 0.77616877106981563
+1.2997571655259814 -1.2452588380279237 0.86299895207436528  0.10098201560182322 -0.4948484409268053 0.86309191459386481
+1.3318385030170203 -1.4166951227028344 0.73357768674250423  0.13227871496285376 -0.66711974931205564 0.73311225719230499
+1.130069651957502 -1.6328787711788482 0.46436496618972251  -0.069884317336660493 -0.882669982266157 0.4647686355560699
+1.3392917641443465 -1.5652357076386352 0.56212858442930091  0.1392430127504706 -0.81541586445899106 0.56187930322158042
+0.60498399644609502 -1.5513456331579596 0.061653318916405589  -0.59583045652862721 -0.80068159669946681 0.062410317894399457
+0.74662405620460892 -1.6154161897595241 0.21331917890744362  -0.45308829251400046 -0.86539097215515781 0.21403145679805693
+1.1321105690485507 -1.7180560789191068 0.24136787945551627  -0.068303541004109888 -0.96807477555330856 0.24117598392814943
+0.92750422818221478 -1.6475603118185225 0.3465999725759743  -0.27221405186828312 -0.8975964861531881 0.34672764240957366
+0.70474116197207626 -1.6129989520743653 0.099757165525981073  -0.49484844092680585 -0.8630919145938647 0.10098201560182098
+0.87846255922162908 -1.6968968656499479 -1.2287154012371124e-18  -0.32080957755114681 -0.94714371399036101 0
+1.0621802210060525 -1.6748367469837331 -0.35451755943338803  -0.13818785834076586 -0.9248838921586704 -0.35425118465944672
+1.0667959923265606 -1.7336473564126624 -0.12122116383748836  -0.13297103911781097 -0.98365340072891561 -0.12142771508337447
+1.1002428344740192 -1.2452588380279237 -0.86299895207436528  -0.10098201560182209 -0.49484844092680519 -0.86309191459386503
+1.0681614969829802 -1.4166951227028344 -0.73357768674250434  -0.13227871496285312 -0.66711974931205453 -0.73311225719230599
+1.2699303480424979 -1.6328787711788482 -0.46436496618972256  0.069884317336660964 -0.88266998226615756 -0.46476863555606862
+1.0607082358556541 -1.5652357076386352 -0.56212858442930091  -0.13924301275047007 -0.81541586445899161 -0.56187930322157975
+1.1383466810835943 -1.3450160035539047 -0.80134563315795981  -0.062410317894398916 -0.5958304565286292 -0.80068159669946537
+1.3318385030170194 -1.4166951227028339 -0.73357768674250468  0.13227871496285484 -0.6671197493120542 -0.73311225719230599
+1.7036911127293841 -1.2783612117454606 -0.68346886752821689  0.50330613999724028 -0.52841879760671184 -0.68370790823052163
+1.535431727389222 -1.4440145438011469 -0.63704738383668813  0.3357171829316094 -0.69398814937561593 -0.6369257583193445
+2.00134563315796 -0.68834668108359442 -0.59501600355390472  0.80068159669946681 0.06241031789439918 -0.59583045652862721
+1.9335776867425047 -0.88183850301701949 -0.66669512270283404  0.73311225719230533 -0.13227871496285548 -0.66711974931205487
+1.883468867528217 -1.2536911127293844 -0.52836121174546002  0.68370790823052252 -0.50330613999724028 -0.52841879760671062
+1.8370473838366879 -1.085431727389222 -0.69401454380114702  0.63692575831934328 -0.33571718293160768 -0.69398814937561804
+2.00134563315796 -0.81165331891640546 -0.5950160035539046  0.80068159669946692 -0.062410317894399089 -0.59583045652862721
+2.065416189759524 -0.96331917890744345 -0.45337594379539076  0.86539097215515814 -0.21403145679805666 -0.45308829251400007
+2.1680560789191068 -0.99136787945551619 -0.067889430951449573  0.96807477555330945 -0.24117598392814624 -0.06830354100410925
+2.0975603118185226 -1.0965999725759743 -0.27249577181778517  0.89759648615318977 -0.34672764240957071 -0.2722140518682814
+2.0629989520743655 -0.6502428344740192 0.49525883802792375  0.86309191459386569 0.10098201560182052 0.49484844092680441
+2.1468968656499481 -0.74999999999999989 0.32153744077837082  0.94714371399036212 0 0.32080957755114375
+2.1248367469837333 -1.1045175594333878 0.13781977899394765  0.92488389215867051 -0.35425118465944472 0.13818785834077046
+2.1836473564126626 -0.87122116383748816 0.13320400767343907  0.98365340072891616 -0.1214277150833719 0.13297103911780889
+2.0629989520743655 -0.84975716552598102 -0.49525883802792381  0.86309191459386503 -0.10098201560182166 -0.49484844092680513
+2.1468968656499481 -0.74999999999999989 -0.32153744077837088  0.94714371399036212 0 -0.32080957755114348
+2.1248367469837333 -0.39548244056661219 -0.13781977899394779  0.92488389215867084 0.35425118465944372 -0.1381878583407698
+2.1836473564126626 -0.62877883616251173 -0.13320400767343912  0.98365340072891616 0.12142771508337172 -0.13297103911780903
+1.6952588380279245 0.11299895207436506 -0.099757165525981045  0.49484844092680624 0.86309191459386447 -0.10098201560182174
+1.8666951227028346 -0.016422313257495769 -0.13183850301701974  0.66711974931205509 0.73311225719230533 -0.13227871496285334
+2.0828787711788479 -0.28563503381027766 0.069930348042498217  0.88266998226615601 0.46476863555607201 0.069884317336659035
+2.0152357076386354 -0.18787141557069953 -0.13929176414434619  0.8154158644589905 0.56187930322158097 -0.13924301275047105
+0.76639448088848172 -1.6511027986839408 -1.226221676538485e-18  -0.43243812303240797 -0.90166361230128833 0
+0.74662405620460925 -1.6154161897595241 -0.21331917890744351  -0.45308829251400057 -0.86539097215515759 -0.2140314567980578
+0.55848910827666798 -1.3635385194857188 -0.4604717807940108  -0.64149399833801013 -0.61382359089386318 -0.46011525660259989
+0.7313642649373393 -1.5263391479810342 -0.42151877198336168  -0.46868822204941962 -0.77616877106981541 -0.42177409750733452
+0.22628605152906522 -0.97313250261608553 -0.01853460685588823  -0.97011569110293372 -0.2416500529336342 -0.0219271017931944
+0.33458381024047579 -0.96331917890744323 -0.45337594379539092  -0.86539097215515903 -0.21403145679805605 -0.45308829251399851
+0.58646148051428115 -1.2104717807940109 -0.64151089172333209  -0.61382359089386218 -0.46011525660260127 -0.64149399833801024
+0.42366085201896575 -1.1715187719833617 -0.46863573506266099  -0.77616877106981597 -0.42177409750733513 -0.46868822204941801
+0.70474116197207626 -1.6129989520743653 -0.099757165525981073  -0.49484844092680602 -0.86309191459386458 -0.1009820156018213
+0.53330487729716547 -1.4835776867425041 -0.13183850301701977  -0.66711974931205653 -0.73311225719230411 -0.13227871496285368
+0.31712122882115168 -1.2143649661897222 0.06993034804249823  -0.88266998226615767 -0.46476863555606879 0.069884317336658758
+0.38476429236136467 -1.3121285844293005 -0.13929176414434624  -0.8154158644589905 -0.56187930322158086 -0.13924301275047243
+0.39865436684204036 -0.81165331891640546 0.59501600355390505  -0.80068159669946593 -0.062410317894397216 0.59583045652862865
+0.3345838102404759 -0.96331917890744334 0.45337594379539103  -0.86539097215515925 -0.21403145679805619 0.45308829251399813
+0.23194392108089312 -0.99136787945551608 0.067889430951449628  -0.96807477555330879 -0.24117598392814923 0.068303541004108778
+0.3024396881814776 -1.0965999725759743 0.27249577181778545  -0.8975964861531891 -0.34672764240957249 0.27221405186828163
+0.60498399644609513 -1.5513456331579598 -0.061653318916405575  -0.59583045652862721 -0.80068159669946681 -0.062410317894398229
+0.53330487729716558 -1.4835776867425046 0.13183850301701974  -0.66711974931205553 -0.73311225719230488 0.13227871496285398
+0.67163878825453982 -1.4334688675282172 0.50369111272938427  -0.52841879760671173 -0.68370790823052097 0.50330613999724116
+0.50598545619885293 -1.3870473838366881 0.33543172738922172  -0.69398814937561748 -0.63692575831934339 0.33571718293160824
+1.2616533189164061 -1.3450160035539047 0.80134563315795981  0.062410317894398999 -0.5958304565286292 0.80068159669946537
+1.0681614969829809 -1.4166951227028342 0.73357768674250479  -0.13227871496285457 -0.6671197493120542 0.7331122571923061
+0.69630888727061591 -1.2783612117454606 0.68346886752821701  -0.50330613999723917 -0.52841879760671218 0.68370790823052208
+0.86456827261077818 -1.4440145438011469 0.63704738383668824  -0.33571718293160896 -0.69398814937561737 0.63692575831934317
+0.63268818151834738 -0.32335420881895127 -0.70294074606773105  -0.56065793252598317 0.42546670457134955 -0.71038071904921962
+0.62443505191569915 -0.33636614204180315 -0.70422028778974766  -0.56065793252598251 0.42546670457134655 -0.71038071904922195
+0.30362145533065943 -0.84916410602320291 0.43023759412454349  -0.89961957659540726 -0.11104418275857525 0.42231955541009492
+0.29401138453262832 -0.86471241548978517 0.4056780940788991  -0.89961957659540781 -0.11104418275857478 0.42231955541009392
+0.33700104792563468 -0.84975716552598102 0.49525883802792398  -0.86309191459386525 -0.10098201560182231 0.49484844092680469
+0.40151480227572495 -0.69274920908571347 -0.59888293763788791  -0.78019094274163359 0.041329938271319699 -0.62417459822265275
+0.46796403496887884 -0.58666916470964625 -0.66003296952840651  -0.73315795129589834 0.17491713444450682 -0.6571783734491905
+0.95069104161024875 0.185674705522129 0.24579255546759909  -0.24611330719287169 0.93975526497092965 0.23725151629021288
+1.686966450462785 -0.47427145868032006 0.8287565671687902  0.48692804957249219 0.27563277583938817 0.82881098413486431
+1.5417901167060055 0.037928268229677653 0.51219972690999771  0.34188293456237384 0.78786613428398444 0.51223335844459628
+0.92427145868032001 0.078756567168790315 0.48696645046278492  -0.27563277583938706 0.82881098413486554 0.48692804957249081
+0.68780027309000236 -0.40820988329399444 0.78792826822967776  -0.51223335844459605 0.34188293456237484 0.78786613428398422
+1.159171701060888 -0.75 0.99916617737278246  -0.040944849850879435 -3.4730626153766554e-18 0.99916140801708753
+1.2408282989391131 -0.75 -0.99916617737278246  0.040944849850879324 0 -0.99916140801708753
+0.71303354953721532 -0.47427145868032 -0.82875656716879043  -0.48692804957249047 0.27563277583938817 -0.8288109841348652
+0.85820988329399439 0.037928268229677653 -0.51219972690999771  -0.34188293456240315 0.78786613428397578 -0.51223335844458995
+1.4757285413196803 0.078756567168790315 -0.48696645046278492  0.2756327758393865 0.82881098413486554 -0.48692804957249086
+1.7121997269099978 -0.40820988329399444 -0.78792826822967765  0.51223335844459628 0.34188293456237279 -0.78786613428398489
+1.5417901167060062 -1.5379282682296775 0.5121997269099976  0.34188293456237406 -0.78786613428398444 0.51223335844459605
+1.2 -1.7491661773727825 0.040828298939112592  -7.64073775382864e-17 -0.99916140801708753 0.040944849850877922
+1.4757285413196803 -1.5787565671687904 -0.48696645046278475  0.27563277583938756 -0.82881098413486565 -0.48692804957249008
+1.9879282682296777 -1.2621997269099974 -0.34179011670600551  0.78786613428398389 -0.51223335844459728 -0.34188293456237384
+2.0287565671687906 -1.2369664504627846 0.27572854131967994  0.82881098413486598 -0.48692804957248942 0.27563277583938806
+2.0287565671687906 -0.26303354953721531 0.27572854131968005  0.8288109841348642 0.48692804957249169 0.27563277583938917
+0.68780027309000236 -1.0917901167060053 -0.78792826822967776  -0.51223335844459628 -0.34188293456237551 -0.78786613428398378
+0.4331208322019765 -0.64210794890239153 0.63136143448574877  -0.75877805430304357 0.10723544565538895 0.64246122334595246
+0.68780027309000258 -1.0917901167060058 0.78792826822967776  -0.51223335844459561 -0.34188293456237395 0.78786613428398489
+0.4331208322019765 -0.64210794890239153 -0.63136143448574877  -0.7587780543030449 0.10723544565538454 -0.64246122334595146
+1.2408282989391131 -0.75 0.99916617737278246  0.040944849850879296 -1.7365313076883277e-17 0.99916140801708753
+1.6869664504627853 -1.0257285413196802 0.82875656716879009  0.48692804957249064 -0.27563277583938667 0.82881098413486576
+1.712199726909998 -0.40820988329399466 0.78792826822967765  0.51223335844459739 0.34188293456237184 0.78786613428398455
+1.9879282682296777 -0.23780027309000251 0.34179011670600551  0.78786613428398478 0.5122333584445955 0.34188293456237423
+1.4757285413196803 0.078756567168790315 0.48696645046278475  0.27563277583938761 0.82881098413486509 0.48692804957249125
+1.2 0.24916617737278246 0.040828298939112578  -8.3353502769039717e-17 0.99916140801708742 0.040944849850880677
+0.85820988329399461 0.037928268229677764 0.51219972690999771  -0.34188293456235924 0.78786613428398578 0.51223335844460405
+0.70685918524788072 -0.20468185015976154 -0.67677227421098896  -0.49105853440620972 0.56677814486533351 -0.66153159432474307
+0.71303354953721532 -0.47427145868031984 0.82875656716879031  -0.48692804957249058 0.2756327758393885 0.82881098413486509
+0.71303354953721532 -1.0257285413196804 0.82875656716879031  -0.48692804957249042 -0.27563277583938889 0.82881098413486509
+1.6869664504627853 -0.47427145868031989 -0.82875656716879009  0.48692804957249114 0.27563277583938739 -0.8288109841348652
+1.686966450462785 -1.0257285413196799 -0.8287565671687902  0.48692804957249181 -0.27563277583938761 -0.82881098413486476
+1.159171701060888 -0.75 -0.99916617737278246  -0.040944849850879407 -1.7365313076883277e-17 -0.99916140801708753
+0.71303354953721521 -1.0257285413196802 -0.82875656716879043  -0.48692804957249081 -0.27563277583938839 -0.82881098413486509
+0.68780027309000247 -0.4082098832939946 -0.78792826822967776  -0.51223335844459583 0.34188293456237379 -0.78786613428398478
+0.71021467390312099 -0.19943478257349526 -0.67476755984413894  -0.49105853440620517 0.5667781448653324 -0.6615315943247474
+0.92427145868032001 0.078756567168790315 -0.48696645046278475  -0.27563277583938645 0.82881098413486542 -0.48692804957249114
+1.2 0.24916617737278246 -0.040828298939112578  -6.5988189692156443e-17 0.99916140801708742 -0.04094484985088067
+1.5417901167060057 0.037928268229677653 -0.5121997269099976  0.34188293456237506 0.78786613428398322 -0.51223335844459739
+1.9879282682296777 -0.23780027309000251 -0.3417901167060054  0.78786613428398444 0.51223335844459617 -0.34188293456237406
+1.9879282682296779 -1.2621997269099974 0.34179011670600534  0.78786613428398466 -0.51223335844459561 0.34188293456237406
+1.7121997269099978 -1.0917901167060053 0.78792826822967765  0.51223335844459661 -0.34188293456237395 0.78786613428398422
+1.4757285413196806 -1.57875656716879 0.48696645046278486  0.27563277583939033 -0.82881098413486387 0.48692804957249158
+0.92427145868032001 -1.5787565671687904 0.48696645046278475  -0.27563277583938756 -0.82881098413486587 0.48692804957248964
+1.2 -1.7491661773727825 -0.040828298939112592  -7.9880440153663052e-17 -0.99916140801708753 -0.040944849850877929
+0.92427145868032001 -1.5787565671687904 -0.48696645046278492  -0.27563277583938806 -0.82881098413486498 -0.48692804957249103
+1.5417901167060055 -1.5379282682296778 -0.5121997269099976  0.34188293456237406 -0.78786613428398466 -0.51223335844459583
+1.712199726909998 -1.0917901167060053 -0.78792826822967754  0.51223335844459705 -0.34188293456237379 -0.78786613428398389
+2.0287565671687906 -1.2369664504627846 -0.27572854131968005  0.82881098413486443 -0.48692804957249214 -0.27563277583938794
+2.1991661773727822 -0.79082829893911255 0  0.99916140801708742 -0.040944849850880795 -1.7365313076883274e-17
+2.1991661773727822 -0.70917170106088734 0  0.99916140801708742 0.040944849850880705 -5.5569001846026474e-17
+2.0287565671687906 -0.26303354953721531 -0.27572854131968005  0.82881098413486454 0.48692804957249131 -0.27563277583938905
+0.85820988329399461 -1.5379282682296775 -0.51219972690999771  -0.34188293456237323 -0.78786613428398444 -0.51223335844459661
+0.41207173177032219 -1.2621997269099976 -0.34179011670600545  -0.78786613428398422 -0.51223335844459672 -0.34188293456237362
+0.37124343283120964 -1.2369664504627851 -0.27572854131968011  -0.82881098413486498 -0.48692804957249108 -0.27563277583938772
+0.37124343283120953 -1.2369664504627846 0.27572854131968016  -0.82881098413486476 -0.48692804957249136 0.27563277583938789
+0.4120717317703223 -1.2621997269099978 0.34179011670600562  -0.78786613428398444 -0.51223335844459661 0.34188293456237306
+0.85820988329399461 -1.537928268229678 0.51219972690999771  -0.34188293456237456 -0.78786613428398455 0.51223335844459561
+0.67087146858540314 -0.2624299701285262 -0.69320320770179855  -0.51449014281491767 0.48894277869645281 -0.70443938852599475
+0.66689476317101137 -0.26866388572512034 -0.69462568959831961  -0.5144901428149169 0.48894277869645481 -0.70443938852599386
+1.5180233001589554 -0.16663313718873862 0.74735820322637392  0.31837608818572216 0.5834113418069351 0.74717325482286168
+1.3549016200234227 -0.4242154556775744 0.93266817185682316  0.15470547768481771 0.32538864777967069 0.93283891592837709
+1.2000000000000002 0.029916071523905408 0.62588411178006298  -1.9440969465109252e-05 0.78016657033104064 0.62557183613071154
+1.4506360861103191 -0.17357936956725528 0.77776655183340049  0.25072811471624656 0.57677917521735034 0.77747102552212832
+0.88197669984104476 -0.16663313718873862 0.74735820322637392  -0.31838810336562551 0.58337988565756493 0.74719269579232783
+1.2000000000000002 -0.018677749543832611 0.68203208574650409  -0.00040939357642315278 0.73148465290216658 0.68185778206712322
+1.0034507912873563 -0.4846564373476937 0.94390741193901817  -0.19675522852410574 0.26500379747184427 0.94395993949633727
+0.94936391388968078 -0.17357936956725528 0.77776655183340049  -0.2507281147162494 0.57677917521734823 0.77747102552212899
+1.3965492087126441 -0.48465643734769376 0.94390741193901806  0.19678668467347626 0.26502323844131009 0.94394792431643293
+1.0450983799765776 -0.42421545567757435 0.93266817185682316  -0.15470547768481632 0.32538864777966997 0.93283891592837753
+1.0034507912873558 -0.48465643734769376 -0.94390741193901806  -0.19678668467347538 0.26502323844130876 -0.94394792431643348
+1.3549016200234227 -0.42421545567757435 -0.93266817185682316  0.15536789040624926 0.32579804135609469 -0.93258589678337089
+0.88197669984104476 -0.16663313718873862 -0.74735820322637392  -0.31837608818572144 0.58341134180693477 -0.74717325482286201
+1.0450983799765772 -0.4242154556775744 -0.93266817185682316  -0.15470547768481749 0.32538864777967014 -0.93283891592837731
+1.2000000000000002 0.029916071523905408 -0.62588411178006298  1.9440969465147456e-05 0.78016657033104064 -0.62557183613071166
+0.94936391388968078 -0.17357936956725528 -0.77776655183340049  -0.25072811471624901 0.57677917521734834 -0.77747102552212899
+1.5180233001589554 -0.16663313718873862 -0.74735820322637392  0.31837608818572199 0.58341134180693521 -0.74717325482286157
+1.2000000000000002 -0.018677749543832611 -0.68203208574650409  0.00040939357642540662 0.73148465290216658 -0.68185778206712322
+1.3965492087126441 -0.48465643734769376 -0.94390741193901806  0.19678668467347624 0.26502323844130876 -0.94394792431643337
+1.4506360861103194 -0.17357936956725528 -0.77776655183340049  0.25098113386125454 0.57611676249591781 -0.77788041909855354
+1.4653435626523068 -1.6939074119390178 0.19654920871264414  0.26500379747184499 -0.94395993949633672 0.19675522852410671
+1.776420630432745 -1.5277665518334003 0.25063608611031901  0.57677917521735267 -0.77747102552212677 0.25072811471624601
+1.4653435626523068 -1.6939074119390178 -0.19654920871264417  0.26502323844130787 -0.9439479243164336 -0.1967866846734764
+1.5257845443224263 -1.682668171856823 0.15490162002342267  0.32579804135609608 -0.93258589678337034 0.1553678904062491
+1.7833668628112616 -1.4973582032263737 -0.31802330015895508  0.58341134180693421 -0.74717325482286179 -0.31837608818572316
+1.5257845443224263 -1.682668171856823 -0.15490162002342261  0.32538864777967014 -0.9328389159283772 -0.15470547768481846
+1.9799160715239057 -1.3758841117800626 6.5652635294160463e-18  0.7801665703310402 -0.62557183613071232 1.9440969467934493e-05
+1.776420630432745 -1.5277665518334005 -0.25063608611031912  0.57677917521735034 -0.77747102552212821 -0.25072811471624679
+1.783366862811262 -1.4973582032263735 0.31802330015895508  0.58341134180693577 -0.74717325482286157 0.31837608818572088
+1.9313222504561676 -1.4320320857465036 6.5571195165482265e-18  0.73148465290216724 -0.68185778206712244 0.00040939357642396707
+1.9473582032263739 -0.43197669984104503 0.58336686281126138  0.74717325482286179 0.31837608818572261 0.58341134180693444
+2.1326681718568232 -0.59509837997657744 0.32578454432242576  0.93258589678337045 0.1553678904062504 0.3257980413560953
+1.0034507912873558 -1.0153435626523062 -0.94390741193901806  -0.19678668467347527 -0.26502323844130832 -0.9439479243164336
+0.94936391388968078 -1.3264206304327446 -0.77776655183340071  -0.25072811471624867 -0.57677917521734845 -0.77747102552212888
+0.54306000239317154 -0.46664565776233691 -0.69755165300174249  -0.64093662140152696 0.29301330949338655 -0.70946701671475088
+0.5493198212532957 -0.45674068614295493 -0.69911600851089584  -0.64093662140152796 0.29301330949338594 -0.70946701671475021
+0.57411588821993709 -0.75 0.77991607152390563  -0.62557183613071099 1.9440969465088418e-05 0.7801665703310412
+0.42223344816659947 -1.0006360861103192 0.57642063043274483  -0.77747102552212854 -0.25072811471624834 0.57677917521734923
+0.22743420727478347 -0.97114863140943242 0.060907607905721757  -0.97824013612619687 -0.2023295205475491 0.04592386293419589
+0.65693999760682842 -0.28335434223766309 0.69755165300174249  -0.52046695699576928 0.4680023877090585 0.71420439075532427
+1.0034507912873563 -1.0153435626523062 0.94390741193901817  -0.19678668467347571 -0.26502323844130965 0.94394792431643315
+1.3549016200234227 -1.0757845443224259 0.93266817185682316  0.15470547768481877 -0.32538864777966986 0.9328389159283772
+1.9473582032263741 -1.068023300158955 0.58336686281126127  0.7471926957923285 -0.31838810336562651 0.5833798856575636
+1.882032085746504 -0.75 0.73132225045616739  0.68185778206712322 0.00040939357642449329 0.73148465290216658
+1.825884111780063 -0.75 0.77991607152390541  0.62557183613071199 -1.9440969466317842e-05 0.78016657033104053
+1.9777665518334007 -0.49936391388968099 0.57642063043274483  0.77747102552212866 0.25072811471624751 0.57677917521734945
+1.9799160715239057 -0.12411588821993724 -6.5652635294160447e-18  0.78016657033104142 0.62557183613071088 -1.9440969466128564e-05
+1.7764206304327446 0.027766551833400488 0.25063608611031907  0.57677917521734934 0.77747102552212866 0.25072811471624773
+1.7833668628112616 -0.0026417967736263037 0.31802330015895508  0.58337988565756482 0.74719269579232783 0.31838810336562562
+1.5257845443224261 0.18266817185682305 0.15490162002342259  0.32538864777967108 0.93283891592837698 0.15470547768481774
+0.65068017874670425 -0.29325931385704496 0.69911600851089584  -0.54352627180166979 0.43623030388676148 0.71713479474380626
+0.5673118184816528 -0.42664579118104884 0.70294074606773105  -0.62602060935196546 0.3045977284849295 0.71785682449107846
+0.57556494808430092 -0.41363385795819674 0.70422028778974766  -0.60701252203428957 0.33806887798059881 0.71919763058182429
+0.53310523682898847 -0.4813361142748796 0.69462568959831961  -0.64422625268360179 0.2707665146111275 0.71530275402698273
+0.52912853141459681 -0.48757002987147369 0.69320320770179855  -0.66138007935864995 0.23687493927937048 0.71166470600201914
+0.6921217709628692 -0.22700206765185593 0.68413337702600874  -0.52838581205516633 0.49772992706570907 0.68780328097644783
+0.79963678018449613 -0.05534752809057629 0.5975302451883705  -0.36887582764815235 0.69486688193515589 0.61732539245247686
+0.51796791425349598 -0.75 0.73132225045616761  -0.68185778206712311 -0.00040939357642604912 0.73148465290216658
+0.88197669984104521 -1.3333668628112616 0.74735820322637403  -0.31837608818572261 -0.58341134180693432 0.7471732548228619
+1.0450983799765778 -1.0757845443224259 0.93266817185682316  -0.15470547768481827 -0.32538864777967069 0.93283891592837698
+1.9473582032263739 -0.43197669984104503 -0.58336686281126138  0.74719269579232828 0.31838810336562562 -0.58337988565756427
+1.882032085746504 -0.75 -0.73132225045616739  0.68185778206712311 0.00040939357642504547 -0.73148465290216658
+1.5180233001589554 -1.3333668628112614 -0.74735820322637381  0.3183881033656264 -0.58337988565756693 -0.74719269579232594
+1.3549016200234227 -1.0757845443224259 -0.93266817185682316  0.15536789040624779 -0.32579804135609403 -0.93258589678337134
+1.3965492087126441 -1.0153435626523062 -0.94390741193901806  0.1967866846734756 -0.26502323844130887 -0.94394792431643337
+1.0450983799765772 -1.0757845443224259 -0.93266817185682316  -0.15470547768481796 -0.32538864777967053 -0.93283891592837709
+0.45264179677362604 -1.068023300158955 -0.58336686281126149  -0.74719269579232694 -0.31838810336562517 -0.58337988565756627
+0.51796791425349598 -0.75 -0.7313222504561675  -0.68185778206712322 0.00040939357642540315 -0.73148465290216658
+0.57411588821993709 -0.75 -0.77991607152390563  -0.62557183613071143 -1.9440969465946235e-05 -0.78016657033104087
+0.79848519772427506 -0.057250790914286052 0.59888293763788747  -0.39881277493423034 0.66927944610494072 0.62690780308648464
+0.37506412073313489 -0.73422479552976916 0.5641719337434894  -0.82793015848818263 0.029879307227406587 0.56003471291103279
+0.61696807586665514 -0.34742682425518856 0.70495163176324005  -0.56575106816925058 0.40400744901774194 0.71882105562061038
+0.85711100340627278 0.037134436368273127 0.51257565524045945  -0.37394295240639175 0.76556189758091675 0.52352807882471508
+0.36517401588679055 -0.75 0.54975734503310159  -0.8351282192258348 5.4308772982543211e-16 0.55005532217467545
+1.4653435626523068 0.19390741193901784 0.19654920871264411  0.26502323844131026 0.94394792431643293 0.19678668467347613
+1.5257845443224261 0.18266817185682305 -0.15490162002342259  0.32538864777967069 0.93283891592837709 -0.15470547768481732
+1.4653435626523068 0.19390741193901784 -0.19654920871264409  0.26500379747184366 0.94395993949633761 -0.19675522852410474
+1.7764206304327446 0.027766551833400488 -0.25063608611031907  0.57611676249591726 0.7778804190985541 -0.25098113386125426
+2.143907411939018 -0.55345079128735586 -0.26534356265230641  0.94395993949633639 0.19675522852410829 -0.2650037974718456
+1.9777665518334007 -0.49936391388968093 -0.57642063043274461  0.77788041909855388 0.25098113386125426 -0.57611676249591737
+2.143907411939018 -0.94654920871264403 0.2653435626523063  0.94395993949633716 -0.19675522852410743 0.26500379747184344
+1.9777665518334007 -1.000636086110319 0.57642063043274461  0.7778804190985531 -0.25098113386125498 0.57611676249591826
+1.3965492087126441 -1.0153435626523066 0.94390741193901784  0.19675522852410626 -0.26500379747184283 0.9439599394963375
+1.4506360861103194 -1.3264206304327448 0.77776655183340038  0.2509811338612547 -0.5761167624959187 0.77788041909855277
+1.5180233001589556 -1.3333668628112614 0.74735820322637381  0.31838810336562534 -0.58337988565756493 0.74719269579232783
+1.2000000000000002 -1.4813222504561674 0.68203208574650398  -0.00040939357642352781 -0.73148465290216691 0.68185778206712278
+0.61663313718873858 -1.4973582032263739 0.31802330015895514  -0.58341134180693366 -0.74717325482286201 0.31837608818572388
+0.87421545567757442 -1.682668171856823 0.15490162002342264  -0.32538864777966964 -0.93283891592837698 0.15470547768482029
+0.93465643734769377 -1.6939074119390181 0.19654920871264422  -0.26500379747184344 -0.94395993949633761 0.19675522852410501
+0.87421545567757397 -1.682668171856823 -0.1549016200234227  -0.32538864777967069 -0.93283891592837709 -0.15470547768481749
+0.88197669984104465 -1.3333668628112609 -0.74735820322637414  -0.31837608818572127 -0.58341134180693477 -0.74717325482286223
+1.2 -1.4813222504561674 -0.68203208574650398  0.00040939357642341147 -0.73148465290216702 -0.68185778206712278
+1.2 -1.5299160715239055 -0.62588411178006287  -1.9440969467884131e-05 -0.78016657033104075 -0.62557183613071143
+1.4506360861103191 -1.3264206304327451 -0.77776655183340049  0.25098113386125381 -0.5761167624959187 -0.7778804190985531
+1.825884111780063 -0.75 -0.77991607152390541  0.62557183613071188 1.9440969466300475e-05 -0.78016657033104053
+1.9777665518334007 -1.000636086110319 -0.57642063043274472  0.77747102552212888 -0.25072811471624684 -0.57677917521734945
+1.9473582032263741 -1.068023300158955 -0.58336686281126127  0.7471732548228629 -0.31837608818572177 -0.58341134180693366
+2.1326681718568232 -0.90490162002342256 -0.32578454432242576  0.93283891592837764 -0.15470547768481741 -0.3253886477796693
+2.143907411939018 -0.55345079128735586 0.26534356265230624  0.94395993949633716 0.19675522852410809 0.26500379747184305
+2.1326681718568232 -0.90490162002342245 0.3257845443224256  0.93283891592837764 -0.15470547768481743 0.3253886477796693
+2.143907411939018 -0.94654920871264403 -0.26534356265230624  0.94394792431643348 -0.19678668467347632 -0.26502323844130793
+2.1326681718568228 -0.59509837997657722 -0.32578454432242587  0.93258589678336967 0.15536789040625279 -0.32579804135609647
+1.7833668628112611 -0.0026417967736259707 -0.31802330015895519  0.58337988565756549 0.74719269579232739 -0.31838810336562545
+1.9313222504561676 -0.067967914253496131 -6.5571195165482257e-18  0.73148465290216658 0.68185778206712322 0.00040939357642534065
+0.93465643734769377 -1.6939074119390181 -0.19654920871264417  -0.26502323844131026 -0.94394792431643293 -0.19678668467347621
+0.62357936956725513 -1.5277665518334005 -0.25063608611031907  -0.57611676249591681 -0.77788041909855388 -0.25098113386125542
+0.2560925880609819 -0.94654920871264381 -0.26534356265230646  -0.94394792431643326 -0.19678668467347482 -0.26502323844131015
+0.42223344816659947 -1.0006360861103192 -0.57642063043274483  -0.77747102552212843 -0.25072811471624856 -0.57677917521734912
+0.61663313718873847 -1.4973582032263737 -0.31802330015895514  -0.58337988565756582 -0.74719269579232661 -0.31838810336562673
+0.46867774954383223 -1.4320320857465039 -6.557119516548228e-18  -0.73148465290216691 -0.68185778206712278 0.00040939357642509578
+0.45264179677362604 -1.068023300158955 0.58336686281126149  -0.74717325482286212 -0.31837608818572227 0.58341134180693421
+0.35314170479917451 -0.76928684914828649 0.53075413092765567  -0.84560936423414956 -0.027439993872776989 0.53309647331020626
+0.42008392847609421 -1.3758841117800626 -6.5652635294160471e-18  -0.78016657033104109 -0.62557183613071121 -1.9440969465194341e-05
+0.6235793695672549 -1.5277665518334005 0.25063608611031912  -0.57677917521734967 -0.77747102552212843 0.25072811471624756
+1.2000000000000002 -1.5299160715239055 0.62588411178006287  1.9440969467748691e-05 -0.78016657033104075 0.62557183613071143
+0.94936391388968122 -1.3264206304327451 0.77776655183340049  -0.25098113386125387 -0.57611676249591748 0.77788041909855399
+0.9253890776539393 0.14644305776905842 0.34753041451074107  -0.30595468057194158 0.88059013433293742 0.36187394041519544
+0.26758089404998364 -0.9059728893652188 0.32585692434233743  -0.92464256115117716 -0.19278508535823347 0.32843575470890851
+0.2560925880609819 -0.94654920871264381 0.26534356265230635  -0.94394792431643393 -0.1967866846734751 0.26502323844130765
+0.94302798180440095 0.1743284862276076 0.28050566540029331  -0.23706297888618641 0.9260725255318728 0.29358273364867038
+1.8562122655612305 -0.35501511824236365 0.6429404371401003  0.65613064511909591 0.3953635844294407 0.64279095563231414
+1.6382389584574513 -0.22030020581200926 0.72619883181352507  0.43849581670457105 0.52986930552536982 0.72592006295091027
+1.4047014786826493 0.1770588370822882 0.31410064822087258  0.20429513892774534 0.92713596376716367 0.31413755092319967
+1.2699865662522949 0.093800442408863538 0.53207395532465163  0.069789417831815442 0.84400685644856721 0.53177237933772381
+0.25313054028719528 -0.92991689161909563 0.26460466631117985  -0.95170604908226608 -0.15778941565067039 0.26335925358499035
+0.80501511824236338 -0.1070595628598997 0.65621226556123025  -0.39536358442943975 0.64279095563231481 0.65613064511909569
+0.66792604467534855 -0.68001343374770507 0.84380044240886365  -0.53177237933772403 0.069789417831815664 0.8440068564485671
+0.8858993517791276 -0.54529852131735079 0.9270588370822882  -0.31413755092319828 0.20429513892774345 0.92713596376716445
+1.4008600052687634 -0.88471491243035438 0.9703129137821026  0.20121590081625373 -0.13450572109592804 0.97026819604229431
+1.4008600052687634 -0.61528508756964562 0.9703129137821026  0.20121590081625312 0.13450572109592757 0.97026819604229442
+0.99913999473123671 -0.88471491243035438 -0.97031291378210283  -0.2012159008162531 -0.13450572109592762 -0.97026819604229442
+0.99913999473123671 -0.61528508756964562 -0.97031291378210283  -0.20121590081625337 0.13450572109592807 -0.97026819604229431
+0.26791287934591501 -0.90549608434201145 0.3269900786062353  -0.91789704785096649 -0.17153707639041882 0.35782683098100421
+0.76176104154254864 -0.22030020581200915 -0.72619883181352518  -0.43849581670457083 0.52986930552536815 -0.7259200629509116
+0.99529852131735064 0.1770588370822882 -0.31410064822087258  -0.20429513892774293 0.92713596376716434 -0.31413755092319934
+1.130013433747705 0.093800442408863538 -0.53207395532465163  -0.069789417831815415 0.84400685644856743 -0.53177237933772348
+1.7296997941879915 -0.023801168186475152 -0.43823895845745109  0.52986930552537015 0.72592006295091016 -0.43849581670457066
+1.5949848817576369 -0.10705956285989982 -0.65621226556123013  0.3953635844294397 0.64279095563231459 -0.65613064511909591
+1.732073955324652 -0.68001343374770495 -0.84380044240886309  0.53177237933772414 0.069789417831814707 -0.84400685644856699
+1.514100648220873 -0.54529852131735079 -0.92705883708228798  0.31413755092319923 0.20429513892774315 -0.92713596376716423
+1.2699865662522956 -1.5938004424088636 0.53207395532465152  0.069789417831816025 -0.84400685644856654 0.5317723793377247
+1.4047014786826499 -1.6770588370822881 0.31410064822087264  0.20429513892774617 -0.92713596376716367 0.31413755092319912
+1.0652850875696456 -1.7203129137821027 -0.20086000526876327  -0.13450572109592807 -0.9702681960422942 -0.20121590081625407
+1.3347149124303548 -1.7203129137821027 -0.20086000526876327  0.13450572109592854 -0.97026819604229386 -0.20121590081625515
+1.5949848817576369 -1.3929404371401004 -0.65621226556122991  0.39536358442944175 -0.64279095563231325 -0.65613064511909613
+1.729699794187991 -1.4761988318135251 -0.43823895845745126  0.52986930552536826 -0.72592006295091183 -0.43849581670457022
+2.1270588370822883 -1.0641006482208724 -0.20470147868264912  0.92713596376716445 -0.31413755092319778 -0.20429513892774437
+2.0438004424088634 -1.2820739553246514 -0.069986566252294838  0.84400685644856765 -0.53177237933772303 -0.069789417831815984
+1.9261988318135255 -1.1882389584574506 0.52969979418799085  0.72592006295091227 -0.43849581670456861 0.52986930552536904
+1.8429404371401006 -1.4062122655612299 0.39498488175763641  0.64279095563231547 -0.6561306451190958 0.39536358442943842
+1.8429404371401004 -0.093787734438769865 0.39498488175763669  0.64279095563231381 0.65613064511909625 0.39536358442944064
+1.926198831813525 -0.31176104154254897 0.52969979418799107  0.72592006295091205 0.43849581670456983 0.52986930552536837
+0.66792604467534855 -0.81998656625229493 -0.84380044240886365  -0.53177237933772392 -0.069789417831815595 -0.8440068564485671
+0.88589935177912738 -0.95470147868264921 -0.9270588370822882  -0.31413755092319839 -0.20429513892774312 -0.92713596376716456
+0.23259475183323847 -0.96237493457550005 0.13494008765512316  -0.96126367789069989 -0.24008359059386972 0.13539575730280448
+0.96105942755013962 0.20306848001363992 0.18186355091081879  -0.23241575440058715 0.9560851324517049 0.1785612965096629
+0.88589935177912782 -0.95470147868264921 0.92705883708228842  -0.31413755092319828 -0.2042951389277437 0.92713596376716445
+0.66792604467534844 -0.81998656625229493 0.84380044240886354  -0.53177237933772348 -0.069789417831816219 0.84400685644856732
+0.97011813854669349 0.21732927410114633 0.09963433104745141  -0.22974865031682276 0.96813269657427869 0.099672661755436959
+0.22762677949308696 -0.97053761901938218 0.067701629511043929  -0.977076172502924 -0.20189342879636338 0.067536631067031172
+0.99913999473123705 -0.61528508756964562 0.97031291378210283  -0.20121590081625301 0.13450572109592784 0.97026819604229442
+0.99913999473123705 -0.88471491243035438 0.97031291378210283  -0.20121590081625312 -0.13450572109592798 0.97026819604229442
+1.6382389584574515 -1.2796997941879908 0.72619883181352474  0.43849581670457077 -0.52986930552536804 0.72592006295091172
+1.8562122655612305 -1.1449848817576362 0.6429404371401003  0.6561306451190958 -0.39536358442944081 0.64279095563231403
+1.514100648220873 -0.54529852131735101 0.92705883708228809  0.31413755092319962 0.20429513892774379 0.9271359637671639
+1.732073955324652 -0.68001343374770518 0.84380044240886309  0.53177237933772414 0.069789417831814637 0.84400685644856699
+2.1270588370822883 -0.43589935177912753 0.20470147868264921  0.92713596376716356 0.31413755092319956 0.20429513892774553
+2.0438004424088634 -0.21792604467534848 0.069986566252294824  0.84400685644856799 0.53177237933772259 0.069789417831813999
+1.5949848817576369 -0.10705956285989982 0.65621226556123013  0.39536358442944181 0.64279095563231281 0.65613064511909647
+1.7296997941879908 -0.02380116818647493 0.4382389584574512  0.52986930552536893 0.72592006295091116 0.43849581670457066
+1.3347149124303548 0.22031291378210283 -0.20086000526876321  0.13450572109592773 0.97026819604229453 -0.20121590081625276
+1.0652850875696458 0.22031291378210283 -0.20086000526876321  -0.13450572109592798 0.97026819604229442 -0.20121590081625304
+1.130013433747705 0.093800442408863538 0.53207395532465163  -0.069789417831814193 0.84400685644856799 0.5317723793377227
+0.99529852131735064 0.1770588370822882 0.31410064822087264  -0.2042951389277437 0.92713596376716401 0.31413755092319967
+0.97371394847093473 0.22313250261608547 0.018534606855888314  -0.22857704379632671 0.97332233192471596 0.019904100732393931
+0.22762677949308696 -0.97053761901938218 -0.067701629511043929  -0.97707617250292411 -0.20189342879636341 -0.0675366310670278
+0.76176104154254864 -0.22030020581200915 0.72619883181352496  -0.43849581670457166 0.52986930552536859 0.72592006295091083
+0.23259475183323844 -0.96237493457549972 -0.13494008765512316  -0.96126367789070022 -0.24008359059387063 -0.13539575730280104
+0.54378773443876993 -1.1449848817576371 0.6429404371401003  -0.65613064511909602 -0.39536358442944158 0.64279095563231348
+0.76176104154254898 -1.2796997941879913 0.72619883181352518  -0.43849581670457066 -0.52986930552536937 0.72592006295091083
+1.6382389584574515 -0.22030020581200915 -0.72619883181352496  0.43849581670457105 0.52986930552536826 -0.72592006295091138
+1.8562122655612303 -0.35501511824236348 -0.64294043714010018  0.6561306451190958 0.39536358442944025 -0.64279095563231448
+1.8562122655612303 -1.1449848817576367 -0.64294043714010018  0.65613064511909591 -0.3953635844294397 -0.64279095563231481
+1.6382389584574513 -1.2796997941879908 -0.72619883181352485  0.43849581670457155 -0.52986930552536948 -0.72592006295091016
+1.4008600052687634 -0.61528508756964562 -0.9703129137821026  0.20121590081625362 0.13450572109592837 -0.9702681960422942
+1.4008600052687634 -0.88471491243035438 -0.9703129137821026  0.20121590081625323 -0.13450572109592762 -0.97026819604229442
+0.76176104154254864 -1.2796997941879906 -0.72619883181352507  -0.43849581670457011 -0.52986930552536771 -0.72592006295091238
+0.54378773443876982 -1.1449848817576367 -0.64294043714010041  -0.6561306451190958 -0.39536358442943981 -0.64279095563231481
+0.8858993517791276 -0.5452985213173509 -0.92705883708228842  -0.31413755092319801 0.20429513892774237 -0.92713596376716478
+0.66792604467534844 -0.68001343374770507 -0.84380044240886354  -0.53177237933772359 0.06978941783181529 -0.84400685644856743
+0.9610594275501394 0.20306848001363986 -0.18186355091081907  -0.23241575440058929 0.95608513245170457 -0.1785612965096621
+0.24152064540259116 -0.94857068261001021 -0.2007220816032094  -0.95922670283599787 -0.19909668302557726 -0.20061067612316394
+0.80501511824236338 -0.1070595628598997 -0.65621226556123025  -0.39536358442943881 0.64279095563231414 -0.65613064511909702
+0.25313054028719528 -0.92991689161909552 -0.26460466631117996  -0.95170604908224066 -0.1577894156506604 -0.2633592535850886
+1.0652850875696456 0.22031291378210283 0.20086000526876321  -0.1345057210959279 0.97026819604229442 0.20121590081625326
+1.3347149124303548 0.22031291378210283 0.20086000526876321  0.13450572109592795 0.97026819604229431 0.20121590081625346
+1.2699865662522949 0.093800442408863538 -0.53207395532465163  0.069789417831814513 0.84400685644856788 -0.53177237933772292
+1.4047014786826493 0.1770588370822882 -0.31410064822087264  0.20429513892774448 0.92713596376716378 -0.31413755092319973
+2.0438004424088634 -0.21792604467534848 -0.069986566252294824  0.84400685644856688 0.53177237933772448 -0.069789417831814568
+2.1270588370822883 -0.43589935177912753 -0.20470147868264921  0.92713596376716478 0.31413755092319684 -0.20429513892774426
+2.0438004424088634 -1.2820739553246514 0.069986566252294838  0.84400685644856721 -0.5317723793377237 0.069789417831815623
+2.1270588370822883 -1.0641006482208724 0.20470147868264912  0.92713596376716378 -0.31413755092319856 0.20429513892774603
+1.732073955324652 -0.81998656625229482 0.84380044240886309  0.53177237933772414 -0.069789417831814651 0.84400685644856699
+1.514100648220873 -0.95470147868264921 0.92705883708228798  0.31413755092319934 -0.2042951389277432 0.92713596376716423
+1.7296997941879915 -1.4761988318135248 0.43823895845745114  0.52986930552536926 -0.72592006295091094 0.43849581670457061
+1.5949848817576373 -1.3929404371401 0.65621226556123013  0.39536358442944053 -0.64279095563231414 0.65613064511909591
+0.80501511824236371 -1.3929404371401006 0.65621226556123013  -0.39536358442944214 -0.64279095563231292 0.65613064511909625
+0.67030020581200889 -1.4761988318135248 0.4382389584574512  -0.52986930552536993 -0.72592006295091094 0.43849581670456983
+1.3347149124303548 -1.7203129137821027 0.20086000526876327  0.13450572109592701 -0.97026819604229453 0.20121590081625307
+1.0652850875696458 -1.7203129137821027 0.20086000526876327  -0.13450572109592926 -0.97026819604229408 0.20121590081625365
+0.67030020581200889 -1.4761988318135248 -0.4382389584574512  -0.52986930552536993 -0.72592006295091061 -0.43849581670457033
+0.80501511824236327 -1.3929404371401002 -0.65621226556123036  -0.39536358442943859 -0.64279095563231625 -0.65613064511909513
+1.4047014786826493 -1.6770588370822881 -0.31410064822087269  0.20429513892774337 -0.92713596376716467 -0.31413755092319789
+1.2699865662522944 -1.5938004424088634 -0.53207395532465185  0.069789417831815234 -0.84400685644856699 -0.53177237933772403
+1.514100648220873 -0.95470147868264899 -0.92705883708228809  0.3141375509231995 -0.2042951389277432 -0.92713596376716412
+1.732073955324652 -0.81998656625229471 -0.8438004424088632  0.53177237933772337 -0.069789417831814263 -0.84400685644856743
+1.8429404371401004 -1.4062122655612304 -0.39498488175763669  0.64279095563231414 -0.6561306451190958 -0.3953635844294407
+1.926198831813525 -1.1882389584574511 -0.52969979418799096  0.72592006295091149 -0.43849581670457138 -0.52986930552536793
+2.1703129137821029 -0.54913999473123687 -0.13471491243035441  0.97026819604229408 0.20121590081625459 -0.13450572109592798
+2.1703129137821029 -0.54913999473123698 0.13471491243035433  0.97026819604229431 0.2012159008162539 0.13450572109592773
+2.1703129137821029 -0.95086000526876302 0.13471491243035433  0.97026819604229431 -0.20121590081625354 0.13450572109592776
+2.1703129137821029 -0.9508600052687628 -0.13471491243035436  0.97026819604229431 -0.20121590081625354 -0.13450572109592784
+1.926198831813525 -0.31176104154254891 -0.52969979418799096  0.7259200629509126 0.43849581670456972 -0.52986930552536771
+1.8429404371401004 -0.093787734438769865 -0.39498488175763657  0.64279095563231414 0.65613064511909647 -0.39536358442943975
+1.130013433747705 -1.5938004424088636 -0.53207395532465152  -0.069789417831815748 -0.84400685644856654 -0.5317723793377247
+0.99529852131735097 -1.6770588370822881 -0.31410064822087269  -0.2042951389277417 -0.92713596376716501 -0.31413755092319773
+0.35619955759113631 -1.2820739553246514 -0.069986566252294852  -0.84400685644856743 -0.53177237933772326 -0.069789417831815789
+0.27294116291771175 -1.0641006482208724 -0.20470147868264923  -0.92713596376716412 -0.31413755092319912 -0.2042951389277439
+0.473801168186475 -1.1882389584574511 -0.52969979418799107  -0.72592006295091005 -0.43849581670457194 -0.52986930552536937
+0.55705956285989966 -1.4062122655612304 -0.39498488175763657  -0.64279095563231292 -0.65613064511909647 -0.39536358442944169
+0.55705956285989966 -1.4062122655612304 0.39498488175763669  -0.64279095563231348 -0.65613064511909613 0.39536358442944119
+0.473801168186475 -1.1882389584574511 0.52969979418799107  -0.72592006295091183 -0.43849581670457038 0.52986930552536815
+0.27294116291771175 -1.0641006482208724 0.20470147868264923  -0.92713596376716456 -0.31413755092319806 0.20429513892774345
+0.35619955759113631 -1.2820739553246514 0.069986566252294852  -0.84400685644856754 -0.53177237933772326 0.069789417831815165
+0.99529852131735064 -1.6770588370822881 0.31410064822087264  -0.20429513892774173 -0.92713596376716467 0.31413755092319862
+1.130013433747705 -1.5938004424088634 0.53207395532465174  -0.069789417831815526 -0.84400685644856721 0.53177237933772381
+0.94302798180440095 0.17432848622760783 -0.28050566540029331  -0.23706297888618275 0.92607252553187347 -0.29358273364867121
+0.26758089404998375 -0.9059728893652188 -0.32585692434233748  -0.92464256115119448 -0.19278508535823902 -0.3284357547088565
+0.92600274487022971 0.1474180208074326 -0.34558774394436148  -0.30431345936384574 0.89521176696950633 -0.3255598420096425
+0.92538907765393952 0.14644305776905853 -0.34753041451074101  -0.30595468057193953 0.88059013433293953 -0.36187394041519183
+1.2650724998901954 -0.10056625699618549 0.75762878984770377  0.065515668062195068 0.64992905036579129 0.75716571946238087
+1.3432414582888712 -0.30521524694909546 0.88410882140193769  0.1439907391710285 0.44447864693329603 0.88414105178604119
+1.3620856567445476 -0.68282536162972496 0.984487586431394  0.16230850425355212 0.06710299740137815 0.98445575684574327
+1.5878111467046643 -0.54331933670715005 0.89826812139385248  0.38778432700573384 0.20645471950357114 0.89833165619575706
+1.0735199684457657 -0.13851819872979687 0.78108437977813105  -0.12697533232365837 0.61194488891504961 0.78064122227310295
+1.3264800315542344 -0.13851819872979687 0.78108437977813105  0.12697533232366021 0.61194488891504939 0.78064122227310284
+1.6879855916616429 -0.28105923500562391 0.73618246464930537  0.48809649929758536 0.46907539604897625 0.73602315194220513
+1.6017661266241014 -0.055333745045507365 0.59667643972673035  0.40197239864759948 0.69455121880115733 0.5966714298400102
+1.0567585417111292 -0.30521524694909541 0.88410882140193769  -0.14399073917102842 0.44447864693329731 0.88414105178604063
+1.1349275001098049 -0.10056625699618549 0.75762878984770377  -0.065515668062195692 0.64992905036578974 0.75716571946238231
+1.3395060249225752 0.10675191169903997 0.49650199476975138  0.13935172210219554 0.85685972305470981 0.49635925754815774
+1.0604939750774247 0.10675191169903997 0.49650199476975149  -0.13935172210219546 0.85685972305470937 0.49635925754815863
+1.2379519417336118 -0.37028774683929055 0.92432583806700219  0.037984161450744208 0.37896297887110131 0.92463196144413318
+1.0333029517807015 -0.24380771528505651 0.84615687966832631  -0.167466241981752 0.50593831119476151 0.84615689033529828
+0.28617291708332143 -0.87638371280443894 -0.38483791504434911  -0.91004478602604899 -0.14997570917340258 -0.38642693240085846
+0.71201440833835739 -0.28105923500562369 0.73618246464930526  -0.48809649929758497 0.46907539604897713 0.7360231519422048
+1.3666970482192986 -0.24380771528505651 0.84615687966832631  0.16746624198175161 0.50593831119476174 0.84615689033529817
+1.1620480582663888 -0.37028774683929055 0.92432583806700219  -0.037984161450742508 0.37896297887110225 0.92463196144413284
+0.8121888532953363 -0.54331933670715005 0.89826812139385281  -0.38778432700573306 0.20645471950357169 0.89833165619575717
+1.0379143432554527 -0.68282536162972518 0.98448758643139411  -0.16230850425355139 0.067102997401376957 0.98445575684574349
+1.0333029517807015 -0.24380771528505651 -0.84615687966832631  -0.16746624198175167 0.50593831119476129 -0.84615689033529851
+1.2379519417336118 -0.37028774683929055 -0.92432583806700219  0.037984161450742626 0.3789629788711022 -0.92463196144413284
+1.5878111467046638 -0.54331933670715016 -0.89826812139385259  0.38778432700573329 0.20645471950357297 -0.89833165619575683
+1.3620856567445476 -0.68282536162972518 -0.984487586431394  0.16230850425355339 0.067102997401377248 -0.98445575684574316
+1.1349275001098049 -0.10056625699618549 -0.75762878984770377  -0.06551566806219479 0.64992905036579141 -0.75716571946238087
+1.0567585417111292 -0.30521524694909541 -0.88410882140193792  -0.14399073917102856 0.44447864693329697 -0.88414105178604074
+1.0379143432554527 -0.68282536162972496 -0.98448758643139411  -0.16230850425355162 0.067102997401376596 -0.98445575684574349
+0.8121888532953363 -0.54331933670714994 -0.89826812139385281  -0.38778432700573373 0.20645471950357219 -0.89833165619575683
+1.3264800315542344 -0.13851819872979687 -0.78108437977813105  0.12697533232366065 0.61194488891504883 -0.78064122227310317
+1.0735199684457657 -0.13851819872979687 -0.78108437977813105  -0.12697533232366068 0.61194488891504917 -0.78064122227310306
+0.71201440833835727 -0.28105923500562391 -0.73618246464930537  -0.48809649929758525 0.4690753960489733 -0.73602315194220691
+0.30729748704039861 -0.84278707285381271 -0.43974499787970978  -0.89114360963582673 -0.1077606538006228 -0.44073882118289937
+1.3432414582888714 -0.30521524694909541 -0.88410882140193769  0.14399073917102914 0.44447864693329636 -0.88414105178604097
+1.2650724998901954 -0.10056625699618538 -0.75762878984770354  0.065515668062194235 0.64992905036579218 -0.7571657194623802
+1.0604939750774252 0.10675191169903997 -0.49650199476975138  -0.13935172210219512 0.85685972305470959 -0.49635925754815841
+1.3395060249225752 0.10675191169903997 -0.49650199476975149  0.13935172210219546 0.85685972305470937 -0.49635925754815863
+1.1620480582663888 -0.37028774683929055 -0.92432583806700219  -0.037984161450742703 0.3789629788711022 -0.92463196144413295
+1.366697048219299 -0.24380771528505651 -0.8461568796683262  0.16746624198175181 0.50593831119476096 -0.84615689033529862
+1.6017661266241012 -0.055333745045507476 -0.59667643972673035  0.40197239864759909 0.69455121880115755 -0.59667142984001009
+1.6879855916616431 -0.28105923500562385 -0.73618246464930504  0.4880964992975852 0.46907539604897641 -0.73602315194220502
+1.5797122531607097 -1.6743258380670021 -0.037951941733611459  0.37896297887110303 -0.92463196144413251 -0.037984161450741634
+1.7061922847149438 -1.5961568796683263 0.16669704821929854  0.50593831119475963 -0.84615689033529951 0.16746624198175114
+1.894666254954493 -1.3466764397267299 0.40176612662410111  0.69455121880115811 -0.59667142984000976 0.40197239864759887
+1.6689407649943768 -1.4861824646493051 0.48798559166164246  0.46907539604897658 -0.73602315194220391 0.48809649929758681
+1.7061922847149438 -1.5961568796683263 -0.16669704821929854  0.50593831119476118 -0.84615689033529851 -0.16746624198175206
+1.5797122531607097 -1.6743258380670021 0.037951941733611459  0.37896297887110275 -0.92463196144413262 0.037984161450742147
+1.4066806632928506 -1.6482681213938526 0.38781114670466382  0.20645471950357258 -0.89833165619575639 0.38778432700573445
+1.2671746383702751 -1.734487586431394 0.16208565674454747  0.067102997401377568 -0.98445575684574371 0.16230850425355034
+1.8494337430038148 -1.5076287898477032 -0.065072499890195132  0.6499290503657924 -0.75716571946237987 -0.065515668062194901
+1.644784753050905 -1.6341088214019375 -0.14324145828887103  0.44447864693329742 -0.88414105178604052 -0.1439907391710285
+1.2671746383702751 -1.734487586431394 -0.1620856567445475  0.067102997401377554 -0.9844557568457436 -0.16230850425355034
+1.4066806632928501 -1.6482681213938526 -0.38781114670466388  0.20645471950357133 -0.89833165619575706 -0.38778432700573379
+1.8114818012702036 -1.5310843797781306 0.12648003155423412  0.61194488891505039 -0.78064122227310206 0.12697533232366004
+1.8114818012702032 -1.5310843797781311 -0.12648003155423404  0.61194488891505039 -0.78064122227310195 -0.12697533232366071
+1.6689407649943762 -1.4861824646493054 -0.48798559166164257  0.46907539604897536 -0.73602315194220458 -0.48809649929758692
+1.8946662549544926 -1.3466764397267301 -0.40176612662410144  0.69455121880115889 -0.59667142984000843 -0.40197239864759948
+1.644784753050905 -1.6341088214019375 0.14324145828887103  0.44447864693329797 -0.88414105178604019 0.14399073917102917
+1.8494337430038148 -1.5076287898477032 0.065072499890195132  0.64992905036579174 -0.75716571946238065 0.065515668062194485
+2.05675191169904 -1.2465019947697511 -0.13950602492257502  0.85685972305470937 -0.49635925754815885 -0.13935172210219485
+2.05675191169904 -1.2465019947697513 0.13950602492257499  0.85685972305470992 -0.49635925754815841 0.13935172210219243
+1.9576287898477038 -0.68492750010980474 0.64943374300381451  0.75716571946238143 0.065515668062194721 0.64992905036579074
+2.0841088214019377 -0.60675854171112908 0.44478475305090454  0.88414105178604185 0.1439907391710267 0.44447864693329542
+2.184487586431394 -0.58791434325545278 0.067174638370274917  0.98445575684574316 0.16230850425355473 0.067102997401375208
+2.0982681213938523 -0.36218885329533629 0.20668066329284998  0.8983316561957565 0.38778432700573418 0.20645471950357294
+1.2379519417336116 -1.1297122531607096 -0.92432583806700219  0.037984161450743827 -0.37896297887110214 -0.92463196144413284
+1.0333029517807015 -1.2561922847149436 -0.84615687966832631  -0.16746624198175092 -0.50593831119476174 -0.8461568903352984
+0.79823387337589879 -1.4446662549544924 -0.59667643972673035  -0.40197239864759976 -0.69455121880115789 -0.59667142984000954
+0.71201440833835727 -1.2189407649943762 -0.73618246464930548  -0.48809649929758536 -0.46907539604897658 -0.73602315194220491
+0.88317063762809189 0.078036377421090597 -0.46105412139556579  -0.30871603125498165 0.82882275556678564 -0.46663395922377265
+0.85822228618686602 0.038871133598592081 -0.51061830246204121  -0.34181621487256764 0.80836571705726512 -0.47927710433180942
+0.30173187860614725 -1.1378111467046637 -0.20668066329285001  -0.8983316561957575 -0.38778432700573268 -0.20645471950357161
+0.85756840681366708 0.037892913779084561 -0.51176714118576794  -0.37438115159300894 0.78669229841288646 -0.49087063565642458
+0.85711100340627266 0.037134436368273085 -0.51257565524045945  -0.37394295240641229 0.76556189758093773 -0.52352807882466956
+0.4189156202218689 -0.87648003155423404 0.61148180127020324  -0.78064122227310373 -0.12697533232365851 0.61194488891504861
+0.4638175353506947 -1.2379855916616427 0.46894076499437615  -0.7360231519422048 -0.48809649929758536 0.46907539604897669
+0.60332356027326994 -1.1517661266241017 0.69466625495449275  -0.59667142984000954 -0.40197239864759987 0.69455121880115778
+0.37506412073313466 -0.73422479552976916 -0.56417193374348928  -0.82793015848818508 0.02987930722740377 -0.56003471291102958
+0.69607577061268988 -0.22054081151140004 -0.68235511400187066  -0.51008352708668259 0.5567486374361299 -0.65562622744046961
+0.69531998299352837 -0.2217116289121196 -0.68272481536695306  -0.53557400721094017 0.52649133823230443 -0.66027823950693165
+0.49314081475211935 -0.54531814984023863 -0.67677227421098896  -0.71657063832563506 0.23106145751844359 -0.65813153938938718
+1.0333029517807018 -1.2561922847149436 0.84615687966832642  -0.16746624198175139 -0.50593831119476218 0.84615689033529806
+1.2379519417336118 -1.1297122531607096 0.92432583806700219  0.037984161450743785 -0.3789629788711022 0.92463196144413284
+1.5878111467046638 -0.95668066329284995 0.89826812139385259  0.38778432700573395 -0.20645471950357216 0.89833165619575672
+1.3620856567445476 -0.81717463837027482 0.984487586431394  0.16230850425355228 -0.067102997401377873 0.98445575684574327
+2.0841088214019381 -0.8932414582888708 0.44478475305090431  0.88414105178604174 -0.14399073917102748 0.44447864693329536
+1.9576287898477038 -0.81507249989019503 0.64943374300381418  0.75716571946238109 -0.065515668062195317 0.64992905036579107
+1.6965019947697519 -0.61049397507742498 0.85675191169903975  0.4963592575481578 0.13935172210219332 0.85685972305471014
+1.6965019947697517 -0.88950602492257513 0.85675191169903986  0.49635925754815879 -0.13935172210219521 0.85685972305470925
+1.9810843797781312 -0.87648003155423393 0.61148180127020291  0.78064122227310251 -0.12697533232365874 0.61194488891505017
+1.981084379778131 -0.62351996844576596 0.61148180127020324  0.78064122227310451 0.12697533232365912 0.61194488891504761
+1.9361824646493055 -0.26201440833835754 0.46894076499437615  0.73602315194220469 0.48809649929758597 0.46907539604897625
+1.7966764397267303 -0.34823387337589884 0.69466625495449263  0.59667142984000987 0.40197239864759826 0.69455121880115844
+1.8114818012702028 0.031084379778131277 -0.12648003155423412  0.61194488891504883 0.78064122227310351 -0.12697533232365837
+1.8114818012702028 0.031084379778131277 0.1264800315542341  0.61194488891504928 0.78064122227310329 0.12697533232365824
+1.6689407649943762 -0.013817535350694743 0.48798559166164268  0.46907539604897719 0.73602315194220391 0.48809649929758614
+1.8946662549544926 -0.15332356027326977 0.40176612662410138  0.69455121880115822 0.59667142984000932 0.40197239864759937
+1.8494337430038144 0.0076287898477036542 0.06507249989019516  0.64992905036579107 0.7571657194623812 0.065515668062194943
+1.644784753050905 0.13410882140193758 0.14324145828887103  0.44447864693329647 0.88414105178604085 0.14399073917102947
+1.2671746383702749 0.23448758643139411 0.16208565674454739  0.067102997401376929 0.9844557568457436 0.16230850425355112
+1.4066806632928499 0.14826812139385259 0.38781114670466377  0.20645471950357358 0.8983316561957565 0.38778432700573373
+0.48978532609687886 -0.55056521742650477 -0.67476755984413894  -0.73148064944405733 0.19693655197206733 -0.65280322761629583
+0.61696807586665503 -0.34742682425518878 -0.70495163176324005  -0.5657510681692498 0.40400744901774482 -0.71882105562060938
+0.99331933670715 0.14826812139385259 0.38781114670466377  -0.20645471950357225 0.89833165619575683 0.38778432700573368
+1.132825361629725 0.23448758643139411 0.16208565674454739  -0.067102997401376499 0.98445575684574338 0.16230850425355248
+0.76687916779802356 -0.10789205109760849 0.63136143448574888  -0.42807141203226429 0.64268086340021879 0.63538663349165025
+0.73203596503112123 -0.16333083529035372 0.66003296952840662  -0.48378799724665117 0.58634540105761479 0.64972936241073409
+0.69531998299352837 -0.22171162891211948 0.68272481536695295  -0.53557400721089998 0.52649133823231298 0.66027823950695741
+0.49314081475211924 -0.54531814984023841 0.67677227421098896  -0.71657063832563861 0.23106145751843574 0.65813153938938596
+0.50622685812276469 -0.5257151024560045 0.68341702461536258  -0.68956138101064823 0.23429135260019798 0.6852829079405508
+0.80104197563456969 -0.053122466844444549 0.59574101077153174  -0.37119418317776498 0.71962089011270347 0.58682250543788128
+0.74532674141002397 -0.14250706129079604 0.65018159643527595  -0.45629539576529471 0.61497179190323714 0.64312067838525833
+0.69607577061268988 -0.22054081151139987 0.68235511400187043  -0.51008352708665927 0.55674863743613534 0.65562622744048316
+0.48978532609687886 -0.55056521742650477 0.67476755984413894  -0.73148064944406666 0.19693655197206644 0.65280322761628573
+0.4423712101522963 -0.68492750010980474 0.64943374300381473  -0.75716571946238165 0.065515668062194721 0.64992905036579052
+0.70349800523024886 -0.88950602492257524 0.85675191169903997  -0.4963592575481578 -0.13935172210219493 0.85685972305470992
+0.70349800523024875 -0.61049397507742498 0.85675191169904008  -0.49635925754815841 0.1393517221021956 0.85685972305470948
+1.1349275001098049 -1.3994337430038146 0.75762878984770365  -0.065515668062193971 -0.64992905036579174 0.75716571946238065
+1.0567585417111292 -1.1947847530509048 0.88410882140193769  -0.14399073917102845 -0.44447864693329675 0.88414105178604085
+1.0379143432554527 -0.81717463837027482 0.98448758643139411  -0.1623085042535517 -0.06710299740137679 0.98445575684574349
+0.81218885329533652 -0.95668066329285006 0.89826812139385281  -0.3877843270057334 -0.20645471950357266 0.89833165619575683
+2.0841088214019377 -0.60675854171112875 -0.4447847530509047  0.8841410517860413 0.14399073917102739 -0.44447864693329625
+1.9576287898477038 -0.68492750010980474 -0.64943374300381451  0.75716571946238087 0.065515668062195193 -0.64992905036579141
+1.6965019947697517 -0.88950602492257502 -0.85675191169903986  0.4963592575481578 -0.1393517221021954 -0.85685972305470981
+1.6965019947697517 -0.61049397507742487 -0.85675191169903986  0.49635925754815935 0.13935172210219479 -0.85685972305470903
+1.2650724998901952 -1.3994337430038146 -0.75762878984770365  0.065515668062195276 -0.64992905036579218 -0.7571657194623802
+1.343241458288871 -1.1947847530509048 -0.88410882140193769  0.14399073917102839 -0.44447864693329625 -0.88414105178604108
+1.3620856567445476 -0.81717463837027482 -0.984487586431394  0.16230850425355228 -0.067102997401377873 -0.98445575684574327
+1.5878111467046643 -0.95668066329284984 -0.89826812139385248  0.38778432700573462 -0.20645471950357236 -0.89833165619575639
+1.3666970482192984 -1.2561922847149436 -0.84615687966832631  0.16746624198175147 -0.50593831119476262 -0.84615689033529773
+1.1620480582663888 -1.1297122531607096 -0.92432583806700219  -0.037984161450743952 -0.3789629788711022 -0.92463196144413284
+0.8121888532953363 -0.95668066329284995 -0.89826812139385281  -0.38778432700573318 -0.20645471950357211 -0.89833165619575706
+1.0379143432554525 -0.81717463837027482 -0.984487586431394  -0.1623085042535517 -0.067102997401376374 -0.98445575684574349
+0.31589117859806226 -0.89324145828887092 -0.44478475305090459  -0.88414105178604019 -0.14399073917102886 -0.44447864693329792
+0.4423712101522963 -0.81507249989019515 -0.64943374300381473  -0.75716571946238154 -0.065515668062196011 -0.64992905036579063
+0.70349800523024875 -0.61049397507742498 -0.85675191169904008  -0.49635925754815741 0.13935172210219424 -0.85685972305471025
+0.70349800523024875 -0.88950602492257502 -0.85675191169904008  -0.49635925754815852 -0.13935172210219521 -0.85685972305470948
+0.41891562022186868 -0.87648003155423404 -0.61148180127020324  -0.78064122227310406 -0.12697533232365943 -0.61194488891504806
+0.30729748704039866 -0.84278707285381271 0.43974499787970989  -0.89114360963582573 -0.10776065380062243 0.44073882118290153
+0.45944041532897167 -0.59972505245462004 0.65399889841309089  -0.74496666446894599 0.16330181399315546 0.64680536978024361
+0.22589145876869662 -0.97323020415808847 -0  -0.97034898997513452 -0.24170816629612682 -1.7351406520252288e-18
+0.42861413394522369 -0.64891100701386606 0.62717432611494872  -0.76918721291849634 0.096596587118422922 0.6316804024502809
+0.39411849558532497 -0.70426794627197542 0.58956860097969033  -0.81036094014927595 0.030667519535218936 0.58512789193982073
+0.40065939257699124 -0.69413734830776375 0.59790562905682232  -0.79006130932899898 0.031934562996056987 0.61219548445541361
+0.40435813432554857 -0.6879005781223142 0.60211592452938867  -0.77995892884278528 0.063643445898665135 0.62258620376021723
+0.83001349060802165 -0.0073066631575244463 0.55678551944213661  -0.37302523877669125 0.74314518846920219 0.55550643568789215
+0.88317063762809178 0.078036377421090528 0.46105412139556579  -0.30871603125498187 0.82882275556678742 0.46663395922376916
+1.1328253616297255 0.23448758643139411 -0.16208565674454739  -0.06710299740137636 0.98445575684574338 -0.16230850425355245
+0.99331933670714989 0.14826812139385259 -0.38781114670466377  -0.2064547195035718 0.89833165619575706 -0.38778432700573351
+1.7061922847149438 0.096156879668326201 0.16669704821929851  0.5059383111947624 0.84615689033529762 0.16746624198175261
+1.5797122531607097 0.17432583806700197 -0.037951941733611452  0.37896297887110231 0.92463196144413273 -0.037984161450742869
+1.4066806632928499 0.14826812139385259 -0.38781114670466377  0.20645471950357397 0.89833165619575661 -0.38778432700573345
+1.2671746383702751 0.234487586431394 -0.16208565674454736  0.067102997401377096 0.98445575684574349 -0.16230850425355106
+1.5797122531607097 0.17432583806700197 0.037951941733611452  0.37896297887110236 0.92463196144413273 0.037984161450742897
+1.7061922847149438 0.096156879668326201 -0.16669704821929851  0.50593831119476229 0.84615689033529762 -0.16746624198175269
+1.8946662549544926 -0.15332356027326977 -0.40176612662410138  0.694551218801158 0.59667142984000943 -0.40197239864759959
+1.6689407649943766 -0.013817535350694743 -0.48798559166164251  0.46907539604897602 0.73602315194220491 -0.48809649929758575
+2.1243258380670023 -0.78795194173361138 -0.37971225316070939  0.92463196144413207 -0.037984161450740968 -0.37896297887110436
+2.0461568796683265 -0.58330295178070157 -0.50619228471494349  0.84615689033529629 0.16746624198175158 -0.50593831119476507
+1.7966764397267307 -0.34823387337589884 -0.6946662549544923  0.59667142984001131 0.40197239864759826 -0.69455121880115711
+1.9361824646493055 -0.26201440833835749 -0.46894076499437609  0.73602315194220491 0.48809649929758581 -0.46907539604897613
+2.1243258380670023 -0.71204805826638851 0.37971225316070928  0.92463196144413196 0.037984161450741689 0.37896297887110458
+2.0461568796683265 -0.91669704821929832 0.50619228471494315  0.84615689033529806 -0.16746624198175214 0.50593831119476163
+1.7966764397267307 -1.1517661266241008 0.6946662549544923  0.59667142984001087 -0.40197239864759859 0.69455121880115722
+1.9361824646493058 -1.2379855916616425 0.46894076499437604  0.73602315194220613 -0.48809649929758475 0.46907539604897519
+1.1620480582663888 -1.1297122531607096 0.92432583806700219  -0.037984161450743834 -0.3789629788711022 0.92463196144413284
+1.366697048219299 -1.2561922847149434 0.8461568796683262  0.16746624198175136 -0.50593831119476185 0.84615689033529817
+1.6017661266241021 -1.4446662549544924 0.59667643972673023  0.40197239864759998 -0.69455121880115755 0.59667142984000965
+1.6879855916616431 -1.2189407649943764 0.73618246464930504  0.48809649929758564 -0.46907539604897819 0.73602315194220369
+1.3432414582888712 -1.1947847530509048 0.88410882140193758  0.14399073917102836 -0.44447864693329742 0.88414105178604063
+1.2650724998901954 -1.3994337430038146 0.75762878984770343  0.065515668062195984 -0.64992905036579063 0.75716571946238143
+1.0604939750774252 -1.6067519116990399 0.49650199476975138  -0.13935172210219554 -0.85685972305470992 0.49635925754815763
+1.3395060249225756 -1.6067519116990399 0.49650199476975138  0.13935172210219615 -0.85685972305471048 0.49635925754815646
+0.55056625699618522 -1.5076287898477037 0.06507249989019516  -0.64992905036579063 -0.75716571946238176 0.065515668062193319
+0.75521524694909514 -1.6341088214019377 0.14324145828887108  -0.44447864693329719 -0.88414105178604041 0.14399073917102923
+1.1328253616297252 -1.7344875864313942 0.1620856567445475  -0.06710299740137686 -0.98445575684574349 0.16230850425355189
+0.99331933670714978 -1.6482681213938526 0.38781114670466388  -0.20645471950357261 -0.89833165619575661 0.3877843270057339
+0.69380771528505625 -1.5961568796683263 0.16669704821929854  -0.50593831119476085 -0.84615689033529895 0.16746624198175111
+0.8202877468392904 -1.6743258380670021 -0.037951941733611466  -0.37896297887110214 -0.92463196144413284 -0.037984161450743383
+0.99331933670715045 -1.648268121393853 -0.38781114670466399  -0.20645471950357216 -0.89833165619575694 -0.3877843270057334
+1.132825361629725 -1.7344875864313942 -0.16208565674454753  -0.067102997401376846 -0.98445575684574349 -0.16230850425355181
+1.0567585417111292 -1.1947847530509048 -0.88410882140193769  -0.14399073917102848 -0.44447864693329681 -0.88414105178604085
+1.1349275001098047 -1.3994337430038146 -0.75762878984770343  -0.065515668062195553 -0.64992905036579085 -0.75716571946238131
+1.3395060249225752 -1.6067519116990399 -0.49650199476975138  0.13935172210219487 -0.85685972305471048 -0.49635925754815685
+1.0604939750774247 -1.6067519116990399 -0.49650199476975149  -0.13935172210219574 -0.85685972305470981 -0.49635925754815791
+1.0735199684457657 -1.361481801270203 -0.78108437977813105  -0.12697533232365951 -0.61194488891504895 -0.7806412222731034
+1.3264800315542338 -1.361481801270203 -0.78108437977813105  0.12697533232366054 -0.61194488891504906 -0.78064122227310306
+1.6879855916616426 -1.2189407649943764 -0.73618246464930526  0.48809649929758481 -0.46907539604897808 -0.73602315194220436
+1.6017661266241014 -1.4446662549544926 -0.59667643972673035  0.40197239864759937 -0.69455121880115822 -0.5966714298400092
+1.981084379778131 -0.62351996844576596 -0.61148180127020324  0.78064122227310462 0.1269753323236604 -0.61194488891504717
+1.981084379778131 -0.87648003155423404 -0.61148180127020324  0.78064122227310451 -0.12697533232365904 -0.61194488891504761
+1.9361824646493053 -1.2379855916616427 -0.46894076499437609  0.73602315194220447 -0.48809649929758625 -0.46907539604897625
+1.7966764397267303 -1.1517661266241015 -0.69466625495449252  0.59667142984001065 -0.40197239864759915 -0.69455121880115711
+1.9576287898477038 -0.81507249989019503 -0.64943374300381451  0.75716571946238154 -0.06551566806219572 -0.64992905036579063
+2.0841088214019377 -0.89324145828887092 -0.4447847530509047  0.88414105178604063 -0.14399073917102975 -0.44447864693329681
+2.184487586431394 -0.91208565674454722 -0.067174638370274917  0.98445575684574305 -0.16230850425355456 -0.067102997401375694
+2.0982681213938528 -1.1378111467046637 -0.20668066329284984  0.89833165619575694 -0.3877843270057339 -0.20645471950357122
+2.0461568796683265 -0.58330295178070157 0.50619228471494349  0.8461568903352964 0.16746624198175114 0.50593831119476484
+2.1243258380670023 -0.78795194173361149 0.37971225316070928  0.92463196144413196 -0.037984161450741592 0.37896297887110447
+2.0982681213938528 -1.1378111467046632 0.20668066329284987  0.89833165619575794 -0.38778432700573207 0.20645471950357039
+2.184487586431394 -0.91208565674454722 0.067174638370274903  0.98445575684574305 -0.16230850425355453 0.06710299740137543
+2.0461568796683265 -0.91669704821929843 -0.50619228471494349  0.84615689033529751 -0.1674662419817522 -0.50593831119476262
+2.1243258380670023 -0.71204805826638851 -0.37971225316070939  0.92463196144413207 0.037984161450741016 -0.37896297887110436
+2.0982681213938528 -0.36218885329533623 -0.20668066329284998  0.89833165619575639 0.38778432700573406 -0.20645471950357319
+2.184487586431394 -0.58791434325545255 -0.067174638370274903  0.98445575684574316 0.16230850425355467 -0.067102997401375042
+1.644784753050905 0.13410882140193758 -0.143241458288871  0.44447864693329647 0.88414105178604085 -0.14399073917102947
+1.8494337430038144 0.0076287898477036542 -0.06507249989019516  0.64992905036579063 0.75716571946238165 -0.065515668062194693
+2.05675191169904 -0.25349800523024879 0.13950602492257499  0.8568597230547097 0.49635925754815813 0.13935172210219496
+2.05675191169904 -0.25349800523024862 -0.13950602492257505  0.85685972305470925 0.49635925754815879 -0.1393517221021951
+0.8202877468392904 -1.6743258380670021 0.037951941733611466  -0.37896297887110236 -0.92463196144413284 0.037984161450741516
+0.69380771528505636 -1.5961568796683263 -0.16669704821929857  -0.50593831119476029 -0.84615689033529895 -0.16746624198175245
+0.50533374504550721 -1.3466764397267301 -0.40176612662410133  -0.694551218801158 -0.5966714298400092 -0.4019723986475997
+0.73105923500562364 -1.4861824646493054 -0.48798559166164257  -0.46907539604897608 -0.73602315194220536 -0.48809649929758508
+0.85822228618686625 0.03887113359859222 0.51061830246204121  -0.34181621487250108 0.80836571705727955 0.47927710433183263
+0.35384312033167364 -0.91669704821929843 -0.50619228471494349  -0.84615689033529784 -0.16746624198175167 -0.5059383111947624
+0.60332356027326961 -1.151766126624101 -0.69466625495449275  -0.59667142984000965 -0.40197239864759926 -0.694551218801158
+0.46381753535069448 -1.2379855916616425 -0.46894076499437626  -0.7360231519422048 -0.48809649929758558 -0.46907539604897658
+0.75521524694909514 -1.6341088214019377 -0.14324145828887105  -0.44447864693329858 -0.88414105178603974 -0.14399073917102934
+0.55056625699618522 -1.5076287898477037 -0.06507249989019516  -0.64992905036579107 -0.7571657194623812 -0.065515668062194832
+0.34324808830095987 -1.2465019947697513 0.13950602492257511  -0.85685972305470925 -0.49635925754815863 0.13935172210219582
+0.3432480883009601 -1.2465019947697515 -0.13950602492257505  -0.85685972305470937 -0.49635925754815879 -0.13935172210219504
+0.44237121015229641 -0.81507249989019515 0.64943374300381473  -0.75716571946238165 -0.065515668062195415 0.64992905036579052
+0.31589117859806226 -0.89324145828887092 0.44478475305090459  -0.88414105178604041 -0.14399073917102892 0.44447864693329753
+0.60785615600797449 -0.36184045701812123 0.70538094374692573  -0.58682250543788061 0.37119418317777192 0.71962089011270058
+0.30173187860614725 -1.1378111467046637 0.20668066329285004  -0.89833165619575683 -0.38778432700573301 0.20645471950357339
+0.5885181987297966 -1.5310843797781311 -0.12648003155423418  -0.61194488891505017 -0.78064122227310262 -0.12697533232365818
+0.58851819872979683 -1.5310843797781311 0.12648003155423407  -0.61194488891504872 -0.78064122227310384 0.12697533232365801
+0.73105923500562386 -1.4861824646493056 0.48798559166164268  -0.46907539604897658 -0.73602315194220447 0.48809649929758603
+0.50533374504550732 -1.3466764397267301 0.40176612662410144  -0.69455121880115811 -0.59667142984000943 0.40197239864759932
+1.3264800315542344 -1.361481801270203 0.78108437977813105  0.12697533232365971 -0.61194488891504917 0.78064122227310317
+1.0735199684457661 -1.361481801270203 0.78108437977813105  -0.12697533232365837 -0.61194488891504839 0.78064122227310384
+0.71201440833835772 -1.2189407649943766 0.73618246464930526  -0.48809649929758503 -0.46907539604897552 0.7360231519422058
+0.79823387337589868 -1.4446662549544926 0.59667643972673035  -0.40197239864759965 -0.69455121880115789 0.59667142984000932
+0.44237121015229641 -0.68492750010980474 -0.64943374300381462  -0.75716571946238065 0.065515668062196025 -0.64992905036579152
+0.85756840681366708 0.037892913779084658 0.51176714118576794  -0.37438115159293933 0.78669229841287958 0.49087063565648881
+0.33951337109735685 -0.79211156275891992 0.50664961250726281  -0.85780946571559169 -0.048345734654242835 0.51168897825678505
+0.90598861546737153 0.11471241548978531 0.40567809407889893  -0.30717055145208666 0.86468532536853959 0.39744878967349206
+0.35384312033167364 -0.91669704821929843 0.5061922847149436  -0.84615689033529773 -0.16746624198175142 0.50593831119476262
+0.29057971437419006 -0.8695923485436825 0.39708487175152696  -0.9010098816558636 -0.12889639121160246 0.41420636582639847
+0.94691066341902042 0.17998804508785277 0.2643958831644852  -0.23565009060476796 0.93757115374046096 0.25579164660274861
+0.23440017510432309 -0.9594775020158709 0.15035899655759533  -0.96089435748012464 -0.21982881690250275 0.16839633316110023
+1.7894256868089482 -0.54268760819673556 0.78076816785433145  0.58928970592655816 0.20735457304096669 0.78085960551688738
+1.7760838378857438 -0.41005164309557446 0.74334549596053456  0.57610127698437386 0.34013694034011421 0.74324570666303846
+1.6048073899588975 0.071782225985176584 0.40100492526839776  0.40477696304846206 0.82172156155092002 0.40115992505181985
+1.4746684461261839 0.11574218443040096 0.41838703947458178  0.27447137325094773 0.86581974808662088 0.41835586417422094
+0.97011813854669382 0.21732927410114633 -0.099634331047451452  -0.22974865031682512 0.96813269657427847 -0.099672661755434044
+0.22648000271342913 -0.97241808576487487 0.034988854233130556  -0.97444445519669098 -0.22205052462855629 0.033934764602202253
+0.58553016581808792 -0.47712117915505481 0.7402458861856146  -0.61436698850995397 0.27300775118977938 0.74028370995146842
+0.67420617247402481 -0.54171259951203321 0.82471644201722483  -0.52568280774650467 0.20813967421463528 0.8248245035506504
+1.1594777183312834 -0.88192856911395234 0.99043061207734606  -0.040575895565417713 -0.13176921185868196 0.99044963097837846
+1.2813709460566907 -0.81638104563821712 0.9944708773603258  0.08157879688761327 -0.066331699036313224 0.99445714115859496
+1.2405222816687171 -0.88192856911395234 -0.99043061207734606  0.040575895565419177 -0.13176921185868273 -0.99044963097837824
+1.1186290539433099 -0.81638104563821712 -0.9944708773603258  -0.081578796887611563 -0.066331699036312169 -0.99445714115859518
+0.61057431319105182 -0.54268760819673556 -0.78076816785433145  -0.58928970592655905 0.20735457304096611 -0.78085960551688693
+0.62391616211425605 -0.4100516430955744 -0.74334549596053467  -0.57610127698437219 0.34013694034011444 -0.74324570666303968
+0.44633019100468213 -0.6204277684668269 0.64334361719230826  -0.75782534074317609 0.12946239417784172 0.63948435588466901
+0.92533155387381627 0.11574218443040096 -0.41838703947458178  -0.27447137325094867 0.86581974808661977 -0.4183558641742226
+1.5392409609172171 0.11230450765389333 -0.37596077789543397  0.3391237848996484 0.86229745711633887 -0.37608264246842421
+1.6063294025426431 0.034371238373710589 -0.46867704983435055  0.40646863937642885 0.78424095119900827 -0.46877433341209029
+1.8144698341819121 -0.47712117915505486 -0.74024588618561449  0.61436698850995375 0.27300775118977783 -0.74028370995146908
+1.7257938275259752 -0.54171259951203332 -0.8247164420172246  0.52568280774650511 0.208139674214634 -0.82482450355065062
+1.4728788208449455 -1.4902458861856145 0.61446983418191214  0.27300775118977938 -0.74028370995146853 0.61436698850995375
+1.4082874004879673 -1.5747164420172246 0.52579382752597537  0.20813967421463753 -0.82482450355064973 0.52568280774650489
+1.0680714308860475 -1.7404306120773461 0.040522281668716881  -0.13176921185868209 -0.99044963097837846 0.040575895565416957
+1.1336189543617827 -1.7444708773603259 -0.081370946056690305  -0.066331699036311975 -0.99445714115859518 -0.081578796887612326
+1.4073123918032646 -1.5307681678543315 -0.58942568680894825  0.20735457304096758 -0.78085960551688605 -0.5892897059265596
+1.5399483569044259 -1.4933454959605346 -0.57608383788574391  0.34013694034011616 -0.74324570666303846 -0.57610127698437275
+2.0217822259851768 -1.1510049252683974 -0.40480738995889748  0.82172156155091891 -0.40115992505181947 -0.40477696304846428
+2.0657421844304009 -1.1683870394745819 -0.27466844612618391  0.8658197480866201 -0.41835586417422149 -0.27447137325094928
+2.0623045076538937 -1.1259607778954335 0.33924096091721662  0.86229745711633854 -0.37608264246842521 0.33912378489964823
+1.9843712383737109 -1.2186770498343504 0.4063294025426426  0.7842409511990085 -0.46877433341209024 0.40646863937642835
+1.9807681678543314 -0.16057431319105187 0.20731239180326444  0.78085960551688671 0.58928970592655905 0.20735457304096724
+1.9433454959605347 -0.17391616211425609 0.33994835690442565  0.7432457066630388 0.5761012769843723 0.34013694034011616
+0.58553016581808792 -1.0228788208449453 -0.7402458861856146  -0.61436698850995408 -0.27300775118978016 -0.74028370995146797
+0.67420617247402481 -0.95828740048796679 -0.82471644201722483  -0.52568280774650533 -0.20813967421463467 -0.82482450355065018
+0.22648000271342919 -0.97241808576487498 -0.034988854233130702  -0.97444445519669121 -0.2220505246285554 -0.033934764602202044
+0.97256579272521637 0.22114863140943242 -0.060907607905721597  -0.22895713509379073 0.97158621857248995 -0.05999041731521329
+0.79899507473160258 -1.1548073899588978 0.82178222598517658  -0.4011599250518188 -0.40477696304846206 0.82172156155092035
+0.78161296052541851 -1.0246684461261841 0.86574218443040096  -0.41835586417422171 -0.274471373250948 0.86581974808662043
+0.23052646968895496 -0.9659260788205124 -0.10986054425367295  -0.96991439832021331 -0.22132188318768922 -0.10140356972707359
+0.89637854466934042 0.099164106023202803 0.43023759412454371  -0.30820444126016328 0.84736796744948673 0.43240900791731435
+1.2405222816687171 -0.61807143088604766 0.99043061207734606  0.040575895565417304 0.13176921185868257 0.99044963097837835
+1.1186290539433099 -0.68361895436178266 0.9944708773603258  -0.081578796887611715 0.066331699036312697 0.99445714115859518
+1.5759607778954345 -1.0892409609172169 0.86230450765389322  0.37608264246842527 -0.33912378489964723 0.86229745711633898
+1.6686770498343511 -1.1563294025426427 0.78437123837371048  0.46877433341208979 -0.40646863937642735 0.78424095119900927
+1.6010049252683982 -0.34519261004110269 0.82178222598517647  0.40115992505181947 0.4047769630484615 0.82172156155092035
+1.6183870394745821 -0.4753315538738162 0.86574218443040085  0.41835586417422244 0.27447137325094906 0.86581974808661977
+2.0217822259851763 -0.34899507473160229 0.40480738995889742  0.82172156155091947 0.4011599250518208 0.404776963048462
+2.0657421844304009 -0.33161296052541811 0.27466844612618396  0.86581974808662043 0.41835586417422121 0.27447137325094878
+1.4073123918032646 0.030768167854331341 0.58942568680894825  0.20735457304096602 0.78085960551688716 0.58928970592655872
+1.5399483569044259 -0.0066545040394655475 0.57608383788574402  0.34013694034011532 0.7432457066630388 0.57610127698437286
+1.3319285691139524 0.24043061207734606 0.040522281668716874  0.13176921185868176 0.99044963097837846 0.040575895565417866
+1.2663810456382176 0.24447087736032569 -0.081370946056690249  0.06633169903631346 0.99445714115859496 -0.081578796887612909
+0.92712117915505499 -0.0097541138143855122 0.61446983418191226  -0.27300775118977944 0.74028370995146875 0.61436698850995353
+0.99171259951203328 0.074716442017224605 0.52579382752597525  -0.20813967421463495 0.82482450355065018 0.52568280774650544
+0.95663400990185354 0.19602936533555493 -0.2109426096162656  -0.2338856613018607 0.9476428056300582 -0.21741805439057521
+0.23440017510432298 -0.95947750201587068 -0.15035899655759499  -0.96089435748012531 -0.21982881690250236 -0.16839633316109734
+0.82403922210456626 -0.41075903908278316 0.86230450765389344  -0.37608264246842471 0.33912378489964923 0.86229745711633832
+0.7313229501656493 -0.34367059745735706 0.78437123837371059  -0.46877433341208918 0.40646863937642791 0.78424095119900927
+0.61057431319105182 -0.95731239180326477 0.78076816785433145  -0.58928970592655894 -0.20735457304096766 0.7808596055168866
+0.62391616211425616 -1.0899483569044262 0.74334549596053456  -0.5761012769843723 -0.34013694034011405 0.7432457066630398
+1.5759607778954345 -0.41075903908278322 -0.86230450765389333  0.37608264246842582 0.33912378489964795 -0.86229745711633854
+1.6686770498343511 -0.34367059745735712 -0.78437123837371048  0.46877433341208957 0.40646863937642819 -0.78424095119900894
+1.7894256868089482 -0.95731239180326444 -0.78076816785433145  0.58928970592655905 -0.20735457304096702 -0.7808596055168866
+1.7760838378857438 -1.0899483569044257 -0.74334549596053456  0.57610127698437363 -0.34013694034011327 -0.74324570666303913
+1.1594777183312832 -0.61807143088604766 -0.99043061207734606  -0.040575895565417359 0.13176921185868248 -0.99044963097837835
+1.2813709460566907 -0.68361895436178266 -0.9944708773603258  0.081578796887612035 0.066331699036312766 -0.99445714115859507
+0.82403922210456604 -1.0892409609172167 -0.86230450765389355  -0.3760826424684251 -0.33912378489964973 -0.86229745711633798
+0.7313229501656493 -1.1563294025426427 -0.78437123837371059  -0.4687743334120904 -0.40646863937642796 -0.78424095119900861
+0.79899507473160236 -0.34519261004110258 -0.82178222598517681  -0.40115992505181919 0.40477696304846128 -0.82172156155092069
+0.78161296052541818 -0.47533155387381615 -0.86574218443040096  -0.41835586417422232 0.27447137325094867 -0.86581974808661999
+0.26660413751883788 -0.90759811547986158 -0.32187126056253335  -0.9389351707936171 -0.17584665747242048 -0.29576798018470224
+0.90598861546737175 0.11471241548978534 -0.40567809407889899  -0.30717055145208433 0.86468532536854059 -0.39744878967349201
+0.9926876081967354 0.030768167854331341 -0.58942568680894825  -0.20735457304096647 0.78085960551688738 -0.58928970592655838
+0.86005164309557414 -0.0066545040394655475 -0.57608383788574402  -0.34013694034011627 0.7432457066630378 -0.57610127698437363
+1.0680714308860475 0.24043061207734606 -0.040522281668716874  -0.13176921185868209 0.99044963097837835 -0.040575895565418345
+1.1336189543617827 0.24447087736032569 0.081370946056690249  -0.066331699036312516 0.99445714115859507 0.081578796887611868
+1.4728788208449453 -0.0097541138143856232 -0.61446983418191214  0.27300775118978082 0.74028370995146775 -0.61436698850995386
+1.4082874004879666 0.074716442017224605 -0.52579382752597525  0.20813967421463389 0.82482450355065062 -0.525682807746505
+1.9402458861856144 -0.13553016581808797 -0.27287882084494514  0.74028370995146886 0.61436698850995319 -0.27300775118977955
+2.0247164420172248 -0.22420617247402475 -0.20828740048796671  0.82482450355065107 0.52568280774650455 -0.20813967421463353
+1.9402458861856147 -1.3644698341819117 0.27287882084494514  0.74028370995146797 -0.61436698850995408 0.27300775118977982
+2.0247164420172248 -1.275793827525975 0.20828740048796673  0.82482450355064985 -0.52568280774650611 0.20813967421463409
+1.8144698341819121 -1.0228788208449451 0.74024588618561449  0.61436698850995419 -0.27300775118977977 0.74028370995146808
+1.7257938275259752 -0.95828740048796668 0.8247164420172246  0.52568280774650455 -0.20813967421463375 0.82482450355065096
+1.5392409609172173 -1.6123045076538933 0.37596077789543392  0.33912378489965 -0.86229745711633787 0.37608264246842532
+1.6063294025426436 -1.5343712383737103 0.46867704983435066  0.4064686393764288 -0.78424095119900805 0.46877433341209074
+0.9926876081967354 -1.5307681678543315 0.58942568680894825  -0.20735457304096644 -0.78085960551688738 0.58928970592655838
+0.86005164309557425 -1.4933454959605346 0.57608383788574391  -0.34013694034011555 -0.74324570666303802 0.57610127698437374
+1.3319285691139524 -1.7404306120773461 -0.040522281668716881  0.13176921185868326 -0.99044963097837824 -0.040575895565418935
+1.2663810456382176 -1.7444708773603259 0.081370946056690305  0.06633169903631303 -0.99445714115859496 0.081578796887613519
+0.86075903908278328 -1.6123045076538935 -0.37596077789543397  -0.33912378489964795 -0.86229745711633887 -0.37608264246842465
+0.79367059745735691 -1.5343712383737107 -0.46867704983435077  -0.40646863937642813 -0.78424095119900827 -0.46877433341209057
+1.6048073899588975 -1.5717822259851766 -0.40100492526839776  0.40477696304846272 -0.82172156155092013 -0.40115992505181874
+1.4746684461261841 -1.6157421844304007 -0.41838703947458189  0.27447137325094856 -0.86581974808662043 -0.41835586417422149
+1.6010049252683982 -1.1548073899588973 -0.82178222598517647  0.40115992505182063 -0.40477696304846372 -0.82172156155091869
+1.6183870394745821 -1.0246684461261837 -0.86574218443040085  0.41835586417422288 -0.27447137325094717 -0.86581974808662021
+1.9807681678543316 -1.3394256868089478 -0.20731239180326447  0.78085960551688671 -0.58928970592655894 -0.20735457304096733
+1.9433454959605347 -1.3260838378857436 -0.33994835690442571  0.74324570666303957 -0.57610127698437175 -0.34013694034011566
+2.1904306120773462 -0.79052228166871663 -0.13192856911395226  0.99044963097837824 -0.040575895565418095 -0.13176921185868259
+2.1944708773603256 -0.66862905394330985 -0.066381045638217215  0.9944571411585954 0.081578796887609911 -0.066331699036310476
+2.1904306120773462 -0.70947771833128304 0.13192856911395226  0.99044963097837835 0.040575895565417991 0.13176921185868262
+2.1944708773603256 -0.83137094605669015 0.066381045638217215  0.9944571411585954 -0.081578796887609883 0.066331699036310532
+2.0623045076538933 -0.37403922210456625 -0.33924096091721662  0.86229745711633832 0.37608264246842527 -0.33912378489964884
+1.9843712383737104 -0.28132295016564945 -0.40632940254264299  0.78424095119900961 0.46877433341208929 -0.40646863937642713
+0.92712117915505499 -1.4902458861856145 -0.61446983418191214  -0.27300775118977999 -0.74028370995146797 -0.61436698850995419
+0.99171259951203317 -1.5747164420172246 -0.52579382752597537  -0.20813967421463431 -0.82482450355065084 -0.52568280774650455
+0.45975411381438525 -1.3644698341819119 -0.27287882084494525  -0.74028370995146831 -0.61436698850995397 -0.27300775118977955
+0.37528355798277513 -1.275793827525975 -0.20828740048796673  -0.82482450355065007 -0.52568280774650578 -0.20813967421463436
+0.33769549234610641 -1.1259607778954337 -0.33924096091721684  -0.86229745711633832 -0.37608264246842493 -0.33912378489964951
+0.41562876162628937 -1.2186770498343509 -0.40632940254264294  -0.7842409511990085 -0.46877433341209057 -0.40646863937642791
+0.4192318321456685 -1.339425686808948 0.20731239180326452  -0.78085960551688693 -0.58928970592655905 0.20735457304096619
+0.45665450403946539 -1.3260838378857438 0.33994835690442576  -0.74324570666303824 -0.57610127698437319 0.34013694034011571
+0.37821777401482337 -1.1510049252683976 0.40480738995889759  -0.82172156155092024 -0.40115992505181935 0.40477696304846178
+0.3342578155695991 -1.1683870394745819 0.27466844612618396  -0.86581974808662066 -0.41835586417422155 0.27447137325094767
+0.79519261004110253 -1.5717822259851766 0.40100492526839782  -0.40477696304846161 -0.82172156155091969 0.40115992505182096
+0.92533155387381616 -1.6157421844304007 0.41838703947458189  -0.27447137325094662 -0.86581974808662077 0.41835586417422183
+0.95663400990185377 0.19602936533555493 0.21094260961626571  -0.23388566130186217 0.9476428056300582 0.21741805439057377
+0.29057971437418995 -0.86959234854368261 -0.39708487175152679  -0.90100988165586327 -0.12889639121160226 -0.4142063658263993
+0.26791287934591512 -0.90549608434201145 -0.32699007860623575  -0.9178970478509777 -0.17153707639041774 -0.35782683098097606
+0.89637854466934042 0.099164106023202955 -0.43023759412454343  -0.30820444126016117 0.84736796744948772 -0.43240900791731401
+1.4681715176003196 -0.06070343884806495 0.6730187872058685  0.26836446324215069 0.68937955050281263 0.67285685715261334
+1.3930054401955474 -0.12542737832173334 0.75674166021493716  0.19358827458119565 0.62484261256047646 0.7563698099959264
+1.2397345885584119 -0.48973505164257786 0.96471929550963276  0.03967799912916483 0.25990051397960134 0.96481986879326087
+1.3598578035878233 -0.55062303027104398 0.96679589706089242  0.16010344242024407 0.19913925651268469 0.96680424297825807
+1.0617263178126279 0.019577838502176315 0.62340222914316246  -0.13836216352689701 0.76972539034249121 0.62320039727703602
+1.1327229259756779 -0.047722974677923413 0.70871769768752169  -0.06750132061579113 0.70276863564903957 0.70820887911908559
+1.4840795446225896 -0.28960691129913418 0.84103330267207554  0.28440717777405761 0.46019616855581402 0.8410303464662523
+1.5714973697248311 -0.22222747306573276 0.76383628095354983  0.3717697632889605 0.52785497534633785 0.76364675610270705
+0.84637064705828324 -0.28443495637683419 0.81129246939324073  -0.35387698305874404 0.46550486715932443 0.81121902067950857
+0.96541504139377876 -0.23428397075672924 0.82401873423925942  -0.23530638500725842 0.51562318151862263 0.82387113061171735
+1.3358362255269414 -0.030084692934636004 0.68063975088704354  0.1360953033796356 0.72008099426245742 0.68041269101920465
+1.2697401976333089 0.050472340674918903 0.59529852733606159  0.069662907281836633 0.80067536950372653 0.59503447968929768
+1.1197187226497591 -0.55260647397715412 0.97703158208487906  -0.080345839839677594 0.19714040391717308 0.97707738033578018
+1.1222955963561905 -0.42728941095227674 0.94330265629374299  -0.077926023088562418 0.32203490693742814 0.94351526412634301
+0.99987185965655678 -0.069819281493047503 0.70519707714513469  -0.20029565457621112 0.68040299513329272 0.70493504308661759
+0.87160444279468885 -0.10938546291290407 0.69409608332024109  -0.32871571883365258 0.64057192708348276 0.69398384882086994
+1.5040127948790105 -0.41433279178978183 0.891573746743482  0.304220523183167 0.33550256744406926 0.89156486051918726
+1.3865609960788059 -0.36001233692795459 0.90172313788306913  0.18714545413041689 0.38953622755321876 0.90179715370028035
+0.94047778163550211 -0.35389882611563689 0.88076789123048715  -0.2598848257066439 0.39599581735923683 0.88070834559541744
+0.92730018625934885 -0.48088283263773507 0.92369408454137281  -0.27282039415738735 0.26880216379452304 0.92375019852295037
+0.89598720512098939 -0.41433279178978183 -0.891573746743482  -0.30422052318316667 0.33550256744406998 -0.89156486051918704
+1.013439003921194 -0.36001233692795459 -0.90172313788306913  -0.18714545413041792 0.38953622755321859 -0.90179715370028013
+1.4595222183644985 -0.35389882611563694 -0.88076789123048704  0.25988482570664373 0.39599581735923589 -0.88070834559541789
+1.4726998137406517 -0.48088283263773512 -0.9236940845413727  0.27282039415738851 0.26880216379452265 -0.92375019852295015
+0.93182848239968008 -0.06070343884806495 -0.6730187872058685  -0.26836446324214991 0.68937955050281319 -0.67285685715261323
+1.0069945598044523 -0.12542737832173334 -0.75674166021493716  -0.19358827458119385 0.62484261256047813 -0.75636980999592551
+1.1602654114415885 -0.48973505164257786 -0.96471929550963276  -0.039677999129163442 0.25990051397960057 -0.96481986879326109
+1.0401421964121771 -0.55062303027104398 -0.96679589706089264  -0.16010344242024327 0.19913925651268644 -0.96680424297825784
+1.3382736821873726 0.019577838502176204 -0.62340222914316235  0.13836216352689562 0.76972539034249188 -0.62320039727703569
+1.2672770740243227 -0.047722974677923524 -0.70871769768752158  0.067501320615790852 0.70276863564904002 -0.70820887911908526
+0.91592045537741074 -0.28960691129913418 -0.84103330267207554  -0.28440717777405577 0.46019616855581347 -0.84103034646625319
+0.82850263027516891 -0.22222747306573276 -0.76383628095354983  -0.37176976328895939 0.5278549753463373 -0.76364675610270794
+1.5536293529417171 -0.28443495637683425 -0.81129246939324062  0.35387698305874526 0.46550486715932382 -0.81121902067950846
+1.4345849586062216 -0.23428397075672924 -0.82401873423925942  0.23530638500725773 0.5156231815186233 -0.82387113061171713
+1.064163774473059 -0.030084692934636004 -0.68063975088704354  -0.13609530337963568 0.72008099426245653 -0.68041269101920543
+1.1302598023666912 0.050472340674918903 -0.59529852733606159  -0.069662907281836814 0.80067536950372631 -0.5950344796892979
+1.2802812773502414 -0.55260647397715412 -0.97703158208487906  0.080345839839677705 0.19714040391717316 -0.97707738033578018
+1.2777044036438097 -0.42728941095227674 -0.94330265629374299  0.077926023088562502 0.32203490693742798 -0.94351526412634301
+1.4001281403434436 -0.069819281493047614 -0.70519707714513458  0.20029565457621376 0.68040299513329239 -0.70493504308661725
+1.528395557205311 -0.10938546291290407 -0.69409608332024109  0.32871571883365169 0.64057192708348387 -0.6939838488208695
+1.3973935260228463 -1.7270315820848792 0.080281277350241251  0.1971404039171723 -0.97707738033578007 0.080345839839680203
+1.5227105890477235 -1.6933026562937428 0.077704403643809691  0.32203490693742948 -0.94351526412634235 0.077926023088564875
+1.8801807185069523 -1.4551970771451344 0.20012814034344359  0.68040299513329217 -0.70493504308661736 0.20029565457621401
+1.8406145370870961 -1.4440960833202408 0.328395557205311  0.64057192708348354 -0.69398384882087016 0.32871571883365103
+1.5356672082102185 -1.6415737467434819 -0.30401279487901062  0.33550256744406975 -0.89156486051918682 -0.30422052318316761
+1.589987663072046 -1.651723137883069 -0.18656099607880564  0.38953622755322032 -0.90179715370027957 -0.1871454541304175
+1.596101173884364 -1.6307678912304868 0.25952221836449818  0.39599581735923722 -0.88070834559541733 0.25988482570664367
+1.4691171673622654 -1.6736940845413724 0.27269981374065155  0.26880216379452515 -0.92375019852294959 0.27282039415738774
+1.889296561151935 -1.4230187872058684 -0.26817151760031971  0.68937955050281319 -0.67285685715261345 -0.26836446324214919
+1.8245726216782669 -1.5067416602149368 -0.19300544019554738  0.62484261256047735 -0.75636980999592573 -0.19358827458119546
+1.4602649483574226 -1.7147192955096329 -0.039734588558411603  0.25990051397960079 -0.96481986879326087 -0.039677999129166364
+1.3993769697289566 -1.7167958970608925 -0.15985780358782292  0.19913925651268624 -0.96680424297825795 -0.16010344242024338
+1.9695778385021763 -1.373402229143162 0.13827368218737229  0.76972539034249277 -0.62320039727703458 0.13836216352689565
+1.9022770253220767 -1.4587176976875214 0.067277074024322203  0.70276863564903957 -0.7082088791190857 0.067501320615791019
+1.6603930887008658 -1.5910333026720753 -0.28407954462258939  0.46019616855581419 -0.84103034646625208 -0.28440717777405794
+1.7277725269342672 -1.5138362809535497 -0.37149736972483099  0.52785497534633952 -0.7636467561027066 -0.37176976328895883
+1.6655650436231662 -1.5612924693932406 0.35362935294171671  0.4655048671593251 -0.81121902067950891 0.35387698305874227
+1.7157160292432714 -1.5740187342392593 0.23458495860622122  0.5156231815186243 -0.82387113061171613 0.23530638500725917
+1.9199153070653643 -1.4306397508870434 -0.135836225526941  0.72008099426245742 -0.68041269101920487 -0.13609530337963505
+2.0004723406749192 -1.3452985273360611 -0.06974019763330884  0.80067536950372775 -0.59503447968929568 -0.069662907281837744
+1.8730187872058686 -0.4818284823996804 0.68929656115193483  0.67285685715261256 0.26836446324214963 0.68937955050281385
+1.9567416602149375 -0.55699455980445256 0.62457262167826677  0.75636980999592585 0.19358827458119479 0.62484261256047735
+2.1647192955096326 -0.71026541144158839 0.26026494835742214  0.96481986879326176 0.039677999129162984 0.25990051397959829
+2.1667958970608927 -0.59014219641217724 0.19937696972895616  0.96680424297825762 0.1601034424202436 0.19913925651268774
+1.1197187226497587 -0.94739352602284621 -0.97703158208487906  -0.08034583983967819 -0.19714040391717366 -0.97707738033577995
+1.1222955963561905 -1.0727105890477233 -0.94330265629374277  -0.077926023088563487 -0.32203490693742803 -0.94351526412634301
+0.99987185965655645 -1.4301807185069524 -0.70519707714513469  -0.20029565457621298 -0.68040299513329205 -0.7049350430866177
+0.87160444279468885 -1.3906145370870959 -0.69409608332024109  -0.32871571883365236 -0.64057192708348221 -0.69398384882087072
+0.32993533901945349 -0.80654749644509327 -0.4886330537542477  -0.86908209382503177 -0.066959188365443623 -0.49011506943384187
+0.35314170479917451 -0.76928684914828649 -0.53075413092765567  -0.84560936423414856 -0.027439993872778051 -0.53309647331020771
+0.31923210876951291 -1.0095222183644981 -0.39610117388436322  -0.88070834559541689 -0.25988482570664445 -0.39599581735923767
+0.27630591545862715 -1.0226998137406511 -0.26911716736226515  -0.92375019852295048 -0.27282039415738712 -0.26880216379452287
+0.57659777085683772 -0.61172631781262765 0.76957783850217654  -0.62320039727703602 0.13836216352689595 0.76972539034249143
+0.49128230231247827 -0.68272292597567774 0.70227702532207659  -0.70820887911908448 0.067501320615791255 0.7027686356490408
+0.35896669732792441 -1.0340795446225892 0.46039308870086582  -0.84103034646625319 -0.28440717777405589 0.46019616855581341
+0.43616371904645013 -1.1214973697248309 0.52777252693426724  -0.76364675610270683 -0.37176976328896016 0.5278549753463383
+0.92600274487022949 0.1474180208074326 0.34558774394436131  -0.30431345936383969 0.89521176696950666 0.32555984200964683
+0.31474205002823552 -0.83109069623026077 -0.45671715648324684  -0.88043888279482363 -0.087790975218752162 -0.46596149876695098
+0.39411849558532475 -0.7042679462719752 -0.58956860097969033  -0.81036094014927673 0.030667519535217881 -0.58512789193981962
+0.96705050472527376 0.21194916611186071 0.13775142693846479  -0.23081318598026582 0.96295953203000473 0.13940664564572822
+0.89598720512098984 -1.0856672082102186 0.89157374674348211  -0.30422052318316595 -0.33550256744406909 0.89156486051918771
+1.0134390039211947 -1.1399876630720456 0.90172313788306913  -0.18714545413041703 -0.38953622755321959 0.90179715370027991
+1.4595222183644985 -1.1461011738843632 0.88076789123048704  0.2598848257066444 -0.39599581735923534 0.880708345595418
+1.4726998137406517 -1.019117167362265 0.9236940845413727  0.27282039415738762 -0.26880216379452199 0.92375019852295059
+2.0112924693932408 -1.1036293529417165 0.46556504362316542  0.81121902067950991 -0.35387698305874271 0.46550486715932338
+2.0240187342392595 -0.98458495860622119 0.51571602924327065  0.82387113061171902 -0.23530638500725812 0.51562318151862008
+1.8806397508870436 -0.61416377447305914 0.719915307065364  0.68041269101920487 0.1360953033796358 0.7200809942624572
+1.7952985273360618 -0.68025980236669126 0.80047234067491868  0.59503447968929746 0.069662907281836065 0.80067536950372675
+1.8234022291431624 -0.88827368218737224 0.7695778385021762  0.62320039727703591 -0.13836216352689581 0.76972539034249166
+1.9087176976875218 -0.81727707402432193 0.70227702532207636  0.70820887911908625 -0.067501320615792268 0.70276863564903891
+2.0410333026720755 -0.46592045537741078 0.46039308870086587  0.84103034646625263 0.28440717777405655 0.46019616855581408
+1.9638362809535499 -0.37850263027516917 0.52777252693426735  0.7636467561027066 0.37176976328895961 0.52785497534633896
+1.9695778385021763 -0.12659777085683777 -0.13827368218737232  0.76972539034249143 0.62320039727703636 -0.13836216352689507
+1.9022770253220767 -0.041282302312478425 -0.067277074024322217  0.70276863564904013 0.70820887911908514 -0.067501320615791421
+1.6603930887008658 0.091033302672075656 0.28407954462258933  0.46019616855581363 0.84103034646625308 0.28440717777405577
+1.7277725269342672 0.013836280953549829 0.37149736972483099  0.52785497534634007 0.76364675610270594 0.3717697632889595
+1.889296561151935 -0.076981212794131615 0.26817151760031976  0.68937955050281285 0.67285685715261301 0.2683644632421508
+1.8245726216782669 0.0067416602149371618 0.19300544019554744  0.62484261256047702 0.75636980999592629 0.19358827458119429
+1.4602649483574224 0.21471929550963276 0.039734588558411575  0.25990051397960157 0.96481986879326087 0.039677999129164421
+1.3993769697289566 0.21679589706089242 0.15985780358782287  0.19913925651268663 0.96680424297825795 0.16010344242024277
+0.97371394847093473 0.22313250261608547 -0.018534606855888307  -0.22857704379632673 0.97332233192471596 -0.019904100732393945
+0.3395133710973568 -0.79211156275892003 -0.50664961250726259  -0.85780946571559158 -0.048345734654243529 -0.51168897825678517
+0.80104197563456969 -0.053122466844444174 -0.59574101077153174  -0.37119418317776481 0.71962089011270858 -0.58682250543787506
+0.45944041532897173 -0.59972505245462004 -0.653998898413091  -0.74496666446894655 0.16330181399314797 -0.64680536978024494
+1.0026064739771539 0.22703158208487906 0.080281277350241251  -0.19714040391717333 0.97707738033578007 0.080345839839677469
+0.44633019100468208 -0.62042776846682712 -0.64334361719230815  -0.75782534074317476 0.12946239417784464 -0.63948435588467012
+0.40435813432554835 -0.6879005781223142 -0.60211592452938856  -0.77995892884277973 0.063643445898669229 -0.62258620376022367
+0.92780338960280884 0.14987434907153019 0.34005641981910062  -0.27087574504908507 0.91136373772563206 0.30990719304796444
+0.40065939257699101 -0.69413734830776352 -0.59790562905682221  -0.79006130932897867 0.031934562996077741 -0.61219548445543892
+0.24930895838975131 -0.93567470552212884 0.24579255546759937  -0.95608513245170457 -0.17856129650966157 0.23241575440058948
+0.49480292285486538 -0.54987185965655638 0.6801807185069525  -0.70493504308661625 0.20029565457621099 0.68040299513329427
+0.79848519772427495 -0.05725079091428624 -0.59888293763788791  -0.39881277493421985 0.66927944610494272 -0.62690780308648919
+0.94691066341902053 0.17998804508785299 -0.26439588316448503  -0.2356500906047751 0.9375711537404644 -0.25579164660272941
+0.92780338960280884 0.1498743490715298 -0.34005641981910184  -0.27087574504909129 0.9113637377256294 -0.30990719304796688
+0.51936024911295675 -0.88583622552694086 0.71991530706536422  -0.68041269101920554 -0.13609530337963666 0.72008099426245631
+0.60470147266393859 -0.81974019763330874 0.80047234067491901  -0.59503447968929779 -0.069662907281837785 0.8006753695037262
+0.9318284823996803 -1.4392965611519353 0.6730187872058685  -0.26836446324214974 -0.68937955050281385 0.67285685715261245
+1.0069945598044532 -1.374572621678267 0.75674166021493738  -0.19358827458119265 -0.62484261256047824 0.75636980999592585
+1.1602654114415887 -1.0102649483574222 0.96471929550963276  -0.039677999129165489 -0.25990051397960151 0.96481986879326076
+1.0401421964121773 -0.94937696972895624 0.96679589706089264  -0.16010344242024363 -0.19913925651268594 0.96680424297825795
+2.0112924693932408 -0.39637064705828318 -0.46556504362316581  0.81121902067950968 0.35387698305874449 -0.46550486715932216
+2.0240187342392595 -0.51541504139377881 -0.51571602924327065  0.82387113061171646 0.23530638500725806 -0.51562318151862441
+1.8806397508870436 -0.88583622552694086 -0.719915307065364  0.68041269101920476 -0.13609530337963674 -0.72008099426245697
+1.7952985273360618 -0.81974019763330874 -0.80047234067491879  0.5950344796892979 -0.06966290728183612 -0.80067536950372642
+1.4681715176003196 -1.4392965611519353 -0.6730187872058685  0.26836446324215019 -0.68937955050281319 -0.67285685715261301
+1.3930054401955474 -1.3745726216782668 -0.75674166021493716  0.19358827458119407 -0.62484261256047757 -0.75636980999592596
+1.2397345885584119 -1.0102649483574222 -0.96471929550963276  0.039677999129167092 -0.25990051397960079 -0.96481986879326087
+1.3598578035878233 -0.94937696972895602 -0.96679589706089242  0.16010344242024369 -0.19913925651268524 -0.96680424297825807
+1.5040127948790105 -1.0856672082102183 -0.89157374674348189  0.304220523183167 -0.33550256744407064 -0.89156486051918671
+1.3865609960788055 -1.1399876630720456 -0.90172313788306913  0.18714545413041778 -0.38953622755322032 -0.90179715370027946
+0.94047778163550177 -1.1461011738843632 -0.88076789123048715  -0.25988482570664295 -0.39599581735923617 -0.880708345595418
+0.92730018625934818 -1.019117167362265 -0.9236940845413727  -0.27282039415738779 -0.26880216379452299 -0.92375019852295026
+0.38870753060675922 -1.1036293529417167 -0.46556504362316575  -0.81121902067950891 -0.35387698305874371 -0.46550486715932404
+0.37598126576074054 -0.98458495860622119 -0.51571602924327076  -0.82387113061171768 -0.2353063850072579 -0.51562318151862241
+0.51936024911295653 -0.61416377447305914 -0.71991530706536422  -0.68041269101920532 0.13609530337963607 -0.72008099426245675
+0.60470147266393859 -0.68025980236669126 -0.80047234067491901  -0.59503447968929757 0.069662907281836731 -0.80067536950372664
+0.57659777085683772 -0.88827368218737235 -0.76957783850217643  -0.62320039727703624 -0.13836216352689573 -0.76972539034249132
+0.49128230231247827 -0.81727707402432204 -0.70227702532207659  -0.70820887911908403 -0.067501320615791185 -0.70276863564904113
+0.79963678018449613 -0.055347528090576067 -0.59753024518837072  -0.36887582764817262 0.69486688193511303 -0.61732539245251317
+0.24152064540259122 -0.94857068261000999 0.20072208160320942  -0.95922670283599798 -0.19909668302557912 0.20061067612316194
+0.74532674141002375 -0.14250706129079604 -0.65018159643527595  -0.45629539576529471 0.61497179190323881 -0.64312067838525655
+0.31474205002823563 -0.83109069623026088 0.45671715648324701  -0.88043888279482407 -0.087790975218753439 0.46596149876694987
+0.23052646968895496 -0.96592607882051262 0.10986054425367281  -0.96991439832021697 -0.2213218831876774 0.10140356972706432
+0.36517401588679055 -0.75000000000000011 -0.54975734503310147  -0.8351282192258368 -1.7351045681323705e-15 -0.55005532217467235
+0.73203596503112101 -0.16333083529035375 -0.66003296952840662  -0.48378799724665406 0.58634540105761634 -0.64972936241073054
+0.32993533901945349 -0.80654749644509338 0.4886330537542477  -0.86908209382503254 -0.066959188365443442 0.49011506943384064
+0.42861413394522363 -0.64891100701386606 -0.6271743261149485  -0.76918721291849768 0.096596587118419897 -0.63168040245027957
+1.0006230302710439 0.21679589706089264 -0.15985780358782289  -0.19913925651268563 0.9668042429782584 -0.16010344242024124
+1.5356672082102183 0.141573746743482 0.30401279487901056  0.33550256744406864 0.89156486051918726 0.30422052318316783
+1.589987663072046 0.1517231378830689 0.18656099607880564  0.38953622755321937 0.90179715370028013 0.1871454541304165
+1.5961011738843633 0.13076789123048704 -0.25952221836449818  0.39599581735923672 0.88070834559541755 -0.25988482570664362
+1.4691171673622654 0.17369408454137247 -0.27269981374065155  0.26880216379452343 0.92375019852294993 -0.27282039415738862
+1.3973935260228463 0.22703158208487906 -0.080281277350241251  0.19714040391717291 0.97707738033578007 -0.08034583983967919
+1.5227105890477235 0.19330265629374277 -0.077704403643809677  0.32203490693742931 0.94351526412634257 -0.077926023088563098
+1.8801807185069523 -0.044802922854865423 -0.20012814034344364  0.68040299513329272 0.70493504308661703 -0.20029565457621326
+1.8406145370870961 -0.055903916679759136 -0.32839555720531111  0.64057192708348254 0.69398384882087027 -0.32871571883365264
+2.1770315820848789 -0.66971872264975862 -0.19739352602284604  0.97707738033577951 0.080345839839677469 -0.19714040391717583
+2.1433026562937432 -0.67229559635619018 -0.32271058904772343  0.94351526412634357 0.077926023088562099 -0.32203490693742648
+1.9051970771451348 -0.54987185965655638 -0.68018071850695228  0.70493504308661614 0.20029565457621251 -0.68040299513329383
+1.8940960833202412 -0.42160444279468895 -0.64061453708709593  0.69398384882086994 0.32871571883365269 -0.64057192708348276
+2.1770315820848789 -0.83028127735024138 0.19739352602284604  0.97707738033577962 -0.080345839839677594 0.19714040391717577
+2.1433026562937432 -0.82770440364380959 0.32271058904772337  0.94351526412634346 -0.077926023088562182 0.32203490693742681
+1.9051970771451348 -0.95012814034344362 0.68018071850695228  0.70493504308661736 -0.20029565457621232 0.68040299513329261
+1.8940960833202412 -1.0783955572053108 0.64061453708709593  0.69398384882086983 -0.32871571883365164 0.64057192708348354
+1.2802812773502414 -0.9473935260228461 0.97703158208487884  0.080345839839677982 -0.19714040391717333 0.97707738033578007
+1.2777044036438101 -1.0727105890477233 0.94330265629374277  0.077926023088561974 -0.32203490693742742 0.94351526412634323
+1.4001281403434442 -1.4301807185069524 0.70519707714513435  0.20029565457621343 -0.68040299513329316 0.7049350430866167
+1.5283955572053118 -1.3906145370870957 0.69409608332024086  0.32871571883365197 -0.64057192708348387 0.69398384882086939
+1.5536293529417171 -1.215565043623166 0.81129246939324051  0.35387698305874427 -0.46550486715932354 0.81121902067950902
+1.4345849586062214 -1.265716029243271 0.82401873423925931  0.2353063850072577 -0.51562318151862219 0.82387113061171791
+1.0641637744730592 -1.4699153070653641 0.68063975088704354  -0.13609530337963502 -0.72008099426245675 0.68041269101920543
+1.1302598023666912 -1.550472340674919 0.59529852733606137  -0.069662907281835967 -0.80067536950372697 0.59503447968929724
+0.51070343884806491 -1.4230187872058684 0.26817151760031971  -0.68937955050281274 -0.67285685715261301 0.26836446324215124
+0.57542737832173307 -1.5067416602149373 0.19300544019554747  -0.62484261256047668 -0.75636980999592651 0.19358827458119479
+0.93973505164257753 -1.7147192955096329 0.039734588558411603  -0.25990051397960157 -0.96481986879326087 0.039677999129163352
+1.0006230302710439 -1.7167958970608925 0.15985780358782295  -0.19913925651268577 -0.96680424297825773 0.16010344242024463
+0.86433279178978151 -1.6415737467434819 0.30401279487901062  -0.33550256744406703 -0.89156486051918793 0.30422052318316739
+0.81001233692795438 -1.651723137883069 0.18656099607880566  -0.38953622755321937 -0.90179715370027991 0.18714545413041725
+0.80389882611563679 -1.6307678912304873 -0.25952221836449835  -0.39599581735923667 -0.88070834559541755 -0.25988482570664351
+0.93088283263773519 -1.6736940845413728 -0.27269981374065166  -0.26880216379452282 -0.92375019852295026 -0.27282039415738824
+0.84637064705828324 -1.2155650436231658 -0.81129246939324073  -0.35387698305874399 -0.46550486715932426 -0.81121902067950868
+0.96541504139377876 -1.2657160292432705 -0.82401873423925953  -0.23530638500725817 -0.51562318151862341 -0.82387113061171702
+1.3358362255269407 -1.4699153070653641 -0.68063975088704354  0.13609530337963741 -0.72008099426245542 -0.68041269101920643
+1.2697401976333087 -1.550472340674919 -0.59529852733606137  0.069662907281835718 -0.80067536950372697 -0.59503447968929712
+1.0617263178126279 -1.5195778385021765 -0.62340222914316235  -0.13836216352689701 -0.76972539034249154 -0.6232003972770358
+1.1327229259756779 -1.4522770253220765 -0.70871769768752169  -0.067501320615791463 -0.70276863564903835 -0.7082088791190867
+1.4840795446225892 -1.2103930887008656 -0.84103330267207554  0.28440717777405761 -0.4601961685558158 -0.8410303464662513
+1.5714973697248311 -1.2777725269342675 -0.76383628095354983  0.37176976328896116 -0.52785497534633907 -0.76364675610270594
+1.8234022291431624 -0.61172631781262776 -0.7695778385021762  0.62320039727703591 0.13836216352689573 -0.76972539034249166
+1.9087176976875218 -0.68272292597567774 -0.70227702532207636  0.70820887911908492 0.067501320615791352 -0.70276863564904024
+2.0410333026720755 -1.034079544622589 -0.46039308870086576  0.84103034646625319 -0.28440717777405544 -0.46019616855581363
+1.9638362809535499 -1.1214973697248309 -0.52777252693426713  0.7636467561027076 -0.37176976328895911 -0.52785497534633785
+1.8730187872058686 -1.0181715176003197 -0.68929656115193483  0.67285685715261245 -0.26836446324214946 -0.68937955050281396
+1.9567416602149375 -0.94300544019554744 -0.62457262167826677  0.75636980999592596 -0.19358827458119457 -0.62484261256047746
+2.1647192955096326 -0.78973458855841161 -0.26026494835742214  0.96481986879326176 -0.039677999129162984 -0.25990051397959812
+2.1667958970608927 -0.90985780358782276 -0.19937696972895616  0.96680424297825762 -0.16010344242024363 -0.19913925651268752
+2.0915737467434821 -0.44598720512098944 0.33566720821021828  0.89156486051918704 0.30422052318316872 0.33550256744406842
+2.1017231378830692 -0.56343900392119428 0.38998766307204552  0.90179715370028035 0.18714545413041561 0.38953622755321932
+2.0807678912304874 -1.0095222183644981 0.39610117388436294  0.88070834559541811 -0.25988482570664401 0.39599581735923511
+2.1236940845413725 -1.0226998137406511 0.26911716736226499  0.92375019852295071 -0.2728203941573869 0.26880216379452243
+2.0915737467434821 -1.0540127948790103 -0.33566720821021817  0.8915648605191866 -0.304220523183169 -0.33550256744406914
+2.1017231378830692 -0.9365609960788055 -0.38998766307204552  0.90179715370028035 -0.18714545413041556 -0.38953622755321937
+2.080767891230487 -0.49047778163550182 -0.39610117388436328  0.88070834559541755 0.25988482570664495 -0.395995817359236
+2.1236940845413725 -0.47730018625934845 -0.26911716736226499  0.92375019852294959 0.27282039415738735 -0.26880216379452587
+1.6655650436231659 0.061292469393240734 -0.35362935294171677  0.46550486715932515 0.81121902067950802 -0.35387698305874443
+1.7157160292432707 0.074018734239259421 -0.23458495860622128  0.51562318151862496 0.82387113061171613 -0.23530638500725815
+1.9199153070653638 -0.069360249112956462 0.135836225526941  0.72008099426245686 0.68041269101920532 0.13609530337963571
+2.0004723406749187 -0.15470147266393841 0.069740197633308867  0.80067536950372709 0.5950344796892969 0.069662907281836342
+1.0026064739771539 -1.7270315820848792 -0.080281277350241251  -0.19714040391717255 -0.97707738033578029 -0.080345839839677857
+0.87728941095227653 -1.6933026562937428 -0.077704403643809691  -0.3220349069374297 -0.94351526412634246 -0.077926023088562835
+0.51981928149304746 -1.4551970771451346 -0.20012814034344362  -0.68040299513329383 -0.70493504308661636 -0.20029565457621185
+0.55938546291290392 -1.444096083320241 -0.32839555720531116  -0.6405719270834821 -0.69398384882087105 -0.32871571883365192
+0.96705050472527376 0.21194916611186074 -0.13775142693846454  -0.23081318598026312 0.96295953203000684 -0.13940664564571795
+0.28617291708332143 -0.87638371280443872 0.38483791504434911  -0.91004478602604832 -0.14997570917340214 0.38642693240086007
+0.49480292285486538 -0.95012814034344351 -0.6801807185069525  -0.70493504308661703 -0.20029565457621293 -0.68040299513329283
+0.50590391667975909 -1.0783955572053112 -0.64061453708709593  -0.69398384882087027 -0.32871571883365175 -0.64057192708348287
+0.7344349563768342 -1.5612924693932406 -0.35362935294171682  -0.46550486715932488 -0.81121902067950857 -0.35387698305874338
+0.68428397075672931 -1.5740187342392593 -0.23458495860622131  -0.51562318151862274 -0.82387113061171702 -0.23530638500725945
+0.48008469293463596 -1.4306397508870434 0.135836225526941  -0.7200809942624582 -0.68041269101920365 0.13609530337963588
+0.39952765932508105 -1.3452985273360616 0.069740197633308854  -0.80067536950372631 -0.5950344796892979 0.069662907281837605
+0.52698121279413157 -1.0181715176003197 0.68929656115193516  -0.67285685715261234 -0.26836446324214924 0.68937955050281408
+0.44325833978506279 -0.94300544019554755 0.62457262167826699  -0.75636980999592529 -0.19358827458119435 0.62484261256047824
+0.69212177096286931 -0.22700206765185557 -0.68413337702600874  -0.52838581205523161 0.49772992706575336 -0.68780328097636556
+0.52912853141459681 -0.48757002987147363 -0.69320320770179844  -0.66138007935865217 0.23687493927937045 -0.71166470600201726
+0.43042216149782375 -1.3734022291431622 -0.13827368218737232  -0.76972539034249121 -0.62320039727703613 -0.13836216352689668
+0.49772297467792337 -1.4587176976875216 -0.067277074024322231  -0.70276863564904068 -0.70820887911908448 -0.067501320615791449
+0.73960691129913392 -1.5910333026720753 0.28407954462258939  -0.46019616855581452 -0.84103034646625252 0.28440717777405594
+0.67222747306573261 -1.5138362809535497 0.37149736972483099  -0.52785497534633841 -0.76364675610270694 0.37176976328895978
+1.3382736821873729 -1.5195778385021763 0.62340222914316223  0.13836216352689787 -0.76972539034249043 0.62320039727703691
+1.2672770740243227 -1.4522770253220765 0.70871769768752169  0.067501320615792629 -0.70276863564903946 0.7082088791190857
+0.91592045537741118 -1.2103930887008665 0.84103330267207554  -0.28440717777405589 -0.46019616855581424 0.84103034646625274
+0.82850263027516924 -1.2777725269342675 0.76383628095354994  -0.37176976328895894 -0.52785497534633752 0.76364675610270805
+0.97256579272521648 0.22114863140943247 0.060907607905721736  -0.22895713509379126 0.97158621857248983 0.059990417315213367
+0.50622685812276524 -0.52571510245600384 -0.6834170246153628  -0.68956138101059405 0.23429135260016218 -0.68528290794061752
+0.24930895838975137 -0.93567470552212906 -0.24579255546759976  -0.9560851324517049 -0.17856129650966043 -0.23241575440058906
+0.56731181848165257 -0.42664579118104862 -0.70294074606773127  -0.62602060935195813 0.30459772848492944 -0.7178568244910849
+0.30842625325651785 -1.0540127948790103 0.33566720821021839  -0.8915648605191876 -0.30422052318316622 0.33550256744406898
+0.29827686211693072 -0.9365609960788055 0.38998766307204563  -0.9017971537002798 -0.18714545413041739 0.38953622755321959
+0.6569399976068282 -0.28335434223766326 -0.69755165300174249  -0.52046695699576906 0.46800238770905944 -0.71420439075532394
+0.6078561560079746 -0.36184045701812123 -0.70538094374692584  -0.58682250543787795 0.37119418317777469 -0.71962089011270114
+1.8267476188075715 -0.23443672020460982 0.58427898032160919  0.62675731827798087 0.515828226034316 0.58403467808965281
+1.7521688397941486 -0.28373393338202185 0.69116244652106429  0.55222595833073151 0.46647300291392801 0.69097715483087252
+1.5536293529417171 -0.28443495637683436 0.81129246939324062  0.35387698305874488 0.46550486715932449 0.81121902067950824
+1.6686770498343511 -0.34367059745735729 0.7843712383737107  0.46877433341209052 0.40646863937642869 0.78424095119900816
+1.2687157005262188 0.19538324907249438 0.31863563026492314  0.068666567984591059 0.94527232704070629 0.31897512469198191
+1.3389936067269161 0.14342795031552757 0.42716188369754915  0.13875119650014398 0.89352037004910534 0.42704736713517877
+1.3382736821873722 0.019577838502176204 0.62340222914316235  0.1383621635268969 0.76972539034249132 0.62320039727703602
+1.4082874004879666 0.074716442017224605 0.52579382752597525  0.208139674214635 0.8248245035506504 0.52568280774650489
+0.76687916779802345 -0.10789205109760858 -0.63136143448574888  -0.42807141203226684 0.64268086340021302 -0.63538663349165436
+0.26660413751883805 -0.90759811547986113 0.3218712605625344  -0.93893517079361655 -0.17584665747242287 0.29576798018470224
+0.9318284823996803 -0.060703438848064839 0.67301878720586861  -0.26836446324215113 0.68937955050281319 0.67285685715261256
+0.86005164309557447 -0.0066545040394655475 0.57608383788574402  -0.3401369403401171 0.74324570666303769 0.57610127698437308
+0.77018003072289609 -0.74999999999999989 0.90291461058653244  -0.42961984965260008 0.00028436728304531982 0.90300980278163412
+0.77283811630245081 -0.61100639327308404 0.89342795031552769  -0.42704736713517794 0.13875119650014234 0.89352037004910601
+0.89598720512098962 -0.41433279178978172 0.89157374674348211  -0.30422052318316684 0.33550256744407064 0.89156486051918682
+0.78161296052541807 -0.47533155387381615 0.86574218443040096  -0.41835586417422282 0.27447137325094939 0.86581974808661955
+1.5186356302649235 -0.81871570052621878 0.94538324907249438  0.31897512469198225 -0.068666567984592156 0.94527232704070618
+1.4022655037944636 -0.75 0.97933072349169759  0.20254321521823429 7.9881559506738853e-17 0.97927332546590895
+1.2802812773502414 -0.55260647397715412 0.97703158208487906  0.080345839839678967 0.19714040391717236 0.97707738033578018
+1.2813709460566907 -0.68361895436178255 0.9944708773603258  0.081578796887613381 0.066331699036313557 0.99445714115859496
+0.88136436973507692 -0.81871570052621878 -0.9453832490724946  -0.3189751246919828 -0.068666567984590657 -0.94527232704070607
+0.99773449620553689 -0.75 -0.9793307234916977  -0.20254321521823221 -2.5006401236892162e-16 -0.97927332546590939
+1.1197187226497587 -0.55260647397715412 -0.97703158208487906  -0.080345839839677594 0.19714040391717333 -0.97707738033578007
+1.1186290539433099 -0.68361895436178255 -0.9944708773603258  -0.081578796887611618 0.066331699036312461 -0.99445714115859518
+0.65068017874670403 -0.29325931385704512 -0.69911600851089584  -0.54352627180167212 0.43623030388675949 -0.7171347947438057
+0.57556494808430081 -0.41363385795819674 -0.70422028778974766  -0.60701252203428868 0.33806887798060098 -0.71919763058182395
+0.84637064705828324 -0.28443495637683419 -0.81129246939324084  -0.35387698305874371 0.4655048671593251 -0.81121902067950835
+0.7313229501656493 -0.34367059745735723 -0.78437123837371081  -0.46877433341209035 0.40646863937642796 -0.78424095119900872
+1.1312842994737817 0.1953832490724946 -0.3186356302649232  -0.068382200701545062 0.94544807568691691 -0.3185150087627262
+1.0610063932730844 0.14342795031552769 -0.42716188369754926  -0.138751196500143 0.89352037004910556 -0.42704736713517871
+1.0617263178126279 0.019577838502176315 -0.62340222914316246  -0.13836216352689656 0.76972539034249143 -0.62320039727703591
+0.99171259951203328 0.074716442017224605 -0.52579382752597525  -0.20813967421463547 0.82482450355065007 -0.52568280774650544
+1.7842789803216093 -0.12325238119242887 -0.51556327979539018  0.58449479401890791 0.62647295099493516 -0.51565247738810671
+1.6662660666179787 -0.058837553478935933 -0.55216883979414821  0.46647300291392729 0.69097715483087374 -0.55222595833073074
+1.4681715176003201 -0.060703438848065061 -0.67301878720586839  0.26836446324215174 0.68937955050281285 -0.67285685715261279
+1.5399483569044259 -0.0066545040394656585 -0.57608383788574391  0.34013694034011571 0.74324570666303802 -0.57610127698437363
+1.6298199692771045 -0.74999999999999956 -0.90291461058653211  0.42961984965260014 -0.00028436728304601447 -0.90300980278163412
+1.6271618836975494 -0.61100639327308404 -0.89342795031552757  0.42704736713517782 0.1387511965001425 -0.89352037004910601
+1.5040127948790107 -0.41433279178978177 -0.891573746743482  0.30422052318316689 0.33550256744406892 -0.89156486051918737
+1.6183870394745821 -0.4753315538738162 -0.86574218443040063  0.41835586417422188 0.27447137325094723 -0.86581974808662054
+1.2000000000000002 -1.6529146105865324 0.42981996927710425  -0.00028436728304630791 -0.90300980278163401 0.42961984965260031
+1.3389936067269161 -1.6434279503155274 0.42716188369754937  0.13875119650014339 -0.89352037004910545 0.42704736713517877
+1.5356672082102192 -1.6415737467434817 0.30401279487901056  0.33550256744406892 -0.8915648605191876 0.30422052318316639
+1.4746684461261848 -1.6157421844304007 0.41838703947458178  0.27447137325094845 -0.86581974808661988 0.41835586417422255
+1.1312842994737811 -1.6953832490724943 -0.31863563026492331  -0.068382200701545548 -0.94544807568691747 -0.31851500876272432
+1.2 -1.7293307234916977 -0.20226550379446348  6.7031047760002604e-16 -0.97927332546590873 -0.20254321521823504
+1.3973935260228465 -1.7270315820848787 -0.080281277350241292  0.19714040391717233 -0.97707738033578018 -0.080345839839679897
+1.2663810456382176 -1.7444708773603259 -0.081370946056690305  0.06633169903631303 -0.99445714115859496 -0.081578796887613506
+1.7155632797953904 -1.3342789803216091 -0.62674761880757135  0.51582822603431788 -0.58403467808965126 -0.62675731827798087
+1.6662660666179783 -1.4411624465210644 -0.55216883979414821  0.4664730029139289 -0.69097715483087219 -0.55222595833073118
+1.6655650436231657 -1.5612924693932406 -0.35362935294171666  0.46550486715932354 -0.81121902067951002 -0.35387698305874205
+1.6063294025426431 -1.5343712383737107 -0.46867704983435049  0.40646863937642785 -0.78424095119900827 -0.46877433341209107
+2.1453832490724949 -1.0686356302649227 -0.06871570052621874  0.94544807568691724 -0.31851500876272509 -0.068382200701546103
+2.0934279503155278 -1.1771618836975488 -0.13899360672691582  0.89352037004910589 -0.42704736713517844 -0.1387511965001422
+1.9695778385021763 -1.3734022291431622 -0.13827368218737227  0.76972539034249321 -0.62320039727703391 -0.13836216352689615
+2.0247164420172248 -1.2757938275259753 -0.20828740048796671  0.82482450355065107 -0.525682807746505 -0.20813967421463211
+1.8267476188075715 -1.26556327979539 0.58427898032160919  0.62647295099493583 -0.51565247738810571 0.58449479401890814
+1.8911624465210648 -1.302168839794148 0.4662660666179782  0.69097715483087407 -0.55222595833073052 0.46647300291392696
+1.889296561151935 -1.4230187872058684 0.2681715176003196  0.68937955050281319 -0.67285685715261345 0.26836446324214919
+1.9433454959605347 -1.3260838378857436 0.3399483569044256  0.74324570666303946 -0.57610127698437241 0.34013694034011438
+1.7842789803216093 -0.12325238119242887 0.51556327979539029  0.58403467808965281 0.62675731827798076 0.51582822603431622
+1.8911624465210641 -0.19783116020585167 0.46626606661797843  0.69097715483087407 0.55222595833073118 0.4664730029139264
+2.0112924693932408 -0.39637064705828329 0.46556504362316598  0.81121902067950979 0.35387698305874404 0.46550486715932238
+1.9843712383737104 -0.28132295016564945 0.40632940254264299  0.78424095119900972 0.46877433341208941 0.40646863937642708
+0.77018003072289609 -0.75 -0.90291461058653244  -0.42961984965259892 0.00028436728304730646 -0.90300980278163467
+0.77283811630245081 -0.88899360672691596 -0.89342795031552769  -0.42704736713517827 -0.13875119650014237 -0.89352037004910589
+0.89598720512098939 -1.0856672082102183 -0.89157374674348211  -0.304220523183167 -0.33550256744406931 -0.89156486051918726
+0.78161296052541807 -1.0246684461261839 -0.86574218443040096  -0.41835586417422177 -0.27447137325094834 -0.86581974808662032
+0.83001349060802176 -0.0073066631575244394 -0.55678551944213672  -0.37302523877669491 0.74314518846919997 -0.55550643568789282
+0.53310523682898858 -0.48133611427487955 -0.69462568959831961  -0.64422625268360245 0.27076651461112594 -0.71530275402698285
+0.3601361494343176 -0.80485714071361691 0.54001796879892039  -0.8390925313001083 -0.056307189018241985 0.54106674669696786
+0.38108971266128355 -0.75 -0.57392154628557113  -0.81788534298629911 -0.00078604920685779688 -0.57538069819453297
+0.88136436973507715 -0.81871570052621845 0.94538324907249471  -0.31851500876272526 -0.068382200701546589 0.94544807568691713
+0.77283811630245092 -0.88899360672691596 0.89342795031552769  -0.42704736713517888 -0.13875119650014284 0.89352037004910545
+0.57659777085683772 -0.88827368218737235 0.76957783850217654  -0.62320039727703636 -0.13836216352689581 0.76972539034249132
+0.67420617247402481 -0.9582874004879669 0.82471644201722483  -0.52568280774650478 -0.20813967421463539 0.82482450355065029
+0.87160444279468918 -1.3906145370870964 0.69409608332024098  -0.32871571883365219 -0.64057192708348321 0.69398384882086983
+0.92712117915505499 -1.4902458861856145 0.61446983418191214  -0.2730077511897796 -0.74028370995146875 0.61436698850995353
+0.74873333439274148 -1.3375076190110726 0.67170915887432037  -0.45142526361231805 -0.58763152153323228 0.67149417441485482
+0.63335215040065596 -1.2737239478373756 0.63610018157997195  -0.5663221914054013 -0.52380155193385325 0.636326260430505
+0.88136436973507692 -0.681284299473781 0.9453832490724946  -0.3189751246919813 0.068666567984592267 0.94527232704070641
+0.99773449620553689 -0.74999999999999989 0.9793307234916977  -0.20254321521823254 9.0300893355443904e-17 0.97927332546590928
+1.1197187226497591 -0.94739352602284632 0.97703158208487906  -0.080345839839676983 -0.19714040391717325 0.97707738033578018
+1.1186290539433099 -0.81638104563821712 0.9944708773603258  -0.08157879688761159 -0.066331699036312336 0.99445714115859518
+1.715563279795391 -1.3342789803216086 0.62674761880757113  0.51582822603431788 -0.58403467808965215 0.62675731827798009
+1.7521688397941486 -1.2162660666179781 0.69116244652106418  0.55222595833073262 -0.46647300291392663 0.69097715483087263
+1.8730187872058686 -1.0181715176003194 0.68929656115193494  0.67285685715261245 -0.2683644632421518 0.68937955050281308
+1.7760838378857442 -1.0899483569044257 0.74334549596053434  0.57610127698437397 -0.34013694034011416 0.74324570666303846
+1.5186356302649235 -0.68128429947378122 0.94538324907249438  0.31851500876272459 0.068382200701545673 0.94544807568691736
+1.6271618836975499 -0.61100639327308437 0.89342795031552724  0.42704736713517866 0.13875119650014181 0.89352037004910578
+1.8234022291431624 -0.61172631781262787 0.7695778385021762  0.62320039727703658 0.13836216352689631 0.7697253903424911
+1.7257938275259754 -0.54171259951203343 0.82471644201722449  0.52568280774650533 0.20813967421463578 0.82482450355064996
+2.1453832490724944 -0.43136436973507697 0.068715700526218768  0.94544807568691758 0.31851500876272426 0.068382200701545118
+2.0934279503155278 -0.32283811630245085 0.13899360672691591  0.89352037004910578 0.42704736713517838 0.138751196500143
+1.9695778385021763 -0.12659777085683765 0.13827368218737227  0.76972539034249055 0.62320039727703702 0.13836216352689729
+2.0247164420172248 -0.22420617247402475 0.20828740048796671  0.82482450355065073 0.52568280774650478 0.2081396742146342
+1.7155632797953904 -0.16572101967839103 0.62674761880757157  0.51565247738810571 0.58449479401890947 0.6264729509949345
+1.6662660666179785 -0.058837553478935822 0.55216883979414844  0.46647300291392862 0.69097715483087263 0.55222595833073085
+1.6655650436231659 0.061292469393240734 0.35362935294171677  0.46550486715932449 0.81121902067950891 0.35387698305874343
+1.6063294025426431 0.034371238373710589 0.46867704983435055  0.40646863937642713 0.78424095119900905 0.46877433341209024
+1.2687157005262188 0.19538324907249438 -0.3186356302649232  0.068382200701545076 0.94544807568691724 -0.31851500876272498
+1.2000000000000002 0.22933072349169759 -0.20226550379446331  1.205169615166886e-15 0.97927332546590917 -0.20254321521823279
+1.0026064739771541 0.22703158208487906 -0.080281277350241251  -0.19714040391717261 0.97707738033578029 -0.08034583983967665
+1.1336189543617827 0.24447087736032569 -0.081370946056690249  -0.066331699036312627 0.99445714115859507 -0.081578796887612021
+1.2000000000000002 0.15291461058653233 0.4298199692771042  -0.00028436728304613427 0.90300980278163412 0.42961984965260003
+1.0610063932730838 0.14342795031552757 0.42716188369754932  -0.13875119650014217 0.89352037004910645 0.42704736713517716
+1.1327229259756779 -1.4522770253220765 0.70871769768752158  -0.067501320615791227 -0.70276863564903946 0.70820887911908581
+0.92533155387381627 0.11574218443040096 0.41838703947458195  -0.27447137325094978 0.86581974808661888 0.41835586417422366
+0.99987185965655656 -1.4301807185069526 0.70519707714513435  -0.20029565457621165 -0.68040299513329339 0.70493504308661681
+1.2000000000000002 -1.3757818886900326 0.77999809473327286  0.00023519417927867815 -0.62694312538533137 0.77906499229253701
+1.2548571407136171 -1.2900179687989204 0.83986385056568236  0.056792994144885443 -0.5397948923634539 0.83987858050696007
+0.55938546291290392 -1.444096083320241 0.32839555720531116  -0.64057192708348298 -0.69398384882087039 0.32871571883365153
+0.45975411381438525 -1.3644698341819119 0.27287882084494525  -0.74028370995146853 -0.61436698850995375 0.27300775118977932
+0.61249238098892733 -1.4217091588743203 0.45126666560725864  -0.58763152153323139 -0.67149417441485548 0.45142526361231827
+0.67627605216262487 -1.3861001815799721 0.56664784959934433  -0.52380155193385192 -0.63632626043050544 0.56632219140540219
+0.62391616211425593 -0.41005164309557418 0.74334549596053445  -0.57610127698437319 0.34013694034011493 0.74324570666303869
+0.57325238119242883 -1.2655632797953908 0.58427898032160908  -0.62647295099493583 -0.51565247738810605 0.58449479401890769
+0.64783116020585174 -1.2162660666179785 0.6911624465210644  -0.55222595833072996 -0.46647300291392807 0.69097715483087374
+0.84637064705828369 -1.2155650436231662 0.81129246939324073  -0.35387698305874449 -0.46550486715932471 0.81121902067950824
+0.73132295016564974 -1.1563294025426434 0.7843712383737107  -0.46877433341208929 -0.4064686393764283 0.78424095119900905
+1.7155632797953904 -0.16572101967839092 -0.62674761880757124  0.51582822603431733 0.58403467808965204 -0.62675731827798065
+1.7521688397941486 -0.28373393338202163 -0.69116244652106418  0.55222595833073063 0.46647300291392718 -0.69097715483087374
+1.8730187872058686 -0.48182848239968035 -0.68929656115193494  0.67285685715261245 0.2683644632421518 -0.68937955050281297
+1.7760838378857442 -0.41005164309557424 -0.74334549596053434  0.5761012769843743 0.34013694034011466 -0.74324570666303802
+1.8267476188075715 -1.2655632797953904 -0.58427898032160897  0.62647295099493516 -0.5156524773881066 -0.58449479401890814
+1.7521688397941486 -1.2162660666179783 -0.69116244652106418  0.55222595833073052 -0.46647300291392779 -0.69097715483087352
+1.5536293529417169 -1.2155650436231658 -0.81129246939324051  0.35387698305874349 -0.4655048671593236 -0.81121902067950935
+1.6686770498343508 -1.1563294025426429 -0.78437123837371048  0.46877433341208991 -0.40646863937642802 -0.78424095119900883
+1.5186356302649235 -0.68128429947378111 -0.94538324907249438  0.31897512469198214 0.068666567984592433 -0.94527232704070618
+1.4022655037944636 -0.74999999999999989 -0.97933072349169759  0.20254321521823387 -2.5006401236892162e-16 -0.97927332546590906
+1.2802812773502414 -0.94739352602284621 -0.97703158208487884  0.080345839839679356 -0.197140403917173 -0.97707738033577995
+1.2813709460566907 -0.81638104563821712 -0.9944708773603258  0.08157879688761327 -0.066331699036313224 -0.99445714115859496
+0.68443672020460955 -1.3342789803216091 -0.62674761880757146  -0.51582822603431644 -0.58403467808965193 -0.62675731827798142
+0.64783116020585152 -1.2162660666179783 -0.69116244652106429  -0.5522259583307314 -0.46647300291392718 -0.69097715483087319
+0.52698121279413157 -1.0181715176003197 -0.68929656115193516  -0.67285685715261323 -0.26836446324215107 -0.68937955050281274
+0.62391616211425593 -1.0899483569044257 -0.74334549596053445  -0.57610127698437252 -0.3401369403401156 -0.7432457066630388
+0.88136436973507692 -0.68128429947378122 -0.9453832490724946  -0.31851500876272476 0.068382200701544715 -0.94544807568691747
+0.77283811630245081 -0.61100639327308426 -0.89342795031552769  -0.42704736713517799 0.13875119650014148 -0.89352037004910612
+0.57659777085683772 -0.61172631781262776 -0.76957783850217643  -0.62320039727703602 0.13836216352689645 -0.76972539034249132
+0.67420617247402481 -0.54171259951203332 -0.82471644201722483  -0.52568280774650522 0.20813967421463611 -0.82482450355064996
+0.49772297467792337 -1.4587176976875216 0.067277074024322203  -0.7027686356490408 -0.70820887911908448 0.067501320615791435
+0.51981928149304746 -1.4551970771451346 0.20012814034344362  -0.68040299513329339 -0.70493504308661636 0.20029565457621368
+0.57421811130996692 -1.5299980947332723 0  -0.62694312538533159 -0.77906499229253678 0.00023519417927653918
+0.65998203120107946 -1.5898638505656821 -0.054857140713616928  -0.5397948923634549 -0.8398785805069594 -0.056792994144885846
+0.27630591545862715 -1.0226998137406513 0.26911716736226515  -0.92375019852295004 -0.27282039415738807 0.26880216379452382
+0.33769549234610641 -1.1259607778954337 0.33924096091721689  -0.86229745711633843 -0.37608264246842493 0.33912378489964901
+0.24939270379056044 -1.0288981373351189 0.13624095340381406  -0.95064905270461686 -0.27889806070390488 0.13594944033505735
+0.2402206179342532 -1.0307552987238056 0  -0.95982343558557026 -0.28060440841513645 -0.00037212726838045277
+1.1312842994737813 0.1953832490724946 0.31863563026492325  -0.068666567984591781 0.94527232704070585 0.31897512469198336
+1.2 0.22933072349169759 0.20226550379446331  3.4731112829016888e-18 0.97927332546590884 0.20254321521823493
+1.3973935260228463 0.22703158208487906 0.080281277350241251  0.19714040391717272 0.97707738033578007 0.08034583983967887
+1.2663810456382176 0.24447087736032569 0.081370946056690249  0.06633169903631346 0.99445714115859496 0.081578796887612895
+1.2000000000000002 0.15291461058653233 -0.4298199692771042  -0.00028436728304575399 0.90300980278163412 -0.42961984965260003
+1.3389936067269161 0.14342795031552757 -0.42716188369754932  0.13875119650014284 0.89352037004910634 -0.42704736713517738
+1.5356672082102183 0.141573746743482 -0.30401279487901056  0.33550256744406881 0.89156486051918704 -0.30422052318316811
+1.4746684461261839 0.11574218443040085 -0.41838703947458189  0.27447137325094767 0.8658197480866211 -0.4183558641742206
+2.1029146105865326 -0.32018003072289597 0  0.90300980278163423 0.42961984965259975 0.00028436728304962827
+2.0934279503155278 -0.32283811630245074 -0.13899360672691588  0.89352037004910589 0.42704736713517844 -0.13875119650014242
+2.0915737467434821 -0.44598720512098944 -0.33566720821021834  0.89156486051918726 0.30422052318316639 -0.33550256744406975
+2.0657421844304009 -0.33161296052541833 -0.27466844612618385  0.86581974808662043 0.41835586417422105 -0.27447137325094917
+2.1029146105865326 -1.1798199692771036 0  0.90300980278163301 -0.42961984965260225 -0.00028436728304584425
+2.0934279503155278 -1.1771618836975488 0.1389936067269158  0.89352037004910567 -0.42704736713517821 0.13875119650014328
+2.0915737467434821 -1.0540127948790103 0.33566720821021817  0.89156486051918749 -0.30422052318316689 0.33550256744406859
+2.0657421844304009 -1.1683870394745814 0.27466844612618369  0.86581974808662021 -0.41835586417422149 0.27447137325094934
+1.6298199692771045 -0.75 0.90291461058653211  0.42961984965259953 0.00028436728304707373 0.90300980278163434
+1.6271618836975499 -0.88899360672691596 0.89342795031552724  0.4270473671351781 -0.1387511965001422 0.89352037004910589
+1.5040127948790105 -1.0856672082102186 0.89157374674348189  0.30422052318316728 -0.33550256744406981 0.89156486051918693
+1.6183870394745821 -1.0246684461261837 0.86574218443040063  0.41835586417422238 -0.27447137325094739 0.86581974808662043
+1.7842789803216095 -1.3767476188075709 0.51556327979539029  0.58449479401890891 -0.62647295099493361 0.5156524773881076
+1.6662660666179789 -1.441162446521064 0.55216883979414799  0.46647300291392879 -0.69097715483087296 0.5522259583307304
+1.4681715176003203 -1.4392965611519348 0.67301878720586839  0.26836446324215246 -0.68937955050281186 0.67285685715261345
+1.5399483569044261 -1.4933454959605343 0.57608383788574391  0.34013694034011693 -0.74324570666303724 0.57610127698437386
+0.68443672020460988 -1.3342789803216091 0.62674761880757146  -0.51582822603431644 -0.58403467808965159 0.62675731827798165
+0.73373393338202175 -1.4411624465210644 0.55216883979414821  -0.46647300291392807 -0.69097715483087219 0.55222595833073174
+0.7344349563768342 -1.5612924693932408 0.35362935294171671  -0.46550486715932454 -0.8112190206795088 0.35387698305874338
+0.79367059745735713 -1.5343712383737107 0.46867704983435055  -0.40646863937642935 -0.78424095119900805 0.46877433341209013
+1.2687157005262188 -1.6953832490724943 0.31863563026492331  0.068666567984592364 -0.94527232704070607 0.31897512469198253
+1.2000000000000002 -1.7293307234916977 0.20226550379446345  1.7087707511876313e-15 -0.97927332546590906 0.20254321521823371
+1.0026064739771541 -1.7270315820848792 0.080281277350241306  -0.19714040391717255 -0.97707738033578018 0.080345839839678579
+1.1336189543617827 -1.7444708773603259 0.081370946056690305  -0.066331699036312086 -0.99445714115859507 0.081578796887612465
+0.61572101967839066 -1.3767476188075713 -0.51556327979539052  -0.58449479401890958 -0.62647295099493461 -0.51565247738810571
+0.73373393338202175 -1.4411624465210644 -0.55216883979414821  -0.46647300291392635 -0.69097715483087474 -0.55222595833073029
+0.93182848239968041 -1.439296561151935 -0.6730187872058685  -0.26836446324215057 -0.6893795505028133 -0.67285685715261268
+0.86005164309557447 -1.4933454959605346 -0.57608383788574402  -0.3401369403401146 -0.74324570666303957 -0.5761012769843723
+1.2687157005262188 -1.6953832490724943 -0.31863563026492325  0.068382200701545798 -0.94544807568691736 -0.31851500876272471
+1.3389936067269161 -1.6434279503155274 -0.42716188369754937  0.13875119650014295 -0.89352037004910545 -0.42704736713517893
+1.3382736821873722 -1.5195778385021765 -0.62340222914316235  0.1383621635268972 -0.76972539034249099 -0.62320039727703636
+1.4082874004879669 -1.5747164420172246 -0.52579382752597525  0.20813967421463467 -0.82482450355065073 -0.52568280774650433
+1.5186356302649235 -0.81871570052621845 -0.94538324907249438  0.31851500876272465 -0.068382200701545895 -0.94544807568691736
+1.6271618836975494 -0.88899360672691574 -0.89342795031552757  0.42704736713517805 -0.13875119650014167 -0.89352037004910601
+1.8234022291431624 -0.88827368218737224 -0.7695778385021762  0.6232003972770368 -0.13836216352689648 -0.76972539034249088
+1.7257938275259754 -0.95828740048796668 -0.82471644201722449  0.52568280774650433 -0.20813967421463572 -0.82482450355065062
+1.7842789803216093 -1.3767476188075713 -0.51556327979539018  0.58449479401890903 -0.6264729509949345 -0.51565247738810627
+1.8911624465210641 -1.3021688397941484 -0.46626606661797826  0.69097715483087363 -0.55222595833073029 -0.46647300291392774
+2.0112924693932408 -1.1036293529417165 -0.4655650436231657  0.81121902067950913 -0.35387698305874249 -0.46550486715932471
+1.9843712383737104 -1.2186770498343509 -0.40632940254264294  0.78424095119900872 -0.46877433341209096 -0.40646863937642724
+2.1453832490724944 -0.43136436973507697 -0.068715700526218768  0.94527232704070618 0.31897512469198236 -0.068666567984592003
+2.1793307234916974 -0.54773449620553694 0  0.97927332546590951 0.20254321521823138 7.6408448223837148e-17
+2.1770315820848789 -0.66971872264975862 0.19739352602284604  0.97707738033577951 0.080345839839677496 0.1971404039171758
+2.1944708773603256 -0.66862905394330951 0.066381045638217215  0.9944571411585954 0.081578796887609967 0.066331699036310518
+2.1453832490724944 -1.0686356302649229 0.068715700526218726  0.94527232704070685 -0.31897512469198008 0.068666567984593432
+2.1793307234916974 -0.95226550379446329 0  0.97927332546590973 -0.20254321521823046 0
+2.1770315820848789 -0.83028127735024104 -0.19739352602284604  0.97707738033577962 -0.08034583983967751 -0.19714040391717561
+2.1944708773603256 -0.83137094605669015 -0.066381045638217187  0.9944571411585954 -0.081578796887609842 -0.066331699036310671
+1.8267476188075715 -0.23443672020460971 -0.58427898032160908  0.62647295099493572 0.51565247738810649 -0.58449479401890769
+1.8911624465210641 -0.19783116020585167 -0.46626606661797843  0.69097715483087474 0.55222595833073052 -0.46647300291392602
+1.889296561151935 -0.076981212794131615 -0.26817151760031976  0.68937955050281385 0.67285685715261223 -0.26836446324215019
+1.9433454959605347 -0.17391616211425631 -0.33994835690442565  0.74324570666303935 0.5761012769843723 -0.34013694034011493
+1.2 -1.6529146105865324 -0.42981996927710425  0.00028436728304640516 -0.90300980278163412 -0.42961984965260003
+1.0610063932730844 -1.6434279503155276 -0.42716188369754948  -0.13875119650014034 -0.89352037004910601 -0.42704736713517849
+0.86433279178978162 -1.6415737467434819 -0.30401279487901062  -0.33550256744406753 -0.89156486051918804 -0.30422052318316672
+0.92533155387381627 -1.615742184430401 -0.41838703947458195  -0.274471373250947 -0.86581974808662088 -0.4183558641742216
+0.29708538941346763 -1.1798199692771041 0  -0.90300980278163434 -0.42961984965259953 -0.00028436728304637046
+0.30657204968447227 -1.1771618836975493 -0.13899360672691591  -0.89352037004910567 -0.42704736713517849 -0.13875119650014259
+0.30842625325651785 -1.0540127948790103 -0.33566720821021845  -0.89156486051918693 -0.3042205231831665 -0.3355025674440707
+0.33425781556959899 -1.1683870394745817 -0.27466844612618391  -0.8658197480866201 -0.41835586417422177 -0.27447137325094878
+0.57325238119242872 -1.2655632797953904 -0.5842789803216093  -0.62675731827798131 -0.51582822603431833 -0.58403467808965048
+0.50883755347893578 -1.3021688397941484 -0.46626606661797843  -0.69097715483087263 -0.55222595833073107 -0.4664730029139284
+0.51070343884806491 -1.4230187872058684 -0.26817151760031971  -0.68937955050281263 -0.67285685715261334 -0.2683644632421508
+0.45665450403946539 -1.3260838378857438 -0.33994835690442576  -0.74324570666303902 -0.5761012769843723 -0.3401369403401156
+0.61572101967839088 -1.3767476188075713 0.51556327979539029  -0.58449479401890914 -0.62647295099493516 0.51565247738810549
+0.50883755347893578 -1.3021688397941484 0.46626606661797843  -0.69097715483087385 -0.55222595833073085 0.46647300291392696
+0.38870753060675922 -1.1036293529417167 0.46556504362316592  -0.8112190206795088 -0.35387698305874399 0.46550486715932421
+0.41562876162628937 -1.2186770498343509 0.40632940254264294  -0.7842409511990085 -0.46877433341208985 0.4064686393764288
+0.25461675092750535 -1.0686356302649229 0.068715700526218781  -0.94527232704070607 -0.3189751246919828 0.06866656798459092
+0.30657204968447227 -1.1771618836975493 0.13899360672691594  -0.89352037004910567 -0.42704736713517838 0.13875119650014259
+0.43042216149782375 -1.3734022291431622 0.13827368218737227  -0.76972539034249121 -0.62320039727703613 0.13836216352689668
+0.37528355798277535 -1.2757938275259753 0.20828740048796671  -0.82482450355065018 -0.52568280774650533 0.20813967421463472
+1.1312842994737815 -1.6953832490724945 0.31863563026492331  -0.068382200701546658 -0.94544807568691691 0.31851500876272587
+1.0610063932730844 -1.6434279503155276 0.42716188369754937  -0.1387511965001425 -0.89352037004910556 0.42704736713517877
+1.0617263178126279 -1.5195778385021765 0.62340222914316235  -0.13836216352689668 -0.76972539034249121 0.62320039727703613
+0.99171259951203317 -1.5747164420172246 0.52579382752597525  -0.20813967421463464 -0.82482450355065107 0.52568280774650411
+0.37598126576074054 -0.98458495860622119 0.51571602924327087  -0.82387113061171735 -0.23530638500725803 0.51562318151862274
+0.31923210876951291 -1.0095222183644981 0.39610117388436322  -0.88070834559541711 -0.25988482570664401 0.39599581735923739
+0.37559104740343063 -0.86626913535565186 0.55392361119767797  -0.82413049582749909 -0.11774782579538251 0.55402560894563424
+0.38108971266128377 -0.75 0.57392154628557124  -0.81788534298629689 0.00078604920685422248 0.57538069819453608
+0.25461675092750535 -1.0686356302649229 -0.068715700526218781  -0.94527232704070607 -0.31897512469198275 -0.06866656798459167
+0.39952765932508105 -1.3452985273360616 -0.069740197633308867  -0.80067536950372631 -0.5950344796892979 -0.069662907281837605
+0.4192318321456685 -1.339425686808948 -0.20731239180326452  -0.78085960551688671 -0.58928970592655938 -0.20735457304096597
+0.33359424365380819 -1.2493406306021806 0  -0.8665295822371375 -0.49912569350340957 0.00015872199696838273
+1.2000000000000002 -0.17607845371442887 0.8189102873387164  0.00078604920685643935 0.57538069819453463 0.81788534298629789
+1.3162691353556522 -0.19607638880232214 0.82440895259656966  0.11760246779863406 0.55440616112166063 0.82389530164822189
+1.4595222183644985 -0.35389882611563678 0.88076789123048704  0.25988482570664406 0.39599581735923461 0.88070834559541833
+1.4345849586062216 -0.23428397075672924 0.82401873423925942  0.23530638500725762 0.5156231815186243 0.82387113061171657
+1.4807552987238062 -0.74999999999999989 0.95977938206574653  0.28060440841513762 -0.00037212726837746596 0.95982343558556993
+1.4788981373351193 -0.61375904659618596 0.95060729620943918  0.27889806070390483 0.13594944033505535 0.9506490527046173
+1.5759607778954343 -0.41075903908278349 0.86230450765389333  0.3760826424684251 0.33912378489964862 0.86229745711633843
+1.4726998137406517 -0.48088283263773512 0.9236940845413727  0.27282039415738796 0.26880216379452349 0.92375019852295015
+1.1451428592863835 -0.20998203120107972 0.83986385056568247  -0.056792994144884909 0.53979489236345513 0.83987858050695929
+1.2000000000000002 -0.12421811130996729 0.77999809473327275  -0.00023519417927636216 0.62694312538533148 0.77906499229253701
+1.4001281403434436 -0.069819281493047614 0.70519707714513458  0.20029565457621304 0.68040299513329194 0.70493504308661781
+1.2672770740243227 -0.047722974677923635 0.70871769768752158  0.067501320615790811 0.70276863564903991 0.70820887911908526
+1.7666478495993445 -0.22627605216262514 0.63610018157997195  0.56692430597377852 0.52342942466547437 0.63609627313050654
+1.6512666656072588 -0.16249238098892749 0.67170915887432037  0.45142526361231788 0.58763152153323128 0.67149417441485582
+1.4728788208449453 -0.0097541138143855122 0.61446983418191214  0.27300775118977932 0.74028370995146853 0.61436698850995386
+1.5283955572053114 -0.10938546291290407 0.69409608332024086  0.32871571883365219 0.64057192708348309 0.69398384882086994
+1.1660964225133497 -0.26483917191469658 0.87376742805233332  -0.034313951497558143 0.48348770334523578 0.87467833713118359
+1.0837308646443482 -0.19607638880232214 0.82440895259656966  -0.11774782579538186 0.55402560894563402 0.82413049582749931
+1.0641637744730592 -0.030084692934636004 0.68063975088704354  -0.13609530337963688 0.72008099426245653 0.68041269101920532
+1.0069945598044525 -0.12542737832173323 0.75674166021493716  -0.19358827458119388 0.62484261256047791 0.75636980999592573
+1.2694523319806277 0.1668554803037775 0.39313153246640248  0.06940195445672516 0.91670068154564299 0.39350124418016807
+1.2 0.11640575634619166 0.49934063060218076  0.00015872199696780447 0.86652958223713705 0.49912569350341029
+0.9926876081967354 0.030768167854331341 0.58942568680894825  -0.20735457304096638 0.78085960551688705 0.58928970592655883
+1.1302598023666912 0.050472340674918903 0.59529852733606181  -0.069662907281836717 0.80067536950372642 0.59503447968929779
+1.2339035774866509 -0.26483917191469664 0.87376742805233321  0.03558580583107987 0.48427375255209093 0.87419253200451719
+1.1281417225076453 -0.31234552415797412 0.8962672300889245  -0.072917516439698377 0.4366583353262779 0.89666746009117004
+0.91592045537741096 -0.28960691129913413 0.84103330267207566  -0.28440717777405583 0.46019616855581391 0.84103034646625285
+1.0134390039211945 -0.36001233692795437 0.90172313788306924  -0.18714545413041725 0.38953622755321993 0.9017971537002798
+0.28314451969622234 -1.1431315324664022 0.069452331980627627  -0.91670068154564344 -0.39350124418016724 0.069401954456724341
+0.74873333439274148 -0.16249238098892738 0.67170915887432037  -0.45142526361231566 0.58763152153323017 0.67149417441485826
+0.79899507473160236 -0.34519261004110258 0.82178222598517658  -0.4011599250518198 0.40477696304846228 0.8217215615509198
+0.82850263027516902 -0.22222747306573265 0.76383628095354994  -0.37176976328895961 0.52785497534633785 0.76364675610270738
+1.2548571407136169 -0.20998203120107972 0.83986385056568236  0.056792994144885006 0.53979489236345513 0.83987858050695929
+1.271858277492355 -0.31234552415797412 0.8962672300889245  0.072536964263671039 0.43642314114700037 0.89681281808791979
+1.1602654114415887 -0.48973505164257786 0.96471929550963276  -0.039677999129163512 0.2599005139796004 0.96481986879326109
+1.2777044036438101 -0.42728941095227679 0.94330265629374277  0.077926023088563209 0.32203490693742853 0.94351526412634279
+0.80686846753359776 -0.68054766801937239 0.91685548030377773  -0.39350124418016713 0.069401954456725465 0.91670068154564333
+0.92110186266488114 -0.61375904659618596 0.9506072962094394  -0.27889806070390516 0.13594944033505688 0.95064905270461697
+1.1594777183312834 -0.61807143088604777 0.99043061207734606  -0.040575895565417477 0.13176921185868248 0.99044963097837835
+1.0401421964121773 -0.55062303027104376 0.96679589706089264  -0.1601034424202428 0.19913925651268588 0.96680424297825807
+1.1451428592863835 -0.20998203120107972 -0.83986385056568247  -0.056307189018220377 0.54106674669697519 -0.83909253130010497
+1.1281417225076453 -0.31234552415797412 -0.8962672300889245  -0.072917516439697155 0.43665833532627857 -0.89666746009116993
+1.2397345885584119 -0.48973505164257786 -0.96471929550963276  0.039677999129163456 0.2599005139796004 -0.96481986879326109
+1.1222955963561905 -0.42728941095227674 -0.94330265629374299  -0.077926023088562377 0.32203490693742809 -0.94351526412634301
+1.5931315324664026 -0.68054766801937205 -0.91685548030377739  0.3928991296117913 0.069774081725103076 -0.91693066884564156
+1.4788981373351193 -0.61375904659618596 -0.95060729620943918  0.2788980607039051 0.13594944033505696 -0.95064905270461697
+1.2405222816687171 -0.61807143088604777 -0.99043061207734606  0.040575895565417311 0.13176921185868248 -0.99044963097837835
+1.3598578035878233 -0.55062303027104387 -0.96679589706089242  0.16010344242024502 0.19913925651268566 -0.96680424297825773
+1.2000000000000002 -0.17607845371442887 -0.8189102873387164  0.00078604920685399165 0.57538069819453563 -0.81788534298629723
+1.0837308646443482 -0.19607638880232214 -0.82440895259656966  -0.11774782579538265 0.55402560894563257 -0.8241304958275002
+0.94047778163550189 -0.35389882611563678 -0.88076789123048704  -0.25988482570664379 0.39599581735923595 -0.88070834559541789
+0.96541504139377876 -0.23428397075672924 -0.82401873423925942  -0.23530638500725815 0.5156231815186223 -0.82387113061171757
+0.9192447012761944 -0.74999999999999989 -0.95977938206574664  -0.2806044084151379 0.00037212726837797293 -0.95982343558556982
+0.92110186266488114 -0.61375904659618596 -0.9506072962094394  -0.2788980607039056 0.13594944033505726 -0.95064905270461675
+0.82403922210456626 -0.41075903908278338 -0.86230450765389366  -0.37608264246842449 0.33912378489964912 -0.86229745711633865
+0.9273001862593484 -0.48088283263773507 -0.92369408454137281  -0.27282039415738762 0.26880216379452387 -0.92375019852295004
+1.2548571407136169 -0.20998203120107972 -0.83986385056568236  0.05679299414488588 0.53979489236345568 -0.83987858050695885
+1.2000000000000002 -0.12421811130996729 -0.77999809473327275  0.00023519417927831535 0.62694312538533148 -0.77906499229253701
+0.99987185965655645 -0.069819281493047614 -0.70519707714513458  -0.20029565457621246 0.68040299513329205 -0.70493504308661803
+1.1327229259756779 -0.047722974677923524 -0.70871769768752169  -0.067501320615790825 0.70276863564903991 -0.70820887911908537
+0.57542737832173307 -1.5067416602149373 -0.19300544019554752  -0.62484261256047646 -0.75636980999592629 -0.19358827458119632
+0.74873333439274126 -0.16249238098892738 -0.67170915887432048  -0.45142526361230273 0.58763152153321885 -0.67149417441487691
+0.92712117915505488 -0.0097541138143854011 -0.61446983418191226  -0.2730077511897796 0.74028370995146864 -0.61436698850995353
+0.87160444279468874 -0.10938546291290407 -0.69409608332024098  -0.32871571883365308 0.64057192708348221 -0.6939838488208705
+1.2339035774866509 -0.26483917191469664 -0.87376742805233321  0.034313951497560419 0.48348770334523578 -0.87467833713118348
+1.3162691353556522 -0.19607638880232214 -0.82440895259656966  0.11774782579538323 0.55402560894563191 -0.82413049582750042
+1.3358362255269414 -0.030084692934636004 -0.68063975088704354  0.13609530337963555 0.72008099426245742 -0.68041269101920465
+1.3930054401955481 -0.12542737832173323 -0.75674166021493716  0.1935882745811954 0.62484261256047757 -0.75636980999592551
+1.1305476680193727 0.1668554803037775 -0.39313153246640248  -0.06940195445672484 0.91670068154564333 -0.39350124418016724
+1.2000000000000002 0.11640575634619166 -0.49934063060218076  -0.00015872199696780447 0.86652958223713705 -0.49912569350341041
+1.4073123918032642 0.030768167854331452 -0.58942568680894836  0.20735457304096577 0.78085960551688738 -0.5892897059265586
+1.2697401976333089 0.050472340674918903 -0.59529852733606181  0.069662907281837327 0.80067536950372598 -0.59503447968929846
+1.1660964225133497 -0.26483917191469669 -0.87376742805233321  -0.034313951497560037 0.48348770334523533 -0.87467833713118381
+1.271858277492355 -0.31234552415797412 -0.8962672300889245  0.072917516439698168 0.43665833532627896 -0.8966674600911696
+1.4840795446225896 -0.28960691129913418 -0.84103330267207554  0.28440717777405683 0.46019616855581313 -0.84103034646625296
+1.3865609960788059 -0.36001233692795448 -0.90172313788306901  0.18714545413041792 0.3895362275532197 -0.90179715370027969
+1.7237239478373754 -0.11389981842002828 -0.56664784959934411  0.52342942466547415 0.63609627313050576 -0.56692430597377963
+1.6512666656072588 -0.16249238098892749 -0.67170915887432026  0.45152335920120784 0.58737470394737423 -0.67165289641182335
+1.6010049252683982 -0.34519261004110269 -0.82178222598517636  0.40115992505181991 0.40477696304846139 -0.82172156155092013
+1.5714973697248311 -0.22222747306573276 -0.76383628095354983  0.37176976328896055 0.52785497534633763 -0.76364675610270705
+1.6851608280853034 -1.6237674280523331 -0.033903577486650918  0.48348770334523483 -0.87467833713118415 -0.034313951497558663
+1.6376544758420264 -1.6462672300889243 0.071858277492354988  0.43642314114700104 -0.89681281808791946 0.072536964263670678
+1.660393088700866 -1.5910333026720753 0.28407954462258922  0.46019616855581286 -0.84103034646625341 0.28440717777405605
+1.589987663072046 -1.651723137883069 0.18656099607880569  0.38953622755321926 -0.90179715370028024 0.18714545413041631
+1.836100181579972 -1.3166478495993439 0.52372394783737497  0.63609627313050565 -0.56692430597377952 0.52342942466547437
+1.7875076190110732 -1.4217091588743203 0.45126666560725837  0.58737470394737512 -0.6716528964118228 0.45152335920120756
+1.6048073899588982 -1.5717822259851764 0.40100492526839771  0.404776963048462 -0.82172156155091969 0.40115992505182024
+1.7277725269342676 -1.5138362809535497 0.37149736972483094  0.52785497534633852 -0.76364675610270749 0.37176976328895861
+1.7400179687989208 -1.5898638505656821 -0.054857140713616921  0.53979489236345524 -0.83987858050695918 -0.056792994144885173
+1.6376544758420264 -1.6462672300889243 -0.071858277492354988  0.43665833532627957 -0.89666746009116938 -0.072917516439697114
+1.4602649483574226 -1.7147192955096329 0.039734588558411603  0.25990051397960245 -0.96481986879326054 0.039677999129164386
+1.5227105890477237 -1.6933026562937428 -0.077704403643809719  0.32203490693742914 -0.94351526412634257 -0.077926023088563112
+1.2694523319806277 -1.6668554803037776 0.39313153246640242  0.069401954456726839 -0.91670068154564266 0.39350124418016835
+1.3362409534038142 -1.7006072962094394 0.27889813733511915  0.13594944033505418 -0.9506490527046173 0.27889806070390538
+1.3319285691139524 -1.7404306120773461 0.040522281668716881  0.13176921185868179 -0.99044963097837846 0.040575895565416499
+1.3993769697289566 -1.7167958970608925 0.15985780358782289  0.19913925651268646 -0.96680424297825795 0.16010344242024308
+1.7739215462855715 -1.5689102873387162 0  0.57538069819453597 -0.817885342986297 0.00078604920685557502
+1.7539236111976781 -1.5744089525965697 -0.11626913535565191  0.55440616112166052 -0.82389530164822178 -0.11760246779863529
+1.5961011738843633 -1.630767891230487 -0.25952221836449829  0.39599581735923645 -0.88070834559541733 -0.25988482570664473
+1.7157160292432709 -1.5740187342392593 -0.23458495860622131  0.51562318151862419 -0.82387113061171635 -0.23530638500725889
+1.2 -1.7097793820657468 -0.28075529872380584  0.00037212726837937269 -0.95982343558557015 -0.28060440841513695
+1.3362409534038142 -1.7006072962094394 -0.27889813733511915  0.13594944033505682 -0.95064905270461686 -0.27889806070390533
+1.5392409609172168 -1.6123045076538933 -0.37596077789543381  0.33912378489964934 -0.86229745711633832 -0.37608264246842488
+1.4691171673622654 -1.6736940845413726 -0.27269981374065155  0.26880216379452337 -0.92375019852295026 -0.27282039415738757
+1.7400179687989206 -1.5898638505656821 0.054857140713616921  0.53979489236345557 -0.83987858050695907 0.056792994144885221
+1.825781888690033 -1.5299980947332725 0  0.6269431253853317 -0.77906499229253678 0.00023519417927932233
+1.8801807185069523 -1.4551970771451344 -0.20012814034344359  0.6804029951332915 -0.70493504308661814 -0.20029565457621346
+1.9022770253220767 -1.4587176976875214 -0.067277074024322189  0.70276863564903891 -0.70820887911908625 -0.067501320615791519
+1.7237239478373754 -1.3861001815799718 -0.56664784959934411  0.52342942466547437 -0.6360962731305061 -0.56692430597377907
+1.7875076190110728 -1.4217091588743203 -0.45126666560725848  0.5873747039473759 -0.67165289641182291 -0.45152335920120634
+1.9402458861856147 -1.3644698341819119 -0.27287882084494525  0.74028370995146864 -0.61436698850995319 -0.27300775118977999
+1.8406145370870961 -1.444096083320241 -0.32839555720531111  0.64057192708348309 -0.69398384882087072 -0.32871571883365075
+1.6851608280853034 -1.6237674280523331 0.033903577486650918  0.4842737525520891 -0.87419253200451819 0.035585805831078579
+1.7539236111976781 -1.5744089525965697 0.11626913535565191  0.55440616112166141 -0.82389530164822145 0.11760246779863319
+1.9199153070653643 -1.4306397508870434 0.135836225526941  0.72008099426245864 -0.68041269101920343 0.13609530337963519
+1.8245726216782669 -1.5067416602149368 0.19300544019554741  0.62484261256047779 -0.75636980999592529 0.19358827458119593
+2.1168554803037778 -1.143131532466402 -0.069452331980627571  0.9167006815456431 -0.39350124418016769 -0.069401954456726131
+2.0664057563461915 -1.2493406306021804 0  0.86652958223713739 -0.49912569350340974 -0.00015872199696955489
+1.9807681678543316 -1.3394256868089478 0.20731239180326447  0.78085960551688716 -0.58928970592655916 0.207354573040965
+2.0004723406749187 -1.3452985273360616 0.069740197633308881  0.80067536950372709 -0.59503447968929668 0.069662907281837147
+2.0189102873387164 -0.75 0.57392154628557113  0.81788534298629878 0.00078604920685481803 0.57538069819453352
+2.0244089525965694 -0.63373086464434825 0.55392361119767775  0.82413049582749909 0.11774782579538255 0.55402560894563413
+2.0807678912304874 -0.49047778163550187 0.39610117388436322  0.88070834559541789 0.25988482570664423 0.39599581735923545
+2.0240187342392595 -0.51541504139377881 0.51571602924327065  0.82387113061171635 0.23530638500725831 0.5156231815186243
+2.1597793820657469 -0.46924470127619466 0  0.95982343558557015 0.28060440841513684 0.00037212726837914176
+2.1506072962094391 -0.47110186266488102 0.13624095340381404  0.95064905270461686 0.27889806070390538 0.1359494403350571
+2.0623045076538933 -0.37403922210456625 0.33924096091721667  0.86229745711633821 0.37608264246842488 0.33912378489964945
+2.1236940845413725 -0.47730018625934845 0.26911716736226499  0.92375019852295037 0.27282039415738735 0.26880216379452299
+1.2339035774866509 -1.2351608280853033 -0.87376742805233332  0.035585805831079446 -0.48427375255209149 -0.87419253200451685
+1.1281417225076453 -1.187654475842026 -0.8962672300889245  -0.072536964263671705 -0.43642314114700137 -0.89681281808791924
+0.91592045537741096 -1.2103930887008658 -0.84103330267207566  -0.28440717777405644 -0.46019616855581419 -0.84103034646625252
+1.013439003921194 -1.1399876630720454 -0.90172313788306901  -0.18714545413041717 -0.38953622755321937 -0.90179715370027991
+0.67627605216262476 -1.3861001815799718 -0.56664784959934444  -0.52380155193385225 -0.63632626043050522 -0.56632219140540208
+0.74873333439274137 -1.3375076190110722 -0.67170915887432059  -0.45152335920120801 -0.58737470394737301 -0.67165289641182435
+0.79899507473160225 -1.1548073899588973 -0.8217822259851767  -0.40115992505182013 -0.40477696304846295 -0.82172156155091924
+0.82850263027516902 -1.277772526934267 -0.76383628095354994  -0.37176976328896022 -0.52785497534633852 -0.76364675610270671
+0.48008469293463596 -1.4306397508870434 -0.135836225526941  -0.72008099426245697 -0.68041269101920476 -0.13609530337963671
+0.6460763888023221 -1.5744089525965697 -0.11626913535565191  -0.55402560894563335 -0.82413049582749964 -0.11774782579538229
+0.71483917191469648 -1.6237674280523331 -0.033903577486650918  -0.483487703345236 -0.87467833713118348 -0.034313951497560155
+0.43616371904645013 -1.1214973697248312 -0.52777252693426746  -0.76364675610270671 -0.37176976328896022 -0.52785497534633863
+0.28314451969622234 -1.1431315324664022 -0.069452331980627627  -0.91693066884564178 -0.39289912961179069 -0.069774081725102424
+0.24939270379056055 -1.0288981373351189 -0.13624095340381406  -0.95064905270461697 -0.27889806070390527 -0.13594944033505632
+0.37821777401482348 -1.151004925268398 -0.40480738995889742  -0.82172156155092024 -0.40115992505181919 -0.40477696304846206
+0.52829084112567948 -1.2012666656072586 -0.58750761901107273  -0.67149417441485526 -0.45142526361231838 -0.58763152153323139
+0.63335215040065551 -1.2737239478373747 -0.63610018157997217  -0.56632219140540285 -0.52380155193385192 -0.63632626043050466
+0.42000190526672743 -0.75 0.62578188869003293  -0.77906499229253756 0.00023519417927674757 0.6269431253853307
+0.49480292285486549 -0.95012814034344351 0.6801807185069525  -0.70493504308661692 -0.20029565457621212 0.68040299513329316
+0.49128230231247838 -0.81727707402432204 0.7022770253220767  -0.7082088791190847 -0.06750132061579163 0.70276863564904057
+0.56389981842002823 -1.3166478495993443 0.52372394783737519  -0.63632626043050455 -0.56632219140540296 0.52380155193385181
+0.5282908411256797 -1.2012666656072586 0.58750761901107262  -0.67165289641182369 -0.45152335920120656 0.58737470394737479
+0.58553016581808803 -1.0228788208449453 0.74024588618561449  -0.61436698850995364 -0.27300775118977955 0.74028370995146853
+0.50590391667975909 -1.0783955572053112 0.64061453708709626  -0.6939838488208705 -0.32871571883365241 0.64057192708348243
+0.29827686211693072 -0.9365609960788055 -0.38998766307204569  -0.90179715370027946 -0.18714545413041772 -0.38953622755322032
+0.35896669732792441 -1.0340795446225892 -0.46039308870086582  -0.84103034646625285 -0.28440717777405633 -0.46019616855581358
+0.67222747306573261 -1.5138362809535497 -0.37149736972483099  -0.52785497534633774 -0.7636467561027076 -0.37176976328895966
+0.79519261004110253 -1.5717822259851766 -0.40100492526839782  -0.4047769630484625 -0.82172156155092002 -0.40115992505181935
+0.61249238098892722 -1.4217091588743203 -0.45126666560725853  -0.58763152153323051 -0.67149417441485715 -0.45142526361231683
+0.56389981842002801 -1.3166478495993443 -0.5237239478373753  -0.63609627313050687 -0.56692430597377752 -0.52342942466547515
+0.81001233692795449 -1.6517231378830692 -0.18656099607880575  -0.38953622755321782 -0.90179715370028091 -0.18714545413041614
+0.73960691129913414 -1.5910333026720753 -0.28407954462258922  -0.46019616855581497 -0.84103034646625252 -0.28440717777405544
+1.1451428592863835 -1.2900179687989204 0.83986385056568236  -0.056792994144885159 -0.53979489236345424 0.83987858050695985
+1.1281417225076453 -1.187654475842026 0.8962672300889245  -0.072536964263670262 -0.43642314114700137 0.89681281808791935
+1.2397345885584119 -1.0102649483574224 0.96471929550963254  0.039677999129167051 -0.25990051397960068 0.96481986879326098
+1.1222955963561905 -1.0727105890477233 0.94330265629374277  -0.077926023088561697 -0.32203490693742803 0.94351526412634312
+1.5931315324664026 -0.81945233198062728 0.9168554803037775  0.39289912961179108 -0.069774081725103507 0.91693066884564156
+1.4788981373351193 -0.88624095340381404 0.95060729620943918  0.27915487828976276 -0.13610816233202525 0.95055095711572812
+1.2405222816687171 -0.88192856911395234 0.99043061207734606  0.040575895565419198 -0.1317692118586829 0.99044963097837824
+1.3598578035878233 -0.94937696972895613 0.96679589706089242  0.16010344242024468 -0.19913925651268555 0.96680424297825784
+2.0737674280523333 -0.78390357748665085 0.48516082808530303  0.8741925320045173 -0.035585805831078232 0.48427375255209065
+2.0244089525965698 -0.86626913535565175 0.55392361119767775  0.82413049582750142 -0.11774782579538097 0.55402560894563102
+1.8806397508870436 -0.88583622552694086 0.71991530706536389  0.68041269101920565 -0.13609530337963607 0.72008099426245631
+1.9567416602149375 -0.94300544019554744 0.62457262167826655  0.75636980999592573 -0.1935882745811936 0.62484261256047802
+1.5931315324664028 -0.68054766801937228 0.91685548030377739  0.39289912961179124 0.069774081725103868 0.91693066884564145
+1.6993406306021812 -0.75 0.86640575634619155  0.49912569350341046 0.00015872199696907044 0.86652958223713705
+1.7894256868089482 -0.95731239180326466 0.78076816785433145  0.5892897059265586 -0.20735457304096644 0.78085960551688716
+1.7952985273360618 -0.81974019763330874 0.80047234067491868  0.59503447968929735 -0.069662907281837508 0.80067536950372653
+2.0398638505656823 -0.8048571407136168 0.54001796879892006  0.83987858050696018 -0.056792994144883174 0.53979489236345402
+1.9799980947332727 -0.75 0.62578188869003271  0.77906499229253734 -0.00023519417927865213 0.62694312538533092
+1.9051970771451345 -0.54987185965655661 0.68018071850695228  0.70493504308661692 0.20029565457621337 0.68040299513329283
+1.9087176976875218 -0.68272292597567774 0.70227702532207648  0.70820887911908492 0.067501320615790811 0.70276863564904035
+1.836100181579972 -0.183352150400656 0.52372394783737508  0.63632626043050544 0.56632219140540208 0.52380155193385192
+1.8717091588743204 -0.29873333439274163 0.58750761901107262  0.67149417441485515 0.45142526361231761 0.58763152153323228
+1.8144698341819119 -0.47712117915505492 0.74024588618561449  0.61436698850995353 0.27300775118978104 0.74028370995146819
+1.8940960833202412 -0.42160444279468906 0.64061453708709593  0.6939838488208705 0.32871571883365097 0.64057192708348309
+1.7400179687989203 0.089863850565682246 -0.054857140713616907  0.53979489236345624 0.83987858050695852 -0.056792994144884971
+1.8257818886900328 0.02999809473327264 0  0.62694312538533126 0.77906499229253712 -0.00023519417927808962
+1.8801807185069523 -0.044802922854865423 0.20012814034344364  0.68040299513329283 0.70493504308661703 0.20029565457621282
+1.9022770253220767 -0.041282302312478536 0.067277074024322203  0.70276863564903935 0.70820887911908592 0.06750132061579249
+1.7237239478373754 -0.11389981842002828 0.56664784959934422  0.52380155193385225 0.63632626043050444 0.56632219140540274
+1.7875076190110728 -0.078290841125679855 0.45126666560725853  0.58737470394737501 0.67165289641182324 0.4515233592012069
+1.9402458861856147 -0.13553016581808797 0.27287882084494519  0.74028370995146875 0.61436698850995375 0.27300775118977888
+1.8406145370870961 -0.055903916679759136 0.32839555720531111  0.64057192708348287 0.69398384882087016 0.32871571883365219
+1.7739215462855711 0.068910287338716403 0  0.57538069819453486 0.81788534298629789 0.0007860492068549708
+1.7539236111976779 0.074408952596569544 0.11626913535565189  0.55440616112166197 0.82389530164822122 0.11760246779863301
+1.5961011738843633 0.13076789123048704 0.25952221836449818  0.39599581735923656 0.88070834559541755 0.25988482570664356
+1.7157160292432707 0.074018734239259421 0.23458495860622128  0.51562318151862485 0.82387113061171613 0.23530638500725806
+1.2 0.20977938206574664 0.28075529872380572  -0.00037212726837706128 0.95982343558557015 0.28060440841513684
+1.3362409534038142 0.2006072962094394 0.27889813733511909  0.13594944033505521 0.95064905270461708 0.27889806070390538
+1.5392409609172171 0.11230450765389333 0.37596077789543386  0.33912378489964912 0.86229745711633854 0.37608264246842454
+1.4691171673622654 0.17369408454137258 0.27269981374065155  0.26880216379452387 0.92375019852294971 0.27282039415738862
+0.76234552415797374 -1.6462672300889243 -0.071858277492354988  -0.4364231411470012 -0.89681281808791946 -0.072536964263670831
+0.71483917191469648 -1.6237674280523331 0.033903577486650918  -0.48427375255209054 -0.87419253200451741 0.035585805831079363
+2.0004723406749187 -0.15470147266393841 -0.069740197633308881  0.8006753695037262 0.5950344796892979 -0.069662907281837536
+1.9807681678543314 -0.16057431319105175 -0.2073123918032645  0.7808596055168866 0.58928970592655905 -0.20735457304096727
+1.1305476680193725 0.1668554803037775 0.39313153246640242  -0.06977408172510273 0.91693066884564134 0.39289912961179158
+1.0637590465961857 0.2006072962094394 0.27889813733511909  -0.13594944033505751 0.95064905270461653 0.27889806070390633
+1.0680714308860475 0.24043061207734606 0.040522281668716874  -0.13176921185868193 0.99044963097837835 0.040575895565418109
+1.0006230302710435 0.21679589706089242 0.15985780358782284  -0.19913925651268669 0.96680424297825773 0.16010344242024396
+2.0664057563461915 -0.25065936939781941 0  0.86652958223713605 0.49912569350341202 0.00015872199696870571
+2.1168554803037778 -0.35686846753359769 0.069452331980627585  0.91670068154564477 0.39350124418016402 0.069401954456724813
+1.8245726216782669 0.0067416602149371618 -0.19300544019554747  0.62484261256047702 0.7563698099959264 -0.19358827458119424
+1.9199153070653638 -0.069360249112956351 -0.135836225526941  0.72008099426245753 0.68041269101920465 -0.13609530337963582
+1.7539236111976779 0.074408952596569544 -0.11626913535565189  0.55440616112166197 0.82389530164822122 -0.11760246779863306
+1.6851608280853034 0.12376742805233321 -0.033903577486650911  0.48348770334523633 0.87467833713118326 -0.034313951497558191
+2.1667958970608927 -0.59014219641217724 -0.19937696972895622  0.96680424297825762 0.16010344242024313 -0.19913925651268791
+2.1904306120773462 -0.70947771833128304 -0.13192856911395226  0.99044963097837835 0.040575895565418046 -0.13176921185868257
+2.1506072962094391 -0.47110186266488108 -0.13624095340381398  0.95064905270461675 0.27889806070390527 -0.13594944033505743
+2.1168554803037778 -0.35686846753359769 -0.069452331980627585  0.91670068154564477 0.39350124418016419 -0.069401954456724438
+2.1433026562937432 -0.82770440364380959 -0.32271058904772343  0.94351526412634346 -0.077926023088562391 -0.32203490693742681
+2.1647192955096326 -0.71026541144158839 -0.26026494835742214  0.96481986879326176 0.039677999129162957 -0.25990051397959818
+2.0962672300889245 -0.82185827749235496 -0.43765447584202588  0.89681281808791991 -0.072536964263670151 -0.43642314114700054
+2.0398638505656823 -0.80485714071361691 -0.54001796879892028  0.83909253130010364 -0.056307189018218906 -0.54106674669697719
+2.1667958970608927 -0.90985780358782276 0.19937696972895622  0.96680424297825762 -0.16010344242024344 0.19913925651268785
+2.1904306120773462 -0.79052228166871696 0.13192856911395226  0.99044963097837835 -0.040575895565418012 0.13176921185868262
+2.1506072962094391 -1.0288981373351189 0.13624095340381398  0.95055095711572801 -0.27915487828976321 0.13610816233202536
+2.1168554803037778 -1.1431315324664022 0.069452331980627571  0.91693066884564189 -0.39289912961178991 0.069774081725105158
+0.51936024911295664 -0.61416377447305892 0.71991530706536411  -0.68041269101920498 0.13609530337963713 0.72008099426245675
+2.1433026562937432 -0.67229559635619029 0.32271058904772337  0.94351526412634346 0.077926023088562182 0.32203490693742687
+0.80686846753359798 -0.81945233198062761 0.91685548030377773  -0.39289912961179085 -0.069774081725103729 0.91693066884564167
+0.70065936939781936 -0.75 0.86640575634619177  -0.49912569350340996 -0.00015872199696909822 0.86652958223713739
+0.61057431319105182 -0.54268760819673534 0.78076816785433145  -0.58928970592655938 0.20735457304096697 0.78085960551688649
+0.60470147266393859 -0.68025980236669126 0.80047234067491901  -0.5950344796892979 0.069662907281838118 0.80067536950372609
+1.2000000000000002 -1.3239215462855713 0.81891028733871629  -0.00078604920685584922 -0.57538069819453419 0.81788534298629834
+1.0837308646443482 -1.3039236111976777 0.82440895259656966  -0.11774782579538229 -0.5540256089456338 0.82413049582749931
+0.94047778163550211 -1.1461011738843636 0.88076789123048704  -0.2598848257066434 -0.39599581735923645 0.88070834559541777
+0.96541504139377909 -1.265716029243271 0.82401873423925931  -0.23530638500725753 -0.51562318151862452 0.82387113061171646
+0.91924470127619462 -0.75 0.95977938206574676  -0.2806044084151364 0.00037212726837861895 0.95982343558557026
+0.92110186266488114 -0.88624095340381404 0.9506072962094394  -0.27889806070390472 -0.13594944033505674 0.95064905270461708
+0.82403922210456648 -1.0892409609172171 0.86230450765389366  -0.37608264246842471 -0.33912378489964967 0.86229745711633832
+0.92730018625934885 -1.0191171673622652 0.92369408454137281  -0.27282039415738757 -0.26880216379452404 0.92375019852295004
+2.0737674280523333 -0.71609642251334893 -0.48516082808530336  0.87419253200451652 0.035585805831079086 -0.48427375255209221
+2.0244089525965694 -0.63373086464434825 -0.55392361119767775  0.82389530164822156 0.11760246779863381 -0.55440616112166108
+1.8806397508870436 -0.61416377447305903 -0.71991530706536389  0.68041269101920465 0.13609530337963732 -0.72008099426245709
+1.9567416602149375 -0.55699455980445267 -0.62457262167826666  0.75636980999592685 0.19358827458119476 -0.62484261256047624
+1.5931315324664026 -0.81945233198062717 -0.9168554803037775  0.39350124418016752 -0.069401954456724702 -0.91670068154564333
+1.699340630602181 -0.74999999999999989 -0.86640575634619155  0.49912569350341046 -0.00015872199696832719 -0.86652958223713705
+1.7894256868089482 -0.54268760819673534 -0.78076816785433145  0.58928970592655949 0.20735457304096749 -0.78085960551688616
+1.7952985273360618 -0.68025980236669115 -0.80047234067491868  0.59503447968929746 0.069662907281837702 -0.80067536950372653
+1.2 -1.3239215462855713 -0.81891028733871629  -0.00078604920685687162 -0.57538069819453419 -0.81788534298629822
+1.3162691353556519 -1.3039236111976777 -0.82440895259656966  0.11760246779863413 -0.55440616112166108 -0.82389530164822145
+1.459522218364498 -1.1461011738843632 -0.88076789123048704  0.25988482570664329 -0.39599581735923417 -0.88070834559541877
+1.4345849586062212 -1.265716029243271 -0.82401873423925931  0.23530638500725776 -0.51562318151862274 -0.82387113061171746
+1.4807552987238062 -0.74999999999999989 -0.95977938206574653  0.28060440841513745 -0.00037212726837840537 -0.95982343558556993
+1.4788981373351193 -0.88624095340381381 -0.95060729620943918  0.27889806070390516 -0.1359494403350556 -0.95064905270461719
+1.5759607778954343 -1.0892409609172169 -0.86230450765389333  0.3760826424684246 -0.33912378489964767 -0.86229745711633909
+1.4726998137406517 -1.019117167362265 -0.9236940845413727  0.27282039415738774 -0.26880216379452249 -0.92375019852295048
+1.2548571407136171 -1.2900179687989204 -0.83986385056568236  0.056307189018218885 -0.5410667466969763 -0.83909253130010431
+1.2718582774923548 -1.187654475842026 -0.8962672300889245  0.0725369642636709 -0.43642314114700093 -0.89681281808791957
+1.1602654114415887 -1.0102649483574224 -0.96471929550963276  -0.039677999129165718 -0.25990051397960168 -0.96481986879326076
+1.2777044036438097 -1.0727105890477233 -0.94330265629374277  0.077926023088563307 -0.32203490693742792 -0.94351526412634301
+0.80686846753359776 -0.81945233198062728 -0.91685548030377773  -0.39289912961179035 -0.069774081725102216 -0.91693066884564189
+0.92110186266488103 -0.88624095340381381 -0.95060729620943951  -0.27889806070390549 -0.13594944033505704 -0.95064905270461686
+1.1594777183312832 -0.88192856911395234 -0.99043061207734606  -0.040575895565417859 -0.1317692118586819 -0.99044963097837846
+1.0401421964121771 -0.94937696972895624 -0.96679589706089264  -0.16010344242024305 -0.19913925651268694 -0.96680424297825784
+2.1647192955096326 -0.78973458855841161 0.26026494835742214  0.96481986879326176 -0.039677999129162901 0.25990051397959829
+0.37559104740343041 -0.86626913535565175 -0.55392361119767775  -0.82389530164822289 -0.1176024677986328 -0.55440616112165941
+0.51936024911295653 -0.88583622552694086 -0.719915307065364  -0.68041269101920487 -0.13609530337963638 -0.72008099426245697
+0.44325833978506268 -0.94300544019554755 -0.62457262167826677  -0.75636980999592562 -0.19358827458119629 -0.62484261256047735
+0.80686846753359776 -0.68054766801937217 -0.91685548030377773  -0.39289912961179091 0.069774081725102133 -0.91693066884564167
+0.70065936939781936 -0.75 -0.86640575634619177  -0.49912569350340996 0.00015872199696907044 -0.86652958223713739
+0.61057431319105182 -0.95731239180326444 -0.78076816785433145  -0.58928970592655927 -0.2073545730409663 -0.78085960551688671
+0.60470147266393859 -0.81974019763330874 -0.80047234067491901  -0.59503447968929835 -0.069662907281838424 -0.80067536950372575
+0.3601361494343176 -0.80485714071361691 -0.54001796879892028  -0.83909253130010897 -0.056307189018239993 -0.54106674669696686
+0.4200019052667272 -0.75 -0.62578188869003293  -0.77906499229253467 -0.00023519417927469891 -0.62694312538533437
+0.49480292285486549 -0.54987185965655649 -0.6801807185069525  -0.70493504308661692 0.20029565457621065 -0.68040299513329361
+0.49128230231247838 -0.68272292597567774 -0.70227702532207659  -0.70820887911908548 0.067501320615790991 -0.7027686356490398
+2.0962672300889245 -0.67814172250764504 0.43765447584202566  0.89666746009116949 0.072917516439697627 0.43665833532627929
+2.0398638505656823 -0.6951428592863832 0.54001796879892017  0.83987858050695907 0.056792994144885436 0.53979489236345557
+0.58553016581808792 -0.47712117915505486 -0.7402458861856146  -0.61436698850995408 0.27300775118977949 -0.74028370995146819
+2.1236940845413725 -1.0226998137406516 -0.26911716736226488  0.92375019852295071 -0.27282039415738712 -0.26880216379452199
+2.0623045076538933 -1.1259607778954337 -0.33924096091721667  0.86229745711633943 -0.37608264246842327 -0.33912378489964806
+2.1506072962094396 -1.0288981373351187 -0.13624095340381401  0.95064905270461664 -0.27889806070390494 -0.13594944033505915
+2.1597793820657469 -1.0307552987238053 0  0.95982343558557071 -0.28060440841513484 -0.00037212726837866411
+2.0240187342392595 -0.98458495860622119 -0.51571602924327065  0.82387113061171613 -0.23530638500725942 -0.51562318151862419
+2.0807678912304874 -1.0095222183644981 -0.39610117388436322  0.88070834559541744 -0.2598848257066434 -0.39599581735923706
+2.0244089525965694 -0.86626913535565175 -0.55392361119767775  0.82413049582749875 -0.11774782579538295 -0.55402560894563468
+2.0189102873387164 -0.75 -0.57392154628557124  0.81788534298629945 0.00078604920685597238 -0.57538069819453252
+1.8940960833202412 -1.078395557205311 -0.64061453708709593  0.69398384882087005 -0.32871571883365164 -0.64057192708348332
+1.8144698341819119 -1.0228788208449451 -0.74024588618561449  0.61436698850995386 -0.2730077511897796 -0.74028370995146842
+1.8717091588743204 -1.2012666656072586 -0.58750761901107251  0.6716528964118238 -0.45152335920120762 -0.58737470394737379
+1.836100181579972 -1.3166478495993443 -0.52372394783737497  0.636326260430505 -0.56632219140540241 -0.52380155193385214
+1.9087176976875218 -0.81727707402432193 -0.70227702532207648  0.70820887911908503 -0.067501320615790811 -0.70276863564904013
+1.2000000000000002 0.20977938206574664 -0.28075529872380572  -0.00037212726837724538 0.95982343558557015 -0.2806044084151369
+1.0637590465961864 0.20060729620943951 -0.27889813733511915  -0.13610816233202511 0.95055095711572812 -0.27915487828976282
+1.9051970771451345 -0.95012814034344339 -0.68018071850695228  0.70493504308661625 -0.20029565457621284 -0.68040299513329372
+1.9799980947332727 -0.75 -0.62578188869003293  0.77906499229253701 0.00023519417927673019 -0.62694312538533126
+1.7400179687989203 0.089863850565682246 0.054857140713616907  0.53979489236345635 0.83987858050695852 0.056792994144884965
+1.6376544758420262 0.14626723008892439 0.071858277492354961  0.43665833532627735 0.89666746009117038 0.072917516439697488
+1.4602649483574224 0.21471929550963276 -0.039734588558411575  0.25990051397960162 0.96481986879326076 -0.039677999129164421
+1.5227105890477235 0.19330265629374277 0.077704403643809677  0.32203490693742948 0.94351526412634246 0.077926023088562682
+1.2694523319806277 0.1668554803037775 -0.39313153246640242  0.069774081725103854 0.91693066884564201 -0.39289912961179002
+1.3362409534038142 0.2006072962094394 -0.27889813733511909  0.13610816233202411 0.95055095711572823 -0.27915487828976299
+1.3319285691139524 0.24043061207734606 -0.040522281668716874  0.13176921185868176 0.99044963097837846 -0.040575895565417866
+1.3993769697289566 0.21679589706089242 -0.15985780358782284  0.19913925651268685 0.96680424297825795 -0.16010344242024246
+1.6851608280853034 0.12376742805233321 0.033903577486650911  0.48348770334523639 0.87467833713118326 0.034313951497558191
+1.6376544758420262 0.14626723008892439 -0.071858277492354961  0.43665833532627735 0.89666746009117038 -0.07291751643969753
+1.660393088700866 0.091033302672075544 -0.28407954462258922  0.46019616855581369 0.84103034646625308 -0.28440717777405566
+1.589987663072046 0.1517231378830689 -0.18656099607880569  0.38953622755322015 0.9017971537002798 -0.18714545413041636
+1.836100181579972 -0.18335215040065589 -0.52372394783737497  0.63609627313050576 0.56692430597378096 -0.52342942466547271
+1.7875076190110728 -0.078290841125679744 -0.45126666560725848  0.58737470394737512 0.67165289641182313 -0.45152335920120712
+1.6048073899588975 0.071782225985176584 -0.40100492526839776  0.40477696304846272 0.82172156155091969 -0.40115992505181969
+1.7277725269342676 0.013836280953549718 -0.37149736972483094  0.52785497534633818 0.76364675610270738 -0.37176976328895917
+2.0737674280523333 -0.78390357748665085 -0.48516082808530336  0.87419253200451652 -0.035585805831079016 -0.48427375255209226
+2.0962672300889245 -0.67814172250764504 -0.43765447584202588  0.89681281808791979 0.072536964263669845 -0.4364231411470007
+2.0410333026720755 -0.46592045537741078 -0.46039308870086587  0.84103034646625241 0.28440717777405677 -0.46019616855581419
+2.1017231378830692 -0.56343900392119417 -0.38998766307204574  0.90179715370028046 0.1871454541304188 -0.38953622755321771
+1.7666478495993445 -0.22627605216262503 -0.63610018157997172  0.56692430597377896 0.52342942466547504 -0.63609627313050565
+1.8717091588743204 -0.29873333439274152 -0.58750761901107251  0.67165289641182369 0.45152335920120729 -0.58737470394737423
+2.0217822259851763 -0.34899507473160229 -0.40480738995889737  0.82172156155091947 0.40115992505182074 -0.404776963048462
+1.9638362809535499 -0.37850263027516906 -0.52777252693426713  0.7636467561027066 0.37176976328896016 -0.52785497534633874
+2.0737674280523333 -0.71609642251334915 0.48516082808530303  0.87419253200451741 0.035585805831078149 0.48427375255209065
+2.0962672300889245 -0.82185827749235496 0.43765447584202566  0.89666746009117027 -0.072917516439695754 0.43665833532627807
+2.0410333026720755 -1.034079544622589 0.46039308870086554  0.84103034646625197 -0.28440717777405777 0.46019616855581447
+2.1017231378830692 -0.93656099607880539 0.38998766307204547  0.90179715370028091 -0.18714545413041644 0.38953622755321782
+1.7666478495993445 -1.2737239478373752 0.63610018157997172  0.5669243059737803 -0.52342942466547338 0.63609627313050576
+1.8717091588743204 -1.2012666656072584 0.58750761901107251  0.67165289641182291 -0.45152335920120612 0.58737470394737612
+2.0217822259851768 -1.1510049252683978 0.40480738995889709  0.82172156155092002 -0.40115992505181952 0.40477696304846211
+1.9638362809535499 -1.1214973697248305 0.52777252693426713  0.76364675610270771 -0.37176976328895944 0.52785497534633763
+1.1660964225133497 -1.2351608280853033 0.87376742805233332  -0.034313951497557262 -0.48348770334523594 0.87467833713118348
+1.271858277492355 -1.187654475842026 0.8962672300889245  0.072536964263671441 -0.43642314114700143 0.89681281808791935
+1.4840795446225896 -1.2103930887008656 0.84103330267207554  0.28440717777405727 -0.46019616855581419 0.8410303464662523
+1.3865609960788059 -1.1399876630720458 0.90172313788306901  0.18714545413041747 -0.38953622755322043 0.90179715370027946
+1.7237239478373758 -1.3861001815799714 0.56664784959934411  0.52380155193385347 -0.63632626043050511 0.56632219140540108
+1.6512666656072592 -1.3375076190110724 0.67170915887432014  0.45142526361231949 -0.58763152153323339 0.67149417441485293
+1.6010049252683982 -1.1548073899588975 0.82178222598517625  0.4011599250518203 -0.40477696304846233 0.82172156155091958
+1.5714973697248313 -1.2777725269342672 0.76383628095354972  0.37176976328896133 -0.52785497534633863 0.76364675610270605
+1.2339035774866509 -1.2351608280853033 0.87376742805233332  0.034313951497557206 -0.48348770334523589 0.87467833713118359
+1.3162691353556522 -1.3039236111976777 0.82440895259656966  0.11760246779863334 -0.55440616112166041 0.82389530164822211
+1.3358362255269416 -1.4699153070653641 0.6806397508870432  0.13609530337963804 -0.72008099426245653 0.68041269101920498
+1.3930054401955481 -1.3745726216782668 0.75674166021493705  0.19358827458119501 -0.62484261256047813 0.75636980999592529
+1.1305476680193727 -1.6668554803037776 0.39313153246640242  -0.069401954456726395 -0.91670068154564333 0.39350124418016702
+1.2000000000000002 -1.6164057563461918 0.49934063060218076  -0.00015872199696771765 -0.86652958223713639 0.49912569350341157
+1.4073123918032651 -1.5307681678543312 0.58942568680894813  0.2073545730409686 -0.7808596055168856 0.58928970592656005
+1.2697401976333094 -1.5504723406749188 0.59529852733606148  0.069662907281836758 -0.80067536950372586 0.59503447968929868
+0.6260784537144285 -1.5689102873387162 0  -0.57538069819453641 -0.81788534298629689 -0.00078604920685377297
+0.6460763888023221 -1.5744089525965697 0.11626913535565191  -0.5544061611216603 -0.82389530164822222 0.11760246779863313
+0.80389882611563657 -1.6307678912304873 0.25952221836449835  -0.39599581735923506 -0.88070834559541866 0.2598848257066424
+0.68428397075672898 -1.5740187342392593 0.23458495860622131  -0.51562318151862396 -0.82387113061171635 0.23530638500725892
+1.2000000000000002 -1.7097793820657468 0.28075529872380584  0.00037212726838103456 -0.95982343558557015 0.28060440841513695
+1.0637590465961864 -1.7006072962094394 0.27889813733511915  -0.13610816233202563 -0.9505509571157279 0.27915487828976338
+0.86075903908278317 -1.6123045076538935 0.37596077789543386  -0.33912378489964695 -0.86229745711633898 0.37608264246842565
+0.93088283263773475 -1.6736940845413728 0.27269981374065155  -0.26880216379452304 -0.92375019852295015 0.27282039415738846
+0.65998203120107946 -1.5898638505656821 0.054857140713616928  -0.54106674669697674 -0.83909253130010408 0.056307189018219461
+0.76234552415797396 -1.6462672300889245 0.071858277492355002  -0.4366583353262804 -0.89666746009116904 0.072917516439697044
+0.93973505164257753 -1.7147192955096329 -0.039734588558411603  -0.2599005139796024 -0.96481986879326065 -0.039677999129164185
+0.87728941095227664 -1.693302656293743 0.077704403643809719  -0.32203490693742809 -0.94351526412634312 0.07792602308856135
+1.1305476680193722 -1.6668554803037776 -0.39313153246640242  -0.069774081725105006 -0.91693066884564212 -0.39289912961178936
+1.0637590465961859 -1.7006072962094394 -0.27889813733511915  -0.13610816233202414 -0.95055095711572779 -0.27915487828976443
+1.0680714308860475 -1.7404306120773461 -0.040522281668716881  -0.13176921185868193 -0.99044963097837846 -0.040575895565416728
+1.0006230302710439 -1.7167958970608925 -0.15985780358782292  -0.19913925651268571 -0.96680424297825773 -0.16010344242024524
+1.166096422513349 -1.2351608280853033 -0.87376742805233332  -0.034313951497557192 -0.48348770334523589 -0.87467833713118359
+1.0837308646443482 -1.3039236111976777 -0.82440895259656966  -0.11774782579538288 -0.55402560894563435 -0.82413049582749887
+1.0641637744730592 -1.4699153070653641 -0.68063975088704365  -0.13609530337963588 -0.7200809942624562 -0.68041269101920587
+1.0069945598044525 -1.3745726216782668 -0.75674166021493716  -0.19358827458119413 -0.62484261256047724 -0.75636980999592618
+1.2694523319806275 -1.6668554803037776 -0.39313153246640242  0.069774081725106324 -0.91693066884564201 -0.39289912961178947
+1.2 -1.6164057563461918 -0.49934063060218087  0.00015872199696760825 -0.86652958223713628 -0.49912569350341174
+0.9926876081967354 -1.5307681678543315 -0.58942568680894825  -0.20735457304096702 -0.78085960551688705 -0.5892897059265586
+1.1302598023666912 -1.5504723406749188 -0.59529852733606148  -0.069662907281836037 -0.80067536950372686 -0.59503447968929735
+1.1451428592863828 -1.2900179687989204 -0.83986385056568236  -0.056307189018218629 -0.54106674669697741 -0.83909253130010353
+1.2 -1.3757818886900326 -0.77999809473327286  -0.0002351941792788813 -0.62694312538533137 -0.77906499229253701
+1.4001281403434434 -1.4301807185069526 -0.70519707714513435  0.20029565457621062 -0.68040299513329361 -0.70493504308661703
+1.2672770740243218 -1.4522770253220765 -0.70871769768752158  0.067501320615791338 -0.70276863564903924 -0.70820887911908592
+1.7666478495993443 -1.2737239478373752 -0.63610018157997172  0.56692430597377852 -0.52342942466547515 -0.63609627313050587
+1.6512666656072588 -1.3375076190110726 -0.67170915887432026  0.45142526361231833 -0.58763152153323217 -0.67149417441485471
+1.4728788208449453 -1.4902458861856145 -0.61446983418191203  0.27300775118977799 -0.74028370995146908 -0.61436698850995364
+1.5283955572053114 -1.3906145370870959 -0.69409608332024075  0.32871571883365241 -0.64057192708348276 -0.69398384882087027
+2.0398638505656823 -0.69514285928638297 -0.54001796879892028  0.83987858050695918 0.056792994144885568 -0.53979489236345535
+3  834 294 812
+3  836 296 813
+3  838 298 814
+3  840 300 815
+3  832 292 816
+3  844 304 817
+3  846 306 818
+3  848 308 819
+3  850 310 820
+3  842 302 821
+3  854 314 822
+3  856 316 823
+3  858 318 824
+3  860 320 825
+3  852 312 826
+3  835 295 827
+3  845 305 828
+3  1127 922 120
+3  841 301 830
+3  923 1358 924
+3  816 276 832
+3  853 313 833
+3  812 272 834
+3  827 287 835
+3  813 273 836
+3  849 309 837
+3  1324 838 449
+3  1358 925 60
+3  815 275 840
+3  830 290 841
+3  821 281 842
+3  859 319 843
+3  817 277 844
+3  828 288 845
+3  818 278 846
+3  719 1111 1110
+3  819 1183 1181
+3  837 297 849
+3  820 280 850
+3  863 323 851
+3  826 286 852
+3  833 293 853
+3  822 282 854
+3  869 329 855
+3  823 283 856
+3  864 324 857
+3  824 284 858
+3  843 303 859
+3  825 285 860
+3  862 322 861
+3  861 321 862
+3  851 311 863
+3  857 317 864
+3  866 326 865
+3  865 325 866
+3  868 328 867
+3  867 327 868
+3  855 315 869
+3  819 1184 1183
+3  2226 1212 1191
+3  875 335 872
+3  880 340 873
+3  877 337 874
+3  872 332 875
+3  879 339 876
+3  874 334 877
+3  881 341 878
+3  876 336 879
+3  873 333 880
+3  878 338 881
+3  885 345 882
+3  890 350 883
+3  887 347 884
+3  882 342 885
+3  889 349 886
+3  884 344 887
+3  891 351 888
+3  886 346 889
+3  883 343 890
+3  888 348 891
+3  895 355 892
+3  900 360 893
+3  897 357 894
+3  892 352 895
+3  899 359 896
+3  894 354 897
+3  901 361 898
+3  896 356 899
+3  893 353 900
+3  898 358 901
+3  917 377 902
+3  970 430 903
+3  937 397 904
+3  962 422 905
+3  508 1223 1218
+3  1219 1224 1582
+3  929 389 908
+3  982 442 909
+3  989 450 1004
+3  1947 1253 942
+3  931 391 912
+3  954 414 913
+3  953 413 914
+3  916 376 915
+3  915 375 916
+3  902 362 917
+3  975 435 918
+3  920 380 919
+3  919 379 920
+3  946 406 921
+3  120 1334 1827
+3  1324 1345 838
+3  838 1345 944
+3  1049 2093 1390
+3  1347 1391 1819
+3  2104 1469 1244
+3  367 1470 2104
+3  908 368 929
+3  987 447 930
+3  912 372 931
+3  951 411 932
+3  966 426 933
+3  965 425 934
+3  936 396 935
+3  935 395 936
+3  904 364 937
+3  979 439 938
+3  940 400 939
+3  939 399 940
+3  1367 1471 1423
+3  505 1548 988
+3  1188 1550 1783
+3  505 1579 1548
+3  1110 1585 719
+3  921 381 946
+3  948 408 947
+3  947 407 948
+3  974 434 949
+3  973 433 950
+3  932 392 951
+3  971 431 952
+3  914 374 953
+3  913 373 954
+3  956 416 955
+3  955 415 956
+3  986 446 957
+3  985 445 958
+3  960 420 959
+3  959 419 960
+3  976 436 961
+3  905 365 962
+3  964 424 963
+3  963 423 964
+3  934 394 965
+3  933 393 966
+3  968 428 967
+3  967 427 968
+3  972 432 969
+3  903 363 970
+3  952 412 971
+3  969 429 972
+3  950 410 973
+3  949 409 974
+3  918 378 975
+3  961 421 976
+3  980 440 977
+3  1422 367 978
+3  938 398 979
+3  977 437 980
+3  984 444 981
+3  909 369 982
+3  1721 450 989
+3  981 441 984
+3  958 418 985
+3  957 417 986
+3  930 390 987
+3  1574 1425 603
+3  1249 1333 1613
+3  1858 1614 794
+3  2224 1615 1783
+3  1203 663 992
+3  1118 578 993
+3  1211 671 994
+3  1122 582 995
+3  1782 1346 808
+3  1578 1618 1344
+3  1227 687 998
+3  1130 590 999
+3  1195 655 1000
+3  1114 574 1001
+3  1243 703 1002
+3  1138 598 1003
+3  1244 1549 704
+3  1142 602 1005
+3  1259 719 1006
+3  1146 606 1007
+3  1267 727 1008
+3  1150 610 1009
+3  1235 695 1010
+3  1134 594 1011
+3  1283 743 1012
+3  1158 618 1013
+3  1291 751 1014
+3  1162 622 1015
+3  1299 759 1016
+3  1166 626 1017
+3  1307 767 1018
+3  1170 630 1019
+3  1275 735 1020
+3  1154 614 1021
+3  1207 667 1022
+3  1202 662 1023
+3  1247 707 1024
+3  1242 702 1025
+3  602 1190 1189
+3  1333 1349 1709
+3  1231 691 1028
+3  1226 686 1029
+3  1213 98 1711
+3  1109 367 1422
+3  1131 591 1032
+3  1230 690 1033
+3  1279 739 1034
+3  1274 734 1035
+3  1115 575 1036
+3  1198 658 1037
+3  1175 635 1038
+3  1318 778 1039
+3  1119 579 1040
+3  1206 666 1041
+3  1263 723 1042
+3  1258 718 1043
+3  1123 583 1044
+3  1214 674 1045
+3  1710 1142 1736
+3  2230 1737 1365
+3  1127 587 1048
+3  1827 6 10
+3  1187 647 1050
+3  1342 802 1051
+3  1151 611 1052
+3  1270 730 1053
+3  1303 763 1054
+3  1298 758 1055
+3  1135 595 1056
+3  1238 698 1057
+3  1179 639 1058
+3  1326 786 1059
+3  1139 599 1060
+3  1246 706 1061
+3  1827 10 924
+3  1827 1334 6
+3  1610 603 451
+3  922 11 120
+3  1215 675 1066
+3  1210 670 1067
+3  1147 607 1068
+3  1262 722 1069
+3  1319 779 1070
+3  1314 774 1071
+3  1171 631 1072
+3  1310 770 1073
+3  1199 659 1074
+3  1194 654 1075
+3  1155 615 1076
+3  1278 738 1077
+3  1343 803 1078
+3  1338 798 1079
+3  1159 619 1080
+3  1286 746 1081
+3  1323 783 1082
+3  1178 638 1083
+3  1163 623 1084
+3  1294 754 1085
+3  1239 699 1086
+3  1234 694 1087
+3  1167 627 1088
+3  1302 762 1089
+3  1315 775 1090
+3  1174 634 1091
+3  1311 771 1092
+3  1306 766 1093
+3  1271 731 1094
+3  1266 726 1095
+3  1295 755 1096
+3  1290 750 1097
+3  1331 791 1098
+3  1182 642 1099
+3  1327 787 1100
+3  1322 782 1101
+3  1339 799 1102
+3  1186 646 1103
+3  1335 795 1104
+3  1330 790 1105
+3  1287 747 1106
+3  1282 742 1107
+3  11 15 120
+3  15 943 120
+3  923 19 1358
+3  19 31 1358
+3  1117 577 1112
+3  1128 588 1113
+3  1001 461 1114
+3  1036 496 1115
+3  1121 581 1116
+3  1112 572 1117
+3  993 453 1118
+3  1040 500 1119
+3  1125 585 1120
+3  1116 576 1121
+3  995 455 1122
+3  1044 504 1123
+3  1129 589 1124
+3  1120 580 1125
+3  941 457 206
+3  1048 508 1127
+3  1113 573 1128
+3  1124 584 1129
+3  999 459 1130
+3  1032 492 1131
+3  1137 597 1132
+3  1148 608 1133
+3  1011 471 1134
+3  1056 516 1135
+3  1141 601 1136
+3  1132 592 1137
+3  1003 463 1138
+3  1060 520 1139
+3  1145 605 1140
+3  1136 596 1141
+3  1005 465 1142
+3  31 925 1358
+3  1149 609 1144
+3  1140 600 1145
+3  1007 467 1146
+3  1068 528 1147
+3  1133 593 1148
+3  1144 604 1149
+3  1009 469 1150
+3  1052 512 1151
+3  1157 617 1152
+3  1168 628 1153
+3  1021 481 1154
+3  1076 536 1155
+3  1161 621 1156
+3  1152 612 1157
+3  1013 473 1158
+3  1080 540 1159
+3  1165 625 1160
+3  1156 616 1161
+3  1015 475 1162
+3  1084 544 1163
+3  1169 629 1164
+3  1160 620 1165
+3  1017 477 1166
+3  1088 548 1167
+3  1153 613 1168
+3  1164 624 1169
+3  1019 479 1170
+3  1072 532 1171
+3  1201 661 1172
+3  1308 768 1173
+3  1091 551 1174
+3  1038 498 1175
+3  1241 701 1176
+3  1292 752 1177
+3  1083 543 1178
+3  1058 518 1179
+3  49 60 926
+3  60 1220 1582
+3  1099 559 1182
+3  51 1045 203
+3  1366 1225 685
+3  1332 792 1185
+3  1103 563 1186
+3  1050 510 1187
+3  991 1045 51
+3  58 203 2159
+3  2159 1027 58
+3  794 59 1031
+3  1229 689 1192
+3  1276 736 1193
+3  1075 535 1194
+3  1000 460 1195
+3  1273 733 1196
+3  1200 660 1197
+3  1037 497 1198
+3  1074 534 1199
+3  1197 657 1200
+3  1172 632 1201
+3  1023 483 1202
+3  992 452 1203
+3  1317 777 1204
+3  1208 668 1205
+3  1041 501 1206
+3  1022 482 1207
+3  1205 665 1208
+3  1260 720 1209
+3  1067 527 1210
+3  994 454 1211
+3  794 1614 59
+3  67 1859 1357
+3  1045 505 1214
+3  1066 526 1215
+3  1251 1859 67
+3  1356 68 1814
+3  68 1387 1814
+3  1047 90 570
+3  90 1390 570
+3  928 457 1221
+3  1406 91 225
+3  91 1062 1619
+3  91 1619 225
+3  1065 94 978
+3  1029 489 1226
+3  998 458 1227
+3  1341 801 1228
+3  1192 652 1229
+3  1033 493 1230
+3  1028 488 1231
+3  1269 729 1232
+3  1300 760 1233
+3  1087 547 1234
+3  1010 470 1235
+3  1297 757 1236
+3  1240 700 1237
+3  1057 517 1238
+3  1086 546 1239
+3  1237 697 1240
+3  1176 636 1241
+3  1025 485 1242
+3  1002 462 1243
+3  1325 785 1244
+3  1248 708 1245
+3  1061 521 1246
+3  1024 484 1247
+3  1245 705 1248
+3  94 1422 978
+3  109 2097 1255
+3  1254 2097 109
+3  111 1723 119
+3  119 1723 838
+3  838 944 119
+3  704 127 1540
+3  704 1549 127
+3  2224 128 151
+3  1043 503 1258
+3  1006 466 1259
+3  1209 669 1260
+3  1264 724 1261
+3  1069 529 1262
+3  1042 502 1263
+3  1261 721 1264
+3  1316 776 1265
+3  1095 555 1266
+3  1008 468 1267
+3  1313 773 1268
+3  1232 692 1269
+3  1053 513 1270
+3  1094 554 1271
+3  1309 769 1272
+3  1196 656 1273
+3  1035 495 1274
+3  1020 480 1275
+3  1193 653 1276
+3  1280 740 1277
+3  1077 537 1278
+3  1034 494 1279
+3  1277 737 1280
+3  1340 800 1281
+3  1107 567 1282
+3  1012 472 1283
+3  1337 797 1284
+3  1288 748 1285
+3  1081 541 1286
+3  1106 566 1287
+3  1285 745 1288
+3  1320 780 1289
+3  1097 557 1290
+3  1014 474 1291
+3  1177 637 1292
+3  1296 756 1293
+3  1085 545 1294
+3  1096 556 1295
+3  1293 753 1296
+3  1236 696 1297
+3  1055 515 1298
+3  1016 476 1299
+3  1233 693 1300
+3  1304 764 1301
+3  1089 549 1302
+3  1054 514 1303
+3  1301 761 1304
+3  1312 772 1305
+3  1093 553 1306
+3  1018 478 1307
+3  1173 633 1308
+3  1272 732 1309
+3  1073 533 1310
+3  1092 552 1311
+3  1305 765 1312
+3  1268 728 1313
+3  1071 531 1314
+3  1090 550 1315
+3  1265 725 1316
+3  1204 664 1317
+3  1039 499 1318
+3  1070 530 1319
+3  1289 749 1320
+3  1328 788 1321
+3  1101 561 1322
+3  1082 542 1323
+3  2224 150 128
+3  1244 704 1325
+3  1059 519 1326
+3  1100 560 1327
+3  1321 781 1328
+3  1336 796 1329
+3  1105 565 1330
+3  1098 558 1331
+3  1185 645 1332
+3  1348 808 1333
+3  2224 151 1541
+3  1104 564 1335
+3  1329 789 1336
+3  1284 744 1337
+3  1079 539 1338
+3  1102 562 1339
+3  1281 741 1340
+3  1228 688 1341
+3  1051 511 1342
+3  1078 538 1343
+3  2224 1573 150
+3  190 186 2226
+3  186 1705 2226
+3  1191 190 2226
+3  1333 793 1348
+3  704 1573 2224
+3  1981 191 1217
+3  1981 1222 191
+3  1803 497 1352
+3  2134 663 1353
+3  1811 501 1354
+3  2150 671 1355
+3  1347 1819 715
+3  202 508 1981
+3  924 1358 1827
+3  2182 687 1359
+3  1795 493 1360
+3  2118 655 1361
+3  1843 517 1362
+3  2214 703 1363
+3  1851 521 1364
+3  1737 2230 1707
+3  204 1981 1217
+3  1981 204 202
+3  1867 529 1368
+3  2262 727 1369
+3  1835 513 1370
+3  2198 695 1371
+3  1883 537 1372
+3  2294 743 1373
+3  1891 541 1374
+3  2310 751 1375
+3  1899 545 1376
+3  2326 759 1377
+3  1907 549 1378
+3  2232 767 1379
+3  1875 533 1380
+3  2278 735 1381
+3  1807 499 1382
+3  2142 667 1383
+3  1847 519 1384
+3  2222 707 1385
+3  205 685 1582
+3  1582 1224 205
+3  1831 511 1388
+3  2190 691 1389
+3  206 457 928
+3  457 941 997
+3  1731 461 1392
+3  1990 591 1393
+3  1879 535 1394
+3  2286 739 1395
+3  1715 453 1396
+3  1958 575 1397
+3  1775 483 1398
+3  2078 635 1399
+3  1719 455 1400
+3  1966 579 1401
+3  1863 527 1402
+3  2254 723 1403
+3  1723 457 1404
+3  1974 583 1405
+3  263 207 1351
+3  263 1611 207
+3  1727 459 1408
+3  1982 587 1409
+3  1787 489 1410
+3  2102 647 1411
+3  1751 471 1412
+3  2030 611 1413
+3  1903 547 1414
+3  2240 763 1415
+3  1735 463 1416
+3  1998 595 1417
+3  1779 485 1418
+3  2086 639 1419
+3  1739 465 1420
+3  2006 599 1421
+3  1723 208 221
+3  1723 221 1221
+3  1743 467 1424
+3  2014 603 1425
+3  1815 503 1426
+3  2158 675 1427
+3  1747 469 1428
+3  2022 607 1429
+3  1919 555 1430
+3  2155 779 1431
+3  1771 481 1432
+3  2070 631 1433
+3  1799 495 1434
+3  2126 659 1435
+3  1755 473 1436
+3  2038 615 1437
+3  1943 567 1438
+3  1789 803 1439
+3  1759 475 1440
+3  2046 619 1441
+3  1923 557 1442
+3  2107 783 1443
+3  1763 477 1444
+3  2054 623 1445
+3  1839 515 1446
+3  2206 699 1447
+3  1767 479 1448
+3  2062 627 1449
+3  1915 553 1450
+3  2167 775 1451
+3  1911 551 1452
+3  2175 771 1453
+3  1871 531 1454
+3  2270 731 1455
+3  1895 543 1456
+3  2318 755 1457
+3  1931 561 1458
+3  1950 791 1459
+3  1927 559 1460
+3  2094 787 1461
+3  1939 565 1462
+3  1824 799 1463
+3  1935 563 1464
+3  1857 795 1465
+3  1887 539 1466
+3  2302 747 1467
+3  1723 1256 208
+3  983 222 1782
+3  222 223 1782
+3  223 224 1782
+3  1967 579 1472
+3  1962 577 1473
+3  1987 589 1474
+3  1730 461 1475
+3  1975 583 1476
+3  1970 581 1477
+3  1955 573 1478
+3  1714 453 1479
+3  1983 587 1480
+3  1978 585 1481
+3  1963 577 1482
+3  1718 455 1483
+3  1991 591 1484
+3  1986 589 1485
+3  1971 581 1486
+3  1722 457 1487
+3  1959 575 1488
+3  1954 573 1489
+3  1979 585 1490
+3  1726 459 1491
+3  2007 599 1492
+3  2002 597 1493
+3  2027 609 1494
+3  1750 471 1495
+3  2015 603 1496
+3  2010 601 1497
+3  1995 593 1498
+3  1734 463 1499
+3  2023 607 1500
+3  2018 605 1501
+3  2003 597 1502
+3  1738 465 1503
+3  2031 611 1504
+3  2026 609 1505
+3  2011 601 1506
+3  1742 467 1507
+3  1999 595 1508
+3  1994 593 1509
+3  2019 605 1510
+3  1746 469 1511
+3  2047 619 1512
+3  2042 617 1513
+3  2067 629 1514
+3  1770 481 1515
+3  2055 623 1516
+3  2050 621 1517
+3  2035 613 1518
+3  1754 473 1519
+3  2063 627 1520
+3  2058 625 1521
+3  2043 617 1522
+3  1758 475 1523
+3  2071 631 1524
+3  2066 629 1525
+3  2051 621 1526
+3  1762 477 1527
+3  2039 615 1528
+3  2034 613 1529
+3  2059 625 1530
+3  1766 479 1531
+3  2135 663 1532
+3  2130 661 1533
+3  2179 769 1534
+3  1910 551 1535
+3  2215 703 1536
+3  2210 701 1537
+3  2315 753 1538
+3  1894 543 1539
+3  224 1346 1782
+3  1947 945 1782
+3  2104 785 1542
+3  1926 559 1543
+3  2183 687 1544
+3  2178 685 1545
+3  1944 793 1546
+3  1934 563 1547
+3  942 258 1947
+3  258 945 1947
+3  1254 268 2097
+3  268 269 2097
+3  2191 691 1552
+3  2186 689 1553
+3  2283 737 1554
+3  1878 535 1555
+3  2279 735 1556
+3  2274 733 1557
+3  2131 661 1558
+3  1802 497 1559
+3  2127 659 1560
+3  2122 657 1561
+3  2075 633 1562
+3  1774 483 1563
+3  2154 779 1564
+3  2163 777 1565
+3  2147 669 1566
+3  1810 501 1567
+3  2143 667 1568
+3  2138 665 1569
+3  2251 721 1570
+3  1862 527 1571
+3  269 1253 2097
+3  1253 1947 2097
+3  2159 270 1027
+3  2159 1551 270
+3  2159 675 1576
+3  271 263 1581
+3  990 1581 263
+3  1062 274 1619
+3  274 1684 1619
+3  225 279 1406
+3  1250 685 205
+3  225 1584 279
+3  978 289 1065
+3  978 1706 289
+3  2099 645 1586
+3  1786 489 1587
+3  1788 803 1588
+3  1820 801 1589
+3  2115 653 1590
+3  1794 493 1591
+3  2271 731 1592
+3  2266 729 1593
+3  2243 761 1594
+3  1902 547 1595
+3  2327 759 1596
+3  2322 757 1597
+3  2211 701 1598
+3  1842 517 1599
+3  2207 699 1600
+3  2202 697 1601
+3  2083 637 1602
+3  1778 485 1603
+3  2091 787 1604
+3  2105 785 1605
+3  2227 709 1606
+3  1850 521 1607
+3  2223 707 1608
+3  2218 705 1609
+3  996 291 990
+3  291 1581 990
+3  299 1006 1108
+3  1006 299 225
+3  307 1814 1387
+3  1814 307 57
+3  187 330 1063
+3  187 1407 330
+3  331 848 366
+3  1814 503 1619
+3  2151 671 1620
+3  2146 669 1621
+3  2259 725 1622
+3  1866 529 1623
+3  2255 723 1624
+3  2250 721 1625
+3  2162 777 1626
+3  1918 555 1627
+3  2166 775 1628
+3  2171 773 1629
+3  2195 693 1630
+3  1834 513 1631
+3  2174 771 1632
+3  2216 769 1633
+3  2123 657 1634
+3  1798 495 1635
+3  2119 655 1636
+3  2114 653 1637
+3  2291 741 1638
+3  1882 537 1639
+3  2287 739 1640
+3  2282 737 1641
+3  1818 801 1642
+3  1942 567 1643
+3  1823 799 1644
+3  1853 797 1645
+3  2307 749 1646
+3  1890 541 1647
+3  2303 747 1648
+3  2298 745 1649
+3  2110 781 1650
+3  1922 557 1651
+3  2087 639 1652
+3  2082 637 1653
+3  2323 757 1654
+3  1898 545 1655
+3  2319 755 1656
+3  2314 753 1657
+3  2203 697 1658
+3  1838 515 1659
+3  2199 695 1660
+3  2194 693 1661
+3  2235 765 1662
+3  1906 549 1663
+3  2239 763 1664
+3  2246 761 1665
+3  2170 773 1666
+3  1914 553 1667
+3  2079 635 1668
+3  2074 633 1669
+3  2275 733 1670
+3  1874 533 1671
+3  2231 767 1672
+3  2236 765 1673
+3  2267 729 1674
+3  1870 531 1675
+3  2263 727 1676
+3  2258 725 1677
+3  2139 665 1678
+3  1806 499 1679
+3  2311 751 1680
+3  2306 749 1681
+3  2012 789 1682
+3  1930 561 1683
+3  366 848 1180
+3  848 331 1367
+3  2219 705 1686
+3  1846 519 1687
+3  2106 783 1688
+3  2111 781 1689
+3  1852 797 1690
+3  1938 565 1691
+3  2103 647 1692
+3  2098 645 1693
+3  450 1721 990
+3  371 370 1367
+3  1949 791 1696
+3  2088 789 1697
+3  2299 745 1698
+3  1886 539 1699
+3  2295 743 1700
+3  2290 741 1701
+3  2187 689 1702
+3  1830 511 1703
+3  370 719 1367
+3  1423 371 1367
+3  370 1111 719
+3  508 382 927
+3  1856 795 1708
+3  1945 793 1709
+3  508 1218 382
+3  383 1576 57
+3  2133 662 1712
+3  1964 578 1713
+3  1479 335 1714
+3  1396 294 1715
+3  2149 670 1716
+3  1972 582 1717
+3  1483 337 1718
+3  1400 296 1719
+3  57 1046 383
+3  990 384 996
+3  1487 339 1722
+3  1404 298 1723
+3  2181 686 1724
+3  1988 590 1725
+3  1491 341 1726
+3  1408 300 1727
+3  2117 654 1728
+3  1956 574 1729
+3  1475 333 1730
+3  1392 292 1731
+3  2213 702 1732
+3  2004 598 1733
+3  1499 345 1734
+3  1416 304 1735
+3  990 1721 384
+3  1244 385 386
+3  1503 347 1738
+3  1420 306 1739
+3  2245 718 1740
+3  2020 606 1741
+3  1507 349 1742
+3  1424 308 1743
+3  2261 726 1744
+3  2028 610 1745
+3  1511 351 1746
+3  1428 310 1747
+3  2197 694 1748
+3  1996 594 1749
+3  1495 343 1750
+3  1412 302 1751
+3  2293 742 1752
+3  2044 618 1753
+3  1519 355 1754
+3  1436 314 1755
+3  2309 750 1756
+3  2052 622 1757
+3  1523 357 1758
+3  1440 316 1759
+3  2325 758 1760
+3  2060 626 1761
+3  1527 359 1762
+3  1444 318 1763
+3  2233 766 1764
+3  2068 630 1765
+3  1531 361 1766
+3  1448 320 1767
+3  2277 734 1768
+3  2036 614 1769
+3  1515 353 1770
+3  1432 312 1771
+3  2141 666 1772
+3  2132 662 1773
+3  1563 377 1774
+3  1398 295 1775
+3  2221 706 1776
+3  2212 702 1777
+3  1603 397 1778
+3  1418 305 1779
+3  1244 386 1143
+3  1244 1469 385
+3  388 387 401
+3  387 1045 401
+3  2189 690 1784
+3  2180 686 1785
+3  1587 389 1786
+3  1410 301 1787
+3  388 1045 387
+3  401 1045 991
+3  1045 388 505
+3  1064 402 403
+3  1989 590 1792
+3  2188 690 1793
+3  1591 391 1794
+3  1360 276 1795
+3  2285 738 1796
+3  2276 734 1797
+3  1635 413 1798
+3  1434 313 1799
+3  1957 574 1800
+3  2124 658 1801
+3  1559 375 1802
+3  1352 272 1803
+3  2077 634 1804
+3  2161 778 1805
+3  1679 435 1806
+3  1382 287 1807
+3  1965 578 1808
+3  2140 666 1809
+3  1567 379 1810
+3  1354 273 1811
+3  2253 722 1812
+3  2244 718 1813
+3  1064 403 1583
+3  1426 309 1815
+3  1973 582 1816
+3  2156 674 1817
+3  1064 1720 402
+3  438 404 405
+3  404 1006 405
+3  405 1006 719
+3  438 1006 404
+3  1108 1006 438
+3  443 187 1063
+3  187 1706 978
+3  448 814 1257
+3  1358 275 1827
+3  2101 646 1828
+3  1791 802 1829
+3  1703 447 1830
+3  1388 290 1831
+3  2029 610 1832
+3  2268 730 1833
+3  1631 411 1834
+3  1370 281 1835
+3  2241 762 1836
+3  2324 758 1837
+3  1659 425 1838
+3  1446 319 1839
+3  1997 594 1840
+3  2204 698 1841
+3  1599 395 1842
+3  1362 277 1843
+3  2085 638 1844
+3  2096 786 1845
+3  1687 439 1846
+3  1384 288 1847
+3  2005 598 1848
+3  2220 706 1849
+3  1607 399 1850
+3  1364 278 1851
+3  449 814 448
+3  814 449 838
+3  451 603 1583
+3  1064 1583 603
+3  1616 2013 847
+3  1783 456 1188
+3  1783 1615 456
+3  808 464 1613
+3  2157 674 1860
+3  2148 670 1861
+3  1571 381 1862
+3  1402 297 1863
+3  2021 606 1864
+3  2252 722 1865
+3  1623 407 1866
+3  1368 280 1867
+3  2160 778 1868
+3  2169 774 1869
+3  1675 433 1870
+3  1454 323 1871
+3  2069 630 1872
+3  2177 770 1873
+3  1671 431 1874
+3  1380 286 1875
+3  2125 658 1876
+3  2116 654 1877
+3  1555 373 1878
+3  1394 293 1879
+3  2037 614 1880
+3  2284 738 1881
+3  1639 415 1882
+3  1372 282 1883
+3  1790 802 1884
+3  1826 798 1885
+3  1699 445 1886
+3  1466 329 1887
+3  2045 618 1888
+3  2300 746 1889
+3  1647 419 1890
+3  1374 283 1891
+3  2108 782 1892
+3  2084 638 1893
+3  1539 365 1894
+3  1456 324 1895
+3  2053 622 1896
+3  2316 754 1897
+3  1655 423 1898
+3  1376 284 1899
+3  2205 698 1900
+3  2196 694 1901
+3  1595 393 1902
+3  1414 303 1903
+3  2061 626 1904
+3  2242 762 1905
+3  1663 427 1906
+3  1378 285 1907
+3  2168 774 1908
+3  2076 634 1909
+3  1535 363 1910
+3  1452 322 1911
+3  2176 770 1912
+3  2234 766 1913
+3  1667 429 1914
+3  1450 321 1915
+3  2269 730 1916
+3  2260 726 1917
+3  1627 409 1918
+3  1430 311 1919
+3  2317 754 1920
+3  2308 750 1921
+3  1651 421 1922
+3  1442 317 1923
+3  1951 790 1924
+3  2092 642 1925
+3  1543 367 1926
+3  1460 326 1927
+3  2095 786 1928
+3  2109 782 1929
+3  1683 437 1930
+3  1458 325 1931
+3  1825 798 1932
+3  2100 646 1933
+3  1547 369 1934
+3  1464 328 1935
+3  1858 794 1936
+3  1980 790 1937
+3  1691 441 1938
+3  1462 327 1939
+3  2301 746 1940
+3  2292 742 1941
+3  1643 417 1942
+3  1438 315 1943
+3  808 1617 464
+3  66 1781 2230
+3  486 2225 1550
+3  487 2225 486
+3  2093 642 1948
+3  1357 1859 794
+3  1783 1550 2225
+3  2013 490 1612
+3  1961 576 1952
+3  1984 588 1953
+3  1489 340 1954
+3  1478 335 1955
+3  1729 460 1956
+3  1800 496 1957
+3  1397 294 1958
+3  1488 340 1959
+3  1969 580 1960
+3  1952 572 1961
+3  1473 332 1962
+3  1482 337 1963
+3  1713 452 1964
+3  1808 500 1965
+3  1401 296 1966
+3  1472 332 1967
+3  1977 584 1968
+3  1960 576 1969
+3  1477 334 1970
+3  1486 339 1971
+3  1717 454 1972
+3  1816 504 1973
+3  1405 298 1974
+3  1476 334 1975
+3  1985 588 1976
+3  1968 580 1977
+3  1481 336 1978
+3  1490 341 1979
+3  2013 1616 490
+3  1223 508 202
+3  1409 300 1982
+3  1480 336 1983
+3  1953 572 1984
+3  1976 584 1985
+3  1485 338 1986
+3  1474 333 1987
+3  1725 458 1988
+3  1792 492 1989
+3  1393 292 1990
+3  1484 338 1991
+3  2001 596 1992
+3  2024 608 1993
+3  1509 350 1994
+3  1498 345 1995
+3  1749 470 1996
+3  1840 516 1997
+3  1417 304 1998
+3  1508 350 1999
+3  2009 600 2000
+3  1992 592 2001
+3  1493 342 2002
+3  1502 347 2003
+3  1733 462 2004
+3  1848 520 2005
+3  1421 306 2006
+3  1492 342 2007
+3  2017 604 2008
+3  2000 596 2009
+3  1497 344 2010
+3  1506 349 2011
+3  506 491 1425
+3  491 1184 819
+3  1425 308 2014
+3  1496 344 2015
+3  2025 608 2016
+3  2008 600 2017
+3  1501 346 2018
+3  1510 351 2019
+3  1741 466 2020
+3  1864 528 2021
+3  1429 310 2022
+3  1500 346 2023
+3  1993 592 2024
+3  2016 604 2025
+3  1505 348 2026
+3  1494 343 2027
+3  1745 468 2028
+3  1832 512 2029
+3  1413 302 2030
+3  1504 348 2031
+3  2041 616 2032
+3  2064 628 2033
+3  1529 360 2034
+3  1518 355 2035
+3  1769 480 2036
+3  1880 536 2037
+3  1437 314 2038
+3  1528 360 2039
+3  2049 620 2040
+3  2032 612 2041
+3  1513 352 2042
+3  1522 357 2043
+3  1753 472 2044
+3  1888 540 2045
+3  1441 316 2046
+3  1512 352 2047
+3  2057 624 2048
+3  2040 616 2049
+3  1517 354 2050
+3  1526 359 2051
+3  1757 474 2052
+3  1896 544 2053
+3  1445 318 2054
+3  1516 354 2055
+3  2065 628 2056
+3  2048 620 2057
+3  1521 356 2058
+3  1530 361 2059
+3  1761 476 2060
+3  1904 548 2061
+3  1449 320 2062
+3  1520 356 2063
+3  2033 612 2064
+3  2056 624 2065
+3  1525 358 2066
+3  1514 353 2067
+3  1765 478 2068
+3  1872 532 2069
+3  1433 312 2070
+3  1524 358 2071
+3  2129 660 2072
+3  2229 768 2073
+3  1669 430 2074
+3  1562 377 2075
+3  1909 550 2076
+3  1804 498 2077
+3  1399 295 2078
+3  1668 430 2079
+3  2209 700 2080
+3  2312 752 2081
+3  1653 422 2082
+3  1602 397 2083
+3  1893 542 2084
+3  1844 518 2085
+3  1419 305 2086
+3  1652 422 2087
+3  1780 506 1425
+3  491 819 1425
+3  2104 507 509
+3  507 522 509
+3  1925 558 2092
+3  1948 570 2093
+3  2104 509 1126
+3  2104 522 507
+3  2104 1470 522
+3  1947 792 2097
+3  1693 442 2098
+3  1586 389 2099
+3  1933 562 2100
+3  1828 510 2101
+3  1411 301 2102
+3  1692 442 2103
+3  523 2093 1049
+3  2093 1407 187
+3  941 524 997
+3  524 525 997
+3  525 1216 997
+3  568 1064 2013
+3  2013 1612 568
+3  1576 569 1030
+3  2185 688 2112
+3  2280 736 2113
+3  1637 414 2114
+3  1590 391 2115
+3  1877 534 2116
+3  1728 460 2117
+3  1361 276 2118
+3  1636 414 2119
+3  2273 732 2120
+3  2128 660 2121
+3  1561 376 2122
+3  1634 413 2123
+3  1801 496 2124
+3  1876 534 2125
+3  1435 313 2126
+3  1560 376 2127
+3  2121 656 2128
+3  2072 632 2129
+3  1533 362 2130
+3  1558 375 2131
+3  1773 482 2132
+3  1712 452 2133
+3  1353 272 2134
+3  1532 362 2135
+3  2164 776 2136
+3  2144 668 2137
+3  1569 380 2138
+3  1678 435 2139
+3  1809 500 2140
+3  1772 482 2141
+3  1383 287 2142
+3  1568 380 2143
+3  2137 664 2144
+3  2248 720 2145
+3  1621 406 2146
+3  1566 379 2147
+3  1861 526 2148
+3  1716 454 2149
+3  1355 273 2150
+3  1620 406 2151
+3  1576 1704 569
+3  571 1858 1351
+3  1026 1858 571
+3  1684 586 1619
+3  1817 504 2156
+3  1860 526 2157
+3  1427 309 2158
+3  1551 2159 677
+3  586 640 1619
+3  640 1356 1814
+3  640 1814 1619
+3  1709 641 643
+3  1709 643 644
+3  1709 644 1004
+3  644 643 641
+3  1709 1685 641
+3  648 814 1819
+3  649 814 648
+3  1257 814 649
+3  1582 650 651
+3  1582 651 1219
+3  1582 1220 650
+3  602 672 1190
+3  602 1694 672
+3  1252 1255 1225
+3  1365 673 1711
+3  1545 368 2178
+3  1365 676 673
+3  1785 488 2180
+3  1724 458 2181
+3  1359 275 2182
+3  1544 368 2183
+3  1821 800 2184
+3  2112 652 2185
+3  1553 372 2186
+3  1702 447 2187
+3  1793 492 2188
+3  1784 488 2189
+3  1389 290 2190
+3  1552 372 2191
+3  2265 728 2192
+3  2328 760 2193
+3  1661 426 2194
+3  1630 411 2195
+3  1901 546 2196
+3  1748 470 2197
+3  1371 281 2198
+3  1660 426 2199
+3  2321 756 2200
+3  2208 700 2201
+3  1601 396 2202
+3  1658 425 2203
+3  1841 516 2204
+3  1900 546 2205
+3  1447 319 2206
+3  1600 396 2207
+3  2201 696 2208
+3  2080 636 2209
+3  1537 364 2210
+3  1598 395 2211
+3  1777 484 2212
+3  1732 462 2213
+3  1363 277 2214
+3  1536 364 2215
+3  1365 1737 676
+3  2224 708 2217
+3  1609 400 2218
+3  1686 439 2219
+3  1849 520 2220
+3  1776 484 2221
+3  1385 288 2222
+3  1608 400 2223
+3  2217 704 2224
+3  1580 2225 487
+3  677 2159 678
+3  1606 399 2227
+3  678 2159 1576
+3  1576 1030 678
+3  1365 278 2230
+3  1250 679 685
+3  679 1366 685
+3  681 680 1425
+3  680 1780 1425
+3  1574 681 1425
+3  682 997 1216
+3  997 682 1981
+3  570 683 1047
+3  570 1386 683
+3  709 684 1575
+3  709 1577 684
+3  710 1127 711
+3  711 1127 927
+3  1813 502 2244
+3  1740 466 2245
+3  911 1127 710
+3  712 66 1705
+3  2145 668 2248
+3  2256 724 2249
+3  1625 408 2250
+3  1570 381 2251
+3  1865 528 2252
+3  1812 502 2253
+3  1403 297 2254
+3  1624 408 2255
+3  2249 720 2256
+3  2165 776 2257
+3  1677 434 2258
+3  1622 407 2259
+3  1917 554 2260
+3  1744 468 2261
+3  1369 280 2262
+3  1676 434 2263
+3  2172 772 2264
+3  2192 692 2265
+3  1593 392 2266
+3  1674 433 2267
+3  1833 512 2268
+3  1916 554 2269
+3  1455 323 2270
+3  1592 392 2271
+3  2228 768 2272
+3  2120 656 2273
+3  1557 374 2274
+3  1670 431 2275
+3  1797 494 2276
+3  1768 480 2277
+3  1381 286 2278
+3  1556 374 2279
+3  2113 652 2280
+3  2288 740 2281
+3  1641 416 2282
+3  1554 373 2283
+3  1881 536 2284
+3  1796 494 2285
+3  1395 293 2286
+3  1640 416 2287
+3  2281 736 2288
+3  1822 800 2289
+3  1701 446 2290
+3  1638 415 2291
+3  1941 566 2292
+3  1752 472 2293
+3  1373 282 2294
+3  1700 446 2295
+3  1854 796 2296
+3  2304 748 2297
+3  1649 420 2298
+3  1698 445 2299
+3  1889 540 2300
+3  1940 566 2301
+3  1467 329 2302
+3  1648 420 2303
+3  2297 744 2304
+3  2153 780 2305
+3  1681 436 2306
+3  1646 419 2307
+3  1921 556 2308
+3  1756 474 2309
+3  1375 283 2310
+3  1680 436 2311
+3  2081 636 2312
+3  2320 756 2313
+3  1657 424 2314
+3  1538 365 2315
+3  1897 544 2316
+3  1920 556 2317
+3  1457 324 2318
+3  1656 424 2319
+3  2313 752 2320
+3  2200 696 2321
+3  1597 394 2322
+3  1654 423 2323
+3  1837 514 2324
+3  1760 476 2325
+3  1377 284 2326
+3  1596 394 2327
+3  2193 692 2328
+3  2238 764 2247
+3  1665 428 2246
+3  1594 393 2243
+3  1905 548 2242
+3  1836 514 2241
+3  1415 303 2240
+3  1664 428 2239
+3  2247 760 2238
+3  2173 772 2237
+3  1673 432 2236
+3  1662 427 2235
+3  1913 552 2234
+3  1764 478 2233
+3  1379 285 2232
+3  1672 432 2231
+3  2073 632 2229
+3  2272 732 2228
+3  1633 412 2216
+3  1534 363 2179
+3  1873 532 2177
+3  1912 552 2176
+3  1453 322 2175
+3  1632 412 2174
+3  2237 764 2173
+3  2264 728 2172
+3  1629 410 2171
+3  1666 429 2170
+3  1869 530 2169
+3  1908 550 2168
+3  1451 321 2167
+3  1628 410 2166
+3  2257 724 2165
+3  2136 664 2164
+3  1565 378 2163
+3  1626 409 2162
+3  1805 498 2161
+3  1868 530 2160
+3  1431 311 2155
+3  1564 378 2154
+3  2305 748 2153
+3  2090 788 2152
+3  1689 440 2111
+3  1650 421 2110
+3  1929 560 2109
+3  1892 542 2108
+3  1443 317 2107
+3  1688 440 2106
+3  1695 66 712
+3  57 713 1046
+3  1605 398 2105
+3  1542 367 2104
+3  1845 518 2096
+3  1928 560 2095
+3  1461 326 2094
+3  1604 398 2091
+3  2152 780 2090
+3  1855 796 2089
+3  1697 444 2088
+3  1682 437 2012
+3  1937 564 1980
+3  1924 558 1951
+3  1459 325 1950
+3  1696 444 1949
+3  57 1572 713
+3  1782 808 1946
+3  1709 450 1945
+3  1546 369 1944
+3  1386 1859 784
+3  1936 564 1858
+3  1465 328 1857
+3  1708 450 1856
+3  2089 788 1855
+3  2296 744 1854
+3  1645 418 1853
+3  1690 441 1852
+3  1885 538 1826
+3  1932 562 1825
+3  1463 327 1824
+3  1644 418 1823
+3  2289 740 1822
+3  2184 688 1821
+3  1589 390 1820
+3  1642 417 1818
+3  1829 510 1791
+3  1884 538 1790
+3  1439 315 1789
+3  1588 390 1788
+3  2225 708 1783
+3  988 714 505
+3  714 1819 505
+3  715 1819 714
+3  1181 716 819
+3  716 717 848
+3  716 848 819
+3  1180 848 717
+3  1946 792 1782
+3  784 1859 1251
+3  1859 1386 570
+3  805 804 98
+3  804 1736 98
+3  1213 805 98
+3  1249 806 1333
+3  806 807 1333
+3  1397 114 812
+3  1803 272 812
+3  1401 116 813
+3  1811 273 813
+3  1405 118 814
+3  1391 648 1819
+3  1409 120 815
+3  1827 275 815
+3  1393 112 816
+3  1795 276 816
+3  1417 124 817
+3  1843 277 817
+3  1421 126 818
+3  1851 278 818
+3  807 1349 1333
+3  1580 809 2225
+3  1429 130 820
+3  1867 280 820
+3  1413 122 821
+3  1835 281 821
+3  1437 134 822
+3  1883 282 822
+3  1441 136 823
+3  1891 283 823
+3  1445 138 824
+3  1899 284 824
+3  1449 140 825
+3  1907 285 825
+3  1433 132 826
+3  1875 286 826
+3  1399 115 827
+3  1807 287 827
+3  1419 125 828
+3  1847 288 828
+3  809 1578 2225
+3  1578 1344 2225
+3  1411 121 830
+3  1831 290 830
+3  1575 810 709
+3  810 1212 2226
+3  1361 96 832
+3  1731 292 832
+3  1435 133 833
+3  1879 293 833
+3  1353 92 834
+3  1715 294 834
+3  1383 107 835
+3  1775 295 835
+3  1355 93 836
+3  1719 296 836
+3  1427 129 837
+3  1863 297 837
+3  810 2226 709
+3  1723 298 838
+3  203 811 1350
+3  203 1468 811
+3  1359 95 840
+3  1727 300 840
+3  1389 110 841
+3  1787 301 841
+3  1371 101 842
+3  1751 302 842
+3  1447 139 843
+3  1903 303 843
+3  1363 97 844
+3  1735 304 844
+3  1385 108 845
+3  1779 305 845
+3  1365 98 846
+3  1739 306 846
+3  829 1225 1366
+3  1252 1225 829
+3  1367 99 848
+3  1743 308 848
+3  1403 117 849
+3  1815 309 849
+3  1369 100 850
+3  1747 310 850
+3  1455 143 851
+3  1919 311 851
+3  1381 106 852
+3  1771 312 852
+3  1395 113 853
+3  1799 313 853
+3  1373 102 854
+3  1755 314 854
+3  1467 149 855
+3  1943 315 855
+3  1375 103 856
+3  1759 316 856
+3  1457 144 857
+3  1923 317 857
+3  1377 104 858
+3  1763 318 858
+3  1415 123 859
+3  1839 319 859
+3  1379 105 860
+3  1767 320 860
+3  1453 142 861
+3  1915 321 861
+3  1451 141 862
+3  1911 322 862
+3  1431 131 863
+3  1871 323 863
+3  1443 137 864
+3  1895 324 864
+3  1461 146 865
+3  1931 325 865
+3  1459 145 866
+3  1927 326 866
+3  1465 148 867
+3  1939 327 867
+3  1463 147 868
+3  1935 328 868
+3  1439 135 869
+3  1887 329 869
+3  1618 831 1344
+3  831 1577 1344
+3  1577 709 1344
+3  2013 839 847
+3  1479 155 872
+3  1967 332 872
+3  1489 160 873
+3  1987 333 873
+3  1483 157 874
+3  1975 334 874
+3  1473 152 875
+3  1955 335 875
+3  1487 159 876
+3  1983 336 876
+3  1477 154 877
+3  1963 337 877
+3  1491 161 878
+3  1991 338 878
+3  1481 156 879
+3  1971 339 879
+3  1475 153 880
+3  1959 340 880
+3  1485 158 881
+3  1979 341 881
+3  1499 165 882
+3  2007 342 882
+3  1509 170 883
+3  2027 343 883
+3  1503 167 884
+3  2015 344 884
+3  1493 162 885
+3  1995 345 885
+3  1507 169 886
+3  2023 346 886
+3  1497 164 887
+3  2003 347 887
+3  1511 171 888
+3  2031 348 888
+3  1501 166 889
+3  2011 349 889
+3  1495 163 890
+3  1999 350 890
+3  1505 168 891
+3  2019 351 891
+3  1519 175 892
+3  2047 352 892
+3  1529 180 893
+3  2067 353 893
+3  1523 177 894
+3  2055 354 894
+3  1513 172 895
+3  2035 355 895
+3  1527 179 896
+3  2063 356 896
+3  1517 174 897
+3  2043 357 897
+3  1531 181 898
+3  2071 358 898
+3  1521 176 899
+3  2051 359 899
+3  1515 173 900
+3  2039 360 900
+3  1525 178 901
+3  2059 361 901
+3  1563 197 902
+3  2135 362 902
+3  1669 250 903
+3  2179 363 903
+3  1603 217 904
+3  2215 364 904
+3  1653 242 905
+3  2315 365 905
+3  839 2013 602
+3  602 1189 839
+3  871 870 1142
+3  1470 367 1109
+3  1587 209 908
+3  2183 368 908
+3  1693 262 909
+3  1944 369 909
+3  870 1694 1142
+3  1710 871 1142
+3  1694 602 1142
+3  2230 906 907
+3  1591 211 912
+3  2191 372 912
+3  1637 234 913
+3  2283 373 913
+3  1635 233 914
+3  2279 374 914
+3  1561 196 915
+3  2131 375 915
+3  1559 195 916
+3  2127 376 916
+3  1533 182 917
+3  2075 377 917
+3  1679 255 918
+3  2154 378 918
+3  1569 200 919
+3  2147 379 919
+3  1567 199 920
+3  2143 380 920
+3  1621 226 921
+3  2251 381 921
+3  2230 907 1707
+3  2230 1781 906
+3  1031 910 794
+3  910 1357 794
+3  1613 1333 808
+3  1617 808 1346
+3  983 1782 945
+3  1615 2224 1541
+3  1078 803 1788
+3  930 267 1788
+3  1588 803 1789
+3  1438 89 1789
+3  1051 802 1790
+3  1078 267 1790
+3  1545 188 929
+3  2099 389 929
+3  1703 267 930
+3  1788 390 930
+3  1553 192 931
+3  2115 391 931
+3  1631 231 932
+3  2271 392 932
+3  1661 246 933
+3  2243 393 933
+3  1659 245 934
+3  2327 394 934
+3  1601 216 935
+3  2211 395 935
+3  1599 215 936
+3  2207 396 936
+3  1537 184 937
+3  2083 397 937
+3  1687 259 938
+3  2091 398 938
+3  1609 220 939
+3  2227 399 939
+3  1607 219 940
+3  2223 400 940
+3  1884 802 1791
+3  1828 30 1791
+3  1228 801 1818
+3  957 266 1818
+3  1642 801 1820
+3  1588 89 1820
+3  1281 800 1821
+3  1228 266 1821
+3  2184 800 1822
+3  2288 2 1822
+3  1571 201 946
+3  2151 406 946
+3  1625 228 947
+3  2259 407 947
+3  1623 227 948
+3  2255 408 948
+3  1677 254 949
+3  2162 409 949
+3  1675 253 950
+3  2166 410 950
+3  1593 212 951
+3  2195 411 951
+3  1671 251 952
+3  2174 412 952
+3  1557 194 953
+3  2123 413 953
+3  1555 193 954
+3  2119 414 954
+3  1641 236 955
+3  2291 415 955
+3  1639 235 956
+3  2287 416 956
+3  1701 266 957
+3  1818 417 957
+3  1699 265 958
+3  1823 418 958
+3  1649 240 959
+3  2307 419 959
+3  1647 239 960
+3  2303 420 960
+3  1681 256 961
+3  2110 421 961
+3  1539 185 962
+3  2087 422 962
+3  1657 244 963
+3  2323 423 963
+3  1655 243 964
+3  2319 424 964
+3  1597 214 965
+3  2203 425 965
+3  1595 213 966
+3  2199 426 966
+3  1665 248 967
+3  2235 427 967
+3  1663 247 968
+3  2239 428 968
+3  1673 252 969
+3  2170 429 969
+3  1535 183 970
+3  2079 430 970
+3  1633 232 971
+3  2275 431 971
+3  1667 249 972
+3  2231 432 972
+3  1629 230 973
+3  2267 433 973
+3  1627 229 974
+3  2263 434 974
+3  1565 198 975
+3  2139 435 975
+3  1651 241 976
+3  2311 436 976
+3  1689 260 977
+3  2012 437 977
+3  1543 187 978
+3  1102 799 1823
+3  1605 218 979
+3  2219 439 979
+3  1683 257 980
+3  2106 440 980
+3  1697 264 981
+3  1852 441 981
+3  1547 189 982
+3  2103 442 982
+3  958 265 1823
+3  1644 799 1824
+3  1691 261 984
+3  1949 444 984
+3  1645 238 985
+3  2299 445 985
+3  1643 237 986
+3  2295 446 986
+3  1589 210 987
+3  2187 447 987
+3  1462 88 1824
+3  1079 798 1825
+3  1102 265 1825
+3  1932 798 1826
+3  1611 263 271
+3  1856 450 990
+3  1884 30 1826
+3  1284 797 1852
+3  2135 197 992
+3  2133 452 992
+3  1965 155 993
+3  1479 453 993
+3  2151 201 994
+3  2149 454 994
+3  1973 157 995
+3  1483 455 995
+3  981 264 1852
+3  1690 797 1853
+3  1981 159 997
+3  1487 457 997
+3  2183 209 998
+3  2181 458 998
+3  1989 161 999
+3  1491 459 999
+3  2119 193 1000
+3  2117 460 1000
+3  1957 153 1001
+3  1475 461 1001
+3  2215 217 1002
+3  2213 462 1002
+3  2005 165 1003
+3  1499 463 1003
+3  1644 88 1853
+3  1329 796 1854
+3  2013 167 1005
+3  1503 465 1005
+3  1584 225 299
+3  2245 466 1006
+3  2021 169 1007
+3  1507 467 1007
+3  2263 229 1008
+3  2261 468 1008
+3  2029 171 1009
+3  1511 469 1009
+3  2199 213 1010
+3  2197 470 1010
+3  1997 163 1011
+3  1495 471 1011
+3  2295 237 1012
+3  2293 472 1012
+3  2045 175 1013
+3  1519 473 1013
+3  2311 241 1014
+3  2309 474 1014
+3  2053 177 1015
+3  1523 475 1015
+3  2327 245 1016
+3  2325 476 1016
+3  2061 179 1017
+3  1527 477 1017
+3  2231 249 1018
+3  2233 478 1018
+3  2069 181 1019
+3  1531 479 1019
+3  2279 233 1020
+3  2277 480 1020
+3  2037 173 1021
+3  1515 481 1021
+3  2143 199 1022
+3  2141 482 1022
+3  2133 197 1023
+3  1563 483 1023
+3  2223 219 1024
+3  2221 484 1024
+3  2213 217 1025
+3  1603 485 1025
+3  1284 264 1854
+3  2296 796 1855
+3  2090 7 1855
+3  1104 795 1856
+3  2191 211 1028
+3  2189 488 1028
+3  2181 209 1029
+3  1587 489 1029
+3  990 263 1856
+3  1708 795 1857
+3  1464 87 1857
+3  1614 1858 1026
+3  1991 161 1032
+3  1989 492 1032
+3  2189 211 1033
+3  1591 493 1033
+3  2287 235 1034
+3  2285 494 1034
+3  2277 233 1035
+3  1635 495 1035
+3  1959 153 1036
+3  1957 496 1036
+3  2125 195 1037
+3  1559 497 1037
+3  2079 183 1038
+3  2077 498 1038
+3  2160 255 1039
+3  1679 499 1039
+3  1967 155 1040
+3  1965 500 1040
+3  2141 199 1041
+3  1567 501 1041
+3  2255 227 1042
+3  2253 502 1042
+3  2245 225 1043
+3  1619 503 1043
+3  1975 157 1044
+3  1973 504 1044
+3  2157 203 1045
+3  1579 505 388
+3  1104 263 1858
+3  1936 794 1859
+3  1948 29 1859
+3  1348 793 1944
+3  1983 159 1048
+3  1981 508 1048
+3  909 262 1944
+3  1546 793 1945
+3  2103 189 1050
+3  2101 510 1050
+3  1790 267 1051
+3  1703 511 1051
+3  2031 171 1052
+3  2029 512 1052
+3  2269 231 1053
+3  1631 513 1053
+3  2239 247 1054
+3  2241 514 1054
+3  2325 245 1055
+3  1659 515 1055
+3  1999 163 1056
+3  1997 516 1056
+3  2205 215 1057
+3  1599 517 1057
+3  2087 185 1058
+3  2085 518 1058
+3  2095 259 1059
+3  1687 519 1059
+3  2007 165 1060
+3  2005 520 1060
+3  2221 219 1061
+3  1607 521 1061
+3  1708 87 1945
+3  1185 792 1946
+3  1348 262 1946
+3  1782 792 1947
+3  2015 167 1064
+3  1720 1064 568
+3  1098 791 1949
+3  984 261 1949
+3  2159 203 1066
+3  2157 526 1066
+3  2149 201 1067
+3  1571 527 1067
+3  2023 169 1068
+3  2021 528 1068
+3  2253 227 1069
+3  1623 529 1069
+3  2154 255 1070
+3  2160 530 1070
+3  2168 253 1071
+3  1675 531 1071
+3  2071 181 1072
+3  2069 532 1072
+3  2176 251 1073
+3  1671 533 1073
+3  2127 195 1074
+3  2125 534 1074
+3  2117 193 1075
+3  1555 535 1075
+3  2039 173 1076
+3  2037 536 1076
+3  2285 235 1077
+3  1639 537 1077
+3  1788 267 1078
+3  1790 538 1078
+3  1825 265 1079
+3  1699 539 1079
+3  2047 175 1080
+3  2045 540 1080
+3  2301 239 1081
+3  1647 541 1081
+3  2106 257 1082
+3  2108 542 1082
+3  2085 185 1083
+3  1539 543 1083
+3  2055 177 1084
+3  2053 544 1084
+3  2317 243 1085
+3  1655 545 1085
+3  2207 215 1086
+3  2205 546 1086
+3  2197 213 1087
+3  1595 547 1087
+3  2063 179 1088
+3  2061 548 1088
+3  2241 247 1089
+3  1663 549 1089
+3  2166 253 1090
+3  2168 550 1090
+3  2077 183 1091
+3  1535 551 1091
+3  2174 251 1092
+3  2176 552 1092
+3  2233 249 1093
+3  1667 553 1093
+3  2271 231 1094
+3  2269 554 1094
+3  2261 229 1095
+3  1627 555 1095
+3  2319 243 1096
+3  2317 556 1096
+3  2309 241 1097
+3  1651 557 1097
+3  1949 261 1098
+3  1951 558 1098
+3  2093 187 1099
+3  1543 559 1099
+3  2091 259 1100
+3  2095 560 1100
+3  2108 257 1101
+3  1683 561 1101
+3  1823 265 1102
+3  1825 562 1102
+3  2101 189 1103
+3  1547 563 1103
+3  1856 263 1104
+3  1858 564 1104
+3  1951 261 1105
+3  1691 565 1105
+3  2303 239 1106
+3  2301 566 1106
+3  2293 237 1107
+3  1643 567 1107
+3  1696 791 1950
+3  1458 86 1950
+3  1105 790 1951
+3  1098 261 1951
+3  1924 790 1980
+3  1390 2093 570
+3  1351 1858 263
+3  1936 29 1980
+3  1963 154 1112
+3  1961 572 1112
+3  1985 160 1113
+3  1489 573 1113
+3  1731 96 1114
+3  1729 574 1114
+3  1801 114 1115
+3  1397 575 1115
+3  1971 156 1116
+3  1969 576 1116
+3  1953 152 1117
+3  1473 577 1117
+3  1715 92 1118
+3  1713 578 1118
+3  1809 116 1119
+3  1401 579 1119
+3  1979 158 1120
+3  1977 580 1120
+3  1961 154 1121
+3  1477 581 1121
+3  1719 93 1122
+3  1717 582 1122
+3  1817 118 1123
+3  1405 583 1123
+3  1987 160 1124
+3  1985 584 1124
+3  1969 156 1125
+3  1481 585 1125
+3  1336 789 2012
+3  977 260 2012
+3  922 1127 911
+3  1409 587 1127
+3  1955 152 1128
+3  1953 588 1128
+3  1977 158 1129
+3  1485 589 1129
+3  1727 95 1130
+3  1725 590 1130
+3  1793 112 1131
+3  1393 591 1131
+3  2003 164 1132
+3  2001 592 1132
+3  2025 170 1133
+3  1509 593 1133
+3  1751 101 1134
+3  1749 594 1134
+3  1841 124 1135
+3  1417 595 1135
+3  2011 166 1136
+3  2009 596 1136
+3  1993 162 1137
+3  1493 597 1137
+3  1735 97 1138
+3  1733 598 1138
+3  1849 126 1139
+3  1421 599 1139
+3  2019 168 1140
+3  2017 600 1140
+3  2001 164 1141
+3  1497 601 1141
+3  1739 98 1142
+3  1682 789 2088
+3  1696 86 2088
+3  1610 1574 603
+3  2027 170 1144
+3  2025 604 1144
+3  2009 166 1145
+3  1501 605 1145
+3  1743 99 1146
+3  1741 606 1146
+3  1865 130 1147
+3  1429 607 1147
+3  1995 162 1148
+3  1993 608 1148
+3  2017 168 1149
+3  1505 609 1149
+3  1747 100 1150
+3  1745 610 1150
+3  1833 122 1151
+3  1413 611 1151
+3  2043 174 1152
+3  2041 612 1152
+3  2065 180 1153
+3  1529 613 1153
+3  1771 106 1154
+3  1769 614 1154
+3  1881 134 1155
+3  1437 615 1155
+3  2051 176 1156
+3  2049 616 1156
+3  2033 172 1157
+3  1513 617 1157
+3  1755 102 1158
+3  1753 618 1158
+3  1889 136 1159
+3  1441 619 1159
+3  2059 178 1160
+3  2057 620 1160
+3  2041 174 1161
+3  1517 621 1161
+3  1759 103 1162
+3  1757 622 1162
+3  1897 138 1163
+3  1445 623 1163
+3  2067 180 1164
+3  2065 624 1164
+3  2049 176 1165
+3  1521 625 1165
+3  1763 104 1166
+3  1761 626 1166
+3  1905 140 1167
+3  1449 627 1167
+3  2035 172 1168
+3  2033 628 1168
+3  2057 178 1169
+3  1525 629 1169
+3  1767 105 1170
+3  1765 630 1170
+3  1873 132 1171
+3  1433 631 1171
+3  2131 196 1172
+3  2129 632 1172
+3  2228 250 1173
+3  1669 633 1173
+3  1911 141 1174
+3  1909 634 1174
+3  1805 115 1175
+3  1399 635 1175
+3  2211 216 1176
+3  2209 636 1176
+3  2313 242 1177
+3  1653 637 1177
+3  1895 137 1178
+3  1893 638 1178
+3  1845 125 1179
+3  1419 639 1179
+3  1321 788 2089
+3  1336 260 2089
+3  1855 788 2090
+3  2153 7 2090
+3  1927 145 1182
+3  1925 642 1182
+3  1100 787 2091
+3  938 259 2091
+3  1604 787 2094
+3  1460 85 2094
+3  1946 262 1185
+3  1693 645 1185
+3  1935 147 1186
+3  1933 646 1186
+3  1829 121 1187
+3  1411 647 1187
+3  1059 786 2095
+3  1100 259 2095
+3  1928 786 2096
+3  1844 28 2096
+3  1244 785 2104
+3  1542 785 2105
+3  1604 85 2105
+3  1082 783 2106
+3  2187 210 1192
+3  2185 652 1192
+3  2281 234 1193
+3  1637 653 1193
+3  1879 133 1194
+3  1877 654 1194
+3  1729 96 1195
+3  1361 655 1195
+3  2275 232 1196
+3  2273 656 1196
+3  2129 196 1197
+3  1561 657 1197
+3  1803 114 1198
+3  1801 658 1198
+3  1877 133 1199
+3  1435 659 1199
+3  2123 194 1200
+3  2121 660 1200
+3  2073 182 1201
+3  1533 661 1201
+3  1775 107 1202
+3  1773 662 1202
+3  1713 92 1203
+3  1353 663 1203
+3  2162 254 1204
+3  2164 664 1204
+3  2145 200 1205
+3  1569 665 1205
+3  1811 116 1206
+3  1809 666 1206
+3  1773 107 1207
+3  1383 667 1207
+3  2139 198 1208
+3  2137 668 1208
+3  2249 226 1209
+3  1621 669 1209
+3  1863 129 1210
+3  1861 670 1210
+3  1717 93 1211
+3  1355 671 1211
+3  980 257 2106
+3  1688 783 2107
+3  1442 84 2107
+3  1101 782 2108
+3  1819 118 1214
+3  1817 674 1214
+3  1861 129 1215
+3  1427 675 1215
+3  1082 257 2108
+3  1892 782 2109
+3  1928 28 2109
+3  1328 781 2110
+3  961 256 2110
+3  1650 781 2111
+3  1688 84 2111
+3  1289 780 2152
+3  1328 256 2152
+3  2090 780 2153
+3  2304 7 2153
+3  1070 779 2154
+3  1334 120 943
+3  918 255 2154
+3  1564 779 2155
+3  1430 83 2155
+3  1039 778 2160
+3  1070 255 2160
+3  2097 188 1225
+3  1545 685 1225
+3  1787 110 1226
+3  1785 686 1226
+3  1725 95 1227
+3  1359 687 1227
+3  1818 266 1228
+3  1821 688 1228
+3  2113 192 1229
+3  1553 689 1229
+3  1795 112 1230
+3  1793 690 1230
+3  1785 110 1231
+3  1389 691 1231
+3  2267 230 1232
+3  2265 692 1232
+3  2247 246 1233
+3  1661 693 1233
+3  1903 139 1234
+3  1901 694 1234
+3  1749 101 1235
+3  1371 695 1235
+3  2323 244 1236
+3  2321 696 1236
+3  2209 216 1237
+3  1601 697 1237
+3  1843 124 1238
+3  1841 698 1238
+3  1901 139 1239
+3  1447 699 1239
+3  2203 214 1240
+3  2201 700 1240
+3  2081 184 1241
+3  1537 701 1241
+3  1779 108 1242
+3  1777 702 1242
+3  1733 97 1243
+3  1363 703 1243
+3  1469 2104 1126
+3  1549 1244 1143
+3  2225 220 1245
+3  1609 705 1245
+3  1851 126 1246
+3  1849 706 1246
+3  1777 108 1247
+3  1385 707 1247
+3  2219 218 1248
+3  2217 708 1248
+3  1868 778 2161
+3  1804 27 2161
+3  1204 777 2162
+3  949 254 2162
+3  1626 777 2163
+3  1564 83 2163
+3  1265 776 2164
+3  1204 254 2164
+3  2136 776 2165
+3  2256 4 2165
+3  1090 775 2166
+3  950 253 2166
+3  1628 775 2167
+3  1450 82 2167
+3  1071 774 2168
+3  1090 253 2168
+3  1908 774 2169
+3  1868 27 2169
+3  1815 117 1258
+3  1813 718 1258
+3  1741 99 1259
+3  1367 719 1259
+3  2147 200 1260
+3  2145 720 1260
+3  2257 228 1261
+3  1625 721 1261
+3  1867 130 1262
+3  1865 722 1262
+3  1813 117 1263
+3  1403 723 1263
+3  2251 226 1264
+3  2249 724 1264
+3  2164 254 1265
+3  1677 725 1265
+3  1919 143 1266
+3  1917 726 1266
+3  1745 100 1267
+3  1369 727 1267
+3  2170 252 1268
+3  2172 728 1268
+3  2193 212 1269
+3  1593 729 1269
+3  1835 122 1270
+3  1833 730 1270
+3  1917 143 1271
+3  1455 731 1271
+3  2179 250 1272
+3  2228 732 1272
+3  2121 194 1273
+3  1557 733 1273
+3  1799 113 1274
+3  1797 734 1274
+3  1769 106 1275
+3  1381 735 1275
+3  2115 192 1276
+3  2113 736 1276
+3  2289 236 1277
+3  1641 737 1277
+3  1883 134 1278
+3  1881 738 1278
+3  1797 113 1279
+3  1395 739 1279
+3  2283 234 1280
+3  2281 740 1280
+3  1821 266 1281
+3  1701 741 1281
+3  1943 149 1282
+3  1941 742 1282
+3  1753 102 1283
+3  1373 743 1283
+3  1852 264 1284
+3  1854 744 1284
+3  2305 240 1285
+3  1649 745 1285
+3  1891 136 1286
+3  1889 746 1286
+3  1941 149 1287
+3  1467 747 1287
+3  2299 238 1288
+3  2297 748 1288
+3  2152 256 1289
+3  1681 749 1289
+3  1923 144 1290
+3  1921 750 1290
+3  1757 103 1291
+3  1375 751 1291
+3  2083 184 1292
+3  2081 752 1292
+3  2321 244 1293
+3  1657 753 1293
+3  1899 138 1294
+3  1897 754 1294
+3  1921 144 1295
+3  1457 755 1295
+3  2315 242 1296
+3  2313 756 1296
+3  2201 214 1297
+3  1597 757 1297
+3  1839 123 1298
+3  1837 758 1298
+3  1761 104 1299
+3  1377 759 1299
+3  2195 212 1300
+3  2193 760 1300
+3  2237 248 1301
+3  1665 761 1301
+3  1907 140 1302
+3  1905 762 1302
+3  1837 123 1303
+3  1415 763 1303
+3  2243 246 1304
+3  2247 764 1304
+3  2172 252 1305
+3  1673 765 1305
+3  1915 142 1306
+3  1913 766 1306
+3  1765 105 1307
+3  1379 767 1307
+3  2075 182 1308
+3  2073 768 1308
+3  2273 232 1309
+3  1633 769 1309
+3  1875 132 1310
+3  1873 770 1310
+3  1913 142 1311
+3  1453 771 1311
+3  2235 248 1312
+3  2237 772 1312
+3  2265 230 1313
+3  1629 773 1313
+3  1871 131 1314
+3  1869 774 1314
+3  1909 141 1315
+3  1451 775 1315
+3  2259 228 1316
+3  2257 776 1316
+3  2137 198 1317
+3  1565 777 1317
+3  1807 115 1318
+3  1805 778 1318
+3  1869 131 1319
+3  1431 779 1319
+3  2307 240 1320
+3  2305 780 1320
+3  2089 260 1321
+3  1689 781 1321
+3  1931 146 1322
+3  1929 782 1322
+3  1893 137 1323
+3  1443 783 1323
+3  1268 773 2170
+3  969 252 2170
+3  2217 218 1325
+3  1605 785 1325
+3  1847 125 1326
+3  1845 786 1326
+3  1929 146 1327
+3  1461 787 1327
+3  2110 256 1328
+3  2152 788 1328
+3  1854 264 1329
+3  1697 789 1329
+3  1939 148 1330
+3  1937 790 1330
+3  1925 145 1331
+3  1459 791 1331
+3  2099 188 1332
+3  2097 792 1332
+3  1666 773 2171
+3  1709 793 1333
+3  1628 82 2171
+3  1305 772 2172
+3  1937 148 1335
+3  1465 795 1335
+3  2012 260 1336
+3  2089 796 1336
+3  2297 238 1337
+3  1645 797 1337
+3  1887 135 1338
+3  1885 798 1338
+3  1933 147 1339
+3  1463 799 1339
+3  2291 236 1340
+3  2289 800 1340
+3  2185 210 1341
+3  1589 801 1341
+3  1831 121 1342
+3  1829 802 1342
+3  1885 135 1343
+3  1439 803 1343
+3  2227 220 1344
+3  1268 252 2172
+3  2264 772 2173
+3  2238 9 2173
+3  1092 771 2174
+3  952 251 2174
+3  1632 771 2175
+3  1452 81 2175
+3  1944 262 1348
+3  1946 808 1348
+3  1073 770 2176
+3  1092 251 2176
+3  1912 770 2177
+3  1872 26 2177
+3  1272 769 2179
+3  903 250 2179
+3  1802 54 1352
+3  2134 272 1352
+3  1203 92 1353
+3  834 272 1353
+3  1810 56 1354
+3  2150 273 1354
+3  1211 93 1355
+3  836 273 1355
+3  1534 769 2216
+3  1632 81 2216
+3  1173 768 2228
+3  1272 250 2228
+3  926 60 925
+3  2182 275 1358
+3  1227 95 1359
+3  840 275 1359
+3  1794 52 1360
+3  2118 276 1360
+3  1195 96 1361
+3  832 276 1361
+3  1842 64 1362
+3  2214 277 1362
+3  1243 97 1363
+3  844 277 1363
+3  1850 66 1364
+3  2230 278 1364
+3  1711 98 1365
+3  846 278 1365
+3  2272 768 2229
+3  2072 8 2229
+3  1259 99 1367
+3  1471 1367 331
+3  1866 70 1368
+3  2262 280 1368
+3  1267 100 1369
+3  850 280 1369
+3  1834 62 1370
+3  2198 281 1370
+3  1235 101 1371
+3  842 281 1371
+3  1882 74 1372
+3  2294 282 1372
+3  1283 102 1373
+3  854 282 1373
+3  1890 76 1374
+3  2310 283 1374
+3  1291 103 1375
+3  856 283 1375
+3  1898 78 1376
+3  2326 284 1376
+3  1299 104 1377
+3  858 284 1377
+3  1906 80 1378
+3  2232 285 1378
+3  1307 105 1379
+3  860 285 1379
+3  1874 72 1380
+3  2278 286 1380
+3  1275 106 1381
+3  852 286 1381
+3  1806 55 1382
+3  2142 287 1382
+3  1207 107 1383
+3  835 287 1383
+3  1846 65 1384
+3  2222 288 1384
+3  1247 108 1385
+3  845 288 1385
+3  1018 767 2231
+3  972 249 2231
+3  1672 767 2232
+3  1378 80 2232
+3  1830 61 1388
+3  2190 290 1388
+3  1231 110 1389
+3  841 290 1389
+3  1093 766 2233
+3  1018 249 2233
+3  1764 766 2234
+3  1912 26 2234
+3  1730 36 1392
+3  1990 292 1392
+3  1131 112 1393
+3  816 292 1393
+3  1878 73 1394
+3  2286 293 1394
+3  1279 113 1395
+3  853 293 1395
+3  1714 32 1396
+3  1958 294 1396
+3  1115 114 1397
+3  812 294 1397
+3  1774 47 1398
+3  2078 295 1398
+3  1175 115 1399
+3  827 295 1399
+3  1718 33 1400
+3  1966 296 1400
+3  1119 116 1401
+3  813 296 1401
+3  1862 69 1402
+3  2254 297 1402
+3  1263 117 1403
+3  849 297 1403
+3  1722 34 1404
+3  1974 298 1404
+3  1123 118 1405
+3  814 298 1405
+3  1312 765 2235
+3  967 248 2235
+3  1662 765 2236
+3  1672 80 2236
+3  1726 35 1408
+3  1982 300 1408
+3  1127 120 1409
+3  815 300 1409
+3  1786 50 1410
+3  2102 301 1410
+3  1187 121 1411
+3  830 301 1411
+3  1750 41 1412
+3  2030 302 1412
+3  1151 122 1413
+3  821 302 1413
+3  1902 79 1414
+3  2240 303 1414
+3  1303 123 1415
+3  859 303 1415
+3  1734 37 1416
+3  1998 304 1416
+3  1135 124 1417
+3  817 304 1417
+3  1778 48 1418
+3  2086 305 1418
+3  1179 125 1419
+3  828 305 1419
+3  1738 38 1420
+3  2006 306 1420
+3  1139 126 1421
+3  818 306 1421
+3  1301 764 2237
+3  1312 248 2237
+3  2173 764 2238
+3  2328 9 2238
+3  1742 39 1424
+3  2014 308 1424
+3  1054 763 2239
+3  819 308 1425
+3  1814 57 1426
+3  2158 309 1426
+3  1215 129 1427
+3  837 309 1427
+3  1746 40 1428
+3  2022 310 1428
+3  1147 130 1429
+3  820 310 1429
+3  1918 83 1430
+3  2155 311 1430
+3  1319 131 1431
+3  863 311 1431
+3  1770 46 1432
+3  2070 312 1432
+3  1171 132 1433
+3  826 312 1433
+3  1798 53 1434
+3  2126 313 1434
+3  1199 133 1435
+3  833 313 1435
+3  1754 42 1436
+3  2038 314 1436
+3  1155 134 1437
+3  822 314 1437
+3  1942 89 1438
+3  1789 315 1438
+3  1343 135 1439
+3  869 315 1439
+3  1758 43 1440
+3  2046 316 1440
+3  1159 136 1441
+3  823 316 1441
+3  1922 84 1442
+3  2107 317 1442
+3  1323 137 1443
+3  864 317 1443
+3  1762 44 1444
+3  2054 318 1444
+3  1163 138 1445
+3  824 318 1445
+3  1838 63 1446
+3  2206 319 1446
+3  1239 139 1447
+3  843 319 1447
+3  1766 45 1448
+3  2062 320 1448
+3  1167 140 1449
+3  825 320 1449
+3  1914 82 1450
+3  2167 321 1450
+3  1315 141 1451
+3  862 321 1451
+3  1910 81 1452
+3  2175 322 1452
+3  1311 142 1453
+3  861 322 1453
+3  1870 71 1454
+3  2270 323 1454
+3  1271 143 1455
+3  851 323 1455
+3  1894 77 1456
+3  2318 324 1456
+3  1295 144 1457
+3  857 324 1457
+3  1930 86 1458
+3  1950 325 1458
+3  1331 145 1459
+3  866 325 1459
+3  1926 85 1460
+3  2094 326 1460
+3  1327 146 1461
+3  865 326 1461
+3  1938 88 1462
+3  1824 327 1462
+3  1339 147 1463
+3  868 327 1463
+3  1934 87 1464
+3  1857 328 1464
+3  1335 148 1465
+3  867 328 1465
+3  1886 75 1466
+3  2302 329 1466
+3  1287 149 1467
+3  855 329 1467
+3  968 247 2239
+3  1664 763 2240
+3  1414 79 2240
+3  1089 762 2241
+3  1054 247 2241
+3  1836 762 2242
+3  1904 25 2242
+3  1304 761 2243
+3  1966 33 1472
+3  1962 332 1472
+3  1117 152 1473
+3  875 332 1473
+3  1986 36 1474
+3  1730 333 1474
+3  1001 153 1475
+3  880 333 1475
+3  1974 34 1476
+3  1970 334 1476
+3  1121 154 1477
+3  877 334 1477
+3  1954 32 1478
+3  1714 335 1478
+3  993 155 1479
+3  872 335 1479
+3  1982 35 1480
+3  1978 336 1480
+3  1125 156 1481
+3  879 336 1481
+3  1962 33 1482
+3  1718 337 1482
+3  995 157 1483
+3  874 337 1483
+3  1990 36 1484
+3  1986 338 1484
+3  1129 158 1485
+3  881 338 1485
+3  1970 34 1486
+3  1722 339 1486
+3  997 159 1487
+3  876 339 1487
+3  1958 32 1488
+3  1954 340 1488
+3  1113 160 1489
+3  873 340 1489
+3  1978 35 1490
+3  1726 341 1490
+3  999 161 1491
+3  878 341 1491
+3  2006 38 1492
+3  2002 342 1492
+3  1137 162 1493
+3  885 342 1493
+3  2026 41 1494
+3  1750 343 1494
+3  1011 163 1495
+3  890 343 1495
+3  2014 39 1496
+3  2010 344 1496
+3  1141 164 1497
+3  887 344 1497
+3  1994 37 1498
+3  1734 345 1498
+3  1003 165 1499
+3  882 345 1499
+3  2022 40 1500
+3  2018 346 1500
+3  1145 166 1501
+3  889 346 1501
+3  2002 38 1502
+3  1738 347 1502
+3  1005 167 1503
+3  884 347 1503
+3  2030 41 1504
+3  2026 348 1504
+3  1149 168 1505
+3  891 348 1505
+3  2010 39 1506
+3  1742 349 1506
+3  1007 169 1507
+3  886 349 1507
+3  1998 37 1508
+3  1994 350 1508
+3  1133 170 1509
+3  883 350 1509
+3  2018 40 1510
+3  1746 351 1510
+3  1009 171 1511
+3  888 351 1511
+3  2046 43 1512
+3  2042 352 1512
+3  1157 172 1513
+3  895 352 1513
+3  2066 46 1514
+3  1770 353 1514
+3  1021 173 1515
+3  900 353 1515
+3  2054 44 1516
+3  2050 354 1516
+3  1161 174 1517
+3  897 354 1517
+3  2034 42 1518
+3  1754 355 1518
+3  1013 175 1519
+3  892 355 1519
+3  2062 45 1520
+3  2058 356 1520
+3  1165 176 1521
+3  899 356 1521
+3  2042 43 1522
+3  1758 357 1522
+3  1015 177 1523
+3  894 357 1523
+3  2070 46 1524
+3  2066 358 1524
+3  1169 178 1525
+3  901 358 1525
+3  2050 44 1526
+3  1762 359 1526
+3  1017 179 1527
+3  896 359 1527
+3  2038 42 1528
+3  2034 360 1528
+3  1153 180 1529
+3  893 360 1529
+3  2058 45 1530
+3  1766 361 1530
+3  1019 181 1531
+3  898 361 1531
+3  2134 54 1532
+3  2130 362 1532
+3  1201 182 1533
+3  917 362 1533
+3  2216 81 1534
+3  1910 363 1534
+3  1091 183 1535
+3  970 363 1535
+3  2214 64 1536
+3  2210 364 1536
+3  1241 184 1537
+3  937 364 1537
+3  2314 77 1538
+3  1894 365 1538
+3  1083 185 1539
+3  962 365 1539
+3  933 246 2243
+3  1594 761 2246
+3  1664 79 2246
+3  1233 760 2247
+3  2105 85 1542
+3  1926 367 1542
+3  1099 187 1543
+3  978 367 1543
+3  2182 60 1544
+3  2178 368 1544
+3  1225 188 1545
+3  929 368 1545
+3  1945 87 1546
+3  1934 369 1546
+3  1103 189 1547
+3  982 369 1547
+3  1304 246 2247
+3  2238 760 2328
+3  2192 9 2328
+3  1016 759 2327
+3  934 245 2327
+3  1596 759 2326
+3  1376 78 2326
+3  1055 758 2325
+3  2190 61 1552
+3  2186 372 1552
+3  1229 192 1553
+3  931 372 1553
+3  2282 73 1554
+3  1878 373 1554
+3  1075 193 1555
+3  954 373 1555
+3  2278 72 1556
+3  2274 374 1556
+3  1273 194 1557
+3  953 374 1557
+3  2130 54 1558
+3  1802 375 1558
+3  1037 195 1559
+3  916 375 1559
+3  2126 53 1560
+3  2122 376 1560
+3  1197 196 1561
+3  915 376 1561
+3  2074 47 1562
+3  1774 377 1562
+3  1023 197 1563
+3  902 377 1563
+3  2155 83 1564
+3  2163 378 1564
+3  1317 198 1565
+3  975 378 1565
+3  2146 56 1566
+3  1810 379 1566
+3  1041 199 1567
+3  920 379 1567
+3  2142 55 1568
+3  2138 380 1568
+3  1205 200 1569
+3  919 380 1569
+3  2250 69 1570
+3  1862 381 1570
+3  1067 201 1571
+3  946 381 1571
+3  1016 245 2325
+3  1760 758 2324
+3  1836 25 2324
+3  1236 757 2323
+3  963 244 2323
+3  1654 757 2322
+3  1350 51 203
+3  1596 78 2322
+3  2158 57 1576
+3  1293 756 2321
+3  1236 244 2321
+3  2200 756 2320
+3  2312 3 2320
+3  1096 755 2319
+3  964 243 2319
+3  1656 755 2318
+3  1456 77 2318
+3  1085 754 2317
+3  1096 243 2317
+3  1920 754 2316
+3  2178 60 1582
+3  1896 24 2316
+3  1296 753 2315
+3  905 242 2315
+3  1538 753 2314
+3  1656 77 2314
+3  1177 752 2313
+3  1296 242 2313
+3  2098 50 1586
+3  1786 389 1586
+3  1029 209 1587
+3  908 389 1587
+3  1789 89 1588
+3  1820 390 1588
+3  1341 210 1589
+3  987 390 1589
+3  2114 52 1590
+3  1794 391 1590
+3  1033 211 1591
+3  912 391 1591
+3  2270 71 1592
+3  2266 392 1592
+3  1269 212 1593
+3  951 392 1593
+3  2246 79 1594
+3  1902 393 1594
+3  1087 213 1595
+3  966 393 1595
+3  2326 78 1596
+3  2322 394 1596
+3  1297 214 1597
+3  965 394 1597
+3  2210 64 1598
+3  1842 395 1598
+3  1057 215 1599
+3  936 395 1599
+3  2206 63 1600
+3  2202 396 1600
+3  1237 216 1601
+3  935 396 1601
+3  2082 48 1602
+3  1778 397 1602
+3  1025 217 1603
+3  904 397 1603
+3  2094 85 1604
+3  2105 398 1604
+3  1325 218 1605
+3  979 398 1605
+3  2226 66 1606
+3  1850 399 1606
+3  1061 219 1607
+3  940 399 1607
+3  2222 65 1608
+3  2218 400 1608
+3  1245 220 1609
+3  939 400 1609
+3  2320 752 2312
+3  2080 3 2312
+3  1014 751 2311
+3  976 241 2311
+3  1680 751 2310
+3  1374 76 2310
+3  1097 750 2309
+3  1014 241 2309
+3  1756 750 2308
+3  1920 24 2308
+3  1320 749 2307
+3  959 240 2307
+3  1646 749 2306
+3  1680 76 2306
+3  1285 748 2305
+3  1320 240 2305
+3  2153 748 2304
+3  2296 7 2304
+3  1043 225 1619
+3  1106 747 2303
+3  2150 56 1620
+3  2146 406 1620
+3  1209 226 1621
+3  921 406 1621
+3  2258 70 1622
+3  1866 407 1622
+3  1069 227 1623
+3  948 407 1623
+3  2254 69 1624
+3  2250 408 1624
+3  1261 228 1625
+3  947 408 1625
+3  2163 83 1626
+3  1918 409 1626
+3  1095 229 1627
+3  974 409 1627
+3  2167 82 1628
+3  2171 410 1628
+3  1313 230 1629
+3  973 410 1629
+3  2194 62 1630
+3  1834 411 1630
+3  1053 231 1631
+3  932 411 1631
+3  2175 81 1632
+3  2216 412 1632
+3  1309 232 1633
+3  971 412 1633
+3  2122 53 1634
+3  1798 413 1634
+3  1035 233 1635
+3  914 413 1635
+3  2118 52 1636
+3  2114 414 1636
+3  1193 234 1637
+3  913 414 1637
+3  2290 74 1638
+3  1882 415 1638
+3  1077 235 1639
+3  956 415 1639
+3  2286 73 1640
+3  2282 416 1640
+3  1277 236 1641
+3  955 416 1641
+3  1820 89 1642
+3  1942 417 1642
+3  1107 237 1643
+3  986 417 1643
+3  1824 88 1644
+3  1853 418 1644
+3  1337 238 1645
+3  985 418 1645
+3  2306 76 1646
+3  1890 419 1646
+3  1081 239 1647
+3  960 419 1647
+3  2302 75 1648
+3  2298 420 1648
+3  1285 240 1649
+3  959 420 1649
+3  2111 84 1650
+3  1922 421 1650
+3  1097 241 1651
+3  976 421 1651
+3  2086 48 1652
+3  2082 422 1652
+3  1177 242 1653
+3  905 422 1653
+3  2322 78 1654
+3  1898 423 1654
+3  1085 243 1655
+3  964 423 1655
+3  2318 77 1656
+3  2314 424 1656
+3  1293 244 1657
+3  963 424 1657
+3  2202 63 1658
+3  1838 425 1658
+3  1055 245 1659
+3  934 425 1659
+3  2198 62 1660
+3  2194 426 1660
+3  1233 246 1661
+3  933 426 1661
+3  2236 80 1662
+3  1906 427 1662
+3  1089 247 1663
+3  968 427 1663
+3  2240 79 1664
+3  2246 428 1664
+3  1301 248 1665
+3  967 428 1665
+3  2171 82 1666
+3  1914 429 1666
+3  1093 249 1667
+3  972 429 1667
+3  2078 47 1668
+3  2074 430 1668
+3  1173 250 1669
+3  903 430 1669
+3  2274 72 1670
+3  1874 431 1670
+3  1073 251 1671
+3  952 431 1671
+3  2232 80 1672
+3  2236 432 1672
+3  1305 252 1673
+3  969 432 1673
+3  2266 71 1674
+3  1870 433 1674
+3  1071 253 1675
+3  950 433 1675
+3  2262 70 1676
+3  2258 434 1676
+3  1265 254 1677
+3  949 434 1677
+3  2138 55 1678
+3  1806 435 1678
+3  1039 255 1679
+3  918 435 1679
+3  2310 76 1680
+3  2306 436 1680
+3  1289 256 1681
+3  961 436 1681
+3  2088 86 1682
+3  1930 437 1682
+3  1101 257 1683
+3  980 437 1683
+3  960 239 2303
+3  1648 747 2302
+3  1466 75 2302
+3  1081 746 2301
+3  2218 65 1686
+3  1846 439 1686
+3  1059 259 1687
+3  938 439 1687
+3  2107 84 1688
+3  2111 440 1688
+3  1321 260 1689
+3  977 440 1689
+3  1853 88 1690
+3  1938 441 1690
+3  1105 261 1691
+3  984 441 1691
+3  2102 50 1692
+3  2098 442 1692
+3  1185 262 1693
+3  909 442 1693
+3  1106 239 2301
+3  1940 746 2300
+3  1888 23 2300
+3  1288 745 2299
+3  1950 86 1696
+3  2088 444 1696
+3  1329 264 1697
+3  981 444 1697
+3  2298 75 1698
+3  1886 445 1698
+3  1079 265 1699
+3  958 445 1699
+3  2294 74 1700
+3  2290 446 1700
+3  1281 266 1701
+3  957 446 1701
+3  2186 61 1702
+3  1830 447 1702
+3  1051 267 1703
+3  930 447 1703
+3  1781 66 1695
+3  985 238 2299
+3  1698 745 2298
+3  1648 75 2298
+3  1337 744 2297
+3  1288 238 2297
+3  2304 744 2296
+3  1855 7 2296
+3  1857 87 1708
+3  1945 450 1708
+3  1685 1709 1349
+3  1004 450 1709
+3  1012 743 2295
+3  986 237 2295
+3  1700 743 2294
+3  1372 74 2294
+3  2132 13 1712
+3  1964 452 1712
+3  1118 92 1713
+3  1203 452 1713
+3  1478 32 1714
+3  1396 453 1714
+3  834 92 1715
+3  1118 453 1715
+3  2148 14 1716
+3  1972 454 1716
+3  1122 93 1717
+3  1211 454 1717
+3  1482 33 1718
+3  1400 455 1718
+3  836 93 1719
+3  1122 455 1719
+3  1107 742 2293
+3  1012 237 2293
+3  1752 742 2292
+3  1940 23 2292
+3  1486 34 1722
+3  1404 457 1722
+3  1256 1723 111
+3  1221 457 1723
+3  2180 16 1724
+3  1988 458 1724
+3  1130 95 1725
+3  1227 458 1725
+3  1490 35 1726
+3  1408 459 1726
+3  840 95 1727
+3  1130 459 1727
+3  2116 12 1728
+3  1956 460 1728
+3  1114 96 1729
+3  1195 460 1729
+3  1474 36 1730
+3  1392 461 1730
+3  832 96 1731
+3  1114 461 1731
+3  2212 18 1732
+3  2004 462 1732
+3  1138 97 1733
+3  1243 462 1733
+3  1498 37 1734
+3  1416 463 1734
+3  844 97 1735
+3  1138 463 1735
+3  1340 741 2291
+3  955 236 2291
+3  1736 1142 98
+3  1638 741 2290
+3  1502 38 1738
+3  1420 465 1738
+3  846 98 1739
+3  1142 465 1739
+3  2244 20 1740
+3  2020 466 1740
+3  1146 99 1741
+3  1259 466 1741
+3  1506 39 1742
+3  1424 467 1742
+3  848 99 1743
+3  1146 467 1743
+3  2260 21 1744
+3  2028 468 1744
+3  1150 100 1745
+3  1267 468 1745
+3  1510 40 1746
+3  1428 469 1746
+3  850 100 1747
+3  1150 469 1747
+3  2196 17 1748
+3  1996 470 1748
+3  1134 101 1749
+3  1235 470 1749
+3  1494 41 1750
+3  1412 471 1750
+3  842 101 1751
+3  1134 471 1751
+3  2292 23 1752
+3  2044 472 1752
+3  1158 102 1753
+3  1283 472 1753
+3  1518 42 1754
+3  1436 473 1754
+3  854 102 1755
+3  1158 473 1755
+3  2308 24 1756
+3  2052 474 1756
+3  1162 103 1757
+3  1291 474 1757
+3  1522 43 1758
+3  1440 475 1758
+3  856 103 1759
+3  1162 475 1759
+3  2324 25 1760
+3  2060 476 1760
+3  1166 104 1761
+3  1299 476 1761
+3  1526 44 1762
+3  1444 477 1762
+3  858 104 1763
+3  1166 477 1763
+3  2234 26 1764
+3  2068 478 1764
+3  1170 105 1765
+3  1307 478 1765
+3  1530 45 1766
+3  1448 479 1766
+3  860 105 1767
+3  1170 479 1767
+3  2276 22 1768
+3  2036 480 1768
+3  1154 106 1769
+3  1275 480 1769
+3  1514 46 1770
+3  1432 481 1770
+3  852 106 1771
+3  1154 481 1771
+3  2140 13 1772
+3  2132 482 1772
+3  1202 107 1773
+3  1207 482 1773
+3  1562 47 1774
+3  1398 483 1774
+3  835 107 1775
+3  1202 483 1775
+3  2220 18 1776
+3  2212 484 1776
+3  1242 108 1777
+3  1247 484 1777
+3  1602 48 1778
+3  1418 485 1778
+3  845 108 1779
+3  1242 485 1779
+3  1700 74 2290
+3  1277 740 2289
+3  1340 236 2289
+3  1822 740 2288
+3  2280 2 2288
+3  1034 739 2287
+3  956 235 2287
+3  1640 739 2286
+3  2188 16 1784
+3  2180 488 1784
+3  1226 110 1785
+3  1231 488 1785
+3  1586 50 1786
+3  1410 489 1786
+3  841 110 1787
+3  1226 489 1787
+3  1394 73 2286
+3  1077 738 2285
+3  1034 235 2285
+3  1796 738 2284
+3  1880 22 2284
+3  1280 737 2283
+3  913 234 2283
+3  1554 737 2282
+3  1988 16 1792
+3  2188 492 1792
+3  1230 112 1793
+3  1131 492 1793
+3  1590 52 1794
+3  1360 493 1794
+3  816 112 1795
+3  1230 493 1795
+3  2284 22 1796
+3  2276 494 1796
+3  1274 113 1797
+3  1279 494 1797
+3  1634 53 1798
+3  1434 495 1798
+3  853 113 1799
+3  1274 495 1799
+3  1956 12 1800
+3  2124 496 1800
+3  1198 114 1801
+3  1115 496 1801
+3  1558 54 1802
+3  1352 497 1802
+3  812 114 1803
+3  1198 497 1803
+3  2076 27 1804
+3  2161 498 1804
+3  1318 115 1805
+3  1175 498 1805
+3  1678 55 1806
+3  1382 499 1806
+3  827 115 1807
+3  1318 499 1807
+3  1964 13 1808
+3  2140 500 1808
+3  1206 116 1809
+3  1119 500 1809
+3  1566 56 1810
+3  1354 501 1810
+3  813 116 1811
+3  1206 501 1811
+3  2252 20 1812
+3  2244 502 1812
+3  1258 117 1813
+3  1263 502 1813
+3  1572 57 307
+3  1426 503 1814
+3  849 117 1815
+3  1258 503 1815
+3  1972 14 1816
+3  2156 504 1816
+3  1214 118 1817
+3  1123 504 1817
+3  1640 73 2282
+3  1193 736 2281
+3  814 118 1819
+3  1214 505 1819
+3  1280 234 2281
+3  2288 736 2280
+3  2112 2 2280
+3  1020 735 2279
+3  914 233 2279
+3  1556 735 2278
+3  1380 72 2278
+3  1035 734 2277
+3  1020 233 2277
+3  1768 734 2276
+3  1796 22 2276
+3  927 1127 508
+3  1220 60 49
+3  1196 733 2275
+3  815 120 1827
+3  971 232 2275
+3  2100 30 1828
+3  1791 510 1828
+3  1342 121 1829
+3  1187 510 1829
+3  1702 61 1830
+3  1388 511 1830
+3  830 121 1831
+3  1342 511 1831
+3  2028 21 1832
+3  2268 512 1832
+3  1270 122 1833
+3  1151 512 1833
+3  1630 62 1834
+3  1370 513 1834
+3  821 122 1835
+3  1270 513 1835
+3  2242 25 1836
+3  2324 514 1836
+3  1298 123 1837
+3  1303 514 1837
+3  1658 63 1838
+3  1446 515 1838
+3  859 123 1839
+3  1298 515 1839
+3  1996 17 1840
+3  2204 516 1840
+3  1238 124 1841
+3  1135 516 1841
+3  1598 64 1842
+3  1362 517 1842
+3  817 124 1843
+3  1238 517 1843
+3  2084 28 1844
+3  2096 518 1844
+3  1326 125 1845
+3  1179 518 1845
+3  1686 65 1846
+3  1384 519 1846
+3  828 125 1847
+3  1326 519 1847
+3  2004 18 1848
+3  2220 520 1848
+3  1246 126 1849
+3  1139 520 1849
+3  1606 66 1850
+3  1364 521 1850
+3  818 126 1851
+3  1246 521 1851
+3  1670 733 2274
+3  1556 72 2274
+3  1309 732 2273
+3  1196 232 2273
+3  2120 732 2272
+3  2229 8 2272
+3  1094 731 2271
+3  932 231 2271
+3  1592 731 2270
+3  1454 71 2270
+3  1053 730 2269
+3  1094 231 2269
+3  1916 730 2268
+3  1832 21 2268
+3  1232 729 2267
+3  973 230 2267
+3  2156 14 1860
+3  2148 526 1860
+3  1210 129 1861
+3  1215 526 1861
+3  1570 69 1862
+3  1402 527 1862
+3  837 129 1863
+3  1210 527 1863
+3  2020 20 1864
+3  2252 528 1864
+3  1262 130 1865
+3  1147 528 1865
+3  1622 70 1866
+3  1368 529 1866
+3  820 130 1867
+3  1262 529 1867
+3  2161 27 1868
+3  2169 530 1868
+3  1314 131 1869
+3  1319 530 1869
+3  1674 71 1870
+3  1454 531 1870
+3  863 131 1871
+3  1314 531 1871
+3  2068 26 1872
+3  2177 532 1872
+3  1310 132 1873
+3  1171 532 1873
+3  1670 72 1874
+3  1380 533 1874
+3  826 132 1875
+3  1310 533 1875
+3  2124 12 1876
+3  2116 534 1876
+3  1194 133 1877
+3  1199 534 1877
+3  1554 73 1878
+3  1394 535 1878
+3  833 133 1879
+3  1194 535 1879
+3  2036 22 1880
+3  2284 536 1880
+3  1278 134 1881
+3  1155 536 1881
+3  1638 74 1882
+3  1372 537 1882
+3  822 134 1883
+3  1278 537 1883
+3  1791 30 1884
+3  1826 538 1884
+3  1338 135 1885
+3  1343 538 1885
+3  1698 75 1886
+3  1466 539 1886
+3  869 135 1887
+3  1338 539 1887
+3  2044 23 1888
+3  2300 540 1888
+3  1286 136 1889
+3  1159 540 1889
+3  1646 76 1890
+3  1374 541 1890
+3  823 136 1891
+3  1286 541 1891
+3  2109 28 1892
+3  2084 542 1892
+3  1178 137 1893
+3  1323 542 1893
+3  1538 77 1894
+3  1456 543 1894
+3  864 137 1895
+3  1178 543 1895
+3  2052 24 1896
+3  2316 544 1896
+3  1294 138 1897
+3  1163 544 1897
+3  1654 78 1898
+3  1376 545 1898
+3  824 138 1899
+3  1294 545 1899
+3  2204 17 1900
+3  2196 546 1900
+3  1234 139 1901
+3  1239 546 1901
+3  1594 79 1902
+3  1414 547 1902
+3  843 139 1903
+3  1234 547 1903
+3  2060 25 1904
+3  2242 548 1904
+3  1302 140 1905
+3  1167 548 1905
+3  1662 80 1906
+3  1378 549 1906
+3  825 140 1907
+3  1302 549 1907
+3  2169 27 1908
+3  2076 550 1908
+3  1174 141 1909
+3  1315 550 1909
+3  1534 81 1910
+3  1452 551 1910
+3  862 141 1911
+3  1174 551 1911
+3  2177 26 1912
+3  2234 552 1912
+3  1306 142 1913
+3  1311 552 1913
+3  1666 82 1914
+3  1450 553 1914
+3  861 142 1915
+3  1306 553 1915
+3  2268 21 1916
+3  2260 554 1916
+3  1266 143 1917
+3  1271 554 1917
+3  1626 83 1918
+3  1430 555 1918
+3  851 143 1919
+3  1266 555 1919
+3  2316 24 1920
+3  2308 556 1920
+3  1290 144 1921
+3  1295 556 1921
+3  1650 84 1922
+3  1442 557 1922
+3  857 144 1923
+3  1290 557 1923
+3  1980 29 1924
+3  2092 558 1924
+3  1182 145 1925
+3  1331 558 1925
+3  1542 85 1926
+3  1460 559 1926
+3  866 145 1927
+3  1182 559 1927
+3  2096 28 1928
+3  2109 560 1928
+3  1322 146 1929
+3  1327 560 1929
+3  1682 86 1930
+3  1458 561 1930
+3  865 146 1931
+3  1322 561 1931
+3  1826 30 1932
+3  2100 562 1932
+3  1186 147 1933
+3  1339 562 1933
+3  1546 87 1934
+3  1464 563 1934
+3  868 147 1935
+3  1186 563 1935
+3  1859 29 1936
+3  1980 564 1936
+3  1330 148 1937
+3  1335 564 1937
+3  1690 88 1938
+3  1462 565 1938
+3  867 148 1939
+3  1330 565 1939
+3  2300 23 1940
+3  2292 566 1940
+3  1282 149 1941
+3  1287 566 1941
+3  1642 89 1942
+3  1438 567 1942
+3  855 149 1943
+3  1282 567 1943
+3  1674 729 2266
+3  1592 71 2266
+3  1313 728 2265
+3  1232 230 2265
+3  2192 728 2264
+3  2173 9 2264
+3  1008 727 2263
+3  974 229 2263
+3  2092 29 1948
+3  1859 570 1948
+3  1676 727 2262
+3  1368 70 2262
+3  1095 726 2261
+3  1008 229 2261
+3  1744 726 2260
+3  1916 21 2260
+3  1960 0 1952
+3  1984 572 1952
+3  1128 152 1953
+3  1117 572 1953
+3  1488 32 1954
+3  1478 573 1954
+3  875 152 1955
+3  1128 573 1955
+3  1728 12 1956
+3  1800 574 1956
+3  1036 153 1957
+3  1001 574 1957
+3  1396 32 1958
+3  1488 575 1958
+3  880 153 1959
+3  1036 575 1959
+3  1968 0 1960
+3  1952 576 1960
+3  1112 154 1961
+3  1121 576 1961
+3  1472 33 1962
+3  1482 577 1962
+3  877 154 1963
+3  1112 577 1963
+3  1712 13 1964
+3  1808 578 1964
+3  1040 155 1965
+3  993 578 1965
+3  1400 33 1966
+3  1472 579 1966
+3  872 155 1967
+3  1040 579 1967
+3  1976 0 1968
+3  1960 580 1968
+3  1116 156 1969
+3  1125 580 1969
+3  1476 34 1970
+3  1486 581 1970
+3  879 156 1971
+3  1116 581 1971
+3  1716 14 1972
+3  1816 582 1972
+3  1044 157 1973
+3  995 582 1973
+3  1404 34 1974
+3  1476 583 1974
+3  874 157 1975
+3  1044 583 1975
+3  1984 0 1976
+3  1968 584 1976
+3  1120 158 1977
+3  1129 584 1977
+3  1480 35 1978
+3  1490 585 1978
+3  881 158 1979
+3  1120 585 1979
+3  1316 725 2259
+3  947 228 2259
+3  1048 159 1981
+3  1222 1981 682
+3  1408 35 1982
+3  1480 587 1982
+3  876 159 1983
+3  1048 587 1983
+3  1952 0 1984
+3  1976 588 1984
+3  1124 160 1985
+3  1113 588 1985
+3  1484 36 1986
+3  1474 589 1986
+3  873 160 1987
+3  1124 589 1987
+3  1724 16 1988
+3  1792 590 1988
+3  1032 161 1989
+3  999 590 1989
+3  1392 36 1990
+3  1484 591 1990
+3  878 161 1991
+3  1032 591 1991
+3  2000 1 1992
+3  2024 592 1992
+3  1148 162 1993
+3  1137 592 1993
+3  1508 37 1994
+3  1498 593 1994
+3  885 162 1995
+3  1148 593 1995
+3  1748 17 1996
+3  1840 594 1996
+3  1056 163 1997
+3  1011 594 1997
+3  1416 37 1998
+3  1508 595 1998
+3  890 163 1999
+3  1056 595 1999
+3  2008 1 2000
+3  1992 596 2000
+3  1132 164 2001
+3  1141 596 2001
+3  1492 38 2002
+3  1502 597 2002
+3  887 164 2003
+3  1132 597 2003
+3  1732 18 2004
+3  1848 598 2004
+3  1060 165 2005
+3  1003 598 2005
+3  1420 38 2006
+3  1492 599 2006
+3  882 165 2007
+3  1060 599 2007
+3  2016 1 2008
+3  2000 600 2008
+3  1136 166 2009
+3  1145 600 2009
+3  1496 39 2010
+3  1506 601 2010
+3  889 166 2011
+3  1136 601 2011
+3  1622 725 2258
+3  1676 70 2258
+3  1064 167 2013
+3  1005 602 2013
+3  1424 39 2014
+3  1496 603 2014
+3  884 167 2015
+3  1064 603 2015
+3  2024 1 2016
+3  2008 604 2016
+3  1140 168 2017
+3  1149 604 2017
+3  1500 40 2018
+3  1510 605 2018
+3  891 168 2019
+3  1140 605 2019
+3  1740 20 2020
+3  1864 606 2020
+3  1068 169 2021
+3  1007 606 2021
+3  1428 40 2022
+3  1500 607 2022
+3  886 169 2023
+3  1068 607 2023
+3  1992 1 2024
+3  2016 608 2024
+3  1144 170 2025
+3  1133 608 2025
+3  1504 41 2026
+3  1494 609 2026
+3  883 170 2027
+3  1144 609 2027
+3  1744 21 2028
+3  1832 610 2028
+3  1052 171 2029
+3  1009 610 2029
+3  1412 41 2030
+3  1504 611 2030
+3  888 171 2031
+3  1052 611 2031
+3  2040 5 2032
+3  2064 612 2032
+3  1168 172 2033
+3  1157 612 2033
+3  1528 42 2034
+3  1518 613 2034
+3  895 172 2035
+3  1168 613 2035
+3  1768 22 2036
+3  1880 614 2036
+3  1076 173 2037
+3  1021 614 2037
+3  1436 42 2038
+3  1528 615 2038
+3  900 173 2039
+3  1076 615 2039
+3  2048 5 2040
+3  2032 616 2040
+3  1152 174 2041
+3  1161 616 2041
+3  1512 43 2042
+3  1522 617 2042
+3  897 174 2043
+3  1152 617 2043
+3  1752 23 2044
+3  1888 618 2044
+3  1080 175 2045
+3  1013 618 2045
+3  1440 43 2046
+3  1512 619 2046
+3  892 175 2047
+3  1080 619 2047
+3  2056 5 2048
+3  2040 620 2048
+3  1156 176 2049
+3  1165 620 2049
+3  1516 44 2050
+3  1526 621 2050
+3  899 176 2051
+3  1156 621 2051
+3  1756 24 2052
+3  1896 622 2052
+3  1084 177 2053
+3  1015 622 2053
+3  1444 44 2054
+3  1516 623 2054
+3  894 177 2055
+3  1084 623 2055
+3  2064 5 2056
+3  2048 624 2056
+3  1160 178 2057
+3  1169 624 2057
+3  1520 45 2058
+3  1530 625 2058
+3  901 178 2059
+3  1160 625 2059
+3  1760 25 2060
+3  1904 626 2060
+3  1088 179 2061
+3  1017 626 2061
+3  1448 45 2062
+3  1520 627 2062
+3  896 179 2063
+3  1088 627 2063
+3  2032 5 2064
+3  2056 628 2064
+3  1164 180 2065
+3  1153 628 2065
+3  1524 46 2066
+3  1514 629 2066
+3  893 180 2067
+3  1164 629 2067
+3  1764 26 2068
+3  1872 630 2068
+3  1072 181 2069
+3  1019 630 2069
+3  1432 46 2070
+3  1524 631 2070
+3  898 181 2071
+3  1072 631 2071
+3  2128 8 2072
+3  2229 632 2072
+3  1308 182 2073
+3  1201 632 2073
+3  1668 47 2074
+3  1562 633 2074
+3  917 182 2075
+3  1308 633 2075
+3  1908 27 2076
+3  1804 634 2076
+3  1038 183 2077
+3  1091 634 2077
+3  1398 47 2078
+3  1668 635 2078
+3  970 183 2079
+3  1038 635 2079
+3  2208 3 2080
+3  2312 636 2080
+3  1292 184 2081
+3  1241 636 2081
+3  1652 48 2082
+3  1602 637 2082
+3  937 184 2083
+3  1292 637 2083
+3  1892 28 2084
+3  1844 638 2084
+3  1058 185 2085
+3  1083 638 2085
+3  1418 48 2086
+3  1652 639 2086
+3  962 185 2087
+3  1058 639 2087
+3  1261 724 2257
+3  1316 228 2257
+3  2165 724 2256
+3  2248 4 2256
+3  1042 723 2255
+3  948 227 2255
+3  1624 723 2254
+3  1402 69 2254
+3  1924 29 2092
+3  1948 642 2092
+3  1407 2093 523
+3  1099 642 2093
+3  1069 722 2253
+3  1042 227 2253
+3  1706 187 443
+3  1812 722 2252
+3  1864 20 2252
+3  1264 721 2251
+3  1332 188 2097
+3  1255 2097 1225
+3  1692 50 2098
+3  1586 645 2098
+3  929 188 2099
+3  1332 645 2099
+3  1932 30 2100
+3  1828 646 2100
+3  1050 189 2101
+3  1103 646 2101
+3  1410 50 2102
+3  1692 647 2102
+3  982 189 2103
+3  1050 647 2103
+3  921 226 2251
+3  1570 721 2250
+3  1624 69 2250
+3  1209 720 2249
+3  1264 226 2249
+3  2256 720 2248
+3  2144 4 2248
+3  1585 405 719
+3  1043 718 2245
+3  1006 225 2245
+3  1740 718 2244
+3  1812 20 2244
+3  1364 66 2230
+3  1344 709 2227
+3  939 220 2227
+3  1606 709 2226
+3  2184 2 2112
+3  2280 652 2112
+3  1276 192 2113
+3  1229 652 2113
+3  1636 52 2114
+3  1590 653 2114
+3  931 192 2115
+3  1276 653 2115
+3  1876 12 2116
+3  1728 654 2116
+3  1000 193 2117
+3  1075 654 2117
+3  1360 52 2118
+3  1636 655 2118
+3  954 193 2119
+3  1000 655 2119
+3  2272 8 2120
+3  2128 656 2120
+3  1200 194 2121
+3  1273 656 2121
+3  1560 53 2122
+3  1634 657 2122
+3  953 194 2123
+3  1200 657 2123
+3  1800 12 2124
+3  1876 658 2124
+3  1074 195 2125
+3  1037 658 2125
+3  1434 53 2126
+3  1560 659 2126
+3  916 195 2127
+3  1074 659 2127
+3  2120 8 2128
+3  2072 660 2128
+3  1172 196 2129
+3  1197 660 2129
+3  1532 54 2130
+3  1558 661 2130
+3  915 196 2131
+3  1172 661 2131
+3  1772 13 2132
+3  1712 662 2132
+3  992 197 2133
+3  1023 662 2133
+3  1352 54 2134
+3  1532 663 2134
+3  902 197 2135
+3  992 663 2135
+3  2165 4 2136
+3  2144 664 2136
+3  1208 198 2137
+3  1317 664 2137
+3  1568 55 2138
+3  1678 665 2138
+3  975 198 2139
+3  1208 665 2139
+3  1808 13 2140
+3  1772 666 2140
+3  1022 199 2141
+3  1041 666 2141
+3  1382 55 2142
+3  1568 667 2142
+3  920 199 2143
+3  1022 667 2143
+3  2136 4 2144
+3  2248 668 2144
+3  1260 200 2145
+3  1205 668 2145
+3  1620 56 2146
+3  1566 669 2146
+3  919 200 2147
+3  1260 669 2147
+3  1860 14 2148
+3  1716 670 2148
+3  994 201 2149
+3  1067 670 2149
+3  1354 56 2150
+3  1620 671 2150
+3  946 201 2151
+3  994 671 2151
+3  1705 66 2226
+3  1245 708 2225
+3  1344 220 2225
+3  1783 708 2224
+3  1704 1576 383
+3  1024 707 2223
+3  940 219 2223
+3  1608 707 2222
+3  1816 14 2156
+3  1860 674 2156
+3  1066 203 2157
+3  1045 674 2157
+3  1426 57 2158
+3  1576 675 2158
+3  1468 203 58
+3  1066 675 2159
+3  1384 65 2222
+3  1061 706 2221
+3  1024 219 2221
+3  1776 706 2220
+3  1848 18 2220
+3  1248 705 2219
+3  979 218 2219
+3  1686 705 2218
+3  1608 65 2218
+3  1325 704 2217
+3  1248 218 2217
+3  1573 704 1540
+3  1002 703 2215
+3  904 217 2215
+3  1536 703 2214
+3  1362 64 2214
+3  1025 702 2213
+3  1002 217 2213
+3  1732 702 2212
+3  1776 18 2212
+3  1176 701 2211
+3  935 216 2211
+3  1598 701 2210
+3  1536 64 2210
+3  1237 700 2209
+3  1176 216 2209
+3  2080 700 2208
+3  2200 3 2208
+3  1086 699 2207
+3  936 215 2207
+3  1600 699 2206
+3  1446 63 2206
+3  1057 698 2205
+3  1086 215 2205
+3  1900 698 2204
+3  1840 17 2204
+3  1544 60 2178
+3  1582 685 2178
+3  1240 697 2203
+3  965 214 2203
+3  1784 16 2180
+3  1724 686 2180
+3  998 209 2181
+3  1029 686 2181
+3  1358 60 2182
+3  1544 687 2182
+3  908 209 2183
+3  998 687 2183
+3  1822 2 2184
+3  2112 688 2184
+3  1192 210 2185
+3  1341 688 2185
+3  1552 61 2186
+3  1702 689 2186
+3  987 210 2187
+3  1192 689 2187
+3  1792 16 2188
+3  1784 690 2188
+3  1028 211 2189
+3  1033 690 2189
+3  1388 61 2190
+3  1552 691 2190
+3  912 211 2191
+3  1028 691 2191
+3  2264 9 2192
+3  2328 692 2192
+3  1300 212 2193
+3  1269 692 2193
+3  1660 62 2194
+3  1630 693 2194
+3  951 212 2195
+3  1300 693 2195
+3  1900 17 2196
+3  1748 694 2196
+3  1010 213 2197
+3  1087 694 2197
+3  1370 62 2198
+3  1660 695 2198
+3  966 213 2199
+3  1010 695 2199
+3  2320 3 2200
+3  2208 696 2200
+3  1240 214 2201
+3  1297 696 2201
+3  1600 63 2202
+3  1658 697 2202
+

From c85711d58fa84201d8728caf320d6eec0a9b1869 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 3 Nov 2023 09:50:25 +0100
Subject: [PATCH 0969/1398] test cleaning

---
 ...ing_polyhedral_complex_with_manifold_and_min_size.cpp | 9 +--------
 1 file changed, 1 insertion(+), 8 deletions(-)

diff --git a/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp b/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp
index 13f5973d2929..b68723d67e84 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp
@@ -1,5 +1,3 @@
-#define CGAL_MESH_3_VERBOSE 1
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <CGAL/Mesh_triangulation_3.h>
@@ -78,13 +76,8 @@ int main()
   // Mesh generation
   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria,
     params::no_perturb(), params::no_exude(),
-    params::manifold(),
-    params::mesh_3_dump());
+    params::manifold());
 
-  // Output
-  std::ofstream medit_file("out.mesh");
-  CGAL::IO::write_MEDIT(medit_file, c3t3);
-  medit_file.close();
 
   return EXIT_SUCCESS;
 }

From 3176178224785f0dd241ce9d4f78d06449d58cb2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Sun, 5 Nov 2023 22:52:44 -0800
Subject: [PATCH 0970/1398] fix compilation issues

---
 .../include/CGAL/Arr_tags.h                   | 44 ++++++++++---------
 .../Arr_traits_adaptor_2_dispatching.h        |  7 +--
 .../Arrangement_on_surface_2_global.h         | 12 ++---
 .../Surface_sweep_2/Arr_overlay_ss_visitor.h  | 18 ++++----
 .../test/Arrangement_on_surface_2/utils.h     |  4 +-
 .../CGAL/boost/graph/named_params_helper.h    |  6 +--
 BGL/include/CGAL/boost/graph/properties.h     |  2 +-
 .../Algebraic_structure_traits.h              |  2 +-
 .../CGAL/Concurrent_compact_container.h       |  2 +-
 STL_Extension/include/CGAL/Container_helper.h |  4 +-
 .../CGAL/Constrained_triangulation_2.h        |  7 +--
 11 files changed, 57 insertions(+), 51 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_tags.h b/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
index 1aac06155855..8ba336b1e192 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
@@ -252,7 +252,7 @@ template <typename ArrSideCategory>
 struct Arr_is_side_oblivious {
   typedef ArrSideCategory                                       Side_cat;
   typedef std::is_same<Side_cat, Arr_oblivious_side_tag>        Is_same;
-  typedef std::conditional<Is_same::value, Arr_true, Arr_false> result;
+  typedef std::bool_constant<Is_same::value>                    result;
   typedef typename result::type                                 type;
 };
 
@@ -260,7 +260,7 @@ template <typename ArrSideCategory>
 struct Arr_is_side_open {
   typedef ArrSideCategory                                       Side_cat;
   typedef std::is_same<Side_cat, Arr_open_side_tag>             Is_same;
-  typedef std::conditional<Is_same,::value Arr_true, Arr_false> result;
+  typedef std::bool_constant<Is_same::value>                    result;
   typedef typename result::type                                 type;
 };
 
@@ -268,7 +268,7 @@ template <typename ArrSideCategory>
 struct Arr_is_side_identified {
   typedef ArrSideCategory                                       Side_cat;
   typedef std::is_same<Side_cat, Arr_identified_side_tag>       Is_same;
-  typedef std::conditional<Is_same::value, Arr_true, Arr_false> result;
+  typedef std::bool_constant<Is_same::value>                    result;
   typedef typename result::type                                 type;
 };
 
@@ -276,7 +276,7 @@ template <typename ArrSideCategory>
 struct Arr_is_side_contracted {
   typedef ArrSideCategory                                       Side_cat;
   typedef std::is_same<Side_cat, Arr_contracted_side_tag>       Is_same;
-  typedef std::conditional<Is_same::value, Arr_true, Arr_false> result;
+  typedef std::bool_constant<Is_same::value>                    result;
   typedef typename result::type                                 type;
 };
 
@@ -284,7 +284,7 @@ template <typename ArrSideCategory>
 struct Arr_is_side_closed {
   typedef ArrSideCategory                                       Side_cat;
   typedef std::is_same<Side_cat, Arr_closed_side_tag>           Is_same;
-  typedef std::conditional<Is_same::value, Arr_true, Arr_false> result;
+  typedef std::bool_constant<Is_same::value>                    result;
   typedef typename result::type                                 type;
 };
 
@@ -423,11 +423,12 @@ struct Arr_sane_identified_tagging {
   typedef boost::mpl::or_<LR_ide, LR_not_ide>           LR_ok;
   typedef boost::mpl::or_<BT_ide, BT_not_ide>           BT_ok;
 
-  /*! Boolean tag that is bool_<true> if opposite sides are either
+  /*! Boolean tag that is bool_constant<true> if opposite sides are either
    * both identified or both not-identified,
-   * otherwise bool_<false>
+   * otherwise bool_constant<false>
    */
-  typedef boost::mpl::and_<LR_ok, BT_ok>                result;
+  typedef std::bool_constant<LR_ok::value &&
+                             BT_ok::value>              result;
   static constexpr bool value = result::value;
 };
 
@@ -447,10 +448,10 @@ struct Arr_has_identified_sides {
   typedef typename Arr_is_side_identified<Side_one_cat>::result Side_one_ide;
   typedef typename Arr_is_side_identified<Side_two_cat>::result Side_two_ide;
 
-  /*! Boolean tag that is bool_<true> if one side is identified,
-   * otherwise bool_<false>
+  /*! Boolean tag that is bool_constant<true> if one side is identified,
+   * otherwise bool_constant<false>
    */
-  typedef boost::mpl::or_<Side_one_ide, Side_two_ide>   result;
+  typedef std::bool_constant<Side_one_ide::value || Side_two_ide::value> result;
 };
 
 /*! Checks whether one of two boundary sides are contracted
@@ -463,10 +464,11 @@ struct Arr_has_contracted_sides_two {
   typedef typename Arr_is_side_contracted<Side_one_cat>::result Side_one_con;
   typedef typename Arr_is_side_contracted<Side_two_cat>::result Side_two_con;
 
-  /*!\ Boolean tag that is bool_<true> if one side is identified,
-   * otherwise bool_<false>
+  /*!\ Boolean tag that is bool_constant<true> if one side is identified,
+   * otherwise bool_constant<false>
    */
-  typedef boost::mpl::or_<Side_one_con, Side_two_con>           result;
+  typedef std::bool_constant<Side_one_con::value ||
+                             Side_two_con::value>               result;
 };
 
 /*! Checks whether one of two boundary sides are closed
@@ -479,10 +481,11 @@ struct Arr_has_closed_sides_two {
   typedef typename Arr_is_side_closed<Side_one_cat>::result     Side_one_clo;
   typedef typename Arr_is_side_closed<Side_two_cat>::result     Side_two_clo;
 
-  /*! Boolean tag that is bool_<true> if one side is identified,
-   * otherwise bool_<false>
+  /*! Boolean tag that is bool_constant<true> if one side is identified,
+   * otherwise bool_constant<false>
    */
-  typedef boost::mpl::or_<Side_one_clo, Side_two_clo>           result;
+  typedef std::bool_constant<Side_one_clo::value ||
+                             Side_two_clo::value>               result;
 };
 
 /*! Checks whether one of two boundary sides are open
@@ -495,10 +498,11 @@ struct Arr_has_open_sides_two {
   typedef typename Arr_is_side_open<Side_one_cat>::result       Side_one_ope;
   typedef typename Arr_is_side_open<Side_two_cat>::result       Side_two_ope;
 
-  /*! Boolean tag that is bool_<true> if one side is identified,
-   * otherwise bool_<false>
+  /*! Boolean tag that is bool_constant<true> if one side is identified,
+   * otherwise bool_constant<false>
    */
-  typedef boost::mpl::or_<Side_one_ope, Side_two_ope>           result;
+  typedef std::bool_constant<Side_one_ope::value ||
+                             Side_two_ope::value>               result;
 };
 
 /*! Categorizes two boundary sides:
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2_dispatching.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2_dispatching.h
index 283b2dc66b5c..9bcabf985d68 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2_dispatching.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2_dispatching.h
@@ -58,11 +58,11 @@ struct Or_traits {
 
 private:
 
-  typedef std::conditional<
+  typedef std::conditional_t<
        std::is_same_v< Arr_smaller_implementation_tag, Arr_use_traits_tag >,
        std::true_type, std::false_type > Smaller_traits;
 
-  typedef std::conditional_t_<
+  typedef std::conditional_t<
        std::is_same_v< Arr_larger_implementation_tag, Arr_use_traits_tag >,
        std::true_type, std::false_type > Larger_traits;
 
@@ -71,7 +71,8 @@ struct Or_traits {
   //! the result type (if one side asks for traits, then ask traits!
   //! Or vice versa: If both ask for dummy, then dummy!)
   typedef std::conditional_t<
-              Smaller_traits, Larger_traits >::value || Arr_use_traits_tag::value,
+              Smaller_traits::value || Larger_traits::value,
+              Arr_use_traits_tag,
               Arr_use_dummy_tag > type;
 
 };
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
index ee072c95778c..5bc8054c5254 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_global.h
@@ -64,7 +64,7 @@ namespace Ss2 = Surface_sweep_2;
 //
 // error: no matching function for call to `do_intersect(Arrangement_2<>&,
 // const Arr_segment_2&, const Arr_walk_along_line_point_location<>&,
-// mpl_::bool_< true>)'
+// std::bool_constant< true>)'
 //
 template <typename GeometryTraits_2, typename TopologyTraits,
           typename PointLocation, typename ZoneVisitor>
@@ -135,7 +135,7 @@ void insert(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 //
 // error: no matching function for call to `do_intersect(Arrangement_2<>&,
 // const Arr_segment_2&, const Arr_walk_along_line_point_location<>&,
-// mpl_::bool_< true>)'
+// std::bool_constant< true>)'
 //
 //
 template <typename GeometryTraits_2, typename TopologyTraits,
@@ -409,7 +409,7 @@ void insert_non_empty(Arrangement_on_surface_2<GeometryTraits_2,
 //
 // error: no matching function for call to `do_intersect(Arrangement_2<>&,
 // const Arr_segment_2&, const Arr_walk_along_line_point_location<>&,
-// mpl_::bool_< true>)'
+// std::bool_constant< true>)'
 //
 template <typename GeometryTraits_2, typename TopologyTraits,
           typename InputIterator>
@@ -463,7 +463,7 @@ void insert(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 //
 // error: no matching function for call to `do_intersect(Arrangement_2<>&,
 // const Arr_segment_2&, const Arr_walk_along_line_point_location<>&,
-// mpl_::bool_< true>)'
+// std::bool_constant< true>)'
 //
 template <typename GeometryTraits_2, typename TopologyTraits,
           typename InputIterator>
@@ -1524,7 +1524,7 @@ zone(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 // workaround since it didn't compile in FC3_g++-3.4.4 with the error of:
 //
 // error: no matching function for call to `do_intersect(Arrangement_on_surface_2<>&,
-// const Arr_segment_2&, const Arr_walk_along_line_point_location<>&, mpl_::bool_< true>)'
+// const Arr_segment_2&, const Arr_walk_along_line_point_location<>&, std::bool_constant< true>)'
 //
 template <typename GeometryTraits_2, typename TopologyTraits,
           typename PointLocation>
@@ -1562,7 +1562,7 @@ do_intersect(Arrangement_on_surface_2<GeometryTraits_2, TopologyTraits>& arr,
 //
 // error: no matching function for call to
 // `do_intersect(Arrangement_on_surface_2<>&,
-// const Arr_segment_2&, const Arr_walk_along_line_point_location<>&, mpl_::bool_< true>)'
+// const Arr_segment_2&, const Arr_walk_along_line_point_location<>&, std::bool_constant< true>)'
 //
 template <typename GeometryTraits_2, typename TopologyTraits,
           typename PointLocation>
diff --git a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
index 30c8b38b4a0d..06052a8f19d7 100644
--- a/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
+++ b/Arrangement_on_surface_2/include/CGAL/Surface_sweep_2/Arr_overlay_ss_visitor.h
@@ -295,7 +295,7 @@ class Arr_overlay_ss_visitor :
    * \param tag The tag used for dispatching.
    */
   void _map_boundary_vertices(Event* event, Vertex_handle v,
-                              boost::mpl::bool_<true> /* tag */);
+                              std::bool_constant<true> /* tag */);
 
   /*!
    * Update the boundary vertices map.
@@ -306,7 +306,7 @@ class Arr_overlay_ss_visitor :
    * \param tag The tag used for dispatching.
    */
   void _map_boundary_vertices(Event* event, Vertex_handle v,
-                              boost::mpl::bool_<false> /* tag */);
+                              std::bool_constant<false> /* tag */);
 
   /*!
    * Update a newly created vertex using the overlay traits.
@@ -319,7 +319,7 @@ class Arr_overlay_ss_visitor :
    * \param tag The tag used for dispatching.
    */
   void _create_vertex(Event* event, Vertex_handle res_v, Subcurve* sc,
-                      boost::mpl::bool_<true> /* tag */);
+                      std::bool_constant<true> /* tag */);
 
   /*!
    * Update a newly created vertex using the overlay traits.
@@ -331,7 +331,7 @@ class Arr_overlay_ss_visitor :
    * \param tag The tag used for dispatching.
    */
   void _create_vertex(Event* event, Vertex_handle res_v, Subcurve* sc,
-                      boost::mpl::bool_<false> /* tag */);
+                      std::bool_constant<false> /* tag */);
 
   /*!
    * Update a newly created edge using the overlay traits.
@@ -922,7 +922,7 @@ _map_halfedge_and_twin(Halfedge_handle he,
 //
 template <typename OvlHlpr, typename OvlTr, typename Vis>
 void Arr_overlay_ss_visitor<OvlHlpr, OvlTr, Vis>::
-_map_boundary_vertices(Event* event, Vertex_handle v, boost::mpl::bool_<true>)
+_map_boundary_vertices(Event* event, Vertex_handle v, std::bool_constant<true>)
 {
   // Update the red and blue object if the last event on sc is on the boundary.
   if ((event->parameter_space_in_x() != ARR_INTERIOR) ||
@@ -960,7 +960,7 @@ _map_boundary_vertices(Event* event, Vertex_handle v, boost::mpl::bool_<true>)
 template <typename OvlHlpr, typename OvlTr, typename Vis>
 void Arr_overlay_ss_visitor<OvlHlpr, OvlTr, Vis>::
 _map_boundary_vertices(Event* /* event */, Vertex_handle /* v */,
-                       boost::mpl::bool_<false>)
+                       std::bool_constant<false>)
 {}
 
 /* Notify the overlay traits about a newly created vertex.
@@ -974,7 +974,7 @@ void Arr_overlay_ss_visitor<OvlHlpr, OvlTr, Vis>::
 _create_vertex(Event* event,
                Vertex_handle new_v,
                Subcurve* sc,
-               boost::mpl::bool_<true>)
+               std::bool_constant<true>)
 {
   const Point_2& pt = event->point();
   const Cell_handle_red* red_handle = pt.red_cell_handle();
@@ -1011,7 +1011,7 @@ _create_vertex(Event* event,
     return;
   }
 
-  _create_vertex(event, new_v, sc, boost::mpl::bool_<false>());
+  _create_vertex(event, new_v, sc, std::bool_constant<false>());
 }
 
 /* Notify the overlay traits about a newly created vertex. */
@@ -1020,7 +1020,7 @@ void Arr_overlay_ss_visitor<OvlHlpr, OvlTr, Vis>::
 _create_vertex(Event* event,
                Vertex_handle new_v,
                Subcurve* sc,
-               boost::mpl::bool_<false>)
+               std::bool_constant<false>)
 {
   const Point_2& pt = event->point();
   const Cell_handle_red* red_handle = pt.red_cell_handle();
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/utils.h b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/utils.h
index f49b92f4c01c..f4975fb14283 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/utils.h
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/utils.h
@@ -55,13 +55,13 @@ class Point_compare {
   // This function is invoked for traits classes where at least one
   // boundary is not oblivious and all boundaries are not identified.
   bool operator()(const Point_2& p1, const Point_2& p2,
-                  boost::mpl::bool_<false>) const
+                  std::bool_constant<false>) const
   { return (m_traits.compare_xy_2_object()(p1, p2) == CGAL::SMALLER); }
 
   // This function should be invoked for traits classes where at least one
   // boundary is identified.
   bool operator()(const Point_2& p1, const Point_2& p2,
-                  boost::mpl::bool_<true>) const
+                  std::bool_constant<true>) const
   {
     // Compare in y boundaries:
     CGAL::Arr_parameter_space ps_y1 =
diff --git a/BGL/include/CGAL/boost/graph/named_params_helper.h b/BGL/include/CGAL/boost/graph/named_params_helper.h
index 4dce0049b1ab..7dd7edd08875 100644
--- a/BGL/include/CGAL/boost/graph/named_params_helper.h
+++ b/BGL/include/CGAL/boost/graph/named_params_helper.h
@@ -46,9 +46,9 @@ class property_map_selector
                              typename boost::property_map<PolygonMesh, PropertyTag>::type,
                              typename boost::cgal_no_property::type> type;
   typedef std::conditional_t<Has_internal_pmap::value,
-                                    typename boost::property_map<PolygonMesh, PropertyTag>::const_type,
-                                    typename boost::cgal_no_property::const_type
-                                    >::type const_type;
+                             typename boost::property_map<PolygonMesh, PropertyTag>::const_type,
+                             typename boost::cgal_no_property::const_type
+                             > const_type;
 
   type get_pmap(const PropertyTag& p, PolygonMesh& pmesh)
   {
diff --git a/BGL/include/CGAL/boost/graph/properties.h b/BGL/include/CGAL/boost/graph/properties.h
index 1fd71599ad10..e8ab8b8bc432 100644
--- a/BGL/include/CGAL/boost/graph/properties.h
+++ b/BGL/include/CGAL/boost/graph/properties.h
@@ -140,7 +140,7 @@ struct Point_accessor<Handle, ValueType, ConstReference, true>
   typedef ValueType                      value_type;
   typedef Handle                         key_type;
 
-  typedef std::conditional_t< std::is_reference<ConstReference>,
+  typedef std::conditional_t< std::is_reference_v<ConstReference>,
                               ValueType&,
                               ValueType > Reference;
 
diff --git a/Number_types/include/CGAL/Sqrt_extension/Algebraic_structure_traits.h b/Number_types/include/CGAL/Sqrt_extension/Algebraic_structure_traits.h
index b1500148b598..c2175bc9439e 100644
--- a/Number_types/include/CGAL/Sqrt_extension/Algebraic_structure_traits.h
+++ b/Number_types/include/CGAL/Sqrt_extension/Algebraic_structure_traits.h
@@ -206,7 +206,7 @@ class Algebraic_structure_traits< Sqrt_extension< COEFF_, ROOT_, ACDE_TAG,FP_TAG
     // Tag_true if COEFF and ROOT are exact
     typedef std::conditional_t<
        std::is_same_v<typename CGAL::Algebraic_structure_traits<ROOT_ >::Is_exact,::CGAL::Tag_true> &&
-       std::is_same<typename CGAL::Algebraic_structure_traits<COEFF_>::Is_exact,::CGAL::Tag_true>
+       std::is_same_v<typename CGAL::Algebraic_structure_traits<COEFF_>::Is_exact,::CGAL::Tag_true>
            ,::CGAL::Tag_true,::CGAL::Tag_false> Is_exact;
 
     typedef typename Algebraic_structure_traits<COEFF_>::Is_numerical_sensitive
diff --git a/STL_Extension/include/CGAL/Concurrent_compact_container.h b/STL_Extension/include/CGAL/Concurrent_compact_container.h
index e6a2a5dbecf1..7f5533f92b72 100644
--- a/STL_Extension/include/CGAL/Concurrent_compact_container.h
+++ b/STL_Extension/include/CGAL/Concurrent_compact_container.h
@@ -1,4 +1,4 @@
-3// Copyright (c) 2012  INRIA Sophia-Antipolis (France).
+// Copyright (c) 2012  INRIA Sophia-Antipolis (France).
 // All rights reserved.
 //
 // This file is part of CGAL (www.cgal.org)
diff --git a/STL_Extension/include/CGAL/Container_helper.h b/STL_Extension/include/CGAL/Container_helper.h
index aeb66ea052ba..9f5ac5a84cb2 100644
--- a/STL_Extension/include/CGAL/Container_helper.h
+++ b/STL_Extension/include/CGAL/Container_helper.h
@@ -50,8 +50,8 @@ void resize(Container& CGAL_assertion_code(array), std::size_t CGAL_assertion_co
 template <class Container>
 void resize(Container&, std::size_t,
             std::enable_if_t<
-              !boost::mpl::or_<has_resize<Container>,
-                               has_size<Container> >::value >* = nullptr)
+              !(has_resize<Container>::value ||
+                has_size<Container>::value)>* = nullptr)
 {
 }
 
diff --git a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
index 02b050f790ad..3cc571689711 100644
--- a/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_triangulation_2.h
@@ -95,9 +95,10 @@ namespace internal {
 
 template <typename K>
 struct Itag {
-  typedef std::conditional_t<(typename Algebraic_structure_traits<typename K::FT>::Is_exact)::value,
-                                   Exact_intersections_tag,
-                                   Exact_predicates_tag> type;
+  using Is_exact = typename Algebraic_structure_traits<typename K::FT>::Is_exact;
+  typedef std::conditional_t<Is_exact::value,
+                             Exact_intersections_tag,
+                             Exact_predicates_tag> type;
 };
 
 } // namespace internal

From 72b3016852b18d1001f6c75a00d185864c33f9a4 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 6 Nov 2023 21:48:18 +0000
Subject: [PATCH 0971/1398] Filtered_kernel: Add
 Power_side_of_oriented_power_circle_2.h

---
 .../Power_side_of_oriented_power_circle_2.h   | 335 ++++++++++++++++++
 .../internal/Static_filters/Static_filters.h  |   6 +
 2 files changed, 341 insertions(+)
 create mode 100644 Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h

diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h
new file mode 100644
index 000000000000..d3f224beb85d
--- /dev/null
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h
@@ -0,0 +1,335 @@
+// Copyright (c) 2023  INRIA Sophia-Antipolis (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Sebastien Loriot
+// This predicates was generated using the fpg tool written by Andreas Meyer.
+//
+
+#ifndef CGAL_INTERNAL_STATIC_FILTERS_POWER_TEST_2_H
+#define CGAL_INTERNAL_STATIC_FILTERS_POWER_TEST_2_H
+
+#include <CGAL/Profile_counter.h>
+#include <CGAL/Filtered_kernel/internal/Static_filters/Static_filter_error.h>
+#include <CGAL/Filtered_kernel/internal/Static_filters/tools.h>
+#include <cmath>
+
+
+namespace CGAL { namespace internal { namespace Static_filters_predicates {
+
+  template <typename K_base>
+  class Power_side_of_oriented_power_circle_2:
+    public K_base::Power_side_of_oriented_power_circle_2
+  {
+    typedef typename K_base::Weighted_point_2 Weighted_point_2;
+    typedef typename K_base::FT FT;
+    typedef typename K_base::Power_side_of_oriented_power_circle_2 Base;
+  public:
+    typedef typename Base::result_type result_type;
+
+    using Base::operator();
+
+    result_type operator() ( const Weighted_point_2 & p,
+                             const Weighted_point_2 & q,
+                             const Weighted_point_2 & r,
+                             const Weighted_point_2 & t) const
+    {
+      CGAL_BRANCH_PROFILER_3("semi-static failures/attempts/calls to   : Power_side_of_power_circle_2 with 3+1 wpoints", tmp);
+
+      double px, py, pwt, qx, qy, qwt, rx, ry, rwt, tx, ty, twt;
+      init_double(px, py, pwt, qx, qy, qwt, rx, ry, rwt, (FT*)(0));
+      init_double(tx, ty, twt, (FT*)(0));
+      if( fit_in_double(p.x(), px) && fit_in_double(p.y(), py)       &&
+          fit_in_double(p.weight(), pwt) &&
+          fit_in_double(q.x(), qx) && fit_in_double(q.y(), qy)       &&
+          fit_in_double(q.weight(), qwt) &&
+          fit_in_double(r.x(), rx) && fit_in_double(r.y(), ry)       &&
+          fit_in_double(r.weight(), rwt) &&
+          fit_in_double(t.x(), tx) && fit_in_double(t.y(), ty)       &&
+          fit_in_double(t.weight(), twt)
+          )
+        {
+          CGAL_BRANCH_PROFILER_BRANCH_1(tmp);
+          double dpx;
+          dpx = (px - tx);
+          double dpy;
+          dpy = (py - ty);
+          double dpz;
+          dpz = (((square( dpx ) + square( dpy )) - pwt) + twt);
+          double dqx;
+          dqx = (qx - tx);
+          double dqy;
+          dqy = (qy - ty);
+          double dqz;
+          dqz = (((square( dqx ) + square( dqy )) - qwt) + twt);
+          double drx;
+          drx = (rx - tx);
+          double dry;
+          dry = (ry - ty);
+          double drz;
+          drz = (((square( drx ) + square( dry )) - rwt) + twt);
+          result_type int_tmp_result;
+          double RT_tmp_result;
+          double eps;
+          RT_tmp_result = CGAL::determinant( dpx, dpy, dpz, dqx, dqy, dqz, drx, dry, drz );
+          double max1;
+          double max3 = CGAL::abs(dpy);
+          if( (max3 < CGAL::abs(dqy)) )
+            {
+              max3 = CGAL::abs(dqy);
+            }
+          if( (max3 < CGAL::abs(dry)) )
+            {
+              max3 = CGAL::abs(dry);
+            }
+          max1 = max3;
+          double max2 = CGAL::abs(dpx);
+          if( (max2 < CGAL::abs(dqx)) )
+            {
+              max2 = CGAL::abs(dqx);
+            }
+          if( (max2 < CGAL::abs(drx)) )
+            {
+              max2 = CGAL::abs(drx);
+            }
+          if( (max1 < max2) )
+            {
+              max1 = max2;
+            }
+          double max4 = CGAL::abs(pwt);
+          if( (max4 < CGAL::abs(qwt)) )
+            {
+              max4 = CGAL::abs(qwt);
+            }
+          if( (max4 < CGAL::abs(rwt)) )
+            {
+              max4 = CGAL::abs(rwt);
+            }
+          if( (max4 < CGAL::abs(twt)) )
+            {
+              max4 = CGAL::abs(twt);
+            }
+          double lower_bound_1;
+          double upper_bound_1;
+          lower_bound_1 = max3;
+          upper_bound_1 = max3;
+          if( (max1 < lower_bound_1) )
+            {
+              lower_bound_1 = max1;
+            }
+          else
+            {
+              if( (max1 > upper_bound_1) )
+                {
+                  upper_bound_1 = max1;
+                }
+            }
+          if( (max2 < lower_bound_1) )
+            {
+              lower_bound_1 = max2;
+            }
+          if( ((lower_bound_1 < 2.99168207048872973507e-74) || (max4 < 8.95016161088373414772e-148)) )
+            {
+              return  Base::operator()(p,q,r,t);
+            }
+          else
+            {
+              if( ((upper_bound_1 > 1.44740111546645180002e+76) || (max4 > 2.09496998905352916869e+152)) )
+                {
+                  return  Base::operator()(p,q,r,t);
+                }
+              eps = (2.77768297369183927919e-14 * ((max2 * max3) * (CGAL::max)( max4, (max1 * max1) )));
+              if( (RT_tmp_result > eps) )
+                {
+                  int_tmp_result = POSITIVE;
+                }
+              else
+                {
+                  if( (RT_tmp_result < -eps) )
+                    {
+                      int_tmp_result = NEGATIVE;
+                    }
+                  else
+                    {
+                      return Base::operator()(p,q,r,t);
+                    }
+                }
+            }
+          return int_tmp_result;
+
+        }
+      else
+        return Base::operator()(p,q,r,t);
+    }
+
+
+    result_type operator() ( const Weighted_point_2 & p,
+                             const Weighted_point_2 & q,
+                             const Weighted_point_2 & t) const
+    {
+
+      CGAL_BRANCH_PROFILER_3("semi-static failures/attempts/calls to   : Power_side_of_oriented_power_circle_2 with 2+1 wpoints", tmp);
+
+      double px, py, pwt, qx, qy, qwt, tx, ty, twt;
+      init_double(px, py, pwt, qx, qy, qwt, (FT*)(0));
+      init_double(  tx, ty, twt, (FT*)(0));
+      if( fit_in_double(p.x(), px) && fit_in_double(p.y(), py)       &&
+          fit_in_double(p.weight(), pwt) &&
+          fit_in_double(q.x(), qx) && fit_in_double(q.y(), qy)       &&
+          fit_in_double(q.weight(), qwt) &&
+          fit_in_double(t.x(), tx) && fit_in_double(t.y(), ty)       &&
+          fit_in_double(t.weight(), twt)
+          )
+        {
+          CGAL_BRANCH_PROFILER_BRANCH_1(tmp);
+          double dpx;
+          dpx = (px - tx);
+          double dpy;
+          dpy = (py - ty);
+          double dpz;
+          dpz = (((square( dpx ) + square( dpy )) - pwt) + twt);
+          double dqx;
+          dqx = (qx - tx);
+          double dqy;
+          dqy = (qy - ty);
+          double dqz;
+          dqz = (((square( dqx ) + square( dqy )) - qwt) + twt);
+          int cmpx;
+          cmpx = ((px > qx) ? 1 : ((px < qx) ? -1 : 0));
+          double eps;
+          double max1;
+          double max4 = CGAL::abs(dpy);
+          if( (max4 < CGAL::abs(dqy)) )
+            {
+              max4 = CGAL::abs(dqy);
+            }
+          max1 = max4;
+          double max2 = CGAL::abs(dpx);
+          if( (max2 < CGAL::abs(dqx)) )
+            {
+              max2 = CGAL::abs(dqx);
+            }
+          if( (max1 < max2) )
+            {
+              max1 = max2;
+            }
+          double max3 = CGAL::abs(pwt);
+          if( (max3 < CGAL::abs(qwt)) )
+            {
+              max3 = CGAL::abs(qwt);
+            }
+          if( (max3 < CGAL::abs(twt)) )
+            {
+              max3 = CGAL::abs(twt);
+            }
+          double lower_bound_1;
+          double upper_bound_1;
+          if( (cmpx != 0) )
+            {
+              result_type int_tmp_result;
+              double RT_tmp_result;
+              RT_tmp_result = CGAL::determinant( dpx, dpz, dqx, dqz );
+              lower_bound_1 = max2;
+              upper_bound_1 = max2;
+              if( (max1 < lower_bound_1) )
+                {
+                  lower_bound_1 = max1;
+                }
+              else
+                {
+                  if( (max1 > upper_bound_1) )
+                    {
+                      upper_bound_1 = max1;
+                    }
+                }
+              if( ((lower_bound_1 < 1.54785988882306922244e-98) || (max3 < 2.39587023542736329316e-196)) )
+                {
+                  return  Base::operator()(p,q,t);
+                }
+              else
+                {
+                  if( ((upper_bound_1 > 5.59936185544450866143e+101) || (max3 > 3.13528531882069741921e+203)) )
+                    {
+                      return  Base::operator()(p,q,t);
+                    }
+                  eps = (5.99997572250729588410e-15 * (max2 * (CGAL::max)( max3, (max1 * max1) )));
+                  if( (RT_tmp_result > eps) )
+                    {
+                      int_tmp_result = POSITIVE;
+                    }
+                  else
+                    {
+                      if( (RT_tmp_result < -eps) )
+                        {
+                          int_tmp_result = NEGATIVE;
+                        }
+                      else
+                        {
+                          return  Base::operator()(p,q,t);
+                        }
+                    }
+                }
+              return static_cast<result_type>(cmpx * int_tmp_result);
+            }
+          int cmpy;
+          cmpy = ((py > qy) ? 1 : ((py < qy) ? -1 : 0));
+          result_type int_tmp_result_FFWKCAA;
+          double RT_tmp_result_k60Ocge = CGAL::determinant( dpy, dpz, dqy, dqz );
+          lower_bound_1 = max4;
+          upper_bound_1 = max4;
+          if( (max1 < lower_bound_1) )
+            {
+              lower_bound_1 = max1;
+            }
+          else
+            {
+              if( (max1 > upper_bound_1) )
+                {
+                  upper_bound_1 = max1;
+                }
+            }
+          if( ((lower_bound_1 < 1.54785988882306922244e-98) || (max3 < 2.39587023542736329316e-196)) )
+            {
+              return  Base::operator()(p,q,t);
+            }
+          else
+            {
+              if( ((upper_bound_1 > 5.59936185544450866143e+101) || (max3 > 3.13528531882069741921e+203)) )
+                {
+                  return  Base::operator()(p,q,t);
+                }
+              eps = (5.99997572250729588410e-15 * (max4 * (CGAL::max)( max3, (max1 * max1) )));
+              if( (RT_tmp_result_k60Ocge > eps) )
+                {
+                  int_tmp_result_FFWKCAA = POSITIVE;
+                }
+              else
+                {
+                  if( (RT_tmp_result_k60Ocge < -eps) )
+                    {
+                      int_tmp_result_FFWKCAA = NEGATIVE;
+                    }
+                  else
+                    {
+                      return  Base::operator()(p,q,t);
+                    }
+                }
+            }
+          return static_cast<result_type>(cmpy * int_tmp_result_FFWKCAA);
+
+        }
+      else
+        return Base::operator()(p,q,t);
+    }
+
+
+      };
+
+    } } }//namespace CGAL::internal::Static_filters_predicates
+
+#endif //CGAL_INTERNAL_STATIC_FILTERS_POWER_TEST_2_H
diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Static_filters.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Static_filters.h
index 72f4d220c096..a927eb809581 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Static_filters.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Static_filters.h
@@ -70,6 +70,7 @@
 #include <CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_sphere_3.h>
 #include <CGAL/Filtered_kernel/internal/Static_filters/Compare_squared_radius_3.h>
 #include <CGAL/Filtered_kernel/internal/Static_filters/Compare_weighted_squared_radius_3.h>
+#include <CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h>
 #include <CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_sphere_3.h>
 #include <CGAL/Filtered_kernel/internal/Static_filters/Compare_distance_3.h>
 
@@ -124,6 +125,7 @@ class Static_filters : public K_base
   typedef Static_filters_predicates::Coplanar_3<K_base,Self>                Coplanar_3;
 
   typedef Static_filters_predicates::Compare_weighted_squared_radius_3<K_base>     Compare_weighted_squared_radius_3;
+  typedef Static_filters_predicates::Power_side_of_oriented_power_circle_2<K_base>                          Power_side_of_oriented_power_circle_2;
   typedef Static_filters_predicates::Power_side_of_oriented_power_sphere_3<K_base>                          Power_side_of_oriented_power_sphere_3;
 
   typedef Static_filters_predicates::Compare_distance_3<K_base>             Compare_distance_3;
@@ -189,6 +191,10 @@ class Static_filters : public K_base
   coplanar_3_object() const
   { return Coplanar_3(); }
 
+  Power_side_of_oriented_power_circle_2
+  power_side_of_oriented_power_circle_2_object() const
+  { return Power_side_of_oriented_power_circle_2();}
+
   Power_side_of_oriented_power_sphere_3
   power_side_of_oriented_power_sphere_3_object() const
   { return Power_side_of_oriented_power_sphere_3();}

From 25233e8f67f84d4d21df2ba7ce4e85612b14b611 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 7 Nov 2023 09:15:18 +0100
Subject: [PATCH 0972/1398] undo bad change

---
 Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h b/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h
index b1ee5e650654..bfb4b4e87166 100644
--- a/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h
+++ b/Periodic_3_mesh_3/include/CGAL/Periodic_3_function_wrapper.h
@@ -47,7 +47,7 @@ class Periodic_3_function_wrapper
 private:
   typedef std::conditional_t<std::is_function_v<Function_>,
                              Function_*,
-                             Function_>:                       Stored_function;
+                             Function_>                       Stored_function;
 
   /// Function to wrap
   Stored_function f_;

From 2c9a74fb9b651ed19588de5813ce312abd9cfd59 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 8 Nov 2023 07:47:02 +0000
Subject: [PATCH 0973/1398] Add branch profilers

---
 .../Power_side_of_oriented_power_circle_2.h   | 54 +++++++++----------
 1 file changed, 24 insertions(+), 30 deletions(-)

diff --git a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h
index d3f224beb85d..f9097923babc 100644
--- a/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h
+++ b/Filtered_kernel/include/CGAL/Filtered_kernel/internal/Static_filters/Power_side_of_oriented_power_circle_2.h
@@ -55,24 +55,15 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
           )
         {
           CGAL_BRANCH_PROFILER_BRANCH_1(tmp);
-          double dpx;
-          dpx = (px - tx);
-          double dpy;
-          dpy = (py - ty);
-          double dpz;
-          dpz = (((square( dpx ) + square( dpy )) - pwt) + twt);
-          double dqx;
-          dqx = (qx - tx);
-          double dqy;
-          dqy = (qy - ty);
-          double dqz;
-          dqz = (((square( dqx ) + square( dqy )) - qwt) + twt);
-          double drx;
-          drx = (rx - tx);
-          double dry;
-          dry = (ry - ty);
-          double drz;
-          drz = (((square( drx ) + square( dry )) - rwt) + twt);
+          double dpx = (px - tx);
+          double dpy = (py - ty);
+          double dpz = (((square( dpx ) + square( dpy )) - pwt) + twt);
+          double dqx = (qx - tx);
+          double dqy = (qy - ty);
+          double dqz = (((square( dqx ) + square( dqy )) - qwt) + twt);
+          double drx = (rx - tx);
+          double dry = (ry - ty);
+          double drz = (((square( drx ) + square( dry )) - rwt) + twt);
           result_type int_tmp_result;
           double RT_tmp_result;
           double eps;
@@ -135,12 +126,14 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
             }
           if( ((lower_bound_1 < 2.99168207048872973507e-74) || (max4 < 8.95016161088373414772e-148)) )
             {
+              CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
               return  Base::operator()(p,q,r,t);
             }
           else
             {
               if( ((upper_bound_1 > 1.44740111546645180002e+76) || (max4 > 2.09496998905352916869e+152)) )
                 {
+                  CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
                   return  Base::operator()(p,q,r,t);
                 }
               eps = (2.77768297369183927919e-14 * ((max2 * max3) * (CGAL::max)( max4, (max1 * max1) )));
@@ -156,6 +149,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
                     }
                   else
                     {
+                      CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
                       return Base::operator()(p,q,r,t);
                     }
                 }
@@ -187,18 +181,12 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
           )
         {
           CGAL_BRANCH_PROFILER_BRANCH_1(tmp);
-          double dpx;
-          dpx = (px - tx);
-          double dpy;
-          dpy = (py - ty);
-          double dpz;
-          dpz = (((square( dpx ) + square( dpy )) - pwt) + twt);
-          double dqx;
-          dqx = (qx - tx);
-          double dqy;
-          dqy = (qy - ty);
-          double dqz;
-          dqz = (((square( dqx ) + square( dqy )) - qwt) + twt);
+          double dpx = (px - tx);
+          double dpy = (py - ty);
+          double dpz = (((square( dpx ) + square( dpy )) - pwt) + twt);
+          double dqx = (qx - tx);
+          double dqy = (qy - ty);
+          double dqz = (((square( dqx ) + square( dqy )) - qwt) + twt);
           int cmpx;
           cmpx = ((px > qx) ? 1 : ((px < qx) ? -1 : 0));
           double eps;
@@ -249,12 +237,14 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
                 }
               if( ((lower_bound_1 < 1.54785988882306922244e-98) || (max3 < 2.39587023542736329316e-196)) )
                 {
+                  CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
                   return  Base::operator()(p,q,t);
                 }
               else
                 {
                   if( ((upper_bound_1 > 5.59936185544450866143e+101) || (max3 > 3.13528531882069741921e+203)) )
                     {
+                      CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
                       return  Base::operator()(p,q,t);
                     }
                   eps = (5.99997572250729588410e-15 * (max2 * (CGAL::max)( max3, (max1 * max1) )));
@@ -270,6 +260,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
                         }
                       else
                         {
+                          CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
                           return  Base::operator()(p,q,t);
                         }
                     }
@@ -295,12 +286,14 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
             }
           if( ((lower_bound_1 < 1.54785988882306922244e-98) || (max3 < 2.39587023542736329316e-196)) )
             {
+              CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
               return  Base::operator()(p,q,t);
             }
           else
             {
               if( ((upper_bound_1 > 5.59936185544450866143e+101) || (max3 > 3.13528531882069741921e+203)) )
                 {
+                  CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
                   return  Base::operator()(p,q,t);
                 }
               eps = (5.99997572250729588410e-15 * (max4 * (CGAL::max)( max3, (max1 * max1) )));
@@ -316,6 +309,7 @@ namespace CGAL { namespace internal { namespace Static_filters_predicates {
                     }
                   else
                     {
+                      CGAL_BRANCH_PROFILER_BRANCH_2(tmp);
                       return  Base::operator()(p,q,t);
                     }
                 }

From 8c9f391d879f46369be842dda6fbe040be42ab7c Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Thu, 9 Nov 2023 12:46:06 +0100
Subject: [PATCH 0974/1398] Defining a new resource directory to be used with
 doxygen master 1.10.0

Adding the possibilities for the new setting `` so the CGAL setting don't interfere with the settings of other packages.
---
 Documentation/doc/resources/1.10.0/BaseDoxyfile.in | 9 +++++++++
 1 file changed, 9 insertions(+)

diff --git a/Documentation/doc/resources/1.10.0/BaseDoxyfile.in b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
index 7322b03d12e0..e167e47a0406 100644
--- a/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
@@ -486,6 +486,15 @@ HTML_HEADER            = ${CGAL_DOC_HEADER_PACKAGE}
 
 HTML_FOOTER            = ${CGAL_DOC_RESOURCE_DIR}/footer.html
 
+# Doxygen stores a couple of settings persistently in the browser (via e.g.
+# cookies). By default these settings apply to all HTML pages generated by
+# doxygen across all projects. The HTML_PROJECT_COOKIE tag can be used to store
+# the settings under a project specific key, such that the user preferences will
+# be stored separately.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_PROJECT_COOKIE    = CGAL
+
 # If you want full control over the layout of the generated HTML pages it might
 # be necessary to disable the index and replace it with your own. The
 # DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top

From a850c344609a4c487d3972ba12e0a8a54849995a Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Thu, 9 Nov 2023 15:06:23 +0200
Subject: [PATCH 0975/1398] Fixed Are_mergable_2 functor; add code that tests
 whether the equal operator (operator==) is applicable to the data that
 extends the curve

---
 .../include/CGAL/Arr_curve_data_traits_2.h    | 36 ++++++++++---------
 1 file changed, 20 insertions(+), 16 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
index d0a68b2885ba..810da81aa6f6 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
@@ -247,27 +247,32 @@ class Arr_curve_data_traits_2 : public Traits_ {
   private:
     const Base_traits_2& m_base;
 
-    /*! Generate a helper class template to find out whether the base geometry
-     * traits has a nested type named Are_mergeable_2.
-     */
-    BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(has_are_mergeable_2,
-                                      Are_mergeable_2, false)
+    template <typename T>
+    bool are_mergeable_data(const T& cv1, const T& cv2, long) const {
+      CGAL_error_msg("Equality operator is not supported.");
+      return false;
+    }
+
+    template <typename T>
+    auto are_mergeable_data(const T& cv1, const T& cv2, int) const ->
+      decltype(cv1.data() == cv2.data())
+    { return cv1.data() == cv2.data(); }
 
     /*! Implementation of the predicate in case the base geometry traits class
      * has a nested type named Are_mergeable_2.
      */
     template <typename GeomeTraits_2>
-    std::enable_if_t<has_are_mergeable_2<GeomeTraits_2>::value,bool>
-    are_mergeable(const X_monotone_curve_2& cv1,
-                  const X_monotone_curve_2& cv2) const
-    {
+    auto are_mergeable(const X_monotone_curve_2& cv1,
+                       const X_monotone_curve_2& cv2,
+                       const GeomeTraits_2& traits, int) const ->
+    decltype(traits.are_mergeable_2_object(), bool()) {
       // In case the two base curves are not mergeable, the extended curves
       // are not mergeable as well.
-      if (! (m_base.are_mergeable_2_object()(cv1, cv2))) return false;
+      if (! (traits.are_mergeable_2_object()(cv1, cv2))) return false;
 
       // In case the two base curves are mergeable, check that they have the
       // same data fields.
-      return (cv1.data() == cv2.data());
+      return are_mergeable_data(cv1, cv2, 0);
     }
 
     /*! Implementation of the predicate in case the base geometry traits class
@@ -275,10 +280,9 @@ class Arr_curve_data_traits_2 : public Traits_ {
      * This function should never be called!
      */
     template <typename GeomeTraits_2>
-    std::enable_if_t<!has_are_mergeable_2<GeomeTraits_2>::value,bool>
-    are_mergeable(const X_monotone_curve_2& /* cv1 */,
-                  const X_monotone_curve_2& /* cv2 */) const
-    {
+    bool are_mergeable(const X_monotone_curve_2& /* cv1 */,
+                       const X_monotone_curve_2& /* cv2 */,
+                       const GeomeTraits_2& /* traits */, long) const {
       CGAL_error_msg("Are mergeable is not supported.");
       return false;
     }
@@ -294,7 +298,7 @@ class Arr_curve_data_traits_2 : public Traits_ {
      */
     bool operator()(const X_monotone_curve_2& cv1,
                     const X_monotone_curve_2& cv2) const
-    { return are_mergeable<Base_traits_2>(cv1, cv2); }
+    { return are_mergeable<Base_traits_2>(cv1, cv2, m_base, 0); }
   };
 
   /*! Obtain an Are_mergeable_2 functor object. */

From d9dcc9c2ed0c4e4a23ce32f944bc1f963bfd44a3 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 9 Nov 2023 18:47:19 +0100
Subject: [PATCH 0976/1398] fix the compilation of doc

- Use `-j$(nproc)` or `-j` (!!!)
- Handle errors when a Doxygen run fails.
---
 Documentation/doc/scripts/process_doc.sh | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Documentation/doc/scripts/process_doc.sh b/Documentation/doc/scripts/process_doc.sh
index 14db7216f36b..3486ada48f5e 100644
--- a/Documentation/doc/scripts/process_doc.sh
+++ b/Documentation/doc/scripts/process_doc.sh
@@ -20,7 +20,9 @@ DOXYGEN_2=$($PATH_TO_1_9_6 --version)
 
 DO_COMPARE=TRUE
 PATH_TO_SCRIPTS=${PWD}
+NB_CORES="$(nproc)"
 
+set +e
 #######################################
 ## download and build doxygen_master ##
  #######################################

From d6638db44fa4ef3168174dcae8866ad8b0e8642e Mon Sep 17 00:00:00 2001
From: puneetmatharu <puneet.matharu@hotmail.co.uk>
Date: Fri, 10 Nov 2023 10:50:10 +0000
Subject: [PATCH 0977/1398] Update CMakeLists.txt

Set the default value of CGAL_ENABLE_TESTING to BUILD_TESTING to allow users to continue enabling tests by just specifying BUILD_TESTING.
---
 CMakeLists.txt | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index d6c175594acc..66462bfe96ea 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -46,8 +46,10 @@ option(
 
 message("== CMake setup (DONE) ==\n")
 
-# Enable testing with CGAL_ENABLE_TESTING
-option(CGAL_ENABLE_TESTING "Build the testing tree." OFF)
+# Enable testing with CGAL_ENABLE_TESTING. Historically, users would enable the tests
+# by specifying BUILD_TESTING so if CGAL_ENABLE_TESTING is not enabled, we will set it
+# to the value of BUILD_TESTING
+option(CGAL_ENABLE_TESTING "Build the testing tree." ${BUILD_TESTING})
 if(CGAL_ENABLE_TESTING AND NOT POLICY CMP0064)
   message(
     FATAL_ERROR "CGAL support of CTest requires CMake version 3.4 or later.

From a8b8102567e405f9ad5b4a522baf9633819fc6cc Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 10 Nov 2023 13:17:46 +0100
Subject: [PATCH 0978/1398] CGAL_ENABLE_TESTING has three definitions

`CGAL_ENABLE_TESTING` is defined three times:
- once in `/CMakeLists.txt` that is the root of the CMake tree for a Git layout
- once in `Installation/CMakeLists.txt` that is the root of the CMake
  for a release tarball,
- and once in `CGAL_add_test.cmake`, for consumers of `CGALConfig.cmake`.

Two changes:
- Add the default value `${BUILD_TESTING}` to all three definitions
- Modify the comment
---
 CMakeLists.txt                                 | 7 ++++---
 Installation/CMakeLists.txt                    | 7 +++++--
 Installation/cmake/modules/CGAL_add_test.cmake | 6 +++++-
 3 files changed, 14 insertions(+), 6 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 66462bfe96ea..c7f9ace726f7 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -46,9 +46,10 @@ option(
 
 message("== CMake setup (DONE) ==\n")
 
-# Enable testing with CGAL_ENABLE_TESTING. Historically, users would enable the tests
-# by specifying BUILD_TESTING so if CGAL_ENABLE_TESTING is not enabled, we will set it
-# to the value of BUILD_TESTING
+# Enable testing with CGAL_ENABLE_TESTING. Before CGAL-6.0, users would enable
+# the tests by specifying BUILD_TESTING. For compatibility, If BUILD_TESTING is
+# set, that is the default value for CGAL_ENABLE_TESTING. Otherwise, the default
+# value is OFF.
 option(CGAL_ENABLE_TESTING "Build the testing tree." ${BUILD_TESTING})
 if(CGAL_ENABLE_TESTING AND NOT POLICY CMP0064)
   message(
diff --git a/Installation/CMakeLists.txt b/Installation/CMakeLists.txt
index 5fea17ecb9ac..6f49a308bd11 100644
--- a/Installation/CMakeLists.txt
+++ b/Installation/CMakeLists.txt
@@ -105,8 +105,11 @@ else(CGAL_BRANCH_BUILD)
       "${CGAL_SOURCE_DIR}"
       CACHE INTERNAL "Directory containing the GraphicsView package")
 
-  # Enable testing with CGAL_ENABLE_TESTING
-  option(CGAL_ENABLE_TESTING "Build the testing tree." OFF)
+# Enable testing with CGAL_ENABLE_TESTING. Before CGAL-6.0, users would enable
+# the tests by specifying BUILD_TESTING. For compatibility, If BUILD_TESTING is
+# set, that is the default value for CGAL_ENABLE_TESTING. Otherwise, the default
+# value is OFF.
+option(CGAL_ENABLE_TESTING "Build the testing tree." ${BUILD_TESTING})
   if(CGAL_ENABLE_TESTING)
     enable_testing()
   endif()
diff --git a/Installation/cmake/modules/CGAL_add_test.cmake b/Installation/cmake/modules/CGAL_add_test.cmake
index 1f2d35ade0c7..8304207ec83c 100644
--- a/Installation/cmake/modules/CGAL_add_test.cmake
+++ b/Installation/cmake/modules/CGAL_add_test.cmake
@@ -3,7 +3,11 @@ if(CGAL_add_test_included)
 endif(CGAL_add_test_included)
 set(CGAL_add_test_included TRUE)
 
-option(CGAL_ENABLE_TESTING "Build the testing tree." OFF)
+# Enable testing with CGAL_ENABLE_TESTING. Before CGAL-6.0, users would enable
+# the tests by specifying BUILD_TESTING. For compatibility, If BUILD_TESTING is
+# set, that is the default value for CGAL_ENABLE_TESTING. Otherwise, the default
+# value is OFF.
+option(CGAL_ENABLE_TESTING "Build the testing tree." ${BUILD_TESTING})
 
 if(CGAL_ENABLE_TESTING)
   enable_testing()

From 2277013d8479336f114a3d5fdc859d427d6e4324 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 10 Nov 2023 16:06:03 +0100
Subject: [PATCH 0979/1398] replace boost::mpl::and_

---
 .../internal/Is_ray_intersection_geomtraits.h | 10 +++---
 .../include/CGAL/Arr_tags.h                   | 34 +++++++++----------
 .../include/CGAL/Homogeneous/PointH2.h        |  4 +--
 .../include/CGAL/Homogeneous/PointH3.h        |  6 ++--
 .../include/CGAL/Homogeneous/VectorH2.h       |  4 +--
 .../include/CGAL/Homogeneous/VectorH3.h       |  6 ++--
 .../CGAL/NewKernel_d/Cartesian_filter_K.h     |  8 ++---
 .../include/CGAL/NewKernel_d/Lazy_cartesian.h |  6 ++--
 .../include/CGAL/NewKernel_d/functor_tags.h   | 12 +++----
 Number_types/include/CGAL/Lazy_exact_nt.h     |  6 ++--
 .../CGAL/Sqrt_extension/Sqrt_extension_type.h |  8 ++---
 .../Periodic_2_Delaunay_triangulation_2.h     |  7 ++--
 STL_Extension/include/CGAL/Container_helper.h |  6 ++--
 .../include/CGAL/type_traits/is_iterator.h    | 15 ++++----
 Stream_support/include/CGAL/IO/helpers.h      | 10 +++---
 .../Constrained_Delaunay_triangulation_2.h    |  6 ++--
 .../include/CGAL/Delaunay_triangulation_2.h   |  6 ++--
 .../include/CGAL/Regular_triangulation_2.h    |  6 ++--
 .../include/CGAL/Triangulation_2.h            |  6 ++--
 .../include/CGAL/Delaunay_triangulation_3.h   |  6 ++--
 .../include/CGAL/Regular_triangulation_3.h    |  7 ++--
 .../include/CGAL/Triangulation_3.h            |  6 ++--
 .../include/CGAL/Triangulation_hierarchy_3.h  |  6 ++--
 23 files changed, 85 insertions(+), 106 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_tree/internal/Is_ray_intersection_geomtraits.h b/AABB_tree/include/CGAL/AABB_tree/internal/Is_ray_intersection_geomtraits.h
index e662b13be90c..3d02204b9d03 100644
--- a/AABB_tree/include/CGAL/AABB_tree/internal/Is_ray_intersection_geomtraits.h
+++ b/AABB_tree/include/CGAL/AABB_tree/internal/Is_ray_intersection_geomtraits.h
@@ -32,11 +32,11 @@ BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(Has_cartesian_const_iterator_3,Cartesian_const
 
 template<typename GeomTraits>
 struct Is_ray_intersection_geomtraits
-: boost::mpl::and_< Has_ray_3<GeomTraits>,
-                    Has_construct_source_3<GeomTraits>,
-                    Has_vector_3<GeomTraits>,
-                    Has_construct_cartesian_const_iterator_3<GeomTraits>,
-                    Has_cartesian_const_iterator_3<GeomTraits> >::type
+: std::bool_constant< Has_ray_3<GeomTraits>::value &&
+                      Has_construct_source_3<GeomTraits>::value &&
+                      Has_vector_3<GeomTraits>::value &&
+                      Has_construct_cartesian_const_iterator_3<GeomTraits>::value &&
+                      Has_cartesian_const_iterator_3<GeomTraits>::value >
 {};
 
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_tags.h b/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
index 8ba336b1e192..94ea503e244b 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
@@ -272,6 +272,10 @@ struct Arr_is_side_identified {
   typedef typename result::type                                 type;
 };
 
+template <typename ArrSideCategory>
+inline constexpr bool Arr_is_side_identified_v =
+  Arr_is_side_identified<ArrSideCategory>::type::value;
+
 template <typename ArrSideCategory>
 struct Arr_is_side_contracted {
   typedef ArrSideCategory                                       Side_cat;
@@ -403,33 +407,27 @@ struct Arr_sane_identified_tagging {
   typedef ArrBottomSideCategory                         Bot_side_cat;
   typedef ArrTopSideCategory                            Top_side_cat;
 
-  typedef typename Arr_is_side_identified<Lef_side_cat>::result Lef_ide;
-  typedef typename Arr_is_side_identified<Rig_side_cat>::result Rig_ide;
-  typedef typename Arr_is_side_identified<Bot_side_cat>::result Bot_ide;
-  typedef typename Arr_is_side_identified<Top_side_cat>::result Top_ide;
-
-  typedef boost::mpl::and_<Lef_ide, Rig_ide>            LR_ide;
-  typedef boost::mpl::and_<Bot_ide, Top_ide>            BT_ide;
+  static inline constexpr bool lef_ide = Arr_is_side_identified_v<Lef_side_cat>;
+  static inline constexpr bool rig_ide = Arr_is_side_identified_v<Rig_side_cat>;
+  static inline constexpr bool bot_ide = Arr_is_side_identified_v<Bot_side_cat>;
+  static inline constexpr bool top_ide = Arr_is_side_identified_v<Top_side_cat>;
 
-  typedef boost::mpl::not_<Lef_ide>                     Lef_not_ide;
-  typedef boost::mpl::not_<Rig_ide>                     Rig_not_ide;
-  typedef boost::mpl::not_<Bot_ide>                     Bot_not_ide;
-  typedef boost::mpl::not_<Top_ide>                     Top_not_ide;
+  static inline constexpr bool lr_ide = lef_ide && rig_ide;
+  static inline constexpr bool bt_ide = bot_ide && top_ide;
 
-  typedef boost::mpl::and_<Lef_not_ide, Rig_not_ide>    LR_not_ide;
+  static inline constexpr bool lr_not_ide = !lef_ide && !rig_ide;
 
-  typedef boost::mpl::and_<Bot_not_ide, Top_not_ide>    BT_not_ide;
+  static inline constexpr bool bt_not_ide = !bot_ide && !top_ide;
 
-  typedef boost::mpl::or_<LR_ide, LR_not_ide>           LR_ok;
-  typedef boost::mpl::or_<BT_ide, BT_not_ide>           BT_ok;
+  static inline constexpr bool lr_ok = lr_ide || lr_not_ide;
+  static inline constexpr bool bt_ok = bt_ide || bt_not_ide;
 
   /*! Boolean tag that is bool_constant<true> if opposite sides are either
    * both identified or both not-identified,
    * otherwise bool_constant<false>
    */
-  typedef std::bool_constant<LR_ok::value &&
-                             BT_ok::value>              result;
-  static constexpr bool value = result::value;
+  typedef std::bool_constant<lr_ok && bt_ok>              result;
+  static inline constexpr bool value = result::value;
 };
 
 /*! Checks whether one of two boundary sides are identified
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h
index afb6bff830e9..06ff55945fe6 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH2.h
@@ -53,8 +53,8 @@ class PointH2
 
     template < typename Tx, typename Ty >
     PointH2(const Tx & x, const Ty & y,
-            std::enable_if_t< boost::mpl::and_<std::is_convertible<Tx, RT>,
-                                               std::is_convertible<Ty, RT> >::value >* = 0)
+            std::enable_if_t< std::is_convertible_v<Tx, RT> &&
+                              std::is_convertible_v<Ty, RT> >* = 0)
       : base(x, y) {}
 
     PointH2(const FT& x, const FT& y)
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h
index 87da02cabff1..f64d5b64c9a2 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/PointH3.h
@@ -52,9 +52,9 @@ class PointH3
 
   template < typename Tx, typename Ty, typename Tz >
   PointH3(const Tx & x, const Ty & y, const Tz & z,
-          std::enable_if_t< boost::mpl::and_< boost::mpl::and_< std::is_convertible<Tx, RT>,
-                                                                         std::is_convertible<Ty, RT> >,
-                                                       std::is_convertible<Tz, RT> >::value >* = 0)
+          std::enable_if_t<std::is_convertible_v<Tx, RT> &&
+                           std::is_convertible_v<Ty, RT> &&
+                           std::is_convertible_v<Tz, RT>>* = 0)
     : base(x, y, z) {}
 
   PointH3(const FT& x, const FT& y, const FT& z)
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
index 81cd31075952..92afeec79414 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH2.h
@@ -57,8 +57,8 @@ class VectorH2
 
    template < typename Tx, typename Ty >
    VectorH2(const Tx & x, const Ty & y,
-            std::enable_if_t< boost::mpl::and_<std::is_convertible<Tx, RT>,
-                                                        std::is_convertible<Ty, RT> >::value >* = 0)
+            std::enable_if_t<std::is_convertible_v<Tx, RT> &&
+                             std::is_convertible_v<Ty, RT>>* = 0)
       : base(CGAL::make_array<RT>(x, y, RT(1))) {}
 
    VectorH2(const FT& x, const FT& y)
diff --git a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
index 5228d5251ade..aecd718d41aa 100644
--- a/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
+++ b/Homogeneous_kernel/include/CGAL/Homogeneous/VectorH3.h
@@ -67,9 +67,9 @@ class VectorH3
 
   template < typename Tx, typename Ty, typename Tz >
   VectorH3(const Tx & x, const Ty & y, const Tz & z,
-           std::enable_if_t< boost::mpl::and_< boost::mpl::and_< std::is_convertible<Tx, RT>,
-                                                                          std::is_convertible<Ty, RT> >,
-                                                        std::is_convertible<Tz, RT> >::value >* = 0)
+           std::enable_if_t< std::is_convertible_v<Tx, RT> &&
+                             std::is_convertible_v<Ty, RT> &&
+                             std::is_convertible_v<Tz, RT>>* = 0)
     : base(CGAL::make_array<RT>(x, y, z, RT(1))) {}
 
   VectorH3(const FT& x, const FT& y, const FT& z)
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_filter_K.h b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_filter_K.h
index 25ec0c4f25c4..ef44403f9f51 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_filter_K.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_filter_K.h
@@ -64,10 +64,10 @@ struct Cartesian_filter_K : public Base_
     EK_rt exact_kernel()const{return sek.kernel();}
 
     // MSVC is too dumb to perform the empty base optimization.
-    typedef boost::mpl::and_<
-      internal::Do_not_store_kernel<Kernel_base>,
-      internal::Do_not_store_kernel<AK>,
-      internal::Do_not_store_kernel<EK> > Do_not_store_kernel;
+    typedef std::bool_constant<
+      internal::Do_not_store_kernel<Kernel_base>::value &&
+      internal::Do_not_store_kernel<AK>::value &&
+      internal::Do_not_store_kernel<EK>::value > Do_not_store_kernel;
 
     //TODO: C2A/C2E could be able to convert *this into this->kernel() or this->kernel2().
     typedef KernelD_converter<Kernel_base,AK> C2A;
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h b/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h
index 6e6b496840e1..67ea76e11fb5 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Lazy_cartesian.h
@@ -260,9 +260,9 @@ struct Lazy_cartesian :
     void set_dimension(int dim){ak.set_dimension(dim);ek.set_dimension(dim);}
 
     // For compilers that do not handle [[no_unique_address]]
-    typedef boost::mpl::and_<
-      internal::Do_not_store_kernel<AK_>,
-      internal::Do_not_store_kernel<EK_> > Do_not_store_kernel;
+    typedef std::bool_constant<
+      internal::Do_not_store_kernel<AK_>::value &&
+      internal::Do_not_store_kernel<EK_>::value > Do_not_store_kernel;
 
     typedef typename EK_::Dimension Dimension; // ?
     typedef Lazy_cartesian Self;
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h b/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h
index 4eb0e8900631..b32308585738 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/functor_tags.h
@@ -64,16 +64,16 @@ namespace CGAL {
           : Has_type_different_from<Get_functor<Kernel, Tg, O>, Null_functor> {};
 
         template<class K, class List, bool=boost::mpl::empty<List>::type::value>
-        struct Provides_functors : boost::mpl::and_ <
-                                   Provides_functor<K, typename boost::mpl::front<List>::type>,
-                                   Provides_functors<K, typename boost::mpl::pop_front<List>::type> > {};
+        struct Provides_functors : std::bool_constant<
+                                   Provides_functor<K, typename boost::mpl::front<List>::type>::value &&
+                                   Provides_functors<K, typename boost::mpl::pop_front<List>::type>::value > {};
         template<class K, class List>
         struct Provides_functors<K, List, true> : std::true_type {};
 
         template<class K, class List, bool=boost::mpl::empty<List>::type::value>
-        struct Provides_types : boost::mpl::and_ <
-                                   Provides_type<K, typename boost::mpl::front<List>::type>,
-                                   Provides_types<K, typename boost::mpl::pop_front<List>::type> > {};
+        struct Provides_types : std::bool_constant<
+                                   Provides_type<K, typename boost::mpl::front<List>::type>::value &&
+                                   Provides_types<K, typename boost::mpl::pop_front<List>::type>::value > {};
         template<class K, class List>
         struct Provides_types<K, List, true> : std::true_type {};
 
diff --git a/Number_types/include/CGAL/Lazy_exact_nt.h b/Number_types/include/CGAL/Lazy_exact_nt.h
index 3f8a2812968a..d15c11a73bd7 100644
--- a/Number_types/include/CGAL/Lazy_exact_nt.h
+++ b/Number_types/include/CGAL/Lazy_exact_nt.h
@@ -382,9 +382,9 @@ public :
 
   // Also check that ET and AT are constructible from T?
   template<class T>
-  Lazy_exact_nt (T i, std::enable_if_t<boost::mpl::and_<
-      boost::mpl::or_<std::is_arithmetic<T>, std::is_enum<T> >,
-      boost::mpl::not_<std::is_same<T,ET> > >::value,void*> = 0)
+  Lazy_exact_nt (T i, std::enable_if_t<
+      (std::is_arithmetic_v<T> || std::is_enum_v<T>) &&
+      !std::is_same_v<T,ET>,void*> = 0)
     : Base(new Lazy_exact_Cst<ET,T>(i)) {}
 
   Lazy_exact_nt (const ET & e)
diff --git a/Number_types/include/CGAL/Sqrt_extension/Sqrt_extension_type.h b/Number_types/include/CGAL/Sqrt_extension/Sqrt_extension_type.h
index 4a562530c75a..6b87205b5018 100644
--- a/Number_types/include/CGAL/Sqrt_extension/Sqrt_extension_type.h
+++ b/Number_types/include/CGAL/Sqrt_extension/Sqrt_extension_type.h
@@ -178,10 +178,10 @@ class Sqrt_extension : public internal::Interval_optional_caching<FP_TAG>,
      */
   template <class NTX>
   explicit Sqrt_extension(const NTX& a, const NTX& b, const NTX& c, const bool is_smaller,
-    std::enable_if_t< boost::mpl::and_<
-      std::is_same< typename Fraction_traits<NT>::Numerator_type,NTX >,
-      std::is_same< typename Fraction_traits<ROOT>::Numerator_type,NTX >
-    >::value >* = 0  )
+    std::enable_if_t<
+      std::is_same_v< typename Fraction_traits<NT>::Numerator_type,NTX > &&
+      std::is_same_v< typename Fraction_traits<ROOT>::Numerator_type,NTX >
+    >* = 0  )
   {
     typename Fraction_traits<NT>::Compose compose_nt;
     typename Fraction_traits<ROOT>::Compose compose_root;
diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_Delaunay_triangulation_2.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_Delaunay_triangulation_2.h
index 1232e426aed9..c83be87df905 100644
--- a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_Delaunay_triangulation_2.h
+++ b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_Delaunay_triangulation_2.h
@@ -435,10 +435,9 @@ class Periodic_2_Delaunay_triangulation_2
           boost::zip_iterator< boost::tuple<InputIterator_1, InputIterator_2> > last,
           bool is_large_point_set = true,
           std::enable_if_t <
-          boost::mpl::and_ <
-          std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-          std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
-          >::value >* = nullptr)
+            std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Point > &&
+            std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
+          >* = nullptr)
   {
     return insert_with_info< boost::tuple<Point, typename internal::Info_check<typename Tds::Vertex>::type> >(first, last, is_large_point_set);
   }
diff --git a/STL_Extension/include/CGAL/Container_helper.h b/STL_Extension/include/CGAL/Container_helper.h
index 9f5ac5a84cb2..18a98dfa456b 100644
--- a/STL_Extension/include/CGAL/Container_helper.h
+++ b/STL_Extension/include/CGAL/Container_helper.h
@@ -38,10 +38,8 @@ void resize(Container& c, std::size_t size,
 // Container without a resize() function, but with a size() function (e.g. an array)
 template <class Container>
 void resize(Container& CGAL_assertion_code(array), std::size_t CGAL_assertion_code(size),
-            std::enable_if_t<
-              boost::mpl::and_<
-                boost::mpl::not_<has_resize<Container> >,
-                                 has_size<Container> >::value >* = nullptr)
+            std::enable_if_t<!has_resize<Container>::value &&
+                              has_size<Container>::value >* = nullptr)
 {
   CGAL_assertion(array.size() == size);
 }
diff --git a/STL_Extension/include/CGAL/type_traits/is_iterator.h b/STL_Extension/include/CGAL/type_traits/is_iterator.h
index 6630dd8ceb1e..8d476da20363 100644
--- a/STL_Extension/include/CGAL/type_traits/is_iterator.h
+++ b/STL_Extension/include/CGAL/type_traits/is_iterator.h
@@ -35,14 +35,13 @@ BOOST_MPL_HAS_XXX_TRAIT_DEF(reference)
 //provide all 5 nested types provided by iterator_traits
 template <class T>
 struct is_iterator_
-  : public boost::mpl::or_<
-             boost::mpl::and_<
-               has_iterator_category<T>,
-               has_value_type<T>,
-               has_difference_type<T>,
-               has_pointer<T>,
-               has_reference<T> >,
-               std::is_pointer<T> >
+  : public std::bool_constant<
+             ( has_iterator_category<T>::value &&
+               has_value_type<T>::value &&
+               has_difference_type<T>::value &&
+               has_pointer<T>::value &&
+               has_reference<T>::value) ||
+               std::is_pointer_v<T> >
 { };
 
 template <class T, class U, bool = is_iterator_<T>::value>
diff --git a/Stream_support/include/CGAL/IO/helpers.h b/Stream_support/include/CGAL/IO/helpers.h
index bba12aa85a74..015c5f047c72 100644
--- a/Stream_support/include/CGAL/IO/helpers.h
+++ b/Stream_support/include/CGAL/IO/helpers.h
@@ -77,10 +77,10 @@ struct is_Point_set_3 : has_Point_set<T> { };
 // Point_set_3 and strings also functions as ranges, but we want to match polygon soups here
 template <typename T>
 struct is_Range
-  : public boost::mpl::and_<
-             boost::has_range_const_iterator<T>, // should be a range
-             boost::mpl::not_<is_Point_set_3<T> >, // but not a Point_set_3
-             boost::mpl::not_<std::is_convertible<T, std::string> > > // or a std::string / char [x]
+  : public std::bool_constant<
+             boost::has_range_const_iterator<T>::value && // should be a range
+             !is_Point_set_3<T>::value && // but not a Point_set_3
+             !std::is_convertible_v<T, std::string> > // or a std::string / char [x]
 { };
 
 template <class T>
@@ -89,7 +89,7 @@ inline constexpr bool is_Range_v = is_Range<T>::value;
 // For polygon meshes
 template <typename T>
 struct is_Point_set_or_Range_or_Iterator
-  : public boost::mpl::or_<is_Point_set_3<T>, is_Range<T>, is_iterator<T> >
+  : public bool_constant<is_Point_set_3<T>::value || is_Range<T>::value || is_iterator<T>::value >
 { };
 
 template <class T>
diff --git a/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
index a96be0e6d76d..52c14ea54b78 100644
--- a/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
@@ -413,10 +413,8 @@ class Constrained_Delaunay_triangulation_2
   insert( boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > first,
           boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
           std::enable_if_t<
-            boost::mpl::and_<
-              std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-              std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
-            >::value
+              std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Point > &&
+              std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
           >* =nullptr
   )
   {
diff --git a/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
index 34a282b91626..617e8c23a8a4 100644
--- a/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Delaunay_triangulation_2.h
@@ -385,10 +385,8 @@ class Delaunay_triangulation_2
   insert(boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > first,
          boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
          std::enable_if_t<
-           boost::mpl::and_<
-             std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-             std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
-           >::value
+             std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Point > &&
+             std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
          >* = nullptr)
   {
     return insert_with_info< boost::tuple<Point,typename internal::Info_check<typename Tds::Vertex>::type> >(first,last);
diff --git a/Triangulation_2/include/CGAL/Regular_triangulation_2.h b/Triangulation_2/include/CGAL/Regular_triangulation_2.h
index c3ab2223a0ad..d5d1a6c5917a 100644
--- a/Triangulation_2/include/CGAL/Regular_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Regular_triangulation_2.h
@@ -528,10 +528,8 @@ class Regular_triangulation_2
   insert(boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > first,
           boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
           std::enable_if_t<
-            boost::mpl::and_<
-              typename std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point >,
-              typename std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
-            >::value
+              typename std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point > &&
+              typename std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
           >* =nullptr
 )
   {return insert_with_info< boost::tuple<Weighted_point,typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type> >(first,last);}
diff --git a/Triangulation_2/include/CGAL/Triangulation_2.h b/Triangulation_2/include/CGAL/Triangulation_2.h
index c79aa0128d2b..14e8604640f1 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2.h
@@ -710,10 +710,8 @@ std::ptrdiff_t insert(InputIterator first, InputIterator last,
   insert(boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > first,
          boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
          std::enable_if_t<
-           boost::mpl::and_<
-             std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-             std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
-           >::value
+             std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Point > &&
+             std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Tds::Vertex>::type >
          >* = NULL)
   {
     return insert_with_info< boost::tuple<Point,typename internal::Info_check<typename Tds::Vertex>::type> >(first,last);
diff --git a/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h b/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h
index 8b22fddd3493..63ade11b5e8a 100644
--- a/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Delaunay_triangulation_3.h
@@ -494,10 +494,8 @@ class Delaunay_triangulation_3<Gt, Tds_, Default, Lock_data_structure_>
   insert(boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > first,
           boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
           std::enable_if_t<
-            boost::mpl::and_<
-              std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-              std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
-            >::value
+              std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Point > &&
+              std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
           >* =nullptr)
   {
     return insert_with_info< boost::tuple<Point, typename internal::Info_check<
diff --git a/Triangulation_3/include/CGAL/Regular_triangulation_3.h b/Triangulation_3/include/CGAL/Regular_triangulation_3.h
index 7795840a2e6d..b4ff7de189cf 100644
--- a/Triangulation_3/include/CGAL/Regular_triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Regular_triangulation_3.h
@@ -612,10 +612,9 @@ class Regular_triangulation_3
   insert(boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > first,
          boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
          std::enable_if_t<
-           boost::mpl::and_<
-           typename std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point >,
-           typename std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
-         >::value >* =nullptr)
+           typename std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point > &&
+           typename std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
+         >* =nullptr)
   {
     return insert_with_info<
              boost::tuple<Weighted_point,
diff --git a/Triangulation_3/include/CGAL/Triangulation_3.h b/Triangulation_3/include/CGAL/Triangulation_3.h
index fd4b530c7a88..5c698db8b4a2 100644
--- a/Triangulation_3/include/CGAL/Triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_3.h
@@ -1222,10 +1222,8 @@ class Triangulation_3
   insert(boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > first,
           boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
           std::enable_if_t<
-            boost::mpl::and_<
-              std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-              std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
-            >::value
+              std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Point > &&
+              std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
           >* =NULL)
   {
     return insert_with_info< boost::tuple<Point, typename internal::Info_check<
diff --git a/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h b/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h
index c852a4bed75c..d15a5bdcfe5d 100644
--- a/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_hierarchy_3.h
@@ -330,10 +330,8 @@ class Triangulation_hierarchy_3
   insert( boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > first,
           boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
           std::enable_if_t<
-            boost::mpl::and_<
-              std::is_convertible< typename std::iterator_traits<InputIterator_1>::value_type, Point >,
-              std::is_convertible< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<Vertex>::type >
-            >::value
+              std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Point > &&
+              std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<Vertex>::type >
           >* =nullptr
   )
   {

From 4344c3cc27a869018c400adc149cd36539f19a8a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 10 Nov 2023 16:34:19 +0100
Subject: [PATCH 0980/1398] replace boost::mpl::or_

---
 .../include/CGAL/Arr_tags.h                    | 18 +++++++++---------
 .../include/CGAL/CGAL_Ipelet_base_v6.h         | 11 +++++------
 .../include/CGAL/CGAL_Ipelet_base_v7.h         | 11 +++++------
 Filtered_kernel/include/CGAL/Lazy_kernel.h     |  6 +++---
 .../CGAL/NewKernel_d/Wrapper/Cartesian_wrap.h  |  4 ++--
 .../Polygon_mesh_processing/intersection.h     | 14 ++++++--------
 STL_Extension/include/CGAL/type_traits.h       |  8 ++++----
 Stream_support/include/CGAL/IO/helpers.h       |  2 +-
 8 files changed, 35 insertions(+), 39 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_tags.h b/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
index 94ea503e244b..384666f80fa1 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
@@ -377,15 +377,15 @@ struct Arr_sides_category {
   typedef typename Arr_is_side_open<Bot_side_cat>::result       Bot_ope;
   typedef typename Arr_is_side_open<Top_side_cat>::result       Top_ope;
 
-  typedef boost::mpl::or_<Lef_obl, Lef_ope>                     Lef_obl_or_ope;
-  typedef boost::mpl::or_<Rig_obl, Rig_ope>                     Rig_obl_or_ope;
-  typedef boost::mpl::or_<Bot_obl, Bot_ope>                     Bot_obl_or_ope;
-  typedef boost::mpl::or_<Top_obl, Top_ope>                     Top_obl_or_ope;
-
-  typedef std::conditional_t<Lef_obl_or_ope::value &&
-                             Rig_obl_or_ope::value &&
-                             Bot_obl_or_ope::value &&
-                             Top_obl_or_ope::value,
+  static inline constexpr bool lef_obl_or_ope = Lef_obl::value || Lef_ope::value;
+  static inline constexpr bool rig_obl_or_ope = Rig_obl::value || Rig_ope::value;
+  static inline constexpr bool bot_obl_or_ope = Bot_obl::value || Bot_ope::value;
+  static inline constexpr bool top_obl_or_ope = Top_obl::value || Top_ope::value;
+
+  typedef std::conditional_t<lef_obl_or_ope &&
+                             rig_obl_or_ope &&
+                             bot_obl_or_ope &&
+                             top_obl_or_ope,
                              Arr_all_sides_not_finite_tag,
                              Arr_not_all_sides_not_finite_tag>
     tmp;
diff --git a/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v6.h b/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v6.h
index 48572f24118b..9876131f47b0 100644
--- a/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v6.h
+++ b/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v6.h
@@ -636,12 +636,11 @@ namespace CGAL{
     template<class iterator>
     void
     draw_in_ipe(const iterator begin,const iterator end,const Iso_rectangle_2& bbox,bool make_grp=true,bool deselect_all=false,
-     std::enable_if_t<  boost::mpl::or_< std::is_same<typename std::iterator_traits<iterator>::value_type,Point_2> ,
-                        boost::mpl::or_< std::is_same<typename std::iterator_traits<iterator>::value_type,Segment_2> ,
-                        boost::mpl::or_< std::is_same<typename std::iterator_traits<iterator>::value_type,Circle_2> ,
-                        boost::mpl::or_< std::is_same<typename std::iterator_traits<iterator>::value_type,Circular_arc_2> ,
-                                         std::is_same<typename std::iterator_traits<iterator>::value_type,Polygon_2>
-                                      > > > >::value
+     std::enable_if_t<  std::is_same_v<typename std::iterator_traits<iterator>::value_type,Point_2> ||
+                        std::is_same_v<typename std::iterator_traits<iterator>::value_type,Segment_2> ||
+                        std::is_same_v<typename std::iterator_traits<iterator>::value_type,Circle_2> ||
+                        std::is_same_v<typename std::iterator_traits<iterator>::value_type,Circular_arc_2> ||
+                        std::is_same_v<typename std::iterator_traits<iterator>::value_type,Polygon_2>
                     >* = nullptr) const
     {
       for (iterator it=begin;it!=end;++it)
diff --git a/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h b/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h
index 5373b0a3445f..3dc51367d33e 100644
--- a/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h
+++ b/CGAL_ipelets/include/CGAL/CGAL_Ipelet_base_v7.h
@@ -645,12 +645,11 @@ namespace CGAL{
     template<class iterator>
     void
     draw_in_ipe(const iterator begin,const iterator end,const Iso_rectangle_2& bbox,bool make_grp=true,bool deselect_all=false,
-     std::enable_if_t<  boost::mpl::or_< std::is_same<typename std::iterator_traits<iterator>::value_type,Point_2> ,
-                        boost::mpl::or_< std::is_same<typename std::iterator_traits<iterator>::value_type,Segment_2> ,
-                        boost::mpl::or_< std::is_same<typename std::iterator_traits<iterator>::value_type,Circle_2> ,
-                        boost::mpl::or_< std::is_same<typename std::iterator_traits<iterator>::value_type,Circular_arc_2> ,
-                                         std::is_same<typename std::iterator_traits<iterator>::value_type,Polygon_2>
-                                                > > > >::value
+     std::enable_if_t<  std::is_same_v<typename std::iterator_traits<iterator>::value_type,Point_2> ||
+                        std::is_same_v<typename std::iterator_traits<iterator>::value_type,Segment_2> ||
+                        std::is_same_v<typename std::iterator_traits<iterator>::value_type,Circle_2> ||
+                        std::is_same_v<typename std::iterator_traits<iterator>::value_type,Circular_arc_2> ||
+                        std::is_same_v<typename std::iterator_traits<iterator>::value_type,Polygon_2>
                     >* = nullptr) const
     {
       for (iterator it=begin;it!=end;++it)
diff --git a/Filtered_kernel/include/CGAL/Lazy_kernel.h b/Filtered_kernel/include/CGAL/Lazy_kernel.h
index c6b6cb2444ab..8f43a8a1af13 100644
--- a/Filtered_kernel/include/CGAL/Lazy_kernel.h
+++ b/Filtered_kernel/include/CGAL/Lazy_kernel.h
@@ -198,9 +198,9 @@ class Lazy_kernel_generic_base : protected internal::Enum_holder
                                               boost::mpl::eval_if< std::is_same< typename internal::Lazy_result_type<Construction>::type,
                                                                                    CGAL::Object >,
                                                                    boost::mpl::int_<OBJECT>,
-                                                                   boost::mpl::eval_if< boost::mpl::or_<
-                                                                                          std::is_same< typename internal::Lazy_result_type<Construction>::type, CGAL::Bbox_2 >,
-                                                                                          std::is_same< typename internal::Lazy_result_type<Construction>::type, CGAL::Bbox_3 > >,
+                                                                   boost::mpl::eval_if< std::bool_constant<
+                                                                                          std::is_same_v< typename internal::Lazy_result_type<Construction>::type, CGAL::Bbox_2 > ||
+                                                                                          std::is_same_v< typename internal::Lazy_result_type<Construction>::type, CGAL::Bbox_3 > >,
                                                                                         boost::mpl::int_<BBOX>,
                                                                                         boost::mpl::int_<NONE> > > >,
                          boost::mpl::int_<NONE> >::type {};
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Cartesian_wrap.h b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Cartesian_wrap.h
index 9ddd7953e24b..50d9a8c8b00c 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Cartesian_wrap.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Wrapper/Cartesian_wrap.h
@@ -83,8 +83,8 @@ template <class T> struct result_<T,false,true>{typedef transforming_iterator<Fo
 template<class> struct result;
 template<class T> struct result<Forward_rep(T)> : result_<T> {};
 
-template <class T> std::enable_if_t<!boost::mpl::or_<Is_wrapper<T>,Is_wrapper_iterator<T> >::value,T> const& operator()(T const& t) const {return t;}
-template <class T> std::enable_if_t<!boost::mpl::or_<Is_wrapper<T>,Is_wrapper_iterator<T> >::value,T>& operator()(T& t) const {return t;}
+template <class T> std::enable_if_t<!Is_wrapper<T>::value || Is_wrapper_iterator<T>::value,T> const& operator()(T const& t) const {return t;}
+template <class T> std::enable_if_t<!Is_wrapper<T>::value || Is_wrapper_iterator<T>::value,T>& operator()(T& t) const {return t;}
 
 template <class T> typename T::Rep const& operator()(T const& t, std::enable_if_t<Is_wrapper<T>::value >* = 0) const {return t.rep();}
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
index f32f9d907a98..a72d9ffaafc9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
@@ -1426,18 +1426,16 @@ bool do_intersect(const TriangleMesh& tm,
                   const Polyline& polyline,
                   const CGAL_NP_CLASS& np = parameters::default_values()
 #ifndef DOXYGEN_RUNNING
-                , const std::enable_if_t<
-                    ! boost::mpl::or_<
-                      typename std::is_same<TriangleMesh, Polyline>::type, // Added to please MSVC 2015
-                      typename boost::mpl::not_<typename boost::has_range_iterator<Polyline>::type>::type, // not a range
-                      typename boost::has_range_iterator<
+                , const std::enable_if_t<!(
+                      std::is_same_v<TriangleMesh, Polyline> || // Added to please MSVC 2015
+                      !boost::has_range_iterator<Polyline>::type>::value || // not a range
+                      boost::has_range_iterator<
                         typename boost::mpl::eval_if<
                           boost::has_range_iterator<Polyline>,
                           boost::range_value<Polyline>,
                           std::false_type
-                        >::type
-                      >::type // not a range of a range
-                    >::value
+                        >::value
+                    )
                   >* = 0
 #endif
                  )
diff --git a/STL_Extension/include/CGAL/type_traits.h b/STL_Extension/include/CGAL/type_traits.h
index 59aae8a03079..c68386c7f76c 100644
--- a/STL_Extension/include/CGAL/type_traits.h
+++ b/STL_Extension/include/CGAL/type_traits.h
@@ -21,10 +21,10 @@ namespace CGAL {
 
 template< class Base, class Derived >
 struct is_same_or_derived :
-  public ::boost::mpl::or_<
-    ::std::is_same< Base, Derived >,
-    ::boost::is_base_and_derived< Base, Derived >
-  >::type
+  public std::bool_constant<
+    ::std::is_same_v< Base, Derived > ||
+    ::boost::is_base_and_derived< Base, Derived >::value
+  >
 {};
 
 namespace cpp20 {
diff --git a/Stream_support/include/CGAL/IO/helpers.h b/Stream_support/include/CGAL/IO/helpers.h
index 015c5f047c72..7382ebabd667 100644
--- a/Stream_support/include/CGAL/IO/helpers.h
+++ b/Stream_support/include/CGAL/IO/helpers.h
@@ -89,7 +89,7 @@ inline constexpr bool is_Range_v = is_Range<T>::value;
 // For polygon meshes
 template <typename T>
 struct is_Point_set_or_Range_or_Iterator
-  : public bool_constant<is_Point_set_3<T>::value || is_Range<T>::value || is_iterator<T>::value >
+  : public std::bool_constant<is_Point_set_3<T>::value || is_Range<T>::value || is_iterator<T>::value >
 { };
 
 template <class T>

From 2f104a6f76ac233f58fb23b885747385cf3d1eab Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 10 Nov 2023 16:38:24 +0100
Subject: [PATCH 0981/1398] replace boost::mpl::not_

---
 Arrangement_on_surface_2/include/CGAL/Arr_tags.h | 12 ++++++------
 NewKernel_d/include/CGAL/NewKernel_d/utils.h     |  2 +-
 2 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_tags.h b/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
index 384666f80fa1..8f3c78095f4d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_tags.h
@@ -334,17 +334,17 @@ struct Arr_all_sides_not_open_category {
   typedef typename Arr_is_side_open<Bot_side_cat>::result       Bot_ope;
   typedef typename Arr_is_side_open<Top_side_cat>::result       Top_ope;
 
-  typedef boost::mpl::not_<Lef_ope>                             Lef_not_ope;
-  typedef boost::mpl::not_<Rig_ope>                             Rig_not_ope;
-  typedef boost::mpl::not_<Bot_ope>                             Bot_not_ope;
-  typedef boost::mpl::not_<Top_ope>                             Top_not_ope;
+  static inline constexpr bool lef_not_ope = !Lef_ope::value;
+  static inline constexpr bool rig_not_ope = !Rig_ope::value;
+  static inline constexpr bool bot_not_ope = !Bot_ope::value;
+  static inline constexpr bool top_not_ope = !Top_ope::value;
 
 public:
   /*! Boolean tag that is Arr_all_sides_not_open_tag if all sides are not-open,
    * otherwise Arr_not_all_sides_not_open_tag
    */
-  typedef std::conditional_t<Lef_not_ope::value && Rig_not_ope::value &&
-                             Bot_not_ope::value && Top_not_ope::value,
+  typedef std::conditional_t<lef_not_ope && rig_not_ope &&
+                             bot_not_ope && top_not_ope,
                              Arr_all_sides_not_open_tag,
                              Arr_not_all_sides_not_open_tag>
     result;
diff --git a/NewKernel_d/include/CGAL/NewKernel_d/utils.h b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
index f2e6a2f3ada5..4296f179462d 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/utils.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/utils.h
@@ -38,7 +38,7 @@ template <class T, class No, bool=internal::has_type<T>::value /*false*/>
 struct Has_type_different_from : std::false_type {};
 template <class T, class No>
 struct Has_type_different_from <T, No, true>
-: boost::mpl::not_<std::is_same<typename T::type, No> > {};
+: std::bool_constant<!std::is_same_v<typename T::type, No>> {};
 
 
         template <class T> struct Wrap_type { typedef T type; };

From 5a463f5428c8312318a0f11caf5de113a63a48e9 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 13 Nov 2023 08:01:14 +0000
Subject: [PATCH 0982/1398] Thank you Albert

---
 .../doc/Scale_space_reconstruction_3/dependencies               | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/dependencies b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/dependencies
index 8435af3db159..a5892968bd58 100644
--- a/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/dependencies
+++ b/Scale_space_reconstruction_3/doc/Scale_space_reconstruction_3/dependencies
@@ -7,5 +7,5 @@ Spatial_searching
 Solver_interface
 Advancing_front_surface_reconstruction
 Point_set_processing_3
-Polygon_mesh_processing_3
+Polygon_mesh_processing
 Algebraic_foundations

From 0b73361226b11e06520c32970178e016cc0d200d Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 13 Nov 2023 12:47:39 +0100
Subject: [PATCH 0983/1398] remove CGAL_ITK_support.cmake

and adapt the CMakeLists that were using it
---
 Installation/cmake/modules/CGAL_ITK_support.cmake    |  7 -------
 Mesh_3/examples/Mesh_3/CMakeLists.txt                | 12 ++++++++----
 .../demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt    | 10 +++++++---
 3 files changed, 15 insertions(+), 14 deletions(-)
 delete mode 100644 Installation/cmake/modules/CGAL_ITK_support.cmake

diff --git a/Installation/cmake/modules/CGAL_ITK_support.cmake b/Installation/cmake/modules/CGAL_ITK_support.cmake
deleted file mode 100644
index 61ed67e2f2ba..000000000000
--- a/Installation/cmake/modules/CGAL_ITK_support.cmake
+++ /dev/null
@@ -1,7 +0,0 @@
-if(ITK_FOUND AND NOT TARGET CGAL::ITK_support)
-  add_library(CGAL::ITK_support INTERFACE IMPORTED)
-  set_target_properties(CGAL::ITK_support PROPERTIES
-    INTERFACE_COMPILE_DEFINITIONS "CGAL_USE_ITK"
-    INTERFACE_INCLUDE_DIRECTORIES "${ITK_INCLUDE_DIRS}"
-    INTERFACE_LINK_LIBRARIES "${ITK_LIBRARIES}")
-endif()
diff --git a/Mesh_3/examples/Mesh_3/CMakeLists.txt b/Mesh_3/examples/Mesh_3/CMakeLists.txt
index 31ab08db7e8e..7f9ccfdb03b6 100644
--- a/Mesh_3/examples/Mesh_3/CMakeLists.txt
+++ b/Mesh_3/examples/Mesh_3/CMakeLists.txt
@@ -171,16 +171,20 @@ if(TARGET CGAL::CGAL_ImageIO)
     target_link_libraries(mesh_3D_image_variable_size
                           PUBLIC CGAL::Eigen3_support)
 
-    find_package(ITK NAMES ITK InsightToolkit QUIET COMPONENTS ITKCommon ITKThresholding ITKSmoothing ITKImageIntensity)
+    find_package(ITK NAMES ITK InsightToolkit
+                     QUIET COMPONENTS ITKCommon ITKThresholding ITKSmoothing ITKImageIntensity)
     if(ITK_FOUND)
-      include(CGAL_ITK_support)
+      message(STATUS "ITK found")
+      include(${ITK_USE_FILE})
+      set(ITK_LIBS ITKCommon ITKSmoothing ITKImageIntensity)
+
       create_single_source_cgal_program("mesh_3D_weighted_image.cpp")
       target_link_libraries(mesh_3D_weighted_image
-                            PUBLIC CGAL::Eigen3_support CGAL::ITK_support)
+                            PUBLIC CGAL::Eigen3_support ${ITK_LIBS})
 
       create_single_source_cgal_program("mesh_3D_weighted_image_with_detection_of_features.cpp")
       target_link_libraries(mesh_3D_weighted_image_with_detection_of_features
-                            PUBLIC CGAL::Eigen3_support CGAL::ITK_support)
+                            PUBLIC CGAL::Eigen3_support ${ITK_LIBS})
     else(ITK_FOUND)
       message(STATUS "NOTICE: The examples that need ITK will not be compiled.")
     endif(ITK_FOUND)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
index 706ce2d36439..994a71fc703d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
@@ -28,10 +28,14 @@ target_link_libraries(
          ${OPENGL_gl_LIBRARY})
 target_include_directories(mesh_3_plugin PRIVATE include)
 
-find_package(ITK NAMES ITK InsightToolkit QUIET COMPONENTS ITKCommon ITKThresholding ITKSmoothing ITKImageIntensity)
+find_package(ITK NAMES ITK InsightToolkit
+                 QUIET COMPONENTS ITKCommon ITKThresholding ITKSmoothing ITKImageIntensity)
 if(ITK_FOUND)
-  include(CGAL_ITK_support)
-  target_link_libraries(mesh_3_plugin PUBLIC CGAL::ITK_support)
+  include(${ITK_USE_FILE})
+  set(ITK_LIBS ITKCommon ITKSmoothing ITKImageIntensity)
+
+  target_link_libraries(mesh_3_plugin PUBLIC ${ITK_LIBS})
+  target_compile_definitions(mesh_3_plugin PUBLIC CGAL_USE_ITK)
 endif(ITK_FOUND)
 
 find_package(VTK QUIET COMPONENTS vtkImagingGeneral vtkIOImage vtkIOXML NO_MODULE)

From 5974f2ca329fade254cb693a26b25323aeb1b62f Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 13 Nov 2023 13:48:05 +0100
Subject: [PATCH 0984/1398] replace Vertex_triple by std::array<Vertex_handle,
 3>

---
 .../include/CGAL/Triangulation_3.h            | 51 +++++++++----------
 1 file changed, 23 insertions(+), 28 deletions(-)

diff --git a/Triangulation_3/include/CGAL/Triangulation_3.h b/Triangulation_3/include/CGAL/Triangulation_3.h
index c5ee70bbc430..6417ca196128 100644
--- a/Triangulation_3/include/CGAL/Triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_3.h
@@ -1654,7 +1654,7 @@ class Triangulation_3
 
 protected:
   typedef Facet Edge_2D;
-  typedef Triple<Vertex_handle,Vertex_handle,Vertex_handle> Vertex_triple;
+  typedef std::array<Vertex_handle, 3> Vertex_triple;
   typedef typename Base::template Vertex_triple_Facet_map_generator<
   Vertex_triple, Facet>::type Vertex_triple_Facet_map;
   typedef typename Base::template Vertex_handle_unique_hash_map_generator<
@@ -1921,20 +1921,20 @@ class Triangulation_3
   }
 
   /// Vertex ranges defining a simplex
-  std::array<Vertex_handle, 2> vertices(const Edge& e) const
+  static std::array<Vertex_handle, 2> vertices(const Edge& e)
   {
     return std::array<Vertex_handle, 2>{
              e.first->vertex(e.second),
              e.first->vertex(e.third)};
   }
-  std::array<Vertex_handle, 3> vertices(const Facet& f) const
+  static std::array<Vertex_handle, 3> vertices(const Facet& f)
   {
     return std::array<Vertex_handle, 3>{
              f.first->vertex(vertex_triple_index(f.second, 0)),
              f.first->vertex(vertex_triple_index(f.second, 1)),
              f.first->vertex(vertex_triple_index(f.second, 2))};
   }
-  std::array<Vertex_handle, 4> vertices(const Cell_handle c) const
+  static std::array<Vertex_handle, 4> vertices(const Cell_handle c)
   {
     return std::array<Vertex_handle, 4>{
              c->vertex(0),
@@ -4404,12 +4404,7 @@ typename Triangulation_3<Gt,Tds,Lds>::Vertex_triple
 Triangulation_3<Gt,Tds,Lds>::
 make_vertex_triple(const Facet& f)
 {
-  Cell_handle ch = f.first;
-  int i = f.second;
-
-  return Vertex_triple(ch->vertex(vertex_triple_index(i,0)),
-                       ch->vertex(vertex_triple_index(i,1)),
-                       ch->vertex(vertex_triple_index(i,2)));
+  return vertices(f);
 }
 
 template < class Gt, class Tds, class Lds >
@@ -4417,13 +4412,13 @@ void
 Triangulation_3<Gt,Tds,Lds>::
 make_canonical_oriented_triple(Vertex_triple& t)
 {
-  int i = (t.first < t.second) ? 0 : 1;
+  int i = (t[0] < t[1]) ? 0 : 1;
   if(i==0)
   {
-    i = (t.first < t.third) ? 0 : 2;
+    i = (t[0] < t[2]) ? 0 : 2;
   } else
   {
-    i = (t.second < t.third) ? 1 : 2;
+    i = (t[1] < t[2]) ? 1 : 2;
   }
 
   Vertex_handle tmp;
@@ -4431,16 +4426,16 @@ make_canonical_oriented_triple(Vertex_triple& t)
   {
     case 0: return;
     case 1:
-      tmp = t.first;
-      t.first = t.second;
-      t.second = t.third;
-      t.third = tmp;
+      tmp = t[0];
+      t[0] = t[1];
+      t[1] = t[2];
+      t[2] = tmp;
       return;
     default:
-      tmp = t.first;
-      t.first = t.third;
-      t.third = t.second;
-      t.second = tmp;
+      tmp = t[0];
+      t[0] = t[2];
+      t[2] = t[1];
+      t[1] = tmp;
   }
 }
 
@@ -4994,7 +4989,7 @@ create_triangulation_inner_map(const Triangulation& t,
       {
         Facet f = std::pair<Cell_handle,int>(it,index);
         Vertex_triple vt_aux = make_vertex_triple(f);
-        Vertex_triple vt(vmap[vt_aux.first], vmap[vt_aux.third], vmap[vt_aux.second]);
+        Vertex_triple vt(vmap[vt_aux[0]], vmap[vt_aux[2]], vmap[vt_aux[1]]);
         make_canonical_oriented_triple(vt);
         inner_map[vt] = f;
       }
@@ -5008,7 +5003,7 @@ create_triangulation_inner_map(const Triangulation& t,
       {
         Facet f = std::pair<Cell_handle,int>(it,index);
         Vertex_triple vt_aux = make_vertex_triple(f);
-        Vertex_triple vt(vmap[vt_aux.first], vmap[vt_aux.third], vmap[vt_aux.second]);
+        Vertex_triple vt(vmap[vt_aux[0]], vmap[vt_aux[2]], vmap[vt_aux[1]]);
         make_canonical_oriented_triple(vt);
         inner_map[vt] = f;
       }
@@ -5108,9 +5103,9 @@ copy_triangulation_into_hole(const Vertex_handle_unique_hash_map& vmap,
   while(! outer_map.empty())
   {
     typename Vertex_triple_Facet_map::iterator oit = outer_map.begin();
-    while(is_infinite(oit->first.first) ||
-          is_infinite(oit->first.second) ||
-          is_infinite(oit->first.third))
+    while(is_infinite(oit->first[0]) ||
+          is_infinite(oit->first[1]) ||
+          is_infinite(oit->first[2]))
     {
       ++oit;
       // Otherwise the lookup in the inner_map fails
@@ -5148,12 +5143,12 @@ copy_triangulation_into_hole(const Vertex_handle_unique_hash_map& vmap,
         Facet f = std::pair<Cell_handle, int>(new_ch, index);
         Vertex_triple vt = make_vertex_triple(f);
         make_canonical_oriented_triple(vt);
-        std::swap(vt.second, vt.third);
+        std::swap(vt[1], vt[2]);
 
         typename Vertex_triple_Facet_map::iterator oit2 = outer_map.find(vt);
         if(oit2 == outer_map.end())
         {
-          std::swap(vt.second, vt.third);
+          std::swap(vt[1], vt[2]);
           outer_map[vt] = f;
         }
         else

From 47477277d3cbc68412ca5df335f8917dbf7c4993 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 13 Nov 2023 13:58:05 +0100
Subject: [PATCH 0985/1398] use initializer list

---
 Triangulation_3/include/CGAL/Triangulation_3.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Triangulation_3/include/CGAL/Triangulation_3.h b/Triangulation_3/include/CGAL/Triangulation_3.h
index 6417ca196128..55f917036af5 100644
--- a/Triangulation_3/include/CGAL/Triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Triangulation_3.h
@@ -4989,7 +4989,7 @@ create_triangulation_inner_map(const Triangulation& t,
       {
         Facet f = std::pair<Cell_handle,int>(it,index);
         Vertex_triple vt_aux = make_vertex_triple(f);
-        Vertex_triple vt(vmap[vt_aux[0]], vmap[vt_aux[2]], vmap[vt_aux[1]]);
+        Vertex_triple vt{vmap[vt_aux[0]], vmap[vt_aux[2]], vmap[vt_aux[1]]};
         make_canonical_oriented_triple(vt);
         inner_map[vt] = f;
       }
@@ -5003,7 +5003,7 @@ create_triangulation_inner_map(const Triangulation& t,
       {
         Facet f = std::pair<Cell_handle,int>(it,index);
         Vertex_triple vt_aux = make_vertex_triple(f);
-        Vertex_triple vt(vmap[vt_aux[0]], vmap[vt_aux[2]], vmap[vt_aux[1]]);
+        Vertex_triple vt{vmap[vt_aux[0]], vmap[vt_aux[2]], vmap[vt_aux[1]]};
         make_canonical_oriented_triple(vt);
         inner_map[vt] = f;
       }

From 4c315c1ff8692813a4e7b3e11594e0476fa6f1b3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 13 Nov 2023 15:18:26 +0100
Subject: [PATCH 0986/1398] fixes after review

---
 .../Polygon_mesh_processing.txt               |   2 +-
 .../interpolated_corrected_curvatures.h       | 103 ++++++++----------
 2 files changed, 44 insertions(+), 61 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index fa1e527cd775..132669736b7a 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -1000,7 +1000,7 @@ The implementation is generic in terms of mesh data structure. It can be used on
 `Polyhedron_3` and other polygonal mesh structures based on the concept `FaceGraph`.
 
 These computations are performed using (on all vertices of the mesh) `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()`
-where function named parameters are used to select the curvatures (and possibly directions) to be computed. An overlay with the same name
+where function named parameters are used to select the curvatures (and possibly directions) to be computed. An overload function with the same name
 but taking a given vertex is also available in case the computation should be done only for that vertex.
 
 \subsection ICCResults Results & Performance
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index e5587f27aa07..25de9ec9387f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -378,26 +378,6 @@ std::array<typename GT::FT, 3 * 3> interpolated_corrected_anisotropic_measure_fa
   return muXY;
 }
 
-//template<typename GT>
-//typename GT::FT triangle_in_ball_ratio(const typename GT::Vector_3 x1,
-//                                       const typename GT::Vector_3 x2,
-//                                       const typename GT::Vector_3 x3,
-//                                       const typename GT::FT r,
-//                                       const typename GT::Vector_3 c,
-//                                       const std::size_t res = 3)
-//{
-//    const typename GT::FT R = r * r;
-//    const typename GT::FT acc = 1.0 / res;
-//    std::size_t samples_in = 0;
-//    for (typename GT::FT alpha = acc / 3; alpha < 1; alpha += acc)
-//        for (typename GT::FT beta = acc / 3; beta < 1 - alpha; beta += acc)
-//        {
-//            if ((alpha * x1 + beta * x2 + (1 - alpha - beta) * x3 - c).squared_length() < R)
-//                samples_in++;
-//        }
-//    return samples_in / (typename GT::FT)(res * (res + 1) / 2);
-//}
-
 template<typename GT>
 typename GT::FT face_in_ball_ratio(const std::vector<typename GT::Vector_3>& x,
   const typename GT::FT r,
@@ -490,8 +470,8 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
   const VNM vnm
 )
 {
-  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
   typedef typename GT::Point_3 Point_3;
   typedef typename GT::Vector_3 Vector_3;
   typedef typename GT::FT FT;
@@ -502,14 +482,14 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex_no_radius(
   std::vector<Vector_3> u;
 
   // compute for each face around the vertex (except the null (boundary) face)
-  for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+  for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
     if (f != boost::graph_traits<PolygonMesh>::null_face())
     {
       // looping over vertices in face to get point coordinates and normal vectors
-      for (Vertex_descriptor vi : vertices_around_face(halfedge(f, pmesh), pmesh))
+      for (vertex_descriptor vi : vertices_around_face(halfedge(f, pmesh), pmesh))
       {
-        Point_3 pi = get(vpm, vi);
-        Vector_3 ui = get(vnm, vi);
+        const Point_3& pi = get(vpm, vi);
+        const Vector_3& ui = get(vnm, vi);
         x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
         u.push_back(ui);
       }
@@ -550,22 +530,22 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
   const VNM vnm
 )
 {
-  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
   typedef typename GT::Point_3 Point_3;
   typedef typename GT::Vector_3 Vector_3;
   typedef typename GT::FT FT;
 
   // the ball expansion is done using a BFS traversal from the vertex
-  std::queue<Face_descriptor> bfs_queue;
-  std::unordered_set<Face_descriptor> bfs_visited;
+  std::queue<face_descriptor> bfs_queue;
+  std::unordered_set<face_descriptor> bfs_visited;
 
   Vertex_measures<GT> vertex_measures;
 
-  Point_3 vp = get(vpm, v);
-  Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
+  const Point_3& vp = get(vpm, v);
+  Vector_3 c(vp.x(), vp.y(), vp.z());
 
-  for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+  for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
     if (f != boost::graph_traits<PolygonMesh>::null_face())
     {
       bfs_queue.push(f);
@@ -575,14 +555,14 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
   std::vector<Vector_3> x;
   std::vector<Vector_3> u;
   while (!bfs_queue.empty()) {
-    Face_descriptor fi = bfs_queue.front();
+    face_descriptor fi = bfs_queue.front();
     bfs_queue.pop();
 
     // looping over vertices in face to get point coordinates and normal vectors
-    for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+    for (vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
     {
-      Point_3 pi = get(vpm, vi);
-      Vector_3 ui = get(vnm, vi);
+      const Point_3& pi = get(vpm, vi);
+      const Vector_3& ui = get(vnm, vi);
       x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
       u.push_back(ui);
     }
@@ -609,7 +589,7 @@ Vertex_measures<GT> interpolated_corrected_measures_one_vertex(
           vertex_measures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
       }
 
-      for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+      for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
       {
         if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
         {
@@ -724,7 +704,7 @@ template<typename PolygonMesh,
 
   if (is_principal_curvatures_and_directions_selected) {
     // compute the principal curvatures and directions from the anisotropic measures
-    const typename GT::Vector_3  v_normal = get(vnm, v);
+    const typename GT::Vector_3& v_normal = get(vnm, v);
     const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
       vertex_measures.anisotropic_measure,
       vertex_measures.area_measure,
@@ -747,8 +727,8 @@ class Interpolated_corrected_curvatures_computer
 
   typedef typename boost::graph_traits<PolygonMesh>::halfedge_descriptor Halfedge_descriptor;
   typedef typename boost::graph_traits<PolygonMesh>::edge_descriptor Edge_descriptor;
-  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor Face_descriptor;
-  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor Vertex_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::face_descriptor face_descriptor;
+  typedef typename boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
 
   typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
 
@@ -758,7 +738,7 @@ class Interpolated_corrected_curvatures_computer
     NamedParameters,
     Default_vector_map>::type Vertex_normal_map;
 
-  typedef Constant_property_map<Vertex_descriptor, FT> Default_scalar_map;
+  typedef Constant_property_map<vertex_descriptor, FT> Default_scalar_map;
   typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_mean_curvature_map_t,
     NamedParameters,
     Default_scalar_map>::type Vertex_mean_curvature_map;
@@ -767,7 +747,7 @@ class Interpolated_corrected_curvatures_computer
     NamedParameters,
     Default_scalar_map>::type Vertex_Gaussian_curvature_map;
 
-  typedef Constant_property_map<Vertex_descriptor, Principal_curvatures_and_directions<GT>> Default_principal_map;
+  typedef Constant_property_map<vertex_descriptor, Principal_curvatures_and_directions<GT>> Default_principal_map;
   typedef typename internal_np::Lookup_named_param_def<internal_np::vertex_principal_curvatures_and_directions_map_t,
     NamedParameters,
     Default_principal_map>::type Vertex_principal_curvatures_and_directions_map;
@@ -867,12 +847,15 @@ class Interpolated_corrected_curvatures_computer
   {
     std::vector<Vector_3> x;
     std::vector<Vector_3> u;
+    // minimal number of vertices per face is 3
+    x.reserve(3);
+    u.reserve(3);
 
-    for (Face_descriptor f : faces(pmesh))
+    for (face_descriptor f : faces(pmesh))
     {
-      for (Vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
+      for (vertex_descriptor v : vertices_around_face(halfedge(f, pmesh), pmesh))
       {
-        Point_3 p = get(vpm, v);
+        const Point_3& p = get(vpm, v);
         x.push_back(Vector_3(p.x(), p.y(), p.z()));
         u.push_back(get(vnm, v));
       }
@@ -893,12 +876,12 @@ class Interpolated_corrected_curvatures_computer
   }
 
   // expand the measures of the faces incident to v
-  Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(Vertex_descriptor v)
+  Vertex_measures<GT> expand_interpolated_corrected_measure_vertex_no_radius(vertex_descriptor v)
   {
     Vertex_measures<GT> vertex_measures;
 
     // add the measures of the faces incident to v (excluding the null (boundary) face)
-    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+    for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
       if (f == boost::graph_traits<PolygonMesh>::null_face())
         continue;
 
@@ -923,19 +906,19 @@ class Interpolated_corrected_curvatures_computer
   }
 
   // expand the measures of the faces inside the ball of radius r around v
-  Vertex_measures<GT> expand_interpolated_corrected_measure_vertex(Vertex_descriptor v)
+  Vertex_measures<GT> expand_interpolated_corrected_measure_vertex(vertex_descriptor v)
   {
     // the ball expansion is done using a BFS traversal from the vertex
-    std::queue<Face_descriptor> bfs_queue;
-    std::unordered_set<Face_descriptor> bfs_visited;
+    std::queue<face_descriptor> bfs_queue;
+    std::unordered_set<face_descriptor> bfs_visited;
 
-    Point_3 vp = get(vpm, v);
-    Vector_3 c = Vector_3(vp.x(), vp.y(), vp.z());
+    const Point_3& vp = get(vpm, v);
+    const Vector_3& c = Vector_3(vp.x(), vp.y(), vp.z());
 
     Vertex_measures<GT> vertex_measures;
 
     // add the measures of the faces incident to v (excluding the null (boundary) face)
-    for (Face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
+    for (face_descriptor f : faces_around_target(halfedge(v, pmesh), pmesh)) {
       if (f != boost::graph_traits<PolygonMesh>::null_face())
       {
         bfs_queue.push(f);
@@ -943,14 +926,14 @@ class Interpolated_corrected_curvatures_computer
       }
     }
     while (!bfs_queue.empty()) {
-      Face_descriptor fi = bfs_queue.front();
+      face_descriptor fi = bfs_queue.front();
       bfs_queue.pop();
 
       // looping over vertices in face to get point coordinates
       std::vector<Vector_3> x;
-      for (Vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
+      for (vertex_descriptor vi : vertices_around_face(halfedge(fi, pmesh), pmesh))
       {
-        Point_3 pi = get(vpm, vi);
+        const Point_3& pi = get(vpm, vi);
         x.push_back(Vector_3(pi.x(), pi.y(), pi.z()));
       }
 
@@ -976,7 +959,7 @@ class Interpolated_corrected_curvatures_computer
             vertex_measures.anisotropic_measure[i] += f_ratio * face_anisotropic_measure[i];
         }
 
-        for (Face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
+        for (face_descriptor fj : faces_around_face(halfedge(fi, pmesh), pmesh))
         {
           if (bfs_visited.find(fj) == bfs_visited.end() && fj != boost::graph_traits<PolygonMesh>::null_face())
           {
@@ -992,7 +975,7 @@ class Interpolated_corrected_curvatures_computer
   void compute_selected_curvatures() {
     interpolated_corrected_selected_measures_all_faces();
 
-    for (Vertex_descriptor v : vertices(pmesh))
+    for (vertex_descriptor v : vertices(pmesh))
     {
       // expand the computed measures (on faces) to the vertices
       Vertex_measures<GT> vertex_measures = (is_negative(ball_radius)) ?
@@ -1015,7 +998,7 @@ class Interpolated_corrected_curvatures_computer
 
       if (is_principal_curvatures_and_directions_selected) {
         // compute the principal curvatures and directions from the anisotropic measure
-        const Vector_3  v_normal = get(vnm, v);
+        const Vector_3& v_normal = get(vnm, v);
         const Principal_curvatures_and_directions<GT> principal_curvatures_and_directions = principal_curvatures_and_directions_from_anisotropic_measures<GT>(
           vertex_measures.anisotropic_measure,
           vertex_measures.area_measure,

From 724c1f0552ed62688bd450b7b1305d04d8ea33e6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 13 Nov 2023 15:22:12 +0100
Subject: [PATCH 0987/1398] remove TODO added in an issue

---
 .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt     | 2 --
 1 file changed, 2 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 132669736b7a..b2e02abbcbaa 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -1005,8 +1005,6 @@ but taking a given vertex is also available in case the computation should be do
 
 \subsection ICCResults Results & Performance
 
-**To be updated**
-
 First, \cgalFigureRef{icc_measures} illustrates various curvature measures on a triangular mesh.
 
 \cgalFigureAnchor{icc_measures}

From c7be554c0fa6645cf4937bfce02ec407d9fb541a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 13 Nov 2023 16:08:42 +0100
Subject: [PATCH 0988/1398] update after rebase

---
 .../doc/Polygon_mesh_processing/Doxyfile.in   | 22 ++++++++---------
 .../Polygon_mesh_processing.txt               | 24 +++++++++----------
 2 files changed, 23 insertions(+), 23 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
index c2db3e16577f..f6ed67912458 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
@@ -23,17 +23,17 @@ EXCLUDE_SYMBOLS += experimental
 HTML_EXTRA_FILES           = ${CGAL_PACKAGE_DOC_DIR}/fig/selfintersections.jpg \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/mesh_smoothing.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/shape_smoothing.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.040000-0.000000.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.040000-0.000000.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.040000-0.000000.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.000000.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.002000.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.030000-0.000000.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.030000-0.002000.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.040000-0.000000.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.040000-0.002000.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.050000-0.000000.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.050000-0.002000.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmax0.040000-0.000000.jpg \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-dmin0.040000-0.000000.jpg \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-gaussian0.040000-0.000000.jpg \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.000000.jpg \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.020000-0.002000.jpg \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.030000-0.000000.jpg \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.030000-0.002000.jpg \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.040000-0.000000.jpg \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.040000-0.002000.jpg \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.050000-0.000000.jpg \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/bimba-mean0.050000-0.002000.jpg \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_cheese.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_colors.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_rg_joint.png
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index b2e02abbcbaa..930a03523c90 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -1011,10 +1011,10 @@ First, \cgalFigureRef{icc_measures} illustrates various curvature measures on a
 <center>
 <table border=0>
 <tr>
-<td><img src="bimba-mean0.040000-0.000000.png" style="width:100%;"/></td>
-<td><img src="bimba-gaussian0.040000-0.000000.png" style="width:100%;"/></td>
-<td><img src="bimba-dmin0.040000-0.000000.png" style="width:100%;"/></td>
-<td><img src="bimba-dmax0.040000-0.000000.png" style="width:100%;"/></td>
+<td><img src="bimba-mean0.040000-0.000000.jpg" style="width:100%;"/></td>
+<td><img src="bimba-gaussian0.040000-0.000000.jpg" style="width:100%;"/></td>
+<td><img src="bimba-dmin0.040000-0.000000.jpg" style="width:100%;"/></td>
+<td><img src="bimba-dmax0.040000-0.000000.jpg" style="width:100%;"/></td>
 </tr>
 <tr align="center"><td>(a)</td><td>(b)</td></tr>
 </table>
@@ -1029,16 +1029,16 @@ Mean curvature, Gaussian curvature, minimal principal curvature direction and ma
 <center>
 <table border=0>
 <tr>
-<td><img src="bimba-mean0.020000-0.000000.png" style="width:100%;"/></td>
-<td><img src="bimba-mean0.030000-0.000000.png" style="width:100%;"/></td>
-<td><img src="bimba-mean0.040000-0.000000.png" style="width:100%;"/></td>
-<td><img src="bimba-mean0.050000-0.000000.png" style="width:100%;"/></td>
+<td><img src="bimba-mean0.020000-0.000000.jpg" style="width:100%;"/></td>
+<td><img src="bimba-mean0.030000-0.000000.jpg" style="width:100%;"/></td>
+<td><img src="bimba-mean0.040000-0.000000.jpg" style="width:100%;"/></td>
+<td><img src="bimba-mean0.050000-0.000000.jpg" style="width:100%;"/></td>
 </tr>
 <tr>
-<td><img src="bimba-mean0.020000-0.002000.png" style="width:100%;"/></td>
-<td><img src="bimba-mean0.030000-0.002000.png" style="width:100%;"/></td>
-<td><img src="bimba-mean0.040000-0.002000.png" style="width:100%;"/></td>
-<td><img src="bimba-mean0.050000-0.002000.png" style="width:100%;"/></td>
+<td><img src="bimba-mean0.020000-0.002000.jpg" style="width:100%;"/></td>
+<td><img src="bimba-mean0.030000-0.002000.jpg" style="width:100%;"/></td>
+<td><img src="bimba-mean0.040000-0.002000.jpg" style="width:100%;"/></td>
+<td><img src="bimba-mean0.050000-0.002000.jpg" style="width:100%;"/></td>
 </tr>
 <tr align="center"><td>(a)</td><td>(b)</td></tr>
 </table>

From 8518e7d0d988adfb6a815aae9a1f0df2f1c88a6a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 13 Nov 2023 18:40:03 +0100
Subject: [PATCH 0989/1398] update changes

---
 Installation/CHANGES.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index 479984002682..47c8f2679634 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -35,6 +35,10 @@ Release date: October 2023
 -   Removed the class templates `Gray_image_mesh_domain_3`, `Implicit_mesh_domain_3`, and `Labeled_image_mesh_domain_3`
     which are deprecated since CGAL-4.13.
 
+### [Polygon Mesh Processing](https://doc.cgal.org/6.0/Manual/packages.html#PkgPolygonMeshProcessing)
+
+-   Added the function `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()` which can be used to compute
+    the mean and Gaussian curvatures, as well as the principal curvature and directions.
 
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------

From f86d08ec6d9b5e4b2687a91f3c63cf525936b832 Mon Sep 17 00:00:00 2001
From: Nicolas Saillant <saillantnicolas01@gmail.com>
Date: Tue, 14 Nov 2023 09:43:14 +0100
Subject: [PATCH 0990/1398] Add clickable link and remove file columns

---
 Scripts/developer_scripts/list_cgal_workflows_last_run.sh | 8 +++++---
 1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/Scripts/developer_scripts/list_cgal_workflows_last_run.sh b/Scripts/developer_scripts/list_cgal_workflows_last_run.sh
index 08552fafd12f..e4e564480c70 100755
--- a/Scripts/developer_scripts/list_cgal_workflows_last_run.sh
+++ b/Scripts/developer_scripts/list_cgal_workflows_last_run.sh
@@ -1,6 +1,6 @@
 #!/bin/bash
-echo "| repo |  workflow  | branch | event | runs on  |  status of last run  | state | annotation |  date  | date since last runs |  file  |"
-echo "| :--: | :--------: | :----: | :---: | :------: | :------------------: | :---: | :--------: | :----: | :------------------: | :----: |"
+echo "| repo |  workflow  | branch | event | runs on  |  status of last run  | state | annotation |  date  | date since last runs |"
+echo "| :--: | :--------: | :----: | :---: | :------: | :------------------: | :---: | :--------: | :----: | :------------------: |"
 actualdate=$EPOCHSECONDS
 for repo in $(gh api orgs/CGAL/repos --jq '.[].full_name' | grep -v dev )
 do
@@ -28,6 +28,7 @@ do
                 workflows_on=$(jq -r '.workflow_runs[0].event' <<< "$workflow_runs")
                 workflows_path=$(jq -r '.workflow_runs[0].path' <<< "$workflow_runs")
                 workflows_branch=$(jq -r '.workflow_runs[0].head_branch' <<< "$workflow_runs")
+                workflows_run_id=$(jq -r '.workflow_runs[0].id' <<< "$workflow_runs")
                 workflows_checksuite_id=$(jq -r '.workflow_runs[0].check_suite_id' <<< "$workflow_runs")
                 workflows_check_runs=$(gh api repos/$repo/check-suites/$workflows_checksuite_id/check-runs)
                 workflows_check_runs_id=$(jq -r '.check_runs[0].id' <<< "$workflows_check_runs")
@@ -45,7 +46,8 @@ do
                         workflows_event+="<br/>"
                     fi
                 done
-                echo "| $repo | $workflows_name | $workflows_branch | $workflows_event | $workflows_on | $workflows_status - $workflows_conclusion | $workflows_state | ***$worfklows_annotation_level*** | $workflows_start | $(((actualdate - workflows_date) / 86400 )) days | $repo/$workflows_path"
+                workflows_yml="${workflows_path##*.github/}"
+                echo "| [$repo](https://github.com/$repo) | [$workflows_name](https://github.com/$repo/actions/$workflows_yml) | $workflows_branch | $workflows_event | $workflows_on | [$workflows_status - $workflows_conclusion](https://github.com/$repo/actions/runs/$workflows_run_id) | $workflows_state | ***$worfklows_annotation_level*** | $workflows_start | $(((actualdate - workflows_date) / 86400 )) days"
             fi
         done
     fi

From 710ef72e27fe0b4315f9301d1d64e3885e767e05 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 14 Nov 2023 13:26:08 +0000
Subject: [PATCH 0991/1398] Move code to initializer list

---
 Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h b/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h
index e6ff36dd0ce7..a526ec5085d5 100644
--- a/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h
+++ b/Nef_S2/include/CGAL/Nef_S2/Sphere_segment.h
@@ -33,7 +33,10 @@ template <class R_> class Sphere_segment_rep
   typedef Sphere_segment_rep<R_> Rep;
   friend class Sphere_segment<R_>;
 public:
-Sphere_segment_rep() { ps_ = pt_ = Point(); c_ = Circle(); }
+
+Sphere_segment_rep() :
+  ps_(), pt_(), c_()
+{}
 
 Sphere_segment_rep(const Point& p1, const Point& p2,
                    bool shorter_arc=true) :

From 59af92c0857b49ec2aa481791725353c4b3e2e60 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 14 Nov 2023 13:41:09 +0000
Subject: [PATCH 0992/1398] more cleanup

---
 Installation/LICENSE                          |  2 +-
 Maintenance/deb/sid/debian/copyright          | 27 +-------------
 Maintenance/deb/squeeze/debian/copyright      | 27 +-------------
 Maintenance/deb/wheezy/debian/copyright       | 27 +-------------
 Scripts/developer_scripts/check_licenses      | 36 +++++++++----------
 Scripts/scripts/cgal_create_CMakeLists        | 18 +++++-----
 .../doc/Solver_interface/Solver_interface.txt |  2 +-
 .../Surface_mesh_parameterization.txt         |  3 +-
 8 files changed, 33 insertions(+), 109 deletions(-)

diff --git a/Installation/LICENSE b/Installation/LICENSE
index 1ba1accba3e1..6babe11444e5 100644
--- a/Installation/LICENSE
+++ b/Installation/LICENSE
@@ -7,7 +7,7 @@ from GeometryFactory (www.geometryfactory.com) for all or parts of CGAL.
 
 The source code of the CGAL library can be found in the directories
 "src/CGAL", "src/CGALQt", "src/CGALQt5" and "include/CGAL" (with the
-exception of "include/CGAL/CORE", "include/CGAL/OpenNL").
+exception of "include/CGAL/CORE").
 It is specified in each file of the CGAL library which
 license applies to it. This is either the GNU General Public License
 or the GNU Lesser General Public License (as published by the Free Software
diff --git a/Maintenance/deb/sid/debian/copyright b/Maintenance/deb/sid/debian/copyright
index cede542bb966..382b30cd2b54 100644
--- a/Maintenance/deb/sid/debian/copyright
+++ b/Maintenance/deb/sid/debian/copyright
@@ -152,7 +152,7 @@ Copyright (from upstream file LICENSE)
 
    The source code of the CGAL library can be found in the directories
    "src/CGAL", "src/CGALQt", "src/CGALQt4" and "include/CGAL" (with the
-   exception of "include/CGAL/CORE", "include/CGAL/OpenNL").
+   exception of "include/CGAL/CORE").
    It is specified in each file of the CGAL library which
    license applies to it. This is either the GNU General Public License
    or the GNU Lesser General Public License (as published by the Free Software
@@ -168,8 +168,6 @@ Copyright (from upstream file LICENSE)
      licensed under the LGPL (see LICENSE.LGPL).
    - ImageIO, in the directory "src/CGALimageIO", is licensed under the LGPL
      (see LICENSE.LGPL).
-   - OpenNL, in the directory "include/CGAL/OpenNL", is licensed under the LGPL
-    (see LICENSE.LGPL).
 
    All other files that do not have an explicit copyright notice (e.g., all
    examples and some demos) are licensed under a very permissive license. The
@@ -351,26 +349,3 @@ src/CGALimageIO.
 
    These files are provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
    WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
-
-
-
-OpenNL
-======
-
-The following copyright statement applies to the OpenNL library in
-include/CGAL/OpenNL.
-
-   Copyright (c) 2005-2008  Inria Loria (France).
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Lesser General Public
-   License version 3 as published by the Free Software Foundation
-
-   This library is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-   Lesser General Public License for more details.
-
-   You should have received a copy of the GNU Lesser General Public
-   License along with this library; if not, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
diff --git a/Maintenance/deb/squeeze/debian/copyright b/Maintenance/deb/squeeze/debian/copyright
index cede542bb966..382b30cd2b54 100644
--- a/Maintenance/deb/squeeze/debian/copyright
+++ b/Maintenance/deb/squeeze/debian/copyright
@@ -152,7 +152,7 @@ Copyright (from upstream file LICENSE)
 
    The source code of the CGAL library can be found in the directories
    "src/CGAL", "src/CGALQt", "src/CGALQt4" and "include/CGAL" (with the
-   exception of "include/CGAL/CORE", "include/CGAL/OpenNL").
+   exception of "include/CGAL/CORE").
    It is specified in each file of the CGAL library which
    license applies to it. This is either the GNU General Public License
    or the GNU Lesser General Public License (as published by the Free Software
@@ -168,8 +168,6 @@ Copyright (from upstream file LICENSE)
      licensed under the LGPL (see LICENSE.LGPL).
    - ImageIO, in the directory "src/CGALimageIO", is licensed under the LGPL
      (see LICENSE.LGPL).
-   - OpenNL, in the directory "include/CGAL/OpenNL", is licensed under the LGPL
-    (see LICENSE.LGPL).
 
    All other files that do not have an explicit copyright notice (e.g., all
    examples and some demos) are licensed under a very permissive license. The
@@ -351,26 +349,3 @@ src/CGALimageIO.
 
    These files are provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
    WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
-
-
-
-OpenNL
-======
-
-The following copyright statement applies to the OpenNL library in
-include/CGAL/OpenNL.
-
-   Copyright (c) 2005-2008  Inria Loria (France).
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Lesser General Public
-   License version 3 as published by the Free Software Foundation
-
-   This library is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-   Lesser General Public License for more details.
-
-   You should have received a copy of the GNU Lesser General Public
-   License along with this library; if not, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
diff --git a/Maintenance/deb/wheezy/debian/copyright b/Maintenance/deb/wheezy/debian/copyright
index cede542bb966..382b30cd2b54 100644
--- a/Maintenance/deb/wheezy/debian/copyright
+++ b/Maintenance/deb/wheezy/debian/copyright
@@ -152,7 +152,7 @@ Copyright (from upstream file LICENSE)
 
    The source code of the CGAL library can be found in the directories
    "src/CGAL", "src/CGALQt", "src/CGALQt4" and "include/CGAL" (with the
-   exception of "include/CGAL/CORE", "include/CGAL/OpenNL").
+   exception of "include/CGAL/CORE").
    It is specified in each file of the CGAL library which
    license applies to it. This is either the GNU General Public License
    or the GNU Lesser General Public License (as published by the Free Software
@@ -168,8 +168,6 @@ Copyright (from upstream file LICENSE)
      licensed under the LGPL (see LICENSE.LGPL).
    - ImageIO, in the directory "src/CGALimageIO", is licensed under the LGPL
      (see LICENSE.LGPL).
-   - OpenNL, in the directory "include/CGAL/OpenNL", is licensed under the LGPL
-    (see LICENSE.LGPL).
 
    All other files that do not have an explicit copyright notice (e.g., all
    examples and some demos) are licensed under a very permissive license. The
@@ -351,26 +349,3 @@ src/CGALimageIO.
 
    These files are provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
    WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
-
-
-
-OpenNL
-======
-
-The following copyright statement applies to the OpenNL library in
-include/CGAL/OpenNL.
-
-   Copyright (c) 2005-2008  Inria Loria (France).
-
-   This library is free software; you can redistribute it and/or
-   modify it under the terms of the GNU Lesser General Public
-   License version 3 as published by the Free Software Foundation
-
-   This library is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
-   Lesser General Public License for more details.
-
-   You should have received a copy of the GNU Lesser General Public
-   License along with this library; if not, write to the Free Software
-   Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
diff --git a/Scripts/developer_scripts/check_licenses b/Scripts/developer_scripts/check_licenses
index 84fdc59ff946..13c0f8e14acf 100755
--- a/Scripts/developer_scripts/check_licenses
+++ b/Scripts/developer_scripts/check_licenses
@@ -43,23 +43,23 @@ EXTENSIONS="C cpp h xpm gif pcx bmp jpeg png txt html vcproj sln dsp dsw cin cou
 CHECK_PATTERN="\.(`echo $EXTENSIONS | sed -e 's/ /\\|/g'`)"
 
 if [ -e $DIR ]; then
-	echo error: \'$DIR\' exists, this script needs \'$DIR\' for its own purposes
-	exit 1
+        echo error: \'$DIR\' exists, this script needs \'$DIR\' for its own purposes
+        exit 1
 fi
 
 mkdir $DIR
 rm -f $PREFIX1* $PREFIX2*
 
 if [ ! -f INSTALL.md ]; then
-	echo This script should be run from the top-level directory of an internal or external release.
-	exit 1
+        echo This script should be run from the top-level directory of an internal or external release.
+        exit 1
 fi
- 
+
 licensecheck -r * -c $CHECK_PATTERN | grep -Ev ': L?GPL \(v3 or later\)' | \
-	grep -v "^$DIR/\|^include/CGAL/CORE/\|^include/CGAL/OpenNL/\|^src/CGAL_Core/\|^src/CGAL_ImageIO/\|^config/support/\|test/\|^Packages/\|^developer_scripts/\|^winutils/\|^cmake/platforms" | sort >$PREFIX1 || true
-	
+        grep -v "^$DIR/\|^include/CGAL/CORE/\|^src/CGAL_Core/\|^src/CGAL_ImageIO/\|^config/support/\|test/\|^Packages/\|^developer_scripts/\|^winutils/\|^cmake/platforms" | sort >$PREFIX1 || true
+
 echo Note that files in the following directories are ignored:
-echo include/CGAL/CORE, include/CGAL/OpenNL,
+echo include/CGAL/CORE,
 echo src/CGAL_Core, src/CGAL_ImageIO, config/support,
 echo test, Packages, developer_scripts, doc, winutils
 
@@ -68,8 +68,8 @@ echo Results including examples and demo:
 echo
 
 for EXT in $EXTENSIONS; do
-	grep -i "\(\.\|/\)$EXT:" $PREFIX1 >$PREFIX1.$EXT || true
-	echo "$EXT `cat $PREFIX1.$EXT | wc -l`"
+        grep -i "\(\.\|/\)$EXT:" $PREFIX1 >$PREFIX1.$EXT || true
+        echo "$EXT `cat $PREFIX1.$EXT | wc -l`"
 done
 
 PATTERN=`echo $EXTENSIONS | sed -e 's/ /\\:\\\\|/g'`
@@ -85,8 +85,8 @@ echo
 grep -v "^examples/\|^demo/" $PREFIX1 >$PREFIX2 || true
 
 for EXT in $EXTENSIONS; do
-	grep -i "\(\.\|/\)$EXT:" $PREFIX2 >$PREFIX2.$EXT || true
-	echo "$EXT `cat $PREFIX2.$EXT | wc -l`"
+        grep -i "\(\.\|/\)$EXT:" $PREFIX2 >$PREFIX2.$EXT || true
+        echo "$EXT `cat $PREFIX2.$EXT | wc -l`"
 done
 
 PATTERN=`echo $EXTENSIONS | sed -e 's/ /\\:\\\\|/g'`
@@ -99,12 +99,12 @@ echo
 echo Detailed results excluding examples and demo:
 
 for EXT in $EXTENSIONS; do
-	if [ `cat $PREFIX2.$EXT | wc -l` -gt 0 ]; then
-		echo
-		echo $EXT files
-		echo
-		cat $PREFIX2.$EXT
-	fi
+        if [ `cat $PREFIX2.$EXT | wc -l` -gt 0 ]; then
+                echo
+                echo $EXT files
+                echo
+                cat $PREFIX2.$EXT
+        fi
 done
 
 echo
diff --git a/Scripts/scripts/cgal_create_CMakeLists b/Scripts/scripts/cgal_create_CMakeLists
index 0dba57221d0b..07e560aee483 100755
--- a/Scripts/scripts/cgal_create_CMakeLists
+++ b/Scripts/scripts/cgal_create_CMakeLists
@@ -4,7 +4,7 @@
 # Utrecht University (The Netherlands),
 # ETH Zurich (Switzerland),
 # INRIA Sophia-Antipolis (France),
-# Max-Planck-Institute for Informatics Saarbruecken (Germany), 
+# Max-Planck-Institute for Informatics Saarbruecken (Germany),
 # and Tel-Aviv University (Israel).  All rights reserved.
 #
 # This file is part of CGAL (www.cgal.org)
@@ -28,7 +28,6 @@
 #RS
 #BLAS
 #LAPACK
-#OPENNL
 #ESBTL
 #NTL
 
@@ -67,7 +66,7 @@ create_cmake_script_with_options()
         next_boost_component=`echo $LINE | grep -v "#" | grep BOOST_COMPONENT`
         if [ ! -z "$next_boost_component" ]; then
           next_boost_component=${next_boost_component/BOOST_COMPONENT /}
-          if [ -z "$BOOST_COMPONENTS" ]; then 
+          if [ -z "$BOOST_COMPONENTS" ]; then
             BOOST_COMPONENTS=$next_boost_component
           else
             BOOST_COMPONENTS=$BOOST_COMPONENTS":"$next_boost_component
@@ -92,7 +91,7 @@ EOF
   #---------------------------------------------------------------------------
   if [ "$SINGLE_SOURCE" = "n" ]; then
     echo "project( ${PROJECT} )"
-  else 
+  else
     echo "project( ${SOURCE} )"
   fi
 
@@ -124,7 +123,6 @@ fi
     CGAL_COMPONENTS=${CGAL_COMPONENTS//[m|M][p|P][f|F][i|I]/MPFI}
     CGAL_COMPONENTS=${CGAL_COMPONENTS//[r|R][s|S]/RS}
 
-    CGAL_COMPONENTS=${CGAL_COMPONENTS//[o|O][p|P][e|E][n|N][n|N][l|L]/OpenNL}
     CGAL_COMPONENTS=${CGAL_COMPONENTS//[b|B][l|L][a|A][s|S]/BLAS}
     CGAL_COMPONENTS=${CGAL_COMPONENTS//[l|L][a|A][p|P][a|A][c|C][k|K]/LAPACK}
 
@@ -161,7 +159,7 @@ fi
 if ( NOT CGAL_FOUND )
 
   message(STATUS "This project requires the CGAL library, and will not be compiled.")
-  return()  
+  return()
 
 endif()
 
@@ -192,7 +190,7 @@ if ( NOT Boost_FOUND )
 
   message(STATUS "This project requires the Boost library, and will not be compiled.")
 
-  return()  
+  return()
 
 endif()
 EOF
@@ -208,7 +206,7 @@ EOF
 
   if [ -d include ] ; then
     echo 'include_directories( BEFORE include )'
-  fi		
+  fi
 
   #vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
   cat << 'EOF'
@@ -304,9 +302,9 @@ EOF
         fi
       fi
       #add a new line
-      echo 
+      echo
     done
-    
+
   else #======================================================================
 
     #################
diff --git a/Solver_interface/doc/Solver_interface/Solver_interface.txt b/Solver_interface/doc/Solver_interface/Solver_interface.txt
index 8b3450f8afc1..e4a491e882f5 100644
--- a/Solver_interface/doc/Solver_interface/Solver_interface.txt
+++ b/Solver_interface/doc/Solver_interface/Solver_interface.txt
@@ -125,7 +125,7 @@ This package is the result of the increasing needs for linear solvers
 in \cgal.  The first packages that introduced the solver concepts were
 \ref PkgSurfaceMeshParameterization, \ref PkgPoissonSurfaceReconstruction3
 and \ref PkgJetFitting3.  At that time, these packages were relying
-on \taucs, \lapack, \blas and \opennl. Gaël Guennebaud
+on \taucs, \lapack, \blas and OpenNL. Gaël Guennebaud
 then introduced new models using the \ref thirdpartyEigen library that
 became the only supported models by \cgal.  Later on the packages \ref
 PkgSurfaceMeshSkeletonization and \ref PkgSurfaceMeshDeformation
diff --git a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
index c4be5d3c0fb1..636b49d2523f 100644
--- a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
+++ b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
@@ -547,6 +547,7 @@ and replaces a wrapper which had a more complicated API.
 Iterative authalic parameterization was added in CGAL 5.2 by Mael Rouxel-Labbé,
 based on a prototype developed by Hardik Jain.
 
+In CGAL 6.0 the fork of OpenNL that was distributed with CGAL was removed.
+
 */
 } /* namespace CGAL */
-

From d840b6f422b195fbfdf3679179b14d45b4cecd5b Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 14 Nov 2023 13:49:52 +0000
Subject: [PATCH 0993/1398] Improve wording

---
 .../Surface_mesh_parameterization.txt                         | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
index 636b49d2523f..3aae43c9c421 100644
--- a/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
+++ b/Surface_mesh_parameterization/doc/Surface_mesh_parameterization/Surface_mesh_parameterization.txt
@@ -547,7 +547,9 @@ and replaces a wrapper which had a more complicated API.
 Iterative authalic parameterization was added in CGAL 5.2 by Mael Rouxel-Labbé,
 based on a prototype developed by Hardik Jain.
 
-In CGAL 6.0 the fork of OpenNL that was distributed with CGAL was removed.
+In CGAL 6.0 this package no longer uses the fork of OpenNL that was distributed with CGAL
+and hence was removed.
+
 
 */
 } /* namespace CGAL */

From dc0cd7f1e6fa0432ec31db1ad891e2496c87c903 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 15 Nov 2023 07:51:58 +0000
Subject: [PATCH 0994/1398] make  ~Show_point_dialog()  virtual

---
 Polyhedron/demo/Polyhedron/Show_point_dialog.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Show_point_dialog.h b/Polyhedron/demo/Polyhedron/Show_point_dialog.h
index 915b51ae397b..c98040e4737c 100644
--- a/Polyhedron/demo/Polyhedron/Show_point_dialog.h
+++ b/Polyhedron/demo/Polyhedron/Show_point_dialog.h
@@ -16,7 +16,7 @@ class POINT_DIALOG_EXPORT Show_point_dialog :
   Q_OBJECT
 public:
   Show_point_dialog(QWidget* parent = nullptr);
-  ~Show_point_dialog();
+  virtual ~Show_point_dialog();
 
   bool has_correct_coordinates() const;
 

From 652f7b26c09ae4052049cbb7107c6ae79f0bcc75 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 15 Nov 2023 08:59:17 +0000
Subject: [PATCH 0995/1398] Replace Q_FOREACH

---
 Polyhedron/demo/Polyhedron/MainWindow.cpp     | 138 +++++++++---------
 .../Plugins/AABB_tree/Cut_plugin.cpp          |  10 +-
 .../AABB_tree/Do_trees_intersect_plugin.cpp   |  14 +-
 .../Alpha_wrap_3/Alpha_wrap_3_plugin.cpp      |   6 +-
 .../Camera_position/Camera_positions_list.cpp |   2 +-
 .../Convex_decomposition/Nef_plugin.cpp       |   2 +-
 .../IO/Implicit_function_io_plugin.cpp        |   4 +-
 .../Plugins/IO/Polylines_io_plugin.cpp        |   2 +-
 .../Plugins/Mesh_2/Mesh_2_plugin.cpp          |  22 +--
 .../Plugins/Mesh_3/Io_image_plugin.cpp        |  10 +-
 .../Mesh_3/Io_implicit_function_plugin.cpp    |   6 +-
 .../Plugins/Mesh_3/Mesh_3_plugin.cpp          |   6 +-
 .../Plugins/Mesh_3/Offset_meshing_plugin.cpp  |   2 +-
 .../Plugins/Mesh_3/Optimization_plugin.cpp    |   2 +-
 .../Polyhedron/Plugins/Mesh_3/Volume_plane.h  |   2 +-
 .../Clip_polyhedron_plugin.cpp                |   4 +-
 .../Plugins/PCA/Affine_transform_plugin.cpp   |   2 +-
 .../Plugins/PCA/Basic_generator_plugin.cpp    |   6 +-
 .../Plugins/PCA/Clipping_box_plugin.cpp       |   4 +-
 .../Plugins/PCA/Create_bbox_mesh_plugin.cpp   |   4 +-
 .../Plugins/PCA/Create_obb_mesh_plugin.cpp    |   6 +-
 .../Plugins/PCA/Edit_box_plugin.cpp           |   2 +-
 .../Polyhedron/Plugins/PCA/Pca_plugin.cpp     |   2 +-
 .../Plugins/PCA/Scene_edit_box_item.cpp       |   8 +-
 .../Plugins/PMP/Degenerated_faces_plugin.cpp  |   8 +-
 .../Plugins/PMP/Detect_sharp_edges_plugin.cpp |   6 +-
 .../Plugins/PMP/Engrave_text_plugin.cpp       |  11 +-
 .../Polyhedron/Plugins/PMP/Extrude_plugin.cpp |   4 +-
 .../Plugins/PMP/Hole_filling_plugin.cpp       |   8 +-
 .../PMP/Isotropic_remeshing_plugin.cpp        |   2 +-
 .../PMP/Join_and_split_polyhedra_plugin.cpp   |  10 +-
 .../Mean_curvature_flow_skeleton_plugin.cpp   |   2 +-
 .../Plugins/PMP/Orient_soup_plugin.cpp        |   5 +-
 .../PMP/Point_inside_polyhedron_plugin.cpp    |   8 +-
 .../PMP/Polyhedron_stitching_plugin.cpp       |  10 +-
 .../PMP/Remesh_planar_patches_plugin.cpp      |   2 +-
 .../Plugins/PMP/Repair_polyhedron_plugin.cpp  |   2 +-
 .../Scene_facegraph_item_k_ring_selection.h   |   4 +-
 .../Plugins/PMP/Selection_plugin.cpp          |   4 +-
 .../PMP/Surface_intersection_plugin.cpp       |  16 +-
 .../Plugins/PMP/Triangulate_facets_plugin.cpp |   4 +-
 .../Plugins/Point_set/Alpha_shape_plugin.cpp  |   2 +-
 .../Point_set/Merge_point_sets_plugin.cpp     |   6 +-
 .../Point_set/Point_set_selection_plugin.cpp  |   6 +-
 .../Point_set_shape_detection_plugin.cpp      |   4 +-
 .../Point_set_to_mesh_distance_plugin.cpp     |   4 +-
 .../Point_set/Register_point_sets_plugin.cpp  |   2 +-
 .../Subdivision_methods_plugin.cpp            |   2 +-
 .../Surface_mesh/Offset_meshing_plugin.cpp    |   4 +-
 .../Surface_mesh/Parameterization_plugin.cpp  |  16 +-
 .../Scene_polyhedron_shortest_path_item.cpp   |   4 +-
 .../Plugins/Surface_mesh/UVProjector.h        |   2 +-
 .../Edit_polyhedron_plugin.cpp                |  16 +-
 .../Scene_edit_polyhedron_item.cpp            |   2 +-
 .../demo/Polyhedron/Polyhedron_demo.cpp       |   4 +-
 .../Polyhedron_demo_plugin_helper.cpp         |   4 +-
 Polyhedron/demo/Polyhedron/Scene.cpp          |  68 ++++-----
 Polyhedron/demo/Polyhedron/Scene.h            |  12 +-
 Polyhedron/demo/Polyhedron/Scene_find_items.h |   4 +-
 .../demo/Polyhedron/Scene_group_item.cpp      |   2 +-
 .../Scene_points_with_normal_item.cpp         |   2 +-
 .../Scene_polyhedron_selection_item.cpp       |  16 +-
 .../demo/Polyhedron/Scene_polylines_item.cpp  |   2 +-
 .../Polyhedron/Scene_surface_mesh_item.cpp    |  18 +--
 .../Scene_textured_surface_mesh_item.cpp      |   3 +-
 .../Polyhedron/Scene_triangulation_3_item.cpp |   3 +-
 Polyhedron/demo/Polyhedron/TextRenderer.cpp   |   8 +-
 Polyhedron/demo/Polyhedron/Three.cpp          |   7 +-
 Polyhedron/demo/Polyhedron/Viewer.cpp         |   4 +-
 69 files changed, 296 insertions(+), 303 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index 1714b547af9e..24455668188d 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -317,7 +317,7 @@ MainWindow::MainWindow(const QStringList &keywords, bool verbose, QWidget* paren
   accepted_keywords.clear();
 
   // Setup the submenu of the View menu that can toggle the dockwidgets
-  Q_FOREACH(QDockWidget* widget, findChildren<QDockWidget*>()) {
+  for(QDockWidget* widget : findChildren<QDockWidget*>()) {
     widget->setFeatures(QDockWidget::DockWidgetClosable | QDockWidget::DockWidgetFloatable);
     ui->menuDockWindows->addAction(widget->toggleViewAction());
   }
@@ -342,7 +342,7 @@ MainWindow::MainWindow(const QStringList &keywords, bool verbose, QWidget* paren
   actionResetDefaultLoaders = new QAction("Reset Default Loaders",this);
 
   // evaluate_script("print(plugins);");
-  Q_FOREACH(QAction* action, findChildren<QAction*>()) {
+  for(QAction* action : findChildren<QAction*>()) {
     if(action->objectName() != "") {
       QJSValue objectValue = script_engine->newQObject(action);
       script_engine->globalObject().setProperty(action->objectName(),
@@ -372,11 +372,11 @@ void addActionToMenu(QAction* action, QMenu* menu)
 void filterMenuOperations(QMenu* menu, QString filter, bool keep_from_here)
 {
   QList<QAction*> buffer;
-  Q_FOREACH(QAction* action, menu->actions())
+  for(QAction* action : menu->actions())
     buffer.append(action);
 
   while(!buffer.isEmpty()){
-    Q_FOREACH(QAction* action, buffer) {
+    for(QAction* action : buffer) {
       if(QMenu* submenu = action->menu())
       {
         bool keep = true;
@@ -384,7 +384,7 @@ void filterMenuOperations(QMenu* menu, QString filter, bool keep_from_here)
           keep = submenu->menuAction()->text().contains(filter, Qt::CaseInsensitive);
           if(!keep)
           {
-            Q_FOREACH(QAction* subaction, submenu->actions())
+            for(QAction* subaction : submenu->actions())
             {
               submenu->removeAction(subaction);
               buffer.append(subaction);
@@ -421,23 +421,23 @@ void MainWindow::filterOperations(bool)
     ui->menuOperations->hide();
 #endif
   //return actions to their true menu
-  Q_FOREACH(QMenu* menu, action_menu_map.values())
+  for(QMenu* menu : action_menu_map.values())
   {
-    Q_FOREACH(QAction* action, menu->actions())
+    for(QAction* action : menu->actions())
     {
       if(action != searchAction)
         menu->removeAction(action);
     }
   }
 
-  Q_FOREACH(QAction* action, action_menu_map.keys())
+  for(QAction* action : action_menu_map.keys())
   {
     QMenu* menu = action_menu_map[action];
     addActionToMenu(action, menu);
   }
   QString filter=operationSearchBar.text();
-  Q_FOREACH(const PluginNamePair& p, plugins) {
-    Q_FOREACH(QAction* action, p.first->actions()) {
+  for(const PluginNamePair& p : plugins) {
+    for(QAction* action : p.first->actions()) {
       action->setVisible( p.first->applicable(action)
                           && (action->text().remove("&").contains(filter, Qt::CaseInsensitive)
                               || action->property("subMenuName")
@@ -579,7 +579,7 @@ bool MainWindow::load_plugin(QString fileName, bool blacklisted)
     bool do_load = accepted_keywords.empty();
     if(!do_load)
     {
-      Q_FOREACH(QString k, s_keywords)
+      for(QString k : s_keywords)
       {
         if(accepted_keywords.contains(k))
         {
@@ -621,7 +621,7 @@ bool MainWindow::load_plugin(QString fileName, bool blacklisted)
 
 void MainWindow::loadPlugins()
 {
-  Q_FOREACH(QObject *obj, QPluginLoader::staticInstances())
+  for(QObject *obj : QPluginLoader::staticInstances())
   {
     initPlugin(obj);
     initIOPlugin(obj);
@@ -637,7 +637,7 @@ void MainWindow::loadPlugins()
   QFileInfoList filist = QDir(dirPath).entryInfoList();
   filist << msvc_dir.entryInfoList();
 
-  Q_FOREACH(QFileInfo fileinfo, filist)
+  for(QFileInfo fileinfo : filist)
   {
     //checks if the path leads to a directory
     if(fileinfo.baseName().contains("Plugins"))
@@ -645,7 +645,7 @@ void MainWindow::loadPlugins()
       QString plugins_dir = fileinfo.absolutePath();
       plugins_dir.append("/").append(fileinfo.baseName());
 
-      Q_FOREACH(QString package_dir,
+      for(QString package_dir :
                 QDir(plugins_dir).entryList(QDir::Dirs))
       {
         QString package_dir_path(plugins_dir);
@@ -677,7 +677,7 @@ void MainWindow::loadPlugins()
     QByteArray new_path = path.append(env_path.prepend(separator)).toUtf8();
     qputenv("PATH", new_path);
 #endif
-    Q_FOREACH (QString pluginsDir,
+    for (QString pluginsDir :
                env_path.split(separator, CGAL_QT_SKIP_EMPTY_PARTS)) {
       QDir dir(pluginsDir);
       if(dir.isReadable())
@@ -686,11 +686,11 @@ void MainWindow::loadPlugins()
   }
 
   QSet<QString> loaded;
-  Q_FOREACH (QDir pluginsDir, plugins_directories) {
+  for (QDir pluginsDir : plugins_directories) {
     if(verbose)
       qDebug("# Looking for plugins in directory \"%s\"...",
              qPrintable(pluginsDir.absolutePath()));
-    Q_FOREACH(QString fileName, pluginsDir.entryList(QDir::Files))
+    for(QString fileName : pluginsDir.entryList(QDir::Files))
     {
       QString abs_name = pluginsDir.absoluteFilePath(fileName);
       if(loaded.find(abs_name) == loaded.end())
@@ -708,7 +708,7 @@ void MainWindow::loadPlugins()
 void MainWindow::updateMenus()
 {
   QList<QAction*> as = ui->menuOperations->actions();
-  Q_FOREACH(QAction* a, as)
+  for(QAction* a : as)
   {
     QString menuPath = a->property("subMenuName").toString();
     setMenus(menuPath, ui->menuOperations->title(), a);
@@ -724,7 +724,7 @@ void MainWindow::updateMenus()
 
 bool MainWindow::hasPlugin(const QString& pluginName) const
 {
-  Q_FOREACH(const PluginNamePair& p, plugins) {
+  for(const PluginNamePair& p : plugins) {
     if(p.second == pluginName) return true;
   }
   return false;
@@ -741,7 +741,7 @@ bool MainWindow::initPlugin(QObject* obj)
     plugin->init(this, this->scene, this);
     plugins << qMakePair(plugin, obj->objectName());
 
-    Q_FOREACH(QAction* action, plugin->actions()) {
+    for(QAction* action : plugin->actions()) {
       // If action does not belong to the menus, add it to "Operations" menu
       if(!childs.contains(action)) {
         ui->menuOperations->addAction(action);
@@ -771,7 +771,7 @@ bool MainWindow::initIOPlugin(QObject* obj)
 
 void MainWindow::clearMenu(QMenu* menu)
 {
-  Q_FOREACH(QAction* action, menu->actions())
+  for(QAction* action : menu->actions())
   {
     QMenu* menu = action->menu();
     if(menu) {
@@ -805,7 +805,7 @@ void MainWindow::addAction(QString actionName,
                            QString actionText,
                            QString menuName) {
   QMenu* menu = nullptr;
-  Q_FOREACH(QAction* action, findChildren<QAction*>()) {
+  for(QAction* action : findChildren<QAction*>()) {
     if(!action->menu()) continue;
     QString menuText = action->menu()->title();
     if(menuText != menuName) continue;
@@ -894,7 +894,7 @@ void MainWindow::updateViewersBboxes(bool recenter)
   {
   CGAL::qglviewer::Vec min, max;
   computeViewerBBox(min, max);
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
   {
     if(v == nullptr)
       continue;
@@ -939,7 +939,7 @@ void MainWindow::computeViewerBBox(CGAL::qglviewer::Vec& vmin, CGAL::qglviewer::
     }
   if(offset != viewer->offset())
   {
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
     {
       if(v == nullptr)
         continue;
@@ -959,7 +959,7 @@ void MainWindow::reloadItem() {
 
   Scene_item* item = nullptr;
 
-  Q_FOREACH(Scene::Item_id id, scene->selectionIndices())
+  for(Scene::Item_id id : scene->selectionIndices())
   {
     item = scene->item(id);
     if(!item)//secure items like selection items that get deleted when their "parent" item is reloaded.
@@ -1017,7 +1017,7 @@ void MainWindow::reloadItem() {
 }
 
 CGAL::Three::Polyhedron_demo_io_plugin_interface* MainWindow::findLoader(const QString& loader_name) const {
-  Q_FOREACH(CGAL::Three::Polyhedron_demo_io_plugin_interface* io_plugin,
+  for(CGAL::Three::Polyhedron_demo_io_plugin_interface* io_plugin :
             io_plugins) {
     if(io_plugin->name() == loader_name) {
       return io_plugin;
@@ -1037,7 +1037,7 @@ bool MainWindow::file_matches_filter(const QString& filters,
   QRegularExpression all_filters_rx("\\((.*)\\)");
 
   QStringList split_filters = filters.split(";;");
-  Q_FOREACH(const QString& filter, split_filters) {
+  for(const QString& filter : split_filters) {
       QRegularExpressionMatch match = all_filters_rx.match(filter);
       if(match.hasMatch()){
         for (const QString& pattern : match.captured(1).split(' ')) {
@@ -1322,7 +1322,7 @@ QList<int> MainWindow::getSelectedSceneItemIndices() const
 {
   QModelIndexList selectedIndices = sceneView->selectionModel()->selectedIndexes();
   QList<int> result;
-  Q_FOREACH(QModelIndex index, selectedIndices) {
+  for(QModelIndex index : selectedIndices) {
     int temp = scene->getIdFromModelIndex(proxyModel->mapToSource(index));
     if(!result.contains(temp))
       result<<temp;
@@ -1335,7 +1335,7 @@ void MainWindow::selectionChanged()
   scene->setSelectedItemIndex(getSelectedSceneItemIndex());
   scene->setSelectedItemIndices(getSelectedSceneItemIndices());
   CGAL::Three::Scene_item* item = scene->item(getSelectedSceneItemIndex());
-  Q_FOREACH(CGAL::QGLViewer* vi, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* vi : CGAL::QGLViewer::QGLViewerPool())
   {
     if(vi == nullptr)
       continue;
@@ -1346,7 +1346,7 @@ void MainWindow::selectionChanged()
       vi->setManipulatedFrame(nullptr);
     }
     if(vi->manipulatedFrame() == nullptr) {
-      Q_FOREACH(CGAL::Three::Scene_item* item, scene->entries()) {
+      for(CGAL::Three::Scene_item* item : scene->entries()) {
         if(item->manipulatable() && item->manipulatedFrame() != nullptr) {
           if(vi->manipulatedFrame() != nullptr) {
             // there are at least two possible frames
@@ -1444,7 +1444,7 @@ void MainWindow::showSceneContextMenu(const QPoint& p) {
         QVector<QMenu*> slider_menus;
         bool has_stats = false;
         bool has_reload = false;
-        Q_FOREACH(Scene::Item_id id, scene->selectionIndices())
+        for(Scene::Item_id id : scene->selectionIndices())
         {
           if(!scene->item(id)->property("source filename").toString().isEmpty())
           {
@@ -1452,7 +1452,7 @@ void MainWindow::showSceneContextMenu(const QPoint& p) {
             break;
           }
         }
-        Q_FOREACH(QAction* action, scene->item(main_index)->contextMenu()->actions())
+        for(QAction* action : scene->item(main_index)->contextMenu()->actions())
         {
           if(action->property("is_groupable").toBool())
           {
@@ -1476,7 +1476,7 @@ void MainWindow::showSceneContextMenu(const QPoint& p) {
           }
 
         }
-        Q_FOREACH(Scene::Item_id index, scene->selectionIndices())
+        for(Scene::Item_id index : scene->selectionIndices())
         {
           if(index == main_index)
             continue;
@@ -1490,7 +1490,7 @@ void MainWindow::showSceneContextMenu(const QPoint& p) {
         QMenu menu;
         menu.addAction(actionAddToGroup);
         menu.insertSeparator(nullptr);
-        Q_FOREACH(QString name, menu_actions.keys())
+        for(QString name : menu_actions.keys())
         {
           if(name == QString("alpha slider")
              || name == QString("points slider")
@@ -1512,10 +1512,10 @@ void MainWindow::showSceneContextMenu(const QPoint& p) {
 
             connect(slider, &QSlider::valueChanged, [this, slider]()
             {
-              Q_FOREACH(Scene::Item_id id, scene->selectionIndices())
+              for(Scene::Item_id id : scene->selectionIndices())
               {
                 Scene_item* item = scene->item(id);
-                Q_FOREACH(QAction* action, item->contextMenu()->actions())
+                for(QAction* action : item->contextMenu()->actions())
                 {
                   if(action->text() == "Alpha value")
                   {
@@ -1547,10 +1547,10 @@ void MainWindow::showSceneContextMenu(const QPoint& p) {
 
             connect(slider, &QSlider::valueChanged, [this, slider]()
             {
-              Q_FOREACH(Scene::Item_id id, scene->selectionIndices())
+              for(Scene::Item_id id : scene->selectionIndices())
               {
                 Scene_item* item = scene->item(id);
-                Q_FOREACH(QAction* action, item->contextMenu()->actions())
+                for(QAction* action : item->contextMenu()->actions())
                 {
                   if(action->text() == "Points Size")
                   {
@@ -1582,10 +1582,10 @@ void MainWindow::showSceneContextMenu(const QPoint& p) {
 
             connect(slider, &QSlider::valueChanged, [this, slider]()
             {
-              Q_FOREACH(Scene::Item_id id, scene->selectionIndices())
+              for(Scene::Item_id id : scene->selectionIndices())
               {
                 Scene_item* item = scene->item(id);
-                Q_FOREACH(QAction* action, item->contextMenu()->actions())
+                for(QAction* action : item->contextMenu()->actions())
                 {
                   if(action->text() == "Normals Length")
                   {
@@ -1625,10 +1625,10 @@ void MainWindow::showSceneContextMenu(const QPoint& p) {
 
             connect(slider, &QSlider::valueChanged, [this, slider]()
             {
-              Q_FOREACH(Scene::Item_id id, scene->selectionIndices())
+              for(Scene::Item_id id : scene->selectionIndices())
               {
                 Scene_item* item = scene->item(id);
-                Q_FOREACH(QAction* action, item->contextMenu()->actions())
+                for(QAction* action : item->contextMenu()->actions())
                 {
                   if(action->text() == "Line Width")
                   {
@@ -1652,7 +1652,7 @@ void MainWindow::showSceneContextMenu(const QPoint& p) {
         }
         if(!slider_menus.empty())
         {
-          Q_FOREACH(QMenu* m, slider_menus){
+          for(QMenu* m : slider_menus){
             menu.addMenu(m);
           }
           menu.insertSeparator(nullptr);
@@ -1744,7 +1744,7 @@ void MainWindow::readSettings()
           settings.value("default_ps_rm", "points").toString());
     // read plugin blacklist
     QStringList blacklist=settings.value("plugin_blacklist",QStringList()).toStringList();
-    Q_FOREACH(QString name,blacklist){ plugin_blacklist.insert(name); }
+    for(QString name :blacklist){ plugin_blacklist.insert(name); }
     def_save_dir = settings.value("default_saveas_dir", QDir::homePath()).toString();
     this->default_point_size = settings.value("points_size").toInt();
     this->default_normal_length = settings.value("normals_length").toInt();
@@ -1758,7 +1758,7 @@ void MainWindow::writeSettings()
   {
     //setting plugin blacklist
     QStringList blacklist;
-    Q_FOREACH(QString name,plugin_blacklist){ blacklist << name; }
+    for(QString name :plugin_blacklist){ blacklist << name; }
     if ( !blacklist.isEmpty() ) settings.setValue("plugin_blacklist",blacklist);
     else settings.remove("plugin_blacklist");
   }
@@ -1838,7 +1838,7 @@ void MainWindow::on_actionLoad_triggered()
 
   for(CGAL::Three::Polyhedron_demo_io_plugin_interface* plugin : io_plugins) {
     QStringList split_filters = plugin->loadNameFilters().split(";;");
-    Q_FOREACH(const QString& filter, split_filters) {
+    for(const QString& filter : split_filters) {
       FilterPluginMap::iterator it = filterPluginMap.find(filter);
       if(it != filterPluginMap.end()) {
         if(verbose)
@@ -1881,7 +1881,7 @@ void MainWindow::on_actionLoad_triggered()
                     std::back_inserter(colors_));
   std::size_t nb_item = -1;
 
-  Q_FOREACH(const QString& filename, dialog.selectedFiles()) {
+  for(const QString& filename : dialog.selectedFiles()) {
 
     CGAL::Three::Scene_item* item = nullptr;
     if(selectedPlugin) {
@@ -2002,9 +2002,9 @@ void MainWindow::on_actionSaveAs_triggered()
     filename_ext.push_front(".");
 
     QStringList final_extensions;
-    Q_FOREACH(QString string, filter_exts)
+    for(QString string : filter_exts)
     {
-      Q_FOREACH(QString s, string.split(" ")){// in case of syntax like (*.a *.b)
+      for(QString s : string.split(" ")){// in case of syntax like (*.a *.b)
         s.remove(")");
         s.remove("(");
         //remove *
@@ -2099,7 +2099,7 @@ void MainWindow::on_actionDuplicate_triggered()
 void MainWindow::on_actionShowHide_triggered()
 {
   scene->setUpdatesEnabled(false);
-  Q_FOREACH(QModelIndex index, sceneView->selectionModel()->selectedRows())
+  for(QModelIndex index : sceneView->selectionModel()->selectedRows())
   {
     int i = scene->getIdFromModelIndex(proxyModel->mapToSource(index));
     CGAL::Three::Scene_item* item = scene->item(i);
@@ -2216,7 +2216,7 @@ void MainWindow::on_actionPreferences_triggered()
       ignoredBrush(Qt::lightGray);
 
   //add blacklisted plugins
-  Q_FOREACH (QString name, PathNames_map.keys())
+  for (QString name : PathNames_map.keys())
   {
     QTreeWidgetItem *item = new QTreeWidgetItem(prefdiag.treeWidget);
     item->setText(1, name);
@@ -2245,7 +2245,7 @@ void MainWindow::on_actionPreferences_triggered()
     detdiag.setupUi(&dialog);
     QTreeWidgetItem *header = new QTreeWidgetItem(titles);
     detdiag.treeWidget->setHeaderItem(header);
-    Q_FOREACH(QTreeWidgetItem* plugin_item, prefdiag.treeWidget->selectedItems())
+    for(QTreeWidgetItem* plugin_item : prefdiag.treeWidget->selectedItems())
     {
       QString name = plugin_item->text(1);
       QString keywords = plugin_metadata_map[name].first.join(", ");
@@ -2379,7 +2379,7 @@ void MainWindow::setBackgroundColor()
 {
   QColor c =  QColorDialog::getColor();
   if(c.isValid()) {
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
     {
       if(v == nullptr)
         continue;
@@ -2456,7 +2456,7 @@ void MainWindow::on_actionLoadPlugin_triggered()
         this,
         tr("Select the directory containing your plugins:"),
         ".",filters);
-  Q_FOREACH(QString name, paths)
+  for(QString name : paths)
     load_plugin(name, false);
 
   updateMenus();
@@ -2549,7 +2549,7 @@ QString MainWindow::get_item_stats()
 {
   //1st step : get all classnames of the selected items
   QList<QString> classnames;
-  Q_FOREACH(int id, scene->selectionIndices())
+  for(int id : scene->selectionIndices())
   {
     Scene_item* item = scene->item(id);
     QString classname = item->property("classname").toString();
@@ -2561,7 +2561,7 @@ QString MainWindow::get_item_stats()
   //2nd step : separate the selection in lists corresponding to their classname
   QVector< QList<Scene_item*> > items;
   items.resize(classnames.size());
-  Q_FOREACH(int id, scene->selectionIndices())
+  for(int id : scene->selectionIndices())
   {
     Scene_item* s_item = scene->item(id);
     for(int i=0; i<items.size(); i++)
@@ -2588,7 +2588,7 @@ QString MainWindow::get_item_stats()
     {
       //1st row : item names
       str.append("<html> <table border=1>""<tr><td colspan = 2></td>");
-      Q_FOREACH(Scene_item* sit, items[i])
+      for(Scene_item* sit : items[i])
       {
         str.append(QString("<td>%1</td>").arg(sit->name()));
       }
@@ -2602,7 +2602,7 @@ QString MainWindow::get_item_stats()
                    .arg(data.categories[j].first));
         titles_limit+=data.categories[j].second;
         str.append(QString("<td> %1 </td>").arg(data.titles.at(title)));
-        Q_FOREACH(Scene_item* sit, items[i])
+        for(Scene_item* sit : items[i])
         {
           str.append(QString("<td>%1</td>").arg(sit->computeStats(title)));
         }
@@ -2610,7 +2610,7 @@ QString MainWindow::get_item_stats()
         for(;title<titles_limit; title++)
         {
           str.append(QString("</tr><tr><td> %1 </td>").arg(data.titles.at(title)));
-          Q_FOREACH(Scene_item* sit, items[i])
+          for(Scene_item* sit : items[i])
           {
             str.append(QString("<td>%1</td>").arg(sit->computeStats(title)));
           }
@@ -2703,7 +2703,7 @@ void MainWindow::colorItems()
                     std::back_inserter(colors_));
 
   std::size_t nb_item = -1;
-  Q_FOREACH(int id, scene->selectionIndices())
+  for(int id : scene->selectionIndices())
   {
     scene->item(id)->setColor(colors_[++nb_item]);
   }
@@ -2715,7 +2715,7 @@ void MainWindow::colorItems()
 void MainWindow::exportStatistics()
 {
   std::vector<Scene_item*> items;
-  Q_FOREACH(int id, getSelectedSceneItemIndices())
+  for(int id : getSelectedSceneItemIndices())
   {
     Scene_item* s_item = scene->item(id);
     items.push_back(s_item);
@@ -2767,10 +2767,10 @@ void MainWindow::propagate_action()
   QAction* sender = qobject_cast<QAction*>(this->sender());
   if(!sender) return;
   QString name = sender->text();
-  Q_FOREACH(Scene::Item_id id, scene->selectionIndices())
+  for(Scene::Item_id id : scene->selectionIndices())
   {
     Scene_item* item = scene->item(id);
-    Q_FOREACH(QAction* action, item->contextMenu()->actions())
+    for(QAction* action : item->contextMenu()->actions())
     {
       if(action->text() == name)
       {
@@ -3163,7 +3163,7 @@ void MainWindow::toggleFullScreen()
   QList<QDockWidget *> dockWidgets = findChildren<QDockWidget *>();
   if(visibleDockWidgets.isEmpty())
   {
-    Q_FOREACH(QDockWidget * dock, dockWidgets)
+    for(QDockWidget * dock : dockWidgets)
     {
       if(dock->isVisible())
       {
@@ -3174,7 +3174,7 @@ void MainWindow::toggleFullScreen()
   }
   else
   {
-    Q_FOREACH(QDockWidget * dock, visibleDockWidgets){
+    for(QDockWidget * dock : visibleDockWidgets){
       dock->show();
     }
     visibleDockWidgets.clear();
@@ -3538,7 +3538,7 @@ void SubViewer::changeEvent(QEvent *event)
     if(isMaximized())
     {
       QMenu* menu = mw->findChild<QMenu*>("menuView");
-      Q_FOREACH(QAction* action, viewMenu->actions())
+      for(QAction* action : viewMenu->actions())
       {
         menu->addAction(action);
       }
@@ -3556,7 +3556,7 @@ void SubViewer::changeEvent(QEvent *event)
     else
     {
       QMenu* menu = mw->findChild<QMenu*>("menuView");
-      Q_FOREACH(QAction* action, viewMenu->actions())
+      for(QAction* action : viewMenu->actions())
       {
         menu->removeAction(action);
       }
@@ -3605,10 +3605,10 @@ void MainWindow::test_all_actions()
 {
   int nb_items = scene->numberOfEntries();
   selectSceneItem(0);
-  Q_FOREACH(PluginNamePair pnp, plugins)
+  for(PluginNamePair pnp : plugins)
   {
     Polyhedron_demo_plugin_interface* plugin = pnp.first;
-    Q_FOREACH(QAction* action, plugin->actions()){
+    for(QAction* action : plugin->actions()){
       if(plugin->applicable(action)){
         qDebug()<<"Testing "<<pnp.second<<"and "<<action->text()<<" on";
         qDebug()<<scene->item(scene->mainSelectionIndex())->name()<<"...";
diff --git a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp
index f72ebe5a7bd1..2d02ea43c88a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp
@@ -398,7 +398,7 @@ class Q_DECL_EXPORT Scene_aabb_plane_item : public Scene_plane_item
 
     FT diag = scene_diag();
     std::vector<SM_Tree*> closed_sm_trees;
-    Q_FOREACH(SM_Tree *sm_tree, sm_trees->values())
+    for(SM_Tree *sm_tree : sm_trees->values())
       if(!(is_signed && !CGAL::is_closed(*qobject_cast<Scene_surface_mesh_item*>(sm_trees->key(sm_tree))->polyhedron())))
         closed_sm_trees.push_back(sm_tree);
 #ifndef CGAL_LINKED_WITH_TBB
@@ -1063,7 +1063,7 @@ public Q_SLOTS:
   }
   void uncheckActions()
   {
-   Q_FOREACH(QAction* action, _actions)
+    for(QAction* action : _actions)
     if(action->isChecked())
     {
       action->setChecked(false);
@@ -1129,11 +1129,11 @@ public Q_SLOTS:
 
 Polyhedron_demo_cut_plugin::~Polyhedron_demo_cut_plugin()
 {
-  Q_FOREACH(Facet_sm_tree *tree, facet_sm_trees.values())
+  for(Facet_sm_tree *tree : facet_sm_trees.values())
   {
     delete tree;
   }
-    Q_FOREACH(Edge_sm_tree *tree, edge_sm_trees.values())
+  for(Edge_sm_tree *tree : edge_sm_trees.values())
     {
       delete tree;
     }
@@ -1182,7 +1182,7 @@ void Polyhedron_demo_cut_plugin::init(QMainWindow* mainWindow,
   QActionGroup *group = new QActionGroup(mainWindow);
   group->setExclusive(true);
 
-  Q_FOREACH(QAction *action, _actions)
+  for(QAction *action : _actions)
   {
     action->setActionGroup(group);
     action->setCheckable(true);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp
index 5f9eeed58388..979453ec2af6 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp
@@ -42,7 +42,7 @@ class DoTreesIntersectplugin:
   {
     if(scene->selectionIndices().size() <2)
       return false;
-    Q_FOREACH(Scene::Item_id i, scene->selectionIndices())
+    for(Scene::Item_id i : scene->selectionIndices())
     {
       if(! qobject_cast<Scene_surface_mesh_item*>(scene->item(i)))
         return false;
@@ -76,7 +76,7 @@ private Q_SLOTS:
   void start()
   {
     QApplication::setOverrideCursor(Qt::WaitCursor);
-    Q_FOREACH(Scene::Item_id i, scene->selectionIndices())
+    for(Scene::Item_id i : scene->selectionIndices())
     {
       Scene_surface_mesh_item* item=qobject_cast<Scene_surface_mesh_item*>(scene->item(i));
       if (!CGAL::is_triangle_mesh(*item->face_graph()))
@@ -96,7 +96,7 @@ private Q_SLOTS:
       group_item = nullptr;});
 
     scene->addItem(group_item);
-    Q_FOREACH(Scene::Item_id i, scene->selectionIndices())
+    for(Scene::Item_id i : scene->selectionIndices())
     {
       Scene_surface_mesh_item* item=qobject_cast<Scene_surface_mesh_item*>(scene->item(i));
       connect(item, &Scene_surface_mesh_item::aboutToBeDestroyed,
@@ -147,7 +147,7 @@ public Q_SLOTS:
   {
     if(items.empty())
       return;
-    Q_FOREACH(Scene_movable_sm_item* item, items)
+    for(Scene_movable_sm_item* item : items)
       item->setColor(QColor(Qt::green));
 
     CGAL::Three::Viewer_interface* viewer = static_cast<CGAL::Three::Viewer_interface*>(
@@ -158,7 +158,7 @@ public Q_SLOTS:
 
     std::size_t mesh_id = 0;
     std::size_t sel_id = 0;
-    Q_FOREACH(Scene_movable_sm_item* item, items)
+    for(Scene_movable_sm_item* item : items)
     {
       if(item == sel_item)
       {
@@ -168,7 +168,7 @@ public Q_SLOTS:
       ++mesh_id;
     }
     mesh_id = 0;
-    Q_FOREACH(Scene_movable_sm_item* item, items)
+    for(Scene_movable_sm_item* item : items)
     {
       if(mesh_id == sel_id)
       {
@@ -251,7 +251,7 @@ public Q_SLOTS:
 
     std::size_t mesh_id = 0;
     std::size_t sel_id = 0;
-    Q_FOREACH(Scene_movable_sm_item* item, items)
+    for(Scene_movable_sm_item* item : items)
     {
       if(item == sel_item)
       {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index a1b29fd5689d..563885a376ce 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -359,7 +359,7 @@ class Polyhedron_demo_alpha_wrap_3_plugin
     if(scene->selectionIndices().empty())
       return false;
 
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       if(!qobject_cast<Scene_polygon_soup_item*>(scene->item(index)) &&
          !qobject_cast<Scene_surface_mesh_item*>(scene->item(index)) &&
@@ -540,7 +540,7 @@ public Q_SLOTS:
     Segments segments;
     Points points;
 
-    Q_FOREACH(int index, this->scene->selectionIndices())
+    for(int index : this->scene->selectionIndices())
     {
       // ---
       Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(this->scene->item(index));
@@ -765,7 +765,7 @@ public Q_SLOTS:
     QApplication::restoreOverrideCursor();
     QApplication::setOverrideCursor(Qt::BusyCursor);
 
-    Q_FOREACH(int index, this->scene->selectionIndices())
+    for(int index : this->scene->selectionIndices())
     {
       Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(this->scene->item(index));
       if(sm_item != nullptr)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Camera_position/Camera_positions_list.cpp b/Polyhedron/demo/Polyhedron/Plugins/Camera_position/Camera_positions_list.cpp
index c015e8f495c4..016aaa796adc 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Camera_position/Camera_positions_list.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Camera_position/Camera_positions_list.cpp
@@ -64,7 +64,7 @@ void Camera_positions_list::on_downButton_pressed()
 
 void Camera_positions_list::on_minusButton_pressed()
 {
-  Q_FOREACH(QModelIndex index,
+  for(QModelIndex index :
             m_listView->selectionModel()->selectedIndexes()) {
     m_model->removeRows(index.row(), 1);
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Convex_decomposition/Nef_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Convex_decomposition/Nef_plugin.cpp
index 73d7a944d064..c5b7a5c04c88 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Convex_decomposition/Nef_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Convex_decomposition/Nef_plugin.cpp
@@ -52,7 +52,7 @@ void init(QMainWindow* mw,
             << actionIntersection
             << actionDifference
             << actionMinkowskiSum;
-    Q_FOREACH(QAction * action, _actions)
+    for(QAction * action : _actions)
       action->setProperty("subMenuName",
                           "Boolean Operations");
     _actions<< actionConvexDecomposition;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/Implicit_function_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/Implicit_function_io_plugin.cpp
index 7159c3c38394..628362efd0b8 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/Implicit_function_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/Implicit_function_io_plugin.cpp
@@ -118,7 +118,7 @@ load_function() const
 
   // Add loaded functions to the dialog
   int i=0;
-  Q_FOREACH( Implicit_function_interface* f, functions_ )
+  for( Implicit_function_interface* f : functions_ )
   {
     ui.functionList->insertItem(i++,f->name());
   }
@@ -159,7 +159,7 @@ load_function_plugins()
     if( !pluginsDir.cd(newDir) ) return;
   }
 
-  Q_FOREACH (QString fileName, pluginsDir.entryList(QDir::Files))
+  for (QString fileName : pluginsDir.entryList(QDir::Files))
   {
     if ( fileName.contains("plugin") && QLibrary::isLibrary(fileName) )
     {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
index 2f61bd32aa82..3573ec548f3c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
@@ -73,7 +73,7 @@ class Polyhedron_demo_polylines_io_plugin :
       return qobject_cast<Scene_polylines_item*>(scene->item(
                                                    scene->mainSelectionIndex()));
     bool all_polylines_selected = true;
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       if (!qobject_cast<Scene_polylines_item*>(scene->item(index)))
       {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_2/Mesh_2_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_2/Mesh_2_plugin.cpp
index f289245a996f..6c9e1f0a8f42 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_2/Mesh_2_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_2/Mesh_2_plugin.cpp
@@ -169,7 +169,7 @@ class Polyhedron_demo_mesh_2_plugin :
 
   bool applicable(QAction*) const
   {
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       //if one polyhedron is found in the selection, it's fine
       if (qobject_cast<Scene_polylines_item*>(scene->item(index)))
@@ -229,8 +229,8 @@ class Polyhedron_demo_mesh_2_plugin :
   {
     // extract seeds
     std::vector<Kernel::Point_3> seeds;
-    Q_FOREACH(Scene_points_with_normal_item* points_item, points_items)
-      Q_FOREACH(Point_set_3<Kernel>::Index it, *points_item->point_set())
+    for(Scene_points_with_normal_item* points_item : points_items)
+      for(Point_set_3<Kernel>::Index it : *points_item->point_set())
         seeds.push_back(points_item->point_set()->point(it));
 
     // Create dialog box
@@ -275,8 +275,8 @@ class Polyhedron_demo_mesh_2_plugin :
     double constant_coordinate =
       polylines_items.back()->polylines.back().back()[constant_coordinate_index];
     try{
-      Q_FOREACH(Scene_polylines_item* polylines_item, polylines_items)
-        Q_FOREACH(const std::vector<Kernel::Point_3>& points,
+      for(Scene_polylines_item* polylines_item : polylines_items)
+        for(const std::vector<Kernel::Point_3>& points :
                     polylines_item->polylines)
           cdt.insert_constraint(points.begin(),points.end());
     }catch(std::runtime_error&)
@@ -357,10 +357,10 @@ class Polyhedron_demo_mesh_2_plugin :
   {
     int res=-1;
     Kernel::Point_3 ref = polylines_items.front()->polylines.front().front();
-    Q_FOREACH(Scene_polylines_item* polylines_item, polylines_items)
-      Q_FOREACH(const std::vector<Kernel::Point_3>& points,
+    for(Scene_polylines_item* polylines_item : polylines_items)
+      for(const std::vector<Kernel::Point_3>& points :
                   polylines_item->polylines)
-        Q_FOREACH(const Kernel::Point_3& pt, points)
+        for(const Kernel::Point_3& pt : points)
         {
           int nbe=0, candidate=-1;
           for (int i=0; i<3; ++i)
@@ -377,8 +377,8 @@ class Polyhedron_demo_mesh_2_plugin :
           }
         }
     if (res==-1) return res;
-    Q_FOREACH(Scene_points_with_normal_item* points_item, points_items)
-      Q_FOREACH(Point_set_3<Kernel>::Index pt, *points_item->point_set())
+    for(Scene_points_with_normal_item* points_item : points_items)
+      for(Point_set_3<Kernel>::Index pt : *points_item->point_set())
       if (points_item->point_set()->point(pt)[res]!=ref[res])
           return -1;
     return res;
@@ -394,7 +394,7 @@ public Q_SLOTS:
     std::vector<Scene_points_with_normal_item*> points_items;
     double inf = std::numeric_limits<double>::infinity();
     CGAL::Three::Scene_interface::Bbox bbox(inf,inf,inf,-inf,-inf,-inf);
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       Scene_polylines_item* polylines_item =
         qobject_cast<Scene_polylines_item*>(scene->item(index));
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
index ca542e80e26d..27a258882ba2 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
@@ -313,7 +313,7 @@ class Io_image_plugin :
       // Look for action just after "Load..." action
       QAction* actionAfterLoad = nullptr;
       for(QList<QAction*>::iterator it_action = menuFileActions.begin(),
-          end = menuFileActions.end() ; it_action != end ; ++ it_action ) //Q_FOREACH( QAction* action, menuFileActions)
+          end = menuFileActions.end() ; it_action != end ; ++ it_action ) //for( QAction* action : menuFileActions)
       {
         if(NULL != *it_action && (*it_action)->text().contains("Load..."))
         {
@@ -594,7 +594,7 @@ public Q_SLOTS:
 
   void connectNewViewer(QObject* o)
   {
-    Q_FOREACH(Controls c, group_map.values())
+    for(Controls c : group_map.values())
     {
       o->installEventFilter(c.x_item);
       o->installEventFilter(c.y_item);
@@ -827,7 +827,7 @@ public Q_SLOTS:
     x_item->setColor(QColor("red"));
     y_item->setColor(QColor("green"));
     z_item->setColor(QColor("blue"));
-    Q_FOREACH(CGAL::QGLViewer* viewer, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer* viewer : CGAL::QGLViewer::QGLViewerPool())
     {
       viewer->installEventFilter(x_item);
       viewer->installEventFilter(y_item);
@@ -927,7 +927,7 @@ private Q_SLOTS:
     CGAL::Three::Scene_group_item* group_item = qobject_cast<CGAL::Three::Scene_group_item*>(sender());
     if(group_item)
     {
-      Q_FOREACH(CGAL::Three::Scene_item* key, group_map.keys())
+      for(CGAL::Three::Scene_item* key : group_map.keys())
       {
         if(group_map[key].group == group_item)
         {
@@ -966,7 +966,7 @@ private Q_SLOTS:
       group_map.remove(img_item);
 
       QList<int> deletion;
-      Q_FOREACH(Scene_interface::Item_id id, group->getChildren())
+      for(Scene_interface::Item_id id : group->getChildren())
       {
         Scene_item* child = group->getChild(id);
         group->unlockChild(child);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_implicit_function_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_implicit_function_plugin.cpp
index 16bffeffa22b..7f31055cf59c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_implicit_function_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_implicit_function_plugin.cpp
@@ -104,7 +104,7 @@ init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* scene_interface, Mes
     // Look for action just after "Load..." action
     QAction* actionAfterLoad = NULL;
     for ( QList<QAction*>::iterator it_action = menuFileActions.begin(),
-         end = menuFileActions.end() ; it_action != end ; ++ it_action ) //Q_FOREACH( QAction* action, menuFileActions)
+         end = menuFileActions.end() ; it_action != end ; ++ it_action ) //for( QAction* action : menuFileActions)
     {
       if ( NULL != *it_action && (*it_action)->text().contains("Load") )
       {
@@ -139,7 +139,7 @@ load_function() const
 
   // Add loaded functions to the dialog
   int i=0;
-  Q_FOREACH( Implicit_function_interface* f, functions_ )
+  for( Implicit_function_interface* f : functions_ )
   {
     ui.functionList->insertItem(i++,f->name());
   }
@@ -180,7 +180,7 @@ load_function_plugins()
     if( !pluginsDir.cd(newDir) ) return;
   }
 
-  Q_FOREACH (QString fileName, pluginsDir.entryList(QDir::Files))
+  for (QString fileName : pluginsDir.entryList(QDir::Files))
   {
     if ( fileName.contains("plugin") && QLibrary::isLibrary(fileName) )
     {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
index a146afb007a0..f490c0da691c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
@@ -992,7 +992,7 @@ meshing_done(Meshing_thread* thread)
     .arg(source_item_name_)
     .arg(thread->time());
 
-  Q_FOREACH( QString param, thread->parameters_log() )
+  for( QString param : thread->parameters_log() )
   {
     str.append(QString("( %1 )<br>").arg(param));
   }
@@ -1042,7 +1042,7 @@ treat_result(Scene_item& source_item,
     result_item->setRenderingMode(source_item.renderingMode());
     result_item->set_data_item(&source_item);
 
-    Q_FOREACH(int ind, scene->selectionIndices()) {
+    for(int ind : scene->selectionIndices()) {
       scene->item(ind)->setVisible(false);
     }
     const Scene_interface::Item_id index = scene->mainSelectionIndex();
@@ -1056,7 +1056,7 @@ treat_result(Scene_item& source_item,
     Scene_surface_mesh_item* new_item = new Scene_surface_mesh_item;
     CGAL::facets_in_complex_3_to_triangle_mesh(result_item->c3t3(), *new_item->face_graph());
     new_item->setName(tr("%1 [Remeshed]").arg(source_item_name_));
-    Q_FOREACH(int ind, scene->selectionIndices()) {
+    for(int ind : scene->selectionIndices()) {
       scene->item(ind)->setVisible(false);
     }
     const Scene_interface::Item_id index = scene->mainSelectionIndex();
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Offset_meshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Offset_meshing_plugin.cpp
index 8b0e0bab57b5..d4a5dc15ffba 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Offset_meshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Offset_meshing_plugin.cpp
@@ -512,7 +512,7 @@ offset_meshing()
   Scene_polylines_item* polylines_item = nullptr;
 
   bool mesh_or_soup_item_found = false;
-  Q_FOREACH(Scene_interface::Item_id index, scene->selectionIndices())
+  for(Scene_interface::Item_id index : scene->selectionIndices())
   {
     if(!mesh_or_soup_item_found)
     {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Optimization_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Optimization_plugin.cpp
index 3c0a56a87f38..6454a6f4cde2 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Optimization_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Optimization_plugin.cpp
@@ -561,7 +561,7 @@ optimization_done(Optimizer_thread* thread)
                   .arg(thread->time())
                   .arg(translate(return_code));
 
-  Q_FOREACH( QString param, thread->parameters_log() )
+  for( QString param : thread->parameters_log() )
   {
     str.append(QString("( %1 )<br>").arg(param));
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Volume_plane.h b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Volume_plane.h
index d54505abb1b5..6dbe84a28e81 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Volume_plane.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Volume_plane.h
@@ -515,7 +515,7 @@ void Volume_plane<T>::draw(Viewer_interface *viewer) const {
   updateCurrentCube();
   if(cur_cube != currentCube)
   {
-    Q_FOREACH(CGAL::QGLViewer*v, CGAL::QGLViewer::QGLViewerPool()){
+    for(CGAL::QGLViewer*v : CGAL::QGLViewer::QGLViewerPool()){
       v->setProperty("need_update", true);
     }
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Clip_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Clip_polyhedron_plugin.cpp
index 02af6fc0272c..a78cd1150bae 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Clip_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Clip_polyhedron_plugin.cpp
@@ -157,7 +157,7 @@ if it has a closed contour on the clipping polyhedron. Otherwise, it will be lef
   }
   bool applicable(QAction*) const
   {
-    Q_FOREACH(int id, scene->selectionIndices())
+    for(int id : scene->selectionIndices())
     {
       if(qobject_cast<Scene_surface_mesh_item*>(scene->item(id)))
         return true;
@@ -396,7 +396,7 @@ public Q_SLOTS:
       }
     }
     //apply the clipping function
-    Q_FOREACH(Scene_item* item, polyhedra)
+    for(Scene_item* item : polyhedra)
     {
       Scene_surface_mesh_item *sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
       if(!ui_widget.do_not_modify_CheckBox->isChecked() && CGAL::Polygon_mesh_processing::does_self_intersect(*sm_item->face_graph()))
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
index d9fbc5a094b4..1a0a9e34f35e 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
@@ -126,7 +126,7 @@ class Polyhedron_demo_affine_transform_plugin
 
     QList<QLineEdit*> lineEdits;
     lineEdits << ui.lineEditA << ui.lineEditX << ui.lineEditY << ui.lineEditZ;
-    Q_FOREACH(QLineEdit* widget, lineEdits)
+    for(QLineEdit* widget : lineEdits)
     {
       QSizePolicy sp_retain = widget->sizePolicy();
       sp_retain.setRetainSizeWhenHidden(true);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Basic_generator_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Basic_generator_plugin.cpp
index 4397d8f9362a..51355a07b5fd 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Basic_generator_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Basic_generator_plugin.cpp
@@ -128,7 +128,7 @@ public :
             this, SLOT(on_actionPolyline_triggered()));
     _actions << actionPolyline;
 
-    Q_FOREACH(QAction* action, _actions)
+    for(QAction* action : _actions)
     {
       menu->addAction(action);
     }
@@ -689,7 +689,7 @@ void Basic_generator_plugin::generatePoints()
     return;
   }
 
-  Q_FOREACH(QString s, list)
+  for(QString s : list)
   {
     if(!s.isEmpty())
     {
@@ -754,7 +754,7 @@ void Basic_generator_plugin::generateLines()
     msgBox->exec();
     return;
   }
-  Q_FOREACH(QString s, list)
+  for(QString s : list)
   {
     if(!s.isEmpty())
     {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
index a2dd4f791397..aa32c5005941 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Clipping_box_plugin.cpp
@@ -144,7 +144,7 @@ void Clipping_box_plugin::clipbox()
   item->setName("Clipping box");
   item->setRenderingMode(FlatPlusEdges);
 
-  Q_FOREACH(CGAL::QGLViewer* viewer, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* viewer : CGAL::QGLViewer::QGLViewerPool())
     viewer->installEventFilter(item);
 
   scene->addItem(item);
@@ -182,7 +182,7 @@ void Clipping_box_plugin::do_clip(bool b)
   typedef CGAL::Epick Kernel;
   typedef CGAL::Polyhedron_3<Kernel> Mesh;
 
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
   {
     CGAL::Three::Viewer_interface* viewer =
         qobject_cast<CGAL::Three::Viewer_interface*>(v);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Create_bbox_mesh_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Create_bbox_mesh_plugin.cpp
index 1fafba9d82c6..ee591ddc04ae 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Create_bbox_mesh_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Create_bbox_mesh_plugin.cpp
@@ -29,7 +29,7 @@ class Create_bbox_mesh_plugin :
   bool applicable(QAction*) const
   {
     bool at_least_one_non_empty = false;
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       Scene_item* item = scene->item(index);
       if(!item->isFinite())
@@ -108,7 +108,7 @@ bbox(bool extended)
   int item_count = 0;
   QString name;
 
-  Q_FOREACH(int index, scene->selectionIndices())
+  for(int index : scene->selectionIndices())
   {
     Scene_item* item = scene->item(index);
     if(item->isFinite() && !item->isEmpty())
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Create_obb_mesh_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Create_obb_mesh_plugin.cpp
index 7ca4e060a92f..cae392b0c943 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Create_obb_mesh_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Create_obb_mesh_plugin.cpp
@@ -37,7 +37,7 @@ class Create_obb_mesh_plugin
   bool applicable(QAction*) const
   {
     bool at_least_one_non_empty = false;
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       Scene_item* item = scene->item(index);
       if(!item->isFinite())
@@ -144,7 +144,7 @@ void
 Create_obb_mesh_plugin::
 gather_mesh_points(std::vector<Point_3>& points)
 {
-  Q_FOREACH(int index, scene->selectionIndices())
+  for(int index : scene->selectionIndices())
   {
     Scene_item* item = scene->item(index);
 
@@ -247,7 +247,7 @@ obb()
             << std::endl;
 
   QString name;
-  Q_FOREACH(int index, scene->selectionIndices())
+  for(int index : scene->selectionIndices())
   {
     Scene_item* item = scene->item(index);
     if(!item->isEmpty())
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Edit_box_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Edit_box_plugin.cpp
index 29c0e731d3ae..77569a7b810b 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Edit_box_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Edit_box_plugin.cpp
@@ -98,7 +98,7 @@ void Edit_box_plugin::bbox()
           this, SLOT(enableAction()));
   item->setName("Edit box");
   item->setRenderingMode(FlatPlusEdges);
-  Q_FOREACH(CGAL::QGLViewer* viewer, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* viewer : CGAL::QGLViewer::QGLViewerPool())
     viewer->installEventFilter(item);
 
   scene->addItem(item);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Pca_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Pca_plugin.cpp
index 20cce18487c7..2fcecd22abd4 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Pca_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Pca_plugin.cpp
@@ -71,7 +71,7 @@ class Polyhedron_demo_pca_plugin :
               this, SLOT(on_actionFitLine_triggered()));
       _actions << actionFitPlane
                << actionFitLine;
-      Q_FOREACH(QAction* action, _actions)
+      for(QAction* action : _actions)
         action->setProperty("subMenuName", "Principal Component Analysis");
 
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
index cac1c7c3236d..af7ae5a31459 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_edit_box_item.cpp
@@ -289,7 +289,7 @@ Scene_edit_box_item::Scene_edit_box_item(const Scene_interface *scene_interface)
 
   are_buffers_filled = false;
 
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
   {
     v->setMouseTracking(true);
   }
@@ -652,7 +652,7 @@ void Scene_edit_box_item::highlight(Viewer_interface *viewer)
       tc->setCenterSize(d->hl_vertex.size());
       //draw
       d->hl_type = Scene_edit_box_item_priv::VERTEX;
-      Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+      for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
       {
         CGAL::Three::Viewer_interface* viewer =
             static_cast<CGAL::Three::Viewer_interface*>(v);
@@ -681,7 +681,7 @@ void Scene_edit_box_item::highlight(Viewer_interface *viewer)
       ec->setFlatDataSize(d->hl_vertex.size());
       //draw
       d->hl_type = Scene_edit_box_item_priv::EDGE;
-      Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+      for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
       {
         CGAL::Three::Viewer_interface* viewer =
             static_cast<CGAL::Three::Viewer_interface*>(v);
@@ -719,7 +719,7 @@ void Scene_edit_box_item::highlight(Viewer_interface *viewer)
       tc->setFlatDataSize(d->hl_vertex.size());
       //draw
       d->hl_type = Scene_edit_box_item_priv::FACE;
-      Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+      for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
       {
         CGAL::Three::Viewer_interface* viewer =
             static_cast<CGAL::Three::Viewer_interface*>(v);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Degenerated_faces_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Degenerated_faces_plugin.cpp
index b3fa95830f32..7f490dc1f93c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Degenerated_faces_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Degenerated_faces_plugin.cpp
@@ -112,7 +112,7 @@ void Degenerated_faces_plugin::on_actionDegenFaces_triggered()
   QApplication::setOverrideCursor(Qt::WaitCursor);
   bool found = false;
   std::vector<Scene_facegraph_item*> selected_polys;
-  Q_FOREACH(Scene_interface::Item_id index, scene->selectionIndices())
+  for(Scene_interface::Item_id index : scene->selectionIndices())
   {
     Scene_facegraph_item* poly_item =
         qobject_cast<Scene_facegraph_item*>(scene->item(index));
@@ -121,7 +121,7 @@ void Degenerated_faces_plugin::on_actionDegenFaces_triggered()
       selected_polys.push_back(poly_item);
     }
   }
-  Q_FOREACH(Scene_facegraph_item* poly_item, selected_polys)
+  for(Scene_facegraph_item* poly_item : selected_polys)
   {
     Face_graph* pMesh = poly_item->polyhedron();
     std::vector<Face_descriptor> facets;
@@ -174,7 +174,7 @@ void Degenerated_faces_plugin::on_actionDegenEdges_triggered()
   QApplication::setOverrideCursor(Qt::WaitCursor);
   bool found = false;
   std::vector<Scene_facegraph_item*> selected_polys;
-  Q_FOREACH(Scene_interface::Item_id index, scene->selectionIndices())
+  for(Scene_interface::Item_id index : scene->selectionIndices())
   {
     Scene_facegraph_item* poly_item =
         qobject_cast<Scene_facegraph_item*>(scene->item(index));
@@ -183,7 +183,7 @@ void Degenerated_faces_plugin::on_actionDegenEdges_triggered()
       selected_polys.push_back(poly_item);
     }
   }
-  Q_FOREACH(Scene_facegraph_item* poly_item, selected_polys)
+  for(Scene_facegraph_item* poly_item : selected_polys)
   {
     Face_graph* pMesh = poly_item->polyhedron();
     std::vector<edge_descriptor> edges;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Detect_sharp_edges_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Detect_sharp_edges_plugin.cpp
index 38dfc613c253..e8065f1ddb0b 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Detect_sharp_edges_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Detect_sharp_edges_plugin.cpp
@@ -41,7 +41,7 @@ class Polyhedron_demo_detect_sharp_edges_plugin :
   }
 
   bool applicable(QAction*) const {
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       Scene_facegraph_item* item =
         qobject_cast<Scene_facegraph_item*>(scene->item(index));
@@ -82,7 +82,7 @@ void Polyhedron_demo_detect_sharp_edges_plugin::detectSharpEdges(bool input_dial
 
   // Get selected items
   QList<Poly_tuple> polyhedrons;
-  Q_FOREACH(int index, scene->selectionIndices())
+  for(int index : scene->selectionIndices())
   {
     Scene_facegraph_item* item =
       qobject_cast<Scene_facegraph_item*>(scene->item(index));
@@ -113,7 +113,7 @@ void Polyhedron_demo_detect_sharp_edges_plugin::detectSharpEdges(bool input_dial
   QApplication::setOverrideCursor(Qt::WaitCursor);
   QApplication::processEvents();
   std::size_t first_patch = 1;
-  Q_FOREACH(Poly_tuple tuple, polyhedrons)
+  for(Poly_tuple tuple : polyhedrons)
   {
     Scene_facegraph_item* item =
       qobject_cast<Scene_facegraph_item*>(scene->item(tuple.first));
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Engrave_text_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Engrave_text_plugin.cpp
index c45bfdc619e7..dc45cd9ce624 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Engrave_text_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Engrave_text_plugin.cpp
@@ -556,8 +556,8 @@ public Q_SLOTS:
     float pxmin(8000),pxmax(-8000),
         pymin(8000), pymax(-8000);
 
-    Q_FOREACH(QPolygonF poly, polys){
-      Q_FOREACH(QPointF pf, poly)
+    for(QPolygonF poly : polys){
+      for(QPointF pf : poly)
       {
         EPICK::Point_2 v = EPICK::Point_2(pf.x(),-pf.y());
         if(v.x() < pxmin)
@@ -570,9 +570,9 @@ public Q_SLOTS:
           pymax = v.y();
       }
     }
-      Q_FOREACH(QPolygonF poly, polys){
+    for(QPolygonF poly : polys){
         polylines.push_back(std::vector<EPICK::Point_2>());
-        Q_FOREACH(QPointF pf, poly)
+        for(QPointF pf : poly)
         {
           EPICK::Point_2 v = EPICK::Point_2(pf.x(),-pf.y());
           polylines.back().push_back(EPICK::Point_2(v.x()*(xmax-xmin)/(pxmax-pxmin) +xmin ,
@@ -705,7 +705,7 @@ public Q_SLOTS:
     CGAL::Bbox_2 bbox= CGAL::bbox_2(local_polylines.front().begin(),
                                     local_polylines.front().end(),
                                     EPICK());
-    Q_FOREACH(const std::vector<EPICK::Point_2>& points,
+    for(const std::vector<EPICK::Point_2>& points :
               local_polylines)
     {
       bbox += CGAL::bbox_2(points.begin(), points.end(), EPICK());
@@ -965,4 +965,3 @@ public Q_SLOTS:
   Navigation* navigation = nullptr;
 };
 #include "Engrave_text_plugin.moc"
-
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
index da2089147d30..f459ae84894b 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
@@ -91,7 +91,7 @@ public :
   }
   void invalidateOpenGLBuffers() Q_DECL_OVERRIDE
   {
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
     {
       CGAL::Three::Viewer_interface* viewer =
           static_cast<CGAL::Three::Viewer_interface*>(v);
@@ -419,7 +419,7 @@ private Q_SLOTS:
     oliver_queen->manipulatedFrame()->setConstraint(&constraint);
     oliver_queen->setColor(QColor(Qt::green));
     oliver_queen->setName("Extrude item");
-    Q_FOREACH(CGAL::QGLViewer* viewer, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer* viewer : CGAL::QGLViewer::QGLViewerPool())
       viewer->installEventFilter(oliver_queen);
     mw->installEventFilter(oliver_queen);
     scene->addItem(oliver_queen);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Hole_filling_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Hole_filling_plugin.cpp
index 06640c85b9c2..98399be1d54f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Hole_filling_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Hole_filling_plugin.cpp
@@ -109,7 +109,7 @@ public: typedef std::list<Polyline_data> Polyline_data_list;
     get_holes();
     active_hole = polyline_data_list.end();
 
-    Q_FOREACH(CGAL::QGLViewer* viewer, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer* viewer : CGAL::QGLViewer::QGLViewerPool())
     {
       viewer->installEventFilter(this);
     }
@@ -435,7 +435,7 @@ public Q_SLOTS:
       ui_widget.Accept_button->setVisible(true);
       ui_widget.Reject_button->setVisible(true);
 
-      Q_FOREACH( QWidget* w, ui_widget.dockWidgetContents->findChildren<QWidget*>() )
+      for( QWidget* w : ui_widget.dockWidgetContents->findChildren<QWidget*>() )
       { w->setEnabled(false); }
 
       ui_widget.Accept_button->setEnabled(true);
@@ -445,7 +445,7 @@ public Q_SLOTS:
       ui_widget.Accept_button->setVisible(false);
       ui_widget.Reject_button->setVisible(false);
 
-      Q_FOREACH( QWidget* w, ui_widget.dockWidgetContents->findChildren<QWidget*>() )
+      for( QWidget* w : ui_widget.dockWidgetContents->findChildren<QWidget*>() )
       { w->setEnabled(true); }
     }
   }
@@ -882,7 +882,7 @@ void Polyhedron_demo_hole_filling_plugin::on_Fill_from_selection_button() {
     vertices.push_back(target(opposite(b_edges.back(),*poly), *poly));
 
   boost::property_map<Face_graph,CGAL::vertex_point_t>::type vpm = get(CGAL::vertex_point,*poly);
-  Q_FOREACH(fg_vertex_descriptor vh, vertices)
+  for(fg_vertex_descriptor vh : vertices)
   {
     points.push_back(get(vpm,vh));
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 53693c316379..288c59c36276 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -228,7 +228,7 @@ class Polyhedron_demo_isotropic_remeshing_plugin :
 
     bool ok(true), found_poly(false);
 
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       if (!qobject_cast<Scene_facegraph_item*>(scene->item(index)))
         ok = false;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Join_and_split_polyhedra_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Join_and_split_polyhedra_plugin.cpp
index 49e21cc66351..2688c4a80346 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Join_and_split_polyhedra_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Join_and_split_polyhedra_plugin.cpp
@@ -62,7 +62,7 @@ class Polyhedron_demo_join_and_split_polyhedra_plugin:
 
   bool applicable(QAction* a) const
   {
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       if (qobject_cast<Scene_facegraph_item*>(scene->item(index)))
         return true;
@@ -94,7 +94,7 @@ void Polyhedron_demo_join_and_split_polyhedra_plugin::on_actionJoinPolyhedra_tri
     return;
   }
   std::vector<int> indices_to_remove;
-  Q_FOREACH(int index, scene->selectionIndices()) {
+  for(int index : scene->selectionIndices()) {
     if (index == mainSelectionIndex)
       continue;
 
@@ -113,7 +113,7 @@ void Polyhedron_demo_join_and_split_polyhedra_plugin::on_actionJoinPolyhedra_tri
 
   //remove the other items
   std::sort(indices_to_remove.begin(), indices_to_remove.end(), std::greater<int>());
-  Q_FOREACH(int index, indices_to_remove)
+  for(int index : indices_to_remove)
   {
     scene->erase(index);
   }
@@ -137,7 +137,7 @@ bool operator()(const FaceGraph& mesh1, const FaceGraph& mesh2)
 
 void Polyhedron_demo_join_and_split_polyhedra_plugin::on_actionSplitPolyhedra_triggered()
 {
-  Q_FOREACH(int index, scene->selectionIndices()) {
+  for(int index : scene->selectionIndices()) {
     Scene_facegraph_item* item =
       qobject_cast<Scene_facegraph_item*>(scene->item(index));
     if(item)
@@ -203,7 +203,7 @@ void Polyhedron_demo_join_and_split_polyhedra_plugin::on_actionColorConnectedCom
 
   std::set<Scene_facegraph_item*> to_skip;
 
-  Q_FOREACH(int index, scene->selectionIndices())
+  for(int index : scene->selectionIndices())
   {
     Scene_facegraph_item* item =
       qobject_cast<Scene_facegraph_item*>(scene->item(index));
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Mean_curvature_flow_skeleton_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Mean_curvature_flow_skeleton_plugin.cpp
index 6684a48e7b78..81bd34ee9978 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Mean_curvature_flow_skeleton_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Mean_curvature_flow_skeleton_plugin.cpp
@@ -891,7 +891,7 @@ Polyhedron_demo_mean_curvature_flow_skeleton_plugin::createContractedItem(Scene_
 Scene_mcf_item*
 Polyhedron_demo_mean_curvature_flow_skeleton_plugin::getMCFItem()
 {
-  Q_FOREACH(int index, scene->selectionIndices())
+  for(int index : scene->selectionIndices())
   {
     Scene_mcf_item* mcf = qobject_cast<Scene_mcf_item*>(scene->item(index));
     if(mcf)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Orient_soup_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Orient_soup_plugin.cpp
index 7ef5a3f2e585..de23c0ac471c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Orient_soup_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Orient_soup_plugin.cpp
@@ -34,7 +34,7 @@ class Polyhedron_demo_orient_soup_plugin :
             CGAL::Three::Scene_interface* scene_interface,
             Messages_interface* m);
   bool applicable(QAction* action) const {
-    Q_FOREACH(CGAL::Three::Scene_interface::Item_id index, scene->selectionIndices()) {
+    for(CGAL::Three::Scene_interface::Item_id index : scene->selectionIndices()) {
       if(qobject_cast<Scene_polygon_soup_item*>(scene->item(index)))
         return true;
       else
@@ -139,7 +139,7 @@ void set_fcolors(SMesh* smesh, std::vector<CGAL::IO::Color> colors)
 
 void Polyhedron_demo_orient_soup_plugin::orientSM()
 {
-  Q_FOREACH(CGAL::Three::Scene_interface::Item_id index, scene->selectionIndices())
+  for(CGAL::Three::Scene_interface::Item_id index : scene->selectionIndices())
   {
     Scene_polygon_soup_item* item =
       qobject_cast<Scene_polygon_soup_item*>(scene->item(index));
@@ -335,4 +335,3 @@ void Polyhedron_demo_orient_soup_plugin::cleanSoup()
   item->itemChanged();
 }
 #include "Orient_soup_plugin.moc"
-
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp
index 85238d26ff43..61e15f68eb32 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Point_inside_polyhedron_plugin.cpp
@@ -108,7 +108,7 @@ public Q_SLOTS:
     std::vector<Point_inside_smesh*>inside_smesh_testers;
 
     std::vector<Point_set*> point_sets;
-    Q_FOREACH(CGAL::Three::Scene_interface::Item_id id, scene->selectionIndices()) {
+    for(CGAL::Three::Scene_interface::Item_id id : scene->selectionIndices()) {
       Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(scene->item(id));
       if (sm_item){
         inside_smesh_testers.push_back(new Point_inside_smesh(*(sm_item->polyhedron())));
@@ -171,7 +171,7 @@ public Q_SLOTS:
 
     bool found = false;
     // for repaint
-    Q_FOREACH(CGAL::Three::Scene_interface::Item_id id, scene->selectionIndices()) {
+    for(CGAL::Three::Scene_interface::Item_id id : scene->selectionIndices()) {
       Scene_points_with_normal_item* point_item = qobject_cast<Scene_points_with_normal_item*>(scene->item(id));
       if(point_item) {
         found = true;
@@ -196,7 +196,7 @@ public Q_SLOTS:
     //   warning about '*bbox' not being initialized.
     // -- Laurent Rineau, 2014/10/30
 
-    Q_FOREACH(CGAL::Three::Scene_interface::Item_id id, scene->selectionIndices()) {
+    for(CGAL::Three::Scene_interface::Item_id id : scene->selectionIndices()) {
       Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(scene->item(id));
       if(sm_item) {
         if(!bbox) {
@@ -254,7 +254,7 @@ public Q_SLOTS:
 private Q_SLOTS:
   void resetGeneratedPoints(QObject* o)
   {
-    Q_FOREACH(Scene_points_with_normal_item* item , generated_points)
+    for(Scene_points_with_normal_item* item  : generated_points)
     if(item == o)
     {
       generated_points.removeAll(item);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Polyhedron_stitching_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Polyhedron_stitching_plugin.cpp
index 7244edde87ef..6bedf046e855 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Polyhedron_stitching_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Polyhedron_stitching_plugin.cpp
@@ -52,7 +52,7 @@ class Polyhedron_demo_polyhedron_stitching_plugin :
   }
 
   bool applicable(QAction*) const {
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       if ( qobject_cast<Scene_surface_mesh_item*>(scene->item(index)) )
         return true;
@@ -120,7 +120,7 @@ void Polyhedron_demo_polyhedron_stitching_plugin::on_actionDetectBorders_trigger
 
 void Polyhedron_demo_polyhedron_stitching_plugin::on_actionDetectBorders_triggered()
 {
-  Q_FOREACH(int index, scene->selectionIndices()){
+  for(int index : scene->selectionIndices()){
     on_actionDetectBorders_triggered<Scene_surface_mesh_item>(index);
   }
 }
@@ -142,7 +142,7 @@ void Polyhedron_demo_polyhedron_stitching_plugin::on_actionStitchBorders_trigger
 
 void Polyhedron_demo_polyhedron_stitching_plugin::on_actionStitchBorders_triggered()
 {
-  Q_FOREACH(int index, scene->selectionIndices()){
+  for(int index : scene->selectionIndices()){
     on_actionStitchBorders_triggered<Scene_surface_mesh_item>(index);
   }
 }
@@ -177,14 +177,14 @@ void Polyhedron_demo_polyhedron_stitching_plugin::on_actionMergeReversibleCCs_tr
 
 void Polyhedron_demo_polyhedron_stitching_plugin::on_actionStitchByCC_triggered()
 {
-  Q_FOREACH(int index, scene->selectionIndices()){
+  for(int index : scene->selectionIndices()){
     on_actionStitchByCC_triggered<Scene_surface_mesh_item>(index);
   }
 }
 
 void Polyhedron_demo_polyhedron_stitching_plugin::on_actionMergeReversibleCCs_triggered()
 {
-  Q_FOREACH(int index, scene->selectionIndices()){
+  for(int index : scene->selectionIndices()){
     on_actionMergeReversibleCCs_triggered<Scene_surface_mesh_item>(index);
   }
 }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Remesh_planar_patches_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Remesh_planar_patches_plugin.cpp
index 1ea142c0795f..067f2c8fe721 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Remesh_planar_patches_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Remesh_planar_patches_plugin.cpp
@@ -88,7 +88,7 @@ class Polyhedron_demo_remesh_planar_patches_plugin :
     if (scene->selectionIndices().size() == 1)
       return qobject_cast<Scene_surface_mesh_item*>(scene->item(scene->mainSelectionIndex()));
 
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       if (qobject_cast<Scene_surface_mesh_item*>(scene->item(index)))
         return true;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
index 5ecc8921433e..c4c68388d8c6 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
@@ -273,7 +273,7 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionSnapBorders_triggered()
   {
     std::vector<double> tolerances/* = 0.005, 0.0125, 0.025, 0.05, 0.07 */;
     bool ok;
-    Q_FOREACH(QString tol_text, ui.tolerances->text().split(","))
+    for(QString tol_text : ui.tolerances->text().split(","))
     {
       double d = tol_text.toDouble(&ok);
       if (ok)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Scene_facegraph_item_k_ring_selection.h b/Polyhedron/demo/Polyhedron/Plugins/PMP/Scene_facegraph_item_k_ring_selection.h
index 46d4c02ac9d6..e25a9ee15103 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Scene_facegraph_item_k_ring_selection.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Scene_facegraph_item_k_ring_selection.h
@@ -112,7 +112,7 @@ class SCENE_FACEGRAPH_ITEM_K_RING_SELECTION_EXPORT Scene_facegraph_item_k_ring_s
   void setEditMode(bool b)
   {
     is_edit_mode = b;
-    Q_FOREACH(CGAL::QGLViewer* viewer,CGAL::QGLViewer::QGLViewerPool()){
+    for(CGAL::QGLViewer* viewer :CGAL::QGLViewer::QGLViewerPool()){
       //for highlighting
       viewer->setMouseTracking(true);
     }
@@ -132,7 +132,7 @@ class SCENE_FACEGRAPH_ITEM_K_RING_SELECTION_EXPORT Scene_facegraph_item_k_ring_s
     is_ready_to_paint_select = true;
     is_lasso_active = false;
 
-    Q_FOREACH(CGAL::QGLViewer* viewer,CGAL::QGLViewer::QGLViewerPool()){
+    for(CGAL::QGLViewer* viewer :CGAL::QGLViewer::QGLViewerPool()){
       viewer->installEventFilter(this);
       viewer->setMouseBindingDescription(Qt::Key_D, Qt::ShiftModifier, Qt::LeftButton, "(When in selection plugin) Removes the clicked primitive from the selection. ");
     }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp
index f4134ecfd150..b1ffae6e97bd 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp
@@ -1201,7 +1201,7 @@ void Polyhedron_demo_selection_plugin::on_actionSelfIntersection_triggered()
   CGAL::Three::Three::CursorScopeGuard guard(tmp_cursor);
   bool found = false;
   std::vector<Scene_face_graph_item*> selected_polys;
-  Q_FOREACH(Scene_interface::Item_id index, scene->selectionIndices())
+  for(Scene_interface::Item_id index : scene->selectionIndices())
   {
     Scene_face_graph_item* poly_item =
         qobject_cast<Scene_face_graph_item*>(scene->item(index));
@@ -1210,7 +1210,7 @@ void Polyhedron_demo_selection_plugin::on_actionSelfIntersection_triggered()
       selected_polys.push_back(poly_item);
     }
   }
-  Q_FOREACH(Scene_face_graph_item* poly_item, selected_polys)
+  for(Scene_face_graph_item* poly_item : selected_polys)
   {
     Face_graph* mesh = poly_item->face_graph();
     std::vector<std::pair<Face_descriptor, Face_descriptor> > faces;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Surface_intersection_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Surface_intersection_plugin.cpp
index 036cdc430261..968a270f7064 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Surface_intersection_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Surface_intersection_plugin.cpp
@@ -109,7 +109,7 @@ public Q_SLOTS:
 void Polyhedron_demo_intersection_plugin::intersectionSurfaces()
 {
   Scene_face_graph_item* itemA = nullptr;
-  Q_FOREACH(CGAL::Three::Scene_interface::Item_id index, scene->selectionIndices())
+  for(CGAL::Three::Scene_interface::Item_id index : scene->selectionIndices())
   {
     Scene_face_graph_item* itemB =
       qobject_cast<Scene_face_graph_item*>(scene->item(index));
@@ -175,7 +175,7 @@ void Polyhedron_demo_intersection_plugin::intersectionPolylines()
       std::pair<std::size_t, std::size_t> >  Poly_intersection;
 
   Scene_polylines_item* itemA = nullptr;
-  Q_FOREACH(CGAL::Three::Scene_interface::Item_id index, scene->selectionIndices())
+  for(CGAL::Three::Scene_interface::Item_id index : scene->selectionIndices())
   {
     Scene_polylines_item* itemB =
       qobject_cast<Scene_polylines_item*>(scene->item(index));
@@ -196,11 +196,11 @@ void Polyhedron_demo_intersection_plugin::intersectionPolylines()
       QElapsedTimer time;
       time.start();
       std::vector<Polyline_3> polyA, polyB;
-      Q_FOREACH(const Polyline_3& poly, itemA->polylines)
+      for(const Polyline_3& poly : itemA->polylines)
       {
         polyA.push_back(poly);
       }
-      Q_FOREACH(const Polyline_3& poly, itemB->polylines)
+      for(const Polyline_3& poly : itemB->polylines)
       {
         polyB.push_back(poly);
       }
@@ -208,7 +208,7 @@ void Polyhedron_demo_intersection_plugin::intersectionPolylines()
       std::vector<Poly_intersection> poly_intersections;
       PMP::internal::compute_polylines_polylines_intersection(polyA, polyB,std::back_inserter(poly_intersections) , Kernel());
 
-      Q_FOREACH(const Poly_intersection& inter, poly_intersections)
+      for(const Poly_intersection& inter : poly_intersections)
       {
         Kernel::Segment_3 segA(polyA[inter.first.first][inter.first.second], polyA[inter.first.first][inter.first.second +1]);
         Kernel::Segment_3 segB(polyB[inter.second.first][inter.second.second], polyB[inter.second.first][inter.second.second+1]);
@@ -293,7 +293,7 @@ void Polyhedron_demo_intersection_plugin::intersectionSurfacePolyline()
   time.start();
   Scene_face_graph_item::Face_graph tm = *itemA->face_graph();
   std::vector<face_descriptor> Afaces;
-  Q_FOREACH(face_descriptor f, faces(tm))
+  for(face_descriptor f : faces(tm))
   {
     Afaces.push_back(f);
   }
@@ -302,7 +302,7 @@ void Polyhedron_demo_intersection_plugin::intersectionSurfacePolyline()
 
   std::vector<Polyline_3> polylines;
   //Polyline_3 polyline;
-  Q_FOREACH(const Polyline_3 &pol, itemB->polylines)
+  for(const Polyline_3 &pol : itemB->polylines)
   {
     polylines.push_back(pol);
   }
@@ -313,7 +313,7 @@ void Polyhedron_demo_intersection_plugin::intersectionSurfacePolyline()
                                                      std::back_inserter(poly_intersections),
                                                      CGAL::parameters::default_values());
 
-  Q_FOREACH(const Poly_intersection& inter, poly_intersections)
+  for(const Poly_intersection& inter : poly_intersections)
   {
     Kernel::Segment_3 segment(polylines[inter.second.first][inter.second.second], polylines[inter.second.first][inter.second.second+1]);
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Triangulate_facets_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Triangulate_facets_plugin.cpp
index 6b85c6fb45be..cd91bd1a6eb1 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Triangulate_facets_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Triangulate_facets_plugin.cpp
@@ -65,7 +65,7 @@ class Polyhedron_demo_triangulate_facets_plugin :
   }
 
   bool applicable(QAction*) const {
-    Q_FOREACH(CGAL::Three::Scene_interface::Item_id index, scene->selectionIndices()){
+    for(CGAL::Three::Scene_interface::Item_id index : scene->selectionIndices()){
       if ( qobject_cast<Scene_surface_mesh_item*>(scene->item(index)) )
         return true;
       if ( qobject_cast<Scene_polyhedron_selection_item*>(scene->item(index)))
@@ -80,7 +80,7 @@ public Q_SLOTS:
    void triangulate()
    {
       QApplication::setOverrideCursor(Qt::WaitCursor);
-    Q_FOREACH(CGAL::Three::Scene_interface::Item_id index, scene->selectionIndices())
+      for(CGAL::Three::Scene_interface::Item_id index : scene->selectionIndices())
     {
       Scene_surface_mesh_item* sm_item =
           qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Alpha_shape_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Alpha_shape_plugin.cpp
index 429781b20001..572f2a698a08 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Alpha_shape_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Alpha_shape_plugin.cpp
@@ -363,7 +363,7 @@ void Scene_alpha_shape_item::invalidateOpenGLBuffers()
 {
   getTriangleContainer(0)->reset_vbos(ALL);
   setBuffersFilled(false);
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
   {
     Viewer_interface* viewer = static_cast<Viewer_interface*>(v);
     if(viewer == NULL)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Merge_point_sets_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Merge_point_sets_plugin.cpp
index 5a5c58b41537..694ce765c3b0 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Merge_point_sets_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Merge_point_sets_plugin.cpp
@@ -39,7 +39,7 @@ class Polyhedron_demo_merge_point_sets_plugin :
     if (scene->selectionIndices().size() < 2)
       return false;
 
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
       {
         if ( qobject_cast<Scene_points_with_normal_item*>(scene->item(index)) )
           return true;
@@ -62,7 +62,7 @@ void Polyhedron_demo_merge_point_sets_plugin::on_actionMergePointSets_triggered(
     = qobject_cast<Scene_points_with_normal_item*>(scene->item(mainSelectionIndex));
 
   QList<int> indices_to_remove;
-  Q_FOREACH(int index, scene->selectionIndices())
+  for(int index : scene->selectionIndices())
     {
       if (index == mainSelectionIndex)
         continue;
@@ -82,7 +82,7 @@ void Polyhedron_demo_merge_point_sets_plugin::on_actionMergePointSets_triggered(
   scene->itemChanged(mainSelectionIndex);
 
   //remove the other items
-  Q_FOREACH(int index, indices_to_remove)
+  for(int index : indices_to_remove)
   {
     scene->erase(index);
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_selection_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_selection_plugin.cpp
index 634ae8c699b1..9281c202af22 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_selection_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_selection_plugin.cpp
@@ -54,7 +54,7 @@ using namespace CGAL::Three;
 
 Viewer_interface* getActiveViewer()
 {
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
   {
     if(v->hasFocus())
     {
@@ -606,7 +606,7 @@ class Polyhedron_demo_point_set_selection_plugin :
     shift_pressing = false;
     ctrl_pressing = false;
 
-    Q_FOREACH(CGAL::QGLViewer* viewer, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer* viewer : CGAL::QGLViewer::QGLViewerPool())
     {
       viewer->installEventFilter(this);
     }
@@ -952,7 +952,7 @@ public Q_SLOTS:
       connect(edit_box, &Scene_edit_box_item::aboutToBeDestroyed,
               this, &Polyhedron_demo_point_set_selection_plugin::reset_editbox);
       scene->addItem(edit_box);
-      Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool()){
+      for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool()){
         v->installEventFilter(edit_box);
       }
       connect(mw, SIGNAL(newViewerCreated(QObject*)),
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
index e79f43e02d6b..5648125b774a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_shape_detection_plugin.cpp
@@ -481,7 +481,7 @@ class Polyhedron_demo_point_set_shape_detection_plugin :
       ++index;
     }
 
-    Q_FOREACH(Scene_group_item* group, groups)
+    for(Scene_group_item* group : groups)
       if(group && group->getChildren().empty())
         delete group;
 
@@ -841,7 +841,7 @@ class Polyhedron_demo_point_set_shape_detection_plugin :
 
       ++index;
     }
-    Q_FOREACH(Scene_group_item* group, groups)
+    for(Scene_group_item* group : groups)
       if(group && group->getChildren().empty())
         delete group;
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_to_mesh_distance_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_to_mesh_distance_plugin.cpp
index 68b777f9ab89..ca915ab64cb8 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_to_mesh_distance_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Point_set_to_mesh_distance_plugin.cpp
@@ -133,7 +133,7 @@ class Point_set_to_mesh_distance_plugin :
       return false;
     Scene_surface_mesh_item* sm = nullptr;
     Scene_points_with_normal_item* pn = nullptr;
-    Q_FOREACH(Scene_interface::Item_id i,scene->selectionIndices())
+    for(Scene_interface::Item_id i :scene->selectionIndices())
     {
       if(!sm)
         sm = qobject_cast<Scene_surface_mesh_item*>(scene->item(i));
@@ -203,7 +203,7 @@ private Q_SLOTS:
   {
     Scene_surface_mesh_item* sm = nullptr;
     Scene_points_with_normal_item* pn = nullptr;
-    Q_FOREACH(Scene_interface::Item_id i,scene->selectionIndices())
+    for(Scene_interface::Item_id i :scene->selectionIndices())
     {
       if(!sm)
         sm = qobject_cast<Scene_surface_mesh_item*>(scene->item(i));
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Register_point_sets_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Register_point_sets_plugin.cpp
index 037e8510daf6..70f44f0c3dc6 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Register_point_sets_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Register_point_sets_plugin.cpp
@@ -125,7 +125,7 @@ class Polyhedron_demo_register_point_sets_plugin :
   {
     std::vector<Scene_points_with_normal_item*> items;
 
-    Q_FOREACH(int index, scene->selectionIndices())
+    for(int index : scene->selectionIndices())
     {
       Scene_points_with_normal_item* item =
         qobject_cast<Scene_points_with_normal_item*>(scene->item(index));
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp
index 87bb50fd96fe..9b1ff6006722 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Subdivision_methods/Subdivision_methods_plugin.cpp
@@ -48,7 +48,7 @@ class Polyhedron_demo_subdivision_methods_plugin :
                << actionCatmullClark
                << actionSqrt3
                << actionDooSabin;
-      Q_FOREACH(QAction* action, _actions)
+      for(QAction* action : _actions)
         action->setProperty("subMenuName", "3D Surface Subdivision Methods");
       autoConnectActions();
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp
index 429572694813..eb9be7db96ed 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Offset_meshing_plugin.cpp
@@ -437,7 +437,7 @@ class Polyhedron_demo_offset_meshing_plugin :
       return false;
     }
 
-    Q_FOREACH(CGAL::Three::Scene_interface::Item_id index, scene->selectionIndices())
+    for(CGAL::Three::Scene_interface::Item_id index : scene->selectionIndices())
     {
       if ( qobject_cast<Scene_surface_mesh_item*>(scene->item(index)) ||
            qobject_cast<Scene_polygon_soup_item*>(scene->item(index)) )
@@ -513,7 +513,7 @@ void Polyhedron_demo_offset_meshing_plugin::offset_meshing()
 
   bool mesh_or_soup_item_found = false;
 
-  Q_FOREACH(CGAL::Three::Scene_interface::Item_id index, scene->selectionIndices())
+  for(CGAL::Three::Scene_interface::Item_id index : scene->selectionIndices())
   {
     if (!mesh_or_soup_item_found)
     {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Parameterization_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Parameterization_plugin.cpp
index fffd332a8322..fc3ab82204f5 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Parameterization_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Parameterization_plugin.cpp
@@ -363,7 +363,7 @@ class Polyhedron_demo_parameterization_plugin :
              << actionMVC
              << actionOTE;
     autoConnectActions();
-    Q_FOREACH(QAction *action, _actions)
+    for(QAction *action : _actions)
       action->setProperty("subMenuName",
                           "Triangulated Surface Mesh Parameterization"
                           );
@@ -396,7 +396,7 @@ class Polyhedron_demo_parameterization_plugin :
         || qobject_cast<Scene_polyhedron_selection_item*>(scene->item(scene->mainSelectionIndex()));
     }
 
-    Q_FOREACH(CGAL::Three::Scene_interface::Item_id id, scene->selectionIndices())
+    for(CGAL::Three::Scene_interface::Item_id id : scene->selectionIndices())
     {
       //if one facegraph is found in the selection, it's fine
       if (qobject_cast<Scene_facegraph_item*>(scene->item(id)))
@@ -432,7 +432,7 @@ public Q_SLOTS:
 
     int id = scene->mainSelectionIndex();
 
-    Q_FOREACH(UVItem* pl, projections)
+    for(UVItem* pl : projections)
     {
       if(pl==nullptr || pl != projections[scene->item(id)])
         continue;
@@ -467,7 +467,7 @@ public Q_SLOTS:
 
   void destroyPolyline(CGAL::Three::Scene_item* item)
   {
-    Q_FOREACH(UVItem* pli, projections)
+    for(UVItem* pli : projections)
     {
       if(projections.key(pli) != item)
         continue;
@@ -506,7 +506,7 @@ public Q_SLOTS:
 void Polyhedron_demo_parameterization_plugin::on_prevButton_pressed()
 {
   int id = scene->mainSelectionIndex();
-  Q_FOREACH(UVItem* pl, projections)
+  for(UVItem* pl : projections)
   {
     if(pl==nullptr
        || pl != projections[scene->item(id)])
@@ -524,7 +524,7 @@ void Polyhedron_demo_parameterization_plugin::on_prevButton_pressed()
 void Polyhedron_demo_parameterization_plugin::on_nextButton_pressed()
 {
   int id = scene->mainSelectionIndex();
-  Q_FOREACH(UVItem* pl, projections)
+  for(UVItem* pl : projections)
   {
     if(pl==nullptr
        || pl != projections[scene->item(id)])
@@ -545,7 +545,7 @@ void Polyhedron_demo_parameterization_plugin::parameterize(const Parameterizatio
   // get active polyhedron
   Scene_facegraph_item* poly_item = nullptr;
   CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
-  Q_FOREACH(CGAL::Three::Scene_interface::Item_id id, scene->selectionIndices())
+  for(CGAL::Three::Scene_interface::Item_id id : scene->selectionIndices())
   {
     poly_item = qobject_cast<Scene_facegraph_item*>(scene->item(id));
     if(!poly_item)
@@ -573,7 +573,7 @@ void Polyhedron_demo_parameterization_plugin::parameterize(const Parameterizatio
   }
   Scene_polyhedron_selection_item* sel_item = nullptr;
   bool is_seamed = false;
-  Q_FOREACH(CGAL::Three::Scene_interface::Item_id id, scene->selectionIndices())
+  for(CGAL::Three::Scene_interface::Item_id id : scene->selectionIndices())
   {
     sel_item = qobject_cast<Scene_polyhedron_selection_item*>(scene->item(id));
     if(!sel_item)
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Scene_polyhedron_shortest_path_item.cpp b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Scene_polyhedron_shortest_path_item.cpp
index b961a47da1d8..f32bef66a0f8 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Scene_polyhedron_shortest_path_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/Scene_polyhedron_shortest_path_item.cpp
@@ -269,7 +269,7 @@ void Scene_polyhedron_shortest_path_item::invalidateOpenGLBuffers()
   compute_bbox();
   setBuffersFilled(false);
   getPointContainer(0)->reset_vbos(ALL);
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
   {
     CGAL::Three::Viewer_interface* viewer = static_cast<CGAL::Three::Viewer_interface*>(v);
     if(viewer == nullptr)
@@ -621,7 +621,7 @@ void Scene_polyhedron_shortest_path_item::initialize(
   d->m_sceneInterface = sceneInterface;
   connect(polyhedronItem, SIGNAL(item_is_about_to_be_changed()), this,
           SLOT(poly_item_changed()));
-  Q_FOREACH(CGAL::QGLViewer* viewer, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* viewer : CGAL::QGLViewer::QGLViewerPool())
     viewer->installEventFilter(this);
   connect(d->m_mainWindow, SIGNAL(newViewerCreated(QObject*)),
           this, SLOT(connectNewViewer(QObject*)));
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/UVProjector.h b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/UVProjector.h
index 4de499eda0f9..fa776d388487 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/UVProjector.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh/UVProjector.h
@@ -47,7 +47,7 @@ class UVProjector:public QWidget
     painter.drawRect(QRect(QPoint(0,0), QPoint(this->width(),this->height())));
 
     painter.setPen(QPen(Qt::black));
-    Q_FOREACH(QPointF p, points)
+    for(QPointF p : points)
     {
      /*Translation(-w/2, -h/2) to recenter the scene, then
       * Scaling then Rotation and finally the Translation
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp
index 3e94a0adea31..9f1c6b3ffb9a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Edit_polyhedron_plugin.cpp
@@ -90,7 +90,7 @@ QList<QAction*> Polyhedron_demo_edit_polyhedron_plugin::actions() const {
   return QList<QAction*>() << actionDeformation;
 }
 bool Polyhedron_demo_edit_polyhedron_plugin::applicable(QAction*) const {
-  Q_FOREACH(CGAL::Three::Scene_interface::Item_id i, scene->selectionIndices())
+  for(CGAL::Three::Scene_interface::Item_id i : scene->selectionIndices())
   {
     if(qobject_cast<Scene_facegraph_item*>(scene->item(i)))
       return true;
@@ -385,7 +385,7 @@ void Polyhedron_demo_edit_polyhedron_plugin::dock_widget_visibility_changed(bool
       else
         selection_item = nullptr;
     }
-    Q_FOREACH(CGAL::Three::Scene_interface::Item_id i , scene->selectionIndices())
+    for(CGAL::Three::Scene_interface::Item_id i  : scene->selectionIndices())
     {
       Scene_facegraph_item* poly_item = qobject_cast<Scene_facegraph_item*>(scene->item(i));
       if (poly_item &&
@@ -499,7 +499,7 @@ Scene_edit_polyhedron_item* edit_item = nullptr;
 bool need_sel(true), need_edit(true);
 
 // find selection_item and edit_item in selection
-  Q_FOREACH(Item_id id, scene->selectionIndices())
+ for(Item_id id : scene->selectionIndices())
   {
     if(need_sel)
     {
@@ -536,9 +536,9 @@ void Polyhedron_demo_edit_polyhedron_plugin::importSelection(Scene_polyhedron_se
 
   //converts the selection in selected points
   QVector<Scene_polyhedron_selection_item::fg_vertex_descriptor> sel_to_import;
-  Q_FOREACH(Scene_polyhedron_selection_item::fg_vertex_descriptor vh, selection_item->selected_vertices)
+  for(Scene_polyhedron_selection_item::fg_vertex_descriptor vh : selection_item->selected_vertices)
     sel_to_import.push_back(vh);
-  Q_FOREACH(Scene_polyhedron_selection_item::fg_edge_descriptor ed, selection_item->selected_edges)
+  for(Scene_polyhedron_selection_item::fg_edge_descriptor ed : selection_item->selected_edges)
   {
     Scene_polyhedron_selection_item::fg_vertex_descriptor vh = source(halfedge(ed, *selection_item->polyhedron()),*selection_item->polyhedron());
     if(!sel_to_import.contains(vh))
@@ -549,7 +549,7 @@ void Polyhedron_demo_edit_polyhedron_plugin::importSelection(Scene_polyhedron_se
       sel_to_import.push_back(vh);
   }
 
-  Q_FOREACH(Scene_polyhedron_selection_item::fg_face_descriptor fh, selection_item->selected_facets)
+  for(Scene_polyhedron_selection_item::fg_face_descriptor fh : selection_item->selected_facets)
   {
     CGAL::Halfedge_around_face_circulator<Scene_facegraph_item::Face_graph> hafc(halfedge(fh, *selection_item->polyhedron()), *selection_item->polyhedron());
     CGAL::Halfedge_around_face_circulator<Scene_facegraph_item::Face_graph> end = hafc;
@@ -561,7 +561,7 @@ void Polyhedron_demo_edit_polyhedron_plugin::importSelection(Scene_polyhedron_se
   }
 
   //makes the selected points ROI
-  Q_FOREACH(Scene_polyhedron_selection_item::fg_vertex_descriptor vh, sel_to_import)
+  for(Scene_polyhedron_selection_item::fg_vertex_descriptor vh : sel_to_import)
   {
     edit_item->insert_roi_vertex(vh);
   }
@@ -571,7 +571,7 @@ void Polyhedron_demo_edit_polyhedron_plugin::importSelection(Scene_polyhedron_se
     selection_item->set_highlighting(false);
   }
   selection_item->setVisible(false);
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
     v->update();
 }
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.cpp b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.cpp
index c4a060696cdb..86cd884ed14e 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Surface_mesh_deformation/Scene_edit_polyhedron_item.cpp
@@ -1137,7 +1137,7 @@ void Scene_edit_polyhedron_item::invalidateOpenGLBuffers()
     }
     getEdgeContainer(2)->reset_vbos(ALL);
     setBuffersFilled(false);
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
     {
       CGAL::Three::Viewer_interface* viewer = static_cast<CGAL::Three::Viewer_interface*>(v);
       if(viewer == nullptr)
diff --git a/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp b/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
index 05f30fa3da64..ce8046a360f1 100644
--- a/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
+++ b/Polyhedron/demo/Polyhedron/Polyhedron_demo.cpp
@@ -134,7 +134,7 @@ Polyhedron_demo::Polyhedron_demo(int& argc, char **argv,
   if(!parser.isSet(no_autostart) && autostart_js.exists()) {
     mainWindow.loadScript(autostart_js);
   }
-  Q_FOREACH(QString filename, parser.positionalArguments()) {
+  for(QString filename : parser.positionalArguments()) {
     mainWindow.open(filename);
   }
 
@@ -155,7 +155,7 @@ bool Polyhedron_demo::notify(QObject* receiver, QEvent* event)
       return QApplication::notify(receiver, event);
     } catch (std::exception &e) {
       // find the mainwindow to spawn an error message
-      Q_FOREACH (QWidget *widget, QApplication::topLevelWidgets()) {
+      for (QWidget *widget : QApplication::topLevelWidgets()) {
         if(MainWindow* mw = qobject_cast<MainWindow*>(widget)) {
           QMessageBox::critical(mw,
                                 tr("Unhandled exception"),
diff --git a/Polyhedron/demo/Polyhedron/Polyhedron_demo_plugin_helper.cpp b/Polyhedron/demo/Polyhedron/Polyhedron_demo_plugin_helper.cpp
index 51a425f57f0e..10d78ec8583f 100644
--- a/Polyhedron/demo/Polyhedron/Polyhedron_demo_plugin_helper.cpp
+++ b/Polyhedron/demo/Polyhedron/Polyhedron_demo_plugin_helper.cpp
@@ -12,7 +12,7 @@ void CGAL::Three::Polyhedron_demo_plugin_helper::addDockWidget(QDockWidget* dock
   dock_widget->setFeatures(QDockWidget::DockWidgetClosable | QDockWidget::DockWidgetFloatable);
   QList<QDockWidget*> dockWidgets = mw->findChildren<QDockWidget*>();
   int counter = 0;
-  Q_FOREACH(QDockWidget* dock, dockWidgets) {
+  for(QDockWidget* dock : dockWidgets) {
     if( mw->dockWidgetArea(dock) != ::Qt::LeftDockWidgetArea ||
         dock == dock_widget )
     { continue; }
@@ -45,7 +45,7 @@ void CGAL::Three::Polyhedron_demo_plugin_helper::autoConnectActions()
     methods << metaObject->method(i);
   }
 
-  Q_FOREACH(QAction* action, actions())
+  for(QAction* action : actions())
   {
     bool success = false;
 //     qDebug("Autoconnecting action \"%s\"...",
diff --git a/Polyhedron/demo/Polyhedron/Scene.cpp b/Polyhedron/demo/Polyhedron/Scene.cpp
index feb5ab6f0024..b3f20ef8ef8b 100644
--- a/Polyhedron/demo/Polyhedron/Scene.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene.cpp
@@ -113,7 +113,7 @@ Scene::replaceItem(Scene::Item_id index, CGAL::Three::Scene_item* item, bool emi
     if(group)
     {
       m_groups.removeAll(index);
-      Q_FOREACH(Item_id id, group->getChildren())
+      for(Item_id id : group->getChildren())
       {
         CGAL::Three::Scene_item* child = group->getChild(id);
         group->unlockChild(child);
@@ -161,7 +161,7 @@ Scene::replaceItem(Scene::Item_id index, CGAL::Three::Scene_item* item, bool emi
     Q_EMIT restoreCollapsedState();
     redraw_model();
     Q_EMIT selectionChanged(index);
-    Q_FOREACH(Scene_item* child, group_children)
+    for(Scene_item* child : group_children)
     {
       erase(item_id(child));
     }
@@ -202,7 +202,7 @@ Scene::erase(Scene::Item_id index)
   item->deleteLater();
   selected_item = -1;
   //re-creates the Scene_view
-  Q_FOREACH(Item_id id, children)
+  for(Item_id id : children)
   {
     organize_items(this->item(id), invisibleRootItem(), 0);
   }
@@ -224,7 +224,7 @@ Scene::erase(QList<int> indices)
     return -1;
   std::unordered_set<CGAL::Three::Scene_item*> to_be_removed;
   int max_index = -1;
-  Q_FOREACH(int index, indices) {
+  for(int index : indices) {
     if(index < 0 || index >= m_entries.size())
       continue;
 
@@ -237,7 +237,7 @@ Scene::erase(QList<int> indices)
     Scene_group_item* group = qobject_cast<Scene_group_item*>(item);
     if(group)
     {
-      Q_FOREACH(Item_id id, group->getChildren())
+      for(Item_id id : group->getChildren())
       {
         CGAL::Three::Scene_item* child = group->getChild(id);
         to_be_removed.insert(child);
@@ -264,7 +264,7 @@ Scene::erase(QList<int> indices)
   clear();
   index_map.clear();
   selected_item = -1;
-  Q_FOREACH(Item_id id, children)
+  for(Item_id id : children)
   {
     organize_items(item(id), invisibleRootItem(), 0);
   }
@@ -296,17 +296,17 @@ void Scene::remove_item_from_groups(Scene_item* item)
 }
 Scene::~Scene()
 {
-  Q_FOREACH(CGAL::QGLViewer* viewer, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* viewer : CGAL::QGLViewer::QGLViewerPool())
   {
     removeViewer(static_cast<CGAL::Three::Viewer_interface*>(viewer));
     viewer->setProperty("is_destroyed", true);
   }
-  Q_FOREACH(QOpenGLVertexArrayObject* vao, vaos.values())
+  for(QOpenGLVertexArrayObject* vao : vaos.values())
   {
     vao->destroy();
     delete vao;
   }
-  Q_FOREACH(CGAL::Three::Scene_item* item_ptr, m_entries)
+  for(CGAL::Three::Scene_item* item_ptr : m_entries)
   {
     item_ptr->deleteLater();
   }
@@ -490,7 +490,7 @@ void Scene::initializeGL(CGAL::Three::Viewer_interface* viewer)
 
 void Scene::s_itemAboutToBeDestroyed(CGAL::Three::Scene_item *rmv_itm)
 {
-  Q_FOREACH(CGAL::Three::Scene_item* item, m_entries)
+  for(CGAL::Three::Scene_item* item : m_entries)
   {
     if(item == rmv_itm)
       item->itemAboutToBeDestroyed(item);
@@ -500,7 +500,7 @@ bool
 Scene::keyPressEvent(QKeyEvent* e)
 {
   bool res = false;
-  Q_FOREACH(int i, selected_items_list)
+  for(int i : selected_items_list)
   {
     CGAL::Three::Scene_item* item = m_entries[i];
     res |= item->keyPressEvent(e);
@@ -542,7 +542,7 @@ void Scene::renderScene(const QList<Scene_interface::Item_id> &items,
   viewer->setCurrentPass(pass);
   viewer->setDepthWriting(writing_depth);
   viewer->setDepthPeelingFbo(fbo);
-  Q_FOREACH(Scene_interface::Item_id index, items)
+  for(Scene_interface::Item_id index : items)
   {
     CGAL::Three::Scene_item& item = *m_entries[index];
     CGAL::Three::Scene_group_item* group =
@@ -586,7 +586,7 @@ void Scene::renderWireScene(const QList<Scene_interface::Item_id> &items,
                             QMap<float, int>& picked_item_IDs,
                             bool with_names)
 {
-  Q_FOREACH(Scene_interface::Item_id index, items)
+  for(Scene_interface::Item_id index : items)
    {
      CGAL::Three::Scene_item& item = *m_entries[index];
      CGAL::Three::Scene_group_item* group =
@@ -651,7 +651,7 @@ void Scene::renderPointScene(const QList<Scene_interface::Item_id> &items,
                              QMap<float, int>& picked_item_IDs,
                              bool with_names)
 {
-  Q_FOREACH(Scene_interface::Item_id index, items)
+  for(Scene_interface::Item_id index : items)
   {
     CGAL::Three::Scene_item& item = *m_entries[index];
     CGAL::Three::Scene_group_item* group =
@@ -691,7 +691,7 @@ void Scene::renderPointScene(const QList<Scene_interface::Item_id> &items,
 
  bool Scene::has_alpha()
  {
-   Q_FOREACH(Scene_item* item, m_entries)
+   for(Scene_item* item : m_entries)
      if(item->alpha() != 1.0f)
        return true;
    return false;
@@ -708,7 +708,7 @@ Scene::draw_aux(bool with_names, CGAL::Three::Viewer_interface* viewer)
     //the item stays opaque
     QList<Item_id> opaque_items;
     QList<Item_id> transparent_items;
-    Q_FOREACH(Item_id id, children)
+    for(Item_id id : children)
     {
       Scene_item* item = m_entries[id];
       Scene_group_item* group = qobject_cast<Scene_group_item*>(item);
@@ -1049,7 +1049,7 @@ Scene::setData(const QModelIndex &index,
         break;
     case ColorColumn:
       if(selectionIndices().contains(item_id(item)))
-        Q_FOREACH(Item_id item_index, selectionIndices())
+        for(Item_id item_index : selectionIndices())
           this->item(item_index)->setColor(value.value<QColor>());
       else
         item->setColor(value.value<QColor>());
@@ -1095,13 +1095,13 @@ bool Scene::dropMimeData(const QMimeData * /*data*/,
     QList<int> groups_children;
 
     //get IDs of all children of selected groups
-    Q_FOREACH(int i, selected_items_list)
+    for(int i : selected_items_list)
     {
       CGAL::Three::Scene_group_item* group =
           qobject_cast<CGAL::Three::Scene_group_item*>(item(i));
       if(group)
       {
-        Q_FOREACH(Item_id id, group->getChildren())
+        for(Item_id id : group->getChildren())
         {
           CGAL::Three::Scene_item* child = item(id);
           groups_children << item_id(child);
@@ -1109,7 +1109,7 @@ bool Scene::dropMimeData(const QMimeData * /*data*/,
       }
     }
     // Insure that children of selected groups will not be added twice
-    Q_FOREACH(int i, selected_items_list)
+    for(int i : selected_items_list)
     {
       if(!groups_children.contains(i))
       {
@@ -1123,7 +1123,7 @@ bool Scene::dropMimeData(const QMimeData * /*data*/,
     bool one_contained = false;
     if(group)
     {
-      Q_FOREACH(int id, selected_items_list)
+      for(int id : selected_items_list)
       {
         if(group->getChildren().contains(id))
         {
@@ -1139,7 +1139,7 @@ bool Scene::dropMimeData(const QMimeData * /*data*/,
       //unless the drop zone is empty, which means the item should be removed from all groups.
       if(!parent.isValid())
       {
-        Q_FOREACH(Scene_item* item, items)
+        for(Scene_item* item : items)
         {
           if(item->parentGroup())
           {
@@ -1152,7 +1152,7 @@ bool Scene::dropMimeData(const QMimeData * /*data*/,
       }
       return false;
     }
-    Q_FOREACH(Scene_item* item, items)
+    for(Scene_item* item : items)
       changeGroup(item, group);
     redraw_model();
     return true;
@@ -1162,7 +1162,7 @@ bool Scene::dropMimeData(const QMimeData * /*data*/,
 bool Scene::sort_lists(QVector<QList<int> >&sorted_lists, bool up)
 {
   QVector<int> group_found;
-  Q_FOREACH(int i, selectionIndices())
+  for(int i : selectionIndices())
   {
     Scene_item* item = this->item(i);
     if(item->has_group == 0)
@@ -1359,7 +1359,7 @@ QItemSelection Scene::createSelection(int i)
 QItemSelection Scene::createSelection(QList<int> is)
 {
     QItemSelection sel;
-    Q_FOREACH(int i, is)
+    for(int i : is)
       sel.select(index_map.keys(i).at(0),
                  index_map.keys(i).at(4));
     return sel;
@@ -1610,7 +1610,7 @@ Scene::Bbox Scene::bbox() const
 
     bool bbox_initialized = false;
     Bbox bbox = Bbox(0,0,0,0,0,0);
-    Q_FOREACH(CGAL::Three::Scene_item* item, m_entries)
+    for(CGAL::Three::Scene_item* item : m_entries)
     {
         if(item->isFinite() && !item->isEmpty() && item->visible()) {
             if(bbox_initialized) {
@@ -1639,7 +1639,7 @@ void Scene::redraw_model()
     clear();
     index_map.clear();
     //fills the model
-    Q_FOREACH(Item_id id, children)
+    for(Item_id id : children)
     {
         organize_items(m_entries[id], invisibleRootItem(), 0);
     }
@@ -1778,7 +1778,7 @@ void Scene::organize_items(Scene_item* item, QStandardItem* root, int loop)
                 qobject_cast<CGAL::Three::Scene_group_item*>(item);
         if(group)
         {
-          Q_FOREACH(Item_id id, group->getChildren())
+          for(Item_id id : group->getChildren())
           {
             CGAL::Three::Scene_item* child = group->getChild(id);
                 organize_items(child, list.first(), loop+1);
@@ -1832,7 +1832,7 @@ findItem(const CGAL::Three::Scene_interface* scene_interface,
          QString name, Scene_item_name_fn_ptr fn) {
     const Scene* scene = dynamic_cast<const Scene*>(scene_interface);
     if(!scene) return nullptr;
-    Q_FOREACH(CGAL::Three::Scene_item* item, scene->entries()) {
+    for(CGAL::Three::Scene_item* item : scene->entries()) {
        CGAL::Three::Scene_item* ptr = qobject_cast<CGAL::Three::Scene_item*>(metaobj.cast(item));
         if(ptr && ((ptr->*fn)() == name)) return ptr;
     }
@@ -1850,7 +1850,7 @@ findItems(const CGAL::Three::Scene_interface* scene_interface,
     QList<CGAL::Three::Scene_item*> list;
     if(!scene) return list;
 
-    Q_FOREACH(CGAL::Three::Scene_item* item, scene->entries()) {
+    for(CGAL::Three::Scene_item* item : scene->entries()) {
         CGAL::Three::Scene_item* ptr = qobject_cast<CGAL::Three::Scene_item*>(item);
         if(ptr && ((ptr->*fn)() == name)) {
             list << ptr;
@@ -1899,7 +1899,7 @@ void Scene::computeBbox()
 
   bool bbox_initialized = false;
   Bbox bbox = Bbox(0,0,0,0,0,0);
-  Q_FOREACH(CGAL::Three::Scene_item* item, m_entries)
+  for(CGAL::Three::Scene_item* item : m_entries)
   {
     if(item->isFinite() && !item->isEmpty() ) {
       if(bbox_initialized) {
@@ -1920,7 +1920,7 @@ void Scene::computeBbox()
 void Scene::newViewer(Viewer_interface *viewer)
 {
   initGL(viewer);
-  Q_FOREACH(Scene_item* item, m_entries)
+  for(Scene_item* item : m_entries)
   {
     item->newViewer(viewer);
   }
@@ -1936,7 +1936,7 @@ void Scene::removeViewer(Viewer_interface *viewer)
   vaos[viewer]->destroy();
   vaos[viewer]->deleteLater();
   vaos.remove(viewer);
-  Q_FOREACH(Scene_item* item, m_entries)
+  for(Scene_item* item : m_entries)
   {
     item->removeViewer(viewer);
   }
@@ -1965,7 +1965,7 @@ void Scene::initGL(Viewer_interface *viewer)
 }
 
 void Scene::callDraw(){
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
   {
     qobject_cast<Viewer_interface*>(v)->update();
   }
diff --git a/Polyhedron/demo/Polyhedron/Scene.h b/Polyhedron/demo/Polyhedron/Scene.h
index f9d6f90805b5..7c42806b23f2 100644
--- a/Polyhedron/demo/Polyhedron/Scene.h
+++ b/Polyhedron/demo/Polyhedron/Scene.h
@@ -185,7 +185,7 @@ public Q_SLOTS:
   void setSelectedItem(CGAL::Three::Scene_item* item_to_select)
   {
     int i=0;
-    Q_FOREACH(CGAL::Three::Scene_item* item, m_entries)
+    for(CGAL::Three::Scene_item* item : m_entries)
     {
       if (item==item_to_select)
       {
@@ -200,14 +200,14 @@ public Q_SLOTS:
   const QList<int>& setSelectedItemIndices(QList<int> l,
                                            const bool do_emit = true)
   {
-    Q_FOREACH(int i,l)
+    for(int i :l)
     {
        CGAL::Three::Scene_group_item* group =
                qobject_cast<CGAL::Three::Scene_group_item*>(item(i));
        if(group)
        {
          QList<int> list;
-         Q_FOREACH(Item_id id, group->getChildrenForSelection())
+         for(Item_id id : group->getChildrenForSelection())
            list << id;
          l << setSelectedItemIndices(list, false /*do not emit*/);
        }
@@ -223,14 +223,14 @@ public Q_SLOTS:
   const QList<int>& setSelectedItemList(QList<int> l,
                                         const bool do_emit = true)
   {
-    Q_FOREACH(int i,l)
+    for(int i :l)
     {
        CGAL::Three::Scene_group_item* group =
                qobject_cast<CGAL::Three::Scene_group_item*>(item(i));
        if(group)
        {
          QList<int> list;
-         Q_FOREACH(Item_id id, group->getChildrenForSelection())
+         for(Item_id id : group->getChildrenForSelection())
            list << id;
          l << setSelectedItemList(list, false /*do not emit*/);
        }
@@ -373,5 +373,3 @@ class SCENE_EXPORT SceneDelegate : public QItemDelegate
 }; // end class SceneDelegate
 
 #endif // SCENE_H
-
-
diff --git a/Polyhedron/demo/Polyhedron/Scene_find_items.h b/Polyhedron/demo/Polyhedron/Scene_find_items.h
index 9b2cc9b18818..7f7ed1e6da76 100644
--- a/Polyhedron/demo/Polyhedron/Scene_find_items.h
+++ b/Polyhedron/demo/Polyhedron/Scene_find_items.h
@@ -45,7 +45,7 @@ QList<T> findItems(const CGAL::Three::Scene_interface* scene, QString name,
     findItems(scene, reinterpret_cast<T>(0)->staticMetaObject,
               name, fn);
   QList<T> list;
-  Q_FOREACH(CGAL::Three::Scene_item* ptr, void_list) {
+  for(CGAL::Three::Scene_item* ptr : void_list) {
     list << qobject_cast<T>(ptr);
   }
   return list;
@@ -106,7 +106,7 @@ QList<T> findItemsByObjectName(const CGAL::Three::Scene_interface* scene,
 //     scene_findItems(scene, name, fn,
 //                     reinterpret_cast<T>(0)->staticMetaObject());
 //   QList<T> list;
-//   Q_FOREACH(void* ptr, void_list) {
+//   for(void* ptr : void_list) {
 //     list << static_cast<T>(ptr);
 //   }
 //   return list;
diff --git a/Polyhedron/demo/Polyhedron/Scene_group_item.cpp b/Polyhedron/demo/Polyhedron/Scene_group_item.cpp
index b064cf4573f4..e0c382f32f5a 100644
--- a/Polyhedron/demo/Polyhedron/Scene_group_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_group_item.cpp
@@ -91,7 +91,7 @@ void Scene_group_item::update_group_number(Scene_item * new_item, int n)
             qobject_cast<Scene_group_item*>(new_item);
     if(group)
     {
-      Q_FOREACH(Scene_interface::Item_id id, group->getChildren()){
+      for(Scene_interface::Item_id id : group->getChildren()){
 
         update_group_number(getChild(id),n+1);
       }
diff --git a/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp b/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp
index 75bea895cfac..0423a7d99b99 100644
--- a/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.cpp
@@ -905,7 +905,7 @@ void Scene_points_with_normal_item::invalidateOpenGLBuffers()
     getPointContainer(Priv::Shaded_points)->reset_vbos(Scene_item_rendering_helper::ALL);
     getEdgeContainer(0)->reset_vbos(Scene_item_rendering_helper::ALL);
 
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
     {
       CGAL::Three::Viewer_interface* viewer = static_cast<CGAL::Three::Viewer_interface*>(v);
       if(viewer == nullptr)
diff --git a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
index b986582fa00c..ef867028ac1d 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
@@ -1636,7 +1636,7 @@ void Scene_polyhedron_selection_item::selectPath(fg_vertex_descriptor vh)
           return;
         }
       bool found = false;
-      Q_FOREACH(Scene_polyhedron_selection_item_priv::vertex_on_path vop, d->path)
+      for(Scene_polyhedron_selection_item_priv::vertex_on_path vop : d->path)
       {
         if(vop.vertex == vh)
         {
@@ -1843,7 +1843,7 @@ Scene_polyhedron_selection_item::Scene_polyhedron_selection_item(Scene_face_grap
 Scene_polyhedron_selection_item::~Scene_polyhedron_selection_item()
 {
   delete d;
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool()){
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool()){
     CGAL::Three::Viewer_interface* viewer = dynamic_cast<CGAL::Three::Viewer_interface*>(v);
     viewer->setBindingSelect();
   }
@@ -1887,7 +1887,7 @@ void Scene_polyhedron_selection_item::invalidateOpenGLBuffers() {
       getPointContainer(Priv::Temp_points)->reset_vbos(ALL);
       getPointContainer(Priv::Fixed_points)->reset_vbos(ALL);
 
-      Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+      for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
       {
         CGAL::Three::Viewer_interface* viewer =
             static_cast<CGAL::Three::Viewer_interface*>(v);
@@ -1907,14 +1907,14 @@ void Scene_polyhedron_selection_item::invalidateOpenGLBuffers() {
 
 void Scene_polyhedron_selection_item::add_to_selection()
 {
-  Q_FOREACH(fg_edge_descriptor ed, temp_selected_edges)
+  for(fg_edge_descriptor ed : temp_selected_edges)
   {
     selected_edges.insert(ed);
     temp_selected_edges.erase(ed);
   }
   on_Ctrlz_pressed();
   invalidateOpenGLBuffers();
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
     v->update();
   d->tempInstructions("Path added to selection.",
                    "Select two vertices to create the path between them. (1/2)");
@@ -2217,7 +2217,7 @@ void Scene_polyhedron_selection_item::init(Scene_face_graph_item* poly_item, QMa
     redraw();
   });
   d->manipulated_frame = new ManipulatedFrame();
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
     v->installEventFilter(this);
   mw->installEventFilter(this);
   connect(mw, SIGNAL(newViewerCreated(QObject*)),
@@ -2241,12 +2241,12 @@ void Scene_polyhedron_selection_item::selection_changed(bool)
        Three::scene()->item(Three::scene()->mainSelectionIndex())))
     do_bind_select = false;
   if(do_bind_select)
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool()){
+    for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool()){
       CGAL::Three::Viewer_interface* viewer = dynamic_cast<CGAL::Three::Viewer_interface*>(v);
       viewer->setBindingSelect();
     }
     else
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool()){
+      for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool()){
       CGAL::Three::Viewer_interface* viewer = dynamic_cast<CGAL::Three::Viewer_interface*>(v);
       viewer->setNoBinding();
     }
diff --git a/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
index c931ba6da3e2..5a39c029f8a5 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polylines_item.cpp
@@ -568,7 +568,7 @@ void Scene_polylines_item::change_corner_radii(double r) {
           scene->addItem(d->spheres);
           scene->changeGroup(d->spheres, this);
           lockChild(d->spheres);
-          Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+          for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
           {
             d->spheres->gl_initialization(qobject_cast<Viewer_interface*>(v));
           }
diff --git a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
index 49e2da75e659..5dcd7cbc5182 100644
--- a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
@@ -1146,7 +1146,7 @@ void* Scene_surface_mesh_item_priv::get_aabb_tree()
         if(!CGAL::is_triangle(halfedge(f, *sm), *sm))
         {
           EPICK::Vector_3 normal = CGAL::Polygon_mesh_processing::compute_face_normal(f, *sm);
-          Q_FOREACH(EPICK::Triangle_3 triangle, triangulate_primitive(f,normal))
+          for(EPICK::Triangle_3 triangle : triangulate_primitive(f,normal))
           {
             Primitive primitive(triangle, f);
             tree->insert(primitive);
@@ -1306,7 +1306,7 @@ void Scene_surface_mesh_item::invalidate(Gl_data_names name)
     d->flat_vertex_map_ready = false;
   }
   setBuffersFilled(false);
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
   {
     CGAL::Three::Viewer_interface* viewer = static_cast<CGAL::Three::Viewer_interface*>(v);
     if(viewer == nullptr)
@@ -2183,7 +2183,7 @@ void Scene_surface_mesh_item::printAllIds()
         s3(printFaceIds());
     if((s1 && s2 && s3))
     {
-      Q_FOREACH(CGAL::QGLViewer* viewer, CGAL::QGLViewer::QGLViewerPool()){
+      for(CGAL::QGLViewer* viewer : CGAL::QGLViewer::QGLViewerPool()){
         viewer->update();
       }
       return;
@@ -2230,7 +2230,7 @@ void Scene_surface_mesh_item::showVertices(bool b)
     }
     else
     {
-      Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool()){
+      for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool()){
         CGAL::Three::Viewer_interface* viewer = dynamic_cast<CGAL::Three::Viewer_interface*>(v);
         TextRenderer *renderer = viewer->textRenderer();
         renderer->addTextList(d->textVItems);
@@ -2239,7 +2239,7 @@ void Scene_surface_mesh_item::showVertices(bool b)
     }
   else
   {
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool()){
+    for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool()){
       CGAL::Three::Viewer_interface* viewer = dynamic_cast<CGAL::Three::Viewer_interface*>(v);
       TextRenderer *renderer = viewer->textRenderer();
       renderer->removeTextList(d->textVItems);
@@ -2260,7 +2260,7 @@ void Scene_surface_mesh_item::showEdges(bool b)
     }
     else
     {
-      Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool()){
+      for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool()){
         CGAL::Three::Viewer_interface* viewer = dynamic_cast<CGAL::Three::Viewer_interface*>(v);
         TextRenderer *renderer = viewer->textRenderer();
         renderer->addTextList(d->textEItems);
@@ -2270,7 +2270,7 @@ void Scene_surface_mesh_item::showEdges(bool b)
   }
   else
   {
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool()){
+    for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool()){
       CGAL::Three::Viewer_interface* viewer = dynamic_cast<CGAL::Three::Viewer_interface*>(v);
       TextRenderer *renderer = viewer->textRenderer();
       renderer->removeTextList(d->textEItems);
@@ -2291,7 +2291,7 @@ void Scene_surface_mesh_item::showFaces(bool b)
     }
     else
     {
-      Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool()){
+      for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool()){
         CGAL::Three::Viewer_interface* viewer = dynamic_cast<CGAL::Three::Viewer_interface*>(v);
         TextRenderer *renderer = viewer->textRenderer();
         renderer->addTextList(d->textFItems);
@@ -2301,7 +2301,7 @@ void Scene_surface_mesh_item::showFaces(bool b)
   }
   else
   {
-    Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool()){
+    for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool()){
       CGAL::Three::Viewer_interface* viewer = dynamic_cast<CGAL::Three::Viewer_interface*>(v);
       TextRenderer *renderer = viewer->textRenderer();
       renderer->removeTextList(d->textFItems);
diff --git a/Polyhedron/demo/Polyhedron/Scene_textured_surface_mesh_item.cpp b/Polyhedron/demo/Polyhedron/Scene_textured_surface_mesh_item.cpp
index 0985491e4458..d3fdcb2996d5 100644
--- a/Polyhedron/demo/Polyhedron/Scene_textured_surface_mesh_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_textured_surface_mesh_item.cpp
@@ -326,7 +326,7 @@ Scene_textured_surface_mesh_item::selection_changed(bool p_is_selected)
   if(p_is_selected != is_selected)
   {
     is_selected = p_is_selected;
-    Q_FOREACH(CGAL::QGLViewer*v, CGAL::QGLViewer::QGLViewerPool())
+    for(CGAL::QGLViewer*v : CGAL::QGLViewer::QGLViewerPool())
     {
       setBuffersInit(qobject_cast<Vi*>(v), false);
     }
@@ -421,4 +421,3 @@ void Scene_textured_surface_mesh_item::computeElements() const
   setBuffersFilled(true);
   QApplication::restoreOverrideCursor();
 }
-
diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
index cdf64cf32c96..b3bd8575b6a5 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
@@ -1957,7 +1957,7 @@ void Scene_triangulation_3_item::invalidateOpenGLBuffers()
   getEdgeContainer(T3_edges)->reset_vbos(ALL);
   getEdgeContainer(Grid_edges)->reset_vbos(ALL);
 
-  Q_FOREACH(CGAL::QGLViewer* v, CGAL::QGLViewer::QGLViewerPool())
+  for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
   {
     CGAL::Three::Viewer_interface* viewer = static_cast<CGAL::Three::Viewer_interface*>(v);
     if(viewer == NULL)
@@ -2192,4 +2192,3 @@ void Scene_triangulation_3_item::set_cut_edge(bool b)
 }
 
 #include "Scene_triangulation_3_item.moc"
-
diff --git a/Polyhedron/demo/Polyhedron/TextRenderer.cpp b/Polyhedron/demo/Polyhedron/TextRenderer.cpp
index 95dc18463717..1385c57aed62 100644
--- a/Polyhedron/demo/Polyhedron/TextRenderer.cpp
+++ b/Polyhedron/demo/Polyhedron/TextRenderer.cpp
@@ -10,14 +10,14 @@ void TextRenderer::draw(CGAL::Three::Viewer_interface *viewer, const QVector3D&
     QRect rect;
     CGAL::qglviewer::Camera* camera = viewer->camera();
     //Display the items textItems
-    Q_FOREACH(TextListItem* list, textItems)
+    for(TextListItem* list : textItems)
     {
       CGAL::Three::Scene_print_item_interface* item =
       qobject_cast<CGAL::Three::Scene_print_item_interface*>(scene->item(scene->mainSelectionIndex()));
       if( item &&
           item->shouldDisplayIds(list->item())
          ){
-        Q_FOREACH(TextItem* item, list->textList())
+        for(TextItem* item : list->textList())
         {
           CGAL::qglviewer::Vec src(item->position().x(), item->position().y(),item->position().z());
           if(viewer->testDisplayId(src.x, src.y, src.z))
@@ -52,7 +52,7 @@ void TextRenderer::draw(CGAL::Three::Viewer_interface *viewer, const QVector3D&
     }
 
     //Display the local TextItems
-    Q_FOREACH(TextItem* item, local_textItems)
+    for(TextItem* item : local_textItems)
     {
       CGAL::qglviewer::Vec src(item->position().x(), item->position().y(),item->position().z());
       if(item->is_3D())
@@ -110,7 +110,7 @@ void TextRenderer::draw(CGAL::Three::Viewer_interface *viewer, const QVector3D&
 
  void TextRenderer::removeTextList(TextListItem *p_list)
  {
-     Q_FOREACH(TextListItem *list, textItems)
+   for(TextListItem *list : textItems)
          if(list == p_list)
              textItems.removeAll(list);
  }
diff --git a/Polyhedron/demo/Polyhedron/Three.cpp b/Polyhedron/demo/Polyhedron/Three.cpp
index 1d8470387d0f..8e6b8943e15d 100644
--- a/Polyhedron/demo/Polyhedron/Three.cpp
+++ b/Polyhedron/demo/Polyhedron/Three.cpp
@@ -83,7 +83,7 @@ Three::Three()
 
 template<class SceneType>
 SceneType* Three::getSelectedItem(){
- Q_FOREACH(int item_id , scene()->selectionIndices())
+  for(int item_id  : scene()->selectionIndices())
  {
    SceneType* scene_item = qobject_cast<SceneType*>(scene()->item(item_id));
    if(scene_item)
@@ -99,7 +99,7 @@ void Three::addDockWidget(QDockWidget* dock_widget)
 
   QList<QDockWidget*> dockWidgets = mainWindow()->findChildren<QDockWidget*>();
   int counter = 0;
-  Q_FOREACH(QDockWidget* dock, dockWidgets) {
+  for(QDockWidget* dock : dockWidgets) {
     if( mainWindow()->dockWidgetArea(dock) != ::Qt::LeftDockWidgetArea ||
         dock == dock_widget )
     { continue; }
@@ -132,7 +132,7 @@ void Three::autoConnectActions(Polyhedron_demo_plugin_interface *plugin)
     methods << metaObject->method(i);
   }
 
-  Q_FOREACH(QAction* action, plugin->actions())
+  for(QAction* action : plugin->actions())
   {
     bool success = false;
     const QMetaObject* action_metaObject = action->metaObject();
@@ -273,4 +273,3 @@ bool& Three::isLocked()
 {
   return s_is_locked;
 }
-
diff --git a/Polyhedron/demo/Polyhedron/Viewer.cpp b/Polyhedron/demo/Polyhedron/Viewer.cpp
index 53a6f3c86261..ac0ab4fb27f9 100644
--- a/Polyhedron/demo/Polyhedron/Viewer.cpp
+++ b/Polyhedron/demo/Polyhedron/Viewer.cpp
@@ -1631,7 +1631,7 @@ void Viewer_impl::showDistance(QPoint pixel)
                                              QString(" distance: %1").arg(dist), true, font, Qt::red, true);
 
         distance_text.append(centerCoord);
-        Q_FOREACH(TextItem* ti, distance_text)
+        for(TextItem* ti : distance_text)
           textRenderer->addText(ti);
         Q_EMIT(viewer->sendMessage(QString("First point : A(%1,%2,%3), second point : B(%4,%5,%6), distance between them : %7")
                   .arg(APoint.x/scaler.x()-viewer->offset().x)
@@ -1648,7 +1648,7 @@ void Viewer_impl::showDistance(QPoint pixel)
 void Viewer_impl::clearDistancedisplay()
 {
   distance_is_displayed = false;
-  Q_FOREACH(TextItem* ti, distance_text)
+  for(TextItem* ti : distance_text)
   {
     textRenderer->removeText(ti);
     delete ti;

From 3c07d9a59121dbd3736fad06d47d67e38a1a8ead Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 15 Nov 2023 10:05:58 +0000
Subject: [PATCH 0996/1398] Add virtual

---
 Polyhedron/demo/Polyhedron/Scene_c3t3_item.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_c3t3_item.h b/Polyhedron/demo/Polyhedron/Scene_c3t3_item.h
index 834f3527edcd..d0dc4b13bb38 100644
--- a/Polyhedron/demo/Polyhedron/Scene_c3t3_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_c3t3_item.h
@@ -34,7 +34,7 @@ using namespace CGAL::Three;
 
     Scene_c3t3_item(bool is_surface = false);
     Scene_c3t3_item(const C3t3& c3t3, bool is_surface = false);
-    ~Scene_c3t3_item();
+    virtual ~Scene_c3t3_item();
 
     Scene_c3t3_item* clone() const  override;
 
@@ -70,7 +70,7 @@ using namespace CGAL::Three;
     //stats
     QString computeStats(int type)  override;
 
-    void copyProperties(Scene_item *) override;
+    virtual void copyProperties(Scene_item *) override;
 
     CGAL::Three::Scene_item::Header_data header() const override;
     bool has_cnc() const;

From 64c7d45ffb6e75d9884e6321e3ba080d3511c4a5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 15 Nov 2023 12:21:44 +0100
Subject: [PATCH 0997/1398] copy/paste issue

---
 Documentation/doc/resources/1.10.0/BaseDoxyfile.in | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Documentation/doc/resources/1.10.0/BaseDoxyfile.in b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
index e167e47a0406..4818c4493363 100644
--- a/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
@@ -1,4 +1,4 @@
-# Doxyfile 1.9.6
+# Doxyfile 1.10.0
 
 # This file describes the settings to be used by the documentation system
 # doxygen (www.doxygen.org) for a project.
@@ -181,9 +181,9 @@ ALIASES                = "cgal=%CGAL" \
                          "cgalPkgSince{1}=<B>Introduced in:</B> \cgal \1<BR>" \
                          "cgalPkgDependsOn{1}=<B>Depends on:</B> \1 <BR>" \
                          "cgalPkgLicense{1}=<B>License:</B> \1 <BR>" \
-                         "cgalPkgDemo{2}=<B>Windows demo:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
-                         "cgalPkgDemo{4}=<B>Windows demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
-                         "cgalPkgDemo{6}=<B>Windows demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\6\">\5</a><BR><B>Common demo dlls:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/CGAL-demoDLLs.zip\">dlls</a><BR>" \
+                         "cgalPkgDemo{2}=<B>Windows Demo:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a><BR>" \
+                         "cgalPkgDemo{4}=<B>Windows Demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a><BR>" \
+                         "cgalPkgDemo{6}=<B>Windows Demos:</B> <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\2\">\1</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\4\">\3</a>, <a href=\"https://www.cgal.org/demo/${CGAL_CREATED_VERSION_NUM}/\6\">\5</a><BR>" \
                          "cgalPkgDescriptionEnd=" \
                          "cgalModifBegin=\htmlonly <div class=\"CGALModification\"> \endhtmlonly \xrefitem Modification \"Modifications\" \"MODIFICATIONS\"" \
                          "cgalModifEnd=\htmlonly </div> \endhtmlonly \latexonly END MODIFICATIONS \endlatexonly" \

From 826f60c4beec36618f0e4d4a3533e563315e9c41 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 15 Nov 2023 18:51:07 +0200
Subject: [PATCH 0998/1398] Introduced Arr_dcel and fixed Arr_default_dcel

---
 .../ArrangementTypes.h                        |   1 -
 .../Arrangement_on_surface_2.txt              |  63 ++---
 .../Arr_bounded_planar_topology_traits_2.h    |   4 +-
 .../CGAL/Arr_conic_traits_2.h                 |  10 +-
 .../Arrangement_on_surface_2/CGAL/Arr_dcel.h  |  39 +++
 .../CGAL/Arr_default_dcel.h                   |  43 ++-
 .../Arr_non_caching_segment_basic_traits_2.h  |   2 +-
 .../CGAL/Arr_segment_traits_2.h               |   4 +-
 .../CGAL/Arr_spherical_topology_traits_2.h    |   4 +-
 .../CGAL/Arr_unb_planar_topology_traits_2.h   |   4 +-
 .../CGAL/Arrangement_on_surface_2.h           |   4 +-
 .../Arrangement_on_surface_with_history_2.h   |   7 +-
 .../CGAL/Arrangement_with_history_2.h         |   4 +-
 .../Concepts/ArrangementDcelWithRebind.h      |   2 +-
 .../PackageDescription.txt                    |   1 +
 .../Arr_bounded_planar_topology_traits_2.h    |   1 +
 .../include/CGAL/Arr_dcel.h                   |  69 +++++
 .../include/CGAL/Arr_dcel_base.h              |  12 +-
 .../include/CGAL/Arr_default_dcel.h           |  40 +--
 .../include/CGAL/Arr_default_overlay_traits.h |   6 +-
 .../include/CGAL/Arr_extended_dcel.h          | 263 ++++++++----------
 .../CGAL/Arr_unb_planar_topology_traits_2.h   |   1 +
 .../include/CGAL/Arrangement_2.h              |   1 +
 .../include/CGAL/Arrangement_on_surface_2.h   |   2 +-
 .../include/CGAL/Arrangement_with_history_2.h |   2 +
 25 files changed, 317 insertions(+), 272 deletions(-)
 create mode 100644 Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_dcel.h
 create mode 100644 Arrangement_on_surface_2/include/CGAL/Arr_dcel.h

diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementTypes.h b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementTypes.h
index 417ffbd3fd07..ec9e20b6c985 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementTypes.h
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/ArrangementTypes.h
@@ -15,7 +15,6 @@
 
 #include <CGAL/Arrangement_with_history_2.h>
 #include <CGAL/Cartesian.h>
-#include <CGAL/Arr_default_dcel.h>
 #include <CGAL/Arr_segment_traits_2.h>
 #include <CGAL/Arr_linear_traits_2.h>
 #include <CGAL/Arr_polyline_traits_2.h>
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index 4299322e38cd..33d5252ec89f 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -390,7 +390,7 @@ the `Arrangement_2` class template; their description follows.
 
 <UL>
 
-<LI>The `Traits` template-parameter should be instantiated with a
+<LI>The `Traits` template-parameter should be substituted with a
   model of the `ArrangementBasicTraits_2` concept and optionally
   additional geometry traits concepts. A model of the
   `ArrangementBasicTraits_2` concept defines the types of
@@ -415,14 +415,15 @@ the `Arrangement_2` class template; their description follows.
   rational functions. We exemplify the usage of these traits classes
   in Section \ref aos_sec-geom_traits.
 
-<LI>The `Dcel` template-parameter should be instantiated with a class
+<LI>The `Dcel` template-parameter should be substituted with a class
   that models the `ArrangementDcel` concept, which is used to represent
   the topological layout of the arrangement. This parameter is
   substituted with `Arr_default_dcel<Traits>` by default, and
   we use this default value in this and in the following three
-  sections. However, in many applications it is necessary to
-  extend the \dcel features. This is done by substituting the
-  `Dcel` parameter with a different type; see Section \ref arr_ssecex_dcel
+  sections. However, in many applications it is necessary to extend the
+  \dcel features. This is done by substituting the `Dcel` parameter with
+  a different type (typically, a different instance of the
+  `Arr_dcel<>` class template); see Section \ref arr_ssecex_dcel
   for further explanations and examples.
 </UL>
 
@@ -5877,12 +5878,12 @@ applications.
 
 All examples presented so far use the default \dcel; namely, they
 employ the `Arr_default_dcel<Traits>` instance. This is done
-implicitly, as an instance of this class template serves as the
-default parameter for the `Arrangement_2` class template; see Section
-\ref aos_ssec-basic-arr_class. The default \dcel class associates
-points with vertices and \f$x\f$-monotone curves with halfedges, but
-nothing more.  In this section we show how to use alternative
-\dcel types to extend the desired \dcel records.
+implicitly, as this instance of the `Arr_default_dcel` class template
+serves as the default parameter for the `Arrangement_2` class
+template; see Section \ref aos_ssec-basic-arr_class. The default \dcel
+class associates points with vertices and \f$x\f$-monotone curves with
+halfedges, but nothing more.  In this section we show how to use
+alternative \dcel types to extend the desired \dcel records.
 
 <!-- ------------------------------------------------------------------------- -->
 \subsubsection arr_sssecex_dcel_face Extending the DCEL Faces
@@ -6111,17 +6112,17 @@ of arrangements derive from a common ancestor that models the
 geometry-traits concept.} Typically, all three arrangements use the
 same geometry-traits class.
 
-The `overlay()` function template is suitable for
-arrangements that do not store any additional data with their
-\dcel records; namely, arrangements defined using an instance of
-the default \dcel class-template `Arr_default_dcel`. Typically,
-the overlay arrangement in this case does not store extra data with
-its \dcel records as well (or if it does, the additional
-data-fields cannot be computed by the overlay operation). The overlay
-arrangement is equivalent to the arrangement induced by all curves of
-`arr_r` and `arr_b`. Indeed, it is possible to obtain the same result
-using the standard insertion-operations instead, but, as mentioned
-above, this is less efficient.
+The `overlay()` function template is suitable for arrangements that do
+not store any additional data with their \dcel records; namely,
+arrangements defined using the default \dcel, which is the instance
+`Arr_default_dcel<Traits>`. Typically, the overlay arrangement in this
+case does not store extra data with its \dcel records as well. (If it
+does, the additional data-fields cannot be computed by the overlay
+operation in this case.) The overlay arrangement is equivalent to the
+arrangement induced by all curves of `arr_r` and `arr_b`. Indeed, it
+is possible to obtain the same result using the standard
+insertion-operations instead, but, as mentioned above, this is less
+efficient.
 
 <!-- ------------------------------------------------------------------------- -->
 \cgalFigureBegin{aos_figex_overlay,overlay.png}
@@ -6663,15 +6664,15 @@ a file.
 \subsection arr_ssecarr_io_aux_data Arrangements with Auxiliary Data
 <!-- ------------------------------------------------------------------------- -->
 
-\cgalAdvancedBegin
-The inserter and extractor both ignore any auxiliary data stored with
-the arrangement features. Thus, they are ideal for arrangements
-instantiated using the `Arr_default_dcel` class.
-However, as explained in Section \ref arr_ssecex_dcel, one can easily
-extend the arrangement faces by using the `Arr_face_extended_dcel`
-template, or extend all \dcel records by using the `Arr_extended_dcel`
-template. In such cases, it might be crucial that the auxiliary data fields
-are written to the file and read from there.
+\cgalAdvancedBegin The inserter and extractor both ignore any
+auxiliary data stored with the arrangement features. Thus, they are
+ideal for arrangements instantiated using the default \dcel, which is
+the instance `Arr_default_dcel<Traits>`.  However, as explained in
+Section \ref arr_ssecex_dcel, one can easily extend the arrangement
+faces by using the `Arr_face_extended_dcel` template, extend all \dcel
+records by using the `Arr_extended_dcel` template, or use the
+`Arr_dcel` template. In such cases, it might be crucial that the
+auxiliary data fields are written to the file and read from there.
 
 The arrangement package includes the free functions
 `write(arr, os, formatter)`, which writes the arrangement `arr`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h
index f839b4967ef8..ea05170d37f4 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h
@@ -9,13 +9,13 @@ namespace CGAL {
  *
  * The `Arr_bounded_planar_topology_traits_2` template has two parameters:
  * <UL>
- * <LI>The `GeometryTraits_2` template-parameter should be instantiated with
+ * <LI>The `GeometryTraits_2` template-parameter should be substituted with
  * a model of the `ArrangementBasicTraits_2` concept. The traits
  * class defines the types of \f$x\f$-monotone curves and two-dimensional
  * points, namely `ArrangementBasicTraits_2::X_monotone_curve_2` and
  * `ArrangementBasicTraits_2::Point_2`,
  *   respectively, and supports basic geometric predicates on them.
- * <LI>The `Dcel` template-parameter should be instantiated with
+ * <LI>The `Dcel` template-parameter should be substituted with
  * a class that is a model of the `ArrangementDcel` concept. The
  * value of this parameter is by default
  * `Arr_default_dcel<Traits>`.
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
index afe365a3da4e..c8b960c6324b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
@@ -57,17 +57,17 @@ namespace CGAL {
  * algebraic number of degree \f$d\f$ if there exist a polynomial \f$ p\f$ with
  * <I>integer</I> coefficient of degree \f$d\f$ such that \f$p(\alpha) = 0\f$).
  * We therefore require separate representations of the curve
- * coefficients and the point coordinates. The `NtTraits` should be instantiated
+ * coefficients and the point coordinates. The `NtTraits` should be substituted
  * with a class that defines nested `Integer`, `Rational`, and `Algebraic` number
  * types and supports various operations on them, yielding certified computation
  * results (for example, it can convert rational numbers to algebraic numbers
  * and can compute roots of polynomials with integer coefficients).  The other
  * template parameters, `RatKernel` and `AlgKernel` should be geometric kernels
  * instantiated with the `NtTraits::Rational` and `NtTraits::Algebraic` number
- * types, respectively.  It is recommended instantiating the
- * `CORE_algebraic_number_traits` class as the `NtTraits` parameter, with
- * `Cartesian<NtTraits::Rational>` and `Cartesian<NtTraits::Algebraic>`
- * instantiating the two kernel types, respectively.  The number types in this
+ * types, respectively.  It is recommended substituting the
+ * `CORE_algebraic_number_traits` class for the `NtTraits` parameter, and
+ * the `Cartesian<NtTraits::Rational>` and `Cartesian<NtTraits::Algebraic>`
+ * instances for two kernel types, respectively.  The number types in this
  * case are provided by the \core library, with its ability to exactly represent
  * simple algebraic numbers.
  *
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_dcel.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_dcel.h
new file mode 100644
index 000000000000..a86e16116956
--- /dev/null
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_dcel.h
@@ -0,0 +1,39 @@
+namespace CGAL {
+
+/*! \ingroup PkgArrangementOnSurface2DCEL
+ *
+ * The \dcel class used by the `Arrangement_2`,
+ * `Arr_bounded_planar_topology_traits_2`, `Arr_unb_planar_topology_traits_2`
+ * class templates and other templates.  It is parameterized by a geometry
+ * traits type and optionaly by a vertex, halfedge, or face types. By default,
+ * the `Arr_dcel` class template uses the \link
+ * ArrangementBasicTraits_2::Point_2 `Point_2`\endlink and \link
+ * ArrangementBasicTraits_2::X_monotone_curve_2 `X_monotone_curve_2`\endlink
+ * types nested in the traits type to instantiate the vertex and base halfedge
+ * types, respectively. Thus, by default the \dcel only stores the topological
+ * incidence relations and the geometric data attached to vertices and
+ * edges. Any one of the vertex, halfedge, or face types can be
+ * overriden. Notice that if the vertex and halfedge types are overriden, the
+ * traits type is ignored.
+ *
+ * \cgalModels{ArrangementDcelWithRebind}
+ *
+ * \tparam Traits a geometry traits type, which is a model of the
+ *                `ArrangementBasicTraits_2` concept.
+ * \tparam V the vertex type, which is a model of the `ArrangementDcelVertex`
+ *           concept.
+ * \tparam H the halfedge type, which is a model of the
+ *            `ArrangementDcelHalfedge` concept.
+ * \tparam F the face type, which is a model of the `ArrangementDcelFace`
+ *           concept.
+ *
+ * \sa `Arr_dcel_base<V, H, F>`
+ */
+template <typename Traits,
+          typename V = Arr_vertex_base<typename Traits::Point_2>,
+          typename H = Arr_halfedge_base<typename Traits::X_monotone_curve_2>,
+          typename F = Arr_face_base>
+class Arr_dcel : public Arr_dcel_base<V, H, F> {
+};
+
+} /* end namespace CGAL */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_dcel.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_dcel.h
index 453a7f050925..b2dba1ca39e7 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_dcel.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_default_dcel.h
@@ -1,26 +1,25 @@
-
 namespace CGAL {
 
-/*!
-\ingroup PkgArrangementOnSurface2DCEL
-
-The default \dcel class used by the `Arrangement_2` class-template
-is parameterized by a traits class, which is a model of the
-`ArrangementBasicTraits_2` concept. It simply uses the nested
-`Traits::Point_2` and `Traits::X_monotone_curve_2` to instantiate
-the base vertex and halfedge types, respectively. Thus, the default
-\dcel records store no other information, except for the topological
-incidence relations and the geometric data attached to vertices and edges.
-
-\cgalModels{ArrangementDcelWithRebind}
+/*! \ingroup PkgArrangementOnSurface2DCEL
+ *
+ * The default \dcel class used by the `Arrangement_2`,
+ * `Arr_bounded_planar_topology_traits_2`, `Arr_unb_planar_topology_traits_2`
+ * class templates and other templates.  It is parameterized by a geometry
+ * traits type. It uses the \link ArrangementBasicTraits_2::Point_2
+ * `Point_2`\endlink and \link ArrangementBasicTraits_2::X_monotone_curve_2
+ * `X_monotone_curve_2`\endlink types nested in the traits type to instantiate
+ * the vertex and base halfedge types, respectively. Thus, by default the \dcel
+ * only stores the topological incidence relations and the geometric data
+ * attached to vertices and edges.
+ *
+ * \cgalModels{ArrangementDcelWithRebind}
+ *
+ * \tparam Traits a geometry traits type, which is a model of the
+ *                `ArrangementBasicTraits_2` concept.
+ *
+ * \sa `Arr_dcel<Traits, V, H, F>`
+ * \sa `Arr_dcel_base<V, H, F>`
+ */
+template <typename Traits> using Arr_default_dcel = Arr_dcel<Traits>;
 
-\sa `Arr_dcel_base<V,H,F>`
-*/
-template< typename Traits >
-class Arr_default_dcel :
-    public Arr_dcel_base< Arr_vertex_base<typename Traits_::Point_2>,
-                          Arr_halfedge_base<typename Traits_::X_monotone_curve_2>,
-                          Arr_face_base>
-{
-}; /* end Arr_default_dcel */
 } /* end namespace CGAL */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_basic_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_basic_traits_2.h
index e85664bdb761..ab5cf747b7a8 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_basic_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_non_caching_segment_basic_traits_2.h
@@ -16,7 +16,7 @@ that are not provided by the kernel. The kernel is parameterized with a
 number type, which should support the arithmetic operations \f$ +\f$, \f$ -\f$ and
 \f$ \times\f$ in an exact manner in order to avoid robustness problems.
 Using `Cartesian<MP_Float>` or `Cartesian<Gmpz>` are possible
-instantiations for the kernel. Using other (inexact) number types
+substitutions for the kernel. Using other (inexact) number types
 (for example, instantiating the template with
 `Simple_cartesian<double>`) is also possible, at the user's own
 risk.
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_segment_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_segment_traits_2.h
index 9036308edaa9..37a7a6c29bdc 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_segment_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_segment_traits_2.h
@@ -4,10 +4,10 @@ namespace CGAL {
  *
  * The traits class `Arr_segment_traits_2` is a model of the
  * `ArrangementTraits_2` concept, which allows the construction and maintenance
- * of arrangements of line segments. It should be parameterized with a
+ * of arrangements of line segments. It is parameterized with a
  * \cgal-kernel model that is templated in turn with a number type. To avoid
  * numerical errors and robustness problems, the number type should support
- * exact rational arithmetic - that is, the number type should support the
+ * exact rational arithmetic; that is, the number type should support the
  * arithmetic operations \f$ +\f$, \f$ -\f$, \f$ \times\f$ and \f$ \div\f$
  * carried out without loss of precision.
  *
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h
index 5c1775e331f3..680f51d0d494 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h
@@ -9,13 +9,13 @@ namespace CGAL {
  *
  * The `Arr_spherical_topology_traits_2` template has two parameters:
  * <UL>
- * <LI>The `GeometryTraits_2` template-parameter should be instantiated with
+ * <LI>The `GeometryTraits_2` template-parameter should be substituted with
  * a model of the `ArrangementBasicTraits_2` concept. The traits
  * class defines the types of \f$x\f$-monotone curves and two-dimensional
  * points, namely `ArrangementBasicTraits_2::X_monotone_curve_2` and
  * `ArrangementBasicTraits_2::Point_2`,
  *   respectively, and supports basic geometric predicates on them.
- * <LI>The `Dcel` template-parameter should be instantiated with
+ * <LI>The `Dcel` template-parameter should be substituted with
  * a class that is a model of the `ArrangementDcel` concept. The
  * value of this parameter is by default
  * `Arr_default_dcel<Traits>`.
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h
index 06efe81c731a..d8cc5bb046c0 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h
@@ -9,13 +9,13 @@ namespace CGAL {
  *
  * The `Arr_unb_planar_topology_traits_2` template has two parameters:
  * <UL>
- * <LI>The `GeometryTraits_2` template-parameter should be instantiated with
+ * <LI>The `GeometryTraits_2` template-parameter should be substituted with
  * a model of the `ArrangementBasicTraits_2` concept. The traits
  * class defines the types of \f$x\f$-monotone curves and two-dimensional
  * points, namely `ArrangementBasicTraits_2::X_monotone_curve_2` and
  * `ArrangementBasicTraits_2::Point_2`,
  *   respectively, and supports basic geometric predicates on them.
- * <LI>The `Dcel` template-parameter should be instantiated with
+ * <LI>The `Dcel` template-parameter should be substituted with
  * a class that is a model of the `ArrangementDcel` concept. The
  * value of this parameter is by default
  * `Arr_default_dcel<Traits>`.
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
index 5886ce3f19d8..8940d4d93770 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
@@ -16,14 +16,14 @@ namespace CGAL {
 
  * The `Arrangement_on_surface_2` template has two parameters:
  * <UL>
- * <LI>The `GeometryTraits` template-parameter should be instantiated with
+ * <LI>The `GeometryTraits` template-parameter should be substituted with
  * a model of a geometry traits. The minimal requirements are defined by the
  * `ArrangementBasicTraits_2` concept. A model of this concept defines
  * the types of \f$ x\f$-monotone curves and two-dimensional points, namely
  * `ArrangementBasicTraits_2::X_monotone_curve_2` and
  * `ArrangementBasicTraits_2::Point_2`, respectively, and supports basic
  * geometric predicates on them.
- * <LI>The `TopologyTraits` template-parameter should be instantiated with a
+ * <LI>The `TopologyTraits` template-parameter should be substituted with a
  * class that is a model of the `ArrangementTopologyTraits` concept.
  * </UL>
  *
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_with_history_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_with_history_2.h
index a01bb1b19cfc..ba8847d2c603 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_with_history_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_with_history_2.h
@@ -25,16 +25,15 @@ namespace CGAL {
  * The `Arrangement_on_surface_with_history_2` template has two parameters:
  *
  * <UL>
- * <LI>The `GeometryTraits` template-parameter should be instantiated with a
+ * <LI>The `GeometryTraits` template-parameter should be substituted with a
  * model of the `ArrangementTraits_2` concept. The traits class defines the
  * `Curve_2` type, which represents an input curve.  It also defines the types
  * of \f$ x\f$-monotone curves and two-dimensional points, namely
  * `ArrangementTraits_2::X_monotone_curve_2` and
  * `ArrangementTraits_2::Point_2`, respectively, and supports basic
  * geometric predicates on them.
- * <LI>The `Dcel` template-parameter should be instantiated with a class that is
- * a model of the `ArrangementDcelWithRebind` concept. The value of this
- * parameter is by default `Arr_default_dcel<Traits>`.
+ * <LI>The `TopologyTraits` template-parameter should be substituted with a
+ * class that is a model of the `ArrangementTopologyTraits` concept.
  * </UL>
  *
  * \sa `Arrangement_with_history_2<GeometryTraits,Dcel>`
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_with_history_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_with_history_2.h
index 4c6e380b750f..dbd72c15ea5e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_with_history_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_with_history_2.h
@@ -23,13 +23,13 @@ namespace CGAL {
  *
  * The `Arrangement_with_history_2` template has two parameters:
  * <UL>
- * <LI>The `Traits` template-parameter should be instantiated with a model of
+ * <LI>The `Traits` template-parameter should be substituted with a model of
  * the `ArrangementTraits_2` concept. The traits class defines the `Curve_2`
  * type, which represents an input curve.  It also defines the types of \f$
  * x\f$-monotone curves and two-dimensional points, namely
  * `ArrangementTraits_2::X_monotone_curve_2` and `ArrangementTraits_2::Point_2`,
  * respectively, and supports basic geometric predicates on them.
- * <LI>The `Dcel` template-parameter should be instantiated with a class that is
+ * <LI>The `Dcel` template-parameter should be substituted with a class that is
  * a model of the `ArrangementDcelWithRebind` concept. The value of this
  * parameter is by default `Arr_default_dcel<Traits>`.
  * </UL>
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
index f263a1aae0d6..5d1c38474a6d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementDcelWithRebind.h
@@ -12,6 +12,7 @@ Instantiate a dcel class with many different possible types without ad-hoc limit
 
 \cgalHasModelsBegin
 \cgalHasModels{CGAL::Arr_default_dcel<Traits>}
+\cgalHasModels{CGAL::Arr_dcel<Traits,V,H,F>}
 \cgalHasModels{CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>}
 \cgalHasModels{CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>}
 \cgalHasModelsEnd
@@ -48,4 +49,3 @@ Arr_dcel();
 /// @}
 
 }; /* end ArrangementDcelWithRebind */
-
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
index 20dc50a57953..f15213dcdebd 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
@@ -204,6 +204,7 @@ implemented as peripheral classes or as free (global) functions.
 - `CGAL::Arrangement_2::Halfedge`
 - `CGAL::Arrangement_2::Face`
 - `CGAL::Arr_dcel_base<V,H,F>`
+- `CGAL::Arr_dcel<Traits,V,H,F>`
 - `CGAL::Arr_default_dcel<Traits>`
 - `CGAL::Arr_face_extended_dcel<Traits,FData,V,H,F>`
 - `CGAL::Arr_extended_dcel<Traits,VData,HData,FData,V,H,F>`
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
index 4d0d46c8de14..105d379297de 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_bounded_planar_topology_traits_2.h
@@ -26,6 +26,7 @@
  */
 
 #include <CGAL/Arr_tags.h>
+#include <CGAL/Arr_default_dcel.h>
 #include <CGAL/Arr_topology_traits/Arr_planar_topology_traits_base_2.h>
 #include <CGAL/Arr_topology_traits/Arr_bounded_planar_construction_helper.h>
 #include <CGAL/Arr_topology_traits/Arr_bounded_planar_insertion_helper.h>
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_dcel.h b/Arrangement_on_surface_2/include/CGAL/Arr_dcel.h
new file mode 100644
index 000000000000..531bb32b2454
--- /dev/null
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_dcel.h
@@ -0,0 +1,69 @@
+// Copyright (c) 2005,2006,2007,2009,2010,2011 Tel-Aviv University (Israel).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+//
+// Author(s): Ron Wein        <wein@post.tau.ac.il>
+//            Baruch Zukerman <baruchzu@post.tau.ac.il>
+//            Efi Fogel       <efifogel@gmail.com>
+
+#ifndef CGAL_ARR_DCEL_H
+#define CGAL_ARR_DCEL_H
+
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+#include <CGAL/disable_warnings.h>
+
+/*! \file
+ * The definition of the Arr_dcel<Traits> class.
+ */
+
+#include <CGAL/Arr_dcel_base.h>
+
+namespace CGAL {
+
+/*! \class
+ * The arrangement DCEL class.
+ * The Traits parameters corresponds to a geometric traits class, which
+ * defines the Point_2 and X_monotone_curve_2 types.
+ */
+template <typename Traits,
+          typename V = Arr_vertex_base<typename Traits::Point_2>,
+          typename H = Arr_halfedge_base<typename Traits::X_monotone_curve_2>,
+          typename F = Arr_face_base>
+class Arr_dcel : public Arr_dcel_base<V, H, F> {
+public:
+  /*! \struct
+   * An auxiliary structure for rebinding the DCEL with a new traits class.
+   */
+  template <typename T>
+  struct rebind {
+  private:
+    using Pnt = typename T::Point_2;
+    using Xcv = typename T::X_monotone_curve_2;
+    using Rebind_v = typename V::template rebind<Pnt>;
+    using V_other = typename Rebind_v::other;
+    using Rebind_h = typename H::template rebind<Xcv>;
+    using H_other = typename Rebind_h::other;
+
+  public:
+    using other = Arr_dcel<T, V_other, H_other, F>;
+  };
+
+  /*! Default constructor. */
+  Arr_dcel() {}
+
+  /*! Destructor. */
+  virtual ~Arr_dcel() {}
+};
+
+} //namespace CGAL
+
+#include <CGAL/enable_warnings.h>
+
+#endif
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_dcel_base.h b/Arrangement_on_surface_2/include/CGAL/Arr_dcel_base.h
index af2ea182fa74..b0627f38eaeb 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_dcel_base.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_dcel_base.h
@@ -8,8 +8,9 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Ron Wein <wein@post.tau.ac.il>
-//                 (based on old version by: Iddo Hanniel and Oren Nechushtan)
+// Author(s): Ron Wein          <wein@post.tau.ac.il>
+//            Efi Fogel         <efif@post.tau.ac.il>
+//            (based on old version by: Iddo Hanniel and Oren Nechushtan)
 
 #ifndef CGAL_ARR_DCEL_BASE_H
 #define CGAL_ARR_DCEL_BASE_H
@@ -23,11 +24,12 @@
  * peripheral records.
  */
 
-#include <CGAL/basic.h>
-#include <CGAL/Arr_enums.h>
 #include <list>
 #include <map>
-#include <CGAL/N_step_adaptor_derived.h>
+
+#include <CGAL/basic.h>
+#include <CGAL/Arr_enums.h>
+#include <CGAL/iterator.h>
 #include <CGAL/In_place_list.h>
 #include <CGAL/function_objects.h>
 #include <CGAL/Iterator_project.h>
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_default_dcel.h b/Arrangement_on_surface_2/include/CGAL/Arr_default_dcel.h
index ca98dc7ec5f0..feb23717d414 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_default_dcel.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_default_dcel.h
@@ -1,4 +1,4 @@
-// Copyright (c) 2005,2006,2007,2009,2010,2011 Tel-Aviv University (Israel).
+// Copyright (c) 2023 Tel-Aviv University (Israel).
 // All rights reserved.
 //
 // This file is part of CGAL (www.cgal.org).
@@ -8,8 +8,7 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Ron Wein        <wein@post.tau.ac.il>
-//                 Baruch Zukerman <baruchzu@post.tau.ac.il>
+// Author(s): Efi Fogel       <efifogel@gmail.com>
 
 #ifndef CGAL_ARR_DEFAULT_DCEL_H
 #define CGAL_ARR_DEFAULT_DCEL_H
@@ -19,46 +18,19 @@
 #include <CGAL/disable_warnings.h>
 
 /*! \file
- * The definition of the Arr_default_dcel<Traits> class.
+ * The definition of the Arr_default_dcel<Traits> type.
  */
 
-#include <CGAL/Arr_dcel_base.h>
+#include <CGAL/Arr_dcel.h>
 
 namespace CGAL {
 
-/*! \class
- * The default arrangement DCEL class.
+/*! The default arrangement DCEL type.
  * The Traits parameters corresponds to a geometric traits class, which
  * defines the Point_2 and X_monotone_curve_2 types.
  */
-template <class Traits_>
-class Arr_default_dcel :
-  public Arr_dcel_base<Arr_vertex_base<typename Traits_::Point_2>,
-                       Arr_halfedge_base<typename Traits_::X_monotone_curve_2>,
-                       Arr_face_base>
-{
-public:
-
-  /*! \struct
-   * An auxiliary structure for rebinding the DCEL with a new traits class.
-   */
-  template<typename T>
-  struct rebind
-  {
-    typedef Arr_default_dcel<T> other;
-  };
-
-  /*! Default constructor. */
-  Arr_default_dcel()
-  {}
-
-  /*! Destructor. */
-  virtual ~Arr_default_dcel()
-  {}
-};
+template <typename Traits> using Arr_default_dcel = Arr_dcel<Traits>;
 
 } //namespace CGAL
 
-#include <CGAL/enable_warnings.h>
-
 #endif
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_default_overlay_traits.h b/Arrangement_on_surface_2/include/CGAL/Arr_default_overlay_traits.h
index f70b4dcb1fb0..56efabb2a441 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_default_overlay_traits.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_default_overlay_traits.h
@@ -8,8 +8,9 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Ron Wein <wein@post.tau.ac.il>
-//                 Baruch Zukerman <baruchzu@post.tau.ac.il>
+// Author(s): Ron Wein          <wein@post.tau.ac.il>
+//            Baruch Zukerman   <baruchzu@post.tau.ac.il>
+//            Efi Fogel         <efif@post.tau.ac.il>
 
 #ifndef CGAL_ARR_DEFAULT_OVERLAY_TRAITS_H
 #define CGAL_ARR_DEFAULT_OVERLAY_TRAITS_H
@@ -23,7 +24,6 @@
  * Definition of default overlay-traits classes.
  */
 
-#include <CGAL/Arr_default_dcel.h>
 #include <CGAL/Arr_extended_dcel.h>
 #include <CGAL/Surface_sweep_2/Arr_default_overlay_traits_base.h>
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_extended_dcel.h b/Arrangement_on_surface_2/include/CGAL/Arr_extended_dcel.h
index dc863fe57e85..fd958718c691 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_extended_dcel.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_extended_dcel.h
@@ -8,8 +8,8 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Ron Wein    <wein@post.tau.ac.il>
-//                 Efi Fogel   <efif@post.tau.ac.il>
+// Author(s): Ron Wein    <wein@post.tau.ac.il>
+//            Efi Fogel   <efif@post.tau.ac.il>
 
 #ifndef CGAL_ARR_EXTENDED_DCEL_H
 #define CGAL_ARR_EXTENDED_DCEL_H
@@ -26,142 +26,115 @@
 
 namespace CGAL {
 
-/*!
- * \class
+/*! \class
  * An extended DCEL vertex with auxiliary data field.
  */
-template <class VertexBase_, typename VertexData_>
-class Arr_extended_vertex : public VertexBase_
-{
-  typedef Arr_extended_vertex<VertexBase_, VertexData_>  Self;
-  typedef VertexBase_                                    Base;
+template <typename VertexBase, typename VertexData>
+class Arr_extended_vertex : public VertexBase {
+  using Vertex_base = VertexBase;
+  using Vertex_data = VertexData;
+
+  using Self = Arr_extended_vertex<Vertex_base, Vertex_data>;
 
 public:
-  typedef VertexData_                                     Data;
+  typedef Vertex_data                                    Data;
 
 private:
-
-  Data       m_data;       // The auxiliary data field.
+  Data m_data;       // The auxiliary data field.
 
 public:
-
   /*! Get the auxiliary data (const version). */
-  const Data& data () const
-  {
-    return (m_data);
-  }
+  const Data& data() const { return m_data; }
 
   /*! Get the auxiliary data (non-const version). */
-  Data& data ()
-  {
-    return (m_data);
-  }
+  Data& data() { return m_data; }
 
   /*! Set the auxiliary data. */
-  void set_data (const Data& data)
-  {
-    m_data = data;
-  }
+  void set_data(const Data& data) { m_data = data; }
 
   /*! Assign from another vertex. */
-  virtual void assign (const Base& v)
-  {
-    Base::assign (v);
-
-    const Self&  ex_v = static_cast<const Self&>(v);
+  virtual void assign(const Vertex_base& v) {
+    Vertex_base::assign(v);
+    const Self& ex_v = static_cast<const Self&>(v);
     m_data = ex_v.m_data;
   }
+
+  template <typename Point_>
+  struct rebind {
+    using Point_2 = Point_;
+    using other = typename Vertex_base::template rebind<Point_2>;
+  };
 };
 
-/*!
- * \class
+/*! \class
  * An extended DCEL halfedge with auxiliary data field.
  */
-template <class HalfedgeBase_, typename HalfedgeData_>
-class Arr_extended_halfedge : public HalfedgeBase_
-{
-  typedef Arr_extended_halfedge<HalfedgeBase_, HalfedgeData_>  Self;
-  typedef HalfedgeBase_                                        Base;
+template <typename HalfedgeBase, typename HalfedgeData>
+class Arr_extended_halfedge : public HalfedgeBase {
+  using Halfedge_base = HalfedgeBase;
+  using Halfedge_data = HalfedgeData;
+
+  using Self = Arr_extended_halfedge<Halfedge_base, Halfedge_data>;
 
 public:
-  typedef HalfedgeData_                                        Data;
+  typedef Halfedge_data                                       Data;
 
 private:
-
-  Data       m_data;       // The auxiliary data field.
+  Data m_data;       // The auxiliary data field.
 
 public:
-
   /*! Get the auxiliary data (const version). */
-  const Data& data () const
-  {
-    return (m_data);
-  }
+  const Data& data() const { return m_data; }
 
   /*! Get the auxiliary data (non-const version). */
-  Data& data ()
-  {
-    return (m_data);
-  }
+  Data& data() { return m_data; }
 
   /*! Set the auxiliary data. */
-  void set_data (const Data& data)
-  {
-    m_data = data;
-  }
+  void set_data(const Data& data) { m_data = data; }
 
-  /*! Assign from another vertex. */
-  virtual void assign (const Base& he)
-  {
-    Base::assign (he);
-
-    const Self&  ex_he = static_cast<const Self&>(he);
+  /*! Assign from another halfedge. */
+  virtual void assign(const Halfedge_base& he) {
+    Halfedge_base::assign(he);
+    const Self& ex_he = static_cast<const Self&>(he);
     m_data = ex_he.m_data;
   }
+
+  template <typename XMonotoneCurve>
+  struct rebind {
+    using X_monotonote_curve_2 = XMonotoneCurve;
+    using other = typename Halfedge_base::template rebind<X_monotonote_curve_2>;
+  };
 };
 
-/*!
- * \class
+/*! \class
  * An extended DCEL face with auxiliary data field.
  */
-template <class FaceBase_, typename FaceData_>
-class Arr_extended_face : public FaceBase_
-{
-  typedef Arr_extended_face<FaceBase_, FaceData_>  Self;
-  typedef FaceBase_                                Base;
+template <typename FaceBase, typename FaceData>
+class Arr_extended_face : public FaceBase {
+  using Face_base = FaceBase;
+  using Face_data = FaceData;
+
+  using Self = Arr_extended_face<Face_base, Face_data>;
 
 public:
-  typedef FaceData_                                Data;
+  typedef Face_data                               Data;
 
 private:
-
-  Data       m_data;       // The auxiliary data field.
+  Data m_data;       // The auxiliary data field.
 
 public:
-
   /*! Get the auxiliary data (const version). */
-  const Data& data () const
-  {
-    return (m_data);
-  }
+  const Data& data() const { return m_data; }
 
   /*! Get the auxiliary data (non-const version). */
-  Data& data ()
-  {
-    return (m_data);
-  }
+  Data& data() { return m_data; }
 
   /*! Set the auxiliary data. */
-  void set_data (const Data& data)
-  {
-    m_data = data;
-  }
-
-  /*! Assign from another vertex. */
-  virtual void assign (const Base& f)
-  {
-    Base::assign (f);
+  void set_data(const Data& data) { m_data = data; }
 
+  /*! Assign from another face. */
+  virtual void assign(const Face_base& f) {
+    Face_base::assign(f);
     const Self&  ex_f = static_cast<const Self&>(f);
     m_data = ex_f.m_data;
   }
@@ -173,49 +146,41 @@ class Arr_extended_face : public FaceBase_
  * defines the Point_2 and X_monotone_curve_2 types.
  * The FaceData parameter specifies the object type stored with each face.
  */
-template <class Traits_, typename FaceData_,
-          class VertexBase_ = Arr_vertex_base<typename Traits_::Point_2>,
-          class HalfedgeBase_ =
-                        Arr_halfedge_base<typename Traits_::X_monotone_curve_2>,
-          class FaceBase_ = Arr_face_base>
+template <typename Traits_, typename FaceData,
+          typename VertexBase = Arr_vertex_base<typename Traits_::Point_2>,
+          typename HalfedgeBase =
+            Arr_halfedge_base<typename Traits_::X_monotone_curve_2>,
+          typename FaceBase = Arr_face_base>
 class Arr_face_extended_dcel :
-  public Arr_dcel_base<VertexBase_,
-                       HalfedgeBase_,
-                       Arr_extended_face<FaceBase_, FaceData_> >
-{
+  public Arr_dcel_base<VertexBase, HalfedgeBase,
+                       Arr_extended_face<FaceBase, FaceData>> {
 public:
-
-  typedef FaceData_                    Face_data;
+  using Face_base = FaceBase;
+  using Face_data = FaceData;
 
   /*! \struct
    * An auxiliary structure for rebinding the DCEL with a new traits class.
    */
-  template<typename T>
-  class rebind
-  {
-    typedef typename VertexBase_::template rebind
-                        <typename T::Point_2>              Rebind_vertex;
-    typedef typename Rebind_vertex::other                  Vertex_base;
-    typedef typename HalfedgeBase_::template rebind
-                        <typename T::X_monotone_curve_2>   Rebind_halfedge;
-    typedef typename Rebind_halfedge::other                Halfedge_base;
+  template <typename T>
+  class rebind {
+  private:
+    using Pnt = typename T::Point_2;
+    using Xcv = typename T::X_monotone_curve_2;
+    using Rebind_vertex = typename VertexBase::template rebind<Pnt>;
+    using Vertex_other = typename Rebind_vertex::other;
+    using Rebind_halfedge = typename HalfedgeBase::template rebind<Xcv>;
+    using Halfedge_other = typename Rebind_halfedge::other;
 
   public:
-
-    typedef Arr_face_extended_dcel<T,
-                                   Face_data,
-                                   Vertex_base,
-                                   Halfedge_base,
-                                   FaceBase_>              other;
+    using other = Arr_face_extended_dcel<T, Face_data, Vertex_other,
+                                         Halfedge_other, Face_base>;
   };
 
   /*! Default constructor. */
-  Arr_face_extended_dcel ()
-  {}
+  Arr_face_extended_dcel() {}
 
   /*! Destructor. */
-  virtual ~Arr_face_extended_dcel ()
-  {}
+  virtual ~Arr_face_extended_dcel() {}
 };
 
 /*! \class
@@ -225,54 +190,48 @@ class Arr_face_extended_dcel :
  * The VertexData, HalfedgeData and FaceData parameter specify the object types
  * stored with each vertex, halfedge and face, respectively.
  */
-template <class Traits_,
-          typename VertexData_, typename HalfedgeData_, typename FaceData_,
-          class VertexBase_ = Arr_vertex_base<typename Traits_::Point_2>,
-          class HalfedgeBase_ =
-                        Arr_halfedge_base<typename Traits_::X_monotone_curve_2>,
-          class FaceBase_ = Arr_face_base>
+template <typename Traits_,
+          typename VertexData, typename HalfedgeData, typename FaceData,
+          typename VertexBase = Arr_vertex_base<typename Traits_::Point_2>,
+          typename HalfedgeBase =
+            Arr_halfedge_base<typename Traits_::X_monotone_curve_2>,
+          typename FaceBase = Arr_face_base>
 class Arr_extended_dcel :
-  public Arr_dcel_base<Arr_extended_vertex<VertexBase_, VertexData_>,
-                       Arr_extended_halfedge<HalfedgeBase_, HalfedgeData_>,
-                       Arr_extended_face<FaceBase_, FaceData_> >
-{
+  public Arr_dcel_base<Arr_extended_vertex<VertexBase, VertexData>,
+                       Arr_extended_halfedge<HalfedgeBase, HalfedgeData>,
+                       Arr_extended_face<FaceBase, FaceData>> {
 public:
-
-  typedef VertexData_                  Vertex_data;
-  typedef HalfedgeData_                Halfedge_data;
-  typedef FaceData_                    Face_data;
+  using Vertex_data = VertexData;
+  using Halfedge_data = HalfedgeData;
+  using Face_data = FaceData;
+  using Vertex_base = VertexBase;
+  using Halfedge_base = HalfedgeBase;
+  using Face_base = FaceBase;
 
   /*! \struct
    * An auxiliary structure for rebinding the DCEL with a new traits class.
    */
-  template<typename T>
-  class rebind
-  {
-    typedef typename VertexBase_::template rebind
-                        <typename T::Point_2>              Rebind_vertex;
-    typedef typename Rebind_vertex::other                  Vertex_base;
-    typedef typename HalfedgeBase_::template rebind
-                        <typename T::X_monotone_curve_2>   Rebind_halfedge;
-    typedef typename Rebind_halfedge::other                Halfedge_base;
+  template <typename T>
+  struct rebind {
+  private:
+    using Pnt = typename T::Point_2;
+    using Xcv = typename T::X_monotone_curve_2;
+    using Rebind_vertex = typename VertexBase::template rebind<Pnt>;
+    using Vertex_other = typename Rebind_vertex::other;
+    using Rebind_halfedge = typename HalfedgeBase::template rebind<Xcv>;
+    using Halfedge_other = typename Rebind_halfedge::other;
 
   public:
-
-    typedef Arr_extended_dcel<T,
-                              Vertex_data,
-                              Halfedge_data,
-                              Face_data,
-                              Vertex_base,
-                              Halfedge_base,
-                              FaceBase_>                   other;
+    using other = Arr_extended_dcel<T,
+                                    Vertex_data, Halfedge_data, Face_data,
+                                    Vertex_other, Halfedge_other, Face_base>;
   };
 
   /*! Default constructor. */
-  Arr_extended_dcel ()
-  {}
+  Arr_extended_dcel() {}
 
   /*! Destructor. */
-  virtual ~Arr_extended_dcel ()
-  {}
+  virtual ~Arr_extended_dcel() {}
 };
 
 } //namespace CGAL
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
index 585589688828..664aa1a48647 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_unb_planar_topology_traits_2.h
@@ -23,6 +23,7 @@
  */
 
 #include <CGAL/Arr_tags.h>
+#include <CGAL/Arr_default_dcel.h>
 #include <CGAL/Arr_topology_traits/Arr_planar_topology_traits_base_2.h>
 #include <CGAL/Arr_topology_traits/Arr_unb_planar_construction_helper.h>
 #include <CGAL/Arr_topology_traits/Arr_unb_planar_insertion_helper.h>
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2.h
index 5ff66d78b307..0b0e1769f808 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2.h
@@ -25,6 +25,7 @@
 #include <CGAL/Arr_tags.h>
 #include <CGAL/Arrangement_on_surface_2.h>
 #include <CGAL/Arrangement_2/Arr_default_planar_topology.h>
+#include <CGAL/Arr_default_dcel.h>
 
 namespace CGAL {
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
index ae87c8ddb28c..8df2b6cde580 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
@@ -39,11 +39,11 @@
 #include <CGAL/HalfedgeDS_iterator.h>
 #include <CGAL/Arrangement_2/Arrangement_2_iterators.h>
 #include <CGAL/In_place_list.h>
-#include <CGAL/Arr_default_dcel.h>
 #include <CGAL/Arr_observer.h>
 #include <CGAL/Arr_accessor.h>
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 #include <CGAL/function_objects.h>
+#include <CGAL/iterator.h>
 #include <CGAL/Iterator_project.h>
 #include <CGAL/Iterator_transform.h>
 #include <CGAL/Arr_point_location_result.h>
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_with_history_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_with_history_2.h
index 134c2f0c20e7..7e421c6ce54c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_with_history_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_with_history_2.h
@@ -9,6 +9,7 @@
 //
 //
 // Author(s): Ron Wein          <wein@post.tau.ac.il>
+//            Efi Fogel         <efif@post.tau.ac.il>
 
 #ifndef CGAL_ARRANGEMENT_WITH_HISTORY_2_H
 #define CGAL_ARRANGEMENT_WITH_HISTORY_2_H
@@ -23,6 +24,7 @@
 
 #include <CGAL/Arrangement_on_surface_with_history_2.h>
 #include <CGAL/Arrangement_2/Arr_default_planar_topology.h>
+#include <CGAL/Arr_default_dcel.h>
 
 namespace CGAL {
 

From 9ead7b59f5dc4cd77bee9f042e05e0ca7e29b3ab Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 16 Nov 2023 07:26:44 +0000
Subject: [PATCH 0999/1398] Address unused variable warnings

---
 Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp | 3 +++
 Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp   | 3 ---
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
index 27a258882ba2..fd99361c2902 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
@@ -68,6 +68,7 @@
 #endif
 
 #include <CGAL/Three/Three.h>
+#include <CGAL/use.h>
 
 #include <boost/type_traits.hpp>
 #include <optional>
@@ -92,6 +93,8 @@ load_vtk_file(QFileInfo fileinfo, Image* image)
     *image = CGAL::IO::read_vtk_image_data(vtk_image); // copy the image data
     return true;
 #else
+    CGAL_USE(fileinfo);
+    CGAL_USE(image);
     return false;
 #endif
 }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
index f490c0da691c..86bade9004e7 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
@@ -50,9 +50,6 @@ auto make_not_null(T&& t) {
 
 using namespace CGAL::Three;
 
-// Constants
-const QColor default_mesh_color(45,169,70);
-
 #include "Mesh_3_plugin_cgal_code.h" // declare functions `cgal_code_mesh_3`
 #include "split_polylines.h"
 #include <CGAL/Mesh_facet_topology.h>

From 1dee4f8fff0363ba3156af32f0dd0c6653a33b80 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 16 Nov 2023 07:33:25 +0000
Subject: [PATCH 1000/1398] Fix conversion warning in T3 demo

---
 Triangulation_3/demo/Triangulation_3/Viewer.cpp | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Triangulation_3/demo/Triangulation_3/Viewer.cpp b/Triangulation_3/demo/Triangulation_3/Viewer.cpp
index 3975e951dc55..12308b485170 100644
--- a/Triangulation_3/demo/Triangulation_3/Viewer.cpp
+++ b/Triangulation_3/demo/Triangulation_3/Viewer.cpp
@@ -1307,7 +1307,7 @@ void Viewer::draw()
             // draw the rest to-be-inserted vertices
             rendering_program.bind();
             vao[24].bind();
-            color.setRgbF(0.7,0.7,0.7);
+            color.setRgbF(0.7f,0.7f,0.7f);
             rendering_program.setUniformValue(colorLocation[0],color);
             rendering_program.setUniformValue("point_size", 8.0f);
             glDrawArrays(GL_POINTS, 0, incremental_points->size()/3);
@@ -1510,7 +1510,7 @@ void Viewer::draw()
             // draw the rest to-be-inserted vertices
             rendering_program_spheres.bind();
             vao[25].bind();
-            color.setRgbF(0.7,0.7,0.7);
+            color.setRgbF(0.7f,0.7f,0.7f);
             rendering_program_spheres.setUniformValue(colorLocation[1],color);
             glDrawArraysInstanced(GL_TRIANGLES, 0, points_sphere->size()/3, incremental_points->size()/3);
             vao[25].release();

From 2a223e6a1d80776de3011f76b4ea794ed20673ec Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 16 Nov 2023 07:48:04 +0000
Subject: [PATCH 1001/1398] Fix ipelet demo CMakeLists.txt

---
 CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt b/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
index 98a5ab469f39..fc3acb1cb7b9 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
+++ b/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
@@ -97,7 +97,7 @@ if(IPE_FOUND AND IPE_VERSION)
     cgal_add_compilation_test(CGAL_${IPELET})
   endforeach(IPELET)
   if(CGAL_Core_FOUND)
-    target_link_libraries(CGAL_cone_spanners PRIVATE CGAL::CGAL_Core
+    target_link_libraries(CGAL_cone_spanners PRIVATE CGAL::CGAL CGAL::CGAL_Core
                                                      CGAL::Eigen3_support)
   endif()
   #example in doc not installed

From 04be232d145595b49e83bbda302ebbc2fbc493bc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 12 Sep 2023 15:29:55 +0200
Subject: [PATCH 1002/1398] update to macro update

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h        | 2 +-
 .../Isotropic_remeshing/Sizing_field_base.h                     | 2 +-
 .../include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index d77803bba822..ed7332e13143 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -38,7 +38,7 @@ namespace Polygon_mesh_processing
 * Edges longer than the local target edge length are split in half, while
 * edges shorter than the local target edge length are collapsed.
 *
-* \cgalModels PMPSizingField
+* \cgalModels{PMPSizingField}
 *
 * \sa `isotropic_remeshing`
 * \sa `Uniform_sizing_field`
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h
index 580601bbaecb..5278896f9d83 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h
@@ -29,7 +29,7 @@ namespace Polygon_mesh_processing
 * pure virtual class serving as a base for sizing field classes utilized in isotropic
 * remeshing.
 *
-* \cgalModels PMPSizingField
+* \cgalModels{PMPSizingField}
 *
 * \sa `isotropic_remeshing()`
 * \sa `Uniform_sizing_field`
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 02d21df369be..b454b5d2abf1 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -31,7 +31,7 @@ namespace Polygon_mesh_processing
 * Edges longer than the 4/3 of the target edge length will be split in half, while
 * edges shorter than the 4/5 of the target edge length will be collapsed.
 *
-* \cgalModels PMPSizingField
+* \cgalModels{PMPSizingField}
 *
 * \sa `isotropic_remeshing`
 * \sa `Adaptive_sizing_field`

From 42c02d9e34e52131f3f08da840afc24b355721e7 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 12 Sep 2023 20:13:13 -0600
Subject: [PATCH 1003/1398] Add constructor with VPMap input in
 Adaptive_sizing_field

---
 .../Adaptive_sizing_field.h                   | 62 +++++++++++++++++--
 1 file changed, 56 insertions(+), 6 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index ed7332e13143..7b29f3faadf1 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -46,8 +46,12 @@ namespace Polygon_mesh_processing
 * @tparam PolygonMesh model of `MutableFaceGraph` that
 *         has an internal property map for `CGAL::vertex_point_t`.
 */
-template <class PolygonMesh>
-class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
+template <class PolygonMesh,
+          class VPMap =  typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
+class Adaptive_sizing_field
+#ifndef DOXYGEN_RUNNING
+  : public Sizing_field_base<PolygonMesh, VPMap>
+#endif
 {
 private:
   typedef Sizing_field_base<PolygonMesh> Base;
@@ -62,7 +66,6 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
   typedef typename Base::face_descriptor     face_descriptor;
   typedef typename Base::halfedge_descriptor halfedge_descriptor;
   typedef typename Base::vertex_descriptor   vertex_descriptor;
-  typedef typename Base::DefaultVPMap DefaultVPMap;
 
   /// \name Creation
   /// @{
@@ -79,6 +82,8 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
   *        edge length.
   * @param face_range the range of triangular faces defining one or several surface patches
   *        to be remeshed. It should be the same as the range of faces used for `isotropic_remeshing()`.
+  * \param vpmap is the input vertex point map that associates points to the vertices of
+  *        an input mesh.
   * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. It should be the
   *              same mesh as the one used in `isotropic_remeshing()`.
   * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
@@ -102,15 +107,15 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
   Adaptive_sizing_field(const double tol
                       , const std::pair<FT, FT>& edge_len_min_max
                       , const FaceRange& face_range
+                      , const VPMap& vpmap
                       , PolygonMesh& pmesh
                       , const NamedParameters& np = parameters::default_values())
     : tol(tol)
     , m_short(edge_len_min_max.first)
     , m_long(edge_len_min_max.second)
-    , m_vpmap(get(CGAL::vertex_point, pmesh))
+    , m_vpmap(vpmap)
     , m_vertex_sizing_map(get(Vertex_property_tag(), pmesh))
   {
-
     if (face_range.size() == faces(pmesh).size())
     {
       // calculate curvature from the whole mesh
@@ -130,6 +135,51 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
       calc_sizing_map(ffg, np);
     }
   }
+
+  /*!
+  * returns an object to serve as criteria for adaptive curvature-based edge lengths. It calls
+  * the first constructor using default values for the vertex point map of the input polygon mesh.
+  *
+  * @tparam FaceRange range of `boost::graph_traits<PolygonMesh>::%face_descriptor`,
+  *         model of `Range`. Its iterator type is `ForwardIterator`.
+  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+  *
+  * @param tol the error tolerance, used together with curvature to derive target edge length.
+  *        Lower tolerance values will result in shorter mesh edges.
+  * @param edge_len_min_max is the stopping criterion for minimum and maximum allowed
+  *        edge length.
+  * @param face_range the range of triangular faces defining one or several surface patches
+  *        to be remeshed. It should be the same as the range of faces used for `isotropic_remeshing()`.
+  * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. It should be the
+  *              same mesh as the one used in `isotropic_remeshing()`. Additionally, the default vertex point
+  *              map of pmesh is used to construct the class.
+  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
+
+  * \cgalNamedParamsBegin
+  *   \cgalParamNBegin{ball_radius}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures.
+  *                           It can potentially smooth the curvature and consequently the sizing field in the
+   *                          case of noisy input.}
+  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures.
+  *                           It can effectively smooth the curvature field and consequently the sizing field.}
+  *     \cgalParamType{`Base::FT`}
+  *     \cgalParamDefault{`-1`}
+  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
+  *                     measures on faces around the vertex.}
+  *   \cgalParamNEnd
+  * \cgalNamedParamsEnd
+  */
+  template <typename FaceRange
+          , typename NamedParameters = parameters::Default_named_parameters>
+  Adaptive_sizing_field(const double tol
+                      , const std::pair<FT, FT>& edge_len_min_max
+                      , const FaceRange& face_range
+                      , PolygonMesh& pmesh
+                      , const NamedParameters& np = parameters::default_values())
+    : Adaptive_sizing_field(tol, edge_len_min_max, face_range,
+                            get(CGAL::vertex_point, pmesh), pmesh, np)
+  {}
+
   ///@}
 
 private:
@@ -277,7 +327,7 @@ class Adaptive_sizing_field : public Sizing_field_base<PolygonMesh>
   const FT tol;
   const FT m_short;
   const FT m_long;
-  const DefaultVPMap m_vpmap;
+  const VPMap m_vpmap;
   VertexSizingMap m_vertex_sizing_map;
 };
 

From 4d06df0622dae88f291a0136c11642599216f0de Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 12 Sep 2023 21:26:14 -0600
Subject: [PATCH 1004/1398] Move Sizing_field_base one directory down

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h       | 2 +-
 .../{Isotropic_remeshing => }/Sizing_field_base.h              | 3 ---
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h        | 2 +-
 3 files changed, 2 insertions(+), 5 deletions(-)
 rename Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/{Isotropic_remeshing => }/Sizing_field_base.h (96%)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 7b29f3faadf1..7bb8cbe8de4b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
-#include <CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h>
+#include <CGAL/Polygon_mesh_processing/Sizing_field_base.h>
 #include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 
 #include <CGAL/boost/graph/selection.h>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Sizing_field_base.h
similarity index 96%
rename from Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h
rename to Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Sizing_field_base.h
index 5278896f9d83..8cb12191ad1a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Sizing_field_base.h
@@ -49,9 +49,6 @@ class Sizing_field_base
   typedef PolygonMesh                     PM;
   typedef typename boost::property_traits<VPMap>::value_type Point;
 
-protected:
-  typedef typename boost::property_map<PM, boost::vertex_point_t>::const_type DefaultVPMap;
-
 public:
   typedef typename CGAL::Kernel_traits<Point>::Kernel K;
   typedef typename boost::graph_traits<PM>::face_descriptor     face_descriptor;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index b454b5d2abf1..5b3090f7945f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
-#include <CGAL/Polygon_mesh_processing/Isotropic_remeshing/Sizing_field_base.h>
+#include <CGAL/Polygon_mesh_processing/Sizing_field_base.h>
 
 #include <CGAL/number_utils.h>
 

From 12cc789f33a3539568724001f3d81eb9686306de Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 12 Sep 2023 21:48:13 -0600
Subject: [PATCH 1005/1398] Remove temp todos

---
 .../internal/Isotropic_remeshing/remesh_impl.h               | 5 -----
 .../CGAL/Polygon_mesh_processing/tangential_relaxation.h     | 2 +-
 2 files changed, 1 insertion(+), 6 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 7453a9482edc..aae916ff0953 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -55,9 +55,6 @@
 #include <unordered_set>
 #include <optional>
 
-//todo ip: temp
-#define CGAL_PMP_REMESHING_VERBOSE
-
 #ifdef CGAL_PMP_REMESHING_DEBUG
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
 #define CGAL_DUMP_REMESHING_STEPS
@@ -1120,7 +1117,6 @@ namespace internal {
 
         Point proj = trees[patch_id_to_index_map[get_patch_id(face(halfedge(v, mesh_), mesh_))]]->closest_point(get(vpmap_, v));
         put(vpmap_, v, proj);
-        //todo ip - also update sizing field here?
       }
       CGAL_assertion(!input_mesh_is_valid_ || is_valid_polygon_mesh(mesh_));
 #ifdef CGAL_PMP_REMESHING_DEBUG
@@ -1149,7 +1145,6 @@ namespace internal {
           continue;
         //note if v is constrained, it has not moved
         put(vpmap_, v,  proj(v));
-        //todo ip: also update sizing field here?
       }
       CGAL_assertion(is_valid(mesh_));
 #ifdef CGAL_PMP_REMESHING_DEBUG
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index 53084cce5e02..7911c3340c56 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -564,7 +564,7 @@ void tangential_relaxation_with_sizing(const VertexRange& vertices,
 
         barycenters.emplace_back(v, vn, get(vpm, v) + move);
       }
-      else //todo ip: do border edges need to be handled with the sizing field?
+      else
       {
         if (!relax_constraints) continue;
         Vector_3 vn(NULL_VECTOR);

From 0481c624e2ff2ca626bec9a17f6c815ba54c72f7 Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Tue, 12 Sep 2023 23:26:34 -0600
Subject: [PATCH 1006/1398] Cleanup the example

---
 .../isotropic_remeshing_with_sizing_example.cpp               | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index dacc3e02e1b2..5ecc651f0966 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -13,10 +13,7 @@ namespace PMP = CGAL::Polygon_mesh_processing;
 
 int main(int argc, char* argv[])
 {
-//  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/lion-head.off");
-//  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/hand.off");
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/nefertiti.off");
-//  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/cube.off");
 
   Mesh mesh;
   if (!PMP::IO::read_polygon_mesh(filename, mesh) || !CGAL::is_triangle_mesh(mesh)) {
@@ -37,6 +34,7 @@ int main(int argc, char* argv[])
       sizing_field,
       mesh,
       PMP::parameters::number_of_iterations(nb_iter)
+                      .number_of_relaxation_steps(3)
       );
 
   CGAL::IO::write_polygon_mesh("out.off", mesh, CGAL::parameters::stream_precision(17));

From 230de52aaf61647db041f7911a1396638ee1a9c1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 14 Sep 2023 15:46:21 +0200
Subject: [PATCH 1007/1398] remove unused variables

---
 .../internal/Isotropic_remeshing/remesh_impl.h                  | 2 --
 1 file changed, 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index aae916ff0953..07170bd81777 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -415,7 +415,6 @@ namespace internal {
         //the edge with longest length
         auto eit = long_edges.begin();
         halfedge_descriptor he = eit->first;
-        double sqlen = eit->second;
         long_edges.erase(eit);
 
         //split edge
@@ -515,7 +514,6 @@ namespace internal {
         //the edge with longest length
         auto eit = long_edges.begin();
         halfedge_descriptor he = eit->first;
-        double sqlen = eit->second;
         long_edges.erase(eit);
 
 #ifdef CGAL_PMP_REMESHING_VERBOSE_PROGRESS

From 1d21d57f27e397baa6f936fb17d5bf8bacd99db2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 14 Sep 2023 15:49:28 +0200
Subject: [PATCH 1008/1398] remove no longer used parameter

---
 .../internal/Isotropic_remeshing/remesh_impl.h                  | 1 -
 .../include/CGAL/Polygon_mesh_processing/remesh.h               | 2 +-
 2 files changed, 1 insertion(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 07170bd81777..cc80c0534fc3 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -235,7 +235,6 @@ namespace internal {
            typename SizingFunction>
   bool constraints_are_short_enough(const PM& pmesh,
                                     EdgeConstraintMap ecmap,
-                                    VertexPointMap vpmap,
                                     const FacePatchMap& fpm,
                                     const SizingFunction& sizing)
   {
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 45ce27304cb8..6a04386aa10c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -274,7 +274,7 @@ void isotropic_remeshing(const FaceRange& faces
     msg.append(" true with constraints larger than 4/3 * target_edge_length.");
     msg.append(" Remeshing aborted.");
     CGAL_precondition_msg(
-      internal::constraints_are_short_enough(pmesh, ecmap, vpmap, fpmap, sizing),
+      internal::constraints_are_short_enough(pmesh, ecmap, fpmap, sizing),
       msg.c_str());
   }
 #endif

From 324f1331256eee6bdb62815a2ca74a9f6216188a Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Thu, 14 Sep 2023 10:09:12 -0600
Subject: [PATCH 1009/1398] Update removed arguments

---
 .../internal/Isotropic_remeshing/remesh_impl.h                  | 1 -
 .../demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp  | 2 --
 2 files changed, 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index cc80c0534fc3..f7d93ab1e307 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -230,7 +230,6 @@ namespace internal {
 
   template<typename PM,
            typename EdgeConstraintMap,
-           typename VertexPointMap,
            typename FacePatchMap,
            typename SizingFunction>
   bool constraints_are_short_enough(const PM& pmesh,
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 06155a62c217..02c61ba52c2e 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -438,7 +438,6 @@ public Q_SLOTS:
                !CGAL::Polygon_mesh_processing::internal::constraints_are_short_enough(
                  *selection_item->polyhedron(),
                  selection_item->constrained_edges_pmap(),
-                 get(CGAL::vertex_point, *selection_item->polyhedron()),
                  CGAL::Constant_property_map<face_descriptor, std::size_t>(1),
                  CGAL::Polygon_mesh_processing::Uniform_sizing_field( 4. / 3. * target_length, pmesh)))
             {
@@ -749,7 +748,6 @@ public Q_SLOTS:
              !CGAL::Polygon_mesh_processing::internal::constraints_are_short_enough(
                pmesh,
                ecm,
-               get(CGAL::vertex_point, pmesh),
                CGAL::Constant_property_map<face_descriptor, std::size_t>(1),
                CGAL::Polygon_mesh_processing::Uniform_sizing_field(4. / 3. * target_length, pmesh)))
           {

From 7128ef9ea6cc2c453ecd0cc28871be8c15fef41d Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Thu, 14 Sep 2023 10:25:10 -0600
Subject: [PATCH 1010/1398] Add STL 'limits' include to address the failing
 test

---
 .../test/Polygon_mesh_processing/remeshing_quality_test.cpp      | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
index 69b2afaaca01..68f77d9f6c82 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
@@ -5,6 +5,7 @@
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 
 #include <fstream>
+#include <limits>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
 typedef K::Point_3 Point_3;

From 28ac57e75120b8ccf87a6a2e24432569597c158d Mon Sep 17 00:00:00 2001
From: Ivan Paden <i.paden@tudelft.nl>
Date: Fri, 15 Sep 2023 09:22:15 -0600
Subject: [PATCH 1011/1398] Fix for a failing MVSC test

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h      | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 7bb8cbe8de4b..705031cef3a7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -213,8 +213,8 @@ class Adaptive_sizing_field
     for(vertex_descriptor v : vertices(face_graph))
     {
       auto vertex_curv = get(vertex_curvature_map, v);
-      const FT max_absolute_curv = CGAL::max(CGAL::abs(vertex_curv.max_curvature)
-                                           , CGAL::abs(vertex_curv.min_curvature));
+      const FT max_absolute_curv = (CGAL::max)(CGAL::abs(vertex_curv.max_curvature)
+                                             , CGAL::abs(vertex_curv.min_curvature));
       const FT vertex_size_sq = 6 * tol / max_absolute_curv - 3 * CGAL::square(tol);
       if (vertex_size_sq > CGAL::square(m_long))
       {

From 959311048bb31befd233fd56e8b42fab483a11c1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Thu, 21 Sep 2023 00:40:33 -0600
Subject: [PATCH 1012/1398] Fix Adaptive_sizing_field template issue

---
 .../isotropic_remeshing_with_sizing_example.cpp               | 2 +-
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h      | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index 5ecc651f0966..1fc3c4960d38 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -26,7 +26,7 @@ int main(int argc, char* argv[])
 
   const double tol = 0.001;
   const std::pair edge_min_max{0.001, 0.5};
-  PMP::Adaptive_sizing_field sizing_field(tol, edge_min_max, faces(mesh), mesh);
+  PMP::Adaptive_sizing_field<Mesh> sizing_field(tol, edge_min_max, faces(mesh), mesh);
   unsigned int nb_iter = 5;
 
   PMP::isotropic_remeshing(
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 705031cef3a7..10c563072977 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -47,14 +47,14 @@ namespace Polygon_mesh_processing
 *         has an internal property map for `CGAL::vertex_point_t`.
 */
 template <class PolygonMesh,
-          class VPMap =  typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
+          class VPMap = typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
 class Adaptive_sizing_field
 #ifndef DOXYGEN_RUNNING
   : public Sizing_field_base<PolygonMesh, VPMap>
 #endif
 {
 private:
-  typedef Sizing_field_base<PolygonMesh> Base;
+  typedef Sizing_field_base<PolygonMesh, VPMap> Base;
   typedef typename CGAL::dynamic_vertex_property_t<typename Base::FT> Vertex_property_tag;
   typedef typename boost::property_map<PolygonMesh,
                                        Vertex_property_tag>::type VertexSizingMap;

From 7cb3a58185d653ac450c4f2a1e547849409814eb Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Fri, 22 Sep 2023 07:15:19 -0600
Subject: [PATCH 1013/1398] Update
 Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp

Co-authored-by: Andreas Fabri <andreas.fabri@geometryfactory.com>
---
 .../test/Polygon_mesh_processing/remeshing_quality_test.cpp     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
index 68f77d9f6c82..f07d4c027f47 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
@@ -43,7 +43,7 @@ int main(int argc, char* argv[])
    * More information on quality metrics can be found here: https://ieeexplore.ieee.org/document/9167456
    */
   std::cout << "Remeshing done, checking triangle quality...\n" << std::endl;
-  double qmin = std::numeric_limits<double>::max();      // minimum triangle quality
+  double qmin = (std::numeric_limits<double>::max)();      // minimum triangle quality
   double qavg = 0.;           // average quality
   double min_angle = std::numeric_limits<double>::max(); // minimum angle
   double avg_min_angle = 0.; // average minimum angle

From 20a735cc599e81027328482022efa0300a6c686c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Fri, 22 Sep 2023 07:15:38 -0600
Subject: [PATCH 1014/1398] Update
 Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp

Co-authored-by: Andreas Fabri <andreas.fabri@geometryfactory.com>
---
 .../test/Polygon_mesh_processing/remeshing_quality_test.cpp     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
index f07d4c027f47..a6216663596f 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
@@ -45,7 +45,7 @@ int main(int argc, char* argv[])
   std::cout << "Remeshing done, checking triangle quality...\n" << std::endl;
   double qmin = (std::numeric_limits<double>::max)();      // minimum triangle quality
   double qavg = 0.;           // average quality
-  double min_angle = std::numeric_limits<double>::max(); // minimum angle
+  double min_angle = (std::numeric_limits<double>::max)(); // minimum angle
   double avg_min_angle = 0.; // average minimum angle
   for (auto face : mesh.faces())
   {

From 64af00b2ad4c71680ebd559d923bed8625212cb3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Fri, 22 Sep 2023 21:32:32 -0600
Subject: [PATCH 1015/1398] Fix formatting

---
 .../Adaptive_sizing_field.h                   | 34 +++++++++----------
 .../Uniform_sizing_field.h                    |  3 +-
 2 files changed, 18 insertions(+), 19 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 10c563072977..b465627b6b9f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -206,15 +206,15 @@ class Adaptive_sizing_field
 #endif
 
     Vertex_curvature_map vertex_curvature_map = get(Vertex_curvature_tag(), face_graph);
-    interpolated_corrected_principal_curvatures_and_directions(face_graph
-                                                             , vertex_curvature_map
-                                                             , parameters::ball_radius(radius));
+    interpolated_corrected_principal_curvatures_and_directions(face_graph,
+                                                               vertex_curvature_map,
+                                                               parameters::ball_radius(radius));
     // calculate vertex sizing field L(x_i) from the curvature field
     for(vertex_descriptor v : vertices(face_graph))
     {
       auto vertex_curv = get(vertex_curvature_map, v);
-      const FT max_absolute_curv = (CGAL::max)(CGAL::abs(vertex_curv.max_curvature)
-                                             , CGAL::abs(vertex_curv.min_curvature));
+      const FT max_absolute_curv = (CGAL::max)(CGAL::abs(vertex_curv.max_curvature),
+                                               CGAL::abs(vertex_curv.min_curvature));
       const FT vertex_size_sq = 6 * tol / max_absolute_curv - 3 * CGAL::square(tol);
       if (vertex_size_sq > CGAL::square(m_long))
       {
@@ -257,16 +257,17 @@ class Adaptive_sizing_field
   }
 
 public:
-  FT get_sizing(const vertex_descriptor v) const {
-      CGAL_assertion(get(m_vertex_sizing_map, v));
-      return get(m_vertex_sizing_map, v);
-    }
+  FT get_sizing(const vertex_descriptor v) const
+  {
+    CGAL_assertion(get(m_vertex_sizing_map, v));
+    return get(m_vertex_sizing_map, v);
+  }
 
   std::optional<FT> is_too_long(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
     const FT sqlen = sqlength(h, pmesh);
-    FT sqtarg_len = CGAL::square(4./3. * CGAL::min(get(m_vertex_sizing_map, source(h, pmesh)),
-                                                   get(m_vertex_sizing_map, target(h, pmesh))));
+    FT sqtarg_len = CGAL::square(4./3. * (CGAL::min)(get(m_vertex_sizing_map, source(h, pmesh)),
+                                                     get(m_vertex_sizing_map, target(h, pmesh))));
     CGAL_assertion(get(m_vertex_sizing_map, source(h, pmesh)));
     CGAL_assertion(get(m_vertex_sizing_map, target(h, pmesh)));
     if(sqlen > sqtarg_len)
@@ -275,12 +276,11 @@ class Adaptive_sizing_field
       return std::nullopt;
   }
 
-  std::optional<FT> is_too_long(const vertex_descriptor va,
-                                  const vertex_descriptor vb) const
+  std::optional<FT> is_too_long(const vertex_descriptor va, const vertex_descriptor vb) const
   {
     const FT sqlen = sqlength(va, vb);
-    FT sqtarg_len = CGAL::square(4./3. * CGAL::min(get(m_vertex_sizing_map, va),
-                                                   get(m_vertex_sizing_map, vb)));
+    FT sqtarg_len = CGAL::square(4./3. * (CGAL::min)(get(m_vertex_sizing_map, va),
+                                                     get(m_vertex_sizing_map, vb)));
     CGAL_assertion(get(m_vertex_sizing_map, va));
     CGAL_assertion(get(m_vertex_sizing_map, vb));
     if (sqlen > sqtarg_len)
@@ -292,8 +292,8 @@ class Adaptive_sizing_field
   std::optional<FT> is_too_short(const halfedge_descriptor h, const PolygonMesh& pmesh) const
   {
     const FT sqlen = sqlength(h, pmesh);
-    FT sqtarg_len = CGAL::square(4./5. * CGAL::min(get(m_vertex_sizing_map, source(h, pmesh)),
-                                                   get(m_vertex_sizing_map, target(h, pmesh))));
+    FT sqtarg_len = CGAL::square(4./5. * (CGAL::min)(get(m_vertex_sizing_map, source(h, pmesh)),
+                                                     get(m_vertex_sizing_map, target(h, pmesh))));
     CGAL_assertion(get(m_vertex_sizing_map, source(h, pmesh)));
     CGAL_assertion(get(m_vertex_sizing_map, target(h, pmesh)));
     if (sqlen < sqtarg_len)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 5b3090f7945f..fc4540ab59bd 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -111,8 +111,7 @@ class Uniform_sizing_field
       return std::nullopt;
   }
 
-  std::optional<FT> is_too_long(const vertex_descriptor va,
-                                  const vertex_descriptor vb) const
+  std::optional<FT> is_too_long(const vertex_descriptor va, const vertex_descriptor vb) const
   {
     const FT sqlen = sqlength(va, vb);
     if (sqlen > m_sq_long)

From 896e4913ff92504403a0de0d33408f5737d78d25 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Sat, 23 Sep 2023 21:58:31 -0600
Subject: [PATCH 1016/1398] Update authors

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h      | 4 ++--
 .../CGAL/Polygon_mesh_processing/tangential_relaxation.h      | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index b465627b6b9f..b17b92088f6c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -1,4 +1,4 @@
-// Copyright (c) 2020 GeometryFactory (France)
+// Copyright (c) 2023 GeometryFactory (France)
 // All rights reserved.
 //
 // This file is part of CGAL (www.cgal.org)
@@ -8,7 +8,7 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Jane Tournois
+// Author(s)     : Ivan Paden
 
 #ifndef CGAL_PMP_REMESHING_ADAPTIVE_SIZING_FIELD_H
 #define CGAL_PMP_REMESHING_ADAPTIVE_SIZING_FIELD_H
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index 7911c3340c56..ab89f75afe34 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -1,4 +1,4 @@
-// Copyright (c) 2015-2021 GeometryFactory (France).
+// Copyright (c) 2015-2023 GeometryFactory (France).
 // All rights reserved.
 //
 // This file is part of CGAL (www.cgal.org).
@@ -8,7 +8,7 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Jane Tournois
+// Author(s)     : Jane Tournois, Ivan Paden
 
 
 #ifndef CGAL_POLYGON_MESH_PROCESSING_TANGENTIAL_RELAXATION_H

From 65c75c5d43d4dc540d0b8adbf826a3b9ecead521 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Mon, 25 Sep 2023 18:45:03 -0600
Subject: [PATCH 1017/1398] Update data type

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h      | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index b17b92088f6c..20ec7162021c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -104,7 +104,7 @@ class Adaptive_sizing_field
   */
   template <typename FaceRange
           , typename NamedParameters = parameters::Default_named_parameters>
-  Adaptive_sizing_field(const double tol
+  Adaptive_sizing_field(const FT tol
                       , const std::pair<FT, FT>& edge_len_min_max
                       , const FaceRange& face_range
                       , const VPMap& vpmap
@@ -171,7 +171,7 @@ class Adaptive_sizing_field
   */
   template <typename FaceRange
           , typename NamedParameters = parameters::Default_named_parameters>
-  Adaptive_sizing_field(const double tol
+  Adaptive_sizing_field(const FT tol
                       , const std::pair<FT, FT>& edge_len_min_max
                       , const FaceRange& face_range
                       , PolygonMesh& pmesh

From 1e1eb19a5bdedc4833c1a1d8920b2e4f7840a6b0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Wed, 27 Sep 2023 17:28:57 -0600
Subject: [PATCH 1018/1398] Update
 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h

Co-authored-by: Andreas Fabri <andreas.fabri@geometryfactory.com>
---
 .../include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index fc4540ab59bd..e7f26db5d971 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -33,7 +33,7 @@ namespace Polygon_mesh_processing
 *
 * \cgalModels{PMPSizingField}
 *
-* \sa `isotropic_remeshing`
+* \sa `isotropic_remeshing()`
 * \sa `Adaptive_sizing_field`
 *
 * @tparam PolygonMesh model of `MutableFaceGraph` that

From 99f8120e5b2e5ad0e7bb782d8ed9028c19b4d164 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Wed, 27 Sep 2023 17:29:08 -0600
Subject: [PATCH 1019/1398] Update
 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h

Co-authored-by: Andreas Fabri <andreas.fabri@geometryfactory.com>
---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h        | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 20ec7162021c..b4f7c6fc8c45 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -40,7 +40,7 @@ namespace Polygon_mesh_processing
 *
 * \cgalModels{PMPSizingField}
 *
-* \sa `isotropic_remeshing`
+* \sa `isotropic_remeshing()`
 * \sa `Uniform_sizing_field`
 *
 * @tparam PolygonMesh model of `MutableFaceGraph` that

From bde55d8e4c825c24cecb7ce9913d3b3da1414193 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Wed, 27 Sep 2023 21:17:07 -0600
Subject: [PATCH 1020/1398] Update docs

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h      | 4 ++--
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h       | 3 +--
 2 files changed, 3 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index b4f7c6fc8c45..82a89b144dc5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -29,8 +29,8 @@ namespace Polygon_mesh_processing
 {
 /*!
 * \ingroup PMP_meshing_grp
-* provides a set of instructions for isotropic remeshing to achieve variable
-* mesh edge lengths as a function of local discrete curvatures.
+* provides criteria for isotropic remeshing to achieve variable mesh edge lengths as a function
+* of local discrete curvatures.
 *
 * The local discrete curvatures are calculated using the
 * `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()` function.
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index e7f26db5d971..e2e655aa1475 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -25,8 +25,7 @@ namespace Polygon_mesh_processing
 {
 /*!
 * \ingroup PMP_meshing_grp
-* provides a set of instructions for isotropic remeshing to achieve uniform
-* mesh edge lengths.
+* provides criteria for isotropic remeshing to achieve uniform mesh edge lengths.
 *
 * Edges longer than the 4/3 of the target edge length will be split in half, while
 * edges shorter than the 4/5 of the target edge length will be collapsed.

From e49789b3d58097b226e1d00fbe06f99afd4881eb Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Thu, 28 Sep 2023 09:44:47 -0600
Subject: [PATCH 1021/1398] Update
 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 .../include/CGAL/Polygon_mesh_processing/remesh.h               | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 6a04386aa10c..41b4301ca49a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -50,7 +50,7 @@ namespace Polygon_mesh_processing {
 *
 * @param pmesh a polygon mesh with triangulated surface patches to be remeshed
 * @param faces the range of triangular faces defining one or several surface patches to be remeshed
-* @param sizing uniform or adaptive sizing field that determines a target length for individual edges.
+* @param sizing field that determines a target length for individual edges.
 *        If a number convertible to a double is passed, it will use a `Uniform_sizing_field()`
 *        with the number as a target edge length.
 *        If `0` is passed then only the edge-flip, tangential relaxation, and projection steps will be done.

From 21f6580d64154aeab2f95d38a0163ef6ae67ae6d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Thu, 28 Sep 2023 20:50:58 -0600
Subject: [PATCH 1022/1398] Update
 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 .../include/CGAL/Polygon_mesh_processing/remesh.h               | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 41b4301ca49a..43bb5605a27b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -51,7 +51,7 @@ namespace Polygon_mesh_processing {
 * @param pmesh a polygon mesh with triangulated surface patches to be remeshed
 * @param faces the range of triangular faces defining one or several surface patches to be remeshed
 * @param sizing field that determines a target length for individual edges.
-*        If a number convertible to a double is passed, it will use a `Uniform_sizing_field()`
+*        If a number convertible to a `double` is passed, `Uniform_sizing_field()` will be used,
 *        with the number as a target edge length.
 *        If `0` is passed then only the edge-flip, tangential relaxation, and projection steps will be done.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below

From 7b7dfa2e0a3520b34228e9ac869e78dff3eb4966 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Thu, 28 Sep 2023 20:51:28 -0600
Subject: [PATCH 1023/1398] Update
 Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 .../doc/Polygon_mesh_processing/Concepts/PMPSizingField.h       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index afd1db889147..a359f0f64591 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -12,7 +12,7 @@ class PMPSizingField{
 /// @{
 
 /// Vertex descriptor type
-typedef unspecified_type vertex_descriptor;
+typedef boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
 
 /// Halfedge descriptor type
 typedef unspecified_type halfedge_descriptor;

From 178d967d4bae4d69e2add3a14bf1415f5108ac3f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Thu, 28 Sep 2023 20:58:01 -0600
Subject: [PATCH 1024/1398] Apply suggestions from code review

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 .../Concepts/PMPSizingField.h                 | 21 ++++++++--------
 .../PackageDescription.txt                    |  2 +-
 .../Polygon_mesh_processing.txt               | 11 +++++----
 .../Adaptive_sizing_field.h                   | 24 +++++++------------
 .../Uniform_sizing_field.h                    | 17 +++++++------
 5 files changed, 33 insertions(+), 42 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index a359f0f64591..c9e66b1d2745 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -15,15 +15,15 @@ class PMPSizingField{
 typedef boost::graph_traits<PolygonMesh>::vertex_descriptor vertex_descriptor;
 
 /// Halfedge descriptor type
-typedef unspecified_type halfedge_descriptor;
+typedef boost::graph_traits<PolygonMesh>::halfedge_descriptor halfedge_descriptor;
 
-/// 3D point type
+/// 3D point type matching the value type of the vertex property map passed to `CGAL::Polygon_mesh_processing::isotropic_remeshing()`
 typedef unspecified_type Point_3;
 
-/// Polygon mesh type
+/// Polygon mesh type matching the type passed to `CGAL::Polygon_mesh_processing::isotropic_remeshing()`
 typedef unspecified_type PolygonMesh;
 
-/// Numerical type
+/// Number type matching the `FT` type of the geometric traits passed to `CGAL::Polygon_mesh_processing::isotropic_remeshing()`
 typedef unspecified_type FT;
 
 /// @}
@@ -37,19 +37,18 @@ typedef unspecified_type FT;
 std::optional<FT> is_too_long(const halfedge_descriptor h,
                                 const PolygonMesh& pmesh) const;
 
-/// called to check whether the halfedge with end vertices `va` and `vb` is longer
-/// than the target edge size and as such should be split. If the halfedge is longer,
-/// it returns the squared length of the edge.
+/// a function controlling edge split and edge collapse, 
+/// returning the squared distance between the points of `va` and `vb`
+/// if an edge between `va` and `vb` would be too long, and `std::nullopt` otherwise.
 std::optional<FT> is_too_long(const vertex_descriptor va,
                                 const vertex_descriptor vb) const;
 
-/// called to check whether the halfedge `h` should be collapsed in case it is
-/// shorter than the target edge size.
+/// a function controlling edge collapse by returning the squared length of `h`
+/// if it is too short, and `std::nullopt` otherwise.
 std::optional<FT> is_too_short(const halfedge_descriptor h,
                                  const PolygonMesh& pmesh) const;
 
-/// called to define the location of the halfedge `h` split in case `is_too_long()`
-/// returns a value.
+/// a function returning the location of the split point of the edge of `h`.
 Point_3 split_placement(const halfedge_descriptor h,
                         const PolygonMesh& pmesh) const;
 /// @}
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index 74bfc24e231b..f5bb6f56231b 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -79,7 +79,7 @@
 \cgalPkgPicture{hole_filling_ico.png}
 
 \cgalPkgSummaryBegin
-\cgalPkgAuthors{David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katriopla, Sébastien Loriot, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz}
+\cgalPkgAuthors{David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Ivan Pađen, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz}
 \cgalPkgDesc{This package provides a collection of methods and classes for polygon mesh processing,
 ranging from basic operations on simplices, to complex geometry processing algorithms such as
 Boolean operations, remeshing, repairing, collision and intersection detection, and more.}
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 0f89da2c013f..3b9fa8832637 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -4,7 +4,7 @@ namespace CGAL {
 \anchor Chapter_PolygonMeshProcessing
 
 \cgalAutoToc
-\authors David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katriopla, Sébastien Loriot, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz
+\authors David Coeurjolly, Jaques-Olivier Lachaud,  Konstantinos Katrioplas, Sébastien Loriot, Ivan Pađen, Mael Rouxel-Labbé, Hossam Saeed, Jane Tournois, and Ilker %O. Yaz
 
 \image html neptun_head.jpg
 \image latex neptun_head.jpg
@@ -120,10 +120,9 @@ by \cgalFigureRef{iso_remeshing}. The algorithm has two parameters:
 the sizing field object for the remeshed surface patch, and
 the number of iterations of the abovementioned sequence of operations.
 
-The sizing field establishes the target edge length for the remeshed surface. The sizing field can be uniform or
-adaptive. With the uniform sizing field, initiated by the `CGAL::Polygon_mesh_processing::Uniform_sizing_field()` constructor,
-all triangle edges are targeted to have equal lengths. On the other hand, with the adaptive sizing field, initiated by
-the `CGAL::Polygon_mesh_processing::Adaptive_sizing_field()`, triangle edge lengths depend on the local curvature --
+The sizing field establishes the local target edge length for the remeshed surface. Two sizing fields are
+provided: a uniform and a curvature-adaptive sizing field. With `CGAL::Polygon_mesh_processing::Uniform_sizing_field`,
+all triangle edges are targeted to have equal lengths. With `CGAL::Polygon_mesh_processing::Adaptive_sizing_field`, triangle edge lengths depend on the local curvature --
 shorter edges appear in regions with a higher curvature and vice versa. The outline of the adaptive sizing
 field algorithm is available in \cgalCite{dunyach2013curvRemesh}. The distinction between uniform and adaptive
 sizing fields is depicted in figure \cgalFigureRef{uniform_and_adaptive}.
@@ -1286,5 +1285,7 @@ supervision of David Coeurjolly, Jaques-Olivier Lachaud, and Sébastien Loriot.
 <a href="https://dgtal-team.github.io/doc-nightly/moduleCurvatureMeasures.html">DGtal's implementation</a> was also
 used as a reference during the project.
 
+The curvature-based sizing field version of isotropic remeshing was added by Ivan Pađen during GSoC 2023, under the supervision of Sébastien Loriot and Jane Tournois.
+
 */
 } /* namespace CGAL */
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 82a89b144dc5..3b9fd94f1895 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -35,7 +35,7 @@ namespace Polygon_mesh_processing
 * The local discrete curvatures are calculated using the
 * `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()` function.
 *
-* Edges longer than the local target edge length are split in half, while
+* Edges longer than the local target edge length are split in two, while
 * edges shorter than the local target edge length are collapsed.
 *
 * \cgalModels{PMPSizingField}
@@ -70,7 +70,7 @@ class Adaptive_sizing_field
   /// \name Creation
   /// @{
   /*!
-  * returns an object to serve as criteria for adaptive curvature-based edge lengths.
+  * constructor
   *
   * @tparam FaceRange range of `boost::graph_traits<PolygonMesh>::%face_descriptor`,
   *         model of `Range`. Its iterator type is `ForwardIterator`.
@@ -78,27 +78,19 @@ class Adaptive_sizing_field
   *
   * @param tol the error tolerance, used together with curvature to derive target edge length.
   *        Lower tolerance values will result in shorter mesh edges.
-  * @param edge_len_min_max is the stopping criterion for minimum and maximum allowed
-  *        edge length.
+  * @param edge_len_min_max contains the bounds for minimum and maximum 
+  *        edge lengths
   * @param face_range the range of triangular faces defining one or several surface patches
-  *        to be remeshed. It should be the same as the range of faces used for `isotropic_remeshing()`.
+  *        to be remeshed. It should be the same as the range of faces passed to `isotropic_remeshing()`.
   * \param vpmap is the input vertex point map that associates points to the vertices of
-  *        an input mesh.
+  *        the input mesh.
   * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. It should be the
-  *              same mesh as the one used in `isotropic_remeshing()`.
+  *              same mesh as the one passed to `isotropic_remeshing()`.
   * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 
   * \cgalNamedParamsBegin
   *   \cgalParamNBegin{ball_radius}
-  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures.
-  *                           It can potentially smooth the curvature and consequently the sizing field in the
-   *                          case of noisy input.}
-  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures.
-  *                           It can effectively smooth the curvature field and consequently the sizing field.}
-  *     \cgalParamType{`Base::FT`}
-  *     \cgalParamDefault{`-1`}
-  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-  *                     measures on faces around the vertex.}
+  *     \cgalParamDescription{`ball_radius` parameter passed to `interpolated_corrected_curvatures()`}
   *   \cgalParamNEnd
   * \cgalNamedParamsEnd
   */
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index e2e655aa1475..f6319f9fb1a6 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -27,8 +27,8 @@ namespace Polygon_mesh_processing
 * \ingroup PMP_meshing_grp
 * provides criteria for isotropic remeshing to achieve uniform mesh edge lengths.
 *
-* Edges longer than the 4/3 of the target edge length will be split in half, while
-* edges shorter than the 4/5 of the target edge length will be collapsed.
+* Edges longer than 4/3 of the target edge length will be split in half, while
+* edges shorter than 4/5 of the target edge length will be collapsed.
 *
 * \cgalModels{PMPSizingField}
 *
@@ -38,7 +38,7 @@ namespace Polygon_mesh_processing
 * @tparam PolygonMesh model of `MutableFaceGraph` that
 *         has an internal property map for `CGAL::vertex_point_t`.
 * @tparam VPMap a property map associating points to the vertices of `pmesh`.
-*         It is a a class model of `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*         It is a class model of `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *          as key type and `%Point_3` as value type. Default is `boost::get(CGAL::vertex_point, pmesh)`.
 */
 template <class PolygonMesh,
@@ -61,11 +61,11 @@ class Uniform_sizing_field
   /// @{
 
   /*!
-  * returns an object to serve as criterion for uniform edge lengths.
-  * \param size is the target edge length for the isotropic remeshing. If set to 0,
+  * Constructor.
+  * \param size the target edge length for isotropic remeshing. If set to 0,
   *        the criterion for edge length is ignored and edges are neither split nor collapsed.
   * \param vpmap is the input vertex point map that associates points to the vertices of
-  *        an input mesh.
+  *        the input mesh.
   */
   Uniform_sizing_field<PolygonMesh, VPMap>(const FT size, const VPMap& vpmap)
     : m_sq_short( CGAL::square(4./5. * size))
@@ -74,10 +74,9 @@ class Uniform_sizing_field
   {}
 
   /*!
-  * returns an object to serve as criterion for uniform edge lengths. It calls the first
-  * constructor using default values for the vertex point map of the input polygon mesh.
+  * Constructor using default values for the vertex point map of the input polygon mesh.
   *
-  * @param size is the target edge length for the isotropic remeshing. If set to 0,
+  * @param size the target edge length for isotropic remeshing. If set to 0,
   *        the criterion for edge length is ignored and edges are neither split nor collapsed.
   * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. The default
   *        vertex point map of pmesh is used to construct the class.

From 5c093c24914c453df6dc8fa02f37b192e12762ea Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Thu, 28 Sep 2023 21:11:44 -0600
Subject: [PATCH 1025/1398] Fix doc issue

---
 .../doc/Polygon_mesh_processing/Concepts/PMPSizingField.h     | 2 +-
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h      | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index c9e66b1d2745..b27f3a536a9f 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -37,7 +37,7 @@ typedef unspecified_type FT;
 std::optional<FT> is_too_long(const halfedge_descriptor h,
                                 const PolygonMesh& pmesh) const;
 
-/// a function controlling edge split and edge collapse, 
+/// a function controlling edge split and edge collapse,
 /// returning the squared distance between the points of `va` and `vb`
 /// if an edge between `va` and `vb` would be too long, and `std::nullopt` otherwise.
 std::optional<FT> is_too_long(const vertex_descriptor va,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 3b9fd94f1895..8f5e8079de6d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -70,7 +70,7 @@ class Adaptive_sizing_field
   /// \name Creation
   /// @{
   /*!
-  * constructor
+  * Constructor
   *
   * @tparam FaceRange range of `boost::graph_traits<PolygonMesh>::%face_descriptor`,
   *         model of `Range`. Its iterator type is `ForwardIterator`.
@@ -78,7 +78,7 @@ class Adaptive_sizing_field
   *
   * @param tol the error tolerance, used together with curvature to derive target edge length.
   *        Lower tolerance values will result in shorter mesh edges.
-  * @param edge_len_min_max contains the bounds for minimum and maximum 
+  * @param edge_len_min_max contains the bounds for minimum and maximum
   *        edge lengths
   * @param face_range the range of triangular faces defining one or several surface patches
   *        to be remeshed. It should be the same as the range of faces passed to `isotropic_remeshing()`.

From 98c64c351321c3bfcf5dc22b61c6d6a5e405b41f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Thu, 28 Sep 2023 22:04:13 -0600
Subject: [PATCH 1026/1398] Update is_too_long to work only with vertex
 descriptors

---
 .../Concepts/PMPSizingField.h                 |  6 -----
 .../Adaptive_sizing_field.h                   | 13 ----------
 .../Sizing_field_base.h                       |  2 --
 .../Uniform_sizing_field.h                    |  9 -------
 .../Isotropic_remeshing/remesh_impl.h         | 26 +++++++++++--------
 5 files changed, 15 insertions(+), 41 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index b27f3a536a9f..6e5ca3f5c330 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -31,12 +31,6 @@ typedef unspecified_type FT;
 /// @name Functions
 /// @{
 
-/// called to check whether the halfedge `h` is longer than the target edge size
-/// and as such should be split. If the halfedge is longer, it returns the squared
-/// length of the edge.
-std::optional<FT> is_too_long(const halfedge_descriptor h,
-                                const PolygonMesh& pmesh) const;
-
 /// a function controlling edge split and edge collapse,
 /// returning the squared distance between the points of `va` and `vb`
 /// if an edge between `va` and `vb` would be too long, and `std::nullopt` otherwise.
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 8f5e8079de6d..4fafa678caa9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -255,19 +255,6 @@ class Adaptive_sizing_field
     return get(m_vertex_sizing_map, v);
   }
 
-  std::optional<FT> is_too_long(const halfedge_descriptor h, const PolygonMesh& pmesh) const
-  {
-    const FT sqlen = sqlength(h, pmesh);
-    FT sqtarg_len = CGAL::square(4./3. * (CGAL::min)(get(m_vertex_sizing_map, source(h, pmesh)),
-                                                     get(m_vertex_sizing_map, target(h, pmesh))));
-    CGAL_assertion(get(m_vertex_sizing_map, source(h, pmesh)));
-    CGAL_assertion(get(m_vertex_sizing_map, target(h, pmesh)));
-    if(sqlen > sqtarg_len)
-      return sqlen;
-    else
-      return std::nullopt;
-  }
-
   std::optional<FT> is_too_long(const vertex_descriptor va, const vertex_descriptor vb) const
   {
     const FT sqlen = sqlength(va, vb);
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Sizing_field_base.h
index 8cb12191ad1a..c5a9d0b01bd1 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Sizing_field_base.h
@@ -58,8 +58,6 @@ class Sizing_field_base
   typedef typename K::FT                                        FT;
 
 public:
-  virtual std::optional<FT> is_too_long(const halfedge_descriptor h,
-                                        const PolygonMesh& pmesh) const = 0;
   virtual std::optional<FT> is_too_long(const vertex_descriptor va,
                                         const vertex_descriptor vb) const = 0;
   virtual std::optional<FT> is_too_short(const halfedge_descriptor h,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index f6319f9fb1a6..99d98ea74596 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -100,15 +100,6 @@ class Uniform_sizing_field
   }
 
 public:
-  std::optional<FT> is_too_long(const halfedge_descriptor h, const PolygonMesh& pmesh) const
-  {
-    const FT sqlen = sqlength(h, pmesh);
-    if(sqlen > m_sq_long)
-      return sqlen;
-    else
-      return std::nullopt;
-  }
-
   std::optional<FT> is_too_long(const vertex_descriptor va, const vertex_descriptor vb) const
   {
     const FT sqlen = sqlength(va, vb);
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index f7d93ab1e307..5a489c175050 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -399,9 +399,10 @@ namespace internal {
         );
       for(edge_descriptor e : edge_range)
       {
-        std::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_), mesh_);
+        const halfedge_descriptor he = halfedge(e, mesh_);
+        std::optional<double> sqlen = sizing.is_too_long(source(he, mesh_), target(he, mesh_));
         if(sqlen != std::nullopt)
-          long_edges.emplace(halfedge(e, mesh_), sqlen.value());
+          long_edges.emplace(he, sqlen.value());
       }
 
       //split long edges
@@ -437,13 +438,14 @@ namespace internal {
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
-        std::optional<double> sqlen_new = sizing.is_too_long(hnew, mesh_);
+        std::optional<double> sqlen_new = sizing.is_too_long(source(hnew, mesh_), target(hnew, mesh_));
         if(sqlen_new != std::nullopt)
           long_edges.emplace(hnew, sqlen_new.value());
 
-        sqlen_new = sizing.is_too_long(next(hnew, mesh_), mesh_);
+        const halfedge_descriptor hnext = next(hnew, mesh_);
+        sqlen_new = sizing.is_too_long(source(hnext, mesh_), target(hnext, mesh_));
         if (sqlen_new != std::nullopt)
-          long_edges.emplace(next(hnew, mesh_), sqlen_new.value());
+          long_edges.emplace(hnext, sqlen_new.value());
 
         //insert new edges to keep triangular faces, and update long_edges
         if (!is_border(hnew, mesh_))
@@ -498,7 +500,8 @@ namespace internal {
       {
         if (!is_split_allowed(e))
           continue;
-        std::optional<double> sqlen = sizing.is_too_long(halfedge(e, mesh_), mesh_);
+        const halfedge_descriptor he = halfedge(e, mesh_);
+        std::optional<double> sqlen = sizing.is_too_long(source(he, mesh_), target(he, mesh_));
         if(sqlen != std::nullopt)
           long_edges.emplace(halfedge(e, mesh_), sqlen.value());
       }
@@ -553,13 +556,14 @@ namespace internal {
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
-        std::optional<double> sqlen_new = sizing.is_too_long(hnew, mesh_);
+        std::optional<double> sqlen_new = sizing.is_too_long(source(hnew, mesh_), target(hnew, mesh_));
         if(sqlen_new != std::nullopt)
           long_edges.emplace(hnew, sqlen_new.value());
 
-        sqlen_new = sizing.is_too_long(next(hnew, mesh_), mesh_);
+        const halfedge_descriptor hnext = next(hnew, mesh_);
+        sqlen_new = sizing.is_too_long(source(hnext, mesh_), target(hnext, mesh_));
         if (sqlen_new != std::nullopt)
-          long_edges.emplace(next(hnew, mesh_), sqlen_new.value());
+          long_edges.emplace(hnext, sqlen_new.value());
 
         //insert new edges to keep triangular faces, and update long_edges
         if (!is_on_border(hnew))
@@ -578,7 +582,7 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            std::optional<double> sql = sizing.is_too_long(hnew2, mesh_);
+            std::optional<double> sql = sizing.is_too_long(source(hnew2, mesh_), target(hnew2, mesh_));
             if(sql != std::nullopt)
               long_edges.emplace(hnew2, sql.value());
           }
@@ -601,7 +605,7 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            std::optional<double> sql = sizing.is_too_long(hnew2, mesh_);
+            std::optional<double> sql = sizing.is_too_long(source(hnew2, mesh_), target(hnew2, mesh_));
             if (sql != std::nullopt)
               long_edges.emplace(hnew2, sql.value());
           }

From dfc2390d714cd35cc0b58f616c19565d48134839 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Thu, 28 Sep 2023 22:10:11 -0600
Subject: [PATCH 1027/1398] Move Sizing_field_base to internal

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h    | 6 +++---
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h     | 6 +++---
 .../{ => internal}/Sizing_field_base.h                      | 3 +++
 3 files changed, 9 insertions(+), 6 deletions(-)
 rename Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/{ => internal}/Sizing_field_base.h (98%)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 4fafa678caa9..3083b8179e12 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
-#include <CGAL/Polygon_mesh_processing/Sizing_field_base.h>
+#include <CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h>
 #include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 
 #include <CGAL/boost/graph/selection.h>
@@ -50,11 +50,11 @@ template <class PolygonMesh,
           class VPMap = typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
 class Adaptive_sizing_field
 #ifndef DOXYGEN_RUNNING
-  : public Sizing_field_base<PolygonMesh, VPMap>
+: public internal::Sizing_field_base<PolygonMesh, VPMap>
 #endif
 {
 private:
-  typedef Sizing_field_base<PolygonMesh, VPMap> Base;
+  typedef internal::Sizing_field_base<PolygonMesh, VPMap> Base;
   typedef typename CGAL::dynamic_vertex_property_t<typename Base::FT> Vertex_property_tag;
   typedef typename boost::property_map<PolygonMesh,
                                        Vertex_property_tag>::type VertexSizingMap;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 99d98ea74596..5e3b22078966 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -15,7 +15,7 @@
 
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
-#include <CGAL/Polygon_mesh_processing/Sizing_field_base.h>
+#include <CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h>
 
 #include <CGAL/number_utils.h>
 
@@ -45,11 +45,11 @@ template <class PolygonMesh,
           class VPMap =  typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
 class Uniform_sizing_field
 #ifndef DOXYGEN_RUNNING
-  : public Sizing_field_base<PolygonMesh, VPMap>
+: public internal::Sizing_field_base<PolygonMesh, VPMap>
 #endif
 {
 private:
-  typedef Sizing_field_base<PolygonMesh, VPMap> Base;
+  typedef internal::Sizing_field_base<PolygonMesh, VPMap> Base;
 
 public:
   typedef typename Base::FT         FT;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
similarity index 98%
rename from Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Sizing_field_base.h
rename to Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
index c5a9d0b01bd1..a7f19a26dfb8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
@@ -24,6 +24,8 @@ namespace CGAL
 {
 namespace Polygon_mesh_processing
 {
+namespace internal
+{
 /*!
 * \ingroup PMP_meshing_grp
 * pure virtual class serving as a base for sizing field classes utilized in isotropic
@@ -66,6 +68,7 @@ class Sizing_field_base
 
 };
 
+}//end namespace internal
 }//end namespace Polygon_mesh_processing
 }//end namespace CGAL
 

From 6b37280a0b32bc7f2388d43ff6e364bfcfe8d7b6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Fri, 29 Sep 2023 21:01:10 -0600
Subject: [PATCH 1028/1398] Make is_too_short() and is_too_long() return
 edge-to-target ratio

---
 .../doc/Polygon_mesh_processing/Concepts/PMPSizingField.h | 8 ++++----
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h  | 4 ++--
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h   | 2 ++
 3 files changed, 8 insertions(+), 6 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index 6e5ca3f5c330..8cdfb541ed6e 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -32,13 +32,13 @@ typedef unspecified_type FT;
 /// @{
 
 /// a function controlling edge split and edge collapse,
-/// returning the squared distance between the points of `va` and `vb`
-/// if an edge between `va` and `vb` would be too long, and `std::nullopt` otherwise.
+/// returning the ratio of the current edge length and the local target edge length between
+/// the points of `va` and `vb` in case the current edge is too long, and `std::nullopt` otherwise.
 std::optional<FT> is_too_long(const vertex_descriptor va,
                                 const vertex_descriptor vb) const;
 
-/// a function controlling edge collapse by returning the squared length of `h`
-/// if it is too short, and `std::nullopt` otherwise.
+/// a function controlling edge collapse by returning the ratio of the squared length of `h` and the
+/// local target edge length if it is too short, and `std::nullopt` otherwise.
 std::optional<FT> is_too_short(const halfedge_descriptor h,
                                  const PolygonMesh& pmesh) const;
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 3083b8179e12..f90fa84a2bf3 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -263,7 +263,7 @@ class Adaptive_sizing_field
     CGAL_assertion(get(m_vertex_sizing_map, va));
     CGAL_assertion(get(m_vertex_sizing_map, vb));
     if (sqlen > sqtarg_len)
-      return sqlen;
+      return sqlen / sqtarg_len;
     else
       return std::nullopt;
   }
@@ -276,7 +276,7 @@ class Adaptive_sizing_field
     CGAL_assertion(get(m_vertex_sizing_map, source(h, pmesh)));
     CGAL_assertion(get(m_vertex_sizing_map, target(h, pmesh)));
     if (sqlen < sqtarg_len)
-      return sqlen;
+      return sqlen / sqtarg_len;
     else
       return std::nullopt;
   }
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 5e3b22078966..c3084a34be67 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -104,6 +104,7 @@ class Uniform_sizing_field
   {
     const FT sqlen = sqlength(va, vb);
     if (sqlen > m_sq_long)
+      //no need to return the ratio for the uniform field
       return sqlen;
     else
       return std::nullopt;
@@ -113,6 +114,7 @@ class Uniform_sizing_field
   {
     const FT sqlen = sqlength(h, pmesh);
     if (sqlen < m_sq_short)
+      //no need to return the ratio for the uniform field
       return sqlen;
     else
       return std::nullopt;

From 3b4af4be313f7c8e84ec3f0e124ffdcb779c1e84 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Fri, 29 Sep 2023 21:09:44 -0600
Subject: [PATCH 1029/1398] Update the sizing field updating function

---
 .../doc/Polygon_mesh_processing/Concepts/PMPSizingField.h | 8 ++++++--
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h  | 2 +-
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h   | 3 +++
 .../internal/Isotropic_remeshing/remesh_impl.h            | 6 ++----
 .../Polygon_mesh_processing/internal/Sizing_field_base.h  | 1 +
 5 files changed, 13 insertions(+), 7 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index 8cdfb541ed6e..5b90dddfbc92 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -35,16 +35,20 @@ typedef unspecified_type FT;
 /// returning the ratio of the current edge length and the local target edge length between
 /// the points of `va` and `vb` in case the current edge is too long, and `std::nullopt` otherwise.
 std::optional<FT> is_too_long(const vertex_descriptor va,
-                                const vertex_descriptor vb) const;
+                              const vertex_descriptor vb) const;
 
 /// a function controlling edge collapse by returning the ratio of the squared length of `h` and the
 /// local target edge length if it is too short, and `std::nullopt` otherwise.
 std::optional<FT> is_too_short(const halfedge_descriptor h,
-                                 const PolygonMesh& pmesh) const;
+                               const PolygonMesh& pmesh) const;
 
 /// a function returning the location of the split point of the edge of `h`.
 Point_3 split_placement(const halfedge_descriptor h,
                         const PolygonMesh& pmesh) const;
+
+/// a function that updates the sizing field value at the vertex `v`.
+void update(const vertex_descriptor v, const PolygonMesh& pmesh);
+
 /// @}
 };
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index f90fa84a2bf3..df9f21fec20a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -287,7 +287,7 @@ class Adaptive_sizing_field
                     get(m_vpmap, source(h, pmesh)));
   }
 
-  void update_sizing_map(const vertex_descriptor v, const PolygonMesh& pmesh)
+  void update(const vertex_descriptor v, const PolygonMesh& pmesh)
   {
     // calculating it as the average of two vertices on other ends
     // of halfedges as updating is done during an edge split
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index c3084a34be67..b3a501486275 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -126,6 +126,9 @@ class Uniform_sizing_field
                     get(m_vpmap, source(h, pmesh)));
   }
 
+  void update(const vertex_descriptor v, const PolygonMesh& pmesh)
+  {}
+
 private:
   FT m_sq_short;
   FT m_sq_long;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 5a489c175050..bb5ba5baeac8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -433,8 +433,7 @@ namespace internal {
         std::cout << "   refinement point : " << refinement_point << std::endl;
 #endif
         //update sizing field with the new point
-        if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM, VertexPointMap>>)
-          sizing.update_sizing_map(vnew, mesh_);
+        sizing.update(vnew, mesh_);
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
@@ -551,8 +550,7 @@ namespace internal {
         halfedge_added(hnew_opp, status(opposite(he, mesh_)));
 
         //update sizing field with the new point
-        if constexpr (!std::is_same_v<SizingFunction, Uniform_sizing_field<PM, VertexPointMap>>)
-          sizing.update_sizing_map(vnew, mesh_);
+        sizing.update(vnew, mesh_);
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
index a7f19a26dfb8..3835f1803585 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
@@ -65,6 +65,7 @@ class Sizing_field_base
   virtual std::optional<FT> is_too_short(const halfedge_descriptor h,
                                          const PolygonMesh& pmesh) const = 0;
   virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const = 0;
+  virtual void update(const vertex_descriptor v, const PolygonMesh& pmesh) = 0;
 
 };
 

From e9aa5b9b3b84f24faace3b68b5979ff1baa8e53a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Fri, 29 Sep 2023 21:40:18 -0600
Subject: [PATCH 1030/1398] Replace vpmap constructor with np in
 Adaptive_sizing_field

---
 .../Adaptive_sizing_field.h                   | 61 ++++---------------
 1 file changed, 13 insertions(+), 48 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index df9f21fec20a..61a9545d55e3 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -82,13 +82,21 @@ class Adaptive_sizing_field
   *        edge lengths
   * @param face_range the range of triangular faces defining one or several surface patches
   *        to be remeshed. It should be the same as the range of faces passed to `isotropic_remeshing()`.
-  * \param vpmap is the input vertex point map that associates points to the vertices of
-  *        the input mesh.
   * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. It should be the
   *              same mesh as the one passed to `isotropic_remeshing()`.
   * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 
   * \cgalNamedParamsBegin
+  *   \cgalParamNBegin{vertex_point_map}
+  *     \cgalParamDescription{a property map associating points to the vertices of `pmesh`}
+  *     \cgalParamType{a class model of `ReadWritePropertyMap` with
+  *                   `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+  *                    as key type and `%Point_3` as value type}
+  *     \cgalParamDefault{`boost::get(CGAL::vertex_point, pmesh)`}
+  *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
+  *                     must be available in `PolygonMesh`.}
+  *   \cgalParamNEnd
+  *
   *   \cgalParamNBegin{ball_radius}
   *     \cgalParamDescription{`ball_radius` parameter passed to `interpolated_corrected_curvatures()`}
   *   \cgalParamNEnd
@@ -99,13 +107,14 @@ class Adaptive_sizing_field
   Adaptive_sizing_field(const FT tol
                       , const std::pair<FT, FT>& edge_len_min_max
                       , const FaceRange& face_range
-                      , const VPMap& vpmap
                       , PolygonMesh& pmesh
                       , const NamedParameters& np = parameters::default_values())
     : tol(tol)
     , m_short(edge_len_min_max.first)
     , m_long(edge_len_min_max.second)
-    , m_vpmap(vpmap)
+    , m_vpmap(parameters::choose_parameter(
+                parameters::get_parameter(np, internal_np::vertex_point),
+                get_property_map(vertex_point, pmesh)))
     , m_vertex_sizing_map(get(Vertex_property_tag(), pmesh))
   {
     if (face_range.size() == faces(pmesh).size())
@@ -128,50 +137,6 @@ class Adaptive_sizing_field
     }
   }
 
-  /*!
-  * returns an object to serve as criteria for adaptive curvature-based edge lengths. It calls
-  * the first constructor using default values for the vertex point map of the input polygon mesh.
-  *
-  * @tparam FaceRange range of `boost::graph_traits<PolygonMesh>::%face_descriptor`,
-  *         model of `Range`. Its iterator type is `ForwardIterator`.
-  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
-  *
-  * @param tol the error tolerance, used together with curvature to derive target edge length.
-  *        Lower tolerance values will result in shorter mesh edges.
-  * @param edge_len_min_max is the stopping criterion for minimum and maximum allowed
-  *        edge length.
-  * @param face_range the range of triangular faces defining one or several surface patches
-  *        to be remeshed. It should be the same as the range of faces used for `isotropic_remeshing()`.
-  * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. It should be the
-  *              same mesh as the one used in `isotropic_remeshing()`. Additionally, the default vertex point
-  *              map of pmesh is used to construct the class.
-  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-
-  * \cgalNamedParamsBegin
-  *   \cgalParamNBegin{ball_radius}
-  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures.
-  *                           It can potentially smooth the curvature and consequently the sizing field in the
-   *                          case of noisy input.}
-  *     \cgalParamDescription{a scalar value specifying the radius used for expanding curvature measures.
-  *                           It can effectively smooth the curvature field and consequently the sizing field.}
-  *     \cgalParamType{`Base::FT`}
-  *     \cgalParamDefault{`-1`}
-  *     \cgalParamExtra{If this parameter is omitted (`-1`), the expansion will just by a weightless sum of
-  *                     measures on faces around the vertex.}
-  *   \cgalParamNEnd
-  * \cgalNamedParamsEnd
-  */
-  template <typename FaceRange
-          , typename NamedParameters = parameters::Default_named_parameters>
-  Adaptive_sizing_field(const FT tol
-                      , const std::pair<FT, FT>& edge_len_min_max
-                      , const FaceRange& face_range
-                      , PolygonMesh& pmesh
-                      , const NamedParameters& np = parameters::default_values())
-    : Adaptive_sizing_field(tol, edge_len_min_max, face_range,
-                            get(CGAL::vertex_point, pmesh), pmesh, np)
-  {}
-
   ///@}
 
 private:

From faaeba8466f85c6a2c5796f6c370c7ce8e5bb335 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Fri, 29 Sep 2023 22:21:41 -0600
Subject: [PATCH 1031/1398] Use interpolated_corrected_curvatures() with vertex
 property map

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h  | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 61a9545d55e3..91e04160d113 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -33,7 +33,7 @@ namespace Polygon_mesh_processing
 * of local discrete curvatures.
 *
 * The local discrete curvatures are calculated using the
-* `CGAL::Polygon_mesh_processing::interpolated_corrected_principal_curvatures_and_directions()` function.
+* `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()` function.
 *
 * Edges longer than the local target edge length are split in two, while
 * edges shorter than the local target edge length are collapsed.
@@ -163,9 +163,9 @@ class Adaptive_sizing_field
 #endif
 
     Vertex_curvature_map vertex_curvature_map = get(Vertex_curvature_tag(), face_graph);
-    interpolated_corrected_principal_curvatures_and_directions(face_graph,
-                                                               vertex_curvature_map,
-                                                               parameters::ball_radius(radius));
+    interpolated_corrected_curvatures(face_graph,
+                                      parameters::vertex_principal_curvatures_and_directions_map(vertex_curvature_map)
+                                                 .ball_radius(radius));
     // calculate vertex sizing field L(x_i) from the curvature field
     for(vertex_descriptor v : vertices(face_graph))
     {

From ace77795a32e4c4e7276b154e85d5fad0cb2fe4a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Mon, 2 Oct 2023 20:11:37 -0600
Subject: [PATCH 1032/1398] Apply suggestions from code review

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 .../internal/Isotropic_remeshing/remesh_impl.h                | 4 ++--
 .../include/CGAL/Polygon_mesh_processing/remesh.h             | 2 +-
 .../CGAL/Polygon_mesh_processing/tangential_relaxation.h      | 3 ++-
 3 files changed, 5 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index bb5ba5baeac8..3e59249af72c 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -386,8 +386,8 @@ namespace internal {
     {
 
 #ifdef CGAL_PMP_REMESHING_VERBOSE
-//      std::cout << "Split long edges (" << high << ")...";
-//      std::cout.flush();
+      std::cout << "Split long edges...";
+      std::cout.flush();
 #endif
 
       //collect long edges
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 43bb5605a27b..799d15d03ffc 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -203,7 +203,7 @@ template<typename PolygonMesh
 void isotropic_remeshing(const FaceRange& faces
                        , SizingFunction& sizing
                        , PolygonMesh& pmesh
-                       , const NamedParameters& np)
+                       , const NamedParameters& np = parameters::default_values())
 {
   if (std::begin(faces)==std::end(faces))
     return;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index ab89f75afe34..a77c5f1595b8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -379,7 +379,8 @@ void tangential_relaxation(const VertexRange& vertices,
 *
 *   \cgalParamNBegin{edge_is_constrained_map}
 *     \cgalParamDescription{a property map containing the constrained-or-not status of each edge of `tm`.
-*                           The endpoints of a constrained edge cannot be moved by relaxation.}
+*                           The endpoints of a constrained edge cannot be moved by relaxation, unless `relax_constraints` is `true`.
+*                           The endpoints of a constrained polyline can never be moved by relaxation.
 *     \cgalParamType{a class model of `ReadWritePropertyMap` with `boost::graph_traits<TriangleMesh>::%edge_descriptor`
 *                    as key type and `bool` as value type. It must be default constructible.}
 *     \cgalParamDefault{a default property map where no edges are constrained}

From 740648622f68e5f9797353d55d50ba088ab4c0d1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Mon, 2 Oct 2023 20:34:03 -0600
Subject: [PATCH 1033/1398] Attempt to combine tangential realxations into
 overload

---
 .../PackageDescription.txt                    |  1 -
 .../Isotropic_remeshing/remesh_impl.h         |  2 +-
 .../tangential_relaxation.h                   | 49 ++++++++++---------
 3 files changed, 26 insertions(+), 26 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index f5bb6f56231b..f82c5af569e2 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -129,7 +129,6 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - `CGAL::Polygon_mesh_processing::smooth_mesh()` (deprecated)
 - `CGAL::Polygon_mesh_processing::angle_and_area_smoothing()`
 - `CGAL::Polygon_mesh_processing::tangential_relaxation()`
-- `CGAL::Polygon_mesh_processing::tangential_relaxation_with_sizing()`
 - `CGAL::Polygon_mesh_processing::smooth_shape()`
 - `CGAL::Polygon_mesh_processing::random_perturbation()`
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 3e59249af72c..499bbd6c4e30 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -1071,7 +1071,7 @@ namespace internal {
         std::cout << " using tangential relaxation weighted with the sizing field";
         std::cout << std::endl;
 #endif
-        tangential_relaxation_with_sizing(
+        tangential_relaxation(
           vertices(mesh_),
           mesh_,
           sizing,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index a77c5f1595b8..ae257f9eb57e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -119,10 +119,12 @@ struct Allow_all_moves{
 *
 * \todo check if it should really be a triangle mesh or if a polygon mesh is fine
 */
-template <typename VertexRange, class TriangleMesh, class NamedParameters = parameters::Default_named_parameters>
+template <typename VertexRange,
+          class TriangleMesh,
+          typename CGAL_NP_TEMPLATE_PARAMETERS>
 void tangential_relaxation(const VertexRange& vertices,
                            TriangleMesh& tm,
-                           const NamedParameters& np = parameters::default_values())
+                           const CGAL_NP_CLASS& np = parameters::default_values())
 {
   typedef typename boost::graph_traits<TriangleMesh>::vertex_descriptor vertex_descriptor;
   typedef typename boost::graph_traits<TriangleMesh>::halfedge_descriptor halfedge_descriptor;
@@ -131,17 +133,17 @@ void tangential_relaxation(const VertexRange& vertices,
   using parameters::get_parameter;
   using parameters::choose_parameter;
 
-  typedef typename GetGeomTraits<TriangleMesh, NamedParameters>::type GT;
+  typedef typename GetGeomTraits<TriangleMesh, CGAL_NP_CLASS>::type GT;
   GT gt = choose_parameter(get_parameter(np, internal_np::geom_traits), GT());
 
-  typedef typename GetVertexPointMap<TriangleMesh, NamedParameters>::type VPMap;
+  typedef typename GetVertexPointMap<TriangleMesh, CGAL_NP_CLASS>::type VPMap;
   VPMap vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
                                get_property_map(vertex_point, tm));
 
   typedef Static_boolean_property_map<edge_descriptor, false> Default_ECM;
   typedef typename internal_np::Lookup_named_param_def <
       internal_np::edge_is_constrained_t,
-      NamedParameters,
+      CGAL_NP_CLASS,
       Static_boolean_property_map<edge_descriptor, false> // default (no constraint)
     > ::type ECM;
   ECM ecm = choose_parameter(get_parameter(np, internal_np::edge_is_constrained),
@@ -149,7 +151,7 @@ void tangential_relaxation(const VertexRange& vertices,
 
   typedef typename internal_np::Lookup_named_param_def <
       internal_np::vertex_is_constrained_t,
-      NamedParameters,
+      CGAL_NP_CLASS,
       Static_boolean_property_map<vertex_descriptor, false> // default (no constraint)
     > ::type VCM;
   VCM vcm = choose_parameter(get_parameter(np, internal_np::vertex_is_constrained),
@@ -201,7 +203,7 @@ void tangential_relaxation(const VertexRange& vertices,
 
   typedef typename internal_np::Lookup_named_param_def <
       internal_np::allow_move_functor_t,
-      NamedParameters,
+      CGAL_NP_CLASS,
       internal::Allow_all_moves// default
     > ::type Shall_move;
   Shall_move shall_move = choose_parameter(get_parameter(np, internal_np::allow_move_functor),
@@ -281,8 +283,6 @@ void tangential_relaxation(const VertexRange& vertices,
             bary = squared_distance(p1, bary)<squared_distance(p2,bary)? p1:p2;
             barycenters.emplace_back(v, vn, bary);
           }
-
-
         }
       }
     }
@@ -417,11 +417,11 @@ void tangential_relaxation(const VertexRange& vertices,
 template <typename VertexRange,
           class TriangleMesh,
           class SizingFunction,
-          class NamedParameters = parameters::Default_named_parameters>
-void tangential_relaxation_with_sizing(const VertexRange& vertices,
-                                       TriangleMesh& tm,
-                                       const SizingFunction& sizing,
-                                       const NamedParameters& np = parameters::default_values())
+          typename CGAL_NP_TEMPLATE_PARAMETERS>
+void tangential_relaxation(const VertexRange& vertices,
+                           TriangleMesh& tm,
+                           const SizingFunction& sizing,
+                           const CGAL_NP_CLASS& np = parameters::default_values())
 {
   typedef typename boost::graph_traits<TriangleMesh>::vertex_descriptor vertex_descriptor;
   typedef typename boost::graph_traits<TriangleMesh>::halfedge_descriptor halfedge_descriptor;
@@ -430,17 +430,17 @@ void tangential_relaxation_with_sizing(const VertexRange& vertices,
   using parameters::get_parameter;
   using parameters::choose_parameter;
 
-  typedef typename GetGeomTraits<TriangleMesh, NamedParameters>::type GT;
+  typedef typename GetGeomTraits<TriangleMesh, CGAL_NP_CLASS>::type GT;
   GT gt = choose_parameter(get_parameter(np, internal_np::geom_traits), GT());
 
-  typedef typename GetVertexPointMap<TriangleMesh, NamedParameters>::type VPMap;
+  typedef typename GetVertexPointMap<TriangleMesh, CGAL_NP_CLASS>::type VPMap;
   VPMap vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
     get_property_map(vertex_point, tm));
 
   typedef Static_boolean_property_map<edge_descriptor, false> Default_ECM;
   typedef typename internal_np::Lookup_named_param_def <
     internal_np::edge_is_constrained_t,
-    NamedParameters,
+    CGAL_NP_CLASS,
     Static_boolean_property_map<edge_descriptor, false> // default (no constraint)
   > ::type ECM;
   ECM ecm = choose_parameter(get_parameter(np, internal_np::edge_is_constrained),
@@ -448,7 +448,7 @@ void tangential_relaxation_with_sizing(const VertexRange& vertices,
 
   typedef typename internal_np::Lookup_named_param_def <
     internal_np::vertex_is_constrained_t,
-    NamedParameters,
+    CGAL_NP_CLASS,
     Static_boolean_property_map<vertex_descriptor, false> // default (no constraint)
   > ::type VCM;
   VCM vcm = choose_parameter(get_parameter(np, internal_np::vertex_is_constrained),
@@ -500,7 +500,7 @@ void tangential_relaxation_with_sizing(const VertexRange& vertices,
 
   typedef typename internal_np::Lookup_named_param_def <
     internal_np::allow_move_functor_t,
-    NamedParameters,
+    CGAL_NP_CLASS,
     internal::Allow_all_moves// default
   > ::type Shall_move;
   Shall_move shall_move = choose_parameter(get_parameter(np, internal_np::allow_move_functor),
@@ -634,7 +634,8 @@ void tangential_relaxation_with_sizing(const VertexRange& vertices,
 */
 template <class TriangleMesh,
           typename CGAL_NP_TEMPLATE_PARAMETERS>
-void tangential_relaxation(TriangleMesh& tm, const CGAL_NP_CLASS& np = parameters::default_values())
+void tangential_relaxation(TriangleMesh& tm,
+                           const CGAL_NP_CLASS& np = parameters::default_values())
 {
   tangential_relaxation(vertices(tm), tm, np);
 }
@@ -642,11 +643,11 @@ void tangential_relaxation(TriangleMesh& tm, const CGAL_NP_CLASS& np = parameter
 template <class TriangleMesh,
           typename SizingFunction,
           typename CGAL_NP_TEMPLATE_PARAMETERS>
-void tangential_relaxation_with_sizing(TriangleMesh& tm,
-                                       const SizingFunction& sizing,
-                                       const CGAL_NP_CLASS& np = parameters::default_values())
+void tangential_relaxation(TriangleMesh& tm,
+                           const SizingFunction& sizing,
+                           const CGAL_NP_CLASS& np = parameters::default_values())
 {
-  tangential_relaxation_with_sizing(vertices(tm), tm, sizing, np);
+  tangential_relaxation(vertices(tm), tm, sizing, np);
 }
 
 } } // CGAL::Polygon_mesh_processing

From e885155c229162ca645b6fd649ddd0e4d70031cd Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 3 Oct 2023 08:55:36 +0200
Subject: [PATCH 1034/1398] fix warnings

---
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h   | 2 +-
 .../Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp | 8 ++++----
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index b3a501486275..716729125f86 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -126,7 +126,7 @@ class Uniform_sizing_field
                     get(m_vpmap, source(h, pmesh)));
   }
 
-  void update(const vertex_descriptor v, const PolygonMesh& pmesh)
+  void update(const vertex_descriptor /* v */, const PolygonMesh& /* pmesh */)
   {}
 
 private:
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 02c61ba52c2e..902fa9a0e7c9 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -1116,8 +1116,8 @@ public Q_SLOTS:
       const unsigned int nb_iter,
       const bool protect,
       const bool smooth_features)
-      : edges_only_(edges_only)
-      , edge_sizing_type_(edge_sizing_type)
+      : edge_sizing_type_(edge_sizing_type)
+      , edges_only_(edges_only)
       , target_length_(target_length)
       , error_tol_(error_tol)
       , min_length_(min_length)
@@ -1128,8 +1128,8 @@ public Q_SLOTS:
     {}
 
     Remesh_polyhedron_item(const Remesh_polyhedron_item& remesh)
-      : edges_only_(remesh.edges_only_)
-      , edge_sizing_type_(remesh.edge_sizing_type_)
+      : edge_sizing_type_(remesh.edge_sizing_type_)
+      , edges_only_(remesh.edges_only_)
       , target_length_(remesh.target_length_)
       , error_tol_(remesh.error_tol_)
       , min_length_(remesh.min_length_)

From 34c126839f410ec8cac8123866d0ac8a2d388d7b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Tue, 3 Oct 2023 20:38:36 -0600
Subject: [PATCH 1035/1398] Address warnings

---
 .../Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp   | 6 ------
 1 file changed, 6 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
index 902fa9a0e7c9..c87fb567631d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Isotropic_remeshing_plugin.cpp
@@ -396,7 +396,6 @@ public Q_SLOTS:
       unsigned int nb_smooth = ui.nbSmoothing_spinbox->value();
       bool protect = ui.protect_checkbox->isChecked();
       bool smooth_features = ui.smooth1D_checkbox->isChecked();
-      bool curv_smooth = ui.curvSmooth_checkbox->isChecked();
       double curv_ball_r = ui.curvSmoothBallR_edit->value();
 
       // wait cursor
@@ -871,8 +870,6 @@ public Q_SLOTS:
     unsigned int nb_iter = 1;
     bool protect = false;
     bool smooth_features = true;
-    bool curv_smooth = false;
-    double curv_ball_r = -1;
 
     std::vector<Scene_facegraph_item*> selection;
     for(int index : scene->selectionIndices())
@@ -913,8 +910,6 @@ public Q_SLOTS:
         nb_iter = ui.nbIterations_spinbox->value();
         protect = ui.protect_checkbox->isChecked();
         smooth_features = ui.smooth1D_checkbox->isChecked();
-        curv_smooth = ui.curvSmooth_checkbox->isChecked();
-        curv_ball_r = ui.curvSmoothBallR_edit->value();
         }
       }
     }
@@ -1024,7 +1019,6 @@ public Q_SLOTS:
     unsigned int nb_iter_;
     bool protect_;
     bool smooth_features_;
-    bool curv_smooth_;
     double curv_ball_r_;
 
   protected:

From 627a36fac7f546145e2c023601f007a0194fb614 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Thu, 5 Oct 2023 22:36:12 -0600
Subject: [PATCH 1036/1398] Combining tangential relaxations in one function
 WIP

---
 .../Isotropic_remeshing/remesh_impl.h         |  4 +-
 .../tangential_relaxation.h                   | 58 ++++++++++++++++---
 .../internal/parameters_interface.h           |  1 +
 3 files changed, 52 insertions(+), 11 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 499bbd6c4e30..c1696428d756 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -1048,7 +1048,7 @@ namespace internal {
       auto constrained_vertices_pmap
         = boost::make_function_property_map<vertex_descriptor>(vertex_constraint);
 
-      if constexpr (std::is_same<SizingFunction, Uniform_sizing_field<PM, VertexPointMap>>::value)
+      if constexpr (std::is_same_v<SizingFunction, Uniform_sizing_field<PM, VertexPointMap>>)
       {
 #ifdef CGAL_PMP_REMESHING_VERBOSE
         std::cout << " using tangential relaxation with weights equal to 1";
@@ -1074,13 +1074,13 @@ namespace internal {
         tangential_relaxation(
           vertices(mesh_),
           mesh_,
-          sizing,
           CGAL::parameters::number_of_iterations(nb_iterations)
             .vertex_point_map(vpmap_)
             .geom_traits(gt_)
             .edge_is_constrained_map(constrained_edges_pmap)
             .vertex_is_constrained_map(constrained_vertices_pmap)
             .relax_constraints(relax_constraints)
+            .sizing_function(sizing)
         );
       }
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index ae257f9eb57e..eb0f0881dab0 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -17,6 +17,7 @@
 #include <CGAL/license/Polygon_mesh_processing/meshing_hole_filling.h>
 
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
+#include <CGAL/Polygon_mesh_processing/Uniform_sizing_field.h>
 #include <CGAL/property_map.h>
 
 #include <CGAL/Named_function_parameters.h>
@@ -132,6 +133,7 @@ void tangential_relaxation(const VertexRange& vertices,
 
   using parameters::get_parameter;
   using parameters::choose_parameter;
+  using parameters::is_default_parameter;
 
   typedef typename GetGeomTraits<TriangleMesh, CGAL_NP_CLASS>::type GT;
   GT gt = choose_parameter(get_parameter(np, internal_np::geom_traits), GT());
@@ -157,6 +159,14 @@ void tangential_relaxation(const VertexRange& vertices,
   VCM vcm = choose_parameter(get_parameter(np, internal_np::vertex_is_constrained),
                              Static_boolean_property_map<vertex_descriptor, false>());
 
+  typedef typename internal_np::Lookup_named_param_def <
+      internal_np::vertex_is_constrained_t,
+      CGAL_NP_CLASS,
+      Uniform_sizing_field<TriangleMesh, VPMap>
+    > ::type SizingFunction;
+  SizingFunction sizing = choose_parameter(get_parameter(np, internal_np::sizing_function),
+                                        Uniform_sizing_field(-1, tm));//todo ip just a placeholder
+
   const bool relax_constraints = choose_parameter(get_parameter(np, internal_np::relax_constraints), false);
   const unsigned int nb_iterations = choose_parameter(get_parameter(np, internal_np::number_of_iterations), 1);
 
@@ -222,6 +232,12 @@ void tangential_relaxation(const VertexRange& vertices,
     auto gt_barycenter = gt.construct_barycenter_3_object();
     auto gt_project = gt.construct_projected_point_3_object();
 
+//    if constexpr (is_default_parameter<CGAL_NP_CLASS, internal_np::sizing_function_t>::value)
+//      {
+//      auto gt_area = gt.compute_area_3_object();
+//      auto gt_centroid = gt.construct_centroid_3_object();
+//      }
+
     // at each vertex, compute vertex normal
     std::unordered_map<vertex_descriptor, Vector_3> vnormals;
     compute_vertex_normals(tm, boost::make_assoc_property_map(vnormals), np);
@@ -246,15 +262,39 @@ void tangential_relaxation(const VertexRange& vertices,
       {
         const Vector_3& vn = vnormals.at(v);
         Vector_3 move = CGAL::NULL_VECTOR;
-        unsigned int star_size = 0;
-        for(halfedge_descriptor h :interior_hedges)
+        if constexpr (std::is_same_v<SizingFunction, Uniform_sizing_field<TriangleMesh, VPMap>>)
+        {
+          unsigned int star_size = 0;
+          for(halfedge_descriptor h :interior_hedges)
+          {
+            move = move + Vector_3(get(vpm, v), get(vpm, source(h, tm)));
+            ++star_size;
+          }
+          CGAL_assertion(star_size > 0); //isolated vertices have already been discarded
+          move = (1. / static_cast<double>(star_size)) * move;
+        }
+        else
         {
-          move = move + Vector_3(get(vpm, v), get(vpm, source(h, tm)));
-          ++star_size;
+          auto gt_centroid = gt.construct_centroid_3_object();
+          auto gt_area = gt.compute_area_3_object();
+          double weight = 0;
+          for(halfedge_descriptor h :interior_hedges)
+          {
+            // calculate weight
+            // need v, v1 and v2
+            const vertex_descriptor v1 = target(next(h, tm), tm);
+            const vertex_descriptor v2 = source(h, tm);
+
+            const double tri_area = gt_area(get(vpm, v), get(vpm, v1), get(vpm, v2));
+            const double face_weight = tri_area
+                                       / (1. / 3. * (sizing.get_sizing(v) + sizing.get_sizing(v1) + sizing.get_sizing(v2)));
+            weight += face_weight;
+
+            const Point_3 centroid = gt_centroid(get(vpm, v), get(vpm, v1), get(vpm, v2));
+            move = move + Vector_3(get(vpm, v), centroid) * face_weight;
+          }
+          move = move / weight; //todo ip: what if weight ends up being close to 0?
         }
-        CGAL_assertion(star_size > 0); //isolated vertices have already been discarded
-        move = (1. / static_cast<double>(star_size)) * move;
-
         barycenters.emplace_back(v, vn, get(vpm, v) + move);
       }
       else
@@ -418,7 +458,7 @@ template <typename VertexRange,
           class TriangleMesh,
           class SizingFunction,
           typename CGAL_NP_TEMPLATE_PARAMETERS>
-void tangential_relaxation(const VertexRange& vertices,
+void tangential_relaxation_with_sizing(const VertexRange& vertices,
                            TriangleMesh& tm,
                            const SizingFunction& sizing,
                            const CGAL_NP_CLASS& np = parameters::default_values())
@@ -643,7 +683,7 @@ void tangential_relaxation(TriangleMesh& tm,
 template <class TriangleMesh,
           typename SizingFunction,
           typename CGAL_NP_TEMPLATE_PARAMETERS>
-void tangential_relaxation(TriangleMesh& tm,
+void tangential_relaxation_with_sizing(TriangleMesh& tm,
                            const SizingFunction& sizing,
                            const CGAL_NP_CLASS& np = parameters::default_values())
 {
diff --git a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
index cf196415595d..cb9c300ff6cb 100644
--- a/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
+++ b/STL_Extension/include/CGAL/STL_Extension/internal/parameters_interface.h
@@ -161,6 +161,7 @@ CGAL_add_named_parameter(vertex_corner_map_t, vertex_corner_map, vertex_corner_m
 CGAL_add_named_parameter(patch_normal_map_t, patch_normal_map, patch_normal_map)
 CGAL_add_named_parameter(region_primitive_map_t, region_primitive_map, region_primitive_map)
 CGAL_add_named_parameter(postprocess_regions_t, postprocess_regions, postprocess_regions)
+CGAL_add_named_parameter(sizing_function_t, sizing_function, sizing_function)
 
 // List of named parameters that we use in the package 'Surface Mesh Simplification'
 CGAL_add_named_parameter(get_cost_policy_t, get_cost_policy, get_cost)

From 6a4dbe5b59411c232259b2fb2b6933d2616fba9a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 6 Oct 2023 08:59:29 +0200
Subject: [PATCH 1037/1398] fix copy/paste error

---
 .../CGAL/Polygon_mesh_processing/tangential_relaxation.h      | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index eb0f0881dab0..5c3d4fc8ad55 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -160,12 +160,12 @@ void tangential_relaxation(const VertexRange& vertices,
                              Static_boolean_property_map<vertex_descriptor, false>());
 
   typedef typename internal_np::Lookup_named_param_def <
-      internal_np::vertex_is_constrained_t,
+      internal_np::sizing_function_t,
       CGAL_NP_CLASS,
       Uniform_sizing_field<TriangleMesh, VPMap>
     > ::type SizingFunction;
   SizingFunction sizing = choose_parameter(get_parameter(np, internal_np::sizing_function),
-                                        Uniform_sizing_field(-1, tm));//todo ip just a placeholder
+                                           Uniform_sizing_field(-1, tm));//todo ip just a placeholder
 
   const bool relax_constraints = choose_parameter(get_parameter(np, internal_np::relax_constraints), false);
   const unsigned int nb_iterations = choose_parameter(get_parameter(np, internal_np::number_of_iterations), 1);

From 618fb4b0271bda4fe06002f156f7145be3da91cf Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 6 Oct 2023 09:23:46 +0200
Subject: [PATCH 1038/1398] explicit template parameter to avoid ambiguity

---
 .../CGAL/Polygon_mesh_processing/tangential_relaxation.h        | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index 5c3d4fc8ad55..e41adb9ca89a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -165,7 +165,7 @@ void tangential_relaxation(const VertexRange& vertices,
       Uniform_sizing_field<TriangleMesh, VPMap>
     > ::type SizingFunction;
   SizingFunction sizing = choose_parameter(get_parameter(np, internal_np::sizing_function),
-                                           Uniform_sizing_field(-1, tm));//todo ip just a placeholder
+                                           Uniform_sizing_field<TriangleMesh, VPMap>(-1, vpm));
 
   const bool relax_constraints = choose_parameter(get_parameter(np, internal_np::relax_constraints), false);
   const unsigned int nb_iterations = choose_parameter(get_parameter(np, internal_np::number_of_iterations), 1);

From c41a0e38c2035a35cb911cb356b8e7e966bada39 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Fri, 6 Oct 2023 19:00:11 -0600
Subject: [PATCH 1039/1398] Merge two tangential relaxation functions into one

---
 .../tangential_relaxation.h                   | 326 +-----------------
 .../remeshing_quality_test.cpp                |   2 +-
 2 files changed, 11 insertions(+), 317 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index e41adb9ca89a..83fdd5ff37f2 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -116,6 +116,13 @@ struct Allow_all_moves{
 *     \cgalParamDefault{If not provided, all moves are allowed.}
 *   \cgalParamNEnd
 *
+*   \cgalParamNBegin{sizing_function}
+*     \cgalParamDescription{An object containing sizing field for individual vertices.
+*                           Used to derive smoothing weights.}
+*     \cgalParamType{A model of `PMPSizingField`.}
+*     \cgalParamDefault{If not provided, smoothing weights are the same for all vertices.}
+*   \cgalParamNEnd
+*
 * \cgalNamedParamsEnd
 *
 * \todo check if it should really be a triangle mesh or if a polygon mesh is fine
@@ -232,12 +239,6 @@ void tangential_relaxation(const VertexRange& vertices,
     auto gt_barycenter = gt.construct_barycenter_3_object();
     auto gt_project = gt.construct_projected_point_3_object();
 
-//    if constexpr (is_default_parameter<CGAL_NP_CLASS, internal_np::sizing_function_t>::value)
-//      {
-//      auto gt_area = gt.compute_area_3_object();
-//      auto gt_centroid = gt.construct_centroid_3_object();
-//      }
-
     // at each vertex, compute vertex normal
     std::unordered_map<vertex_descriptor, Vector_3> vnormals;
     compute_vertex_normals(tm, boost::make_assoc_property_map(vnormals), np);
@@ -287,7 +288,9 @@ void tangential_relaxation(const VertexRange& vertices,
 
             const double tri_area = gt_area(get(vpm, v), get(vpm, v1), get(vpm, v2));
             const double face_weight = tri_area
-                                       / (1. / 3. * (sizing.get_sizing(v) + sizing.get_sizing(v1) + sizing.get_sizing(v2)));
+                                       / (1. / 3. * (sizing.get_sizing(v)
+                                                   + sizing.get_sizing(v1)
+                                                   + sizing.get_sizing(v2)));
             weight += face_weight;
 
             const Point_3 centroid = gt_centroid(get(vpm, v), get(vpm, v1), get(vpm, v2));
@@ -341,305 +344,6 @@ void tangential_relaxation(const VertexRange& vertices,
       new_locations.emplace_back(v, qv + (nv * Vector_3(qv, pv)) * nv);
     }
 
-    // perform moves
-    for(const VP_pair& vp : new_locations)
-    {
-      const Point_3 initial_pos = get(vpm, vp.first); // make a copy on purpose
-      const Vector_3 move(initial_pos, vp.second);
-
-      put(vpm, vp.first, vp.second);
-
-      //check that no inversion happened
-      double frac = 1.;
-      while (frac > 0.03 //5 attempts maximum
-          && (   !check_normals(vp.first)
-              || !shall_move(vp.first, initial_pos, get(vpm, vp.first)))) //if a face has been inverted
-      {
-        frac = 0.5 * frac;
-        put(vpm, vp.first, initial_pos + frac * move);//shorten the move by 2
-      }
-      if (frac <= 0.02)
-        put(vpm, vp.first, initial_pos);//cancel move
-    }
-  }//end for loop (nit == nb_iterations)
-
-#ifdef CGAL_PMP_TANGENTIAL_RELAXATION_VERBOSE
-  std::cout << "\rTangential relaxation : "
-    << nb_iterations << " iterations done." << std::endl;
-#endif
-}
-
-/*!
-* \ingroup PMP_meshing_grp
-* applies an iterative area-based tangential smoothing to the given range of vertices based on the
-* underlying sizing field.
-* Each vertex `v` is relocated to its weighted centroid, where weights depend on the area of the
-* adjacent triangle and its averaged vertex sizing values.
-* The relocation vector is projected back to the tangent plane to the surface at `v`, iteratively.
-* The connectivity remains unchanged.
-*
-* @tparam TriangleMesh model of `FaceGraph` and `VertexListGraph`.
-*         The descriptor types `boost::graph_traits<TriangleMesh>::%face_descriptor`
-*         and `boost::graph_traits<TriangleMesh>::%halfedge_descriptor` must be
-*         models of `Hashable`.
-* @tparam VertexRange range of `boost::graph_traits<TriangleMesh>::%vertex_descriptor`,
-*         model of `Range`. Its iterator type is `ForwardIterator`.
-* @tparam SizingFunction model of `PMPSizingField`
-* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
-*
-* @param vertices the range of vertices which will be relocated by relaxation
-* @param tm the triangle mesh to which `vertices` belong
-* @param sizing a map containing sizing field for individual vertices.
-*        Used to derive smoothing weights.
-* @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
-*
-* \cgalNamedParamsBegin
-*   \cgalParamNBegin{vertex_point_map}
-*     \cgalParamDescription{a property map associating points to the vertices of `tm`}
-*     \cgalParamType{a class model of `ReadWritePropertyMap` with `boost::graph_traits<TriangleMesh>::%vertex_descriptor`
-*                    as key type and `%Point_3` as value type}
-*     \cgalParamDefault{`boost::get(CGAL::vertex_point, tm)`}
-*     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
-*                     must be available in `TriangleMesh`.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{geom_traits}
-*     \cgalParamDescription{an instance of a geometric traits class}
-*     \cgalParamType{a class model of `Kernel`}
-*     \cgalParamDefault{a \cgal Kernel deduced from the `Point_3` type, using `CGAL::Kernel_traits`}
-*     \cgalParamExtra{The geometric traits class must be compatible with the vertex `Point_3` type.}
-*     \cgalParamExtra{Exact constructions kernels are not supported by this function.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{number_of_iterations}
-*     \cgalParamDescription{the number of smoothing iterations}
-*     \cgalParamType{unsigned int}
-*     \cgalParamDefault{`1`}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{edge_is_constrained_map}
-*     \cgalParamDescription{a property map containing the constrained-or-not status of each edge of `tm`.
-*                           The endpoints of a constrained edge cannot be moved by relaxation, unless `relax_constraints` is `true`.
-*                           The endpoints of a constrained polyline can never be moved by relaxation.
-*     \cgalParamType{a class model of `ReadWritePropertyMap` with `boost::graph_traits<TriangleMesh>::%edge_descriptor`
-*                    as key type and `bool` as value type. It must be default constructible.}
-*     \cgalParamDefault{a default property map where no edges are constrained}
-*     \cgalParamExtra{Boundary edges are always considered as constrained edges.}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{vertex_is_constrained_map}
-*     \cgalParamDescription{a property map containing the constrained-or-not status of each vertex of `tm`.
-*                           A constrained vertex cannot be modified during relaxation.}
-*     \cgalParamType{a class model of `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*                    as key type and `bool` as value type. It must be default constructible.}
-*     \cgalParamDefault{a default property map where no vertices are constrained}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{relax_constraints}
-*     \cgalParamDescription{If `true`, the end vertices of the edges set as constrained
-*                           in `edge_is_constrained_map` and boundary edges move along the
-*                           constrained polylines they belong to.}
-*     \cgalParamType{Boolean}
-*     \cgalParamDefault{`false`}
-*   \cgalParamNEnd
-*
-*   \cgalParamNBegin{allow_move_functor}
-*     \cgalParamDescription{A function object used to determinate if a vertex move should be allowed or not}
-*     \cgalParamType{Unary functor that provides `bool operator()(vertex_descriptor v, Point_3 src, Point_3 tgt)` returning `true`
-*                    if the vertex `v` can be moved from `src` to `tgt`; `Point_3` being the value type of the vertex point map }
-*     \cgalParamDefault{If not provided, all moves are allowed.}
-*   \cgalParamNEnd
-*
-* \cgalNamedParamsEnd
-*
-* \todo check if it should really be a triangle mesh or if a polygon mesh is fine
-*/
-template <typename VertexRange,
-          class TriangleMesh,
-          class SizingFunction,
-          typename CGAL_NP_TEMPLATE_PARAMETERS>
-void tangential_relaxation_with_sizing(const VertexRange& vertices,
-                           TriangleMesh& tm,
-                           const SizingFunction& sizing,
-                           const CGAL_NP_CLASS& np = parameters::default_values())
-{
-  typedef typename boost::graph_traits<TriangleMesh>::vertex_descriptor vertex_descriptor;
-  typedef typename boost::graph_traits<TriangleMesh>::halfedge_descriptor halfedge_descriptor;
-  typedef typename boost::graph_traits<TriangleMesh>::edge_descriptor edge_descriptor;
-
-  using parameters::get_parameter;
-  using parameters::choose_parameter;
-
-  typedef typename GetGeomTraits<TriangleMesh, CGAL_NP_CLASS>::type GT;
-  GT gt = choose_parameter(get_parameter(np, internal_np::geom_traits), GT());
-
-  typedef typename GetVertexPointMap<TriangleMesh, CGAL_NP_CLASS>::type VPMap;
-  VPMap vpm = choose_parameter(get_parameter(np, internal_np::vertex_point),
-    get_property_map(vertex_point, tm));
-
-  typedef Static_boolean_property_map<edge_descriptor, false> Default_ECM;
-  typedef typename internal_np::Lookup_named_param_def <
-    internal_np::edge_is_constrained_t,
-    CGAL_NP_CLASS,
-    Static_boolean_property_map<edge_descriptor, false> // default (no constraint)
-  > ::type ECM;
-  ECM ecm = choose_parameter(get_parameter(np, internal_np::edge_is_constrained),
-    Default_ECM());
-
-  typedef typename internal_np::Lookup_named_param_def <
-    internal_np::vertex_is_constrained_t,
-    CGAL_NP_CLASS,
-    Static_boolean_property_map<vertex_descriptor, false> // default (no constraint)
-  > ::type VCM;
-  VCM vcm = choose_parameter(get_parameter(np, internal_np::vertex_is_constrained),
-    Static_boolean_property_map<vertex_descriptor, false>());
-
-  const bool relax_constraints = choose_parameter(get_parameter(np, internal_np::relax_constraints), false);
-  const unsigned int nb_iterations = choose_parameter(get_parameter(np, internal_np::number_of_iterations), 1);
-
-  typedef typename GT::Vector_3 Vector_3;
-  typedef typename GT::Point_3 Point_3;
-
-  auto check_normals = [&](vertex_descriptor v)
-  {
-    bool first_run = true;
-    Vector_3 prev = NULL_VECTOR, first = NULL_VECTOR;
-    halfedge_descriptor first_h = boost::graph_traits<TriangleMesh>::null_halfedge();
-    for (halfedge_descriptor hd : CGAL::halfedges_around_target(v, tm))
-    {
-      if (is_border(hd, tm)) continue;
-
-      Vector_3 n = compute_face_normal(face(hd, tm), tm, np);
-      if (n == CGAL::NULL_VECTOR) //for degenerate faces
-        continue;
-
-      if (first_run)
-      {
-        first_run = false;
-        first = n;
-        first_h = hd;
-      }
-      else
-      {
-        if (!get(ecm, edge(hd, tm)))
-          if (to_double(n * prev) <= 0)
-            return false;
-      }
-      prev = n;
-    }
-
-    if (first_run)
-      return true; //vertex incident only to degenerate faces
-
-    if (!get(ecm, edge(first_h, tm)))
-      if (to_double(first * prev) <= 0)
-        return false;
-
-    return true;
-  };
-
-  typedef typename internal_np::Lookup_named_param_def <
-    internal_np::allow_move_functor_t,
-    CGAL_NP_CLASS,
-    internal::Allow_all_moves// default
-  > ::type Shall_move;
-  Shall_move shall_move = choose_parameter(get_parameter(np, internal_np::allow_move_functor),
-    internal::Allow_all_moves());
-
-  for (unsigned int nit = 0; nit < nb_iterations; ++nit)
-  {
-#ifdef CGAL_PMP_TANGENTIAL_RELAXATION_VERBOSE
-    std::cout << "\r\t(Tangential relaxation iteration " << (nit + 1) << " / ";
-    std::cout << nb_iterations << ") ";
-    std::cout.flush();
-#endif
-
-    typedef std::tuple<vertex_descriptor, Vector_3, Point_3> VNP;
-    std::vector< VNP > barycenters;
-    auto gt_barycenter = gt.construct_barycenter_3_object();
-    auto gt_centroid = gt.construct_centroid_3_object();
-    auto gt_area = gt.compute_area_3_object();
-
-    // at each vertex, compute vertex normal
-    std::unordered_map<vertex_descriptor, Vector_3> vnormals;
-    compute_vertex_normals(tm, boost::make_assoc_property_map(vnormals), np);
-
-    // at each vertex, compute centroids of neighbouring faces weighted by
-    // area and sizing field
-    for(vertex_descriptor v : vertices)
-    {
-      if (get(vcm, v) || CGAL::internal::is_isolated(v, tm))
-        continue;
-
-      // collect hedges to detect if we have to handle boundary cases
-      std::vector<halfedge_descriptor> interior_hedges, border_halfedges;
-      for(halfedge_descriptor h : halfedges_around_target(v, tm))
-      {
-        if (is_border_edge(h, tm) || get(ecm, edge(h, tm)))
-          border_halfedges.push_back(h);
-        else
-          interior_hedges.push_back(h);
-      }
-
-      if (border_halfedges.empty())
-      {
-        const Vector_3& vn = vnormals.at(v);
-        Vector_3 move = CGAL::NULL_VECTOR;
-        double weight = 0;
-        for(halfedge_descriptor h :interior_hedges)
-        {
-          // calculate weight
-          // need v, v1 and v2
-          const vertex_descriptor v1 = target(next(h, tm), tm);
-          const vertex_descriptor v2 = source(h, tm);
-
-          const double tri_area = gt_area(get(vpm, v), get(vpm, v1), get(vpm, v2));
-          const double face_weight = tri_area
-                                   / (1. / 3. * (sizing.get_sizing(v) + sizing.get_sizing(v1) + sizing.get_sizing(v2)));
-          weight += face_weight;
-
-          const Point_3 centroid = gt_centroid(get(vpm, v), get(vpm, v1), get(vpm, v2));
-          move = move + Vector_3(get(vpm, v), centroid) * face_weight;
-        }
-        move = move / weight; //todo ip: what if weight ends up being close to 0?
-
-        barycenters.emplace_back(v, vn, get(vpm, v) + move);
-      }
-      else
-      {
-        if (!relax_constraints) continue;
-        Vector_3 vn(NULL_VECTOR);
-
-        if (border_halfedges.size() == 2)// corners are constrained
-        {
-          vertex_descriptor ph0 = source(border_halfedges[0], tm);
-          vertex_descriptor ph1 = source(border_halfedges[1], tm);
-          double dot = to_double(Vector_3(get(vpm, v), get(vpm, ph0))
-                                 * Vector_3(get(vpm, v), get(vpm, ph1)));
-          // \todo shouldn't it be an input parameter?
-          //check squared cosine is < 0.25 (~120 degrees)
-          if (0.25 < dot*dot / ( squared_distance(get(vpm,ph0), get(vpm, v)) *
-                                 squared_distance(get(vpm,ph1), get(vpm, v))) )
-            barycenters.emplace_back(v, vn,
-              gt_barycenter(get(vpm, ph0), 0.25, get(vpm, ph1), 0.25, get(vpm, v), 0.5));
-        }
-      }
-    }
-
-    // compute moves
-    typedef std::pair<vertex_descriptor, Point_3> VP_pair;
-    std::vector< std::pair<vertex_descriptor, Point_3> > new_locations;
-    new_locations.reserve(barycenters.size());
-    for(const VNP& vnp : barycenters)
-    {
-      vertex_descriptor v = std::get<0>(vnp);
-      const Point_3& pv = get(vpm, v);
-      const Vector_3& nv = std::get<1>(vnp);
-      const Point_3& qv = std::get<2>(vnp); //barycenter at v
-
-      new_locations.emplace_back(v, qv + (nv * Vector_3(qv, pv)) * nv);
-    }
-
     // perform moves
     for(const VP_pair& vp : new_locations)
     {
@@ -680,16 +384,6 @@ void tangential_relaxation(TriangleMesh& tm,
   tangential_relaxation(vertices(tm), tm, np);
 }
 
-template <class TriangleMesh,
-          typename SizingFunction,
-          typename CGAL_NP_TEMPLATE_PARAMETERS>
-void tangential_relaxation_with_sizing(TriangleMesh& tm,
-                           const SizingFunction& sizing,
-                           const CGAL_NP_CLASS& np = parameters::default_values())
-{
-  tangential_relaxation(vertices(tm), tm, sizing, np);
-}
-
 } } // CGAL::Polygon_mesh_processing
 
 #endif //CGAL_POLYGON_MESH_PROCESSING_TANGENTIAL_RELAXATION_H
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
index a6216663596f..93b3c4cad05f 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
@@ -107,4 +107,4 @@ int main(int argc, char* argv[])
     << " deg" << std::endl;
 
   return 0;
-}
\ No newline at end of file
+}

From dc36eb88a7be606b71128234c73d8901f8c3b7f2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Tue, 10 Oct 2023 16:12:43 -0600
Subject: [PATCH 1040/1398] Apply suggestions from code review

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 .../doc/Polygon_mesh_processing/PackageDescription.txt    | 4 ++--
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h   | 8 ++++----
 .../include/CGAL/Polygon_mesh_processing/remesh.h         | 2 +-
 3 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
index f82c5af569e2..b9e2ecaffc16 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/PackageDescription.txt
@@ -133,8 +133,8 @@ The page \ref bgl_namedparameters "Named Parameters" describes their usage.
 - `CGAL::Polygon_mesh_processing::random_perturbation()`
 
 \cgalCRPSection{Sizing Fields}
-- `CGAL::Polygon_mesh_processing::Uniform_sizing_field()`
-- `CGAL::Polygon_mesh_processing::Adaptive_sizing_field()`
+- `CGAL::Polygon_mesh_processing::Uniform_sizing_field`
+- `CGAL::Polygon_mesh_processing::Adaptive_sizing_field`
 
 \cgalCRPSection{Orientation Functions}
 - `CGAL::Polygon_mesh_processing::orient_polygon_soup()`
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 716729125f86..d73b318f8c19 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -74,12 +74,12 @@ class Uniform_sizing_field
   {}
 
   /*!
-  * Constructor using default values for the vertex point map of the input polygon mesh.
+  * Constructor using internal vertex point map of the input polygon mesh.
   *
   * @param size the target edge length for isotropic remeshing. If set to 0,
   *        the criterion for edge length is ignored and edges are neither split nor collapsed.
   * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. The default
-  *        vertex point map of pmesh is used to construct the class.
+  *        vertex point map of `pmesh` is used to construct the class.
   */
   Uniform_sizing_field<PolygonMesh, VPMap>(const FT size, const PolygonMesh& pmesh)
     : Uniform_sizing_field(size, get(CGAL::vertex_point, pmesh))
@@ -130,8 +130,8 @@ class Uniform_sizing_field
   {}
 
 private:
-  FT m_sq_short;
-  FT m_sq_long;
+  const FT m_sq_short;
+  const FT m_sq_long;
   const VPMap m_vpmap;
 };
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index 799d15d03ffc..b9960450f293 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -382,7 +382,7 @@ void isotropic_remeshing(const FaceRange& faces
 * @param pmesh a polygon mesh
 * @param edges the range of edges to be split if they are longer than given threshold
 * @param sizing the sizing function that is used to split edges from 'edges' list. If a number convertible to
-*        a double is passed, it will use a `Uniform_sizing_field()` with the number as a target edge length.
+*        a `double` is passed, it will use a `Uniform_sizing_field()` with the number as target edge length.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 
 * \cgalNamedParamsBegin

From 904c10016adcd306a4cbcb9ccecd3090758b47ca Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Tue, 10 Oct 2023 19:34:46 -0600
Subject: [PATCH 1041/1398] Add sizing.at function to the PMPSizingField and
 other sizing classes

---
 .../Polygon_mesh_processing/Concepts/PMPSizingField.h    | 6 +++++-
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h | 2 +-
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h  | 9 ++++++++-
 .../Polygon_mesh_processing/internal/Sizing_field_base.h | 1 +
 .../CGAL/Polygon_mesh_processing/tangential_relaxation.h | 6 +++---
 5 files changed, 18 insertions(+), 6 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index 5b90dddfbc92..d672f19bb063 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -31,6 +31,9 @@ typedef unspecified_type FT;
 /// @name Functions
 /// @{
 
+/// a function that returns the sizing value at `v`.
+FT at(const vertex_descriptor v) const;
+
 /// a function controlling edge split and edge collapse,
 /// returning the ratio of the current edge length and the local target edge length between
 /// the points of `va` and `vb` in case the current edge is too long, and `std::nullopt` otherwise.
@@ -47,7 +50,8 @@ Point_3 split_placement(const halfedge_descriptor h,
                         const PolygonMesh& pmesh) const;
 
 /// a function that updates the sizing field value at the vertex `v`.
-void update(const vertex_descriptor v, const PolygonMesh& pmesh);
+void update(const vertex_descriptor v,
+            const PolygonMesh& pmesh);
 
 /// @}
 };
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 91e04160d113..cf46db6d9197 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -214,7 +214,7 @@ class Adaptive_sizing_field
   }
 
 public:
-  FT get_sizing(const vertex_descriptor v) const
+  FT at(const vertex_descriptor v) const
   {
     CGAL_assertion(get(m_vertex_sizing_map, v));
     return get(m_vertex_sizing_map, v);
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index d73b318f8c19..00ea4a39dcb1 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -68,7 +68,8 @@ class Uniform_sizing_field
   *        the input mesh.
   */
   Uniform_sizing_field<PolygonMesh, VPMap>(const FT size, const VPMap& vpmap)
-    : m_sq_short( CGAL::square(4./5. * size))
+    : m_size(size)
+    , m_sq_short( CGAL::square(4./5. * size))
     , m_sq_long(  CGAL::square(4./3. * size))
     , m_vpmap(vpmap)
   {}
@@ -100,6 +101,11 @@ class Uniform_sizing_field
   }
 
 public:
+  FT at(const vertex_descriptor /* v */) const
+  {
+    return m_size;
+  }
+
   std::optional<FT> is_too_long(const vertex_descriptor va, const vertex_descriptor vb) const
   {
     const FT sqlen = sqlength(va, vb);
@@ -130,6 +136,7 @@ class Uniform_sizing_field
   {}
 
 private:
+  const FT m_size;
   const FT m_sq_short;
   const FT m_sq_long;
   const VPMap m_vpmap;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
index 3835f1803585..1f70c251aca7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
@@ -60,6 +60,7 @@ class Sizing_field_base
   typedef typename K::FT                                        FT;
 
 public:
+  virtual FT at(const vertex_descriptor v) const;
   virtual std::optional<FT> is_too_long(const vertex_descriptor va,
                                         const vertex_descriptor vb) const = 0;
   virtual std::optional<FT> is_too_short(const halfedge_descriptor h,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index 83fdd5ff37f2..6693524324a9 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -288,9 +288,9 @@ void tangential_relaxation(const VertexRange& vertices,
 
             const double tri_area = gt_area(get(vpm, v), get(vpm, v1), get(vpm, v2));
             const double face_weight = tri_area
-                                       / (1. / 3. * (sizing.get_sizing(v)
-                                                   + sizing.get_sizing(v1)
-                                                   + sizing.get_sizing(v2)));
+                                       / (1. / 3. * (sizing.at(v)
+                                                   + sizing.at(v1)
+                                                   + sizing.at(v2)));
             weight += face_weight;
 
             const Point_3 centroid = gt_centroid(get(vpm, v), get(vpm, v1), get(vpm, v2));

From 1dbd8c281d8f325c9a0d47f972db12c0bb0a413b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 11 Oct 2023 07:21:12 -0700
Subject: [PATCH 1042/1398] make it pure virtual

---
 .../CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h   | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
index 1f70c251aca7..e62e86c9a83e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
@@ -60,7 +60,7 @@ class Sizing_field_base
   typedef typename K::FT                                        FT;
 
 public:
-  virtual FT at(const vertex_descriptor v) const;
+  virtual FT at(const vertex_descriptor v) const = 0;
   virtual std::optional<FT> is_too_long(const vertex_descriptor va,
                                         const vertex_descriptor vb) const = 0;
   virtual std::optional<FT> is_too_short(const halfedge_descriptor h,

From 4b9bd778ef99cff69c97154102a050cdc33d9844 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ivan=20Pa=C4=91en?=
 <49401914+ipadjen@users.noreply.github.com>
Date: Fri, 20 Oct 2023 23:51:40 -0600
Subject: [PATCH 1043/1398] Apply suggestions from code review

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 .../Polygon_mesh_processing/Adaptive_sizing_field.h  | 12 ++++++------
 .../Polygon_mesh_processing/Uniform_sizing_field.h   |  9 +++++----
 .../internal/Sizing_field_base.h                     |  6 +++---
 .../include/CGAL/Polygon_mesh_processing/remesh.h    |  2 +-
 4 files changed, 15 insertions(+), 14 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index cf46db6d9197..a98b22de4edc 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -29,14 +29,14 @@ namespace Polygon_mesh_processing
 {
 /*!
 * \ingroup PMP_meshing_grp
-* provides criteria for isotropic remeshing to achieve variable mesh edge lengths as a function
-* of local discrete curvatures.
-*
-* The local discrete curvatures are calculated using the
+* a sizing field describing variable target mesh edge lengths for
+* `CGAL::Polygon_mesh_processing::isotropic_remeshing()`.
+* This adaptive sizing field is a function of local discrete curvatures,
+* computed using the
 * `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()` function.
 *
-* Edges longer than the local target edge length are split in two, while
-* edges shorter than the local target edge length are collapsed.
+* Edges too long with respect to the local target edge length are split in two, while
+* edges that are too short are collapsed.
 *
 * \cgalModels{PMPSizingField}
 *
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 00ea4a39dcb1..037a2a161877 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -25,7 +25,8 @@ namespace Polygon_mesh_processing
 {
 /*!
 * \ingroup PMP_meshing_grp
-* provides criteria for isotropic remeshing to achieve uniform mesh edge lengths.
+* a sizing field describing a uniform target edge length for
+* `CGAL::Polygon_mesh_processing::isotropic_remeshing()`.
 *
 * Edges longer than 4/3 of the target edge length will be split in half, while
 * edges shorter than 4/5 of the target edge length will be collapsed.
@@ -37,9 +38,9 @@ namespace Polygon_mesh_processing
 *
 * @tparam PolygonMesh model of `MutableFaceGraph` that
 *         has an internal property map for `CGAL::vertex_point_t`.
-* @tparam VPMap a property map associating points to the vertices of `pmesh`.
-*         It is a class model of `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
-*          as key type and `%Point_3` as value type. Default is `boost::get(CGAL::vertex_point, pmesh)`.
+* @tparam VPMap property map associating points to the vertices of `pmesh`,
+*         model of `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+*         as key type and `%Point_3` as value type. Default is `boost::get(CGAL::vertex_point, pmesh)`.
 */
 template <class PolygonMesh,
           class VPMap =  typename boost::property_map<PolygonMesh, CGAL::vertex_point_t>::const_type>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
index e62e86c9a83e..f13135cd873e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
@@ -28,7 +28,7 @@ namespace internal
 {
 /*!
 * \ingroup PMP_meshing_grp
-* pure virtual class serving as a base for sizing field classes utilized in isotropic
+* pure virtual class serving as a base for sizing field classes used in isotropic
 * remeshing.
 *
 * \cgalModels{PMPSizingField}
@@ -39,8 +39,8 @@ namespace internal
 *
 * @tparam PolygonMesh model of `MutableFaceGraph` that
 *         has an internal property map for `CGAL::vertex_point_t`.
-* @tparam VPMap a property map associating points to the vertices of `pmesh`.
-*         It is a a class model of `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
+* @tparam VPMap property map associating points to the vertices of `pmesh`,
+*         model of `ReadWritePropertyMap` with `boost::graph_traits<PolygonMesh>::%vertex_descriptor`
 *         as key type and `%Point_3` as value type. Default is `boost::get(CGAL::vertex_point, pmesh)`.
 */
 template <class PolygonMesh,
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
index b9960450f293..7c5ff9ab2618 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/remesh.h
@@ -382,7 +382,7 @@ void isotropic_remeshing(const FaceRange& faces
 * @param pmesh a polygon mesh
 * @param edges the range of edges to be split if they are longer than given threshold
 * @param sizing the sizing function that is used to split edges from 'edges' list. If a number convertible to
-*        a `double` is passed, it will use a `Uniform_sizing_field()` with the number as target edge length.
+*        a `double` is passed,  `Uniform_sizing_field()` will be used, with the number as target edge length.
 * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
 
 * \cgalNamedParamsBegin

From 75303ad910c074fbc5b068537122930d059e59ba Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 23 Oct 2023 17:46:38 +0200
Subject: [PATCH 1044/1398] fix compilation errors

---
 .../CGAL/Polygon_mesh_processing/Uniform_sizing_field.h       | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index 037a2a161877..a4144ceee650 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -68,7 +68,7 @@ class Uniform_sizing_field
   * \param vpmap is the input vertex point map that associates points to the vertices of
   *        the input mesh.
   */
-  Uniform_sizing_field<PolygonMesh, VPMap>(const FT size, const VPMap& vpmap)
+  Uniform_sizing_field(const FT size, const VPMap& vpmap)
     : m_size(size)
     , m_sq_short( CGAL::square(4./5. * size))
     , m_sq_long(  CGAL::square(4./3. * size))
@@ -83,7 +83,7 @@ class Uniform_sizing_field
   * @param pmesh a polygon mesh with triangulated surface patches to be remeshed. The default
   *        vertex point map of `pmesh` is used to construct the class.
   */
-  Uniform_sizing_field<PolygonMesh, VPMap>(const FT size, const PolygonMesh& pmesh)
+  Uniform_sizing_field(const FT size, const PolygonMesh& pmesh)
     : Uniform_sizing_field(size, get(CGAL::vertex_point, pmesh))
   {}
 

From 29d948a788e85ef0a828c174d0517b1346bf9879 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 23 Oct 2023 18:03:31 +0200
Subject: [PATCH 1045/1398] handle new letter

---
 Documentation/doc/scripts/generate_how_to_cite.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Documentation/doc/scripts/generate_how_to_cite.py b/Documentation/doc/scripts/generate_how_to_cite.py
index 71e1c6258c90..c2a422bdda28 100644
--- a/Documentation/doc/scripts/generate_how_to_cite.py
+++ b/Documentation/doc/scripts/generate_how_to_cite.py
@@ -157,7 +157,7 @@ def protect_upper_case(title):
   return title.replace("dD","{dD}").replace("2D","{2D}").replace("3D","{3D}").replace("CGAL","{CGAL}").replace("Qt","{Qt}").replace("Boost","{Boost}")
 
 def protect_accentuated_letters(authors):
-  res=authors.replace("é",r"{\'e}").replace("è",r"{\`e}").replace("É",r"{\'E}").replace("ä",r"{\"a}").replace("ö",r"{\"o}").replace("ñ",r"{\~n}").replace("ã",r"{\~a}").replace("ë",r"{\"e}").replace("ı",r"{\i}").replace("Ş",r"{\c{S}}").replace("ş",r"{\c{s}}").replace("%","")
+  res=authors.replace("é",r"{\'e}").replace("è",r"{\`e}").replace("É",r"{\'E}").replace("ä",r"{\"a}").replace("ö",r"{\"o}").replace("ñ",r"{\~n}").replace("ã",r"{\~a}").replace("ë",r"{\"e}").replace("ı",r"{\i}").replace("Ş",r"{\c{S}}").replace("ş",r"{\c{s}}").replace("%","").replace("đ",r"{\-d}")
   try:
     res.encode('ascii')
   except UnicodeEncodeError:

From e4f9a57914f42349c87740914f845388806b95f9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 24 Oct 2023 09:03:48 +0200
Subject: [PATCH 1046/1398] do not use deprecated API

---
 .../isotropic_remeshing_with_sizing_example.cpp               | 4 ++--
 .../test/Polygon_mesh_processing/remeshing_quality_test.cpp   | 2 +-
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index 1fc3c4960d38..6587f1e514bc 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -33,8 +33,8 @@ int main(int argc, char* argv[])
       faces(mesh),
       sizing_field,
       mesh,
-      PMP::parameters::number_of_iterations(nb_iter)
-                      .number_of_relaxation_steps(3)
+      PMP::number_of_iterations(nb_iter)
+          .number_of_relaxation_steps(3)
       );
 
   CGAL::IO::write_polygon_mesh("out.off", mesh, CGAL::parameters::stream_precision(17));
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
index 93b3c4cad05f..eb60d2111cf1 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
@@ -36,7 +36,7 @@ int main(int argc, char* argv[])
       faces(mesh),
       sizing_field,
       mesh,
-      PMP::parameters::number_of_iterations(nb_iter).number_of_relaxation_steps(3)
+      PMP::number_of_iterations(nb_iter).number_of_relaxation_steps(3)
       );
 
   /*

From 1e138a011bafb4208a3d2dbf2217204e2f68eaba Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Wed, 25 Oct 2023 17:21:18 +0200
Subject: [PATCH 1047/1398] fix compilation

---
 .../isotropic_remeshing_with_sizing_example.cpp               | 4 ++--
 .../test/Polygon_mesh_processing/remeshing_quality_test.cpp   | 2 +-
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
index 6587f1e514bc..b4e2475f39d2 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_sizing_example.cpp
@@ -33,8 +33,8 @@ int main(int argc, char* argv[])
       faces(mesh),
       sizing_field,
       mesh,
-      PMP::number_of_iterations(nb_iter)
-          .number_of_relaxation_steps(3)
+      CGAL::parameters::number_of_iterations(nb_iter)
+                       .number_of_relaxation_steps(3)
       );
 
   CGAL::IO::write_polygon_mesh("out.off", mesh, CGAL::parameters::stream_precision(17));
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
index eb60d2111cf1..7ab20cda4246 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
@@ -36,7 +36,7 @@ int main(int argc, char* argv[])
       faces(mesh),
       sizing_field,
       mesh,
-      PMP::number_of_iterations(nb_iter).number_of_relaxation_steps(3)
+      CGAL::parameters::number_of_iterations(nb_iter).number_of_relaxation_steps(3)
       );
 
   /*

From 4c7bc4cbae8d94bac0175017c606a0b5233cde2c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 16 Nov 2023 09:43:35 +0100
Subject: [PATCH 1048/1398] fix after rebase

---
 .../doc/Polygon_mesh_processing/Concepts/PMPSizingField.h  | 7 +++++++
 .../doc/Polygon_mesh_processing/Doxyfile.in                | 5 ++---
 2 files changed, 9 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index d672f19bb063..8641c30c6caf 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -4,6 +4,13 @@
 /// The concept `PMPSizingField` defines the requirements for the sizing field
 /// used in `CGAL::Polygon_mesh_processing::isotropic_remeshing()` to define
 /// the target length for every individual edge during the remeshing process.
+///
+/// \cgalHasModelsBegin
+/// \cgalHasModels{CGAL::Polygon_mesh_processing::Uniform_sizing_field}
+/// \cgalHasModels{CGAL::Polygon_mesh_processing::Adaptive_sizing_field}
+/// \cgalHasModelsEnd
+///
+
 
 class PMPSizingField{
 public:
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
index c27c024648fe..797c895fa7e9 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Doxyfile.in
@@ -23,8 +23,7 @@ EXCLUDE_SYMBOLS += experimental
 HTML_EXTRA_FILES           = ${CGAL_PACKAGE_DOC_DIR}/fig/selfintersections.jpg \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/mesh_smoothing.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/shape_smoothing.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/icc_diff_radius.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_cheese.png \
                              ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_colors.png \
-                             ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_rg_joint.png
-
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/decimate_rg_joint.png \
+                             ${CGAL_PACKAGE_DOC_DIR}/fig/shape_smoothing.png

From bb6222d96d57bb04e78f989aba4296ca3c989e66 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 16 Nov 2023 09:58:08 +0000
Subject: [PATCH 1049/1398] Fix ipelet demo CMakeLists.txt

---
 CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt b/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
index fc3acb1cb7b9..13dd276a8a07 100644
--- a/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
+++ b/CGAL_ipelets/demo/CGAL_ipelets/CMakeLists.txt
@@ -103,7 +103,7 @@ if(IPE_FOUND AND IPE_VERSION)
   #example in doc not installed
   add_library(simple_triangulation MODULE simple_triangulation.cpp)
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS simple_triangulation)
-  target_link_libraries(simple_triangulation CGAL::Eigen3_support
+  target_link_libraries(simple_triangulation CGAL::CGAL CGAL::Eigen3_support
                         ${IPE_LIBRARIES})
   target_include_directories(simple_triangulation BEFORE PRIVATE ${IPE_INCLUDE_DIR})
   if (WITH_IPE_7)

From 1f8d66ba757858699ea6a1bbc375793db5db0ada Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 16 Nov 2023 11:36:09 +0100
Subject: [PATCH 1050/1398] add macro in new resource dir

---
 Documentation/doc/resources/1.10.0/BaseDoxyfile.in | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Documentation/doc/resources/1.10.0/BaseDoxyfile.in b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
index 4818c4493363..9ce9ac906179 100644
--- a/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
@@ -87,7 +87,7 @@ ALIASES                = "cgal=%CGAL" \
                          "gnu=GNU" \
                          "ms=MS" \
                          "qt=Qt" \
-                         "qt5=Qt5" \
+                         "qt6=Qt6" \
                          "eigen=Eigen" \
                          "opengr=OpenGR" \
                          "libpointmatcher=libpointmatcher" \

From 7328ed7fffb0a11a5ec188f73922424531cbedaa Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 16 Nov 2023 11:59:43 +0100
Subject: [PATCH 1051/1398] remove useless (and potentially dangerous) default

---
 .../interpolated_corrected_curvatures.h       | 20 ++++++++-----------
 1 file changed, 8 insertions(+), 12 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index 25de9ec9387f..a8d45d8b867f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -617,12 +617,11 @@ void set_value(const T&, internal_np::Param_not_found)
 
 // computes selected curvatures for one specific vertex
 template<typename PolygonMesh,
-  typename NamedParameters = parameters::Default_named_parameters>
-  void interpolated_corrected_curvatures_one_vertex(
-    const PolygonMesh& pmesh,
-    const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
-    const NamedParameters& np = parameters::default_values()
-  )
+         typename NamedParameters>
+void interpolated_corrected_curvatures_one_vertex(
+  const PolygonMesh& pmesh,
+  const typename boost::graph_traits<PolygonMesh>::vertex_descriptor v,
+  const NamedParameters& np)
 {
   typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
   typedef typename GetVertexPointMap<PolygonMesh, NamedParameters>::const_type Vertex_position_map;
@@ -716,7 +715,7 @@ template<typename PolygonMesh,
 }
 
 
-template<typename PolygonMesh, typename NamedParameters = parameters::Default_named_parameters>
+template<typename PolygonMesh, class NamedParameters>
 class Interpolated_corrected_curvatures_computer
 {
   typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
@@ -780,7 +779,6 @@ class Interpolated_corrected_curvatures_computer
     mu1_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
     mu2_map = get(CGAL::dynamic_face_property_t<FT>(), pmesh);
     muXY_map = get(CGAL::dynamic_face_property_t<std::array<FT, 3 * 3>>(), pmesh);
-
   }
 
   void set_named_params(const NamedParameters& np)
@@ -824,10 +822,8 @@ class Interpolated_corrected_curvatures_computer
 
 public:
 
-  Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,
-    const NamedParameters& np = parameters::default_values()
-  ) :
-    pmesh(pmesh)
+  Interpolated_corrected_curvatures_computer(const PolygonMesh& pmesh,const NamedParameters& np)
+    : pmesh(pmesh)
   {
     set_named_params(np);
 

From 94d123491381d196fb2adc506858feff232cdc9a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 16 Nov 2023 12:00:35 +0100
Subject: [PATCH 1052/1398] restore Mael's version

---
 .../Plugins/Display/Display_property.ui       | 290 ++++++++++--------
 .../Display/Display_property_plugin.cpp       | 192 +++++++++---
 2 files changed, 316 insertions(+), 166 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
index 656ec4827c55..0a824308300d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property.ui
@@ -3,7 +3,7 @@
  <class>DisplayPropertyWidget</class>
  <widget class="QDockWidget" name="DisplayPropertyWidget">
   <property name="enabled">
-   <bool>false</bool>
+   <bool>true</bool>
   </property>
   <property name="geometry">
    <rect>
@@ -39,9 +39,18 @@
     </item>
     <item row="0" column="0" colspan="2">
      <widget class="QGroupBox" name="propertyGroup">
+      <property name="enabled">
+       <bool>true</bool>
+      </property>
       <property name="title">
        <string>Property</string>
       </property>
+      <property name="flat">
+       <bool>false</bool>
+      </property>
+      <property name="checkable">
+       <bool>false</bool>
+      </property>
       <layout class="QVBoxLayout" name="verticalLayout_2">
        <property name="leftMargin">
         <number>6</number>
@@ -82,13 +91,114 @@
          </item>
         </widget>
        </item>
+       <item>
+        <widget class="QSlider" name="expandingRadiusSlider">
+         <property name="enabled">
+          <bool>true</bool>
+         </property>
+         <property name="minimum">
+          <number>0</number>
+         </property>
+         <property name="maximum">
+          <number>100</number>
+         </property>
+         <property name="tracking">
+          <bool>true</bool>
+         </property>
+         <property name="orientation">
+          <enum>Qt::Horizontal</enum>
+         </property>
+         <property name="invertedAppearance">
+          <bool>false</bool>
+         </property>
+         <property name="invertedControls">
+          <bool>false</bool>
+         </property>
+         <property name="tickPosition">
+          <enum>QSlider::TicksAbove</enum>
+         </property>
+        </widget>
+       </item>
+       <item>
+        <widget class="QLabel" name="expandingRadiusLabel">
+         <property name="enabled">
+          <bool>true</bool>
+         </property>
+         <property name="text">
+          <string>Expanding Radius: 0</string>
+         </property>
+        </widget>
+       </item>
+      </layout>
+     </widget>
+    </item>
+    <item row="11" column="0">
+     <widget class="QGroupBox" name="extremeValuesGroup">
+      <property name="enabled">
+       <bool>false</bool>
+      </property>
+      <property name="title">
+       <string>Extreme Values</string>
+      </property>
+      <layout class="QGridLayout" name="gridLayout">
+       <item row="0" column="0">
+        <widget class="QLabel" name="extremeValuesMinLabel">
+         <property name="text">
+          <string>Min Value</string>
+         </property>
+        </widget>
+       </item>
+       <item row="2" column="0">
+        <widget class="QLabel" name="extremeValuesMaxLabel">
+         <property name="text">
+          <string>Max Value</string>
+         </property>
+        </widget>
+       </item>
+       <item row="2" column="1">
+        <widget class="DoubleEdit" name="maxBox">
+         <property name="text">
+          <string>2.00</string>
+         </property>
+         <property name="readOnly">
+          <bool>true</bool>
+         </property>
+        </widget>
+       </item>
+       <item row="2" column="2">
+        <widget class="QPushButton" name="zoomToMaxButton">
+         <property name="text">
+          <string>Zoom to max value</string>
+         </property>
+        </widget>
+       </item>
+       <item row="0" column="2">
+        <widget class="QPushButton" name="zoomToMinButton">
+         <property name="text">
+          <string>Zoom to min value</string>
+         </property>
+        </widget>
+       </item>
+       <item row="0" column="1">
+        <widget class="DoubleEdit" name="minBox">
+         <property name="text">
+          <string>0.00</string>
+         </property>
+         <property name="frame">
+          <bool>true</bool>
+         </property>
+         <property name="readOnly">
+          <bool>true</bool>
+         </property>
+        </widget>
+       </item>
       </layout>
      </widget>
     </item>
     <item row="1" column="0">
-     <layout class="QGridLayout" name="ColoringGroup" columnstretch="50,50">
-      <item row="0" column="0">
-       <spacer name="verticalSpacer">
+     <layout class="QGridLayout" name="ColoringGroup" columnstretch="0,0">
+      <item row="6" column="0">
+       <spacer name="verticalSpacer_4">
         <property name="orientation">
          <enum>Qt::Vertical</enum>
         </property>
@@ -100,7 +210,33 @@
         </property>
        </spacer>
       </item>
-      <item row="1" column="0">
+      <item row="4" column="1" rowspan="3">
+       <widget class="QScrollArea" name="scrollArea">
+        <property name="widgetResizable">
+         <bool>true</bool>
+        </property>
+        <widget class="QWidget" name="scrollAreaWidgetContents">
+         <property name="geometry">
+          <rect>
+           <x>0</x>
+           <y>0</y>
+           <width>236</width>
+           <height>335</height>
+          </rect>
+         </property>
+         <layout class="QGridLayout" name="gridLayout_5">
+          <item row="0" column="0" alignment="Qt::AlignHCenter">
+           <widget class="QLabel" name="legendLabel">
+            <property name="text">
+             <string>RAMP DISPLAYING</string>
+            </property>
+           </widget>
+          </item>
+         </layout>
+        </widget>
+       </widget>
+      </item>
+      <item row="5" column="0">
        <widget class="QGroupBox" name="coloringChoiceGroup">
         <property name="title">
          <string>Color Visualization</string>
@@ -118,10 +254,17 @@
          <property name="bottomMargin">
           <number>0</number>
          </property>
-         <item row="8" column="0">
-          <widget class="QRadioButton" name="randomColorsRadioButton">
+         <item row="5" column="1">
+          <widget class="QPushButton" name="maxColorButton">
            <property name="text">
-            <string>Random colors</string>
+            <string/>
+           </property>
+          </widget>
+         </item>
+         <item row="5" column="0">
+          <widget class="QLabel" name="maxColorLabel">
+           <property name="text">
+            <string>Max color</string>
            </property>
           </widget>
          </item>
@@ -135,20 +278,6 @@
            </property>
           </widget>
          </item>
-         <item row="9" column="0">
-          <widget class="QLabel" name="initColorLabel">
-           <property name="text">
-            <string>First color</string>
-           </property>
-          </widget>
-         </item>
-         <item row="5" column="0">
-          <widget class="QLabel" name="maxColorLabel">
-           <property name="text">
-            <string>Max color</string>
-           </property>
-          </widget>
-         </item>
          <item row="2" column="0" colspan="2">
           <widget class="QRadioButton" name="colorRampRadioButton">
            <property name="text">
@@ -159,32 +288,42 @@
            </property>
           </widget>
          </item>
-         <item row="9" column="1">
+         <item row="10" column="1">
           <widget class="QPushButton" name="initColorButton">
            <property name="text">
             <string/>
            </property>
           </widget>
          </item>
-         <item row="5" column="1">
-          <widget class="QPushButton" name="maxColorButton">
+         <item row="3" column="0">
+          <widget class="QLabel" name="minColorLabel">
            <property name="text">
-            <string/>
+            <string>Min color</string>
            </property>
           </widget>
          </item>
-         <item row="3" column="0">
-          <widget class="QLabel" name="minColorLabel">
+         <item row="10" column="0">
+          <widget class="QLabel" name="initColorLabel">
            <property name="text">
-            <string>Min color</string>
+            <string>First color</string>
+           </property>
+          </widget>
+         </item>
+         <item row="8" column="0">
+          <widget class="QRadioButton" name="randomColorsRadioButton">
+           <property name="text">
+            <string>Random colors</string>
            </property>
           </widget>
          </item>
         </layout>
        </widget>
       </item>
-      <item row="2" column="0">
-       <spacer name="verticalSpacer_4">
+      <item row="3" column="0">
+       <layout class="QGridLayout" name="gridLayout_6"/>
+      </item>
+      <item row="4" column="0">
+       <spacer name="verticalSpacer">
         <property name="orientation">
          <enum>Qt::Vertical</enum>
         </property>
@@ -196,97 +335,8 @@
         </property>
        </spacer>
       </item>
-      <item row="0" column="1" rowspan="3">
-       <widget class="QScrollArea" name="scrollArea">
-        <property name="widgetResizable">
-         <bool>true</bool>
-        </property>
-        <widget class="QWidget" name="scrollAreaWidgetContents">
-         <property name="geometry">
-          <rect>
-           <x>0</x>
-           <y>0</y>
-           <width>236</width>
-           <height>397</height>
-          </rect>
-         </property>
-         <layout class="QGridLayout" name="gridLayout_5">
-          <item row="0" column="0" alignment="Qt::AlignHCenter">
-           <widget class="QLabel" name="legendLabel">
-            <property name="text">
-             <string>RAMP DISPLAYING</string>
-            </property>
-           </widget>
-          </item>
-         </layout>
-        </widget>
-       </widget>
-      </item>
      </layout>
     </item>
-    <item row="11" column="0">
-     <widget class="QGroupBox" name="extremeValuesGroup">
-      <property name="enabled">
-       <bool>false</bool>
-      </property>
-      <property name="title">
-       <string>Extreme Values</string>
-      </property>
-      <layout class="QGridLayout" name="gridLayout">
-       <item row="0" column="0">
-        <widget class="QLabel" name="extremeValuesMinLabel">
-         <property name="text">
-          <string>Min Value</string>
-         </property>
-        </widget>
-       </item>
-       <item row="2" column="0">
-        <widget class="QLabel" name="extremeValuesMaxLabel">
-         <property name="text">
-          <string>Max Value</string>
-         </property>
-        </widget>
-       </item>
-       <item row="2" column="1">
-        <widget class="DoubleEdit" name="maxBox">
-         <property name="text">
-          <string>2.00</string>
-         </property>
-         <property name="readOnly">
-          <bool>true</bool>
-         </property>
-        </widget>
-       </item>
-       <item row="2" column="2">
-        <widget class="QPushButton" name="zoomToMaxButton">
-         <property name="text">
-          <string>Zoom to max value</string>
-         </property>
-        </widget>
-       </item>
-       <item row="0" column="2">
-        <widget class="QPushButton" name="zoomToMinButton">
-         <property name="text">
-          <string>Zoom to min value</string>
-         </property>
-        </widget>
-       </item>
-       <item row="0" column="1">
-        <widget class="DoubleEdit" name="minBox">
-         <property name="text">
-          <string>0.00</string>
-         </property>
-         <property name="frame">
-          <bool>true</bool>
-         </property>
-         <property name="readOnly">
-          <bool>true</bool>
-         </property>
-        </widget>
-       </item>
-      </layout>
-     </widget>
-    </item>
    </layout>
   </widget>
  </widget>
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 687cb6a92dfd..fb06449e972d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -28,11 +28,11 @@
 #include <QAction>
 #include <QApplication>
 #include <QColor>
-#include <QSlider>
 #include <QColorDialog>
 #include <QInputDialog>
 #include <QMainWindow>
 #include <QMessageBox>
+#include <QSlider>
 #include <QObject>
 #include <QPalette>
 #include <QStyleFactory>
@@ -47,9 +47,9 @@
 #define ARBITRARY_DBL_MIN 1.0E-17
 #define ARBITRARY_DBL_MAX 1.0E+17
 
-using namespace CGAL::Three;
-
+namespace PMP = CGAL::Polygon_mesh_processing;
 
+using namespace CGAL::Three;
 
 Viewer_interface* (&getActiveViewer)() = Three::activeViewer;
 
@@ -89,6 +89,9 @@ class Display_property_plugin
   double gI = 1.;
   double bI = 0.;
 
+  double expand_radius = 0.;
+  double maxEdgeLength = -1.;
+
   Color_ramp color_ramp;
   std::vector<QColor> color_map;
   QPixmap legend;
@@ -102,10 +105,10 @@ class Display_property_plugin
     MIN_VALUE,
     MAX_VALUE
   };
-
-  enum CurvatureType {
+  enum CurvatureType
+  {
     MEAN_CURVATURE,
-    GAUSSIAN_CURVATURE
+    GAUSSIAN_CURVATURE,
   };
 
 public:
@@ -205,6 +208,9 @@ class Display_property_plugin
             this, &Display_property_plugin::on_zoomToMinButton_pressed);
     connect(dock_widget->zoomToMaxButton, &QPushButton::pressed,
             this, &Display_property_plugin::on_zoomToMaxButton_pressed);
+
+    connect(dock_widget->expandingRadiusSlider, &QSlider::valueChanged,
+            this, &Display_property_plugin::setExpandingRadius);
   }
 
 private Q_SLOTS:
@@ -247,26 +253,32 @@ private Q_SLOTS:
       dock_widget->maxBox->setRange(0, 360);
       dock_widget->maxBox->setValue(0);
     }
-    else if (property_name == "Interpolated Corrected Gaussian Curvature" ||
-             property_name == "Interpolated Corrected Mean Curvature")
+    else if(property_name == "Scaled Jacobian")
     {
       dock_widget->minBox->setRange(-1000, 1000);
       dock_widget->minBox->setValue(0);
       dock_widget->maxBox->setRange(-1000, 1000);
       dock_widget->maxBox->setValue(0);
     }
-    else if(property_name == "Scaled Jacobian")
+    else if(property_name == "Face Area")
     {
       dock_widget->minBox->setRange(-1000, 1000);
       dock_widget->minBox->setValue(0);
       dock_widget->maxBox->setRange(-1000, 1000);
       dock_widget->maxBox->setValue(0);
     }
-    else if(property_name == "Face Area")
+    else if (property_name == "Interpolated Corrected Mean Curvature")
     {
-      dock_widget->minBox->setRange(-1000, 1000);
+      dock_widget->minBox->setRange(-99999999, 99999999);
       dock_widget->minBox->setValue(0);
-      dock_widget->maxBox->setRange(-1000, 1000);
+      dock_widget->maxBox->setRange(-99999999, 99999999);
+      dock_widget->maxBox->setValue(0);
+    }
+    else if (property_name == "Interpolated Corrected Gaussian Curvature")
+    {
+      dock_widget->minBox->setRange(-99999999, 99999999);
+      dock_widget->minBox->setValue(0);
+      dock_widget->maxBox->setRange(-99999999, 99999999);
       dock_widget->maxBox->setValue(0);
     }
     else
@@ -500,6 +512,15 @@ private Q_SLOTS:
     {
       dock_widget->setEnabled(true);
       disableExtremeValues(); // only available after coloring
+
+      // Curvature property-specific slider
+      const std::string& property_name = dock_widget->propertyBox->currentText().toStdString();
+      const bool is_curvature_property = (property_name == "Interpolated Corrected Mean Curvature" ||
+                                          property_name == "Interpolated Corrected Gaussian Curvature");
+      dock_widget->expandingRadiusLabel->setVisible(is_curvature_property);
+      dock_widget->expandingRadiusSlider->setVisible(is_curvature_property);
+      dock_widget->expandingRadiusLabel->setEnabled(is_curvature_property);
+      dock_widget->expandingRadiusSlider->setEnabled(is_curvature_property);
     }
     else // no or broken property
     {
@@ -527,15 +548,10 @@ private Q_SLOTS:
   {
     CGAL_assertion(static_cast<std::size_t>(dock_widget->propertyBox->count()) == property_simplex_types.size());
 
-    const int property_index = dock_widget->propertyBox->currentIndex();
-
     // leave it flat if it was, otherwise set to flat+edges
-    if(sm_item->renderingMode() != Flat && sm_item->renderingMode() != FlatPlusEdges && property_simplex_types.at(property_index) == Property_simplex_type::FACE)
+    if(sm_item->renderingMode() != Flat && sm_item->renderingMode() != FlatPlusEdges)
       sm_item->setRenderingMode(FlatPlusEdges);
 
-    if(sm_item->renderingMode() != Gouraud && sm_item->renderingMode() != GouraudPlusEdges && property_simplex_types.at(property_index) == Property_simplex_type::VERTEX)
-      sm_item->setRenderingMode(GouraudPlusEdges);
-
     const std::string& property_name = dock_widget->propertyBox->currentText().toStdString();
     if(property_name == "Smallest Angle Per Face")
     {
@@ -555,11 +571,13 @@ private Q_SLOTS:
     }
     else if(property_name == "Interpolated Corrected Mean Curvature")
     {
-      displayCurvature(sm_item, MEAN_CURVATURE);
+      displayInterpolatedCurvatureMeasure(sm_item, MEAN_CURVATURE);
+      sm_item->setRenderingMode(Gouraud);
     }
     else if(property_name == "Interpolated Corrected Gaussian Curvature")
     {
-      displayCurvature(sm_item, GAUSSIAN_CURVATURE);
+      displayInterpolatedCurvatureMeasure(sm_item, GAUSSIAN_CURVATURE);
+      sm_item->setRenderingMode(Gouraud);
     }
     else
     {
@@ -663,8 +681,8 @@ private Q_SLOTS:
     removeDisplayPluginProperty(item, "f:display_plugin_largest_angle");
     removeDisplayPluginProperty(item, "f:display_plugin_scaled_jacobian");
     removeDisplayPluginProperty(item, "f:display_plugin_area");
-    removeDisplayPluginProperty(item, "f:display_plugin_mean_curvature");
-    removeDisplayPluginProperty(item, "f:display_plugin_gaussian_curvature");
+    removeDisplayPluginProperty(item, "v:display_plugin_interpolated_corrected_mean_curvature");
+    removeDisplayPluginProperty(item, "v:display_plugin_interpolated_corrected_Gaussian_curvature");
   }
 
   void displayExtremumAnglePerFace(Scene_surface_mesh_item* sm_item,
@@ -753,7 +771,7 @@ private Q_SLOTS:
           halfedge_descriptor local_border_h = opposite(halfedge(local_f, local_smesh), local_smesh);
           CGAL_assertion(is_border(local_border_h, local_smesh));
 
-          CGAL::Polygon_mesh_processing::triangulate_faces(local_smesh);
+          PMP::triangulate_faces(local_smesh);
 
           double extremum_angle_in_face = ARBITRARY_DBL_MAX;
           halfedge_descriptor local_border_end_h = local_border_h;
@@ -806,7 +824,7 @@ private Q_SLOTS:
               const SMesh& mesh) const
   {
     if(CGAL::is_triangle(halfedge(f, mesh), mesh))
-      return CGAL::Polygon_mesh_processing::face_area(f, mesh);
+      return PMP::face_area(f, mesh);
 
     auto vpm = get(boost::vertex_point, mesh);
 
@@ -822,8 +840,8 @@ private Q_SLOTS:
     }
 
     CGAL::Euler::add_face(local_vertices, local_smesh);
-    CGAL::Polygon_mesh_processing::triangulate_faces(local_smesh);
-    return CGAL::Polygon_mesh_processing::area(local_smesh);
+    PMP::triangulate_faces(local_smesh);
+    return PMP::area(local_smesh);
   }
 
   void displayArea(Scene_surface_mesh_item* sm_item)
@@ -845,30 +863,113 @@ private Q_SLOTS:
     displaySMProperty<face_descriptor>("f:display_plugin_area", *sm);
   }
 
-  void displayCurvature(Scene_surface_mesh_item* sm_item,
-                        const CurvatureType curvature_type)
+private Q_SLOTS:
+  void setExpandingRadius()
   {
-    SMesh* sm = sm_item->face_graph();
-    if(sm == nullptr)
+    double sliderMin = dock_widget->expandingRadiusSlider->minimum();
+    double sliderMax = dock_widget->expandingRadiusSlider->maximum() - sliderMin;
+    double val = dock_widget->expandingRadiusSlider->value() - sliderMin;
+    sliderMin = 0;
+
+    Scene_item* item = scene->item(scene->mainSelectionIndex());
+    Scene_surface_mesh_item* sm_item = qobject_cast<Scene_surface_mesh_item*>(item);
+    if(sm_item == nullptr)
       return;
 
-    bool not_initialized;
-    std::string tied_string = (curvature_type == MEAN_CURVATURE) ?
-      "v:display_plugin_mean_curvature" : "v:display_plugin_gaussian_curvature";
+    SMesh& smesh = *(sm_item->face_graph());
 
-    SMesh::Property_map<vertex_descriptor, double> vcurvature;
-    std::tie(vcurvature, not_initialized) = sm->add_property_map<vertex_descriptor, double>(tied_string, 0);
+    auto vpm = get(CGAL::vertex_point, smesh);
 
-    if (curvature_type == MEAN_CURVATURE)
+    // @todo use the upcoming PMP::longest_edge
+    if(maxEdgeLength < 0)
     {
-      CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(*sm, CGAL::parameters::vertex_mean_curvature(vcurvature));
+      auto edge_range = CGAL::edges(smesh);
+
+      if(num_edges(smesh) == 0)
+      {
+        expand_radius = 0;
+        dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius: %1").arg(expand_radius));
+        return;
+      }
+
+      auto eit = std::max_element(edge_range.begin(), edge_range.end(),
+                                  [&, vpm, smesh](auto l, auto r)
+                                  {
+                                    auto res = EPICK().compare_squared_distance_3_object()(
+                                        get(vpm, source((l), smesh)),
+                                        get(vpm, target((l), smesh)),
+                                        get(vpm, source((r), smesh)),
+                                        get(vpm, target((r), smesh)));
+                                    return (res == CGAL::SMALLER);
+                                });
+
+      CGAL_assertion(eit != edge_range.end());
+
+      maxEdgeLength = PMP::edge_length(*eit, smesh);
     }
-    else if (curvature_type == GAUSSIAN_CURVATURE)
+
+    double outMax = 5 * maxEdgeLength, base = 1.2;
+
+    expand_radius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
+    dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius: %1").arg(expand_radius));
+  }
+
+private:
+  void displayInterpolatedCurvatureMeasure(Scene_surface_mesh_item* item,
+                                           CurvatureType mu_index)
+  {
+    if(mu_index != MEAN_CURVATURE && mu_index != GAUSSIAN_CURVATURE)
+      return;
+
+    std::string tied_string = (mu_index == MEAN_CURVATURE) ? "v:display_plugin_interpolated_corrected_mean_curvature"
+                                                           : "v:display_plugin_interpolated_corrected_Gaussian_curvature";
+
+    SMesh& smesh = *item->face_graph();
+
+    const auto vnm = smesh.property_map<vertex_descriptor, EPICK::Vector_3>("v:normal_before_perturbation").first;
+    const bool vnm_exists = smesh.property_map<vertex_descriptor, EPICK::Vector_3>("v:normal_before_perturbation").second;
+
+    // compute once and store the value per vertex
+    bool non_init;
+    SMesh::Property_map<vertex_descriptor, double> mu_i_map;
+    std::tie(mu_i_map, non_init) = smesh.add_property_map<vertex_descriptor, double>(tied_string, 0);
+    if(non_init)
     {
-      CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures(*sm, CGAL::parameters::vertex_Gaussian_curvature(vcurvature));
+      if(vnm_exists)
+      {
+        if(mu_index == MEAN_CURVATURE)
+        {
+          PMP::interpolated_corrected_curvatures(smesh,
+                                                 CGAL::parameters::vertex_mean_curvature_map(mu_i_map)
+                                                                  .ball_radius(expand_radius)
+                                                                  .vertex_normal_map(vnm));
+        }
+        else
+        {
+          PMP::interpolated_corrected_curvatures(smesh,
+                                                 CGAL::parameters::vertex_Gaussian_curvature_map(mu_i_map)
+                                                                  .ball_radius(expand_radius)
+                                                                  .vertex_normal_map(vnm));
+        }
+      }
+      else
+      {
+        if(mu_index == MEAN_CURVATURE)
+        {
+          PMP::interpolated_corrected_curvatures(smesh,
+                                                  CGAL::parameters::vertex_mean_curvature_map(mu_i_map)
+                                                                   .ball_radius(expand_radius));
+        }
+        else
+        {
+          PMP::interpolated_corrected_curvatures(smesh,
+                                                 CGAL::parameters::vertex_Gaussian_curvature_map(mu_i_map)
+                                                                  .ball_radius(expand_radius));
+        }
+      }
     }
 
-    displaySMProperty<vertex_descriptor>(tied_string, *sm);
+    displaySMProperty<vertex_descriptor>(tied_string, smesh);
   }
 
 private:
@@ -1027,9 +1128,9 @@ private Q_SLOTS:
       else if(property_name == "Face Area")
         zoomToSimplexWithPropertyExtremum(faces(mesh), mesh, "f:display_plugin_area", extremum);
       else if(property_name == "Interpolated Corrected Mean Curvature")
-        zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, "v:display_plugin_mean_curvature", extremum);
+        zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, "v:display_plugin_interpolated_corrected_mean_curvature", extremum);
       else if(property_name == "Interpolated Corrected Gaussian Curvature")
-        zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, "v:display_plugin_gaussian_curvature", extremum);
+        zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, "v:display_plugin_interpolated_corrected_Gaussian_curvature", extremum);
       else if(property_simplex_types.at(property_index) == Property_simplex_type::VERTEX)
         zoomToSimplexWithPropertyExtremum(vertices(mesh), mesh, property_name, extremum);
       else if(property_simplex_types.at(property_index) == Property_simplex_type::FACE)
@@ -1312,7 +1413,7 @@ scaled_jacobian(const face_descriptor f,
   for(std::size_t i=0; i<edges.size(); ++i)
     corner_normals.push_back(CGAL::cross_product(edges[i], edges[(i+1)%(edges.size())]));
 
-  EPICK::Vector_3 unit_center_normal = CGAL::Polygon_mesh_processing::compute_face_normal(f, mesh);
+  EPICK::Vector_3 unit_center_normal = PMP::compute_face_normal(f, mesh);
 
   for(std::size_t i=0; i<corner_areas.size(); ++i)
     corner_areas[i] =  unit_center_normal*corner_normals[i];
@@ -1365,9 +1466,8 @@ isSMPropertyScalar(const std::string& name,
      name == "f:display_plugin_largest_angle" ||
      name == "f:display_plugin_scaled_jacobian" ||
      name == "f:display_plugin_area" ||
-     name == "f:display_plugin_mean_curvature" ||
-     name == "f:display_plugin_gaussian_curvature")
-
+     name == "v:display_plugin_interpolated_corrected_mean_curvature" ||
+     name == "v:display_plugin_interpolated_corrected_Gaussian_curvature")
     return false;
 
   // the dispatch function does the filtering we want: if it founds a property

From cb5bd56ef0dd9161096346f185b2c696a5b30bd2 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 16 Nov 2023 14:44:44 +0100
Subject: [PATCH 1053/1398] update install.sh

Now almost all dependencies of the CGAL 3D demo are installed.

Exceptions:
```
-- Missing optional packages:
 * LASLIB, A library for LIDAR I/O.
   Required for reading or writing LAS files.
 * SCIP, A solver for mixed integer programming.
   Can be used as a solver in the surface_reconstruction_plugin plugin.
 * OpenGR
 * libpointmatcher
```
---
 .github/install.sh | 31 ++++++++++++++++++++++++-------
 1 file changed, 24 insertions(+), 7 deletions(-)

diff --git a/.github/install.sh b/.github/install.sh
index 32b8552aa8f6..8759748fa5e2 100755
--- a/.github/install.sh
+++ b/.github/install.sh
@@ -1,11 +1,28 @@
 #!/bin/bash
+
+set -e
+
 sudo apt-get update
-sudo apt-get install -y  libmpfr-dev \
- libeigen3-dev qtbase5-dev libqt5sql5-sqlite libqt5opengl5-dev qtscript5-dev \
- libqt5svg5-dev qttools5-dev qttools5-dev-tools libboost-dev libinsighttoolkit4-dev zsh
-#update cmake to 3.18.4
+sudo apt-get install -y \
+ libmpfr-dev \
+ libtbb-dev \
+ libmetis-dev \
+ libssh-dev \
+ libeigen3-dev \
+ qtbase5-dev libqt5sql5-sqlite libqt5opengl5-dev qtscript5-dev libqt5websockets5-dev \
+ libqt5svg5-dev qttools5-dev qttools5-dev-tools \
+ libboost-dev libboost-serialization-dev libboost-iostreams-dev libboost-filesystem-dev libboost-filesystem-dev \
+ libvtk9-dev \
+ libinsighttoolkit4-dev \
+ libceres-dev \
+ libglpk-dev \
+ libopencv-dev \
+ zsh
+
+#update CMake
 sudo apt purge --auto-remove cmake
 cd /tmp
-wget https://cmake.org/files/v3.18/cmake-3.18.4-Linux-x86_64.sh
-sudo sh cmake-3.18.4-Linux-x86_64.sh --skip-license --prefix=/usr/local
-rm cmake-3.18.4-Linux-x86_64.sh
+CMAKE_VER=$(curl --silent https://cmake.org/files/LatestRelease/cmake-latest-files-v1.json | jq -r .version.string)
+wget https://cmake.org/files/LatestRelease/cmake-$CMAKE_VER-linux-x86_64.sh
+sudo sh cmake-*.sh --skip-license --prefix=/usr/local
+rm cmake-*.sh

From 8db251c7963a35b24d67be2f1086e7830a5c5bb1 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 16 Nov 2023 14:56:46 +0100
Subject: [PATCH 1054/1398] set -x for install.sh

---
 .github/install.sh | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/.github/install.sh b/.github/install.sh
index 8759748fa5e2..0b1f3c5db9ef 100755
--- a/.github/install.sh
+++ b/.github/install.sh
@@ -1,6 +1,6 @@
 #!/bin/bash
 
-set -e
+set -ex
 
 sudo apt-get update
 sudo apt-get install -y \

From 0a9392c778ab7e485603ed0658e1f679b0be44bb Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 16 Nov 2023 15:00:06 +0100
Subject: [PATCH 1055/1398] try to fix issue with Github's Ubuntu

---
 .github/install.sh | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/.github/install.sh b/.github/install.sh
index 0b1f3c5db9ef..e41d4762a2e0 100755
--- a/.github/install.sh
+++ b/.github/install.sh
@@ -12,7 +12,7 @@ sudo apt-get install -y \
  qtbase5-dev libqt5sql5-sqlite libqt5opengl5-dev qtscript5-dev libqt5websockets5-dev \
  libqt5svg5-dev qttools5-dev qttools5-dev-tools \
  libboost-dev libboost-serialization-dev libboost-iostreams-dev libboost-filesystem-dev libboost-filesystem-dev \
- libvtk9-dev \
+ libvtk9-dev libunwind-dev \
  libinsighttoolkit4-dev \
  libceres-dev \
  libglpk-dev \

From 74896b99c08a79ab6721675c504c9f45e6612c2e Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 16 Nov 2023 16:27:23 +0100
Subject: [PATCH 1056/1398] Use ITK 5.x instead of 4.13

---
 .github/install.sh                                       | 2 +-
 Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt | 6 +++++-
 2 files changed, 6 insertions(+), 2 deletions(-)

diff --git a/.github/install.sh b/.github/install.sh
index e41d4762a2e0..5fc8323c8c9f 100755
--- a/.github/install.sh
+++ b/.github/install.sh
@@ -13,7 +13,7 @@ sudo apt-get install -y \
  libqt5svg5-dev qttools5-dev qttools5-dev-tools \
  libboost-dev libboost-serialization-dev libboost-iostreams-dev libboost-filesystem-dev libboost-filesystem-dev \
  libvtk9-dev libunwind-dev \
- libinsighttoolkit4-dev \
+ libinsighttoolkit5-dev \
  libceres-dev \
  libglpk-dev \
  libopencv-dev \
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
index 994a71fc703d..f7cadd99fb66 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
@@ -33,7 +33,11 @@ find_package(ITK NAMES ITK InsightToolkit
 if(ITK_FOUND)
   include(${ITK_USE_FILE})
   set(ITK_LIBS ITKCommon ITKSmoothing ITKImageIntensity)
-
+  foreach(lib ${ITK_LIBS})
+    if(NOT TARGET ${lib})
+      message(STATUS "ITK library ${lib} not found")
+    endif()
+  endforeach()
   target_link_libraries(mesh_3_plugin PUBLIC ${ITK_LIBS})
   target_compile_definitions(mesh_3_plugin PUBLIC CGAL_USE_ITK)
 endif(ITK_FOUND)

From 38482e8aa3fdbae573b55318dd3e716ef2c1062e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 16 Nov 2023 17:28:23 +0100
Subject: [PATCH 1057/1398] remove todo

There will not be any crash as the value for new vertices
is always set. However with Polyhedron since we don't reuse
vertices, the map size might get large. Surface_mesh is fine
---
 .../include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index a98b22de4edc..a61edc699d06 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -145,7 +145,6 @@ class Adaptive_sizing_field
   void calc_sizing_map(FaceGraph& face_graph
                      , const NamedParameters& np)
   {
-    //todo ip: please check if this is good enough to store curvature
     typedef Principal_curvatures_and_directions<K> Principal_curvatures;
     typedef typename CGAL::dynamic_vertex_property_t<Principal_curvatures> Vertex_curvature_tag;
     typedef typename boost::property_map<FaceGraph,

From 73bd84ddd1ab845643705d63f94e5eac33d162af Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 17 Nov 2023 11:25:44 +0100
Subject: [PATCH 1058/1398] Improve add_toc_to_github_wiki_page.py

- reformat using `black`
- add an option `--max-level`
- quote anchors (for accentuated character)
- fix linter errors
---
 .../add_toc_to_github_wiki_page.py            | 191 +++++++++---------
 1 file changed, 98 insertions(+), 93 deletions(-)

diff --git a/Scripts/developer_scripts/add_toc_to_github_wiki_page.py b/Scripts/developer_scripts/add_toc_to_github_wiki_page.py
index ce61f49db7e1..494878cca738 100644
--- a/Scripts/developer_scripts/add_toc_to_github_wiki_page.py
+++ b/Scripts/developer_scripts/add_toc_to_github_wiki_page.py
@@ -1,125 +1,130 @@
-from sys import argv
-from sys import exit
 import codecs
 import re
 import argparse
+import sys
+from urllib.parse import quote
 
 parser = argparse.ArgumentParser()
-parser.add_argument("filename",
-                    help="the Mardown file to process")
-parser.add_argument("--codebase",
-                    help="for a Markdown file of Codebase instead of Github",
-                    action="store_true")
-parser.add_argument("--h1",
-                    help="support level one sections (h1)",
-                    action="store_true")
+parser.add_argument("filename", help="the Mardown file to process")
+parser.add_argument(
+    "--codebase",
+    help="for a Markdown file of Codebase instead of Github",
+    action="store_true",
+)
+parser.add_argument("--h1", help="support level one sections (h1)", action="store_true")
+parser.add_argument("--max-level", help="maximum level of sections", type=int, default = 5)
 args = parser.parse_args()
 
+
 # a probably incomplete version to generate an anchor from a section name
 def get_anchor(s):
-  s = s.replace("`","")
-  s = s.replace("(","")
-  s = s.replace(")","")
-  s = s.replace(".","")
-  s = s.replace("#","")
-  s = s.replace(":","")
-  s = s.replace(",","")
-  s = s.replace(";","")
-  if args.codebase:
-    s = s.replace("/","-")
-  else:
-    s = s.replace("/","")
-  s = s.replace("<","")
-  s = s.replace(">","")
-  s = s.replace("+","")
-  s = s.replace("=","")
-  s = s.replace("?","")
-  s = s.replace("@","")
-  s = s.lstrip(" ")
-  s = s.rstrip("\n")
-  s = s.rstrip(" ")
-  s = re.sub(r'\s+','-',s)
-  if not args.codebase:
-    s = s.lower()
-  if args.codebase:
-    s = s.replace("'","-and-39-")
-  return "#"+s
+    s = s.replace("`", "")
+    s = s.replace("(", "")
+    s = s.replace(")", "")
+    s = s.replace(".", "")
+    s = s.replace("#", "")
+    s = s.replace(":", "")
+    s = s.replace(",", "")
+    s = s.replace(";", "")
+    if args.codebase:
+        s = s.replace("/", "-")
+    else:
+        s = s.replace("/", "")
+    s = s.replace("<", "")
+    s = s.replace(">", "")
+    s = s.replace("+", "")
+    s = s.replace("=", "")
+    s = s.replace("?", "")
+    s = s.replace("@", "")
+    s = s.lstrip(" ")
+    s = s.rstrip("\n")
+    s = s.rstrip(" ")
+    s = re.sub(r"\s+", "-", s)
+    if not args.codebase:
+        s = s.lower()
+    if args.codebase:
+        s = s.replace("'", "-and-39-")
+    return "#" + quote(s)
+
 
 # indices the nesting level (first level allowed is ##)
 def get_level(s):
-  m = re.search('^(#+)\s', s)
-  if m:
-    return len(m.group(1))
-  else:
-    return 0
+    m = re.search(r"^(#+)\s", s)
+    if m:
+        return len(m.group(1))
+    else:
+        return 0
+
 
 def get_name(s):
-  m = re.search('^#+\s+(.*)\s*$', s)
-  if m:
-    return m.group(1)
-  else:
-    return "ERROR: Section name extraction"
+    m = re.search(r"^#+\s+(.*)\s*$", s)
+    if m:
+        return m.group(1)
+    else:
+        return "ERROR: Section name extraction"
+
 
-#generate the entry for one section
+# generate the entry for one section
 def get_toc_entry(s):
-  name = get_name(s)
-  if args.h1:
-    level = get_level(s)-1
-  else:
-    level = get_level(s)-2
-  anchor = get_anchor(s)
+    name = get_name(s)
+    if args.h1:
+        level = get_level(s) - 1
+    else:
+        level = get_level(s) - 2
+    anchor = get_anchor(s)
+
+    if level < 0:
+        return "ERROR: h1 sections are not allowed"
 
-  if level<0:
-    return "ERROR: h1 sections are not allowed"
+    res = "* [" + name + "](" + anchor + ")"
+    for _ in range(0, level):
+        res = "  " + res
+    return res
 
-  res="* ["+name+"]("+anchor+")"
-  for i in range(0,level):
-    res="  "+res
-  return res
 
-#now the main
-input = args.filename
+# now the main
+filename = args.filename
 
-f = codecs.open(input, 'r', encoding='utf-8')
+f = codecs.open(filename, "r", encoding="utf-8")
 
 if not f:
-  print("Cannot open "+input+"\n")
-  exit()
+    print("Cannot open " + input + "\n")
+    sys.exit()
 
-#look for <!--TOC--> the begin of the file
-line=f.readline()
-if line.find("<!--TOC-->")==-1:
-  exit()
+# look for <!--TOC--> the begin of the file
+line = f.readline()
+if line.find("<!--TOC-->") == -1:
+    sys.exit()
 
-#skip current TOC
-line=f.readline()
-while line and line.find("<!--TOC-->")==-1:
-  line=f.readline()
+# skip current TOC
+line = f.readline()
+while line and line.find("<!--TOC-->") == -1:
+    line = f.readline()
 
 if not line:
-  exit()
+    sys.exit()
 
-buffer=""
-TOC="<!--TOC-->\n\n# Table of Contents\n"
+buffer = ""
+TOC = "<!--TOC-->\n\n# Table of Contents\n"
 
-verbatim_mode=False # to ignore verbatim mode while looking for sections
-TOC_empty=True
+verbatim_mode = False  # to ignore verbatim mode while looking for sections
+TOC_empty = True
 for line in f.readlines():
-  buffer+=line
-  if verbatim_mode:
-    if line[:3]=="```":
-      verbatim_mode=False
-  else:
-    if line[:3]=="```":
-      verbatim_mode=True
+    buffer += line
+    if verbatim_mode:
+        if line[:3] == "```":
+            verbatim_mode = False
     else:
-      if line[0]=="#":
-        TOC+=(get_toc_entry(line)+"\n")
-        TOC_empty=False
-TOC+="\n<!--TOC-->\n"
+        if line[:3] == "```":
+            verbatim_mode = True
+        else:
+            if line[0] == "#" and get_level(line) <= args.max_level:
+                TOC += get_toc_entry(line) + "\n"
+                TOC_empty = False
+TOC += "\n<!--TOC-->\n"
 
 if not TOC_empty:
-  f.close()
-  f = codecs.open(input, 'w', encoding='utf-8')
-  f.write(TOC)
-  f.write(buffer)
+    f.close()
+    f = codecs.open(filename, "w", encoding="utf-8")
+    f.write(TOC)
+    f.write(buffer)

From 850c99e0f27fd7e93454a7a401796e853195560c Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 17 Nov 2023 16:18:04 +0100
Subject: [PATCH 1059/1398] make data match exactly at vertices

with no degenerate border edges
---
 .../Intersection12.off                        |  1648 +-
 .../Intersection23.off                        |   833 -
 .../polyhedral_complex_of_spheres/Sphere1.off | 13242 +++++++-------
 .../polyhedral_complex_of_spheres/Sphere2.off | 14364 ++++++++--------
 .../polyhedral_complex_of_spheres/Sphere3.off | 13462 ++++++++-------
 .../CGAL/Polyhedral_complex_mesh_domain_3.h   |     2 +
 ...ral_complex_with_manifold_and_min_size.cpp |    12 +-
 7 files changed, 21369 insertions(+), 22194 deletions(-)
 delete mode 100644 Data/data/meshes/polyhedral_complex_of_spheres/Intersection23.off

diff --git a/Data/data/meshes/polyhedral_complex_of_spheres/Intersection12.off b/Data/data/meshes/polyhedral_complex_of_spheres/Intersection12.off
index 76557b56a72f..1bb3adb4471e 100644
--- a/Data/data/meshes/polyhedral_complex_of_spheres/Intersection12.off
+++ b/Data/data/meshes/polyhedral_complex_of_spheres/Intersection12.off
@@ -1,821 +1,831 @@
-NOFF
-331 486 0
+OFF
+336 491 0
 
-0.7543766356118875 0.43510778217590995 -0.23778877920326758  -0.25098113386125442 -0.57611676249591892 0.77788041909855277
-0.74416681593888767 0.37811394098752249 -0.28711353530938599  -0.26123864468751851 -0.63469945426951124 0.72726265769102505
-0.81085466860836364 0.38791883075529854 -0.25839317298936149  -0.19358827458119576 -0.62484261256047735 0.75636980999592562
-0.23484719550275523 0.42236282692723082 -0.79683385603280099  -0.78085960551688738 -0.58928970592655849 0.20735457304096572
-0.22882364378366471 0.45886020497699476 -0.73008380957164554  -0.78691259802683167 -0.55218785652865787 0.27542173873706588
-0.19177788682311969 0.48472204902454452 -0.79587834752179276  -0.8248245035506494 -0.52568280774650544 0.20813967421463764
-0.28832514482274552 0.57052582071169811 -0.48089420169576869  -0.72592006295091105 -0.43849581670457061 0.52986930552536926
-0.33020050982234728 0.50638270952520359 -0.48220601248944894  -0.6837079082305223 -0.5033061399972395 0.52841879760671162
-0.34172502430316598 0.55775866770488691 -0.42424253336914886  -0.67165289641182357 -0.45152335920120623 0.58737470394737512
-0.54881477307315141 0.17578736338136591 -0.72160204626986268  -0.46019616855581241 -0.84103034646625352 0.28440717777405633
-0.60674851766146465 0.16310183281189838 -0.67541606725572378  -0.40118660278746826 -0.85394740027497851 0.3313957563208314
-0.54374625724929748 0.20493337999462402 -0.6534432341171178  -0.4655048671593241 -0.8112190206795088 0.35387698305874415
-0.194653418534527 0.60701517323697041 -0.60328875784028047  -0.82172156155092013 -0.40115992505181969 0.40477696304846167
-0.16310183281189838 0.67541606725572378 -0.60674851766146465  -0.85394740027497895 -0.33139575632083074 0.40118660278746782
-0.15494158249918433 0.63155843766247499 -0.6675438583011275  -0.86229745711633776 -0.37608264246842488 0.33912378489965056
-0.61677884992242127 0.77652668866688823 -0.1269941119120791  -0.38585850377001185 -0.25115833516475705 0.88771206240854661
-0.6121850337924204 0.78019791562438101 -0.12795219708842923  -0.40347958770451747 -0.2408461695144006 0.88272155572186706
-0.58998070131491009 0.7308249227963397 -0.15157265925820684  -0.41835586417422205 -0.27447137325094889 0.8658197480866201
-0.60328875784028035 0.19465341853452689 -0.60701517323697041  -0.40477696304846306 -0.82172156155091958 0.40115992505181941
-0.66754385830112761 0.15494158249918422 -0.6315584376624751  -0.33912378489965 -0.86229745711633854 0.37608264246842382
-0.38578733356857997 0.49474798580051771 -0.42740659928482283  -0.62647295099493594 -0.51565247738810516 0.58449479401890869
-0.80387442246342544 0.33342289586318663 -0.30890686439776815  -0.20029565457621235 -0.68040299513329272 0.70493504308661736
-0.73719191275168683 0.32448937007110357 -0.34044158853824891  -0.26836446324215074 -0.68937955050281274 0.67285685715261323
-0.37662182205162742 0.44468510739264255 -0.4867505311193725  -0.63632626043050522 -0.56632219140540241 0.52380155193385169
-0.67817235393879538 0.37219775365464591 -0.3197858383461637  -0.32871571883365086 -0.64057192708348321 0.6939838488208705
-0.68833716584422411 0.42830047444496377 -0.26758896083815364  -0.31837608818572133 -0.58341134180693566 0.74717325482286145
-0.48751950377457764 0.21949717894867493 -0.70237760951254313  -0.52285425410030584 -0.79638679287412917 0.30395970967362079
-0.33342289586318652 0.30890686439776804 -0.80387442246342533  -0.68040299513329283 -0.70493504308661725 0.20029565457621235
-0.34663877975122226 0.28109386699234573 -0.87079826704332097  -0.66711974931205642 -0.73311225719230455 0.13227871496285135
-0.38791883075529854 0.25839317298936149 -0.81085466860836364  -0.62484261256047635 -0.7563698099959264 0.19358827458119621
-0.32266080240935691 0.45887453700173475 -0.54305925471438132  -0.69097715483087263 -0.55222595833073063 0.46647300291392874
-0.27854118464368072 0.52177412017159019 -0.54043805030551129  -0.73602315194220436 -0.48809649929758547 0.4690753960489773
-0.66033202687554549 0.73295414361857025 -0.120390894417848  -0.34672764240956921 -0.27221405186827935 0.8975964861531911
-0.66305236795085609 0.73862883390665335 -0.11792173385748356  -0.33091024020139254 -0.23862737818778135 0.91299254504573157
-0.65013123053773547 0.74924502909339952 -0.12021569384478618  -0.36748531964496783 -0.23977066491305971 0.89859032272364525
-0.3329730441306975 0.86688049898359798 -0.29448299907594322  -0.68041269101920487 -0.13609530337963727 0.72008099426245697
-0.28109386699234573 0.87079826704332097 -0.34663877975122226  -0.73311225719230455 -0.13227871496285276 0.6671197493120562
-0.30890686439776815 0.80387442246342544 -0.33342289586318663  -0.70493504308661736 -0.20029565457621229 0.68040299513329272
-0.37763360430690207 0.89031208027748232 -0.25188956429094089  -0.63913636447117517 -0.10365825365837174 0.76207589783371688
-0.38906581543970098 0.86449179145637545 -0.24581371826786724  -0.62320039727703724 -0.13836216352689484 0.76972539034249077
-0.26758896083815364 0.68833716584422411 -0.42830047444496377  -0.74717325482286145 -0.31837608818572133 0.58341134180693566
-0.28711353530938599 0.74416681593888767 -0.37811394098752249  -0.72726265769102505 -0.26123864468751851 0.63469945426951124
-0.23778877920326758 0.7543766356118875 -0.43510778217590995  -0.77788041909855277 -0.25098113386125442 0.57611676249591892
-0.25144044466552118 0.63593257766966582 -0.48278292360441799  -0.76364675610270605 -0.37176976328896033 0.52785497534633929
-0.23918763497858653 0.58691160345630577 -0.54073697963859202  -0.77616877106981585 -0.42177409750733486 0.46868822204941857
-0.66309584332239968 0.73859273426435279 -0.11791670171500288  -0.31277536903781777 -0.24890531892608236 0.91663390223881769
-0.23131618639376361 0.54069649116233642 -0.60179718550820993  -0.78424095119900905 -0.46877433341208891 0.40646863937642869
-0.83663689274508746 0.50393156097935532 -0.17076625792504019  -0.16746624198175153 -0.5059383111947604 0.84615689033529906
-0.85321734737321941 0.48823773095257161 -0.17791687149582575  -0.14218930946431363 -0.53087421189741091 0.83543687458500693
-0.84527243958550158 0.50534202492392921 -0.16859355460826972  -0.13337026124727985 -0.50082503649440957 0.85521146872291509
-0.18894401454864007 0.56326642977303365 -0.66555721401063139  -0.82760959526572664 -0.44564173451716838 0.34127086350966085
-0.16851360390451708 0.5059938921163909 -0.84582765048432262  -0.84145097432228078 -0.5115273725441013 0.17406896607440508
-0.17116987629986469 0.50112519727619198 -0.84800457692533193  -0.83349120264032472 -0.52781055754245743 0.16342714116053544
-0.49459829134159439 0.19246164044552572 -0.77010674056590323  -0.5156231815186233 -0.82387113061171735 0.23530638500725742
-0.55569157508051703 0.15189213403566626 -0.79094720467070556  -0.4530882925139989 -0.86539097215515881 0.21403145679805585
-0.42424253336914886 0.34172502430316598 -0.55775866770488691  -0.58737470394737501 -0.67165289641182346 0.45152335920120668
-0.3713193261111345 0.39873225090399556 -0.54873765482186954  -0.64149399833800957 -0.61382359089386285 0.46011525660260116
-0.36991837160270158 0.35691197974999433 -0.61291481587751639  -0.64279095563231359 -0.65613064511909636 0.39536358442944075
-0.33677331501517244 0.28707208578415278 -0.89617895883531995  -0.67452766723137503 -0.73279395097326627 0.089584884642385607
-0.34835979735444111 0.27649633775399213 -0.89544715323589474  -0.67452766723137458 -0.73279395097326738 0.089584884642381388
-0.70206746101856976 0.6710461359539861 -0.12625772819138759  -0.30422052318316622 -0.33550256744406737 0.89156486051918815
-0.6315584376624751 0.66754385830112761 -0.15494158249918422  -0.37608264246842482 -0.33912378489965067 0.86229745711633787
-0.20493337999462402 0.6534432341171178 -0.54374625724929748  -0.81121902067950913 -0.35387698305874443 0.46550486715932315
-0.57052582071169811 0.48089420169576869 -0.28832514482274552  -0.43849581670457061 -0.52986930552536926 0.72592006295091105
-0.58691160345630577 0.54073697963859213 -0.23918763497858664  -0.4217740975073348 -0.46868822204941851 0.77616877106981597
-0.52177412017159019 0.54043805030551129 -0.27854118464368072  -0.4880964992975842 -0.46907539604897647 0.73602315194220569
-0.52277287854647114 0.72978602950671356 -0.18781856417458553  -0.48692804957249181 -0.27563277583938878 0.82881098413486431
-0.45886020497699476 0.73008380957164554 -0.22882364378366471  -0.55218785652865776 -0.27542173873706688 0.78691259802683133
-0.49804426762820242 0.6650456856281145 -0.22783029713491565  -0.51223335844459539 -0.34188293456237356 0.787866134283985
-0.30220034825124553 0.62265094488008987 -0.42460158444828167  -0.71231212670919675 -0.3845705542759712 0.58712598556603979
-0.66886984046648634 0.73334447965428895 -0.11737161430462231  -0.30990719304796133 -0.27087574504909673 0.91136373772562973
-0.67480921403038341 0.72790861885278146 -0.11711592517486362  -0.3068782679831476 -0.29270566773562062 0.90562084821138478
-0.7308249227963397 0.15157265925820684 -0.58998070131491009  -0.27447137325094884 -0.86581974808661999 0.41835586417422199
-0.79622199346122757 0.15327245833771197 -0.55063712409498888  0.11143127652206664 -0.5462728554716807 0.83016205525636932
-0.72978602950671356 0.18781856417458553 -0.52277287854647114  -0.27563277583938744 -0.82881098413486465 0.48692804957249192
-0.21949717894867493 0.70237760951254313 -0.48751950377457764  -0.79638679287412906 -0.30395970967362079 0.52285425410030573
-0.16859355460826972 0.84527243958550158 -0.50534202492392921  -0.85521146872291509 -0.13337026124727985 0.50082503649440957
-0.16718041590241167 0.84386234521524095 -0.50828765077834703  -0.86526167125339337 -0.13902973540250266 0.48165648852028864
-0.17076625792504019 0.83663689274508746 -0.50393156097935532  -0.84615689033529906 -0.16746624198175153 0.5059383111947604
-0.31922707014459717 0.41525708906780423 -0.6062691959083808  -0.69455121880115744 -0.5966714298400102 0.40197239864759926
-0.27291559350329064 0.47669360004206351 -0.60263533424272331  -0.74178975530654778 -0.53404105644655731 0.40564529943251781
-0.27152141395867613 0.43543783887197085 -0.66685061023366288  -0.74324570666303824 -0.57610127698437386 0.34013694034011471
-0.14509843055414051 0.55935332483523337 -0.81537692950694307  -0.53077402771795057 -0.83361988814005983 -0.15282936104498543
-0.15327245833771197 0.55063712409498888 -0.79622199346122757  -0.54669933216720379 -0.82946371429884458 -0.11449797757820061
-0.14509843055414046 0.55935332483523337 -0.81537692950694307  -0.54699716260005027 -0.82500541278991668 -0.14198652391981875
-0.42460158444828167 0.30220034825124553 -0.62265094488008987  -0.58712598556603979 -0.71231212670919675 0.3845705542759712
-0.48089420169576869 0.28832514482274552 -0.57052582071169811  -0.52986930552536926 -0.72592006295091105 0.43849581670457061
-0.3197858383461637 0.67817235393879538 -0.37219775365464591  -0.6939838488208705 -0.32871571883365086 0.64057192708348321
-0.12625772819138759 0.70206746101856976 -0.6710461359539861  -0.89156486051918737 -0.30422052318316639 0.33550256744406953
-0.13684746659412272 0.74566822600279203 -0.61182084959332417  -0.88070834559541789 -0.2598848257066434 0.39599581735923622
-0.19079270763906322 0.46535820959984769 -0.86344103623700996  -0.83662429167606578 -0.52971449507546198 0.13950752053014723
-0.19867800845978539 0.45162969623720939 -0.86929523101799799  -0.83034168959693988 -0.54729298896538514 0.10489548487248543
-0.20106900651413739 0.4491139872592852 -0.86349407113854104  -0.8154158644589895 -0.56187930322158219 0.13924301275047238
-0.55775866770488669 0.42424253336914874 -0.34172502430316587  -0.45152335920120668 -0.5873747039473749 0.67165289641182357
-0.50638270952520359 0.48220601248944894 -0.33020050982234728  -0.5033061399972405 -0.5284187976067114 0.68370790823052174
-0.49474798580051771 0.42740659928482294 -0.38578733356857997  -0.51565247738810616 -0.58449479401890925 0.62647295099493439
-0.35691197974999433 0.61291481587751639 -0.36991837160270158  -0.65613064511909636 -0.39536358442944081 0.64279095563231359
-0.87604956907685072 0.40074783475520082 -0.23453730781743154  -0.12697533232365851 -0.61194488891504917 0.7806412222731034
-0.82089742115417219 0.4448828382530976 -0.21249304575461847  -0.1809544666175604 -0.52197712123390316 0.83354385962558752
-0.48823773095257161 0.17791687149582575 -0.85321734737321941  -0.53087421189740946 -0.83543687458500782 0.14218930946431385
-0.50534202492392921 0.16859355460826975 -0.84527243958550158  -0.50082503649441779 -0.85521146872291109 0.1333702612472748
-0.50393156097935532 0.17076625792504019 -0.83663689274508746  -0.50593831119475963 -0.84615689033529973 0.16746624198175047
-0.22783029713491565 0.49804426762820242 -0.6650456856281145  -0.78786613428398511 -0.51223335844459539 0.34188293456237351
-0.4867505311193725 0.37662182205162742 -0.44468510739264255  -0.52380155193385225 -0.63632626043050455 0.56632219140540263
-0.48220601248944894 0.33020050982234728 -0.50638270952520359  -0.52841879760671218 -0.6837079082305223 0.50330613999723894
-0.54305925471438132 0.3226608024093568 -0.45887453700173464  -0.46647300291392874 -0.69097715483087263 0.55222595833073085
-0.39873225090399556 0.54873765482186954 -0.3713193261111345  -0.61382359089386385 -0.46011525660260016 0.64149399833800924
-0.25839317298936149 0.81085466860836364 -0.38791883075529854  -0.75636980999592562 -0.19358827458119576 0.62484261256047735
-0.18781856417458553 0.52277287854647114 -0.72978602950671356  -0.82881098413486431 -0.48692804957249181 0.27563277583938878
-0.81537692950694307 0.14509843055414046 -0.55935332483523337  0.13893839354958223 -0.54662188402952105 0.82577275245546711
-0.81537692950694307 0.14509843055414051 -0.55935332483523337  0.14982263298494042 -0.53042608529865665 0.83438680878846727
-0.54073697963859202 0.23918763497858653 -0.58691160345630577  -0.46868822204941857 -0.77616877106981585 0.42177409750733486
-0.48278292360441799 0.25144044466552118 -0.63593257766966582  -0.52785497534633929 -0.76364675610270605 0.37176976328896033
-0.41525708906780423 0.6062691959083808 -0.31922707014459717  -0.59667142984001054 -0.40197239864759837 0.69455121880115778
-0.6728298875984875 0.11747817726746855 -0.72952718400936922  -0.33340690397516509 -0.904068372598963 0.26739523938910698
-0.6710461359539861 0.12625772819138759 -0.70206746101856976  -0.3355025674440677 -0.89156486051918793 0.30422052318316667
-0.61182084959332406 0.1368474665941225 -0.74566822600279192  -0.3959958173592375 -0.88070834559541711 0.25988482570664406
-0.45887453700173464 0.54305925471438132 -0.3226608024093568  -0.55222595833073085 -0.46647300291392874 0.69097715483087263
-0.63593257766966582 0.48278292360441799 -0.25144044466552118  -0.37176976328896066 -0.52785497534633841 0.76364675610270649
-0.62265094488008987 0.42460158444828167 -0.30220034825124553  -0.3845705542759712 -0.58712598556603979 0.71231212670919675
-0.86688049898359798 0.29448299907594322 -0.3329730441306975  -0.13609530337963627 -0.72008099426245742 0.68041269101920454
-0.89636075196488652 0.33255046319168835 -0.29093694366030731  -0.10033016823458282 -0.68572398718656735 0.72091363611668269
-0.87079826704332097 0.34663877975122226 -0.28109386699234573  -0.13227871496285351 -0.6671197493120562 0.73311225719230444
-0.37219775365464591 0.3197858383461637 -0.67817235393879538  -0.64057192708348321 -0.6939838488208705 0.32871571883365086
-0.31986574707487569 0.37569356384004582 -0.67127690715856303  -0.69398814937561693 -0.63692575831934406 0.33571718293160824
-0.32448937007110357 0.34044158853824891 -0.73719191275168683  -0.68937955050281241 -0.67285685715261301 0.26836446324215207
-0.54069649116233642 0.60179718550820993 -0.23131618639376361  -0.46877433341208941 -0.40646863937643002 0.78424095119900816
-0.60701517323697041 0.60328875784028035 -0.19465341853452689  -0.40115992505181969 -0.40477696304846172 0.82172156155092013
-0.23850243715387073 0.88643041244943777 -0.39433212071905294  -0.76918721291849945 -0.09659658711841787 0.63168040245027779
-0.23453730781743154 0.87604956907685072 -0.40074783475520082  -0.78064122227310317 -0.12697533232365765 0.61194488891504961
-0.44468510739264255 0.4867505311193725 -0.37662182205162742  -0.56632219140540263 -0.52380155193385225 0.63632626043050455
-0.42740659928482294 0.38578733356857997 -0.49474798580051771  -0.58449479401890869 -0.62647295099493583 0.51565247738810516
-0.120390894417848 0.66033202687554549 -0.73295414361857025  -0.89759648615319021 -0.34672764240956944 0.27221405186828185
-0.11792173385748358 0.66305236795085598 -0.73862883390665335  -0.91299254504582916 -0.33091024020093185 0.23862737818804663
-0.12021569384478618 0.65013123053773569 -0.74924502909339907  -0.89859032272364481 -0.36748531964496806 0.23977066491306137
-0.28707208578415266 0.89617895883531973 -0.33677331501517238  -0.73279395097326361 -0.089584884642392407 0.67452766723137714
-0.27649633775399207 0.89544715323589452 -0.34835979735444111  -0.73279395097327316 -0.089584884642385398 0.67452766723136759
-0.43419673619416665 0.43419673619416677 -0.43419673619416677  -0.5770272532621572 -0.57739733617063249 0.57762605998672512
-0.6534432341171178 0.54374625724929748 -0.20493337999462402  -0.35387698305874393 -0.46550486715932382 0.81121902067950891
-0.67541606725572378 0.60674851766146465 -0.16310183281189838  -0.33139575632083113 -0.40118660278746965 0.85394740027497795
-0.27455903153809769 0.39781956250172623 -0.73257875557195395  -0.74028370995146897 -0.61436698850995353 0.27300775118977894
-0.28216458491718832 0.36370573544997109 -0.79939609736192763  -0.73258235910830072 -0.64913355914122617 0.20481384113375034
-0.73257875557195395 0.27455903153809769 -0.39781956250172623  -0.27300775118977899 -0.74028370995146897 0.61436698850995353
-0.79939609736192763 0.28216458491718832 -0.36370573544997109  -0.20481384113375128 -0.73258235910829894 0.64913355914122761
-0.35258069914739359 0.2726767817340372 -0.89490947890189543  -0.67452766723136126 -0.7327939509732786 0.089584884642390131
-0.73008380957164554 0.22882364378366471 -0.45886020497699476  -0.27542173873706688 -0.78691259802683133 0.55218785652865776
-0.6650456856281145 0.22783029713491565 -0.49804426762820242  -0.34188293456237412 -0.78786613428398422 0.51223335844459639
-0.40074783475520082 0.23453730781743154 -0.87604956907685072  -0.61194488891504906 -0.7806412222731034 0.1269753323236586
-0.40287199693957931 0.2319235147307509 -0.88441250744737021  -0.6038022951196057 -0.79156802282425653 0.094036448520741681
-0.41967269015334829 0.22029239714976911 -0.87940686251849942  -0.58292813064721194 -0.80326578355000455 0.12230648174951403
-0.73295414361857025 0.120390894417848 -0.66033202687554549  -0.27221405186828029 -0.8975964861531911 0.34672764240956827
-0.73862883390665335 0.1179217338574836 -0.66305236795085609  -0.23862737818795468 -0.91299254504579996 0.33091024020107906
-0.74924502909339918 0.12021569384478618 -0.65013123053773569  -0.23977066491305848 -0.89859032272364658 0.36748531964496522
-0.35285937995032879 0.27242640822753861 -0.8948591833539592  -0.65866036402229156 -0.74597391594558315 0.098434961242611502
-0.19246164044552572 0.77010674056590323 -0.49459829134159439  -0.82387113061171724 -0.2353063850072574 0.51562318151862319
-0.67127690715856303 0.31986574707487569 -0.37569356384004582  -0.33571718293160824 -0.69398814937561693 0.63692575831934406
-0.51431240435194236 0.16435054388889231 -0.84060202208152668  -0.47538384129543065 -0.86578380003691946 0.15629656115485166
-0.15157265925820684 0.58998070131491009 -0.7308249227963397  -0.86581974808661999 -0.41835586417422205 0.27447137325094906
-0.79587834752179276 0.19177788682311969 -0.48472204902454452  -0.20813967421463714 -0.82482450355065007 0.52568280774650467
-0.86349407113854104 0.20106900651413739 -0.4491139872592852  -0.13924301275047235 -0.8154158644589895 0.5618793032215823
-0.79683385603280099 0.23484719550275512 -0.42236282692723071  -0.20735457304096572 -0.78085960551688738 0.58928970592655849
-0.21249304575461847 0.82089742115417219 -0.4448828382530976  -0.83354385962558752 -0.1809544666175604 0.52197712123390316
-0.29093694366030726 0.89636075196488629 -0.33255046319168846  -0.7209136361166818 -0.10033016823458347 0.68572398718656813
-0.17578736338136591 0.72160204626986268 -0.54881477307315141  -0.84103034646625352 -0.28440717777405633 0.46019616855581241
-0.20277464391867589 0.44528180619467961 -0.8715294843120418  -0.80855713981694077 -0.57905836064065186 0.10453117536509755
-0.20721724721609527 0.43892089049513849 -0.87369562034679449  -0.79565076497466114 -0.59478368364253864 0.11477033531295963
-0.16435054388889223 0.84060202208152668 -0.51431240435194248  -0.86578380003691913 -0.15629656115484611 0.47538384129543321
-0.24581371826786724 0.38906581543970098 -0.86449179145637545  -0.76972539034249055 -0.62320039727703713 0.13836216352689598
-0.2362278827902799 0.39778573137580309 -0.88575611557358469  -0.78585236795602897 -0.60955597917048376 0.10429556095738096
-0.23886152721069628 0.39436998908781284 -0.88670186362811831  -0.77572080867111382 -0.62406985332091136 0.093776570478180804
-0.25148743609350815 0.37814612485058707 -0.89022773714167358  -0.77572080867109028 -0.62406985332093745 0.093776570478203869
-0.61291481587751639 0.36991837160270158 -0.35691197974999433  -0.3953635844294407 -0.64279095563231359 0.65613064511909625
-0.54873765482186954 0.3713193261111345 -0.39873225090399556  -0.46011525660260155 -0.64149399833800969 0.61382359089386229
-0.6062691959083808 0.31922707014459717 -0.41525708906780423  -0.40197239864759837 -0.69455121880115778 0.59667142984001043
-0.32062283970672506 0.89703653361847402 -0.30224127238435727  -0.69503929178688939 -0.101531839029395 0.71176658290178818
-0.34044158853824891 0.73719191275168683 -0.32448937007110357  -0.67285685715261323 -0.26836446324215074 0.68937955050281274
-0.2726767817340372 0.89490947890189521 -0.35258069914739365  -0.73279395097325861 -0.089584884642376197 0.6745276672313848
-0.27242640822753872 0.89485918335395898 -0.35285937995032868  -0.7459739159455594 -0.098434961242595487 0.65866036402232075
-0.54043805030551129 0.27854118464368072 -0.52177412017159019  -0.46907539604897691 -0.73602315194220502 0.48809649929758486
-0.60973189193295318 0.78195841301613345 -0.12866675979645326  -0.4209224351297528 -0.23042761042597518 0.87734110809753696
-0.37569356384004582 0.67127690715856303 -0.31986574707487569  -0.63692575831934406 -0.33571718293160824 0.69398814937561693
-0.39781956250172623 0.73257875557195395 -0.27455903153809769  -0.61436698850995353 -0.27300775118977888 0.74028370995146897
-0.81620158702216783 0.55878764062032715 -0.14515574388933145  -0.17844712110942465 -0.44918580997771146 0.87543631012337242
-0.79094720467070556 0.55569157508051703 -0.15189213403566626  -0.2140314567980578 -0.45308829251400029 0.8653909721551577
-0.84060202208152668 0.51431240435194236 -0.16435054388889228  -0.15629656115484672 -0.47538384129543421 0.86578380003691835
-0.43543783887197085 0.66685061023366288 -0.27152141395867613  -0.57610127698437397 -0.34013694034011477 0.74324570666303824
-0.20758482553277546 0.87360645106449408 -0.43871922724759471  -0.8027893542373844 -0.14246063051294294 0.57899414632358603
-0.22029239714976942 0.87940686251849931 -0.41967269015334785  -0.803265783550004 -0.12230648174951353 0.58292813064721294
-0.42830047444496377 0.26758896083815364 -0.68833716584422411  -0.58341134180693566 -0.74717325482286145 0.31837608818572133
-0.12699411191207913 0.6167788499224216 -0.77652668866688779  -0.88771206240854672 -0.38585850377001235 0.25115833516475594
-0.47669360004206351 0.60263533424272331 -0.27291559350329064  -0.53404105644655731 -0.40564529943251787 0.74178975530654778
-0.8844125074473701 0.40287199693957926 -0.23192351473075096  -0.094036448520741611 -0.60380229511960581 0.79156802282425642
-0.87940686251849942 0.41967269015334852 -0.22029239714976895  -0.12230648174951401 -0.58292813064721205 0.80326578355000455
-0.19760570896389246 0.86841627964248769 -0.4538325469504022  -0.84318764111161182 -0.16797909143371911 0.51070307098913947
-0.56326642977303365 0.66555721401063139 -0.18894401454864007  -0.4456417345171686 -0.34127086350965996 0.82760959526572697
-0.43510778217590995 0.23778877920326758 -0.7543766356118875  -0.57611676249591881 -0.77788041909855277 0.25098113386125442
-0.37811394098752249 0.28711353530938599 -0.74416681593888767  -0.63469945426951124 -0.72726265769102505 0.26123864468751851
-0.60179718550820993 0.23131618639376361 -0.54069649116233642  -0.40646863937642913 -0.7842409511990085 0.46877433341208957
-0.66555721401063139 0.18894401454863996 -0.56326642977303343  -0.34127086350965985 -0.82760959526572708 0.44564173451716876
-0.36370573544997098 0.79939609736192763 -0.28216458491718843  -0.64913355914122772 -0.20481384113375128 0.73258235910829894
-0.15704160896220443 0.53091371423475153 -0.83176958998158268  -0.8610861145698091 -0.47782642632713501 0.17381774822643589
-0.66685061023366288 0.27152141395867613 -0.43543783887197085  -0.34013694034011471 -0.74324570666303824 0.57610127698437386
-0.60263533424272331 0.27291559350329064 -0.47669360004206351  -0.40564529943251781 -0.74178975530654778 0.53404105644655731
-0.88643041244943765 0.39433212071905299 -0.23850243715387068  -0.096596587118422908 -0.63168040245028201 0.76918721291849534
-0.50828765077834692 0.16718041590241167 -0.84386234521524095  -0.48165648852029513 -0.86526167125338949 0.13902973540250427
-0.75801153469018845 0.63940401305021388 -0.12231492616193564  -0.24555619785558183 -0.36356562872995896 0.89862238304022901
-0.72952718400936911 0.6728298875984875 -0.11747817726746862  -0.2673952393891102 -0.33340690397513861 0.90406837259897177
-0.74566822600279192 0.61182084959332406 -0.1368474665941225  -0.25988482570664434 -0.39599581735923761 0.88070834559541689
-0.16732110273651729 0.50853350830307131 -0.84450245370595112  -0.84903903628469479 -0.49501822108781263 0.18463389628075974
-0.86841627964248769 0.4538325469504022 -0.19760570896389246  -0.16797909143371911 -0.51070307098913936 0.84318764111161182
-0.86841627964248769 0.45383254695040243 -0.19760570896389235  -0.17482109513942065 -0.49121775846011029 0.85331277880251999
-0.13547524888319312 0.58737517793522209 -0.79687448636012359  -0.881833875344882 -0.42350808342754243 0.20738833035095494
-0.25188956429094089 0.37763360430690207 -0.89031208027748232  -0.76207589783371688 -0.63913636447117517 0.10365825365837174
-0.12666505292171068 0.77481094206321921 -0.6186418487627664  -0.89982453013548147 -0.22723563663235147 0.37239734211021147
-0.12428439751345347 0.76628597990831748 -0.62959613569072714  -0.89982453013547969 -0.22723563663235363 0.37239734211021469
-0.29448299907594322 0.3329730441306975 -0.86688049898359798  -0.7200809942624572 -0.68041269101920487 0.13609530337963555
-0.12866675979645353 0.60973189193295285 -0.78195841301613322  -0.87734110809753718 -0.42092243512975314 0.23042761042597412
-0.39433212071905299 0.23850243715387071 -0.88643041244943765  -0.63168040245028312 -0.76918721291849435 0.0965965871184227
-0.40011344807791571 0.23403574987719886 -0.885181213940885  -0.62068622392278294 -0.7793365693277472 0.085925101925656416
-0.83176958998158268 0.15704160896220443 -0.53091371423475153  -0.17381774822643611 -0.8610861145698091 0.4778264263271349
-0.4448828382530976 0.21249304575461847 -0.82089742115417219  -0.52197712123390316 -0.83354385962558752 0.1809544666175604
-0.43871922724759471 0.20758482553277546 -0.87360645106449408  -0.57899414632358659 -0.80278935423738396 0.14246063051294297
-0.4538325469504022 0.19760570896389246 -0.86841627964248769  -0.51070307098913947 -0.84318764111161171 0.16797909143371909
-0.58737517793522231 0.79687448636012359 -0.13547524888319296  -0.42350808342754392 -0.20738833035095489 0.88183387534488133
-0.55935332483523337 0.81537692950694307 -0.14509843055414046  -0.82500541278991701 0.14198652391981914 0.54699716260004971
-0.55063712409498888 0.79622199346122757 -0.15327245833771197  -0.82946371429884502 0.1144979775782002 0.54669933216720323
-0.45383254695040243 0.19760570896389235 -0.86841627964248769  -0.49121775846011029 -0.85331277880251999 0.17482109513942065
-0.46917118018407 0.18876448359422154 -0.86197484006657277  -0.54178151488020343 -0.825788025280218 0.15667459091349173
-0.48472204902454452 0.79587834752179276 -0.19177788682311969  -0.52568280774650467 -0.20813967421463714 0.82482450355065007
-0.50112519727619176 0.84800457692533193 -0.17116987629986491  -0.52781055754245576 -0.16342714116053514 0.83349120264032583
-0.46535820959984747 0.86344103623700996 -0.19079270763906347  -0.52971449507546009 -0.13950752053014592 0.83662429167606722
-0.58078956308164631 0.13751674259163305 -0.80154185314360293  -0.42149610172113045 -0.88421545010983982 0.20125623970685685
-0.15189213403566626 0.79094720467070556 -0.55569157508051703  -0.86539097215515981 -0.21403145679805635 0.4530882925139969
-0.14515574388933142 0.81620158702216794 -0.55878764062032715  -0.87543631012338807 -0.17844712110943328 0.4491858099776776
-0.1450399309579464 0.81602556690527261 -0.5591014619201069  -0.88441806965926173 -0.18329374350457811 0.4291946896832059
-0.80470051208864024 0.57626699783602664 -0.13905684970997817  -0.18329374350459335 -0.42919468968314395 0.8844180696592886
-0.80154185314360282 0.5807895630816462 -0.1375167425916331  -0.20125623970685494 -0.42149610172113033 0.88421545010984026
-0.42236282692723071 0.79683385603280099 -0.23484719550275512  -0.5892897059265586 -0.20735457304096577 0.78085960551688727
-0.4491139872592852 0.86349407113854104 -0.20106900651413739  -0.56187930322157775 -0.13924301275046694 0.8154158644589935
-0.61450990334845845 0.12763021215051265 -0.77776053021058522  -0.39311654818377234 -0.89197584375895622 0.22324532177533774
-0.61864184876276629 0.12666505292171057 -0.77481094206321943  -0.37239734211020448 -0.89982453013548525 0.2272356366323483
-0.62959613569072737 0.12428439751345335 -0.76628597990831759  -0.37239734211021208 -0.89982453013548303 0.22723563663234447
-0.50853350830307154 0.8445024537059509 -0.16732110273651735  -0.49501822108781024 -0.18463389628075921 0.84903903628469624
-0.53091371423475153 0.83176958998158268 -0.15704160896220448  -0.47782642632713568 -0.17381774822643495 0.86108611456980888
-0.6394040130502141 0.12231492616193554 -0.75801153469018856  -0.36356562872995879 -0.89862238304022923 0.24555619785558092
-0.77652668866688834 0.1269941119120791 -0.61677884992242116  -0.25115833516475583 -0.88771206240854605 0.38585850377001396
-0.78019791562438101 0.1279521970884292 -0.61218503379242051  -0.24084616951440058 -0.88272155572186739 0.40347958770451692
-0.78195841301613345 0.12866675979645331 -0.60973189193295307  -0.23042761042597665 -0.87734110809753796 0.42092243512974992
-0.79687448636012359 0.13547524888319296 -0.58737517793522231  -0.20738833035095483 -0.88183387534488133 0.42350808342754387
-0.19760570896389235 0.86841627964248769 -0.45383254695040243  -0.85331277880251999 -0.17482109513942065 0.49121775846011018
-0.18876448359422154 0.86197484006657277 -0.46917118018407  -0.825788025280218 -0.15667459091349173 0.54178151488020343
-0.84450245370595112 0.16732110273651729 -0.50853350830307131  -0.18463389628075999 -0.8490390362846949 0.49501822108781218
-0.77010674056590323 0.49459829134159439 -0.19246164044552572  -0.23530638500725776 -0.51562318151862208 0.82387113061171802
-0.84582765048432274 0.16851360390451706 -0.5059938921163909  -0.17406896607440442 -0.84145097432228033 0.51152737254410252
-0.84800457692533204 0.17116987629986469 -0.50112519727619198  -0.16342714116053442 -0.83349120264032406 0.52781055754245876
-0.86344103623700996 0.19079270763906322 -0.46535820959984769  -0.13950752053014712 -0.836624291676066 0.52971449507546176
-0.86449179145637545 0.24581371826786724 -0.38906581543970098  -0.13836216352689487 -0.76972539034249077 0.62320039727703724
-0.87369562034679449 0.20721724721609527 -0.43892089049513849  -0.11477033531295816 -0.79565076497466225 0.5947836836425372
-0.88575611557358458 0.23622788279027992 -0.39778573137580303  -0.10429556095738191 -0.78585236795602875 0.60955597917048376
-0.88670186362811831 0.23886152721069626 -0.39436998908781284  -0.09377657047818147 -0.77572080867111348 0.62406985332091203
-0.89022773714167358 0.25148743609350815 -0.37814612485058707  -0.093776570478204146 -0.77572080867108983 0.6240698533209379
-0.89031208027748232 0.25188956429094089 -0.37763360430690207  -0.10365825365837178 -0.76207589783371699 0.63913636447117517
-0.89514882917194938 0.28037391497176023 -0.34420772975862846  -0.10275236361910091 -0.73743092048487979 0.66756092552179158
-0.89633045717514337 0.28913527415696405 -0.33470078178039075  -0.091975091050971292 -0.72651404777911366 0.6809683700479584
-0.89701448999197952 0.29870880673944478 -0.32439454701627179  -0.091975091050972055 -0.72651404777911421 0.68096837004795774
-0.8970365336184738 0.30224127238435722 -0.32062283970672523  -0.10153183902939227 -0.71176658290178985 0.69503929178688817
-0.55935332483523337 0.81537692950694307 -0.14509843055414051  -0.83361988814006005 0.15282936104498576 0.53077402771794979
-0.89617895883531973 0.33677331501517238 -0.28707208578415266  -0.089584884642391838 -0.67452766723137614 0.73279395097326461
-0.89544715323589452 0.34835979735444111 -0.27649633775399207  -0.089584884642385412 -0.6745276672313677 0.73279395097327316
-0.89490947890189521 0.35258069914739365 -0.2726767817340372  -0.089584884642376003 -0.67452766723138569 0.73279395097325783
-0.89485918335395898 0.35285937995032868 -0.27242640822753872  -0.09843496124259532 -0.65866036402232175 0.74597391594555851
-0.5059938921163909 0.84582765048432262 -0.1685136039045172  -0.51152737254409653 -0.17406896607440647 0.84145097432228355
-0.885181213940885 0.40011344807791571 -0.23403574987719886  -0.085925101925656389 -0.62068622392278194 0.77933656932774809
-0.70237760951254313 0.48751950377457764 -0.21949717894867493  -0.30395970967362079 -0.52285425410030573 0.79638679287412917
-0.13751674259163299 0.80154185314360293 -0.58078956308164642  -0.88421545010983915 -0.2012562397068613 0.42149610172112967
-0.84386234521524095 0.50828765077834703 -0.16718041590241167  -0.13902973540250244 -0.48165648852028886 0.86526167125339315
-0.33255046319168835 0.29093694366030742 -0.89636075196488663  -0.68572398718656402 -0.72091363611668646 0.10033016823457788
-0.72160204626986268 0.54881477307315141 -0.17578736338136614  -0.28440717777405633 -0.46019616855581241 0.84103034646625363
-0.77776053021058522 0.61450990334845845 -0.12763021215051262  -0.22324532177533885 -0.39311654818377018 0.89197584375895678
-0.77481094206321943 0.61864184876276629 -0.12666505292171057  -0.22723563663234897 -0.3723973421102027 0.8998245301354858
-0.7662859799083177 0.62959613569072725 -0.12428439751345335  -0.22723563663234433 -0.37239734211021291 0.8998245301354828
-0.30224127238435727 0.32062283970672523 -0.8970365336184738  -0.71176658290178729 -0.69503929178689061 0.10153183902939264
-0.12795219708842931 0.6121850337924204 -0.7801979156243809  -0.88272155572186706 -0.40347958770451797 0.24084616951439944
-0.45162969623720939 0.86929523101799799 -0.19867800845978542  -0.54729298896538436 -0.104895484872483 0.83034168959694077
-0.45158454031321349 0.86931390852880774 -0.19870683045973392  -0.56303267966672976 -0.094237795024242899 0.82104411551162748
-0.44528180619467961 0.87152948431204191 -0.20277464391867595  -0.57905836064064919 -0.10453117536508859 0.80855713981694399
-0.43892089049513849 0.87369562034679449 -0.20721724721609527  -0.59478368364253509 -0.11477033531295144 0.79565076497466491
-0.32439454701627168 0.89701448999197964 -0.29870880673944478  -0.68096837004795685 -0.091975091050973928 0.72651404777911499
-0.86929523101799799 0.19867800845978539 -0.45162969623720939  -0.10489548487238186 -0.83034168959685195 0.54729298896553857
-0.86931390852880774 0.19870683045973392 -0.45158454031321349  -0.094237795024141494 -0.82104411551153711 0.56303267966687842
-0.34420772975862846 0.89514882917194938 -0.28037391497176023  -0.66756092552179158 -0.10275236361910092 0.73743092048487979
-0.33470078178039075 0.89633045717514337 -0.28913527415696405  -0.68096837004795674 -0.09197509105097168 0.72651404777911532
-0.23403574987719894 0.88518121394088489 -0.40011344807791577  -0.77933656932774575 -0.085925101925646716 0.62068622392278616
-0.2319235147307509 0.88441250744737032 -0.40287199693957931  -0.79156802282425009 -0.094036448520736088 0.60380229511961492
-0.17791687149582575 0.85321734737321941 -0.48823773095257161  -0.83543687458500693 -0.14218930946431363 0.53087421189741091
-0.14336877717919261 0.81316979596130778 -0.5637647152038272  -0.88441806965928904 -0.18329374350459332 0.42919468968314289
-0.13905684970997817 0.80470051208864013 -0.57626699783602664  -0.88441806965928849 -0.1832937435045966 0.42919468968314278
-0.12763021215051282 0.777760530210585 -0.61450990334845845  -0.89197584375895411 -0.22324532177534218 0.39311654818377439
-0.12231492616193582 0.75801153469018856 -0.63940401305021388  -0.89862238304022746 -0.24555619785558835 0.36356562872995812
-0.11747817726746856 0.72952718400936922 -0.6728298875984875  -0.904068372598959 -0.26739523938910431 0.33340690397517753
-0.1174351724559944 0.72909950732245954 -0.67332661830731499  -0.91062768981370645 -0.27087905317336791 0.31206048948313186
-0.11642208455468789 0.71492061152483621 -0.68859068384710342  -0.91062768981370579 -0.27087905317337013 0.31206048948313181
-0.11629154482667345 0.71178314065071913 -0.69169504426227524  -0.90831680955776484 -0.28893990864387104 0.30244718988225799
-0.86197484006657277 0.46917118018407 -0.18876448359422154  -0.15667459091349173 -0.54178151488020343 0.825788025280218
-0.11711592517486366 0.6748092140303833 -0.72790861885278146  -0.90562084821138367 -0.30687826798314888 0.29270566773562279
-0.11791670171500293 0.66309584332239968 -0.73859273426435279  -0.91663390223890606 -0.31277536903735376 0.2489053189263396
-0.11737161430462231 0.66886984046648634 -0.73334447965428895  -0.91136373772563073 -0.30990719304796188 0.27087574504909262
-0.37814612485058707 0.89022773714167358 -0.25148743609350815  -0.62406985332093812 -0.093776570478204258 0.77572080867108961
-0.39436998908781284 0.8867018636281182 -0.23886152721069626  -0.62406985332090925 -0.093776570478183191 0.77572080867111537
-0.39778573137580309 0.88575611557358469 -0.2362278827902799  -0.6095559791704811 -0.10429556095738292 0.78585236795603086
-0.7385927342643529 0.11791670171500293 -0.66309584332239968  -0.24890531892624906 -0.91663390223887919 0.31277536903750436
-0.87360645106449408 0.43871922724759471 -0.20758482553277546  -0.14246063051294294 -0.57899414632358637 0.80278935423738407
-0.57626699783602664 0.13905684970997817 -0.80470051208864024  -0.42919468968314289 -0.88441806965928871 0.18329374350459482
-0.71178314065071913 0.69169504426227513 -0.11629154482667345  -0.28893990864387398 -0.30244718988225777 0.90831680955776406
-0.7149206115248361 0.68859068384710331 -0.1164220845546879  -0.27087905317337091 -0.3120604894831337 0.9106276898137049
-0.72909950732245954 0.67332661830731499 -0.11743517245599447  -0.27087905317337202 -0.312060489483097 0.91062768981371711
-0.81316979596130778 0.5637647152038272 -0.14336877717919261  -0.18329374350459457 -0.42919468968314056 0.88441806965928993
-0.81602556690527261 0.5591014619201069 -0.14503993095794637  -0.18329374350457062 -0.42919468968323837 0.88441806965924741
-0.87152948431204191 0.20277464391867592 -0.44528180619467961  -0.10453117536509179 -0.80855713981694322 0.57905836064064964
-0.73334447965428895 0.11737161430462233 -0.66886984046648634  -0.27087574504909184 -0.9113637377256314 0.30990719304796072
-0.72790861885278146 0.11711592517486366 -0.67480921403038341  -0.29270566773562112 -0.90562084821138544 0.30687826798314533
-0.69169504426227513 0.11629154482667348 -0.71178314065071902  -0.30244718988226188 -0.90831680955776473 0.28893990864386698
-0.68859068384710331 0.11642208455468794 -0.71492061152483621  -0.31206048948313503 -0.91062768981370623 0.27087905317336491
-0.67332661830731499 0.1174351724559944 -0.72909950732245954  -0.31206048948312065 -0.91062768981370967 0.27087905317336997
-0.5637647152038272 0.14336877717919261 -0.81316979596130778  -0.42919468968314056 -0.88441806965928993 0.18329374350459457
-0.5591014619201069 0.14503993095794637 -0.81602556690527261  -0.42919468968323438 -0.88441806965924918 0.18329374350457187
-0.55878764062032715 0.14515574388933142 -0.81620158702216794  -0.4491858099777078 -0.87543631012337408 0.17844712110942595
-0.29870880673944478 0.32439454701627179 -0.89701448999197964  -0.72651404777911199 -0.68096837004796007 0.091975091050972749
-0.28913527415696405 0.33470078178039075 -0.89633045717514337  -0.72651404777911444 -0.68096837004795763 0.091975091050971486
-0.28037391497176029 0.34420772975862846 -0.89514882917194938  -0.73743092048488068 -0.66756092552179092 0.1027523636191002
-0.19870683045973389 0.45158454031321349 -0.86931390852880774  -0.82104411551162859 -0.56303267966672721 0.094237795024247395
-3  0 1 2
-3  3 4 5
-3  6 7 8
-3  9 10 11
-3  12 13 14
-3  15 16 17
-3  18 10 19
-3  8 7 20
-3  21 1 22
-3  20 7 23
-3  24 1 25
-3  11 26 9
-3  27 28 29
-3  30 7 31
-3  32 33 34
-3  35 36 37
-3  38 35 39
-3  23 7 30
-3  40 41 42
-3  43 44 6
-3  33 32 45
-3  31 44 46
-3  47 48 49
-3  12 50 46
-3  51 52 5
-3  31 7 6
-3  53 54 9
-3  6 44 31
-3  46 44 12
-3  55 56 57
-3  28 58 59
-3  60 32 61
-3  12 44 62
-3  62 44 43
-3  63 64 65
-3  66 67 68
-3  6 69 43
-3  70 32 71
-3  43 69 40
-3  72 73 74
-3  42 75 40
-3  76 77 78
-3  79 80 81
-3  82 83 84
-3  55 85 86
-3  40 69 87
-3  88 13 89
-3  90 91 92
-3  93 94 95
-3  87 69 96
-3  97 98 2
-3  96 69 8
-3  99 100 101
-3  102 80 46
-3  8 69 6
-3  103 104 105
-3  8 106 96
-3  42 41 107
-3  102 50 108
-3  73 109 110
-3  11 111 112
-3  96 106 113
-3  114 115 116
-3  113 106 117
-3  118 119 25
-3  120 121 122
-3  116 10 9
-3  123 124 125
-3  46 80 31
-3  126 64 127
-3  36 128 129
-3  117 106 130
-3  131 104 103
-3  46 50 102
-3  132 133 134
-3  130 106 20
-3  21 122 2
-3  36 135 136
-3  20 106 8
-3  14 13 88
-3  103 137 131
-3  138 139 127
-3  140 141 125
-3  20 137 130
-3  130 137 95
-3  95 137 103
-3  81 80 102
-3  23 137 20
-3  142 143 22
-3  131 137 23
-3  28 59 144
-3  23 56 131
-3  74 145 146
-3  147 148 149
-3  131 56 55
-3  150 151 152
-3  57 56 79
-3  28 144 153
-3  79 56 30
-3  154 75 42
-3  24 155 22
-3  30 56 23
-3  101 156 54
-3  93 119 63
-3  112 26 11
-3  157 50 14
-3  158 159 160
-3  30 80 79
-3  107 161 42
-3  31 80 30
-3  162 36 35
-3  163 75 154
-3  164 165 92
-3  108 50 157
-3  78 77 166
-3  14 50 12
-3  89 13 163
-3  127 139 61
-3  163 13 62
-3  62 13 12
-3  167 168 169
-3  62 75 163
-3  167 169 170
-3  171 172 173
-3  40 75 43
-3  43 75 62
-3  174 162 35
-3  107 41 37
-3  37 41 175
-3  36 176 177
-3  178 104 86
-3  175 41 87
-3  71 32 60
-3  87 41 40
-3  16 179 17
-3  11 10 18
-3  87 180 175
-3  93 172 171
-3  175 180 181
-3  182 183 184
-3  181 180 185
-3  186 161 187
-3  188 26 112
-3  185 180 113
-3  113 180 96
-3  160 145 158
-3  112 111 86
-3  189 157 134
-3  96 180 87
-3  113 190 185
-3  126 190 65
-3  185 190 68
-3  191 192 97
-3  68 190 126
-3  65 190 117
-3  193 161 186
-3  86 85 112
-3  117 190 113
-3  126 194 68
-3  117 94 65
-3  65 94 63
-3  66 194 17
-3  195 196 29
-3  63 94 93
-3  61 194 127
-3  27 196 125
-3  95 94 130
-3  115 150 19
-3  130 94 117
-3  61 32 17
-3  95 172 93
-3  173 172 105
-3  108 4 102
-3  105 172 103
-3  103 172 95
-3  105 104 178
-3  197 198 146
-3  86 104 55
-3  37 199 35
-3  175 199 37
-3  200 5 83
-3  55 104 131
-3  112 85 188
-3  188 85 123
-3  123 85 57
-3  201 202 146
-3  57 85 55
-3  57 124 123
-3  125 124 140
-3  140 124 81
-3  142 155 201
-3  81 124 79
-3  108 83 5
-3  79 124 57
-3  122 203 97
-3  81 4 140
-3  101 204 156
-3  140 4 3
-3  5 4 108
-3  102 4 81
-3  68 194 66
-3  205 206 207
-3  208 5 200
-3  61 139 60
-3  51 5 208
-3  209 210 98
-3  90 5 52
-3  90 92 5
-3  5 92 3
-3  211 83 157
-3  3 92 167
-3  165 167 92
-3  128 36 177
-3  168 167 165
-3  167 170 212
-3  89 213 214
-3  212 215 167
-3  211 157 216
-3  215 141 167
-3  167 141 3
-3  3 141 140
-3  125 141 27
-3  27 141 215
-3  215 28 27
-3  29 28 147
-3  217 147 28
-3  217 218 147
-3  73 110 219
-3  148 147 218
-3  181 199 175
-3  147 149 220
-3  221 220 149
-3  129 161 107
-3  221 222 220
-3  223 224 225
-3  222 226 220
-3  173 202 201
-3  227 220 226
-3  99 220 227
-3  146 145 201
-3  99 101 220
-3  53 220 101
-3  66 225 228
-3  195 220 53
-3  229 230 228
-3  29 220 195
-3  171 119 93
-3  147 220 29
-3  54 231 116
-3  29 196 27
-3  125 196 123
-3  232 233 234
-3  123 196 188
-3  188 196 195
-3  195 26 188
-3  183 235 236
-3  237 67 228
-3  9 26 53
-3  53 26 195
-3  237 238 39
-3  9 54 116
-3  239 116 231
-3  116 239 240
-3  116 240 241
-3  242 228 243
-3  241 244 116
-3  244 114 116
-3  35 199 39
-3  115 10 116
-3  19 10 115
-3  228 67 66
-3  19 150 72
-3  152 72 150
-3  245 72 152
-3  246 72 245
-3  153 217 28
-3  247 72 246
-3  248 72 247
-3  248 73 72
-3  249 250 161
-3  74 73 158
-3  63 119 118
-3  73 219 158
-3  251 158 219
-3  252 98 47
-3  251 253 158
-3  253 254 158
-3  255 158 254
-3  255 159 158
-3  160 159 256
-3  107 36 129
-3  257 256 159
-3  257 258 256
-3  256 258 259
-3  256 259 260
-3  256 260 261
-3  256 261 120
-3  120 122 21
-3  262 120 261
-3  120 262 263
-3  120 263 264
-3  120 264 265
-3  187 161 129
-3  121 120 265
-3  266 225 224
-3  121 267 122
-3  268 122 267
-3  269 122 268
-3  270 122 269
-3  203 122 270
-3  101 54 53
-3  229 228 271
-3  97 203 272
-3  97 272 191
-3  0 273 25
-3  192 98 97
-3  2 98 0
-3  0 98 252
-3  274 89 232
-3  48 47 98
-3  49 275 47
-3  47 275 184
-3  184 183 47
-3  28 276 58
-3  47 183 252
-3  252 183 277
-3  277 183 207
-3  236 207 183
-3  278 207 236
-3  278 279 207
-3  207 279 280
-3  207 280 205
-3  206 60 207
-3  60 139 207
-3  207 139 277
-3  277 139 138
-3  32 34 17
-3  15 17 34
-3  179 223 17
-3  281 276 215
-3  282 216 157
-3  17 223 225
-3  142 145 160
-3  225 266 243
-3  225 243 228
-3  242 271 228
-3  228 230 238
-3  238 230 283
-3  17 194 61
-3  283 284 238
-3  238 284 285
-3  238 285 286
-3  36 162 135
-3  174 35 287
-3  286 39 238
-3  228 238 237
-3  159 288 289
-3  68 67 185
-3  173 155 171
-3  185 67 181
-3  181 67 237
-3  24 119 171
-3  237 199 181
-3  39 199 237
-3  127 64 138
-3  290 35 38
-3  290 291 35
-3  287 35 291
-3  19 198 18
-3  37 36 107
-3  129 128 292
-3  129 292 293
-3  293 187 129
-3  42 161 154
-3  154 161 78
-3  120 143 256
-3  161 294 78
-3  78 294 76
-3  201 145 142
-3  78 166 232
-3  233 232 166
-3  232 234 295
-3  138 64 118
-3  232 295 296
-3  232 296 274
-3  163 232 89
-3  154 232 163
-3  78 232 154
-3  297 89 274
-3  297 213 89
-3  298 89 214
-3  298 299 89
-3  299 88 89
-3  299 300 88
-3  18 198 197
-3  118 64 63
-3  301 88 300
-3  252 273 0
-3  302 88 301
-3  48 98 303
-3  302 304 88
-3  304 132 88
-3  18 111 11
-3  88 132 14
-3  14 132 157
-3  132 134 157
-3  189 282 157
-3  157 83 108
-3  211 84 83
-3  83 82 200
-3  178 111 197
-3  133 132 305
-3  306 305 132
-3  306 132 304
-3  250 294 161
-3  249 161 193
-3  36 136 176
-3  39 307 38
-3  39 308 307
-3  309 308 39
-3  286 309 39
-3  151 150 310
-3  127 194 126
-3  65 64 126
-3  25 119 24
-3  171 155 24
-3  22 155 142
-3  201 155 173
-3  146 202 197
-3  197 202 178
-3  178 202 105
-3  105 202 173
-3  17 225 66
-3  197 111 18
-3  86 111 178
-3  311 98 192
-3  146 198 74
-3  74 198 72
-3  72 198 19
-3  158 145 74
-3  160 143 142
-3  21 143 120
-3  22 143 21
-3  256 143 160
-3  2 122 97
-3  2 1 21
-3  22 1 24
-3  25 1 0
-3  25 273 118
-3  70 45 32
-3  118 273 138
-3  138 273 277
-3  54 312 231
-3  277 273 252
-3  313 71 60
-3  313 60 314
-3  314 60 315
-3  206 315 60
-3  183 316 235
-3  183 317 316
-3  182 317 183
-3  303 98 210
-3  209 98 311
-3  159 318 257
-3  159 289 318
-3  159 255 288
-3  73 248 109
-3  319 310 150
-3  319 150 320
-3  320 150 115
-3  321 320 115
-3  321 115 322
-3  322 115 323
-3  114 323 115
-3  54 324 312
-3  54 325 324
-3  54 326 325
-3  326 54 156
-3  101 100 204
-3  276 28 215
-3  215 327 281
-3  215 328 327
-3  215 329 328
-3  329 215 212
-3  92 330 164
-3  92 91 330
+0.17031256632806052 0.87149140923129198 0.45766135056488999
+0.1530482164355772 0.8581878051094145 0.48898817612201739
+0.17773204761375261 0.87689701064830428 0.44478929974988757
+0.17773204761375266 0.87689701064830428 0.44478929974988746
+0.18610643753537565 0.88125255845135109 0.43210633013751576
+0.20692923660476614 0.89148810692249181 0.40180685413975092
+0.21254447256850684 0.89390471712616404 0.39369586600014284
+0.21439421228553288 0.89457789356401529 0.39128013241131548
+0.22681489975349639 0.89805158744476077 0.37520377518580433
+0.2284369195008584 0.89844705357522048 0.37311241287933194
+0.25355721782048268 0.90387507728811034 0.34253810440658672
+0.25671454238163 0.90442701067601727 0.33903474443581866
+0.271410708194047 0.90595336478045674 0.32286639405373119
+0.2811508450273621 0.90641151615731863 0.31222404809805682
+0.30186484921791523 0.90688305806336122 0.29107512591583129
+0.30397342055421117 0.90687073458352585 0.28910030252843327
+0.33295004022963903 0.90494753379947435 0.26218372058148826
+0.33544566672286746 0.90463734990484679 0.25988381527545978
+0.35660859546245854 0.90157505838463314 0.24184951424973428
+0.35918321758479488 0.90105806124803856 0.23967742655656488
+0.38998187620182156 0.89436470058605533 0.21570896554595276
+0.39229183849441457 0.893825128737608 0.21405999957086966
+0.41582096722616779 0.88692657891222382 0.1974660445788706
+0.42721864490060912 0.88304523202927654 0.18950565604187919
+0.44486756488630003 0.87684117534766193 0.17811496227257201
+0.44878045857535931 0.87541500307784514 0.17583413883161553
+0.48126519958548886 0.86156266551879135 0.15717574894030889
+0.48342144068564125 0.86055952199012919 0.15594877494016779
+0.50017470245974227 0.85269038907862327 0.14688267020077073
+0.50275426427774228 0.85145286645038376 0.14564781357706019
+0.51101182387798261 0.84695178356442291 0.1418121948905855
+0.5423386494351099 0.82968743367193953 0.12850859076870802
+0.55521070025011254 0.82226795238624728 0.12310298935169575
+0.55521070025011254 0.82226795238624728 0.12310298935169572
+0.56789366986248413 0.81389356246462441 0.11874744154864894
+0.59819314586024919 0.79307076339523386 0.10851189307750808
+0.60630413399985716 0.78745552743149316 0.10609528287383588
+0.60871986758868468 0.78560578771446699 0.10542210643598451
+0.62479622481419628 0.77318510024650322 0.10194841255523895
+0.62688758712066828 0.77156308049914157 0.10155294642477933
+0.65746189559341328 0.74644278217951743 0.096124922711889452
+0.66096525556418162 0.74328545761836973 0.095572989323982643
+0.6771336059462687 0.72858929180595311 0.094046635219543206
+0.68777595190194307 0.71884915497263779 0.093588483842681286
+0.70892487408416871 0.69813515078208477 0.093116941936638747
+0.71089969747156689 0.69602657944578872 0.093129265416474039
+0.73781627941851213 0.66704995977036097 0.095052466200525487
+0.74011618472454033 0.66455433327713243 0.095362650095153101
+0.75815048575026589 0.64339140453754129 0.098424941615366732
+0.76032257344343512 0.64081678241520534 0.098941938751961195
+0.78429103445404746 0.6100181237981781 0.10563529941394456
+0.78594000042913037 0.60770816150558526 0.10617487126239183
+0.80253395542112949 0.58417903277383187 0.11307342108777621
+0.8104943439581207 0.5727813550993911 0.11695476797072311
+0.82188503772742805 0.55513243511369992 0.12315882465233803
+0.82416586116838464 0.5512195414246408 0.12458499692215486
+0.84282425105969128 0.51873480041451114 0.13843733448120865
+0.84405122505983243 0.51657855931435837 0.13944047800987086
+0.85311732979922938 0.49982529754025784 0.14730961092137676
+0.85435218642293986 0.49724573572225761 0.14854713354961632
+0.85818780510941439 0.48898817612201739 0.15304821643557714
+0.87149140923129176 0.45766135056489032 0.17031256632806041
+0.87689701064830428 0.44478929974988757 0.17773204761375266
+0.88125255845135109 0.43210633013751554 0.18610643753537598
+0.89148810692249181 0.40180685413975104 0.20692923660476614
+0.89390471712616404 0.39369586600014284 0.21254447256850695
+0.89457789356401518 0.39128013241131554 0.21439421228553296
+0.89805158744476088 0.37520377518580417 0.22681489975349667
+0.89844705357522048 0.37311241287933194 0.22843691950085848
+0.90387507728811034 0.34253810440658677 0.25355721782048279
+0.90442701067601738 0.33903474443581871 0.25671454238163005
+0.90595336478045685 0.32286639405373119 0.271410708194047
+0.90641151615731874 0.31222404809805687 0.28115084502736221
+0.90688305806336122 0.29107512591583123 0.30186484921791512
+0.90687073458352596 0.28910030252843322 0.30397342055421106
+0.90494753379947435 0.26218372058148803 0.33295004022963903
+0.90463734990484679 0.25988381527545973 0.33544566672286741
+0.90157505838463314 0.24184951424973419 0.35660859546245843
+0.90105806124803878 0.23967742655656488 0.35918321758479488
+0.89436470058605533 0.21570896554595267 0.38998187620182156
+0.893825128737608 0.21405999957086963 0.39229183849441451
+0.88692657891222382 0.1974660445788706 0.41582096722616779
+0.88304523202927676 0.18950565604187922 0.42721864490060907
+0.87684117534766193 0.17811496227257195 0.44486756488630008
+0.87541500307784514 0.17583413883161553 0.44878045857535925
+0.86156266551879135 0.15717574894030889 0.48126519958548886
+0.86055952199012919 0.15594877494016762 0.48342144068564141
+0.85269038907862327 0.14688267020077067 0.50017470245974227
+0.85145286645038376 0.14564781357706019 0.50275426427774228
+0.84695178356442291 0.1418121948905855 0.51101182387798261
+0.82968743367193953 0.12850859076870802 0.5423386494351099
+0.82226795238624728 0.12310298935169575 0.55521070025011254
+0.82226795238624728 0.12310298935169572 0.55521070025011254
+0.81389356246462441 0.11874744154864894 0.56789366986248413
+0.79307076339523386 0.10851189307750797 0.59819314586024919
+0.78745552743149327 0.10609528287383579 0.60630413399985716
+0.78560578771446699 0.10542210643598442 0.60871986758868479
+0.77318510024650355 0.10194841255523886 0.62479622481419606
+0.77156308049914157 0.10155294642477924 0.62688758712066828
+0.74644278217951743 0.096124922711889466 0.65746189559341328
+0.74328545761836984 0.095572989323982616 0.66096525556418162
+0.72858929180595311 0.094046635219543179 0.67713360594626881
+0.71884915497263779 0.093588483842681203 0.68777595190194329
+0.69813515078208477 0.093116941936638692 0.70892487408416871
+0.69602657944578872 0.09312926541647408 0.71089969747156689
+0.66704995977036097 0.095052466200525487 0.73781627941851213
+0.66455433327713243 0.095362650095153129 0.74011618472454044
+0.64339140453754151 0.098424941615366676 0.75815048575026589
+0.64081678241520534 0.098941938751961223 0.76032257344343512
+0.61001812379817832 0.1056352994139447 0.78429103445404746
+0.60770816150558549 0.10617487126239183 0.78594000042913037
+0.58417903277383187 0.11307342108777625 0.80253395542112949
+0.57278135509939099 0.11695476797072324 0.8104943439581207
+0.55513243511370003 0.123158824652338 0.82188503772742816
+0.5512195414246408 0.12458499692215487 0.82416586116838453
+0.51873480041451092 0.13843733448120876 0.84282425105969128
+0.51657855931435848 0.13944047800987086 0.84405122505983243
+0.49982529754025784 0.14730961092137676 0.85311732979922927
+0.49724573572225761 0.14854713354961635 0.85435218642293975
+0.4889881761220175 0.15304821643557709 0.85818780510941428
+0.4576613505648901 0.17031256632806047 0.87149140923129198
+0.44478929974988757 0.17773204761375261 0.87689701064830428
+0.44478929974988746 0.17773204761375266 0.87689701064830428
+0.43210633013751587 0.18610643753537565 0.88125255845135109
+0.40180685413975104 0.20692923660476614 0.89148810692249203
+0.39369586600014295 0.21254447256850689 0.89390471712616426
+0.39128013241131554 0.21439421228553296 0.89457789356401551
+0.37520377518580433 0.22681489975349645 0.89805158744476099
+0.37311241287933189 0.22843691950085854 0.8984470535752207
+0.34253810440658672 0.25355721782048268 0.90387507728811034
+0.3390347444358186 0.25671454238163 0.90442701067601727
+0.32286639405373108 0.271410708194047 0.90595336478045685
+0.31222404809805682 0.2811508450273621 0.90641151615731874
+0.29107512591583118 0.30186484921791523 0.90688305806336111
+0.28910030252843322 0.30397342055421106 0.90687073458352596
+0.26218372058148809 0.33295004022963903 0.90494753379947435
+0.25988381527545967 0.33544566672286746 0.9046373499048469
+0.24184951424973422 0.35660859546245849 0.90157505838463314
+0.23967742655656482 0.35918321758479488 0.90105806124803833
+0.21570896554595276 0.38998187620182151 0.89436470058605511
+0.21405999957086966 0.39229183849441451 0.893825128737608
+0.1974660445788706 0.41582096722616779 0.88692657891222382
+0.18950565604187924 0.42721864490060907 0.88304523202927665
+0.17811496227257201 0.44486756488630003 0.87684117534766193
+0.17583413883161547 0.44878045857535925 0.87541500307784514
+0.15717574894030886 0.48126519958548875 0.86156266551879135
+0.15594877494016779 0.48342144068564119 0.86055952199012919
+0.14688267020077073 0.50017470245974227 0.85269038907862316
+0.14564781357706014 0.50275426427774228 0.85145286645038376
+0.1418121948905855 0.51101182387798283 0.84695178356442269
+0.12850859076870802 0.5423386494351099 0.82968743367193953
+0.12310298935169575 0.55521070025011254 0.82226795238624728
+0.12310298935169572 0.55521070025011254 0.82226795238624728
+0.11874744154864894 0.56789366986248413 0.81389356246462441
+0.10851189307750805 0.59819314586024896 0.79307076339523386
+0.10609528287383586 0.60630413399985694 0.78745552743149316
+0.10542210643598447 0.60871986758868468 0.78560578771446687
+0.10194841255523887 0.62479622481419628 0.77318510024650311
+0.10155294642477927 0.62688758712066828 0.77156308049914146
+0.096124922711889493 0.65746189559341328 0.74644278217951743
+0.095572989323982643 0.66096525556418151 0.74328545761836984
+0.09404663521954322 0.6771336059462687 0.72858929180595311
+0.093588483842681203 0.68777595190194329 0.71884915497263779
+0.093116941936638636 0.70892487408416871 0.69813515078208488
+0.093129265416474122 0.71089969747156689 0.69602657944578861
+0.095052466200525557 0.7378162794185118 0.66704995977036108
+0.095362650095153129 0.74011618472454033 0.66455433327713254
+0.098424941615366676 0.758150485750266 0.64339140453754151
+0.098941938751961223 0.76032257344343512 0.64081678241520534
+0.10563529941394462 0.78429103445404746 0.61001812379817821
+0.10617487126239186 0.78594000042913037 0.60770816150558549
+0.11307342108777627 0.80253395542112949 0.58417903277383187
+0.11695476797072325 0.81049434395812059 0.57278135509939099
+0.12315882465233809 0.82188503772742794 0.55513243511370003
+0.12458499692215494 0.8241658611683842 0.55121954142464069
+0.13843733448120885 0.84282425105969117 0.5187348004145107
+0.13944047800987086 0.84405122505983243 0.51657855931435837
+0.1473096109213767 0.85311732979922927 0.49982529754025778
+0.14854713354961635 0.85435218642293975 0.49724573572225772
+0.44564650023159863 0.34126814896874336 0.82760814841975505
+0.27542468411056592 0.78691464920034204 0.55218346430918919
+0.82760814841975505 0.44564650023159863 0.34126814896874336
+0.55218346430918919 0.27542468411056592 0.78691464920034204
+0.78691464920034204 0.55218346430918919 0.27542468411056592
+0.34126814896874336 0.82760814841975505 0.44564650023159863
+0.30369631682393589 0.52293928186267558 0.79643145005237248
+0.26105426945011484 0.63457761123722189 0.7274351680516471
+0.79643145005237248 0.30369631682393589 0.52293928186267558
+0.7274351680516471 0.26105426945011484 0.63457761123722201
+0.63457761123722201 0.7274351680516471 0.26105426945011484
+0.52293928186267558 0.79643145005237248 0.30369631682393589
+0.63704738383668802 0.33543172738922172 0.69401454380114713
+0.50369111272938427 0.52836121174546036 0.68346886752821701
+0.69401454380114724 0.63704738383668813 0.33543172738922178
+0.68346886752821701 0.50369111272938438 0.52836121174546036
+0.33543172738922172 0.69401454380114713 0.63704738383668802
+0.52836121174546025 0.68346886752821701 0.50369111272938438
+0.42151877198336163 0.46863573506266104 0.77633914798103421
+0.46047178079401074 0.64151089172333209 0.61353851948571891
+0.77633914798103421 0.42151877198336163 0.46863573506266104
+0.61353851948571891 0.4604717807940108 0.64151089172333209
+0.46863573506266104 0.77633914798103421 0.42151877198336163
+0.64151089172333209 0.61353851948571891 0.4604717807940108
+0.61446983418191203 0.27287882084494514 0.74024588618561449
+0.40632940254264294 0.78437123837371081 0.46867704983435055
+0.33924096091721673 0.86230450765389344 0.37596077789543381
+0.74024588618561449 0.61446983418191203 0.27287882084494514
+0.46867704983435055 0.40632940254264294 0.78437123837371081
+0.37596077789543381 0.33924096091721673 0.86230450765389344
+0.78437123837371081 0.46867704983435055 0.40632940254264294
+0.86230450765389344 0.37596077789543381 0.33924096091721673
+0.27287882084494514 0.74024588618561449 0.61446983418191203
+0.32839555720531111 0.64061453708709604 0.69409608332024086
+0.20012814034344362 0.68018071850695239 0.70519707714513458
+0.23458495860622128 0.51571602924327076 0.82401873423925942
+0.35362935294171677 0.46556504362316592 0.81129246939324073
+0.69409608332024086 0.32839555720531111 0.64061453708709615
+0.70519707714513458 0.20012814034344362 0.6801807185069525
+0.82401873423925942 0.23458495860622128 0.51571602924327076
+0.81129246939324073 0.35362935294171677 0.46556504362316592
+0.51571602924327076 0.82401873423925942 0.23458495860622128
+0.46556504362316592 0.81129246939324073 0.35362935294171677
+0.64061453708709615 0.69409608332024086 0.32839555720531111
+0.68018071850695239 0.70519707714513447 0.20012814034344359
+0.67170915887432037 0.4512666656072587 0.58750761901107273
+0.56664784959934422 0.52372394783737519 0.63610018157997195
+0.37149736972483099 0.52777252693426735 0.76383628095354983
+0.58750761901107262 0.67170915887432026 0.45126666560725864
+0.63610018157997184 0.56664784959934422 0.52372394783737519
+0.76383628095354983 0.37149736972483099 0.52777252693426735
+0.45126666560725853 0.58750761901107273 0.67170915887432037
+0.52372394783737508 0.63610018157997195 0.56664784959934422
+0.52777252693426735 0.76383628095354983 0.37149736972483099
+0.19300544019554741 0.62457262167826677 0.75674166021493716
+0.55216883979414833 0.46626606661797837 0.69116244652106429
+0.33994835690442565 0.74334549596053456 0.57608383788574391
+0.75674166021493716 0.19300544019554741 0.62457262167826677
+0.69116244652106429 0.55216883979414833 0.46626606661797837
+0.57608383788574391 0.33994835690442565 0.74334549596053456
+0.62457262167826677 0.75674166021493716 0.19300544019554741
+0.46626606661797826 0.6911624465210644 0.55216883979414844
+0.74334549596053456 0.57608383788574391 0.33994835690442565
+0.48696645046278469 0.27572854131968005 0.82875656716879031
+0.40547414873191512 0.74192286377215233 0.53398612240605781
+0.34179011670600551 0.78792826822967776 0.5121997269099976
+0.82875656716879031 0.48696645046278469 0.27572854131968005
+0.53398612240605769 0.40547414873191501 0.74192286377215222
+0.5121997269099976 0.34179011670600551 0.78792826822967776
+0.74192286377215222 0.53398612240605769 0.40547414873191501
+0.78792826822967776 0.5121997269099976 0.34179011670600551
+0.27572854131968005 0.82875656716879031 0.48696645046278469
+0.38505005624480643 0.58714124035889637 0.71204046096811668
+0.31802330015895514 0.58336686281126149 0.74735820322637392
+0.25063608611031912 0.57642063043274483 0.7777665518334006
+0.71204046096811668 0.38505005624480643 0.58714124035889637
+0.74735820322637392 0.31802330015895514 0.58336686281126149
+0.77776655183340049 0.25063608611031907 0.57642063043274483
+0.57642063043274483 0.77776655183340049 0.25063608611031907
+0.58714124035889637 0.71204046096811668 0.38505005624480643
+0.58336686281126149 0.74735820322637392 0.31802330015895514
+0.65621226556123025 0.39498488175763669 0.64294043714010041
+0.43823895845745109 0.52969979418799096 0.72619883181352507
+0.64294043714010041 0.65621226556123025 0.39498488175763669
+0.72619883181352507 0.43823895845745109 0.52969979418799096
+0.39498488175763669 0.64294043714010041 0.65621226556123025
+0.52969979418799096 0.72619883181352507 0.43823895845745109
+0.48798559166164257 0.46894076499437626 0.73618246464930537
+0.40176612662410133 0.69466625495449263 0.59667643972673012
+0.73618246464930537 0.48798559166164257 0.46894076499437626
+0.59667643972673012 0.40176612662410133 0.69466625495449263
+0.46894076499437626 0.73618246464930537 0.48798559166164257
+0.69466625495449263 0.59667643972673012 0.40176612662410133
+0.64927986178574382 0.20469785983476813 0.7324851174314404
+0.58942568680894825 0.20731239180326447 0.78076816785433134
+0.40127702279442362 0.85397772162051189 0.33120809463701678
+0.40480738995889742 0.82178222598517658 0.40100492526839771
+0.73248511743144051 0.64927986178574382 0.20469785983476813
+0.78076816785433134 0.58942568680894825 0.20731239180326447
+0.33120809463701678 0.40127702279442362 0.85397772162051189
+0.40100492526839771 0.40480738995889742 0.82178222598517658
+0.85397772162051189 0.33120809463701678 0.40127702279442362
+0.82178222598517658 0.40100492526839771 0.40480738995889742
+0.20469785983476813 0.7324851174314404 0.64927986178574382
+0.20731239180326447 0.78076816785433134 0.58942568680894825
+0.26817151760031976 0.68929656115193516 0.6730187872058685
+0.28407954462258928 0.46039308870086582 0.84103330267207554
+0.67301878720586839 0.26817151760031971 0.68929656115193505
+0.84103330267207554 0.28407954462258928 0.46039308870086582
+0.46039308870086582 0.84103330267207554 0.28407954462258928
+0.68929656115193505 0.67301878720586839 0.26817151760031971
+0.62674761880757135 0.51556327979539029 0.58427898032160919
+0.58427898032160919 0.62674761880757146 0.51556327979539029
+0.57735026918962573 0.57735026918962573 0.57735026918962584
+0.51556327979539029 0.58427898032160919 0.62674761880757146
+0.52579382752597525 0.20828740048796671 0.8247164420172246
+0.20793674136609455 0.86400769557376311 0.45853354684184816
+0.1264800315542341 0.61148180127020313 0.78108437977813105
+0.891573746743482 0.30401279487901051 0.33566720821021828
+0.78108437977813128 0.1264800315542341 0.61148180127020324
+0.61148180127020324 0.78108437977813128 0.1264800315542341
+0.50619228471494349 0.84615687966832631 0.16669704821929851
+0.62340222914316235 0.13827368218737227 0.76957783850217643
+0.84615687966832631 0.16669704821929851 0.50619228471494349
+0.13929176414434621 0.81523570763863507 0.5621285844293008
+0.45853354684184816 0.20793674136609455 0.86400769557376311
+0.81523570763863529 0.5621285844293008 0.13929176414434621
+0.27249577181778528 0.89756031181852247 0.34659997257597425
+0.33566720821021828 0.891573746743482 0.30401279487901051
+0.68063975088704343 0.13583622552694097 0.71991530706536411
+0.13827368218737227 0.76957783850217643 0.62340222914316235
+0.16669704821929851 0.50619228471494349 0.84615687966832631
+0.5621285844293008 0.13929176414434621 0.81523570763863529
+0.25952221836449818 0.39610117388436322 0.88076789123048704
+0.30401279487901051 0.33566720821021828 0.891573746743482
+0.34659997257597425 0.27249577181778528 0.89756031181852247
+0.41838703947458172 0.27466844612618396 0.86574218443040096
+0.88076789123048704 0.25952221836449818 0.39610117388436322
+0.76957783850217643 0.62340222914316235 0.13827368218737227
+0.86400769557376311 0.45853354684184816 0.20793674136609455
+0.71991530706536411 0.68063975088704343 0.13583622552694097
+0.89756031181852258 0.3465999725759743 0.27249577181778534
+0.66669512270283426 0.73357768674250456 0.13183850301701969
+0.8247164420172246 0.52579382752597525 0.20828740048796671
+0.45337594379539092 0.86541618975952417 0.21331917890744351
+0.56644608341520641 0.80357852474018532 0.18275773351615091
+0.80357852474018532 0.18275773351615091 0.56644608341520641
+0.39610117388436322 0.88076789123048704 0.25952221836449818
+0.21331917890744351 0.45337594379539092 0.86541618975952417
+0.86574218443040096 0.41838703947458172 0.27466844612618396
+0.135836225526941 0.719915307065364 0.68063975088704354
+0.27466844612618396 0.86574218443040096 0.41838703947458172
+0.86541618975952417 0.21331917890744351 0.45337594379539092
+0.73357768674250456 0.13183850301701969 0.66669512270283426
+0.20828740048796671 0.8247164420172246 0.52579382752597525
+0.13183850301701969 0.66669512270283426 0.73357768674250456
+0.18275773351615091 0.56644608341520641 0.80357852474018532
+3  242 247 179
+3  244 250 180
+3  245 249 181
+3  247 242 182
+3  249 245 183
+3  250 244 184
+3  252 253 185
+3  253 252 186
+3  255 256 187
+3  256 255 188
+3  257 259 189
+3  259 257 190
+3  260 269 191
+3  261 266 192
+3  262 271 193
+3  263 268 194
+3  264 267 195
+3  265 270 196
+3  334 159 158
+3  157 156 296
+3  266 261 197
+3  267 264 198
+3  175 174 303
+3  310 145 327
+3  99 98 332
+3  268 263 199
+3  269 260 200
+3  37 36 299
+3  270 265 201
+3  271 262 202
+3  40 39 321
+3  26 25 323
+3  302 85 331
+3  56 55 305
+3  273 294 311
+3  238 203 191
+3  275 204 201
+3  330 205 306
+3  277 322 305
+3  241 206 193
+3  279 207 197
+3  315 208 314
+3  281 209 199
+3  328 210 320
+3  283 333 303
+3  235 211 195
+3  284 212 195
+3  233 213 334
+3  285 214 327
+3  226 215 197
+3  163 162 329
+3  303 171 309
+3  313 134 133
+3  327 141 312
+3  286 216 191
+3  236 217 332
+3  308 103 102
+3  311 112 111
+3  287 218 331
+3  229 219 199
+3  288 220 323
+3  232 221 201
+3  289 222 193
+3  239 223 321
+3  15 14 307
+3  323 22 326
+3  297 74 73
+3  81 80 316
+3  319 44 43
+3  305 52 317
+3  290 224 194
+3  234 225 192
+3  215 226 185
+3  207 279 179
+3  333 283 180
+3  291 227 196
+3  237 228 194
+3  219 229 187
+3  209 281 181
+3  294 273 182
+3  322 277 183
+3  293 230 192
+3  240 231 196
+3  221 232 190
+3  204 275 184
+3  214 285 185
+3  208 315 179
+3  213 233 186
+3  225 234 200
+3  230 293 198
+3  211 235 180
+3  212 284 186
+3  78 77 316
+3  218 287 187
+3  210 328 181
+3  217 236 188
+3  104 103 308
+3  228 237 202
+3  224 290 200
+3  203 238 182
+3  216 286 188
+3  223 239 189
+3  231 240 198
+3  227 291 202
+3  206 241 183
+3  222 289 189
+3  19 18 326
+3  220 288 190
+3  205 330 184
+3  242 315 304
+3  242 294 182
+3  244 235 243
+3  244 204 184
+3  245 328 318
+3  245 322 183
+3  247 238 246
+3  247 207 179
+3  249 241 248
+3  249 209 181
+3  250 330 295
+3  250 333 180
+3  252 226 251
+3  252 212 186
+3  253 233 335
+3  253 214 185
+3  255 229 254
+3  255 216 188
+3  256 236 325
+3  256 218 187
+3  257 239 324
+3  257 220 190
+3  259 232 258
+3  259 222 189
+3  260 216 254
+3  260 224 200
+3  261 230 251
+3  261 226 197
+3  262 222 258
+3  262 227 202
+3  263 224 254
+3  263 229 199
+3  264 212 251
+3  264 230 198
+3  265 227 258
+3  265 232 201
+3  127 126 315
+3  296 153 335
+3  296 233 334
+3  266 207 246
+3  266 234 192
+3  267 240 243
+3  267 235 195
+3  295 1 333
+3  310 214 335
+3  149 148 310
+3  67 66 328
+3  119 118 294
+3  298 93 325
+3  298 236 332
+3  268 209 248
+3  268 237 194
+3  269 234 246
+3  269 238 191
+3  34 33 324
+3  299 239 321
+3  270 204 243
+3  270 240 196
+3  271 237 248
+3  271 241 193
+3  8 7 330
+3  300 220 324
+3  30 29 300
+3  302 218 325
+3  318 60 322
+3  273 301 272
+3  273 203 182
+3  238 269 246
+3  238 247 182
+3  275 221 274
+3  275 205 184
+3  7 6 330
+3  330 250 184
+3  277 317 276
+3  277 206 183
+3  241 271 248
+3  241 249 183
+3  279 215 278
+3  279 208 179
+3  126 125 315
+3  315 242 179
+3  281 219 280
+3  281 210 181
+3  66 65 328
+3  328 245 181
+3  283 309 282
+3  283 211 180
+3  235 267 243
+3  235 244 180
+3  284 211 282
+3  284 213 186
+3  233 296 335
+3  233 253 186
+3  285 312 278
+3  285 215 185
+3  226 261 251
+3  226 252 185
+3  329 213 282
+3  309 167 329
+3  313 208 278
+3  137 136 312
+3  286 203 272
+3  286 217 188
+3  236 298 325
+3  236 256 188
+3  308 217 272
+3  301 107 308
+3  287 316 280
+3  287 219 187
+3  229 263 254
+3  229 255 187
+3  288 326 274
+3  288 221 190
+3  232 265 258
+3  232 259 190
+3  289 206 276
+3  289 223 189
+3  239 299 324
+3  239 257 189
+3  307 205 274
+3  18 17 326
+3  297 210 280
+3  316 77 76
+3  319 223 276
+3  317 48 319
+3  290 228 292
+3  290 225 200
+3  234 266 246
+3  234 269 200
+3  215 285 278
+3  215 279 197
+3  207 247 246
+3  207 266 197
+3  309 329 282
+3  309 283 303
+3  333 250 295
+3  177 176 333
+3  291 231 292
+3  291 228 202
+3  237 268 248
+3  237 271 202
+3  219 287 280
+3  219 281 199
+3  209 249 248
+3  209 268 199
+3  301 308 272
+3  301 273 311
+3  294 242 304
+3  294 117 116
+3  317 319 276
+3  317 277 305
+3  322 245 318
+3  322 58 57
+3  293 225 292
+3  293 231 198
+3  240 270 243
+3  240 267 198
+3  221 288 274
+3  221 275 201
+3  204 244 243
+3  204 270 201
+3  335 151 150
+3  312 313 278
+3  312 285 327
+3  214 253 335
+3  214 310 327
+3  208 279 278
+3  208 313 314
+3  213 284 282
+3  213 329 334
+3  225 290 292
+3  225 293 192
+3  230 264 251
+3  230 261 192
+3  211 283 282
+3  211 284 195
+3  212 252 251
+3  212 264 195
+3  91 90 325
+3  316 297 280
+3  316 287 331
+3  218 256 325
+3  218 302 331
+3  210 281 280
+3  210 297 320
+3  217 286 272
+3  217 308 332
+3  101 100 332
+3  228 291 292
+3  228 290 194
+3  224 260 254
+3  224 263 194
+3  203 273 272
+3  203 286 191
+3  216 255 254
+3  216 260 191
+3  223 289 276
+3  223 319 321
+3  41 40 321
+3  231 293 292
+3  231 291 196
+3  227 262 258
+3  227 265 196
+3  206 277 276
+3  206 289 193
+3  222 259 258
+3  222 262 193
+3  32 31 324
+3  326 307 274
+3  326 288 323
+3  220 257 324
+3  220 300 323
+3  205 275 274
+3  205 307 306
+3  294 304 119
+3  294 118 117
+3  72 71 320
+3  297 72 320
+3  73 72 297
+3  4 295 5
+3  3 295 4
+3  2 295 3
+3  123 304 124
+3  121 304 122
+3  122 304 123
+3  294 116 311
+3  161 334 162
+3  159 334 160
+3  160 334 161
+3  110 109 301
+3  311 111 301
+3  111 110 301
+3  46 319 47
+3  44 319 45
+3  45 319 46
+3  143 327 144
+3  142 327 143
+3  141 327 142
+3  24 323 25
+3  22 323 23
+3  23 323 24
+3  298 95 94
+3  93 298 94
+3  324 299 34
+3  324 33 32
+3  295 2 0
+3  1 295 0
+3  304 315 124
+3  315 125 124
+3  92 91 325
+3  93 92 325
+3  296 155 154
+3  153 296 154
+3  165 329 166
+3  163 329 164
+3  164 329 165
+3  35 299 36
+3  34 299 35
+3  296 158 157
+3  156 155 296
+3  76 75 297
+3  316 76 297
+3  97 298 98
+3  95 298 96
+3  96 298 97
+3  299 39 38
+3  38 37 299
+3  310 150 149
+3  300 29 28
+3  26 300 27
+3  27 300 28
+3  89 302 90
+3  88 302 89
+3  300 31 30
+3  107 301 108
+3  308 107 106
+3  302 88 87
+3  86 302 87
+3  85 302 86
+3  10 306 11
+3  9 306 10
+3  8 306 9
+3  152 151 335
+3  153 152 335
+3  326 21 20
+3  19 326 20
+3  303 176 175
+3  174 173 303
+3  139 312 140
+3  137 312 138
+3  138 312 139
+3  59 58 322
+3  60 59 322
+3  171 303 172
+3  309 171 170
+3  309 170 169
+3  305 57 56
+3  55 54 305
+3  141 140 312
+3  307 326 17
+3  307 17 16
+3  120 304 121
+3  119 304 120
+3  52 305 53
+3  317 51 50
+3  317 52 51
+3  332 102 101
+3  100 99 332
+3  306 307 13
+3  306 13 12
+3  307 14 13
+3  63 318 64
+3  62 318 63
+3  308 102 332
+3  318 328 64
+3  328 65 64
+3  129 314 130
+3  127 314 128
+3  128 314 129
+3  316 80 79
+3  78 316 79
+3  331 84 83
+3  82 331 83
+3  81 331 82
+3  308 106 105
+3  105 104 308
+3  178 177 333
+3  1 178 333
+3  167 309 168
+3  329 167 166
+3  310 148 147
+3  146 310 147
+3  145 310 146
+3  115 311 116
+3  113 311 114
+3  114 311 115
+3  313 312 136
+3  313 136 135
+3  133 132 313
+3  313 132 314
+3  132 131 314
+3  315 314 127
+3  321 43 42
+3  42 41 321
+3  316 331 81
+3  48 317 49
+3  319 48 47
+3  318 62 61
+3  60 318 61
+3  319 43 321
+3  317 50 49
+3  69 320 70
+3  67 320 68
+3  68 320 69
+3  295 330 5
+3  330 6 5
+3  15 307 16
+3  299 321 39
+3  322 57 305
+3  305 54 53
+3  323 300 26
+3  320 71 70
+3  300 324 31
+3  302 325 90
+3  22 21 326
+3  145 144 327
+3  328 320 67
+3  334 329 162
+3  306 12 11
+3  297 75 74
+3  330 306 8
+3  168 309 169
+3  85 84 331
+3  311 113 112
+3  172 303 173
+3  298 332 98
+3  108 301 109
+3  303 333 176
+3  134 313 135
+3  334 158 296
+3  335 150 310
+3  130 314 131
 
diff --git a/Data/data/meshes/polyhedral_complex_of_spheres/Intersection23.off b/Data/data/meshes/polyhedral_complex_of_spheres/Intersection23.off
deleted file mode 100644
index 6b73abe61e11..000000000000
--- a/Data/data/meshes/polyhedral_complex_of_spheres/Intersection23.off
+++ /dev/null
@@ -1,833 +0,0 @@
-NOFF
-337 492 0
-
-0.65340002742402614 0.72750422818221494 0.10243968818147731  -0.3467276424095721 -0.27221405186828174 -0.89759648615318921
-0.62479622481419628 0.77318510024650322 0.10194841255523895  -0.36748531964497938 -0.23977066491306484 -0.89859032272363926
-0.62688758712066828 0.77156308049914157 0.10155294642477933  -0.34889693998411886 -0.22824258748330767 -0.90894237800239175
-0.31070343884806484 0.3269812127941315 0.73182848239968035  -0.68937955050281363 -0.67285685715261212 -0.26836446324215141
-0.36542238876277799 0.27256483194835279 0.73894573054988522  -0.63469945426951102 -0.72726265769102494 -0.26123864468751956
-0.3198192814930475 0.29480292285486542 0.79987185965655649  -0.68040299513329328 -0.70493504308661681 -0.2002956545762121
-0.30533374504550748 0.40332356027326954 0.59823387337589862  -0.694551218801158 -0.59667142984000998 -0.40197239864759859
-0.35848910827666791 0.38646148051428109 0.53952821920598915  -0.64149399833800991 -0.61382359089386174 -0.46011525660260222
-0.3570595628598997 0.34378773443876975 0.60501511824236331  -0.64279095563231392 -0.65613064511909658 -0.39536358442943981
-0.48780027309000251 0.65820988329399444 0.21207173177032235  -0.51223335844459628 -0.34188293456237473 -0.787866134283984
-0.44781653569081092 0.72457531588943425 0.21308535079965785  -0.55218785652865843 -0.27542173873706899 -0.78691259802683011
-0.51303354953721536 0.72427145868031995 0.17124343283120957  -0.4869280495724907 -0.27563277583938711 -0.82881098413486542
-0.37325238119242876 0.48443672020460948 0.41572101967839103  -0.62647295099493516 -0.51565247738810571 -0.5844947940189088
-0.31653113247178299 0.49630888727061573 0.47163878825453964  -0.68370790823052163 -0.50330613999724017 -0.52841879760671173
-0.32829084112567974 0.5487333343927413 0.41249238098892749  -0.67149417441485404 -0.45142526361231916 -0.58763152153323239
-0.86816149698298051 0.33330487729716585 0.26642231325749555  -0.13227871496285307 -0.66711974931205487 -0.73311225719230566
-0.90442701067601738 0.33903474443581871 0.25671454238163005  -0.089584884642383594 -0.67452766723137247 -0.73279395097326894
-0.90595336478045685 0.32286639405373119 0.271410708194047  -0.089584884642384358 -0.67452766723137214 -0.73279395097326927
-0.36389981842002816 0.43335215040065556 0.47627605216262481  -0.63609627313050632 -0.56692430597377941 -0.52342942466547371
-0.27380116818647493 0.56176104154254891 0.47030020581200904  -0.72592006295091172 -0.43849581670457083 -0.52986930552536793
-0.3864614805142812 0.53952821920598915 0.35848910827666791  -0.61382359089386263 -0.460115256602602 -0.64149399833800913
-0.43335215040065556 0.47627605216262481 0.36389981842002816  -0.56692430597378007 -0.52342942466547338 -0.63609627313050598
-0.68197669984104492 0.41663313718873862 0.25264179677362608  -0.31838810336562567 -0.58337988565756416 -0.74719269579232839
-0.73894573054988522 0.36542238876277799 0.27256483194835279  -0.26123864468751978 -0.63469945426951047 -0.72726265769102527
-0.67160444279468889 0.35938546291290396 0.30590391667975914  -0.32871571883365308 -0.64057192708348243 -0.69398384882087027
-0.33330487729716574 0.26642231325749544 0.86816149698298051  -0.66711974931205442 -0.73311225719230599 -0.13227871496285382
-0.3390347444358186 0.25671454238163 0.90442701067601727  -0.67452766723137392 -0.73279395097326772 -0.089584884642382206
-0.32286639405373108 0.271410708194047 0.90595336478045674  -0.67452766723137203 -0.7327939509732696 -0.089584884642382387
-0.26381753535069452 0.51201440833835754 0.5310592350056238  -0.73602315194220458 -0.48809649929758581 -0.46907539604897669
-0.80699455980445267 0.37542737832173312 0.24325833978506273  -0.19358827458119329 -0.62484261256047746 -0.75636980999592618
-0.74936391388968104 0.42357936956725517 0.22223344816659951  -0.25098113386125442 -0.57611676249591837 -0.7778804190985531
-0.30883755347893571 0.44783116020585167 0.53373393338202169  -0.69097715483087363 -0.55222595833073029 -0.46647300291392774
-0.59823387337589862 0.30533374504550748 0.40332356027326954  -0.40197239864759965 -0.69455121880115767 -0.59667142984000976
-0.53952821920598915 0.35848910827666791 0.3864614805142812  -0.46011525660260222 -0.64149399833800991 -0.61382359089386174
-0.60501511824236331 0.3570595628598997 0.34378773443876975  -0.39536358442944003 -0.64279095563231414 -0.65613064511909613
-0.23616371904645006 0.62850263027516917 0.47222747306573276  -0.76364675610270716 -0.37176976328895933 -0.52785497534633863
-0.22366085201896557 0.57848122801663848 0.53136426493733913  -0.77616877106981574 -0.42177409750733541 -0.46868822204941812
-0.18870753060675904 0.64637064705828329 0.53443495637683447  -0.81121902067950891 -0.3538769830587431 -0.46550486715932449
-0.72712117915505503 0.2597541138143854 0.38553016581808786  -0.2730077511897781 -0.74028370995146919 -0.61436698850995353
-0.79530214016523215 0.2675148825685596 0.35072013821425629  -0.20481384113375134 -0.73258235910829961 -0.64913355914122706
-0.79268760819673556 0.21923183214566855 0.41057431319105175  -0.20735457304096661 -0.78085960551688671 -0.58928970592655916
-0.41572101967839103 0.37325238119242854 0.48443672020460959  -0.5840346780896517 -0.62675731827798065 -0.51582822603431755
-0.42264973081037427 0.42264973081037416 0.42264973081037427  -0.57702725326215776 -0.57739733617063238 -0.57762605998672467
-0.47627605216262492 0.36389981842002816 0.43335215040065567  -0.52380155193385225 -0.636326260430505 -0.56632219140540219
-0.66005164309557429 0.25665450403946544 0.42391616211425598  -0.34013694034011555 -0.74324570666303835 -0.5761012769843733
-0.66456827261077822 0.30598545619885287 0.36295261616331198  -0.33571718293160907 -0.69398814937561637 -0.63692575831934428
-0.17821777401482319 0.59899507473160241 0.59519261004110269  -0.82172156155091991 -0.40115992505181985 -0.40477696304846217
-0.14602227837948789 0.66879190536298361 0.59872297720557655  -0.85394740027497873 -0.33139575632083107 -0.40118660278746798
-0.48443672020460959 0.41572101967839092 0.37325238119242865  -0.51565247738810638 -0.58449479401890947 -0.62647295099493405
-0.28795953903188309 0.61494994375519363 0.41285875964110375  -0.71231212670919686 -0.38457055427597059 -0.58712598556604001
-0.53443495637683447 0.18870753060675904 0.64637064705828329  -0.4655048671593236 -0.81121902067950946 -0.35387698305874338
-0.53136426493733913 0.22366085201896557 0.57848122801663848  -0.46868822204941812 -0.77616877106981574 -0.42177409750733541
-0.59519261004110269 0.17821777401482319 0.59899507473160241  -0.40477696304846217 -0.82172156155091991 -0.40115992505181985
-0.2156287616262893 0.53132295016564957 0.59367059745735717  -0.78424095119900827 -0.46877433341209018 -0.40646863937642869
-0.11923210876951273 0.74047778163550204 0.60389882611563683  -0.88070834559541733 -0.25988482570664379 -0.39599581735923706
-0.09842494161536669 0.758150485750266 0.64339140453754151  -0.8986223830402289 -0.24555619785558386 -0.36356562872995768
-0.098941938751961223 0.76032257344343512 0.64081678241520534  -0.89982453013548214 -0.22723563663234903 -0.37239734211021136
-0.095362650095153129 0.74011618472454044 0.66455433327713243  -0.89704722922209224 -0.26377483182397365 -0.35458300388089892
-0.10842625325651789 0.69598720512098966 0.66433279178978177  -0.89156486051918749 -0.30422052318316711 -0.33550256744406848
-0.44783116020585167 0.53373393338202169 0.30883755347893571  -0.55222595833073074 -0.46647300291392757 -0.69097715483087341
-0.13599230442623667 0.54146645315815212 0.79206325863390559  -0.54975000439653132 -0.82421016874017694 0.13584009132543551
-0.11874744154864894 0.56789366986248413 0.81389356246462441  -0.8858348623928205 -0.42585755017737525 -0.18423339416733664
-0.10851189307750805 0.59819314586024896 0.79307076339523386  -0.88183387534488133 -0.4235080834275432 -0.20738833035095594
-0.86172631781262787 0.23042216149782369 0.37659777085683765  -0.13836216352688824 -0.76972539034250098 -0.62320039727702603
-0.86070823585565381 0.18476429236136471 0.43787141557069931  -0.13924301275047277 -0.81541586445899072 -0.56187930322158031
-0.47163878825453964 0.31653113247178277 0.49630888727061573  -0.52841879760671084 -0.68370790823052174 -0.50330613999724094
-0.41249238098892738 0.32829084112567963 0.54873333439274119  -0.58737470394737457 -0.67165289641182357 -0.45152335920120706
-0.40332356027326954 0.59823387337589862 0.30533374504550748  -0.59667142984000976 -0.40197239864759959 -0.69455121880115767
-0.34378773443876975 0.60501511824236331 0.3570595628598997  -0.65613064511909591 -0.39536358442943997 -0.64279095563231448
-0.58161296052541844 0.72533155387381609 0.13425781556959904  -0.41835586417422144 -0.27447137325094861 -0.86581974808662043
-0.55435349976840143 0.65873185103125653 0.17239185158024484  -0.44564173451716937 -0.34127086350966229 -0.82760959526572564
-0.35938546291290396 0.30590391667975914 0.67160444279468889  -0.64057192708348321 -0.69398384882086983 -0.32871571883365264
-0.30598545619885309 0.36295261616331198 0.66456827261077822  -0.69398814937561637 -0.63692575831934428 -0.33571718293160907
-0.81724226648384946 0.43355391658479348 0.19642147525981468  -0.18137511328579292 -0.5662130069615704 -0.80405590541211902
-0.88125255845135109 0.43210633013751554 0.18610643753537598  -0.1223064817495161 -0.58292813064721183 -0.80326578355000444
-0.87351996844576607 0.38851819872979687 0.21891562022186895  -0.12697533232365854 -0.61194488891505017 -0.78064122227310251
-0.46601387759394231 0.5945258512680851 0.25807713622784767  -0.53404105644655731 -0.40564529943251815 -0.74178975530654756
-0.42391616211425598 0.66005164309557429 0.25665450403946544  -0.5761012769843723 -0.34013694034011455 -0.74324570666303946
-0.37659777085683754 0.86172631781262776 0.2304221614978238  -0.62320039727703713 -0.13836216352689507 -0.76972539034249077
-0.41582096722616779 0.88692657891222382 0.1974660445788706  -0.59478368364253598 -0.1147703353129565 -0.79565076497466358
-0.43787141557069931 0.86070823585565381 0.18476429236136471  -0.56187930322157953 -0.13924301275047141 -0.8154158644589915
-0.30590391667975914 0.67160444279468889 0.35938546291290396  -0.69398384882087027 -0.32871571883365297 -0.64057192708348243
-0.31222404809805682 0.2811508450273621 0.90641151615731874  -0.68572398718655958 -0.72091363611669124 -0.10033016823457401
-0.280084692934636 0.31936024911295635 0.86416377447305925  -0.72008099426245742 -0.68041269101920465 -0.13609530337963549
-0.25665450403946544 0.42391616211425598 0.66005164309557429  -0.74324570666303769 -0.57610127698437408 -0.3401369403401156
-0.25807713622784767 0.46601387759394231 0.5945258512680851  -0.74178975530654756 -0.53404105644655719 -0.40564529943251809
-0.82226795238624728 0.12310298935169572 0.55521070025011254  0.1419865239198129 -0.54699716260005027 -0.82500541278991768
-0.81389356246462441 0.11874744154864894 0.56789366986248413  -0.18423339416733697 -0.8858348623928205 -0.42585755017737503
-0.79206325863390559 0.13599230442623667 0.54146645315815212  0.11449797757819402 -0.54669933216720235 -0.82946371429884647
-0.35072013821425607 0.79530214016523215 0.26751488256855971  -0.6491335591412275 -0.2048138411337509 -0.73258235910829916
-0.31936024911295646 0.86416377447305925 0.28008469293463611  -0.6804126910192041 -0.13609530337963491 -0.72008099426245797
-0.25264179677362608 0.68197669984104492 0.41663313718873862  -0.74719269579232828 -0.31838810336562579 -0.58337988565756427
-0.47420617247402475 0.79171259951203332 0.17528355798277528  -0.52568280774650489 -0.20813967421463556 -0.82482450355065029
-0.54146645315815212 0.79206325863390559 0.13599230442623667  -0.82946371429884591 0.11449797757819456 -0.54669933216720301
-0.41285875964110375 0.2879595390318832 0.61494994375519374  -0.58712598556604001 -0.71231212670919686 -0.38457055427597059
-0.43210633013751587 0.18610643753537565 0.88125255845135109  -0.58292813064721261 -0.803265783550004 -0.12230648174951494
-0.38851819872979687 0.21891562022186895 0.87351996844576596  -0.61194488891504684 -0.78064122227310462 -0.12697533232366096
-0.43355391658479348 0.19642147525981468 0.81724226648384946  -0.52197712123390316 -0.83354385962558797 -0.18095446661755885
-0.13769549234610645 0.6240392221045663 0.66075903908278333  -0.86229745711633887 -0.37608264246842443 -0.33912378489964845
-0.17239185158024484 0.55435349976840143 0.65873185103125675  -0.82760959526572686 -0.44564173451716843 -0.34127086350966052
-0.13425781556959904 0.58161296052541844 0.72533155387381609  -0.86581974808662043 -0.41835586417422144 -0.27447137325094861
-0.17528355798277528 0.47420617247402475 0.79171259951203332  -0.82482450355065018 -0.52568280774650478 -0.20813967421463553
-0.1418121948905855 0.51101182387798272 0.84695178356442291  -0.86108611456980833 -0.4778264263271364 -0.17381774822643573
-0.49630888727061573 0.47163878825453953 0.31653113247178299  -0.50330613999724105 -0.52841879760671095 -0.68370790823052163
-0.2675148825685596 0.35072013821425618 0.79530214016523215  -0.73258235910829939 -0.64913355914122706 -0.20481384113375187
-0.37542737832173312 0.24325833978506273 0.80699455980445267  -0.62484261256047746 -0.75636980999592618 -0.19358827458119343
-0.21207173177032212 0.4878002730900024 0.65820988329399444  -0.78786613428398433 -0.51223335844459605 -0.3418829345623744
-0.51201440833835754 0.5310592350056238 0.26381753535069452  -0.48809649929758581 -0.46907539604897669 -0.73602315194220458
-0.53132295016564957 0.59367059745735695 0.21562876162628941  -0.46877433341208991 -0.40646863937642685 -0.7842409511990095
-0.64339140453754151 0.098424941615366662 0.75815048575026611  -0.36356562872995773 -0.89862238304022901 -0.24555619785558336
-0.64081678241520534 0.098941938751961223 0.76032257344343512  -0.37239734211021208 -0.89982453013548236 -0.2272356366323475
-0.60389882611563683 0.11923210876951273 0.74047778163550204  -0.39599581735923794 -0.88070834559541689 -0.25988482570664401
-0.76541504139377881 0.48428397075672935 0.17598126576074047  -0.23530638500725762 -0.51562318151862252 -0.82387113061171768
-0.5310592350056238 0.26381753535069452 0.51201440833835754  -0.46907539604897669 -0.73602315194220458 -0.48809649929758581
-0.47030020581200904 0.27380116818647493 0.56176104154254891  -0.52986930552536826 -0.72592006295091216 -0.43849581670456983
-0.54873333439274119 0.41249238098892738 0.32829084112567963  -0.45152335920120729 -0.5873747039473749 -0.67165289641182324
-0.53373393338202169 0.30883755347893571 0.44783116020585167  -0.46647300291392696 -0.69097715483087374 -0.55222595833073085
-0.21923183214566855 0.41057431319105175 0.79268760819673556  -0.78085960551688671 -0.58928970592655905 -0.20735457304096666
-0.18476429236136471 0.43787141557069931 0.86070823585565381  -0.81541586445899161 -0.56187930322157953 -0.13924301275047143
-0.2222334481665994 0.74936391388968104 0.42357936956725517  -0.77788041909855365 -0.2509811338612542 -0.57611676249591792
-0.20356854994762741 0.69630368317606428 0.47706071813732465  -0.79638679287413017 -0.30395970967362007 -0.52285425410030462
-0.17598126576074047 0.76541504139377881 0.48428397075672935  -0.82387113061171668 -0.23530638500725837 -0.51562318151862363
-0.78668082109255688 0.54662405620460941 0.13458381024047572  -0.21403145679805563 -0.45308829251399879 -0.86539097215515903
-0.84282425105969128 0.51873480041451114 0.13843733448120865  -0.1562965611548511 -0.47538384129542932 -0.86578380003692024
-0.83330295178070157 0.4938077152850564 0.15384312033167369  -0.16746624198175186 -0.50593831119476151 -0.8461568903352984
-0.30186484921791523 0.90688305806336122 0.29107512591583129  -0.69503929178689383 -0.10153183902939461 -0.71176658290178396
-0.2811508450273621 0.90641151615731863 0.31222404809805682  -0.72091363611669168 -0.10033016823457386 -0.68572398718655914
-0.79171259951203343 0.17528355798277517 0.47420617247402497  -0.20813967421463564 -0.8248245035506504 -0.52568280774650478
-0.15896669732792423 0.71592045537741111 0.53960691129913441  -0.84103034646625374 -0.28440717777405522 -0.46019616855581275
-0.66096525556418162 0.74328545761836984 0.095572989323982588  -0.33091024020101656 -0.23862737818799956 -0.91299254504581084
-0.6771336059462687 0.72858929180595311 0.094046635219543206  -0.30990719304796521 -0.27087574504909745 -0.91136373772562818
-0.69630368317606428 0.47706071813732431 0.20356854994762741  -0.3039597096736199 -0.52285425410030484 -0.79638679287413017
-0.74047778163550204 0.60389882611563683 0.11923210876951273  -0.25988482570664423 -0.39599581735923733 -0.88070834559541711
-0.71592045537741122 0.53960691129913418 0.15896669732792434  -0.2844071777740555 -0.46019616855581313 -0.84103034646625341
-0.56176104154254891 0.47030020581200904 0.27380116818647493  -0.4384958167045705 -0.52986930552536815 -0.72592006295091183
-0.37311241287933189 0.22843691950085854 0.8984470535752207  -0.63168040245028423 -0.76918721291849312 -0.096596587118426461
-0.36295261616331187 0.66456827261077822 0.30598545619885298  -0.63692575831934428 -0.33571718293160902 -0.69398814937561637
-0.58417903277383199 0.11307342108777627 0.80253395542112949  -0.42149610172113233 -0.88421545010983937 -0.20125623970685472
-0.54662405620460941 0.13458381024047572 0.78668082109255688  -0.45308829251399874 -0.86539097215515914 -0.21403145679805555
-0.38553016581808774 0.72712117915505492 0.25975411381438562  -0.61436698850995353 -0.27300775118977855 -0.74028370995146908
-0.3269812127941315 0.73182848239968035 0.31070343884806484  -0.67285685715261234 -0.26836446324214985 -0.68937955050281408
-0.89148810692249181 0.40180685413975104 0.20692923660476614  -0.10210073274615554 -0.58661618171386265 -0.80340332070769194
-0.89390471712616404 0.39369586600014284 0.21254447256850698  -0.094036448520743485 -0.60380229511960959 -0.79156802282425331
-0.61494994375519374 0.41285875964110363 0.2879595390318832  -0.38457055427597053 -0.58712598556604001 -0.71231212670919686
-0.27256483194835279 0.73894573054988522 0.36542238876277799  -0.72726265769102505 -0.26123864468751845 -0.63469945426951124
-0.29480292285486553 0.79987185965655649 0.3198192814930475  -0.70493504308661747 -0.2002956545762126 -0.68040299513329239
-0.21891562022186883 0.87351996844576596 0.38851819872979676  -0.78064122227310362 -0.12697533232365998 -0.6119448889150485
-0.21439421228553288 0.89457789356401529 0.39128013241131548  -0.77933656932774009 -0.085925101925648492 -0.62068622392279305
-0.22681489975349647 0.89805158744476077 0.37520377518580428  -0.77933656932774031 -0.085925101925652003 -0.62068622392279227
-0.24325833978506284 0.80699455980445267 0.37542737832173323  -0.75636980999592596 -0.19358827458119465 -0.62484261256047735
-0.26642231325749544 0.86816149698298051 0.33330487729716574  -0.73311225719230455 -0.13227871496285301 -0.6671197493120562
-0.90387507728811056 0.34253810440658683 0.25355721782048274  -0.098434961242603175 -0.65866036402230721 -0.74597391594557039
-0.8104943439581207 0.5727813550993911 0.11695476797072311  -0.18329374350459399 -0.42919468968314656 -0.88441806965928715
-0.82188503772742783 0.55513243511370003 0.12315882465233799  -0.18329374350458896 -0.42919468968315838 -0.88441806965928249
-0.17124343283120957 0.51303354953721536 0.72427145868031995  -0.82881098413486531 -0.48692804957249064 -0.27563277583938756
-0.82416586116838464 0.5512195414246408 0.12458499692215486  -0.17844712110944497 -0.44918580997762658 -0.87543631012341183
-0.14564781357706014 0.50275426427774217 0.85145286645038376  -0.84903903628469102 -0.49501822108782229 -0.18463389628075103
-0.18950565604187924 0.42721864490060907 0.88304523202927676  -0.80855713981694355 -0.57905836064064831 -0.1045311753650965
-0.17811496227257201 0.44486756488630003 0.87684117534766193  -0.83034168959697252 -0.54729298896532863 -0.10489548487252294
-0.21308535079965785 0.44781653569081092 0.72457531588943425  -0.78691259802683056 -0.55218785652865865 -0.27542173873706743
-0.80253395542112949 0.58417903277383187 0.11307342108777627  -0.20125623970685647 -0.42149610172113344 -0.88421545010983849
-0.57278135509939099 0.11695476797072324 0.8104943439581207  -0.42919468968314656 -0.8844180696592876 -0.18329374350459177
-0.55513243511370003 0.12315882465233802 0.82188503772742816  -0.42919468968314917 -0.88441806965928671 -0.1832937435045901
-0.25975411381438562 0.38553016581808774 0.72712117915505492  -0.74028370995146908 -0.61436698850995353 -0.2730077511897786
-0.69598720512098966 0.66433279178978177 0.10842625325651789  -0.3042205231831675 -0.3355025674440662 -0.89156486051918826
-0.71089969747156689 0.69602657944578872 0.093129265416474039  -0.28893990864387442 -0.30244718988225744 -0.90831680955776384
-0.73781627941851213 0.66704995977036097 0.095052466200525487  -0.26739523938910531 -0.33340690397517547 -0.90406837259895956
-0.59899507473160241 0.59519261004110258 0.17821777401482342  -0.40115992505181963 -0.40477696304846328 -0.82172156155091947
-0.57848122801663848 0.53136426493733913 0.22366085201896557  -0.42177409750733513 -0.46868822204941807 -0.77616877106981597
-0.15384312033167369 0.83330295178070157 0.4938077152850564  -0.84615689033530117 -0.1674662419817517 -0.50593831119475696
-0.19642147525981468 0.81724226648384946 0.43355391658479359  -0.83354385962558741 -0.18095446661756134 -0.52197712123390316
-0.6240392221045663 0.66075903908278333 0.13769549234610645  -0.37608264246842399 -0.33912378489964834 -0.86229745711633909
-0.34253810440658672 0.25355721782048268 0.90387507728811034  -0.65866036402230654 -0.74597391594557094 -0.098434961242603078
-0.41663313718873862 0.25264179677362608 0.68197669984104492  -0.5833798856575646 -0.74719269579232772 -0.3183881033656264
-0.47222747306573276 0.23616371904645006 0.62850263027516917  -0.52785497534633896 -0.76364675610270649 -0.37176976328896
-0.44478929974988746 0.17773204761375266 0.87689701064830428  -0.51070307098913981 -0.84318764111161182 -0.16797909143371778
-0.44478929974988757 0.17773204761375261 0.87689701064830428  -0.49121775846011023 -0.85331277880252021 -0.1748210951394196
-0.59367059745735717 0.2156287616262893 0.53132295016564957  -0.40646863937642869 -0.78424095119900827 -0.46877433341209018
-0.5945258512680851 0.25807713622784767 0.46601387759394231  -0.40564529943251809 -0.74178975530654756 -0.53404105644655719
-0.65820988329399444 0.21207173177032212 0.4878002730900024  -0.34188293456237429 -0.78786613428398433 -0.51223335844459605
-0.87684117534766193 0.17811496227257195 0.44486756488630008  -0.10489548487252756 -0.83034168959697552 -0.54729298896532308
-0.87541500307784526 0.17583413883161553 0.44878045857535936  -0.11550620576389463 -0.83926746233112071 -0.53130823737479327
-0.11307342108777632 0.80253395542112949 0.58417903277383187  -0.88421545010983937 -0.20125623970685502 -0.42149610172113222
-0.13458381024047572 0.78668082109255688 0.54662405620460941  -0.86539097215515881 -0.21403145679805588 -0.4530882925139989
-0.73182848239968035 0.31070343884806484 0.3269812127941315  -0.26836446324215035 -0.68937955050281352 -0.67285685715261245
-0.1974660445788706 0.41582096722616779 0.88692657891222382  -0.79565076497466403 -0.59478368364253509 -0.11477033531295806
-0.86055952199012919 0.15594877494016784 0.48342144068564108  -0.13950752053012494 -0.83662429167606878 -0.52971449507546309
-0.62850263027516917 0.47222747306573276 0.23616371904645006  -0.37176976328896016 -0.52785497534633918 -0.76364675610270627
-0.90641151615731874 0.31222404809805687 0.28115084502736221  -0.10033016823457513 -0.68572398718655969 -0.72091363611669101
-0.86416377447305925 0.280084692934636 0.31936024911295635  -0.13609530337963746 -0.72008099426245564 -0.68041269101920621
-0.64637064705828351 0.53443495637683425 0.18870753060675916  -0.35387698305874338 -0.46550486715932277 -0.81121902067950991
-0.66879190536298361 0.59872297720557632 0.146022278379488  -0.33139575632083168 -0.40118660278746882 -0.85394740027497806
-0.2284369195008584 0.89844705357522048 0.37311241287933194  -0.7691872129184949 -0.096596587118420188 -0.6316804024502829
-0.88304523202927687 0.18950565604187924 0.42721864490060901  -0.10453117536509793 -0.80855713981694277 -0.57905836064064919
-0.86156266551879135 0.15717574894030889 0.48126519958548886  -0.11550620576387223 -0.8392674623311227 -0.53130823737479504
-0.10243968818147731 0.65340002742402614 0.72750422818221494  -0.89759648615318954 -0.34672764240957105 -0.27221405186828218
-0.09404663521954322 0.6771336059462687 0.72858929180595311  -0.91136373772562829 -0.30990719304796466 -0.27087574504909778
-0.093588483842681258 0.68777595190194329 0.7188491549726379  -0.90562084821138222 -0.30687826798314843 -0.29270566773562745
-0.79307076339523386 0.10851189307750797 0.59819314586024919  -0.20738833035095577 -0.88183387534488111 -0.42350808342754381
-0.72533155387381609 0.13425781556959904 0.58161296052541844  -0.27447137325094861 -0.86581974808662043 -0.41835586417422144
-0.2304221614978238 0.37659777085683754 0.86172631781262776  -0.76972539034249332 -0.62320039727703413 -0.13836216352689382
-0.21405999957086966 0.39229183849441451 0.893825128737608  -0.79565076497466514 -0.5947836836425332 -0.11477033531296049
-0.41057431319105175 0.79268760819673556 0.21923183214566855  -0.58928970592655916 -0.20735457304096672 -0.78085960551688671
-0.10563529941394462 0.78429103445404746 0.61001812379817821  -0.89982453013547881 -0.22723563663234655 -0.37239734211022091
-0.10617487126239181 0.78594000042913048 0.60770816150558549  -0.89197584375895012 -0.22324532177533457 -0.39311654818378772
-0.30397342055421117 0.90687073458352596 0.28910030252843322  -0.68096837004796495 -0.091975091050975982 -0.726514047779107
-0.33295004022963903 0.90494753379947446 0.2621837205814882  -0.68096837004796074 -0.091975091050969779 -0.72651404777911177
-0.90688305806336122 0.29107512591583123 0.30186484921791512  -0.10153183902938931 -0.71176658290179085 -0.6950392917868875
-0.33544566672286746 0.90463734990484679 0.25988381527545978  -0.66756092552179358 -0.10275236361909904 -0.73743092048487824
-0.35660859546245854 0.90157505838463314 0.24184951424973428  -0.65387638494521072 -0.11348698498785352 -0.74804169499390172
-0.65873185103125675 0.17239185158024484 0.55435349976840143  -0.34127086350966052 -0.82760959526572686 -0.44564173451716843
-0.66075903908278333 0.13769549234610645 0.6240392221045663  -0.33912378489964845 -0.86229745711633887 -0.37608264246842443
-0.66433279178978177 0.10842625325651789 0.69598720512098966  -0.33550256744406565 -0.89156486051918848 -0.30422052318316761
-0.59872297720557655 0.14602227837948789 0.66879190536298361  -0.40118660278746798 -0.85394740027497873 -0.33139575632083107
-0.35918321758479477 0.90105806124803856 0.2396774265565649  -0.6391363644711574 -0.10365825365836158 -0.76207589783373331
-0.38998187620182156 0.89436470058605533 0.2157089655459527  -0.60955597917046789 -0.10429556095739143 -0.78585236795603985
-0.39229183849441457 0.893825128737608 0.21405999957086966  -0.59478368364252665 -0.11477033531296484 -0.79565076497466936
-0.4938077152850564 0.15384312033167369 0.83330295178070157  -0.50593831119476118 -0.8461568903352984 -0.16746624198175186
-0.48428397075672935 0.17598126576074047 0.76541504139377881  -0.51562318151862274 -0.82387113061171757 -0.23530638500725776
-0.87149140923129176 0.45766135056489032 0.17031256632806041  -0.1421893094643126 -0.5308742118974118 -0.83543687458500648
-0.42721864490060907 0.88304523202927676 0.18950565604187924  -0.57905836064064853 -0.1045311753650965 -0.80855713981694344
-0.44486756488630003 0.87684117534766193 0.17811496227257201  -0.54729298896532785 -0.10489548487252347 -0.83034168959697296
-0.44878045857535931 0.87541500307784514 0.17583413883161553  -0.53130823737479782 -0.11550620576389242 -0.83926746233111804
-0.48126519958548886 0.86156266551879135 0.15717574894030889  -0.53130823737479482 -0.11550620576387369 -0.8392674623311227
-0.48342144068564108 0.86055952199012919 0.15594877494016784  -0.5297144950754632 -0.13950752053012463 -0.83662429167606889
-0.50017470245974227 0.85269038907862327 0.14688267020077073  -0.51152737254410519 -0.17406896607439884 -0.84145097432227989
-0.50275426427774217 0.85145286645038376 0.14564781357706019  -0.49501822108782267 -0.18463389628074997 -0.84903903628469102
-0.51101182387798261 0.84695178356442291 0.1418121948905855  -0.47782642632713779 -0.1738177482264345 -0.86108611456980788
-0.72457531588943425 0.21308535079965785 0.44781653569081092  -0.27542173873706716 -0.78691259802683089 -0.55218785652865821
-0.13843733448120882 0.84282425105969117 0.51873480041451081  -0.86578380003691935 -0.15629656115484478 -0.47538384129543304
-0.12458499692215494 0.8241658611683842 0.55121954142464069  -0.8754363101234176 -0.17844712110944952 -0.44918580997761376
-0.59819314586024919 0.79307076339523386 0.10851189307750808  -0.42350808342754237 -0.20738833035095647 -0.88183387534488167
-0.60630413399985716 0.78745552743149316 0.10609528287383588  -0.42092243512975569 -0.23042761042597448 -0.87734110809753574
-0.60871986758868468 0.7856057877144671 0.10542210643598449  -0.40347958770452141 -0.24084616951439972 -0.88272155572186539
-0.68777595190194318 0.71884915497263779 0.093588483842681258  -0.30687826798314988 -0.2927056677356259 -0.90562084821138222
-0.70892487408416871 0.69813515078208477 0.093116941936638775  -0.30687826798315454 -0.29270566773562146 -0.90562084821138211
-0.53960691129913441 0.15896669732792423 0.71592045537741111  -0.46019616855581275 -0.84103034646625374 -0.28440717777405522
-0.74011618472454055 0.66455433327713243 0.095362650095153087  -0.26377483182397443 -0.35458300388089659 -0.8970472292220929
-0.095052466200525557 0.7378162794185118 0.66704995977036108  -0.90406837259896011 -0.26739523938910531 -0.33340690397517397
-0.61001812379817832 0.1056352994139447 0.78429103445404746  -0.37239734211019399 -0.89982453013548891 -0.2272356366323508
-0.39128013241131554 0.21439421228553296 0.89457789356401551  -0.62068622392279083 -0.77933656932774165 -0.085925101925650879
-0.37520377518580433 0.2268148997534965 0.89805158744476099  -0.62068622392279449 -0.77933656932773798 -0.085925101925657416
-0.42357936956725517 0.2222334481665994 0.74936391388968104  -0.57611676249591803 -0.77788041909855332 -0.25098113386125454
-0.47706071813732454 0.2035685499476273 0.69630368317606428  -0.52285425410030473 -0.79638679287413017 -0.30395970967362002
-0.84405122505983243 0.51657855931435837 0.13944047800987086  -0.13902973540250699 -0.48165648852028187 -0.86526167125339637
-0.85311732979922938 0.49982529754025784 0.14730961092137679  -0.13902973540250152 -0.48165648852027632 -0.86526167125340026
-0.85435218642293986 0.49724573572225761 0.14854713354961632  -0.13337026124728302 -0.50082503649439758 -0.85521146872292175
-0.85818780510941439 0.48898817612201739 0.15304821643557714  -0.12764403935076005 -0.51974293683794126 -0.84473325897900675
-0.093116941936638664 0.70892487408416871 0.69813515078208499  -0.90562084821138389 -0.30687826798314355 -0.29270566773562745
-0.89457789356401518 0.39128013241131554 0.21439421228553296  -0.085925101925655112 -0.62068622392278239 -0.77933656932774786
-0.89805158744476099 0.37520377518580428 0.22681489975349656  -0.085925101925653266 -0.62068622392278971 -0.7793365693277422
-0.89844705357522048 0.37311241287933194 0.22843691950085848  -0.096596587118421631 -0.63168040245028001 -0.76918721291849712
-0.79987185965655649 0.3198192814930475 0.29480292285486542  -0.20029565457621079 -0.68040299513329394 -0.7049350430866167
-0.90687073458352596 0.28910030252843322 0.30397342055421112  -0.091975091050968044 -0.72651404777911632 -0.68096837004795607
-0.90494753379947435 0.26218372058148809 0.33295004022963903  -0.09197509105096896 -0.72651404777911277 -0.68096837004795985
-0.90463734990484679 0.25988381527545973 0.33544566672286741  -0.10275236361909779 -0.7374309204848789 -0.66756092552179302
-0.90157505838463314 0.24184951424973419 0.35660859546245843  -0.11348698498785316 -0.74804169499390172 -0.65387638494521072
-0.12850859076870802 0.5423386494351099 0.82968743367193953  -0.8726529832451867 -0.46036815782147361 -0.16290466567087283
-0.85269038907862327 0.14688267020077067 0.50017470245974227  -0.17406896607440767 -0.84145097432228499 -0.51152737254409342
-0.85145286645038376 0.14564781357706019 0.50275426427774228  -0.18463389628075721 -0.84903903628469579 -0.49501822108781179
-0.84695178356442291 0.1418121948905855 0.51101182387798261  -0.17381774822643642 -0.86108611456980844 -0.4778264263271359
-0.72427145868031995 0.17124343283120957 0.51303354953721536  -0.27563277583938722 -0.82881098413486542 -0.48692804957249064
-0.25355721782048268 0.90387507728811056 0.34253810440658672  -0.74597391594556905 -0.098434961242601149 -0.65866036402230899
-0.25671454238163 0.90442701067601727 0.33903474443581866  -0.73279395097326672 -0.089584884642380694 -0.67452766723137525
-0.78745552743149327 0.10609528287383579 0.60630413399985716  -0.23042761042597421 -0.87734110809753507 -0.42092243512975747
-0.7856057877144671 0.1054221064359844 0.60871986758868468  -0.24084616951439833 -0.88272155572186395 -0.40347958770452563
-0.77318510024650355 0.10194841255523886 0.62479622481419606  -0.23977066491307256 -0.89859032272363271 -0.36748531964499037
-0.72750422818221494 0.10243968818147731 0.65340002742402614  -0.27221405186828201 -0.89759648615318943 -0.3467276424095711
-0.78429103445404746 0.6100181237981781 0.10563529941394456  -0.22723563663234803 -0.37239734211022291 -0.8998245301354777
-0.78594000042913048 0.60770816150558526 0.10617487126239181  -0.22324532177533571 -0.3931165481837911 -0.89197584375894834
-0.7188491549726379 0.093588483842681258 0.68777595190194329  -0.29270566773562778 -0.90562084821138222 -0.30687826798314849
-0.69813515078208488 0.093116941936638664 0.70892487408416871  -0.29270566773562989 -0.90562084821138422 -0.30687826798314011
-0.69602657944578872 0.09312926541647408 0.71089969747156689  -0.30244718988226571 -0.90831680955776661 -0.28893990864385721
-0.66704995977036097 0.095052466200525487 0.73781627941851213  -0.33340690397517442 -0.90406837259895989 -0.26739523938910548
-0.66455433327713243 0.095362650095153115 0.74011618472454044  -0.35458300388089614 -0.89704722922209301 -0.26377483182397454
-0.4576613505648901 0.17031256632806047 0.87149140923129198  -0.53087421189741213 -0.83543687458500637 -0.14218930946431241
-0.51873480041451092 0.13843733448120876 0.84282425105969128  -0.47538384129543526 -0.86578380003691979 -0.15629656115483562
-0.51657855931435848 0.13944047800987086 0.84405122505983243  -0.48165648852028631 -0.86526167125339626 -0.1390297354024923
-0.49982529754025784 0.14730961092137679 0.85311732979922927  -0.48165648852027843 -0.86526167125339926 -0.13902973540250141
-0.49724573572225761 0.14854713354961635 0.85435218642293975  -0.50082503649440013 -0.85521146872292031 -0.13337026124728185
-0.5512195414246408 0.12458499692215487 0.82416586116838453  -0.44918580997761759 -0.87543631012341605 -0.17844712110944738
-0.4889881761220175 0.15304821643557709 0.85818780510941428  -0.51974293683794004 -0.84473325897900731 -0.12764403935075999
-0.18610643753537565 0.88125255845135109 0.43210633013751576  -0.803265783550005 -0.12230648174951479 -0.58292813064721116
-0.40180685413975104 0.20692923660476614 0.89148810692249203  -0.5866161817138611 -0.80340332070769316 -0.10210073274615575
-0.39369586600014284 0.21254447256850689 0.89390471712616426  -0.60380229511961647 -0.79156802282424821 -0.094036448520741819
-0.29107512591583118 0.30186484921791523 0.90688305806336111  -0.71176658290178951 -0.69503929178688884 -0.10153183902938953
-0.28910030252843322 0.30397342055421112 0.90687073458352596  -0.72651404777911321 -0.68096837004795918 -0.091975091050969751
-0.26218372058148809 0.33295004022963903 0.90494753379947435  -0.72651404777911355 -0.68096837004795885 -0.091975091050969598
-0.25988381527545967 0.33544566672286746 0.9046373499048469  -0.73743092048488035 -0.66756092552179125 -0.10275236361909888
-0.13944047800987086 0.84405122505983243 0.51657855931435837  -0.86526167125339581 -0.13902973540250196 -0.48165648852028409
-0.14730961092137673 0.85311732979922927 0.49982529754025784  -0.86526167125339193 -0.13902973540249708 -0.48165648852029269
-0.24184951424973422 0.35660859546245849 0.90157505838463314  -0.74804169499390449 -0.65387638494520794 -0.11348698498785119
-0.23967742655656488 0.35918321758479488 0.90105806124803856  -0.76207589783374741 -0.6391363644711423 -0.10365825365835028
-0.21570896554595276 0.38998187620182156 0.89436470058605511  -0.78585236795603508 -0.60955597917047488 -0.10429556095738585
-0.5423386494351099 0.82968743367193953 0.12850859076870802  -0.46036815782147295 -0.16290466567087286 -0.87265298324518703
-0.17031256632806052 0.87149140923129198 0.45766135056488999  -0.83543687458500626 -0.14218930946431413 -0.5308742118974118
-0.15594877494016784 0.48342144068564108 0.86055952199012919  -0.83662429167606489 -0.52971449507545842 -0.13950752053016663
-0.14688267020077073 0.50017470245974227 0.85269038907862316  -0.841450974322278 -0.51152737254410885 -0.17406896607439667
-0.12310298935169575 0.55521070025011254 0.82226795238624728  -0.53327406489332096 -0.82790895881410698 0.17373982740723351
-0.12310298935169572 0.55521070025011254 0.82226795238624728  -0.54968722070380216 -0.8192764596721801 0.16318713804080384
-0.60770816150558538 0.10617487126239183 0.78594000042913037  -0.39311654818376113 -0.89197584375896022 -0.22324532177534065
-0.10609528287383586 0.60630413399985694 0.78745552743149316  -0.8773411080975384 -0.42092243512974681 -0.23042761042598092
-0.1054221064359845 0.60871986758868468 0.78560578771446687  -0.88272155572186761 -0.40347958770451392 -0.24084616951440482
-0.10194841255523887 0.62479622481419628 0.77318510024650311  -0.89859032272365447 -0.36748531964495296 -0.23977066491304833
-0.093129265416474122 0.71089969747156689 0.69602657944578861  -0.90831680955776617 -0.28893990864386143 -0.30244718988226327
-0.11695476797072325 0.81049434395812059 0.57278135509939099  -0.8844180696592876 -0.18329374350459199 -0.42919468968314661
-0.12315882465233809 0.82188503772742783 0.55513243511370003  -0.88441806965928849 -0.18329374350459163 -0.42919468968314495
-0.14854713354961635 0.85435218642293975 0.49724573572225772  -0.85521146872291565 -0.13337026124727644 -0.50082503649440979
-0.15304821643557709 0.8581878051094145 0.48898817612201739  -0.84473325897900953 -0.12764403935076055 -0.51974293683793649
-0.90105806124803867 0.23967742655656488 0.35918321758479488  -0.10365825365834472 -0.76207589783375485 -0.63913636447113442
-0.20692923660476614 0.89148810692249181 0.40180685413975092  -0.80340332070769493 -0.10210073274615485 -0.58661618171385899
-0.21254447256850684 0.89390471712616404 0.39369586600014272  -0.79156802282424854 -0.094036448520740834 -0.60380229511961614
-0.271410708194047 0.90595336478045674 0.32286639405373113  -0.73279395097327094 -0.089584884642380916 -0.67452766723137081
-0.17773204761375266 0.87689701064830428 0.44478929974988746  -0.8431876411116126 -0.16797909143371931 -0.51070307098913825
-0.17773204761375261 0.87689701064830428 0.44478929974988757  -0.85331277880251977 -0.17482109513942032 -0.49121775846011068
-0.095572989323982657 0.66096525556418162 0.74328545761836984  -0.91299254504581251 -0.33091024020101323 -0.23862737818799784
-0.096124922711889493 0.65746189559341328 0.74644278217951743  -0.90894237800239819 -0.3488969399841057 -0.22824258748330259
-0.10155294642477933 0.62688758712066828 0.77156308049914146  -0.90894237800240729 -0.34889693998408949 -0.22824258748329093
-0.15717574894030886 0.48126519958548875 0.86156266551879135  -0.83926746233111815 -0.53130823737479316 -0.11550620576391485
-0.1758341388316155 0.44878045857535931 0.87541500307784526  -0.83926746233111738 -0.53130823737479949 -0.11550620576389151
-0.65746189559341328 0.74644278217951743 0.096124922711889452  -0.34889693998411037 -0.22824258748330298 -0.9089423780023963
-0.55521070025011254 0.82226795238624728 0.12310298935169572  -0.82500541278991768 0.14198652391981292 -0.54699716260005027
-0.56789366986248413 0.81389356246462441 0.11874744154864894  -0.42585755017737426 -0.18423339416733803 -0.88583486239282072
-0.82226795238624728 0.12310298935169575 0.55521070025011254  0.15282936104497993 -0.53077402771794835 -0.83361988814006216
-0.82968743367193953 0.12850859076870802 0.5423386494351099  -0.16290466567087286 -0.87265298324518703 -0.46036815782147295
-0.72858929180595311 0.094046635219543179 0.67713360594626881  -0.27087574504909789 -0.91136373772562818 -0.30990719304796477
-0.74328545761837006 0.095572989323982602 0.66096525556418162  -0.23862737818799901 -0.91299254504581306 -0.3309102402010109
-0.74644278217951743 0.096124922711889466 0.65746189559341328  -0.22824258748330467 -0.90894237800239863 -0.34889693998410287
-0.77156308049914157 0.1015529464247792 0.62688758712066828  -0.2282425874833155 -0.90894237800238642 -0.34889693998412763
-0.88692657891222382 0.1974660445788706 0.41582096722616779  -0.11477033531295869 -0.79565076497466314 -0.5947836836425362
-0.893825128737608 0.21405999957086963 0.39229183849441451  -0.11477033531296069 -0.79565076497466491 -0.59478368364253331
-0.89436470058605533 0.2157089655459527 0.38998187620182156  -0.10429556095738564 -0.78585236795603453 -0.60955597917047577
-0.87689701064830428 0.44478929974988757 0.17773204761375266  -0.14246063051294039 -0.57899414632358714 -0.80278935423738407
-0.87689701064830428 0.44478929974988757 0.17773204761375266  -0.15667459091348981 -0.54178151488020398 -0.82578802528021811
-0.76032257344343512 0.64081678241520534 0.098941938751961195  -0.2272356366323571 -0.37239734211020747 -0.8998245301354818
-0.758150485750266 0.64339140453754151 0.098424941615366718  -0.24555619785558999 -0.36356562872995413 -0.89862238304022868
-0.55521070025011254 0.82226795238624728 0.12310298935169575  -0.83361988814006216 0.15282936104497993 -0.53077402771794835
-3  0 1 2
-3  3 4 5
-3  6 7 8
-3  9 10 11
-3  12 13 14
-3  15 16 17
-3  18 13 12
-3  14 13 19
-3  12 20 21
-3  22 23 24
-3  25 26 27
-3  19 13 28
-3  29 23 30
-3  28 13 31
-3  32 33 34
-3  35 36 37
-3  38 39 40
-3  31 13 18
-3  41 42 43
-3  44 45 38
-3  46 47 37
-3  12 42 18
-3  18 42 41
-3  43 42 48
-3  48 42 21
-3  35 49 19
-3  21 42 12
-3  50 51 52
-3  46 36 53
-3  54 55 56
-3  57 54 58
-3  21 20 59
-3  60 61 62
-3  63 64 40
-3  41 65 66
-3  37 36 46
-3  59 20 67
-3  67 20 68
-3  69 70 11
-3  71 72 8
-3  68 20 14
-3  14 20 12
-3  73 74 75
-3  14 49 68
-3  9 76 77
-3  78 79 80
-3  68 49 81
-3  25 82 83
-3  84 85 6
-3  86 87 88
-3  78 89 90
-3  81 49 91
-3  31 85 28
-3  91 49 35
-3  30 23 22
-3  92 93 11
-3  66 94 8
-3  19 49 14
-3  95 96 97
-3  98 99 100
-3  53 36 28
-3  19 36 35
-3  101 102 60
-3  59 103 21
-3  83 104 5
-3  28 36 19
-3  105 25 5
-3  28 85 53
-3  53 85 106
-3  106 85 84
-3  107 76 108
-3  109 110 111
-3  112 73 30
-3  113 51 114
-3  6 85 31
-3  31 7 6
-3  34 33 115
-3  113 65 116
-3  117 118 101
-3  119 120 121
-3  8 7 66
-3  116 65 43
-3  122 123 124
-3  66 7 41
-3  125 90 126
-3  48 33 43
-3  43 65 41
-3  40 64 127
-3  128 120 37
-3  41 7 18
-3  0 129 130
-3  22 131 30
-3  18 7 31
-3  116 33 32
-3  66 65 114
-3  114 65 113
-3  48 103 115
-3  43 33 116
-3  128 47 54
-3  115 33 48
-3  132 122 133
-3  115 103 134
-3  134 103 107
-3  107 103 59
-3  21 103 48
-3  59 76 107
-3  108 76 9
-3  96 135 25
-3  77 76 67
-3  67 76 59
-3  67 136 77
-3  111 137 138
-3  77 136 139
-3  139 136 140
-3  75 141 142
-3  140 136 81
-3  81 136 68
-3  34 143 24
-3  68 136 67
-3  81 144 140
-3  140 144 145
-3  146 147 148
-3  145 144 149
-3  149 144 119
-3  119 144 91
-3  91 144 81
-3  91 120 119
-3  121 120 128
-3  37 120 35
-3  145 150 90
-3  35 120 91
-3  37 47 128
-3  151 16 15
-3  54 47 58
-3  58 47 98
-3  98 47 46
-3  122 152 153
-3  46 99 98
-3  100 99 154
-3  1 0 69
-3  154 99 106
-3  122 153 155
-3  3 72 71
-3  106 99 53
-3  156 102 101
-3  53 99 46
-3  157 158 118
-3  106 159 154
-3  122 160 152
-3  154 159 101
-3  101 159 117
-3  138 161 162
-3  117 159 163
-3  164 165 166
-3  167 168 108
-3  163 159 84
-3  84 159 106
-3  169 170 121
-3  114 94 66
-3  84 72 163
-3  167 70 171
-3  163 72 3
-3  172 26 25
-3  8 72 6
-3  9 70 108
-3  6 72 84
-3  8 94 71
-3  71 94 173
-3  173 94 174
-3  174 94 114
-3  114 51 174
-3  175 97 176
-3  174 51 50
-3  52 51 177
-3  177 51 113
-3  113 178 177
-3  177 178 179
-3  179 178 44
-3  180 181 64
-3  44 178 32
-3  32 178 116
-3  54 182 183
-3  116 178 113
-3  32 45 44
-3  38 45 184
-3  184 45 24
-3  24 45 34
-3  34 45 32
-3  157 118 185
-3  24 143 22
-3  64 186 127
-3  22 143 187
-3  15 188 189
-3  190 191 133
-3  187 143 134
-3  146 192 150
-3  134 143 115
-3  115 143 34
-3  134 168 187
-3  187 168 190
-3  64 193 180
-3  190 168 167
-3  64 194 186
-3  108 168 107
-3  112 131 133
-3  107 168 134
-3  108 70 167
-3  171 70 69
-3  195 196 197
-3  198 199 88
-3  63 39 189
-3  11 70 9
-3  11 10 92
-3  185 200 201
-3  92 10 202
-3  202 10 139
-3  54 203 204
-3  139 10 77
-3  77 10 9
-3  139 89 202
-3  202 89 78
-3  90 89 145
-3  145 89 140
-3  140 89 139
-3  126 90 150
-3  125 205 90
-3  90 205 206
-3  207 189 188
-3  90 206 208
-3  208 209 90
-3  52 210 211
-3  209 78 90
-3  212 213 211
-3  214 78 209
-3  214 215 78
-3  216 78 215
-3  52 213 50
-3  216 79 78
-3  217 97 218
-3  219 73 124
-3  79 220 80
-3  80 220 221
-3  221 222 80
-3  80 222 223
-3  78 80 202
-3  80 223 224
-3  224 92 80
-3  202 80 92
-3  225 92 224
-3  225 226 92
-3  227 92 226
-3  227 93 92
-3  127 228 40
-3  57 55 54
-3  11 93 69
-3  229 183 230
-3  231 69 93
-3  232 69 231
-3  233 69 232
-3  233 1 69
-3  71 4 3
-3  69 0 171
-3  171 0 164
-3  234 164 0
-3  235 164 234
-3  130 234 0
-3  165 164 235
-3  111 138 236
-3  166 237 164
-3  237 132 164
-3  123 122 155
-3  58 238 57
-3  132 191 164
-3  239 111 110
-3  5 104 3
-3  164 191 171
-3  171 191 167
-3  167 191 190
-3  50 213 236
-3  133 191 132
-3  96 240 241
-3  133 122 112
-3  242 243 218
-3  112 122 124
-3  124 123 244
-3  124 244 245
-3  124 245 246
-3  124 246 247
-3  124 247 219
-3  124 73 112
-3  197 248 58
-3  30 73 29
-3  29 73 75
-3  75 74 141
-3  75 142 249
-3  75 249 250
-3  75 250 251
-3  251 15 75
-3  75 15 29
-3  29 15 252
-3  252 15 189
-3  218 97 242
-3  207 253 189
-3  189 253 254
-3  255 189 254
-3  255 256 189
-3  256 63 189
-3  189 39 252
-3  252 39 184
-3  184 39 38
-3  40 39 63
-3  50 243 174
-3  60 102 257
-3  258 127 186
-3  258 259 127
-3  260 127 259
-3  260 88 127
-3  127 88 261
-3  262 263 150
-3  261 88 199
-3  264 199 198
-3  265 199 264
-3  265 266 199
-3  266 267 199
-3  199 267 211
-3  132 268 269
-3  211 267 212
-3  96 241 135
-3  270 212 267
-3  270 271 212
-3  271 272 212
-3  212 272 273
-3  212 273 274
-3  274 111 212
-3  111 213 212
-3  100 195 98
-3  211 213 52
-3  236 213 111
-3  176 97 275
-3  236 138 218
-3  218 138 217
-3  276 217 138
-3  217 276 277
-3  217 277 278
-3  217 278 279
-3  280 276 138
-3  279 281 217
-3  217 281 275
-3  170 282 146
-3  275 97 217
-3  242 97 105
-3  105 97 96
-3  95 283 96
-3  284 96 283
-3  284 240 96
-3  172 25 135
-3  184 23 252
-3  25 27 82
-3  285 83 82
-3  83 285 286
-3  83 286 287
-3  83 287 288
-3  169 289 290
-3  291 83 288
-3  83 291 200
-3  291 292 200
-3  24 23 184
-3  292 293 200
-3  227 294 93
-3  293 201 200
-3  187 131 22
-3  185 118 200
-3  200 118 117
-3  295 170 169
-3  118 296 101
-3  151 15 251
-3  297 101 296
-3  156 101 297
-3  60 257 298
-3  60 298 299
-3  300 111 239
-3  60 299 61
-3  60 62 100
-3  301 100 62
-3  301 302 100
-3  15 17 188
-3  302 303 100
-3  303 195 100
-3  98 195 58
-3  197 58 195
-3  248 304 58
-3  58 304 238
-3  54 56 203
-3  182 54 204
-3  183 182 305
-3  183 305 306
-3  183 306 230
-3  183 229 169
-3  169 229 289
-3  169 290 307
-3  307 308 169
-3  169 308 295
-3  121 170 119
-3  119 170 149
-3  309 63 256
-3  149 170 146
-3  146 282 310
-3  146 310 311
-3  311 147 146
-3  146 148 192
-3  262 150 192
-3  150 263 312
-3  150 312 126
-3  88 87 198
-3  146 150 149
-3  149 150 145
-3  282 170 313
-3  313 170 314
-3  314 170 295
-3  211 210 199
-3  121 183 169
-3  128 183 121
-3  54 183 128
-3  195 315 196
-3  315 195 316
-3  316 195 317
-3  303 317 195
-3  154 60 100
-3  101 60 154
-3  118 318 296
-3  118 319 318
-3  118 158 319
-3  117 104 200
-3  200 104 83
-3  3 104 163
-3  242 4 173
-3  163 104 117
-3  5 4 105
-3  105 4 242
-3  0 2 320
-3  173 4 71
-3  173 243 242
-3  218 243 236
-3  236 243 50
-3  93 321 322
-3  174 243 173
-3  5 25 83
-3  96 25 105
-3  175 95 97
-3  261 228 127
-3  138 162 280
-3  40 228 38
-3  138 137 161
-3  137 111 300
-3  274 109 111
-3  199 210 261
-3  261 210 179
-3  179 210 177
-3  323 88 324
-3  177 210 52
-3  179 228 261
-3  38 228 44
-3  44 228 179
-3  267 325 270
-3  326 325 267
-3  267 327 326
-3  267 328 327
-3  267 266 328
-3  86 88 323
-3  260 324 88
-3  64 181 194
-3  193 64 329
-3  329 64 63
-3  329 63 330
-3  331 330 63
-3  309 331 63
-3  252 23 29
-3  30 131 112
-3  133 131 190
-3  190 131 187
-3  74 73 332
-3  332 73 333
-3  333 73 219
-3  160 122 132
-3  269 160 132
-3  132 334 268
-3  132 335 334
-3  335 132 237
-3  0 320 129
-3  93 322 231
-3  321 93 336
-3  336 93 294
-
diff --git a/Data/data/meshes/polyhedral_complex_of_spheres/Sphere1.off b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere1.off
index 5fdcdf1dfbf0..56690a7cd58b 100644
--- a/Data/data/meshes/polyhedral_complex_of_spheres/Sphere1.off
+++ b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere1.off
@@ -1,6626 +1,6620 @@
-NOFF
-2352 4270 0
+OFF
+2351 4265 0
 
-1.2256505459452103e-18 0.52573111211913359 0.85065080835203988  1.388661766875189e-17 0.52573111211913404 0.85065080835203954
-1.2256505459452101e-18 0.52573111211913348 -0.85065080835203999  -1.0484396339907674e-15 0.52573111211913315 -0.85065080835204021
--1.2256505459452103e-18 -0.52573111211913359 0.85065080835203988  -9.9611599730051306e-17 -0.52573111211913437 0.85065080835203932
-1.2256505459452103e-18 -0.52573111211913359 -0.85065080835203988  9.9611599730051306e-17 -0.52573111211913437 -0.85065080835203932
-0.52573111211913348 0.8506508083520401 2.4513010918904207e-18  0.5257311121191327 0.85065080835204043 6.9433088343759452e-18
-0.65693999760682842 -0.28335434223766309 0.69755165300174249  0.64093662140152763 -0.29301330949338761 0.70946701671474999
--0.52573111211913359 0.85065080835203988 -1.2256505459452105e-18  -0.52573111211913337 0.8506508083520401 -1.388661766875189e-17
--0.52573111211913359 -0.85065080835203988 1.2256505459452103e-18  -0.52573111211913337 -0.8506508083520401 6.9433088343759452e-18
-0.65068017874670425 -0.29325931385704496 0.69911600851089584  0.64093662140152674 -0.29301330949339122 0.7094670167147491
-0.5673118184816528 -0.42664579118104884 0.70294074606773105  0.56065793252598239 -0.42546670457134783 0.71038071904922118
--0.85065080835203988 -1.2256505459452103e-18 0.52573111211913359  -0.85065080835204032 0 0.52573111211913282
--0.85065080835203988 0 -0.52573111211913359  -0.8506508083520401 1.388661766875189e-17 -0.52573111211913337
-0.35682208977308999 -6.1608256340360548e-19 0.93417235896271567  0.35662245495100658 0.00037008290847638232 0.9342485149377322
-0.096124922711889493 0.65746189559341328 0.74644278217951743  0.098434961242597513 0.65866036402231631 0.74597391594556317
--1.2321651268072113e-18 0.93417235896271567 0.35682208977308999  6.2516454557622656e-17 0.9340197911216388 0.35722126167557611
--0.57735026918962573 0.57735026918962573 0.57735026918962573  -0.57762605998672456 0.57702725326215809 0.57739733617063216
--0.3568220897730901 -1.2321651268072113e-18 0.93417235896271567  -0.35662245495100664 -0.00037008290847641539 0.9342485149377322
-0.3568220897730901 -1.2321651268072113e-18 -0.93417235896271567  0.35662245495100664 -0.00037008290847641539 -0.9342485149377322
--0.35682208977308999 -6.1608256340360548e-19 -0.93417235896271567  -0.35662245495100658 0.00037008290847638232 -0.9342485149377322
--0.57735026918962573 0.57735026918962573 -0.57735026918962584  -0.5773973361706326 0.57762605998672578 -0.57702725326215654
-1.232165126807211e-18 0.93417235896271567 -0.35682208977308988  0.00037008290847623823 0.93424851493773231 -0.35662245495100647
-0.57735026918962573 0.57735026918962584 -0.57735026918962573  0.57739733617063249 0.57762605998672567 -0.57702725326215687
-0.57556494808430092 -0.41363385795819674 0.70422028778974766  0.56065793252598373 -0.42546670457134467 0.71038071904922195
--1.2321651268072113e-18 -0.93417235896271567 0.3568220897730901  -8.6828409107809262e-17 -0.93401979112163858 0.35722126167557655
--6.1608256340360548e-19 -0.93417235896271567 -0.35682208977308999  -0.00037008290847624512 -0.9342485149377322 -0.35662245495100653
-0.53310523682898847 -0.4813361142748796 0.69462568959831961  0.51449014281491778 -0.48894277869645536 0.70443938852599275
-0.52912853141459681 -0.48757002987147369 0.69320320770179855  0.51449014281491923 -0.48894277869645164 0.7044393885259943
-0.93417235896271567 0.35682208977308999 -6.1608256340360548e-19  0.93401979112163858 0.35722126167557655 6.5989590921935035e-17
--0.57735026918962573 -0.57735026918962584 -0.57735026918962573  -0.57739733617063249 -0.57762605998672567 -0.57702725326215687
--0.93417235896271567 -0.3568220897730901 1.2321651268072113e-18  -0.93424851493773231 -0.35662245495100647 0.000370082908476167
--0.57735026918962584 -0.57735026918962573 0.57735026918962573  -0.57702725326215654 -0.5773973361706326 0.57762605998672578
--0.93417235896271567 0.35682208977308988 1.232165126807211e-18  -0.93424851493773231 0.35662245495100647 0.00037008290847623823
-0.093116941936638636 0.70892487408416871 0.69813515078208488  0.10153183902938243 0.71176658290179906 0.69503929178688006
-0.098941938751961223 0.76032257344343512 0.64081678241520534  0.10365825365834723 0.76207589783375107 0.63913636447113853
--0.20469785983476813 0.7324851174314404 0.64927986178574382  -0.20481384113375084 0.73258235910829972 0.64913355914122695
--0.33120809463701684 0.40127702279442379 0.85397772162051189  -0.33139575632083101 0.40118660278746837 0.85394740027497851
-0 0.19657916295965558 0.98048795642276054  0 0.19637276165371687 0.98052931546205824
-0 0.19657916295965555 -0.98048795642276054  0 0.19637276165371681 -0.98052931546205824
--0.33120809463701684 0.40127702279442373 -0.85397772162051189  -0.33139575632083124 0.40118660278746759 -0.85394740027497884
--0.20469785983476813 0.7324851174314404 -0.64927986178574382  -0.20481384113375198 0.73258235910829961 -0.64913355914122683
-0.20469785983476813 0.7324851174314404 -0.64927986178574382  0.20481384113375084 0.73258235910829972 -0.64913355914122695
-0.33120809463701684 0.40127702279442368 -0.85397772162051189  0.33139575632083101 0.40118660278746837 -0.85394740027497862
-0.6921217709628692 -0.22700206765185593 0.68413337702600874  0.675316374147652 -0.22527759233948189 0.70228042917184774
-0.19657916295965552 -0.98048795642276054 0  0.19637276165371559 -0.98052931546205846 1.2846466075503158e-15
-0.79848519772427506 -0.057250790914286052 0.59888293763788747  0.78019094274164136 -0.041329938271313364 0.62417459822264354
-0.36517401588679055 -0.75 0.54975734503310159  0.36351224121617881 -0.75900083470875102 0.54016347840020607
-0.35314170479917451 -0.76928684914828649 0.53075413092765567  0.36351224121614184 -0.75900083470875135 0.54016347840023049
-0.78745552743149327 0.10609528287383579 0.60630413399985716  0.79156802282425154 0.094036448520738461 0.6038022951196127
--0.33120809463701678 -0.40127702279442368 -0.85397772162051189  -0.33139575632083101 -0.40118660278746837 -0.85394740027497862
--0.98048795642276054 0 -0.19657916295965552  -0.98052931546205824 0 -0.19637276165371681
--0.64927986178574371 -0.20469785983476807 0.7324851174314404  -0.6491335591412265 -0.20481384113375173 0.73258235910829994
--0.7324851174314404 0.64927986178574382 0.20469785983476813  -0.73258235910829972 0.64913355914122695 0.20481384113375084
-0 -0.19657916295965555 0.98048795642276054  0 -0.19637276165371681 0.98052931546205824
-0.64927986178574382 -0.20469785983476813 0.7324851174314404  0.64913355914122695 -0.20481384113375084 0.73258235910829972
-0.26218372058148809 0.33295004022963903 0.90494753379947435  0.2673952393891102 0.33340690397516021 0.90406837259896367
-0.82226795238624728 0.12310298935169575 0.55521070025011254  0.68977993107147029 0.080588876905648907 0.71952003419649402
-0.11695476797072325 0.81049434395812059 0.57278135509939099  0.10453117536509926 0.80855713981694211 0.57905836064064986
--0.19657916295965552 0.98048795642276054 0  -0.19637276165371681 0.98052931546205824 0
--0.40127702279442368 0.85397772162051189 0.33120809463701684  -0.40118660278746832 0.85394740027497862 0.33139575632083096
--0.85397772162051189 0.33120809463701684 0.40127702279442379  -0.85394740027497851 0.33139575632083101 0.40118660278746837
--0.64927986178574382 0.20469785983476813 0.7324851174314404  -0.64913355914122695 0.20481384113375084 0.73258235910829972
--0.33120809463701684 -0.40127702279442373 0.85397772162051189  -0.33139575632083124 -0.40118660278746759 0.85394740027497884
-0.64927986178574382 0.20469785983476813 -0.7324851174314404  0.64913355914122695 0.20481384113375084 -0.73258235910829972
-0.33120809463701684 -0.40127702279442373 -0.85397772162051189  0.33139575632083124 -0.40118660278746759 -0.85394740027497884
-0 -0.19657916295965558 -0.98048795642276054  0 -0.19637276165371687 -0.98052931546205824
--0.64927986178574382 -0.20469785983476813 -0.7324851174314404  -0.64913355914122695 -0.20481384113375084 -0.73258235910829972
--0.64927986178574371 0.20469785983476807 -0.7324851174314404  -0.6491335591412265 0.20481384113375173 -0.73258235910829994
--0.7324851174314404 0.64927986178574382 -0.20469785983476813  -0.73258235910829961 0.64913355914122695 -0.20481384113375198
--0.40127702279442362 0.85397772162051189 -0.33120809463701684  -0.40118660278746765 0.85394740027497884 -0.33139575632083129
-0.19657916295965558 0.98048795642276054 0  0.19637276165371687 0.98052931546205824 0
-0.40127702279442368 0.85397772162051189 -0.33120809463701678  0.40118660278746832 0.85394740027497862 -0.33139575632083096
-0.85397772162051189 0.33120809463701684 -0.40127702279442379  0.85394740027497851 0.33139575632083101 -0.40118660278746837
-0.94302798180440095 0.1743284862276076 0.28050566540029331  0.94624082570117141 0.15592580676949422 0.28339979280099681
-0.33120809463701678 -0.40127702279442368 0.85397772162051189  0.33139575632083101 -0.40118660278746837 0.85394740027497862
-0.20469785983476813 -0.7324851174314404 0.64927986178574382  0.20481384113375084 -0.73258235910829972 0.64913355914122695
--0.40127702279442373 -0.85397772162051189 0.33120809463701684  -0.40118660278746765 -0.85394740027497884 0.33139575632083129
--0.19657916295965555 -0.98048795642276054 0  -0.19637276165371681 -0.98052931546205824 0
--0.20469785983476813 -0.7324851174314404 -0.64927986178574382  -0.20481384113375084 -0.73258235910829972 -0.64913355914122695
-0.20469785983476813 -0.7324851174314404 -0.64927986178574382  0.2048138411337522 -0.73258235910829916 -0.64913355914122728
-0.64927986178574371 -0.20469785983476807 -0.7324851174314404  0.6491335591412265 -0.20481384113375173 -0.73258235910829994
-0.25313054028719528 -0.92991689161909563 0.26460466631117985  0.22507894965092784 -0.93495764835209438 0.27421462800506569
-0.97011813854669349 0.21732927410114633 0.09963433104745141  0.97545429555208396 0.20136271833024827 0.089117747702917693
-0.22762677949308696 -0.97053761901938218 0.067701629511043929  0.24109601889303409 -0.96718604322533863 0.08014903283286233
-0.7324851174314404 0.64927986178574382 -0.20469785983476813  0.73258235910829972 0.64913355914122695 -0.20481384113375084
--0.40127702279442368 -0.85397772162051189 -0.33120809463701678  -0.40118660278746832 -0.85394740027497862 -0.33139575632083096
--0.85397772162051189 -0.33120809463701684 -0.40127702279442368  -0.85394740027497862 -0.33139575632083096 -0.40118660278746832
--0.7324851174314404 -0.64927986178574382 -0.20469785983476813  -0.73258235910829972 -0.64913355914122695 -0.20481384113375084
--0.85397772162051189 -0.33120809463701678 0.40127702279442362  -0.85394740027497884 -0.33139575632083129 0.40118660278746759
--0.7324851174314404 -0.64927986178574382 0.20469785983476813  -0.73258235910829916 -0.64913355914122728 0.2048138411337522
--0.20469785983476813 -0.7324851174314404 0.64927986178574382  -0.2048138411337522 -0.73258235910829916 0.64913355914122728
--0.85397772162051189 0.33120809463701684 -0.40127702279442362  -0.85394740027497884 0.33139575632083129 -0.40118660278746765
--0.98048795642276054 0 0.19657916295965558  -0.98052931546205824 0 0.19637276165371687
-0.1473096109213767 0.85311732979922927 0.49982529754025778  0.17406896607441485 0.84145097432228222 0.51152737254409586
-0.13944047800987086 0.84405122505983243 0.51657855931435837  0.13950752053007628 0.83662429167607366 0.52971449507546831
--0.40547414873191501 0.74192286377215211 0.53398612240605781  -0.40564529943251931 0.74178975530654589 0.53404105644655853
--0.45853354684184838 0.20793674136609452 0.86400769557376311  -0.45845128128591367 0.20774869885998945 0.86409658071843187
-0.12208483180161088 2.4628875390745807e-18 0.9925196692479058  0.12230682541188538 -1.3892362040527919e-17 0.99249233773247159
--0.12208483180161088 2.4628875390745807e-18 -0.9925196692479058  -0.12230682541188538 -1.3892362040527919e-17 -0.99249233773247159
--0.53398612240605769 0.40547414873191501 -0.74192286377215222  -0.53404105644655864 0.40564529943251854 -0.74178975530654634
--0.20793674136609455 0.86400769557376311 -0.45853354684184816  -0.2077486988599887 0.86409658071843221 -0.45845128128591356
-0.40547414873191501 0.74192286377215211 -0.53398612240605781  0.40564529943251931 0.74178975530654589 -0.53404105644655853
-0.45853354684184838 0.20793674136609452 -0.86400769557376311  0.45845128128591367 0.20774869885998945 -0.86409658071843187
-0.20793674136609452 -0.86400769557376311 0.45853354684184838  0.20774869885998945 -0.86409658071843187 0.45845128128591367
-2.4628875390745807e-18 -0.9925196692479058 -0.12208483180161088  -1.0419271530395937e-17 -0.99249233773247181 -0.12230682541188402
-0.97371394847093473 0.22313250261608547 0.018534606855888314  0.97011569110293328 0.24165005293363567 0.021927101793196353
-0.22762677949308696 -0.97053761901938218 -0.067701629511043929  0.24109601889303389 -0.96718604322533897 -0.080149032832859957
-0.9610594275501394 0.20306848001363986 -0.18186355091081907  0.96305716105845063 0.20064914867262926 -0.17961298302457651
-0.87541500307784514 0.17583413883161553 0.44878045857535925  0.87543631012341683 0.1784471211094488 0.44918580997761559
--0.45853354684184838 -0.20793674136609452 -0.86400769557376311  -0.45845128128591367 -0.20774869885998945 -0.86409658071843187
--0.9925196692479058 0.12208483180161094 -2.4628875390745819e-18  -0.99249233773247181 0.12230682541188409 0
--0.45853354684184816 -0.20793674136609455 0.86400769557376311  -0.45845128128591472 -0.20774869885998942 0.86409658071843132
--0.74192286377215222 0.53398612240605792 0.40547414873191506  -0.74178975530654712 0.53404105644655764 0.40564529943251859
--0.12208483180161088 -2.4628875390745807e-18 0.9925196692479058  -0.12230682541188546 1.3892362040527919e-17 0.99249233773247159
-0.53398612240605781 -0.40547414873191501 0.74192286377215233  0.53404105644655786 -0.40564529943251887 0.74178975530654678
-0.90494753379947435 0.26218372058148803 0.33295004022963903  0.90406837259895934 0.26739523938910581 0.33340690397517558
-0.90595336478045685 0.32286639405373119 0.271410708194047  0.91136373772562917 0.30990719304796283 0.27087574504909689
-0.84405122505983243 0.51657855931435837 0.13944047800987086  0.83662429167605645 0.52971449507545787 0.13950752053021956
--2.4628875390745819e-18 0.9925196692479058 -0.12208483180161094  0 0.99249233773247181 -0.12230682541188409
--0.20793674136609452 0.86400769557376311 0.45853354684184838  -0.20774869885999001 0.86409658071843165 0.45845128128591378
--0.86400769557376311 0.45853354684184838 0.20793674136609452  -0.86409658071843165 0.45845128128591378 0.20774869885999001
--0.53398612240605781 0.40547414873191501 0.74192286377215233  -0.53404105644655753 0.40564529943251865 0.74178975530654712
--0.53398612240605769 -0.40547414873191501 0.74192286377215222  -0.53404105644655864 -0.40564529943251854 0.74178975530654634
-0.53398612240605781 0.40547414873191501 -0.74192286377215233  0.53404105644655753 0.40564529943251865 -0.74178975530654712
-0.53398612240605769 -0.40547414873191501 -0.74192286377215222  0.53404105644655864 -0.40564529943251848 -0.74178975530654634
-0.12208483180161088 -2.4628875390745807e-18 -0.9925196692479058  0.12230682541188546 1.3892362040527919e-17 -0.99249233773247159
--0.53398612240605781 -0.40547414873191501 -0.74192286377215233  -0.53404105644655753 -0.40564529943251865 -0.74178975530654712
--0.45853354684184816 0.20793674136609455 -0.86400769557376311  -0.45845128128591472 0.20774869885998942 -0.86409658071843132
--0.86400769557376311 0.45853354684184816 -0.20793674136609455  -0.86409658071843221 0.45845128128591356 -0.2077486988599887
--0.40547414873191512 0.74192286377215233 -0.53398612240605781  -0.40564529943251854 0.74178975530654634 -0.53404105644655864
-2.4628875390745819e-18 0.9925196692479058 0.12208483180161094  0 0.99249233773247181 0.12230682541188409
-0.20793674136609452 0.86400769557376311 -0.45853354684184838  0.20774869885999001 0.86409658071843165 -0.45845128128591378
-0.86400769557376311 0.45853354684184838 -0.20793674136609452  0.86409658071843187 0.45845128128591367 -0.20774869885998945
-0.24152064540259116 -0.94857068261001021 -0.2007220816032094  0.22151649240577817 -0.95495693252433878 -0.19745303394971236
-0.45853354684184838 -0.20793674136609452 0.86400769557376311  0.45845128128591367 -0.20774869885998945 0.86409658071843187
-0.25313054028719528 -0.92991689161909552 -0.26460466631117996  0.22507894965084035 -0.9349576483520694 -0.27421462800522284
--0.40547414873191512 -0.74192286377215233 0.53398612240605781  -0.40564529943251854 -0.74178975530654634 0.53404105644655864
--2.4628875390745807e-18 -0.9925196692479058 0.12208483180161088  1.0419271530395939e-17 -0.99249233773247181 0.12230682541188409
--0.40547414873191501 -0.74192286377215233 -0.53398612240605781  -0.40564529943251926 -0.74178975530654601 -0.53404105644655853
-0.20793674136609455 -0.86400769557376311 -0.45853354684184816  0.2077486988599887 -0.86409658071843221 -0.45845128128591356
-0.45853354684184816 -0.20793674136609455 -0.86400769557376311  0.45845128128591472 -0.20774869885998942 -0.86409658071843132
-0.94302798180440095 0.17432848622760783 -0.28050566540029331  0.94624082570117263 0.15592580676949283 -0.28339979280099331
-0.88317063762809189 0.078036377421090597 -0.46105412139556579  0.87829625280902335 0.071121388581572048 -0.47279746233229425
-0.69607577061268988 -0.22054081151140004 -0.68235511400187066  0.70341121140131047 -0.2431708442768484 -0.66789266216108834
-0.74192286377215222 0.53398612240605769 -0.40547414873191495  0.74178975530654701 0.53404105644655753 -0.4056452994325187
--0.20793674136609452 -0.86400769557376311 -0.45853354684184838  -0.20774869885998945 -0.86409658071843187 -0.45845128128591367
--0.86400769557376311 -0.45853354684184838 -0.20793674136609452  -0.86409658071843187 -0.45845128128591367 -0.20774869885998945
--0.74192286377215222 -0.53398612240605769 -0.40547414873191495  -0.74178975530654701 -0.53404105644655753 -0.4056452994325187
--0.74192286377215222 -0.53398612240605769 0.40547414873191501  -0.74178975530654634 -0.53404105644655864 0.40564529943251854
--0.86400769557376311 -0.45853354684184816 0.20793674136609455  -0.86409658071843221 -0.45845128128591356 0.2077486988599887
--0.20793674136609455 -0.86400769557376311 0.45853354684184816  -0.2077486988599887 -0.86409658071843221 0.45845128128591356
--0.74192286377215222 0.53398612240605769 -0.40547414873191501  -0.74178975530654634 0.53404105644655864 -0.40564529943251854
--0.9925196692479058 -0.12208483180161092 2.4628875390745815e-18  -0.99249233773247181 -0.12230682541188409 0
-0.14564781357706014 0.50275426427774228 0.85145286645038376  0.13337026124728052 0.50082503649439947 0.85521146872292098
-0.23797402212934904 0.20209118411408983 0.95001448309746583  0.23767767361493708 0.20255543129006909 0.94998980032413272
--3.6838438251301899e-18 0.67939657443508372 0.73377128224391142  6.2160324274018349e-16 0.67830899168555392 0.73477677685030784
-0.61001812379817832 0.1056352994139447 0.78429103445404746  0.609555979170463 0.10429556095738847 0.78585236795604396
--0.18275773351615091 0.56644608341520675 0.80357852474018521  -0.18137511328579306 0.56621300696157051 0.80405590541211891
--4.927907460000931e-18 0.82511526248824529 0.56496442685265946  4.4454892311676981e-16 0.82480365918097698 0.56541924604816085
--0.1129504910198771 0.38368834989905565 0.91652901576006229  -0.11209598472398358 0.38483789367577614 0.9161518901361021
--0.38505005624480637 0.58714124035889637 0.7120404609681168  -0.38457055427597131 0.58712598556603979 0.71231212670919652
-0.11295049101987709 0.38368834989905559 0.91652901576006229  0.11209598472398341 0.38483789367577625 0.9161518901361021
--0.23797402212934904 0.20209118411408986 0.95001448309746583  -0.23767767361493694 0.202555431290069 0.94998980032413272
--0.11295049101987709 0.38368834989905559 -0.91652901576006229  -0.11209598472398341 0.38483789367577625 -0.9161518901361021
-0.23797402212934904 0.20209118411408986 -0.95001448309746583  0.23767767361493694 0.202555431290069 -0.94998980032413272
--0.18275773351615091 0.56644608341520641 -0.80357852474018532  -0.1813751132857937 0.56621300696157073 -0.80405590541211858
--0.23797402212934904 0.20209118411408983 -0.95001448309746583  -0.23767767361493708 0.20255543129006909 -0.94998980032413272
-3.6838438251301899e-18 0.67939657443508372 -0.73377128224391142  -8.8899681643288797e-16 0.67830899168555425 -0.73477677685030751
--0.38505005624480643 0.58714124035889637 -0.71204046096811668  -0.38457055427597048 0.58712598556604001 -0.71231212670919697
-0.18275773351615091 0.56644608341520675 -0.80357852474018521  0.18137511328579306 0.56621300696157051 -0.80405590541211891
-4.927907460000931e-18 0.82511526248824529 -0.56496442685265946  -4.4454892311676981e-16 0.82480365918097698 -0.56541924604816085
-0.1129504910198771 0.38368834989905565 -0.91652901576006229  0.11209598472398358 0.38483789367577614 -0.9161518901361021
-0.38505005624480637 0.58714124035889637 -0.7120404609681168  0.38457055427597131 0.58712598556603979 -0.71231212670919652
-0.69531998299352837 -0.2217116289121196 -0.68272481536695306  0.70341121140124718 -0.24317084427681135 -0.66789266216116849
-0.76687916779802356 -0.10789205109760849 0.63136143448574888  0.75877805430304368 -0.10723544565538377 0.64246122334595301
-0.73203596503112123 -0.16333083529035372 0.66003296952840662  0.73315795129589978 -0.17491713444450813 0.65717837344918839
-0.20209118411408986 -0.95001448309746583 0.23797402212934904  0.20255543129017947 -0.94998980032415736 0.23767767361474501
-0.45944041532897167 -0.59972505245462004 0.65399889841309089  0.47623926703787134 -0.60557549052406701 0.63755351603435351
-0.20209118411408983 -0.95001448309746583 -0.23797402212934904  0.20255543129008949 -0.94998980032413749 -0.23767767361490061
-0.22589145876869662 -0.97323020415808847 -0  0.24034326043217732 -0.97068796076021813 0
-0.40065939257699124 -0.69413734830776375 0.59790562905682232  0.37763414062759415 -0.67726348918454282 0.63143219909190329
-0.42861413394522369 -0.64891100701386606 0.62717432611494872  0.41977894187289982 -0.66093884463189856 0.622049422165731
-0.40435813432554857 -0.6879005781223142 0.60211592452938867  0.4197789418728895 -0.66093884463190489 0.622049422165731
-0.56789366986248413 0.81389356246462441 0.11874744154864894  0.58292813064720961 0.80326578355000555 0.12230648174951961
-0.95001448309746583 0.23797402212934904 0.20209118411408983  0.94998980032413238 0.23767767361493988 0.20255543129006717
--0.1129504910198771 -0.38368834989905565 -0.91652901576006229  -0.11209598472398358 -0.38483789367577614 -0.9161518901361021
--0.38505005624480637 -0.58714124035889637 -0.7120404609681168  -0.38457055427597131 -0.58712598556603979 -0.71231212670919652
--0.91652901576006229 0.11295049101987709 -0.38368834989905559  -0.9161518901361021 0.11209598472398341 -0.38483789367577625
--0.95001448309746583 -0.23797402212934904 -0.20209118411408986  -0.94998980032413272 -0.23767767361493694 -0.202555431290069
--0.73377128224391142 3.6838438251301899e-18 0.67939657443508372  -0.73477677685030751 -3.5420966904747881e-16 0.67830899168555425
--0.71204046096811668 -0.38505005624480643 0.58714124035889637  -0.71231212670919686 -0.38457055427597092 0.58712598556603979
--0.56644608341520675 0.80357852474018521 0.18275773351615091  -0.56621300696156995 0.80405590541211891 0.18137511328579495
--0.82511526248824529 0.56496442685265946 4.927907460000931e-18  -0.82480365918097698 0.56541924604816096 -4.4107588465492006e-16
--0.11295049101987709 -0.38368834989905559 0.91652901576006229  -0.11209598472398341 -0.38483789367577625 0.9161518901361021
-0.23797402212934904 -0.20209118411408986 0.95001448309746583  0.23767767361493694 -0.202555431290069 0.94998980032413272
-0.85711100340627278 0.037134436368273127 0.51257565524045945  0.85590248058786045 0.033910248167193832 0.51602426182572703
-0.56496442685265946 -4.927907460000931e-18 0.82511526248824529  0.56541924604816285 -3.54249923108676e-16 0.82480365918097576
-0.73377128224391142 -3.6838438251301899e-18 0.67939657443508372  0.73477677685030751 3.5420966904747881e-16 0.67830899168555425
-0.10609528287383586 0.60630413399985694 0.78745552743149316  0.094036448520745178 0.60380229511960815 0.79156802282425409
-0.67939657443508372 0.73377128224391142 -3.6838438251301899e-18  0.67830899168555314 0.73477677685030873 6.2507588655437443e-16
-0.71884915497263779 0.093588483842681203 0.68777595190194329  0.7209136361166899 0.10033016823457219 0.68572398718656136
-0.66455433327713243 0.095362650095153129 0.74011618472454044  0.66756092552177693 0.1027523636191123 0.73743092048489145
-0.20209118411408983 0.95001448309746583 0.23797402212934904  0.20255543129006906 0.9499898003241326 0.23767767361493716
--0.38368834989905559 0.91652901576006229 -0.11295049101987709  -0.38483789367577625 0.91615189013610199 -0.1120959847239834
--0.20209118411408986 0.95001448309746583 0.23797402212934904  -0.20255543129006939 0.94998980032413272 0.23767767361493675
--0.38368834989905565 0.91652901576006229 0.1129504910198771  -0.38483789367577614 0.9161518901361021 0.11209598472398358
--0.58714124035889637 0.7120404609681168 0.38505005624480637  -0.58712598556603979 0.71231212670919652 0.38457055427597131
--0.91652901576006229 0.1129504910198771 0.38368834989905565  -0.9161518901361021 0.11209598472398358 0.38483789367577614
--0.7120404609681168 0.38505005624480637 0.58714124035889637  -0.71231212670919652 0.38457055427597131 0.58712598556603979
--0.80357852474018521 0.18275773351615091 0.56644608341520675  -0.80405590541211891 0.18137511328579495 0.56621300696156995
--0.56496442685265946 4.927907460000931e-18 0.82511526248824529  -0.56541924604816252 1.1461026924104223e-16 0.82480365918097598
--0.18275773351615091 -0.56644608341520641 0.80357852474018532  -0.1813751132857937 -0.56621300696157073 0.80405590541211858
--0.23797402212934904 -0.20209118411408983 0.95001448309746583  -0.23767767361493719 -0.20255543129006909 0.94998980032413272
-0.80357852474018521 0.18275773351615091 -0.56644608341520675  0.80405590541211891 0.18137511328579495 -0.56621300696156995
-0.56496442685265946 4.927907460000931e-18 -0.82511526248824529  0.56541924604816252 1.1461026924104223e-16 -0.82480365918097598
-0.18275773351615091 -0.56644608341520641 -0.80357852474018532  0.1813751132857937 -0.56621300696157073 -0.80405590541211858
-0.23797402212934904 -0.20209118411408983 -0.95001448309746583  0.23767767361493719 -0.20255543129006909 -0.94998980032413272
-0.11295049101987709 -0.38368834989905559 -0.91652901576006229  0.11209598472398341 -0.38483789367577625 -0.9161518901361021
--0.23797402212934904 -0.20209118411408986 -0.95001448309746583  -0.23767767361493694 -0.202555431290069 -0.94998980032413272
--0.80357852474018521 -0.18275773351615091 -0.56644608341520675  -0.80405590541211891 -0.18137511328579495 -0.56621300696156995
--0.56496442685265946 -4.927907460000931e-18 -0.82511526248824529  -0.56541924604816285 -3.54249923108676e-16 -0.82480365918097576
--0.73377128224391142 -3.6838438251301899e-18 -0.67939657443508372  -0.73477677685030751 3.5420966904747881e-16 -0.67830899168555425
--0.71204046096811668 0.38505005624480643 -0.58714124035889637  -0.71231212670919686 0.38457055427597092 -0.58712598556603979
--0.67939657443508372 0.73377128224391142 3.6838438251301899e-18  -0.67830899168555359 0.73477677685030829 -3.264285185339511e-16
--0.58714124035889637 0.71204046096811668 -0.38505005624480643  -0.58712598556603957 0.71231212670919664 -0.38457055427597159
--0.56644608341520641 0.80357852474018532 -0.18275773351615091  -0.56621300696157029 0.80405590541211847 -0.18137511328579559
--0.20209118411408983 0.95001448309746583 -0.23797402212934904  -0.20255543129006906 0.9499898003241326 -0.23767767361493716
-0.38368834989905559 0.91652901576006229 0.11295049101987709  0.38483789367577625 0.91615189013610199 0.1120959847239834
-0.20209118411408986 0.95001448309746583 -0.23797402212934904  0.20255543129006939 0.94998980032413272 -0.23767767361493675
-0.38368834989905565 0.91652901576006229 -0.1129504910198771  0.38483789367577614 0.9161518901361021 -0.11209598472398358
-0.58714124035889637 0.7120404609681168 -0.38505005624480637  0.58712598556603979 0.71231212670919652 -0.38457055427597131
-0.85822228618686625 0.03887113359859222 0.51061830246204121  0.85590248058786189 0.03391024816720907 0.51602426182572358
-0.7120404609681168 0.38505005624480637 -0.58714124035889637  0.71231212670919652 0.38457055427597131 -0.58712598556603979
-0.85756840681366708 0.037892913779084658 0.51176714118576794  0.85590248058785079 0.033910248167155335 0.51602426182574557
-0.94691066341902042 0.17998804508785277 0.2643958831644852  0.95675731372090722 0.15958439167178995 0.24320416233341552
-0.1129504910198771 -0.38368834989905565 0.91652901576006229  0.11209598472398358 -0.38483789367577614 0.9161518901361021
-0.38505005624480637 -0.58714124035889637 0.7120404609681168  0.38457055427597131 -0.58712598556603979 0.71231212670919652
-0.18275773351615091 -0.56644608341520675 0.80357852474018521  0.18137511328579306 -0.56621300696157051 0.80405590541211891
-4.927907460000931e-18 -0.82511526248824529 0.56496442685265946  1.18083307702892e-16 -0.82480365918097598 0.5654192460481624
--0.56644608341520641 -0.80357852474018532 0.18275773351615091  -0.56621300696157029 -0.80405590541211847 0.18137511328579559
--0.20209118411408983 -0.95001448309746583 0.23797402212934904  -0.20255543129006906 -0.9499898003241326 0.23767767361493716
--0.38368834989905559 -0.91652901576006229 0.11295049101987709  -0.38483789367577625 -0.91615189013610199 0.1120959847239834
--0.20209118411408986 -0.95001448309746583 -0.23797402212934904  -0.202555431290069 -0.94998980032413272 -0.23767767361493694
--0.18275773351615091 -0.56644608341520675 -0.80357852474018521  -0.18137511328579306 -0.56621300696157051 -0.80405590541211891
--4.927907460000931e-18 -0.82511526248824529 -0.56496442685265946  -3.54249923108676e-16 -0.82480365918097576 -0.56541924604816285
--3.6838438251301899e-18 -0.67939657443508372 -0.73377128224391142  6.2160324274018339e-16 -0.6783089916855547 -0.73477677685030718
-0.38505005624480643 -0.58714124035889637 -0.71204046096811668  0.38457055427597092 -0.58712598556603979 -0.71231212670919686
-0.73377128224391142 3.6838438251301899e-18 -0.67939657443508372  0.73477677685030751 -3.5420966904747881e-16 -0.67830899168555425
-0.23440017510432309 -0.9594775020158709 0.15035899655759533  0.24320416233348721 -0.95675731372089035 0.15958439167178237
-0.97011813854669382 0.21732927410114633 -0.099634331047451452  0.9754542955520713 0.20136271833029701 -0.089117747702945227
-0.44633019100468213 -0.6204277684668269 0.64334361719230826  0.4361156007101773 -0.62405012717396158 0.64835532047740907
-0.37506412073313489 -0.73422479552976916 0.5641719337434894  0.38232288700972444 -0.72686052081253516 0.57052869634460968
-0.39411849558532497 -0.70426794627197542 0.58956860097969033  0.38232288700971667 -0.72686052081252572 0.57052869634462677
-0.50622685812276469 -0.5257151024560045 0.68341702461536258  0.54199242061156017 -0.5062447854721529 0.67079090123664897
-0.95001448309746583 0.23797402212934904 -0.20209118411408986  0.94998980032413283 0.23767767361493602 -0.2025554312900695
-0.56644608341520675 0.80357852474018521 -0.18275773351615091  0.56621300696156995 0.80405590541211891 -0.18137511328579495
-0.82511526248824529 0.56496442685265946 -4.927907460000931e-18  0.82480365918097664 0.56541924604816152 5.4874007697226281e-16
--0.38368834989905565 -0.91652901576006229 -0.1129504910198771  -0.38483789367577614 -0.9161518901361021 -0.11209598472398358
--0.58714124035889637 -0.7120404609681168 -0.38505005624480637  -0.58712598556603979 -0.71231212670919652 -0.38457055427597131
--0.91652901576006229 -0.1129504910198771 -0.38368834989905565  -0.9161518901361021 -0.11209598472398358 -0.38483789367577614
--0.7120404609681168 -0.38505005624480637 -0.58714124035889637  -0.71231212670919652 -0.38457055427597131 -0.58712598556603979
--0.56644608341520675 -0.80357852474018521 -0.18275773351615091  -0.56621300696156995 -0.80405590541211891 -0.18137511328579495
--0.82511526248824529 -0.56496442685265946 -4.927907460000931e-18  -0.82480365918097598 -0.5654192460481624 -1.18083307702892e-16
--0.80357852474018532 -0.18275773351615091 0.56644608341520641  -0.80405590541211847 -0.18137511328579559 0.56621300696157029
--0.95001448309746583 -0.23797402212934904 0.20209118411408983  -0.9499898003241326 -0.23767767361493716 0.20255543129006906
--0.67939657443508372 -0.73377128224391142 -3.6838438251301899e-18  -0.67830899168555314 -0.73477677685030873 6.2507588655437443e-16
--0.58714124035889637 -0.71204046096811668 0.38505005624480643  -0.58712598556603979 -0.71231212670919686 0.38457055427597092
-3.6838438251301899e-18 -0.67939657443508372 0.73377128224391142  -6.2160324274018339e-16 -0.6783089916855547 0.73477677685030718
--0.38505005624480643 -0.58714124035889637 0.71204046096811668  -0.38457055427597092 -0.58712598556603979 0.71231212670919686
--0.80357852474018532 0.18275773351615091 -0.56644608341520641  -0.80405590541211847 0.18137511328579559 -0.56621300696157029
--0.95001448309746583 0.23797402212934904 -0.20209118411408983  -0.9499898003241326 0.23767767361493716 -0.20255543129006906
--0.91652901576006229 -0.11295049101987709 0.38368834989905559  -0.9161518901361021 -0.11209598472398341 0.38483789367577625
--0.95001448309746583 0.23797402212934904 0.20209118411408986  -0.94998980032413272 0.23767767361493675 0.20255543129006939
-0.74644278217951743 0.096124922711889466 0.65746189559341328  0.74597391594556683 0.098434961242602592 0.65866036402231121
-0.69813515078208477 0.093116941936638692 0.70892487408416871  0.69503929178689594 0.10153183902939614 0.71176658290178163
--0.3412681489687433 0.82760814841975494 0.44564650023159885  -0.34127086350966057 0.82760959526572631 0.44564173451716937
--0.5521834643091893 0.27542468411056592 0.78691464920034204  -0.55218785652865843 0.2754217387370671 0.78691259802683067
-1.2310405966106288e-18 -0.065843464858177478 0.99782996454078776  0 -0.065849124772593706 0.99782959104582747
--1.2310405966106288e-18 -0.065843464858177478 -0.99782996454078776  0 -0.065849124772593706 -0.99782959104582747
--0.55218346430918919 0.27542468411056592 -0.78691464920034204  -0.55218785652865843 0.27542173873706749 -0.78691259802683067
--0.34126814896874336 0.82760814841975505 -0.44564650023159863  -0.34127086350966107 0.82760959526572653 -0.44564173451716882
-0.3412681489687433 0.82760814841975494 -0.44564650023159885  0.34127086350966057 0.82760959526572631 -0.44564173451716937
-0.5521834643091893 0.27542468411056592 -0.78691464920034204  0.55218785652865843 0.2754217387370671 -0.78691259802683067
-0.27542468411056592 -0.78691464920034204 0.5521834643091893  0.2754217387370671 -0.78691259802683067 0.55218785652865843
--0.065843464858177478 -0.99782996454078776 -1.2310405966106288e-18  -0.065849124772593706 -0.99782959104582747 0
-0.27542468411056592 -0.78691464920034204 -0.55218346430918919  0.27542173873706743 -0.78691259802683056 -0.55218785652865843
-0.22648000271342919 -0.97241808576487498 -0.034988854233130702  0.21668703966435401 -0.97542959357555248 -0.039797422259879874
-0.23440017510432298 -0.95947750201587068 -0.15035899655759499  0.24320416233349618 -0.95675731372088713 -0.15958439167178784
-0.55513243511370003 0.123158824652338 0.82188503772742816  0.54729298896532652 0.10489548487252408 0.83034168959697374
--0.5521834643091893 -0.27542468411056592 -0.78691464920034204  -0.55218785652865843 -0.2754217387370671 -0.78691259802683067
--0.99782996454078776 1.231040596610629e-18 0.065843464858177492  -0.99782959104582747 0 0.06584912477259372
--0.44564650023159863 -0.34126814896874336 0.82760814841975505  -0.44564173451716882 -0.34127086350966107 0.82760959526572653
--0.82760814841975494 0.44564650023159885 0.34126814896874336  -0.82760959526572597 0.44564173451716915 0.34127086350966152
--1.2310405966106288e-18 0.065843464858177478 0.99782996454078776  0 0.065849124772593706 0.99782959104582747
-0.4456465002315988 -0.3412681489687433 0.82760814841975494  0.4456417345171691 -0.3412708635096619 0.82760959526572597
-0.77156308049914157 0.10155294642477924 0.62688758712066828  0.76918721291847925 0.096596587118441227 0.63168040245029877
-0.81389356246462441 0.11874744154864894 0.56789366986248413  0.803265783550005 0.12230648174951998 0.58292813064721027
-0.12315882465233809 0.82188503772742794 0.55513243511370003  0.10489548487253526 0.83034168959698129 0.54729298896531298
-0.065843464858177492 0.99782996454078776 -1.231040596610629e-18  0.06584912477259372 0.99782959104582747 0
--0.27542468411056592 0.78691464920034204 0.5521834643091893  -0.2754217387370666 0.78691259802683156 0.55218785652865754
--0.78691464920034204 0.5521834643091893 0.27542468411056592  -0.786912598026831 0.55218785652865821 0.27542173873706705
--0.4456465002315988 0.3412681489687433 0.82760814841975494  -0.4456417345171691 0.3412708635096619 0.82760959526572597
--0.55218346430918919 -0.27542468411056592 0.78691464920034204  -0.55218785652865843 -0.27542173873706749 0.78691259802683067
-0.4456465002315988 0.3412681489687433 -0.82760814841975494  0.4456417345171691 0.3412708635096619 -0.82760959526572597
-0.55218346430918919 -0.27542468411056592 -0.78691464920034204  0.55218785652865843 -0.27542173873706749 -0.78691259802683067
-1.2310405966106288e-18 0.065843464858177478 -0.99782996454078776  0 0.065849124772593706 -0.99782959104582747
--0.4456465002315988 -0.3412681489687433 -0.82760814841975494  -0.4456417345171691 -0.3412708635096619 -0.82760959526572597
--0.44564650023159863 0.34126814896874336 -0.82760814841975505  -0.44564173451716882 0.34127086350966107 -0.82760959526572653
--0.82760814841975505 0.44564650023159863 -0.34126814896874336  -0.82760959526572653 0.44564173451716882 -0.34127086350966107
--0.27542468411056592 0.78691464920034204 -0.55218346430918919  -0.27542173873706743 0.78691259802683056 -0.55218785652865843
--0.065843464858177492 0.99782996454078776 1.231040596610629e-18  -0.06584912477259372 0.99782959104582747 0
-0.27542468411056592 0.78691464920034204 -0.5521834643091893  0.2754217387370666 0.78691259802683156 -0.55218785652865754
-0.78691464920034204 0.5521834643091893 -0.27542468411056592  0.78691259802683067 0.55218785652865843 -0.2754217387370671
-0.95663400990185377 0.19602936533555493 0.21094260961626571  0.954956932524338 0.19745303394971148 0.22151649240578231
-0.5521834643091893 -0.27542468411056592 0.78691464920034204  0.55218785652865843 -0.2754217387370671 0.78691259802683067
-0.61696807586665514 -0.34742682425518856 0.70495163176324005  0.6028570865599705 -0.35990150486609274 0.71206336795228153
--0.27542468411056592 -0.78691464920034204 0.55218346430918919  -0.27542173873706743 -0.78691259802683056 0.55218785652865843
-0.065843464858177478 -0.99782996454078776 1.2310405966106288e-18  0.065849124772593706 -0.99782959104582747 0
--0.3412681489687433 -0.82760814841975505 -0.44564650023159885  -0.34127086350966185 -0.82760959526572597 -0.4456417345171691
-0.60785615600797449 -0.36184045701812123 0.70538094374692573  0.6028570865599715 -0.35990150486609057 0.71206336795228176
-0.44564650023159863 -0.34126814896874336 -0.82760814841975505  0.44564173451716882 -0.34127086350966107 -0.82760959526572653
-0.26758089404998375 -0.9059728893652188 -0.32585692434233748  0.24890531892630735 -0.91663390223890306 -0.31277536903738834
-0.26660413751883788 -0.90759811547986158 -0.32187126056253335  0.24890531892629519 -0.91663390223889096 -0.31277536903743325
-0.26791287934591512 -0.90549608434201145 -0.32699007860623575  0.24890531892630424 -0.91663390223890118 -0.31277536903739622
-0.82760814841975505 0.44564650023159885 -0.34126814896874336  0.82760959526572597 0.44564173451716915 -0.3412708635096619
--0.27542468411056592 -0.78691464920034204 -0.5521834643091893  -0.2754217387370671 -0.78691259802683067 -0.55218785652865843
--0.78691464920034204 -0.5521834643091893 -0.27542468411056592  -0.78691259802683067 -0.55218785652865843 -0.2754217387370671
--0.82760814841975505 -0.44564650023159885 -0.34126814896874336  -0.82760959526572597 -0.44564173451716915 -0.3412708635096619
--0.78691464920034204 -0.55218346430918919 0.27542468411056592  -0.78691259802683067 -0.55218785652865843 0.27542173873706749
--0.82760814841975505 -0.44564650023159863 0.34126814896874336  -0.82760959526572653 -0.44564173451716882 0.34127086350966107
--0.34126814896874336 -0.82760814841975505 0.44564650023159863  -0.34127086350966107 -0.82760959526572653 0.44564173451716882
--0.78691464920034204 0.55218346430918919 -0.27542468411056592  -0.78691259802683067 0.55218785652865843 -0.27542173873706749
--0.99782996454078776 -1.231040596610629e-18 -0.065843464858177492  -0.99782959104582747 0 -0.06584912477259372
-0.51657855931435848 0.13944047800987086 0.84405122505983243  0.52971449507546142 0.13950752053014198 0.83662429167606711
-0.1186983640546234 0.26188501241256062 0.95777186148081694  0.11873329660574115 0.261615609412787 0.95784115446597362
--0.068996282000725467 0.75327597529184531 0.65407554465688111  -0.069124135183105104 0.7534327508752533 0.65388144479235411
-0.57278135509939099 0.11695476797072324 0.8104943439581207  0.57905836064065497 0.10453117536509578 0.80855713981693889
--0.30369631682393589 0.52293928186267569 0.79643145005237237  -0.30395970967362002 0.52285425410030417 0.7963867928741305
-0.068996282000725426 0.75327597529184531 0.65407554465688111  0.069124135183103744 0.75343275087525319 0.65388144479235433
--0.11869836405462342 0.26188501241256068 0.95777186148081694  -0.11873329660574071 0.26161560941278683 0.95784115446597373
--0.26105426945011495 0.63457761123722189 0.7274351680516471  -0.26123864468751851 0.6346994542695118 0.72726265769102449
-0.23033669342916974 0.33088129441328601 0.9151298141069959  0.23057849677495015 0.33073974459589178 0.91512008947987178
--0.23033669342916982 0.33088129441328606 0.9151298141069959  -0.23057849677494924 0.33073974459589167 0.91512008947987211
--0.23033669342916974 0.33088129441328601 -0.9151298141069959  -0.23057849677494924 0.33073974459589123 -0.91512008947987233
-0.23033669342916982 0.33088129441328606 -0.9151298141069959  0.23057849677494924 0.33073974459589167 -0.91512008947987211
--0.26105426945011484 0.63457761123722189 -0.7274351680516471  -0.26123864468751856 0.63469945426951135 -0.72726265769102494
--0.1186983640546234 0.26188501241256062 -0.95777186148081694  -0.11873329660574115 0.261615609412787 -0.95784115446597362
-0.068996282000725467 0.75327597529184531 -0.65407554465688111  0.069124135183105104 0.7534327508752533 -0.65388144479235411
--0.30369631682393589 0.52293928186267558 -0.79643145005237248  -0.30395970967361996 0.52285425410030439 -0.79638679287413028
-0.30369631682393589 0.52293928186267569 -0.79643145005237237  0.30395970967362002 0.52285425410030417 -0.7963867928741305
--0.068996282000725426 0.75327597529184531 -0.65407554465688111  -0.069124135183103994 0.75343275087525308 -0.65388144479235433
-0.11869836405462342 0.26188501241256068 -0.95777186148081694  0.11873329660574071 0.26161560941278683 -0.95784115446597373
-0.26105426945011495 0.63457761123722189 -0.7274351680516471  0.26123864468751851 0.6346994542695118 -0.72726265769102449
-0.90598861546737175 0.11471241548978534 -0.40567809407889899  0.89961957659540837 0.11104418275858105 -0.42231955541009114
-0.89637854466934042 0.099164106023202955 -0.43023759412454343  0.89961957659540881 0.11104418275857367 -0.42231955541009181
-0.37506412073313466 -0.73422479552976916 -0.56417193374348928  0.38232288700972666 -0.72686052081252872 -0.57052869634461623
-0.39411849558532475 -0.7042679462719752 -0.58956860097969033  0.38232288700972988 -0.72686052081253349 -0.57052869634460812
-0.30729748704039861 -0.84278707285381271 -0.43974499787970978  0.29815500373095882 -0.84204499011931333 -0.44951510360071051
-0.31474205002823552 -0.83109069623026077 -0.45671715648324684  0.29815500373095516 -0.8420449901193181 -0.44951510360070401
-0.96705050472527376 0.21194916611186071 0.13775142693846479  0.95825269159637927 0.23889893330366113 0.1570957628794212
-0.40065939257699101 -0.69413734830776352 -0.59790562905682221  0.37763414062761885 -0.67726348918450008 -0.63143219909193449
-0.32993533901945349 -0.80654749644509327 -0.4886330537542477  0.31909818315151789 -0.81512028618526433 -0.48348243872828833
-0.3395133710973568 -0.79211156275892003 -0.50664961250726259  0.31909818315152677 -0.81512028618527188 -0.48348243872826996
-0.85145286645038376 0.14564781357706019 0.50275426427774228  0.85521146872291642 0.13337026124727785 0.50082503649440779
-0.24930895838975131 -0.93567470552212884 0.24579255546759937  0.2461133071928723 -0.9397552649709302 0.2372515162902103
--0.11869836405462342 -0.26188501241256068 -0.95777186148081694  -0.11873329660574071 -0.26161560941278683 -0.95784115446597373
--0.26105426945011495 -0.63457761123722189 -0.7274351680516471  -0.26123864468751851 -0.6346994542695118 -0.72726265769102449
--0.9151298141069959 0.23033669342916974 -0.33088129441328601  -0.91512008947987233 0.23057849677494924 -0.33073974459589123
--0.9151298141069959 -0.23033669342916982 -0.33088129441328606  -0.91512008947987211 -0.23057849677494924 -0.33073974459589173
--0.65407554465688111 0.068996282000725467 0.75327597529184531  -0.65388144479235299 0.069124135183103133 0.75343275087525441
--0.79643145005237248 -0.30369631682393589 0.52293928186267558  -0.79638679287412995 -0.30395970967361974 0.52285425410030517
--0.52293928186267569 0.79643145005237237 0.30369631682393589  -0.52285425410030517 0.79638679287412995 0.30395970967361968
--0.75327597529184531 0.65407554465688111 -0.068996282000725426  -0.75343275087525319 0.65388144479235433 -0.069124135183104007
--0.23033669342916974 -0.33088129441328601 0.9151298141069959  -0.23057849677494924 -0.33073974459589123 0.91512008947987233
-0.23033669342916982 -0.33088129441328606 0.9151298141069959  0.23057849677494924 -0.33073974459589167 0.91512008947987211
-0.88317063762809178 0.078036377421090528 0.46105412139556579  0.87829625280902357 0.071121388581566997 0.47279746233229458
-0.65407554465688111 0.068996282000725426 0.75327597529184531  0.65388144479235399 0.069124135183103508 0.75343275087525352
-0.65407554465688111 -0.068996282000725467 0.75327597529184531  0.65388144479235299 -0.069124135183103133 0.75343275087525441
-0.55521070025011254 0.82226795238624728 0.12310298935169575  0.71981609291735338 0.68947006137042033 0.080596692556612101
-0.75327597529184531 0.65407554465688111 -0.068996282000725467  0.75343275087525441 0.65388144479235299 -0.069124135183103133
-0.86156266551879135 0.15717574894030889 0.48126519958548886  0.86578380003691935 0.15629656115483412 0.4753838412954367
-0.44478929974988757 0.17773204761375261 0.87689701064830428  0.31590490687894768 0.24715310335759 0.91603462451509754
-0.26188501241256062 0.95777186148081694 0.1186983640546234  0.261615609412787 0.95784115446597362 0.11873329660574115
--0.33088129441328601 0.9151298141069959 -0.23033669342916974  -0.33073974459589123 0.91512008947987233 -0.23057849677494924
--0.33088129441328606 0.9151298141069959 0.23033669342916982  -0.3307397445958915 0.91512008947987211 0.23057849677494932
--0.26188501241256068 0.95777186148081694 0.11869836405462342  -0.26161560941278683 0.95784115446597373 0.11873329660574071
--0.63457761123722189 0.7274351680516471 0.26105426945011495  -0.63469945426951091 0.72726265769102516 0.26123864468751895
--0.95777186148081694 0.11869836405462342 0.26188501241256068  -0.95784115446597373 0.11873329660574071 0.26161560941278683
--0.7274351680516471 0.26105426945011495 0.63457761123722189  -0.72726265769102516 0.2612386446875189 0.6346994542695108
--0.79643145005237237 0.30369631682393589 0.52293928186267569  -0.79638679287412995 0.30395970967361968 0.52285425410030517
--0.65407554465688111 -0.068996282000725426 0.75327597529184531  -0.65388144479235388 -0.069124135183103744 0.75343275087525352
--0.26105426945011484 -0.63457761123722201 0.7274351680516471  -0.2612386446875179 -0.6346994542695118 0.72726265769102483
--0.1186983640546234 -0.26188501241256062 0.95777186148081694  -0.11873329660574115 -0.261615609412787 0.95784115446597362
-0.79643145005237237 0.30369631682393589 -0.52293928186267569  0.79638679287412995 0.30395970967361968 -0.52285425410030517
-0.65407554465688111 -0.068996282000725426 -0.75327597529184531  0.65388144479235388 -0.069124135183103744 -0.75343275087525352
-0.26105426945011484 -0.63457761123722201 -0.7274351680516471  0.2612386446875179 -0.6346994542695118 -0.72726265769102483
-0.1186983640546234 -0.26188501241256062 -0.95777186148081694  0.11873329660574115 -0.261615609412787 -0.95784115446597362
-0.23033669342916974 -0.33088129441328601 -0.9151298141069959  0.23057849677494924 -0.33073974459589123 -0.91512008947987233
--0.23033669342916982 -0.33088129441328606 -0.9151298141069959  -0.23057849677494924 -0.33073974459589167 -0.91512008947987211
--0.79643145005237237 -0.30369631682393589 -0.52293928186267569  -0.79638679287412995 -0.30395970967361968 -0.52285425410030517
--0.65407554465688111 0.068996282000725426 -0.75327597529184531  -0.65388144479235388 0.069124135183103744 -0.75343275087525352
--0.65407554465688111 -0.068996282000725467 -0.75327597529184531  -0.65388144479235299 -0.069124135183103133 -0.75343275087525441
--0.79643145005237248 0.30369631682393589 -0.52293928186267558  -0.79638679287412995 0.30395970967361974 -0.52285425410030517
--0.75327597529184531 0.65407554465688111 0.068996282000725467  -0.7534327508752533 0.65388144479235411 0.069124135183105104
--0.52293928186267558 0.79643145005237248 -0.30369631682393589  -0.52285425410030539 0.79638679287412983 -0.30395970967361963
--0.63457761123722201 0.72743516805164721 -0.2610542694501149  -0.63469945426951069 0.72726265769102572 -0.26123864468751773
--0.26188501241256062 0.95777186148081694 -0.1186983640546234  -0.261615609412787 0.95784115446597362 -0.11873329660574115
-0.33088129441328601 0.9151298141069959 0.23033669342916974  0.3307397445958915 0.915120089479872 0.23057849677494963
-0.33088129441328606 0.9151298141069959 -0.23033669342916982  0.3307397445958915 0.91512008947987211 -0.23057849677494932
-0.26188501241256068 0.95777186148081694 -0.11869836405462342  0.26161560941278683 0.95784115446597373 -0.11873329660574071
-0.63457761123722189 0.7274351680516471 -0.26105426945011495  0.63469945426951091 0.72726265769102516 -0.26123864468751895
-0.49314081475211935 -0.54531814984023863 -0.67677227421098896  0.49105853440619962 -0.56677814486533662 -0.66153159432474795
-0.7274351680516471 0.26105426945011495 -0.63457761123722189  0.72726265769102516 0.2612386446875189 -0.6346994542695108
-0.48978532609687886 -0.55056521742650477 -0.67476755984413894  0.49105853440622205 -0.56677814486535127 -0.66153159432471864
-0.79848519772427495 -0.05725079091428624 -0.59888293763788791  0.78019094274165357 -0.041329938271299098 -0.62417459822262911
-0.11869836405462342 -0.26188501241256068 0.95777186148081694  0.11873329660574071 -0.26161560941278683 0.95784115446597373
-0.26105426945011495 -0.63457761123722189 0.7274351680516471  0.26123864468751851 -0.6346994542695118 0.72726265769102449
-0.30369631682393589 -0.52293928186267569 0.79643145005237237  0.30395970967362002 -0.52285425410030417 0.7963867928741305
--0.068996282000725426 -0.75327597529184531 0.65407554465688111  -0.069124135183103744 -0.75343275087525352 0.65388144479235388
--0.63457761123722201 -0.7274351680516471 0.26105426945011484  -0.6346994542695118 -0.72726265769102483 0.2612386446875179
--0.26188501241256062 -0.95777186148081694 0.1186983640546234  -0.261615609412787 -0.95784115446597362 0.11873329660574115
--0.33088129441328601 -0.9151298141069959 0.23033669342916974  -0.33073974459589123 -0.91512008947987233 0.23057849677494924
--0.33088129441328606 -0.9151298141069959 -0.23033669342916982  -0.33073974459589173 -0.91512008947987211 -0.23057849677494924
--0.30369631682393589 -0.52293928186267569 -0.79643145005237237  -0.30395970967362002 -0.52285425410030417 -0.7963867928741305
-0.068996282000725426 -0.75327597529184531 -0.65407554465688111  0.069124135183103744 -0.75343275087525352 -0.65388144479235388
--0.068996282000725467 -0.75327597529184531 -0.65407554465688111  -0.069124135183103133 -0.75343275087525441 -0.65388144479235299
-0.30369631682393589 -0.52293928186267558 -0.79643145005237248  0.30395970967361974 -0.52285425410030517 -0.79638679287412995
-0.65407554465688111 0.068996282000725467 -0.75327597529184531  0.65388144479235299 0.069124135183103133 -0.75343275087525441
-0.44633019100468208 -0.62042776846682712 -0.64334361719230815  0.43611560071017003 -0.62405012717396335 -0.64835532047741207
-0.80104197563456969 -0.053122466844444174 -0.59574101077153174  0.79967159059344373 -0.0225286749783494 -0.60001483815108403
-0.79963678018449613 -0.055347528090576067 -0.59753024518837072  0.79967159059337956 -0.022528674978414182 -0.60001483815116718
-0.9151298141069959 0.23033669342916974 0.33088129441328601  0.91512008947987911 0.23057849677495398 0.33073974459586886
-0.24152064540259122 -0.94857068261000999 0.20072208160320942  0.22151649240577717 -0.95495693252433789 0.19745303394971786
-0.96105942755013962 0.20306848001363992 0.18186355091081879  0.96305716105844952 0.20064914867263406 0.17961298302457657
-0.9151298141069959 0.23033669342916982 -0.33088129441328606  0.91512008947987855 0.23057849677495176 -0.33073974459587202
-0.52293928186267569 0.79643145005237237 -0.30369631682393589  0.52285425410030517 0.79638679287412995 -0.30395970967361968
-0.75327597529184531 0.65407554465688111 0.068996282000725426  0.75343275087525341 0.65388144479235388 0.069124135183103522
--0.26188501241256068 -0.95777186148081694 -0.11869836405462342  -0.26161560941278683 -0.95784115446597373 -0.11873329660574071
--0.63457761123722189 -0.7274351680516471 -0.26105426945011495  -0.63469945426951091 -0.72726265769102516 -0.26123864468751895
--0.95777186148081694 -0.11869836405462342 -0.26188501241256068  -0.95784115446597373 -0.11873329660574071 -0.26161560941278683
--0.7274351680516471 -0.26105426945011495 -0.63457761123722189  -0.72726265769102516 -0.2612386446875189 -0.6346994542695108
--0.52293928186267569 -0.79643145005237237 -0.30369631682393589  -0.52285425410030517 -0.79638679287412995 -0.30395970967361968
--0.75327597529184531 -0.65407554465688111 0.068996282000725426  -0.75343275087525352 -0.65388144479235388 0.069124135183103758
--0.7274351680516471 -0.26105426945011484 0.63457761123722201  -0.72726265769102483 -0.2612386446875179 0.6346994542695118
--0.95777186148081694 -0.1186983640546234 0.26188501241256062  -0.95784115446597362 -0.11873329660574115 0.261615609412787
--0.75327597529184531 -0.65407554465688111 -0.068996282000725467  -0.75343275087525441 -0.65388144479235299 -0.069124135183103133
--0.52293928186267558 -0.79643145005237248 0.30369631682393589  -0.52285425410030517 -0.79638679287412995 0.30395970967361974
-0.068996282000725467 -0.75327597529184531 0.65407554465688111  0.069124135183103133 -0.75343275087525441 0.65388144479235299
--0.30369631682393589 -0.52293928186267558 0.79643145005237248  -0.30395970967361974 -0.52285425410030517 0.79638679287412995
--0.7274351680516471 0.26105426945011484 -0.63457761123722201  -0.72726265769102483 0.2612386446875179 -0.6346994542695118
--0.95777186148081694 0.1186983640546234 -0.26188501241256062  -0.95784115446597362 0.11873329660574115 -0.261615609412787
--0.9151298141069959 -0.23033669342916974 0.33088129441328601  -0.91512008947987233 -0.23057849677494924 0.33073974459589123
--0.9151298141069959 0.23033669342916982 0.33088129441328606  -0.91512008947987211 0.23057849677494932 0.3307397445958915
-0.17773204761375261 0.87689701064830428 0.44478929974988757  0.24715310335759094 0.91603462451509665 0.31590490687894951
-0.22681489975349639 0.89805158744476077 0.37520377518580433  0.23977066491307356 0.89859032272363215 0.36748531964499087
-0.13781977899394779 0.92483674698373319 0.35451755943338792  0.1381878583407713 0.92488389215866995 0.35425118465944577
-0.39128013241131554 0.21439421228553296 0.89457789356401551  0.40347958770451259 0.24084616951440777 0.88272155572186739
--0.52836121174546025 0.68346886752821701 0.50369111272938427  -0.52841879760671129 0.6837079082305223 0.50330613999723983
--0.33543172738922172 0.69401454380114691 0.63704738383668813  -0.3357171829316089 0.6939881493756167 0.63692575831934395
--0.46436496618972234 0.069930348042498203 0.88287877117884817  -0.4647686355560689 0.069884317336659021 0.88266998226615767
--0.34659997257597441 0.27249577181778545 0.89756031181852258  -0.34672764240957243 0.27221405186828118 0.89759648615318932
-0.24136787945551616 -0.067889430951449614 0.96805607891910661  0.24117598392814743 -0.068303541004110332 0.96807477555330912
-0.12122116383748825 0.13320400767343915 0.98364735641266243  0.12142771508337384 0.13297103911780941 0.98365340072891583
--0.24136787945551616 -0.067889430951449614 -0.96805607891910661  -0.24117598392814743 -0.068303541004110332 -0.96807477555330912
--0.12122116383748825 0.13320400767343915 -0.98364735641266243  -0.12142771508337384 0.13297103911780941 -0.98365340072891583
--0.61353851948571891 0.4604717807940108 -0.64151089172333209  -0.61382359089386196 0.46011525660260122 -0.64149399833801035
--0.42151877198336163 0.46863573506266104 -0.77633914798103421  -0.42177409750733547 0.46868822204941935 -0.77616877106981497
--0.13781977899394779 0.92483674698373319 -0.35451755943338792  -0.1381878583407713 0.92488389215866995 -0.35425118465944577
--0.13929176414434621 0.81523570763863507 -0.5621285844293008  -0.13924301275047207 0.81541586445899128 -0.56187930322157986
-0.52836121174546025 0.68346886752821701 -0.50369111272938427  0.52841879760671118 0.68370790823052263 -0.5033061399972395
-0.33543172738922172 0.69401454380114691 -0.63704738383668813  0.3357171829316089 0.6939881493756167 -0.63692575831934395
-0.46436496618972234 0.069930348042498203 -0.88287877117884817  0.4647686355560689 0.069884317336659021 -0.88266998226615767
-0.34659997257597441 0.27249577181778545 -0.89756031181852258  0.34672764240957243 0.27221405186828118 -0.89759648615318932
-0.069930348042498203 -0.88287877117884817 0.46436496618972234  0.069884317336659021 -0.88266998226615767 0.4647686355560689
-0.27249577181778539 -0.89756031181852236 0.34659997257597436  0.27221405186830722 -0.89759648615318299 0.34672764240956827
--0.067889430951449614 -0.96805607891910661 -0.24136787945551616  -0.068303541004109902 -0.9680747755533089 -0.2411759839281481
-0.13320400767343915 -0.98364735641266243 -0.12122116383748825  0.13297103911780983 -0.98365340072891594 -0.12142771508337313
-0.23259475183323844 -0.96237493457549972 -0.13494008765512316  0.21828391900492708 -0.96858479771763284 -0.11914537479123034
-0.23052646968895496 -0.9659260788205124 -0.10986054425367295  0.21828391900495353 -0.96858479771762251 -0.11914537479126541
-0.92600274487022971 0.1474180208074326 -0.34558774394436148  0.91762341400860992 0.15318437572857962 -0.36674489375563069
-0.92538907765393952 0.14644305776905853 -0.34753041451074101  0.91762341400883485 0.15318437572789123 -0.36674489375535524
-0.92780338960280884 0.1498743490715298 -0.34005641981910184  0.91762341400861536 0.15318437572861929 -0.36674489375560032
-0.73203596503112101 -0.16333083529035375 -0.66003296952840662  0.733157951295905 -0.17491713444451862 -0.65717837344917984
-0.10563529941394462 0.78429103445404746 0.61001812379817821  0.10429556095738519 0.78585236795603686 0.60955597917047288
-0.21439421228553288 0.89457789356401529 0.39128013241131548  0.24084616951440724 0.88272155572186584 0.40347958770451631
--0.46436496618972245 -0.069930348042498203 -0.88287877117884817  -0.46476863555606873 -0.069884317336659119 -0.88266998226615778
--0.34659997257597441 -0.27249577181778545 -0.89756031181852258  -0.34672764240957243 -0.27221405186828118 -0.89759648615318932
--0.96805607891910661 0.24136787945551613 0.067889430951449614  -0.9680747755533089 0.24117598392814801 0.068303541004109847
--0.98364735641266243 0.12122116383748827 -0.13320400767343918  -0.98365340072891583 0.12142771508337317 -0.13297103911780986
--0.35451755943338792 -0.13781977899394779 0.92483674698373319  -0.35425118465944588 -0.13818785834076969 0.92488389215867017
--0.5621285844293008 -0.13929176414434621 0.81523570763863529  -0.56187930322157975 -0.13924301275047163 0.81541586445899139
--0.68346886752821701 0.50369111272938438 0.52836121174546036  -0.68370790823052208 0.50330613999724039 0.52841879760671107
--0.69401454380114691 0.63704738383668813 0.33543172738922172  -0.69398814937561681 0.63692575831934384 0.33571718293160896
--0.24136787945551613 0.067889430951449614 0.96805607891910661  -0.24117598392814732 0.068303541004110277 0.96807477555330912
--0.12122116383748825 -0.13320400767343915 0.98364735641266243  -0.12142771508337388 -0.13297103911780939 0.98365340072891583
-0.50369111272938438 -0.52836121174546036 0.68346886752821701  0.50330613999724083 -0.52841879760671229 0.68370790823052086
-0.23259475183323847 -0.96237493457550005 0.13494008765512316  0.21828391900495392 -0.96858479771762052 0.11914537479128116
-0.35451755943338792 0.13781977899394779 0.92483674698373319  0.35425118465944633 0.13818785834076935 0.92488389215866995
-0.40180685413975104 0.20692923660476614 0.89148810692249203  0.4235080834275432 0.20738833035095472 0.88183387534488167
-0.92483674698373319 0.35451755943338792 0.13781977899394779  0.92488389215866984 0.35425118465944622 0.13818785834077099
-0.20692923660476614 0.89148810692249181 0.40180685413975092  0.20738833035095774 0.88183387534488222 0.42350808342754048
-0.85311732979922938 0.49982529754025784 0.14730961092137676  0.84145097432229177 0.51152737254408243 0.17406896607440822
-0.90687073458352596 0.28910030252843322 0.30397342055421106  0.90831680955776362 0.28893990864387653 0.30244718988225616
-0.067889430951449614 0.96805607891910661 -0.24136787945551613  0.068303541004109847 0.9680747755533089 -0.24117598392814801
--0.13320400767343918 0.98364735641266243 -0.12122116383748827  -0.13297103911780986 0.98365340072891583 -0.12142771508337317
--0.069930348042498217 0.88287877117884817 0.46436496618972245  -0.069884317336659146 0.88266998226615756 0.46476863555606907
--0.27249577181778539 0.89756031181852236 0.34659997257597436  -0.27221405186828151 0.8975964861531891 0.34672764240957249
--0.88287877117884817 0.46436496618972245 0.069930348042498217  -0.88266998226615767 0.4647686355560689 0.069884317336659035
--0.89756031181852236 0.34659997257597436 0.27249577181778539  -0.8975964861531891 0.34672764240957255 0.27221405186828151
--0.50369111272938427 0.52836121174546025 0.68346886752821701  -0.50330613999723928 0.52841879760671162 0.68370790823052252
--0.63704738383668813 0.33543172738922172 0.69401454380114691  -0.63692575831934395 0.3357171829316089 0.6939881493756167
--0.61353851948571891 -0.46047178079401074 0.64151089172333209  -0.61382359089386307 -0.4601152566026 0.64149399833801013
--0.42151877198336163 -0.46863573506266104 0.77633914798103421  -0.42177409750733547 -0.46868822204941935 0.77616877106981497
-0.50369111272938427 0.52836121174546025 -0.68346886752821701  0.50330613999723928 0.52841879760671162 -0.68370790823052252
-0.63704738383668813 0.33543172738922172 -0.69401454380114691  0.63692575831934395 0.3357171829316089 -0.6939881493756167
-0.23052646968895496 -0.96592607882051262 0.10986054425367281  0.21828391900495209 -0.96858479771762296 0.11914537479126489
-0.42151877198336163 -0.46863573506266104 -0.77633914798103421  0.42177409750733547 -0.46868822204941935 -0.77616877106981497
-0.24136787945551613 0.067889430951449614 -0.96805607891910661  0.24117598392814732 0.068303541004110277 -0.96807477555330912
-0.12122116383748825 -0.13320400767343915 -0.98364735641266243  0.12142771508337388 -0.13297103911780939 -0.98365340072891583
--0.50369111272938427 -0.52836121174546025 -0.68346886752821701  -0.50330613999723928 -0.52841879760671162 -0.68370790823052252
--0.63704738383668813 -0.33543172738922172 -0.69401454380114691  -0.63692575831934395 -0.3357171829316089 -0.6939881493756167
--0.35451755943338792 0.13781977899394779 -0.92483674698373319  -0.35425118465944633 0.13818785834076935 -0.92488389215866995
--0.5621285844293008 0.13929176414434621 -0.81523570763863529  -0.56187930322157975 0.13924301275047163 -0.81541586445899139
--0.92483674698373319 0.35451755943338792 -0.13781977899394779  -0.92488389215866995 0.35425118465944577 -0.1381878583407713
--0.81523570763863507 0.5621285844293008 -0.13929176414434621  -0.81541586445899128 0.56187930322157975 -0.13924301275047204
--0.46047178079401074 0.64151089172333209 -0.61353851948571891  -0.46011525660260011 0.64149399833801013 -0.61382359089386307
--0.46863573506266104 0.77633914798103421 -0.42151877198336163  -0.46868822204941929 0.77616877106981508 -0.42177409750733547
--0.067889430951449614 0.96805607891910661 0.24136787945551613  -0.068303541004109847 0.9680747755533089 0.24117598392814801
-0.13320400767343918 0.98364735641266243 0.12122116383748827  0.13297103911780986 0.98365340072891583 0.12142771508337317
-0.069930348042498217 0.88287877117884817 -0.46436496618972245  0.069884317336659035 0.88266998226615767 -0.4647686355560689
-0.27249577181778539 0.89756031181852236 -0.34659997257597436  0.27221405186828151 0.8975964861531891 -0.34672764240957249
-0.88287877117884817 0.46436496618972245 -0.069930348042498203  0.88266998226615778 0.46476863555606873 -0.069884317336659119
-0.89756031181852236 0.34659997257597436 -0.27249577181778539  0.89759648615318921 0.34672764240957232 -0.27221405186828113
-0.74532674141002397 -0.14250706129079604 0.65018159643527595  0.75649082974192605 -0.15162411868601797 0.63618531195639905
-0.96705050472527376 0.21194916611186074 -0.13775142693846454  0.95825269159637916 0.23889893330366063 -0.15709576287942265
-0.46436496618972245 -0.069930348042498203 0.88287877117884817  0.46476863555606873 -0.069884317336659119 0.88266998226615778
-0.34659997257597441 -0.27249577181778545 0.89756031181852258  0.34672764240957243 -0.27221405186828118 0.89759648615318932
-0.90598861546737153 0.11471241548978531 0.40567809407889893  0.89961957659540848 0.11104418275857067 0.42231955541009364
-0.33543172738922172 -0.69401454380114691 0.63704738383668813  0.33571718293160929 -0.69398814937561659 0.63692575831934384
--0.4604717807940108 -0.64151089172333209 0.61353851948571891  -0.46011525660260011 -0.64149399833801013 0.61382359089386307
--0.46863573506266104 -0.77633914798103421 0.42151877198336163  -0.46868822204941929 -0.77616877106981508 0.42177409750733547
-0.067889430951449614 -0.96805607891910661 0.24136787945551613  0.068303541004109847 -0.9680747755533089 0.24117598392814801
--0.13320400767343915 -0.98364735641266243 0.12122116383748825  -0.13297103911780983 -0.98365340072891583 0.12142771508337317
--0.52836121174546025 -0.68346886752821701 -0.50369111272938427  -0.52841879760671118 -0.68370790823052263 -0.5033061399972395
--0.33543172738922172 -0.69401454380114691 -0.63704738383668813  -0.3357171829316089 -0.6939881493756167 -0.63692575831934395
-0.13781977899394779 -0.92483674698373319 -0.35451755943338792  0.13818785834077099 -0.92488389215866984 -0.35425118465944622
-0.13929176414434621 -0.81523570763863529 -0.5621285844293008  0.13924301275047163 -0.81541586445899139 -0.56187930322157975
-0.35451755943338792 -0.13781977899394779 -0.92483674698373319  0.35425118465944588 -0.13818785834076969 -0.92488389215867017
-0.5621285844293008 -0.13929176414434621 -0.81523570763863529  0.56187930322157975 -0.13924301275047163 -0.81541586445899139
-0.89637854466934042 0.099164106023202803 0.43023759412454371  0.89961957659540848 0.11104418275857633 0.42231955541009214
-0.29057971437419006 -0.8695923485436825 0.39708487175152696  0.29603762580284054 -0.87653155169613028 0.37954467851649776
-0.96805607891910661 0.24136787945551616 -0.067889430951449614  0.96807477555330879 0.24117598392814713 -0.068303541004116106
-0.28617291708332143 -0.87638371280443872 0.38483791504434911  0.29603762580283904 -0.87653155169613239 0.37954467851649404
-0.69212177096286931 -0.22700206765185557 -0.68413337702600874  0.67531637414765366 -0.22527759233947589 -0.70228042917184819
-0.35314170479917451 -0.76928684914828649 -0.53075413092765567  0.36351224121620684 -0.7590008347087519 -0.54016347840018608
-0.68346886752821701 0.50369111272938438 -0.52836121174546036  0.68370790823052208 0.50330613999724039 -0.52841879760671107
-0.69401454380114691 0.63704738383668813 -0.33543172738922172  0.69398814937561681 0.63692575831934384 -0.33571718293160896
--0.069930348042498203 -0.88287877117884817 -0.46436496618972245  -0.069884317336659119 -0.88266998226615778 -0.46476863555606873
--0.27249577181778539 -0.89756031181852236 -0.34659997257597436  -0.27221405186828113 -0.89759648615318921 -0.34672764240957232
--0.88287877117884817 -0.46436496618972234 -0.069930348042498203  -0.88266998226615756 -0.46476863555606895 -0.069884317336659119
--0.89756031181852236 -0.34659997257597436 -0.27249577181778539  -0.89759648615318921 -0.34672764240957232 -0.27221405186828113
--0.68346886752821701 -0.50369111272938438 -0.52836121174546036  -0.68370790823052208 -0.50330613999724039 -0.52841879760671107
--0.69401454380114691 -0.63704738383668813 -0.33543172738922172  -0.69398814937561681 -0.63692575831934384 -0.33571718293160896
--0.64151089172333209 -0.61353851948571891 0.4604717807940108  -0.64149399833800991 -0.61382359089386296 0.46011525660260055
--0.77633914798103421 -0.42151877198336163 0.46863573506266104  -0.77616877106981497 -0.42177409750733547 0.46868822204941935
--0.92483674698373319 -0.35451755943338792 0.13781977899394779  -0.92488389215866995 -0.35425118465944577 0.1381878583407713
--0.81523570763863529 -0.5621285844293008 0.13929176414434621  -0.81541586445899139 -0.56187930322157975 0.13924301275047163
--0.13781977899394779 -0.92483674698373319 0.35451755943338792  -0.1381878583407713 -0.92488389215866995 0.35425118465944577
--0.13929176414434621 -0.81523570763863529 0.5621285844293008  -0.13924301275047163 -0.81541586445899139 0.56187930322157975
--0.64151089172333209 0.61353851948571891 -0.4604717807940108  -0.64149399833801013 0.61382359089386307 -0.46011525660260011
--0.77633914798103421 0.42151877198336163 -0.46863573506266104  -0.77616877106981497 0.42177409750733547 -0.46868822204941935
--0.96805607891910661 -0.24136787945551613 -0.067889430951449614  -0.9680747755533089 -0.24117598392814801 -0.068303541004109847
--0.98364735641266243 -0.12122116383748827 0.13320400767343918  -0.98365340072891583 -0.12142771508337317 0.13297103911780986
-0.061653318916405575 0.59501600355390494 0.80134563315795981  0.0624103178944031 0.59583045652862043 0.80068159669947159
-0.30397342055421117 0.90687073458352585 0.28910030252843327  0.3024471898822651 0.90831680955776517 0.28893990864386243
-0.24136787945551613 0.067889430951449614 0.96805607891910661  0.24117598392814746 0.068303541004110249 0.96807477555330901
-0.271410708194047 0.90595336478045674 0.32286639405373119  0.27087574504910017 0.91136373772562762 0.30990719304796471
--0.06165331891640554 0.59501600355390483 0.8013456331579597  -0.062410317894398985 0.59583045652862765 0.80068159669946648
-0.25671454238163 0.90442701067601727 0.33903474443581866  0.23862737818799382 0.91299254504580907 0.33091024020102572
-0.093588483842681203 0.68777595190194329 0.71884915497263779  0.10033016823456969 0.6857239871865588 0.72091363611669257
-0.89805158744476088 0.37520377518580417 0.22681489975349667  0.89859032272365158 0.36748531964495962 0.23977066491304894
--0.099757165525981073 0.49525883802792381 0.86299895207436528  -0.10098201560182304 0.4948484409268058 0.86309191459386458
--0.13183850301701977 0.66669512270283438 0.73357768674250445  -0.13227871496285437 0.6671197493120552 0.73311225719230522
-0.069930348042498217 0.88287877117884817 0.46436496618972251  0.069884317336659049 0.88266998226615712 0.46476863555606984
--0.13929176414434621 0.81523570763863507 0.5621285844293008  -0.13924301275047377 0.81541586445899017 0.56187930322158108
--1.2262216765384848e-18 0.43360551911151823 0.90110279868394083  0 0.43243812303240703 0.90166361230128866
--0.21331917890744348 0.45337594379539092 0.86541618975952417  -0.2140314567980563 0.45308829251399863 0.86539097215515892
--0.46047178079401074 0.64151089172333209 0.61353851948571902  -0.46011525660260089 0.64149399833800969 0.61382359089386285
--0.42151877198336168 0.46863573506266087 0.77633914798103421  -0.4217740975073358 0.46868822204941818 0.77616877106981552
-0.099757165525981059 0.49525883802792381 0.86299895207436528  0.10098201560182403 0.49484844092680619 0.86309191459386425
--1.2287154012371122e-18 0.32153744077837104 0.94689686564994791  0 0.32080957755114525 0.94714371399036157
--0.35451755943338797 0.13781977899394779 0.92483674698373319  -0.35425118465944633 0.13818785834077102 0.92488389215866984
--0.12122116383748827 0.13320400767343918 0.98364735641266243  -0.12142771508337373 0.13297103911780947 0.98365340072891583
--0.099757165525981059 0.49525883802792381 -0.86299895207436528  -0.10098201560182213 0.4948484409268048 -0.86309191459386525
-1.2287154012371122e-18 0.32153744077837104 -0.94689686564994791  0 0.32080957755114525 -0.94714371399036157
-0.35451755943338797 0.13781977899394779 -0.92483674698373319  0.35425118465944633 0.13818785834077102 -0.92488389215866984
-0.12122116383748827 0.13320400767343918 -0.98364735641266243  0.12142771508337373 0.13297103911780947 -0.98365340072891583
--0.061653318916405575 0.59501600355390494 -0.80134563315795981  -0.062410317894398999 0.59583045652862787 -0.80068159669946648
--0.21331917890744351 0.45337594379539092 -0.86541618975952417  -0.21403145679805605 0.4530882925139984 -0.86539097215515914
--0.24136787945551613 0.067889430951449614 -0.96805607891910661  -0.24117598392814746 0.068303541004110249 -0.96807477555330901
--0.34659997257597425 0.27249577181778528 -0.89756031181852247  -0.34672764240957155 0.27221405186828268 -0.8975964861531891
-0.061653318916405561 0.59501600355390494 -0.8013456331579597  0.062410317894399187 0.59583045652862754 -0.8006815966994667
--0.13183850301701969 0.66669512270283426 -0.73357768674250456  -0.13227871496285429 0.66711974931205509 -0.73311225719230533
--0.50369111272938427 0.52836121174546036 -0.68346886752821701  -0.50330613999724005 0.52841879760671107 -0.6837079082305223
--0.33543172738922172 0.69401454380114713 -0.63704738383668802  -0.33571718293161007 0.69398814937561648 -0.63692575831934362
-0.099757165525981087 0.49525883802792392 -0.86299895207436528  0.10098201560182304 0.4948484409268058 -0.86309191459386458
-0.13183850301701977 0.66669512270283438 -0.73357768674250434  0.13227871496285484 0.66711974931205509 -0.73311225719230511
--0.069930348042498217 0.88287877117884817 -0.46436496618972251  -0.069884317336658938 0.88266998226615723 -0.46476863555606968
-0.13929176414434621 0.81523570763863507 -0.5621285844293008  0.13924301275047377 0.81541586445899017 -0.56187930322158108
-1.2262216765384848e-18 0.43360551911151823 -0.90110279868394083  -1.1076796126959499e-15 0.43243812303240758 -0.90166361230128844
-0.21331917890744348 0.45337594379539092 -0.86541618975952417  0.2140314567980563 0.45308829251399863 -0.86539097215515892
-0.46047178079401074 0.64151089172333209 -0.61353851948571902  0.46011525660260089 0.64149399833800969 -0.61382359089386285
-0.42151877198336168 0.46863573506266087 -0.77633914798103421  0.4217740975073358 0.46868822204941818 -0.77616877106981552
-0.36517401588679055 -0.75000000000000011 -0.54975734503310147  0.36351224121617498 -0.75900083470875257 -0.54016347840020651
-0.97371394847093473 0.22313250261608547 -0.018534606855888307  0.97011569110293328 0.24165005293363567 -0.021927101793196371
-0.22648000271342913 -0.97241808576487487 0.034988854233130556  0.21668703966435113 -0.97542959357555314 0.039797422259881816
-0.50622685812276524 -0.52571510245600384 -0.6834170246153628  0.54199242061149877 -0.50624478547213547 -0.67079090123671159
-0.49314081475211924 -0.54531814984023841 0.67677227421098896  0.49105853440620695 -0.56677814486533507 0.66153159432474384
-0.48978532609687886 -0.55056521742650477 0.67476755984413894  0.49105853440620217 -0.56677814486533251 0.66153159432474951
-0.13781977899394779 -0.92483674698373319 0.35451755943338797  0.13818785834077099 -0.92488389215866973 0.35425118465944627
-0.13320400767343918 -0.98364735641266243 0.12122116383748827  0.13297103911780991 -0.98365340072891594 0.12142771508337302
-0.69531998299352837 -0.22171162891211948 0.68272481536695295  0.70341121140141549 -0.24317084427691493 0.66789266216095355
-0.69607577061268988 -0.22054081151139987 0.68235511400187043  0.70341121140139107 -0.24317084427690094 0.66789266216098442
-0.067889430951449614 -0.96805607891910661 -0.24136787945551613  0.068303541004109819 -0.9680747755533089 -0.24117598392814821
-0.27249577181778528 -0.89756031181852247 -0.34659997257597425  0.27221405186828412 -0.89759648615318754 -0.34672764240957432
-0.97256579272521648 0.22114863140943247 0.060907607905721736  0.97824013612619498 0.2023295205475559 0.045923862934206007
-0.30729748704039866 -0.84278707285381271 0.43974499787970989  0.29815500373095982 -0.84204499011931699 0.44951510360070301
-0.31474205002823563 -0.83109069623026088 0.45671715648324701  0.29815500373095521 -0.84204499011931666 0.44951510360070684
-0.94691066341902053 0.17998804508785299 -0.26439588316448503  0.95675731372081363 0.1595843916717562 -0.24320416233380587
-0.45944041532897173 -0.59972505245462004 -0.653998898413091  0.47623926703786867 -0.60557549052406512 -0.63755351603435739
-0.61696807586665503 -0.34742682425518878 -0.70495163176324005  0.60285708655996961 -0.35990150486609107 -0.71206336795228298
-0.6078561560079746 -0.36184045701812123 -0.70538094374692584  0.60285708655996939 -0.35990150486608774 -0.71206336795228498
-0.40435813432554835 -0.6879005781223142 -0.60211592452938856  0.41977894187290826 -0.66093884463189856 -0.62204942216572534
-0.80134563315795981 0.061653318916405575 0.59501600355390494  0.80068159669946759 0.062410317894398069 0.59583045652862632
-0.89457789356401518 0.39128013241131554 0.21439421228553296  0.8827215557218655 0.40347958770451159 0.24084616951441637
-0.96805607891910661 0.24136787945551613 0.067889430951449614  0.96807477555330812 0.24117598392814721 0.068303541004124849
-0.15717574894030886 0.48126519958548875 0.86156266551879135  0.15629656115482837 0.47538384129543992 0.86578380003691857
--1.2262216765384848e-18 -0.43360551911151823 -0.90110279868394083  0 -0.43243812303240703 -0.90166361230128866
--0.21331917890744348 -0.45337594379539092 -0.86541618975952417  -0.2140314567980563 -0.45308829251399863 -0.86539097215515892
--0.46047178079401074 -0.64151089172333209 -0.61353851948571902  -0.46011525660260089 -0.64149399833800969 -0.61382359089386285
--0.42151877198336168 -0.46863573506266087 -0.77633914798103421  -0.4217740975073358 -0.46868822204941818 -0.77616877106981552
--0.86299895207436528 0.099757165525981059 -0.49525883802792381  -0.86309191459386514 0.10098201560182231 -0.49484844092680491
--0.94689686564994791 -1.2287154012371122e-18 -0.32153744077837104  -0.94714371399036157 0 -0.32080957755114525
--0.92483674698373297 -0.35451755943338792 -0.13781977899394779  -0.92488389215866973 -0.35425118465944627 -0.13818785834077105
--0.98364735641266243 -0.12122116383748827 -0.13320400767343918  -0.98365340072891594 -0.12142771508337305 -0.13297103911780991
--0.8013456331579597 0.06165331891640554 0.59501600355390483  -0.80068159669946648 0.062410317894397077 0.59583045652862787
--0.73357768674250456 -0.13183850301701969 0.66669512270283426  -0.73311225719230411 -0.13227871496285351 0.66711974931205642
--0.68346886752821701 -0.50369111272938427 0.52836121174546036  -0.6837079082305223 -0.50330613999724005 0.52841879760671107
--0.63704738383668802 -0.33543172738922172 0.69401454380114713  -0.6369257583193435 -0.33571718293160868 0.69398814937561715
--0.49525883802792392 0.86299895207436528 0.099757165525981087  -0.49484844092680513 0.86309191459386492 0.10098201560182224
--0.66669512270283438 0.73357768674250434 0.13183850301701977  -0.66711974931205664 0.73311225719230422 0.13227871496285293
--0.88287877117884817 0.46436496618972251 -0.069930348042498217  -0.88266998226615723 0.46476863555606968 -0.069884317336658938
--0.81523570763863507 0.5621285844293008 0.13929176414434621  -0.81541586445899006 0.56187930322158097 0.13924301275047377
--0.099757165525981059 -0.49525883802792381 0.86299895207436528  -0.10098201560182309 -0.49484844092680558 0.8630919145938647
-1.2287154012371122e-18 -0.32153744077837104 0.94689686564994791  0 -0.32080957755114525 0.94714371399036157
-0.35451755943338797 -0.13781977899394779 0.92483674698373319  0.35425118465944633 -0.13818785834077102 0.92488389215866984
-0.12122116383748827 -0.13320400767343918 0.98364735641266243  0.12142771508337367 -0.1329710391178095 0.98365340072891583
-0.42861413394522363 -0.64891100701386606 -0.6271743261149485  0.41977894187289888 -0.66093884463190555 -0.62204942216572423
-0.73357768674250445 -0.13183850301701977 0.66669512270283438  0.73311225719230477 -0.13227871496285407 0.66711974931205564
-0.46436496618972256 0.069930348042498217 0.88287877117884817  0.46476863555606907 0.069884317336659313 0.88266998226615745
-0.5621285844293008 -0.13929176414434621 0.81523570763863507  0.56187930322157997 -0.13924301275047157 0.81541586445899106
-0.26758089404998364 -0.9059728893652188 0.32585692434233743  0.24890531892629392 -0.91663390223888863 0.31277536903744108
-0.095362650095153129 0.74011618472454033 0.66455433327713254  0.10275236361909811 0.73743092048487702 0.66756092552179502
-0.39229183849441457 0.893825128737608 0.21405999957086966  0.39311654818379393 0.89197584375894701 0.22324532177533571
-0.41582096722616779 0.88692657891222382 0.1974660445788706  0.42149610172113317 0.88421545010984037 0.201256239706849
-0.59501600355390494 0.8013456331579597 -0.061653318916405561  0.59583045652862865 0.80068159669946604 -0.062410317894396571
-0.88692657891222382 0.1974660445788706 0.41582096722616779  0.88421545010984026 0.20125623970685644 0.42149610172112989
-0.87689701064830428 0.44478929974988757 0.17773204761375266  0.8726529832451837 0.46036815782148133 0.162904665670867
-0.35660859546245854 0.90157505838463314 0.24184951424973428  0.36356562872996251 0.89862238304022868 0.24555619785557764
-0.59501600355390494 0.80134563315795981 0.061653318916405575  0.59583045652862732 0.80068159669946681 0.062410317894397924
-0.85818780510941439 0.48898817612201739 0.15304821643557714  0.86108611456980655 0.47782642632713784 0.17381774822644047
-0.067889430951449614 0.96805607891910661 0.24136787945551613  0.068303541004109777 0.9680747755533089 0.24117598392814812
-0.82968743367193953 0.12850859076870802 0.5423386494351099  0.83543687458500482 0.14218930946431604 0.53087421189741346
--0.49525883802792381 0.86299895207436528 -0.099757165525981059  -0.49484844092680491 0.86309191459386514 -0.10098201560182231
--0.32153744077837104 0.94689686564994791 1.2287154012371122e-18  -0.32080957755114525 0.94714371399036157 0
--0.13781977899394779 0.92483674698373319 0.35451755943338797  -0.1381878583407708 0.92488389215866984 0.35425118465944627
--0.13320400767343918 0.98364735641266243 0.12122116383748827  -0.13297103911780991 0.98365340072891594 0.12142771508337305
--0.43360551911151823 0.90110279868394083 1.2262216765384848e-18  -0.43243812303240797 0.90166361230128833 0
--0.45337594379539092 0.86541618975952417 0.21331917890744348  -0.45308829251399857 0.86539097215515892 0.21403145679805627
--0.64151089172333209 0.61353851948571902 0.46047178079401074  -0.64149399833800991 0.61382359089386251 0.46011525660260127
--0.46863573506266099 0.77633914798103421 0.42151877198336174  -0.46868822204941957 0.77616877106981486 0.42177409750733541
--0.90110279868394083 1.2262216765384848e-18 0.43360551911151823  -0.90166361230128833 0 0.43243812303240797
--0.86541618975952417 0.21331917890744348 0.45337594379539092  -0.86539097215515892 0.21403145679805627 0.45308829251399857
--0.61353851948571902 0.46047178079401074 0.64151089172333209  -0.61382359089386329 0.46011525660260061 0.64149399833800946
--0.77633914798103421 0.42151877198336174 0.46863573506266099  -0.77616877106981552 0.4217740975073358 0.46868822204941812
--0.86299895207436528 0.099757165525981073 0.49525883802792381  -0.86309191459386503 0.10098201560182225 0.49484844092680519
--0.73357768674250445 0.13183850301701977 0.66669512270283438  -0.73311225719230411 0.13227871496285362 0.66711974931205642
--0.46436496618972251 -0.069930348042498217 0.88287877117884817  -0.46476863555606968 -0.069884317336658938 0.88266998226615723
--0.5621285844293008 0.13929176414434621 0.81523570763863507  -0.56187930322157997 0.13924301275047157 0.81541586445899106
--0.061653318916405582 -0.59501600355390505 0.80134563315795981  -0.062410317894398978 -0.59583045652862754 0.8006815966994667
--0.21331917890744351 -0.45337594379539092 0.86541618975952417  -0.21403145679805605 -0.4530882925139984 0.86539097215515914
--0.24136787945551613 -0.067889430951449614 0.96805607891910661  -0.24117598392814743 -0.068303541004110221 0.96807477555330912
--0.34659997257597425 -0.27249577181778528 0.89756031181852247  -0.34672764240957155 -0.27221405186828268 0.8975964861531891
-0.86299895207436528 0.099757165525981073 -0.49525883802792381  0.86309191459386503 0.10098201560182218 -0.49484844092680508
-0.73357768674250445 0.13183850301701977 -0.66669512270283438  0.73311225719230411 0.13227871496285362 -0.66711974931205642
-0.46436496618972251 -0.069930348042498217 -0.88287877117884817  0.46476863555606968 -0.069884317336658938 -0.88266998226615723
-0.5621285844293008 0.13929176414434621 -0.81523570763863507  0.56187930322157997 0.13924301275047157 -0.81541586445899106
-0.061653318916405582 -0.59501600355390505 -0.80134563315795981  0.062410317894398978 -0.59583045652862754 -0.8006815966994667
-0.21331917890744351 -0.45337594379539092 -0.86541618975952417  0.21403145679805605 -0.4530882925139984 -0.86539097215515914
-0.24136787945551613 -0.067889430951449614 -0.96805607891910661  0.24117598392814743 -0.068303541004110221 -0.96807477555330912
-0.34659997257597425 -0.27249577181778528 -0.89756031181852247  0.34672764240957155 -0.27221405186828268 -0.8975964861531891
-0.099757165525981059 -0.49525883802792381 -0.86299895207436528  0.10098201560182309 -0.49484844092680558 -0.8630919145938647
--1.2287154012371122e-18 -0.32153744077837104 -0.94689686564994791  0 -0.32080957755114525 -0.94714371399036157
--0.35451755943338797 -0.13781977899394779 -0.92483674698373319  -0.35425118465944633 -0.13818785834077102 -0.92488389215866984
--0.12122116383748827 -0.13320400767343918 -0.98364735641266243  -0.12142771508337367 -0.1329710391178095 -0.98365340072891583
--0.86299895207436528 -0.099757165525981073 -0.49525883802792381  -0.86309191459386503 -0.10098201560182225 -0.49484844092680519
--0.73357768674250445 -0.13183850301701977 -0.66669512270283438  -0.73311225719230411 -0.13227871496285362 -0.66711974931205642
--0.46436496618972256 0.069930348042498217 -0.88287877117884817  -0.46476863555606907 0.069884317336659313 -0.88266998226615745
--0.5621285844293008 -0.13929176414434621 -0.81523570763863507  -0.56187930322157997 -0.13924301275047157 -0.81541586445899106
--0.8013456331579597 -0.06165331891640554 -0.59501600355390483  -0.80068159669946637 -0.062410317894396848 -0.59583045652862809
--0.73357768674250456 0.13183850301701969 -0.66669512270283426  -0.73311225719230411 0.13227871496285351 -0.66711974931205642
--0.68346886752821701 0.50369111272938438 -0.52836121174546036  -0.68370790823052185 0.50330613999724083 -0.52841879760671095
--0.63704738383668802 0.33543172738922172 -0.69401454380114713  -0.6369257583193435 0.33571718293160868 -0.69398814937561715
--0.59501600355390494 0.8013456331579597 0.061653318916405561  -0.59583045652862865 0.80068159669946604 0.062410317894396571
--0.66669512270283426 0.73357768674250456 -0.13183850301701969  -0.66711974931205642 0.73311225719230422 -0.13227871496285357
--0.52836121174546025 0.68346886752821701 -0.50369111272938438  -0.52841879760671151 0.68370790823052274 -0.50330613999723905
--0.69401454380114724 0.63704738383668813 -0.33543172738922178  -0.69398814937561737 0.63692575831934306 -0.33571718293160957
--0.59501600355390505 0.80134563315795981 -0.061653318916405582  -0.59583045652862798 0.80068159669946648 -0.062410317894396924
--0.45337594379539092 0.86541618975952417 -0.21331917890744351  -0.4530882925139984 0.86539097215515914 -0.21403145679805605
--0.067889430951449614 0.96805607891910661 -0.24136787945551613  -0.068303541004109777 0.9680747755533089 -0.24117598392814812
--0.27249577181778528 0.89756031181852247 -0.34659997257597425  -0.27221405186828107 0.89759648615318954 -0.34672764240957177
-0.49525883802792381 0.86299895207436528 0.099757165525981059  0.49484844092680819 0.86309191459386347 0.10098201560182053
-0.32153744077837104 0.94689686564994791 -1.2287154012371122e-18  0.32080957755114525 0.94714371399036157 0
-0.13781977899394779 0.92483674698373319 -0.35451755943338797  0.1381878583407708 0.92488389215866984 -0.35425118465944627
-0.13320400767343918 0.98364735641266243 -0.12122116383748827  0.13297103911780991 0.98365340072891594 -0.12142771508337305
-0.43360551911151823 0.90110279868394083 -1.2262216765384848e-18  0.43243812303240797 0.90166361230128833 0
-0.45337594379539092 0.86541618975952417 -0.21331917890744348  0.45308829251399857 0.86539097215515892 -0.21403145679805627
-0.64151089172333209 0.61353851948571902 -0.46047178079401074  0.64149399833801013 0.61382359089386251 -0.46011525660260078
-0.46863573506266099 0.77633914798103421 -0.42151877198336174  0.46868822204941957 0.77616877106981486 -0.42177409750733541
-0.26791287934591501 -0.90549608434201145 0.3269900786062353  0.24890531892650397 -0.91663390223885366 0.31277536903737635
-0.86541618975952417 0.21331917890744348 -0.45337594379539092  0.86539097215515892 0.21403145679805627 -0.45308829251399857
-0.61353851948571902 0.46047178079401074 -0.64151089172333209  0.61382359089386329 0.46011525660260061 -0.64149399833800946
-0.77633914798103421 0.42151877198336168 -0.46863573506266087  0.77616877106981552 0.4217740975073358 -0.46868822204941818
-0.26660413751883805 -0.90759811547986113 0.3218712605625344  0.24890531892629586 -0.9166339022388903 0.31277536903743486
-0.74532674141002375 -0.14250706129079604 -0.65018159643527595  0.75649082974193027 -0.15162411868602041 -0.6361853119563935
-0.97256579272521637 0.22114863140943242 -0.060907607905721597  0.97824013612619609 0.20232952054755199 -0.045923862934199415
-0.56731181848165257 -0.42664579118104862 -0.70294074606773127  0.56065793252598195 -0.42546670457134661 -0.71038071904922218
-1.2262216765384848e-18 -0.43360551911151823 0.90110279868394083  0 -0.43243812303240703 0.90166361230128866
-0.21331917890744348 -0.45337594379539092 0.86541618975952417  0.2140314567980563 -0.45308829251399863 0.86539097215515892
-0.57556494808430081 -0.41363385795819674 -0.70422028778974766  0.56065793252598206 -0.42546670457134622 -0.7103807190492224
-0.42151877198336168 -0.46863573506266087 0.77633914798103421  0.4217740975073358 -0.46868822204941818 0.77616877106981552
-0.099757165525981087 -0.49525883802792392 0.86299895207436528  0.10098201560182304 -0.4948484409268058 0.86309191459386458
-0.13183850301701977 -0.66669512270283438 0.73357768674250434  0.13227871496285484 -0.66711974931205509 0.73311225719230511
--0.069930348042498217 -0.88287877117884817 0.46436496618972251  -0.069884317336658938 -0.88266998226615723 0.46476863555606968
-0.13929176414434621 -0.81523570763863507 0.5621285844293008  0.13924301275047157 -0.81541586445899106 0.56187930322157997
--0.59501600355390505 -0.80134563315795981 0.061653318916405582  -0.59583045652862865 -0.80068159669946604 0.062410317894396668
--0.45337594379539092 -0.86541618975952417 0.21331917890744351  -0.4530882925139984 -0.86539097215515914 0.21403145679805605
--0.067889430951449614 -0.96805607891910661 0.24136787945551613  -0.068303541004109777 -0.9680747755533089 0.24117598392814812
--0.27249577181778528 -0.89756031181852247 0.34659997257597425  -0.27221405186828107 -0.89759648615318954 0.34672764240957177
--0.49525883802792381 -0.86299895207436528 0.099757165525981059  -0.49484844092680491 -0.86309191459386514 0.10098201560182231
--0.32153744077837104 -0.94689686564994791 -1.2287154012371122e-18  -0.32080957755114525 -0.94714371399036157 0
--0.13781977899394779 -0.92483674698373319 -0.35451755943338797  -0.13818785834077099 -0.92488389215866973 -0.35425118465944627
--0.13320400767343918 -0.98364735641266243 -0.12122116383748827  -0.13297103911780991 -0.98365340072891594 -0.12142771508337298
--0.099757165525981087 -0.49525883802792392 -0.86299895207436528  -0.10098201560182304 -0.4948484409268058 -0.86309191459386458
--0.13183850301701977 -0.66669512270283438 -0.73357768674250434  -0.13227871496285484 -0.66711974931205509 -0.73311225719230511
-0.069930348042498217 -0.88287877117884817 -0.46436496618972256  0.069884317336659313 -0.88266998226615756 -0.46476863555606912
--0.13929176414434621 -0.81523570763863507 -0.5621285844293008  -0.13924301275047157 -0.81541586445899106 -0.56187930322157997
--0.061653318916405561 -0.59501600355390494 -0.8013456331579597  -0.062410317894398937 -0.59583045652862754 -0.80068159669946659
-0.13183850301701969 -0.66669512270283426 -0.73357768674250456  0.13227871496285543 -0.66711974931205498 -0.73311225719230522
-0.50369111272938438 -0.52836121174546036 -0.68346886752821701  0.50330613999722795 -0.5284187976067054 -0.68370790823053562
-0.33543172738922172 -0.69401454380114713 -0.63704738383668802  0.33571718293160957 -0.69398814937561559 -0.63692575831934484
-0.8013456331579597 0.06165331891640554 -0.59501600355390483  0.80068159669946648 0.062410317894397077 -0.59583045652862787
-0.73357768674250456 -0.13183850301701969 -0.66669512270283426  0.73311225719230488 -0.13227871496285401 -0.66711974931205553
-0.95663400990185354 0.19602936533555493 -0.2109426096162656  0.95495693252433866 0.19745303394970615 -0.22151649240578419
-0.33951337109735685 -0.79211156275891992 0.50664961250726281  0.31909818315152372 -0.81512028618526733 0.48348243872827956
-0.32993533901945349 -0.80654749644509338 0.4886330537542477  0.31909818315151811 -0.81512028618526333 0.48348243872828994
-0.24930895838975137 -0.93567470552212906 -0.24579255546759976  0.24611330719286467 -0.93975526497093065 -0.23725151629021604
-0.9253890776539393 0.14644305776905842 0.34753041451074107  0.91762341400861369 0.15318437572858953 0.36674489375561692
-0.92600274487022949 0.1474180208074326 0.34558774394436131  0.91762341400881287 0.15318437572798788 0.36674489375536989
-0.86299895207436528 0.099757165525981059 0.49525883802792381  0.86309191459386403 0.10098201560182078 0.49484844092680708
-0.92780338960280884 0.14987434907153019 0.34005641981910062  0.91762341400881287 0.15318437572798788 0.36674489375536989
-0.83001349060802176 -0.0073066631575244394 -0.55678551944213672  0.83494479465357463 -0.020957685934281423 -0.5499345099929448
-0.76687916779802345 -0.10789205109760858 -0.63136143448574888  0.7587780543030439 -0.10723544565538685 -0.64246122334595235
-0.83001349060802165 -0.0073066631575244463 0.55678551944213661  0.83494479465357618 -0.020957685934293872 0.54993450999294191
-0.85822228618686602 0.038871133598592081 -0.51061830246204121  0.85590248058787277 0.033910248167246401 -0.51602426182570316
-0.92483674698373297 0.35451755943338792 -0.13781977899394779  0.92488389215866973 0.35425118465944627 -0.13818785834077105
-0.85756840681366708 0.037892913779084561 -0.51176714118576794  0.85590248058785579 0.033910248167175396 -0.51602426182573624
-0.49525883802792392 0.86299895207436528 -0.099757165525981087  0.49484844092680513 0.86309191459386492 -0.10098201560182224
-0.66669512270283438 0.73357768674250434 -0.13183850301701977  0.66711974931205664 0.73311225719230422 -0.13227871496285293
-0.88287877117884817 0.46436496618972256 0.069930348042498217  0.88266998226615745 0.46476863555606907 0.069884317336659313
-0.81523570763863507 0.5621285844293008 -0.13929176414434621  0.81541586445899117 0.56187930322158008 -0.1392430127504716
--0.43360551911151823 -0.90110279868394083 -1.2262216765384848e-18  -0.43243812303240797 -0.90166361230128833 0
--0.45337594379539092 -0.86541618975952417 -0.21331917890744348  -0.45308829251399857 -0.86539097215515892 -0.21403145679805627
--0.64151089172333209 -0.61353851948571902 -0.46047178079401074  -0.64149399833801013 -0.61382359089386251 -0.46011525660260078
--0.46863573506266087 -0.77633914798103421 -0.42151877198336168  -0.46868822204941957 -0.77616877106981486 -0.42177409750733547
--0.90110279868394083 -1.2262216765384848e-18 -0.43360551911151823  -0.90166361230128833 0 -0.43243812303240797
--0.86541618975952417 -0.21331917890744348 -0.45337594379539092  -0.86539097215515892 -0.21403145679805627 -0.45308829251399857
--0.61353851948571902 -0.46047178079401074 -0.64151089172333209  -0.61382359089386329 -0.46011525660260061 -0.64149399833800946
--0.77633914798103421 -0.42151877198336168 -0.46863573506266087  -0.77616877106981552 -0.4217740975073358 -0.46868822204941818
--0.49525883802792392 -0.86299895207436528 -0.099757165525981087  -0.49484844092680513 -0.86309191459386492 -0.10098201560182224
--0.66669512270283438 -0.73357768674250434 -0.13183850301701977  -0.66711974931205664 -0.73311225719230422 -0.13227871496285293
--0.88287877117884817 -0.46436496618972251 0.069930348042498217  -0.88266998226615712 -0.46476863555606984 0.069884317336659049
--0.81523570763863507 -0.5621285844293008 -0.13929176414434621  -0.81541586445899117 -0.56187930322158008 -0.1392430127504716
--0.80134563315795981 -0.061653318916405575 0.59501600355390494  -0.80068159669946681 -0.06241031789439732 0.59583045652862754
--0.86541618975952417 -0.21331917890744351 0.45337594379539092  -0.86539097215515914 -0.21403145679805605 0.4530882925139984
--0.96805607891910661 -0.24136787945551613 0.067889430951449614  -0.9680747755533089 -0.24117598392814812 0.068303541004109777
--0.89756031181852258 -0.3465999725759743 0.27249577181778534  -0.89759648615318943 -0.34672764240957177 0.27221405186828118
--0.59501600355390494 -0.8013456331579597 -0.061653318916405561  -0.59583045652862865 -0.80068159669946604 -0.062410317894396571
--0.66669512270283426 -0.73357768674250456 0.13183850301701969  -0.66711974931205642 -0.73311225719230411 0.13227871496285348
--0.52836121174546036 -0.68346886752821701 0.50369111272938438  -0.52841879760671151 -0.68370790823052208 0.50330613999723994
--0.69401454380114724 -0.63704738383668813 0.33543172738922178  -0.69398814937561726 -0.6369257583193435 0.33571718293160868
-0.061653318916405561 -0.59501600355390494 0.8013456331579597  0.062410317894398937 -0.59583045652862754 0.80068159669946659
--0.13183850301701969 -0.66669512270283426 0.73357768674250456  -0.13227871496285543 -0.66711974931205498 0.73311225719230522
--0.50369111272938438 -0.52836121174546025 0.68346886752821701  -0.50330613999723905 -0.52841879760671151 0.68370790823052274
--0.33543172738922172 -0.69401454380114713 0.63704738383668802  -0.33571718293160874 -0.69398814937561726 0.6369257583193435
--0.80134563315795981 0.061653318916405582 -0.59501600355390505  -0.8006815966994667 0.062410317894397119 -0.59583045652862776
--0.86541618975952417 0.21331917890744351 -0.45337594379539092  -0.86539097215515914 0.21403145679805605 -0.4530882925139984
--0.96805607891910661 0.24136787945551613 -0.067889430951449614  -0.9680747755533089 0.24117598392814812 -0.068303541004109777
--0.89756031181852258 0.3465999725759743 -0.27249577181778534  -0.89759648615318943 0.34672764240957177 -0.27221405186828118
--0.86299895207436528 -0.099757165525981059 0.49525883802792381  -0.86309191459386514 -0.10098201560182231 0.49484844092680491
--0.94689686564994791 1.2287154012371122e-18 0.32153744077837104  -0.94714371399036157 0 0.32080957755114525
--0.92483674698373297 0.35451755943338792 0.13781977899394779  -0.92488389215866984 0.35425118465944633 0.13818785834077082
--0.98364735641266243 0.12122116383748827 0.13320400767343918  -0.98365340072891594 0.12142771508337305 0.13297103911780991
-0.5423386494351099 0.82968743367193953 0.12850859076870802  0.53087421189741346 0.83543687458500482 0.14218930946431604
-0.50275426427774228 0.85145286645038376 0.14564781357706019  0.5008250364944089 0.85521146872291598 0.13337026124727755
--0.27572854131968011 0.82875656716879009 0.48696645046278492  -0.275632775839387 0.82881098413486565 0.48692804957249042
--0.51219972690999771 0.34179011670600545 0.78792826822967776  -0.51223335844459583 0.34188293456237462 0.78786613428398444
--0.040828298939112564 0 0.99916617737278246  -0.040944849850879372 6.9461252307533092e-18 0.99916140801708753
-0.040828298939112564 0 -0.99916617737278246  0.040944849850879372 6.9461252307533092e-18 -0.99916140801708753
--0.48696645046278469 0.27572854131968005 -0.82875656716879031  -0.4869280495724912 0.2756327758393875 -0.82881098413486509
--0.34179011670600551 0.78792826822967776 -0.5121997269099976  -0.34188293456237351 0.78786613428398444 -0.5122333584445965
-0.27572854131968011 0.82875656716879009 -0.48696645046278492  0.275632775839387 0.82881098413486565 -0.48692804957249042
-0.51219972690999771 0.34179011670600545 -0.78792826822967776  0.51223335844459583 0.34188293456237462 -0.78786613428398444
-0.34179011670600545 -0.78792826822967776 0.51219972690999771  0.34188293456236002 -0.78786613428397467 0.51223335844462059
-0 -0.99916617737278246 0.040828298939112564  1.0419187846129966e-17 -0.99916140801708753 0.040944849850879379
-0.27572854131968005 -0.82875656716879031 -0.48696645046278469  0.27563277583938733 -0.82881098413486509 -0.48692804957249125
-0.85711100340627266 0.037134436368273085 -0.51257565524045945  0.85590248058785268 0.033910248167156591 -0.51602426182574257
-0.79963678018449613 -0.05534752809057629 0.5975302451883705  0.79967159059339421 -0.022528674978401525 0.60001483815114809
-0.90442701067601738 0.33903474443581871 0.25671454238163005  0.91299254504580829 0.33091024020103199 0.23862737818798813
--0.51219972690999771 -0.34179011670600545 -0.78792826822967776  -0.51223335844459583 -0.34188293456237462 -0.78786613428398444
--0.99916617737278246 -0.040828298939112578 0  -0.99916140801708753 -0.040944849850879379 3.4730626153766554e-18
--0.5121997269099976 -0.34179011670600551 0.78792826822967776  -0.5122333584445965 -0.34188293456237351 0.78786613428398444
--0.8287565671687902 0.48696645046278497 0.27572854131968016  -0.82881098413486565 0.48692804957249042 0.27563277583938689
-0.040828298939112564 0 0.99916617737278246  0.040944849850879372 -6.9461252307533092e-18 0.99916140801708753
-0.48696645046278492 -0.27572854131968011 0.82875656716879031  0.48692804957249064 -0.27563277583938733 0.82881098413486542
-0.48126519958548886 0.86156266551879135 0.15717574894030889  0.47538384129544203 0.8657838000369189 0.15629656115481971
-0.89148810692249181 0.40180685413975104 0.20692923660476614  0.88183387534488211 0.42350808342754109 0.20738833035095716
-0.44878045857535931 0.87541500307784514 0.17583413883161553  0.44918580997761198 0.8754363101234186 0.17844712110944896
-0 0.99916617737278246 0.040828298939112578  3.4730626153766554e-18 0.99916140801708753 0.040944849850879379
--0.34179011670600545 0.78792826822967776 0.51219972690999771  -0.34188293456237318 0.78786613428398489 0.51223335844459617
--0.78792826822967776 0.51219972690999771 0.34179011670600545  -0.78786613428398422 0.51223335844459605 0.34188293456237484
--0.48696645046278492 0.27572854131968011 0.82875656716879031  -0.48692804957249064 0.27563277583938733 0.82881098413486542
--0.48696645046278469 -0.27572854131968005 0.82875656716879031  -0.4869280495724912 -0.2756327758393875 0.82881098413486509
-0.48696645046278492 0.27572854131968011 -0.82875656716879031  0.48692804957249064 0.27563277583938733 -0.82881098413486542
-0.48696645046278469 -0.27572854131968005 -0.82875656716879031  0.4869280495724912 -0.2756327758393875 -0.82881098413486509
--0.040828298939112564 0 -0.99916617737278246  -0.040944849850879372 -6.9461252307533092e-18 -0.99916140801708753
--0.48696645046278492 -0.27572854131968011 -0.82875656716879031  -0.48692804957249064 -0.27563277583938733 -0.82881098413486542
--0.5121997269099976 0.34179011670600551 -0.78792826822967776  -0.5122333584445965 0.34188293456237351 -0.78786613428398444
--0.78792826822967776 0.5121997269099976 -0.34179011670600551  -0.78786613428398444 0.5122333584445965 -0.34188293456237351
--0.27572854131968005 0.82875656716879031 -0.48696645046278469  -0.2756327758393875 0.82881098413486509 -0.4869280495724912
-0 0.99916617737278246 -0.040828298939112578  -3.4730626153766554e-18 0.99916140801708753 -0.040944849850879379
-0.34179011670600545 0.78792826822967776 -0.51219972690999771  0.34188293456237318 0.78786613428398489 -0.51223335844459617
-0.78792826822967776 0.51219972690999771 -0.34179011670600545  0.78786613428398389 0.51223335844459639 -0.34188293456237512
-0.80104197563456969 -0.053122466844444549 0.59574101077153174  0.79967159059343529 -0.022528674978358774 0.60001483815109502
-0.51219972690999771 -0.34179011670600545 0.78792826822967776  0.51223335844459583 -0.34188293456237462 0.78786613428398444
-0.27572854131968011 -0.82875656716879031 0.48696645046278492  0.27563277583938511 -0.82881098413486654 0.48692804957249003
--0.27572854131968005 -0.82875656716879031 0.48696645046278469  -0.2756327758393875 -0.82881098413486509 0.4869280495724912
-0 -0.99916617737278246 -0.040828298939112564  -1.0419187846129966e-17 -0.99916140801708753 -0.040944849850879379
--0.27572854131968011 -0.82875656716879031 -0.48696645046278492  -0.27563277583938645 -0.82881098413486565 -0.48692804957249075
-0.34179011670600551 -0.78792826822967776 -0.5121997269099976  0.34188293456239371 -0.78786613428398256 -0.51223335844458573
-0.5121997269099976 -0.34179011670600551 -0.78792826822967776  0.5122333584445965 -0.34188293456237351 -0.78786613428398444
-0.52912853141459681 -0.48757002987147363 -0.69320320770179844  0.51449014281491645 -0.48894277869645841 -0.70443938852599164
-0.53310523682898858 -0.48133611427487955 -0.69462568959831961  0.51449014281491423 -0.48894277869646163 -0.70443938852599108
-0.6569399976068282 -0.28335434223766326 -0.69755165300174249  0.64093662140152607 -0.29301330949338966 -0.70946701671475043
-0.82875656716879031 0.48696645046278492 -0.27572854131968011  0.82881098413486565 0.48692804957249081 -0.27563277583938639
--0.34179011670600545 -0.78792826822967776 -0.51219972690999771  -0.34188293456237351 -0.78786613428398444 -0.51223335844459661
--0.78792826822967776 -0.51219972690999771 -0.34179011670600545  -0.78786613428398389 -0.51223335844459639 -0.34188293456237512
--0.82875656716879031 -0.48696645046278492 -0.27572854131968011  -0.82881098413486565 -0.48692804957249081 -0.27563277583938639
--0.82875656716879031 -0.48696645046278469 0.27572854131968005  -0.82881098413486498 -0.48692804957249114 0.2756327758393875
--0.78792826822967776 -0.5121997269099976 0.34179011670600551  -0.78786613428398444 -0.5122333584445965 0.34188293456237351
--0.34179011670600551 -0.78792826822967776 0.5121997269099976  -0.34188293456237351 -0.78786613428398444 0.5122333584445965
--0.82875656716879031 0.48696645046278469 -0.27572854131968005  -0.82881098413486498 0.48692804957249114 -0.2756327758393875
--0.99916617737278246 0.040828298939112578 0  -0.99916140801708753 0.040944849850879379 -3.4730626153766554e-18
-0.82188503772742805 0.55513243511369992 0.12315882465233803  0.83034168959696508 0.54729298896534218 0.10489548487251191
-0.15490162002342259 0.32578454432242576 0.93266817185682316  0.15536789040624846 0.32579804135609525 0.93258589678337089
--6.5652635294160463e-18 0.77991607152390563 0.62588411178006298  -1.9440969464970338e-05 0.78016657033104042 0.62557183613071188
-0.893825128737608 0.21405999957086963 0.39229183849441451  0.89197584375894634 0.22324532177533643 0.39311654818379543
--0.31802330015895514 0.58336686281126149 0.74735820322637392  -0.31837608818572194 0.58341134180693455 0.74717325482286201
--6.5571195165482265e-18 0.73132225045616739 0.68203208574650398  -0.00040939357642421546 0.73148465290216658 0.68185778206712322
--0.19654920871264409 0.26534356265230635 0.94390741193901806  -0.19675522852410679 0.26500379747184388 0.94395993949633716
--0.25063608611031912 0.57642063043274483 0.7777665518334006  -0.25072811471624851 0.57677917521734889 0.77747102552212866
-0.19654920871264411 0.2653435626523063 0.94390741193901806  0.19678668467347618 0.26502323844130948 0.94394792431643315
--0.15490162002342261 0.32578454432242587 0.93266817185682316  -0.15536789040624827 0.32579804135609508 0.932585896783371
--0.19654920871264411 0.2653435626523063 -0.94390741193901806  -0.19678668467347618 0.26502323844130948 -0.94394792431643315
-0.15490162002342261 0.32578454432242587 -0.93266817185682316  0.15536789040624827 0.32579804135609508 -0.932585896783371
--0.31802330015895514 0.58336686281126149 -0.74735820322637392  -0.31838810336562612 0.58337988565756571 -0.74719269579232694
--0.15490162002342259 0.32578454432242576 -0.93266817185682316  -0.15536789040624846 0.32579804135609525 -0.93258589678337089
-6.5652635294160463e-18 0.77991607152390563 -0.62588411178006298  1.9440969464970338e-05 0.78016657033104042 -0.62557183613071188
--0.25063608611031912 0.57642063043274483 -0.7777665518334006  -0.25072811471624767 0.57677917521734945 -0.77747102552212866
-0.31802330015895514 0.58336686281126149 -0.74735820322637392  0.31837608818572194 0.58341134180693455 -0.74717325482286201
-6.5571195165482265e-18 0.73132225045616739 -0.68203208574650398  0.00040939357642421546 0.73148465290216658 -0.68185778206712322
-0.19654920871264409 0.26534356265230635 -0.94390741193901806  0.19675522852410679 0.26500379747184388 -0.94395993949633716
-0.25063608611031912 0.57642063043274483 -0.7777665518334006  0.25072811471624851 0.57677917521734889 -0.77747102552212866
-0.65068017874670403 -0.29325931385704512 -0.69911600851089584  0.6409366214015273 -0.29301330949338833 -0.70946701671474988
-0.28617291708332143 -0.87638371280443894 -0.38483791504434911  0.29603762580284088 -0.87653155169613006 -0.37954467851649776
-0.29057971437418995 -0.86959234854368261 -0.39708487175152679  0.29603762580284343 -0.87653155169612973 -0.37954467851649676
-0.59214384399202546 -0.3881595429818786 0.70538094374692573  0.58682250543788184 -0.37119418317776848 0.71962089011270136
-0.58303192413334481 -0.40257317574481138 0.70495163176324016  0.56575106816925003 -0.4040074490177426 0.71882105562061049
-0.63268818151834738 -0.32335420881895094 0.70294074606773105  0.62602060935196313 -0.30459772848493116 0.7178568244910799
-0.66689476317101137 -0.26866388572512034 0.69462568959831961  0.64422625268360367 -0.27076651461112533 0.71530275402698185
-0.62443505191569892 -0.33636614204180326 0.70422028778974766  0.60701252203429068 -0.33806887798060109 0.71919763058182229
-0.5493198212532957 -0.45674068614295493 0.69911600851089584  0.5435262718016699 -0.43623030388675926 0.71713479474380748
-0.54306000239317154 -0.46664565776233696 0.69755165300174249  0.52046695699576939 -0.46800238770905855 0.71420439075532438
-0.49982529754025784 0.14730961092137676 0.85311732979922927  0.51152737254408287 0.17406896607441888 0.84145097432228932
-0.50787822903712998 -0.52299793234814529 0.68413337702600852  0.5283858120552043 -0.4977299270657245 0.68780328097640742
--0.19654920871264409 -0.26534356265230635 -0.94390741193901806  -0.19675522852410679 -0.26500379747184388 -0.94395993949633716
--0.25063608611031912 -0.57642063043274483 -0.7777665518334006  -0.25072811471624851 -0.57677917521734889 -0.77747102552212866
--0.94390741193901806 0.19654920871264411 -0.2653435626523063  -0.94394792431643315 0.19678668467347618 -0.26502323844130948
--0.93266817185682316 -0.15490162002342261 -0.32578454432242587  -0.932585896783371 -0.15536789040624827 -0.32579804135609508
--0.62588411178006298 6.5652635294160463e-18 0.77991607152390563  -0.62557183613071199 1.9440969466552267e-05 0.78016657033104053
--0.77776655183340049 -0.25063608611031907 0.57642063043274483  -0.77747102552212888 -0.25072811471624795 0.576779175217349
--0.58336686281126149 0.74735820322637392 0.31802330015895514  -0.58341134180693488 0.74717325482286223 0.31837608818572077
--0.73132225045616739 0.68203208574650398 6.5571195165482265e-18  -0.73148465290216658 0.68185778206712322 0.00040939357642421893
--0.19654920871264411 -0.2653435626523063 0.94390741193901806  -0.19678668467347618 -0.26502323844130948 0.94394792431643315
-0.15490162002342261 -0.32578454432242587 0.93266817185682316  0.15536789040624827 -0.32579804135609508 0.932585896783371
-0.401514802275725 -0.69274920908571369 0.59888293763788769  0.39881277493422562 -0.66927944610492407 0.62690780308650529
-0.68203208574650398 -6.5571195165482265e-18 0.73132225045616739  0.68185778206712322 -0.00040939357642421546 0.73148465290216658
-0.62588411178006298 -6.5652635294160463e-18 0.77991607152390563  0.62557183613071199 -1.9440969466552267e-05 0.78016657033104053
-0.90157505838463314 0.24184951424973419 0.35660859546245843  0.8986223830402249 0.24555619785561711 0.36356562872994519
-0.77991607152390563 0.62588411178006298 -6.5652635294160463e-18  0.78016657033104053 0.62557183613071199 -1.9440969466552267e-05
-0.8104943439581207 0.5727813550993911 0.11695476797072311  0.80855713981693988 0.57905836064065308 0.104531175365098
-0.78429103445404746 0.6100181237981781 0.10563529941394456  0.78585236795604285 0.60955597917046411 0.10429556095739166
-0.32578454432242576 0.93266817185682316 0.15490162002342259  0.32579804135609525 0.93258589678337089 0.15536789040624846
--0.2653435626523063 0.94390741193901806 -0.19654920871264411  -0.26502323844130948 0.94394792431643315 -0.19678668467347618
--0.32578454432242587 0.93266817185682316 0.15490162002342261  -0.32579804135609508 0.932585896783371 0.15536789040624827
--0.26534356265230635 0.94390741193901806 0.19654920871264409  -0.26500379747184388 0.94395993949633716 0.19675522852410679
--0.57642063043274472 0.77776655183340049 0.25063608611031907  -0.57677917521734889 0.77747102552212877 0.25072811471624851
--0.94390741193901806 0.19654920871264409 0.26534356265230635  -0.94395993949633716 0.19675522852410679 0.26500379747184388
--0.77776655183340049 0.25063608611031907 0.57642063043274472  -0.77747102552212877 0.25072811471624851 0.57677917521734889
--0.74735820322637392 0.31802330015895514 0.58336686281126149  -0.74717325482286223 0.31837608818572077 0.58341134180693488
--0.68203208574650398 6.5571195165482265e-18 0.73132225045616739  -0.68185778206712322 0.00040939357642421546 0.73148465290216658
--0.31802330015895514 -0.58336686281126149 0.74735820322637392  -0.31838810336562573 -0.58337988565756493 0.74719269579232772
--0.15490162002342259 -0.32578454432242576 0.93266817185682316  -0.15536789040624846 -0.32579804135609525 0.93258589678337089
-0.74735820322637392 0.31802330015895514 -0.58336686281126149  0.74717325482286223 0.31837608818572077 -0.58341134180693488
-0.68203208574650398 6.5571195165482265e-18 -0.73132225045616739  0.68185778206712322 0.00040939357642421546 -0.73148465290216658
-0.31802330015895514 -0.58336686281126149 -0.74735820322637392  0.31838810336562573 -0.58337988565756493 -0.74719269579232772
-0.15490162002342259 -0.32578454432242576 -0.93266817185682316  0.15536789040624846 -0.32579804135609525 -0.93258589678337089
-0.19654920871264411 -0.2653435626523063 -0.94390741193901806  0.19678668467347618 -0.26502323844130948 -0.94394792431643315
--0.15490162002342261 -0.32578454432242587 -0.93266817185682316  -0.15536789040624827 -0.32579804135609508 -0.932585896783371
--0.74735820322637392 -0.31802330015895514 -0.58336686281126149  -0.74717325482286223 -0.31837608818572077 -0.58341134180693488
--0.68203208574650398 -6.5571195165482265e-18 -0.73132225045616739  -0.68185778206712322 -0.00040939357642421546 -0.73148465290216658
--0.62588411178006298 -6.5652635294160463e-18 -0.77991607152390563  -0.62557183613071199 -1.9440969466552267e-05 -0.78016657033104053
--0.77776655183340049 0.25063608611031907 -0.57642063043274483  -0.77747102552212888 0.25072811471624795 -0.576779175217349
--0.77991607152390563 0.62588411178006298 6.5652635294160463e-18  -0.78016657033104053 0.62557183613071199 1.9440969464970338e-05
--0.57642063043274472 0.77776655183340049 -0.25063608611031907  -0.57677917521734845 0.77747102552212921 -0.25072811471624817
--0.58336686281126149 0.74735820322637392 -0.31802330015895514  -0.58337988565756416 0.74719269579232839 -0.31838810336562562
--0.32578454432242576 0.93266817185682316 -0.15490162002342259  -0.32579804135609525 0.93258589678337089 -0.15536789040624846
-0.2653435626523063 0.94390741193901806 0.19654920871264411  0.26502323844130948 0.94394792431643315 0.19678668467347618
-0.32578454432242587 0.93266817185682316 -0.15490162002342261  0.32579804135609508 0.932585896783371 -0.15536789040624827
-0.26534356265230635 0.94390741193901806 -0.19654920871264409  0.26500379747184388 0.94395993949633716 -0.19675522852410679
-0.57642063043274472 0.77776655183340049 -0.25063608611031907  0.57677917521734889 0.77747102552212877 -0.25072811471624851
-0.94390741193901806 0.19654920871264409 -0.26534356265230635  0.94395993949633672 0.19675522852410773 -0.26500379747184438
-0.77776655183340049 0.25063608611031907 -0.57642063043274472  0.77747102552212877 0.25072811471624851 -0.57677917521734889
-0.40036321981550405 -0.6946524719094237 0.59753024518837061  0.36887582764815346 -0.69486688193515034 0.61732539245248252
-0.82493587926686529 -0.015775204470230869 0.56417193374348917  0.8279301584881833 -0.029879307227409672 0.56003471291103168
-0.19654920871264409 -0.26534356265230635 0.94390741193901806  0.19675522852410679 -0.26500379747184388 0.94395993949633716
-0.25063608611031912 -0.57642063043274483 0.7777665518334006  0.25072811471624851 -0.57677917521734889 0.77747102552212866
-0.31802330015895514 -0.58336686281126149 0.74735820322637392  0.31837608818572194 -0.58341134180693455 0.74717325482286201
-6.5571195165482265e-18 -0.73132225045616739 0.68203208574650398  0.00040939357642421546 -0.73148465290216658 0.68185778206712322
--0.58336686281126149 -0.74735820322637392 0.31802330015895514  -0.58337988565756493 -0.74719269579232772 0.31838810336562573
--0.32578454432242576 -0.93266817185682316 0.15490162002342259  -0.32579804135609525 -0.93258589678337089 0.15536789040624846
--0.2653435626523063 -0.94390741193901806 0.19654920871264411  -0.26502323844130948 -0.94394792431643315 0.19678668467347618
--0.32578454432242587 -0.93266817185682316 -0.15490162002342261  -0.32579804135609508 -0.932585896783371 -0.15536789040624827
--0.31802330015895514 -0.58336686281126149 -0.74735820322637392  -0.31837608818572194 -0.58341134180693455 -0.74717325482286201
--6.5571195165482265e-18 -0.73132225045616739 -0.68203208574650398  -0.00040939357642421546 -0.73148465290216658 -0.68185778206712322
--6.5652635294160463e-18 -0.77991607152390563 -0.62588411178006298  -1.9440969466552264e-05 -0.78016657033104042 -0.62557183613071199
-0.25063608611031907 -0.57642063043274483 -0.77776655183340049  0.25072811471624795 -0.576779175217349 -0.77747102552212888
-0.62588411178006298 6.5652635294160463e-18 -0.77991607152390563  0.62557183613071199 1.9440969466552267e-05 -0.78016657033104053
-0.34288899659372707 -0.78713443636827329 0.51257565524045945  0.37394295240635489 -0.76556189758092696 0.52352807882472641
-0.83482598411320952 6.1457978060812172e-19 0.54975734503310147  0.83512821922583758 -1.3620570859839113e-15 0.55005532217467101
-0.89270251295960135 0.092787072853812713 0.43974499787970978  0.8911436096358254 0.10776065380062258 0.44073882118290203
-0.94390741193901806 0.19654920871264411 0.2653435626523063  0.94394792431643249 0.19678668467347774 0.26502323844131048
-0.91382708291667858 0.12638371280443894 0.38483791504434894  0.91004478602604755 0.14997570917340425 0.38642693240086129
-0.27461092234606033 -0.8964430577690583 0.34753041451074085  0.30595468057201475 -0.8805901343329211 0.36187394041517323
-0.93241910595001631 0.15597288936521894 0.32585692434233732  0.92464256115119581 0.19278508535824121 0.32843575470885145
-0.58336686281126149 0.74735820322637392 -0.31802330015895514  0.58341134180693488 0.74717325482286223 -0.31837608818572077
-0.73132225045616739 0.68203208574650398 -6.5571195165482265e-18  0.73148465290216658 0.68185778206712322 -0.00040939357642421893
--0.26534356265230635 -0.94390741193901806 -0.19654920871264409  -0.26500379747184388 -0.94395993949633716 -0.19675522852410679
--0.57642063043274472 -0.77776655183340049 -0.25063608611031907  -0.57677917521734889 -0.77747102552212877 -0.25072811471624851
--0.94390741193901806 -0.19654920871264409 -0.26534356265230635  -0.94395993949633716 -0.19675522852410679 -0.26500379747184388
--0.77776655183340049 -0.25063608611031907 -0.57642063043274472  -0.77747102552212877 -0.25072811471624851 -0.57677917521734889
--0.58336686281126149 -0.74735820322637392 -0.31802330015895514  -0.58341134180693488 -0.74717325482286223 -0.31837608818572077
--0.73132225045616739 -0.68203208574650398 -6.5571195165482265e-18  -0.73148465290216658 -0.68185778206712322 -0.00040939357642421893
--0.74735820322637392 -0.31802330015895514 0.58336686281126149  -0.74719269579232772 -0.31838810336562573 0.58337988565756493
--0.93266817185682316 -0.15490162002342259 0.32578454432242576  -0.93258589678337089 -0.15536789040624846 0.32579804135609525
--0.77991607152390563 -0.62588411178006298 -6.5652635294160463e-18  -0.78016657033104053 -0.62557183613071199 -1.9440969466552267e-05
--0.57642063043274483 -0.77776655183340049 0.25063608611031907  -0.576779175217349 -0.77747102552212888 0.25072811471624795
-6.5652635294160463e-18 -0.77991607152390563 0.62588411178006298  1.9440969466552264e-05 -0.78016657033104042 0.62557183613071199
--0.25063608611031907 -0.57642063043274483 0.77776655183340049  -0.25072811471624795 -0.576779175217349 0.77747102552212888
--0.74735820322637392 0.31802330015895514 -0.58336686281126149  -0.74719269579232772 0.31838810336562573 -0.58337988565756493
--0.93266817185682316 0.15490162002342259 -0.32578454432242576  -0.93258589678337089 0.15536789040624846 -0.32579804135609525
--0.94390741193901806 -0.19654920871264411 0.2653435626523063  -0.94394792431643315 -0.19678668467347618 0.26502323844130948
--0.93266817185682316 0.15490162002342261 0.32578454432242587  -0.932585896783371 0.15536789040624827 0.32579804135609508
-0.11874744154864894 0.56789366986248413 0.81389356246462441  0.12230648174951998 0.58292813064721027 0.803265783550005
-0.68777595190194307 0.71884915497263779 0.093588483842681286  0.68572398718656102 0.72091363611668946 0.10033016823457762
-0.20470147868264915 0.9270588370822882 0.31410064822087247  0.20429513892774459 0.9271359637671639 0.31413755092319934
-0.069986566252294838 0.84380044240886354 0.53207395532465163  0.069789417831815359 0.84400685644856743 0.53177237933772359
--0.52969979418799107 0.72619883181352496 0.43823895845745114  -0.52986930552536837 0.72592006295091116 0.43849581670457133
--0.39498488175763657 0.64294043714010041 0.65621226556123025  -0.39536358442943986 0.64279095563231481 0.65613064511909558
--0.53207395532465163 0.069986566252294838 0.84380044240886354  -0.5317723793377237 0.06978941783181504 0.84400685644856732
--0.31410064822087258 0.20470147868264921 0.9270588370822882  -0.31413755092319934 0.20429513892774451 0.9271359637671639
-0.20086000526876321 -0.13471491243035441 0.97031291378210283  0.20121590081625387 -0.13450572109592704 0.97026819604229442
-0.20086000526876321 0.13471491243035441 0.97031291378210283  0.20121590081625396 0.13450572109592707 0.97026819604229431
--0.20086000526876321 -0.13471491243035441 -0.97031291378210283  -0.20121590081625387 -0.13450572109592704 -0.97026819604229442
--0.20086000526876321 0.13471491243035441 -0.97031291378210283  -0.20121590081625396 0.13450572109592707 -0.97026819604229431
--0.65621226556123025 0.39498488175763669 -0.64294043714010041  -0.65613064511909558 0.39536358442943997 -0.64279095563231492
--0.43823895845745109 0.52969979418799096 -0.72619883181352507  -0.43849581670457083 0.52986930552536859 -0.72592006295091127
--0.20470147868264915 0.9270588370822882 -0.31410064822087247  -0.20429513892774459 0.9271359637671639 -0.31413755092319934
--0.069986566252294838 0.84380044240886354 -0.53207395532465163  -0.069789417831815359 0.84400685644856743 -0.53177237933772359
-0.52969979418799107 0.72619883181352496 -0.43823895845745114  0.52986930552536837 0.72592006295091116 -0.43849581670457133
-0.39498488175763657 0.64294043714010041 -0.65621226556123025  0.39536358442943986 0.64279095563231481 -0.65613064511909558
-0.53207395532465163 0.069986566252294838 -0.84380044240886354  0.5317723793377237 0.06978941783181504 -0.84400685644856732
-0.31410064822087258 0.20470147868264921 -0.9270588370822882  0.31413755092319934 0.20429513892774451 -0.9271359637671639
-0.069986566252294838 -0.84380044240886354 0.53207395532465163  0.06978941783181504 -0.84400685644856732 0.5317723793377237
-0.20470147868264921 -0.9270588370822882 0.31410064822087258  0.20429513892774726 -0.92713596376716201 0.31413755092320306
--0.13471491243035441 -0.97031291378210283 -0.20086000526876321  -0.13450572109592746 -0.9702681960422942 -0.20121590081625454
-0.13471491243035441 -0.97031291378210283 -0.20086000526876321  0.13450572109592748 -0.9702681960422942 -0.20121590081625462
-0.39498488175763669 -0.64294043714010041 -0.65621226556123025  0.39536358442944125 -0.64279095563231481 -0.65613064511909491
-0.93208712065408506 0.15549608434201159 0.3269900786062353  0.91789704785097648 0.17153707639041282 0.35782683098098128
-0.94686945971280478 0.17991689161909552 0.26460466631117979  0.95170604908224476 0.15778941565066537 0.26335925358507084
-0.95847935459740885 0.19857068261001021 0.20072208160320931  0.95922670283599698 0.19909668302557901 0.20061067612316646
-0.2389405724498605 -0.95306848001363997 0.18186355091081885  0.23241575440058335 -0.95608513245170412 0.17856129650967195
-0.96740524816676143 0.21237493457549983 0.13494008765512311  0.96126367789070066 0.24008359059386952 0.13539575730279987
-0.70892487408416871 0.69813515078208477 0.093116941936638747  0.71176658290178085 0.69503929178689661 0.1015318390293964
-0.65746189559341328 0.74644278217951743 0.096124922711889452  0.65866036402231731 0.74597391594556262 0.098434961242594501
--0.53207395532465163 -0.069986566252294838 -0.84380044240886354  -0.53177237933772392 -0.069789417831815234 -0.84400685644856699
--0.31410064822087258 -0.20470147868264921 -0.9270588370822882  -0.31413755092319934 -0.20429513892774451 -0.9271359637671639
--0.97031291378210283 0.20086000526876321 0.13471491243035441  -0.9702681960422942 0.20121590081625454 0.1345057210959274
--0.97031291378210283 0.20086000526876321 -0.13471491243035441  -0.9702681960422942 0.20121590081625457 -0.13450572109592743
--0.31410064822087247 -0.20470147868264915 0.9270588370822882  -0.31413755092319801 -0.20429513892774376 0.92713596376716445
--0.53207395532465163 -0.069986566252294838 0.84380044240886354  -0.53177237933772392 -0.069789417831815581 0.8440068564485671
--0.72619883181352496 0.43823895845745114 0.52969979418799107  -0.72592006295091172 0.43849581670457072 0.52986930552536793
--0.64294043714010041 0.65621226556123025 0.39498488175763657  -0.64279095563231481 0.65613064511909558 0.39536358442943986
--0.20086000526876321 0.13471491243035441 0.97031291378210283  -0.20121590081625385 0.13450572109592696 0.97026819604229442
--0.20086000526876321 -0.13471491243035441 0.97031291378210283  -0.2012159008162539 -0.13450572109592701 0.97026819604229442
-0.43823895845745114 -0.52969979418799107 0.72619883181352496  0.43849581670457077 -0.52986930552536793 0.72592006295091172
-0.97237322050691288 0.22053761901938193 0.067701629511043915  0.97707617250292256 0.20189342879636515 0.067536631067046174
-0.31410064822087252 0.20470147868264915 0.9270588370822882  0.31413755092319801 0.20429513892774373 0.92713596376716445
-0.53207395532465174 0.069986566252294838 0.84380044240886354  0.53177237933772403 0.069789417831815651 0.84400685644856688
-0.9270588370822882 0.31410064822087252 0.20470147868264915  0.9271359637671639 0.31413755092319934 0.20429513892774454
-0.84380044240886332 0.53207395532465163 0.069986566252294824  0.84400685644856699 0.53177237933772403 0.069789417831815609
-0.62688758712066828 0.77156308049914157 0.10155294642477933  0.63168040245028012 0.76918721291849756 0.096596587118418148
-0.33295004022963903 0.90494753379947435 0.26218372058148826  0.33340690397517875 0.90406837259895811 0.26739523938910625
-0.13471491243035441 0.97031291378210283 -0.20086000526876321  0.1345057210959274 0.9702681960422942 -0.20121590081625454
--0.13471491243035441 0.97031291378210283 -0.20086000526876321  -0.13450572109592743 0.9702681960422942 -0.20121590081625457
--0.069986566252294838 0.84380044240886354 0.53207395532465163  -0.069789417831814429 0.84400685644856788 0.53177237933772281
--0.20470147868264923 0.9270588370822882 0.31410064822087264  -0.2042951389277447 0.9271359637671639 0.31413755092319923
--0.84380044240886354 0.53207395532465163 0.069986566252294838  -0.84400685644856788 0.53177237933772281 0.069789417831814443
--0.9270588370822882 0.31410064822087264 0.20470147868264923  -0.92713596376716423 0.31413755092319934 0.20429513892774315
--0.43823895845745114 0.52969979418799107 0.72619883181352496  -0.43849581670457133 0.52986930552536837 0.72592006295091116
--0.65621226556123025 0.39498488175763657 0.64294043714010041  -0.65613064511909558 0.39536358442943986 0.64279095563231481
--0.65621226556123025 -0.39498488175763669 0.64294043714010041  -0.65613064511909547 -0.39536358442944008 0.64279095563231481
--0.43823895845745109 -0.52969979418799096 0.72619883181352507  -0.43849581670457094 -0.52986930552536859 0.72592006295091127
-0.43823895845745114 0.52969979418799107 -0.72619883181352496  0.43849581670457133 0.52986930552536837 -0.72592006295091116
-0.65621226556123025 0.39498488175763657 -0.64294043714010041  0.65613064511909558 0.39536358442943986 -0.64279095563231481
-0.22988186145330614 -0.96732927410114633 0.099634331047451258  0.22974865031682642 -0.96813269657427803 0.099672661755434766
-0.43823895845745109 -0.52969979418799096 -0.72619883181352507  0.43849581670457061 -0.52986930552536848 -0.72592006295091149
-0.20086000526876321 0.13471491243035441 -0.97031291378210283  0.20121590081625385 0.13450572109592696 -0.97026819604229442
-0.20086000526876321 -0.13471491243035441 -0.97031291378210283  0.2012159008162539 -0.13450572109592701 -0.97026819604229442
--0.43823895845745114 -0.52969979418799107 -0.72619883181352496  -0.43849581670457133 -0.52986930552536837 -0.72592006295091116
--0.65621226556123025 -0.39498488175763657 -0.64294043714010041  -0.65613064511909558 -0.39536358442943986 -0.64279095563231481
--0.31410064822087252 0.20470147868264915 -0.9270588370822882  -0.31413755092319801 0.20429513892774373 -0.92713596376716445
--0.53207395532465174 0.069986566252294838 -0.84380044240886354  -0.53177237933772403 0.069789417831815651 -0.84400685644856688
--0.9270588370822882 0.31410064822087247 -0.20470147868264915  -0.9271359637671639 0.31413755092319928 -0.20429513892774456
--0.84380044240886354 0.53207395532465163 -0.069986566252294838  -0.84400685644856732 0.53177237933772359 -0.069789417831815345
--0.39498488175763669 0.64294043714010041 -0.65621226556123025  -0.39536358442943964 0.64279095563231503 -0.65613064511909558
--0.52969979418799096 0.72619883181352507 -0.43823895845745109  -0.52986930552536859 0.72592006295091127 -0.43849581670457094
--0.13471491243035441 0.97031291378210283 0.20086000526876321  -0.1345057210959274 0.9702681960422942 0.20121590081625454
-0.13471491243035441 0.97031291378210283 0.20086000526876321  0.13450572109592743 0.9702681960422942 0.20121590081625457
-0.069986566252294838 0.84380044240886354 -0.53207395532465163  0.069789417831814429 0.84400685644856788 -0.53177237933772281
-0.20470147868264923 0.9270588370822882 -0.31410064822087264  0.2042951389277447 0.9271359637671639 -0.31413755092319923
-0.84380044240886354 0.53207395532465163 -0.069986566252294838  0.84400685644856699 0.53177237933772392 -0.069789417831815234
-0.9270588370822882 0.31410064822087258 -0.20470147868264921  0.92713596376716423 0.31413755092319956 -0.20429513892774293
-0.22628605152906522 -0.97313250261608553 0.01853460685588823  0.22857704379632371 -0.97332233192471651 0.019904100732397755
-0.97237322050691288 0.2205376190193819 -0.067701629511043915  0.97707617250292356 0.20189342879636493 -0.067536631067032102
-0.53207395532465163 -0.069986566252294838 0.84380044240886354  0.53177237933772392 -0.069789417831815234 0.84400685644856699
-0.31410064822087258 -0.20470147868264921 0.9270588370822882  0.31413755092319934 -0.20429513892774451 0.9271359637671639
-0.22988186145330608 -0.96732927410114655 -0.09963433104745123  0.22974865031681105 -0.96813269657427992 -0.099672661755452405
-0.39498488175763657 -0.64294043714010041 0.65621226556123025  0.39536358442943098 -0.64279095563231847 0.65613064511909736
--0.39498488175763669 -0.64294043714010041 0.65621226556123025  -0.39536358442943992 -0.64279095563231492 0.65613064511909558
--0.52969979418799096 -0.72619883181352507 0.43823895845745109  -0.52986930552536859 -0.72592006295091149 0.43849581670457066
-0.13471491243035441 -0.97031291378210283 0.20086000526876321  0.1345057210959274 -0.9702681960422942 0.20121590081625454
--0.13471491243035441 -0.97031291378210283 0.20086000526876321  -0.13450572109592743 -0.9702681960422942 0.20121590081625457
--0.52969979418799107 -0.72619883181352496 -0.43823895845745114  -0.52986930552536837 -0.72592006295091116 -0.43849581670457133
--0.39498488175763657 -0.64294043714010041 -0.65621226556123025  -0.39536358442943986 -0.64279095563231481 -0.65613064511909558
-0.20470147868264915 -0.9270588370822882 -0.31410064822087252  0.20429513892774667 -0.92713596376716256 -0.31413755092320195
-0.069986566252294838 -0.84380044240886354 -0.53207395532465174  0.069789417831815651 -0.84400685644856688 -0.53177237933772403
-0.31410064822087247 -0.20470147868264915 -0.9270588370822882  0.31413755092319801 -0.20429513892774376 -0.92713596376716445
-0.53207395532465163 -0.069986566252294838 -0.84380044240886354  0.53177237933772392 -0.069789417831815581 -0.8440068564485671
-0.96740524816676143 0.21237493457549977 -0.13494008765512311  0.96126367789070077 0.24008359059386938 -0.13539575730279924
-0.95847935459740874 0.19857068261001024 -0.20072208160320937  0.95922670283599665 0.19909668302557637 -0.20061067612317074
-0.9324191059500162 0.15597288936521903 -0.32585692434233743  0.92464256115119159 0.1927850853582381 -0.32843575470886532
-0.25697201819559901 -0.92432848622760766 -0.28050566540029298  0.23706297888618794 -0.92607252553187147 -0.2935827336486736
-0.84685829520082545 0.019286849148286413 0.53075413092765555  0.84560936423415078 0.027439993872777707 0.53309647331020416
-0.91382708291667858 0.12638371280443889 -0.38483791504434905  0.91004478602604566 0.14997570917340444 -0.38642693240086545
-0.72619883181352496 0.43823895845745114 -0.52969979418799107  0.72592006295091172 0.43849581670457072 -0.52986930552536793
-0.64294043714010041 0.65621226556123025 -0.39498488175763657  0.64279095563231481 0.65613064511909558 -0.39536358442943986
--0.069986566252294838 -0.84380044240886354 -0.53207395532465163  -0.069789417831815234 -0.84400685644856699 -0.53177237933772392
--0.20470147868264921 -0.9270588370822882 -0.31410064822087258  -0.20429513892774451 -0.9271359637671639 -0.31413755092319934
--0.84380044240886354 -0.53207395532465163 -0.069986566252294838  -0.84400685644856732 -0.5317723793377237 -0.06978941783181504
--0.9270588370822882 -0.31410064822087258 -0.20470147868264921  -0.92713596376716423 -0.31413755092319956 -0.20429513892774293
--0.72619883181352496 -0.43823895845745114 -0.52969979418799107  -0.72592006295091172 -0.43849581670457072 -0.52986930552536793
--0.64294043714010041 -0.65621226556123025 -0.39498488175763657  -0.64279095563231481 -0.65613064511909558 -0.39536358442943986
--0.64294043714010041 -0.65621226556123025 0.39498488175763669  -0.64279095563231492 -0.65613064511909558 0.39536358442943992
--0.72619883181352507 -0.43823895845745109 0.52969979418799096  -0.72592006295091127 -0.43849581670457083 0.52986930552536859
--0.9270588370822882 -0.31410064822087247 0.20470147868264915  -0.9271359637671639 -0.31413755092319928 0.20429513892774456
--0.84380044240886354 -0.53207395532465163 0.069986566252294838  -0.84400685644856699 -0.53177237933772392 0.069789417831815595
--0.20470147868264915 -0.9270588370822882 0.31410064822087247  -0.20429513892774459 -0.9271359637671639 0.31413755092319934
--0.069986566252294838 -0.84380044240886354 0.53207395532465163  -0.069789417831815581 -0.8440068564485671 0.53177237933772392
--0.64294043714010041 0.65621226556123025 -0.39498488175763669  -0.6427909556323147 0.65613064511909536 -0.39536358442944064
--0.72619883181352507 0.43823895845745109 -0.52969979418799096  -0.72592006295091149 0.43849581670457061 -0.52986930552536848
--0.97031291378210283 -0.20086000526876321 -0.13471491243035441  -0.9702681960422942 -0.20121590081625454 -0.1345057210959274
--0.97031291378210283 -0.20086000526876321 0.13471491243035441  -0.9702681960422942 -0.20121590081625457 0.13450572109592743
-0.06507249989019516 0.64943374300381451 0.75762878984770377  0.06551566806219479 0.64992905036579185 0.75716571946238054
-0.14324145828887103 0.44478475305090454 0.88410882140193769  0.14399073917102956 0.44447864693329647 0.88414105178604085
-0.16208565674454739 0.067174638370274917 0.984487586431394  0.16230850425355234 0.067102997401376471 0.98445575684574338
-0.38781114670466377 0.20668066329285001 0.89826812139385281  0.38778432700575033 0.20645471950358354 0.89833165619574706
--0.1264800315542341 0.61148180127020313 0.78108437977813105  -0.12697533232365865 0.6119448889150485 0.78064122227310373
-0.76032257344343512 0.64081678241520534 0.098941938751961195  0.76207589783372764 0.6391363644711634 0.10365825365836547
-0.74011618472454033 0.66455433327713243 0.095362650095153101  0.73743092048489867 0.66756092552176716 0.10275236361912306
-0.15304821643557709 0.8581878051094145 0.48898817612201739  0.17381774822644128 0.86108611456980322 0.47782642632714362
--0.14324145828887105 0.44478475305090459 0.88410882140193769  -0.14399073917102873 0.44447864693329692 0.88414105178604063
--0.06507249989019516 0.64943374300381451 0.75762878984770377  -0.065515668062194402 0.64992905036579007 0.75716571946238209
-0.13950602492257505 0.85675191169903997 0.49650199476975138  0.13935172210219587 0.85685972305470759 0.49635925754816157
--0.13950602492257505 0.85675191169903997 0.49650199476975149  -0.13935172210219487 0.85685972305470948 0.49635925754815852
-0.037951941733611459 0.37971225316070945 0.92432583806700219  0.037984161450743424 0.37896297887110203 0.92463196144413284
--0.16669704821929851 0.50619228471494349 0.84615687966832631  -0.16746624198175136 0.50593831119476196 0.84615689033529806
--0.40176612662410133 0.69466625495449252 0.59667643972673035  -0.40197239864759854 0.69455121880115844 0.59667142984000965
--0.48798559166164268 0.46894076499437626 0.73618246464930526  -0.48809649929758481 0.46907539604897669 0.73602315194220513
-0.60630413399985716 0.78745552743149316 0.10609528287383588  0.60380229511961403 0.79156802282425032 0.094036448520739543
--0.037951941733611459 0.37971225316070945 0.92432583806700219  -0.037984161450743445 0.37896297887110203 0.92463196144413295
--0.38781114670466377 0.20668066329284993 0.89826812139385259  -0.38778432700573318 0.20645471950357089 0.89833165619575739
--0.16208565674454734 0.067174638370274917 0.984487586431394  -0.16230850425355245 0.067102997401376416 0.98445575684574338
--0.16669704821929851 0.50619228471494349 -0.84615687966832631  -0.16746624198175133 0.50593831119476196 -0.84615689033529817
-0.037951941733611459 0.37971225316070945 -0.92432583806700219  0.037984161450743445 0.37896297887110203 -0.92463196144413295
-0.38781114670466377 0.20668066329284993 -0.89826812139385259  0.38778432700573318 0.20645471950357089 -0.89833165619575739
-0.16208565674454734 0.067174638370274917 -0.984487586431394  0.16230850425355245 0.067102997401376416 -0.98445575684574338
--0.06507249989019516 0.64943374300381451 -0.75762878984770377  -0.065515668062193375 0.64992905036579196 -0.75716571946238065
--0.14324145828887103 0.44478475305090454 -0.88410882140193769  -0.14399073917102864 0.44447864693329692 -0.88414105178604085
--0.16208565674454739 0.067174638370274917 -0.984487586431394  -0.16230850425355234 0.067102997401376471 -0.98445575684574338
--0.38781114670466377 0.20668066329285001 -0.89826812139385281  -0.38778432700573329 0.20645471950357264 -0.89833165619575683
-0.1264800315542341 0.61148180127020313 -0.78108437977813105  0.12697533232365898 0.61194488891504895 -0.78064122227310351
--0.1264800315542341 0.61148180127020313 -0.78108437977813105  -0.12697533232366071 0.61194488891504817 -0.78064122227310373
--0.48798559166164257 0.46894076499437626 -0.73618246464930537  -0.48809649929758558 0.46907539604897625 -0.73602315194220491
--0.40176612662410133 0.69466625495449263 -0.59667643972673012  -0.40197239864759909 0.69455121880115767 -0.59667142984001009
-0.14324145828887105 0.44478475305090459 -0.88410882140193769  0.14399073917102881 0.44447864693329647 -0.88414105178604085
-0.065072499890195173 0.64943374300381473 -0.75762878984770365  0.065515668062194887 0.64992905036579063 -0.75716571946238165
--0.13950602492257505 0.85675191169903997 -0.49650199476975138  -0.13935172210219585 0.85685972305470925 -0.49635925754815879
-0.13950602492257505 0.85675191169903997 -0.49650199476975149  0.13935172210219487 0.85685972305470948 -0.49635925754815852
--0.037951941733611459 0.37971225316070945 -0.92432583806700219  -0.037984161450743424 0.37896297887110203 -0.92463196144413284
-0.16669704821929851 0.50619228471494349 -0.84615687966832631  0.16746624198175172 0.50593831119476229 -0.84615689033529795
-0.40176612662410133 0.69466625495449252 -0.59667643972673035  0.40197239864759854 0.69455121880115844 -0.59667142984000965
-0.48798559166164268 0.46894076499437626 -0.73618246464930526  0.48809649929758481 0.46907539604897669 -0.73602315194220513
-0.27399725512977041 -0.89741802080743249 -0.34558774394436126  0.30431345936385057 -0.89521176696950899 -0.32555984200963023
-0.27461092234606044 -0.89644305776905853 -0.34753041451074085  0.30595468057192821 -0.88059013433294808 -0.36187394041518095
-0.89270251295960135 0.092787072853812741 -0.43974499787970978  0.89114360963582795 0.10776065380062308 -0.44073882118289653
-0.31682936237190801 -0.8280363774210906 -0.46105412139556579  0.30871603125497732 -0.82882275556679164 -0.46663395922376483
-0.34243159318633287 -0.78789291377908466 -0.51176714118576783  0.37438115159301083 -0.78669229841286881 -0.4908706356564515
-0.34177771381313393 -0.78887113359859207 -0.51061830246204121  0.34181621487256558 -0.80836571705727378 -0.47927710433179627
-0.20668066329284993 -0.89826812139385259 0.38781114670466377  0.20645471950357258 -0.89833165619575706 0.38778432700573306
-0.067174638370274931 -0.98448758643139411 0.16208565674454736  0.067102997401376416 -0.98445575684574338 0.16230850425355242
-0.82493587926686529 -0.015775204470230772 -0.56417193374348928  0.82793015848818063 -0.029879307227409412 -0.56003471291103579
-0.34288899659372696 -0.78713443636827329 -0.51257565524045923  0.37394295240647391 -0.76556189758091031 -0.52352807882466579
-0.067174638370274931 -0.98448758643139411 -0.16208565674454742  0.067102997401376457 -0.98445575684574338 -0.16230850425355231
-0.20668066329284998 -0.89826812139385259 -0.38781114670466371  0.20645471950357255 -0.89833165619575694 -0.38778432700573334
-0.70685918524788072 -0.20468185015976154 -0.67677227421098896  0.71657063832564438 -0.23106145751843249 -0.65813153938938074
-0.71021467390312099 -0.19943478257349526 -0.67476755984413894  0.73148064944407343 -0.19693655197206719 -0.65280322761627774
-0.50468001700647158 -0.52828837108788052 -0.68272481536695295  0.5355740072109787 -0.52649133823230054 -0.66027823950690356
-0.5039242293873103 -0.52945918848859996 -0.68235511400187066  0.51008352708669591 -0.55674863743608982 -0.65562622744049326
-0.70685918524788072 -0.20468185015976154 0.67677227421098896  0.71657063832563017 -0.23106145751843316 0.65813153938939606
-0.74055958467102845 -0.15027494754537984 0.65399889841309089  0.74496666446894622 -0.16330181399315044 0.64680536978024461
-0.71021467390312121 -0.19943478257349531 0.67476755984413883  0.73148064944405822 -0.19693655197206084 0.65280322761629672
-0.50468001700647158 -0.52828837108788052 0.68272481536695295  0.53557400721097814 -0.52649133823230254 0.66027823950690256
-0.75762878984770377 0.06507249989019516 0.64943374300381462  0.75716571946238109 0.065515668062194998 0.64992905036579118
-0.88410882140193769 0.14324145828887103 0.44478475305090454  0.88414105178603863 0.14399073917102936 0.44447864693330108
-0.46796403496887878 -0.58666916470964625 0.66003296952840662  0.48378799724665122 -0.58634540105761646 0.64972936241073254
-0.89826812139385259 0.38781114670466371 0.20668066329284998  0.89833165619575805 0.38778432700573129 0.20645471950357161
-0.037951941733611459 -0.37971225316070945 -0.92432583806700219  0.037984161450743424 -0.37896297887110203 -0.92463196144413284
--0.16669704821929851 -0.50619228471494349 -0.84615687966832631  -0.16746624198175172 -0.50593831119476229 -0.84615689033529795
--0.40176612662410133 -0.69466625495449252 -0.59667643972673035  -0.40197239864759893 -0.69455121880115778 -0.5966714298400102
--0.48798559166164268 -0.46894076499437626 -0.73618246464930526  -0.48809649929758481 -0.46907539604897669 -0.73602315194220513
--0.84615687966832631 0.16669704821929851 -0.50619228471494349  -0.84615689033529806 0.16746624198175136 -0.50593831119476196
--0.92432583806700219 -0.037951941733611459 -0.37971225316070945  -0.92463196144413295 -0.037984161450743445 -0.37896297887110203
--0.89826812139385259 -0.38781114670466377 -0.20668066329284993  -0.89833165619575706 -0.38778432700573306 -0.20645471950357258
--0.98448758643139411 -0.16208565674454736 -0.067174638370274931  -0.98445575684574338 -0.16230850425355248 -0.067102997401376444
--0.78108437977813128 0.12648003155423412 0.61148180127020324  -0.78064122227310373 0.1269753323236586 0.61194488891504861
--0.78108437977813128 -0.1264800315542341 0.61148180127020324  -0.78064122227310373 -0.12697533232366062 0.61194488891504817
--0.73618246464930537 -0.48798559166164257 0.46894076499437626  -0.73602315194220502 -0.48809649929758558 0.46907539604897625
--0.59667643972673012 -0.40176612662410133 0.69466625495449263  -0.5966714298400092 -0.40197239864759854 0.69455121880115867
--0.44478475305090459 0.88410882140193769 0.14324145828887105  -0.44447864693329647 0.88414105178604085 0.14399073917102881
--0.64943374300381462 0.75762878984770354 0.06507249989019516  -0.64992905036579052 0.75716571946238165 0.065515668062194804
--0.85675191169903997 0.49650199476975138 -0.13950602492257505  -0.85685972305470925 0.49635925754815879 -0.13935172210219585
--0.85675191169903997 0.49650199476975149 0.13950602492257505  -0.85685972305470948 0.49635925754815846 0.13935172210219487
--0.16669704821929851 -0.50619228471494349 0.84615687966832631  -0.16746624198175133 -0.50593831119476196 0.84615689033529817
-0.037951941733611459 -0.37971225316070945 0.92432583806700219  0.037984161450743445 -0.37896297887110203 0.92463196144413295
-0.38781114670466377 -0.20668066329284993 0.89826812139385259  0.38778432700573318 -0.20645471950357089 0.89833165619575739
-0.16208565674454739 -0.067174638370274917 0.984487586431394  0.16230850425355237 -0.06710299740137643 0.98445575684574338
-0.4331208322019765 -0.64210794890239153 0.63136143448574877  0.42807141203226762 -0.64268086340021435 0.63538663349165247
-0.75762878984770377 -0.06507249989019516 0.64943374300381451  0.75716571946238165 -0.06551566806219411 0.64992905036579063
-0.49650199476975138 0.13950602492257505 0.85675191169903997  0.49635925754815763 0.13935172210219912 0.85685972305470937
-0.49650199476975149 -0.13950602492257505 0.85675191169903997  0.49635925754815857 -0.1393517221021949 0.85685972305470948
-0.79934060742300872 -0.055862651692236226 0.5979056290568221  0.79006130932891394 -0.031934562996140711 0.61219548445551919
--0.96679589706089264 0.15985780358782284 0.19937696972895624  -0.96680424297825784 0.16010344242024357 0.19913925651268632
--0.99043061207734606 0.040522281668716874 0.13192856911395229  -0.99044963097837846 0.040575895565417609 0.13176921185868209
--0.9506072962094394 0.27889813733511903 0.13624095340381404  -0.95055095711572857 0.27915487828976127 0.13610816233202497
-0.61148180127020324 0.78108437977813128 -0.12648003155423412  0.61194488891504895 0.7806412222731034 -0.12697533232365887
--0.9168554803037775 0.39313153246640237 0.069452331980627585  -0.91670068154564377 0.39350124418016624 0.069401954456725687
--0.94330265629374277 -0.077704403643809677 0.32271058904772337  -0.94351526412634279 -0.077926023088562835 0.32203490693742848
--0.96471929550963276 0.039734588558411582 0.26026494835742225  -0.96481986879326076 0.039677999129164934 0.25990051397960151
-0.64943374300381451 0.75762878984770365 0.065072499890195146  0.64992905036579174 0.75716571946238054 0.065515668062194499
-0.44478475305090454 0.88410882140193769 0.14324145828887103  0.44447864693329459 0.88414105178604174 0.14399073917102978
-0.067174638370274931 0.98448758643139411 0.16208565674454736  0.067102997401376444 0.98445575684574338 0.16230850425355248
-0.20668066329284998 0.89826812139385259 0.38781114670466371  0.20645471950358563 0.89833165619574651 0.38778432700575044
--0.50619228471494349 0.84615687966832631 -0.16669704821929851  -0.50593831119476196 0.84615689033529817 -0.16746624198175136
--0.37971225316070945 0.92432583806700219 0.037951941733611459  -0.37896297887110203 0.92463196144413295 0.037984161450743445
--0.20668066329284998 0.89826812139385259 0.38781114670466382  -0.20645471950357261 0.89833165619575706 0.38778432700573312
--0.067174638370274931 0.98448758643139411 0.16208565674454736  -0.067102997401376457 0.98445575684574338 0.16230850425355248
--0.37971225316070945 0.92432583806700219 -0.037951941733611459  -0.37896297887110203 0.92463196144413284 -0.037984161450743424
--0.50619228471494349 0.84615687966832631 0.16669704821929851  -0.50593831119476229 0.84615689033529795 0.16746624198175172
--0.69466625495449252 0.59667643972673035 0.40176612662410133  -0.69455121880115733 0.59667142984001009 0.40197239864759959
--0.46894076499437626 0.73618246464930526 0.48798559166164268  -0.46907539604897619 0.7360231519422048 0.48809649929758586
--0.92432583806700219 -0.037951941733611459 0.37971225316070945  -0.92463196144413284 -0.037984161450743424 0.37896297887110203
--0.84615687966832631 0.16669704821929851 0.50619228471494349  -0.84615689033529806 0.16746624198175136 0.50593831119476196
--0.59667643972673035 0.40176612662410133 0.69466625495449252  -0.5966714298400102 0.40197239864759848 0.69455121880115789
--0.73618246464930526 0.48798559166164268 0.46894076499437626  -0.73602315194220391 0.48809649929758597 0.46907539604897747
--0.88410882140193769 0.14324145828887105 0.44478475305090459  -0.88414105178604074 0.14399073917102875 0.44447864693329697
--0.75762878984770377 0.06507249989019516 0.64943374300381451  -0.75716571946238209 0.065515668062194402 0.64992905036579007
--0.49650199476975138 -0.13950602492257505 0.85675191169903997  -0.4963592575481578 -0.13935172210219521 0.85685972305470992
--0.49650199476975149 0.13950602492257505 0.85675191169903997  -0.49635925754815857 0.1393517221021949 0.85685972305470948
--0.06507249989019516 -0.64943374300381462 0.75762878984770377  -0.065515668062193153 -0.64992905036579229 0.7571657194623802
--0.14324145828887103 -0.44478475305090454 0.88410882140193769  -0.14399073917102864 -0.44447864693329692 0.88414105178604085
--0.16208565674454734 -0.067174638370274917 0.984487586431394  -0.16230850425355239 -0.06710299740137643 0.98445575684574338
--0.38781114670466377 -0.20668066329285001 0.89826812139385281  -0.38778432700573318 -0.20645471950357308 0.89833165619575683
-0.88410882140193769 0.14324145828887105 -0.44478475305090459  0.88414105178604063 0.14399073917102884 -0.44447864693329697
-0.75762878984770377 0.06507249989019516 -0.64943374300381451  0.75716571946238209 0.065515668062194402 -0.64992905036579007
-0.49650199476975138 -0.13950602492257505 -0.85675191169903997  0.4963592575481578 -0.13935172210219521 -0.85685972305470992
-0.49650199476975149 0.13950602492257505 -0.85675191169903997  0.49635925754815857 0.1393517221021949 -0.85685972305470948
-0.06507249989019516 -0.64943374300381462 -0.75762878984770377  0.065515668062193153 -0.64992905036579229 -0.7571657194623802
-0.14324145828887103 -0.44478475305090454 -0.88410882140193769  0.14399073917102864 -0.44447864693329692 -0.88414105178604085
-0.16208565674454734 -0.067174638370274917 -0.984487586431394  0.16230850425355239 -0.06710299740137643 -0.98445575684574338
-0.38781114670466377 -0.20668066329285001 -0.89826812139385281  0.38778432700573318 -0.20645471950357308 -0.89833165619575683
-0.16669704821929851 -0.50619228471494349 -0.84615687966832631  0.16746624198175133 -0.50593831119476196 -0.84615689033529817
--0.037951941733611459 -0.37971225316070945 -0.92432583806700219  -0.037984161450743445 -0.37896297887110203 -0.92463196144413295
--0.38781114670466377 -0.20668066329284993 -0.89826812139385259  -0.38778432700573318 -0.20645471950357089 -0.89833165619575739
--0.16208565674454739 -0.067174638370274917 -0.984487586431394  -0.16230850425355237 -0.06710299740137643 -0.98445575684574338
--0.88410882140193769 -0.14324145828887105 -0.44478475305090459  -0.88414105178604074 -0.14399073917102875 -0.44447864693329697
--0.75762878984770377 -0.06507249989019516 -0.64943374300381451  -0.75716571946238209 -0.065515668062194402 -0.64992905036579007
--0.49650199476975138 0.13950602492257505 -0.85675191169903997  -0.49635925754815741 0.1393517221021954 -0.85685972305471014
--0.49650199476975149 -0.13950602492257505 -0.85675191169903997  -0.49635925754815857 -0.1393517221021949 -0.85685972305470948
--0.78108437977813128 -0.12648003155423412 -0.61148180127020324  -0.78064122227310373 -0.1269753323236586 -0.61194488891504861
--0.78108437977813128 0.1264800315542341 -0.61148180127020324  -0.78064122227310373 0.12697533232366118 -0.61194488891504806
--0.73618246464930537 0.48798559166164257 -0.46894076499437626  -0.73602315194220502 0.48809649929758558 -0.46907539604897625
--0.59667643972673012 0.40176612662410133 -0.69466625495449263  -0.59667142984000909 0.40197239864759921 -0.69455121880115833
--0.61148180127020324 0.78108437977813128 0.12648003155423412  -0.61194488891504895 0.7806412222731034 0.12697533232365887
--0.61148180127020324 0.78108437977813128 -0.1264800315542341  -0.61194488891504806 0.78064122227310373 -0.12697533232366118
--0.46894076499437626 0.73618246464930537 -0.48798559166164257  -0.46907539604897724 0.7360231519422048 -0.48809649929758492
--0.69466625495449263 0.59667643972673012 -0.40176612662410133  -0.694551218801158 0.59667142984000887 -0.40197239864760032
--0.64943374300381451 0.75762878984770377 -0.06507249989019516  -0.64992905036579229 0.75716571946238032 -0.065515668062193097
--0.44478475305090454 0.88410882140193769 -0.14324145828887103  -0.44447864693329692 0.88414105178604085 -0.14399073917102864
--0.067174638370274931 0.98448758643139411 -0.16208565674454736  -0.067102997401376444 0.98445575684574338 -0.16230850425355248
--0.20668066329284998 0.89826812139385259 -0.38781114670466371  -0.20645471950357303 0.89833165619575694 -0.38778432700573312
--0.8962672300889245 -0.071858277492354974 0.43765447584202588  -0.89666746009116993 -0.072917516439698196 0.4366583353262784
-0.37971225316070945 0.92432583806700219 -0.037951941733611459  0.37896297887110203 0.92463196144413295 -0.037984161450743445
-0.20668066329284998 0.89826812139385259 -0.38781114670466382  0.20645471950357261 0.89833165619575706 -0.38778432700573312
-0.067174638370274931 0.98448758643139411 -0.16208565674454736  0.067102997401376457 0.98445575684574338 -0.16230850425355248
-0.37971225316070945 0.92432583806700219 0.037951941733611459  0.37896297887110203 0.92463196144413284 0.037984161450743424
-0.50619228471494349 0.84615687966832631 -0.16669704821929851  0.50593831119476229 0.84615689033529795 -0.16746624198175172
-0.69466625495449252 0.59667643972673035 -0.40176612662410133  0.69455121880115822 0.59667142984000943 -0.40197239864759909
-0.46894076499437626 0.73618246464930526 -0.48798559166164268  0.46907539604897619 0.7360231519422048 -0.48809649929758586
-0.7956418656744515 -0.062099421877685829 0.60211592452938856  0.77995892884278373 -0.0636434458986644 0.62258620376021934
-0.84615687966832631 0.16669704821929851 -0.50619228471494349  0.84615689033529806 0.16746624198175136 -0.50593831119476196
-0.59667643972673035 0.40176612662410133 -0.69466625495449252  0.5966714298400102 0.40197239864759848 -0.69455121880115789
-0.73618246464930526 0.48798559166164268 -0.46894076499437626  0.7360231519422048 0.48809649929758586 -0.46907539604897613
-0.45467325858997609 -0.60749293870920384 0.65018159643527607  0.45629539576528944 -0.61497179190323881 0.64312067838526032
-0.23894057244986044 -0.95306848001363997 -0.18186355091081888  0.23241575440058948 -0.95608513245170468 -0.1785612965096614
-0.39895802436543049 -0.69687753315555545 0.59574101077153174  0.3711941831777546 -0.71962089011270503 0.58682250543788594
-0.80588150441467499 -0.045732053728024698 0.58956860097969011  0.8103609401492794 -0.030667519535216053 0.58512789193981596
--0.037951941733611459 -0.37971225316070945 0.92432583806700219  -0.037984161450743424 -0.37896297887110203 0.92463196144413284
-0.16669704821929851 -0.50619228471494349 0.84615687966832631  0.16746624198175172 -0.50593831119476229 0.84615689033529795
-0.36998650939197836 -0.74269333684247552 0.55678551944213661  0.37302523877669347 -0.74314518846920541 0.5555064356878866
-0.48798559166164268 -0.46894076499437626 0.73618246464930526  0.48809649929758531 -0.46907539604897708 0.73602315194220469
-0.14324145828887105 -0.44478475305090459 0.88410882140193769  0.14399073917102881 -0.44447864693329647 0.88414105178604085
-0.065072499890195173 -0.64943374300381473 0.75762878984770365  0.065515668062194887 -0.64992905036579063 0.75716571946238165
--0.13950602492257505 -0.85675191169903997 0.49650199476975138  -0.13935172210219521 -0.85685972305470992 0.4963592575481578
-0.13950602492257505 -0.85675191169903997 0.49650199476975149  0.13935172210219487 -0.85685972305470948 0.49635925754815852
--0.64943374300381451 -0.75762878984770365 0.065072499890195146  -0.64992905036579229 -0.75716571946238032 0.065515668062193111
--0.44478475305090454 -0.88410882140193769 0.14324145828887103  -0.44447864693329692 -0.88414105178604085 0.14399073917102864
--0.067174638370274931 -0.98448758643139411 0.16208565674454736  -0.06710299740137643 -0.98445575684574338 0.16230850425355237
--0.20668066329284998 -0.89826812139385259 0.38781114670466371  -0.20645471950357303 -0.89833165619575694 0.38778432700573312
--0.50619228471494349 -0.84615687966832631 0.16669704821929851  -0.50593831119476196 -0.84615689033529817 0.16746624198175136
--0.37971225316070945 -0.92432583806700219 -0.037951941733611459  -0.37896297887110203 -0.92463196144413295 -0.037984161450743445
--0.20668066329284993 -0.89826812139385259 -0.38781114670466377  -0.20645471950357258 -0.89833165619575706 -0.38778432700573306
--0.067174638370274931 -0.98448758643139411 -0.16208565674454742  -0.067102997401376444 -0.98445575684574338 -0.16230850425355237
--0.14324145828887105 -0.44478475305090459 -0.88410882140193769  -0.14399073917102881 -0.44447864693329647 -0.88414105178604085
--0.065072499890195173 -0.64943374300381473 -0.75762878984770365  -0.065515668062194887 -0.64992905036579063 -0.75716571946238165
-0.13950602492257505 -0.85675191169903997 -0.49650199476975138  0.1393517221021954 -0.85685972305471014 -0.49635925754815741
--0.13950602492257505 -0.85675191169903997 -0.49650199476975149  -0.13935172210219487 -0.85685972305470948 -0.49635925754815852
--0.1264800315542341 -0.61148180127020313 -0.78108437977813105  -0.12697533232365898 -0.61194488891504895 -0.78064122227310351
-0.1264800315542341 -0.61148180127020313 -0.78108437977813105  0.12697533232366126 -0.61194488891504806 -0.78064122227310373
-0.48798559166164257 -0.46894076499437626 -0.73618246464930537  0.48809649929758553 -0.46907539604897625 -0.73602315194220491
-0.87006466098054647 0.056547496445093395 0.48863305375424759  0.8690820938250331 0.066959188365444275 0.49011506943383953
-0.78108437977813128 0.12648003155423412 -0.61148180127020324  0.78064122227310373 0.1269753323236586 -0.61194488891504861
-0.88525794997176432 0.0810906962302608 0.4567171564832469  0.88043888279482108 0.087790975218743975 0.4659614987669573
-0.34243159318633287 -0.78789291377908466 0.51176714118576805  0.37438115159292812 -0.78669229841287636 0.4908706356565023
-0.34177771381313388 -0.78887113359859229 0.51061830246204121  0.34181621487243674 -0.80836571705727855 0.47927710433188003
-0.75762878984770377 -0.06507249989019516 -0.64943374300381462  0.75716571946238087 -0.065515668062193555 -0.64992905036579174
-0.31682936237190812 -0.8280363774210906 0.46105412139556601  0.30871603125497998 -0.82882275556678786 0.46663395922376977
-0.9094202856258099 0.11959234854368264 0.39708487175152674  0.90100988165586193 0.12889639121159815 0.41420636582640341
-0.27399725512977041 -0.89741802080743227 0.34558774394436154  0.30431345936390647 -0.89521176696948712 0.32555984200963828
--0.83986385056568236 -0.054857140713616914 0.54001796879892028  -0.83909253130010442 -0.056307189018219773 0.54106674669697596
-0.27219661039719134 -0.89987434907152952 0.34005641981910195  0.27087574504912154 -0.91136373772562251 0.30990719304796066
-0.96559982489567697 0.20947750201587079 0.15035899655759488  0.96089435748012486 0.2198288169025045 0.16839633316109695
-0.24336599009814622 -0.94602936533555493 0.21094260961626568  0.23388566130185726 -0.94764280563006065 0.21741805439056802
-0.96947353031104511 0.21592607882051257 0.10986054425367309  0.96991439832022719 0.2213218831876424 0.10140356972704373
-0.97351999728657068 0.22241808576487493 0.034988854233130445  0.97444445519668965 0.22205052462856237 0.033934764602200893
-0.89826812139385259 0.38781114670466377 -0.20668066329284993  0.89833165619575706 0.38778432700573306 -0.20645471950357258
-0.22743420727478347 -0.97114863140943242 0.060907607905721757  0.22895713509378088 -0.9715862185724935 0.059990417315193827
-0.44478475305090459 0.88410882140193769 -0.14324145828887105  0.44447864693329647 0.88414105178604085 -0.14399073917102881
-0.64943374300381462 0.75762878984770354 -0.06507249989019516  0.64992905036579052 0.75716571946238165 -0.065515668062194804
-0.85675191169903997 0.49650199476975138 0.13950602492257505  0.85685972305469982 0.49635925754815302 0.13935172210227365
-0.85675191169903997 0.49650199476975149 -0.13950602492257505  0.85685972305470948 0.49635925754815846 -0.13935172210219487
--0.37971225316070945 -0.92432583806700219 0.037951941733611459  -0.37896297887110203 -0.92463196144413284 0.037984161450743424
--0.50619228471494349 -0.84615687966832631 -0.16669704821929851  -0.50593831119476229 -0.84615689033529795 -0.16746624198175172
--0.69466625495449252 -0.59667643972673035 -0.40176612662410133  -0.69455121880115822 -0.59667142984000943 -0.40197239864759909
--0.46894076499437626 -0.73618246464930526 -0.48798559166164268  -0.46907539604897691 -0.7360231519422048 -0.4880964992975852
--0.92432583806700219 0.037951941733611459 -0.37971225316070945  -0.92463196144413284 0.037984161450743424 -0.37896297887110203
--0.84615687966832631 -0.16669704821929851 -0.50619228471494349  -0.84615689033529806 -0.16746624198175136 -0.50593831119476196
--0.59667643972673035 -0.40176612662410133 -0.69466625495449252  -0.5966714298400102 -0.40197239864759848 -0.69455121880115789
--0.73618246464930526 -0.48798559166164268 -0.46894076499437626  -0.7360231519422048 -0.48809649929758586 -0.46907539604897613
--0.44478475305090459 -0.88410882140193769 -0.14324145828887105  -0.44447864693329647 -0.88414105178604085 -0.14399073917102881
--0.64943374300381462 -0.75762878984770354 -0.06507249989019516  -0.64992905036579052 -0.75716571946238165 -0.065515668062194804
--0.85675191169903997 -0.49650199476975138 0.13950602492257505  -0.85685972305470992 -0.4963592575481578 0.13935172210219521
--0.85675191169903997 -0.49650199476975149 -0.13950602492257505  -0.85685972305470948 -0.49635925754815846 -0.13935172210219487
--0.75762878984770377 -0.06507249989019516 0.64943374300381462  -0.75716571946238065 -0.06551566806219343 0.64992905036579196
--0.88410882140193769 -0.14324145828887103 0.44478475305090454  -0.88414105178604085 -0.14399073917102864 0.44447864693329692
--0.98448758643139411 -0.16208565674454736 0.067174638370274931  -0.98445575684574338 -0.16230850425355248 0.067102997401376444
--0.89826812139385259 -0.38781114670466371 0.20668066329284998  -0.89833165619575717 -0.38778432700573329 0.20645471950357211
--0.61148180127020324 -0.78108437977813128 -0.12648003155423412  -0.61194488891504895 -0.7806412222731034 -0.12697533232365887
--0.61148180127020324 -0.78108437977813128 0.1264800315542341  -0.61194488891504806 -0.78064122227310373 0.12697533232366118
--0.46894076499437626 -0.73618246464930537 0.48798559166164257  -0.46907539604897752 -0.73602315194220436 0.48809649929758531
--0.69466625495449263 -0.59667643972673012 0.40176612662410133  -0.694551218801158 -0.59667142984000887 0.40197239864760032
-0.1264800315542341 -0.61148180127020313 0.78108437977813105  0.12697533232365898 -0.61194488891504895 0.78064122227310351
--0.1264800315542341 -0.61148180127020313 0.78108437977813105  -0.12697533232366126 -0.61194488891504806 0.78064122227310373
--0.48798559166164257 -0.46894076499437626 0.73618246464930537  -0.4880964992975852 -0.46907539604897597 0.73602315194220536
--0.40176612662410133 -0.69466625495449263 0.59667643972673012  -0.4019723986475997 -0.69455121880115744 0.59667142984000987
--0.75762878984770377 0.06507249989019516 -0.64943374300381462  -0.7571657194623802 0.065515668062193153 -0.64992905036579229
--0.88410882140193769 0.14324145828887103 -0.44478475305090454  -0.88414105178604085 0.14399073917102864 -0.44447864693329692
--0.98448758643139411 0.16208565674454736 -0.067174638370274931  -0.98445575684574338 0.16230850425355248 -0.067102997401376444
--0.89826812139385259 0.38781114670466371 -0.20668066329284998  -0.89833165619575717 0.38778432700573329 -0.20645471950357211
--0.84615687966832631 -0.16669704821929851 0.50619228471494349  -0.84615689033529806 -0.16746624198175136 0.50593831119476196
--0.92432583806700219 0.037951941733611459 0.37971225316070945  -0.92463196144413295 0.037984161450743445 0.37896297887110203
--0.89826812139385259 0.38781114670466382 0.20668066329284998  -0.89833165619575706 0.38778432700573312 0.20645471950357261
--0.98448758643139411 0.16208565674454736 0.067174638370274931  -0.98445575684574338 0.16230850425355248 0.067102997401376457
--0.9236940845413727 0.2726998137406515 -0.26911716736226499  -0.92375019852295026 0.27282039415738751 -0.26880216379452304
--0.86230450765389344 0.37596077789543381 -0.33924096091721673  -0.86229745711633865 0.37608264246842449 -0.33912378489964901
--0.9506072962094394 0.27889813733511903 -0.13624095340381404  -0.95055095711572846 0.27915487828976165 -0.13610816233202513
--0.95977938206574664 0.28075529872380572 0  -0.95982343558557004 0.28060440841513712 -0.0003721272683770178
--0.33924096091721678 0.86230450765389344 0.37596077789543403  -0.33912378489964823 0.86229745711633854 0.37608264246842515
--0.40632940254264294 0.78437123837371081 0.46867704983435066  -0.40646863937642841 0.78424095119900827 0.46877433341209035
--0.61446983418191226 0.27287882084494519 0.74024588618561449  -0.61436698850995408 0.27300775118977955 0.74028370995146808
--0.52579382752597525 0.20828740048796671 0.8247164420172246  -0.52568280774650589 0.20813967421463492 0.82482450355064985
--0.040522281668716867 -0.13192856911395229 0.99043061207734606  -0.040575895565417484 -0.13176921185868204 0.99044963097837846
-0.081370946056690235 -0.066381045638217215 0.9944708773603258  0.081578796887611729 -0.06633169903631253 0.99445714115859518
-0.040522281668716867 -0.13192856911395229 -0.99043061207734606  0.040575895565417512 -0.13176921185868204 -0.99044963097837846
--0.081370946056690235 -0.066381045638217215 -0.9944708773603258  -0.081578796887611729 -0.06633169903631253 -0.99445714115859518
--0.58942568680894825 0.20731239180326447 -0.78076816785433134  -0.58928970592655872 0.20735457304096713 -0.78085960551688693
--0.57608383788574391 0.33994835690442565 -0.74334549596053456  -0.57610127698437297 0.34013694034011499 -0.74324570666303891
--0.40480738995889742 0.82178222598517658 -0.40100492526839771  -0.40477696304846161 0.82172156155092047 -0.4011599250518193
--0.27466844612618396 0.86574218443040096 -0.41838703947458172  -0.274471373250949 0.8658197480866201 -0.41835586417422199
-0.33924096091721678 0.86230450765389344 -0.37596077789543403  0.3391237848996484 0.86229745711633854 -0.3760826424684251
-0.40632940254264294 0.78437123837371081 -0.46867704983435066  0.40646863937642841 0.78424095119900827 -0.46877433341209035
-0.61446983418191226 0.27287882084494519 -0.74024588618561449  0.61436698850995408 0.27300775118977955 -0.74028370995146808
-0.52579382752597525 0.20828740048796671 -0.8247164420172246  0.52568280774650589 0.20813967421463492 -0.82482450355064985
-0.27287882084494519 -0.74024588618561449 0.61446983418191226  0.2730077511897796 -0.74028370995146819 0.61436698850995419
-0.20828740048796671 -0.8247164420172246 0.52579382752597525  0.20813967421463489 -0.82482450355064973 0.52568280774650589
--0.13192856911395229 -0.99043061207734606 0.040522281668716867  -0.13176921185868204 -0.99044963097837846 0.040575895565417484
--0.066381045638217215 -0.9944708773603258 -0.081370946056690235  -0.066331699036312516 -0.99445714115859507 -0.081578796887611729
-0.20731239180326447 -0.78076816785433134 -0.58942568680894825  0.20735457304096688 -0.78085960551688727 -0.58928970592655838
-0.33994835690442565 -0.74334549596053456 -0.57608383788574391  0.34013694034011205 -0.7432457066630398 -0.57610127698437341
-0.30362145533065943 -0.84916410602320291 0.43023759412454349  0.30820444126016605 -0.84736796744948895 0.43240900791730824
-0.96559982489567697 0.20947750201587081 -0.15035899655759494  0.96089435748012531 0.21982881690250081 -0.16839633316109939
-0.95069104161024875 0.18567470552212903 -0.24579255546759926  0.95608513245170379 0.17856129650966704 -0.2324157544005887
-0.25308933658097965 -0.92998804508785282 0.26439588316448515  0.23565009060488876 -0.93757115374048894 0.25579164660253478
--0.82401873423925942 0.23458495860622128 -0.51571602924327076  -0.82387113061171735 0.23530638500725787 -0.51562318151862285
--0.88076789123048704 0.25952221836449818 -0.39610117388436322  -0.880708345595418 0.25988482570664373 -0.39599581735923572
--0.61446983418191226 -0.27287882084494519 -0.74024588618561449  -0.61436698850995408 -0.27300775118977955 -0.74028370995146808
--0.52579382752597525 -0.20828740048796671 -0.8247164420172246  -0.52568280774650589 -0.20813967421463492 -0.82482450355064985
--0.99043061207734606 -0.040522281668716874 0.13192856911395229  -0.99044963097837846 -0.040575895565417512 0.13176921185868204
--0.9944708773603258 0.081370946056690249 0.066381045638217229  -0.99445714115859507 0.081578796887611688 0.066331699036312544
--0.40100492526839771 -0.40480738995889742 0.82178222598517658  -0.40115992505181952 -0.40477696304846178 0.82172156155092024
--0.41838703947458172 -0.27466844612618396 0.86574218443040096  -0.41835586417422199 -0.274471373250949 0.8658197480866201
--0.86230450765389344 0.37596077789543403 0.33924096091721678  -0.86229745711633876 0.37608264246842515 0.33912378489964795
--0.78437123837371059 0.46867704983435055 0.40632940254264294  -0.78424095119900905 0.46877433341208957 0.40646863937642802
-0.040522281668716867 0.13192856911395229 0.99043061207734606  0.040575895565417512 0.13176921185868204 0.99044963097837846
--0.081370946056690235 0.066381045638217215 0.9944708773603258  -0.081578796887611729 0.06633169903631253 0.99445714115859518
-0.37596077789543403 -0.33924096091721678 0.86230450765389344  0.37608264246842515 -0.33912378489964889 0.86229745711633843
-0.46867704983435055 -0.40632940254264294 0.78437123837371059  0.46877433341208941 -0.40646863937642841 0.78424095119900894
--0.82440895259656954 0.11626913535565189 -0.55392361119767786  -0.823895301648223 0.11760246779863361 -0.55440616112165897
--0.81891028733871629 0 -0.57392154628557124  -0.81788534298629756 0.00078604920685375042 -0.57538069819453541
--0.32839555720531111 -0.64061453708709615 0.69409608332024086  -0.32871571883365175 -0.64057192708348332 0.69398384882087005
--0.27287882084494514 -0.74024588618561449 0.61446983418191203  -0.27300775118978016 -0.74028370995146797 0.61436698850995408
--0.45126666560725864 -0.58750761901107262 0.67170915887432026  -0.45152335920120684 -0.58737470394737479 0.67165289641182357
--0.56664784959934422 -0.52372394783737508 0.63610018157997195  -0.56692430597377863 -0.5234294246654746 0.63609627313050632
-0.13192856911395229 0.99043061207734606 0.040522281668716874  0.13176921185868204 0.99044963097837846 0.040575895565417512
-0.066381045638217229 0.9944708773603258 -0.081370946056690249  0.066331699036312544 0.99445714115859507 -0.081578796887611688
--0.27287882084494519 0.74024588618561449 0.61446983418191226  -0.2730077511897796 0.74028370995146819 0.61436698850995419
--0.20828740048796671 0.8247164420172246 0.52579382752597525  -0.20813967421463625 0.82482450355064962 0.52568280774650578
--0.74024588618561449 0.61446983418191226 0.27287882084494519  -0.74028370995146808 0.61436698850995408 0.27300775118977955
--0.8247164420172246 0.52579382752597525 0.20828740048796671  -0.82482450355064973 0.52568280774650578 0.20813967421463528
--0.37596077789543403 0.33924096091721678 0.86230450765389344  -0.37608264246842527 0.33912378489964845 0.86229745711633854
--0.46867704983435055 0.40632940254264294 0.78437123837371059  -0.46877433341208941 0.40646863937642841 0.78424095119900894
--0.58942568680894825 -0.20731239180326447 0.78076816785433134  -0.58928970592655872 -0.20735457304096713 0.78085960551688693
--0.57608383788574391 -0.33994835690442565 0.74334549596053456  -0.57610127698437297 -0.34013694034011499 0.74324570666303891
-0.37596077789543403 0.33924096091721678 -0.86230450765389344  0.37608264246842515 0.33912378489964873 -0.86229745711633843
-0.46867704983435055 0.40632940254264294 -0.78437123837371059  0.46877433341208941 0.40646863937642841 -0.78424095119900894
-0.58942568680894825 -0.20731239180326447 -0.78076816785433134  0.58928970592655872 -0.20735457304096713 -0.78085960551688693
-0.57608383788574391 -0.33994835690442565 -0.74334549596053456  0.57610127698437297 -0.34013694034011493 -0.74324570666303891
--0.040522281668716867 0.13192856911395229 -0.99043061207734606  -0.040575895565417484 0.13176921185868204 -0.99044963097837846
-0.081370946056690235 0.066381045638217215 -0.9944708773603258  0.081578796887611729 0.06633169903631253 -0.99445714115859518
--0.37596077789543403 -0.33924096091721678 -0.86230450765389344  -0.37608264246842515 -0.33912378489964889 -0.86229745711633843
--0.46867704983435055 -0.40632940254264294 -0.78437123837371059  -0.46877433341208941 -0.40646863937642841 -0.78424095119900894
--0.40100492526839771 0.40480738995889742 -0.82178222598517658  -0.40115992505181952 0.40477696304846178 -0.82172156155092024
--0.41838703947458172 0.27466844612618396 -0.86574218443040096  -0.41835586417422199 0.274471373250949 -0.8658197480866201
--0.82178222598517658 0.40100492526839771 -0.40480738995889742  -0.82172156155092047 0.4011599250518193 -0.40477696304846161
--0.86574218443040096 0.41838703947458172 -0.27466844612618396  -0.86581974808661955 0.41835586417422266 -0.27447137325094939
--0.20731239180326447 0.78076816785433134 -0.58942568680894825  -0.20735457304096688 0.78085960551688727 -0.58928970592655838
--0.33994835690442565 0.74334549596053456 -0.57608383788574391  -0.34013694034011366 0.74324570666303924 -0.57610127698437308
--0.13192856911395229 0.99043061207734606 -0.040522281668716874  -0.13176921185868207 0.99044963097837846 -0.040575895565417457
--0.066381045638217229 0.9944708773603258 0.081370946056690249  -0.066331699036312544 0.99445714115859507 0.081578796887611688
-0.27287882084494519 0.74024588618561449 -0.61446983418191226  0.2730077511897796 0.74028370995146819 -0.61436698850995419
-0.20828740048796671 0.8247164420172246 -0.52579382752597525  0.20813967421463625 0.82482450355064962 -0.52568280774650578
-0.74024588618561449 0.61446983418191226 -0.27287882084494519  0.74028370995146808 0.61436698850995408 -0.27300775118977955
-0.8247164420172246 0.52579382752597525 -0.20828740048796671  0.82482450355064973 0.52568280774650589 -0.20813967421463489
-0.2530893365809796 -0.92998804508785282 -0.26439588316448515  0.23565009060479358 -0.93757115374046784 -0.25579164660269982
-0.2274342072747835 -0.97114863140943242 -0.060907607905721785  0.22895713509378299 -0.97158621857249283 -0.059990417315196665
-0.61446983418191226 -0.27287882084494519 0.74024588618561449  0.6143669885099543 -0.27300775118977966 0.74028370995146797
-0.52579382752597525 -0.20828740048796671 0.8247164420172246  0.52568280774650589 -0.20813967421463492 0.82482450355064985
-0.94686945971280467 0.17991689161909563 -0.26460466631117985  0.95170604908214473 0.15778941565062543 -0.26335925358545598
-0.93208712065408494 0.15549608434201162 -0.32699007860623541  0.91789704785097681 0.17153707639043031 -0.35782683098097218
--0.20731239180326447 -0.78076816785433134 0.58942568680894825  -0.20735457304096688 -0.78085960551688727 0.58928970592655838
--0.33994835690442565 -0.74334549596053456 0.57608383788574391  -0.34013694034011366 -0.74324570666303924 0.57610127698437308
-0.13192856911395229 -0.99043061207734606 -0.040522281668716867  0.13176921185868207 -0.99044963097837846 -0.04057589556541745
-0.066381045638217215 -0.9944708773603258 0.081370946056690235  0.066331699036312516 -0.99445714115859507 0.081578796887611729
--0.33924096091721678 -0.86230450765389344 -0.37596077789543403  -0.33912378489964845 -0.86229745711633887 -0.37608264246842454
--0.40632940254264294 -0.78437123837371081 -0.46867704983435066  -0.40646863937642835 -0.78424095119900894 -0.46877433341208941
-0.93339586248116191 0.15759811547986141 -0.32187126056253423  0.93893517079361377 0.17584665747242345 -0.29576798018471079
-0.27466844612618396 -0.86574218443040096 -0.41838703947458172  0.27447137325094473 -0.8658197480866211 -0.41835586417422249
-0.40100492526839771 -0.40480738995889742 -0.82178222598517658  0.40115992505181952 -0.40477696304846178 -0.82172156155092024
-0.41838703947458172 -0.27466844612618396 -0.86574218443040096  0.41835586417422199 -0.274471373250949 -0.8658197480866201
-0.9094202856258099 0.11959234854368263 -0.39708487175152668  0.90100988165586215 0.12889639121161173 -0.41420636582639886
-0.86048662890264316 0.042111562758920092 0.50664961250726259  0.85780946571559435 0.048345734654264332 0.5116889782567785
-0.97351999728657068 0.22241808576487493 -0.034988854233130418  0.97444445519669032 0.22205052462855904 -0.033934764602203973
-0.29401138453262826 -0.86471241548978539 -0.40567809407889899  0.30717055145208322 -0.86468532536854159 -0.39744878967349023
-0.96947353031104488 0.21592607882051251 -0.10986054425367317  0.96991439832021309 0.2213218831876913 -0.1014035697270716
-0.25697201819559901 -0.92432848622760766 0.28050566540029309  0.23706297888618891 -0.92607252553187069 0.29358273364867526
-0.86230450765389344 0.37596077789543403 -0.33924096091721678  0.86229745711633898 0.3760826424684246 -0.33912378489964801
-0.78437123837371059 0.46867704983435055 -0.40632940254264294  0.78424095119900816 0.46877433341209018 -0.40646863937642891
--0.27287882084494519 -0.74024588618561449 -0.61446983418191226  -0.2730077511897796 -0.74028370995146819 -0.61436698850995419
--0.20828740048796671 -0.8247164420172246 -0.52579382752597525  -0.20813967421463489 -0.82482450355064973 -0.52568280774650589
--0.74024588618561449 -0.61446983418191226 -0.27287882084494519  -0.74028370995146808 -0.61436698850995408 -0.27300775118977955
--0.8247164420172246 -0.52579382752597525 -0.20828740048796671  -0.82482450355064973 -0.52568280774650589 -0.20813967421463489
--0.86230450765389344 -0.37596077789543403 -0.33924096091721678  -0.86229745711633887 -0.37608264246842449 -0.33912378489964828
--0.78437123837371059 -0.46867704983435055 -0.40632940254264294  -0.78424095119900816 -0.46877433341209018 -0.40646863937642891
--0.78076816785433134 -0.58942568680894825 0.20731239180326447  -0.78085960551688727 -0.58928970592655838 0.20735457304096688
--0.74334549596053456 -0.57608383788574391 0.33994835690442565  -0.74324570666303957 -0.57610127698437219 0.34013694034011444
--0.82178222598517658 -0.40100492526839771 0.40480738995889742  -0.82172156155092047 -0.40115992505181913 0.4047769630484615
--0.86574218443040096 -0.41838703947458172 0.27466844612618396  -0.86581974808661955 -0.41835586417422266 0.27447137325094939
--0.40480738995889742 -0.82178222598517658 0.40100492526839771  -0.40477696304846178 -0.82172156155092024 0.40115992505181952
--0.27466844612618396 -0.86574218443040096 0.41838703947458172  -0.274471373250949 -0.8658197480866201 0.41835586417422199
--0.78076816785433134 0.58942568680894825 -0.20731239180326447  -0.78085960551688727 0.58928970592655838 -0.20735457304096688
--0.74334549596053456 0.57608383788574391 -0.33994835690442565  -0.74324570666303957 0.57610127698437219 -0.34013694034011444
--0.99043061207734606 0.040522281668716874 -0.13192856911395229  -0.99044963097837846 0.040575895565417457 -0.13176921185868207
--0.9944708773603258 -0.081370946056690249 -0.066381045638217229  -0.99445714115859507 -0.081578796887611701 -0.066331699036312544
--0.067277074024322203 -0.70227702532207648 0.70871769768752158  -0.067501320615791602 -0.70276863564904046 0.7082088791190847
--0.20012814034344359 -0.68018071850695239 0.70519707714513447  -0.20029565457621396 -0.68040299513329183 0.7049350430866177
-0.039734588558411582 0.26026494835742225 0.96471929550963276  0.039677999129164823 0.25990051397960157 0.96481986879326076
-0.15985780358782287 0.19937696972895619 0.96679589706089264  0.16010344242024352 0.19913925651268635 0.96680424297825784
--0.13827368218737232 0.7695778385021762 0.62340222914316235  -0.13836216352689651 0.76972539034249154 0.62320039727703591
--0.067277074024322245 0.70227702532207659 0.70871769768752169  -0.067501320615791949 0.70276863564904002 0.70820887911908514
-0 -0.62578188869003271 0.77999809473327264  0.00023519417927802882 -0.62694312538533059 0.77906499229253756
-0.054857140713616921 -0.54001796879892028 0.83986385056568236  0.0567929941448857 -0.53979489236345579 0.83987858050695885
--0.35362935294171682 0.46556504362316581 0.81129246939324073  -0.35387698305874399 0.46550486715932438 0.81121902067950868
--0.23458495860622128 0.51571602924327076 0.82401873423925942  -0.23530638500725828 0.51562318151862241 0.82387113061171746
--0.64061453708709615 -0.69409608332024086 0.32839555720531111  -0.64057192708348243 -0.69398384882087072 0.32871571883365219
-0.069740197633308867 0.8004723406749189 0.59529852733606159  0.069662907281838701 0.80067536950372598 0.5950344796892979
--0.080281277350241251 0.19739352602284607 0.97703158208487906  -0.080345839839677427 0.19714040391717316 0.97707738033578018
--0.077704403643809677 0.32271058904772337 0.94330265629374277  -0.077926023088562599 0.32203490693742853 0.9435152641263429
--0.20012814034344362 0.68018071850695239 0.70519707714513458  -0.20029565457621312 0.6804029951332925 0.70493504308661725
--0.32839555720531116 0.64061453708709593 0.69409608332024109  -0.32871571883365153 0.64057192708348365 0.69398384882086983
--0.74024588618561449 -0.61446983418191203 0.27287882084494514  -0.74028370995146797 -0.61436698850995408 0.27300775118978016
-0.18656099607880564 0.38998766307204552 0.90172313788306913  0.18714545413042 0.38953622755321998 0.90179715370027913
--0.25952221836449818 0.39610117388436322 0.88076789123048704  -0.25988482570664329 0.395995817359236 0.880708345595418
--0.27269981374065155 0.26911716736226504 0.9236940845413727  -0.27282039415738729 0.26880216379452299 0.92375019852295037
--0.30401279487901051 0.33566720821021828 -0.891573746743482  -0.30422052318316722 0.33550256744406942 -0.89156486051918715
--0.18656099607880564 0.38998766307204552 -0.90172313788306913  -0.18714545413041722 0.38953622755321954 -0.90179715370027991
-0.25952221836449818 0.39610117388436322 -0.88076789123048704  0.25988482570664351 0.39599581735923611 -0.88070834559541777
-0.27269981374065155 0.26911716736226504 -0.9236940845413727  0.27282039415738729 0.26880216379452299 -0.92375019852295037
--0.26817151760031976 0.68929656115193516 -0.6730187872058685  -0.2683644632421503 0.68937955050281352 -0.67285685715261256
--0.19300544019554741 0.62457262167826677 -0.75674166021493716  -0.19358827458119449 0.62484261256047757 -0.75636980999592573
--0.039734588558411582 0.26026494835742225 -0.96471929550963276  -0.039677999129164775 0.25990051397960157 -0.96481986879326076
--0.15985780358782287 0.19937696972895619 -0.96679589706089264  -0.16010344242024352 0.19913925651268635 -0.96680424297825784
-0.13827368218737232 0.7695778385021762 -0.62340222914316235  0.13836216352689651 0.76972539034249154 -0.62320039727703591
-0.067277074024322245 0.70227702532207659 -0.70871769768752169  0.067501320615791671 0.70276863564904035 -0.7082088791190847
--0.28407954462258928 0.46039308870086582 -0.84103330267207554  -0.28440717777405611 0.46019616855581397 -0.84103034646625274
--0.37149736972483099 0.52777252693426735 -0.76383628095354983  -0.37176976328896 0.52785497534633807 -0.76364675610270705
-0.35362935294171682 0.46556504362316581 -0.81129246939324073  0.35387698305874399 0.46550486715932438 -0.81121902067950868
-0.23458495860622128 0.51571602924327076 -0.82401873423925942  0.23530638500725828 0.51562318151862241 -0.82387113061171746
--0.135836225526941 0.719915307065364 -0.68063975088704354  -0.13609530337963532 0.72008099426245686 -0.68041269101920521
--0.069740197633308867 0.8004723406749189 -0.59529852733606159  -0.069662907281838521 0.80067536950372609 -0.59503447968929801
-0.080281277350241251 0.19739352602284607 -0.97703158208487906  0.080345839839677427 0.19714040391717316 -0.97707738033578018
-0.077704403643809677 0.32271058904772337 -0.94330265629374277  0.077926023088562599 0.32203490693742853 -0.9435152641263429
-0.20012814034344362 0.68018071850695239 -0.70519707714513458  0.20029565457621254 0.68040299513329261 -0.70493504308661725
-0.32839555720531116 0.64061453708709593 -0.69409608332024109  0.32871571883365153 0.64057192708348365 -0.69398384882086983
-0.19739352602284607 -0.97703158208487906 0.080281277350241251  0.19714040391716239 -0.97707738033578384 0.080345839839657915
-0.88525794997176432 0.081090696230260814 -0.45671715648324701  0.88043888279482208 0.087790975218749304 -0.46596149876695442
-0.69377314187723504 -0.22428489754399578 0.68341702461536258  0.68956138101058795 -0.23429135260016812 0.68528290794062152
-0.30362145533065937 -0.84916410602320314 -0.43023759412454321  0.30820444126016194 -0.84736796744948673 -0.43240900791731557
-0.84685829520082545 0.019286849148286479 -0.53075413092765555  0.84560936423415123 0.027439993872777964 -0.53309647331020338
-0.86048662890264316 0.042111562758920099 -0.50664961250726259  0.85780946571559225 0.048345734654243647 -0.51168897825678417
-0.93339586248116191 0.15759811547986138 0.32187126056253412  0.93893517079361677 0.17584665747242473 0.29576798018470041
-0.67087146858540314 -0.2624299701285262 0.69320320770179844  0.66138007935865273 -0.23687493927937106 0.71166470600201659
-0.77138586605477633 -0.1010889929861338 -0.62717432611494872  0.76918721291849768 -0.096596587118420896 -0.63168040245027945
-0.24336599009814619 -0.94602936533555493 -0.21094260961626565  0.23388566130186011 -0.94764280563005887 -0.21741805439057252
-0.79564186567445128 -0.06209942187768587 -0.60211592452938889  0.77995892884278062 -0.063643445898667397 -0.62258620376022278
-0.19937696972895619 -0.96679589706089264 -0.15985780358782287  0.19913925651268788 -0.96680424297825807 -0.16010344242024077
-0.79934060742300872 -0.055862651692236032 -0.59790562905682221  0.79006130932890728 -0.031934562996145929 -0.61219548445552729
-0.39895802436542988 -0.69687753315555612 -0.5957410107715313  0.37119418317777397 -0.71962089011270369 -0.5868225054378754
-0.40036321981550371 -0.69465247190942381 -0.5975302451883705  0.36887582764820903 -0.69486688193504553 -0.61732539245256723
-0.36998650939197825 -0.74269333684247574 -0.5567855194421365  0.37302523877669252 -0.74314518846920119 -0.55550643568789271
-0.23294949527472619 -0.96194916611186088 -0.13775142693846473  0.23081318598024428 -0.96295953203001483 -0.13940664564569327
-0.77138586605477644 -0.10108899298613383 0.62717432611494861  0.76918721291849901 -0.096596587118417288 0.63168040245027857
-0.27219661039719123 -0.89987434907152986 -0.34005641981910134  0.27087574504909701 -0.91136373772562662 -0.30990719304797043
-0.8348259841132093 -6.1457978060811826e-19 -0.5497573450331017  0.83512821922583769 1.1838618468367161e-14 -0.5500553221746709
--0.58750761901107262 -0.67170915887432026 0.45126666560725864  -0.58737470394737457 -0.67165289641182346 0.45152335920120723
--0.52372394783737519 -0.63610018157997184 0.56664784959934422  -0.52380155193385258 -0.63632626043050489 0.56632219140540196
-0.74055958467102845 -0.15027494754537968 -0.65399889841309089  0.74496666446894877 -0.16330181399314903 -0.64680536978024206
-0.23294949527472616 -0.96194916611186088 0.13775142693846476  0.23081318598027054 -0.96295953203000251 0.13940664564573535
--0.080281277350241251 -0.19739352602284607 -0.97703158208487906  -0.080345839839677427 -0.19714040391717316 -0.97707738033578018
--0.077704403643809677 -0.32271058904772337 -0.94330265629374277  -0.077926023088562599 -0.32203490693742853 -0.9435152641263429
--0.20012814034344362 -0.68018071850695239 -0.70519707714513458  -0.20029565457621254 -0.68040299513329261 -0.70493504308661725
--0.32839555720531116 -0.64061453708709593 -0.69409608332024109  -0.32871571883365153 -0.64057192708348365 -0.69398384882086983
--0.891573746743482 0.30401279487901051 -0.33566720821021828  -0.89156486051918693 0.30422052318316706 -0.33550256744407037
--0.90172313788306913 0.18656099607880564 -0.38998766307204552  -0.90179715370027991 0.18714545413041722 -0.38953622755321954
--0.88076789123048704 -0.25952221836449818 -0.39610117388436322  -0.88070834559541789 -0.25988482570664351 -0.39599581735923606
--0.9236940845413727 -0.27269981374065155 -0.26911716736226504  -0.92375019852294982 -0.27282039415738868 -0.26880216379452387
--0.62340222914316235 0.13827368218737232 0.76957783850217643  -0.6232003972770358 0.13836216352689656 0.76972539034249154
--0.70871769768752169 0.067277074024322245 0.70227702532207659  -0.70820887911908514 0.067501320615791949 0.70276863564904002
--0.84103330267207554 -0.28407954462258928 0.46039308870086582  -0.84103034646625308 -0.28440717777405616 0.46019616855581352
--0.76383628095354983 -0.37149736972483099 0.52777252693426735  -0.76364675610270705 -0.37176976328896005 0.52785497534633807
--0.46556504362316581 0.81129246939324073 0.35362935294171682  -0.46550486715932415 0.81121902067950902 0.35387698305874365
--0.51571602924327076 0.82401873423925942 0.23458495860622128  -0.51562318151862241 0.82387113061171757 0.23530638500725828
--0.719915307065364 0.68063975088704354 -0.135836225526941  -0.72008099426245686 0.68041269101920521 -0.13609530337963532
--0.8004723406749189 0.59529852733606159 -0.069740197633308867  -0.80067536950372609 0.59503447968929801 -0.069662907281838521
--0.30401279487901051 -0.33566720821021828 0.891573746743482  -0.30422052318316722 -0.33550256744406942 0.89156486051918715
--0.18656099607880564 -0.38998766307204552 0.90172313788306913  -0.18714545413041722 -0.38953622755321954 0.90179715370027991
-0.25952221836449818 -0.39610117388436322 0.88076789123048704  0.25988482570664362 -0.39599581735923617 0.88070834559541789
-0.27269981374065155 -0.26911716736226504 0.9236940845413727  0.27282039415738729 -0.26880216379452299 0.92375019852295037
-0.50392422938731019 -0.52945918848859996 0.68235511400187066  0.51008352708670168 -0.55674863743611447 0.65562622744046795
-0.75366980899531777 -0.12957223153317302 -0.64334361719230837  0.75782534074317554 -0.12946239417784902 -0.63948435588466823
--0.70227702532207648 -0.70871769768752158 0.067277074024322203  -0.70276863564903969 -0.70820887911908548 0.067501320615792171
-0.59529852733606148 0.069740197633308854 0.8004723406749189  0.59503447968929823 0.069662907281837758 0.80067536950372598
-0.62340222914316235 -0.13827368218737232 0.76957783850217643  0.6232003972770358 -0.13836216352689656 0.76972539034249154
-0.70871769768752169 -0.067277074024322245 0.70227702532207659  0.70820887911908514 -0.067501320615791949 0.70276863564904002
--0.68018071850695239 -0.70519707714513447 0.20012814034344359  -0.68040299513329183 -0.7049350430866177 0.20029565457621396
--0.62578188869003271 -0.77999809473327264 0  -0.6269431253853307 -0.77906499229253756 -0.0002351941792792563
-0.76957783850217643 0.62340222914316235 -0.13827368218737232  0.76972539034249154 0.6232003972770358 -0.13836216352689656
-0.70227702532207659 0.70871769768752169 -0.067277074024322245  0.70276863564903969 0.70820887911908559 -0.06750132061579224
--0.54001796879892028 -0.83986385056568236 -0.054857140713616921  -0.53979489236345579 -0.83987858050695896 -0.056792994144885707
--0.9236940845413727 -0.2726998137406515 0.26911716736226499  -0.92375019852295026 -0.27282039415738751 0.26880216379452304
--0.86230450765389344 -0.37596077789543381 0.33924096091721673  -0.86229745711633865 -0.37608264246842443 0.33912378489964906
--0.9506072962094394 -0.27889813733511903 0.13624095340381404  -0.95055095711572846 -0.27915487828976165 0.13610816233202513
-0.26026494835742225 0.96471929550963276 0.039734588558411582  0.25990051397960157 0.96481986879326076 0.039677999129164823
-0.19937696972895619 0.96679589706089264 0.15985780358782287  0.19913925651268638 0.96680424297825784 0.1601034424202436
--0.33566720821021828 0.891573746743482 -0.30401279487901051  -0.33550256744406942 0.89156486051918715 -0.30422052318316722
--0.38998766307204552 0.90172313788306913 -0.18656099607880564  -0.38953622755321954 0.90179715370027991 -0.18714545413041722
--0.39610117388436322 0.88076789123048704 0.25952221836449818  -0.39599581735923606 0.88070834559541789 0.25988482570664351
--0.26911716736226515 0.92369408454137258 0.27269981374065166  -0.26880216379452399 0.92375019852294971 0.27282039415738862
--0.19739352602284607 0.97703158208487906 0.080281277350241251  -0.19714040391717316 0.97707738033578018 0.080345839839677427
--0.32271058904772337 0.94330265629374277 0.077704403643809677  -0.32203490693742853 0.9435152641263429 0.077926023088562599
--0.68018071850695239 0.70519707714513458 0.20012814034344362  -0.68040299513329272 0.70493504308661736 0.20029565457621257
--0.64061453708709593 0.69409608332024109 0.32839555720531116  -0.64057192708348365 0.69398384882086983 0.32871571883365153
--0.97703158208487906 0.080281277350241251 0.19739352602284607  -0.97707738033578018 0.080345839839677427 0.19714040391717316
--0.94330265629374277 0.077704403643809677 0.32271058904772337  -0.9435152641263429 0.077926023088562585 0.32203490693742848
--0.70519707714513458 0.20012814034344362 0.68018071850695239  -0.70493504308661725 0.20029565457621315 0.68040299513329261
--0.69409608332024109 0.32839555720531116 0.64061453708709593  -0.69398384882086983 0.32871571883365153 0.64057192708348365
--0.81129246939324073 0.35362935294171682 0.46556504362316581  -0.81121902067950902 0.35387698305874365 0.46550486715932415
--0.82401873423925942 0.23458495860622128 0.51571602924327076  -0.82387113061171757 0.23530638500725828 0.51562318151862241
--0.68063975088704343 -0.13583622552694097 0.71991530706536411  -0.6804126910192051 -0.13609530337963596 0.72008099426245686
--0.59529852733606148 -0.069740197633308854 0.8004723406749189  -0.5950344796892979 -0.069662907281837216 0.8006753695037262
--0.26817151760031971 -0.68929656115193505 0.67301878720586839  -0.26836446324214952 -0.68937955050281408 0.67285685715261245
--0.19300544019554741 -0.62457262167826677 0.75674166021493716  -0.19358827458119374 -0.62484261256047813 0.75636980999592551
--0.039734588558411582 -0.26026494835742225 0.96471929550963276  -0.039677999129164775 -0.25990051397960157 0.96481986879326076
--0.15985780358782287 -0.19937696972895619 0.96679589706089264  -0.16010344242024352 -0.19913925651268635 0.96680424297825784
-0.81129246939324073 0.35362935294171682 -0.46556504362316581  0.81121902067950868 0.35387698305874399 -0.46550486715932432
-0.82401873423925942 0.23458495860622128 -0.51571602924327076  0.82387113061171757 0.23530638500725828 -0.51562318151862241
-0.68063975088704343 -0.13583622552694097 -0.71991530706536411  0.6804126910192051 -0.13609530337963596 -0.72008099426245686
-0.59529852733606148 -0.069740197633308854 -0.8004723406749189  0.5950344796892979 -0.069662907281837216 -0.8006753695037262
-0.26817151760031971 -0.68929656115193505 -0.67301878720586839  0.26836446324214952 -0.68937955050281408 -0.67285685715261245
-0.19300544019554741 -0.62457262167826677 -0.75674166021493716  0.19358827458119374 -0.62484261256047813 -0.75636980999592551
-0.039734588558411582 -0.26026494835742225 -0.96471929550963276  0.039677999129164823 -0.25990051397960157 -0.96481986879326076
-0.15985780358782287 -0.19937696972895619 -0.96679589706089264  0.16010344242024352 -0.19913925651268635 -0.96680424297825784
-0.30401279487901051 -0.33566720821021828 -0.891573746743482  0.30422052318316722 -0.33550256744406942 -0.89156486051918715
-0.18656099607880564 -0.38998766307204552 -0.90172313788306913  0.18714545413041722 -0.38953622755321954 -0.90179715370027991
--0.25952221836449818 -0.39610117388436322 -0.88076789123048704  -0.25988482570664362 -0.39599581735923617 -0.88070834559541789
--0.27269981374065155 -0.26911716736226504 -0.9236940845413727  -0.27282039415738729 -0.26880216379452299 -0.92375019852295037
--0.81129246939324073 -0.35362935294171682 -0.46556504362316581  -0.81121902067950868 -0.35387698305874399 -0.46550486715932432
--0.82401873423925942 -0.23458495860622128 -0.51571602924327076  -0.82387113061171757 -0.23530638500725828 -0.51562318151862241
--0.68063975088704343 0.13583622552694097 -0.71991530706536411  -0.6804126910192051 0.13609530337963596 -0.72008099426245686
--0.59529852733606148 0.069740197633308854 -0.8004723406749189  -0.59503447968929823 0.069662907281837425 -0.80067536950372598
--0.62340222914316235 -0.13827368218737232 -0.76957783850217643  -0.6232003972770358 -0.13836216352689656 -0.76972539034249154
--0.70871769768752169 -0.067277074024322245 -0.70227702532207659  -0.70820887911908514 -0.067501320615791949 -0.70276863564904002
--0.84103330267207554 0.28407954462258928 -0.46039308870086582  -0.84103034646625296 0.28440717777405616 -0.46019616855581363
--0.76383628095354983 0.37149736972483099 -0.52777252693426735  -0.76364675610270705 0.37176976328896005 -0.52785497534633807
--0.7695778385021762 0.62340222914316235 0.13827368218737232  -0.76972539034249143 0.62320039727703591 0.13836216352689651
--0.70227702532207659 0.70871769768752169 0.067277074024322245  -0.70276863564903969 0.70820887911908559 0.06750132061579224
--0.46039308870086582 0.84103330267207554 -0.28407954462258928  -0.46019616855581363 0.84103034646625296 -0.28440717777405616
--0.52777252693426735 0.76383628095354983 -0.37149736972483099  -0.52785497534633807 0.76364675610270705 -0.37176976328896
--0.68929656115193516 0.6730187872058685 -0.26817151760031976  -0.68937955050281463 0.67285685715261212 -0.26836446324214869
--0.62457262167826677 0.75674166021493716 -0.19300544019554741  -0.62484261256047735 0.75636980999592596 -0.19358827458119518
--0.26026494835742225 0.96471929550963276 -0.039734588558411582  -0.25990051397960157 0.96481986879326076 -0.03967799912916474
--0.19937696972895619 0.96679589706089264 -0.15985780358782287  -0.19913925651268638 0.96680424297825784 -0.1601034424202436
--0.95977938206574664 -0.28075529872380572 0  -0.95982343558557026 -0.28060440841513667 0.00037212726837728354
-0.38998766307204552 0.90172313788306913 0.18656099607880564  0.38953622755323608 0.90179715370027325 0.18714545413041478
-0.39610117388436322 0.88076789123048704 -0.25952221836449818  0.39599581735923617 0.88070834559541789 -0.25988482570664362
-0.26911716736226515 0.92369408454137258 -0.27269981374065166  0.26880216379452399 0.92375019852294971 -0.27282039415738862
-0.19739352602284607 0.97703158208487906 -0.080281277350241251  0.19714040391717316 0.97707738033578018 -0.080345839839677427
-0.32271058904772337 0.94330265629374277 -0.077704403643809677  0.32203490693742853 0.9435152641263429 -0.077926023088562599
-0.68018071850695239 0.70519707714513458 -0.20012814034344362  0.68040299513329272 0.70493504308661736 -0.20029565457621257
-0.64061453708709593 0.69409608332024109 -0.32839555720531116  0.64057192708348365 0.69398384882086983 -0.32871571883365153
-0.69377314187723493 -0.22428489754399594 -0.68341702461536258  0.68956138101050557 -0.23429135260011255 -0.68528290794072344
-0.67087146858540314 -0.2624299701285262 -0.69320320770179855  0.66138007935864784 -0.23687493927937248 -0.71166470600202048
-0.70519707714513458 0.20012814034344362 -0.68018071850695239  0.70493504308661725 0.20029565457621315 -0.68040299513329261
-0.69409608332024109 0.32839555720531116 -0.64061453708709593  0.69398384882086983 0.32871571883365153 -0.64057192708348365
-0.63268818151834738 -0.32335420881895127 -0.70294074606773105  0.62602060935196258 -0.30459772848492761 -0.71785682449108168
-0.59214384399202524 -0.38815954298187871 -0.70538094374692584  0.58682250543787806 -0.37119418317777025 -0.71962089011270336
-0.70519707714513458 -0.20012814034344362 0.68018071850695239  0.70493504308661492 -0.20029565457621035 0.68040299513329583
-0.54306000239317154 -0.46664565776233691 -0.69755165300174249  0.52046695699577006 -0.46800238770905833 -0.71420439075532405
-0.080281277350241251 -0.19739352602284607 0.97703158208487906  0.080345839839677427 -0.19714040391717316 0.97707738033578018
-0.077704403643809677 -0.32271058904772337 0.94330265629374277  0.077926023088562599 -0.32203490693742853 0.9435152641263429
-0.20012814034344362 -0.68018071850695239 0.70519707714513458  0.20029565457621254 -0.68040299513329261 0.70493504308661725
-0.32839555720531116 -0.64061453708709593 0.69409608332024109  0.32871571883365153 -0.64057192708348365 0.69398384882086983
-0.35362935294171682 -0.46556504362316581 0.81129246939324073  0.35387698305874399 -0.46550486715932438 0.81121902067950868
-0.23458495860622128 -0.51571602924327076 0.82401873423925942  0.23530638500725828 -0.51562318151862241 0.82387113061171746
--0.13583622552694097 -0.71991530706536411 0.68063975088704343  -0.13609530337963532 -0.72008099426245686 0.68041269101920521
--0.069740197633308854 -0.8004723406749189 0.59529852733606148  -0.069662907281837216 -0.8006753695037262 0.5950344796892979
--0.68929656115193505 -0.67301878720586839 0.26817151760031971  -0.6893795505028143 -0.67285685715261256 0.26836446324214835
--0.62457262167826677 -0.75674166021493716 0.19300544019554741  -0.62484261256047768 -0.75636980999592551 0.19358827458119562
--0.26026494835742225 -0.96471929550963276 0.039734588558411582  -0.25990051397960157 -0.96481986879326076 0.039677999129164775
--0.19937696972895619 -0.96679589706089264 0.15985780358782287  -0.19913925651268635 -0.96680424297825784 0.16010344242024355
--0.33566720821021828 -0.891573746743482 0.30401279487901051  -0.33550256744406942 -0.89156486051918715 0.30422052318316722
--0.38998766307204552 -0.90172313788306913 0.18656099607880564  -0.38953622755321954 -0.90179715370027991 0.18714545413041722
--0.39610117388436322 -0.88076789123048704 -0.25952221836449818  -0.39599581735923617 -0.88070834559541789 -0.25988482570664362
--0.26911716736226504 -0.9236940845413727 -0.27269981374065155  -0.26880216379452387 -0.92375019852294982 -0.27282039415738868
--0.35362935294171682 -0.46556504362316581 -0.81129246939324073  -0.35387698305874399 -0.46550486715932438 -0.81121902067950868
--0.23458495860622128 -0.51571602924327076 -0.82401873423925942  -0.23530638500725828 -0.51562318151862241 -0.82387113061171746
-0.13583622552694097 -0.71991530706536411 -0.68063975088704343  0.13609530337963532 -0.72008099426245686 -0.68041269101920521
-0.069740197633308854 -0.8004723406749189 -0.59529852733606148  0.069662907281837425 -0.80067536950372598 -0.59503447968929823
--0.13827368218737232 -0.76957783850217643 -0.62340222914316235  -0.13836216352689656 -0.76972539034249154 -0.6232003972770358
--0.067277074024322245 -0.70227702532207659 -0.70871769768752169  -0.067501320615791671 -0.70276863564904035 -0.7082088791190847
-0.28407954462258928 -0.46039308870086582 -0.84103330267207554  0.28440717777405611 -0.46019616855581397 -0.84103034646625274
-0.37149736972483099 -0.52777252693426735 -0.76383628095354983  0.37176976328896 -0.52785497534633807 -0.76364675610270705
-0.62340222914316235 0.13827368218737232 -0.76957783850217643  0.6232003972770358 0.13836216352689656 -0.76972539034249154
-0.70871769768752169 0.067277074024322245 -0.70227702532207659  0.70820887911908514 0.067501320615791949 -0.70276863564904002
-0.9741085412313033 0.22323020415808842 -0  0.97034898997513441 0.24170816629612724 -3.4702813040504568e-18
-0.80588150441467521 -0.045732053728024212 -0.58956860097968999  0.81036094014927451 -0.03066751953522092 -0.58512789193982251
-0.58303192413334481 -0.40257317574481138 -0.70495163176324016  0.56575106816924781 -0.40400744901774382 -0.71882105562061149
-0.87006466098054647 0.056547496445093395 -0.48863305375424759  0.86908209382503243 0.066959188365443956 -0.49011506943384087
-0.50787822903713031 -0.52299793234814496 -0.68413337702600852  0.52838581205514679 -0.49772992706568958 -0.68780328097647692
-0.4546732585899762 -0.60749293870920396 -0.65018159643527595  0.45629539576528333 -0.61497179190323992 -0.64312067838526354
--0.82401873423925942 -0.23458495860622128 0.51571602924327076  -0.82387113061171735 -0.23530638500725787 0.51562318151862285
-0.90172313788306913 0.18656099607880564 0.38998766307204552  0.90179715370027269 0.18714545413041447 0.38953622755323752
-0.46796403496887884 -0.58666916470964625 -0.66003296952840651  0.48378799724665339 -0.58634540105761357 -0.64972936241073365
-0.75366980899531777 -0.12957223153317304 0.64334361719230837  0.75782534074317576 -0.12946239417784181 0.63948435588466934
-0.4331208322019765 -0.64210794890239153 -0.63136143448574877  0.42807141203226518 -0.64268086340022179 -0.6353866334916467
-0.22628605152906522 -0.97313250261608553 -0.01853460685588823  0.22857704379632604 -0.97332233192471607 -0.019904100732393872
-0.88076789123048704 0.25952221836449818 -0.39610117388436322  0.880708345595418 0.25988482570664329 -0.395995817359236
-0.9236940845413727 0.27269981374065155 -0.26911716736226504  0.92375019852294982 0.27282039415738868 -0.26880216379452387
-0.46556504362316581 0.81129246939324073 -0.35362935294171682  0.46550486715932415 0.81121902067950902 -0.35387698305874365
-0.51571602924327076 0.82401873423925942 -0.23458495860622128  0.51562318151862241 0.82387113061171757 -0.23530638500725828
--0.88076789123048704 -0.25952221836449818 0.39610117388436322  -0.880708345595418 -0.25988482570664379 0.39599581735923578
-0.8004723406749189 0.59529852733606148 0.069740197633308854  0.80067536950372697 0.59503447968929701 0.069662907281836411
--0.19739352602284607 -0.97703158208487906 -0.080281277350241251  -0.19714040391717316 -0.97707738033578018 -0.080345839839677427
--0.32271058904772337 -0.94330265629374277 -0.077704403643809677  -0.32203490693742853 -0.9435152641263429 -0.077926023088562599
--0.68018071850695239 -0.70519707714513458 -0.20012814034344362  -0.68040299513329272 -0.70493504308661736 -0.20029565457621257
--0.64061453708709593 -0.69409608332024109 -0.32839555720531116  -0.64057192708348365 -0.69398384882086983 -0.32871571883365153
--0.97703158208487906 -0.080281277350241251 -0.19739352602284607  -0.97707738033578018 -0.080345839839677427 -0.19714040391717316
--0.94330265629374277 -0.077704403643809677 -0.32271058904772337  -0.9435152641263429 -0.077926023088562585 -0.32203490693742848
--0.70519707714513458 -0.20012814034344362 -0.68018071850695239  -0.70493504308661725 -0.20029565457621315 -0.68040299513329261
--0.69409608332024109 -0.32839555720531116 -0.64061453708709593  -0.69398384882086983 -0.32871571883365153 -0.64057192708348365
--0.46556504362316581 -0.81129246939324073 -0.35362935294171682  -0.46550486715932438 -0.81121902067950868 -0.35387698305874399
--0.51571602924327076 -0.82401873423925942 -0.23458495860622128  -0.51562318151862241 -0.82387113061171757 -0.23530638500725828
--0.71991530706536411 -0.68063975088704343 0.13583622552694097  -0.72008099426245686 -0.68041269101920521 0.13609530337963532
--0.8004723406749189 -0.59529852733606148 0.069740197633308854  -0.8006753695037262 -0.5950344796892979 0.069662907281837216
--0.67301878720586839 -0.26817151760031971 0.68929656115193505  -0.67285685715261223 -0.26836446324215069 0.68937955050281374
--0.75674166021493716 -0.19300544019554741 0.62457262167826677  -0.75636980999592607 -0.19358827458119601 0.6248426125604768
--0.96471929550963276 -0.039734588558411582 0.26026494835742225  -0.96481986879326076 -0.039677999129164823 0.25990051397960157
--0.96679589706089264 -0.15985780358782287 0.19937696972895619  -0.96680424297825784 -0.1601034424202436 0.19913925651268638
--0.76957783850217643 -0.62340222914316235 -0.13827368218737232  -0.76972539034249154 -0.6232003972770358 -0.13836216352689656
--0.70227702532207659 -0.70871769768752169 -0.067277074024322245  -0.70276863564903969 -0.70820887911908559 -0.06750132061579224
--0.46039308870086582 -0.84103330267207554 0.28407954462258928  -0.46019616855581397 -0.84103034646625274 0.28440717777405611
--0.52777252693426735 -0.76383628095354983 0.37149736972483099  -0.52785497534633807 -0.76364675610270705 0.37176976328896
-0.13827368218737232 -0.76957783850217643 0.62340222914316235  0.13836216352689656 -0.76972539034249154 0.6232003972770358
-0.067277074024322245 -0.70227702532207659 0.70871769768752169  0.067501320615791671 -0.70276863564904035 0.7082088791190847
--0.28407954462258928 -0.46039308870086582 0.84103330267207554  -0.28440717777405611 -0.46019616855581397 0.84103034646625274
--0.37149736972483099 -0.52777252693426735 0.76383628095354983  -0.37176976328896 -0.52785497534633807 0.76364675610270705
--0.67301878720586839 0.26817151760031971 -0.68929656115193505  -0.67285685715261223 0.26836446324215069 -0.68937955050281374
--0.75674166021493716 0.19300544019554741 -0.62457262167826677  -0.75636980999592607 0.19358827458119601 -0.6248426125604768
--0.96471929550963276 0.039734588558411582 -0.26026494835742225  -0.96481986879326076 0.03967799912916474 -0.25990051397960157
--0.96679589706089264 0.15985780358782287 -0.19937696972895619  -0.96680424297825784 0.1601034424202436 -0.19913925651268638
--0.891573746743482 -0.30401279487901051 0.33566720821021828  -0.89156486051918693 -0.30422052318316706 0.33550256744407037
--0.90172313788306913 -0.18656099607880564 0.38998766307204552  -0.90179715370027991 -0.18714545413041722 0.38953622755321954
--0.88076789123048704 0.25952221836449818 0.39610117388436322  -0.880708345595418 0.25988482570664329 0.395995817359236
--0.92369408454137258 0.27269981374065166 0.26911716736226515  -0.92375019852294971 0.27282039415738862 0.26880216379452399
--0.82440895259656954 -0.11626913535565189 0.55392361119767786  -0.823895301648223 -0.11760246779863359 0.55440616112165897
--0.8189102873387164 0 0.57392154628557113  -0.81788534298629756 -0.00078604920685430759 0.57538069819453519
--0.80047234067491879 -0.59529852733606159 -0.069740197633308854  -0.8006753695037262 -0.59503447968929801 -0.069662907281838451
--0.78076816785433134 -0.58942568680894825 -0.20731239180326447  -0.78085960551688738 -0.58928970592655827 -0.20735457304096649
-0.068715700526218768 0.9453832490724946 0.3186356302649232  0.068382200701545173 0.94544807568691736 0.31851500876272482
-0.13899360672691591 0.89342795031552769 0.42716188369754926  0.22370787894634703 0.9211836066081267 0.31839526977291976
--0.86640575634619166 -0.4993406306021807 0  -0.86652958223713705 -0.49912569350341029 0.00015872199696746758
--0.9168554803037775 -0.39313153246640248 0.069452331980627613  -0.91670068154564333 -0.3935012441801673 0.069401954456725035
--0.58427898032160919 0.62674761880757135 0.51556327979539029  -0.5844947940189088 0.62647295099493483 0.51565247738810616
--0.46626606661797826 0.69116244652106429 0.55216883979414844  -0.4664730029139274 0.69097715483087396 0.5522259583307304
--0.26817151760031971 0.68929656115193505 0.6730187872058685  -0.2683644632421513 0.68937955050281263 0.67285685715261312
--0.33994835690442576 0.74334549596053445 0.57608383788574413  -0.34013694034011649 0.74324570666303791 0.57610127698437341
--0.42981996927710414 0 0.90291461058653233  -0.42961984965260047 -0.00028436728304534936 0.9030098027816339
--0.42716188369754932 0.13899360672691585 0.89342795031552757  -0.42704736713517844 0.1387511965001427 0.89352037004910567
--0.30401279487901056 0.33566720821021839 0.891573746743482  -0.30422052318316667 0.3355025674440707 0.89156486051918682
--0.41838703947458189 0.27466844612618385 0.86574218443040085  -0.41835586417422255 0.27447137325094917 0.86581974808661977
-0.31863563026492325 -0.068715700526218768 0.9453832490724946  0.31897512469198191 -0.068666567984591254 0.94527232704070629
-0.20226550379446337 0 0.97933072349169759  0.20254321521823354 2.0838667697410136e-17 0.97927332546590906
-0.080281277350241265 0.19739352602284616 0.97703158208487906  0.080345839839677552 0.19714040391717327 0.97707738033578018
-0.081370946056690249 0.066381045638217229 0.9944708773603258  0.081578796887611757 0.066331699036312544 0.99445714115859518
--0.31863563026492325 -0.068715700526218768 -0.9453832490724946  -0.31897512469198191 -0.068666567984591254 -0.94527232704070629
--0.20226550379446337 0 -0.97933072349169759  -0.20254321521823354 2.0838667697410136e-17 -0.97927332546590906
--0.080281277350241265 0.19739352602284616 -0.97703158208487906  -0.080345839839677552 0.19714040391717327 -0.97707738033578018
--0.081370946056690249 0.066381045638217229 -0.9944708773603258  -0.081578796887611757 0.066331699036312544 -0.99445714115859518
--0.62674761880757135 0.51556327979539029 -0.58427898032160919  -0.62647295099493472 0.51565247738810682 -0.58449479401890847
--0.55216883979414833 0.46626606661797837 -0.69116244652106429  -0.55222595833073074 0.46647300291392696 -0.69097715483087396
--0.35362935294171677 0.46556504362316592 -0.81129246939324073  -0.35387698305874388 0.46550486715932382 -0.81121902067950891
--0.46867704983435055 0.40632940254264294 -0.78437123837371081  -0.46877433341209007 0.40646863937642824 -0.78424095119900861
--0.068715700526218768 0.9453832490724946 -0.3186356302649232  -0.068382200701545062 0.94544807568691724 -0.31851500876272504
--0.13899360672691591 0.89342795031552769 -0.42716188369754926  -0.13875119650014353 0.89352037004910556 -0.4270473671351786
--0.13827368218737227 0.76957783850217643 -0.62340222914316235  -0.13836216352689656 0.76972539034249154 -0.62320039727703591
--0.20828740048796671 0.8247164420172246 -0.52579382752597525  -0.20813967421463545 0.82482450355065018 -0.52568280774650522
-0.58427898032160919 0.62674761880757146 -0.51556327979539029  0.58449479401890791 0.62647295099493572 -0.51565247738810627
-0.46626606661797826 0.69116244652106429 -0.55216883979414844  0.4664730029139274 0.69097715483087396 -0.5522259583307304
-0.26817151760031971 0.68929656115193505 -0.6730187872058685  0.2683644632421513 0.68937955050281263 -0.67285685715261312
-0.33994835690442576 0.74334549596053445 -0.57608383788574413  0.34013694034011649 0.74324570666303791 -0.57610127698437341
-0.42981996927710414 0 -0.90291461058653233  0.42961984965260047 -0.00028436728304534936 -0.9030098027816339
-0.42716188369754932 0.13899360672691585 -0.89342795031552757  0.42704736713517844 0.1387511965001427 -0.89352037004910567
-0.30401279487901056 0.33566720821021839 -0.891573746743482  0.30422052318316667 0.3355025674440707 -0.89156486051918682
-0.41838703947458189 0.27466844612618385 -0.86574218443040085  0.41835586417422255 0.27447137325094917 -0.86581974808661977
-0 -0.90291461058653233 0.42981996927710414  -0.00028436728304534936 -0.9030098027816339 0.42961984965260047
-0.13899360672691585 -0.89342795031552757 0.42716188369754932  0.1387511965001427 -0.89352037004910567 0.42704736713517844
-0.40151480227572495 -0.69274920908571347 -0.59888293763788791  0.39881277493422806 -0.66927944610495271 -0.62690780308647331
-0.27466844612618385 -0.86574218443040085 0.41838703947458189  0.274471373250952 -0.86581974808661777 0.4183558641742246
--0.068715700526218768 -0.9453832490724946 -0.31863563026492325  -0.068382200701545368 -0.94544807568691724 -0.31851500876272509
-0 -0.97933072349169759 -0.20226550379446337  2.7784890263213511e-17 -0.97927332546590873 -0.20254321521823496
-0.19739352602284616 -0.97703158208487906 -0.080281277350241265  0.19714040391716284 -0.97707738033578373 -0.080345839839658581
-0.066381045638217229 -0.9944708773603258 -0.081370946056690249  0.066331699036312544 -0.99445714115859507 -0.081578796887611743
-0.95069104161024875 0.185674705522129 0.24579255546759909  0.95608513245170423 0.17856129650966351 0.23241575440058895
-0.66689476317101137 -0.26866388572512034 -0.69462568959831961  0.64422625268359979 -0.27076651461112894 -0.71530275402698396
-0.62443505191569915 -0.33636614204180315 -0.70422028778974766  0.60701252203428802 -0.33806887798060248 -0.71919763058182384
-0.29401138453262832 -0.86471241548978517 0.4056780940788991  0.30717055145208833 -0.86468532536853859 0.39744878967349306
-0.5493198212532957 -0.45674068614295493 -0.69911600851089584  0.5435262718016699 -0.43623030388675949 -0.71713479474380737
-0.21254447256850684 0.89390471712616404 0.39369586600014284  0.23042761042598114 0.87734110809753774 0.42092243512974803
-0.90387507728811034 0.34253810440658677 0.25355721782048279  0.90894237800239264 0.3488969399841263 0.22824258748329265
-0.89844705357522048 0.37311241287933194 0.22843691950085848  0.90894237800239619 0.34889693998411053 0.22824258748330289
-0.87149140923129176 0.45766135056489032 0.17031256632806041  0.87265298324518492 0.4603681578214775 0.16290466567087158
-0.75815048575026589 0.64339140453754129 0.098424941615366732  0.7480416949938824 0.65387638494523026 0.1134869849878684
-0.6771336059462687 0.72858929180595311 0.094046635219543206  0.67452766723137314 0.73279395097326827 0.089584884642384455
-0.66096525556418162 0.74328545761836973 0.095572989323982643  0.67452766723138358 0.73279395097325961 0.089584884642376475
--0.62457262167826666 -0.75674166021493738 -0.19300544019554747  -0.62484261256047768 -0.75636980999592551 -0.19358827458119579
--0.719915307065364 -0.68063975088704354 -0.135836225526941  -0.72008099426245631 -0.68041269101920543 -0.13609530337963674
--0.55392361119767786 -0.82440895259656954 -0.11626913535565189  -0.55402560894563302 -0.82413049582749986 -0.11774782579538202
--0.48516082808530336 -0.87376742805233321 -0.033903577486650911  -0.48348770334523589 -0.87467833713118348 -0.034313951497558594
--0.42981996927710414 0 -0.90291461058653233  -0.42961984965260003 0.00028436728304541534 -0.90300980278163412
--0.42716188369754932 -0.13899360672691585 -0.89342795031552757  -0.42704736713517844 -0.13875119650014309 -0.89352037004910567
--0.30401279487901056 -0.33566720821021839 -0.891573746743482  -0.30422052318316667 -0.3355025674440707 -0.89156486051918682
--0.41838703947458189 -0.27466844612618385 -0.86574218443040085  -0.41835586417422255 -0.27447137325094917 -0.86581974808661977
--0.9453832490724946 0.31863563026492325 0.068715700526218768  -0.94544807568691736 0.31851500876272509 0.068382200701545048
--0.97933072349169759 0.20226550379446331 0  -0.97927332546590884 0.20254321521823487 0
--0.97703158208487906 0.080281277350241265 -0.19739352602284616  -0.97707738033578007 0.080345839839677496 -0.1971404039171733
--0.9944708773603258 0.081370946056690249 -0.066381045638217229  -0.99445714115859507 0.081578796887611701 -0.066331699036312544
--0.3186356302649232 -0.068715700526218768 0.9453832490724946  -0.31851500876272504 -0.068382200701545631 0.94544807568691724
--0.42716188369754926 -0.13899360672691591 0.89342795031552769  -0.42704736713517871 -0.13875119650014189 0.89352037004910567
--0.62340222914316235 -0.13827368218737227 0.76957783850217643  -0.62320039727703669 -0.13836216352689706 0.76972539034249077
--0.52579382752597525 -0.20828740048796671 0.8247164420172246  -0.52568280774650511 -0.20813967421463669 0.82482450355064985
--0.62674761880757135 0.51556327979539029 0.58427898032160919  -0.62647295099493483 0.51565247738810616 0.5844947940189088
--0.69116244652106418 0.55216883979414833 0.46626606661797837  -0.6909771548308743 0.55222595833073052 0.46647300291392674
--0.68929656115193505 0.6730187872058685 0.26817151760031971  -0.68937955050281263 0.67285685715261312 0.2683644632421513
--0.74334549596053445 0.57608383788574413 0.33994835690442576  -0.74324570666303813 0.57610127698437352 0.34013694034011532
--0.31863563026492325 0.068715700526218768 0.9453832490724946  -0.31897512469198169 0.068666567984591392 0.94527232704070641
--0.20226550379446331 0 0.97933072349169759  -0.20254321521823346 0 0.97927332546590906
--0.080281277350241265 -0.19739352602284616 0.97703158208487906  -0.080345839839677552 -0.19714040391717327 0.97707738033578018
--0.081370946056690249 -0.066381045638217229 0.9944708773603258  -0.081578796887611757 -0.066331699036312544 0.99445714115859518
-0.31222404809805682 0.2811508450273621 0.90641151615731874  0.30687826798314805 0.2927056677356295 0.90562084821138178
-0.29107512591583118 0.30186484921791523 0.90688305806336111  0.30687826798317108 0.29270566773561474 0.90562084821137867
-0.25988381527545967 0.33544566672286746 0.9046373499048469  0.26377483182397715 0.35458300388088293 0.89704722922209745
-0.57608383788574413 -0.33994835690442576 0.74334549596053445  0.57610127698437374 -0.34013694034011549 0.74324570666303802
-0.3186356302649232 0.068715700526218768 0.9453832490724946  0.31897512469198191 0.068666567984591337 0.94527232704070629
-0.42716188369754932 0.13899360672691591 0.89342795031552757  0.31839526977291882 0.22370787894634658 0.92118360660812726
--0.76383628095354983 -0.37149736972483099 -0.52777252693426735  -0.76364675610270738 -0.37176976328896 -0.52785497534633763
--0.82178222598517658 -0.40100492526839776 -0.40480738995889742  -0.82172156155091924 -0.40115992505182002 -0.404776963048463
-0.9453832490724946 0.3186356302649232 0.068715700526218768  0.94544807568691724 0.31851500876272504 0.06838220070154534
-0.89342795031552757 0.42716188369754932 0.13899360672691591  0.89352037004910545 0.42704736713517855 0.13875119650014364
--0.67170915887432037 -0.45126666560725853 -0.58750761901107262  -0.67165289641182357 -0.45152335920120762 -0.58737470394737412
--0.56664784959934433 -0.52372394783737519 -0.63610018157997195  -0.56692430597377874 -0.5234294246654746 -0.6360962731305061
--0.90172313788306901 -0.18656099607880575 -0.38998766307204569  -0.9017971537002798 -0.18714545413041742 -0.38953622755321987
--0.84103330267207554 -0.28407954462258922 -0.46039308870086582  -0.84103034646625274 -0.28440717777405622 -0.46019616855581386
--0.8962672300889245 -0.071858277492354974 -0.43765447584202588  -0.89681281808791957 -0.072536964263670914 -0.43642314114700098
--0.87376742805233321 0.033903577486650911 -0.48516082808530336  -0.87467833713118348 0.034313951497558608 -0.48348770334523583
-0.068715700526218768 0.9453832490724946 -0.31863563026492325  0.068666567984591129 0.94527232704070629 -0.31897512469198203
-0 0.97933072349169759 -0.20226550379446331  0 0.97927332546590884 -0.20254321521823487
--0.19739352602284616 0.97703158208487906 -0.080281277350241265  -0.1971404039171733 0.97707738033578007 -0.080345839839677496
--0.066381045638217229 0.9944708773603258 -0.081370946056690249  -0.066331699036312544 0.99445714115859507 -0.081578796887611701
-0 0.90291461058653233 0.4298199692771042  0.00028436728304585471 0.90300980278163401 0.42961984965260025
--0.13899360672691585 0.89342795031552757 0.42716188369754932  -0.13875119650014286 0.89352037004910567 0.42704736713517849
--0.33566720821021839 0.891573746743482 0.30401279487901056  -0.33550256744406903 0.89156486051918726 0.30422052318316689
--0.27466844612618391 0.86574218443040074 0.41838703947458195  -0.274471373250949 0.86581974808661977 0.41835586417422232
--0.90291461058653233 0.42981996927710414 0  -0.90300980278163412 0.42961984965259997 -0.00028436728304565326
--0.89342795031552757 0.42716188369754932 0.13899360672691585  -0.89352037004910645 0.42704736713517727 0.13875119650014212
--0.891573746743482 0.30401279487901056 0.33566720821021839  -0.89156486051918737 0.30422052318316695 0.33550256744406909
--0.86574218443040074 0.41838703947458195 0.27466844612618391  -0.86581974808662021 0.4183558641742216 0.27447137325094856
--0.51556327979539029 0.58427898032160919 0.62674761880757135  -0.51565247738810616 0.5844947940189088 0.62647295099493483
--0.55216883979414844 0.46626606661797843 0.69116244652106429  -0.55222595833073018 0.46647300291392751 0.69097715483087396
--0.6730187872058685 0.26817151760031971 0.68929656115193505  -0.67285685715261312 0.2683644632421513 0.68937955050281263
--0.57608383788574413 0.33994835690442576 0.74334549596053445  -0.57610127698437363 0.34013694034011532 0.74324570666303824
--0.62674761880757146 -0.51556327979539029 0.58427898032160919  -0.62675731827798087 -0.51582822603431722 0.58403467808965182
--0.55216883979414844 -0.46626606661797826 0.6911624465210644  -0.55222595833073085 -0.46647300291392696 0.69097715483087385
--0.35362935294171677 -0.46556504362316592 0.81129246939324073  -0.35387698305874388 -0.46550486715932382 0.81121902067950891
--0.46867704983435055 -0.40632940254264294 0.78437123837371081  -0.46877433341209007 -0.40646863937642824 0.78424095119900861
-0.51556327979539029 0.58427898032160919 -0.62674761880757135  0.51565247738810593 0.58449479401890858 -0.62647295099493516
-0.55216883979414844 0.46626606661797843 -0.69116244652106429  0.55222595833073018 0.46647300291392751 -0.69097715483087396
-0.6730187872058685 0.26817151760031971 -0.68929656115193505  0.67285685715261312 0.2683644632421513 -0.68937955050281263
-0.57608383788574413 0.33994835690442576 -0.74334549596053445  0.57610127698437363 0.34013694034011532 -0.74324570666303824
-0.51873480041451092 0.13843733448120876 0.84282425105969128  0.53130823737479249 0.11550620576389506 0.83926746233112115
-0.5512195414246408 0.12458499692215487 0.82416586116838453  0.53130823737479238 0.11550620576389389 0.83926746233112148
-0.35362935294171677 -0.46556504362316592 -0.81129246939324073  0.35387698305874388 -0.46550486715932382 -0.81121902067950891
-0.46867704983435055 -0.40632940254264294 -0.78437123837371081  0.46877433341209007 -0.40646863937642824 -0.78424095119900861
-0.31863563026492325 0.068715700526218768 -0.9453832490724946  0.31897512469198169 0.068666567984591392 -0.94527232704070641
-0.20226550379446331 0 -0.97933072349169759  0.20254321521823346 0 -0.97927332546590906
-0.080281277350241265 -0.19739352602284616 -0.97703158208487906  0.080345839839677552 -0.19714040391717327 -0.97707738033578018
-0.081370946056690249 -0.066381045638217229 -0.9944708773603258  0.081578796887611757 -0.066331699036312544 -0.99445714115859518
--0.51556327979539029 -0.58427898032160919 -0.62674761880757135  -0.51565247738810593 -0.58449479401890858 -0.62647295099493516
--0.55216883979414844 -0.46626606661797843 -0.69116244652106429  -0.55222595833073018 -0.46647300291392751 -0.69097715483087396
--0.6730187872058685 -0.26817151760031971 -0.68929656115193505  -0.67285685715261312 -0.2683644632421513 -0.68937955050281263
--0.57608383788574413 -0.33994835690442576 -0.74334549596053445  -0.57610127698437363 -0.34013694034011532 -0.74324570666303824
--0.3186356302649232 0.068715700526218768 -0.9453832490724946  -0.31897512469198191 0.068666567984591337 -0.94527232704070629
--0.42716188369754932 0.13899360672691591 -0.89342795031552757  -0.42704736713517866 0.13875119650014203 -0.89352037004910567
--0.62340222914316235 0.13827368218737227 -0.76957783850217643  -0.62320039727703669 0.13836216352689706 -0.76972539034249077
--0.52579382752597525 0.20828740048796671 -0.8247164420172246  -0.52568280774650511 0.20813967421463669 -0.82482450355064985
--0.9453832490724946 0.3186356302649232 -0.068715700526218768  -0.94544807568691724 0.31851500876272504 -0.068382200701545062
--0.89342795031552769 0.42716188369754926 -0.13899360672691591  -0.89352037004910556 0.4270473671351786 -0.13875119650014353
--0.76957783850217643 0.62340222914316235 -0.13827368218737227  -0.76972539034249154 0.62320039727703591 -0.13836216352689656
--0.8247164420172246 0.52579382752597525 -0.20828740048796671  -0.82482450355065018 0.52568280774650522 -0.20813967421463545
--0.51556327979539029 0.58427898032160919 -0.62674761880757146  -0.51582822603431722 0.58403467808965182 -0.62675731827798087
--0.46626606661797826 0.6911624465210644 -0.55216883979414844  -0.4664730029139269 0.69097715483087385 -0.55222595833073085
--0.46556504362316592 0.81129246939324073 -0.35362935294171677  -0.46550486715932382 0.81121902067950891 -0.35387698305874388
--0.40632940254264294 0.78437123837371081 -0.46867704983435055  -0.40646863937642774 0.78424095119900938 -0.46877433341208924
--0.068715700526218768 0.9453832490724946 0.31863563026492325  -0.068382200701545173 0.94544807568691736 0.31851500876272476
-0 0.97933072349169759 0.20226550379446331  0 0.97927332546590884 0.20254321521823487
-0.19739352602284616 0.97703158208487906 0.080281277350241265  0.1971404039171733 0.97707738033578007 0.080345839839677496
-0.066381045638217229 0.9944708773603258 0.081370946056690249  0.066331699036312544 0.99445714115859507 0.081578796887611701
-0 0.90291461058653233 -0.42981996927710414  -0.00028436728304565326 0.90300980278163412 -0.42961984965259997
-0.13899360672691585 0.89342795031552757 -0.42716188369754932  0.13875119650014286 0.89352037004910567 -0.42704736713517849
-0.33566720821021839 0.891573746743482 -0.30401279487901056  0.33550256744406903 0.89156486051918726 -0.30422052318316689
-0.27466844612618391 0.86574218443040074 -0.41838703947458195  0.274471373250949 0.86581974808661977 -0.41835586417422232
-0.90291461058653233 0.42981996927710414 0  0.90300980278163412 0.42961984965260003 0.00028436728304541534
-0.89342795031552757 0.42716188369754932 -0.13899360672691585  0.89352037004910645 0.42704736713517727 -0.13875119650014231
-0.891573746743482 0.30401279487901056 -0.33566720821021839  0.89156486051918737 0.30422052318316695 -0.33550256744406909
-0.86574218443040085 0.41838703947458189 -0.27466844612618385  0.86581974808662054 0.41835586417422127 -0.27447137325094839
-0.15594877494016779 0.48342144068564119 0.86055952199012919  0.13902973540248587 0.4816564885202882 0.86526167125339615
-0.14688267020077073 0.50017470245974227 0.85269038907862316  0.13902973540250271 0.48165648852027348 0.8652616712534017
-0.098424941615366676 0.758150485750266 0.64339140453754151  0.11348698498784857 0.74804169499390571 0.65387638494520695
-0.14854713354961635 0.85435218642293975 0.49724573572225772  0.18463389628076735 0.84903903628469102 0.49501822108781618
-0.42981996927710414 0 0.90291461058653233  0.42961984965260003 0.00028436728304541534 0.90300980278163412
-0.42716188369754932 -0.13899360672691585 0.89342795031552757  0.42704736713517844 -0.13875119650014309 0.89352037004910567
-0.30401279487901056 -0.33566720821021839 0.891573746743482  0.30422052318316667 -0.3355025674440707 0.89156486051918682
-0.41838703947458189 -0.27466844612618385 0.86574218443040085  0.41835586417422255 -0.27447137325094917 0.86581974808661977
-0.66704995977036097 0.095052466200525487 0.73781627941851213  0.68096837004796118 0.091975091050968211 0.72651404777911166
-0.69602657944578872 0.09312926541647408 0.71089969747156689  0.68096837004796906 0.091975091050976843 0.72651404777910311
-0.26817151760031971 -0.68929656115193505 0.6730187872058685  0.2683644632421513 -0.68937955050281263 0.67285685715261312
-0.33994835690442576 -0.74334549596053445 0.57608383788574413  0.34013694034011793 -0.74324570666303691 0.57610127698437374
--0.51556327979539029 -0.58427898032160919 0.62674761880757146  -0.51565247738810605 -0.58449479401890814 0.62647295099493561
--0.46626606661797837 -0.69116244652106429 0.55216883979414833  -0.46647300291392657 -0.69097715483087407 0.55222595833073074
--0.46556504362316592 -0.81129246939324073 0.35362935294171677  -0.46550486715932382 -0.81121902067950891 0.35387698305874388
--0.40632940254264294 -0.78437123837371081 0.46867704983435055  -0.40646863937642774 -0.78424095119900938 0.46877433341208924
-0.068715700526218768 -0.9453832490724946 0.31863563026492325  0.068666567984591392 -0.94527232704070641 0.31897512469198169
-0 -0.97933072349169759 0.20226550379446331  0 -0.97927332546590884 0.20254321521823487
--0.19739352602284616 -0.97703158208487906 0.080281277350241265  -0.19714040391717327 -0.97707738033578007 0.080345839839677538
--0.066381045638217229 -0.9944708773603258 0.081370946056690249  -0.066331699036312544 -0.99445714115859507 0.081578796887611743
--0.58427898032160919 -0.62674761880757146 -0.51556327979539029  -0.58449479401890791 -0.62647295099493572 -0.51565247738810627
--0.46626606661797826 -0.69116244652106429 -0.55216883979414844  -0.4664730029139274 -0.69097715483087396 -0.5522259583307304
--0.26817151760031971 -0.68929656115193505 -0.6730187872058685  -0.2683644632421513 -0.68937955050281263 -0.67285685715261312
--0.33994835690442576 -0.74334549596053445 -0.57608383788574413  -0.34013694034011527 -0.74324570666303813 -0.57610127698437352
-0.068715700526218768 -0.9453832490724946 -0.3186356302649232  0.068666567984591337 -0.94527232704070629 -0.31897512469198191
-0.13899360672691591 -0.89342795031552757 -0.42716188369754932  0.13875119650014367 -0.89352037004910556 -0.4270473671351786
-0.13827368218737227 -0.76957783850217643 -0.62340222914316235  0.13836216352689706 -0.76972539034249077 -0.62320039727703669
-0.20828740048796671 -0.8247164420172246 -0.52579382752597525  0.20813967421463669 -0.82482450355064985 -0.52568280774650511
-0.3186356302649232 -0.068715700526218768 -0.9453832490724946  0.31851500876272504 -0.068382200701545631 -0.94544807568691724
-0.42716188369754926 -0.13899360672691591 -0.89342795031552769  0.42704736713517871 -0.13875119650014189 -0.89352037004910567
-0.62340222914316235 -0.13827368218737227 -0.76957783850217643  0.62320039727703669 -0.13836216352689706 -0.76972539034249077
-0.52579382752597525 -0.20828740048796671 -0.8247164420172246  0.52568280774650511 -0.20813967421463669 -0.82482450355064985
-0.88304523202927676 0.18950565604187922 0.42721864490060907  0.88441806965928871 0.18329374350459135 0.4291946896831445
-0.87684117534766193 0.17811496227257195 0.44486756488630008  0.8844180696592876 0.18329374350459152 0.42919468968314661
-0.90105806124803878 0.23967742655656488 0.35918321758479488  0.89982453013548236 0.22723563663234575 0.37239734211021303
-0.89436470058605533 0.21570896554595267 0.38998187620182156  0.89982453013547437 0.22723563663234558 0.37239734211023262
-0.9453832490724946 0.31863563026492325 -0.068715700526218768  0.94544807568691724 0.31851500876272509 -0.068382200701545368
-0.34253810440658672 0.25355721782048268 0.90387507728811034  0.34889693998411497 0.22824258748330126 0.90894237800239497
-0.37311241287933189 0.22843691950085854 0.8984470535752207  0.3488969399841278 0.22824258748331513 0.90894237800238653
-0.89390471712616404 0.39369586600014284 0.21254447256850695  0.87734110809754062 0.42092243512973737 0.23042761042598958
-0.87689701064830428 0.44478929974988757 0.17773204761375266  0.88583486239282283 0.42585755017736876 0.1842333941673405
-0.88125255845135109 0.43210633013751554 0.18610643753537598  0.88583486239282105 0.42585755017737281 0.18423339416733958
-0.30186484921791523 0.90688305806336122 0.29107512591583129  0.29270566773562828 0.90562084821138356 0.30687826798314405
-0.2811508450273621 0.90641151615731863 0.31222404809805682  0.29270566773562823 0.90562084821138122 0.3068782679831506
-0.62674761880757135 0.51556327979539029 -0.58427898032160919  0.62647295099493561 0.51565247738810638 -0.5844947940189078
-0.69116244652106418 0.55216883979414833 -0.46626606661797837  0.6909771548308743 0.55222595833073052 -0.46647300291392674
-0.68929656115193505 0.6730187872058685 -0.26817151760031971  0.68937955050281263 0.67285685715261312 -0.2683644632421513
-0.74334549596053445 0.57608383788574413 -0.33994835690442576  0.7432457066630378 0.57610127698437341 -0.34013694034011649
-0 -0.90291461058653233 -0.42981996927710414  0.00028436728304541534 -0.90300980278163412 -0.42961984965260003
--0.13899360672691585 -0.89342795031552757 -0.42716188369754932  -0.13875119650014309 -0.89352037004910567 -0.42704736713517844
--0.33566720821021839 -0.891573746743482 -0.30401279487901056  -0.33550256744406903 -0.89156486051918726 -0.30422052318316689
--0.27466844612618385 -0.86574218443040085 -0.41838703947458189  -0.27447137325094839 -0.86581974808662054 -0.41835586417422127
--0.90291461058653233 -0.4298199692771042 0  -0.9030098027816339 -0.42961984965260047 -0.00028436728304622979
--0.89342795031552757 -0.42716188369754932 -0.13899360672691585  -0.89352037004910645 -0.42704736713517727 -0.13875119650014195
--0.891573746743482 -0.30401279487901056 -0.33566720821021839  -0.89156486051918737 -0.30422052318316695 -0.33550256744406909
--0.86574218443040085 -0.41838703947458189 -0.27466844612618385  -0.86581974808662054 -0.41835586417422127 -0.27447137325094839
--0.62674761880757135 -0.51556327979539029 -0.58427898032160919  -0.62647295099493561 -0.51565247738810638 -0.5844947940189078
--0.69116244652106418 -0.55216883979414833 -0.46626606661797837  -0.6909771548308743 -0.55222595833073052 -0.46647300291392674
--0.68929656115193505 -0.6730187872058685 -0.26817151760031971  -0.68937955050281263 -0.67285685715261312 -0.2683644632421513
--0.74334549596053445 -0.57608383788574413 -0.33994835690442576  -0.7432457066630378 -0.57610127698437341 -0.34013694034011649
--0.58427898032160919 -0.62674761880757135 0.51556327979539029  -0.58449479401890803 -0.62647295099493561 0.51565247738810616
--0.69116244652106429 -0.55216883979414833 0.46626606661797837  -0.69097715483087396 -0.55222595833073074 0.46647300291392696
--0.81129246939324073 -0.35362935294171677 0.46556504362316592  -0.81121902067950891 -0.35387698305874388 0.46550486715932382
--0.78437123837371081 -0.46867704983435055 0.40632940254264294  -0.78424095119900861 -0.46877433341209007 0.40646863937642824
--0.9453832490724946 -0.3186356302649232 0.068715700526218768  -0.94544807568691736 -0.31851500876272482 0.068382200701545479
--0.89342795031552769 -0.42716188369754926 0.13899360672691591  -0.89352037004910556 -0.4270473671351786 0.13875119650014353
--0.76957783850217643 -0.62340222914316235 0.13827368218737227  -0.76972539034249077 -0.62320039727703669 0.13836216352689706
--0.8247164420172246 -0.52579382752597525 0.20828740048796671  -0.82482450355064985 -0.52568280774650511 0.20813967421463669
--0.068715700526218768 -0.9453832490724946 0.3186356302649232  -0.068382200701545631 -0.94544807568691724 0.31851500876272504
--0.13899360672691591 -0.89342795031552769 0.42716188369754926  -0.13875119650014353 -0.89352037004910556 0.4270473671351786
--0.13827368218737227 -0.76957783850217643 0.62340222914316235  -0.13836216352689706 -0.76972539034249077 0.62320039727703669
--0.20828740048796671 -0.8247164420172246 0.52579382752597525  -0.20813967421463669 -0.82482450355064985 0.52568280774650511
--0.58427898032160919 0.62674761880757146 -0.51556327979539029  -0.58449479401890814 0.62647295099493561 -0.51565247738810605
--0.69116244652106429 0.55216883979414833 -0.46626606661797837  -0.69097715483087407 0.55222595833073074 -0.46647300291392657
--0.81129246939324073 0.35362935294171677 -0.46556504362316592  -0.81121902067950891 0.35387698305874388 -0.46550486715932382
--0.78437123837371081 0.46867704983435055 -0.40632940254264294  -0.78424095119900861 0.46877433341209007 -0.40646863937642824
--0.9453832490724946 -0.31863563026492325 -0.068715700526218768  -0.94527232704070596 -0.31897512469198297 -0.068666567984592197
--0.97933072349169759 -0.20226550379446331 0  -0.97927332546590884 -0.20254321521823487 0
--0.97703158208487906 -0.080281277350241265 0.19739352602284616  -0.97707738033578007 -0.080345839839677496 0.1971404039171733
--0.9944708773603258 -0.081370946056690249 0.066381045638217229  -0.99445714115859507 -0.081578796887611701 0.066331699036312544
-0 0.57392154628557113 0.8189102873387164  -0.00078604920685557318 0.5753806981945353 0.81788534298629756
-0.11626913535565189 0.55392361119767786 0.82440895259656954  0.065815526689251905 0.70990039054589715 0.70122018792202434
--0.52777252693426735 -0.76383628095354983 -0.37149736972483099  -0.52785497534633763 -0.76364675610270738 -0.37176976328896
--0.40480738995889742 -0.82178222598517658 -0.40100492526839776  -0.40477696304846211 -0.82172156155092035 -0.4011599250518188
-0.28075529872380572 0 0.95977938206574664  0.28060440841513695 0.0003721272683771568 0.95982343558557015
-0.27889813733511903 0.13624095340381404 0.9506072962094394  0.27889806070390522 0.13594944033505713 0.95064905270461686
--0.58750761901107262 -0.67170915887432037 -0.45126666560725853  -0.58737470394737434 -0.67165289641182369 -0.45152335920120712
-0.2726998137406515 0.26911716736226499 0.9236940845413727  0.27282039415738785 0.26880216379452343 0.92375019852295015
--0.054857140713616914 0.54001796879892028 0.83986385056568236  -0.05679299414488595 0.53979489236345513 0.83987858050695929
-0 0.62578188869003271 0.77999809473327264  -0.00023519417927787435 0.6269431253853307 0.77906499229253756
--0.63610018157997184 -0.56664784959934433 -0.52372394783737508  -0.63632626043050544 -0.56632219140540152 -0.52380155193385247
-0.067277074024322203 0.70227702532207648 0.70871769768752158  0.067501320615792407 0.70276863564904002 0.70820887911908503
--0.38998766307204569 -0.90172313788306901 -0.18656099607880575  -0.38953622755321987 -0.9017971537002798 -0.18714545413041742
--0.46039308870086582 -0.84103330267207554 -0.28407954462258922  -0.4601961685558138 -0.84103034646625274 -0.28440717777405627
--0.43765447584202588 -0.8962672300889245 -0.071858277492354974  -0.43642314114700076 -0.89681281808791968 -0.072536964263670553
--0.48516082808530336 -0.87376742805233321 0.033903577486650911  -0.48348770334523583 -0.87467833713118348 0.034313951497558608
--0.033903577486650918 0.48516082808530342 0.87376742805233332  -0.034313951497558351 0.48348770334523589 0.87467833713118359
--0.11626913535565189 0.55392361119767786 0.82440895259656954  -0.11760246779863226 0.55440616112166063 0.82389530164822211
--0.135836225526941 0.719915307065364 0.68063975088704354  -0.13609530337963602 0.72008099426245753 0.68041269101920443
--0.19300544019554747 0.62457262167826666 0.75674166021493738  -0.1935882745811939 0.62484261256047813 0.75636980999592551
-0.069452331980627613 0.9168554803037775 0.39313153246640248  0.069774081725102591 0.91693066884564145 0.3928991296117913
-0 0.86640575634619166 0.4993406306021807  0.00015872199696782705 0.86652958223713705 0.49912569350341041
--0.20731239180326447 0.78076816785433134 0.58942568680894825  -0.20735457304096533 0.78085960551688749 0.5892897059265586
--0.069740197633308881 0.8004723406749189 0.59529852733606181  -0.069662907281838451 0.80067536950372598 0.59503447968929801
-0.033903577486650918 0.48516082808530342 0.87376742805233332  0.034313951497558344 0.48348770334523583 0.87467833713118359
--0.071858277492354974 0.43765447584202588 0.8962672300889245  -0.072536964263671941 0.43642314114700054 0.89681281808791968
--0.28407954462258922 0.46039308870086582 0.84103330267207554  -0.28440717777405611 0.46019616855581419 0.84103034646625263
--0.18656099607880575 0.38998766307204569 0.90172313788306901  -0.18714545413041742 0.38953622755321987 0.9017971537002798
--0.52372394783737519 0.63610018157997195 0.56664784959934433  -0.5234294246654746 0.63609627313050621 0.56692430597377874
--0.45126666560725853 0.58750761901107262 0.67170915887432037  -0.45152335920120762 0.58737470394737412 0.67165289641182357
--0.40100492526839776 0.40480738995889742 0.82178222598517658  -0.40115992505182058 0.40477696304846233 0.82172156155091935
--0.37149736972483099 0.52777252693426735 0.76383628095354983  -0.37176976328896005 0.52785497534633763 0.76364675610270738
-0.054857140713616914 0.54001796879892028 0.83986385056568236  0.056307189018219413 0.54106674669697685 0.83909253130010386
-0.071858277492354974 0.43765447584202588 0.8962672300889245  0.072917516439698266 0.4366583353262774 0.89666746009117038
--0.039734588558411582 0.26026494835742225 0.96471929550963276  -0.039677999129164934 0.25990051397960151 0.96481986879326076
-0.077704403643809677 0.32271058904772337 0.94330265629374277  0.077926023088562835 0.32203490693742848 0.94351526412634279
--0.39313153246640237 0.069452331980627585 0.9168554803037775  -0.39289912961179174 0.069774081725103118 0.91693066884564123
--0.27889813733511903 0.13624095340381404 0.9506072962094394  -0.27889806070390516 0.13594944033505715 0.95064905270461686
--0.040522281668716874 0.13192856911395229 0.99043061207734606  -0.040575895565417616 0.13176921185868207 0.99044963097837835
--0.15985780358782284 0.19937696972895624 0.96679589706089264  -0.16010344242024357 0.19913925651268632 0.96680424297825784
--0.054857140713616914 0.54001796879892028 -0.83986385056568236  -0.056307189018220224 0.54106674669697574 -0.83909253130010464
--0.071858277492354974 0.43765447584202588 -0.8962672300889245  -0.072917516439698168 0.43665833532627857 -0.89666746009116982
-0.039734588558411582 0.26026494835742225 -0.96471929550963276  0.0396779991291649 0.25990051397960151 -0.96481986879326076
--0.077704403643809677 0.32271058904772337 -0.94330265629374277  -0.077926023088562835 0.32203490693742848 -0.94351526412634279
-0.39313153246640237 0.069452331980627585 -0.9168554803037775  0.39289912961179174 0.069774081725103118 -0.91693066884564123
-0.27889813733511903 0.13624095340381404 -0.9506072962094394  0.27889806070390516 0.13594944033505715 -0.95064905270461686
-0.040522281668716874 0.13192856911395229 -0.99043061207734606  0.040575895565417575 0.13176921185868209 -0.99044963097837835
-0.15985780358782284 0.19937696972895624 -0.96679589706089264  0.16010344242024357 0.19913925651268632 -0.96680424297825784
-0 0.57392154628557113 -0.8189102873387164  0.00078604920685477976 0.57538069819453541 -0.81788534298629734
--0.11626913535565189 0.55392361119767786 -0.82440895259656954  -0.11760246779863304 0.55440616112166041 -0.82389530164822211
--0.25952221836449818 0.39610117388436322 -0.88076789123048704  -0.25988482570664351 0.39599581735923556 -0.88070834559541811
--0.23458495860622128 0.51571602924327076 -0.82401873423925942  -0.23530638500725787 0.51562318151862285 -0.82387113061171735
--0.28075529872380572 0 -0.95977938206574664  -0.28060440841513695 0.0003721272683771568 -0.95982343558557015
--0.27889813733511903 0.13624095340381404 -0.9506072962094394  -0.27889806070390522 0.13594944033505713 -0.95064905270461686
--0.37596077789543381 0.33924096091721673 -0.86230450765389344  -0.37608264246842454 0.33912378489964873 -0.86229745711633865
--0.2726998137406515 0.26911716736226499 -0.9236940845413727  -0.27282039415738829 0.26880216379452371 -0.92375019852294993
-0.054857140713616914 0.54001796879892028 -0.83986385056568236  0.056792994144885985 0.53979489236345579 -0.83987858050695885
-0 0.62578188869003271 -0.77999809473327264  0.00023519417927737779 0.6269431253853307 -0.77906499229253756
--0.20012814034344362 0.68018071850695239 -0.70519707714513458  -0.20029565457621276 0.68040299513329217 -0.7049350430866177
--0.067277074024322203 0.70227702532207648 -0.70871769768752158  -0.067501320615791865 0.70276863564904002 -0.70820887911908503
--0.56664784959934422 0.52372394783737519 -0.63610018157997195  -0.56632219140540241 0.52380155193385225 -0.63632626043050478
--0.45126666560725853 0.58750761901107273 -0.67170915887432037  -0.45152335920120679 0.5873747039473749 -0.67165289641182357
--0.27287882084494514 0.74024588618561449 -0.61446983418191203  -0.27300775118977977 0.74028370995146886 -0.6143669885099533
--0.32839555720531111 0.64061453708709604 -0.69409608332024086  -0.3287157188336513 0.64057192708348343 -0.69398384882087016
-0.033903577486650918 0.48516082808530342 -0.87376742805233332  0.034313951497558712 0.48348770334523578 -0.87467833713118359
-0.11626913535565189 0.55392361119767786 -0.82440895259656954  0.11774782579538202 0.55402560894563302 -0.82413049582749998
-0.135836225526941 0.719915307065364 -0.68063975088704354  0.13609530337963627 0.72008099426245709 -0.68041269101920487
-0.19300544019554747 0.62457262167826666 -0.75674166021493738  0.1935882745811939 0.62484261256047813 -0.75636980999592551
--0.069452331980627585 0.9168554803037775 -0.39313153246640237  -0.069774081725102299 0.91693066884564156 -0.39289912961179124
-0 0.86640575634619166 -0.4993406306021807  -0.00015872199696793297 0.86652958223713705 -0.49912569350341024
-0.20731239180326447 0.78076816785433134 -0.58942568680894825  0.20735457304096533 0.78085960551688749 -0.5892897059265586
-0.069740197633308881 0.8004723406749189 -0.59529852733606181  0.069662907281838451 0.80067536950372598 -0.59503447968929801
--0.033903577486650904 0.48516082808530331 -0.87376742805233321  -0.035585805831080376 0.48427375255209071 -0.87419253200451719
-0.071858277492354974 0.43765447584202588 -0.8962672300889245  0.07253696426367158 0.43642314114700032 -0.89681281808791979
-0.28407954462258922 0.46039308870086582 -0.84103330267207554  0.28440717777405627 0.46019616855581391 -0.84103034646625285
-0.18656099607880575 0.38998766307204569 -0.90172313788306901  0.18714545413041742 0.38953622755321987 -0.9017971537002798
-0.52372394783737508 0.63610018157997195 -0.56664784959934422  0.52380155193385236 0.63632626043050489 -0.56632219140540219
-0.45126666560725853 0.58750761901107262 -0.67170915887432037  0.45152335920120762 0.58737470394737412 -0.67165289641182357
-0.40100492526839776 0.40480738995889742 -0.82178222598517658  0.4011599250518203 0.40477696304846222 -0.82172156155091958
-0.37149736972483099 0.52777252693426735 -0.76383628095354983  0.37176976328896005 0.52785497534633763 -0.76364675610270738
-0.74328545761836984 0.095572989323982616 0.66096525556418162  0.73279395097326416 0.089584884642383344 0.6745276672313778
-0.72858929180595311 0.094046635219543179 0.67713360594626881  0.73279395097326727 0.089584884642385565 0.67452766723137403
-0.80253395542112949 0.58417903277383187 0.11307342108777621  0.79565076497465947 0.59478368364254086 0.11477033531295991
-0.78594000042913037 0.60770816150558526 0.10617487126239183  0.79565076497467102 0.5947836836425241 0.11477033531296656
-0.4576613505648901 0.17031256632806047 0.87149140923129198  0.46036815782147578 0.16290466567087075 0.87265298324518592
-0.33544566672286746 0.90463734990484679 0.25988381527545978  0.35458300388090036 0.89704722922209146 0.26377483182397471
-0.82416586116838464 0.5512195414246408 0.12458499692215486  0.8392674623311116 0.53130823737481137 0.11550620576387746
-0.84282425105969128 0.51873480041451114 0.13843733448120865  0.83926746233112337 0.53130823737479038 0.11550620576388952
-0.10617487126239186 0.78594000042913037 0.60770816150558549  0.11477033531296087 0.79565076497466702 0.59478368364253054
-0.11307342108777627 0.80253395542112949 0.58417903277383187  0.11477033531295956 0.79565076497466403 0.59478368364253487
-0.85435218642293986 0.49724573572225761 0.14854713354961632  0.84903903628470268 0.49501822108779592 0.18463389628076832
-0.21570896554595276 0.38998187620182151 0.89436470058605511  0.22723563663235583 0.37239734211019476 0.89982453013548735
-0.069452331980627585 -0.9168554803037775 0.39313153246640237  0.069774081725103118 -0.91693066884564123 0.39289912961179174
-0.13624095340381404 -0.9506072962094394 0.27889813733511903  0.13594944033505715 -0.95064905270461686 0.27889806070390516
-0.13192856911395229 -0.99043061207734606 0.040522281668716874  0.13176921185868212 -0.99044963097837846 0.040575895565417554
-0.19937696972895624 -0.96679589706089264 0.15985780358782284  0.19913925651268402 -0.96680424297825862 0.16010344242024122
-0.23967742655656482 0.35918321758479488 0.90105806124803833  0.22723563663231983 0.37239734211023184 0.89982453013548114
-0.12458499692215494 0.8241658611683842 0.55121954142464069  0.11550620576390451 0.8392674623311267 0.53130823737478172
-0.13843733448120885 0.84282425105969117 0.5187348004145107  0.11550620576389807 0.8392674623311176 0.53130823737479738
-0.35918321758479488 0.90105806124803856 0.23967742655656488  0.37239734211021447 0.8998245301354828 0.22723563663234123
-0 -0.95977938206574664 -0.28075529872380572  0.00037212726837715501 -0.95982343558557015 -0.28060440841513695
-0.13624095340381404 -0.9506072962094394 -0.27889813733511903  0.13594944033505713 -0.95064905270461686 -0.27889806070390522
-0.38998187620182156 0.89436470058605533 0.21570896554595276  0.37239734211022768 0.89982453013547636 0.22723563663234547
-0.12310298935169572 0.55521070025011254 0.82226795238624728  0.072892092607679745 0.73477483045466507 0.6743831932704073
-0.2284369195008584 0.89844705357522048 0.37311241287933194  0.22824258748331525 0.90894237800238609 0.34889693998412885
-0.25355721782048268 0.90387507728811034 0.34253810440658672  0.2282425874832984 0.90894237800239419 0.34889693998411864
-0.86055952199012919 0.15594877494016762 0.48342144068564141  0.86526167125339559 0.13902973540249128 0.48165648852028786
-0.85269038907862327 0.14688267020077067 0.50017470245974227  0.86526167125339637 0.13902973540249855 0.48165648852028436
-0.64339140453754151 0.098424941615366676 0.75815048575026589  0.65387638494521527 0.11348698498785581 0.74804169499389728
-0.51101182387798261 0.84695178356442291 0.1418121948905855  0.51974293683793993 0.84473325897900786 0.12764403935075805
-0.84695178356442291 0.1418121948905855 0.51101182387798261  0.84473325897900786 0.12764403935075805 0.51974293683793993
-0.50017470245974227 0.85269038907862327 0.14688267020077073  0.48165648852028398 0.86526167125339648 0.13902973540249844
-0.48342144068564125 0.86055952199012919 0.15594877494016779  0.48165648852028875 0.86526167125339737 0.13902973540247704
-0.1418121948905855 0.51101182387798283 0.84695178356442269  0.12764403935075835 0.51974293683794204 0.84473325897900642
-0.62479622481419628 0.77318510024650322 0.10194841255523895  0.6206862239227865 0.7793365693277452 0.085925101925648908
-0.60871986758868468 0.78560578771446699 0.10542210643598451  0.62068622392278427 0.77933656932774686 0.085925101925650921
-0.77318510024650355 0.10194841255523886 0.62479622481419606  0.77933656932772744 0.08592510192567096 0.62068622392280592
-0.78560578771446699 0.10542210643598442 0.60871986758868479  0.77933656932774609 0.085925101925648867 0.6206862239227855
-0.90463734990484679 0.25988381527545973 0.33544566672286741  0.8970472292220919 0.26377483182397643 0.35458300388089781
-0.10542210643598447 0.60871986758868468 0.78560578771446687  0.085925101925656111 0.62068622392277861 0.77933656932775075
-0.8189102873387164 0 0.57392154628557113  0.81788534298629723 0.00078604920685285812 0.57538069819453586
-0.82440895259656954 0.11626913535565189 0.55392361119767786  0.70122018792202434 0.065815526689251877 0.70990039054589715
-0.80047234067491879 0.59529852733606159 -0.069740197633308854  0.8006753695037262 0.59503447968929801 -0.069662907281838451
-0.78076816785433134 0.58942568680894825 -0.20731239180326447  0.78085960551688738 0.58928970592655827 -0.20735457304096649
-0.95977938206574664 0.28075529872380572 0  0.95982343558557026 0.2806044084151364 0.00037212726837936223
-0.9506072962094394 0.27889813733511903 0.13624095340381404  0.95064905270461697 0.27889806070390505 0.13594944033505701
-0.86640575634619166 0.49934063060218076 0  0.86652958223713716 0.49912569350341024 -0.00015872199696830458
-0.9236940845413727 0.2726998137406515 0.26911716736226499  0.92375019852295026 0.27282039415738757 0.26880216379452326
-0.033903577486650918 -0.48516082808530342 -0.87376742805233332  0.034313951497558337 -0.48348770334523583 -0.87467833713118359
--0.071858277492354974 -0.43765447584202588 -0.8962672300889245  -0.07253696426367158 -0.43642314114700032 -0.89681281808791979
--0.28407954462258922 -0.46039308870086582 -0.84103330267207554  -0.28440717777405627 -0.4601961685558138 -0.84103034646625285
--0.18656099607880575 -0.38998766307204569 -0.90172313788306901  -0.18714545413041742 -0.38953622755321987 -0.9017971537002798
--0.52372394783737508 -0.63610018157997195 -0.56664784959934422  -0.52380155193385236 -0.63632626043050489 -0.56632219140540219
--0.45126666560725853 -0.58750761901107262 -0.67170915887432037  -0.45152335920120762 -0.58737470394737412 -0.67165289641182357
--0.40100492526839776 -0.40480738995889742 -0.82178222598517658  -0.40115992505182019 -0.40477696304846211 -0.82172156155091969
--0.37149736972483099 -0.52777252693426735 -0.76383628095354983  -0.37176976328896005 -0.52785497534633763 -0.76364675610270738
--0.83986385056568236 0.054857140713616921 -0.54001796879892028  -0.83987858050695918 0.05679299414488586 -0.53979489236345535
--0.8962672300889245 0.071858277492354974 -0.43765447584202588  -0.89666746009116993 0.072917516439698196 -0.4366583353262784
--0.96471929550963276 -0.039734588558411582 -0.26026494835742225  -0.96481986879326076 -0.039677999129164865 -0.25990051397960146
--0.94330265629374277 0.077704403643809677 -0.32271058904772337  -0.94351526412634279 0.077926023088562835 -0.32203490693742848
--0.9168554803037775 -0.39313153246640248 -0.069452331980627613  -0.91670068154564355 -0.39350124418016658 -0.069401954456726103
--0.9506072962094394 -0.27889813733511903 -0.13624095340381404  -0.95055095711572857 -0.27915487828976138 -0.13610816233202502
--0.99043061207734606 -0.040522281668716874 -0.13192856911395229  -0.99044963097837846 -0.040575895565417547 -0.13176921185868212
--0.96679589706089264 -0.15985780358782284 -0.19937696972895624  -0.96680424297825784 -0.16010344242024357 -0.19913925651268632
--0.83986385056568236 0.054857140713616914 0.54001796879892028  -0.83987858050695929 0.05679299414488595 0.53979489236345513
--0.77999809473327264 0 0.62578188869003271  -0.77906499229253745 0.00023519417927787259 0.62694312538533081
--0.70519707714513458 -0.20012814034344362 0.6801807185069525  -0.70493504308661714 -0.20029565457621371 0.68040299513329239
--0.70871769768752158 -0.067277074024322203 0.70227702532207648  -0.7082088791190847 -0.067501320615791602 0.70276863564904046
--0.63610018157997195 -0.56664784959934422 0.52372394783737519  -0.63632626043050478 -0.56632219140540241 0.52380155193385225
--0.67170915887432037 -0.45126666560725853 0.58750761901107273  -0.67165289641182357 -0.45152335920120673 0.5873747039473749
--0.61446983418191203 -0.27287882084494514 0.74024588618561449  -0.61436698850995408 -0.2730077511897796 0.74028370995146808
--0.69409608332024086 -0.32839555720531111 0.64061453708709615  -0.69398384882087005 -0.32871571883365175 0.64057192708348332
--0.48516082808530336 0.87376742805233321 0.033903577486650911  -0.48348770334523589 0.87467833713118348 0.034313951497558594
--0.55392361119767786 0.82440895259656954 0.11626913535565189  -0.55402560894563302 0.82413049582749986 0.11774782579538202
--0.719915307065364 0.68063975088704354 0.135836225526941  -0.72008099426245709 0.68041269101920487 0.13609530337963627
--0.62457262167826666 0.75674166021493738 0.19300544019554747  -0.62484261256047768 0.75636980999592551 0.19358827458119579
--0.9168554803037775 0.39313153246640237 -0.069452331980627585  -0.91693066884564156 0.39289912961179124 -0.069774081725102299
--0.86640575634619166 0.4993406306021807 0  -0.86652958223713705 0.49912569350341024 -0.00015872199696793297
--0.78076816785433134 0.58942568680894825 0.20731239180326447  -0.78085960551688749 0.58928970592655849 0.20735457304096533
--0.8004723406749189 0.59529852733606181 0.069740197633308881  -0.80067536950372598 0.59503447968929801 0.069662907281838451
--0.054857140713616921 -0.54001796879892028 0.83986385056568236  -0.056792994144885853 -0.53979489236345535 0.83987858050695907
--0.071858277492354974 -0.43765447584202588 0.8962672300889245  -0.072917516439698266 -0.4366583353262774 0.89666746009117038
-0.039734588558411582 -0.26026494835742225 0.96471929550963276  0.0396779991291649 -0.25990051397960151 0.96481986879326076
--0.077704403643809677 -0.32271058904772337 0.94330265629374277  -0.077926023088562835 -0.32203490693742848 0.94351526412634279
-0.39313153246640237 -0.069452331980627585 0.9168554803037775  0.39289912961179146 -0.069774081725103021 0.91693066884564145
-0.27889813733511903 -0.13624095340381404 0.9506072962094394  0.27889806070390516 -0.13594944033505715 0.95064905270461686
-0.040522281668716874 -0.13192856911395229 0.99043061207734606  0.040575895565417575 -0.13176921185868209 0.99044963097837835
-0.15985780358782284 -0.19937696972895624 0.96679589706089264  0.16010344242024357 -0.19913925651268632 0.96680424297825784
-0.10194841255523887 0.62479622481419628 0.77318510024650311  0.085925101925653558 0.62068622392278772 0.77933656932774364
-0.59819314586024919 0.79307076339523386 0.10851189307750808  0.58661618171386287 0.80340332070769238 0.10210073274615192
-0.68063975088704354 -0.135836225526941 0.719915307065364  0.6804126910192051 -0.13609530337963646 0.72008099426245675
-0.095052466200525557 0.7378162794185118 0.66704995977036108  0.091975091050971861 0.7265140477791121 0.68096837004796018
-0.39313153246640237 0.069452331980627585 0.9168554803037775  0.39289912961179108 0.069774081725103229 0.91693066884564156
-0.49934063060218076 0 0.86640575634619166  0.49912569350341018 0.00015872199696750577 0.86652958223713716
-0.58942568680894825 -0.20731239180326447 0.78076816785433134  0.58928970592655827 -0.20735457304096649 0.78085960551688738
-0.59529852733606159 -0.069740197633308854 0.80047234067491879  0.59503447968929801 -0.069662907281838465 0.8006753695037262
-0.093129265416474122 0.71089969747156689 0.69602657944578861  0.091975091050964602 0.72651404777912154 0.68096837004795108
-0.77999809473327264 0 0.62578188869003271  0.77906499229250015 0.00023519417923989705 0.62694312538537711
-0.9168554803037775 0.39313153246640237 0.069452331980627585  0.91693066884564156 0.39289912961179108 0.069774081725103229
-0.70871769768752158 0.067277074024322203 0.70227702532207648  0.7082088791190857 0.067501320615791935 0.70276863564903957
-0.62457262167826666 0.75674166021493738 -0.19300544019554747  0.62484261256047768 0.75636980999592551 -0.19358827458119579
-0.719915307065364 0.68063975088704354 -0.135836225526941  0.72008099426245631 0.68041269101920543 -0.13609530337963674
-0.55392361119767786 0.82440895259656954 -0.11626913535565189  0.55402560894563302 0.82413049582749986 -0.11774782579538204
-0.48516082808530336 0.87376742805233321 -0.033903577486650911  0.48348770334523555 0.8746783371311837 -0.034313951497559961
-0.54001796879892028 0.83986385056568236 -0.054857140713616914  0.53979489236345657 0.83987858050695829 -0.056792994144886484
-0.62578188869003271 0.77999809473327264 0  0.6269431253853307 0.77906499229253756 -0.00023519417927871463
-0.10155294642477927 0.62688758712066828 0.77156308049914146  0.096596587118422172 0.63168040245027901 0.7691872129184979
-0.70227702532207648 0.70871769768752158 0.067277074024322203  0.70276863564903225 0.70820887911909236 0.067501320615797611
-0.64081678241520534 0.098941938751961223 0.76032257344343512  0.63913636447114808 0.10365825365835347 0.7620758978337423
-0.9506072962094394 0.27889813733511903 -0.13624095340381404  0.95055095711572857 0.27915487828976138 -0.13610816233202508
-0.9168554803037775 0.39313153246640237 -0.069452331980627585  0.91693066884564145 0.39289912961179146 -0.069774081725103021
-0.12310298935169575 0.55521070025011254 0.82226795238624728  0.080588876905648865 0.71952003419649402 0.68977993107147029
-0.57392154628557124 0.81891028733871629 0  0.57538069819453619 0.81788534298629689 0.00078604920685351092
-0.55392361119767786 0.82440895259656954 0.11626913535565189  0.71020085023251078 0.70091523749936702 0.065822353119778854
-0.12850859076870802 0.5423386494351099 0.82968743367193953  0.14218930946431643 0.53087421189741324 0.83543687458500493
-0.4889881761220175 0.15304821643557709 0.85818780510941428  0.47782642632714101 0.17381774822644638 0.86108611456980366
-0 0.95977938206574664 0.28075529872380572  0.00037212726837716195 0.95982343558557015 0.2806044084151369
-0.13624095340381404 0.9506072962094394 0.27889813733511903  0.13610816233202513 0.95055095711572846 0.27915487828976165
-0.17583413883161547 0.44878045857535925 0.87541500307784514  0.17844712110944902 0.44918580997761587 0.87543631012341661
-0.26911716736226499 0.9236940845413727 0.2726998137406515  0.26880216379452371 0.92375019852294993 0.27282039415738846
--0.54001796879892028 0.83986385056568236 -0.054857140713616921  -0.53979489236345535 0.83987858050695918 -0.05679299414488586
--0.43765447584202588 0.8962672300889245 -0.071858277492354974  -0.4366583353262784 0.89666746009116993 -0.072917516439698196
--0.26026494835742225 0.96471929550963276 0.039734588558411582  -0.25990051397960146 0.96481986879326076 0.039677999129164865
--0.32271058904772337 0.94330265629374277 -0.077704403643809677  -0.32203490693742848 0.94351526412634279 -0.077926023088562835
--0.069452331980627613 0.9168554803037775 0.39313153246640248  -0.069774081725103049 0.91693066884564145 0.39289912961179158
--0.13624095340381404 0.9506072962094394 0.27889813733511903  -0.13610816233202497 0.95055095711572857 0.27915487828976127
--0.13192856911395229 0.99043061207734606 0.040522281668716874  -0.13176921185868212 0.99044963097837846 0.040575895565417547
--0.19937696972895624 0.96679589706089264 0.15985780358782284  -0.19913925651268632 0.96680424297825784 0.16010344242024357
--0.48516082808530336 0.87376742805233321 -0.033903577486650911  -0.48348770334523583 0.87467833713118348 -0.034313951497558608
--0.43765447584202588 0.8962672300889245 0.071858277492354974  -0.43642314114700076 0.89681281808791968 0.072536964263670553
--0.46039308870086582 0.84103330267207554 0.28407954462258922  -0.46019616855581386 0.84103034646625274 0.28440717777405622
--0.38998766307204569 0.90172313788306901 0.18656099607880575  -0.38953622755321987 0.9017971537002798 0.18714545413041742
--0.63610018157997195 0.56664784959934433 0.52372394783737519  -0.63609627313050621 0.56692430597377952 0.52342942466547371
--0.58750761901107262 0.67170915887432037 0.45126666560725853  -0.58737470394737412 0.67165289641182357 0.45152335920120762
--0.40480738995889742 0.82178222598517658 0.40100492526839776  -0.40477696304846156 0.82172156155092058 0.40115992505181908
--0.52777252693426735 0.76383628095354983 0.37149736972483099  -0.52785497534633807 0.76364675610270716 0.37176976328895989
--0.87376742805233321 -0.033903577486650911 0.48516082808530336  -0.8741925320045173 -0.035585805831079474 0.48427375255209065
--0.8962672300889245 0.071858277492354974 0.43765447584202588  -0.89681281808791957 0.072536964263670914 0.43642314114700098
--0.84103330267207554 0.28407954462258922 0.46039308870086582  -0.84103034646625263 0.28440717777405616 0.46019616855581419
--0.90172313788306901 0.18656099607880575 0.38998766307204569  -0.9017971537002798 0.18714545413041742 0.38953622755321987
--0.56664784959934433 0.52372394783737519 0.63610018157997195  -0.56632219140540241 0.52380155193385303 0.63632626043050411
--0.67170915887432037 0.45126666560725853 0.58750761901107262  -0.67165289641182357 0.45152335920120762 0.58737470394737412
--0.82178222598517658 0.40100492526839776 0.40480738995889742  -0.82172156155091935 0.40115992505182047 0.40477696304846261
--0.76383628095354983 0.37149736972483099 0.52777252693426735  -0.76364675610270705 0.37176976328895983 0.52785497534633807
--0.87376742805233321 0.033903577486650911 0.48516082808530336  -0.87467833713118348 0.034313951497558594 0.48348770334523589
--0.82440895259656954 0.11626913535565189 0.55392361119767786  -0.82389530164822311 0.11760246779863283 0.55440616112165908
--0.68063975088704354 0.135836225526941 0.719915307065364  -0.6804126910192051 0.13609530337963646 0.72008099426245675
--0.75674166021493738 0.19300544019554747 0.62457262167826666  -0.7563698099959254 0.19358827458119579 0.62484261256047768
--0.39313153246640237 -0.069452331980627585 0.9168554803037775  -0.39289912961179119 -0.069774081725102868 0.91693066884564156
--0.4993406306021807 0 0.86640575634619166  -0.49912569350341029 0.00015872199696811011 0.86652958223713716
--0.58942568680894825 0.20731239180326447 0.78076816785433134  -0.58928970592655827 0.20735457304096649 0.78085960551688738
--0.59529852733606159 0.069740197633308854 0.80047234067491879  -0.59503447968929801 0.069662907281838465 0.8006753695037262
-0 -0.57392154628557124 0.81891028733871629  -0.00078604920685375031 -0.5753806981945353 0.81788534298629745
--0.11626913535565189 -0.55392361119767786 0.82440895259656954  -0.11760246779863304 -0.55440616112166052 0.82389530164822211
--0.25952221836449818 -0.39610117388436322 0.88076789123048704  -0.25988482570664351 -0.39599581735923556 0.88070834559541811
--0.23458495860622128 -0.51571602924327076 0.82401873423925942  -0.23530638500725787 -0.51562318151862285 0.82387113061171735
--0.28075529872380572 0 0.95977938206574664  -0.28060440841513667 0.00037212726837714639 0.95982343558557015
--0.27889813733511903 -0.13624095340381404 0.9506072962094394  -0.27915487828976165 -0.13610816233202513 0.95055095711572846
--0.37596077789543381 -0.33924096091721673 0.86230450765389344  -0.37608264246842454 -0.33912378489964873 0.86229745711633865
--0.2726998137406515 -0.26911716736226499 0.9236940845413727  -0.27282039415738829 -0.2688021637945236 0.92375019852294993
-0.10851189307750805 0.59819314586024896 0.79307076339523386  0.10210073274615436 0.58661618171386465 0.80340332070769072
-0.82440895259656954 0.11626913535565189 -0.55392361119767786  0.82389530164822311 0.11760246779863283 -0.55440616112165908
-0.68063975088704354 0.135836225526941 -0.719915307065364  0.6804126910192051 0.13609530337963646 -0.72008099426245675
-0.75674166021493738 0.19300544019554747 -0.62457262167826666  0.7563698099959254 0.19358827458119579 -0.62484261256047768
-0.39313153246640237 -0.069452331980627585 -0.9168554803037775  0.39289912961179119 -0.069774081725102868 -0.91693066884564156
-0.4993406306021807 0 -0.86640575634619166  0.49912569350341029 0.00015872199696811011 -0.86652958223713716
-0.58942568680894825 0.20731239180326447 -0.78076816785433134  0.58928970592655827 0.20735457304096649 -0.78085960551688738
-0.59529852733606159 0.069740197633308854 -0.80047234067491879  0.59503447968929801 0.069662907281838465 -0.8006753695037262
-0 -0.57392154628557124 -0.81891028733871629  0.00078604920685375031 -0.5753806981945353 -0.81788534298629745
-0.11626913535565189 -0.55392361119767786 -0.82440895259656954  0.11760246779863304 -0.55440616112166052 -0.82389530164822211
-0.25952221836449818 -0.39610117388436322 -0.88076789123048704  0.25988482570664351 -0.39599581735923556 -0.88070834559541811
-0.23458495860622128 -0.51571602924327076 -0.82401873423925942  0.23530638500725787 -0.51562318151862285 -0.82387113061171735
-0.28075529872380572 0 -0.95977938206574664  0.28060440841513667 0.00037212726837714639 -0.95982343558557015
-0.27889813733511903 -0.13624095340381404 -0.9506072962094394  0.27915487828976165 -0.13610816233202513 -0.95055095711572846
-0.37596077789543381 -0.33924096091721673 -0.86230450765389344  0.37608264246842454 -0.33912378489964873 -0.86229745711633865
-0.2726998137406515 -0.26911716736226499 -0.9236940845413727  0.27282039415738829 -0.2688021637945236 -0.92375019852294993
-0.054857140713616921 -0.54001796879892028 -0.83986385056568236  0.056792994144885853 -0.53979489236345535 -0.83987858050695907
-0.071858277492354974 -0.43765447584202588 -0.8962672300889245  0.072917516439698266 -0.4366583353262774 -0.89666746009117038
--0.039734588558411582 -0.26026494835742225 -0.96471929550963276  -0.039677999129164934 -0.25990051397960151 -0.96481986879326076
-0.077704403643809677 -0.32271058904772337 -0.94330265629374277  0.077926023088562835 -0.32203490693742848 -0.94351526412634279
--0.39313153246640237 -0.069452331980627585 -0.9168554803037775  -0.39289912961179146 -0.069774081725103021 -0.91693066884564145
--0.27889813733511903 -0.13624095340381404 -0.9506072962094394  -0.27889806070390516 -0.13594944033505715 -0.95064905270461686
--0.040522281668716874 -0.13192856911395229 -0.99043061207734606  -0.040575895565417616 -0.13176921185868207 -0.99044963097837835
--0.15985780358782284 -0.19937696972895624 -0.96679589706089264  -0.16010344242024357 -0.19913925651268632 -0.96680424297825784
--0.87376742805233321 -0.033903577486650911 -0.48516082808530336  -0.87467833713118348 -0.034313951497558594 -0.48348770334523589
--0.82440895259656954 -0.11626913535565189 -0.55392361119767786  -0.82389530164822311 -0.11760246779863283 -0.55440616112165897
--0.68063975088704354 -0.135836225526941 -0.719915307065364  -0.6804126910192051 -0.13609530337963646 -0.72008099426245675
--0.75674166021493738 -0.19300544019554747 -0.62457262167826666  -0.7563698099959254 -0.19358827458119579 -0.62484261256047768
--0.39313153246640237 0.069452331980627585 -0.9168554803037775  -0.39289912961179108 0.069774081725103229 -0.91693066884564156
--0.49934063060218076 0 -0.86640575634619166  -0.49912569350341018 0.00015872199696750577 -0.86652958223713716
--0.58942568680894825 -0.20731239180326447 -0.78076816785433134  -0.58928970592655827 -0.20735457304096649 -0.78085960551688738
--0.59529852733606159 -0.069740197633308854 -0.80047234067491879  -0.59503447968929801 -0.069662907281838465 -0.8006753695037262
--0.83986385056568236 -0.054857140713616921 -0.54001796879892028  -0.83987858050695918 -0.056792994144885853 -0.53979489236345535
--0.77999809473327264 0 -0.62578188869003271  -0.77906499229253756 -0.00023519417927852539 -0.6269431253853307
--0.70519707714513458 0.20012814034344362 -0.6801807185069525  -0.70493504308661714 0.20029565457621371 -0.68040299513329239
--0.70871769768752158 0.067277074024322203 -0.70227702532207648  -0.7082088791190847 0.067501320615791602 -0.70276863564904046
--0.63610018157997184 0.56664784959934422 -0.52372394783737519  -0.63609627313050632 0.56692430597377919 -0.52342942466547393
--0.67170915887432037 0.4512666656072587 -0.58750761901107273  -0.67149417441485493 0.45142526361231849 -0.58763152153323184
--0.61446983418191203 0.27287882084494514 -0.74024588618561449  -0.61436698850995408 0.2730077511897796 -0.74028370995146808
--0.69409608332024086 0.32839555720531111 -0.64061453708709615  -0.69398384882087005 0.32871571883365175 -0.64057192708348332
--0.54001796879892028 0.83986385056568236 0.054857140713616921  -0.53979489236345579 0.83987858050695896 0.056792994144885707
--0.62578188869003271 0.77999809473327264 0  -0.6269431253853307 0.77906499229253756 0.0002351941792792563
--0.68018071850695239 0.70519707714513458 -0.20012814034344362  -0.68040299513329217 0.7049350430866177 -0.20029565457621276
--0.70227702532207648 0.70871769768752158 -0.067277074024322203  -0.70276863564904013 0.70820887911908503 -0.067501320615791879
--0.52372394783737508 0.63610018157997195 -0.56664784959934422  -0.5234294246654746 0.63609627313050632 -0.56692430597377863
--0.58750761901107262 0.67170915887432026 -0.45126666560725864  -0.58737470394737479 0.67165289641182357 -0.45152335920120684
--0.74024588618561449 0.61446983418191203 -0.27287882084494514  -0.74028370995146886 0.6143669885099533 -0.27300775118977977
--0.64061453708709615 0.69409608332024098 -0.32839555720531116  -0.6405719270834821 0.6939838488208705 -0.32871571883365286
--0.57392154628557124 0.81891028733871629 0  -0.57538069819453541 0.81788534298629756 -0.00078604920685375042
--0.55392361119767786 0.82440895259656954 -0.11626913535565189  -0.55440616112165897 0.823895301648223 -0.11760246779863361
--0.39610117388436322 0.88076789123048704 -0.25952221836449818  -0.39599581735923572 0.880708345595418 -0.25988482570664373
--0.51571602924327076 0.82401873423925942 -0.23458495860622128  -0.51562318151862307 0.82387113061171735 -0.2353063850072579
-0 0.95977938206574664 -0.28075529872380572  -0.0003721272683770178 0.95982343558557004 -0.28060440841513712
--0.13624095340381404 0.9506072962094394 -0.27889813733511903  -0.13610816233202513 0.95055095711572846 -0.27915487828976165
--0.33924096091721673 0.86230450765389344 -0.37596077789543381  -0.33912378489964901 0.86229745711633865 -0.37608264246842449
--0.26911716736226499 0.9236940845413727 -0.2726998137406515  -0.2688021637945236 0.92375019852294993 -0.27282039415738829
-0.54001796879892028 0.83986385056568236 0.054857140713616914  0.54106674669697563 0.83909253130010464 0.056307189018221113
-0.43765447584202588 0.8962672300889245 0.071858277492354974  0.4366583353262784 0.89666746009116993 0.072917516439698196
-0.26026494835742225 0.96471929550963276 -0.039734588558411582  0.25990051397960151 0.96481986879326076 -0.039677999129164934
-0.32271058904772337 0.94330265629374277 0.077704403643809677  0.32203490693742848 0.94351526412634279 0.077926023088562835
-0.069452331980627585 0.9168554803037775 -0.39313153246640237  0.069401954456724882 0.91670068154564321 -0.39350124418016752
-0.13624095340381404 0.9506072962094394 -0.27889813733511903  0.13610816233202497 0.95055095711572857 -0.27915487828976127
-0.13192856911395229 0.99043061207734606 -0.040522281668716874  0.13176921185868209 0.99044963097837846 -0.040575895565417609
-0.19937696972895624 0.96679589706089264 -0.15985780358782284  0.19913925651268632 0.96680424297825784 -0.16010344242024357
-0.48516082808530336 0.87376742805233321 0.033903577486650911  0.48348770334523544 0.8746783371311837 0.034313951497559954
-0.43765447584202588 0.8962672300889245 -0.071858277492354974  0.43642314114700076 0.89681281808791968 -0.072536964263670553
-0.46039308870086582 0.84103330267207554 -0.28407954462258922  0.4601961685558138 0.84103034646625274 -0.28440717777405627
-0.38998766307204569 0.90172313788306901 -0.18656099607880575  0.38953622755321987 0.9017971537002798 -0.18714545413041742
-0.63610018157997184 0.56664784959934433 -0.52372394783737508  0.63632626043050544 0.56632219140540152 -0.52380155193385247
-0.58750761901107262 0.67170915887432037 -0.45126666560725853  0.58737470394737434 0.67165289641182369 -0.45152335920120712
-0.40480738995889742 0.82178222598517658 -0.40100492526839776  0.4047769630484615 0.82172156155092069 -0.40115992505181902
-0.52777252693426735 0.76383628095354983 -0.37149736972483099  0.52785497534633807 0.76364675610270716 -0.37176976328895989
-0.82226795238624728 0.12310298935169572 0.55521070025011254  0.6743831932704073 0.072892092607679745 0.73477483045466507
-0.39369586600014295 0.21254447256850689 0.89390471712616426  0.42092243512974509 0.23042761042598023 0.8773411080975394
-0.84103330267207554 0.28407954462258922 -0.46039308870086582  0.84103034646625263 0.28440717777405616 -0.46019616855581419
-0.90172313788306901 0.18656099607880575 -0.38998766307204569  0.90179715370028013 0.18714545413041661 -0.38953622755321932
-0.56664784959934433 0.52372394783737519 -0.63610018157997195  0.56692430597377874 0.5234294246654746 -0.6360962731305061
-0.67170915887432037 0.45126666560725853 -0.58750761901107262  0.67165289641182357 0.45152335920120762 -0.58737470394737412
-0.82178222598517658 0.40100492526839776 -0.40480738995889742  0.82172156155091913 0.40115992505182035 -0.40477696304846322
-0.76383628095354983 0.37149736972483099 -0.52777252693426735  0.76364675610270738 0.37176976328896 -0.52785497534633763
-0.17031256632806052 0.87149140923129198 0.45766135056488999  0.16290466567087381 0.87265298324518525 0.46036815782147589
-0.55521070025011254 0.82226795238624728 0.12310298935169572  0.73506403715197666 0.67406726425876351 0.07289845362244457
-0.79307076339523386 0.10851189307750797 0.59819314586024919  0.80340332070769471 0.10210073274615283 0.58661618171385932
-0.44486756488630003 0.87684117534766193 0.17811496227257201  0.42919468968313912 0.88441806965929093 0.18329374350459265
-0.42721864490060912 0.88304523202927654 0.18950565604187919  0.429194689683149 0.88441806965928738 0.18329374350458694
-0.18950565604187924 0.42721864490060907 0.88304523202927665  0.18329374350458899 0.42919468968314683 0.88441806965928804
-0.17811496227257201 0.44486756488630003 0.87684117534766193  0.18329374350459213 0.42919468968314456 0.88441806965928849
-0.73781627941851213 0.66704995977036097 0.095052466200525487  0.72651404777913131 0.68096837004793687 0.091975091050992136
--0.033903577486650918 -0.48516082808530342 0.87376742805233332  -0.034313951497558337 -0.48348770334523583 0.87467833713118359
-0.071858277492354974 -0.43765447584202588 0.8962672300889245  0.07253696426367158 -0.43642314114700032 0.89681281808791979
-0.28407954462258922 -0.46039308870086582 0.84103330267207554  0.28440717777405627 -0.4601961685558138 0.84103034646625285
-0.18656099607880575 -0.38998766307204569 0.90172313788306901  0.18714545413041742 -0.38953622755321987 0.9017971537002798
-0.71089969747156689 0.69602657944578872 0.093129265416474039  0.72651404777910411 0.68096837004796806 0.091975091050976149
-0.45126666560725853 -0.58750761901107262 0.67170915887432037  0.4514252636123024 -0.58763152153321818 0.67149417441487758
-0.40100492526839776 -0.40480738995889742 0.82178222598517658  0.40115992505182019 -0.40477696304846211 0.82172156155091969
-0.37149736972483099 -0.52777252693426735 0.76383628095354983  0.37176976328896005 -0.52785497534633763 0.76364675610270738
-0.033903577486650918 -0.48516082808530342 0.87376742805233332  0.034313951497558351 -0.48348770334523589 0.87467833713118359
-0.11626913535565189 -0.55392361119767786 0.82440895259656954  0.11760246779863211 -0.55440616112166108 0.82389530164822189
-0.135836225526941 -0.719915307065364 0.68063975088704354  0.13609530337963674 -0.72008099426245631 0.68041269101920543
-0.19300544019554747 -0.62457262167826666 0.75674166021493738  0.1935882745811939 -0.62484261256047813 0.75636980999592551
--0.069452331980627585 -0.9168554803037775 0.39313153246640237  -0.069774081725102868 -0.91693066884564156 0.39289912961179119
-0 -0.86640575634619166 0.4993406306021807  0.00015872199696811011 -0.86652958223713705 0.49912569350341024
-0.20731239180326447 -0.78076816785433134 0.58942568680894825  0.20735457304096652 -0.78085960551688727 0.58928970592655827
-0.069740197633308854 -0.80047234067491879 0.59529852733606159  0.069662907281838451 -0.8006753695037262 0.59503447968929801
--0.57392154628557124 -0.81891028733871629 0  -0.57538069819453541 -0.81788534298629756 0.00078604920685375042
--0.55392361119767786 -0.82440895259656954 0.11626913535565189  -0.55440616112165897 -0.823895301648223 0.11760246779863361
--0.39610117388436322 -0.88076789123048704 0.25952221836449818  -0.39599581735923556 -0.88070834559541811 0.25988482570664351
--0.51571602924327076 -0.82401873423925942 0.23458495860622128  -0.51562318151862307 -0.82387113061171735 0.2353063850072579
-0 -0.95977938206574664 0.28075529872380572  0.00037212726837714466 -0.95982343558557026 0.28060440841513667
--0.13624095340381404 -0.9506072962094394 0.27889813733511903  -0.13610816233202513 -0.95055095711572846 0.27915487828976165
--0.33924096091721673 -0.86230450765389344 0.37596077789543381  -0.33912378489964873 -0.86229745711633865 0.37608264246842454
--0.26911716736226499 -0.9236940845413727 0.2726998137406515  -0.2688021637945236 -0.92375019852294993 0.27282039415738829
--0.54001796879892028 -0.83986385056568236 0.054857140713616921  -0.54106674669697552 -0.83909253130010475 0.05630718901821994
--0.43765447584202588 -0.8962672300889245 0.071858277492354974  -0.4366583353262784 -0.89666746009116993 0.072917516439698196
--0.26026494835742225 -0.96471929550963276 -0.039734588558411582  -0.25990051397960151 -0.96481986879326076 -0.0396779991291649
--0.32271058904772337 -0.94330265629374277 0.077704403643809677  -0.32203490693742848 -0.94351526412634279 0.077926023088562835
--0.069452331980627585 -0.9168554803037775 -0.39313153246640237  -0.069774081725103021 -0.91693066884564145 -0.39289912961179146
--0.13624095340381404 -0.9506072962094394 -0.27889813733511903  -0.13594944033505715 -0.95064905270461686 -0.27889806070390516
--0.13192856911395229 -0.99043061207734606 -0.040522281668716874  -0.13176921185868212 -0.99044963097837846 -0.040575895565417582
--0.19937696972895624 -0.96679589706089264 -0.15985780358782284  -0.19913925651268632 -0.96680424297825784 -0.16010344242024357
--0.033903577486650918 -0.48516082808530342 -0.87376742805233332  -0.034313951497558351 -0.48348770334523589 -0.87467833713118359
--0.11626913535565189 -0.55392361119767786 -0.82440895259656954  -0.11760246779863211 -0.55440616112166108 -0.82389530164822189
--0.135836225526941 -0.719915307065364 -0.68063975088704354  -0.13609530337963674 -0.72008099426245631 -0.68041269101920543
--0.19300544019554747 -0.62457262167826666 -0.75674166021493738  -0.1935882745811939 -0.62484261256047813 -0.75636980999592551
-0.069452331980627585 -0.9168554803037775 -0.39313153246640237  0.069401954456725076 -0.9167006815456431 -0.39350124418016769
-0 -0.86640575634619166 -0.49934063060218076  0.00015872199696750577 -0.86652958223713716 -0.49912569350341018
--0.20731239180326447 -0.78076816785433134 -0.58942568680894825  -0.20735457304096652 -0.78085960551688727 -0.58928970592655827
--0.069740197633308854 -0.80047234067491879 -0.59529852733606159  -0.069662907281838451 -0.8006753695037262 -0.59503447968929801
--0.054857140713616921 -0.54001796879892028 -0.83986385056568236  -0.0567929941448857 -0.53979489236345579 -0.83987858050695885
-0 -0.62578188869003271 -0.77999809473327264  -0.00023519417927802882 -0.62694312538533059 -0.77906499229253756
-0.20012814034344359 -0.68018071850695239 -0.70519707714513447  0.20029565457621396 -0.68040299513329183 -0.7049350430866177
-0.067277074024322203 -0.70227702532207648 -0.70871769768752158  0.067501320615791602 -0.70276863564904046 -0.7082088791190847
-0.58417903277383187 0.11307342108777625 0.80253395542112949  0.59478368364253731 0.11477033531295872 0.79565076497466225
-0.45126666560725864 -0.58750761901107262 -0.67170915887432026  0.45142526361231183 -0.58763152153322762 -0.67149417441486303
-0.27287882084494514 -0.74024588618561449 -0.61446983418191203  0.27300775118978016 -0.74028370995146797 -0.61436698850995408
-0.32839555720531111 -0.64061453708709615 -0.69409608332024086  0.32871571883365175 -0.64057192708348332 -0.69398384882087005
-0.83986385056568236 0.054857140713616914 -0.54001796879892028  0.83909253130010808 0.056307189018238654 -0.54106674669696841
-0.77999809473327264 0 -0.62578188869003271  0.77906499229247361 0.00023519417921545848 -0.62694312538540997
-0.70519707714513458 -0.20012814034344362 -0.6801807185069525  0.70493504308662136 -0.20029565457622006 -0.68040299513328628
-0.70871769768752158 -0.067277074024322203 -0.70227702532207648  0.7082088791190847 -0.067501320615791602 -0.70276863564904046
-0.60770816150558549 0.10617487126239183 0.78594000042913037  0.59478368364251988 0.1147703353129657 0.79565076497467435
-0.09404663521954322 0.6771336059462687 0.72858929180595311  0.089584884642380763 0.67452766723137114 0.7327939509732706
-0.61446983418191203 -0.27287882084494514 -0.74024588618561449  0.61436698850995386 -0.27300775118977944 -0.74028370995146842
-0.095572989323982643 0.66096525556418151 0.74328545761836984  0.089584884642378876 0.67452766723138347 0.73279395097325939
-0.8189102873387164 0 -0.57392154628557113  0.81788534298629767 0.00078604920686769326 -0.57538069819453486
-0.43210633013751587 0.18610643753537565 0.88125255845135109  0.42585755017737748 0.18423339416733694 0.88583486239281939
-0.44478929974988746 0.17773204761375266 0.87689701064830428  0.29734765556272624 0.2570794374759548 0.91950776753565111
-0.17773204761375266 0.87689701064830428 0.44478929974988746  0.25707943747595702 0.91950776753565056 0.29734765556272574
-0.18610643753537565 0.88125255845135109 0.43210633013751576  0.18423339416734003 0.88583486239282005 0.42585755017737459
-0.90688305806336122 0.29107512591583123 0.30186484921791512  0.90562084821138122 0.30687826798315732 0.29270566773562112
-0.90641151615731874 0.31222404809805687 0.28115084502736221  0.90562084821138256 0.30687826798314766 0.29270566773562745
-0.49724573572225761 0.14854713354961635 0.85435218642293975  0.4950182210878013 0.18463389628077642 0.84903903628469779
-0.83986385056568236 0.054857140713616914 0.54001796879892028  0.83909253130010686 0.056307189018238085 0.54106674669697041
-0.37520377518580433 0.22681489975349645 0.89805158744476099  0.36748531964499009 0.23977066491307367 0.89859032272363248
-0.3390347444358186 0.25671454238163 0.90442701067601727  0.33091024020102594 0.23862737818799426 0.91299254504580885
-0.32286639405373108 0.271410708194047 0.90595336478045685  0.30990719304796632 0.27087574504909739 0.91136373772562795
-0.28910030252843322 0.30397342055421106 0.90687073458352596  0.28893990864389041 0.30244718988224867 0.90831680955776173
-0.24184951424973422 0.35660859546245849 0.90157505838463314  0.24555619785555041 0.36356562872997694 0.89862238304023034
-0.21405999957086966 0.39229183849441451 0.893825128737608  0.22324532177534337 0.39311654818375885 0.89197584375896055
-0.1974660445788706 0.41582096722616779 0.88692657891222382  0.20125623970685266 0.42149610172113156 0.88421545010984026
-3  1604 787 1803
-3  1460 85 1803
-3  838 298 814
-3  840 300 815
-3  832 292 816
-3  844 304 817
-3  846 306 818
-3  848 308 819
-3  850 310 820
-3  842 302 821
-3  897 1434 899
-3  856 316 823
-3  1157 361 858
-3  973 430 1017
-3  2072 968 2344
-3  1059 786 1806
-3  845 305 828
-3  871 331 829
-3  841 301 830
-3  839 299 831
-3  816 276 832
-3  853 313 833
-3  1100 259 1806
-3  1928 786 1807
-3  1844 28 1807
-3  849 309 837
-3  814 274 838
-3  831 291 839
-3  815 275 840
-3  830 290 841
-3  821 281 842
-3  859 319 843
-3  817 277 844
-3  828 288 845
-3  818 278 846
-3  870 330 847
-3  819 279 848
-3  837 297 849
-3  820 280 850
-3  863 323 851
-3  1156 1157 858
-3  833 293 853
-3  822 282 854
-3  869 329 855
-3  823 283 856
-3  864 324 857
-3  824 284 858
-3  843 303 859
-3  858 1161 1156
-3  2330 1165 1164
-3  1166 1167 758
-3  851 311 863
-3  857 317 864
-3  866 326 865
-3  865 325 866
-3  868 328 867
-3  867 327 868
-3  855 315 869
-3  847 307 870
-3  829 289 871
-3  1244 785 1808
-3  880 340 873
-3  877 337 874
-3  907 258 1808
-3  879 339 876
-3  874 334 877
-3  881 341 878
-3  876 336 879
-3  873 333 880
-3  878 338 881
-3  885 345 882
-3  890 350 883
-3  887 347 884
-3  882 342 885
-3  889 349 886
-3  884 344 887
-3  891 351 888
-3  886 346 889
-3  883 343 890
-3  888 348 891
-3  1168 1170 1634
-3  952 537 1274
-3  2072 1275 953
-3  969 1173 1301
-3  822 1302 967
-3  822 1303 1302
-3  971 1669 1306
-3  473 1307 972
-3  473 1309 1307
-3  2077 1312 634
-3  1542 785 1809
-3  1518 430 973
-3  937 397 904
-3  962 422 905
-3  989 449 906
-3  978 438 907
-3  929 389 908
-3  982 442 909
-3  925 385 910
-3  942 402 911
-3  931 391 912
-3  954 414 913
-3  433 1437 2267
-3  916 376 915
-3  915 375 916
-3  1604 85 1809
-3  975 435 918
-3  1181 784 1810
-3  1244 258 1810
-3  946 406 921
-3  945 405 922
-3  924 384 923
-3  923 383 924
-3  910 370 925
-3  991 451 926
-3  928 388 927
-3  927 387 928
-3  908 368 929
-3  987 447 930
-3  912 372 931
-3  951 411 932
-3  966 426 933
-3  965 425 934
-3  936 396 935
-3  935 395 936
-3  904 364 937
-3  979 439 938
-3  940 400 939
-3  939 399 940
-3  988 448 941
-3  911 371 942
-3  944 404 943
-3  943 403 944
-3  922 382 945
-3  921 381 946
-3  948 408 947
-3  947 407 948
-3  974 434 949
-3  1444 433 950
-3  932 392 951
-3  1090 433 1444
-3  2267 1448 1232
-3  913 373 954
-3  956 416 955
-3  955 415 956
-3  986 446 957
-3  985 445 958
-3  960 420 959
-3  959 419 960
-3  976 436 961
-3  905 365 962
-3  964 424 963
-3  963 423 964
-3  934 394 965
-3  933 393 966
-3  1299 768 1449
-3  1088 2141 1452
-3  1232 1513 692
-3  1445 1515 1451
-3  1434 898 53
-3  1525 1377 759
-3  1197 1529 1268
-3  949 409 974
-3  918 378 975
-3  961 421 976
-3  980 440 977
-3  907 367 978
-3  938 398 979
-3  977 437 980
-3  984 444 981
-3  909 369 982
-3  990 450 983
-3  981 441 984
-3  958 418 985
-3  957 417 986
-3  930 390 987
-3  941 401 988
-3  906 366 989
-3  983 443 990
-3  926 386 991
-3  2216 784 1811
-3  2088 11 1811
-3  577 994 2057
-3  1122 582 995
-3  1219 679 996
-3  1126 586 997
-3  1227 687 998
-3  1130 590 999
-3  1195 655 1000
-3  1114 574 1001
-3  1243 703 1002
-3  1138 598 1003
-3  1251 711 1004
-3  1142 602 1005
-3  1259 719 1006
-3  1146 606 1007
-3  1267 727 1008
-3  1150 610 1009
-3  1235 695 1010
-3  1134 594 1011
-3  1283 743 1012
-3  1158 618 1013
-3  1291 751 1014
-3  1162 622 1015
-3  1754 759 1016
-3  1152 1530 623
-3  2328 1531 2336
-3  494 1556 1171
-3  1160 1663 2336
-3  1517 2328 692
-3  1082 783 1954
-3  980 257 1954
-3  1247 707 1024
-3  1242 702 1025
-3  1351 811 1026
-3  1346 806 1027
-3  1231 691 1028
-3  1226 686 1029
-3  1223 683 1030
-3  1218 678 1031
-3  1131 591 1032
-3  1230 690 1033
-3  1279 739 1034
-3  79 1761 2334
-3  2346 1036 1909
-3  1198 658 1037
-3  827 1038 1766
-3  1318 778 1039
-3  1688 783 1955
-3  1442 84 1955
-3  1263 723 1042
-3  1258 718 1043
-3  1123 583 1044
-3  1214 674 1045
-3  1191 651 1046
-3  1350 810 1047
-3  1127 587 1048
-3  1222 682 1049
-3  1187 647 1050
-3  1342 802 1051
-3  1151 611 1052
-3  1270 730 1053
-3  2334 1762 1415
-3  1298 758 1055
-3  1135 595 1056
-3  1238 698 1057
-3  1179 639 1058
-3  1326 786 1059
-3  1139 599 1060
-3  1246 706 1061
-3  1347 807 1062
-3  1190 650 1063
-3  1143 603 1064
-3  1254 714 1065
-3  1215 675 1066
-3  1210 670 1067
-3  1147 607 1068
-3  1262 722 1069
-3  1319 779 1070
-3  1314 774 1071
-3  430 1518 970
-3  1755 1763 1378
-3  1199 659 1074
-3  1194 654 1075
-3  1635 1298 1764
-3  8 5 1434
-3  1343 803 1078
-3  1338 798 1079
-3  1159 619 1080
-3  1286 746 1081
-3  1323 783 1082
-3  1178 638 1083
-3  1163 623 1084
-3  1294 754 1085
-3  1239 699 1086
-3  1234 694 1087
-3  5 898 1434
-3  897 8 1434
-3  623 1153 1152
-3  113 9 22
-3  113 22 896
-3  113 900 9
-3  1271 731 1094
-3  1266 726 1095
-3  1295 755 1096
-3  1290 750 1097
-3  1331 791 1098
-3  1182 642 1099
-3  1327 787 1100
-3  1322 782 1101
-3  1339 799 1102
-3  1186 646 1103
-3  1335 795 1104
-3  1330 790 1105
-3  1287 747 1106
-3  1282 742 1107
-3  1255 715 1108
-3  1250 710 1109
-3  1183 643 1110
-3  1334 794 1111
-3  1101 782 1958
-3  635 1872 1113
-3  1001 461 1114
-3  1036 496 1115
-3  1121 581 1116
-3  1082 257 1958
-3  1892 782 1962
-3  1928 28 1962
-3  1125 585 1120
-3  1116 576 1121
-3  1328 781 1964
-3  1044 504 1123
-3  1129 589 1124
-3  1120 580 1125
-3  997 457 1126
-3  1048 508 1127
-3  961 256 1964
-3  1124 584 1129
-3  999 459 1130
-3  1032 492 1131
-3  1137 597 1132
-3  1148 608 1133
-3  1011 471 1134
-3  1056 516 1135
-3  1141 601 1136
-3  1132 592 1137
-3  1003 463 1138
-3  1060 520 1139
-3  1145 605 1140
-3  1136 596 1141
-3  1005 465 1142
-3  1064 524 1143
-3  1149 609 1144
-3  1140 600 1145
-3  1007 467 1146
-3  1068 528 1147
-3  1133 593 1148
-3  1144 604 1149
-3  1009 469 1150
-3  1052 512 1151
-3  25 1279 26
-3  26 1279 903
-3  901 1279 25
-3  1519 42 53
-3  42 1514 53
-3  1514 1634 53
-3  1013 473 1158
-3  1080 540 1159
-3  44 2129 1268
-3  1200 2129 44
-3  1015 475 1162
-3  1084 544 1163
-3  45 1883 46
-3  46 1883 822
-3  822 967 46
-3  970 72 1018
-3  970 1518 72
-3  80 1013 175
-3  175 1381 80
-3  634 81 1035
-3  1650 781 1965
-3  379 2058 1173
-3  634 1312 81
-3  1038 498 1175
-3  1241 701 1176
-3  1292 752 1177
-3  1083 543 1178
-3  1058 518 1179
-3  1345 805 1180
-3  1324 784 1181
-3  1099 559 1182
-3  1110 570 1183
-3  1225 685 1184
-3  1332 792 1185
-3  1103 563 1186
-3  1050 510 1187
-3  1217 677 1188
-3  1252 712 1189
-3  1063 523 1190
-3  1046 506 1191
-3  1229 689 1192
-3  1276 736 1193
-3  1075 535 1194
-3  1000 460 1195
-3  1512 82 1054
-3  1512 1315 82
-3  332 1198 1836
-3  1074 534 1199
-3  1671 1197 657
-3  294 1172 2068
-3  1688 84 1965
-3  1289 780 1966
-3  1317 777 1204
-3  1328 256 1966
-3  1775 780 1967
-3  2304 7 1967
-3  1070 779 2074
-3  834 2064 1209
-3  1067 527 1210
-3  994 454 1211
-3  1257 717 1212
-3  1216 676 1213
-3  1045 505 1214
-3  1066 526 1215
-3  1213 673 1216
-3  1188 648 1217
-3  1031 491 1218
-3  996 456 1219
-3  1349 809 1220
-3  1224 684 1221
-3  1049 509 1222
-3  1030 490 1223
-3  1221 681 1224
-3  1184 644 1225
-3  1029 489 1226
-3  998 458 1227
-3  1341 801 1228
-3  1192 652 1229
-3  1033 493 1230
-3  1028 488 1231
-3  1269 729 1232
-3  1300 760 1233
-3  1087 547 1234
-3  1010 470 1235
-3  1297 757 1236
-3  1240 700 1237
-3  1057 517 1238
-3  1086 546 1239
-3  1237 697 1240
-3  1176 636 1241
-3  1025 485 1242
-3  1002 462 1243
-3  1325 785 1244
-3  1248 708 1245
-3  1061 521 1246
-3  1024 484 1247
-3  1245 705 1248
-3  1344 804 1249
-3  1109 569 1250
-3  1004 464 1251
-3  1189 649 1252
-3  1256 716 1253
-3  1065 525 1254
-3  1108 568 1255
-3  1253 713 1256
-3  1212 672 1257
-3  1043 503 1258
-3  1006 466 1259
-3  918 255 2074
-3  1264 724 1261
-3  1069 529 1262
-3  1042 502 1263
-3  1261 721 1264
-3  1316 776 1265
-3  1095 555 1266
-3  1008 468 1267
-3  104 2076 1313
-3  1232 692 1269
-3  1053 513 1270
-3  1094 554 1271
-3  634 1313 2076
-3  1076 105 1758
-3  105 1433 1758
-3  253 106 1089
-3  1193 653 1276
-3  1280 740 1277
-3  253 1379 106
-3  1034 494 1279
-3  1277 737 1280
-3  1340 800 1281
-3  1107 567 1282
-3  1012 472 1283
-3  1337 797 1284
-3  1288 748 1285
-3  1081 541 1286
-3  1106 566 1287
-3  1285 745 1288
-3  1320 780 1289
-3  1097 557 1290
-3  1014 474 1291
-3  1177 637 1292
-3  1296 756 1293
-3  1085 545 1294
-3  1096 556 1295
-3  1293 753 1296
-3  1236 696 1297
-3  1055 515 1298
-3  1521 132 177
-3  1233 693 1300
-3  132 1273 1523
-3  132 1523 177
-3  134 1084 1091
-3  1557 1304 771
-3  1084 134 177
-3  1436 140 950
-3  140 1444 950
-3  1564 779 2075
-3  1513 141 692
-3  141 1665 692
-3  1164 142 2330
-3  142 172 2330
-3  172 1628 2330
-3  1071 531 1314
-3  173 1197 1671
-3  1265 725 1316
-3  1204 664 1317
-3  1430 83 2075
-3  1070 530 1319
-3  1289 749 1320
-3  1328 788 1321
-3  1101 561 1322
-3  1082 542 1323
-3  1181 641 1324
-3  1244 704 1325
-3  1059 519 1326
-3  1100 560 1327
-3  1321 781 1328
-3  1336 796 1329
-3  1105 565 1330
-3  1098 558 1331
-3  1185 645 1332
-3  1348 808 1333
-3  1111 571 1334
-3  1104 564 1335
-3  1329 789 1336
-3  1284 744 1337
-3  1079 539 1338
-3  1102 562 1339
-3  1281 741 1340
-3  1228 688 1341
-3  1051 511 1342
-3  1078 538 1343
-3  1249 709 1344
-3  1180 640 1345
-3  1027 487 1346
-3  1062 522 1347
-3  1333 793 1348
-3  1220 680 1349
-3  1047 507 1350
-3  1026 486 1351
-3  1039 778 2078
-3  1070 255 2078
-3  1868 778 2130
-3  1804 27 2130
-3  1819 505 1356
-3  2166 679 1357
-3  1827 509 1358
-3  2182 687 1359
-3  1795 493 1360
-3  2118 655 1361
-3  1843 517 1362
-3  2214 703 1363
-3  1851 521 1364
-3  2230 711 1365
-3  1859 525 1366
-3  2246 719 1367
-3  1867 529 1368
-3  2262 727 1369
-3  1835 513 1370
-3  2198 695 1371
-3  1883 537 1372
-3  2294 743 1373
-3  1891 541 1374
-3  2310 751 1375
-3  1899 545 1376
-3  2326 759 1377
-3  1529 1197 173
-3  174 657 1634
-3  1169 657 174
-3  2285 176 1174
-3  1204 777 2132
-3  949 254 2132
-3  1847 519 1384
-3  2222 707 1385
-3  1951 571 1386
-3  1202 811 1387
-3  1831 511 1388
-3  2190 691 1389
-3  1823 507 1390
-3  2174 683 1391
-3  1731 461 1392
-3  1990 591 1393
-3  1879 535 1394
-3  2286 739 1395
-3  1626 777 2133
-3  1564 83 2133
-3  1265 776 2134
-3  1204 254 2134
-3  2136 776 2135
-3  2256 4 2135
-3  1863 527 1402
-3  2254 723 1403
-3  1723 457 1404
-3  1974 583 1405
-3  1791 491 1406
-3  2110 651 1407
-3  1727 459 1408
-3  1982 587 1409
-3  1787 489 1410
-3  2102 647 1411
-3  1751 471 1412
-3  2030 611 1413
-3  1903 547 1414
-3  1762 2334 1632
-3  1735 463 1416
-3  1998 595 1417
-3  1779 485 1418
-3  2086 639 1419
-3  1739 465 1420
-3  2006 599 1421
-3  1947 569 1422
-3  1353 807 1423
-3  1743 467 1424
-3  2014 603 1425
-3  1815 503 1426
-3  2158 675 1427
-3  1747 469 1428
-3  2022 607 1429
-3  1919 555 1430
-3  2075 779 1431
-3  2285 1272 176
-3  43 178 1072
-3  899 1434 1799
-3  2126 659 1435
-3  1763 1755 549
-3  43 1673 178
-3  1943 567 1438
-3  1399 803 1439
-3  1759 475 1440
-3  2046 619 1441
-3  1923 557 1442
-3  1955 783 1443
-3  952 179 537
-3  179 914 537
-3  1839 515 1446
-3  2206 699 1447
-3  914 1077 537
-3  181 180 1077
-3  180 1196 1077
-3  914 181 1077
-3  1092 194 2344
-3  194 232 2344
-3  1871 531 1454
-3  2270 731 1455
-3  1895 543 1456
-3  2318 755 1457
-3  1931 561 1458
-3  1715 791 1459
-3  1927 559 1460
-3  1803 787 1461
-3  1939 565 1462
-3  1488 799 1463
-3  1935 563 1464
-3  1568 795 1465
-3  1887 539 1466
-3  2302 747 1467
-3  1855 523 1468
-3  2238 715 1469
-3  1783 487 1470
-3  2094 643 1471
-3  938 259 1802
-3  1380 253 762
-3  1987 589 1474
-3  1730 461 1475
-3  1975 583 1476
-3  1970 581 1477
-3  1100 787 1802
-3  1967 7 1775
-3  1983 587 1480
-3  1978 585 1481
-3  1071 774 2141
-3  1379 2141 533
-3  1991 591 1484
-3  1986 589 1485
-3  1971 581 1486
-3  1722 457 1487
-3  1908 774 2142
-3  1868 27 2142
-3  1979 585 1490
-3  1726 459 1491
-3  2007 599 1492
-3  2002 597 1493
-3  2027 609 1494
-3  1750 471 1495
-3  2015 603 1496
-3  2010 601 1497
-3  1995 593 1498
-3  1734 463 1499
-3  2023 607 1500
-3  2018 605 1501
-3  2003 597 1502
-3  1738 465 1503
-3  2031 611 1504
-3  2026 609 1505
-3  2011 601 1506
-3  1742 467 1507
-3  1999 595 1508
-3  1994 593 1509
-3  2019 605 1510
-3  1746 469 1511
-3  2047 619 1512
-3  232 230 2344
-3  230 1449 2344
-3  1018 233 970
-3  233 1760 970
-3  2047 247 1020
-3  2047 1535 247
-3  1073 248 550
-3  248 1452 550
-3  249 1077 1196
-3  1077 249 2285
-3  1758 475 1523
-3  1883 250 251
-3  1883 251 1274
-3  1883 1278 250
-3  494 252 903
-3  494 1171 252
-3  285 1758 1433
-3  1758 285 43
-3  1273 286 1523
-3  1566 788 1775
-3  1336 260 1774
-3  286 1528 1523
-3  312 183 1760
-3  2215 703 1536
-3  2210 701 1537
-3  2315 753 1538
-3  1894 543 1539
-3  1352 807 1540
-3  1383 805 1541
-3  1808 785 1542
-3  1926 559 1543
-3  2183 687 1544
-3  2178 685 1545
-3  1668 793 1546
-3  1934 563 1547
-3  2167 679 1548
-3  2162 677 1549
-3  2235 713 1550
-3  1854 523 1551
-3  2191 691 1552
-3  2186 689 1553
-3  2283 737 1554
-3  1878 535 1555
-3  1019 183 312
-3  318 314 1799
-3  1321 788 1774
-3  1696 86 1773
-3  2127 659 1560
-3  2122 657 1561
-3  1682 789 1773
-3  977 260 1772
-3  2074 779 1564
-3  2133 777 1565
-3  1336 789 1772
-3  1936 29 1719
-3  1924 790 1719
-3  1098 261 1718
-3  2251 721 1570
-3  1862 527 1571
-3  2247 719 1572
-3  2242 717 1573
-3  2163 677 1574
-3  1818 505 1575
-3  2159 675 1576
-3  2154 673 1577
-3  2107 649 1578
-3  1790 491 1579
-3  1201 811 1580
-3  1207 809 1581
-3  2179 685 1582
-3  1826 509 1583
-3  2175 683 1584
-3  2170 681 1585
-3  2099 645 1586
-3  1786 489 1587
-3  1398 803 1588
-3  1473 801 1589
-3  2115 653 1590
-3  1794 493 1591
-3  2271 731 1592
-3  2266 729 1593
-3  2331 761 1594
-3  1902 547 1595
-3  2327 759 1596
-3  2322 757 1597
-3  2211 701 1598
-3  1842 517 1599
-3  2207 699 1600
-3  2202 697 1601
-3  2083 637 1602
-3  1778 485 1603
-3  1802 787 1604
-3  1809 785 1605
-3  2227 709 1606
-3  1850 521 1607
-3  2223 707 1608
-3  2218 705 1609
-3  1382 805 1610
-3  1946 569 1611
-3  2111 651 1612
-3  2106 649 1613
-3  2243 717 1614
-3  1858 525 1615
-3  2239 715 1616
-3  2234 713 1617
-3  2155 673 1618
-3  1814 503 1619
-3  1105 790 1718
-3  1458 86 1715
-3  2259 725 1622
-3  1866 529 1623
-3  2255 723 1624
-3  2250 721 1625
-3  2132 777 1626
-3  1918 555 1627
-3  314 899 1799
-3  895 318 1799
-3  2195 693 1630
-3  1834 513 1631
-3  321 320 322
-3  320 1084 322
-3  1170 174 1634
-3  321 1084 320
-3  2119 655 1636
-3  2114 653 1637
-3  2291 741 1638
-3  1882 537 1639
-3  2287 739 1640
-3  2282 737 1641
-3  1472 801 1642
-3  1942 567 1643
-3  1482 799 1644
-3  1562 797 1645
-3  2307 749 1646
-3  1890 541 1647
-3  2303 747 1648
-3  2298 745 1649
-3  1964 781 1650
-3  1922 557 1651
-3  2087 639 1652
-3  2082 637 1653
-3  2323 757 1654
-3  1898 545 1655
-3  2319 755 1656
-3  2314 753 1657
-3  2203 697 1658
-3  1838 515 1659
-3  2199 695 1660
-3  2194 693 1661
-3  322 1084 623
-3  1091 1084 321
-3  1232 352 353
-3  1232 353 1154
-3  1232 1448 352
-3  355 354 1377
-3  1696 791 1715
-3  984 261 1714
-3  354 1527 1377
-3  1525 355 1377
-3  356 824 357
-3  357 824 1155
-3  2267 729 1674
-3  1870 531 1675
-3  2263 727 1676
-3  2258 725 1677
-3  1098 791 1714
-3  2096 10 1713
-3  2311 751 1680
-3  2306 749 1681
-3  1772 789 1682
-3  1930 561 1683
-3  2095 643 1684
-3  2090 641 1685
-3  2219 705 1686
-3  1846 519 1687
-3  1954 783 1688
-3  1965 781 1689
-3  1558 797 1690
-3  1938 565 1691
-3  2103 647 1692
-3  2098 645 1693
-3  1206 809 1694
-3  1950 571 1695
-3  1714 791 1696
-3  1773 789 1697
-3  2299 745 1698
-3  1886 539 1699
-3  2295 743 1700
-3  2290 741 1701
-3  2187 689 1702
-3  1830 511 1703
-3  2231 711 1704
-3  2226 709 1705
-3  2091 641 1706
-3  1782 487 1707
-3  1567 795 1708
-3  1678 793 1709
-3  2171 681 1710
-3  1822 507 1711
-3  1308 792 1713
-3  1348 262 1712
-3  1185 792 1712
-3  1708 87 1678
-3  2149 670 1716
-3  1972 582 1717
-3  482 1483 33
-3  1301 1173 768
-3  2165 678 1720
-3  1980 586 1721
-3  1487 339 1722
-3  1404 298 1723
-3  2181 686 1724
-3  1988 590 1725
-3  1491 341 1726
-3  1408 300 1727
-3  2117 654 1728
-3  1956 574 1729
-3  1475 333 1730
-3  1392 292 1731
-3  2213 702 1732
-3  2004 598 1733
-3  1499 345 1734
-3  1416 304 1735
-3  2229 710 1736
-3  2012 602 1737
-3  1503 347 1738
-3  1420 306 1739
-3  2245 718 1740
-3  2020 606 1741
-3  1507 349 1742
-3  1424 308 1743
-3  2261 726 1744
-3  2028 610 1745
-3  1511 351 1746
-3  1428 310 1747
-3  2197 694 1748
-3  1996 594 1749
-3  1495 343 1750
-3  1412 302 1751
-3  2293 742 1752
-3  2044 618 1753
-3  824 356 1445
-3  358 2077 1310
-3  2309 750 1756
-3  2052 622 1757
-3  1021 2077 358
-3  1440 316 1759
-3  1670 2325 412
-3  359 759 1754
-3  1526 759 359
-3  360 824 361
-3  361 824 858
-3  1155 824 360
-3  1311 363 175
-3  363 1381 175
-3  1299 374 768
-3  374 1301 768
-3  2325 410 412
-3  410 2325 758
-3  1546 793 1678
-3  1449 768 2344
-3  1092 2344 968
-3  909 262 1668
-3  2221 706 1776
-3  2212 702 1777
-3  1603 397 1778
-3  1418 305 1779
-3  1203 810 1780
-3  1355 806 1781
-3  1707 449 1782
-3  1470 331 1783
-3  2189 690 1784
-3  2180 686 1785
-3  1587 389 1786
-3  1410 301 1787
-3  2173 682 1788
-3  2164 678 1789
-3  1579 385 1790
-3  1406 299 1791
-3  1989 590 1792
-3  2188 690 1793
-3  1591 391 1794
-3  1360 276 1795
-3  758 1167 410
-3  1524 413 2329
-3  413 1522 2329
-3  1434 313 1799
-3  1957 574 1800
-3  2124 658 1801
-3  155 1559 2140
-3  1348 793 1668
-3  2077 634 1804
-3  2130 778 1805
-3  1117 1679 435
-3  1948 29 1620
-3  1936 794 1620
-3  1104 263 1569
-3  1111 794 1569
-3  1464 87 1568
-3  2253 722 1812
-3  2244 718 1813
-3  1619 405 1814
-3  1426 309 1815
-3  1973 582 1816
-3  2156 674 1817
-3  1575 383 1818
-3  1356 274 1819
-3  2109 650 1820
-3  1205 810 1821
-3  1711 451 1822
-3  1390 291 1823
-3  1981 586 1824
-3  2172 682 1825
-3  1583 387 1826
-3  1358 275 1827
-3  2101 646 1828
-3  1401 802 1829
-3  1703 447 1830
-3  1388 290 1831
-3  2029 610 1832
-3  2268 730 1833
-3  1631 411 1834
-3  1370 281 1835
-3  1522 1304 2329
-3  427 1016 2325
-3  1659 425 1838
-3  1446 319 1839
-3  1997 594 1840
-3  2204 698 1841
-3  1599 395 1842
-3  1362 277 1843
-3  2085 638 1844
-3  1807 786 1845
-3  1687 439 1846
-3  1384 288 1847
-3  2005 598 1848
-3  2220 706 1849
-3  1607 399 1850
-3  1364 278 1851
-3  1354 806 1852
-3  2108 650 1853
-3  1551 371 1854
-3  1468 330 1855
-3  2013 602 1856
-3  2236 714 1857
-3  1615 403 1858
-3  1366 279 1859
-3  2157 674 1860
-3  2148 670 1861
-3  1571 381 1862
-3  1402 297 1863
-3  2021 606 1864
-3  2252 722 1865
-3  1623 407 1866
-3  1368 280 1867
-3  2078 778 1868
-3  2142 774 1869
-3  1675 433 1870
-3  1454 323 1871
-3  2325 1667 427
-3  428 2329 1663
-3  429 2329 428
-3  1524 2329 429
-3  2125 658 1876
-3  2116 654 1877
-3  1555 373 1878
-3  1394 293 1879
-3  431 175 2047
-3  2047 1020 431
-3  1639 415 1882
-3  1372 282 1883
-3  1400 802 1884
-3  1533 798 1885
-3  1699 445 1886
-3  1466 329 1887
-3  2045 618 1888
-3  2300 746 1889
-3  1647 419 1890
-3  1374 283 1891
-3  1958 782 1892
-3  2084 638 1893
-3  1539 365 1894
-3  1456 324 1895
-3  2053 622 1896
-3  2316 754 1897
-3  1655 423 1898
-3  1376 284 1899
-3  2205 698 1900
-3  2196 694 1901
-3  1595 393 1902
-3  1414 303 1903
-3  1019 432 183
-3  432 1310 183
-3  900 113 1279
-3  1528 476 1523
-3  2141 774 1908
-3  1662 2076 104
-3  476 477 1523
-3  477 1076 1758
-3  477 1758 1523
-3  2267 478 479
-3  478 480 479
-3  2267 479 1093
-3  2269 730 1916
-3  2260 726 1917
-3  1627 409 1918
-3  1430 311 1919
-3  2317 754 1920
-3  2308 750 1921
-3  1651 421 1922
-3  1442 317 1923
-3  1718 790 1924
-3  2092 642 1925
-3  1543 367 1926
-3  1460 326 1927
-3  1806 786 1928
-3  1962 782 1929
-3  1683 437 1930
-3  1458 325 1931
-3  1532 798 1932
-3  2100 646 1933
-3  1547 369 1934
-3  1464 328 1935
-3  1569 794 1936
-3  1719 790 1937
-3  1691 441 1938
-3  1462 327 1939
-3  2301 746 1940
-3  2292 742 1941
-3  1643 417 1942
-3  1438 315 1943
-3  2237 714 1944
-3  2228 710 1945
-3  1611 401 1946
-3  1422 307 1947
-3  2093 642 1948
-3  1620 794 1949
-3  1695 443 1950
-3  1386 289 1951
-3  1961 576 1952
-3  1984 588 1953
-3  2350 1489 2043
-3  1708 795 1568
-3  1729 460 1956
-3  1800 496 1957
-3  990 263 1567
-3  54 1959 2348
-3  1969 580 1960
-3  1952 572 1961
-3  1104 795 1567
-3  661 337 2123
-3  1775 7 1566
-3  2296 796 1566
-3  1284 264 1563
-3  1329 796 1563
-3  1977 584 1968
-3  1960 576 1969
-3  1477 334 1970
-3  1486 339 1971
-3  1717 454 1972
-3  1816 504 1973
-3  1405 298 1974
-3  1476 334 1975
-3  1985 588 1976
-3  1968 580 1977
-3  1481 336 1978
-3  1490 341 1979
-3  1721 456 1980
-3  1824 508 1981
-3  1409 300 1982
-3  1480 336 1983
-3  1953 572 1984
-3  1976 584 1985
-3  1485 338 1986
-3  1474 333 1987
-3  1725 458 1988
-3  1792 492 1989
-3  1393 292 1990
-3  1484 338 1991
-3  2001 596 1992
-3  2024 608 1993
-3  1509 350 1994
-3  1498 345 1995
-3  1749 470 1996
-3  1840 516 1997
-3  1417 304 1998
-3  1508 350 1999
-3  2009 600 2000
-3  1992 592 2001
-3  1493 342 2002
-3  1502 347 2003
-3  1733 462 2004
-3  1848 520 2005
-3  1421 306 2006
-3  1492 342 2007
-3  2017 604 2008
-3  2000 596 2009
-3  1497 344 2010
-3  1506 349 2011
-3  1737 464 2012
-3  1856 524 2013
-3  1425 308 2014
-3  1496 344 2015
-3  2025 608 2016
-3  2008 600 2017
-3  1501 346 2018
-3  1510 351 2019
-3  1741 466 2020
-3  1864 528 2021
-3  1429 310 2022
-3  1500 346 2023
-3  1993 592 2024
-3  2016 604 2025
-3  1505 348 2026
-3  1494 343 2027
-3  1745 468 2028
-3  1832 512 2029
-3  1413 302 2030
-3  1504 348 2031
-3  2267 480 478
-3  2267 1437 480
-3  1534 481 761
-3  481 1165 2330
-3  481 2330 761
-3  495 2047 514
-3  514 2047 1512
-3  1512 1054 514
-3  1169 532 657
-3  532 1671 657
-3  533 2141 1088
-3  2141 1379 253
-3  1753 472 2044
-3  1888 540 2045
-3  1441 316 2046
-3  1535 2047 495
-3  548 536 1173
-3  536 1306 1173
-3  969 548 1173
-3  549 1755 551
-3  1757 474 2052
-3  1896 544 2053
-3  551 1755 473
-3  473 972 551
-3  552 79 1628
-3  2330 1628 79
-3  612 553 1377
-3  553 1161 858
-3  1527 612 1377
-3  553 858 1377
-3  1662 613 2076
-3  613 1450 2076
-3  1450 550 2076
-3  614 1512 43
-3  43 1072 614
-3  895 1799 113
-3  758 615 1166
-3  758 1666 615
-3  616 494 2285
-3  617 2285 1174
-3  1275 2129 852
-3  2344 768 2073
-3  1644 88 1562
-3  1531 2328 1516
-3  2285 617 616
-3  1804 498 2077
-3  1690 797 1562
-3  501 114 2079
-3  2209 700 2080
-3  2312 752 2081
-3  1653 422 2082
-3  1602 397 2083
-3  1893 542 2084
-3  1844 518 2085
-3  1419 305 2086
-3  1652 422 2087
-3  1396 804 2088
-3  1811 784 2089
-3  1685 438 2090
-3  1706 449 2091
-3  1925 558 2092
-3  1948 570 2093
-3  1471 331 2094
-3  1684 438 2095
-3  2177 684 2096
-3  1713 792 2097
-3  1693 442 2098
-3  1586 389 2099
-3  1933 562 2100
-3  1828 510 2101
-3  1411 301 2102
-3  1692 442 2103
-3  2161 676 2104
-3  2232 712 2105
-3  1613 402 2106
-3  1578 385 2107
-3  1853 522 2108
-3  1820 506 2109
-3  1407 299 2110
-3  1612 402 2111
-3  2185 688 2112
-3  2280 736 2113
-3  1637 414 2114
-3  1590 391 2115
-3  1877 534 2116
-3  1728 460 2117
-3  1361 276 2118
-3  1636 414 2119
-3  1634 620 621
-3  1634 621 1168
-3  1561 376 2122
-3  1634 1514 620
-3  1801 496 2124
-3  1876 534 2125
-3  1435 313 2126
-3  1560 376 2127
-3  1035 624 634
-3  2072 632 2129
-3  981 264 1558
-3  1284 797 1558
-3  1414 79 2334
-3  1884 30 1533
-3  1932 798 1533
-3  1102 265 1532
-3  2134 776 2136
-3  2144 668 2137
-3  1079 798 1532
-3  1118 435 2279
-3  1304 761 2331
-3  933 246 2331
-3  1594 761 2330
-3  1629 79 552
-3  2137 664 2144
-3  2248 720 2145
-3  1233 760 2329
-3  1304 246 2329
-3  1861 526 2148
-3  1716 454 2149
-3  2336 760 2328
-3  1041 2151 573
-3  2241 716 2152
-3  2160 676 2153
-3  1577 384 2154
-3  1618 405 2155
-3  1817 504 2156
-3  1860 526 2157
-3  1427 309 2158
-3  1576 384 2159
-3  2153 672 2160
-3  2104 648 2161
-3  1549 370 2162
-3  1574 383 2163
-3  1789 490 2164
-3  1720 456 2165
-3  1357 274 2166
-3  1548 370 2167
-3  1260 808 2168
-3  2176 684 2169
-3  1585 388 2170
-3  1710 451 2171
-3  1825 508 2172
-3  1788 490 2173
-3  1391 291 2174
-3  1584 388 2175
-3  2169 680 2176
-3  2096 644 2177
-3  1545 368 2178
-3  1582 387 2179
-3  1785 488 2180
-3  1724 458 2181
-3  1359 275 2182
-3  1544 368 2183
-3  1478 800 2184
-3  2112 652 2185
-3  1553 372 2186
-3  1702 447 2187
-3  1793 492 2188
-3  1784 488 2189
-3  1389 290 2190
-3  1552 372 2191
-3  624 1313 634
-3  2328 760 2193
-3  1661 426 2194
-3  1630 411 2195
-3  1901 546 2196
-3  1748 470 2197
-3  1371 281 2198
-3  1660 426 2199
-3  2321 756 2200
-3  2208 700 2201
-3  1601 396 2202
-3  1658 425 2203
-3  1841 516 2204
-3  1900 546 2205
-3  1447 319 2206
-3  1600 396 2207
-3  2201 696 2208
-3  2080 636 2209
-3  1537 364 2210
-3  1598 395 2211
-3  1777 484 2212
-3  1732 462 2213
-3  1363 277 2214
-3  1536 364 2215
-3  1810 784 2216
-3  2224 708 2217
-3  1609 400 2218
-3  1686 439 2219
-3  1849 520 2220
-3  1776 484 2221
-3  1385 288 2222
-3  1608 400 2223
-3  2217 704 2224
-3  1397 804 2225
-3  1705 448 2226
-3  1606 399 2227
-3  1945 568 2228
-3  1736 464 2229
-3  1365 278 2230
-3  1704 448 2231
-3  2105 648 2232
-3  2240 716 2233
-3  1617 404 2234
-3  1550 371 2235
-3  1857 524 2236
-3  1944 568 2237
-3  1469 330 2238
-3  1616 404 2239
-3  2233 712 2240
-3  2152 672 2241
-3  1573 382 2242
-3  1614 403 2243
-3  1813 502 2244
-3  1740 466 2245
-3  1367 279 2246
-3  1572 382 2247
-3  2145 668 2248
-3  2256 724 2249
-3  1625 408 2250
-3  1570 381 2251
-3  1865 528 2252
-3  1812 502 2253
-3  1403 297 2254
-3  1624 408 2255
-3  2249 720 2256
-3  2135 776 2257
-3  1677 434 2258
-3  1622 407 2259
-3  1917 554 2260
-3  1744 468 2261
-3  1369 280 2262
-3  1676 434 2263
-3  625 854 1755
-3  626 854 625
-3  1593 392 2266
-3  1674 433 2267
-3  1833 512 2268
-3  1916 554 2269
-3  1455 323 2270
-3  1592 392 2271
-3  1305 854 626
-3  1380 627 950
-3  627 1436 950
-3  2325 628 1667
-3  2325 1670 628
-3  1304 1522 1520
-3  1415 629 630
-3  1415 630 1633
-3  2113 652 2280
-3  2288 740 2281
-3  1641 416 2282
-3  1554 373 2283
-3  1415 1762 629
-3  1556 494 616
-3  1395 293 2286
-3  1640 416 2287
-3  2281 736 2288
-3  1479 800 2289
-3  1701 446 2290
-3  1638 415 2291
-3  1941 566 2292
-3  1752 472 2293
-3  1373 282 2294
-3  1700 446 2295
-3  1563 796 2296
-3  2304 748 2297
-3  1649 420 2298
-3  1698 445 2299
-3  1889 540 2300
-3  1940 566 2301
-3  1467 329 2302
-3  1648 420 2303
-3  2297 744 2304
-3  1967 780 2305
-3  1681 436 2306
-3  1646 419 2307
-3  1921 556 2308
-3  1756 474 2309
-3  1375 283 2310
-3  1680 436 2311
-3  2081 636 2312
-3  2320 756 2313
-3  1657 424 2314
-3  1538 365 2315
-3  1897 544 2316
-3  1920 556 2317
-3  1457 324 2318
-3  1656 424 2319
-3  2313 752 2320
-3  2200 696 2321
-3  1597 394 2322
-3  1654 423 2323
-3  656 631 1016
-3  631 1754 1016
-3  1377 284 2326
-3  1596 394 2327
-3  2193 692 2328
-3  1663 2329 2336
-3  1672 656 1016
-3  1594 393 2331
-3  732 660 1013
-3  660 728 1013
-3  1415 303 2334
-3  732 728 660
-3  2329 760 2336
-3  728 1309 473
-3  1453 732 1013
-3  728 473 1013
-3  761 733 1534
-3  761 1557 733
-3  550 734 1073
-3  550 1450 734
-3  2073 632 2344
-3  738 735 123
-3  735 1764 123
-3  1664 738 123
-3  762 253 1089
-3  253 1380 950
-3  854 763 822
-3  763 1303 822
-3  1305 764 854
-3  764 763 854
-3  1432 765 177
-3  765 1521 177
-3  1869 530 2142
-3  1908 550 2141
-3  971 766 1669
-3  766 767 1669
-3  2257 724 2135
-3  2136 664 2134
-3  1565 378 2133
-3  1626 409 2132
-3  1805 498 2130
-3  1868 530 2078
-3  1431 311 2075
-3  1564 378 2074
-3  2305 748 1967
-3  1775 788 1966
-3  1689 440 1965
-3  1650 421 1964
-3  1929 560 1962
-3  1892 542 1958
-3  1443 317 1955
-3  1688 440 1954
-3  2089 640 1811
-3  2216 704 1810
-3  1605 398 1809
-3  1542 367 1808
-3  1845 518 1807
-3  1928 560 1806
-3  1461 326 1803
-3  1604 398 1802
-3  1966 780 1775
-3  1566 796 1774
-3  1697 444 1773
-3  1682 437 1772
-3  1937 564 1719
-3  1924 558 1718
-3  1459 325 1715
-3  1696 444 1714
-3  2097 644 1713
-3  1308 808 1712
-3  1709 450 1678
-3  1546 369 1668
-3  1949 570 1620
-3  1936 564 1569
-3  1465 328 1568
-3  1708 450 1567
-3  1774 788 1566
-3  2296 744 1563
-3  1645 418 1562
-3  1690 441 1558
-3  1885 538 1533
-3  1932 562 1532
-3  1463 327 1488
-3  1644 418 1482
-3  2289 740 1479
-3  2184 688 1478
-3  1589 390 1473
-3  1642 417 1472
-3  1829 510 1401
-3  1884 538 1400
-3  1439 315 1399
-3  1588 390 1398
-3  2225 708 1397
-3  2088 640 1396
-3  1541 366 1383
-3  1610 401 1382
-3  1781 486 1355
-3  1852 522 1354
-3  1423 307 1353
-3  1540 366 1352
-3  1712 792 1308
-3  2168 680 1260
-3  1581 386 1207
-3  1694 443 1206
-3  1821 506 1205
-3  1780 486 1203
-3  1387 289 1202
-3  1580 386 1201
-3  1462 88 1488
-3  1016 759 2327
-3  934 245 2327
-3  1596 759 2326
-3  1405 118 814
-3  1819 274 814
-3  1409 120 815
-3  1827 275 815
-3  1393 112 816
-3  1795 276 816
-3  1417 124 817
-3  1843 277 817
-3  1421 126 818
-3  1851 278 818
-3  1425 128 819
-3  1859 279 819
-3  1429 130 820
-3  1867 280 820
-3  1413 122 821
-3  1835 281 821
-3  767 769 1669
-3  1883 282 822
-3  1441 136 823
-3  1891 283 823
-3  1445 138 824
-3  1899 284 824
-3  769 1017 1669
-3  767 766 769
-3  1415 1633 123
-3  2336 770 1160
-3  1376 78 2326
-3  1055 758 2325
-3  1419 125 828
-3  1847 288 828
-3  1471 151 829
-3  1951 289 829
-3  1411 121 830
-3  1831 290 830
-3  1407 119 831
-3  1823 291 831
-3  1361 96 832
-3  1731 292 832
-3  1435 133 833
-3  1879 293 833
-3  1016 245 2325
-3  1644 799 1488
-3  958 265 1482
-3  1236 757 2323
-3  963 244 2323
-3  1654 757 2322
-3  1427 129 837
-3  1863 297 837
-3  1357 94 838
-3  1723 298 838
-3  1391 111 839
-3  1791 299 839
-3  1359 95 840
-3  1727 300 840
-3  1389 110 841
-3  1787 301 841
-3  1371 101 842
-3  1751 302 842
-3  1447 139 843
-3  1903 303 843
-3  1363 97 844
-3  1735 304 844
-3  1385 108 845
-3  1779 305 845
-3  1365 98 846
-3  1739 306 846
-3  1469 150 847
-3  1947 307 847
-3  1367 99 848
-3  1743 308 848
-3  1403 117 849
-3  1815 309 849
-3  1369 100 850
-3  1747 310 850
-3  1455 143 851
-3  1919 311 851
-3  2336 1531 770
-3  771 1304 1520
-3  1395 113 853
-3  1799 313 853
-3  1373 102 854
-3  1378 625 1755
-3  1467 149 855
-3  1943 315 855
-3  1375 103 856
-3  1759 316 856
-3  1457 144 857
-3  1923 317 857
-3  1304 1557 761
-3  953 772 2072
-3  1415 123 859
-3  1839 319 859
-3  772 968 2072
-3  2328 773 775
-3  2328 775 825
-3  2328 825 1516
-3  2328 1517 773
-3  826 2129 1200
-3  1431 131 863
-3  1871 323 863
-3  1443 137 864
-3  1895 324 864
-3  1461 146 865
-3  1931 325 865
-3  1459 145 866
-3  1927 326 866
-3  1465 148 867
-3  1939 327 867
-3  1463 147 868
-3  1935 328 868
-3  1439 135 869
-3  1887 329 869
-3  1423 127 870
-3  1855 330 870
-3  1387 109 871
-3  1783 331 871
-3  1596 78 2322
-3  1293 756 2321
-3  1489 160 873
-3  1987 333 873
-3  1483 157 874
-3  1975 334 874
-3  1236 244 2321
-3  2200 756 2320
-3  1487 159 876
-3  1983 336 876
-3  1477 154 877
-3  1963 337 877
-3  1491 161 878
-3  1991 338 878
-3  1481 156 879
-3  1971 339 879
-3  1475 153 880
-3  1959 340 880
-3  1485 158 881
-3  1979 341 881
-3  1499 165 882
-3  2007 342 882
-3  1509 170 883
-3  2027 343 883
-3  1503 167 884
-3  2015 344 884
-3  1493 162 885
-3  1995 345 885
-3  1507 169 886
-3  2023 346 886
-3  1497 164 887
-3  2003 347 887
-3  1511 171 888
-3  2031 348 888
-3  1501 166 889
-3  2011 349 889
-3  1495 163 890
-3  1999 350 890
-3  1505 168 891
-3  2019 351 891
-3  852 2129 826
-3  2129 1275 2072
-3  860 1298 861
-3  861 1298 1635
-3  1298 1666 758
-3  2334 862 892
-3  2334 892 1632
-3  2334 1761 862
-3  894 893 1445
-3  893 623 1445
-3  1451 894 1445
-3  893 1153 623
-3  2312 3 2320
-3  1036 2347 1959
-3  1096 755 2319
-3  2146 2143 1953
-3  964 243 2319
-3  2138 13 1112
-3  1656 755 2318
-3  1959 54 340
-3  1456 77 2318
-3  1085 754 2317
-3  1122 93 92
-3  1096 243 2317
-3  1603 217 904
-3  2215 364 904
-3  1653 242 905
-3  2315 365 905
-3  1707 269 906
-3  1352 366 906
-3  1685 258 907
-3  1808 367 907
-3  1587 209 908
-3  2183 368 908
-3  1693 262 909
-3  1668 369 909
-3  1579 205 910
-3  2167 370 910
-3  1613 222 911
-3  2235 371 911
-3  1591 211 912
-3  2191 372 912
-3  1637 234 913
-3  2283 373 913
-3  1920 754 2316
-3  375 2140 1559
-3  1561 196 915
-3  2131 375 915
-3  1559 195 916
-3  2127 376 916
-3  1896 24 2316
-3  1296 753 2315
-3  1679 255 918
-3  2074 378 918
-3  905 242 2315
-3  1538 753 2314
-3  1656 77 2314
-3  1177 752 2313
-3  1621 226 921
-3  2251 381 921
-3  1619 225 922
-3  2247 382 922
-3  1577 204 923
-3  2163 383 923
-3  1575 203 924
-3  2159 384 924
-3  1549 190 925
-3  2107 385 925
-3  1711 271 926
-3  1201 386 926
-3  1585 208 927
-3  2179 387 927
-3  1583 207 928
-3  2175 388 928
-3  1545 188 929
-3  2099 389 929
-3  1703 267 930
-3  1398 390 930
-3  1553 192 931
-3  2115 391 931
-3  1631 231 932
-3  2271 392 932
-3  1661 246 933
-3  2331 393 933
-3  1659 245 934
-3  2327 394 934
-3  1601 216 935
-3  2211 395 935
-3  1599 215 936
-3  2207 396 936
-3  1537 184 937
-3  2083 397 937
-3  1687 259 938
-3  1802 398 938
-3  1609 220 939
-3  2227 399 939
-3  1607 219 940
-3  2223 400 940
-3  1705 268 941
-3  1382 401 941
-3  1551 191 942
-3  2111 402 942
-3  1617 224 943
-3  2243 403 943
-3  1615 223 944
-3  2239 404 944
-3  1573 202 945
-3  2155 405 945
-3  1571 201 946
-3  2151 406 946
-3  1625 228 947
-3  2259 407 947
-3  1623 227 948
-3  2255 408 948
-3  1677 254 949
-3  2132 409 949
-3  1675 253 950
-3  1172 294 272
-3  1593 212 951
-3  2195 411 951
-3  1296 242 2313
-3  2320 752 2312
-3  1483 56 995
-3  287 1037 335
-3  1555 193 954
-3  2119 414 954
-3  1641 236 955
-3  2291 415 955
-3  1639 235 956
-3  2287 416 956
-3  1701 266 957
-3  1472 417 957
-3  1699 265 958
-3  1482 418 958
-3  1649 240 959
-3  2307 419 959
-3  1647 239 960
-3  2303 420 960
-3  1681 256 961
-3  1964 421 961
-3  1539 185 962
-3  2087 422 962
-3  1657 244 963
-3  2323 423 963
-3  1655 243 964
-3  2319 424 964
-3  1597 214 965
-3  2203 425 965
-3  1595 213 966
-3  2199 426 966
-3  2080 3 2312
-3  1014 751 2311
-3  107 379 1173
-3  976 241 2311
-3  337 33 1483
-3  1211 483 453
-3  1760 183 970
-3  2079 430 970
-3  1680 751 2310
-3  114 430 2079
-3  1374 76 2310
-3  575 2151 994
-3  1097 750 2309
-3  1437 433 1090
-3  1627 229 974
-3  2263 434 974
-3  1565 198 975
-3  2139 435 975
-3  1651 241 976
-3  2311 436 976
-3  1689 260 977
-3  1772 437 977
-3  1543 187 978
-3  2095 438 978
-3  1605 218 979
-3  2219 439 979
-3  1683 257 980
-3  1954 440 980
-3  1697 264 981
-3  1558 441 981
-3  1547 189 982
-3  2103 442 982
-3  1709 270 983
-3  1206 443 983
-3  1691 261 984
-3  1714 444 984
-3  1645 238 985
-3  2299 445 985
-3  1643 237 986
-3  2295 446 986
-3  1589 210 987
-3  2187 447 987
-3  1611 221 988
-3  2231 448 988
-3  1541 186 989
-3  2091 449 989
-3  1695 263 990
-3  1567 450 990
-3  1581 206 991
-3  2171 451 991
-3  1014 241 2309
-3  1756 750 2308
-3  1920 24 2308
-3  1320 749 2307
-3  2151 201 994
-3  2149 454 994
-3  1973 157 995
-3  296 995 56
-3  2167 205 996
-3  2165 456 996
-3  1981 159 997
-3  1487 457 997
-3  2183 209 998
-3  2181 458 998
-3  1989 161 999
-3  1491 459 999
-3  2119 193 1000
-3  2117 460 1000
-3  1957 153 1001
-3  1475 461 1001
-3  2215 217 1002
-3  2213 462 1002
-3  2005 165 1003
-3  1499 463 1003
-3  2231 221 1004
-3  2229 464 1004
-3  2013 167 1005
-3  1503 465 1005
-3  2247 225 1006
-3  2245 466 1006
-3  2021 169 1007
-3  1507 467 1007
-3  2263 229 1008
-3  2261 468 1008
-3  2029 171 1009
-3  1511 469 1009
-3  2199 213 1010
-3  2197 470 1010
-3  1997 163 1011
-3  1495 471 1011
-3  2295 237 1012
-3  2293 472 1012
-3  2045 175 1013
-3  1963 578 32
-3  2311 241 1014
-3  2309 474 1014
-3  2053 177 1015
-3  1523 475 1015
-3  2327 245 1016
-3  1672 1016 427
-3  959 240 2307
-3  1175 633 579
-3  1646 749 2306
-3  1680 76 2306
-3  2150 635 1113
-3  1285 748 2305
-3  662 663 1621
-3  2073 671 55
-3  1320 240 2305
-3  2145 812 377
-3  1967 748 2304
-3  2296 7 2304
-3  1106 747 2303
-3  960 239 2303
-3  2223 219 1024
-3  2221 484 1024
-3  2213 217 1025
-3  1603 485 1025
-3  1201 271 1026
-3  1203 486 1026
-3  1354 269 1027
-3  1707 487 1027
-3  2191 211 1028
-3  2189 488 1028
-3  2181 209 1029
-3  1587 489 1029
-3  2175 207 1030
-3  2173 490 1030
-3  2165 205 1031
-3  1579 491 1031
-3  1991 161 1032
-3  1989 492 1032
-3  2189 211 1033
-3  1591 493 1033
-3  2287 235 1034
-3  2285 494 1034
-3  1648 747 2302
-3  115 2079 1038
-3  1959 153 1036
-3  1957 496 1036
-3  2125 195 1037
-3  335 1037 1559
-3  2079 183 1038
-3  2077 498 1038
-3  2078 255 1039
-3  919 1039 1679
-3  1466 75 2302
-3  1081 746 2301
-3  1106 239 2301
-3  1940 746 2300
-3  2255 227 1042
-3  2253 502 1042
-3  2245 225 1043
-3  1619 503 1043
-3  1975 157 1044
-3  1973 504 1044
-3  2157 203 1045
-3  1575 505 1045
-3  2111 191 1046
-3  2109 506 1046
-3  1203 271 1047
-3  1711 507 1047
-3  1983 159 1048
-3  1981 508 1048
-3  2173 207 1049
-3  1583 509 1049
-3  2103 189 1050
-3  2101 510 1050
-3  1400 267 1051
-3  1703 511 1051
-3  2031 171 1052
-3  2029 512 1052
-3  2269 231 1053
-3  1631 513 1053
-3  1888 23 2300
-3  1209 836 834
-3  2325 245 1055
-3  1659 515 1055
-3  1999 163 1056
-3  1997 516 1056
-3  2205 215 1057
-3  1599 517 1057
-3  2087 185 1058
-3  2085 518 1058
-3  1806 259 1059
-3  1687 519 1059
-3  2007 165 1060
-3  2005 520 1060
-3  2221 219 1061
-3  1607 521 1061
-3  1352 269 1062
-3  1354 522 1062
-3  2109 191 1063
-3  1551 523 1063
-3  2015 167 1064
-3  2013 524 1064
-3  2237 223 1065
-3  1615 525 1065
-3  2159 203 1066
-3  2157 526 1066
-3  2149 201 1067
-3  1571 527 1067
-3  2023 169 1068
-3  2021 528 1068
-3  2253 227 1069
-3  1623 529 1069
-3  2074 255 1070
-3  2078 530 1070
-3  2141 253 1071
-3  1675 531 1071
-3  1288 745 2299
-3  872 1039 919
-3  985 238 2299
-3  1698 745 2298
-3  2127 195 1074
-3  2125 534 1074
-3  2117 193 1075
-3  1555 535 1075
-3  116 500 1318
-3  1208 1040 1023
-3  2285 235 1077
-3  1639 537 1077
-3  1398 267 1078
-3  1400 538 1078
-3  1532 265 1079
-3  1699 539 1079
-3  2047 175 1080
-3  2045 540 1080
-3  2301 239 1081
-3  1647 541 1081
-3  1954 257 1082
-3  1958 542 1082
-3  2085 185 1083
-3  1539 543 1083
-3  1432 177 134
-3  2053 544 1084
-3  2317 243 1085
-3  1655 545 1085
-3  2207 215 1086
-3  2205 546 1086
-3  2197 213 1087
-3  1595 547 1087
-3  1648 75 2298
-3  1337 744 2297
-3  2151 1041 406
-3  1211 1765 483
-3  1288 238 2297
-3  1452 2141 550
-3  1310 2077 183
-3  1211 499 1765
-3  2304 744 2296
-3  1566 7 2296
-3  1766 1038 1767
-3  1012 743 2295
-3  2271 231 1094
-3  2269 554 1094
-3  2261 229 1095
-3  1627 555 1095
-3  2319 243 1096
-3  2317 556 1096
-3  2309 241 1097
-3  1651 557 1097
-3  1714 261 1098
-3  1718 558 1098
-3  2093 187 1099
-3  1543 559 1099
-3  1802 259 1100
-3  1806 560 1100
-3  1958 257 1101
-3  1683 561 1101
-3  1482 265 1102
-3  1532 562 1102
-3  2101 189 1103
-3  1547 563 1103
-3  1567 263 1104
-3  1569 564 1104
-3  1718 261 1105
-3  1691 565 1105
-3  2303 239 1106
-3  2301 566 1106
-3  2293 237 1107
-3  1643 567 1107
-3  2239 223 1108
-3  2237 568 1108
-3  2229 221 1109
-3  1611 569 1109
-3  2095 187 1110
-3  2093 570 1110
-3  1569 263 1111
-3  1695 571 1111
-3  1963 154 1112
-3  1961 572 1112
-3  1985 160 1113
-3  2150 1113 2278
-3  1731 96 1114
-3  1729 574 1114
-3  497 1801 2337
-3  986 237 2295
-3  1971 156 1116
-3  1969 576 1116
-3  1700 743 2294
-3  1372 74 2294
-3  1107 742 2293
-3  1012 237 2293
-3  1752 742 2292
-3  1940 23 2292
-3  1979 158 1120
-3  1977 580 1120
-3  1961 154 1121
-3  1477 581 1121
-3  1340 741 2291
-3  1717 582 1122
-3  1817 118 1123
-3  1405 583 1123
-3  1987 160 1124
-3  1985 584 1124
-3  1969 156 1125
-3  1481 585 1125
-3  1723 94 1126
-3  1721 586 1126
-3  1825 120 1127
-3  1409 587 1127
-3  955 236 2291
-3  1638 741 2290
-3  1977 158 1129
-3  1485 589 1129
-3  1727 95 1130
-3  1725 590 1130
-3  1793 112 1131
-3  1393 591 1131
-3  2003 164 1132
-3  2001 592 1132
-3  2025 170 1133
-3  1509 593 1133
-3  1751 101 1134
-3  1749 594 1134
-3  1841 124 1135
-3  1417 595 1135
-3  2011 166 1136
-3  2009 596 1136
-3  1993 162 1137
-3  1493 597 1137
-3  1735 97 1138
-3  1733 598 1138
-3  1849 126 1139
-3  1421 599 1139
-3  2019 168 1140
-3  2017 600 1140
-3  2001 164 1141
-3  1497 601 1141
-3  1739 98 1142
-3  1737 602 1142
-3  1857 128 1143
-3  1425 603 1143
-3  2027 170 1144
-3  2025 604 1144
-3  2009 166 1145
-3  1501 605 1145
-3  1743 99 1146
-3  1741 606 1146
-3  1865 130 1147
-3  1429 607 1147
-3  1995 162 1148
-3  1993 608 1148
-3  2017 168 1149
-3  1505 609 1149
-3  1747 100 1150
-3  1745 610 1150
-3  1833 122 1151
-3  1413 611 1151
-3  1767 1038 1175
-3  1700 74 2290
-3  1175 579 1767
-3  920 1679 1117
-3  1277 740 2289
-3  1340 236 2289
-3  993 1022 2139
-3  1479 740 2288
-3  1768 1805 669
-3  666 1805 1768
-3  2280 2 2288
-3  435 1769 1117
-3  1755 102 1158
-3  1753 618 1158
-3  1889 136 1159
-3  1441 619 1159
-3  1034 739 2287
-3  435 1118 1769
-3  956 235 2287
-3  1669 875 665
-3  1759 103 1162
-3  1757 622 1162
-3  1897 138 1163
-3  1445 623 1163
-3  1640 739 2286
-3  1771 1770 1208
-3  1770 993 2139
-3  1023 1771 1208
-3  1394 73 2286
-3  1770 2139 1208
-3  1272 2285 249
-3  1115 455 2345
-3  1034 235 2285
-3  2347 1796 1959
-3  1796 1797 1959
-3  1102 799 1482
-3  1797 2348 1959
-3  2288 2 1479
-3  1280 737 2283
-3  340 1798 2349
-3  2131 196 1172
-3  2129 632 1172
-3  913 234 2283
-3  665 1904 1669
-3  340 54 1798
-3  1554 737 2282
-3  835 1805 1913
-3  1640 73 2282
-3  2211 216 1176
-3  2209 636 1176
-3  2313 242 1177
-3  1653 637 1177
-3  1895 137 1178
-3  1893 638 1178
-3  1845 125 1179
-3  1419 639 1179
-3  1382 268 1180
-3  1396 640 1180
-3  1810 258 1181
-3  1685 641 1181
-3  1927 145 1182
-3  1925 642 1182
-3  1949 151 1183
-3  1471 643 1183
-3  2179 208 1184
-3  2177 644 1184
-3  1712 262 1185
-3  1693 645 1185
-3  1935 147 1186
-3  1933 646 1186
-3  1829 121 1187
-3  1411 647 1187
-3  2163 204 1188
-3  2161 648 1188
-3  2233 222 1189
-3  1613 649 1189
-3  1855 127 1190
-3  1853 650 1190
-3  1821 119 1191
-3  1407 651 1191
-3  2187 210 1192
-3  2185 652 1192
-3  2281 234 1193
-3  1637 653 1193
-3  1879 133 1194
-3  1877 654 1194
-3  1729 96 1195
-3  1361 655 1195
-3  1193 736 2281
-3  1836 1037 1837
-3  2129 196 1197
-3  1561 657 1197
-3  1280 234 2281
-3  1801 658 1198
-3  1877 133 1199
-3  1435 659 1199
-3  2288 736 2280
-3  1837 1037 287
-3  2112 2 2280
-3  2184 800 1479
-3  1228 266 1478
-3  1281 800 1478
-3  1588 89 1473
-3  1642 801 1473
-3  2132 254 1204
-3  2134 664 1204
-3  957 266 1472
-3  1228 801 1472
-3  1828 30 1401
-3  1884 802 1401
-3  1078 267 1400
-3  1051 802 1400
-3  2139 198 1208
-3  2137 668 1208
-3  2249 226 1209
-3  836 1209 2275
-3  1863 129 1210
-3  1861 670 1210
-3  499 1717 2340
-3  1438 89 1399
-3  2243 224 1212
-3  2241 672 1212
-3  2161 204 1213
-3  1577 673 1213
-3  1819 118 1214
-3  1817 674 1214
-3  1861 129 1215
-3  1427 675 1215
-3  2155 202 1216
-3  2153 676 1216
-3  2105 190 1217
-3  1549 677 1217
-3  1791 111 1218
-3  1789 678 1218
-3  1721 94 1219
-3  1357 679 1219
-3  1206 270 1220
-3  1260 680 1220
-3  2177 208 1221
-3  1585 681 1221
-3  1827 120 1222
-3  1825 682 1222
-3  1789 111 1223
-3  1391 683 1223
-3  2171 206 1224
-3  2169 684 1224
-3  2097 188 1225
-3  1545 685 1225
-3  1787 110 1226
-3  1785 686 1226
-3  1725 95 1227
-3  1359 687 1227
-3  1472 266 1228
-3  1478 688 1228
-3  2113 192 1229
-3  1553 689 1229
-3  1795 112 1230
-3  1793 690 1230
-3  1785 110 1231
-3  1389 691 1231
-3  1448 2267 1093
-3  1513 1232 1154
-3  2329 246 1233
-3  1661 693 1233
-3  1903 139 1234
-3  1901 694 1234
-3  1749 101 1235
-3  1371 695 1235
-3  2323 244 1236
-3  2321 696 1236
-3  2209 216 1237
-3  1601 697 1237
-3  1843 124 1238
-3  1841 698 1238
-3  1901 139 1239
-3  1447 699 1239
-3  2203 214 1240
-3  2201 700 1240
-3  2081 184 1241
-3  1537 701 1241
-3  1779 108 1242
-3  1777 702 1242
-3  1733 97 1243
-3  1363 703 1243
-3  1808 258 1244
-3  1810 704 1244
-3  2225 220 1245
-3  1609 705 1245
-3  1851 126 1246
-3  1849 706 1246
-3  1777 108 1247
-3  1385 707 1247
-3  2219 218 1248
-3  2217 708 1248
-3  1396 268 1249
-3  1705 709 1249
-3  1947 150 1250
-3  1945 710 1250
-3  1737 98 1251
-3  1365 711 1251
-3  2107 190 1252
-3  2105 712 1252
-3  2241 224 1253
-3  1617 713 1253
-3  1859 128 1254
-3  1857 714 1254
-3  1945 150 1255
-3  1469 715 1255
-3  2235 222 1256
-3  2233 716 1256
-3  2153 202 1257
-3  1573 717 1257
-3  1815 117 1258
-3  1813 718 1258
-3  1741 99 1259
-3  1367 719 1259
-3  1588 803 1399
-3  930 267 1398
-3  2257 228 1261
-3  1625 721 1261
-3  1867 130 1262
-3  1865 722 1262
-3  1813 117 1263
-3  1403 723 1263
-3  2251 226 1264
-3  2249 724 1264
-3  2134 254 1265
-3  1677 725 1265
-3  1919 143 1266
-3  1917 726 1266
-3  1745 100 1267
-3  1369 727 1267
-3  1078 803 1398
-3  1037 1836 1198
-3  2193 212 1269
-3  1593 729 1269
-3  1835 122 1270
-3  1833 730 1270
-3  1917 143 1271
-3  1455 731 1271
-3  2224 11 1397
-3  1872 588 1113
-3  1094 731 2271
-3  1873 588 1872
-3  896 895 113
-3  152 588 1873
-3  932 231 2271
-3  337 1874 33
-3  2115 192 1276
-3  2113 736 1276
-3  2289 236 1277
-3  1641 737 1277
-3  1592 731 2270
-3  337 661 1874
-3  901 900 1279
-3  1395 739 1279
-3  2283 234 1280
-3  2281 740 1280
-3  1478 266 1281
-3  1701 741 1281
-3  1943 149 1282
-3  1941 742 1282
-3  1753 102 1283
-3  1373 743 1283
-3  1558 264 1284
-3  1563 744 1284
-3  2305 240 1285
-3  1649 745 1285
-3  1891 136 1286
-3  1889 746 1286
-3  1941 149 1287
-3  1467 747 1287
-3  2299 238 1288
-3  2297 748 1288
-3  1966 256 1289
-3  1681 749 1289
-3  1923 144 1290
-3  1921 750 1290
-3  1757 103 1291
-3  1375 751 1291
-3  2083 184 1292
-3  2081 752 1292
-3  2321 244 1293
-3  1657 753 1293
-3  1899 138 1294
-3  1897 754 1294
-3  1921 144 1295
-3  1457 755 1295
-3  2315 242 1296
-3  2313 756 1296
-3  2201 214 1297
-3  1597 757 1297
-3  1839 123 1298
-3  1666 1298 860
-3  1454 71 2270
-3  1526 1525 759
-3  2195 212 1300
-3  2193 760 1300
-3  92 1875 1122
-3  1875 1119 1122
-3  1053 730 2269
-3  1094 231 2269
-3  2131 1880 375
-3  1880 200 375
-3  2331 246 1304
-3  273 1881 2131
-3  1916 730 2268
-3  1881 1880 2131
-3  1832 21 2268
-3  1232 729 2267
-3  1904 1173 1669
-3  2088 804 1397
-3  1674 729 2266
-3  671 768 2062
-3  1905 1173 1904
-3  107 1173 1905
-3  1592 71 2266
-3  917 1906 430
-3  1906 1907 1669
-3  1180 268 1396
-3  1906 1669 430
-3  875 1669 1907
-3  1249 804 1396
-3  1540 90 1383
-3  1871 131 1314
-3  1869 774 1314
-3  1909 1036 1910
-3  1610 805 1383
-3  2259 228 1316
-3  2257 776 1316
-3  2137 198 1317
-3  1565 777 1317
-3  1008 727 2263
-3  1805 778 1318
-3  1869 131 1319
-3  1431 779 1319
-3  2307 240 1320
-3  2305 780 1320
-3  1774 260 1321
-3  1689 781 1321
-3  1931 146 1322
-3  1929 782 1322
-3  1893 137 1323
-3  1443 783 1323
-3  2091 186 1324
-3  2089 784 1324
-3  2217 218 1325
-3  1605 785 1325
-3  1847 125 1326
-3  1845 786 1326
-3  1929 146 1327
-3  1461 787 1327
-3  1964 256 1328
-3  1966 788 1328
-3  1563 264 1329
-3  1697 789 1329
-3  1939 148 1330
-3  1937 790 1330
-3  1925 145 1331
-3  1459 791 1331
-3  2099 188 1332
-3  2097 792 1332
-3  1260 270 1333
-3  1709 793 1333
-3  1951 151 1334
-3  1949 794 1334
-3  1937 148 1335
-3  1465 795 1335
-3  1772 260 1336
-3  1774 796 1336
-3  2297 238 1337
-3  1645 797 1337
-3  1887 135 1338
-3  1885 798 1338
-3  1933 147 1339
-3  1463 799 1339
-3  2291 236 1340
-3  2289 800 1340
-3  2185 210 1341
-3  1589 801 1341
-3  1831 121 1342
-3  1829 802 1342
-3  1885 135 1343
-3  1439 803 1343
-3  2227 220 1344
-3  2225 804 1344
-3  2089 186 1345
-3  1541 805 1345
-3  1783 109 1346
-3  1781 806 1346
-3  1853 127 1347
-3  1423 807 1347
-3  1668 262 1348
-3  1712 808 1348
-3  2169 206 1349
-3  1581 809 1349
-3  1823 119 1350
-3  1821 810 1350
-3  1781 109 1351
-3  1387 811 1351
-3  974 229 2263
-3  1676 727 2262
-3  1368 70 2262
-3  1095 726 2261
-3  1008 229 2261
-3  1744 726 2260
-3  1916 21 2260
-3  1316 725 2259
-3  1818 58 1356
-3  2166 274 1356
-3  1219 94 1357
-3  838 274 1357
-3  1826 60 1358
-3  2182 275 1358
-3  1227 95 1359
-3  840 275 1359
-3  1794 52 1360
-3  2118 276 1360
-3  1195 96 1361
-3  832 276 1361
-3  1842 64 1362
-3  2214 277 1362
-3  1243 97 1363
-3  844 277 1363
-3  1850 66 1364
-3  2230 278 1364
-3  1251 98 1365
-3  846 278 1365
-3  1858 68 1366
-3  2246 279 1366
-3  1259 99 1367
-3  848 279 1367
-3  1866 70 1368
-3  2262 280 1368
-3  1267 100 1369
-3  850 280 1369
-3  1834 62 1370
-3  2198 281 1370
-3  1235 101 1371
-3  842 281 1371
-3  1882 74 1372
-3  2294 282 1372
-3  1283 102 1373
-3  854 282 1373
-3  1890 76 1374
-3  2310 283 1374
-3  1291 103 1375
-3  856 283 1375
-3  1898 78 1376
-3  2326 284 1376
-3  1910 1036 1115
-3  858 284 1377
-3  947 228 2259
-3  1115 2345 1910
-3  1175 1911 633
-3  1622 725 2258
-3  1175 835 1911
-3  1676 70 2258
-3  1261 724 2257
-3  199 273 2131
-3  1316 228 2257
-3  2135 724 2256
-3  2248 4 2256
-3  1042 723 2255
-3  1846 65 1384
-3  2222 288 1384
-3  1247 108 1385
-3  845 288 1385
-3  1950 91 1386
-3  1202 289 1386
-3  1351 109 1387
-3  871 289 1387
-3  1830 61 1388
-3  2190 290 1388
-3  1231 110 1389
-3  841 290 1389
-3  1822 59 1390
-3  2174 291 1390
-3  1223 111 1391
-3  839 291 1391
-3  1730 36 1392
-3  1990 292 1392
-3  1131 112 1393
-3  816 292 1393
-3  1878 73 1394
-3  2286 293 1394
-3  1279 113 1395
-3  853 293 1395
-3  948 227 2255
-3  1624 723 2254
-3  1402 69 2254
-3  1069 722 2253
-3  1042 227 2253
-3  1812 722 2252
-3  1864 20 2252
-3  1264 721 2251
-3  921 226 2251
-3  1570 721 2250
-3  1624 69 2250
-3  1209 720 2249
-3  1862 69 1402
-3  2254 297 1402
-3  1263 117 1403
-3  849 297 1403
-3  1722 34 1404
-3  1974 298 1404
-3  1123 118 1405
-3  814 298 1405
-3  1790 51 1406
-3  2110 299 1406
-3  1191 119 1407
-3  831 299 1407
-3  1726 35 1408
-3  1982 300 1408
-3  1127 120 1409
-3  815 300 1409
-3  1786 50 1410
-3  2102 301 1410
-3  1187 121 1411
-3  830 301 1411
-3  1750 41 1412
-3  2030 302 1412
-3  1151 122 1413
-3  821 302 1413
-3  1902 79 1414
-3  2334 303 1414
-3  1664 123 1633
-3  859 303 1415
-3  1734 37 1416
-3  1998 304 1416
-3  1135 124 1417
-3  817 304 1417
-3  1778 48 1418
-3  2086 305 1418
-3  1179 125 1419
-3  828 305 1419
-3  1738 38 1420
-3  2006 306 1420
-3  1139 126 1421
-3  818 306 1421
-3  1946 90 1422
-3  1353 307 1422
-3  1347 127 1423
-3  870 307 1423
-3  1742 39 1424
-3  2014 308 1424
-3  1143 128 1425
-3  819 308 1425
-3  1814 57 1426
-3  2158 309 1426
-3  1215 129 1427
-3  837 309 1427
-3  1746 40 1428
-3  2022 310 1428
-3  1147 130 1429
-3  820 310 1429
-3  1918 83 1430
-3  2075 311 1430
-3  1319 131 1431
-3  863 311 1431
-3  1264 226 2249
-3  1912 1805 666
-3  2256 720 2248
-3  1913 1805 1912
-3  1519 53 898
-3  2126 313 1434
-3  1199 133 1435
-3  833 313 1435
-3  2144 4 2248
-3  1805 835 1175
-3  2151 1914 573
-3  1006 719 2247
-3  1942 89 1438
-3  1399 315 1438
-3  1343 135 1439
-3  869 315 1439
-3  1758 43 1440
-3  2046 316 1440
-3  1159 136 1441
-3  823 316 1441
-3  1922 84 1442
-3  1955 317 1442
-3  1323 137 1443
-3  864 317 1443
-3  2151 1915 1914
-3  922 225 2247
-3  1163 138 1445
-3  1515 1445 356
-3  1838 63 1446
-3  2206 319 1446
-3  1239 139 1447
-3  843 319 1447
-3  2151 575 1915
-3  1572 719 2246
-3  272 2032 1172
-3  2032 2033 1172
-3  1366 68 2246
-3  2033 199 2131
-3  2033 2131 1172
-3  1043 718 2245
-3  1679 2034 919
-3  1006 225 2245
-3  1679 2035 2034
-3  1740 718 2244
-3  1870 71 1454
-3  2270 323 1454
-3  1271 143 1455
-3  851 323 1455
-3  1894 77 1456
-3  2318 324 1456
-3  1295 144 1457
-3  857 324 1457
-3  1930 86 1458
-3  1715 325 1458
-3  1331 145 1459
-3  866 325 1459
-3  1926 85 1460
-3  1803 326 1460
-3  1327 146 1461
-3  865 326 1461
-3  1938 88 1462
-3  1488 327 1462
-3  1339 147 1463
-3  868 327 1463
-3  1934 87 1464
-3  1568 328 1464
-3  1335 148 1465
-3  867 328 1465
-3  1886 75 1466
-3  2302 329 1466
-3  1287 149 1467
-3  855 329 1467
-3  1854 67 1468
-3  2238 330 1468
-3  1255 150 1469
-3  847 330 1469
-3  1782 49 1470
-3  2094 331 1470
-3  1183 151 1471
-3  829 331 1471
-3  1812 20 2244
-3  1212 717 2243
-3  943 224 2243
-3  1614 717 2242
-3  1986 36 1474
-3  1730 333 1474
-3  1001 153 1475
-3  880 333 1475
-3  1974 34 1476
-3  1970 334 1476
-3  1121 154 1477
-3  877 334 1477
-3  1572 68 2242
-3  1253 716 2241
-3  1212 224 2241
-3  2152 716 2240
-3  1982 35 1480
-3  1978 336 1480
-3  1125 156 1481
-3  879 336 1481
-3  2232 6 2240
-3  1108 715 2239
-3  995 157 1483
-3  874 337 1483
-3  1990 36 1484
-3  1986 338 1484
-3  1129 158 1485
-3  881 338 1485
-3  1970 34 1486
-3  1722 339 1486
-3  997 159 1487
-3  876 339 1487
-3  944 223 2239
-3  1616 715 2238
-3  1113 160 1489
-3  873 340 1489
-3  1978 35 1490
-3  1726 341 1490
-3  999 161 1491
-3  878 341 1491
-3  2006 38 1492
-3  2002 342 1492
-3  1137 162 1493
-3  885 342 1493
-3  2026 41 1494
-3  1750 343 1494
-3  1011 163 1495
-3  890 343 1495
-3  2014 39 1496
-3  2010 344 1496
-3  1141 164 1497
-3  887 344 1497
-3  1994 37 1498
-3  1734 345 1498
-3  1003 165 1499
-3  882 345 1499
-3  2022 40 1500
-3  2018 346 1500
-3  1145 166 1501
-3  889 346 1501
-3  2002 38 1502
-3  1738 347 1502
-3  1005 167 1503
-3  884 347 1503
-3  2030 41 1504
-3  2026 348 1504
-3  1149 168 1505
-3  891 348 1505
-3  2010 39 1506
-3  1742 349 1506
-3  1007 169 1507
-3  886 349 1507
-3  1998 37 1508
-3  1994 350 1508
-3  1133 170 1509
-3  883 350 1509
-3  2018 40 1510
-3  1746 351 1510
-3  1009 171 1511
-3  888 351 1511
-3  2046 43 1512
-3  1679 920 2035
-3  1468 67 2238
-3  1065 714 2237
-3  2036 1801 2147
-3  1108 223 2237
-3  1198 2147 1801
-3  406 2037 667
-3  1944 714 2236
-3  406 1041 2037
-3  1856 19 2236
-3  1256 713 2235
-3  2350 2351 1489
-3  872 2038 1039
-3  1453 1013 80
-3  2038 2039 1039
-3  911 222 2235
-3  2039 116 1318
-3  2039 1318 1039
-3  1550 713 2234
-3  1483 2040 2041
-3  1616 67 2234
-3  1015 177 1523
-3  1483 2041 56
-3  1189 712 2233
-3  1483 482 2040
-3  1256 222 2233
-3  500 2042 1318
-3  2042 669 1318
-3  2240 712 2232
-3  2104 6 2232
-3  1004 711 2231
-3  2043 1489 2048
-3  988 221 2231
-3  2048 1489 340
-3  1704 711 2230
-3  340 2349 2048
-3  296 2049 995
-3  2049 2050 995
-3  1364 66 2230
-3  1109 710 2229
-3  1004 221 2229
-3  1736 710 2228
-3  1944 19 2228
-3  2050 93 1122
-3  2050 1122 995
-3  1344 709 2227
-3  667 2051 406
-3  2214 64 1536
-3  2210 364 1536
-3  1241 184 1537
-3  937 364 1537
-3  2314 77 1538
-3  1894 365 1538
-3  1083 185 1539
-3  962 365 1539
-3  1353 90 1540
-3  1383 366 1540
-3  1345 186 1541
-3  989 366 1541
-3  1809 85 1542
-3  1926 367 1542
-3  1099 187 1543
-3  978 367 1543
-3  2182 60 1544
-3  2178 368 1544
-3  1225 188 1545
-3  929 368 1545
-3  1678 87 1546
-3  1934 369 1546
-3  1103 189 1547
-3  982 369 1547
-3  2166 58 1548
-3  2162 370 1548
-3  1217 190 1549
-3  925 370 1549
-3  2234 67 1550
-3  1854 371 1550
-3  1063 191 1551
-3  942 371 1551
-3  2190 61 1552
-3  2186 372 1552
-3  1229 192 1553
-3  931 372 1553
-3  2282 73 1554
-3  1878 373 1554
-3  1075 193 1555
-3  954 373 1555
-3  2051 2054 1621
-3  939 220 2227
-3  2051 1621 406
-3  662 1621 2054
-3  1606 709 2226
-3  1704 66 2226
-3  1037 195 1559
-3  916 375 1559
-3  2126 53 1560
-3  2122 376 1560
-3  1197 196 1561
-3  915 376 1561
-3  1245 708 2225
-3  1344 220 2225
-3  1397 708 2224
-3  2216 11 2224
-3  2075 83 1564
-3  2133 378 1564
-3  1317 198 1565
-3  975 378 1565
-3  1024 707 2223
-3  940 219 2223
-3  1608 707 2222
-3  1384 65 2222
-3  1061 706 2221
-3  1024 219 2221
-3  1776 706 2220
-3  1848 18 2220
-3  2250 69 1570
-3  1862 381 1570
-3  1067 201 1571
-3  946 381 1571
-3  2246 68 1572
-3  2242 382 1572
-3  1257 202 1573
-3  945 382 1573
-3  2162 58 1574
-3  1818 383 1574
-3  1045 203 1575
-3  924 383 1575
-3  2158 57 1576
-3  2154 384 1576
-3  1213 204 1577
-3  923 384 1577
-3  2106 51 1578
-3  1790 385 1578
-3  1031 205 1579
-3  910 385 1579
-3  1202 91 1580
-3  1207 386 1580
-3  1349 206 1581
-3  991 386 1581
-3  2178 60 1582
-3  1826 387 1582
-3  1049 207 1583
-3  928 387 1583
-3  2174 59 1584
-3  2170 388 1584
-3  1221 208 1585
-3  927 388 1585
-3  2098 50 1586
-3  1786 389 1586
-3  1029 209 1587
-3  908 389 1587
-3  1399 89 1588
-3  1473 390 1588
-3  1341 210 1589
-3  987 390 1589
-3  2114 52 1590
-3  1794 391 1590
-3  1033 211 1591
-3  912 391 1591
-3  2270 71 1592
-3  2266 392 1592
-3  1269 212 1593
-3  951 392 1593
-3  2330 79 1594
-3  1902 393 1594
-3  1087 213 1595
-3  966 393 1595
-3  2326 78 1596
-3  2322 394 1596
-3  1297 214 1597
-3  965 394 1597
-3  2210 64 1598
-3  1842 395 1598
-3  1057 215 1599
-3  936 395 1599
-3  2206 63 1600
-3  2202 396 1600
-3  1237 216 1601
-3  935 396 1601
-3  2082 48 1602
-3  1778 397 1602
-3  1025 217 1603
-3  904 397 1603
-3  1803 85 1604
-3  1809 398 1604
-3  1325 218 1605
-3  979 398 1605
-3  2226 66 1606
-3  1850 399 1606
-3  1061 219 1607
-3  940 399 1607
-3  2222 65 1608
-3  2218 400 1608
-3  1245 220 1609
-3  939 400 1609
-3  1383 90 1610
-3  1946 401 1610
-3  1109 221 1611
-3  988 401 1611
-3  2110 51 1612
-3  2106 402 1612
-3  1189 222 1613
-3  911 402 1613
-3  2242 68 1614
-3  1858 403 1614
-3  1065 223 1615
-3  944 403 1615
-3  2238 67 1616
-3  2234 404 1616
-3  1253 224 1617
-3  943 404 1617
-3  2154 57 1618
-3  1814 405 1618
-3  1043 225 1619
-3  922 405 1619
-3  1248 705 2219
-3  979 218 2219
-3  1209 226 1621
-3  921 406 1621
-3  2258 70 1622
-3  1866 407 1622
-3  1069 227 1623
-3  948 407 1623
-3  2254 69 1624
-3  2250 408 1624
-3  1261 228 1625
-3  947 408 1625
-3  2133 83 1626
-3  1918 409 1626
-3  1095 229 1627
-3  974 409 1627
-3  1686 705 2218
-3  2143 2055 1953
-3  2055 992 1953
-3  1608 65 2218
-3  2194 62 1630
-3  1834 411 1630
-3  1053 231 1631
-3  932 411 1631
-3  1325 704 2217
-3  1248 218 2217
-3  2056 994 1211
-3  2224 704 2216
-3  2122 53 1634
-3  2057 994 2056
-3  1811 11 2216
-3  1211 453 2056
-3  2118 52 1636
-3  2114 414 1636
-3  1193 234 1637
-3  913 414 1637
-3  2290 74 1638
-3  1882 415 1638
-3  1077 235 1639
-3  956 415 1639
-3  2286 73 1640
-3  2282 416 1640
-3  1277 236 1641
-3  955 416 1641
-3  1473 89 1642
-3  1942 417 1642
-3  1107 237 1643
-3  986 417 1643
-3  1488 88 1644
-3  1562 418 1644
-3  1337 238 1645
-3  985 418 1645
-3  2306 76 1646
-3  1890 419 1646
-3  1081 239 1647
-3  960 419 1647
-3  2302 75 1648
-3  2298 420 1648
-3  1285 240 1649
-3  959 420 1649
-3  1965 84 1650
-3  1922 421 1650
-3  1097 241 1651
-3  976 421 1651
-3  2086 48 1652
-3  2082 422 1652
-3  1177 242 1653
-3  905 422 1653
-3  2322 78 1654
-3  1898 423 1654
-3  1085 243 1655
-3  964 423 1655
-3  2318 77 1656
-3  2314 424 1656
-3  1293 244 1657
-3  963 424 1657
-3  2202 63 1658
-3  1838 425 1658
-3  1055 245 1659
-3  934 425 1659
-3  2198 62 1660
-3  2194 426 1660
-3  1233 246 1661
-3  933 426 1661
-3  1002 703 2215
-3  2058 768 1173
-3  904 217 2215
-3  2059 768 2058
-3  1761 79 1629
-3  362 768 2059
-3  1536 703 2214
-3  375 2060 2140
-3  1362 64 2214
-3  375 200 2060
-3  1025 702 2213
-3  813 2061 720
-3  1002 217 2213
-3  1732 702 2212
-3  1306 1669 1173
-3  1017 430 1669
-3  2061 812 720
-3  812 2145 720
-3  1776 18 2212
-3  1176 701 2211
-3  2062 768 362
-3  935 216 2211
-3  768 671 2073
-3  1598 701 2210
-3  2266 71 1674
-3  1870 433 1674
-3  1071 253 1675
-3  950 433 1675
-3  2262 70 1676
-3  2258 434 1676
-3  1265 254 1677
-3  949 434 1677
-3  1536 64 2210
-3  1237 700 2209
-3  1039 255 1679
-3  918 435 1679
-3  2310 76 1680
-3  2306 436 1680
-3  1289 256 1681
-3  961 436 1681
-3  1773 86 1682
-3  1930 437 1682
-3  1101 257 1683
-3  980 437 1683
-3  2094 49 1684
-3  2090 438 1684
-3  1181 258 1685
-3  907 438 1685
-3  2218 65 1686
-3  1846 439 1686
-3  1059 259 1687
-3  938 439 1687
-3  1955 84 1688
-3  1965 440 1688
-3  1321 260 1689
-3  977 440 1689
-3  1562 88 1690
-3  1938 441 1690
-3  1105 261 1691
-3  984 441 1691
-3  2102 50 1692
-3  2098 442 1692
-3  1185 262 1693
-3  909 442 1693
-3  1207 91 1694
-3  1950 443 1694
-3  1111 263 1695
-3  990 443 1695
-3  1715 86 1696
-3  1773 444 1696
-3  1329 264 1697
-3  981 444 1697
-3  2298 75 1698
-3  1886 445 1698
-3  1079 265 1699
-3  958 445 1699
-3  2294 74 1700
-3  2290 446 1700
-3  1281 266 1701
-3  957 446 1701
-3  2186 61 1702
-3  1830 447 1702
-3  1051 267 1703
-3  930 447 1703
-3  2230 66 1704
-3  2226 448 1704
-3  1249 268 1705
-3  941 448 1705
-3  2090 49 1706
-3  1782 449 1706
-3  1027 269 1707
-3  906 449 1707
-3  1568 87 1708
-3  1678 450 1708
-3  1333 270 1709
-3  983 450 1709
-3  2170 59 1710
-3  1822 451 1710
-3  1047 271 1711
-3  926 451 1711
-3  1176 216 2209
-3  2080 700 2208
-3  2200 3 2208
-3  1086 699 2207
-3  936 215 2207
-3  1600 699 2206
-3  1446 63 2206
-3  1057 698 2205
-3  2148 14 1716
-3  1972 454 1716
-3  1119 1717 1122
-3  1211 454 1717
-3  1086 215 2205
-3  1900 698 2204
-3  1840 17 2204
-3  1240 697 2203
-3  2164 15 1720
-3  1980 456 1720
-3  1126 94 1721
-3  1219 456 1721
-3  1486 34 1722
-3  1404 457 1722
-3  838 94 1723
-3  1126 457 1723
-3  2180 16 1724
-3  1988 458 1724
-3  1130 95 1725
-3  1227 458 1725
-3  1490 35 1726
-3  1408 459 1726
-3  840 95 1727
-3  1130 459 1727
-3  2116 12 1728
-3  1956 460 1728
-3  1114 96 1729
-3  1195 460 1729
-3  1474 36 1730
-3  1392 461 1730
-3  832 96 1731
-3  1114 461 1731
-3  2212 18 1732
-3  2004 462 1732
-3  1138 97 1733
-3  1243 462 1733
-3  1498 37 1734
-3  1416 463 1734
-3  844 97 1735
-3  1138 463 1735
-3  2228 19 1736
-3  2012 464 1736
-3  1142 98 1737
-3  1251 464 1737
-3  1502 38 1738
-3  1420 465 1738
-3  846 98 1739
-3  1142 465 1739
-3  2244 20 1740
-3  2020 466 1740
-3  1146 99 1741
-3  1259 466 1741
-3  1506 39 1742
-3  1424 467 1742
-3  848 99 1743
-3  1146 467 1743
-3  2260 21 1744
-3  2028 468 1744
-3  1150 100 1745
-3  1267 468 1745
-3  1510 40 1746
-3  1428 469 1746
-3  850 100 1747
-3  1150 469 1747
-3  2196 17 1748
-3  1996 470 1748
-3  1134 101 1749
-3  1235 470 1749
-3  1494 41 1750
-3  1412 471 1750
-3  842 101 1751
-3  1134 471 1751
-3  2292 23 1752
-3  2044 472 1752
-3  1158 102 1753
-3  1283 472 1753
-3  2063 720 2064
-3  965 214 2203
-3  854 102 1755
-3  1158 473 1755
-3  2308 24 1756
-3  2052 474 1756
-3  1162 103 1757
-3  1291 474 1757
-3  1673 43 285
-3  1440 475 1758
-3  856 103 1759
-3  1162 475 1759
-3  2064 720 1209
-3  813 720 2063
-3  1658 697 2202
-3  152 2065 588
-3  2065 2146 588
-3  2146 1953 588
-3  1600 63 2202
-3  2067 2066 668
-3  2066 1040 1208
-3  1128 2067 668
-3  1297 696 2201
-3  2066 1208 668
-3  1240 214 2201
-3  2208 696 2200
-3  2068 632 2069
-3  2320 3 2200
-3  2069 632 47
-3  1010 695 2199
-3  632 2068 1172
-3  114 2070 430
-3  2070 917 430
-3  966 213 2199
-3  1660 695 2198
-3  197 2071 572
-3  1370 62 2198
-3  1087 694 2197
-3  1010 213 2197
-3  1748 694 2196
-3  1900 17 2196
-3  1300 693 2195
-3  951 212 2195
-3  1630 693 2194
-3  2220 18 1776
-3  2212 484 1776
-3  1242 108 1777
-3  1247 484 1777
-3  1602 48 1778
-3  1418 485 1778
-3  845 108 1779
-3  1242 485 1779
-3  1205 31 1780
-3  1355 486 1780
-3  1346 109 1781
-3  1351 486 1781
-3  1706 49 1782
-3  1470 487 1782
-3  871 109 1783
-3  1346 487 1783
-3  2188 16 1784
-3  2180 488 1784
-3  1226 110 1785
-3  1231 488 1785
-3  1586 50 1786
-3  1410 489 1786
-3  841 110 1787
-3  1226 489 1787
-3  2172 15 1788
-3  2164 490 1788
-3  1218 111 1789
-3  1223 490 1789
-3  1578 51 1790
-3  1406 491 1790
-3  839 111 1791
-3  1218 491 1791
-3  1988 16 1792
-3  2188 492 1792
-3  1230 112 1793
-3  1131 492 1793
-3  1590 52 1794
-3  1360 493 1794
-3  816 112 1795
-3  1230 493 1795
-3  2071 2120 572
-3  1660 62 2194
-3  2120 2138 1112
-3  903 1279 494
-3  2120 1112 572
-3  1269 692 2193
-3  853 113 1799
-3  1300 212 2193
-3  1956 12 1800
-3  2124 496 1800
-3  380 1801 2036
-3  1115 496 1801
-3  1665 1517 692
-3  941 268 1382
-3  1028 691 2191
-3  912 211 2191
-3  2076 27 1804
-3  2130 498 1804
-3  669 1805 1318
-3  1175 498 1805
-3  1552 691 2190
-3  1388 61 2190
-3  1033 690 2189
-3  1028 211 2189
-3  1784 690 2188
-3  1792 16 2188
-3  1192 689 2187
-3  987 210 2187
-3  1702 689 2186
-3  1552 61 2186
-3  1341 688 2185
-3  1192 210 2185
-3  2252 20 1812
-3  2244 502 1812
-3  1258 117 1813
-3  1263 502 1813
-3  1618 57 1814
-3  1426 503 1814
-3  849 117 1815
-3  1258 503 1815
-3  1972 14 1816
-3  2156 504 1816
-3  1214 118 1817
-3  1123 504 1817
-3  1574 58 1818
-3  1356 505 1818
-3  814 118 1819
-3  1214 505 1819
-3  2108 31 1820
-3  1205 506 1820
-3  1350 119 1821
-3  1191 506 1821
-3  1710 59 1822
-3  1390 507 1822
-3  831 119 1823
-3  1350 507 1823
-3  1980 15 1824
-3  2172 508 1824
-3  1222 120 1825
-3  1127 508 1825
-3  1582 60 1826
-3  1358 509 1826
-3  815 120 1827
-3  1222 509 1827
-3  2100 30 1828
-3  1401 510 1828
-3  1342 121 1829
-3  1187 510 1829
-3  1702 61 1830
-3  1388 511 1830
-3  830 121 1831
-3  1342 511 1831
-3  2028 21 1832
-3  2268 512 1832
-3  1270 122 1833
-3  1151 512 1833
-3  1630 62 1834
-3  1370 513 1834
-3  821 122 1835
-3  1270 513 1835
-3  2121 668 182
-3  2112 688 2184
-3  1764 1298 123
-3  2145 182 668
-3  1658 63 1838
-3  1446 515 1838
-3  859 123 1839
-3  1298 515 1839
-3  1996 17 1840
-3  2204 516 1840
-3  1238 124 1841
-3  1135 516 1841
-3  1598 64 1842
-3  1362 517 1842
-3  817 124 1843
-3  1238 517 1843
-3  2084 28 1844
-3  1807 518 1844
-3  1326 125 1845
-3  1179 518 1845
-3  1686 65 1846
-3  1384 519 1846
-3  828 125 1847
-3  1326 519 1847
-3  2004 18 1848
-3  2220 520 1848
-3  1246 126 1849
-3  1139 520 1849
-3  1606 66 1850
-3  1364 521 1850
-3  818 126 1851
-3  1246 521 1851
-3  1355 31 1852
-3  2108 522 1852
-3  1190 127 1853
-3  1347 522 1853
-3  1550 67 1854
-3  1468 523 1854
-3  870 127 1855
-3  1190 523 1855
-3  2012 19 1856
-3  2236 524 1856
-3  1254 128 1857
-3  1143 524 1857
-3  1614 68 1858
-3  1366 525 1858
-3  819 128 1859
-3  1254 525 1859
-3  2156 14 1860
-3  2148 526 1860
-3  1210 129 1861
-3  1215 526 1861
-3  1570 69 1862
-3  1402 527 1862
-3  837 129 1863
-3  1210 527 1863
-3  2020 20 1864
-3  2252 528 1864
-3  1262 130 1865
-3  1147 528 1865
-3  1622 70 1866
-3  1368 529 1866
-3  820 130 1867
-3  1262 529 1867
-3  2130 27 1868
-3  2142 530 1868
-3  1314 131 1869
-3  1319 530 1869
-3  1674 71 1870
-3  1454 531 1870
-3  863 131 1871
-3  1314 531 1871
-3  1479 2 2184
-3  2123 337 1963
-3  998 687 2183
-3  2128 1963 32
-3  908 209 2183
-3  1963 2128 2123
-3  1544 687 2182
-3  2192 572 992
-3  2124 12 1876
-3  2116 534 1876
-3  1194 133 1877
-3  1199 534 1877
-3  1554 73 1878
-3  1394 535 1878
-3  833 133 1879
-3  1194 535 1879
-3  197 572 2192
-3  1358 60 2182
-3  55 2264 2073
-3  2264 295 2073
-3  1638 74 1882
-3  1372 537 1882
-3  1278 1883 45
-3  1274 537 1883
-3  1401 30 1884
-3  1533 538 1884
-3  1338 135 1885
-3  1343 538 1885
-3  1698 75 1886
-3  1466 539 1886
-3  869 135 1887
-3  1338 539 1887
-3  2044 23 1888
-3  2300 540 1888
-3  1286 136 1889
-3  1159 540 1889
-3  1646 76 1890
-3  1374 541 1890
-3  823 136 1891
-3  1286 541 1891
-3  1962 28 1892
-3  2084 542 1892
-3  1178 137 1893
-3  1323 542 1893
-3  1538 77 1894
-3  1456 543 1894
-3  864 137 1895
-3  1178 543 1895
-3  2052 24 1896
-3  2316 544 1896
-3  1294 138 1897
-3  1163 544 1897
-3  1654 78 1898
-3  1376 545 1898
-3  824 138 1899
-3  1294 545 1899
-3  2204 17 1900
-3  2196 546 1900
-3  1234 139 1901
-3  1239 546 1901
-3  1594 79 1902
-3  1414 547 1902
-3  843 139 1903
-3  1234 547 1903
-3  1029 686 2181
-3  998 209 2181
-3  1115 2265 455
-3  1724 686 2180
-3  1115 497 2265
-3  1784 16 2180
-3  1184 685 2179
-3  2272 1717 1119
-3  2142 27 1908
-3  2076 550 1908
-3  452 1717 2272
-3  927 208 2179
-3  2145 2273 182
-3  1582 685 2178
-3  2145 377 2273
-3  1544 60 2178
-3  1221 684 2177
-3  2274 632 295
-3  47 632 2274
-3  1184 208 2177
-3  2096 684 2176
-3  2275 1209 2276
-3  2168 10 2176
-3  2276 1209 1621
-3  2268 21 1916
-3  2260 554 1916
-3  1266 143 1917
-3  1271 554 1917
-3  1626 83 1918
-3  1430 555 1918
-3  851 143 1919
-3  1266 555 1919
-3  2316 24 1920
-3  2308 556 1920
-3  1290 144 1921
-3  1295 556 1921
-3  1650 84 1922
-3  1442 557 1922
-3  857 144 1923
-3  1290 557 1923
-3  1719 29 1924
-3  2092 558 1924
-3  1182 145 1925
-3  1331 558 1925
-3  1542 85 1926
-3  1460 559 1926
-3  866 145 1927
-3  1182 559 1927
-3  1807 28 1928
-3  1962 560 1928
-3  1322 146 1929
-3  1327 560 1929
-3  1682 86 1930
-3  1458 561 1930
-3  865 146 1931
-3  1322 561 1931
-3  1533 30 1932
-3  2100 562 1932
-3  1186 147 1933
-3  1339 562 1933
-3  1546 87 1934
-3  1464 563 1934
-3  868 147 1935
-3  1186 563 1935
-3  1620 29 1936
-3  1719 564 1936
-3  1330 148 1937
-3  1335 564 1937
-3  1690 88 1938
-3  1462 565 1938
-3  867 148 1939
-3  1330 565 1939
-3  2300 23 1940
-3  2292 566 1940
-3  1282 149 1941
-3  1287 566 1941
-3  1642 89 1942
-3  1438 567 1942
-3  855 149 1943
-3  1282 567 1943
-3  2236 19 1944
-3  2228 568 1944
-3  1250 150 1945
-3  1255 568 1945
-3  1610 90 1946
-3  1422 569 1946
-3  847 150 1947
-3  1250 569 1947
-3  2092 29 1948
-3  1620 570 1948
-3  1334 151 1949
-3  1183 570 1949
-3  1694 91 1950
-3  1386 571 1950
-3  829 151 1951
-3  1334 571 1951
-3  1960 0 1952
-3  1984 572 1952
-3  1030 683 2175
-3  992 572 1953
-3  928 207 2175
-3  1584 683 2174
-3  1390 59 2174
-3  1049 682 2173
-3  1728 12 1956
-3  1800 574 1956
-3  1036 153 1957
-3  1001 574 1957
-3  1030 207 2173
-3  1788 682 2172
-3  880 153 1959
-3  2347 1036 2346
-3  1968 0 1960
-3  1952 576 1960
-3  1112 154 1961
-3  1121 576 1961
-3  1824 15 2172
-3  1224 681 2171
-3  877 154 1963
-3  578 1963 2333
-3  991 206 2171
-3  1710 681 2170
-3  1584 59 2170
-3  1349 680 2169
-3  1224 206 2169
-3  2176 680 2168
-3  1308 10 2168
-3  996 679 2167
-3  1976 0 1968
-3  1960 580 1968
-3  1116 156 1969
-3  1125 580 1969
-3  1476 34 1970
-3  1486 581 1970
-3  879 156 1971
-3  1116 581 1971
-3  1716 14 1972
-3  1816 582 1972
-3  1044 157 1973
-3  995 582 1973
-3  1404 34 1974
-3  1476 583 1974
-3  874 157 1975
-3  1044 583 1975
-3  1984 0 1976
-3  1968 584 1976
-3  1120 158 1977
-3  1129 584 1977
-3  1480 35 1978
-3  1490 585 1978
-3  881 158 1979
-3  1120 585 1979
-3  1720 15 1980
-3  1824 586 1980
-3  1048 159 1981
-3  997 586 1981
-3  1408 35 1982
-3  1480 587 1982
-3  876 159 1983
-3  1048 587 1983
-3  1952 0 1984
-3  1976 588 1984
-3  1124 160 1985
-3  1113 588 1985
-3  1484 36 1986
-3  1474 589 1986
-3  873 160 1987
-3  1124 589 1987
-3  1724 16 1988
-3  1792 590 1988
-3  1032 161 1989
-3  999 590 1989
-3  1392 36 1990
-3  1484 591 1990
-3  878 161 1991
-3  1032 591 1991
-3  2000 1 1992
-3  2024 592 1992
-3  1148 162 1993
-3  1137 592 1993
-3  1508 37 1994
-3  1498 593 1994
-3  885 162 1995
-3  1148 593 1995
-3  1748 17 1996
-3  1840 594 1996
-3  1056 163 1997
-3  1011 594 1997
-3  1416 37 1998
-3  1508 595 1998
-3  890 163 1999
-3  1056 595 1999
-3  2008 1 2000
-3  1992 596 2000
-3  1132 164 2001
-3  1141 596 2001
-3  1492 38 2002
-3  1502 597 2002
-3  887 164 2003
-3  1132 597 2003
-3  1732 18 2004
-3  1848 598 2004
-3  1060 165 2005
-3  1003 598 2005
-3  1420 38 2006
-3  1492 599 2006
-3  882 165 2007
-3  1060 599 2007
-3  2016 1 2008
-3  2000 600 2008
-3  1136 166 2009
-3  1145 600 2009
-3  1496 39 2010
-3  1506 601 2010
-3  889 166 2011
-3  1136 601 2011
-3  1736 19 2012
-3  1856 602 2012
-3  1064 167 2013
-3  1005 602 2013
-3  1424 39 2014
-3  1496 603 2014
-3  884 167 2015
-3  1064 603 2015
-3  2024 1 2016
-3  2008 604 2016
-3  1140 168 2017
-3  1149 604 2017
-3  1500 40 2018
-3  1510 605 2018
-3  891 168 2019
-3  1140 605 2019
-3  1740 20 2020
-3  1864 606 2020
-3  1068 169 2021
-3  1007 606 2021
-3  1428 40 2022
-3  1500 607 2022
-3  886 169 2023
-3  1068 607 2023
-3  1992 1 2024
-3  2016 608 2024
-3  1144 170 2025
-3  1133 608 2025
-3  1504 41 2026
-3  1494 609 2026
-3  883 170 2027
-3  1144 609 2027
-3  1744 21 2028
-3  1832 610 2028
-3  1052 171 2029
-3  1009 610 2029
-3  1412 41 2030
-3  1504 611 2030
-3  888 171 2031
-3  1052 611 2031
-3  910 205 2167
-3  1621 663 2276
-3  1548 679 2166
-3  2277 1113 1489
-3  1356 58 2166
-3  2278 1113 2277
-3  1031 678 2165
-3  1489 2351 2277
-3  996 205 2165
-3  2279 435 2139
-3  1720 678 2164
-3  2284 2139 1022
-3  1788 15 2164
-3  2139 2284 2279
-3  2332 2324 1559
-3  2324 335 1559
-3  155 2332 1559
-3  1188 677 2163
-3  923 204 2163
-3  1574 677 2162
-3  1315 1512 614
-3  1548 58 2162
-3  2333 1112 2335
-3  1213 676 2161
-3  1752 23 2044
-3  1888 618 2044
-3  1080 175 2045
-3  1013 618 2045
-3  1440 43 2046
-3  1512 619 2046
-3  1311 175 431
-3  1080 619 2047
-3  2335 1112 13
-3  1188 204 2161
-3  1112 2333 1963
-3  2104 676 2160
-3  332 902 1198
-3  2152 6 2160
-3  2337 1801 2338
-3  1066 675 2159
-3  1756 24 2052
-3  1896 622 2052
-3  1084 177 2053
-3  1015 622 2053
-3  2338 1801 380
-3  924 203 2159
-3  1801 497 1115
-3  1530 322 623
-3  1576 675 2158
-3  2339 1717 452
-3  1426 57 2158
-3  2340 1717 2339
-3  1045 674 2157
-3  1717 499 1211
-3  2342 2341 2079
-3  2341 501 2079
-3  115 2342 2079
-3  1066 203 2157
-3  1860 674 2156
-3  1816 14 2156
-3  1198 2343 2147
-3  1216 673 2155
-3  1198 902 2343
-3  945 202 2155
-3  1026 811 1201
-3  926 271 1201
-3  1580 811 1202
-3  1386 91 1202
-3  1047 810 1203
-3  1026 271 1203
-3  1780 810 1205
-3  1820 31 1205
-3  1220 809 1206
-3  983 270 1206
-3  1694 809 1207
-3  1580 91 1207
-3  1333 808 1260
-3  1220 270 1260
-3  2168 808 1308
-3  1713 10 1308
-3  1062 807 1352
-3  2344 632 2072
-3  1618 673 2154
-3  295 632 2073
-3  1576 57 2154
-3  1257 672 2153
-3  1216 202 2153
-3  2160 672 2152
-3  1908 27 2076
-3  1804 634 2076
-3  1038 183 2077
-3  1312 2077 1021
-3  2240 6 2152
-3  577 575 994
-3  970 183 2079
-3  827 115 1038
-3  2208 3 2080
-3  2312 636 2080
-3  1292 184 2081
-3  1241 636 2081
-3  1652 48 2082
-3  1602 637 2082
-3  937 184 2083
-3  1292 637 2083
-3  1892 28 2084
-3  1844 638 2084
-3  1058 185 2085
-3  1083 638 2085
-3  1418 48 2086
-3  1652 639 2086
-3  962 185 2087
-3  1058 639 2087
-3  1397 11 2088
-3  1811 640 2088
-3  1324 186 2089
-3  1345 640 2089
-3  1684 49 2090
-3  1706 641 2090
-3  989 186 2091
-3  1324 641 2091
-3  1924 29 2092
-3  1948 642 2092
-3  1110 187 2093
-3  1099 642 2093
-3  1470 49 2094
-3  1684 643 2094
-3  978 187 2095
-3  1110 643 2095
-3  2176 10 2096
-3  1713 644 2096
-3  1332 188 2097
-3  1225 644 2097
-3  1692 50 2098
-3  1586 645 2098
-3  929 188 2099
-3  1332 645 2099
-3  1932 30 2100
-3  1828 646 2100
-3  1050 189 2101
-3  1103 646 2101
-3  1410 50 2102
-3  1692 647 2102
-3  982 189 2103
-3  1050 647 2103
-3  2160 6 2104
-3  2232 648 2104
-3  1252 190 2105
-3  1217 648 2105
-3  1612 51 2106
-3  1578 649 2106
-3  925 190 2107
-3  1252 649 2107
-3  1852 31 2108
-3  1820 650 2108
-3  1046 191 2109
-3  1063 650 2109
-3  1406 51 2110
-3  1612 651 2110
-3  942 191 2111
-3  1046 651 2111
-3  2184 2 2112
-3  2280 652 2112
-3  1276 192 2113
-3  1229 652 2113
-3  1636 52 2114
-3  1590 653 2114
-3  931 192 2115
-3  1276 653 2115
-3  1876 12 2116
-3  1728 654 2116
-3  1000 193 2117
-3  1075 654 2117
-3  1360 52 2118
-3  1636 655 2118
-3  954 193 2119
-3  1000 655 2119
-3  906 269 1352
-3  1540 807 1353
-3  1422 90 1353
-3  1027 806 1354
-3  1560 53 2122
-3  1634 657 2122
-3  1062 269 1354
-3  1852 806 1355
-3  1800 12 2124
-3  1876 658 2124
-3  1074 195 2125
-3  1037 658 2125
-3  1434 53 2126
-3  1560 659 2126
-3  916 195 2127
-3  1074 659 2127
-3  1780 31 1355
-3  1180 805 1382
-3  1172 196 2129
-3  1268 2129 1197
-3  946 201 2151
-3  1067 670 2149
-3  915 196 2131
-3  994 201 2149
-3  1716 670 2148
-3  1860 14 2148
-3  1128 668 2121
-3  2248 668 2144
-3  2136 4 2144
-3  975 198 2139
-3  1317 664 2137
-3  1208 198 2137
-3  2135 4 2136
-3  2144 664 2136
+0.27219661039719134 -0.89987434907152952 0.34005641981910195
+0.27399725512977036 -0.89741802080743249 0.34558774394436154
+0.2679128793459149 -0.90549608434201145 0.32699007860623508
+0.26758089404998364 -0.90597288936521869 0.32585692434233743
+0.26660413751883816 -0.90759811547986069 0.32187126056253501
+0.25697201819559901 -0.92432848622760766 0.28050566540029309
+0.25313054028719528 -0.92991689161909552 0.26460466631117985
+0.25308933658097965 -0.92998804508785282 0.26439588316448515
+0.24930895838975131 -0.93567470552212895 0.24579255546759948
+0.24336599009814622 -0.94602936533555493 0.21094260961626568
+0.24152064540259124 -0.9485706826100101 0.20072208160320942
+0.2389405724498605 -0.95306848001363997 0.18186355091081885
+0.23440017510432309 -0.9594775020158709 0.15035899655759535
+0.23294949527472616 -0.96194916611186088 0.13775142693846476
+0.23259475183323847 -0.96237493457550005 0.13494008765512316
+0.23052646968895496 -0.96592607882051262 0.10986054425367281
+0.22988186145330614 -0.96732927410114633 0.099634331047451258
+0.22762677949308696 -0.97053761901938218 0.067701629511043929
+0.22743420727478347 -0.97114863140943242 0.060907607905721757
+0.22648000271342916 -0.97241808576487498 0.034988854233130681
+0.22628605152906522 -0.97313250261608553 0.01853460685588823
+0.22589145876869662 -0.97323020415808847 -0
+0.22628605152906522 -0.97313250261608553 -0.01853460685588823
+0.22648000271342922 -0.97241808576487498 -0.034988854233130834
+0.2274342072747835 -0.97114863140943242 -0.060907607905721785
+0.22762677949308691 -0.97053761901938207 -0.067701629511043929
+0.22988186145330608 -0.96732927410114655 -0.09963433104745123
+0.23052646968895496 -0.96592607882051251 -0.10986054425367295
+0.23259475183323847 -0.96237493457549972 -0.13494008765512314
+0.23294949527472619 -0.96194916611186088 -0.13775142693846473
+0.23440017510432298 -0.95947750201587068 -0.15035899655759499
+0.23894057244986044 -0.95306848001363997 -0.18186355091081888
+0.24152064540259116 -0.94857068261000999 -0.2007220816032094
+0.24336599009814619 -0.94602936533555493 -0.21094260961626565
+0.24930895838975131 -0.93567470552212884 -0.24579255546759954
+0.2530893365809796 -0.92998804508785282 -0.26439588316448515
+0.25313054028719528 -0.92991689161909541 -0.26460466631117996
+0.25697201819559901 -0.92432848622760766 -0.28050566540029298
+0.26660413751883794 -0.90759811547986147 -0.32187126056253368
+0.26758089404998375 -0.9059728893652188 -0.32585692434233748
+0.26791287934591512 -0.90549608434201145 -0.32699007860623563
+0.27219661039719123 -0.89987434907152986 -0.34005641981910134
+0.27399725512977041 -0.89741802080743249 -0.34558774394436126
+0.27461092234606044 -0.89644305776905853 -0.34753041451074085
+0.28617291708332143 -0.87638371280443894 -0.38483791504434917
+0.29057971437418995 -0.8695923485436825 -0.39708487175152696
+0.29401138453262826 -0.86471241548978539 -0.40567809407889899
+0.30362145533065937 -0.84916410602320314 -0.43023759412454321
+0.30729748704039861 -0.84278707285381271 -0.43974499787970978
+0.31474205002823552 -0.83109069623026088 -0.45671715648324696
+0.31682936237190801 -0.8280363774210906 -0.46105412139556579
+0.32993533901945349 -0.80654749644509327 -0.4886330537542477
+0.3395133710973568 -0.79211156275892003 -0.50664961250726259
+0.34177771381313393 -0.78887113359859207 -0.51061830246204121
+0.34243159318633287 -0.78789291377908466 -0.51176714118576783
+0.34288899659372696 -0.78713443636827329 -0.51257565524045923
+0.35314170479917451 -0.76928684914828649 -0.53075413092765567
+0.36517401588679066 -0.75 -0.5497573450331017
+0.36998650939197825 -0.74269333684247574 -0.5567855194421365
+0.37506412073313466 -0.73422479552976916 -0.56417193374348928
+0.39411849558532475 -0.7042679462719752 -0.58956860097969033
+0.39895802436542988 -0.69687753315555612 -0.5957410107715313
+0.40036321981550371 -0.69465247190942381 -0.5975302451883705
+0.40065939257699101 -0.69413734830776352 -0.5979056290568221
+0.40151480227572495 -0.69274920908571347 -0.59888293763788791
+0.40435813432554835 -0.6879005781223142 -0.60211592452938867
+0.42861413394522363 -0.64891100701386617 -0.62717432611494861
+0.4331208322019765 -0.64210794890239153 -0.63136143448574877
+0.44633019100468196 -0.62042776846682712 -0.64334361719230815
+0.4546732585899762 -0.60749293870920396 -0.65018159643527595
+0.45944041532897179 -0.59972505245462004 -0.65399889841309111
+0.46796403496887884 -0.58666916470964625 -0.66003296952840651
+0.4897853260968788 -0.55056521742650477 -0.67476755984413883
+0.49314081475211935 -0.54531814984023852 -0.67677227421098896
+0.5039242293873103 -0.52945918848859996 -0.68235511400187066
+0.50468001700647158 -0.52828837108788052 -0.68272481536695295
+0.50622685812276502 -0.52571510245600428 -0.68341702461536269
+0.50787822903713031 -0.52299793234814496 -0.68413337702600852
+0.52912853141459681 -0.48757002987147358 -0.69320320770179844
+0.53310523682898858 -0.48133611427487955 -0.69462568959831961
+0.54306000239317154 -0.46664565776233691 -0.69755165300174249
+0.5493198212532957 -0.45674068614295493 -0.69911600851089584
+0.56731181848165257 -0.42664579118104862 -0.70294074606773127
+0.57556494808430081 -0.41363385795819674 -0.70422028778974766
+0.58303192413334481 -0.40257317574481138 -0.70495163176324016
+0.59214384399202524 -0.38815954298187871 -0.70538094374692584
+0.6078561560079746 -0.36184045701812118 -0.70538094374692584
+0.61696807586665503 -0.34742682425518878 -0.70495163176324016
+0.62443505191569915 -0.33636614204180315 -0.70422028778974766
+0.63268818151834738 -0.32335420881895127 -0.70294074606773105
+0.65068017874670414 -0.29325931385704507 -0.69911600851089584
+0.6569399976068282 -0.28335434223766326 -0.69755165300174249
+0.66689476317101137 -0.26866388572512034 -0.69462568959831961
+0.67087146858540314 -0.2624299701285262 -0.69320320770179855
+0.69212177096286942 -0.22700206765185557 -0.68413337702600874
+0.69377314187723493 -0.22428489754399594 -0.68341702461536258
+0.69531998299352837 -0.2217116289121196 -0.68272481536695306
+0.69607577061268988 -0.22054081151140006 -0.68235511400187066
+0.70685918524788072 -0.20468185015976154 -0.67677227421098896
+0.71021467390312099 -0.19943478257349526 -0.67476755984413894
+0.73203596503112101 -0.16333083529035375 -0.66003296952840662
+0.74055958467102845 -0.15027494754537968 -0.65399889841309089
+0.74532674141002375 -0.14250706129079624 -0.65018159643527618
+0.75366980899531777 -0.12957223153317302 -0.64334361719230837
+0.76687916779802356 -0.10789205109760858 -0.63136143448574888
+0.77138586605477633 -0.1010889929861338 -0.62717432611494872
+0.79564186567445128 -0.06209942187768587 -0.60211592452938889
+0.79848519772427506 -0.057250790914286004 -0.59888293763788769
+0.79934060742300872 -0.055862651692236032 -0.59790562905682221
+0.79963678018449613 -0.055347528090576067 -0.59753024518837083
+0.80104197563456991 -0.053122466844444029 -0.59574101077153174
+0.80588150441467521 -0.045732053728024212 -0.58956860097968999
+0.82493587926686529 -0.015775204470230772 -0.56417193374348928
+0.83001349060802165 -0.0073066631575244411 -0.55678551944213672
+0.8348259841132093 -6.1457978060811826e-19 -0.5497573450331017
+0.84685829520082545 0.019286849148286479 -0.53075413092765555
+0.85711100340627278 0.037134436368273155 -0.51257565524045934
+0.85756840681366708 0.037892913779084561 -0.51176714118576794
+0.85822228618686602 0.038871133598591998 -0.51061830246204143
+0.86048662890264316 0.042111562758920099 -0.50664961250726259
+0.87006466098054647 0.056547496445093395 -0.48863305375424759
+0.88317063762809189 0.078036377421090597 -0.46105412139556579
+0.88525794997176432 0.081090696230260814 -0.45671715648324701
+0.89270251295960135 0.092787072853812741 -0.43974499787970978
+0.89637854466934042 0.099164106023202886 -0.43023759412454343
+0.90598861546737153 0.11471241548978532 -0.40567809407889888
+0.9094202856258099 0.11959234854368263 -0.39708487175152668
+0.91382708291667858 0.12638371280443889 -0.38483791504434905
+0.9253890776539393 0.14644305776905842 -0.34753041451074107
+0.92600274487022949 0.14741802080743258 -0.34558774394436131
+0.92780338960280884 0.14987434907153013 -0.34005641981910084
+0.93208712065408494 0.15549608434201162 -0.32699007860623541
+0.9324191059500162 0.15597288936521903 -0.32585692434233743
+0.93339586248116191 0.15759811547986141 -0.32187126056253423
+0.94302798180440084 0.17432848622760777 -0.2805056654002932
+0.94686945971280467 0.17991689161909563 -0.26460466631117985
+0.94691066341902053 0.17998804508785299 -0.26439588316448503
+0.95069104161024875 0.18567470552212903 -0.24579255546759926
+0.95663400990185365 0.19602936533555493 -0.21094260961626565
+0.95847935459740874 0.19857068261001024 -0.20072208160320937
+0.9610594275501394 0.20306848001363986 -0.18186355091081907
+0.96559982489567697 0.20947750201587081 -0.15035899655759494
+0.96705050472527398 0.21194916611186077 -0.13775142693846465
+0.96740524816676143 0.21237493457549977 -0.13494008765512311
+0.96947353031104488 0.21592607882051251 -0.10986054425367317
+0.97011813854669371 0.2173292741011463 -0.099634331047451508
+0.97237322050691288 0.2205376190193819 -0.067701629511043915
+0.97256579272521626 0.22114863140943242 -0.060907607905721556
+0.97351999728657068 0.22241808576487493 -0.034988854233130418
+0.97371394847093473 0.22313250261608547 -0.018534606855888307
+0.9741085412313033 0.22323020415808842 -0
+0.97371394847093473 0.22313250261608547 0.018534606855888314
+0.97351999728657068 0.22241808576487493 0.034988854233130445
+0.97256579272521648 0.22114863140943247 0.060907607905721736
+0.97237322050691288 0.22053761901938193 0.067701629511043915
+0.9701181385466936 0.21732927410114636 0.099634331047451369
+0.96947353031104511 0.21592607882051257 0.10986054425367309
+0.96740524816676143 0.21237493457549983 0.13494008765512311
+0.96705050472527376 0.21194916611186071 0.13775142693846484
+0.96559982489567697 0.20947750201587079 0.15035899655759488
+0.9610594275501394 0.20306848001363986 0.18186355091081891
+0.95847935459740885 0.19857068261001021 0.20072208160320931
+0.95663400990185365 0.1960293653355549 0.21094260961626565
+0.95069104161024875 0.185674705522129 0.24579255546759909
+0.94691066341902042 0.17998804508785277 0.2643958831644852
+0.94686945971280478 0.17991689161909552 0.26460466631117979
+0.94302798180440095 0.1743284862276076 0.2805056654002932
+0.93339586248116191 0.15759811547986138 0.32187126056253412
+0.93241910595001631 0.15597288936521894 0.32585692434233732
+0.93208712065408506 0.15549608434201159 0.3269900786062353
+0.92780338960280884 0.14987434907153008 0.34005641981910095
+0.92600274487022949 0.1474180208074326 0.34558774394436137
+0.92538907765393941 0.14644305776905847 0.34753041451074107
+0.91382708291667858 0.12638371280443894 0.38483791504434894
+0.9094202856258099 0.11959234854368264 0.39708487175152674
+0.90598861546737153 0.11471241548978531 0.40567809407889893
+0.89637854466934042 0.099164106023202803 0.43023759412454371
+0.89270251295960135 0.092787072853812713 0.43974499787970978
+0.88525794997176432 0.0810906962302608 0.4567171564832469
+0.88317063762809189 0.078036377421090528 0.46105412139556584
+0.87006466098054647 0.056547496445093395 0.48863305375424759
+0.86048662890264316 0.042111562758920092 0.50664961250726259
+0.85822228618686625 0.038871133598592303 0.51061830246204098
+0.85756840681366708 0.037892913779084658 0.51176714118576783
+0.85711100340627278 0.037134436368273058 0.51257565524045945
+0.84685829520082545 0.019286849148286413 0.53075413092765555
+0.83482598411320952 6.1457978060812172e-19 0.54975734503310147
+0.83001349060802176 -0.0073066631575244463 0.55678551944213661
+0.82493587926686529 -0.015775204470230869 0.56417193374348917
+0.80588150441467499 -0.045732053728024698 0.58956860097969011
+0.80104197563456947 -0.053122466844444688 0.59574101077153174
+0.79963678018449591 -0.05534752809057629 0.59753024518837039
+0.79934060742300872 -0.055862651692236226 0.5979056290568221
+0.79848519772427518 -0.05725079091428617 0.59888293763788758
+0.7956418656744515 -0.062099421877685829 0.60211592452938856
+0.77138586605477644 -0.10108899298613383 0.62717432611494861
+0.76687916779802356 -0.10789205109760849 0.63136143448574888
+0.75366980899531777 -0.12957223153317304 0.64334361719230837
+0.74532674141002397 -0.14250706129079604 0.65018159643527595
+0.74055958467102845 -0.15027494754537984 0.65399889841309089
+0.73203596503112123 -0.16333083529035369 0.66003296952840662
+0.71021467390312121 -0.19943478257349531 0.67476755984413883
+0.70685918524788072 -0.20468185015976154 0.67677227421098896
+0.69607577061268988 -0.22054081151139987 0.68235511400187043
+0.69531998299352837 -0.22171162891211948 0.68272481536695295
+0.69377314187723504 -0.22428489754399578 0.68341702461536258
+0.69212177096286909 -0.22700206765185593 0.68413337702600874
+0.67087146858540314 -0.2624299701285262 0.69320320770179844
+0.66689476317101137 -0.26866388572512034 0.69462568959831961
+0.65693999760682831 -0.28335434223766309 0.69755165300174227
+0.65068017874670425 -0.29325931385704501 0.69911600851089595
+0.63268818151834738 -0.32335420881895094 0.70294074606773105
+0.62443505191569892 -0.33636614204180326 0.70422028778974766
+0.61696807586665514 -0.34742682425518856 0.70495163176324005
+0.60785615600797449 -0.36184045701812129 0.70538094374692584
+0.59214384399202546 -0.3881595429818786 0.70538094374692573
+0.58303192413334481 -0.40257317574481138 0.70495163176324016
+0.57556494808430092 -0.41363385795819674 0.70422028778974766
+0.5673118184816528 -0.42664579118104884 0.70294074606773105
+0.5493198212532957 -0.45674068614295493 0.69911600851089584
+0.54306000239317154 -0.46664565776233696 0.69755165300174249
+0.53310523682898858 -0.4813361142748796 0.69462568959831961
+0.52912853141459681 -0.48757002987147369 0.69320320770179866
+0.50787822903712998 -0.52299793234814529 0.68413337702600852
+0.50622685812276469 -0.5257151024560045 0.68341702461536258
+0.50468001700647158 -0.52828837108788052 0.68272481536695295
+0.50392422938731019 -0.52945918848859996 0.68235511400187066
+0.49314081475211924 -0.54531814984023841 0.67677227421098896
+0.48978532609687886 -0.55056521742650477 0.67476755984413894
+0.46796403496887878 -0.58666916470964625 0.66003296952840662
+0.45944041532897167 -0.59972505245462004 0.65399889841309089
+0.45467325858997609 -0.60749293870920384 0.65018159643527607
+0.44633019100468213 -0.6204277684668269 0.64334361719230826
+0.4331208322019765 -0.64210794890239153 0.63136143448574877
+0.42861413394522363 -0.64891100701386595 0.62717432611494872
+0.40435813432554857 -0.6879005781223142 0.60211592452938856
+0.401514802275725 -0.69274920908571369 0.59888293763788769
+0.40065939257699124 -0.69413734830776352 0.5979056290568221
+0.40036321981550405 -0.6946524719094237 0.59753024518837061
+0.39895802436543049 -0.69687753315555545 0.59574101077153174
+0.39411849558532508 -0.7042679462719752 0.58956860097969033
+0.37506412073313489 -0.73422479552976916 0.5641719337434894
+0.36998650939197836 -0.74269333684247552 0.55678551944213661
+0.36517401588679066 -0.75 0.5497573450331017
+0.35314170479917451 -0.76928684914828649 0.53075413092765567
+0.34288899659372707 -0.78713443636827329 0.51257565524045945
+0.34243159318633287 -0.78789291377908466 0.51176714118576805
+0.34177771381313388 -0.78887113359859229 0.51061830246204121
+0.33951337109735685 -0.79211156275892003 0.50664961250726281
+0.32993533901945349 -0.80654749644509338 0.4886330537542477
+0.31682936237190812 -0.8280363774210906 0.46105412139556601
+0.31474205002823563 -0.83109069623026077 0.45671715648324707
+0.30729748704039872 -0.84278707285381294 0.43974499787970983
+0.30362145533065943 -0.84916410602320291 0.43023759412454349
+0.29401138453262832 -0.86471241548978517 0.4056780940788991
+0.29057971437419 -0.8695923485436825 0.39708487175152685
+0.28617291708332138 -0.87638371280443861 0.38483791504434917
+0.27461092234606033 -0.8964430577690583 0.34753041451074085
+-0.27542468411056592 0.78691464920034204 0.5521834643091893
+-0.4456465002315988 0.3412681489687433 0.82760814841975494
+-1.2310405966106288e-18 0.065843464858177478 0.99782996454078776
+1.2310405966106288e-18 0.065843464858177478 -0.99782996454078776
+-0.44564650023159863 0.34126814896874336 -0.82760814841975505
+-0.27542468411056592 0.78691464920034204 -0.55218346430918919
+0.27542468411056592 0.78691464920034204 -0.5521834643091893
+0.4456465002315988 0.3412681489687433 -0.82760814841975494
+0.065843464858177478 -0.99782996454078776 1.2310405966106288e-18
+-0.4456465002315988 -0.3412681489687433 -0.82760814841975494
+-0.99782996454078776 -1.231040596610629e-18 -0.065843464858177492
+-0.55218346430918919 -0.27542468411056592 0.78691464920034204
+-0.78691464920034204 0.5521834643091893 0.27542468411056592
+1.2310405966106288e-18 -0.065843464858177478 0.99782996454078776
+0.5521834643091893 -0.27542468411056592 0.78691464920034204
+-0.065843464858177492 0.99782996454078776 1.231040596610629e-18
+-0.3412681489687433 0.82760814841975494 0.44564650023159885
+-0.82760814841975494 0.44564650023159885 0.34126814896874336
+-0.5521834643091893 0.27542468411056592 0.78691464920034204
+-0.44564650023159863 -0.34126814896874336 0.82760814841975505
+0.5521834643091893 0.27542468411056592 -0.78691464920034204
+0.44564650023159863 -0.34126814896874336 -0.82760814841975505
+-1.2310405966106288e-18 -0.065843464858177478 -0.99782996454078776
+-0.5521834643091893 -0.27542468411056592 -0.78691464920034204
+-0.55218346430918919 0.27542468411056592 -0.78691464920034204
+-0.78691464920034204 0.55218346430918919 -0.27542468411056592
+-0.34126814896874336 0.82760814841975505 -0.44564650023159863
+0.065843464858177492 0.99782996454078776 -1.231040596610629e-18
+0.3412681489687433 0.82760814841975494 -0.44564650023159885
+0.82760814841975505 0.44564650023159885 -0.34126814896874336
+0.4456465002315988 -0.3412681489687433 0.82760814841975494
+0.27542468411056592 -0.78691464920034204 0.5521834643091893
+-0.34126814896874336 -0.82760814841975505 0.44564650023159863
+-0.065843464858177478 -0.99782996454078776 -1.2310405966106288e-18
+-0.27542468411056592 -0.78691464920034204 -0.5521834643091893
+0.27542468411056592 -0.78691464920034204 -0.55218346430918919
+0.55218346430918919 -0.27542468411056592 -0.78691464920034204
+0.78691464920034204 0.5521834643091893 -0.27542468411056592
+-0.3412681489687433 -0.82760814841975505 -0.44564650023159885
+-0.82760814841975505 -0.44564650023159885 -0.34126814896874336
+-0.78691464920034204 -0.5521834643091893 -0.27542468411056592
+-0.82760814841975505 -0.44564650023159863 0.34126814896874336
+-0.78691464920034204 -0.55218346430918919 0.27542468411056592
+-0.27542468411056592 -0.78691464920034204 0.55218346430918919
+-0.82760814841975505 0.44564650023159863 -0.34126814896874336
+-0.99782996454078776 1.231040596610629e-18 0.065843464858177492
+-0.26105426945011495 0.63457761123722189 0.7274351680516471
+-0.068996282000725467 0.75327597529184531 0.65407554465688111
+-0.23033669342916982 0.33088129441328606 0.9151298141069959
+-0.30369631682393589 0.52293928186267569 0.79643145005237237
+0.1186983640546234 0.26188501241256062 0.95777186148081694
+-0.11869836405462342 0.26188501241256068 0.95777186148081694
+-0.1186983640546234 0.26188501241256062 -0.95777186148081694
+0.11869836405462342 0.26188501241256068 -0.95777186148081694
+-0.30369631682393589 0.52293928186267558 -0.79643145005237248
+-0.23033669342916974 0.33088129441328601 -0.9151298141069959
+-0.068996282000725426 0.75327597529184531 -0.65407554465688111
+-0.26105426945011484 0.63457761123722189 -0.7274351680516471
+0.26105426945011495 0.63457761123722189 -0.7274351680516471
+0.068996282000725467 0.75327597529184531 -0.65407554465688111
+0.23033669342916982 0.33088129441328606 -0.9151298141069959
+0.30369631682393589 0.52293928186267569 -0.79643145005237237
+-0.23033669342916982 -0.33088129441328606 -0.9151298141069959
+-0.30369631682393589 -0.52293928186267569 -0.79643145005237237
+-0.95777186148081694 0.1186983640546234 -0.26188501241256062
+-0.95777186148081694 -0.11869836405462342 -0.26188501241256068
+-0.65407554465688111 -0.068996282000725426 0.75327597529184531
+-0.7274351680516471 -0.26105426945011484 0.63457761123722201
+-0.63457761123722189 0.7274351680516471 0.26105426945011495
+-0.75327597529184531 0.65407554465688111 0.068996282000725467
+-0.1186983640546234 -0.26188501241256062 0.95777186148081694
+0.11869836405462342 -0.26188501241256068 0.95777186148081694
+0.65407554465688111 -0.068996282000725467 0.75327597529184531
+-0.26188501241256062 0.95777186148081694 -0.1186983640546234
+-0.26188501241256068 0.95777186148081694 0.11869836405462342
+-0.33088129441328606 0.9151298141069959 0.23033669342916982
+-0.52293928186267569 0.79643145005237237 0.30369631682393589
+-0.9151298141069959 0.23033669342916982 0.33088129441328606
+-0.79643145005237237 0.30369631682393589 0.52293928186267569
+-0.7274351680516471 0.26105426945011495 0.63457761123722189
+-0.65407554465688111 0.068996282000725467 0.75327597529184531
+-0.30369631682393589 -0.52293928186267558 0.79643145005237248
+-0.23033669342916974 -0.33088129441328601 0.9151298141069959
+0.7274351680516471 0.26105426945011495 -0.63457761123722189
+0.65407554465688111 0.068996282000725467 -0.75327597529184531
+0.30369631682393589 -0.52293928186267558 -0.79643145005237248
+0.23033669342916974 -0.33088129441328601 -0.9151298141069959
+0.1186983640546234 -0.26188501241256062 -0.95777186148081694
+-0.11869836405462342 -0.26188501241256068 -0.95777186148081694
+-0.7274351680516471 -0.26105426945011495 -0.63457761123722189
+-0.65407554465688111 -0.068996282000725467 -0.75327597529184531
+-0.65407554465688111 0.068996282000725426 -0.75327597529184531
+-0.7274351680516471 0.26105426945011484 -0.63457761123722201
+-0.75327597529184531 0.65407554465688111 -0.068996282000725426
+-0.63457761123722201 0.72743516805164721 -0.2610542694501149
+-0.52293928186267558 0.79643145005237248 -0.30369631682393589
+-0.33088129441328601 0.9151298141069959 -0.23033669342916974
+0.26188501241256062 0.95777186148081694 0.1186983640546234
+0.26188501241256068 0.95777186148081694 -0.11869836405462342
+0.33088129441328606 0.9151298141069959 -0.23033669342916982
+0.52293928186267569 0.79643145005237237 -0.30369631682393589
+0.79643145005237237 0.30369631682393589 -0.52293928186267569
+0.23033669342916982 -0.33088129441328606 0.9151298141069959
+0.30369631682393589 -0.52293928186267569 0.79643145005237237
+0.26105426945011495 -0.63457761123722189 0.7274351680516471
+0.068996282000725467 -0.75327597529184531 0.65407554465688111
+-0.52293928186267558 -0.79643145005237248 0.30369631682393589
+-0.33088129441328601 -0.9151298141069959 0.23033669342916974
+-0.26188501241256062 -0.95777186148081694 0.1186983640546234
+-0.26188501241256068 -0.95777186148081694 -0.11869836405462342
+-0.26105426945011495 -0.63457761123722189 -0.7274351680516471
+-0.068996282000725467 -0.75327597529184531 -0.65407554465688111
+0.068996282000725426 -0.75327597529184531 -0.65407554465688111
+0.26105426945011484 -0.63457761123722201 -0.7274351680516471
+0.65407554465688111 -0.068996282000725426 -0.75327597529184531
+0.63457761123722189 0.7274351680516471 -0.26105426945011495
+0.75327597529184531 0.65407554465688111 -0.068996282000725467
+-0.33088129441328606 -0.9151298141069959 -0.23033669342916982
+-0.52293928186267569 -0.79643145005237237 -0.30369631682393589
+-0.9151298141069959 -0.23033669342916982 -0.33088129441328606
+-0.79643145005237237 -0.30369631682393589 -0.52293928186267569
+-0.63457761123722189 -0.7274351680516471 -0.26105426945011495
+-0.75327597529184531 -0.65407554465688111 -0.068996282000725467
+-0.79643145005237248 -0.30369631682393589 0.52293928186267558
+-0.9151298141069959 -0.23033669342916974 0.33088129441328601
+-0.75327597529184531 -0.65407554465688111 0.068996282000725426
+-0.63457761123722201 -0.7274351680516471 0.26105426945011484
+-0.068996282000725426 -0.75327597529184531 0.65407554465688111
+-0.26105426945011484 -0.63457761123722201 0.7274351680516471
+-0.79643145005237248 0.30369631682393589 -0.52293928186267558
+-0.9151298141069959 0.23033669342916974 -0.33088129441328601
+-0.95777186148081694 -0.1186983640546234 0.26188501241256062
+-0.95777186148081694 0.11869836405462342 0.26188501241256068
+0.25355721782048268 0.90387507728811034 0.34253810440658672
+0.069930348042498217 0.88287877117884817 0.46436496618972251
+-0.46863573506266099 0.77633914798103421 0.42151877198336174
+-0.46047178079401074 0.64151089172333209 0.61353851948571902
+-0.5621285844293008 0.13929176414434621 0.81523570763863507
+-0.35451755943338797 0.13781977899394779 0.92483674698373319
+0.12122116383748827 -0.13320400767343918 0.98364735641266243
+0.24136787945551613 0.067889430951449614 0.96805607891910661
+-0.12122116383748827 -0.13320400767343918 -0.98364735641266243
+-0.24136787945551613 0.067889430951449614 -0.96805607891910661
+-0.63704738383668802 0.33543172738922172 -0.69401454380114713
+-0.50369111272938427 0.52836121174546036 -0.68346886752821701
+-0.27249577181778528 0.89756031181852247 -0.34659997257597425
+-0.069930348042498217 0.88287877117884817 -0.46436496618972251
+0.46863573506266099 0.77633914798103421 -0.42151877198336174
+0.46047178079401074 0.64151089172333209 -0.61353851948571902
+0.5621285844293008 0.13929176414434621 -0.81523570763863507
+0.35451755943338797 0.13781977899394779 -0.92483674698373319
+0.13929176414434621 -0.81523570763863507 0.5621285844293008
+0.13781977899394779 -0.92483674698373319 0.35451755943338797
+-0.13320400767343918 -0.98364735641266243 -0.12122116383748827
+0.067889430951449614 -0.96805607891910661 -0.24136787945551613
+-0.5621285844293008 -0.13929176414434621 -0.81523570763863507
+-0.35451755943338797 -0.13781977899394779 -0.92483674698373319
+-0.98364735641266243 0.12122116383748827 0.13320400767343918
+-0.96805607891910661 0.24136787945551613 -0.067889430951449614
+-0.34659997257597425 -0.27249577181778528 0.89756031181852247
+-0.46436496618972251 -0.069930348042498217 0.88287877117884817
+-0.77633914798103421 0.42151877198336174 0.46863573506266099
+-0.64151089172333209 0.61353851948571902 0.46047178079401074
+-0.12122116383748827 0.13320400767343918 0.98364735641266243
+-0.24136787945551613 -0.067889430951449614 0.96805607891910661
+0.42151877198336168 -0.46863573506266087 0.77633914798103421
+0.34253810440658672 0.25355721782048268 0.90387507728811034
+0.46436496618972256 0.069930348042498217 0.88287877117884817
+0.90387507728811034 0.34253810440658677 0.25355721782048279
+0.88287877117884817 0.46436496618972256 0.069930348042498217
+0.13320400767343918 0.98364735641266243 -0.12122116383748827
+-0.067889430951449614 0.96805607891910661 -0.24136787945551613
+-0.13929176414434621 0.81523570763863507 0.5621285844293008
+-0.13781977899394779 0.92483674698373319 0.35451755943338797
+-0.81523570763863507 0.5621285844293008 0.13929176414434621
+-0.92483674698373297 0.35451755943338792 0.13781977899394779
+-0.42151877198336168 0.46863573506266087 0.77633914798103421
+-0.61353851948571902 0.46047178079401074 0.64151089172333209
+-0.63704738383668802 -0.33543172738922172 0.69401454380114713
+-0.50369111272938438 -0.52836121174546025 0.68346886752821701
+0.42151877198336168 0.46863573506266087 -0.77633914798103421
+0.61353851948571902 0.46047178079401074 -0.64151089172333209
+0.12122116383748827 0.13320400767343918 -0.98364735641266243
+0.24136787945551613 -0.067889430951449614 -0.96805607891910661
+-0.42151877198336168 -0.46863573506266087 -0.77633914798103421
+-0.61353851948571902 -0.46047178079401074 -0.64151089172333209
+-0.34659997257597425 0.27249577181778528 -0.89756031181852247
+-0.46436496618972256 0.069930348042498217 -0.88287877117884817
+-0.89756031181852258 0.3465999725759743 -0.27249577181778534
+-0.88287877117884817 0.46436496618972251 -0.069930348042498217
+-0.33543172738922172 0.69401454380114713 -0.63704738383668802
+-0.52836121174546025 0.68346886752821701 -0.50369111272938438
+-0.13320400767343918 0.98364735641266243 0.12122116383748827
+0.067889430951449614 0.96805607891910661 0.24136787945551613
+0.13929176414434621 0.81523570763863507 -0.5621285844293008
+0.13781977899394779 0.92483674698373319 -0.35451755943338797
+0.81523570763863507 0.5621285844293008 -0.13929176414434621
+0.92483674698373297 0.35451755943338792 -0.13781977899394779
+0.5621285844293008 -0.13929176414434621 0.81523570763863507
+0.35451755943338797 -0.13781977899394779 0.92483674698373319
+-0.33543172738922172 -0.69401454380114713 0.63704738383668802
+-0.52836121174546036 -0.68346886752821701 0.50369111272938438
+0.13320400767343918 -0.98364735641266243 0.12122116383748827
+-0.067889430951449614 -0.96805607891910661 0.24136787945551613
+-0.46863573506266087 -0.77633914798103421 -0.42151877198336168
+-0.46047178079401074 -0.64151089172333209 -0.61353851948571902
+0.069930348042498217 -0.88287877117884817 -0.46436496618972256
+0.34659997257597425 -0.27249577181778528 -0.89756031181852247
+0.46436496618972251 -0.069930348042498217 -0.88287877117884817
+0.77633914798103421 0.42151877198336168 -0.46863573506266087
+0.64151089172333209 0.61353851948571902 -0.46047178079401074
+-0.13929176414434621 -0.81523570763863507 -0.5621285844293008
+-0.13781977899394779 -0.92483674698373319 -0.35451755943338797
+-0.81523570763863507 -0.5621285844293008 -0.13929176414434621
+-0.92483674698373297 -0.35451755943338792 -0.13781977899394779
+-0.77633914798103421 -0.42151877198336168 -0.46863573506266087
+-0.64151089172333209 -0.61353851948571902 -0.46047178079401074
+-0.69401454380114724 -0.63704738383668813 0.33543172738922178
+-0.68346886752821701 -0.50369111272938427 0.52836121174546036
+-0.89756031181852258 -0.3465999725759743 0.27249577181778534
+-0.88287877117884817 -0.46436496618972251 0.069930348042498217
+-0.27249577181778528 -0.89756031181852247 0.34659997257597425
+-0.069930348042498217 -0.88287877117884817 0.46436496618972251
+-0.69401454380114724 0.63704738383668813 -0.33543172738922178
+-0.68346886752821701 0.50369111272938438 -0.52836121174546036
+-0.98364735641266243 -0.12122116383748827 -0.13320400767343918
+-0.96805607891910661 -0.24136787945551613 0.067889430951449614
+0.14324145828887103 0.44478475305090454 0.88410882140193769
+0.15717574894030886 0.48126519958548875 0.86156266551879135
+0.12122116383748825 0.13320400767343915 0.98364735641266243
+0.35451755943338792 0.13781977899394779 0.92483674698373319
+-0.13183850301701977 0.66669512270283438 0.73357768674250445
+-0.21331917890744348 0.45337594379539092 0.86541618975952417
+-0.06165331891640554 0.59501600355390483 0.8013456331579597
+-0.069930348042498217 0.88287877117884817 0.46436496618972245
+-1.2287154012371122e-18 0.32153744077837104 0.94689686564994791
+-0.099757165525981073 0.49525883802792381 0.86299895207436528
+-0.33543172738922172 0.69401454380114691 0.63704738383668813
+-0.50369111272938427 0.52836121174546025 0.68346886752821701
+-1.2262216765384848e-18 0.43360551911151823 0.90110279868394083
+-0.34659997257597441 0.27249577181778545 0.89756031181852258
+-0.24136787945551613 0.067889430951449614 0.96805607891910661
+-0.21331917890744351 0.45337594379539092 -0.86541618975952417
+1.2262216765384848e-18 0.43360551911151823 -0.90110279868394083
+0.34659997257597441 0.27249577181778545 -0.89756031181852258
+0.24136787945551613 0.067889430951449614 -0.96805607891910661
+-0.13183850301701969 0.66669512270283426 -0.73357768674250456
+-0.099757165525981059 0.49525883802792381 -0.86299895207436528
+-0.12122116383748825 0.13320400767343915 -0.98364735641266243
+-0.35451755943338792 0.13781977899394779 -0.92483674698373319
+0.13183850301701977 0.66669512270283438 -0.73357768674250434
+-0.061653318916405575 0.59501600355390494 -0.80134563315795981
+-0.42151877198336163 0.46863573506266104 -0.77633914798103421
+-0.46047178079401074 0.64151089172333209 -0.61353851948571891
+0.21331917890744348 0.45337594379539092 -0.86541618975952417
+0.061653318916405561 0.59501600355390494 -0.8013456331579597
+-0.13929176414434621 0.81523570763863507 -0.5621285844293008
+0.069930348042498217 0.88287877117884817 -0.46436496618972245
+1.2287154012371122e-18 0.32153744077837104 -0.94689686564994791
+0.099757165525981087 0.49525883802792392 -0.86299895207436528
+0.33543172738922172 0.69401454380114691 -0.63704738383668813
+0.50369111272938427 0.52836121174546025 -0.68346886752821701
+0.067889430951449614 -0.96805607891910661 0.24136787945551613
+0.13320400767343915 -0.98364735641266243 -0.12122116383748825
+0.13781977899394779 -0.92483674698373319 -0.35451755943338792
+0.86156266551879135 0.15717574894030889 0.48126519958548886
+0.92483674698373319 0.35451755943338792 0.13781977899394779
+-1.2287154012371122e-18 -0.32153744077837104 -0.94689686564994791
+-0.099757165525981087 -0.49525883802792392 -0.86299895207436528
+-0.33543172738922172 -0.69401454380114691 -0.63704738383668813
+-0.50369111272938427 -0.52836121174546025 -0.68346886752821701
+-0.86541618975952417 0.21331917890744351 -0.45337594379539092
+-0.90110279868394083 -1.2262216765384848e-18 -0.43360551911151823
+-0.89756031181852236 -0.34659997257597436 -0.27249577181778539
+-0.96805607891910661 -0.24136787945551613 -0.067889430951449614
+-0.73357768674250445 0.13183850301701977 0.66669512270283438
+-0.80134563315795981 -0.061653318916405575 0.59501600355390494
+-0.77633914798103421 -0.42151877198336163 0.46863573506266104
+-0.61353851948571891 -0.46047178079401074 0.64151089172333209
+-0.45337594379539092 0.86541618975952417 0.21331917890744348
+-0.59501600355390494 0.8013456331579597 0.061653318916405561
+-0.81523570763863507 0.5621285844293008 -0.13929176414434621
+-0.88287877117884817 0.46436496618972245 0.069930348042498217
+-0.21331917890744351 -0.45337594379539092 0.86541618975952417
+1.2262216765384848e-18 -0.43360551911151823 0.90110279868394083
+0.34659997257597441 -0.27249577181778545 0.89756031181852258
+0.24136787945551616 -0.067889430951449614 0.96805607891910661
+0.49650199476975138 0.13950602492257505 0.85675191169903997
+0.51873480041451092 0.13843733448120876 0.84282425105969128
+0.46436496618972245 -0.069930348042498203 0.88287877117884817
+0.77318510024650355 0.10194841255523886 0.62479622481419606
+0.66669512270283438 0.73357768674250434 -0.13183850301701977
+0.44478475305090454 0.88410882140193769 0.14324145828887103
+0.48126519958548886 0.86156266551879135 0.15717574894030889
+0.13320400767343918 0.98364735641266243 0.12122116383748827
+0.13781977899394779 0.92483674698373319 0.35451755943338792
+-0.45337594379539092 0.86541618975952417 -0.21331917890744351
+-0.43360551911151823 0.90110279868394083 1.2262216765384848e-18
+-0.27249577181778539 0.89756031181852236 0.34659997257597436
+-0.067889430951449614 0.96805607891910661 0.24136787945551613
+-0.32153744077837104 0.94689686564994791 1.2287154012371122e-18
+-0.49525883802792392 0.86299895207436528 0.099757165525981087
+-0.69401454380114691 0.63704738383668813 0.33543172738922172
+-0.52836121174546025 0.68346886752821701 0.50369111272938427
+-0.94689686564994791 1.2287154012371122e-18 0.32153744077837104
+-0.86299895207436528 0.099757165525981073 0.49525883802792381
+-0.63704738383668813 0.33543172738922172 0.69401454380114691
+-0.68346886752821701 0.50369111272938438 0.52836121174546036
+-0.86541618975952417 0.21331917890744348 0.45337594379539092
+-0.8013456331579597 0.06165331891640554 0.59501600355390483
+-0.5621285844293008 -0.13929176414434621 0.81523570763863529
+-0.46436496618972234 0.069930348042498203 0.88287877117884817
+-0.13183850301701969 -0.66669512270283426 0.73357768674250456
+-0.099757165525981059 -0.49525883802792381 0.86299895207436528
+-0.12122116383748825 -0.13320400767343915 0.98364735641266243
+-0.35451755943338792 -0.13781977899394779 0.92483674698373319
+0.86541618975952417 0.21331917890744348 -0.45337594379539092
+0.8013456331579597 0.06165331891640554 -0.59501600355390483
+0.5621285844293008 -0.13929176414434621 -0.81523570763863529
+0.46436496618972234 0.069930348042498203 -0.88287877117884817
+0.13183850301701969 -0.66669512270283426 -0.73357768674250456
+0.099757165525981059 -0.49525883802792381 -0.86299895207436528
+0.12122116383748825 -0.13320400767343915 -0.98364735641266243
+0.35451755943338792 -0.13781977899394779 -0.92483674698373319
+0.21331917890744351 -0.45337594379539092 -0.86541618975952417
+-1.2262216765384848e-18 -0.43360551911151823 -0.90110279868394083
+-0.34659997257597441 -0.27249577181778545 -0.89756031181852258
+-0.24136787945551616 -0.067889430951449614 -0.96805607891910661
+-0.86541618975952417 -0.21331917890744348 -0.45337594379539092
+-0.8013456331579597 -0.06165331891640554 -0.59501600355390483
+-0.5621285844293008 0.13929176414434621 -0.81523570763863529
+-0.46436496618972245 -0.069930348042498203 -0.88287877117884817
+-0.73357768674250445 -0.13183850301701977 -0.66669512270283438
+-0.80134563315795981 0.061653318916405582 -0.59501600355390505
+-0.77633914798103421 0.42151877198336163 -0.46863573506266104
+-0.61353851948571891 0.4604717807940108 -0.64151089172333209
+-0.66669512270283438 0.73357768674250434 0.13183850301701977
+-0.59501600355390505 0.80134563315795981 -0.061653318916405582
+-0.46863573506266104 0.77633914798103421 -0.42151877198336163
+-0.64151089172333209 0.61353851948571891 -0.4604717807940108
+-0.66669512270283426 0.73357768674250456 -0.13183850301701969
+-0.49525883802792381 0.86299895207436528 -0.099757165525981059
+-0.13320400767343918 0.98364735641266243 -0.12122116383748827
+-0.13781977899394779 0.92483674698373319 -0.35451755943338792
+0.43360551911151823 0.90110279868394083 -1.2262216765384848e-18
+0.27249577181778539 0.89756031181852236 -0.34659997257597436
+0.067889430951449614 0.96805607891910661 -0.24136787945551613
+0.32153744077837104 0.94689686564994791 -1.2287154012371122e-18
+0.49525883802792392 0.86299895207436528 -0.099757165525981087
+0.69401454380114691 0.63704738383668813 -0.33543172738922172
+0.52836121174546025 0.68346886752821701 -0.50369111272938427
+0.63704738383668813 0.33543172738922172 -0.69401454380114691
+0.68346886752821701 0.50369111272938438 -0.52836121174546036
+1.2287154012371122e-18 -0.32153744077837104 0.94689686564994791
+0.099757165525981087 -0.49525883802792392 0.86299895207436528
+0.21331917890744348 -0.45337594379539092 0.86541618975952417
+0.061653318916405561 -0.59501600355390494 0.8013456331579597
+-0.13929176414434621 -0.81523570763863529 0.5621285844293008
+0.069930348042498203 -0.88287877117884817 0.46436496618972234
+-0.66669512270283426 -0.73357768674250456 0.13183850301701969
+-0.49525883802792381 -0.86299895207436528 0.099757165525981059
+-0.13320400767343915 -0.98364735641266243 0.12122116383748825
+-0.13781977899394779 -0.92483674698373319 0.35451755943338792
+-0.45337594379539092 -0.86541618975952417 0.21331917890744351
+-0.43360551911151823 -0.90110279868394083 -1.2262216765384848e-18
+-0.27249577181778539 -0.89756031181852236 -0.34659997257597436
+-0.067889430951449614 -0.96805607891910661 -0.24136787945551616
+-0.21331917890744348 -0.45337594379539092 -0.86541618975952417
+-0.061653318916405561 -0.59501600355390494 -0.8013456331579597
+0.13929176414434621 -0.81523570763863529 -0.5621285844293008
+-0.069930348042498203 -0.88287877117884817 -0.46436496618972245
+-0.13183850301701977 -0.66669512270283438 -0.73357768674250434
+0.061653318916405582 -0.59501600355390505 -0.80134563315795981
+0.42151877198336163 -0.46863573506266104 -0.77633914798103421
+0.73357768674250445 0.13183850301701977 -0.66669512270283438
+0.89756031181852236 0.34659997257597436 -0.27249577181778539
+0.45337594379539092 0.86541618975952417 -0.21331917890744348
+0.59501600355390494 0.8013456331579597 -0.061653318916405561
+0.88287877117884817 0.46436496618972245 -0.069930348042498203
+-0.32153744077837104 -0.94689686564994791 -1.2287154012371122e-18
+-0.49525883802792392 -0.86299895207436528 -0.099757165525981087
+-0.69401454380114691 -0.63704738383668813 -0.33543172738922172
+-0.52836121174546025 -0.68346886752821701 -0.50369111272938427
+-0.94689686564994791 -1.2287154012371122e-18 -0.32153744077837104
+-0.86299895207436528 -0.099757165525981073 -0.49525883802792381
+-0.63704738383668813 -0.33543172738922172 -0.69401454380114691
+-0.68346886752821701 -0.50369111272938438 -0.52836121174546036
+-0.45337594379539092 -0.86541618975952417 -0.21331917890744348
+-0.59501600355390494 -0.8013456331579597 -0.061653318916405561
+-0.81523570763863529 -0.5621285844293008 0.13929176414434621
+-0.88287877117884817 -0.46436496618972234 -0.069930348042498203
+-0.73357768674250456 -0.13183850301701969 0.66669512270283426
+-0.86299895207436528 -0.099757165525981059 0.49525883802792381
+-0.98364735641266243 -0.12122116383748827 0.13320400767343918
+-0.92483674698373319 -0.35451755943338792 0.13781977899394779
+-0.66669512270283438 -0.73357768674250434 -0.13183850301701977
+-0.59501600355390505 -0.80134563315795981 0.061653318916405582
+-0.46863573506266104 -0.77633914798103421 0.42151877198336163
+-0.64151089172333209 -0.61353851948571891 0.4604717807940108
+0.13183850301701977 -0.66669512270283438 0.73357768674250434
+-0.061653318916405582 -0.59501600355390505 0.80134563315795981
+-0.42151877198336163 -0.46863573506266104 0.77633914798103421
+-0.4604717807940108 -0.64151089172333209 0.61353851948571891
+-0.73357768674250456 0.13183850301701969 -0.66669512270283426
+-0.86299895207436528 0.099757165525981059 -0.49525883802792381
+-0.98364735641266243 0.12122116383748827 -0.13320400767343918
+-0.92483674698373319 0.35451755943338792 -0.13781977899394779
+-0.86541618975952417 -0.21331917890744351 0.45337594379539092
+-0.90110279868394083 1.2262216765384848e-18 0.43360551911151823
+-0.89756031181852236 0.34659997257597436 0.27249577181778539
+-0.96805607891910661 0.24136787945551613 0.067889430951449614
+-0.27466844612618391 0.86574218443040074 0.41838703947458195
+-0.40480738995889742 0.82178222598517658 0.40100492526839776
+-0.57608383788574413 0.33994835690442576 0.74334549596053445
+-0.58942568680894825 0.20731239180326447 0.78076816785433134
+-0.081370946056690249 -0.066381045638217229 0.9944708773603258
+0.040522281668716874 -0.13192856911395229 0.99043061207734606
+0.081370946056690249 -0.066381045638217229 -0.9944708773603258
+-0.040522281668716874 -0.13192856911395229 -0.99043061207734606
+-0.52579382752597525 0.20828740048796671 -0.8247164420172246
+-0.61446983418191203 0.27287882084494514 -0.74024588618561449
+-0.40632940254264294 0.78437123837371081 -0.46867704983435055
+-0.33924096091721673 0.86230450765389344 -0.37596077789543381
+0.27466844612618391 0.86574218443040074 -0.41838703947458195
+0.40480738995889742 0.82178222598517658 -0.40100492526839776
+0.57608383788574413 0.33994835690442576 -0.74334549596053445
+0.58942568680894825 0.20731239180326447 -0.78076816785433134
+0.20731239180326447 -0.78076816785433134 0.58942568680894825
+-0.066381045638217229 -0.9944708773603258 0.081370946056690249
+-0.13192856911395229 -0.99043061207734606 -0.040522281668716874
+0.20828740048796671 -0.8247164420172246 -0.52579382752597525
+0.27287882084494514 -0.74024588618561449 -0.61446983418191203
+-0.57608383788574413 -0.33994835690442576 -0.74334549596053445
+-0.58942568680894825 -0.20731239180326447 -0.78076816785433134
+-0.9944708773603258 -0.081370946056690249 0.066381045638217229
+-0.99043061207734606 0.040522281668716874 0.13192856911395229
+-0.46867704983435055 -0.40632940254264294 0.78437123837371081
+-0.37596077789543381 -0.33924096091721673 0.86230450765389344
+-0.86574218443040074 0.41838703947458195 0.27466844612618391
+-0.82178222598517658 0.40100492526839776 0.40480738995889742
+0.081370946056690249 0.066381045638217229 0.9944708773603258
+-0.040522281668716874 0.13192856911395229 0.99043061207734606
+0.41838703947458189 -0.27466844612618385 0.86574218443040085
+0.40100492526839776 -0.40480738995889742 0.82178222598517658
+0.066381045638217229 0.9944708773603258 0.081370946056690249
+0.13192856911395229 0.99043061207734606 -0.040522281668716874
+-0.33994835690442576 0.74334549596053445 0.57608383788574413
+-0.20731239180326447 0.78076816785433134 0.58942568680894825
+-0.74334549596053445 0.57608383788574413 0.33994835690442576
+-0.78076816785433134 0.58942568680894825 0.20731239180326447
+-0.41838703947458189 0.27466844612618385 0.86574218443040085
+-0.40100492526839776 0.40480738995889742 0.82178222598517658
+-0.52579382752597525 -0.20828740048796671 0.8247164420172246
+-0.61446983418191203 -0.27287882084494514 0.74024588618561449
+0.41838703947458189 0.27466844612618385 -0.86574218443040085
+0.40100492526839776 0.40480738995889742 -0.82178222598517658
+0.52579382752597525 -0.20828740048796671 -0.8247164420172246
+-0.081370946056690249 0.066381045638217229 -0.9944708773603258
+0.040522281668716874 0.13192856911395229 -0.99043061207734606
+-0.41838703947458189 -0.27466844612618385 -0.86574218443040085
+-0.40100492526839776 -0.40480738995889742 -0.82178222598517658
+-0.46867704983435055 0.40632940254264294 -0.78437123837371081
+-0.37596077789543381 0.33924096091721673 -0.86230450765389344
+-0.78437123837371081 0.46867704983435055 -0.40632940254264294
+-0.86230450765389344 0.37596077789543381 -0.33924096091721673
+-0.20828740048796671 0.8247164420172246 -0.52579382752597525
+-0.27287882084494514 0.74024588618561449 -0.61446983418191203
+-0.066381045638217229 0.9944708773603258 -0.081370946056690249
+-0.13192856911395229 0.99043061207734606 0.040522281668716874
+0.33994835690442576 0.74334549596053445 -0.57608383788574413
+0.20731239180326447 0.78076816785433134 -0.58942568680894825
+0.74334549596053445 0.57608383788574413 -0.33994835690442576
+0.78076816785433134 0.58942568680894825 -0.20731239180326447
+0.58942568680894825 -0.20731239180326447 0.78076816785433134
+-0.20828740048796671 -0.8247164420172246 0.52579382752597525
+-0.27287882084494514 -0.74024588618561449 0.61446983418191203
+0.066381045638217229 -0.9944708773603258 -0.081370946056690249
+0.13192856911395229 -0.99043061207734606 0.040522281668716874
+-0.27466844612618385 -0.86574218443040085 -0.41838703947458189
+-0.40480738995889742 -0.82178222598517658 -0.40100492526839776
+0.46867704983435055 -0.40632940254264294 -0.78437123837371081
+0.37596077789543381 -0.33924096091721673 -0.86230450765389344
+0.86574218443040085 0.41838703947458189 -0.27466844612618385
+0.82178222598517658 0.40100492526839776 -0.40480738995889742
+-0.33994835690442576 -0.74334549596053445 -0.57608383788574413
+-0.20731239180326447 -0.78076816785433134 -0.58942568680894825
+-0.74334549596053445 -0.57608383788574413 -0.33994835690442576
+-0.78076816785433134 -0.58942568680894825 -0.20731239180326447
+-0.86574218443040085 -0.41838703947458189 -0.27466844612618385
+-0.82178222598517658 -0.40100492526839776 -0.40480738995889742
+-0.8247164420172246 -0.52579382752597525 0.20828740048796671
+-0.74024588618561449 -0.61446983418191203 0.27287882084494514
+-0.78437123837371081 -0.46867704983435055 0.40632940254264294
+-0.86230450765389344 -0.37596077789543381 0.33924096091721673
+-0.40632940254264294 -0.78437123837371081 0.46867704983435055
+-0.33924096091721673 -0.86230450765389344 0.37596077789543381
+-0.8247164420172246 0.52579382752597525 -0.20828740048796671
+-0.74024588618561449 0.61446983418191203 -0.27287882084494514
+-0.9944708773603258 0.081370946056690249 -0.066381045638217229
+-0.99043061207734606 -0.040522281668716874 -0.13192856911395229
+0.077704403643809677 0.32271058904772337 0.94330265629374277
+0.080281277350241265 0.19739352602284616 0.97703158208487906
+-0.069740197633308881 0.8004723406749189 0.59529852733606181
+-0.135836225526941 0.719915307065364 0.68063975088704354
+-0.37149736972483099 0.52777252693426735 0.76383628095354983
+-0.28407954462258922 0.46039308870086582 0.84103330267207554
+-0.15985780358782284 0.19937696972895624 0.96679589706089264
+-0.039734588558411582 0.26026494835742225 0.96471929550963276
+-0.19300544019554747 0.62457262167826666 0.75674166021493738
+-0.26817151760031971 0.68929656115193505 0.6730187872058685
+-0.18656099607880575 0.38998766307204569 0.90172313788306901
+-0.30401279487901056 0.33566720821021839 0.891573746743482
+-0.2726998137406515 0.26911716736226499 -0.9236940845413727
+-0.25952221836449818 0.39610117388436322 -0.88076789123048704
+0.18656099607880575 0.38998766307204569 -0.90172313788306901
+0.30401279487901056 0.33566720821021839 -0.891573746743482
+-0.32839555720531111 0.64061453708709604 -0.69409608332024086
+-0.20012814034344362 0.68018071850695239 -0.70519707714513458
+-0.077704403643809677 0.32271058904772337 -0.94330265629374277
+-0.080281277350241265 0.19739352602284616 -0.97703158208487906
+0.069740197633308881 0.8004723406749189 -0.59529852733606181
+0.135836225526941 0.719915307065364 -0.68063975088704354
+-0.23458495860622128 0.51571602924327076 -0.82401873423925942
+-0.35362935294171677 0.46556504362316592 -0.81129246939324073
+0.37149736972483099 0.52777252693426735 -0.76383628095354983
+0.28407954462258922 0.46039308870086582 -0.84103330267207554
+-0.067277074024322203 0.70227702532207648 -0.70871769768752158
+-0.13827368218737227 0.76957783850217643 -0.62340222914316235
+0.15985780358782284 0.19937696972895624 -0.96679589706089264
+0.039734588558411582 0.26026494835742225 -0.96471929550963276
+0.19300544019554747 0.62457262167826666 -0.75674166021493738
+0.26817151760031971 0.68929656115193505 -0.6730187872058685
+-0.15985780358782284 -0.19937696972895624 -0.96679589706089264
+-0.039734588558411582 -0.26026494835742225 -0.96471929550963276
+-0.19300544019554747 -0.62457262167826666 -0.75674166021493738
+-0.26817151760031971 -0.68929656115193505 -0.6730187872058685
+-0.9236940845413727 0.2726998137406515 -0.26911716736226499
+-0.88076789123048704 0.25952221836449818 -0.39610117388436322
+-0.90172313788306901 -0.18656099607880575 -0.38998766307204569
+-0.891573746743482 -0.30401279487901056 -0.33566720821021839
+-0.59529852733606159 0.069740197633308854 0.80047234067491879
+-0.68063975088704354 0.135836225526941 0.719915307065364
+-0.82401873423925942 -0.23458495860622128 0.51571602924327076
+-0.81129246939324073 -0.35362935294171677 0.46556504362316592
+-0.52777252693426735 0.76383628095354983 0.37149736972483099
+-0.46039308870086582 0.84103330267207554 0.28407954462258922
+-0.70227702532207648 0.70871769768752158 -0.067277074024322203
+-0.76957783850217643 0.62340222914316235 -0.13827368218737227
+-0.2726998137406515 -0.26911716736226499 0.9236940845413727
+-0.25952221836449818 -0.39610117388436322 0.88076789123048704
+0.18656099607880575 -0.38998766307204569 0.90172313788306901
+0.30401279487901056 -0.33566720821021839 0.891573746743482
+0.59529852733606159 -0.069740197633308854 0.80047234067491879
+0.68063975088704354 -0.135836225526941 0.719915307065364
+0.80047234067491879 0.59529852733606159 -0.069740197633308854
+0.719915307065364 0.68063975088704354 -0.135836225526941
+0.32271058904772337 0.94330265629374277 0.077704403643809677
+0.19739352602284616 0.97703158208487906 0.080281277350241265
+-0.26911716736226499 0.9236940845413727 -0.2726998137406515
+-0.39610117388436322 0.88076789123048704 -0.25952221836449818
+-0.38998766307204569 0.90172313788306901 0.18656099607880575
+-0.33566720821021839 0.891573746743482 0.30401279487901056
+-0.19937696972895624 0.96679589706089264 0.15985780358782284
+-0.26026494835742225 0.96471929550963276 0.039734588558411582
+-0.62457262167826666 0.75674166021493738 0.19300544019554747
+-0.68929656115193505 0.6730187872058685 0.26817151760031971
+-0.96679589706089264 0.15985780358782284 0.19937696972895624
+-0.96471929550963276 0.039734588558411582 0.26026494835742225
+-0.75674166021493738 0.19300544019554747 0.62457262167826666
+-0.6730187872058685 0.26817151760031971 0.68929656115193505
+-0.76383628095354983 0.37149736972483099 0.52777252693426735
+-0.84103330267207554 0.28407954462258922 0.46039308870086582
+-0.70871769768752158 -0.067277074024322203 0.70227702532207648
+-0.62340222914316235 -0.13827368218737227 0.76957783850217643
+-0.32839555720531111 -0.64061453708709615 0.69409608332024086
+-0.20012814034344359 -0.68018071850695239 0.70519707714513447
+-0.077704403643809677 -0.32271058904772337 0.94330265629374277
+-0.080281277350241265 -0.19739352602284616 0.97703158208487906
+0.76383628095354983 0.37149736972483099 -0.52777252693426735
+0.84103330267207554 0.28407954462258922 -0.46039308870086582
+0.70871769768752158 -0.067277074024322203 -0.70227702532207648
+0.62340222914316235 -0.13827368218737227 -0.76957783850217643
+0.32839555720531111 -0.64061453708709615 -0.69409608332024086
+0.20012814034344359 -0.68018071850695239 -0.70519707714513447
+0.077704403643809677 -0.32271058904772337 -0.94330265629374277
+0.080281277350241265 -0.19739352602284616 -0.97703158208487906
+0.2726998137406515 -0.26911716736226499 -0.9236940845413727
+0.25952221836449818 -0.39610117388436322 -0.88076789123048704
+-0.18656099607880575 -0.38998766307204569 -0.90172313788306901
+-0.30401279487901056 -0.33566720821021839 -0.891573746743482
+-0.76383628095354983 -0.37149736972483099 -0.52777252693426735
+-0.84103330267207554 -0.28407954462258922 -0.46039308870086582
+-0.70871769768752158 0.067277074024322203 -0.70227702532207648
+-0.62340222914316235 0.13827368218737227 -0.76957783850217643
+-0.59529852733606159 -0.069740197633308854 -0.80047234067491879
+-0.68063975088704354 -0.135836225526941 -0.719915307065364
+-0.82401873423925942 0.23458495860622128 -0.51571602924327076
+-0.81129246939324073 0.35362935294171677 -0.46556504362316592
+-0.8004723406749189 0.59529852733606181 0.069740197633308881
+-0.719915307065364 0.68063975088704354 0.135836225526941
+-0.51571602924327076 0.82401873423925942 -0.23458495860622128
+-0.46556504362316592 0.81129246939324073 -0.35362935294171677
+-0.64061453708709615 0.69409608332024098 -0.32839555720531116
+-0.68018071850695239 0.70519707714513458 -0.20012814034344362
+-0.32271058904772337 0.94330265629374277 -0.077704403643809677
+-0.19739352602284616 0.97703158208487906 -0.080281277350241265
+0.38998766307204569 0.90172313788306901 -0.18656099607880575
+0.33566720821021839 0.891573746743482 -0.30401279487901056
+0.19937696972895624 0.96679589706089264 -0.15985780358782284
+0.26026494835742225 0.96471929550963276 -0.039734588558411582
+0.62457262167826666 0.75674166021493738 -0.19300544019554747
+0.68929656115193505 0.6730187872058685 -0.26817151760031971
+0.75674166021493738 0.19300544019554747 -0.62457262167826666
+0.6730187872058685 0.26817151760031971 -0.68929656115193505
+0.15985780358782284 -0.19937696972895624 0.96679589706089264
+0.039734588558411582 -0.26026494835742225 0.96471929550963276
+0.19300544019554747 -0.62457262167826666 0.75674166021493738
+0.26817151760031971 -0.68929656115193505 0.6730187872058685
+0.37149736972483099 -0.52777252693426735 0.76383628095354983
+0.28407954462258922 -0.46039308870086582 0.84103330267207554
+-0.067277074024322203 -0.70227702532207648 0.70871769768752158
+-0.13827368218737227 -0.76957783850217643 0.62340222914316235
+-0.64061453708709615 -0.69409608332024086 0.32839555720531111
+-0.68018071850695239 -0.70519707714513447 0.20012814034344359
+-0.32271058904772337 -0.94330265629374277 0.077704403643809677
+-0.19739352602284616 -0.97703158208487906 0.080281277350241265
+-0.26911716736226499 -0.9236940845413727 0.2726998137406515
+-0.39610117388436322 -0.88076789123048704 0.25952221836449818
+-0.38998766307204569 -0.90172313788306901 -0.18656099607880575
+-0.33566720821021839 -0.891573746743482 -0.30401279487901056
+-0.37149736972483099 -0.52777252693426735 -0.76383628095354983
+-0.28407954462258922 -0.46039308870086582 -0.84103330267207554
+0.067277074024322203 -0.70227702532207648 -0.70871769768752158
+0.13827368218737227 -0.76957783850217643 -0.62340222914316235
+-0.069740197633308854 -0.80047234067491879 -0.59529852733606159
+-0.135836225526941 -0.719915307065364 -0.68063975088704354
+0.23458495860622128 -0.51571602924327076 -0.82401873423925942
+0.35362935294171677 -0.46556504362316592 -0.81129246939324073
+0.59529852733606159 0.069740197633308854 -0.80047234067491879
+0.68063975088704354 0.135836225526941 -0.719915307065364
+0.891573746743482 0.30401279487901056 -0.33566720821021839
+0.52777252693426735 0.76383628095354983 -0.37149736972483099
+0.46039308870086582 0.84103330267207554 -0.28407954462258922
+-0.19937696972895624 -0.96679589706089264 -0.15985780358782284
+-0.26026494835742225 -0.96471929550963276 -0.039734588558411582
+-0.62457262167826666 -0.75674166021493738 -0.19300544019554747
+-0.68929656115193505 -0.6730187872058685 -0.26817151760031971
+-0.96679589706089264 -0.15985780358782284 -0.19937696972895624
+-0.96471929550963276 -0.039734588558411582 -0.26026494835742225
+-0.75674166021493738 -0.19300544019554747 -0.62457262167826666
+-0.6730187872058685 -0.26817151760031971 -0.68929656115193505
+-0.52777252693426735 -0.76383628095354983 -0.37149736972483099
+-0.46039308870086582 -0.84103330267207554 -0.28407954462258922
+-0.70227702532207648 -0.70871769768752158 0.067277074024322203
+-0.76957783850217643 -0.62340222914316235 0.13827368218737227
+-0.69409608332024086 -0.32839555720531111 0.64061453708709615
+-0.70519707714513458 -0.20012814034344362 0.6801807185069525
+-0.94330265629374277 -0.077704403643809677 0.32271058904772337
+-0.97703158208487906 -0.080281277350241265 0.19739352602284616
+-0.80047234067491879 -0.59529852733606159 -0.069740197633308854
+-0.719915307065364 -0.68063975088704354 -0.135836225526941
+-0.51571602924327076 -0.82401873423925942 0.23458495860622128
+-0.46556504362316592 -0.81129246939324073 0.35362935294171677
+0.069740197633308854 -0.80047234067491879 0.59529852733606159
+0.135836225526941 -0.719915307065364 0.68063975088704354
+-0.23458495860622128 -0.51571602924327076 0.82401873423925942
+-0.35362935294171677 -0.46556504362316592 0.81129246939324073
+-0.69409608332024086 0.32839555720531111 -0.64061453708709615
+-0.70519707714513458 0.20012814034344362 -0.6801807185069525
+-0.94330265629374277 0.077704403643809677 -0.32271058904772337
+-0.97703158208487906 0.080281277350241265 -0.19739352602284616
+-0.9236940845413727 -0.2726998137406515 0.26911716736226499
+-0.88076789123048704 -0.25952221836449818 0.39610117388436322
+-0.90172313788306901 0.18656099607880575 0.38998766307204569
+-0.891573746743482 0.30401279487901056 0.33566720821021839
+0.13624095340381404 0.9506072962094394 0.27889813733511903
+0.069452331980627613 0.9168554803037775 0.39313153246640248
+0.098941938751961223 0.76032257344343512 0.64081678241520534
+-0.58750761901107262 0.67170915887432037 0.45126666560725853
+-0.52372394783737519 0.63610018157997195 0.56664784959934433
+-0.32839555720531116 0.64061453708709593 0.69409608332024109
+-0.4993406306021807 0 0.86640575634619166
+-0.39313153246640237 0.069452331980627585 0.9168554803037775
+-0.27269981374065155 0.26911716736226504 0.9236940845413727
+0.27889813733511903 -0.13624095340381404 0.9506072962094394
+0.28075529872380572 0 0.95977938206574664
+0.15985780358782287 0.19937696972895619 0.96679589706089264
+-0.27889813733511903 -0.13624095340381404 -0.9506072962094394
+-0.28075529872380572 0 -0.95977938206574664
+-0.15985780358782287 0.19937696972895619 -0.96679589706089264
+-0.67170915887432037 0.4512666656072587 -0.58750761901107273
+-0.56664784959934422 0.52372394783737519 -0.63610018157997195
+-0.37149736972483099 0.52777252693426735 -0.76383628095354983
+-0.13624095340381404 0.9506072962094394 -0.27889813733511903
+-0.069452331980627585 0.9168554803037775 -0.39313153246640237
+-0.069740197633308867 0.8004723406749189 -0.59529852733606159
+0.58750761901107262 0.67170915887432037 -0.45126666560725853
+0.52372394783737508 0.63610018157997195 -0.56664784959934422
+0.32839555720531116 0.64061453708709593 -0.69409608332024109
+0.4993406306021807 0 -0.86640575634619166
+0.39313153246640237 0.069452331980627585 -0.9168554803037775
+0.27269981374065155 0.26911716736226504 -0.9236940845413727
+0 -0.86640575634619166 0.4993406306021807
+0.069452331980627585 -0.9168554803037775 0.39313153246640237
+-0.13624095340381404 -0.9506072962094394 -0.27889813733511903
+0 -0.95977938206574664 -0.28075529872380572
+-0.49934063060218076 0 -0.86640575634619166
+-0.39313153246640237 -0.069452331980627585 -0.9168554803037775
+-0.27269981374065155 -0.26911716736226504 -0.9236940845413727
+-0.9506072962094394 0.27889813733511903 0.13624095340381404
+-0.95977938206574664 0.28075529872380572 0
+-0.96679589706089264 0.15985780358782287 -0.19937696972895619
+-0.27889813733511903 -0.13624095340381404 0.9506072962094394
+-0.39313153246640237 -0.069452331980627585 0.9168554803037775
+-0.59529852733606148 -0.069740197633308854 0.8004723406749189
+-0.67170915887432037 0.45126666560725853 0.58750761901107262
+-0.63610018157997195 0.56664784959934433 0.52372394783737519
+-0.64061453708709593 0.69409608332024109 0.32839555720531116
+-0.27889813733511903 0.13624095340381404 0.9506072962094394
+-0.28075529872380572 0 0.95977938206574664
+-0.15985780358782287 -0.19937696972895619 0.96679589706089264
+0.27889813733511903 0.13624095340381404 0.9506072962094394
+0.39313153246640237 0.069452331980627585 0.9168554803037775
+0.59529852733606148 0.069740197633308854 0.8004723406749189
+0.64081678241520534 0.098941938751961223 0.76032257344343512
+0.9168554803037775 0.39313153246640237 0.069452331980627585
+0.75327597529184531 0.65407554465688111 0.068996282000725426
+0.13624095340381404 0.9506072962094394 -0.27889813733511903
+0 0.95977938206574664 -0.28075529872380572
+-0.19937696972895619 0.96679589706089264 -0.15985780358782287
+0 0.86640575634619166 0.4993406306021807
+-0.069452331980627613 0.9168554803037775 0.39313153246640248
+-0.26911716736226515 0.92369408454137258 0.27269981374065166
+-0.86640575634619166 0.4993406306021807 0
+-0.9168554803037775 0.39313153246640237 0.069452331980627585
+-0.92369408454137258 0.27269981374065166 0.26911716736226515
+-0.45126666560725853 0.58750761901107262 0.67170915887432037
+-0.56664784959934433 0.52372394783737519 0.63610018157997195
+-0.69409608332024109 0.32839555720531116 0.64061453708709593
+-0.67170915887432037 -0.45126666560725853 0.58750761901107273
+-0.56664784959934422 -0.52372394783737508 0.63610018157997195
+-0.37149736972483099 -0.52777252693426735 0.76383628095354983
+0.45126666560725853 0.58750761901107262 -0.67170915887432037
+0.56664784959934433 0.52372394783737519 -0.63610018157997195
+0.69409608332024109 0.32839555720531116 -0.64061453708709593
+0.37149736972483099 -0.52777252693426735 -0.76383628095354983
+0.27889813733511903 0.13624095340381404 -0.9506072962094394
+0.28075529872380572 0 -0.95977938206574664
+0.15985780358782287 -0.19937696972895619 -0.96679589706089264
+-0.45126666560725853 -0.58750761901107262 -0.67170915887432037
+-0.56664784959934433 -0.52372394783737519 -0.63610018157997195
+-0.69409608332024109 -0.32839555720531116 -0.64061453708709593
+-0.27889813733511903 0.13624095340381404 -0.9506072962094394
+-0.39313153246640237 0.069452331980627585 -0.9168554803037775
+-0.59529852733606148 0.069740197633308854 -0.8004723406749189
+-0.9506072962094394 0.27889813733511903 -0.13624095340381404
+-0.9168554803037775 0.39313153246640237 -0.069452331980627585
+-0.8004723406749189 0.59529852733606159 -0.069740197633308867
+-0.45126666560725853 0.58750761901107273 -0.67170915887432037
+-0.52372394783737508 0.63610018157997195 -0.56664784959934422
+-0.52777252693426735 0.76383628095354983 -0.37149736972483099
+-0.13624095340381404 0.9506072962094394 0.27889813733511903
+0 0.95977938206574664 0.28075529872380572
+0.19937696972895619 0.96679589706089264 0.15985780358782287
+0 0.86640575634619166 -0.4993406306021807
+0.069452331980627585 0.9168554803037775 -0.39313153246640237
+0.26911716736226515 0.92369408454137258 -0.27269981374065166
+0.86640575634619166 0.49934063060218076 0
+0.9168554803037775 0.39313153246640237 -0.069452331980627585
+0.9236940845413727 0.27269981374065155 -0.26911716736226504
+0.49934063060218076 0 0.86640575634619166
+0.39313153246640237 -0.069452331980627585 0.9168554803037775
+0.27269981374065155 -0.26911716736226504 0.9236940845413727
+0.32839555720531116 -0.64061453708709593 0.69409608332024109
+-0.45126666560725864 -0.58750761901107262 0.67170915887432026
+-0.52372394783737519 -0.63610018157997184 0.56664784959934422
+-0.52777252693426735 -0.76383628095354983 0.37149736972483099
+0.13624095340381404 -0.9506072962094394 0.27889813733511903
+0 -0.95977938206574664 0.28075529872380572
+-0.19937696972895619 -0.96679589706089264 0.15985780358782287
+-0.58750761901107262 -0.67170915887432037 -0.45126666560725853
+-0.52372394783737508 -0.63610018157997195 -0.56664784959934422
+-0.32839555720531116 -0.64061453708709593 -0.69409608332024109
+0.13624095340381404 -0.9506072962094394 -0.27889813733511903
+0.069452331980627585 -0.9168554803037775 -0.39313153246640237
+0.069740197633308854 -0.8004723406749189 -0.59529852733606148
+0.27889813733511903 -0.13624095340381404 -0.9506072962094394
+0.39313153246640237 -0.069452331980627585 -0.9168554803037775
+0.59529852733606148 -0.069740197633308854 -0.8004723406749189
+0.67170915887432037 0.45126666560725853 -0.58750761901107262
+0.63610018157997184 0.56664784959934433 -0.52372394783737508
+0.64061453708709593 0.69409608332024109 -0.32839555720531116
+0 -0.86640575634619166 -0.49934063060218076
+-0.069452331980627585 -0.9168554803037775 -0.39313153246640237
+-0.26911716736226504 -0.9236940845413727 -0.27269981374065155
+-0.86640575634619166 -0.4993406306021807 0
+-0.9168554803037775 -0.39313153246640248 -0.069452331980627613
+-0.9236940845413727 -0.27269981374065155 -0.26911716736226504
+-0.67170915887432037 -0.45126666560725853 -0.58750761901107262
+-0.63610018157997184 -0.56664784959934433 -0.52372394783737508
+-0.64061453708709593 -0.69409608332024109 -0.32839555720531116
+-0.58750761901107262 -0.67170915887432026 0.45126666560725864
+-0.63610018157997195 -0.56664784959934422 0.52372394783737519
+-0.76383628095354983 -0.37149736972483099 0.52777252693426735
+-0.9506072962094394 -0.27889813733511903 0.13624095340381404
+-0.9168554803037775 -0.39313153246640248 0.069452331980627613
+-0.8004723406749189 -0.59529852733606148 0.069740197633308854
+-0.13624095340381404 -0.9506072962094394 0.27889813733511903
+-0.069452331980627585 -0.9168554803037775 0.39313153246640237
+-0.069740197633308854 -0.8004723406749189 0.59529852733606148
+-0.58750761901107262 0.67170915887432026 -0.45126666560725864
+-0.63610018157997184 0.56664784959934422 -0.52372394783737519
+-0.76383628095354983 0.37149736972483099 -0.52777252693426735
+-0.9506072962094394 -0.27889813733511903 -0.13624095340381404
+-0.95977938206574664 -0.28075529872380572 0
+-0.96679589706089264 -0.15985780358782287 0.19937696972895619
+0 0.62578188869003271 0.77999809473327264
+0.054857140713616914 0.54001796879892028 0.83986385056568236
+0.21570896554595276 0.38998187620182151 0.89436470058605511
+0.20226550379446337 0 0.97933072349169759
+0.28910030252843322 0.30397342055421106 0.90687073458352596
+-0.11626913535565189 0.55392361119767786 0.82440895259656954
+0.095052466200525557 0.7378162794185118 0.66704995977036108
+-0.071858277492354974 0.43765447584202588 0.8962672300889245
+-0.067277074024322245 0.70227702532207659 0.70871769768752169
+-0.20828740048796671 0.8247164420172246 0.52579382752597525
+0.071858277492354974 0.43765447584202588 0.8962672300889245
+-0.23458495860622128 0.51571602924327076 0.82401873423925942
+-0.46626606661797826 0.69116244652106429 0.55216883979414844
+-0.46867704983435055 0.40632940254264294 0.78437123837371059
+-0.077704403643809677 0.32271058904772337 0.94330265629374277
+-0.42716188369754932 0.13899360672691585 0.89342795031552757
+-0.081370946056690235 0.066381045638217215 0.9944708773603258
+-0.11626913535565189 0.55392361119767786 -0.82440895259656954
+-0.033903577486650904 0.48516082808530331 -0.87376742805233321
+0.077704403643809677 0.32271058904772337 -0.94330265629374277
+0.42716188369754932 0.13899360672691585 -0.89342795031552757
+0.081370946056690235 0.066381045638217215 -0.9944708773603258
+0 0.62578188869003271 -0.77999809473327264
+-0.18656099607880564 0.38998766307204552 -0.90172313788306913
+-0.20226550379446337 0 -0.97933072349169759
+-0.41838703947458172 0.27466844612618396 -0.86574218443040096
+0.11626913535565189 0.55392361119767786 -0.82440895259656954
+-0.19300544019554741 0.62457262167826677 -0.75674166021493716
+-0.55216883979414833 0.46626606661797837 -0.69116244652106429
+-0.33994835690442565 0.74334549596053456 -0.57608383788574391
+0.071858277492354974 0.43765447584202588 -0.8962672300889245
+0.067277074024322245 0.70227702532207659 -0.70871769768752169
+-0.13899360672691591 0.89342795031552769 -0.42716188369754926
+0.20828740048796671 0.8247164420172246 -0.52579382752597525
+-0.071858277492354974 0.43765447584202588 -0.8962672300889245
+0.23458495860622128 0.51571602924327076 -0.82401873423925942
+0.46626606661797826 0.69116244652106429 -0.55216883979414844
+0.46867704983435055 0.40632940254264294 -0.78437123837371059
+0.13899360672691585 -0.89342795031552757 0.42716188369754932
+0.066381045638217215 -0.9944708773603258 0.081370946056690235
+0 -0.97933072349169759 -0.20226550379446337
+0.90687073458352596 0.28910030252843322 0.30397342055421106
+0.071858277492354974 -0.43765447584202588 -0.8962672300889245
+-0.23458495860622128 -0.51571602924327076 -0.82401873423925942
+-0.46626606661797826 -0.69116244652106429 -0.55216883979414844
+-0.46867704983435055 -0.40632940254264294 -0.78437123837371059
+-0.82440895259656954 0.11626913535565189 -0.55392361119767786
+-0.87376742805233321 0.033903577486650911 -0.48516082808530336
+-0.94330265629374277 -0.077704403643809677 -0.32271058904772337
+-0.89342795031552757 -0.42716188369754932 -0.13899360672691585
+-0.9944708773603258 -0.081370946056690249 -0.066381045638217229
+-0.82440895259656954 0.11626913535565189 0.55392361119767786
+-0.75674166021493716 -0.19300544019554741 0.62457262167826677
+-0.69116244652106429 -0.55216883979414833 0.46626606661797837
+-0.57608383788574391 -0.33994835690442565 0.74334549596053456
+-0.43765447584202588 0.8962672300889245 0.071858277492354974
+-0.70227702532207659 0.70871769768752169 0.067277074024322245
+-0.89342795031552769 0.42716188369754926 -0.13899360672691591
+-0.8247164420172246 0.52579382752597525 0.20828740048796671
+-0.11626913535565189 -0.55392361119767786 0.82440895259656954
+0.077704403643809677 -0.32271058904772337 0.94330265629374277
+0.42716188369754932 -0.13899360672691585 0.89342795031552757
+0.081370946056690235 -0.066381045638217215 0.9944708773603258
+0.70871769768752169 -0.067277074024322245 0.70227702532207659
+0.52579382752597525 -0.20828740048796671 0.8247164420172246
+0.55392361119767786 0.82440895259656954 -0.11626913535565189
+0.73781627941851213 0.66704995977036097 0.095052466200525487
+0.62578188869003271 0.77999809473327264 0
+0 0.97933072349169759 0.20226550379446331
+0.30397342055421117 0.90687073458352585 0.28910030252843327
+-0.55392361119767786 0.82440895259656954 -0.11626913535565189
+-0.48516082808530336 0.87376742805233321 -0.033903577486650911
+-0.32271058904772337 0.94330265629374277 0.077704403643809677
+-0.13899360672691585 0.89342795031552757 0.42716188369754932
+-0.066381045638217229 0.9944708773603258 0.081370946056690249
+-0.43765447584202588 0.8962672300889245 -0.071858277492354974
+-0.51571602924327076 0.82401873423925942 0.23458495860622128
+-0.69116244652106418 0.55216883979414833 0.46626606661797837
+-0.40632940254264294 0.78437123837371081 0.46867704983435066
+-0.8962672300889245 -0.071858277492354974 0.43765447584202588
+-0.87376742805233321 0.033903577486650911 0.48516082808530336
+-0.82401873423925942 0.23458495860622128 0.51571602924327076
+-0.55216883979414844 0.46626606661797843 0.69116244652106429
+-0.78437123837371059 0.46867704983435055 0.40632940254264294
+-0.8962672300889245 0.071858277492354974 0.43765447584202588
+-0.70871769768752169 0.067277074024322245 0.70227702532207659
+-0.42716188369754926 -0.13899360672691591 0.89342795031552769
+-0.52579382752597525 0.20828740048796671 0.8247164420172246
+0 -0.62578188869003271 0.77999809473327264
+-0.18656099607880564 -0.38998766307204552 0.90172313788306913
+-0.20226550379446331 0 0.97933072349169759
+-0.41838703947458172 -0.27466844612618396 0.86574218443040096
+0.70871769768752169 0.067277074024322245 -0.70227702532207659
+0.42716188369754926 -0.13899360672691591 -0.89342795031552769
+0.52579382752597525 0.20828740048796671 -0.8247164420172246
+0 -0.62578188869003271 -0.77999809473327264
+0.054857140713616921 -0.54001796879892028 -0.83986385056568236
+0.18656099607880564 -0.38998766307204552 -0.90172313788306913
+0.20226550379446331 0 -0.97933072349169759
+0.41838703947458172 -0.27466844612618396 -0.86574218443040096
+0.11626913535565189 -0.55392361119767786 -0.82440895259656954
+-0.077704403643809677 -0.32271058904772337 -0.94330265629374277
+-0.42716188369754932 -0.13899360672691585 -0.89342795031552757
+-0.081370946056690235 -0.066381045638217215 -0.9944708773603258
+-0.8962672300889245 -0.071858277492354974 -0.43765447584202588
+-0.70871769768752169 -0.067277074024322245 -0.70227702532207659
+-0.42716188369754932 0.13899360672691591 -0.89342795031552757
+-0.52579382752597525 -0.20828740048796671 -0.8247164420172246
+-0.82440895259656954 -0.11626913535565189 -0.55392361119767786
+-0.81891028733871629 0 -0.57392154628557124
+-0.75674166021493716 0.19300544019554741 -0.62457262167826677
+-0.69116244652106429 0.55216883979414833 -0.46626606661797837
+-0.57608383788574391 0.33994835690442565 -0.74334549596053456
+-0.55392361119767786 0.82440895259656954 0.11626913535565189
+-0.57392154628557124 0.81891028733871629 0
+-0.62457262167826677 0.75674166021493716 -0.19300544019554741
+-0.46626606661797826 0.6911624465210644 -0.55216883979414844
+-0.74334549596053456 0.57608383788574391 -0.33994835690442565
+-0.62578188869003271 0.77999809473327264 0
+-0.38998766307204552 0.90172313788306913 -0.18656099607880564
+0 0.97933072349169759 -0.20226550379446331
+-0.27466844612618396 0.86574218443040096 -0.41838703947458172
+0.32271058904772337 0.94330265629374277 -0.077704403643809677
+0.13899360672691585 0.89342795031552757 -0.42716188369754932
+0.066381045638217229 0.9944708773603258 -0.081370946056690249
+0.43765447584202588 0.8962672300889245 0.071858277492354974
+0.48516082808530336 0.87376742805233321 -0.033903577486650911
+0.51571602924327076 0.82401873423925942 -0.23458495860622128
+0.69116244652106418 0.55216883979414833 -0.46626606661797837
+0.40632940254264294 0.78437123837371081 -0.46867704983435066
+0.82401873423925942 0.23458495860622128 -0.51571602924327076
+0.55216883979414844 0.46626606661797843 -0.69116244652106429
+0.78437123837371059 0.46867704983435055 -0.40632940254264294
+-0.071858277492354974 -0.43765447584202588 0.8962672300889245
+0.23458495860622128 -0.51571602924327076 0.82401873423925942
+0.46867704983435055 -0.40632940254264294 0.78437123837371059
+0.071858277492354974 -0.43765447584202588 0.8962672300889245
+0.054857140713616921 -0.54001796879892028 0.83986385056568236
+0.067277074024322245 -0.70227702532207659 0.70871769768752169
+-0.13899360672691591 -0.89342795031552769 0.42716188369754926
+0.20828740048796671 -0.8247164420172246 0.52579382752597525
+-0.62578188869003271 -0.77999809473327264 0
+-0.38998766307204552 -0.90172313788306913 0.18656099607880564
+0 -0.97933072349169759 0.20226550379446331
+-0.27466844612618396 -0.86574218443040096 0.41838703947458172
+-0.55392361119767786 -0.82440895259656954 0.11626913535565189
+-0.32271058904772337 -0.94330265629374277 -0.077704403643809677
+-0.13899360672691585 -0.89342795031552757 -0.42716188369754932
+-0.066381045638217215 -0.9944708773603258 -0.081370946056690235
+-0.071858277492354974 -0.43765447584202588 -0.8962672300889245
+-0.054857140713616921 -0.54001796879892028 -0.83986385056568236
+-0.067277074024322245 -0.70227702532207659 -0.70871769768752169
+0.13899360672691591 -0.89342795031552757 -0.42716188369754932
+-0.20828740048796671 -0.8247164420172246 -0.52579382752597525
+-0.11626913535565189 -0.55392361119767786 -0.82440895259656954
+0.19300544019554741 -0.62457262167826677 -0.75674166021493716
+0.82440895259656954 0.11626913535565189 -0.55392361119767786
+0.89342795031552757 0.42716188369754932 -0.13899360672691585
+0.43765447584202588 0.8962672300889245 -0.071858277492354974
+0.70227702532207659 0.70871769768752169 -0.067277074024322245
+0.8247164420172246 0.52579382752597525 -0.20828740048796671
+-0.43765447584202588 -0.8962672300889245 0.071858277492354974
+-0.51571602924327076 -0.82401873423925942 -0.23458495860622128
+-0.69116244652106418 -0.55216883979414833 -0.46626606661797837
+-0.40632940254264294 -0.78437123837371081 -0.46867704983435066
+-0.8962672300889245 0.071858277492354974 -0.43765447584202588
+-0.82401873423925942 -0.23458495860622128 -0.51571602924327076
+-0.55216883979414844 -0.46626606661797843 -0.69116244652106429
+-0.78437123837371059 -0.46867704983435055 -0.40632940254264294
+-0.43765447584202588 -0.8962672300889245 -0.071858277492354974
+-0.54001796879892028 -0.83986385056568236 -0.054857140713616921
+-0.70227702532207659 -0.70871769768752169 -0.067277074024322245
+-0.89342795031552769 -0.42716188369754926 0.13899360672691591
+-0.8247164420172246 -0.52579382752597525 -0.20828740048796671
+-0.77999809473327264 0 0.62578188869003271
+-0.83986385056568236 -0.054857140713616914 0.54001796879892028
+-0.90172313788306913 -0.18656099607880564 0.38998766307204552
+-0.97933072349169759 -0.20226550379446331 0
+-0.86574218443040096 -0.41838703947458172 0.27466844612618396
+-0.55392361119767786 -0.82440895259656954 -0.11626913535565189
+-0.62457262167826677 -0.75674166021493716 0.19300544019554741
+-0.46626606661797837 -0.69116244652106429 0.55216883979414833
+-0.74334549596053456 -0.57608383788574391 0.33994835690442565
+0.11626913535565189 -0.55392361119767786 0.82440895259656954
+-0.19300544019554741 -0.62457262167826677 0.75674166021493716
+-0.55216883979414844 -0.46626606661797826 0.6911624465210644
+-0.33994835690442565 -0.74334549596053456 0.57608383788574391
+-0.77999809473327264 0 -0.62578188869003271
+-0.90172313788306913 0.18656099607880564 -0.38998766307204552
+-0.97933072349169759 0.20226550379446331 0
+-0.86574218443040096 0.41838703947458172 -0.27466844612618396
+-0.82440895259656954 -0.11626913535565189 0.55392361119767786
+-0.94330265629374277 0.077704403643809677 0.32271058904772337
+-0.89342795031552757 0.42716188369754932 0.13899360672691585
+-0.9944708773603258 0.081370946056690249 0.066381045638217229
+-0.20793674136609452 0.86400769557376311 0.45853354684184838
+-0.27572854131968011 0.82875656716879009 0.48696645046278492
+-0.53398612240605781 0.40547414873191501 0.74192286377215233
+-0.51219972690999771 0.34179011670600545 0.78792826822967776
+-0.12208483180161088 -2.4628875390745807e-18 0.9925196692479058
+-0.040828298939112564 0 0.99916617737278246
+0.12208483180161088 -2.4628875390745807e-18 -0.9925196692479058
+0.040828298939112564 0 -0.99916617737278246
+-0.45853354684184816 0.20793674136609455 -0.86400769557376311
+-0.48696645046278469 0.27572854131968005 -0.82875656716879031
+-0.40547414873191512 0.74192286377215233 -0.53398612240605781
+-0.34179011670600551 0.78792826822967776 -0.5121997269099976
+0.20793674136609452 0.86400769557376311 -0.45853354684184838
+0.27572854131968011 0.82875656716879009 -0.48696645046278492
+0.53398612240605781 0.40547414873191501 -0.74192286377215233
+0.51219972690999771 0.34179011670600545 -0.78792826822967776
+-2.4628875390745807e-18 -0.9925196692479058 0.12208483180161088
+0 -0.99916617737278246 0.040828298939112564
+0.20793674136609455 -0.86400769557376311 -0.45853354684184816
+-0.53398612240605781 -0.40547414873191501 -0.74192286377215233
+-0.51219972690999771 -0.34179011670600545 -0.78792826822967776
+-0.9925196692479058 -0.12208483180161092 2.4628875390745815e-18
+-0.99916617737278246 -0.040828298939112578 0
+-0.53398612240605769 -0.40547414873191501 0.74192286377215222
+-0.5121997269099976 -0.34179011670600551 0.78792826822967776
+-0.86400769557376311 0.45853354684184838 0.20793674136609452
+-0.8287565671687902 0.48696645046278497 0.27572854131968016
+0.12208483180161088 2.4628875390745807e-18 0.9925196692479058
+0.040828298939112564 0 0.99916617737278246
+0.45853354684184838 -0.20793674136609452 0.86400769557376311
+0.48696645046278492 -0.27572854131968011 0.82875656716879031
+2.4628875390745819e-18 0.9925196692479058 0.12208483180161094
+0 0.99916617737278246 0.040828298939112578
+-0.40547414873191501 0.74192286377215211 0.53398612240605781
+-0.34179011670600545 0.78792826822967776 0.51219972690999771
+-0.74192286377215222 0.53398612240605792 0.40547414873191506
+-0.78792826822967776 0.51219972690999771 0.34179011670600545
+-0.45853354684184838 0.20793674136609452 0.86400769557376311
+-0.48696645046278492 0.27572854131968011 0.82875656716879031
+-0.45853354684184816 -0.20793674136609455 0.86400769557376311
+-0.48696645046278469 -0.27572854131968005 0.82875656716879031
+0.45853354684184838 0.20793674136609452 -0.86400769557376311
+0.48696645046278492 0.27572854131968011 -0.82875656716879031
+0.45853354684184816 -0.20793674136609455 -0.86400769557376311
+0.48696645046278469 -0.27572854131968005 -0.82875656716879031
+-0.12208483180161088 2.4628875390745807e-18 -0.9925196692479058
+-0.040828298939112564 0 -0.99916617737278246
+-0.45853354684184838 -0.20793674136609452 -0.86400769557376311
+-0.48696645046278492 -0.27572854131968011 -0.82875656716879031
+-0.53398612240605769 0.40547414873191501 -0.74192286377215222
+-0.5121997269099976 0.34179011670600551 -0.78792826822967776
+-0.74192286377215222 0.53398612240605769 -0.40547414873191501
+-0.78792826822967776 0.5121997269099976 -0.34179011670600551
+-0.20793674136609455 0.86400769557376311 -0.45853354684184816
+-0.27572854131968005 0.82875656716879031 -0.48696645046278469
+-2.4628875390745819e-18 0.9925196692479058 -0.12208483180161094
+0 0.99916617737278246 -0.040828298939112578
+0.40547414873191501 0.74192286377215211 -0.53398612240605781
+0.34179011670600545 0.78792826822967776 -0.51219972690999771
+0.74192286377215222 0.53398612240605769 -0.40547414873191495
+0.78792826822967776 0.51219972690999771 -0.34179011670600545
+0.51219972690999771 -0.34179011670600545 0.78792826822967776
+0.20793674136609452 -0.86400769557376311 0.45853354684184838
+-0.20793674136609455 -0.86400769557376311 0.45853354684184816
+-0.27572854131968005 -0.82875656716879031 0.48696645046278469
+2.4628875390745807e-18 -0.9925196692479058 -0.12208483180161088
+0 -0.99916617737278246 -0.040828298939112564
+-0.20793674136609452 -0.86400769557376311 -0.45853354684184838
+-0.27572854131968011 -0.82875656716879031 -0.48696645046278492
+0.5121997269099976 -0.34179011670600551 -0.78792826822967776
+0.86400769557376311 0.45853354684184838 -0.20793674136609452
+0.82875656716879031 0.48696645046278492 -0.27572854131968011
+-0.40547414873191501 -0.74192286377215233 -0.53398612240605781
+-0.34179011670600545 -0.78792826822967776 -0.51219972690999771
+-0.74192286377215222 -0.53398612240605769 -0.40547414873191495
+-0.78792826822967776 -0.51219972690999771 -0.34179011670600545
+-0.86400769557376311 -0.45853354684184838 -0.20793674136609452
+-0.82875656716879031 -0.48696645046278492 -0.27572854131968011
+-0.86400769557376311 -0.45853354684184816 0.20793674136609455
+-0.82875656716879031 -0.48696645046278469 0.27572854131968005
+-0.74192286377215222 -0.53398612240605769 0.40547414873191501
+-0.78792826822967776 -0.5121997269099976 0.34179011670600551
+-0.40547414873191512 -0.74192286377215233 0.53398612240605781
+-0.34179011670600551 -0.78792826822967776 0.5121997269099976
+-0.86400769557376311 0.45853354684184816 -0.20793674136609455
+-0.82875656716879031 0.48696645046278469 -0.27572854131968005
+-0.9925196692479058 0.12208483180161094 -2.4628875390745819e-18
+-0.99916617737278246 0.040828298939112578 0
+0.11295049101987709 0.38368834989905559 0.91652901576006229
+0.15490162002342259 0.32578454432242576 0.93266817185682316
+-4.927907460000931e-18 0.82511526248824529 0.56496442685265946
+-6.5652635294160463e-18 0.77991607152390563 0.62588411178006298
+-0.38505005624480637 0.58714124035889637 0.7120404609681168
+-0.31802330015895514 0.58336686281126149 0.74735820322637392
+-3.6838438251301899e-18 0.67939657443508372 0.73377128224391142
+-6.5571195165482265e-18 0.73132225045616739 0.68203208574650398
+-0.23797402212934904 0.20209118411408986 0.95001448309746583
+-0.19654920871264409 0.26534356265230635 0.94390741193901806
+-0.18275773351615091 0.56644608341520675 0.80357852474018521
+-0.25063608611031912 0.57642063043274483 0.7777665518334006
+0.23797402212934904 0.20209118411408983 0.95001448309746583
+0.19654920871264411 0.2653435626523063 0.94390741193901806
+-0.1129504910198771 0.38368834989905565 0.91652901576006229
+-0.15490162002342261 0.32578454432242587 0.93266817185682316
+-0.23797402212934904 0.20209118411408983 -0.95001448309746583
+-0.19654920871264411 0.2653435626523063 -0.94390741193901806
+0.1129504910198771 0.38368834989905565 -0.91652901576006229
+0.15490162002342261 0.32578454432242587 -0.93266817185682316
+-0.38505005624480643 0.58714124035889637 -0.71204046096811668
+-0.31802330015895514 0.58336686281126149 -0.74735820322637392
+-0.11295049101987709 0.38368834989905559 -0.91652901576006229
+-0.15490162002342259 0.32578454432242576 -0.93266817185682316
+4.927907460000931e-18 0.82511526248824529 -0.56496442685265946
+6.5652635294160463e-18 0.77991607152390563 -0.62588411178006298
+-0.18275773351615091 0.56644608341520641 -0.80357852474018532
+-0.25063608611031912 0.57642063043274483 -0.7777665518334006
+0.38505005624480637 0.58714124035889637 -0.7120404609681168
+0.31802330015895514 0.58336686281126149 -0.74735820322637392
+3.6838438251301899e-18 0.67939657443508372 -0.73377128224391142
+6.5571195165482265e-18 0.73132225045616739 -0.68203208574650398
+0.23797402212934904 0.20209118411408986 -0.95001448309746583
+0.19654920871264409 0.26534356265230635 -0.94390741193901806
+0.18275773351615091 0.56644608341520675 -0.80357852474018521
+0.25063608611031912 0.57642063043274483 -0.7777665518334006
+-0.23797402212934904 -0.20209118411408986 -0.95001448309746583
+-0.19654920871264409 -0.26534356265230635 -0.94390741193901806
+-0.18275773351615091 -0.56644608341520675 -0.80357852474018521
+-0.25063608611031912 -0.57642063043274483 -0.7777665518334006
+-0.95001448309746583 0.23797402212934904 -0.20209118411408983
+-0.94390741193901806 0.19654920871264411 -0.2653435626523063
+-0.91652901576006229 -0.1129504910198771 -0.38368834989905565
+-0.93266817185682316 -0.15490162002342261 -0.32578454432242587
+-0.56496442685265946 4.927907460000931e-18 0.82511526248824529
+-0.62588411178006298 6.5652635294160463e-18 0.77991607152390563
+-0.80357852474018532 -0.18275773351615091 0.56644608341520641
+-0.77776655183340049 -0.25063608611031907 0.57642063043274483
+-0.58714124035889637 0.7120404609681168 0.38505005624480637
+-0.58336686281126149 0.74735820322637392 0.31802330015895514
+-0.67939657443508372 0.73377128224391142 3.6838438251301899e-18
+-0.73132225045616739 0.68203208574650398 6.5571195165482265e-18
+-0.23797402212934904 -0.20209118411408983 0.95001448309746583
+-0.19654920871264411 -0.2653435626523063 0.94390741193901806
+0.1129504910198771 -0.38368834989905565 0.91652901576006229
+0.15490162002342261 -0.32578454432242587 0.93266817185682316
+0.73377128224391142 -3.6838438251301899e-18 0.67939657443508372
+0.68203208574650398 -6.5571195165482265e-18 0.73132225045616739
+0.70871769768752158 0.067277074024322203 0.70227702532207648
+0.56496442685265946 -4.927907460000931e-18 0.82511526248824529
+0.62588411178006298 -6.5652635294160463e-18 0.77991607152390563
+0.82511526248824529 0.56496442685265946 -4.927907460000931e-18
+0.77991607152390563 0.62588411178006298 -6.5652635294160463e-18
+0.38368834989905559 0.91652901576006229 0.11295049101987709
+0.32578454432242576 0.93266817185682316 0.15490162002342259
+-0.20209118411408983 0.95001448309746583 -0.23797402212934904
+-0.2653435626523063 0.94390741193901806 -0.19654920871264411
+-0.38368834989905565 0.91652901576006229 0.1129504910198771
+-0.32578454432242587 0.93266817185682316 0.15490162002342261
+-0.20209118411408986 0.95001448309746583 0.23797402212934904
+-0.26534356265230635 0.94390741193901806 0.19654920871264409
+-0.56644608341520675 0.80357852474018521 0.18275773351615091
+-0.57642063043274472 0.77776655183340049 0.25063608611031907
+-0.95001448309746583 0.23797402212934904 0.20209118411408986
+-0.94390741193901806 0.19654920871264409 0.26534356265230635
+-0.80357852474018521 0.18275773351615091 0.56644608341520675
+-0.77776655183340049 0.25063608611031907 0.57642063043274472
+-0.7120404609681168 0.38505005624480637 0.58714124035889637
+-0.74735820322637392 0.31802330015895514 0.58336686281126149
+-0.73377128224391142 3.6838438251301899e-18 0.67939657443508372
+-0.68203208574650398 6.5571195165482265e-18 0.73132225045616739
+-0.38505005624480643 -0.58714124035889637 0.71204046096811668
+-0.31802330015895514 -0.58336686281126149 0.74735820322637392
+-0.11295049101987709 -0.38368834989905559 0.91652901576006229
+-0.15490162002342259 -0.32578454432242576 0.93266817185682316
+0.7120404609681168 0.38505005624480637 -0.58714124035889637
+0.74735820322637392 0.31802330015895514 -0.58336686281126149
+0.73377128224391142 3.6838438251301899e-18 -0.67939657443508372
+0.68203208574650398 6.5571195165482265e-18 -0.73132225045616739
+0.38505005624480643 -0.58714124035889637 -0.71204046096811668
+0.31802330015895514 -0.58336686281126149 -0.74735820322637392
+0.11295049101987709 -0.38368834989905559 -0.91652901576006229
+0.15490162002342259 -0.32578454432242576 -0.93266817185682316
+0.23797402212934904 -0.20209118411408983 -0.95001448309746583
+0.19654920871264411 -0.2653435626523063 -0.94390741193901806
+-0.1129504910198771 -0.38368834989905565 -0.91652901576006229
+-0.15490162002342261 -0.32578454432242587 -0.93266817185682316
+-0.7120404609681168 -0.38505005624480637 -0.58714124035889637
+-0.74735820322637392 -0.31802330015895514 -0.58336686281126149
+-0.73377128224391142 -3.6838438251301899e-18 -0.67939657443508372
+-0.68203208574650398 -6.5571195165482265e-18 -0.73132225045616739
+-0.56496442685265946 -4.927907460000931e-18 -0.82511526248824529
+-0.62588411178006298 -6.5652635294160463e-18 -0.77991607152390563
+-0.80357852474018532 0.18275773351615091 -0.56644608341520641
+-0.77776655183340049 0.25063608611031907 -0.57642063043274483
+-0.82511526248824529 0.56496442685265946 4.927907460000931e-18
+-0.77991607152390563 0.62588411178006298 6.5652635294160463e-18
+-0.56644608341520641 0.80357852474018532 -0.18275773351615091
+-0.57642063043274472 0.77776655183340049 -0.25063608611031907
+-0.58714124035889637 0.71204046096811668 -0.38505005624480643
+-0.58336686281126149 0.74735820322637392 -0.31802330015895514
+-0.38368834989905559 0.91652901576006229 -0.11295049101987709
+-0.32578454432242576 0.93266817185682316 -0.15490162002342259
+0.20209118411408983 0.95001448309746583 0.23797402212934904
+0.2653435626523063 0.94390741193901806 0.19654920871264411
+0.38368834989905565 0.91652901576006229 -0.1129504910198771
+0.32578454432242587 0.93266817185682316 -0.15490162002342261
+0.20209118411408986 0.95001448309746583 -0.23797402212934904
+0.26534356265230635 0.94390741193901806 -0.19654920871264409
+0.56644608341520675 0.80357852474018521 -0.18275773351615091
+0.57642063043274472 0.77776655183340049 -0.25063608611031907
+0.80357852474018521 0.18275773351615091 -0.56644608341520675
+0.77776655183340049 0.25063608611031907 -0.57642063043274472
+0.23797402212934904 -0.20209118411408986 0.95001448309746583
+0.19654920871264409 -0.26534356265230635 0.94390741193901806
+0.18275773351615091 -0.56644608341520675 0.80357852474018521
+0.25063608611031912 -0.57642063043274483 0.7777665518334006
+0.38505005624480637 -0.58714124035889637 0.7120404609681168
+0.31802330015895514 -0.58336686281126149 0.74735820322637392
+3.6838438251301899e-18 -0.67939657443508372 0.73377128224391142
+6.5571195165482265e-18 -0.73132225045616739 0.68203208574650398
+-0.58714124035889637 -0.71204046096811668 0.38505005624480643
+-0.58336686281126149 -0.74735820322637392 0.31802330015895514
+-0.38368834989905559 -0.91652901576006229 0.11295049101987709
+-0.32578454432242576 -0.93266817185682316 0.15490162002342259
+-0.20209118411408983 -0.95001448309746583 0.23797402212934904
+-0.2653435626523063 -0.94390741193901806 0.19654920871264411
+-0.38368834989905565 -0.91652901576006229 -0.1129504910198771
+-0.32578454432242587 -0.93266817185682316 -0.15490162002342261
+-0.38505005624480637 -0.58714124035889637 -0.7120404609681168
+-0.31802330015895514 -0.58336686281126149 -0.74735820322637392
+-3.6838438251301899e-18 -0.67939657443508372 -0.73377128224391142
+-6.5571195165482265e-18 -0.73132225045616739 -0.68203208574650398
+-4.927907460000931e-18 -0.82511526248824529 -0.56496442685265946
+-6.5652635294160463e-18 -0.77991607152390563 -0.62588411178006298
+0.18275773351615091 -0.56644608341520641 -0.80357852474018532
+0.25063608611031907 -0.57642063043274483 -0.77776655183340049
+0.56496442685265946 4.927907460000931e-18 -0.82511526248824529
+0.62588411178006298 6.5652635294160463e-18 -0.77991607152390563
+0.9236940845413727 0.2726998137406515 0.26911716736226499
+0.58714124035889637 0.7120404609681168 -0.38505005624480637
+0.58336686281126149 0.74735820322637392 -0.31802330015895514
+0.67939657443508372 0.73377128224391142 -3.6838438251301899e-18
+0.73132225045616739 0.68203208574650398 -6.5571195165482265e-18
+-0.20209118411408986 -0.95001448309746583 -0.23797402212934904
+-0.26534356265230635 -0.94390741193901806 -0.19654920871264409
+-0.56644608341520675 -0.80357852474018521 -0.18275773351615091
+-0.57642063043274472 -0.77776655183340049 -0.25063608611031907
+-0.95001448309746583 -0.23797402212934904 -0.20209118411408986
+-0.94390741193901806 -0.19654920871264409 -0.26534356265230635
+-0.80357852474018521 -0.18275773351615091 -0.56644608341520675
+-0.77776655183340049 -0.25063608611031907 -0.57642063043274472
+-0.58714124035889637 -0.7120404609681168 -0.38505005624480637
+-0.58336686281126149 -0.74735820322637392 -0.31802330015895514
+-0.67939657443508372 -0.73377128224391142 -3.6838438251301899e-18
+-0.73132225045616739 -0.68203208574650398 -6.5571195165482265e-18
+-0.71204046096811668 -0.38505005624480643 0.58714124035889637
+-0.74735820322637392 -0.31802330015895514 0.58336686281126149
+-0.91652901576006229 -0.11295049101987709 0.38368834989905559
+-0.93266817185682316 -0.15490162002342259 0.32578454432242576
+-0.82511526248824529 -0.56496442685265946 -4.927907460000931e-18
+-0.77991607152390563 -0.62588411178006298 -6.5652635294160463e-18
+-0.56644608341520641 -0.80357852474018532 0.18275773351615091
+-0.57642063043274483 -0.77776655183340049 0.25063608611031907
+4.927907460000931e-18 -0.82511526248824529 0.56496442685265946
+6.5652635294160463e-18 -0.77991607152390563 0.62588411178006298
+-0.18275773351615091 -0.56644608341520641 0.80357852474018532
+-0.25063608611031907 -0.57642063043274483 0.77776655183340049
+-0.71204046096811668 0.38505005624480643 -0.58714124035889637
+-0.74735820322637392 0.31802330015895514 -0.58336686281126149
+-0.91652901576006229 0.11295049101987709 -0.38368834989905559
+-0.93266817185682316 0.15490162002342259 -0.32578454432242576
+-0.95001448309746583 -0.23797402212934904 0.20209118411408983
+-0.94390741193901806 -0.19654920871264411 0.2653435626523063
+-0.91652901576006229 0.1129504910198771 0.38368834989905565
+-0.93266817185682316 0.15490162002342261 0.32578454432242587
+0.20470147868264915 0.9270588370822882 0.31410064822087247
+0.069986566252294838 0.84380044240886354 0.53207395532465163
+0.11695476797072325 0.81049434395812059 0.57278135509939099
+-0.52969979418799107 0.72619883181352496 0.43823895845745114
+-0.39498488175763657 0.64294043714010041 0.65621226556123025
+-0.53207395532465163 0.069986566252294838 0.84380044240886354
+-0.31410064822087258 0.20470147868264921 0.9270588370822882
+0.20086000526876321 -0.13471491243035441 0.97031291378210283
+0.20086000526876321 0.13471491243035441 0.97031291378210283
+-0.20086000526876321 -0.13471491243035441 -0.97031291378210283
+-0.20086000526876321 0.13471491243035441 -0.97031291378210283
+-0.65621226556123025 0.39498488175763669 -0.64294043714010041
+-0.43823895845745109 0.52969979418799096 -0.72619883181352507
+-0.20470147868264915 0.9270588370822882 -0.31410064822087247
+-0.069986566252294838 0.84380044240886354 -0.53207395532465163
+0.52969979418799107 0.72619883181352496 -0.43823895845745114
+0.39498488175763657 0.64294043714010041 -0.65621226556123025
+0.53207395532465163 0.069986566252294838 -0.84380044240886354
+0.31410064822087258 0.20470147868264921 -0.9270588370822882
+0.069986566252294838 -0.84380044240886354 0.53207395532465163
+-0.13471491243035441 -0.97031291378210283 -0.20086000526876321
+0.13471491243035441 -0.97031291378210283 -0.20086000526876321
+-0.53207395532465163 -0.069986566252294838 -0.84380044240886354
+-0.31410064822087258 -0.20470147868264921 -0.9270588370822882
+-0.97031291378210283 0.20086000526876321 0.13471491243035441
+-0.97031291378210283 0.20086000526876321 -0.13471491243035441
+-0.31410064822087247 -0.20470147868264915 0.9270588370822882
+-0.53207395532465163 -0.069986566252294838 0.84380044240886354
+-0.72619883181352496 0.43823895845745114 0.52969979418799107
+-0.64294043714010041 0.65621226556123025 0.39498488175763657
+-0.20086000526876321 0.13471491243035441 0.97031291378210283
+-0.20086000526876321 -0.13471491243035441 0.97031291378210283
+0.43823895845745114 -0.52969979418799107 0.72619883181352496
+0.31410064822087252 0.20470147868264915 0.9270588370822882
+0.9270588370822882 0.31410064822087252 0.20470147868264915
+0.13471491243035441 0.97031291378210283 -0.20086000526876321
+-0.13471491243035441 0.97031291378210283 -0.20086000526876321
+-0.069986566252294838 0.84380044240886354 0.53207395532465163
+-0.20470147868264923 0.9270588370822882 0.31410064822087264
+-0.84380044240886354 0.53207395532465163 0.069986566252294838
+-0.9270588370822882 0.31410064822087264 0.20470147868264923
+-0.43823895845745114 0.52969979418799107 0.72619883181352496
+-0.65621226556123025 0.39498488175763657 0.64294043714010041
+-0.65621226556123025 -0.39498488175763669 0.64294043714010041
+-0.43823895845745109 -0.52969979418799096 0.72619883181352507
+0.43823895845745114 0.52969979418799107 -0.72619883181352496
+0.65621226556123025 0.39498488175763657 -0.64294043714010041
+0.43823895845745109 -0.52969979418799096 -0.72619883181352507
+0.20086000526876321 0.13471491243035441 -0.97031291378210283
+0.20086000526876321 -0.13471491243035441 -0.97031291378210283
+-0.43823895845745114 -0.52969979418799107 -0.72619883181352496
+-0.65621226556123025 -0.39498488175763657 -0.64294043714010041
+-0.31410064822087252 0.20470147868264915 -0.9270588370822882
+-0.53207395532465174 0.069986566252294838 -0.84380044240886354
+-0.9270588370822882 0.31410064822087247 -0.20470147868264915
+-0.84380044240886354 0.53207395532465163 -0.069986566252294838
+-0.39498488175763669 0.64294043714010041 -0.65621226556123025
+-0.52969979418799096 0.72619883181352507 -0.43823895845745109
+-0.13471491243035441 0.97031291378210283 0.20086000526876321
+0.13471491243035441 0.97031291378210283 0.20086000526876321
+0.069986566252294838 0.84380044240886354 -0.53207395532465163
+0.20470147868264923 0.9270588370822882 -0.31410064822087264
+0.84380044240886354 0.53207395532465163 -0.069986566252294838
+0.9270588370822882 0.31410064822087258 -0.20470147868264921
+0.53207395532465163 -0.069986566252294838 0.84380044240886354
+0.31410064822087258 -0.20470147868264921 0.9270588370822882
+-0.39498488175763669 -0.64294043714010041 0.65621226556123025
+-0.52969979418799096 -0.72619883181352507 0.43823895845745109
+0.13471491243035441 -0.97031291378210283 0.20086000526876321
+-0.13471491243035441 -0.97031291378210283 0.20086000526876321
+-0.52969979418799107 -0.72619883181352496 -0.43823895845745114
+-0.39498488175763657 -0.64294043714010041 -0.65621226556123025
+0.069986566252294838 -0.84380044240886354 -0.53207395532465174
+0.31410064822087247 -0.20470147868264915 -0.9270588370822882
+0.53207395532465163 -0.069986566252294838 -0.84380044240886354
+0.72619883181352496 0.43823895845745114 -0.52969979418799107
+0.64294043714010041 0.65621226556123025 -0.39498488175763657
+-0.069986566252294838 -0.84380044240886354 -0.53207395532465163
+-0.20470147868264921 -0.9270588370822882 -0.31410064822087258
+-0.84380044240886354 -0.53207395532465163 -0.069986566252294838
+-0.9270588370822882 -0.31410064822087258 -0.20470147868264921
+-0.72619883181352496 -0.43823895845745114 -0.52969979418799107
+-0.64294043714010041 -0.65621226556123025 -0.39498488175763657
+-0.64294043714010041 -0.65621226556123025 0.39498488175763669
+-0.72619883181352507 -0.43823895845745109 0.52969979418799096
+-0.9270588370822882 -0.31410064822087247 0.20470147868264915
+-0.84380044240886354 -0.53207395532465163 0.069986566252294838
+-0.20470147868264915 -0.9270588370822882 0.31410064822087247
+-0.069986566252294838 -0.84380044240886354 0.53207395532465163
+-0.64294043714010041 0.65621226556123025 -0.39498488175763669
+-0.72619883181352507 0.43823895845745109 -0.52969979418799096
+-0.97031291378210283 -0.20086000526876321 -0.13471491243035441
+-0.97031291378210283 -0.20086000526876321 0.13471491243035441
+0.17811496227257201 0.44486756488630003 0.87684117534766193
+0.16208565674454739 0.067174638370274917 0.984487586431394
+0.43210633013751587 0.18610643753537565 0.88125255845135109
+-0.1264800315542341 0.61148180127020313 0.78108437977813105
+-0.14324145828887105 0.44478475305090459 0.88410882140193769
+-0.06507249989019516 0.64943374300381451 0.75762878984770377
+-0.13950602492257505 0.85675191169903997 0.49650199476975149
+0.037951941733611459 0.37971225316070945 0.92432583806700219
+-0.16669704821929851 0.50619228471494349 0.84615687966832631
+-0.40176612662410133 0.69466625495449252 0.59667643972673035
+-0.48798559166164268 0.46894076499437626 0.73618246464930526
+-0.037951941733611459 0.37971225316070945 0.92432583806700219
+-0.38781114670466377 0.20668066329284993 0.89826812139385259
+-0.16208565674454734 0.067174638370274917 0.984487586431394
+-0.16669704821929851 0.50619228471494349 -0.84615687966832631
+0.037951941733611459 0.37971225316070945 -0.92432583806700219
+0.38781114670466377 0.20668066329284993 -0.89826812139385259
+0.16208565674454734 0.067174638370274917 -0.984487586431394
+-0.06507249989019516 0.64943374300381451 -0.75762878984770377
+-0.14324145828887103 0.44478475305090454 -0.88410882140193769
+-0.16208565674454739 0.067174638370274917 -0.984487586431394
+-0.38781114670466377 0.20668066329285001 -0.89826812139385281
+0.1264800315542341 0.61148180127020313 -0.78108437977813105
+-0.1264800315542341 0.61148180127020313 -0.78108437977813105
+-0.48798559166164257 0.46894076499437626 -0.73618246464930537
+-0.40176612662410133 0.69466625495449263 -0.59667643972673012
+0.14324145828887105 0.44478475305090459 -0.88410882140193769
+0.065072499890195173 0.64943374300381473 -0.75762878984770365
+-0.13950602492257505 0.85675191169903997 -0.49650199476975138
+0.13950602492257505 0.85675191169903997 -0.49650199476975149
+-0.037951941733611459 0.37971225316070945 -0.92432583806700219
+0.16669704821929851 0.50619228471494349 -0.84615687966832631
+0.40176612662410133 0.69466625495449252 -0.59667643972673035
+0.48798559166164268 0.46894076499437626 -0.73618246464930526
+0.20668066329284993 -0.89826812139385259 0.38781114670466377
+0.067174638370274931 -0.98448758643139411 0.16208565674454736
+0.067174638370274931 -0.98448758643139411 -0.16208565674454742
+0.20668066329284998 -0.89826812139385259 -0.38781114670466371
+0.88692657891222382 0.1974660445788706 0.41582096722616779
+0.88125255845135109 0.43210633013751554 0.18610643753537598
+0.037951941733611459 -0.37971225316070945 -0.92432583806700219
+-0.16669704821929851 -0.50619228471494349 -0.84615687966832631
+-0.40176612662410133 -0.69466625495449252 -0.59667643972673035
+-0.48798559166164268 -0.46894076499437626 -0.73618246464930526
+-0.84615687966832631 0.16669704821929851 -0.50619228471494349
+-0.92432583806700219 -0.037951941733611459 -0.37971225316070945
+-0.89826812139385259 -0.38781114670466377 -0.20668066329284993
+-0.98448758643139411 -0.16208565674454736 -0.067174638370274931
+-0.78108437977813128 0.12648003155423412 0.61148180127020324
+-0.78108437977813128 -0.1264800315542341 0.61148180127020324
+-0.73618246464930537 -0.48798559166164257 0.46894076499437626
+-0.59667643972673012 -0.40176612662410133 0.69466625495449263
+-0.44478475305090459 0.88410882140193769 0.14324145828887105
+-0.64943374300381462 0.75762878984770354 0.06507249989019516
+-0.85675191169903997 0.49650199476975138 -0.13950602492257505
+-0.85675191169903997 0.49650199476975149 0.13950602492257505
+-0.16669704821929851 -0.50619228471494349 0.84615687966832631
+0.037951941733611459 -0.37971225316070945 0.92432583806700219
+0.38781114670466377 -0.20668066329284993 0.89826812139385259
+0.16208565674454739 -0.067174638370274917 0.984487586431394
+0.49650199476975149 -0.13950602492257505 0.85675191169903997
+0.61148180127020324 0.78108437977813128 -0.12648003155423412
+0.44486756488630003 0.87684117534766193 0.17811496227257201
+0.067174638370274931 0.98448758643139411 0.16208565674454736
+0.18610643753537565 0.88125255845135109 0.43210633013751576
+-0.50619228471494349 0.84615687966832631 -0.16669704821929851
+-0.37971225316070945 0.92432583806700219 0.037951941733611459
+-0.20668066329284998 0.89826812139385259 0.38781114670466382
+-0.067174638370274931 0.98448758643139411 0.16208565674454736
+-0.37971225316070945 0.92432583806700219 -0.037951941733611459
+-0.50619228471494349 0.84615687966832631 0.16669704821929851
+-0.69466625495449252 0.59667643972673035 0.40176612662410133
+-0.46894076499437626 0.73618246464930526 0.48798559166164268
+-0.92432583806700219 -0.037951941733611459 0.37971225316070945
+-0.84615687966832631 0.16669704821929851 0.50619228471494349
+-0.59667643972673035 0.40176612662410133 0.69466625495449252
+-0.73618246464930526 0.48798559166164268 0.46894076499437626
+-0.88410882140193769 0.14324145828887105 0.44478475305090459
+-0.75762878984770377 0.06507249989019516 0.64943374300381451
+-0.49650199476975138 -0.13950602492257505 0.85675191169903997
+-0.49650199476975149 0.13950602492257505 0.85675191169903997
+-0.06507249989019516 -0.64943374300381462 0.75762878984770377
+-0.14324145828887103 -0.44478475305090454 0.88410882140193769
+-0.16208565674454734 -0.067174638370274917 0.984487586431394
+-0.38781114670466377 -0.20668066329285001 0.89826812139385281
+0.75762878984770377 0.06507249989019516 -0.64943374300381451
+0.49650199476975138 -0.13950602492257505 -0.85675191169903997
+0.49650199476975149 0.13950602492257505 -0.85675191169903997
+0.06507249989019516 -0.64943374300381462 -0.75762878984770377
+0.14324145828887103 -0.44478475305090454 -0.88410882140193769
+0.16208565674454734 -0.067174638370274917 -0.984487586431394
+0.38781114670466377 -0.20668066329285001 -0.89826812139385281
+0.16669704821929851 -0.50619228471494349 -0.84615687966832631
+-0.037951941733611459 -0.37971225316070945 -0.92432583806700219
+-0.38781114670466377 -0.20668066329284993 -0.89826812139385259
+-0.16208565674454739 -0.067174638370274917 -0.984487586431394
+-0.88410882140193769 -0.14324145828887105 -0.44478475305090459
+-0.75762878984770377 -0.06507249989019516 -0.64943374300381451
+-0.49650199476975138 0.13950602492257505 -0.85675191169903997
+-0.49650199476975149 -0.13950602492257505 -0.85675191169903997
+-0.78108437977813128 -0.12648003155423412 -0.61148180127020324
+-0.78108437977813128 0.1264800315542341 -0.61148180127020324
+-0.73618246464930537 0.48798559166164257 -0.46894076499437626
+-0.59667643972673012 0.40176612662410133 -0.69466625495449263
+-0.61148180127020324 0.78108437977813128 0.12648003155423412
+-0.61148180127020324 0.78108437977813128 -0.1264800315542341
+-0.46894076499437626 0.73618246464930537 -0.48798559166164257
+-0.69466625495449263 0.59667643972673012 -0.40176612662410133
+-0.64943374300381451 0.75762878984770377 -0.06507249989019516
+-0.44478475305090454 0.88410882140193769 -0.14324145828887103
+-0.067174638370274931 0.98448758643139411 -0.16208565674454736
+-0.20668066329284998 0.89826812139385259 -0.38781114670466371
+0.37971225316070945 0.92432583806700219 -0.037951941733611459
+0.20668066329284998 0.89826812139385259 -0.38781114670466382
+0.067174638370274931 0.98448758643139411 -0.16208565674454736
+0.37971225316070945 0.92432583806700219 0.037951941733611459
+0.50619228471494349 0.84615687966832631 -0.16669704821929851
+0.69466625495449252 0.59667643972673035 -0.40176612662410133
+0.46894076499437626 0.73618246464930526 -0.48798559166164268
+0.84615687966832631 0.16669704821929851 -0.50619228471494349
+0.59667643972673035 0.40176612662410133 -0.69466625495449252
+0.73618246464930526 0.48798559166164268 -0.46894076499437626
+-0.037951941733611459 -0.37971225316070945 0.92432583806700219
+0.16669704821929851 -0.50619228471494349 0.84615687966832631
+0.14324145828887105 -0.44478475305090459 0.88410882140193769
+0.065072499890195173 -0.64943374300381473 0.75762878984770365
+-0.13950602492257505 -0.85675191169903997 0.49650199476975138
+0.13950602492257505 -0.85675191169903997 0.49650199476975149
+-0.64943374300381451 -0.75762878984770365 0.065072499890195146
+-0.44478475305090454 -0.88410882140193769 0.14324145828887103
+-0.067174638370274931 -0.98448758643139411 0.16208565674454736
+-0.20668066329284998 -0.89826812139385259 0.38781114670466371
+-0.50619228471494349 -0.84615687966832631 0.16669704821929851
+-0.37971225316070945 -0.92432583806700219 -0.037951941733611459
+-0.20668066329284993 -0.89826812139385259 -0.38781114670466377
+-0.067174638370274931 -0.98448758643139411 -0.16208565674454742
+-0.14324145828887105 -0.44478475305090459 -0.88410882140193769
+-0.065072499890195173 -0.64943374300381473 -0.75762878984770365
+0.13950602492257505 -0.85675191169903997 -0.49650199476975138
+-0.13950602492257505 -0.85675191169903997 -0.49650199476975149
+-0.1264800315542341 -0.61148180127020313 -0.78108437977813105
+0.1264800315542341 -0.61148180127020313 -0.78108437977813105
+0.78108437977813128 0.12648003155423412 -0.61148180127020324
+0.84695178356442291 0.1418121948905855 0.51101182387798261
+0.89826812139385259 0.38781114670466377 -0.20668066329284993
+0.44478475305090459 0.88410882140193769 -0.14324145828887105
+0.64943374300381462 0.75762878984770354 -0.06507249989019516
+0.85675191169903997 0.49650199476975149 -0.13950602492257505
+-0.37971225316070945 -0.92432583806700219 0.037951941733611459
+-0.50619228471494349 -0.84615687966832631 -0.16669704821929851
+-0.69466625495449252 -0.59667643972673035 -0.40176612662410133
+-0.46894076499437626 -0.73618246464930526 -0.48798559166164268
+-0.92432583806700219 0.037951941733611459 -0.37971225316070945
+-0.84615687966832631 -0.16669704821929851 -0.50619228471494349
+-0.59667643972673035 -0.40176612662410133 -0.69466625495449252
+-0.73618246464930526 -0.48798559166164268 -0.46894076499437626
+-0.44478475305090459 -0.88410882140193769 -0.14324145828887105
+-0.64943374300381462 -0.75762878984770354 -0.06507249989019516
+-0.85675191169903997 -0.49650199476975138 0.13950602492257505
+-0.85675191169903997 -0.49650199476975149 -0.13950602492257505
+-0.75762878984770377 -0.06507249989019516 0.64943374300381462
+-0.88410882140193769 -0.14324145828887103 0.44478475305090454
+-0.98448758643139411 -0.16208565674454736 0.067174638370274931
+-0.89826812139385259 -0.38781114670466371 0.20668066329284998
+-0.61148180127020324 -0.78108437977813128 -0.12648003155423412
+-0.61148180127020324 -0.78108437977813128 0.1264800315542341
+-0.46894076499437626 -0.73618246464930537 0.48798559166164257
+-0.69466625495449263 -0.59667643972673012 0.40176612662410133
+0.1264800315542341 -0.61148180127020313 0.78108437977813105
+-0.1264800315542341 -0.61148180127020313 0.78108437977813105
+-0.48798559166164257 -0.46894076499437626 0.73618246464930537
+-0.40176612662410133 -0.69466625495449263 0.59667643972673012
+-0.75762878984770377 0.06507249989019516 -0.64943374300381462
+-0.88410882140193769 0.14324145828887103 -0.44478475305090454
+-0.98448758643139411 0.16208565674454736 -0.067174638370274931
+-0.89826812139385259 0.38781114670466371 -0.20668066329284998
+-0.84615687966832631 -0.16669704821929851 0.50619228471494349
+-0.92432583806700219 0.037951941733611459 0.37971225316070945
+-0.89826812139385259 0.38781114670466382 0.20668066329284998
+-0.98448758643139411 0.16208565674454736 0.067174638370274931
+-0.40127702279442368 0.85397772162051189 0.33120809463701684
+-0.33924096091721678 0.86230450765389344 0.37596077789543403
+-0.64927986178574382 0.20469785983476813 0.7324851174314404
+-0.61446983418191226 0.27287882084494519 0.74024588618561449
+0 -0.19657916295965555 0.98048795642276054
+-0.040522281668716867 -0.13192856911395229 0.99043061207734606
+0 -0.19657916295965558 -0.98048795642276054
+0.040522281668716867 -0.13192856911395229 -0.99043061207734606
+-0.64927986178574371 0.20469785983476807 -0.7324851174314404
+-0.58942568680894825 0.20731239180326447 -0.78076816785433134
+-0.40127702279442362 0.85397772162051189 -0.33120809463701684
+-0.40480738995889742 0.82178222598517658 -0.40100492526839771
+0.40127702279442368 0.85397772162051189 -0.33120809463701678
+0.33924096091721678 0.86230450765389344 -0.37596077789543403
+0.64927986178574382 0.20469785983476813 -0.7324851174314404
+0.61446983418191226 0.27287882084494519 -0.74024588618561449
+0.20469785983476813 -0.7324851174314404 0.64927986178574382
+0.27287882084494519 -0.74024588618561449 0.61446983418191226
+-0.19657916295965555 -0.98048795642276054 0
+-0.13192856911395229 -0.99043061207734606 0.040522281668716867
+0.20469785983476813 -0.7324851174314404 -0.64927986178574382
+0.20731239180326447 -0.78076816785433134 -0.58942568680894825
+-0.64927986178574382 -0.20469785983476813 -0.7324851174314404
+-0.61446983418191226 -0.27287882084494519 -0.74024588618561449
+-0.98048795642276054 0 0.19657916295965558
+-0.99043061207734606 -0.040522281668716874 0.13192856911395229
+-0.33120809463701684 -0.40127702279442373 0.85397772162051189
+-0.40100492526839771 -0.40480738995889742 0.82178222598517658
+-0.85397772162051189 0.33120809463701684 0.40127702279442379
+-0.86230450765389344 0.37596077789543403 0.33924096091721678
+0 0.19657916295965558 0.98048795642276054
+0.040522281668716867 0.13192856911395229 0.99043061207734606
+0.33120809463701678 -0.40127702279442368 0.85397772162051189
+0.37596077789543403 -0.33924096091721678 0.86230450765389344
+0.19657916295965558 0.98048795642276054 0
+0.13192856911395229 0.99043061207734606 0.040522281668716874
+-0.20469785983476813 0.7324851174314404 0.64927986178574382
+-0.27287882084494519 0.74024588618561449 0.61446983418191226
+-0.7324851174314404 0.64927986178574382 0.20469785983476813
+-0.74024588618561449 0.61446983418191226 0.27287882084494519
+-0.33120809463701684 0.40127702279442379 0.85397772162051189
+-0.37596077789543403 0.33924096091721678 0.86230450765389344
+-0.64927986178574371 -0.20469785983476807 0.7324851174314404
+-0.58942568680894825 -0.20731239180326447 0.78076816785433134
+0.33120809463701684 0.40127702279442368 -0.85397772162051189
+0.37596077789543403 0.33924096091721678 -0.86230450765389344
+0.58942568680894825 -0.20731239180326447 -0.78076816785433134
+0 0.19657916295965555 -0.98048795642276054
+-0.040522281668716867 0.13192856911395229 -0.99043061207734606
+-0.33120809463701678 -0.40127702279442368 -0.85397772162051189
+-0.37596077789543403 -0.33924096091721678 -0.86230450765389344
+-0.33120809463701684 0.40127702279442373 -0.85397772162051189
+-0.40100492526839771 0.40480738995889742 -0.82178222598517658
+-0.85397772162051189 0.33120809463701684 -0.40127702279442362
+-0.82178222598517658 0.40100492526839771 -0.40480738995889742
+-0.20469785983476813 0.7324851174314404 -0.64927986178574382
+-0.20731239180326447 0.78076816785433134 -0.58942568680894825
+-0.19657916295965552 0.98048795642276054 0
+-0.13192856911395229 0.99043061207734606 -0.040522281668716874
+0.20469785983476813 0.7324851174314404 -0.64927986178574382
+0.27287882084494519 0.74024588618561449 -0.61446983418191226
+0.7324851174314404 0.64927986178574382 -0.20469785983476813
+0.74024588618561449 0.61446983418191226 -0.27287882084494519
+-0.20469785983476813 -0.7324851174314404 0.64927986178574382
+-0.20731239180326447 -0.78076816785433134 0.58942568680894825
+0.13192856911395229 -0.99043061207734606 -0.040522281668716867
+-0.40127702279442368 -0.85397772162051189 -0.33120809463701678
+-0.33924096091721678 -0.86230450765389344 -0.37596077789543403
+0.33120809463701684 -0.40127702279442373 -0.85397772162051189
+0.40100492526839771 -0.40480738995889742 -0.82178222598517658
+0.85397772162051189 0.33120809463701684 -0.40127702279442379
+0.86230450765389344 0.37596077789543403 -0.33924096091721678
+-0.20469785983476813 -0.7324851174314404 -0.64927986178574382
+-0.27287882084494519 -0.74024588618561449 -0.61446983418191226
+-0.7324851174314404 -0.64927986178574382 -0.20469785983476813
+-0.74024588618561449 -0.61446983418191226 -0.27287882084494519
+-0.85397772162051189 -0.33120809463701684 -0.40127702279442368
+-0.86230450765389344 -0.37596077789543403 -0.33924096091721678
+-0.7324851174314404 -0.64927986178574382 0.20469785983476813
+-0.78076816785433134 -0.58942568680894825 0.20731239180326447
+-0.85397772162051189 -0.33120809463701678 0.40127702279442362
+-0.82178222598517658 -0.40100492526839771 0.40480738995889742
+-0.40127702279442373 -0.85397772162051189 0.33120809463701684
+-0.40480738995889742 -0.82178222598517658 0.40100492526839771
+-0.7324851174314404 0.64927986178574382 -0.20469785983476813
+-0.78076816785433134 0.58942568680894825 -0.20731239180326447
+-0.98048795642276054 0 -0.19657916295965552
+-0.99043061207734606 0.040522281668716874 -0.13192856911395229
+0.039734588558411582 0.26026494835742225 0.96471929550963276
+-0.13827368218737232 0.7695778385021762 0.62340222914316235
+-0.35362935294171682 0.46556504362316581 0.81129246939324073
+0.069740197633308867 0.8004723406749189 0.59529852733606159
+0.068996282000725426 0.75327597529184531 0.65407554465688111
+-0.080281277350241251 0.19739352602284607 0.97703158208487906
+-0.20012814034344362 0.68018071850695239 0.70519707714513458
+-0.25952221836449818 0.39610117388436322 0.88076789123048704
+-0.30401279487901051 0.33566720821021828 -0.891573746743482
+0.25952221836449818 0.39610117388436322 -0.88076789123048704
+-0.26817151760031976 0.68929656115193516 -0.6730187872058685
+-0.039734588558411582 0.26026494835742225 -0.96471929550963276
+0.13827368218737232 0.7695778385021762 -0.62340222914316235
+-0.28407954462258928 0.46039308870086582 -0.84103330267207554
+0.35362935294171682 0.46556504362316581 -0.81129246939324073
+-0.135836225526941 0.719915307065364 -0.68063975088704354
+0.080281277350241251 0.19739352602284607 -0.97703158208487906
+0.20012814034344362 0.68018071850695239 -0.70519707714513458
+-0.080281277350241251 -0.19739352602284607 -0.97703158208487906
+-0.20012814034344362 -0.68018071850695239 -0.70519707714513458
+-0.891573746743482 0.30401279487901051 -0.33566720821021828
+-0.88076789123048704 -0.25952221836449818 -0.39610117388436322
+-0.62340222914316235 0.13827368218737232 0.76957783850217643
+-0.84103330267207554 -0.28407954462258928 0.46039308870086582
+-0.46556504362316581 0.81129246939324073 0.35362935294171682
+-0.719915307065364 0.68063975088704354 -0.135836225526941
+-0.30401279487901051 -0.33566720821021828 0.891573746743482
+0.25952221836449818 -0.39610117388436322 0.88076789123048704
+0.65407554465688111 0.068996282000725426 0.75327597529184531
+0.62340222914316235 -0.13827368218737232 0.76957783850217643
+0.76957783850217643 0.62340222914316235 -0.13827368218737232
+0.26026494835742225 0.96471929550963276 0.039734588558411582
+-0.33566720821021828 0.891573746743482 -0.30401279487901051
+-0.39610117388436322 0.88076789123048704 0.25952221836449818
+-0.19739352602284607 0.97703158208487906 0.080281277350241251
+-0.68018071850695239 0.70519707714513458 0.20012814034344362
+-0.97703158208487906 0.080281277350241251 0.19739352602284607
+-0.70519707714513458 0.20012814034344362 0.68018071850695239
+-0.81129246939324073 0.35362935294171682 0.46556504362316581
+-0.68063975088704343 -0.13583622552694097 0.71991530706536411
+-0.26817151760031971 -0.68929656115193505 0.67301878720586839
+-0.039734588558411582 -0.26026494835742225 0.96471929550963276
+0.81129246939324073 0.35362935294171682 -0.46556504362316581
+0.68063975088704343 -0.13583622552694097 -0.71991530706536411
+0.26817151760031971 -0.68929656115193505 -0.67301878720586839
+0.039734588558411582 -0.26026494835742225 -0.96471929550963276
+0.30401279487901051 -0.33566720821021828 -0.891573746743482
+-0.25952221836449818 -0.39610117388436322 -0.88076789123048704
+-0.81129246939324073 -0.35362935294171682 -0.46556504362316581
+-0.68063975088704343 0.13583622552694097 -0.71991530706536411
+-0.62340222914316235 -0.13827368218737232 -0.76957783850217643
+-0.84103330267207554 0.28407954462258928 -0.46039308870086582
+-0.7695778385021762 0.62340222914316235 0.13827368218737232
+-0.46039308870086582 0.84103330267207554 -0.28407954462258928
+-0.68929656115193516 0.6730187872058685 -0.26817151760031976
+-0.26026494835742225 0.96471929550963276 -0.039734588558411582
+0.39610117388436322 0.88076789123048704 -0.25952221836449818
+0.19739352602284607 0.97703158208487906 -0.080281277350241251
+0.68018071850695239 0.70519707714513458 -0.20012814034344362
+0.70519707714513458 0.20012814034344362 -0.68018071850695239
+0.080281277350241251 -0.19739352602284607 0.97703158208487906
+0.20012814034344362 -0.68018071850695239 0.70519707714513458
+0.35362935294171682 -0.46556504362316581 0.81129246939324073
+-0.13583622552694097 -0.71991530706536411 0.68063975088704343
+-0.68929656115193505 -0.67301878720586839 0.26817151760031971
+-0.26026494835742225 -0.96471929550963276 0.039734588558411582
+-0.33566720821021828 -0.891573746743482 0.30401279487901051
+-0.39610117388436322 -0.88076789123048704 -0.25952221836449818
+-0.35362935294171682 -0.46556504362316581 -0.81129246939324073
+0.13583622552694097 -0.71991530706536411 -0.68063975088704343
+-0.13827368218737232 -0.76957783850217643 -0.62340222914316235
+0.28407954462258928 -0.46039308870086582 -0.84103330267207554
+0.62340222914316235 0.13827368218737232 -0.76957783850217643
+0.88076789123048704 0.25952221836449818 -0.39610117388436322
+0.46556504362316581 0.81129246939324073 -0.35362935294171682
+-0.19739352602284607 -0.97703158208487906 -0.080281277350241251
+-0.68018071850695239 -0.70519707714513458 -0.20012814034344362
+-0.97703158208487906 -0.080281277350241251 -0.19739352602284607
+-0.70519707714513458 -0.20012814034344362 -0.68018071850695239
+-0.46556504362316581 -0.81129246939324073 -0.35362935294171682
+-0.71991530706536411 -0.68063975088704343 0.13583622552694097
+-0.67301878720586839 -0.26817151760031971 0.68929656115193505
+-0.96471929550963276 -0.039734588558411582 0.26026494835742225
+-0.76957783850217643 -0.62340222914316235 -0.13827368218737232
+-0.46039308870086582 -0.84103330267207554 0.28407954462258928
+0.13827368218737232 -0.76957783850217643 0.62340222914316235
+-0.28407954462258928 -0.46039308870086582 0.84103330267207554
+-0.67301878720586839 0.26817151760031971 -0.68929656115193505
+-0.96471929550963276 0.039734588558411582 -0.26026494835742225
+-0.891573746743482 -0.30401279487901051 0.33566720821021828
+-0.88076789123048704 0.25952221836449818 0.39610117388436322
+0.068715700526218768 0.9453832490724946 0.3186356302649232
+-0.58427898032160919 0.62674761880757135 0.51556327979539029
+-0.42981996927710414 0 0.90291461058653233
+0.31863563026492325 -0.068715700526218768 0.9453832490724946
+-0.31863563026492325 -0.068715700526218768 -0.9453832490724946
+-0.62674761880757135 0.51556327979539029 -0.58427898032160919
+-0.068715700526218768 0.9453832490724946 -0.3186356302649232
+0.58427898032160919 0.62674761880757146 -0.51556327979539029
+0.42981996927710414 0 -0.90291461058653233
+0 -0.90291461058653233 0.42981996927710414
+-0.068715700526218768 -0.9453832490724946 -0.31863563026492325
+-0.42981996927710414 0 -0.90291461058653233
+-0.9453832490724946 0.31863563026492325 0.068715700526218768
+-0.3186356302649232 -0.068715700526218768 0.9453832490724946
+-0.62674761880757135 0.51556327979539029 0.58427898032160919
+-0.3568220897730901 -1.2321651268072113e-18 0.93417235896271567
+-0.31863563026492325 0.068715700526218768 0.9453832490724946
+0.35682208977308999 -6.1608256340360548e-19 0.93417235896271567
+0.3186356302649232 0.068715700526218768 0.9453832490724946
+0.42716188369754932 0.13899360672691591 0.89342795031552757
+0.4576613505648901 0.17031256632806047 0.87149140923129198
+0.93417235896271567 0.35682208977308999 -6.1608256340360548e-19
+0.9453832490724946 0.3186356302649232 0.068715700526218768
+0.068715700526218768 0.9453832490724946 -0.31863563026492325
+-1.2321651268072113e-18 0.93417235896271567 0.35682208977308999
+0 0.90291461058653233 0.4298199692771042
+-0.93417235896271567 0.35682208977308988 1.232165126807211e-18
+-0.90291461058653233 0.42981996927710414 0
+-0.57735026918962573 0.57735026918962573 0.57735026918962573
+-0.51556327979539029 0.58427898032160919 0.62674761880757135
+-0.57735026918962584 -0.57735026918962573 0.57735026918962573
+-0.62674761880757146 -0.51556327979539029 0.58427898032160919
+0.57735026918962573 0.57735026918962584 -0.57735026918962573
+0.51556327979539029 0.58427898032160919 -0.62674761880757135
+0.3568220897730901 -1.2321651268072113e-18 -0.93417235896271567
+0.31863563026492325 0.068715700526218768 -0.9453832490724946
+-0.57735026918962573 -0.57735026918962584 -0.57735026918962573
+-0.51556327979539029 -0.58427898032160919 -0.62674761880757135
+-0.35682208977308999 -6.1608256340360548e-19 -0.93417235896271567
+-0.3186356302649232 0.068715700526218768 -0.9453832490724946
+-0.9453832490724946 0.3186356302649232 -0.068715700526218768
+-0.57735026918962573 0.57735026918962573 -0.57735026918962584
+-0.51556327979539029 0.58427898032160919 -0.62674761880757146
+-0.068715700526218768 0.9453832490724946 0.31863563026492325
+1.232165126807211e-18 0.93417235896271567 -0.35682208977308988
+0 0.90291461058653233 -0.42981996927710414
+0.90291461058653233 0.42981996927710414 0
+0.42981996927710414 0 0.90291461058653233
+-0.51556327979539029 -0.58427898032160919 0.62674761880757146
+-1.2321651268072113e-18 -0.93417235896271567 0.3568220897730901
+0.068715700526218768 -0.9453832490724946 0.31863563026492325
+-0.58427898032160919 -0.62674761880757146 -0.51556327979539029
+-6.1608256340360548e-19 -0.93417235896271567 -0.35682208977308999
+0.068715700526218768 -0.9453832490724946 -0.3186356302649232
+0.3186356302649232 -0.068715700526218768 -0.9453832490724946
+0.9453832490724946 0.31863563026492325 -0.068715700526218768
+0.62674761880757135 0.51556327979539029 -0.58427898032160919
+0 -0.90291461058653233 -0.42981996927710414
+-0.90291461058653233 -0.4298199692771042 0
+-0.62674761880757135 -0.51556327979539029 -0.58427898032160919
+-0.58427898032160919 -0.62674761880757135 0.51556327979539029
+-0.9453832490724946 -0.3186356302649232 0.068715700526218768
+-0.068715700526218768 -0.9453832490724946 0.3186356302649232
+-0.58427898032160919 0.62674761880757146 -0.51556327979539029
+-0.93417235896271567 -0.3568220897730901 1.2321651268072113e-18
+-0.9453832490724946 -0.31863563026492325 -0.068715700526218768
+1.2256505459452103e-18 0.52573111211913359 0.85065080835203988
+0 0.57392154628557113 0.8189102873387164
+0.3390347444358186 0.25671454238163 0.90442701067601727
+-0.054857140713616914 0.54001796879892028 0.83986385056568236
+0.09404663521954322 0.6771336059462687 0.72858929180595311
+-0.033903577486650918 0.48516082808530342 0.87376742805233332
+0.033903577486650918 0.48516082808530342 0.87376742805233332
+1.2256505459452101e-18 0.52573111211913348 -0.85065080835203999
+-0.054857140713616914 0.54001796879892028 -0.83986385056568236
+0 0.57392154628557113 -0.8189102873387164
+0.054857140713616914 0.54001796879892028 -0.83986385056568236
+0.033903577486650918 0.48516082808530342 -0.87376742805233332
+0.90442701067601738 0.33903474443581871 0.25671454238163005
+0.033903577486650918 -0.48516082808530342 -0.87376742805233332
+-0.83986385056568236 0.054857140713616921 -0.54001796879892028
+-0.83986385056568236 0.054857140713616914 0.54001796879892028
+-0.48516082808530336 0.87376742805233321 0.033903577486650911
+-0.054857140713616921 -0.54001796879892028 0.83986385056568236
+0.54001796879892028 0.83986385056568236 -0.054857140713616914
+0.57392154628557124 0.81891028733871629 0
+0.59819314586024919 0.79307076339523386 0.10851189307750808
+0.25671454238163 0.90442701067601727 0.33903474443581866
+-0.54001796879892028 0.83986385056568236 -0.054857140713616921
+-0.87376742805233321 -0.033903577486650911 0.48516082808530336
+0 -0.57392154628557124 0.81891028733871629
+0 -0.57392154628557124 -0.81891028733871629
+-0.87376742805233321 -0.033903577486650911 -0.48516082808530336
+-0.85065080835203988 0 -0.52573111211913359
+-0.83986385056568236 -0.054857140713616921 -0.54001796879892028
+-0.52573111211913359 0.85065080835203988 -1.2256505459452105e-18
+-0.54001796879892028 0.83986385056568236 0.054857140713616921
+0.54001796879892028 0.83986385056568236 0.054857140713616914
+0.52573111211913348 0.8506508083520401 2.4513010918904207e-18
+0.48516082808530336 0.87376742805233321 0.033903577486650911
+-0.033903577486650918 -0.48516082808530342 0.87376742805233332
+-1.2256505459452103e-18 -0.52573111211913359 0.85065080835203988
+0.033903577486650918 -0.48516082808530342 0.87376742805233332
+-0.57392154628557124 -0.81891028733871629 0
+-0.54001796879892028 -0.83986385056568236 0.054857140713616921
+1.2256505459452103e-18 -0.52573111211913359 -0.85065080835203988
+-0.033903577486650918 -0.48516082808530342 -0.87376742805233332
+-0.48516082808530336 -0.87376742805233321 0.033903577486650911
+-0.52573111211913359 -0.85065080835203988 1.2256505459452103e-18
+-0.48516082808530336 -0.87376742805233321 -0.033903577486650911
+-0.85065080835203988 -1.2256505459452103e-18 0.52573111211913359
+-0.8189102873387164 0 0.57392154628557113
+0.49982529754025784 0.14730961092137676 0.85311732979922927
+0.49724573572225761 0.14854713354961635 0.85435218642293975
+0.90595336478045685 0.32286639405373119 0.271410708194047
+0.90688305806336122 0.29107512591583123 0.30186484921791512
+0.90641151615731874 0.31222404809805687 0.28115084502736221
+0.17773204761375266 0.87689701064830428 0.44478929974988746
+0.17773204761375261 0.87689701064830428 0.44478929974988757
+0.44478929974988757 0.17773204761375261 0.87689701064830428
+0.44478929974988746 0.17773204761375266 0.87689701064830428
+0.51657855931435848 0.13944047800987086 0.84405122505983243
+0.06507249989019516 0.64943374300381451 0.75762878984770377
+0.096124922711889493 0.65746189559341328 0.74644278217951743
+0.095572989323982643 0.66096525556418151 0.74328545761836984
+0.61001812379817832 0.1056352994139447 0.78429103445404746
+0.58417903277383187 0.11307342108777625 0.80253395542112949
+0.60770816150558549 0.10617487126239183 0.78594000042913037
+0.71089969747156689 0.69602657944578872 0.093129265416474039
+0.70227702532207648 0.70871769768752158 0.067277074024322203
+0.70892487408416871 0.69813515078208477 0.093116941936638747
+0.1974660445788706 0.41582096722616779 0.88692657891222382
+0.18656099607880564 0.38998766307204552 0.90172313788306913
+0.18950565604187924 0.42721864490060907 0.88304523202927665
+0.41582096722616779 0.88692657891222382 0.1974660445788706
+0.38998766307204552 0.90172313788306913 0.18656099607880564
+0.42721864490060912 0.88304523202927654 0.18950565604187919
+0.79307076339523386 0.10851189307750797 0.59819314586024919
+0.81389356246462441 0.11874744154864894 0.56789366986248413
+0.55521070025011254 0.82226795238624728 0.12310298935169575
+0.55392361119767786 0.82440895259656954 0.11626913535565189
+0.55521070025011254 0.82226795238624728 0.12310298935169572
+0.13899360672691591 0.89342795031552769 0.42716188369754926
+0.17031256632806052 0.87149140923129198 0.45766135056488999
+0.1530482164355772 0.8581878051094145 0.48898817612201739
+0.40180685413975104 0.20692923660476614 0.89148810692249203
+0.39369586600014295 0.21254447256850689 0.89390471712616426
+0.82226795238624728 0.12310298935169572 0.55521070025011254
+0.82440895259656954 0.11626913535565189 0.55392361119767786
+0.82226795238624728 0.12310298935169575 0.55521070025011254
+0.10851189307750805 0.59819314586024896 0.79307076339523386
+0.11874744154864894 0.56789366986248413 0.81389356246462441
+0.093129265416474122 0.71089969747156689 0.69602657944578861
+0.067277074024322203 0.70227702532207648 0.70871769768752158
+0.093116941936638636 0.70892487408416871 0.69813515078208488
+0.56789366986248413 0.81389356246462441 0.11874744154864894
+0.10194841255523887 0.62479622481419628 0.77318510024650311
+0.061653318916405575 0.59501600355390494 0.80134563315795981
+0.10542210643598447 0.60871986758868468 0.78560578771446687
+0.10609528287383586 0.60630413399985694 0.78745552743149316
+0.90463734990484679 0.25988381527545973 0.33544566672286741
+0.90494753379947435 0.26218372058148803 0.33295004022963903
+0.80134563315795981 0.061653318916405575 0.59501600355390494
+0.78745552743149327 0.10609528287383579 0.60630413399985716
+0.78560578771446699 0.10542210643598442 0.60871986758868479
+0.59501600355390494 0.80134563315795981 0.061653318916405575
+0.60630413399985716 0.78745552743149316 0.10609528287383588
+0.62479622481419628 0.77318510024650322 0.10194841255523895
+0.60871986758868468 0.78560578771446699 0.10542210643598451
+0.1418121948905855 0.51101182387798283 0.84695178356442269
+0.14564781357706014 0.50275426427774228 0.85145286645038376
+0.50017470245974227 0.85269038907862327 0.14688267020077073
+0.48342144068564125 0.86055952199012919 0.15594877494016779
+0.85145286645038376 0.14564781357706019 0.50275426427774228
+0.49525883802792381 0.86299895207436528 0.099757165525981059
+0.51101182387798261 0.84695178356442291 0.1418121948905855
+0.50275426427774228 0.85145286645038376 0.14564781357706019
+0.66455433327713243 0.095362650095153129 0.74011618472454044
+0.64339140453754151 0.098424941615366676 0.75815048575026589
+0.85269038907862327 0.14688267020077067 0.50017470245974227
+0.86055952199012919 0.15594877494016762 0.48342144068564141
+0.22681489975349639 0.89805158744476077 0.37520377518580433
+0.20668066329284998 0.89826812139385259 0.38781114670466371
+0.2284369195008584 0.89844705357522048 0.37311241287933194
+0.12310298935169572 0.55521070025011254 0.82226795238624728
+0.11626913535565189 0.55392361119767786 0.82440895259656954
+0.12310298935169575 0.55521070025011254 0.82226795238624728
+0.38998187620182156 0.89436470058605533 0.21570896554595276
+0.35918321758479488 0.90105806124803856 0.23967742655656488
+0.35660859546245854 0.90157505838463314 0.24184951424973428
+0.13843733448120885 0.84282425105969117 0.5187348004145107
+0.12458499692215494 0.8241658611683842 0.55121954142464069
+0.12315882465233809 0.82188503772742794 0.55513243511370003
+0.24184951424973422 0.35660859546245849 0.90157505838463314
+0.23967742655656482 0.35918321758479488 0.90105806124803833
+0.85435218642293986 0.49724573572225761 0.14854713354961632
+0.85675191169903997 0.49650199476975138 0.13950602492257505
+0.85311732979922938 0.49982529754025784 0.14730961092137676
+0.10563529941394462 0.78429103445404746 0.61001812379817821
+0.11307342108777627 0.80253395542112949 0.58417903277383187
+0.10617487126239186 0.78594000042913037 0.60770816150558549
+0.84282425105969128 0.51873480041451114 0.13843733448120865
+0.82416586116838464 0.5512195414246408 0.12458499692215486
+0.84380044240886332 0.53207395532465163 0.069986566252294824
+0.82188503772742805 0.55513243511369992 0.12315882465233803
+0.21405999957086966 0.39229183849441451 0.893825128737608
+0.33295004022963903 0.90494753379947435 0.26218372058148826
+0.33088129441328601 0.9151298141069959 0.23033669342916974
+0.33544566672286746 0.90463734990484679 0.25988381527545978
+0.4889881761220175 0.15304821643557709 0.85818780510941428
+0.78429103445404746 0.6100181237981781 0.10563529941394456
+0.8004723406749189 0.59529852733606148 0.069740197633308854
+0.78594000042913037 0.60770816150558526 0.10617487126239183
+0.80253395542112949 0.58417903277383187 0.11307342108777621
+0.72858929180595311 0.094046635219543179 0.67713360594626881
+0.74328545761836984 0.095572989323982616 0.66096525556418162
+0.75762878984770377 0.06507249989019516 0.64943374300381462
+0.74644278217951743 0.096124922711889466 0.65746189559341328
+0.271410708194047 0.90595336478045674 0.32286639405373119
+0.26911716736226499 0.9236940845413727 0.2726998137406515
+0.2811508450273621 0.90641151615731863 0.31222404809805682
+0.30186484921791523 0.90688305806336122 0.29107512591583129
+0.87689701064830428 0.44478929974988757 0.17773204761375266
+0.71884915497263779 0.093588483842681203 0.68777595190194329
+0.89148810692249181 0.40180685413975104 0.20692923660476614
+0.89390471712616404 0.39369586600014284 0.21254447256850695
+0.37520377518580433 0.22681489975349645 0.89805158744476099
+0.38781114670466377 0.20668066329285001 0.89826812139385281
+0.37311241287933189 0.22843691950085854 0.8984470535752207
+0.89436470058605533 0.21570896554595267 0.38998187620182156
+0.90105806124803878 0.23967742655656488 0.35918321758479488
+0.90157505838463314 0.24184951424973419 0.35660859546245843
+0.87684117534766193 0.17811496227257195 0.44486756488630008
+0.88304523202927676 0.18950565604187922 0.42721864490060907
+0.69602657944578872 0.09312926541647408 0.71089969747156689
+0.69813515078208477 0.093116941936638692 0.70892487408416871
+0.66704995977036097 0.095052466200525487 0.73781627941851213
+0.14854713354961635 0.85435218642293975 0.49724573572225772
+0.13950602492257505 0.85675191169903997 0.49650199476975138
+0.1473096109213767 0.85311732979922927 0.49982529754025778
+0.095362650095153129 0.74011618472454033 0.66455433327713254
+0.098424941615366676 0.758150485750266 0.64339140453754151
+0.14688267020077073 0.50017470245974227 0.85269038907862316
+0.099757165525981059 0.49525883802792381 0.86299895207436528
+0.15594877494016779 0.48342144068564119 0.86055952199012919
+0.53207395532465174 0.069986566252294838 0.84380044240886354
+0.55513243511370003 0.123158824652338 0.82188503772742816
+0.5512195414246408 0.12458499692215487 0.82416586116838453
+0.26218372058148809 0.33295004022963903 0.90494753379947435
+0.23033669342916974 0.33088129441328601 0.9151298141069959
+0.25988381527545967 0.33544566672286746 0.9046373499048469
+0.29107512591583118 0.30186484921791523 0.90688305806336111
+0.31222404809805682 0.2811508450273621 0.90641151615731874
+0.2726998137406515 0.26911716736226499 0.9236940845413727
+0.32286639405373108 0.271410708194047 0.90595336478045685
+0.39128013241131554 0.21439421228553296 0.89457789356401551
+0.64943374300381451 0.75762878984770365 0.065072499890195146
+0.65746189559341328 0.74644278217951743 0.096124922711889452
+0.6771336059462687 0.72858929180595311 0.094046635219543206
+0.66096525556418162 0.74328545761836973 0.095572989323982643
+0.893825128737608 0.21405999957086963 0.39229183849441451
+0.74011618472454033 0.66455433327713243 0.095362650095153101
+0.75815048575026589 0.64339140453754129 0.098424941615366732
+0.87149140923129176 0.45766135056489032 0.17031256632806041
+0.89342795031552757 0.42716188369754932 0.13899360672691591
+0.85818780510941439 0.48898817612201739 0.15304821643557714
+0.68777595190194307 0.71884915497263779 0.093588483842681286
+0.76032257344343512 0.64081678241520534 0.098941938751961195
+0.89805158744476088 0.37520377518580417 0.22681489975349667
+0.89826812139385259 0.38781114670466371 0.20668066329284998
+0.89844705357522048 0.37311241287933194 0.22843691950085848
+0.20692923660476614 0.89148810692249181 0.40180685413975092
+0.21254447256850684 0.89390471712616404 0.39369586600014284
+0.62688758712066828 0.77156308049914157 0.10155294642477933
+0.84405122505983243 0.51657855931435837 0.13944047800987086
+0.8104943439581207 0.5727813550993911 0.11695476797072311
+0.44878045857535931 0.87541500307784514 0.17583413883161553
+0.5423386494351099 0.82968743367193953 0.12850859076870802
+0.82968743367193953 0.12850859076870802 0.5423386494351099
+0.39229183849441457 0.893825128737608 0.21405999957086966
+0.17583413883161547 0.44878045857535925 0.87541500307784514
+0.89457789356401518 0.39128013241131554 0.21439421228553296
+0.093588483842681203 0.68777595190194329 0.71884915497263779
+0.21439421228553288 0.89457789356401529 0.39128013241131548
+0.87541500307784514 0.17583413883161553 0.44878045857535925
+0.57278135509939099 0.11695476797072324 0.8104943439581207
+0.77156308049914157 0.10155294642477924 0.62688758712066828
+0.13944047800987086 0.84405122505983243 0.51657855931435837
+0.10155294642477927 0.62688758712066828 0.77156308049914146
+0.12850859076870802 0.5423386494351099 0.82968743367193953
+0.8189102873387164 0 -0.57392154628557113
+0.75762878984770377 -0.06507249989019516 -0.64943374300381462
+0.57608383788574391 -0.33994835690442565 -0.74334549596053456
+0.75762878984770377 -0.06507249989019516 0.64943374300381451
+0.27249577181778539 -0.89756031181852236 0.34659997257597436
+0.39498488175763669 -0.64294043714010041 -0.65621226556123025
+0.27466844612618385 -0.86574218443040085 0.41838703947458189
+0.27572854131968011 -0.82875656716879031 0.48696645046278492
+0.33994835690442565 -0.74334549596053456 -0.57608383788574391
+0.73357768674250456 -0.13183850301701969 -0.66669512270283426
+0.77999809473327264 0 -0.62578188869003271
+0.27249577181778528 -0.89756031181852247 -0.34659997257597425
+0.27466844612618396 -0.86574218443040096 -0.41838703947458172
+0.9506072962094394 0.27889813733511903 0.13624095340381404
+0.34179011670600551 -0.78792826822967776 -0.5121997269099976
+0.27572854131968005 -0.82875656716879031 -0.48696645046278469
+0.19657916295965552 -0.98048795642276054 0
+0.39498488175763657 -0.64294043714010041 0.65621226556123025
+0.96805607891910661 0.24136787945551616 -0.067889430951449614
+0.19937696972895624 -0.96679589706089264 0.15985780358782284
+0.94390741193901806 0.19654920871264411 0.2653435626523063
+0.57608383788574413 -0.33994835690442576 0.74334549596053445
+0.8189102873387164 0 0.57392154628557113
+0.45126666560725853 -0.58750761901107262 0.67170915887432037
+0.50369111272938438 -0.52836121174546036 0.68346886752821701
+0.70519707714513458 -0.20012814034344362 0.68018071850695239
+0.73357768674250445 -0.13183850301701977 0.66669512270283438
+0.50369111272938438 -0.52836121174546036 -0.68346886752821701
+0.45126666560725864 -0.58750761901107262 -0.67170915887432026
+0.70519707714513458 -0.20012814034344362 -0.6801807185069525
+0.94390741193901806 0.19654920871264409 -0.26534356265230635
+0.20470147868264915 -0.9270588370822882 -0.31410064822087252
+0.19937696972895619 -0.96679589706089264 -0.15985780358782287
+0.20209118411408983 -0.95001448309746583 -0.23797402212934904
+0.95001448309746583 0.23797402212934904 -0.20209118411408986
+0.19739352602284616 -0.97703158208487906 -0.080281277350241265
+0.95977938206574664 0.28075529872380572 0
+0.19739352602284607 -0.97703158208487906 0.080281277350241251
+0.96805607891910661 0.24136787945551613 0.067889430951449614
+0.95001448309746583 0.23797402212934904 0.20209118411408983
+0.20209118411408986 -0.95001448309746583 0.23797402212934904
+0.20470147868264921 -0.9270588370822882 0.31410064822087258
+0.34179011670600545 -0.78792826822967776 0.51219972690999771
+0.33994835690442576 -0.74334549596053445 0.57608383788574413
+0.77999809473327264 0 0.62578188869003271
+0.83986385056568236 0.054857140713616914 0.54001796879892028
+0.86299895207436528 0.099757165525981059 0.49525883802792381
+0.83986385056568236 0.054857140713616914 -0.54001796879892028
+0.61446983418191203 -0.27287882084494514 -0.74024588618561449
+0.48798559166164257 -0.46894076499437626 -0.73618246464930537
+0.86299895207436528 0.099757165525981073 -0.49525883802792381
+0.53398612240605769 -0.40547414873191501 -0.74192286377215222
+0.64927986178574371 -0.20469785983476807 -0.7324851174314404
+0.33543172738922172 -0.69401454380114713 -0.63704738383668802
+0.90172313788306913 0.18656099607880564 0.38998766307204552
+0.9506072962094394 0.27889813733511903 -0.13624095340381404
+0.90172313788306901 0.18656099607880575 -0.38998766307204569
+0.88410882140193769 0.14324145828887105 -0.44478475305090459
+0.9151298141069959 0.23033669342916982 -0.33088129441328606
+0.88410882140193769 0.14324145828887103 0.44478475305090454
+0.33543172738922172 -0.69401454380114691 0.63704738383668813
+0.48798559166164268 -0.46894076499437626 0.73618246464930526
+0.53398612240605781 -0.40547414873191501 0.74192286377215233
+0.9151298141069959 0.23033669342916974 0.33088129441328601
+0.61446983418191226 -0.27287882084494519 0.74024588618561449
+0.64927986178574382 -0.20469785983476813 0.7324851174314404
+3  258 1270 1303
+3  259 1272 1307
+3  260 1274 1297
+3  261 1276 1315
+3  262 1278 1319
+3  263 1280 1323
+3  264 1282 1327
+3  265 1284 1311
+3  266 1286 1335
+3  51 50 2300
+3  267 1289 1317
+3  268 1291 1356
+3  269 1293 1309
+3  270 1295 1305
+3  271 1297 1274
+3  272 1299 1330
+3  273 1301 1325
+3  274 1303 1270
+3  275 1305 1295
+3  276 1307 1272
+3  277 1309 1293
+3  278 1311 1284
+3  279 1313 1338
+3  280 1315 1276
+3  281 1317 1289
+3  282 1319 1278
+3  283 1321 1354
+3  284 1323 1280
+3  285 1325 1301
+3  286 1327 1282
+3  287 1329 1340
+3  288 1330 1299
+3  289 2292 2327
+3  290 1333 1352
+3  291 1335 1286
+3  292 1337 1342
+3  293 2299 2300
+3  294 1338 1313
+3  295 1340 1329
+3  296 1342 1337
+3  297 1344 1346
+3  298 1346 1344
+3  299 1348 1350
+3  300 1350 1348
+3  301 1352 1333
+3  302 1354 1321
+3  303 1356 1291
+3  2244 1358 1370
+3  1908 1360 1364
+3  304 1362 1368
+3  305 1364 1360
+3  306 1366 1372
+3  307 1368 1362
+3  308 1370 1358
+3  309 1372 1366
+3  310 1374 1380
+3  311 1376 1390
+3  312 1378 1384
+3  313 1380 1374
+3  314 1382 1388
+3  315 1384 1378
+3  316 1386 1392
+3  317 1388 1382
+3  318 1390 1376
+3  319 1392 1386
+3  168 167 2348
+3  320 1394 1453
+3  321 1396 1497
+3  322 1398 1538
+3  323 1400 1516
+3  324 1402 1437
+3  325 1404 1524
+3  326 1406 1429
+3  327 1408 1463
+3  328 1410 1441
+3  329 1412 1481
+3  330 1414 1417
+3  1932 1417 1414
+3  984 1419 1510
+3  2202 1421 1471
+3  331 1423 1469
+3  332 1425 1427
+3  333 1427 1425
+3  334 1429 1406
+3  335 1431 1542
+3  336 1433 1435
+3  337 1435 1433
+3  338 1437 1402
+3  339 1439 1534
+3  340 1441 1410
+3  341 1443 1479
+3  342 1445 1505
+3  343 1447 1503
+3  344 1449 1451
+3  345 1451 1449
+3  346 1453 1394
+3  347 1455 1518
+3  348 1457 1459
+3  349 1459 1457
+3  350 1461 1536
+3  351 1463 1408
+3  352 1465 1467
+3  353 1467 1465
+3  354 1469 1423
+3  355 1471 1421
+3  356 1473 1475
+3  357 1475 1473
+3  358 1477 1508
+3  2315 133 2343
+3  359 1479 1443
+3  360 1481 1412
+3  361 1483 1485
+3  362 1485 1483
+3  363 1487 1532
+3  364 1489 1530
+3  365 1491 1493
+3  366 1493 1491
+3  367 1495 1512
+3  368 1497 1396
+3  369 1499 1501
+3  370 1501 1499
+3  371 1503 1447
+3  372 1505 1445
+3  373 1508 1477
+3  374 1510 1419
+3  375 1512 1495
+3  376 1514 1520
+3  377 1516 1400
+3  378 1518 1455
+3  379 1520 1514
+3  380 1522 1528
+3  381 1524 1404
+3  382 1526 1540
+3  383 1528 1522
+3  384 1530 1489
+3  385 1532 1487
+3  386 1534 1439
+3  387 1536 1461
+3  388 1538 1398
+3  389 1540 1526
+3  390 1542 1431
+3  1543 391 2082
+3  392 1544 2233
+3  393 1546 1708
+3  394 1547 1645
+3  395 1548 1716
+3  396 1549 1648
+3  397 1550 1695
+3  398 1551 1637
+3  399 1552 1731
+3  400 1553 1656
+3  401 1554 1739
+3  402 1555 1660
+3  403 1556 1747
+3  404 1557 1664
+3  405 1558 1754
+3  406 1559 1668
+3  407 1560 1723
+3  408 1561 1652
+3  409 1562 1763
+3  410 2326 1670
+3  411 1563 1771
+3  412 1564 1672
+3  2290 64 2338
+3  413 1565 1735
+3  414 1566 1730
+3  415 1567 1815
+3  416 1568 1810
+3  417 1569 1720
+3  418 1570 1715
+3  419 1571 1712
+3  420 1572 1707
+3  421 1573 1649
+3  422 1574 1719
+3  423 1575 2346
+3  1576 424 2063
+3  425 2240 545
+3  1577 426 2073
+3  427 2198 2191
+3  428 1578 1750
+3  429 1579 1746
+3  430 1580 1642
+3  431 1581 1703
+3  432 1582 1691
+3  433 1583 1814
+3  434 1584 1646
+3  435 1585 1711
+3  436 1586 1687
+3  437 1587 1806
+3  438 1588 1669
+3  439 1589 1756
+3  2312 1590 2334
+3  440 1591 1653
+3  441 1592 1726
+3  442 1593 1679
+3  443 1594 1790
+3  444 1595 1657
+3  445 1596 1734
+3  446 1597 1811
+3  447 1598 1690
+3  448 1599 1661
+3  449 1600 1742
+3  450 1601 1704
+3  451 1602 1699
+3  452 1603 1665
+3  453 1604 1749
+3  454 1605 1783
+3  455 1606 1780
+3  456 1607 1696
+3  457 1608 1694
+3  458 1609 1807
+3  459 1610 1802
+3  460 1611 1671
+3  461 1612 1766
+3  462 1613 1787
+3  463 1614 1678
+3  2296 2316 1673
+3  464 1615 1774
+3  465 1616 1727
+3  466 1617 1722
+3  467 1618 1757
+3  468 1619 1753
+3  469 1620 1775
+3  470 1621 1770
+3  471 1622 1795
+3  472 1623 1682
+3  473 1624 1791
+3  474 1625 1786
+3  475 1626 1803
+3  476 1627 1686
+3  477 1628 1799
+3  478 1629 1794
+3  479 1630 1767
+3  480 1631 1762
+3  481 1632 1743
+3  482 1633 1738
+3  483 1634 1683
+3  484 1635 1798
+3  2239 485 486
+3  487 1637 1551
+3  488 2222 1576
+3  489 1639 1641
+3  490 1640 1644
+3  491 1641 1639
+3  492 1642 1580
+3  493 1643 1647
+3  494 1644 1640
+3  495 1645 1547
+3  496 1646 1584
+3  497 1647 1643
+3  498 1648 1549
+3  499 1649 1573
+3  500 1650 1655
+3  501 1651 1666
+3  502 1652 1561
+3  503 1653 1591
+3  504 1654 1659
+3  505 1655 1650
+3  506 1656 1553
+3  507 1657 1595
+3  508 1658 1663
+3  509 1659 1654
+3  510 1660 1555
+3  511 1661 1599
+3  512 1662 1667
+3  513 1663 1658
+3  514 1664 1557
+3  515 1665 1603
+3  516 1666 1651
+3  517 1667 1662
+3  518 1668 1559
+3  519 1669 1588
+3  2289 1670 2326
+3  520 1671 1611
+3  521 1672 1564
+3  522 1673 2316
+3  2175 2344 523
+3  524 2264 1577
+3  525 1676 1729
+3  526 1677 1772
+3  527 1678 1614
+3  528 1679 1593
+3  529 1680 1809
+3  530 1681 1788
+3  531 1682 1623
+3  532 1683 1634
+3  533 1684 1714
+3  534 1685 1796
+3  535 1686 1627
+3  536 1687 1586
+3  537 1688 1706
+3  538 1689 1740
+3  539 1690 1598
+3  540 1691 1582
+3  541 1692 1718
+3  542 1693 1758
+3  543 1694 1608
+3  544 1695 1550
+3  545 546 2116
+3  547 1696 1607
+3  2311 197 2288
+3  2211 548 2281
+3  549 1697 1782
+3  2167 550 551
+3  552 1699 1602
+3  553 2177 1543
+3  554 1701 1745
+3  555 1702 1705
+3  556 1703 1581
+3  557 1704 1601
+3  558 1705 1702
+3  559 1706 1688
+3  560 1707 1572
+3  561 1708 1546
+3  562 1709 1813
+3  563 1710 1713
+3  564 1711 1585
+3  565 1712 1571
+3  566 1713 1710
+3  567 1714 1684
+3  568 1715 1570
+3  569 1716 1548
+3  570 1717 1805
+3  571 1718 1692
+3  572 1719 1574
+3  573 1720 1569
+3  574 2342 1755
+3  575 1721 1778
+3  576 1722 1617
+3  577 1723 1560
+3  578 1724 1777
+3  579 1725 1728
+3  580 1726 1592
+3  581 1727 1616
+3  582 1728 1725
+3  583 1729 1676
+3  584 1730 1566
+3  585 1731 1552
+3  586 1732 1789
+3  587 1733 1736
+3  588 1734 1596
+3  589 1735 1565
+3  590 1736 1733
+3  591 1737 1808
+3  592 1738 1633
+3  593 1739 1554
+3  594 1740 1689
+3  595 1741 1744
+3  596 1742 1600
+3  597 1743 1632
+3  598 1744 1741
+3  599 1745 1701
+3  600 1746 1579
+3  601 1747 1556
+3  602 1748 1751
+3  603 1749 1604
+3  604 1750 1578
+3  605 1751 1748
+3  606 1752 1781
+3  607 1753 1619
+3  608 1754 1558
+3  2335 1755 2342
+3  609 1756 1589
+3  610 1757 1618
+3  611 1758 1693
+3  612 1759 1760
+3  237 236 2345
+3  2309 2346 1575
+3  613 1760 1759
+3  614 1761 1804
+3  615 1762 1631
+3  616 1763 1562
+3  617 1764 1801
+3  618 1765 1768
+3  619 1766 1612
+3  620 1767 1630
+3  621 1768 1765
+3  622 1769 1784
+3  623 1770 1621
+3  624 1771 1563
+3  625 1772 1677
+3  626 1773 1776
+3  627 1774 1615
+3  628 1775 1620
+3  629 1776 1773
+3  630 1777 1724
+3  631 2334 1590
+3  632 1778 1721
+3  104 103 2286
+3  633 1780 1606
+3  634 1781 1752
+3  635 1782 1697
+3  636 1783 1605
+3  637 1784 1769
+3  638 1785 1792
+3  639 1786 1625
+3  640 1787 1613
+3  641 1788 1681
+3  642 1789 1732
+3  643 1790 1594
+3  644 1791 1624
+3  645 1792 1785
+3  646 1793 1800
+3  647 1794 1629
+3  648 1795 1622
+3  649 1796 1685
+3  650 1797 1812
+3  651 1798 1635
+3  652 1799 1628
+3  653 1800 1793
+3  654 1801 1764
+3  655 1802 1610
+3  656 1803 1626
+3  657 1804 1761
+3  658 1805 1717
+3  659 1806 1587
+3  660 1807 1609
+3  661 1808 1737
+3  662 1809 1680
+3  663 1810 1568
+3  664 1811 1597
+3  665 1812 1797
+3  666 1813 1709
+3  667 1814 1583
+3  668 1815 1567
+3  556 1817 669
+3  393 1152 670
+3  564 1819 671
+3  395 1161 672
+3  572 1821 673
+3  397 1136 674
+3  580 1823 675
+3  399 1177 676
+3  588 1825 677
+3  401 1186 678
+3  596 1827 679
+3  403 1195 680
+3  603 1829 681
+3  405 1203 682
+3  609 1831 683
+3  407 1168 684
+3  2345 1833 2328
+3  409 1214 685
+3  619 1835 686
+3  411 1222 687
+3  627 1837 688
+3  2338 2293 689
+3  643 1839 690
+3  413 1181 691
+3  651 1841 692
+3  415 1268 693
+3  659 1843 694
+3  417 1165 695
+3  667 1845 696
+3  419 1157 697
+3  487 1847 698
+3  421 1090 699
+3  543 1849 700
+3  423 1209 701
+3  552 1851 702
+3  428 1198 703
+3  495 1853 704
+3  430 1083 705
+3  560 1855 706
+3  432 1132 707
+3  498 1857 708
+3  434 1087 709
+3  568 1859 710
+3  436 1128 711
+3  502 1861 712
+3  438 1111 713
+3  576 1862 714
+3  2333 89 88
+3  506 1864 715
+3  440 1095 716
+3  584 1866 717
+3  442 1119 718
+3  510 1868 719
+3  444 1099 720
+3  592 1870 721
+3  446 1264 722
+3  514 1872 723
+3  448 1103 724
+3  600 1874 725
+3  450 1148 726
+3  518 1876 727
+3  452 1107 728
+3  607 1878 729
+3  454 1234 730
+3  2306 212 2349
+3  456 1138 731
+3  255 254 2291
+3  615 1880 732
+3  458 1260 733
+3  521 1881 734
+3  460 1113 735
+3  623 1883 736
+3  462 1238 737
+3  631 1885 738
+3  465 1173 739
+3  633 1887 740
+3  467 1206 741
+3  527 1889 742
+3  469 1227 743
+3  639 1891 744
+3  471 1247 745
+3  531 1893 746
+3  473 1242 747
+3  647 1895 748
+3  475 1256 749
+3  535 1897 750
+3  477 1252 751
+3  655 1899 752
+3  479 1218 753
+3  539 1901 754
+3  481 1191 755
+3  663 1903 756
+3  483 1124 757
+3  493 1904 758
+3  487 944 759
+3  430 1905 760
+3  489 1082 761
+3  434 1906 762
+3  490 1085 763
+3  421 1909 764
+3  493 1088 765
+3  489 1910 766
+3  495 938 767
+3  490 1911 768
+3  498 941 769
+3  444 1912 770
+3  500 1097 771
+3  512 1913 772
+3  502 959 773
+3  448 1914 774
+3  504 1101 775
+3  516 1915 776
+3  506 947 777
+3  452 1916 778
+3  508 1105 779
+3  500 1917 780
+3  510 950 781
+3  438 1918 782
+3  512 1109 783
+3  504 1919 784
+3  514 953 785
+3  440 1920 786
+3  516 1093 787
+3  508 1921 788
+3  518 956 789
+3  460 2322 2304
+3  521 2317 2320
+3  399 1922 790
+3  525 1175 791
+3  629 1923 792
+3  527 1040 793
+3  446 1924 794
+3  529 1262 795
+3  586 1925 796
+3  531 1055 797
+3  395 1926 798
+3  533 1159 799
+3  665 1927 800
+3  535 1061 801
+3  393 1928 802
+3  537 1150 803
+3  598 1929 804
+3  539 1015 805
+3  417 1930 806
+3  541 1163 807
+3  613 1931 808
+3  543 1030 809
+3  456 1933 810
+3  2311 1137 811
+3  454 1934 812
+3  549 1233 813
+3  605 1935 814
+3  552 1021 815
+3  403 1936 816
+3  554 1193 817
+3  537 1937 818
+3  556 990 819
+3  450 1938 820
+3  558 1146 821
+3  594 1939 822
+3  560 975 823
+3  415 1940 824
+3  562 1266 825
+3  533 1941 826
+3  564 996 827
+3  419 1942 828
+3  566 1155 829
+3  649 1943 830
+3  568 972 831
+3  458 1944 832
+3  570 1258 833
+3  611 1945 834
+3  572 978 835
+3  467 1946 836
+3  574 1204 837
+3  2294 1947 838
+3  576 1046 839
+3  2338 1948 840
+3  578 1229 841
+3  525 1949 842
+3  580 1006 843
+3  465 1950 844
+3  582 1171 845
+3  625 1951 846
+3  584 966 847
+3  473 1952 848
+3  586 1240 849
+3  661 1953 850
+3  588 1012 851
+3  413 1954 852
+3  590 1179 853
+3  529 1955 854
+3  592 1070 855
+3  432 1956 856
+3  594 1130 857
+3  554 1957 858
+3  596 1018 859
+3  481 1958 860
+3  598 1189 861
+3  558 1959 862
+3  600 987 863
+3  634 1960 864
+3  603 1024 865
+3  428 1961 866
+3  605 1196 867
+3  549 1962 868
+3  607 1049 869
+3  632 1963 870
+3  609 1002 871
+3  2310 201 200
+3  397 1964 872
+3  611 1134 873
+3  657 1965 874
+3  2345 1031 875
+3  423 1966 876
+3  613 1208 877
+3  570 1967 878
+3  615 1067 879
+3  475 1968 880
+3  617 1254 881
+3  637 1969 882
+3  619 1037 883
+3  479 1970 884
+3  621 1216 885
+3  645 1971 886
+3  623 1052 887
+3  442 1972 888
+3  625 1117 889
+3  578 1973 890
+3  627 1043 891
+3  469 1974 892
+3  629 1225 893
+3  582 1975 894
+3  631 1003 895
+3  407 1976 896
+3  632 1166 897
+3  574 1977 2341
+3  633 1027 898
+3  405 1978 899
+3  634 1201 900
+3  411 1979 901
+3  637 1220 902
+3  653 1980 903
+3  639 1058 904
+3  483 1981 905
+3  641 1122 906
+3  590 1982 907
+3  643 1009 908
+3  462 1983 909
+3  645 1236 910
+3  617 1984 911
+3  647 1064 912
+3  436 1985 913
+3  649 1126 914
+3  562 1986 915
+3  651 1073 916
+3  471 1987 917
+3  653 1245 918
+3  621 1988 919
+3  655 1034 920
+3  409 1989 921
+3  657 1212 922
+3  541 1990 923
+3  659 999 924
+3  401 1991 925
+3  661 1184 926
+3  641 1992 927
+3  663 969 928
+3  477 1993 929
+3  665 1250 930
+3  566 1994 931
+3  667 993 932
+3  451 1995 933
+3  392 2137 934
+3  1907 935 2193
+3  420 1996 936
+3  394 1086 937
+3  304 767 938
+3  258 704 1853
+3  418 1997 939
+3  396 1089 940
+3  306 769 941
+3  259 708 1857
+3  457 1998 942
+3  398 1077 943
+3  308 759 944
+3  260 698 1847
+3  414 1999 945
+3  400 1098 946
+3  310 777 947
+3  261 715 1864
+3  482 2000 948
+3  402 1102 949
+3  312 781 950
+3  262 719 1868
+3  429 2001 951
+3  404 1106 952
+3  314 785 953
+3  263 723 1872
+3  468 2002 954
+3  406 1110 955
+3  316 789 956
+3  264 727 1876
+3  466 2003 957
+3  408 1094 958
+3  318 773 959
+3  265 712 1861
+3  480 2004 960
+3  410 1112 961
+3  470 2005 962
+3  412 1114 963
+3  266 734 1881
+3  72 71 2313
+3  445 2006 964
+3  414 1176 965
+3  320 847 966
+3  267 717 1866
+3  433 2007 967
+3  416 1263 968
+3  322 928 969
+3  268 756 1903
+3  422 2008 970
+3  418 1160 971
+3  324 831 972
+3  269 710 1859
+3  435 2009 973
+3  420 1151 974
+3  326 823 975
+3  270 706 1855
+3  396 2011 976
+3  422 1164 977
+3  328 835 978
+3  271 673 1821
+3  272 2306 2349
+3  398 2013 979
+3  425 2014 980
+3  981 982 2120
+3  2323 2017 2298
+3  427 2259 983
+3  2206 984 2262
+3  453 2018 985
+3  429 1194 986
+3  331 863 987
+3  273 725 1874
+3  392 2020 988
+3  431 1147 989
+3  333 819 990
+3  274 669 1817
+3  447 2022 991
+3  433 1267 992
+3  335 932 993
+3  275 696 1845
+3  394 2024 994
+3  435 1156 995
+3  337 827 996
+3  276 671 1819
+3  476 2026 997
+3  437 1259 998
+3  339 924 999
+3  277 694 1843
+3  406 2028 1000
+3  439 1205 1001
+3  341 871 1002
+3  278 683 1831
+3  343 895 1003
+3  279 738 1885
+3  408 2030 1004
+3  441 1172 1005
+3  345 843 1006
+3  280 675 1823
+3  463 2032 1007
+3  443 1241 1008
+3  347 908 1009
+3  281 690 1839
+3  400 2034 1010
+3  445 1180 1011
+3  349 851 1012
+3  282 677 1825
+3  416 2035 1013
+3  447 1131 1014
+3  351 805 1015
+3  283 754 1901
+3  402 2037 1016
+3  449 1190 1017
+3  353 859 1018
+3  284 679 1827
+3  431 2038 1019
+3  451 1142 1020
+3  355 815 1021
+3  285 702 1851
+3  404 2040 1022
+3  453 1197 1023
+3  357 865 1024
+3  286 681 1829
+3  427 2041 1025
+3  455 1231 1026
+3  2343 898 1027
+3  287 740 1887
+3  425 2042 1028
+3  457 1135 1029
+3  360 809 1030
+3  288 700 1849
+3  362 875 1031
+3  289 2328 1833
+3  437 2043 1032
+3  459 1255 1033
+3  364 920 1034
+3  290 752 1899
+3  410 2045 1035
+3  461 1217 1036
+3  366 883 1037
+3  291 686 1835
+3  474 2046 1038
+3  463 1118 1039
+3  368 793 1040
+3  292 742 1889
+3  412 2048 1041
+3  464 1226 1042
+3  370 891 1043
+3  293 688 1837
+3  441 2049 1044
+3  466 1167 1045
+3  372 839 1046
+3  294 714 1862
+3  455 2050 2340
+3  2323 152 2321
+3  439 2051 1047
+3  468 1202 1048
+3  373 869 1049
+3  295 729 1878
+3  464 2052 1050
+3  470 1221 1051
+3  375 887 1052
+3  296 736 1883
+3  478 2053 1053
+3  472 1123 1054
+3  377 797 1055
+3  297 746 1893
+3  443 2054 1056
+3  474 1237 1057
+3  379 904 1058
+3  298 744 1891
+3  459 2055 1059
+3  476 1127 1060
+3  381 801 1061
+3  299 750 1897
+3  484 2056 1062
+3  478 1246 1063
+3  383 912 1064
+3  300 748 1895
+3  461 2057 1065
+3  480 1213 1066
+3  385 879 1067
+3  301 732 1880
+3  449 2058 1068
+3  482 1185 1069
+3  387 855 1070
+3  302 721 1870
+3  472 2060 1071
+3  484 1251 1072
+3  389 916 1073
+3  303 692 1841
+3  491 2062 1074
+3  2238 2180 1075
+3  2127 1076 2200
+3  544 943 1077
+3  488 979 2013
+3  2248 1078 2243
+3  494 2064 1079
+3  2152 1074 2062
+3  1908 1080 2235
+3  497 2066 1081
+3  491 1079 2064
+3  305 761 1082
+3  304 766 1910
+3  553 934 2137
+3  492 988 2020
+3  258 705 1083
+3  305 760 1905
+3  2238 2067 1084
+3  494 1081 2066
+3  307 763 1085
+3  306 768 1911
+3  561 937 1086
+3  496 994 2024
+3  259 709 1087
+3  307 762 1906
+3  2152 1075 2180
+3  497 1084 2067
+3  309 765 1088
+3  308 758 1904
+3  569 940 1089
+3  499 976 2011
+3  260 699 1090
+3  309 764 1909
+3  509 2069 1091
+3  501 1108 1092
+3  311 787 1093
+3  310 776 1915
+3  577 958 1094
+3  503 1004 2030
+3  261 716 1095
+3  311 786 1920
+3  513 2070 1096
+3  505 1091 2069
+3  313 771 1097
+3  312 780 1917
+3  585 946 1098
+3  507 1010 2034
+3  262 720 1099
+3  313 770 1912
+3  517 2071 1100
+3  509 1096 2070
+3  315 775 1101
+3  314 784 1919
+3  593 949 1102
+3  511 1016 2037
+3  263 724 1103
+3  315 774 1914
+3  501 2072 1104
+3  513 1100 2071
+3  317 779 1105
+3  316 788 1921
+3  601 952 1106
+3  515 1022 2040
+3  264 728 1107
+3  317 778 1916
+3  505 1092 1108
+3  517 1104 2072
+3  319 783 1109
+3  318 772 1913
+3  608 955 1110
+3  519 1000 2028
+3  265 713 1111
+3  319 782 1918
+3  616 961 1112
+3  520 1035 2045
+3  266 735 1113
+3  14 13 2304
+3  624 963 1114
+3  522 1041 2048
+3  190 189 2329
+3  2331 2143 2330
+3  149 148 2321
+3  524 2298 2017
+3  2156 1506 1115
+3  579 2074 1116
+3  526 1223 2101
+3  321 889 1117
+3  320 846 1951
+3  640 1039 1118
+3  528 1007 2032
+3  267 718 1119
+3  321 888 1972
+3  591 2075 1120
+3  530 1239 1121
+3  323 906 1122
+3  322 927 1992
+3  648 1054 1123
+3  532 1071 2060
+3  268 757 1124
+3  323 905 1981
+3  563 2076 1125
+3  534 1248 2106
+3  325 914 1126
+3  324 830 1943
+3  656 1060 1127
+3  536 997 2026
+3  269 711 1128
+3  325 913 1985
+3  555 2077 1129
+3  538 1187 2091
+3  327 857 1130
+3  326 822 1939
+3  664 1014 1131
+3  540 991 2022
+3  270 707 1132
+3  327 856 1956
+3  658 2078 1133
+3  542 1207 2095
+3  329 873 1134
+3  328 834 1945
+3  547 1029 1135
+3  544 942 1998
+3  271 674 1136
+3  329 872 1964
+3  330 811 1137
+3  488 980 2014
+3  547 1028 2042
+3  272 731 1138
+3  330 810 1933
+3  2157 2329 2307
+3  606 2079 1139
+3  2160 1141 2080
+3  984 1140 2256
+3  635 2080 1141
+3  2169 2135 2092
+3  557 1020 1142
+3  553 933 1995
+3  2214 1143 2201
+3  595 2083 1144
+3  555 1149 1145
+3  332 821 1146
+3  331 862 1959
+3  492 989 1147
+3  557 1019 2038
+3  273 726 1148
+3  332 820 1938
+3  599 1145 1149
+3  559 1129 2077
+3  334 803 1150
+3  333 818 1937
+3  565 974 1151
+3  561 936 1996
+3  274 670 1152
+3  334 802 1928
+3  650 2084 1153
+3  563 1158 1154
+3  336 829 1155
+3  335 931 1994
+3  496 995 1156
+3  565 973 2009
+3  275 697 1157
+3  336 828 1942
+3  666 1154 1158
+3  567 1125 2076
+3  338 799 1159
+3  337 826 1941
+3  573 971 1160
+3  569 939 1997
+3  276 672 1161
+3  338 798 1926
+3  614 2085 1162
+3  571 1133 2078
+3  340 807 1163
+3  339 923 1990
+3  499 977 1164
+3  573 970 2008
+3  277 695 1165
+3  340 806 1930
+3  575 1230 2332
+3  342 897 1166
+3  341 870 1963
+3  581 1045 1167
+3  577 957 2003
+3  278 684 1168
+3  342 896 1976
+3  626 2086 1169
+3  579 1174 1170
+3  344 845 1171
+3  343 894 1975
+3  503 1005 1172
+3  581 1044 2049
+3  279 739 1173
+3  344 844 1950
+3  630 1170 1174
+3  583 1116 2074
+3  346 791 1175
+3  345 842 1949
+3  589 965 1176
+3  585 945 1999
+3  280 676 1177
+3  346 790 1922
+3  530 2087 1178
+3  587 1182 2089
+3  348 853 1179
+3  347 907 1982
+3  507 1011 1180
+3  589 964 2006
+3  281 691 1181
+3  348 852 1954
+3  642 2089 1182
+3  591 1261 1183
+3  350 926 1184
+3  349 850 1953
+3  597 1069 1185
+3  593 948 2000
+3  282 678 1186
+3  350 925 1991
+3  559 2091 1187
+3  595 1192 1188
+3  352 861 1189
+3  351 804 1929
+3  511 1017 1190
+3  597 1068 2058
+3  283 755 1191
+3  352 860 1958
+3  538 1188 1192
+3  599 1144 2083
+3  354 817 1193
+3  353 858 1957
+3  604 986 1194
+3  601 951 2001
+3  284 680 1195
+3  354 816 1936
+3  2160 2092 2135
+3  602 1199 2094
+3  356 867 1196
+3  355 814 1935
+3  515 1023 1197
+3  604 985 2018
+3  285 703 1198
+3  356 866 1961
+3  2169 2094 1199
+3  606 1232 1200
+3  358 900 1201
+3  357 864 1960
+3  610 1048 1202
+3  608 954 2002
+3  286 682 1203
+3  358 899 1978
+3  359 837 1204
+3  2343 2341 1977
+3  519 1001 1205
+3  610 1047 2051
+3  287 741 1206
+3  359 836 1946
+3  571 2095 1207
+3  612 1210 2097
+3  361 877 1208
+3  360 808 1931
+3  288 701 1209
+3  361 876 1966
+3  542 2097 1210
+3  614 1257 1211
+3  363 922 1212
+3  362 874 1965
+3  620 1066 1213
+3  616 960 2004
+3  289 685 1214
+3  363 921 1989
+3  646 2098 1215
+3  618 1219 2099
+3  365 885 1216
+3  364 919 1988
+3  520 1036 1217
+3  620 1065 2057
+3  290 753 1218
+3  365 884 1970
+3  654 2099 1219
+3  622 1235 2102
+3  367 902 1220
+3  366 882 1969
+3  628 1051 1221
+3  624 962 2005
+3  291 687 1222
+3  367 901 1979
+3  583 2101 1223
+3  626 1228 1224
+3  369 893 1225
+3  368 792 1923
+3  522 1042 1226
+3  628 1050 2052
+3  292 743 1227
+3  369 892 1974
+3  526 1224 1228
+3  630 1169 2086
+3  371 841 1229
+3  370 890 1973
+3  293 689 2293
+3  371 840 1948
+3  2335 2332 1230
+3  109 108 2295
+3  372 838 1947
+3  294 2333 2287
+3  575 2285 2295
+3  2157 2330 2143
+3  636 1026 1231
+3  2303 2340 2050
+3  602 1200 1232
+3  635 1139 2079
+3  374 813 1233
+3  373 868 1962
+3  524 983 2259
+3  636 1025 2041
+3  295 730 1234
+3  374 812 1934
+3  618 2102 1235
+3  638 1243 2104
+3  376 910 1236
+3  375 886 1971
+3  644 1057 1237
+3  640 1038 2046
+3  296 737 1238
+3  376 909 1983
+3  662 1121 1239
+3  642 1178 2087
+3  378 849 1240
+3  377 796 1925
+3  528 1008 1241
+3  644 1056 2054
+3  297 747 1242
+3  378 848 1952
+3  622 2104 1243
+3  646 1253 1244
+3  380 918 1245
+3  379 903 1980
+3  652 1063 1246
+3  648 1053 2053
+3  298 745 1247
+3  380 917 1987
+3  567 2106 1248
+3  650 1265 1249
+3  382 930 1250
+3  381 800 1927
+3  532 1072 1251
+3  652 1062 2056
+3  299 751 1252
+3  382 929 1993
+3  638 1244 1253
+3  654 1215 2098
+3  384 881 1254
+3  383 911 1984
+3  660 1033 1255
+3  656 1059 2055
+3  300 749 1256
+3  384 880 1968
+3  612 1211 1257
+3  658 1162 2085
+3  386 833 1258
+3  385 878 1967
+3  536 998 1259
+3  660 1032 2043
+3  301 733 1260
+3  386 832 1944
+3  587 1183 1261
+3  662 1120 2075
+3  388 795 1262
+3  387 854 1955
+3  668 968 1263
+3  664 1013 2035
+3  302 722 1264
+3  388 794 1924
+3  534 1249 1265
+3  666 1153 2084
+3  390 825 1266
+3  389 915 1986
+3  540 992 1267
+3  668 967 2007
+3  303 693 1268
+3  390 824 1940
+3  1269 1270 1083
+3  274 1270 669
+3  1271 1272 1087
+3  276 1272 671
+3  1273 1274 1090
+3  271 1274 673
+3  1275 1276 1095
+3  280 1276 675
+3  1277 1278 1099
+3  282 1278 677
+3  1279 1280 1103
+3  284 1280 679
+3  1281 1282 1107
+3  286 1282 681
+3  1283 1284 1111
+3  278 1284 683
+3  289 2327 2328
+3  1285 1286 1113
+3  291 1286 686
+3  1287 2300 2297
+3  293 2300 688
+3  1288 1289 1119
+3  281 1289 690
+3  1290 1291 1124
+3  303 1291 692
+3  1292 1293 1128
+3  277 1293 694
+3  1294 1295 1132
+3  275 1295 696
+3  1296 1297 1136
+3  260 1297 698
+3  1298 1299 1138
+3  288 1299 700
+3  1300 1301 1148
+3  285 1301 702
+3  1302 1303 1152
+3  258 1303 704
+3  1304 1305 1157
+3  270 1305 706
+3  1306 1307 1161
+3  259 1307 708
+3  1308 1309 1165
+3  269 1309 710
+3  1310 1311 1168
+3  265 1311 712
+3  1312 1313 1173
+3  294 1313 714
+3  1314 1315 1177
+3  261 1315 715
+3  1316 1317 1181
+3  267 1317 717
+3  1318 1319 1186
+3  262 1319 719
+3  1320 1321 1191
+3  302 1321 721
+3  1322 1323 1195
+3  263 1323 723
+3  1324 1325 1198
+3  273 1325 725
+3  1326 1327 1203
+3  264 1327 727
+3  1328 1329 1206
+3  295 1329 729
+3  2347 1330 1209
+3  272 1330 2306
+3  1331 2292 1214
+3  2291 253 252
+3  1332 1333 1218
+3  301 1333 732
+3  1334 1335 1222
+3  266 1335 734
+3  1336 1337 1227
+3  296 1337 736
+3  2336 1338 2287
+3  279 1338 738
+3  1339 1340 1234
+3  287 1340 740
+3  1341 1342 1238
+3  292 1342 742
+3  1343 1344 1242
+3  298 1344 744
+3  1345 1346 1247
+3  297 1346 746
+3  1347 1348 1252
+3  300 1348 748
+3  1349 1350 1256
+3  299 1350 750
+3  1351 1352 1260
+3  290 1352 752
+3  1353 1354 1264
+3  283 1354 754
+3  1355 1356 1268
+3  268 1356 756
+3  1357 1358 2127
+3  308 1358 758
+3  1359 1360 1907
+3  305 1360 760
+3  1361 1362 938
+3  307 1362 762
+3  1363 1364 1082
+3  1908 1364 2148
+3  1365 1366 941
+3  309 1366 764
+3  1367 1368 1085
+3  304 1368 766
+3  1369 1370 944
+3  2244 1370 2248
+3  1371 1372 1088
+3  306 1372 768
+3  1373 1374 947
+3  313 1374 770
+3  1375 1376 1093
+3  318 1376 772
+3  1377 1378 950
+3  315 1378 774
+3  1379 1380 1097
+3  310 1380 776
+3  1381 1382 953
+3  317 1382 778
+3  1383 1384 1101
+3  312 1384 780
+3  1385 1386 956
+3  319 1386 782
+3  1387 1388 1105
+3  314 1388 784
+3  1389 1390 959
+3  311 1390 786
+3  1391 1392 1109
+3  316 1392 788
+3  1393 1394 966
+3  346 1394 790
+3  1395 1396 1117
+3  368 1396 792
+3  1397 1398 969
+3  388 1398 794
+3  1399 1400 1122
+3  377 1400 796
+3  1401 1402 972
+3  338 1402 798
+3  1403 1404 1126
+3  381 1404 800
+3  1405 1406 975
+3  334 1406 802
+3  1407 1408 1130
+3  351 1408 804
+3  1409 1410 978
+3  340 1410 806
+3  1411 1412 1134
+3  360 1412 808
+3  1413 1414 1137
+3  1932 1414 1415
+3  1416 1417 981
+3  330 1417 810
+3  1418 1419 2206
+3  374 1419 812
+3  1420 1421 2130
+3  355 1421 814
+3  1422 1423 987
+3  354 1423 816
+3  1424 1425 1146
+3  333 1425 818
+3  1426 1427 990
+3  332 1427 820
+3  1428 1429 1150
+3  326 1429 822
+3  1430 1431 993
+3  390 1431 824
+3  1432 1433 1155
+3  337 1433 826
+3  1434 1435 996
+3  336 1435 828
+3  1436 1437 1159
+3  324 1437 830
+3  1438 1439 999
+3  386 1439 832
+3  1440 1441 1163
+3  328 1441 834
+3  1442 1443 1002
+3  359 1443 836
+3  1444 1445 1166
+3  372 1445 838
+3  1446 1447 1003
+3  371 1447 840
+3  1448 1449 1171
+3  345 1449 842
+3  1450 1451 1006
+3  344 1451 844
+3  1452 1453 1175
+3  320 1453 846
+3  1454 1455 1009
+3  378 1455 848
+3  1456 1457 1179
+3  349 1457 850
+3  1458 1459 1012
+3  348 1459 852
+3  1460 1461 1184
+3  387 1461 854
+3  1462 1463 1015
+3  327 1463 856
+3  1464 1465 1189
+3  353 1465 858
+3  1466 1467 1018
+3  352 1467 860
+3  1468 1469 1193
+3  331 1469 862
+3  1470 1471 1021
+3  2202 1471 2214
+3  1472 1473 1196
+3  357 1473 864
+3  1474 1475 1024
+3  356 1475 866
+3  1476 1477 1201
+3  373 1477 868
+3  2319 2315 1027
+3  1478 1479 1204
+3  341 1479 870
+3  1480 1481 1030
+3  329 1481 872
+3  1482 1483 1208
+3  362 1483 874
+3  1484 1485 1031
+3  361 1485 876
+3  1486 1487 1212
+3  385 1487 878
+3  1488 1489 1034
+3  384 1489 880
+3  1490 1491 1216
+3  366 1491 882
+3  1492 1493 1037
+3  365 1493 884
+3  1494 1495 1220
+3  375 1495 886
+3  1496 1497 1040
+3  321 1497 888
+3  1498 1499 1225
+3  370 1499 890
+3  1500 1501 1043
+3  369 1501 892
+3  1502 1503 1229
+3  343 1503 894
+3  1504 1505 1046
+3  342 1505 896
+3  2305 163 2324
+3  2348 2305 1506
+3  132 131 2343
+3  1507 1508 1049
+3  358 1508 899
+3  1509 1510 1233
+3  984 1510 2124
+3  1511 1512 1052
+3  367 1512 901
+3  1513 1514 1236
+3  379 1514 903
+3  1515 1516 1055
+3  323 1516 905
+3  1517 1518 1240
+3  347 1518 907
+3  1519 1520 1058
+3  376 1520 909
+3  1521 1522 1245
+3  383 1522 911
+3  1523 1524 1061
+3  325 1524 913
+3  1525 1526 1250
+3  389 1526 915
+3  1527 1528 1064
+3  380 1528 917
+3  1529 1530 1254
+3  364 1530 919
+3  1531 1532 1067
+3  363 1532 921
+3  1533 1534 1258
+3  339 1534 923
+3  1535 1536 1070
+3  350 1536 925
+3  1537 1538 1262
+3  322 1538 927
+3  1539 1540 1073
+3  382 1540 929
+3  1541 1542 1266
+3  335 1542 931
+3  1470 1543 2214
+3  553 1543 933
+3  1359 1544 988
+3  1544 1545 2187
+3  1405 1546 802
+3  561 1546 936
+3  1361 1547 994
+3  495 1547 938
+3  1401 1548 798
+3  569 1548 939
+3  1365 1549 976
+3  498 1549 941
+3  1480 1550 872
+3  544 1550 942
+3  1369 1551 979
+3  487 1551 944
+3  1393 1552 790
+3  585 1552 945
+3  1373 1553 1010
+3  506 1553 947
+3  1535 1554 925
+3  593 1554 948
+3  1377 1555 1016
+3  510 1555 950
+3  1422 1556 816
+3  601 1556 951
+3  1381 1557 1022
+3  514 1557 953
+3  1507 1558 899
+3  608 1558 954
+3  1385 1559 1000
+3  518 1559 956
+3  1504 1560 896
+3  577 1560 957
+3  1389 1561 1004
+3  502 1561 959
+3  1531 1562 921
+3  616 1562 960
+3  2325 2326 1035
+3  2 0 2289
+3  1511 1563 901
+3  624 1563 962
+3  2318 1564 1041
+3  521 1564 2317
+3  1446 2290 840
+3  2313 69 68
+3  1458 1565 852
+3  589 1565 964
+3  1393 1566 945
+3  584 1566 966
+3  1430 1567 824
+3  668 1567 967
+3  1397 1568 1013
+3  663 1568 969
+3  1409 1569 806
+3  573 1569 970
+3  1401 1570 939
+3  568 1570 972
+3  1434 1571 828
+3  565 1571 973
+3  1405 1572 936
+3  560 1572 975
+3  1365 1573 764
+3  499 1573 976
+3  1409 1574 970
+3  572 1574 978
+3  1484 1575 876
+3  2309 1575 2308
+3  1369 1576 2248
+3  488 1576 979
+3  1416 2240 1028
+3  2240 981 2280
+3  2324 1577 1506
+3  524 1577 2298
+3  1418 2198 1025
+3  2198 2206 2270
+3  1474 1578 866
+3  604 1578 985
+3  1422 1579 951
+3  600 1579 987
+3  1359 1580 760
+3  492 1580 988
+3  1426 1581 1019
+3  556 1581 990
+3  1462 1582 856
+3  540 1582 991
+3  1430 1583 967
+3  667 1583 993
+3  1361 1584 762
+3  496 1584 994
+3  1434 1585 973
+3  564 1585 996
+3  1523 1586 913
+3  536 1586 997
+3  1438 1587 1032
+3  659 1587 999
+3  1385 1588 782
+3  519 1588 1000
+3  1442 1589 1047
+3  609 1589 1002
+3  1446 1590 2313
+3  631 1590 1003
+3  1389 1591 786
+3  503 1591 1004
+3  1450 1592 1044
+3  580 1592 1006
+3  1496 1593 888
+3  528 1593 1007
+3  1454 1594 1056
+3  643 1594 1009
+3  1373 1595 770
+3  507 1595 1010
+3  1458 1596 964
+3  588 1596 1012
+3  1397 1597 794
+3  664 1597 1013
+3  1462 1598 991
+3  539 1598 1015
+3  1377 1599 774
+3  511 1599 1016
+3  1466 1600 1068
+3  596 1600 1018
+3  1426 1601 820
+3  557 1601 1019
+3  1470 1602 933
+3  552 1602 1021
+3  1381 1603 778
+3  515 1603 1022
+3  1474 1604 985
+3  603 1604 1024
+3  1418 1605 812
+3  636 1605 1025
+3  2319 1606 2340
+3  633 1606 1027
+3  1416 1607 810
+3  547 1607 1028
+3  1480 1608 942
+3  543 1608 1030
+3  1484 2302 2308
+3  2345 2302 1031
+3  1438 1609 832
+3  660 1609 1032
+3  1488 1610 1059
+3  655 1610 1034
+3  2325 1611 2304
+3  520 1611 1035
+3  1492 1612 1065
+3  619 1612 1037
+3  1519 1613 909
+3  640 1613 1038
+3  1496 1614 1007
+3  527 1614 1040
+3  36 35 2318
+3  522 2316 1041
+3  1500 1615 1050
+3  627 1615 1043
+3  1450 1616 844
+3  581 1616 1044
+3  1504 1617 957
+3  576 1617 1046
+3  2303 144 2340
+3  2324 159 2298
+3  1442 1618 836
+3  610 1618 1047
+3  1507 1619 954
+3  607 1619 1049
+3  1500 1620 892
+3  628 1620 1050
+3  1511 1621 962
+3  623 1621 1052
+3  1527 1622 917
+3  648 1622 1053
+3  1515 1623 1071
+3  531 1623 1055
+3  1454 1624 848
+3  644 1624 1056
+3  1519 1625 1038
+3  639 1625 1058
+3  1488 1626 880
+3  656 1626 1059
+3  1523 1627 997
+3  535 1627 1061
+3  1539 1628 929
+3  652 1628 1062
+3  1527 1629 1053
+3  647 1629 1064
+3  1492 1630 884
+3  620 1630 1065
+3  1531 1631 960
+3  615 1631 1067
+3  1466 1632 860
+3  597 1632 1068
+3  1535 1633 948
+3  592 1633 1070
+3  1515 1634 905
+3  532 1634 1071
+3  1539 1635 1062
+3  651 1635 1073
+3  1363 2117 2148
+3  2152 2117 1074
+3  1357 485 1084
+3  485 1636 2275
+3  1296 1637 698
+3  398 1637 1077
+3  2014 1638 2140
+3  1367 1639 766
+3  491 1639 1079
+3  1371 1640 768
+3  494 1640 1081
+3  1363 1641 1074
+3  489 1641 1082
+3  392 2233 2137
+3  1269 1642 1147
+3  430 1642 1083
+3  1357 1643 758
+3  497 1643 1084
+3  1367 1644 1079
+3  490 1644 1085
+3  1302 1645 704
+3  394 1645 1086
+3  1271 1646 1156
+3  434 1646 1087
+3  1371 1647 1081
+3  493 1647 1088
+3  1306 1648 708
+3  396 1648 1089
+3  1273 1649 1164
+3  421 1649 1090
+3  1383 1650 780
+3  505 1650 1091
+3  1375 1651 1104
+3  516 1651 1093
+3  1310 1652 712
+3  408 1652 1094
+3  1275 1653 1172
+3  440 1653 1095
+3  1387 1654 784
+3  509 1654 1096
+3  1379 1655 1108
+3  500 1655 1097
+3  1314 1656 715
+3  400 1656 1098
+3  1277 1657 1180
+3  444 1657 1099
+3  1391 1658 788
+3  513 1658 1100
+3  1383 1659 1091
+3  504 1659 1101
+3  1318 1660 719
+3  402 1660 1102
+3  1279 1661 1190
+3  448 1661 1103
+3  1375 1662 772
+3  517 1662 1104
+3  1387 1663 1096
+3  508 1663 1105
+3  1322 1664 723
+3  404 1664 1106
+3  1281 1665 1197
+3  452 1665 1107
+3  1379 1666 776
+3  501 1666 1108
+3  1391 1667 1100
+3  512 1667 1109
+3  1326 1668 727
+3  406 1668 1110
+3  1283 1669 1205
+3  438 1669 1111
+3  1331 1670 2291
+3  410 1670 1112
+3  1285 1671 1217
+3  460 1671 1113
+3  1334 1672 734
+3  412 1672 1114
+3  1287 1673 1226
+3  2296 1673 2297
+3  1413 2211 1415
+3  2157 2211 2329
+3  2228 2339 1674
+3  2259 1675 2219
+3  1448 1676 842
+3  583 1676 1116
+3  1395 1677 1228
+3  625 1677 1117
+3  1341 1678 742
+3  463 1678 1118
+3  1288 1679 1241
+3  442 1679 1119
+3  1460 1680 854
+3  662 1680 1120
+3  1399 1681 1178
+3  641 1681 1122
+3  1345 1682 746
+3  472 1682 1123
+3  1290 1683 1251
+3  483 1683 1124
+3  1432 1684 826
+3  567 1684 1125
+3  1403 1685 1265
+3  649 1685 1126
+3  1349 1686 750
+3  476 1686 1127
+3  1292 1687 1259
+3  436 1687 1128
+3  1424 1688 818
+3  559 1688 1129
+3  1407 1689 1192
+3  594 1689 1130
+3  1353 1690 754
+3  447 1690 1131
+3  1294 1691 1267
+3  432 1691 1132
+3  1533 1692 923
+3  571 1692 1133
+3  1411 1693 1210
+3  611 1693 1134
+3  1298 1694 700
+3  457 1694 1135
+3  1296 1695 1077
+3  397 1695 1136
+3  1413 2288 2329
+3  2311 2288 1137
+3  425 545 2014
+3  1298 1696 1135
+3  456 1696 1138
+3  1476 1697 868
+3  635 1697 1139
+3  1509 2251 2124
+3  2160 2251 1141
+3  1420 550 1199
+3  550 1698 2271
+3  1300 1699 702
+3  451 1699 1142
+3  2137 1700 2266
+3  1464 1701 858
+3  599 1701 1144
+3  1424 1702 1129
+3  558 1702 1146
+3  1269 1703 669
+3  431 1703 1147
+3  1300 1704 1142
+3  450 1704 1148
+3  1468 1705 862
+3  555 1705 1149
+3  1428 1706 1187
+3  537 1706 1150
+3  1304 1707 706
+3  420 1707 1151
+3  1302 1708 1086
+3  393 1708 1152
+3  1525 1709 915
+3  666 1709 1153
+3  1432 1710 1125
+3  566 1710 1155
+3  1271 1711 671
+3  435 1711 1156
+3  1304 1712 1151
+3  419 1712 1157
+3  1541 1713 931
+3  563 1713 1158
+3  1436 1714 1248
+3  533 1714 1159
+3  1308 1715 710
+3  418 1715 1160
+3  1306 1716 1089
+3  395 1716 1161
+3  1486 1717 878
+3  658 1717 1162
+3  1440 1718 1207
+3  541 1718 1163
+3  1273 1719 673
+3  422 1719 1164
+3  1308 1720 1160
+3  417 1720 1165
+3  127 126 2341
+3  123 122 2342
+3  1444 1721 2295
+3  632 1721 1166
+3  1312 1722 714
+3  466 1722 1167
+3  1310 1723 1094
+3  407 1723 1168
+3  1498 1724 890
+3  630 1724 1169
+3  1448 1725 1116
+3  582 1725 1171
+3  1275 1726 675
+3  441 1726 1172
+3  1312 1727 1167
+3  465 1727 1173
+3  1502 1728 894
+3  579 1728 1174
+3  1452 1729 1223
+3  525 1729 1175
+3  1316 1730 717
+3  414 1730 1176
+3  1314 1731 1098
+3  399 1731 1177
+3  1399 1732 796
+3  642 1732 1178
+3  1456 1733 1261
+3  590 1733 1179
+3  1277 1734 677
+3  445 1734 1180
+3  1316 1735 1176
+3  413 1735 1181
+3  1517 1736 907
+3  587 1736 1182
+3  1460 1737 1120
+3  661 1737 1184
+3  1320 1738 721
+3  482 1738 1185
+3  1318 1739 1102
+3  401 1739 1186
+3  1428 1740 822
+3  538 1740 1187
+3  1464 1741 1144
+3  598 1741 1189
+3  1279 1742 679
+3  449 1742 1190
+3  1320 1743 1185
+3  481 1743 1191
+3  1407 1744 804
+3  595 1744 1192
+3  1468 1745 1149
+3  554 1745 1193
+3  1324 1746 725
+3  429 1746 1194
+3  1322 1747 1106
+3  403 1747 1195
+3  1472 1748 1232
+3  605 1748 1196
+3  1281 1749 681
+3  453 1749 1197
+3  1324 1750 1194
+3  428 1750 1198
+3  1420 1751 814
+3  602 1751 1199
+3  1476 1752 1139
+3  634 1752 1201
+3  1328 1753 729
+3  468 1753 1202
+3  1326 1754 1110
+3  405 1754 1203
+3  1478 1755 1230
+3  574 1755 1204
+3  1283 1756 683
+3  439 1756 1205
+3  1328 1757 1202
+3  467 1757 1206
+3  216 215 2347
+3  1440 1758 834
+3  542 1758 1207
+3  1482 1759 1257
+3  613 1759 1208
+3  220 219 2346
+3  423 2346 1209
+3  1411 1760 808
+3  612 1760 1210
+3  1486 1761 1162
+3  657 1761 1212
+3  1332 1762 732
+3  480 1762 1213
+3  1331 1763 1112
+3  409 1763 1214
+3  1521 1764 911
+3  654 1764 1215
+3  1490 1765 1235
+3  621 1765 1216
+3  1285 1766 686
+3  461 1766 1217
+3  1332 1767 1213
+3  479 1767 1218
+3  1529 1768 919
+3  618 1768 1219
+3  1494 1769 1243
+3  637 1769 1220
+3  1336 1770 736
+3  470 1770 1221
+3  1334 1771 1114
+3  411 1771 1222
+3  1452 1772 846
+3  526 1772 1223
+3  1498 1773 1169
+3  629 1773 1225
+3  1287 1774 688
+3  464 1774 1226
+3  1336 1775 1221
+3  469 1775 1227
+3  1395 1776 792
+3  626 1776 1228
+3  1502 1777 1174
+3  578 1777 1229
+3  2336 2334 738
+3  78 77 2334
+3  2338 62 61
+3  1478 1778 870
+3  575 1778 1230
+3  1444 2286 838
+3  107 106 2295
+3  2331 1779 2273
+3  1339 1780 740
+3  455 1780 1231
+3  1472 1781 864
+3  606 1781 1232
+3  1509 1782 1141
+3  549 1782 1233
+3  427 2191 2259
+3  1339 1783 1231
+3  454 1783 1234
+3  1490 1784 882
+3  622 1784 1235
+3  1513 1785 1253
+3  645 1785 1236
+3  1343 1786 744
+3  474 1786 1237
+3  1341 1787 1118
+3  462 1787 1238
+3  1537 1788 927
+3  530 1788 1239
+3  1517 1789 1182
+3  586 1789 1240
+3  1288 1790 690
+3  443 1790 1241
+3  1343 1791 1237
+3  473 1791 1242
+3  1494 1792 886
+3  638 1792 1243
+3  1521 1793 1215
+3  653 1793 1245
+3  1347 1794 748
+3  478 1794 1246
+3  1345 1795 1123
+3  471 1795 1247
+3  1436 1796 830
+3  534 1796 1248
+3  1525 1797 1153
+3  665 1797 1250
+3  1290 1798 692
+3  484 1798 1251
+3  1347 1799 1246
+3  477 1799 1252
+3  1513 1800 903
+3  646 1800 1253
+3  1529 1801 1219
+3  617 1801 1254
+3  1351 1802 752
+3  459 1802 1255
+3  1349 1803 1127
+3  475 1803 1256
+3  1482 1804 874
+3  614 1804 1257
+3  1533 1805 1133
+3  570 1805 1258
+3  1292 1806 694
+3  437 1806 1259
+3  1351 1807 1255
+3  458 1807 1260
+3  1456 1808 850
+3  591 1808 1261
+3  1537 1809 1239
+3  529 1809 1262
+3  1355 1810 756
+3  416 1810 1263
+3  1353 1811 1131
+3  446 1811 1264
+3  1403 1812 800
+3  650 1812 1265
+3  1541 1813 1158
+3  562 1813 1266
+3  1294 1814 696
+3  433 1814 1267
+3  1355 1815 1263
+3  415 1815 1268
+3  1816 1817 819
+3  274 1817 670
+3  1302 1152 1708
+3  274 1152 1303
+3  1818 1819 827
+3  276 1819 672
+3  1306 1161 1716
+3  276 1161 1307
+3  1820 1821 835
+3  271 1821 674
+3  1296 1136 1695
+3  271 1136 1297
+3  1822 1823 843
+3  280 1823 676
+3  1314 1177 1731
+3  280 1177 1315
+3  1824 1825 851
+3  282 1825 678
+3  1318 1186 1739
+3  282 1186 1319
+3  1826 1827 859
+3  284 1827 680
+3  1322 1195 1747
+3  284 1195 1323
+3  1828 1829 865
+3  286 1829 682
+3  1326 1203 1754
+3  286 1203 1327
+3  1830 1831 871
+3  278 1831 684
+3  1310 1168 1723
+3  278 1168 1311
+3  1832 1833 875
+3  289 1833 685
+3  1331 1214 1763
+3  289 1214 2292
+3  1834 1835 883
+3  291 1835 687
+3  1334 1222 1771
+3  291 1222 1335
+3  1836 1837 891
+3  293 1837 689
+3  293 2293 2299
+3  1838 1839 908
+3  281 1839 691
+3  1316 1181 1735
+3  281 1181 1317
+3  1840 1841 916
+3  303 1841 693
+3  1355 1268 1815
+3  303 1268 1356
+3  1842 1843 924
+3  277 1843 695
+3  1308 1165 1720
+3  277 1165 1309
+3  1844 1845 932
+3  275 1845 697
+3  1304 1157 1712
+3  275 1157 1305
+3  1846 1847 759
+3  260 1847 699
+3  1273 1090 1649
+3  260 1090 1274
+3  1848 1849 809
+3  288 1849 701
+3  2347 1209 2346
+3  288 1209 1330
+3  1850 1851 815
+3  285 1851 703
+3  1324 1198 1750
+3  285 1198 1325
+3  1852 1853 767
+3  258 1853 705
+3  1269 1083 1642
+3  258 1083 1270
+3  1854 1855 823
+3  270 1855 707
+3  1294 1132 1691
+3  270 1132 1295
+3  1856 1857 769
+3  259 1857 709
+3  1271 1087 1646
+3  259 1087 1272
+3  1858 1859 831
+3  269 1859 711
+3  1292 1128 1687
+3  269 1128 1293
+3  1860 1861 773
+3  265 1861 713
+3  1283 1111 1669
+3  265 1111 1284
+3  2337 1862 839
+3  294 1862 2333
+3  85 84 2336
+3  294 2287 1338
+3  1863 1864 777
+3  261 1864 716
+3  1275 1095 1653
+3  261 1095 1276
+3  1865 1866 847
+3  267 1866 718
+3  1288 1119 1679
+3  267 1119 1289
+3  1867 1868 781
+3  262 1868 720
+3  1277 1099 1657
+3  262 1099 1278
+3  1869 1870 855
+3  302 1870 722
+3  1353 1264 1811
+3  302 1264 1354
+3  1871 1872 785
+3  263 1872 724
+3  1279 1103 1661
+3  263 1103 1280
+3  1873 1874 863
+3  273 1874 726
+3  1300 1148 1704
+3  273 1148 1301
+3  1875 1876 789
+3  264 1876 728
+3  1281 1107 1665
+3  264 1107 1282
+3  1877 1878 869
+3  295 1878 730
+3  1339 1234 1783
+3  295 1234 1340
+3  2349 208 2350
+3  272 2349 731
+3  1298 1138 1696
+3  272 1138 1299
+3  1879 1880 879
+3  301 1880 733
+3  1351 1260 1807
+3  301 1260 1352
+3  2301 1881 2320
+3  266 1881 735
+3  1285 1113 1671
+3  266 1113 1286
+3  1882 1883 887
+3  296 1883 737
+3  1341 1238 1787
+3  296 1238 1342
+3  1287 2297 1673
+3  48 47 2297
+3  1884 1885 895
+3  279 1885 739
+3  1312 1173 1727
+3  279 1173 1313
+3  1886 1887 898
+3  287 1887 741
+3  1328 1206 1757
+3  287 1206 1329
+3  1888 1889 793
+3  292 1889 743
+3  1336 1227 1775
+3  292 1227 1337
+3  1890 1891 904
+3  298 1891 745
+3  1345 1247 1795
+3  298 1247 1346
+3  1892 1893 797
+3  297 1893 747
+3  1343 1242 1791
+3  297 1242 1344
+3  1894 1895 912
+3  300 1895 749
+3  1349 1256 1803
+3  300 1256 1350
+3  1896 1897 801
+3  299 1897 751
+3  1347 1252 1799
+3  299 1252 1348
+3  1898 1899 920
+3  290 1899 753
+3  1332 1218 1767
+3  290 1218 1333
+3  1900 1901 805
+3  283 1901 755
+3  1320 1191 1743
+3  283 1191 1321
+3  1902 1903 928
+3  268 1903 757
+3  1290 1124 1683
+3  268 1124 1291
+3  1846 1904 765
+3  308 1904 759
+3  1369 944 1551
+3  308 944 1370
+3  1852 1905 705
+3  305 1905 761
+3  1363 1082 1641
+3  305 1082 1364
+3  1856 1906 709
+3  307 1906 763
+3  1367 1085 1644
+3  307 1085 1368
+3  1359 1907 1544
+3  1908 1907 1360
+3  1846 1909 699
+3  309 1909 765
+3  1371 1088 1647
+3  309 1088 1372
+3  1852 1910 761
+3  304 1910 767
+3  1361 938 1547
+3  304 938 1362
+3  1357 2127 485
+3  2244 2127 1358
+3  1856 1911 763
+3  306 1911 769
+3  1365 941 1549
+3  306 941 1366
+3  1867 1912 720
+3  313 1912 771
+3  1379 1097 1655
+3  313 1097 1380
+3  1860 1913 783
+3  318 1913 773
+3  1389 959 1561
+3  318 959 1390
+3  1871 1914 724
+3  315 1914 775
+3  1383 1101 1659
+3  315 1101 1384
+3  1863 1915 787
+3  310 1915 777
+3  1373 947 1553
+3  310 947 1374
+3  1875 1916 728
+3  317 1916 779
+3  1387 1105 1663
+3  317 1105 1388
+3  1867 1917 771
+3  312 1917 781
+3  1377 950 1555
+3  312 950 1378
+3  1860 1918 713
+3  319 1918 783
+3  1391 1109 1667
+3  319 1109 1392
+3  1871 1919 775
+3  314 1919 785
+3  1381 953 1557
+3  314 953 1382
+3  1863 1920 716
+3  311 1920 787
+3  1375 1093 1651
+3  311 1093 1376
+3  1875 1921 779
+3  316 1921 789
+3  1385 956 1559
+3  316 956 1386
+3  2301 2322 735
+3  2325 7 6
+3  2318 2317 1564
+3  1822 1922 676
+3  346 1922 791
+3  1452 1175 1729
+3  346 1175 1453
+3  1888 1923 893
+3  368 1923 793
+3  1496 1040 1614
+3  368 1040 1497
+3  1869 1924 722
+3  388 1924 795
+3  1537 1262 1809
+3  388 1262 1538
+3  1892 1925 849
+3  377 1925 797
+3  1515 1055 1623
+3  377 1055 1516
+3  1818 1926 672
+3  338 1926 799
+3  1436 1159 1714
+3  338 1159 1437
+3  1896 1927 930
+3  381 1927 801
+3  1523 1061 1627
+3  381 1061 1524
+3  1816 1928 670
+3  334 1928 803
+3  1428 1150 1706
+3  334 1150 1429
+3  1900 1929 861
+3  351 1929 805
+3  1462 1015 1598
+3  351 1015 1463
+3  1842 1930 695
+3  340 1930 807
+3  1440 1163 1718
+3  340 1163 1441
+3  1848 1931 877
+3  360 1931 809
+3  1480 1030 1608
+3  360 1030 1481
+3  1416 981 2240
+3  1932 981 1417
+3  2350 1933 731
+3  330 1933 811
+3  1413 1137 2288
+3  330 1137 1414
+3  1877 1934 730
+3  374 1934 813
+3  1509 1233 1782
+3  374 1233 1510
+3  1850 1935 867
+3  355 1935 815
+3  1470 1021 1602
+3  355 1021 1471
+3  1826 1936 680
+3  354 1936 817
+3  1468 1193 1745
+3  354 1193 1469
+3  1816 1937 803
+3  333 1937 819
+3  1426 990 1581
+3  333 990 1427
+3  1873 1938 726
+3  332 1938 821
+3  1424 1146 1702
+3  332 1146 1425
+3  1854 1939 857
+3  326 1939 823
+3  1405 975 1572
+3  326 975 1406
+3  1840 1940 693
+3  390 1940 825
+3  1541 1266 1813
+3  390 1266 1542
+3  1818 1941 799
+3  337 1941 827
+3  1434 996 1585
+3  337 996 1435
+3  1844 1942 697
+3  336 1942 829
+3  1432 1155 1710
+3  336 1155 1433
+3  1858 1943 914
+3  324 1943 831
+3  1401 972 1570
+3  324 972 1402
+3  1879 1944 733
+3  386 1944 833
+3  1533 1258 1805
+3  386 1258 1534
+3  1820 1945 873
+3  328 1945 835
+3  1409 978 1574
+3  328 978 1410
+3  1886 1946 741
+3  359 1946 837
+3  1478 1204 1755
+3  359 1204 1479
+3  2337 1947 2314
+3  372 1947 839
+3  1504 1046 1617
+3  372 1046 1505
+3  1836 1948 689
+3  371 1948 841
+3  1502 1229 1777
+3  371 1229 1503
+3  1822 1949 791
+3  345 1949 843
+3  1450 1006 1592
+3  345 1006 1451
+3  1884 1950 739
+3  344 1950 845
+3  1448 1171 1725
+3  344 1171 1449
+3  1865 1951 889
+3  320 1951 847
+3  1393 966 1566
+3  320 966 1394
+3  1892 1952 747
+3  378 1952 849
+3  1517 1240 1789
+3  378 1240 1518
+3  1824 1953 926
+3  349 1953 851
+3  1458 1012 1596
+3  349 1012 1459
+3  1838 1954 691
+3  348 1954 853
+3  1456 1179 1733
+3  348 1179 1457
+3  1869 1955 795
+3  387 1955 855
+3  1535 1070 1633
+3  387 1070 1536
+3  1854 1956 707
+3  327 1956 857
+3  1407 1130 1689
+3  327 1130 1408
+3  1826 1957 817
+3  353 1957 859
+3  1466 1018 1600
+3  353 1018 1467
+3  1900 1958 755
+3  352 1958 861
+3  1464 1189 1741
+3  352 1189 1465
+3  1873 1959 821
+3  331 1959 863
+3  1422 987 1579
+3  331 987 1423
+3  1420 2130 550
+3  2202 2130 1421
+3  1828 1960 900
+3  357 1960 865
+3  1474 1024 1604
+3  357 1024 1475
+3  1850 1961 703
+3  356 1961 867
+3  1472 1196 1748
+3  356 1196 1473
+3  1877 1962 813
+3  373 1962 869
+3  1507 1049 1619
+3  373 1049 1508
+3  1830 1963 897
+3  341 1963 871
+3  1442 1002 1589
+3  341 1002 1443
+3  2350 2310 811
+3  1820 1964 674
+3  329 1964 873
+3  1411 1134 1693
+3  329 1134 1412
+3  1832 1965 922
+3  362 1965 875
+3  1484 1031 2302
+3  362 1031 1485
+3  1848 1966 701
+3  361 1966 877
+3  1482 1208 1759
+3  361 1208 1483
+3  1879 1967 833
+3  385 1967 879
+3  1531 1067 1631
+3  385 1067 1532
+3  1894 1968 749
+3  384 1968 881
+3  1529 1254 1801
+3  384 1254 1530
+3  1834 1969 902
+3  366 1969 883
+3  1492 1037 1612
+3  366 1037 1493
+3  1898 1970 753
+3  365 1970 885
+3  1490 1216 1765
+3  365 1216 1491
+3  1882 1971 910
+3  375 1971 887
+3  1511 1052 1621
+3  375 1052 1512
+3  1865 1972 718
+3  321 1972 889
+3  1395 1117 1677
+3  321 1117 1396
+3  1836 1973 841
+3  370 1973 891
+3  1500 1043 1615
+3  370 1043 1501
+3  1888 1974 743
+3  369 1974 893
+3  1498 1225 1773
+3  369 1225 1499
+3  1884 1975 845
+3  343 1975 895
+3  1446 1003 1590
+3  343 1003 1447
+3  1830 1976 684
+3  342 1976 897
+3  1444 1166 1721
+3  342 1166 1445
+3  93 92 2337
+3  174 173 2339
+3  169 168 2348
+3  1886 1977 837
+3  2343 1977 898
+3  2319 1027 1606
+3  2343 1027 2315
+3  1828 1978 682
+3  358 1978 900
+3  1476 1201 1752
+3  358 1201 1477
+3  1418 2206 2198
+3  984 2206 1419
+3  1834 1979 687
+3  367 1979 902
+3  1494 1220 1769
+3  367 1220 1495
+3  1890 1980 918
+3  379 1980 904
+3  1519 1058 1625
+3  379 1058 1520
+3  1902 1981 757
+3  323 1981 906
+3  1399 1122 1681
+3  323 1122 1400
+3  1838 1982 853
+3  347 1982 908
+3  1454 1009 1594
+3  347 1009 1455
+3  1882 1983 737
+3  376 1983 910
+3  1513 1236 1785
+3  376 1236 1514
+3  1894 1984 881
+3  383 1984 912
+3  1527 1064 1629
+3  383 1064 1528
+3  1858 1985 711
+3  325 1985 914
+3  1403 1126 1685
+3  325 1126 1404
+3  1840 1986 825
+3  389 1986 916
+3  1539 1073 1635
+3  389 1073 1540
+3  1890 1987 745
+3  380 1987 918
+3  1521 1245 1793
+3  380 1245 1522
+3  1898 1988 885
+3  364 1988 920
+3  1488 1034 1610
+3  364 1034 1489
+3  1832 1989 685
+3  363 1989 922
+3  1486 1212 1761
+3  363 1212 1487
+3  1842 1990 807
+3  339 1990 924
+3  1438 999 1587
+3  339 999 1439
+3  1824 1991 678
+3  350 1991 926
+3  1460 1184 1737
+3  350 1184 1461
+3  1902 1992 906
+3  322 1992 928
+3  1397 969 1568
+3  322 969 1398
+3  1896 1993 751
+3  382 1993 930
+3  1525 1250 1797
+3  382 1250 1526
+3  1844 1994 829
+3  335 1994 932
+3  1430 993 1583
+3  335 993 1431
+3  2019 1995 1020
+3  553 1995 934
+3  2137 2233 2139
+3  553 2137 2177
+3  2023 1996 974
+3  561 1996 937
+3  1302 1086 1645
+3  561 1086 1708
+3  1852 767 1910
+3  495 767 1853
+3  1302 704 1303
+3  495 704 1645
+3  2010 1997 971
+3  569 1997 940
+3  1306 1089 1648
+3  569 1089 1716
+3  1856 769 1911
+3  498 769 1857
+3  1306 708 1307
+3  498 708 1648
+3  2012 1998 1029
+3  544 1998 943
+3  1296 1077 1637
+3  544 1077 1695
+3  1846 759 1904
+3  487 759 1847
+3  1296 698 1297
+3  487 698 1637
+3  2033 1999 965
+3  585 1999 946
+3  1314 1098 1656
+3  585 1098 1731
+3  1863 777 1915
+3  506 777 1864
+3  1314 715 1315
+3  506 715 1656
+3  2036 2000 1069
+3  593 2000 949
+3  1318 1102 1660
+3  593 1102 1739
+3  1867 781 1917
+3  510 781 1868
+3  1318 719 1319
+3  510 719 1660
+3  2039 2001 986
+3  601 2001 952
+3  1322 1106 1664
+3  601 1106 1747
+3  1871 785 1919
+3  514 785 1872
+3  1322 723 1323
+3  514 723 1664
+3  2027 2002 1048
+3  608 2002 955
+3  1326 1110 1668
+3  608 1110 1754
+3  1875 789 1921
+3  518 789 1876
+3  1326 727 1327
+3  518 727 1668
+3  2029 2003 1045
+3  577 2003 958
+3  1310 1094 1652
+3  577 1094 1723
+3  1860 773 1913
+3  502 773 1861
+3  1310 712 1311
+3  502 712 1652
+3  2044 2004 1066
+3  616 2004 961
+3  1331 1112 1670
+3  616 1112 1763
+3  1331 2291 2292
+3  2289 2291 1670
+3  2047 2005 1051
+3  624 2005 963
+3  1334 1114 1672
+3  624 1114 1771
+3  521 2320 1881
+3  1334 734 1335
+3  521 734 1672
+3  2033 2006 1011
+3  589 2006 965
+3  1316 1176 1730
+3  589 1176 1735
+3  1865 847 1951
+3  584 847 1866
+3  1316 717 1317
+3  584 717 1730
+3  2021 2007 992
+3  668 2007 968
+3  1355 1263 1810
+3  668 1263 1815
+3  1902 928 1992
+3  663 928 1903
+3  1355 756 1356
+3  663 756 1810
+3  2010 2008 977
+3  573 2008 971
+3  1308 1160 1715
+3  573 1160 1720
+3  1858 831 1943
+3  568 831 1859
+3  1308 710 1309
+3  568 710 1715
+3  2023 2009 995
+3  565 2009 974
+3  1304 1151 1707
+3  565 1151 1712
+3  1854 823 1939
+3  560 823 1855
+3  1304 706 1305
+3  560 706 1707
+3  2010 2011 940
+3  499 2011 977
+3  1273 1164 1719
+3  499 1164 1649
+3  1820 835 1945
+3  572 835 1821
+3  1273 673 1274
+3  572 673 1719
+3  2309 223 2346
+3  206 205 2350
+3  2347 2306 1330
+3  2012 2013 943
+3  488 2013 980
+3  2014 2015 2114
+3  488 2014 2222
+3  2016 2017 2321
+3  524 2017 983
+3  2259 2191 2260
+3  524 2259 2264
+3  2039 2018 1023
+3  604 2018 986
+3  1324 1194 1746
+3  604 1194 1750
+3  1873 863 1959
+3  600 863 1874
+3  1324 725 1325
+3  600 725 1746
+3  2019 2020 934
+3  492 2020 989
+3  1269 1147 1703
+3  492 1147 1642
+3  1816 819 1937
+3  556 819 1817
+3  1269 669 1270
+3  556 669 1703
+3  2021 2022 1014
+3  540 2022 992
+3  1294 1267 1814
+3  540 1267 1691
+3  1844 932 1994
+3  667 932 1845
+3  1294 696 1295
+3  667 696 1814
+3  2023 2024 937
+3  496 2024 995
+3  1271 1156 1711
+3  496 1156 1646
+3  1818 827 1941
+3  564 827 1819
+3  1271 671 1272
+3  564 671 1711
+3  2025 2026 1060
+3  536 2026 998
+3  1292 1259 1806
+3  536 1259 1687
+3  1842 924 1990
+3  659 924 1843
+3  1292 694 1293
+3  659 694 1806
+3  2027 2028 955
+3  519 2028 1001
+3  1283 1205 1756
+3  519 1205 1669
+3  1830 871 1963
+3  609 871 1831
+3  1283 683 1284
+3  609 683 1756
+3  2336 81 2334
+3  1884 895 1975
+3  631 895 1885
+3  2336 738 1338
+3  631 738 2334
+3  2029 2030 958
+3  503 2030 1005
+3  1275 1172 1726
+3  503 1172 1653
+3  1822 843 1949
+3  580 843 1823
+3  1275 675 1276
+3  580 675 1726
+3  2031 2032 1039
+3  528 2032 1008
+3  1288 1241 1790
+3  528 1241 1679
+3  1838 908 1982
+3  643 908 1839
+3  1288 690 1289
+3  643 690 1790
+3  2033 2034 946
+3  507 2034 1011
+3  1277 1180 1734
+3  507 1180 1657
+3  1824 851 1953
+3  588 851 1825
+3  1277 677 1278
+3  588 677 1734
+3  2021 2035 968
+3  664 2035 1014
+3  1353 1131 1690
+3  664 1131 1811
+3  1900 805 1929
+3  539 805 1901
+3  1353 754 1354
+3  539 754 1690
+3  2036 2037 949
+3  511 2037 1017
+3  1279 1190 1742
+3  511 1190 1661
+3  1826 859 1957
+3  596 859 1827
+3  1279 679 1280
+3  596 679 1742
+3  2019 2038 989
+3  557 2038 1020
+3  1300 1142 1699
+3  557 1142 1704
+3  1850 815 1935
+3  552 815 1851
+3  1300 702 1301
+3  552 702 1699
+3  2039 2040 952
+3  515 2040 1023
+3  1281 1197 1749
+3  515 1197 1665
+3  1828 865 1960
+3  603 865 1829
+3  1281 681 1282
+3  603 681 1749
+3  2016 2041 983
+3  636 2041 1026
+3  1339 1231 1780
+3  636 1231 1783
+3  1886 898 1977
+3  633 898 1887
+3  1339 740 1340
+3  633 740 1780
+3  2012 2042 980
+3  547 2042 1029
+3  1298 1135 1694
+3  547 1135 1696
+3  1848 809 1931
+3  543 809 1849
+3  1298 700 1299
+3  543 700 1694
+3  1832 875 1965
+3  2345 875 1833
+3  2327 245 244
+3  2328 239 2345
+3  2025 2043 998
+3  660 2043 1033
+3  1351 1255 1802
+3  660 1255 1807
+3  1898 920 1988
+3  655 920 1899
+3  1351 752 1352
+3  655 752 1802
+3  2044 2045 961
+3  520 2045 1036
+3  1285 1217 1766
+3  520 1217 1671
+3  1834 883 1969
+3  619 883 1835
+3  1285 686 1286
+3  619 686 1766
+3  2031 2046 1057
+3  640 2046 1039
+3  1341 1118 1678
+3  640 1118 1787
+3  1888 793 1923
+3  527 793 1889
+3  1341 742 1342
+3  527 742 1678
+3  2047 2048 963
+3  522 2048 1042
+3  1287 1226 1774
+3  522 1226 1673
+3  1836 891 1973
+3  627 891 1837
+3  1287 688 2300
+3  627 688 1774
+3  2029 2049 1005
+3  581 2049 1045
+3  1312 1167 1722
+3  581 1167 1727
+3  2337 839 1947
+3  576 839 1862
+3  1312 714 1313
+3  576 714 1722
+3  2016 2050 1026
+3  2303 2050 2321
+3  2027 2051 1001
+3  610 2051 1048
+3  1328 1202 1753
+3  610 1202 1757
+3  1877 869 1962
+3  607 869 1878
+3  1328 729 1329
+3  607 729 1753
+3  2047 2052 1042
+3  628 2052 1051
+3  1336 1221 1770
+3  628 1221 1775
+3  1882 887 1971
+3  623 887 1883
+3  1336 736 1337
+3  623 736 1770
+3  2059 2053 1063
+3  648 2053 1054
+3  1345 1123 1682
+3  648 1123 1795
+3  1892 797 1925
+3  531 797 1893
+3  1345 746 1346
+3  531 746 1682
+3  2031 2054 1008
+3  644 2054 1057
+3  1343 1237 1786
+3  644 1237 1791
+3  1890 904 1980
+3  639 904 1891
+3  1343 744 1344
+3  639 744 1786
+3  2025 2055 1033
+3  656 2055 1060
+3  1349 1127 1686
+3  656 1127 1803
+3  1896 801 1927
+3  535 801 1897
+3  1349 750 1350
+3  535 750 1686
+3  2059 2056 1072
+3  652 2056 1063
+3  1347 1246 1794
+3  652 1246 1799
+3  1894 912 1984
+3  647 912 1895
+3  1347 748 1348
+3  647 748 1794
+3  2044 2057 1036
+3  620 2057 1066
+3  1332 1213 1762
+3  620 1213 1767
+3  1879 879 1967
+3  615 879 1880
+3  1332 732 1333
+3  615 732 1762
+3  2036 2058 1017
+3  597 2058 1069
+3  1320 1185 1738
+3  597 1185 1743
+3  1869 855 1955
+3  592 855 1870
+3  1320 721 1321
+3  592 721 1738
+3  2059 2060 1054
+3  532 2060 1072
+3  1290 1251 1798
+3  532 1251 1683
+3  1840 916 1986
+3  651 916 1841
+3  1290 692 1291
+3  651 692 1798
+3  2061 2062 2064
+3  2152 2062 1075
+3  2152 2180 2146
+3  2012 943 1998
+3  398 943 2013
+3  1369 979 1576
+3  398 979 1551
+3  1369 2248 1370
+3  1576 2063 2249
+3  2061 2064 2066
+3  491 2064 2062
+3  1363 1074 2117
+3  491 1074 1641
+3  1363 2148 1364
+3  2148 2065 2277
+3  2061 2066 2067
+3  494 2066 2064
+3  1367 1079 1639
+3  494 1079 1644
+3  1852 761 1905
+3  489 761 1910
+3  1367 766 1368
+3  489 766 1639
+3  2019 934 1995
+3  392 934 2020
+3  1359 988 1580
+3  392 988 1544
+3  1852 705 1853
+3  430 705 1905
+3  1359 760 1360
+3  430 760 1580
+3  2061 2067 1075
+3  497 2067 2066
+3  1371 1081 1640
+3  497 1081 1647
+3  1856 763 1906
+3  490 763 1911
+3  1371 768 1372
+3  490 768 1640
+3  2023 937 1996
+3  394 937 2024
+3  1361 994 1584
+3  394 994 1547
+3  1856 709 1857
+3  434 709 1906
+3  1361 762 1362
+3  434 762 1584
+3  2061 1075 2062
+3  2238 1075 2067
+3  1357 1084 1643
+3  2238 1084 485
+3  1846 765 1909
+3  493 765 1904
+3  1357 758 1358
+3  493 758 1643
+3  2010 940 1997
+3  396 940 2011
+3  1365 976 1573
+3  396 976 1549
+3  1846 699 1847
+3  421 699 1909
+3  1365 764 1366
+3  421 764 1573
+3  2068 2069 2070
+3  505 2069 1092
+3  1379 1108 1666
+3  505 1108 1655
+3  1863 787 1920
+3  516 787 1915
+3  1379 776 1380
+3  516 776 1666
+3  2029 958 2003
+3  408 958 2030
+3  1389 1004 1591
+3  408 1004 1561
+3  1863 716 1864
+3  440 716 1920
+3  1389 786 1390
+3  440 786 1591
+3  2068 2070 2071
+3  509 2070 2069
+3  1383 1091 1650
+3  509 1091 1659
+3  1867 771 1912
+3  500 771 1917
+3  1383 780 1384
+3  500 780 1650
+3  2033 946 1999
+3  400 946 2034
+3  1373 1010 1595
+3  400 1010 1553
+3  1867 720 1868
+3  444 720 1912
+3  1373 770 1374
+3  444 770 1595
+3  2068 2071 2072
+3  513 2071 2070
+3  1387 1096 1654
+3  513 1096 1663
+3  1871 775 1914
+3  504 775 1919
+3  1387 784 1388
+3  504 784 1654
+3  2036 949 2000
+3  402 949 2037
+3  1377 1016 1599
+3  402 1016 1555
+3  1871 724 1872
+3  448 724 1914
+3  1377 774 1378
+3  448 774 1599
+3  2068 2072 1092
+3  517 2072 2071
+3  1391 1100 1658
+3  517 1100 1667
+3  1875 779 1916
+3  508 779 1921
+3  1391 788 1392
+3  508 788 1658
+3  2039 952 2001
+3  404 952 2040
+3  1381 1022 1603
+3  404 1022 1557
+3  1875 728 1876
+3  452 728 1916
+3  1381 778 1382
+3  452 778 1603
+3  2068 1092 2069
+3  501 1092 2072
+3  1375 1104 1662
+3  501 1104 1651
+3  1860 783 1918
+3  512 783 1913
+3  1375 772 1376
+3  512 772 1662
+3  2027 955 2002
+3  406 955 2028
+3  1385 1000 1588
+3  406 1000 1559
+3  1860 713 1861
+3  438 713 1918
+3  1385 782 1386
+3  438 782 1588
+3  19 18 2322
+3  2044 961 2004
+3  410 961 2045
+3  2325 1035 1611
+3  410 1035 2326
+3  2301 735 1881
+3  460 735 2322
+3  10 9 2325
+3  460 2304 1611
+3  2047 963 2005
+3  412 963 2048
+3  2318 1041 2316
+3  412 1041 1564
+3  2296 41 40
+3  2157 2307 2330
+3  2157 2143 2133
+3  2016 2321 2050
+3  2323 2321 2017
+3  2324 2298 1577
+3  157 156 2298
+3  2324 1506 2305
+3  2109 1577 2073
+3  2100 2074 1170
+3  583 2074 2101
+3  1452 1223 1772
+3  583 1223 1729
+3  1865 889 1972
+3  625 889 1951
+3  1452 846 1453
+3  625 846 1772
+3  2031 1039 2046
+3  463 1039 2032
+3  1496 1007 1593
+3  463 1007 1614
+3  1865 718 1866
+3  442 718 1972
+3  1496 888 1497
+3  442 888 1593
+3  2088 2075 1183
+3  662 2075 1121
+3  1537 1239 1788
+3  662 1239 1809
+3  1902 906 1981
+3  641 906 1992
+3  1537 927 1538
+3  641 927 1788
+3  2059 1054 2053
+3  472 1054 2060
+3  1515 1071 1634
+3  472 1071 1623
+3  1902 757 1903
+3  483 757 1981
+3  1515 905 1516
+3  483 905 1634
+3  2105 2076 1154
+3  567 2076 2106
+3  1436 1248 1796
+3  567 1248 1714
+3  1858 914 1985
+3  649 914 1943
+3  1436 830 1437
+3  649 830 1796
+3  2025 1060 2055
+3  476 1060 2026
+3  1523 997 1586
+3  476 997 1627
+3  1858 711 1859
+3  436 711 1985
+3  1523 913 1524
+3  436 913 1586
+3  2090 2077 1145
+3  559 2077 2091
+3  1428 1187 1740
+3  559 1187 1706
+3  1854 857 1956
+3  594 857 1939
+3  1428 822 1429
+3  594 822 1740
+3  2021 1014 2035
+3  447 1014 2022
+3  1462 991 1582
+3  447 991 1598
+3  1854 707 1855
+3  432 707 1956
+3  1462 856 1463
+3  432 856 1582
+3  2096 2078 2085
+3  571 2078 2095
+3  1440 1207 1758
+3  571 1207 1718
+3  1820 873 1964
+3  611 873 1945
+3  1440 834 1441
+3  611 834 1758
+3  2012 1029 2042
+3  457 1029 1998
+3  1480 942 1550
+3  457 942 1608
+3  1820 674 1821
+3  397 674 1964
+3  1480 872 1481
+3  397 872 1550
+3  2350 811 1933
+3  2311 811 2310
+3  2012 980 2013
+3  425 980 2042
+3  1416 1028 1607
+3  425 1028 2240
+3  2350 731 2349
+3  456 731 1933
+3  1416 810 1417
+3  456 810 1607
+3  1413 2329 2211
+3  193 192 2329
+3  1413 1415 1414
+3  2093 2079 1200
+3  635 2079 2080
+3  1509 1141 2251
+3  635 1141 1782
+3  1509 2124 1510
+3  2093 2080 2079
+3  2160 2080 2092
+3  2160 2081 2161
+3  2019 1020 2038
+3  451 1020 1995
+3  1470 933 1543
+3  451 933 1602
+3  1470 2214 1471
+3  2213 1543 2082
+3  2090 2083 1188
+3  599 2083 1145
+3  1468 1149 1705
+3  599 1149 1745
+3  1873 821 1938
+3  558 821 1959
+3  1468 862 1469
+3  558 862 1705
+3  2019 989 2020
+3  431 989 2038
+3  1426 1019 1601
+3  431 1019 1581
+3  1873 726 1874
+3  450 726 1938
+3  1426 820 1427
+3  450 820 1601
+3  2090 1145 2083
+3  555 1145 2077
+3  1424 1129 1688
+3  555 1129 1702
+3  1816 803 1928
+3  537 803 1937
+3  1424 818 1425
+3  537 818 1688
+3  2023 974 2009
+3  420 974 1996
+3  1405 936 1546
+3  420 936 1572
+3  1816 670 1817
+3  393 670 1928
+3  1405 802 1406
+3  393 802 1546
+3  2105 2084 1249
+3  666 2084 1154
+3  1541 1158 1713
+3  666 1158 1813
+3  1844 829 1942
+3  566 829 1994
+3  1541 931 1542
+3  566 931 1713
+3  2023 995 2024
+3  435 995 2009
+3  1434 973 1571
+3  435 973 1585
+3  1844 697 1845
+3  419 697 1942
+3  1434 828 1435
+3  419 828 1571
+3  2105 1154 2084
+3  563 1154 2076
+3  1432 1125 1684
+3  563 1125 1710
+3  1818 799 1926
+3  533 799 1941
+3  1432 826 1433
+3  533 826 1684
+3  2010 971 2008
+3  418 971 1997
+3  1401 939 1548
+3  418 939 1570
+3  1818 672 1819
+3  395 672 1926
+3  1401 798 1402
+3  395 798 1548
+3  2096 2085 1211
+3  658 2085 2078
+3  1533 1133 1692
+3  658 1133 1805
+3  1842 807 1930
+3  541 807 1990
+3  1533 923 1534
+3  541 923 1692
+3  2010 977 2011
+3  422 977 2008
+3  1409 970 1569
+3  422 970 1574
+3  1842 695 1843
+3  417 695 1930
+3  1409 806 1410
+3  417 806 1569
+3  2335 120 119
+3  1478 1230 1778
+3  2335 1230 1755
+3  1830 897 1976
+3  632 897 1963
+3  1478 870 1479
+3  632 870 1778
+3  2029 1045 2049
+3  466 1045 2003
+3  1504 957 1560
+3  466 957 1617
+3  1830 684 1831
+3  407 684 1976
+3  1504 896 1505
+3  407 896 1560
+3  2100 2086 1224
+3  630 2086 1170
+3  1502 1174 1728
+3  630 1174 1777
+3  1884 845 1950
+3  582 845 1975
+3  1502 894 1503
+3  582 894 1728
+3  2029 1005 2030
+3  441 1005 2049
+3  1450 1044 1616
+3  441 1044 1592
+3  1884 739 1885
+3  465 739 1950
+3  1450 844 1451
+3  465 844 1616
+3  2100 1170 2086
+3  579 1170 2074
+3  1448 1116 1676
+3  579 1116 1725
+3  1822 791 1922
+3  525 791 1949
+3  1448 842 1449
+3  525 842 1676
+3  2033 965 2006
+3  414 965 1999
+3  1393 945 1552
+3  414 945 1566
+3  1822 676 1823
+3  399 676 1922
+3  1393 790 1394
+3  399 790 1552
+3  2088 2087 1121
+3  642 2087 2089
+3  1517 1182 1736
+3  642 1182 1789
+3  1838 853 1954
+3  590 853 1982
+3  1517 907 1518
+3  590 907 1736
+3  2033 1011 2034
+3  445 1011 2006
+3  1458 964 1565
+3  445 964 1596
+3  1838 691 1839
+3  413 691 1954
+3  1458 852 1459
+3  413 852 1565
+3  2088 2089 2087
+3  587 2089 1183
+3  1456 1261 1808
+3  587 1261 1733
+3  1824 926 1991
+3  661 926 1953
+3  1456 850 1457
+3  661 850 1808
+3  2036 1069 2058
+3  482 1069 2000
+3  1535 948 1554
+3  482 948 1633
+3  1824 678 1825
+3  401 678 1991
+3  1535 925 1536
+3  401 925 1554
+3  2090 2091 2077
+3  538 2091 1188
+3  1407 1192 1744
+3  538 1192 1689
+3  1900 861 1958
+3  598 861 1929
+3  1407 804 1408
+3  598 804 1744
+3  2036 1017 2037
+3  449 1017 2058
+3  1466 1068 1632
+3  449 1068 1600
+3  1900 755 1901
+3  481 755 1958
+3  1466 860 1467
+3  481 860 1632
+3  2090 1188 2091
+3  595 1188 2083
+3  1464 1144 1701
+3  595 1144 1741
+3  1826 817 1936
+3  554 817 1957
+3  1464 858 1465
+3  554 858 1701
+3  2039 986 2018
+3  429 986 2001
+3  1422 951 1556
+3  429 951 1579
+3  1826 680 1827
+3  403 680 1936
+3  1422 816 1423
+3  403 816 1556
+3  2093 2092 2080
+3  2169 2092 2094
+3  1420 1199 1751
+3  2169 1199 550
+3  1850 867 1961
+3  605 867 1935
+3  1420 814 1421
+3  605 814 1751
+3  2039 1023 2040
+3  453 1023 2018
+3  1474 985 1578
+3  453 985 1604
+3  1850 703 1851
+3  428 703 1961
+3  1474 866 1475
+3  428 866 1578
+3  2093 2094 2092
+3  602 2094 1200
+3  1472 1232 1781
+3  602 1232 1748
+3  1828 900 1978
+3  634 900 1960
+3  1472 864 1473
+3  634 864 1781
+3  2027 1048 2051
+3  468 1048 2002
+3  1507 954 1558
+3  468 954 1619
+3  1828 682 1829
+3  405 682 1978
+3  1507 899 1508
+3  405 899 1558
+3  1886 837 1946
+3  574 837 1977
+3  574 2341 2342
+3  2027 1001 2028
+3  439 1001 2051
+3  1442 1047 1618
+3  439 1047 1589
+3  1886 741 1887
+3  467 741 1946
+3  1442 836 1443
+3  467 836 1618
+3  2096 2095 2078
+3  542 2095 2097
+3  1411 1210 1760
+3  542 1210 1693
+3  1848 877 1966
+3  613 877 1931
+3  1411 808 1412
+3  613 808 1760
+3  1484 2308 1575
+3  232 231 2308
+3  1848 701 1849
+3  423 701 1966
+3  1484 876 1485
+3  423 876 1575
+3  2096 2097 2095
+3  612 2097 1211
+3  1482 1257 1804
+3  612 1257 1759
+3  1832 922 1989
+3  657 922 1965
+3  1482 874 1483
+3  657 874 1804
+3  2044 1066 2057
+3  480 1066 2004
+3  1531 960 1562
+3  480 960 1631
+3  1832 685 1833
+3  409 685 1989
+3  1531 921 1532
+3  409 921 1562
+3  2103 2098 1244
+3  654 2098 2099
+3  1529 1219 1768
+3  654 1219 1801
+3  1898 885 1970
+3  621 885 1988
+3  1529 919 1530
+3  621 919 1768
+3  2044 1036 2045
+3  461 1036 2057
+3  1492 1065 1630
+3  461 1065 1612
+3  1898 753 1899
+3  479 753 1970
+3  1492 884 1493
+3  479 884 1630
+3  2103 2099 2098
+3  618 2099 2102
+3  1490 1235 1784
+3  618 1235 1765
+3  1834 902 1979
+3  637 902 1969
+3  1490 882 1491
+3  637 882 1784
+3  2047 1051 2052
+3  470 1051 2005
+3  1511 962 1563
+3  470 962 1621
+3  1834 687 1835
+3  411 687 1979
+3  1511 901 1512
+3  411 901 1563
+3  2100 2101 2074
+3  526 2101 1224
+3  1395 1228 1776
+3  526 1228 1677
+3  1888 893 1974
+3  629 893 1923
+3  1395 792 1396
+3  629 792 1776
+3  2047 1042 2048
+3  464 1042 2052
+3  1500 1050 1620
+3  464 1050 1615
+3  1888 743 1889
+3  469 743 1974
+3  1500 892 1501
+3  469 892 1620
+3  2100 1224 2101
+3  626 1224 2086
+3  1498 1169 1724
+3  626 1169 1773
+3  1836 841 1948
+3  578 841 1973
+3  1498 890 1499
+3  578 890 1724
+3  1446 2313 2290
+3  2312 2313 1590
+3  1836 689 1837
+3  2338 689 1948
+3  1446 840 1447
+3  2338 840 2290
+3  575 2332 2285
+3  1444 2295 2286
+3  575 2295 1721
+3  94 93 2337
+3  2294 2314 1947
+3  1444 838 1445
+3  2294 838 2286
+3  2337 2333 1862
+3  115 114 2332
+3  2307 186 2330
+3  2330 181 2331
+3  2331 178 2344
+3  2016 1026 2041
+3  455 1026 2050
+3  142 141 2340
+3  455 2340 1606
+3  138 137 2319
+3  2093 1200 2094
+3  606 1200 2079
+3  1476 1139 1697
+3  606 1139 1752
+3  1877 813 1934
+3  549 813 1962
+3  1476 868 1477
+3  549 868 1697
+3  2016 983 2017
+3  427 983 2041
+3  1418 1025 1605
+3  427 1025 2198
+3  1877 730 1878
+3  454 730 1934
+3  1418 812 1419
+3  454 812 1605
+3  2103 2102 2099
+3  622 2102 2104
+3  1494 1243 1792
+3  622 1243 1769
+3  1882 910 1983
+3  645 910 1971
+3  1494 886 1495
+3  645 886 1792
+3  2031 1057 2054
+3  474 1057 2046
+3  1519 1038 1613
+3  474 1038 1625
+3  1882 737 1883
+3  462 737 1983
+3  1519 909 1520
+3  462 909 1613
+3  2088 1121 2075
+3  530 1121 2087
+3  1399 1178 1732
+3  530 1178 1681
+3  1892 849 1952
+3  586 849 1925
+3  1399 796 1400
+3  586 796 1732
+3  2031 1008 2032
+3  443 1008 2054
+3  1454 1056 1624
+3  443 1056 1594
+3  1892 747 1893
+3  473 747 1952
+3  1454 848 1455
+3  473 848 1624
+3  2103 2104 2102
+3  638 2104 1244
+3  1513 1253 1800
+3  638 1253 1785
+3  1890 918 1987
+3  653 918 1980
+3  1513 903 1514
+3  653 903 1800
+3  2059 1063 2056
+3  478 1063 2053
+3  1527 1053 1622
+3  478 1053 1629
+3  1890 745 1891
+3  471 745 1987
+3  1527 917 1528
+3  471 917 1622
+3  2105 2106 2076
+3  534 2106 1249
+3  1403 1265 1812
+3  534 1265 1685
+3  1896 930 1993
+3  665 930 1927
+3  1403 800 1404
+3  665 800 1812
+3  2059 1072 2060
+3  484 1072 2056
+3  1539 1062 1628
+3  484 1062 1635
+3  1896 751 1897
+3  477 751 1993
+3  1539 929 1540
+3  477 929 1628
+3  2103 1244 2104
+3  646 1244 2098
+3  1521 1215 1764
+3  646 1215 1793
+3  1894 881 1968
+3  617 881 1984
+3  1521 911 1522
+3  617 911 1764
+3  2025 1033 2043
+3  459 1033 2055
+3  1488 1059 1626
+3  459 1059 1610
+3  1894 749 1895
+3  475 749 1968
+3  1488 880 1489
+3  475 880 1626
+3  2096 1211 2097
+3  614 1211 2085
+3  1486 1162 1717
+3  614 1162 1761
+3  1879 833 1944
+3  570 833 1967
+3  1486 878 1487
+3  570 878 1717
+3  2025 998 2026
+3  437 998 2043
+3  1438 1032 1609
+3  437 1032 1587
+3  1879 733 1880
+3  458 733 1944
+3  1438 832 1439
+3  458 832 1609
+3  2088 1183 2089
+3  591 1183 2075
+3  1460 1120 1680
+3  591 1120 1737
+3  1869 795 1924
+3  529 795 1955
+3  1460 854 1461
+3  529 854 1680
+3  2021 968 2007
+3  416 968 2035
+3  1397 1013 1597
+3  416 1013 1568
+3  1869 722 1870
+3  446 722 1924
+3  1397 794 1398
+3  446 794 1597
+3  2105 1249 2106
+3  650 1249 2084
+3  1525 1153 1709
+3  650 1153 1797
+3  1840 825 1940
+3  562 825 1986
+3  1525 915 1526
+3  562 915 1709
+3  2021 992 2022
+3  433 992 2007
+3  1430 967 1567
+3  433 967 1583
+3  1840 693 1841
+3  415 693 1940
+3  1430 824 1431
+3  415 824 1567
+3  2107 2108 545
+3  2108 2204 545
+3  2111 1506 2109
+3  1115 1506 2110
+3  2110 1506 2111
+3  2266 2177 2137
+3  2137 2112 1700
+3  2137 2113 2112
+3  2140 2222 2014
+3  2014 2114 2115
+3  2014 2115 1638
+3  2107 545 2116
+3  2065 2148 2117
+3  2117 2118 2119
+3  2117 2119 2065
+3  2122 981 2120
+3  2280 981 2121
+3  2121 981 2122
+3  2123 1140 2124
+3  2124 2125 2123
+3  984 2124 1140
+3  2126 2128 2127
+3  485 2128 1636
+3  485 2127 2128
+3  2129 2131 2130
+3  550 2130 2131
+3  550 2131 1698
+3  2157 2132 2158
+3  2157 2133 2132
+3  2134 2136 2135
+3  2136 2150 2135
+3  2137 2138 2113
+3  2137 2139 2138
+3  2140 2141 2222
+3  2141 2250 2222
+3  2133 2143 2142
+3  2142 2143 2144
+3  2152 2145 2154
+3  2152 2146 2145
+3  2147 1080 2148
+3  2148 2149 2147
+3  1908 2148 1080
+3  2150 2160 2135
+3  2160 2150 2081
+3  2117 2152 2151
+3  2283 2117 2151
+3  2151 2152 2153
+3  2153 2152 2154
+3  2226 2348 2155
+3  2155 2348 2156
+3  548 2211 2157
+3  2157 2158 2159
+3  2157 2159 548
+3  2251 2160 2162
+3  2163 2160 2161
+3  2268 2251 2162
+3  2162 2160 2163
+3  2180 2238 2284
+3  2284 2238 2164
+3  2164 2238 2165
+3  2169 2166 2171
+3  2169 550 2167
+3  2169 2167 2166
+3  2273 2143 2331
+3  2331 2168 1779
+3  2135 2169 2272
+3  2272 2169 2170
+3  2170 2169 2171
+3  2172 2173 1932
+3  2173 982 1932
+3  2331 2174 2168
+3  2331 2175 2174
+3  2331 2344 2175
+3  2176 2178 2177
+3  1543 2178 391
+3  1543 2177 2178
+3  2146 2180 2179
+3  2179 2180 2181
+3  2130 2182 2274
+3  2130 2202 2183
+3  2182 2130 2183
+3  2183 2202 2184
+3  2233 1544 2185
+3  2282 2233 2185
+3  2185 1544 2186
+3  2186 1544 2187
+3  2188 2189 2244
+3  2127 2244 2189
+3  2127 2189 1076
+3  2260 2191 2190
+3  2190 2191 2192
+3  2193 2195 1907
+3  2194 1545 1907
+3  2195 2194 1907
+3  2191 2198 2196
+3  2269 2191 2196
+3  2196 2198 2197
+3  2197 2198 2199
+3  2126 2127 2200
+3  2201 2203 2202
+3  2203 2184 2202
+3  2204 2014 545
+3  2014 2204 2015
+3  2205 2207 2206
+3  2207 2208 2206
+3  2208 2270 2206
+3  1415 2211 2209
+3  2218 1415 2209
+3  2209 2211 2210
+3  2210 2211 2212
+3  2213 2215 2214
+3  2215 2216 2214
+3  2216 1143 2214
+3  2219 2264 2259
+3  2259 2217 1675
+3  2230 1415 2218
+3  2219 2220 2264
+3  2220 2276 2264
+3  2221 2223 2222
+3  1576 2222 2223
+3  1576 2223 424
+3  2339 2224 2255
+3  2339 2348 2225
+3  2224 2339 2225
+3  2225 2348 2226
+3  2344 2227 2279
+3  2344 2228 2227
+3  2344 2339 2228
+3  2231 1415 2229
+3  2229 1415 2230
+3  2172 1932 2231
+3  2231 1932 1415
+3  2139 2233 2232
+3  2232 2233 2234
+3  2235 2236 1908
+3  2236 935 1908
+3  2238 2237 2165
+3  2238 2239 2237
+3  2238 485 2239
+3  546 545 2240
+3  2240 2241 2242
+3  2240 2242 546
+3  2243 2245 2244
+3  2245 2188 2244
+3  1078 2248 2246
+3  2246 2248 2247
+3  2247 2248 2249
+3  2250 2221 2222
+3  2124 2251 2253
+3  2254 2251 2252
+3  2261 2124 2253
+3  2253 2251 2254
+3  2255 1674 2339
+3  2256 2257 984
+3  2257 2262 984
+3  2258 2217 2259
+3  2259 2260 2258
+3  2125 2124 2261
+3  2206 2262 2205
+3  2263 2265 2264
+3  1577 2264 2265
+3  1577 2265 426
+3  2266 2267 2177
+3  2267 2278 2177
+3  2201 2202 2214
+3  2268 2252 2251
+3  2192 2191 2269
+3  2198 2270 2199
+3  2271 551 550
+3  1506 1577 2109
+3  2272 2134 2135
+3  2273 2144 2143
+3  2129 2130 2274
+3  486 485 2275
+3  2276 2263 2264
+3  2277 2149 2148
+3  2214 1543 2213
+3  2348 1506 2156
+3  2278 2176 2177
+3  935 1907 1908
+3  523 2344 2279
+3  2240 2280 2241
+3  1545 1544 1907
+3  2281 2212 2211
+3  982 981 1932
+3  2282 2234 2233
+3  2243 2244 2248
+3  2118 2117 2283
+3  2181 2180 2284
+3  2249 2248 1576
+3  2312 2334 77
+3  80 79 2334
+3  79 78 2334
+3  2303 147 146
+3  2303 148 147
+3  113 2285 114
+3  112 2285 113
+3  2289 2326 2
+3  5 4 2326
+3  3 2 2326
+3  4 3 2326
+3  2333 90 89
+3  2333 91 90
+3  2333 92 91
+3  63 62 2338
+3  64 63 2338
+3  2336 84 83
+3  2336 82 81
+3  2336 83 82
+3  241 2328 242
+3  239 2328 240
+3  240 2328 241
+3  2294 2286 103
+3  105 104 2286
+3  87 2287 88
+3  85 2287 86
+3  86 2287 87
+3  196 195 2288
+3  197 196 2288
+3  125 2342 126
+3  123 2342 124
+3  124 2342 125
+3  34 2318 35
+3  33 2318 34
+3  21 2301 22
+3  20 2301 21
+3  2323 153 152
+3  2323 154 153
+3  38 37 2316
+3  2296 40 2316
+3  39 38 2316
+3  40 39 2316
+3  76 2312 77
+3  75 2312 76
+3  2320 23 2301
+3  2301 23 22
+3  2320 24 23
+3  256 2289 257
+3  2289 256 2291
+3  256 255 2291
+3  2319 2340 141
+3  143 142 2340
+3  198 2311 199
+3  197 2311 198
+3  2337 2314 95
+3  95 94 2337
+3  2292 249 248
+3  2292 250 249
+3  2327 248 247
+3  2327 2292 248
+3  2293 61 60
+3  2293 59 58
+3  2293 60 59
+3  2331 179 178
+3  2331 180 179
+3  2290 67 66
+3  2290 65 64
+3  2290 66 65
+3  136 2315 137
+3  135 2315 136
+3  2291 254 253
+3  68 67 2290
+3  2313 68 2290
+3  2313 70 69
+3  2313 71 70
+3  251 250 2292
+3  252 251 2292
+3  2291 252 2292
+3  235 2302 236
+3  234 2302 235
+3  233 2302 234
+3  15 2322 16
+3  2322 15 2304
+3  15 14 2304
+3  8 2325 9
+3  7 2325 8
+3  2293 56 2299
+3  2293 58 57
+3  2299 56 55
+3  2293 57 56
+3  2323 2298 156
+3  2294 100 2314
+3  2314 100 99
+3  2294 101 100
+3  130 2341 131
+3  129 2341 130
+3  127 2341 128
+3  128 2341 129
+3  204 2310 205
+3  202 2310 203
+3  203 2310 204
+3  10 2304 11
+3  2304 10 2325
+3  2295 2285 111
+3  110 109 2295
+3  111 110 2295
+3  102 2294 103
+3  101 2294 102
+3  2297 2300 48
+3  50 49 2300
+3  49 48 2300
+3  98 2314 99
+3  2286 2295 106
+3  108 107 2295
+3  172 2339 173
+3  170 2339 171
+3  169 2339 170
+3  171 2339 172
+3  2344 175 174
+3  2344 176 175
+3  2344 177 176
+3  2296 44 43
+3  2297 46 45
+3  2297 44 2296
+3  2297 45 44
+3  2349 211 210
+3  2349 209 208
+3  2349 210 209
+3  162 161 2324
+3  163 162 2324
+3  158 157 2298
+3  159 158 2298
+3  52 2299 53
+3  2299 52 2300
+3  52 51 2300
+3  166 2305 167
+3  165 2305 166
+3  2303 2321 148
+3  150 149 2321
+3  19 2301 20
+3  2301 19 2322
+3  2317 30 29
+3  2317 31 30
+3  2317 27 2320
+3  2320 27 26
+3  2317 28 27
+3  2317 29 28
+3  2315 2319 137
+3  139 138 2319
+3  2308 228 227
+3  2308 229 228
+3  2309 227 226
+3  2309 2308 227
+3  2308 2302 232
+3  233 232 2302
+3  2303 145 144
+3  2303 146 145
+3  12 2304 13
+3  11 2304 12
+3  2305 164 163
+3  2305 165 164
+3  214 2306 215
+3  213 2306 214
+3  212 2306 213
+3  2307 187 186
+3  2307 188 187
+3  2330 182 181
+3  2330 183 182
+3  2330 184 183
+3  2330 185 184
+3  2302 2345 236
+3  238 237 2345
+3  2307 2329 189
+3  191 190 2329
+3  192 191 2329
+3  230 2308 231
+3  229 2308 230
+3  224 2309 225
+3  223 2309 224
+3  200 199 2311
+3  2310 200 2311
+3  73 2312 74
+3  2312 73 2313
+3  72 2313 73
+3  2314 96 95
+3  2314 97 96
+3  2314 98 97
+3  2332 116 115
+3  2332 117 116
+3  2332 118 117
+3  2332 119 118
+3  2335 121 120
+3  2335 122 121
+3  2315 134 133
+3  2315 135 134
+3  2318 2316 36
+3  37 36 2316
+3  2318 32 2317
+3  2317 32 31
+3  2318 33 32
+3  140 2319 141
+3  139 2319 140
+3  2320 25 24
+3  2320 26 25
+3  151 150 2321
+3  152 151 2321
+3  17 2322 18
+3  16 2322 17
+3  155 2323 156
+3  154 2323 155
+3  2324 160 159
+3  2324 161 160
+3  218 2347 219
+3  216 2347 217
+3  217 2347 218
+3  6 5 2326
+3  2325 6 2326
+3  243 242 2328
+3  2327 244 2328
+3  244 243 2328
+3  2329 2288 194
+3  194 193 2329
+3  186 185 2330
+3  221 220 2346
+3  223 222 2346
+3  222 221 2346
+3  181 180 2331
+3  2310 2350 205
+3  207 206 2350
+3  105 2286 106
+3  2285 2332 114
+3  2333 88 2287
+3  81 80 2334
+3  2289 0 1
+3  257 2289 1
+3  2335 119 2332
+3  2336 2287 85
+3  2333 2337 92
+3  2310 202 201
+3  2305 2348 167
+3  2338 61 2293
+3  188 2307 189
+3  133 132 2343
+3  46 2297 47
+3  2339 2344 174
+3  144 143 2340
+3  2285 112 111
+3  2342 2341 126
+3  2335 2342 122
+3  2341 2343 131
+3  2296 42 41
+3  2327 246 245
+3  246 2327 247
+3  178 177 2344
+3  239 238 2345
+3  2288 195 194
+3  2347 2346 219
+3  225 2309 226
+3  2306 2347 215
+3  2348 2339 169
+3  2312 75 74
+3  54 2299 55
+3  2299 54 53
+3  42 2296 43
+3  212 211 2349
+3  208 207 2350
 
diff --git a/Data/data/meshes/polyhedral_complex_of_spheres/Sphere2.off b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere2.off
index 5a937e8fe2c8..55f360d2ff57 100644
--- a/Data/data/meshes/polyhedral_complex_of_spheres/Sphere2.off
+++ b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere2.off
@@ -1,7185 +1,7185 @@
-NOFF
+OFF
 2454 4727 0
 
-0.99999999999999989 1.5257311121191339 1.8506508083520397  -6.318411039282109e-16 0.52573111211913615 0.85065080835203821
-1 1.5257311121191335 0.14934919164796001  3.8188198589067693e-17 0.52573111211913426 -0.85065080835203943
-0.99999999999999989 0.47426888788086619 1.8506508083520397  -3.6105205938754909e-16 -0.5257311121191337 0.85065080835203977
-0.99999999999999967 0.4742688878808663 0.14934919164796012  -1.6663941202502267e-16 -0.52573111211913293 -0.85065080835204032
-1.5257311121191339 1.8506508083520397 1  0.52573111211913437 0.85065080835203932 9.0263014846887274e-17
-1.5257311121191337 0.14934919164796012 0.99999999999999967  0.52573111211913315 -0.85065080835204021 -1.9441264736252645e-16
-0.4742688878808663 1.8506508083520399 0.99999999999999989  -0.52573111211913437 0.85065080835203932 -6.1795448625945903e-16
-0.4742688878808663 0.14934919164796012 0.99999999999999967  -0.52573111211913282 -0.85065080835204043 -2.1177091944846629e-16
-1.8506508083520397 0.99999999999999989 1.5257311121191339  0.8506508083520391 -4.75300471383251e-16 0.52573111211913492
-1.8506508083520397 0.99999999999999989 0.47426888788086619  0.85065080835203921 -3.6105205938754909e-16 -0.52573111211913459
-0.14934919164796023 0.99999999999999989 1.5257311121191337  -0.85065080835204032 -2.7773235337503781e-17 0.52573111211913293
-0.1493491916479599 0.99999999999999989 0.47426888788086663  -0.85065080835203943 -5.9712455975633122e-16 -0.52573111211913426
-1.3568220897730903 1.0000000000000002 1.9341723589627156  0.35662245495100681 -0.00037008290847438354 0.9342485149377322
-1.5773502691896257 1.5773502691896257 1.5773502691896257  0.57739733617063194 0.57762605998672589 0.57702725326215698
-1.0000000000000007 1.9341723589627156 1.3568220897730903  -0.00037008290847277551 0.9342485149377322 0.35662245495100664
-0.4226497308103746 1.5773502691896262 1.5773502691896257  -0.57702725326215742 0.57739733617063282 0.57762605998672478
-0.6431779102269104 1.0000000000000002 1.9341723589627158  -0.35662245495100636 -0.00037008290847433145 0.93424851493773231
-1.35682208977309 1.0000000000000002 0.065827641037284335  0.35662245495100692 -0.00037008290847577804 -0.9342485149377322
-0.6431779102269104 1.0000000000000002 0.065827641037284113  -0.35722126167557366 4.5150772736060815e-17 -0.93401979112163969
-0.42264973081037427 1.577350269189626 0.42264973081037438  -0.57702725326215676 0.57739733617063282 -0.57762605998672534
-1.0000000000000007 1.9341723589627158 0.6431779102269104  0.00037008290847432798 0.93424851493773231 -0.35662245495100647
-1.5773502691896257 1.5773502691896262 0.4226497308103746  0.57702725326215665 0.57739733617063282 -0.57762605998672534
-1.577350269189626 0.4226497308103746 1.577350269189626  0.57739733617063282 -0.57762605998672534 0.57702725326215676
-1.0000000000000002 0.065827641037284335 1.35682208977309  0.000370082908475811 -0.93424851493773209 0.35662245495100692
-1.0000000000000002 0.065827641037284113 0.6431779102269104  -0.00037008290847425506 -0.9342485149377322 -0.3566224549510067
-1.5773502691896262 0.42264973081037449 0.42264973081037416  0.57762605998672523 -0.57702725326215698 -0.57739733617063271
-1.9341723589627158 0.6431779102269104 1.0000000000000002  0.93424851493773242 -0.3566224549510062 -0.0003700829084745781
-1.9341723589627156 1.3568220897730903 1.0000000000000002  0.93424851493773209 0.35662245495100681 -0.00037008290847286924
-0.21405999957086966 0.39229183849441451 0.893825128737608  -0.79565076497466791 -0.59478368364252876 -0.11477033531296353
-0.065827641037284113 0.6431779102269104 1.0000000000000002  -0.9342485149377322 -0.3566224549510067 -0.00037008290847423419
-0.42264973081037438 0.42264973081037427 1.577350269189626  -0.57762605998672523 -0.57702725326215676 0.57739733617063294
-0.065827641037284446 1.3568220897730903 1.0000000000000002  -0.93401979112163935 0.35722126167557461 1.1496081365873945e-15
-1.3312080946370168 1.4012770227944238 1.8539777216205118  0.33139575632083185 0.4011866027874687 0.85394740027497806
-1.2046978598347684 1.7324851174314406 1.6492798617857436  0.20481384113375387 0.73258235910829939 0.6491335591412265
-0.79530214016523215 1.7324851174314406 1.6492798617857436  -0.20481384113375173 0.73258235910829927 0.64913355914122717
-0.66879190536298383 1.4012770227944238 1.853977721620512  -0.33139575632083168 0.40118660278746887 0.85394740027497806
-1.0000000000000002 1.1965791629596558 1.9804879564227607  0 0.196372761653717 0.98052931546205813
-1.0000000000000002 1.1965791629596558 0.019512043577239568  0 0.196372761653717 -0.98052931546205813
-0.66879190536298361 1.4012770227944238 0.146022278379488  -0.33139575632083101 0.40118660278746843 -0.85394740027497851
-0.79530214016523226 1.7324851174314406 0.35072013821425641  -0.20481384113375264 0.73258235910829961 -0.6491335591412265
-1.2046978598347684 1.7324851174314404 0.35072013821425629  0.20481384113375153 0.73258235910829905 -0.6491335591412275
-1.3312080946370171 1.401277022794424 0.14602227837948833  0.33139575632083135 0.40118660278746726 -0.85394740027497895
-1.401277022794424 0.14602227837948833 1.3312080946370171  0.40118660278746898 -0.85394740027497829 0.3313957563208309
-1.1965791629596561 0.019512043577239457 1.0000000000000002  0.19637276165371714 -0.98052931546205813 0
-1.4012770227944238 0.146022278379488 0.66879190536298361  0.40118660278746804 -0.85394740027497862 -0.33139575632083129
-1.7324851174314406 0.35072013821425641 0.79530214016523226  0.73258235910829961 -0.6491335591412265 -0.20481384113375264
-1.7324851174314406 0.35072013821425641 1.2046978598347684  0.73258235910829916 -0.64913355914122739 0.20481384113375165
-1.8539777216205118 1.3312080946370168 1.4012770227944238  0.85394740027497817 0.33139575632083174 0.40118660278746876
-0.1974660445788706 0.41582096722616779 0.88692657891222382  -0.79565076497466325 -0.59478368364253609 -0.11477033531295829
-0.019512043577239346 1.0000000000000002 0.80342083704034495  -0.98052931546205824 0 -0.19637276165371648
-0.35072013821425629 0.79530214016523215 1.7324851174314406  -0.64913355914122772 -0.2048138411337517 0.73258235910829883
-0.26751488256855993 1.649279861785744 1.2046978598347684  -0.73258235910829883 0.64913355914122717 0.20481384113375317
-1.0000000000000002 0.80342083704034495 1.9804879564227607  -1.0422004117939917e-16 -0.19637276165371575 0.98052931546205846
-1.6492798617857436 0.79530214016523215 1.7324851174314406  0.64913355914122861 -0.20481384113375267 0.73258235910829772
-1.6492798617857436 1.2046978598347686 1.7324851174314406  0.64913355914122639 0.20481384113375387 0.7325823591082995
-1.7324851174314406 1.6492798617857436 1.2046978598347684  0.73258235910829939 0.6491335591412265 0.20481384113375387
-1.4012770227944238 1.8539777216205118 1.3312080946370168  0.40118660278746876 0.85394740027497817 0.33139575632083174
-0.80342083704034506 1.9804879564227607 1.0000000000000002  -0.19637276165371562 0.98052931546205846 0
-0.59872297720557688 1.8539777216205122 1.3312080946370171  -0.40118660278746876 0.85394740027497795 0.33139575632083201
-0.14602227837948833 1.3312080946370171 1.401277022794424  -0.85394740027497884 0.33139575632083113 0.40118660278746771
-0.35072013821425641 1.2046978598347684 1.7324851174314406  -0.64913355914122739 0.20481384113375165 0.73258235910829916
-0.66879190536298383 0.59872297720557643 1.8539777216205122  -0.33139575632083085 -0.40118660278746721 0.85394740027497917
-1.649279861785744 1.2046978598347684 0.26751488256855982  0.64913355914122706 0.20481384113375306 -0.73258235910829916
-1.3312080946370175 0.59872297720557643 0.14602227837948822  0.33139575632083124 -0.40118660278746804 -0.85394740027497862
-1.0000000000000002 0.80342083704034484 0.019512043577239457  0 -0.19637276165371659 -0.98052931546205824
-0.10155294642477927 0.62688758712066828 0.77156308049914146  -0.9089423780023973 -0.34889693998410792 -0.22824258748330262
-0.35072013821425641 1.2046978598347684 0.26751488256855949  -0.64913355914122695 0.20481384113375189 -0.7325823591082995
-0.26751488256855938 1.6492798617857436 0.79530214016523215  -0.73258235910830005 0.64913355914122683 -0.20481384113375023
-0.59872297720557666 1.8539777216205122 0.66879190536298361  -0.40118660278746709 0.85394740027497917 -0.33139575632083096
-1.1965791629596561 1.9804879564227607 1  0.19637276165371698 0.98052931546205824 -3.3611241228009335e-16
-1.401277022794424 1.8539777216205118 0.66879190536298383  0.40118660278746887 0.85394740027497817 -0.33139575632083151
-1.853977721620512 1.3312080946370168 0.59872297720557677  0.85394740027497806 0.33139575632083185 -0.4011866027874687
-1.853977721620512 0.66879190536298383 1.4012770227944238  0.85394740027497806 -0.33139575632083168 0.40118660278746887
-1.3312080946370171 0.59872297720557688 1.8539777216205122  0.33139575632083201 -0.40118660278746876 0.85394740027497795
-1.2046978598347684 0.26751488256855982 1.649279861785744  0.20481384113375259 -0.73258235910830005 0.64913355914122617
-0.59872297720557643 0.14602227837948822 1.3312080946370175  -0.40118660278746776 -0.85394740027497862 0.33139575632083168
-0.80342083704034495 0.019512043577239346 1.0000000000000002  -0.19637276165371648 -0.98052931546205824 0
-0.096124922711889493 0.65746189559341328 0.74644278217951743  -0.90894237800239686 -0.34889693998411031 -0.22824258748330079
-1.2046978598347686 0.2675148825685596 0.35072013821425641  0.20481384113375192 -0.7325823591082995 -0.64913355914122695
-1.6492798617857436 0.79530214016523215 0.26751488256855938  0.64913355914122683 -0.20481384113375023 -0.73258235910830005
-1.8539777216205122 0.66879190536298383 0.59872297720557643  0.85394740027497917 -0.33139575632083079 -0.40118660278746726
-1.9804879564227607 1.0000000000000002 1.1965791629596558  0.98052931546205813 0 0.19637276165371695
-1.9804879564227607 1.0000000000000002 0.80342083704034484  0.98052931546205846 0 -0.19637276165371578
-1.7324851174314402 1.649279861785744 0.79530214016523226  0.73258235910829905 0.6491335591412275 -0.20481384113375153
-0.78745552743149327 0.10609528287383579 0.60630413399985716  -0.2304276104259802 -0.87734110809753463 -0.42092243512975486
-0.28910030252843322 0.30397342055421106 0.90687073458352596  -0.726514047779109 -0.6809683700479634 -0.091975091050971569
-0.26218372058148809 0.33295004022963903 0.90494753379947435  -0.72651404777911421 -0.68096837004795852 -0.091975091050967947
-0.14602227837948811 0.66879190536298361 1.401277022794424  -0.85394740027497862 -0.33139575632083124 0.40118660278746804
-0.2675148825685596 0.35072013821425641 1.2046978598347686  -0.7325823591082995 -0.64913355914122695 0.20481384113375192
-0.79530214016523215 0.26751488256855938 1.6492798617857436  -0.20481384113375023 -0.73258235910830005 0.64913355914122683
-0.14602227837948811 1.3312080946370171 0.59872297720557643  -0.85394740027497829 0.33139575632083146 -0.40118660278746848
-0.019512043577239457 1.0000000000000002 1.1965791629596561  -0.98052931546205813 0 0.19637276165371714
-1.5339861224060576 1.4054741487319156 1.7419228637721522  0.53404105644655853 0.40564529943251842 0.74178975530654656
-1.2079367413660946 1.8640076955737634 1.4585335468418474  0.20774869885998731 0.86409658071843209 0.45845128128591411
-0.59452585126808544 1.7419228637721522 1.533986122406058  -0.40564529943251854 0.74178975530654634 0.53404105644655853
-0.54146645315815245 1.2079367413660949 1.8640076955737634  -0.45845128128591289 0.20774869885998976 0.86409658071843232
-1.1220848318016112 1.0000000000000002 1.9925196692479057  0.12230682541188717 1.0419271530395937e-17 0.99249233773247136
-0.87791516819838944 1.0000000000000002 0.0074803307520941997  -0.1223068254118834 3.6814759407398977e-16 -0.99249233773247192
-0.46601387759394242 1.4054741487319158 0.25807713622784789  -0.53404105644655753 0.40564529943251815 -0.74178975530654745
-0.79206325863390559 1.8640076955737634 0.54146645315815256  -0.20774869885998828 0.86409658071843198 -0.45845128128591417
-1.4054741487319156 1.7419228637721522 0.46601387759394231  0.40564529943251898 0.74178975530654656 -0.53404105644655808
-1.4585335468418481 1.2079367413660951 0.13599230442623689  0.45845128128591389 0.20774869885998942 -0.86409658071843176
-1.2079367413660951 0.135992304426237 1.4585335468418483  0.20774869885999012 -0.86409658071843165 0.45845128128591389
-1.0000000000000002 0.0074803307520941997 0.87791516819838944  -4.5150176631715731e-17 -0.99249233773247181 -0.12230682541188409
-1.4054741487319158 0.258077136227848 0.46601387759394253  0.40564529943251815 -0.74178975530654734 -0.53404105644655753
-1.8640076955737634 0.54146645315815256 0.79206325863390559  0.86409658071843198 -0.45845128128591417 -0.20774869885998828
-1.7419228637721522 0.46601387759394275 1.4054741487319153  0.74178975530654689 -0.53404105644655808 0.40564529943251831
-1.7419228637721522 1.5339861224060576 1.4054741487319156  0.74178975530654678 0.53404105644655786 0.4056452994325187
-0.14564781357706014 0.50275426427774228 0.85145286645038376  -0.84903903628469291 -0.49501822108781729 -0.18463389628075594
-0.0074803307520941997 1.1220848318016112 1.0000000000000002  -0.99249233773247181 0.12230682541188395 -1.3892362040527919e-17
-0.54146645315815245 0.79206325863390548 1.8640076955737634  -0.458451281285915 -0.20774869885998923 0.86409658071843132
-0.25807713622784823 1.5339861224060583 1.4054741487319156  -0.74178975530654656 0.53404105644655775 0.40564529943251931
-0.87791516819838944 1.0000000000000002 1.9925196692479057  -0.12230682541188399 3.4730905101319789e-18 0.99249233773247181
-1.533986122406058 0.59452585126808544 1.7419228637721522  0.53404105644655864 -0.40564529943251854 0.74178975530654645
-1.4585335468418477 1.2079367413660946 1.8640076955737634  0.45845128128591472 0.2077486988599905 0.8640965807184311
-1.8640076955737634 1.4585335468418477 1.2079367413660946  0.8640965807184311 0.45845128128591467 0.20774869885999048
-1.4054741487319156 1.7419228637721522 1.5339861224060576  0.4056452994325182 0.74178975530654701 0.53404105644655797
-1.0000000000000002 1.9925196692479057 0.87791516819838922  8.5438026549246697e-16 0.99249233773247192 -0.1223068254118827
-0.7920632586339057 1.8640076955737634 1.4585335468418479  -0.20774869885998981 0.86409658071843187 0.45845128128591361
-0.135992304426237 1.4585335468418483 1.2079367413660951  -0.86409658071843176 0.45845128128591378 0.20774869885999001
-0.46601387759394275 1.4054741487319153 1.7419228637721522  -0.53404105644655875 0.40564529943251865 0.74178975530654623
-0.46601387759394253 0.59452585126808521 1.7419228637721527  -0.53404105644655886 -0.40564529943251743 0.74178975530654678
-1.5339861224060583 1.4054741487319153 0.25807713622784811  0.53404105644655808 0.40564529943251759 -0.74178975530654723
-1.533986122406058 0.5945258512680851 0.25807713622784789  0.53404105644655786 -0.40564529943251637 -0.741789755306548
-1.1220848318016112 1.0000000000000002 0.0074803307520941997  0.12230682541188462 3.9245922764491371e-16 -0.9924923377324717
-0.12850859076870802 0.5423386494351099 0.82968743367193953  -0.87265298324518692 -0.4603681578214735 -0.16290466567087195
-0.54146645315815223 1.2079367413660949 0.13599230442623678  -0.458451281285913 0.20774869885998931 -0.86409658071843221
-0.13599230442623678 1.4585335468418479 0.79206325863390536  -0.86409658071843176 0.45845128128591395 -0.20774869885998948
-0.59452585126808533 1.7419228637721524 0.46601387759394242  -0.40564529943251737 0.74178975530654634 -0.53404105644655953
-1.0000000000000002 1.9925196692479057 1.1220848318016112  5.904253867224365e-17 0.99249233773247181 0.12230682541188408
-1.2079367413660951 1.8640076955737632 0.54146645315815234  0.20774869885999017 0.86409658071843176 -0.45845128128591367
-1.8640076955737634 1.4585335468418479 0.7920632586339057  0.86409658071843076 0.45845128128591522 -0.20774869885999078
-1.8640076955737634 0.54146645315815256 1.2079367413660949  0.86409658071843232 -0.45845128128591284 0.20774869885998976
-1.4585335468418479 0.7920632586339057 1.8640076955737634  0.45845128128591522 -0.20774869885999078 0.86409658071843076
-1.4054741487319153 0.25807713622784811 1.5339861224060583  0.40564529943251804 -0.74178975530654723 0.53404105644655797
-0.5945258512680851 0.25807713622784789 1.533986122406058  -0.40564529943251643 -0.74178975530654812 0.53404105644655786
-1.0000000000000002 0.0074803307520941997 1.1220848318016112  -1.3892362040527919e-17 -0.99249233773247181 0.12230682541188395
-0.12310298935169575 0.55521070025011254 0.82226795238624728  -0.53077402771794857 -0.83361988814006172 0.15282936104498174
-1.2079367413660949 0.13599230442623678 0.54146645315815223  0.20774869885998931 -0.86409658071843221 -0.45845128128591306
-1.4585335468418479 0.79206325863390536 0.13599230442623678  0.45845128128591295 -0.20774869885998887 -0.86409658071843243
-1.7419228637721527 0.46601387759394253 0.59452585126808521  0.74178975530654678 -0.53404105644655886 -0.40564529943251743
-1.9925196692479057 1.1220848318016112 1.0000000000000002  0.99249233773247136 0.12230682541188717 1.0419271530395937e-17
-1.9925196692479057 0.87791516819838944 1.0000000000000002  0.99249233773247159 -0.12230682541188531 9.0647662314444641e-16
-1.7419228637721522 1.533986122406058 0.59452585126808544  0.74178975530654645 0.53404105644655864 -0.40564529943251859
-0.10609528287383586 0.60630413399985694 0.78745552743149316  -0.87734110809753796 -0.42092243512974953 -0.23042761042597798
-0.71884915497263779 0.093588483842681203 0.68777595190194329  -0.29270566773562345 -0.90562084821138311 -0.30687826798314943
-0.69813515078208477 0.093116941936638692 0.70892487408416871  -0.29270566773563078 -0.90562084821138489 -0.30687826798313739
-0.258077136227848 0.46601387759394253 1.4054741487319158  -0.74178975530654734 -0.53404105644655764 0.4056452994325182
-0.13599230442623678 0.54146645315815223 1.2079367413660949  -0.86409658071843221 -0.45845128128591306 0.20774869885998931
-0.79206325863390536 0.13599230442623678 1.4585335468418479  -0.20774869885998887 -0.86409658071843243 0.45845128128591295
-0.25807713622784789 1.533986122406058 0.59452585126808488  -0.74178975530654812 0.53404105644655786 -0.40564529943251648
-0.0074803307520941997 0.87791516819838944 1.0000000000000002  -0.99249233773247181 -0.12230682541188409 -4.5150176631715731e-17
-1.1827577335161514 1.5664460834152063 1.8035785247401852  0.18137511328579206 0.56621300696156995 0.80405590541211946
-1.2379740221293494 1.20209118411409 1.9500144830974655  0.23767767361493702 0.20255543129006781 0.94998980032413294
-1 1.6793965744350836 1.7337712822439113  -9.376138298315617e-17 0.6783089916855547 0.73477677685030718
-1.3850500562448067 1.5871412403588967 1.7120404609681164  0.38457055427597053 0.58712598556604023 0.71231212670919675
-0.81724226648384946 1.5664460834152067 1.8035785247401852  -0.18137511328579153 0.56621300696157062 0.80405590541211913
-1 1.8251152624882454 1.5649644268526592  3.438308077231267e-16 0.82480365918097642 0.56541924604816174
-0.88704950898012358 1.3836883498990562 1.9165290157600621  -0.11209598472398226 0.38483789367577698 0.91615189013610188
-0.61494994375519396 1.5871412403588967 1.7120404609681168  -0.38457055427597275 0.58712598556604123 0.71231212670919475
-1.1129504910198773 1.3836883498990558 1.9165290157600623  0.1120959847239837 0.38483789367577748 0.91615189013610154
-0.76202597787065152 1.20209118411409 1.9500144830974659  -0.23767767361493677 0.2025554312900677 0.94998980032413305
-0.88704950898012358 1.3836883498990558 0.083470984239937707  -0.1120959847239813 0.38483789367577687 -0.9161518901361021
-1.2379740221293494 1.20209118411409 0.049985516902534388  0.23767767361493577 0.20255543129006892 -0.94998980032413305
-0.81724226648384946 1.5664460834152065 0.19642147525981468  -0.18137511328579259 0.56621300696157051 -0.80405590541211902
-0.76202597787065152 1.20209118411409 0.049985516902534055  -0.23767767361493672 0.20255543129006834 -0.94998980032413294
-1 1.6793965744350834 0.26622871775608836  -7.4661842005105821e-16 0.67830899168555392 -0.73477677685030796
-0.61494994375519396 1.5871412403588969 0.28795953903188354  -0.38457055427597092 0.58712598556604167 -0.7123121267091953
-1.1827577335161514 1.5664460834152067 0.1964214752598149  0.18137511328579306 0.56621300696157151 -0.80405590541211813
-1 1.8251152624882456 0.43503557314734087  -3.2299257695202805e-16 0.82480365918097664 -0.56541924604816129
-1.1129504910198773 1.3836883498990562 0.08347098423993804  0.1120959847239832 0.38483789367577731 -0.91615189013610165
-1.3850500562448065 1.5871412403588967 0.28795953903188365  0.38457055427596948 0.58712598556604079 -0.71231212670919675
-1.3836883498990562 0.08347098423993804 1.1129504910198773  0.3848378936757787 -0.91615189013610121 0.11209598472398163
-1.5871412403588967 0.28795953903188365 1.3850500562448065  0.58712598556604045 -0.71231212670919652 0.38457055427597064
-1.3836883498990558 0.083470984239937596 0.88704950898012358  0.38483789367577764 -0.91615189013610177 -0.11209598472398113
-1.20209118411409 0.049985516902534388 1.2379740221293494  0.20255543129006892 -0.94998980032413305 0.23767767361493577
-1.5664460834152067 0.19642147525981479 0.81724226648384946  0.56621300696157051 -0.80405590541211891 -0.18137511328579287
-1.20209118411409 0.049985516902534055 0.76202597787065152  0.20255543129006834 -0.94998980032413294 -0.23767767361493672
-1.6793965744350836 0.26622871775608847 1  0.67830899168555392 -0.73477677685030796 -7.7092692675039513e-16
-1.5871412403588971 0.28795953903188365 0.61494994375519385  0.58712598556604101 -0.71231212670919575 -0.38457055427597103
-1.5664460834152067 0.19642147525981501 1.1827577335161514  0.56621300696157129 -0.80405590541211813 0.18137511328579395
-1.8251152624882456 0.43503557314734087 1  0.82480365918097664 -0.56541924604816129 -3.2299257695202805e-16
-1.803578524740185 1.1827577335161514 1.5664460834152067  0.80405590541211924 0.18137511328579298 0.56621300696157006
-1.9500144830974655 1.2379740221293494 1.20209118411409  0.94998980032413294 0.23767767361493702 0.20255543129006781
-0.88704950898012358 0.61631165010094424 0.083470984239937707  -0.11209598472398068 -0.38483789367577892 -0.91615189013610132
-0.11695476797072325 0.81049434395812059 0.57278135509939099  -0.88441806965928826 -0.18329374350458946 -0.42919468968314645
-0.083470984239937707 1.1129504910198773 0.61631165010094446  -0.91615189013610143 0.11209598472398319 -0.38483789367577775
-0.049985516902534055 0.76202597787065152 0.79790881588591023  -0.94998980032413294 -0.23767767361493683 -0.2025554312900682
-0.26622871775608847 1 1.6793965744350836  -0.73477677685030796 -7.7092692675039513e-16 0.67830899168555392
-0.28795953903188365 0.61494994375519385 1.5871412403588971  -0.71231212670919564 -0.38457055427597181 0.58712598556604068
-0.4335539165847937 1.8035785247401852 1.1827577335161514  -0.5662130069615704 0.80405590541211858 0.18137511328579492
-0.17488473751175482 1.5649644268526597 1  -0.8248036591809762 0.56541924604816207 5.5568615389596231e-16
-0.88704950898012358 0.61631165010094435 1.9165290157600623  -0.1120959847239814 -0.38483789367577786 0.91615189013610154
-1.2379740221293494 0.79790881588591023 1.9500144830974657  0.23767767361493719 -0.20255543129006753 0.94998980032413294
-1.8035785247401852 0.81724226648384946 1.5664460834152067  0.80405590541211902 -0.18137511328579381 0.56621300696156995
-1.5649644268526592 1 1.8251152624882454  0.56541924604816174 3.438308077231267e-16 0.82480365918097642
-1.7337712822439113 1 1.6793965744350836  0.73477677685030718 -9.376138298315617e-17 0.6783089916855547
-1.7120404609681164 1.3850500562448067 1.5871412403588967  0.71231212670919519 0.38457055427597214 0.58712598556604101
-1.6793965744350836 1.7337712822439113 1  0.67830899168555459 0.73477677685030729 -1.7363219070954845e-17
-1.5871412403588967 1.7120404609681164 1.3850500562448067  0.58712598556604001 0.71231212670919664 0.38457055427597087
-1.5664460834152067 1.803578524740185 1.1827577335161514  0.56621300696156995 0.80405590541211935 0.18137511328579267
-1.20209118411409 1.9500144830974655 1.2379740221293494  0.20255543129006781 0.94998980032413294 0.23767767361493702
-0.61631165010094446 1.9165290157600623 0.88704950898012325  -0.38483789367577803 0.91615189013610154 -0.11209598472398145
-0.79790881588591023 1.9500144830974657 1.2379740221293494  -0.20255543129006748 0.94998980032413305 0.23767767361493711
-0.61631165010094424 1.9165290157600623 1.1129504910198773  -0.38483789367577592 0.91615189013610221 0.11209598472398261
-0.41285875964110408 1.712040460968117 1.3850500562448065  -0.58712598556604001 0.71231212670919664 0.38457055427597098
-0.08347098423993804 1.1129504910198773 1.3836883498990562  -0.91615189013610132 0.11209598472398308 0.38483789367577803
-0.28795953903188365 1.3850500562448065 1.5871412403588967  -0.71231212670919619 0.38457055427597098 0.58712598556604068
-0.19642147525981501 1.1827577335161514 1.5664460834152067  -0.80405590541211813 0.18137511328579395 0.56621300696157129
-0.43503557314734087 1 1.8251152624882456  -0.56541924604816129 -3.2299257695202805e-16 0.82480365918097664
-0.81724226648384946 0.43355391658479348 1.8035785247401854  -0.18137511328579439 -0.56621300696157062 0.80405590541211847
-0.76202597787065152 0.79790881588591056 1.9500144830974659  -0.23767767361493689 -0.20255543129006748 0.94998980032413316
-1.8035785247401852 1.1827577335161514 0.4335539165847937  0.80405590541211858 0.18137511328579328 -0.56621300696157084
-1.5649644268526597 1 0.17488473751175482  0.56541924604816207 5.6263223081966191e-16 -0.8248036591809762
-1.1827577335161514 0.43355391658479359 0.19642147525981479  0.18137511328579375 -0.56621300696157095 -0.80405590541211847
-1.2379740221293494 0.79790881588591067 0.049985516902534166  0.23767767361493766 -0.20255543129006781 -0.94998980032413283
-1.1129504910198773 0.61631165010094446 0.083470984239937707  0.11209598472398249 -0.38483789367577809 -0.91615189013610143
-0.76202597787065152 0.79790881588591023 0.049985516902534055  -0.2376776736149355 -0.202555431290069 -0.94998980032413316
-0.12315882465233809 0.82188503772742794 0.55513243511370003  -0.88441806965928915 -0.18329374350459193 -0.42919468968314334
-0.43503557314734065 1 0.1748847375117546  -0.56541924604816052 6.9460769236995282e-18 -0.8248036591809772
-0.26622871775608858 1 0.32060342556491639  -0.73477677685030895 1.805774783379304e-16 -0.67830899168555292
-0.28795953903188343 1.3850500562448067 0.41285875964110363  -0.7123121267091963 0.38457055427597114 -0.58712598556604034
-0.32060342556491628 1.7337712822439113 1  -0.67830899168555359 0.73477677685030818 1.5279632782440261e-16
-0.41285875964110386 1.7120404609681168 0.61494994375519374  -0.58712598556604001 0.71231212670919686 -0.38457055427597087
-0.43355391658479348 1.8035785247401854 0.81724226648384946  -0.56621300696157029 0.80405590541211891 -0.18137511328579398
-0.79790881588591056 1.9500144830974659 0.76202597787065107  -0.20255543129006695 0.94998980032413305 -0.23767767361493727
-1.3836883498990558 1.9165290157600623 1.1129504910198773  0.3848378936757757 0.9161518901361021 0.11209598472398441
-1.20209118411409 1.9500144830974657 0.76202597787065107  0.20255543129006906 0.9499898003241326 -0.23767767361493711
-1.3836883498990562 1.9165290157600621 0.88704950898012325  0.38483789367577703 0.91615189013610188 -0.11209598472398222
-1.5871412403588967 1.7120404609681168 0.61494994375519396  0.58712598556604123 0.71231212670919475 -0.3845705542759727
-1.9165290157600623 1.1129504910198773 0.61631165010094424  0.91615189013610221 0.11209598472398261 -0.38483789367577592
-1.712040460968117 1.3850500562448065 0.41285875964110408  0.71231212670919664 0.38457055427597103 -0.58712598556604001
-1.9165290157600621 0.88704950898012358 1.3836883498990562  0.91615189013610188 -0.11209598472398227 0.38483789367577698
-1.7120404609681168 0.61494994375519396 1.5871412403588967  0.71231212670919475 -0.38457055427597275 0.58712598556604123
-1.1129504910198773 0.61631165010094424 1.9165290157600623  0.11209598472398245 -0.38483789367577781 0.91615189013610154
-1.3850500562448065 0.41285875964110408 1.712040460968117  0.38457055427597103 -0.58712598556604001 0.71231212670919664
-1.1827577335161514 0.43355391658479359 1.8035785247401852  0.18137511328579506 -0.5662130069615704 0.80405590541211847
-1 0.17488473751175482 1.5649644268526597  5.6263223081966191e-16 -0.8248036591809762 0.56541924604816207
-0.43355391658479359 0.19642147525981479 1.1827577335161514  -0.5662130069615704 -0.80405590541211902 0.18137511328579242
-0.79790881588591067 0.049985516902534166 1.2379740221293494  -0.20255543129006781 -0.94998980032413283 0.23767767361493766
-0.61631165010094446 0.083470984239937707 1.1129504910198773  -0.38483789367577714 -0.91615189013610177 0.11209598472398331
-0.79790881588591023 0.049985516902534055 0.76202597787065152  -0.2025554312900682 -0.94998980032413294 -0.23767767361493683
-0.17773204761375261 0.87689701064830428 0.44478929974988757  -0.85331277880251888 -0.17482109513942348 -0.49121775846011101
-1 0.1748847375117546 0.43503557314734065  3.4730384618497641e-18 -0.8248036591809772 -0.56541924604816052
-1 0.3206034255649165 0.26622871775608858  -9.0288739168965187e-17 -0.67830899168555236 -0.73477677685030929
-1.3850500562448067 0.41285875964110363 0.28795953903188343  0.38457055427597059 -0.5871259855660399 -0.71231212670919697
-1.7337712822439113 1 0.32060342556491628  0.73477677685030851 -8.3343451540583259e-17 -0.67830899168555336
-1.712040460968117 0.61494994375519374 0.41285875964110375  0.71231212670919664 -0.38457055427597159 -0.58712598556603957
-1.8035785247401854 0.81724226648384946 0.43355391658479348  0.80405590541211858 -0.18137511328579436 -0.56621300696157051
-1.9500144830974659 0.76202597787065152 0.79790881588591056  0.94998980032413316 -0.23767767361493677 -0.2025554312900672
-1.9165290157600623 1.1129504910198773 1.3836883498990558  0.9161518901361021 0.11209598472398385 0.38483789367577603
-1.9500144830974659 0.76202597787065152 1.20209118411409  0.94998980032413283 -0.23767767361493666 0.202555431290069
-1.9165290157600623 0.88704950898012358 0.61631165010094435  0.91615189013610165 -0.1120959847239814 -0.38483789367577792
-1.9500144830974657 1.2379740221293494 0.79790881588591023  0.94998980032413294 0.23767767361493719 -0.20255543129006753
-1.5664460834152067 1.8035785247401852 0.81724226648384946  0.56621300696156995 0.80405590541211902 -0.18137511328579381
-1.8251152624882454 1.5649644268526592 1  0.82480365918097653 0.56541924604816174 3.4035776926127695e-16
-0.61631165010094424 0.083470984239937596 0.88704950898012358  -0.38483789367577803 -0.91615189013610143 -0.11209598472398227
-0.22681489975349639 0.89805158744476077 0.37520377518580433  -0.7793365693277361 -0.08592510192565847 -0.62068622392279671
-0.083470984239937707 0.88704950898012358 0.61631165010094424  -0.91615189013610143 -0.1120959847239823 -0.38483789367577798
-0.21439421228553288 0.89457789356401529 0.39128013241131548  -0.77933656932774698 -0.085925101925651531 -0.62068622392278394
-0.098941938751961223 0.76032257344343512 0.64081678241520534  -0.89982453013548314 -0.22723563663234561 -0.3723973421102113
-0.1748847375117546 0.43503557314734065 1  -0.8248036591809772 -0.56541924604816052 6.9460769236995282e-18
-0.19642147525981468 0.81724226648384946 1.5664460834152065  -0.80405590541211902 -0.18137511328579295 0.56621300696157051
-0.049985516902534055 0.76202597787065152 1.20209118411409  -0.94998980032413294 -0.23767767361493672 0.20255543129006834
-0.32060342556491639 0.26622871775608858 1  -0.67830899168555359 -0.73477677685030829 -3.8199081956100662e-16
-0.41285875964110363 0.28795953903188343 1.3850500562448067  -0.5871259855660399 -0.71231212670919697 0.38457055427597059
-1 0.32060342556491628 1.7337712822439113  -8.3343451540583259e-17 -0.67830899168555336 0.73477677685030851
-0.61494994375519374 0.41285875964110375 1.712040460968117  -0.38457055427597159 -0.58712598556603957 0.71231212670919664
-0.19642147525981479 1.1827577335161514 0.43355391658479359  -0.80405590541211847 0.18137511328579375 -0.56621300696157095
-0.049985516902534277 1.2379740221293494 0.79790881588591067  -0.94998980032413283 0.23767767361493755 -0.20255543129006789
-0.083470984239937707 0.88704950898012358 1.3836883498990558  -0.91615189013610143 -0.11209598472398105 0.38483789367577831
-0.049985516902534388 1.2379740221293494 1.20209118411409  -0.94998980032413305 0.23767767361493577 0.20255543129006892
-1.552183464309189 1.2754246841105661 1.786914649200342  0.55218785652865954 0.2754217387370686 0.78691259802682945
-1.3412681489687435 1.8276081484197548 1.4456465002315988  0.34127086350966168 0.82760959526572564 0.44564173451716987
-0.65873185103125687 1.8276081484197551 1.4456465002315988  -0.34127086350966257 0.82760959526572575 0.44564173451716904
-0.44781653569081104 1.2754246841105661 1.7869146492003423  -0.55218785652865776 0.27542173873706816 0.78691259802683089
-1.0000000000000002 0.93415653514182273 1.997829964540788  -7.6294444242543294e-17 -0.065849124772593692 0.99782959104582747
-1.0000000000000002 0.93415653514182284 0.0021700354592122384  0 -0.065849124772593678 -0.99782959104582747
-0.44781653569081092 1.2754246841105661 0.21308535079965796  -0.55218785652865854 0.2754217387370701 -0.78691259802682967
-0.65873185103125698 1.8276081484197553 0.55435349976840165  -0.34127086350966024 0.82760959526572697 -0.44564173451716849
-1.3412681489687435 1.8276081484197551 0.55435349976840154  0.34127086350966152 0.82760959526572653 -0.44564173451716826
-1.5521834643091894 1.2754246841105661 0.21308535079965818  0.55218785652865821 0.2754217387370686 -0.78691259802683033
-1.2754246841105661 0.21308535079965818 1.5521834643091894  0.27542173873706804 -0.78691259802683 0.55218785652865909
-0.93415653514182284 0.0021700354592122384 1.0000000000000002  -0.065849124772593678 -0.99782959104582747 0
-1.2754246841105661 0.21308535079965796 0.44781653569081092  0.27542173873706854 -0.78691259802682989 -0.55218785652865887
-1.8276081484197553 0.55435349976840165 0.65873185103125698  0.82760959526572697 -0.44564173451716849 -0.34127086350966024
-1.8276081484197553 0.55435349976840165 1.3412681489687435  0.82760959526572664 -0.4456417345171681 0.34127086350966146
-1.786914649200342 1.552183464309189 1.2754246841105661  0.78691259802682945 0.55218785652865954 0.2754217387370686
-0.10563529941394462 0.78429103445404746 0.61001812379817821  -0.89982453013547758 -0.22723563663234511 -0.37239734211022485
-0.0021700354592122384 1.0000000000000002 1.0658434648581778  -0.99782959104582747 0 0.065849124772594289
-0.55435349976840165 0.65873185103125698 1.8276081484197553  -0.44564173451716849 -0.34127086350966024 0.82760959526572697
-0.17239185158024528 1.4456465002315988 1.3412681489687437  -0.82760959526572597 0.4456417345171691 0.34127086350966152
-1.0000000000000002 1.0658434648581778 1.9978299645407878  0 0.06584912477259347 0.99782959104582758
-1.4456465002315988 0.65873185103125687 1.8276081484197551  0.44564173451716993 -0.34127086350966312 0.82760959526572497
-1.4456465002315988 1.3412681489687435 1.8276081484197548  0.44564173451716982 0.34127086350966168 0.82760959526572564
-1.8276081484197548 1.4456465002315988 1.3412681489687435  0.82760959526572564 0.44564173451716987 0.34127086350966168
-1.2754246841105661 1.786914649200342 1.552183464309189  0.2754217387370686 0.78691259802682945 0.55218785652865954
-1.0658434648581778 1.9978299645407878 1.0000000000000002  0.06584912477259347 0.99782959104582758 0
-0.72457531588943436 1.7869146492003418 1.5521834643091896  -0.27542173873706821 0.78691259802683022 0.55218785652865865
-0.21308535079965829 1.5521834643091896 1.2754246841105661  -0.78691259802682945 0.55218785652865909 0.27542173873706954
-0.55435349976840165 1.3412681489687435 1.8276081484197553  -0.4456417345171681 0.34127086350966146 0.82760959526572664
-0.44781653569081104 0.72457531588943436 1.7869146492003423  -0.55218785652865798 -0.27542173873706749 0.78691259802683089
-1.4456465002315988 1.3412681489687435 0.17239185158024506  0.44564173451716954 0.34127086350965968 -0.82760959526572664
-1.5521834643091892 0.72457531588943436 0.21308535079965796  0.55218785652865821 -0.27542173873706799 -0.78691259802683056
-1.0000000000000002 1.0658434648581778 0.0021700354592122384  0 0.065849124772594289 -0.99782959104582747
-0.4889881761220175 0.15304821643557709 0.85818780510941428  -0.51974293683793993 -0.84473325897900753 -0.12764403935075921
-0.55435349976840154 1.3412681489687437 0.17239185158024495  -0.44564173451716915 0.34127086350966218 -0.82760959526572586
-0.17239185158024495 1.4456465002315988 0.65873185103125698  -0.82760959526572564 0.44564173451716976 -0.3412708635096619
-0.72457531588943436 1.7869146492003423 0.44781653569081092  -0.27542173873706755 0.786912598026831 -0.55218785652865809
-0.93415653514182273 1.997829964540788 1  -0.065849124772593734 0.99782959104582747 0
-1.2754246841105661 1.7869146492003423 0.44781653569081104  0.27542173873706871 0.78691259802683 -0.55218785652865865
-1.7869146492003418 1.5521834643091896 0.72457531588943436  0.78691259802683022 0.55218785652865865 -0.27542173873706821
-1.7869146492003423 0.44781653569081104 1.2754246841105661  0.78691259802683078 -0.55218785652865787 0.27542173873706816
-1.5521834643091896 0.72457531588943436 1.7869146492003418  0.55218785652865843 -0.27542173873706949 0.78691259802682989
-1.3412681489687435 0.17239185158024517 1.4456465002315988  0.34127086350966207 -0.82760959526572531 0.44564173451716999
-0.72457531588943436 0.21308535079965796 1.5521834643091892  -0.27542173873706804 -0.78691259802683067 0.55218785652865821
-1.0658434648581778 0.0021700354592122384 1.0000000000000002  0.065849124772594289 -0.99782959104582747 0
-0.3390347444358186 0.25671454238163 0.90442701067601727  -0.67452766723137414 -0.7327939509732676 -0.089584884642381846
-1.3412681489687437 0.17239185158024495 0.55435349976840154  0.34127086350966152 -0.82760959526572664 -0.4456417345171681
-1.4456465002315988 0.65873185103125698 0.17239185158024495  0.4456417345171701 -0.34127086350966135 -0.82760959526572564
-1.7869146492003423 0.44781653569081104 0.72457531588943436  0.78691259802683089 -0.55218785652865798 -0.27542173873706749
-1.997829964540788 1.0000000000000002 0.93415653514182273  0.99782959104582747 0 -0.065849124772593734
-1.9978299645407878 1.0000000000000002 1.0658434648581778  0.99782959104582758 0 0.06584912477259347
-1.8276081484197551 1.4456465002315988 0.65873185103125687  0.82760959526572575 0.44564173451716904 -0.34127086350966257
-0.32286639405373108 0.271410708194047 0.90595336478045685  -0.67452766723137181 -0.73279395097326983 -0.089584884642381429
-0.37520377518580433 0.22681489975349645 0.89805158744476099  -0.62068622392278694 -0.77933656932774453 -0.085925101925651837
-0.39128013241131554 0.21439421228553296 0.89457789356401551  -0.62068622392278161 -0.77933656932774842 -0.085925101925655431
-0.21308535079965796 0.44781653569081092 1.2754246841105661  -0.78691259802682989 -0.55218785652865887 0.27542173873706854
-0.17239185158024495 0.55435349976840154 1.3412681489687437  -0.82760959526572664 -0.4456417345171681 0.34127086350966152
-0.65873185103125698 0.17239185158024495 1.4456465002315988  -0.34127086350966135 -0.82760959526572564 0.4456417345171701
-0.21308535079965796 1.5521834643091892 0.72457531588943436  -0.78691259802683078 0.55218785652865821 -0.27542173873706777
-0.0021700354592122384 1.0000000000000002 0.93415653514182284  -0.99782959104582747 0 -0.065849124772593678
-1.2610542694501152 1.6345776112372217 1.7274351680516471  0.26123864468751945 0.63469945426951213 0.72726265769102394
-1.1186983640546238 1.2618850124125609 1.9577718614808168  0.11873329660574328 0.26161560941278683 0.9578411544659734
-0.93100371799927484 1.7532759752918454 1.6540755446568809  -0.069124135183107907 0.7534327508752533 0.65388144479235366
-1.3036963168239359 1.5229392818626755 1.7964314500523726  0.30395970967362101 0.52285425410030451 0.79638679287412995
-0.69630368317606461 1.5229392818626757 1.7964314500523726  -0.30395970967362018 0.52285425410030428 0.79638679287413039
-1.0689962820007257 1.7532759752918454 1.6540755446568809  0.069124135183106533 0.75343275087525341 0.65388144479235377
-0.88130163594537692 1.2618850124125609 1.9577718614808168  -0.11873329660574362 0.26161560941278666 0.9578411544659734
-0.73894573054988544 1.6345776112372219 1.7274351680516471  -0.2612386446875189 0.63469945426951158 0.72726265769102461
-1.2303366934291702 1.3308812944132862 1.9151298141069959  0.23057849677494968 0.33073974459589323 0.91512008947987133
-0.76966330657083071 1.3308812944132864 1.9151298141069959  -0.23057849677494727 0.33073974459589128 0.91512008947987278
-0.7696633065708306 1.3308812944132864 0.084870185893004102  -0.23057849677494846 0.33073974459589056 -0.91512008947987278
-1.2303366934291695 1.3308812944132864 0.084870185893004102  0.23057849677494913 0.33073974459589173 -0.91512008947987211
-0.73894573054988522 1.6345776112372219 0.27256483194835279  -0.26123864468751884 0.63469945426951091 -0.72726265769102516
-0.88130163594537714 1.2618850124125609 0.042228138519183167  -0.11873329660574164 0.26161560941278661 -0.95784115446597373
-1.0689962820007257 1.7532759752918454 0.34592445534311911  0.069124135183105159 0.75343275087525352 -0.65388144479235366
-0.6963036831760645 1.5229392818626757 0.20356854994762752  -0.30395970967362029 0.52285425410030351 -0.79638679287413072
-1.3036963168239355 1.5229392818626759 0.20356854994762763  0.30395970967362085 0.52285425410030362 -0.7963867928741305
-0.93100371799927484 1.7532759752918454 0.34592445534311911  -0.069124135183105534 0.75343275087525263 -0.65388144479235466
-1.1186983640546233 1.2618850124125609 0.042228138519183167  0.11873329660574364 0.26161560941278567 -0.95784115446597373
-1.2610542694501152 1.6345776112372221 0.27256483194835313  0.26123864468751828 0.63469945426951246 -0.72726265769102405
-1.2618850124125609 0.042228138519183167 1.1186983640546233  0.26161560941278567 -0.95784115446597373 0.11873329660574364
-1.6345776112372221 0.27256483194835313 1.2610542694501152  0.63469945426951224 -0.72726265769102416 0.2612386446875184
-1.3308812944132864 0.084870185893004102 0.7696633065708306  0.33073974459589056 -0.91512008947987278 -0.23057849677494846
-1.3308812944132866 0.084870185893004213 1.2303366934291695  0.33073974459589012 -0.91512008947987278 0.23057849677494896
-1.6345776112372219 0.27256483194835279 0.73894573054988522  0.63469945426951102 -0.72726265769102538 -0.26123864468751817
-1.2618850124125609 0.042228138519183167 0.88130163594537714  0.26161560941278661 -0.95784115446597373 -0.11873329660574164
-1.7532759752918454 0.34592445534311911 1.0689962820007257  0.75343275087525352 -0.65388144479235366 0.069124135183105159
-1.5229392818626757 0.20356854994762752 0.69630368317606439  0.52285425410030506 -0.79638679287412995 -0.30395970967361963
-1.5229392818626759 0.20356854994762763 1.3036963168239355  0.52285425410030439 -0.79638679287413017 0.30395970967362029
-1.7532759752918454 0.34592445534311911 0.93100371799927484  0.75343275087525263 -0.65388144479235466 -0.069124135183105534
-1.7274351680516471 1.2610542694501152 1.6345776112372219  0.72726265769102394 0.26123864468751956 0.63469945426951202
-1.9577718614808168 1.1186983640546238 1.2618850124125609  0.9578411544659734 0.11873329660574189 0.26161560941278761
-0.88130163594537692 0.73811498758743943 0.042228138519183056  -0.11873329660574239 -0.26161560941278583 -0.95784115446597384
-0.093116941936638636 0.70892487408416871 0.69813515078208488  -0.90562084821138567 -0.3068782679831335 -0.29270566773563267
-0.084870185893004102 1.2303366934291702 0.66911870558671405  -0.91512008947987167 0.2305784967749494 -0.33073974459589267
-0.084870185893003991 0.7696633065708306 0.66911870558671405  -0.91512008947987267 -0.23057849677494854 -0.33073974459589062
-0.34592445534311922 1.0689962820007257 1.7532759752918454  -0.65388144479235377 0.069124135183105173 0.75343275087525341
-0.20356854994762752 0.69630368317606439 1.5229392818626757  -0.79638679287412995 -0.30395970967361963 0.52285425410030506
-0.47706071813732487 1.7964314500523728 1.3036963168239355  -0.52285425410030451 0.79638679287413061 0.30395970967361896
-0.24672402470815469 1.6540755446568811 0.93100371799927484  -0.7534327508752533 0.65388144479235388 -0.069124135183105853
-0.7696633065708306 0.66911870558671405 1.9151298141069959  -0.23057849677494704 -0.33073974459588984 0.91512008947987322
-1.2303366934291695 0.66911870558671405 1.9151298141069959  0.23057849677494729 -0.33073974459589001 0.91512008947987311
-1.7964314500523726 0.69630368317606461 1.5229392818626757  0.79638679287413161 -0.30395970967361863 0.52285425410030317
-1.6540755446568807 1.0689962820007257 1.7532759752918454  0.65388144479235377 0.069124135183105298 0.75343275087525352
-1.6540755446568809 0.93100371799927484 1.7532759752918454  0.65388144479235366 -0.069124135183107907 0.7534327508752533
-1.7964314500523724 1.3036963168239359 1.5229392818626757  0.79638679287413128 0.30395970967361957 0.52285425410030317
-1.7532759752918454 1.6540755446568809 0.93100371799927484  0.75343275087525341 0.65388144479235366 -0.069124135183107907
-1.5229392818626755 1.7964314500523726 1.3036963168239359  0.52285425410030451 0.79638679287412995 0.30395970967362101
-1.6345776112372219 1.7274351680516471 1.2610542694501152  0.63469945426951224 0.72726265769102383 0.26123864468751951
-1.2618850124125609 1.9577718614808168 1.1186983640546238  0.26161560941278761 0.9578411544659734 0.11873329660574189
-0.66911870558671405 1.9151298141069959 0.76966330657083049  -0.33073974459588978 0.91512008947987333 -0.23057849677494716
-0.66911870558671405 1.9151298141069959 1.2303366934291695  -0.33073974459589001 0.91512008947987311 0.23057849677494729
-0.73811498758743943 1.9577718614808171 1.1186983640546233  -0.26161560941278694 0.9578411544659734 0.11873329660574256
-0.36542238876277822 1.7274351680516471 1.2610542694501152  -0.63469945426950991 0.72726265769102549 0.26123864468752028
-0.042228138519183167 1.1186983640546233 1.2618850124125609  -0.95784115446597373 0.11873329660574364 0.26161560941278567
-0.27256483194835313 1.2610542694501152 1.6345776112372221  -0.72726265769102483 0.26123864468751878 0.63469945426951146
-0.20356854994762763 1.3036963168239355 1.5229392818626759  -0.79638679287413039 0.30395970967362002 0.52285425410030417
-0.34592445534311911 0.93100371799927484 1.7532759752918454  -0.65388144479235477 -0.069124135183105548 0.75343275087525263
-0.73894573054988544 0.36542238876277811 1.7274351680516471  -0.2612386446875189 -0.63469945426951069 0.72726265769102549
-0.88130163594537703 0.73811498758743976 1.9577718614808171  -0.11873329660574437 -0.26161560941278605 0.95784115446597351
-1.796431450052373 1.3036963168239355 0.47706071813732487  0.79638679287413061 0.30395970967361896 -0.52285425410030451
-1.6540755446568811 0.93100371799927484 0.24672402470815469  0.65388144479235388 -0.069124135183105853 -0.7534327508752533
-1.2610542694501152 0.36542238876277799 0.27256483194835313  0.26123864468751856 -0.63469945426951135 -0.72726265769102494
-1.1186983640546238 0.73811498758743954 0.042228138519183167  0.11873329660574192 -0.26161560941278578 -0.95784115446597384
-1.2303366934291702 0.66911870558671405 0.084870185893004102  0.23057849677494952 -0.33073974459589195 -0.91512008947987189
-0.7696633065708306 0.66911870558671405 0.084870185893003991  -0.23057849677494849 -0.33073974459589001 -0.91512008947987289
-0.093588483842681203 0.68777595190194329 0.71884915497263779  -0.90562084821138322 -0.30687826798314966 -0.29270566773562301
-0.345924455343119 1.0689962820007257 0.24672402470815469  -0.65388144479235411 0.069124135183104896 -0.7534327508752533
-0.345924455343119 0.93100371799927484 0.24672402470815469  -0.65388144479235411 -0.06912413518310527 -0.75343275087525319
-0.20356854994762752 1.3036963168239362 0.47706071813732454  -0.79638679287412961 0.30395970967362035 -0.52285425410030539
-0.24672402470815469 1.6540755446568811 1.0689962820007257  -0.75343275087525374 0.65388144479235344 0.069124135183105659
-0.47706071813732487 1.7964314500523728 0.6963036831760645  -0.52285425410030473 0.79638679287413039 -0.30395970967361946
-0.36542238876277799 1.7274351680516471 0.73894573054988533  -0.63469945426951047 0.72726265769102516 -0.26123864468751962
-0.73811498758743976 1.9577718614808171 0.88130163594537658  -0.26161560941278594 0.95784115446597362 -0.11873329660574408
-1.3308812944132862 1.9151298141069959 1.2303366934291702  0.33073974459589323 0.91512008947987145 0.23057849677494968
-1.3308812944132866 1.9151298141069959 0.76966330657083049  0.33073974459589062 0.91512008947987233 -0.23057849677494996
-1.2618850124125609 1.9577718614808168 0.88130163594537692  0.26161560941278672 0.9578411544659734 -0.11873329660574344
-1.6345776112372219 1.7274351680516471 0.73894573054988544  0.63469945426951158 0.72726265769102461 -0.2612386446875189
-1.9577718614808171 1.1186983640546233 0.73811498758743943  0.9578411544659734 0.1187332966057424 -0.26161560941278705
-1.7274351680516471 1.2610542694501152 0.36542238876277822  0.72726265769102549 0.26123864468752028 -0.63469945426950991
-1.9577718614808168 0.88130163594537692 1.2618850124125609  0.9578411544659734 -0.11873329660574362 0.26161560941278666
-1.7274351680516471 0.73894573054988544 1.6345776112372219  0.72726265769102461 -0.2612386446875189 0.63469945426951158
-1.1186983640546233 0.73811498758743943 1.9577718614808171  0.11873329660574403 -0.26161560941278617 0.95784115446597351
-1.2610542694501152 0.36542238876277833 1.7274351680516471  0.26123864468752028 -0.63469945426950991 0.7272626576910256
-1.3036963168239355 0.47706071813732487 1.796431450052373  0.30395970967361896 -0.52285425410030451 0.79638679287413061
-0.93100371799927484 0.24672402470815469 1.6540755446568811  -0.069124135183105853 -0.7534327508752533 0.65388144479235388
-0.36542238876277799 0.27256483194835313 1.2610542694501152  -0.63469945426951102 -0.72726265769102472 0.26123864468751967
-0.73811498758743976 0.042228138519183056 1.1186983640546238  -0.26161560941278561 -0.95784115446597395 0.11873329660574193
-0.66911870558671405 0.084870185893004102 1.2303366934291702  -0.33073974459589267 -0.91512008947987167 0.2305784967749494
-0.66911870558671394 0.084870185893003991 0.76966330657083049  -0.33073974459589167 -0.91512008947987178 -0.23057849677495032
-0.89805158744476088 0.37520377518580417 0.22681489975349667  -0.08592510192565074 -0.62068622392278905 -0.77933656932774298
-1.0689962820007257 0.24672402470815469 0.345924455343119  0.069124135183104896 -0.7534327508752533 -0.65388144479235411
-0.93100371799927484 0.24672402470815469 0.345924455343119  -0.069124135183105631 -0.75343275087525308 -0.65388144479235422
-1.3036963168239362 0.47706071813732476 0.20356854994762752  0.30395970967362101 -0.52285425410030562 -0.79638679287412917
-1.6540755446568811 1.0689962820007257 0.24672402470815469  0.65388144479235344 0.069124135183105659 -0.75343275087525374
-1.796431450052373 0.6963036831760645 0.47706071813732487  0.79638679287413039 -0.30395970967361946 -0.52285425410030462
-1.7274351680516471 0.73894573054988533 0.36542238876277799  0.72726265769102538 -0.26123864468751895 -0.63469945426951069
-1.9577718614808171 0.88130163594537703 0.73811498758743976  0.95784115446597362 -0.11873329660574432 -0.26161560941278583
-1.9151298141069959 1.2303366934291702 1.3308812944132862  0.91512008947987133 0.23057849677494968 0.33073974459589323
-1.9151298141069959 0.76966330657083071 1.3308812944132864  0.91512008947987322 -0.23057849677494754 0.33073974459588967
-1.9151298141069959 0.7696633065708306 0.66911870558671405  0.91512008947987333 -0.23057849677494707 -0.3307397445958899
-1.9151298141069959 1.2303366934291695 0.66911870558671405  0.91512008947987311 0.23057849677494729 -0.33073974459589001
-1.5229392818626757 1.7964314500523726 0.69630368317606461  0.52285425410030406 0.79638679287413117 -0.30395970967361852
-1.7532759752918454 1.6540755446568809 1.0689962820007257  0.75343275087525341 0.65388144479235377 0.069124135183106533
-0.73811498758743943 0.042228138519183056 0.88130163594537692  -0.26161560941278494 -0.95784115446597418 -0.11873329660574088
-0.89457789356401518 0.39128013241131554 0.21439421228553296  -0.08592510192565278 -0.62068622392278505 -0.77933656932774587
-0.042228138519183056 0.88130163594537692 0.73811498758743943  -0.95784115446597384 -0.11873329660574239 -0.26161560941278583
-0.66455433327713243 0.095362650095153129 0.74011618472454044  -0.35458300388089825 -0.89704722922209201 -0.26377483182397543
-0.095362650095153129 0.74011618472454033 0.66455433327713254  -0.8970472292220929 -0.26377483182397399 -0.35458300388089697
-0.24672402470815469 0.345924455343119 1.0689962820007257  -0.7534327508752533 -0.65388144479235411 0.069124135183104896
-0.27256483194835279 0.73894573054988522 1.6345776112372219  -0.72726265769102538 -0.26123864468751817 0.63469945426951102
-0.042228138519183167 0.88130163594537714 1.2618850124125609  -0.95784115446597373 -0.11873329660574164 0.26161560941278661
-0.24672402470815469 0.345924455343119 0.93100371799927484  -0.75343275087525319 -0.65388144479235422 -0.069124135183104271
-0.47706071813732465 0.20356854994762741 1.3036963168239364  -0.52285425410030584 -0.79638679287412883 0.30395970967362151
-1.0689962820007257 0.24672402470815469 1.6540755446568811  0.069124135183105659 -0.75343275087525374 0.65388144479235344
-0.6963036831760645 0.47706071813732487 1.796431450052373  -0.30395970967361957 -0.52285425410030428 0.79638679287413061
-0.27256483194835313 1.2610542694501152 0.36542238876277799  -0.72726265769102494 0.26123864468751856 -0.63469945426951135
-0.042228138519183056 1.1186983640546238 0.73811498758743976  -0.95784115446597395 0.11873329660574193 -0.26161560941278561
-0.084870185893004102 0.7696633065708306 1.3308812944132864  -0.91512008947987267 -0.23057849677494843 0.33073974459589051
-0.084870185893004213 1.2303366934291695 1.3308812944132866  -0.91512008947987222 0.23057849677494877 0.33073974459589162
-1.6135385194857188 1.4604717807940106 1.6415108917233323  0.6138235908938624 0.46011525660260011 0.6414939983380108
-1.4215187719833615 1.4686357350626609 1.7763391479810346  0.42177409750733502 0.46868822204941951 0.77616877106981519
-1.1378197789939481 1.9248367469837331 1.3545175594333883  0.13818785834076686 0.92488389215866984 0.35425118465944799
-1.1392917641443467 1.815235707638635 1.5621285844293009  0.1392430127504716 0.81541586445899106 0.5618793032215802
-0.47163878825454009 1.6834688675282172 1.5036911127293844  -0.52841879760671073 0.68370790823052197 0.50330613999724094
-0.66456827261077844 1.6940145438011469 1.6370473838366881  -0.33571718293160879 0.69398814937561715 0.6369257583193435
-0.53563503381027788 1.0699303480424984 1.8828787711788482  -0.4647686355560689 0.069884317336660604 0.88266998226615745
-0.65340002742402636 1.2724957718177858 1.8975603118185225  -0.3467276424095731 0.2722140518682809 0.89759648615318899
-1.2413678794555165 0.9321105690485505 1.9680560789191066  0.24117598392814818 -0.068303541004110763 0.9680747755533089
-1.1212211638374885 1.1332040076734393 1.9836473564126622  0.1214277150833757 0.13297103911780997 0.98365340072891549
-0.75863212054448437 0.9321105690485505 0.031943921080893056  -0.24117598392814793 -0.068303541004109389 -0.96807477555330901
-0.87877883616251229 1.1332040076734393 0.016352643587337568  -0.12142771508337222 0.1329710391178095 -0.98365340072891605
-0.3864614805142812 1.4604717807940109 0.35848910827666791  -0.61382359089386196 0.46011525660260205 -0.6414939983380098
-0.57848122801663848 1.4686357350626613 0.22366085201896579  -0.42177409750733397 0.46868822204941757 -0.77616877106981685
-0.86218022100605274 1.9248367469837333 0.64548244056661219  -0.13818785834076858 0.9248838921586704 -0.35425118465944572
-0.86070823585565392 1.8152357076386352 0.4378714155706992  -0.13924301275047188 0.81541586445899139 -0.56187930322157942
-1.5283612117454606 1.6834688675282172 0.49630888727061606  0.52841879760671129 0.68370790823052285 -0.50330613999723905
-1.335431727389222 1.6940145438011469 0.3629526161633122  0.33571718293160868 0.69398814937561693 -0.63692575831934384
-1.4643649661897227 1.0699303480424984 0.11712122882115183  0.46476863555606979 0.069884317336660118 -0.88266998226615712
-1.3465999725759743 1.2724957718177858 0.10243968818147775  0.34672764240957221 0.27221405186828318 -0.89759648615318866
-1.0699303480424984 0.11712122882115183 1.4643649661897227  0.069884317336659743 -0.88266998226615745 0.46476863555606923
-1.2724957718177858 0.10243968818147775 1.3465999725759745  0.27221405186828257 -0.89759648615318877 0.34672764240957232
-0.9321105690485505 0.031943921080893056 0.75863212054448437  -0.068303541004109278 -0.96807477555330901 -0.24117598392814815
-1.1332040076734393 0.016352643587337568 0.87877883616251229  0.13297103911780989 -0.98365340072891594 -0.12142771508337287
-1.4604717807940109 0.35848910827666791 0.38646148051428109  0.46011525660260194 -0.64149399833800969 -0.61382359089386218
-1.4686357350626613 0.22366085201896579 0.57848122801663837  0.46868822204941835 -0.77616877106981552 -0.42177409750733547
-1.9248367469837333 0.64548244056661219 0.86218022100605274  0.9248838921586704 -0.35425118465944577 -0.13818785834076816
-1.8152357076386352 0.4378714155706992 0.86070823585565392  0.8154158644589915 -0.56187930322157942 -0.13924301275047188
-1.6834688675282172 0.49630888727061606 1.5283612117454606  0.68370790823052241 -0.5033061399972395 0.52841879760671151
-1.6940145438011469 0.3629526161633122 1.335431727389222  0.69398814937561693 -0.63692575831934384 0.33571718293160868
-1.6415108917233321 1.6135385194857186 1.4604717807940111  0.64149399833800913 0.61382359089386218 0.46011525660260266
-1.7763391479810346 1.4215187719833615 1.4686357350626609  0.77616877106981519 0.42177409750733574 0.4686882220494189
-0.53563503381027777 0.93006965195750191 0.11712122882115172  -0.46476863555606868 -0.069884317336659479 -0.88266998226615778
-0.17583413883161547 0.44878045857535925 0.87541500307784514  -0.83926746233111538 -0.53130823737480382 -0.11550620576388627
-0.031943921080893389 1.2413678794555165 1.0678894309514502  -0.96807477555330868 0.24117598392814926 0.068303541004109306
-0.016352643587337568 1.1212211638374885 0.86679599232656146  -0.98365340072891605 0.12142771508337268 -0.13297103911780872
-0.64548244056661219 0.86218022100605274 1.9248367469837333  -0.35425118465944655 -0.13818785834076672 0.9248838921586704
-0.43787141557069909 0.86070823585565392 1.8152357076386352  -0.56187930322157953 -0.13924301275047185 0.8154158644589915
-0.31653113247178344 1.5036911127293846 1.5283612117454608  -0.68370790823052163 0.50330613999723994 0.52841879760671195
-0.30598545619885331 1.6370473838366881 1.335431727389222  -0.69398814937561626 0.63692575831934395 0.33571718293160996
-0.75863212054448415 1.0678894309514502 1.9680560789191068  -0.24117598392814935 0.068303541004109944 0.96807477555330868
-0.87877883616251218 0.86679599232656135 1.9836473564126624  -0.12142771508337401 -0.13297103911781055 0.98365340072891572
-1.5036911127293844 0.47163878825454009 1.6834688675282172  0.50330613999724028 -0.52841879760671029 0.68370790823052274
-1.6370473838366881 0.66456827261077844 1.6940145438011469  0.6369257583193435 -0.33571718293160879 0.69398814937561715
-1.3545175594333883 1.1378197789939481 1.9248367469837331  0.35425118465944705 0.13818785834076788 0.92488389215866984
-1.5621285844293009 1.1392917641443467 1.815235707638635  0.5618793032215792 0.13924301275047099 0.81541586445899183
-1.9248367469837331 1.3545175594333883 1.1378197789939481  0.92488389215867006 0.35425118465944716 0.13818785834076641
-1.815235707638635 1.5621285844293009 1.1392917641443467  0.81541586445899106 0.5618793032215802 0.1392430127504716
-1.4604717807940113 1.6415108917233316 1.6135385194857188  0.46011525660260288 0.64149399833800991 0.61382359089386129
-1.4686357350626609 1.7763391479810346 1.4215187719833615  0.46868822204941951 0.77616877106981519 0.42177409750733502
-1.0678894309514502 1.9680560789191066 0.75863212054448392  0.068303541004111568 0.9680747755533089 -0.24117598392814785
-0.86679599232656135 1.9836473564126624 0.87877883616251218  -0.13297103911780978 0.98365340072891594 -0.12142771508337255
-0.93006965195750202 1.8828787711788482 1.4643649661897225  -0.069884317336659313 0.88266998226615656 0.4647686355560709
-0.72750422818221505 1.8975603118185225 1.3465999725759743  -0.27221405186828301 0.89759648615318843 0.34672764240957316
-0.11712122882115183 1.4643649661897227 1.0699303480424984  -0.88266998226615745 0.46476863555606934 0.069884317336659701
-0.10243968818147775 1.3465999725759745 1.2724957718177858  -0.89759648615318877 0.34672764240957232 0.27221405186828257
-0.49630888727061606 1.5283612117454606 1.6834688675282172  -0.50330613999724017 0.52841879760671207 0.68370790823052141
-0.3629526161633122 1.335431727389222 1.6940145438011469  -0.6369257583193435 0.33571718293161068 0.69398814937561626
-0.3864614805142812 0.53952821920598926 1.6415108917233321  -0.61382359089386196 -0.46011525660260144 0.64149399833801024
-0.5784812280166387 0.53136426493733957 1.7763391479810346  -0.42177409750733463 -0.46868822204941818 0.77616877106981619
-1.5036911127293848 1.5283612117454606 0.31653113247178333  0.5033061399972405 0.52841879760671251 -0.68370790823052086
-1.6370473838366881 1.335431727389222 0.30598545619885331  0.63692575831934384 0.33571718293160879 -0.69398814937561693
-1.613538519485719 0.53952821920598926 0.35848910827666802  0.61382359089386251 -0.46011525660260244 -0.64149399833800902
-1.421518771983362 0.53136426493733913 0.22366085201896568  0.42177409750733486 -0.46868822204941879 -0.77616877106981574
-1.2413678794555163 1.0678894309514502 0.031943921080893389  0.24117598392814787 0.068303541004110027 -0.96807477555330901
-1.1212211638374885 0.86679599232656113 0.016352643587337568  0.12142771508337334 -0.13297103911780936 -0.98365340072891594
-0.15717574894030886 0.48126519958548875 0.86156266551879135  -0.83926746233111915 -0.53130823737479094 -0.11550620576391649
-0.85145286645038376 0.14564781357706019 0.50275426427774228  -0.18463389628076177 -0.84903903628469379 -0.49501822108781335
-0.64548244056661241 1.1378197789939481 0.075163253016266696  -0.35425118465944572 0.1381878583407696 -0.92488389215867017
-0.43787141557069942 1.1392917641443465 0.18476429236136482  -0.56187930322157997 0.13924301275047202 -0.81541586445899095
-0.075163253016266807 1.3545175594333883 0.86218022100605274  -0.92488389215867006 0.35425118465944622 -0.13818785834076866
-0.18476429236136493 1.5621285844293009 0.86070823585565404  -0.81541586445899084 0.56187930322158064 -0.13924301275047107
-0.53952821920598926 1.6415108917233321 0.3864614805142812  -0.46011525660260083 0.64149399833801002 -0.61382359089386263
-0.53136426493733957 1.7763391479810346 0.5784812280166387  -0.46868822204941873 0.77616877106981597 -0.42177409750733447
-0.9321105690485505 1.9680560789191066 1.2413678794555165  -0.068303541004110763 0.9680747755533089 0.24117598392814818
-1.1332040076734391 1.9836473564126622 1.1212211638374885  0.13297103911780886 0.98365340072891583 0.1214277150833741
-1.0699303480424984 1.8828787711788482 0.53563503381027788  0.069884317336660604 0.88266998226615756 -0.46476863555606895
-1.2724957718177858 1.8975603118185225 0.65340002742402592  0.27221405186828351 0.89759648615318866 -0.34672764240957199
-1.8828787711788482 1.4643649661897225 0.93006965195750202  0.88266998226615645 0.4647686355560709 -0.069884317336659341
-1.8975603118185225 1.3465999725759743 0.72750422818221505  0.89759648615318843 0.34672764240957316 -0.27221405186828301
-1.8828787711788482 0.53563503381027788 1.0699303480424984  0.88266998226615767 -0.46476863555606868 0.069884317336660798
-1.8975603118185225 0.65340002742402636 1.2724957718177858  0.89759648615318977 -0.34672764240957188 0.27221405186828018
-1.4643649661897225 0.93006965195750202 1.8828787711788482  0.46476863555607095 -0.069884317336659341 0.88266998226615656
-1.3465999725759743 0.72750422818221505 1.8975603118185225  0.34672764240957316 -0.27221405186828301 0.89759648615318843
-1.5283612117454606 0.31653113247178333 1.5036911127293848  0.5284187976067124 -0.68370790823052108 0.50330613999724028
-1.335431727389222 0.30598545619885331 1.6370473838366881  0.33571718293160879 -0.69398814937561693 0.63692575831934384
-0.53952821920598926 0.35848910827666802 1.613538519485719  -0.46011525660260294 -0.64149399833800935 0.61382359089386185
-0.53136426493733913 0.22366085201896568 1.421518771983362  -0.46868822204941873 -0.77616877106981563 0.4217740975073348
-1.0678894309514502 0.031943921080893389 1.2413678794555163  0.06830354100410925 -0.96807477555330868 0.24117598392814921
-0.86679599232656146 0.016352643587337568 1.1212211638374885  -0.13297103911780872 -0.98365340072891605 0.12142771508337268
-0.56789366986248413 0.81389356246462441 0.11874744154864894  -0.42585755017737392 -0.18423339416733742 -0.88583486239282094
-0.74644278217951743 0.096124922711889466 0.65746189559341328  -0.22824258748330262 -0.90894237800239763 -0.34889693998410698
-1.1378197789939481 0.075163253016266696 0.64548244056661241  0.13818785834076924 -0.92488389215866995 -0.35425118465944633
-1.1392917641443465 0.18476429236136482 0.43787141557069942  0.13924301275047202 -0.81541586445899095 -0.56187930322157997
-1.3545175594333883 0.86218022100605274 0.075163253016266807  0.35425118465944599 -0.13818785834077008 -0.92488389215866995
-1.5621285844293009 0.86070823585565404 0.18476429236136482  0.56187930322158064 -0.1392430127504711 -0.81541586445899084
-1.6415108917233321 0.3864614805142812 0.53952821920598926  0.64149399833801024 -0.61382359089386196 -0.46011525660260144
-1.7763391479810346 0.5784812280166387 0.53136426493733957  0.77616877106981585 -0.42177409750733486 -0.46868822204941835
-1.9680560789191066 1.2413678794555165 0.9321105690485505  0.9680747755533089 0.24117598392814818 -0.068303541004110763
-1.9836473564126622 1.1212211638374885 1.1332040076734393  0.98365340072891549 0.1214277150833757 0.13297103911780997
-1.9680560789191066 0.75863212054448415 1.0678894309514502  0.96807477555330879 -0.24117598392814829 0.06830354100411086
-1.9836473564126624 0.87877883616251218 0.86679599232656135  0.98365340072891572 -0.12142771508337397 -0.13297103911781066
-1.6834688675282172 1.5036911127293844 0.47163878825454009  0.68370790823052274 0.50330613999724028 -0.52841879760671029
-1.6940145438011469 1.6370473838366881 0.66456827261077844  0.69398814937561726 0.6369257583193435 -0.33571718293160879
-0.93006965195750191 0.11712122882115172 0.53563503381027777  -0.069884317336659479 -0.88266998226615778 -0.46476863555606868
-0.77156308049914157 0.10155294642477924 0.62688758712066828  -0.22824258748330201 -0.90894237800239752 -0.34889693998410765
-0.11712122882115172 0.53563503381027777 0.93006965195750191  -0.88266998226615778 -0.46476863555606868 -0.069884317336659466
-0.90494753379947435 0.26218372058148803 0.33295004022963903  -0.091975091050970403 -0.72651404777911677 -0.68096837004795541
-0.90687073458352596 0.28910030252843322 0.30397342055421106  -0.091975091050969376 -0.72651404777911188 -0.68096837004796074
-0.87541500307784514 0.17583413883161553 0.44878045857535925  -0.11550620576389015 -0.83926746233111826 -0.53130823737479815
-0.35848910827666802 0.3864614805142812 1.4604717807940109  -0.64149399833800957 -0.61382359089386229 0.46011525660260189
-0.22366085201896579 0.57848122801663837 1.4686357350626613  -0.77616877106981552 -0.42177409750733547 0.46868822204941835
-0.075163253016266807 0.64548244056661219 1.1378197789939481  -0.92488389215867006 -0.35425118465944611 0.13818785834076958
-0.18476429236136482 0.43787141557069942 1.1392917641443465  -0.81541586445899095 -0.56187930322157997 0.13924301275047202
-0.86218022100605274 0.075163253016266807 1.3545175594333883  -0.13818785834077008 -0.92488389215866995 0.35425118465944599
-0.86070823585565404 0.18476429236136493 1.5621285844293009  -0.13924301275047107 -0.81541586445899084 0.56187930322158064
-0.35848910827666813 1.613538519485719 0.53952821920598937  -0.64149399833800946 0.61382359089386185 -0.4601152566026025
-0.22366085201896579 1.4215187719833617 0.53136426493733901  -0.77616877106981574 0.42177409750733497 -0.4686882220494184
-0.031943921080893167 0.75863212054448415 0.9321105690485505  -0.9680747755533089 -0.24117598392814821 -0.068303541004108889
-0.016352643587337568 0.87877883616251229 1.1332040076734393  -0.98365340072891594 -0.12142771508337287 0.13297103911780989
-1.0616533189164057 1.5950160035539049 1.8013456331579596  0.062410317894398326 0.59583045652862732 0.80068159669946692
-1.2133191789074431 1.4533759437953908 1.8654161897595243  0.2140314567980553 0.45308829251399929 0.86539097215515881
-1.2413678794555163 1.0678894309514497 1.9680560789191066  0.24117598392814793 0.068303541004110568 0.9680747755533089
-1.3465999725759743 1.2724957718177854 1.8975603118185225  0.34672764240957316 0.27221405186828523 0.89759648615318766
-0.93834668108359465 1.5950160035539049 1.8013456331579598  -0.062410317894397521 0.59583045652862732 0.80068159669946692
-1.1318385030170197 1.6666951227028342 1.7335776867425046  0.1322787149628544 0.66711974931205453 0.73311225719230577
-1.5036911127293844 1.5283612117454601 1.683468867528217  0.50330613999724128 0.52841879760671084 0.68370790823052163
-1.335431727389222 1.6940145438011469 1.6370473838366881  0.33571718293160741 0.69398814937561792 0.63692575831934339
-0.9002428344740192 1.4952588380279237 1.8629989520743653  -0.10098201560182218 0.49484844092680796 0.86309191459386347
-0.86816149698298051 1.6666951227028339 1.7335776867425046  -0.13227871496285329 0.66711974931205487 0.73311225719230577
-1.0699303480424984 1.8828787711788482 1.4643649661897227  0.069884317336660284 0.88266998226615667 0.46476863555607056
-0.86070823585565392 1.8152357076386347 1.5621285844293014  -0.13924301275046991 0.81541586445898995 0.56187930322158208
-1.0000000000000002 1.4336055191115187 1.9011027986839406  0 0.4324381230324067 0.901663612301289
-0.78668082109255699 1.453375943795391 1.8654161897595243  -0.21403145679805691 0.45308829251399974 0.86539097215515826
-0.53952821920598959 1.6415108917233323 1.6135385194857188  -0.46011525660260089 0.64149399833800969 0.61382359089386296
-0.57848122801663893 1.4686357350626611 1.7763391479810344  -0.42177409750733436 0.46868822204941818 0.77616877106981641
-1.099757165525981 1.4952588380279241 1.8629989520743653  0.10098201560182252 0.4948484409268068 0.86309191459386403
-1 1.3215374407783715 1.9468968656499477  0 0.32080957755114675 0.94714371399036101
-0.6454824405666123 1.1378197789939481 1.9248367469837333  -0.35425118465944627 0.13818785834077046 0.92488389215866984
-0.87877883616251218 1.1332040076734395 1.9836473564126624  -0.12142771508337412 0.132971039117811 0.98365340072891561
-0.9002428344740192 1.4952588380279244 0.13700104792563483  -0.1009820156018217 0.49484844092680591 -0.86309191459386458
-1.0000000000000002 1.3215374407783713 0.053103134350052095  0 0.32080957755114586 -0.94714371399036135
-1.354517559433388 1.1378197789939481 0.075163253016267029  0.35425118465944716 0.13818785834076946 -0.92488389215866962
-1.1212211638374883 1.1332040076734395 0.01635264358733779  0.12142771508337433 0.13297103911781027 -0.98365340072891572
-0.93834668108359476 1.5950160035539049 0.19865436684204019  -0.062410317894396827 0.59583045652862898 -0.8006815966994657
-0.78668082109255688 1.453375943795391 0.13458381024047572  -0.21403145679805741 0.45308829251400018 -0.86539097215515792
-0.75863212054448437 1.0678894309514497 0.031943921080893056  -0.24117598392814799 0.068303541004109902 -0.96807477555330901
-0.65340002742402614 1.2724957718177854 0.10243968818147742  -0.34672764240957199 0.27221405186828196 -0.8975964861531891
-1.0616533189164057 1.5950160035539047 0.19865436684204019  0.062410317894397195 0.59583045652862876 -0.80068159669946581
-0.86816149698298051 1.6666951227028342 0.26642231325749555  -0.13227871496285282 0.66711974931205509 -0.73311225719230555
-0.49630888727061584 1.5283612117454606 0.31653113247178299  -0.50330613999724039 0.52841879760671184 -0.68370790823052141
-0.66456827261077822 1.6940145438011469 0.36295261616331187  -0.33571718293160935 0.69398814937561759 -0.63692575831934273
-1.0997571655259812 1.4952588380279237 0.13700104792563461  0.10098201560182198 0.49484844092680536 -0.86309191459386492
-1.1318385030170197 1.6666951227028342 0.26642231325749555  0.13227871496285309 0.66711974931205587 -0.73311225719230488
-0.93006965195750224 1.8828787711788482 0.53563503381027777  -0.06988431733666034 0.88266998226615723 -0.46476863555606956
-1.1392917641443463 1.8152357076386352 0.4378714155706992  0.13924301275047238 0.81541586445899106 -0.56187930322157997
-1 1.4336055191115187 0.09889720131605928  0 0.43243812303240753 -0.90166361230128855
-1.2133191789074438 1.453375943795391 0.13458381024047594  0.2140314567980566 0.45308829251399907 -0.8653909721551587
-1.4604717807940109 1.6415108917233325 0.38646148051428153  0.46011525660260216 0.64149399833800946 -0.61382359089386218
-1.421518771983362 1.4686357350626613 0.22366085201896613  0.42177409750733463 0.46868822204941818 -0.77616877106981619
-1.4336055191115187 0.09889720131605928 1  0.43243812303240753 -0.90166361230128855 0
-1.4533759437953913 0.13458381024047605 1.2133191789074438  0.45308829251399851 -0.86539097215515892 0.21403145679805666
-1.6415108917233325 0.38646148051428153 1.4604717807940109  0.64149399833800946 -0.61382359089386218 0.46011525660260216
-1.4686357350626613 0.22366085201896613 1.421518771983362  0.46868822204941873 -0.77616877106981541 0.42177409750733547
-1.4952588380279244 0.13700104792563483 0.9002428344740192  0.49484844092680524 -0.86309191459386503 -0.10098201560182191
-1.3215374407783713 0.053103134350052095 1.0000000000000002  0.32080957755114586 -0.94714371399036135 0
-1.1378197789939481 0.075163253016267029 1.3545175594333883  0.13818785834076808 -0.92488389215866973 0.35425118465944749
-1.1332040076734395 0.01635264358733779 1.1212211638374883  0.13297103911781027 -0.98365340072891572 0.12142771508337433
-1.5950160035539049 0.19865436684204019 0.93834668108359476  0.59583045652862876 -0.8006815966994657 -0.062410317894398201
-1.453375943795391 0.13458381024047572 0.78668082109255688  0.45308829251399974 -0.86539097215515837 -0.21403145679805646
-1.0678894309514497 0.031943921080893056 0.75863212054448437  0.068303541004109125 -0.96807477555330901 -0.24117598392814799
-1.2724957718177854 0.10243968818147742 0.65340002742402614  0.27221405186828196 -0.8975964861531891 -0.34672764240957199
-1.5950160035539052 0.19865436684204041 1.0616533189164057  0.59583045652862876 -0.8006815966994657 0.062410317894398298
-1.6666951227028344 0.26642231325749555 0.86816149698298051  0.66711974931205509 -0.73311225719230555 -0.13227871496285284
-1.5283612117454606 0.31653113247178311 0.49630888727061584  0.52841879760671173 -0.68370790823052119 -0.50330613999724083
-1.6940145438011469 0.36295261616331198 0.66456827261077822  0.69398814937561826 -0.63692575831934217 -0.33571718293160913
-1.4952588380279237 0.13700104792563472 1.0997571655259812  0.49484844092680469 -0.86309191459386525 0.10098201560182217
-1.6666951227028342 0.26642231325749555 1.1318385030170197  0.6671197493120562 -0.73311225719230466 0.13227871496285293
-1.8828787711788482 0.53563503381027777 0.93006965195750224  0.88266998226615723 -0.46476863555606956 -0.06988431733666034
-1.8152357076386352 0.4378714155706992 1.1392917641443463  0.81541586445899106 -0.56187930322157997 0.13924301275047238
-1.8013456331579596 1.0616533189164057 1.5950160035539049  0.80068159669946681 0.062410317894399416 0.59583045652862721
-1.8654161897595243 1.2133191789074431 1.4533759437953908  0.86539097215515892 0.21403145679805533 0.45308829251399935
-1.9680560789191066 1.2413678794555163 1.0678894309514497  0.96807477555330868 0.24117598392814929 0.068303541004109777
-1.8975603118185225 1.3465999725759743 1.2724957718177854  0.89759648615318766 0.34672764240957316 0.27221405186828523
-1.0000000000000002 0.56639448088848177 0.098897201316059169  1.967631691996596e-16 -0.43243812303240659 -0.901663612301289
-0.86156266551879135 0.15717574894030889 0.48126519958548886  -0.11550620576386515 -0.8392674623311237 -0.53130823737479504
-0.39229183849441457 0.893825128737608 0.21405999957086966  -0.59478368364253276 -0.11477033531296195 -0.79565076497466514
-0.41582096722616779 0.88692657891222382 0.1974660445788706  -0.59478368364253731 -0.11477033531295863 -0.79565076497466225
-0.13700104792563472 1.0997571655259812 0.50474116197207608  -0.86309191459386503 0.1009820156018227 -0.49484844092680508
-0.053103134350052095 1 0.67846255922162868  -0.94714371399036146 1.0591425737136428e-15 -0.32080957755114559
-0.075163253016266696 0.6454824405666123 0.86218022100605241  -0.92488389215867006 -0.35425118465944672 -0.13818785834076835
-0.016352643587337568 0.87877883616251229 0.86679599232656124  -0.98365340072891594 -0.12142771508337288 -0.13297103911780972
-0.19865436684204008 1.0616533189164057 1.5950160035539049  -0.80068159669946581 0.062410317894396806 0.59583045652862887
-0.26642231325749555 0.86816149698298051 1.6666951227028344  -0.73311225719230444 -0.1322787149628539 0.66711974931205609
-0.31653113247178311 0.49630888727061584 1.5283612117454606  -0.68370790823052119 -0.50330613999724083 0.52841879760671184
-0.36295261616331187 0.66456827261077822 1.6940145438011469  -0.63692575831934228 -0.33571718293160913 0.69398814937561815
-0.5047411619720763 1.8629989520743653 1.0997571655259812  -0.49484844092680508 0.86309191459386525 0.10098201560182087
-0.33330487729716596 1.7335776867425046 1.1318385030170197  -0.66711974931205509 0.73311225719230555 0.13227871496285298
-0.11712122882115195 1.4643649661897229 0.93006965195750224  -0.88266998226615712 0.46476863555606984 -0.069884317336658758
-0.18476429236136516 1.5621285844293014 1.1392917641443463  -0.81541586445899072 0.56187930322158075 0.13924301275047096
-0.9002428344740192 0.50474116197207619 1.8629989520743653  -0.10098201560182128 -0.49484844092680597 0.86309191459386458
-1.0000000000000002 0.67846255922162868 1.9468968656499477  -7.9435693028522569e-16 -0.32080957755114653 0.94714371399036112
-1.3545175594333883 0.86218022100605252 1.9248367469837331  0.35425118465944705 -0.13818785834076738 0.92488389215867006
-1.1212211638374883 0.86679599232656113 1.9836473564126624  0.12142771508337551 -0.13297103911780989 0.98365340072891561
-1.8629989520743653 0.9002428344740192 1.4952588380279237  0.86309191459386403 -0.10098201560182096 0.49484844092680702
-1.7335776867425046 0.86816149698298051 1.6666951227028339  0.73311225719230566 -0.13227871496285556 0.66711974931205442
-1.4643649661897227 1.0699303480424984 1.8828787711788482  0.46476863555607134 0.069884317336659812 0.88266998226615634
-1.5621285844293014 0.86070823585565392 1.8152357076386347  0.56187930322158197 -0.13924301275047204 0.81541586445898973
-1.8013456331579594 0.93834668108359476 1.5950160035539054  0.80068159669946681 -0.062410317894398784 0.59583045652862732
-1.7335776867425046 1.1318385030170197 1.6666951227028342  0.73311225719230577 0.1322787149628544 0.66711974931205453
-1.6834688675282168 1.5036911127293844 1.5283612117454606  0.68370790823052341 0.50330613999723939 0.52841879760671029
-1.6370473838366881 1.335431727389222 1.6940145438011469  0.63692575831934328 0.33571718293160902 0.69398814937561737
-1.5950160035539054 1.8013456331579594 0.93834668108359476  0.59583045652862743 0.8006815966994667 -0.062410317894398784
-1.6666951227028342 1.7335776867425046 1.1318385030170197  0.6671197493120552 0.73311225719230533 0.13227871496285365
-1.5283612117454601 1.683468867528217 1.5036911127293844  0.52841879760671184 0.68370790823052141 0.5033061399972405
-1.6940145438011469 1.6370473838366881 1.335431727389222  0.69398814937561792 0.63692575831934339 0.33571718293160741
-1.5950160035539049 1.8013456331579596 1.0616533189164057  0.59583045652862765 0.80068159669946648 0.062410317894398423
-1.4533759437953908 1.8654161897595243 1.2133191789074431  0.45308829251399935 0.86539097215515892 0.21403145679805533
-1.0678894309514497 1.9680560789191066 1.2413678794555163  0.068303541004109777 0.96807477555330868 0.24117598392814929
-1.2724957718177854 1.8975603118185225 1.3465999725759743  0.2722140518682829 0.89759648615318921 0.34672764240957116
-0.50474116197207619 1.8629989520743653 0.9002428344740192  -0.49484844092680574 0.86309191459386481 -0.10098201560182095
-0.67846255922162868 1.9468968656499477 1.0000000000000002  -0.32080957755114653 0.94714371399036112 -7.9435693028522224e-16
-0.86218022100605252 1.9248367469837331 1.3545175594333883  -0.13818785834076738 0.92488389215866995 0.35425118465944699
-0.86679599232656124 1.9836473564126624 1.1212211638374883  -0.13297103911780894 0.98365340072891583 0.12142771508337413
-0.56639448088848177 1.9011027986839408 1  -0.43243812303240775 0.90166361230128844 -8.689430092271666e-16
-0.54662405620460952 1.8654161897595243 1.2133191789074438  -0.45308829251399796 0.86539097215515903 0.21403145679805741
-0.35848910827666824 1.613538519485719 1.4604717807940111  -0.64149399833800924 0.6138235908938624 0.46011525660260216
-0.53136426493733957 1.7763391479810346 1.4215187719833617  -0.46868822204941807 0.77616877106981552 0.42177409750733597
-0.09889720131605928 1 1.4336055191115187  -0.90166361230128855 0 0.43243812303240753
-0.13458381024047605 1.2133191789074438 1.4533759437953913  -0.86539097215515892 0.21403145679805666 0.45308829251399851
-0.38646148051428164 1.4604717807940109 1.6415108917233323  -0.61382359089386207 0.46011525660260139 0.64149399833801013
-0.22366085201896613 1.421518771983362 1.4686357350626613  -0.7761687710698153 0.42177409750733597 0.46868822204941829
-0.13700104792563472 1.0997571655259812 1.4952588380279237  -0.86309191459386525 0.10098201560182217 0.49484844092680474
-0.26642231325749555 1.1318385030170197 1.6666951227028342  -0.73311225719230466 0.13227871496285293 0.6671197493120562
-0.53563503381027777 0.93006965195750224 1.8828787711788482  -0.46476863555606912 -0.069884317336660631 0.88266998226615745
-0.4378714155706992 1.1392917641443463 1.8152357076386352  -0.56187930322157997 0.13924301275047238 0.81541586445899106
-0.93834668108359465 0.40498399644609495 1.8013456331579598  -0.062410317894398194 -0.59583045652862798 0.80068159669946637
-0.78668082109255699 0.54662405620460941 1.8654161897595245  -0.21403145679805616 -0.4530882925139979 0.86539097215515937
-0.75863212054448437 0.93211056904855083 1.9680560789191071  -0.24117598392814946 -0.068303541004109611 0.96807477555330868
-0.65340002742402614 0.72750422818221505 1.8975603118185227  -0.34672764240957199 -0.27221405186828279 0.89759648615318888
-1.8629989520743653 1.0997571655259812 0.5047411619720763  0.86309191459386447 0.10098201560182143 -0.49484844092680624
-1.7335776867425046 1.1318385030170197 0.33330487729716596  0.73311225719230644 0.13227871496285357 -0.66711974931205398
-1.4643649661897227 0.93006965195750224 0.11712122882115183  0.46476863555606984 -0.069884317336658786 -0.88266998226615712
-1.5621285844293009 1.1392917641443463 0.18476429236136493  0.56187930322158008 0.13924301275047107 -0.81541586445899128
-1.0616533189164057 0.40498399644609517 0.19865436684204019  0.062410317894399089 -0.59583045652862909 -0.80068159669946548
-1.2133191789074433 0.54662405620460941 0.13458381024047572  0.21403145679805635 -0.4530882925139984 -0.86539097215515914
-1.2413678794555163 0.93211056904855083 0.031943921080893167  0.24117598392814768 -0.068303541004110069 -0.96807477555330901
-1.3465999725759745 0.72750422818221494 0.10243968818147742  0.34672764240957282 -0.2722140518682819 -0.89759648615318888
-1.0997571655259812 0.50474116197207608 0.13700104792563472  0.10098201560182246 -0.49484844092680491 -0.86309191459386514
-1 0.67846255922162868 0.053103134350052095  1.1189552832304316e-16 -0.32080957755114614 -0.94714371399036124
-0.64548244056661241 0.86218022100605241 0.075163253016266696  -0.35425118465944616 -0.13818785834076958 -0.92488389215867006
-0.87877883616251229 0.86679599232656113 0.016352643587337568  -0.12142771508337286 -0.13297103911780978 -0.98365340072891594
-0.13700104792563472 0.9002428344740192 0.50474116197207619  -0.86309191459385659 -0.10098201560181821 -0.49484844092682057
-0.35660859546245854 0.90157505838463314 0.24184951424973428  -0.65387638494521683 -0.11348698498785796 -0.74804169499389572
-0.53563503381027766 1.0699303480424984 0.11712122882115172  -0.46476863555606851 0.069884317336659452 -0.88266998226615789
-0.55521070025011254 0.82226795238624728 0.12310298935169575  -0.83361988814006172 0.15282936104498174 -0.53077402771794857
-0.19865436684204019 0.93834668108359476 0.40498399644609495  -0.80068159669946903 -0.062410317894398964 -0.59583045652862432
-0.26642231325749555 1.1318385030170197 0.33330487729716562  -0.73311225719230511 0.13227871496285284 -0.66711974931205564
-0.31653113247178322 1.5036911127293848 0.47163878825453964  -0.68370790823052086 0.50330613999724183 -0.52841879760671129
-0.36295261616331198 1.335431727389222 0.30598545619885309  -0.63692575831934384 0.3357171829316084 -0.69398814937561704
-0.40498399644609528 1.8013456331579598 1.0616533189164057  -0.59583045652862843 0.80068159669946615 0.062410317894396293
-0.33330487729716574 1.7335776867425046 0.86816149698298051  -0.6671197493120562 0.73311225719230444 -0.13227871496285309
-0.47163878825453998 1.6834688675282172 0.49630888727061595  -0.52841879760671129 0.68370790823052163 -0.50330613999724094
-0.30598545619885309 1.6370473838366881 0.66456827261077822  -0.69398814937561759 0.6369257583193435 -0.33571718293160813
-0.40498399644609495 1.8013456331579598 0.93834668108359465  -0.59583045652862776 0.80068159669946659 -0.062410317894396786
-0.54662405620460952 1.8654161897595243 0.78668082109255688  -0.45308829251399785 0.86539097215515937 -0.2140314567980563
-0.93211056904855083 1.9680560789191068 0.75863212054448415  -0.068303541004110235 0.96807477555330868 -0.24117598392814935
-0.72750422818221505 1.8975603118185227 0.65340002742402614  -0.27221405186828113 0.89759648615318932 -0.3467276424095721
-1.4952588380279241 1.8629989520743653 1.099757165525981  0.49484844092680591 0.8630919145938647 0.1009820156018213
-1.3215374407783715 1.9468968656499477 1  0.32080957755114636 0.94714371399036112 -3.9056046362122319e-16
-1.1378197789939481 1.9248367469837331 0.64548244056661219  0.13818785834077008 0.92488389215866995 -0.35425118465944616
-1.1332040076734395 1.9836473564126622 0.87877883616251196  0.13297103911780914 0.98365340072891583 -0.1214277150833743
-1.4336055191115187 1.9011027986839406 1.0000000000000002  0.43243812303240886 0.90166361230128789 0
-1.453375943795391 1.8654161897595241 0.78668082109255688  0.45308829251400068 0.86539097215515781 -0.2140314567980568
-1.6415108917233319 1.613538519485719 0.53952821920598937  0.64149399833801002 0.6138235908938634 -0.46011525660259989
-1.4686357350626613 1.7763391479810342 0.5784812280166387  0.46868822204941918 0.77616877106981508 -0.42177409750733541
-1.9011027986839408 1 0.56639448088848177  0.90166361230128866 -1.2527504869364849e-15 -0.43243812303240708
-1.8654161897595243 1.2133191789074438 0.54662405620460952  0.86539097215515903 0.21403145679805741 -0.45308829251399796
-1.613538519485719 1.4604717807940111 0.35848910827666824  0.6138235908938624 0.46011525660260194 -0.64149399833800957
-1.7763391479810346 1.4215187719833617 0.53136426493733957  0.77616877106981552 0.42177409750733597 -0.46868822204941807
-1.9011027986839406 1.0000000000000002 1.4336055191115187  0.90166361230128855 -1.4477442699732785e-15 0.43243812303240742
-1.8654161897595243 0.78668082109255699 1.453375943795391  0.86539097215515814 -0.21403145679805691 0.45308829251399968
-1.613538519485719 0.53952821920598937 1.6415108917233319  0.6138235908938634 -0.46011525660259978 0.64149399833800991
-1.7763391479810344 0.57848122801663893 1.4686357350626611  0.7761687710698163 -0.4217740975073343 0.46868822204941812
-1 0.56639448088848177 1.9011027986839408  -1.2527504869364849e-15 -0.43243812303240708 0.90166361230128866
-1.2133191789074438 0.54662405620460952 1.8654161897595243  0.21403145679805741 -0.45308829251399796 0.86539097215515903
-1.4604717807940111 0.35848910827666824 1.613538519485719  0.46011525660260189 -0.64149399833800946 0.6138235908938624
-1.4215187719833617 0.53136426493733957 1.7763391479810346  0.42177409750733597 -0.46868822204941807 0.77616877106981552
-1.0997571655259812 0.50474116197207619 1.8629989520743653  0.10098201560182141 -0.49484844092680619 0.86309191459386447
-1.1318385030170197 0.33330487729716596 1.7335776867425046  0.13227871496285284 -0.66711974931205531 0.73311225719230533
-0.93006965195750224 0.11712122882115183 1.4643649661897227  -0.069884317336658786 -0.88266998226615712 0.46476863555606984
-1.1392917641443463 0.18476429236136493 1.5621285844293009  0.13924301275047143 -0.81541586445899072 0.56187930322158053
-0.40498399644609517 0.19865436684204019 1.0616533189164057  -0.59583045652862809 -0.80068159669946615 0.062410317894399513
-0.5466240562046093 0.13458381024047572 1.2133191789074433  -0.4530882925139989 -0.8653909721551587 0.21403145679805652
-0.93211056904855083 0.031943921080893167 1.2413678794555163  -0.068303541004110055 -0.96807477555330901 0.24117598392814768
-0.72750422818221494 0.10243968818147742 1.3465999725759745  -0.2722140518682819 -0.89759648615318888 0.34672764240957282
-0.50474116197207608 0.13700104792563472 1.0997571655259812  -0.49484844092680558 -0.86309191459386481 0.10098201560182224
-0.67846255922162868 0.053103134350052095 1  -0.32080957755114559 -0.94714371399036146 1.0591425737136428e-15
-0.86218022100605241 0.075163253016266696 0.64548244056661241  -0.13818785834076858 -0.92488389215867017 -0.35425118465944616
-0.86679599232656124 0.016352643587337568 0.87877883616251229  -0.13297103911780972 -0.98365340072891594 -0.12142771508337288
-0.9002428344740192 0.50474116197207608 0.13700104792563472  -0.1009820156018221 -0.49484844092680447 -0.86309191459386547
-0.5423386494351099 0.82968743367193953 0.12850859076870802  -0.46036815782147283 -0.16290466567087261 -0.87265298324518714
-1.0699303480424984 0.11712122882115172 0.53563503381027766  0.069884317336659438 -0.88266998226615778 -0.46476863555606845
-0.82226795238624728 0.12310298935169575 0.55521070025011254  0.15282936104498174 -0.53077402771794857 -0.83361988814006172
-0.93834668108359476 0.40498399644609495 0.19865436684204019  -0.062410317894401025 -0.59583045652862499 -0.80068159669946837
-1.1318385030170197 0.33330487729716562 0.26642231325749555  0.13227871496285284 -0.66711974931205564 -0.73311225719230511
-1.5036911127293848 0.47163878825453998 0.31653113247178311  0.50330613999724105 -0.52841879760671151 -0.6837079082305213
-1.335431727389222 0.30598545619885309 0.36295261616331198  0.3357171829316084 -0.69398814937561704 -0.63692575831934384
-1.8013456331579596 1.0616533189164057 0.40498399644609495  0.80068159669946637 0.06241031789439988 -0.59583045652862787
-1.7335776867425046 0.86816149698298051 0.33330487729716574  0.73311225719230455 -0.13227871496285257 -0.66711974931205631
-1.6834688675282172 0.49630888727061595 0.47163878825453998  0.68370790823052152 -0.50330613999724094 -0.52841879760671129
-1.6370473838366881 0.66456827261077822 0.30598545619885309  0.6369257583193435 -0.33571718293160813 -0.69398814937561759
-1.8013456331579598 0.93834668108359465 0.40498399644609495  0.80068159669946637 -0.062410317894398194 -0.59583045652862798
-1.8654161897595245 0.78668082109255699 0.54662405620460941  0.86539097215515937 -0.21403145679805616 -0.4530882925139979
-1.9680560789191071 0.75863212054448437 0.93211056904855083  0.96807477555330868 -0.24117598392814929 -0.068303541004109763
-1.8975603118185227 0.65340002742402614 0.72750422818221505  0.89759648615318932 -0.34672764240957188 -0.27221405186828146
-1.8629989520743653 1.099757165525981 1.4952588380279241  0.86309191459386403 0.10098201560182252 0.4948484409268068
-1.9468968656499477 1 1.3215374407783715  0.94714371399036101 0 0.32080957755114675
-1.9248367469837333 0.6454824405666123 1.1378197789939481  0.92488389215866995 -0.35425118465944644 0.13818785834076994
-1.9836473564126624 0.87877883616251229 1.1332040076734395  0.98365340072891561 -0.12142771508337535 0.13297103911781
-1.8629989520743653 0.9002428344740192 0.50474116197207619  0.86309191459386458 -0.10098201560182128 -0.49484844092680597
-1.9468968656499477 1.0000000000000002 0.67846255922162868  0.94714371399036112 -7.9435693028522569e-16 -0.32080957755114653
-1.9248367469837331 1.3545175594333883 0.86218022100605252  0.92488389215866995 0.35425118465944699 -0.13818785834076738
-1.9836473564126624 1.1212211638374883 0.86679599232656124  0.98365340072891561 0.12142771508337551 -0.1329710391178098
-1.4952588380279237 1.8629989520743653 0.9002428344740192  0.49484844092680708 0.86309191459386414 -0.10098201560182099
-1.6666951227028339 1.7335776867425046 0.86816149698298051  0.66711974931205476 0.73311225719230577 -0.13227871496285329
-1.8828787711788482 1.4643649661897227 1.0699303480424984  0.88266998226615634 0.46476863555607129 0.069884317336659799
-1.8152357076386347 1.5621285844293014 0.86070823585565392  0.81541586445898973 0.56187930322158197 -0.13924301275047204
-0.56639448088848177 0.098897201316059169 1.0000000000000002  -0.43243812303240714 -0.90166361230128866 1.1585906789695613e-15
-0.82968743367193953 0.12850859076870802 0.5423386494351099  -0.16290466567087261 -0.87265298324518714 -0.46036815782147283
-0.50275426427774228 0.85145286645038376 0.14564781357706019  -0.49501822108782007 -0.18463389628076027 -0.84903903628469024
-0.44478929974988757 0.17773204761375261 0.87689701064830428  -0.49123021957364593 -0.85333806289874636 -0.17466259412319191
-0.098897201316059169 1.0000000000000002 0.56639448088848177  -0.90166361230128889 1.1585906789695613e-15 -0.43243812303240675
-0.88692657891222382 0.1974660445788706 0.41582096722616779  -0.11477033531295829 -0.79565076497466325 -0.59478368364253609
-0.893825128737608 0.21405999957086963 0.39229183849441451  -0.11477033531296192 -0.79565076497466702 -0.59478368364253043
-0.48126519958548886 0.86156266551879135 0.15717574894030889  -0.53130823737479427 -0.11550620576389276 -0.83926746233112037
-0.50474116197207608 0.13700104792563472 0.9002428344740192  -0.4948484409268048 -0.86309191459386525 -0.10098201560182263
-0.44878045857535931 0.87541500307784514 0.17583413883161553  -0.5313082373747976 -0.11550620576389102 -0.8392674623311186
-0.11712122882115172 0.53563503381027766 1.0699303480424984  -0.88266998226615778 -0.46476863555606851 0.069884317336659466
-0.89148810692249181 0.40180685413975104 0.20692923660476614  -0.10210073274615528 -0.58661618171386176 -0.80340332070769271
-0.19865436684204019 0.93834668108359476 1.5950160035539049  -0.8006815966994657 -0.062410317894396827 0.59583045652862898
-0.13458381024047572 0.78668082109255688 1.453375943795391  -0.86539097215515859 -0.21403145679805591 0.45308829251399935
-0.031943921080893056 0.75863212054448437 1.0678894309514497  -0.96807477555330901 -0.24117598392814799 0.06830354100410968
-0.10243968818147742 0.65340002742402614 1.2724957718177854  -0.8975964861531891 -0.34672764240957199 0.27221405186828196
-0.40498399644609495 0.19865436684204019 0.93834668108359476  -0.59583045652862321 -0.80068159669946959 -0.062410317894402448
-0.33330487729716562 0.26642231325749555 1.1318385030170197  -0.66711974931205542 -0.73311225719230511 0.13227871496285401
-0.47163878825453986 0.31653113247178322 1.5036911127293848  -0.52841879760671118 -0.68370790823052097 0.50330613999724172
-0.30598545619885309 0.36295261616331198 1.335431727389222  -0.69398814937561704 -0.63692575831934384 0.3357171829316084
-1.0616533189164057 0.40498399644609495 1.8013456331579596  0.062410317894397979 -0.59583045652862809 0.80068159669946626
-0.86816149698298051 0.33330487729716585 1.7335776867425046  -0.13227871496285251 -0.6671197493120562 0.73311225719230455
-0.49630888727061595 0.47163878825453998 1.6834688675282172  -0.50330613999724094 -0.52841879760671129 0.68370790823052152
-0.66456827261077822 0.30598545619885309 1.6370473838366881  -0.33571718293160813 -0.69398814937561759 0.6369257583193435
-0.19865436684204019 1.0616533189164057 0.40498399644609517  -0.80068159669946548 0.062410317894397452 -0.5958304565286292
-0.13458381024047572 1.2133191789074433 0.54662405620460941  -0.86539097215515914 0.21403145679805632 -0.45308829251399835
-0.031943921080893167 1.2413678794555163 0.93211056904855083  -0.96807477555330901 0.24117598392814765 -0.068303541004109986
-0.10243968818147742 1.3465999725759745 0.72750422818221494  -0.89759648615318854 0.34672764240957266 -0.27221405186828312
-0.13700104792563483 0.9002428344740192 1.4952588380279244  -0.86309191459386536 -0.10098201560182207 0.49484844092680463
-0.053103134350052095 1.0000000000000002 1.3215374407783713  -0.94714371399036135 0 0.32080957755114586
-0.075163253016267029 1.3545175594333883 1.1378197789939481  -0.92488389215866973 0.3542511846594476 0.13818785834076797
-0.01635264358733779 1.1212211638374883 1.1332040076734395  -0.98365340072891572 0.12142771508337433 0.13297103911781027
-1.4869664504627846 1.2757285413196802 1.8287565671687904  0.48692804957249064 0.27563277583938867 0.82881098413486498
-1.3417901167060058 1.7879282682296775 1.5121997269099978  0.34188293456237351 0.78786613428398422 0.51223335844459672
-0.72427145868032006 1.8287565671687904 1.4869664504627849  -0.27563277583938928 0.82881098413486498 0.48692804957249036
-0.48780027309000262 1.3417901167060056 1.787928268229678  -0.51223335844459661 0.34188293456237429 0.787866134283984
-0.95917170106088778 1.0000000000000002 1.9991661773727825  -0.040944849850879386 7.9185827630587721e-16 0.99916140801708753
-1.0408282989391127 1.0000000000000002 0.00083382262721753975  0.040944849850880191 3.6467157461454874e-16 -0.99916140801708742
-0.51303354953721536 1.2757285413196804 0.17124343283120957  -0.48692804957249081 0.27563277583938856 -0.82881098413486487
-0.65820988329399455 1.787928268229678 0.48780027309000262  -0.34188293456237323 0.78786613428398444 -0.51223335844459661
-1.2757285413196804 1.8287565671687904 0.51303354953721536  0.2756327758393875 0.82881098413486598 -0.4869280495724897
-1.5121997269099978 1.3417901167060056 0.21207173177032246  0.51223335844459683 0.34188293456237367 -0.78786613428398422
-1.3417901167060056 0.21207173177032246 1.5121997269099978  0.3418829345623734 -0.78786613428398455 0.51223335844459639
-1.0000000000000002 0.00083382262721753975 1.0408282989391127  -4.8622876615273169e-17 -0.99916140801708742 0.040944849850880878
-1.2757285413196804 0.17124343283120957 0.51303354953721536  0.27563277583938856 -0.82881098413486487 -0.48692804957249081
-1.787928268229678 0.48780027309000262 0.65820988329399455  0.78786613428398444 -0.5122333584445965 -0.34188293456237345
-1.8287565671687904 0.51303354953721558 1.2757285413196802  0.8288109841348662 -0.48692804957248981 0.27563277583938656
-1.8287565671687904 1.4869664504627846 1.2757285413196802  0.82881098413486498 0.48692804957249064 0.27563277583938867
-0.82188503772742805 0.55513243511369992 0.12315882465233803  -0.18329374350458857 -0.42919468968315555 -0.88441806965928382
-0.00083382262721753975 0.95917170106088778 1.0000000000000002  -0.99916140801708753 -0.040944849850879393 -5.5569001846026486e-17
-0.48780027309000262 0.65820988329399455 1.787928268229678  -0.5122333584445965 -0.34188293456237345 0.78786613428398444
-0.17124343283120991 1.4869664504627851 1.2757285413196804  -0.82881098413486476 0.48692804957249086 0.27563277583938922
-1.0408282989391127 1.0000000000000002 1.9991661773727825  0.040944849850879324 8.0227746415200712e-16 0.99916140801708753
-1.4869664504627849 0.72427145868032006 1.8287565671687904  0.4869280495724907 -0.27563277583938717 0.82881098413486554
-1.5121997269099978 1.3417901167060058 1.7879282682296775  0.51223335844459672 0.34188293456237351 0.78786613428398422
-1.7879282682296775 1.5121997269099978 1.3417901167060058  0.78786613428398422 0.51223335844459672 0.34188293456237351
-1.2757285413196802 1.8287565671687904 1.4869664504627846  0.27563277583938983 0.82881098413486343 0.48692804957249253
-1.0000000000000002 1.9991661773727825 1.0408282989391127  8.0227746415200722e-16 0.99916140801708742 0.040944849850882141
-0.65820988329399466 1.7879282682296778 1.5121997269099978  -0.3418829345623734 0.78786613428398444 0.5122333584445965
-0.21207173177032257 1.5121997269099978 1.3417901167060058  -0.78786613428398455 0.51223335844459572 0.34188293456237429
-0.51303354953721558 1.2757285413196802 1.8287565671687904  -0.48692804957248981 0.27563277583938656 0.8288109841348662
-0.51303354953721558 0.72427145868032006 1.8287565671687904  -0.48692804957249058 -0.27563277583938756 0.82881098413486542
-1.4869664504627849 1.2757285413196802 0.17124343283120991  0.48692804957249114 0.27563277583938811 -0.82881098413486487
-1.4869664504627846 0.72427145868031995 0.17124343283120957  0.48692804957249103 -0.27563277583938883 -0.82881098413486465
-0.95917170106088778 1.0000000000000002 0.00083382262721753975  -0.040944849850880066 3.6119851199917208e-16 -0.99916140801708742
-0.8104943439581207 0.5727813550993911 0.11695476797072311  -0.18329374350458949 -0.42919468968314711 -0.88441806965928782
-0.48780027309000262 1.3417901167060058 0.21207173177032246  -0.51223335844459639 0.34188293456237423 -0.78786613428398411
-0.21207173177032246 1.5121997269099978 0.65820988329399444  -0.78786613428398433 0.5122333584445965 -0.34188293456237356
-0.72427145868032006 1.8287565671687904 0.51303354953721558  -0.27563277583938739 0.82881098413486554 -0.48692804957249036
-1.0000000000000002 1.9991661773727825 0.95917170106088745  8.4048115292115045e-16 0.99916140801708742 -0.040944849850882155
-1.3417901167060056 1.787928268229678 0.48780027309000262  0.34188293456237384 0.78786613428398466 -0.51223335844459594
-1.7879282682296778 1.5121997269099978 0.65820988329399466  0.78786613428398444 0.5122333584445965 -0.3418829345623734
-1.787928268229678 0.48780027309000262 1.3417901167060056  0.787866134283984 -0.51223335844459661 0.34188293456237429
-1.5121997269099978 0.65820988329399466 1.7879282682296775  0.51223335844459672 -0.34188293456237334 0.78786613428398444
-1.2757285413196804 0.17124343283120991 1.4869664504627851  0.27563277583938872 -0.82881098413486476 0.48692804957249108
-0.72427145868031995 0.17124343283120957 1.4869664504627846  -0.27563277583938883 -0.82881098413486476 0.48692804957249108
-1.0000000000000002 0.00083382262721753975 0.95917170106088778  -5.5569001846026486e-17 -0.99916140801708753 -0.040944849850879393
-0.55513243511370003 0.123158824652338 0.82188503772742816  -0.42919468968315033 -0.88441806965928604 -0.18329374350459032
-1.341790116706006 0.21207173177032235 0.48780027309000251  0.34188293456237451 -0.78786613428398411 -0.51223335844459639
-1.5121997269099978 0.65820988329399455 0.21207173177032246  0.51223335844459672 -0.3418829345623734 -0.78786613428398444
-1.8287565671687904 0.51303354953721558 0.72427145868032006  0.82881098413486531 -0.4869280495724907 -0.27563277583938756
-1.9991661773727825 0.95917170106088778 1.0000000000000002  0.99916140801708753 -0.040944849850879504 8.3700809030577384e-16
-1.9991661773727825 1.0408282989391127 1.0000000000000002  0.99916140801708753 0.040944849850879317 8.0575052676738392e-16
-1.8287565671687904 1.4869664504627849 0.72427145868032006  0.82881098413486542 0.48692804957249064 -0.27563277583938711
-0.57278135509939099 0.11695476797072324 0.8104943439581207  -0.42919468968314667 -0.88441806965928826 -0.1832937435045886
-0.90157505838463314 0.24184951424973419 0.35660859546245843  -0.11348698498784407 -0.74804169499391326 -0.65387638494519917
-0.84405122505983243 0.51657855931435837 0.13944047800987086  -0.13902973540250935 -0.48165648852028198 -0.86526167125339581
-0.17124343283120957 0.51303354953721536 1.2757285413196804  -0.82881098413486487 -0.48692804957249081 0.27563277583938856
-0.21207173177032235 0.48780027309000251 1.341790116706006  -0.78786613428398411 -0.51223335844459639 0.34188293456237451
-0.65820988329399455 0.21207173177032246 1.5121997269099978  -0.3418829345623734 -0.78786613428398433 0.51223335844459661
-0.17124343283120957 1.4869664504627846 0.72427145868031995  -0.82881098413486476 0.48692804957249108 -0.27563277583938883
-0.00083382262721753975 1.0408282989391127 1.0000000000000002  -0.99916140801708742 0.040944849850880878 -4.8622876615273169e-17
-1.3180233001589552 1.5833668628112614 1.7473582032263737  0.31837608818572172 0.58341134180693532 0.74717325482286157
-1.154901620023423 1.3257845443224259 1.932668171856823  0.15470547768481949 0.32538864777967036 0.93283891592837687
-1.0000000000000002 1.7799160715239055 1.6258841117800629  -1.9440969465064108e-05 0.78016657033104153 0.62557183613071055
-1.2506360861103192 1.5764206304327446 1.7777665518334007  0.25098113386125548 0.57611676249591781 0.77788041909855321
-0.68197669984104503 1.5833668628112616 1.7473582032263737  -0.31838810336562495 0.58337988565756627 0.74719269579232706
-1 1.7313222504561676 1.6820320857465041  -0.00040939357642492746 0.73148465290216669 0.68185778206712322
-0.80345079128735619 1.2653435626523064 1.9439074119390181  -0.1967866846734746 0.26502323844130937 0.94394792431643348
-0.74936391388968104 1.5764206304327451 1.7777665518334005  -0.25098113386125537 0.57611676249591781 0.77788041909855332
-1.1965492087126446 1.2653435626523064 1.9439074119390178  0.19675522852410743 0.26500379747184277 0.94395993949633727
-0.84509837997657777 1.3257845443224261 1.932668171856823  -0.1553678904062491 0.3257980413560963 0.93258589678337034
-0.80345079128735619 1.2653435626523064 0.056092588060981941  -0.19678668467347479 0.26502323844130921 -0.94394792431643348
-1.1549016200234223 1.3257845443224259 0.067331828143176842  0.15470547768481682 0.32538864777967058 -0.9328389159283772
-0.68197669984104503 1.5833668628112614 0.25264179677362608  -0.3183881033656254 0.58337988565756549 -0.7471926957923275
-0.84509837997657777 1.3257845443224259 0.067331828143176842  -0.15536789040624877 0.32579804135609564 -0.93258589678337067
-1 1.7799160715239055 0.37411588821993702  1.9440969465197814e-05 0.78016657033104042 -0.62557183613071199
-0.74936391388968104 1.5764206304327446 0.22223344816659929  -0.25098113386125498 0.57611676249591759 -0.77788041909855354
-1.318023300158955 1.5833668628112618 0.25264179677362619  0.3183881033656264 0.58337988565756582 -0.74719269579232672
-1.0000000000000002 1.7313222504561674 0.31796791425349591  0.0004093935764240383 0.73148465290216658 -0.68185778206712311
-1.1965492087126439 1.2653435626523064 0.056092588060981941  0.19678668467347576 0.26502323844130871 -0.94394792431643337
-1.2506360861103192 1.5764206304327451 0.22223344816659951  0.2507281147162479 0.57677917521735 -0.7774710255221281
-1.2653435626523064 0.056092588060981941 1.1965492087126439  0.26502323844130876 -0.94394792431643337 0.19678668467347579
-1.5764206304327453 0.22223344816659973 1.2506360861103192  0.57677917521735 -0.77747102552212821 0.25072811471624751
-1.2653435626523064 0.056092588060981941 0.80345079128735619  0.26502323844130921 -0.94394792431643348 -0.19678668467347479
-1.3257845443224259 0.067331828143176842 1.1549016200234223  0.32538864777966992 -0.93283891592837775 0.1547054776848156
-1.5833668628112616 0.25264179677362608 0.68197669984104492  0.58341134180693432 -0.74717325482286268 -0.31837608818572105
-1.3257845443224259 0.067331828143176842 0.84509837997657777  0.32579804135609486 -0.93258589678337089 -0.15536789040624885
-1.7799160715239055 0.37411588821993702 1  0.78016657033104053 -0.62557183613071199 1.944096946520129e-05
-1.5764206304327446 0.22223344816659929 0.74936391388968104  0.57677917521734945 -0.77747102552212866 -0.25072811471624729
-1.5833668628112618 0.25264179677362619 1.318023300158955  0.58337988565756582 -0.74719269579232683 0.31838810336562634
-1.7313222504561674 0.31796791425349591 1.0000000000000002  0.73148465290216691 -0.68185778206712278 0.00040939357642373793
-1.7473582032263737 1.3180233001589552 1.5833668628112614  0.74717325482286168 0.31837608818572238 0.58341134180693466
-1.932668171856823 1.154901620023423 1.3257845443224259  0.93283891592837687 0.15470547768481949 0.32538864777967036
-0.80345079128735619 0.73465643734769381 0.056092588060981829  -0.19678668467347549 -0.26502323844130932 -0.94394792431643337
-0.85311732979922938 0.49982529754025784 0.14730961092137676  -0.13902973540250163 -0.48165648852027954 -0.86526167125339848
-0.056092588060981941 1.1965492087126446 0.73465643734769381  -0.94394792431643382 0.19678668467347557 -0.26502323844130737
-0.067331828143176842 0.84509837997657777 0.67421545567757424  -0.93283891592837742 -0.15470547768481616 -0.32538864777967025
-0.37411588821993702 1 1.7799160715239055  -0.62557183613071199 1.9440969465197814e-05 0.78016657033104042
-0.22223344816659929 0.74936391388968104 1.5764206304327446  -0.77747102552212877 -0.25072811471624706 0.57677917521734956
-0.41663313718873862 1.7473582032263741 1.318023300158955  -0.58337988565756549 0.74719269579232761 0.31838810336562501
-0.26867774954383239 1.6820320857465041 1.0000000000000002  -0.73148465290216669 0.68185778206712311 0.00040939357642482668
-0.80345079128735619 0.73465643734769381 1.9439074119390183  -0.19678668467347538 -0.26502323844130976 0.94394792431643326
-1.1549016200234223 0.67421545567757413 1.932668171856823  0.1553678904062501 -0.32579804135609519 0.93258589678337056
-1.7473582032263737 0.68197669984104503 1.5833668628112616  0.74719269579232706 -0.31838810336562495 0.58337988565756627
-1.6820320857465041 1 1.7313222504561676  0.68185778206712322 -0.00040939357642492746 0.73148465290216669
-1.6258841117800629 1.0000000000000002 1.7799160715239055  0.62557183613071055 -1.9440969464025697e-05 0.78016657033104153
-1.7777665518334005 1.2506360861103192 1.5764206304327451  0.77747102552212888 0.25072811471625006 0.57677917521734801
-1.7799160715239055 1.6258841117800629 1.0000000000000002  0.78016657033104164 0.62557183613071043 1.9440969464694239e-05
-1.5764206304327446 1.7777665518334007 1.2506360861103192  0.57611676249591814 0.77788041909855277 0.25098113386125592
-1.5833668628112614 1.7473582032263737 1.3180233001589552  0.58341134180693532 0.74717325482286157 0.31837608818572172
-1.3257845443224259 1.932668171856823 1.154901620023423  0.32538864777967036 0.93283891592837687 0.15470547768481949
-0.73465643734769381 1.9439074119390181 0.80345079128735586  -0.26500379747184416 0.94395993949633739 -0.19675522852410532
-0.67421545567757413 1.932668171856823 1.1549016200234223  -0.32538864777966992 0.93283891592837731 0.15470547768481824
-0.73465643734769381 1.9439074119390181 1.1965492087126439  -0.26502323844130993 0.94394792431643315 0.19678668467347582
-0.42357936956725528 1.7777665518334005 1.2506360861103192  -0.57677917521734934 0.77747102552212888 0.25072811471624717
-0.056092588060981941 1.1965492087126439 1.2653435626523064  -0.94394792431643337 0.19678668467347579 0.26502323844130876
-0.22223344816659973 1.2506360861103192 1.5764206304327453  -0.77747102552212821 0.25072811471624751 0.57677917521735
-0.25264179677362619 1.318023300158955 1.5833668628112618  -0.7471926957923265 0.31838810336562612 0.58337988565756638
-0.31796791425349591 1.0000000000000002 1.7313222504561674  -0.68185778206712278 0.00040939357642426756 0.73148465290216691
-0.68197669984104503 0.41663313718873862 1.7473582032263741  -0.31838810336562445 -0.58337988565756549 0.74719269579232783
-0.84509837997657777 0.67421545567757435 1.932668171856823  -0.1547054776848153 -0.3253886477796708 0.93283891592837742
-1.7473582032263741 1.318023300158955 0.41663313718873862  0.74719269579232761 0.31838810336562501 -0.58337988565756549
-1.6820320857465041 1.0000000000000002 0.26867774954383239  0.68185778206712311 0.00040939357642482668 -0.73148465290216669
-1.3180233001589552 0.41663313718873873 0.25264179677362608  0.31837608818572138 -0.58341134180693455 -0.74717325482286234
-1.154901620023423 0.67421545567757435 0.067331828143176842  0.15536789040624938 -0.32579804135609586 -0.93258589678337045
-1.1965492087126446 0.73465643734769381 0.056092588060981941  0.19678668467347524 -0.26502323844130793 -0.94394792431643371
-0.84509837997657777 0.67421545567757424 0.067331828143176842  -0.15470547768481568 -0.32538864777966997 -0.93283891592837764
-0.40180685413975104 0.20692923660476614 0.89148810692249203  -0.58661618171386376 -0.80340332070769127 -0.10210073274615536
-0.31796791425349591 1 0.26867774954383261  -0.68185778206712322 0.0004093935764252486 -0.73148465290216658
-0.37411588821993691 1.0000000000000002 0.22008392847609459  -0.62557183613071188 -1.9440969464680348e-05 -0.78016657033104053
-0.22223344816659951 1.2506360861103192 0.42357936956725528  -0.77747102552212832 0.25072811471624878 -0.57677917521734934
-0.22008392847609459 1.6258841117800631 1  -0.7801665703310412 0.6255718361307111 1.9440969465668402e-05
-0.42357936956725517 1.7777665518334005 0.74936391388968104  -0.57677917521734912 0.77747102552212877 -0.2507281147162479
-0.41663313718873862 1.7473582032263741 0.68197669984104503  -0.5833798856575656 0.74719269579232717 -0.31838810336562584
-0.67421545567757435 1.932668171856823 0.84509837997657744  -0.32579804135609636 0.93258589678337023 -0.15536789040624996
-1.2653435626523064 1.9439074119390178 1.1965492087126446  0.26500379747184277 0.94395993949633727 0.19675522852410743
-1.3257845443224261 1.932668171856823 0.84509837997657744  0.32579804135609641 0.93258589678337034 -0.15536789040624846
-1.2653435626523066 1.9439074119390181 0.80345079128735586  0.26500379747184327 0.9439599394963375 -0.1967552285241061
-1.5764206304327451 1.7777665518334005 0.74936391388968104  0.57611676249591781 0.77788041909855321 -0.25098113386125531
-1.9439074119390181 1.1965492087126439 0.73465643734769381  0.94394792431643315 0.19678668467347582 -0.26502323844130993
-1.7777665518334005 1.2506360861103192 0.42357936956725528  0.77747102552212888 0.25072811471624717 -0.57677917521734934
-1.9439074119390181 0.80345079128735619 1.2653435626523064  0.94394792431643304 -0.19678668467347601 0.26502323844131026
-1.7777665518334005 0.74936391388968104 1.5764206304327451  0.77788041909855321 -0.25098113386125531 0.57611676249591781
-1.1965492087126439 0.73465643734769381 1.9439074119390181  0.19678668467347582 -0.26502323844130993 0.94394792431643315
-1.2506360861103192 0.42357936956725528 1.7777665518334005  0.2509811338612542 -0.57611676249591748 0.77788041909855388
-1.318023300158955 0.41663313718873862 1.7473582032263741  0.3183881033656249 -0.58337988565756593 0.74719269579232728
-1.0000000000000002 0.26867774954383239 1.6820320857465041  -0.00040939357642494475 -0.73148465290216658 0.68185778206712311
-0.41663313718873873 0.25264179677362608 1.3180233001589552  -0.58341134180693588 -0.74717325482286145 0.31837608818572088
-0.67421545567757435 0.067331828143176842 1.154901620023423  -0.32579804135609586 -0.93258589678337045 0.15536789040624938
-0.73465643734769381 0.056092588060981941 1.1965492087126446  -0.26500379747184338 -0.94395993949633727 0.19675522852410698
-0.67421545567757413 0.06733182814317662 0.84509837997657777  -0.32538864777966992 -0.93283891592837753 -0.15470547768481679
-0.51657855931435848 0.13944047800987086 0.84405122505983243  -0.48165648852028675 -0.86526167125339581 -0.13902973540249375
-1 0.26867774954383261 0.31796791425349591  -0.00040939357642570527 -0.73148465290216624 -0.68185778206712344
-1.0000000000000002 0.22008392847609459 0.37411588821993691  -1.9440969464680348e-05 -0.78016657033104053 -0.62557183613071188
-1.2506360861103192 0.42357936956725528 0.22223344816659951  0.25098113386125509 -0.57611676249591803 -0.77788041909855321
-1.6258841117800631 1 0.22008392847609459  0.6255718361307111 1.9440969465666664e-05 -0.7801665703310412
-1.7777665518334005 0.74936391388968104 0.42357936956725517  0.77747102552212877 -0.2507281147162479 -0.57677917521734912
-1.7473582032263741 0.68197669984104503 0.41663313718873862  0.74717325482286201 -0.31837608818572022 -0.58341134180693555
-1.932668171856823 0.84509837997657777 0.67421545567757435  0.93258589678336989 -0.15536789040624968 -0.32579804135609747
-1.9439074119390178 1.1965492087126446 1.2653435626523064  0.94395993949633727 0.19675522852410743 0.26500379747184277
-1.932668171856823 0.84509837997657777 1.3257845443224261  0.93283891592837731 -0.15470547768481616 0.32538864777967047
-1.9439074119390183 0.80345079128735619 0.73465643734769381  0.94394792431643326 -0.19678668467347538 -0.26502323844130976
-1.932668171856823 1.1549016200234223 0.67421545567757413  0.93283891592837731 0.15470547768481824 -0.32538864777966992
-1.5833668628112616 1.7473582032263737 0.68197669984104503  0.58337988565756627 0.74719269579232706 -0.31838810336562495
-1.7313222504561676 1.6820320857465041 1  0.73148465290216669 0.68185778206712322 -0.00040939357642492746
-0.73465643734769381 0.056092588060981829 0.80345079128735619  -0.26500379747184266 -0.94395993949633739 -0.19675522852410707
-0.49982529754025784 0.14730961092137676 0.85311732979922927  -0.48165648852028142 -0.86526167125339759 -0.13902973540250096
-0.056092588060981829 0.80345079128735619 0.73465643734769381  -0.94395993949633739 -0.19675522852410574 -0.26500379747184372
-0.20692923660476614 0.89148810692249181 0.40180685413975092  -0.80340332070769305 -0.10210073274615397 -0.58661618171386143
-0.24184951424973422 0.35660859546245849 0.90157505838463314  -0.74804169499389739 -0.65387638494521549 -0.11348698498785463
-0.26867774954383261 0.31796791425349591 1  -0.73148465290216647 -0.68185778206712322 0.00040939357642524513
-0.25264179677362608 0.68197669984104492 1.5833668628112616  -0.74719269579232783 -0.31838810336562501 0.58337988565756516
-0.067331828143176842 0.84509837997657777 1.3257845443224259  -0.93258589678337067 -0.15536789040624877 0.32579804135609564
-0.22008392847609459 0.37411588821993691 1.0000000000000002  -0.78016657033104053 -0.62557183613071188 -1.9440969464683821e-05
-0.42357936956725528 0.22223344816659951 1.2506360861103192  -0.57677917521734989 -0.7774710255221281 0.25072811471624856
-1 0.22008392847609459 1.6258841117800631  -1.9440969465128357e-05 -0.7801665703310412 0.6255718361307111
-0.74936391388968104 0.42357936956725517 1.7777665518334005  -0.25072811471624762 -0.57677917521734978 0.77747102552212832
-0.25264179677362608 1.3180233001589552 0.41663313718873873  -0.7471732548228619 0.31837608818572111 -0.58341134180693521
-0.067331828143176842 1.154901620023423 0.67421545567757435  -0.93258589678337045 0.15536789040624938 -0.32579804135609586
-0.056092588060981941 0.80345079128735619 1.2653435626523064  -0.94394792431643348 -0.19678668467347479 0.26502323844130921
-0.067331828143176842 1.1549016200234223 1.3257845443224259  -0.93283891592837731 0.15470547768481682 0.32538864777967064
-1.6562122655612299 1.3949848817576367 1.6429404371401004  0.65613064511909525 0.3953635844294397 0.64279095563231536
-1.4382389584574513 1.5296997941879908 1.7261988318135251  0.43849581670457083 0.52986930552536793 0.72592006295091172
-1.2047014786826495 1.9270588370822881 1.3141006482208728  0.20429513892774237 0.92713596376716523 0.31413755092319701
-1.0699865662522952 1.8438004424088632 1.5320739553246518  0.069789417831816108 0.84400685644856677 0.53177237933772425
-0.47030020581200926 1.7261988318135253 1.4382389584574511  -0.52986930552536826 0.72592006295091105 0.43849581670457166
-0.60501511824236354 1.6429404371401004 1.6562122655612299  -0.39536358442944064 0.64279095563231525 0.6561306451190948
-0.46792604467534848 1.0699865662522952 1.8438004424088636  -0.53177237933772226 0.069789417831815984 0.8440068564485681
-0.68589935177912764 1.2047014786826495 1.9270588370822881  -0.31413755092319928 0.20429513892774442 0.9271359637671639
-1.2008600052687632 0.86528508756964573 1.9703129137821027  0.20121590081625335 -0.13450572109592765 0.97026819604229442
-1.2008600052687632 1.1347149124303546 1.9703129137821027  0.20121590081625498 0.13450572109592823 0.97026819604229397
-0.79913999473123709 0.86528508756964573 0.029687086217897174  -0.20121590081625246 -0.13450572109592823 -0.97026819604229453
-0.79913999473123709 1.1347149124303546 0.029687086217897174  -0.20121590081625268 0.13450572109592809 -0.97026819604229442
-0.34378773443876987 1.3949848817576367 0.3570595628598997  -0.65613064511909591 0.39536358442944042 -0.64279095563231414
-0.56176104154254902 1.5296997941879913 0.27380116818647482  -0.43849581670457066 0.52986930552536926 -0.72592006295091094
-0.7952985213173509 1.9270588370822881 0.68589935177912764  -0.20429513892774312 0.92713596376716456 -0.31413755092319812
-0.93001343374770529 1.8438004424088634 0.46792604467534826  -0.069789417831816344 0.84400685644856788 -0.53177237933772259
-1.5296997941879913 1.7261988318135248 0.56176104154254891  0.52986930552536782 0.72592006295091183 -0.43849581670457094
-1.3949848817576367 1.6429404371401006 0.34378773443876998  0.3953635844294397 0.64279095563231481 -0.6561306451190958
-1.5320739553246518 1.0699865662522952 0.15619955759113668  0.5317723793377247 0.069789417831816816 -0.84400685644856654
-1.3141006482208728 1.2047014786826495 0.07294116291771191  0.31413755092319812 0.20429513892774287 -0.92713596376716467
-1.0699865662522952 0.15619955759113668 1.5320739553246518  0.069789417831816025 -0.84400685644856654 0.5317723793377247
-1.2047014786826495 0.07294116291771191 1.3141006482208728  0.20429513892774351 -0.92713596376716445 0.31413755092319806
-0.86528508756964573 0.029687086217897174 0.79913999473123709  -0.13450572109592823 -0.97026819604229453 -0.20121590081625246
-1.1347149124303546 0.029687086217897174 0.79913999473123709  0.13450572109592809 -0.97026819604229442 -0.20121590081625268
-1.3949848817576367 0.3570595628598997 0.34378773443876987  0.39536358442944003 -0.64279095563231436 -0.65613064511909602
-1.5296997941879913 0.27380116818647482 0.56176104154254902  0.52986930552536893 -0.72592006295091072 -0.43849581670457122
-1.9270588370822881 0.68589935177912764 0.7952985213173509  0.92713596376716489 -0.3141375509231974 -0.20429513892774293
-1.8438004424088634 0.46792604467534826 0.93001343374770529  0.84400685644856788 -0.53177237933772259 -0.069789417831816358
-1.7261988318135253 0.56176104154254913 1.5296997941879908  0.72592006295091149 -0.43849581670457066 0.52986930552536848
-1.6429404371401006 0.34378773443876998 1.3949848817576367  0.64279095563231481 -0.6561306451190958 0.3953635844294397
-1.6429404371401004 1.6562122655612299 1.3949848817576369  0.6427909556323147 0.65613064511909547 0.3953635844294407
-1.7261988318135248 1.4382389584574513 1.5296997941879911  0.72592006295091149 0.43849581670457166 0.52986930552536771
-0.46792604467534826 0.93001343374770529 0.15619955759113657  -0.53177237933772314 -0.069789417831815331 -0.84400685644856765
-0.68589935177912764 0.7952985213173509 0.072941162917711577  -0.31413755092319845 -0.20429513892774354 -0.92713596376716445
-0.029687086217897396 1.2008600052687632 1.1347149124303546  -0.97026819604229431 0.20121590081625271 0.13450572109592898
-0.029687086217897174 1.2008600052687632 0.86528508756964573  -0.97026819604229431 0.20121590081625348 -0.13450572109592815
-0.68589935177912764 0.7952985213173509 1.9270588370822881  -0.31413755092319667 -0.20429513892774248 0.92713596376716523
-0.46792604467534826 0.93001343374770529 1.8438004424088634  -0.53177237933772259 -0.069789417831816344 0.84400685644856788
-0.27380116818647515 1.4382389584574511 1.5296997941879913  -0.72592006295091105 0.43849581670457111 0.52986930552536859
-0.3570595628598997 1.6562122655612304 1.3949848817576367  -0.64279095563231425 0.65613064511909602 0.39536358442944025
-0.79913999473123698 1.1347149124303548 1.9703129137821027  -0.20121590081625307 0.13450572109592912 0.9702681960422942
-0.79913999473123698 0.86528508756964573 1.9703129137821027  -0.20121590081625254 -0.13450572109592954 0.97026819604229431
-1.4382389584574511 0.47030020581200926 1.7261988318135253  0.43849581670457166 -0.52986930552536826 0.72592006295091105
-1.6562122655612299 0.60501511824236354 1.6429404371401004  0.65613064511909469 -0.39536358442944097 0.64279095563231514
-1.3141006482208728 1.2047014786826495 1.9270588370822881  0.31413755092319628 0.20429513892774195 0.92713596376716545
-1.5320739553246518 1.0699865662522952 1.8438004424088632  0.53177237933772425 0.069789417831816108 0.84400685644856677
-1.9270588370822881 1.3141006482208728 1.2047014786826495  0.92713596376716545 0.31413755092319628 0.20429513892774195
-1.8438004424088632 1.5320739553246518 1.0699865662522952  0.84400685644856688 0.53177237933772437 0.069789417831816108
-1.3949848817576369 1.6429404371401004 1.6562122655612299  0.39536358442944108 0.64279095563231448 0.65613064511909536
-1.5296997941879911 1.7261988318135248 1.4382389584574513  0.52986930552536793 0.72592006295091183 0.43849581670457083
-1.1347149124303548 1.9703129137821027 0.79913999473123687  0.13450572109592798 0.9702681960422942 -0.20121590081625382
-0.86528508756964584 1.9703129137821027 0.79913999473123709  -0.13450572109592848 0.9702681960422942 -0.20121590081625337
-0.93001343374770529 1.8438004424088634 1.5320739553246518  -0.069789417831815317 0.84400685644856699 0.53177237933772403
-0.7952985213173509 1.9270588370822881 1.3141006482208728  -0.20429513892774187 0.92713596376716512 0.31413755092319728
-0.15619955759113668 1.5320739553246518 1.0699865662522952  -0.84400685644856654 0.5317723793377247 0.069789417831816039
-0.07294116291771191 1.3141006482208728 1.2047014786826495  -0.92713596376716445 0.31413755092319806 0.20429513892774351
-0.56176104154254913 1.5296997941879908 1.7261988318135253  -0.43849581670457066 0.52986930552536848 0.72592006295091149
-0.34378773443876998 1.3949848817576367 1.6429404371401006  -0.65613064511909502 0.39536358442944081 0.64279095563231492
-0.34378773443876998 0.60501511824236354 1.6429404371401006  -0.65613064511909447 -0.39536358442944114 0.64279095563231536
-0.56176104154254913 0.47030020581200926 1.7261988318135253  -0.43849581670457161 -0.52986930552536848 0.72592006295091094
-1.4382389584574513 1.5296997941879913 0.27380116818647504  0.43849581670457027 0.52986930552536882 -0.72592006295091138
-1.6562122655612304 1.3949848817576367 0.3570595628598997  0.65613064511909658 0.39536358442944047 -0.64279095563231359
-1.6562122655612304 0.60501511824236343 0.3570595628598997  0.65613064511909602 -0.39536358442944036 -0.64279095563231414
-1.4382389584574513 0.47030020581200915 0.27380116818647493  0.43849581670457005 -0.52986930552536859 -0.72592006295091183
-1.2008600052687632 1.1347149124303546 0.029687086217897396  0.20121590081625301 0.13450572109592879 -0.97026819604229431
-1.2008600052687632 0.86528508756964573 0.029687086217897174  0.20121590081625285 -0.13450572109592773 -0.97026819604229453
-0.30397342055421117 0.90687073458352585 0.28910030252843327  -0.68096837004796129 -0.091975091050974067 -0.72651404777911077
-0.33295004022963903 0.90494753379947435 0.26218372058148826  -0.68096837004795807 -0.091975091050972152 -0.72651404777911399
-0.68589935177912764 1.2047014786826495 0.072941162917711799  -0.31413755092319828 0.2042951389277439 -0.92713596376716445
-0.46792604467534848 1.0699865662522952 0.15619955759113646  -0.53177237933772326 0.069789417831815442 -0.84400685644856743
-0.07294116291771191 1.3141006482208728 0.7952985213173509  -0.92713596376716512 0.3141375509231974 -0.20429513892774237
-0.15619955759113657 1.5320739553246518 0.93001343374770529  -0.84400685644856699 0.53177237933772403 -0.069789417831815359
-0.60501511824236354 1.6429404371401004 0.34378773443876998  -0.39536358442944058 0.64279095563231503 -0.65613064511909491
-0.47030020581200915 1.7261988318135253 0.56176104154254902  -0.52986930552537015 0.72592006295091005 -0.43849581670457105
-0.86528508756964584 1.9703129137821027 1.2008600052687632  -0.13450572109592765 0.97026819604229442 0.20121590081625323
-1.1347149124303546 1.9703129137821027 1.2008600052687632  0.13450572109592823 0.97026819604229397 0.20121590081625498
-1.0699865662522952 1.8438004424088636 0.46792604467534848  0.069789417831815984 0.8440068564485681 -0.53177237933772226
-1.2047014786826495 1.9270588370822881 0.68589935177912764  0.20429513892774379 0.92713596376716445 -0.31413755092319812
-1.8438004424088634 1.5320739553246518 0.93001343374770529  0.84400685644856699 0.53177237933772403 -0.069789417831815317
-1.9270588370822881 1.3141006482208728 0.7952985213173509  0.92713596376716512 0.31413755092319728 -0.20429513892774187
-1.8438004424088636 0.46792604467534848 1.0699865662522952  0.8440068564485681 -0.53177237933772226 0.069789417831815984
-1.9270588370822881 0.68589935177912764 1.2047014786826495  0.92713596376716356 -0.31413755092319917 0.20429513892774614
-1.5320739553246518 0.93001343374770529 1.8438004424088634  0.53177237933772403 -0.069789417831815317 0.84400685644856699
-1.3141006482208728 0.7952985213173509 1.9270588370822881  0.31413755092319728 -0.20429513892774187 0.92713596376716512
-1.5296997941879913 0.27380116818647515 1.4382389584574511  0.52986930552536859 -0.7259200629509116 0.43849581670457033
-1.3949848817576367 0.3570595628598997 1.6562122655612304  0.39536358442944047 -0.64279095563231359 0.65613064511909658
-0.60501511824236343 0.3570595628598997 1.6562122655612304  -0.39536358442944036 -0.64279095563231414 0.65613064511909602
-0.47030020581200915 0.27380116818647493 1.4382389584574513  -0.52986930552536871 -0.7259200629509116 0.43849581670457016
-1.1347149124303546 0.029687086217897396 1.2008600052687632  0.13450572109592879 -0.97026819604229431 0.20121590081625301
-0.86528508756964573 0.029687086217897174 1.2008600052687632  -0.13450572109592773 -0.97026819604229453 0.20121590081625285
-0.81389356246462441 0.11874744154864894 0.56789366986248413  -0.18423339416733714 -0.88583486239282039 -0.42585755017737514
-0.65746189559341328 0.74644278217951743 0.096124922711889452  -0.34889693998410853 -0.228242587483305 -0.90894237800239641
-1.2047014786826495 0.072941162917711799 0.68589935177912764  0.2042951389277439 -0.92713596376716445 -0.31413755092319828
-1.0699865662522952 0.15619955759113646 0.46792604467534848  0.069789417831815442 -0.84400685644856754 -0.53177237933772337
-1.3141006482208724 0.7952985213173509 0.072941162917711799  0.31413755092319873 -0.20429513892774345 -0.92713596376716434
-1.5320739553246518 0.93001343374770529 0.15619955759113657  0.53177237933772392 -0.06978941783181529 -0.8440068564485671
-1.6429404371401006 0.34378773443876998 0.60501511824236354  0.64279095563231536 -0.65613064511909447 -0.39536358442944114
-1.7261988318135253 0.56176104154254913 0.47030020581200926  0.72592006295091094 -0.43849581670457161 -0.52986930552536848
-1.9703129137821027 1.2008600052687632 0.86528508756964573  0.97026819604229442 0.20121590081625335 -0.13450572109592765
-1.9703129137821027 1.2008600052687632 1.1347149124303546  0.97026819604229397 0.20121590081625498 0.13450572109592823
-1.9703129137821027 0.79913999473123709 1.1347149124303546  0.97026819604229453 -0.20121590081625301 0.13450572109592734
-1.9703129137821027 0.79913999473123709 0.86528508756964584  0.97026819604229431 -0.20121590081625226 -0.13450572109592943
-1.7261988318135253 1.4382389584574511 0.47030020581200926  0.72592006295091105 0.43849581670457166 -0.52986930552536826
-1.6429404371401004 1.6562122655612299 0.60501511824236354  0.64279095563231503 0.65613064511909469 -0.39536358442944092
-0.93001343374770529 0.15619955759113657 0.46792604467534826  -0.069789417831815331 -0.84400685644856765 -0.53177237933772314
-0.7952985213173509 0.072941162917711799 0.68589935177912764  -0.20429513892774315 -0.92713596376716467 -0.31413755092319795
-0.15619955759113657 0.46792604467534826 0.93001343374770529  -0.84400685644856765 -0.53177237933772314 -0.069789417831815331
-0.072941162917711799 0.68589935177912764 0.7952985213173509  -0.92713596376716467 -0.31413755092319784 -0.2042951389277434
-0.62688758712066828 0.77156308049914157 0.10155294642477933  -0.34889693998411109 -0.22824258748330314 -0.90894237800239597
-0.87689701064830428 0.44478929974988757 0.17773204761375266  -0.14960718247367027 -0.56053609487440781 -0.8145041296980875
-0.3570595628598997 0.34378773443876987 1.3949848817576367  -0.64279095563231403 -0.6561306451190958 0.39536358442944103
-0.27380116818647504 0.56176104154254891 1.5296997941879913  -0.72592006295091083 -0.43849581670457122 0.52986930552536893
-0.072941162917711799 0.68589935177912764 1.2047014786826495  -0.92713596376716445 -0.31413755092319828 0.2042951389277437
-0.15619955759113646 0.46792604467534848 1.0699865662522952  -0.84400685644856754 -0.53177237933772337 0.069789417831815442
-0.7952985213173509 0.072941162917711799 1.3141006482208724  -0.20429513892774345 -0.92713596376716434 0.31413755092319873
-0.93001343374770529 0.15619955759113657 1.5320739553246518  -0.06978941783181529 -0.8440068564485671 0.53177237933772392
-0.3570595628598997 1.6562122655612304 0.60501511824236343  -0.6427909556323127 0.65613064511909669 -0.39536358442944169
-0.27380116818647493 1.4382389584574513 0.47030020581200915  -0.72592006295091149 0.43849581670457022 -0.52986930552536882
-0.029687086217897174 0.79913999473123709 0.86528508756964573  -0.97026819604229442 -0.20121590081625285 -0.13450572109592798
-0.029687086217897174 0.79913999473123709 1.1347149124303546  -0.97026819604229442 -0.20121590081625268 0.13450572109592809
-1.0650724998901953 1.6494337430038146 1.7576287898477037  0.065515668062196997 0.64992905036579063 0.75716571946238143
-1.143241458288871 1.4447847530509046 1.8841088214019377  0.1439907391710287 0.4444786469332952 0.88414105178604163
-1.1620856567445474 1.0671746383702749 1.984487586431394  0.16230850425355084 0.067102997401377637 0.9844557568457436
-1.3878111467046637 1.20668066329285 1.898268121393853  0.38778432700573318 0.20645471950357228 0.89833165619575694
-0.87351996844576596 1.6114818012702035 1.7810843797781308  -0.12697533232365799 0.61194488891505094 0.78064122227310206
-1.1264800315542343 1.611481801270203 1.7810843797781311  0.12697533232365701 0.61194488891505006 0.78064122227310273
-1.4879855916616425 1.4689407649943766 1.7361824646493051  0.48809649929758631 0.46907539604897797 0.73602315194220347
-1.4017661266241019 1.6946662549544924 1.5966764397267301  0.40197239864760087 0.69455121880115667 0.59667142984000998
-0.8567585417111292 1.444784753050905 1.8841088214019377  -0.143990739171028 0.44447864693329792 0.88414105178604041
-0.93492750010980485 1.6494337430038146 1.7576287898477037  -0.065515668062197524 0.64992905036579163 0.75716571946238043
-1.1395060249225755 1.8567519116990399 1.4965019947697513  0.1393517221021944 0.85685972305471014 0.49635925754815746
-0.86049397507742498 1.8567519116990399 1.4965019947697515  -0.1393517221021946 0.8568597230547097 0.49635925754815835
-1.0379519417336116 1.3797122531607096 1.9243258380670021  0.037984161450742231 0.37896297887110292 0.92463196144413262
-0.83330295178070157 1.5061922847149436 1.8461568796683263  -0.16746624198174989 0.50593831119476029 0.84615689033529951
-0.59823387337589862 1.6946662549544926 1.5966764397267301  -0.40197239864759882 0.69455121880115733 0.59667142984001076
-0.51201440833835776 1.4689407649943764 1.7361824646493056  -0.48809649929758536 0.46907539604897563 0.73602315194220547
-1.1666970482192984 1.5061922847149436 1.8461568796683263  0.16746624198175214 0.50593831119476107 0.84615689033529862
-0.96204805826638895 1.3797122531607096 1.9243258380670021  -0.037984161450741578 0.37896297887110258 0.92463196144413273
-0.61218885329533657 1.2066806632928504 1.8982681213938526  -0.38778432700573218 0.20645471950357264 0.89833165619575739
-0.83791434325545278 1.0671746383702752 1.9844875864313942  -0.16230850425355117 0.06710299740137686 0.9844557568457436
-0.83330295178070157 1.5061922847149436 0.15384312033167369  -0.167466241981751 0.50593831119476318 -0.8461568903352974
-1.0379519417336116 1.3797122531607096 0.075674161932997919  0.037984161450743188 0.37896297887110275 -0.92463196144413262
-1.3878111467046634 1.2066806632928504 0.10173187860614719  0.38778432700573318 0.20645471950357275 -0.89833165619575694
-1.1620856567445474 1.0671746383702752 0.015512413568605998  0.16230850425355273 0.067102997401378234 -0.98445575684574316
-0.93492750010980485 1.6494337430038146 0.24237121015229646  -0.065515668062195248 0.64992905036579229 -0.75716571946238009
-0.8567585417111292 1.4447847530509046 0.11589117859806208  -0.14399073917102873 0.44447864693329753 -0.88414105178604041
-0.83791434325545289 1.0671746383702749 0.015512413568605887  -0.16230850425355201 0.067102997401376541 -0.98445575684574349
-0.61218885329533657 1.2066806632928497 0.10173187860614707  -0.3877843270057334 0.2064547195035728 -0.89833165619575683
-1.1264800315542343 1.611481801270203 0.21891562022186883  0.12697533232365968 0.61194488891504861 -0.78064122227310351
-0.87351996844576596 1.6114818012702032 0.21891562022186895  -0.12697533232365921 0.61194488891504872 -0.78064122227310362
-0.51201440833835754 1.4689407649943766 0.26381753535069474  -0.48809649929758581 0.46907539604897669 -0.73602315194220458
-0.59823387337589873 1.6946662549544924 0.40332356027326965  -0.40197239864759921 0.69455121880115767 -0.59667142984001009
-1.143241458288871 1.4447847530509048 0.11589117859806231  0.14399073917102889 0.44447864693329692 -0.88414105178604063
-1.0650724998901953 1.6494337430038146 0.24237121015229646  0.065515668062196192 0.64992905036579041 -0.75716571946238154
-0.86049397507742531 1.8567519116990399 0.50349800523024868  -0.13935172210219521 0.85685972305470981 -0.4963592575481578
-1.1395060249225755 1.8567519116990399 0.50349800523024868  0.13935172210219604 0.85685972305470992 -0.49635925754815746
-0.96204805826638895 1.3797122531607096 0.075674161932997919  -0.037984161450742487 0.37896297887110214 -0.92463196144413284
-1.1666970482192986 1.5061922847149436 0.15384312033167369  0.1674662419817505 0.50593831119476218 -0.84615689033529828
-1.401766126624101 1.6946662549544926 0.40332356027326954  0.40197239864759843 0.69455121880115755 -0.59667142984001054
-1.4879855916616427 1.4689407649943764 0.26381753535069474  0.48809649929758553 0.46907539604897636 -0.73602315194220491
-1.3797122531607096 0.075674161932997919 0.96204805826638895  0.3789629788711022 -0.92463196144413295 -0.037984161450742494
-1.5061922847149436 0.15384312033167369 1.1666970482192986  0.50593831119476196 -0.8461568903352984 0.16746624198175047
-1.6946662549544926 0.40332356027326954 1.401766126624101  0.69455121880115944 -0.59667142984000909 0.40197239864759748
-1.4689407649943764 0.26381753535069496 1.4879855916616429  0.46907539604897752 -0.73602315194220436 0.48809649929758536
-1.5061922847149436 0.15384312033167369 0.83330295178070157  0.50593831119476174 -0.84615689033529806 -0.16746624198175178
-1.3797122531607096 0.075674161932997919 1.0379519417336116  0.37896297887110275 -0.92463196144413262 0.037984161450743188
-1.2066806632928504 0.1017318786061473 1.3878111467046637  0.20645471950357205 -0.89833165619575706 0.38778432700573334
-1.0671746383702752 0.015512413568605998 1.1620856567445474  0.067102997401378234 -0.98445575684574316 0.16230850425355273
-1.6494337430038146 0.24237121015229646 0.93492750010980485  0.6499290503657924 -0.75716571946238009 -0.065515668062194124
-1.4447847530509046 0.11589117859806219 0.8567585417111292  0.44447864693329742 -0.88414105178604052 -0.1439907391710287
-1.0671746383702749 0.015512413568605887 0.83791434325545289  0.067102997401376541 -0.98445575684574349 -0.16230850425355201
-1.2066806632928497 0.10173187860614707 0.61218885329533657  0.20645471950357278 -0.89833165619575683 -0.38778432700573334
-1.6114818012702032 0.21891562022186895 1.1264800315542343  0.61194488891504872 -0.78064122227310329 0.12697533232366032
-1.6114818012702032 0.21891562022186895 0.87351996844576596  0.61194488891504961 -0.78064122227310295 -0.12697533232365879
-1.4689407649943766 0.26381753535069474 0.51201440833835754  0.46907539604897569 -0.73602315194220502 -0.48809649929758603
-1.6946662549544924 0.40332356027326965 0.59823387337589873  0.69455121880115789 -0.5966714298400102 -0.40197239864759871
-1.4447847530509048 0.11589117859806242 1.143241458288871  0.44447864693329897 -0.88414105178603974 0.14399073917102839
-1.6494337430038146 0.24237121015229646 1.0650724998901953  0.64992905036579118 -0.75716571946238098 0.065515668062195817
-1.8567519116990399 0.50349800523024868 0.86049397507742531  0.85685972305470981 -0.4963592575481578 -0.13935172210219521
-1.8567519116990399 0.50349800523024868 1.1395060249225755  0.85685972305471014 -0.49635925754815724 0.13935172210219549
-1.7576287898477037 1.0650724998901953 1.6494337430038146  0.75716571946238143 0.065515668062196997 0.64992905036579063
-1.8841088214019377 1.143241458288871 1.4447847530509046  0.88414105178604152 0.14399073917102873 0.4444786469332952
-1.984487586431394 1.1620856567445474 1.0671746383702749  0.9844557568457436 0.16230850425355084 0.067102997401377637
-1.898268121393853 1.3878111467046637 1.20668066329285  0.89833165619575706 0.38778432700573323 0.2064547195035723
-1.0379519417336116 0.62028774683929067 0.075674161932997919  0.037984161450742605 -0.37896297887110292 -0.92463196144413262
-0.11874744154864894 0.56789366986248413 0.81389356246462441  -0.88583486239282028 -0.42585755017737542 -0.18423339416733708
-0.60630413399985716 0.78745552743149316 0.10609528287383588  -0.42092243512975502 -0.23042761042597287 -0.87734110809753652
-0.74011618472454033 0.66455433327713243 0.095362650095153101  -0.26377483182397443 -0.35458300388088787 -0.89704722922209634
-0.15384312033167369 1.1666970482192984 0.4938077152850564  -0.84615689033529851 0.16746624198175161 -0.5059383111947614
-0.075674161932997919 0.96204805826638895 0.62028774683929022  -0.92463196144413251 -0.037984161450742515 -0.37896297887110314
-0.10173187860614707 0.61218885329533657 0.79331933670715005  -0.89833165619575817 -0.38778432700573134 -0.20645471950357069
-0.015512413568605887 0.83791434325545289 0.93282536162972529  -0.98445575684574349 -0.16230850425355176 -0.067102997401376721
-0.21891562022186895 1.1264800315542343 1.6114818012702032  -0.78064122227310229 0.12697533232366082 0.61194488891505006
-0.21891562022186895 0.87351996844576596 1.6114818012702032  -0.78064122227310295 -0.12697533232365879 0.61194488891504961
-0.26381753535069474 0.51201440833835754 1.4689407649943766  -0.73602315194220458 -0.48809649929758586 0.46907539604897652
-0.40332356027326965 0.59823387337589873 1.6946662549544924  -0.59667142984001009 -0.40197239864759915 0.69455121880115767
-0.55521524694909519 1.8841088214019377 1.143241458288871  -0.44447864693329769 0.88414105178604052 0.14399073917102762
-0.35056625699618549 1.7576287898477037 1.0650724998901953  -0.64992905036579041 0.75716571946238154 0.06551566806219597
-0.14324808830096003 1.4965019947697515 0.86049397507742531  -0.85685972305470948 0.49635925754815841 -0.13935172210219565
-0.14324808830096014 1.4965019947697515 1.1395060249225755  -0.85685972305471025 0.49635925754815741 0.13935172210219432
-0.83330295178070157 0.49380771528505629 1.8461568796683263  -0.16746624198175108 -0.50593831119476129 0.84615689033529862
-1.0379519417336116 0.62028774683929033 1.9243258380670021  0.0379841614507423 -0.37896297887110325 0.92463196144413251
-1.3878111467046637 0.79331933670715005 1.898268121393853  0.38778432700573245 -0.20645471950357219 0.89833165619575739
-1.1620856567445474 0.93282536162972529 1.984487586431394  0.16230850425355184 -0.067102997401377096 0.98445575684574338
-1.8841088214019377 0.8567585417111292 1.444784753050905  0.8841410517860403 -0.143990739171028 0.44447864693329786
-1.7576287898477037 0.93492750010980485 1.6494337430038146  0.75716571946238087 -0.065515668062197788 0.64992905036579129
-1.4965019947697513 1.1395060249225755 1.8567519116990399  0.49635925754815818 0.13935172210219413 0.85685972305470992
-1.4965019947697515 0.86049397507742498 1.8567519116990399  0.49635925754815835 -0.1393517221021946 0.8568597230547097
-1.7810843797781308 0.87351996844576596 1.6114818012702035  0.78064122227310206 -0.12697533232365713 0.61194488891505106
-1.7810843797781311 1.1264800315542343 1.611481801270203  0.78064122227310273 0.12697533232365701 0.61194488891505006
-1.7361824646493051 1.4879855916616425 1.4689407649943764  0.73602315194220291 0.48809649929758647 0.46907539604897841
-1.5966764397267301 1.4017661266241017 1.6946662549544924  0.59667142984001054 0.40197239864760048 0.69455121880115633
-1.6114818012702035 1.7810843797781308 0.87351996844576596  0.61194488891505106 0.78064122227310206 -0.12697533232365713
-1.6114818012702035 1.7810843797781308 1.1264800315542343  0.61194488891504928 0.78064122227310329 0.12697533232365751
-1.4689407649943766 1.7361824646493051 1.4879855916616425  0.46907539604897841 0.73602315194220291 0.48809649929758642
-1.6946662549544924 1.5966764397267301 1.4017661266241019  0.69455121880115667 0.59667142984001009 0.40197239864760087
-1.6494337430038151 1.7576287898477032 1.0650724998901953  0.64992905036579085 0.75716571946238109 0.065515668062197163
-1.4447847530509046 1.8841088214019377 1.143241458288871  0.44447864693329636 0.88414105178604074 0.14399073917103053
-1.0671746383702749 1.984487586431394 1.1620856567445474  0.067102997401377734 0.9844557568457436 0.16230850425355067
-1.2066806632928497 1.898268121393853 1.3878111467046634  0.20645471950357158 0.89833165619575683 0.38778432700573384
-0.49380771528505629 1.8461568796683263 0.83330295178070157  -0.50593831119475974 0.84615689033529939 -0.16746624198175153
-0.62028774683929033 1.9243258380670021 1.0379519417336116  -0.37896297887110225 0.92463196144413284 0.03798416145074391
-0.79331933670715005 1.898268121393853 1.3878111467046637  -0.20645471950357219 0.89833165619575739 0.38778432700573245
-0.93282536162972529 1.984487586431394 1.1620856567445474  -0.067102997401377193 0.98445575684574338 0.16230850425355184
-0.62028774683929067 1.9243258380670021 0.96204805826638862  -0.37896297887110292 0.92463196144413262 -0.037984161450742369
-0.49380771528505629 1.8461568796683263 1.1666970482192989  -0.50593831119476051 0.84615689033529906 0.16746624198175156
-0.30533374504550748 1.5966764397267301 1.4017661266241017  -0.69455121880115767 0.59667142984001031 0.40197239864759854
-0.53105923500562402 1.7361824646493054 1.4879855916616427  -0.46907539604897591 0.73602315194220469 0.48809649929758631
-0.075674161932997919 0.96204805826638895 1.3797122531607096  -0.92463196144413295 -0.037984161450742494 0.3789629788711022
-0.15384312033167369 1.1666970482192986 1.5061922847149436  -0.84615689033529917 0.16746624198175086 0.50593831119476051
-0.40332356027326965 1.4017661266241013 1.6946662549544924  -0.59667142984000909 0.4019723986475976 0.69455121880115944
-0.26381753535069508 1.4879855916616427 1.4689407649943766  -0.73602315194220436 0.48809649929758508 0.46907539604897769
-0.11589117859806242 1.143241458288871 1.4447847530509048  -0.88414105178604041 0.14399073917102875 0.44447864693329764
-0.24237121015229646 1.0650724998901953 1.6494337430038146  -0.75716571946238043 0.065515668062195359 0.64992905036579174
-0.50349800523024868 0.86049397507742531 1.8567519116990399  -0.49635925754815718 -0.13935172210219426 0.85685972305471036
-0.50349800523024868 1.1395060249225755 1.8567519116990399  -0.49635925754815757 0.13935172210219526 0.85685972305471003
-0.93492750010980485 0.35056625699618549 1.7576287898477037  -0.065515668062194915 -0.64992905036579185 0.75716571946238054
-0.8567585417111292 0.55521524694909519 1.8841088214019377  -0.143990739171027 -0.44447864693329669 0.88414105178604108
-0.83791434325545278 0.93282536162972529 1.9844875864313942  -0.16230850425355092 -0.067102997401377082 0.9844557568457436
-0.61218885329533645 0.79331933670715005 1.898268121393853  -0.38778432700573218 -0.20645471950357122 0.89833165619575761
-1.8841088214019377 1.143241458288871 0.55521524694909519  0.88414105178604052 0.14399073917102762 -0.44447864693329769
-1.7576287898477037 1.0650724998901953 0.35056625699618549  0.75716571946238143 0.06551566806219504 -0.64992905036579074
-1.4965019947697515 0.86049397507742531 0.14324808830096003  0.49635925754815785 -0.13935172210219532 -0.85685972305470992
-1.4965019947697513 1.1395060249225755 0.14324808830096014  0.49635925754815757 0.13935172210219454 -0.85685972305471014
-1.0650724998901953 0.35056625699618549 0.24237121015229646  0.065515668062195706 -0.64992905036579085 -0.7571657194623812
-1.143241458288871 0.55521524694909541 0.11589117859806231  0.14399073917102936 -0.44447864693329703 -0.88414105178604063
-1.1620856567445474 0.93282536162972529 0.015512413568605998  0.16230850425355278 -0.067102997401376527 -0.98445575684574327
-1.3878111467046634 0.79331933670715005 0.10173187860614719  0.38778432700573295 -0.20645471950357144 -0.89833165619575728
-1.1666970482192984 0.4938077152850564 0.15384312033167369  0.16746624198175161 -0.5059383111947614 -0.84615689033529851
-0.96204805826638895 0.62028774683929033 0.07567416193299803  -0.037984161450742585 -0.37896297887110308 -0.92463196144413251
-0.61218885329533657 0.79331933670715005 0.10173187860614719  -0.38778432700574184 -0.20645471950357805 -0.89833165619575206
-0.83791434325545289 0.93282536162972529 0.015512413568605887  -0.16230850425355187 -0.067102997401376666 -0.98445575684574349
-0.11589117859806231 0.85675854171112931 0.55521524694909541  -0.88414105178603941 -0.14399073917102917 -0.44447864693329936
-0.24237121015229635 0.93492750010980485 0.35056625699618549  -0.75716571946237998 -0.065515668062194277 -0.6499290503657924
-0.50349800523024868 1.1395060249225755 0.14324808830096003  -0.49635925754815807 0.13935172210219565 -0.8568597230547097
-0.50349800523024868 0.86049397507742498 0.14324808830096003  -0.49635925754815802 -0.13935172210219071 -0.85685972305471059
-0.1473096109213767 0.85311732979922927 0.49982529754025778  -0.86526167125338915 -0.13902973540249458 -0.48165648852029841
-0.21891562022186895 1.1264800315542343 0.38851819872979687  -0.78064122227310362 0.12697533232366026 -0.6119448889150485
-0.26381753535069463 1.4879855916616429 0.5310592350056238  -0.73602315194220413 0.48809649929758597 -0.46907539604897697
-0.40332356027326977 1.4017661266241015 0.30533374504550737  -0.59667142984001065 0.4019723986475997 -0.69455121880115689
-0.38851819872979698 1.7810843797781313 1.1264800315542343  -0.61194488891504983 0.78064122227310284 0.1269753323236579
-0.38851819872979698 1.7810843797781313 0.87351996844576596  -0.61194488891504895 0.7806412222731034 -0.12697533232365929
-0.53105923500562391 1.7361824646493056 0.51201440833835743  -0.46907539604897519 0.73602315194220569 -0.48809649929758531
-0.30533374504550737 1.5966764397267303 0.59823387337589851  -0.69455121880115733 0.5966714298400102 -0.40197239864759954
-0.35056625699618538 1.7576287898477037 0.93492750010980485  -0.64992905036579185 0.75716571946238054 -0.065515668062194138
-0.55521524694909519 1.8841088214019377 0.8567585417111292  -0.44447864693329786 0.88414105178604041 -0.14399073917102828
-0.93282536162972529 1.9844875864313942 0.83791434325545266  -0.067102997401377457 0.98445575684574349 -0.16230850425355106
-0.79331933670715016 1.898268121393853 0.61218885329533679  -0.20645471950357205 0.89833165619575739 -0.3877843270057324
-1.5061922847149436 1.8461568796683263 1.1666970482192984  0.50593831119476174 0.84615689033529806 0.16746624198175189
-1.3797122531607098 1.9243258380670021 0.96204805826638862  0.37896297887110236 0.92463196144413284 -0.037984161450740857
-1.2066806632928504 1.8982681213938526 0.61218885329533623  0.20645471950357189 0.89833165619575717 -0.38778432700573306
-1.0671746383702752 1.984487586431394 0.83791434325545278  0.067102997401377748 0.98445575684574371 -0.16230850425354995
-1.3797122531607098 1.9243258380670021 1.0379519417336116  0.37896297887110109 0.9246319614441334 0.037984161450741599
-1.5061922847149436 1.8461568796683263 0.83330295178070157  0.50593831119476029 0.84615689033529906 -0.16746624198175192
-1.6946662549544926 1.5966764397267301 0.59823387337589862  0.69455121880115733 0.59667142984001076 -0.40197239864759882
-1.4689407649943764 1.7361824646493054 0.51201440833835765  0.46907539604897786 0.73602315194220436 -0.48809649929758503
-1.9243258380670021 0.96204805826638895 0.62028774683929067  0.92463196144413262 -0.037984161450742376 -0.37896297887110297
-1.8461568796683263 1.1666970482192989 0.49380771528505629  0.84615689033529906 0.16746624198175156 -0.50593831119476051
-1.5966764397267303 1.4017661266241015 0.30533374504550737  0.59667142984001043 0.40197239864759859 -0.69455121880115778
-1.7361824646493054 1.4879855916616427 0.53105923500562402  0.73602315194220469 0.48809649929758631 -0.46907539604897591
-1.9243258380670021 1.0379519417336116 1.3797122531607096  0.92463196144413295 0.037984161450743605 0.37896297887110214
-1.8461568796683263 0.83330295178070157 1.5061922847149436  0.84615689033529851 -0.16746624198175161 0.5059383111947614
-1.5966764397267301 0.59823387337589862 1.6946662549544926  0.59667142984001065 -0.40197239864759882 0.69455121880115733
-1.7361824646493056 0.51201440833835776 1.4689407649943764  0.73602315194220547 -0.48809649929758536 0.46907539604897563
-0.96204805826638895 0.62028774683929067 1.9243258380670021  -0.037984161450742376 -0.37896297887110297 0.92463196144413262
-1.1666970482192989 0.49380771528505629 1.8461568796683263  0.16746624198175186 -0.50593831119476085 0.84615689033529884
-1.4017661266241015 0.30533374504550737 1.5966764397267303  0.40197239864759848 -0.69455121880115778 0.59667142984001043
-1.4879855916616427 0.53105923500562402 1.7361824646493054  0.48809649929758631 -0.46907539604897591 0.73602315194220469
-1.143241458288871 0.55521524694909519 1.8841088214019377  0.1439907391710277 -0.44447864693329725 0.88414105178604063
-1.0650724998901953 0.35056625699618549 1.7576287898477037  0.06551566806219615 -0.64992905036579074 0.75716571946238143
-0.86049397507742531 0.14324808830096003 1.4965019947697515  -0.13935172210219565 -0.85685972305470948 0.49635925754815841
-1.1395060249225755 0.14324808830096014 1.4965019947697515  0.13935172210219443 -0.85685972305471014 0.49635925754815763
-0.35056625699618538 0.24237121015229635 1.0650724998901953  -0.64992905036579096 -0.7571657194623812 0.065515668062195775
-0.55521524694909519 0.11589117859806231 1.143241458288871  -0.4444786469332962 -0.88414105178604108 0.14399073917102925
-0.93282536162972529 0.015512413568605998 1.1620856567445474  -0.067102997401376679 -0.98445575684574338 0.16230850425355256
-0.79331933670715005 0.10173187860614719 1.3878111467046634  -0.20645471950357144 -0.89833165619575728 0.38778432700573295
-0.4938077152850564 0.15384312033167369 1.1666970482192984  -0.5059383111947614 -0.84615689033529851 0.16746624198175114
-0.62028774683929022 0.075674161932997919 0.96204805826638895  -0.37896297887110314 -0.92463196144413251 -0.037984161450742515
-0.79331933670715005 0.10173187860614707 0.61218885329533657  -0.20645471950357444 -0.89833165619575495 -0.3877843270057369
-0.93282536162972529 0.015512413568605887 0.83791434325545289  -0.067102997401376721 -0.98445575684574349 -0.16230850425355176
-0.85675854171112931 0.55521524694909541 0.11589117859806231  -0.14399073917102739 -0.44447864693330652 -0.88414105178603619
-0.93492750010980485 0.35056625699618549 0.24237121015229646  -0.065515668062196844 -0.64992905036579152 -0.75716571946238065
-1.1395060249225755 0.14324808830096003 0.50349800523024868  0.13935172210219565 -0.8568597230547097 -0.49635925754815807
-0.86049397507742498 0.14324808830096003 0.50349800523024868  -0.13935172210219227 -0.85685972305471036 -0.49635925754815791
-0.13944047800987086 0.84405122505983243 0.51657855931435837  -0.86526167125339726 -0.13902973540249861 -0.48165648852028276
-1.1264800315542343 0.38851819872979687 0.21891562022186895  0.12697533232366026 -0.6119448889150485 -0.78064122227310362
-1.4879855916616429 0.5310592350056238 0.26381753535069463  0.48809649929758614 -0.46907539604897636 -0.73602315194220458
-1.4017661266241017 0.30533374504550759 0.40332356027326965  0.40197239864759887 -0.69455121880115778 -0.5966714298400102
-1.7810843797781308 1.1264800315542343 0.38851819872979676  0.78064122227310273 0.12697533232365821 -0.61194488891504994
-1.7810843797781313 0.87351996844576596 0.38851819872979698  0.7806412222731034 -0.12697533232365993 -0.61194488891504883
-1.7361824646493056 0.51201440833835754 0.53105923500562391  0.73602315194220502 -0.48809649929758481 -0.46907539604897686
-1.5966764397267303 0.59823387337589851 0.30533374504550737  0.59667142984000987 -0.40197239864759843 -0.69455121880115811
-1.7576287898477037 0.93492750010980485 0.35056625699618549  0.75716571946238054 -0.065515668062193264 -0.64992905036579207
-1.8841088214019377 0.8567585417111292 0.55521524694909519  0.88414105178604108 -0.143990739171027 -0.44447864693329669
-1.9844875864313942 0.83791434325545289 0.93282536162972529  0.98445575684574349 -0.16230850425355109 -0.067102997401377179
-1.898268121393853 0.61218885329533679 0.79331933670715016  0.89833165619575739 -0.3877843270057324 -0.20645471950357205
-1.8461568796683263 1.1666970482192984 1.5061922847149436  0.84615689033529806 0.16746624198175303 0.50593831119476163
-1.9243258380670021 0.96204805826638895 1.3797122531607096  0.92463196144413273 -0.037984161450741578 0.37896297887110258
-1.8982681213938526 0.61218885329533657 1.2066806632928504  0.89833165619575728 -0.38778432700573251 0.20645471950357247
-1.984487586431394 0.83791434325545289 1.0671746383702752  0.98445575684574349 -0.16230850425355134 0.067102997401377082
-1.8461568796683263 0.83330295178070157 0.49380771528505629  0.84615689033529873 -0.16746624198175111 -0.50593831119476129
-1.9243258380670021 1.0379519417336116 0.62028774683929033  0.92463196144413284 0.03798416145074391 -0.37896297887110225
-1.898268121393853 1.3878111467046637 0.79331933670715005  0.89833165619575739 0.38778432700573245 -0.20645471950357216
-1.984487586431394 1.1620856567445474 0.93282536162972529  0.98445575684574338 0.16230850425355176 -0.067102997401377137
-1.444784753050905 1.8841088214019377 0.8567585417111292  0.44447864693329997 0.88414105178603908 -0.14399073917102956
-1.6494337430038146 1.7576287898477037 0.93492750010980485  0.64992905036579129 0.75716571946238087 -0.065515668062197788
-1.8567519116990399 1.4965019947697513 1.1395060249225755  0.85685972305470981 0.49635925754815813 0.13935172210219413
-1.8567519116990399 1.4965019947697515 0.86049397507742498  0.8568597230547097 0.49635925754815835 -0.1393517221021946
-0.62028774683929067 0.075674161932997919 1.0379519417336116  -0.37896297887110292 -0.92463196144413262 0.037984161450742605
-0.15304821643557709 0.8581878051094145 0.48898817612201739  -0.84473325897900975 -0.12764403935075935 -0.51974293683793626
-0.85818780510941439 0.48898817612201739 0.15304821643557714  -0.12764403935075883 -0.51974293683794082 -0.8447332589790072
-0.78429103445404746 0.6100181237981781 0.10563529941394456  -0.22723563663234525 -0.37239734211022069 -0.89982453013547925
-0.075674161932997919 1.0379519417336116 0.62028774683929067  -0.92463196144413262 0.037984161450742605 -0.37896297887110292
-0.76032257344343512 0.64081678241520534 0.098941938751961195  -0.22723563663234739 -0.3723973421102092 -0.89982453013548358
-0.271410708194047 0.90595336478045674 0.32286639405373119  -0.73279395097327127 -0.089584884642379445 -0.67452766723137059
-0.25671454238163 0.90442701067601727 0.33903474443581866  -0.73279395097326483 -0.089584884642380458 -0.67452766723137736
-0.55521524694909541 0.11589117859806231 0.85675854171112931  -0.44447864693330141 -0.88414105178603852 -0.14399073917102853
-0.35056625699618549 0.24237121015229635 0.93492750010980485  -0.64992905036579296 -0.75716571946237954 -0.06551566806219436
-0.14324808830096003 0.50349800523024868 1.1395060249225755  -0.8568597230547097 -0.49635925754815807 0.13935172210219565
-0.14324808830096003 0.50349800523024868 0.86049397507742498  -0.85685972305470748 -0.49635925754815546 -0.13935172210221758
-0.24237121015229646 0.93492750010980485 1.6494337430038146  -0.75716571946238009 -0.065515668062194124 0.6499290503657924
-0.11589117859806231 0.8567585417111292 1.4447847530509046  -0.88414105178604052 -0.1439907391710287 0.44447864693329747
-0.015512413568605887 0.83791434325545289 1.0671746383702749  -0.98445575684574349 -0.16230850425355201 0.067102997401376541
-0.10173187860614707 0.61218885329533657 1.2066806632928497  -0.89833165619575683 -0.3877843270057334 0.2064547195035728
-0.68777595190194307 0.71884915497263779 0.093588483842681286  -0.30687826798314916 -0.2927056677356249 -0.90562084821138278
-0.38851819872979687 0.21891562022186895 1.1264800315542343  -0.61194488891504861 -0.78064122227310373 0.12697533232365907
-0.5310592350056238 0.26381753535069463 1.4879855916616429  -0.46907539604897669 -0.73602315194220391 0.48809649929758669
-0.30533374504550759 0.40332356027326965 1.4017661266241017  -0.69455121880115778 -0.5966714298400102 0.40197239864759887
-1.1264800315542343 0.38851819872979665 1.7810843797781311  0.12697533232365815 -0.61194488891505006 0.78064122227310273
-0.87351996844576596 0.38851819872979698 1.7810843797781313  -0.12697533232365973 -0.61194488891504917 0.78064122227310306
-0.51201440833835754 0.53105923500562391 1.7361824646493056  -0.48809649929758481 -0.46907539604897686 0.73602315194220502
-0.59823387337589851 0.30533374504550737 1.5966764397267303  -0.40197239864759932 -0.69455121880115789 0.59667142984000965
-0.24237121015229646 1.0650724998901953 0.35056625699618549  -0.75716571946238131 0.065515668062194596 -0.64992905036579096
-0.11589117859806231 1.143241458288871 0.55521524694909541  -0.88414105178604085 0.14399073917102956 -0.44447864693329636
-0.015512413568605998 1.1620856567445474 0.93282536162972529  -0.98445575684574338 0.16230850425355256 -0.067102997401376679
-0.10173187860614707 1.3878111467046637 0.79331933670715005  -0.89833165619575717 0.38778432700573334 -0.20645471950357158
-0.15384312033167369 0.83330295178070157 1.5061922847149436  -0.84615689033529817 -0.16746624198175178 0.50593831119476174
-0.075674161932997919 1.0379519417336116 1.3797122531607096  -0.92463196144413262 0.037984161450743181 0.37896297887110275
-0.1017318786061473 1.3878111467046637 1.2066806632928504  -0.89833165619575706 0.38778432700573334 0.206454719503572
-0.015512413568605998 1.1620856567445474 1.0671746383702752  -0.98445575684574316 0.16230850425355273 0.067102997401378234
-1.589425686808948 1.2073123918032649 1.7807681678543315  0.58928970592655772 0.20735457304096819 0.78085960551688727
-1.5760838378857436 1.3399483569044259 1.7433454959605346  0.5761012769843733 0.34013694034011327 0.74324570666303924
-1.4048073899588975 1.8217822259851766 1.4010049252683978  0.40477696304846178 0.82172156155092024 0.40115992505181941
-1.2746684461261839 1.8657421844304012 1.4183870394745819  0.27447137325094723 0.86581974808662054 0.41835586417422205
-0.66075903908278355 1.8623045076538935 1.3759607778954341  -0.33912378489964728 0.86229745711633865 0.37608264246842604
-0.59367059745735751 1.7843712383737109 1.4686770498343507  -0.40646863937642724 0.78424095119900916 0.46877433341208991
-0.38553016581808797 1.2728788208449453 1.7402458861856145  -0.6143669885099533 0.27300775118978038 0.74028370995146842
-0.47420617247402486 1.2082874004879671 1.8247164420172246  -0.52568280774650444 0.208139674214636 0.82482450355065051
-0.95947771833128337 0.86807143088604799 1.9904306120773461  -0.04057589556541806 -0.13176921185868271 0.99044963097837824
-1.0813709460566905 0.93361895436178288 1.9944708773603259  0.08157879688761252 -0.066331699036312225 0.99445714115859507
-1.0405222816687167 0.86807143088604799 0.009569387922653938  0.040575895565417595 -0.13176921185868218 -0.99044963097837835
-0.91862905394331018 0.93361895436178288 0.0055291226396741999  -0.081578796887611896 -0.066331699036312711 -0.99445714115859507
-0.41057431319105175 1.2073123918032649 0.21923183214566866  -0.58928970592655894 0.20735457304096755 -0.7808596055168866
-0.42391616211425609 1.3399483569044259 0.25665450403946555  -0.57610127698437241 0.34013694034011416 -0.74324570666303957
-0.5951926100411028 1.8217822259851768 0.59899507473160252  -0.40477696304846117 0.82172156155092091 -0.40115992505181874
-0.72533155387381631 1.8657421844304012 0.58161296052541867  -0.2744713732509485 0.86581974808662021 -0.41835586417422188
-1.3392409609172167 1.8623045076538935 0.6240392221045663  0.33912378489964923 0.86229745711633876 -0.37608264246842382
-1.4063294025426429 1.7843712383737109 0.53132295016564957  0.40646863937642858 0.78424095119900894 -0.46877433341208929
-1.6144698341819124 1.2728788208449453 0.25975411381438585  0.61436698850995342 0.27300775118978016 -0.74028370995146853
-1.5257938275259753 1.2082874004879671 0.1752835579827754  0.52568280774650489 0.20813967421463658 -0.82482450355065007
-1.2728788208449453 0.25975411381438585 1.6144698341819124  0.27300775118978016 -0.74028370995146853 0.61436698850995342
-1.2082874004879671 0.1752835579827754 1.5257938275259753  0.20813967421463603 -0.8248245035506494 0.525682807746506
-0.86807143088604799 0.009569387922653938 1.0405222816687167  -0.13176921185868143 -0.99044963097837846 0.040575895565418837
-0.93361895436178288 0.0055291226396741999 0.91862905394331018  -0.066331699036312766 -0.99445714115859507 -0.081578796887611951
-1.2073123918032649 0.21923183214566866 0.41057431319105175  0.20735457304096766 -0.78085960551688627 -0.58928970592655927
-1.3399483569044259 0.25665450403946555 0.42391616211425609  0.34013694034011571 -0.74324570666303824 -0.5761012769843733
-1.8217822259851768 0.59899507473160252 0.5951926100411028  0.82172156155092047 -0.4011599250518193 -0.4047769630484615
-1.8657421844304012 0.58161296052541867 0.72533155387381631  0.86581974808662021 -0.41835586417422188 -0.2744713732509485
-1.8623045076538935 0.6240392221045663 1.3392409609172167  0.86229745711633843 -0.37608264246842488 0.33912378489964895
-1.7843712383737111 0.53132295016564979 1.4063294025426427  0.78424095119900827 -0.46877433341208979 0.40646863937642919
-1.7807681678543315 1.589425686808948 1.2073123918032649  0.78085960551688727 0.58928970592655805 0.20735457304096708
-1.7433454959605346 1.5760838378857436 1.3399483569044259  0.74324570666303935 0.57610127698437341 0.34013694034011333
-0.70892487408416871 0.69813515078208477 0.093116941936638747  -0.30687826798315099 -0.29270566773562362 -0.90562084821138278
-0.64081678241520534 0.098941938751961223 0.76032257344343512  -0.37239734211021625 -0.89982453013548147 -0.227235636632344
-0.009569387922654049 0.95947771833128337 1.1319285691139529  -0.99044963097837835 -0.040575895565418178 0.13176921185868237
-0.0055291226396743109 1.0813709460566903 1.0663810456382175  -0.99445714115859496 0.08157879688761259 0.066331699036313585
-0.59899507473160252 0.5951926100411028 1.8217822259851768  -0.40115992505181913 -0.40477696304846172 0.82172156155092035
-0.58161296052541844 0.72533155387381609 1.865742184430401  -0.41835586417422188 -0.274471373250949 0.8658197480866201
-0.1376954923461069 1.3759607778954341 1.3392409609172171  -0.86229745711633821 0.37608264246842543 0.33912378489964906
-0.21562876162628963 1.4686770498343507 1.4063294025426434  -0.78424095119900883 0.46877433341208991 0.40646863937642791
-1.0405222816687167 1.1319285691139529 1.9904306120773461  0.040575895565417158 0.13176921185868218 0.99044963097837835
-0.91862905394331007 1.0663810456382177 1.9944708773603259  -0.081578796887612715 0.066331699036312017 0.99445714115859507
-1.3759607778954341 0.66075903908278355 1.8623045076538935  0.37608264246842604 -0.33912378489964728 0.86229745711633865
-1.4686770498343507 0.59367059745735751 1.7843712383737109  0.46877433341209013 -0.40646863937642613 0.78424095119900972
-1.4010049252683978 1.4048073899588975 1.8217822259851766  0.40115992505181941 0.40477696304846178 0.82172156155092024
-1.4183870394745819 1.2746684461261839 1.8657421844304007  0.41835586417422194 0.27447137325094784 0.86581974808662043
-1.8217822259851766 1.4010049252683978 1.4048073899588975  0.82172156155092024 0.40115992505181941 0.40477696304846172
-1.8657421844304007 1.4183870394745819 1.2746684461261839  0.86581974808662043 0.41835586417422188 0.27447137325094778
-1.2073123918032649 1.7807681678543315 1.589425686808948  0.20735457304096708 0.78085960551688738 0.58928970592655816
-1.3399483569044259 1.7433454959605346 1.5760838378857436  0.34013694034011333 0.74324570666303935 0.57610127698437341
-1.1319285691139529 1.9904306120773461 1.0405222816687167  0.13176921185868118 0.99044963097837846 0.0405758955654189
-1.0663810456382175 1.9944708773603257 0.91862905394330985  0.066331699036312725 0.99445714115859496 -0.081578796887614116
-0.72712117915505503 1.7402458861856145 1.6144698341819124  -0.27300775118977944 0.74028370995146831 0.61436698850995397
-0.79171259951203343 1.8247164420172246 1.5257938275259759  -0.20813967421463386 0.82482450355065062 0.525682807746505
-0.25975411381438585 1.6144698341819124 1.2728788208449453  -0.74028370995146864 0.61436698850995364 0.27300775118977916
-0.17528355798277562 1.5257938275259757 1.2082874004879671  -0.82482450355065007 0.52568280774650511 0.20813967421463572
-0.6240392221045663 1.3392409609172167 1.8623045076538935  -0.37608264246842488 0.33912378489964895 0.86229745711633843
-0.53132295016564979 1.4063294025426427 1.7843712383737111  -0.46877433341208979 0.40646863937642919 0.78424095119900827
-0.41057431319105175 0.79268760819673556 1.7807681678543315  -0.58928970592655816 -0.20735457304096597 0.7808596055168876
-0.4239161621142562 0.66005164309557451 1.7433454959605346  -0.57610127698437363 -0.34013694034011427 0.74324570666303869
-1.3759607778954341 1.3392409609172167 0.13769549234610667  0.37608264246842449 0.3391237848996484 -0.86229745711633887
-1.4686770498343509 1.4063294025426429 0.21562876162628941  0.46877433341209057 0.40646863937642802 -0.7842409511990085
-1.589425686808948 0.79268760819673556 0.21923183214566844  0.58928970592655916 -0.20735457304096744 -0.78085960551688649
-1.5760838378857438 0.66005164309557429 0.25665450403946544  0.57610127698437286 -0.34013694034011538 -0.74324570666303869
-0.95947771833128337 1.1319285691139529 0.009569387922654049  -0.040575895565417922 0.13176921185868251 -0.99044963097837835
-1.0813709460566903 1.0663810456382175 0.0055291226396743109  0.08157879688761259 0.066331699036313585 -0.99445714115859496
-0.61001812379817832 0.1056352994139447 0.78429103445404746  -0.37239734211020237 -0.89982453013548536 -0.22723563663235108
-0.90595336478045685 0.32286639405373119 0.271410708194047  -0.089584884642385398 -0.67452766723137236 -0.73279395097326894
-0.59899507473160241 1.4048073899588978 0.17821777401482342  -0.40115992505181897 0.40477696304846394 -0.82172156155091935
-0.58161296052541844 1.2746684461261841 0.13425781556959904  -0.41835586417422088 0.27447137325094884 -0.86581974808662066
-0.17821777401482353 1.401004925268398 0.59519261004110269  -0.8217215615509198 0.40115992505182052 -0.40477696304846172
-0.13425781556959915 1.4183870394745819 0.72533155387381609  -0.86581974808661999 0.41835586417422255 -0.27447137325094828
-0.79268760819673556 1.7807681678543315 0.41057431319105175  -0.20735457304096583 0.78085960551688727 -0.58928970592655872
-0.66005164309557451 1.7433454959605346 0.4239161621142562  -0.34013694034011521 0.74324570666303824 -0.57610127698437341
-0.86807143088604799 1.9904306120773461 0.95947771833128337  -0.13176921185868209 0.99044963097837835 -0.040575895565419483
-0.93361895436178288 1.9944708773603257 1.0813709460566903  -0.066331699036312475 0.99445714115859507 0.081578796887612298
-1.2728788208449453 1.7402458861856145 0.38553016581808797  0.27300775118978021 0.74028370995146786 -0.61436698850995419
-1.2082874004879671 1.8247164420172246 0.47420617247402486  0.20813967421463464 0.82482450355065107 -0.52568280774650411
-1.7402458861856145 1.6144698341819124 0.72712117915505503  0.74028370995146831 0.61436698850995408 -0.27300775118977905
-1.8247164420172244 1.5257938275259757 0.79171259951203343  0.82482450355065062 0.52568280774650489 -0.20813967421463392
-1.7402458861856145 0.38553016581808797 1.2728788208449453  0.74028370995146764 -0.61436698850995397 0.27300775118978082
-1.8247164420172246 0.47420617247402486 1.2082874004879671  0.82482450355065073 -0.52568280774650411 0.20813967421463583
-1.6144698341819124 0.72712117915505503 1.7402458861856145  0.61436698850995397 -0.27300775118977944 0.74028370995146831
-1.5257938275259757 0.79171259951203343 1.8247164420172244  0.52568280774650489 -0.20813967421463392 0.82482450355065062
-1.3392409609172169 0.13769549234610667 1.3759607778954344  0.33912378489964889 -0.86229745711633821 0.37608264246842549
-1.4063294025426429 0.21562876162628941 1.4686770498343509  0.4064686393764278 -0.78424095119900883 0.46877433341209013
-0.79268760819673556 0.21923183214566844 1.589425686808948  -0.20735457304096744 -0.78085960551688649 0.58928970592655916
-0.66005164309557429 0.25665450403946544 1.5760838378857438  -0.34013694034011538 -0.74324570666303869 0.57610127698437286
-1.1319285691139529 0.009569387922654049 0.95947771833128337  0.13176921185868237 -0.99044963097837835 -0.040575895565418178
-1.0663810456382175 0.0055291226396743109 1.0813709460566903  0.066331699036313585 -0.99445714115859496 0.08157879688761259
-0.90442701067601738 0.33903474443581871 0.25671454238163005  -0.089584884642383483 -0.67452766723137381 -0.73279395097326772
-0.43210633013751587 0.18610643753537565 0.88125255845135109  -0.58292813064721283 -0.80326578355000344 -0.12230648174951704
-1.4048073899588978 0.17821777401482342 0.59899507473160241  0.40477696304846228 -0.82172156155092002 -0.40115992505181963
-1.2746684461261841 0.13425781556959904 0.58161296052541844  0.27447137325094884 -0.86581974808662066 -0.41835586417422088
-1.401004925268398 0.59519261004110269 0.17821777401482342  0.40115992505182074 -0.40477696304846195 -0.82172156155091947
-1.4183870394745819 0.72533155387381609 0.13425781556959915  0.41835586417422255 -0.27447137325094828 -0.86581974808661999
-1.7807681678543315 0.41057431319105175 0.79268760819673556  0.78085960551688716 -0.5892897059265586 -0.20735457304096627
-1.7433454959605346 0.4239161621142562 0.66005164309557451  0.74324570666303835 -0.57610127698437386 -0.34013694034011444
-1.9904306120773461 0.95947771833128337 0.86807143088604799  0.99044963097837824 -0.040575895565418393 -0.13176921185868273
-1.9944708773603259 1.0813709460566905 0.93361895436178288  0.99445714115859507 0.08157879688761252 -0.066331699036312322
-1.9904306120773461 1.0405222816687167 1.1319285691139529  0.99044963097837835 0.040575895565417151 0.13176921185868218
-1.9944708773603259 0.91862905394331018 1.0663810456382175  0.99445714115859507 -0.081578796887612715 0.066331699036311934
-1.8623045076538935 1.3759607778954341 0.66075903908278355  0.8622974571163381 0.37608264246842577 -0.33912378489964878
-1.7843712383737109 1.4686770498343507 0.59367059745735751  0.78424095119900927 0.46877433341208991 -0.40646863937642724
-0.15594877494016779 0.48342144068564119 0.86055952199012919  -0.83662429167606378 -0.52971449507545854 -0.13950752053017287
-0.10851189307750805 0.59819314586024896 0.79307076339523386  -0.88183387534488278 -0.42350808342754087 -0.20738833035095483
-0.09404663521954322 0.6771336059462687 0.72858929180595311  -0.9113637377256294 -0.30990719304796421 -0.27087574504909456
-0.095052466200525557 0.7378162794185118 0.66704995977036108  -0.90406837259895945 -0.26739523938910503 -0.33340690397517614
-0.10617487126239186 0.78594000042913037 0.60770816150558549  -0.89197584375894823 -0.22324532177533518 -0.39311654818379149
-0.12458499692215494 0.8241658611683842 0.55121954142464069  -0.87543631012341916 -0.17844712110944894 -0.44918580997761093
-0.21923183214566866 0.41057431319105175 1.2073123918032649  -0.78085960551688627 -0.58928970592655927 0.20735457304096766
-0.25665450403946555 0.42391616211425609 1.3399483569044259  -0.74324570666303813 -0.5761012769843733 0.34013694034011566
-0.17821777401482342 0.59899507473160241 1.4048073899588978  -0.82172156155091991 -0.40115992505181963 0.40477696304846228
-0.13425781556959904 0.58161296052541844 1.2746684461261841  -0.86581974808662054 -0.41835586417422083 0.27447137325094884
-0.59519261004110269 0.17821777401482342 1.401004925268398  -0.40477696304846195 -0.82172156155091958 0.40115992505182074
-0.72533155387381609 0.13425781556959915 1.4183870394745819  -0.27447137325094828 -0.86581974808661999 0.41835586417422255
-0.21923183214566844 1.589425686808948 0.79268760819673556  -0.78085960551688649 0.58928970592655916 -0.20735457304096744
-0.25665450403946544 1.5760838378857438 0.66005164309557429  -0.74324570666303857 0.57610127698437308 -0.34013694034011499
-0.009569387922653938 1.0405222816687167 0.86807143088604799  -0.99044963097837846 0.040575895565418837 -0.13176921185868143
-0.0055291226396741999 0.91862905394331018 0.93361895436178288  -0.99445714115859507 -0.081578796887611951 -0.066331699036312766
-1.2681715176003199 1.6892965611519348 1.6730187872058684  0.26836446324215041 0.68937955050281385 0.67285685715261201
-1.1930054401955474 1.624572621678267 1.7567416602149373  0.19358827458119485 0.62484261256047702 0.75636980999592618
-1.0397345885584115 1.2602649483574222 1.9647192955096329  0.039677999129163623 0.25990051397960201 0.96481986879326065
-1.1598578035878231 1.1993769697289565 1.9667958970608925  0.16010344242024382 0.19913925651268607 0.96680424297825784
-0.86172631781262787 1.7695778385021761 1.6234022291431622  -0.13836216352689407 0.7697253903424921 0.6232003972770358
-0.93272292597567796 1.7022770253220765 1.7087176976875216  -0.067501320615789479 0.70276863564904057 0.7082088791190847
-1.2840795446225892 1.4603930887008656 1.8410333026720758  0.2844071777740565 0.46019616855581291 0.84103034646625319
-1.3714973697248309 1.527772526934267 1.7638362809535499  0.37176976328895928 0.52785497534634074 0.7636467561027056
-0.64637064705828351 1.4655650436231658 1.8112924693932408  -0.3538769830587436 0.46550486715932332 0.81121902067950946
-0.76541504139377881 1.515716029243271 1.8240187342392595  -0.23530638500725812 0.51562318151862252 0.82387113061171746
-1.1358362255269414 1.7199153070653641 1.6806397508870434  0.13609530337963516 0.72008099426245709 0.6804126910192051
-1.069740197633309 1.800472340674919 1.5952985273360614  0.069662907281837133 0.80067536950372653 0.59503447968929735
-0.91971872264975896 1.1973935260228461 1.9770315820848792  -0.080345839839678926 0.19714040391717355 0.97707738033577995
-0.92229559635619029 1.3227105890477233 1.943302656293743  -0.077926023088563279 0.32203490693742909 0.94351526412634257
-0.79987185965655649 1.6801807185069524 1.7051970771451348  -0.20029565457621065 0.68040299513329383 0.70493504308661681
-0.671604442794689 1.6406145370870961 1.694096083320241  -0.32871571883365269 0.64057192708348298 0.69398384882086983
-1.3040127948790106 1.3356672082102183 1.8915737467434819  0.30422052318316728 0.33550256744406826 0.89156486051918749
-1.1865609960788062 1.3899876630720454 1.901723137883069  0.18714545413041681 0.38953622755322004 0.9017971537002798
-0.74047778163550215 1.3961011738843632 1.8807678912304873  -0.25988482570664379 0.39599581735923722 0.88070834559541733
-0.72730018625934878 1.2691171673622654 1.9236940845413728  -0.27282039415738818 0.26880216379452343 0.92375019852295004
-0.69598720512098966 1.3356672082102183 0.10842625325651789  -0.30422052318316778 0.33550256744406898 -0.89156486051918715
-0.81343900392119461 1.3899876630720456 0.098276862116930652  -0.18714545413041631 0.38953622755321826 -0.90179715370028068
-1.2595222183644981 1.3961011738843632 0.11923210876951273  0.25988482570664384 0.39599581735923561 -0.880708345595418
-1.2726998137406516 1.2691171673622654 0.076305915458627416  0.27282039415738835 0.26880216379452399 -0.92375019852294971
-0.73182848239968035 1.6892965611519353 0.32698121279413161  -0.26836446324215124 0.68937955050281363 -0.67285685715261212
-0.80699455980445256 1.624572621678267 0.24325833978506284  -0.19358827458119462 0.62484261256047724 -0.75636980999592607
-0.96026541144158861 1.2602649483574222 0.035280704490367243  -0.039677999129163956 0.25990051397960023 -0.96481986879326109
-0.84014219641217736 1.1993769697289565 0.033204102939107361  -0.16010344242024258 0.19913925651268685 -0.96680424297825795
-1.1382736821873722 1.7695778385021763 0.37659777085683765  0.13836216352689579 0.76972539034249088 -0.62320039727703691
-1.0672770740243225 1.7022770253220765 0.29128230231247831  0.06750132061579224 0.70276863564903991 -0.70820887911908514
-0.71592045537741122 1.4603930887008656 0.15896669732792434  -0.28440717777405777 0.46019616855581397 -0.8410303464662523
-0.62850263027516917 1.5277725269342675 0.23616371904645006  -0.37176976328895817 0.52785497534633852 -0.76364675610270771
-1.3536293529417167 1.4655650436231658 0.18870753060675938  0.35387698305874377 0.46550486715932554 -0.81121902067950813
-1.2345849586062212 1.515716029243271 0.17598126576074047  0.23530638500725851 0.51562318151862285 -0.82387113061171713
-0.86416377447305925 1.7199153070653641 0.31936024911295635  -0.13609530337963502 0.72008099426245653 -0.68041269101920565
-0.93025980236669126 1.800472340674919 0.40470147266393852  -0.069662907281837452 0.80067536950372609 -0.59503447968929812
-1.0802812773502413 1.1973935260228461 0.022968417915120942  0.080345839839678773 0.19714040391717294 -0.97707738033578007
-1.0777044036438097 1.3227105890477233 0.056697343706257008  0.077926023088562973 0.32203490693742876 -0.94351526412634279
-1.2001281403434438 1.6801807185069524 0.29480292285486542  0.20029565457621254 0.68040299513329228 -0.7049350430866177
-1.3283955572053112 1.6406145370870961 0.30590391667975925  0.32871571883365136 0.64057192708348476 -0.69398384882086883
-1.1973935260228461 0.022968417915120942 1.0802812773502413  0.19714040391717294 -0.97707738033578007 0.080345839839678773
-1.3227105890477233 0.056697343706257008 1.0777044036438097  0.32203490693742876 -0.94351526412634279 0.077926023088562973
-1.6801807185069524 0.29480292285486542 1.2001281403434438  0.68040299513329183 -0.70493504308661803 0.20029565457621279
-1.6406145370870961 0.30590391667975925 1.3283955572053112  0.64057192708348487 -0.69398384882086883 0.32871571883365136
-1.3356672082102183 0.10842625325651789 0.69598720512098966  0.33550256744406898 -0.89156486051918715 -0.30422052318316783
-1.3899876630720456 0.098276862116930652 0.81343900392119461  0.38953622755321932 -0.90179715370028013 -0.18714545413041672
-1.3961011738843634 0.11923210876951296 1.2595222183644981  0.39599581735923683 -0.88070834559541722 0.25988482570664478
-1.2691171673622654 0.076305915458627416 1.2726998137406516  0.26880216379452404 -0.92375019852294993 0.27282039415738796
-1.6892965611519353 0.32698121279413161 0.73182848239968035  0.68937955050281352 -0.67285685715261212 -0.2683644632421518
-1.624572621678267 0.24325833978506284 0.80699455980445256  0.62484261256047746 -0.75636980999592596 -0.19358827458119449
-1.2602649483574222 0.035280704490367243 0.96026541144158861  0.25990051397960084 -0.96481986879326098 -0.039677999129164913
-1.1993769697289565 0.033204102939107361 0.84014219641217736  0.19913925651268685 -0.96680424297825795 -0.16010344242024258
-1.7695778385021763 0.37659777085683765 1.1382736821873722  0.76972539034249088 -0.62320039727703691 0.13836216352689579
-1.7022770253220765 0.29128230231247831 1.0672770740243225  0.70276863564903991 -0.70820887911908514 0.067501320615792754
-1.4603930887008658 0.15896669732792446 0.715920455377411  0.4601961685558133 -0.84103034646625308 -0.28440717777405633
-1.5277725269342675 0.23616371904645006 0.62850263027516917  0.52785497534633796 -0.76364675610270782 -0.37176976328895855
-1.465565043623166 0.18870753060675938 1.3536293529417167  0.46550486715932482 -0.81121902067950868 0.35387698305874349
-1.5157160292432712 0.17598126576074069 1.2345849586062212  0.51562318151862307 -0.82387113061171713 0.23530638500725842
-1.7199153070653641 0.31936024911295635 0.86416377447305925  0.72008099426245731 -0.68041269101920498 -0.13609530337963452
-1.800472340674919 0.40470147266393852 0.93025980236669126  0.80067536950372609 -0.59503447968929812 -0.069662907281837452
-1.6730187872058684 1.2681715176003199 1.689296561151935  0.67285685715261145 0.26836446324215008 0.68937955050281474
-1.7567416602149373 1.1930054401955474 1.624572621678267  0.75636980999592585 0.19358827458119357 0.62484261256047779
-1.9647192955096329 1.0397345885584115 1.2602649483574222  0.96481986879326043 0.039677999129164962 0.25990051397960284
-1.9667958970608925 1.1598578035878231 1.1993769697289565  0.96680424297825784 0.16010344242024382 0.19913925651268607
-0.91971872264975896 0.80260647397715423 0.022968417915120942  -0.080345839839677718 -0.19714040391717277 -0.97707738033578018
-0.92229559635619041 0.67728941095227668 0.056697343706257008  -0.077926023088561627 -0.32203490693742876 -0.94351526412634279
-0.17773204761375266 0.87689701064830428 0.44478929974988746  -0.84318764111161215 -0.16797909143372139 -0.51070307098913825
-0.88304523202927676 0.18950565604187922 0.42721864490060907  -0.10453117536509746 -0.80855713981694288 -0.57905836064064908
-0.108426253256518 1.3040127948790108 0.66433279178978188  -0.89156486051918693 0.30422052318316734 -0.33550256744406998
-0.098276862116931096 1.1865609960788062 0.61001233692795442  -0.90179715370027969 0.18714545413041742 -0.38953622755321982
-0.21254447256850684 0.89390471712616404 0.39369586600014284  -0.79156802282425309 -0.094036448520742069 -0.60380229511961003
-0.076305915458627194 0.72730018625934878 0.73088283263773501  -0.92375019852295015 -0.27282039415738796 -0.2688021637945231
-0.37659777085683765 1.1382736821873722 1.7695778385021763  -0.62320039727703691 0.13836216352689526 0.76972539034249088
-0.29128230231247831 1.0672770740243225 1.7022770253220765  -0.70820887911908481 0.067501320615792504 0.70276863564904024
-0.15896669732792446 0.715920455377411 1.4603930887008658  -0.84103034646625308 -0.28440717777405627 0.4601961685558133
-0.23616371904645006 0.62850263027516917 1.5277725269342675  -0.76364675610270738 -0.37176976328895911 0.5278549753463383
-0.53443495637683469 1.8112924693932411 1.3536293529417167  -0.4655048671593231 0.81121902067950979 0.35387698305874316
-0.48428397075672935 1.8240187342392595 1.2345849586062212  -0.51562318151862385 0.82387113061171635 0.2353063850072592
-0.280084692934636 1.6806397508870434 0.86416377447305925  -0.72008099426245697 0.68041269101920498 -0.13609530337963563
-0.1995276593250811 1.5952985273360616 0.93025980236669126  -0.80067536950372598 0.59503447968929823 -0.069662907281837577
-0.69598720512098988 0.66433279178978188 1.8915737467434823  -0.30422052318316639 -0.3355025674440687 0.89156486051918771
-0.81343900392119473 0.61001233692795442 1.9017231378830692  -0.18714545413041667 -0.38953622755321821 0.90179715370028057
-1.2595222183644981 0.60389882611563706 1.8807678912304873  0.25988482570664329 -0.39599581735923711 0.88070834559541755
-1.2726998137406516 0.73088283263773501 1.9236940845413728  0.27282039415738824 -0.26880216379452393 0.92375019852294982
-1.8112924693932408 0.64637064705828351 1.4655650436231658  0.81121902067950946 -0.3538769830587436 0.46550486715932332
-1.8240187342392593 0.76541504139377881 1.5157160292432708  0.82387113061171735 -0.2353063850072582 0.51562318151862263
-1.6806397508870434 1.1358362255269414 1.7199153070653641  0.68041269101920587 0.13609530337963541 0.72008099426245631
-1.5952985273360614 1.069740197633309 1.800472340674919  0.59503447968929812 0.069662907281837633 0.80067536950372609
-1.6234022291431622 0.86172631781262787 1.7695778385021761  0.6232003972770358 -0.13836216352689407 0.7697253903424921
-1.7087176976875216 0.93272292597567796 1.7022770253220765  0.7082088791190847 -0.067501320615789479 0.70276863564904057
-1.8410333026720758 1.2840795446225892 1.4603930887008656  0.84103034646625274 0.28440717777405616 0.46019616855581397
-1.7638362809535497 1.3714973697248309 1.5277725269342677  0.7636467561027056 0.37176976328895911 0.52785497534634074
-1.7695778385021761 1.6234022291431622 0.86172631781262787  0.7697253903424921 0.6232003972770358 -0.13836216352689407
-1.7022770253220765 1.7087176976875216 0.93272292597567796  0.70276863564904057 0.7082088791190847 -0.067501320615789479
-1.4603930887008656 1.8410333026720758 1.2840795446225892  0.46019616855581291 0.8410303464662533 0.2844071777740565
-1.527772526934267 1.7638362809535499 1.3714973697248309  0.52785497534634085 0.76364675610270538 0.37176976328895955
-1.6892965611519348 1.6730187872058684 1.2681715176003199  0.68937955050281474 0.67285685715261145 0.26836446324214996
-1.624572621678267 1.7567416602149373 1.1930054401955474  0.62484261256047757 0.75636980999592585 0.19358827458119429
-1.2602649483574224 1.9647192955096329 1.0397345885584115  0.25990051397960312 0.96481986879326032 0.039677999129165198
-1.1993769697289565 1.9667958970608925 1.1598578035878231  0.19913925651268596 0.96680424297825795 0.16010344242024366
-0.66433279178978188 1.8915737467434823 0.69598720512098966  -0.33550256744406876 0.89156486051918749 -0.30422052318316672
-0.61001233692795442 1.9017231378830692 0.8134390039211945  -0.38953622755321837 0.90179715370028057 -0.18714545413041681
-0.60389882611563706 1.8807678912304873 1.2595222183644981  -0.39599581735923706 0.88070834559541744 0.25988482570664329
-0.73088283263773501 1.9236940845413728 1.2726998137406516  -0.26880216379452393 0.92375019852294982 0.27282039415738824
-0.80260647397715423 1.9770315820848792 1.0802812773502413  -0.19714040391717205 0.9770773803357804 0.080345839839677455
-0.67728941095227668 1.9433026562937428 1.0777044036438097  -0.32203490693742876 0.9435152641263429 0.077926023088562071
-0.3198192814930475 1.7051970771451346 1.2001281403434438  -0.68040299513329328 0.70493504308661703 0.2002956545762111
-0.35938546291290407 1.694096083320241 1.3283955572053112  -0.64057192708348432 0.69398384882086939 0.32871571883365119
-0.022968417915120942 1.0802812773502413 1.1973935260228461  -0.97707738033578007 0.080345839839678773 0.19714040391717294
-0.056697343706257008 1.0777044036438097 1.3227105890477233  -0.94351526412634279 0.077926023088562973 0.32203490693742876
-0.29480292285486542 1.2001281403434438 1.6801807185069524  -0.70493504308661814 0.20029565457621162 0.68040299513329205
-0.30590391667975925 1.3283955572053112 1.6406145370870961  -0.69398384882086872 0.3287157188336513 0.64057192708348476
-0.18870753060675938 1.3536293529417167 1.465565043623166  -0.81121902067950868 0.35387698305874349 0.46550486715932482
-0.17598126576074069 1.2345849586062212 1.5157160292432712  -0.82387113061171702 0.23530638500725842 0.51562318151862307
-0.31936024911295646 0.86416377447305925 1.7199153070653639  -0.68041269101920498 -0.1360953033796338 0.72008099426245742
-0.40470147266393852 0.93025980236669126 1.800472340674919  -0.59503447968929812 -0.069662907281837008 0.80067536950372609
-0.73182848239968035 0.31070343884806495 1.6730187872058686  -0.26836446324215152 -0.6893795505028123 0.67285685715261345
-0.80699455980445256 0.37542737832173323 1.7567416602149373  -0.19358827458119554 -0.62484261256047757 0.75636980999592562
-0.96026541144158861 0.73973505164257791 1.9647192955096329  -0.039677999129162395 -0.25990051397960112 0.96481986879326098
-0.84014219641217736 0.80062303027104387 1.9667958970608925  -0.16010344242024249 -0.19913925651268491 0.96680424297825829
-1.8112924693932411 1.3536293529417167 0.53443495637683469  0.81121902067951035 0.35387698305874343 -0.46550486715932188
-1.8240187342392595 1.2345849586062212 0.48428397075672935  0.82387113061171702 0.2353063850072582 -0.51562318151862319
-1.6806397508870434 0.86416377447305925 0.280084692934636  0.68041269101920498 -0.13609530337963563 -0.72008099426245709
-1.5952985273360616 0.93025980236669126 0.1995276593250811  0.59503447968929823 -0.069662907281836925 -0.80067536950372609
-1.2681715176003199 0.31070343884806495 0.32698121279413161  0.26836446324215141 -0.68937955050281308 -0.67285685715261256
-1.1930054401955474 0.37542737832173323 0.24325833978506284  0.19358827458119487 -0.62484261256047735 -0.75636980999592596
-1.0397345885584115 0.73973505164257791 0.035280704490367243  0.03967799912916415 -0.25990051397959979 -0.9648198687932612
-1.1598578035878231 0.80062303027104398 0.033204102939107361  0.16010344242024271 -0.19913925651268632 -0.96680424297825795
-1.3040127948790108 0.66433279178978188 0.108426253256518  0.30422052318316734 -0.33550256744406998 -0.89156486051918693
-1.1865609960788062 0.61001233692795442 0.098276862116930985  0.18714545413041747 -0.38953622755321993 -0.9017971537002798
-0.90105806124803878 0.23967742655656488 0.35918321758479488  -0.10365825365834329 -0.76207589783375607 -0.6391363644711332
-0.72730018625934878 0.73088283263773501 0.076305915458627194  -0.27282039415738768 -0.26880216379452448 -0.92375019852294993
-0.90688305806336122 0.29107512591583123 0.30186484921791512  -0.10153183902939053 -0.71176658290178618 -0.69503929178689206
-0.30186484921791523 0.90688305806336122 0.29107512591583129  -0.69503929178689017 -0.10153183902939387 -0.71176658290178751
-0.31936024911295646 1.1358362255269414 0.28008469293463611  -0.68041269101920498 0.13609530337963624 -0.72008099426245697
-0.4047014726639383 1.069740197633309 0.1995276593250811  -0.59503447968929801 0.069662907281837952 -0.80067536950372598
-0.90387507728811034 0.34253810440658677 0.25355721782048279  -0.09843496124260244 -0.65866036402230843 -0.74597391594556939
-0.29128230231247842 0.93272292597567807 0.29772297467792341  -0.70820887911908814 -0.067501320615794697 -0.7027686356490368
-0.15896669732792446 1.2840795446225892 0.53960691129913418  -0.84103034646625341 0.28440717777405561 -0.46019616855581308
-0.23616371904645017 1.3714973697248309 0.47222747306573265  -0.76364675610270683 0.37176976328895972 -0.52785497534633874
-0.23042216149782391 1.6234022291431627 1.1382736821873722  -0.76972539034249132 0.62320039727703636 0.13836216352689557
-0.29772297467792341 1.7087176976875216 1.0672770740243225  -0.7027686356490398 0.70820887911908548 0.0675013206157907
-0.53960691129913418 1.8410333026720758 0.71592045537741122  -0.46019616855581297 0.84103034646625374 -0.28440717777405489
-0.47222747306573287 1.7638362809535502 0.62850263027516928  -0.52785497534633652 0.76364675610270849 -0.37176976328895933
-0.31070343884806495 1.6730187872058686 0.73182848239968035  -0.68937955050281285 0.6728568571526129 -0.2683644632421513
-0.37542737832173312 1.7567416602149373 0.80699455980445245  -0.62484261256047768 0.75636980999592562 -0.19358827458119485
-0.73973505164257791 1.9647192955096329 0.96026541144158861  -0.25990051397960101 0.96481986879326098 -0.039677999129162367
-0.80062303027104398 1.9667958970608925 0.84014219641217713  -0.19913925651268505 0.96680424297825807 -0.16010344242024419
-1.3356672082102183 1.8915737467434819 1.3040127948790106  0.33550256744406826 0.89156486051918749 0.30422052318316728
-1.3899876630720454 1.901723137883069 1.1865609960788062  0.38953622755322004 0.9017971537002798 0.18714545413041681
-1.3961011738843634 1.8807678912304873 0.74047778163550193  0.39599581735923711 0.88070834559541677 -0.25988482570664545
-1.2691171673622654 1.9236940845413726 0.72730018625934867  0.26880216379452254 0.92375019852295026 -0.27282039415738835
-1.1973935260228461 1.9770315820848792 0.91971872264975862  0.19714040391717286 0.97707738033577995 -0.0803458398396803
-1.3227105890477233 1.943302656293743 0.92229559635619029  0.32203490693742853 0.94351526412634268 -0.077926023088563834
-1.6801807185069524 1.7051970771451348 0.79987185965655649  0.68040299513329394 0.7049350430866167 -0.20029565457621054
-1.6406145370870961 1.694096083320241 0.671604442794689  0.64057192708348298 0.69398384882086983 -0.32871571883365269
-1.9770315820848792 1.0802812773502413 0.80260647397715423  0.97707738033578029 0.080345839839677663 -0.19714040391717216
-1.9433026562937428 1.0777044036438097 0.67728941095227668  0.9435152641263429 0.077926023088562071 -0.32203490693742876
-1.7051970771451346 1.2001281403434438 0.3198192814930475  0.70493504308661725 0.20029565457621135 -0.68040299513329305
-1.694096083320241 1.3283955572053112 0.35938546291290407  0.69398384882086939 0.32871571883365119 -0.6405719270834842
-1.9770315820848792 0.91971872264975896 1.1973935260228461  0.97707738033577995 -0.080345839839678926 0.19714040391717347
-1.943302656293743 0.92229559635619029 1.3227105890477233  0.94351526412634257 -0.077926023088563293 0.32203490693742914
-1.7051970771451346 0.79987185965655649 1.6801807185069522  0.7049350430866167 -0.20029565457621065 0.68040299513329383
-1.694096083320241 0.671604442794689 1.6406145370870961  0.69398384882086983 -0.32871571883365269 0.64057192708348298
-1.0802812773502413 0.80260647397715423 1.9770315820848792  0.080345839839677677 -0.1971404039171723 0.97707738033578029
-1.0777044036438097 0.67728941095227657 1.943302656293743  0.077926023088562002 -0.32203490693742876 0.94351526412634279
-1.2001281403434438 0.3198192814930475 1.7051970771451346  0.20029565457621135 -0.68040299513329305 0.70493504308661725
-1.3283955572053112 0.35938546291290407 1.694096083320241  0.32871571883365075 -0.64057192708348443 0.69398384882086939
-1.3536293529417167 0.53443495637683469 1.8112924693932411  0.35387698305874343 -0.46550486715932188 0.81121902067951035
-1.2345849586062212 0.48428397075672935 1.8240187342392595  0.23530638500725834 -0.51562318151862285 0.82387113061171724
-0.86416377447305925 0.280084692934636 1.6806397508870434  -0.13609530337963588 -0.72008099426245675 0.68041269101920532
-0.93025980236669126 0.1995276593250811 1.5952985273360616  -0.069662907281837577 -0.80067536950372598 0.59503447968929823
-0.31070343884806495 0.32698121279413161 1.2681715176003199  -0.68937955050281319 -0.67285685715261268 0.26836446324215141
-0.37542737832173312 0.24325833978506273 1.1930054401955474  -0.62484261256047735 -0.75636980999592596 0.19358827458119482
-0.73973505164257791 0.035280704490367243 1.0397345885584115  -0.25990051397960007 -0.96481986879326109 0.039677999129164684
-0.80062303027104398 0.033204102939107361 1.1598578035878231  -0.19913925651268602 -0.96680424297825807 0.1601034424202428
-0.66433279178978188 0.108426253256518 1.3040127948790108  -0.33550256744406964 -0.89156486051918704 0.30422052318316734
-0.61001233692795442 0.098276862116931096 1.1865609960788062  -0.38953622755321898 -0.90179715370028013 0.1871454541304173
-0.89844705357522048 0.37311241287933194 0.22843691950085848  -0.096596587118419092 -0.63168040245027901 -0.76918721291849834
-0.73088283263773501 0.076305915458627194 0.72730018625934878  -0.26880216379452265 -0.92375019852295026 -0.27282039415738796
-0.35918321758479488 0.90105806124803856 0.23967742655656488  -0.6391363644711513 -0.10365825365835668 -0.76207589783373908
-0.87149140923129176 0.45766135056489032 0.17031256632806041  -0.14218930946431163 -0.5308742118974128 -0.83543687458500604
-1.1358362255269414 0.28008469293463611 0.31936024911295646  0.1360953033796366 -0.72008099426245686 -0.68041269101920498
-1.069740197633309 0.1995276593250811 0.4047014726639383  0.069662907281837952 -0.80067536950372598 -0.59503447968929801
-0.11307342108777627 0.80253395542112949 0.58417903277383187  -0.88421545010983993 -0.2012562397068535 -0.42149610172113178
-0.93272292597567807 0.29772297467792341 0.29128230231247842  -0.067501320615791366 -0.70276863564903769 -0.70820887911908736
-1.2840795446225892 0.53960691129913418 0.15896669732792446  0.28440717777405555 -0.46019616855581341 -0.84103034646625319
-1.3714973697248309 0.47222747306573287 0.23616371904645017  0.37176976328895889 -0.52785497534633918 -0.76364675610270694
-1.6234022291431627 1.1382736821873722 0.23042216149782391  0.6232003972770358 0.13836216352689565 -0.76972539034249166
-1.7087176976875216 1.0672770740243225 0.29772297467792341  0.70820887911908548 0.067501320615790686 -0.70276863564903969
-1.8410333026720758 0.71592045537741122 0.53960691129913418  0.84103034646625285 -0.284407177774056 -0.46019616855581397
-1.7638362809535502 0.62850263027516928 0.47222747306573287  0.76364675610270727 -0.37176976328896061 -0.52785497534633741
-1.6730187872058686 0.73182848239968035 0.31070343884806495  0.6728568571526129 -0.2683644632421513 -0.68937955050281285
-1.7567416602149373 0.80699455980445256 0.37542737832173323  0.75636980999592573 -0.19358827458119479 -0.62484261256047757
-1.9647192955096329 0.96026541144158861 0.73973505164257791  0.96481986879326098 -0.039677999129162721 -0.25990051397960112
-1.9667958970608925 0.84014219641217736 0.80062303027104398  0.96680424297825829 -0.16010344242024274 -0.19913925651268469
-1.8915737467434819 1.3040127948790106 1.3356672082102183  0.89156486051918749 0.30422052318316728 0.33550256744406826
-1.901723137883069 1.1865609960788062 1.3899876630720454  0.9017971537002798 0.18714545413041681 0.38953622755322004
-1.8807678912304873 0.74047778163550215 1.3961011738843632  0.88070834559541733 -0.25988482570664379 0.39599581735923722
-1.9236940845413726 0.72730018625934889 1.2691171673622654  0.92375019852295004 -0.27282039415738818 0.26880216379452349
-1.8915737467434823 0.69598720512098988 0.66433279178978188  0.89156486051918771 -0.30422052318316639 -0.3355025674440687
-1.9017231378830692 0.81343900392119473 0.61001233692795442  0.90179715370028057 -0.18714545413041667 -0.38953622755321815
-1.8807678912304873 1.2595222183644981 0.60389882611563706  0.88070834559541689 0.25988482570664451 -0.39599581735923783
-1.9236940845413728 1.2726998137406516 0.73088283263773501  0.92375019852294982 0.27282039415738824 -0.26880216379452393
-1.465565043623166 1.8112924693932408 0.64637064705828351  0.46550486715932449 0.81121902067950902 -0.35387698305874316
-1.5157160292432708 1.8240187342392593 0.76541504139377881  0.51562318151862263 0.82387113061171735 -0.2353063850072582
-1.7199153070653641 1.6806397508870434 1.1358362255269414  0.72008099426245709 0.6804126910192051 0.13609530337963516
-1.800472340674919 1.5952985273360614 1.069740197633309  0.80067536950372664 0.59503447968929746 0.069662907281837147
-0.80260647397715423 0.022968417915120942 0.91971872264975896  -0.19714040391717269 -0.97707738033578018 -0.080345839839677829
-0.67728941095227668 0.056697343706257008 0.92229559635619041  -0.32203490693742781 -0.94351526412634312 -0.077926023088561974
-0.80253395542112949 0.58417903277383187 0.11307342108777621  -0.20125623970685386 -0.42149610172113305 -0.88421545010983926
-0.78594000042913037 0.60770816150558526 0.10617487126239183  -0.22324532177533477 -0.39311654818378927 -0.89197584375894945
-0.022968417915120942 0.91971872264975896 0.80260647397715423  -0.97707738033578018 -0.080345839839677829 -0.19714040391717269
-0.056697343706257008 0.92229559635619041 0.67728941095227668  -0.9435152641263429 -0.077926023088562626 -0.3220349069374282
-0.62479622481419628 0.77318510024650322 0.10194841255523895  -0.36748531964497921 -0.23977066491306492 -0.89859032272363926
-0.75815048575026589 0.64339140453754129 0.098424941615366732  -0.24555619785557528 -0.36356562872995929 -0.89862238304023057
-0.73781627941851213 0.66704995977036097 0.095052466200525487  -0.2673952393891062 -0.33340690397516742 -0.90406837259896233
-0.71089969747156689 0.69602657944578872 0.093129265416474039  -0.28893990864387004 -0.30244718988225927 -0.90831680955776473
-0.28008469293463611 0.31936024911295646 1.1358362255269414  -0.72008099426245686 -0.68041269101920498 0.1360953033796366
-0.1995276593250811 0.4047014726639383 1.069740197633309  -0.80067536950372598 -0.59503447968929801 0.069662907281837952
-0.32698121279413161 0.73182848239968035 1.6892965611519353  -0.67285685715261234 -0.26836446324214963 0.68937955050281408
-0.24325833978506284 0.80699455980445256 1.624572621678267  -0.75636980999592518 -0.19358827458119407 0.62484261256047846
-0.035280704490367243 0.96026541144158861 1.2602649483574222  -0.96481986879326098 -0.039677999129164913 0.25990051397960084
-0.033204102939107361 0.84014219641217736 1.1993769697289565  -0.96680424297825795 -0.16010344242024258 0.19913925651268685
-0.6771336059462687 0.72858929180595311 0.094046635219543206  -0.30990719304796399 -0.27087574504909673 -0.91136373772562884
-0.29772297467792341 0.29128230231247842 0.93272292597567807  -0.70276863564903491 -0.70820887911908992 -0.067501320615794169
-0.53960691129913396 0.15896669732792457 1.2840795446225894  -0.46019616855581319 -0.8410303464662533 0.284407177774056
-0.47222747306573287 0.23616371904645017 1.3714973697248309  -0.52785497534633985 -0.76364675610270594 0.37176976328896005
-1.1382736821873722 0.23042216149782391 1.6234022291431627  0.13836216352689693 -0.76972539034249154 0.6232003972770358
-1.0672770740243225 0.29772297467792341 1.7087176976875216  0.067501320615790686 -0.70276863564903969 0.70820887911908548
-0.71592045537741122 0.53960691129913418 1.8410333026720758  -0.28440717777405627 -0.46019616855581413 0.84103034646625263
-0.62850263027516928 0.47222747306573287 1.7638362809535502  -0.37176976328896061 -0.52785497534633741 0.76364675610270727
-0.32698121279413161 1.2681715176003199 0.31070343884806495  -0.67285685715261256 0.26836446324215141 -0.68937955050281308
-0.24325833978506284 1.1930054401955474 0.37542737832173323  -0.75636980999592596 0.19358827458119485 -0.62484261256047724
-0.035280704490367243 1.0397345885584115 0.73973505164257791  -0.96481986879326109 0.039677999129164684 -0.25990051397960007
-0.033204102939107361 1.1598578035878231 0.80062303027104398  -0.96680424297825807 0.1601034424202428 -0.19913925651268602
-0.10842625325651789 0.69598720512098966 1.3356672082102183  -0.89156486051918715 -0.30422052318316783 0.33550256744406898
-0.098276862116930652 0.81343900392119461 1.3899876630720456  -0.90179715370028013 -0.18714545413041603 0.3895362275532197
-0.11923210876951296 1.2595222183644981 1.3961011738843634  -0.88070834559541789 0.25988482570664367 0.39599581735923611
-0.076305915458627416 1.2726998137406516 1.2691171673622654  -0.92375019852294993 0.27282039415738796 0.26880216379452404
-1.6267476188075718 1.5155632797953902 1.5842789803216091  0.62675731827798098 0.51582822603431755 0.58403467808965137
-1.5521688397941482 1.4662660666179783 1.6911624465210644  0.5522259583307304 0.46647300291392729 0.69097715483087396
-1.3536293529417165 1.4655650436231658 1.8112924693932408  0.35387698305874277 0.46550486715932354 0.81121902067950968
-1.4686770498343504 1.4063294025426432 1.7843712383737107  0.46877433341209002 0.40646863937642691 0.78424095119900938
-1.0687157005262189 1.9453832490724943 1.3186356302649234  0.068382200701545187 0.94544807568691724 0.31851500876272532
-1.1389936067269157 1.8934279503155276 1.427161883697549  0.13875119650014295 0.89352037004910512 0.42704736713517949
-1.1382736821873727 1.7695778385021763 1.6234022291431622  0.13836216352689629 0.76972539034249166 0.6232003972770358
-1.2082874004879671 1.8247164420172246 1.5257938275259753  0.20813967421463503 0.82482450355065051 0.52568280774650467
-0.41572101967839148 1.6267476188075716 1.5155632797953906  -0.58449479401890791 0.62647295099493494 0.51565247738810704
-0.53373393338202191 1.6911624465210644 1.5521688397941484  -0.46647300291392713 0.69097715483087374 0.55222595833073085
-0.73182848239968057 1.6892965611519348 1.6730187872058688  -0.26836446324215263 0.68937955050281163 0.67285685715261367
-0.66005164309557451 1.7433454959605346 1.576083837885744  -0.34013694034011638 0.74324570666303758 0.57610127698437386
-0.57018003072289591 1.0000000000000002 1.9029146105865324  -0.42961984965259903 -0.00028436728304797682 0.90300980278163467
-0.57283811630245085 1.1389936067269162 1.8934279503155276  -0.42704736713517938 0.13875119650014325 0.89352037004910523
-0.69598720512098988 1.3356672082102183 1.8915737467434823  -0.30422052318316695 0.33550256744406853 0.89156486051918749
-0.58161296052541855 1.2746684461261846 1.8657421844304007  -0.41835586417422121 0.27447137325094922 0.86581974808662021
-1.3186356302649234 0.93128429947378155 1.9453832490724945  0.31851500876272471 -0.068382200701544701 0.94544807568691747
-1.2022655037944634 1 1.9793307234916977  0.20254321521823299 9.3774004638345608e-17 0.97927332546590917
-1.0802812773502413 1.1973935260228461 1.9770315820848792  0.080345839839679772 0.19714040391717261 0.97707738033578007
-1.0813709460566905 1.0663810456382177 1.9944708773603259  0.081578796887613741 0.066331699036313058 0.99445714115859496
-0.68136436973507708 0.93128429947378122 0.054616750927505398  -0.31851500876272504 -0.06838220070154602 -0.94544807568691724
-0.79773449620553682 1 0.020669276508302414  -0.20254321521823149 -7.2935336940935469e-17 -0.97927332546590951
-0.91971872264975907 1.1973935260228461 0.022968417915120942  -0.080345839839677774 0.19714040391717347 -0.97707738033578007
-0.91862905394330996 1.0663810456382175 0.0055291226396743109  -0.081578796887611521 0.066331699036312863 -0.99445714115859518
-0.37325238119242876 1.5155632797953904 0.41572101967839081  -0.62675731827798042 0.51582822603431766 -0.58403467808965193
-0.44783116020585179 1.4662660666179785 0.30883755347893571  -0.55222595833073085 0.46647300291392785 -0.6909771548308733
-0.64637064705828351 1.4655650436231658 0.18870753060675938  -0.35387698305874221 0.46550486715932415 -0.81121902067950957
-0.53132295016564979 1.4063294025426434 0.2156287616262893  -0.46877433341208985 0.40646863937642658 -0.78424095119900961
-0.93128429947378166 1.9453832490724945 0.68136436973507686  -0.068382200701545257 0.94544807568691724 -0.31851500876272504
-0.86100639327308448 1.8934279503155278 0.57283811630245107  -0.13875119650014139 0.89352037004910545 -0.42704736713517955
-0.86172631781262787 1.7695778385021763 0.37659777085683765  -0.13836216352689501 0.76972539034249188 -0.62320039727703569
-0.79171259951203332 1.8247164420172246 0.47420617247402475  -0.20813967421463572 0.82482450355065062 -0.52568280774650411
-1.5842789803216091 1.6267476188075718 0.48443672020460993  0.58403467808965315 0.62675731827798065 -0.51582822603431588
-1.4662660666179783 1.6911624465210644 0.44783116020585179  0.46647300291392657 0.69097715483087452 -0.55222595833073029
-1.2681715176003199 1.689296561151935 0.32698121279413161  0.26836446324215224 0.68937955050281319 -0.67285685715261212
-1.3399483569044259 1.7433454959605346 0.4239161621142562  0.34013694034011477 0.74324570666303791 -0.57610127698437419
-1.4298199692771043 1.0000000000000002 0.097085389413467671  0.42961984965260058 0.00028436728304489438 -0.9030098027816339
-1.427161883697549 1.1389936067269162 0.10657204968447243  0.42704736713517832 0.13875119650014309 -0.89352037004910567
-1.3040127948790103 1.3356672082102183 0.108426253256518  0.30422052318316772 0.33550256744406864 -0.89156486051918726
-1.4183870394745819 1.2746684461261846 0.13425781556959937  0.41835586417422216 0.27447137325094995 -0.86581974808661966
-1.0000000000000002 0.097085389413467671 1.4298199692771043  0.00028436728304636 -0.9030098027816339 0.42961984965260058
-1.1389936067269162 0.10657204968447254 1.4271618836975493  0.13875119650014303 -0.89352037004910567 0.42704736713517832
-1.3356672082102183 0.108426253256518 1.3040127948790106  0.33550256744406942 -0.89156486051918726 0.30422052318316667
-1.2746684461261846 0.13425781556959937 1.4183870394745819  0.27447137325094867 -0.8658197480866201 0.41835586417422194
-0.93128429947378155 0.054616750927505398 0.68136436973507708  -0.068666567984591781 -0.94527232704070629 -0.31897512469198175
-1 0.020669276508302414 0.79773449620553682  -7.2935336940935469e-17 -0.97927332546590951 -0.20254321521823149
-1.1973935260228461 0.022968417915120942 0.91971872264975907  0.19714040391717347 -0.97707738033578007 -0.080345839839677774
-1.0663810456382175 0.0055291226396741999 0.91862905394330996  0.066331699036312863 -0.99445714115859518 -0.081578796887611507
-1.5155632797953904 0.41572101967839092 0.37325238119242865  0.51582822603431722 -0.5840346780896517 -0.62675731827798109
-1.4662660666179785 0.30883755347893571 0.44783116020585167  0.46647300291392818 -0.6909771548308733 -0.55222595833073063
-1.465565043623166 0.18870753060675916 0.64637064705828351  0.46550486715932421 -0.81121902067950946 -0.35387698305874238
-1.4063294025426436 0.21562876162628952 0.53132295016564968  0.40646863937642819 -0.7842409511990085 -0.46877433341209029
-1.9453832490724945 0.68136436973507708 0.93128429947378155  0.9454480756869168 -0.31851500876272626 -0.068382200701546297
-1.8934279503155278 0.57283811630245107 0.86100639327308448  0.89352037004910545 -0.42704736713517949 -0.13875119650014142
-1.7695778385021763 0.37659777085683765 0.86172631781262787  0.76972539034249188 -0.62320039727703569 -0.13836216352689501
-1.8247164420172246 0.47420617247402475 0.79171259951203332  0.82482450355065073 -0.52568280774650422 -0.20813967421463575
-1.6267476188075718 0.48443672020460993 1.5842789803216091  0.62647295099493516 -0.51565247738810538 0.58449479401890936
-1.6911624465210644 0.44783116020585179 1.4662660666179783  0.69097715483087396 -0.55222595833073063 0.46647300291392685
-1.689296561151935 0.32698121279413161 1.2681715176003199  0.68937955050281319 -0.67285685715261212 0.26836446324215224
-1.7433454959605346 0.4239161621142562 1.3399483569044259  0.74324570666303713 -0.57610127698437386 0.34013694034011699
-1.5842789803216091 1.6267476188075709 1.5155632797953906  0.5844947940189088 0.62647295099493494 0.51565247738810616
-1.6911624465210642 1.552168839794148 1.4662660666179788  0.69097715483087396 0.55222595833072996 0.46647300291392763
-1.8112924693932408 1.3536293529417165 1.4655650436231658  0.81121902067950946 0.35387698305874271 0.46550486715932404
-1.7843712383737107 1.4686770498343504 1.4063294025426432  0.78424095119900938 0.46877433341209002 0.40646863937642691
-0.57018003072289591 1 0.097085389413467671  -0.42961984965260003 0.00028436728304627148 -0.90300980278163412
-0.57283811630245096 0.86100639327308426 0.10657204968447231  -0.80988964354812454 0.15741543596758825 -0.56506561193601745
-0.66096525556418162 0.74328545761836973 0.095572989323982643  -0.33091024020101545 -0.23862737818800145 -0.91299254504581084
-0.51873480041451092 0.13843733448120876 0.84282425105969128  -0.47538384129543554 -0.86578380003691946 -0.1562965611548367
-0.05461675092750562 1.3186356302649231 1.0687157005262189  -0.94544807568691691 0.31851500876272604 0.068382200701545576
-0.020669276508302414 1.2022655037944634 1.0000000000000002  -0.97927332546590939 0.20254321521823168 5.418053601326634e-16
-0.022968417915120942 1.0802812773502413 0.80260647397715423  -0.97707738033578018 0.080345839839677816 -0.19714040391717297
-0.0055291226396743109 1.0813709460566903 0.9336189543617831  -0.99445714115859507 0.081578796887611674 -0.066331699036312766
-0.68136436973507708 0.93128429947378155 1.9453832490724945  -0.31851500876272582 -0.068382200701545937 0.94544807568691702
-0.57283811630245085 0.86100639327308437 1.8934279503155276  -0.42704736713517966 -0.13875119650014026 0.89352037004910556
-0.37659777085683765 0.86172631781262787 1.7695778385021763  -0.62320039727703724 -0.13836216352689595 0.76972539034249055
-0.47420617247402475 0.79171259951203332 1.8247164420172246  -0.52568280774650455 -0.20813967421463644 0.82482450355065029
-0.37325238119242898 1.5155632797953906 1.5842789803216091  -0.62647295099493439 0.51565247738810649 0.58449479401890891
-0.30883755347893593 1.5521688397941484 1.4662660666179788  -0.69097715483087396 0.55222595833073052 0.46647300291392707
-0.31070343884806517 1.6730187872058688 1.2681715176003199  -0.68937955050281274 0.67285685715261256 0.2683644632421523
-0.25665450403946555 1.576083837885744 1.3399483569044259  -0.74324570666303857 0.57610127698437363 0.34013694034011438
-0.68136436973507686 1.0687157005262189 1.9453832490724945  -0.31851500876272537 0.068382200701545479 0.94544807568691713
-0.79773449620553671 1.0000000000000002 1.9793307234916977  -0.20254321521823285 5.418053601326634e-16 0.97927332546590917
-0.91971872264975907 0.80260647397715423 1.9770315820848792  -0.080345839839678343 -0.19714040391717227 0.97707738033578029
-0.91862905394330996 0.93361895436178299 1.9944708773603259  -0.081578796887612645 -0.066331699036312267 0.99445714115859507
-1.5155632797953908 0.41572101967839115 1.6267476188075713  0.51565247738810716 -0.5844947940189078 0.62647295099493494
-1.5521688397941484 0.53373393338202191 1.6911624465210644  0.55222595833073107 -0.46647300291392729 0.6909771548308733
-1.6730187872058688 0.73182848239968057 1.6892965611519348  0.6728568571526139 -0.26836446324215041 0.6893795505028123
-1.576083837885744 0.66005164309557451 1.7433454959605346  0.57610127698437297 -0.34013694034011599 0.74324570666303835
-1.3186356302649234 1.0687157005262189 1.9453832490724945  0.3189751246919833 0.068666567984591712 0.94527232704070585
-1.4271618836975493 1.138993606726916 1.8934279503155276  0.4270473671351796 0.13875119650014209 0.89352037004910523
-1.6234022291431622 1.1382736821873727 1.7695778385021765  0.6232003972770358 0.13836216352689526 0.76972539034249177
-1.5257938275259753 1.2082874004879671 1.8247164420172246  0.52568280774650522 0.20813967421463539 0.82482450355065018
-1.9453832490724943 1.3186356302649234 1.0687157005262189  0.94544807568691713 0.31851500876272548 0.068382200701545118
-1.8934279503155276 1.4271618836975493 1.138993606726916  0.89352037004910523 0.4270473671351796 0.13875119650014209
-1.7695778385021763 1.6234022291431622 1.1382736821873727  0.76972539034249166 0.6232003972770358 0.13836216352689629
-1.8247164420172246 1.5257938275259753 1.2082874004879671  0.82482450355065018 0.52568280774650522 0.20813967421463539
-1.5155632797953906 1.5842789803216091 1.6267476188075711  0.51582822603431877 0.58403467808965048 0.62675731827798087
-1.4662660666179788 1.6911624465210642 1.552168839794148  0.46647300291392846 0.69097715483087296 0.55222595833073063
-1.4655650436231658 1.8112924693932408 1.3536293529417165  0.4655048671593236 0.81121902067950968 0.35387698305874282
-1.4063294025426432 1.7843712383737107 1.4686770498343504  0.40646863937642691 0.78424095119900938 0.46877433341209002
-1.0687157005262193 1.9453832490724945 0.68136436973507686  0.068382200701545298 0.94544807568691758 -0.31851500876272415
-1.0000000000000002 1.9793307234916977 0.79773449620553649  1.4309218485554959e-15 0.97927332546590906 -0.20254321521823371
-0.80260647397715434 1.9770315820848792 0.91971872264975896  -0.19714040391717205 0.97707738033578029 -0.080345839839678121
-0.9336189543617831 1.9944708773603257 0.91862905394330985  -0.066331699036312378 0.99445714115859507 -0.081578796887612728
-1.0000000000000002 1.9029146105865324 1.4298199692771043  0.0002843672830459537 0.90300980278163367 0.42961984965260097
-0.86100639327308426 1.8934279503155274 1.4271618836975497  -0.13875119650014023 0.89352037004910578 0.42704736713517905
-0.66433279178978188 1.8915737467434823 1.3040127948790103  -0.33550256744406765 0.89156486051918815 0.30422052318316617
-0.72533155387381609 1.8657421844304007 1.4183870394745819  -0.27447137325094778 0.86581974808662088 0.41835586417422083
-0.097085389413467671 1.4298199692771043 1.0000000000000002  -0.9030098027816339 0.42961984965260047 -0.00028436728304480059
-0.10657204968447276 1.4271618836975497 1.1389936067269162  -0.89352037004910567 0.42704736713517855 0.13875119650014289
-0.108426253256518 1.3040127948790106 1.3356672082102183  -0.89156486051918671 0.30422052318316789 0.33550256744407009
-0.13425781556959937 1.4183870394745819 1.2746684461261846  -0.86581974808661977 0.41835586417422177 0.27447137325095017
-0.48443672020460971 1.5842789803216091 1.6267476188075713  -0.515828226034316 0.58403467808965326 0.62675731827798054
-0.44783116020585179 1.4662660666179783 1.6911624465210644  -0.55222595833073185 0.46647300291392668 0.69097715483087319
-0.32698121279413161 1.2681715176003199 1.6892965611519353  -0.67285685715261212 0.26836446324215224 0.68937955050281319
-0.4239161621142562 1.3399483569044259 1.7433454959605346  -0.57610127698437386 0.34013694034011699 0.74324570666303713
-0.37325238119242876 0.48443672020460959 1.5842789803216091  -0.62647295099493427 -0.51565247738810671 0.58449479401890891
-0.44783116020585179 0.53373393338202169 1.6911624465210644  -0.55222595833073096 -0.46647300291392774 0.69097715483087319
-0.64637064705828351 0.53443495637683469 1.8112924693932411  -0.35387698305874443 -0.46550486715932343 0.81121902067950902
-0.53132295016564979 0.5936705974573574 1.7843712383737111  -0.46877433341208907 -0.40646863937642846 0.78424095119900905
-1.5155632797953902 1.5842789803216091 0.37325238119242876  0.51565247738810593 0.5844947940189088 -0.62647295099493505
-1.5521688397941484 1.4662660666179785 0.30883755347893582  0.55222595833073107 0.46647300291392751 -0.6909771548308733
-1.6730187872058688 1.2681715176003199 0.31070343884806517  0.67285685715261256 0.2683644632421523 -0.68937955050281274
-1.576083837885744 1.3399483569044259 0.25665450403946566  0.57610127698437386 0.34013694034011438 -0.74324570666303846
-1.6267476188075713 0.48443672020460959 0.41572101967839103  0.6264729509949355 -0.51565247738810582 -0.58449479401890836
-1.5521688397941484 0.53373393338202157 0.30883755347893571  0.55222595833073118 -0.4664730029139284 -0.69097715483087252
-1.3536293529417167 0.53443495637683447 0.18870753060675904  0.35387698305874282 -0.46550486715932432 -0.81121902067950913
-1.4686770498343509 0.59367059745735729 0.21562876162628941  0.46877433341209102 -0.4064686393764268 -0.78424095119900883
-1.3186356302649231 1.0687157005262189 0.054616750927505398  0.31897512469198369 0.068666567984592183 -0.94527232704070563
-1.2022655037944634 1.0000000000000002 0.020669276508302414  0.20254321521823199 7.0504159042904293e-16 -0.97927332546590939
-1.0802812773502413 0.80260647397715423 0.022968417915120942  0.080345839839677802 -0.19714040391717336 -0.97707738033578007
-1.0813709460566903 0.9336189543617831 0.0055291226396741999  0.081578796887611452 -0.066331699036312614 -0.99445714115859518
-0.31222404809805682 0.2811508450273621 0.90641151615731874  -0.68572398718655969 -0.72091363611669146 -0.10033016823457222
-0.29107512591583118 0.30186484921791523 0.90688305806336111  -0.71176658290178463 -0.69503929178689339 -0.10153183902939247
-0.25988381527545967 0.33544566672286746 0.9046373499048469  -0.73743092048488046 -0.66756092552179136 -0.10275236361909755
-0.21570896554595276 0.38998187620182151 0.89436470058605511  -0.78585236795603841 -0.60955597917047022 -0.10429556095738801
-0.68136436973507708 1.0687157005262189 0.054616750927505398  -0.31897512469198097 0.068666567984592072 -0.94527232704070652
-0.57283811630245096 1.138993606726916 0.10657204968447231  -0.42704736713517855 0.13875119650014281 -0.89352037004910567
-0.37659777085683765 1.1382736821873727 0.23042216149782369  -0.62320039727703613 0.13836216352689593 -0.76972539034249143
-0.47420617247402497 1.2082874004879671 0.17528355798277517  -0.52568280774650455 0.20813967421463439 -0.82482450355065084
-0.054616750927505398 1.3186356302649231 0.93128429947378155  -0.94544807568691702 0.31851500876272598 -0.068382200701545659
-0.10657204968447231 1.4271618836975493 0.86100639327308448  -0.89352037004910567 0.42704736713517882 -0.1387511965001417
-0.23042216149782357 1.6234022291431622 0.86172631781262776  -0.76972539034249099 0.62320039727703647 -0.13836216352689645
-0.17528355798277517 1.5257938275259753 0.79171259951203343  -0.82482450355065051 0.52568280774650489 -0.20813967421463486
-0.48443672020460971 1.5842789803216091 0.37325238119242865  -0.51582822603431666 0.58403467808965259 -0.62675731827798054
-0.53373393338202169 1.6911624465210644 0.44783116020585179  -0.4664730029139279 0.69097715483087296 -0.55222595833073118
-0.53443495637683458 1.8112924693932411 0.64637064705828351  -0.46550486715932454 0.81121902067950857 -0.3538769830587441
-0.5936705974573574 1.7843712383737111 0.53132295016564957  -0.4064686393764288 0.78424095119900838 -0.46877433341208996
-0.93128429947378155 1.9453832490724945 1.3186356302649234  -0.068666567984591767 0.94527232704070574 0.31897512469198358
-1 1.9793307234916977 1.2022655037944634  9.3774004638345608e-17 0.97927332546590917 0.20254321521823299
-1.1973935260228461 1.9770315820848792 1.0802812773502413  0.1971404039171723 0.97707738033578007 0.080345839839680327
-1.0663810456382175 1.9944708773603257 1.0813709460566903  0.066331699036313002 0.99445714115859496 0.081578796887613922
-1.0000000000000002 1.9029146105865324 0.57018003072289591  0.00028436728304837792 0.90300980278163467 -0.42961984965259897
-1.1389936067269162 1.8934279503155276 0.57283811630245085  0.13875119650014178 0.89352037004910589 -0.42704736713517855
-1.3356672082102183 1.8915737467434819 0.69598720512098966  0.33550256744406909 0.89156486051918704 -0.30422052318316789
-1.2746684461261846 1.8657421844304007 0.58161296052541855  0.27447137325094867 0.86581974808662043 -0.41835586417422133
-1.9029146105865324 1.4298199692771043 1  0.90300980278163367 0.42961984965260103 0.00028436728304587899
-1.8934279503155274 1.4271618836975497 0.86100639327308426  0.89352037004910578 0.42704736713517905 -0.13875119650014023
-1.8915737467434823 1.3040127948790103 0.66433279178978188  0.89156486051918815 0.30422052318316617 -0.33550256744406765
-1.8657421844304007 1.4183870394745819 0.72533155387381609  0.86581974808662088 0.41835586417422083 -0.27447137325094778
-1.9029146105865324 0.57018003072289591 1.0000000000000002  0.90300980278163456 -0.42961984965259897 -0.00028436728304734988
-1.8934279503155276 0.57283811630245096 1.1389936067269162  0.89352037004910523 -0.42704736713517927 0.13875119650014325
-1.8915737467434823 0.69598720512098988 1.3356672082102183  0.8915648605191876 -0.304220523183167 0.33550256744406859
-1.8657421844304007 0.58161296052541855 1.2746684461261846  0.86581974808662043 -0.41835586417422133 0.27447137325094889
-1.4298199692771043 1 1.9029146105865324  0.42961984965260097 0.00028436728304587731 0.90300980278163367
-1.4271618836975497 0.86100639327308426 1.8934279503155274  0.42704736713517905 -0.13875119650014023 0.89352037004910578
-1.3040127948790103 0.66433279178978188 1.8915737467434823  0.30422052318316617 -0.33550256744406765 0.89156486051918815
-1.4183870394745819 0.72533155387381609 1.8657421844304007  0.41835586417422088 -0.27447137325094784 0.86581974808662099
-1.5842789803216091 0.37325238119242876 1.5155632797953902  0.58449479401890869 -0.62647295099493505 0.51565247738810605
-1.4662660666179785 0.30883755347893582 1.5521688397941484  0.4664730029139274 -0.69097715483087352 0.55222595833073085
-1.2681715176003199 0.31070343884806517 1.6730187872058688  0.26836446324215257 -0.68937955050281241 0.67285685715261279
-1.3399483569044259 0.25665450403946566 1.576083837885744  0.34013694034011438 -0.74324570666303846 0.57610127698437386
-0.48443672020460959 0.41572101967839103 1.6267476188075713  -0.51565247738810671 -0.58449479401890791 0.62647295099493516
-0.53373393338202169 0.30883755347893582 1.5521688397941484  -0.46647300291392857 -0.69097715483087241 0.55222595833073118
-0.53443495637683447 0.18870753060675904 1.3536293529417167  -0.46550486715932327 -0.81121902067950935 0.35387698305874365
-0.59367059745735729 0.21562876162628941 1.4686770498343509  -0.4064686393764268 -0.78424095119900883 0.46877433341209102
-1.0687157005262189 0.05461675092750562 1.3186356302649231  0.068666567984591961 -0.94527232704070585 0.31897512469198336
-1.0000000000000002 0.020669276508302414 1.2022655037944634  7.0156847914614115e-16 -0.97927332546590939 0.20254321521823196
-0.80260647397715423 0.022968417915120942 1.0802812773502413  -0.19714040391717297 -0.97707738033578018 0.080345839839677816
-0.9336189543617831 0.0055291226396743109 1.0813709460566903  -0.066331699036312766 -0.99445714115859507 0.081578796887611674
-0.18950565604187924 0.42721864490060907 0.88304523202927665  -0.80855713981694299 -0.57905836064064875 -0.1045311753650975
-0.17811496227257201 0.44486756488630003 0.87684117534766193  -0.83034168959696941 -0.54729298896533396 -0.1048954848725201
-0.5512195414246408 0.12458499692215487 0.82416586116838453  -0.44918580997761925 -0.87543631012341494 -0.17844712110944824
-0.14688267020077073 0.50017470245974227 0.85269038907862316  -0.84145097432227922 -0.51152737254410363 -0.17406896607440639
-1.0687157005262189 0.054616750927505398 0.68136436973507708  0.068666567984591698 -0.94527232704070641 -0.31897512469198158
-1.138993606726916 0.10657204968447231 0.57283811630245096  0.13875119650014281 -0.89352037004910567 -0.42704736713517855
-1.1382736821873727 0.23042216149782369 0.37659777085683765  0.13836216352689593 -0.76972539034249143 -0.62320039727703613
-1.2082874004879671 0.17528355798277517 0.47420617247402497  0.20813967421463439 -0.82482450355065084 -0.52568280774650455
-1.3186356302649231 0.93128429947378155 0.054616750927505398  0.31897512469198219 -0.068666567984591462 -0.94527232704070618
-1.4271618836975493 0.86100639327308448 0.10657204968447231  0.42704736713517877 -0.138751196500143 -0.89352037004910545
-1.6234022291431622 0.86172631781262776 0.23042216149782357  0.62320039727703691 -0.13836216352689676 -0.76972539034249066
-1.5257938275259753 0.79171259951203343 0.17528355798277517  0.52568280774650478 -0.20813967421463547 -0.82482450355065029
-1.5842789803216091 0.37325238119242876 0.48443672020460959  0.58449479401890903 -0.62647295099493472 -0.51565247738810616
-1.6911624465210644 0.44783116020585179 0.53373393338202169  0.69097715483087319 -0.55222595833073096 -0.46647300291392774
-1.8112924693932411 0.64637064705828351 0.53443495637683458  0.81121902067950902 -0.35387698305874443 -0.46550486715932343
-1.7843712383737111 0.53132295016564979 0.5936705974573574  0.78424095119900905 -0.46877433341208907 -0.40646863937642846
-1.9453832490724945 1.3186356302649234 0.93128429947378155  0.94544807568691747 0.31851500876272471 -0.068382200701544701
-1.9793307234916977 1.2022655037944634 1  0.97927332546590917 0.20254321521823299 9.3774004638345608e-17
-1.9770315820848792 1.0802812773502413 1.1973935260228461  0.97707738033578007 0.080345839839679772 0.19714040391717261
-1.9944708773603259 1.0813709460566905 1.0663810456382177  0.99445714115859496 0.081578796887613741 0.066331699036313058
-1.9453832490724945 0.68136436973507708 1.0687157005262189  0.94527232704070641 -0.31897512469198164 0.068666567984591462
-1.9793307234916977 0.79773449620553671 1.0000000000000002  0.97927332546590928 -0.20254321521823254 2.142909661550342e-15
-1.9770315820848792 0.91971872264975918 0.80260647397715434  0.97707738033578029 -0.080345839839678343 -0.19714040391717214
-1.9944708773603259 0.91862905394330996 0.9336189543617831  0.99445714115859507 -0.081578796887612645 -0.066331699036312183
-1.6267476188075713 1.5155632797953908 0.41572101967839115  0.62647295099493483 0.51565247738810716 -0.58449479401890791
-1.6911624465210644 1.5521688397941484 0.53373393338202191  0.6909771548308733 0.55222595833073107 -0.46647300291392729
-1.6892965611519348 1.6730187872058688 0.73182848239968057  0.68937955050281163 0.67285685715261367 -0.26836446324215263
-1.7433454959605346 1.576083837885744 0.66005164309557451  0.74324570666303746 0.57610127698437374 -0.34013694034011632
-1 0.097085389413467671 0.57018003072289591  0.00028436728304626969 -0.90300980278163412 -0.42961984965260003
-0.86100639327308426 0.10657204968447231 0.57283811630245096  0.15741543596758908 -0.56506561193601734 -0.80988964354812443
-0.1418121948905855 0.51101182387798283 0.84695178356442269  -0.86108611456980888 -0.47782642632713573 -0.17381774822643467
-0.12310298935169572 0.55521070025011254 0.82226795238624728  -0.54699716260005082 -0.8250054127899169 0.14198652391981534
-0.097085389413467671 0.57018003072289591 1.0000000000000002  -0.90300980278163401 -0.42961984965260008 0.00028436728304630964
-0.10657204968447231 0.57283811630245096 0.86100639327308426  -0.56506561193601723 -0.80988964354812465 0.15741543596758889
-0.66704995977036097 0.095052466200525487 0.73781627941851213  -0.33340690397517719 -0.90406837259895867 -0.26739523938910653
-0.69602657944578872 0.09312926541647408 0.71089969747156689  -0.30244718988226732 -0.90831680955776628 -0.28893990864385699
-0.82416586116838464 0.5512195414246408 0.12458499692215486  -0.17844712110944724 -0.44918580997762436 -0.8754363101234125
-0.10542210643598447 0.60871986758868468 0.78560578771446687  -0.88272155572186639 -0.40347958770451692 -0.24084616951440374
-0.58417903277383187 0.11307342108777625 0.80253395542112949  -0.42149610172113205 -0.88421545010984015 -0.20125623970685214
-0.74328545761836984 0.095572989323982616 0.66096525556418162  -0.23862737818799848 -0.91299254504581195 -0.3309102402010145
-0.41572101967839092 0.37325238119242865 1.5155632797953904  -0.58403467808965159 -0.62675731827798065 0.51582822603431766
-0.30883755347893571 0.44783116020585167 1.4662660666179785  -0.69097715483087263 -0.55222595833073107 0.46647300291392857
-0.18870753060675916 0.64637064705828351 1.465565043623166  -0.81121902067950946 -0.35387698305874238 0.46550486715932421
-0.21562876162628952 0.53132295016564968 1.4063294025426436  -0.7842409511990085 -0.46877433341209029 0.40646863937642819
-0.054616750927505398 0.68136436973507708 1.0687157005262189  -0.94544807568691724 -0.31851500876272487 0.068382200701546339
-0.10657204968447231 0.57283811630245096 1.138993606726916  -0.89352037004910578 -0.42704736713517849 0.13875119650014278
-0.23042216149782369 0.37659777085683765 1.1382736821873727  -0.76972539034249143 -0.62320039727703613 0.13836216352689593
-0.17528355798277517 0.47420617247402497 1.2082874004879671  -0.82482450355065084 -0.52568280774650455 0.20813967421463439
-0.93128429947378155 0.054616750927505398 1.3186356302649231  -0.068666567984591462 -0.94527232704070618 0.31897512469198219
-0.86100639327308448 0.10657204968447231 1.4271618836975493  -0.138751196500143 -0.89352037004910545 0.42704736713517877
-0.86172631781262776 0.23042216149782357 1.6234022291431622  -0.13836216352689648 -0.76972539034249099 0.62320039727703647
-0.79171259951203343 0.17528355798277517 1.5257938275259753  -0.20813967421463486 -0.82482450355065051 0.52568280774650489
-0.41572101967839103 1.6267476188075713 0.48443672020460948  -0.58449479401890869 0.62647295099493472 -0.51565247738810649
-0.30883755347893582 1.5521688397941484 0.53373393338202169  -0.69097715483087219 0.55222595833073196 -0.46647300291392818
-0.18870753060675916 1.3536293529417167 0.53443495637683425  -0.81121902067950924 0.35387698305874377 -0.46550486715932354
-0.21562876162628952 1.4686770498343509 0.59367059745735706  -0.78424095119900927 0.46877433341208979 -0.40646863937642735
-0.054616750927505398 0.68136436973507708 0.93128429947378155  -0.94527232704070629 -0.31897512469198197 -0.068666567984591406
-0.020669276508302414 0.79773449620553682 1  -0.97927332546590939 -0.20254321521823182 -3.0910690417825027e-16
-0.022968417915120942 0.91971872264975907 1.1973935260228461  -0.97707738033578007 -0.080345839839677774 0.19714040391717347
-0.0055291226396741999 0.91862905394330996 1.0663810456382175  -0.99445714115859518 -0.081578796887611507 0.066331699036312863
-1 1.5739215462855711 1.8189102873387162  0.00078604920685526928 0.57538069819453364 0.81788534298629867
-1.116269135355652 1.553923611197678 1.8244089525965697  0.11760246779863172 0.55440616112166219 0.823895301648221
-1.2595222183644983 1.3961011738843632 1.8807678912304873  0.25988482570664379 0.39599581735923556 0.880708345595418
-1.2345849586062214 1.5157160292432703 1.8240187342392598  0.23530638500725778 0.51562318151862341 0.82387113061171702
-1.280755298723806 1 1.9597793820657468  0.28060440841513784 0.00037212726837773511 0.95982343558556982
-1.2788981373351191 1.1362409534038143 1.9506072962094394  0.27889806070390455 0.13594944033505804 0.95064905270461697
-1.3759607778954341 1.3392409609172167 1.8623045076538935  0.37608264246842493 0.33912378489964834 0.86229745711633865
-1.2726998137406516 1.2691171673622652 1.9236940845413728  0.27282039415738768 0.26880216379452282 0.92375019852295037
-0.94514285928638309 1.5400179687989204 1.8398638505656821  -0.056307189018218164 0.5410667466969773 0.83909253130010375
-1 1.625781888690033 1.7799980947332728  -0.00023519417927709139 0.62694312538533037 0.77906499229253767
-1.2001281403434438 1.6801807185069526 1.7051970771451344  0.20029565457621398 0.68040299513329283 0.7049350430866167
-1.0672770740243225 1.7022770253220765 1.7087176976875216  0.067501320615790325 0.70276863564904046 0.70820887911908481
-1.5666478495993443 1.5237239478373752 1.6361001815799718  0.56632219140540208 0.52380155193385269 0.63632626043050466
-1.451266665607259 1.5875076190110726 1.6717091588743203  0.45142526361231922 0.58763152153323206 0.67149417441485415
-1.2728788208449453 1.7402458861856145 1.6144698341819117  0.27300775118978182 0.74028370995146753 0.61436698850995375
-1.3283955572053112 1.6406145370870959 1.694096083320241  0.32871571883365275 0.64057192708348176 0.69398384882087094
-0.96609642251334915 1.4851608280853035 1.8737674280523333  -0.034313951497558837 0.48348770334523666 0.87467833713118315
-0.88373086464434814 1.553923611197678 1.8244089525965697  -0.11774782579538165 0.55402560894563235 0.82413049582750042
-0.86416377447305925 1.7199153070653639 1.6806397508870439  -0.13609530337963499 0.7200809942624572 0.68041269101920498
-0.80699455980445267 1.624572621678267 1.7567416602149373  -0.19358827458119529 0.62484261256047691 0.75636980999592618
-1.0694523319806282 1.9168554803037774 1.3931315324664026  0.069401954456726395 0.91670068154564299 0.39350124418016791
-1.0000000000000002 1.8664057563461913 1.499340630602181  0.00015872199696848172 0.86652958223713639 0.49912569350341157
-0.79268760819673556 1.7807681678543315 1.5894256868089485  -0.20735457304096547 0.78085960551688605 0.58928970592656038
-0.93025980236669126 1.8004723406749188 1.5952985273360616  -0.069662907281837369 0.80067536950372575 0.59503447968929846
-1.0339035774866507 1.4851608280853035 1.8737674280523333  0.035585805831079731 0.48427375255209087 0.8741925320045173
-0.92814172250764548 1.437654475842026 1.8962672300889245  -0.072917516439696836 0.43665833532627646 0.89666746009117093
-0.71592045537741122 1.4603930887008656 1.8410333026720758  -0.28440717777405683 0.46019616855581263 0.8410303464662533
-0.81343900392119473 1.3899876630720456 1.9017231378830692  -0.18714545413041628 0.38953622755321821 0.90179715370028068
-0.47627605216262503 1.6361001815799718 1.5666478495993443  -0.5234294246654736 0.63609627313050621 0.56692430597377952
-0.54873333439274141 1.5875076190110726 1.6717091588743203  -0.45142526361231849 0.5876315215332345 0.67149417441485248
-0.59899507473160263 1.4048073899588975 1.8217822259851766  -0.40115992505181813 0.40477696304846245 0.82172156155092047
-0.62850263027516928 1.5277725269342672 1.7638362809535502  -0.37176976328895944 0.52785497534633885 0.76364675610270694
-1.0548571407136167 1.5400179687989204 1.8398638505656821  0.056307189018217581 0.5410667466969783 0.83909253130010319
-1.0718582774923548 1.4376544758420258 1.8962672300889245  0.07291751643969803 0.43665833532627779 0.89666746009117015
-0.96026541144158839 1.2602649483574222 1.9647192955096329  -0.039677999129163588 0.2599005139796019 0.96481986879326076
-1.0777044036438097 1.3227105890477233 1.943302656293743  0.077926023088562446 0.32203490693742859 0.94351526412634279
-0.60686846753359758 1.0694523319806275 1.9168554803037776  -0.39350124418016746 0.069401954456725104 0.91670068154564333
-0.72110186266488108 1.1362409534038143 1.9506072962094394  -0.27889806070390422 0.13594944033505585 0.95064905270461741
-0.95947771833128326 1.1319285691139529 1.9904306120773461  -0.040575895565417137 0.13176921185868215 0.99044963097837846
-0.84014219641217736 1.1993769697289565 1.9667958970608925  -0.16010344242024352 0.19913925651268669 0.96680424297825784
-0.94514285928638309 1.5400179687989204 0.16013614943431764  -0.056307189018220856 0.54106674669697641 -0.83909253130010419
-0.92814172250764526 1.4376544758420258 0.10373276991107527  -0.072536964263669665 0.43642314114699976 -0.89681281808792024
-1.0397345885584115 1.2602649483574222 0.035280704490367243  0.039677999129163984 0.25990051397960023 -0.9648198687932612
-0.92229559635619074 1.3227105890477233 0.056697343706257008  -0.077926023088562335 0.32203490693742837 -0.9435152641263429
-1.3931315324664024 1.0694523319806275 0.083144519696222496  0.39289912961179058 0.069774081725104437 -0.91693066884564167
-1.2788981373351191 1.1362409534038143 0.049392703790560599  0.27915487828976138 0.13610816233202574 -0.95055095711572846
-1.0405222816687172 1.1319285691139529 0.009569387922654049  0.040575895565418019 0.13176921185868254 -0.99044963097837835
-1.1598578035878229 1.1993769697289562 0.033204102939107583  0.16010344242024346 0.19913925651268541 -0.96680424297825807
-1 1.5739215462855709 0.1810897126612836  0.00078604920685582482 0.57538069819453475 -0.81788534298629789
-0.88373086464434825 1.5539236111976775 0.17559104740343034  -0.11774782579538297 0.55402560894563369 -0.82413049582749931
-0.74047778163550204 1.3961011738843632 0.11923210876951273  -0.25988482570664434 0.39599581735923634 -0.88070834559541755
-0.76541504139377881 1.5157160292432705 0.17598126576074025  -0.23530638500725864 0.51562318151862241 -0.82387113061171746
-0.71924470127619444 1 0.040220617934253244  -0.28060440841513601 0.00037212726837965399 -0.95982343558557037
-0.7211018626648813 1.1362409534038143 0.049392703790560599  -0.2788980607039046 0.13594944033505643 -0.95064905270461719
-0.6240392221045663 1.3392409609172167 0.13769549234610656  -0.3760826424684246 0.33912378489964895 -0.86229745711633865
-0.72730018625934878 1.2691171673622652 0.076305915458627194  -0.27282039415738779 0.26880216379452376 -0.92375019852295004
-1.0548571407136167 1.5400179687989204 0.16013614943431764  0.056792994144885971 0.5397948923634569 -0.83987858050695807
-1 1.6257818886900326 0.22000190526672714  0.00023519417927899073 0.62694312538533015 -0.77906499229253801
-0.79987185965655661 1.6801807185069528 0.29480292285486565  -0.20029565457621096 0.68040299513329372 -0.7049350430866167
-0.93272292597567807 1.7022770253220765 0.29128230231247854  -0.067501320615790408 0.70276863564904013 -0.70820887911908514
-0.43335215040065567 1.5237239478373752 0.36389981842002816  -0.56692430597377952 0.52342942466547393 -0.6360962731305061
-0.54873333439274141 1.5875076190110726 0.32829084112567963  -0.45142526361231822 0.58763152153323361 -0.67149417441485348
-0.72712117915505492 1.7402458861856145 0.38553016581808797  -0.27300775118978005 0.74028370995146853 -0.61436698850995342
-0.671604442794689 1.6406145370870961 0.30590391667975902  -0.32871571883365341 0.64057192708348243 -0.69398384882087005
-1.0339035774866507 1.4851608280853033 0.12623257194766668  0.035585805831079308 0.4842737525520906 -0.87419253200451741
-1.116269135355652 1.5539236111976775 0.17559104740343034  0.11774782579538226 0.55402560894563413 -0.8241304958274992
-1.135836225526941 1.7199153070653639 0.31936024911295646  0.13609530337963652 0.72008099426245631 -0.68041269101920554
-1.1930054401955479 1.6245726216782668 0.24325833978506295  0.19358827458119438 0.62484261256047802 -0.75636980999592551
-0.93054766801937283 1.9168554803037776 0.60686846753359758  -0.06940195445672484 0.91670068154564366 -0.3935012441801668
-1.0000000000000002 1.8664057563461918 0.50065936939781919  -0.00015872199696717758 0.86652958223713727 -0.49912569350340996
-1.2073123918032649 1.7807681678543315 0.41057431319105175  0.20735457304096586 0.78085960551688727 -0.5892897059265586
-1.069740197633309 1.800472340674919 0.40470147266393852  0.069662907281837591 0.80067536950372598 -0.59503447968929846
-0.96609642251334915 1.4851608280853033 0.12623257194766668  -0.035585805831078642 0.48427375255209082 -0.87419253200451719
-1.0718582774923548 1.437654475842026 0.1037327699110755  0.072536964263670914 0.4364231411470002 -0.89681281808791991
-1.2840795446225894 1.4603930887008656 0.15896669732792434  0.28440717777405761 0.46019616855581352 -0.84103034646625252
-1.1865609960788057 1.3899876630720458 0.098276862116930985  0.18714545413041625 0.38953622755321882 -0.90179715370028046
-1.5237239478373752 1.6361001815799718 0.43335215040065567  0.52380155193385236 0.63632626043050511 -0.56632219140540196
-1.4512666656072588 1.5875076190110726 0.32829084112567986  0.45152335920120801 0.58737470394737523 -0.67165289641182235
-1.401004925268398 1.4048073899588978 0.17821777401482353  0.40115992505181947 0.40477696304846317 -0.82172156155091958
-1.3714973697248309 1.5277725269342675 0.23616371904645017  0.37176976328895894 0.5278549753463373 -0.76364675610270816
-1.4851608280853033 0.12623257194766668 0.96609642251334915  0.48348770334523633 -0.87467833713118337 -0.034313951497558476
-1.437654475842026 0.1037327699110755 1.0718582774923548  0.43642314114700065 -0.89681281808791968 0.072536964263671552
-1.4603930887008658 0.15896669732792457 1.2840795446225894  0.46019616855581374 -0.84103034646625263 0.284407177774057
-1.3899876630720458 0.098276862116930763 1.1865609960788057  0.38953622755321993 -0.90179715370027991 0.18714545413041681
-1.6361001815799718 0.43335215040065567 1.5237239478373752  0.63632626043050511 -0.56632219140540196 0.52380155193385236
-1.5875076190110726 0.32829084112567986 1.4512666656072588  0.58763152153323306 -0.67149417441485337 0.45142526361231905
-1.4048073899588978 0.17821777401482364 1.401004925268398  0.40477696304846195 -0.82172156155092002 0.40115992505181974
-1.5277725269342675 0.23616371904645017 1.3714973697248309  0.52785497534633785 -0.76364675610270727 0.37176976328895983
-1.5400179687989204 0.16013614943431764 0.94514285928638309  0.54106674669697652 -0.83909253130010431 -0.056307189018218975
-1.4376544758420258 0.10373276991107527 0.92814172250764526  0.4366583353262789 -0.89666746009116971 -0.072917516439698085
-1.2602649483574222 0.035280704490367243 1.0397345885584115  0.25990051397960084 -0.96481986879326098 0.039677999129164941
-1.3227105890477233 0.056697343706257008 0.92229559635619074  0.32203490693742803 -0.94351526412634312 -0.077926023088561711
-1.0694523319806275 0.083144519696222496 1.3931315324664024  0.069401954456725812 -0.9167006815456431 0.39350124418016769
-1.1362409534038143 0.049392703790560599 1.2788981373351191  0.13610816233202494 -0.95055095711572812 0.27915487828976271
-1.1319285691139529 0.009569387922654049 1.0405222816687172  0.13176921185868193 -0.99044963097837835 0.040575895565418935
-1.1993769697289562 0.033204102939107583 1.1598578035878229  0.19913925651268541 -0.96680424297825807 0.16010344242024346
-1.5739215462855713 0.18108971266128371 1  0.57538069819453497 -0.81788534298629778 -0.00078604920685504712
-1.553923611197678 0.17559104740343034 0.88373086464434814  0.55402560894563335 -0.82413049582749964 -0.11774782579538265
-1.3961011738843634 0.11923210876951285 0.74047778163550193  0.39599581735923639 -0.88070834559541744 -0.2598848257066444
-1.5157160292432708 0.17598126576074047 0.76541504139377869  0.51562318151862241 -0.82387113061171735 -0.23530638500725837
-1 0.040220617934253244 0.71924470127619444  -0.0003721272683797147 -0.95982343558557037 -0.28060440841513612
-1.1362409534038143 0.049392703790560488 0.7211018626648813  0.13610816233202566 -0.95055095711572812 -0.27915487828976282
-1.3392409609172167 0.13769549234610656 0.6240392221045663  0.33912378489964895 -0.86229745711633865 -0.3760826424684246
-1.2691171673622652 0.076305915458627194 0.72730018625934878  0.26880216379452376 -0.92375019852295004 -0.27282039415738779
-1.5400179687989204 0.16013614943431764 1.0548571407136167  0.54106674669697641 -0.83909253130010419 0.056307189018220412
-1.6257818886900326 0.22000190526672714 1  0.62694312538533081 -0.77906499229253745 -0.0002351941792781122
-1.6801807185069528 0.29480292285486565 0.79987185965655661  0.6804029951332935 -0.70493504308661659 -0.20029565457621204
-1.7022770253220765 0.29128230231247854 0.93272292597567807  0.70276863564904013 -0.70820887911908503 -0.067501320615790922
-1.5237239478373752 0.36389981842002816 0.43335215040065567  0.5238015519338528 -0.63632626043050533 -0.5663221914054013
-1.5875076190110728 0.32829084112567974 0.5487333343927413  0.5873747039473759 -0.67165289641182191 -0.45152335920120767
-1.7402458861856145 0.38553016581808797 0.72712117915505492  0.74028370995146875 -0.61436698850995308 -0.27300775118977982
-1.6406145370870964 0.30590391667975914 0.67160444279468889  0.64057192708348409 -0.69398384882086916 -0.32871571883365186
-1.4851608280853033 0.12623257194766668 1.0339035774866507  0.48348770334523605 -0.87467833713118348 0.034313951497558996
-1.5539236111976777 0.17559104740343046 1.116269135355652  0.55402560894563402 -0.8241304958274992 0.11774782579538288
-1.7199153070653639 0.31936024911295646 1.135836225526941  0.72008099426245642 -0.68041269101920565 0.13609530337963585
-1.6245726216782668 0.24325833978506295 1.1930054401955479  0.62484261256047746 -0.75636980999592585 0.19358827458119496
-1.9168554803037776 0.6068684675335978 0.93054766801937272  0.91670068154564366 -0.39350124418016685 -0.069401954456724965
-1.8664057563461918 0.50065936939781919 1.0000000000000002  0.86652958223713727 -0.49912569350340996 -0.00015872199696717758
-1.7807681678543315 0.41057431319105175 1.2073123918032649  0.7808596055168876 -0.58928970592655816 0.20735457304096555
-1.800472340674919 0.40470147266393852 1.069740197633309  0.80067536950372598 -0.59503447968929846 0.069662907281837591
-1.8189102873387162 1 1.5739215462855713  0.81788534298629878 -0.00078604920685488569 0.57538069819453364
-1.8244089525965697 1.116269135355652 1.553923611197678  0.82413049582749975 0.11774782579538146 0.55402560894563346
-1.8807678912304873 1.2595222183644983 1.3961011738843632  0.880708345595418 0.25988482570664379 0.39599581735923556
-1.8240187342392593 1.2345849586062214 1.5157160292432708  0.82387113061171691 0.23530638500725823 0.51562318151862341
-1.9597793820657468 1.280755298723806 1  0.95982343558556982 0.28060440841513784 0.00037212726837924942
-1.9506072962094394 1.2788981373351191 1.1362409534038143  0.95064905270461708 0.2788980607039046 0.13594944033505654
-1.8623045076538935 1.3759607778954341 1.3392409609172167  0.86229745711633865 0.37608264246842493 0.33912378489964834
-1.9236940845413728 1.2726998137406516 1.2691171673622652  0.92375019852295037 0.27282039415738768 0.26880216379452282
-1.0339035774866507 0.51483917191469653 0.12623257194766679  0.035585805831079294 -0.4842737525520906 -0.87419253200451741
-0.92814172250764548 0.56234552415797401 0.1037327699110755  -0.072917516439697974 -0.43665833532627818 -0.89666746009117004
-0.34253810440658672 0.25355721782048268 0.90387507728811034  -0.65866036402230654 -0.74597391594557105 -0.09843496124260237
-0.81343900392119461 0.6100123369279542 0.098276862116930763  -0.18714545413041345 -0.3895362275532307 -0.90179715370027591
-0.098424941615366676 0.758150485750266 0.64339140453754151  -0.89862238304022934 -0.24555619785558172 -0.36356562872995801
-0.77318510024650355 0.10194841255523886 0.62479622481419606  -0.23977066491306379 -0.89859032272364059 -0.3674853196449766
-0.093129265416474122 0.71089969747156689 0.69602657944578861  -0.90831680955776672 -0.28893990864385294 -0.30244718988226948
-0.14854713354961635 0.85435218642293975 0.49724573572225772  -0.85521146872291121 -0.13337026124727611 -0.50082503649441745
-0.16013614943431764 1.0548571407136167 0.45998203120107961  -0.83987858050695829 0.056792994144885638 -0.53979489236345668
-0.1037327699110755 1.0718582774923548 0.56234552415797401  -0.89666746009117027 0.072917516439698071 -0.43665833532627762
-0.035280704490367243 0.96026541144158839 0.73973505164257791  -0.9648198687932612 -0.039677999129164657 -0.25990051397960007
-0.056697343706257008 1.0777044036438097 0.67728941095227668  -0.9435152641263429 0.077926023088562127 -0.32203490693742853
-0.083144519696222274 0.6068684675335978 0.93054766801937272  -0.91670068154564299 -0.39350124418016813 -0.069401954456725076
-0.049392703790560488 0.72110186266488108 0.86375904659618619  -0.95064905270461719 -0.27889806070390466 -0.13594944033505613
-0.009569387922653938 0.95947771833128337 0.86807143088604799  -0.99044963097837846 -0.040575895565417984 -0.13176921185868187
-0.033204102939107361 0.84014219641217736 0.80062303027104398  -0.96680424297825818 -0.16010344242024252 -0.19913925651268555
-0.16013614943431764 1.0548571407136167 1.5400179687989204  -0.83909253130010475 0.056307189018218066 0.54106674669697585
-0.22000190526672714 1 1.6257818886900326  -0.77906499229253823 -0.0002351941792800324 0.6269431253853297
-0.29480292285486576 0.79987185965655661 1.6801807185069526  -0.70493504308661714 -0.20029565457621229 0.68040299513329294
-0.29128230231247854 0.93272292597567807 1.7022770253220765  -0.70820887911908503 -0.067501320615792657 0.70276863564904002
-0.36389981842002828 0.43335215040065567 1.5237239478373752  -0.63632626043050422 -0.56632219140540263 0.52380155193385269
-0.32829084112567974 0.5487333343927413 1.5875076190110728  -0.6714941744148536 -0.45142526361231916 0.58763152153323273
-0.38553016581808797 0.72712117915505492 1.7402458861856145  -0.61436698850995308 -0.27300775118978055 0.74028370995146875
-0.30590391667975914 0.67160444279468889 1.6406145370870964  -0.69398384882086939 -0.32871571883365208 0.64057192708348376
-0.51483917191469653 1.8737674280523331 1.0339035774866507  -0.48427375255208899 0.87419253200451819 0.03558580583107953
-0.44607638880232214 1.8244089525965697 1.116269135355652  -0.5540256089456348 0.82413049582749864 0.11774782579538236
-0.28008469293463611 1.6806397508870439 1.135836225526941  -0.72008099426245598 0.68041269101920598 0.13609530337963682
-0.37542737832173323 1.7567416602149373 1.1930054401955479  -0.62484261256047635 0.7563698099959264 0.19358827458119596
-0.083144519696222496 1.3931315324664026 0.93054766801937272  -0.91693066884564167 0.39289912961179096 -0.069774081725102965
-0.13359424365380856 1.499340630602181 1.0000000000000002  -0.86652958223713694 0.49912569350341057 -0.00015872199696842786
-0.21923183214566888 1.5894256868089487 1.2073123918032649  -0.78085960551688627 0.5892897059265596 0.20735457304096697
-0.19952765932508121 1.5952985273360616 1.069740197633309  -0.80067536950372642 0.59503447968929779 0.069662907281836647
-0.94514285928638309 0.4599820312010795 1.8398638505656821  -0.056307189018218594 -0.54106674669697619 0.83909253130010453
-0.92814172250764526 0.56234552415797401 1.8962672300889243  -0.072536964263670414 -0.4364231411470002 0.89681281808791991
-1.0397345885584115 0.73973505164257791 1.9647192955096329  0.039677999129162471 -0.25990051397960112 0.96481986879326098
-0.92229559635619063 0.67728941095227657 1.943302656293743  -0.077926023088562266 -0.32203490693742931 0.94351526412634257
-1.3931315324664026 0.93054766801937272 1.9168554803037776  0.39350124418016702 -0.069401954456725756 0.91670068154564333
-1.2788981373351191 0.86375904659618619 1.9506072962094394  0.27915487828976282 -0.13610816233202519 0.95055095711572812
-1.0405222816687172 0.86807143088604788 1.9904306120773461  0.040575895565418026 -0.13176921185868287 0.99044963097837824
-1.1598578035878231 0.80062303027104387 1.9667958970608925  0.16010344242024496 -0.19913925651268566 0.96680424297825773
-1.8737674280523331 0.96609642251334915 1.4851608280853035  0.87467833713118304 -0.034313951497559204 0.48348770334523677
-1.8244089525965697 0.88373086464434814 1.553923611197678  0.82413049582749998 -0.11774782579538136 0.55402560894563324
-1.6806397508870439 0.86416377447305925 1.7199153070653639  0.68041269101920498 -0.13609530337963499 0.7200809942624572
-1.7567416602149373 0.80699455980445267 1.624572621678267  0.75636980999592485 -0.19358827458119449 0.62484261256047868
-1.3931315324664026 1.0694523319806277 1.9168554803037774  0.39350124418016719 0.069401954456725631 0.91670068154564333
-1.499340630602181 1.0000000000000002 1.8664057563461913  0.49912569350341157 0.00015872199696846261 0.86652958223713639
-1.5894256868089485 0.79268760819673556 1.7807681678543315  0.58928970592655894 -0.20735457304096452 0.78085960551688738
-1.5952985273360616 0.93025980236669126 1.8004723406749188  0.59503447968929846 -0.069662907281837383 0.80067536950372575
-1.8398638505656821 0.94514285928638309 1.5400179687989204  0.83909253130010408 -0.056307189018218372 0.54106674669697674
-1.7799980947332728 1 1.625781888690033  0.77906499229253701 -0.00023519417927646462 0.62694312538533126
-1.7051970771451344 1.2001281403434438 1.6801807185069526  0.70493504308661703 0.20029565457621298 0.68040299513329283
-1.7087176976875216 1.0672770740243225 1.7022770253220765  0.70820887911908414 0.067501320615789839 0.70276863564904124
-1.6361001815799718 1.5666478495993443 1.5237239478373752  0.63609627313050587 0.56692430597378018 0.52342942466547326
-1.6717091588743203 1.4512666656072586 1.5875076190110728  0.67165289641182346 0.45152335920120673 0.5873747039473749
-1.6144698341819117 1.2728788208449453 1.7402458861856145  0.61436698850995297 0.27300775118978177 0.74028370995146831
-1.694096083320241 1.3283955572053112 1.6406145370870959  0.69398384882087072 0.32871571883365419 0.64057192708348132
-1.5400179687989204 1.8398638505656821 0.94514285928638309  0.54106674669697674 0.83909253130010408 -0.05630718901821833
-1.625781888690033 1.7799980947332728 1  0.62694312538533126 0.77906499229253701 -0.00023519417927646462
-1.6801807185069526 1.7051970771451344 1.2001281403434438  0.68040299513329283 0.7049350430866167 0.20029565457621398
-1.7022770253220765 1.7087176976875216 1.0672770740243225  0.70276863564904035 0.70820887911908503 0.067501320615790408
-1.5237239478373752 1.6361001815799718 1.5666478495993443  0.52342942466547404 0.63609627313050632 0.56692430597377896
-1.5875076190110726 1.67170915887432 1.4512666656072588  0.58737470394737423 0.67165289641182258 0.45152335920120901
-1.7402458861856145 1.6144698341819117 1.2728788208449453  0.74028370995146753 0.61436698850995375 0.27300775118978182
-1.6406145370870959 1.694096083320241 1.3283955572053112  0.64057192708348165 0.69398384882087072 0.32871571883365364
-1.5739215462855713 1.8189102873387162 1  0.57538069819453364 0.81788534298629878 -0.00078604920685487007
-1.5539236111976777 1.8244089525965697 1.116269135355652  0.55440616112166174 0.82389530164822156 0.11760246779863132
-1.3961011738843632 1.8807678912304873 1.2595222183644983  0.39599581735923556 0.880708345595418 0.25988482570664373
-1.5157160292432703 1.8240187342392598 1.2345849586062214  0.51562318151862307 0.82387113061171724 0.2353063850072579
-1 1.9597793820657468 1.280755298723806  0.0003721272683792859 0.95982343558556993 0.28060440841513778
-1.1362409534038143 1.9506072962094394 1.2788981373351191  0.13594944033505654 0.95064905270461708 0.2788980607039046
-1.3392409609172167 1.8623045076538935 1.3759607778954341  0.33912378489965089 0.86229745711633787 0.37608264246842449
-1.2691171673622652 1.9236940845413728 1.2726998137406516  0.26880216379452282 0.92375019852295037 0.27282039415738768
-0.4599820312010795 1.8398638505656821 0.94514285928638309  -0.5410667466969753 0.83909253130010486 -0.056307189018220093
-0.56234552415797401 1.8962672300889243 0.92814172250764526  -0.43642314114700048 0.89681281808791979 -0.072536964263670289
-0.73973505164257791 1.9647192955096329 1.0397345885584115  -0.25990051397960201 0.96481986879326076 0.039677999129163886
-0.67728941095227657 1.943302656293743 0.92229559635619063  -0.32203490693742948 0.94351526412634257 -0.077926023088562335
-0.93054766801937272 1.9168554803037776 1.3931315324664026  -0.069401954456725715 0.91670068154564344 0.39350124418016696
-0.86375904659618619 1.9506072962094394 1.2788981373351191  -0.13610816233202519 0.95055095711572812 0.27915487828976282
-0.86807143088604799 1.9904306120773461 1.0405222816687167  -0.13176921185868198 0.99044963097837835 0.040575895565419275
-0.80062303027104398 1.9667958970608925 1.1598578035878231  -0.19913925651268546 0.96680424297825784 0.16010344242024499
-0.51483917191469653 1.8737674280523331 0.96609642251334915  -0.4834877033452355 0.8746783371311837 -0.034313951497560995
-0.56234552415797401 1.8962672300889243 1.0718582774923548  -0.43642314114700154 0.89681281808791924 0.072536964263670359
-0.53960691129913463 1.8410333026720758 1.2840795446225892  -0.46019616855581419 0.84103034646625274 0.28440717777405577
-0.61001233692795442 1.9017231378830692 1.1865609960788057  -0.38953622755321837 0.90179715370028024 0.18714545413041764
-0.36389981842002839 1.5666478495993443 1.5237239478373752  -0.63632626043050433 0.56632219140540208 0.52380155193385314
-0.41249238098892749 1.6717091588743205 1.4512666656072588  -0.58763152153323117 0.67149417441485504 0.45142526361231899
-0.59519261004110291 1.8217822259851766 1.4010049252683978  -0.404776963048462 0.82172156155091969 0.4011599250518203
-0.47222747306573287 1.7638362809535502 1.3714973697248309  -0.52785497534633763 0.76364675610270771 0.37176976328895911
-0.12623257194766668 0.96609642251334915 1.4851608280853033  -0.87419253200451685 -0.035585805831078648 0.48427375255209165
-0.1037327699110755 1.0718582774923548 1.437654475842026  -0.89681281808791968 0.072536964263671552 0.43642314114700065
-0.15896669732792457 1.2840795446225894 1.4603930887008658  -0.84103034646625263 0.284407177774057 0.46019616855581374
-0.098276862116930985 1.1865609960788057 1.3899876630720458  -0.9017971537002798 0.18714545413041681 0.38953622755321982
-0.43335215040065567 1.5237239478373752 1.6361001815799718  -0.56692430597378018 0.52342942466547338 0.63609627313050587
-0.32829084112567997 1.4512666656072586 1.5875076190110731  -0.67165289641182224 0.45152335920120762 0.58737470394737579
-0.17821777401482364 1.401004925268398 1.4048073899588978  -0.82172156155091958 0.4011599250518203 0.40477696304846228
-0.23616371904645039 1.3714973697248309 1.5277725269342679  -0.76364675610270738 0.37176976328895972 0.52785497534633796
-0.12623257194766668 1.0339035774866507 1.4851608280853033  -0.87467833713118337 0.034313951497558101 0.48348770334523627
-0.17559104740343034 1.116269135355652 1.553923611197678  -0.82413049582749986 0.11774782579538312 0.5540256089456328
-0.31936024911295646 1.135836225526941 1.7199153070653639  -0.68041269101920565 0.13609530337963585 0.72008099426245642
-0.24325833978506295 1.1930054401955479 1.6245726216782668  -0.75636980999592573 0.19358827458119499 0.62484261256047757
-0.60686846753359758 0.93054766801937272 1.9168554803037776  -0.39350124418016741 -0.069401954456725312 0.91670068154564333
-0.50065936939781919 1.0000000000000002 1.8664057563461918  -0.49912569350341002 -0.00015872199696717761 0.86652958223713739
-0.41057431319105175 1.2073123918032649 1.7807681678543315  -0.58928970592655816 0.20735457304096558 0.78085960551688771
-0.40470147266393852 1.069740197633309 1.800472340674919  -0.59503447968929879 0.069662907281837827 0.80067536950372564
-1 0.42607845371442854 1.8189102873387162  -0.00078604920685408902 -0.57538069819453419 0.81788534298629822
-0.88373086464434814 0.44607638880232214 1.8244089525965697  -0.11774782579538169 -0.55402560894563246 0.82413049582750031
-0.74047778163550215 0.60389882611563706 1.8807678912304873  -0.2598848257066434 -0.39599581735923622 0.88070834559541789
-0.76541504139377881 0.48428397075672935 1.8240187342392595  -0.23530638500725778 -0.51562318151862263 0.82387113061171757
-0.71924470127619433 1.0000000000000002 1.9597793820657468  -0.28060440841513751 0.00037212726837982762 0.95982343558556993
-0.72110186266488108 0.8637590465961863 1.9506072962094394  -0.27889806070390427 -0.13594944033505543 0.95064905270461741
-0.6240392221045663 0.66075903908278344 1.8623045076538935  -0.37608264246842532 -0.33912378489964851 0.86229745711633843
-0.72730018625934878 0.73088283263773501 1.9236940845413728  -0.27282039415738879 -0.26880216379452365 0.92375019852294971
-1.8737674280523331 1.0339035774866507 0.5148391719146963  0.87467833713118337 0.03431395149755935 -0.48348770334523616
-1.8244089525965697 1.116269135355652 0.44607638880232214  0.82413049582749898 0.11774782579538207 -0.55402560894563446
-1.6806397508870439 1.135836225526941 0.28008469293463611  0.68041269101920598 0.13609530337963621 -0.72008099426245609
-1.7567416602149373 1.1930054401955479 0.37542737832173323  0.75636980999592651 0.19358827458119438 -0.62484261256047668
-1.3931315324664024 0.93054766801937272 0.083144519696222496  0.39350124418016758 -0.069401954456724785 -0.91670068154564321
-1.499340630602181 1.0000000000000002 0.13359424365380856  0.49912569350341057 -0.00015872199696842786 -0.86652958223713694
-1.5894256868089485 1.2073123918032649 0.21923183214566877  0.58928970592655883 0.20735457304096683 -0.78085960551688693
-1.5952985273360616 1.069740197633309 0.19952765932508121  0.59503447968929779 0.069662907281837133 -0.80067536950372642
-1 0.42607845371442854 0.18108971266128371  -0.00078604920685503151 -0.5753806981945343 -0.81788534298629811
-1.116269135355652 0.44607638880232214 0.17559104740343046  0.11774782579538288 -0.55402560894563369 -0.82413049582749931
-1.2595222183644985 0.60389882611563694 0.11923210876951296  0.25988482570664367 -0.39599581735923617 -0.88070834559541777
-1.2345849586062214 0.48428397075672935 0.17598126576074047  0.23530638500725881 -0.5156231815186233 -0.82387113061171691
-1.2807552987238058 1.0000000000000002 0.040220617934253244  0.2806044084151369 0.00037212726837912603 -0.95982343558557015
-1.2788981373351191 0.86375904659618641 0.049392703790560599  0.27889806070390505 -0.1359494403350564 -0.95064905270461708
-1.3759607778954341 0.66075903908278333 0.13769549234610656  0.37608264246842521 -0.33912378489964806 -0.86229745711633865
-1.2726998137406516 0.73088283263773501 0.076305915458627194  0.27282039415738812 -0.26880216379452238 -0.92375019852295037
-1.0548571407136167 0.45998203120107961 0.16013614943431764  0.056307189018219801 -0.54106674669697652 -0.83909253130010408
-1.0718582774923548 0.56234552415797401 0.1037327699110755  0.072917516439698057 -0.43665833532627801 -0.89666746009117004
-0.96026541144158839 0.73973505164257791 0.035280704490367243  -0.039677999129164136 -0.25990051397959973 -0.96481986879326131
-1.0777044036438097 0.67728941095227668 0.056697343706257008  0.077926023088562404 -0.32203490693742831 -0.9435152641263429
-0.6068684675335978 0.93054766801937272 0.083144519696222274  -0.39289912961179058 -0.069774081725103937 -0.91693066884564178
-0.7211018626648813 0.86375904659618619 0.049392703790560488  -0.27915487828976177 -0.13610816233202491 -0.95055095711572846
-0.95947771833128337 0.86807143088604799 0.009569387922653938  -0.040575895565417408 -0.13176921185868221 -0.99044963097837835
-0.84014219641217736 0.80062303027104398 0.033204102939107361  -0.16010344242024263 -0.19913925651268563 -0.96680424297825818
-0.12623257194766668 0.96609642251334915 0.51483917191469664  -0.87467833713118359 -0.034313951497558948 -0.48348770334523572
-0.17559104740343046 0.88373086464434814 0.44607638880232214  -0.84432049058386183 -0.14787325815197258 -0.51503049298439285
-0.13843733448120885 0.84282425105969117 0.5187348004145107  -0.86578380003692001 -0.15629656115483617 -0.47538384129543476
-0.87684117534766193 0.17811496227257195 0.44486756488630008  -0.10489548487252331 -0.8303416895969723 -0.54729298896532885
-0.6068684675335978 1.0694523319806277 0.083144519696222274  -0.39350124418016819 0.069401954456725243 -0.91670068154564299
-0.50065936939781919 1.0000000000000002 0.13359424365380834  -0.49912569350341002 0.00015872199696851823 -0.86652958223713739
-0.86055952199012919 0.15594877494016762 0.48342144068564141  -0.13950752053011936 -0.83662429167607066 -0.52971449507546176
-0.4047014726639383 0.93025980236669126 0.1995276593250811  -0.59503447968929823 -0.069662907281836689 -0.80067536950372598
-0.16013614943431764 0.94514285928638309 0.45998203120107972  -0.83987858050695852 -0.056792994144886172 -0.53979489236345624
-0.22000190526672725 1 0.37421811130996729  -0.77906499229253767 0.00023519417927984665 -0.62694312538533059
-0.29480292285486553 1.2001281403434438 0.3198192814930475  -0.70493504308661747 0.20029565457621371 -0.68040299513329217
-0.29128230231247842 1.0672770740243225 0.29772297467792341  -0.70820887911908548 0.067501320615792157 -0.70276863564903957
-0.36389981842002828 1.5666478495993443 0.47627605216262503  -0.63632626043050478 0.56632219140540274 -0.52380155193385192
-0.32829084112567963 1.4512666656072588 0.41249238098892738  -0.67149417441485382 0.45142526361231827 -0.58763152153323317
-0.38553016581808797 1.2728788208449453 0.25975411381438551  -0.61436698850995375 0.27300775118978016 -0.74028370995146831
-0.30590391667975902 1.3283955572053112 0.35938546291290407  -0.69398384882087027 0.32871571883365264 -0.64057192708348265
-0.45998203120107972 1.8398638505656824 1.0548571407136167  -0.53979489236345624 0.83987858050695852 0.056792994144885117
-0.37421811130996729 1.7799980947332728 1  -0.62694312538533004 0.77906499229253801 0.00023519417927956365
-0.3198192814930475 1.7051970771451346 0.79987185965655649  -0.68040299513329339 0.70493504308661681 -0.20029565457621201
-0.29772297467792341 1.7087176976875216 0.93272292597567807  -0.70276863564904024 0.70820887911908503 -0.067501320615791935
-0.47627605216262503 1.6361001815799718 0.43335215040065567  -0.52380155193385214 0.63632626043050489 -0.56632219140540241
-0.41249238098892749 1.6717091588743205 0.5487333343927413  -0.58763152153323051 0.67149417441485615 -0.45142526361231844
-0.25975411381438529 1.6144698341819119 0.72712117915505481  -0.74028370995146919 0.61436698850995297 -0.2730077511897796
-0.35938546291290396 1.694096083320241 0.67160444279468889  -0.64057192708348376 0.69398384882086983 -0.32871571883365147
-0.42607845371442887 1.8189102873387162 1  -0.5753806981945353 0.81788534298629756 -0.00078604920685339621
-0.44607638880232214 1.8244089525965697 0.88373086464434814  -0.55402560894563246 0.82413049582750031 -0.11774782579538169
-0.60389882611563706 1.8807678912304873 0.74047778163550215  -0.39599581735923833 0.880708345595417 -0.25988482570664329
-0.48428397075672935 1.8240187342392595 0.76541504139377881  -0.5156231815186233 0.82387113061171691 -0.23530638500725876
-1.0000000000000002 1.9597793820657468 0.71924470127619433  -0.00037212726837731829 0.95982343558556982 -0.2806044084151379
-0.86375904659618641 1.9506072962094394 0.72110186266488108  -0.13594944033505488 0.95064905270461753 -0.27889806070390405
-0.66075903908278344 1.8623045076538935 0.6240392221045663  -0.33912378489964895 0.86229745711633821 -0.37608264246842565
-0.73088283263773501 1.9236940845413728 0.72730018625934867  -0.26880216379452293 0.92375019852295015 -0.27282039415738812
-1.5400179687989204 1.8398638505656821 1.0548571407136167  0.53979489236345679 0.83987858050695818 0.056792994144884937
-1.437654475842026 1.8962672300889247 1.0718582774923548  0.43642314114700087 0.89681281808791968 0.072536964263669026
-1.2602649483574222 1.9647192955096329 0.96026541144158839  0.25990051397960212 0.96481986879326065 -0.039677999129163845
-1.3227105890477233 1.9433026562937428 1.0777044036438097  0.32203490693742864 0.94351526412634268 0.077926023088563473
-1.0694523319806282 1.9168554803037776 0.60686846753359758  0.069774081725103326 0.91693066884564134 -0.39289912961179169
-1.1362409534038143 1.9506072962094394 0.72110186266488119  0.13610816233202577 0.95055095711572835 -0.27915487828976199
-1.1319285691139529 1.9904306120773461 0.95947771833128304  0.13176921185868104 0.99044963097837846 -0.040575895565418782
-1.1993769697289565 1.9667958970608925 0.84014219641217713  0.19913925651268566 0.96680424297825829 -0.16010344242024166
-1.4851608280853035 1.8737674280523331 1.0339035774866507  0.48348770334523766 0.87467833713118248 0.034313951497557831
-1.4376544758420262 1.8962672300889245 0.92814172250764526  0.4366583353262784 0.89666746009117004 -0.072917516439696753
-1.4603930887008656 1.8410333026720758 0.71592045537741122  0.46019616855581302 0.84103034646625363 -0.28440717777405511
-1.3899876630720458 1.9017231378830692 0.8134390039211945  0.38953622755321887 0.90179715370028057 -0.18714545413041569
-1.6361001815799718 1.5666478495993443 0.47627605216262503  0.63609627313050654 0.56692430597377874 -0.52342942466547415
-1.5875076190110726 1.6717091588743203 0.54873333439274141  0.58763152153323406 0.6714941744148536 -0.45142526361231766
-1.4048073899588978 1.8217822259851766 0.59899507473160241  0.40477696304846061 0.82172156155092146 -0.40115992505181808
-1.5277725269342675 1.7638362809535499 0.62850263027516917  0.52785497534633918 0.7636467561027066 -0.37176976328895933
-1.8737674280523331 0.96609642251334915 0.51483917191469641  0.8741925320045173 -0.035585805831080321 -0.48427375255209076
-1.8962672300889243 1.0718582774923548 0.56234552415797401  0.89681281808791935 0.072536964263671261 -0.43642314114700126
-1.8410333026720758 1.2840795446225892 0.53960691129913463  0.84103034646625341 0.28440717777405616 -0.46019616855581286
-1.9017231378830692 1.1865609960788057 0.61001233692795442  0.90179715370028035 0.18714545413041767 -0.38953622755321843
-1.5666478495993446 1.5237239478373752 0.36389981842002828  0.56692430597377963 0.52342942466547426 -0.63609627313050576
-1.6717091588743205 1.4512666656072588 0.41249238098892749  0.67165289641182346 0.45152335920120679 -0.5873747039473749
-1.8217822259851766 1.4010049252683978 0.59519261004110291  0.82172156155092069 0.40115992505181919 -0.40477696304846128
-1.7638362809535502 1.3714973697248309 0.47222747306573287  0.76364675610270705 0.37176976328895994 -0.52785497534633818
-1.8737674280523333 1.0339035774866507 1.4851608280853035  0.87419253200451774 0.035585805831078302 0.48427375255208993
-1.8962672300889245 0.92814172250764548 1.437654475842026  0.89666746009117015 -0.072917516439696684 0.43665833532627801
-1.8410333026720758 0.71592045537741122 1.4603930887008656  0.84103034646625241 -0.28440717777405633 0.46019616855581452
-1.9017231378830692 0.81343900392119473 1.3899876630720456  0.90179715370028068 -0.18714545413041628 0.38953622755321821
-1.5666478495993443 0.47627605216262503 1.6361001815799718  0.56692430597377874 -0.52342942466547415 0.63609627313050665
-1.6717091588743203 0.54873333439274141 1.5875076190110726  0.6714941744148536 -0.45142526361231766 0.58763152153323406
-1.8217822259851766 0.59899507473160263 1.4048073899588975  0.82172156155092047 -0.40115992505181813 0.40477696304846245
-1.7638362809535502 0.62850263027516928 1.5277725269342672  0.76364675610270694 -0.37176976328895944 0.52785497534633885
-0.96609642251334915 0.51483917191469641 1.8737674280523331  -0.034313951497559551 -0.48348770334523605 0.87467833713118348
-1.0718582774923548 0.56234552415797401 1.8962672300889243  0.072536964263670886 -0.43642314114700098 0.89681281808791946
-1.2840795446225892 0.53960691129913463 1.8410333026720758  0.28440717777405577 -0.46019616855581419 0.84103034646625274
-1.1865609960788057 0.61001233692795442 1.9017231378830692  0.18714545413041769 -0.38953622755321848 0.90179715370028035
-1.5237239478373752 0.36389981842002828 1.5666478495993446  0.52342942466547426 -0.63609627313050576 0.56692430597377963
-1.4512666656072588 0.41249238098892749 1.6717091588743205  0.45152335920120679 -0.5873747039473749 0.67165289641182346
-1.4010049252683978 0.59519261004110291 1.8217822259851766  0.4011599250518203 -0.404776963048462 0.82172156155091969
-1.3714973697248309 0.47222747306573287 1.7638362809535502  0.37176976328895994 -0.52785497534633818 0.76364675610270705
-1.0339035774866507 0.5148391719146963 1.8737674280523331  0.03431395149755935 -0.48348770334523616 0.87467833713118337
-1.116269135355652 0.44607638880232214 1.8244089525965697  0.11774782579538173 -0.55402560894563424 0.8241304958274992
-1.135836225526941 0.28008469293463611 1.6806397508870439  0.13609530337963621 -0.72008099426245609 0.68041269101920598
-1.1930054401955479 0.37542737832173323 1.7567416602149373  0.19358827458119657 -0.62484261256047657 0.75636980999592607
-0.93054766801937272 0.083144519696222274 1.3931315324664024  -0.069401954456724771 -0.91670068154564321 0.39350124418016763
-1.0000000000000002 0.13359424365380856 1.499340630602181  -0.00015872199696842786 -0.86652958223713694 0.49912569350341057
-1.2073123918032649 0.21923183214566899 1.5894256868089485  0.2073545730409668 -0.78085960551688693 0.58928970592655883
-1.069740197633309 0.19952765932508121 1.5952985273360616  0.069662907281837133 -0.80067536950372642 0.59503447968929779
-0.42607845371442854 0.18108971266128371 1  -0.57538069819453441 -0.81788534298629822 -0.00078604920685503151
-0.44607638880232214 0.17559104740343046 1.116269135355652  -0.55440616112166086 -0.82389530164822189 0.11760246779863336
-0.60389882611563683 0.11923210876951296 1.2595222183644985  -0.3959958173592355 -0.88070834559541822 0.25988482570664312
-0.48428397075672913 0.17598126576074058 1.2345849586062216  -0.51562318151862285 -0.82387113061171746 0.23530638500725751
-1.0000000000000002 0.040220617934253244 1.2807552987238058  -0.00037212726837763092 -0.95982343558557015 0.28060440841513695
-0.86375904659618641 0.049392703790560599 1.2788981373351191  -0.1359494403350564 -0.95064905270461708 0.27889806070390505
-0.66075903908278333 0.13769549234610656 1.3759607778954341  -0.33912378489964806 -0.86229745711633865 0.37608264246842521
-0.73088283263773501 0.076305915458627194 1.2726998137406516  -0.26880216379452238 -0.92375019852295037 0.27282039415738812
-0.45998203120107961 0.16013614943431764 1.0548571407136167  -0.54106674669697652 -0.83909253130010408 0.056307189018219801
-0.56234552415797401 0.1037327699110755 1.0718582774923548  -0.43665833532627762 -0.89666746009117027 0.072917516439697475
-0.73973505164257791 0.035280704490367243 0.96026541144158839  -0.25990051397960007 -0.9648198687932612 -0.039677999129164657
-0.67728941095227668 0.056697343706257008 1.0777044036438097  -0.32203490693742853 -0.9435152641263429 0.077926023088562127
-0.93054766801937272 0.083144519696222274 0.6068684675335978  -0.069401954456725243 -0.9167006815456431 -0.39350124418016785
-0.86375904659618619 0.049392703790560488 0.7211018626648813  -0.13594944033505629 -0.95064905270461719 -0.27889806070390472
-0.86807143088604799 0.009569387922653938 0.95947771833128337  -0.13176921185868187 -0.99044963097837846 -0.040575895565417984
-0.80062303027104398 0.033204102939107361 0.84014219641217736  -0.19913925651268555 -0.96680424297825818 -0.16010344242024252
-0.96609642251334915 0.51483917191469653 0.12623257194766679  -0.034313951497558455 -0.48348770334523561 -0.8746783371311837
-0.88373086464434825 0.44607638880232225 0.17559104740343046  -0.1176024677986339 -0.55440616112166108 -0.82389530164822167
-0.37311241287933189 0.22843691950085854 0.8984470535752207  -0.63168040245029089 -0.76918721291848657 -0.096596587118434288
-0.17031256632806052 0.87149140923129198 0.45766135056488999  -0.83543687458500582 -0.14218930946431352 -0.5308742118974128
-1.0694523319806277 0.083144519696222274 0.6068684675335978  0.069401954456725243 -0.91670068154564299 -0.39350124418016819
-1.0000000000000002 0.13359424365380834 0.50065936939781919  0.0001587219969685182 -0.86652958223713727 -0.49912569350340996
-0.89436470058605533 0.21570896554595267 0.38998187620182156  -0.10429556095738572 -0.78585236795603663 -0.60955597917047311
-0.93025980236669126 0.1995276593250811 0.4047014726639383  -0.069662907281836842 -0.80067536950372598 -0.59503447968929823
-0.94514285928638309 0.45998203120107961 0.16013614943431764  -0.056792994144886942 -0.53979489236345535 -0.83987858050695896
-1 0.37421811130996707 0.22000190526672725  0.00023519417927879278 -0.62694312538533215 -0.77906499229253634
-1.2001281403434438 0.3198192814930475 0.29480292285486553  0.20029565457621359 -0.68040299513329228 -0.70493504308661725
-1.0672770740243225 0.29772297467792341 0.29128230231247842  0.067501320615791588 -0.70276863564903957 -0.70820887911908559
-1.5666478495993443 0.47627605216262503 0.36389981842002828  0.56632219140540208 -0.52380155193385236 -0.63632626043050511
-1.4512666656072588 0.41249238098892738 0.32829084112567963  0.45142526361231855 -0.5876315215332325 -0.67149417441485426
-1.2728788208449453 0.25975411381438551 0.38553016581808797  0.27300775118977999 -0.74028370995146831 -0.61436698850995386
-1.3283955572053112 0.35938546291290407 0.30590391667975902  0.32871571883365264 -0.64057192708348265 -0.69398384882087027
-1.8398638505656821 1.0548571407136167 0.4599820312010795  0.83987858050696007 0.056792994144884826 -0.53979489236345402
-1.7799980947332725 1 0.37421811130996718  0.7790649922925369 0.00023519417927860353 -0.62694312538533137
-1.7051970771451346 0.79987185965655649 0.3198192814930475  0.70493504308661714 -0.20029565457621229 -0.68040299513329294
-1.7087176976875216 0.93272292597567807 0.29772297467792341  0.70820887911908526 -0.067501320615792171 -0.70276863564903969
-1.6361001815799721 0.43335215040065578 0.47627605216262492  0.63632626043050589 -0.56632219140540152 -0.52380155193385203
-1.6717091588743205 0.5487333343927413 0.41249238098892749  0.67165289641182335 -0.45152335920120851 -0.58737470394737379
-1.6144698341819119 0.72712117915505481 0.25975411381438529  0.61436698850995297 -0.2730077511897796 -0.74028370995146919
-1.694096083320241 0.67160444279468889 0.35938546291290396  0.69398384882086972 -0.32871571883365142 -0.64057192708348365
-1.8189102873387162 1 0.42607845371442854  0.81788534298629767 -0.00078604920685363235 -0.57538069819453508
-1.8244089525965697 0.88373086464434814 0.44607638880232214  0.82413049582750031 -0.11774782579538169 -0.55402560894563246
-1.8807678912304873 0.74047778163550215 0.60389882611563706  0.88070834559541789 -0.2598848257066434 -0.39599581735923622
-1.8240187342392595 0.76541504139377881 0.48428397075672935  0.82387113061171757 -0.23530638500725778 -0.51562318151862252
-1.9597793820657468 0.71924470127619444 1.0000000000000002  0.95982343558556993 -0.28060440841513751 0.00037212726838032608
-1.9506072962094394 0.72110186266488108 0.86375904659618641  0.95055095711572746 -0.27915487828976454 -0.13610816233202591
-1.8623045076538935 0.6240392221045663 0.66075903908278344  0.86229745711633832 -0.37608264246842527 -0.33912378489964867
-1.9236940845413728 0.72730018625934878 0.73088283263773501  0.92375019852294971 -0.27282039415738879 -0.26880216379452365
-1.8398638505656821 1.0548571407136167 1.5400179687989204  0.83909253130010319 0.056307189018217581 0.5410667466969783
-1.8962672300889245 1.0718582774923548 1.4376544758420258  0.89666746009117015 0.07291751643969803 0.43665833532627779
-1.9647192955096329 0.96026541144158839 1.2602649483574222  0.96481986879326076 -0.039677999129163588 0.2599005139796019
-1.9433026562937428 1.0777044036438097 1.3227105890477233  0.94351526412634279 0.077926023088562529 0.3220349069374287
-1.9168554803037776 0.6068684675335978 1.0694523319806275  0.9167006815456431 -0.39350124418016769 0.069401954456725243
-1.9506072962094394 0.72110186266488119 1.1362409534038143  0.95064905270461764 -0.27889806070390388 0.13594944033505513
-1.9904306120773461 0.95947771833128337 1.1319285691139529  0.99044963097837846 -0.04057589556541729 0.13176921185868207
-1.9667958970608925 0.84014219641217736 1.1993769697289565  0.96680424297825784 -0.16010344242024374 0.19913925651268641
-1.8398638505656821 0.94514285928638309 0.4599820312010795  0.83909253130010453 -0.056307189018218594 -0.54106674669697619
-1.8962672300889243 0.92814172250764526 0.56234552415797401  0.89666746009117027 -0.072917516439697475 -0.43665833532627751
-1.9647192955096329 1.0397345885584115 0.73973505164257791  0.96481986879326065 0.039677999129164171 -0.25990051397960212
-1.943302656293743 0.92229559635619063 0.67728941095227657  0.94351526412634268 -0.07792602308856228 -0.32203490693742937
-1.9168554803037776 1.3931315324664026 0.93054766801937272  0.91670068154564344 0.39350124418016708 -0.06940195445672577
-1.9506072962094394 1.2788981373351191 0.86375904659618619  0.95055095711572812 0.27915487828976282 -0.13610816233202519
-1.9904306120773461 1.0405222816687172 0.86807143088604799  0.99044963097837824 0.040575895565418144 -0.13176921185868273
-1.9667958970608925 1.1598578035878231 0.80062303027104387  0.96680424297825784 0.16010344242024488 -0.19913925651268563
-1.4851608280853035 1.8737674280523331 0.96609642251334915  0.48348770334523716 0.87467833713118281 -0.034313951497558379
-1.553923611197678 1.8244089525965697 0.88373086464434814  0.55402560894563324 0.82413049582749998 -0.11774782579538136
-1.7199153070653639 1.6806397508870439 0.86416377447305925  0.72008099426245709 0.6804126910192051 -0.13609530337963541
-1.624572621678267 1.7567416602149373 0.80699455980445267  0.62484261256047691 0.75636980999592618 -0.19358827458119529
-1.9168554803037774 1.3931315324664026 1.0694523319806277  0.91670068154564333 0.39350124418016724 0.069401954456725631
-1.8664057563461913 1.499340630602181 1.0000000000000002  0.86652958223713639 0.49912569350341157 0.00015872199696846261
-1.7807681678543315 1.5894256868089485 0.79268760819673556  0.78085960551688705 0.58928970592655927 -0.20735457304096475
-1.8004723406749188 1.5952985273360616 0.93025980236669126  0.80067536950372586 0.59503447968929857 -0.069662907281837383
-0.51483917191469653 0.12623257194766679 1.0339035774866507  -0.48348770334523578 -0.87467833713118359 0.034313951497558337
-0.56234552415797401 0.1037327699110755 0.92814172250764548  -0.43642314114700098 -0.89681281808791946 -0.072536964263670373
-0.2284369195008584 0.89844705357522048 0.37311241287933194  -0.76918721291849057 -0.09659658711842789 -0.63168040245028712
-0.61001233692795442 0.098276862116930763 0.81343900392119461  -0.38953622755322043 -0.90179715370027946 -0.18714545413041711
-0.90641151615731874 0.31222404809805687 0.28115084502736221  -0.10033016823457604 -0.68572398718655903 -0.72091363611669157
-0.18610643753537565 0.88125255845135109 0.43210633013751576  -0.80326578355000511 -0.12230648174951686 -0.58292813064721083
-0.25355721782048268 0.90387507728811034 0.34253810440658672  -0.74597391594556806 -0.098434961242600316 -0.65866036402231021
-0.88125255845135109 0.43210633013751554 0.18610643753537598  -0.12230648174951586 -0.58292813064721183 -0.80326578355000444
-0.12623257194766668 1.0339035774866507 0.51483917191469664  -0.8741925320045173 0.035585805831079689 -0.48427375255209054
-0.1037327699110755 0.92814172250764548 0.56234552415797401  -0.89681281808791957 -0.072536964263671788 -0.4364231411470007
-0.2811508450273621 0.90641151615731863 0.31222404809805682  -0.72091363611669201 -0.10033016823457114 -0.68572398718655914
-0.098276862116930763 0.81343900392119461 0.61001233692795442  -0.90179715370027458 -0.18714545413041395 -0.38953622755323347
-0.89390471712616404 0.39369586600014284 0.21254447256850695  -0.094036448520743235 -0.60380229511961159 -0.79156802282425176
-0.4576613505648901 0.17031256632806047 0.87149140923129198  -0.53087421189741257 -0.83543687458500571 -0.14218930946431427
-0.72858929180595311 0.094046635219543179 0.67713360594626881  -0.27087574504909467 -0.91136373772562929 -0.30990719304796438
-0.38998187620182156 0.89436470058605533 0.21570896554595276  -0.60955597917047388 -0.10429556095738692 -0.78585236795603575
-0.51483917191469653 0.12623257194766679 0.96609642251334915  -0.48427375255209049 -0.87419253200451741 -0.035585805831079634
-0.44607638880232214 0.17559104740343046 0.88373086464434814  -0.51504067953570687 -0.84434219359547069 -0.14771377233618424
-0.39369586600014295 0.21254447256850689 0.89390471712616426  -0.60380229511961048 -0.79156802282425243 -0.09403644852074472
-0.64339140453754151 0.098424941615366676 0.75815048575026589  -0.36356562872996051 -0.89862238304022901 -0.24555619785557939
-0.083144519696222274 0.6068684675335978 1.0694523319806282  -0.91693066884564178 -0.39289912961179041 0.069774081725104325
-0.13359424365380834 0.50065936939781919 1.0000000000000002  -0.86652958223713739 -0.49912569350340985 -0.00015872199696876133
-0.33544566672286746 0.90463734990484679 0.25988381527545978  -0.6675609255217968 -0.10275236361909576 -0.73743092048487568
-0.1995276593250811 0.4047014726639383 0.93025980236669126  -0.80067536950372598 -0.59503447968929823 -0.069662907281836953
-0.1810897126612836 1 1.5739215462855709  -0.81788534298629811 0.00078604920685441341 0.57538069819453441
-0.17559104740343034 0.88373086464434814 1.553923611197678  -0.82413049582749953 -0.11774782579538282 0.55402560894563346
-0.11923210876951285 0.74047778163550193 1.3961011738843634  -0.88070834559541744 -0.25988482570664445 0.3959958173592365
-0.17598126576074047 0.76541504139377869 1.5157160292432708  -0.82387113061171735 -0.23530638500725837 0.51562318151862274
-0.040220617934253244 0.71924470127619444 1  -0.95982343558557037 -0.28060440841513612 -0.0003721272683797147
-0.049392703790560599 0.72110186266488119 1.1362409534038143  -0.95064905270461708 -0.27889806070390483 0.13594944033505654
-0.13769549234610656 0.6240392221045663 1.3392409609172167  -0.86229745711633854 -0.37608264246842454 0.33912378489964901
-0.076305915458627194 0.72730018625934878 1.2691171673622652  -0.92375019852295004 -0.27282039415738779 0.26880216379452376
-0.45998203120107961 0.16013614943431764 0.94514285928638309  -0.53979489236345513 -0.83987858050695918 -0.056792994144886491
-0.37421811130996707 0.22000190526672725 1  -0.62694312538533181 -0.77906499229253667 0.00023519417927783789
-0.3198192814930475 0.29480292285486553 1.2001281403434438  -0.68040299513329305 -0.7049350430866167 0.20029565457621315
-0.29772297467792341 0.29128230231247842 1.0672770740243225  -0.70276863564904046 -0.70820887911908481 0.067501320615791588
-0.47627605216262503 0.36389981842002828 1.5666478495993443  -0.52380155193385225 -0.636326260430505 0.56632219140540208
-0.41249238098892738 0.32829084112567963 1.4512666656072588  -0.58763152153323239 -0.67149417441485437 0.45142526361231855
-0.25975411381438551 0.38553016581808797 1.2728788208449453  -0.74028370995146831 -0.61436698850995386 0.27300775118977999
-0.35938546291290407 0.30590391667975902 1.3283955572053112  -0.64057192708348265 -0.69398384882087027 0.32871571883365264
-1.0548571407136167 0.4599820312010795 1.8398638505656821  0.056307189018217844 -0.54106674669697763 0.83909253130010364
-1 0.37421811130996696 1.7799980947332725  0.00023519417927876329 -0.62694312538533148 0.77906499229253701
-0.79987185965655649 0.3198192814930475 1.7051970771451346  -0.20029565457621173 -0.68040299513329294 0.70493504308661725
-0.93272292597567807 0.29772297467792341 1.7087176976875216  -0.067501320615792171 -0.70276863564903969 0.70820887911908526
-0.43335215040065567 0.47627605216262503 1.6361001815799718  -0.56632219140540208 -0.52380155193385225 0.63632626043050511
-0.5487333343927413 0.41249238098892749 1.6717091588743205  -0.45152335920120851 -0.58737470394737379 0.67165289641182335
-0.72712117915505481 0.25975411381438529 1.6144698341819119  -0.2730077511897796 -0.74028370995146919 0.61436698850995297
-0.67160444279468889 0.35938546291290396 1.694096083320241  -0.32871571883365069 -0.64057192708348398 0.69398384882086983
-0.18108971266128371 1 0.42607845371442887  -0.81788534298629756 -0.00078604920685410268 -0.57538069819453519
-0.17559104740343046 1.116269135355652 0.44607638880232214  -0.82389530164822189 0.11760246779863336 -0.55440616112166086
-0.11923210876951296 1.2595222183644985 0.60389882611563694  -0.880708345595418 0.25988482570664329 -0.39599581735923595
-0.17598126576074047 1.2345849586062214 0.48428397075672935  -0.82387113061171724 0.23530638500725817 -0.51562318151862274
-0.040220617934253355 1.280755298723806 1.0000000000000002  -0.95982343558557004 0.28060440841513723 -0.00037212726837797992
-0.049392703790560599 1.2788981373351191 0.8637590465961863  -0.95055095711572812 0.27915487828976271 -0.13610816233202605
-0.13769549234610656 1.3759607778954341 0.66075903908278333  -0.86229745711633854 0.37608264246842515 -0.33912378489964845
-0.076305915458627194 1.2726998137406516 0.73088283263773501  -0.92375019852295037 0.27282039415738812 -0.26880216379452265
-0.16013614943431764 0.94514285928638309 1.5400179687989204  -0.83909253130010408 -0.056307189018217935 0.54106674669697674
-0.10373276991107527 0.92814172250764526 1.4376544758420258  -0.89681281808792024 -0.072536964263669665 0.43642314114699976
-0.035280704490367243 1.0397345885584115 1.2602649483574222  -0.96481986879326098 0.039677999129164941 0.25990051397960084
-0.056697343706257008 0.92229559635619074 1.3227105890477233  -0.9435152641263429 -0.077926023088562335 0.32203490693742837
-0.083144519696222607 1.3931315324664026 1.0694523319806275  -0.9167006815456431 0.3935012441801678 0.069401954456725867
-0.049392703790560599 1.2788981373351191 1.1362409534038143  -0.95055095711572801 0.27915487828976304 0.13610816233202516
-0.009569387922654049 1.0405222816687172 1.1319285691139529  -0.99044963097837835 0.040575895565418935 0.13176921185868193
-0.033204102939107583 1.1598578035878229 1.1993769697289562  -0.96680424297825807 0.16010344242024346 0.19913925651268541
-0.82226795238624728 0.12310298935169572 0.55521070025011254  0.14198652391981534 -0.54699716260005082 -0.8250054127899169
-0.55521070025011254 0.82226795238624728 0.12310298935169572  -0.8250054127899169 0.14198652391981534 -0.54699716260005082
-0.49724573572225761 0.14854713354961635 0.85435218642293975  -0.50082503649440324 -0.85521146872291864 -0.1333702612472803
-0.44478929974988746 0.17773204761375266 0.87689701064830428  -0.51071495040769577 -0.84321209134395914 -0.16782016696872723
-0.60770816150558549 0.10617487126239183 0.78594000042913037  -0.3931165481837664 -0.89197584375895844 -0.22324532177533926
-0.42721864490060912 0.88304523202927654 0.18950565604187919  -0.57905836064064964 -0.10453117536509726 -0.80855713981694255
-0.59819314586024919 0.79307076339523386 0.10851189307750808  -0.42350808342754215 -0.20738833035095586 -0.881833875344882
-0.79307076339523386 0.10851189307750797 0.59819314586024919  -0.20738833035095922 -0.88183387534488133 -0.42350808342754154
-0.095572989323982643 0.66096525556418151 0.74328545761836984  -0.91299254504581129 -0.33091024020101767 -0.23862737818799643
-0.44486756488630003 0.87684117534766193 0.17811496227257201  -0.54729298896532741 -0.10489548487252455 -0.83034168959697308
-0.60871986758868468 0.78560578771446699 0.10542210643598451  -0.40347958770452025 -0.24084616951439783 -0.88272155572186639
-0.78560578771446699 0.10542210643598442 0.60871986758868479  -0.2408461695144028 -0.88272155572186384 -0.40347958770452308
-0.10194841255523887 0.62479622481419628 0.77318510024650311  -0.89859032272364381 -0.36748531964497128 -0.23977066491305993
-0.48342144068564125 0.86055952199012919 0.15594877494016779  -0.52971449507546131 -0.13950752053014914 -0.83662429167606589
-0.90463734990484679 0.25988381527545973 0.33544566672286741  -0.10275236361909962 -0.73743092048488268 -0.66756092552178858
-0.51101182387798261 0.84695178356442291 0.1418121948905855  -0.47782642632714106 -0.17381774822643653 -0.86108611456980566
-0.84695178356442291 0.1418121948905855 0.51101182387798261  -0.17381774822643653 -0.86108611456980566 -0.47782642632714106
-0.50017470245974227 0.85269038907862327 0.14688267020077073  -0.51152737254410108 -0.1740689660744103 -0.84145097432227989
-0.85269038907862327 0.14688267020077067 0.50017470245974227  -0.17406896607440964 -0.84145097432228455 -0.51152737254409375
-0.85435218642293986 0.49724573572225761 0.14854713354961632  -0.13337026124728099 -0.50082503649440047 -0.85521146872292031
-0.23967742655656482 0.35918321758479488 0.90105806124803833  -0.76207589783374052 -0.63913636447115008 -0.10365825365835343
-0.84282425105969128 0.51873480041451114 0.13843733448120865  -0.15629656115485271 -0.47538384129542982 -0.86578380003691968
-3  834 294 812
-3  836 296 813
-3  838 298 814
-3  840 300 815
-3  832 292 816
-3  844 304 817
-3  846 306 818
-3  848 308 819
-3  850 310 820
-3  842 302 821
-3  854 314 822
-3  856 316 823
-3  858 318 824
-3  860 320 825
-3  852 312 826
-3  835 295 827
-3  1608 1650 1293
-3  871 331 829
-3  841 301 830
-3  839 299 831
-3  816 276 832
-3  853 313 833
-3  812 272 834
-3  827 287 835
-3  813 273 836
-3  849 309 837
-3  814 274 838
-3  831 291 839
-3  815 275 840
-3  830 290 841
-3  821 281 842
-3  859 319 843
-3  817 277 844
-3  1682 1683 2083
-3  818 278 846
-3  870 330 847
-3  819 279 848
-3  837 297 849
-3  820 280 850
-3  863 323 851
-3  826 286 852
-3  833 293 853
-3  822 282 854
-3  869 329 855
-3  823 283 856
-3  397 1688 1603
-3  824 284 858
-3  843 303 859
-3  825 285 860
-3  862 322 861
-3  861 321 862
-3  851 311 863
-3  1603 1696 1025
-3  1697 1845 1844
-3  1892 2391 1098
-3  868 328 867
-3  867 327 868
-3  855 315 869
-3  847 307 870
-3  829 289 871
-3  875 335 872
-3  880 340 873
-3  877 337 874
-3  872 332 875
-3  879 339 876
-3  874 334 877
-3  881 341 878
-3  876 336 879
-3  873 333 880
-3  878 338 881
-3  885 345 882
-3  890 350 883
-3  887 347 884
-3  882 342 885
-3  889 349 886
-3  884 344 887
-3  891 351 888
-3  886 346 889
-3  883 343 890
-3  888 348 891
-3  895 355 892
-3  900 360 893
-3  897 357 894
-3  892 352 895
-3  899 359 896
-3  894 354 897
-3  901 361 898
-3  896 356 899
-3  893 353 900
-3  898 358 901
-3  917 377 902
-3  970 430 903
-3  937 397 904
-3  1779 1894 1328
-3  989 449 906
-3  978 438 907
-3  929 389 908
-3  982 442 909
-3  925 385 910
-3  942 402 911
-3  931 391 912
-3  954 414 913
-3  953 413 914
-3  916 376 915
-3  915 375 916
-3  902 362 917
-3  975 435 918
-3  920 380 919
-3  919 379 920
-3  946 406 921
-3  945 405 922
-3  924 384 923
-3  923 383 924
-3  910 370 925
-3  991 451 926
-3  928 388 927
-3  927 387 928
-3  908 368 929
-3  987 447 930
-3  912 372 931
-3  951 411 932
-3  966 426 933
-3  965 425 934
-3  936 396 935
-3  935 395 936
-3  904 364 937
-3  1331 1895 1456
-3  940 400 939
-3  939 399 940
-3  988 448 941
-3  911 371 942
-3  944 404 943
-3  943 403 944
-3  922 382 945
-3  921 381 946
-3  948 408 947
-3  947 407 948
-3  974 434 949
-3  973 433 950
-3  932 392 951
-3  971 431 952
-3  914 374 953
-3  913 373 954
-3  956 416 955
-3  955 415 956
-3  986 446 957
-3  985 445 958
-3  960 420 959
-3  959 419 960
-3  976 436 961
-3  367 1459 1543
-3  964 424 963
-3  963 423 964
-3  934 394 965
-3  933 393 966
-3  968 428 967
-3  967 427 968
-3  972 432 969
-3  903 363 970
-3  952 412 971
-3  969 429 972
-3  950 410 973
-3  949 409 974
-3  918 378 975
-3  961 421 976
-3  2082 2314 1329
-3  907 367 978
-3  1604 2372 1657
-3  2217 2373 1538
-3  984 444 981
-3  909 369 982
-3  990 450 983
-3  981 441 984
-3  958 418 985
-3  957 417 986
-3  930 390 987
-3  941 401 988
-3  906 366 989
-3  983 443 990
-3  926 386 991
-3  1203 663 992
-3  1118 578 993
-3  1211 671 994
-3  1122 582 995
-3  1219 679 996
-3  1126 586 997
-3  1227 687 998
-3  1130 590 999
-3  1195 655 1000
-3  1114 574 1001
-3  1243 703 1002
-3  1138 598 1003
-3  1251 711 1004
-3  1142 602 1005
-3  1259 719 1006
-3  1146 606 1007
-3  1267 727 1008
-3  1150 610 1009
-3  1235 695 1010
-3  1134 594 1011
-3  1283 743 1012
-3  1158 618 1013
-3  1291 751 1014
-3  1162 622 1015
-3  1299 759 1016
-3  1166 626 1017
-3  1307 767 1018
-3  1170 630 1019
-3  1275 735 1020
-3  1154 614 1021
-3  1207 667 1022
-3  1202 662 1023
-3  2441 1024 789
-3  1242 702 1025
-3  1351 811 1026
-3  1346 806 1027
-3  1231 691 1028
-3  1226 686 1029
-3  1223 683 1030
-3  1218 678 1031
-3  1131 591 1032
-3  1230 690 1033
-3  1279 739 1034
-3  1274 734 1035
-3  1115 575 1036
-3  1198 658 1037
-3  1175 635 1038
-3  1318 778 1039
-3  1119 579 1040
-3  1206 666 1041
-3  1263 723 1042
-3  1258 718 1043
-3  1123 583 1044
-3  1214 674 1045
-3  1191 651 1046
-3  1350 810 1047
-3  1127 587 1048
-3  1222 682 1049
-3  1187 647 1050
-3  1342 802 1051
-3  1151 611 1052
-3  1270 730 1053
-3  1303 763 1054
-3  1298 758 1055
-3  1135 595 1056
-3  1238 698 1057
-3  1245 2374 2370
-3  1101 2313 2375
-3  1139 599 1060
-3  1246 706 1061
-3  1347 807 1062
-3  1190 650 1063
-3  1143 603 1064
-3  1254 714 1065
-3  1215 675 1066
-3  1210 670 1067
-3  1147 607 1068
-3  1262 722 1069
-3  1319 779 1070
-3  1314 774 1071
-3  1171 631 1072
-3  1310 770 1073
-3  1199 659 1074
-3  1194 654 1075
-3  1155 615 1076
-3  1278 738 1077
-3  1343 803 1078
-3  1338 798 1079
-3  1159 619 1080
-3  1286 746 1081
-3  1605 2378 1609
-3  1931 1097 2382
-3  1163 623 1084
-3  1294 754 1085
-3  1239 699 1086
-3  1234 694 1087
-3  1167 627 1088
-3  1302 762 1089
-3  1315 775 1090
-3  1174 634 1091
-3  1311 771 1092
-3  1306 766 1093
-3  1271 731 1094
-3  1266 726 1095
-3  2222 637 1295
-3  1290 750 1097
-3  1893 1098 485
-3  1182 642 1099
-3  1652 400 2223
-3  2379 1656 1460
-3  1339 799 1102
-3  1186 646 1103
-3  1335 795 1104
-3  1330 790 1105
-3  1287 747 1106
-3  1282 742 1107
-3  1255 715 1108
-3  1250 710 1109
-3  1183 643 1110
-3  1334 794 1111
-3  1117 577 1112
-3  1128 588 1113
-3  1001 461 1114
-3  1036 496 1115
-3  1121 581 1116
-3  1112 572 1117
-3  993 453 1118
-3  1040 500 1119
-3  1125 585 1120
-3  1116 576 1121
-3  995 455 1122
-3  1044 504 1123
-3  1129 589 1124
-3  1120 580 1125
-3  997 457 1126
-3  1048 508 1127
-3  1113 573 1128
-3  1124 584 1129
-3  999 459 1130
-3  1032 492 1131
-3  1137 597 1132
-3  1148 608 1133
-3  1011 471 1134
-3  1056 516 1135
-3  1141 601 1136
-3  1132 592 1137
-3  1003 463 1138
-3  1060 520 1139
-3  1145 605 1140
-3  1136 596 1141
-3  1005 465 1142
-3  1064 524 1143
-3  1149 609 1144
-3  1140 600 1145
-3  1007 467 1146
-3  1068 528 1147
-3  1133 593 1148
-3  1144 604 1149
-3  1009 469 1150
-3  1052 512 1151
-3  1157 617 1152
-3  1168 628 1153
-3  1021 481 1154
-3  1076 536 1155
-3  1161 621 1156
-3  1152 612 1157
-3  1013 473 1158
-3  1080 540 1159
-3  1165 625 1160
-3  1156 616 1161
-3  1015 475 1162
-3  1084 544 1163
-3  1169 629 1164
-3  1160 620 1165
-3  1017 477 1166
-3  1088 548 1167
-3  1153 613 1168
-3  1164 624 1169
-3  1019 479 1170
-3  1072 532 1171
-3  1201 661 1172
-3  1308 768 1173
-3  1091 551 1174
-3  1038 498 1175
-3  1241 701 1176
-3  1292 2453 1928
-3  2391 2452 444
-3  1295 2450 2222
-3  1345 805 1180
-3  1324 784 1181
-3  1539 2319 1096
-3  1110 570 1183
-3  1225 685 1184
-3  1332 792 1185
-3  1103 563 1186
-3  1050 510 1187
-3  1217 677 1188
-3  1252 712 1189
-3  1063 523 1190
-3  1046 506 1191
-3  1229 689 1192
-3  1276 736 1193
-3  1075 535 1194
-3  1000 460 1195
-3  1273 733 1196
-3  1200 660 1197
-3  1037 497 1198
-3  1074 534 1199
-3  1197 657 1200
-3  1172 632 1201
-3  1023 483 1202
-3  992 452 1203
-3  1317 777 1204
-3  1208 668 1205
-3  1041 501 1206
-3  1022 482 1207
-3  1205 665 1208
-3  1260 720 1209
-3  1067 527 1210
-3  994 454 1211
-3  1257 717 1212
-3  1216 676 1213
-3  1045 505 1214
-3  1066 526 1215
-3  1213 673 1216
-3  1188 648 1217
-3  1031 491 1218
-3  996 456 1219
-3  1349 809 1220
-3  1224 684 1221
-3  1049 509 1222
-3  1030 490 1223
-3  1221 681 1224
-3  1184 644 1225
-3  1029 489 1226
-3  998 458 1227
-3  1341 801 1228
-3  1192 652 1229
-3  1033 493 1230
-3  1028 488 1231
-3  1269 729 1232
-3  1300 760 1233
-3  1087 547 1234
-3  1010 470 1235
-3  1297 757 1236
-3  1240 700 1237
-3  1057 517 1238
-3  1086 546 1239
-3  1237 697 1240
-3  1176 636 1241
-3  2449 2445 1247
-3  1002 462 1243
-3  1182 2444 1929
-3  2370 257 1245
-3  1061 521 1246
-3  1024 484 1247
-3  1686 2442 1242
-3  1344 804 1249
-3  1109 569 1250
-3  1004 464 1251
-3  1189 649 1252
-3  1256 716 1253
-3  1065 525 1254
-3  1108 568 1255
-3  1253 713 1256
-3  1212 672 1257
-3  1043 503 1258
-3  1006 466 1259
-3  1209 669 1260
-3  1264 724 1261
-3  1069 529 1262
-3  1042 502 1263
-3  1261 721 1264
-3  1316 776 1265
-3  1095 555 1266
-3  1008 468 1267
-3  1313 773 1268
-3  1232 692 1269
-3  1053 513 1270
-3  1094 554 1271
-3  1309 769 1272
-3  1196 656 1273
-3  1035 495 1274
-3  1020 480 1275
-3  1193 653 1276
-3  1280 740 1277
-3  1077 537 1278
-3  1034 494 1279
-3  1277 737 1280
-3  1340 800 1281
-3  1107 567 1282
-3  1012 472 1283
-3  1337 797 1284
-3  1288 748 1285
-3  1081 541 1286
-3  1106 566 1287
-3  1285 745 1288
-3  1320 780 1289
-3  2085 1290 557
-3  1014 474 1291
-3  1602 424 2319
-3  2380 756 437
-3  1085 545 1294
-3  1096 556 1295
-3  2391 28 1847
-3  1236 696 1297
-3  1055 515 1298
-3  1016 476 1299
-3  1233 693 1300
-3  1304 764 1301
-3  1089 549 1302
-3  1054 514 1303
-3  1301 761 1304
-3  1312 772 1305
-3  1093 553 1306
-3  1018 478 1307
-3  1173 633 1308
-3  1272 732 1309
-3  1073 533 1310
-3  1092 552 1311
-3  1305 765 1312
-3  1268 728 1313
-3  1071 531 1314
-3  1090 550 1315
-3  1265 725 1316
-3  1204 664 1317
-3  1039 499 1318
-3  1070 530 1319
-3  1289 749 1320
-3  2391 48 28
-3  2391 1892 48
-3  77 65 1099
-3  1181 641 1324
-3  2218 1244 1296
-3  65 2444 1182
-3  2440 77 1099
-3  65 1182 1099
-3  2386 796 326
-3  1105 565 1330
-3  1098 558 1331
-3  1185 645 1332
-3  1348 808 1333
-3  1111 571 1334
-3  1104 564 1335
-3  2443 84 1290
-3  1284 744 1337
-3  1079 539 1338
-3  1102 562 1339
-3  1281 741 1340
-3  1228 688 1341
-3  1051 511 1342
-3  1078 538 1343
-3  1249 709 1344
-3  1180 640 1345
-3  1027 487 1346
-3  1062 522 1347
-3  1333 793 1348
-3  1220 680 1349
-3  1047 507 1350
-3  1026 486 1351
-3  1803 497 1352
-3  2134 663 1353
-3  1811 501 1354
-3  2150 671 1355
-3  1819 505 1356
-3  2166 679 1357
-3  1827 509 1358
-3  2182 687 1359
-3  1795 493 1360
-3  2118 655 1361
-3  1843 517 1362
-3  2214 703 1363
-3  1851 521 1364
-3  2230 711 1365
-3  1859 525 1366
-3  2246 719 1367
-3  1867 529 1368
-3  2262 727 1369
-3  1835 513 1370
-3  2198 695 1371
-3  1883 537 1372
-3  2294 743 1373
-3  1891 541 1374
-3  2310 751 1375
-3  1899 545 1376
-3  2326 759 1377
-3  1907 549 1378
-3  2342 767 1379
-3  1875 533 1380
-3  2278 735 1381
-3  1807 499 1382
-3  2142 667 1383
-3  84 2439 1290
-3  85 1697 86
-3  1951 571 1386
-3  2430 811 1387
-3  1831 511 1388
-3  2190 691 1389
-3  1823 507 1390
-3  2174 683 1391
-3  1731 461 1392
-3  1990 591 1393
-3  1879 535 1394
-3  2286 739 1395
-3  1715 453 1396
-3  1958 575 1397
-3  1775 483 1398
-3  2078 635 1399
-3  1719 455 1400
-3  1966 579 1401
-3  1863 527 1402
-3  2254 723 1403
-3  1723 457 1404
-3  1974 583 1405
-3  1791 491 1406
-3  2110 651 1407
-3  1727 459 1408
-3  1982 587 1409
-3  1787 489 1410
-3  2102 647 1411
-3  1751 471 1412
-3  2030 611 1413
-3  1903 547 1414
-3  2334 763 1415
-3  1735 463 1416
-3  1998 595 1417
-3  86 1697 444
-3  1845 1697 85
-3  1739 465 1420
-3  2006 599 1421
-3  1947 569 1422
-3  2422 807 1423
-3  1743 467 1424
-3  2014 603 1425
-3  1815 503 1426
-3  2158 675 1427
-3  1747 469 1428
-3  2022 607 1429
-3  1919 555 1430
-3  2366 779 1431
-3  1771 481 1432
-3  2070 631 1433
-3  1799 495 1434
-3  2126 659 1435
-3  1755 473 1436
-3  2038 615 1437
-3  1943 567 1438
-3  2414 803 1439
-3  1759 475 1440
-3  2046 619 1441
-3  1331 108 1895
-3  1331 1922 108
-3  1763 477 1444
-3  2054 623 1445
-3  1839 515 1446
-3  2206 699 1447
-3  1767 479 1448
-3  2062 627 1449
-3  1915 553 1450
-3  2358 775 1451
-3  1911 551 1452
-3  2350 771 1453
-3  1871 531 1454
-3  2270 731 1455
-3  137 125 1925
-3  125 1922 1925
-3  1923 137 1925
-3  1922 1331 1925
-3  1182 144 1457
-3  1182 1929 144
-3  1939 565 1462
-3  2406 799 1463
-3  1935 563 1464
-3  2398 795 1465
-3  1887 539 1466
-3  2302 747 1467
-3  1855 523 1468
-3  2238 715 1469
-3  1783 487 1470
-3  2094 643 1471
-3  1967 579 1472
-3  1962 577 1473
-3  1987 589 1474
-3  1730 461 1475
-3  1975 583 1476
-3  1970 581 1477
-3  1955 573 1478
-3  1714 453 1479
-3  1983 587 1480
-3  1978 585 1481
-3  1963 577 1482
-3  1718 455 1483
-3  1991 591 1484
-3  1986 589 1485
-3  1971 581 1486
-3  1722 457 1487
-3  1959 575 1488
-3  1954 573 1489
-3  1979 585 1490
-3  1726 459 1491
-3  2007 599 1492
-3  2002 597 1493
-3  2027 609 1494
-3  1750 471 1495
-3  2015 603 1496
-3  2010 601 1497
-3  1995 593 1498
-3  1734 463 1499
-3  2023 607 1500
-3  2018 605 1501
-3  2003 597 1502
-3  1738 465 1503
-3  2031 611 1504
-3  2026 609 1505
-3  2011 601 1506
-3  1742 467 1507
-3  1999 595 1508
-3  1994 593 1509
-3  2019 605 1510
-3  1746 469 1511
-3  2047 619 1512
-3  2042 617 1513
-3  2067 629 1514
-3  1770 481 1515
-3  2055 623 1516
-3  2050 621 1517
-3  2035 613 1518
-3  1754 473 1519
-3  2063 627 1520
-3  2058 625 1521
-3  2043 617 1522
-3  1758 475 1523
-3  2071 631 1524
-3  2066 629 1525
-3  2051 621 1526
-3  1762 477 1527
-3  2039 615 1528
-3  2034 613 1529
-3  2059 625 1530
-3  1766 479 1531
-3  2135 663 1532
-3  2130 661 1533
-3  2347 769 1534
-3  1910 551 1535
-3  2215 703 1536
-3  2210 701 1537
-3  146 145 1651
-3  145 2382 1651
-3  2423 807 1540
-3  2418 805 1541
-3  1927 146 1651
-3  1543 1458 1099
-3  2183 687 1544
-3  2178 685 1545
-3  2395 793 1546
-3  1934 563 1547
-3  2167 679 1548
-3  2162 677 1549
-3  2235 713 1550
-3  1854 523 1551
-3  2191 691 1552
-3  2186 689 1553
-3  2283 737 1554
-3  1878 535 1555
-3  2279 735 1556
-3  2274 733 1557
-3  2131 661 1558
-3  1802 497 1559
-3  2127 659 1560
-3  2122 657 1561
-3  2075 633 1562
-3  1774 483 1563
-3  2367 779 1564
-3  2362 777 1565
-3  2147 669 1566
-3  1810 501 1567
-3  2143 667 1568
-3  2138 665 1569
-3  2251 721 1570
-3  1862 527 1571
-3  2247 719 1572
-3  2242 717 1573
-3  2163 677 1574
-3  1818 505 1575
-3  2159 675 1576
-3  2154 673 1577
-3  2107 649 1578
-3  1790 491 1579
-3  2431 811 1580
-3  2426 809 1581
-3  2179 685 1582
-3  1826 509 1583
-3  2175 683 1584
-3  2170 681 1585
-3  2099 645 1586
-3  1786 489 1587
-3  2415 803 1588
-3  2410 801 1589
-3  2115 653 1590
-3  1794 493 1591
-3  2271 731 1592
-3  2266 729 1593
-3  2331 761 1594
-3  1902 547 1595
-3  2327 759 1596
-3  2322 757 1597
-3  2211 701 1598
-3  1842 517 1599
-3  2207 699 1600
-3  2202 697 1601
-3  185 1244 218
-3  218 1244 1461
-3  1244 185 2379
-3  1538 242 2217
-3  2227 709 1606
-3  1850 521 1607
-3  242 2315 2217
-3  421 1926 1651
-3  2419 805 1610
-3  1946 569 1611
-3  2111 651 1612
-3  2106 649 1613
-3  2243 717 1614
-3  1858 525 1615
-3  2239 715 1616
-3  2234 713 1617
-3  2155 673 1618
-3  1814 503 1619
-3  2151 671 1620
-3  2146 669 1621
-3  2259 725 1622
-3  1866 529 1623
-3  2255 723 1624
-3  2250 721 1625
-3  2363 777 1626
-3  1918 555 1627
-3  2359 775 1628
-3  2354 773 1629
-3  2195 693 1630
-3  1834 513 1631
-3  2351 771 1632
-3  2346 769 1633
-3  2123 657 1634
-3  1798 495 1635
-3  2119 655 1636
-3  2114 653 1637
-3  2291 741 1638
-3  1882 537 1639
-3  2287 739 1640
-3  2282 737 1641
-3  2411 801 1642
-3  1942 567 1643
-3  2407 799 1644
-3  2402 797 1645
-3  2307 749 1646
-3  1890 541 1647
-3  2303 747 1648
-3  2298 745 1649
-3  257 708 1245
-3  259 708 257
-3  1542 708 259
-3  260 367 2379
-3  2323 757 1654
-3  1898 545 1655
-3  288 2379 1460
-3  2379 288 260
-3  2203 697 1658
-3  1838 515 1659
-3  2199 695 1660
-3  2194 693 1661
-3  2339 765 1662
-3  1906 549 1663
-3  2335 763 1664
-3  2330 761 1665
-3  2355 773 1666
-3  1914 553 1667
-3  2079 635 1668
-3  2074 633 1669
-3  2275 733 1670
-3  1874 533 1671
-3  2343 767 1672
-3  2338 765 1673
-3  2267 729 1674
-3  1870 531 1675
-3  2263 727 1676
-3  2258 725 1677
-3  2139 665 1678
-3  1806 499 1679
-3  2311 751 1680
-3  2306 749 1681
-3  305 788 2381
-3  2385 2381 788
-3  2095 643 1684
-3  2090 641 1685
-3  317 1329 324
-3  324 1329 1697
-3  1697 1844 324
-3  325 796 1329
-3  2403 797 1690
-3  1938 565 1691
-3  2103 647 1692
-3  2098 645 1693
-3  2427 809 1694
-3  1950 571 1695
-3  326 796 325
-3  1329 2314 325
-3  2299 745 1698
-3  1886 539 1699
-3  2295 743 1700
-3  2290 741 1701
-3  2187 689 1702
-3  1830 511 1703
-3  2231 711 1704
-3  2226 709 1705
-3  2091 641 1706
-3  1782 487 1707
-3  2399 795 1708
-3  2394 793 1709
-3  2171 681 1710
-3  1822 507 1711
-3  2133 662 1712
-3  1964 578 1713
-3  1479 335 1714
-3  1396 294 1715
-3  2149 670 1716
-3  1972 582 1717
-3  1483 337 1718
-3  1400 296 1719
-3  2165 678 1720
-3  1980 586 1721
-3  1487 339 1722
-3  1404 298 1723
-3  2181 686 1724
-3  1988 590 1725
-3  1491 341 1726
-3  1408 300 1727
-3  2117 654 1728
-3  1956 574 1729
-3  1475 333 1730
-3  1392 292 1731
-3  2213 702 1732
-3  2004 598 1733
-3  1499 345 1734
-3  1416 304 1735
-3  2229 710 1736
-3  2012 602 1737
-3  1503 347 1738
-3  1420 306 1739
-3  2245 718 1740
-3  2020 606 1741
-3  1507 349 1742
-3  1424 308 1743
-3  2261 726 1744
-3  2028 610 1745
-3  1511 351 1746
-3  1428 310 1747
-3  2197 694 1748
-3  1996 594 1749
-3  1495 343 1750
-3  1412 302 1751
-3  2293 742 1752
-3  2044 618 1753
-3  1519 355 1754
-3  1436 314 1755
-3  2309 750 1756
-3  2052 622 1757
-3  1523 357 1758
-3  1440 316 1759
-3  2325 758 1760
-3  2060 626 1761
-3  1527 359 1762
-3  1444 318 1763
-3  2341 766 1764
-3  2068 630 1765
-3  1531 361 1766
-3  1448 320 1767
-3  2277 734 1768
-3  2036 614 1769
-3  1515 353 1770
-3  1432 312 1771
-3  2141 666 1772
-3  2132 662 1773
-3  1563 377 1774
-3  1398 295 1775
-3  2221 706 1776
-3  2212 702 1777
-3  1689 1603 1688
-3  1543 365 398
-3  2429 810 1780
-3  2420 806 1781
-3  1707 449 1782
-3  1470 331 1783
-3  2189 690 1784
-3  2180 686 1785
-3  1587 389 1786
-3  1410 301 1787
-3  2173 682 1788
-3  2164 678 1789
-3  1579 385 1790
-3  1406 299 1791
-3  1989 590 1792
-3  2188 690 1793
-3  1591 391 1794
-3  1360 276 1795
-3  2285 738 1796
-3  2276 734 1797
-3  1635 413 1798
-3  1434 313 1799
-3  1957 574 1800
-3  2124 658 1801
-3  1559 375 1802
-3  1352 272 1803
-3  2077 634 1804
-3  2364 778 1805
-3  1679 435 1806
-3  1382 287 1807
-3  1965 578 1808
-3  2140 666 1809
-3  1567 379 1810
-3  1354 273 1811
-3  2253 722 1812
-3  2244 718 1813
-3  1619 405 1814
-3  1426 309 1815
-3  1973 582 1816
-3  2156 674 1817
-3  1575 383 1818
-3  1356 274 1819
-3  2109 650 1820
-3  2428 810 1821
-3  1711 451 1822
-3  1390 291 1823
-3  1981 586 1824
-3  2172 682 1825
-3  1583 387 1826
-3  1358 275 1827
-3  2101 646 1828
-3  2412 802 1829
-3  1703 447 1830
-3  1388 290 1831
-3  2029 610 1832
-3  2268 730 1833
-3  1631 411 1834
-3  1370 281 1835
-3  2333 762 1836
-3  2324 758 1837
-3  1659 425 1838
-3  1446 319 1839
-3  1997 594 1840
-3  2204 698 1841
-3  1599 395 1842
-3  1362 277 1843
-3  1543 398 1458
-3  1543 2086 365
-3  1024 2437 2223
-3  422 756 1293
-3  2005 598 1848
-3  2220 706 1849
-3  1607 399 1850
-3  1364 278 1851
-3  2421 806 1852
-3  2108 650 1853
-3  1551 371 1854
-3  1468 330 1855
-3  2013 602 1856
-3  2236 714 1857
-3  1615 403 1858
-3  1366 279 1859
-3  2157 674 1860
-3  2148 670 1861
-3  1571 381 1862
-3  1402 297 1863
-3  2021 606 1864
-3  2252 722 1865
-3  1623 407 1866
-3  1368 280 1867
-3  2365 778 1868
-3  2356 774 1869
-3  1675 433 1870
-3  1454 323 1871
-3  2069 630 1872
-3  2348 770 1873
-3  1671 431 1874
-3  1380 286 1875
-3  2125 658 1876
-3  2116 654 1877
-3  1555 373 1878
-3  1394 293 1879
-3  2037 614 1880
-3  2284 738 1881
-3  1639 415 1882
-3  1372 282 1883
-3  2413 802 1884
-3  2404 798 1885
-3  1699 445 1886
-3  1466 329 1887
-3  2045 618 1888
-3  2300 746 1889
-3  1647 419 1890
-3  1374 283 1891
-3  437 756 422
-3  1293 1650 422
-3  421 439 1926
-3  421 2387 439
-3  2053 622 1896
-3  2316 754 1897
-3  1655 423 1898
-3  1376 284 1899
-3  2205 698 1900
-3  2196 694 1901
-3  1595 393 1902
-3  1414 303 1903
-3  2061 626 1904
-3  2332 762 1905
-3  1663 427 1906
-3  1378 285 1907
-3  2357 774 1908
-3  2076 634 1909
-3  1535 363 1910
-3  1452 322 1911
-3  2349 770 1912
-3  2340 766 1913
-3  1667 429 1914
-3  1450 321 1915
-3  2269 730 1916
-3  2260 726 1917
-3  1627 409 1918
-3  1430 311 1919
-3  2317 754 1920
-3  2308 750 1921
-3  1927 1651 1926
-3  367 440 1459
-3  2389 790 1924
-3  2092 642 1925
-3  2086 1543 1459
-3  367 2084 440
-3  485 1098 518
-3  518 1098 1331
-3  1331 1456 518
-3  1295 519 2450
-3  2405 798 1932
-3  2100 646 1933
-3  1547 369 1934
-3  1464 328 1935
-3  2397 794 1936
-3  2388 790 1937
-3  1691 441 1938
-3  1462 327 1939
-3  2301 746 1940
-3  2292 742 1941
-3  1643 417 1942
-3  1438 315 1943
-3  2237 714 1944
-3  2228 710 1945
-3  1611 401 1946
-3  1422 307 1947
-3  2093 642 1948
-3  2396 794 1949
-3  1695 443 1950
-3  1386 289 1951
-3  1961 576 1952
-3  1984 588 1953
-3  1489 340 1954
-3  1478 335 1955
-3  1729 460 1956
-3  1800 496 1957
-3  1397 294 1958
-3  1488 340 1959
-3  1969 580 1960
-3  1952 572 1961
-3  1473 332 1962
-3  1482 337 1963
-3  1713 452 1964
-3  1808 500 1965
-3  1401 296 1966
-3  1472 332 1967
-3  1977 584 1968
-3  1960 576 1969
-3  1477 334 1970
-3  1486 339 1971
-3  1717 454 1972
-3  1816 504 1973
-3  1405 298 1974
-3  1476 334 1975
-3  1985 588 1976
-3  1968 580 1977
-3  1481 336 1978
-3  1490 341 1979
-3  1721 456 1980
-3  1824 508 1981
-3  1409 300 1982
-3  1480 336 1983
-3  1953 572 1984
-3  1976 584 1985
-3  1485 338 1986
-3  1474 333 1987
-3  1725 458 1988
-3  1792 492 1989
-3  1393 292 1990
-3  1484 338 1991
-3  2001 596 1992
-3  2024 608 1993
-3  1509 350 1994
-3  1498 345 1995
-3  1749 470 1996
-3  1840 516 1997
-3  1417 304 1998
-3  1508 350 1999
-3  2009 600 2000
-3  1992 592 2001
-3  1493 342 2002
-3  1502 347 2003
-3  1733 462 2004
-3  1848 520 2005
-3  1421 306 2006
-3  1492 342 2007
-3  2017 604 2008
-3  2000 596 2009
-3  1497 344 2010
-3  1506 349 2011
-3  1737 464 2012
-3  1856 524 2013
-3  1425 308 2014
-3  1496 344 2015
-3  2025 608 2016
-3  2008 600 2017
-3  1501 346 2018
-3  1510 351 2019
-3  1741 466 2020
-3  1864 528 2021
-3  1429 310 2022
-3  1500 346 2023
-3  1993 592 2024
-3  2016 604 2025
-3  1505 348 2026
-3  1494 343 2027
-3  1745 468 2028
-3  1832 512 2029
-3  1413 302 2030
-3  1504 348 2031
-3  2041 616 2032
-3  2064 628 2033
-3  1529 360 2034
-3  1518 355 2035
-3  1769 480 2036
-3  1880 536 2037
-3  1437 314 2038
-3  1528 360 2039
-3  2049 620 2040
-3  2032 612 2041
-3  1513 352 2042
-3  1522 357 2043
-3  1753 472 2044
-3  1888 540 2045
-3  1441 316 2046
-3  1512 352 2047
-3  2057 624 2048
-3  2040 616 2049
-3  1517 354 2050
-3  1526 359 2051
-3  1757 474 2052
-3  1896 544 2053
-3  1445 318 2054
-3  1516 354 2055
-3  2065 628 2056
-3  2048 620 2057
-3  1521 356 2058
-3  1530 361 2059
-3  1761 476 2060
-3  1904 548 2061
-3  1449 320 2062
-3  1520 356 2063
-3  2033 612 2064
-3  2056 624 2065
-3  1525 358 2066
-3  1514 353 2067
-3  1765 478 2068
-3  1872 532 2069
-3  1433 312 2070
-3  1524 358 2071
-3  2129 660 2072
-3  2344 768 2073
-3  1669 430 2074
-3  1562 377 2075
-3  1909 550 2076
-3  1804 498 2077
-3  1399 295 2078
-3  1668 430 2079
-3  2209 700 2080
-3  2312 752 2081
-3  1295 2448 519
-3  1687 397 1325
-3  542 1777 2438
-3  1242 2438 1777
-3  543 1097 1931
-3  557 1097 543
-3  2417 804 2088
-3  2376 784 2089
-3  1685 438 2090
-3  1706 449 2091
-3  1925 558 2092
-3  1948 570 2093
-3  1471 331 2094
-3  1684 438 2095
-3  2177 684 2096
-3  2392 792 2097
-3  1693 442 2098
-3  1586 389 2099
-3  1933 562 2100
-3  1828 510 2101
-3  1411 301 2102
-3  1692 442 2103
-3  2161 676 2104
-3  2232 712 2105
-3  1613 402 2106
-3  1578 385 2107
-3  1853 522 2108
-3  1820 506 2109
-3  1407 299 2110
-3  1612 402 2111
-3  2185 688 2112
-3  2280 736 2113
-3  1637 414 2114
-3  1590 391 2115
-3  1877 534 2116
-3  1728 460 2117
-3  1361 276 2118
-3  1636 414 2119
-3  2273 732 2120
-3  2128 660 2121
-3  1561 376 2122
-3  1634 413 2123
-3  1801 496 2124
-3  1876 534 2125
-3  1435 313 2126
-3  1560 376 2127
-3  2121 656 2128
-3  2072 632 2129
-3  1533 362 2130
-3  1558 375 2131
-3  1773 482 2132
-3  1712 452 2133
-3  1353 272 2134
-3  1532 362 2135
-3  2361 776 2136
-3  2144 668 2137
-3  1569 380 2138
-3  1678 435 2139
-3  1809 500 2140
-3  1772 482 2141
-3  1383 287 2142
-3  1568 380 2143
-3  2137 664 2144
-3  2248 720 2145
-3  1621 406 2146
-3  1566 379 2147
-3  1861 526 2148
-3  1716 454 2149
-3  1355 273 2150
-3  1620 406 2151
-3  2241 716 2152
-3  2160 676 2153
-3  1577 384 2154
-3  1618 405 2155
-3  1817 504 2156
-3  1860 526 2157
-3  1427 309 2158
-3  1576 384 2159
-3  2153 672 2160
-3  2104 648 2161
-3  1549 370 2162
-3  1574 383 2163
-3  1789 490 2164
-3  1720 456 2165
-3  1357 274 2166
-3  1548 370 2167
-3  2425 808 2168
-3  2176 684 2169
-3  1585 388 2170
-3  1710 451 2171
-3  1825 508 2172
-3  1788 490 2173
-3  1391 291 2174
-3  1584 388 2175
-3  2169 680 2176
-3  2096 644 2177
-3  1545 368 2178
-3  1582 387 2179
-3  1785 488 2180
-3  1724 458 2181
-3  1359 275 2182
-3  1544 368 2183
-3  2409 800 2184
-3  2112 652 2185
-3  1553 372 2186
-3  1702 447 2187
-3  1793 492 2188
-3  1784 488 2189
-3  1389 290 2190
-3  1552 372 2191
-3  2265 728 2192
-3  2328 760 2193
-3  1661 426 2194
-3  1630 411 2195
-3  1901 546 2196
-3  1748 470 2197
-3  1371 281 2198
-3  1660 426 2199
-3  2321 756 2200
-3  2208 700 2201
-3  1601 396 2202
-3  1658 425 2203
-3  1841 516 2204
-3  1900 546 2205
-3  1447 319 2206
-3  1600 396 2207
-3  2201 696 2208
-3  2080 636 2209
-3  1537 364 2210
-3  1598 395 2211
-3  1777 484 2212
-3  1732 462 2213
-3  1363 277 2214
-3  1536 364 2215
-3  2377 784 2216
-3  2224 708 2217
-3  2390 1059 400
-3  1097 557 1290
-3  1849 520 2220
-3  1776 484 2221
-3  2446 559 424
-3  2383 1652 2223
-3  2217 704 2224
-3  2416 804 2225
-3  1705 448 2226
-3  1606 399 2227
-3  1945 568 2228
-3  1736 464 2229
-3  1365 278 2230
-3  1704 448 2231
-3  2105 648 2232
-3  2240 716 2233
-3  1617 404 2234
-3  1550 371 2235
-3  1857 524 2236
-3  1944 568 2237
-3  1469 330 2238
-3  1616 404 2239
-3  2233 712 2240
-3  2152 672 2241
-3  1573 382 2242
-3  1614 403 2243
-3  1813 502 2244
-3  1740 466 2245
-3  1367 279 2246
-3  1572 382 2247
-3  2145 668 2248
-3  2256 724 2249
-3  1625 408 2250
-3  1570 381 2251
-3  1865 528 2252
-3  1812 502 2253
-3  1403 297 2254
-3  1624 408 2255
-3  2249 720 2256
-3  2360 776 2257
-3  1677 434 2258
-3  1622 407 2259
-3  1917 554 2260
-3  1744 468 2261
-3  1369 280 2262
-3  1676 434 2263
-3  2353 772 2264
-3  2192 692 2265
-3  1593 392 2266
-3  1674 433 2267
-3  1833 512 2268
-3  1916 554 2269
-3  1455 323 2270
-3  1592 392 2271
-3  2345 768 2272
-3  2120 656 2273
-3  1557 374 2274
-3  1670 431 2275
-3  1797 494 2276
-3  1768 480 2277
-3  1381 286 2278
-3  1556 374 2279
-3  2113 652 2280
-3  2288 740 2281
-3  1641 416 2282
-3  1554 373 2283
-3  1881 536 2284
-3  1796 494 2285
-3  1395 293 2286
-3  1640 416 2287
-3  2281 736 2288
-3  2408 800 2289
-3  1701 446 2290
-3  1638 415 2291
-3  1941 566 2292
-3  1752 472 2293
-3  1373 282 2294
-3  1700 446 2295
-3  2401 796 2296
-3  2304 748 2297
-3  1649 420 2298
-3  1698 445 2299
-3  1889 540 2300
-3  1940 566 2301
-3  1467 329 2302
-3  1648 420 2303
-3  2297 744 2304
-3  2368 780 2305
-3  1681 436 2306
-3  1646 419 2307
-3  1921 556 2308
-3  1756 474 2309
-3  1375 283 2310
-3  1680 436 2311
-3  2081 636 2312
-3  2320 756 2313
-3  559 560 1657
-3  559 1657 424
-3  1897 544 2316
-3  1920 556 2317
-3  1604 1657 560
-3  2318 1602 2319
-3  2313 752 2320
-3  2200 696 2321
-3  1597 394 2322
-3  1654 423 2323
-3  1837 514 2324
-3  1760 476 2325
-3  1377 284 2326
-3  1596 394 2327
-3  2193 692 2328
-3  2336 764 2329
-3  1665 428 2330
-3  1594 393 2331
-3  1905 548 2332
-3  1836 514 2333
-3  1415 303 2334
-3  1664 428 2335
-3  2329 760 2336
-3  2352 772 2337
-3  1673 432 2338
-3  1662 427 2339
-3  1913 552 2340
-3  1764 478 2341
-3  1379 285 2342
-3  1672 432 2343
-3  2073 632 2344
-3  2272 732 2345
-3  1633 412 2346
-3  1534 363 2347
-3  1873 532 2348
-3  1912 552 2349
-3  1453 322 2350
-3  1632 412 2351
-3  2337 764 2352
-3  2264 728 2353
-3  1629 410 2354
-3  1666 429 2355
-3  1869 530 2356
-3  1908 550 2357
-3  1451 321 2358
-3  1628 410 2359
-3  2257 724 2360
-3  2136 664 2361
-3  1565 378 2362
-3  1626 409 2363
-3  1805 498 2364
-3  1868 530 2365
-3  1431 311 2366
-3  1564 378 2367
-3  2305 748 2368
-3  2384 788 2369
-3  1443 2435 2385
-3  561 1096 637
-3  637 1096 1295
-3  2219 1096 561
-3  2223 638 2383
-3  2223 639 638
-3  2089 640 2376
-3  2216 704 2377
-3  2223 2437 639
-3  2084 367 260
-3  1652 705 400
-3  705 2390 400
-3  2433 707 1777
-3  707 753 1777
-3  2369 780 2384
-3  2400 796 2385
-3  1846 86 444
-3  753 2447 1777
-3  1937 564 2388
-3  1924 558 2389
-3  2447 1247 1777
-3  2452 2391 1847
-3  2097 644 2392
-3  2424 808 2393
-3  1709 450 2394
-3  1546 369 2395
-3  1949 570 2396
-3  1936 564 2397
-3  1465 328 2398
-3  1708 450 2399
-3  2385 788 2400
-3  2296 744 2401
-3  1645 418 2402
-3  1690 441 2403
-3  1885 538 2404
-3  1932 562 2405
-3  1463 327 2406
-3  1644 418 2407
-3  2289 740 2408
-3  2184 688 2409
-3  1589 390 2410
-3  1642 417 2411
-3  1829 510 2412
-3  1884 538 2413
-3  1439 315 2414
-3  1588 390 2415
-3  2225 708 2416
-3  2088 640 2417
-3  1541 366 2418
-3  1610 401 2419
-3  1781 486 2420
-3  1852 522 2421
-3  1423 307 2422
-3  1540 366 2423
-3  2393 792 2424
-3  2168 680 2425
-3  1581 386 2426
-3  1694 443 2427
-3  1821 506 2428
-3  1780 486 2429
-3  1387 289 2430
-3  1580 386 2431
-3  1397 114 812
-3  1803 272 812
-3  1401 116 813
-3  1811 273 813
-3  1405 118 814
-3  1819 274 814
-3  1409 120 815
-3  1827 275 815
-3  1393 112 816
-3  1795 276 816
-3  1417 124 817
-3  1843 277 817
-3  1421 126 818
-3  1851 278 818
-3  1425 128 819
-3  1859 279 819
-3  1429 130 820
-3  1867 280 820
-3  1413 122 821
-3  1835 281 821
-3  1437 134 822
-3  1883 282 822
-3  1441 136 823
-3  1891 283 823
-3  1445 138 824
-3  1899 284 824
-3  1449 140 825
-3  1907 285 825
-3  1433 132 826
-3  1875 286 826
-3  1399 115 827
-3  1807 287 827
-3  2432 755 1921
-3  755 781 1921
-3  1471 151 829
-3  1951 289 829
-3  1411 121 830
-3  1831 290 830
-3  1407 119 831
-3  1823 291 831
-3  1361 96 832
-3  1731 292 832
-3  1435 133 833
-3  1879 293 833
-3  1353 92 834
-3  1715 294 834
-3  1383 107 835
-3  1775 295 835
-3  1355 93 836
-3  1719 296 836
-3  1427 129 837
-3  1863 297 837
-3  1357 94 838
-3  1723 298 838
-3  1391 111 839
-3  1791 299 839
-3  1359 95 840
-3  1727 300 840
-3  1389 110 841
-3  1787 301 841
-3  1371 101 842
-3  1751 302 842
-3  1447 139 843
-3  1903 303 843
-3  1363 97 844
-3  1735 304 844
-3  781 2448 1921
-3  2448 1295 1921
-3  1365 98 846
-3  1739 306 846
-3  1469 150 847
-3  1947 307 847
-3  1367 99 848
-3  1743 308 848
-3  1403 117 849
-3  1815 309 849
-3  1369 100 850
-3  1747 310 850
-3  1455 143 851
-3  1919 311 851
-3  1381 106 852
-3  1771 312 852
-3  1395 113 853
-3  1799 313 853
-3  1373 102 854
-3  1755 314 854
-3  1467 149 855
-3  1943 315 855
-3  1375 103 856
-3  1759 316 856
-3  1247 782 2449
-3  1247 2447 782
-3  1377 104 858
-3  1763 318 858
-3  1415 123 859
-3  1839 319 859
-3  1379 105 860
-3  1767 320 860
-3  1453 142 861
-3  1915 321 861
-3  1451 141 862
-3  1911 322 862
-3  1431 131 863
-3  1871 323 863
-3  2385 783 2381
-3  2385 2435 783
-3  1539 785 2319
-3  785 786 2319
-3  786 2318 2319
-3  787 1024 1247
-3  1465 148 867
-3  1939 327 867
-3  1463 147 868
-3  1935 328 868
-3  1439 135 869
-3  1887 329 869
-3  1423 127 870
-3  1855 330 870
-3  1387 109 871
-3  1783 331 871
-3  1479 155 872
-3  1967 332 872
-3  1489 160 873
-3  1987 333 873
-3  1483 157 874
-3  1975 334 874
-3  1473 152 875
-3  1955 335 875
-3  1487 159 876
-3  1983 336 876
-3  1477 154 877
-3  1963 337 877
-3  1491 161 878
-3  1991 338 878
-3  1481 156 879
-3  1971 339 879
-3  1475 153 880
-3  1959 340 880
-3  1485 158 881
-3  1979 341 881
-3  1499 165 882
-3  2007 342 882
-3  1509 170 883
-3  2027 343 883
-3  1503 167 884
-3  2015 344 884
-3  1493 162 885
-3  1995 345 885
-3  1507 169 886
-3  2023 346 886
-3  1497 164 887
-3  2003 347 887
-3  1511 171 888
-3  2031 348 888
-3  1501 166 889
-3  2011 349 889
-3  1495 163 890
-3  1999 350 890
-3  1505 168 891
-3  2019 351 891
-3  1519 175 892
-3  2047 352 892
-3  1529 180 893
-3  2067 353 893
-3  1523 177 894
-3  2055 354 894
-3  1513 172 895
-3  2035 355 895
-3  1527 179 896
-3  2063 356 896
-3  1517 174 897
-3  2043 357 897
-3  1531 181 898
-3  2071 358 898
-3  1521 176 899
-3  2051 359 899
-3  1515 173 900
-3  2039 360 900
-3  1525 178 901
-3  2059 361 901
-3  1563 197 902
-3  2135 362 902
-3  1669 250 903
-3  2347 363 903
-3  1603 217 904
-3  2215 364 904
-3  789 1024 787
-3  1247 2445 787
-3  1707 269 906
-3  2423 366 906
-3  1685 258 907
-3  2379 367 907
-3  1587 209 908
-3  2183 368 908
-3  1693 262 909
-3  2395 369 909
-3  1579 205 910
-3  2167 370 910
-3  1613 222 911
-3  2235 371 911
-3  1591 211 912
-3  2191 372 912
-3  1637 234 913
-3  2283 373 913
-3  1635 233 914
-3  2279 374 914
-3  1561 196 915
-3  2131 375 915
-3  1559 195 916
-3  2127 376 916
-3  1533 182 917
-3  2075 377 917
-3  1679 255 918
-3  2367 378 918
-3  1569 200 919
-3  2147 379 919
-3  1567 199 920
-3  2143 380 920
-3  1621 226 921
-3  2251 381 921
-3  1619 225 922
-3  2247 382 922
-3  1577 204 923
-3  2163 383 923
-3  1575 203 924
-3  2159 384 924
-3  1549 190 925
-3  2107 385 925
-3  1711 271 926
-3  2431 386 926
-3  1585 208 927
-3  2179 387 927
-3  1583 207 928
-3  2175 388 928
-3  1545 188 929
-3  2099 389 929
-3  1703 267 930
-3  2415 390 930
-3  1553 192 931
-3  2115 391 931
-3  1631 231 932
-3  2271 392 932
-3  1661 246 933
-3  2331 393 933
-3  1659 245 934
-3  2327 394 934
-3  1601 216 935
-3  2211 395 935
-3  1599 215 936
-3  2207 396 936
-3  1537 184 937
-3  2083 397 937
-3  2380 791 756
-3  791 2375 756
-3  1609 220 939
-3  2227 399 939
-3  1607 219 940
-3  2223 400 940
-3  1705 268 941
-3  2419 401 941
-3  1551 191 942
-3  2111 402 942
-3  1617 224 943
-3  2243 403 943
-3  1615 223 944
-3  2239 404 944
-3  1573 202 945
-3  2155 405 945
-3  1571 201 946
-3  2151 406 946
-3  1625 228 947
-3  2259 407 947
-3  1623 227 948
-3  2255 408 948
-3  1677 254 949
-3  2363 409 949
-3  1675 253 950
-3  2359 410 950
-3  1593 212 951
-3  2195 411 951
-3  1671 251 952
-3  2351 412 952
-3  1557 194 953
-3  2123 413 953
-3  1555 193 954
-3  2119 414 954
-3  1641 236 955
-3  2291 415 955
-3  1639 235 956
-3  2287 416 956
-3  1701 266 957
-3  2411 417 957
-3  1699 265 958
-3  2407 418 958
-3  1649 240 959
-3  2307 419 959
-3  1647 239 960
-3  2303 420 960
-3  1681 256 961
-3  2371 421 961
-3  2375 2313 756
-3  1928 828 1292
-3  1657 244 963
-3  2323 423 963
-3  1655 243 964
-3  2319 424 964
-3  1597 214 965
-3  2203 425 965
-3  1595 213 966
-3  2199 426 966
-3  1665 248 967
-3  2339 427 967
-3  1663 247 968
-3  2335 428 968
-3  1673 252 969
-3  2355 429 969
-3  1535 183 970
-3  2079 430 970
-3  1633 232 971
-3  2275 431 971
-3  1667 249 972
-3  2343 432 972
-3  1629 230 973
-3  2267 433 973
-3  1627 229 974
-3  2263 434 974
-3  1565 198 975
-3  2139 435 975
-3  1651 241 976
-3  2311 436 976
-3  828 845 1292
-3  845 1682 2083
-3  1543 187 978
-3  2095 438 978
-3  845 2083 1292
-3  857 1328 1894
-3  864 1328 857
-3  1328 864 2371
-3  1697 264 981
-3  2403 441 981
-3  1547 189 982
-3  2103 442 982
-3  1709 270 983
-3  2427 443 983
-3  1691 261 984
-3  2391 444 984
-3  1645 238 985
-3  2299 445 985
-3  1643 237 986
-3  2295 446 986
-3  1589 210 987
-3  2187 447 987
-3  1611 221 988
-3  2231 448 988
-3  1541 186 989
-3  2091 449 989
-3  1695 263 990
-3  2399 450 990
-3  1581 206 991
-3  2171 451 991
-3  2135 197 992
-3  2133 452 992
-3  1965 155 993
-3  1479 453 993
-3  2151 201 994
-3  2149 454 994
-3  1973 157 995
-3  1483 455 995
-3  2167 205 996
-3  2165 456 996
-3  1981 159 997
-3  1487 457 997
-3  2183 209 998
-3  2181 458 998
-3  1989 161 999
-3  1491 459 999
-3  2119 193 1000
-3  2117 460 1000
-3  1957 153 1001
-3  1475 461 1001
-3  2215 217 1002
-3  2213 462 1002
-3  2005 165 1003
-3  1499 463 1003
-3  2231 221 1004
-3  2229 464 1004
-3  2013 167 1005
-3  1503 465 1005
-3  2247 225 1006
-3  2245 466 1006
-3  2021 169 1007
-3  1507 467 1007
-3  2263 229 1008
-3  2261 468 1008
-3  2029 171 1009
-3  1511 469 1009
-3  2199 213 1010
-3  2197 470 1010
-3  1997 163 1011
-3  1495 471 1011
-3  2295 237 1012
-3  2293 472 1012
-3  2045 175 1013
-3  1519 473 1013
-3  2311 241 1014
-3  2309 474 1014
-3  2053 177 1015
-3  1523 475 1015
-3  2327 245 1016
-3  2325 476 1016
-3  2061 179 1017
-3  1527 477 1017
-3  2343 249 1018
-3  2341 478 1018
-3  2069 181 1019
-3  1531 479 1019
-3  2279 233 1020
-3  2277 480 1020
-3  2037 173 1021
-3  1515 481 1021
-3  2143 199 1022
-3  2141 482 1022
-3  2133 197 1023
-3  1563 483 1023
-3  2223 219 1024
-3  2221 484 1024
-3  2213 217 1025
-3  1778 1025 1696
-3  2431 271 1026
-3  2429 486 1026
-3  2421 269 1027
-3  1707 487 1027
-3  2191 211 1028
-3  2189 488 1028
-3  2181 209 1029
-3  1587 489 1029
-3  2175 207 1030
-3  2173 490 1030
-3  2165 205 1031
-3  1579 491 1031
-3  1991 161 1032
-3  1989 492 1032
-3  2189 211 1033
-3  1591 493 1033
-3  2287 235 1034
-3  2285 494 1034
-3  2277 233 1035
-3  1635 495 1035
-3  1959 153 1036
-3  1957 496 1036
-3  2125 195 1037
-3  1559 497 1037
-3  2079 183 1038
-3  2077 498 1038
-3  2365 255 1039
-3  1679 499 1039
-3  1967 155 1040
-3  1965 500 1040
-3  2141 199 1041
-3  1567 501 1041
-3  2255 227 1042
-3  2253 502 1042
-3  2245 225 1043
-3  1619 503 1043
-3  1975 157 1044
-3  1973 504 1044
-3  2157 203 1045
-3  1575 505 1045
-3  2111 191 1046
-3  2109 506 1046
-3  2429 271 1047
-3  1711 507 1047
-3  1983 159 1048
-3  1981 508 1048
-3  2173 207 1049
-3  1583 509 1049
-3  2103 189 1050
-3  2101 510 1050
-3  2413 267 1051
-3  1703 511 1051
-3  2031 171 1052
-3  2029 512 1052
-3  2269 231 1053
-3  1631 513 1053
-3  2335 247 1054
-3  2333 514 1054
-3  2325 245 1055
-3  1659 515 1055
-3  1999 163 1056
-3  1997 516 1056
-3  2205 215 1057
-3  1599 517 1057
-3  2085 2443 1290
-3  1602 865 424
-3  865 2446 424
-3  905 866 752
-3  2007 165 1060
-3  2005 520 1060
-3  2221 219 1061
-3  1607 521 1061
-3  2423 269 1062
-3  2421 522 1062
-3  2109 191 1063
-3  1551 523 1063
-3  2015 167 1064
-3  2013 524 1064
-3  2237 223 1065
-3  1615 525 1065
-3  2159 203 1066
-3  2157 526 1066
-3  2149 201 1067
-3  1571 527 1067
-3  2023 169 1068
-3  2021 528 1068
-3  2253 227 1069
-3  1623 529 1069
-3  2367 255 1070
-3  2365 530 1070
-3  2357 253 1071
-3  1675 531 1071
-3  2071 181 1072
-3  2069 532 1072
-3  2349 251 1073
-3  1671 533 1073
-3  2127 195 1074
-3  2125 534 1074
-3  2117 193 1075
-3  1555 535 1075
-3  2039 173 1076
-3  2037 536 1076
-3  2285 235 1077
-3  1639 537 1077
-3  2415 267 1078
-3  2413 538 1078
-3  2405 265 1079
-3  1699 539 1079
-3  2047 175 1080
-3  2045 540 1080
-3  2301 239 1081
-3  1647 541 1081
-3  866 2453 1292
-3  2451 905 752
-3  866 1292 752
-3  2386 938 796
-3  2055 177 1084
-3  2053 544 1084
-3  2317 243 1085
-3  1655 545 1085
-3  2207 215 1086
-3  2205 546 1086
-3  2197 213 1087
-3  1595 547 1087
-3  2063 179 1088
-3  2061 548 1088
-3  2333 247 1089
-3  1663 549 1089
-3  2359 253 1090
-3  2357 550 1090
-3  2077 183 1091
-3  1535 551 1091
-3  2351 251 1092
-3  2349 552 1092
-3  2341 249 1093
-3  1667 553 1093
-3  2271 231 1094
-3  2269 554 1094
-3  2261 229 1095
-3  1627 555 1095
-3  2319 243 1096
-3  2317 556 1096
-3  2309 241 1097
-3  2382 1097 1651
-3  2391 261 1098
-3  2389 558 1098
-3  2093 187 1099
-3  2440 1099 1458
-3  938 1443 796
-3  1443 2385 796
-3  977 962 788
-3  962 1779 1328
-3  2407 265 1102
-3  2405 562 1102
-3  2101 189 1103
-3  1547 563 1103
-3  2399 263 1104
-3  2397 564 1104
-3  2389 261 1105
-3  1691 565 1105
-3  2303 239 1106
-3  2301 566 1106
-3  2293 237 1107
-3  1643 567 1107
-3  2239 223 1108
-3  2237 568 1108
-3  2229 221 1109
-3  1611 569 1109
-3  2095 187 1110
-3  2093 570 1110
-3  2397 263 1111
-3  1695 571 1111
-3  1963 154 1112
-3  1961 572 1112
-3  1985 160 1113
-3  1489 573 1113
-3  1731 96 1114
-3  1729 574 1114
-3  1801 114 1115
-3  1397 575 1115
-3  1971 156 1116
-3  1969 576 1116
-3  1953 152 1117
-3  1473 577 1117
-3  1715 92 1118
-3  1713 578 1118
-3  1809 116 1119
-3  1401 579 1119
-3  1979 158 1120
-3  1977 580 1120
-3  1961 154 1121
-3  1477 581 1121
-3  1719 93 1122
-3  1717 582 1122
-3  1817 118 1123
-3  1405 583 1123
-3  1987 160 1124
-3  1985 584 1124
-3  1969 156 1125
-3  1481 585 1125
-3  1723 94 1126
-3  1721 586 1126
-3  1825 120 1127
-3  1409 587 1127
-3  1955 152 1128
-3  1953 588 1128
-3  1977 158 1129
-3  1485 589 1129
-3  1727 95 1130
-3  1725 590 1130
-3  1793 112 1131
-3  1393 591 1131
-3  2003 164 1132
-3  2001 592 1132
-3  2025 170 1133
-3  1509 593 1133
-3  1751 101 1134
-3  1749 594 1134
-3  1841 124 1135
-3  1417 595 1135
-3  2011 166 1136
-3  2009 596 1136
-3  1993 162 1137
-3  1493 597 1137
-3  1735 97 1138
-3  1733 598 1138
-3  1849 126 1139
-3  1421 599 1139
-3  2019 168 1140
-3  2017 600 1140
-3  2001 164 1141
-3  1497 601 1141
-3  1739 98 1142
-3  1737 602 1142
-3  1857 128 1143
-3  1425 603 1143
-3  2027 170 1144
-3  2025 604 1144
-3  2009 166 1145
-3  1501 605 1145
-3  1743 99 1146
-3  1741 606 1146
-3  1865 130 1147
-3  1429 607 1147
-3  1995 162 1148
-3  1993 608 1148
-3  2017 168 1149
-3  1505 609 1149
-3  1747 100 1150
-3  1745 610 1150
-3  1833 122 1151
-3  1413 611 1151
-3  2043 174 1152
-3  2041 612 1152
-3  2065 180 1153
-3  1529 613 1153
-3  1771 106 1154
-3  1769 614 1154
-3  1881 134 1155
-3  1437 615 1155
-3  2051 176 1156
-3  2049 616 1156
-3  2033 172 1157
-3  1513 617 1157
-3  1755 102 1158
-3  1753 618 1158
-3  1889 136 1159
-3  1441 619 1159
-3  2059 178 1160
-3  2057 620 1160
-3  2041 174 1161
-3  1517 621 1161
-3  1759 103 1162
-3  1757 622 1162
-3  1897 138 1163
-3  1445 623 1163
-3  2067 180 1164
-3  2065 624 1164
-3  2049 176 1165
-3  1521 625 1165
-3  1763 104 1166
-3  1761 626 1166
-3  1905 140 1167
-3  1449 627 1167
-3  2035 172 1168
-3  2033 628 1168
-3  2057 178 1169
-3  1525 629 1169
-3  1767 105 1170
-3  1765 630 1170
-3  1873 132 1171
-3  1433 631 1171
-3  2131 196 1172
-3  2129 632 1172
-3  2345 250 1173
-3  1669 633 1173
-3  1911 141 1174
-3  1909 634 1174
-3  1805 115 1175
-3  1399 635 1175
-3  2211 216 1176
-3  2209 636 1176
-3  2434 977 788
-3  962 1328 788
-3  979 708 1542
-3  708 2373 2217
-3  444 980 1846
-3  444 2452 980
-3  2419 268 1180
-3  2417 640 1180
-3  2377 258 1181
-3  1685 641 1181
-3  1058 1609 1059
-3  1925 642 1182
-3  1949 151 1183
-3  1471 643 1183
-3  2179 208 1184
-3  2177 644 1184
-3  2393 262 1185
-3  1693 645 1185
-3  1935 147 1186
-3  1933 646 1186
-3  1829 121 1187
-3  1411 647 1187
-3  2163 204 1188
-3  2161 648 1188
-3  2233 222 1189
-3  1613 649 1189
-3  1855 127 1190
-3  1853 650 1190
-3  1821 119 1191
-3  1407 651 1191
-3  2187 210 1192
-3  2185 652 1192
-3  2281 234 1193
-3  1637 653 1193
-3  1879 133 1194
-3  1877 654 1194
-3  1729 96 1195
-3  1361 655 1195
-3  2275 232 1196
-3  2273 656 1196
-3  2129 196 1197
-3  1561 657 1197
-3  1803 114 1198
-3  1801 658 1198
-3  1877 133 1199
-3  1435 659 1199
-3  2123 194 1200
-3  2121 660 1200
-3  2073 182 1201
-3  1533 661 1201
-3  1775 107 1202
-3  1773 662 1202
-3  1713 92 1203
-3  1353 663 1203
-3  2363 254 1204
-3  2361 664 1204
-3  2145 200 1205
-3  1569 665 1205
-3  1811 116 1206
-3  1809 666 1206
-3  1773 107 1207
-3  1383 667 1207
-3  2139 198 1208
-3  2137 668 1208
-3  2249 226 1209
-3  1621 669 1209
-3  1863 129 1210
-3  1861 670 1210
-3  1717 93 1211
-3  1355 671 1211
-3  2243 224 1212
-3  2241 672 1212
-3  2161 204 1213
-3  1577 673 1213
-3  1819 118 1214
-3  1817 674 1214
-3  1861 129 1215
-3  1427 675 1215
-3  2155 202 1216
-3  2153 676 1216
-3  2105 190 1217
-3  1549 677 1217
-3  1791 111 1218
-3  1789 678 1218
-3  1721 94 1219
-3  1357 679 1219
-3  2427 270 1220
-3  2425 680 1220
-3  2177 208 1221
-3  1585 681 1221
-3  1827 120 1222
-3  1825 682 1222
-3  1789 111 1223
-3  1391 683 1223
-3  2171 206 1224
-3  2169 684 1224
-3  2097 188 1225
-3  1545 685 1225
-3  1787 110 1226
-3  1785 686 1226
-3  1725 95 1227
-3  1359 687 1227
-3  2411 266 1228
-3  2409 688 1228
-3  2113 192 1229
-3  1553 689 1229
-3  1795 112 1230
-3  1793 690 1230
-3  1785 110 1231
-3  1389 691 1231
-3  2267 230 1232
-3  2265 692 1232
-3  2329 246 1233
-3  1661 693 1233
-3  1903 139 1234
-3  1901 694 1234
-3  1749 101 1235
-3  1371 695 1235
-3  2323 244 1236
-3  2321 696 1236
-3  2209 216 1237
-3  1601 697 1237
-3  1843 124 1238
-3  1841 698 1238
-3  1901 139 1239
-3  1447 699 1239
-3  2203 214 1240
-3  2201 700 1240
-3  2081 184 1241
-3  1537 701 1241
-3  1059 1609 400
-3  1777 702 1242
-3  1733 97 1243
-3  1363 703 1243
-3  2379 258 1244
-3  2377 704 1244
-3  2225 220 1245
-3  2378 1326 1609
-3  1851 126 1246
-3  1849 706 1246
-3  1605 1609 1058
-3  1082 1921 2439
-3  1290 2439 1921
-3  2373 708 979
-3  2417 268 1249
-3  1705 709 1249
-3  1947 150 1250
-3  1945 710 1250
-3  1737 98 1251
-3  1365 711 1251
-3  2107 190 1252
-3  2105 712 1252
-3  2241 224 1253
-3  1617 713 1253
-3  1859 128 1254
-3  1857 714 1254
-3  1945 150 1255
-3  1469 715 1255
-3  2235 222 1256
-3  2233 716 1256
-3  2153 202 1257
-3  1573 717 1257
-3  1815 117 1258
-3  1813 718 1258
-3  1741 99 1259
-3  1367 719 1259
-3  2147 200 1260
-3  2145 720 1260
-3  2257 228 1261
-3  1625 721 1261
-3  1867 130 1262
-3  1865 722 1262
-3  1813 117 1263
-3  1403 723 1263
-3  2251 226 1264
-3  2249 724 1264
-3  2361 254 1265
-3  1677 725 1265
-3  1919 143 1266
-3  1917 726 1266
-3  1745 100 1267
-3  1369 727 1267
-3  2355 252 1268
-3  2353 728 1268
-3  2193 212 1269
-3  1593 729 1269
-3  1835 122 1270
-3  1833 730 1270
-3  1917 143 1271
-3  1455 731 1271
-3  2347 250 1272
-3  2345 732 1272
-3  2121 194 1273
-3  1557 733 1273
-3  1799 113 1274
-3  1797 734 1274
-3  1769 106 1275
-3  1381 735 1275
-3  2115 192 1276
-3  2113 736 1276
-3  2289 236 1277
-3  1641 737 1277
-3  1883 134 1278
-3  1881 738 1278
-3  1797 113 1279
-3  1395 739 1279
-3  2283 234 1280
-3  2281 740 1280
-3  2409 266 1281
-3  1701 741 1281
-3  1943 149 1282
-3  1941 742 1282
-3  1753 102 1283
-3  1373 743 1283
-3  2403 264 1284
-3  2401 744 1284
-3  2305 240 1285
-3  1649 745 1285
-3  1891 136 1286
-3  1889 746 1286
-3  1941 149 1287
-3  1467 747 1287
-3  2299 238 1288
-3  2297 748 1288
-3  2369 256 1289
-3  1681 749 1289
-3  1778 1083 1025
-3  1921 750 1290
-3  1757 103 1291
-3  1375 751 1291
-3  2083 184 1292
-3  2081 752 1292
-3  2321 244 1293
-3  2372 1419 1657
-3  1899 138 1294
-3  1897 754 1294
-3  1083 1100 1025
-3  1100 1686 1242
-3  1100 1242 1025
-3  2313 1101 1653
-3  2201 214 1297
-3  1597 757 1297
-3  1839 123 1298
-3  1837 758 1298
-3  1761 104 1299
-3  1377 759 1299
-3  2195 212 1300
-3  2193 760 1300
-3  2337 248 1301
-3  1665 761 1301
-3  1907 140 1302
-3  1905 762 1302
-3  1837 123 1303
-3  1415 763 1303
-3  2331 246 1304
-3  2329 764 1304
-3  2353 252 1305
-3  1673 765 1305
-3  1915 142 1306
-3  1913 766 1306
-3  1765 105 1307
-3  1379 767 1307
-3  2075 182 1308
-3  2073 768 1308
-3  2273 232 1309
-3  1633 769 1309
-3  1875 132 1310
-3  1873 770 1310
-3  1913 142 1311
-3  1453 771 1311
-3  2339 248 1312
-3  2337 772 1312
-3  2265 230 1313
-3  1629 773 1313
-3  1871 131 1314
-3  1869 774 1314
-3  1909 141 1315
-3  1451 775 1315
-3  2259 228 1316
-3  2257 776 1316
-3  2137 198 1317
-3  1565 777 1317
-3  1807 115 1318
-3  1805 778 1318
-3  1869 131 1319
-3  1431 779 1319
-3  2307 240 1320
-3  2305 780 1320
-3  1039 778 2365
-3  1177 1925 1457
-3  1182 1457 1925
-3  1930 2436 2371
-3  2442 1178 1242
-3  1178 2438 1242
-3  2091 186 1324
-3  2089 784 1324
-3  1244 2218 1461
-3  1687 1179 397
-3  1179 1688 397
-3  1248 704 2087
-3  1296 704 1248
-3  704 1296 1244
-3  2371 256 1328
-3  2369 788 1328
-3  2401 264 1329
-3  2082 1329 317
-3  1939 148 1330
-3  1937 790 1330
-3  1321 704 2315
-3  2087 704 1321
-3  2099 188 1332
-3  2097 792 1332
-3  2425 270 1333
-3  1709 793 1333
-3  1951 151 1334
-3  1949 794 1334
-3  1937 148 1335
-3  1465 795 1335
-3  1322 752 1653
-3  2313 1653 752
-3  2297 238 1337
-3  1645 797 1337
-3  1887 135 1338
-3  1885 798 1338
-3  1933 147 1339
-3  1463 799 1339
-3  2291 236 1340
-3  2289 800 1340
-3  2185 210 1341
-3  1589 801 1341
-3  1831 121 1342
-3  1829 802 1342
-3  1885 135 1343
-3  1439 803 1343
-3  2227 220 1344
-3  2225 804 1344
-3  2089 186 1345
-3  1541 805 1345
-3  1783 109 1346
-3  1781 806 1346
-3  1853 127 1347
-3  1423 807 1347
-3  2395 262 1348
-3  2393 808 1348
-3  2169 206 1349
-3  1581 809 1349
-3  1823 119 1350
-3  1821 810 1350
-3  1781 109 1351
-3  1387 811 1351
-3  1802 54 1352
-3  2134 272 1352
-3  1203 92 1353
-3  834 272 1353
-3  1810 56 1354
-3  2150 273 1354
-3  1211 93 1355
-3  836 273 1355
-3  1818 58 1356
-3  2166 274 1356
-3  1219 94 1357
-3  838 274 1357
-3  1826 60 1358
-3  2182 275 1358
-3  1227 95 1359
-3  840 275 1359
-3  1794 52 1360
-3  2118 276 1360
-3  1195 96 1361
-3  832 276 1361
-3  1842 64 1362
-3  2214 277 1362
-3  1243 97 1363
-3  844 277 1363
-3  1850 66 1364
-3  2230 278 1364
-3  1251 98 1365
-3  846 278 1365
-3  1858 68 1366
-3  2246 279 1366
-3  1259 99 1367
-3  848 279 1367
-3  1866 70 1368
-3  2262 280 1368
-3  1267 100 1369
-3  850 280 1369
-3  1834 62 1370
-3  2198 281 1370
-3  1235 101 1371
-3  842 281 1371
-3  1882 74 1372
-3  2294 282 1372
-3  1283 102 1373
-3  854 282 1373
-3  1890 76 1374
-3  2310 283 1374
-3  1291 103 1375
-3  856 283 1375
-3  1898 78 1376
-3  2326 284 1376
-3  1299 104 1377
-3  858 284 1377
-3  1906 80 1378
-3  2342 285 1378
-3  1307 105 1379
-3  860 285 1379
-3  1874 72 1380
-3  2278 286 1380
-3  1275 106 1381
-3  852 286 1381
-3  1806 55 1382
-3  2142 287 1382
-3  1207 107 1383
-3  835 287 1383
-3  1323 2083 1683
-3  1325 2083 1323
-3  2083 1325 397
-3  1326 1245 1609
-3  1950 91 1386
-3  2430 289 1386
-3  1351 109 1387
-3  871 289 1387
-3  1830 61 1388
-3  2190 290 1388
-3  1231 110 1389
-3  841 290 1389
-3  1822 59 1390
-3  2174 291 1390
-3  1223 111 1391
-3  839 291 1391
-3  1730 36 1392
-3  1990 292 1392
-3  1131 112 1393
-3  816 292 1393
-3  1878 73 1394
-3  2286 293 1394
-3  1279 113 1395
-3  853 293 1395
-3  1714 32 1396
-3  1958 294 1396
-3  1115 114 1397
-3  812 294 1397
-3  1774 47 1398
-3  2078 295 1398
-3  1175 115 1399
-3  827 295 1399
-3  1718 33 1400
-3  1966 296 1400
-3  1119 116 1401
-3  813 296 1401
-3  1862 69 1402
-3  2254 297 1402
-3  1263 117 1403
-3  849 297 1403
-3  1722 34 1404
-3  1974 298 1404
-3  1123 118 1405
-3  814 298 1405
-3  1790 51 1406
-3  2110 299 1406
-3  1191 119 1407
-3  831 299 1407
-3  1726 35 1408
-3  1982 300 1408
-3  1127 120 1409
-3  815 300 1409
-3  1786 50 1410
-3  2102 301 1410
-3  1187 121 1411
-3  830 301 1411
-3  1750 41 1412
-3  2030 302 1412
-3  1151 122 1413
-3  821 302 1413
-3  1902 79 1414
-3  2334 303 1414
-3  1303 123 1415
-3  859 303 1415
-3  1734 37 1416
-3  1998 304 1416
-3  1135 124 1417
-3  817 304 1417
-3  1327 1245 1326
-3  2374 1245 1327
-3  1384 1336 1603
-3  1336 1696 1603
-3  1738 38 1420
-3  2006 306 1420
-3  1139 126 1421
-3  818 306 1421
-3  1946 90 1422
-3  2422 307 1422
-3  1347 127 1423
-3  870 307 1423
-3  1742 39 1424
-3  2014 308 1424
-3  1143 128 1425
-3  819 308 1425
-3  1814 57 1426
-3  2158 309 1426
-3  1215 129 1427
-3  837 309 1427
-3  1746 40 1428
-3  2022 310 1428
-3  1147 130 1429
-3  820 310 1429
-3  1918 83 1430
-3  2366 311 1430
-3  1319 131 1431
-3  863 311 1431
-3  1770 46 1432
-3  2070 312 1432
-3  1171 132 1433
-3  826 312 1433
-3  1798 53 1434
-3  2126 313 1434
-3  1199 133 1435
-3  833 313 1435
-3  1754 42 1436
-3  2038 314 1436
-3  1155 134 1437
-3  822 314 1437
-3  1942 89 1438
-3  2414 315 1438
-3  1343 135 1439
-3  869 315 1439
-3  1758 43 1440
-3  2046 316 1440
-3  1159 136 1441
-3  823 316 1441
-3  1689 1384 1603
-3  2371 1385 421
-3  1385 2387 421
-3  2436 1418 2371
-3  1762 44 1444
-3  2054 318 1444
-3  1163 138 1445
-3  824 318 1445
-3  1838 63 1446
-3  2206 319 1446
-3  1239 139 1447
-3  843 319 1447
-3  1766 45 1448
-3  2062 320 1448
-3  1167 140 1449
-3  825 320 1449
-3  1914 82 1450
-3  2358 321 1450
-3  1315 141 1451
-3  862 321 1451
-3  1910 81 1452
-3  2350 322 1452
-3  1311 142 1453
-3  861 322 1453
-3  1870 71 1454
-3  2270 323 1454
-3  1271 143 1455
-3  851 323 1455
-3  1418 1385 2371
-3  1419 1293 1657
-3  1442 1293 1419
-3  1608 1293 1442
-3  1026 811 2431
-3  926 271 2431
-3  1580 811 2430
-3  1386 91 2430
-3  1047 810 2429
-3  1026 271 2429
-3  1780 810 2428
-3  1820 31 2428
-3  1938 88 1462
-3  2406 327 1462
-3  1339 147 1463
-3  868 327 1463
-3  1934 87 1464
-3  2398 328 1464
-3  1335 148 1465
-3  867 328 1465
-3  1886 75 1466
-3  2302 329 1466
-3  1287 149 1467
-3  855 329 1467
-3  1854 67 1468
-3  2238 330 1468
-3  1255 150 1469
-3  847 330 1469
-3  1782 49 1470
-3  2094 331 1470
-3  1183 151 1471
-3  829 331 1471
-3  1966 33 1472
-3  1962 332 1472
-3  1117 152 1473
-3  875 332 1473
-3  1986 36 1474
-3  1730 333 1474
-3  1001 153 1475
-3  880 333 1475
-3  1974 34 1476
-3  1970 334 1476
-3  1121 154 1477
-3  877 334 1477
-3  1954 32 1478
-3  1714 335 1478
-3  993 155 1479
-3  872 335 1479
-3  1982 35 1480
-3  1978 336 1480
-3  1125 156 1481
-3  879 336 1481
-3  1962 33 1482
-3  1718 337 1482
-3  995 157 1483
-3  874 337 1483
-3  1990 36 1484
-3  1986 338 1484
-3  1129 158 1485
-3  881 338 1485
-3  1970 34 1486
-3  1722 339 1486
-3  997 159 1487
-3  876 339 1487
-3  1958 32 1488
-3  1954 340 1488
-3  1113 160 1489
-3  873 340 1489
-3  1978 35 1490
-3  1726 341 1490
-3  999 161 1491
-3  878 341 1491
-3  2006 38 1492
-3  2002 342 1492
-3  1137 162 1493
-3  885 342 1493
-3  2026 41 1494
-3  1750 343 1494
-3  1011 163 1495
-3  890 343 1495
-3  2014 39 1496
-3  2010 344 1496
-3  1141 164 1497
-3  887 344 1497
-3  1994 37 1498
-3  1734 345 1498
-3  1003 165 1499
-3  882 345 1499
-3  2022 40 1500
-3  2018 346 1500
-3  1145 166 1501
-3  889 346 1501
-3  2002 38 1502
-3  1738 347 1502
-3  1005 167 1503
-3  884 347 1503
-3  2030 41 1504
-3  2026 348 1504
-3  1149 168 1505
-3  891 348 1505
-3  2010 39 1506
-3  1742 349 1506
-3  1007 169 1507
-3  886 349 1507
-3  1998 37 1508
-3  1994 350 1508
-3  1133 170 1509
-3  883 350 1509
-3  2018 40 1510
-3  1746 351 1510
-3  1009 171 1511
-3  888 351 1511
-3  2046 43 1512
-3  2042 352 1512
-3  1157 172 1513
-3  895 352 1513
-3  2066 46 1514
-3  1770 353 1514
-3  1021 173 1515
-3  900 353 1515
-3  2054 44 1516
-3  2050 354 1516
-3  1161 174 1517
-3  897 354 1517
-3  2034 42 1518
-3  1754 355 1518
-3  1013 175 1519
-3  892 355 1519
-3  2062 45 1520
-3  2058 356 1520
-3  1165 176 1521
-3  899 356 1521
-3  2042 43 1522
-3  1758 357 1522
-3  1015 177 1523
-3  894 357 1523
-3  2070 46 1524
-3  2066 358 1524
-3  1169 178 1525
-3  901 358 1525
-3  2050 44 1526
-3  1762 359 1526
-3  1017 179 1527
-3  896 359 1527
-3  2038 42 1528
-3  2034 360 1528
-3  1153 180 1529
-3  893 360 1529
-3  2058 45 1530
-3  1766 361 1530
-3  1019 181 1531
-3  898 361 1531
-3  2134 54 1532
-3  2130 362 1532
-3  1201 182 1533
-3  917 362 1533
-3  2346 81 1534
-3  1910 363 1534
-3  1091 183 1535
-3  970 363 1535
-3  2214 64 1536
-3  2210 364 1536
-3  1241 184 1537
-3  937 364 1537
-3  1220 809 2427
-3  983 270 2427
-3  1694 809 2426
-3  1580 91 2426
-3  2422 90 1540
-3  2418 366 1540
-3  1345 186 1541
-3  989 366 1541
-3  1333 808 2425
-3  1220 270 2425
-3  1099 187 1543
-3  978 367 1543
-3  2182 60 1544
-3  2178 368 1544
-3  1225 188 1545
-3  929 368 1545
-3  2394 87 1546
-3  1934 369 1546
-3  1103 189 1547
-3  982 369 1547
-3  2166 58 1548
-3  2162 370 1548
-3  1217 190 1549
-3  925 370 1549
-3  2234 67 1550
-3  1854 371 1550
-3  1063 191 1551
-3  942 371 1551
-3  2190 61 1552
-3  2186 372 1552
-3  1229 192 1553
-3  931 372 1553
-3  2282 73 1554
-3  1878 373 1554
-3  1075 193 1555
-3  954 373 1555
-3  2278 72 1556
-3  2274 374 1556
-3  1273 194 1557
-3  953 374 1557
-3  2130 54 1558
-3  1802 375 1558
-3  1037 195 1559
-3  916 375 1559
-3  2126 53 1560
-3  2122 376 1560
-3  1197 196 1561
-3  915 376 1561
-3  2074 47 1562
-3  1774 377 1562
-3  1023 197 1563
-3  902 377 1563
-3  2366 83 1564
-3  2362 378 1564
-3  1317 198 1565
-3  975 378 1565
-3  2146 56 1566
-3  1810 379 1566
-3  1041 199 1567
-3  920 379 1567
-3  2142 55 1568
-3  2138 380 1568
-3  1205 200 1569
-3  919 380 1569
-3  2250 69 1570
-3  1862 381 1570
-3  1067 201 1571
-3  946 381 1571
-3  2246 68 1572
-3  2242 382 1572
-3  1257 202 1573
-3  945 382 1573
-3  2162 58 1574
-3  1818 383 1574
-3  1045 203 1575
-3  924 383 1575
-3  2158 57 1576
-3  2154 384 1576
-3  1213 204 1577
-3  923 384 1577
-3  2106 51 1578
-3  1790 385 1578
-3  1031 205 1579
-3  910 385 1579
-3  2430 91 1580
-3  2426 386 1580
-3  1349 206 1581
-3  991 386 1581
-3  2178 60 1582
-3  1826 387 1582
-3  1049 207 1583
-3  928 387 1583
-3  2174 59 1584
-3  2170 388 1584
-3  1221 208 1585
-3  927 388 1585
-3  2098 50 1586
-3  1786 389 1586
-3  1029 209 1587
-3  908 389 1587
-3  2414 89 1588
-3  2410 390 1588
-3  1341 210 1589
-3  987 390 1589
-3  2114 52 1590
-3  1794 391 1590
-3  1033 211 1591
-3  912 391 1591
-3  2270 71 1592
-3  2266 392 1592
-3  1269 212 1593
-3  951 392 1593
-3  2330 79 1594
-3  1902 393 1594
-3  1087 213 1595
-3  966 393 1595
-3  2326 78 1596
-3  2322 394 1596
-3  1297 214 1597
-3  965 394 1597
-3  2210 64 1598
-3  1842 395 1598
-3  1057 215 1599
-3  936 395 1599
-3  2206 63 1600
-3  2202 396 1600
-3  1237 216 1601
-3  935 396 1601
-3  2168 808 2424
-3  2392 10 2424
-3  1025 217 1603
-3  904 397 1603
-3  1062 807 2423
-3  906 269 2423
-3  1540 807 2422
-3  1422 90 2422
-3  2226 66 1606
-3  1850 399 1606
-3  1061 219 1607
-3  940 399 1607
-3  1027 806 2421
-3  1062 269 2421
-3  1245 220 1609
-3  939 400 1609
-3  2418 90 1610
-3  1946 401 1610
-3  1109 221 1611
-3  988 401 1611
-3  2110 51 1612
-3  2106 402 1612
-3  1189 222 1613
-3  911 402 1613
-3  2242 68 1614
-3  1858 403 1614
-3  1065 223 1615
-3  944 403 1615
-3  2238 67 1616
-3  2234 404 1616
-3  1253 224 1617
-3  943 404 1617
-3  2154 57 1618
-3  1814 405 1618
-3  1043 225 1619
-3  922 405 1619
-3  2150 56 1620
-3  2146 406 1620
-3  1209 226 1621
-3  921 406 1621
-3  2258 70 1622
-3  1866 407 1622
-3  1069 227 1623
-3  948 407 1623
-3  2254 69 1624
-3  2250 408 1624
-3  1261 228 1625
-3  947 408 1625
-3  2362 83 1626
-3  1918 409 1626
-3  1095 229 1627
-3  974 409 1627
-3  2358 82 1628
-3  2354 410 1628
-3  1313 230 1629
-3  973 410 1629
-3  2194 62 1630
-3  1834 411 1630
-3  1053 231 1631
-3  932 411 1631
-3  2350 81 1632
-3  2346 412 1632
-3  1309 232 1633
-3  971 412 1633
-3  2122 53 1634
-3  1798 413 1634
-3  1035 233 1635
-3  914 413 1635
-3  2118 52 1636
-3  2114 414 1636
-3  1193 234 1637
-3  913 414 1637
-3  2290 74 1638
-3  1882 415 1638
-3  1077 235 1639
-3  956 415 1639
-3  2286 73 1640
-3  2282 416 1640
-3  1277 236 1641
-3  955 416 1641
-3  2410 89 1642
-3  1942 417 1642
-3  1107 237 1643
-3  986 417 1643
-3  2406 88 1644
-3  2402 418 1644
-3  1337 238 1645
-3  985 418 1645
-3  2306 76 1646
-3  1890 419 1646
-3  1081 239 1647
-3  960 419 1647
-3  2302 75 1648
-3  2298 420 1648
-3  1285 240 1649
-3  959 420 1649
-3  1852 806 2420
-3  1780 31 2420
-3  1097 241 1651
-3  976 421 1651
-3  1180 805 2419
-3  941 268 2419
-3  1610 805 2418
-3  1540 90 2418
-3  2322 78 1654
-3  1898 423 1654
-3  1085 243 1655
-3  964 423 1655
-3  1249 804 2417
-3  1180 268 2417
-3  1293 244 1657
-3  963 424 1657
-3  2202 63 1658
-3  1838 425 1658
-3  1055 245 1659
-3  934 425 1659
-3  2198 62 1660
-3  2194 426 1660
-3  1233 246 1661
-3  933 426 1661
-3  2338 80 1662
-3  1906 427 1662
-3  1089 247 1663
-3  968 427 1663
-3  2334 79 1664
-3  2330 428 1664
-3  1301 248 1665
-3  967 428 1665
-3  2354 82 1666
-3  1914 429 1666
-3  1093 249 1667
-3  972 429 1667
-3  2078 47 1668
-3  2074 430 1668
-3  1173 250 1669
-3  903 430 1669
-3  2274 72 1670
-3  1874 431 1670
-3  1073 251 1671
-3  952 431 1671
-3  2342 80 1672
-3  2338 432 1672
-3  1305 252 1673
-3  969 432 1673
-3  2266 71 1674
-3  1870 433 1674
-3  1071 253 1675
-3  950 433 1675
-3  2262 70 1676
-3  2258 434 1676
-3  1265 254 1677
-3  949 434 1677
-3  2138 55 1678
-3  1806 435 1678
-3  1039 255 1679
-3  918 435 1679
-3  2310 76 1680
-3  2306 436 1680
-3  1289 256 1681
-3  961 436 1681
-3  2088 804 2416
-3  2224 11 2416
-3  1078 803 2415
-3  930 267 2415
-3  2094 49 1684
-3  2090 438 1684
-3  1181 258 1685
-3  907 438 1685
-3  1588 803 2414
-3  1438 89 2414
-3  1051 802 2413
-3  1078 267 2413
-3  1884 802 2412
-3  1828 30 2412
-3  1228 801 2411
-3  957 266 2411
-3  2402 88 1690
-3  1938 441 1690
-3  1105 261 1691
-3  984 441 1691
-3  2102 50 1692
-3  2098 442 1692
-3  1185 262 1693
-3  909 442 1693
-3  2426 91 1694
-3  1950 443 1694
-3  1111 263 1695
-3  990 443 1695
-3  1642 801 2410
-3  1588 89 2410
-3  1329 264 1697
-3  981 444 1697
-3  2298 75 1698
-3  1886 445 1698
-3  1079 265 1699
-3  958 445 1699
-3  2294 74 1700
-3  2290 446 1700
-3  1281 266 1701
-3  957 446 1701
-3  2186 61 1702
-3  1830 447 1702
-3  1051 267 1703
-3  930 447 1703
-3  2230 66 1704
-3  2226 448 1704
-3  1249 268 1705
-3  941 448 1705
-3  2090 49 1706
-3  1782 449 1706
-3  1027 269 1707
-3  906 449 1707
-3  2398 87 1708
-3  2394 450 1708
-3  1333 270 1709
-3  983 450 1709
-3  2170 59 1710
-3  1822 451 1710
-3  1047 271 1711
-3  926 451 1711
-3  2132 13 1712
-3  1964 452 1712
-3  1118 92 1713
-3  1203 452 1713
-3  1478 32 1714
-3  1396 453 1714
-3  834 92 1715
-3  1118 453 1715
-3  2148 14 1716
-3  1972 454 1716
-3  1122 93 1717
-3  1211 454 1717
-3  1482 33 1718
-3  1400 455 1718
-3  836 93 1719
-3  1122 455 1719
-3  2164 15 1720
-3  1980 456 1720
-3  1126 94 1721
-3  1219 456 1721
-3  1486 34 1722
-3  1404 457 1722
-3  838 94 1723
-3  1126 457 1723
-3  2180 16 1724
-3  1988 458 1724
-3  1130 95 1725
-3  1227 458 1725
-3  1490 35 1726
-3  1408 459 1726
-3  840 95 1727
-3  1130 459 1727
-3  2116 12 1728
-3  1956 460 1728
-3  1114 96 1729
-3  1195 460 1729
-3  1474 36 1730
-3  1392 461 1730
-3  832 96 1731
-3  1114 461 1731
-3  2212 18 1732
-3  2004 462 1732
-3  1138 97 1733
-3  1243 462 1733
-3  1498 37 1734
-3  1416 463 1734
-3  844 97 1735
-3  1138 463 1735
-3  2228 19 1736
-3  2012 464 1736
-3  1142 98 1737
-3  1251 464 1737
-3  1502 38 1738
-3  1420 465 1738
-3  846 98 1739
-3  1142 465 1739
-3  2244 20 1740
-3  2020 466 1740
-3  1146 99 1741
-3  1259 466 1741
-3  1506 39 1742
-3  1424 467 1742
-3  848 99 1743
-3  1146 467 1743
-3  2260 21 1744
-3  2028 468 1744
-3  1150 100 1745
-3  1267 468 1745
-3  1510 40 1746
-3  1428 469 1746
-3  850 100 1747
-3  1150 469 1747
-3  2196 17 1748
-3  1996 470 1748
-3  1134 101 1749
-3  1235 470 1749
-3  1494 41 1750
-3  1412 471 1750
-3  842 101 1751
-3  1134 471 1751
-3  2292 23 1752
-3  2044 472 1752
-3  1158 102 1753
-3  1283 472 1753
-3  1518 42 1754
-3  1436 473 1754
-3  854 102 1755
-3  1158 473 1755
-3  2308 24 1756
-3  2052 474 1756
-3  1162 103 1757
-3  1291 474 1757
-3  1522 43 1758
-3  1440 475 1758
-3  856 103 1759
-3  1162 475 1759
-3  2324 25 1760
-3  2060 476 1760
-3  1166 104 1761
-3  1299 476 1761
-3  1526 44 1762
-3  1444 477 1762
-3  858 104 1763
-3  1166 477 1763
-3  2340 26 1764
-3  2068 478 1764
-3  1170 105 1765
-3  1307 478 1765
-3  1530 45 1766
-3  1448 479 1766
-3  860 105 1767
-3  1170 479 1767
-3  2276 22 1768
-3  2036 480 1768
-3  1154 106 1769
-3  1275 480 1769
-3  1514 46 1770
-3  1432 481 1770
-3  852 106 1771
-3  1154 481 1771
-3  2140 13 1772
-3  2132 482 1772
-3  1202 107 1773
-3  1207 482 1773
-3  1562 47 1774
-3  1398 483 1774
-3  835 107 1775
-3  1202 483 1775
-3  2220 18 1776
-3  2212 484 1776
-3  2433 1777 542
-3  1247 484 1777
-3  1281 800 2409
-3  1228 266 2409
-3  2184 800 2408
-3  2288 2 2408
-3  2428 31 1780
-3  2420 486 1780
-3  1346 109 1781
-3  1351 486 1781
-3  1706 49 1782
-3  1470 487 1782
-3  871 109 1783
-3  1346 487 1783
-3  2188 16 1784
-3  2180 488 1784
-3  1226 110 1785
-3  1231 488 1785
-3  1586 50 1786
-3  1410 489 1786
-3  841 110 1787
-3  1226 489 1787
-3  2172 15 1788
-3  2164 490 1788
-3  1218 111 1789
-3  1223 490 1789
-3  1578 51 1790
-3  1406 491 1790
-3  839 111 1791
-3  1218 491 1791
-3  1988 16 1792
-3  2188 492 1792
-3  1230 112 1793
-3  1131 492 1793
-3  1590 52 1794
-3  1360 493 1794
-3  816 112 1795
-3  1230 493 1795
-3  2284 22 1796
-3  2276 494 1796
-3  1274 113 1797
-3  1279 494 1797
-3  1634 53 1798
-3  1434 495 1798
-3  853 113 1799
-3  1274 495 1799
-3  1956 12 1800
-3  2124 496 1800
-3  1198 114 1801
-3  1115 496 1801
-3  1558 54 1802
-3  1352 497 1802
-3  812 114 1803
-3  1198 497 1803
-3  2076 27 1804
-3  2364 498 1804
-3  1318 115 1805
-3  1175 498 1805
-3  1678 55 1806
-3  1382 499 1806
-3  827 115 1807
-3  1318 499 1807
-3  1964 13 1808
-3  2140 500 1808
-3  1206 116 1809
-3  1119 500 1809
-3  1566 56 1810
-3  1354 501 1810
-3  813 116 1811
-3  1206 501 1811
-3  2252 20 1812
-3  2244 502 1812
-3  1258 117 1813
-3  1263 502 1813
-3  1618 57 1814
-3  1426 503 1814
-3  849 117 1815
-3  1258 503 1815
-3  1972 14 1816
-3  2156 504 1816
-3  1214 118 1817
-3  1123 504 1817
-3  1574 58 1818
-3  1356 505 1818
-3  814 118 1819
-3  1214 505 1819
-3  2108 31 1820
-3  2428 506 1820
-3  1350 119 1821
-3  1191 506 1821
-3  1710 59 1822
-3  1390 507 1822
-3  831 119 1823
-3  1350 507 1823
-3  1980 15 1824
-3  2172 508 1824
-3  1222 120 1825
-3  1127 508 1825
-3  1582 60 1826
-3  1358 509 1826
-3  815 120 1827
-3  1222 509 1827
-3  2100 30 1828
-3  2412 510 1828
-3  1342 121 1829
-3  1187 510 1829
-3  1702 61 1830
-3  1388 511 1830
-3  830 121 1831
-3  1342 511 1831
-3  2028 21 1832
-3  2268 512 1832
-3  1270 122 1833
-3  1151 512 1833
-3  1630 62 1834
-3  1370 513 1834
-3  821 122 1835
-3  1270 513 1835
-3  2332 25 1836
-3  2324 514 1836
-3  1298 123 1837
-3  1303 514 1837
-3  1658 63 1838
-3  1446 515 1838
-3  859 123 1839
-3  1298 515 1839
-3  1996 17 1840
-3  2204 516 1840
-3  1238 124 1841
-3  1135 516 1841
-3  1598 64 1842
-3  1362 517 1842
-3  817 124 1843
-3  1238 517 1843
-3  1102 799 2407
-3  958 265 2407
-3  1644 799 2406
-3  1462 88 2406
-3  1079 798 2405
-3  1102 265 2405
-3  1932 798 2404
-3  1884 30 2404
-3  2004 18 1848
-3  2220 520 1848
-3  1246 126 1849
-3  1139 520 1849
-3  1606 66 1850
-3  1364 521 1850
-3  818 126 1851
-3  1246 521 1851
-3  2420 31 1852
-3  2108 522 1852
-3  1190 127 1853
-3  1347 522 1853
-3  1550 67 1854
-3  1468 523 1854
-3  870 127 1855
-3  1190 523 1855
-3  2012 19 1856
-3  2236 524 1856
-3  1254 128 1857
-3  1143 524 1857
-3  1614 68 1858
-3  1366 525 1858
-3  819 128 1859
-3  1254 525 1859
-3  2156 14 1860
-3  2148 526 1860
-3  1210 129 1861
-3  1215 526 1861
-3  1570 69 1862
-3  1402 527 1862
-3  837 129 1863
-3  1210 527 1863
-3  2020 20 1864
-3  2252 528 1864
-3  1262 130 1865
-3  1147 528 1865
-3  1622 70 1866
-3  1368 529 1866
-3  820 130 1867
-3  1262 529 1867
-3  2364 27 1868
-3  2356 530 1868
-3  1314 131 1869
-3  1319 530 1869
-3  1674 71 1870
-3  1454 531 1870
-3  863 131 1871
-3  1314 531 1871
-3  2068 26 1872
-3  2348 532 1872
-3  1310 132 1873
-3  1171 532 1873
-3  1670 72 1874
-3  1380 533 1874
-3  826 132 1875
-3  1310 533 1875
-3  2124 12 1876
-3  2116 534 1876
-3  1194 133 1877
-3  1199 534 1877
-3  1554 73 1878
-3  1394 535 1878
-3  833 133 1879
-3  1194 535 1879
-3  2036 22 1880
-3  2284 536 1880
-3  1278 134 1881
-3  1155 536 1881
-3  1638 74 1882
-3  1372 537 1882
-3  822 134 1883
-3  1278 537 1883
-3  2412 30 1884
-3  2404 538 1884
-3  1338 135 1885
-3  1343 538 1885
-3  1698 75 1886
-3  1466 539 1886
-3  869 135 1887
-3  1338 539 1887
-3  2044 23 1888
-3  2300 540 1888
-3  1286 136 1889
-3  1159 540 1889
-3  1646 76 1890
-3  1374 541 1890
-3  823 136 1891
-3  1286 541 1891
-3  1284 797 2403
-3  981 264 2403
-3  1690 797 2402
-3  1644 88 2402
-3  1329 796 2401
-3  1284 264 2401
-3  2296 796 2400
-3  2384 7 2400
-3  2052 24 1896
-3  2316 544 1896
-3  1294 138 1897
-3  1163 544 1897
-3  1654 78 1898
-3  1376 545 1898
-3  824 138 1899
-3  1294 545 1899
-3  2204 17 1900
-3  2196 546 1900
-3  1234 139 1901
-3  1239 546 1901
-3  1594 79 1902
-3  1414 547 1902
-3  843 139 1903
-3  1234 547 1903
-3  2060 25 1904
-3  2332 548 1904
-3  1302 140 1905
-3  1167 548 1905
-3  1662 80 1906
-3  1378 549 1906
-3  825 140 1907
-3  1302 549 1907
-3  2356 27 1908
-3  2076 550 1908
-3  1174 141 1909
-3  1315 550 1909
-3  1534 81 1910
-3  1452 551 1910
-3  862 141 1911
-3  1174 551 1911
-3  2348 26 1912
-3  2340 552 1912
-3  1306 142 1913
-3  1311 552 1913
-3  1666 82 1914
-3  1450 553 1914
-3  861 142 1915
-3  1306 553 1915
-3  2268 21 1916
-3  2260 554 1916
-3  1266 143 1917
-3  1271 554 1917
-3  1626 83 1918
-3  1430 555 1918
-3  851 143 1919
-3  1266 555 1919
-3  2316 24 1920
-3  2308 556 1920
-3  2432 1921 1082
-3  1295 556 1921
-3  1104 795 2399
-3  990 263 2399
-3  1708 795 2398
-3  1464 87 2398
-3  2388 29 1924
-3  2092 558 1924
-3  1923 1925 1177
-3  1331 558 1925
-3  1111 794 2397
-3  1104 263 2397
-3  1936 794 2396
-3  1948 29 2396
-3  1348 793 2395
-3  909 262 2395
-3  1546 793 2394
-3  1708 87 2394
-3  1185 792 2393
-3  1348 262 2393
-3  2424 792 2392
-3  2096 10 2392
-3  2404 30 1932
-3  2100 562 1932
-3  1186 147 1933
-3  1339 562 1933
-3  1546 87 1934
-3  1464 563 1934
-3  868 147 1935
-3  1186 563 1935
-3  2396 29 1936
-3  2388 564 1936
-3  1330 148 1937
-3  1335 564 1937
-3  1690 88 1938
-3  1462 565 1938
-3  867 148 1939
-3  1330 565 1939
-3  2300 23 1940
-3  2292 566 1940
-3  1282 149 1941
-3  1287 566 1941
-3  1642 89 1942
-3  1438 567 1942
-3  855 149 1943
-3  1282 567 1943
-3  2236 19 1944
-3  2228 568 1944
-3  1250 150 1945
-3  1255 568 1945
-3  1610 90 1946
-3  1422 569 1946
-3  847 150 1947
-3  1250 569 1947
-3  2092 29 1948
-3  2396 570 1948
-3  1334 151 1949
-3  1183 570 1949
-3  1694 91 1950
-3  1386 571 1950
-3  829 151 1951
-3  1334 571 1951
-3  1960 0 1952
-3  1984 572 1952
-3  1128 152 1953
-3  1117 572 1953
-3  1488 32 1954
-3  1478 573 1954
-3  875 152 1955
-3  1128 573 1955
-3  1728 12 1956
-3  1800 574 1956
-3  1036 153 1957
-3  1001 574 1957
-3  1396 32 1958
-3  1488 575 1958
-3  880 153 1959
-3  1036 575 1959
-3  1968 0 1960
-3  1952 576 1960
-3  1112 154 1961
-3  1121 576 1961
-3  1472 33 1962
-3  1482 577 1962
-3  877 154 1963
-3  1112 577 1963
-3  1712 13 1964
-3  1808 578 1964
-3  1040 155 1965
-3  993 578 1965
-3  1400 33 1966
-3  1472 579 1966
-3  872 155 1967
-3  1040 579 1967
-3  1976 0 1968
-3  1960 580 1968
-3  1116 156 1969
-3  1125 580 1969
-3  1476 34 1970
-3  1486 581 1970
-3  879 156 1971
-3  1116 581 1971
-3  1716 14 1972
-3  1816 582 1972
-3  1044 157 1973
-3  995 582 1973
-3  1404 34 1974
-3  1476 583 1974
-3  874 157 1975
-3  1044 583 1975
-3  1984 0 1976
-3  1968 584 1976
-3  1120 158 1977
-3  1129 584 1977
-3  1480 35 1978
-3  1490 585 1978
-3  881 158 1979
-3  1120 585 1979
-3  1720 15 1980
-3  1824 586 1980
-3  1048 159 1981
-3  997 586 1981
-3  1408 35 1982
-3  1480 587 1982
-3  876 159 1983
-3  1048 587 1983
-3  1952 0 1984
-3  1976 588 1984
-3  1124 160 1985
-3  1113 588 1985
-3  1484 36 1986
-3  1474 589 1986
-3  873 160 1987
-3  1124 589 1987
-3  1724 16 1988
-3  1792 590 1988
-3  1032 161 1989
-3  999 590 1989
-3  1392 36 1990
-3  1484 591 1990
-3  878 161 1991
-3  1032 591 1991
-3  2000 1 1992
-3  2024 592 1992
-3  1148 162 1993
-3  1137 592 1993
-3  1508 37 1994
-3  1498 593 1994
-3  885 162 1995
-3  1148 593 1995
-3  1748 17 1996
-3  1840 594 1996
-3  1056 163 1997
-3  1011 594 1997
-3  1416 37 1998
-3  1508 595 1998
-3  890 163 1999
-3  1056 595 1999
-3  2008 1 2000
-3  1992 596 2000
-3  1132 164 2001
-3  1141 596 2001
-3  1492 38 2002
-3  1502 597 2002
-3  887 164 2003
-3  1132 597 2003
-3  1732 18 2004
-3  1848 598 2004
-3  1060 165 2005
-3  1003 598 2005
-3  1420 38 2006
-3  1492 599 2006
-3  882 165 2007
-3  1060 599 2007
-3  2016 1 2008
-3  2000 600 2008
-3  1136 166 2009
-3  1145 600 2009
-3  1496 39 2010
-3  1506 601 2010
-3  889 166 2011
-3  1136 601 2011
-3  1736 19 2012
-3  1856 602 2012
-3  1064 167 2013
-3  1005 602 2013
-3  1424 39 2014
-3  1496 603 2014
-3  884 167 2015
-3  1064 603 2015
-3  2024 1 2016
-3  2008 604 2016
-3  1140 168 2017
-3  1149 604 2017
-3  1500 40 2018
-3  1510 605 2018
-3  891 168 2019
-3  1140 605 2019
-3  1740 20 2020
-3  1864 606 2020
-3  1068 169 2021
-3  1007 606 2021
-3  1428 40 2022
-3  1500 607 2022
-3  886 169 2023
-3  1068 607 2023
-3  1992 1 2024
-3  2016 608 2024
-3  1144 170 2025
-3  1133 608 2025
-3  1504 41 2026
-3  1494 609 2026
-3  883 170 2027
-3  1144 609 2027
-3  1744 21 2028
-3  1832 610 2028
-3  1052 171 2029
-3  1009 610 2029
-3  1412 41 2030
-3  1504 611 2030
-3  888 171 2031
-3  1052 611 2031
-3  2040 5 2032
-3  2064 612 2032
-3  1168 172 2033
-3  1157 612 2033
-3  1528 42 2034
-3  1518 613 2034
-3  895 172 2035
-3  1168 613 2035
-3  1768 22 2036
-3  1880 614 2036
-3  1076 173 2037
-3  1021 614 2037
-3  1436 42 2038
-3  1528 615 2038
-3  900 173 2039
-3  1076 615 2039
-3  2048 5 2040
-3  2032 616 2040
-3  1152 174 2041
-3  1161 616 2041
-3  1512 43 2042
-3  1522 617 2042
-3  897 174 2043
-3  1152 617 2043
-3  1752 23 2044
-3  1888 618 2044
-3  1080 175 2045
-3  1013 618 2045
-3  1440 43 2046
-3  1512 619 2046
-3  892 175 2047
-3  1080 619 2047
-3  2056 5 2048
-3  2040 620 2048
-3  1156 176 2049
-3  1165 620 2049
-3  1516 44 2050
-3  1526 621 2050
-3  899 176 2051
-3  1156 621 2051
-3  1756 24 2052
-3  1896 622 2052
-3  1084 177 2053
-3  1015 622 2053
-3  1444 44 2054
-3  1516 623 2054
-3  894 177 2055
-3  1084 623 2055
-3  2064 5 2056
-3  2048 624 2056
-3  1160 178 2057
-3  1169 624 2057
-3  1520 45 2058
-3  1530 625 2058
-3  901 178 2059
-3  1160 625 2059
-3  1760 25 2060
-3  1904 626 2060
-3  1088 179 2061
-3  1017 626 2061
-3  1448 45 2062
-3  1520 627 2062
-3  896 179 2063
-3  1088 627 2063
-3  2032 5 2064
-3  2056 628 2064
-3  1164 180 2065
-3  1153 628 2065
-3  1524 46 2066
-3  1514 629 2066
-3  893 180 2067
-3  1164 629 2067
-3  1764 26 2068
-3  1872 630 2068
-3  1072 181 2069
-3  1019 630 2069
-3  1432 46 2070
-3  1524 631 2070
-3  898 181 2071
-3  1072 631 2071
-3  2128 8 2072
-3  2344 632 2072
-3  1308 182 2073
-3  1201 632 2073
-3  1668 47 2074
-3  1562 633 2074
-3  917 182 2075
-3  1308 633 2075
-3  1908 27 2076
-3  1804 634 2076
-3  1038 183 2077
-3  1091 634 2077
-3  1398 47 2078
-3  1668 635 2078
-3  970 183 2079
-3  1038 635 2079
-3  2208 3 2080
-3  2312 636 2080
-3  1292 184 2081
-3  1241 636 2081
-3  1893 1892 1098
-3  984 261 2391
-3  937 184 2083
-3  1105 790 2389
-3  1098 261 2389
-3  1924 790 2388
-3  1936 29 2388
-3  2434 788 305
-3  2400 788 2384
-3  2368 7 2384
-3  1656 2379 185
-3  907 258 2379
-3  2416 11 2088
-3  2376 640 2088
-3  1324 186 2089
-3  1345 640 2089
-3  1684 49 2090
-3  1706 641 2090
-3  989 186 2091
-3  1324 641 2091
-3  1924 29 2092
-3  1948 642 2092
-3  1110 187 2093
-3  1099 642 2093
-3  1470 49 2094
-3  1684 643 2094
-3  978 187 2095
-3  1110 643 2095
-3  2176 10 2096
-3  2392 644 2096
-3  1332 188 2097
-3  1225 644 2097
-3  1692 50 2098
-3  1586 645 2098
-3  929 188 2099
-3  1332 645 2099
-3  1932 30 2100
-3  1828 646 2100
-3  1050 189 2101
-3  1103 646 2101
-3  1410 50 2102
-3  1692 647 2102
-3  982 189 2103
-3  1050 647 2103
-3  2160 6 2104
-3  2232 648 2104
-3  1252 190 2105
-3  1217 648 2105
-3  1612 51 2106
-3  1578 649 2106
-3  925 190 2107
-3  1252 649 2107
-3  1852 31 2108
-3  1820 650 2108
-3  1046 191 2109
-3  1063 650 2109
-3  1406 51 2110
-3  1612 651 2110
-3  942 191 2111
-3  1046 651 2111
-3  2184 2 2112
-3  2280 652 2112
-3  1276 192 2113
-3  1229 652 2113
-3  1636 52 2114
-3  1590 653 2114
-3  931 192 2115
-3  1276 653 2115
-3  1876 12 2116
-3  1728 654 2116
-3  1000 193 2117
-3  1075 654 2117
-3  1360 52 2118
-3  1636 655 2118
-3  954 193 2119
-3  1000 655 2119
-3  2272 8 2120
-3  2128 656 2120
-3  1200 194 2121
-3  1273 656 2121
-3  1560 53 2122
-3  1634 657 2122
-3  953 194 2123
-3  1200 657 2123
-3  1800 12 2124
-3  1876 658 2124
-3  1074 195 2125
-3  1037 658 2125
-3  1434 53 2126
-3  1560 659 2126
-3  916 195 2127
-3  1074 659 2127
-3  2120 8 2128
-3  2072 660 2128
-3  1172 196 2129
-3  1197 660 2129
-3  1532 54 2130
-3  1558 661 2130
-3  915 196 2131
-3  1172 661 2131
-3  1772 13 2132
-3  1712 662 2132
-3  992 197 2133
-3  1023 662 2133
-3  1352 54 2134
-3  1532 663 2134
-3  902 197 2135
-3  992 663 2135
-3  2360 4 2136
-3  2144 664 2136
-3  1208 198 2137
-3  1317 664 2137
-3  1568 55 2138
-3  1678 665 2138
-3  975 198 2139
-3  1208 665 2139
-3  1808 13 2140
-3  1772 666 2140
-3  1022 199 2141
-3  1041 666 2141
-3  1382 55 2142
-3  1568 667 2142
-3  920 199 2143
-3  1022 667 2143
-3  2136 4 2144
-3  2248 668 2144
-3  1260 200 2145
-3  1205 668 2145
-3  1620 56 2146
-3  1566 669 2146
-3  919 200 2147
-3  1260 669 2147
-3  1860 14 2148
-3  1716 670 2148
-3  994 201 2149
-3  1067 670 2149
-3  1354 56 2150
-3  1620 671 2150
-3  946 201 2151
-3  994 671 2151
-3  2240 6 2152
-3  2160 672 2152
-3  1216 202 2153
-3  1257 672 2153
-3  1576 57 2154
-3  1618 673 2154
-3  945 202 2155
-3  1216 673 2155
-3  1816 14 2156
-3  1860 674 2156
-3  1066 203 2157
-3  1045 674 2157
-3  1426 57 2158
-3  1576 675 2158
-3  924 203 2159
-3  1066 675 2159
-3  2152 6 2160
-3  2104 676 2160
-3  1188 204 2161
-3  1213 676 2161
-3  1548 58 2162
-3  1574 677 2162
-3  923 204 2163
-3  1188 677 2163
-3  1788 15 2164
-3  1720 678 2164
-3  996 205 2165
-3  1031 678 2165
-3  1356 58 2166
-3  1548 679 2166
-3  910 205 2167
-3  996 679 2167
-3  2424 10 2168
-3  2176 680 2168
-3  1224 206 2169
-3  1349 680 2169
-3  1584 59 2170
-3  1710 681 2170
-3  991 206 2171
-3  1224 681 2171
-3  1824 15 2172
-3  1788 682 2172
-3  1030 207 2173
-3  1049 682 2173
-3  1390 59 2174
-3  1584 683 2174
-3  928 207 2175
-3  1030 683 2175
-3  2168 10 2176
-3  2096 684 2176
-3  1184 208 2177
-3  1221 684 2177
-3  1544 60 2178
-3  1582 685 2178
-3  927 208 2179
-3  1184 685 2179
-3  1784 16 2180
-3  1724 686 2180
-3  998 209 2181
-3  1029 686 2181
-3  1358 60 2182
-3  1544 687 2182
-3  908 209 2183
-3  998 687 2183
-3  2408 2 2184
-3  2112 688 2184
-3  1192 210 2185
-3  1341 688 2185
-3  1552 61 2186
-3  1702 689 2186
-3  987 210 2187
-3  1192 689 2187
-3  1792 16 2188
-3  1784 690 2188
-3  1028 211 2189
-3  1033 690 2189
-3  1388 61 2190
-3  1552 691 2190
-3  912 211 2191
-3  1028 691 2191
-3  2264 9 2192
-3  2328 692 2192
-3  1300 212 2193
-3  1269 692 2193
-3  1660 62 2194
-3  1630 693 2194
-3  951 212 2195
-3  1300 693 2195
-3  1900 17 2196
-3  1748 694 2196
-3  1010 213 2197
-3  1087 694 2197
-3  1370 62 2198
-3  1660 695 2198
-3  966 213 2199
-3  1010 695 2199
-3  2320 3 2200
-3  2208 696 2200
-3  1240 214 2201
-3  1297 696 2201
-3  1600 63 2202
-3  1658 697 2202
-3  965 214 2203
-3  1240 697 2203
-3  1840 17 2204
-3  1900 698 2204
-3  1086 215 2205
-3  1057 698 2205
-3  1446 63 2206
-3  1600 699 2206
-3  936 215 2207
-3  1086 699 2207
-3  2200 3 2208
-3  2080 700 2208
-3  1176 216 2209
-3  1237 700 2209
-3  1536 64 2210
-3  1598 701 2210
-3  935 216 2211
-3  1176 701 2211
-3  1776 18 2212
-3  1732 702 2212
-3  1002 217 2213
-3  1025 702 2213
-3  1362 64 2214
-3  1536 703 2214
-3  904 217 2215
-3  1002 703 2215
-3  2376 11 2216
-3  2224 704 2216
-3  1181 784 2377
-3  2315 704 2217
-3  1244 258 2377
-3  2216 784 2376
-3  2088 11 2376
-3  1930 2371 864
-3  1848 18 2220
-3  1776 706 2220
-3  1024 219 2221
-3  1061 706 2221
-3  961 256 2371
-3  1289 780 2369
-3  940 219 2223
-3  2437 1024 2441
-3  2216 11 2224
-3  2416 708 2224
-3  1344 220 2225
-3  1245 708 2225
-3  1704 66 2226
-3  1606 709 2226
-3  939 220 2227
-3  1344 709 2227
-3  1944 19 2228
-3  1736 710 2228
-3  1004 221 2229
-3  1109 710 2229
-3  1364 66 2230
-3  1704 711 2230
-3  988 221 2231
-3  1004 711 2231
-3  2104 6 2232
-3  2240 712 2232
-3  1256 222 2233
-3  1189 712 2233
-3  1616 67 2234
-3  1550 713 2234
-3  911 222 2235
-3  1256 713 2235
-3  1856 19 2236
-3  1944 714 2236
-3  1108 223 2237
-3  1065 714 2237
-3  1468 67 2238
-3  1616 715 2238
-3  944 223 2239
-3  1108 715 2239
-3  2232 6 2240
-3  2152 716 2240
-3  1212 224 2241
-3  1253 716 2241
-3  1572 68 2242
-3  1614 717 2242
-3  943 224 2243
-3  1212 717 2243
-3  1812 20 2244
-3  1740 718 2244
-3  1006 225 2245
-3  1043 718 2245
-3  1366 68 2246
-3  1572 719 2246
-3  922 225 2247
-3  1006 719 2247
-3  2144 4 2248
-3  2256 720 2248
-3  1264 226 2249
-3  1209 720 2249
-3  1624 69 2250
-3  1570 721 2250
-3  921 226 2251
-3  1264 721 2251
-3  1864 20 2252
-3  1812 722 2252
-3  1042 227 2253
-3  1069 722 2253
-3  1402 69 2254
-3  1624 723 2254
-3  948 227 2255
-3  1042 723 2255
-3  2248 4 2256
-3  2360 724 2256
-3  1316 228 2257
-3  1261 724 2257
-3  1676 70 2258
-3  1622 725 2258
-3  947 228 2259
-3  1316 725 2259
-3  1916 21 2260
-3  1744 726 2260
-3  1008 229 2261
-3  1095 726 2261
-3  1368 70 2262
-3  1676 727 2262
-3  974 229 2263
-3  1008 727 2263
-3  2352 9 2264
-3  2192 728 2264
-3  1232 230 2265
-3  1313 728 2265
-3  1592 71 2266
-3  1674 729 2266
-3  973 230 2267
-3  1232 729 2267
-3  1832 21 2268
-3  1916 730 2268
-3  1094 231 2269
-3  1053 730 2269
-3  1454 71 2270
-3  1592 731 2270
-3  932 231 2271
-3  1094 731 2271
-3  2344 8 2272
-3  2120 732 2272
-3  1196 232 2273
-3  1309 732 2273
-3  1556 72 2274
-3  1670 733 2274
-3  971 232 2275
-3  1196 733 2275
-3  1796 22 2276
-3  1768 734 2276
-3  1020 233 2277
-3  1035 734 2277
-3  1380 72 2278
-3  1556 735 2278
-3  914 233 2279
-3  1020 735 2279
-3  2112 2 2280
-3  2288 736 2280
-3  1280 234 2281
-3  1193 736 2281
-3  1640 73 2282
-3  1554 737 2282
-3  913 234 2283
-3  1280 737 2283
-3  1880 22 2284
-3  1796 738 2284
-3  1034 235 2285
-3  1077 738 2285
-3  1394 73 2286
-3  1640 739 2286
-3  956 235 2287
-3  1034 739 2287
-3  2280 2 2288
-3  2408 740 2288
-3  1340 236 2289
-3  1277 740 2289
-3  1700 74 2290
-3  1638 741 2290
-3  955 236 2291
-3  1340 741 2291
-3  1940 23 2292
-3  1752 742 2292
-3  1012 237 2293
-3  1107 742 2293
-3  1372 74 2294
-3  1700 743 2294
-3  986 237 2295
-3  1012 743 2295
-3  2400 7 2296
-3  2304 744 2296
-3  1288 238 2297
-3  1337 744 2297
-3  1648 75 2298
-3  1698 745 2298
-3  985 238 2299
-3  1288 745 2299
-3  1888 23 2300
-3  1940 746 2300
-3  1106 239 2301
-3  1081 746 2301
-3  1466 75 2302
-3  1648 747 2302
-3  960 239 2303
-3  1106 747 2303
-3  2296 7 2304
-3  2368 748 2304
-3  1320 240 2305
-3  1285 748 2305
-3  1680 76 2306
-3  1646 749 2306
-3  959 240 2307
-3  1320 749 2307
-3  1920 24 2308
-3  1756 750 2308
-3  1014 241 2309
-3  1097 750 2309
-3  1374 76 2310
-3  1680 751 2310
-3  976 241 2311
-3  1014 751 2311
-3  2080 3 2312
-3  2320 752 2312
-3  1328 256 2369
-3  2451 752 1322
-3  2384 780 2368
-3  2304 7 2368
-3  1070 779 2367
-3  918 255 2367
-3  1896 24 2316
-3  1920 754 2316
-3  1096 243 2317
-3  1085 754 2317
-3  1564 779 2366
-3  1430 83 2366
-3  964 243 2319
-3  2219 1539 1096
-3  2312 3 2320
-3  2200 756 2320
-3  1236 244 2321
-3  1293 756 2321
-3  1596 78 2322
-3  1654 757 2322
-3  963 244 2323
-3  1236 757 2323
-3  1836 25 2324
-3  1760 758 2324
-3  1016 245 2325
-3  1055 758 2325
-3  1376 78 2326
-3  1596 759 2326
-3  934 245 2327
-3  1016 759 2327
-3  2192 9 2328
-3  2336 760 2328
-3  1304 246 2329
-3  1233 760 2329
-3  1664 79 2330
-3  1594 761 2330
-3  933 246 2331
-3  1304 761 2331
-3  1904 25 2332
-3  1836 762 2332
-3  1054 247 2333
-3  1089 762 2333
-3  1414 79 2334
-3  1664 763 2334
-3  968 247 2335
-3  1054 763 2335
-3  2328 9 2336
-3  2352 764 2336
-3  1312 248 2337
-3  1301 764 2337
-3  1672 80 2338
-3  1662 765 2338
-3  967 248 2339
-3  1312 765 2339
-3  1912 26 2340
-3  1764 766 2340
-3  1018 249 2341
-3  1093 766 2341
-3  1378 80 2342
-3  1672 767 2342
-3  972 249 2343
-3  1018 767 2343
-3  2072 8 2344
-3  2272 768 2344
-3  1272 250 2345
-3  1173 768 2345
-3  1632 81 2346
-3  1534 769 2346
-3  903 250 2347
-3  1272 769 2347
-3  1872 26 2348
-3  1912 770 2348
-3  1092 251 2349
-3  1073 770 2349
-3  1452 81 2350
-3  1632 771 2350
-3  952 251 2351
-3  1092 771 2351
-3  2336 9 2352
-3  2264 772 2352
-3  1268 252 2353
-3  1305 772 2353
-3  1628 82 2354
-3  1666 773 2354
-3  969 252 2355
-3  1268 773 2355
-3  1868 27 2356
-3  1908 774 2356
-3  1090 253 2357
-3  1071 774 2357
-3  1450 82 2358
-3  1628 775 2358
-3  950 253 2359
-3  1090 775 2359
-3  2256 4 2360
-3  2136 776 2360
-3  1204 254 2361
-3  1265 776 2361
-3  1564 83 2362
-3  1626 777 2362
-3  949 254 2363
-3  1204 777 2363
-3  1804 27 2364
-3  1868 778 2364
-3  1070 255 2365
+0.17031256632806052 0.87149140923129198 0.45766135056488999
+0.1530482164355772 0.8581878051094145 0.48898817612201739
+0.17773204761375261 0.87689701064830428 0.44478929974988757
+0.17773204761375266 0.87689701064830428 0.44478929974988746
+0.18610643753537565 0.88125255845135109 0.43210633013751576
+0.20692923660476614 0.89148810692249181 0.40180685413975092
+0.21254447256850684 0.89390471712616404 0.39369586600014284
+0.21439421228553288 0.89457789356401529 0.39128013241131548
+0.22681489975349639 0.89805158744476077 0.37520377518580433
+0.2284369195008584 0.89844705357522048 0.37311241287933194
+0.25355721782048268 0.90387507728811034 0.34253810440658672
+0.25671454238163 0.90442701067601727 0.33903474443581866
+0.271410708194047 0.90595336478045674 0.32286639405373119
+0.2811508450273621 0.90641151615731863 0.31222404809805682
+0.30186484921791523 0.90688305806336122 0.29107512591583129
+0.30397342055421117 0.90687073458352585 0.28910030252843327
+0.33295004022963903 0.90494753379947435 0.26218372058148826
+0.33544566672286746 0.90463734990484679 0.25988381527545978
+0.35660859546245854 0.90157505838463314 0.24184951424973428
+0.35918321758479488 0.90105806124803856 0.23967742655656488
+0.38998187620182156 0.89436470058605533 0.21570896554595276
+0.39229183849441457 0.893825128737608 0.21405999957086966
+0.41582096722616779 0.88692657891222382 0.1974660445788706
+0.42721864490060912 0.88304523202927654 0.18950565604187919
+0.44486756488630003 0.87684117534766193 0.17811496227257201
+0.44878045857535931 0.87541500307784514 0.17583413883161553
+0.48126519958548886 0.86156266551879135 0.15717574894030889
+0.48342144068564125 0.86055952199012919 0.15594877494016779
+0.50017470245974227 0.85269038907862327 0.14688267020077073
+0.50275426427774228 0.85145286645038376 0.14564781357706019
+0.51101182387798261 0.84695178356442291 0.1418121948905855
+0.5423386494351099 0.82968743367193953 0.12850859076870802
+0.55521070025011254 0.82226795238624728 0.12310298935169575
+0.55521070025011254 0.82226795238624728 0.12310298935169572
+0.56789366986248413 0.81389356246462441 0.11874744154864894
+0.59819314586024919 0.79307076339523386 0.10851189307750808
+0.60630413399985716 0.78745552743149316 0.10609528287383588
+0.60871986758868468 0.78560578771446699 0.10542210643598451
+0.62479622481419628 0.77318510024650322 0.10194841255523895
+0.62688758712066828 0.77156308049914157 0.10155294642477933
+0.65746189559341328 0.74644278217951743 0.096124922711889452
+0.66096525556418162 0.74328545761836973 0.095572989323982643
+0.6771336059462687 0.72858929180595311 0.094046635219543206
+0.68777595190194307 0.71884915497263779 0.093588483842681286
+0.70892487408416871 0.69813515078208477 0.093116941936638747
+0.71089969747156689 0.69602657944578872 0.093129265416474039
+0.73781627941851213 0.66704995977036097 0.095052466200525487
+0.74011618472454033 0.66455433327713243 0.095362650095153101
+0.75815048575026589 0.64339140453754129 0.098424941615366732
+0.76032257344343512 0.64081678241520534 0.098941938751961195
+0.78429103445404746 0.6100181237981781 0.10563529941394456
+0.78594000042913037 0.60770816150558526 0.10617487126239183
+0.80253395542112949 0.58417903277383187 0.11307342108777621
+0.8104943439581207 0.5727813550993911 0.11695476797072311
+0.82188503772742805 0.55513243511369992 0.12315882465233803
+0.82416586116838464 0.5512195414246408 0.12458499692215486
+0.84282425105969128 0.51873480041451114 0.13843733448120865
+0.84405122505983243 0.51657855931435837 0.13944047800987086
+0.85311732979922938 0.49982529754025784 0.14730961092137676
+0.85435218642293986 0.49724573572225761 0.14854713354961632
+0.85818780510941439 0.48898817612201739 0.15304821643557714
+0.87149140923129176 0.45766135056489032 0.17031256632806041
+0.87689701064830428 0.44478929974988757 0.17773204761375266
+0.88125255845135109 0.43210633013751554 0.18610643753537598
+0.89148810692249181 0.40180685413975104 0.20692923660476614
+0.89390471712616404 0.39369586600014284 0.21254447256850695
+0.89457789356401518 0.39128013241131554 0.21439421228553296
+0.89805158744476088 0.37520377518580417 0.22681489975349667
+0.89844705357522048 0.37311241287933194 0.22843691950085848
+0.90387507728811034 0.34253810440658677 0.25355721782048279
+0.90442701067601738 0.33903474443581871 0.25671454238163005
+0.90595336478045685 0.32286639405373119 0.271410708194047
+0.90641151615731874 0.31222404809805687 0.28115084502736221
+0.90688305806336122 0.29107512591583123 0.30186484921791512
+0.90687073458352596 0.28910030252843322 0.30397342055421106
+0.90494753379947435 0.26218372058148803 0.33295004022963903
+0.90463734990484679 0.25988381527545973 0.33544566672286741
+0.90157505838463314 0.24184951424973419 0.35660859546245843
+0.90105806124803878 0.23967742655656488 0.35918321758479488
+0.89436470058605533 0.21570896554595267 0.38998187620182156
+0.893825128737608 0.21405999957086963 0.39229183849441451
+0.88692657891222382 0.1974660445788706 0.41582096722616779
+0.88304523202927676 0.18950565604187922 0.42721864490060907
+0.87684117534766193 0.17811496227257195 0.44486756488630008
+0.87541500307784514 0.17583413883161553 0.44878045857535925
+0.86156266551879135 0.15717574894030889 0.48126519958548886
+0.86055952199012919 0.15594877494016762 0.48342144068564141
+0.85269038907862327 0.14688267020077067 0.50017470245974227
+0.85145286645038376 0.14564781357706019 0.50275426427774228
+0.84695178356442291 0.1418121948905855 0.51101182387798261
+0.82968743367193953 0.12850859076870802 0.5423386494351099
+0.82226795238624728 0.12310298935169575 0.55521070025011254
+0.82226795238624728 0.12310298935169572 0.55521070025011254
+0.81389356246462441 0.11874744154864894 0.56789366986248413
+0.79307076339523386 0.10851189307750797 0.59819314586024919
+0.78745552743149327 0.10609528287383579 0.60630413399985716
+0.78560578771446699 0.10542210643598442 0.60871986758868479
+0.77318510024650355 0.10194841255523886 0.62479622481419606
+0.77156308049914157 0.10155294642477924 0.62688758712066828
+0.74644278217951743 0.096124922711889466 0.65746189559341328
+0.74328545761836984 0.095572989323982616 0.66096525556418162
+0.72858929180595311 0.094046635219543179 0.67713360594626881
+0.71884915497263779 0.093588483842681203 0.68777595190194329
+0.69813515078208477 0.093116941936638692 0.70892487408416871
+0.69602657944578872 0.09312926541647408 0.71089969747156689
+0.66704995977036097 0.095052466200525487 0.73781627941851213
+0.66455433327713243 0.095362650095153129 0.74011618472454044
+0.64339140453754151 0.098424941615366676 0.75815048575026589
+0.64081678241520534 0.098941938751961223 0.76032257344343512
+0.61001812379817832 0.1056352994139447 0.78429103445404746
+0.60770816150558549 0.10617487126239183 0.78594000042913037
+0.58417903277383187 0.11307342108777625 0.80253395542112949
+0.57278135509939099 0.11695476797072324 0.8104943439581207
+0.55513243511370003 0.123158824652338 0.82188503772742816
+0.5512195414246408 0.12458499692215487 0.82416586116838453
+0.51873480041451092 0.13843733448120876 0.84282425105969128
+0.51657855931435848 0.13944047800987086 0.84405122505983243
+0.49982529754025784 0.14730961092137676 0.85311732979922927
+0.49724573572225761 0.14854713354961635 0.85435218642293975
+0.4889881761220175 0.15304821643557709 0.85818780510941428
+0.4576613505648901 0.17031256632806047 0.87149140923129198
+0.44478929974988757 0.17773204761375261 0.87689701064830428
+0.44478929974988746 0.17773204761375266 0.87689701064830428
+0.43210633013751587 0.18610643753537565 0.88125255845135109
+0.40180685413975104 0.20692923660476614 0.89148810692249203
+0.39369586600014295 0.21254447256850689 0.89390471712616426
+0.39128013241131554 0.21439421228553296 0.89457789356401551
+0.37520377518580433 0.22681489975349645 0.89805158744476099
+0.37311241287933189 0.22843691950085854 0.8984470535752207
+0.34253810440658672 0.25355721782048268 0.90387507728811034
+0.3390347444358186 0.25671454238163 0.90442701067601727
+0.32286639405373108 0.271410708194047 0.90595336478045685
+0.31222404809805682 0.2811508450273621 0.90641151615731874
+0.29107512591583118 0.30186484921791523 0.90688305806336111
+0.28910030252843322 0.30397342055421106 0.90687073458352596
+0.26218372058148809 0.33295004022963903 0.90494753379947435
+0.25988381527545967 0.33544566672286746 0.9046373499048469
+0.24184951424973422 0.35660859546245849 0.90157505838463314
+0.23967742655656482 0.35918321758479488 0.90105806124803833
+0.21570896554595276 0.38998187620182151 0.89436470058605511
+0.21405999957086966 0.39229183849441451 0.893825128737608
+0.1974660445788706 0.41582096722616779 0.88692657891222382
+0.18950565604187924 0.42721864490060907 0.88304523202927665
+0.17811496227257201 0.44486756488630003 0.87684117534766193
+0.17583413883161547 0.44878045857535925 0.87541500307784514
+0.15717574894030886 0.48126519958548875 0.86156266551879135
+0.15594877494016779 0.48342144068564119 0.86055952199012919
+0.14688267020077073 0.50017470245974227 0.85269038907862316
+0.14564781357706014 0.50275426427774228 0.85145286645038376
+0.1418121948905855 0.51101182387798283 0.84695178356442269
+0.12850859076870802 0.5423386494351099 0.82968743367193953
+0.12310298935169575 0.55521070025011254 0.82226795238624728
+0.12310298935169572 0.55521070025011254 0.82226795238624728
+0.11874744154864894 0.56789366986248413 0.81389356246462441
+0.10851189307750805 0.59819314586024896 0.79307076339523386
+0.10609528287383586 0.60630413399985694 0.78745552743149316
+0.10542210643598447 0.60871986758868468 0.78560578771446687
+0.10194841255523887 0.62479622481419628 0.77318510024650311
+0.10155294642477927 0.62688758712066828 0.77156308049914146
+0.096124922711889493 0.65746189559341328 0.74644278217951743
+0.095572989323982643 0.66096525556418151 0.74328545761836984
+0.09404663521954322 0.6771336059462687 0.72858929180595311
+0.093588483842681203 0.68777595190194329 0.71884915497263779
+0.093116941936638636 0.70892487408416871 0.69813515078208488
+0.093129265416474122 0.71089969747156689 0.69602657944578861
+0.095052466200525557 0.7378162794185118 0.66704995977036108
+0.095362650095153129 0.74011618472454033 0.66455433327713254
+0.098424941615366676 0.758150485750266 0.64339140453754151
+0.098941938751961223 0.76032257344343512 0.64081678241520534
+0.10563529941394462 0.78429103445404746 0.61001812379817821
+0.10617487126239186 0.78594000042913037 0.60770816150558549
+0.11307342108777627 0.80253395542112949 0.58417903277383187
+0.11695476797072325 0.81049434395812059 0.57278135509939099
+0.12315882465233809 0.82188503772742794 0.55513243511370003
+0.12458499692215494 0.8241658611683842 0.55121954142464069
+0.13843733448120885 0.84282425105969117 0.5187348004145107
+0.13944047800987086 0.84405122505983243 0.51657855931435837
+0.1473096109213767 0.85311732979922927 0.49982529754025778
+0.14854713354961635 0.85435218642293975 0.49724573572225772
+1.4456465002315988 1.3412681489687435 1.8276081484197548
+1.2754246841105661 1.786914649200342 1.552183464309189
+0.72457531588943436 1.7869146492003418 1.5521834643091896
+0.55435349976840165 1.3412681489687435 1.8276081484197553
+1.0000000000000002 1.0658434648581778 1.9978299645407878
+1.0000000000000002 1.0658434648581778 0.0021700354592122384
+0.55435349976840154 1.3412681489687437 0.17239185158024495
+0.72457531588943436 1.7869146492003423 0.44781653569081092
+1.2754246841105661 1.7869146492003423 0.44781653569081104
+1.4456465002315988 1.3412681489687435 0.17239185158024506
+1.3412681489687435 0.17239185158024517 1.4456465002315988
+1.0658434648581778 0.0021700354592122384 1.0000000000000002
+1.3412681489687437 0.17239185158024495 0.55435349976840154
+1.7869146492003423 0.44781653569081104 0.72457531588943436
+1.7869146492003423 0.44781653569081104 1.2754246841105661
+1.8276081484197548 1.4456465002315988 1.3412681489687435
+0.0021700354592122384 1.0000000000000002 0.93415653514182284
+0.44781653569081104 0.72457531588943436 1.7869146492003423
+0.21308535079965829 1.5521834643091896 1.2754246841105661
+1.0000000000000002 0.93415653514182273 1.997829964540788
+1.5521834643091896 0.72457531588943436 1.7869146492003418
+1.552183464309189 1.2754246841105661 1.786914649200342
+1.786914649200342 1.552183464309189 1.2754246841105661
+1.3412681489687435 1.8276081484197548 1.4456465002315988
+0.93415653514182273 1.997829964540788 1
+0.65873185103125687 1.8276081484197551 1.4456465002315988
+0.17239185158024528 1.4456465002315988 1.3412681489687437
+0.44781653569081104 1.2754246841105661 1.7869146492003423
+0.55435349976840165 0.65873185103125698 1.8276081484197553
+1.5521834643091894 1.2754246841105661 0.21308535079965818
+1.4456465002315988 0.65873185103125698 0.17239185158024495
+1.0000000000000002 0.93415653514182284 0.0021700354592122384
+0.44781653569081092 1.2754246841105661 0.21308535079965796
+0.21308535079965796 1.5521834643091892 0.72457531588943436
+0.65873185103125698 1.8276081484197553 0.55435349976840165
+1.0658434648581778 1.9978299645407878 1.0000000000000002
+1.3412681489687435 1.8276081484197551 0.55435349976840154
+1.8276081484197551 1.4456465002315988 0.65873185103125687
+1.8276081484197553 0.55435349976840165 1.3412681489687435
+1.4456465002315988 0.65873185103125687 1.8276081484197551
+1.2754246841105661 0.21308535079965818 1.5521834643091894
+0.65873185103125698 0.17239185158024495 1.4456465002315988
+0.93415653514182284 0.0021700354592122384 1.0000000000000002
+1.2754246841105661 0.21308535079965796 0.44781653569081092
+1.5521834643091892 0.72457531588943436 0.21308535079965796
+1.8276081484197553 0.55435349976840165 0.65873185103125698
+1.9978299645407878 1.0000000000000002 1.0658434648581778
+1.997829964540788 1.0000000000000002 0.93415653514182273
+1.7869146492003418 1.5521834643091896 0.72457531588943436
+0.17239185158024495 0.55435349976840154 1.3412681489687437
+0.21308535079965796 0.44781653569081092 1.2754246841105661
+0.72457531588943436 0.21308535079965796 1.5521834643091892
+0.17239185158024495 1.4456465002315988 0.65873185103125698
+0.0021700354592122384 1.0000000000000002 1.0658434648581778
+1.3036963168239359 1.5229392818626755 1.7964314500523726
+1.2303366934291702 1.3308812944132862 1.9151298141069959
+1.0689962820007257 1.7532759752918454 1.6540755446568809
+1.2610542694501152 1.6345776112372217 1.7274351680516471
+0.73894573054988544 1.6345776112372219 1.7274351680516471
+0.93100371799927484 1.7532759752918454 1.6540755446568809
+0.76966330657083071 1.3308812944132864 1.9151298141069959
+0.69630368317606461 1.5229392818626757 1.7964314500523726
+1.1186983640546238 1.2618850124125609 1.9577718614808168
+0.88130163594537692 1.2618850124125609 1.9577718614808168
+0.88130163594537714 1.2618850124125609 0.042228138519183167
+1.1186983640546233 1.2618850124125609 0.042228138519183167
+0.6963036831760645 1.5229392818626757 0.20356854994762752
+0.7696633065708306 1.3308812944132864 0.084870185893004102
+0.93100371799927484 1.7532759752918454 0.34592445534311911
+0.73894573054988522 1.6345776112372219 0.27256483194835279
+1.2610542694501152 1.6345776112372221 0.27256483194835313
+1.0689962820007257 1.7532759752918454 0.34592445534311911
+1.2303366934291695 1.3308812944132864 0.084870185893004102
+1.3036963168239355 1.5229392818626759 0.20356854994762763
+1.3308812944132866 0.084870185893004213 1.2303366934291695
+1.5229392818626759 0.20356854994762763 1.3036963168239355
+1.2618850124125609 0.042228138519183167 0.88130163594537714
+1.2618850124125609 0.042228138519183167 1.1186983640546233
+1.5229392818626757 0.20356854994762752 0.69630368317606439
+1.3308812944132864 0.084870185893004102 0.7696633065708306
+1.7532759752918454 0.34592445534311911 0.93100371799927484
+1.6345776112372219 0.27256483194835279 0.73894573054988522
+1.6345776112372221 0.27256483194835313 1.2610542694501152
+1.7532759752918454 0.34592445534311911 1.0689962820007257
+1.7964314500523724 1.3036963168239359 1.5229392818626757
+1.9151298141069959 1.2303366934291702 1.3308812944132862
+0.042228138519183056 1.1186983640546238 0.73811498758743976
+0.042228138519183056 0.88130163594537692 0.73811498758743943
+0.34592445534311911 0.93100371799927484 1.7532759752918454
+0.27256483194835279 0.73894573054988522 1.6345776112372219
+0.36542238876277822 1.7274351680516471 1.2610542694501152
+0.24672402470815469 1.6540755446568811 1.0689962820007257
+0.88130163594537703 0.73811498758743976 1.9577718614808171
+1.1186983640546233 0.73811498758743943 1.9577718614808171
+1.7274351680516471 0.73894573054988544 1.6345776112372219
+1.6540755446568809 0.93100371799927484 1.7532759752918454
+1.6540755446568807 1.0689962820007257 1.7532759752918454
+1.7274351680516471 1.2610542694501152 1.6345776112372219
+1.7532759752918454 1.6540755446568809 1.0689962820007257
+1.6345776112372219 1.7274351680516471 1.2610542694501152
+1.5229392818626755 1.7964314500523726 1.3036963168239359
+1.3308812944132862 1.9151298141069959 1.2303366934291702
+0.73811498758743976 1.9577718614808171 0.88130163594537658
+0.73811498758743943 1.9577718614808171 1.1186983640546233
+0.66911870558671405 1.9151298141069959 1.2303366934291695
+0.47706071813732487 1.7964314500523728 1.3036963168239355
+0.084870185893004213 1.2303366934291695 1.3308812944132866
+0.20356854994762763 1.3036963168239355 1.5229392818626759
+0.27256483194835313 1.2610542694501152 1.6345776112372221
+0.34592445534311922 1.0689962820007257 1.7532759752918454
+0.6963036831760645 0.47706071813732487 1.796431450052373
+0.7696633065708306 0.66911870558671405 1.9151298141069959
+1.7274351680516471 1.2610542694501152 0.36542238876277822
+1.6540755446568811 1.0689962820007257 0.24672402470815469
+1.3036963168239362 0.47706071813732476 0.20356854994762752
+1.2303366934291702 0.66911870558671405 0.084870185893004102
+1.1186983640546238 0.73811498758743954 0.042228138519183167
+0.88130163594537692 0.73811498758743943 0.042228138519183056
+0.345924455343119 1.0689962820007257 0.24672402470815469
+0.27256483194835313 1.2610542694501152 0.36542238876277799
+0.24672402470815469 1.6540755446568811 0.93100371799927484
+0.36542238876277799 1.7274351680516471 0.73894573054988533
+0.47706071813732487 1.7964314500523728 0.6963036831760645
+0.66911870558671405 1.9151298141069959 0.76966330657083049
+1.2618850124125609 1.9577718614808168 1.1186983640546238
+1.2618850124125609 1.9577718614808168 0.88130163594537692
+1.3308812944132866 1.9151298141069959 0.76966330657083049
+1.5229392818626757 1.7964314500523726 0.69630368317606461
+1.9151298141069959 1.2303366934291695 0.66911870558671405
+1.796431450052373 1.3036963168239355 0.47706071813732487
+1.9151298141069959 0.76966330657083071 1.3308812944132864
+1.7964314500523726 0.69630368317606461 1.5229392818626757
+1.2303366934291695 0.66911870558671405 1.9151298141069959
+1.3036963168239355 0.47706071813732487 1.796431450052373
+1.2610542694501152 0.36542238876277833 1.7274351680516471
+1.0689962820007257 0.24672402470815469 1.6540755446568811
+0.47706071813732465 0.20356854994762741 1.3036963168239364
+0.66911870558671405 0.084870185893004102 1.2303366934291702
+0.73811498758743976 0.042228138519183056 1.1186983640546238
+0.73811498758743943 0.042228138519183056 0.88130163594537692
+1.0689962820007257 0.24672402470815469 0.345924455343119
+1.2610542694501152 0.36542238876277799 0.27256483194835313
+1.6540755446568811 0.93100371799927484 0.24672402470815469
+1.7274351680516471 0.73894573054988533 0.36542238876277799
+1.796431450052373 0.6963036831760645 0.47706071813732487
+1.9151298141069959 0.7696633065708306 0.66911870558671405
+1.9577718614808168 1.1186983640546238 1.2618850124125609
+1.9577718614808168 0.88130163594537692 1.2618850124125609
+1.9577718614808171 0.88130163594537703 0.73811498758743976
+1.9577718614808171 1.1186983640546233 0.73811498758743943
+1.6345776112372219 1.7274351680516471 0.73894573054988544
+1.7532759752918454 1.6540755446568809 0.93100371799927484
+0.20356854994762752 0.69630368317606439 1.5229392818626757
+0.084870185893004102 0.7696633065708306 1.3308812944132864
+0.24672402470815469 0.345924455343119 1.0689962820007257
+0.36542238876277799 0.27256483194835313 1.2610542694501152
+0.93100371799927484 0.24672402470815469 1.6540755446568811
+0.73894573054988544 0.36542238876277811 1.7274351680516471
+0.20356854994762752 1.3036963168239362 0.47706071813732454
+0.084870185893004102 1.2303366934291702 0.66911870558671405
+0.042228138519183167 0.88130163594537714 1.2618850124125609
+0.042228138519183167 1.1186983640546233 1.2618850124125609
+1.6370473838366881 1.335431727389222 1.6940145438011469
+1.5036911127293844 1.5283612117454601 1.683468867528217
+1.2724957718177854 1.8975603118185225 1.3465999725759743
+1.0699303480424984 1.8828787711788482 1.4643649661897227
+0.53136426493733957 1.7763391479810346 1.4215187719833617
+0.53952821920598959 1.6415108917233323 1.6135385194857188
+0.4378714155706992 1.1392917641443463 1.8152357076386352
+0.6454824405666123 1.1378197789939481 1.9248367469837333
+1.1212211638374883 0.86679599232656113 1.9836473564126624
+1.2413678794555163 1.0678894309514497 1.9680560789191066
+0.87877883616251229 0.86679599232656113 0.016352643587337568
+0.75863212054448437 1.0678894309514497 0.031943921080893056
+0.36295261616331198 1.335431727389222 0.30598545619885309
+0.49630888727061584 1.5283612117454606 0.31653113247178299
+0.72750422818221505 1.8975603118185227 0.65340002742402614
+0.93006965195750224 1.8828787711788482 0.53563503381027777
+1.4686357350626613 1.7763391479810342 0.5784812280166387
+1.4604717807940109 1.6415108917233325 0.38646148051428153
+1.5621285844293009 1.1392917641443463 0.18476429236136493
+1.354517559433388 1.1378197789939481 0.075163253016267029
+1.1392917641443463 0.18476429236136493 1.5621285844293009
+1.1378197789939481 0.075163253016267029 1.3545175594333883
+0.86679599232656124 0.016352643587337568 0.87877883616251229
+1.0678894309514497 0.031943921080893056 0.75863212054448437
+1.335431727389222 0.30598545619885309 0.36295261616331198
+1.5283612117454606 0.31653113247178311 0.49630888727061584
+1.8975603118185227 0.65340002742402614 0.72750422818221505
+1.8828787711788482 0.53563503381027777 0.93006965195750224
+1.7763391479810344 0.57848122801663893 1.4686357350626611
+1.6415108917233325 0.38646148051428153 1.4604717807940109
+1.6940145438011469 1.6370473838366881 1.335431727389222
+1.6834688675282168 1.5036911127293844 1.5283612117454606
+0.64548244056661241 0.86218022100605241 0.075163253016266696
+0.01635264358733779 1.1212211638374883 1.1332040076734395
+0.031943921080893167 1.2413678794555163 0.93211056904855083
+0.65340002742402614 0.72750422818221505 1.8975603118185227
+0.53563503381027777 0.93006965195750224 1.8828787711788482
+0.22366085201896613 1.421518771983362 1.4686357350626613
+0.35848910827666824 1.613538519485719 1.4604717807940111
+0.87877883616251218 1.1332040076734395 1.9836473564126624
+0.75863212054448437 0.93211056904855083 1.9680560789191071
+1.4215187719833617 0.53136426493733957 1.7763391479810346
+1.613538519485719 0.53952821920598937 1.6415108917233319
+1.3465999725759743 1.2724957718177854 1.8975603118185225
+1.4643649661897227 1.0699303480424984 1.8828787711788482
+1.8975603118185225 1.3465999725759743 1.2724957718177854
+1.8828787711788482 1.4643649661897227 1.0699303480424984
+1.335431727389222 1.6940145438011469 1.6370473838366881
+1.5283612117454601 1.683468867528217 1.5036911127293844
+1.1332040076734395 1.9836473564126622 0.87877883616251196
+0.93211056904855083 1.9680560789191068 0.75863212054448415
+0.86070823585565392 1.8152357076386347 1.5621285844293014
+0.86218022100605252 1.9248367469837331 1.3545175594333883
+0.18476429236136516 1.5621285844293014 1.1392917641443463
+0.075163253016267029 1.3545175594333883 1.1378197789939481
+0.57848122801663893 1.4686357350626611 1.7763391479810344
+0.38646148051428164 1.4604717807940109 1.6415108917233323
+0.36295261616331187 0.66456827261077822 1.6940145438011469
+0.49630888727061595 0.47163878825453998 1.6834688675282172
+1.421518771983362 1.4686357350626613 0.22366085201896613
+1.613538519485719 1.4604717807940111 0.35848910827666824
+1.6370473838366881 0.66456827261077822 0.30598545619885309
+1.5036911127293848 0.47163878825453998 0.31653113247178311
+1.1212211638374883 1.1332040076734395 0.01635264358733779
+1.2413678794555163 0.93211056904855083 0.031943921080893167
+0.65340002742402614 1.2724957718177854 0.10243968818147742
+0.53563503381027766 1.0699303480424984 0.11712122882115172
+0.10243968818147742 1.3465999725759745 0.72750422818221494
+0.11712122882115195 1.4643649661897229 0.93006965195750224
+0.66456827261077822 1.6940145438011469 0.36295261616331187
+0.47163878825453998 1.6834688675282172 0.49630888727061595
+0.86679599232656124 1.9836473564126624 1.1212211638374883
+1.0678894309514497 1.9680560789191066 1.2413678794555163
+1.1392917641443463 1.8152357076386352 0.4378714155706992
+1.1378197789939481 1.9248367469837331 0.64548244056661219
+1.8152357076386347 1.5621285844293014 0.86070823585565392
+1.9248367469837331 1.3545175594333883 0.86218022100605252
+1.8152357076386352 0.4378714155706992 1.1392917641443463
+1.9248367469837333 0.6454824405666123 1.1378197789939481
+1.5621285844293014 0.86070823585565392 1.8152357076386347
+1.3545175594333883 0.86218022100605252 1.9248367469837331
+1.4686357350626613 0.22366085201896613 1.421518771983362
+1.4604717807940111 0.35848910827666824 1.613538519485719
+0.66456827261077822 0.30598545619885309 1.6370473838366881
+0.47163878825453986 0.31653113247178322 1.5036911127293848
+1.1332040076734395 0.01635264358733779 1.1212211638374883
+0.93211056904855083 0.031943921080893167 1.2413678794555163
+1.2724957718177854 0.10243968818147742 0.65340002742402614
+1.0699303480424984 0.11712122882115172 0.53563503381027766
+1.3465999725759745 0.72750422818221494 0.10243968818147742
+1.4643649661897227 0.93006965195750224 0.11712122882115183
+1.6940145438011469 0.36295261616331198 0.66456827261077822
+1.6834688675282172 0.49630888727061595 0.47163878825453998
+1.9836473564126624 1.1212211638374883 0.86679599232656124
+1.9680560789191066 1.2413678794555163 1.0678894309514497
+1.9836473564126624 0.87877883616251229 1.1332040076734395
+1.9680560789191071 0.75863212054448437 0.93211056904855083
+1.7763391479810346 1.4215187719833617 0.53136426493733957
+1.6415108917233319 1.613538519485719 0.53952821920598937
+0.86218022100605241 0.075163253016266696 0.64548244056661241
+0.075163253016266696 0.6454824405666123 0.86218022100605241
+0.30598545619885309 0.36295261616331198 1.335431727389222
+0.31653113247178311 0.49630888727061584 1.5283612117454606
+0.10243968818147742 0.65340002742402614 1.2724957718177854
+0.11712122882115172 0.53563503381027766 1.0699303480424984
+0.72750422818221494 0.10243968818147742 1.3465999725759745
+0.93006965195750224 0.11712122882115183 1.4643649661897227
+0.30598545619885309 1.6370473838366881 0.66456827261077822
+0.31653113247178322 1.5036911127293848 0.47163878825453964
+0.016352643587337568 0.87877883616251229 0.86679599232656124
+0.031943921080893056 0.75863212054448437 1.0678894309514497
+1.1318385030170197 1.6666951227028342 1.7335776867425046
+1.099757165525981 1.4952588380279241 1.8629989520743653
+1.1212211638374885 1.1332040076734393 1.9836473564126622
+1.3545175594333883 1.1378197789939481 1.9248367469837331
+0.86816149698298051 1.6666951227028339 1.7335776867425046
+1.0616533189164057 1.5950160035539049 1.8013456331579596
+1.4215187719833615 1.4686357350626609 1.7763391479810346
+1.4604717807940113 1.6415108917233316 1.6135385194857188
+0.78668082109255699 1.453375943795391 1.8654161897595243
+0.93834668108359465 1.5950160035539049 1.8013456331579598
+1.1392917641443467 1.815235707638635 1.5621285844293009
+0.93006965195750202 1.8828787711788482 1.4643649661897225
+1 1.3215374407783715 1.9468968656499477
+0.9002428344740192 1.4952588380279237 1.8629989520743653
+0.66456827261077844 1.6940145438011469 1.6370473838366881
+0.49630888727061606 1.5283612117454606 1.6834688675282172
+1.2133191789074431 1.4533759437953908 1.8654161897595243
+1.0000000000000002 1.4336055191115187 1.9011027986839406
+0.65340002742402636 1.2724957718177858 1.8975603118185225
+0.75863212054448415 1.0678894309514502 1.9680560789191068
+0.78668082109255688 1.453375943795391 0.13458381024047572
+1 1.4336055191115187 0.09889720131605928
+1.3465999725759743 1.2724957718177858 0.10243968818147775
+1.2413678794555163 1.0678894309514502 0.031943921080893389
+0.86816149698298051 1.6666951227028342 0.26642231325749555
+0.9002428344740192 1.4952588380279244 0.13700104792563483
+0.87877883616251229 1.1332040076734393 0.016352643587337568
+0.64548244056661241 1.1378197789939481 0.075163253016266696
+1.1318385030170197 1.6666951227028342 0.26642231325749555
+0.93834668108359476 1.5950160035539049 0.19865436684204019
+0.57848122801663848 1.4686357350626613 0.22366085201896579
+0.53952821920598926 1.6415108917233321 0.3864614805142812
+1.2133191789074438 1.453375943795391 0.13458381024047594
+1.0616533189164057 1.5950160035539047 0.19865436684204019
+0.86070823585565392 1.8152357076386352 0.4378714155706992
+1.0699303480424984 1.8828787711788482 0.53563503381027788
+1.0000000000000002 1.3215374407783713 0.053103134350052095
+1.0997571655259812 1.4952588380279237 0.13700104792563461
+1.335431727389222 1.6940145438011469 0.3629526161633122
+1.5036911127293848 1.5283612117454606 0.31653113247178333
+1.3215374407783713 0.053103134350052095 1.0000000000000002
+1.4952588380279237 0.13700104792563472 1.0997571655259812
+1.6940145438011469 0.3629526161633122 1.335431727389222
+1.5283612117454606 0.31653113247178333 1.5036911127293848
+1.453375943795391 0.13458381024047572 0.78668082109255688
+1.4336055191115187 0.09889720131605928 1
+1.2724957718177858 0.10243968818147775 1.3465999725759745
+1.0678894309514502 0.031943921080893389 1.2413678794555163
+1.6666951227028344 0.26642231325749555 0.86816149698298051
+1.4952588380279244 0.13700104792563483 0.9002428344740192
+1.1332040076734393 0.016352643587337568 0.87877883616251229
+1.1378197789939481 0.075163253016266696 0.64548244056661241
+1.6666951227028342 0.26642231325749555 1.1318385030170197
+1.5950160035539049 0.19865436684204019 0.93834668108359476
+1.4686357350626613 0.22366085201896579 0.57848122801663837
+1.6415108917233321 0.3864614805142812 0.53952821920598926
+1.4533759437953913 0.13458381024047605 1.2133191789074438
+1.5950160035539052 0.19865436684204041 1.0616533189164057
+1.8152357076386352 0.4378714155706992 0.86070823585565392
+1.8828787711788482 0.53563503381027788 1.0699303480424984
+1.7335776867425046 1.1318385030170197 1.6666951227028342
+1.8629989520743653 1.099757165525981 1.4952588380279241
+1.9836473564126622 1.1212211638374885 1.1332040076734393
+1.9248367469837331 1.3545175594333883 1.1378197789939481
+1 0.67846255922162868 0.053103134350052095
+0.13458381024047572 1.2133191789074433 0.54662405620460941
+0.098897201316059169 1.0000000000000002 0.56639448088848177
+0.031943921080893167 0.75863212054448415 0.9321105690485505
+0.26642231325749555 1.1318385030170197 1.6666951227028342
+0.19865436684204019 0.93834668108359476 1.5950160035539049
+0.22366085201896579 0.57848122801663837 1.4686357350626613
+0.3864614805142812 0.53952821920598926 1.6415108917233321
+0.54662405620460952 1.8654161897595243 1.2133191789074438
+0.40498399644609528 1.8013456331579598 1.0616533189164057
+0.18476429236136493 1.5621285844293009 0.86070823585565404
+0.11712122882115183 1.4643649661897227 1.0699303480424984
+0.78668082109255699 0.54662405620460941 1.8654161897595245
+1 0.56639448088848177 1.9011027986839408
+1.3465999725759743 0.72750422818221505 1.8975603118185225
+1.2413678794555165 0.9321105690485505 1.9680560789191066
+1.8654161897595243 0.78668082109255699 1.453375943795391
+1.8013456331579594 0.93834668108359476 1.5950160035539054
+1.5621285844293009 1.1392917641443467 1.815235707638635
+1.4643649661897225 0.93006965195750202 1.8828787711788482
+1.7335776867425046 0.86816149698298051 1.6666951227028339
+1.8013456331579596 1.0616533189164057 1.5950160035539049
+1.7763391479810346 1.4215187719833615 1.4686357350626609
+1.6135385194857188 1.4604717807940106 1.6415108917233323
+1.6666951227028339 1.7335776867425046 0.86816149698298051
+1.5950160035539049 1.8013456331579596 1.0616533189164057
+1.4686357350626609 1.7763391479810346 1.4215187719833615
+1.6415108917233321 1.6135385194857186 1.4604717807940111
+1.6666951227028342 1.7335776867425046 1.1318385030170197
+1.4952588380279241 1.8629989520743653 1.099757165525981
+1.1332040076734391 1.9836473564126622 1.1212211638374885
+1.1378197789939481 1.9248367469837331 1.3545175594333883
+0.54662405620460952 1.8654161897595243 0.78668082109255688
+0.56639448088848177 1.9011027986839408 1
+0.72750422818221505 1.8975603118185225 1.3465999725759743
+0.9321105690485505 1.9680560789191066 1.2413678794555165
+0.67846255922162868 1.9468968656499477 1.0000000000000002
+0.5047411619720763 1.8629989520743653 1.0997571655259812
+0.30598545619885331 1.6370473838366881 1.335431727389222
+0.47163878825454009 1.6834688675282172 1.5036911127293844
+0.053103134350052095 1.0000000000000002 1.3215374407783713
+0.13700104792563472 1.0997571655259812 1.4952588380279237
+0.3629526161633122 1.335431727389222 1.6940145438011469
+0.31653113247178344 1.5036911127293846 1.5283612117454608
+0.13458381024047605 1.2133191789074438 1.4533759437953913
+0.19865436684204008 1.0616533189164057 1.5950160035539049
+0.43787141557069909 0.86070823585565392 1.8152357076386352
+0.53563503381027788 1.0699303480424984 1.8828787711788482
+0.86816149698298051 0.33330487729716585 1.7335776867425046
+0.9002428344740192 0.50474116197207619 1.8629989520743653
+0.87877883616251218 0.86679599232656135 1.9836473564126624
+0.64548244056661219 0.86218022100605274 1.9248367469837333
+1.8654161897595243 1.2133191789074438 0.54662405620460952
+1.8013456331579596 1.0616533189164057 0.40498399644609495
+1.5621285844293009 0.86070823585565404 0.18476429236136482
+1.4643649661897227 1.0699303480424984 0.11712122882115183
+1.1318385030170197 0.33330487729716562 0.26642231325749555
+1.0997571655259812 0.50474116197207608 0.13700104792563472
+1.1212211638374885 0.86679599232656113 0.016352643587337568
+1.3545175594333883 0.86218022100605274 0.075163253016266807
+1.2133191789074433 0.54662405620460941 0.13458381024047572
+1.0000000000000002 0.56639448088848177 0.098897201316059169
+0.75863212054448437 0.9321105690485505 0.031943921080893056
+0.43787141557069942 1.1392917641443465 0.18476429236136482
+0.53563503381027777 0.93006965195750191 0.11712122882115172
+0.19865436684204019 1.0616533189164057 0.40498399644609517
+0.22366085201896579 1.4215187719833617 0.53136426493733901
+0.3864614805142812 1.4604717807940109 0.35848910827666791
+0.33330487729716596 1.7335776867425046 1.1318385030170197
+0.40498399644609495 1.8013456331579598 0.93834668108359465
+0.53136426493733957 1.7763391479810346 0.5784812280166387
+0.35848910827666813 1.613538519485719 0.53952821920598937
+0.33330487729716574 1.7335776867425046 0.86816149698298051
+0.50474116197207619 1.8629989520743653 0.9002428344740192
+0.86679599232656135 1.9836473564126624 0.87877883616251218
+0.86218022100605274 1.9248367469837333 0.64548244056661219
+1.4533759437953908 1.8654161897595243 1.2133191789074431
+1.4336055191115187 1.9011027986839406 1.0000000000000002
+1.2724957718177858 1.8975603118185225 0.65340002742402592
+1.0678894309514502 1.9680560789191066 0.75863212054448392
+1.3215374407783715 1.9468968656499477 1
+1.4952588380279237 1.8629989520743653 0.9002428344740192
+1.6940145438011469 1.6370473838366881 0.66456827261077844
+1.5283612117454606 1.6834688675282172 0.49630888727061606
+1.9468968656499477 1.0000000000000002 0.67846255922162868
+1.8629989520743653 1.0997571655259812 0.5047411619720763
+1.6370473838366881 1.335431727389222 0.30598545619885331
+1.6834688675282172 1.5036911127293844 0.47163878825454009
+1.9468968656499477 1 1.3215374407783715
+1.8629989520743653 0.9002428344740192 1.4952588380279237
+1.6370473838366881 0.66456827261077844 1.6940145438011469
+1.6834688675282172 0.49630888727061606 1.5283612117454606
+1.0000000000000002 0.67846255922162868 1.9468968656499477
+1.0997571655259812 0.50474116197207619 1.8629989520743653
+1.335431727389222 0.30598545619885331 1.6370473838366881
+1.5036911127293844 0.47163878825454009 1.6834688675282172
+1.2133191789074438 0.54662405620460952 1.8654161897595243
+1.0616533189164057 0.40498399644609495 1.8013456331579596
+0.86070823585565404 0.18476429236136493 1.5621285844293009
+1.0699303480424984 0.11712122882115183 1.4643649661897227
+0.33330487729716562 0.26642231325749555 1.1318385030170197
+0.50474116197207608 0.13700104792563472 1.0997571655259812
+0.86679599232656146 0.016352643587337568 1.1212211638374885
+0.86218022100605274 0.075163253016266807 1.3545175594333883
+0.5466240562046093 0.13458381024047572 1.2133191789074433
+0.56639448088848177 0.098897201316059169 1.0000000000000002
+0.9321105690485505 0.031943921080893056 0.75863212054448437
+1.1392917641443465 0.18476429236136482 0.43787141557069942
+0.93006965195750191 0.11712122882115172 0.53563503381027777
+1.0616533189164057 0.40498399644609517 0.19865436684204019
+1.421518771983362 0.53136426493733913 0.22366085201896568
+1.4604717807940109 0.35848910827666791 0.38646148051428109
+1.7335776867425046 1.1318385030170197 0.33330487729716596
+1.8013456331579598 0.93834668108359465 0.40498399644609495
+1.7763391479810346 0.5784812280166387 0.53136426493733957
+1.613538519485719 0.53952821920598926 0.35848910827666802
+1.7335776867425046 0.86816149698298051 0.33330487729716574
+1.8629989520743653 0.9002428344740192 0.50474116197207619
+1.9836473564126624 0.87877883616251218 0.86679599232656135
+1.9248367469837333 0.64548244056661219 0.86218022100605274
+1.8654161897595243 1.2133191789074431 1.4533759437953908
+1.9011027986839406 1.0000000000000002 1.4336055191115187
+1.8975603118185225 0.65340002742402636 1.2724957718177858
+1.9680560789191066 0.75863212054448415 1.0678894309514502
+1.8654161897595245 0.78668082109255699 0.54662405620460941
+1.9011027986839408 1 0.56639448088848177
+1.8975603118185225 1.3465999725759743 0.72750422818221505
+1.9680560789191066 1.2413678794555165 0.9321105690485505
+1.453375943795391 1.8654161897595241 0.78668082109255688
+1.5950160035539054 1.8013456331579594 0.93834668108359476
+1.815235707638635 1.5621285844293009 1.1392917641443467
+1.8828787711788482 1.4643649661897225 0.93006965195750202
+0.67846255922162868 0.053103134350052095 1
+0.053103134350052095 1 0.67846255922162868
+0.18476429236136482 0.43787141557069942 1.1392917641443465
+0.11712122882115172 0.53563503381027777 0.93006965195750191
+0.26642231325749555 0.86816149698298051 1.6666951227028344
+0.13700104792563483 0.9002428344740192 1.4952588380279244
+0.016352643587337568 0.87877883616251229 1.1332040076734393
+0.075163253016266807 0.64548244056661219 1.1378197789939481
+0.40498399644609517 0.19865436684204019 1.0616533189164057
+0.53136426493733913 0.22366085201896568 1.421518771983362
+0.35848910827666802 0.3864614805142812 1.4604717807940109
+1.1318385030170197 0.33330487729716596 1.7335776867425046
+0.93834668108359465 0.40498399644609495 1.8013456331579598
+0.5784812280166387 0.53136426493733957 1.7763391479810346
+0.53952821920598926 0.35848910827666802 1.613538519485719
+0.26642231325749555 1.1318385030170197 0.33330487729716562
+0.13700104792563472 1.0997571655259812 0.50474116197207608
+0.016352643587337568 1.1212211638374885 0.86679599232656146
+0.075163253016266807 1.3545175594333883 0.86218022100605274
+0.13458381024047572 0.78668082109255688 1.453375943795391
+0.09889720131605928 1 1.4336055191115187
+0.10243968818147775 1.3465999725759745 1.2724957718177858
+0.031943921080893389 1.2413678794555165 1.0678894309514502
+1.5257938275259753 1.2082874004879671 1.8247164420172246
+1.6144698341819117 1.2728788208449453 1.7402458861856145
+1.4063294025426432 1.7843712383737107 1.4686770498343504
+1.3392409609172167 1.8623045076538935 1.3759607778954341
+0.72533155387381609 1.8657421844304007 1.4183870394745819
+0.59519261004110291 1.8217822259851766 1.4010049252683978
+0.4239161621142562 1.3399483569044259 1.7433454959605346
+0.41057431319105175 1.2073123918032649 1.7807681678543315
+0.91862905394330996 0.93361895436178299 1.9944708773603259
+1.0405222816687172 0.86807143088604788 1.9904306120773461
+1.0813709460566903 0.9336189543617831 0.0055291226396741999
+0.95947771833128337 0.86807143088604799 0.009569387922653938
+0.47420617247402497 1.2082874004879671 0.17528355798277517
+0.38553016581808797 1.2728788208449453 0.25975411381438551
+0.5936705974573574 1.7843712383737111 0.53132295016564957
+0.66075903908278344 1.8623045076538935 0.6240392221045663
+1.2746684461261846 1.8657421844304007 0.58161296052541855
+1.4048073899588978 1.8217822259851766 0.59899507473160241
+1.576083837885744 1.3399483569044259 0.25665450403946566
+1.5894256868089485 1.2073123918032649 0.21923183214566877
+1.3399483569044259 0.25665450403946566 1.576083837885744
+1.2073123918032649 0.21923183214566899 1.5894256868089485
+0.9336189543617831 0.0055291226396743109 1.0813709460566903
+0.86807143088604799 0.009569387922653938 0.95947771833128337
+1.2082874004879671 0.17528355798277517 0.47420617247402497
+1.2728788208449453 0.25975411381438551 0.38553016581808797
+1.7843712383737111 0.53132295016564979 0.5936705974573574
+1.8623045076538935 0.6240392221045663 0.66075903908278344
+1.8657421844304007 0.58161296052541855 1.2746684461261846
+1.8217822259851766 0.59899507473160263 1.4048073899588975
+1.8247164420172246 1.5257938275259753 1.2082874004879671
+1.7402458861856145 1.6144698341819117 1.2728788208449453
+0.0055291226396741999 0.91862905394330996 1.0663810456382175
+0.009569387922654049 1.0405222816687172 1.1319285691139529
+0.53132295016564979 0.5936705974573574 1.7843712383737111
+0.6240392221045663 0.66075903908278344 1.8623045076538935
+0.13425781556959937 1.4183870394745819 1.2746684461261846
+0.17821777401482364 1.401004925268398 1.4048073899588978
+1.0813709460566905 1.0663810456382177 1.9944708773603259
+0.95947771833128326 1.1319285691139529 1.9904306120773461
+1.4183870394745819 0.72533155387381609 1.8657421844304007
+1.4010049252683978 0.59519261004110291 1.8217822259851766
+1.4686770498343504 1.4063294025426432 1.7843712383737107
+1.3759607778954341 1.3392409609172167 1.8623045076538935
+1.7843712383737107 1.4686770498343504 1.4063294025426432
+1.8623045076538935 1.3759607778954341 1.3392409609172167
+1.2082874004879671 1.8247164420172246 1.5257938275259753
+1.2728788208449453 1.7402458861856145 1.6144698341819117
+1.0663810456382175 1.9944708773603257 1.0813709460566903
+1.1319285691139529 1.9904306120773461 0.95947771833128304
+0.66005164309557451 1.7433454959605346 1.576083837885744
+0.79268760819673556 1.7807681678543315 1.5894256868089485
+0.25665450403946555 1.576083837885744 1.3399483569044259
+0.21923183214566888 1.5894256868089487 1.2073123918032649
+0.58161296052541855 1.2746684461261846 1.8657421844304007
+0.59899507473160263 1.4048073899588975 1.8217822259851766
+0.47420617247402475 0.79171259951203332 1.8247164420172246
+0.38553016581808797 0.72712117915505492 1.7402458861856145
+1.4183870394745819 1.2746684461261846 0.13425781556959937
+1.401004925268398 1.4048073899588978 0.17821777401482353
+1.5257938275259753 0.79171259951203343 0.17528355798277517
+1.6144698341819119 0.72712117915505481 0.25975411381438529
+0.91862905394330996 1.0663810456382175 0.0055291226396743109
+1.0405222816687172 1.1319285691139529 0.009569387922654049
+0.53132295016564979 1.4063294025426434 0.2156287616262893
+0.6240392221045663 1.3392409609172167 0.13769549234610656
+0.21562876162628952 1.4686770498343509 0.59367059745735706
+0.13769549234610656 1.3759607778954341 0.66075903908278333
+0.79171259951203332 1.8247164420172246 0.47420617247402475
+0.72712117915505492 1.7402458861856145 0.38553016581808797
+0.9336189543617831 1.9944708773603257 0.91862905394330985
+0.86807143088604799 1.9904306120773461 1.0405222816687167
+1.3399483569044259 1.7433454959605346 0.4239161621142562
+1.2073123918032649 1.7807681678543315 0.41057431319105175
+1.7433454959605346 1.576083837885744 0.66005164309557451
+1.7807681678543315 1.5894256868089485 0.79268760819673556
+1.7433454959605346 0.4239161621142562 1.3399483569044259
+1.7807681678543315 0.41057431319105175 1.2073123918032649
+1.576083837885744 0.66005164309557451 1.7433454959605346
+1.5894256868089485 0.79268760819673556 1.7807681678543315
+1.2746684461261846 0.13425781556959937 1.4183870394745819
+1.4048073899588978 0.17821777401482364 1.401004925268398
+0.79171259951203343 0.17528355798277517 1.5257938275259753
+0.72712117915505481 0.25975411381438529 1.6144698341819119
+1.0663810456382175 0.0055291226396741999 0.91862905394330996
+1.1319285691139529 0.009569387922654049 1.0405222816687172
+1.4063294025426436 0.21562876162628952 0.53132295016564968
+1.3392409609172167 0.13769549234610656 0.6240392221045663
+1.4686770498343509 0.59367059745735729 0.21562876162628941
+1.3759607778954341 0.66075903908278333 0.13769549234610656
+1.8247164420172246 0.47420617247402475 0.79171259951203332
+1.7402458861856145 0.38553016581808797 0.72712117915505492
+1.9944708773603259 0.91862905394330996 0.9336189543617831
+1.9904306120773461 1.0405222816687172 0.86807143088604799
+1.9944708773603259 1.0813709460566905 1.0663810456382177
+1.9904306120773461 0.95947771833128337 1.1319285691139529
+1.8657421844304007 1.4183870394745819 0.72533155387381609
+1.8217822259851766 1.4010049252683978 0.59519261004110291
+0.17528355798277517 0.47420617247402497 1.2082874004879671
+0.25975411381438551 0.38553016581808797 1.2728788208449453
+0.21562876162628952 0.53132295016564968 1.4063294025426436
+0.13769549234610656 0.6240392221045663 1.3392409609172167
+0.59367059745735729 0.21562876162628941 1.4686770498343509
+0.66075903908278333 0.13769549234610656 1.3759607778954341
+0.17528355798277517 1.5257938275259753 0.79171259951203343
+0.25975411381438529 1.6144698341819119 0.72712117915505481
+0.0055291226396743109 1.0813709460566903 0.9336189543617831
+0.009569387922653938 0.95947771833128337 0.86807143088604799
+1.3283955572053112 1.6406145370870959 1.694096083320241
+1.2001281403434438 1.6801807185069526 1.7051970771451344
+1.0777044036438097 1.3227105890477233 1.943302656293743
+1.0802812773502413 1.1973935260228461 1.9770315820848792
+0.93025980236669126 1.8004723406749188 1.5952985273360616
+0.86416377447305925 1.7199153070653639 1.6806397508870439
+1.2345849586062214 1.5157160292432703 1.8240187342392598
+1.3536293529417165 1.4655650436231658 1.8112924693932408
+0.62850263027516928 1.5277725269342672 1.7638362809535502
+0.71592045537741122 1.4603930887008656 1.8410333026720758
+1.0672770740243225 1.7022770253220765 1.7087176976875216
+1.1382736821873727 1.7695778385021763 1.6234022291431622
+0.84014219641217736 1.1993769697289565 1.9667958970608925
+0.96026541144158839 1.2602649483574222 1.9647192955096329
+0.80699455980445267 1.624572621678267 1.7567416602149373
+0.73182848239968057 1.6892965611519348 1.6730187872058688
+1.2726998137406516 1.2691171673622652 1.9236940845413728
+1.2595222183644983 1.3961011738843632 1.8807678912304873
+0.81343900392119473 1.3899876630720456 1.9017231378830692
+0.69598720512098988 1.3356672082102183 1.8915737467434823
+0.72730018625934878 1.2691171673622652 0.076305915458627194
+0.74047778163550204 1.3961011738843632 0.11923210876951273
+1.1865609960788057 1.3899876630720458 0.098276862116930985
+1.3040127948790103 1.3356672082102183 0.108426253256518
+0.671604442794689 1.6406145370870961 0.30590391667975902
+0.79987185965655661 1.6801807185069528 0.29480292285486565
+0.92229559635619074 1.3227105890477233 0.056697343706257008
+0.91971872264975907 1.1973935260228461 0.022968417915120942
+1.069740197633309 1.800472340674919 0.40470147266393852
+1.135836225526941 1.7199153070653639 0.31936024911295646
+0.76541504139377881 1.5157160292432705 0.17598126576074025
+0.64637064705828351 1.4655650436231658 0.18870753060675938
+1.3714973697248309 1.5277725269342675 0.23616371904645017
+1.2840795446225894 1.4603930887008656 0.15896669732792434
+0.93272292597567807 1.7022770253220765 0.29128230231247854
+0.86172631781262787 1.7695778385021763 0.37659777085683765
+1.1598578035878229 1.1993769697289562 0.033204102939107583
+1.0397345885584115 1.2602649483574222 0.035280704490367243
+1.1930054401955479 1.6245726216782668 0.24325833978506295
+1.2681715176003199 1.689296561151935 0.32698121279413161
+1.1993769697289562 0.033204102939107583 1.1598578035878229
+1.2602649483574222 0.035280704490367243 1.0397345885584115
+1.6245726216782668 0.24325833978506295 1.1930054401955479
+1.689296561151935 0.32698121279413161 1.2681715176003199
+1.2691171673622652 0.076305915458627194 0.72730018625934878
+1.3961011738843634 0.11923210876951285 0.74047778163550193
+1.3899876630720458 0.098276862116930763 1.1865609960788057
+1.3356672082102183 0.108426253256518 1.3040127948790106
+1.6406145370870964 0.30590391667975914 0.67160444279468889
+1.6801807185069528 0.29480292285486565 0.79987185965655661
+1.3227105890477233 0.056697343706257008 0.92229559635619074
+1.1973935260228461 0.022968417915120942 0.91971872264975907
+1.800472340674919 0.40470147266393852 1.069740197633309
+1.7199153070653639 0.31936024911295646 1.135836225526941
+1.5157160292432708 0.17598126576074047 0.76541504139377869
+1.465565043623166 0.18870753060675916 0.64637064705828351
+1.5277725269342675 0.23616371904645017 1.3714973697248309
+1.4603930887008658 0.15896669732792457 1.2840795446225894
+1.7022770253220765 0.29128230231247854 0.93272292597567807
+1.7695778385021763 0.37659777085683765 0.86172631781262787
+1.694096083320241 1.3283955572053112 1.6406145370870959
+1.7051970771451344 1.2001281403434438 1.6801807185069526
+1.9433026562937428 1.0777044036438097 1.3227105890477233
+1.9770315820848792 1.0802812773502413 1.1973935260228461
+0.84014219641217736 0.80062303027104398 0.033204102939107361
+0.96026541144158839 0.73973505164257791 0.035280704490367243
+0.076305915458627194 1.2726998137406516 0.73088283263773501
+0.11923210876951296 1.2595222183644985 0.60389882611563694
+0.40470147266393852 1.069740197633309 1.800472340674919
+0.31936024911295646 1.135836225526941 1.7199153070653639
+0.17598126576074047 0.76541504139377869 1.5157160292432708
+0.18870753060675916 0.64637064705828351 1.465565043623166
+0.47222747306573287 1.7638362809535502 1.3714973697248309
+0.53960691129913463 1.8410333026720758 1.2840795446225892
+0.29772297467792341 1.7087176976875216 0.93272292597567807
+0.23042216149782357 1.6234022291431622 0.86172631781262776
+0.72730018625934878 0.73088283263773501 1.9236940845413728
+0.74047778163550215 0.60389882611563706 1.8807678912304873
+1.1865609960788057 0.61001233692795442 1.9017231378830692
+1.3040127948790103 0.66433279178978188 1.8915737467434823
+1.7638362809535502 0.62850263027516928 1.5277725269342672
+1.8410333026720758 0.71592045537741122 1.4603930887008656
+1.7087176976875216 1.0672770740243225 1.7022770253220765
+1.6234022291431622 1.1382736821873727 1.7695778385021765
+1.5952985273360616 0.93025980236669126 1.8004723406749188
+1.6806397508870439 0.86416377447305925 1.7199153070653639
+1.8240187342392593 1.2345849586062214 1.5157160292432708
+1.8112924693932408 1.3536293529417165 1.4655650436231658
+1.8004723406749188 1.5952985273360616 0.93025980236669126
+1.7199153070653639 1.6806397508870439 0.86416377447305925
+1.5157160292432703 1.8240187342392598 1.2345849586062214
+1.4655650436231658 1.8112924693932408 1.3536293529417165
+1.6406145370870959 1.694096083320241 1.3283955572053112
+1.6801807185069526 1.7051970771451344 1.2001281403434438
+1.3227105890477233 1.9433026562937428 1.0777044036438097
+1.1973935260228461 1.9770315820848792 1.0802812773502413
+0.73088283263773501 1.9236940845413728 0.72730018625934867
+0.60389882611563706 1.8807678912304873 0.74047778163550215
+0.61001233692795442 1.9017231378830692 1.1865609960788057
+0.66433279178978188 1.8915737467434823 1.3040127948790103
+0.80062303027104398 1.9667958970608925 1.1598578035878231
+0.73973505164257791 1.9647192955096329 1.0397345885584115
+0.37542737832173323 1.7567416602149373 1.1930054401955479
+0.31070343884806517 1.6730187872058688 1.2681715176003199
+0.033204102939107583 1.1598578035878229 1.1993769697289562
+0.035280704490367243 1.0397345885584115 1.2602649483574222
+0.24325833978506295 1.1930054401955479 1.6245726216782668
+0.32698121279413161 1.2681715176003199 1.6892965611519353
+0.23616371904645039 1.3714973697248309 1.5277725269342679
+0.15896669732792457 1.2840795446225894 1.4603930887008658
+0.29128230231247854 0.93272292597567807 1.7022770253220765
+0.37659777085683765 0.86172631781262787 1.7695778385021763
+0.67160444279468889 0.35938546291290396 1.694096083320241
+0.79987185965655649 0.3198192814930475 1.7051970771451346
+0.92229559635619063 0.67728941095227657 1.943302656293743
+0.91971872264975907 0.80260647397715423 1.9770315820848792
+1.7638362809535502 1.3714973697248309 0.47222747306573287
+1.8410333026720758 1.2840795446225892 0.53960691129913463
+1.7087176976875216 0.93272292597567807 0.29772297467792341
+1.6234022291431622 0.86172631781262776 0.23042216149782357
+1.3283955572053112 0.35938546291290407 0.30590391667975902
+1.2001281403434438 0.3198192814930475 0.29480292285486553
+1.0777044036438097 0.67728941095227668 0.056697343706257008
+1.0802812773502413 0.80260647397715423 0.022968417915120942
+1.2726998137406516 0.73088283263773501 0.076305915458627194
+1.2595222183644985 0.60389882611563694 0.11923210876951296
+0.29128230231247842 1.0672770740243225 0.29772297467792341
+0.37659777085683765 1.1382736821873727 0.23042216149782369
+0.17598126576074047 1.2345849586062214 0.48428397075672935
+0.18870753060675916 1.3536293529417167 0.53443495637683425
+0.19952765932508121 1.5952985273360616 1.069740197633309
+0.28008469293463611 1.6806397508870439 1.135836225526941
+0.48428397075672935 1.8240187342392595 0.76541504139377881
+0.53443495637683458 1.8112924693932411 0.64637064705828351
+0.35938546291290396 1.694096083320241 0.67160444279468889
+0.3198192814930475 1.7051970771451346 0.79987185965655649
+0.67728941095227657 1.943302656293743 0.92229559635619063
+0.80260647397715434 1.9770315820848792 0.91971872264975896
+1.2691171673622652 1.9236940845413728 1.2726998137406516
+1.3961011738843632 1.8807678912304873 1.2595222183644983
+1.3899876630720458 1.9017231378830692 0.8134390039211945
+1.3356672082102183 1.8915737467434819 0.69598720512098966
+1.1993769697289565 1.9667958970608925 0.84014219641217713
+1.2602649483574222 1.9647192955096329 0.96026541144158839
+1.624572621678267 1.7567416602149373 0.80699455980445267
+1.6892965611519348 1.6730187872058688 0.73182848239968057
+1.9667958970608925 1.1598578035878231 0.80062303027104387
+1.9647192955096329 1.0397345885584115 0.73973505164257791
+1.7567416602149373 1.1930054401955479 0.37542737832173323
+1.6730187872058688 1.2681715176003199 0.31070343884806517
+1.9667958970608925 0.84014219641217736 1.1993769697289565
+1.9647192955096329 0.96026541144158839 1.2602649483574222
+1.7567416602149373 0.80699455980445267 1.624572621678267
+1.6730187872058688 0.73182848239968057 1.6892965611519348
+1.1598578035878231 0.80062303027104387 1.9667958970608925
+1.0397345885584115 0.73973505164257791 1.9647192955096329
+1.1930054401955479 0.37542737832173323 1.7567416602149373
+1.2681715176003199 0.31070343884806517 1.6730187872058688
+1.3714973697248309 0.47222747306573287 1.7638362809535502
+1.2840795446225892 0.53960691129913463 1.8410333026720758
+0.93272292597567807 0.29772297467792341 1.7087176976875216
+0.86172631781262776 0.23042216149782357 1.6234022291431622
+0.35938546291290407 0.30590391667975902 1.3283955572053112
+0.3198192814930475 0.29480292285486553 1.2001281403434438
+0.67728941095227668 0.056697343706257008 1.0777044036438097
+0.80260647397715423 0.022968417915120942 1.0802812773502413
+0.73088283263773501 0.076305915458627194 1.2726998137406516
+0.60389882611563683 0.11923210876951296 1.2595222183644985
+1.0672770740243225 0.29772297467792341 0.29128230231247842
+1.1382736821873727 0.23042216149782369 0.37659777085683765
+1.2345849586062214 0.48428397075672935 0.17598126576074047
+1.3536293529417167 0.53443495637683447 0.18870753060675904
+1.5952985273360616 1.069740197633309 0.19952765932508121
+1.6806397508870439 1.135836225526941 0.28008469293463611
+1.8240187342392595 0.76541504139377881 0.48428397075672935
+1.8112924693932411 0.64637064705828351 0.53443495637683458
+1.694096083320241 0.67160444279468889 0.35938546291290396
+1.7051970771451346 0.79987185965655649 0.3198192814930475
+1.943302656293743 0.92229559635619063 0.67728941095227657
+1.9770315820848792 0.91971872264975918 0.80260647397715434
+1.9236940845413728 1.2726998137406516 1.2691171673622652
+1.8807678912304873 1.2595222183644983 1.3961011738843632
+1.9017231378830692 0.81343900392119473 1.3899876630720456
+1.8915737467434823 0.69598720512098988 1.3356672082102183
+1.9236940845413728 0.72730018625934878 0.73088283263773501
+1.8807678912304873 0.74047778163550215 0.60389882611563706
+1.9017231378830692 1.1865609960788057 0.61001233692795442
+1.8915737467434823 1.3040127948790103 0.66433279178978188
+1.5277725269342675 1.7638362809535499 0.62850263027516917
+1.4603930887008656 1.8410333026720758 0.71592045537741122
+1.7022770253220765 1.7087176976875216 1.0672770740243225
+1.7695778385021763 1.6234022291431622 1.1382736821873727
+0.80062303027104398 0.033204102939107361 0.84014219641217736
+0.73973505164257791 0.035280704490367243 0.96026541144158839
+0.033204102939107361 0.84014219641217736 0.80062303027104398
+0.035280704490367243 0.96026541144158839 0.73973505164257791
+0.29772297467792341 0.29128230231247842 1.0672770740243225
+0.23042216149782369 0.37659777085683765 1.1382736821873727
+0.30590391667975914 0.67160444279468889 1.6406145370870964
+0.29480292285486576 0.79987185965655661 1.6801807185069526
+0.056697343706257008 0.92229559635619074 1.3227105890477233
+0.022968417915120942 0.91971872264975907 1.1973935260228461
+0.48428397075672913 0.17598126576074058 1.2345849586062216
+0.53443495637683447 0.18870753060675904 1.3536293529417167
+1.069740197633309 0.19952765932508121 1.5952985273360616
+1.135836225526941 0.28008469293463611 1.6806397508870439
+0.76541504139377881 0.48428397075672935 1.8240187342392595
+0.64637064705828351 0.53443495637683469 1.8112924693932411
+0.30590391667975902 1.3283955572053112 0.35938546291290407
+0.29480292285486553 1.2001281403434438 0.3198192814930475
+0.056697343706257008 1.0777044036438097 0.67728941095227668
+0.022968417915120942 1.0802812773502413 0.80260647397715423
+0.076305915458627194 0.72730018625934878 1.2691171673622652
+0.11923210876951285 0.74047778163550193 1.3961011738843634
+0.098276862116930985 1.1865609960788057 1.3899876630720458
+0.108426253256518 1.3040127948790106 1.3356672082102183
+1.6717091588743203 1.4512666656072586 1.5875076190110728
+1.5666478495993443 1.5237239478373752 1.6361001815799718
+1.3714973697248309 1.527772526934267 1.7638362809535499
+1.1362409534038143 1.9506072962094394 1.2788981373351191
+1.0694523319806282 1.9168554803037774 1.3931315324664026
+1.069740197633309 1.800472340674919 1.5952985273360614
+0.41249238098892749 1.6717091588743205 1.4512666656072588
+0.47627605216262503 1.6361001815799718 1.5666478495993443
+0.671604442794689 1.6406145370870961 1.694096083320241
+0.50065936939781919 1.0000000000000002 1.8664057563461918
+0.60686846753359758 1.0694523319806275 1.9168554803037776
+0.72730018625934878 1.2691171673622654 1.9236940845413728
+1.2788981373351191 0.86375904659618619 1.9506072962094394
+1.280755298723806 1 1.9597793820657468
+1.1598578035878231 1.1993769697289565 1.9667958970608925
+0.7211018626648813 0.86375904659618619 0.049392703790560488
+0.71924470127619444 1 0.040220617934253244
+0.84014219641217736 1.1993769697289565 0.033204102939107361
+0.32829084112567963 1.4512666656072588 0.41249238098892738
+0.43335215040065567 1.5237239478373752 0.36389981842002816
+0.62850263027516917 1.5277725269342675 0.23616371904645006
+0.86375904659618641 1.9506072962094394 0.72110186266488108
+0.93054766801937283 1.9168554803037776 0.60686846753359758
+0.93025980236669126 1.800472340674919 0.40470147266393852
+1.5875076190110726 1.6717091588743203 0.54873333439274141
+1.5237239478373752 1.6361001815799718 0.43335215040065567
+1.3283955572053112 1.6406145370870961 0.30590391667975925
+1.499340630602181 1.0000000000000002 0.13359424365380856
+1.3931315324664024 1.0694523319806275 0.083144519696222496
+1.2726998137406516 1.2691171673622654 0.076305915458627416
+1.0000000000000002 0.13359424365380856 1.499340630602181
+1.0694523319806275 0.083144519696222496 1.3931315324664024
+1.2691171673622654 0.076305915458627416 1.2726998137406516
+0.86375904659618619 0.049392703790560488 0.7211018626648813
+1 0.040220617934253244 0.71924470127619444
+1.1993769697289565 0.033204102939107361 0.84014219641217736
+1.4512666656072588 0.41249238098892738 0.32829084112567963
+1.5237239478373752 0.36389981842002816 0.43335215040065567
+1.5277725269342675 0.23616371904645006 0.62850263027516917
+1.9506072962094394 0.72110186266488108 0.86375904659618641
+1.9168554803037776 0.6068684675335978 0.93054766801937272
+1.800472340674919 0.40470147266393852 0.93025980236669126
+1.6717091588743203 0.54873333439274141 1.5875076190110726
+1.6361001815799718 0.43335215040065567 1.5237239478373752
+1.6406145370870961 0.30590391667975925 1.3283955572053112
+1.5875076190110726 1.67170915887432 1.4512666656072588
+1.6361001815799718 1.5666478495993443 1.5237239478373752
+1.7638362809535497 1.3714973697248309 1.5277725269342677
+0.50065936939781919 1.0000000000000002 0.13359424365380834
+0.6068684675335978 0.93054766801937272 0.083144519696222274
+0.049392703790560599 1.2788981373351191 1.1362409534038143
+0.040220617934253355 1.280755298723806 1.0000000000000002
+0.033204102939107361 1.1598578035878231 0.80062303027104398
+0.72110186266488108 0.8637590465961863 1.9506072962094394
+0.60686846753359758 0.93054766801937272 1.9168554803037776
+0.40470147266393852 0.93025980236669126 1.800472340674919
+0.32829084112567997 1.4512666656072586 1.5875076190110731
+0.36389981842002839 1.5666478495993443 1.5237239478373752
+0.35938546291290407 1.694096083320241 1.3283955572053112
+0.72110186266488108 1.1362409534038143 1.9506072962094394
+0.71924470127619433 1.0000000000000002 1.9597793820657468
+0.84014219641217736 0.80062303027104387 1.9667958970608925
+1.4512666656072588 0.41249238098892749 1.6717091588743205
+1.5666478495993443 0.47627605216262503 1.6361001815799718
+1.694096083320241 0.671604442794689 1.6406145370870961
+1.2788981373351191 1.1362409534038143 1.9506072962094394
+1.3931315324664026 1.0694523319806277 1.9168554803037774
+1.5952985273360614 1.069740197633309 1.800472340674919
+1.9506072962094394 1.2788981373351191 1.1362409534038143
+1.9168554803037774 1.3931315324664026 1.0694523319806277
+1.800472340674919 1.5952985273360614 1.069740197633309
+1.451266665607259 1.5875076190110726 1.6717091588743203
+1.5237239478373752 1.6361001815799718 1.5666478495993443
+1.527772526934267 1.7638362809535499 1.3714973697248309
+1.1362409534038143 1.9506072962094394 0.72110186266488119
+1.0000000000000002 1.9597793820657468 0.71924470127619433
+0.80062303027104398 1.9667958970608925 0.84014219641217713
+1.0000000000000002 1.8664057563461913 1.499340630602181
+0.93054766801937272 1.9168554803037776 1.3931315324664026
+0.73088283263773501 1.9236940845413728 1.2726998137406516
+0.13359424365380856 1.499340630602181 1.0000000000000002
+0.083144519696222607 1.3931315324664026 1.0694523319806275
+0.076305915458627416 1.2726998137406516 1.2691171673622654
+0.54873333439274141 1.5875076190110726 1.6717091588743203
+0.43335215040065567 1.5237239478373752 1.6361001815799718
+0.30590391667975925 1.3283955572053112 1.6406145370870961
+0.32829084112567974 0.5487333343927413 1.5875076190110728
+0.43335215040065567 0.47627605216262503 1.6361001815799718
+0.62850263027516928 0.47222747306573287 1.7638362809535502
+1.4512666656072588 1.5875076190110726 0.32829084112567986
+1.5666478495993446 1.5237239478373752 0.36389981842002828
+1.694096083320241 1.3283955572053112 0.35938546291290407
+1.6717091588743205 0.5487333343927413 0.41249238098892749
+1.5666478495993443 0.47627605216262503 0.36389981842002828
+1.3714973697248309 0.47222747306573287 0.23616371904645017
+1.2788981373351191 1.1362409534038143 0.049392703790560599
+1.2807552987238058 1.0000000000000002 0.040220617934253244
+1.1598578035878231 0.80062303027104398 0.033204102939107361
+0.7211018626648813 1.1362409534038143 0.049392703790560599
+0.6068684675335978 1.0694523319806277 0.083144519696222274
+0.4047014726639383 1.069740197633309 0.1995276593250811
+0.049392703790560599 1.2788981373351191 0.8637590465961863
+0.083144519696222496 1.3931315324664026 0.93054766801937272
+0.1995276593250811 1.5952985273360616 0.93025980236669126
+0.54873333439274141 1.5875076190110726 0.32829084112567963
+0.47627605216262503 1.6361001815799718 0.43335215040065567
+0.47222747306573287 1.7638362809535502 0.62850263027516928
+0.86375904659618619 1.9506072962094394 1.2788981373351191
+1 1.9597793820657468 1.280755298723806
+1.1993769697289565 1.9667958970608925 1.1598578035878231
+1.0000000000000002 1.8664057563461918 0.50065936939781919
+1.0694523319806282 1.9168554803037776 0.60686846753359758
+1.2691171673622654 1.9236940845413726 0.72730018625934867
+1.8664057563461913 1.499340630602181 1.0000000000000002
+1.9168554803037776 1.3931315324664026 0.93054766801937272
+1.9236940845413728 1.2726998137406516 0.73088283263773501
+1.8664057563461918 0.50065936939781919 1.0000000000000002
+1.9168554803037776 0.6068684675335978 1.0694523319806275
+1.9236940845413726 0.72730018625934889 1.2691171673622654
+1.499340630602181 1.0000000000000002 1.8664057563461913
+1.3931315324664026 0.93054766801937272 1.9168554803037776
+1.2726998137406516 0.73088283263773501 1.9236940845413728
+1.5875076190110726 0.32829084112567986 1.4512666656072588
+1.5237239478373752 0.36389981842002828 1.5666478495993446
+1.3283955572053112 0.35938546291290407 1.694096083320241
+0.5487333343927413 0.41249238098892749 1.6717091588743205
+0.47627605216262503 0.36389981842002828 1.5666478495993443
+0.47222747306573287 0.23616371904645017 1.3714973697248309
+1.1362409534038143 0.049392703790560599 1.2788981373351191
+1.0000000000000002 0.040220617934253244 1.2807552987238058
+0.80062303027104398 0.033204102939107361 1.1598578035878231
+1.1362409534038143 0.049392703790560488 0.7211018626648813
+1.0694523319806277 0.083144519696222274 0.6068684675335978
+1.069740197633309 0.1995276593250811 0.4047014726639383
+1.2788981373351191 0.86375904659618641 0.049392703790560599
+1.3931315324664024 0.93054766801937272 0.083144519696222496
+1.5952985273360616 0.93025980236669126 0.1995276593250811
+1.5875076190110728 0.32829084112567974 0.5487333343927413
+1.6361001815799721 0.43335215040065578 0.47627605216262492
+1.7638362809535502 0.62850263027516928 0.47222747306573287
+1.9506072962094394 1.2788981373351191 0.86375904659618619
+1.9597793820657468 1.280755298723806 1
+1.9667958970608925 1.1598578035878231 1.1993769697289565
+1.9506072962094394 0.72110186266488119 1.1362409534038143
+1.9597793820657468 0.71924470127619444 1.0000000000000002
+1.9667958970608925 0.84014219641217736 0.80062303027104398
+1.6717091588743205 1.4512666656072588 0.41249238098892749
+1.6361001815799718 1.5666478495993443 0.47627605216262503
+1.6406145370870961 1.694096083320241 0.671604442794689
+1.0000000000000002 0.13359424365380834 0.50065936939781919
+0.93054766801937272 0.083144519696222274 0.6068684675335978
+0.13359424365380834 0.50065936939781919 1.0000000000000002
+0.083144519696222274 0.6068684675335978 0.93054766801937272
+0.41249238098892738 0.32829084112567963 1.4512666656072588
+0.36389981842002828 0.43335215040065567 1.5237239478373752
+0.23616371904645006 0.62850263027516917 1.5277725269342675
+0.049392703790560599 0.72110186266488119 1.1362409534038143
+0.083144519696222274 0.6068684675335978 1.0694523319806282
+0.1995276593250811 0.4047014726639383 1.069740197633309
+0.86375904659618641 0.049392703790560599 1.2788981373351191
+0.93054766801937272 0.083144519696222274 1.3931315324664024
+0.93025980236669126 0.1995276593250811 1.5952985273360616
+0.41249238098892749 1.6717091588743205 0.5487333343927413
+0.36389981842002828 1.5666478495993443 0.47627605216262503
+0.23616371904645017 1.3714973697248309 0.47222747306573265
+0.049392703790560488 0.72110186266488108 0.86375904659618619
+0.040220617934253244 0.71924470127619444 1
+0.033204102939107361 0.84014219641217736 1.1993769697289565
+1 1.625781888690033 1.7799980947332728
+1.0548571407136167 1.5400179687989204 1.8398638505656821
+1.1865609960788062 1.3899876630720454 1.901723137883069
+1.2022655037944634 1 1.9793307234916977
+1.4183870394745819 1.2746684461261839 1.8657421844304007
+0.88373086464434814 1.553923611197678 1.8244089525965697
+1.1930054401955474 1.624572621678267 1.7567416602149373
+1.5521688397941482 1.4662660666179783 1.6911624465210644
+1.3399483569044259 1.7433454959605346 1.5760838378857436
+0.92814172250764548 1.437654475842026 1.8962672300889245
+0.93272292597567796 1.7022770253220765 1.7087176976875216
+1.1389936067269157 1.8934279503155276 1.427161883697549
+0.79171259951203343 1.8247164420172246 1.5257938275259759
+1.0718582774923548 1.4376544758420258 1.8962672300889245
+0.76541504139377881 1.515716029243271 1.8240187342392595
+0.53373393338202191 1.6911624465210644 1.5521688397941484
+0.53132295016564979 1.4063294025426427 1.7843712383737111
+1.116269135355652 1.553923611197678 1.8244089525965697
+0.92229559635619029 1.3227105890477233 1.943302656293743
+0.57283811630245085 1.1389936067269162 1.8934279503155276
+0.91862905394331007 1.0663810456382177 1.9944708773603259
+0.88373086464434825 1.5539236111976775 0.17559104740343034
+0.96609642251334915 1.4851608280853033 0.12623257194766668
+1.0777044036438097 1.3227105890477233 0.056697343706257008
+1.427161883697549 1.1389936067269162 0.10657204968447243
+1.0813709460566903 1.0663810456382175 0.0055291226396743109
+1 1.6257818886900326 0.22000190526672714
+0.81343900392119461 1.3899876630720456 0.098276862116930652
+0.79773449620553682 1 0.020669276508302414
+0.58161296052541844 1.2746684461261841 0.13425781556959904
+1.116269135355652 1.5539236111976775 0.17559104740343034
+0.80699455980445256 1.624572621678267 0.24325833978506284
+0.44783116020585179 1.4662660666179785 0.30883755347893571
+0.66005164309557451 1.7433454959605346 0.4239161621142562
+1.0718582774923548 1.437654475842026 0.1037327699110755
+1.0672770740243225 1.7022770253220765 0.29128230231247831
+0.86100639327308448 1.8934279503155278 0.57283811630245107
+1.2082874004879671 1.8247164420172246 0.47420617247402486
+0.92814172250764526 1.4376544758420258 0.10373276991107527
+1.2345849586062212 1.515716029243271 0.17598126576074047
+1.4662660666179783 1.6911624465210644 0.44783116020585179
+1.4686770498343509 1.4063294025426429 0.21562876162628941
+1.4376544758420258 0.10373276991107527 0.92814172250764526
+1.4851608280853033 0.12623257194766668 1.0339035774866507
+1.5157160292432712 0.17598126576074069 1.2345849586062212
+1.6911624465210644 0.44783116020585179 1.4662660666179783
+1.4063294025426429 0.21562876162628941 1.4686770498343509
+1.553923611197678 0.17559104740343034 0.88373086464434814
+1.3227105890477233 0.056697343706257008 1.0777044036438097
+1.1389936067269162 0.10657204968447254 1.4271618836975493
+1.0663810456382175 0.0055291226396743109 1.0813709460566903
+1.6257818886900326 0.22000190526672714 1
+1.3899876630720456 0.098276862116930652 0.81343900392119461
+1 0.020669276508302414 0.79773449620553682
+1.2746684461261841 0.13425781556959904 0.58161296052541844
+1.5539236111976777 0.17559104740343046 1.116269135355652
+1.624572621678267 0.24325833978506284 0.80699455980445256
+1.4662660666179785 0.30883755347893571 0.44783116020585167
+1.7433454959605346 0.4239161621142562 0.66005164309557451
+1.437654475842026 0.1037327699110755 1.0718582774923548
+1.7022770253220765 0.29128230231247831 1.0672770740243225
+1.8934279503155278 0.57283811630245107 0.86100639327308448
+1.8247164420172246 0.47420617247402486 1.2082874004879671
+1.7799980947332728 1 1.625781888690033
+1.8398638505656821 1.0548571407136167 1.5400179687989204
+1.901723137883069 1.1865609960788062 1.3899876630720454
+1.9793307234916977 1.2022655037944634 1
+1.8657421844304007 1.4183870394745819 1.2746684461261839
+1.0718582774923548 0.56234552415797401 0.1037327699110755
+0.17559104740343046 1.116269135355652 0.44607638880232214
+0.12623257194766668 1.0339035774866507 0.51483917191469664
+0.056697343706257008 0.92229559635619041 0.67728941095227668
+0.0055291226396741999 0.91862905394331018 0.93361895436178288
+0.17559104740343034 1.116269135355652 1.553923611197678
+0.24325833978506284 0.80699455980445256 1.624572621678267
+0.30883755347893571 0.44783116020585167 1.4662660666179785
+0.4239161621142562 0.66005164309557451 1.7433454959605346
+0.56234552415797401 1.8962672300889243 1.0718582774923548
+0.29772297467792341 1.7087176976875216 1.0672770740243225
+0.10657204968447231 1.4271618836975493 0.86100639327308448
+0.17528355798277562 1.5257938275259757 1.2082874004879671
+0.88373086464434814 0.44607638880232214 1.8244089525965697
+1.0777044036438097 0.67728941095227657 1.943302656293743
+1.4271618836975497 0.86100639327308426 1.8934279503155274
+1.0813709460566905 0.93361895436178288 1.9944708773603259
+1.8962672300889245 0.92814172250764548 1.437654475842026
+1.8398638505656821 0.94514285928638309 1.5400179687989204
+1.7087176976875216 0.93272292597567796 1.7022770253220765
+1.4271618836975493 1.138993606726916 1.8934279503155276
+1.5257938275259757 0.79171259951203343 1.8247164420172244
+1.8244089525965697 0.88373086464434814 1.553923611197678
+1.7567416602149373 1.1930054401955474 1.624572621678267
+1.6911624465210642 1.552168839794148 1.4662660666179788
+1.5760838378857436 1.3399483569044259 1.7433454959605346
+1.553923611197678 1.8244089525965697 0.88373086464434814
+1.624572621678267 1.7567416602149373 1.1930054401955474
+1.4662660666179788 1.6911624465210642 1.552168839794148
+1.7433454959605346 1.5760838378857436 1.3399483569044259
+1.625781888690033 1.7799980947332728 1
+1.3899876630720454 1.901723137883069 1.1865609960788062
+1 1.9793307234916977 1.2022655037944634
+1.2746684461261839 1.8657421844304012 1.4183870394745819
+0.44607638880232214 1.8244089525965697 0.88373086464434814
+0.51483917191469653 1.8737674280523331 0.96609642251334915
+0.67728941095227668 1.9433026562937428 1.0777044036438097
+0.86100639327308426 1.8934279503155274 1.4271618836975497
+0.93361895436178288 1.9944708773603257 1.0813709460566903
+0.56234552415797401 1.8962672300889243 0.92814172250764526
+0.48428397075672935 1.8240187342392595 1.2345849586062212
+0.30883755347893593 1.5521688397941484 1.4662660666179788
+0.59367059745735751 1.7843712383737109 1.4686770498343507
+0.10373276991107527 0.92814172250764526 1.4376544758420258
+0.12623257194766668 1.0339035774866507 1.4851608280853033
+0.17598126576074069 1.2345849586062212 1.5157160292432712
+0.44783116020585179 1.4662660666179783 1.6911624465210644
+0.21562876162628963 1.4686770498343507 1.4063294025426434
+0.1037327699110755 1.0718582774923548 1.437654475842026
+0.29128230231247831 1.0672770740243225 1.7022770253220765
+0.57283811630245085 0.86100639327308437 1.8934279503155276
+0.47420617247402486 1.2082874004879671 1.8247164420172246
+1 0.37421811130996696 1.7799980947332725
+0.81343900392119473 0.61001233692795442 1.9017231378830692
+0.79773449620553671 1.0000000000000002 1.9793307234916977
+0.58161296052541844 0.72533155387381609 1.865742184430401
+1.8962672300889243 1.0718582774923548 0.56234552415797401
+1.7087176976875216 1.0672770740243225 0.29772297467792341
+1.4271618836975493 0.86100639327308448 0.10657204968447231
+1.5257938275259753 1.2082874004879671 0.1752835579827754
+1 0.37421811130996707 0.22000190526672725
+1.0548571407136167 0.45998203120107961 0.16013614943431764
+1.1865609960788062 0.61001233692795442 0.098276862116930985
+1.2022655037944634 1.0000000000000002 0.020669276508302414
+1.4183870394745819 0.72533155387381609 0.13425781556959915
+1.116269135355652 0.44607638880232214 0.17559104740343046
+0.92229559635619041 0.67728941095227668 0.056697343706257008
+0.91862905394331018 0.93361895436178288 0.0055291226396741999
+0.1037327699110755 0.92814172250764548 0.56234552415797401
+0.57283811630245096 1.138993606726916 0.10657204968447231
+0.18108971266128371 1 0.42607845371442887
+0.24325833978506284 1.1930054401955474 0.37542737832173323
+0.30883755347893582 1.5521688397941484 0.53373393338202169
+0.42391616211425609 1.3399483569044259 0.25665450403946555
+0.44607638880232214 1.8244089525965697 1.116269135355652
+0.42607845371442887 1.8189102873387162 1
+0.37542737832173312 1.7567416602149373 0.80699455980445245
+0.53373393338202169 1.6911624465210644 0.44783116020585179
+0.25665450403946544 1.5760838378857438 0.66005164309557429
+0.37421811130996729 1.7799980947332728 1
+0.61001233692795442 1.9017231378830692 0.8134390039211945
+1.0000000000000002 1.9793307234916977 0.79773449620553649
+0.72533155387381631 1.8657421844304012 0.58161296052541867
+1.5539236111976777 1.8244089525965697 1.116269135355652
+1.3227105890477233 1.943302656293743 0.92229559635619029
+1.1389936067269162 1.8934279503155276 0.57283811630245085
+1.0663810456382175 1.9944708773603257 0.91862905394330985
+1.437654475842026 1.8962672300889247 1.0718582774923548
+1.4851608280853035 1.8737674280523331 0.96609642251334915
+1.5157160292432708 1.8240187342392593 0.76541504139377881
+1.6911624465210644 1.5521688397941484 0.53373393338202191
+1.4063294025426429 1.7843712383737109 0.53132295016564957
+1.8962672300889243 0.92814172250764526 0.56234552415797401
+1.8240187342392595 1.2345849586062212 0.48428397075672935
+1.5521688397941484 1.4662660666179785 0.30883755347893582
+1.7843712383737109 1.4686770498343507 0.59367059745735751
+1.8962672300889245 1.0718582774923548 1.4376544758420258
+1.8240187342392593 0.76541504139377881 1.5157160292432708
+1.5521688397941484 0.53373393338202191 1.6911624465210644
+1.7843712383737111 0.53132295016564979 1.4063294025426427
+0.92814172250764526 0.56234552415797401 1.8962672300889243
+1.2345849586062212 0.48428397075672935 1.8240187342392595
+1.4662660666179785 0.30883755347893582 1.5521688397941484
+1.4686770498343507 0.59367059745735751 1.7843712383737109
+1.0718582774923548 0.56234552415797401 1.8962672300889243
+1.0548571407136167 0.4599820312010795 1.8398638505656821
+1.0672770740243225 0.29772297467792341 1.7087176976875216
+0.86100639327308448 0.10657204968447231 1.4271618836975493
+1.2082874004879671 0.1752835579827754 1.5257938275259753
+0.37421811130996707 0.22000190526672725 1
+0.61001233692795442 0.098276862116931096 1.1865609960788062
+1.0000000000000002 0.020669276508302414 1.2022655037944634
+0.72533155387381609 0.13425781556959915 1.4183870394745819
+0.44607638880232214 0.17559104740343046 1.116269135355652
+0.67728941095227668 0.056697343706257008 0.92229559635619041
+0.93361895436178288 0.0055291226396741999 0.91862905394331018
+0.92814172250764548 0.56234552415797401 0.1037327699110755
+0.94514285928638309 0.45998203120107961 0.16013614943431764
+1.138993606726916 0.10657204968447231 0.57283811630245096
+1.1930054401955474 0.37542737832173323 0.24325833978506284
+1.5521688397941484 0.53373393338202157 0.30883755347893571
+1.3399483569044259 0.25665450403946555 0.42391616211425609
+1.8244089525965697 1.116269135355652 0.44607638880232214
+1.7567416602149373 0.80699455980445256 0.37542737832173323
+1.6911624465210644 0.44783116020585179 0.53373393338202169
+1.5760838378857438 0.66005164309557429 0.25665450403946544
+1.7799980947332725 1 0.37421811130996718
+1.8398638505656821 0.94514285928638309 0.4599820312010795
+1.9017231378830692 0.81343900392119473 0.61001233692795442
+1.9793307234916977 0.79773449620553671 1.0000000000000002
+1.8657421844304012 0.58161296052541867 0.72533155387381631
+1.8244089525965697 1.116269135355652 1.553923611197678
+1.943302656293743 0.92229559635619029 1.3227105890477233
+1.8934279503155276 0.57283811630245096 1.1389936067269162
+1.9944708773603259 0.91862905394331018 1.0663810456382175
+1.8244089525965697 0.88373086464434814 0.44607638880232214
+1.9433026562937428 1.0777044036438097 0.67728941095227668
+1.8934279503155274 1.4271618836975497 0.86100639327308426
+1.9944708773603259 1.0813709460566905 0.93361895436178288
+1.4376544758420262 1.8962672300889245 0.92814172250764526
+1.7022770253220765 1.7087176976875216 0.93272292597567796
+1.8934279503155276 1.4271618836975493 1.138993606726916
+1.8247164420172244 1.5257938275259757 0.79171259951203343
+0.56234552415797401 0.1037327699110755 1.0718582774923548
+0.1037327699110755 1.0718582774923548 0.56234552415797401
+0.56234552415797401 0.1037327699110755 0.92814172250764548
+0.45998203120107961 0.16013614943431764 0.94514285928638309
+0.10657204968447231 0.57283811630245096 1.138993606726916
+0.22000190526672714 1 1.6257818886900326
+0.16013614943431764 0.94514285928638309 1.5400179687989204
+0.098276862116930652 0.81343900392119461 1.3899876630720456
+0.020669276508302414 0.79773449620553682 1
+0.13425781556959904 0.58161296052541844 1.2746684461261841
+0.37542737832173312 0.24325833978506273 1.1930054401955474
+0.53373393338202169 0.30883755347893582 1.5521688397941484
+0.25665450403946555 0.42391616211425609 1.3399483569044259
+1.116269135355652 0.44607638880232214 1.8244089525965697
+0.80699455980445256 0.37542737832173323 1.7567416602149373
+0.44783116020585179 0.53373393338202169 1.6911624465210644
+0.66005164309557429 0.25665450403946544 1.5760838378857438
+0.22000190526672725 1 0.37421811130996729
+0.098276862116931096 1.1865609960788062 0.61001233692795442
+0.020669276508302414 1.2022655037944634 1.0000000000000002
+0.13425781556959915 1.4183870394745819 0.72533155387381609
+0.17559104740343034 0.88373086464434814 1.553923611197678
+0.056697343706257008 1.0777044036438097 1.3227105890477233
+0.10657204968447276 1.4271618836975497 1.1389936067269162
+0.0055291226396743109 1.0813709460566903 1.0663810456382175
+1.4585335468418477 1.2079367413660946 1.8640076955737634
+1.4869664504627846 1.2757285413196802 1.8287565671687904
+1.4054741487319156 1.7419228637721522 1.5339861224060576
+1.3417901167060058 1.7879282682296775 1.5121997269099978
+0.7920632586339057 1.8640076955737634 1.4585335468418479
+0.72427145868032006 1.8287565671687904 1.4869664504627849
+0.46601387759394275 1.4054741487319153 1.7419228637721522
+0.48780027309000262 1.3417901167060056 1.787928268229678
+0.87791516819838944 1.0000000000000002 1.9925196692479057
+0.95917170106088778 1.0000000000000002 1.9991661773727825
+1.1220848318016112 1.0000000000000002 0.0074803307520941997
+1.0408282989391127 1.0000000000000002 0.00083382262721753975
+0.54146645315815223 1.2079367413660949 0.13599230442623678
+0.51303354953721536 1.2757285413196804 0.17124343283120957
+0.59452585126808533 1.7419228637721524 0.46601387759394242
+0.65820988329399455 1.787928268229678 0.48780027309000262
+1.2079367413660951 1.8640076955737632 0.54146645315815234
+1.2757285413196804 1.8287565671687904 0.51303354953721536
+1.5339861224060583 1.4054741487319153 0.25807713622784811
+1.5121997269099978 1.3417901167060056 0.21207173177032246
+1.4054741487319153 0.25807713622784811 1.5339861224060583
+1.3417901167060056 0.21207173177032246 1.5121997269099978
+1.0000000000000002 0.0074803307520941997 1.1220848318016112
+1.0000000000000002 0.00083382262721753975 1.0408282989391127
+1.2079367413660949 0.13599230442623678 0.54146645315815223
+1.2757285413196804 0.17124343283120957 0.51303354953721536
+1.7419228637721527 0.46601387759394253 0.59452585126808521
+1.787928268229678 0.48780027309000262 0.65820988329399455
+1.8640076955737634 0.54146645315815256 1.2079367413660949
+1.8287565671687904 0.51303354953721558 1.2757285413196802
+1.8640076955737634 1.4585335468418477 1.2079367413660946
+1.8287565671687904 1.4869664504627846 1.2757285413196802
+0.0074803307520941997 0.87791516819838944 1.0000000000000002
+0.00083382262721753975 0.95917170106088778 1.0000000000000002
+0.46601387759394253 0.59452585126808521 1.7419228637721527
+0.48780027309000262 0.65820988329399455 1.787928268229678
+0.135992304426237 1.4585335468418483 1.2079367413660951
+0.17124343283120991 1.4869664504627851 1.2757285413196804
+1.1220848318016112 1.0000000000000002 1.9925196692479057
+1.0408282989391127 1.0000000000000002 1.9991661773727825
+1.4585335468418479 0.7920632586339057 1.8640076955737634
+1.4869664504627849 0.72427145868032006 1.8287565671687904
+1.5339861224060576 1.4054741487319156 1.7419228637721522
+1.5121997269099978 1.3417901167060058 1.7879282682296775
+1.7419228637721522 1.5339861224060576 1.4054741487319156
+1.7879282682296775 1.5121997269099978 1.3417901167060058
+1.2079367413660946 1.8640076955737634 1.4585335468418474
+1.2757285413196802 1.8287565671687904 1.4869664504627846
+1.0000000000000002 1.9925196692479057 1.1220848318016112
+1.0000000000000002 1.9991661773727825 1.0408282989391127
+0.59452585126808544 1.7419228637721522 1.533986122406058
+0.65820988329399466 1.7879282682296778 1.5121997269099978
+0.25807713622784823 1.5339861224060583 1.4054741487319156
+0.21207173177032257 1.5121997269099978 1.3417901167060058
+0.54146645315815245 1.2079367413660949 1.8640076955737634
+0.51303354953721558 1.2757285413196802 1.8287565671687904
+0.54146645315815245 0.79206325863390548 1.8640076955737634
+0.51303354953721558 0.72427145868032006 1.8287565671687904
+1.4585335468418481 1.2079367413660951 0.13599230442623689
+1.4869664504627849 1.2757285413196802 0.17124343283120991
+1.4585335468418479 0.79206325863390536 0.13599230442623678
+1.4869664504627846 0.72427145868031995 0.17124343283120957
+0.87791516819838944 1.0000000000000002 0.0074803307520941997
+0.95917170106088778 1.0000000000000002 0.00083382262721753975
+0.46601387759394242 1.4054741487319158 0.25807713622784789
+0.48780027309000262 1.3417901167060058 0.21207173177032246
+0.25807713622784789 1.533986122406058 0.59452585126808488
+0.21207173177032246 1.5121997269099978 0.65820988329399444
+0.79206325863390559 1.8640076955737634 0.54146645315815256
+0.72427145868032006 1.8287565671687904 0.51303354953721558
+1.0000000000000002 1.9925196692479057 0.87791516819838922
+1.0000000000000002 1.9991661773727825 0.95917170106088745
+1.4054741487319156 1.7419228637721522 0.46601387759394231
+1.3417901167060056 1.787928268229678 0.48780027309000262
+1.7419228637721522 1.533986122406058 0.59452585126808544
+1.7879282682296778 1.5121997269099978 0.65820988329399466
+1.7419228637721522 0.46601387759394275 1.4054741487319153
+1.787928268229678 0.48780027309000262 1.3417901167060056
+1.533986122406058 0.59452585126808544 1.7419228637721522
+1.5121997269099978 0.65820988329399466 1.7879282682296775
+1.2079367413660951 0.135992304426237 1.4585335468418483
+1.2757285413196804 0.17124343283120991 1.4869664504627851
+0.79206325863390536 0.13599230442623678 1.4585335468418479
+0.72427145868031995 0.17124343283120957 1.4869664504627846
+1.0000000000000002 0.0074803307520941997 0.87791516819838944
+1.0000000000000002 0.00083382262721753975 0.95917170106088778
+1.4054741487319158 0.258077136227848 0.46601387759394253
+1.341790116706006 0.21207173177032235 0.48780027309000251
+1.533986122406058 0.5945258512680851 0.25807713622784789
+1.5121997269099978 0.65820988329399455 0.21207173177032246
+1.8640076955737634 0.54146645315815256 0.79206325863390559
+1.8287565671687904 0.51303354953721558 0.72427145868032006
+1.9925196692479057 0.87791516819838944 1.0000000000000002
+1.9991661773727825 0.95917170106088778 1.0000000000000002
+1.9925196692479057 1.1220848318016112 1.0000000000000002
+1.9991661773727825 1.0408282989391127 1.0000000000000002
+1.8640076955737634 1.4585335468418479 0.7920632586339057
+1.8287565671687904 1.4869664504627849 0.72427145868032006
+0.13599230442623678 0.54146645315815223 1.2079367413660949
+0.17124343283120957 0.51303354953721536 1.2757285413196804
+0.258077136227848 0.46601387759394253 1.4054741487319158
+0.21207173177032235 0.48780027309000251 1.341790116706006
+0.5945258512680851 0.25807713622784789 1.533986122406058
+0.65820988329399455 0.21207173177032246 1.5121997269099978
+0.13599230442623678 1.4585335468418479 0.79206325863390536
+0.17124343283120957 1.4869664504627846 0.72427145868031995
+0.0074803307520941997 1.1220848318016112 1.0000000000000002
+0.00083382262721753975 1.0408282989391127 1.0000000000000002
+1.3850500562448067 1.5871412403588967 1.7120404609681164
+1.3180233001589552 1.5833668628112614 1.7473582032263737
+1.1129504910198773 1.3836883498990558 1.9165290157600623
+1.154901620023423 1.3257845443224259 1.932668171856823
+1 1.8251152624882454 1.5649644268526592
+1.0000000000000002 1.7799160715239055 1.6258841117800629
+1.1827577335161514 1.5664460834152063 1.8035785247401852
+1.2506360861103192 1.5764206304327446 1.7777665518334007
+0.61494994375519396 1.5871412403588967 1.7120404609681168
+0.68197669984104503 1.5833668628112616 1.7473582032263737
+1 1.6793965744350836 1.7337712822439113
+1 1.7313222504561676 1.6820320857465041
+0.76202597787065152 1.20209118411409 1.9500144830974659
+0.80345079128735619 1.2653435626523064 1.9439074119390181
+0.81724226648384946 1.5664460834152067 1.8035785247401852
+0.74936391388968104 1.5764206304327451 1.7777665518334005
+1.2379740221293494 1.20209118411409 1.9500144830974655
+1.1965492087126446 1.2653435626523064 1.9439074119390178
+0.88704950898012358 1.3836883498990562 1.9165290157600621
+0.84509837997657777 1.3257845443224261 1.932668171856823
+0.76202597787065152 1.20209118411409 0.049985516902534055
+0.80345079128735619 1.2653435626523064 0.056092588060981941
+1.1129504910198773 1.3836883498990562 0.08347098423993804
+1.1549016200234223 1.3257845443224259 0.067331828143176842
+0.61494994375519396 1.5871412403588969 0.28795953903188354
+0.68197669984104503 1.5833668628112614 0.25264179677362608
+0.88704950898012358 1.3836883498990558 0.083470984239937707
+0.84509837997657777 1.3257845443224259 0.067331828143176842
+1 1.8251152624882456 0.43503557314734087
+1 1.7799160715239055 0.37411588821993702
+0.81724226648384946 1.5664460834152065 0.19642147525981468
+0.74936391388968104 1.5764206304327446 0.22223344816659929
+1.3850500562448065 1.5871412403588967 0.28795953903188365
+1.318023300158955 1.5833668628112618 0.25264179677362619
+1 1.6793965744350834 0.26622871775608836
+1.0000000000000002 1.7313222504561674 0.31796791425349591
+1.2379740221293494 1.20209118411409 0.049985516902534388
+1.1965492087126439 1.2653435626523064 0.056092588060981941
+1.1827577335161514 1.5664460834152067 0.1964214752598149
+1.2506360861103192 1.5764206304327451 0.22223344816659951
+1.20209118411409 0.049985516902534388 1.2379740221293494
+1.2653435626523064 0.056092588060981941 1.1965492087126439
+1.5664460834152067 0.19642147525981501 1.1827577335161514
+1.5764206304327453 0.22223344816659973 1.2506360861103192
+1.20209118411409 0.049985516902534055 0.76202597787065152
+1.2653435626523064 0.056092588060981941 0.80345079128735619
+1.3836883498990562 0.08347098423993804 1.1129504910198773
+1.3257845443224259 0.067331828143176842 1.1549016200234223
+1.5871412403588971 0.28795953903188365 0.61494994375519385
+1.5833668628112616 0.25264179677362608 0.68197669984104492
+1.3836883498990558 0.083470984239937596 0.88704950898012358
+1.3257845443224259 0.067331828143176842 0.84509837997657777
+1.8251152624882456 0.43503557314734087 1
+1.7799160715239055 0.37411588821993702 1
+1.5664460834152067 0.19642147525981479 0.81724226648384946
+1.5764206304327446 0.22223344816659929 0.74936391388968104
+1.5871412403588967 0.28795953903188365 1.3850500562448065
+1.5833668628112618 0.25264179677362619 1.318023300158955
+1.6793965744350836 0.26622871775608847 1
+1.7313222504561674 0.31796791425349591 1.0000000000000002
+1.7120404609681164 1.3850500562448067 1.5871412403588967
+1.7473582032263737 1.3180233001589552 1.5833668628112614
+1.9165290157600623 1.1129504910198773 1.3836883498990558
+1.932668171856823 1.154901620023423 1.3257845443224259
+0.76202597787065152 0.79790881588591023 0.049985516902534055
+0.80345079128735619 0.73465643734769381 0.056092588060981829
+0.049985516902534277 1.2379740221293494 0.79790881588591067
+0.056092588060981941 1.1965492087126446 0.73465643734769381
+0.083470984239937707 0.88704950898012358 0.61631165010094424
+0.067331828143176842 0.84509837997657777 0.67421545567757424
+0.43503557314734087 1 1.8251152624882456
+0.37411588821993702 1 1.7799160715239055
+0.19642147525981468 0.81724226648384946 1.5664460834152065
+0.22223344816659929 0.74936391388968104 1.5764206304327446
+0.41285875964110408 1.712040460968117 1.3850500562448065
+0.41663313718873862 1.7473582032263741 1.318023300158955
+0.32060342556491628 1.7337712822439113 1
+0.26867774954383239 1.6820320857465041 1.0000000000000002
+0.76202597787065152 0.79790881588591056 1.9500144830974659
+0.80345079128735619 0.73465643734769381 1.9439074119390183
+1.1129504910198773 0.61631165010094424 1.9165290157600623
+1.1549016200234223 0.67421545567757413 1.932668171856823
+1.7120404609681168 0.61494994375519396 1.5871412403588967
+1.7473582032263737 0.68197669984104503 1.5833668628112616
+1.7337712822439113 1 1.6793965744350836
+1.6820320857465041 1 1.7313222504561676
+1.5649644268526592 1 1.8251152624882454
+1.6258841117800629 1.0000000000000002 1.7799160715239055
+1.803578524740185 1.1827577335161514 1.5664460834152067
+1.7777665518334005 1.2506360861103192 1.5764206304327451
+1.8251152624882454 1.5649644268526592 1
+1.7799160715239055 1.6258841117800629 1.0000000000000002
+1.5664460834152067 1.803578524740185 1.1827577335161514
+1.5764206304327446 1.7777665518334007 1.2506360861103192
+1.5871412403588967 1.7120404609681164 1.3850500562448067
+1.5833668628112614 1.7473582032263737 1.3180233001589552
+1.3836883498990558 1.9165290157600623 1.1129504910198773
+1.3257845443224259 1.932668171856823 1.154901620023423
+0.79790881588591056 1.9500144830974659 0.76202597787065107
+0.73465643734769381 1.9439074119390181 0.80345079128735586
+0.61631165010094424 1.9165290157600623 1.1129504910198773
+0.67421545567757413 1.932668171856823 1.1549016200234223
+0.79790881588591023 1.9500144830974657 1.2379740221293494
+0.73465643734769381 1.9439074119390181 1.1965492087126439
+0.4335539165847937 1.8035785247401852 1.1827577335161514
+0.42357936956725528 1.7777665518334005 1.2506360861103192
+0.049985516902534388 1.2379740221293494 1.20209118411409
+0.056092588060981941 1.1965492087126439 1.2653435626523064
+0.19642147525981501 1.1827577335161514 1.5664460834152067
+0.22223344816659973 1.2506360861103192 1.5764206304327453
+0.28795953903188365 1.3850500562448065 1.5871412403588967
+0.25264179677362619 1.318023300158955 1.5833668628112618
+0.26622871775608847 1 1.6793965744350836
+0.31796791425349591 1.0000000000000002 1.7313222504561674
+0.61494994375519374 0.41285875964110375 1.712040460968117
+0.68197669984104503 0.41663313718873862 1.7473582032263741
+0.88704950898012358 0.61631165010094435 1.9165290157600623
+0.84509837997657777 0.67421545567757435 1.932668171856823
+1.712040460968117 1.3850500562448065 0.41285875964110408
+1.7473582032263741 1.318023300158955 0.41663313718873862
+1.7337712822439113 1 0.32060342556491628
+1.6820320857465041 1.0000000000000002 0.26867774954383239
+1.3850500562448067 0.41285875964110363 0.28795953903188343
+1.3180233001589552 0.41663313718873873 0.25264179677362608
+1.1129504910198773 0.61631165010094446 0.083470984239937707
+1.154901620023423 0.67421545567757435 0.067331828143176842
+1.2379740221293494 0.79790881588591067 0.049985516902534166
+1.1965492087126446 0.73465643734769381 0.056092588060981941
+0.88704950898012358 0.61631165010094424 0.083470984239937707
+0.84509837997657777 0.67421545567757424 0.067331828143176842
+0.26622871775608858 1 0.32060342556491639
+0.31796791425349591 1 0.26867774954383261
+0.43503557314734065 1 0.1748847375117546
+0.37411588821993691 1.0000000000000002 0.22008392847609459
+0.19642147525981479 1.1827577335161514 0.43355391658479359
+0.22223344816659951 1.2506360861103192 0.42357936956725528
+0.17488473751175482 1.5649644268526597 1
+0.22008392847609459 1.6258841117800631 1
+0.43355391658479348 1.8035785247401854 0.81724226648384946
+0.42357936956725517 1.7777665518334005 0.74936391388968104
+0.41285875964110386 1.7120404609681168 0.61494994375519374
+0.41663313718873862 1.7473582032263741 0.68197669984104503
+0.61631165010094446 1.9165290157600623 0.88704950898012325
+0.67421545567757435 1.932668171856823 0.84509837997657744
+1.20209118411409 1.9500144830974655 1.2379740221293494
+1.2653435626523064 1.9439074119390178 1.1965492087126446
+1.3836883498990562 1.9165290157600621 0.88704950898012325
+1.3257845443224261 1.932668171856823 0.84509837997657744
+1.20209118411409 1.9500144830974657 0.76202597787065107
+1.2653435626523066 1.9439074119390181 0.80345079128735586
+1.5664460834152067 1.8035785247401852 0.81724226648384946
+1.5764206304327451 1.7777665518334005 0.74936391388968104
+1.9500144830974657 1.2379740221293494 0.79790881588591023
+1.9439074119390181 1.1965492087126439 0.73465643734769381
+1.8035785247401852 1.1827577335161514 0.4335539165847937
+1.7777665518334005 1.2506360861103192 0.42357936956725528
+1.9500144830974659 0.76202597787065152 1.20209118411409
+1.9439074119390181 0.80345079128735619 1.2653435626523064
+1.8035785247401852 0.81724226648384946 1.5664460834152067
+1.7777665518334005 0.74936391388968104 1.5764206304327451
+1.2379740221293494 0.79790881588591023 1.9500144830974657
+1.1965492087126439 0.73465643734769381 1.9439074119390181
+1.1827577335161514 0.43355391658479359 1.8035785247401852
+1.2506360861103192 0.42357936956725528 1.7777665518334005
+1.3850500562448065 0.41285875964110408 1.712040460968117
+1.318023300158955 0.41663313718873862 1.7473582032263741
+1 0.32060342556491628 1.7337712822439113
+1.0000000000000002 0.26867774954383239 1.6820320857465041
+0.41285875964110363 0.28795953903188343 1.3850500562448067
+0.41663313718873873 0.25264179677362608 1.3180233001589552
+0.61631165010094446 0.083470984239937707 1.1129504910198773
+0.67421545567757435 0.067331828143176842 1.154901620023423
+0.79790881588591067 0.049985516902534166 1.2379740221293494
+0.73465643734769381 0.056092588060981941 1.1965492087126446
+0.61631165010094424 0.083470984239937596 0.88704950898012358
+0.67421545567757413 0.06733182814317662 0.84509837997657777
+1 0.3206034255649165 0.26622871775608858
+1 0.26867774954383261 0.31796791425349591
+1 0.1748847375117546 0.43503557314734065
+1.0000000000000002 0.22008392847609459 0.37411588821993691
+1.1827577335161514 0.43355391658479359 0.19642147525981479
+1.2506360861103192 0.42357936956725528 0.22223344816659951
+1.5649644268526597 1 0.17488473751175482
+1.6258841117800631 1 0.22008392847609459
+1.8035785247401854 0.81724226648384946 0.43355391658479348
+1.7777665518334005 0.74936391388968104 0.42357936956725517
+1.712040460968117 0.61494994375519374 0.41285875964110375
+1.7473582032263741 0.68197669984104503 0.41663313718873862
+1.9165290157600623 0.88704950898012358 0.61631165010094435
+1.932668171856823 0.84509837997657777 0.67421545567757435
+1.9500144830974655 1.2379740221293494 1.20209118411409
+1.9439074119390178 1.1965492087126446 1.2653435626523064
+1.9165290157600621 0.88704950898012358 1.3836883498990562
+1.932668171856823 0.84509837997657777 1.3257845443224261
+1.9500144830974659 0.76202597787065152 0.79790881588591056
+1.9439074119390183 0.80345079128735619 0.73465643734769381
+1.9165290157600623 1.1129504910198773 0.61631165010094424
+1.932668171856823 1.1549016200234223 0.67421545567757413
+1.5871412403588967 1.7120404609681168 0.61494994375519396
+1.5833668628112616 1.7473582032263737 0.68197669984104503
+1.6793965744350836 1.7337712822439113 1
+1.7313222504561676 1.6820320857465041 1
+0.79790881588591023 0.049985516902534055 0.76202597787065152
+0.73465643734769381 0.056092588060981829 0.80345079128735619
+0.049985516902534055 0.76202597787065152 0.79790881588591023
+0.056092588060981829 0.80345079128735619 0.73465643734769381
+0.32060342556491639 0.26622871775608858 1
+0.26867774954383261 0.31796791425349591 1
+0.28795953903188365 0.61494994375519385 1.5871412403588971
+0.25264179677362608 0.68197669984104492 1.5833668628112616
+0.083470984239937707 0.88704950898012358 1.3836883498990558
+0.067331828143176842 0.84509837997657777 1.3257845443224259
+0.1748847375117546 0.43503557314734065 1
+0.22008392847609459 0.37411588821993691 1.0000000000000002
+0.43355391658479359 0.19642147525981479 1.1827577335161514
+0.42357936956725528 0.22223344816659951 1.2506360861103192
+1 0.17488473751175482 1.5649644268526597
+1 0.22008392847609459 1.6258841117800631
+0.81724226648384946 0.43355391658479348 1.8035785247401854
+0.74936391388968104 0.42357936956725517 1.7777665518334005
+0.28795953903188343 1.3850500562448067 0.41285875964110363
+0.25264179677362608 1.3180233001589552 0.41663313718873873
+0.083470984239937707 1.1129504910198773 0.61631165010094446
+0.067331828143176842 1.154901620023423 0.67421545567757435
+0.049985516902534055 0.76202597787065152 1.20209118411409
+0.056092588060981941 0.80345079128735619 1.2653435626523064
+0.08347098423993804 1.1129504910198773 1.3836883498990562
+0.067331828143176842 1.1549016200234223 1.3257845443224259
+1.6562122655612299 1.3949848817576367 1.6429404371401004
+1.4382389584574513 1.5296997941879908 1.7261988318135251
+1.2047014786826495 1.9270588370822881 1.3141006482208728
+1.0699865662522952 1.8438004424088632 1.5320739553246518
+0.47030020581200926 1.7261988318135253 1.4382389584574511
+0.60501511824236354 1.6429404371401004 1.6562122655612299
+0.46792604467534848 1.0699865662522952 1.8438004424088636
+0.68589935177912764 1.2047014786826495 1.9270588370822881
+1.2008600052687632 0.86528508756964573 1.9703129137821027
+1.2008600052687632 1.1347149124303546 1.9703129137821027
+0.79913999473123709 0.86528508756964573 0.029687086217897174
+0.79913999473123709 1.1347149124303546 0.029687086217897174
+0.34378773443876987 1.3949848817576367 0.3570595628598997
+0.56176104154254902 1.5296997941879913 0.27380116818647482
+0.7952985213173509 1.9270588370822881 0.68589935177912764
+0.93001343374770529 1.8438004424088634 0.46792604467534826
+1.5296997941879913 1.7261988318135248 0.56176104154254891
+1.3949848817576367 1.6429404371401006 0.34378773443876998
+1.5320739553246518 1.0699865662522952 0.15619955759113668
+1.3141006482208728 1.2047014786826495 0.07294116291771191
+1.0699865662522952 0.15619955759113668 1.5320739553246518
+1.2047014786826495 0.07294116291771191 1.3141006482208728
+0.86528508756964573 0.029687086217897174 0.79913999473123709
+1.1347149124303546 0.029687086217897174 0.79913999473123709
+1.3949848817576367 0.3570595628598997 0.34378773443876987
+1.5296997941879913 0.27380116818647482 0.56176104154254902
+1.9270588370822881 0.68589935177912764 0.7952985213173509
+1.8438004424088634 0.46792604467534826 0.93001343374770529
+1.7261988318135253 0.56176104154254913 1.5296997941879908
+1.6429404371401006 0.34378773443876998 1.3949848817576367
+1.6429404371401004 1.6562122655612299 1.3949848817576369
+1.7261988318135248 1.4382389584574513 1.5296997941879911
+0.029687086217897396 1.2008600052687632 1.1347149124303546
+0.029687086217897174 1.2008600052687632 0.86528508756964573
+0.68589935177912764 0.7952985213173509 1.9270588370822881
+0.46792604467534826 0.93001343374770529 1.8438004424088634
+0.27380116818647515 1.4382389584574511 1.5296997941879913
+0.3570595628598997 1.6562122655612304 1.3949848817576367
+0.79913999473123698 1.1347149124303548 1.9703129137821027
+0.79913999473123698 0.86528508756964573 1.9703129137821027
+1.4382389584574511 0.47030020581200926 1.7261988318135253
+1.6562122655612299 0.60501511824236354 1.6429404371401004
+1.3141006482208728 1.2047014786826495 1.9270588370822881
+1.5320739553246518 1.0699865662522952 1.8438004424088632
+1.9270588370822881 1.3141006482208728 1.2047014786826495
+1.8438004424088632 1.5320739553246518 1.0699865662522952
+1.3949848817576369 1.6429404371401004 1.6562122655612299
+1.5296997941879911 1.7261988318135248 1.4382389584574513
+1.1347149124303548 1.9703129137821027 0.79913999473123687
+0.86528508756964584 1.9703129137821027 0.79913999473123709
+0.93001343374770529 1.8438004424088634 1.5320739553246518
+0.7952985213173509 1.9270588370822881 1.3141006482208728
+0.15619955759113668 1.5320739553246518 1.0699865662522952
+0.07294116291771191 1.3141006482208728 1.2047014786826495
+0.56176104154254913 1.5296997941879908 1.7261988318135253
+0.34378773443876998 1.3949848817576367 1.6429404371401006
+0.34378773443876998 0.60501511824236354 1.6429404371401006
+0.56176104154254913 0.47030020581200926 1.7261988318135253
+1.4382389584574513 1.5296997941879913 0.27380116818647504
+1.6562122655612304 1.3949848817576367 0.3570595628598997
+1.6562122655612304 0.60501511824236343 0.3570595628598997
+1.4382389584574513 0.47030020581200915 0.27380116818647493
+1.2008600052687632 1.1347149124303546 0.029687086217897396
+1.2008600052687632 0.86528508756964573 0.029687086217897174
+0.68589935177912764 1.2047014786826495 0.072941162917711799
+0.46792604467534848 1.0699865662522952 0.15619955759113646
+0.07294116291771191 1.3141006482208728 0.7952985213173509
+0.15619955759113657 1.5320739553246518 0.93001343374770529
+0.60501511824236354 1.6429404371401004 0.34378773443876998
+0.47030020581200915 1.7261988318135253 0.56176104154254902
+0.86528508756964584 1.9703129137821027 1.2008600052687632
+1.1347149124303546 1.9703129137821027 1.2008600052687632
+1.0699865662522952 1.8438004424088636 0.46792604467534848
+1.2047014786826495 1.9270588370822881 0.68589935177912764
+1.8438004424088634 1.5320739553246518 0.93001343374770529
+1.9270588370822881 1.3141006482208728 0.7952985213173509
+1.8438004424088636 0.46792604467534848 1.0699865662522952
+1.9270588370822881 0.68589935177912764 1.2047014786826495
+1.5320739553246518 0.93001343374770529 1.8438004424088634
+1.3141006482208728 0.7952985213173509 1.9270588370822881
+1.5296997941879913 0.27380116818647515 1.4382389584574511
+1.3949848817576367 0.3570595628598997 1.6562122655612304
+0.60501511824236343 0.3570595628598997 1.6562122655612304
+0.47030020581200915 0.27380116818647493 1.4382389584574513
+1.1347149124303546 0.029687086217897396 1.2008600052687632
+0.86528508756964573 0.029687086217897174 1.2008600052687632
+1.2047014786826495 0.072941162917711799 0.68589935177912764
+1.0699865662522952 0.15619955759113646 0.46792604467534848
+1.3141006482208724 0.7952985213173509 0.072941162917711799
+1.5320739553246518 0.93001343374770529 0.15619955759113657
+1.6429404371401006 0.34378773443876998 0.60501511824236354
+1.7261988318135253 0.56176104154254913 0.47030020581200926
+1.9703129137821027 1.2008600052687632 0.86528508756964573
+1.9703129137821027 1.2008600052687632 1.1347149124303546
+1.9703129137821027 0.79913999473123709 1.1347149124303546
+1.9703129137821027 0.79913999473123709 0.86528508756964584
+1.7261988318135253 1.4382389584574511 0.47030020581200926
+1.6429404371401004 1.6562122655612299 0.60501511824236354
+0.3570595628598997 0.34378773443876987 1.3949848817576367
+0.27380116818647504 0.56176104154254891 1.5296997941879913
+0.072941162917711799 0.68589935177912764 1.2047014786826495
+0.15619955759113646 0.46792604467534848 1.0699865662522952
+0.7952985213173509 0.072941162917711799 1.3141006482208724
+0.93001343374770529 0.15619955759113657 1.5320739553246518
+0.3570595628598997 1.6562122655612304 0.60501511824236343
+0.27380116818647493 1.4382389584574513 0.47030020581200915
+0.029687086217897174 0.79913999473123709 0.86528508756964573
+0.029687086217897174 0.79913999473123709 1.1347149124303546
+1.0650724998901953 1.6494337430038146 1.7576287898477037
+1.143241458288871 1.4447847530509046 1.8841088214019377
+1.1620856567445474 1.0671746383702749 1.984487586431394
+1.3878111467046637 1.20668066329285 1.898268121393853
+0.87351996844576596 1.6114818012702035 1.7810843797781308
+1.1264800315542343 1.611481801270203 1.7810843797781311
+1.4879855916616425 1.4689407649943766 1.7361824646493051
+1.4017661266241019 1.6946662549544924 1.5966764397267301
+0.8567585417111292 1.444784753050905 1.8841088214019377
+0.93492750010980485 1.6494337430038146 1.7576287898477037
+1.1395060249225755 1.8567519116990399 1.4965019947697513
+0.86049397507742498 1.8567519116990399 1.4965019947697515
+1.0379519417336116 1.3797122531607096 1.9243258380670021
+0.83330295178070157 1.5061922847149436 1.8461568796683263
+0.59823387337589862 1.6946662549544926 1.5966764397267301
+0.51201440833835776 1.4689407649943764 1.7361824646493056
+1.1666970482192984 1.5061922847149436 1.8461568796683263
+0.96204805826638895 1.3797122531607096 1.9243258380670021
+0.61218885329533657 1.2066806632928504 1.8982681213938526
+0.83791434325545278 1.0671746383702752 1.9844875864313942
+0.83330295178070157 1.5061922847149436 0.15384312033167369
+1.0379519417336116 1.3797122531607096 0.075674161932997919
+1.3878111467046634 1.2066806632928504 0.10173187860614719
+1.1620856567445474 1.0671746383702752 0.015512413568605998
+0.93492750010980485 1.6494337430038146 0.24237121015229646
+0.8567585417111292 1.4447847530509046 0.11589117859806208
+0.83791434325545289 1.0671746383702749 0.015512413568605887
+0.61218885329533657 1.2066806632928497 0.10173187860614707
+1.1264800315542343 1.611481801270203 0.21891562022186883
+0.87351996844576596 1.6114818012702032 0.21891562022186895
+0.51201440833835754 1.4689407649943766 0.26381753535069474
+0.59823387337589873 1.6946662549544924 0.40332356027326965
+1.143241458288871 1.4447847530509048 0.11589117859806231
+1.0650724998901953 1.6494337430038146 0.24237121015229646
+0.86049397507742531 1.8567519116990399 0.50349800523024868
+1.1395060249225755 1.8567519116990399 0.50349800523024868
+0.96204805826638895 1.3797122531607096 0.075674161932997919
+1.1666970482192986 1.5061922847149436 0.15384312033167369
+1.401766126624101 1.6946662549544926 0.40332356027326954
+1.4879855916616427 1.4689407649943764 0.26381753535069474
+1.3797122531607096 0.075674161932997919 0.96204805826638895
+1.5061922847149436 0.15384312033167369 1.1666970482192986
+1.6946662549544926 0.40332356027326954 1.401766126624101
+1.4689407649943764 0.26381753535069496 1.4879855916616429
+1.5061922847149436 0.15384312033167369 0.83330295178070157
+1.3797122531607096 0.075674161932997919 1.0379519417336116
+1.2066806632928504 0.1017318786061473 1.3878111467046637
+1.0671746383702752 0.015512413568605998 1.1620856567445474
+1.6494337430038146 0.24237121015229646 0.93492750010980485
+1.4447847530509046 0.11589117859806219 0.8567585417111292
+1.0671746383702749 0.015512413568605887 0.83791434325545289
+1.2066806632928497 0.10173187860614707 0.61218885329533657
+1.6114818012702032 0.21891562022186895 1.1264800315542343
+1.6114818012702032 0.21891562022186895 0.87351996844576596
+1.4689407649943766 0.26381753535069474 0.51201440833835754
+1.6946662549544924 0.40332356027326965 0.59823387337589873
+1.4447847530509048 0.11589117859806242 1.143241458288871
+1.6494337430038146 0.24237121015229646 1.0650724998901953
+1.8567519116990399 0.50349800523024868 0.86049397507742531
+1.8567519116990399 0.50349800523024868 1.1395060249225755
+1.7576287898477037 1.0650724998901953 1.6494337430038146
+1.8841088214019377 1.143241458288871 1.4447847530509046
+1.984487586431394 1.1620856567445474 1.0671746383702749
+1.898268121393853 1.3878111467046637 1.20668066329285
+1.0379519417336116 0.62028774683929067 0.075674161932997919
+0.15384312033167369 1.1666970482192984 0.4938077152850564
+0.075674161932997919 0.96204805826638895 0.62028774683929022
+0.015512413568605887 0.83791434325545289 0.93282536162972529
+0.21891562022186895 1.1264800315542343 1.6114818012702032
+0.21891562022186895 0.87351996844576596 1.6114818012702032
+0.26381753535069474 0.51201440833835754 1.4689407649943766
+0.40332356027326965 0.59823387337589873 1.6946662549544924
+0.55521524694909519 1.8841088214019377 1.143241458288871
+0.35056625699618549 1.7576287898477037 1.0650724998901953
+0.14324808830096003 1.4965019947697515 0.86049397507742531
+0.14324808830096014 1.4965019947697515 1.1395060249225755
+0.83330295178070157 0.49380771528505629 1.8461568796683263
+1.0379519417336116 0.62028774683929033 1.9243258380670021
+1.3878111467046637 0.79331933670715005 1.898268121393853
+1.1620856567445474 0.93282536162972529 1.984487586431394
+1.8841088214019377 0.8567585417111292 1.444784753050905
+1.7576287898477037 0.93492750010980485 1.6494337430038146
+1.4965019947697513 1.1395060249225755 1.8567519116990399
+1.4965019947697515 0.86049397507742498 1.8567519116990399
+1.7810843797781308 0.87351996844576596 1.6114818012702035
+1.7810843797781311 1.1264800315542343 1.611481801270203
+1.7361824646493051 1.4879855916616425 1.4689407649943764
+1.5966764397267301 1.4017661266241017 1.6946662549544924
+1.6114818012702035 1.7810843797781308 0.87351996844576596
+1.6114818012702035 1.7810843797781308 1.1264800315542343
+1.4689407649943766 1.7361824646493051 1.4879855916616425
+1.6946662549544924 1.5966764397267301 1.4017661266241019
+1.6494337430038151 1.7576287898477032 1.0650724998901953
+1.4447847530509046 1.8841088214019377 1.143241458288871
+1.0671746383702749 1.984487586431394 1.1620856567445474
+1.2066806632928497 1.898268121393853 1.3878111467046634
+0.49380771528505629 1.8461568796683263 0.83330295178070157
+0.62028774683929033 1.9243258380670021 1.0379519417336116
+0.79331933670715005 1.898268121393853 1.3878111467046637
+0.93282536162972529 1.984487586431394 1.1620856567445474
+0.62028774683929067 1.9243258380670021 0.96204805826638862
+0.49380771528505629 1.8461568796683263 1.1666970482192989
+0.30533374504550748 1.5966764397267301 1.4017661266241017
+0.53105923500562402 1.7361824646493054 1.4879855916616427
+0.075674161932997919 0.96204805826638895 1.3797122531607096
+0.15384312033167369 1.1666970482192986 1.5061922847149436
+0.40332356027326965 1.4017661266241013 1.6946662549544924
+0.26381753535069508 1.4879855916616427 1.4689407649943766
+0.11589117859806242 1.143241458288871 1.4447847530509048
+0.24237121015229646 1.0650724998901953 1.6494337430038146
+0.50349800523024868 0.86049397507742531 1.8567519116990399
+0.50349800523024868 1.1395060249225755 1.8567519116990399
+0.93492750010980485 0.35056625699618549 1.7576287898477037
+0.8567585417111292 0.55521524694909519 1.8841088214019377
+0.83791434325545278 0.93282536162972529 1.9844875864313942
+0.61218885329533645 0.79331933670715005 1.898268121393853
+1.8841088214019377 1.143241458288871 0.55521524694909519
+1.7576287898477037 1.0650724998901953 0.35056625699618549
+1.4965019947697515 0.86049397507742531 0.14324808830096003
+1.4965019947697513 1.1395060249225755 0.14324808830096014
+1.0650724998901953 0.35056625699618549 0.24237121015229646
+1.143241458288871 0.55521524694909541 0.11589117859806231
+1.1620856567445474 0.93282536162972529 0.015512413568605998
+1.3878111467046634 0.79331933670715005 0.10173187860614719
+1.1666970482192984 0.4938077152850564 0.15384312033167369
+0.96204805826638895 0.62028774683929033 0.07567416193299803
+0.83791434325545289 0.93282536162972529 0.015512413568605887
+0.50349800523024868 1.1395060249225755 0.14324808830096003
+0.21891562022186895 1.1264800315542343 0.38851819872979687
+0.26381753535069463 1.4879855916616429 0.5310592350056238
+0.40332356027326977 1.4017661266241015 0.30533374504550737
+0.38851819872979698 1.7810843797781313 1.1264800315542343
+0.38851819872979698 1.7810843797781313 0.87351996844576596
+0.53105923500562391 1.7361824646493056 0.51201440833835743
+0.30533374504550737 1.5966764397267303 0.59823387337589851
+0.35056625699618538 1.7576287898477037 0.93492750010980485
+0.55521524694909519 1.8841088214019377 0.8567585417111292
+0.93282536162972529 1.9844875864313942 0.83791434325545266
+0.79331933670715016 1.898268121393853 0.61218885329533679
+1.5061922847149436 1.8461568796683263 1.1666970482192984
+1.3797122531607098 1.9243258380670021 0.96204805826638862
+1.2066806632928504 1.8982681213938526 0.61218885329533623
+1.0671746383702752 1.984487586431394 0.83791434325545278
+1.3797122531607098 1.9243258380670021 1.0379519417336116
+1.5061922847149436 1.8461568796683263 0.83330295178070157
+1.6946662549544926 1.5966764397267301 0.59823387337589862
+1.4689407649943764 1.7361824646493054 0.51201440833835765
+1.9243258380670021 0.96204805826638895 0.62028774683929067
+1.8461568796683263 1.1666970482192989 0.49380771528505629
+1.5966764397267303 1.4017661266241015 0.30533374504550737
+1.7361824646493054 1.4879855916616427 0.53105923500562402
+1.9243258380670021 1.0379519417336116 1.3797122531607096
+1.8461568796683263 0.83330295178070157 1.5061922847149436
+1.5966764397267301 0.59823387337589862 1.6946662549544926
+1.7361824646493056 0.51201440833835776 1.4689407649943764
+0.96204805826638895 0.62028774683929067 1.9243258380670021
+1.1666970482192989 0.49380771528505629 1.8461568796683263
+1.4017661266241015 0.30533374504550737 1.5966764397267303
+1.4879855916616427 0.53105923500562402 1.7361824646493054
+1.143241458288871 0.55521524694909519 1.8841088214019377
+1.0650724998901953 0.35056625699618549 1.7576287898477037
+0.86049397507742531 0.14324808830096003 1.4965019947697515
+1.1395060249225755 0.14324808830096014 1.4965019947697515
+0.35056625699618538 0.24237121015229635 1.0650724998901953
+0.55521524694909519 0.11589117859806231 1.143241458288871
+0.93282536162972529 0.015512413568605998 1.1620856567445474
+0.79331933670715005 0.10173187860614719 1.3878111467046634
+0.4938077152850564 0.15384312033167369 1.1666970482192984
+0.62028774683929022 0.075674161932997919 0.96204805826638895
+0.93282536162972529 0.015512413568605887 0.83791434325545289
+1.1395060249225755 0.14324808830096003 0.50349800523024868
+1.1264800315542343 0.38851819872979687 0.21891562022186895
+1.4879855916616429 0.5310592350056238 0.26381753535069463
+1.4017661266241017 0.30533374504550759 0.40332356027326965
+1.7810843797781308 1.1264800315542343 0.38851819872979676
+1.7810843797781313 0.87351996844576596 0.38851819872979698
+1.7361824646493056 0.51201440833835754 0.53105923500562391
+1.5966764397267303 0.59823387337589851 0.30533374504550737
+1.7576287898477037 0.93492750010980485 0.35056625699618549
+1.8841088214019377 0.8567585417111292 0.55521524694909519
+1.9844875864313942 0.83791434325545289 0.93282536162972529
+1.898268121393853 0.61218885329533679 0.79331933670715016
+1.8461568796683263 1.1666970482192984 1.5061922847149436
+1.9243258380670021 0.96204805826638895 1.3797122531607096
+1.8982681213938526 0.61218885329533657 1.2066806632928504
+1.984487586431394 0.83791434325545289 1.0671746383702752
+1.8461568796683263 0.83330295178070157 0.49380771528505629
+1.9243258380670021 1.0379519417336116 0.62028774683929033
+1.898268121393853 1.3878111467046637 0.79331933670715005
+1.984487586431394 1.1620856567445474 0.93282536162972529
+1.444784753050905 1.8841088214019377 0.8567585417111292
+1.6494337430038146 1.7576287898477037 0.93492750010980485
+1.8567519116990399 1.4965019947697513 1.1395060249225755
+1.8567519116990399 1.4965019947697515 0.86049397507742498
+0.62028774683929067 0.075674161932997919 1.0379519417336116
+0.075674161932997919 1.0379519417336116 0.62028774683929067
+0.14324808830096003 0.50349800523024868 1.1395060249225755
+0.24237121015229646 0.93492750010980485 1.6494337430038146
+0.11589117859806231 0.8567585417111292 1.4447847530509046
+0.015512413568605887 0.83791434325545289 1.0671746383702749
+0.10173187860614707 0.61218885329533657 1.2066806632928497
+0.38851819872979687 0.21891562022186895 1.1264800315542343
+0.5310592350056238 0.26381753535069463 1.4879855916616429
+0.30533374504550759 0.40332356027326965 1.4017661266241017
+1.1264800315542343 0.38851819872979665 1.7810843797781311
+0.87351996844576596 0.38851819872979698 1.7810843797781313
+0.51201440833835754 0.53105923500562391 1.7361824646493056
+0.59823387337589851 0.30533374504550737 1.5966764397267303
+0.24237121015229646 1.0650724998901953 0.35056625699618549
+0.11589117859806231 1.143241458288871 0.55521524694909541
+0.015512413568605998 1.1620856567445474 0.93282536162972529
+0.10173187860614707 1.3878111467046637 0.79331933670715005
+0.15384312033167369 0.83330295178070157 1.5061922847149436
+0.075674161932997919 1.0379519417336116 1.3797122531607096
+0.1017318786061473 1.3878111467046637 1.2066806632928504
+0.015512413568605998 1.1620856567445474 1.0671746383702752
+1.6492798617857436 1.2046978598347686 1.7324851174314406
+1.589425686808948 1.2073123918032649 1.7807681678543315
+1.4012770227944238 1.8539777216205118 1.3312080946370168
+1.4048073899588975 1.8217822259851766 1.4010049252683978
+0.59872297720557688 1.8539777216205122 1.3312080946370171
+0.66075903908278355 1.8623045076538935 1.3759607778954341
+0.35072013821425641 1.2046978598347684 1.7324851174314406
+0.38553016581808797 1.2728788208449453 1.7402458861856145
+1.0000000000000002 0.80342083704034495 1.9804879564227607
+0.95947771833128337 0.86807143088604799 1.9904306120773461
+1.0000000000000002 0.80342083704034484 0.019512043577239457
+1.0405222816687167 0.86807143088604799 0.009569387922653938
+0.35072013821425641 1.2046978598347684 0.26751488256855949
+0.41057431319105175 1.2073123918032649 0.21923183214566866
+0.59872297720557666 1.8539777216205122 0.66879190536298361
+0.5951926100411028 1.8217822259851768 0.59899507473160252
+1.401277022794424 1.8539777216205118 0.66879190536298383
+1.3392409609172167 1.8623045076538935 0.6240392221045663
+1.649279861785744 1.2046978598347684 0.26751488256855982
+1.6144698341819124 1.2728788208449453 0.25975411381438585
+1.2046978598347684 0.26751488256855982 1.649279861785744
+1.2728788208449453 0.25975411381438585 1.6144698341819124
+0.80342083704034495 0.019512043577239346 1.0000000000000002
+0.86807143088604799 0.009569387922653938 1.0405222816687167
+1.2046978598347686 0.2675148825685596 0.35072013821425641
+1.2073123918032649 0.21923183214566866 0.41057431319105175
+1.8539777216205122 0.66879190536298383 0.59872297720557643
+1.8217822259851768 0.59899507473160252 0.5951926100411028
+1.853977721620512 0.66879190536298383 1.4012770227944238
+1.8623045076538935 0.6240392221045663 1.3392409609172167
+1.7324851174314406 1.6492798617857436 1.2046978598347684
+1.7807681678543315 1.589425686808948 1.2073123918032649
+0.019512043577239457 1.0000000000000002 1.1965791629596561
+0.009569387922654049 0.95947771833128337 1.1319285691139529
+0.66879190536298383 0.59872297720557643 1.8539777216205122
+0.59899507473160252 0.5951926100411028 1.8217822259851768
+0.14602227837948833 1.3312080946370171 1.401277022794424
+0.1376954923461069 1.3759607778954341 1.3392409609172171
+1.0000000000000002 1.1965791629596558 1.9804879564227607
+1.0405222816687167 1.1319285691139529 1.9904306120773461
+1.3312080946370171 0.59872297720557688 1.8539777216205122
+1.3759607778954341 0.66075903908278355 1.8623045076538935
+1.3312080946370168 1.4012770227944238 1.8539777216205118
+1.4010049252683978 1.4048073899588975 1.8217822259851766
+1.8539777216205118 1.3312080946370168 1.4012770227944238
+1.8217822259851766 1.4010049252683978 1.4048073899588975
+1.2046978598347684 1.7324851174314406 1.6492798617857436
+1.2073123918032649 1.7807681678543315 1.589425686808948
+1.1965791629596561 1.9804879564227607 1
+1.1319285691139529 1.9904306120773461 1.0405222816687167
+0.79530214016523215 1.7324851174314406 1.6492798617857436
+0.72712117915505503 1.7402458861856145 1.6144698341819124
+0.26751488256855993 1.649279861785744 1.2046978598347684
+0.25975411381438585 1.6144698341819124 1.2728788208449453
+0.66879190536298383 1.4012770227944238 1.853977721620512
+0.6240392221045663 1.3392409609172167 1.8623045076538935
+0.35072013821425629 0.79530214016523215 1.7324851174314406
+0.41057431319105175 0.79268760819673556 1.7807681678543315
+1.3312080946370171 1.401277022794424 0.14602227837948833
+1.3759607778954341 1.3392409609172167 0.13769549234610667
+1.6492798617857436 0.79530214016523215 0.26751488256855938
+1.589425686808948 0.79268760819673556 0.21923183214566844
+1.0000000000000002 1.1965791629596558 0.019512043577239568
+0.95947771833128337 1.1319285691139529 0.009569387922654049
+0.66879190536298361 1.4012770227944238 0.146022278379488
+0.59899507473160241 1.4048073899588978 0.17821777401482342
+0.14602227837948811 1.3312080946370171 0.59872297720557643
+0.17821777401482353 1.401004925268398 0.59519261004110269
+0.79530214016523226 1.7324851174314406 0.35072013821425641
+0.79268760819673556 1.7807681678543315 0.41057431319105175
+0.80342083704034506 1.9804879564227607 1.0000000000000002
+0.86807143088604799 1.9904306120773461 0.95947771833128337
+1.2046978598347684 1.7324851174314404 0.35072013821425629
+1.2728788208449453 1.7402458861856145 0.38553016581808797
+1.7324851174314402 1.649279861785744 0.79530214016523226
+1.7402458861856145 1.6144698341819124 0.72712117915505503
+1.7324851174314406 0.35072013821425641 1.2046978598347684
+1.7402458861856145 0.38553016581808797 1.2728788208449453
+1.6492798617857436 0.79530214016523215 1.7324851174314406
+1.6144698341819124 0.72712117915505503 1.7402458861856145
+1.401277022794424 0.14602227837948833 1.3312080946370171
+1.3392409609172169 0.13769549234610667 1.3759607778954344
+0.79530214016523215 0.26751488256855938 1.6492798617857436
+0.79268760819673556 0.21923183214566844 1.589425686808948
+1.1965791629596561 0.019512043577239457 1.0000000000000002
+1.1319285691139529 0.009569387922654049 0.95947771833128337
+1.4012770227944238 0.146022278379488 0.66879190536298361
+1.4048073899588978 0.17821777401482342 0.59899507473160241
+1.3312080946370175 0.59872297720557643 0.14602227837948822
+1.401004925268398 0.59519261004110269 0.17821777401482342
+1.7324851174314406 0.35072013821425641 0.79530214016523226
+1.7807681678543315 0.41057431319105175 0.79268760819673556
+1.9804879564227607 1.0000000000000002 0.80342083704034484
+1.9904306120773461 0.95947771833128337 0.86807143088604799
+1.9804879564227607 1.0000000000000002 1.1965791629596558
+1.9904306120773461 1.0405222816687167 1.1319285691139529
+1.853977721620512 1.3312080946370168 0.59872297720557677
+1.8623045076538935 1.3759607778954341 0.66075903908278355
+0.2675148825685596 0.35072013821425641 1.2046978598347686
+0.21923183214566866 0.41057431319105175 1.2073123918032649
+0.14602227837948811 0.66879190536298361 1.401277022794424
+0.17821777401482342 0.59899507473160241 1.4048073899588978
+0.59872297720557643 0.14602227837948822 1.3312080946370175
+0.59519261004110269 0.17821777401482342 1.401004925268398
+0.26751488256855938 1.6492798617857436 0.79530214016523215
+0.21923183214566844 1.589425686808948 0.79268760819673556
+0.019512043577239346 1.0000000000000002 0.80342083704034495
+0.009569387922653938 1.0405222816687167 0.86807143088604799
+1.2681715176003199 1.6892965611519348 1.6730187872058684
+1.0397345885584115 1.2602649483574222 1.9647192955096329
+0.86172631781262787 1.7695778385021761 1.6234022291431622
+1.2840795446225892 1.4603930887008656 1.8410333026720758
+0.64637064705828351 1.4655650436231658 1.8112924693932408
+1.1358362255269414 1.7199153070653641 1.6806397508870434
+0.91971872264975896 1.1973935260228461 1.9770315820848792
+0.79987185965655649 1.6801807185069524 1.7051970771451348
+1.3040127948790106 1.3356672082102183 1.8915737467434819
+0.74047778163550215 1.3961011738843632 1.8807678912304873
+0.69598720512098966 1.3356672082102183 0.10842625325651789
+1.2595222183644981 1.3961011738843632 0.11923210876951273
+0.73182848239968035 1.6892965611519353 0.32698121279413161
+0.96026541144158861 1.2602649483574222 0.035280704490367243
+1.1382736821873722 1.7695778385021763 0.37659777085683765
+0.71592045537741122 1.4603930887008656 0.15896669732792434
+1.3536293529417167 1.4655650436231658 0.18870753060675938
+0.86416377447305925 1.7199153070653641 0.31936024911295635
+1.0802812773502413 1.1973935260228461 0.022968417915120942
+1.2001281403434438 1.6801807185069524 0.29480292285486542
+1.1973935260228461 0.022968417915120942 1.0802812773502413
+1.6801807185069524 0.29480292285486542 1.2001281403434438
+1.3356672082102183 0.10842625325651789 0.69598720512098966
+1.3961011738843634 0.11923210876951296 1.2595222183644981
+1.6892965611519353 0.32698121279413161 0.73182848239968035
+1.2602649483574222 0.035280704490367243 0.96026541144158861
+1.7695778385021763 0.37659777085683765 1.1382736821873722
+1.4603930887008658 0.15896669732792446 0.715920455377411
+1.465565043623166 0.18870753060675938 1.3536293529417167
+1.7199153070653641 0.31936024911295635 0.86416377447305925
+1.6730187872058684 1.2681715176003199 1.689296561151935
+1.9647192955096329 1.0397345885584115 1.2602649483574222
+0.91971872264975896 0.80260647397715423 0.022968417915120942
+0.108426253256518 1.3040127948790108 0.66433279178978188
+0.37659777085683765 1.1382736821873722 1.7695778385021763
+0.15896669732792446 0.715920455377411 1.4603930887008658
+0.53443495637683469 1.8112924693932411 1.3536293529417167
+0.280084692934636 1.6806397508870434 0.86416377447305925
+0.69598720512098988 0.66433279178978188 1.8915737467434823
+1.2595222183644981 0.60389882611563706 1.8807678912304873
+1.8112924693932408 0.64637064705828351 1.4655650436231658
+1.6806397508870434 1.1358362255269414 1.7199153070653641
+1.6234022291431622 0.86172631781262787 1.7695778385021761
+1.8410333026720758 1.2840795446225892 1.4603930887008656
+1.7695778385021761 1.6234022291431622 0.86172631781262787
+1.4603930887008656 1.8410333026720758 1.2840795446225892
+1.6892965611519348 1.6730187872058684 1.2681715176003199
+1.2602649483574224 1.9647192955096329 1.0397345885584115
+0.66433279178978188 1.8915737467434823 0.69598720512098966
+0.60389882611563706 1.8807678912304873 1.2595222183644981
+0.80260647397715423 1.9770315820848792 1.0802812773502413
+0.3198192814930475 1.7051970771451346 1.2001281403434438
+0.022968417915120942 1.0802812773502413 1.1973935260228461
+0.29480292285486542 1.2001281403434438 1.6801807185069524
+0.18870753060675938 1.3536293529417167 1.465565043623166
+0.31936024911295646 0.86416377447305925 1.7199153070653639
+0.73182848239968035 0.31070343884806495 1.6730187872058686
+0.96026541144158861 0.73973505164257791 1.9647192955096329
+1.8112924693932411 1.3536293529417167 0.53443495637683469
+1.6806397508870434 0.86416377447305925 0.280084692934636
+1.2681715176003199 0.31070343884806495 0.32698121279413161
+1.0397345885584115 0.73973505164257791 0.035280704490367243
+1.3040127948790108 0.66433279178978188 0.108426253256518
+0.31936024911295646 1.1358362255269414 0.28008469293463611
+0.15896669732792446 1.2840795446225892 0.53960691129913418
+0.23042216149782391 1.6234022291431627 1.1382736821873722
+0.53960691129913418 1.8410333026720758 0.71592045537741122
+0.31070343884806495 1.6730187872058686 0.73182848239968035
+0.73973505164257791 1.9647192955096329 0.96026541144158861
+1.3356672082102183 1.8915737467434819 1.3040127948790106
+1.3961011738843634 1.8807678912304873 0.74047778163550193
+1.1973935260228461 1.9770315820848792 0.91971872264975862
+1.6801807185069524 1.7051970771451348 0.79987185965655649
+1.9770315820848792 1.0802812773502413 0.80260647397715423
+1.7051970771451346 1.2001281403434438 0.3198192814930475
+1.9770315820848792 0.91971872264975896 1.1973935260228461
+1.7051970771451346 0.79987185965655649 1.6801807185069522
+1.0802812773502413 0.80260647397715423 1.9770315820848792
+1.2001281403434438 0.3198192814930475 1.7051970771451346
+1.3536293529417167 0.53443495637683469 1.8112924693932411
+0.86416377447305925 0.280084692934636 1.6806397508870434
+0.31070343884806495 0.32698121279413161 1.2681715176003199
+0.73973505164257791 0.035280704490367243 1.0397345885584115
+0.66433279178978188 0.108426253256518 1.3040127948790108
+1.1358362255269414 0.28008469293463611 0.31936024911295646
+1.2840795446225892 0.53960691129913418 0.15896669732792446
+1.6234022291431627 1.1382736821873722 0.23042216149782391
+1.8410333026720758 0.71592045537741122 0.53960691129913418
+1.6730187872058686 0.73182848239968035 0.31070343884806495
+1.9647192955096329 0.96026541144158861 0.73973505164257791
+1.8915737467434819 1.3040127948790106 1.3356672082102183
+1.8807678912304873 0.74047778163550215 1.3961011738843632
+1.8915737467434823 0.69598720512098988 0.66433279178978188
+1.8807678912304873 1.2595222183644981 0.60389882611563706
+1.465565043623166 1.8112924693932408 0.64637064705828351
+1.7199153070653641 1.6806397508870434 1.1358362255269414
+0.80260647397715423 0.022968417915120942 0.91971872264975896
+0.022968417915120942 0.91971872264975896 0.80260647397715423
+0.28008469293463611 0.31936024911295646 1.1358362255269414
+0.32698121279413161 0.73182848239968035 1.6892965611519353
+0.035280704490367243 0.96026541144158861 1.2602649483574222
+0.53960691129913396 0.15896669732792457 1.2840795446225894
+1.1382736821873722 0.23042216149782391 1.6234022291431627
+0.71592045537741122 0.53960691129913418 1.8410333026720758
+0.32698121279413161 1.2681715176003199 0.31070343884806495
+0.035280704490367243 1.0397345885584115 0.73973505164257791
+0.10842625325651789 0.69598720512098966 1.3356672082102183
+0.11923210876951296 1.2595222183644981 1.3961011738843634
+1.6267476188075718 1.5155632797953902 1.5842789803216091
+1.0687157005262189 1.9453832490724943 1.3186356302649234
+0.41572101967839148 1.6267476188075716 1.5155632797953906
+0.57018003072289591 1.0000000000000002 1.9029146105865324
+1.3186356302649234 0.93128429947378155 1.9453832490724945
+0.68136436973507708 0.93128429947378122 0.054616750927505398
+0.37325238119242876 1.5155632797953904 0.41572101967839081
+0.93128429947378166 1.9453832490724945 0.68136436973507686
+1.5842789803216091 1.6267476188075718 0.48443672020460993
+1.4298199692771043 1.0000000000000002 0.097085389413467671
+1.0000000000000002 0.097085389413467671 1.4298199692771043
+0.93128429947378155 0.054616750927505398 0.68136436973507708
+1.5155632797953904 0.41572101967839092 0.37325238119242865
+1.9453832490724945 0.68136436973507708 0.93128429947378155
+1.6267476188075718 0.48443672020460993 1.5842789803216091
+1.5842789803216091 1.6267476188075709 1.5155632797953906
+0.57018003072289591 1 0.097085389413467671
+0.05461675092750562 1.3186356302649231 1.0687157005262189
+0.68136436973507708 0.93128429947378155 1.9453832490724945
+0.37325238119242898 1.5155632797953906 1.5842789803216091
+0.6431779102269104 1.0000000000000002 1.9341723589627158
+0.68136436973507686 1.0687157005262189 1.9453832490724945
+1.5155632797953908 0.41572101967839115 1.6267476188075713
+1.3568220897730903 1.0000000000000002 1.9341723589627156
+1.3186356302649234 1.0687157005262189 1.9453832490724945
+1.9341723589627156 1.3568220897730903 1.0000000000000002
+1.9453832490724943 1.3186356302649234 1.0687157005262189
+1.5773502691896257 1.5773502691896257 1.5773502691896257
+1.5155632797953906 1.5842789803216091 1.6267476188075711
+1.0687157005262193 1.9453832490724945 0.68136436973507686
+1.0000000000000007 1.9341723589627156 1.3568220897730903
+1.0000000000000002 1.9029146105865324 1.4298199692771043
+0.065827641037284446 1.3568220897730903 1.0000000000000002
+0.097085389413467671 1.4298199692771043 1.0000000000000002
+0.4226497308103746 1.5773502691896262 1.5773502691896257
+0.48443672020460971 1.5842789803216091 1.6267476188075713
+0.42264973081037438 0.42264973081037427 1.577350269189626
+0.37325238119242876 0.48443672020460959 1.5842789803216091
+1.5773502691896257 1.5773502691896262 0.4226497308103746
+1.5155632797953902 1.5842789803216091 0.37325238119242876
+1.6267476188075713 0.48443672020460959 0.41572101967839103
+1.35682208977309 1.0000000000000002 0.065827641037284335
+1.3186356302649231 1.0687157005262189 0.054616750927505398
+0.6431779102269104 1.0000000000000002 0.065827641037284113
+0.68136436973507708 1.0687157005262189 0.054616750927505398
+0.054616750927505398 1.3186356302649231 0.93128429947378155
+0.42264973081037427 1.577350269189626 0.42264973081037438
+0.48443672020460971 1.5842789803216091 0.37325238119242865
+0.93128429947378155 1.9453832490724945 1.3186356302649234
+1.0000000000000007 1.9341723589627158 0.6431779102269104
+1.0000000000000002 1.9029146105865324 0.57018003072289591
+1.9029146105865324 1.4298199692771043 1
+1.9341723589627158 0.6431779102269104 1.0000000000000002
+1.9029146105865324 0.57018003072289591 1.0000000000000002
+1.4298199692771043 1 1.9029146105865324
+1.577350269189626 0.4226497308103746 1.577350269189626
+1.5842789803216091 0.37325238119242876 1.5155632797953902
+0.48443672020460959 0.41572101967839103 1.6267476188075713
+1.0000000000000002 0.065827641037284335 1.35682208977309
+1.0687157005262189 0.05461675092750562 1.3186356302649231
+1.0000000000000002 0.065827641037284113 0.6431779102269104
+1.0687157005262189 0.054616750927505398 0.68136436973507708
+1.3186356302649231 0.93128429947378155 0.054616750927505398
+1.5773502691896262 0.42264973081037449 0.42264973081037416
+1.5842789803216091 0.37325238119242876 0.48443672020460959
+1.9453832490724945 1.3186356302649234 0.93128429947378155
+1.9453832490724945 0.68136436973507708 1.0687157005262189
+1.6267476188075713 1.5155632797953908 0.41572101967839115
+1 0.097085389413467671 0.57018003072289591
+0.097085389413467671 0.57018003072289591 1.0000000000000002
+0.41572101967839092 0.37325238119242865 1.5155632797953904
+0.054616750927505398 0.68136436973507708 1.0687157005262189
+0.93128429947378155 0.054616750927505398 1.3186356302649231
+0.41572101967839103 1.6267476188075713 0.48443672020460948
+0.065827641037284113 0.6431779102269104 1.0000000000000002
+0.054616750927505398 0.68136436973507708 0.93128429947378155
+0.99999999999999989 1.5257311121191339 1.8506508083520397
+1 1.5739215462855711 1.8189102873387162
+0.94514285928638309 1.5400179687989204 1.8398638505656821
+0.96609642251334915 1.4851608280853035 1.8737674280523333
+1.0339035774866507 1.4851608280853035 1.8737674280523333
+1 1.5257311121191335 0.14934919164796001
+0.94514285928638309 1.5400179687989204 0.16013614943431764
+1 1.5739215462855709 0.1810897126612836
+1.0548571407136167 1.5400179687989204 0.16013614943431764
+1.0339035774866507 1.4851608280853033 0.12623257194766668
+1.5257311121191337 0.14934919164796012 0.99999999999999967
+1.4851608280853033 0.12623257194766668 0.96609642251334915
+1.5400179687989204 0.16013614943431764 0.94514285928638309
+1.5739215462855713 0.18108971266128371 1
+1.5400179687989204 0.16013614943431764 1.0548571407136167
+1.8506508083520397 0.99999999999999989 1.5257311121191339
+1.8189102873387162 1 1.5739215462855713
+1.0339035774866507 0.51483917191469653 0.12623257194766679
+0.16013614943431764 1.0548571407136167 0.45998203120107961
+0.16013614943431764 1.0548571407136167 1.5400179687989204
+0.51483917191469653 1.8737674280523331 1.0339035774866507
+0.94514285928638309 0.4599820312010795 1.8398638505656821
+1.8737674280523331 0.96609642251334915 1.4851608280853035
+1.5400179687989204 1.8398638505656821 0.94514285928638309
+1.5739215462855713 1.8189102873387162 1
+0.4599820312010795 1.8398638505656821 0.94514285928638309
+0.12623257194766668 0.96609642251334915 1.4851608280853033
+1 0.42607845371442854 1.8189102873387162
+1.8737674280523331 1.0339035774866507 0.5148391719146963
+1 0.42607845371442854 0.18108971266128371
+0.12623257194766668 0.96609642251334915 0.51483917191469664
+0.1493491916479599 0.99999999999999989 0.47426888788086663
+0.16013614943431764 0.94514285928638309 0.45998203120107972
+0.4742688878808663 1.8506508083520399 0.99999999999999989
+0.45998203120107972 1.8398638505656824 1.0548571407136167
+1.5400179687989204 1.8398638505656821 1.0548571407136167
+1.5257311121191339 1.8506508083520397 1
+1.4851608280853035 1.8737674280523331 1.0339035774866507
+1.8737674280523331 0.96609642251334915 0.51483917191469641
+1.8737674280523333 1.0339035774866507 1.4851608280853035
+0.96609642251334915 0.51483917191469641 1.8737674280523331
+0.99999999999999989 0.47426888788086619 1.8506508083520397
+1.0339035774866507 0.5148391719146963 1.8737674280523331
+0.42607845371442854 0.18108971266128371 1
+0.45998203120107961 0.16013614943431764 1.0548571407136167
+0.99999999999999967 0.4742688878808663 0.14934919164796012
+0.96609642251334915 0.51483917191469653 0.12623257194766679
+1.8398638505656821 1.0548571407136167 0.4599820312010795
+1.8506508083520397 0.99999999999999989 0.47426888788086619
+1.8189102873387162 1 0.42607845371442854
+0.51483917191469653 0.12623257194766679 1.0339035774866507
+0.4742688878808663 0.14934919164796012 0.99999999999999967
+0.51483917191469653 0.12623257194766679 0.96609642251334915
+0.14934919164796023 0.99999999999999989 1.5257311121191337
+0.1810897126612836 1 1.5739215462855709
+0.13700104792563472 0.9002428344740192 0.50474116197207619
+0.7696633065708306 0.66911870558671405 0.084870185893003991
+0.88373086464434825 0.44607638880232225 0.17559104740343046
+0.61218885329533657 0.79331933670715005 0.10173187860614719
+0.29128230231247842 0.93272292597567807 0.29772297467792341
+0.9002428344740192 0.50474116197207608 0.13700104792563472
+0.61001233692795442 0.098276862116930763 0.81343900392119461
+0.55521524694909541 0.11589117859806231 0.85675854171112931
+0.81343900392119461 0.6100123369279542 0.098276862116930763
+0.85675854171112931 0.55521524694909541 0.11589117859806231
+0.44607638880232214 0.17559104740343046 0.88373086464434814
+0.50349800523024868 0.86049397507742498 0.14324808830096003
+0.86100639327308426 0.10657204968447231 0.57283811630245096
+0.345924455343119 0.93100371799927484 0.24672402470815469
+0.93272292597567807 0.29772297467792341 0.29128230231247842
+0.93100371799927484 0.24672402470815469 0.345924455343119
+0.57283811630245096 0.86100639327308426 0.10657204968447231
+0.86049397507742498 0.14324808830096003 0.50349800523024868
+0.66911870558671394 0.084870185893003991 0.76966330657083049
+0.93492750010980485 0.35056625699618549 0.24237121015229646
+0.93834668108359476 0.40498399644609495 0.19865436684204019
+0.46792604467534826 0.93001343374770529 0.15619955759113657
+0.40498399644609495 0.19865436684204019 0.93834668108359476
+0.35056625699618549 0.24237121015229635 0.93492750010980485
+0.50474116197207608 0.13700104792563472 0.9002428344740192
+0.084870185893003991 0.7696633065708306 0.66911870558671405
+0.24237121015229635 0.93492750010980485 0.35056625699618549
+0.19865436684204019 0.93834668108359476 0.40498399644609495
+0.17559104740343046 0.88373086464434814 0.44607638880232214
+0.098276862116930763 0.81343900392119461 0.61001233692795442
+0.11589117859806231 0.85675854171112931 0.55521524694909541
+0.73088283263773501 0.076305915458627194 0.72730018625934878
+0.10657204968447231 0.57283811630245096 0.86100639327308426
+0.14324808830096003 0.50349800523024868 0.86049397507742498
+0.24672402470815469 0.345924455343119 0.93100371799927484
+0.29772297467792341 0.29128230231247842 0.93272292597567807
+0.79331933670715005 0.10173187860614707 0.61218885329533657
+0.10173187860614707 0.61218885329533657 0.79331933670715005
+0.072941162917711799 0.68589935177912764 0.7952985213173509
+0.93025980236669126 0.1995276593250811 0.4047014726639383
+0.93001343374770529 0.15619955759113657 0.46792604467534826
+0.1995276593250811 0.4047014726639383 0.93025980236669126
+0.4047014726639383 0.93025980236669126 0.1995276593250811
+0.7952985213173509 0.072941162917711799 0.68589935177912764
+0.076305915458627194 0.72730018625934878 0.73088283263773501
+0.15619955759113657 0.46792604467534826 0.93001343374770529
+0.68589935177912764 0.7952985213173509 0.072941162917711577
+0.72730018625934878 0.73088283263773501 0.076305915458627194
+3  1400 1442 179
+3  1402 1446 180
+3  1404 1450 181
+3  1406 1454 182
+3  1408 1438 183
+3  1410 1462 184
+3  1412 1464 185
+3  1414 1468 186
+3  1416 1472 187
+3  1418 1458 188
+3  1420 1480 189
+3  1422 1484 190
+3  1424 1486 191
+3  1426 1490 192
+3  1428 1476 193
+3  1430 1444 194
+3  1432 1506 195
+3  1434 1456 196
+3  1436 1452 197
+3  1438 1408 198
+3  1440 1478 199
+3  1442 1400 200
+3  1444 1430 201
+3  1446 1402 202
+3  1448 1470 203
+3  1450 1404 204
+3  1452 1436 205
+3  1454 1406 206
+3  1456 1434 207
+3  1458 1418 208
+3  1460 1488 209
+3  1462 1410 210
+3  1464 1412 211
+3  1466 1504 212
+3  1468 1414 213
+3  1470 1448 214
+3  1472 1416 215
+3  1474 1496 216
+3  1476 1428 217
+3  1478 1440 218
+3  1480 1420 219
+3  1482 1502 220
+3  1484 1422 221
+3  1486 1424 222
+3  1488 1460 223
+3  1490 1426 224
+3  1492 1494 225
+3  1494 1492 226
+3  1496 1474 227
+3  1498 1500 228
+3  1500 1498 229
+3  1502 1482 230
+3  1504 1466 231
+3  1506 1432 232
+3  1508 1514 233
+3  1510 1524 234
+3  1512 1518 235
+3  1514 1508 236
+3  1516 1522 237
+3  1518 1512 238
+3  1520 1526 239
+3  1522 1516 240
+3  1524 1510 241
+3  1526 1520 242
+3  1528 1534 243
+3  1530 1544 244
+3  1532 1538 245
+3  1534 1528 246
+3  1536 1542 247
+3  1538 1532 248
+3  1540 1546 249
+3  1542 1536 250
+3  1544 1530 251
+3  1546 1540 252
+3  1548 1554 253
+3  1550 1564 254
+3  1552 1558 255
+3  1554 1548 256
+3  1556 1562 257
+3  1558 1552 258
+3  1560 1566 259
+3  1562 1556 260
+3  1564 1550 261
+3  1566 1560 262
+3  1568 1596 263
+3  1570 1698 264
+3  1572 1636 2407
+3  1574 1730 265
+3  1576 1712 266
+3  1578 1620 267
+3  1580 1716 268
+3  1582 1612 269
+3  1584 1644 270
+3  1586 1624 271
+3  1588 1668 272
+3  1590 1666 273
+3  1592 1594 274
+3  1594 1592 275
+3  1596 1568 276
+3  1598 1708 277
+3  1600 1602 278
+3  1602 1600 279
+3  1604 1652 280
+3  1606 1650 281
+3  1608 1610 282
+3  1610 1608 283
+3  1612 1582 284
+3  1614 1734 285
+3  1616 1618 286
+3  1618 1616 287
+3  1620 1578 288
+3  1622 1726 289
+3  1624 1586 290
+3  1626 1662 291
+3  1628 1690 292
+3  1630 1688 293
+3  1632 1634 294
+3  1634 1632 295
+3  1636 1572 296
+3  1638 1640 2419
+3  1640 1638 297
+3  1642 1728 298
+3  1644 1584 299
+3  1646 1648 300
+3  1648 1646 301
+3  1650 1606 302
+3  1652 1604 303
+3  1654 1656 304
+3  1656 1654 305
+3  1658 1706 306
+3  1660 1704 307
+3  1662 1626 308
+3  1664 1700 309
+3  1666 1590 310
+3  1668 1588 311
+3  1670 1672 312
+3  1672 1670 313
+3  1674 1724 314
+3  1676 1722 315
+3  1678 1680 316
+3  1680 1678 317
+3  1682 1710 318
+3  1684 1686 2421
+3  1686 1684 319
+3  1688 1630 320
+3  1690 1628 321
+3  1692 1694 322
+3  1694 1692 323
+3  1696 1702 324
+3  1698 1570 325
+3  1700 1664 326
+3  1702 1696 327
+3  1704 1660 328
+3  1706 1658 329
+3  1708 1598 330
+3  1710 1682 2424
+3  1712 1576 2431
+3  1714 1720 2440
+3  1716 1580 331
+3  1718 1732 332
+3  1720 1714 333
+3  1722 1676 334
+3  1724 1674 335
+3  1726 1622 336
+3  1728 1642 337
+3  1730 1574 338
+3  1732 1718 339
+3  1734 1614 340
+3  1735 1930 341
+3  1736 1849 342
+3  1737 1938 343
+3  1738 1853 344
+3  1739 1946 345
+3  1740 1857 346
+3  1741 1954 347
+3  1742 1861 348
+3  1743 1922 349
+3  1744 1845 350
+3  1745 1969 351
+3  1746 1869 352
+3  1747 1973 353
+3  1748 1873 354
+3  1749 1981 355
+3  1750 1877 356
+3  1751 1989 357
+3  1752 1881 358
+3  1753 1962 359
+3  1754 1865 360
+3  1755 2005 361
+3  1756 1889 362
+3  1757 2012 363
+3  1758 1893 364
+3  1759 2016 365
+3  1760 1897 366
+3  1761 2024 367
+3  1762 1901 368
+3  1763 1997 369
+3  1764 1885 370
+3  1765 1934 371
+3  1766 1929 372
+3  25 24 2427
+3  2452 2409 373
+3  1767 2058 374
+3  1768 2053 375
+3  1769 1958 376
+3  1770 1953 377
+3  1771 1950 378
+3  1772 1945 379
+3  1773 1862 380
+3  1774 1957 381
+3  1775 2001 382
+3  1776 1996 383
+3  1777 1846 384
+3  1778 1925 385
+3  1779 1906 386
+3  1780 2035 387
+3  1781 1850 388
+3  1782 1933 389
+3  1783 1985 390
+3  1784 1980 391
+3  1785 1854 392
+3  1786 1941 393
+3  1787 1918 394
+3  1788 2057 395
+3  1789 1858 396
+3  1790 1949 397
+3  1791 1914 398
+3  1792 2049 399
+3  1793 1882 400
+3  1794 1992 401
+3  1795 2020 402
+3  1796 2015 403
+3  1797 1866 404
+3  1798 1965 405
+3  1799 1870 406
+3  1800 1970 407
+3  1801 2054 408
+3  1802 1917 409
+3  1803 1874 410
+3  1804 1976 411
+3  1805 1942 412
+3  1806 1937 413
+3  1807 1878 414
+3  1808 1984 415
+3  1809 2036 416
+3  1810 2031 417
+3  1811 1902 418
+3  1812 2027 419
+3  1813 1926 420
+3  1814 1921 421
+3  1815 1886 422
+3  1816 2000 423
+3  1817 2050 424
+3  1818 2045 425
+3  1819 1890 426
+3  1820 2008 427
+3  1821 1894 428
+3  1822 2013 429
+3  1823 1966 430
+3  1824 1961 431
+3  1825 1898 432
+3  1826 2019 433
+3  1827 2032 434
+3  1828 1905 435
+3  1829 2028 436
+3  1830 2023 437
+3  1831 1993 438
+3  1832 1988 439
+3  2423 86 85
+3  2449 2442 440
+3  144 143 2451
+3  2444 2443 441
+3  1833 2046 442
+3  1834 1913 443
+3  1835 2043 444
+3  1836 2039 445
+3  1837 2009 446
+3  1838 2004 447
+3  1839 1977 448
+3  1840 1972 449
+3  1841 1910 450
+3  1842 2042 451
+3  1843 1848 452
+3  1844 1859 453
+3  1845 1744 454
+3  1846 1777 455
+3  1847 1852 456
+3  1848 1843 457
+3  1849 1736 458
+3  1850 1781 459
+3  1851 1856 460
+3  1852 1847 461
+3  1853 1738 462
+3  1854 1785 463
+3  1855 1860 464
+3  1856 1851 465
+3  1857 1740 466
+3  1858 1789 467
+3  1859 1844 468
+3  1860 1855 469
+3  1861 1742 470
+3  1862 1773 471
+3  1863 1868 472
+3  1864 1879 473
+3  1865 1754 474
+3  1866 1797 475
+3  1867 1872 476
+3  1868 1863 477
+3  1869 1746 478
+3  1870 1799 479
+3  1871 1876 480
+3  1872 1867 481
+3  1873 1748 482
+3  1874 1803 483
+3  1875 1880 484
+3  1876 1871 485
+3  1877 1750 486
+3  1878 1807 487
+3  1879 1864 488
+3  1880 1875 489
+3  1881 1752 490
+3  1882 1793 491
+3  1883 1888 492
+3  1884 1899 493
+3  1885 1764 494
+3  1886 1815 495
+3  1887 1892 496
+3  1888 1883 497
+3  1889 1756 498
+3  1890 1819 499
+3  1891 1896 500
+3  1892 1887 501
+3  1893 1758 502
+3  1894 1821 503
+3  1895 1900 504
+3  1896 1891 505
+3  1897 1760 506
+3  1898 1825 507
+3  1899 1884 508
+3  1900 1895 509
+3  1901 1762 510
+3  1902 1811 511
+3  1903 1928 512
+3  1904 2025 513
+3  1905 1828 514
+3  1906 1779 515
+3  1907 1968 516
+3  1908 2052 517
+3  1909 2038 518
+3  1910 1841 519
+3  1911 1952 520
+3  1912 2040 521
+3  1913 1834 522
+3  1914 1791 523
+3  1915 1944 524
+3  1916 1974 525
+3  1917 1802 526
+3  1918 1787 527
+3  1919 1956 528
+3  1920 1998 529
+3  1921 1814 530
+3  1922 1743 531
+3  1923 1995 532
+3  1924 1927 533
+3  1925 1778 534
+3  1926 1813 535
+3  1927 1924 536
+3  1928 1903 537
+3  1929 1766 538
+3  1930 1735 539
+3  1931 2034 540
+3  1932 1935 541
+3  1933 1782 542
+3  1934 1765 543
+3  1935 1932 544
+3  1936 1982 545
+3  1937 1806 546
+3  1938 1737 547
+3  1939 1979 548
+3  1940 1943 549
+3  1941 1786 550
+3  1942 1805 551
+3  1943 1940 552
+3  1944 1915 553
+3  1945 1772 554
+3  1946 1739 555
+3  1947 2056 556
+3  1948 1951 557
+3  1949 1790 558
+3  1950 1771 559
+3  1951 1948 560
+3  1952 1911 561
+3  1953 1770 562
+3  1954 1741 563
+3  1955 2048 564
+3  1956 1919 565
+3  1957 1774 566
+3  1958 1769 567
+3  1959 1991 568
+3  1960 2017 569
+3  1961 1824 570
+3  1962 1753 571
+3  1963 2014 572
+3  1964 1967 573
+3  1965 1798 574
+3  1966 1823 575
+3  1967 1964 576
+3  1968 1907 577
+3  1969 1745 578
+3  2432 9 8
+3  1970 1800 579
+3  2417 2427 580
+3  1971 2051 581
+3  1972 1840 582
+3  1973 1747 583
+3  1974 1916 584
+3  1975 1978 585
+3  1976 1804 586
+3  1977 1839 587
+3  1978 1975 588
+3  1979 1939 589
+3  1980 1784 590
+3  1981 1749 591
+3  1982 1936 592
+3  1983 1986 593
+3  1984 1808 594
+3  1985 1783 595
+3  1986 1983 596
+3  1987 2033 597
+3  1988 1832 598
+3  1989 1751 599
+3  1990 2030 600
+3  1991 1959 601
+3  1992 1794 602
+3  1993 1831 603
+3  1994 2026 604
+3  1995 1923 605
+3  1996 1776 606
+3  1997 1763 607
+3  1998 1920 608
+3  1999 2002 609
+3  2000 1816 610
+3  2001 1775 611
+3  2002 1999 612
+3  2003 2047 613
+3  2004 1838 614
+3  2005 1755 615
+3  2006 2044 616
+3  2007 2010 617
+3  2008 1820 618
+3  2009 1837 619
+3  2010 2007 620
+3  2011 2037 621
+3  98 97 2442
+3  2012 1757 622
+3  66 65 2426
+3  2013 1822 623
+3  2423 2446 624
+3  2014 1963 625
+3  2015 1796 626
+3  2016 1759 627
+3  2017 1960 628
+3  2018 2021 629
+3  2019 1826 630
+3  2020 1795 631
+3  2021 2018 632
+3  2022 2029 633
+3  2023 1830 634
+3  2024 1761 635
+3  2025 1904 636
+3  2026 1994 637
+3  2027 1812 638
+3  2028 1829 639
+3  2029 2022 640
+3  2030 1990 641
+3  2031 1810 642
+3  2032 1827 643
+3  2033 1987 644
+3  2034 1931 645
+3  2035 1780 646
+3  2036 1809 647
+3  2037 2011 648
+3  2038 1909 649
+3  176 175 2436
+3  126 125 2428
+3  2039 1836 650
+3  2439 2451 651
+3  2040 1912 652
+3  2041 2055 653
+3  2042 1842 654
+3  2043 1835 655
+3  2044 2006 656
+3  2045 1818 657
+3  2046 1833 658
+3  2047 2003 659
+3  2048 1955 660
+3  2049 1792 661
+3  2050 1817 662
+3  2051 1971 663
+3  2052 1908 664
+3  2053 1768 665
+3  2054 1801 666
+3  2055 2041 667
+3  2056 1947 668
+3  2057 1788 669
+3  2058 1767 670
+3  2060 671 534
+3  1256 672 341
+3  2062 673 542
+3  1264 674 343
+3  2064 675 550
+3  1273 676 345
+3  2066 677 558
+3  1282 678 347
+3  2068 679 566
+3  1247 680 349
+3  2070 681 574
+3  1298 682 351
+3  2072 683 579
+3  1304 684 353
+3  2074 685 586
+3  1313 686 355
+3  2076 687 594
+3  1322 688 357
+3  2078 689 602
+3  1290 690 359
+3  2080 691 610
+3  1339 692 361
+3  2082 693 618
+3  1346 694 363
+3  2084 695 623
+3  1352 696 365
+3  2086 697 630
+3  1361 698 367
+3  2088 699 638
+3  1330 700 369
+3  2090 701 646
+3  1260 702 371
+3  2092 703 654
+3  1398 704 374
+3  2094 705 661
+3  1286 706 376
+3  2096 707 669
+3  1278 708 378
+3  2098 709 454
+3  1183 710 380
+3  2100 711 530
+3  1334 712 382
+3  2102 713 458
+3  1167 714 384
+3  2104 715 538
+3  1230 716 386
+3  2106 717 462
+3  1171 718 388
+3  2108 719 546
+3  1317 720 390
+3  2110 721 466
+3  1175 722 392
+3  2112 723 554
+3  1243 724 394
+3  2114 725 470
+3  1179 726 396
+3  2116 727 562
+3  1239 728 398
+3  2118 729 474
+3  1204 730 400
+3  2120 731 570
+3  1356 732 402
+3  2122 733 478
+3  1188 734 404
+3  2124 735 482
+3  1192 736 406
+3  2126 737 582
+3  1394 738 408
+3  2128 739 486
+3  1196 740 410
+3  2130 741 590
+3  1269 742 412
+3  2132 743 490
+3  1200 744 414
+3  2134 745 598
+3  1373 746 416
+3  2136 747 494
+3  1225 748 418
+3  2138 749 606
+3  1252 750 420
+3  2140 751 498
+3  1209 752 422
+3  2142 753 614
+3  1390 754 424
+3  2144 755 502
+3  1213 756 426
+3  2146 757 506
+3  1217 758 428
+3  2148 759 626
+3  1295 760 430
+3  2150 761 510
+3  1221 762 432
+3  2152 763 634
+3  1369 764 434
+3  2154 765 514
+3  1365 766 436
+3  2156 767 642
+3  1326 768 438
+3  2158 769 650
+3  1386 770 442
+3  2160 771 522
+3  1383 772 444
+3  2162 773 657
+3  1343 774 446
+3  2164 775 526
+3  1309 776 448
+3  2166 777 665
+3  1235 778 450
+3  2167 779 388
+3  1169 780 452
+3  2168 781 464
+3  1009 782 454
+3  2169 783 392
+3  1173 784 456
+3  2170 785 468
+3  997 786 458
+3  2171 787 396
+3  1177 788 460
+3  2172 789 452
+3  1000 790 462
+3  2173 791 380
+3  1181 792 464
+3  2174 793 456
+3  1003 794 466
+3  2175 795 384
+3  1165 796 468
+3  2176 797 460
+3  1006 798 470
+3  2177 799 406
+3  1190 800 472
+3  2178 801 484
+3  1024 802 474
+3  2179 803 410
+3  1194 804 476
+3  2180 805 488
+3  1012 806 478
+3  2181 807 414
+3  1198 808 480
+3  2182 809 472
+3  1015 810 482
+3  2183 811 400
+3  1202 812 484
+3  2184 813 476
+3  1018 814 486
+3  2185 815 404
+3  1186 816 488
+3  2186 817 480
+3  1021 818 490
+3  2187 819 426
+3  1211 820 492
+3  2188 821 504
+3  1039 822 494
+3  2189 823 428
+3  1215 824 496
+3  2190 825 508
+3  1027 826 498
+3  2191 827 432
+3  1219 828 500
+3  2192 829 492
+3  1030 830 502
+3  2193 831 418
+3  1223 832 504
+3  2194 833 496
+3  1033 834 506
+3  2195 835 422
+3  1207 836 508
+3  2196 837 500
+3  1036 838 510
+3  2197 839 341
+3  1254 840 512
+3  2198 841 604
+3  1137 842 514
+3  2199 843 351
+3  1297 844 516
+3  2200 845 408
+3  1392 846 517
+3  2201 847 347
+3  1280 848 520
+3  2202 849 667
+3  1150 850 522
+3  2203 851 345
+3  1271 852 524
+3  2204 853 588
+3  1098 854 526
+3  2205 855 376
+3  1284 856 528
+3  2206 857 612
+3  1116 858 530
+3  2207 859 369
+3  1328 860 532
+3  2208 861 512
+3  1062 862 534
+3  2209 863 420
+3  1250 864 536
+3  2210 865 636
+3  1042 866 538
+3  2211 867 416
+3  1371 868 540
+3  2212 869 592
+3  1068 870 542
+3  2213 871 371
+3  1258 872 544
+3  2214 873 596
+3  1104 874 546
+3  2215 875 355
+3  1311 876 548
+3  2216 877 524
+3  1074 878 550
+3  2217 879 412
+3  1267 880 552
+3  2218 881 584
+3  1053 882 554
+3  2219 883 374
+3  1396 884 556
+3  2220 885 520
+3  1080 886 558
+3  2221 887 378
+3  1276 888 560
+3  2222 889 652
+3  1050 890 562
+3  2223 891 424
+3  1388 892 564
+3  2224 893 608
+3  1056 894 566
+3  2225 895 438
+3  1324 896 568
+3  2226 897 632
+3  1131 898 570
+3  2227 899 365
+3  1350 900 572
+3  2228 901 516
+3  1092 902 574
+3  2229 903 430
+3  1293 904 576
+3  2230 905 663
+3  1095 906 579
+3  2231 907 517
+3  1159 908 582
+3  2232 909 394
+3  1241 910 584
+3  2233 911 548
+3  1101 912 586
+3  2234 913 448
+3  1307 914 588
+3  2235 915 552
+3  1071 916 590
+3  2236 917 343
+3  1262 918 592
+3  2237 919 644
+3  1107 920 594
+3  2238 921 390
+3  1315 922 596
+3  2239 923 540
+3  1143 924 598
+3  2240 925 434
+3  1367 926 600
+3  2241 927 628
+3  1086 928 602
+3  2242 929 436
+3  1363 930 604
+3  2243 931 536
+3  1059 932 606
+3  2244 933 349
+3  1245 934 608
+3  2245 935 659
+3  1119 936 610
+3  2246 937 382
+3  1332 938 612
+3  2247 939 564
+3  1156 940 614
+3  2248 941 442
+3  1384 942 616
+3  2249 943 648
+3  1125 944 618
+3  2250 945 446
+3  1341 946 620
+3  2251 947 572
+3  1128 948 623
+3  2252 949 576
+3  1089 950 626
+3  2253 951 359
+3  1288 952 628
+3  2254 953 640
+3  1134 954 630
+3  2255 955 402
+3  1354 956 632
+3  2256 957 600
+3  1140 958 634
+3  2257 959 386
+3  1228 960 636
+3  2258 961 532
+3  1113 962 638
+3  2259 963 367
+3  1359 964 640
+3  2260 965 568
+3  1110 966 642
+3  2261 967 357
+3  1320 968 644
+3  2262 969 544
+3  1065 970 646
+3  2263 971 363
+3  1345 972 648
+3  2264 973 450
+3  1234 974 649
+3  2265 975 616
+3  1153 976 650
+3  2266 977 398
+3  1237 978 652
+3  2267 979 556
+3  1162 980 654
+3  2268 981 620
+3  1122 982 657
+3  2269 983 361
+3  1337 984 659
+3  2270 985 528
+3  1083 986 661
+3  2271 987 353
+3  1302 988 663
+3  2272 989 649
+3  1047 990 665
+3  2273 991 444
+3  1381 992 667
+3  2274 993 560
+3  1077 994 669
+3  2275 995 372
+3  1170 996 342
+3  786 997 233
+3  713 2102 179
+3  2276 998 413
+3  1174 999 344
+3  790 1000 235
+3  717 2106 180
+3  2277 1001 379
+3  1178 1002 346
+3  794 1003 237
+3  721 2110 181
+3  2278 1004 377
+3  1182 1005 348
+3  798 1006 239
+3  725 2114 182
+3  2279 1007 421
+3  1166 1008 350
+3  782 1009 241
+3  709 2098 183
+3  2280 1010 373
+3  1191 1011 352
+3  806 1012 243
+3  733 2122 184
+3  2281 1013 449
+3  1195 1014 354
+3  810 1015 245
+3  735 2124 185
+3  2282 1016 391
+3  1199 1017 356
+3  814 1018 247
+3  739 2128 186
+3  2283 1019 439
+3  1203 1020 358
+3  818 1021 249
+3  743 2132 187
+3  2284 1022 431
+3  1187 1023 360
+3  802 1024 251
+3  729 2118 188
+3  2285 1025 447
+3  1212 1026 362
+3  826 1027 253
+3  751 2140 189
+3  2286 1028 440
+3  1216 1029 364
+3  830 1030 255
+3  755 2144 190
+3  2287 1031 403
+3  1220 1032 366
+3  834 1033 257
+3  757 2146 191
+3  2288 1034 437
+3  1224 1035 368
+3  838 1036 259
+3  761 2150 192
+3  2289 1037 383
+3  1208 1038 370
+3  822 1039 261
+3  747 2136 193
+3  2290 1040 389
+3  1255 1041 372
+3  866 1042 263
+3  715 2104 194
+3  2291 1043 407
+3  2422 1044 373
+3  46 45 2453
+3  2292 1045 395
+3  1393 1046 375
+3  990 1047 265
+3  777 2166 195
+3  2293 1048 381
+3  1281 1049 377
+3  890 1050 267
+3  727 2116 196
+3  2294 1051 397
+3  1272 1052 379
+3  882 1053 269
+3  723 2112 197
+3  2296 1054 348
+3  1285 1055 381
+3  894 1056 271
+3  679 2068 198
+3  2297 1057 423
+3  1329 1058 383
+3  932 1059 273
+3  749 2138 199
+3  2299 1060 350
+3  1251 1061 385
+3  862 1062 275
+3  671 2060 200
+3  2301 1063 435
+3  1372 1064 387
+3  970 1065 277
+3  701 2090 201
+3  2303 1066 342
+3  1259 1067 389
+3  870 1068 279
+3  673 2062 202
+3  2304 1069 415
+3  1312 1070 391
+3  916 1071 281
+3  741 2130 203
+3  2306 1072 344
+3  1268 1073 393
+3  878 1074 283
+3  675 2064 204
+3  2308 1075 409
+3  1397 1076 395
+3  994 1077 285
+3  707 2096 205
+3  2310 1078 346
+3  1277 1079 397
+3  886 1080 287
+3  677 2066 206
+3  2312 1081 443
+3  1389 1082 399
+3  986 1083 289
+3  705 2094 207
+3  2314 1084 358
+3  1325 1085 401
+3  928 1086 291
+3  689 2078 208
+3  2315 1087 433
+3  1351 1088 403
+3  950 1089 293
+3  759 2148 209
+3  2317 1090 360
+3  1294 1091 405
+3  902 1092 295
+3  681 2070 210
+3  2319 1093 352
+3  1300 1094 407
+3  906 1095 297
+3  683 2072 211
+3  2320 1096 375
+3  1242 1097 409
+3  854 1098 299
+3  775 2164 212
+3  2322 1099 354
+3  1308 1100 411
+3  912 1101 301
+3  685 2074 213
+3  2323 1102 393
+3  1263 1103 413
+3  874 1104 303
+3  719 2108 214
+3  2325 1105 356
+3  1316 1106 415
+3  920 1107 305
+3  687 2076 215
+3  2326 1108 387
+3  1368 1109 417
+3  966 1110 307
+3  767 2156 216
+3  2328 1111 368
+3  1364 1112 419
+3  962 1113 309
+3  699 2088 217
+3  2329 1114 385
+3  1246 1115 421
+3  858 1116 311
+3  711 2100 218
+3  2331 1117 370
+3  1333 1118 423
+3  936 1119 313
+3  691 2080 219
+3  2332 1120 399
+3  1385 1121 425
+3  982 1122 315
+3  773 2162 220
+3  2334 1123 362
+3  1342 1124 427
+3  944 1125 317
+3  693 2082 221
+3  2336 1126 364
+3  1349 1127 429
+3  948 1128 319
+3  695 2084 222
+3  2337 1129 405
+3  1289 1130 431
+3  898 1131 321
+3  731 2120 223
+3  2339 1132 366
+3  1355 1133 433
+3  954 1134 323
+3  697 2086 224
+3  2340 1135 417
+3  1229 1136 435
+3  842 1137 325
+3  765 2154 225
+3  2341 1138 419
+3  1360 1139 437
+3  958 1140 327
+3  763 2152 226
+3  2342 1141 401
+3  1321 1142 439
+3  924 1143 329
+3  745 2134 227
+3  2343 1144 429
+3  2418 1145 440
+3  105 104 2437
+3  2344 1146 445
+3  2438 1147 441
+3  165 164 2450
+3  2345 1148 425
+3  1238 1149 443
+3  850 1150 331
+3  771 2160 228
+3  2346 1151 451
+3  1378 1152 445
+3  976 1153 333
+3  769 2158 229
+3  2347 1154 427
+3  1338 1155 447
+3  940 1156 335
+3  753 2142 230
+3  2348 1157 411
+3  1303 1158 449
+3  908 1159 337
+3  737 2126 231
+3  2350 1160 441
+3  1382 1161 451
+3  980 1162 339
+3  703 2092 232
+3  2352 1163 461
+3  1180 1164 453
+3  796 1165 234
+3  785 2170 233
+3  1008 1166 531
+3  1060 2299 455
+3  714 1167 179
+3  795 2175 234
+3  2353 1168 465
+3  1163 2352 457
+3  780 1169 236
+3  789 2172 235
+3  996 1170 539
+3  1066 2303 459
+3  718 1171 180
+3  779 2167 236
+3  2354 1172 469
+3  1168 2353 461
+3  784 1173 238
+3  793 2174 237
+3  999 1174 547
+3  1072 2306 463
+3  722 1175 181
+3  783 2169 238
+3  2355 1176 453
+3  1172 2354 465
+3  788 1177 240
+3  797 2176 239
+3  1002 1178 555
+3  1078 2310 467
+3  726 1179 182
+3  787 2171 240
+3  1164 1180 457
+3  1176 2355 469
+3  792 1181 242
+3  781 2168 241
+3  1005 1182 563
+3  1054 2296 471
+3  710 1183 183
+3  791 2173 242
+3  2357 1184 481
+3  1201 1185 473
+3  816 1186 244
+3  805 2180 243
+3  1023 1187 571
+3  1090 2317 475
+3  734 1188 184
+3  815 2185 244
+3  2358 1189 485
+3  1184 2357 477
+3  800 1190 246
+3  809 2182 245
+3  1011 1191 578
+3  1093 2319 479
+3  736 1192 185
+3  799 2177 246
+3  2359 1193 489
+3  1189 2358 481
+3  804 1194 248
+3  813 2184 247
+3  1014 1195 583
+3  1099 2322 483
+3  740 1196 186
+3  803 2179 248
+3  2360 1197 473
+3  1193 2359 485
+3  808 1198 250
+3  817 2186 249
+3  1017 1199 591
+3  1105 2325 487
+3  744 1200 187
+3  807 2181 250
+3  1185 1201 477
+3  1197 2360 489
+3  812 1202 252
+3  801 2178 251
+3  1020 1203 599
+3  1084 2314 491
+3  730 1204 188
+3  811 2183 252
+3  2362 1205 501
+3  1222 1206 493
+3  836 1207 254
+3  825 2190 253
+3  1038 1208 607
+3  1117 2331 495
+3  752 1209 189
+3  835 2195 254
+3  2363 1210 505
+3  1205 2362 497
+3  820 1211 256
+3  829 2192 255
+3  1026 1212 615
+3  1123 2334 499
+3  756 1213 190
+3  819 2187 256
+3  2364 1214 509
+3  1210 2363 501
+3  824 1215 258
+3  833 2194 257
+3  1029 1216 622
+3  1126 2336 503
+3  758 1217 191
+3  823 2189 258
+3  2365 1218 493
+3  1214 2364 505
+3  828 1219 260
+3  837 2196 259
+3  1032 1220 627
+3  1132 2339 507
+3  762 1221 192
+3  827 2191 260
+3  1206 1222 497
+3  1218 2365 509
+3  832 1223 262
+3  821 2188 261
+3  1035 1224 635
+3  1111 2328 511
+3  748 1225 193
+3  831 2193 262
+3  2367 1226 533
+3  1362 1227 513
+3  960 1228 264
+3  865 2210 263
+3  1136 1229 643
+3  1063 2301 515
+3  716 1230 194
+3  959 2257 264
+3  2368 1231 573
+3  1347 2397 2411
+3  49 48 2407
+3  2369 1232 581
+3  1375 1233 518
+3  974 1234 266
+3  989 2272 265
+3  1147 2438 651
+3  1160 2350 519
+3  778 1235 195
+3  973 2264 266
+3  2370 1236 557
+3  1379 2405 521
+3  978 1237 268
+3  889 2222 267
+3  1149 1238 658
+3  1081 2312 523
+3  728 1239 196
+3  977 2266 268
+3  2371 1240 549
+3  1305 2385 525
+3  910 1241 270
+3  881 2218 269
+3  1097 1242 666
+3  1075 2308 527
+3  724 1243 197
+3  909 2232 270
+3  2372 1244 660
+3  1331 2391 529
+3  934 1245 272
+3  893 2224 271
+3  1115 1246 535
+3  1007 2279 531
+3  680 1247 198
+3  933 2244 272
+3  2373 1248 637
+3  1253 1249 533
+3  864 1250 274
+3  931 2243 273
+3  1061 1251 455
+3  1114 2329 535
+3  750 1252 199
+3  863 2209 274
+3  1249 1253 605
+3  1226 2367 537
+3  840 1254 276
+3  861 2208 275
+3  1041 1255 543
+3  995 2275 539
+3  672 1256 200
+3  839 2197 276
+3  2374 1257 597
+3  1261 2375 541
+3  872 1258 278
+3  969 2262 277
+3  1067 1259 459
+3  1040 2290 543
+3  702 1260 201
+3  871 2213 278
+3  2375 1261 645
+3  1314 2386 545
+3  918 1262 280
+3  869 2212 279
+3  1103 1263 551
+3  998 2276 547
+3  674 1264 202
+3  917 2236 280
+3  2376 1265 585
+3  1270 1266 549
+3  880 1267 282
+3  915 2235 281
+3  1073 1268 463
+3  1102 2323 551
+3  742 1269 203
+3  879 2217 282
+3  1266 1270 589
+3  1240 2371 553
+3  852 1271 284
+3  877 2216 283
+3  1052 1272 559
+3  1001 2277 555
+3  676 1273 204
+3  851 2203 284
+3  2377 1274 653
+3  1279 1275 557
+3  888 1276 286
+3  993 2274 285
+3  1079 1277 467
+3  1051 2294 559
+3  708 1278 205
+3  887 2221 286
+3  1275 1279 668
+3  1236 2370 561
+3  848 1280 288
+3  885 2220 287
+3  1049 1281 567
+3  1004 2278 563
+3  678 1282 206
+3  847 2201 288
+3  2378 1283 613
+3  1244 2372 565
+3  856 1284 290
+3  985 2270 289
+3  1055 1285 471
+3  1048 2293 567
+3  706 1286 207
+3  855 2205 290
+3  2379 1287 641
+3  1353 2398 569
+3  952 1288 292
+3  927 2241 291
+3  1130 1289 575
+3  1022 2284 571
+3  690 1290 208
+3  951 2253 292
+3  2380 1291 2426
+3  1296 1292 573
+3  904 1293 294
+3  949 2252 293
+3  1091 1294 475
+3  1129 2337 575
+3  760 1295 209
+3  903 2229 294
+3  1292 1296 625
+3  1231 2368 577
+3  844 1297 296
+3  901 2228 295
+3  1044 2422 580
+3  1010 2280 578
+3  682 1298 210
+3  843 2199 296
+3  2381 1299 518
+3  2434 2383 2433
+3  2419 17 16
+3  1094 1300 479
+3  1043 2291 580
+3  2448 20 19
+3  2383 2434 2406
+3  1391 1301 581
+3  988 1302 298
+3  905 2230 297
+3  1158 1303 587
+3  1013 2281 583
+3  684 1304 211
+3  987 2271 298
+3  2385 1305 553
+3  1310 1306 585
+3  914 1307 300
+3  853 2204 299
+3  1100 1308 483
+3  1157 2348 587
+3  776 1309 212
+3  913 2234 300
+3  1306 1310 525
+3  1265 2376 589
+3  876 1311 302
+3  911 2233 301
+3  1070 1312 595
+3  1016 2282 591
+3  686 1313 213
+3  875 2215 302
+3  2386 1314 541
+3  1318 2388 593
+3  922 1315 304
+3  873 2214 303
+3  1106 1316 487
+3  1069 2304 595
+3  720 1317 214
+3  921 2238 304
+3  2388 1318 545
+3  1370 1319 597
+3  968 1320 306
+3  919 2237 305
+3  1142 1321 603
+3  1019 2283 599
+3  688 1322 215
+3  967 2261 306
+3  2389 1323 633
+3  1287 2379 601
+3  896 1324 308
+3  965 2260 307
+3  1085 1325 491
+3  1141 2342 603
+3  768 1326 216
+3  895 2225 308
+3  2390 1327 513
+3  1248 2373 605
+3  860 1328 310
+3  961 2258 309
+3  1058 1329 611
+3  1037 2289 607
+3  700 1330 217
+3  859 2207 310
+3  2391 1331 565
+3  1335 2393 609
+3  938 1332 312
+3  857 2206 311
+3  1118 1333 495
+3  1057 2297 611
+3  712 1334 218
+3  937 2246 312
+3  2393 1335 529
+3  1387 1336 613
+3  984 1337 314
+3  935 2245 313
+3  1155 1338 619
+3  1025 2285 615
+3  692 1339 219
+3  983 2269 314
+3  2394 1340 2428
+3  1344 2395 617
+3  946 1341 316
+3  981 2268 315
+3  1124 1342 499
+3  1154 2347 619
+3  774 1343 220
+3  945 2250 316
+3  2395 1344 656
+3  1374 2401 621
+3  972 1345 318
+3  943 2249 317
+3  1145 2418 624
+3  1028 2286 622
+3  694 1346 221
+3  971 2263 318
+3  2397 1347 577
+3  2408 1348 2426
+3  1127 1349 503
+3  1144 2343 624
+3  2445 79 78
+3  1348 2408 2411
+3  1291 2380 625
+3  900 1350 320
+3  947 2251 319
+3  1088 1351 631
+3  1031 2287 627
+3  696 1352 222
+3  899 2227 320
+3  2398 1353 601
+3  1357 2400 629
+3  956 1354 322
+3  897 2226 321
+3  1133 1355 507
+3  1087 2315 631
+3  732 1356 223
+3  955 2255 322
+3  2400 1357 569
+3  1366 1358 633
+3  964 1359 324
+3  953 2254 323
+3  1139 1360 639
+3  1034 2288 635
+3  698 1361 224
+3  963 2259 324
+3  1227 1362 537
+3  1327 2390 637
+3  930 1363 326
+3  841 2198 325
+3  1112 1364 511
+3  1138 2341 639
+3  766 1365 225
+3  929 2242 326
+3  1358 1366 629
+3  1323 2389 641
+3  926 1367 328
+3  957 2256 327
+3  1109 1368 647
+3  1135 2340 643
+3  764 1369 226
+3  925 2240 328
+3  1319 1370 593
+3  1257 2374 645
+3  868 1371 330
+3  923 2239 329
+3  1064 1372 515
+3  1108 2326 647
+3  746 1373 227
+3  867 2211 330
+3  2401 1374 617
+3  1376 2403 2430
+3  1233 1375 664
+3  1299 2381 2406
+3  168 167 2431
+3  2403 1376 621
+3  2416 1377 2428
+3  2440 136 135
+3  1152 1378 655
+3  1146 2344 651
+3  139 138 2447
+3  2405 1379 561
+3  1395 1380 653
+3  992 1381 332
+3  849 2202 331
+3  1161 1382 519
+3  1151 2346 655
+3  772 1383 228
+3  991 2273 332
+3  1377 2416 2430
+3  1340 2394 656
+3  942 1384 334
+3  975 2265 333
+3  1121 1385 662
+3  1148 2345 658
+3  770 1386 229
+3  941 2248 334
+3  1336 1387 609
+3  1283 2378 660
+3  892 1388 336
+3  939 2247 335
+3  1082 1389 523
+3  1120 2332 662
+3  754 1390 230
+3  891 2223 336
+3  1301 1391 2433
+3  1232 2369 664
+3  846 1392 338
+3  907 2231 337
+3  1046 1393 670
+3  1096 2320 666
+3  738 1394 231
+3  845 2200 338
+3  1380 1395 521
+3  1274 2377 668
+3  884 1396 340
+3  979 2267 339
+3  1076 1397 527
+3  1045 2292 670
+3  704 1398 232
+3  883 2219 340
+3  1400 1167 1399
+3  1400 671 200
+3  1402 1171 1401
+3  1402 673 202
+3  1404 1175 1403
+3  1404 675 204
+3  1406 1179 1405
+3  1406 677 206
+3  1408 1183 1407
+3  1408 679 198
+3  1410 1188 1409
+3  1410 681 210
+3  1412 1192 1411
+3  1412 683 211
+3  1414 1196 1413
+3  1414 685 213
+3  1416 1200 1415
+3  1416 687 215
+3  1418 1204 1417
+3  1418 689 208
+3  1420 1209 1419
+3  1420 691 219
+3  1422 1213 1421
+3  1422 693 221
+3  1424 1217 1423
+3  1424 695 222
+3  1426 1221 1425
+3  1426 697 224
+3  1428 1225 1427
+3  1428 699 217
+3  1430 1230 1429
+3  1430 701 201
+3  1432 1235 1431
+3  1432 703 232
+3  1434 1239 1433
+3  1434 705 207
+3  1436 1243 1435
+3  1436 707 205
+3  1438 1247 1437
+3  1438 709 183
+3  1440 1252 1439
+3  1440 711 218
+3  1442 1256 1441
+3  1442 713 179
+3  1444 1260 1443
+3  1444 715 194
+3  1446 1264 1445
+3  1446 717 180
+3  1448 1269 1447
+3  1448 719 214
+3  1450 1273 1449
+3  1450 721 181
+3  1452 1278 1451
+3  1452 723 197
+3  1454 1282 1453
+3  1454 725 182
+3  1456 1286 1455
+3  1456 727 196
+3  1458 1290 1457
+3  1458 729 188
+3  1460 1295 1459
+3  1460 731 223
+3  1462 1298 1461
+3  1462 733 184
+3  1464 1304 1463
+3  1464 735 185
+3  1466 1309 1465
+3  1466 737 231
+3  1468 1313 1467
+3  1468 739 186
+3  1470 1317 1469
+3  1470 741 203
+3  1472 1322 1471
+3  1472 743 187
+3  1474 1326 1473
+3  1474 745 227
+3  1476 1330 1475
+3  1476 747 193
+3  1478 1334 1477
+3  1478 749 199
+3  1480 1339 1479
+3  1480 751 189
+3  1482 1343 1481
+3  1482 753 230
+3  1484 1346 1483
+3  1484 755 190
+3  1486 1352 1485
+3  1486 757 191
+3  1488 1356 1487
+3  1488 759 209
+3  1490 1361 1489
+3  1490 761 192
+3  1492 1365 1491
+3  1492 763 226
+3  1494 1369 1493
+3  1494 765 225
+3  1496 1373 1495
+3  1496 767 216
+3  1498 1383 1497
+3  1498 769 229
+3  1500 1386 1499
+3  1500 771 228
+3  1502 1390 1501
+3  1502 773 220
+3  1504 1394 1503
+3  1504 775 212
+3  1506 1398 1505
+3  1506 777 195
+3  1508 997 1507
+3  1508 779 236
+3  1510 1165 1509
+3  1510 781 241
+3  1512 1000 1511
+3  1512 783 238
+3  1514 1169 1513
+3  1514 785 233
+3  1516 1003 1515
+3  1516 787 240
+3  1518 1173 1517
+3  1518 789 235
+3  1520 1006 1519
+3  1520 791 242
+3  1522 1177 1521
+3  1522 793 237
+3  1524 1009 1523
+3  1524 795 234
+3  1526 1181 1525
+3  1526 797 239
+3  1528 1012 1527
+3  1528 799 246
+3  1530 1186 1529
+3  1530 801 251
+3  1532 1015 1531
+3  1532 803 248
+3  1534 1190 1533
+3  1534 805 243
+3  1536 1018 1535
+3  1536 807 250
+3  1538 1194 1537
+3  1538 809 245
+3  1540 1021 1539
+3  1540 811 252
+3  1542 1198 1541
+3  1542 813 247
+3  1544 1024 1543
+3  1544 815 244
+3  1546 1202 1545
+3  1546 817 249
+3  1548 1027 1547
+3  1548 819 256
+3  1550 1207 1549
+3  1550 821 261
+3  1552 1030 1551
+3  1552 823 258
+3  1554 1211 1553
+3  1554 825 253
+3  1556 1033 1555
+3  1556 827 260
+3  1558 1215 1557
+3  1558 829 255
+3  1560 1036 1559
+3  1560 831 262
+3  1562 1219 1561
+3  1562 833 257
+3  1564 1039 1563
+3  1564 835 254
+3  1566 1223 1565
+3  1566 837 259
+3  1568 1042 1567
+3  1568 839 276
+3  1570 1228 1569
+3  1570 841 325
+3  1572 2453 1571
+3  1572 843 296
+3  1574 1047 1573
+3  1574 845 338
+3  1576 1234 1575
+3  1576 2435 2431
+3  1578 1050 1577
+3  1578 847 288
+3  1580 1237 1579
+3  1580 849 331
+3  1582 1053 1581
+3  1582 851 284
+3  1584 1241 1583
+3  1584 853 299
+3  1586 1056 1585
+3  1586 855 290
+3  1588 1245 1587
+3  1588 857 311
+3  1590 1059 1589
+3  1590 859 310
+3  1592 1250 1591
+3  1592 861 275
+3  1594 1062 1593
+3  1594 863 274
+3  1596 1254 1595
+3  1596 865 263
+3  1598 1065 1597
+3  1598 867 330
+3  1600 1258 1599
+3  1600 869 279
+3  1602 1068 1601
+3  1602 871 278
+3  1604 1262 1603
+3  1604 873 303
+3  1606 1071 1605
+3  1606 875 302
+3  1608 1267 1607
+3  1608 877 283
+3  1610 1074 1609
+3  1610 879 282
+3  1612 1271 1611
+3  1612 881 269
+3  1614 1077 1613
+3  1614 883 340
+3  1616 1276 1615
+3  1616 885 287
+3  1618 1080 1617
+3  1618 887 286
+3  1620 1280 1619
+3  1620 889 267
+3  1622 1083 1621
+3  1622 891 336
+3  1624 1284 1623
+3  1624 893 271
+3  1626 1086 1625
+3  1626 895 308
+3  1628 1288 1627
+3  1628 897 321
+3  1630 1089 1629
+3  1630 899 320
+3  1632 1293 1631
+3  1632 901 295
+3  1634 1092 1633
+3  1634 903 294
+3  1636 1297 1635
+3  1636 2414 2407
+3  1638 2410 1637
+3  1638 905 297
+3  1640 1095 1639
+3  1640 2448 2419
+3  1642 1302 1641
+3  1642 907 337
+3  1644 1098 1643
+3  1644 909 270
+3  1646 1307 1645
+3  1646 911 301
+3  1648 1101 1647
+3  1648 913 300
+3  1650 1311 1649
+3  1650 915 281
+3  1652 1104 1651
+3  1652 917 280
+3  1654 1315 1653
+3  1654 919 305
+3  1656 1107 1655
+3  1656 921 304
+3  1658 1320 1657
+3  1658 923 329
+3  1660 1110 1659
+3  1660 925 328
+3  1662 1324 1661
+3  1662 927 291
+3  1664 1113 1663
+3  1664 929 326
+3  1666 1328 1665
+3  1666 931 273
+3  1668 1116 1667
+3  1668 933 272
+3  1670 1332 1669
+3  1670 935 313
+3  1672 1119 1671
+3  1672 937 312
+3  1674 1337 1673
+3  1674 939 335
+3  1676 1122 1675
+3  1676 941 334
+3  1678 1341 1677
+3  1678 943 317
+3  1680 1125 1679
+3  1680 945 316
+3  1682 1345 1681
+3  1682 2412 2424
+3  1684 2420 1683
+3  1684 947 319
+3  1686 1128 1685
+3  1686 2445 2421
+3  1688 1350 1687
+3  1688 949 293
+3  1690 1131 1689
+3  1690 951 292
+3  1692 1354 1691
+3  1692 953 323
+3  1694 1134 1693
+3  1694 955 322
+3  1696 1359 1695
+3  1696 957 327
+3  1698 1137 1697
+3  1698 959 264
+3  1700 1363 1699
+3  1700 961 309
+3  1702 1140 1701
+3  1702 963 324
+3  1704 1367 1703
+3  1704 965 307
+3  1706 1143 1705
+3  1706 967 306
+3  1708 1371 1707
+3  1708 969 277
+3  1710 2437 1709
+3  1710 971 318
+3  1712 2450 1711
+3  1712 973 266
+3  1714 2441 1713
+3  1714 975 333
+3  1716 1150 1715
+3  1716 977 268
+3  1718 1381 1717
+3  1718 979 339
+3  1720 1153 1719
+3  1720 2447 2440
+3  1722 1384 1721
+3  1722 981 315
+3  1724 1156 1723
+3  1724 983 314
+3  1726 1388 1725
+3  1726 985 289
+3  1728 1159 1727
+3  1728 987 298
+3  1730 1392 1729
+3  1730 989 265
+3  1732 1162 1731
+3  1732 991 332
+3  1734 1396 1733
+3  1734 993 285
+3  1735 839 1567
+3  1735 995 539
+3  1736 1066 1507
+3  1736 997 458
+3  1737 917 1651
+3  1737 998 547
+3  1738 1072 1511
+3  1738 1000 462
+3  1739 851 1581
+3  1739 1001 555
+3  1740 1078 1515
+3  1740 1003 466
+3  1741 847 1577
+3  1741 1004 563
+3  1742 1054 1519
+3  1742 1006 470
+3  1743 933 1667
+3  1743 1007 531
+3  1744 1060 1523
+3  1744 1009 454
+3  1745 843 1571
+3  1745 1010 578
+3  1746 1093 1527
+3  1746 1012 478
+3  1747 987 1727
+3  1747 1013 583
+3  1748 1099 1531
+3  1748 1015 482
+3  1749 875 1605
+3  1749 1016 591
+3  1750 1105 1535
+3  1750 1018 486
+3  1751 967 1705
+3  1751 1019 599
+3  1752 1084 1539
+3  1752 1021 490
+3  1753 951 1689
+3  1753 1022 571
+3  1754 1090 1543
+3  1754 1024 474
+3  1755 983 1723
+3  1755 1025 615
+3  1756 1123 1547
+3  1756 1027 498
+3  1757 971 1709
+3  1757 1028 622
+3  1758 1126 1551
+3  1758 1030 502
+3  1759 899 1629
+3  1759 1031 627
+3  1760 1132 1555
+3  1760 1033 506
+3  1761 963 1701
+3  1761 1034 635
+3  1762 1111 1559
+3  1762 1036 510
+3  1763 859 1589
+3  1763 1037 607
+3  1764 1117 1563
+3  1764 1039 494
+3  1765 871 1601
+3  1765 1040 543
+3  1766 995 1567
+3  1766 1042 538
+3  2427 2448 1639
+3  2427 1043 580
+3  2452 1010 1571
+3  42 41 2452
+3  1767 883 1613
+3  1767 1045 670
+3  1768 1096 1573
+3  1768 1047 665
+3  1769 855 1585
+3  1769 1048 567
+3  1770 1004 1577
+3  1770 1050 562
+3  1771 887 1617
+3  1771 1051 559
+3  1772 1001 1581
+3  1772 1053 554
+3  1773 791 1519
+3  1773 1054 471
+3  1774 1048 1585
+3  1774 1056 566
+3  1775 937 1671
+3  1775 1057 611
+3  1776 1037 1589
+3  1776 1059 606
+3  1777 795 1523
+3  1777 1060 455
+3  1778 1114 1593
+3  1778 1062 534
+3  1779 959 1697
+3  1779 1063 515
+3  1780 1108 1597
+3  1780 1065 646
+3  1781 779 1507
+3  1781 1066 459
+3  1782 1040 1601
+3  1782 1068 542
+3  1783 921 1655
+3  1783 1069 595
+3  1784 1016 1605
+3  1784 1071 590
+3  1785 783 1511
+3  1785 1072 463
+3  1786 1102 1609
+3  1786 1074 550
+3  1787 909 1643
+3  1787 1075 527
+3  1788 1045 1613
+3  1788 1077 669
+3  1789 787 1515
+3  1789 1078 467
+3  1790 1051 1617
+3  1790 1080 558
+3  1791 977 1715
+3  1791 1081 523
+3  1792 1120 1621
+3  1792 1083 661
+3  1793 811 1539
+3  1793 1084 491
+3  1794 1141 1625
+3  1794 1086 602
+3  1795 955 1693
+3  1795 1087 631
+3  1796 1031 1629
+3  1796 1089 626
+3  1797 815 1543
+3  1797 1090 475
+3  1798 1129 1633
+3  1798 1092 574
+3  1799 799 1527
+3  1799 1093 479
+3  1800 1043 1639
+3  1800 1095 579
+3  1801 845 1573
+3  1801 1096 666
+3  1802 1075 1643
+3  1802 1098 526
+3  1803 803 1531
+3  1803 1099 483
+3  1804 1157 1647
+3  1804 1101 586
+3  1805 879 1609
+3  1805 1102 551
+3  1806 998 1651
+3  1806 1104 546
+3  1807 807 1535
+3  1807 1105 487
+3  1808 1069 1655
+3  1808 1107 594
+3  1809 867 1597
+3  1809 1108 647
+3  1810 1135 1659
+3  1810 1110 642
+3  1811 831 1559
+3  1811 1111 511
+3  1812 1138 1663
+3  1812 1113 638
+3  1813 863 1593
+3  1813 1114 535
+3  1814 1007 1667
+3  1814 1116 530
+3  1815 835 1563
+3  1815 1117 495
+3  1816 1057 1671
+3  1816 1119 610
+3  1817 891 1621
+3  1817 1120 662
+3  1818 1148 1675
+3  1818 1122 657
+3  1819 819 1547
+3  1819 1123 499
+3  1820 1154 1679
+3  1820 1125 618
+3  1821 823 1551
+3  1821 1126 503
+3  1822 1144 1685
+3  1822 1128 623
+3  1823 903 1633
+3  1823 1129 575
+3  1824 1022 1689
+3  1824 1131 570
+3  1825 827 1555
+3  1825 1132 507
+3  1826 1087 1693
+3  1826 1134 630
+3  1827 925 1659
+3  1827 1135 643
+3  1828 1063 1697
+3  1828 1137 514
+3  1829 929 1663
+3  1829 1138 639
+3  1830 1034 1701
+3  1830 1140 634
+3  1831 895 1625
+3  1831 1141 603
+3  1832 1019 1705
+3  1832 1143 598
+3  2446 2445 1685
+3  2446 1144 624
+3  2449 1028 1709
+3  2437 101 2449
+3  2451 2447 1719
+3  2451 1146 651
+3  2444 1160 1711
+3  161 160 2444
+3  1833 941 1675
+3  1833 1148 658
+3  1834 1081 1715
+3  1834 1150 522
+3  1835 991 1731
+3  1835 1151 655
+3  1836 1146 1719
+3  1836 1153 650
+3  1837 945 1679
+3  1837 1154 619
+3  1838 1025 1723
+3  1838 1156 614
+3  1839 913 1647
+3  1839 1157 587
+3  1840 1013 1727
+3  1840 1159 582
+3  1841 973 1711
+3  1841 1160 519
+3  1842 1151 1731
+3  1842 1162 654
+3  1843 789 1517
+3  1843 1163 457
+3  1844 1176 1509
+3  1844 1165 468
+3  1845 709 1437
+3  1845 1166 350
+3  1846 1251 1399
+3  1846 1167 384
+3  1847 793 1521
+3  1847 1168 461
+3  1848 1180 1513
+3  1848 1169 452
+3  1849 713 1441
+3  1849 1170 342
+3  1850 1259 1401
+3  1850 1171 388
+3  1851 797 1525
+3  1851 1172 465
+3  1852 1163 1517
+3  1852 1173 456
+3  1853 717 1445
+3  1853 1174 344
+3  1854 1268 1403
+3  1854 1175 392
+3  1855 781 1509
+3  1855 1176 469
+3  1856 1168 1521
+3  1856 1177 460
+3  1857 721 1449
+3  1857 1178 346
+3  1858 1277 1405
+3  1858 1179 396
+3  1859 785 1513
+3  1859 1180 453
+3  1860 1172 1525
+3  1860 1181 464
+3  1861 725 1453
+3  1861 1182 348
+3  1862 1285 1407
+3  1862 1183 380
+3  1863 809 1537
+3  1863 1184 477
+3  1864 1197 1529
+3  1864 1186 488
+3  1865 729 1457
+3  1865 1187 360
+3  1866 1294 1409
+3  1866 1188 404
+3  1867 813 1541
+3  1867 1189 481
+3  1868 1201 1533
+3  1868 1190 472
+3  1869 733 1461
+3  1869 1191 352
+3  1870 1300 1411
+3  1870 1192 406
+3  1871 817 1545
+3  1871 1193 485
+3  1872 1184 1537
+3  1872 1194 476
+3  1873 735 1463
+3  1873 1195 354
+3  1874 1308 1413
+3  1874 1196 410
+3  1875 801 1529
+3  1875 1197 489
+3  1876 1189 1541
+3  1876 1198 480
+3  1877 739 1467
+3  1877 1199 356
+3  1878 1316 1415
+3  1878 1200 414
+3  1879 805 1533
+3  1879 1201 473
+3  1880 1193 1545
+3  1880 1202 484
+3  1881 743 1471
+3  1881 1203 358
+3  1882 1325 1417
+3  1882 1204 400
+3  1883 829 1557
+3  1883 1205 497
+3  1884 1218 1549
+3  1884 1207 508
+3  1885 747 1475
+3  1885 1208 370
+3  1886 1333 1419
+3  1886 1209 422
+3  1887 833 1561
+3  1887 1210 501
+3  1888 1222 1553
+3  1888 1211 492
+3  1889 751 1479
+3  1889 1212 362
+3  1890 1342 1421
+3  1890 1213 426
+3  1891 837 1565
+3  1891 1214 505
+3  1892 1205 1557
+3  1892 1215 496
+3  1893 755 1483
+3  1893 1216 364
+3  1894 1349 1423
+3  1894 1217 428
+3  1895 821 1549
+3  1895 1218 509
+3  1896 1210 1561
+3  1896 1219 500
+3  1897 757 1485
+3  1897 1220 366
+3  1898 1355 1425
+3  1898 1221 432
+3  1899 825 1553
+3  1899 1222 493
+3  1900 1214 1565
+3  1900 1223 504
+3  1901 761 1489
+3  1901 1224 368
+3  1902 1364 1427
+3  1902 1225 418
+3  1903 861 1591
+3  1903 1226 537
+3  1904 1327 1569
+3  1904 1228 636
+3  1905 765 1493
+3  1905 1229 435
+3  1906 1372 1429
+3  1906 1230 386
+3  1907 901 1631
+3  1907 1231 577
+3  1908 907 1641
+3  1908 1232 664
+3  1909 1299 1575
+3  1909 1234 649
+3  2443 2438 441
+3  1910 1382 1431
+3  1910 1235 450
+3  1911 885 1615
+3  1911 1236 561
+3  1912 1395 1579
+3  1912 1237 652
+3  1913 771 1499
+3  1913 1238 443
+3  1914 1389 1433
+3  1914 1239 398
+3  1915 877 1607
+3  1915 1240 553
+3  1916 1310 1583
+3  1916 1241 584
+3  1917 775 1503
+3  1917 1242 409
+3  1918 1397 1435
+3  1918 1243 394
+3  1919 985 1725
+3  1919 1244 565
+3  1920 1335 1587
+3  1920 1245 608
+3  1921 711 1439
+3  1921 1246 421
+3  1922 1166 1437
+3  1922 1247 349
+3  1923 961 1699
+3  1923 1248 605
+3  1924 1226 1591
+3  1924 1250 536
+3  1925 671 1399
+3  1925 1251 385
+3  1926 1246 1439
+3  1926 1252 420
+3  1927 931 1665
+3  1927 1253 533
+3  1928 1362 1595
+3  1928 1254 512
+3  1929 715 1443
+3  1929 1255 372
+3  1930 1170 1441
+3  1930 1256 341
+3  1931 923 1657
+3  1931 1257 645
+3  1932 1314 1599
+3  1932 1258 544
+3  1933 673 1401
+3  1933 1259 389
+3  1934 1255 1443
+3  1934 1260 371
+3  1935 969 1707
+3  1935 1261 541
+3  1936 1318 1603
+3  1936 1262 592
+3  1937 719 1447
+3  1937 1263 413
+3  1938 1174 1445
+3  1938 1264 343
+3  1939 911 1645
+3  1939 1265 589
+3  1940 1240 1607
+3  1940 1267 552
+3  1941 675 1403
+3  1941 1268 393
+3  1942 1263 1447
+3  1942 1269 412
+3  1943 915 1649
+3  1943 1270 549
+3  1944 1305 1611
+3  1944 1271 524
+3  1945 723 1451
+3  1945 1272 379
+3  1946 1178 1449
+3  1946 1273 345
+3  1947 979 1717
+3  1947 1274 668
+3  1948 1236 1615
+3  1948 1276 560
+3  1949 677 1405
+3  1949 1277 397
+3  1950 1272 1451
+3  1950 1278 378
+3  1951 993 1733
+3  1951 1279 557
+3  1952 1379 1619
+3  1952 1280 520
+3  1953 727 1455
+3  1953 1281 377
+3  1954 1182 1453
+3  1954 1282 347
+3  1955 939 1673
+3  1955 1283 660
+3  1956 1331 1623
+3  1956 1284 528
+3  1957 679 1407
+3  1957 1285 381
+3  1958 1281 1455
+3  1958 1286 376
+3  1959 965 1703
+3  1959 1287 601
+3  1960 1357 1627
+3  1960 1288 628
+3  1961 731 1459
+3  1961 1289 431
+3  1962 1187 1457
+3  1962 1290 359
+3  1963 947 1683
+3  1963 1291 625
+3  1964 1231 1631
+3  1964 1293 576
+3  1965 681 1409
+3  1965 1294 405
+3  1966 1289 1459
+3  1966 1295 430
+3  1967 949 1687
+3  1967 1296 573
+3  1968 1347 1635
+3  1968 1297 516
+3  2409 2422 373
+3  1969 1191 1461
+3  1969 1298 351
+3  2436 2435 1575
+3  2436 1299 2406
+3  2432 1391 1637
+3  2410 13 12
+3  1970 683 1411
+3  1970 1300 407
+3  5 4 2433
+3  1971 1232 1641
+3  1971 1302 663
+3  1972 737 1465
+3  1972 1303 449
+3  1973 1195 1463
+3  1973 1304 353
+3  1974 881 1611
+3  1974 1305 525
+3  1975 1265 1645
+3  1975 1307 588
+3  1976 685 1413
+3  1976 1308 411
+3  1977 1303 1465
+3  1977 1309 448
+3  1978 853 1583
+3  1978 1310 585
+3  1979 1270 1649
+3  1979 1311 548
+3  1980 741 1469
+3  1980 1312 391
+3  1981 1199 1467
+3  1981 1313 355
+3  1982 869 1599
+3  1982 1314 545
+3  1983 1370 1653
+3  1983 1315 596
+3  1984 687 1415
+3  1984 1316 415
+3  1985 1312 1469
+3  1985 1317 390
+3  1986 873 1603
+3  1986 1318 593
+3  1987 1257 1657
+3  1987 1320 644
+3  1988 745 1473
+3  1988 1321 439
+3  1989 1203 1471
+3  1989 1322 357
+3  1990 957 1695
+3  1990 1323 641
+3  1991 1353 1661
+3  1991 1324 568
+3  1992 689 1417
+3  1992 1325 401
+3  1993 1321 1473
+3  1993 1326 438
+3  1994 841 1569
+3  1994 1327 637
+3  1995 1253 1665
+3  1995 1328 532
+3  1996 749 1477
+3  1996 1329 383
+3  1997 1208 1475
+3  1997 1330 369
+3  1998 893 1623
+3  1998 1331 529
+3  1999 1387 1669
+3  1999 1332 612
+3  2000 691 1419
+3  2000 1333 423
+3  2001 1329 1477
+3  2001 1334 382
+3  2002 857 1587
+3  2002 1335 609
+3  2003 1283 1673
+3  2003 1337 659
+3  2004 753 1481
+3  2004 1338 447
+3  2005 1212 1479
+3  2005 1339 361
+3  2006 975 1713
+3  2006 1340 656
+3  2007 1374 1677
+3  2007 1341 620
+3  2008 693 1421
+3  2008 1342 427
+3  2009 1338 1481
+3  2009 1343 446
+3  2010 981 1721
+3  2010 1344 617
+3  2011 1376 1681
+3  2011 1345 648
+3  2442 2418 440
+3  2012 1216 1483
+3  2012 1346 363
+3  2415 2414 1635
+3  2415 1347 2411
+3  2425 1291 1683
+3  2420 72 71
+3  2013 695 1423
+3  2013 1349 429
+3  2014 1296 1687
+3  2014 1350 572
+3  2015 759 1487
+3  2015 1351 403
+3  2016 1220 1485
+3  2016 1352 365
+3  2017 927 1661
+3  2017 1353 569
+3  2018 1366 1691
+3  2018 1354 632
+3  2019 697 1425
+3  2019 1355 433
+3  2020 1351 1487
+3  2020 1356 402
+3  2021 897 1627
+3  2021 1357 629
+3  2022 1323 1695
+3  2022 1359 640
+3  2023 763 1491
+3  2023 1360 437
+3  2024 1224 1489
+3  2024 1361 367
+3  2025 865 1595
+3  2025 1362 513
+3  2026 1248 1699
+3  2026 1363 604
+3  2027 699 1427
+3  2027 1364 419
+3  2028 1360 1491
+3  2028 1365 436
+3  2029 953 1691
+3  2029 1366 633
+3  2030 1287 1703
+3  2030 1367 600
+3  2031 767 1495
+3  2031 1368 417
+3  2032 1229 1493
+3  2032 1369 434
+3  2033 919 1653
+3  2033 1370 597
+3  2034 1261 1707
+3  2034 1371 540
+3  2035 701 1429
+3  2035 1372 387
+3  2036 1368 1495
+3  2036 1373 416
+3  2037 943 1677
+3  2037 1374 621
+3  2038 989 1729
+3  2038 1375 518
+3  2413 2412 1681
+3  2413 1376 2430
+3  2429 1340 1713
+3  130 129 2429
+3  2039 769 1497
+3  2039 1378 445
+3  2040 889 1619
+3  2040 1379 521
+3  2041 1274 1717
+3  2041 1381 667
+3  2042 703 1431
+3  2042 1382 451
+3  2043 1378 1497
+3  2043 1383 444
+3  2044 1344 1721
+3  2044 1384 616
+3  2045 773 1501
+3  2045 1385 425
+3  2046 1238 1499
+3  2046 1386 442
+3  2047 935 1669
+3  2047 1387 613
+3  2048 1244 1725
+3  2048 1388 564
+3  2049 705 1433
+3  2049 1389 399
+3  2050 1385 1501
+3  2050 1390 424
+3  2051 905 1637
+3  2051 1391 581
+3  2052 1375 1729
+3  2052 1392 517
+3  2053 777 1505
+3  2053 1393 375
+3  2054 1242 1503
+3  2054 1394 408
+3  2055 849 1579
+3  2055 1395 653
+3  2056 1279 1733
+3  2056 1396 556
+3  2057 707 1435
+3  2057 1397 395
+3  2058 1393 1505
+3  2058 1398 374
+3  2060 862 2059
+3  2060 672 200
+3  1256 1930 1441
+3  1256 1442 200
+3  2062 870 2061
+3  2062 674 202
+3  1264 1938 1445
+3  1264 1446 202
+3  2064 878 2063
+3  2064 676 204
+3  1273 1946 1449
+3  1273 1450 204
+3  2066 886 2065
+3  2066 678 206
+3  1282 1954 1453
+3  1282 1454 206
+3  2068 894 2067
+3  2068 680 198
+3  1247 1922 1437
+3  1247 1438 198
+3  2070 902 2069
+3  2070 682 210
+3  1298 1969 1461
+3  1298 1462 210
+3  2072 906 2071
+3  2072 684 211
+3  1304 1973 1463
+3  1304 1464 211
+3  2074 912 2073
+3  2074 686 213
+3  1313 1981 1467
+3  1313 1468 213
+3  2076 920 2075
+3  2076 688 215
+3  1322 1989 1471
+3  1322 1472 215
+3  2078 928 2077
+3  2078 690 208
+3  1290 1962 1457
+3  1290 1458 208
+3  2080 936 2079
+3  2080 692 219
+3  1339 2005 1479
+3  1339 1480 219
+3  2082 944 2081
+3  2082 694 221
+3  1346 2012 1483
+3  1346 1484 221
+3  2084 948 2083
+3  2084 696 222
+3  1352 2016 1485
+3  1352 1486 222
+3  2086 954 2085
+3  2086 698 224
+3  1361 2024 1489
+3  1361 1490 224
+3  2088 962 2087
+3  2088 700 217
+3  1330 1997 1475
+3  1330 1476 217
+3  2090 970 2089
+3  2090 702 201
+3  1260 1934 1443
+3  1260 1444 201
+3  2092 980 2091
+3  2092 704 232
+3  1398 2058 1505
+3  1398 1506 232
+3  2094 986 2093
+3  2094 706 207
+3  1286 1958 1455
+3  1286 1456 207
+3  2096 994 2095
+3  2096 708 205
+3  1278 1950 1451
+3  1278 1452 205
+3  2098 782 2097
+3  2098 710 183
+3  1183 1862 1407
+3  1183 1408 183
+3  2100 858 2099
+3  2100 712 218
+3  1334 2001 1477
+3  1334 1478 218
+3  2102 786 2101
+3  2102 714 179
+3  1167 1846 1399
+3  1167 1400 179
+3  2104 866 2103
+3  2104 716 194
+3  1230 1906 1429
+3  1230 1430 194
+3  2106 790 2105
+3  2106 718 180
+3  1171 1850 1401
+3  1171 1402 180
+3  2108 874 2107
+3  2108 720 214
+3  1317 1985 1469
+3  1317 1470 214
+3  2110 794 2109
+3  2110 722 181
+3  1175 1854 1403
+3  1175 1404 181
+3  2112 882 2111
+3  2112 724 197
+3  1243 1918 1435
+3  1243 1436 197
+3  2114 798 2113
+3  2114 726 182
+3  1179 1858 1405
+3  1179 1406 182
+3  2116 890 2115
+3  2116 728 196
+3  1239 1914 1433
+3  1239 1434 196
+3  2118 802 2117
+3  2118 730 188
+3  1204 1882 1417
+3  1204 1418 188
+3  2120 898 2119
+3  2120 732 223
+3  1356 2020 1487
+3  1356 1488 223
+3  2122 806 2121
+3  2122 734 184
+3  1188 1866 1409
+3  1188 1410 184
+3  2124 810 2123
+3  2124 736 185
+3  1192 1870 1411
+3  1192 1412 185
+3  2126 908 2125
+3  2126 738 231
+3  1394 2054 1503
+3  1394 1504 231
+3  2128 814 2127
+3  2128 740 186
+3  1196 1874 1413
+3  1196 1414 186
+3  2130 916 2129
+3  2130 742 203
+3  1269 1942 1447
+3  1269 1448 203
+3  2132 818 2131
+3  2132 744 187
+3  1200 1878 1415
+3  1200 1416 187
+3  2134 924 2133
+3  2134 746 227
+3  1373 2036 1495
+3  1373 1496 227
+3  2136 822 2135
+3  2136 748 193
+3  1225 1902 1427
+3  1225 1428 193
+3  2138 932 2137
+3  2138 750 199
+3  1252 1926 1439
+3  1252 1440 199
+3  2140 826 2139
+3  2140 752 189
+3  1209 1886 1419
+3  1209 1420 189
+3  2142 940 2141
+3  2142 754 230
+3  1390 2050 1501
+3  1390 1502 230
+3  2144 830 2143
+3  2144 756 190
+3  1213 1890 1421
+3  1213 1422 190
+3  2146 834 2145
+3  2146 758 191
+3  1217 1894 1423
+3  1217 1424 191
+3  2148 950 2147
+3  2148 760 209
+3  1295 1966 1459
+3  1295 1460 209
+3  2150 838 2149
+3  2150 762 192
+3  1221 1898 1425
+3  1221 1426 192
+3  2152 958 2151
+3  2152 764 226
+3  1369 2032 1493
+3  1369 1494 226
+3  2154 842 2153
+3  2154 766 225
+3  1365 2028 1491
+3  1365 1492 225
+3  2156 966 2155
+3  2156 768 216
+3  1326 1993 1473
+3  1326 1474 216
+3  2158 976 2157
+3  2158 770 229
+3  1386 2046 1499
+3  1386 1500 229
+3  2160 850 2159
+3  2160 772 228
+3  1383 2043 1497
+3  1383 1498 228
+3  2162 982 2161
+3  2162 774 220
+3  1343 2009 1481
+3  1343 1482 220
+3  2164 854 2163
+3  2164 776 212
+3  1309 1977 1465
+3  1309 1466 212
+3  2166 990 2165
+3  2166 778 195
+3  1235 1910 1431
+3  1235 1432 195
+3  2167 718 2105
+3  2167 780 236
+3  1169 1848 1513
+3  1169 1514 236
+3  2168 792 2097
+3  2168 782 241
+3  1009 1744 1523
+3  1009 1524 241
+3  2169 722 2109
+3  2169 784 238
+3  1173 1852 1517
+3  1173 1518 238
+3  2170 796 2101
+3  2170 786 233
+3  997 1736 1507
+3  997 1508 233
+3  2171 726 2113
+3  2171 788 240
+3  1177 1856 1521
+3  1177 1522 240
+3  2172 780 2105
+3  2172 790 235
+3  1000 1738 1511
+3  1000 1512 235
+3  2173 710 2097
+3  2173 792 242
+3  1181 1860 1525
+3  1181 1526 242
+3  2174 784 2109
+3  2174 794 237
+3  1003 1740 1515
+3  1003 1516 237
+3  2175 714 2101
+3  2175 796 234
+3  1165 1844 1509
+3  1165 1510 234
+3  2176 788 2113
+3  2176 798 239
+3  1006 1742 1519
+3  1006 1520 239
+3  2177 736 2123
+3  2177 800 246
+3  1190 1868 1533
+3  1190 1534 246
+3  2178 812 2117
+3  2178 802 251
+3  1024 1754 1543
+3  1024 1544 251
+3  2179 740 2127
+3  2179 804 248
+3  1194 1872 1537
+3  1194 1538 248
+3  2180 816 2121
+3  2180 806 243
+3  1012 1746 1527
+3  1012 1528 243
+3  2181 744 2131
+3  2181 808 250
+3  1198 1876 1541
+3  1198 1542 250
+3  2182 800 2123
+3  2182 810 245
+3  1015 1748 1531
+3  1015 1532 245
+3  2183 730 2117
+3  2183 812 252
+3  1202 1880 1545
+3  1202 1546 252
+3  2184 804 2127
+3  2184 814 247
+3  1018 1750 1535
+3  1018 1536 247
+3  2185 734 2121
+3  2185 816 244
+3  1186 1864 1529
+3  1186 1530 244
+3  2186 808 2131
+3  2186 818 249
+3  1021 1752 1539
+3  1021 1540 249
+3  2187 756 2143
+3  2187 820 256
+3  1211 1888 1553
+3  1211 1554 256
+3  2188 832 2135
+3  2188 822 261
+3  1039 1764 1563
+3  1039 1564 261
+3  2189 758 2145
+3  2189 824 258
+3  1215 1892 1557
+3  1215 1558 258
+3  2190 836 2139
+3  2190 826 253
+3  1027 1756 1547
+3  1027 1548 253
+3  2191 762 2149
+3  2191 828 260
+3  1219 1896 1561
+3  1219 1562 260
+3  2192 820 2143
+3  2192 830 255
+3  1030 1758 1551
+3  1030 1552 255
+3  2193 748 2135
+3  2193 832 262
+3  1223 1900 1565
+3  1223 1566 262
+3  2194 824 2145
+3  2194 834 257
+3  1033 1760 1555
+3  1033 1556 257
+3  2195 752 2139
+3  2195 836 254
+3  1207 1884 1549
+3  1207 1550 254
+3  2196 828 2149
+3  2196 838 259
+3  1036 1762 1559
+3  1036 1560 259
+3  2197 672 2059
+3  2197 840 276
+3  1254 1928 1595
+3  1254 1596 276
+3  2198 930 2153
+3  2198 842 325
+3  1137 1828 1697
+3  1137 1698 325
+3  2199 682 2069
+3  2199 844 296
+3  1297 1968 1635
+3  1297 1636 296
+3  2200 738 2125
+3  2200 846 338
+3  1392 2052 1729
+3  1392 1730 338
+3  2450 2444 1711
+3  2450 1712 2431
+3  2201 678 2065
+3  2201 848 288
+3  1280 1952 1619
+3  1280 1620 288
+3  2202 992 2159
+3  2202 850 331
+3  1150 1834 1715
+3  1150 1716 331
+3  2203 676 2063
+3  2203 852 284
+3  1271 1944 1611
+3  1271 1612 284
+3  2204 914 2163
+3  2204 854 299
+3  1098 1802 1643
+3  1098 1644 299
+3  2205 706 2093
+3  2205 856 290
+3  1284 1956 1623
+3  1284 1624 290
+3  2206 938 2099
+3  2206 858 311
+3  1116 1814 1667
+3  1116 1668 311
+3  2207 700 2087
+3  2207 860 310
+3  1328 1995 1665
+3  1328 1666 310
+3  2208 840 2059
+3  2208 862 275
+3  1062 1778 1593
+3  1062 1594 275
+3  2209 750 2137
+3  2209 864 274
+3  1250 1924 1591
+3  1250 1592 274
+3  2210 960 2103
+3  2210 866 263
+3  1042 1766 1567
+3  1042 1568 263
+3  2211 746 2133
+3  2211 868 330
+3  1371 2034 1707
+3  1371 1708 330
+3  2212 918 2061
+3  2212 870 279
+3  1068 1782 1601
+3  1068 1602 279
+3  2213 702 2089
+3  2213 872 278
+3  1258 1932 1599
+3  1258 1600 278
+3  2214 922 2107
+3  2214 874 303
+3  1104 1806 1651
+3  1104 1652 303
+3  2215 686 2073
+3  2215 876 302
+3  1311 1979 1649
+3  1311 1650 302
+3  2216 852 2063
+3  2216 878 283
+3  1074 1786 1609
+3  1074 1610 283
+3  2217 742 2129
+3  2217 880 282
+3  1267 1940 1607
+3  1267 1608 282
+3  2218 910 2111
+3  2218 882 269
+3  1053 1772 1581
+3  1053 1582 269
+3  2219 704 2091
+3  2219 884 340
+3  1396 2056 1733
+3  1396 1734 340
+3  2220 848 2065
+3  2220 886 287
+3  1080 1790 1617
+3  1080 1618 287
+3  2221 708 2095
+3  2221 888 286
+3  1276 1948 1615
+3  1276 1616 286
+3  2222 978 2115
+3  2222 890 267
+3  1050 1770 1577
+3  1050 1578 267
+3  2223 754 2141
+3  2223 892 336
+3  1388 2048 1725
+3  1388 1726 336
+3  2224 934 2067
+3  2224 894 271
+3  1056 1774 1585
+3  1056 1586 271
+3  2225 768 2155
+3  2225 896 308
+3  1324 1991 1661
+3  1324 1662 308
+3  2226 956 2119
+3  2226 898 321
+3  1131 1824 1689
+3  1131 1690 321
+3  2227 696 2083
+3  2227 900 320
+3  1350 2014 1687
+3  1350 1688 320
+3  2228 844 2069
+3  2228 902 295
+3  1092 1798 1633
+3  1092 1634 295
+3  2229 760 2147
+3  2229 904 294
+3  1293 1964 1631
+3  1293 1632 294
+3  2453 2452 1571
+3  2453 1572 2407
+3  2230 988 2071
+3  2230 906 297
+3  1095 1800 1639
+3  1095 1640 297
+3  2410 2432 1637
+3  2410 1638 2419
+3  2231 846 2125
+3  2231 908 337
+3  1159 1840 1727
+3  1159 1728 337
+3  2232 724 2111
+3  2232 910 270
+3  1241 1916 1583
+3  1241 1584 270
+3  2233 876 2073
+3  2233 912 301
+3  1101 1804 1647
+3  1101 1648 301
+3  2234 776 2163
+3  2234 914 300
+3  1307 1975 1645
+3  1307 1646 300
+3  2235 880 2129
+3  2235 916 281
+3  1071 1784 1605
+3  1071 1606 281
+3  2236 674 2061
+3  2236 918 280
+3  1262 1936 1603
+3  1262 1604 280
+3  2237 968 2075
+3  2237 920 305
+3  1107 1808 1655
+3  1107 1656 305
+3  2238 720 2107
+3  2238 922 304
+3  1315 1983 1653
+3  1315 1654 304
+3  2239 868 2133
+3  2239 924 329
+3  1143 1832 1705
+3  1143 1706 329
+3  2240 764 2151
+3  2240 926 328
+3  1367 2030 1703
+3  1367 1704 328
+3  2241 952 2077
+3  2241 928 291
+3  1086 1794 1625
+3  1086 1626 291
+3  2242 766 2153
+3  2242 930 326
+3  1363 2026 1699
+3  1363 1700 326
+3  2243 864 2137
+3  2243 932 273
+3  1059 1776 1589
+3  1059 1590 273
+3  2244 680 2067
+3  2244 934 272
+3  1245 1920 1587
+3  1245 1588 272
+3  2245 984 2079
+3  2245 936 313
+3  1119 1816 1671
+3  1119 1672 313
+3  2246 712 2099
+3  2246 938 312
+3  1332 1999 1669
+3  1332 1670 312
+3  2247 892 2141
+3  2247 940 335
+3  1156 1838 1723
+3  1156 1724 335
+3  2248 770 2157
+3  2248 942 334
+3  1384 2044 1721
+3  1384 1722 334
+3  2249 972 2081
+3  2249 944 317
+3  1125 1820 1679
+3  1125 1680 317
+3  2250 774 2161
+3  2250 946 316
+3  1341 2007 1677
+3  1341 1678 316
+3  2437 2449 1709
+3  2437 1710 2424
+3  2251 900 2083
+3  2251 948 319
+3  1128 1822 1685
+3  1128 1686 319
+3  2420 2425 1683
+3  2420 1684 2421
+3  2252 904 2147
+3  2252 950 293
+3  1089 1796 1629
+3  1089 1630 293
+3  2253 690 2077
+3  2253 952 292
+3  1288 1960 1627
+3  1288 1628 292
+3  2254 964 2085
+3  2254 954 323
+3  1134 1826 1693
+3  1134 1694 323
+3  2255 732 2119
+3  2255 956 322
+3  1354 2018 1691
+3  1354 1692 322
+3  2256 926 2151
+3  2256 958 327
+3  1140 1830 1701
+3  1140 1702 327
+3  2257 716 2103
+3  2257 960 264
+3  1228 1904 1569
+3  1228 1570 264
+3  2258 860 2087
+3  2258 962 309
+3  1113 1812 1663
+3  1113 1664 309
+3  2259 698 2085
+3  2259 964 324
+3  1359 2022 1695
+3  1359 1696 324
+3  2260 896 2155
+3  2260 966 307
+3  1110 1810 1659
+3  1110 1660 307
+3  2261 688 2075
+3  2261 968 306
+3  1320 1987 1657
+3  1320 1658 306
+3  2262 872 2089
+3  2262 970 277
+3  1065 1780 1597
+3  1065 1598 277
+3  2263 694 2081
+3  2263 972 318
+3  1345 2011 1681
+3  1345 1682 318
+3  2264 778 2165
+3  2264 974 266
+3  1234 1909 1575
+3  1234 1576 266
+3  2265 942 2157
+3  2265 976 333
+3  1153 1836 1719
+3  1153 1720 333
+3  2266 728 2115
+3  2266 978 268
+3  1237 1912 1579
+3  1237 1580 268
+3  2267 884 2091
+3  2267 980 339
+3  1162 1842 1731
+3  1162 1732 339
+3  2441 2429 1713
+3  2441 1714 2440
+3  2268 946 2161
+3  2268 982 315
+3  1122 1818 1675
+3  1122 1676 315
+3  2269 692 2079
+3  2269 984 314
+3  1337 2003 1673
+3  1337 1674 314
+3  2270 856 2093
+3  2270 986 289
+3  1083 1792 1621
+3  1083 1622 289
+3  2271 684 2071
+3  2271 988 298
+3  1302 1971 1641
+3  1302 1642 298
+3  2272 974 2165
+3  2272 990 265
+3  1047 1768 1573
+3  1047 1574 265
+3  2273 772 2159
+3  2273 992 332
+3  1381 2041 1717
+3  1381 1718 332
+3  2274 888 2095
+3  2274 994 285
+3  1077 1788 1613
+3  1077 1614 285
+3  2275 1041 2302
+3  2275 996 539
+3  1170 1849 1441
+3  1170 1930 539
+3  786 2170 2101
+3  786 2102 458
+3  713 1442 1441
+3  713 1849 458
+3  2276 1103 2305
+3  2276 999 547
+3  1174 1853 1445
+3  1174 1938 547
+3  790 2172 2105
+3  790 2106 462
+3  717 1446 1445
+3  717 1853 462
+3  2277 1052 2309
+3  2277 1002 555
+3  1178 1857 1449
+3  1178 1946 555
+3  794 2174 2109
+3  794 2110 466
+3  721 1450 1449
+3  721 1857 466
+3  2278 1049 2295
+3  2278 1005 563
+3  1182 1861 1453
+3  1182 1954 563
+3  798 2176 2113
+3  798 2114 470
+3  725 1454 1453
+3  725 1861 470
+3  2279 1115 2298
+3  2279 1008 531
+3  1166 1845 1437
+3  1166 1922 531
+3  782 2168 2097
+3  782 2098 454
+3  709 1438 1437
+3  709 1845 454
+3  2280 1044 2318
+3  2280 1011 578
+3  1191 1869 1461
+3  1191 1969 578
+3  806 2180 2121
+3  806 2122 478
+3  733 1462 1461
+3  733 1869 478
+3  2281 1158 2321
+3  2281 1014 583
+3  1195 1873 1463
+3  1195 1973 583
+3  810 2182 2123
+3  810 2124 482
+3  735 1464 1463
+3  735 1873 482
+3  2282 1070 2324
+3  2282 1017 591
+3  1199 1877 1467
+3  1199 1981 591
+3  814 2184 2127
+3  814 2128 486
+3  739 1468 1467
+3  739 1877 486
+3  2283 1142 2313
+3  2283 1020 599
+3  1203 1881 1471
+3  1203 1989 599
+3  818 2186 2131
+3  818 2132 490
+3  743 1472 1471
+3  743 1881 490
+3  2284 1130 2316
+3  2284 1023 571
+3  1187 1865 1457
+3  1187 1962 571
+3  802 2178 2117
+3  802 2118 474
+3  729 1458 1457
+3  729 1865 474
+3  2285 1155 2333
+3  2285 1026 615
+3  1212 1889 1479
+3  1212 2005 615
+3  826 2190 2139
+3  826 2140 498
+3  751 1480 1479
+3  751 1889 498
+3  2286 1145 2335
+3  2286 1029 622
+3  1216 1893 1483
+3  1216 2012 622
+3  830 2192 2143
+3  830 2144 502
+3  755 1484 1483
+3  755 1893 502
+3  2287 1088 2338
+3  2287 1032 627
+3  1220 1897 1485
+3  1220 2016 627
+3  834 2194 2145
+3  834 2146 506
+3  757 1486 1485
+3  757 1897 506
+3  2288 1139 2327
+3  2288 1035 635
+3  1224 1901 1489
+3  1224 2024 635
+3  838 2196 2149
+3  838 2150 510
+3  761 1490 1489
+3  761 1901 510
+3  2289 1058 2330
+3  2289 1038 607
+3  1208 1885 1475
+3  1208 1997 607
+3  822 2188 2135
+3  822 2136 494
+3  747 1476 1475
+3  747 1885 494
+3  2290 1067 2302
+3  2290 1041 543
+3  1255 1929 1443
+3  1255 1934 543
+3  866 2210 2103
+3  866 2104 538
+3  715 1444 1443
+3  715 1929 538
+3  2291 1094 2318
+3  2291 1044 580
+3  34 33 2422
+3  2422 2417 580
+3  2292 1076 2307
+3  2292 1046 670
+3  1393 2053 1505
+3  1393 2058 670
+3  990 2272 2165
+3  990 2166 665
+3  777 1506 1505
+3  777 2053 665
+3  2293 1055 2295
+3  2293 1049 567
+3  1281 1953 1455
+3  1281 1958 567
+3  890 2222 2115
+3  890 2116 562
+3  727 1456 1455
+3  727 1953 562
+3  2294 1079 2309
+3  2294 1052 559
+3  1272 1945 1451
+3  1272 1950 559
+3  882 2218 2111
+3  882 2112 554
+3  723 1452 1451
+3  723 1945 554
+3  2296 1005 2295
+3  2296 1055 471
+3  1285 1957 1407
+3  1285 1862 471
+3  894 2224 2067
+3  894 2068 566
+3  679 1408 1407
+3  679 1957 566
+3  2297 1118 2330
+3  2297 1058 611
+3  1329 1996 1477
+3  1329 2001 611
+3  932 2243 2137
+3  932 2138 606
+3  749 1478 1477
+3  749 1996 606
+3  2299 1008 2298
+3  2299 1061 455
+3  1251 1925 1399
+3  1251 1846 455
+3  862 2208 2059
+3  862 2060 534
+3  671 1400 1399
+3  671 1925 534
+3  2301 1136 2300
+3  2301 1064 515
+3  1372 2035 1429
+3  1372 1906 515
+3  970 2262 2089
+3  970 2090 646
+3  701 1430 1429
+3  701 2035 646
+3  2303 996 2302
+3  2303 1067 459
+3  1259 1933 1401
+3  1259 1850 459
+3  870 2212 2061
+3  870 2062 542
+3  673 1402 1401
+3  673 1933 542
+3  2304 1106 2324
+3  2304 1070 595
+3  1312 1980 1469
+3  1312 1985 595
+3  916 2235 2129
+3  916 2130 590
+3  741 1470 1469
+3  741 1980 590
+3  2306 999 2305
+3  2306 1073 463
+3  1268 1941 1403
+3  1268 1854 463
+3  878 2216 2063
+3  878 2064 550
+3  675 1404 1403
+3  675 1941 550
+3  2308 1097 2307
+3  2308 1076 527
+3  1397 2057 1435
+3  1397 1918 527
+3  994 2274 2095
+3  994 2096 669
+3  707 1436 1435
+3  707 2057 669
+3  2310 1002 2309
+3  2310 1079 467
+3  1277 1949 1405
+3  1277 1858 467
+3  886 2220 2065
+3  886 2066 558
+3  677 1406 1405
+3  677 1949 558
+3  2312 1149 2311
+3  2312 1082 523
+3  1389 2049 1433
+3  1389 1914 523
+3  986 2270 2093
+3  986 2094 661
+3  705 1434 1433
+3  705 2049 661
+3  2314 1020 2313
+3  2314 1085 491
+3  1325 1992 1417
+3  1325 1882 491
+3  928 2241 2077
+3  928 2078 602
+3  689 1418 1417
+3  689 1992 602
+3  2315 1133 2338
+3  2315 1088 631
+3  1351 2015 1487
+3  1351 2020 631
+3  950 2252 2147
+3  950 2148 626
+3  759 1488 1487
+3  759 2015 626
+3  2317 1023 2316
+3  2317 1091 475
+3  1294 1965 1409
+3  1294 1866 475
+3  902 2228 2069
+3  902 2070 574
+3  681 1410 1409
+3  681 1965 574
+3  2319 1011 2318
+3  2319 1094 479
+3  1300 1970 1411
+3  1300 1870 479
+3  906 2230 2071
+3  906 2072 579
+3  683 1412 1411
+3  683 1970 579
+3  2320 1046 2307
+3  2320 1097 666
+3  1242 1917 1503
+3  1242 2054 666
+3  854 2204 2163
+3  854 2164 526
+3  775 1504 1503
+3  775 1917 526
+3  2322 1014 2321
+3  2322 1100 483
+3  1308 1976 1413
+3  1308 1874 483
+3  912 2233 2073
+3  912 2074 586
+3  685 1414 1413
+3  685 1976 586
+3  2323 1073 2305
+3  2323 1103 551
+3  1263 1937 1447
+3  1263 1942 551
+3  874 2214 2107
+3  874 2108 546
+3  719 1448 1447
+3  719 1937 546
+3  2325 1017 2324
+3  2325 1106 487
+3  1316 1984 1415
+3  1316 1878 487
+3  920 2237 2075
+3  920 2076 594
+3  687 1416 1415
+3  687 1984 594
+3  2326 1064 2300
+3  2326 1109 647
+3  1368 2031 1495
+3  1368 2036 647
+3  966 2260 2155
+3  966 2156 642
+3  767 1496 1495
+3  767 2031 642
+3  2328 1035 2327
+3  2328 1112 511
+3  1364 2027 1427
+3  1364 1902 511
+3  962 2258 2087
+3  962 2088 638
+3  699 1428 1427
+3  699 2027 638
+3  2329 1061 2298
+3  2329 1115 535
+3  1246 1921 1439
+3  1246 1926 535
+3  858 2206 2099
+3  858 2100 530
+3  711 1440 1439
+3  711 1921 530
+3  2331 1038 2330
+3  2331 1118 495
+3  1333 2000 1419
+3  1333 1886 495
+3  936 2245 2079
+3  936 2080 610
+3  691 1420 1419
+3  691 2000 610
+3  2332 1082 2311
+3  2332 1121 662
+3  1385 2045 1501
+3  1385 2050 662
+3  982 2268 2161
+3  982 2162 657
+3  773 1502 1501
+3  773 2045 657
+3  2334 1026 2333
+3  2334 1124 499
+3  1342 2008 1421
+3  1342 1890 499
+3  944 2249 2081
+3  944 2082 618
+3  693 1422 1421
+3  693 2008 618
+3  2336 1029 2335
+3  2336 1127 503
+3  1349 2013 1423
+3  1349 1894 503
+3  948 2251 2083
+3  948 2084 623
+3  695 1424 1423
+3  695 2013 623
+3  2337 1091 2316
+3  2337 1130 575
+3  1289 1961 1459
+3  1289 1966 575
+3  898 2226 2119
+3  898 2120 570
+3  731 1460 1459
+3  731 1961 570
+3  2339 1032 2338
+3  2339 1133 507
+3  1355 2019 1425
+3  1355 1898 507
+3  954 2254 2085
+3  954 2086 630
+3  697 1426 1425
+3  697 2019 630
+3  2340 1109 2300
+3  2340 1136 643
+3  1229 1905 1493
+3  1229 2032 643
+3  842 2198 2153
+3  842 2154 514
+3  765 1494 1493
+3  765 1905 514
+3  2341 1112 2327
+3  2341 1139 639
+3  1360 2023 1491
+3  1360 2028 639
+3  958 2256 2151
+3  958 2152 634
+3  763 1492 1491
+3  763 2023 634
+3  2342 1085 2313
+3  2342 1142 603
+3  1321 1988 1473
+3  1321 1993 603
+3  924 2239 2133
+3  924 2134 598
+3  745 1474 1473
+3  745 1988 598
+3  2343 1127 2335
+3  2343 1145 624
+3  93 92 2418
+3  2418 2423 624
+3  2344 1152 2349
+3  2344 1147 651
+3  153 152 2438
+3  2438 2439 651
+3  2345 1121 2311
+3  2345 1149 658
+3  1238 1913 1499
+3  1238 2046 658
+3  850 2202 2159
+3  850 2160 522
+3  771 1500 1499
+3  771 1913 522
+3  2346 1161 2349
+3  2346 1152 655
+3  1378 2039 1497
+3  1378 2043 655
+3  976 2265 2157
+3  976 2158 650
+3  769 1498 1497
+3  769 2039 650
+3  2347 1124 2333
+3  2347 1155 619
+3  1338 2004 1481
+3  1338 2009 619
+3  940 2247 2141
+3  940 2142 614
+3  753 1482 1481
+3  753 2004 614
+3  2348 1100 2321
+3  2348 1158 587
+3  1303 1972 1465
+3  1303 1977 587
+3  908 2231 2125
+3  908 2126 582
+3  737 1466 1465
+3  737 1972 582
+3  2350 1147 2349
+3  2350 1161 519
+3  1382 2042 1431
+3  1382 1910 519
+3  980 2267 2091
+3  980 2092 654
+3  703 1432 1431
+3  703 2042 654
+3  2352 2353 2351
+3  2352 1164 457
+3  1180 1859 1513
+3  1180 1848 457
+3  796 2175 2101
+3  796 2170 468
+3  785 1514 1513
+3  785 1859 468
+3  1008 2279 2298
+3  1008 2299 350
+3  1060 1777 1523
+3  1060 1744 350
+3  714 2102 2101
+3  714 2175 384
+3  795 1524 1523
+3  795 1777 384
+3  2353 2354 2351
+3  2353 2352 461
+3  1163 1843 1517
+3  1163 1852 461
+3  780 2167 2105
+3  780 2172 452
+3  789 1518 1517
+3  789 1843 452
+3  996 2275 2302
+3  996 2303 342
+3  1066 1781 1507
+3  1066 1736 342
+3  718 2106 2105
+3  718 2167 388
+3  779 1508 1507
+3  779 1781 388
+3  2354 2355 2351
+3  2354 2353 465
+3  1168 1847 1521
+3  1168 1856 465
+3  784 2169 2109
+3  784 2174 456
+3  793 1522 1521
+3  793 1847 456
+3  999 2276 2305
+3  999 2306 344
+3  1072 1785 1511
+3  1072 1738 344
+3  722 2110 2109
+3  722 2169 392
+3  783 1512 1511
+3  783 1785 392
+3  2355 1164 2351
+3  2355 2354 469
+3  1172 1851 1525
+3  1172 1860 469
+3  788 2171 2113
+3  788 2176 460
+3  797 1526 1525
+3  797 1851 460
+3  1002 2277 2309
+3  1002 2310 346
+3  1078 1789 1515
+3  1078 1740 346
+3  726 2114 2113
+3  726 2171 396
+3  787 1516 1515
+3  787 1789 396
+3  1164 2352 2351
+3  1164 2355 453
+3  1176 1855 1509
+3  1176 1844 453
+3  792 2173 2097
+3  792 2168 464
+3  781 1510 1509
+3  781 1855 464
+3  1005 2278 2295
+3  1005 2296 348
+3  1054 1773 1519
+3  1054 1742 348
+3  710 2098 2097
+3  710 2173 380
+3  791 1520 1519
+3  791 1773 380
+3  2357 2358 2356
+3  2357 1185 477
+3  1201 1879 1533
+3  1201 1868 477
+3  816 2185 2121
+3  816 2180 488
+3  805 1534 1533
+3  805 1879 488
+3  1023 2284 2316
+3  1023 2317 360
+3  1090 1797 1543
+3  1090 1754 360
+3  734 2122 2121
+3  734 2185 404
+3  815 1544 1543
+3  815 1797 404
+3  2358 2359 2356
+3  2358 2357 481
+3  1184 1863 1537
+3  1184 1872 481
+3  800 2177 2123
+3  800 2182 472
+3  809 1538 1537
+3  809 1863 472
+3  1011 2280 2318
+3  1011 2319 352
+3  1093 1799 1527
+3  1093 1746 352
+3  736 2124 2123
+3  736 2177 406
+3  799 1528 1527
+3  799 1799 406
+3  2359 2360 2356
+3  2359 2358 485
+3  1189 1867 1541
+3  1189 1876 485
+3  804 2179 2127
+3  804 2184 476
+3  813 1542 1541
+3  813 1867 476
+3  1014 2281 2321
+3  1014 2322 354
+3  1099 1803 1531
+3  1099 1748 354
+3  740 2128 2127
+3  740 2179 410
+3  803 1532 1531
+3  803 1803 410
+3  2360 1185 2356
+3  2360 2359 489
+3  1193 1871 1545
+3  1193 1880 489
+3  808 2181 2131
+3  808 2186 480
+3  817 1546 1545
+3  817 1871 480
+3  1017 2282 2324
+3  1017 2325 356
+3  1105 1807 1535
+3  1105 1750 356
+3  744 2132 2131
+3  744 2181 414
+3  807 1536 1535
+3  807 1807 414
+3  1185 2357 2356
+3  1185 2360 473
+3  1197 1875 1529
+3  1197 1864 473
+3  812 2183 2117
+3  812 2178 484
+3  801 1530 1529
+3  801 1875 484
+3  1020 2283 2313
+3  1020 2314 358
+3  1084 1793 1539
+3  1084 1752 358
+3  730 2118 2117
+3  730 2183 400
+3  811 1540 1539
+3  811 1793 400
+3  2362 2363 2361
+3  2362 1206 497
+3  1222 1899 1553
+3  1222 1888 497
+3  836 2195 2139
+3  836 2190 508
+3  825 1554 1553
+3  825 1899 508
+3  1038 2289 2330
+3  1038 2331 370
+3  1117 1815 1563
+3  1117 1764 370
+3  752 2140 2139
+3  752 2195 422
+3  835 1564 1563
+3  835 1815 422
+3  2363 2364 2361
+3  2363 2362 501
+3  1205 1883 1557
+3  1205 1892 501
+3  820 2187 2143
+3  820 2192 492
+3  829 1558 1557
+3  829 1883 492
+3  1026 2285 2333
+3  1026 2334 362
+3  1123 1819 1547
+3  1123 1756 362
+3  756 2144 2143
+3  756 2187 426
+3  819 1548 1547
+3  819 1819 426
+3  2364 2365 2361
+3  2364 2363 505
+3  1210 1887 1561
+3  1210 1896 505
+3  824 2189 2145
+3  824 2194 496
+3  833 1562 1561
+3  833 1887 496
+3  1029 2286 2335
+3  1029 2336 364
+3  1126 1821 1551
+3  1126 1758 364
+3  758 2146 2145
+3  758 2189 428
+3  823 1552 1551
+3  823 1821 428
+3  2365 1206 2361
+3  2365 2364 509
+3  1214 1891 1565
+3  1214 1900 509
+3  828 2191 2149
+3  828 2196 500
+3  837 1566 1565
+3  837 1891 500
+3  1032 2287 2338
+3  1032 2339 366
+3  1132 1825 1555
+3  1132 1760 366
+3  762 2150 2149
+3  762 2191 432
+3  827 1556 1555
+3  827 1825 432
+3  1206 2362 2361
+3  1206 2365 493
+3  1218 1895 1549
+3  1218 1884 493
+3  832 2193 2135
+3  832 2188 504
+3  821 1550 1549
+3  821 1895 504
+3  1035 2288 2327
+3  1035 2328 368
+3  1111 1811 1559
+3  1111 1762 368
+3  748 2136 2135
+3  748 2193 418
+3  831 1560 1559
+3  831 1811 418
+3  2367 1249 2366
+3  2367 1227 537
+3  1362 2025 1595
+3  1362 1928 537
+3  960 2257 2103
+3  960 2210 636
+3  865 1596 1595
+3  865 2025 636
+3  1136 2340 2300
+3  1136 2301 435
+3  1063 1779 1697
+3  1063 1828 435
+3  716 2104 2103
+3  716 2257 386
+3  959 1698 1697
+3  959 1779 386
+3  2368 1292 2396
+3  2368 2397 577
+3  1347 2415 1635
+3  1347 1968 577
+3  2414 1636 1635
+3  2369 1301 2382
+3  2369 1233 664
+3  1375 2038 1729
+3  1375 2052 664
+3  974 2264 2165
+3  974 2272 649
+3  989 1730 1729
+3  989 2038 649
+3  1147 2344 2349
+3  1147 2350 441
+3  1160 1841 1711
+3  1160 2444 441
+3  778 2166 2165
+3  778 2264 450
+3  973 1712 1711
+3  973 1841 450
+3  2370 1275 2404
+3  2370 2405 561
+3  1379 2040 1619
+3  1379 1952 561
+3  978 2266 2115
+3  978 2222 652
+3  889 1620 1619
+3  889 2040 652
+3  1149 2345 2311
+3  1149 2312 443
+3  1081 1791 1715
+3  1081 1834 443
+3  728 2116 2115
+3  728 2266 398
+3  977 1716 1715
+3  977 1791 398
+3  2371 1266 2384
+3  2371 2385 553
+3  1305 1974 1611
+3  1305 1944 553
+3  910 2232 2111
+3  910 2218 584
+3  881 1612 1611
+3  881 1974 584
+3  1097 2320 2307
+3  1097 2308 409
+3  1075 1787 1643
+3  1075 1802 409
+3  724 2112 2111
+3  724 2232 394
+3  909 1644 1643
+3  909 1787 394
+3  2372 2378 2392
+3  2372 2391 565
+3  1331 1998 1623
+3  1331 1956 565
+3  934 2244 2067
+3  934 2224 608
+3  893 1624 1623
+3  893 1998 608
+3  1115 2329 2298
+3  1115 2279 421
+3  1007 1743 1667
+3  1007 1814 421
+3  680 2068 2067
+3  680 2244 349
+3  933 1668 1667
+3  933 1743 349
+3  2373 2390 2366
+3  2373 1249 605
+3  1253 1927 1665
+3  1253 1995 605
+3  864 2209 2137
+3  864 2243 536
+3  931 1666 1665
+3  931 1927 536
+3  1061 2299 2298
+3  1061 2329 385
+3  1114 1813 1593
+3  1114 1778 385
+3  750 2138 2137
+3  750 2209 420
+3  863 1594 1593
+3  863 1813 420
+3  1249 2373 2366
+3  1249 2367 533
+3  1226 1903 1591
+3  1226 1924 533
+3  840 2197 2059
+3  840 2208 512
+3  861 1592 1591
+3  861 1903 512
+3  1041 2290 2302
+3  1041 2275 372
+3  995 1735 1567
+3  995 1766 372
+3  672 2060 2059
+3  672 2197 341
+3  839 1568 1567
+3  839 1735 341
+3  2374 1319 2387
+3  2374 2375 645
+3  1261 1935 1707
+3  1261 2034 645
+3  872 2213 2089
+3  872 2262 544
+3  969 1708 1707
+3  969 1935 544
+3  1067 2303 2302
+3  1067 2290 389
+3  1040 1765 1601
+3  1040 1782 389
+3  702 2090 2089
+3  702 2213 371
+3  871 1602 1601
+3  871 1765 371
+3  2375 2374 2387
+3  2375 2386 541
+3  1314 1982 1599
+3  1314 1932 541
+3  918 2236 2061
+3  918 2212 592
+3  869 1600 1599
+3  869 1982 592
+3  1103 2323 2305
+3  1103 2276 413
+3  998 1737 1651
+3  998 1806 413
+3  674 2062 2061
+3  674 2236 343
+3  917 1652 1651
+3  917 1737 343
+3  2376 1306 2384
+3  2376 1266 589
+3  1270 1943 1649
+3  1270 1979 589
+3  880 2217 2129
+3  880 2235 552
+3  915 1650 1649
+3  915 1943 552
+3  1073 2306 2305
+3  1073 2323 393
+3  1102 1805 1609
+3  1102 1786 393
+3  742 2130 2129
+3  742 2217 412
+3  879 1610 1609
+3  879 1805 412
+3  1266 2376 2384
+3  1266 2371 549
+3  1240 1915 1607
+3  1240 1940 549
+3  852 2203 2063
+3  852 2216 524
+3  877 1608 1607
+3  877 1915 524
+3  1052 2294 2309
+3  1052 2277 379
+3  1001 1739 1581
+3  1001 1772 379
+3  676 2064 2063
+3  676 2203 345
+3  851 1582 1581
+3  851 1739 345
+3  2377 1380 2404
+3  2377 1275 668
+3  1279 1951 1733
+3  1279 2056 668
+3  888 2221 2095
+3  888 2274 560
+3  993 1734 1733
+3  993 1951 560
+3  1079 2310 2309
+3  1079 2294 397
+3  1051 1771 1617
+3  1051 1790 397
+3  708 2096 2095
+3  708 2221 378
+3  887 1618 1617
+3  887 1771 378
+3  1275 2377 2404
+3  1275 2370 557
+3  1236 1911 1615
+3  1236 1948 557
+3  848 2201 2065
+3  848 2220 520
+3  885 1616 1615
+3  885 1911 520
+3  1049 2293 2295
+3  1049 2278 377
+3  1004 1741 1577
+3  1004 1770 377
+3  678 2066 2065
+3  678 2201 347
+3  847 1578 1577
+3  847 1741 347
+3  2378 1336 2392
+3  2378 2372 660
+3  1244 1919 1725
+3  1244 2048 660
+3  856 2205 2093
+3  856 2270 528
+3  985 1726 1725
+3  985 1919 528
+3  1055 2296 2295
+3  1055 2293 381
+3  1048 1769 1585
+3  1048 1774 381
+3  706 2094 2093
+3  706 2205 376
+3  855 1586 1585
+3  855 1769 376
+3  2379 2389 2399
+3  2379 2398 601
+3  1353 2017 1661
+3  1353 1991 601
+3  952 2253 2077
+3  952 2241 628
+3  927 1662 1661
+3  927 2017 628
+3  1130 2337 2316
+3  1130 2284 431
+3  1022 1753 1689
+3  1022 1824 431
+3  690 2078 2077
+3  690 2253 359
+3  951 1690 1689
+3  951 1753 359
+3  2380 1348 2396
+3  2380 1292 625
+3  1296 1967 1687
+3  1296 2014 625
+3  904 2229 2147
+3  904 2252 576
+3  949 1688 1687
+3  949 1967 576
+3  1091 2317 2316
+3  1091 2337 405
+3  1129 1823 1633
+3  1129 1798 405
+3  760 2148 2147
+3  760 2229 430
+3  903 1634 1633
+3  903 1823 430
+3  1292 2380 2396
+3  1292 2368 573
+3  1231 1907 1631
+3  1231 1964 573
+3  844 2199 2069
+3  844 2228 516
+3  901 1632 1631
+3  901 1907 516
+3  1044 2291 2318
+3  1044 2280 373
+3  1010 1745 1571
+3  1010 2452 373
+3  682 2070 2069
+3  682 2199 351
+3  843 1572 1571
+3  843 1745 351
+3  2381 1233 2382
+3  2381 2383 2406
+3  2434 0 2406
+3  1094 2319 2318
+3  1094 2291 407
+3  1043 2427 1639
+3  1043 1800 407
+3  2448 1640 1639
+3  24 23 2427
+3  2383 2381 2382
+3  2383 1301 2433
+3  1391 2051 1637
+3  1391 2432 2433
+3  988 2271 2071
+3  988 2230 663
+3  905 1638 1637
+3  905 2051 663
+3  1158 2348 2321
+3  1158 2281 449
+3  1013 1747 1727
+3  1013 1840 449
+3  684 2072 2071
+3  684 2271 353
+3  987 1728 1727
+3  987 1747 353
+3  2385 2371 2384
+3  2385 1306 525
+3  1310 1978 1583
+3  1310 1916 525
+3  914 2234 2163
+3  914 2204 588
+3  853 1584 1583
+3  853 1978 588
+3  1100 2322 2321
+3  1100 2348 411
+3  1157 1839 1647
+3  1157 1804 411
+3  776 2164 2163
+3  776 2234 448
+3  913 1648 1647
+3  913 1839 448
+3  1306 2385 2384
+3  1306 2376 585
+3  1265 1939 1645
+3  1265 1975 585
+3  876 2215 2073
+3  876 2233 548
+3  911 1646 1645
+3  911 1939 548
+3  1070 2304 2324
+3  1070 2282 391
+3  1016 1749 1605
+3  1016 1784 391
+3  686 2074 2073
+3  686 2215 355
+3  875 1606 1605
+3  875 1749 355
+3  2386 2375 2387
+3  2386 2388 545
+3  1318 1986 1603
+3  1318 1936 545
+3  922 2238 2107
+3  922 2214 596
+3  873 1604 1603
+3  873 1986 596
+3  1106 2325 2324
+3  1106 2304 415
+3  1069 1783 1655
+3  1069 1808 415
+3  720 2108 2107
+3  720 2238 390
+3  921 1656 1655
+3  921 1783 390
+3  2388 2386 2387
+3  2388 1319 593
+3  1370 2033 1653
+3  1370 1983 593
+3  968 2261 2075
+3  968 2237 644
+3  919 1654 1653
+3  919 2033 644
+3  1142 2342 2313
+3  1142 2283 439
+3  1019 1751 1705
+3  1019 1832 439
+3  688 2076 2075
+3  688 2261 357
+3  967 1706 1705
+3  967 1751 357
+3  2389 1358 2399
+3  2389 2379 641
+3  1287 1959 1703
+3  1287 2030 641
+3  896 2225 2155
+3  896 2260 568
+3  965 1704 1703
+3  965 1959 568
+3  1085 2314 2313
+3  1085 2342 401
+3  1141 1831 1625
+3  1141 1794 401
+3  768 2156 2155
+3  768 2225 438
+3  895 1626 1625
+3  895 1831 438
+3  2390 1227 2366
+3  2390 2373 637
+3  1248 1923 1699
+3  1248 2026 637
+3  860 2207 2087
+3  860 2258 532
+3  961 1700 1699
+3  961 1923 532
+3  1058 2297 2330
+3  1058 2289 383
+3  1037 1763 1589
+3  1037 1776 383
+3  700 2088 2087
+3  700 2207 369
+3  859 1590 1589
+3  859 1763 369
+3  2391 2372 2392
+3  2391 2393 529
+3  1335 2002 1587
+3  1335 1920 529
+3  938 2246 2099
+3  938 2206 612
+3  857 1588 1587
+3  857 2002 612
+3  1118 2331 2330
+3  1118 2297 423
+3  1057 1775 1671
+3  1057 1816 423
+3  712 2100 2099
+3  712 2246 382
+3  937 1672 1671
+3  937 1775 382
+3  2393 2391 2392
+3  2393 1336 609
+3  1387 2047 1669
+3  1387 1999 609
+3  984 2269 2079
+3  984 2245 659
+3  935 1670 1669
+3  935 2047 659
+3  1155 2347 2333
+3  1155 2285 447
+3  1025 1755 1723
+3  1025 1838 447
+3  692 2080 2079
+3  692 2269 361
+3  983 1724 1723
+3  983 1755 361
+3  2394 1377 2402
+3  2394 2395 656
+3  1344 2010 1721
+3  1344 2044 656
+3  946 2250 2161
+3  946 2268 620
+3  981 1722 1721
+3  981 2010 620
+3  1124 2334 2333
+3  1124 2347 427
+3  1154 1837 1679
+3  1154 1820 427
+3  774 2162 2161
+3  774 2250 446
+3  945 1680 1679
+3  945 1837 446
+3  2395 2394 2402
+3  2395 2401 617
+3  1374 2037 1677
+3  1374 2007 617
+3  972 2263 2081
+3  972 2249 648
+3  943 1678 1677
+3  943 2037 648
+3  1145 2343 2335
+3  1145 2286 440
+3  1028 1757 1709
+3  1028 2449 440
+3  694 2082 2081
+3  694 2263 363
+3  971 1710 1709
+3  971 1757 363
+3  2397 2368 2396
+3  2397 1348 2411
+3  60 59 2411
+3  1127 2336 2335
+3  1127 2343 429
+3  1144 2446 1685
+3  1144 1822 429
+3  2445 1686 1685
+3  2446 83 82
+3  1348 2397 2396
+3  1348 2380 2426
+3  1291 1963 1683
+3  1291 2425 2426
+3  900 2227 2083
+3  900 2251 572
+3  947 1684 1683
+3  947 1963 572
+3  1088 2315 2338
+3  1088 2287 403
+3  1031 1759 1629
+3  1031 1796 403
+3  696 2084 2083
+3  696 2227 365
+3  899 1630 1629
+3  899 1759 365
+3  2398 2379 2399
+3  2398 2400 569
+3  1357 2021 1627
+3  1357 1960 569
+3  956 2255 2119
+3  956 2226 632
+3  897 1628 1627
+3  897 2021 632
+3  1133 2339 2338
+3  1133 2315 433
+3  1087 1795 1693
+3  1087 1826 433
+3  732 2120 2119
+3  732 2255 402
+3  955 1694 1693
+3  955 1795 402
+3  2400 2398 2399
+3  2400 1358 629
+3  1366 2029 1691
+3  1366 2018 629
+3  964 2259 2085
+3  964 2254 640
+3  953 1692 1691
+3  953 2029 640
+3  1139 2341 2327
+3  1139 2288 437
+3  1034 1761 1701
+3  1034 1830 437
+3  698 2086 2085
+3  698 2259 367
+3  963 1702 1701
+3  963 1761 367
+3  1227 2367 2366
+3  1227 2390 513
+3  1327 1994 1569
+3  1327 1904 513
+3  930 2242 2153
+3  930 2198 604
+3  841 1570 1569
+3  841 1994 604
+3  1112 2328 2327
+3  1112 2341 419
+3  1138 1829 1663
+3  1138 1812 419
+3  766 2154 2153
+3  766 2242 436
+3  929 1664 1663
+3  929 1829 436
+3  1358 2400 2399
+3  1358 2389 633
+3  1323 1990 1695
+3  1323 2022 633
+3  926 2240 2151
+3  926 2256 600
+3  957 1696 1695
+3  957 1990 600
+3  1109 2326 2300
+3  1109 2340 417
+3  1135 1827 1659
+3  1135 1810 417
+3  764 2152 2151
+3  764 2240 434
+3  925 1660 1659
+3  925 1827 434
+3  1319 2388 2387
+3  1319 2374 597
+3  1257 1931 1657
+3  1257 1987 597
+3  868 2211 2133
+3  868 2239 540
+3  923 1658 1657
+3  923 1931 540
+3  1064 2301 2300
+3  1064 2326 387
+3  1108 1809 1597
+3  1108 1780 387
+3  746 2134 2133
+3  746 2211 416
+3  867 1598 1597
+3  867 1809 416
+3  2401 2395 2402
+3  2401 2403 621
+3  1376 2413 1681
+3  1376 2011 621
+3  2412 1682 1681
+3  112 111 2412
+3  1233 2369 2382
+3  1233 2381 518
+3  1299 2436 1575
+3  1299 1909 518
+3  2435 1576 1575
+3  172 171 2435
+3  2403 2401 2402
+3  2403 1377 2430
+3  119 118 2430
+3  1152 2346 2349
+3  1152 2344 445
+3  1146 2451 1719
+3  1146 1836 445
+3  2447 1720 1719
+3  2451 143 142
+3  2405 2370 2404
+3  2405 1380 521
+3  1395 2055 1579
+3  1395 1912 521
+3  992 2273 2159
+3  992 2202 667
+3  849 1580 1579
+3  849 2055 667
+3  1161 2350 2349
+3  1161 2346 451
+3  1151 1835 1731
+3  1151 1842 451
+3  772 2160 2159
+3  772 2273 444
+3  991 1732 1731
+3  991 1835 444
+3  1377 2403 2402
+3  1377 2394 2428
+3  1340 2006 1713
+3  1340 2429 2428
+3  942 2248 2157
+3  942 2265 616
+3  975 1714 1713
+3  975 2006 616
+3  1121 2332 2311
+3  1121 2345 425
+3  1148 1833 1675
+3  1148 1818 425
+3  770 2158 2157
+3  770 2248 442
+3  941 1676 1675
+3  941 1833 442
+3  1336 2393 2392
+3  1336 2378 613
+3  1283 1955 1673
+3  1283 2003 613
+3  892 2223 2141
+3  892 2247 564
+3  939 1674 1673
+3  939 1955 564
+3  1082 2312 2311
+3  1082 2332 399
+3  1120 1817 1621
+3  1120 1792 399
+3  754 2142 2141
+3  754 2223 424
+3  891 1622 1621
+3  891 1817 424
+3  1301 2383 2382
+3  1301 2369 581
+3  1232 1908 1641
+3  1232 1971 581
+3  846 2200 2125
+3  846 2231 517
+3  907 1642 1641
+3  907 1908 517
+3  1046 2292 2307
+3  1046 2320 375
+3  1096 1801 1573
+3  1096 1768 375
+3  738 2126 2125
+3  738 2200 408
+3  845 1574 1573
+3  845 1801 408
+3  1380 2405 2404
+3  1380 2377 653
+3  1274 1947 1717
+3  1274 2041 653
+3  884 2219 2091
+3  884 2267 556
+3  979 1718 1717
+3  979 1947 556
+3  1076 2308 2307
+3  1076 2292 395
+3  1045 1767 1613
+3  1045 1788 395
+3  704 2092 2091
+3  704 2219 374
+3  883 1614 1613
+3  883 1767 374
+3  70 69 2425
+3  71 70 2425
+3  2420 71 2425
+3  2412 109 108
+3  2412 110 109
+3  2424 108 107
+3  2424 2412 108
+3  2453 45 44
+3  2453 43 42
+3  2453 44 43
+3  11 10 2432
+3  12 11 2432
+3  2410 12 2432
+3  2407 2414 49
+3  50 49 2414
+3  51 50 2414
+3  2411 2408 61
+3  61 60 2411
+3  1 178 2406
+3  0 1 2406
+3  2436 2406 176
+3  177 176 2406
+3  178 177 2406
+3  2407 47 46
+3  2407 48 47
+3  174 2436 175
+3  2409 36 35
+3  2409 37 36
+3  2412 111 110
+3  2438 2443 154
+3  154 153 2438
+3  61 2408 62
+3  2452 39 2409
+3  2409 39 38
+3  2452 40 39
+3  2452 41 40
+3  2418 2442 94
+3  94 93 2418
+3  15 14 2410
+3  2419 16 2410
+3  16 15 2410
+3  137 2440 138
+3  136 2440 137
+3  2434 2433 4
+3  6 5 2433
+3  2430 116 2413
+3  2430 118 117
+3  2413 116 115
+3  2430 117 116
+3  2428 123 2416
+3  2428 124 123
+3  2428 125 124
+3  2411 57 2415
+3  2411 59 58
+3  2415 57 56
+3  2411 58 57
+3  2421 77 76
+3  2421 78 77
+3  2442 97 96
+3  2412 2413 112
+3  113 112 2413
+3  114 113 2413
+3  2415 53 2414
+3  2414 53 52
+3  2415 54 53
+3  2415 55 54
+3  2426 63 2408
+3  2426 64 63
+3  2426 65 64
+3  26 2417 27
+3  26 25 2427
+3  2417 26 2427
+3  2445 80 79
+3  2445 81 80
+3  2445 82 81
+3  121 2416 122
+3  120 2416 121
+3  29 2417 30
+3  28 2417 29
+3  2418 89 2423
+3  2418 90 89
+3  2418 91 90
+3  2418 92 91
+3  2422 30 2417
+3  2422 31 30
+3  2422 32 31
+3  2422 33 32
+3  2419 18 17
+3  2419 19 18
+3  22 2448 23
+3  21 2448 22
+3  20 2448 21
+3  84 83 2446
+3  2423 85 2446
+3  85 84 2446
+3  2416 123 122
+3  74 73 2420
+3  2421 75 2420
+3  2420 75 74
+3  2421 76 75
+3  2442 2449 98
+3  99 98 2449
+3  100 99 2449
+3  2422 2409 35
+3  35 34 2422
+3  88 2423 89
+3  87 2423 88
+3  145 2439 146
+3  2439 145 2451
+3  145 144 2451
+3  166 2431 167
+3  165 2431 166
+3  106 2424 107
+3  105 2424 106
+3  67 2425 68
+3  67 66 2426
+3  2425 67 2426
+3  2448 2427 23
+3  163 2450 164
+3  161 2450 162
+3  162 2450 163
+3  127 2429 128
+3  127 126 2428
+3  2429 127 2428
+3  131 2441 132
+3  2441 131 2429
+3  131 130 2429
+3  2430 2416 120
+3  120 119 2430
+3  168 2435 169
+3  170 169 2435
+3  2435 168 2431
+3  7 6 2433
+3  8 7 2433
+3  2432 8 2433
+3  2437 2424 105
+3  2434 2 0
+3  2434 3 2
+3  2435 2436 172
+3  174 173 2436
+3  173 172 2436
+3  2444 2450 161
+3  2437 104 103
+3  2437 102 101
+3  2437 103 102
+3  155 2443 156
+3  154 2443 155
+3  2438 149 2439
+3  2438 152 151
+3  2438 150 149
+3  2438 151 150
+3  148 2439 149
+3  147 2439 148
+3  134 133 2441
+3  2440 135 2441
+3  135 134 2441
+3  2442 95 94
+3  2442 96 95
+3  2444 158 2443
+3  2444 160 159
+3  2443 158 157
+3  2444 159 158
+3  141 2447 142
+3  140 2447 141
+3  139 2447 140
+3  2445 78 2421
+3  2409 38 37
+3  156 2443 157
+3  2417 28 27
+3  2446 82 2445
+3  86 2423 87
+3  2440 2447 138
+3  55 2415 56
+3  170 2435 171
+3  2448 19 2419
+3  101 100 2449
+3  2410 14 13
+3  62 2408 63
+3  9 2432 10
+3  3 2434 4
+3  2420 73 72
+3  2429 129 128
+3  2450 2431 165
+3  146 2439 147
+3  2413 115 114
+3  2451 142 2447
+3  132 2441 133
+3  2452 2453 42
+3  2453 2407 46
+3  2414 52 51
+3  2425 69 68
 
diff --git a/Data/data/meshes/polyhedral_complex_of_spheres/Sphere3.off b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere3.off
index b4e2b64032a0..640688f43296 100644
--- a/Data/data/meshes/polyhedral_complex_of_spheres/Sphere3.off
+++ b/Data/data/meshes/polyhedral_complex_of_spheres/Sphere3.off
@@ -1,6735 +1,6731 @@
-NOFF
-2329 4402 0
+OFF
+2329 4398 0
 
-1.2000000000000002 -0.22426888788086641 0.85065080835203988  7.984805159532336e-16 0.52573111211913326 0.8506508083520401
-1.2 -0.22426888788086652 -0.8506508083520401  1.7011106644221067e-16 0.52573111211913259 -0.85065080835204054
-1.2000000000000002 -1.2757311121191335 0.85065080835203988  -7.6376397178135386e-17 -0.52573111211913293 0.85065080835204032
-1.2 -1.2757311121191335 -0.85065080835203988  -1.7358272085939859e-17 -0.52573111211913315 -0.8506508083520401
-1.7257311121191339 0.10065080835203966 2.4513010918904203e-18  0.52573111211913393 0.85065080835203966 -3.4369378730160925e-16
-1.7257311121191339 -1.6006508083520399 -2.4513010918904203e-18  0.52573111211913248 -0.85065080835204054 2.1524257386565428e-16
-0.59214384399202546 -0.3881595429818786 0.70538094374692573  -0.60285708655996961 0.35990150486609074 0.7120633679522832
-0.67426888788086625 -1.6006508083520399 1.2256505459452107e-18  -0.52573111211913282 -0.85065080835204032 1.388661766875189e-17
-2.0506508083520396 -0.75000000000000011 0.52573111211913359  0.85065080835204054 1.2332864728485448e-16 0.52573111211913259
-2.0506508083520396 -0.75 -0.52573111211913359  0.85065080835203988 3.4716544171879717e-16 -0.5257311121191337
-0.58303192413334481 -0.40257317574481138 0.70495163176324016  -0.60285708655996884 0.35990150486609146 0.71206336795228342
-0.63268818151834738 -0.32335420881895094 0.70294074606773105  -0.5606579325259814 0.42546670457134944 0.71038071904922107
-1.5568220897730902 -0.75 0.93417235896271555  0.35722126167557472 6.9462727286247402e-18 0.93401979112163924
-1.7773502691896259 -0.17264973081037449 0.57735026918962595  0.57739733617063294 0.57762605998672589 0.5770272532621562
-1.2 0.18417235896271567 0.35682208977308999  7.6061686378440902e-16 0.93401979112163913 0.35722126167557494
-0.62443505191569892 -0.33636614204180326 0.70422028778974766  -0.5606579325259835 0.42546670457134278 0.7103807190492234
-0.84317791022691035 -0.75 0.93417235896271589  -0.35662245495100625 -0.00037008290847543424 0.93424851493773242
-1.55682208977309 -0.74999999999999989 -0.93417235896271567  0.35722126167557505 2.5006581823049062e-16 -0.93401979112163913
-0.84317791022691035 -0.75 -0.93417235896271567  -0.35722126167557405 -1.1114036365799584e-16 -0.93401979112163958
-0.5493198212532957 -0.45674068614295493 0.69911600851089584  -0.64093662140152596 0.29301330949339005 0.70946701671475032
-1.2000000000000002 0.18417235896271567 -0.35682208977308999  0.00037008290847612011 0.93424851493773231 -0.35662245495100636
-1.7773502691896261 -0.17264973081037449 -0.57735026918962551  0.57739733617063238 0.57762605998672589 -0.57702725326215654
-1.7773502691896264 -1.3273502691896253 0.57735026918962551  0.57702725326215831 -0.57739733617063227 0.57762605998672423
-1.2000000000000002 -1.6841723589627158 0.3568220897730901  -0.00037008290847335556 -0.93424851493773231 0.35662245495100653
-1.2000000000000002 -1.6841723589627158 -0.3568220897730901  2.6048522732342782e-16 -0.93401979112164046 -0.35722126167557183
-1.7773502691896259 -1.3273502691896257 -0.57735026918962551  0.57739733617063216 -0.57762605998672556 -0.5770272532621572
-2.134172358962716 -1.1068220897730896 1.2321651268072106e-18  0.93424851493773209 -0.35662245495100681 0.00037008290847519973
-2.1341723589627155 -0.39317791022691029 -6.1608256340360548e-19  0.93424851493773242 0.35662245495100597 0.00037008290847328595
-0.62264973081037422 -1.3273502691896257 -0.57735026918962584  -0.57702725326215698 -0.57739733617063183 -0.57762605998672611
-0.26582764103728429 -1.1068220897730898 1.2321651268072117e-18  -0.93424851493773209 -0.35662245495100692 0.00037008290847504171
-0.62264973081037422 -1.3273502691896257 0.57735026918962595  -0.57702725326215787 -0.57739733617063271 0.57762605998672423
-0.54306000239317154 -0.46664565776233696 0.69755165300174249  -0.64093662140152685 0.29301330949338805 0.70946701671475032
-1.531208094637017 -0.34872297720557643 0.85397772162051189  0.33139575632083174 0.40118660278746704 0.85394740027497895
-1.4046978598347686 -0.01751488256855982 0.64927986178574382  0.20481384113375192 0.73258235910829927 0.64913355914122706
-0.99530214016523222 -0.017514882568559709 0.64927986178574393  -0.20481384113375062 0.73258235910829983 0.64913355914122695
-0.86879190536298356 -0.34872297720557643 0.85397772162051211  -0.33139575632083107 0.40118660278746743 0.85394740027497895
-1.2000000000000002 -0.55342083704034473 0.98048795642276054  -1.0422004117940045e-16 0.19637276165371687 0.98052931546205824
-1.2 -0.55342083704034473 -0.98048795642276054  1.0422004117940017e-16 0.19637276165371687 -0.98052931546205824
-0.86879190536298345 -0.34872297720557638 -0.853977721620512  -0.33139575632083001 0.40118660278746782 -0.85394740027497917
-0.99530214016523211 -0.017514882568559598 -0.64927986178574393  -0.20481384113375048 0.73258235910829961 -0.64913355914122728
-1.4046978598347681 -0.017514882568559709 -0.64927986178574393  0.20481384113375253 0.73258235910829894 -0.64913355914122728
-1.531208094637017 -0.34872297720557655 -0.85397772162051189  0.33139575632083162 0.40118660278746832 -0.8539474002749784
-1.6012770227944242 -1.6039777216205118 0.33120809463701661  0.40118660278746981 -0.85394740027497795 0.3313957563208309
-1.3965791629596556 -1.7304879564227607 0  0.19637276165371553 -0.98052931546205846 0
-1.6012770227944237 -1.6039777216205118 -0.33120809463701673  0.40118660278746865 -0.8539474002749784 -0.33139575632083129
-1.9324851174314406 -1.3992798617857436 -0.20469785983476813  0.73258235910829894 -0.64913355914122728 -0.20481384113375273
-1.9324851174314408 -1.3992798617857432 0.20469785983476801  0.73258235910829872 -0.64913355914122717 0.20481384113375398
-2.053977721620512 -0.41879190536298327 0.40127702279442357  0.85394740027497706 0.33139575632083451 0.40118660278746859
-0.86879190536298334 -1.1512770227944236 -0.853977721620512  -0.33139575632083118 -0.40118660278746837 -0.85394740027497851
-0.50787822903712998 -0.52299793234814529 0.68413337702600852  -0.675316374147651 0.22527759233947955 0.70228042917184952
-0.55072013821425636 -0.95469785983476807 0.73248511743144062  -0.64913355914122728 -0.20481384113375187 0.73258235910829927
-0.94686945971280478 0.17991689161909552 0.26460466631117979  -0.22507894965080849 0.93495764835206185 0.27421462800527469
-1.2000000000000002 -0.94657916295965572 0.98048795642276054  1.021363855103833e-15 -0.1963727616537177 0.98052931546205802
-1.8492798617857442 -0.95469785983476818 0.73248511743143996  0.64913355914122739 -0.20481384113375128 0.73258235910829927
-1.849279861785744 -0.54530214016523193 0.73248511743144029  0.64913355914122772 0.20481384113375339 0.73258235910829828
-1.9324851174314406 -0.10072013821425641 0.20469785983476813  0.73258235910829994 0.64913355914122695 0.20481384113375017
-1.601277022794424 0.10397772162051178 0.33120809463701673  0.40118660278746743 0.85394740027497895 0.33139575632083129
-1.0034208370403446 0.23048795642276054 0  -0.19637276165371617 0.98052931546205835 1.478555529444688e-15
-0.95847935459740885 0.19857068261001021 0.20072208160320931  -0.22151649240577825 0.95495693252433944 0.19745303394970934
-0.22988186145330614 -0.96732927410114633 0.099634331047451258  -0.97545429555207486 -0.20136271833028208 0.08911774770294062
-0.55072013821425636 -0.54530214016523193 0.73248511743144051  -0.64913355914122683 0.20481384113375087 0.73258235910829994
-0.86879190536298379 -1.151277022794424 0.85397772162051189  -0.33139575632083107 -0.40118660278746854 0.85394740027497851
-1.8492798617857438 -0.54530214016523182 -0.73248511743144007  0.64913355914122717 0.20481384113375148 -0.73258235910829939
-1.531208094637017 -1.151277022794424 -0.85397772162051178  0.33139575632083035 -0.40118660278746909 -0.85394740027497851
-1.2000000000000002 -0.94657916295965583 -0.98048795642276054  3.3611241228009172e-16 -0.196372761653717 -0.98052931546205813
-0.55072013821425636 -0.95469785983476829 -0.73248511743144051  -0.64913355914122661 -0.20481384113375029 -0.73258235910830016
-0.55072013821425636 -0.54530214016523204 -0.73248511743144062  -0.64913355914122695 0.20481384113375187 -0.7325823591082995
-0.22628605152906522 -0.97313250261608553 0.01853460685588823  -0.97011569110293383 -0.24165005293363398 0.021927101793193664
-0.97237322050691288 0.2205376190193819 -0.067701629511043915  -0.2410960188930456 0.96718604322533452 -0.080149032832876443
-1.3965791629596556 0.23048795642276054 0  0.19637276165371675 0.98052931546205824 0
-1.601277022794424 0.10397772162051178 -0.33120809463701673  0.40118660278746793 0.85394740027497873 -0.33139575632083113
-2.053977721620512 -0.41879190536298344 -0.40127702279442368  0.8539474002749784 0.33139575632083257 -0.40118660278746737
-2.053977721620512 -1.0812080946370166 0.40127702279442351  0.85394740027497751 -0.33139575632083157 0.40118660278747026
-1.531208094637017 -1.151277022794424 0.85397772162051167  0.33139575632083174 -0.40118660278746887 0.85394740027497806
-1.4046978598347688 -1.4824851174314402 0.64927986178574359  0.20481384113375084 -0.73258235910829972 0.64913355914122695
-0.79872297720557661 -1.6039777216205122 0.33120809463701684  -0.40118660278746981 -0.85394740027497729 0.33139575632083251
-1.0034208370403446 -1.7304879564227607 0  -0.19637276165371578 -0.98052931546205846 0
-0.99530214016523222 -1.4824851174314406 -0.64927986178574371  -0.20481384113375262 -0.73258235910829927 -0.64913355914122695
-1.4046978598347686 -1.4824851174314402 -0.64927986178574359  0.20481384113375251 -0.73258235910829894 -0.64913355914122739
-1.8492798617857438 -0.95469785983476796 -0.73248511743144029  0.64913355914122783 -0.20481384113375339 -0.73258235910829828
-2.053977721620512 -1.0812080946370168 -0.40127702279442357  0.85394740027497795 -0.33139575632083285 -0.40118660278746815
-2.1804879564227604 -0.74999999999999989 0.19657916295965536  0.98052931546205768 0 0.19637276165371936
-2.1804879564227604 -0.74999999999999989 -0.19657916295965536  0.98052931546205768 0 -0.19637276165371936
-1.9324851174314406 -0.10072013821425641 -0.20469785983476813  0.73258235910829916 0.64913355914122717 -0.20481384113375223
-0.79872297720557672 -1.6039777216205122 -0.33120809463701678  -0.40118660278747048 -0.85394740027497729 -0.33139575632083179
-0.34602227837948807 -1.0812080946370166 -0.40127702279442368  -0.85394740027497884 -0.33139575632083074 -0.40118660278746815
-0.46751488256855955 -1.3992798617857436 -0.20469785983476818  -0.7325823591083005 -0.64913355914122639 -0.2048138411337502
-0.34602227837948807 -1.0812080946370168 0.40127702279442368  -0.85394740027497873 -0.33139575632083085 0.40118660278746832
-0.46751488256855955 -1.3992798617857436 0.20469785983476818  -0.7325823591083005 -0.64913355914122639 0.20481384113375023
-0.99530214016523222 -1.4824851174314406 0.64927986178574371  -0.20481384113375237 -0.73258235910829894 0.6491335591412275
-0.22988186145330608 -0.96732927410114655 -0.09963433104745123  -0.97545429555207175 -0.20136271833029415 -0.089117747702946865
-0.95847935459740874 0.19857068261001024 -0.20072208160320937  -0.22151649240577892 0.954956932524339 -0.19745303394971003
-1.7339861224060584 -0.34452585126808544 0.741922863772152  0.53404105644655964 0.40564529943251687 0.74178975530654645
-1.4079367413660944 0.11400769557376311 0.45853354684184816  0.20774869885998892 0.86409658071843198 0.45845128128591373
-0.25697201819559901 -0.92432848622760766 -0.28050566540029298  -0.94624082570117252 -0.15592580676948942 -0.28339979280099542
-0.74146645315815196 -0.54206325863390559 0.86400769557376322  -0.45845128128591361 0.20774869885998853 0.86409658071843209
-1.322084831801611 -0.74999999999999989 0.9925196692479058  0.1223068254118857 -2.0838543060791878e-17 0.99249233773247159
-1.0779151681983894 -0.74999999999999989 -0.9925196692479058  -0.12230682541188453 -3.2994359846253809e-16 -0.9924923377324717
-0.66601387759394226 -0.34452585126808516 -0.74192286377215244  -0.53404105644655797 0.40564529943252342 -0.74178975530654412
-0.99206325863390588 0.11400769557376322 -0.45853354684184827  -0.2077486988599887 0.86409658071843187 -0.45845128128591395
-1.6054741487319153 -0.008077136227848003 -0.53398612240605781  0.40564529943251759 0.74178975530654712 -0.53404105644655842
-1.6585335468418489 -0.5420632586339057 -0.86400769557376278  0.45845128128591411 0.2077486988599905 -0.86409658071843143
-1.4079367413660953 -1.6140076955737628 0.45853354684184833  0.20774869885998881 -0.86409658071843209 0.45845128128591361
-1.2 -1.7425196692479057 -0.12208483180161099  7.2934900712771562e-16 -0.99249233773247159 -0.12230682541188537
-1.6054741487319149 -1.4919228637721522 -0.53398612240605758  0.40564529943251887 -0.74178975530654701 -0.53404105644655753
-2.0640076955737632 -1.2085335468418479 -0.20793674136609444  0.86409658071843243 -0.45845128128591328 -0.20774869885998787
-1.9419228637721528 -1.2839861224060569 0.40547414873191484  0.74178975530654812 -0.53404105644655753 0.40564529943251665
-1.9419228637721524 -0.21601387759394264 0.40547414873191501  0.74178975530654756 0.53404105644655697 0.40564529943251842
-0.74146645315815196 -0.95793674136609475 -0.86400769557376322  -0.45845128128591356 -0.20774869885998851 -0.86409658071843221
-0.401514802275725 -0.69274920908571369 0.59888293763788769  -0.7801909427416257 0.041329938271327006 0.62417459822266219
-0.74146645315815207 -0.95793674136609486 0.86400769557376322  -0.45845128128591311 -0.20774869885998848 0.86409658071843243
-0.83482598411320952 6.1457978060812172e-19 0.54975734503310147  -0.36351224121617404 0.75900083470875446 0.54016347840020462
-1.0779151681983894 -0.74999999999999989 0.9925196692479058  -0.12230682541188406 3.4730905101319794e-17 0.99249233773247181
-1.7339861224060584 -1.1554741487319149 0.741922863772152  0.53404105644655908 -0.40564529943251793 0.74178975530654645
-1.6585335468418487 -0.54206325863390559 0.86400769557376289  0.45845128128591478 0.20774869885998962 0.86409658071843132
-2.0640076955737632 -0.29146645315815217 0.20793674136609444  0.86409658071843365 0.45845128128591139 0.20774869885998701
-1.6054741487319151 -0.008077136227847892 0.53398612240605792  0.40564529943251865 0.74178975530654712 0.53404105644655731
-1.2 0.2425196692479058 -0.12208483180161095  2.3964324519910656e-16 0.99249233773247181 -0.12230682541188358
-0.99206325863390554 0.11400769557376311 0.45853354684184833  -0.20774869885998912 0.86409658071843187 0.45845128128591373
-0.84685829520082545 0.019286849148286413 0.53075413092765555  -0.36351224121616488 0.75900083470875046 0.54016347840021628
-0.66601387759394237 -0.34452585126808494 0.74192286377215244  -0.53404105644655742 0.40564529943252242 0.74178975530654501
-0.66601387759394248 -1.1554741487319153 0.74192286377215233  -0.53404105644655708 -0.40564529943251937 0.74178975530654689
-1.7339861224060584 -0.34452585126808516 -0.741922863772152  0.53404105644655864 0.40564529943251865 -0.74178975530654623
-1.7339861224060584 -1.1554741487319149 -0.741922863772152  0.53404105644655842 -0.40564529943251715 -0.74178975530654723
-1.322084831801611 -0.74999999999999989 -0.9925196692479058  0.12230682541188573 4.1677086121583756e-17 -0.99249233773247159
-0.66601387759394248 -1.1554741487319151 -0.74192286377215233  -0.53404105644655731 -0.40564529943251704 -0.74178975530654823
-0.74146645315815185 -0.54206325863390548 -0.86400769557376322  -0.45845128128591384 0.20774869885998898 -0.86409658071843187
-0.31682936237190801 -0.8280363774210906 -0.46105412139556579  -0.8782962528090239 -0.071121388581574935 -0.4727974623322927
-0.34243159318633287 -0.78789291377908466 -0.51176714118576783  -0.85590248058787433 -0.033910248167251439 -0.51602426182570016
-1.2 0.2425196692479058 0.12208483180161095  -7.640799122290355e-17 0.99249233773247192 0.12230682541188283
-1.4079367413660944 0.11400769557376311 -0.45853354684184833  0.20774869885998962 0.86409658071843187 -0.45845128128591373
-2.0640076955737632 -0.29146645315815212 -0.20793674136609447  0.86409658071843187 0.4584512812859135 -0.20774869885998987
-2.0640076955737636 -1.2085335468418477 0.20793674136609439  0.86409658071843243 -0.45845128128591239 0.20774869885999017
-1.6585335468418487 -0.95793674136609475 0.86400769557376267  0.45845128128591395 -0.20774869885999089 0.86409658071843143
-1.6054741487319153 -1.491922863772152 0.53398612240605781  0.40564529943251759 -0.74178975530654778 0.53404105644655731
-0.79452585126808539 -1.4919228637721524 0.53398612240605769  -0.40564529943251698 -0.74178975530654778 0.53404105644655797
-1.2 -1.7425196692479057 0.12208483180161099  6.8072573998586795e-16 -0.99249233773247159 0.12230682541188549
-0.79452585126808528 -1.4919228637721522 -0.53398612240605792  -0.4056452994325187 -0.74178975530654545 -0.53404105644655964
-1.4079367413660944 -1.614007695573763 -0.45853354684184833  0.20774869885998909 -0.86409658071843176 -0.45845128128591417
-1.6585335468418487 -0.95793674136609452 -0.86400769557376267  0.4584512812859145 -0.20774869885998953 -0.86409658071843143
-1.9419228637721524 -1.2839861224060574 -0.40547414873191495  0.74178975530654701 -0.53404105644655786 -0.40564529943251831
-2.1925196692479059 -0.62791516819838922 2.4628875390745807e-18  0.99249233773247181 0.12230682541188423 -5.2096357651979694e-17
-2.1925196692479059 -0.87208483180161089 -2.4628875390745799e-18  0.99249233773247181 -0.12230682541188413 -6.9461810202639609e-18
-1.9419228637721524 -0.21601387759394264 -0.40547414873191495  0.74178975530654789 0.53404105644655719 -0.40564529943251754
-0.99206325863390588 -1.614007695573763 -0.45853354684184849  -0.20774869885998934 -0.86409658071843087 -0.45845128128591556
-0.33599230442623673 -1.2085335468418481 -0.20793674136609458  -0.86409658071843209 -0.45845128128591345 -0.2077486988599889
-0.45807713622784751 -1.2839861224060574 -0.40547414873191506  -0.74178975530654689 -0.53404105644655819 -0.40564529943251804
-0.45807713622784763 -1.2839861224060576 0.40547414873191512  -0.74178975530654645 -0.5340410564465583 0.40564529943251881
-0.33599230442623684 -1.2085335468418481 0.20793674136609461  -0.86409658071843176 -0.45845128128591395 0.20774869885998978
-0.99206325863390588 -1.614007695573763 0.45853354684184833  -0.20774869885998906 -0.86409658071843165 0.45845128128591439
-0.34177771381313393 -0.78887113359859207 -0.51061830246204121  -0.85590248058786922 -0.033910248167229561 -0.51602426182571026
-0.34288899659372696 -0.78713443636827329 -0.51257565524045923  -0.85590248058787344 -0.033910248167249565 -0.51602426182570194
-1.3827577335161512 -0.18355391658479392 0.80357852474018532  0.18137511328579431 0.56621300696157095 0.80405590541211835
-1.4379740221293495 -0.54790881588591045 0.95001448309746583  0.23767767361493644 0.20255543129006817 0.94998980032413305
-1.2000000000000002 -0.0706034255649165 0.73377128224391142  8.7163359736193314e-16 0.67830899168555436 0.73477677685030751
-1.5850500562448067 -0.16285875964110386 0.71204046096811657  0.3845705542759717 0.58712598556604001 0.71231212670919619
-1.0172422664838487 -0.18355391658479348 0.80357852474018532  -0.18137511328579392 0.56621300696157051 0.8040559054121188
-1.2000000000000002 0.075115262488245294 0.56496442685265946  5.5221311543411251e-16 0.82480365918097698 0.56541924604816096
-1.0870495089801231 -0.36631165010094457 0.9165290157600624  -0.11209598472398208 0.38483789367577798 0.91615189013610143
-0.81494994375519358 -0.16285875964110375 0.7120404609681168  -0.3845705542759722 0.58712598556604001 0.71231212670919597
-1.3129504910198773 -0.36631165010094457 0.91652901576006229  0.11209598472398373 0.38483789367577581 0.91615189013610221
-0.96202597787065125 -0.54790881588591023 0.95001448309746594  -0.23767767361493694 0.20255543129006864 0.94998980032413283
-1.0870495089801231 -0.36631165010094452 -0.9165290157600624  -0.11209598472398326 0.38483789367577603 -0.91615189013610221
-1.4379740221293495 -0.54790881588591023 -0.95001448309746561  0.23767767361493697 0.20255543129006795 -0.94998980032413294
-1.017242266483849 -0.18355391658479381 -0.80357852474018554  -0.18137511328579417 0.56621300696157051 -0.80405590541211869
-0.96202597787065125 -0.54790881588591045 -0.95001448309746594  -0.23767767361493575 0.20255543129006887 -0.94998980032413305
-1.2000000000000002 -0.0706034255649165 -0.73377128224391142  5.764588731557008e-16 0.67830899168555392 -0.73477677685030796
-0.81494994375519336 -0.16285875964110375 -0.71204046096811668  -0.38457055427597042 0.58712598556604023 -0.71231212670919664
-1.3827577335161514 -0.18355391658479359 -0.80357852474018521  0.18137511328579328 0.56621300696157029 -0.80405590541211902
-1.2000000000000002 0.075115262488245294 -0.56496442685265946  -3.299386538757276e-16 0.82480365918097698 -0.56541924604816096
-1.3129504910198775 -0.36631165010094457 -0.9165290157600624  0.1120959847239841 0.3848378936757767 -0.91615189013610177
-1.5850500562448067 -0.16285875964110386 -0.71204046096811668  0.38457055427597114 0.58712598556604023 -0.71231212670919641
-1.5836883498990559 -1.6665290157600621 0.11295049101987709  0.38483789367577709 -0.91615189013610177 0.11209598472398286
-1.7871412403588969 -1.4620404609681164 0.38505005624480626  0.58712598556604179 -0.71231212670919564 0.38457055427597003
-1.5836883498990559 -1.6665290157600623 -0.11295049101987707  0.38483789367577775 -0.91615189013610154 -0.11209598472398273
-1.40209118411409 -1.7000144830974659 0.23797402212934909  0.20255543129007092 -0.9499898003241326 0.23767767361493622
-1.7664460834152065 -1.553578524740185 -0.18275773351615091  0.56621300696157206 -0.80405590541211724 -0.18137511328579567
-1.4020911841140902 -1.7000144830974655 -0.23797402212934918  0.20255543129006892 -0.9499898003241326 -0.23767767361493738
-1.8793965744350842 -1.4837712822439109 3.6838438251301876e-18  0.67830899168555292 -0.73477677685030884 -2.0835862885145818e-17
-1.7871412403588964 -1.4620404609681166 -0.38505005624480632  0.58712598556603934 -0.71231212670919797 -0.38457055427596953
-1.7664460834152067 -1.553578524740185 0.18275773351615077  0.56621300696157284 -0.80405590541211724 0.18137511328579339
-2.0251152624882458 -1.3149644268526588 4.9279074600009303e-18  0.82480365918097787 -0.56541924604815963 3.959263846508732e-16
-2.0035785247401852 -0.56724226648384923 0.56644608341520641  0.80405590541211902 0.18137511328579364 0.56621300696157018
-2.1500144830974657 -0.51202597787065107 0.2020911841140898  0.94998980032413249 0.2376776736149368 0.20255543129007017
-1.0870495089801231 -1.1336883498990558 -0.91652901576006229  -0.11209598472398448 -0.38483789367577503 -0.91615189013610243
-0.81494994375519347 -1.3371412403588963 -0.71204046096811691  -0.38457055427597137 -0.58712598556603912 -0.71231212670919708
-0.50468001700647158 -0.52828837108788052 -0.68272481536695295  -0.70341121140138541 0.24317084427689514 -0.66789266216099252
-0.24998551690253412 -0.98797402212934915 -0.20209118411408994  -0.9499898003241326 -0.23767767361493736 -0.20255543129006948
-0.46622871775608876 -0.75 0.67939657443508383  -0.73477677685030829 -3.9588139481777045e-16 0.67830899168555359
-0.48795953903188338 -1.1350500562448065 0.58714124035889637  -0.71231212670919686 -0.38457055427597164 0.58712598556603945
-0.5039242293873103 -0.52945918848859996 -0.68235511400187066  -0.70341121140136365 0.24317084427688193 -0.66789266216102017
-0.74055958467102845 -0.15027494754537984 0.65399889841309089  -0.47623926703786856 0.60557549052406867 0.63755351603435406
-1.0870495089801235 -1.1336883498990558 0.9165290157600624  -0.11209598472398359 -0.38483789367577514 0.91615189013610243
-1.4379740221293495 -0.95209118411408999 0.95001448309746561  0.23767767361493705 -0.20255543129006778 0.94998980032413294
-2.0035785247401856 -0.93275773351615066 0.5664460834152063  0.80405590541211935 -0.18137511328579281 0.56621300696156995
-1.7649644268526601 -0.75 0.82511526248824485  0.56541924604816107 -3.4730384618497649e-18 0.82480365918097698
-1.9337712822439117 -0.75000000000000011 0.67939657443508328  0.73477677685030851 -1.2675149921797036e-15 0.67830899168555325
-1.9120404609681168 -0.3649499437551938 0.58714124035889637  0.71231212670919697 0.38457055427597076 0.58712598556603979
-1.8793965744350838 -0.016228717756088806 -3.6838438251301884e-18  0.67830899168555203 0.73477677685030962 3.1948323090556916e-16
-1.7871412403588964 -0.037959539031883538 0.38505005624480637  0.58712598556604001 0.71231212670919664 0.38457055427597098
-1.7664460834152065 0.053578524740185096 0.18275773351615091  0.56621300696157051 0.8040559054121188 0.18137511328579331
-1.40209118411409 0.20001448309746583 0.23797402212934918  0.20255543129007034 0.94998980032413272 0.23767767361493608
-0.70685918524788072 -0.20468185015976154 0.67677227421098896  -0.4910585344062261 0.56677814486535194 0.6615315943247152
-0.99790881588590996 0.20001448309746583 0.23797402212934915  -0.20255543129007028 0.94998980032413283 0.23767767361493566
-0.71021467390312121 -0.19943478257349531 0.67476755984413883  -0.49105853440622815 0.56677814486535261 0.66153159432471309
-0.46796403496887878 -0.58666916470964625 0.66003296952840662  -0.73315795129590233 0.17491713444451357 0.65717837344918428
-0.79934060742300872 -0.055862651692236226 0.5979056290568221  -0.3776341406275795 0.67726348918457735 0.63143219909187531
-0.2389405724498605 -0.95306848001363997 0.18186355091081885  -0.96305716105844952 -0.20064914867263259 0.1796129830245782
-0.82493587926686529 -0.015775204470230869 0.56417193374348917  -0.38232288700972672 0.72686052081252872 0.57052869634461612
-0.63503557314734083 -0.75 0.82511526248824552  -0.56541924604816163 -1.0766419231734269e-16 0.82480365918097653
-1.0172422664838496 -1.3164460834152063 0.80357852474018554  -0.18137511328579276 -0.56621300696157029 0.80405590541211913
-0.96202597787065158 -0.95209118411408999 0.95001448309746594  -0.23767767361493594 -0.20255543129006862 0.94998980032413305
-2.0035785247401852 -0.56724226648384934 -0.56644608341520641  0.80405590541211858 0.18137511328579409 -0.56621300696157051
-1.7649644268526601 -0.75 -0.82511526248824485  0.56541924604816107 5.7999742312891081e-16 -0.82480365918097698
-1.3827577335161512 -1.3164460834152063 -0.80357852474018521  0.18137511328579306 -0.56621300696157095 -0.80405590541211858
-1.4379740221293491 -0.95209118411408988 -0.95001448309746583  0.23767767361493636 -0.20255543129006795 -0.94998980032413316
-1.312950491019877 -1.1336883498990558 -0.91652901576006229  0.11209598472398394 -0.38483789367577526 -0.91615189013610243
-0.96202597787065103 -0.95209118411408988 -0.95001448309746583  -0.23767767361493705 -0.20255543129006864 -0.94998980032413283
-0.39642147525981475 -0.93275773351615077 -0.56644608341520675  -0.80405590541211891 -0.18137511328579489 -0.56621300696156995
-0.63503557314734083 -0.75 -0.82511526248824552  -0.56541924604816163 1.0766419231734269e-16 -0.82480365918097653
-0.46622871775608876 -0.75000000000000011 -0.67939657443508383  -0.73477677685030829 7.8134485819296787e-16 -0.67830899168555348
-0.80588150441467499 -0.045732053728024698 0.58956860097969011  -0.38232288700972333 0.72686052081253028 0.57052869634461656
-0.34288899659372707 -0.78713443636827329 0.51257565524045945  -0.85590248058786422 -0.033910248167211242 0.51602426182571981
-0.34243159318633287 -0.78789291377908466 0.51176714118576805  -0.85590248058786889 -0.033910248167232739 0.5160242618257106
-0.34177771381313388 -0.78887113359859229 0.51061830246204121  -0.85590248058787288 -0.033910248167247574 0.51602426182570293
-0.99790881588591029 0.20001448309746583 -0.23797402212934918  -0.20255543129006723 0.94998980032413294 -0.23767767361493783
-1.5836883498990559 0.16652901576006207 0.11295049101987709  0.38483789367577637 0.9161518901361021 0.11209598472398305
-1.40209118411409 0.20001448309746583 -0.23797402212934915  0.20255543129007114 0.9499898003241326 -0.2376776736149358
-1.5836883498990559 0.16652901576006207 -0.11295049101987709  0.38483789367577648 0.91615189013610199 -0.11209598472398297
-1.7871412403588964 -0.037959539031883538 -0.38505005624480637  0.5871259855660409 0.71231212670919597 -0.38457055427597087
-2.1165290157600625 -0.6370495089801228 -0.38368834989905554  0.91615189013610099 0.1120959847239822 -0.38483789367577931
-1.9120404609681168 -0.36494994375519357 -0.58714124035889637  0.71231212670919641 0.3845705542759717 -0.58712598556603979
-2.1165290157600625 -0.86295049101987698 0.38368834989905543  0.91615189013610165 -0.11209598472398331 0.3848378936757772
-1.9120404609681168 -1.135050056244806 0.58714124035889637  0.71231212670919819 -0.38457055427596898 0.58712598556603957
-1.3129504910198773 -1.1336883498990558 0.91652901576006229  0.11209598472398363 -0.38483789367577614 0.9161518901361021
-1.5850500562448071 -1.3371412403588963 0.71204046096811657  0.38457055427597236 -0.58712598556603968 0.71231212670919608
-1.3827577335161514 -1.3164460834152065 0.80357852474018521  0.18137511328579295 -0.56621300696157051 0.80405590541211891
-1.2000000000000002 -1.5751152624882452 0.56496442685265946  1.3892153847399058e-16 -0.82480365918097576 0.56541924604816274
-0.63355391658479354 -1.5535785247401852 0.18275773351615093  -0.56621300696157051 -0.8040559054121188 0.18137511328579331
-0.99790881588591018 -1.7000144830974657 0.23797402212934921  -0.20255543129006723 -0.94998980032413316 0.2376776736149368
-0.81631165010094464 -1.6665290157600627 0.1129504910198771  -0.38483789367577681 -0.91615189013610188 0.1120959847239833
-0.99790881588591029 -1.7000144830974659 -0.23797402212934909  -0.20255543129006776 -0.94998980032413294 -0.23767767361493697
-1.017242266483849 -1.3164460834152065 -0.80357852474018521  -0.18137511328579398 -0.56621300696157084 -0.80405590541211847
-1.1999999999999997 -1.5751152624882452 -0.56496442685265946  -4.9664450004451621e-16 -0.82480365918097553 -0.56541924604816296
-1.2 -1.4293965744350836 -0.73377128224391142  -2.1183127266564911e-16 -0.6783089916855537 -0.73477677685030818
-1.5850500562448067 -1.3371412403588963 -0.71204046096811657  0.38457055427597253 -0.58712598556604045 -0.71231212670919553
-1.9337712822439117 -0.75 -0.67939657443508328  0.73477677685030751 2.0488598503726717e-16 -0.67830899168555447
-1.9120404609681168 -1.1350500562448065 -0.58714124035889637  0.71231212670919686 -0.38457055427597125 -0.58712598556603968
-2.0035785247401852 -0.93275773351615077 -0.56644608341520641  0.80405590541211902 -0.18137511328579364 -0.56621300696157018
-2.1500144830974657 -0.98797402212934904 -0.2020911841140898  0.94998980032413249 -0.23767767361493719 -0.20255543129006995
-2.1165290157600625 -0.63704950898012302 0.38368834989905543  0.91615189013610077 0.11209598472398245 0.38483789367577964
-2.1500144830974657 -0.98797402212934915 0.20209118411408972  0.94998980032413227 -0.23767767361493719 0.20255543129007089
-2.1165290157600625 -0.86295049101987698 -0.38368834989905543  0.91615189013610088 -0.11209598472398295 -0.38483789367577903
-2.1500144830974657 -0.51202597787065129 -0.2020911841140898  0.94998980032413249 0.2376776736149368 -0.20255543129007036
-1.7664460834152065 0.053578524740185096 -0.18275773351615085  0.56621300696157051 0.8040559054121188 -0.18137511328579331
-2.0251152624882454 -0.18503557314734087 -4.9279074600009318e-18  0.82480365918097698 0.56541924604816085 -1.3892153847399056e-17
-0.81631165010094442 -1.6665290157600623 -0.11295049101987711  -0.38483789367577609 -0.91615189013610221 -0.11209598472398241
-0.61285875964110381 -1.4620404609681166 -0.38505005624480643  -0.58712598556603934 -0.71231212670919697 -0.38457055427597125
-0.36998650939197836 -0.74269333684247552 0.55678551944213661  -0.8349447946535743 0.020957685934292217 0.54993450999294469
-0.48795953903188327 -1.1350500562448065 -0.58714124035889637  -0.71231212670919597 -0.38457055427597131 -0.58712598556604068
-0.63355391658479376 -1.5535785247401854 -0.18275773351615088  -0.56621300696156951 -0.80405590541211902 -0.18137511328579553
-0.37488473751175444 -1.3149644268526592 -4.9279074600009341e-18  -0.82480365918097676 -0.56541924604816129 0
-0.39642147525981486 -0.93275773351615077 0.56644608341520686  -0.80405590541211891 -0.18137511328579314 0.56621300696157051
-0.24998551690253423 -0.98797402212934882 0.20209118411408999  -0.9499898003241326 -0.23767767361493708 0.20255543129006939
-0.52060342556491623 -1.4837712822439113 -3.6838438251301899e-18  -0.67830899168555481 -0.73477677685030718 3.4726438141909694e-18
-0.6128587596411037 -1.4620404609681166 0.38505005624480643  -0.58712598556603934 -0.71231212670919719 0.38457055427597109
-1.2000000000000002 -1.4293965744350836 0.73377128224391142  2.0835862885145816e-16 -0.67830899168555336 0.7347767768503084
-0.8149499437551937 -1.3371412403588963 0.71204046096811668  -0.38457055427597064 -0.58712598556604068 0.71231212670919641
-0.40036321981550405 -0.6946524719094237 0.59753024518837061  -0.79967159059349457 0.022528674978302438 0.60001483815101819
-0.39895802436543049 -0.69687753315555545 0.59574101077153174  -0.79967159059343473 0.022528674978363441 0.60001483815109546
-0.96559982489567697 0.20947750201587079 0.15035899655759488  -0.24320416233348857 0.9567573137208899 0.1595843916717827
-0.24336599009814622 -0.94602936533555493 0.21094260961626568  -0.95495693252433855 -0.19745303394971275 0.22151649240577886
-1.7521834643091894 -0.47457531588943436 0.78691464920034182  0.55218785652865943 0.27542173873706771 0.78691259802682978
-1.5412681489687436 0.077608148419754941 0.44564650023159863  0.34127086350966185 0.82760959526572608 0.4456417345171691
-0.96559982489567697 0.20947750201587081 -0.15035899655759494  -0.24320416233349013 0.95675731372088979 -0.1595843916717804
-0.64781653569081088 -0.47457531588943408 0.78691464920034226  -0.55218785652865776 0.2754217387370676 0.78691259802683111
-1.2000000000000002 -0.81584346485817771 0.99782996454078776  0 -0.065849124772593817 0.99782959104582747
-1.2000000000000002 -0.81584346485817771 -0.99782996454078776  0 -0.065849124772593817 -0.99782959104582747
-0.64781653569081088 -0.47457531588943419 -0.78691464920034226  -0.55218785652865798 0.2754217387370681 -0.78691259802683067
-0.95069104161024875 0.18567470552212903 -0.24579255546759926  -0.24611330719286928 0.93975526497093065 -0.23725151629021102
-1.5412681489687436 0.077608148419754941 -0.44564650023159885  0.34127086350966235 0.82760959526572575 -0.44564173451716921
-1.7521834643091894 -0.47457531588943419 -0.78691464920034182  0.55218785652865887 0.27542173873706827 -0.78691259802683
-1.4754246841105663 -1.5369146492003418 0.55218346430918919  0.27542173873706677 -0.78691259802683144 0.55218785652865754
-1.1341565351418224 -1.7478299645407878 -1.2310405966106296e-18  -0.065849124772593665 -0.99782959104582747 0
-1.4754246841105658 -1.5369146492003423 -0.55218346430918908  0.27542173873706888 -0.78691259802682978 -0.55218785652865909
-2.0276081484197555 -1.1956465002315984 -0.34126814896874325  0.82760959526572642 -0.44564173451716815 -0.34127086350966207
-2.027608148419755 -1.1956465002315986 0.34126814896874302  0.82760959526572597 -0.4456417345171691 0.3412708635096619
-1.986914649200342 -0.19781653569081092 0.27542468411056586  0.78691259802683011 0.55218785652865876 0.27542173873706821
-0.64781653569081088 -1.0254246841105659 -0.78691464920034226  -0.55218785652865832 -0.27542173873706799 -0.78691259802683045
-0.2530893365809796 -0.92998804508785282 -0.26439588316448515  -0.95675731372090322 -0.15958439167178515 -0.24320416233343448
-0.7543534997684016 -1.0912681489687439 0.82760814841975494  -0.44564173451716949 -0.34127086350966251 0.82760959526572553
-0.25308933658097965 -0.92998804508785282 0.26439588316448515  -0.95675731372092687 -0.1595843916717935 0.24320416233333605
-1.2000000000000002 -0.68415653514182251 0.99782996454078776  -7.6294444242541125e-17 0.06584912477259372 0.99782959104582747
-1.645646500231599 -1.0912681489687435 0.82760814841975483  0.44564173451716993 -0.34127086350966274 0.8276095952657252
-1.645646500231599 -0.40873185103125675 0.82760814841975483  0.44564173451716893 0.34127086350966063 0.82760959526572653
-2.027608148419755 -0.30435349976840131 0.34126814896874336  0.82760959526572586 0.44564173451716782 0.34127086350966385
-1.4754246841105658 0.036914649200342042 0.55218346430918919  0.27542173873706799 0.78691259802683033 0.55218785652865843
-1.2658434648581776 0.24782996454078776 -1.2310405966106292e-18  0.065849124772593665 0.99782959104582747 0
-0.92457531588943409 0.036914649200342042 0.5521834643091893  -0.27542173873706743 0.78691259802683056 0.55218785652865843
-0.94686945971280467 0.17991689161909563 -0.26460466631117985  -0.22507894965081496 0.93495764835206541 -0.27421462800525709
-0.75435349976840138 -0.40873185103125664 0.82760814841975505  -0.4456417345171686 0.3412708635096614 0.82760959526572653
-0.6478165356908111 -1.0254246841105663 0.78691464920034215  -0.55218785652865843 -0.27542173873706882 0.78691259802683011
-1.645646500231599 -0.40873185103125675 -0.82760814841975483  0.44564173451716993 0.34127086350966246 -0.82760959526572531
-1.7521834643091894 -1.0254246841105659 -0.78691464920034182  0.55218785652865932 -0.27542173873706838 -0.78691259802682978
-1.2000000000000002 -0.68415653514182251 -0.99782996454078776  7.6294444242540927e-17 0.06584912477259372 -0.99782959104582747
-0.75435349976840138 -1.0912681489687435 -0.82760814841975505  -0.44564173451716949 -0.34127086350966229 -0.82760959526572564
-0.75435349976840138 -0.40873185103125664 -0.82760814841975505  -0.44564173451716982 0.34127086350966096 -0.82760959526572597
-0.97351999728657068 0.22241808576487493 -0.034988854233130418  -0.2166870396643529 0.97542959357555281 -0.039797422259878493
-0.92457531588943409 0.036914649200342042 -0.55218346430918919  -0.2754217387370671 0.78691259802683144 -0.55218785652865743
-1.1341565351418224 0.24782996454078776 1.2310405966106292e-18  -0.065849124772593665 0.99782959104582747 0
-1.4754246841105658 0.036914649200342042 -0.5521834643091893  0.27542173873706866 0.78691259802682956 -0.55218785652865932
-1.986914649200342 -0.19781653569081104 -0.27542468411056586  0.78691259802682911 0.55218785652865943 -0.27542173873706954
-1.9869146492003424 -1.3021834643091887 0.27542468411056575  0.78691259802682978 -0.55218785652865932 0.27542173873706816
-1.7521834643091894 -1.0254246841105661 0.78691464920034182  0.55218785652865898 -0.27542173873706888 0.78691259802682978
-1.5412681489687439 -1.5776081484197546 0.44564650023159885  0.34127086350966063 -0.82760959526572619 0.44564173451716954
-0.92457531588943409 -1.5369146492003423 0.55218346430918908  -0.27542173873706716 -0.78691259802683056 0.55218785652865865
-1.2658434648581776 -1.7478299645407878 1.2310405966106296e-18  0.065849124772593665 -0.99782959104582747 0
-0.85873185103125671 -1.5776081484197548 -0.44564650023159907  -0.34127086350966263 -0.82760959526572475 -0.44564173451717054
-1.5412681489687436 -1.5776081484197548 -0.44564650023159874  0.34127086350966196 -0.82760959526572642 -0.44564173451716832
-1.645646500231599 -1.0912681489687435 -0.82760814841975483  0.4456417345171701 -0.3412708635096614 -0.82760959526572564
-1.986914649200342 -1.302183464309189 -0.27542468411056586  0.78691259802683 -0.55218785652865876 -0.27542173873706866
-2.1978299645407877 -0.75 -0.065843464858177436  0.99782959104582769 0 -0.065849124772590362
-2.1978299645407877 -0.75 0.065843464858177464  0.99782959104582769 0 0.065849124772590376
-2.027608148419755 -0.30435349976840137 -0.34126814896874336  0.82760959526572575 0.44564173451716782 -0.34127086350966401
-0.92457531588943409 -1.536914649200342 -0.5521834643091893  -0.27542173873706982 -0.78691259802682956 -0.55218785652865887
-0.41308535079965791 -1.3021834643091892 -0.27542468411056586  -0.78691259802683033 -0.55218785652865887 -0.2754217387370676
-0.37239185158024513 -1.195646500231599 -0.34126814896874341  -0.82760959526572564 -0.44564173451716932 -0.34127086350966235
-0.41308535079965802 -1.3021834643091892 0.27542468411056598  -0.78691259802683089 -0.55218785652865832 0.27542173873706671
-0.3723918515802449 -1.1956465002315986 0.34126814896874336  -0.82760959526572608 -0.44564173451716882 0.34127086350966174
-0.85873185103125671 -1.5776081484197548 0.44564650023159885  -0.34127086350966107 -0.82760959526572653 0.4456417345171686
-0.23894057244986044 -0.95306848001363997 -0.18186355091081888  -0.9630571610584503 -0.20064914867263101 -0.17961298302457609
-0.89270251295960135 0.092787072853812741 -0.43974499787970978  -0.29815500373095538 0.84204499011931544 -0.4495151036007089
-1.461054269450115 -0.11542238876277822 0.7274351680516471  0.26123864468751806 0.63469945426951135 0.72726265769102505
-1.3186983640546239 -0.48811498758743949 0.95777186148081694  0.11873329660574243 0.26161560941278617 0.95784115446597373
-1.1310037179992745 0.0032759752918453122 0.65407554465688122  -0.06912413518310466 0.7534327508752533 0.65388144479235411
-1.5036963168239361 -0.22706071813732454 0.79643145005237248  0.30395970967362052 0.52285425410030495 0.79638679287412983
-0.89630368317606424 -0.22706071813732454 0.79643145005237248  -0.30395970967361929 0.52285425410030439 0.7963867928741305
-1.2689962820007255 0.0032759752918453122 0.65407554465688122  0.069124135183106131 0.75343275087525274 0.65388144479235455
-1.0813016359453766 -0.48811498758743949 0.95777186148081694  -0.118733296605742 0.26161560941278611 0.95784115446597384
-0.93894573054988506 -0.11542238876277811 0.72743516805164721  -0.26123864468751856 0.63469945426951035 0.72726265769102583
-1.4303366934291697 -0.41911870558671405 0.9151298141069959  0.23057849677494927 0.33073974459589145 0.91512008947987211
-0.96966330657083066 -0.41911870558671399 0.91512981410699601  -0.23057849677494835 0.33073974459588995 0.915120089479873
-0.96966330657083044 -0.41911870558671399 -0.91512981410699601  -0.23057849677494902 0.33073974459589195 -0.91512008947987211
-1.4303366934291701 -0.41911870558671405 -0.9151298141069959  0.2305784967749491 0.33073974459589156 -0.91512008947987211
-0.93894573054988506 -0.11542238876277811 -0.72743516805164721  -0.26123864468751845 0.63469945426951091 -0.72726265769102549
-1.0813016359453766 -0.48811498758743949 -0.95777186148081694  -0.11873329660574221 0.26161560941278611 -0.95784115446597373
-1.2689962820007261 0.0032759752918452012 -0.65407554465688111  0.069124135183106089 0.75343275087525252 -0.65388144479235466
-0.89630368317606401 -0.22706071813732454 -0.79643145005237248  -0.30395970967361979 0.52285425410030539 -0.79638679287412972
-1.5036963168239366 -0.22706071813732454 -0.79643145005237237  0.30395970967362079 0.52285425410030473 -0.79638679287412983
-1.1310037179992749 0.0032759752918453122 -0.65407554465688122  -0.069124135183104382 0.75343275087525341 -0.65388144479235388
-1.3186983640546237 -0.48811498758743949 -0.95777186148081694  0.11873329660574333 0.2616156094127855 -0.95784115446597384
-1.461054269450115 -0.11542238876277822 -0.7274351680516471  0.26123864468751934 0.63469945426951124 -0.72726265769102472
-1.4618850124125609 -1.7077718614808168 0.11869836405462342  0.26161560941278728 -0.95784115446597351 0.11873329660574186
-1.8345776112372221 -1.4774351680516467 0.26105426945011473  0.63469945426951191 -0.72726265769102461 0.26123864468751806
-1.5308812944132866 -1.6651298141069957 -0.23033669342916982  0.33073974459589145 -0.91512008947987211 -0.23057849677494963
-1.530881294413287 -1.6651298141069955 0.23033669342916985  0.33073974459589006 -0.91512008947987245 0.2305784967749499
-1.8345776112372223 -1.4774351680516467 -0.26105426945011484  0.63469945426951324 -0.72726265769102416 -0.26123864468751634
-1.4618850124125611 -1.7077718614808168 -0.1186983640546234  0.26161560941278583 -0.95784115446597407 -0.11873329660574009
-1.9532759752918458 -1.4040755446568804 0.068996282000725453  0.75343275087525374 -0.65388144479235344 0.069124135183105562
-1.7229392818626761 -1.5464314500523721 -0.30369631682393577  0.52285425410030362 -0.7963867928741305 -0.30395970967362118
-1.7229392818626763 -1.5464314500523719 0.30369631682393572  0.5228542541003065 -0.79638679287412883 0.30395970967362029
-1.9532759752918458 -1.4040755446568807 -0.068996282000725426  0.75343275087525352 -0.65388144479235377 -0.069124135183104743
-1.9274351680516473 -0.48894573054988527 0.63457761123722167  0.72726265769102405 0.2612386446875189 0.63469945426951224
-2.1577718614808168 -0.63130163594537647 0.26188501241256051  0.95784115446597407 0.11873329660574208 0.26161560941278489
-1.0813016359453766 -1.0118850124125607 -0.95777186148081683  -0.11873329660574054 -0.26161560941278716 -0.95784115446597373
-0.93894573054988506 -1.3845776112372217 -0.72743516805164732  -0.26123864468751773 -0.63469945426951191 -0.72726265769102483
-0.88525794997176432 0.081090696230260814 -0.45671715648324701  -0.29815500373095694 0.84204499011931366 -0.44951510360071101
-0.28487018589300406 -0.98033669342916963 -0.33088129441328618  -0.91512008947987944 -0.23057849677495143 -0.33073974459586986
-0.54592445534311906 -0.6810037179992745 0.75327597529184542  -0.65388144479235311 0.069124135183104313 0.75343275087525419
-0.40356854994762748 -1.0536963168239357 0.52293928186267569  -0.79638679287412972 -0.30395970967362018 0.52285425410030517
-0.91382708291667858 0.12638371280443889 -0.38483791504434905  -0.29603762580284126 0.87653155169613006 -0.37954467851649781
-0.9094202856258099 0.11959234854368263 -0.39708487175152668  -0.29603762580284099 0.87653155169612995 -0.37954467851649804
-0.969663306570831 -1.0808812944132864 0.91512981410699601  -0.23057849677494785 -0.33073974459589195 0.91512008947987233
-1.4303366934291701 -1.0808812944132864 0.91512981410699579  0.23057849677494982 -0.33073974459589167 0.91512008947987189
-1.9964314500523728 -1.0536963168239355 0.52293928186267535  0.79638679287413006 -0.30395970967362124 0.52285425410030406
-1.8540755446568815 -0.68100371799927473 0.75327597529184498  0.65388144479235344 0.069124135183104507 0.75343275087525385
-1.8540755446568815 -0.81899628200072538 0.75327597529184498  0.65388144479235388 -0.069124135183104785 0.75343275087525341
-1.9964314500523725 -0.44630368317606428 0.52293928186267558  0.79638679287413028 0.30395970967361963 0.52285425410030462
-1.9532759752918452 -0.095924455343118997 -0.068996282000725481  0.75343275087525419 0.65388144479235299 -0.069124135183104882
-1.7229392818626761 0.046431450052372147 0.30369631682393577  0.52285425410030628 0.79638679287412928 0.30395970967361957
-1.8345776112372223 -0.022564831948353237 0.26105426945011484  0.6346994542695108 0.72726265769102516 0.26123864468751951
-1.4618850124125611 0.20777186148081683 0.1186983640546234  0.26161560941278689 0.95784115446597351 0.11873329660574237
-0.69377314187723504 -0.22428489754399578 0.68341702461536258  -0.54199242061149078 0.50624478547212293 0.67079090123672747
-0.97351999728657068 0.22241808576487493 0.034988854233130445  -0.21668703966435238 0.97542959357555303 0.039797422259877605
-0.25697201819559901 -0.92432848622760766 0.28050566540029309  -0.94624082570117252 -0.1559258067694915 0.28339979280099437
-0.29401138453262826 -0.86471241548978539 -0.40567809407889899  -0.89961957659540737 -0.11104418275857356 -0.42231955541009525
-0.30362145533065937 -0.84916410602320314 -0.43023759412454321  -0.89961957659540792 -0.11104418275857478 -0.42231955541009381
-0.93241910595001631 0.15597288936521894 0.32585692434233732  -0.24890531892629236 0.91663390223888808 0.3127753690374443
-0.93208712065408506 0.15549608434201159 0.3269900786062353  -0.2489053189262907 0.91663390223888952 0.3127753690374413
-0.54592445534311906 -0.81899628200072527 0.75327597529184542  -0.65388144479235311 -0.069124135183104313 0.75343275087525419
-0.93894573054988539 -1.3845776112372221 0.7274351680516471  -0.26123864468751845 -0.63469945426951091 0.72726265769102538
-1.0813016359453769 -1.0118850124125609 0.95777186148081694  -0.118733296605741 -0.26161560941278728 0.95784115446597362
-1.9964314500523725 -0.44630368317606417 -0.52293928186267558  0.79638679287412983 0.30395970967361996 -0.52285425410030517
-1.8540755446568815 -0.81899628200072527 -0.75327597529184498  0.65388144479235399 -0.069124135183104743 -0.7534327508752533
-1.461054269450115 -1.3845776112372219 -0.72743516805164699  0.26123864468751895 -0.63469945426951135 -0.72726265769102472
-1.3186983640546237 -1.0118850124125607 -0.95777186148081683  0.11873329660574095 -0.2616156094127855 -0.95784115446597407
-1.4303366934291697 -1.0808812944132864 -0.9151298141069959  0.23057849677494993 -0.33073974459589245 -0.91512008947987156
-0.96966330657083044 -1.0808812944132864 -0.9151298141069959  -0.23057849677494854 -0.3307397445958925 -0.91512008947987189
-0.40356854994762748 -1.0536963168239357 -0.52293928186267569  -0.79638679287413106 -0.30395970967361924 -0.52285425410030384
-0.54592445534311895 -0.68100371799927473 -0.75327597529184542  -0.65388144479235355 0.069124135183104618 -0.75343275087525374
-0.54592445534311906 -0.8189962820007255 -0.75327597529184531  -0.65388144479235311 -0.06912413518310434 -0.75343275087525408
-0.93339586248116191 0.15759811547986138 0.32187126056253412  -0.24890531892629342 0.9166339022388893 0.3127753690374398
-0.77138586605477633 -0.1010889929861338 -0.62717432611494872  -0.41977894187289966 0.6609388446318949 -0.62204942216573489
-0.79564186567445128 -0.06209942187768587 -0.60211592452938889  -0.41977894187289211 0.66093884463190167 -0.62204942216573267
-0.9324191059500162 0.15597288936521903 -0.32585692434233743  -0.24890531892628645 0.91663390223888519 -0.31277536903745745
-0.93208712065408494 0.15549608434201162 -0.32699007860623541  -0.24890531892628462 0.91663390223888308 -0.31277536903746511
-1.5308812944132866 0.16512981410699579 0.23033669342916971  0.33073974459589195 0.91512008947987211 0.2305784967749489
-1.5308812944132868 0.16512981410699579 -0.23033669342916979  0.33073974459589117 0.91512008947987222 -0.23057849677494904
-1.4618850124125609 0.20777186148081683 -0.11869836405462342  0.26161560941278672 0.95784115446597362 -0.1187332966057424
-1.8345776112372223 -0.022564831948353237 -0.2610542694501149  0.6346994542695108 0.72726265769102516 -0.26123864468751956
-2.1577718614808168 -0.63130163594537669 -0.26188501241256057  0.9578411544659734 0.11873329660574439 -0.26161560941278617
-1.9274351680516475 -0.48894573054988527 -0.63457761123722156  0.72726265769102494 0.26123864468751845 -0.63469945426951124
-2.1577718614808168 -0.86869836405462331 0.26188501241256057  0.95784115446597395 -0.11873329660574229 0.26161560941278522
-1.9274351680516475 -1.0110542694501148 0.63457761123722156  0.72726265769102483 -0.26123864468751862 0.63469945426951135
-1.3186983640546237 -1.0118850124125609 0.95777186148081683  0.11873329660574097 -0.26161560941278544 0.95784115446597407
-1.4610542694501154 -1.3845776112372215 0.72743516805164721  0.26123864468751906 -0.63469945426951135 0.72726265769102472
-1.5036963168239363 -1.2729392818626759 0.79643145005237215  0.30395970967362046 -0.52285425410030517 0.79638679287412972
-1.1310037179992749 -1.5032759752918454 0.65407554465688122  -0.069124135183103216 -0.75343275087525341 0.65388144479235411
-0.56542238876277806 -1.4774351680516471 0.2610542694501149  -0.63469945426951235 -0.72726265769102405 0.26123864468751862
-0.93811498758743972 -1.7077718614808171 0.11869836405462342  -0.26161560941278633 -0.9578411544659734 0.11873329660574466
-0.86911870558671378 -1.6651298141069959 0.23033669342916985  -0.33073974459589256 -0.91512008947987211 0.2305784967749481
-0.86911870558671411 -1.6651298141069959 -0.23033669342916996  -0.33073974459589112 -0.91512008947987222 -0.23057849677494971
-0.89630368317606424 -1.2729392818626755 -0.79643145005237259  -0.30395970967362035 -0.52285425410030406 -0.7963867928741305
-1.2689962820007255 -1.5032759752918454 -0.65407554465688122  0.069124135183103272 -0.75343275087525341 -0.65388144479235399
-1.1310037179992742 -1.5032759752918454 -0.65407554465688122  -0.069124135183102828 -0.7534327508752543 -0.65388144479235299
-1.5036963168239361 -1.2729392818626759 -0.79643145005237226  0.30395970967362002 -0.52285425410030251 -0.79638679287413161
-1.8540755446568815 -0.68100371799927462 -0.75327597529184498  0.65388144479235388 0.069124135183104771 -0.75343275087525341
-1.9964314500523725 -1.0536963168239355 -0.52293928186267535  0.7963867928741305 -0.30395970967362024 -0.52285425410030406
-1.9274351680516473 -1.0110542694501146 -0.63457761123722178  0.72726265769102438 -0.26123864468751906 -0.63469945426951169
-2.1577718614808168 -0.86869836405462353 -0.26188501241256051  0.95784115446597418 -0.11873329660574188 -0.26161560941278472
-2.1151298141069961 -0.51966330657083049 0.33088129441328584  0.91512008947987278 0.23057849677494929 0.33073974459588984
-2.1151298141069961 -0.98033669342916963 0.33088129441328579  0.91512008947987278 -0.23057849677494949 0.33073974459588962
-2.1151298141069961 -0.98033669342916974 -0.33088129441328584  0.91512008947987245 -0.23057849677494999 -0.33073974459589017
-2.1151298141069956 -0.51966330657083037 -0.3308812944132859  0.91512008947987389 0.23057849677494746 -0.33073974459588784
-1.7229392818626761 0.046431450052372147 -0.30369631682393572  0.52285425410030584 0.79638679287412983 -0.30395970967361896
-1.9532759752918456 -0.095924455343119219 0.068996282000725412  0.75343275087525408 0.65388144479235322 0.069124135183104798
-0.93811498758743939 -1.7077718614808171 -0.11869836405462345  -0.26161560941278678 -0.95784115446597351 -0.11873329660574286
-0.56542238876277817 -1.4774351680516471 -0.26105426945011495  -0.63469945426951146 -0.72726265769102461 -0.26123864468751906
-0.93339586248116191 0.15759811547986141 -0.32187126056253423  -0.24890531892696513 0.91663390223878349 -0.31277536903721526
-0.47256483194835297 -1.0110542694501148 -0.63457761123722201  -0.72726265769102472 -0.26123864468751967 -0.63469945426951113
-0.67706071813732449 -1.5464314500523724 -0.30369631682393589  -0.52285425410030395 -0.79638679287413083 -0.30395970967361974
-0.44672402470815431 -1.4040755446568807 0.068996282000725453  -0.75343275087525341 -0.65388144479235355 0.069124135183106797
-0.47256483194835297 -1.0110542694501148 0.63457761123722212  -0.72726265769102472 -0.26123864468751851 0.63469945426951158
-0.24336599009814619 -0.94602936533555493 -0.21094260961626565  -0.95495693252433878 -0.19745303394970987 -0.22151649240578075
-0.44672402470815431 -1.4040755446568807 -0.068996282000725495  -0.75343275087525352 -0.65388144479235355 -0.069124135183106797
-0.67706071813732438 -1.5464314500523724 0.30369631682393589  -0.52285425410030462 -0.79638679287412983 0.30395970967362074
-1.2689962820007261 -1.5032759752918452 0.65407554465688111  0.069124135183104188 -0.7534327508752543 0.65388144479235299
-0.89630368317606457 -1.2729392818626759 0.79643145005237248  -0.30395970967361879 -0.52285425410030428 0.79638679287413083
-0.87006466098054647 0.056547496445093395 0.48863305375424759  -0.31909818315151856 0.81512028618526478 0.48348243872828733
-0.86048662890264316 0.042111562758920092 0.50664961250726259  -0.31909818315149469 0.81512028618527133 0.48348243872829194
-0.28487018589300406 -0.98033669342916951 0.33088129441328606  -0.91512008947987256 -0.2305784967749484 0.33073974459589089
-0.79934060742300872 -0.055862651692236032 -0.59790562905682221  -0.3776341406276017 0.67726348918452928 -0.6314321990919135
-1.813538519485719 -0.28952821920598959 0.64151089172333209  0.61382359089386351 0.46011525660259994 0.6414939983380098
-1.6215187719833619 -0.28136426493733929 0.77633914798103421  0.4217740975073348 0.46868822204941907 0.77616877106981552
-1.3378197789939481 0.17483674698373319 0.35451755943338797  0.13818785834076916 0.92488389215866984 0.35425118465944683
-1.3392917641443463 0.065235707638635065 0.56212858442930091  0.13924301275047288 0.81541586445899028 0.56187930322158097
-0.36998650939197825 -0.74269333684247574 -0.5567855194421365  -0.83494479465357796 0.020957685934287547 -0.54993450999293936
-0.86456827261077818 -0.05598545619885309 0.63704738383668813  -0.33571718293160885 0.69398814937561948 0.63692575831934095
-0.73563503381027773 -0.6800696519575018 0.88287877117884839  -0.46476863555606884 0.069884317336659077 0.88266998226615767
-0.85340002742402565 -0.47750422818221461 0.89756031181852258  -0.34672764240957121 0.27221405186828174 0.89759648615318943
-1.4413678794555167 -0.81788943095144961 0.9680560789191065  0.24117598392814868 -0.068303541004111096 0.96807477555330868
-1.3212211638374884 -0.6167959923265609 0.98364735641266221  0.12142771508337506 0.13297103911781064 0.98365340072891549
-0.9586321205444841 -0.81788943095144961 -0.96805607891910683  -0.24117598392814762 -0.068303541004109888 -0.96807477555330901
-1.0787788361625117 -0.6167959923265609 -0.98364735641266243  -0.12142771508337302 0.13297103911781002 -0.98365340072891583
-0.31682936237190812 -0.8280363774210906 0.46105412139556601  -0.87829625280902435 -0.071121388581576156 0.47279746233229181
-0.77848122801663844 -0.28136426493733918 -0.77633914798103432  -0.42177409750733558 0.46868822204941951 -0.77616877106981486
-1.0621802210060525 0.17483674698373319 -0.35451755943338797  -0.13818785834076996 0.92488389215866984 -0.35425118465944661
-1.0607082358556541 0.065235707638635065 -0.56212858442930091  -0.13924301275047191 0.81541586445899095 -0.56187930322158008
-1.7283612117454608 -0.066531132471783216 -0.50369111272938416  0.52841879760671218 0.68370790823052074 -0.50330613999724105
-1.535431727389222 -0.055985456198853201 -0.63704738383668802  0.33571718293160874 0.69398814937561726 -0.63692575831934339
-1.6643649661897226 -0.68006965195750169 -0.88287877117884805  0.46476863555606884 0.069884317336658813 -0.88266998226615767
-1.5465999725759745 -0.47750422818221466 -0.89756031181852236  0.34672764240957321 0.27221405186828163 -0.89759648615318877
-1.269930348042499 -1.6328787711788482 0.46436496618972256  0.069884317336661395 -0.88266998226615756 0.46476863555606868
-1.472495771817786 -1.6475603118185222 0.3465999725759743  0.27221405186828207 -0.89759648615318977 0.34672764240957044
-1.1321105690485505 -1.7180560789191066 -0.24136787945551619  -0.06830354100410907 -0.96807477555330834 -0.24117598392815071
-1.3332040076734395 -1.7336473564126622 -0.12122116383748834  0.13297103911781141 -0.98365340072891572 -0.12142771508337305
-1.6604717807940104 -1.3915108917233319 -0.61353851948571902  0.46011525660260238 -0.64149399833800946 -0.61382359089386218
-1.6686357350626613 -1.5263391479810342 -0.42151877198336174  0.46868822204941957 -0.77616877106981552 -0.42177409750733424
-2.1248367469837333 -1.1045175594333876 -0.13781977899394773  0.92488389215866973 -0.35425118465944666 -0.13818785834077044
-2.0152357076386354 -1.3121285844293 -0.13929176414434613  0.81541586445899117 -0.56187930322157997 -0.1392430127504713
-1.8834688675282174 -1.2536911127293839 0.52836121174546025  0.68370790823052174 -0.50330613999723939 0.5284187976067124
-1.8940145438011475 -1.3870473838366877 0.33543172738922156  0.69398814937561737 -0.63692575831934373 0.33571718293160802
-1.8415108917233325 -0.13646148051428153 0.46047178079401069  0.64149399833800991 0.61382359089386218 0.46011525660260166
-1.9763391479810344 -0.32848122801663865 0.46863573506266099  0.77616877106981563 0.42177409750733585 0.4686882220494179
-0.73563503381027773 -0.81993034804249798 -0.88287877117884839  -0.46476863555606895 -0.069884317336658938 -0.88266998226615767
-0.85340002742402565 -1.0224957718177852 -0.89756031181852258  -0.34672764240957199 -0.27221405186828146 -0.89759648615318932
-0.39895802436542988 -0.69687753315555612 -0.5957410107715313  -0.7996715905934344 0.02252867497836334 -0.60001483815109602
-0.40036321981550371 -0.69465247190942381 -0.5975302451883705  -0.79967159059346238 0.022528674978334662 -0.60001483815105972
-0.84548244056661248 -0.88781977899394804 0.9248367469837333  -0.35425118465944566 -0.13818785834076999 0.92488389215867017
-0.6378714155706996 -0.88929176414434641 0.8152357076386354  -0.56187930322157897 -0.13924301275047021 0.81541586445899217
-0.74055958467102845 -0.15027494754537968 -0.65399889841309089  -0.476239267037872 0.60557549052406878 -0.63755351603435151
-0.84685829520082545 0.019286849148286479 -0.53075413092765555  -0.36351224121617526 0.75900083470875201 -0.54016347840020695
-0.9586321205444841 -0.6821105690485505 0.96805607891910683  -0.24117598392814787 0.068303541004110624 0.9680747755533089
-1.0787788361625121 -0.88320400767343932 0.98364735641266243  -0.12142771508337306 -0.13297103911780989 0.98365340072891583
-1.7036911127293846 -1.2783612117454606 0.68346886752821678  0.5033061399972415 -0.52841879760671184 0.68370790823052063
-1.8370473838366883 -1.0854317273892216 0.69401454380114669  0.63692575831934417 -0.33571718293160874 0.69398814937561659
-1.5545175594333884 -0.61218022100605229 0.92483674698373297  0.35425118465944661 0.13818785834076955 0.92488389215866984
-1.7621285844293011 -0.61070823585565404 0.81523570763863507  0.56187930322158131 0.13924301275047232 0.81541586445899017
-2.1248367469837333 -0.39548244056661236 0.13781977899394779  0.92488389215867051 0.35425118465944377 0.13818785834077252
-2.0152357076386354 -0.18787141557069942 0.13929176414434624  0.81541586445899117 0.5618793032215802 0.13924301275047049
-1.6604717807940104 -0.10848910827666802 0.61353851948571902  0.46011525660260155 0.64149399833800957 0.61382359089386263
-1.6686357350626613 0.026339147981034206 0.42151877198336174  0.46868822204941946 0.77616877106981474 0.42177409750733585
-1.2678894309514497 0.21805607891910661 -0.24136787945551616  0.06830354100410925 0.96807477555330879 -0.24117598392814882
-1.0667959923265611 0.23364735641266243 -0.12122116383748828  -0.13297103911780939 0.98365340072891605 -0.12142771508337256
-1.130069651957502 0.13287877117884817 0.46436496618972245  -0.069884317336658841 0.88266998226615756 0.46476863555606901
-0.92750422818221478 0.14756031181852258 0.34659997257597436  -0.27221405186827224 0.89759648615319176 0.34672764240957293
-0.8348259841132093 -6.1457978060811826e-19 -0.5497573450331017  -0.3635122412161757 0.75900083470875102 -0.5401634784002084
-0.27399725512977041 -0.89741802080743249 -0.34558774394436126  -0.91762341400860226 -0.15318437572866117 -0.36674489375561553
-0.6963088872706158 -0.22163878825453964 0.68346886752821701  -0.50330613999723917 0.52841879760671318 0.68370790823052141
-0.27461092234606044 -0.89644305776905853 -0.34753041451074085  -0.91762341400861724 -0.15318437572861182 -0.36674489375559871
-0.58646148051428126 -1.2104717807940111 0.64151089172333209  -0.61382359089386329 -0.46011525660260089 0.64149399833800924
-0.77848122801663866 -1.2186357350626613 0.77633914798103421  -0.42177409750733541 -0.4686882220494189 0.7761687710698153
-1.7036911127293846 -0.22163878825453975 -0.68346886752821689  0.50330613999723972 0.52841879760671195 -0.68370790823052185
-1.8370473838366883 -0.41456827261077839 -0.69401454380114669  0.63692575831934395 0.33571718293160824 -0.69398814937561704
-1.813538519485719 -1.2104717807940109 -0.64151089172333209  0.61382359089386318 -0.46011525660260083 -0.64149399833800946
-1.6215187719833617 -1.2186357350626611 -0.77633914798103409  0.42177409750733474 -0.46868822204941712 -0.77616877106981674
-1.4413678794555165 -0.6821105690485505 -0.96805607891910661  0.24117598392814851 0.068303541004111096 -0.96807477555330879
-1.3212211638374884 -0.88320400767343932 -0.98364735641266221  0.12142771508337399 -0.13297103911781122 -0.98365340072891561
-0.69630888727061557 -1.2783612117454601 -0.68346886752821723  -0.50330613999723961 -0.52841879760671184 -0.68370790823052208
-0.56295261616331194 -1.085431727389222 -0.69401454380114702  -0.63692575831934406 -0.33571718293160863 -0.6939881493756167
-0.84548244056661226 -0.61218022100605229 -0.92483674698373319  -0.35425118465944577 0.13818785834076949 -0.92488389215867028
-0.63787141557069948 -0.61070823585565404 -0.81523570763863551  -0.56187930322158008 0.1392430127504711 -0.81541586445899106
-0.27219661039719123 -0.89987434907152986 -0.34005641981910134  -0.91762341400861669 -0.15318437572860499 -0.36674489375560293
-0.23294949527472619 -0.96194916611186088 -0.13775142693846473  -0.95825269159637794 -0.23889893330366177 -0.15709576287942825
-0.7956418656744515 -0.062099421877685829 0.60211592452938856  -0.41977894187290332 0.66093884463189934 0.62204942216572778
-0.77138586605477644 -0.10108899298613383 0.62717432611494861  -0.41977894187289733 0.66093884463190189 0.62204942216572912
-1.1321105690485505 0.21805607891910661 0.24136787945551616  -0.068303541004109528 0.96807477555330901 0.24117598392814815
-1.3332040076734395 0.23364735641266221 0.12122116383748827  0.13297103911781022 0.98365340072891572 0.12142771508337367
-1.2699303480424986 0.13287877117884817 -0.46436496618972245  0.069884317336659327 0.88266998226615756 -0.46476863555606901
-1.4724957718177856 0.14756031181852225 -0.34659997257597425  0.27221405186828102 0.89759648615318954 -0.34672764240957166
-2.0828787711788483 -0.28563503381027772 -0.069930348042498203  0.88266998226615612 0.4647686355560719 -0.069884317336658563
-2.0975603118185226 -0.40340002742402592 -0.27249577181778528  0.89759648615318943 0.34672764240957138 -0.27221405186828163
-2.0828787711788483 -1.214364966189722 0.069930348042498189  0.882669982266157 -0.46476863555607045 0.069884317336658466
-2.0975603118185226 -1.0965999725759743 0.27249577181778517  0.89759648615318977 -0.34672764240957166 0.27221405186828074
-1.6643649661897226 -0.8199303480424982 0.88287877117884805  0.46476863555606768 -0.069884317336659424 0.88266998226615823
-1.5465999725759745 -1.0224957718177856 0.89756031181852236  0.34672764240957343 -0.27221405186828251 0.89759648615318843
-1.7283612117454608 -1.4334688675282168 0.50369111272938427  0.52841879760671107 -0.6837079082305203 0.50330613999724272
-1.5354317273892222 -1.4440145438011467 0.63704738383668802  0.33571718293160768 -0.69398814937561715 0.63692575831934406
-0.73952821920598932 -1.3915108917233319 0.61353851948571902  -0.46011525660260205 -0.64149399833800935 0.6138235908938624
-0.73136426493733908 -1.5263391479810342 0.42151877198336185  -0.46868822204941846 -0.77616877106981585 0.42177409750733491
-1.2678894309514497 -1.7180560789191066 0.24136787945551616  0.068303541004109777 -0.96807477555330868 0.2411759839281494
-1.0667959923265609 -1.7336473564126624 0.12122116383748836  -0.13297103911781086 -0.98365340072891561 0.12142771508337438
-0.6716387882545396 -1.4334688675282168 -0.50369111272938449  -0.52841879760671095 -0.68370790823052274 -0.50330613999723961
-0.86456827261077818 -1.4440145438011469 -0.63704738383668824  -0.33571718293160935 -0.69398814937561693 -0.6369257583193435
-1.3378197789939481 -1.6748367469837331 -0.35451755943338797  0.13818785834076763 -0.92488389215866973 -0.35425118465944772
-1.3392917641443463 -1.5652357076386352 -0.56212858442930091  0.13924301275047099 -0.81541586445899183 -0.56187930322157909
-1.5545175594333882 -0.88781977899394793 -0.92483674698373297  0.35425118465944549 -0.13818785834077002 -0.92488389215867028
-1.7621285844293011 -0.8892917641443463 -0.81523570763863507  0.56187930322158108 -0.13924301275047279 -0.81541586445899028
-1.8415108917233325 -1.3635385194857186 -0.46047178079401058  0.64149399833801046 -0.61382359089386207 -0.46011525660260105
-1.9763391479810344 -1.1715187719833615 -0.46863573506266087  0.77616877106981574 -0.42177409750733497 -0.46868822204941857
-2.1680560789191068 -0.50863212054448415 -0.067889430951449614  0.9680747755533089 0.24117598392814829 -0.068303541004110124
-2.1836473564126626 -0.62877883616251184 0.13320400767343912  0.98365340072891605 0.12142771508337218 0.13297103911780914
-2.1680560789191068 -0.99136787945551619 0.067889430951449573  0.96807477555330879 -0.2411759839281484 0.068303541004110568
-2.1836473564126626 -0.87122116383748793 -0.13320400767343907  0.98365340072891616 -0.12142771508337166 -0.13297103911780908
-1.8834688675282174 -0.24630888727061584 -0.52836121174546025  0.6837079082305223 0.50330613999724005 -0.52841879760671107
-1.8940145438011473 -0.1129526161633122 -0.33543172738922167  0.69398814937561726 0.63692575831934362 -0.33571718293160829
-1.130069651957502 -1.6328787711788482 -0.46436496618972267  -0.069884317336660201 -0.88266998226615734 -0.4647686355560694
-0.92750422818221478 -1.6475603118185225 -0.34659997257597441  -0.27221405186828429 -0.89759648615318854 -0.34672764240957188
-0.31712122882115168 -1.2143649661897222 -0.06993034804249823  -0.88266998226615745 -0.4647686355560694 -0.069884317336659077
-0.30243968818147737 -1.0965999725759743 -0.27249577181778545  -0.89759648615318932 -0.34672764240957199 -0.27221405186828124
-0.51653113247178317 -1.2536911127293844 -0.52836121174546036  -0.68370790823052185 -0.50330613999724083 -0.52841879760671084
-0.50598545619885282 -1.3870473838366881 -0.33543172738922172  -0.69398814937561759 -0.6369257583193435 -0.33571718293160802
-0.55848910827666798 -1.3635385194857188 0.46047178079401091  -0.64149399833800957 -0.61382359089386285 0.46011525660260122
-0.42366085201896597 -1.1715187719833617 0.46863573506266121  -0.77616877106981463 -0.42177409750733569 0.46868822204941984
-0.27516325301626676 -1.104517559433388 0.13781977899394782  -0.92488389215866995 -0.35425118465944622 0.1381878583407698
-0.38476429236136467 -1.3121285844293005 0.13929176414434624  -0.81541586445899006 -0.56187930322158131 0.13924301275047321
-1.0621802210060525 -1.6748367469837331 0.35451755943338797  -0.13818785834076944 -0.92488389215866995 0.35425118465944638
-1.0607082358556541 -1.5652357076386352 0.56212858442930091  -0.13924301275047085 -0.81541586445899195 0.56187930322157909
-0.75366980899531777 -0.12957223153317302 -0.64334361719230837  -0.43611560071017613 0.62405012717396391 -0.64835532047740763
-0.97237322050691288 0.22053761901938193 0.067701629511043915  -0.24109601889304647 0.96718604322533441 0.080149032832876388
-0.23194392108089312 -0.99136787945551608 -0.067889430951449628  -0.9680747755533089 -0.24117598392814812 -0.068303541004111068
-0.23294949527472616 -0.96194916611186088 0.13775142693846476  -0.95825269159637749 -0.23889893330366066 0.15709576287943319
-1.2616533189164061 -0.15498399644609528 0.80134563315795981  0.062410317894398951 0.59583045652862776 0.80068159669946648
-1.4133191789074442 -0.29662405620460919 0.86541618975952417  0.21403145679805605 0.4530882925139984 0.86539097215515914
-1.441367879455516 -0.6821105690485505 0.96805607891910661  0.24117598392814843 0.06830354100411086 0.96807477555330879
-1.5465999725759745 -0.47750422818221472 0.89756031181852247  0.34672764240957199 0.27221405186828224 0.8975964861531891
-1.1383466810835945 -0.15498399644609528 0.8013456331579597  -0.062410317894398472 0.59583045652862832 0.80068159669946615
-1.3318385030170197 -0.083304877297165847 0.73357768674250456  0.13227871496285457 0.66711974931205487 0.73311225719230544
-1.7036911127293843 -0.22163878825453986 0.68346886752821701  0.50330613999724005 0.5284187976067114 0.68370790823052208
-1.535431727389222 -0.05598545619885309 0.63704738383668813  0.33571718293160813 0.69398814937561681 0.63692575831934428
-1.1002428344740192 -0.25474116197207619 0.86299895207436539  -0.10098201560182286 0.49484844092680497 0.86309191459386503
-1.0681614969829809 -0.083304877297165625 0.73357768674250445  -0.13227871496285332 0.66711974931205542 0.73311225719230522
-1.2699303480424986 0.13287877117884817 0.46436496618972251  0.069884317336659757 0.88266998226615756 0.4647686355560689
-1.0607082358556541 0.065235707638635065 0.56212858442930091  -0.13924301275047329 0.8154158644589905 0.56187930322158053
-1.2000000000000006 -0.31639448088848182 0.90110279868394094  9.157758738413012e-16 0.43243812303240742 0.90166361230128855
-0.98668082109255706 -0.29662405620460913 0.86541618975952428  -0.21403145679805541 0.45308829251399813 0.86539097215515937
-0.96740524816676143 0.21237493457549977 -0.13494008765512311  -0.21828391900495059 0.96858479771762296 -0.11914537479126736
-0.77848122801663822 -0.28136426493733913 0.77633914798103421  -0.42177409750733569 0.46868822204941801 0.77616877106981574
-1.2997571655259812 -0.25474116197207625 0.86299895207436539  0.10098201560182227 0.49484844092680502 0.86309191459386503
-1.2000000000000002 -0.42846255922162907 0.94689686564994791  0 0.32080957755114498 0.94714371399036168
-0.84548244056661226 -0.61218022100605229 0.92483674698373319  -0.35425118465944555 0.13818785834076991 0.92488389215867028
-1.0787788361625121 -0.61679599232656102 0.98364735641266243  -0.12142771508337273 0.13297103911781 0.98365340072891594
-1.1002428344740194 -0.25474116197207625 -0.86299895207436539  -0.10098201560182141 0.49484844092680558 -0.86309191459386492
-1.2000000000000002 -0.42846255922162907 -0.94689686564994791  0 0.32080957755114492 -0.94714371399036157
-1.5545175594333882 -0.61218022100605218 -0.92483674698373297  0.35425118465944533 0.13818785834077094 -0.92488389215867017
-1.3212211638374884 -0.61679599232656102 -0.98364735641266243  0.12142771508337498 0.13297103911781041 -0.98365340072891561
-1.1383466810835945 -0.15498399644609517 -0.80134563315795992  -0.06241031789439843 0.59583045652862821 -0.80068159669946615
-0.98668082109255639 -0.29662405620460919 -0.86541618975952417  -0.21403145679805724 0.45308829251399907 -0.86539097215515848
-0.9586321205444841 -0.6821105690485505 -0.96805607891910683  -0.24117598392814807 0.068303541004110485 -0.9680747755533089
-0.85340002742402576 -0.47750422818221466 -0.89756031181852258  -0.3467276424095721 0.27221405186828296 -0.89759648615318877
-1.2616533189164061 -0.15498399644609495 -0.80134563315795981  0.062410317894398756 0.59583045652862843 -0.80068159669946604
-1.0681614969829805 -0.083304877297165847 -0.73357768674250456  -0.13227871496285418 0.66711974931205509 -0.73311225719230522
-0.69630888727061568 -0.22163878825453975 -0.68346886752821712  -0.5033061399972365 0.52841879760671595 -0.68370790823052119
-0.86456827261077818 -0.055985456198852979 -0.63704738383668824  -0.33571718293160824 0.69398814937561681 -0.63692575831934406
-1.2997571655259814 -0.25474116197207619 -0.86299895207436528  0.10098201560182249 0.49484844092680558 -0.8630919145938647
-1.3318385030170203 -0.083304877297165625 -0.73357768674250434  0.13227871496285412 0.6671197493120552 -0.73311225719230522
-1.130069651957502 0.13287877117884817 -0.46436496618972251  -0.069884317336659202 0.88266998226615734 -0.46476863555606962
-1.3392917641443458 0.065235707638635065 -0.56212858442930091  0.13924301275047374 0.81541586445899017 -0.56187930322158108
-1.2 -0.31639448088848182 -0.90110279868394094  -1.9190373885465895e-16 0.43243812303240803 -0.90166361230128833
-1.4133191789074437 -0.29662405620460919 -0.86541618975952417  0.21403145679805624 0.4530882925139984 -0.86539097215515903
-1.660471780794011 -0.10848910827666802 -0.61353851948571891  0.46011525660260161 0.64149399833800957 -0.61382359089386251
-1.6215187719833619 -0.28136426493733918 -0.77633914798103409  0.42177409750733585 0.46868822204941907 -0.77616877106981497
-1.6336055191115184 -1.6511027986839406 1.2262216765384848e-18  0.43243812303240881 -0.901663612301288 0
-1.6533759437953914 -1.6154161897595238 0.21331917890744345  0.45308829251399907 -0.86539097215515859 0.21403145679805674
-1.8415108917233329 -1.3635385194857184 0.46047178079401052  0.64149399833801035 -0.6138235908938614 0.46011525660260194
-1.6686357350626613 -1.5263391479810342 0.42151877198336157  0.46868822204941846 -0.77616877106981552 0.42177409750733541
-1.6952588380279243 -1.6129989520743651 -0.099757165525981017  0.49484844092680391 -0.86309191459386592 -0.10098201560182096
-1.5215374407783711 -1.6968968656499479 1.2287154012371122e-18  0.32080957755114675 -0.94714371399036101 0
-1.3378197789939481 -1.6748367469837331 0.35451755943338803  0.13818785834076741 -0.92488389215866973 0.35425118465944772
-1.3332040076734395 -1.7336473564126622 0.12122116383748834  0.13297103911780994 -0.98365340072891549 0.12142771508337556
-1.7950160035539056 -1.5513456331579594 -0.061653318916405561  0.5958304565286302 -0.80068159669946459 -0.062410317894398229
-1.6533759437953917 -1.6154161897595238 -0.21331917890744354  0.45308829251399879 -0.8653909721551587 -0.2140314567980571
-1.2678894309514499 -1.7180560789191066 -0.24136787945551624  0.068303541004109722 -0.96807477555330856 -0.24117598392814962
-1.4724957718177856 -1.6475603118185225 -0.34659997257597425  0.27221405186828235 -0.89759648615318899 -0.34672764240957232
-1.7950160035539053 -1.5513456331579594 0.06165331891640554  0.59583045652862943 -0.80068159669946526 0.062410317894399124
-1.8666951227028346 -1.4835776867425041 -0.13183850301701966  0.66711974931205498 -0.73311225719230544 -0.13227871496285429
-1.7283612117454605 -1.433468867528217 -0.50369111272938405  0.5284187976067114 -0.68370790823052219 -0.50330613999723994
-1.8940145438011475 -1.3870473838366877 -0.33543172738922156  0.69398814937561792 -0.63692575831934295 -0.33571718293160829
-1.6952588380279243 -1.6129989520743651 0.099757165525981017  0.49484844092680469 -0.86309191459386547 0.10098201560182077
-1.8666951227028352 -1.4835776867425037 0.13183850301701966  0.66711974931205487 -0.73311225719230544 0.13227871496285468
-2.0828787711788483 -1.214364966189722 -0.069930348042498189  0.88266998226615656 -0.4647686355560709 -0.069884317336658744
-2.0152357076386354 -1.3121285844293002 0.13929176414434616  0.81541586445899006 -0.56187930322158142 0.13924301275047221
-2.00134563315796 -0.68834668108359442 0.5950160035539046  0.80068159669946726 0.06241031789439886 0.59583045652862676
-2.0654161897595245 -0.53668082109255666 0.45337594379539081  0.8653909721551587 0.21403145679805544 0.45308829251399957
-2.1680560789191068 -0.50863212054448403 0.067889430951449614  0.9680747755533089 0.2411759839281481 0.068303541004110152
-2.0975603118185226 -0.40340002742402592 0.27249577181778528  0.89759648615319054 0.34672764240957116 0.27221405186827852
-1.2 -1.1836055191115182 -0.90110279868394083  0 -0.43243812303240803 -0.90166361230128822
-0.98668082109255706 -1.203375943795391 -0.86541618975952428  -0.21403145679805596 -0.45308829251399907 -0.86539097215515881
-0.73952821920598932 -1.3915108917233323 -0.61353851948571902  -0.46011525660259944 -0.64149399833801035 -0.61382359089386329
-0.77848122801663822 -1.2186357350626609 -0.77633914798103421  -0.42177409750733474 -0.46868822204941779 -0.7761687710698163
-0.96947353031104488 0.21592607882051251 -0.10986054425367317  -0.21828391900495039 0.96858479771762307 -0.11914537479126724
-0.27461092234606033 -0.8964430577690583 0.34753041451074085  -0.91762341400861691 -0.15318437572861171 0.36674489375559954
-0.27516325301626687 -1.104517559433388 -0.13781977899394784  -0.92488389215867006 -0.35425118465944566 -0.13818785834077024
-0.27399725512977041 -0.89741802080743227 0.34558774394436154  -0.91762341400861713 -0.15318437572861274 0.3667448937555986
-0.27219661039719134 -0.89987434907152952 0.34005641981910195  -0.91762341400860037 -0.15318437572866428 0.36674489375561903
-0.46642231325749572 -0.8818385030170196 0.66669512270283449  -0.73311225719230444 -0.13227871496285387 0.66711974931205609
-0.51653113247178306 -1.2536911127293846 0.52836121174546025  -0.68370790823052296 -0.50330613999723894 0.52841879760671118
-0.56295261616331205 -1.085431727389222 0.69401454380114724  -0.6369257583193435 -0.33571718293160818 0.69398814937561748
-0.89270251295960135 0.092787072853812713 0.43974499787970978  -0.29815500373095838 0.84204499011931433 0.44951510360070884
-0.88525794997176432 0.0810906962302608 0.4567171564832469  -0.29815500373095821 0.84204499011931477 0.44951510360070823
-0.50468001700647158 -0.52828837108788052 0.68272481536695295  -0.70341121140136764 0.24317084427688976 0.66789266216101317
-0.50392422938731019 -0.52945918848859996 0.68235511400187066  -0.70341121140129059 0.24317084427684102 0.66789266216111209
-1.1002428344740194 -1.2452588380279237 0.86299895207436539  -0.10098201560182121 -0.49484844092680513 0.86309191459386514
-1.2000000000000002 -1.0715374407783713 0.94689686564994791  9.5216402656098607e-16 -0.32080957755114448 0.94714371399036179
-1.5545175594333882 -0.88781977899394793 0.92483674698373297  0.35425118465944611 -0.13818785834077024 0.92488389215866995
-1.3212211638374884 -0.88320400767343932 0.98364735641266221  0.12142771508337376 -0.13297103911781119 0.98365340072891561
-2.0629989520743655 -0.84975716552598102 0.4952588380279237  0.86309191459386403 -0.10098201560182107 0.49484844092680708
-1.9335776867425047 -0.88183850301701949 0.66669512270283382  0.73311225719230544 -0.13227871496285235 0.66711974931205531
-1.6643649661897226 -0.6800696519575018 0.88287877117884805  0.46476863555606757 0.06988431733665959 0.88266998226615834
-1.7621285844293006 -0.88929176414434641 0.81523570763863507  0.56187930322158097 -0.13924301275047249 0.81541586445899028
-2.00134563315796 -0.81165331891640569 0.5950160035539046  0.80068159669946659 -0.062410317894398798 0.59583045652862765
-1.9335776867425047 -0.61816149698298051 0.66669512270283404  0.73311225719230522 0.13227871496285562 0.66711974931205487
-1.8834688675282174 -0.24630888727061595 0.52836121174546036  0.68370790823052219 0.50330613999724005 0.52841879760671107
-1.8370473838366879 -0.41456827261077828 0.69401454380114713  0.63692575831934306 0.33571718293160768 0.69398814937561815
-1.7950160035539053 0.051345633157959369 -0.06165331891640554  0.59583045652862876 0.8006815966994657 -0.062410317894399089
-1.8666951227028343 -0.016422313257495658 0.13183850301701971  0.66711974931205553 0.73311225719230511 0.13227871496285307
-1.7283612117454608 -0.066531132471783327 0.50369111272938427  0.52841879760671207 0.68370790823052185 0.5033061399972395
-1.8940145438011475 -0.11295261616331242 0.33543172738922156  0.6939881493756167 0.63692575831934406 0.33571718293160885
-1.7950160035539053 0.051345633157959369 0.061653318916405554  0.59583045652862876 0.8006815966994657 0.062410317894399124
-1.6533759437953914 0.11541618975952384 0.21331917890744345  0.45308829251399868 0.86539097215515892 0.21403145679805605
-1.2678894309514495 0.21805607891910661 0.24136787945551616  0.068303541004108681 0.96807477555330868 0.24117598392814948
-1.4724957718177856 0.14756031181852225 0.34659997257597425  0.27221405186828113 0.89759648615318943 0.34672764240957193
-0.69377314187723493 -0.22428489754399594 -0.68341702461536258  -0.54199242061157393 0.50624478547216567 -0.6707909012366281
-0.59214384399202524 -0.38815954298187871 -0.70538094374692584  -0.60285708655996906 0.35990150486608763 -0.71206336795228531
-1.062180221006052 0.17483674698373297 0.35451755943338792  -0.13818785834077096 0.92488389215866973 0.35425118465944622
-1.0667959923265609 0.23364735641266243 0.12122116383748828  -0.13297103911781005 0.98365340072891583 0.12142771508337347
-0.58303192413334481 -0.40257317574481138 -0.70495163176324016  -0.60285708655996983 0.35990150486608918 -0.71206336795228375
-0.96740524816676143 0.21237493457549983 0.13494008765512311  -0.21828391900495075 0.96858479771762207 0.11914537479127493
-0.96947353031104511 0.21592607882051257 0.10986054425367309  -0.21828391900494698 0.96858479771762385 0.11914537479126754
-0.45467325858997609 -0.60749293870920384 0.65018159643527607  -0.75649082974192372 0.15162411868602205 0.63618531195640071
-0.82493587926686529 -0.015775204470230772 -0.56417193374348928  -0.38232288700972605 0.72686052081253227 -0.57052869634461212
-0.80588150441467521 -0.045732053728024212 -0.58956860097968999  -0.38232288700972528 0.72686052081253316 -0.57052869634461145
-0.75366980899531777 -0.12957223153317304 0.64334361719230837  -0.43611560071017774 0.62405012717396091 0.64835532047740918
-0.2274342072747835 -0.97114863140943242 -0.060907607905721785  -0.97824013612619698 -0.20232952054754855 -0.045923862934193996
-0.4546732585899762 -0.60749293870920396 -0.65018159643527595  -0.75649082974192772 0.15162411868601747 -0.63618531195639716
-0.46642231325749561 -0.61816149698298017 0.66669512270283449  -0.73311225719230466 0.13227871496285407 0.66711974931205575
-0.73563503381027773 -0.8199303480424982 0.88287877117884828  -0.46476863555606918 -0.069884317336659715 0.88266998226615745
-0.63787141557069948 -0.6107082358556537 0.81523570763863529  -0.56187930322157953 0.13924301275047068 0.81541586445899161
-1.1383466810835952 -1.3450160035539049 0.80134563315795981  -0.062410317894399513 -0.59583045652862798 0.80068159669946626
-0.98668082109255706 -1.203375943795391 0.86541618975952428  -0.2140314567980553 -0.45308829251399824 0.86539097215515937
-0.9586321205444841 -0.81788943095144961 0.96805607891910683  -0.24117598392814796 -0.068303541004110541 0.9680747755533089
-0.85340002742402632 -1.0224957718177858 0.89756031181852258  -0.34672764240957188 -0.27221405186828213 0.8975964861531891
-2.0629989520743655 -0.65024283447401887 -0.49525883802792381  0.86309191459386492 0.10098201560182167 -0.49484844092680547
-1.9335776867425047 -0.61816149698298029 -0.66669512270283404  0.73311225719230511 0.13227871496285412 -0.66711974931205542
-1.6643649661897224 -0.81993034804249787 -0.88287877117884817  0.46476863555606873 -0.069884317336658605 -0.88266998226615778
-1.7621285844293006 -0.6107082358556537 -0.81523570763863507  0.56187930322158097 0.13924301275047257 -0.81541586445899028
-1.2616533189164061 -1.3450160035539049 -0.80134563315795981  0.06241031789439986 -0.59583045652862832 -0.80068159669946593
-1.4133191789074437 -1.203375943795391 -0.86541618975952417  0.21403145679805768 -0.45308829251399863 -0.86539097215515859
-1.441367879455516 -0.8178894309514495 -0.96805607891910661  0.24117598392814854 -0.068303541004110901 -0.96807477555330879
-1.5465999725759745 -1.0224957718177854 -0.89756031181852247  0.34672764240957232 -0.27221405186828262 -0.89759648615318888
-1.2997571655259812 -1.2452588380279237 -0.86299895207436539  0.10098201560182229 -0.49484844092680536 -0.86309191459386492
-1.2 -1.0715374407783713 -0.94689686564994791  3.9056046362121732e-16 -0.32080957755114525 -0.94714371399036157
-0.84548244056661226 -0.88781977899394804 -0.92483674698373319  -0.35425118465944622 -0.13818785834076933 -0.92488389215866995
-1.0787788361625117 -0.88320400767343921 -0.98364735641266243  -0.12142771508337365 -0.13297103911780928 -0.98365340072891594
-0.33700104792563468 -0.84975716552598102 -0.49525883802792392  -0.86309191459386503 -0.1009820156018222 -0.49484844092680502
-0.46642231325749561 -0.88183850301701971 -0.66669512270283449  -0.73311225719230377 -0.13227871496285343 -0.66711974931205698
-0.73563503381027773 -0.6800696519575018 -0.88287877117884828  -0.46476863555606873 0.069884317336659216 -0.88266998226615778
-0.63787141557069948 -0.8892917641443463 -0.81523570763863529  -0.56187930322158008 -0.13924301275047099 -0.81541586445899117
-0.39865436684204025 -0.8116533189164058 -0.59501600355390494  -0.80068159669946659 -0.062410317894397348 -0.59583045652862776
-0.46642231325749572 -0.6181614969829804 -0.66669512270283449  -0.73311225719230511 0.13227871496285382 -0.66711974931205531
-0.66689476317101137 -0.26866388572512034 0.69462568959831961  -0.51449014281491467 0.4889427786964583 0.70443938852599297
-0.67087146858540314 -0.2624299701285262 0.69320320770179844  -0.51449014281491512 0.48894277869645764 0.70443938852599319
-0.50787822903713031 -0.52299793234814496 -0.68413337702600852  -0.67531637414764811 0.22527759233949179 -0.70228042917184841
-0.9741085412313033 0.22323020415808842 -0  -0.24034326043217777 0.97068796076021802 -3.944304526105059e-31
-0.91382708291667858 0.12638371280443894 0.38483791504434894  -0.29603762580284138 0.87653155169613073 0.37954467851649576
-0.9094202856258099 0.11959234854368264 0.39708487175152674  -0.29603762580284188 0.87653155169612995 0.37954467851649726
-0.86048662890264316 0.042111562758920099 -0.50664961250726259  -0.319098183151515 0.81512028618526744 -0.48348243872828511
-0.87006466098054647 0.056547496445093395 -0.48863305375424759  -0.31909818315151706 0.81512028618526466 -0.48348243872828828
-1.1321105690485507 0.21805607891910683 -0.24136787945551619  -0.068303541004108806 0.96807477555330901 -0.24117598392814826
-0.92750422818221478 0.14756031181852258 -0.34659997257597436  -0.27221405186827768 0.89759648615318965 -0.34672764240957404
-1.6952588380279245 0.11299895207436506 0.099757165525981045  0.4948484409268063 0.86309191459386436 0.1009820156018217
-1.5215374407783711 0.19689686564994791 -1.2287154012371122e-18  0.32080957755114636 0.94714371399036124 0
-1.3378197789939481 0.17483674698373297 -0.35451755943338792  0.13818785834076958 0.92488389215866995 -0.35425118465944638
-1.3332040076734395 0.23364735641266221 -0.12122116383748827  0.13297103911780989 0.98365340072891572 -0.12142771508337429
-1.6336055191115184 0.15110279868394072 -1.2262216765384848e-18  0.43243812303240725 0.90166361230128866 0
-1.6533759437953914 0.11541618975952384 -0.2133191789074434  0.45308829251399885 0.86539097215515892 -0.21403145679805616
-1.8415108917233325 -0.13646148051428131 -0.46047178079401069  0.6414939983380098 0.61382359089386185 -0.46011525660260222
-1.6686357350626615 0.026339147981033872 -0.42151877198336163  0.46868822204941846 0.77616877106981563 -0.42177409750733541
-2.1011027986839408 -0.74999999999999989 -0.43360551911151807  0.90166361230128833 0 -0.43243812303240775
-2.0654161897595245 -0.53668082109255666 -0.45337594379539081  0.86539097215515925 0.21403145679805685 -0.45308829251399779
-1.8135385194857194 -0.28952821920598959 -0.64151089172333187  0.61382359089386374 0.46011525660260022 -0.64149399833800946
-1.9763391479810344 -0.32848122801663854 -0.46863573506266076  0.77616877106981574 0.42177409750733563 -0.46868822204941807
-2.1011027986839408 -0.74999999999999989 0.43360551911151807  0.901663612301288 0 0.43243812303240864
-2.0654161897595245 -0.96331917890744334 0.45337594379539059  0.86539097215515692 -0.21403145679805807 0.45308829251400151
-1.8135385194857192 -1.2104717807940104 0.64151089172333176  0.61382359089386351 -0.46011525660260016 0.64149399833800969
-1.9763391479810346 -1.1715187719833613 0.46863573506266054  0.77616877106981685 -0.42177409750733297 0.46868822204941857
-1.2000000000000002 -1.1836055191115182 0.90110279868394083  0 -0.43243812303240797 0.90166361230128833
-1.4133191789074437 -1.203375943795391 0.86541618975952417  0.21403145679805641 -0.4530882925139994 0.86539097215515848
-1.6604717807940113 -1.3915108917233319 0.6135385194857188  0.46011525660260405 -0.64149399833800913 0.61382359089386107
-1.6215187719833617 -1.2186357350626613 0.77633914798103398  0.4217740975073353 -0.46868822204941846 0.77616877106981563
-1.2997571655259814 -1.2452588380279237 0.86299895207436528  0.10098201560182322 -0.4948484409268053 0.86309191459386481
-1.3318385030170203 -1.4166951227028344 0.73357768674250423  0.13227871496285376 -0.66711974931205564 0.73311225719230499
-1.130069651957502 -1.6328787711788482 0.46436496618972251  -0.069884317336660493 -0.882669982266157 0.4647686355560699
-1.3392917641443465 -1.5652357076386352 0.56212858442930091  0.1392430127504706 -0.81541586445899106 0.56187930322158042
-0.60498399644609502 -1.5513456331579596 0.061653318916405589  -0.59583045652862721 -0.80068159669946681 0.062410317894399457
-0.74662405620460892 -1.6154161897595241 0.21331917890744362  -0.45308829251400046 -0.86539097215515781 0.21403145679805693
-1.1321105690485507 -1.7180560789191068 0.24136787945551627  -0.068303541004109888 -0.96807477555330856 0.24117598392814943
-0.92750422818221478 -1.6475603118185225 0.3465999725759743  -0.27221405186828312 -0.8975964861531881 0.34672764240957366
-0.70474116197207626 -1.6129989520743653 0.099757165525981073  -0.49484844092680585 -0.8630919145938647 0.10098201560182098
-0.87846255922162908 -1.6968968656499479 -1.2287154012371124e-18  -0.32080957755114681 -0.94714371399036101 0
-1.0621802210060525 -1.6748367469837331 -0.35451755943338803  -0.13818785834076586 -0.9248838921586704 -0.35425118465944672
-1.0667959923265606 -1.7336473564126624 -0.12122116383748836  -0.13297103911781097 -0.98365340072891561 -0.12142771508337447
-1.1002428344740192 -1.2452588380279237 -0.86299895207436528  -0.10098201560182209 -0.49484844092680519 -0.86309191459386503
-1.0681614969829802 -1.4166951227028344 -0.73357768674250434  -0.13227871496285312 -0.66711974931205453 -0.73311225719230599
-1.2699303480424979 -1.6328787711788482 -0.46436496618972256  0.069884317336660964 -0.88266998226615756 -0.46476863555606862
-1.0607082358556541 -1.5652357076386352 -0.56212858442930091  -0.13924301275047007 -0.81541586445899161 -0.56187930322157975
-1.1383466810835943 -1.3450160035539047 -0.80134563315795981  -0.062410317894398916 -0.5958304565286292 -0.80068159669946537
-1.3318385030170194 -1.4166951227028339 -0.73357768674250468  0.13227871496285484 -0.6671197493120542 -0.73311225719230599
-1.7036911127293841 -1.2783612117454606 -0.68346886752821689  0.50330613999724028 -0.52841879760671184 -0.68370790823052163
-1.535431727389222 -1.4440145438011469 -0.63704738383668813  0.3357171829316094 -0.69398814937561593 -0.6369257583193445
-2.00134563315796 -0.68834668108359442 -0.59501600355390472  0.80068159669946681 0.06241031789439918 -0.59583045652862721
-1.9335776867425047 -0.88183850301701949 -0.66669512270283404  0.73311225719230533 -0.13227871496285548 -0.66711974931205487
-1.883468867528217 -1.2536911127293844 -0.52836121174546002  0.68370790823052252 -0.50330613999724028 -0.52841879760671062
-1.8370473838366879 -1.085431727389222 -0.69401454380114702  0.63692575831934328 -0.33571718293160768 -0.69398814937561804
-2.00134563315796 -0.81165331891640546 -0.5950160035539046  0.80068159669946692 -0.062410317894399089 -0.59583045652862721
-2.065416189759524 -0.96331917890744345 -0.45337594379539076  0.86539097215515814 -0.21403145679805666 -0.45308829251400007
-2.1680560789191068 -0.99136787945551619 -0.067889430951449573  0.96807477555330945 -0.24117598392814624 -0.06830354100410925
-2.0975603118185226 -1.0965999725759743 -0.27249577181778517  0.89759648615318977 -0.34672764240957071 -0.2722140518682814
-2.0629989520743655 -0.6502428344740192 0.49525883802792375  0.86309191459386569 0.10098201560182052 0.49484844092680441
-2.1468968656499481 -0.74999999999999989 0.32153744077837082  0.94714371399036212 0 0.32080957755114375
-2.1248367469837333 -1.1045175594333878 0.13781977899394765  0.92488389215867051 -0.35425118465944472 0.13818785834077046
-2.1836473564126626 -0.87122116383748816 0.13320400767343907  0.98365340072891616 -0.1214277150833719 0.13297103911780889
-2.0629989520743655 -0.84975716552598102 -0.49525883802792381  0.86309191459386503 -0.10098201560182166 -0.49484844092680513
-2.1468968656499481 -0.74999999999999989 -0.32153744077837088  0.94714371399036212 0 -0.32080957755114348
-2.1248367469837333 -0.39548244056661219 -0.13781977899394779  0.92488389215867084 0.35425118465944372 -0.1381878583407698
-2.1836473564126626 -0.62877883616251173 -0.13320400767343912  0.98365340072891616 0.12142771508337172 -0.13297103911780903
-1.6952588380279245 0.11299895207436506 -0.099757165525981045  0.49484844092680624 0.86309191459386447 -0.10098201560182174
-1.8666951227028346 -0.016422313257495769 -0.13183850301701974  0.66711974931205509 0.73311225719230533 -0.13227871496285334
-2.0828787711788479 -0.28563503381027766 0.069930348042498217  0.88266998226615601 0.46476863555607201 0.069884317336659035
-2.0152357076386354 -0.18787141557069953 -0.13929176414434619  0.8154158644589905 0.56187930322158097 -0.13924301275047105
-0.76639448088848172 -1.6511027986839408 -1.226221676538485e-18  -0.43243812303240797 -0.90166361230128833 0
-0.74662405620460925 -1.6154161897595241 -0.21331917890744351  -0.45308829251400057 -0.86539097215515759 -0.2140314567980578
-0.55848910827666798 -1.3635385194857188 -0.4604717807940108  -0.64149399833801013 -0.61382359089386318 -0.46011525660259989
-0.7313642649373393 -1.5263391479810342 -0.42151877198336168  -0.46868822204941962 -0.77616877106981541 -0.42177409750733452
-0.22628605152906522 -0.97313250261608553 -0.01853460685588823  -0.97011569110293372 -0.2416500529336342 -0.0219271017931944
-0.33458381024047579 -0.96331917890744323 -0.45337594379539092  -0.86539097215515903 -0.21403145679805605 -0.45308829251399851
-0.58646148051428115 -1.2104717807940109 -0.64151089172333209  -0.61382359089386218 -0.46011525660260127 -0.64149399833801024
-0.42366085201896575 -1.1715187719833617 -0.46863573506266099  -0.77616877106981597 -0.42177409750733513 -0.46868822204941801
-0.70474116197207626 -1.6129989520743653 -0.099757165525981073  -0.49484844092680602 -0.86309191459386458 -0.1009820156018213
-0.53330487729716547 -1.4835776867425041 -0.13183850301701977  -0.66711974931205653 -0.73311225719230411 -0.13227871496285368
-0.31712122882115168 -1.2143649661897222 0.06993034804249823  -0.88266998226615767 -0.46476863555606879 0.069884317336658758
-0.38476429236136467 -1.3121285844293005 -0.13929176414434624  -0.8154158644589905 -0.56187930322158086 -0.13924301275047243
-0.39865436684204036 -0.81165331891640546 0.59501600355390505  -0.80068159669946593 -0.062410317894397216 0.59583045652862865
-0.3345838102404759 -0.96331917890744334 0.45337594379539103  -0.86539097215515925 -0.21403145679805619 0.45308829251399813
-0.23194392108089312 -0.99136787945551608 0.067889430951449628  -0.96807477555330879 -0.24117598392814923 0.068303541004108778
-0.3024396881814776 -1.0965999725759743 0.27249577181778545  -0.8975964861531891 -0.34672764240957249 0.27221405186828163
-0.60498399644609513 -1.5513456331579598 -0.061653318916405575  -0.59583045652862721 -0.80068159669946681 -0.062410317894398229
-0.53330487729716558 -1.4835776867425046 0.13183850301701974  -0.66711974931205553 -0.73311225719230488 0.13227871496285398
-0.67163878825453982 -1.4334688675282172 0.50369111272938427  -0.52841879760671173 -0.68370790823052097 0.50330613999724116
-0.50598545619885293 -1.3870473838366881 0.33543172738922172  -0.69398814937561748 -0.63692575831934339 0.33571718293160824
-1.2616533189164061 -1.3450160035539047 0.80134563315795981  0.062410317894398999 -0.5958304565286292 0.80068159669946537
-1.0681614969829809 -1.4166951227028342 0.73357768674250479  -0.13227871496285457 -0.6671197493120542 0.7331122571923061
-0.69630888727061591 -1.2783612117454606 0.68346886752821701  -0.50330613999723917 -0.52841879760671218 0.68370790823052208
-0.86456827261077818 -1.4440145438011469 0.63704738383668824  -0.33571718293160896 -0.69398814937561737 0.63692575831934317
-0.63268818151834738 -0.32335420881895127 -0.70294074606773105  -0.56065793252598317 0.42546670457134955 -0.71038071904921962
-0.62443505191569915 -0.33636614204180315 -0.70422028778974766  -0.56065793252598251 0.42546670457134655 -0.71038071904922195
-0.30362145533065943 -0.84916410602320291 0.43023759412454349  -0.89961957659540726 -0.11104418275857525 0.42231955541009492
-0.29401138453262832 -0.86471241548978517 0.4056780940788991  -0.89961957659540781 -0.11104418275857478 0.42231955541009392
-0.33700104792563468 -0.84975716552598102 0.49525883802792398  -0.86309191459386525 -0.10098201560182231 0.49484844092680469
-0.40151480227572495 -0.69274920908571347 -0.59888293763788791  -0.78019094274163359 0.041329938271319699 -0.62417459822265275
-0.46796403496887884 -0.58666916470964625 -0.66003296952840651  -0.73315795129589834 0.17491713444450682 -0.6571783734491905
-0.95069104161024875 0.185674705522129 0.24579255546759909  -0.24611330719287169 0.93975526497092965 0.23725151629021288
-1.686966450462785 -0.47427145868032006 0.8287565671687902  0.48692804957249219 0.27563277583938817 0.82881098413486431
-1.5417901167060055 0.037928268229677653 0.51219972690999771  0.34188293456237384 0.78786613428398444 0.51223335844459628
-0.92427145868032001 0.078756567168790315 0.48696645046278492  -0.27563277583938706 0.82881098413486554 0.48692804957249081
-0.68780027309000236 -0.40820988329399444 0.78792826822967776  -0.51223335844459605 0.34188293456237484 0.78786613428398422
-1.159171701060888 -0.75 0.99916617737278246  -0.040944849850879435 -3.4730626153766554e-18 0.99916140801708753
-1.2408282989391131 -0.75 -0.99916617737278246  0.040944849850879324 0 -0.99916140801708753
-0.71303354953721532 -0.47427145868032 -0.82875656716879043  -0.48692804957249047 0.27563277583938817 -0.8288109841348652
-0.85820988329399439 0.037928268229677653 -0.51219972690999771  -0.34188293456240315 0.78786613428397578 -0.51223335844458995
-1.4757285413196803 0.078756567168790315 -0.48696645046278492  0.2756327758393865 0.82881098413486554 -0.48692804957249086
-1.7121997269099978 -0.40820988329399444 -0.78792826822967765  0.51223335844459628 0.34188293456237279 -0.78786613428398489
-1.5417901167060062 -1.5379282682296775 0.5121997269099976  0.34188293456237406 -0.78786613428398444 0.51223335844459605
-1.2 -1.7491661773727825 0.040828298939112592  -7.64073775382864e-17 -0.99916140801708753 0.040944849850877922
-1.4757285413196803 -1.5787565671687904 -0.48696645046278475  0.27563277583938756 -0.82881098413486565 -0.48692804957249008
-1.9879282682296777 -1.2621997269099974 -0.34179011670600551  0.78786613428398389 -0.51223335844459728 -0.34188293456237384
-2.0287565671687906 -1.2369664504627846 0.27572854131967994  0.82881098413486598 -0.48692804957248942 0.27563277583938806
-2.0287565671687906 -0.26303354953721531 0.27572854131968005  0.8288109841348642 0.48692804957249169 0.27563277583938917
-0.68780027309000236 -1.0917901167060053 -0.78792826822967776  -0.51223335844459628 -0.34188293456237551 -0.78786613428398378
-0.4331208322019765 -0.64210794890239153 0.63136143448574877  -0.75877805430304357 0.10723544565538895 0.64246122334595246
-0.68780027309000258 -1.0917901167060058 0.78792826822967776  -0.51223335844459561 -0.34188293456237395 0.78786613428398489
-0.4331208322019765 -0.64210794890239153 -0.63136143448574877  -0.7587780543030449 0.10723544565538454 -0.64246122334595146
-1.2408282989391131 -0.75 0.99916617737278246  0.040944849850879296 -1.7365313076883277e-17 0.99916140801708753
-1.6869664504627853 -1.0257285413196802 0.82875656716879009  0.48692804957249064 -0.27563277583938667 0.82881098413486576
-1.712199726909998 -0.40820988329399466 0.78792826822967765  0.51223335844459739 0.34188293456237184 0.78786613428398455
-1.9879282682296777 -0.23780027309000251 0.34179011670600551  0.78786613428398478 0.5122333584445955 0.34188293456237423
-1.4757285413196803 0.078756567168790315 0.48696645046278475  0.27563277583938761 0.82881098413486509 0.48692804957249125
-1.2 0.24916617737278246 0.040828298939112578  -8.3353502769039717e-17 0.99916140801708742 0.040944849850880677
-0.85820988329399461 0.037928268229677764 0.51219972690999771  -0.34188293456235924 0.78786613428398578 0.51223335844460405
-0.70685918524788072 -0.20468185015976154 -0.67677227421098896  -0.49105853440620972 0.56677814486533351 -0.66153159432474307
-0.71303354953721532 -0.47427145868031984 0.82875656716879031  -0.48692804957249058 0.2756327758393885 0.82881098413486509
-0.71303354953721532 -1.0257285413196804 0.82875656716879031  -0.48692804957249042 -0.27563277583938889 0.82881098413486509
-1.6869664504627853 -0.47427145868031989 -0.82875656716879009  0.48692804957249114 0.27563277583938739 -0.8288109841348652
-1.686966450462785 -1.0257285413196799 -0.8287565671687902  0.48692804957249181 -0.27563277583938761 -0.82881098413486476
-1.159171701060888 -0.75 -0.99916617737278246  -0.040944849850879407 -1.7365313076883277e-17 -0.99916140801708753
-0.71303354953721521 -1.0257285413196802 -0.82875656716879043  -0.48692804957249081 -0.27563277583938839 -0.82881098413486509
-0.68780027309000247 -0.4082098832939946 -0.78792826822967776  -0.51223335844459583 0.34188293456237379 -0.78786613428398478
-0.71021467390312099 -0.19943478257349526 -0.67476755984413894  -0.49105853440620517 0.5667781448653324 -0.6615315943247474
-0.92427145868032001 0.078756567168790315 -0.48696645046278475  -0.27563277583938645 0.82881098413486542 -0.48692804957249114
-1.2 0.24916617737278246 -0.040828298939112578  -6.5988189692156443e-17 0.99916140801708742 -0.04094484985088067
-1.5417901167060057 0.037928268229677653 -0.5121997269099976  0.34188293456237506 0.78786613428398322 -0.51223335844459739
-1.9879282682296777 -0.23780027309000251 -0.3417901167060054  0.78786613428398444 0.51223335844459617 -0.34188293456237406
-1.9879282682296779 -1.2621997269099974 0.34179011670600534  0.78786613428398466 -0.51223335844459561 0.34188293456237406
-1.7121997269099978 -1.0917901167060053 0.78792826822967765  0.51223335844459661 -0.34188293456237395 0.78786613428398422
-1.4757285413196806 -1.57875656716879 0.48696645046278486  0.27563277583939033 -0.82881098413486387 0.48692804957249158
-0.92427145868032001 -1.5787565671687904 0.48696645046278475  -0.27563277583938756 -0.82881098413486587 0.48692804957248964
-1.2 -1.7491661773727825 -0.040828298939112592  -7.9880440153663052e-17 -0.99916140801708753 -0.040944849850877929
-0.92427145868032001 -1.5787565671687904 -0.48696645046278492  -0.27563277583938806 -0.82881098413486498 -0.48692804957249103
-1.5417901167060055 -1.5379282682296778 -0.5121997269099976  0.34188293456237406 -0.78786613428398466 -0.51223335844459583
-1.712199726909998 -1.0917901167060053 -0.78792826822967754  0.51223335844459705 -0.34188293456237379 -0.78786613428398389
-2.0287565671687906 -1.2369664504627846 -0.27572854131968005  0.82881098413486443 -0.48692804957249214 -0.27563277583938794
-2.1991661773727822 -0.79082829893911255 0  0.99916140801708742 -0.040944849850880795 -1.7365313076883274e-17
-2.1991661773727822 -0.70917170106088734 0  0.99916140801708742 0.040944849850880705 -5.5569001846026474e-17
-2.0287565671687906 -0.26303354953721531 -0.27572854131968005  0.82881098413486454 0.48692804957249131 -0.27563277583938905
-0.85820988329399461 -1.5379282682296775 -0.51219972690999771  -0.34188293456237323 -0.78786613428398444 -0.51223335844459661
-0.41207173177032219 -1.2621997269099976 -0.34179011670600545  -0.78786613428398422 -0.51223335844459672 -0.34188293456237362
-0.37124343283120964 -1.2369664504627851 -0.27572854131968011  -0.82881098413486498 -0.48692804957249108 -0.27563277583938772
-0.37124343283120953 -1.2369664504627846 0.27572854131968016  -0.82881098413486476 -0.48692804957249136 0.27563277583938789
-0.4120717317703223 -1.2621997269099978 0.34179011670600562  -0.78786613428398444 -0.51223335844459661 0.34188293456237306
-0.85820988329399461 -1.537928268229678 0.51219972690999771  -0.34188293456237456 -0.78786613428398455 0.51223335844459561
-0.67087146858540314 -0.2624299701285262 -0.69320320770179855  -0.51449014281491767 0.48894277869645281 -0.70443938852599475
-0.66689476317101137 -0.26866388572512034 -0.69462568959831961  -0.5144901428149169 0.48894277869645481 -0.70443938852599386
-1.5180233001589554 -0.16663313718873862 0.74735820322637392  0.31837608818572216 0.5834113418069351 0.74717325482286168
-1.3549016200234227 -0.4242154556775744 0.93266817185682316  0.15470547768481771 0.32538864777967069 0.93283891592837709
-1.2000000000000002 0.029916071523905408 0.62588411178006298  -1.9440969465109252e-05 0.78016657033104064 0.62557183613071154
-1.4506360861103191 -0.17357936956725528 0.77776655183340049  0.25072811471624656 0.57677917521735034 0.77747102552212832
-0.88197669984104476 -0.16663313718873862 0.74735820322637392  -0.31838810336562551 0.58337988565756493 0.74719269579232783
-1.2000000000000002 -0.018677749543832611 0.68203208574650409  -0.00040939357642315278 0.73148465290216658 0.68185778206712322
-1.0034507912873563 -0.4846564373476937 0.94390741193901817  -0.19675522852410574 0.26500379747184427 0.94395993949633727
-0.94936391388968078 -0.17357936956725528 0.77776655183340049  -0.2507281147162494 0.57677917521734823 0.77747102552212899
-1.3965492087126441 -0.48465643734769376 0.94390741193901806  0.19678668467347626 0.26502323844131009 0.94394792431643293
-1.0450983799765776 -0.42421545567757435 0.93266817185682316  -0.15470547768481632 0.32538864777966997 0.93283891592837753
-1.0034507912873558 -0.48465643734769376 -0.94390741193901806  -0.19678668467347538 0.26502323844130876 -0.94394792431643348
-1.3549016200234227 -0.42421545567757435 -0.93266817185682316  0.15536789040624926 0.32579804135609469 -0.93258589678337089
-0.88197669984104476 -0.16663313718873862 -0.74735820322637392  -0.31837608818572144 0.58341134180693477 -0.74717325482286201
-1.0450983799765772 -0.4242154556775744 -0.93266817185682316  -0.15470547768481749 0.32538864777967014 -0.93283891592837731
-1.2000000000000002 0.029916071523905408 -0.62588411178006298  1.9440969465147456e-05 0.78016657033104064 -0.62557183613071166
-0.94936391388968078 -0.17357936956725528 -0.77776655183340049  -0.25072811471624901 0.57677917521734834 -0.77747102552212899
-1.5180233001589554 -0.16663313718873862 -0.74735820322637392  0.31837608818572199 0.58341134180693521 -0.74717325482286157
-1.2000000000000002 -0.018677749543832611 -0.68203208574650409  0.00040939357642540662 0.73148465290216658 -0.68185778206712322
-1.3965492087126441 -0.48465643734769376 -0.94390741193901806  0.19678668467347624 0.26502323844130876 -0.94394792431643337
-1.4506360861103194 -0.17357936956725528 -0.77776655183340049  0.25098113386125454 0.57611676249591781 -0.77788041909855354
-1.4653435626523068 -1.6939074119390178 0.19654920871264414  0.26500379747184499 -0.94395993949633672 0.19675522852410671
-1.776420630432745 -1.5277665518334003 0.25063608611031901  0.57677917521735267 -0.77747102552212677 0.25072811471624601
-1.4653435626523068 -1.6939074119390178 -0.19654920871264417  0.26502323844130787 -0.9439479243164336 -0.1967866846734764
-1.5257845443224263 -1.682668171856823 0.15490162002342267  0.32579804135609608 -0.93258589678337034 0.1553678904062491
-1.7833668628112616 -1.4973582032263737 -0.31802330015895508  0.58341134180693421 -0.74717325482286179 -0.31837608818572316
-1.5257845443224263 -1.682668171856823 -0.15490162002342261  0.32538864777967014 -0.9328389159283772 -0.15470547768481846
-1.9799160715239057 -1.3758841117800626 6.5652635294160463e-18  0.7801665703310402 -0.62557183613071232 1.9440969467934493e-05
-1.776420630432745 -1.5277665518334005 -0.25063608611031912  0.57677917521735034 -0.77747102552212821 -0.25072811471624679
-1.783366862811262 -1.4973582032263735 0.31802330015895508  0.58341134180693577 -0.74717325482286157 0.31837608818572088
-1.9313222504561676 -1.4320320857465036 6.5571195165482265e-18  0.73148465290216724 -0.68185778206712244 0.00040939357642396707
-1.9473582032263739 -0.43197669984104503 0.58336686281126138  0.74717325482286179 0.31837608818572261 0.58341134180693444
-2.1326681718568232 -0.59509837997657744 0.32578454432242576  0.93258589678337045 0.1553678904062504 0.3257980413560953
-1.0034507912873558 -1.0153435626523062 -0.94390741193901806  -0.19678668467347527 -0.26502323844130832 -0.9439479243164336
-0.94936391388968078 -1.3264206304327446 -0.77776655183340071  -0.25072811471624867 -0.57677917521734845 -0.77747102552212888
-0.54306000239317154 -0.46664565776233691 -0.69755165300174249  -0.64093662140152696 0.29301330949338655 -0.70946701671475088
-0.5493198212532957 -0.45674068614295493 -0.69911600851089584  -0.64093662140152796 0.29301330949338594 -0.70946701671475021
-0.57411588821993709 -0.75 0.77991607152390563  -0.62557183613071099 1.9440969465088418e-05 0.7801665703310412
-0.42223344816659947 -1.0006360861103192 0.57642063043274483  -0.77747102552212854 -0.25072811471624834 0.57677917521734923
-0.22743420727478347 -0.97114863140943242 0.060907607905721757  -0.97824013612619687 -0.2023295205475491 0.04592386293419589
-0.65693999760682842 -0.28335434223766309 0.69755165300174249  -0.52046695699576928 0.4680023877090585 0.71420439075532427
-1.0034507912873563 -1.0153435626523062 0.94390741193901817  -0.19678668467347571 -0.26502323844130965 0.94394792431643315
-1.3549016200234227 -1.0757845443224259 0.93266817185682316  0.15470547768481877 -0.32538864777966986 0.9328389159283772
-1.9473582032263741 -1.068023300158955 0.58336686281126127  0.7471926957923285 -0.31838810336562651 0.5833798856575636
-1.882032085746504 -0.75 0.73132225045616739  0.68185778206712322 0.00040939357642449329 0.73148465290216658
-1.825884111780063 -0.75 0.77991607152390541  0.62557183613071199 -1.9440969466317842e-05 0.78016657033104053
-1.9777665518334007 -0.49936391388968099 0.57642063043274483  0.77747102552212866 0.25072811471624751 0.57677917521734945
-1.9799160715239057 -0.12411588821993724 -6.5652635294160447e-18  0.78016657033104142 0.62557183613071088 -1.9440969466128564e-05
-1.7764206304327446 0.027766551833400488 0.25063608611031907  0.57677917521734934 0.77747102552212866 0.25072811471624773
-1.7833668628112616 -0.0026417967736263037 0.31802330015895508  0.58337988565756482 0.74719269579232783 0.31838810336562562
-1.5257845443224261 0.18266817185682305 0.15490162002342259  0.32538864777967108 0.93283891592837698 0.15470547768481774
-0.65068017874670425 -0.29325931385704496 0.69911600851089584  -0.54352627180166979 0.43623030388676148 0.71713479474380626
-0.5673118184816528 -0.42664579118104884 0.70294074606773105  -0.62602060935196546 0.3045977284849295 0.71785682449107846
-0.57556494808430092 -0.41363385795819674 0.70422028778974766  -0.60701252203428957 0.33806887798059881 0.71919763058182429
-0.53310523682898847 -0.4813361142748796 0.69462568959831961  -0.64422625268360179 0.2707665146111275 0.71530275402698273
-0.52912853141459681 -0.48757002987147369 0.69320320770179855  -0.66138007935864995 0.23687493927937048 0.71166470600201914
-0.6921217709628692 -0.22700206765185593 0.68413337702600874  -0.52838581205516633 0.49772992706570907 0.68780328097644783
-0.79963678018449613 -0.05534752809057629 0.5975302451883705  -0.36887582764815235 0.69486688193515589 0.61732539245247686
-0.51796791425349598 -0.75 0.73132225045616761  -0.68185778206712311 -0.00040939357642604912 0.73148465290216658
-0.88197669984104521 -1.3333668628112616 0.74735820322637403  -0.31837608818572261 -0.58341134180693432 0.7471732548228619
-1.0450983799765778 -1.0757845443224259 0.93266817185682316  -0.15470547768481827 -0.32538864777967069 0.93283891592837698
-1.9473582032263739 -0.43197669984104503 -0.58336686281126138  0.74719269579232828 0.31838810336562562 -0.58337988565756427
-1.882032085746504 -0.75 -0.73132225045616739  0.68185778206712311 0.00040939357642504547 -0.73148465290216658
-1.5180233001589554 -1.3333668628112614 -0.74735820322637381  0.3183881033656264 -0.58337988565756693 -0.74719269579232594
-1.3549016200234227 -1.0757845443224259 -0.93266817185682316  0.15536789040624779 -0.32579804135609403 -0.93258589678337134
-1.3965492087126441 -1.0153435626523062 -0.94390741193901806  0.1967866846734756 -0.26502323844130887 -0.94394792431643337
-1.0450983799765772 -1.0757845443224259 -0.93266817185682316  -0.15470547768481796 -0.32538864777967053 -0.93283891592837709
-0.45264179677362604 -1.068023300158955 -0.58336686281126149  -0.74719269579232694 -0.31838810336562517 -0.58337988565756627
-0.51796791425349598 -0.75 -0.7313222504561675  -0.68185778206712322 0.00040939357642540315 -0.73148465290216658
-0.57411588821993709 -0.75 -0.77991607152390563  -0.62557183613071143 -1.9440969465946235e-05 -0.78016657033104087
-0.79848519772427506 -0.057250790914286052 0.59888293763788747  -0.39881277493423034 0.66927944610494072 0.62690780308648464
-0.37506412073313489 -0.73422479552976916 0.5641719337434894  -0.82793015848818263 0.029879307227406587 0.56003471291103279
-0.61696807586665514 -0.34742682425518856 0.70495163176324005  -0.56575106816925058 0.40400744901774194 0.71882105562061038
-0.85711100340627278 0.037134436368273127 0.51257565524045945  -0.37394295240639175 0.76556189758091675 0.52352807882471508
-0.36517401588679055 -0.75 0.54975734503310159  -0.8351282192258348 5.4308772982543211e-16 0.55005532217467545
-1.4653435626523068 0.19390741193901784 0.19654920871264411  0.26502323844131026 0.94394792431643293 0.19678668467347613
-1.5257845443224261 0.18266817185682305 -0.15490162002342259  0.32538864777967069 0.93283891592837709 -0.15470547768481732
-1.4653435626523068 0.19390741193901784 -0.19654920871264409  0.26500379747184366 0.94395993949633761 -0.19675522852410474
-1.7764206304327446 0.027766551833400488 -0.25063608611031907  0.57611676249591726 0.7778804190985541 -0.25098113386125426
-2.143907411939018 -0.55345079128735586 -0.26534356265230641  0.94395993949633639 0.19675522852410829 -0.2650037974718456
-1.9777665518334007 -0.49936391388968093 -0.57642063043274461  0.77788041909855388 0.25098113386125426 -0.57611676249591737
-2.143907411939018 -0.94654920871264403 0.2653435626523063  0.94395993949633716 -0.19675522852410743 0.26500379747184344
-1.9777665518334007 -1.000636086110319 0.57642063043274461  0.7778804190985531 -0.25098113386125498 0.57611676249591826
-1.3965492087126441 -1.0153435626523066 0.94390741193901784  0.19675522852410626 -0.26500379747184283 0.9439599394963375
-1.4506360861103194 -1.3264206304327448 0.77776655183340038  0.2509811338612547 -0.5761167624959187 0.77788041909855277
-1.5180233001589556 -1.3333668628112614 0.74735820322637381  0.31838810336562534 -0.58337988565756493 0.74719269579232783
-1.2000000000000002 -1.4813222504561674 0.68203208574650398  -0.00040939357642352781 -0.73148465290216691 0.68185778206712278
-0.61663313718873858 -1.4973582032263739 0.31802330015895514  -0.58341134180693366 -0.74717325482286201 0.31837608818572388
-0.87421545567757442 -1.682668171856823 0.15490162002342264  -0.32538864777966964 -0.93283891592837698 0.15470547768482029
-0.93465643734769377 -1.6939074119390181 0.19654920871264422  -0.26500379747184344 -0.94395993949633761 0.19675522852410501
-0.87421545567757397 -1.682668171856823 -0.1549016200234227  -0.32538864777967069 -0.93283891592837709 -0.15470547768481749
-0.88197669984104465 -1.3333668628112609 -0.74735820322637414  -0.31837608818572127 -0.58341134180693477 -0.74717325482286223
-1.2 -1.4813222504561674 -0.68203208574650398  0.00040939357642341147 -0.73148465290216702 -0.68185778206712278
-1.2 -1.5299160715239055 -0.62588411178006287  -1.9440969467884131e-05 -0.78016657033104075 -0.62557183613071143
-1.4506360861103191 -1.3264206304327451 -0.77776655183340049  0.25098113386125381 -0.5761167624959187 -0.7778804190985531
-1.825884111780063 -0.75 -0.77991607152390541  0.62557183613071188 1.9440969466300475e-05 -0.78016657033104053
-1.9777665518334007 -1.000636086110319 -0.57642063043274472  0.77747102552212888 -0.25072811471624684 -0.57677917521734945
-1.9473582032263741 -1.068023300158955 -0.58336686281126127  0.7471732548228629 -0.31837608818572177 -0.58341134180693366
-2.1326681718568232 -0.90490162002342256 -0.32578454432242576  0.93283891592837764 -0.15470547768481741 -0.3253886477796693
-2.143907411939018 -0.55345079128735586 0.26534356265230624  0.94395993949633716 0.19675522852410809 0.26500379747184305
-2.1326681718568232 -0.90490162002342245 0.3257845443224256  0.93283891592837764 -0.15470547768481743 0.3253886477796693
-2.143907411939018 -0.94654920871264403 -0.26534356265230624  0.94394792431643348 -0.19678668467347632 -0.26502323844130793
-2.1326681718568228 -0.59509837997657722 -0.32578454432242587  0.93258589678336967 0.15536789040625279 -0.32579804135609647
-1.7833668628112611 -0.0026417967736259707 -0.31802330015895519  0.58337988565756549 0.74719269579232739 -0.31838810336562545
-1.9313222504561676 -0.067967914253496131 -6.5571195165482257e-18  0.73148465290216658 0.68185778206712322 0.00040939357642534065
-0.93465643734769377 -1.6939074119390181 -0.19654920871264417  -0.26502323844131026 -0.94394792431643293 -0.19678668467347621
-0.62357936956725513 -1.5277665518334005 -0.25063608611031907  -0.57611676249591681 -0.77788041909855388 -0.25098113386125542
-0.2560925880609819 -0.94654920871264381 -0.26534356265230646  -0.94394792431643326 -0.19678668467347482 -0.26502323844131015
-0.42223344816659947 -1.0006360861103192 -0.57642063043274483  -0.77747102552212843 -0.25072811471624856 -0.57677917521734912
-0.61663313718873847 -1.4973582032263737 -0.31802330015895514  -0.58337988565756582 -0.74719269579232661 -0.31838810336562673
-0.46867774954383223 -1.4320320857465039 -6.557119516548228e-18  -0.73148465290216691 -0.68185778206712278 0.00040939357642509578
-0.45264179677362604 -1.068023300158955 0.58336686281126149  -0.74717325482286212 -0.31837608818572227 0.58341134180693421
-0.35314170479917451 -0.76928684914828649 0.53075413092765567  -0.84560936423414956 -0.027439993872776989 0.53309647331020626
-0.42008392847609421 -1.3758841117800626 -6.5652635294160471e-18  -0.78016657033104109 -0.62557183613071121 -1.9440969465194341e-05
-0.6235793695672549 -1.5277665518334005 0.25063608611031912  -0.57677917521734967 -0.77747102552212843 0.25072811471624756
-1.2000000000000002 -1.5299160715239055 0.62588411178006287  1.9440969467748691e-05 -0.78016657033104075 0.62557183613071143
-0.94936391388968122 -1.3264206304327451 0.77776655183340049  -0.25098113386125387 -0.57611676249591748 0.77788041909855399
-0.9253890776539393 0.14644305776905842 0.34753041451074107  -0.30595468057194158 0.88059013433293742 0.36187394041519544
-0.26758089404998364 -0.9059728893652188 0.32585692434233743  -0.92464256115117716 -0.19278508535823347 0.32843575470890851
-0.2560925880609819 -0.94654920871264381 0.26534356265230635  -0.94394792431643393 -0.1967866846734751 0.26502323844130765
-0.94302798180440095 0.1743284862276076 0.28050566540029331  -0.23706297888618641 0.9260725255318728 0.29358273364867038
-1.8562122655612305 -0.35501511824236365 0.6429404371401003  0.65613064511909591 0.3953635844294407 0.64279095563231414
-1.6382389584574513 -0.22030020581200926 0.72619883181352507  0.43849581670457105 0.52986930552536982 0.72592006295091027
-1.4047014786826493 0.1770588370822882 0.31410064822087258  0.20429513892774534 0.92713596376716367 0.31413755092319967
-1.2699865662522949 0.093800442408863538 0.53207395532465163  0.069789417831815442 0.84400685644856721 0.53177237933772381
-0.25313054028719528 -0.92991689161909563 0.26460466631117985  -0.95170604908226608 -0.15778941565067039 0.26335925358499035
-0.80501511824236338 -0.1070595628598997 0.65621226556123025  -0.39536358442943975 0.64279095563231481 0.65613064511909569
-0.66792604467534855 -0.68001343374770507 0.84380044240886365  -0.53177237933772403 0.069789417831815664 0.8440068564485671
-0.8858993517791276 -0.54529852131735079 0.9270588370822882  -0.31413755092319828 0.20429513892774345 0.92713596376716445
-1.4008600052687634 -0.88471491243035438 0.9703129137821026  0.20121590081625373 -0.13450572109592804 0.97026819604229431
-1.4008600052687634 -0.61528508756964562 0.9703129137821026  0.20121590081625312 0.13450572109592757 0.97026819604229442
-0.99913999473123671 -0.88471491243035438 -0.97031291378210283  -0.2012159008162531 -0.13450572109592762 -0.97026819604229442
-0.99913999473123671 -0.61528508756964562 -0.97031291378210283  -0.20121590081625337 0.13450572109592807 -0.97026819604229431
-0.26791287934591501 -0.90549608434201145 0.3269900786062353  -0.91789704785096649 -0.17153707639041882 0.35782683098100421
-0.76176104154254864 -0.22030020581200915 -0.72619883181352518  -0.43849581670457083 0.52986930552536815 -0.7259200629509116
-0.99529852131735064 0.1770588370822882 -0.31410064822087258  -0.20429513892774293 0.92713596376716434 -0.31413755092319934
-1.130013433747705 0.093800442408863538 -0.53207395532465163  -0.069789417831815415 0.84400685644856743 -0.53177237933772348
-1.7296997941879915 -0.023801168186475152 -0.43823895845745109  0.52986930552537015 0.72592006295091016 -0.43849581670457066
-1.5949848817576369 -0.10705956285989982 -0.65621226556123013  0.3953635844294397 0.64279095563231459 -0.65613064511909591
-1.732073955324652 -0.68001343374770495 -0.84380044240886309  0.53177237933772414 0.069789417831814707 -0.84400685644856699
-1.514100648220873 -0.54529852131735079 -0.92705883708228798  0.31413755092319923 0.20429513892774315 -0.92713596376716423
-1.2699865662522956 -1.5938004424088636 0.53207395532465152  0.069789417831816025 -0.84400685644856654 0.5317723793377247
-1.4047014786826499 -1.6770588370822881 0.31410064822087264  0.20429513892774617 -0.92713596376716367 0.31413755092319912
-1.0652850875696456 -1.7203129137821027 -0.20086000526876327  -0.13450572109592807 -0.9702681960422942 -0.20121590081625407
-1.3347149124303548 -1.7203129137821027 -0.20086000526876327  0.13450572109592854 -0.97026819604229386 -0.20121590081625515
-1.5949848817576369 -1.3929404371401004 -0.65621226556122991  0.39536358442944175 -0.64279095563231325 -0.65613064511909613
-1.729699794187991 -1.4761988318135251 -0.43823895845745126  0.52986930552536826 -0.72592006295091183 -0.43849581670457022
-2.1270588370822883 -1.0641006482208724 -0.20470147868264912  0.92713596376716445 -0.31413755092319778 -0.20429513892774437
-2.0438004424088634 -1.2820739553246514 -0.069986566252294838  0.84400685644856765 -0.53177237933772303 -0.069789417831815984
-1.9261988318135255 -1.1882389584574506 0.52969979418799085  0.72592006295091227 -0.43849581670456861 0.52986930552536904
-1.8429404371401006 -1.4062122655612299 0.39498488175763641  0.64279095563231547 -0.6561306451190958 0.39536358442943842
-1.8429404371401004 -0.093787734438769865 0.39498488175763669  0.64279095563231381 0.65613064511909625 0.39536358442944064
-1.926198831813525 -0.31176104154254897 0.52969979418799107  0.72592006295091205 0.43849581670456983 0.52986930552536837
-0.66792604467534855 -0.81998656625229493 -0.84380044240886365  -0.53177237933772392 -0.069789417831815595 -0.8440068564485671
-0.88589935177912738 -0.95470147868264921 -0.9270588370822882  -0.31413755092319839 -0.20429513892774312 -0.92713596376716456
-0.23259475183323847 -0.96237493457550005 0.13494008765512316  -0.96126367789069989 -0.24008359059386972 0.13539575730280448
-0.96105942755013962 0.20306848001363992 0.18186355091081879  -0.23241575440058715 0.9560851324517049 0.1785612965096629
-0.88589935177912782 -0.95470147868264921 0.92705883708228842  -0.31413755092319828 -0.2042951389277437 0.92713596376716445
-0.66792604467534844 -0.81998656625229493 0.84380044240886354  -0.53177237933772348 -0.069789417831816219 0.84400685644856732
-0.97011813854669349 0.21732927410114633 0.09963433104745141  -0.22974865031682276 0.96813269657427869 0.099672661755436959
-0.22762677949308696 -0.97053761901938218 0.067701629511043929  -0.977076172502924 -0.20189342879636338 0.067536631067031172
-0.99913999473123705 -0.61528508756964562 0.97031291378210283  -0.20121590081625301 0.13450572109592784 0.97026819604229442
-0.99913999473123705 -0.88471491243035438 0.97031291378210283  -0.20121590081625312 -0.13450572109592798 0.97026819604229442
-1.6382389584574515 -1.2796997941879908 0.72619883181352474  0.43849581670457077 -0.52986930552536804 0.72592006295091172
-1.8562122655612305 -1.1449848817576362 0.6429404371401003  0.6561306451190958 -0.39536358442944081 0.64279095563231403
-1.514100648220873 -0.54529852131735101 0.92705883708228809  0.31413755092319962 0.20429513892774379 0.9271359637671639
-1.732073955324652 -0.68001343374770518 0.84380044240886309  0.53177237933772414 0.069789417831814637 0.84400685644856699
-2.1270588370822883 -0.43589935177912753 0.20470147868264921  0.92713596376716356 0.31413755092319956 0.20429513892774553
-2.0438004424088634 -0.21792604467534848 0.069986566252294824  0.84400685644856799 0.53177237933772259 0.069789417831813999
-1.5949848817576369 -0.10705956285989982 0.65621226556123013  0.39536358442944181 0.64279095563231281 0.65613064511909647
-1.7296997941879908 -0.02380116818647493 0.4382389584574512  0.52986930552536893 0.72592006295091116 0.43849581670457066
-1.3347149124303548 0.22031291378210283 -0.20086000526876321  0.13450572109592773 0.97026819604229453 -0.20121590081625276
-1.0652850875696458 0.22031291378210283 -0.20086000526876321  -0.13450572109592798 0.97026819604229442 -0.20121590081625304
-1.130013433747705 0.093800442408863538 0.53207395532465163  -0.069789417831814193 0.84400685644856799 0.5317723793377227
-0.99529852131735064 0.1770588370822882 0.31410064822087264  -0.2042951389277437 0.92713596376716401 0.31413755092319967
-0.97371394847093473 0.22313250261608547 0.018534606855888314  -0.22857704379632671 0.97332233192471596 0.019904100732393931
-0.22762677949308696 -0.97053761901938218 -0.067701629511043929  -0.97707617250292411 -0.20189342879636341 -0.0675366310670278
-0.76176104154254864 -0.22030020581200915 0.72619883181352496  -0.43849581670457166 0.52986930552536859 0.72592006295091083
-0.23259475183323844 -0.96237493457549972 -0.13494008765512316  -0.96126367789070022 -0.24008359059387063 -0.13539575730280104
-0.54378773443876993 -1.1449848817576371 0.6429404371401003  -0.65613064511909602 -0.39536358442944158 0.64279095563231348
-0.76176104154254898 -1.2796997941879913 0.72619883181352518  -0.43849581670457066 -0.52986930552536937 0.72592006295091083
-1.6382389584574515 -0.22030020581200915 -0.72619883181352496  0.43849581670457105 0.52986930552536826 -0.72592006295091138
-1.8562122655612303 -0.35501511824236348 -0.64294043714010018  0.6561306451190958 0.39536358442944025 -0.64279095563231448
-1.8562122655612303 -1.1449848817576367 -0.64294043714010018  0.65613064511909591 -0.3953635844294397 -0.64279095563231481
-1.6382389584574513 -1.2796997941879908 -0.72619883181352485  0.43849581670457155 -0.52986930552536948 -0.72592006295091016
-1.4008600052687634 -0.61528508756964562 -0.9703129137821026  0.20121590081625362 0.13450572109592837 -0.9702681960422942
-1.4008600052687634 -0.88471491243035438 -0.9703129137821026  0.20121590081625323 -0.13450572109592762 -0.97026819604229442
-0.76176104154254864 -1.2796997941879906 -0.72619883181352507  -0.43849581670457011 -0.52986930552536771 -0.72592006295091238
-0.54378773443876982 -1.1449848817576367 -0.64294043714010041  -0.6561306451190958 -0.39536358442943981 -0.64279095563231481
-0.8858993517791276 -0.5452985213173509 -0.92705883708228842  -0.31413755092319801 0.20429513892774237 -0.92713596376716478
-0.66792604467534844 -0.68001343374770507 -0.84380044240886354  -0.53177237933772359 0.06978941783181529 -0.84400685644856743
-0.9610594275501394 0.20306848001363986 -0.18186355091081907  -0.23241575440058929 0.95608513245170457 -0.1785612965096621
-0.24152064540259116 -0.94857068261001021 -0.2007220816032094  -0.95922670283599787 -0.19909668302557726 -0.20061067612316394
-0.80501511824236338 -0.1070595628598997 -0.65621226556123025  -0.39536358442943881 0.64279095563231414 -0.65613064511909702
-0.25313054028719528 -0.92991689161909552 -0.26460466631117996  -0.95170604908224066 -0.1577894156506604 -0.2633592535850886
-1.0652850875696456 0.22031291378210283 0.20086000526876321  -0.1345057210959279 0.97026819604229442 0.20121590081625326
-1.3347149124303548 0.22031291378210283 0.20086000526876321  0.13450572109592795 0.97026819604229431 0.20121590081625346
-1.2699865662522949 0.093800442408863538 -0.53207395532465163  0.069789417831814513 0.84400685644856788 -0.53177237933772292
-1.4047014786826493 0.1770588370822882 -0.31410064822087264  0.20429513892774448 0.92713596376716378 -0.31413755092319973
-2.0438004424088634 -0.21792604467534848 -0.069986566252294824  0.84400685644856688 0.53177237933772448 -0.069789417831814568
-2.1270588370822883 -0.43589935177912753 -0.20470147868264921  0.92713596376716478 0.31413755092319684 -0.20429513892774426
-2.0438004424088634 -1.2820739553246514 0.069986566252294838  0.84400685644856721 -0.5317723793377237 0.069789417831815623
-2.1270588370822883 -1.0641006482208724 0.20470147868264912  0.92713596376716378 -0.31413755092319856 0.20429513892774603
-1.732073955324652 -0.81998656625229482 0.84380044240886309  0.53177237933772414 -0.069789417831814651 0.84400685644856699
-1.514100648220873 -0.95470147868264921 0.92705883708228798  0.31413755092319934 -0.2042951389277432 0.92713596376716423
-1.7296997941879915 -1.4761988318135248 0.43823895845745114  0.52986930552536926 -0.72592006295091094 0.43849581670457061
-1.5949848817576373 -1.3929404371401 0.65621226556123013  0.39536358442944053 -0.64279095563231414 0.65613064511909591
-0.80501511824236371 -1.3929404371401006 0.65621226556123013  -0.39536358442944214 -0.64279095563231292 0.65613064511909625
-0.67030020581200889 -1.4761988318135248 0.4382389584574512  -0.52986930552536993 -0.72592006295091094 0.43849581670456983
-1.3347149124303548 -1.7203129137821027 0.20086000526876327  0.13450572109592701 -0.97026819604229453 0.20121590081625307
-1.0652850875696458 -1.7203129137821027 0.20086000526876327  -0.13450572109592926 -0.97026819604229408 0.20121590081625365
-0.67030020581200889 -1.4761988318135248 -0.4382389584574512  -0.52986930552536993 -0.72592006295091061 -0.43849581670457033
-0.80501511824236327 -1.3929404371401002 -0.65621226556123036  -0.39536358442943859 -0.64279095563231625 -0.65613064511909513
-1.4047014786826493 -1.6770588370822881 -0.31410064822087269  0.20429513892774337 -0.92713596376716467 -0.31413755092319789
-1.2699865662522944 -1.5938004424088634 -0.53207395532465185  0.069789417831815234 -0.84400685644856699 -0.53177237933772403
-1.514100648220873 -0.95470147868264899 -0.92705883708228809  0.3141375509231995 -0.2042951389277432 -0.92713596376716412
-1.732073955324652 -0.81998656625229471 -0.8438004424088632  0.53177237933772337 -0.069789417831814263 -0.84400685644856743
-1.8429404371401004 -1.4062122655612304 -0.39498488175763669  0.64279095563231414 -0.6561306451190958 -0.3953635844294407
-1.926198831813525 -1.1882389584574511 -0.52969979418799096  0.72592006295091149 -0.43849581670457138 -0.52986930552536793
-2.1703129137821029 -0.54913999473123687 -0.13471491243035441  0.97026819604229408 0.20121590081625459 -0.13450572109592798
-2.1703129137821029 -0.54913999473123698 0.13471491243035433  0.97026819604229431 0.2012159008162539 0.13450572109592773
-2.1703129137821029 -0.95086000526876302 0.13471491243035433  0.97026819604229431 -0.20121590081625354 0.13450572109592776
-2.1703129137821029 -0.9508600052687628 -0.13471491243035436  0.97026819604229431 -0.20121590081625354 -0.13450572109592784
-1.926198831813525 -0.31176104154254891 -0.52969979418799096  0.7259200629509126 0.43849581670456972 -0.52986930552536771
-1.8429404371401004 -0.093787734438769865 -0.39498488175763657  0.64279095563231414 0.65613064511909647 -0.39536358442943975
-1.130013433747705 -1.5938004424088636 -0.53207395532465152  -0.069789417831815748 -0.84400685644856654 -0.5317723793377247
-0.99529852131735097 -1.6770588370822881 -0.31410064822087269  -0.2042951389277417 -0.92713596376716501 -0.31413755092319773
-0.35619955759113631 -1.2820739553246514 -0.069986566252294852  -0.84400685644856743 -0.53177237933772326 -0.069789417831815789
-0.27294116291771175 -1.0641006482208724 -0.20470147868264923  -0.92713596376716412 -0.31413755092319912 -0.2042951389277439
-0.473801168186475 -1.1882389584574511 -0.52969979418799107  -0.72592006295091005 -0.43849581670457194 -0.52986930552536937
-0.55705956285989966 -1.4062122655612304 -0.39498488175763657  -0.64279095563231292 -0.65613064511909647 -0.39536358442944169
-0.55705956285989966 -1.4062122655612304 0.39498488175763669  -0.64279095563231348 -0.65613064511909613 0.39536358442944119
-0.473801168186475 -1.1882389584574511 0.52969979418799107  -0.72592006295091183 -0.43849581670457038 0.52986930552536815
-0.27294116291771175 -1.0641006482208724 0.20470147868264923  -0.92713596376716456 -0.31413755092319806 0.20429513892774345
-0.35619955759113631 -1.2820739553246514 0.069986566252294852  -0.84400685644856754 -0.53177237933772326 0.069789417831815165
-0.99529852131735064 -1.6770588370822881 0.31410064822087264  -0.20429513892774173 -0.92713596376716467 0.31413755092319862
-1.130013433747705 -1.5938004424088634 0.53207395532465174  -0.069789417831815526 -0.84400685644856721 0.53177237933772381
-0.94302798180440095 0.17432848622760783 -0.28050566540029331  -0.23706297888618275 0.92607252553187347 -0.29358273364867121
-0.26758089404998375 -0.9059728893652188 -0.32585692434233748  -0.92464256115119448 -0.19278508535823902 -0.3284357547088565
-0.92600274487022971 0.1474180208074326 -0.34558774394436148  -0.30431345936384574 0.89521176696950633 -0.3255598420096425
-0.92538907765393952 0.14644305776905853 -0.34753041451074101  -0.30595468057193953 0.88059013433293953 -0.36187394041519183
-1.2650724998901954 -0.10056625699618549 0.75762878984770377  0.065515668062195068 0.64992905036579129 0.75716571946238087
-1.3432414582888712 -0.30521524694909546 0.88410882140193769  0.1439907391710285 0.44447864693329603 0.88414105178604119
-1.3620856567445476 -0.68282536162972496 0.984487586431394  0.16230850425355212 0.06710299740137815 0.98445575684574327
-1.5878111467046643 -0.54331933670715005 0.89826812139385248  0.38778432700573384 0.20645471950357114 0.89833165619575706
-1.0735199684457657 -0.13851819872979687 0.78108437977813105  -0.12697533232365837 0.61194488891504961 0.78064122227310295
-1.3264800315542344 -0.13851819872979687 0.78108437977813105  0.12697533232366021 0.61194488891504939 0.78064122227310284
-1.6879855916616429 -0.28105923500562391 0.73618246464930537  0.48809649929758536 0.46907539604897625 0.73602315194220513
-1.6017661266241014 -0.055333745045507365 0.59667643972673035  0.40197239864759948 0.69455121880115733 0.5966714298400102
-1.0567585417111292 -0.30521524694909541 0.88410882140193769  -0.14399073917102842 0.44447864693329731 0.88414105178604063
-1.1349275001098049 -0.10056625699618549 0.75762878984770377  -0.065515668062195692 0.64992905036578974 0.75716571946238231
-1.3395060249225752 0.10675191169903997 0.49650199476975138  0.13935172210219554 0.85685972305470981 0.49635925754815774
-1.0604939750774247 0.10675191169903997 0.49650199476975149  -0.13935172210219546 0.85685972305470937 0.49635925754815863
-1.2379519417336118 -0.37028774683929055 0.92432583806700219  0.037984161450744208 0.37896297887110131 0.92463196144413318
-1.0333029517807015 -0.24380771528505651 0.84615687966832631  -0.167466241981752 0.50593831119476151 0.84615689033529828
-0.28617291708332143 -0.87638371280443894 -0.38483791504434911  -0.91004478602604899 -0.14997570917340258 -0.38642693240085846
-0.71201440833835739 -0.28105923500562369 0.73618246464930526  -0.48809649929758497 0.46907539604897713 0.7360231519422048
-1.3666970482192986 -0.24380771528505651 0.84615687966832631  0.16746624198175161 0.50593831119476174 0.84615689033529817
-1.1620480582663888 -0.37028774683929055 0.92432583806700219  -0.037984161450742508 0.37896297887110225 0.92463196144413284
-0.8121888532953363 -0.54331933670715005 0.89826812139385281  -0.38778432700573306 0.20645471950357169 0.89833165619575717
-1.0379143432554527 -0.68282536162972518 0.98448758643139411  -0.16230850425355139 0.067102997401376957 0.98445575684574349
-1.0333029517807015 -0.24380771528505651 -0.84615687966832631  -0.16746624198175167 0.50593831119476129 -0.84615689033529851
-1.2379519417336118 -0.37028774683929055 -0.92432583806700219  0.037984161450742626 0.3789629788711022 -0.92463196144413284
-1.5878111467046638 -0.54331933670715016 -0.89826812139385259  0.38778432700573329 0.20645471950357297 -0.89833165619575683
-1.3620856567445476 -0.68282536162972518 -0.984487586431394  0.16230850425355339 0.067102997401377248 -0.98445575684574316
-1.1349275001098049 -0.10056625699618549 -0.75762878984770377  -0.06551566806219479 0.64992905036579141 -0.75716571946238087
-1.0567585417111292 -0.30521524694909541 -0.88410882140193792  -0.14399073917102856 0.44447864693329697 -0.88414105178604074
-1.0379143432554527 -0.68282536162972496 -0.98448758643139411  -0.16230850425355162 0.067102997401376596 -0.98445575684574349
-0.8121888532953363 -0.54331933670714994 -0.89826812139385281  -0.38778432700573373 0.20645471950357219 -0.89833165619575683
-1.3264800315542344 -0.13851819872979687 -0.78108437977813105  0.12697533232366065 0.61194488891504883 -0.78064122227310317
-1.0735199684457657 -0.13851819872979687 -0.78108437977813105  -0.12697533232366068 0.61194488891504917 -0.78064122227310306
-0.71201440833835727 -0.28105923500562391 -0.73618246464930537  -0.48809649929758525 0.4690753960489733 -0.73602315194220691
-0.30729748704039861 -0.84278707285381271 -0.43974499787970978  -0.89114360963582673 -0.1077606538006228 -0.44073882118289937
-1.3432414582888714 -0.30521524694909541 -0.88410882140193769  0.14399073917102914 0.44447864693329636 -0.88414105178604097
-1.2650724998901954 -0.10056625699618538 -0.75762878984770354  0.065515668062194235 0.64992905036579218 -0.7571657194623802
-1.0604939750774252 0.10675191169903997 -0.49650199476975138  -0.13935172210219512 0.85685972305470959 -0.49635925754815841
-1.3395060249225752 0.10675191169903997 -0.49650199476975149  0.13935172210219546 0.85685972305470937 -0.49635925754815863
-1.1620480582663888 -0.37028774683929055 -0.92432583806700219  -0.037984161450742703 0.3789629788711022 -0.92463196144413295
-1.366697048219299 -0.24380771528505651 -0.8461568796683262  0.16746624198175181 0.50593831119476096 -0.84615689033529862
-1.6017661266241012 -0.055333745045507476 -0.59667643972673035  0.40197239864759909 0.69455121880115755 -0.59667142984001009
-1.6879855916616431 -0.28105923500562385 -0.73618246464930504  0.4880964992975852 0.46907539604897641 -0.73602315194220502
-1.5797122531607097 -1.6743258380670021 -0.037951941733611459  0.37896297887110303 -0.92463196144413251 -0.037984161450741634
-1.7061922847149438 -1.5961568796683263 0.16669704821929854  0.50593831119475963 -0.84615689033529951 0.16746624198175114
-1.894666254954493 -1.3466764397267299 0.40176612662410111  0.69455121880115811 -0.59667142984000976 0.40197239864759887
-1.6689407649943768 -1.4861824646493051 0.48798559166164246  0.46907539604897658 -0.73602315194220391 0.48809649929758681
-1.7061922847149438 -1.5961568796683263 -0.16669704821929854  0.50593831119476118 -0.84615689033529851 -0.16746624198175206
-1.5797122531607097 -1.6743258380670021 0.037951941733611459  0.37896297887110275 -0.92463196144413262 0.037984161450742147
-1.4066806632928506 -1.6482681213938526 0.38781114670466382  0.20645471950357258 -0.89833165619575639 0.38778432700573445
-1.2671746383702751 -1.734487586431394 0.16208565674454747  0.067102997401377568 -0.98445575684574371 0.16230850425355034
-1.8494337430038148 -1.5076287898477032 -0.065072499890195132  0.6499290503657924 -0.75716571946237987 -0.065515668062194901
-1.644784753050905 -1.6341088214019375 -0.14324145828887103  0.44447864693329742 -0.88414105178604052 -0.1439907391710285
-1.2671746383702751 -1.734487586431394 -0.1620856567445475  0.067102997401377554 -0.9844557568457436 -0.16230850425355034
-1.4066806632928501 -1.6482681213938526 -0.38781114670466388  0.20645471950357133 -0.89833165619575706 -0.38778432700573379
-1.8114818012702036 -1.5310843797781306 0.12648003155423412  0.61194488891505039 -0.78064122227310206 0.12697533232366004
-1.8114818012702032 -1.5310843797781311 -0.12648003155423404  0.61194488891505039 -0.78064122227310195 -0.12697533232366071
-1.6689407649943762 -1.4861824646493054 -0.48798559166164257  0.46907539604897536 -0.73602315194220458 -0.48809649929758692
-1.8946662549544926 -1.3466764397267301 -0.40176612662410144  0.69455121880115889 -0.59667142984000843 -0.40197239864759948
-1.644784753050905 -1.6341088214019375 0.14324145828887103  0.44447864693329797 -0.88414105178604019 0.14399073917102917
-1.8494337430038148 -1.5076287898477032 0.065072499890195132  0.64992905036579174 -0.75716571946238065 0.065515668062194485
-2.05675191169904 -1.2465019947697511 -0.13950602492257502  0.85685972305470937 -0.49635925754815885 -0.13935172210219485
-2.05675191169904 -1.2465019947697513 0.13950602492257499  0.85685972305470992 -0.49635925754815841 0.13935172210219243
-1.9576287898477038 -0.68492750010980474 0.64943374300381451  0.75716571946238143 0.065515668062194721 0.64992905036579074
-2.0841088214019377 -0.60675854171112908 0.44478475305090454  0.88414105178604185 0.1439907391710267 0.44447864693329542
-2.184487586431394 -0.58791434325545278 0.067174638370274917  0.98445575684574316 0.16230850425355473 0.067102997401375208
-2.0982681213938523 -0.36218885329533629 0.20668066329284998  0.8983316561957565 0.38778432700573418 0.20645471950357294
-1.2379519417336116 -1.1297122531607096 -0.92432583806700219  0.037984161450743827 -0.37896297887110214 -0.92463196144413284
-1.0333029517807015 -1.2561922847149436 -0.84615687966832631  -0.16746624198175092 -0.50593831119476174 -0.8461568903352984
-0.79823387337589879 -1.4446662549544924 -0.59667643972673035  -0.40197239864759976 -0.69455121880115789 -0.59667142984000954
-0.71201440833835727 -1.2189407649943762 -0.73618246464930548  -0.48809649929758536 -0.46907539604897658 -0.73602315194220491
-0.88317063762809189 0.078036377421090597 -0.46105412139556579  -0.30871603125498165 0.82882275556678564 -0.46663395922377265
-0.85822228618686602 0.038871133598592081 -0.51061830246204121  -0.34181621487256764 0.80836571705726512 -0.47927710433180942
-0.30173187860614725 -1.1378111467046637 -0.20668066329285001  -0.8983316561957575 -0.38778432700573268 -0.20645471950357161
-0.85756840681366708 0.037892913779084561 -0.51176714118576794  -0.37438115159300894 0.78669229841288646 -0.49087063565642458
-0.85711100340627266 0.037134436368273085 -0.51257565524045945  -0.37394295240641229 0.76556189758093773 -0.52352807882466956
-0.4189156202218689 -0.87648003155423404 0.61148180127020324  -0.78064122227310373 -0.12697533232365851 0.61194488891504861
-0.4638175353506947 -1.2379855916616427 0.46894076499437615  -0.7360231519422048 -0.48809649929758536 0.46907539604897669
-0.60332356027326994 -1.1517661266241017 0.69466625495449275  -0.59667142984000954 -0.40197239864759987 0.69455121880115778
-0.37506412073313466 -0.73422479552976916 -0.56417193374348928  -0.82793015848818508 0.02987930722740377 -0.56003471291102958
-0.69607577061268988 -0.22054081151140004 -0.68235511400187066  -0.51008352708668259 0.5567486374361299 -0.65562622744046961
-0.69531998299352837 -0.2217116289121196 -0.68272481536695306  -0.53557400721094017 0.52649133823230443 -0.66027823950693165
-0.49314081475211935 -0.54531814984023863 -0.67677227421098896  -0.71657063832563506 0.23106145751844359 -0.65813153938938718
-1.0333029517807018 -1.2561922847149436 0.84615687966832642  -0.16746624198175139 -0.50593831119476218 0.84615689033529806
-1.2379519417336118 -1.1297122531607096 0.92432583806700219  0.037984161450743785 -0.3789629788711022 0.92463196144413284
-1.5878111467046638 -0.95668066329284995 0.89826812139385259  0.38778432700573395 -0.20645471950357216 0.89833165619575672
-1.3620856567445476 -0.81717463837027482 0.984487586431394  0.16230850425355228 -0.067102997401377873 0.98445575684574327
-2.0841088214019381 -0.8932414582888708 0.44478475305090431  0.88414105178604174 -0.14399073917102748 0.44447864693329536
-1.9576287898477038 -0.81507249989019503 0.64943374300381418  0.75716571946238109 -0.065515668062195317 0.64992905036579107
-1.6965019947697519 -0.61049397507742498 0.85675191169903975  0.4963592575481578 0.13935172210219332 0.85685972305471014
-1.6965019947697517 -0.88950602492257513 0.85675191169903986  0.49635925754815879 -0.13935172210219521 0.85685972305470925
-1.9810843797781312 -0.87648003155423393 0.61148180127020291  0.78064122227310251 -0.12697533232365874 0.61194488891505017
-1.981084379778131 -0.62351996844576596 0.61148180127020324  0.78064122227310451 0.12697533232365912 0.61194488891504761
-1.9361824646493055 -0.26201440833835754 0.46894076499437615  0.73602315194220469 0.48809649929758597 0.46907539604897625
-1.7966764397267303 -0.34823387337589884 0.69466625495449263  0.59667142984000987 0.40197239864759826 0.69455121880115844
-1.8114818012702028 0.031084379778131277 -0.12648003155423412  0.61194488891504883 0.78064122227310351 -0.12697533232365837
-1.8114818012702028 0.031084379778131277 0.1264800315542341  0.61194488891504928 0.78064122227310329 0.12697533232365824
-1.6689407649943762 -0.013817535350694743 0.48798559166164268  0.46907539604897719 0.73602315194220391 0.48809649929758614
-1.8946662549544926 -0.15332356027326977 0.40176612662410138  0.69455121880115822 0.59667142984000932 0.40197239864759937
-1.8494337430038144 0.0076287898477036542 0.06507249989019516  0.64992905036579107 0.7571657194623812 0.065515668062194943
-1.644784753050905 0.13410882140193758 0.14324145828887103  0.44447864693329647 0.88414105178604085 0.14399073917102947
-1.2671746383702749 0.23448758643139411 0.16208565674454739  0.067102997401376929 0.9844557568457436 0.16230850425355112
-1.4066806632928499 0.14826812139385259 0.38781114670466377  0.20645471950357358 0.8983316561957565 0.38778432700573373
-0.48978532609687886 -0.55056521742650477 -0.67476755984413894  -0.73148064944405733 0.19693655197206733 -0.65280322761629583
-0.61696807586665503 -0.34742682425518878 -0.70495163176324005  -0.5657510681692498 0.40400744901774482 -0.71882105562060938
-0.99331933670715 0.14826812139385259 0.38781114670466377  -0.20645471950357225 0.89833165619575683 0.38778432700573368
-1.132825361629725 0.23448758643139411 0.16208565674454739  -0.067102997401376499 0.98445575684574338 0.16230850425355248
-0.76687916779802356 -0.10789205109760849 0.63136143448574888  -0.42807141203226429 0.64268086340021879 0.63538663349165025
-0.73203596503112123 -0.16333083529035372 0.66003296952840662  -0.48378799724665117 0.58634540105761479 0.64972936241073409
-0.69531998299352837 -0.22171162891211948 0.68272481536695295  -0.53557400721089998 0.52649133823231298 0.66027823950695741
-0.49314081475211924 -0.54531814984023841 0.67677227421098896  -0.71657063832563861 0.23106145751843574 0.65813153938938596
-0.50622685812276469 -0.5257151024560045 0.68341702461536258  -0.68956138101064823 0.23429135260019798 0.6852829079405508
-0.80104197563456969 -0.053122466844444549 0.59574101077153174  -0.37119418317776498 0.71962089011270347 0.58682250543788128
-0.74532674141002397 -0.14250706129079604 0.65018159643527595  -0.45629539576529471 0.61497179190323714 0.64312067838525833
-0.69607577061268988 -0.22054081151139987 0.68235511400187043  -0.51008352708665927 0.55674863743613534 0.65562622744048316
-0.48978532609687886 -0.55056521742650477 0.67476755984413894  -0.73148064944406666 0.19693655197206644 0.65280322761628573
-0.4423712101522963 -0.68492750010980474 0.64943374300381473  -0.75716571946238165 0.065515668062194721 0.64992905036579052
-0.70349800523024886 -0.88950602492257524 0.85675191169903997  -0.4963592575481578 -0.13935172210219493 0.85685972305470992
-0.70349800523024875 -0.61049397507742498 0.85675191169904008  -0.49635925754815841 0.1393517221021956 0.85685972305470948
-1.1349275001098049 -1.3994337430038146 0.75762878984770365  -0.065515668062193971 -0.64992905036579174 0.75716571946238065
-1.0567585417111292 -1.1947847530509048 0.88410882140193769  -0.14399073917102845 -0.44447864693329675 0.88414105178604085
-1.0379143432554527 -0.81717463837027482 0.98448758643139411  -0.1623085042535517 -0.06710299740137679 0.98445575684574349
-0.81218885329533652 -0.95668066329285006 0.89826812139385281  -0.3877843270057334 -0.20645471950357266 0.89833165619575683
-2.0841088214019377 -0.60675854171112875 -0.4447847530509047  0.8841410517860413 0.14399073917102739 -0.44447864693329625
-1.9576287898477038 -0.68492750010980474 -0.64943374300381451  0.75716571946238087 0.065515668062195193 -0.64992905036579141
-1.6965019947697517 -0.88950602492257502 -0.85675191169903986  0.4963592575481578 -0.1393517221021954 -0.85685972305470981
-1.6965019947697517 -0.61049397507742487 -0.85675191169903986  0.49635925754815935 0.13935172210219479 -0.85685972305470903
-1.2650724998901952 -1.3994337430038146 -0.75762878984770365  0.065515668062195276 -0.64992905036579218 -0.7571657194623802
-1.343241458288871 -1.1947847530509048 -0.88410882140193769  0.14399073917102839 -0.44447864693329625 -0.88414105178604108
-1.3620856567445476 -0.81717463837027482 -0.984487586431394  0.16230850425355228 -0.067102997401377873 -0.98445575684574327
-1.5878111467046643 -0.95668066329284984 -0.89826812139385248  0.38778432700573462 -0.20645471950357236 -0.89833165619575639
-1.3666970482192984 -1.2561922847149436 -0.84615687966832631  0.16746624198175147 -0.50593831119476262 -0.84615689033529773
-1.1620480582663888 -1.1297122531607096 -0.92432583806700219  -0.037984161450743952 -0.3789629788711022 -0.92463196144413284
-0.8121888532953363 -0.95668066329284995 -0.89826812139385281  -0.38778432700573318 -0.20645471950357211 -0.89833165619575706
-1.0379143432554525 -0.81717463837027482 -0.984487586431394  -0.1623085042535517 -0.067102997401376374 -0.98445575684574349
-0.31589117859806226 -0.89324145828887092 -0.44478475305090459  -0.88414105178604019 -0.14399073917102886 -0.44447864693329792
-0.4423712101522963 -0.81507249989019515 -0.64943374300381473  -0.75716571946238154 -0.065515668062196011 -0.64992905036579063
-0.70349800523024875 -0.61049397507742498 -0.85675191169904008  -0.49635925754815741 0.13935172210219424 -0.85685972305471025
-0.70349800523024875 -0.88950602492257502 -0.85675191169904008  -0.49635925754815852 -0.13935172210219521 -0.85685972305470948
-0.41891562022186868 -0.87648003155423404 -0.61148180127020324  -0.78064122227310406 -0.12697533232365943 -0.61194488891504806
-0.30729748704039866 -0.84278707285381271 0.43974499787970989  -0.89114360963582573 -0.10776065380062243 0.44073882118290153
-0.45944041532897167 -0.59972505245462004 0.65399889841309089  -0.74496666446894599 0.16330181399315546 0.64680536978024361
-0.22589145876869662 -0.97323020415808847 -0  -0.97034898997513452 -0.24170816629612682 -1.7351406520252288e-18
-0.42861413394522369 -0.64891100701386606 0.62717432611494872  -0.76918721291849634 0.096596587118422922 0.6316804024502809
-0.39411849558532497 -0.70426794627197542 0.58956860097969033  -0.81036094014927595 0.030667519535218936 0.58512789193982073
-0.40065939257699124 -0.69413734830776375 0.59790562905682232  -0.79006130932899898 0.031934562996056987 0.61219548445541361
-0.40435813432554857 -0.6879005781223142 0.60211592452938867  -0.77995892884278528 0.063643445898665135 0.62258620376021723
-0.83001349060802165 -0.0073066631575244463 0.55678551944213661  -0.37302523877669125 0.74314518846920219 0.55550643568789215
-0.88317063762809178 0.078036377421090528 0.46105412139556579  -0.30871603125498187 0.82882275556678742 0.46663395922376916
-1.1328253616297255 0.23448758643139411 -0.16208565674454739  -0.06710299740137636 0.98445575684574338 -0.16230850425355245
-0.99331933670714989 0.14826812139385259 -0.38781114670466377  -0.2064547195035718 0.89833165619575706 -0.38778432700573351
-1.7061922847149438 0.096156879668326201 0.16669704821929851  0.5059383111947624 0.84615689033529762 0.16746624198175261
-1.5797122531607097 0.17432583806700197 -0.037951941733611452  0.37896297887110231 0.92463196144413273 -0.037984161450742869
-1.4066806632928499 0.14826812139385259 -0.38781114670466377  0.20645471950357397 0.89833165619575661 -0.38778432700573345
-1.2671746383702751 0.234487586431394 -0.16208565674454736  0.067102997401377096 0.98445575684574349 -0.16230850425355106
-1.5797122531607097 0.17432583806700197 0.037951941733611452  0.37896297887110236 0.92463196144413273 0.037984161450742897
-1.7061922847149438 0.096156879668326201 -0.16669704821929851  0.50593831119476229 0.84615689033529762 -0.16746624198175269
-1.8946662549544926 -0.15332356027326977 -0.40176612662410138  0.694551218801158 0.59667142984000943 -0.40197239864759959
-1.6689407649943766 -0.013817535350694743 -0.48798559166164251  0.46907539604897602 0.73602315194220491 -0.48809649929758575
-2.1243258380670023 -0.78795194173361138 -0.37971225316070939  0.92463196144413207 -0.037984161450740968 -0.37896297887110436
-2.0461568796683265 -0.58330295178070157 -0.50619228471494349  0.84615689033529629 0.16746624198175158 -0.50593831119476507
-1.7966764397267307 -0.34823387337589884 -0.6946662549544923  0.59667142984001131 0.40197239864759826 -0.69455121880115711
-1.9361824646493055 -0.26201440833835749 -0.46894076499437609  0.73602315194220491 0.48809649929758581 -0.46907539604897613
-2.1243258380670023 -0.71204805826638851 0.37971225316070928  0.92463196144413196 0.037984161450741689 0.37896297887110458
-2.0461568796683265 -0.91669704821929832 0.50619228471494315  0.84615689033529806 -0.16746624198175214 0.50593831119476163
-1.7966764397267307 -1.1517661266241008 0.6946662549544923  0.59667142984001087 -0.40197239864759859 0.69455121880115722
-1.9361824646493058 -1.2379855916616425 0.46894076499437604  0.73602315194220613 -0.48809649929758475 0.46907539604897519
-1.1620480582663888 -1.1297122531607096 0.92432583806700219  -0.037984161450743834 -0.3789629788711022 0.92463196144413284
-1.366697048219299 -1.2561922847149434 0.8461568796683262  0.16746624198175136 -0.50593831119476185 0.84615689033529817
-1.6017661266241021 -1.4446662549544924 0.59667643972673023  0.40197239864759998 -0.69455121880115755 0.59667142984000965
-1.6879855916616431 -1.2189407649943764 0.73618246464930504  0.48809649929758564 -0.46907539604897819 0.73602315194220369
-1.3432414582888712 -1.1947847530509048 0.88410882140193758  0.14399073917102836 -0.44447864693329742 0.88414105178604063
-1.2650724998901954 -1.3994337430038146 0.75762878984770343  0.065515668062195984 -0.64992905036579063 0.75716571946238143
-1.0604939750774252 -1.6067519116990399 0.49650199476975138  -0.13935172210219554 -0.85685972305470992 0.49635925754815763
-1.3395060249225756 -1.6067519116990399 0.49650199476975138  0.13935172210219615 -0.85685972305471048 0.49635925754815646
-0.55056625699618522 -1.5076287898477037 0.06507249989019516  -0.64992905036579063 -0.75716571946238176 0.065515668062193319
-0.75521524694909514 -1.6341088214019377 0.14324145828887108  -0.44447864693329719 -0.88414105178604041 0.14399073917102923
-1.1328253616297252 -1.7344875864313942 0.1620856567445475  -0.06710299740137686 -0.98445575684574349 0.16230850425355189
-0.99331933670714978 -1.6482681213938526 0.38781114670466388  -0.20645471950357261 -0.89833165619575661 0.3877843270057339
-0.69380771528505625 -1.5961568796683263 0.16669704821929854  -0.50593831119476085 -0.84615689033529895 0.16746624198175111
-0.8202877468392904 -1.6743258380670021 -0.037951941733611466  -0.37896297887110214 -0.92463196144413284 -0.037984161450743383
-0.99331933670715045 -1.648268121393853 -0.38781114670466399  -0.20645471950357216 -0.89833165619575694 -0.3877843270057334
-1.132825361629725 -1.7344875864313942 -0.16208565674454753  -0.067102997401376846 -0.98445575684574349 -0.16230850425355181
-1.0567585417111292 -1.1947847530509048 -0.88410882140193769  -0.14399073917102848 -0.44447864693329681 -0.88414105178604085
-1.1349275001098047 -1.3994337430038146 -0.75762878984770343  -0.065515668062195553 -0.64992905036579085 -0.75716571946238131
-1.3395060249225752 -1.6067519116990399 -0.49650199476975138  0.13935172210219487 -0.85685972305471048 -0.49635925754815685
-1.0604939750774247 -1.6067519116990399 -0.49650199476975149  -0.13935172210219574 -0.85685972305470981 -0.49635925754815791
-1.0735199684457657 -1.361481801270203 -0.78108437977813105  -0.12697533232365951 -0.61194488891504895 -0.7806412222731034
-1.3264800315542338 -1.361481801270203 -0.78108437977813105  0.12697533232366054 -0.61194488891504906 -0.78064122227310306
-1.6879855916616426 -1.2189407649943764 -0.73618246464930526  0.48809649929758481 -0.46907539604897808 -0.73602315194220436
-1.6017661266241014 -1.4446662549544926 -0.59667643972673035  0.40197239864759937 -0.69455121880115822 -0.5966714298400092
-1.981084379778131 -0.62351996844576596 -0.61148180127020324  0.78064122227310462 0.1269753323236604 -0.61194488891504717
-1.981084379778131 -0.87648003155423404 -0.61148180127020324  0.78064122227310451 -0.12697533232365904 -0.61194488891504761
-1.9361824646493053 -1.2379855916616427 -0.46894076499437609  0.73602315194220447 -0.48809649929758625 -0.46907539604897625
-1.7966764397267303 -1.1517661266241015 -0.69466625495449252  0.59667142984001065 -0.40197239864759915 -0.69455121880115711
-1.9576287898477038 -0.81507249989019503 -0.64943374300381451  0.75716571946238154 -0.06551566806219572 -0.64992905036579063
-2.0841088214019377 -0.89324145828887092 -0.4447847530509047  0.88414105178604063 -0.14399073917102975 -0.44447864693329681
-2.184487586431394 -0.91208565674454722 -0.067174638370274917  0.98445575684574305 -0.16230850425355456 -0.067102997401375694
-2.0982681213938528 -1.1378111467046637 -0.20668066329284984  0.89833165619575694 -0.3877843270057339 -0.20645471950357122
-2.0461568796683265 -0.58330295178070157 0.50619228471494349  0.8461568903352964 0.16746624198175114 0.50593831119476484
-2.1243258380670023 -0.78795194173361149 0.37971225316070928  0.92463196144413196 -0.037984161450741592 0.37896297887110447
-2.0982681213938528 -1.1378111467046632 0.20668066329284987  0.89833165619575794 -0.38778432700573207 0.20645471950357039
-2.184487586431394 -0.91208565674454722 0.067174638370274903  0.98445575684574305 -0.16230850425355453 0.06710299740137543
-2.0461568796683265 -0.91669704821929843 -0.50619228471494349  0.84615689033529751 -0.1674662419817522 -0.50593831119476262
-2.1243258380670023 -0.71204805826638851 -0.37971225316070939  0.92463196144413207 0.037984161450741016 -0.37896297887110436
-2.0982681213938528 -0.36218885329533623 -0.20668066329284998  0.89833165619575639 0.38778432700573406 -0.20645471950357319
-2.184487586431394 -0.58791434325545255 -0.067174638370274903  0.98445575684574316 0.16230850425355467 -0.067102997401375042
-1.644784753050905 0.13410882140193758 -0.143241458288871  0.44447864693329647 0.88414105178604085 -0.14399073917102947
-1.8494337430038144 0.0076287898477036542 -0.06507249989019516  0.64992905036579063 0.75716571946238165 -0.065515668062194693
-2.05675191169904 -0.25349800523024879 0.13950602492257499  0.8568597230547097 0.49635925754815813 0.13935172210219496
-2.05675191169904 -0.25349800523024862 -0.13950602492257505  0.85685972305470925 0.49635925754815879 -0.1393517221021951
-0.8202877468392904 -1.6743258380670021 0.037951941733611466  -0.37896297887110236 -0.92463196144413284 0.037984161450741516
-0.69380771528505636 -1.5961568796683263 -0.16669704821929857  -0.50593831119476029 -0.84615689033529895 -0.16746624198175245
-0.50533374504550721 -1.3466764397267301 -0.40176612662410133  -0.694551218801158 -0.5966714298400092 -0.4019723986475997
-0.73105923500562364 -1.4861824646493054 -0.48798559166164257  -0.46907539604897608 -0.73602315194220536 -0.48809649929758508
-0.85822228618686625 0.03887113359859222 0.51061830246204121  -0.34181621487250108 0.80836571705727955 0.47927710433183263
-0.35384312033167364 -0.91669704821929843 -0.50619228471494349  -0.84615689033529784 -0.16746624198175167 -0.5059383111947624
-0.60332356027326961 -1.151766126624101 -0.69466625495449275  -0.59667142984000965 -0.40197239864759926 -0.694551218801158
-0.46381753535069448 -1.2379855916616425 -0.46894076499437626  -0.7360231519422048 -0.48809649929758558 -0.46907539604897658
-0.75521524694909514 -1.6341088214019377 -0.14324145828887105  -0.44447864693329858 -0.88414105178603974 -0.14399073917102934
-0.55056625699618522 -1.5076287898477037 -0.06507249989019516  -0.64992905036579107 -0.7571657194623812 -0.065515668062194832
-0.34324808830095987 -1.2465019947697513 0.13950602492257511  -0.85685972305470925 -0.49635925754815863 0.13935172210219582
-0.3432480883009601 -1.2465019947697515 -0.13950602492257505  -0.85685972305470937 -0.49635925754815879 -0.13935172210219504
-0.44237121015229641 -0.81507249989019515 0.64943374300381473  -0.75716571946238165 -0.065515668062195415 0.64992905036579052
-0.31589117859806226 -0.89324145828887092 0.44478475305090459  -0.88414105178604041 -0.14399073917102892 0.44447864693329753
-0.60785615600797449 -0.36184045701812123 0.70538094374692573  -0.58682250543788061 0.37119418317777192 0.71962089011270058
-0.30173187860614725 -1.1378111467046637 0.20668066329285004  -0.89833165619575683 -0.38778432700573301 0.20645471950357339
-0.5885181987297966 -1.5310843797781311 -0.12648003155423418  -0.61194488891505017 -0.78064122227310262 -0.12697533232365818
-0.58851819872979683 -1.5310843797781311 0.12648003155423407  -0.61194488891504872 -0.78064122227310384 0.12697533232365801
-0.73105923500562386 -1.4861824646493056 0.48798559166164268  -0.46907539604897658 -0.73602315194220447 0.48809649929758603
-0.50533374504550732 -1.3466764397267301 0.40176612662410144  -0.69455121880115811 -0.59667142984000943 0.40197239864759932
-1.3264800315542344 -1.361481801270203 0.78108437977813105  0.12697533232365971 -0.61194488891504917 0.78064122227310317
-1.0735199684457661 -1.361481801270203 0.78108437977813105  -0.12697533232365837 -0.61194488891504839 0.78064122227310384
-0.71201440833835772 -1.2189407649943766 0.73618246464930526  -0.48809649929758503 -0.46907539604897552 0.7360231519422058
-0.79823387337589868 -1.4446662549544926 0.59667643972673035  -0.40197239864759965 -0.69455121880115789 0.59667142984000932
-0.44237121015229641 -0.68492750010980474 -0.64943374300381462  -0.75716571946238065 0.065515668062196025 -0.64992905036579152
-0.85756840681366708 0.037892913779084658 0.51176714118576794  -0.37438115159293933 0.78669229841287958 0.49087063565648881
-0.33951337109735685 -0.79211156275891992 0.50664961250726281  -0.85780946571559169 -0.048345734654242835 0.51168897825678505
-0.90598861546737153 0.11471241548978531 0.40567809407889893  -0.30717055145208666 0.86468532536853959 0.39744878967349206
-0.35384312033167364 -0.91669704821929843 0.5061922847149436  -0.84615689033529773 -0.16746624198175142 0.50593831119476262
-0.29057971437419006 -0.8695923485436825 0.39708487175152696  -0.9010098816558636 -0.12889639121160246 0.41420636582639847
-0.94691066341902042 0.17998804508785277 0.2643958831644852  -0.23565009060476796 0.93757115374046096 0.25579164660274861
-0.23440017510432309 -0.9594775020158709 0.15035899655759533  -0.96089435748012464 -0.21982881690250275 0.16839633316110023
-1.7894256868089482 -0.54268760819673556 0.78076816785433145  0.58928970592655816 0.20735457304096669 0.78085960551688738
-1.7760838378857438 -0.41005164309557446 0.74334549596053456  0.57610127698437386 0.34013694034011421 0.74324570666303846
-1.6048073899588975 0.071782225985176584 0.40100492526839776  0.40477696304846206 0.82172156155092002 0.40115992505181985
-1.4746684461261839 0.11574218443040096 0.41838703947458178  0.27447137325094773 0.86581974808662088 0.41835586417422094
-0.97011813854669382 0.21732927410114633 -0.099634331047451452  -0.22974865031682512 0.96813269657427847 -0.099672661755434044
-0.22648000271342913 -0.97241808576487487 0.034988854233130556  -0.97444445519669098 -0.22205052462855629 0.033934764602202253
-0.58553016581808792 -0.47712117915505481 0.7402458861856146  -0.61436698850995397 0.27300775118977938 0.74028370995146842
-0.67420617247402481 -0.54171259951203321 0.82471644201722483  -0.52568280774650467 0.20813967421463528 0.8248245035506504
-1.1594777183312834 -0.88192856911395234 0.99043061207734606  -0.040575895565417713 -0.13176921185868196 0.99044963097837846
-1.2813709460566907 -0.81638104563821712 0.9944708773603258  0.08157879688761327 -0.066331699036313224 0.99445714115859496
-1.2405222816687171 -0.88192856911395234 -0.99043061207734606  0.040575895565419177 -0.13176921185868273 -0.99044963097837824
-1.1186290539433099 -0.81638104563821712 -0.9944708773603258  -0.081578796887611563 -0.066331699036312169 -0.99445714115859518
-0.61057431319105182 -0.54268760819673556 -0.78076816785433145  -0.58928970592655905 0.20735457304096611 -0.78085960551688693
-0.62391616211425605 -0.4100516430955744 -0.74334549596053467  -0.57610127698437219 0.34013694034011444 -0.74324570666303968
-0.44633019100468213 -0.6204277684668269 0.64334361719230826  -0.75782534074317609 0.12946239417784172 0.63948435588466901
-0.92533155387381627 0.11574218443040096 -0.41838703947458178  -0.27447137325094867 0.86581974808661977 -0.4183558641742226
-1.5392409609172171 0.11230450765389333 -0.37596077789543397  0.3391237848996484 0.86229745711633887 -0.37608264246842421
-1.6063294025426431 0.034371238373710589 -0.46867704983435055  0.40646863937642885 0.78424095119900827 -0.46877433341209029
-1.8144698341819121 -0.47712117915505486 -0.74024588618561449  0.61436698850995375 0.27300775118977783 -0.74028370995146908
-1.7257938275259752 -0.54171259951203332 -0.8247164420172246  0.52568280774650511 0.208139674214634 -0.82482450355065062
-1.4728788208449455 -1.4902458861856145 0.61446983418191214  0.27300775118977938 -0.74028370995146853 0.61436698850995375
-1.4082874004879673 -1.5747164420172246 0.52579382752597537  0.20813967421463753 -0.82482450355064973 0.52568280774650489
-1.0680714308860475 -1.7404306120773461 0.040522281668716881  -0.13176921185868209 -0.99044963097837846 0.040575895565416957
-1.1336189543617827 -1.7444708773603259 -0.081370946056690305  -0.066331699036311975 -0.99445714115859518 -0.081578796887612326
-1.4073123918032646 -1.5307681678543315 -0.58942568680894825  0.20735457304096758 -0.78085960551688605 -0.5892897059265596
-1.5399483569044259 -1.4933454959605346 -0.57608383788574391  0.34013694034011616 -0.74324570666303846 -0.57610127698437275
-2.0217822259851768 -1.1510049252683974 -0.40480738995889748  0.82172156155091891 -0.40115992505181947 -0.40477696304846428
-2.0657421844304009 -1.1683870394745819 -0.27466844612618391  0.8658197480866201 -0.41835586417422149 -0.27447137325094928
-2.0623045076538937 -1.1259607778954335 0.33924096091721662  0.86229745711633854 -0.37608264246842521 0.33912378489964823
-1.9843712383737109 -1.2186770498343504 0.4063294025426426  0.7842409511990085 -0.46877433341209024 0.40646863937642835
-1.9807681678543314 -0.16057431319105187 0.20731239180326444  0.78085960551688671 0.58928970592655905 0.20735457304096724
-1.9433454959605347 -0.17391616211425609 0.33994835690442565  0.7432457066630388 0.5761012769843723 0.34013694034011616
-0.58553016581808792 -1.0228788208449453 -0.7402458861856146  -0.61436698850995408 -0.27300775118978016 -0.74028370995146797
-0.67420617247402481 -0.95828740048796679 -0.82471644201722483  -0.52568280774650533 -0.20813967421463467 -0.82482450355065018
-0.22648000271342919 -0.97241808576487498 -0.034988854233130702  -0.97444445519669121 -0.2220505246285554 -0.033934764602202044
-0.97256579272521637 0.22114863140943242 -0.060907607905721597  -0.22895713509379073 0.97158621857248995 -0.05999041731521329
-0.79899507473160258 -1.1548073899588978 0.82178222598517658  -0.4011599250518188 -0.40477696304846206 0.82172156155092035
-0.78161296052541851 -1.0246684461261841 0.86574218443040096  -0.41835586417422171 -0.274471373250948 0.86581974808662043
-0.23052646968895496 -0.9659260788205124 -0.10986054425367295  -0.96991439832021331 -0.22132188318768922 -0.10140356972707359
-0.89637854466934042 0.099164106023202803 0.43023759412454371  -0.30820444126016328 0.84736796744948673 0.43240900791731435
-1.2405222816687171 -0.61807143088604766 0.99043061207734606  0.040575895565417304 0.13176921185868257 0.99044963097837835
-1.1186290539433099 -0.68361895436178266 0.9944708773603258  -0.081578796887611715 0.066331699036312697 0.99445714115859518
-1.5759607778954345 -1.0892409609172169 0.86230450765389322  0.37608264246842527 -0.33912378489964723 0.86229745711633898
-1.6686770498343511 -1.1563294025426427 0.78437123837371048  0.46877433341208979 -0.40646863937642735 0.78424095119900927
-1.6010049252683982 -0.34519261004110269 0.82178222598517647  0.40115992505181947 0.4047769630484615 0.82172156155092035
-1.6183870394745821 -0.4753315538738162 0.86574218443040085  0.41835586417422244 0.27447137325094906 0.86581974808661977
-2.0217822259851763 -0.34899507473160229 0.40480738995889742  0.82172156155091947 0.4011599250518208 0.404776963048462
-2.0657421844304009 -0.33161296052541811 0.27466844612618396  0.86581974808662043 0.41835586417422121 0.27447137325094878
-1.4073123918032646 0.030768167854331341 0.58942568680894825  0.20735457304096602 0.78085960551688716 0.58928970592655872
-1.5399483569044259 -0.0066545040394655475 0.57608383788574402  0.34013694034011532 0.7432457066630388 0.57610127698437286
-1.3319285691139524 0.24043061207734606 0.040522281668716874  0.13176921185868176 0.99044963097837846 0.040575895565417866
-1.2663810456382176 0.24447087736032569 -0.081370946056690249  0.06633169903631346 0.99445714115859496 -0.081578796887612909
-0.92712117915505499 -0.0097541138143855122 0.61446983418191226  -0.27300775118977944 0.74028370995146875 0.61436698850995353
-0.99171259951203328 0.074716442017224605 0.52579382752597525  -0.20813967421463495 0.82482450355065018 0.52568280774650544
-0.95663400990185354 0.19602936533555493 -0.2109426096162656  -0.2338856613018607 0.9476428056300582 -0.21741805439057521
-0.23440017510432298 -0.95947750201587068 -0.15035899655759499  -0.96089435748012531 -0.21982881690250236 -0.16839633316109734
-0.82403922210456626 -0.41075903908278316 0.86230450765389344  -0.37608264246842471 0.33912378489964923 0.86229745711633832
-0.7313229501656493 -0.34367059745735706 0.78437123837371059  -0.46877433341208918 0.40646863937642791 0.78424095119900927
-0.61057431319105182 -0.95731239180326477 0.78076816785433145  -0.58928970592655894 -0.20735457304096766 0.7808596055168866
-0.62391616211425616 -1.0899483569044262 0.74334549596053456  -0.5761012769843723 -0.34013694034011405 0.7432457066630398
-1.5759607778954345 -0.41075903908278322 -0.86230450765389333  0.37608264246842582 0.33912378489964795 -0.86229745711633854
-1.6686770498343511 -0.34367059745735712 -0.78437123837371048  0.46877433341208957 0.40646863937642819 -0.78424095119900894
-1.7894256868089482 -0.95731239180326444 -0.78076816785433145  0.58928970592655905 -0.20735457304096702 -0.7808596055168866
-1.7760838378857438 -1.0899483569044257 -0.74334549596053456  0.57610127698437363 -0.34013694034011327 -0.74324570666303913
-1.1594777183312832 -0.61807143088604766 -0.99043061207734606  -0.040575895565417359 0.13176921185868248 -0.99044963097837835
-1.2813709460566907 -0.68361895436178266 -0.9944708773603258  0.081578796887612035 0.066331699036312766 -0.99445714115859507
-0.82403922210456604 -1.0892409609172167 -0.86230450765389355  -0.3760826424684251 -0.33912378489964973 -0.86229745711633798
-0.7313229501656493 -1.1563294025426427 -0.78437123837371059  -0.4687743334120904 -0.40646863937642796 -0.78424095119900861
-0.79899507473160236 -0.34519261004110258 -0.82178222598517681  -0.40115992505181919 0.40477696304846128 -0.82172156155092069
-0.78161296052541818 -0.47533155387381615 -0.86574218443040096  -0.41835586417422232 0.27447137325094867 -0.86581974808661999
-0.26660413751883788 -0.90759811547986158 -0.32187126056253335  -0.9389351707936171 -0.17584665747242048 -0.29576798018470224
-0.90598861546737175 0.11471241548978534 -0.40567809407889899  -0.30717055145208433 0.86468532536854059 -0.39744878967349201
-0.9926876081967354 0.030768167854331341 -0.58942568680894825  -0.20735457304096647 0.78085960551688738 -0.58928970592655838
-0.86005164309557414 -0.0066545040394655475 -0.57608383788574402  -0.34013694034011627 0.7432457066630378 -0.57610127698437363
-1.0680714308860475 0.24043061207734606 -0.040522281668716874  -0.13176921185868209 0.99044963097837835 -0.040575895565418345
-1.1336189543617827 0.24447087736032569 0.081370946056690249  -0.066331699036312516 0.99445714115859507 0.081578796887611868
-1.4728788208449453 -0.0097541138143856232 -0.61446983418191214  0.27300775118978082 0.74028370995146775 -0.61436698850995386
-1.4082874004879666 0.074716442017224605 -0.52579382752597525  0.20813967421463389 0.82482450355065062 -0.525682807746505
-1.9402458861856144 -0.13553016581808797 -0.27287882084494514  0.74028370995146886 0.61436698850995319 -0.27300775118977955
-2.0247164420172248 -0.22420617247402475 -0.20828740048796671  0.82482450355065107 0.52568280774650455 -0.20813967421463353
-1.9402458861856147 -1.3644698341819117 0.27287882084494514  0.74028370995146797 -0.61436698850995408 0.27300775118977982
-2.0247164420172248 -1.275793827525975 0.20828740048796673  0.82482450355064985 -0.52568280774650611 0.20813967421463409
-1.8144698341819121 -1.0228788208449451 0.74024588618561449  0.61436698850995419 -0.27300775118977977 0.74028370995146808
-1.7257938275259752 -0.95828740048796668 0.8247164420172246  0.52568280774650455 -0.20813967421463375 0.82482450355065096
-1.5392409609172173 -1.6123045076538933 0.37596077789543392  0.33912378489965 -0.86229745711633787 0.37608264246842532
-1.6063294025426436 -1.5343712383737103 0.46867704983435066  0.4064686393764288 -0.78424095119900805 0.46877433341209074
-0.9926876081967354 -1.5307681678543315 0.58942568680894825  -0.20735457304096644 -0.78085960551688738 0.58928970592655838
-0.86005164309557425 -1.4933454959605346 0.57608383788574391  -0.34013694034011555 -0.74324570666303802 0.57610127698437374
-1.3319285691139524 -1.7404306120773461 -0.040522281668716881  0.13176921185868326 -0.99044963097837824 -0.040575895565418935
-1.2663810456382176 -1.7444708773603259 0.081370946056690305  0.06633169903631303 -0.99445714115859496 0.081578796887613519
-0.86075903908278328 -1.6123045076538935 -0.37596077789543397  -0.33912378489964795 -0.86229745711633887 -0.37608264246842465
-0.79367059745735691 -1.5343712383737107 -0.46867704983435077  -0.40646863937642813 -0.78424095119900827 -0.46877433341209057
-1.6048073899588975 -1.5717822259851766 -0.40100492526839776  0.40477696304846272 -0.82172156155092013 -0.40115992505181874
-1.4746684461261841 -1.6157421844304007 -0.41838703947458189  0.27447137325094856 -0.86581974808662043 -0.41835586417422149
-1.6010049252683982 -1.1548073899588973 -0.82178222598517647  0.40115992505182063 -0.40477696304846372 -0.82172156155091869
-1.6183870394745821 -1.0246684461261837 -0.86574218443040085  0.41835586417422288 -0.27447137325094717 -0.86581974808662021
-1.9807681678543316 -1.3394256868089478 -0.20731239180326447  0.78085960551688671 -0.58928970592655894 -0.20735457304096733
-1.9433454959605347 -1.3260838378857436 -0.33994835690442571  0.74324570666303957 -0.57610127698437175 -0.34013694034011566
-2.1904306120773462 -0.79052228166871663 -0.13192856911395226  0.99044963097837824 -0.040575895565418095 -0.13176921185868259
-2.1944708773603256 -0.66862905394330985 -0.066381045638217215  0.9944571411585954 0.081578796887609911 -0.066331699036310476
-2.1904306120773462 -0.70947771833128304 0.13192856911395226  0.99044963097837835 0.040575895565417991 0.13176921185868262
-2.1944708773603256 -0.83137094605669015 0.066381045638217215  0.9944571411585954 -0.081578796887609883 0.066331699036310532
-2.0623045076538933 -0.37403922210456625 -0.33924096091721662  0.86229745711633832 0.37608264246842527 -0.33912378489964884
-1.9843712383737104 -0.28132295016564945 -0.40632940254264299  0.78424095119900961 0.46877433341208929 -0.40646863937642713
-0.92712117915505499 -1.4902458861856145 -0.61446983418191214  -0.27300775118977999 -0.74028370995146797 -0.61436698850995419
-0.99171259951203317 -1.5747164420172246 -0.52579382752597537  -0.20813967421463431 -0.82482450355065084 -0.52568280774650455
-0.45975411381438525 -1.3644698341819119 -0.27287882084494525  -0.74028370995146831 -0.61436698850995397 -0.27300775118977955
-0.37528355798277513 -1.275793827525975 -0.20828740048796673  -0.82482450355065007 -0.52568280774650578 -0.20813967421463436
-0.33769549234610641 -1.1259607778954337 -0.33924096091721684  -0.86229745711633832 -0.37608264246842493 -0.33912378489964951
-0.41562876162628937 -1.2186770498343509 -0.40632940254264294  -0.7842409511990085 -0.46877433341209057 -0.40646863937642791
-0.4192318321456685 -1.339425686808948 0.20731239180326452  -0.78085960551688693 -0.58928970592655905 0.20735457304096619
-0.45665450403946539 -1.3260838378857438 0.33994835690442576  -0.74324570666303824 -0.57610127698437319 0.34013694034011571
-0.37821777401482337 -1.1510049252683976 0.40480738995889759  -0.82172156155092024 -0.40115992505181935 0.40477696304846178
-0.3342578155695991 -1.1683870394745819 0.27466844612618396  -0.86581974808662066 -0.41835586417422155 0.27447137325094767
-0.79519261004110253 -1.5717822259851766 0.40100492526839782  -0.40477696304846161 -0.82172156155091969 0.40115992505182096
-0.92533155387381616 -1.6157421844304007 0.41838703947458189  -0.27447137325094662 -0.86581974808662077 0.41835586417422183
-0.95663400990185377 0.19602936533555493 0.21094260961626571  -0.23388566130186217 0.9476428056300582 0.21741805439057377
-0.29057971437418995 -0.86959234854368261 -0.39708487175152679  -0.90100988165586327 -0.12889639121160226 -0.4142063658263993
-0.26791287934591512 -0.90549608434201145 -0.32699007860623575  -0.9178970478509777 -0.17153707639041774 -0.35782683098097606
-0.89637854466934042 0.099164106023202955 -0.43023759412454343  -0.30820444126016117 0.84736796744948772 -0.43240900791731401
-1.4681715176003196 -0.06070343884806495 0.6730187872058685  0.26836446324215069 0.68937955050281263 0.67285685715261334
-1.3930054401955474 -0.12542737832173334 0.75674166021493716  0.19358827458119565 0.62484261256047646 0.7563698099959264
-1.2397345885584119 -0.48973505164257786 0.96471929550963276  0.03967799912916483 0.25990051397960134 0.96481986879326087
-1.3598578035878233 -0.55062303027104398 0.96679589706089242  0.16010344242024407 0.19913925651268469 0.96680424297825807
-1.0617263178126279 0.019577838502176315 0.62340222914316246  -0.13836216352689701 0.76972539034249121 0.62320039727703602
-1.1327229259756779 -0.047722974677923413 0.70871769768752169  -0.06750132061579113 0.70276863564903957 0.70820887911908559
-1.4840795446225896 -0.28960691129913418 0.84103330267207554  0.28440717777405761 0.46019616855581402 0.8410303464662523
-1.5714973697248311 -0.22222747306573276 0.76383628095354983  0.3717697632889605 0.52785497534633785 0.76364675610270705
-0.84637064705828324 -0.28443495637683419 0.81129246939324073  -0.35387698305874404 0.46550486715932443 0.81121902067950857
-0.96541504139377876 -0.23428397075672924 0.82401873423925942  -0.23530638500725842 0.51562318151862263 0.82387113061171735
-1.3358362255269414 -0.030084692934636004 0.68063975088704354  0.1360953033796356 0.72008099426245742 0.68041269101920465
-1.2697401976333089 0.050472340674918903 0.59529852733606159  0.069662907281836633 0.80067536950372653 0.59503447968929768
-1.1197187226497591 -0.55260647397715412 0.97703158208487906  -0.080345839839677594 0.19714040391717308 0.97707738033578018
-1.1222955963561905 -0.42728941095227674 0.94330265629374299  -0.077926023088562418 0.32203490693742814 0.94351526412634301
-0.99987185965655678 -0.069819281493047503 0.70519707714513469  -0.20029565457621112 0.68040299513329272 0.70493504308661759
-0.87160444279468885 -0.10938546291290407 0.69409608332024109  -0.32871571883365258 0.64057192708348276 0.69398384882086994
-1.5040127948790105 -0.41433279178978183 0.891573746743482  0.304220523183167 0.33550256744406926 0.89156486051918726
-1.3865609960788059 -0.36001233692795459 0.90172313788306913  0.18714545413041689 0.38953622755321876 0.90179715370028035
-0.94047778163550211 -0.35389882611563689 0.88076789123048715  -0.2598848257066439 0.39599581735923683 0.88070834559541744
-0.92730018625934885 -0.48088283263773507 0.92369408454137281  -0.27282039415738735 0.26880216379452304 0.92375019852295037
-0.89598720512098939 -0.41433279178978183 -0.891573746743482  -0.30422052318316667 0.33550256744406998 -0.89156486051918704
-1.013439003921194 -0.36001233692795459 -0.90172313788306913  -0.18714545413041792 0.38953622755321859 -0.90179715370028013
-1.4595222183644985 -0.35389882611563694 -0.88076789123048704  0.25988482570664373 0.39599581735923589 -0.88070834559541789
-1.4726998137406517 -0.48088283263773512 -0.9236940845413727  0.27282039415738851 0.26880216379452265 -0.92375019852295015
-0.93182848239968008 -0.06070343884806495 -0.6730187872058685  -0.26836446324214991 0.68937955050281319 -0.67285685715261323
-1.0069945598044523 -0.12542737832173334 -0.75674166021493716  -0.19358827458119385 0.62484261256047813 -0.75636980999592551
-1.1602654114415885 -0.48973505164257786 -0.96471929550963276  -0.039677999129163442 0.25990051397960057 -0.96481986879326109
-1.0401421964121771 -0.55062303027104398 -0.96679589706089264  -0.16010344242024327 0.19913925651268644 -0.96680424297825784
-1.3382736821873726 0.019577838502176204 -0.62340222914316235  0.13836216352689562 0.76972539034249188 -0.62320039727703569
-1.2672770740243227 -0.047722974677923524 -0.70871769768752158  0.067501320615790852 0.70276863564904002 -0.70820887911908526
-0.91592045537741074 -0.28960691129913418 -0.84103330267207554  -0.28440717777405577 0.46019616855581347 -0.84103034646625319
-0.82850263027516891 -0.22222747306573276 -0.76383628095354983  -0.37176976328895939 0.5278549753463373 -0.76364675610270794
-1.5536293529417171 -0.28443495637683425 -0.81129246939324062  0.35387698305874526 0.46550486715932382 -0.81121902067950846
-1.4345849586062216 -0.23428397075672924 -0.82401873423925942  0.23530638500725773 0.5156231815186233 -0.82387113061171713
-1.064163774473059 -0.030084692934636004 -0.68063975088704354  -0.13609530337963568 0.72008099426245653 -0.68041269101920543
-1.1302598023666912 0.050472340674918903 -0.59529852733606159  -0.069662907281836814 0.80067536950372631 -0.5950344796892979
-1.2802812773502414 -0.55260647397715412 -0.97703158208487906  0.080345839839677705 0.19714040391717316 -0.97707738033578018
-1.2777044036438097 -0.42728941095227674 -0.94330265629374299  0.077926023088562502 0.32203490693742798 -0.94351526412634301
-1.4001281403434436 -0.069819281493047614 -0.70519707714513458  0.20029565457621376 0.68040299513329239 -0.70493504308661725
-1.528395557205311 -0.10938546291290407 -0.69409608332024109  0.32871571883365169 0.64057192708348387 -0.6939838488208695
-1.3973935260228463 -1.7270315820848792 0.080281277350241251  0.1971404039171723 -0.97707738033578007 0.080345839839680203
-1.5227105890477235 -1.6933026562937428 0.077704403643809691  0.32203490693742948 -0.94351526412634235 0.077926023088564875
-1.8801807185069523 -1.4551970771451344 0.20012814034344359  0.68040299513329217 -0.70493504308661736 0.20029565457621401
-1.8406145370870961 -1.4440960833202408 0.328395557205311  0.64057192708348354 -0.69398384882087016 0.32871571883365103
-1.5356672082102185 -1.6415737467434819 -0.30401279487901062  0.33550256744406975 -0.89156486051918682 -0.30422052318316761
-1.589987663072046 -1.651723137883069 -0.18656099607880564  0.38953622755322032 -0.90179715370027957 -0.1871454541304175
-1.596101173884364 -1.6307678912304868 0.25952221836449818  0.39599581735923722 -0.88070834559541733 0.25988482570664367
-1.4691171673622654 -1.6736940845413724 0.27269981374065155  0.26880216379452515 -0.92375019852294959 0.27282039415738774
-1.889296561151935 -1.4230187872058684 -0.26817151760031971  0.68937955050281319 -0.67285685715261345 -0.26836446324214919
-1.8245726216782669 -1.5067416602149368 -0.19300544019554738  0.62484261256047735 -0.75636980999592573 -0.19358827458119546
-1.4602649483574226 -1.7147192955096329 -0.039734588558411603  0.25990051397960079 -0.96481986879326087 -0.039677999129166364
-1.3993769697289566 -1.7167958970608925 -0.15985780358782292  0.19913925651268624 -0.96680424297825795 -0.16010344242024338
-1.9695778385021763 -1.373402229143162 0.13827368218737229  0.76972539034249277 -0.62320039727703458 0.13836216352689565
-1.9022770253220767 -1.4587176976875214 0.067277074024322203  0.70276863564903957 -0.7082088791190857 0.067501320615791019
-1.6603930887008658 -1.5910333026720753 -0.28407954462258939  0.46019616855581419 -0.84103034646625208 -0.28440717777405794
-1.7277725269342672 -1.5138362809535497 -0.37149736972483099  0.52785497534633952 -0.7636467561027066 -0.37176976328895883
-1.6655650436231662 -1.5612924693932406 0.35362935294171671  0.4655048671593251 -0.81121902067950891 0.35387698305874227
-1.7157160292432714 -1.5740187342392593 0.23458495860622122  0.5156231815186243 -0.82387113061171613 0.23530638500725917
-1.9199153070653643 -1.4306397508870434 -0.135836225526941  0.72008099426245742 -0.68041269101920487 -0.13609530337963505
-2.0004723406749192 -1.3452985273360611 -0.06974019763330884  0.80067536950372775 -0.59503447968929568 -0.069662907281837744
-1.8730187872058686 -0.4818284823996804 0.68929656115193483  0.67285685715261256 0.26836446324214963 0.68937955050281385
-1.9567416602149375 -0.55699455980445256 0.62457262167826677  0.75636980999592585 0.19358827458119479 0.62484261256047735
-2.1647192955096326 -0.71026541144158839 0.26026494835742214  0.96481986879326176 0.039677999129162984 0.25990051397959829
-2.1667958970608927 -0.59014219641217724 0.19937696972895616  0.96680424297825762 0.1601034424202436 0.19913925651268774
-1.1197187226497587 -0.94739352602284621 -0.97703158208487906  -0.08034583983967819 -0.19714040391717366 -0.97707738033577995
-1.1222955963561905 -1.0727105890477233 -0.94330265629374277  -0.077926023088563487 -0.32203490693742803 -0.94351526412634301
-0.99987185965655645 -1.4301807185069524 -0.70519707714513469  -0.20029565457621298 -0.68040299513329205 -0.7049350430866177
-0.87160444279468885 -1.3906145370870959 -0.69409608332024109  -0.32871571883365236 -0.64057192708348221 -0.69398384882087072
-0.32993533901945349 -0.80654749644509327 -0.4886330537542477  -0.86908209382503177 -0.066959188365443623 -0.49011506943384187
-0.35314170479917451 -0.76928684914828649 -0.53075413092765567  -0.84560936423414856 -0.027439993872778051 -0.53309647331020771
-0.31923210876951291 -1.0095222183644981 -0.39610117388436322  -0.88070834559541689 -0.25988482570664445 -0.39599581735923767
-0.27630591545862715 -1.0226998137406511 -0.26911716736226515  -0.92375019852295048 -0.27282039415738712 -0.26880216379452287
-0.57659777085683772 -0.61172631781262765 0.76957783850217654  -0.62320039727703602 0.13836216352689595 0.76972539034249143
-0.49128230231247827 -0.68272292597567774 0.70227702532207659  -0.70820887911908448 0.067501320615791255 0.7027686356490408
-0.35896669732792441 -1.0340795446225892 0.46039308870086582  -0.84103034646625319 -0.28440717777405589 0.46019616855581341
-0.43616371904645013 -1.1214973697248309 0.52777252693426724  -0.76364675610270683 -0.37176976328896016 0.5278549753463383
-0.92600274487022949 0.1474180208074326 0.34558774394436131  -0.30431345936383969 0.89521176696950666 0.32555984200964683
-0.31474205002823552 -0.83109069623026077 -0.45671715648324684  -0.88043888279482363 -0.087790975218752162 -0.46596149876695098
-0.39411849558532475 -0.7042679462719752 -0.58956860097969033  -0.81036094014927673 0.030667519535217881 -0.58512789193981962
-0.96705050472527376 0.21194916611186071 0.13775142693846479  -0.23081318598026582 0.96295953203000473 0.13940664564572822
-0.89598720512098984 -1.0856672082102186 0.89157374674348211  -0.30422052318316595 -0.33550256744406909 0.89156486051918771
-1.0134390039211947 -1.1399876630720456 0.90172313788306913  -0.18714545413041703 -0.38953622755321959 0.90179715370027991
-1.4595222183644985 -1.1461011738843632 0.88076789123048704  0.2598848257066444 -0.39599581735923534 0.880708345595418
-1.4726998137406517 -1.019117167362265 0.9236940845413727  0.27282039415738762 -0.26880216379452199 0.92375019852295059
-2.0112924693932408 -1.1036293529417165 0.46556504362316542  0.81121902067950991 -0.35387698305874271 0.46550486715932338
-2.0240187342392595 -0.98458495860622119 0.51571602924327065  0.82387113061171902 -0.23530638500725812 0.51562318151862008
-1.8806397508870436 -0.61416377447305914 0.719915307065364  0.68041269101920487 0.1360953033796358 0.7200809942624572
-1.7952985273360618 -0.68025980236669126 0.80047234067491868  0.59503447968929746 0.069662907281836065 0.80067536950372675
-1.8234022291431624 -0.88827368218737224 0.7695778385021762  0.62320039727703591 -0.13836216352689581 0.76972539034249166
-1.9087176976875218 -0.81727707402432193 0.70227702532207636  0.70820887911908625 -0.067501320615792268 0.70276863564903891
-2.0410333026720755 -0.46592045537741078 0.46039308870086587  0.84103034646625263 0.28440717777405655 0.46019616855581408
-1.9638362809535499 -0.37850263027516917 0.52777252693426735  0.7636467561027066 0.37176976328895961 0.52785497534633896
-1.9695778385021763 -0.12659777085683777 -0.13827368218737232  0.76972539034249143 0.62320039727703636 -0.13836216352689507
-1.9022770253220767 -0.041282302312478425 -0.067277074024322217  0.70276863564904013 0.70820887911908514 -0.067501320615791421
-1.6603930887008658 0.091033302672075656 0.28407954462258933  0.46019616855581363 0.84103034646625308 0.28440717777405577
-1.7277725269342672 0.013836280953549829 0.37149736972483099  0.52785497534634007 0.76364675610270594 0.3717697632889595
-1.889296561151935 -0.076981212794131615 0.26817151760031976  0.68937955050281285 0.67285685715261301 0.2683644632421508
-1.8245726216782669 0.0067416602149371618 0.19300544019554744  0.62484261256047702 0.75636980999592629 0.19358827458119429
-1.4602649483574224 0.21471929550963276 0.039734588558411575  0.25990051397960157 0.96481986879326087 0.039677999129164421
-1.3993769697289566 0.21679589706089242 0.15985780358782287  0.19913925651268663 0.96680424297825795 0.16010344242024277
-0.97371394847093473 0.22313250261608547 -0.018534606855888307  -0.22857704379632673 0.97332233192471596 -0.019904100732393945
-0.3395133710973568 -0.79211156275892003 -0.50664961250726259  -0.85780946571559158 -0.048345734654243529 -0.51168897825678517
-0.80104197563456969 -0.053122466844444174 -0.59574101077153174  -0.37119418317776481 0.71962089011270858 -0.58682250543787506
-0.45944041532897173 -0.59972505245462004 -0.653998898413091  -0.74496666446894655 0.16330181399314797 -0.64680536978024494
-1.0026064739771539 0.22703158208487906 0.080281277350241251  -0.19714040391717333 0.97707738033578007 0.080345839839677469
-0.44633019100468208 -0.62042776846682712 -0.64334361719230815  -0.75782534074317476 0.12946239417784464 -0.63948435588467012
-0.40435813432554835 -0.6879005781223142 -0.60211592452938856  -0.77995892884277973 0.063643445898669229 -0.62258620376022367
-0.92780338960280884 0.14987434907153019 0.34005641981910062  -0.27087574504908507 0.91136373772563206 0.30990719304796444
-0.40065939257699101 -0.69413734830776352 -0.59790562905682221  -0.79006130932897867 0.031934562996077741 -0.61219548445543892
-0.24930895838975131 -0.93567470552212884 0.24579255546759937  -0.95608513245170457 -0.17856129650966157 0.23241575440058948
-0.49480292285486538 -0.54987185965655638 0.6801807185069525  -0.70493504308661625 0.20029565457621099 0.68040299513329427
-0.79848519772427495 -0.05725079091428624 -0.59888293763788791  -0.39881277493421985 0.66927944610494272 -0.62690780308648919
-0.94691066341902053 0.17998804508785299 -0.26439588316448503  -0.2356500906047751 0.9375711537404644 -0.25579164660272941
-0.92780338960280884 0.1498743490715298 -0.34005641981910184  -0.27087574504909129 0.9113637377256294 -0.30990719304796688
-0.51936024911295675 -0.88583622552694086 0.71991530706536422  -0.68041269101920554 -0.13609530337963666 0.72008099426245631
-0.60470147266393859 -0.81974019763330874 0.80047234067491901  -0.59503447968929779 -0.069662907281837785 0.8006753695037262
-0.9318284823996803 -1.4392965611519353 0.6730187872058685  -0.26836446324214974 -0.68937955050281385 0.67285685715261245
-1.0069945598044532 -1.374572621678267 0.75674166021493738  -0.19358827458119265 -0.62484261256047824 0.75636980999592585
-1.1602654114415887 -1.0102649483574222 0.96471929550963276  -0.039677999129165489 -0.25990051397960151 0.96481986879326076
-1.0401421964121773 -0.94937696972895624 0.96679589706089264  -0.16010344242024363 -0.19913925651268594 0.96680424297825795
-2.0112924693932408 -0.39637064705828318 -0.46556504362316581  0.81121902067950968 0.35387698305874449 -0.46550486715932216
-2.0240187342392595 -0.51541504139377881 -0.51571602924327065  0.82387113061171646 0.23530638500725806 -0.51562318151862441
-1.8806397508870436 -0.88583622552694086 -0.719915307065364  0.68041269101920476 -0.13609530337963674 -0.72008099426245697
-1.7952985273360618 -0.81974019763330874 -0.80047234067491879  0.5950344796892979 -0.06966290728183612 -0.80067536950372642
-1.4681715176003196 -1.4392965611519353 -0.6730187872058685  0.26836446324215019 -0.68937955050281319 -0.67285685715261301
-1.3930054401955474 -1.3745726216782668 -0.75674166021493716  0.19358827458119407 -0.62484261256047757 -0.75636980999592596
-1.2397345885584119 -1.0102649483574222 -0.96471929550963276  0.039677999129167092 -0.25990051397960079 -0.96481986879326087
-1.3598578035878233 -0.94937696972895602 -0.96679589706089242  0.16010344242024369 -0.19913925651268524 -0.96680424297825807
-1.5040127948790105 -1.0856672082102183 -0.89157374674348189  0.304220523183167 -0.33550256744407064 -0.89156486051918671
-1.3865609960788055 -1.1399876630720456 -0.90172313788306913  0.18714545413041778 -0.38953622755322032 -0.90179715370027946
-0.94047778163550177 -1.1461011738843632 -0.88076789123048715  -0.25988482570664295 -0.39599581735923617 -0.880708345595418
-0.92730018625934818 -1.019117167362265 -0.9236940845413727  -0.27282039415738779 -0.26880216379452299 -0.92375019852295026
-0.38870753060675922 -1.1036293529417167 -0.46556504362316575  -0.81121902067950891 -0.35387698305874371 -0.46550486715932404
-0.37598126576074054 -0.98458495860622119 -0.51571602924327076  -0.82387113061171768 -0.2353063850072579 -0.51562318151862241
-0.51936024911295653 -0.61416377447305914 -0.71991530706536422  -0.68041269101920532 0.13609530337963607 -0.72008099426245675
-0.60470147266393859 -0.68025980236669126 -0.80047234067491901  -0.59503447968929757 0.069662907281836731 -0.80067536950372664
-0.57659777085683772 -0.88827368218737235 -0.76957783850217643  -0.62320039727703624 -0.13836216352689573 -0.76972539034249132
-0.49128230231247827 -0.81727707402432204 -0.70227702532207659  -0.70820887911908403 -0.067501320615791185 -0.70276863564904113
-0.79963678018449613 -0.055347528090576067 -0.59753024518837072  -0.36887582764817262 0.69486688193511303 -0.61732539245251317
-0.24152064540259122 -0.94857068261000999 0.20072208160320942  -0.95922670283599798 -0.19909668302557912 0.20061067612316194
-0.74532674141002375 -0.14250706129079604 -0.65018159643527595  -0.45629539576529471 0.61497179190323881 -0.64312067838525655
-0.31474205002823563 -0.83109069623026088 0.45671715648324701  -0.88043888279482407 -0.087790975218753439 0.46596149876694987
-0.23052646968895496 -0.96592607882051262 0.10986054425367281  -0.96991439832021697 -0.2213218831876774 0.10140356972706432
-0.36517401588679055 -0.75000000000000011 -0.54975734503310147  -0.8351282192258368 -1.7351045681323705e-15 -0.55005532217467235
-0.73203596503112101 -0.16333083529035375 -0.66003296952840662  -0.48378799724665406 0.58634540105761634 -0.64972936241073054
-0.32993533901945349 -0.80654749644509338 0.4886330537542477  -0.86908209382503254 -0.066959188365443442 0.49011506943384064
-0.42861413394522363 -0.64891100701386606 -0.6271743261149485  -0.76918721291849768 0.096596587118419897 -0.63168040245027957
-1.0006230302710439 0.21679589706089264 -0.15985780358782289  -0.19913925651268563 0.9668042429782584 -0.16010344242024124
-1.5356672082102183 0.141573746743482 0.30401279487901056  0.33550256744406864 0.89156486051918726 0.30422052318316783
-1.589987663072046 0.1517231378830689 0.18656099607880564  0.38953622755321937 0.90179715370028013 0.1871454541304165
-1.5961011738843633 0.13076789123048704 -0.25952221836449818  0.39599581735923672 0.88070834559541755 -0.25988482570664362
-1.4691171673622654 0.17369408454137247 -0.27269981374065155  0.26880216379452343 0.92375019852294993 -0.27282039415738862
-1.3973935260228463 0.22703158208487906 -0.080281277350241251  0.19714040391717291 0.97707738033578007 -0.08034583983967919
-1.5227105890477235 0.19330265629374277 -0.077704403643809677  0.32203490693742931 0.94351526412634257 -0.077926023088563098
-1.8801807185069523 -0.044802922854865423 -0.20012814034344364  0.68040299513329272 0.70493504308661703 -0.20029565457621326
-1.8406145370870961 -0.055903916679759136 -0.32839555720531111  0.64057192708348254 0.69398384882087027 -0.32871571883365264
-2.1770315820848789 -0.66971872264975862 -0.19739352602284604  0.97707738033577951 0.080345839839677469 -0.19714040391717583
-2.1433026562937432 -0.67229559635619018 -0.32271058904772343  0.94351526412634357 0.077926023088562099 -0.32203490693742648
-1.9051970771451348 -0.54987185965655638 -0.68018071850695228  0.70493504308661614 0.20029565457621251 -0.68040299513329383
-1.8940960833202412 -0.42160444279468895 -0.64061453708709593  0.69398384882086994 0.32871571883365269 -0.64057192708348276
-2.1770315820848789 -0.83028127735024138 0.19739352602284604  0.97707738033577962 -0.080345839839677594 0.19714040391717577
-2.1433026562937432 -0.82770440364380959 0.32271058904772337  0.94351526412634346 -0.077926023088562182 0.32203490693742681
-1.9051970771451348 -0.95012814034344362 0.68018071850695228  0.70493504308661736 -0.20029565457621232 0.68040299513329261
-1.8940960833202412 -1.0783955572053108 0.64061453708709593  0.69398384882086983 -0.32871571883365164 0.64057192708348354
-1.2802812773502414 -0.9473935260228461 0.97703158208487884  0.080345839839677982 -0.19714040391717333 0.97707738033578007
-1.2777044036438101 -1.0727105890477233 0.94330265629374277  0.077926023088561974 -0.32203490693742742 0.94351526412634323
-1.4001281403434442 -1.4301807185069524 0.70519707714513435  0.20029565457621343 -0.68040299513329316 0.7049350430866167
-1.5283955572053118 -1.3906145370870957 0.69409608332024086  0.32871571883365197 -0.64057192708348387 0.69398384882086939
-1.5536293529417171 -1.215565043623166 0.81129246939324051  0.35387698305874427 -0.46550486715932354 0.81121902067950902
-1.4345849586062214 -1.265716029243271 0.82401873423925931  0.2353063850072577 -0.51562318151862219 0.82387113061171791
-1.0641637744730592 -1.4699153070653641 0.68063975088704354  -0.13609530337963502 -0.72008099426245675 0.68041269101920543
-1.1302598023666912 -1.550472340674919 0.59529852733606137  -0.069662907281835967 -0.80067536950372697 0.59503447968929724
-0.51070343884806491 -1.4230187872058684 0.26817151760031971  -0.68937955050281274 -0.67285685715261301 0.26836446324215124
-0.57542737832173307 -1.5067416602149373 0.19300544019554747  -0.62484261256047668 -0.75636980999592651 0.19358827458119479
-0.93973505164257753 -1.7147192955096329 0.039734588558411603  -0.25990051397960157 -0.96481986879326087 0.039677999129163352
-1.0006230302710439 -1.7167958970608925 0.15985780358782295  -0.19913925651268577 -0.96680424297825773 0.16010344242024463
-0.86433279178978151 -1.6415737467434819 0.30401279487901062  -0.33550256744406703 -0.89156486051918793 0.30422052318316739
-0.81001233692795438 -1.651723137883069 0.18656099607880566  -0.38953622755321937 -0.90179715370027991 0.18714545413041725
-0.80389882611563679 -1.6307678912304873 -0.25952221836449835  -0.39599581735923667 -0.88070834559541755 -0.25988482570664351
-0.93088283263773519 -1.6736940845413728 -0.27269981374065166  -0.26880216379452282 -0.92375019852295026 -0.27282039415738824
-0.84637064705828324 -1.2155650436231658 -0.81129246939324073  -0.35387698305874399 -0.46550486715932426 -0.81121902067950868
-0.96541504139377876 -1.2657160292432705 -0.82401873423925953  -0.23530638500725817 -0.51562318151862341 -0.82387113061171702
-1.3358362255269407 -1.4699153070653641 -0.68063975088704354  0.13609530337963741 -0.72008099426245542 -0.68041269101920643
-1.2697401976333087 -1.550472340674919 -0.59529852733606137  0.069662907281835718 -0.80067536950372697 -0.59503447968929712
-1.0617263178126279 -1.5195778385021765 -0.62340222914316235  -0.13836216352689701 -0.76972539034249154 -0.6232003972770358
-1.1327229259756779 -1.4522770253220765 -0.70871769768752169  -0.067501320615791463 -0.70276863564903835 -0.7082088791190867
-1.4840795446225892 -1.2103930887008656 -0.84103330267207554  0.28440717777405761 -0.4601961685558158 -0.8410303464662513
-1.5714973697248311 -1.2777725269342675 -0.76383628095354983  0.37176976328896116 -0.52785497534633907 -0.76364675610270594
-1.8234022291431624 -0.61172631781262776 -0.7695778385021762  0.62320039727703591 0.13836216352689573 -0.76972539034249166
-1.9087176976875218 -0.68272292597567774 -0.70227702532207636  0.70820887911908492 0.067501320615791352 -0.70276863564904024
-2.0410333026720755 -1.034079544622589 -0.46039308870086576  0.84103034646625319 -0.28440717777405544 -0.46019616855581363
-1.9638362809535499 -1.1214973697248309 -0.52777252693426713  0.7636467561027076 -0.37176976328895911 -0.52785497534633785
-1.8730187872058686 -1.0181715176003197 -0.68929656115193483  0.67285685715261245 -0.26836446324214946 -0.68937955050281396
-1.9567416602149375 -0.94300544019554744 -0.62457262167826677  0.75636980999592596 -0.19358827458119457 -0.62484261256047746
-2.1647192955096326 -0.78973458855841161 -0.26026494835742214  0.96481986879326176 -0.039677999129162984 -0.25990051397959812
-2.1667958970608927 -0.90985780358782276 -0.19937696972895616  0.96680424297825762 -0.16010344242024363 -0.19913925651268752
-2.0915737467434821 -0.44598720512098944 0.33566720821021828  0.89156486051918704 0.30422052318316872 0.33550256744406842
-2.1017231378830692 -0.56343900392119428 0.38998766307204552  0.90179715370028035 0.18714545413041561 0.38953622755321932
-2.0807678912304874 -1.0095222183644981 0.39610117388436294  0.88070834559541811 -0.25988482570664401 0.39599581735923511
-2.1236940845413725 -1.0226998137406511 0.26911716736226499  0.92375019852295071 -0.2728203941573869 0.26880216379452243
-2.0915737467434821 -1.0540127948790103 -0.33566720821021817  0.8915648605191866 -0.304220523183169 -0.33550256744406914
-2.1017231378830692 -0.9365609960788055 -0.38998766307204552  0.90179715370028035 -0.18714545413041556 -0.38953622755321937
-2.080767891230487 -0.49047778163550182 -0.39610117388436328  0.88070834559541755 0.25988482570664495 -0.395995817359236
-2.1236940845413725 -0.47730018625934845 -0.26911716736226499  0.92375019852294959 0.27282039415738735 -0.26880216379452587
-1.6655650436231659 0.061292469393240734 -0.35362935294171677  0.46550486715932515 0.81121902067950802 -0.35387698305874443
-1.7157160292432707 0.074018734239259421 -0.23458495860622128  0.51562318151862496 0.82387113061171613 -0.23530638500725815
-1.9199153070653638 -0.069360249112956462 0.135836225526941  0.72008099426245686 0.68041269101920532 0.13609530337963571
-2.0004723406749187 -0.15470147266393841 0.069740197633308867  0.80067536950372709 0.5950344796892969 0.069662907281836342
-1.0026064739771539 -1.7270315820848792 -0.080281277350241251  -0.19714040391717255 -0.97707738033578029 -0.080345839839677857
-0.87728941095227653 -1.6933026562937428 -0.077704403643809691  -0.3220349069374297 -0.94351526412634246 -0.077926023088562835
-0.51981928149304746 -1.4551970771451346 -0.20012814034344362  -0.68040299513329383 -0.70493504308661636 -0.20029565457621185
-0.55938546291290392 -1.444096083320241 -0.32839555720531116  -0.6405719270834821 -0.69398384882087105 -0.32871571883365192
-0.96705050472527376 0.21194916611186074 -0.13775142693846454  -0.23081318598026312 0.96295953203000684 -0.13940664564571795
-0.28617291708332143 -0.87638371280443872 0.38483791504434911  -0.91004478602604832 -0.14997570917340214 0.38642693240086007
-0.49480292285486538 -0.95012814034344351 -0.6801807185069525  -0.70493504308661703 -0.20029565457621293 -0.68040299513329283
-0.50590391667975909 -1.0783955572053112 -0.64061453708709593  -0.69398384882087027 -0.32871571883365175 -0.64057192708348287
-0.7344349563768342 -1.5612924693932406 -0.35362935294171682  -0.46550486715932488 -0.81121902067950857 -0.35387698305874338
-0.68428397075672931 -1.5740187342392593 -0.23458495860622131  -0.51562318151862274 -0.82387113061171702 -0.23530638500725945
-0.48008469293463596 -1.4306397508870434 0.135836225526941  -0.7200809942624582 -0.68041269101920365 0.13609530337963588
-0.39952765932508105 -1.3452985273360616 0.069740197633308854  -0.80067536950372631 -0.5950344796892979 0.069662907281837605
-0.52698121279413157 -1.0181715176003197 0.68929656115193516  -0.67285685715261234 -0.26836446324214924 0.68937955050281408
-0.44325833978506279 -0.94300544019554755 0.62457262167826699  -0.75636980999592529 -0.19358827458119435 0.62484261256047824
-0.69212177096286931 -0.22700206765185557 -0.68413337702600874  -0.52838581205523161 0.49772992706575336 -0.68780328097636556
-0.52912853141459681 -0.48757002987147363 -0.69320320770179844  -0.66138007935865217 0.23687493927937045 -0.71166470600201726
-0.43042216149782375 -1.3734022291431622 -0.13827368218737232  -0.76972539034249121 -0.62320039727703613 -0.13836216352689668
-0.49772297467792337 -1.4587176976875216 -0.067277074024322231  -0.70276863564904068 -0.70820887911908448 -0.067501320615791449
-0.73960691129913392 -1.5910333026720753 0.28407954462258939  -0.46019616855581452 -0.84103034646625252 0.28440717777405594
-0.67222747306573261 -1.5138362809535497 0.37149736972483099  -0.52785497534633841 -0.76364675610270694 0.37176976328895978
-1.3382736821873729 -1.5195778385021763 0.62340222914316223  0.13836216352689787 -0.76972539034249043 0.62320039727703691
-1.2672770740243227 -1.4522770253220765 0.70871769768752169  0.067501320615792629 -0.70276863564903946 0.7082088791190857
-0.91592045537741118 -1.2103930887008665 0.84103330267207554  -0.28440717777405589 -0.46019616855581424 0.84103034646625274
-0.82850263027516924 -1.2777725269342675 0.76383628095354994  -0.37176976328895894 -0.52785497534633752 0.76364675610270805
-0.97256579272521648 0.22114863140943247 0.060907607905721736  -0.22895713509379126 0.97158621857248983 0.059990417315213367
-0.50622685812276524 -0.52571510245600384 -0.6834170246153628  -0.68956138101059405 0.23429135260016218 -0.68528290794061752
-0.24930895838975137 -0.93567470552212906 -0.24579255546759976  -0.9560851324517049 -0.17856129650966043 -0.23241575440058906
-0.56731181848165257 -0.42664579118104862 -0.70294074606773127  -0.62602060935195813 0.30459772848492944 -0.7178568244910849
-0.30842625325651785 -1.0540127948790103 0.33566720821021839  -0.8915648605191876 -0.30422052318316622 0.33550256744406898
-0.29827686211693072 -0.9365609960788055 0.38998766307204563  -0.9017971537002798 -0.18714545413041739 0.38953622755321959
-0.6569399976068282 -0.28335434223766326 -0.69755165300174249  -0.52046695699576906 0.46800238770905944 -0.71420439075532394
-0.6078561560079746 -0.36184045701812123 -0.70538094374692584  -0.58682250543787795 0.37119418317777469 -0.71962089011270114
-1.8267476188075715 -0.23443672020460982 0.58427898032160919  0.62675731827798087 0.515828226034316 0.58403467808965281
-1.7521688397941486 -0.28373393338202185 0.69116244652106429  0.55222595833073151 0.46647300291392801 0.69097715483087252
-1.5536293529417171 -0.28443495637683436 0.81129246939324062  0.35387698305874488 0.46550486715932449 0.81121902067950824
-1.6686770498343511 -0.34367059745735729 0.7843712383737107  0.46877433341209052 0.40646863937642869 0.78424095119900816
-1.2687157005262188 0.19538324907249438 0.31863563026492314  0.068666567984591059 0.94527232704070629 0.31897512469198191
-1.3389936067269161 0.14342795031552757 0.42716188369754915  0.13875119650014398 0.89352037004910534 0.42704736713517877
-1.3382736821873722 0.019577838502176204 0.62340222914316235  0.1383621635268969 0.76972539034249132 0.62320039727703602
-1.4082874004879666 0.074716442017224605 0.52579382752597525  0.208139674214635 0.8248245035506504 0.52568280774650489
-0.76687916779802345 -0.10789205109760858 -0.63136143448574888  -0.42807141203226684 0.64268086340021302 -0.63538663349165436
-0.26660413751883805 -0.90759811547986113 0.3218712605625344  -0.93893517079361655 -0.17584665747242287 0.29576798018470224
-0.9318284823996803 -0.060703438848064839 0.67301878720586861  -0.26836446324215113 0.68937955050281319 0.67285685715261256
-0.86005164309557447 -0.0066545040394655475 0.57608383788574402  -0.3401369403401171 0.74324570666303769 0.57610127698437308
-0.77018003072289609 -0.74999999999999989 0.90291461058653244  -0.42961984965260008 0.00028436728304531982 0.90300980278163412
-0.77283811630245081 -0.61100639327308404 0.89342795031552769  -0.42704736713517794 0.13875119650014234 0.89352037004910601
-0.89598720512098962 -0.41433279178978172 0.89157374674348211  -0.30422052318316684 0.33550256744407064 0.89156486051918682
-0.78161296052541807 -0.47533155387381615 0.86574218443040096  -0.41835586417422282 0.27447137325094939 0.86581974808661955
-1.5186356302649235 -0.81871570052621878 0.94538324907249438  0.31897512469198225 -0.068666567984592156 0.94527232704070618
-1.4022655037944636 -0.75 0.97933072349169759  0.20254321521823429 7.9881559506738853e-17 0.97927332546590895
-1.2802812773502414 -0.55260647397715412 0.97703158208487906  0.080345839839678967 0.19714040391717236 0.97707738033578018
-1.2813709460566907 -0.68361895436178255 0.9944708773603258  0.081578796887613381 0.066331699036313557 0.99445714115859496
-0.88136436973507692 -0.81871570052621878 -0.9453832490724946  -0.3189751246919828 -0.068666567984590657 -0.94527232704070607
-0.99773449620553689 -0.75 -0.9793307234916977  -0.20254321521823221 -2.5006401236892162e-16 -0.97927332546590939
-1.1197187226497587 -0.55260647397715412 -0.97703158208487906  -0.080345839839677594 0.19714040391717333 -0.97707738033578007
-1.1186290539433099 -0.68361895436178255 -0.9944708773603258  -0.081578796887611618 0.066331699036312461 -0.99445714115859518
-0.65068017874670403 -0.29325931385704512 -0.69911600851089584  -0.54352627180167212 0.43623030388675949 -0.7171347947438057
-0.57556494808430081 -0.41363385795819674 -0.70422028778974766  -0.60701252203428868 0.33806887798060098 -0.71919763058182395
-0.84637064705828324 -0.28443495637683419 -0.81129246939324084  -0.35387698305874371 0.4655048671593251 -0.81121902067950835
-0.7313229501656493 -0.34367059745735723 -0.78437123837371081  -0.46877433341209035 0.40646863937642796 -0.78424095119900872
-1.1312842994737817 0.1953832490724946 -0.3186356302649232  -0.068382200701545062 0.94544807568691691 -0.3185150087627262
-1.0610063932730844 0.14342795031552769 -0.42716188369754926  -0.138751196500143 0.89352037004910556 -0.42704736713517871
-1.0617263178126279 0.019577838502176315 -0.62340222914316246  -0.13836216352689656 0.76972539034249143 -0.62320039727703591
-0.99171259951203328 0.074716442017224605 -0.52579382752597525  -0.20813967421463547 0.82482450355065007 -0.52568280774650544
-1.7842789803216093 -0.12325238119242887 -0.51556327979539018  0.58449479401890791 0.62647295099493516 -0.51565247738810671
-1.6662660666179787 -0.058837553478935933 -0.55216883979414821  0.46647300291392729 0.69097715483087374 -0.55222595833073074
-1.4681715176003201 -0.060703438848065061 -0.67301878720586839  0.26836446324215174 0.68937955050281285 -0.67285685715261279
-1.5399483569044259 -0.0066545040394656585 -0.57608383788574391  0.34013694034011571 0.74324570666303802 -0.57610127698437363
-1.6298199692771045 -0.74999999999999956 -0.90291461058653211  0.42961984965260014 -0.00028436728304601447 -0.90300980278163412
-1.6271618836975494 -0.61100639327308404 -0.89342795031552757  0.42704736713517782 0.1387511965001425 -0.89352037004910601
-1.5040127948790107 -0.41433279178978177 -0.891573746743482  0.30422052318316689 0.33550256744406892 -0.89156486051918737
-1.6183870394745821 -0.4753315538738162 -0.86574218443040063  0.41835586417422188 0.27447137325094723 -0.86581974808662054
-1.2000000000000002 -1.6529146105865324 0.42981996927710425  -0.00028436728304630791 -0.90300980278163401 0.42961984965260031
-1.3389936067269161 -1.6434279503155274 0.42716188369754937  0.13875119650014339 -0.89352037004910545 0.42704736713517877
-1.5356672082102192 -1.6415737467434817 0.30401279487901056  0.33550256744406892 -0.8915648605191876 0.30422052318316639
-1.4746684461261848 -1.6157421844304007 0.41838703947458178  0.27447137325094845 -0.86581974808661988 0.41835586417422255
-1.1312842994737811 -1.6953832490724943 -0.31863563026492331  -0.068382200701545548 -0.94544807568691747 -0.31851500876272432
-1.2 -1.7293307234916977 -0.20226550379446348  6.7031047760002604e-16 -0.97927332546590873 -0.20254321521823504
-1.3973935260228465 -1.7270315820848787 -0.080281277350241292  0.19714040391717233 -0.97707738033578018 -0.080345839839679897
-1.2663810456382176 -1.7444708773603259 -0.081370946056690305  0.06633169903631303 -0.99445714115859496 -0.081578796887613506
-1.7155632797953904 -1.3342789803216091 -0.62674761880757135  0.51582822603431788 -0.58403467808965126 -0.62675731827798087
-1.6662660666179783 -1.4411624465210644 -0.55216883979414821  0.4664730029139289 -0.69097715483087219 -0.55222595833073118
-1.6655650436231657 -1.5612924693932406 -0.35362935294171666  0.46550486715932354 -0.81121902067951002 -0.35387698305874205
-1.6063294025426431 -1.5343712383737107 -0.46867704983435049  0.40646863937642785 -0.78424095119900827 -0.46877433341209107
-2.1453832490724949 -1.0686356302649227 -0.06871570052621874  0.94544807568691724 -0.31851500876272509 -0.068382200701546103
-2.0934279503155278 -1.1771618836975488 -0.13899360672691582  0.89352037004910589 -0.42704736713517844 -0.1387511965001422
-1.9695778385021763 -1.3734022291431622 -0.13827368218737227  0.76972539034249321 -0.62320039727703391 -0.13836216352689615
-2.0247164420172248 -1.2757938275259753 -0.20828740048796671  0.82482450355065107 -0.525682807746505 -0.20813967421463211
-1.8267476188075715 -1.26556327979539 0.58427898032160919  0.62647295099493583 -0.51565247738810571 0.58449479401890814
-1.8911624465210648 -1.302168839794148 0.4662660666179782  0.69097715483087407 -0.55222595833073052 0.46647300291392696
-1.889296561151935 -1.4230187872058684 0.2681715176003196  0.68937955050281319 -0.67285685715261345 0.26836446324214919
-1.9433454959605347 -1.3260838378857436 0.3399483569044256  0.74324570666303946 -0.57610127698437241 0.34013694034011438
-1.7842789803216093 -0.12325238119242887 0.51556327979539029  0.58403467808965281 0.62675731827798076 0.51582822603431622
-1.8911624465210641 -0.19783116020585167 0.46626606661797843  0.69097715483087407 0.55222595833073118 0.4664730029139264
-2.0112924693932408 -0.39637064705828329 0.46556504362316598  0.81121902067950979 0.35387698305874404 0.46550486715932238
-1.9843712383737104 -0.28132295016564945 0.40632940254264299  0.78424095119900972 0.46877433341208941 0.40646863937642708
-0.77018003072289609 -0.75 -0.90291461058653244  -0.42961984965259892 0.00028436728304730646 -0.90300980278163467
-0.77283811630245081 -0.88899360672691596 -0.89342795031552769  -0.42704736713517827 -0.13875119650014237 -0.89352037004910589
-0.89598720512098939 -1.0856672082102183 -0.89157374674348211  -0.304220523183167 -0.33550256744406931 -0.89156486051918726
-0.78161296052541807 -1.0246684461261839 -0.86574218443040096  -0.41835586417422177 -0.27447137325094834 -0.86581974808662032
-0.83001349060802176 -0.0073066631575244394 -0.55678551944213672  -0.37302523877669491 0.74314518846919997 -0.55550643568789282
-0.53310523682898858 -0.48133611427487955 -0.69462568959831961  -0.64422625268360245 0.27076651461112594 -0.71530275402698285
-0.3601361494343176 -0.80485714071361691 0.54001796879892039  -0.8390925313001083 -0.056307189018241985 0.54106674669696786
-0.38108971266128355 -0.75 -0.57392154628557113  -0.81788534298629911 -0.00078604920685779688 -0.57538069819453297
-0.88136436973507715 -0.81871570052621845 0.94538324907249471  -0.31851500876272526 -0.068382200701546589 0.94544807568691713
-0.77283811630245092 -0.88899360672691596 0.89342795031552769  -0.42704736713517888 -0.13875119650014284 0.89352037004910545
-0.57659777085683772 -0.88827368218737235 0.76957783850217654  -0.62320039727703636 -0.13836216352689581 0.76972539034249132
-0.67420617247402481 -0.9582874004879669 0.82471644201722483  -0.52568280774650478 -0.20813967421463539 0.82482450355065029
-0.87160444279468918 -1.3906145370870964 0.69409608332024098  -0.32871571883365219 -0.64057192708348321 0.69398384882086983
-0.92712117915505499 -1.4902458861856145 0.61446983418191214  -0.2730077511897796 -0.74028370995146875 0.61436698850995353
-0.74873333439274148 -1.3375076190110726 0.67170915887432037  -0.45142526361231805 -0.58763152153323228 0.67149417441485482
-0.63335215040065596 -1.2737239478373756 0.63610018157997195  -0.5663221914054013 -0.52380155193385325 0.636326260430505
-0.88136436973507692 -0.681284299473781 0.9453832490724946  -0.3189751246919813 0.068666567984592267 0.94527232704070641
-0.99773449620553689 -0.74999999999999989 0.9793307234916977  -0.20254321521823254 9.0300893355443904e-17 0.97927332546590928
-1.1197187226497591 -0.94739352602284632 0.97703158208487906  -0.080345839839676983 -0.19714040391717325 0.97707738033578018
-1.1186290539433099 -0.81638104563821712 0.9944708773603258  -0.08157879688761159 -0.066331699036312336 0.99445714115859518
-1.715563279795391 -1.3342789803216086 0.62674761880757113  0.51582822603431788 -0.58403467808965215 0.62675731827798009
-1.7521688397941486 -1.2162660666179781 0.69116244652106418  0.55222595833073262 -0.46647300291392663 0.69097715483087263
-1.8730187872058686 -1.0181715176003194 0.68929656115193494  0.67285685715261245 -0.2683644632421518 0.68937955050281308
-1.7760838378857442 -1.0899483569044257 0.74334549596053434  0.57610127698437397 -0.34013694034011416 0.74324570666303846
-1.5186356302649235 -0.68128429947378122 0.94538324907249438  0.31851500876272459 0.068382200701545673 0.94544807568691736
-1.6271618836975499 -0.61100639327308437 0.89342795031552724  0.42704736713517866 0.13875119650014181 0.89352037004910578
-1.8234022291431624 -0.61172631781262787 0.7695778385021762  0.62320039727703658 0.13836216352689631 0.7697253903424911
-1.7257938275259754 -0.54171259951203343 0.82471644201722449  0.52568280774650533 0.20813967421463578 0.82482450355064996
-2.1453832490724944 -0.43136436973507697 0.068715700526218768  0.94544807568691758 0.31851500876272426 0.068382200701545118
-2.0934279503155278 -0.32283811630245085 0.13899360672691591  0.89352037004910578 0.42704736713517838 0.138751196500143
-1.9695778385021763 -0.12659777085683765 0.13827368218737227  0.76972539034249055 0.62320039727703702 0.13836216352689729
-2.0247164420172248 -0.22420617247402475 0.20828740048796671  0.82482450355065073 0.52568280774650478 0.2081396742146342
-1.7155632797953904 -0.16572101967839103 0.62674761880757157  0.51565247738810571 0.58449479401890947 0.6264729509949345
-1.6662660666179785 -0.058837553478935822 0.55216883979414844  0.46647300291392862 0.69097715483087263 0.55222595833073085
-1.6655650436231659 0.061292469393240734 0.35362935294171677  0.46550486715932449 0.81121902067950891 0.35387698305874343
-1.6063294025426431 0.034371238373710589 0.46867704983435055  0.40646863937642713 0.78424095119900905 0.46877433341209024
-1.2687157005262188 0.19538324907249438 -0.3186356302649232  0.068382200701545076 0.94544807568691724 -0.31851500876272498
-1.2000000000000002 0.22933072349169759 -0.20226550379446331  1.205169615166886e-15 0.97927332546590917 -0.20254321521823279
-1.0026064739771541 0.22703158208487906 -0.080281277350241251  -0.19714040391717261 0.97707738033578029 -0.08034583983967665
-1.1336189543617827 0.24447087736032569 -0.081370946056690249  -0.066331699036312627 0.99445714115859507 -0.081578796887612021
-1.2000000000000002 0.15291461058653233 0.4298199692771042  -0.00028436728304613427 0.90300980278163412 0.42961984965260003
-1.0610063932730838 0.14342795031552757 0.42716188369754932  -0.13875119650014217 0.89352037004910645 0.42704736713517716
-1.1327229259756779 -1.4522770253220765 0.70871769768752158  -0.067501320615791227 -0.70276863564903946 0.70820887911908581
-0.92533155387381627 0.11574218443040096 0.41838703947458195  -0.27447137325094978 0.86581974808661888 0.41835586417422366
-0.99987185965655656 -1.4301807185069526 0.70519707714513435  -0.20029565457621165 -0.68040299513329339 0.70493504308661681
-1.2000000000000002 -1.3757818886900326 0.77999809473327286  0.00023519417927867815 -0.62694312538533137 0.77906499229253701
-1.2548571407136171 -1.2900179687989204 0.83986385056568236  0.056792994144885443 -0.5397948923634539 0.83987858050696007
-0.55938546291290392 -1.444096083320241 0.32839555720531116  -0.64057192708348298 -0.69398384882087039 0.32871571883365153
-0.45975411381438525 -1.3644698341819119 0.27287882084494525  -0.74028370995146853 -0.61436698850995375 0.27300775118977932
-0.61249238098892733 -1.4217091588743203 0.45126666560725864  -0.58763152153323139 -0.67149417441485548 0.45142526361231827
-0.67627605216262487 -1.3861001815799721 0.56664784959934433  -0.52380155193385192 -0.63632626043050544 0.56632219140540219
-0.62391616211425593 -0.41005164309557418 0.74334549596053445  -0.57610127698437319 0.34013694034011493 0.74324570666303869
-0.57325238119242883 -1.2655632797953908 0.58427898032160908  -0.62647295099493583 -0.51565247738810605 0.58449479401890769
-0.64783116020585174 -1.2162660666179785 0.6911624465210644  -0.55222595833072996 -0.46647300291392807 0.69097715483087374
-0.84637064705828369 -1.2155650436231662 0.81129246939324073  -0.35387698305874449 -0.46550486715932471 0.81121902067950824
-0.73132295016564974 -1.1563294025426434 0.7843712383737107  -0.46877433341208929 -0.4064686393764283 0.78424095119900905
-1.7155632797953904 -0.16572101967839092 -0.62674761880757124  0.51582822603431733 0.58403467808965204 -0.62675731827798065
-1.7521688397941486 -0.28373393338202163 -0.69116244652106418  0.55222595833073063 0.46647300291392718 -0.69097715483087374
-1.8730187872058686 -0.48182848239968035 -0.68929656115193494  0.67285685715261245 0.2683644632421518 -0.68937955050281297
-1.7760838378857442 -0.41005164309557424 -0.74334549596053434  0.5761012769843743 0.34013694034011466 -0.74324570666303802
-1.8267476188075715 -1.2655632797953904 -0.58427898032160897  0.62647295099493516 -0.5156524773881066 -0.58449479401890814
-1.7521688397941486 -1.2162660666179783 -0.69116244652106418  0.55222595833073052 -0.46647300291392779 -0.69097715483087352
-1.5536293529417169 -1.2155650436231658 -0.81129246939324051  0.35387698305874349 -0.4655048671593236 -0.81121902067950935
-1.6686770498343508 -1.1563294025426429 -0.78437123837371048  0.46877433341208991 -0.40646863937642802 -0.78424095119900883
-1.5186356302649235 -0.68128429947378111 -0.94538324907249438  0.31897512469198214 0.068666567984592433 -0.94527232704070618
-1.4022655037944636 -0.74999999999999989 -0.97933072349169759  0.20254321521823387 -2.5006401236892162e-16 -0.97927332546590906
-1.2802812773502414 -0.94739352602284621 -0.97703158208487884  0.080345839839679356 -0.197140403917173 -0.97707738033577995
-1.2813709460566907 -0.81638104563821712 -0.9944708773603258  0.08157879688761327 -0.066331699036313224 -0.99445714115859496
-0.68443672020460955 -1.3342789803216091 -0.62674761880757146  -0.51582822603431644 -0.58403467808965193 -0.62675731827798142
-0.64783116020585152 -1.2162660666179783 -0.69116244652106429  -0.5522259583307314 -0.46647300291392718 -0.69097715483087319
-0.52698121279413157 -1.0181715176003197 -0.68929656115193516  -0.67285685715261323 -0.26836446324215107 -0.68937955050281274
-0.62391616211425593 -1.0899483569044257 -0.74334549596053445  -0.57610127698437252 -0.3401369403401156 -0.7432457066630388
-0.88136436973507692 -0.68128429947378122 -0.9453832490724946  -0.31851500876272476 0.068382200701544715 -0.94544807568691747
-0.77283811630245081 -0.61100639327308426 -0.89342795031552769  -0.42704736713517799 0.13875119650014148 -0.89352037004910612
-0.57659777085683772 -0.61172631781262776 -0.76957783850217643  -0.62320039727703602 0.13836216352689645 -0.76972539034249132
-0.67420617247402481 -0.54171259951203332 -0.82471644201722483  -0.52568280774650522 0.20813967421463611 -0.82482450355064996
-0.49772297467792337 -1.4587176976875216 0.067277074024322203  -0.7027686356490408 -0.70820887911908448 0.067501320615791435
-0.51981928149304746 -1.4551970771451346 0.20012814034344362  -0.68040299513329339 -0.70493504308661636 0.20029565457621368
-0.57421811130996692 -1.5299980947332723 0  -0.62694312538533159 -0.77906499229253678 0.00023519417927653918
-0.65998203120107946 -1.5898638505656821 -0.054857140713616928  -0.5397948923634549 -0.8398785805069594 -0.056792994144885846
-0.27630591545862715 -1.0226998137406513 0.26911716736226515  -0.92375019852295004 -0.27282039415738807 0.26880216379452382
-0.33769549234610641 -1.1259607778954337 0.33924096091721689  -0.86229745711633843 -0.37608264246842493 0.33912378489964901
-0.24939270379056044 -1.0288981373351189 0.13624095340381406  -0.95064905270461686 -0.27889806070390488 0.13594944033505735
-0.2402206179342532 -1.0307552987238056 0  -0.95982343558557026 -0.28060440841513645 -0.00037212726838045277
-1.1312842994737813 0.1953832490724946 0.31863563026492325  -0.068666567984591781 0.94527232704070585 0.31897512469198336
-1.2 0.22933072349169759 0.20226550379446331  3.4731112829016888e-18 0.97927332546590884 0.20254321521823493
-1.3973935260228463 0.22703158208487906 0.080281277350241251  0.19714040391717272 0.97707738033578007 0.08034583983967887
-1.2663810456382176 0.24447087736032569 0.081370946056690249  0.06633169903631346 0.99445714115859496 0.081578796887612895
-1.2000000000000002 0.15291461058653233 -0.4298199692771042  -0.00028436728304575399 0.90300980278163412 -0.42961984965260003
-1.3389936067269161 0.14342795031552757 -0.42716188369754932  0.13875119650014284 0.89352037004910634 -0.42704736713517738
-1.5356672082102183 0.141573746743482 -0.30401279487901056  0.33550256744406881 0.89156486051918704 -0.30422052318316811
-1.4746684461261839 0.11574218443040085 -0.41838703947458189  0.27447137325094767 0.8658197480866211 -0.4183558641742206
-2.1029146105865326 -0.32018003072289597 0  0.90300980278163423 0.42961984965259975 0.00028436728304962827
-2.0934279503155278 -0.32283811630245074 -0.13899360672691588  0.89352037004910589 0.42704736713517844 -0.13875119650014242
-2.0915737467434821 -0.44598720512098944 -0.33566720821021834  0.89156486051918726 0.30422052318316639 -0.33550256744406975
-2.0657421844304009 -0.33161296052541833 -0.27466844612618385  0.86581974808662043 0.41835586417422105 -0.27447137325094917
-2.1029146105865326 -1.1798199692771036 0  0.90300980278163301 -0.42961984965260225 -0.00028436728304584425
-2.0934279503155278 -1.1771618836975488 0.1389936067269158  0.89352037004910567 -0.42704736713517821 0.13875119650014328
-2.0915737467434821 -1.0540127948790103 0.33566720821021817  0.89156486051918749 -0.30422052318316689 0.33550256744406859
-2.0657421844304009 -1.1683870394745814 0.27466844612618369  0.86581974808662021 -0.41835586417422149 0.27447137325094934
-1.6298199692771045 -0.75 0.90291461058653211  0.42961984965259953 0.00028436728304707373 0.90300980278163434
-1.6271618836975499 -0.88899360672691596 0.89342795031552724  0.4270473671351781 -0.1387511965001422 0.89352037004910589
-1.5040127948790105 -1.0856672082102186 0.89157374674348189  0.30422052318316728 -0.33550256744406981 0.89156486051918693
-1.6183870394745821 -1.0246684461261837 0.86574218443040063  0.41835586417422238 -0.27447137325094739 0.86581974808662043
-1.7842789803216095 -1.3767476188075709 0.51556327979539029  0.58449479401890891 -0.62647295099493361 0.5156524773881076
-1.6662660666179789 -1.441162446521064 0.55216883979414799  0.46647300291392879 -0.69097715483087296 0.5522259583307304
-1.4681715176003203 -1.4392965611519348 0.67301878720586839  0.26836446324215246 -0.68937955050281186 0.67285685715261345
-1.5399483569044261 -1.4933454959605343 0.57608383788574391  0.34013694034011693 -0.74324570666303724 0.57610127698437386
-0.68443672020460988 -1.3342789803216091 0.62674761880757146  -0.51582822603431644 -0.58403467808965159 0.62675731827798165
-0.73373393338202175 -1.4411624465210644 0.55216883979414821  -0.46647300291392807 -0.69097715483087219 0.55222595833073174
-0.7344349563768342 -1.5612924693932408 0.35362935294171671  -0.46550486715932454 -0.8112190206795088 0.35387698305874338
-0.79367059745735713 -1.5343712383737107 0.46867704983435055  -0.40646863937642935 -0.78424095119900805 0.46877433341209013
-1.2687157005262188 -1.6953832490724943 0.31863563026492331  0.068666567984592364 -0.94527232704070607 0.31897512469198253
-1.2000000000000002 -1.7293307234916977 0.20226550379446345  1.7087707511876313e-15 -0.97927332546590906 0.20254321521823371
-1.0026064739771541 -1.7270315820848792 0.080281277350241306  -0.19714040391717255 -0.97707738033578018 0.080345839839678579
-1.1336189543617827 -1.7444708773603259 0.081370946056690305  -0.066331699036312086 -0.99445714115859507 0.081578796887612465
-0.61572101967839066 -1.3767476188075713 -0.51556327979539052  -0.58449479401890958 -0.62647295099493461 -0.51565247738810571
-0.73373393338202175 -1.4411624465210644 -0.55216883979414821  -0.46647300291392635 -0.69097715483087474 -0.55222595833073029
-0.93182848239968041 -1.439296561151935 -0.6730187872058685  -0.26836446324215057 -0.6893795505028133 -0.67285685715261268
-0.86005164309557447 -1.4933454959605346 -0.57608383788574402  -0.3401369403401146 -0.74324570666303957 -0.5761012769843723
-1.2687157005262188 -1.6953832490724943 -0.31863563026492325  0.068382200701545798 -0.94544807568691736 -0.31851500876272471
-1.3389936067269161 -1.6434279503155274 -0.42716188369754937  0.13875119650014295 -0.89352037004910545 -0.42704736713517893
-1.3382736821873722 -1.5195778385021765 -0.62340222914316235  0.1383621635268972 -0.76972539034249099 -0.62320039727703636
-1.4082874004879669 -1.5747164420172246 -0.52579382752597525  0.20813967421463467 -0.82482450355065073 -0.52568280774650433
-1.5186356302649235 -0.81871570052621845 -0.94538324907249438  0.31851500876272465 -0.068382200701545895 -0.94544807568691736
-1.6271618836975494 -0.88899360672691574 -0.89342795031552757  0.42704736713517805 -0.13875119650014167 -0.89352037004910601
-1.8234022291431624 -0.88827368218737224 -0.7695778385021762  0.6232003972770368 -0.13836216352689648 -0.76972539034249088
-1.7257938275259754 -0.95828740048796668 -0.82471644201722449  0.52568280774650433 -0.20813967421463572 -0.82482450355065062
-1.7842789803216093 -1.3767476188075713 -0.51556327979539018  0.58449479401890903 -0.6264729509949345 -0.51565247738810627
-1.8911624465210641 -1.3021688397941484 -0.46626606661797826  0.69097715483087363 -0.55222595833073029 -0.46647300291392774
-2.0112924693932408 -1.1036293529417165 -0.4655650436231657  0.81121902067950913 -0.35387698305874249 -0.46550486715932471
-1.9843712383737104 -1.2186770498343509 -0.40632940254264294  0.78424095119900872 -0.46877433341209096 -0.40646863937642724
-2.1453832490724944 -0.43136436973507697 -0.068715700526218768  0.94527232704070618 0.31897512469198236 -0.068666567984592003
-2.1793307234916974 -0.54773449620553694 0  0.97927332546590951 0.20254321521823138 7.6408448223837148e-17
-2.1770315820848789 -0.66971872264975862 0.19739352602284604  0.97707738033577951 0.080345839839677496 0.1971404039171758
-2.1944708773603256 -0.66862905394330951 0.066381045638217215  0.9944571411585954 0.081578796887609967 0.066331699036310518
-2.1453832490724944 -1.0686356302649229 0.068715700526218726  0.94527232704070685 -0.31897512469198008 0.068666567984593432
-2.1793307234916974 -0.95226550379446329 0  0.97927332546590973 -0.20254321521823046 0
-2.1770315820848789 -0.83028127735024104 -0.19739352602284604  0.97707738033577962 -0.08034583983967751 -0.19714040391717561
-2.1944708773603256 -0.83137094605669015 -0.066381045638217187  0.9944571411585954 -0.081578796887609842 -0.066331699036310671
-1.8267476188075715 -0.23443672020460971 -0.58427898032160908  0.62647295099493572 0.51565247738810649 -0.58449479401890769
-1.8911624465210641 -0.19783116020585167 -0.46626606661797843  0.69097715483087474 0.55222595833073052 -0.46647300291392602
-1.889296561151935 -0.076981212794131615 -0.26817151760031976  0.68937955050281385 0.67285685715261223 -0.26836446324215019
-1.9433454959605347 -0.17391616211425631 -0.33994835690442565  0.74324570666303935 0.5761012769843723 -0.34013694034011493
-1.2 -1.6529146105865324 -0.42981996927710425  0.00028436728304640516 -0.90300980278163412 -0.42961984965260003
-1.0610063932730844 -1.6434279503155276 -0.42716188369754948  -0.13875119650014034 -0.89352037004910601 -0.42704736713517849
-0.86433279178978162 -1.6415737467434819 -0.30401279487901062  -0.33550256744406753 -0.89156486051918804 -0.30422052318316672
-0.92533155387381627 -1.615742184430401 -0.41838703947458195  -0.274471373250947 -0.86581974808662088 -0.4183558641742216
-0.29708538941346763 -1.1798199692771041 0  -0.90300980278163434 -0.42961984965259953 -0.00028436728304637046
-0.30657204968447227 -1.1771618836975493 -0.13899360672691591  -0.89352037004910567 -0.42704736713517849 -0.13875119650014259
-0.30842625325651785 -1.0540127948790103 -0.33566720821021845  -0.89156486051918693 -0.3042205231831665 -0.3355025674440707
-0.33425781556959899 -1.1683870394745817 -0.27466844612618391  -0.8658197480866201 -0.41835586417422177 -0.27447137325094878
-0.57325238119242872 -1.2655632797953904 -0.5842789803216093  -0.62675731827798131 -0.51582822603431833 -0.58403467808965048
-0.50883755347893578 -1.3021688397941484 -0.46626606661797843  -0.69097715483087263 -0.55222595833073107 -0.4664730029139284
-0.51070343884806491 -1.4230187872058684 -0.26817151760031971  -0.68937955050281263 -0.67285685715261334 -0.2683644632421508
-0.45665450403946539 -1.3260838378857438 -0.33994835690442576  -0.74324570666303902 -0.5761012769843723 -0.3401369403401156
-0.61572101967839088 -1.3767476188075713 0.51556327979539029  -0.58449479401890914 -0.62647295099493516 0.51565247738810549
-0.50883755347893578 -1.3021688397941484 0.46626606661797843  -0.69097715483087385 -0.55222595833073085 0.46647300291392696
-0.38870753060675922 -1.1036293529417167 0.46556504362316592  -0.8112190206795088 -0.35387698305874399 0.46550486715932421
-0.41562876162628937 -1.2186770498343509 0.40632940254264294  -0.7842409511990085 -0.46877433341208985 0.4064686393764288
-0.25461675092750535 -1.0686356302649229 0.068715700526218781  -0.94527232704070607 -0.3189751246919828 0.06866656798459092
-0.30657204968447227 -1.1771618836975493 0.13899360672691594  -0.89352037004910567 -0.42704736713517838 0.13875119650014259
-0.43042216149782375 -1.3734022291431622 0.13827368218737227  -0.76972539034249121 -0.62320039727703613 0.13836216352689668
-0.37528355798277535 -1.2757938275259753 0.20828740048796671  -0.82482450355065018 -0.52568280774650533 0.20813967421463472
-1.1312842994737815 -1.6953832490724945 0.31863563026492331  -0.068382200701546658 -0.94544807568691691 0.31851500876272587
-1.0610063932730844 -1.6434279503155276 0.42716188369754937  -0.1387511965001425 -0.89352037004910556 0.42704736713517877
-1.0617263178126279 -1.5195778385021765 0.62340222914316235  -0.13836216352689668 -0.76972539034249121 0.62320039727703613
-0.99171259951203317 -1.5747164420172246 0.52579382752597525  -0.20813967421463464 -0.82482450355065107 0.52568280774650411
-0.37598126576074054 -0.98458495860622119 0.51571602924327087  -0.82387113061171735 -0.23530638500725803 0.51562318151862274
-0.31923210876951291 -1.0095222183644981 0.39610117388436322  -0.88070834559541711 -0.25988482570664401 0.39599581735923739
-0.37559104740343063 -0.86626913535565186 0.55392361119767797  -0.82413049582749909 -0.11774782579538251 0.55402560894563424
-0.38108971266128377 -0.75 0.57392154628557124  -0.81788534298629689 0.00078604920685422248 0.57538069819453608
-0.25461675092750535 -1.0686356302649229 -0.068715700526218781  -0.94527232704070607 -0.31897512469198275 -0.06866656798459167
-0.39952765932508105 -1.3452985273360616 -0.069740197633308867  -0.80067536950372631 -0.5950344796892979 -0.069662907281837605
-0.4192318321456685 -1.339425686808948 -0.20731239180326452  -0.78085960551688671 -0.58928970592655938 -0.20735457304096597
-0.33359424365380819 -1.2493406306021806 0  -0.8665295822371375 -0.49912569350340957 0.00015872199696838273
-1.2000000000000002 -0.17607845371442887 0.8189102873387164  0.00078604920685643935 0.57538069819453463 0.81788534298629789
-1.3162691353556522 -0.19607638880232214 0.82440895259656966  0.11760246779863406 0.55440616112166063 0.82389530164822189
-1.4595222183644985 -0.35389882611563678 0.88076789123048704  0.25988482570664406 0.39599581735923461 0.88070834559541833
-1.4345849586062216 -0.23428397075672924 0.82401873423925942  0.23530638500725762 0.5156231815186243 0.82387113061171657
-1.4807552987238062 -0.74999999999999989 0.95977938206574653  0.28060440841513762 -0.00037212726837746596 0.95982343558556993
-1.4788981373351193 -0.61375904659618596 0.95060729620943918  0.27889806070390483 0.13594944033505535 0.9506490527046173
-1.5759607778954343 -0.41075903908278349 0.86230450765389333  0.3760826424684251 0.33912378489964862 0.86229745711633843
-1.4726998137406517 -0.48088283263773512 0.9236940845413727  0.27282039415738796 0.26880216379452349 0.92375019852295015
-1.1451428592863835 -0.20998203120107972 0.83986385056568247  -0.056792994144884909 0.53979489236345513 0.83987858050695929
-1.2000000000000002 -0.12421811130996729 0.77999809473327275  -0.00023519417927636216 0.62694312538533148 0.77906499229253701
-1.4001281403434436 -0.069819281493047614 0.70519707714513458  0.20029565457621304 0.68040299513329194 0.70493504308661781
-1.2672770740243227 -0.047722974677923635 0.70871769768752158  0.067501320615790811 0.70276863564903991 0.70820887911908526
-1.7666478495993445 -0.22627605216262514 0.63610018157997195  0.56692430597377852 0.52342942466547437 0.63609627313050654
-1.6512666656072588 -0.16249238098892749 0.67170915887432037  0.45142526361231788 0.58763152153323128 0.67149417441485582
-1.4728788208449453 -0.0097541138143855122 0.61446983418191214  0.27300775118977932 0.74028370995146853 0.61436698850995386
-1.5283955572053114 -0.10938546291290407 0.69409608332024086  0.32871571883365219 0.64057192708348309 0.69398384882086994
-1.1660964225133497 -0.26483917191469658 0.87376742805233332  -0.034313951497558143 0.48348770334523578 0.87467833713118359
-1.0837308646443482 -0.19607638880232214 0.82440895259656966  -0.11774782579538186 0.55402560894563402 0.82413049582749931
-1.0641637744730592 -0.030084692934636004 0.68063975088704354  -0.13609530337963688 0.72008099426245653 0.68041269101920532
-1.0069945598044525 -0.12542737832173323 0.75674166021493716  -0.19358827458119388 0.62484261256047791 0.75636980999592573
-1.2694523319806277 0.1668554803037775 0.39313153246640248  0.06940195445672516 0.91670068154564299 0.39350124418016807
-1.2 0.11640575634619166 0.49934063060218076  0.00015872199696780447 0.86652958223713705 0.49912569350341029
-0.9926876081967354 0.030768167854331341 0.58942568680894825  -0.20735457304096638 0.78085960551688705 0.58928970592655883
-1.1302598023666912 0.050472340674918903 0.59529852733606181  -0.069662907281836717 0.80067536950372642 0.59503447968929779
-1.2339035774866509 -0.26483917191469664 0.87376742805233321  0.03558580583107987 0.48427375255209093 0.87419253200451719
-1.1281417225076453 -0.31234552415797412 0.8962672300889245  -0.072917516439698377 0.4366583353262779 0.89666746009117004
-0.91592045537741096 -0.28960691129913413 0.84103330267207566  -0.28440717777405583 0.46019616855581391 0.84103034646625285
-1.0134390039211945 -0.36001233692795437 0.90172313788306924  -0.18714545413041725 0.38953622755321993 0.9017971537002798
-0.28314451969622234 -1.1431315324664022 0.069452331980627627  -0.91670068154564344 -0.39350124418016724 0.069401954456724341
-0.74873333439274148 -0.16249238098892738 0.67170915887432037  -0.45142526361231566 0.58763152153323017 0.67149417441485826
-0.79899507473160236 -0.34519261004110258 0.82178222598517658  -0.4011599250518198 0.40477696304846228 0.8217215615509198
-0.82850263027516902 -0.22222747306573265 0.76383628095354994  -0.37176976328895961 0.52785497534633785 0.76364675610270738
-1.2548571407136169 -0.20998203120107972 0.83986385056568236  0.056792994144885006 0.53979489236345513 0.83987858050695929
-1.271858277492355 -0.31234552415797412 0.8962672300889245  0.072536964263671039 0.43642314114700037 0.89681281808791979
-1.1602654114415887 -0.48973505164257786 0.96471929550963276  -0.039677999129163512 0.2599005139796004 0.96481986879326109
-1.2777044036438101 -0.42728941095227679 0.94330265629374277  0.077926023088563209 0.32203490693742853 0.94351526412634279
-0.80686846753359776 -0.68054766801937239 0.91685548030377773  -0.39350124418016713 0.069401954456725465 0.91670068154564333
-0.92110186266488114 -0.61375904659618596 0.9506072962094394  -0.27889806070390516 0.13594944033505688 0.95064905270461697
-1.1594777183312834 -0.61807143088604777 0.99043061207734606  -0.040575895565417477 0.13176921185868248 0.99044963097837835
-1.0401421964121773 -0.55062303027104376 0.96679589706089264  -0.1601034424202428 0.19913925651268588 0.96680424297825807
-1.1451428592863835 -0.20998203120107972 -0.83986385056568247  -0.056307189018220377 0.54106674669697519 -0.83909253130010497
-1.1281417225076453 -0.31234552415797412 -0.8962672300889245  -0.072917516439697155 0.43665833532627857 -0.89666746009116993
-1.2397345885584119 -0.48973505164257786 -0.96471929550963276  0.039677999129163456 0.2599005139796004 -0.96481986879326109
-1.1222955963561905 -0.42728941095227674 -0.94330265629374299  -0.077926023088562377 0.32203490693742809 -0.94351526412634301
-1.5931315324664026 -0.68054766801937205 -0.91685548030377739  0.3928991296117913 0.069774081725103076 -0.91693066884564156
-1.4788981373351193 -0.61375904659618596 -0.95060729620943918  0.2788980607039051 0.13594944033505696 -0.95064905270461697
-1.2405222816687171 -0.61807143088604777 -0.99043061207734606  0.040575895565417311 0.13176921185868248 -0.99044963097837835
-1.3598578035878233 -0.55062303027104387 -0.96679589706089242  0.16010344242024502 0.19913925651268566 -0.96680424297825773
-1.2000000000000002 -0.17607845371442887 -0.8189102873387164  0.00078604920685399165 0.57538069819453563 -0.81788534298629723
-1.0837308646443482 -0.19607638880232214 -0.82440895259656966  -0.11774782579538265 0.55402560894563257 -0.8241304958275002
-0.94047778163550189 -0.35389882611563678 -0.88076789123048704  -0.25988482570664379 0.39599581735923595 -0.88070834559541789
-0.96541504139377876 -0.23428397075672924 -0.82401873423925942  -0.23530638500725815 0.5156231815186223 -0.82387113061171757
-0.9192447012761944 -0.74999999999999989 -0.95977938206574664  -0.2806044084151379 0.00037212726837797293 -0.95982343558556982
-0.92110186266488114 -0.61375904659618596 -0.9506072962094394  -0.2788980607039056 0.13594944033505726 -0.95064905270461675
-0.82403922210456626 -0.41075903908278338 -0.86230450765389366  -0.37608264246842449 0.33912378489964912 -0.86229745711633865
-0.9273001862593484 -0.48088283263773507 -0.92369408454137281  -0.27282039415738762 0.26880216379452387 -0.92375019852295004
-1.2548571407136169 -0.20998203120107972 -0.83986385056568236  0.05679299414488588 0.53979489236345568 -0.83987858050695885
-1.2000000000000002 -0.12421811130996729 -0.77999809473327275  0.00023519417927831535 0.62694312538533148 -0.77906499229253701
-0.99987185965655645 -0.069819281493047614 -0.70519707714513458  -0.20029565457621246 0.68040299513329205 -0.70493504308661803
-1.1327229259756779 -0.047722974677923524 -0.70871769768752169  -0.067501320615790825 0.70276863564903991 -0.70820887911908537
-0.57542737832173307 -1.5067416602149373 -0.19300544019554752  -0.62484261256047646 -0.75636980999592629 -0.19358827458119632
-0.74873333439274126 -0.16249238098892738 -0.67170915887432048  -0.45142526361230273 0.58763152153321885 -0.67149417441487691
-0.92712117915505488 -0.0097541138143854011 -0.61446983418191226  -0.2730077511897796 0.74028370995146864 -0.61436698850995353
-0.87160444279468874 -0.10938546291290407 -0.69409608332024098  -0.32871571883365308 0.64057192708348221 -0.6939838488208705
-1.2339035774866509 -0.26483917191469664 -0.87376742805233321  0.034313951497560419 0.48348770334523578 -0.87467833713118348
-1.3162691353556522 -0.19607638880232214 -0.82440895259656966  0.11774782579538323 0.55402560894563191 -0.82413049582750042
-1.3358362255269414 -0.030084692934636004 -0.68063975088704354  0.13609530337963555 0.72008099426245742 -0.68041269101920465
-1.3930054401955481 -0.12542737832173323 -0.75674166021493716  0.1935882745811954 0.62484261256047757 -0.75636980999592551
-1.1305476680193727 0.1668554803037775 -0.39313153246640248  -0.06940195445672484 0.91670068154564333 -0.39350124418016724
-1.2000000000000002 0.11640575634619166 -0.49934063060218076  -0.00015872199696780447 0.86652958223713705 -0.49912569350341041
-1.4073123918032642 0.030768167854331452 -0.58942568680894836  0.20735457304096577 0.78085960551688738 -0.5892897059265586
-1.2697401976333089 0.050472340674918903 -0.59529852733606181  0.069662907281837327 0.80067536950372598 -0.59503447968929846
-1.1660964225133497 -0.26483917191469669 -0.87376742805233321  -0.034313951497560037 0.48348770334523533 -0.87467833713118381
-1.271858277492355 -0.31234552415797412 -0.8962672300889245  0.072917516439698168 0.43665833532627896 -0.8966674600911696
-1.4840795446225896 -0.28960691129913418 -0.84103330267207554  0.28440717777405683 0.46019616855581313 -0.84103034646625296
-1.3865609960788059 -0.36001233692795448 -0.90172313788306901  0.18714545413041792 0.3895362275532197 -0.90179715370027969
-1.7237239478373754 -0.11389981842002828 -0.56664784959934411  0.52342942466547415 0.63609627313050576 -0.56692430597377963
-1.6512666656072588 -0.16249238098892749 -0.67170915887432026  0.45152335920120784 0.58737470394737423 -0.67165289641182335
-1.6010049252683982 -0.34519261004110269 -0.82178222598517636  0.40115992505181991 0.40477696304846139 -0.82172156155092013
-1.5714973697248311 -0.22222747306573276 -0.76383628095354983  0.37176976328896055 0.52785497534633763 -0.76364675610270705
-1.6851608280853034 -1.6237674280523331 -0.033903577486650918  0.48348770334523483 -0.87467833713118415 -0.034313951497558663
-1.6376544758420264 -1.6462672300889243 0.071858277492354988  0.43642314114700104 -0.89681281808791946 0.072536964263670678
-1.660393088700866 -1.5910333026720753 0.28407954462258922  0.46019616855581286 -0.84103034646625341 0.28440717777405605
-1.589987663072046 -1.651723137883069 0.18656099607880569  0.38953622755321926 -0.90179715370028024 0.18714545413041631
-1.836100181579972 -1.3166478495993439 0.52372394783737497  0.63609627313050565 -0.56692430597377952 0.52342942466547437
-1.7875076190110732 -1.4217091588743203 0.45126666560725837  0.58737470394737512 -0.6716528964118228 0.45152335920120756
-1.6048073899588982 -1.5717822259851764 0.40100492526839771  0.404776963048462 -0.82172156155091969 0.40115992505182024
-1.7277725269342676 -1.5138362809535497 0.37149736972483094  0.52785497534633852 -0.76364675610270749 0.37176976328895861
-1.7400179687989208 -1.5898638505656821 -0.054857140713616921  0.53979489236345524 -0.83987858050695918 -0.056792994144885173
-1.6376544758420264 -1.6462672300889243 -0.071858277492354988  0.43665833532627957 -0.89666746009116938 -0.072917516439697114
-1.4602649483574226 -1.7147192955096329 0.039734588558411603  0.25990051397960245 -0.96481986879326054 0.039677999129164386
-1.5227105890477237 -1.6933026562937428 -0.077704403643809719  0.32203490693742914 -0.94351526412634257 -0.077926023088563112
-1.2694523319806277 -1.6668554803037776 0.39313153246640242  0.069401954456726839 -0.91670068154564266 0.39350124418016835
-1.3362409534038142 -1.7006072962094394 0.27889813733511915  0.13594944033505418 -0.9506490527046173 0.27889806070390538
-1.3319285691139524 -1.7404306120773461 0.040522281668716881  0.13176921185868179 -0.99044963097837846 0.040575895565416499
-1.3993769697289566 -1.7167958970608925 0.15985780358782289  0.19913925651268646 -0.96680424297825795 0.16010344242024308
-1.7739215462855715 -1.5689102873387162 0  0.57538069819453597 -0.817885342986297 0.00078604920685557502
-1.7539236111976781 -1.5744089525965697 -0.11626913535565191  0.55440616112166052 -0.82389530164822178 -0.11760246779863529
-1.5961011738843633 -1.630767891230487 -0.25952221836449829  0.39599581735923645 -0.88070834559541733 -0.25988482570664473
-1.7157160292432709 -1.5740187342392593 -0.23458495860622131  0.51562318151862419 -0.82387113061171635 -0.23530638500725889
-1.2 -1.7097793820657468 -0.28075529872380584  0.00037212726837937269 -0.95982343558557015 -0.28060440841513695
-1.3362409534038142 -1.7006072962094394 -0.27889813733511915  0.13594944033505682 -0.95064905270461686 -0.27889806070390533
-1.5392409609172168 -1.6123045076538933 -0.37596077789543381  0.33912378489964934 -0.86229745711633832 -0.37608264246842488
-1.4691171673622654 -1.6736940845413726 -0.27269981374065155  0.26880216379452337 -0.92375019852295026 -0.27282039415738757
-1.7400179687989206 -1.5898638505656821 0.054857140713616921  0.53979489236345557 -0.83987858050695907 0.056792994144885221
-1.825781888690033 -1.5299980947332725 0  0.6269431253853317 -0.77906499229253678 0.00023519417927932233
-1.8801807185069523 -1.4551970771451344 -0.20012814034344359  0.6804029951332915 -0.70493504308661814 -0.20029565457621346
-1.9022770253220767 -1.4587176976875214 -0.067277074024322189  0.70276863564903891 -0.70820887911908625 -0.067501320615791519
-1.7237239478373754 -1.3861001815799718 -0.56664784959934411  0.52342942466547437 -0.6360962731305061 -0.56692430597377907
-1.7875076190110728 -1.4217091588743203 -0.45126666560725848  0.5873747039473759 -0.67165289641182291 -0.45152335920120634
-1.9402458861856147 -1.3644698341819119 -0.27287882084494525  0.74028370995146864 -0.61436698850995319 -0.27300775118977999
-1.8406145370870961 -1.444096083320241 -0.32839555720531111  0.64057192708348309 -0.69398384882087072 -0.32871571883365075
-1.6851608280853034 -1.6237674280523331 0.033903577486650918  0.4842737525520891 -0.87419253200451819 0.035585805831078579
-1.7539236111976781 -1.5744089525965697 0.11626913535565191  0.55440616112166141 -0.82389530164822145 0.11760246779863319
-1.9199153070653643 -1.4306397508870434 0.135836225526941  0.72008099426245864 -0.68041269101920343 0.13609530337963519
-1.8245726216782669 -1.5067416602149368 0.19300544019554741  0.62484261256047779 -0.75636980999592529 0.19358827458119593
-2.1168554803037778 -1.143131532466402 -0.069452331980627571  0.9167006815456431 -0.39350124418016769 -0.069401954456726131
-2.0664057563461915 -1.2493406306021804 0  0.86652958223713739 -0.49912569350340974 -0.00015872199696955489
-1.9807681678543316 -1.3394256868089478 0.20731239180326447  0.78085960551688716 -0.58928970592655916 0.207354573040965
-2.0004723406749187 -1.3452985273360616 0.069740197633308881  0.80067536950372709 -0.59503447968929668 0.069662907281837147
-2.0189102873387164 -0.75 0.57392154628557113  0.81788534298629878 0.00078604920685481803 0.57538069819453352
-2.0244089525965694 -0.63373086464434825 0.55392361119767775  0.82413049582749909 0.11774782579538255 0.55402560894563413
-2.0807678912304874 -0.49047778163550187 0.39610117388436322  0.88070834559541789 0.25988482570664423 0.39599581735923545
-2.0240187342392595 -0.51541504139377881 0.51571602924327065  0.82387113061171635 0.23530638500725831 0.5156231815186243
-2.1597793820657469 -0.46924470127619466 0  0.95982343558557015 0.28060440841513684 0.00037212726837914176
-2.1506072962094391 -0.47110186266488102 0.13624095340381404  0.95064905270461686 0.27889806070390538 0.1359494403350571
-2.0623045076538933 -0.37403922210456625 0.33924096091721667  0.86229745711633821 0.37608264246842488 0.33912378489964945
-2.1236940845413725 -0.47730018625934845 0.26911716736226499  0.92375019852295037 0.27282039415738735 0.26880216379452299
-1.2339035774866509 -1.2351608280853033 -0.87376742805233332  0.035585805831079446 -0.48427375255209149 -0.87419253200451685
-1.1281417225076453 -1.187654475842026 -0.8962672300889245  -0.072536964263671705 -0.43642314114700137 -0.89681281808791924
-0.91592045537741096 -1.2103930887008658 -0.84103330267207566  -0.28440717777405644 -0.46019616855581419 -0.84103034646625252
-1.013439003921194 -1.1399876630720454 -0.90172313788306901  -0.18714545413041717 -0.38953622755321937 -0.90179715370027991
-0.67627605216262476 -1.3861001815799718 -0.56664784959934444  -0.52380155193385225 -0.63632626043050522 -0.56632219140540208
-0.74873333439274137 -1.3375076190110722 -0.67170915887432059  -0.45152335920120801 -0.58737470394737301 -0.67165289641182435
-0.79899507473160225 -1.1548073899588973 -0.8217822259851767  -0.40115992505182013 -0.40477696304846295 -0.82172156155091924
-0.82850263027516902 -1.277772526934267 -0.76383628095354994  -0.37176976328896022 -0.52785497534633852 -0.76364675610270671
-0.48008469293463596 -1.4306397508870434 -0.135836225526941  -0.72008099426245697 -0.68041269101920476 -0.13609530337963671
-0.6460763888023221 -1.5744089525965697 -0.11626913535565191  -0.55402560894563335 -0.82413049582749964 -0.11774782579538229
-0.71483917191469648 -1.6237674280523331 -0.033903577486650918  -0.483487703345236 -0.87467833713118348 -0.034313951497560155
-0.43616371904645013 -1.1214973697248312 -0.52777252693426746  -0.76364675610270671 -0.37176976328896022 -0.52785497534633863
-0.28314451969622234 -1.1431315324664022 -0.069452331980627627  -0.91693066884564178 -0.39289912961179069 -0.069774081725102424
-0.24939270379056055 -1.0288981373351189 -0.13624095340381406  -0.95064905270461697 -0.27889806070390527 -0.13594944033505632
-0.37821777401482348 -1.151004925268398 -0.40480738995889742  -0.82172156155092024 -0.40115992505181919 -0.40477696304846206
-0.52829084112567948 -1.2012666656072586 -0.58750761901107273  -0.67149417441485526 -0.45142526361231838 -0.58763152153323139
-0.63335215040065551 -1.2737239478373747 -0.63610018157997217  -0.56632219140540285 -0.52380155193385192 -0.63632626043050466
-0.42000190526672743 -0.75 0.62578188869003293  -0.77906499229253756 0.00023519417927674757 0.6269431253853307
-0.49480292285486549 -0.95012814034344351 0.6801807185069525  -0.70493504308661692 -0.20029565457621212 0.68040299513329316
-0.49128230231247838 -0.81727707402432204 0.7022770253220767  -0.7082088791190847 -0.06750132061579163 0.70276863564904057
-0.56389981842002823 -1.3166478495993443 0.52372394783737519  -0.63632626043050455 -0.56632219140540296 0.52380155193385181
-0.5282908411256797 -1.2012666656072586 0.58750761901107262  -0.67165289641182369 -0.45152335920120656 0.58737470394737479
-0.58553016581808803 -1.0228788208449453 0.74024588618561449  -0.61436698850995364 -0.27300775118977955 0.74028370995146853
-0.50590391667975909 -1.0783955572053112 0.64061453708709626  -0.6939838488208705 -0.32871571883365241 0.64057192708348243
-0.29827686211693072 -0.9365609960788055 -0.38998766307204569  -0.90179715370027946 -0.18714545413041772 -0.38953622755322032
-0.35896669732792441 -1.0340795446225892 -0.46039308870086582  -0.84103034646625285 -0.28440717777405633 -0.46019616855581358
-0.67222747306573261 -1.5138362809535497 -0.37149736972483099  -0.52785497534633774 -0.7636467561027076 -0.37176976328895966
-0.79519261004110253 -1.5717822259851766 -0.40100492526839782  -0.4047769630484625 -0.82172156155092002 -0.40115992505181935
-0.61249238098892722 -1.4217091588743203 -0.45126666560725853  -0.58763152153323051 -0.67149417441485715 -0.45142526361231683
-0.56389981842002801 -1.3166478495993443 -0.5237239478373753  -0.63609627313050687 -0.56692430597377752 -0.52342942466547515
-0.81001233692795449 -1.6517231378830692 -0.18656099607880575  -0.38953622755321782 -0.90179715370028091 -0.18714545413041614
-0.73960691129913414 -1.5910333026720753 -0.28407954462258922  -0.46019616855581497 -0.84103034646625252 -0.28440717777405544
-1.1451428592863835 -1.2900179687989204 0.83986385056568236  -0.056792994144885159 -0.53979489236345424 0.83987858050695985
-1.1281417225076453 -1.187654475842026 0.8962672300889245  -0.072536964263670262 -0.43642314114700137 0.89681281808791935
-1.2397345885584119 -1.0102649483574224 0.96471929550963254  0.039677999129167051 -0.25990051397960068 0.96481986879326098
-1.1222955963561905 -1.0727105890477233 0.94330265629374277  -0.077926023088561697 -0.32203490693742803 0.94351526412634312
-1.5931315324664026 -0.81945233198062728 0.9168554803037775  0.39289912961179108 -0.069774081725103507 0.91693066884564156
-1.4788981373351193 -0.88624095340381404 0.95060729620943918  0.27915487828976276 -0.13610816233202525 0.95055095711572812
-1.2405222816687171 -0.88192856911395234 0.99043061207734606  0.040575895565419198 -0.1317692118586829 0.99044963097837824
-1.3598578035878233 -0.94937696972895613 0.96679589706089242  0.16010344242024468 -0.19913925651268555 0.96680424297825784
-2.0737674280523333 -0.78390357748665085 0.48516082808530303  0.8741925320045173 -0.035585805831078232 0.48427375255209065
-2.0244089525965698 -0.86626913535565175 0.55392361119767775  0.82413049582750142 -0.11774782579538097 0.55402560894563102
-1.8806397508870436 -0.88583622552694086 0.71991530706536389  0.68041269101920565 -0.13609530337963607 0.72008099426245631
-1.9567416602149375 -0.94300544019554744 0.62457262167826655  0.75636980999592573 -0.1935882745811936 0.62484261256047802
-1.5931315324664028 -0.68054766801937228 0.91685548030377739  0.39289912961179124 0.069774081725103868 0.91693066884564145
-1.6993406306021812 -0.75 0.86640575634619155  0.49912569350341046 0.00015872199696907044 0.86652958223713705
-1.7894256868089482 -0.95731239180326466 0.78076816785433145  0.5892897059265586 -0.20735457304096644 0.78085960551688716
-1.7952985273360618 -0.81974019763330874 0.80047234067491868  0.59503447968929735 -0.069662907281837508 0.80067536950372653
-2.0398638505656823 -0.8048571407136168 0.54001796879892006  0.83987858050696018 -0.056792994144883174 0.53979489236345402
-1.9799980947332727 -0.75 0.62578188869003271  0.77906499229253734 -0.00023519417927865213 0.62694312538533092
-1.9051970771451345 -0.54987185965655661 0.68018071850695228  0.70493504308661692 0.20029565457621337 0.68040299513329283
-1.9087176976875218 -0.68272292597567774 0.70227702532207648  0.70820887911908492 0.067501320615790811 0.70276863564904035
-1.836100181579972 -0.183352150400656 0.52372394783737508  0.63632626043050544 0.56632219140540208 0.52380155193385192
-1.8717091588743204 -0.29873333439274163 0.58750761901107262  0.67149417441485515 0.45142526361231761 0.58763152153323228
-1.8144698341819119 -0.47712117915505492 0.74024588618561449  0.61436698850995353 0.27300775118978104 0.74028370995146819
-1.8940960833202412 -0.42160444279468906 0.64061453708709593  0.6939838488208705 0.32871571883365097 0.64057192708348309
-1.7400179687989203 0.089863850565682246 -0.054857140713616907  0.53979489236345624 0.83987858050695852 -0.056792994144884971
-1.8257818886900328 0.02999809473327264 0  0.62694312538533126 0.77906499229253712 -0.00023519417927808962
-1.8801807185069523 -0.044802922854865423 0.20012814034344364  0.68040299513329283 0.70493504308661703 0.20029565457621282
-1.9022770253220767 -0.041282302312478536 0.067277074024322203  0.70276863564903935 0.70820887911908592 0.06750132061579249
-1.7237239478373754 -0.11389981842002828 0.56664784959934422  0.52380155193385225 0.63632626043050444 0.56632219140540274
-1.7875076190110728 -0.078290841125679855 0.45126666560725853  0.58737470394737501 0.67165289641182324 0.4515233592012069
-1.9402458861856147 -0.13553016581808797 0.27287882084494519  0.74028370995146875 0.61436698850995375 0.27300775118977888
-1.8406145370870961 -0.055903916679759136 0.32839555720531111  0.64057192708348287 0.69398384882087016 0.32871571883365219
-1.7739215462855711 0.068910287338716403 0  0.57538069819453486 0.81788534298629789 0.0007860492068549708
-1.7539236111976779 0.074408952596569544 0.11626913535565189  0.55440616112166197 0.82389530164822122 0.11760246779863301
-1.5961011738843633 0.13076789123048704 0.25952221836449818  0.39599581735923656 0.88070834559541755 0.25988482570664356
-1.7157160292432707 0.074018734239259421 0.23458495860622128  0.51562318151862485 0.82387113061171613 0.23530638500725806
-1.2 0.20977938206574664 0.28075529872380572  -0.00037212726837706128 0.95982343558557015 0.28060440841513684
-1.3362409534038142 0.2006072962094394 0.27889813733511909  0.13594944033505521 0.95064905270461708 0.27889806070390538
-1.5392409609172171 0.11230450765389333 0.37596077789543386  0.33912378489964912 0.86229745711633854 0.37608264246842454
-1.4691171673622654 0.17369408454137258 0.27269981374065155  0.26880216379452387 0.92375019852294971 0.27282039415738862
-0.76234552415797374 -1.6462672300889243 -0.071858277492354988  -0.4364231411470012 -0.89681281808791946 -0.072536964263670831
-0.71483917191469648 -1.6237674280523331 0.033903577486650918  -0.48427375255209054 -0.87419253200451741 0.035585805831079363
-2.0004723406749187 -0.15470147266393841 -0.069740197633308881  0.8006753695037262 0.5950344796892979 -0.069662907281837536
-1.9807681678543314 -0.16057431319105175 -0.2073123918032645  0.7808596055168866 0.58928970592655905 -0.20735457304096727
-1.1305476680193725 0.1668554803037775 0.39313153246640242  -0.06977408172510273 0.91693066884564134 0.39289912961179158
-1.0637590465961857 0.2006072962094394 0.27889813733511909  -0.13594944033505751 0.95064905270461653 0.27889806070390633
-1.0680714308860475 0.24043061207734606 0.040522281668716874  -0.13176921185868193 0.99044963097837835 0.040575895565418109
-1.0006230302710435 0.21679589706089242 0.15985780358782284  -0.19913925651268669 0.96680424297825773 0.16010344242024396
-2.0664057563461915 -0.25065936939781941 0  0.86652958223713605 0.49912569350341202 0.00015872199696870571
-2.1168554803037778 -0.35686846753359769 0.069452331980627585  0.91670068154564477 0.39350124418016402 0.069401954456724813
-1.8245726216782669 0.0067416602149371618 -0.19300544019554747  0.62484261256047702 0.7563698099959264 -0.19358827458119424
-1.9199153070653638 -0.069360249112956351 -0.135836225526941  0.72008099426245753 0.68041269101920465 -0.13609530337963582
-1.7539236111976779 0.074408952596569544 -0.11626913535565189  0.55440616112166197 0.82389530164822122 -0.11760246779863306
-1.6851608280853034 0.12376742805233321 -0.033903577486650911  0.48348770334523633 0.87467833713118326 -0.034313951497558191
-2.1667958970608927 -0.59014219641217724 -0.19937696972895622  0.96680424297825762 0.16010344242024313 -0.19913925651268791
-2.1904306120773462 -0.70947771833128304 -0.13192856911395226  0.99044963097837835 0.040575895565418046 -0.13176921185868257
-2.1506072962094391 -0.47110186266488108 -0.13624095340381398  0.95064905270461675 0.27889806070390527 -0.13594944033505743
-2.1168554803037778 -0.35686846753359769 -0.069452331980627585  0.91670068154564477 0.39350124418016419 -0.069401954456724438
-2.1433026562937432 -0.82770440364380959 -0.32271058904772343  0.94351526412634346 -0.077926023088562391 -0.32203490693742681
-2.1647192955096326 -0.71026541144158839 -0.26026494835742214  0.96481986879326176 0.039677999129162957 -0.25990051397959818
-2.0962672300889245 -0.82185827749235496 -0.43765447584202588  0.89681281808791991 -0.072536964263670151 -0.43642314114700054
-2.0398638505656823 -0.80485714071361691 -0.54001796879892028  0.83909253130010364 -0.056307189018218906 -0.54106674669697719
-2.1667958970608927 -0.90985780358782276 0.19937696972895622  0.96680424297825762 -0.16010344242024344 0.19913925651268785
-2.1904306120773462 -0.79052228166871696 0.13192856911395226  0.99044963097837835 -0.040575895565418012 0.13176921185868262
-2.1506072962094391 -1.0288981373351189 0.13624095340381398  0.95055095711572801 -0.27915487828976321 0.13610816233202536
-2.1168554803037778 -1.1431315324664022 0.069452331980627571  0.91693066884564189 -0.39289912961178991 0.069774081725105158
-0.51936024911295664 -0.61416377447305892 0.71991530706536411  -0.68041269101920498 0.13609530337963713 0.72008099426245675
-2.1433026562937432 -0.67229559635619029 0.32271058904772337  0.94351526412634346 0.077926023088562182 0.32203490693742687
-0.80686846753359798 -0.81945233198062761 0.91685548030377773  -0.39289912961179085 -0.069774081725103729 0.91693066884564167
-0.70065936939781936 -0.75 0.86640575634619177  -0.49912569350340996 -0.00015872199696909822 0.86652958223713739
-0.61057431319105182 -0.54268760819673534 0.78076816785433145  -0.58928970592655938 0.20735457304096697 0.78085960551688649
-0.60470147266393859 -0.68025980236669126 0.80047234067491901  -0.5950344796892979 0.069662907281838118 0.80067536950372609
-1.2000000000000002 -1.3239215462855713 0.81891028733871629  -0.00078604920685584922 -0.57538069819453419 0.81788534298629834
-1.0837308646443482 -1.3039236111976777 0.82440895259656966  -0.11774782579538229 -0.5540256089456338 0.82413049582749931
-0.94047778163550211 -1.1461011738843636 0.88076789123048704  -0.2598848257066434 -0.39599581735923645 0.88070834559541777
-0.96541504139377909 -1.265716029243271 0.82401873423925931  -0.23530638500725753 -0.51562318151862452 0.82387113061171646
-0.91924470127619462 -0.75 0.95977938206574676  -0.2806044084151364 0.00037212726837861895 0.95982343558557026
-0.92110186266488114 -0.88624095340381404 0.9506072962094394  -0.27889806070390472 -0.13594944033505674 0.95064905270461708
-0.82403922210456648 -1.0892409609172171 0.86230450765389366  -0.37608264246842471 -0.33912378489964967 0.86229745711633832
-0.92730018625934885 -1.0191171673622652 0.92369408454137281  -0.27282039415738757 -0.26880216379452404 0.92375019852295004
-2.0737674280523333 -0.71609642251334893 -0.48516082808530336  0.87419253200451652 0.035585805831079086 -0.48427375255209221
-2.0244089525965694 -0.63373086464434825 -0.55392361119767775  0.82389530164822156 0.11760246779863381 -0.55440616112166108
-1.8806397508870436 -0.61416377447305903 -0.71991530706536389  0.68041269101920465 0.13609530337963732 -0.72008099426245709
-1.9567416602149375 -0.55699455980445267 -0.62457262167826666  0.75636980999592685 0.19358827458119476 -0.62484261256047624
-1.5931315324664026 -0.81945233198062717 -0.9168554803037775  0.39350124418016752 -0.069401954456724702 -0.91670068154564333
-1.699340630602181 -0.74999999999999989 -0.86640575634619155  0.49912569350341046 -0.00015872199696832719 -0.86652958223713705
-1.7894256868089482 -0.54268760819673534 -0.78076816785433145  0.58928970592655949 0.20735457304096749 -0.78085960551688616
-1.7952985273360618 -0.68025980236669115 -0.80047234067491868  0.59503447968929746 0.069662907281837702 -0.80067536950372653
-1.2 -1.3239215462855713 -0.81891028733871629  -0.00078604920685687162 -0.57538069819453419 -0.81788534298629822
-1.3162691353556519 -1.3039236111976777 -0.82440895259656966  0.11760246779863413 -0.55440616112166108 -0.82389530164822145
-1.459522218364498 -1.1461011738843632 -0.88076789123048704  0.25988482570664329 -0.39599581735923417 -0.88070834559541877
-1.4345849586062212 -1.265716029243271 -0.82401873423925931  0.23530638500725776 -0.51562318151862274 -0.82387113061171746
-1.4807552987238062 -0.74999999999999989 -0.95977938206574653  0.28060440841513745 -0.00037212726837840537 -0.95982343558556993
-1.4788981373351193 -0.88624095340381381 -0.95060729620943918  0.27889806070390516 -0.1359494403350556 -0.95064905270461719
-1.5759607778954343 -1.0892409609172169 -0.86230450765389333  0.3760826424684246 -0.33912378489964767 -0.86229745711633909
-1.4726998137406517 -1.019117167362265 -0.9236940845413727  0.27282039415738774 -0.26880216379452249 -0.92375019852295048
-1.2548571407136171 -1.2900179687989204 -0.83986385056568236  0.056307189018218885 -0.5410667466969763 -0.83909253130010431
-1.2718582774923548 -1.187654475842026 -0.8962672300889245  0.0725369642636709 -0.43642314114700093 -0.89681281808791957
-1.1602654114415887 -1.0102649483574224 -0.96471929550963276  -0.039677999129165718 -0.25990051397960168 -0.96481986879326076
-1.2777044036438097 -1.0727105890477233 -0.94330265629374277  0.077926023088563307 -0.32203490693742792 -0.94351526412634301
-0.80686846753359776 -0.81945233198062728 -0.91685548030377773  -0.39289912961179035 -0.069774081725102216 -0.91693066884564189
-0.92110186266488103 -0.88624095340381381 -0.95060729620943951  -0.27889806070390549 -0.13594944033505704 -0.95064905270461686
-1.1594777183312832 -0.88192856911395234 -0.99043061207734606  -0.040575895565417859 -0.1317692118586819 -0.99044963097837846
-1.0401421964121771 -0.94937696972895624 -0.96679589706089264  -0.16010344242024305 -0.19913925651268694 -0.96680424297825784
-2.1647192955096326 -0.78973458855841161 0.26026494835742214  0.96481986879326176 -0.039677999129162901 0.25990051397959829
-0.37559104740343041 -0.86626913535565175 -0.55392361119767775  -0.82389530164822289 -0.1176024677986328 -0.55440616112165941
-0.51936024911295653 -0.88583622552694086 -0.719915307065364  -0.68041269101920487 -0.13609530337963638 -0.72008099426245697
-0.44325833978506268 -0.94300544019554755 -0.62457262167826677  -0.75636980999592562 -0.19358827458119629 -0.62484261256047735
-0.80686846753359776 -0.68054766801937217 -0.91685548030377773  -0.39289912961179091 0.069774081725102133 -0.91693066884564167
-0.70065936939781936 -0.75 -0.86640575634619177  -0.49912569350340996 0.00015872199696907044 -0.86652958223713739
-0.61057431319105182 -0.95731239180326444 -0.78076816785433145  -0.58928970592655927 -0.2073545730409663 -0.78085960551688671
-0.60470147266393859 -0.81974019763330874 -0.80047234067491901  -0.59503447968929835 -0.069662907281838424 -0.80067536950372575
-0.3601361494343176 -0.80485714071361691 -0.54001796879892028  -0.83909253130010897 -0.056307189018239993 -0.54106674669696686
-0.4200019052667272 -0.75 -0.62578188869003293  -0.77906499229253467 -0.00023519417927469891 -0.62694312538533437
-0.49480292285486549 -0.54987185965655649 -0.6801807185069525  -0.70493504308661692 0.20029565457621065 -0.68040299513329361
-0.49128230231247838 -0.68272292597567774 -0.70227702532207659  -0.70820887911908548 0.067501320615790991 -0.7027686356490398
-2.0962672300889245 -0.67814172250764504 0.43765447584202566  0.89666746009116949 0.072917516439697627 0.43665833532627929
-2.0398638505656823 -0.6951428592863832 0.54001796879892017  0.83987858050695907 0.056792994144885436 0.53979489236345557
-0.58553016581808792 -0.47712117915505486 -0.7402458861856146  -0.61436698850995408 0.27300775118977949 -0.74028370995146819
-2.1236940845413725 -1.0226998137406516 -0.26911716736226488  0.92375019852295071 -0.27282039415738712 -0.26880216379452199
-2.0623045076538933 -1.1259607778954337 -0.33924096091721667  0.86229745711633943 -0.37608264246842327 -0.33912378489964806
-2.1506072962094396 -1.0288981373351187 -0.13624095340381401  0.95064905270461664 -0.27889806070390494 -0.13594944033505915
-2.1597793820657469 -1.0307552987238053 0  0.95982343558557071 -0.28060440841513484 -0.00037212726837866411
-2.0240187342392595 -0.98458495860622119 -0.51571602924327065  0.82387113061171613 -0.23530638500725942 -0.51562318151862419
-2.0807678912304874 -1.0095222183644981 -0.39610117388436322  0.88070834559541744 -0.2598848257066434 -0.39599581735923706
-2.0244089525965694 -0.86626913535565175 -0.55392361119767775  0.82413049582749875 -0.11774782579538295 -0.55402560894563468
-2.0189102873387164 -0.75 -0.57392154628557124  0.81788534298629945 0.00078604920685597238 -0.57538069819453252
-1.8940960833202412 -1.078395557205311 -0.64061453708709593  0.69398384882087005 -0.32871571883365164 -0.64057192708348332
-1.8144698341819119 -1.0228788208449451 -0.74024588618561449  0.61436698850995386 -0.2730077511897796 -0.74028370995146842
-1.8717091588743204 -1.2012666656072586 -0.58750761901107251  0.6716528964118238 -0.45152335920120762 -0.58737470394737379
-1.836100181579972 -1.3166478495993443 -0.52372394783737497  0.636326260430505 -0.56632219140540241 -0.52380155193385214
-1.9087176976875218 -0.81727707402432193 -0.70227702532207648  0.70820887911908503 -0.067501320615790811 -0.70276863564904013
-1.2000000000000002 0.20977938206574664 -0.28075529872380572  -0.00037212726837724538 0.95982343558557015 -0.2806044084151369
-1.0637590465961864 0.20060729620943951 -0.27889813733511915  -0.13610816233202511 0.95055095711572812 -0.27915487828976282
-1.9051970771451345 -0.95012814034344339 -0.68018071850695228  0.70493504308661625 -0.20029565457621284 -0.68040299513329372
-1.9799980947332727 -0.75 -0.62578188869003293  0.77906499229253701 0.00023519417927673019 -0.62694312538533126
-1.7400179687989203 0.089863850565682246 0.054857140713616907  0.53979489236345635 0.83987858050695852 0.056792994144884965
-1.6376544758420262 0.14626723008892439 0.071858277492354961  0.43665833532627735 0.89666746009117038 0.072917516439697488
-1.4602649483574224 0.21471929550963276 -0.039734588558411575  0.25990051397960162 0.96481986879326076 -0.039677999129164421
-1.5227105890477235 0.19330265629374277 0.077704403643809677  0.32203490693742948 0.94351526412634246 0.077926023088562682
-1.2694523319806277 0.1668554803037775 -0.39313153246640242  0.069774081725103854 0.91693066884564201 -0.39289912961179002
-1.3362409534038142 0.2006072962094394 -0.27889813733511909  0.13610816233202411 0.95055095711572823 -0.27915487828976299
-1.3319285691139524 0.24043061207734606 -0.040522281668716874  0.13176921185868176 0.99044963097837846 -0.040575895565417866
-1.3993769697289566 0.21679589706089242 -0.15985780358782284  0.19913925651268685 0.96680424297825795 -0.16010344242024246
-1.6851608280853034 0.12376742805233321 0.033903577486650911  0.48348770334523639 0.87467833713118326 0.034313951497558191
-1.6376544758420262 0.14626723008892439 -0.071858277492354961  0.43665833532627735 0.89666746009117038 -0.07291751643969753
-1.660393088700866 0.091033302672075544 -0.28407954462258922  0.46019616855581369 0.84103034646625308 -0.28440717777405566
-1.589987663072046 0.1517231378830689 -0.18656099607880569  0.38953622755322015 0.9017971537002798 -0.18714545413041636
-1.836100181579972 -0.18335215040065589 -0.52372394783737497  0.63609627313050576 0.56692430597378096 -0.52342942466547271
-1.7875076190110728 -0.078290841125679744 -0.45126666560725848  0.58737470394737512 0.67165289641182313 -0.45152335920120712
-1.6048073899588975 0.071782225985176584 -0.40100492526839776  0.40477696304846272 0.82172156155091969 -0.40115992505181969
-1.7277725269342676 0.013836280953549718 -0.37149736972483094  0.52785497534633818 0.76364675610270738 -0.37176976328895917
-2.0737674280523333 -0.78390357748665085 -0.48516082808530336  0.87419253200451652 -0.035585805831079016 -0.48427375255209226
-2.0962672300889245 -0.67814172250764504 -0.43765447584202588  0.89681281808791979 0.072536964263669845 -0.4364231411470007
-2.0410333026720755 -0.46592045537741078 -0.46039308870086587  0.84103034646625241 0.28440717777405677 -0.46019616855581419
-2.1017231378830692 -0.56343900392119417 -0.38998766307204574  0.90179715370028046 0.1871454541304188 -0.38953622755321771
-1.7666478495993445 -0.22627605216262503 -0.63610018157997172  0.56692430597377896 0.52342942466547504 -0.63609627313050565
-1.8717091588743204 -0.29873333439274152 -0.58750761901107251  0.67165289641182369 0.45152335920120729 -0.58737470394737423
-2.0217822259851763 -0.34899507473160229 -0.40480738995889737  0.82172156155091947 0.40115992505182074 -0.404776963048462
-1.9638362809535499 -0.37850263027516906 -0.52777252693426713  0.7636467561027066 0.37176976328896016 -0.52785497534633874
-2.0737674280523333 -0.71609642251334915 0.48516082808530303  0.87419253200451741 0.035585805831078149 0.48427375255209065
-2.0962672300889245 -0.82185827749235496 0.43765447584202566  0.89666746009117027 -0.072917516439695754 0.43665833532627807
-2.0410333026720755 -1.034079544622589 0.46039308870086554  0.84103034646625197 -0.28440717777405777 0.46019616855581447
-2.1017231378830692 -0.93656099607880539 0.38998766307204547  0.90179715370028091 -0.18714545413041644 0.38953622755321782
-1.7666478495993445 -1.2737239478373752 0.63610018157997172  0.5669243059737803 -0.52342942466547338 0.63609627313050576
-1.8717091588743204 -1.2012666656072584 0.58750761901107251  0.67165289641182291 -0.45152335920120612 0.58737470394737612
-2.0217822259851768 -1.1510049252683978 0.40480738995889709  0.82172156155092002 -0.40115992505181952 0.40477696304846211
-1.9638362809535499 -1.1214973697248305 0.52777252693426713  0.76364675610270771 -0.37176976328895944 0.52785497534633763
-1.1660964225133497 -1.2351608280853033 0.87376742805233332  -0.034313951497557262 -0.48348770334523594 0.87467833713118348
-1.271858277492355 -1.187654475842026 0.8962672300889245  0.072536964263671441 -0.43642314114700143 0.89681281808791935
-1.4840795446225896 -1.2103930887008656 0.84103330267207554  0.28440717777405727 -0.46019616855581419 0.8410303464662523
-1.3865609960788059 -1.1399876630720458 0.90172313788306901  0.18714545413041747 -0.38953622755322043 0.90179715370027946
-1.7237239478373758 -1.3861001815799714 0.56664784959934411  0.52380155193385347 -0.63632626043050511 0.56632219140540108
-1.6512666656072592 -1.3375076190110724 0.67170915887432014  0.45142526361231949 -0.58763152153323339 0.67149417441485293
-1.6010049252683982 -1.1548073899588975 0.82178222598517625  0.4011599250518203 -0.40477696304846233 0.82172156155091958
-1.5714973697248313 -1.2777725269342672 0.76383628095354972  0.37176976328896133 -0.52785497534633863 0.76364675610270605
-1.2339035774866509 -1.2351608280853033 0.87376742805233332  0.034313951497557206 -0.48348770334523589 0.87467833713118359
-1.3162691353556522 -1.3039236111976777 0.82440895259656966  0.11760246779863334 -0.55440616112166041 0.82389530164822211
-1.3358362255269416 -1.4699153070653641 0.6806397508870432  0.13609530337963804 -0.72008099426245653 0.68041269101920498
-1.3930054401955481 -1.3745726216782668 0.75674166021493705  0.19358827458119501 -0.62484261256047813 0.75636980999592529
-1.1305476680193727 -1.6668554803037776 0.39313153246640242  -0.069401954456726395 -0.91670068154564333 0.39350124418016702
-1.2000000000000002 -1.6164057563461918 0.49934063060218076  -0.00015872199696771765 -0.86652958223713639 0.49912569350341157
-1.4073123918032651 -1.5307681678543312 0.58942568680894813  0.2073545730409686 -0.7808596055168856 0.58928970592656005
-1.2697401976333094 -1.5504723406749188 0.59529852733606148  0.069662907281836758 -0.80067536950372586 0.59503447968929868
-0.6260784537144285 -1.5689102873387162 0  -0.57538069819453641 -0.81788534298629689 -0.00078604920685377297
-0.6460763888023221 -1.5744089525965697 0.11626913535565191  -0.5544061611216603 -0.82389530164822222 0.11760246779863313
-0.80389882611563657 -1.6307678912304873 0.25952221836449835  -0.39599581735923506 -0.88070834559541866 0.2598848257066424
-0.68428397075672898 -1.5740187342392593 0.23458495860622131  -0.51562318151862396 -0.82387113061171635 0.23530638500725892
-1.2000000000000002 -1.7097793820657468 0.28075529872380584  0.00037212726838103456 -0.95982343558557015 0.28060440841513695
-1.0637590465961864 -1.7006072962094394 0.27889813733511915  -0.13610816233202563 -0.9505509571157279 0.27915487828976338
-0.86075903908278317 -1.6123045076538935 0.37596077789543386  -0.33912378489964695 -0.86229745711633898 0.37608264246842565
-0.93088283263773475 -1.6736940845413728 0.27269981374065155  -0.26880216379452304 -0.92375019852295015 0.27282039415738846
-0.65998203120107946 -1.5898638505656821 0.054857140713616928  -0.54106674669697674 -0.83909253130010408 0.056307189018219461
-0.76234552415797396 -1.6462672300889245 0.071858277492355002  -0.4366583353262804 -0.89666746009116904 0.072917516439697044
-0.93973505164257753 -1.7147192955096329 -0.039734588558411603  -0.2599005139796024 -0.96481986879326065 -0.039677999129164185
-0.87728941095227664 -1.693302656293743 0.077704403643809719  -0.32203490693742809 -0.94351526412634312 0.07792602308856135
-1.1305476680193722 -1.6668554803037776 -0.39313153246640242  -0.069774081725105006 -0.91693066884564212 -0.39289912961178936
-1.0637590465961859 -1.7006072962094394 -0.27889813733511915  -0.13610816233202414 -0.95055095711572779 -0.27915487828976443
-1.0680714308860475 -1.7404306120773461 -0.040522281668716881  -0.13176921185868193 -0.99044963097837846 -0.040575895565416728
-1.0006230302710439 -1.7167958970608925 -0.15985780358782292  -0.19913925651268571 -0.96680424297825773 -0.16010344242024524
-1.166096422513349 -1.2351608280853033 -0.87376742805233332  -0.034313951497557192 -0.48348770334523589 -0.87467833713118359
-1.0837308646443482 -1.3039236111976777 -0.82440895259656966  -0.11774782579538288 -0.55402560894563435 -0.82413049582749887
-1.0641637744730592 -1.4699153070653641 -0.68063975088704365  -0.13609530337963588 -0.7200809942624562 -0.68041269101920587
-1.0069945598044525 -1.3745726216782668 -0.75674166021493716  -0.19358827458119413 -0.62484261256047724 -0.75636980999592618
-1.2694523319806275 -1.6668554803037776 -0.39313153246640242  0.069774081725106324 -0.91693066884564201 -0.39289912961178947
-1.2 -1.6164057563461918 -0.49934063060218087  0.00015872199696760825 -0.86652958223713628 -0.49912569350341174
-0.9926876081967354 -1.5307681678543315 -0.58942568680894825  -0.20735457304096702 -0.78085960551688705 -0.5892897059265586
-1.1302598023666912 -1.5504723406749188 -0.59529852733606148  -0.069662907281836037 -0.80067536950372686 -0.59503447968929735
-1.1451428592863828 -1.2900179687989204 -0.83986385056568236  -0.056307189018218629 -0.54106674669697741 -0.83909253130010353
-1.2 -1.3757818886900326 -0.77999809473327286  -0.0002351941792788813 -0.62694312538533137 -0.77906499229253701
-1.4001281403434434 -1.4301807185069526 -0.70519707714513435  0.20029565457621062 -0.68040299513329361 -0.70493504308661703
-1.2672770740243218 -1.4522770253220765 -0.70871769768752158  0.067501320615791338 -0.70276863564903924 -0.70820887911908592
-1.7666478495993443 -1.2737239478373752 -0.63610018157997172  0.56692430597377852 -0.52342942466547515 -0.63609627313050587
-1.6512666656072588 -1.3375076190110726 -0.67170915887432026  0.45142526361231833 -0.58763152153323217 -0.67149417441485471
-1.4728788208449453 -1.4902458861856145 -0.61446983418191203  0.27300775118977799 -0.74028370995146908 -0.61436698850995364
-1.5283955572053114 -1.3906145370870959 -0.69409608332024075  0.32871571883365241 -0.64057192708348276 -0.69398384882087027
-2.0398638505656823 -0.69514285928638297 -0.54001796879892028  0.83987858050695918 0.056792994144885568 -0.53979489236345535
-3  834 294 812
-3  836 296 813
-3  838 298 814
-3  840 300 815
-3  832 292 816
-3  844 304 817
-3  846 306 818
-3  848 308 819
-3  850 310 820
-3  842 302 821
-3  854 314 822
-3  856 316 823
-3  858 318 824
-3  860 320 825
-3  852 312 826
-3  835 295 827
-3  845 305 828
-3  1127 922 120
-3  841 301 830
-3  923 1358 924
-3  816 276 832
-3  853 313 833
-3  812 272 834
-3  827 287 835
-3  813 273 836
-3  849 309 837
-3  1324 838 449
-3  1358 925 60
-3  815 275 840
-3  830 290 841
-3  821 281 842
-3  859 319 843
-3  817 277 844
-3  828 288 845
-3  818 278 846
-3  719 1111 1110
-3  819 1183 1181
-3  837 297 849
-3  820 280 850
-3  863 323 851
-3  826 286 852
-3  833 293 853
-3  822 282 854
-3  869 329 855
-3  823 283 856
-3  864 324 857
-3  824 284 858
-3  843 303 859
-3  825 285 860
-3  862 322 861
-3  861 321 862
-3  851 311 863
-3  857 317 864
-3  866 326 865
-3  865 325 866
-3  868 328 867
-3  867 327 868
-3  855 315 869
-3  819 1184 1183
-3  2226 1212 1191
-3  875 335 872
-3  880 340 873
-3  877 337 874
-3  872 332 875
-3  879 339 876
-3  874 334 877
-3  881 341 878
-3  876 336 879
-3  873 333 880
-3  878 338 881
-3  885 345 882
-3  890 350 883
-3  887 347 884
-3  882 342 885
-3  889 349 886
-3  884 344 887
-3  891 351 888
-3  886 346 889
-3  883 343 890
-3  888 348 891
-3  895 355 892
-3  900 360 893
-3  897 357 894
-3  892 352 895
-3  899 359 896
-3  894 354 897
-3  901 361 898
-3  896 356 899
-3  893 353 900
-3  898 358 901
-3  917 377 902
-3  970 430 903
-3  937 397 904
-3  962 422 905
-3  508 1223 1218
-3  1219 1224 1582
-3  929 389 908
-3  982 442 909
-3  989 450 1004
-3  1947 1253 942
-3  931 391 912
-3  954 414 913
-3  953 413 914
-3  916 376 915
-3  915 375 916
-3  902 362 917
-3  975 435 918
-3  920 380 919
-3  919 379 920
-3  946 406 921
-3  120 1334 1827
-3  1324 1345 838
-3  838 1345 944
-3  1049 2093 1390
-3  1347 1391 1819
-3  2104 1469 1244
-3  367 1470 2104
-3  908 368 929
-3  987 447 930
-3  912 372 931
-3  951 411 932
-3  966 426 933
-3  965 425 934
-3  936 396 935
-3  935 395 936
-3  904 364 937
-3  979 439 938
-3  940 400 939
-3  939 399 940
-3  1367 1471 1423
-3  505 1548 988
-3  1188 1550 1783
-3  505 1579 1548
-3  1110 1585 719
-3  921 381 946
-3  948 408 947
-3  947 407 948
-3  974 434 949
-3  973 433 950
-3  932 392 951
-3  971 431 952
-3  914 374 953
-3  913 373 954
-3  956 416 955
-3  955 415 956
-3  986 446 957
-3  985 445 958
-3  960 420 959
-3  959 419 960
-3  976 436 961
-3  905 365 962
-3  964 424 963
-3  963 423 964
-3  934 394 965
-3  933 393 966
-3  968 428 967
-3  967 427 968
-3  972 432 969
-3  903 363 970
-3  952 412 971
-3  969 429 972
-3  950 410 973
-3  949 409 974
-3  918 378 975
-3  961 421 976
-3  980 440 977
-3  1422 367 978
-3  938 398 979
-3  977 437 980
-3  984 444 981
-3  909 369 982
-3  1721 450 989
-3  981 441 984
-3  958 418 985
-3  957 417 986
-3  930 390 987
-3  1574 1425 603
-3  1249 1333 1613
-3  1858 1614 794
-3  2224 1615 1783
-3  1203 663 992
-3  1118 578 993
-3  1211 671 994
-3  1122 582 995
-3  1782 1346 808
-3  1578 1618 1344
-3  1227 687 998
-3  1130 590 999
-3  1195 655 1000
-3  1114 574 1001
-3  1243 703 1002
-3  1138 598 1003
-3  1244 1549 704
-3  1142 602 1005
-3  1259 719 1006
-3  1146 606 1007
-3  1267 727 1008
-3  1150 610 1009
-3  1235 695 1010
-3  1134 594 1011
-3  1283 743 1012
-3  1158 618 1013
-3  1291 751 1014
-3  1162 622 1015
-3  1299 759 1016
-3  1166 626 1017
-3  1307 767 1018
-3  1170 630 1019
-3  1275 735 1020
-3  1154 614 1021
-3  1207 667 1022
-3  1202 662 1023
-3  1247 707 1024
-3  1242 702 1025
-3  602 1190 1189
-3  1333 1349 1709
-3  1231 691 1028
-3  1226 686 1029
-3  1213 98 1711
-3  1109 367 1422
-3  1131 591 1032
-3  1230 690 1033
-3  1279 739 1034
-3  1274 734 1035
-3  1115 575 1036
-3  1198 658 1037
-3  1175 635 1038
-3  1318 778 1039
-3  1119 579 1040
-3  1206 666 1041
-3  1263 723 1042
-3  1258 718 1043
-3  1123 583 1044
-3  1214 674 1045
-3  1710 1142 1736
-3  2230 1737 1365
-3  1127 587 1048
-3  1827 6 10
-3  1187 647 1050
-3  1342 802 1051
-3  1151 611 1052
-3  1270 730 1053
-3  1303 763 1054
-3  1298 758 1055
-3  1135 595 1056
-3  1238 698 1057
-3  1179 639 1058
-3  1326 786 1059
-3  1139 599 1060
-3  1246 706 1061
-3  1827 10 924
-3  1827 1334 6
-3  1610 603 451
-3  922 11 120
-3  1215 675 1066
-3  1210 670 1067
-3  1147 607 1068
-3  1262 722 1069
-3  1319 779 1070
-3  1314 774 1071
-3  1171 631 1072
-3  1310 770 1073
-3  1199 659 1074
-3  1194 654 1075
-3  1155 615 1076
-3  1278 738 1077
-3  1343 803 1078
-3  1338 798 1079
-3  1159 619 1080
-3  1286 746 1081
-3  1323 783 1082
-3  1178 638 1083
-3  1163 623 1084
-3  1294 754 1085
-3  1239 699 1086
-3  1234 694 1087
-3  1167 627 1088
-3  1302 762 1089
-3  1315 775 1090
-3  1174 634 1091
-3  1311 771 1092
-3  1306 766 1093
-3  1271 731 1094
-3  1266 726 1095
-3  1295 755 1096
-3  1290 750 1097
-3  1331 791 1098
-3  1182 642 1099
-3  1327 787 1100
-3  1322 782 1101
-3  1339 799 1102
-3  1186 646 1103
-3  1335 795 1104
-3  1330 790 1105
-3  1287 747 1106
-3  1282 742 1107
-3  11 15 120
-3  15 943 120
-3  923 19 1358
-3  19 31 1358
-3  1117 577 1112
-3  1128 588 1113
-3  1001 461 1114
-3  1036 496 1115
-3  1121 581 1116
-3  1112 572 1117
-3  993 453 1118
-3  1040 500 1119
-3  1125 585 1120
-3  1116 576 1121
-3  995 455 1122
-3  1044 504 1123
-3  1129 589 1124
-3  1120 580 1125
-3  941 457 206
-3  1048 508 1127
-3  1113 573 1128
-3  1124 584 1129
-3  999 459 1130
-3  1032 492 1131
-3  1137 597 1132
-3  1148 608 1133
-3  1011 471 1134
-3  1056 516 1135
-3  1141 601 1136
-3  1132 592 1137
-3  1003 463 1138
-3  1060 520 1139
-3  1145 605 1140
-3  1136 596 1141
-3  1005 465 1142
-3  31 925 1358
-3  1149 609 1144
-3  1140 600 1145
-3  1007 467 1146
-3  1068 528 1147
-3  1133 593 1148
-3  1144 604 1149
-3  1009 469 1150
-3  1052 512 1151
-3  1157 617 1152
-3  1168 628 1153
-3  1021 481 1154
-3  1076 536 1155
-3  1161 621 1156
-3  1152 612 1157
-3  1013 473 1158
-3  1080 540 1159
-3  1165 625 1160
-3  1156 616 1161
-3  1015 475 1162
-3  1084 544 1163
-3  1169 629 1164
-3  1160 620 1165
-3  1017 477 1166
-3  1088 548 1167
-3  1153 613 1168
-3  1164 624 1169
-3  1019 479 1170
-3  1072 532 1171
-3  1201 661 1172
-3  1308 768 1173
-3  1091 551 1174
-3  1038 498 1175
-3  1241 701 1176
-3  1292 752 1177
-3  1083 543 1178
-3  1058 518 1179
-3  49 60 926
-3  60 1220 1582
-3  1099 559 1182
-3  51 1045 203
-3  1366 1225 685
-3  1332 792 1185
-3  1103 563 1186
-3  1050 510 1187
-3  991 1045 51
-3  58 203 2159
-3  2159 1027 58
-3  794 59 1031
-3  1229 689 1192
-3  1276 736 1193
-3  1075 535 1194
-3  1000 460 1195
-3  1273 733 1196
-3  1200 660 1197
-3  1037 497 1198
-3  1074 534 1199
-3  1197 657 1200
-3  1172 632 1201
-3  1023 483 1202
-3  992 452 1203
-3  1317 777 1204
-3  1208 668 1205
-3  1041 501 1206
-3  1022 482 1207
-3  1205 665 1208
-3  1260 720 1209
-3  1067 527 1210
-3  994 454 1211
-3  794 1614 59
-3  67 1859 1357
-3  1045 505 1214
-3  1066 526 1215
-3  1251 1859 67
-3  1356 68 1814
-3  68 1387 1814
-3  1047 90 570
-3  90 1390 570
-3  928 457 1221
-3  1406 91 225
-3  91 1062 1619
-3  91 1619 225
-3  1065 94 978
-3  1029 489 1226
-3  998 458 1227
-3  1341 801 1228
-3  1192 652 1229
-3  1033 493 1230
-3  1028 488 1231
-3  1269 729 1232
-3  1300 760 1233
-3  1087 547 1234
-3  1010 470 1235
-3  1297 757 1236
-3  1240 700 1237
-3  1057 517 1238
-3  1086 546 1239
-3  1237 697 1240
-3  1176 636 1241
-3  1025 485 1242
-3  1002 462 1243
-3  1325 785 1244
-3  1248 708 1245
-3  1061 521 1246
-3  1024 484 1247
-3  1245 705 1248
-3  94 1422 978
-3  109 2097 1255
-3  1254 2097 109
-3  111 1723 119
-3  119 1723 838
-3  838 944 119
-3  704 127 1540
-3  704 1549 127
-3  2224 128 151
-3  1043 503 1258
-3  1006 466 1259
-3  1209 669 1260
-3  1264 724 1261
-3  1069 529 1262
-3  1042 502 1263
-3  1261 721 1264
-3  1316 776 1265
-3  1095 555 1266
-3  1008 468 1267
-3  1313 773 1268
-3  1232 692 1269
-3  1053 513 1270
-3  1094 554 1271
-3  1309 769 1272
-3  1196 656 1273
-3  1035 495 1274
-3  1020 480 1275
-3  1193 653 1276
-3  1280 740 1277
-3  1077 537 1278
-3  1034 494 1279
-3  1277 737 1280
-3  1340 800 1281
-3  1107 567 1282
-3  1012 472 1283
-3  1337 797 1284
-3  1288 748 1285
-3  1081 541 1286
-3  1106 566 1287
-3  1285 745 1288
-3  1320 780 1289
-3  1097 557 1290
-3  1014 474 1291
-3  1177 637 1292
-3  1296 756 1293
-3  1085 545 1294
-3  1096 556 1295
-3  1293 753 1296
-3  1236 696 1297
-3  1055 515 1298
-3  1016 476 1299
-3  1233 693 1300
-3  1304 764 1301
-3  1089 549 1302
-3  1054 514 1303
-3  1301 761 1304
-3  1312 772 1305
-3  1093 553 1306
-3  1018 478 1307
-3  1173 633 1308
-3  1272 732 1309
-3  1073 533 1310
-3  1092 552 1311
-3  1305 765 1312
-3  1268 728 1313
-3  1071 531 1314
-3  1090 550 1315
-3  1265 725 1316
-3  1204 664 1317
-3  1039 499 1318
-3  1070 530 1319
-3  1289 749 1320
-3  1328 788 1321
-3  1101 561 1322
-3  1082 542 1323
-3  2224 150 128
-3  1244 704 1325
-3  1059 519 1326
-3  1100 560 1327
-3  1321 781 1328
-3  1336 796 1329
-3  1105 565 1330
-3  1098 558 1331
-3  1185 645 1332
-3  1348 808 1333
-3  2224 151 1541
-3  1104 564 1335
-3  1329 789 1336
-3  1284 744 1337
-3  1079 539 1338
-3  1102 562 1339
-3  1281 741 1340
-3  1228 688 1341
-3  1051 511 1342
-3  1078 538 1343
-3  2224 1573 150
-3  190 186 2226
-3  186 1705 2226
-3  1191 190 2226
-3  1333 793 1348
-3  704 1573 2224
-3  1981 191 1217
-3  1981 1222 191
-3  1803 497 1352
-3  2134 663 1353
-3  1811 501 1354
-3  2150 671 1355
-3  1347 1819 715
-3  202 508 1981
-3  924 1358 1827
-3  2182 687 1359
-3  1795 493 1360
-3  2118 655 1361
-3  1843 517 1362
-3  2214 703 1363
-3  1851 521 1364
-3  1737 2230 1707
-3  204 1981 1217
-3  1981 204 202
-3  1867 529 1368
-3  2262 727 1369
-3  1835 513 1370
-3  2198 695 1371
-3  1883 537 1372
-3  2294 743 1373
-3  1891 541 1374
-3  2310 751 1375
-3  1899 545 1376
-3  2326 759 1377
-3  1907 549 1378
-3  2232 767 1379
-3  1875 533 1380
-3  2278 735 1381
-3  1807 499 1382
-3  2142 667 1383
-3  1847 519 1384
-3  2222 707 1385
-3  205 685 1582
-3  1582 1224 205
-3  1831 511 1388
-3  2190 691 1389
-3  206 457 928
-3  457 941 997
-3  1731 461 1392
-3  1990 591 1393
-3  1879 535 1394
-3  2286 739 1395
-3  1715 453 1396
-3  1958 575 1397
-3  1775 483 1398
-3  2078 635 1399
-3  1719 455 1400
-3  1966 579 1401
-3  1863 527 1402
-3  2254 723 1403
-3  1723 457 1404
-3  1974 583 1405
-3  263 207 1351
-3  263 1611 207
-3  1727 459 1408
-3  1982 587 1409
-3  1787 489 1410
-3  2102 647 1411
-3  1751 471 1412
-3  2030 611 1413
-3  1903 547 1414
-3  2240 763 1415
-3  1735 463 1416
-3  1998 595 1417
-3  1779 485 1418
-3  2086 639 1419
-3  1739 465 1420
-3  2006 599 1421
-3  1723 208 221
-3  1723 221 1221
-3  1743 467 1424
-3  2014 603 1425
-3  1815 503 1426
-3  2158 675 1427
-3  1747 469 1428
-3  2022 607 1429
-3  1919 555 1430
-3  2155 779 1431
-3  1771 481 1432
-3  2070 631 1433
-3  1799 495 1434
-3  2126 659 1435
-3  1755 473 1436
-3  2038 615 1437
-3  1943 567 1438
-3  1789 803 1439
-3  1759 475 1440
-3  2046 619 1441
-3  1923 557 1442
-3  2107 783 1443
-3  1763 477 1444
-3  2054 623 1445
-3  1839 515 1446
-3  2206 699 1447
-3  1767 479 1448
-3  2062 627 1449
-3  1915 553 1450
-3  2167 775 1451
-3  1911 551 1452
-3  2175 771 1453
-3  1871 531 1454
-3  2270 731 1455
-3  1895 543 1456
-3  2318 755 1457
-3  1931 561 1458
-3  1950 791 1459
-3  1927 559 1460
-3  2094 787 1461
-3  1939 565 1462
-3  1824 799 1463
-3  1935 563 1464
-3  1857 795 1465
-3  1887 539 1466
-3  2302 747 1467
-3  1723 1256 208
-3  983 222 1782
-3  222 223 1782
-3  223 224 1782
-3  1967 579 1472
-3  1962 577 1473
-3  1987 589 1474
-3  1730 461 1475
-3  1975 583 1476
-3  1970 581 1477
-3  1955 573 1478
-3  1714 453 1479
-3  1983 587 1480
-3  1978 585 1481
-3  1963 577 1482
-3  1718 455 1483
-3  1991 591 1484
-3  1986 589 1485
-3  1971 581 1486
-3  1722 457 1487
-3  1959 575 1488
-3  1954 573 1489
-3  1979 585 1490
-3  1726 459 1491
-3  2007 599 1492
-3  2002 597 1493
-3  2027 609 1494
-3  1750 471 1495
-3  2015 603 1496
-3  2010 601 1497
-3  1995 593 1498
-3  1734 463 1499
-3  2023 607 1500
-3  2018 605 1501
-3  2003 597 1502
-3  1738 465 1503
-3  2031 611 1504
-3  2026 609 1505
-3  2011 601 1506
-3  1742 467 1507
-3  1999 595 1508
-3  1994 593 1509
-3  2019 605 1510
-3  1746 469 1511
-3  2047 619 1512
-3  2042 617 1513
-3  2067 629 1514
-3  1770 481 1515
-3  2055 623 1516
-3  2050 621 1517
-3  2035 613 1518
-3  1754 473 1519
-3  2063 627 1520
-3  2058 625 1521
-3  2043 617 1522
-3  1758 475 1523
-3  2071 631 1524
-3  2066 629 1525
-3  2051 621 1526
-3  1762 477 1527
-3  2039 615 1528
-3  2034 613 1529
-3  2059 625 1530
-3  1766 479 1531
-3  2135 663 1532
-3  2130 661 1533
-3  2179 769 1534
-3  1910 551 1535
-3  2215 703 1536
-3  2210 701 1537
-3  2315 753 1538
-3  1894 543 1539
-3  224 1346 1782
-3  1947 945 1782
-3  2104 785 1542
-3  1926 559 1543
-3  2183 687 1544
-3  2178 685 1545
-3  1944 793 1546
-3  1934 563 1547
-3  942 258 1947
-3  258 945 1947
-3  1254 268 2097
-3  268 269 2097
-3  2191 691 1552
-3  2186 689 1553
-3  2283 737 1554
-3  1878 535 1555
-3  2279 735 1556
-3  2274 733 1557
-3  2131 661 1558
-3  1802 497 1559
-3  2127 659 1560
-3  2122 657 1561
-3  2075 633 1562
-3  1774 483 1563
-3  2154 779 1564
-3  2163 777 1565
-3  2147 669 1566
-3  1810 501 1567
-3  2143 667 1568
-3  2138 665 1569
-3  2251 721 1570
-3  1862 527 1571
-3  269 1253 2097
-3  1253 1947 2097
-3  2159 270 1027
-3  2159 1551 270
-3  2159 675 1576
-3  271 263 1581
-3  990 1581 263
-3  1062 274 1619
-3  274 1684 1619
-3  225 279 1406
-3  1250 685 205
-3  225 1584 279
-3  978 289 1065
-3  978 1706 289
-3  2099 645 1586
-3  1786 489 1587
-3  1788 803 1588
-3  1820 801 1589
-3  2115 653 1590
-3  1794 493 1591
-3  2271 731 1592
-3  2266 729 1593
-3  2243 761 1594
-3  1902 547 1595
-3  2327 759 1596
-3  2322 757 1597
-3  2211 701 1598
-3  1842 517 1599
-3  2207 699 1600
-3  2202 697 1601
-3  2083 637 1602
-3  1778 485 1603
-3  2091 787 1604
-3  2105 785 1605
-3  2227 709 1606
-3  1850 521 1607
-3  2223 707 1608
-3  2218 705 1609
-3  996 291 990
-3  291 1581 990
-3  299 1006 1108
-3  1006 299 225
-3  307 1814 1387
-3  1814 307 57
-3  187 330 1063
-3  187 1407 330
-3  331 848 366
-3  1814 503 1619
-3  2151 671 1620
-3  2146 669 1621
-3  2259 725 1622
-3  1866 529 1623
-3  2255 723 1624
-3  2250 721 1625
-3  2162 777 1626
-3  1918 555 1627
-3  2166 775 1628
-3  2171 773 1629
-3  2195 693 1630
-3  1834 513 1631
-3  2174 771 1632
-3  2216 769 1633
-3  2123 657 1634
-3  1798 495 1635
-3  2119 655 1636
-3  2114 653 1637
-3  2291 741 1638
-3  1882 537 1639
-3  2287 739 1640
-3  2282 737 1641
-3  1818 801 1642
-3  1942 567 1643
-3  1823 799 1644
-3  1853 797 1645
-3  2307 749 1646
-3  1890 541 1647
-3  2303 747 1648
-3  2298 745 1649
-3  2110 781 1650
-3  1922 557 1651
-3  2087 639 1652
-3  2082 637 1653
-3  2323 757 1654
-3  1898 545 1655
-3  2319 755 1656
-3  2314 753 1657
-3  2203 697 1658
-3  1838 515 1659
-3  2199 695 1660
-3  2194 693 1661
-3  2235 765 1662
-3  1906 549 1663
-3  2239 763 1664
-3  2246 761 1665
-3  2170 773 1666
-3  1914 553 1667
-3  2079 635 1668
-3  2074 633 1669
-3  2275 733 1670
-3  1874 533 1671
-3  2231 767 1672
-3  2236 765 1673
-3  2267 729 1674
-3  1870 531 1675
-3  2263 727 1676
-3  2258 725 1677
-3  2139 665 1678
-3  1806 499 1679
-3  2311 751 1680
-3  2306 749 1681
-3  2012 789 1682
-3  1930 561 1683
-3  366 848 1180
-3  848 331 1367
-3  2219 705 1686
-3  1846 519 1687
-3  2106 783 1688
-3  2111 781 1689
-3  1852 797 1690
-3  1938 565 1691
-3  2103 647 1692
-3  2098 645 1693
-3  450 1721 990
-3  371 370 1367
-3  1949 791 1696
-3  2088 789 1697
-3  2299 745 1698
-3  1886 539 1699
-3  2295 743 1700
-3  2290 741 1701
-3  2187 689 1702
-3  1830 511 1703
-3  370 719 1367
-3  1423 371 1367
-3  370 1111 719
-3  508 382 927
-3  1856 795 1708
-3  1945 793 1709
-3  508 1218 382
-3  383 1576 57
-3  2133 662 1712
-3  1964 578 1713
-3  1479 335 1714
-3  1396 294 1715
-3  2149 670 1716
-3  1972 582 1717
-3  1483 337 1718
-3  1400 296 1719
-3  57 1046 383
-3  990 384 996
-3  1487 339 1722
-3  1404 298 1723
-3  2181 686 1724
-3  1988 590 1725
-3  1491 341 1726
-3  1408 300 1727
-3  2117 654 1728
-3  1956 574 1729
-3  1475 333 1730
-3  1392 292 1731
-3  2213 702 1732
-3  2004 598 1733
-3  1499 345 1734
-3  1416 304 1735
-3  990 1721 384
-3  1244 385 386
-3  1503 347 1738
-3  1420 306 1739
-3  2245 718 1740
-3  2020 606 1741
-3  1507 349 1742
-3  1424 308 1743
-3  2261 726 1744
-3  2028 610 1745
-3  1511 351 1746
-3  1428 310 1747
-3  2197 694 1748
-3  1996 594 1749
-3  1495 343 1750
-3  1412 302 1751
-3  2293 742 1752
-3  2044 618 1753
-3  1519 355 1754
-3  1436 314 1755
-3  2309 750 1756
-3  2052 622 1757
-3  1523 357 1758
-3  1440 316 1759
-3  2325 758 1760
-3  2060 626 1761
-3  1527 359 1762
-3  1444 318 1763
-3  2233 766 1764
-3  2068 630 1765
-3  1531 361 1766
-3  1448 320 1767
-3  2277 734 1768
-3  2036 614 1769
-3  1515 353 1770
-3  1432 312 1771
-3  2141 666 1772
-3  2132 662 1773
-3  1563 377 1774
-3  1398 295 1775
-3  2221 706 1776
-3  2212 702 1777
-3  1603 397 1778
-3  1418 305 1779
-3  1244 386 1143
-3  1244 1469 385
-3  388 387 401
-3  387 1045 401
-3  2189 690 1784
-3  2180 686 1785
-3  1587 389 1786
-3  1410 301 1787
-3  388 1045 387
-3  401 1045 991
-3  1045 388 505
-3  1064 402 403
-3  1989 590 1792
-3  2188 690 1793
-3  1591 391 1794
-3  1360 276 1795
-3  2285 738 1796
-3  2276 734 1797
-3  1635 413 1798
-3  1434 313 1799
-3  1957 574 1800
-3  2124 658 1801
-3  1559 375 1802
-3  1352 272 1803
-3  2077 634 1804
-3  2161 778 1805
-3  1679 435 1806
-3  1382 287 1807
-3  1965 578 1808
-3  2140 666 1809
-3  1567 379 1810
-3  1354 273 1811
-3  2253 722 1812
-3  2244 718 1813
-3  1064 403 1583
-3  1426 309 1815
-3  1973 582 1816
-3  2156 674 1817
-3  1064 1720 402
-3  438 404 405
-3  404 1006 405
-3  405 1006 719
-3  438 1006 404
-3  1108 1006 438
-3  443 187 1063
-3  187 1706 978
-3  448 814 1257
-3  1358 275 1827
-3  2101 646 1828
-3  1791 802 1829
-3  1703 447 1830
-3  1388 290 1831
-3  2029 610 1832
-3  2268 730 1833
-3  1631 411 1834
-3  1370 281 1835
-3  2241 762 1836
-3  2324 758 1837
-3  1659 425 1838
-3  1446 319 1839
-3  1997 594 1840
-3  2204 698 1841
-3  1599 395 1842
-3  1362 277 1843
-3  2085 638 1844
-3  2096 786 1845
-3  1687 439 1846
-3  1384 288 1847
-3  2005 598 1848
-3  2220 706 1849
-3  1607 399 1850
-3  1364 278 1851
-3  449 814 448
-3  814 449 838
-3  451 603 1583
-3  1064 1583 603
-3  1616 2013 847
-3  1783 456 1188
-3  1783 1615 456
-3  808 464 1613
-3  2157 674 1860
-3  2148 670 1861
-3  1571 381 1862
-3  1402 297 1863
-3  2021 606 1864
-3  2252 722 1865
-3  1623 407 1866
-3  1368 280 1867
-3  2160 778 1868
-3  2169 774 1869
-3  1675 433 1870
-3  1454 323 1871
-3  2069 630 1872
-3  2177 770 1873
-3  1671 431 1874
-3  1380 286 1875
-3  2125 658 1876
-3  2116 654 1877
-3  1555 373 1878
-3  1394 293 1879
-3  2037 614 1880
-3  2284 738 1881
-3  1639 415 1882
-3  1372 282 1883
-3  1790 802 1884
-3  1826 798 1885
-3  1699 445 1886
-3  1466 329 1887
-3  2045 618 1888
-3  2300 746 1889
-3  1647 419 1890
-3  1374 283 1891
-3  2108 782 1892
-3  2084 638 1893
-3  1539 365 1894
-3  1456 324 1895
-3  2053 622 1896
-3  2316 754 1897
-3  1655 423 1898
-3  1376 284 1899
-3  2205 698 1900
-3  2196 694 1901
-3  1595 393 1902
-3  1414 303 1903
-3  2061 626 1904
-3  2242 762 1905
-3  1663 427 1906
-3  1378 285 1907
-3  2168 774 1908
-3  2076 634 1909
-3  1535 363 1910
-3  1452 322 1911
-3  2176 770 1912
-3  2234 766 1913
-3  1667 429 1914
-3  1450 321 1915
-3  2269 730 1916
-3  2260 726 1917
-3  1627 409 1918
-3  1430 311 1919
-3  2317 754 1920
-3  2308 750 1921
-3  1651 421 1922
-3  1442 317 1923
-3  1951 790 1924
-3  2092 642 1925
-3  1543 367 1926
-3  1460 326 1927
-3  2095 786 1928
-3  2109 782 1929
-3  1683 437 1930
-3  1458 325 1931
-3  1825 798 1932
-3  2100 646 1933
-3  1547 369 1934
-3  1464 328 1935
-3  1858 794 1936
-3  1980 790 1937
-3  1691 441 1938
-3  1462 327 1939
-3  2301 746 1940
-3  2292 742 1941
-3  1643 417 1942
-3  1438 315 1943
-3  808 1617 464
-3  66 1781 2230
-3  486 2225 1550
-3  487 2225 486
-3  2093 642 1948
-3  1357 1859 794
-3  1783 1550 2225
-3  2013 490 1612
-3  1961 576 1952
-3  1984 588 1953
-3  1489 340 1954
-3  1478 335 1955
-3  1729 460 1956
-3  1800 496 1957
-3  1397 294 1958
-3  1488 340 1959
-3  1969 580 1960
-3  1952 572 1961
-3  1473 332 1962
-3  1482 337 1963
-3  1713 452 1964
-3  1808 500 1965
-3  1401 296 1966
-3  1472 332 1967
-3  1977 584 1968
-3  1960 576 1969
-3  1477 334 1970
-3  1486 339 1971
-3  1717 454 1972
-3  1816 504 1973
-3  1405 298 1974
-3  1476 334 1975
-3  1985 588 1976
-3  1968 580 1977
-3  1481 336 1978
-3  1490 341 1979
-3  2013 1616 490
-3  1223 508 202
-3  1409 300 1982
-3  1480 336 1983
-3  1953 572 1984
-3  1976 584 1985
-3  1485 338 1986
-3  1474 333 1987
-3  1725 458 1988
-3  1792 492 1989
-3  1393 292 1990
-3  1484 338 1991
-3  2001 596 1992
-3  2024 608 1993
-3  1509 350 1994
-3  1498 345 1995
-3  1749 470 1996
-3  1840 516 1997
-3  1417 304 1998
-3  1508 350 1999
-3  2009 600 2000
-3  1992 592 2001
-3  1493 342 2002
-3  1502 347 2003
-3  1733 462 2004
-3  1848 520 2005
-3  1421 306 2006
-3  1492 342 2007
-3  2017 604 2008
-3  2000 596 2009
-3  1497 344 2010
-3  1506 349 2011
-3  506 491 1425
-3  491 1184 819
-3  1425 308 2014
-3  1496 344 2015
-3  2025 608 2016
-3  2008 600 2017
-3  1501 346 2018
-3  1510 351 2019
-3  1741 466 2020
-3  1864 528 2021
-3  1429 310 2022
-3  1500 346 2023
-3  1993 592 2024
-3  2016 604 2025
-3  1505 348 2026
-3  1494 343 2027
-3  1745 468 2028
-3  1832 512 2029
-3  1413 302 2030
-3  1504 348 2031
-3  2041 616 2032
-3  2064 628 2033
-3  1529 360 2034
-3  1518 355 2035
-3  1769 480 2036
-3  1880 536 2037
-3  1437 314 2038
-3  1528 360 2039
-3  2049 620 2040
-3  2032 612 2041
-3  1513 352 2042
-3  1522 357 2043
-3  1753 472 2044
-3  1888 540 2045
-3  1441 316 2046
-3  1512 352 2047
-3  2057 624 2048
-3  2040 616 2049
-3  1517 354 2050
-3  1526 359 2051
-3  1757 474 2052
-3  1896 544 2053
-3  1445 318 2054
-3  1516 354 2055
-3  2065 628 2056
-3  2048 620 2057
-3  1521 356 2058
-3  1530 361 2059
-3  1761 476 2060
-3  1904 548 2061
-3  1449 320 2062
-3  1520 356 2063
-3  2033 612 2064
-3  2056 624 2065
-3  1525 358 2066
-3  1514 353 2067
-3  1765 478 2068
-3  1872 532 2069
-3  1433 312 2070
-3  1524 358 2071
-3  2129 660 2072
-3  2229 768 2073
-3  1669 430 2074
-3  1562 377 2075
-3  1909 550 2076
-3  1804 498 2077
-3  1399 295 2078
-3  1668 430 2079
-3  2209 700 2080
-3  2312 752 2081
-3  1653 422 2082
-3  1602 397 2083
-3  1893 542 2084
-3  1844 518 2085
-3  1419 305 2086
-3  1652 422 2087
-3  1780 506 1425
-3  491 819 1425
-3  2104 507 509
-3  507 522 509
-3  1925 558 2092
-3  1948 570 2093
-3  2104 509 1126
-3  2104 522 507
-3  2104 1470 522
-3  1947 792 2097
-3  1693 442 2098
-3  1586 389 2099
-3  1933 562 2100
-3  1828 510 2101
-3  1411 301 2102
-3  1692 442 2103
-3  523 2093 1049
-3  2093 1407 187
-3  941 524 997
-3  524 525 997
-3  525 1216 997
-3  568 1064 2013
-3  2013 1612 568
-3  1576 569 1030
-3  2185 688 2112
-3  2280 736 2113
-3  1637 414 2114
-3  1590 391 2115
-3  1877 534 2116
-3  1728 460 2117
-3  1361 276 2118
-3  1636 414 2119
-3  2273 732 2120
-3  2128 660 2121
-3  1561 376 2122
-3  1634 413 2123
-3  1801 496 2124
-3  1876 534 2125
-3  1435 313 2126
-3  1560 376 2127
-3  2121 656 2128
-3  2072 632 2129
-3  1533 362 2130
-3  1558 375 2131
-3  1773 482 2132
-3  1712 452 2133
-3  1353 272 2134
-3  1532 362 2135
-3  2164 776 2136
-3  2144 668 2137
-3  1569 380 2138
-3  1678 435 2139
-3  1809 500 2140
-3  1772 482 2141
-3  1383 287 2142
-3  1568 380 2143
-3  2137 664 2144
-3  2248 720 2145
-3  1621 406 2146
-3  1566 379 2147
-3  1861 526 2148
-3  1716 454 2149
-3  1355 273 2150
-3  1620 406 2151
-3  1576 1704 569
-3  571 1858 1351
-3  1026 1858 571
-3  1684 586 1619
-3  1817 504 2156
-3  1860 526 2157
-3  1427 309 2158
-3  1551 2159 677
-3  586 640 1619
-3  640 1356 1814
-3  640 1814 1619
-3  1709 641 643
-3  1709 643 644
-3  1709 644 1004
-3  644 643 641
-3  1709 1685 641
-3  648 814 1819
-3  649 814 648
-3  1257 814 649
-3  1582 650 651
-3  1582 651 1219
-3  1582 1220 650
-3  602 672 1190
-3  602 1694 672
-3  1252 1255 1225
-3  1365 673 1711
-3  1545 368 2178
-3  1365 676 673
-3  1785 488 2180
-3  1724 458 2181
-3  1359 275 2182
-3  1544 368 2183
-3  1821 800 2184
-3  2112 652 2185
-3  1553 372 2186
-3  1702 447 2187
-3  1793 492 2188
-3  1784 488 2189
-3  1389 290 2190
-3  1552 372 2191
-3  2265 728 2192
-3  2328 760 2193
-3  1661 426 2194
-3  1630 411 2195
-3  1901 546 2196
-3  1748 470 2197
-3  1371 281 2198
-3  1660 426 2199
-3  2321 756 2200
-3  2208 700 2201
-3  1601 396 2202
-3  1658 425 2203
-3  1841 516 2204
-3  1900 546 2205
-3  1447 319 2206
-3  1600 396 2207
-3  2201 696 2208
-3  2080 636 2209
-3  1537 364 2210
-3  1598 395 2211
-3  1777 484 2212
-3  1732 462 2213
-3  1363 277 2214
-3  1536 364 2215
-3  1365 1737 676
-3  2224 708 2217
-3  1609 400 2218
-3  1686 439 2219
-3  1849 520 2220
-3  1776 484 2221
-3  1385 288 2222
-3  1608 400 2223
-3  2217 704 2224
-3  1580 2225 487
-3  677 2159 678
-3  1606 399 2227
-3  678 2159 1576
-3  1576 1030 678
-3  1365 278 2230
-3  1250 679 685
-3  679 1366 685
-3  681 680 1425
-3  680 1780 1425
-3  1574 681 1425
-3  682 997 1216
-3  997 682 1981
-3  570 683 1047
-3  570 1386 683
-3  709 684 1575
-3  709 1577 684
-3  710 1127 711
-3  711 1127 927
-3  1813 502 2244
-3  1740 466 2245
-3  911 1127 710
-3  712 66 1705
-3  2145 668 2248
-3  2256 724 2249
-3  1625 408 2250
-3  1570 381 2251
-3  1865 528 2252
-3  1812 502 2253
-3  1403 297 2254
-3  1624 408 2255
-3  2249 720 2256
-3  2165 776 2257
-3  1677 434 2258
-3  1622 407 2259
-3  1917 554 2260
-3  1744 468 2261
-3  1369 280 2262
-3  1676 434 2263
-3  2172 772 2264
-3  2192 692 2265
-3  1593 392 2266
-3  1674 433 2267
-3  1833 512 2268
-3  1916 554 2269
-3  1455 323 2270
-3  1592 392 2271
-3  2228 768 2272
-3  2120 656 2273
-3  1557 374 2274
-3  1670 431 2275
-3  1797 494 2276
-3  1768 480 2277
-3  1381 286 2278
-3  1556 374 2279
-3  2113 652 2280
-3  2288 740 2281
-3  1641 416 2282
-3  1554 373 2283
-3  1881 536 2284
-3  1796 494 2285
-3  1395 293 2286
-3  1640 416 2287
-3  2281 736 2288
-3  1822 800 2289
-3  1701 446 2290
-3  1638 415 2291
-3  1941 566 2292
-3  1752 472 2293
-3  1373 282 2294
-3  1700 446 2295
-3  1854 796 2296
-3  2304 748 2297
-3  1649 420 2298
-3  1698 445 2299
-3  1889 540 2300
-3  1940 566 2301
-3  1467 329 2302
-3  1648 420 2303
-3  2297 744 2304
-3  2153 780 2305
-3  1681 436 2306
-3  1646 419 2307
-3  1921 556 2308
-3  1756 474 2309
-3  1375 283 2310
-3  1680 436 2311
-3  2081 636 2312
-3  2320 756 2313
-3  1657 424 2314
-3  1538 365 2315
-3  1897 544 2316
-3  1920 556 2317
-3  1457 324 2318
-3  1656 424 2319
-3  2313 752 2320
-3  2200 696 2321
-3  1597 394 2322
-3  1654 423 2323
-3  1837 514 2324
-3  1760 476 2325
-3  1377 284 2326
-3  1596 394 2327
-3  2193 692 2328
-3  2238 764 2247
-3  1665 428 2246
-3  1594 393 2243
-3  1905 548 2242
-3  1836 514 2241
-3  1415 303 2240
-3  1664 428 2239
-3  2247 760 2238
-3  2173 772 2237
-3  1673 432 2236
-3  1662 427 2235
-3  1913 552 2234
-3  1764 478 2233
-3  1379 285 2232
-3  1672 432 2231
-3  2073 632 2229
-3  2272 732 2228
-3  1633 412 2216
-3  1534 363 2179
-3  1873 532 2177
-3  1912 552 2176
-3  1453 322 2175
-3  1632 412 2174
-3  2237 764 2173
-3  2264 728 2172
-3  1629 410 2171
-3  1666 429 2170
-3  1869 530 2169
-3  1908 550 2168
-3  1451 321 2167
-3  1628 410 2166
-3  2257 724 2165
-3  2136 664 2164
-3  1565 378 2163
-3  1626 409 2162
-3  1805 498 2161
-3  1868 530 2160
-3  1431 311 2155
-3  1564 378 2154
-3  2305 748 2153
-3  2090 788 2152
-3  1689 440 2111
-3  1650 421 2110
-3  1929 560 2109
-3  1892 542 2108
-3  1443 317 2107
-3  1688 440 2106
-3  1695 66 712
-3  57 713 1046
-3  1605 398 2105
-3  1542 367 2104
-3  1845 518 2096
-3  1928 560 2095
-3  1461 326 2094
-3  1604 398 2091
-3  2152 780 2090
-3  1855 796 2089
-3  1697 444 2088
-3  1682 437 2012
-3  1937 564 1980
-3  1924 558 1951
-3  1459 325 1950
-3  1696 444 1949
-3  57 1572 713
-3  1782 808 1946
-3  1709 450 1945
-3  1546 369 1944
-3  1386 1859 784
-3  1936 564 1858
-3  1465 328 1857
-3  1708 450 1856
-3  2089 788 1855
-3  2296 744 1854
-3  1645 418 1853
-3  1690 441 1852
-3  1885 538 1826
-3  1932 562 1825
-3  1463 327 1824
-3  1644 418 1823
-3  2289 740 1822
-3  2184 688 1821
-3  1589 390 1820
-3  1642 417 1818
-3  1829 510 1791
-3  1884 538 1790
-3  1439 315 1789
-3  1588 390 1788
-3  2225 708 1783
-3  988 714 505
-3  714 1819 505
-3  715 1819 714
-3  1181 716 819
-3  716 717 848
-3  716 848 819
-3  1180 848 717
-3  1946 792 1782
-3  784 1859 1251
-3  1859 1386 570
-3  805 804 98
-3  804 1736 98
-3  1213 805 98
-3  1249 806 1333
-3  806 807 1333
-3  1397 114 812
-3  1803 272 812
-3  1401 116 813
-3  1811 273 813
-3  1405 118 814
-3  1391 648 1819
-3  1409 120 815
-3  1827 275 815
-3  1393 112 816
-3  1795 276 816
-3  1417 124 817
-3  1843 277 817
-3  1421 126 818
-3  1851 278 818
-3  807 1349 1333
-3  1580 809 2225
-3  1429 130 820
-3  1867 280 820
-3  1413 122 821
-3  1835 281 821
-3  1437 134 822
-3  1883 282 822
-3  1441 136 823
-3  1891 283 823
-3  1445 138 824
-3  1899 284 824
-3  1449 140 825
-3  1907 285 825
-3  1433 132 826
-3  1875 286 826
-3  1399 115 827
-3  1807 287 827
-3  1419 125 828
-3  1847 288 828
-3  809 1578 2225
-3  1578 1344 2225
-3  1411 121 830
-3  1831 290 830
-3  1575 810 709
-3  810 1212 2226
-3  1361 96 832
-3  1731 292 832
-3  1435 133 833
-3  1879 293 833
-3  1353 92 834
-3  1715 294 834
-3  1383 107 835
-3  1775 295 835
-3  1355 93 836
-3  1719 296 836
-3  1427 129 837
-3  1863 297 837
-3  810 2226 709
-3  1723 298 838
-3  203 811 1350
-3  203 1468 811
-3  1359 95 840
-3  1727 300 840
-3  1389 110 841
-3  1787 301 841
-3  1371 101 842
-3  1751 302 842
-3  1447 139 843
-3  1903 303 843
-3  1363 97 844
-3  1735 304 844
-3  1385 108 845
-3  1779 305 845
-3  1365 98 846
-3  1739 306 846
-3  829 1225 1366
-3  1252 1225 829
-3  1367 99 848
-3  1743 308 848
-3  1403 117 849
-3  1815 309 849
-3  1369 100 850
-3  1747 310 850
-3  1455 143 851
-3  1919 311 851
-3  1381 106 852
-3  1771 312 852
-3  1395 113 853
-3  1799 313 853
-3  1373 102 854
-3  1755 314 854
-3  1467 149 855
-3  1943 315 855
-3  1375 103 856
-3  1759 316 856
-3  1457 144 857
-3  1923 317 857
-3  1377 104 858
-3  1763 318 858
-3  1415 123 859
-3  1839 319 859
-3  1379 105 860
-3  1767 320 860
-3  1453 142 861
-3  1915 321 861
-3  1451 141 862
-3  1911 322 862
-3  1431 131 863
-3  1871 323 863
-3  1443 137 864
-3  1895 324 864
-3  1461 146 865
-3  1931 325 865
-3  1459 145 866
-3  1927 326 866
-3  1465 148 867
-3  1939 327 867
-3  1463 147 868
-3  1935 328 868
-3  1439 135 869
-3  1887 329 869
-3  1618 831 1344
-3  831 1577 1344
-3  1577 709 1344
-3  2013 839 847
-3  1479 155 872
-3  1967 332 872
-3  1489 160 873
-3  1987 333 873
-3  1483 157 874
-3  1975 334 874
-3  1473 152 875
-3  1955 335 875
-3  1487 159 876
-3  1983 336 876
-3  1477 154 877
-3  1963 337 877
-3  1491 161 878
-3  1991 338 878
-3  1481 156 879
-3  1971 339 879
-3  1475 153 880
-3  1959 340 880
-3  1485 158 881
-3  1979 341 881
-3  1499 165 882
-3  2007 342 882
-3  1509 170 883
-3  2027 343 883
-3  1503 167 884
-3  2015 344 884
-3  1493 162 885
-3  1995 345 885
-3  1507 169 886
-3  2023 346 886
-3  1497 164 887
-3  2003 347 887
-3  1511 171 888
-3  2031 348 888
-3  1501 166 889
-3  2011 349 889
-3  1495 163 890
-3  1999 350 890
-3  1505 168 891
-3  2019 351 891
-3  1519 175 892
-3  2047 352 892
-3  1529 180 893
-3  2067 353 893
-3  1523 177 894
-3  2055 354 894
-3  1513 172 895
-3  2035 355 895
-3  1527 179 896
-3  2063 356 896
-3  1517 174 897
-3  2043 357 897
-3  1531 181 898
-3  2071 358 898
-3  1521 176 899
-3  2051 359 899
-3  1515 173 900
-3  2039 360 900
-3  1525 178 901
-3  2059 361 901
-3  1563 197 902
-3  2135 362 902
-3  1669 250 903
-3  2179 363 903
-3  1603 217 904
-3  2215 364 904
-3  1653 242 905
-3  2315 365 905
-3  839 2013 602
-3  602 1189 839
-3  871 870 1142
-3  1470 367 1109
-3  1587 209 908
-3  2183 368 908
-3  1693 262 909
-3  1944 369 909
-3  870 1694 1142
-3  1710 871 1142
-3  1694 602 1142
-3  2230 906 907
-3  1591 211 912
-3  2191 372 912
-3  1637 234 913
-3  2283 373 913
-3  1635 233 914
-3  2279 374 914
-3  1561 196 915
-3  2131 375 915
-3  1559 195 916
-3  2127 376 916
-3  1533 182 917
-3  2075 377 917
-3  1679 255 918
-3  2154 378 918
-3  1569 200 919
-3  2147 379 919
-3  1567 199 920
-3  2143 380 920
-3  1621 226 921
-3  2251 381 921
-3  2230 907 1707
-3  2230 1781 906
-3  1031 910 794
-3  910 1357 794
-3  1613 1333 808
-3  1617 808 1346
-3  983 1782 945
-3  1615 2224 1541
-3  1078 803 1788
-3  930 267 1788
-3  1588 803 1789
-3  1438 89 1789
-3  1051 802 1790
-3  1078 267 1790
-3  1545 188 929
-3  2099 389 929
-3  1703 267 930
-3  1788 390 930
-3  1553 192 931
-3  2115 391 931
-3  1631 231 932
-3  2271 392 932
-3  1661 246 933
-3  2243 393 933
-3  1659 245 934
-3  2327 394 934
-3  1601 216 935
-3  2211 395 935
-3  1599 215 936
-3  2207 396 936
-3  1537 184 937
-3  2083 397 937
-3  1687 259 938
-3  2091 398 938
-3  1609 220 939
-3  2227 399 939
-3  1607 219 940
-3  2223 400 940
-3  1884 802 1791
-3  1828 30 1791
-3  1228 801 1818
-3  957 266 1818
-3  1642 801 1820
-3  1588 89 1820
-3  1281 800 1821
-3  1228 266 1821
-3  2184 800 1822
-3  2288 2 1822
-3  1571 201 946
-3  2151 406 946
-3  1625 228 947
-3  2259 407 947
-3  1623 227 948
-3  2255 408 948
-3  1677 254 949
-3  2162 409 949
-3  1675 253 950
-3  2166 410 950
-3  1593 212 951
-3  2195 411 951
-3  1671 251 952
-3  2174 412 952
-3  1557 194 953
-3  2123 413 953
-3  1555 193 954
-3  2119 414 954
-3  1641 236 955
-3  2291 415 955
-3  1639 235 956
-3  2287 416 956
-3  1701 266 957
-3  1818 417 957
-3  1699 265 958
-3  1823 418 958
-3  1649 240 959
-3  2307 419 959
-3  1647 239 960
-3  2303 420 960
-3  1681 256 961
-3  2110 421 961
-3  1539 185 962
-3  2087 422 962
-3  1657 244 963
-3  2323 423 963
-3  1655 243 964
-3  2319 424 964
-3  1597 214 965
-3  2203 425 965
-3  1595 213 966
-3  2199 426 966
-3  1665 248 967
-3  2235 427 967
-3  1663 247 968
-3  2239 428 968
-3  1673 252 969
-3  2170 429 969
-3  1535 183 970
-3  2079 430 970
-3  1633 232 971
-3  2275 431 971
-3  1667 249 972
-3  2231 432 972
-3  1629 230 973
-3  2267 433 973
-3  1627 229 974
-3  2263 434 974
-3  1565 198 975
-3  2139 435 975
-3  1651 241 976
-3  2311 436 976
-3  1689 260 977
-3  2012 437 977
-3  1543 187 978
-3  1102 799 1823
-3  1605 218 979
-3  2219 439 979
-3  1683 257 980
-3  2106 440 980
-3  1697 264 981
-3  1852 441 981
-3  1547 189 982
-3  2103 442 982
-3  958 265 1823
-3  1644 799 1824
-3  1691 261 984
-3  1949 444 984
-3  1645 238 985
-3  2299 445 985
-3  1643 237 986
-3  2295 446 986
-3  1589 210 987
-3  2187 447 987
-3  1462 88 1824
-3  1079 798 1825
-3  1102 265 1825
-3  1932 798 1826
-3  1611 263 271
-3  1856 450 990
-3  1884 30 1826
-3  1284 797 1852
-3  2135 197 992
-3  2133 452 992
-3  1965 155 993
-3  1479 453 993
-3  2151 201 994
-3  2149 454 994
-3  1973 157 995
-3  1483 455 995
-3  981 264 1852
-3  1690 797 1853
-3  1981 159 997
-3  1487 457 997
-3  2183 209 998
-3  2181 458 998
-3  1989 161 999
-3  1491 459 999
-3  2119 193 1000
-3  2117 460 1000
-3  1957 153 1001
-3  1475 461 1001
-3  2215 217 1002
-3  2213 462 1002
-3  2005 165 1003
-3  1499 463 1003
-3  1644 88 1853
-3  1329 796 1854
-3  2013 167 1005
-3  1503 465 1005
-3  1584 225 299
-3  2245 466 1006
-3  2021 169 1007
-3  1507 467 1007
-3  2263 229 1008
-3  2261 468 1008
-3  2029 171 1009
-3  1511 469 1009
-3  2199 213 1010
-3  2197 470 1010
-3  1997 163 1011
-3  1495 471 1011
-3  2295 237 1012
-3  2293 472 1012
-3  2045 175 1013
-3  1519 473 1013
-3  2311 241 1014
-3  2309 474 1014
-3  2053 177 1015
-3  1523 475 1015
-3  2327 245 1016
-3  2325 476 1016
-3  2061 179 1017
-3  1527 477 1017
-3  2231 249 1018
-3  2233 478 1018
-3  2069 181 1019
-3  1531 479 1019
-3  2279 233 1020
-3  2277 480 1020
-3  2037 173 1021
-3  1515 481 1021
-3  2143 199 1022
-3  2141 482 1022
-3  2133 197 1023
-3  1563 483 1023
-3  2223 219 1024
-3  2221 484 1024
-3  2213 217 1025
-3  1603 485 1025
-3  1284 264 1854
-3  2296 796 1855
-3  2090 7 1855
-3  1104 795 1856
-3  2191 211 1028
-3  2189 488 1028
-3  2181 209 1029
-3  1587 489 1029
-3  990 263 1856
-3  1708 795 1857
-3  1464 87 1857
-3  1614 1858 1026
-3  1991 161 1032
-3  1989 492 1032
-3  2189 211 1033
-3  1591 493 1033
-3  2287 235 1034
-3  2285 494 1034
-3  2277 233 1035
-3  1635 495 1035
-3  1959 153 1036
-3  1957 496 1036
-3  2125 195 1037
-3  1559 497 1037
-3  2079 183 1038
-3  2077 498 1038
-3  2160 255 1039
-3  1679 499 1039
-3  1967 155 1040
-3  1965 500 1040
-3  2141 199 1041
-3  1567 501 1041
-3  2255 227 1042
-3  2253 502 1042
-3  2245 225 1043
-3  1619 503 1043
-3  1975 157 1044
-3  1973 504 1044
-3  2157 203 1045
-3  1579 505 388
-3  1104 263 1858
-3  1936 794 1859
-3  1948 29 1859
-3  1348 793 1944
-3  1983 159 1048
-3  1981 508 1048
-3  909 262 1944
-3  1546 793 1945
-3  2103 189 1050
-3  2101 510 1050
-3  1790 267 1051
-3  1703 511 1051
-3  2031 171 1052
-3  2029 512 1052
-3  2269 231 1053
-3  1631 513 1053
-3  2239 247 1054
-3  2241 514 1054
-3  2325 245 1055
-3  1659 515 1055
-3  1999 163 1056
-3  1997 516 1056
-3  2205 215 1057
-3  1599 517 1057
-3  2087 185 1058
-3  2085 518 1058
-3  2095 259 1059
-3  1687 519 1059
-3  2007 165 1060
-3  2005 520 1060
-3  2221 219 1061
-3  1607 521 1061
-3  1708 87 1945
-3  1185 792 1946
-3  1348 262 1946
-3  1782 792 1947
-3  2015 167 1064
-3  1720 1064 568
-3  1098 791 1949
-3  984 261 1949
-3  2159 203 1066
-3  2157 526 1066
-3  2149 201 1067
-3  1571 527 1067
-3  2023 169 1068
-3  2021 528 1068
-3  2253 227 1069
-3  1623 529 1069
-3  2154 255 1070
-3  2160 530 1070
-3  2168 253 1071
-3  1675 531 1071
-3  2071 181 1072
-3  2069 532 1072
-3  2176 251 1073
-3  1671 533 1073
-3  2127 195 1074
-3  2125 534 1074
-3  2117 193 1075
-3  1555 535 1075
-3  2039 173 1076
-3  2037 536 1076
-3  2285 235 1077
-3  1639 537 1077
-3  1788 267 1078
-3  1790 538 1078
-3  1825 265 1079
-3  1699 539 1079
-3  2047 175 1080
-3  2045 540 1080
-3  2301 239 1081
-3  1647 541 1081
-3  2106 257 1082
-3  2108 542 1082
-3  2085 185 1083
-3  1539 543 1083
-3  2055 177 1084
-3  2053 544 1084
-3  2317 243 1085
-3  1655 545 1085
-3  2207 215 1086
-3  2205 546 1086
-3  2197 213 1087
-3  1595 547 1087
-3  2063 179 1088
-3  2061 548 1088
-3  2241 247 1089
-3  1663 549 1089
-3  2166 253 1090
-3  2168 550 1090
-3  2077 183 1091
-3  1535 551 1091
-3  2174 251 1092
-3  2176 552 1092
-3  2233 249 1093
-3  1667 553 1093
-3  2271 231 1094
-3  2269 554 1094
-3  2261 229 1095
-3  1627 555 1095
-3  2319 243 1096
-3  2317 556 1096
-3  2309 241 1097
-3  1651 557 1097
-3  1949 261 1098
-3  1951 558 1098
-3  2093 187 1099
-3  1543 559 1099
-3  2091 259 1100
-3  2095 560 1100
-3  2108 257 1101
-3  1683 561 1101
-3  1823 265 1102
-3  1825 562 1102
-3  2101 189 1103
-3  1547 563 1103
-3  1856 263 1104
-3  1858 564 1104
-3  1951 261 1105
-3  1691 565 1105
-3  2303 239 1106
-3  2301 566 1106
-3  2293 237 1107
-3  1643 567 1107
-3  1696 791 1950
-3  1458 86 1950
-3  1105 790 1951
-3  1098 261 1951
-3  1924 790 1980
-3  1390 2093 570
-3  1351 1858 263
-3  1936 29 1980
-3  1963 154 1112
-3  1961 572 1112
-3  1985 160 1113
-3  1489 573 1113
-3  1731 96 1114
-3  1729 574 1114
-3  1801 114 1115
-3  1397 575 1115
-3  1971 156 1116
-3  1969 576 1116
-3  1953 152 1117
-3  1473 577 1117
-3  1715 92 1118
-3  1713 578 1118
-3  1809 116 1119
-3  1401 579 1119
-3  1979 158 1120
-3  1977 580 1120
-3  1961 154 1121
-3  1477 581 1121
-3  1719 93 1122
-3  1717 582 1122
-3  1817 118 1123
-3  1405 583 1123
-3  1987 160 1124
-3  1985 584 1124
-3  1969 156 1125
-3  1481 585 1125
-3  1336 789 2012
-3  977 260 2012
-3  922 1127 911
-3  1409 587 1127
-3  1955 152 1128
-3  1953 588 1128
-3  1977 158 1129
-3  1485 589 1129
-3  1727 95 1130
-3  1725 590 1130
-3  1793 112 1131
-3  1393 591 1131
-3  2003 164 1132
-3  2001 592 1132
-3  2025 170 1133
-3  1509 593 1133
-3  1751 101 1134
-3  1749 594 1134
-3  1841 124 1135
-3  1417 595 1135
-3  2011 166 1136
-3  2009 596 1136
-3  1993 162 1137
-3  1493 597 1137
-3  1735 97 1138
-3  1733 598 1138
-3  1849 126 1139
-3  1421 599 1139
-3  2019 168 1140
-3  2017 600 1140
-3  2001 164 1141
-3  1497 601 1141
-3  1739 98 1142
-3  1682 789 2088
-3  1696 86 2088
-3  1610 1574 603
-3  2027 170 1144
-3  2025 604 1144
-3  2009 166 1145
-3  1501 605 1145
-3  1743 99 1146
-3  1741 606 1146
-3  1865 130 1147
-3  1429 607 1147
-3  1995 162 1148
-3  1993 608 1148
-3  2017 168 1149
-3  1505 609 1149
-3  1747 100 1150
-3  1745 610 1150
-3  1833 122 1151
-3  1413 611 1151
-3  2043 174 1152
-3  2041 612 1152
-3  2065 180 1153
-3  1529 613 1153
-3  1771 106 1154
-3  1769 614 1154
-3  1881 134 1155
-3  1437 615 1155
-3  2051 176 1156
-3  2049 616 1156
-3  2033 172 1157
-3  1513 617 1157
-3  1755 102 1158
-3  1753 618 1158
-3  1889 136 1159
-3  1441 619 1159
-3  2059 178 1160
-3  2057 620 1160
-3  2041 174 1161
-3  1517 621 1161
-3  1759 103 1162
-3  1757 622 1162
-3  1897 138 1163
-3  1445 623 1163
-3  2067 180 1164
-3  2065 624 1164
-3  2049 176 1165
-3  1521 625 1165
-3  1763 104 1166
-3  1761 626 1166
-3  1905 140 1167
-3  1449 627 1167
-3  2035 172 1168
-3  2033 628 1168
-3  2057 178 1169
-3  1525 629 1169
-3  1767 105 1170
-3  1765 630 1170
-3  1873 132 1171
-3  1433 631 1171
-3  2131 196 1172
-3  2129 632 1172
-3  2228 250 1173
-3  1669 633 1173
-3  1911 141 1174
-3  1909 634 1174
-3  1805 115 1175
-3  1399 635 1175
-3  2211 216 1176
-3  2209 636 1176
-3  2313 242 1177
-3  1653 637 1177
-3  1895 137 1178
-3  1893 638 1178
-3  1845 125 1179
-3  1419 639 1179
-3  1321 788 2089
-3  1336 260 2089
-3  1855 788 2090
-3  2153 7 2090
-3  1927 145 1182
-3  1925 642 1182
-3  1100 787 2091
-3  938 259 2091
-3  1604 787 2094
-3  1460 85 2094
-3  1946 262 1185
-3  1693 645 1185
-3  1935 147 1186
-3  1933 646 1186
-3  1829 121 1187
-3  1411 647 1187
-3  1059 786 2095
-3  1100 259 2095
-3  1928 786 2096
-3  1844 28 2096
-3  1244 785 2104
-3  1542 785 2105
-3  1604 85 2105
-3  1082 783 2106
-3  2187 210 1192
-3  2185 652 1192
-3  2281 234 1193
-3  1637 653 1193
-3  1879 133 1194
-3  1877 654 1194
-3  1729 96 1195
-3  1361 655 1195
-3  2275 232 1196
-3  2273 656 1196
-3  2129 196 1197
-3  1561 657 1197
-3  1803 114 1198
-3  1801 658 1198
-3  1877 133 1199
-3  1435 659 1199
-3  2123 194 1200
-3  2121 660 1200
-3  2073 182 1201
-3  1533 661 1201
-3  1775 107 1202
-3  1773 662 1202
-3  1713 92 1203
-3  1353 663 1203
-3  2162 254 1204
-3  2164 664 1204
-3  2145 200 1205
-3  1569 665 1205
-3  1811 116 1206
-3  1809 666 1206
-3  1773 107 1207
-3  1383 667 1207
-3  2139 198 1208
-3  2137 668 1208
-3  2249 226 1209
-3  1621 669 1209
-3  1863 129 1210
-3  1861 670 1210
-3  1717 93 1211
-3  1355 671 1211
-3  980 257 2106
-3  1688 783 2107
-3  1442 84 2107
-3  1101 782 2108
-3  1819 118 1214
-3  1817 674 1214
-3  1861 129 1215
-3  1427 675 1215
-3  1082 257 2108
-3  1892 782 2109
-3  1928 28 2109
-3  1328 781 2110
-3  961 256 2110
-3  1650 781 2111
-3  1688 84 2111
-3  1289 780 2152
-3  1328 256 2152
-3  2090 780 2153
-3  2304 7 2153
-3  1070 779 2154
-3  1334 120 943
-3  918 255 2154
-3  1564 779 2155
-3  1430 83 2155
-3  1039 778 2160
-3  1070 255 2160
-3  2097 188 1225
-3  1545 685 1225
-3  1787 110 1226
-3  1785 686 1226
-3  1725 95 1227
-3  1359 687 1227
-3  1818 266 1228
-3  1821 688 1228
-3  2113 192 1229
-3  1553 689 1229
-3  1795 112 1230
-3  1793 690 1230
-3  1785 110 1231
-3  1389 691 1231
-3  2267 230 1232
-3  2265 692 1232
-3  2247 246 1233
-3  1661 693 1233
-3  1903 139 1234
-3  1901 694 1234
-3  1749 101 1235
-3  1371 695 1235
-3  2323 244 1236
-3  2321 696 1236
-3  2209 216 1237
-3  1601 697 1237
-3  1843 124 1238
-3  1841 698 1238
-3  1901 139 1239
-3  1447 699 1239
-3  2203 214 1240
-3  2201 700 1240
-3  2081 184 1241
-3  1537 701 1241
-3  1779 108 1242
-3  1777 702 1242
-3  1733 97 1243
-3  1363 703 1243
-3  1469 2104 1126
-3  1549 1244 1143
-3  2225 220 1245
-3  1609 705 1245
-3  1851 126 1246
-3  1849 706 1246
-3  1777 108 1247
-3  1385 707 1247
-3  2219 218 1248
-3  2217 708 1248
-3  1868 778 2161
-3  1804 27 2161
-3  1204 777 2162
-3  949 254 2162
-3  1626 777 2163
-3  1564 83 2163
-3  1265 776 2164
-3  1204 254 2164
-3  2136 776 2165
-3  2256 4 2165
-3  1090 775 2166
-3  950 253 2166
-3  1628 775 2167
-3  1450 82 2167
-3  1071 774 2168
-3  1090 253 2168
-3  1908 774 2169
-3  1868 27 2169
-3  1815 117 1258
-3  1813 718 1258
-3  1741 99 1259
-3  1367 719 1259
-3  2147 200 1260
-3  2145 720 1260
-3  2257 228 1261
-3  1625 721 1261
-3  1867 130 1262
-3  1865 722 1262
-3  1813 117 1263
-3  1403 723 1263
-3  2251 226 1264
-3  2249 724 1264
-3  2164 254 1265
-3  1677 725 1265
-3  1919 143 1266
-3  1917 726 1266
-3  1745 100 1267
-3  1369 727 1267
-3  2170 252 1268
-3  2172 728 1268
-3  2193 212 1269
-3  1593 729 1269
-3  1835 122 1270
-3  1833 730 1270
-3  1917 143 1271
-3  1455 731 1271
-3  2179 250 1272
-3  2228 732 1272
-3  2121 194 1273
-3  1557 733 1273
-3  1799 113 1274
-3  1797 734 1274
-3  1769 106 1275
-3  1381 735 1275
-3  2115 192 1276
-3  2113 736 1276
-3  2289 236 1277
-3  1641 737 1277
-3  1883 134 1278
-3  1881 738 1278
-3  1797 113 1279
-3  1395 739 1279
-3  2283 234 1280
-3  2281 740 1280
-3  1821 266 1281
-3  1701 741 1281
-3  1943 149 1282
-3  1941 742 1282
-3  1753 102 1283
-3  1373 743 1283
-3  1852 264 1284
-3  1854 744 1284
-3  2305 240 1285
-3  1649 745 1285
-3  1891 136 1286
-3  1889 746 1286
-3  1941 149 1287
-3  1467 747 1287
-3  2299 238 1288
-3  2297 748 1288
-3  2152 256 1289
-3  1681 749 1289
-3  1923 144 1290
-3  1921 750 1290
-3  1757 103 1291
-3  1375 751 1291
-3  2083 184 1292
-3  2081 752 1292
-3  2321 244 1293
-3  1657 753 1293
-3  1899 138 1294
-3  1897 754 1294
-3  1921 144 1295
-3  1457 755 1295
-3  2315 242 1296
-3  2313 756 1296
-3  2201 214 1297
-3  1597 757 1297
-3  1839 123 1298
-3  1837 758 1298
-3  1761 104 1299
-3  1377 759 1299
-3  2195 212 1300
-3  2193 760 1300
-3  2237 248 1301
-3  1665 761 1301
-3  1907 140 1302
-3  1905 762 1302
-3  1837 123 1303
-3  1415 763 1303
-3  2243 246 1304
-3  2247 764 1304
-3  2172 252 1305
-3  1673 765 1305
-3  1915 142 1306
-3  1913 766 1306
-3  1765 105 1307
-3  1379 767 1307
-3  2075 182 1308
-3  2073 768 1308
-3  2273 232 1309
-3  1633 769 1309
-3  1875 132 1310
-3  1873 770 1310
-3  1913 142 1311
-3  1453 771 1311
-3  2235 248 1312
-3  2237 772 1312
-3  2265 230 1313
-3  1629 773 1313
-3  1871 131 1314
-3  1869 774 1314
-3  1909 141 1315
-3  1451 775 1315
-3  2259 228 1316
-3  2257 776 1316
-3  2137 198 1317
-3  1565 777 1317
-3  1807 115 1318
-3  1805 778 1318
-3  1869 131 1319
-3  1431 779 1319
-3  2307 240 1320
-3  2305 780 1320
-3  2089 260 1321
-3  1689 781 1321
-3  1931 146 1322
-3  1929 782 1322
-3  1893 137 1323
-3  1443 783 1323
-3  1268 773 2170
-3  969 252 2170
-3  2217 218 1325
-3  1605 785 1325
-3  1847 125 1326
-3  1845 786 1326
-3  1929 146 1327
-3  1461 787 1327
-3  2110 256 1328
-3  2152 788 1328
-3  1854 264 1329
-3  1697 789 1329
-3  1939 148 1330
-3  1937 790 1330
-3  1925 145 1331
-3  1459 791 1331
-3  2099 188 1332
-3  2097 792 1332
-3  1666 773 2171
-3  1709 793 1333
-3  1628 82 2171
-3  1305 772 2172
-3  1937 148 1335
-3  1465 795 1335
-3  2012 260 1336
-3  2089 796 1336
-3  2297 238 1337
-3  1645 797 1337
-3  1887 135 1338
-3  1885 798 1338
-3  1933 147 1339
-3  1463 799 1339
-3  2291 236 1340
-3  2289 800 1340
-3  2185 210 1341
-3  1589 801 1341
-3  1831 121 1342
-3  1829 802 1342
-3  1885 135 1343
-3  1439 803 1343
-3  2227 220 1344
-3  1268 252 2172
-3  2264 772 2173
-3  2238 9 2173
-3  1092 771 2174
-3  952 251 2174
-3  1632 771 2175
-3  1452 81 2175
-3  1944 262 1348
-3  1946 808 1348
-3  1073 770 2176
-3  1092 251 2176
-3  1912 770 2177
-3  1872 26 2177
-3  1272 769 2179
-3  903 250 2179
-3  1802 54 1352
-3  2134 272 1352
-3  1203 92 1353
-3  834 272 1353
-3  1810 56 1354
-3  2150 273 1354
-3  1211 93 1355
-3  836 273 1355
-3  1534 769 2216
-3  1632 81 2216
-3  1173 768 2228
-3  1272 250 2228
-3  926 60 925
-3  2182 275 1358
-3  1227 95 1359
-3  840 275 1359
-3  1794 52 1360
-3  2118 276 1360
-3  1195 96 1361
-3  832 276 1361
-3  1842 64 1362
-3  2214 277 1362
-3  1243 97 1363
-3  844 277 1363
-3  1850 66 1364
-3  2230 278 1364
-3  1711 98 1365
-3  846 278 1365
-3  2272 768 2229
-3  2072 8 2229
-3  1259 99 1367
-3  1471 1367 331
-3  1866 70 1368
-3  2262 280 1368
-3  1267 100 1369
-3  850 280 1369
-3  1834 62 1370
-3  2198 281 1370
-3  1235 101 1371
-3  842 281 1371
-3  1882 74 1372
-3  2294 282 1372
-3  1283 102 1373
-3  854 282 1373
-3  1890 76 1374
-3  2310 283 1374
-3  1291 103 1375
-3  856 283 1375
-3  1898 78 1376
-3  2326 284 1376
-3  1299 104 1377
-3  858 284 1377
-3  1906 80 1378
-3  2232 285 1378
-3  1307 105 1379
-3  860 285 1379
-3  1874 72 1380
-3  2278 286 1380
-3  1275 106 1381
-3  852 286 1381
-3  1806 55 1382
-3  2142 287 1382
-3  1207 107 1383
-3  835 287 1383
-3  1846 65 1384
-3  2222 288 1384
-3  1247 108 1385
-3  845 288 1385
-3  1018 767 2231
-3  972 249 2231
-3  1672 767 2232
-3  1378 80 2232
-3  1830 61 1388
-3  2190 290 1388
-3  1231 110 1389
-3  841 290 1389
-3  1093 766 2233
-3  1018 249 2233
-3  1764 766 2234
-3  1912 26 2234
-3  1730 36 1392
-3  1990 292 1392
-3  1131 112 1393
-3  816 292 1393
-3  1878 73 1394
-3  2286 293 1394
-3  1279 113 1395
-3  853 293 1395
-3  1714 32 1396
-3  1958 294 1396
-3  1115 114 1397
-3  812 294 1397
-3  1774 47 1398
-3  2078 295 1398
-3  1175 115 1399
-3  827 295 1399
-3  1718 33 1400
-3  1966 296 1400
-3  1119 116 1401
-3  813 296 1401
-3  1862 69 1402
-3  2254 297 1402
-3  1263 117 1403
-3  849 297 1403
-3  1722 34 1404
-3  1974 298 1404
-3  1123 118 1405
-3  814 298 1405
-3  1312 765 2235
-3  967 248 2235
-3  1662 765 2236
-3  1672 80 2236
-3  1726 35 1408
-3  1982 300 1408
-3  1127 120 1409
-3  815 300 1409
-3  1786 50 1410
-3  2102 301 1410
-3  1187 121 1411
-3  830 301 1411
-3  1750 41 1412
-3  2030 302 1412
-3  1151 122 1413
-3  821 302 1413
-3  1902 79 1414
-3  2240 303 1414
-3  1303 123 1415
-3  859 303 1415
-3  1734 37 1416
-3  1998 304 1416
-3  1135 124 1417
-3  817 304 1417
-3  1778 48 1418
-3  2086 305 1418
-3  1179 125 1419
-3  828 305 1419
-3  1738 38 1420
-3  2006 306 1420
-3  1139 126 1421
-3  818 306 1421
-3  1301 764 2237
-3  1312 248 2237
-3  2173 764 2238
-3  2328 9 2238
-3  1742 39 1424
-3  2014 308 1424
-3  1054 763 2239
-3  819 308 1425
-3  1814 57 1426
-3  2158 309 1426
-3  1215 129 1427
-3  837 309 1427
-3  1746 40 1428
-3  2022 310 1428
-3  1147 130 1429
-3  820 310 1429
-3  1918 83 1430
-3  2155 311 1430
-3  1319 131 1431
-3  863 311 1431
-3  1770 46 1432
-3  2070 312 1432
-3  1171 132 1433
-3  826 312 1433
-3  1798 53 1434
-3  2126 313 1434
-3  1199 133 1435
-3  833 313 1435
-3  1754 42 1436
-3  2038 314 1436
-3  1155 134 1437
-3  822 314 1437
-3  1942 89 1438
-3  1789 315 1438
-3  1343 135 1439
-3  869 315 1439
-3  1758 43 1440
-3  2046 316 1440
-3  1159 136 1441
-3  823 316 1441
-3  1922 84 1442
-3  2107 317 1442
-3  1323 137 1443
-3  864 317 1443
-3  1762 44 1444
-3  2054 318 1444
-3  1163 138 1445
-3  824 318 1445
-3  1838 63 1446
-3  2206 319 1446
-3  1239 139 1447
-3  843 319 1447
-3  1766 45 1448
-3  2062 320 1448
-3  1167 140 1449
-3  825 320 1449
-3  1914 82 1450
-3  2167 321 1450
-3  1315 141 1451
-3  862 321 1451
-3  1910 81 1452
-3  2175 322 1452
-3  1311 142 1453
-3  861 322 1453
-3  1870 71 1454
-3  2270 323 1454
-3  1271 143 1455
-3  851 323 1455
-3  1894 77 1456
-3  2318 324 1456
-3  1295 144 1457
-3  857 324 1457
-3  1930 86 1458
-3  1950 325 1458
-3  1331 145 1459
-3  866 325 1459
-3  1926 85 1460
-3  2094 326 1460
-3  1327 146 1461
-3  865 326 1461
-3  1938 88 1462
-3  1824 327 1462
-3  1339 147 1463
-3  868 327 1463
-3  1934 87 1464
-3  1857 328 1464
-3  1335 148 1465
-3  867 328 1465
-3  1886 75 1466
-3  2302 329 1466
-3  1287 149 1467
-3  855 329 1467
-3  968 247 2239
-3  1664 763 2240
-3  1414 79 2240
-3  1089 762 2241
-3  1054 247 2241
-3  1836 762 2242
-3  1904 25 2242
-3  1304 761 2243
-3  1966 33 1472
-3  1962 332 1472
-3  1117 152 1473
-3  875 332 1473
-3  1986 36 1474
-3  1730 333 1474
-3  1001 153 1475
-3  880 333 1475
-3  1974 34 1476
-3  1970 334 1476
-3  1121 154 1477
-3  877 334 1477
-3  1954 32 1478
-3  1714 335 1478
-3  993 155 1479
-3  872 335 1479
-3  1982 35 1480
-3  1978 336 1480
-3  1125 156 1481
-3  879 336 1481
-3  1962 33 1482
-3  1718 337 1482
-3  995 157 1483
-3  874 337 1483
-3  1990 36 1484
-3  1986 338 1484
-3  1129 158 1485
-3  881 338 1485
-3  1970 34 1486
-3  1722 339 1486
-3  997 159 1487
-3  876 339 1487
-3  1958 32 1488
-3  1954 340 1488
-3  1113 160 1489
-3  873 340 1489
-3  1978 35 1490
-3  1726 341 1490
-3  999 161 1491
-3  878 341 1491
-3  2006 38 1492
-3  2002 342 1492
-3  1137 162 1493
-3  885 342 1493
-3  2026 41 1494
-3  1750 343 1494
-3  1011 163 1495
-3  890 343 1495
-3  2014 39 1496
-3  2010 344 1496
-3  1141 164 1497
-3  887 344 1497
-3  1994 37 1498
-3  1734 345 1498
-3  1003 165 1499
-3  882 345 1499
-3  2022 40 1500
-3  2018 346 1500
-3  1145 166 1501
-3  889 346 1501
-3  2002 38 1502
-3  1738 347 1502
-3  1005 167 1503
-3  884 347 1503
-3  2030 41 1504
-3  2026 348 1504
-3  1149 168 1505
-3  891 348 1505
-3  2010 39 1506
-3  1742 349 1506
-3  1007 169 1507
-3  886 349 1507
-3  1998 37 1508
-3  1994 350 1508
-3  1133 170 1509
-3  883 350 1509
-3  2018 40 1510
-3  1746 351 1510
-3  1009 171 1511
-3  888 351 1511
-3  2046 43 1512
-3  2042 352 1512
-3  1157 172 1513
-3  895 352 1513
-3  2066 46 1514
-3  1770 353 1514
-3  1021 173 1515
-3  900 353 1515
-3  2054 44 1516
-3  2050 354 1516
-3  1161 174 1517
-3  897 354 1517
-3  2034 42 1518
-3  1754 355 1518
-3  1013 175 1519
-3  892 355 1519
-3  2062 45 1520
-3  2058 356 1520
-3  1165 176 1521
-3  899 356 1521
-3  2042 43 1522
-3  1758 357 1522
-3  1015 177 1523
-3  894 357 1523
-3  2070 46 1524
-3  2066 358 1524
-3  1169 178 1525
-3  901 358 1525
-3  2050 44 1526
-3  1762 359 1526
-3  1017 179 1527
-3  896 359 1527
-3  2038 42 1528
-3  2034 360 1528
-3  1153 180 1529
-3  893 360 1529
-3  2058 45 1530
-3  1766 361 1530
-3  1019 181 1531
-3  898 361 1531
-3  2134 54 1532
-3  2130 362 1532
-3  1201 182 1533
-3  917 362 1533
-3  2216 81 1534
-3  1910 363 1534
-3  1091 183 1535
-3  970 363 1535
-3  2214 64 1536
-3  2210 364 1536
-3  1241 184 1537
-3  937 364 1537
-3  2314 77 1538
-3  1894 365 1538
-3  1083 185 1539
-3  962 365 1539
-3  933 246 2243
-3  1594 761 2246
-3  1664 79 2246
-3  1233 760 2247
-3  2105 85 1542
-3  1926 367 1542
-3  1099 187 1543
-3  978 367 1543
-3  2182 60 1544
-3  2178 368 1544
-3  1225 188 1545
-3  929 368 1545
-3  1945 87 1546
-3  1934 369 1546
-3  1103 189 1547
-3  982 369 1547
-3  1304 246 2247
-3  2238 760 2328
-3  2192 9 2328
-3  1016 759 2327
-3  934 245 2327
-3  1596 759 2326
-3  1376 78 2326
-3  1055 758 2325
-3  2190 61 1552
-3  2186 372 1552
-3  1229 192 1553
-3  931 372 1553
-3  2282 73 1554
-3  1878 373 1554
-3  1075 193 1555
-3  954 373 1555
-3  2278 72 1556
-3  2274 374 1556
-3  1273 194 1557
-3  953 374 1557
-3  2130 54 1558
-3  1802 375 1558
-3  1037 195 1559
-3  916 375 1559
-3  2126 53 1560
-3  2122 376 1560
-3  1197 196 1561
-3  915 376 1561
-3  2074 47 1562
-3  1774 377 1562
-3  1023 197 1563
-3  902 377 1563
-3  2155 83 1564
-3  2163 378 1564
-3  1317 198 1565
-3  975 378 1565
-3  2146 56 1566
-3  1810 379 1566
-3  1041 199 1567
-3  920 379 1567
-3  2142 55 1568
-3  2138 380 1568
-3  1205 200 1569
-3  919 380 1569
-3  2250 69 1570
-3  1862 381 1570
-3  1067 201 1571
-3  946 381 1571
-3  1016 245 2325
-3  1760 758 2324
-3  1836 25 2324
-3  1236 757 2323
-3  963 244 2323
-3  1654 757 2322
-3  1350 51 203
-3  1596 78 2322
-3  2158 57 1576
-3  1293 756 2321
-3  1236 244 2321
-3  2200 756 2320
-3  2312 3 2320
-3  1096 755 2319
-3  964 243 2319
-3  1656 755 2318
-3  1456 77 2318
-3  1085 754 2317
-3  1096 243 2317
-3  1920 754 2316
-3  2178 60 1582
-3  1896 24 2316
-3  1296 753 2315
-3  905 242 2315
-3  1538 753 2314
-3  1656 77 2314
-3  1177 752 2313
-3  1296 242 2313
-3  2098 50 1586
-3  1786 389 1586
-3  1029 209 1587
-3  908 389 1587
-3  1789 89 1588
-3  1820 390 1588
-3  1341 210 1589
-3  987 390 1589
-3  2114 52 1590
-3  1794 391 1590
-3  1033 211 1591
-3  912 391 1591
-3  2270 71 1592
-3  2266 392 1592
-3  1269 212 1593
-3  951 392 1593
-3  2246 79 1594
-3  1902 393 1594
-3  1087 213 1595
-3  966 393 1595
-3  2326 78 1596
-3  2322 394 1596
-3  1297 214 1597
-3  965 394 1597
-3  2210 64 1598
-3  1842 395 1598
-3  1057 215 1599
-3  936 395 1599
-3  2206 63 1600
-3  2202 396 1600
-3  1237 216 1601
-3  935 396 1601
-3  2082 48 1602
-3  1778 397 1602
-3  1025 217 1603
-3  904 397 1603
-3  2094 85 1604
-3  2105 398 1604
-3  1325 218 1605
-3  979 398 1605
-3  2226 66 1606
-3  1850 399 1606
-3  1061 219 1607
-3  940 399 1607
-3  2222 65 1608
-3  2218 400 1608
-3  1245 220 1609
-3  939 400 1609
-3  2320 752 2312
-3  2080 3 2312
-3  1014 751 2311
-3  976 241 2311
-3  1680 751 2310
-3  1374 76 2310
-3  1097 750 2309
-3  1014 241 2309
-3  1756 750 2308
-3  1920 24 2308
-3  1320 749 2307
-3  959 240 2307
-3  1646 749 2306
-3  1680 76 2306
-3  1285 748 2305
-3  1320 240 2305
-3  2153 748 2304
-3  2296 7 2304
-3  1043 225 1619
-3  1106 747 2303
-3  2150 56 1620
-3  2146 406 1620
-3  1209 226 1621
-3  921 406 1621
-3  2258 70 1622
-3  1866 407 1622
-3  1069 227 1623
-3  948 407 1623
-3  2254 69 1624
-3  2250 408 1624
-3  1261 228 1625
-3  947 408 1625
-3  2163 83 1626
-3  1918 409 1626
-3  1095 229 1627
-3  974 409 1627
-3  2167 82 1628
-3  2171 410 1628
-3  1313 230 1629
-3  973 410 1629
-3  2194 62 1630
-3  1834 411 1630
-3  1053 231 1631
-3  932 411 1631
-3  2175 81 1632
-3  2216 412 1632
-3  1309 232 1633
-3  971 412 1633
-3  2122 53 1634
-3  1798 413 1634
-3  1035 233 1635
-3  914 413 1635
-3  2118 52 1636
-3  2114 414 1636
-3  1193 234 1637
-3  913 414 1637
-3  2290 74 1638
-3  1882 415 1638
-3  1077 235 1639
-3  956 415 1639
-3  2286 73 1640
-3  2282 416 1640
-3  1277 236 1641
-3  955 416 1641
-3  1820 89 1642
-3  1942 417 1642
-3  1107 237 1643
-3  986 417 1643
-3  1824 88 1644
-3  1853 418 1644
-3  1337 238 1645
-3  985 418 1645
-3  2306 76 1646
-3  1890 419 1646
-3  1081 239 1647
-3  960 419 1647
-3  2302 75 1648
-3  2298 420 1648
-3  1285 240 1649
-3  959 420 1649
-3  2111 84 1650
-3  1922 421 1650
-3  1097 241 1651
-3  976 421 1651
-3  2086 48 1652
-3  2082 422 1652
-3  1177 242 1653
-3  905 422 1653
-3  2322 78 1654
-3  1898 423 1654
-3  1085 243 1655
-3  964 423 1655
-3  2318 77 1656
-3  2314 424 1656
-3  1293 244 1657
-3  963 424 1657
-3  2202 63 1658
-3  1838 425 1658
-3  1055 245 1659
-3  934 425 1659
-3  2198 62 1660
-3  2194 426 1660
-3  1233 246 1661
-3  933 426 1661
-3  2236 80 1662
-3  1906 427 1662
-3  1089 247 1663
-3  968 427 1663
-3  2240 79 1664
-3  2246 428 1664
-3  1301 248 1665
-3  967 428 1665
-3  2171 82 1666
-3  1914 429 1666
-3  1093 249 1667
-3  972 429 1667
-3  2078 47 1668
-3  2074 430 1668
-3  1173 250 1669
-3  903 430 1669
-3  2274 72 1670
-3  1874 431 1670
-3  1073 251 1671
-3  952 431 1671
-3  2232 80 1672
-3  2236 432 1672
-3  1305 252 1673
-3  969 432 1673
-3  2266 71 1674
-3  1870 433 1674
-3  1071 253 1675
-3  950 433 1675
-3  2262 70 1676
-3  2258 434 1676
-3  1265 254 1677
-3  949 434 1677
-3  2138 55 1678
-3  1806 435 1678
-3  1039 255 1679
-3  918 435 1679
-3  2310 76 1680
-3  2306 436 1680
-3  1289 256 1681
-3  961 436 1681
-3  2088 86 1682
-3  1930 437 1682
-3  1101 257 1683
-3  980 437 1683
-3  960 239 2303
-3  1648 747 2302
-3  1466 75 2302
-3  1081 746 2301
-3  2218 65 1686
-3  1846 439 1686
-3  1059 259 1687
-3  938 439 1687
-3  2107 84 1688
-3  2111 440 1688
-3  1321 260 1689
-3  977 440 1689
-3  1853 88 1690
-3  1938 441 1690
-3  1105 261 1691
-3  984 441 1691
-3  2102 50 1692
-3  2098 442 1692
-3  1185 262 1693
-3  909 442 1693
-3  1106 239 2301
-3  1940 746 2300
-3  1888 23 2300
-3  1288 745 2299
-3  1950 86 1696
-3  2088 444 1696
-3  1329 264 1697
-3  981 444 1697
-3  2298 75 1698
-3  1886 445 1698
-3  1079 265 1699
-3  958 445 1699
-3  2294 74 1700
-3  2290 446 1700
-3  1281 266 1701
-3  957 446 1701
-3  2186 61 1702
-3  1830 447 1702
-3  1051 267 1703
-3  930 447 1703
-3  1781 66 1695
-3  985 238 2299
-3  1698 745 2298
-3  1648 75 2298
-3  1337 744 2297
-3  1288 238 2297
-3  2304 744 2296
-3  1855 7 2296
-3  1857 87 1708
-3  1945 450 1708
-3  1685 1709 1349
-3  1004 450 1709
-3  1012 743 2295
-3  986 237 2295
-3  1700 743 2294
-3  1372 74 2294
-3  2132 13 1712
-3  1964 452 1712
-3  1118 92 1713
-3  1203 452 1713
-3  1478 32 1714
-3  1396 453 1714
-3  834 92 1715
-3  1118 453 1715
-3  2148 14 1716
-3  1972 454 1716
-3  1122 93 1717
-3  1211 454 1717
-3  1482 33 1718
-3  1400 455 1718
-3  836 93 1719
-3  1122 455 1719
-3  1107 742 2293
-3  1012 237 2293
-3  1752 742 2292
-3  1940 23 2292
-3  1486 34 1722
-3  1404 457 1722
-3  1256 1723 111
-3  1221 457 1723
-3  2180 16 1724
-3  1988 458 1724
-3  1130 95 1725
-3  1227 458 1725
-3  1490 35 1726
-3  1408 459 1726
-3  840 95 1727
-3  1130 459 1727
-3  2116 12 1728
-3  1956 460 1728
-3  1114 96 1729
-3  1195 460 1729
-3  1474 36 1730
-3  1392 461 1730
-3  832 96 1731
-3  1114 461 1731
-3  2212 18 1732
-3  2004 462 1732
-3  1138 97 1733
-3  1243 462 1733
-3  1498 37 1734
-3  1416 463 1734
-3  844 97 1735
-3  1138 463 1735
-3  1340 741 2291
-3  955 236 2291
-3  1736 1142 98
-3  1638 741 2290
-3  1502 38 1738
-3  1420 465 1738
-3  846 98 1739
-3  1142 465 1739
-3  2244 20 1740
-3  2020 466 1740
-3  1146 99 1741
-3  1259 466 1741
-3  1506 39 1742
-3  1424 467 1742
-3  848 99 1743
-3  1146 467 1743
-3  2260 21 1744
-3  2028 468 1744
-3  1150 100 1745
-3  1267 468 1745
-3  1510 40 1746
-3  1428 469 1746
-3  850 100 1747
-3  1150 469 1747
-3  2196 17 1748
-3  1996 470 1748
-3  1134 101 1749
-3  1235 470 1749
-3  1494 41 1750
-3  1412 471 1750
-3  842 101 1751
-3  1134 471 1751
-3  2292 23 1752
-3  2044 472 1752
-3  1158 102 1753
-3  1283 472 1753
-3  1518 42 1754
-3  1436 473 1754
-3  854 102 1755
-3  1158 473 1755
-3  2308 24 1756
-3  2052 474 1756
-3  1162 103 1757
-3  1291 474 1757
-3  1522 43 1758
-3  1440 475 1758
-3  856 103 1759
-3  1162 475 1759
-3  2324 25 1760
-3  2060 476 1760
-3  1166 104 1761
-3  1299 476 1761
-3  1526 44 1762
-3  1444 477 1762
-3  858 104 1763
-3  1166 477 1763
-3  2234 26 1764
-3  2068 478 1764
-3  1170 105 1765
-3  1307 478 1765
-3  1530 45 1766
-3  1448 479 1766
-3  860 105 1767
-3  1170 479 1767
-3  2276 22 1768
-3  2036 480 1768
-3  1154 106 1769
-3  1275 480 1769
-3  1514 46 1770
-3  1432 481 1770
-3  852 106 1771
-3  1154 481 1771
-3  2140 13 1772
-3  2132 482 1772
-3  1202 107 1773
-3  1207 482 1773
-3  1562 47 1774
-3  1398 483 1774
-3  835 107 1775
-3  1202 483 1775
-3  2220 18 1776
-3  2212 484 1776
-3  1242 108 1777
-3  1247 484 1777
-3  1602 48 1778
-3  1418 485 1778
-3  845 108 1779
-3  1242 485 1779
-3  1700 74 2290
-3  1277 740 2289
-3  1340 236 2289
-3  1822 740 2288
-3  2280 2 2288
-3  1034 739 2287
-3  956 235 2287
-3  1640 739 2286
-3  2188 16 1784
-3  2180 488 1784
-3  1226 110 1785
-3  1231 488 1785
-3  1586 50 1786
-3  1410 489 1786
-3  841 110 1787
-3  1226 489 1787
-3  1394 73 2286
-3  1077 738 2285
-3  1034 235 2285
-3  1796 738 2284
-3  1880 22 2284
-3  1280 737 2283
-3  913 234 2283
-3  1554 737 2282
-3  1988 16 1792
-3  2188 492 1792
-3  1230 112 1793
-3  1131 492 1793
-3  1590 52 1794
-3  1360 493 1794
-3  816 112 1795
-3  1230 493 1795
-3  2284 22 1796
-3  2276 494 1796
-3  1274 113 1797
-3  1279 494 1797
-3  1634 53 1798
-3  1434 495 1798
-3  853 113 1799
-3  1274 495 1799
-3  1956 12 1800
-3  2124 496 1800
-3  1198 114 1801
-3  1115 496 1801
-3  1558 54 1802
-3  1352 497 1802
-3  812 114 1803
-3  1198 497 1803
-3  2076 27 1804
-3  2161 498 1804
-3  1318 115 1805
-3  1175 498 1805
-3  1678 55 1806
-3  1382 499 1806
-3  827 115 1807
-3  1318 499 1807
-3  1964 13 1808
-3  2140 500 1808
-3  1206 116 1809
-3  1119 500 1809
-3  1566 56 1810
-3  1354 501 1810
-3  813 116 1811
-3  1206 501 1811
-3  2252 20 1812
-3  2244 502 1812
-3  1258 117 1813
-3  1263 502 1813
-3  1572 57 307
-3  1426 503 1814
-3  849 117 1815
-3  1258 503 1815
-3  1972 14 1816
-3  2156 504 1816
-3  1214 118 1817
-3  1123 504 1817
-3  1640 73 2282
-3  1193 736 2281
-3  814 118 1819
-3  1214 505 1819
-3  1280 234 2281
-3  2288 736 2280
-3  2112 2 2280
-3  1020 735 2279
-3  914 233 2279
-3  1556 735 2278
-3  1380 72 2278
-3  1035 734 2277
-3  1020 233 2277
-3  1768 734 2276
-3  1796 22 2276
-3  927 1127 508
-3  1220 60 49
-3  1196 733 2275
-3  815 120 1827
-3  971 232 2275
-3  2100 30 1828
-3  1791 510 1828
-3  1342 121 1829
-3  1187 510 1829
-3  1702 61 1830
-3  1388 511 1830
-3  830 121 1831
-3  1342 511 1831
-3  2028 21 1832
-3  2268 512 1832
-3  1270 122 1833
-3  1151 512 1833
-3  1630 62 1834
-3  1370 513 1834
-3  821 122 1835
-3  1270 513 1835
-3  2242 25 1836
-3  2324 514 1836
-3  1298 123 1837
-3  1303 514 1837
-3  1658 63 1838
-3  1446 515 1838
-3  859 123 1839
-3  1298 515 1839
-3  1996 17 1840
-3  2204 516 1840
-3  1238 124 1841
-3  1135 516 1841
-3  1598 64 1842
-3  1362 517 1842
-3  817 124 1843
-3  1238 517 1843
-3  2084 28 1844
-3  2096 518 1844
-3  1326 125 1845
-3  1179 518 1845
-3  1686 65 1846
-3  1384 519 1846
-3  828 125 1847
-3  1326 519 1847
-3  2004 18 1848
-3  2220 520 1848
-3  1246 126 1849
-3  1139 520 1849
-3  1606 66 1850
-3  1364 521 1850
-3  818 126 1851
-3  1246 521 1851
-3  1670 733 2274
-3  1556 72 2274
-3  1309 732 2273
-3  1196 232 2273
-3  2120 732 2272
-3  2229 8 2272
-3  1094 731 2271
-3  932 231 2271
-3  1592 731 2270
-3  1454 71 2270
-3  1053 730 2269
-3  1094 231 2269
-3  1916 730 2268
-3  1832 21 2268
-3  1232 729 2267
-3  973 230 2267
-3  2156 14 1860
-3  2148 526 1860
-3  1210 129 1861
-3  1215 526 1861
-3  1570 69 1862
-3  1402 527 1862
-3  837 129 1863
-3  1210 527 1863
-3  2020 20 1864
-3  2252 528 1864
-3  1262 130 1865
-3  1147 528 1865
-3  1622 70 1866
-3  1368 529 1866
-3  820 130 1867
-3  1262 529 1867
-3  2161 27 1868
-3  2169 530 1868
-3  1314 131 1869
-3  1319 530 1869
-3  1674 71 1870
-3  1454 531 1870
-3  863 131 1871
-3  1314 531 1871
-3  2068 26 1872
-3  2177 532 1872
-3  1310 132 1873
-3  1171 532 1873
-3  1670 72 1874
-3  1380 533 1874
-3  826 132 1875
-3  1310 533 1875
-3  2124 12 1876
-3  2116 534 1876
-3  1194 133 1877
-3  1199 534 1877
-3  1554 73 1878
-3  1394 535 1878
-3  833 133 1879
-3  1194 535 1879
-3  2036 22 1880
-3  2284 536 1880
-3  1278 134 1881
-3  1155 536 1881
-3  1638 74 1882
-3  1372 537 1882
-3  822 134 1883
-3  1278 537 1883
-3  1791 30 1884
-3  1826 538 1884
-3  1338 135 1885
-3  1343 538 1885
-3  1698 75 1886
-3  1466 539 1886
-3  869 135 1887
-3  1338 539 1887
-3  2044 23 1888
-3  2300 540 1888
-3  1286 136 1889
-3  1159 540 1889
-3  1646 76 1890
-3  1374 541 1890
-3  823 136 1891
-3  1286 541 1891
-3  2109 28 1892
-3  2084 542 1892
-3  1178 137 1893
-3  1323 542 1893
-3  1538 77 1894
-3  1456 543 1894
-3  864 137 1895
-3  1178 543 1895
-3  2052 24 1896
-3  2316 544 1896
-3  1294 138 1897
-3  1163 544 1897
-3  1654 78 1898
-3  1376 545 1898
-3  824 138 1899
-3  1294 545 1899
-3  2204 17 1900
-3  2196 546 1900
-3  1234 139 1901
-3  1239 546 1901
-3  1594 79 1902
-3  1414 547 1902
-3  843 139 1903
-3  1234 547 1903
-3  2060 25 1904
-3  2242 548 1904
-3  1302 140 1905
-3  1167 548 1905
-3  1662 80 1906
-3  1378 549 1906
-3  825 140 1907
-3  1302 549 1907
-3  2169 27 1908
-3  2076 550 1908
-3  1174 141 1909
-3  1315 550 1909
-3  1534 81 1910
-3  1452 551 1910
-3  862 141 1911
-3  1174 551 1911
-3  2177 26 1912
-3  2234 552 1912
-3  1306 142 1913
-3  1311 552 1913
-3  1666 82 1914
-3  1450 553 1914
-3  861 142 1915
-3  1306 553 1915
-3  2268 21 1916
-3  2260 554 1916
-3  1266 143 1917
-3  1271 554 1917
-3  1626 83 1918
-3  1430 555 1918
-3  851 143 1919
-3  1266 555 1919
-3  2316 24 1920
-3  2308 556 1920
-3  1290 144 1921
-3  1295 556 1921
-3  1650 84 1922
-3  1442 557 1922
-3  857 144 1923
-3  1290 557 1923
-3  1980 29 1924
-3  2092 558 1924
-3  1182 145 1925
-3  1331 558 1925
-3  1542 85 1926
-3  1460 559 1926
-3  866 145 1927
-3  1182 559 1927
-3  2096 28 1928
-3  2109 560 1928
-3  1322 146 1929
-3  1327 560 1929
-3  1682 86 1930
-3  1458 561 1930
-3  865 146 1931
-3  1322 561 1931
-3  1826 30 1932
-3  2100 562 1932
-3  1186 147 1933
-3  1339 562 1933
-3  1546 87 1934
-3  1464 563 1934
-3  868 147 1935
-3  1186 563 1935
-3  1859 29 1936
-3  1980 564 1936
-3  1330 148 1937
-3  1335 564 1937
-3  1690 88 1938
-3  1462 565 1938
-3  867 148 1939
-3  1330 565 1939
-3  2300 23 1940
-3  2292 566 1940
-3  1282 149 1941
-3  1287 566 1941
-3  1642 89 1942
-3  1438 567 1942
-3  855 149 1943
-3  1282 567 1943
-3  1674 729 2266
-3  1592 71 2266
-3  1313 728 2265
-3  1232 230 2265
-3  2192 728 2264
-3  2173 9 2264
-3  1008 727 2263
-3  974 229 2263
-3  2092 29 1948
-3  1859 570 1948
-3  1676 727 2262
-3  1368 70 2262
-3  1095 726 2261
-3  1008 229 2261
-3  1744 726 2260
-3  1916 21 2260
-3  1960 0 1952
-3  1984 572 1952
-3  1128 152 1953
-3  1117 572 1953
-3  1488 32 1954
-3  1478 573 1954
-3  875 152 1955
-3  1128 573 1955
-3  1728 12 1956
-3  1800 574 1956
-3  1036 153 1957
-3  1001 574 1957
-3  1396 32 1958
-3  1488 575 1958
-3  880 153 1959
-3  1036 575 1959
-3  1968 0 1960
-3  1952 576 1960
-3  1112 154 1961
-3  1121 576 1961
-3  1472 33 1962
-3  1482 577 1962
-3  877 154 1963
-3  1112 577 1963
-3  1712 13 1964
-3  1808 578 1964
-3  1040 155 1965
-3  993 578 1965
-3  1400 33 1966
-3  1472 579 1966
-3  872 155 1967
-3  1040 579 1967
-3  1976 0 1968
-3  1960 580 1968
-3  1116 156 1969
-3  1125 580 1969
-3  1476 34 1970
-3  1486 581 1970
-3  879 156 1971
-3  1116 581 1971
-3  1716 14 1972
-3  1816 582 1972
-3  1044 157 1973
-3  995 582 1973
-3  1404 34 1974
-3  1476 583 1974
-3  874 157 1975
-3  1044 583 1975
-3  1984 0 1976
-3  1968 584 1976
-3  1120 158 1977
-3  1129 584 1977
-3  1480 35 1978
-3  1490 585 1978
-3  881 158 1979
-3  1120 585 1979
-3  1316 725 2259
-3  947 228 2259
-3  1048 159 1981
-3  1222 1981 682
-3  1408 35 1982
-3  1480 587 1982
-3  876 159 1983
-3  1048 587 1983
-3  1952 0 1984
-3  1976 588 1984
-3  1124 160 1985
-3  1113 588 1985
-3  1484 36 1986
-3  1474 589 1986
-3  873 160 1987
-3  1124 589 1987
-3  1724 16 1988
-3  1792 590 1988
-3  1032 161 1989
-3  999 590 1989
-3  1392 36 1990
-3  1484 591 1990
-3  878 161 1991
-3  1032 591 1991
-3  2000 1 1992
-3  2024 592 1992
-3  1148 162 1993
-3  1137 592 1993
-3  1508 37 1994
-3  1498 593 1994
-3  885 162 1995
-3  1148 593 1995
-3  1748 17 1996
-3  1840 594 1996
-3  1056 163 1997
-3  1011 594 1997
-3  1416 37 1998
-3  1508 595 1998
-3  890 163 1999
-3  1056 595 1999
-3  2008 1 2000
-3  1992 596 2000
-3  1132 164 2001
-3  1141 596 2001
-3  1492 38 2002
-3  1502 597 2002
-3  887 164 2003
-3  1132 597 2003
-3  1732 18 2004
-3  1848 598 2004
-3  1060 165 2005
-3  1003 598 2005
-3  1420 38 2006
-3  1492 599 2006
-3  882 165 2007
-3  1060 599 2007
-3  2016 1 2008
-3  2000 600 2008
-3  1136 166 2009
-3  1145 600 2009
-3  1496 39 2010
-3  1506 601 2010
-3  889 166 2011
-3  1136 601 2011
-3  1622 725 2258
-3  1676 70 2258
-3  1064 167 2013
-3  1005 602 2013
-3  1424 39 2014
-3  1496 603 2014
-3  884 167 2015
-3  1064 603 2015
-3  2024 1 2016
-3  2008 604 2016
-3  1140 168 2017
-3  1149 604 2017
-3  1500 40 2018
-3  1510 605 2018
-3  891 168 2019
-3  1140 605 2019
-3  1740 20 2020
-3  1864 606 2020
-3  1068 169 2021
-3  1007 606 2021
-3  1428 40 2022
-3  1500 607 2022
-3  886 169 2023
-3  1068 607 2023
-3  1992 1 2024
-3  2016 608 2024
-3  1144 170 2025
-3  1133 608 2025
-3  1504 41 2026
-3  1494 609 2026
-3  883 170 2027
-3  1144 609 2027
-3  1744 21 2028
-3  1832 610 2028
-3  1052 171 2029
-3  1009 610 2029
-3  1412 41 2030
-3  1504 611 2030
-3  888 171 2031
-3  1052 611 2031
-3  2040 5 2032
-3  2064 612 2032
-3  1168 172 2033
-3  1157 612 2033
-3  1528 42 2034
-3  1518 613 2034
-3  895 172 2035
-3  1168 613 2035
-3  1768 22 2036
-3  1880 614 2036
-3  1076 173 2037
-3  1021 614 2037
-3  1436 42 2038
-3  1528 615 2038
-3  900 173 2039
-3  1076 615 2039
-3  2048 5 2040
-3  2032 616 2040
-3  1152 174 2041
-3  1161 616 2041
-3  1512 43 2042
-3  1522 617 2042
-3  897 174 2043
-3  1152 617 2043
-3  1752 23 2044
-3  1888 618 2044
-3  1080 175 2045
-3  1013 618 2045
-3  1440 43 2046
-3  1512 619 2046
-3  892 175 2047
-3  1080 619 2047
-3  2056 5 2048
-3  2040 620 2048
-3  1156 176 2049
-3  1165 620 2049
-3  1516 44 2050
-3  1526 621 2050
-3  899 176 2051
-3  1156 621 2051
-3  1756 24 2052
-3  1896 622 2052
-3  1084 177 2053
-3  1015 622 2053
-3  1444 44 2054
-3  1516 623 2054
-3  894 177 2055
-3  1084 623 2055
-3  2064 5 2056
-3  2048 624 2056
-3  1160 178 2057
-3  1169 624 2057
-3  1520 45 2058
-3  1530 625 2058
-3  901 178 2059
-3  1160 625 2059
-3  1760 25 2060
-3  1904 626 2060
-3  1088 179 2061
-3  1017 626 2061
-3  1448 45 2062
-3  1520 627 2062
-3  896 179 2063
-3  1088 627 2063
-3  2032 5 2064
-3  2056 628 2064
-3  1164 180 2065
-3  1153 628 2065
-3  1524 46 2066
-3  1514 629 2066
-3  893 180 2067
-3  1164 629 2067
-3  1764 26 2068
-3  1872 630 2068
-3  1072 181 2069
-3  1019 630 2069
-3  1432 46 2070
-3  1524 631 2070
-3  898 181 2071
-3  1072 631 2071
-3  2128 8 2072
-3  2229 632 2072
-3  1308 182 2073
-3  1201 632 2073
-3  1668 47 2074
-3  1562 633 2074
-3  917 182 2075
-3  1308 633 2075
-3  1908 27 2076
-3  1804 634 2076
-3  1038 183 2077
-3  1091 634 2077
-3  1398 47 2078
-3  1668 635 2078
-3  970 183 2079
-3  1038 635 2079
-3  2208 3 2080
-3  2312 636 2080
-3  1292 184 2081
-3  1241 636 2081
-3  1652 48 2082
-3  1602 637 2082
-3  937 184 2083
-3  1292 637 2083
-3  1892 28 2084
-3  1844 638 2084
-3  1058 185 2085
-3  1083 638 2085
-3  1418 48 2086
-3  1652 639 2086
-3  962 185 2087
-3  1058 639 2087
-3  1261 724 2257
-3  1316 228 2257
-3  2165 724 2256
-3  2248 4 2256
-3  1042 723 2255
-3  948 227 2255
-3  1624 723 2254
-3  1402 69 2254
-3  1924 29 2092
-3  1948 642 2092
-3  1407 2093 523
-3  1099 642 2093
-3  1069 722 2253
-3  1042 227 2253
-3  1706 187 443
-3  1812 722 2252
-3  1864 20 2252
-3  1264 721 2251
-3  1332 188 2097
-3  1255 2097 1225
-3  1692 50 2098
-3  1586 645 2098
-3  929 188 2099
-3  1332 645 2099
-3  1932 30 2100
-3  1828 646 2100
-3  1050 189 2101
-3  1103 646 2101
-3  1410 50 2102
-3  1692 647 2102
-3  982 189 2103
-3  1050 647 2103
-3  921 226 2251
-3  1570 721 2250
-3  1624 69 2250
-3  1209 720 2249
-3  1264 226 2249
-3  2256 720 2248
-3  2144 4 2248
-3  1585 405 719
-3  1043 718 2245
-3  1006 225 2245
-3  1740 718 2244
-3  1812 20 2244
-3  1364 66 2230
-3  1344 709 2227
-3  939 220 2227
-3  1606 709 2226
-3  2184 2 2112
-3  2280 652 2112
-3  1276 192 2113
-3  1229 652 2113
-3  1636 52 2114
-3  1590 653 2114
-3  931 192 2115
-3  1276 653 2115
-3  1876 12 2116
-3  1728 654 2116
-3  1000 193 2117
-3  1075 654 2117
-3  1360 52 2118
-3  1636 655 2118
-3  954 193 2119
-3  1000 655 2119
-3  2272 8 2120
-3  2128 656 2120
-3  1200 194 2121
-3  1273 656 2121
-3  1560 53 2122
-3  1634 657 2122
-3  953 194 2123
-3  1200 657 2123
-3  1800 12 2124
-3  1876 658 2124
-3  1074 195 2125
-3  1037 658 2125
-3  1434 53 2126
-3  1560 659 2126
-3  916 195 2127
-3  1074 659 2127
-3  2120 8 2128
-3  2072 660 2128
-3  1172 196 2129
-3  1197 660 2129
-3  1532 54 2130
-3  1558 661 2130
-3  915 196 2131
-3  1172 661 2131
-3  1772 13 2132
-3  1712 662 2132
-3  992 197 2133
-3  1023 662 2133
-3  1352 54 2134
-3  1532 663 2134
-3  902 197 2135
-3  992 663 2135
-3  2165 4 2136
-3  2144 664 2136
-3  1208 198 2137
-3  1317 664 2137
-3  1568 55 2138
-3  1678 665 2138
-3  975 198 2139
-3  1208 665 2139
-3  1808 13 2140
-3  1772 666 2140
-3  1022 199 2141
-3  1041 666 2141
-3  1382 55 2142
-3  1568 667 2142
-3  920 199 2143
-3  1022 667 2143
-3  2136 4 2144
-3  2248 668 2144
-3  1260 200 2145
-3  1205 668 2145
-3  1620 56 2146
-3  1566 669 2146
-3  919 200 2147
-3  1260 669 2147
-3  1860 14 2148
-3  1716 670 2148
-3  994 201 2149
-3  1067 670 2149
-3  1354 56 2150
-3  1620 671 2150
-3  946 201 2151
-3  994 671 2151
-3  1705 66 2226
-3  1245 708 2225
-3  1344 220 2225
-3  1783 708 2224
-3  1704 1576 383
-3  1024 707 2223
-3  940 219 2223
-3  1608 707 2222
-3  1816 14 2156
-3  1860 674 2156
-3  1066 203 2157
-3  1045 674 2157
-3  1426 57 2158
-3  1576 675 2158
-3  1468 203 58
-3  1066 675 2159
-3  1384 65 2222
-3  1061 706 2221
-3  1024 219 2221
-3  1776 706 2220
-3  1848 18 2220
-3  1248 705 2219
-3  979 218 2219
-3  1686 705 2218
-3  1608 65 2218
-3  1325 704 2217
-3  1248 218 2217
-3  1573 704 1540
-3  1002 703 2215
-3  904 217 2215
-3  1536 703 2214
-3  1362 64 2214
-3  1025 702 2213
-3  1002 217 2213
-3  1732 702 2212
-3  1776 18 2212
-3  1176 701 2211
-3  935 216 2211
-3  1598 701 2210
-3  1536 64 2210
-3  1237 700 2209
-3  1176 216 2209
-3  2080 700 2208
-3  2200 3 2208
-3  1086 699 2207
-3  936 215 2207
-3  1600 699 2206
-3  1446 63 2206
-3  1057 698 2205
-3  1086 215 2205
-3  1900 698 2204
-3  1840 17 2204
-3  1544 60 2178
-3  1582 685 2178
-3  1240 697 2203
-3  965 214 2203
-3  1784 16 2180
-3  1724 686 2180
-3  998 209 2181
-3  1029 686 2181
-3  1358 60 2182
-3  1544 687 2182
-3  908 209 2183
-3  998 687 2183
-3  1822 2 2184
-3  2112 688 2184
-3  1192 210 2185
-3  1341 688 2185
-3  1552 61 2186
-3  1702 689 2186
-3  987 210 2187
-3  1192 689 2187
-3  1792 16 2188
-3  1784 690 2188
-3  1028 211 2189
-3  1033 690 2189
-3  1388 61 2190
-3  1552 691 2190
-3  912 211 2191
-3  1028 691 2191
-3  2264 9 2192
-3  2328 692 2192
-3  1300 212 2193
-3  1269 692 2193
-3  1660 62 2194
-3  1630 693 2194
-3  951 212 2195
-3  1300 693 2195
-3  1900 17 2196
-3  1748 694 2196
-3  1010 213 2197
-3  1087 694 2197
-3  1370 62 2198
-3  1660 695 2198
-3  966 213 2199
-3  1010 695 2199
-3  2320 3 2200
-3  2208 696 2200
-3  1240 214 2201
-3  1297 696 2201
-3  1600 63 2202
-3  1658 697 2202
+0.27219661039719134 -0.89987434907152952 0.34005641981910195
+0.27399725512977036 -0.89741802080743249 0.34558774394436154
+0.2679128793459149 -0.90549608434201145 0.32699007860623508
+0.26758089404998364 -0.90597288936521869 0.32585692434233743
+0.26660413751883816 -0.90759811547986069 0.32187126056253501
+0.25697201819559901 -0.92432848622760766 0.28050566540029309
+0.25313054028719528 -0.92991689161909552 0.26460466631117985
+0.25308933658097965 -0.92998804508785282 0.26439588316448515
+0.24930895838975131 -0.93567470552212895 0.24579255546759948
+0.24336599009814622 -0.94602936533555493 0.21094260961626568
+0.24152064540259124 -0.9485706826100101 0.20072208160320942
+0.2389405724498605 -0.95306848001363997 0.18186355091081885
+0.23440017510432309 -0.9594775020158709 0.15035899655759535
+0.23294949527472616 -0.96194916611186088 0.13775142693846476
+0.23259475183323847 -0.96237493457550005 0.13494008765512316
+0.23052646968895496 -0.96592607882051262 0.10986054425367281
+0.22988186145330614 -0.96732927410114633 0.099634331047451258
+0.22762677949308696 -0.97053761901938218 0.067701629511043929
+0.22743420727478347 -0.97114863140943242 0.060907607905721757
+0.22648000271342916 -0.97241808576487498 0.034988854233130681
+0.22628605152906522 -0.97313250261608553 0.01853460685588823
+0.22589145876869662 -0.97323020415808847 -0
+0.22628605152906522 -0.97313250261608553 -0.01853460685588823
+0.22648000271342922 -0.97241808576487498 -0.034988854233130834
+0.2274342072747835 -0.97114863140943242 -0.060907607905721785
+0.22762677949308691 -0.97053761901938207 -0.067701629511043929
+0.22988186145330608 -0.96732927410114655 -0.09963433104745123
+0.23052646968895496 -0.96592607882051251 -0.10986054425367295
+0.23259475183323847 -0.96237493457549972 -0.13494008765512314
+0.23294949527472619 -0.96194916611186088 -0.13775142693846473
+0.23440017510432298 -0.95947750201587068 -0.15035899655759499
+0.23894057244986044 -0.95306848001363997 -0.18186355091081888
+0.24152064540259116 -0.94857068261000999 -0.2007220816032094
+0.24336599009814619 -0.94602936533555493 -0.21094260961626565
+0.24930895838975131 -0.93567470552212884 -0.24579255546759954
+0.2530893365809796 -0.92998804508785282 -0.26439588316448515
+0.25313054028719528 -0.92991689161909541 -0.26460466631117996
+0.25697201819559901 -0.92432848622760766 -0.28050566540029298
+0.26660413751883794 -0.90759811547986147 -0.32187126056253368
+0.26758089404998375 -0.9059728893652188 -0.32585692434233748
+0.26791287934591512 -0.90549608434201145 -0.32699007860623563
+0.27219661039719123 -0.89987434907152986 -0.34005641981910134
+0.27399725512977041 -0.89741802080743249 -0.34558774394436126
+0.27461092234606044 -0.89644305776905853 -0.34753041451074085
+0.28617291708332143 -0.87638371280443894 -0.38483791504434917
+0.29057971437418995 -0.8695923485436825 -0.39708487175152696
+0.29401138453262826 -0.86471241548978539 -0.40567809407889899
+0.30362145533065937 -0.84916410602320314 -0.43023759412454321
+0.30729748704039861 -0.84278707285381271 -0.43974499787970978
+0.31474205002823552 -0.83109069623026088 -0.45671715648324696
+0.31682936237190801 -0.8280363774210906 -0.46105412139556579
+0.32993533901945349 -0.80654749644509327 -0.4886330537542477
+0.3395133710973568 -0.79211156275892003 -0.50664961250726259
+0.34177771381313393 -0.78887113359859207 -0.51061830246204121
+0.34243159318633287 -0.78789291377908466 -0.51176714118576783
+0.34288899659372696 -0.78713443636827329 -0.51257565524045923
+0.35314170479917451 -0.76928684914828649 -0.53075413092765567
+0.36517401588679066 -0.75 -0.5497573450331017
+0.36998650939197825 -0.74269333684247574 -0.5567855194421365
+0.37506412073313466 -0.73422479552976916 -0.56417193374348928
+0.39411849558532475 -0.7042679462719752 -0.58956860097969033
+0.39895802436542988 -0.69687753315555612 -0.5957410107715313
+0.40036321981550371 -0.69465247190942381 -0.5975302451883705
+0.40065939257699101 -0.69413734830776352 -0.5979056290568221
+0.40151480227572495 -0.69274920908571347 -0.59888293763788791
+0.40435813432554835 -0.6879005781223142 -0.60211592452938867
+0.42861413394522363 -0.64891100701386617 -0.62717432611494861
+0.4331208322019765 -0.64210794890239153 -0.63136143448574877
+0.44633019100468196 -0.62042776846682712 -0.64334361719230815
+0.4546732585899762 -0.60749293870920396 -0.65018159643527595
+0.45944041532897179 -0.59972505245462004 -0.65399889841309111
+0.46796403496887884 -0.58666916470964625 -0.66003296952840651
+0.4897853260968788 -0.55056521742650477 -0.67476755984413883
+0.49314081475211935 -0.54531814984023852 -0.67677227421098896
+0.5039242293873103 -0.52945918848859996 -0.68235511400187066
+0.50468001700647158 -0.52828837108788052 -0.68272481536695295
+0.50622685812276502 -0.52571510245600428 -0.68341702461536269
+0.50787822903713031 -0.52299793234814496 -0.68413337702600852
+0.52912853141459681 -0.48757002987147358 -0.69320320770179844
+0.53310523682898858 -0.48133611427487955 -0.69462568959831961
+0.54306000239317154 -0.46664565776233691 -0.69755165300174249
+0.5493198212532957 -0.45674068614295493 -0.69911600851089584
+0.56731181848165257 -0.42664579118104862 -0.70294074606773127
+0.57556494808430081 -0.41363385795819674 -0.70422028778974766
+0.58303192413334481 -0.40257317574481138 -0.70495163176324016
+0.59214384399202524 -0.38815954298187871 -0.70538094374692584
+0.6078561560079746 -0.36184045701812118 -0.70538094374692584
+0.61696807586665503 -0.34742682425518878 -0.70495163176324016
+0.62443505191569915 -0.33636614204180315 -0.70422028778974766
+0.63268818151834738 -0.32335420881895127 -0.70294074606773105
+0.65068017874670414 -0.29325931385704507 -0.69911600851089584
+0.6569399976068282 -0.28335434223766326 -0.69755165300174249
+0.66689476317101137 -0.26866388572512034 -0.69462568959831961
+0.67087146858540314 -0.2624299701285262 -0.69320320770179855
+0.69212177096286942 -0.22700206765185557 -0.68413337702600874
+0.69377314187723493 -0.22428489754399594 -0.68341702461536258
+0.69531998299352837 -0.2217116289121196 -0.68272481536695306
+0.69607577061268988 -0.22054081151140006 -0.68235511400187066
+0.70685918524788072 -0.20468185015976154 -0.67677227421098896
+0.71021467390312099 -0.19943478257349526 -0.67476755984413894
+0.73203596503112101 -0.16333083529035375 -0.66003296952840662
+0.74055958467102845 -0.15027494754537968 -0.65399889841309089
+0.74532674141002375 -0.14250706129079624 -0.65018159643527618
+0.75366980899531777 -0.12957223153317302 -0.64334361719230837
+0.76687916779802356 -0.10789205109760858 -0.63136143448574888
+0.77138586605477633 -0.1010889929861338 -0.62717432611494872
+0.79564186567445128 -0.06209942187768587 -0.60211592452938889
+0.79848519772427506 -0.057250790914286004 -0.59888293763788769
+0.79934060742300872 -0.055862651692236032 -0.59790562905682221
+0.79963678018449613 -0.055347528090576067 -0.59753024518837083
+0.80104197563456991 -0.053122466844444029 -0.59574101077153174
+0.80588150441467521 -0.045732053728024212 -0.58956860097968999
+0.82493587926686529 -0.015775204470230772 -0.56417193374348928
+0.83001349060802165 -0.0073066631575244411 -0.55678551944213672
+0.8348259841132093 -6.1457978060811826e-19 -0.5497573450331017
+0.84685829520082545 0.019286849148286479 -0.53075413092765555
+0.85711100340627278 0.037134436368273155 -0.51257565524045934
+0.85756840681366708 0.037892913779084561 -0.51176714118576794
+0.85822228618686602 0.038871133598591998 -0.51061830246204143
+0.86048662890264316 0.042111562758920099 -0.50664961250726259
+0.87006466098054647 0.056547496445093395 -0.48863305375424759
+0.88317063762809189 0.078036377421090597 -0.46105412139556579
+0.88525794997176432 0.081090696230260814 -0.45671715648324701
+0.89270251295960135 0.092787072853812741 -0.43974499787970978
+0.89637854466934042 0.099164106023202886 -0.43023759412454343
+0.90598861546737153 0.11471241548978532 -0.40567809407889888
+0.9094202856258099 0.11959234854368263 -0.39708487175152668
+0.91382708291667858 0.12638371280443889 -0.38483791504434905
+0.9253890776539393 0.14644305776905842 -0.34753041451074107
+0.92600274487022949 0.14741802080743258 -0.34558774394436131
+0.92780338960280884 0.14987434907153013 -0.34005641981910084
+0.93208712065408494 0.15549608434201162 -0.32699007860623541
+0.9324191059500162 0.15597288936521903 -0.32585692434233743
+0.93339586248116191 0.15759811547986141 -0.32187126056253423
+0.94302798180440084 0.17432848622760777 -0.2805056654002932
+0.94686945971280467 0.17991689161909563 -0.26460466631117985
+0.94691066341902053 0.17998804508785299 -0.26439588316448503
+0.95069104161024875 0.18567470552212903 -0.24579255546759926
+0.95663400990185365 0.19602936533555493 -0.21094260961626565
+0.95847935459740874 0.19857068261001024 -0.20072208160320937
+0.9610594275501394 0.20306848001363986 -0.18186355091081907
+0.96559982489567697 0.20947750201587081 -0.15035899655759494
+0.96705050472527398 0.21194916611186077 -0.13775142693846465
+0.96740524816676143 0.21237493457549977 -0.13494008765512311
+0.96947353031104488 0.21592607882051251 -0.10986054425367317
+0.97011813854669371 0.2173292741011463 -0.099634331047451508
+0.97237322050691288 0.2205376190193819 -0.067701629511043915
+0.97256579272521626 0.22114863140943242 -0.060907607905721556
+0.97351999728657068 0.22241808576487493 -0.034988854233130418
+0.97371394847093473 0.22313250261608547 -0.018534606855888307
+0.9741085412313033 0.22323020415808842 -0
+0.97371394847093473 0.22313250261608547 0.018534606855888314
+0.97351999728657068 0.22241808576487493 0.034988854233130445
+0.97256579272521648 0.22114863140943247 0.060907607905721736
+0.97237322050691288 0.22053761901938193 0.067701629511043915
+0.9701181385466936 0.21732927410114636 0.099634331047451369
+0.96947353031104511 0.21592607882051257 0.10986054425367309
+0.96740524816676143 0.21237493457549983 0.13494008765512311
+0.96705050472527376 0.21194916611186071 0.13775142693846484
+0.96559982489567697 0.20947750201587079 0.15035899655759488
+0.9610594275501394 0.20306848001363986 0.18186355091081891
+0.95847935459740885 0.19857068261001021 0.20072208160320931
+0.95663400990185365 0.1960293653355549 0.21094260961626565
+0.95069104161024875 0.185674705522129 0.24579255546759909
+0.94691066341902042 0.17998804508785277 0.2643958831644852
+0.94686945971280478 0.17991689161909552 0.26460466631117979
+0.94302798180440095 0.1743284862276076 0.2805056654002932
+0.93339586248116191 0.15759811547986138 0.32187126056253412
+0.93241910595001631 0.15597288936521894 0.32585692434233732
+0.93208712065408506 0.15549608434201159 0.3269900786062353
+0.92780338960280884 0.14987434907153008 0.34005641981910095
+0.92600274487022949 0.1474180208074326 0.34558774394436137
+0.92538907765393941 0.14644305776905847 0.34753041451074107
+0.91382708291667858 0.12638371280443894 0.38483791504434894
+0.9094202856258099 0.11959234854368264 0.39708487175152674
+0.90598861546737153 0.11471241548978531 0.40567809407889893
+0.89637854466934042 0.099164106023202803 0.43023759412454371
+0.89270251295960135 0.092787072853812713 0.43974499787970978
+0.88525794997176432 0.0810906962302608 0.4567171564832469
+0.88317063762809189 0.078036377421090528 0.46105412139556584
+0.87006466098054647 0.056547496445093395 0.48863305375424759
+0.86048662890264316 0.042111562758920092 0.50664961250726259
+0.85822228618686625 0.038871133598592303 0.51061830246204098
+0.85756840681366708 0.037892913779084658 0.51176714118576783
+0.85711100340627278 0.037134436368273058 0.51257565524045945
+0.84685829520082545 0.019286849148286413 0.53075413092765555
+0.83482598411320952 6.1457978060812172e-19 0.54975734503310147
+0.83001349060802176 -0.0073066631575244463 0.55678551944213661
+0.82493587926686529 -0.015775204470230869 0.56417193374348917
+0.80588150441467499 -0.045732053728024698 0.58956860097969011
+0.80104197563456947 -0.053122466844444688 0.59574101077153174
+0.79963678018449591 -0.05534752809057629 0.59753024518837039
+0.79934060742300872 -0.055862651692236226 0.5979056290568221
+0.79848519772427518 -0.05725079091428617 0.59888293763788758
+0.7956418656744515 -0.062099421877685829 0.60211592452938856
+0.77138586605477644 -0.10108899298613383 0.62717432611494861
+0.76687916779802356 -0.10789205109760849 0.63136143448574888
+0.75366980899531777 -0.12957223153317304 0.64334361719230837
+0.74532674141002397 -0.14250706129079604 0.65018159643527595
+0.74055958467102845 -0.15027494754537984 0.65399889841309089
+0.73203596503112123 -0.16333083529035369 0.66003296952840662
+0.71021467390312121 -0.19943478257349531 0.67476755984413883
+0.70685918524788072 -0.20468185015976154 0.67677227421098896
+0.69607577061268988 -0.22054081151139987 0.68235511400187043
+0.69531998299352837 -0.22171162891211948 0.68272481536695295
+0.69377314187723504 -0.22428489754399578 0.68341702461536258
+0.69212177096286909 -0.22700206765185593 0.68413337702600874
+0.67087146858540314 -0.2624299701285262 0.69320320770179844
+0.66689476317101137 -0.26866388572512034 0.69462568959831961
+0.65693999760682831 -0.28335434223766309 0.69755165300174227
+0.65068017874670425 -0.29325931385704501 0.69911600851089595
+0.63268818151834738 -0.32335420881895094 0.70294074606773105
+0.62443505191569892 -0.33636614204180326 0.70422028778974766
+0.61696807586665514 -0.34742682425518856 0.70495163176324005
+0.60785615600797449 -0.36184045701812129 0.70538094374692584
+0.59214384399202546 -0.3881595429818786 0.70538094374692573
+0.58303192413334481 -0.40257317574481138 0.70495163176324016
+0.57556494808430092 -0.41363385795819674 0.70422028778974766
+0.5673118184816528 -0.42664579118104884 0.70294074606773105
+0.5493198212532957 -0.45674068614295493 0.69911600851089584
+0.54306000239317154 -0.46664565776233696 0.69755165300174249
+0.53310523682898858 -0.4813361142748796 0.69462568959831961
+0.52912853141459681 -0.48757002987147369 0.69320320770179866
+0.50787822903712998 -0.52299793234814529 0.68413337702600852
+0.50622685812276469 -0.5257151024560045 0.68341702461536258
+0.50468001700647158 -0.52828837108788052 0.68272481536695295
+0.50392422938731019 -0.52945918848859996 0.68235511400187066
+0.49314081475211924 -0.54531814984023841 0.67677227421098896
+0.48978532609687886 -0.55056521742650477 0.67476755984413894
+0.46796403496887878 -0.58666916470964625 0.66003296952840662
+0.45944041532897167 -0.59972505245462004 0.65399889841309089
+0.45467325858997609 -0.60749293870920384 0.65018159643527607
+0.44633019100468213 -0.6204277684668269 0.64334361719230826
+0.4331208322019765 -0.64210794890239153 0.63136143448574877
+0.42861413394522363 -0.64891100701386595 0.62717432611494872
+0.40435813432554857 -0.6879005781223142 0.60211592452938856
+0.401514802275725 -0.69274920908571369 0.59888293763788769
+0.40065939257699124 -0.69413734830776352 0.5979056290568221
+0.40036321981550405 -0.6946524719094237 0.59753024518837061
+0.39895802436543049 -0.69687753315555545 0.59574101077153174
+0.39411849558532508 -0.7042679462719752 0.58956860097969033
+0.37506412073313489 -0.73422479552976916 0.5641719337434894
+0.36998650939197836 -0.74269333684247552 0.55678551944213661
+0.36517401588679066 -0.75 0.5497573450331017
+0.35314170479917451 -0.76928684914828649 0.53075413092765567
+0.34288899659372707 -0.78713443636827329 0.51257565524045945
+0.34243159318633287 -0.78789291377908466 0.51176714118576805
+0.34177771381313388 -0.78887113359859229 0.51061830246204121
+0.33951337109735685 -0.79211156275892003 0.50664961250726281
+0.32993533901945349 -0.80654749644509338 0.4886330537542477
+0.31682936237190812 -0.8280363774210906 0.46105412139556601
+0.31474205002823563 -0.83109069623026077 0.45671715648324707
+0.30729748704039872 -0.84278707285381294 0.43974499787970983
+0.30362145533065943 -0.84916410602320291 0.43023759412454349
+0.29401138453262832 -0.86471241548978517 0.4056780940788991
+0.29057971437419 -0.8695923485436825 0.39708487175152685
+0.28617291708332138 -0.87638371280443861 0.38483791504434917
+0.27461092234606033 -0.8964430577690583 0.34753041451074085
+1.645646500231599 -0.40873185103125675 0.82760814841975483
+1.4754246841105658 0.036914649200342042 0.55218346430918919
+0.92457531588943409 0.036914649200342042 0.5521834643091893
+0.75435349976840138 -0.40873185103125664 0.82760814841975505
+1.2000000000000002 -0.68415653514182251 0.99782996454078776
+1.2000000000000002 -0.68415653514182251 -0.99782996454078776
+0.75435349976840138 -0.40873185103125664 -0.82760814841975505
+0.92457531588943409 0.036914649200342042 -0.55218346430918919
+1.4754246841105658 0.036914649200342042 -0.5521834643091893
+1.645646500231599 -0.40873185103125675 -0.82760814841975483
+1.5412681489687439 -1.5776081484197546 0.44564650023159885
+1.2658434648581776 -1.7478299645407878 1.2310405966106296e-18
+1.5412681489687436 -1.5776081484197548 -0.44564650023159874
+1.986914649200342 -1.302183464309189 -0.27542468411056586
+1.9869146492003424 -1.3021834643091887 0.27542468411056575
+2.027608148419755 -0.30435349976840131 0.34126814896874336
+0.75435349976840138 -1.0912681489687435 -0.82760814841975505
+0.6478165356908111 -1.0254246841105663 0.78691464920034215
+1.2000000000000002 -0.81584346485817771 0.99782996454078776
+1.7521834643091894 -1.0254246841105661 0.78691464920034182
+1.7521834643091894 -0.47457531588943436 0.78691464920034182
+1.986914649200342 -0.19781653569081092 0.27542468411056586
+1.5412681489687436 0.077608148419754941 0.44564650023159863
+1.1341565351418224 0.24782996454078776 1.2310405966106292e-18
+0.64781653569081088 -0.47457531588943408 0.78691464920034226
+0.7543534997684016 -1.0912681489687439 0.82760814841975494
+1.7521834643091894 -0.47457531588943419 -0.78691464920034182
+1.645646500231599 -1.0912681489687435 -0.82760814841975483
+1.2000000000000002 -0.81584346485817771 -0.99782996454078776
+0.64781653569081088 -1.0254246841105659 -0.78691464920034226
+0.64781653569081088 -0.47457531588943419 -0.78691464920034226
+1.2658434648581776 0.24782996454078776 -1.2310405966106292e-18
+1.5412681489687436 0.077608148419754941 -0.44564650023159885
+2.027608148419755 -0.30435349976840137 -0.34126814896874336
+2.027608148419755 -1.1956465002315986 0.34126814896874302
+1.645646500231599 -1.0912681489687435 0.82760814841975483
+1.4754246841105663 -1.5369146492003418 0.55218346430918919
+0.85873185103125671 -1.5776081484197548 0.44564650023159885
+1.1341565351418224 -1.7478299645407878 -1.2310405966106296e-18
+0.92457531588943409 -1.536914649200342 -0.5521834643091893
+1.4754246841105658 -1.5369146492003423 -0.55218346430918908
+1.7521834643091894 -1.0254246841105659 -0.78691464920034182
+2.0276081484197555 -1.1956465002315984 -0.34126814896874325
+2.1978299645407877 -0.75 0.065843464858177464
+2.1978299645407877 -0.75 -0.065843464858177436
+1.986914649200342 -0.19781653569081104 -0.27542468411056586
+0.85873185103125671 -1.5776081484197548 -0.44564650023159907
+0.37239185158024513 -1.195646500231599 -0.34126814896874341
+0.41308535079965791 -1.3021834643091892 -0.27542468411056586
+0.3723918515802449 -1.1956465002315986 0.34126814896874336
+0.41308535079965802 -1.3021834643091892 0.27542468411056598
+0.92457531588943409 -1.5369146492003423 0.55218346430918908
+1.5036963168239361 -0.22706071813732454 0.79643145005237248
+1.4303366934291697 -0.41911870558671405 0.9151298141069959
+1.2689962820007255 0.0032759752918453122 0.65407554465688122
+1.461054269450115 -0.11542238876277822 0.7274351680516471
+0.93894573054988506 -0.11542238876277811 0.72743516805164721
+1.1310037179992745 0.0032759752918453122 0.65407554465688122
+0.96966330657083066 -0.41911870558671399 0.91512981410699601
+0.89630368317606424 -0.22706071813732454 0.79643145005237248
+1.3186983640546239 -0.48811498758743949 0.95777186148081694
+1.0813016359453766 -0.48811498758743949 0.95777186148081694
+1.0813016359453766 -0.48811498758743949 -0.95777186148081694
+1.3186983640546237 -0.48811498758743949 -0.95777186148081694
+0.89630368317606401 -0.22706071813732454 -0.79643145005237248
+0.96966330657083044 -0.41911870558671399 -0.91512981410699601
+1.1310037179992749 0.0032759752918453122 -0.65407554465688122
+0.93894573054988506 -0.11542238876277811 -0.72743516805164721
+1.461054269450115 -0.11542238876277822 -0.7274351680516471
+1.2689962820007261 0.0032759752918452012 -0.65407554465688111
+1.4303366934291701 -0.41911870558671405 -0.9151298141069959
+1.5036963168239366 -0.22706071813732454 -0.79643145005237237
+1.530881294413287 -1.6651298141069955 0.23033669342916985
+1.7229392818626763 -1.5464314500523719 0.30369631682393572
+1.4618850124125611 -1.7077718614808168 -0.1186983640546234
+1.4618850124125609 -1.7077718614808168 0.11869836405462342
+1.7229392818626761 -1.5464314500523721 -0.30369631682393577
+1.5308812944132866 -1.6651298141069957 -0.23033669342916982
+1.9532759752918458 -1.4040755446568807 -0.068996282000725426
+1.8345776112372223 -1.4774351680516467 -0.26105426945011484
+1.8345776112372221 -1.4774351680516467 0.26105426945011473
+1.9532759752918458 -1.4040755446568804 0.068996282000725453
+1.9964314500523725 -0.44630368317606428 0.52293928186267558
+2.1151298141069961 -0.51966330657083049 0.33088129441328584
+0.96966330657083044 -1.0808812944132864 -0.9151298141069959
+0.89630368317606424 -1.2729392818626755 -0.79643145005237259
+0.54592445534311906 -0.81899628200072527 0.75327597529184542
+0.47256483194835297 -1.0110542694501148 0.63457761123722212
+1.0813016359453769 -1.0118850124125609 0.95777186148081694
+1.3186983640546237 -1.0118850124125609 0.95777186148081683
+1.9274351680516475 -1.0110542694501148 0.63457761123722156
+1.8540755446568815 -0.81899628200072538 0.75327597529184498
+1.8540755446568815 -0.68100371799927473 0.75327597529184498
+1.9274351680516473 -0.48894573054988527 0.63457761123722167
+1.9532759752918456 -0.095924455343119219 0.068996282000725412
+1.8345776112372223 -0.022564831948353237 0.26105426945011484
+1.7229392818626761 0.046431450052372147 0.30369631682393577
+1.5308812944132866 0.16512981410699579 0.23033669342916971
+0.54592445534311906 -0.6810037179992745 0.75327597529184542
+0.89630368317606457 -1.2729392818626759 0.79643145005237248
+0.969663306570831 -1.0808812944132864 0.91512981410699601
+1.9274351680516475 -0.48894573054988527 -0.63457761123722156
+1.8540755446568815 -0.68100371799927462 -0.75327597529184498
+1.5036963168239361 -1.2729392818626759 -0.79643145005237226
+1.4303366934291697 -1.0808812944132864 -0.9151298141069959
+1.3186983640546237 -1.0118850124125607 -0.95777186148081683
+1.0813016359453766 -1.0118850124125607 -0.95777186148081683
+0.47256483194835297 -1.0110542694501148 -0.63457761123722201
+0.54592445534311906 -0.8189962820007255 -0.75327597529184531
+0.54592445534311895 -0.68100371799927473 -0.75327597529184542
+1.4618850124125611 0.20777186148081683 0.1186983640546234
+1.4618850124125609 0.20777186148081683 -0.11869836405462342
+1.5308812944132868 0.16512981410699579 -0.23033669342916979
+1.7229392818626761 0.046431450052372147 -0.30369631682393572
+2.1151298141069956 -0.51966330657083037 -0.3308812944132859
+1.9964314500523725 -0.44630368317606417 -0.52293928186267558
+2.1151298141069961 -0.98033669342916963 0.33088129441328579
+1.9964314500523728 -1.0536963168239355 0.52293928186267535
+1.4303366934291701 -1.0808812944132864 0.91512981410699579
+1.5036963168239363 -1.2729392818626759 0.79643145005237215
+1.4610542694501154 -1.3845776112372215 0.72743516805164721
+1.2689962820007261 -1.5032759752918452 0.65407554465688111
+0.67706071813732438 -1.5464314500523724 0.30369631682393589
+0.86911870558671378 -1.6651298141069959 0.23033669342916985
+0.93811498758743972 -1.7077718614808171 0.11869836405462342
+0.93811498758743939 -1.7077718614808171 -0.11869836405462345
+0.93894573054988506 -1.3845776112372217 -0.72743516805164732
+1.1310037179992742 -1.5032759752918454 -0.65407554465688122
+1.2689962820007255 -1.5032759752918454 -0.65407554465688122
+1.461054269450115 -1.3845776112372219 -0.72743516805164699
+1.8540755446568815 -0.81899628200072527 -0.75327597529184498
+1.9274351680516473 -1.0110542694501146 -0.63457761123722178
+1.9964314500523725 -1.0536963168239355 -0.52293928186267535
+2.1151298141069961 -0.98033669342916974 -0.33088129441328584
+2.1577718614808168 -0.63130163594537647 0.26188501241256051
+2.1577718614808168 -0.86869836405462331 0.26188501241256057
+2.1577718614808168 -0.86869836405462353 -0.26188501241256051
+2.1577718614808168 -0.63130163594537669 -0.26188501241256057
+1.8345776112372223 -0.022564831948353237 -0.2610542694501149
+1.9532759752918452 -0.095924455343118997 -0.068996282000725481
+0.86911870558671411 -1.6651298141069959 -0.23033669342916996
+0.67706071813732449 -1.5464314500523724 -0.30369631682393589
+0.40356854994762748 -1.0536963168239357 -0.52293928186267569
+0.56542238876277817 -1.4774351680516471 -0.26105426945011495
+0.44672402470815431 -1.4040755446568807 -0.068996282000725495
+0.40356854994762748 -1.0536963168239357 0.52293928186267569
+0.44672402470815431 -1.4040755446568807 0.068996282000725453
+0.56542238876277806 -1.4774351680516471 0.2610542694501149
+1.1310037179992749 -1.5032759752918454 0.65407554465688122
+0.93894573054988539 -1.3845776112372221 0.7274351680516471
+1.8370473838366879 -0.41456827261077828 0.69401454380114713
+1.7036911127293843 -0.22163878825453986 0.68346886752821701
+1.4724957718177856 0.14756031181852225 0.34659997257597425
+1.2699303480424986 0.13287877117884817 0.46436496618972251
+0.63787141557069948 -0.6107082358556537 0.81523570763863529
+0.84548244056661226 -0.61218022100605229 0.92483674698373319
+1.3212211638374884 -0.88320400767343932 0.98364735641266221
+1.441367879455516 -0.6821105690485505 0.96805607891910661
+1.0787788361625117 -0.88320400767343921 -0.98364735641266243
+0.9586321205444841 -0.6821105690485505 -0.96805607891910683
+1.130069651957502 0.13287877117884817 -0.46436496618972251
+1.6686357350626615 0.026339147981033872 -0.42151877198336163
+1.660471780794011 -0.10848910827666802 -0.61353851948571891
+1.7621285844293006 -0.6107082358556537 -0.81523570763863507
+1.5545175594333882 -0.61218022100605218 -0.92483674698373297
+1.3392917641443465 -1.5652357076386352 0.56212858442930091
+1.3378197789939481 -1.6748367469837331 0.35451755943338803
+1.0667959923265606 -1.7336473564126624 -0.12122116383748836
+1.2678894309514499 -1.7180560789191066 -0.24136787945551624
+1.535431727389222 -1.4440145438011469 -0.63704738383668813
+1.7283612117454605 -1.433468867528217 -0.50369111272938405
+2.0975603118185226 -1.0965999725759743 -0.27249577181778517
+2.0828787711788483 -1.214364966189722 -0.069930348042498189
+1.9763391479810346 -1.1715187719833613 0.46863573506266054
+1.8415108917233329 -1.3635385194857184 0.46047178079401052
+1.8940145438011475 -0.11295261616331242 0.33543172738922156
+1.8834688675282174 -0.24630888727061595 0.52836121174546036
+0.63787141557069948 -0.8892917641443463 -0.81523570763863529
+0.84548244056661226 -0.88781977899394804 -0.92483674698373319
+0.85340002742402632 -1.0224957718177858 0.89756031181852258
+0.73563503381027773 -0.8199303480424982 0.88287877117884828
+1.0787788361625121 -0.61679599232656102 0.98364735641266243
+0.9586321205444841 -0.81788943095144961 0.96805607891910683
+1.6215187719833617 -1.2186357350626613 0.77633914798103398
+1.8135385194857192 -1.2104717807940104 0.64151089172333176
+1.5465999725759745 -0.47750422818221472 0.89756031181852247
+1.6643649661897226 -0.6800696519575018 0.88287877117884805
+2.0975603118185226 -0.40340002742402592 0.27249577181778528
+2.0828787711788479 -0.28563503381027766 0.069930348042498217
+1.535431727389222 -0.05598545619885309 0.63704738383668813
+1.7283612117454608 -0.066531132471783327 0.50369111272938427
+1.3332040076734395 0.23364735641266221 -0.12122116383748827
+1.1321105690485507 0.21805607891910683 -0.24136787945551619
+1.0607082358556541 0.065235707638635065 0.56212858442930091
+1.062180221006052 0.17483674698373297 0.35451755943338792
+0.77848122801663822 -0.28136426493733913 0.77633914798103421
+0.56295261616331205 -1.085431727389222 0.69401454380114724
+0.69630888727061591 -1.2783612117454606 0.68346886752821701
+1.6215187719833619 -0.28136426493733918 -0.77633914798103409
+1.8135385194857194 -0.28952821920598959 -0.64151089172333187
+1.8370473838366879 -1.085431727389222 -0.69401454380114702
+1.7036911127293841 -1.2783612117454606 -0.68346886752821689
+1.3212211638374884 -0.61679599232656102 -0.98364735641266243
+1.441367879455516 -0.8178894309514495 -0.96805607891910661
+0.77848122801663822 -1.2186357350626609 -0.77633914798103421
+0.58646148051428115 -1.2104717807940109 -0.64151089172333209
+0.85340002742402576 -0.47750422818221466 -0.89756031181852258
+0.73563503381027773 -0.6800696519575018 -0.88287877117884828
+1.0667959923265609 0.23364735641266243 0.12122116383748828
+1.2678894309514495 0.21805607891910661 0.24136787945551616
+1.3392917641443458 0.065235707638635065 -0.56212858442930091
+1.3378197789939481 0.17483674698373297 -0.35451755943338792
+2.0152357076386354 -0.18787141557069953 -0.13929176414434619
+2.1248367469837333 -0.39548244056661219 -0.13781977899394779
+2.0152357076386354 -1.3121285844293002 0.13929176414434616
+2.1248367469837333 -1.1045175594333878 0.13781977899394765
+1.7621285844293006 -0.88929176414434641 0.81523570763863507
+1.5545175594333882 -0.88781977899394793 0.92483674698373297
+1.6686357350626613 -1.5263391479810342 0.42151877198336157
+1.6604717807940113 -1.3915108917233319 0.6135385194857188
+0.86456827261077818 -1.4440145438011469 0.63704738383668824
+0.67163878825453982 -1.4334688675282172 0.50369111272938427
+1.3332040076734395 -1.7336473564126622 0.12122116383748834
+1.1321105690485507 -1.7180560789191068 0.24136787945551627
+0.7313642649373393 -1.5263391479810342 -0.42151877198336168
+0.73952821920598932 -1.3915108917233323 -0.61353851948571902
+1.4724957718177856 -1.6475603118185225 -0.34659997257597425
+1.2699303480424979 -1.6328787711788482 -0.46436496618972256
+1.5465999725759745 -1.0224957718177854 -0.89756031181852247
+1.6643649661897224 -0.81993034804249787 -0.88287877117884817
+1.8940145438011475 -1.3870473838366877 -0.33543172738922156
+1.883468867528217 -1.2536911127293844 -0.52836121174546002
+2.1836473564126626 -0.62877883616251173 -0.13320400767343912
+2.1680560789191068 -0.50863212054448403 0.067889430951449614
+2.1836473564126626 -0.87122116383748816 0.13320400767343907
+2.1680560789191068 -0.99136787945551619 -0.067889430951449573
+1.9763391479810344 -0.32848122801663854 -0.46863573506266076
+1.8415108917233325 -0.13646148051428131 -0.46047178079401069
+1.0607082358556541 -1.5652357076386352 -0.56212858442930091
+1.0621802210060525 -1.6748367469837331 -0.35451755943338803
+0.38476429236136467 -1.3121285844293005 -0.13929176414434624
+0.27516325301626687 -1.104517559433388 -0.13781977899394784
+0.42366085201896575 -1.1715187719833617 -0.46863573506266099
+0.55848910827666798 -1.3635385194857188 -0.4604717807940108
+0.50598545619885293 -1.3870473838366881 0.33543172738922172
+0.51653113247178306 -1.2536911127293846 0.52836121174546025
+0.3024396881814776 -1.0965999725759743 0.27249577181778545
+0.31712122882115168 -1.2143649661897222 0.06993034804249823
+0.92750422818221478 -1.6475603118185225 0.3465999725759743
+1.130069651957502 -1.6328787711788482 0.46436496618972251
+1.3318385030170197 -0.083304877297165847 0.73357768674250456
+1.2997571655259812 -0.25474116197207625 0.86299895207436539
+1.3212211638374884 -0.6167959923265609 0.98364735641266221
+1.5545175594333884 -0.61218022100605229 0.92483674698373297
+1.0681614969829809 -0.083304877297165625 0.73357768674250445
+1.2616533189164061 -0.15498399644609528 0.80134563315795981
+1.6215187719833619 -0.28136426493733929 0.77633914798103421
+1.6604717807940104 -0.10848910827666802 0.61353851948571902
+0.98668082109255706 -0.29662405620460913 0.86541618975952428
+1.1383466810835945 -0.15498399644609528 0.8013456331579597
+1.3392917641443463 0.065235707638635065 0.56212858442930091
+1.130069651957502 0.13287877117884817 0.46436496618972245
+1.2000000000000002 -0.42846255922162907 0.94689686564994791
+1.1002428344740192 -0.25474116197207619 0.86299895207436539
+1.4133191789074442 -0.29662405620460919 0.86541618975952417
+1.2000000000000006 -0.31639448088848182 0.90110279868394094
+0.85340002742402565 -0.47750422818221461 0.89756031181852258
+0.9586321205444841 -0.6821105690485505 0.96805607891910683
+0.98668082109255639 -0.29662405620460919 -0.86541618975952417
+1.2 -0.31639448088848182 -0.90110279868394094
+1.5465999725759745 -0.47750422818221466 -0.89756031181852236
+1.4413678794555165 -0.6821105690485505 -0.96805607891910661
+1.0681614969829805 -0.083304877297165847 -0.73357768674250456
+1.1002428344740194 -0.25474116197207625 -0.86299895207436539
+1.0787788361625117 -0.6167959923265609 -0.98364735641266243
+0.84548244056661226 -0.61218022100605229 -0.92483674698373319
+1.3318385030170203 -0.083304877297165625 -0.73357768674250434
+1.1383466810835945 -0.15498399644609517 -0.80134563315795992
+0.77848122801663844 -0.28136426493733918 -0.77633914798103432
+1.4133191789074437 -0.29662405620460919 -0.86541618975952417
+1.2616533189164061 -0.15498399644609495 -0.80134563315795981
+1.0607082358556541 0.065235707638635065 -0.56212858442930091
+1.2699303480424986 0.13287877117884817 -0.46436496618972245
+1.2000000000000002 -0.42846255922162907 -0.94689686564994791
+1.2997571655259814 -0.25474116197207619 -0.86299895207436528
+1.535431727389222 -0.055985456198853201 -0.63704738383668802
+1.7036911127293846 -0.22163878825453975 -0.68346886752821689
+1.5215374407783711 -1.6968968656499479 1.2287154012371122e-18
+1.6952588380279243 -1.6129989520743651 0.099757165525981017
+1.8940145438011475 -1.3870473838366877 0.33543172738922156
+1.7283612117454608 -1.4334688675282168 0.50369111272938427
+1.6533759437953917 -1.6154161897595238 -0.21331917890744354
+1.6336055191115184 -1.6511027986839406 1.2262216765384848e-18
+1.472495771817786 -1.6475603118185222 0.3465999725759743
+1.2678894309514497 -1.7180560789191066 0.24136787945551616
+1.8666951227028346 -1.4835776867425041 -0.13183850301701966
+1.6952588380279243 -1.6129989520743651 -0.099757165525981017
+1.3332040076734395 -1.7336473564126622 -0.12122116383748834
+1.3378197789939481 -1.6748367469837331 -0.35451755943338797
+1.8666951227028352 -1.4835776867425037 0.13183850301701966
+1.7950160035539056 -1.5513456331579594 -0.061653318916405561
+1.6686357350626613 -1.5263391479810342 -0.42151877198336174
+1.8415108917233325 -1.3635385194857186 -0.46047178079401058
+1.6533759437953914 -1.6154161897595238 0.21331917890744345
+1.7950160035539053 -1.5513456331579594 0.06165331891640554
+2.0152357076386354 -1.3121285844293 -0.13929176414434613
+2.0828787711788483 -1.214364966189722 0.069930348042498189
+1.9335776867425047 -0.61816149698298051 0.66669512270283404
+2.0629989520743655 -0.6502428344740192 0.49525883802792375
+2.1836473564126626 -0.62877883616251184 0.13320400767343912
+2.1248367469837333 -0.39548244056661236 0.13781977899394779
+1.2 -1.0715374407783713 -0.94689686564994791
+1.1002428344740192 -1.2452588380279237 -0.86299895207436528
+0.86456827261077818 -1.4440145438011469 -0.63704738383668824
+0.69630888727061557 -1.2783612117454601 -0.68346886752821723
+0.30243968818147737 -1.0965999725759743 -0.27249577181778545
+0.39865436684204036 -0.81165331891640546 0.59501600355390505
+0.42366085201896597 -1.1715187719833617 0.46863573506266121
+0.58646148051428126 -1.2104717807940111 0.64151089172333209
+0.98668082109255706 -1.203375943795391 0.86541618975952428
+1.2000000000000002 -1.1836055191115182 0.90110279868394083
+1.5465999725759745 -1.0224957718177856 0.89756031181852236
+1.4413678794555167 -0.81788943095144961 0.9680560789191065
+2.0654161897595245 -0.96331917890744334 0.45337594379539059
+2.00134563315796 -0.81165331891640569 0.5950160035539046
+1.7621285844293011 -0.61070823585565404 0.81523570763863507
+1.6643649661897226 -0.8199303480424982 0.88287877117884805
+1.9335776867425047 -0.88183850301701949 0.66669512270283382
+2.00134563315796 -0.68834668108359442 0.5950160035539046
+1.9763391479810344 -0.32848122801663865 0.46863573506266099
+1.813538519485719 -0.28952821920598959 0.64151089172333209
+1.8666951227028346 -0.016422313257495769 -0.13183850301701974
+1.7950160035539053 0.051345633157959369 0.061653318916405554
+1.6686357350626613 0.026339147981034206 0.42151877198336174
+1.8415108917233325 -0.13646148051428153 0.46047178079401069
+1.8666951227028343 -0.016422313257495658 0.13183850301701971
+1.6952588380279245 0.11299895207436506 0.099757165525981045
+1.3332040076734395 0.23364735641266221 0.12122116383748827
+1.3378197789939481 0.17483674698373319 0.35451755943338797
+1.1321105690485505 0.21805607891910661 0.24136787945551616
+0.6378714155706996 -0.88929176414434641 0.8152357076386354
+0.73563503381027773 -0.6800696519575018 0.88287877117884839
+1.0681614969829809 -1.4166951227028342 0.73357768674250479
+1.1002428344740194 -1.2452588380279237 0.86299895207436539
+1.0787788361625121 -0.88320400767343932 0.98364735641266243
+0.84548244056661248 -0.88781977899394804 0.9248367469837333
+2.0654161897595245 -0.53668082109255666 -0.45337594379539081
+2.00134563315796 -0.68834668108359442 -0.59501600355390472
+1.7621285844293011 -0.8892917641443463 -0.81523570763863507
+1.6643649661897226 -0.68006965195750169 -0.88287877117884805
+1.3318385030170194 -1.4166951227028339 -0.73357768674250468
+1.2997571655259812 -1.2452588380279237 -0.86299895207436539
+1.3212211638374884 -0.88320400767343932 -0.98364735641266221
+1.5545175594333882 -0.88781977899394793 -0.92483674698373297
+1.4133191789074437 -1.203375943795391 -0.86541618975952417
+1.2 -1.1836055191115182 -0.90110279868394083
+0.85340002742402565 -1.0224957718177852 -0.89756031181852258
+0.9586321205444841 -0.81788943095144961 -0.96805607891910683
+0.33458381024047579 -0.96331917890744323 -0.45337594379539092
+0.39865436684204025 -0.8116533189164058 -0.59501600355390494
+0.63787141557069948 -0.61070823585565404 -0.81523570763863551
+0.73563503381027773 -0.81993034804249798 -0.88287877117884839
+0.46642231325749561 -0.88183850301701971 -0.66669512270283449
+1.0667959923265611 0.23364735641266243 -0.12122116383748828
+1.0621802210060525 0.17483674698373319 -0.35451755943338797
+1.6533759437953914 0.11541618975952384 0.21331917890744345
+1.6336055191115184 0.15110279868394072 -1.2262216765384848e-18
+1.4724957718177856 0.14756031181852225 -0.34659997257597425
+1.2678894309514497 0.21805607891910661 -0.24136787945551616
+1.5215374407783711 0.19689686564994791 -1.2287154012371122e-18
+1.6952588380279245 0.11299895207436506 -0.099757165525981045
+1.8940145438011473 -0.1129526161633122 -0.33543172738922167
+1.7283612117454608 -0.066531132471783216 -0.50369111272938416
+2.1468968656499481 -0.74999999999999989 -0.32153744077837088
+2.0629989520743655 -0.65024283447401887 -0.49525883802792381
+1.8370473838366883 -0.41456827261077839 -0.69401454380114669
+1.8834688675282174 -0.24630888727061584 -0.52836121174546025
+2.1468968656499481 -0.74999999999999989 0.32153744077837082
+2.0629989520743655 -0.84975716552598102 0.4952588380279237
+1.8370473838366883 -1.0854317273892216 0.69401454380114669
+1.8834688675282174 -1.2536911127293839 0.52836121174546025
+1.2000000000000002 -1.0715374407783713 0.94689686564994791
+1.2997571655259814 -1.2452588380279237 0.86299895207436528
+1.5354317273892222 -1.4440145438011467 0.63704738383668802
+1.7036911127293846 -1.2783612117454606 0.68346886752821678
+1.4133191789074437 -1.203375943795391 0.86541618975952417
+1.2616533189164061 -1.3450160035539047 0.80134563315795981
+1.0607082358556541 -1.5652357076386352 0.56212858442930091
+1.269930348042499 -1.6328787711788482 0.46436496618972256
+0.53330487729716558 -1.4835776867425046 0.13183850301701974
+0.70474116197207626 -1.6129989520743653 0.099757165525981073
+1.0667959923265609 -1.7336473564126624 0.12122116383748836
+1.0621802210060525 -1.6748367469837331 0.35451755943338797
+0.74662405620460892 -1.6154161897595241 0.21331917890744362
+0.76639448088848172 -1.6511027986839408 -1.226221676538485e-18
+0.92750422818221478 -1.6475603118185225 -0.34659997257597441
+1.1321105690485505 -1.7180560789191066 -0.24136787945551619
+0.98668082109255706 -1.203375943795391 -0.86541618975952428
+1.1383466810835943 -1.3450160035539047 -0.80134563315795981
+1.3392917641443463 -1.5652357076386352 -0.56212858442930091
+1.130069651957502 -1.6328787711788482 -0.46436496618972267
+1.0681614969829802 -1.4166951227028344 -0.73357768674250434
+1.2616533189164061 -1.3450160035539049 -0.80134563315795981
+1.6215187719833617 -1.2186357350626611 -0.77633914798103409
+1.6604717807940104 -1.3915108917233319 -0.61353851948571902
+1.9335776867425047 -0.61816149698298029 -0.66669512270283404
+2.00134563315796 -0.81165331891640546 -0.5950160035539046
+1.9763391479810344 -1.1715187719833615 -0.46863573506266087
+1.813538519485719 -1.2104717807940109 -0.64151089172333209
+1.9335776867425047 -0.88183850301701949 -0.66669512270283404
+2.0629989520743655 -0.84975716552598102 -0.49525883802792381
+2.1836473564126626 -0.87122116383748793 -0.13320400767343907
+2.1248367469837333 -1.1045175594333876 -0.13781977899394773
+2.0654161897595245 -0.53668082109255666 0.45337594379539081
+2.1011027986839408 -0.74999999999999989 0.43360551911151807
+2.0975603118185226 -1.0965999725759743 0.27249577181778517
+2.1680560789191068 -0.99136787945551619 0.067889430951449573
+2.065416189759524 -0.96331917890744345 -0.45337594379539076
+2.1011027986839408 -0.74999999999999989 -0.43360551911151807
+2.0975603118185226 -0.40340002742402592 -0.27249577181778528
+2.1680560789191068 -0.50863212054448415 -0.067889430951449614
+1.6533759437953914 0.11541618975952384 -0.2133191789074434
+1.7950160035539053 0.051345633157959369 -0.06165331891640554
+2.0152357076386354 -0.18787141557069942 0.13929176414434624
+2.0828787711788483 -0.28563503381027772 -0.069930348042498203
+0.87846255922162908 -1.6968968656499479 -1.2287154012371124e-18
+0.70474116197207626 -1.6129989520743653 -0.099757165525981073
+0.50598545619885282 -1.3870473838366881 -0.33543172738922172
+0.6716387882545396 -1.4334688675282168 -0.50369111272938449
+0.56295261616331194 -1.085431727389222 -0.69401454380114702
+0.51653113247178317 -1.2536911127293844 -0.52836121174546036
+0.74662405620460925 -1.6154161897595241 -0.21331917890744351
+0.60498399644609513 -1.5513456331579598 -0.061653318916405575
+0.38476429236136467 -1.3121285844293005 0.13929176414434624
+0.31712122882115168 -1.2143649661897222 -0.06993034804249823
+0.46642231325749572 -0.8818385030170196 0.66669512270283449
+0.27516325301626676 -1.104517559433388 0.13781977899394782
+0.53330487729716547 -1.4835776867425041 -0.13183850301701977
+0.60498399644609502 -1.5513456331579596 0.061653318916405589
+0.73136426493733908 -1.5263391479810342 0.42151877198336185
+0.55848910827666798 -1.3635385194857188 0.46047178079401091
+1.3318385030170203 -1.4166951227028344 0.73357768674250423
+1.1383466810835952 -1.3450160035539049 0.80134563315795981
+0.77848122801663866 -1.2186357350626613 0.77633914798103421
+0.73952821920598932 -1.3915108917233319 0.61353851948571902
+0.3345838102404759 -0.96331917890744334 0.45337594379539103
+1.7257938275259754 -0.54171259951203343 0.82471644201722449
+1.8144698341819119 -0.47712117915505492 0.74024588618561449
+1.6063294025426431 0.034371238373710589 0.46867704983435055
+1.5392409609172171 0.11230450765389333 0.37596077789543386
+0.61057431319105182 -0.54268760819673534 0.78076816785433145
+1.1186290539433099 -0.81638104563821712 0.9944708773603258
+1.2405222816687171 -0.88192856911395234 0.99043061207734606
+1.2813709460566907 -0.81638104563821712 -0.9944708773603258
+1.1594777183312832 -0.88192856911395234 -0.99043061207734606
+0.67420617247402481 -0.54171259951203332 -0.82471644201722483
+1.4746684461261839 0.11574218443040085 -0.41838703947458189
+1.6048073899588975 0.071782225985176584 -0.40100492526839776
+1.7760838378857442 -0.41005164309557424 -0.74334549596053434
+1.7894256868089482 -0.54268760819673534 -0.78076816785433145
+1.5399483569044261 -1.4933454959605343 0.57608383788574391
+1.4073123918032651 -1.5307681678543312 0.58942568680894813
+1.1336189543617827 -1.7444708773603259 0.081370946056690305
+1.0680714308860475 -1.7404306120773461 -0.040522281668716881
+1.4082874004879669 -1.5747164420172246 -0.52579382752597525
+1.4728788208449453 -1.4902458861856145 -0.61446983418191203
+1.9843712383737104 -1.2186770498343509 -0.40632940254264294
+2.0623045076538933 -1.1259607778954337 -0.33924096091721667
+2.0657421844304009 -1.1683870394745814 0.27466844612618369
+2.0217822259851768 -1.1510049252683978 0.40480738995889709
+2.0247164420172248 -0.22420617247402475 0.20828740048796671
+1.9402458861856147 -0.13553016581808797 0.27287882084494519
+0.62391616211425593 -1.0899483569044257 -0.74334549596053445
+0.61057431319105182 -0.95731239180326444 -0.78076816785433145
+0.73132295016564974 -1.1563294025426434 0.7843712383737107
+0.82403922210456648 -1.0892409609172171 0.86230450765389366
+1.2813709460566907 -0.68361895436178255 0.9944708773603258
+1.1594777183312834 -0.61807143088604777 0.99043061207734606
+1.6183870394745821 -1.0246684461261837 0.86574218443040063
+1.6010049252683982 -1.1548073899588975 0.82178222598517625
+1.6686770498343511 -0.34367059745735729 0.7843712383737107
+1.5759607778954343 -0.41075903908278349 0.86230450765389333
+1.9843712383737104 -0.28132295016564945 0.40632940254264299
+2.0623045076538933 -0.37403922210456625 0.33924096091721667
+1.4082874004879666 0.074716442017224605 0.52579382752597525
+1.4728788208449453 -0.0097541138143855122 0.61446983418191214
+1.2663810456382176 0.24447087736032569 0.081370946056690249
+1.3319285691139524 0.24043061207734606 -0.040522281668716874
+0.9926876081967354 0.030768167854331341 0.58942568680894825
+0.78161296052541807 -0.47533155387381615 0.86574218443040096
+0.79899507473160236 -0.34519261004110258 0.82178222598517658
+0.67420617247402481 -0.9582874004879669 0.82471644201722483
+0.58553016581808803 -1.0228788208449453 0.74024588618561449
+1.6183870394745821 -0.4753315538738162 -0.86574218443040063
+1.6010049252683982 -0.34519261004110269 -0.82178222598517636
+1.7257938275259754 -0.95828740048796668 -0.82471644201722449
+1.8144698341819119 -1.0228788208449451 -0.74024588618561449
+1.1186290539433099 -0.68361895436178255 -0.9944708773603258
+1.2405222816687171 -0.61807143088604777 -0.99043061207734606
+0.78161296052541807 -1.0246684461261839 -0.86574218443040096
+0.79899507473160225 -1.1548073899588973 -0.8217822259851767
+0.7313229501656493 -0.34367059745735723 -0.78437123837371081
+0.82403922210456626 -0.41075903908278338 -0.86230450765389366
+0.99171259951203328 0.074716442017224605 -0.52579382752597525
+0.92712117915505488 -0.0097541138143854011 -0.61446983418191226
+1.1336189543617827 0.24447087736032569 -0.081370946056690249
+1.0680714308860475 0.24043061207734606 0.040522281668716874
+1.5399483569044259 -0.0066545040394656585 -0.57608383788574391
+1.4073123918032642 0.030768167854331452 -0.58942568680894836
+1.9433454959605347 -0.17391616211425631 -0.33994835690442565
+1.9807681678543314 -0.16057431319105175 -0.2073123918032645
+1.9433454959605347 -1.3260838378857436 0.3399483569044256
+1.9807681678543316 -1.3394256868089478 0.20731239180326447
+1.7760838378857442 -1.0899483569044257 0.74334549596053434
+1.7894256868089482 -0.95731239180326466 0.78076816785433145
+1.4746684461261848 -1.6157421844304007 0.41838703947458178
+1.6048073899588982 -1.5717822259851764 0.40100492526839771
+0.99171259951203317 -1.5747164420172246 0.52579382752597525
+0.92712117915505499 -1.4902458861856145 0.61446983418191214
+1.2663810456382176 -1.7444708773603259 -0.081370946056690305
+1.3319285691139524 -1.7404306120773461 0.040522281668716881
+0.92533155387381627 -1.615742184430401 -0.41838703947458195
+0.79519261004110253 -1.5717822259851766 -0.40100492526839782
+1.6063294025426431 -1.5343712383737107 -0.46867704983435049
+1.5392409609172168 -1.6123045076538933 -0.37596077789543381
+1.6686770498343508 -1.1563294025426429 -0.78437123837371048
+1.5759607778954343 -1.0892409609172169 -0.86230450765389333
+2.0247164420172248 -1.2757938275259753 -0.20828740048796671
+1.9402458861856147 -1.3644698341819119 -0.27287882084494525
+2.1944708773603256 -0.83137094605669015 -0.066381045638217187
+2.1904306120773462 -0.70947771833128304 -0.13192856911395226
+2.1944708773603256 -0.66862905394330951 0.066381045638217215
+2.1904306120773462 -0.79052228166871696 0.13192856911395226
+2.0657421844304009 -0.33161296052541833 -0.27466844612618385
+2.0217822259851763 -0.34899507473160229 -0.40480738995889737
+0.86005164309557447 -1.4933454959605346 -0.57608383788574402
+0.9926876081967354 -1.5307681678543315 -0.58942568680894825
+0.45665450403946539 -1.3260838378857438 -0.33994835690442576
+0.4192318321456685 -1.339425686808948 -0.20731239180326452
+0.33425781556959899 -1.1683870394745817 -0.27466844612618391
+0.37821777401482348 -1.151004925268398 -0.40480738995889742
+0.37528355798277535 -1.2757938275259753 0.20828740048796671
+0.45975411381438525 -1.3644698341819119 0.27287882084494525
+0.41562876162628937 -1.2186770498343509 0.40632940254264294
+0.33769549234610641 -1.1259607778954337 0.33924096091721689
+0.79367059745735713 -1.5343712383737107 0.46867704983435055
+0.86075903908278317 -1.6123045076538935 0.37596077789543386
+1.5283955572053114 -0.10938546291290407 0.69409608332024086
+1.4001281403434436 -0.069819281493047614 0.70519707714513458
+1.2777044036438101 -0.42728941095227679 0.94330265629374277
+1.2802812773502414 -0.55260647397715412 0.97703158208487906
+1.1302598023666912 0.050472340674918903 0.59529852733606181
+1.0641637744730592 -0.030084692934636004 0.68063975088704354
+1.4345849586062216 -0.23428397075672924 0.82401873423925942
+1.5536293529417171 -0.28443495637683436 0.81129246939324062
+0.82850263027516902 -0.22222747306573265 0.76383628095354994
+0.91592045537741096 -0.28960691129913413 0.84103330267207566
+1.2672770740243227 -0.047722974677923635 0.70871769768752158
+1.3382736821873722 0.019577838502176204 0.62340222914316235
+1.0401421964121773 -0.55062303027104376 0.96679589706089264
+1.1602654114415887 -0.48973505164257786 0.96471929550963276
+1.0069945598044525 -0.12542737832173323 0.75674166021493716
+0.9318284823996803 -0.060703438848064839 0.67301878720586861
+1.4726998137406517 -0.48088283263773512 0.9236940845413727
+1.4595222183644985 -0.35389882611563678 0.88076789123048704
+1.0134390039211945 -0.36001233692795437 0.90172313788306924
+0.89598720512098962 -0.41433279178978172 0.89157374674348211
+0.9273001862593484 -0.48088283263773507 -0.92369408454137281
+0.94047778163550189 -0.35389882611563678 -0.88076789123048704
+1.3865609960788059 -0.36001233692795448 -0.90172313788306901
+1.5040127948790107 -0.41433279178978177 -0.891573746743482
+0.87160444279468874 -0.10938546291290407 -0.69409608332024098
+0.99987185965655645 -0.069819281493047614 -0.70519707714513458
+1.1222955963561905 -0.42728941095227674 -0.94330265629374299
+1.1197187226497587 -0.55260647397715412 -0.97703158208487906
+1.2697401976333089 0.050472340674918903 -0.59529852733606181
+1.3358362255269414 -0.030084692934636004 -0.68063975088704354
+0.96541504139377876 -0.23428397075672924 -0.82401873423925942
+0.84637064705828324 -0.28443495637683419 -0.81129246939324084
+1.5714973697248311 -0.22222747306573276 -0.76383628095354983
+1.4840795446225896 -0.28960691129913418 -0.84103330267207554
+1.1327229259756779 -0.047722974677923524 -0.70871769768752169
+1.0617263178126279 0.019577838502176315 -0.62340222914316246
+1.3598578035878233 -0.55062303027104387 -0.96679589706089242
+1.2397345885584119 -0.48973505164257786 -0.96471929550963276
+1.3930054401955481 -0.12542737832173323 -0.75674166021493716
+1.4681715176003201 -0.060703438848065061 -0.67301878720586839
+1.3993769697289566 -1.7167958970608925 0.15985780358782289
+1.4602649483574226 -1.7147192955096329 0.039734588558411603
+1.8245726216782669 -1.5067416602149368 0.19300544019554741
+1.889296561151935 -1.4230187872058684 0.2681715176003196
+1.4691171673622654 -1.6736940845413726 -0.27269981374065155
+1.5961011738843633 -1.630767891230487 -0.25952221836449829
+1.589987663072046 -1.651723137883069 0.18656099607880569
+1.5356672082102192 -1.6415737467434817 0.30401279487901056
+1.8406145370870961 -1.444096083320241 -0.32839555720531111
+1.8801807185069523 -1.4551970771451344 -0.20012814034344359
+1.5227105890477237 -1.6933026562937428 -0.077704403643809719
+1.3973935260228465 -1.7270315820848787 -0.080281277350241292
+2.0004723406749187 -1.3452985273360616 0.069740197633308881
+1.9199153070653643 -1.4306397508870434 0.135836225526941
+1.7157160292432709 -1.5740187342392593 -0.23458495860622131
+1.6655650436231657 -1.5612924693932406 -0.35362935294171666
+1.7277725269342676 -1.5138362809535497 0.37149736972483094
+1.660393088700866 -1.5910333026720753 0.28407954462258922
+1.9022770253220767 -1.4587176976875214 -0.067277074024322189
+1.9695778385021763 -1.3734022291431622 -0.13827368218737227
+1.8940960833202412 -0.42160444279468906 0.64061453708709593
+1.9051970771451345 -0.54987185965655661 0.68018071850695228
+2.1433026562937432 -0.67229559635619029 0.32271058904772337
+2.1770315820848789 -0.66971872264975862 0.19739352602284604
+1.0401421964121771 -0.94937696972895624 -0.96679589706089264
+1.1602654114415887 -1.0102649483574224 -0.96471929550963276
+1.0069945598044525 -1.3745726216782668 -0.75674166021493716
+0.93182848239968041 -1.439296561151935 -0.6730187872058685
+0.30842625325651785 -1.0540127948790103 -0.33566720821021845
+0.60470147266393859 -0.68025980236669126 0.80047234067491901
+0.51936024911295664 -0.61416377447305892 0.71991530706536411
+0.37598126576074054 -0.98458495860622119 0.51571602924327087
+0.38870753060675922 -1.1036293529417167 0.46556504362316592
+0.92730018625934885 -1.0191171673622652 0.92369408454137281
+0.94047778163550211 -1.1461011738843636 0.88076789123048704
+1.3865609960788059 -1.1399876630720458 0.90172313788306901
+1.5040127948790105 -1.0856672082102186 0.89157374674348189
+1.9638362809535499 -1.1214973697248305 0.52777252693426713
+2.0410333026720755 -1.034079544622589 0.46039308870086554
+1.9087176976875218 -0.68272292597567774 0.70227702532207648
+1.8234022291431624 -0.61172631781262787 0.7695778385021762
+1.7952985273360618 -0.81974019763330874 0.80047234067491868
+1.8806397508870436 -0.88583622552694086 0.71991530706536389
+2.0240187342392595 -0.51541504139377881 0.51571602924327065
+2.0112924693932408 -0.39637064705828329 0.46556504362316598
+2.0004723406749187 -0.15470147266393841 -0.069740197633308881
+1.9199153070653638 -0.069360249112956351 -0.135836225526941
+1.7157160292432707 0.074018734239259421 0.23458495860622128
+1.6655650436231659 0.061292469393240734 0.35362935294171677
+1.8406145370870961 -0.055903916679759136 0.32839555720531111
+1.8801807185069523 -0.044802922854865423 0.20012814034344364
+1.5227105890477235 0.19330265629374277 0.077704403643809677
+1.3973935260228463 0.22703158208487906 0.080281277350241251
+0.49128230231247838 -0.81727707402432204 0.7022770253220767
+0.57659777085683772 -0.88827368218737235 0.76957783850217654
+0.87160444279468918 -1.3906145370870964 0.69409608332024098
+0.99987185965655656 -1.4301807185069526 0.70519707714513435
+1.1222955963561905 -1.0727105890477233 0.94330265629374277
+1.1197187226497591 -0.94739352602284632 0.97703158208487906
+1.9638362809535499 -0.37850263027516906 -0.52777252693426713
+2.0410333026720755 -0.46592045537741078 -0.46039308870086587
+1.9087176976875218 -0.81727707402432193 -0.70227702532207648
+1.8234022291431624 -0.88827368218737224 -0.7695778385021762
+1.5283955572053114 -1.3906145370870959 -0.69409608332024075
+1.4001281403434434 -1.4301807185069526 -0.70519707714513435
+1.2777044036438097 -1.0727105890477233 -0.94330265629374277
+1.2802812773502414 -0.94739352602284621 -0.97703158208487884
+1.4726998137406517 -1.019117167362265 -0.9236940845413727
+1.459522218364498 -1.1461011738843632 -0.88076789123048704
+1.013439003921194 -1.1399876630720454 -0.90172313788306901
+0.89598720512098939 -1.0856672082102183 -0.89157374674348211
+0.43616371904645013 -1.1214973697248312 -0.52777252693426746
+0.35896669732792441 -1.0340795446225892 -0.46039308870086582
+0.49128230231247838 -0.68272292597567774 -0.70227702532207659
+0.57659777085683772 -0.61172631781262776 -0.76957783850217643
+0.60470147266393859 -0.81974019763330874 -0.80047234067491901
+0.51936024911295653 -0.88583622552694086 -0.719915307065364
+1.4691171673622654 0.17369408454137258 0.27269981374065155
+1.5961011738843633 0.13076789123048704 0.25952221836449818
+1.589987663072046 0.1517231378830689 -0.18656099607880569
+1.5356672082102183 0.141573746743482 -0.30401279487901056
+1.3993769697289566 0.21679589706089242 -0.15985780358782284
+1.4602649483574224 0.21471929550963276 -0.039734588558411575
+1.8245726216782669 0.0067416602149371618 -0.19300544019554747
+1.889296561151935 -0.076981212794131615 -0.26817151760031976
+2.1667958970608927 -0.59014219641217724 -0.19937696972895622
+2.1647192955096326 -0.71026541144158839 -0.26026494835742214
+1.9567416602149375 -0.55699455980445267 -0.62457262167826666
+1.8730187872058686 -0.48182848239968035 -0.68929656115193494
+2.1667958970608927 -0.90985780358782276 0.19937696972895622
+2.1647192955096326 -0.78973458855841161 0.26026494835742214
+1.9567416602149375 -0.94300544019554744 0.62457262167826655
+1.8730187872058686 -1.0181715176003194 0.68929656115193494
+1.3598578035878233 -0.94937696972895613 0.96679589706089242
+1.2397345885584119 -1.0102649483574224 0.96471929550963254
+1.3930054401955481 -1.3745726216782668 0.75674166021493705
+1.4681715176003203 -1.4392965611519348 0.67301878720586839
+1.5714973697248313 -1.2777725269342672 0.76383628095354972
+1.4840795446225896 -1.2103930887008656 0.84103330267207554
+1.1327229259756779 -1.4522770253220765 0.70871769768752158
+1.0617263178126279 -1.5195778385021765 0.62340222914316235
+0.55938546291290392 -1.444096083320241 0.32839555720531116
+0.51981928149304746 -1.4551970771451346 0.20012814034344362
+0.87728941095227664 -1.693302656293743 0.077704403643809719
+1.0026064739771541 -1.7270315820848792 0.080281277350241306
+0.93088283263773475 -1.6736940845413728 0.27269981374065155
+0.80389882611563657 -1.6307678912304873 0.25952221836449835
+0.81001233692795449 -1.6517231378830692 -0.18656099607880575
+0.86433279178978162 -1.6415737467434819 -0.30401279487901062
+0.82850263027516902 -1.277772526934267 -0.76383628095354994
+0.91592045537741096 -1.2103930887008658 -0.84103330267207566
+1.2672770740243218 -1.4522770253220765 -0.70871769768752158
+1.3382736821873722 -1.5195778385021765 -0.62340222914316235
+1.1302598023666912 -1.5504723406749188 -0.59529852733606148
+1.0641637744730592 -1.4699153070653641 -0.68063975088704365
+1.4345849586062212 -1.265716029243271 -0.82401873423925931
+1.5536293529417169 -1.2155650436231658 -0.81129246939324051
+1.7952985273360618 -0.68025980236669115 -0.80047234067491868
+1.8806397508870436 -0.61416377447305903 -0.71991530706536389
+2.0240187342392595 -0.98458495860622119 -0.51571602924327065
+2.0112924693932408 -1.1036293529417165 -0.4655650436231657
+1.8940960833202412 -1.078395557205311 -0.64061453708709593
+1.9051970771451345 -0.95012814034344339 -0.68018071850695228
+2.1433026562937432 -0.82770440364380959 -0.32271058904772343
+2.1770315820848789 -0.83028127735024104 -0.19739352602284604
+2.1236940845413725 -0.47730018625934845 0.26911716736226499
+2.0807678912304874 -0.49047778163550187 0.39610117388436322
+2.1017231378830692 -0.93656099607880539 0.38998766307204547
+2.0915737467434821 -1.0540127948790103 0.33566720821021817
+2.1236940845413725 -1.0226998137406516 -0.26911716736226488
+2.0807678912304874 -1.0095222183644981 -0.39610117388436322
+2.1017231378830692 -0.56343900392119417 -0.38998766307204574
+2.0915737467434821 -0.44598720512098944 -0.33566720821021834
+1.7277725269342676 0.013836280953549718 -0.37149736972483094
+1.660393088700866 0.091033302672075544 -0.28407954462258922
+1.9022770253220767 -0.041282302312478536 0.067277074024322203
+1.9695778385021763 -0.12659777085683765 0.13827368218737227
+1.0006230302710439 -1.7167958970608925 -0.15985780358782292
+0.93973505164257753 -1.7147192955096329 -0.039734588558411603
+0.57542737832173307 -1.5067416602149373 -0.19300544019554752
+0.51070343884806491 -1.4230187872058684 -0.26817151760031971
+0.44325833978506268 -0.94300544019554755 -0.62457262167826677
+0.52698121279413157 -1.0181715176003197 -0.68929656115193516
+0.67222747306573261 -1.5138362809535497 -0.37149736972483099
+0.73960691129913414 -1.5910333026720753 -0.28407954462258922
+0.49772297467792337 -1.4587176976875216 0.067277074024322203
+0.43042216149782375 -1.3734022291431622 0.13827368218737227
+0.50590391667975909 -1.0783955572053112 0.64061453708709626
+0.49480292285486549 -0.95012814034344351 0.6801807185069525
+0.39952765932508105 -1.3452985273360616 -0.069740197633308867
+0.48008469293463596 -1.4306397508870434 -0.135836225526941
+0.68428397075672898 -1.5740187342392593 0.23458495860622131
+0.7344349563768342 -1.5612924693932408 0.35362935294171671
+1.2697401976333094 -1.5504723406749188 0.59529852733606148
+1.3358362255269416 -1.4699153070653641 0.6806397508870432
+0.96541504139377909 -1.265716029243271 0.82401873423925931
+0.84637064705828369 -1.2155650436231662 0.81129246939324073
+0.27630591545862715 -1.0226998137406513 0.26911716736226515
+0.31923210876951291 -1.0095222183644981 0.39610117388436322
+1.8717091588743204 -0.29873333439274163 0.58750761901107262
+1.7666478495993445 -0.22627605216262514 0.63610018157997195
+1.5714973697248311 -0.22222747306573276 0.76383628095354983
+1.3362409534038142 0.2006072962094394 0.27889813733511909
+1.2694523319806277 0.1668554803037775 0.39313153246640248
+1.2697401976333089 0.050472340674918903 0.59529852733606159
+0.87160444279468885 -0.10938546291290407 0.69409608332024109
+0.70065936939781936 -0.75 0.86640575634619177
+0.80686846753359776 -0.68054766801937239 0.91685548030377773
+0.92730018625934885 -0.48088283263773507 0.92369408454137281
+1.4788981373351193 -0.88624095340381404 0.95060729620943918
+1.4807552987238062 -0.74999999999999989 0.95977938206574653
+1.3598578035878233 -0.55062303027104398 0.96679589706089242
+0.92110186266488103 -0.88624095340381381 -0.95060729620943951
+0.9192447012761944 -0.74999999999999989 -0.95977938206574664
+1.0401421964121771 -0.55062303027104398 -0.96679589706089264
+0.82850263027516891 -0.22222747306573276 -0.76383628095354983
+1.0637590465961864 0.20060729620943951 -0.27889813733511915
+1.1305476680193727 0.1668554803037775 -0.39313153246640248
+1.1302598023666912 0.050472340674918903 -0.59529852733606159
+1.7875076190110728 -0.078290841125679744 -0.45126666560725848
+1.7237239478373754 -0.11389981842002828 -0.56664784959934411
+1.528395557205311 -0.10938546291290407 -0.69409608332024109
+1.699340630602181 -0.74999999999999989 -0.86640575634619155
+1.5931315324664026 -0.68054766801937205 -0.91685548030377739
+1.4726998137406517 -0.48088283263773512 -0.9236940845413727
+1.2000000000000002 -1.6164057563461918 0.49934063060218076
+1.2694523319806277 -1.6668554803037776 0.39313153246640242
+1.4691171673622654 -1.6736940845413724 0.27269981374065155
+1.0637590465961859 -1.7006072962094394 -0.27889813733511915
+1.2 -1.7097793820657468 -0.28075529872380584
+1.3993769697289566 -1.7167958970608925 -0.15985780358782292
+1.6512666656072588 -1.3375076190110726 -0.67170915887432026
+1.7237239478373754 -1.3861001815799718 -0.56664784959934411
+1.7277725269342672 -1.5138362809535497 -0.37149736972483099
+2.1506072962094396 -1.0288981373351187 -0.13624095340381401
+2.1168554803037778 -1.143131532466402 -0.069452331980627571
+2.0004723406749192 -1.3452985273360611 -0.06974019763330884
+1.8717091588743204 -1.2012666656072584 0.58750761901107251
+1.836100181579972 -1.3166478495993439 0.52372394783737497
+1.8406145370870961 -1.4440960833202408 0.328395557205311
+1.7875076190110728 -0.078290841125679855 0.45126666560725853
+1.836100181579972 -0.183352150400656 0.52372394783737508
+1.9638362809535499 -0.37850263027516917 0.52777252693426735
+0.70065936939781936 -0.75 -0.86640575634619177
+0.80686846753359776 -0.81945233198062728 -0.91685548030377773
+0.92730018625934818 -1.019117167362265 -0.9236940845413727
+0.92110186266488114 -0.88624095340381404 0.9506072962094394
+0.80686846753359798 -0.81945233198062761 0.91685548030377773
+0.60470147266393859 -0.81974019763330874 0.80047234067491901
+0.92110186266488114 -0.61375904659618596 0.9506072962094394
+0.91924470127619462 -0.75 0.95977938206574676
+1.0401421964121773 -0.94937696972895624 0.96679589706089264
+1.6512666656072592 -1.3375076190110724 0.67170915887432014
+1.7666478495993445 -1.2737239478373752 0.63610018157997172
+1.8940960833202412 -1.0783955572053108 0.64061453708709593
+1.4788981373351193 -0.61375904659618596 0.95060729620943918
+1.5931315324664028 -0.68054766801937228 0.91685548030377739
+1.7952985273360618 -0.68025980236669126 0.80047234067491868
+2.1506072962094391 -0.47110186266488102 0.13624095340381404
+2.1168554803037778 -0.35686846753359769 0.069452331980627585
+2.0004723406749187 -0.15470147266393841 0.069740197633308867
+1.6512666656072588 -0.16249238098892749 0.67170915887432037
+1.7237239478373754 -0.11389981842002828 0.56664784959934422
+1.7277725269342672 0.013836280953549829 0.37149736972483099
+1.3362409534038142 0.2006072962094394 -0.27889813733511909
+1.2000000000000002 0.20977938206574664 -0.28075529872380572
+1.2 0.11640575634619166 0.49934063060218076
+1.1305476680193725 0.1668554803037775 0.39313153246640242
+0.5282908411256797 -1.2012666656072586 0.58750761901107262
+0.63335215040065596 -1.2737239478373756 0.63610018157997195
+0.82850263027516924 -1.2777725269342675 0.76383628095354994
+1.6512666656072588 -0.16249238098892749 -0.67170915887432026
+1.7666478495993445 -0.22627605216262503 -0.63610018157997172
+1.8940960833202412 -0.42160444279468895 -0.64061453708709593
+1.8717091588743204 -1.2012666656072586 -0.58750761901107251
+1.7666478495993443 -1.2737239478373752 -0.63610018157997172
+1.5714973697248311 -1.2777725269342675 -0.76383628095354983
+1.4788981373351193 -0.61375904659618596 -0.95060729620943918
+1.4807552987238062 -0.74999999999999989 -0.95977938206574653
+1.3598578035878233 -0.94937696972895602 -0.96679589706089242
+0.74873333439274137 -1.3375076190110722 -0.67170915887432059
+0.63335215040065551 -1.2737239478373747 -0.63610018157997217
+0.50590391667975909 -1.0783955572053112 -0.64061453708709593
+0.92110186266488114 -0.61375904659618596 -0.9506072962094394
+0.80686846753359776 -0.68054766801937217 -0.91685548030377773
+0.60470147266393859 -0.68025980236669126 -0.80047234067491901
+1.0637590465961857 0.2006072962094394 0.27889813733511909
+1.2 0.20977938206574664 0.28075529872380572
+1.3993769697289566 0.21679589706089242 0.15985780358782287
+1.2000000000000002 0.11640575634619166 -0.49934063060218076
+1.2694523319806277 0.1668554803037775 -0.39313153246640242
+1.4691171673622654 0.17369408454137247 -0.27269981374065155
+2.0664057563461915 -0.25065936939781941 0
+2.1168554803037778 -0.35686846753359769 -0.069452331980627585
+2.1236940845413725 -0.47730018625934845 -0.26911716736226499
+2.0664057563461915 -1.2493406306021804 0
+2.1168554803037778 -1.1431315324664022 0.069452331980627571
+2.1236940845413725 -1.0226998137406511 0.26911716736226499
+1.6993406306021812 -0.75 0.86640575634619155
+1.5931315324664026 -0.81945233198062728 0.9168554803037775
+1.4726998137406517 -1.019117167362265 0.9236940845413727
+1.7875076190110732 -1.4217091588743203 0.45126666560725837
+1.7237239478373758 -1.3861001815799714 0.56664784959934411
+1.5283955572053118 -1.3906145370870957 0.69409608332024086
+0.74873333439274148 -1.3375076190110726 0.67170915887432037
+0.67627605216262487 -1.3861001815799721 0.56664784959934433
+0.67222747306573261 -1.5138362809535497 0.37149736972483099
+1.3362409534038142 -1.7006072962094394 0.27889813733511915
+1.2000000000000002 -1.7097793820657468 0.28075529872380584
+1.0006230302710439 -1.7167958970608925 0.15985780358782295
+0.61249238098892722 -1.4217091588743203 -0.45126666560725853
+0.67627605216262476 -1.3861001815799718 -0.56664784959934444
+0.87160444279468885 -1.3906145370870959 -0.69409608332024109
+1.3362409534038142 -1.7006072962094394 -0.27889813733511915
+1.2694523319806275 -1.6668554803037776 -0.39313153246640242
+1.2697401976333087 -1.550472340674919 -0.59529852733606137
+1.4788981373351193 -0.88624095340381381 -0.95060729620943918
+1.5931315324664026 -0.81945233198062717 -0.9168554803037775
+1.7952985273360618 -0.81974019763330874 -0.80047234067491879
+1.7875076190110728 -1.4217091588743203 -0.45126666560725848
+1.836100181579972 -1.3166478495993443 -0.52372394783737497
+1.9638362809535499 -1.1214973697248309 -0.52777252693426713
+2.1506072962094391 -0.47110186266488108 -0.13624095340381398
+2.1597793820657469 -0.46924470127619466 0
+2.1667958970608927 -0.59014219641217724 0.19937696972895616
+2.1506072962094391 -1.0288981373351189 0.13624095340381398
+2.1597793820657469 -1.0307552987238053 0
+2.1667958970608927 -0.90985780358782276 -0.19937696972895616
+1.8717091588743204 -0.29873333439274152 -0.58750761901107251
+1.836100181579972 -0.18335215040065589 -0.52372394783737497
+1.8406145370870961 -0.055903916679759136 -0.32839555720531111
+1.2 -1.6164057563461918 -0.49934063060218087
+1.1305476680193722 -1.6668554803037776 -0.39313153246640242
+0.93088283263773519 -1.6736940845413728 -0.27269981374065166
+0.33359424365380819 -1.2493406306021806 0
+0.28314451969622234 -1.1431315324664022 -0.069452331980627627
+0.27630591545862715 -1.0226998137406511 -0.26911716736226515
+0.52829084112567948 -1.2012666656072586 -0.58750761901107273
+0.56389981842002801 -1.3166478495993443 -0.5237239478373753
+0.55938546291290392 -1.444096083320241 -0.32839555720531116
+0.61249238098892733 -1.4217091588743203 0.45126666560725864
+0.56389981842002823 -1.3166478495993443 0.52372394783737519
+0.43616371904645013 -1.1214973697248309 0.52777252693426724
+0.28314451969622234 -1.1431315324664022 0.069452331980627627
+0.39952765932508105 -1.3452985273360616 0.069740197633308854
+1.0637590465961864 -1.7006072962094394 0.27889813733511915
+1.1305476680193727 -1.6668554803037776 0.39313153246640242
+1.1302598023666912 -1.550472340674919 0.59529852733606137
+1.2000000000000002 -0.12421811130996729 0.77999809473327275
+1.2548571407136169 -0.20998203120107972 0.83986385056568236
+1.3865609960788059 -0.36001233692795459 0.90172313788306913
+1.4022655037944636 -0.75 0.97933072349169759
+1.6183870394745821 -0.4753315538738162 0.86574218443040085
+1.0837308646443482 -0.19607638880232214 0.82440895259656966
+1.3930054401955474 -0.12542737832173334 0.75674166021493716
+1.7521688397941486 -0.28373393338202185 0.69116244652106429
+1.5399483569044259 -0.0066545040394655475 0.57608383788574402
+1.1281417225076453 -0.31234552415797412 0.8962672300889245
+1.1327229259756779 -0.047722974677923413 0.70871769768752169
+1.3389936067269161 0.14342795031552757 0.42716188369754915
+0.99171259951203328 0.074716442017224605 0.52579382752597525
+1.271858277492355 -0.31234552415797412 0.8962672300889245
+0.96541504139377876 -0.23428397075672924 0.82401873423925942
+0.7313229501656493 -0.34367059745735706 0.78437123837371059
+1.3162691353556522 -0.19607638880232214 0.82440895259656966
+1.1222955963561905 -0.42728941095227674 0.94330265629374299
+0.77283811630245081 -0.61100639327308404 0.89342795031552769
+1.1186290539433099 -0.68361895436178266 0.9944708773603258
+1.0837308646443482 -0.19607638880232214 -0.82440895259656966
+1.1660964225133497 -0.26483917191469669 -0.87376742805233321
+1.2777044036438097 -0.42728941095227674 -0.94330265629374299
+1.6271618836975494 -0.61100639327308404 -0.89342795031552757
+1.2813709460566907 -0.68361895436178266 -0.9944708773603258
+1.2000000000000002 -0.12421811130996729 -0.77999809473327275
+1.013439003921194 -0.36001233692795459 -0.90172313788306913
+0.99773449620553689 -0.75 -0.9793307234916977
+0.78161296052541818 -0.47533155387381615 -0.86574218443040096
+1.3162691353556522 -0.19607638880232214 -0.82440895259656966
+1.0069945598044523 -0.12542737832173334 -0.75674166021493716
+1.271858277492355 -0.31234552415797412 -0.8962672300889245
+1.2672770740243227 -0.047722974677923524 -0.70871769768752158
+1.0610063932730844 0.14342795031552769 -0.42716188369754926
+1.4082874004879666 0.074716442017224605 -0.52579382752597525
+1.1281417225076453 -0.31234552415797412 -0.8962672300889245
+1.4345849586062216 -0.23428397075672924 -0.82401873423925942
+1.6662660666179787 -0.058837553478935933 -0.55216883979414821
+1.6686770498343511 -0.34367059745735712 -0.78437123837371048
+1.6376544758420264 -1.6462672300889243 -0.071858277492354988
+1.6851608280853034 -1.6237674280523331 0.033903577486650918
+1.7157160292432714 -1.5740187342392593 0.23458495860622122
+1.8911624465210648 -1.302168839794148 0.4662660666179782
+1.6063294025426436 -1.5343712383737103 0.46867704983435066
+1.7539236111976781 -1.5744089525965697 -0.11626913535565191
+1.5227105890477235 -1.6933026562937428 0.077704403643809691
+1.3389936067269161 -1.6434279503155274 0.42716188369754937
+1.2663810456382176 -1.7444708773603259 0.081370946056690305
+1.825781888690033 -1.5299980947332725 0
+1.589987663072046 -1.651723137883069 -0.18656099607880564
+1.2 -1.7293307234916977 -0.20226550379446348
+1.4746684461261841 -1.6157421844304007 -0.41838703947458189
+1.7539236111976781 -1.5744089525965697 0.11626913535565191
+1.8245726216782669 -1.5067416602149368 -0.19300544019554738
+1.6662660666179783 -1.4411624465210644 -0.55216883979414821
+1.9433454959605347 -1.3260838378857436 -0.33994835690442571
+1.6376544758420264 -1.6462672300889243 0.071858277492354988
+1.9022770253220767 -1.4587176976875214 0.067277074024322203
+2.0934279503155278 -1.1771618836975488 -0.13899360672691582
+2.0247164420172248 -1.275793827525975 0.20828740048796673
+1.9799980947332727 -0.75 0.62578188869003271
+2.0398638505656823 -0.6951428592863832 0.54001796879892017
+2.1017231378830692 -0.56343900392119428 0.38998766307204552
+2.1793307234916974 -0.54773449620553694 0
+2.0657421844304009 -0.33161296052541811 0.27466844612618396
+1.2718582774923548 -1.187654475842026 -0.8962672300889245
+0.96541504139377876 -1.2657160292432705 -0.82401873423925953
+0.73373393338202175 -1.4411624465210644 -0.55216883979414821
+0.7313229501656493 -1.1563294025426427 -0.78437123837371059
+0.30657204968447227 -1.1771618836975493 -0.13899360672691591
+0.44325833978506279 -0.94300544019554755 0.62457262167826699
+0.50883755347893578 -1.3021688397941484 0.46626606661797843
+0.62391616211425616 -1.0899483569044262 0.74334549596053456
+1.0837308646443482 -1.3039236111976777 0.82440895259656966
+1.2777044036438101 -1.0727105890477233 0.94330265629374277
+1.6271618836975499 -0.88899360672691596 0.89342795031552724
+1.2813709460566907 -0.81638104563821712 0.9944708773603258
+2.0962672300889245 -0.82185827749235496 0.43765447584202566
+2.0398638505656823 -0.8048571407136168 0.54001796879892006
+1.9087176976875218 -0.81727707402432193 0.70227702532207636
+1.6271618836975499 -0.61100639327308437 0.89342795031552724
+1.7257938275259752 -0.95828740048796668 0.8247164420172246
+2.0244089525965698 -0.86626913535565175 0.55392361119767775
+1.9567416602149375 -0.55699455980445256 0.62457262167826677
+1.8911624465210641 -0.19783116020585167 0.46626606661797843
+1.7760838378857438 -0.41005164309557446 0.74334549596053456
+1.7539236111976779 0.074408952596569544 -0.11626913535565189
+1.8245726216782669 0.0067416602149371618 0.19300544019554744
+1.6662660666179785 -0.058837553478935822 0.55216883979414844
+1.9433454959605347 -0.17391616211425609 0.33994835690442565
+1.8257818886900328 0.02999809473327264 0
+1.589987663072046 0.1517231378830689 0.18656099607880564
+1.2 0.22933072349169759 0.20226550379446331
+1.4746684461261839 0.11574218443040096 0.41838703947458178
+1.0610063932730838 0.14342795031552757 0.42716188369754932
+1.1336189543617827 0.24447087736032569 0.081370946056690249
+0.49128230231247827 -0.68272292597567774 0.70227702532207659
+0.77283811630245092 -0.88899360672691596 0.89342795031552769
+0.67420617247402481 -0.54171259951203321 0.82471644201722483
+1.2000000000000002 -1.3757818886900326 0.77999809473327286
+1.0134390039211947 -1.1399876630720456 0.90172313788306913
+0.99773449620553689 -0.74999999999999989 0.9793307234916977
+0.78161296052541851 -1.0246684461261841 0.86574218443040096
+2.0962672300889245 -0.67814172250764504 -0.43765447584202588
+1.9087176976875218 -0.68272292597567774 -0.70227702532207636
+1.6271618836975494 -0.88899360672691574 -0.89342795031552757
+1.7257938275259752 -0.54171259951203332 -0.8247164420172246
+1.2 -1.3757818886900326 -0.77999809473327286
+1.2548571407136171 -1.2900179687989204 -0.83986385056568236
+1.3865609960788055 -1.1399876630720456 -0.90172313788306913
+1.4022655037944636 -0.74999999999999989 -0.97933072349169759
+1.6183870394745821 -1.0246684461261837 -0.86574218443040085
+1.3162691353556519 -1.3039236111976777 -0.82440895259656966
+1.1222955963561905 -1.0727105890477233 -0.94330265629374277
+0.77283811630245081 -0.88899360672691596 -0.89342795031552769
+1.1186290539433099 -0.81638104563821712 -0.9944708773603258
+0.49128230231247827 -0.81727707402432204 -0.70227702532207659
+0.77283811630245081 -0.61100639327308426 -0.89342795031552769
+0.67420617247402481 -0.95828740048796679 -0.82471644201722483
+0.37559104740343041 -0.86626913535565175 -0.55392361119767775
+1.2000000000000002 0.22933072349169759 -0.20226550379446331
+1.7539236111976779 0.074408952596569544 0.11626913535565189
+1.5227105890477235 0.19330265629374277 -0.077704403643809677
+1.3389936067269161 0.14342795031552757 -0.42716188369754932
+1.2663810456382176 0.24447087736032569 -0.081370946056690249
+1.6376544758420262 0.14626723008892439 0.071858277492354961
+1.6851608280853034 0.12376742805233321 -0.033903577486650911
+1.7157160292432707 0.074018734239259421 -0.23458495860622128
+1.8911624465210641 -0.19783116020585167 -0.46626606661797843
+1.6063294025426431 0.034371238373710589 -0.46867704983435055
+2.0962672300889245 -0.82185827749235496 -0.43765447584202588
+2.0240187342392595 -0.51541504139377881 -0.51571602924327065
+1.7521688397941486 -0.28373393338202163 -0.69116244652106418
+1.9843712383737104 -0.28132295016564945 -0.40632940254264299
+2.0962672300889245 -0.67814172250764504 0.43765447584202566
+2.0240187342392595 -0.98458495860622119 0.51571602924327065
+1.7521688397941486 -1.2162660666179781 0.69116244652106418
+1.9843712383737109 -1.2186770498343504 0.4063294025426426
+1.1281417225076453 -1.187654475842026 0.8962672300889245
+1.4345849586062214 -1.265716029243271 0.82401873423925931
+1.6662660666179789 -1.441162446521064 0.55216883979414799
+1.6686770498343511 -1.1563294025426427 0.78437123837371048
+1.271858277492355 -1.187654475842026 0.8962672300889245
+1.2548571407136171 -1.2900179687989204 0.83986385056568236
+1.2672770740243227 -1.4522770253220765 0.70871769768752169
+1.0610063932730844 -1.6434279503155276 0.42716188369754937
+1.4082874004879673 -1.5747164420172246 0.52579382752597537
+0.57421811130996692 -1.5299980947332723 0
+0.81001233692795438 -1.651723137883069 0.18656099607880566
+1.2000000000000002 -1.7293307234916977 0.20226550379446345
+0.92533155387381616 -1.6157421844304007 0.41838703947458189
+0.6460763888023221 -1.5744089525965697 0.11626913535565191
+0.87728941095227653 -1.6933026562937428 -0.077704403643809691
+1.0610063932730844 -1.6434279503155276 -0.42716188369754948
+1.1336189543617827 -1.7444708773603259 -0.081370946056690305
+1.1281417225076453 -1.187654475842026 -0.8962672300889245
+1.1451428592863828 -1.2900179687989204 -0.83986385056568236
+1.1327229259756779 -1.4522770253220765 -0.70871769768752169
+1.3389936067269161 -1.6434279503155274 -0.42716188369754937
+0.99171259951203317 -1.5747164420172246 -0.52579382752597537
+1.0837308646443482 -1.3039236111976777 -0.82440895259656966
+1.3930054401955474 -1.3745726216782668 -0.75674166021493716
+1.7521688397941486 -1.2162660666179783 -0.69116244652106418
+1.5399483569044259 -1.4933454959605346 -0.57608383788574391
+2.0244089525965694 -0.63373086464434825 -0.55392361119767775
+1.9567416602149375 -0.94300544019554744 -0.62457262167826677
+1.8911624465210641 -1.3021688397941484 -0.46626606661797826
+1.7760838378857438 -1.0899483569044257 -0.74334549596053456
+1.9799980947332727 -0.75 -0.62578188869003293
+2.0398638505656823 -0.80485714071361691 -0.54001796879892028
+2.1017231378830692 -0.9365609960788055 -0.38998766307204552
+2.1793307234916974 -0.95226550379446329 0
+2.0657421844304009 -1.1683870394745819 -0.27466844612618391
+2.0244089525965694 -0.63373086464434825 0.55392361119767775
+2.1433026562937432 -0.82770440364380959 0.32271058904772337
+2.0934279503155278 -1.1771618836975488 0.1389936067269158
+2.1944708773603256 -0.83137094605669015 0.066381045638217215
+2.0244089525965694 -0.86626913535565175 -0.55392361119767775
+2.1433026562937432 -0.67229559635619018 -0.32271058904772343
+2.0934279503155278 -0.32283811630245074 -0.13899360672691588
+2.1944708773603256 -0.66862905394330985 -0.066381045638217215
+1.6376544758420262 0.14626723008892439 -0.071858277492354961
+1.9022770253220767 -0.041282302312478425 -0.067277074024322217
+2.0934279503155278 -0.32283811630245085 0.13899360672691591
+2.0247164420172248 -0.22420617247402475 -0.20828740048796671
+0.76234552415797396 -1.6462672300889245 0.071858277492355002
+0.68428397075672931 -1.5740187342392593 -0.23458495860622131
+0.50883755347893578 -1.3021688397941484 -0.46626606661797843
+0.79367059745735691 -1.5343712383737107 -0.46867704983435077
+0.37598126576074054 -0.98458495860622119 -0.51571602924327076
+0.64783116020585152 -1.2162660666179783 -0.69116244652106429
+0.41562876162628937 -1.2186770498343509 -0.40632940254264294
+0.76234552415797374 -1.6462672300889243 -0.071858277492354988
+0.65998203120107946 -1.5898638505656821 -0.054857140713616928
+0.49772297467792337 -1.4587176976875216 -0.067277074024322231
+0.30657204968447227 -1.1771618836975493 0.13899360672691594
+0.37528355798277513 -1.275793827525975 -0.20828740048796673
+0.3342578155695991 -1.1683870394745819 0.27466844612618396
+0.6460763888023221 -1.5744089525965697 -0.11626913535565191
+0.57542737832173307 -1.5067416602149373 0.19300544019554747
+0.73373393338202175 -1.4411624465210644 0.55216883979414821
+0.45665450403946539 -1.3260838378857438 0.33994835690442576
+1.3162691353556522 -1.3039236111976777 0.82440895259656966
+1.0069945598044532 -1.374572621678267 0.75674166021493738
+0.64783116020585174 -1.2162660666179785 0.6911624465210644
+0.86005164309557425 -1.4933454959605346 0.57608383788574391
+0.37559104740343063 -0.86626913535565186 0.55392361119767797
+1.6585335468418487 -0.54206325863390559 0.86400769557376289
+1.686966450462785 -0.47427145868032006 0.8287565671687902
+1.6054741487319151 -0.008077136227847892 0.53398612240605792
+1.5417901167060055 0.037928268229677653 0.51219972690999771
+0.99206325863390554 0.11400769557376311 0.45853354684184833
+0.68780027309000236 -0.40820988329399444 0.78792826822967776
+1.0779151681983894 -0.74999999999999989 0.9925196692479058
+1.159171701060888 -0.75 0.99916617737278246
+1.322084831801611 -0.74999999999999989 -0.9925196692479058
+1.2408282989391131 -0.75 -0.99916617737278246
+0.74146645315815185 -0.54206325863390548 -0.86400769557376322
+0.71303354953721532 -0.47427145868032 -0.82875656716879043
+1.4079367413660944 0.11400769557376311 -0.45853354684184833
+1.4757285413196803 0.078756567168790315 -0.48696645046278492
+1.7339861224060584 -0.34452585126808516 -0.741922863772152
+1.7121997269099978 -0.40820988329399444 -0.78792826822967765
+1.6054741487319153 -1.491922863772152 0.53398612240605781
+1.5417901167060062 -1.5379282682296775 0.5121997269099976
+1.2 -1.7425196692479057 0.12208483180161099
+1.2 -1.7491661773727825 0.040828298939112592
+1.4079367413660944 -1.614007695573763 -0.45853354684184833
+1.4757285413196803 -1.5787565671687904 -0.48696645046278475
+1.9419228637721524 -1.2839861224060574 -0.40547414873191495
+1.9879282682296777 -1.2621997269099974 -0.34179011670600551
+2.0640076955737636 -1.2085335468418477 0.20793674136609439
+2.0287565671687906 -1.2369664504627846 0.27572854131967994
+2.0640076955737632 -0.29146645315815217 0.20793674136609444
+2.0287565671687906 -0.26303354953721531 0.27572854131968005
+0.66601387759394248 -1.1554741487319151 -0.74192286377215233
+0.68780027309000236 -1.0917901167060053 -0.78792826822967776
+0.66601387759394248 -1.1554741487319153 0.74192286377215233
+0.68780027309000258 -1.0917901167060058 0.78792826822967776
+1.322084831801611 -0.74999999999999989 0.9925196692479058
+1.2408282989391131 -0.75 0.99916617737278246
+1.6585335468418487 -0.95793674136609475 0.86400769557376267
+1.6869664504627853 -1.0257285413196802 0.82875656716879009
+1.7339861224060584 -0.34452585126808544 0.741922863772152
+1.712199726909998 -0.40820988329399466 0.78792826822967765
+1.9419228637721524 -0.21601387759394264 0.40547414873191501
+1.9879282682296777 -0.23780027309000251 0.34179011670600551
+1.4079367413660944 0.11400769557376311 0.45853354684184816
+1.4757285413196803 0.078756567168790315 0.48696645046278475
+1.2 0.2425196692479058 0.12208483180161095
+1.2 0.24916617737278246 0.040828298939112578
+0.74146645315815196 -0.54206325863390559 0.86400769557376322
+0.71303354953721532 -0.47427145868031984 0.82875656716879031
+0.74146645315815207 -0.95793674136609486 0.86400769557376322
+0.71303354953721532 -1.0257285413196804 0.82875656716879031
+1.6585335468418489 -0.5420632586339057 -0.86400769557376278
+1.6869664504627853 -0.47427145868031989 -0.82875656716879009
+1.6585335468418487 -0.95793674136609452 -0.86400769557376267
+1.686966450462785 -1.0257285413196799 -0.8287565671687902
+1.0779151681983894 -0.74999999999999989 -0.9925196692479058
+1.159171701060888 -0.75 -0.99916617737278246
+0.74146645315815196 -0.95793674136609475 -0.86400769557376322
+0.71303354953721521 -1.0257285413196802 -0.82875656716879043
+0.68780027309000247 -0.4082098832939946 -0.78792826822967776
+0.99206325863390588 0.11400769557376322 -0.45853354684184827
+1.2 0.2425196692479058 -0.12208483180161095
+1.2 0.24916617737278246 -0.040828298939112578
+1.6054741487319153 -0.008077136227848003 -0.53398612240605781
+1.5417901167060057 0.037928268229677653 -0.5121997269099976
+1.9419228637721524 -0.21601387759394264 -0.40547414873191495
+1.9879282682296777 -0.23780027309000251 -0.3417901167060054
+1.9419228637721528 -1.2839861224060569 0.40547414873191484
+1.9879282682296779 -1.2621997269099974 0.34179011670600534
+1.7339861224060584 -1.1554741487319149 0.741922863772152
+1.7121997269099978 -1.0917901167060053 0.78792826822967765
+1.4079367413660953 -1.6140076955737628 0.45853354684184833
+1.4757285413196806 -1.57875656716879 0.48696645046278486
+0.99206325863390588 -1.614007695573763 0.45853354684184833
+0.92427145868032001 -1.5787565671687904 0.48696645046278475
+1.2 -1.7425196692479057 -0.12208483180161099
+1.2 -1.7491661773727825 -0.040828298939112592
+0.99206325863390588 -1.614007695573763 -0.45853354684184849
+0.92427145868032001 -1.5787565671687904 -0.48696645046278492
+1.6054741487319149 -1.4919228637721522 -0.53398612240605758
+1.5417901167060055 -1.5379282682296778 -0.5121997269099976
+1.7339861224060584 -1.1554741487319149 -0.741922863772152
+1.712199726909998 -1.0917901167060053 -0.78792826822967754
+2.0640076955737632 -1.2085335468418479 -0.20793674136609444
+2.0287565671687906 -1.2369664504627846 -0.27572854131968005
+2.1925196692479059 -0.87208483180161089 -2.4628875390745799e-18
+2.1991661773727822 -0.79082829893911255 0
+2.1925196692479059 -0.62791516819838922 2.4628875390745807e-18
+2.1991661773727822 -0.70917170106088734 0
+2.0640076955737632 -0.29146645315815212 -0.20793674136609447
+2.0287565671687906 -0.26303354953721531 -0.27572854131968005
+0.79452585126808528 -1.4919228637721522 -0.53398612240605792
+0.85820988329399461 -1.5379282682296775 -0.51219972690999771
+0.45807713622784751 -1.2839861224060574 -0.40547414873191506
+0.41207173177032219 -1.2621997269099976 -0.34179011670600545
+0.33599230442623673 -1.2085335468418481 -0.20793674136609458
+0.37124343283120964 -1.2369664504627851 -0.27572854131968011
+0.33599230442623684 -1.2085335468418481 0.20793674136609461
+0.37124343283120953 -1.2369664504627846 0.27572854131968016
+0.45807713622784763 -1.2839861224060576 0.40547414873191512
+0.4120717317703223 -1.2621997269099978 0.34179011670600562
+0.79452585126808539 -1.4919228637721524 0.53398612240605769
+0.85820988329399461 -1.537928268229678 0.51219972690999771
+1.5850500562448067 -0.16285875964110386 0.71204046096811657
+1.5180233001589554 -0.16663313718873862 0.74735820322637392
+1.3129504910198773 -0.36631165010094457 0.91652901576006229
+1.3549016200234227 -0.4242154556775744 0.93266817185682316
+1.2000000000000002 0.075115262488245294 0.56496442685265946
+1.2000000000000002 0.029916071523905408 0.62588411178006298
+1.3827577335161512 -0.18355391658479392 0.80357852474018532
+1.4506360861103191 -0.17357936956725528 0.77776655183340049
+0.81494994375519358 -0.16285875964110375 0.7120404609681168
+0.88197669984104476 -0.16663313718873862 0.74735820322637392
+1.2000000000000002 -0.0706034255649165 0.73377128224391142
+1.2000000000000002 -0.018677749543832611 0.68203208574650409
+0.96202597787065125 -0.54790881588591023 0.95001448309746594
+1.0034507912873563 -0.4846564373476937 0.94390741193901817
+1.0172422664838487 -0.18355391658479348 0.80357852474018532
+0.94936391388968078 -0.17357936956725528 0.77776655183340049
+1.4379740221293495 -0.54790881588591045 0.95001448309746583
+1.3965492087126441 -0.48465643734769376 0.94390741193901806
+1.0870495089801231 -0.36631165010094457 0.9165290157600624
+1.0450983799765776 -0.42421545567757435 0.93266817185682316
+0.96202597787065125 -0.54790881588591045 -0.95001448309746594
+1.0034507912873558 -0.48465643734769376 -0.94390741193901806
+1.3129504910198775 -0.36631165010094457 -0.9165290157600624
+1.3549016200234227 -0.42421545567757435 -0.93266817185682316
+0.81494994375519336 -0.16285875964110375 -0.71204046096811668
+0.88197669984104476 -0.16663313718873862 -0.74735820322637392
+1.0870495089801231 -0.36631165010094452 -0.9165290157600624
+1.0450983799765772 -0.4242154556775744 -0.93266817185682316
+1.2000000000000002 0.075115262488245294 -0.56496442685265946
+1.2000000000000002 0.029916071523905408 -0.62588411178006298
+1.017242266483849 -0.18355391658479381 -0.80357852474018554
+0.94936391388968078 -0.17357936956725528 -0.77776655183340049
+1.5850500562448067 -0.16285875964110386 -0.71204046096811668
+1.5180233001589554 -0.16663313718873862 -0.74735820322637392
+1.2000000000000002 -0.0706034255649165 -0.73377128224391142
+1.2000000000000002 -0.018677749543832611 -0.68203208574650409
+1.4379740221293495 -0.54790881588591023 -0.95001448309746561
+1.3965492087126441 -0.48465643734769376 -0.94390741193901806
+1.3827577335161514 -0.18355391658479359 -0.80357852474018521
+1.4506360861103194 -0.17357936956725528 -0.77776655183340049
+1.40209118411409 -1.7000144830974659 0.23797402212934909
+1.4653435626523068 -1.6939074119390178 0.19654920871264414
+1.7664460834152067 -1.553578524740185 0.18275773351615077
+1.776420630432745 -1.5277665518334003 0.25063608611031901
+1.4020911841140902 -1.7000144830974655 -0.23797402212934918
+1.4653435626523068 -1.6939074119390178 -0.19654920871264417
+1.5836883498990559 -1.6665290157600621 0.11295049101987709
+1.5257845443224263 -1.682668171856823 0.15490162002342267
+1.7871412403588964 -1.4620404609681166 -0.38505005624480632
+1.7833668628112616 -1.4973582032263737 -0.31802330015895508
+1.5836883498990559 -1.6665290157600623 -0.11295049101987707
+1.5257845443224263 -1.682668171856823 -0.15490162002342261
+2.0251152624882458 -1.3149644268526588 4.9279074600009303e-18
+1.9799160715239057 -1.3758841117800626 6.5652635294160463e-18
+1.7664460834152065 -1.553578524740185 -0.18275773351615091
+1.776420630432745 -1.5277665518334005 -0.25063608611031912
+1.7871412403588969 -1.4620404609681164 0.38505005624480626
+1.783366862811262 -1.4973582032263735 0.31802330015895508
+1.8793965744350842 -1.4837712822439109 3.6838438251301876e-18
+1.9313222504561676 -1.4320320857465036 6.5571195165482265e-18
+1.9120404609681168 -0.3649499437551938 0.58714124035889637
+1.9473582032263739 -0.43197669984104503 0.58336686281126138
+2.1165290157600625 -0.63704950898012302 0.38368834989905543
+2.1326681718568232 -0.59509837997657744 0.32578454432242576
+0.96202597787065103 -0.95209118411408988 -0.95001448309746583
+1.0034507912873558 -1.0153435626523062 -0.94390741193901806
+1.017242266483849 -1.3164460834152065 -0.80357852474018521
+0.94936391388968078 -1.3264206304327446 -0.77776655183340071
+0.63503557314734083 -0.75 0.82511526248824552
+0.57411588821993709 -0.75 0.77991607152390563
+0.39642147525981486 -0.93275773351615077 0.56644608341520686
+0.42223344816659947 -1.0006360861103192 0.57642063043274483
+0.96202597787065158 -0.95209118411408999 0.95001448309746594
+1.0034507912873563 -1.0153435626523062 0.94390741193901817
+1.3129504910198773 -1.1336883498990558 0.91652901576006229
+1.3549016200234227 -1.0757845443224259 0.93266817185682316
+1.9120404609681168 -1.135050056244806 0.58714124035889637
+1.9473582032263741 -1.068023300158955 0.58336686281126127
+1.9337712822439117 -0.75000000000000011 0.67939657443508328
+1.882032085746504 -0.75 0.73132225045616739
+1.7649644268526601 -0.75 0.82511526248824485
+1.825884111780063 -0.75 0.77991607152390541
+2.0035785247401852 -0.56724226648384923 0.56644608341520641
+1.9777665518334007 -0.49936391388968099 0.57642063043274483
+2.0251152624882454 -0.18503557314734087 -4.9279074600009318e-18
+1.9799160715239057 -0.12411588821993724 -6.5652635294160447e-18
+1.7664460834152065 0.053578524740185096 0.18275773351615091
+1.7764206304327446 0.027766551833400488 0.25063608611031907
+1.7871412403588964 -0.037959539031883538 0.38505005624480637
+1.7833668628112616 -0.0026417967736263037 0.31802330015895508
+1.5836883498990559 0.16652901576006207 0.11295049101987709
+1.5257845443224261 0.18266817185682305 0.15490162002342259
+0.46622871775608876 -0.75 0.67939657443508383
+0.51796791425349598 -0.75 0.73132225045616761
+0.8149499437551937 -1.3371412403588963 0.71204046096811668
+0.88197669984104521 -1.3333668628112616 0.74735820322637403
+1.0870495089801235 -1.1336883498990558 0.9165290157600624
+1.0450983799765778 -1.0757845443224259 0.93266817185682316
+1.9120404609681168 -0.36494994375519357 -0.58714124035889637
+1.9473582032263739 -0.43197669984104503 -0.58336686281126138
+1.9337712822439117 -0.75 -0.67939657443508328
+1.882032085746504 -0.75 -0.73132225045616739
+1.5850500562448067 -1.3371412403588963 -0.71204046096811657
+1.5180233001589554 -1.3333668628112614 -0.74735820322637381
+1.312950491019877 -1.1336883498990558 -0.91652901576006229
+1.3549016200234227 -1.0757845443224259 -0.93266817185682316
+1.4379740221293491 -0.95209118411408988 -0.95001448309746583
+1.3965492087126441 -1.0153435626523062 -0.94390741193901806
+1.0870495089801231 -1.1336883498990558 -0.91652901576006229
+1.0450983799765772 -1.0757845443224259 -0.93266817185682316
+0.48795953903188327 -1.1350500562448065 -0.58714124035889637
+0.45264179677362604 -1.068023300158955 -0.58336686281126149
+0.46622871775608876 -0.75000000000000011 -0.67939657443508383
+0.51796791425349598 -0.75 -0.7313222504561675
+0.63503557314734083 -0.75 -0.82511526248824552
+0.57411588821993709 -0.75 -0.77991607152390563
+1.40209118411409 0.20001448309746583 0.23797402212934918
+1.4653435626523068 0.19390741193901784 0.19654920871264411
+1.5836883498990559 0.16652901576006207 -0.11295049101987709
+1.5257845443224261 0.18266817185682305 -0.15490162002342259
+1.40209118411409 0.20001448309746583 -0.23797402212934915
+1.4653435626523068 0.19390741193901784 -0.19654920871264409
+1.7664460834152065 0.053578524740185096 -0.18275773351615085
+1.7764206304327446 0.027766551833400488 -0.25063608611031907
+2.1500144830974657 -0.51202597787065129 -0.2020911841140898
+2.143907411939018 -0.55345079128735586 -0.26534356265230641
+2.0035785247401852 -0.56724226648384934 -0.56644608341520641
+1.9777665518334007 -0.49936391388968093 -0.57642063043274461
+2.1500144830974657 -0.98797402212934915 0.20209118411408972
+2.143907411939018 -0.94654920871264403 0.2653435626523063
+2.0035785247401856 -0.93275773351615066 0.5664460834152063
+1.9777665518334007 -1.000636086110319 0.57642063043274461
+1.4379740221293495 -0.95209118411408999 0.95001448309746561
+1.3965492087126441 -1.0153435626523066 0.94390741193901784
+1.3827577335161514 -1.3164460834152065 0.80357852474018521
+1.4506360861103194 -1.3264206304327448 0.77776655183340038
+1.5850500562448071 -1.3371412403588963 0.71204046096811657
+1.5180233001589556 -1.3333668628112614 0.74735820322637381
+1.2000000000000002 -1.4293965744350836 0.73377128224391142
+1.2000000000000002 -1.4813222504561674 0.68203208574650398
+0.6128587596411037 -1.4620404609681166 0.38505005624480643
+0.61663313718873858 -1.4973582032263739 0.31802330015895514
+0.81631165010094464 -1.6665290157600627 0.1129504910198771
+0.87421545567757442 -1.682668171856823 0.15490162002342264
+0.99790881588591018 -1.7000144830974657 0.23797402212934921
+0.93465643734769377 -1.6939074119390181 0.19654920871264422
+0.81631165010094442 -1.6665290157600623 -0.11295049101987711
+0.87421545567757397 -1.682668171856823 -0.1549016200234227
+0.81494994375519347 -1.3371412403588963 -0.71204046096811691
+0.88197669984104465 -1.3333668628112609 -0.74735820322637414
+1.2 -1.4293965744350836 -0.73377128224391142
+1.2 -1.4813222504561674 -0.68203208574650398
+1.1999999999999997 -1.5751152624882452 -0.56496442685265946
+1.2 -1.5299160715239055 -0.62588411178006287
+1.3827577335161512 -1.3164460834152063 -0.80357852474018521
+1.4506360861103191 -1.3264206304327451 -0.77776655183340049
+1.7649644268526601 -0.75 -0.82511526248824485
+1.825884111780063 -0.75 -0.77991607152390541
+2.0035785247401852 -0.93275773351615077 -0.56644608341520641
+1.9777665518334007 -1.000636086110319 -0.57642063043274472
+1.9120404609681168 -1.1350500562448065 -0.58714124035889637
+1.9473582032263741 -1.068023300158955 -0.58336686281126127
+2.1165290157600625 -0.86295049101987698 -0.38368834989905543
+2.1326681718568232 -0.90490162002342256 -0.32578454432242576
+2.1500144830974657 -0.51202597787065107 0.2020911841140898
+2.143907411939018 -0.55345079128735586 0.26534356265230624
+2.1165290157600625 -0.86295049101987698 0.38368834989905543
+2.1326681718568232 -0.90490162002342245 0.3257845443224256
+2.1500144830974657 -0.98797402212934904 -0.2020911841140898
+2.143907411939018 -0.94654920871264403 -0.26534356265230624
+2.1165290157600625 -0.6370495089801228 -0.38368834989905554
+2.1326681718568228 -0.59509837997657722 -0.32578454432242587
+1.7871412403588964 -0.037959539031883538 -0.38505005624480637
+1.7833668628112611 -0.0026417967736259707 -0.31802330015895519
+1.8793965744350838 -0.016228717756088806 -3.6838438251301884e-18
+1.9313222504561676 -0.067967914253496131 -6.5571195165482257e-18
+0.99790881588591029 -1.7000144830974659 -0.23797402212934909
+0.93465643734769377 -1.6939074119390181 -0.19654920871264417
+0.63355391658479376 -1.5535785247401854 -0.18275773351615088
+0.62357936956725513 -1.5277665518334005 -0.25063608611031907
+0.39642147525981475 -0.93275773351615077 -0.56644608341520675
+0.42223344816659947 -1.0006360861103192 -0.57642063043274483
+0.61285875964110381 -1.4620404609681166 -0.38505005624480643
+0.61663313718873847 -1.4973582032263737 -0.31802330015895514
+0.52060342556491623 -1.4837712822439113 -3.6838438251301899e-18
+0.46867774954383223 -1.4320320857465039 -6.557119516548228e-18
+0.48795953903188338 -1.1350500562448065 0.58714124035889637
+0.45264179677362604 -1.068023300158955 0.58336686281126149
+0.37488473751175444 -1.3149644268526592 -4.9279074600009341e-18
+0.42008392847609421 -1.3758841117800626 -6.5652635294160471e-18
+0.63355391658479354 -1.5535785247401852 0.18275773351615093
+0.6235793695672549 -1.5277665518334005 0.25063608611031912
+1.2000000000000002 -1.5751152624882452 0.56496442685265946
+1.2000000000000002 -1.5299160715239055 0.62588411178006287
+1.0172422664838496 -1.3164460834152063 0.80357852474018554
+0.94936391388968122 -1.3264206304327451 0.77776655183340049
+1.8562122655612305 -0.35501511824236365 0.6429404371401003
+1.6382389584574513 -0.22030020581200926 0.72619883181352507
+1.4047014786826493 0.1770588370822882 0.31410064822087258
+1.2699865662522949 0.093800442408863538 0.53207395532465163
+0.66792604467534855 -0.68001343374770507 0.84380044240886365
+0.8858993517791276 -0.54529852131735079 0.9270588370822882
+1.4008600052687634 -0.88471491243035438 0.9703129137821026
+1.4008600052687634 -0.61528508756964562 0.9703129137821026
+0.99913999473123671 -0.88471491243035438 -0.97031291378210283
+0.99913999473123671 -0.61528508756964562 -0.97031291378210283
+0.76176104154254864 -0.22030020581200915 -0.72619883181352518
+1.130013433747705 0.093800442408863538 -0.53207395532465163
+1.7296997941879915 -0.023801168186475152 -0.43823895845745109
+1.5949848817576369 -0.10705956285989982 -0.65621226556123013
+1.732073955324652 -0.68001343374770495 -0.84380044240886309
+1.514100648220873 -0.54529852131735079 -0.92705883708228798
+1.2699865662522956 -1.5938004424088636 0.53207395532465152
+1.4047014786826499 -1.6770588370822881 0.31410064822087264
+1.0652850875696456 -1.7203129137821027 -0.20086000526876327
+1.3347149124303548 -1.7203129137821027 -0.20086000526876327
+1.5949848817576369 -1.3929404371401004 -0.65621226556122991
+1.729699794187991 -1.4761988318135251 -0.43823895845745126
+2.1270588370822883 -1.0641006482208724 -0.20470147868264912
+2.0438004424088634 -1.2820739553246514 -0.069986566252294838
+1.9261988318135255 -1.1882389584574506 0.52969979418799085
+1.8429404371401006 -1.4062122655612299 0.39498488175763641
+1.8429404371401004 -0.093787734438769865 0.39498488175763669
+1.926198831813525 -0.31176104154254897 0.52969979418799107
+0.66792604467534855 -0.81998656625229493 -0.84380044240886365
+0.88589935177912738 -0.95470147868264921 -0.9270588370822882
+0.88589935177912782 -0.95470147868264921 0.92705883708228842
+0.66792604467534844 -0.81998656625229493 0.84380044240886354
+0.99913999473123705 -0.61528508756964562 0.97031291378210283
+0.99913999473123705 -0.88471491243035438 0.97031291378210283
+1.6382389584574515 -1.2796997941879908 0.72619883181352474
+1.8562122655612305 -1.1449848817576362 0.6429404371401003
+1.514100648220873 -0.54529852131735101 0.92705883708228809
+1.732073955324652 -0.68001343374770518 0.84380044240886309
+2.1270588370822883 -0.43589935177912753 0.20470147868264921
+2.0438004424088634 -0.21792604467534848 0.069986566252294824
+1.5949848817576369 -0.10705956285989982 0.65621226556123013
+1.7296997941879908 -0.02380116818647493 0.4382389584574512
+1.3347149124303548 0.22031291378210283 -0.20086000526876321
+1.0652850875696458 0.22031291378210283 -0.20086000526876321
+1.130013433747705 0.093800442408863538 0.53207395532465163
+0.76176104154254864 -0.22030020581200915 0.72619883181352496
+0.54378773443876993 -1.1449848817576371 0.6429404371401003
+0.76176104154254898 -1.2796997941879913 0.72619883181352518
+1.6382389584574515 -0.22030020581200915 -0.72619883181352496
+1.8562122655612303 -0.35501511824236348 -0.64294043714010018
+1.8562122655612303 -1.1449848817576367 -0.64294043714010018
+1.6382389584574513 -1.2796997941879908 -0.72619883181352485
+1.4008600052687634 -0.61528508756964562 -0.9703129137821026
+1.4008600052687634 -0.88471491243035438 -0.9703129137821026
+0.76176104154254864 -1.2796997941879906 -0.72619883181352507
+0.54378773443876982 -1.1449848817576367 -0.64294043714010041
+0.8858993517791276 -0.5452985213173509 -0.92705883708228842
+0.66792604467534844 -0.68001343374770507 -0.84380044240886354
+1.0652850875696456 0.22031291378210283 0.20086000526876321
+1.3347149124303548 0.22031291378210283 0.20086000526876321
+1.2699865662522949 0.093800442408863538 -0.53207395532465163
+1.4047014786826493 0.1770588370822882 -0.31410064822087264
+2.0438004424088634 -0.21792604467534848 -0.069986566252294824
+2.1270588370822883 -0.43589935177912753 -0.20470147868264921
+2.0438004424088634 -1.2820739553246514 0.069986566252294838
+2.1270588370822883 -1.0641006482208724 0.20470147868264912
+1.732073955324652 -0.81998656625229482 0.84380044240886309
+1.514100648220873 -0.95470147868264921 0.92705883708228798
+1.7296997941879915 -1.4761988318135248 0.43823895845745114
+1.5949848817576373 -1.3929404371401 0.65621226556123013
+0.80501511824236371 -1.3929404371401006 0.65621226556123013
+0.67030020581200889 -1.4761988318135248 0.4382389584574512
+1.3347149124303548 -1.7203129137821027 0.20086000526876327
+1.0652850875696458 -1.7203129137821027 0.20086000526876327
+0.67030020581200889 -1.4761988318135248 -0.4382389584574512
+0.80501511824236327 -1.3929404371401002 -0.65621226556123036
+1.4047014786826493 -1.6770588370822881 -0.31410064822087269
+1.2699865662522944 -1.5938004424088634 -0.53207395532465185
+1.514100648220873 -0.95470147868264899 -0.92705883708228809
+1.732073955324652 -0.81998656625229471 -0.8438004424088632
+1.8429404371401004 -1.4062122655612304 -0.39498488175763669
+1.926198831813525 -1.1882389584574511 -0.52969979418799096
+2.1703129137821029 -0.54913999473123687 -0.13471491243035441
+2.1703129137821029 -0.54913999473123698 0.13471491243035433
+2.1703129137821029 -0.95086000526876302 0.13471491243035433
+2.1703129137821029 -0.9508600052687628 -0.13471491243035436
+1.926198831813525 -0.31176104154254891 -0.52969979418799096
+1.8429404371401004 -0.093787734438769865 -0.39498488175763657
+1.130013433747705 -1.5938004424088636 -0.53207395532465152
+0.99529852131735097 -1.6770588370822881 -0.31410064822087269
+0.35619955759113631 -1.2820739553246514 -0.069986566252294852
+0.27294116291771175 -1.0641006482208724 -0.20470147868264923
+0.473801168186475 -1.1882389584574511 -0.52969979418799107
+0.55705956285989966 -1.4062122655612304 -0.39498488175763657
+0.55705956285989966 -1.4062122655612304 0.39498488175763669
+0.473801168186475 -1.1882389584574511 0.52969979418799107
+0.27294116291771175 -1.0641006482208724 0.20470147868264923
+0.35619955759113631 -1.2820739553246514 0.069986566252294852
+0.99529852131735064 -1.6770588370822881 0.31410064822087264
+1.130013433747705 -1.5938004424088634 0.53207395532465174
+1.2650724998901954 -0.10056625699618549 0.75762878984770377
+1.3432414582888712 -0.30521524694909546 0.88410882140193769
+1.3620856567445476 -0.68282536162972496 0.984487586431394
+1.5878111467046643 -0.54331933670715005 0.89826812139385248
+1.0735199684457657 -0.13851819872979687 0.78108437977813105
+1.3264800315542344 -0.13851819872979687 0.78108437977813105
+1.6879855916616429 -0.28105923500562391 0.73618246464930537
+1.6017661266241014 -0.055333745045507365 0.59667643972673035
+1.0567585417111292 -0.30521524694909541 0.88410882140193769
+1.1349275001098049 -0.10056625699618549 0.75762878984770377
+1.3395060249225752 0.10675191169903997 0.49650199476975138
+1.0604939750774247 0.10675191169903997 0.49650199476975149
+1.2379519417336118 -0.37028774683929055 0.92432583806700219
+1.0333029517807015 -0.24380771528505651 0.84615687966832631
+1.3666970482192986 -0.24380771528505651 0.84615687966832631
+1.1620480582663888 -0.37028774683929055 0.92432583806700219
+0.8121888532953363 -0.54331933670715005 0.89826812139385281
+1.0379143432554527 -0.68282536162972518 0.98448758643139411
+1.0333029517807015 -0.24380771528505651 -0.84615687966832631
+1.2379519417336118 -0.37028774683929055 -0.92432583806700219
+1.5878111467046638 -0.54331933670715016 -0.89826812139385259
+1.3620856567445476 -0.68282536162972518 -0.984487586431394
+1.1349275001098049 -0.10056625699618549 -0.75762878984770377
+1.0567585417111292 -0.30521524694909541 -0.88410882140193792
+1.0379143432554527 -0.68282536162972496 -0.98448758643139411
+0.8121888532953363 -0.54331933670714994 -0.89826812139385281
+1.3264800315542344 -0.13851819872979687 -0.78108437977813105
+1.0735199684457657 -0.13851819872979687 -0.78108437977813105
+1.3432414582888714 -0.30521524694909541 -0.88410882140193769
+1.2650724998901954 -0.10056625699618538 -0.75762878984770354
+1.0604939750774252 0.10675191169903997 -0.49650199476975138
+1.3395060249225752 0.10675191169903997 -0.49650199476975149
+1.1620480582663888 -0.37028774683929055 -0.92432583806700219
+1.366697048219299 -0.24380771528505651 -0.8461568796683262
+1.6017661266241012 -0.055333745045507476 -0.59667643972673035
+1.6879855916616431 -0.28105923500562385 -0.73618246464930504
+1.5797122531607097 -1.6743258380670021 -0.037951941733611459
+1.7061922847149438 -1.5961568796683263 0.16669704821929854
+1.894666254954493 -1.3466764397267299 0.40176612662410111
+1.6689407649943768 -1.4861824646493051 0.48798559166164246
+1.7061922847149438 -1.5961568796683263 -0.16669704821929854
+1.5797122531607097 -1.6743258380670021 0.037951941733611459
+1.4066806632928506 -1.6482681213938526 0.38781114670466382
+1.2671746383702751 -1.734487586431394 0.16208565674454747
+1.8494337430038148 -1.5076287898477032 -0.065072499890195132
+1.644784753050905 -1.6341088214019375 -0.14324145828887103
+1.2671746383702751 -1.734487586431394 -0.1620856567445475
+1.4066806632928501 -1.6482681213938526 -0.38781114670466388
+1.8114818012702036 -1.5310843797781306 0.12648003155423412
+1.8114818012702032 -1.5310843797781311 -0.12648003155423404
+1.6689407649943762 -1.4861824646493054 -0.48798559166164257
+1.8946662549544926 -1.3466764397267301 -0.40176612662410144
+1.644784753050905 -1.6341088214019375 0.14324145828887103
+1.8494337430038148 -1.5076287898477032 0.065072499890195132
+2.05675191169904 -1.2465019947697511 -0.13950602492257502
+2.05675191169904 -1.2465019947697513 0.13950602492257499
+1.9576287898477038 -0.68492750010980474 0.64943374300381451
+2.0841088214019377 -0.60675854171112908 0.44478475305090454
+2.184487586431394 -0.58791434325545278 0.067174638370274917
+2.0982681213938523 -0.36218885329533629 0.20668066329284998
+1.2379519417336116 -1.1297122531607096 -0.92432583806700219
+1.0333029517807015 -1.2561922847149436 -0.84615687966832631
+0.79823387337589879 -1.4446662549544924 -0.59667643972673035
+0.71201440833835727 -1.2189407649943762 -0.73618246464930548
+0.30173187860614725 -1.1378111467046637 -0.20668066329285001
+0.4189156202218689 -0.87648003155423404 0.61148180127020324
+0.4638175353506947 -1.2379855916616427 0.46894076499437615
+0.60332356027326994 -1.1517661266241017 0.69466625495449275
+1.0333029517807018 -1.2561922847149436 0.84615687966832642
+1.2379519417336118 -1.1297122531607096 0.92432583806700219
+1.5878111467046638 -0.95668066329284995 0.89826812139385259
+1.3620856567445476 -0.81717463837027482 0.984487586431394
+2.0841088214019381 -0.8932414582888708 0.44478475305090431
+1.9576287898477038 -0.81507249989019503 0.64943374300381418
+1.6965019947697519 -0.61049397507742498 0.85675191169903975
+1.6965019947697517 -0.88950602492257513 0.85675191169903986
+1.9810843797781312 -0.87648003155423393 0.61148180127020291
+1.981084379778131 -0.62351996844576596 0.61148180127020324
+1.9361824646493055 -0.26201440833835754 0.46894076499437615
+1.7966764397267303 -0.34823387337589884 0.69466625495449263
+1.8114818012702028 0.031084379778131277 -0.12648003155423412
+1.8114818012702028 0.031084379778131277 0.1264800315542341
+1.6689407649943762 -0.013817535350694743 0.48798559166164268
+1.8946662549544926 -0.15332356027326977 0.40176612662410138
+1.8494337430038144 0.0076287898477036542 0.06507249989019516
+1.644784753050905 0.13410882140193758 0.14324145828887103
+1.2671746383702749 0.23448758643139411 0.16208565674454739
+1.4066806632928499 0.14826812139385259 0.38781114670466377
+0.99331933670715 0.14826812139385259 0.38781114670466377
+1.132825361629725 0.23448758643139411 0.16208565674454739
+0.70349800523024886 -0.88950602492257524 0.85675191169903997
+0.70349800523024875 -0.61049397507742498 0.85675191169904008
+1.1349275001098049 -1.3994337430038146 0.75762878984770365
+1.0567585417111292 -1.1947847530509048 0.88410882140193769
+1.0379143432554527 -0.81717463837027482 0.98448758643139411
+0.81218885329533652 -0.95668066329285006 0.89826812139385281
+2.0841088214019377 -0.60675854171112875 -0.4447847530509047
+1.9576287898477038 -0.68492750010980474 -0.64943374300381451
+1.6965019947697517 -0.88950602492257502 -0.85675191169903986
+1.6965019947697517 -0.61049397507742487 -0.85675191169903986
+1.2650724998901952 -1.3994337430038146 -0.75762878984770365
+1.343241458288871 -1.1947847530509048 -0.88410882140193769
+1.3620856567445476 -0.81717463837027482 -0.984487586431394
+1.5878111467046643 -0.95668066329284984 -0.89826812139385248
+1.3666970482192984 -1.2561922847149436 -0.84615687966832631
+1.1620480582663888 -1.1297122531607096 -0.92432583806700219
+0.8121888532953363 -0.95668066329284995 -0.89826812139385281
+1.0379143432554525 -0.81717463837027482 -0.984487586431394
+0.4423712101522963 -0.81507249989019515 -0.64943374300381473
+0.70349800523024875 -0.61049397507742498 -0.85675191169904008
+0.70349800523024875 -0.88950602492257502 -0.85675191169904008
+0.41891562022186868 -0.87648003155423404 -0.61148180127020324
+1.1328253616297255 0.23448758643139411 -0.16208565674454739
+0.99331933670714989 0.14826812139385259 -0.38781114670466377
+1.7061922847149438 0.096156879668326201 0.16669704821929851
+1.5797122531607097 0.17432583806700197 -0.037951941733611452
+1.4066806632928499 0.14826812139385259 -0.38781114670466377
+1.2671746383702751 0.234487586431394 -0.16208565674454736
+1.5797122531607097 0.17432583806700197 0.037951941733611452
+1.7061922847149438 0.096156879668326201 -0.16669704821929851
+1.8946662549544926 -0.15332356027326977 -0.40176612662410138
+1.6689407649943766 -0.013817535350694743 -0.48798559166164251
+2.1243258380670023 -0.78795194173361138 -0.37971225316070939
+2.0461568796683265 -0.58330295178070157 -0.50619228471494349
+1.7966764397267307 -0.34823387337589884 -0.6946662549544923
+1.9361824646493055 -0.26201440833835749 -0.46894076499437609
+2.1243258380670023 -0.71204805826638851 0.37971225316070928
+2.0461568796683265 -0.91669704821929832 0.50619228471494315
+1.7966764397267307 -1.1517661266241008 0.6946662549544923
+1.9361824646493058 -1.2379855916616425 0.46894076499437604
+1.1620480582663888 -1.1297122531607096 0.92432583806700219
+1.366697048219299 -1.2561922847149434 0.8461568796683262
+1.6017661266241021 -1.4446662549544924 0.59667643972673023
+1.6879855916616431 -1.2189407649943764 0.73618246464930504
+1.3432414582888712 -1.1947847530509048 0.88410882140193758
+1.2650724998901954 -1.3994337430038146 0.75762878984770343
+1.0604939750774252 -1.6067519116990399 0.49650199476975138
+1.3395060249225756 -1.6067519116990399 0.49650199476975138
+0.55056625699618522 -1.5076287898477037 0.06507249989019516
+0.75521524694909514 -1.6341088214019377 0.14324145828887108
+1.1328253616297252 -1.7344875864313942 0.1620856567445475
+0.99331933670714978 -1.6482681213938526 0.38781114670466388
+0.69380771528505625 -1.5961568796683263 0.16669704821929854
+0.8202877468392904 -1.6743258380670021 -0.037951941733611466
+0.99331933670715045 -1.648268121393853 -0.38781114670466399
+1.132825361629725 -1.7344875864313942 -0.16208565674454753
+1.0567585417111292 -1.1947847530509048 -0.88410882140193769
+1.1349275001098047 -1.3994337430038146 -0.75762878984770343
+1.3395060249225752 -1.6067519116990399 -0.49650199476975138
+1.0604939750774247 -1.6067519116990399 -0.49650199476975149
+1.0735199684457657 -1.361481801270203 -0.78108437977813105
+1.3264800315542338 -1.361481801270203 -0.78108437977813105
+1.6879855916616426 -1.2189407649943764 -0.73618246464930526
+1.6017661266241014 -1.4446662549544926 -0.59667643972673035
+1.981084379778131 -0.62351996844576596 -0.61148180127020324
+1.981084379778131 -0.87648003155423404 -0.61148180127020324
+1.9361824646493053 -1.2379855916616427 -0.46894076499437609
+1.7966764397267303 -1.1517661266241015 -0.69466625495449252
+1.9576287898477038 -0.81507249989019503 -0.64943374300381451
+2.0841088214019377 -0.89324145828887092 -0.4447847530509047
+2.184487586431394 -0.91208565674454722 -0.067174638370274917
+2.0982681213938528 -1.1378111467046637 -0.20668066329284984
+2.0461568796683265 -0.58330295178070157 0.50619228471494349
+2.1243258380670023 -0.78795194173361149 0.37971225316070928
+2.0982681213938528 -1.1378111467046632 0.20668066329284987
+2.184487586431394 -0.91208565674454722 0.067174638370274903
+2.0461568796683265 -0.91669704821929843 -0.50619228471494349
+2.1243258380670023 -0.71204805826638851 -0.37971225316070939
+2.0982681213938528 -0.36218885329533623 -0.20668066329284998
+2.184487586431394 -0.58791434325545255 -0.067174638370274903
+1.644784753050905 0.13410882140193758 -0.143241458288871
+1.8494337430038144 0.0076287898477036542 -0.06507249989019516
+2.05675191169904 -0.25349800523024879 0.13950602492257499
+2.05675191169904 -0.25349800523024862 -0.13950602492257505
+0.8202877468392904 -1.6743258380670021 0.037951941733611466
+0.69380771528505636 -1.5961568796683263 -0.16669704821929857
+0.50533374504550721 -1.3466764397267301 -0.40176612662410133
+0.73105923500562364 -1.4861824646493054 -0.48798559166164257
+0.35384312033167364 -0.91669704821929843 -0.50619228471494349
+0.60332356027326961 -1.151766126624101 -0.69466625495449275
+0.46381753535069448 -1.2379855916616425 -0.46894076499437626
+0.75521524694909514 -1.6341088214019377 -0.14324145828887105
+0.55056625699618522 -1.5076287898477037 -0.06507249989019516
+0.34324808830095987 -1.2465019947697513 0.13950602492257511
+0.3432480883009601 -1.2465019947697515 -0.13950602492257505
+0.44237121015229641 -0.81507249989019515 0.64943374300381473
+0.30173187860614725 -1.1378111467046637 0.20668066329285004
+0.5885181987297966 -1.5310843797781311 -0.12648003155423418
+0.58851819872979683 -1.5310843797781311 0.12648003155423407
+0.73105923500562386 -1.4861824646493056 0.48798559166164268
+0.50533374504550732 -1.3466764397267301 0.40176612662410144
+1.3264800315542344 -1.361481801270203 0.78108437977813105
+1.0735199684457661 -1.361481801270203 0.78108437977813105
+0.71201440833835772 -1.2189407649943766 0.73618246464930526
+0.79823387337589868 -1.4446662549544926 0.59667643972673035
+0.35384312033167364 -0.91669704821929843 0.5061922847149436
+1.849279861785744 -0.54530214016523193 0.73248511743144029
+1.7894256868089482 -0.54268760819673556 0.78076816785433145
+1.601277022794424 0.10397772162051178 0.33120809463701673
+1.6048073899588975 0.071782225985176584 0.40100492526839776
+1.2000000000000002 -0.94657916295965572 0.98048795642276054
+1.1594777183312834 -0.88192856911395234 0.99043061207734606
+1.2000000000000002 -0.94657916295965583 -0.98048795642276054
+1.2405222816687171 -0.88192856911395234 -0.99043061207734606
+0.61057431319105182 -0.54268760819673556 -0.78076816785433145
+1.601277022794424 0.10397772162051178 -0.33120809463701673
+1.5392409609172171 0.11230450765389333 -0.37596077789543397
+1.8492798617857438 -0.54530214016523182 -0.73248511743144007
+1.8144698341819121 -0.47712117915505486 -0.74024588618561449
+1.4046978598347688 -1.4824851174314402 0.64927986178574359
+1.4728788208449455 -1.4902458861856145 0.61446983418191214
+1.0034208370403446 -1.7304879564227607 0
+1.0680714308860475 -1.7404306120773461 0.040522281668716881
+1.4046978598347686 -1.4824851174314402 -0.64927986178574359
+1.4073123918032646 -1.5307681678543315 -0.58942568680894825
+2.053977721620512 -1.0812080946370168 -0.40127702279442357
+2.0217822259851768 -1.1510049252683974 -0.40480738995889748
+2.053977721620512 -1.0812080946370166 0.40127702279442351
+2.0623045076538937 -1.1259607778954335 0.33924096091721662
+1.9324851174314406 -0.10072013821425641 0.20469785983476813
+1.9807681678543314 -0.16057431319105187 0.20731239180326444
+0.55072013821425636 -0.95469785983476829 -0.73248511743144051
+0.58553016581808792 -1.0228788208449453 -0.7402458861856146
+0.86879190536298379 -1.151277022794424 0.85397772162051189
+0.79899507473160258 -1.1548073899588978 0.82178222598517658
+1.2000000000000002 -0.55342083704034473 0.98048795642276054
+1.2405222816687171 -0.61807143088604766 0.99043061207734606
+1.531208094637017 -1.151277022794424 0.85397772162051167
+1.5759607778954345 -1.0892409609172169 0.86230450765389322
+1.531208094637017 -0.34872297720557643 0.85397772162051189
+1.6010049252683982 -0.34519261004110269 0.82178222598517647
+2.053977721620512 -0.41879190536298327 0.40127702279442357
+2.0217822259851763 -0.34899507473160229 0.40480738995889742
+1.4046978598347686 -0.01751488256855982 0.64927986178574382
+1.4073123918032646 0.030768167854331341 0.58942568680894825
+1.3965791629596556 0.23048795642276054 0
+1.3319285691139524 0.24043061207734606 0.040522281668716874
+0.99530214016523222 -0.017514882568559709 0.64927986178574393
+0.92712117915505499 -0.0097541138143855122 0.61446983418191226
+0.86879190536298356 -0.34872297720557643 0.85397772162051211
+0.82403922210456626 -0.41075903908278316 0.86230450765389344
+0.55072013821425636 -0.95469785983476807 0.73248511743144062
+0.61057431319105182 -0.95731239180326477 0.78076816785433145
+1.531208094637017 -0.34872297720557655 -0.85397772162051189
+1.5759607778954345 -0.41075903908278322 -0.86230450765389333
+1.8492798617857438 -0.95469785983476796 -0.73248511743144029
+1.7894256868089482 -0.95731239180326444 -0.78076816785433145
+1.2 -0.55342083704034473 -0.98048795642276054
+1.1594777183312832 -0.61807143088604766 -0.99043061207734606
+0.86879190536298334 -1.1512770227944236 -0.853977721620512
+0.82403922210456604 -1.0892409609172167 -0.86230450765389355
+0.86879190536298345 -0.34872297720557638 -0.853977721620512
+0.79899507473160236 -0.34519261004110258 -0.82178222598517681
+0.99530214016523211 -0.017514882568559598 -0.64927986178574393
+0.9926876081967354 0.030768167854331341 -0.58942568680894825
+1.0680714308860475 0.24043061207734606 -0.040522281668716874
+1.4046978598347681 -0.017514882568559709 -0.64927986178574393
+1.4728788208449453 -0.0097541138143856232 -0.61446983418191214
+1.9324851174314406 -0.10072013821425641 -0.20469785983476813
+1.9402458861856144 -0.13553016581808797 -0.27287882084494514
+1.9324851174314408 -1.3992798617857432 0.20469785983476801
+1.9402458861856147 -1.3644698341819117 0.27287882084494514
+1.8492798617857442 -0.95469785983476818 0.73248511743143996
+1.8144698341819121 -1.0228788208449451 0.74024588618561449
+1.6012770227944242 -1.6039777216205118 0.33120809463701661
+1.5392409609172173 -1.6123045076538933 0.37596077789543392
+0.99530214016523222 -1.4824851174314406 0.64927986178574371
+0.9926876081967354 -1.5307681678543315 0.58942568680894825
+1.3965791629596556 -1.7304879564227607 0
+1.3319285691139524 -1.7404306120773461 -0.040522281668716881
+0.79872297720557672 -1.6039777216205122 -0.33120809463701678
+0.86075903908278328 -1.6123045076538935 -0.37596077789543397
+1.6012770227944237 -1.6039777216205118 -0.33120809463701673
+1.6048073899588975 -1.5717822259851766 -0.40100492526839776
+1.531208094637017 -1.151277022794424 -0.85397772162051178
+1.6010049252683982 -1.1548073899588973 -0.82178222598517647
+1.9324851174314406 -1.3992798617857436 -0.20469785983476813
+1.9807681678543316 -1.3394256868089478 -0.20731239180326447
+2.1804879564227604 -0.74999999999999989 -0.19657916295965536
+2.1904306120773462 -0.79052228166871663 -0.13192856911395226
+2.1804879564227604 -0.74999999999999989 0.19657916295965536
+2.1904306120773462 -0.70947771833128304 0.13192856911395226
+2.053977721620512 -0.41879190536298344 -0.40127702279442368
+2.0623045076538933 -0.37403922210456625 -0.33924096091721662
+0.99530214016523222 -1.4824851174314406 -0.64927986178574371
+0.92712117915505499 -1.4902458861856145 -0.61446983418191214
+0.46751488256855955 -1.3992798617857436 -0.20469785983476818
+0.45975411381438525 -1.3644698341819119 -0.27287882084494525
+0.34602227837948807 -1.0812080946370166 -0.40127702279442368
+0.33769549234610641 -1.1259607778954337 -0.33924096091721684
+0.46751488256855955 -1.3992798617857436 0.20469785983476818
+0.4192318321456685 -1.339425686808948 0.20731239180326452
+0.34602227837948807 -1.0812080946370168 0.40127702279442368
+0.37821777401482337 -1.1510049252683976 0.40480738995889759
+0.79872297720557661 -1.6039777216205122 0.33120809463701684
+0.79519261004110253 -1.5717822259851766 0.40100492526839782
+1.4681715176003196 -0.06070343884806495 0.6730187872058685
+1.2397345885584119 -0.48973505164257786 0.96471929550963276
+1.0617263178126279 0.019577838502176315 0.62340222914316246
+1.4840795446225896 -0.28960691129913418 0.84103330267207554
+0.84637064705828324 -0.28443495637683419 0.81129246939324073
+1.3358362255269414 -0.030084692934636004 0.68063975088704354
+1.1197187226497591 -0.55260647397715412 0.97703158208487906
+0.99987185965655678 -0.069819281493047503 0.70519707714513469
+1.5040127948790105 -0.41433279178978183 0.891573746743482
+0.94047778163550211 -0.35389882611563689 0.88076789123048715
+0.89598720512098939 -0.41433279178978183 -0.891573746743482
+1.4595222183644985 -0.35389882611563694 -0.88076789123048704
+0.93182848239968008 -0.06070343884806495 -0.6730187872058685
+1.1602654114415885 -0.48973505164257786 -0.96471929550963276
+1.3382736821873726 0.019577838502176204 -0.62340222914316235
+0.91592045537741074 -0.28960691129913418 -0.84103330267207554
+1.5536293529417171 -0.28443495637683425 -0.81129246939324062
+1.064163774473059 -0.030084692934636004 -0.68063975088704354
+1.2802812773502414 -0.55260647397715412 -0.97703158208487906
+1.4001281403434436 -0.069819281493047614 -0.70519707714513458
+1.3973935260228463 -1.7270315820848792 0.080281277350241251
+1.8801807185069523 -1.4551970771451344 0.20012814034344359
+1.5356672082102185 -1.6415737467434819 -0.30401279487901062
+1.596101173884364 -1.6307678912304868 0.25952221836449818
+1.889296561151935 -1.4230187872058684 -0.26817151760031971
+1.4602649483574226 -1.7147192955096329 -0.039734588558411603
+1.9695778385021763 -1.373402229143162 0.13827368218737229
+1.6603930887008658 -1.5910333026720753 -0.28407954462258939
+1.6655650436231662 -1.5612924693932406 0.35362935294171671
+1.9199153070653643 -1.4306397508870434 -0.135836225526941
+1.8730187872058686 -0.4818284823996804 0.68929656115193483
+2.1647192955096326 -0.71026541144158839 0.26026494835742214
+1.1197187226497587 -0.94739352602284621 -0.97703158208487906
+0.99987185965655645 -1.4301807185069524 -0.70519707714513469
+0.31923210876951291 -1.0095222183644981 -0.39610117388436322
+0.57659777085683772 -0.61172631781262765 0.76957783850217654
+0.35896669732792441 -1.0340795446225892 0.46039308870086582
+0.89598720512098984 -1.0856672082102186 0.89157374674348211
+1.4595222183644985 -1.1461011738843632 0.88076789123048704
+2.0112924693932408 -1.1036293529417165 0.46556504362316542
+1.8806397508870436 -0.61416377447305914 0.719915307065364
+1.8234022291431624 -0.88827368218737224 0.7695778385021762
+2.0410333026720755 -0.46592045537741078 0.46039308870086587
+1.9695778385021763 -0.12659777085683777 -0.13827368218737232
+1.6603930887008658 0.091033302672075656 0.28407954462258933
+1.889296561151935 -0.076981212794131615 0.26817151760031976
+1.4602649483574224 0.21471929550963276 0.039734588558411575
+0.51936024911295675 -0.88583622552694086 0.71991530706536422
+0.9318284823996803 -1.4392965611519353 0.6730187872058685
+1.1602654114415887 -1.0102649483574222 0.96471929550963276
+2.0112924693932408 -0.39637064705828318 -0.46556504362316581
+1.8806397508870436 -0.88583622552694086 -0.719915307065364
+1.4681715176003196 -1.4392965611519353 -0.6730187872058685
+1.2397345885584119 -1.0102649483574222 -0.96471929550963276
+1.5040127948790105 -1.0856672082102183 -0.89157374674348189
+0.94047778163550177 -1.1461011738843632 -0.88076789123048715
+0.38870753060675922 -1.1036293529417167 -0.46556504362316575
+0.51936024911295653 -0.61416377447305914 -0.71991530706536422
+0.57659777085683772 -0.88827368218737235 -0.76957783850217643
+1.5356672082102183 0.141573746743482 0.30401279487901056
+1.5961011738843633 0.13076789123048704 -0.25952221836449818
+1.3973935260228463 0.22703158208487906 -0.080281277350241251
+1.8801807185069523 -0.044802922854865423 -0.20012814034344364
+2.1770315820848789 -0.66971872264975862 -0.19739352602284604
+1.9051970771451348 -0.54987185965655638 -0.68018071850695228
+2.1770315820848789 -0.83028127735024138 0.19739352602284604
+1.9051970771451348 -0.95012814034344362 0.68018071850695228
+1.2802812773502414 -0.9473935260228461 0.97703158208487884
+1.4001281403434442 -1.4301807185069524 0.70519707714513435
+1.5536293529417171 -1.215565043623166 0.81129246939324051
+1.0641637744730592 -1.4699153070653641 0.68063975088704354
+0.51070343884806491 -1.4230187872058684 0.26817151760031971
+0.93973505164257753 -1.7147192955096329 0.039734588558411603
+0.86433279178978151 -1.6415737467434819 0.30401279487901062
+0.80389882611563679 -1.6307678912304873 -0.25952221836449835
+0.84637064705828324 -1.2155650436231658 -0.81129246939324073
+1.3358362255269407 -1.4699153070653641 -0.68063975088704354
+1.0617263178126279 -1.5195778385021765 -0.62340222914316235
+1.4840795446225892 -1.2103930887008656 -0.84103330267207554
+1.8234022291431624 -0.61172631781262776 -0.7695778385021762
+2.0410333026720755 -1.034079544622589 -0.46039308870086576
+1.8730187872058686 -1.0181715176003197 -0.68929656115193483
+2.1647192955096326 -0.78973458855841161 -0.26026494835742214
+2.0915737467434821 -0.44598720512098944 0.33566720821021828
+2.0807678912304874 -1.0095222183644981 0.39610117388436294
+2.0915737467434821 -1.0540127948790103 -0.33566720821021817
+2.080767891230487 -0.49047778163550182 -0.39610117388436328
+1.6655650436231659 0.061292469393240734 -0.35362935294171677
+1.9199153070653638 -0.069360249112956462 0.135836225526941
+1.0026064739771539 -1.7270315820848792 -0.080281277350241251
+0.51981928149304746 -1.4551970771451346 -0.20012814034344362
+0.49480292285486538 -0.95012814034344351 -0.6801807185069525
+0.7344349563768342 -1.5612924693932406 -0.35362935294171682
+0.48008469293463596 -1.4306397508870434 0.135836225526941
+0.52698121279413157 -1.0181715176003197 0.68929656115193516
+0.43042216149782375 -1.3734022291431622 -0.13827368218737232
+0.73960691129913392 -1.5910333026720753 0.28407954462258939
+1.3382736821873729 -1.5195778385021763 0.62340222914316223
+0.91592045537741118 -1.2103930887008665 0.84103330267207554
+0.30842625325651785 -1.0540127948790103 0.33566720821021839
+1.8267476188075715 -0.23443672020460982 0.58427898032160919
+1.2687157005262188 0.19538324907249438 0.31863563026492314
+0.77018003072289609 -0.74999999999999989 0.90291461058653244
+1.5186356302649235 -0.81871570052621878 0.94538324907249438
+0.88136436973507692 -0.81871570052621878 -0.9453832490724946
+1.1312842994737817 0.1953832490724946 -0.3186356302649232
+1.7842789803216093 -0.12325238119242887 -0.51556327979539018
+1.6298199692771045 -0.74999999999999956 -0.90291461058653211
+1.2000000000000002 -1.6529146105865324 0.42981996927710425
+1.1312842994737811 -1.6953832490724943 -0.31863563026492331
+1.7155632797953904 -1.3342789803216091 -0.62674761880757135
+2.1453832490724949 -1.0686356302649227 -0.06871570052621874
+1.8267476188075715 -1.26556327979539 0.58427898032160919
+1.7842789803216093 -0.12325238119242887 0.51556327979539029
+0.77018003072289609 -0.75 -0.90291461058653244
+0.88136436973507715 -0.81871570052621845 0.94538324907249471
+0.84317791022691035 -0.75 0.93417235896271589
+0.88136436973507692 -0.681284299473781 0.9453832490724946
+1.715563279795391 -1.3342789803216086 0.62674761880757113
+1.5568220897730902 -0.75 0.93417235896271555
+1.5186356302649235 -0.68128429947378122 0.94538324907249438
+2.1341723589627155 -0.39317791022691029 -6.1608256340360548e-19
+2.1453832490724944 -0.43136436973507697 0.068715700526218768
+1.7773502691896259 -0.17264973081037449 0.57735026918962595
+1.7155632797953904 -0.16572101967839103 0.62674761880757157
+1.2687157005262188 0.19538324907249438 -0.3186356302649232
+1.2 0.18417235896271567 0.35682208977308999
+1.2000000000000002 0.15291461058653233 0.4298199692771042
+0.62264973081037422 -1.3273502691896257 0.57735026918962595
+0.57325238119242883 -1.2655632797953908 0.58427898032160908
+1.7773502691896261 -0.17264973081037449 -0.57735026918962551
+1.7155632797953904 -0.16572101967839092 -0.62674761880757124
+1.8267476188075715 -1.2655632797953904 -0.58427898032160897
+1.55682208977309 -0.74999999999999989 -0.93417235896271567
+1.5186356302649235 -0.68128429947378111 -0.94538324907249438
+0.62264973081037422 -1.3273502691896257 -0.57735026918962584
+0.68443672020460955 -1.3342789803216091 -0.62674761880757146
+0.84317791022691035 -0.75 -0.93417235896271567
+0.88136436973507692 -0.68128429947378122 -0.9453832490724946
+1.1312842994737813 0.1953832490724946 0.31863563026492325
+1.2000000000000002 0.18417235896271567 -0.35682208977308999
+1.2000000000000002 0.15291461058653233 -0.4298199692771042
+2.1029146105865326 -0.32018003072289597 0
+2.134172358962716 -1.1068220897730896 1.2321651268072106e-18
+2.1029146105865326 -1.1798199692771036 0
+1.6298199692771045 -0.75 0.90291461058653211
+1.7773502691896264 -1.3273502691896253 0.57735026918962551
+1.7842789803216095 -1.3767476188075709 0.51556327979539029
+0.68443672020460988 -1.3342789803216091 0.62674761880757146
+1.2000000000000002 -1.6841723589627158 0.3568220897730901
+1.2687157005262188 -1.6953832490724943 0.31863563026492331
+0.61572101967839066 -1.3767476188075713 -0.51556327979539052
+1.2000000000000002 -1.6841723589627158 -0.3568220897730901
+1.2687157005262188 -1.6953832490724943 -0.31863563026492325
+1.5186356302649235 -0.81871570052621845 -0.94538324907249438
+1.7773502691896259 -1.3273502691896257 -0.57735026918962551
+1.7842789803216093 -1.3767476188075713 -0.51556327979539018
+2.1453832490724944 -0.43136436973507697 -0.068715700526218768
+2.1453832490724944 -1.0686356302649229 0.068715700526218726
+1.8267476188075715 -0.23443672020460971 -0.58427898032160908
+1.2 -1.6529146105865324 -0.42981996927710425
+0.29708538941346763 -1.1798199692771041 0
+0.57325238119242872 -1.2655632797953904 -0.5842789803216093
+0.61572101967839088 -1.3767476188075713 0.51556327979539029
+0.25461675092750535 -1.0686356302649229 0.068715700526218781
+1.1312842994737815 -1.6953832490724945 0.31863563026492331
+0.26582764103728429 -1.1068220897730898 1.2321651268072117e-18
+0.25461675092750535 -1.0686356302649229 -0.068715700526218781
+1.2000000000000002 -0.22426888788086641 0.85065080835203988
+1.2000000000000002 -0.17607845371442887 0.8189102873387164
+1.1451428592863835 -0.20998203120107972 0.83986385056568247
+1.1660964225133497 -0.26483917191469658 0.87376742805233332
+1.2339035774866509 -0.26483917191469664 0.87376742805233321
+1.2 -0.22426888788086652 -0.8506508083520401
+1.1451428592863835 -0.20998203120107972 -0.83986385056568247
+1.2000000000000002 -0.17607845371442887 -0.8189102873387164
+1.2548571407136169 -0.20998203120107972 -0.83986385056568236
+1.2339035774866509 -0.26483917191469664 -0.87376742805233321
+1.7257311121191339 -1.6006508083520399 -2.4513010918904203e-18
+1.6851608280853034 -1.6237674280523331 -0.033903577486650918
+1.7400179687989208 -1.5898638505656821 -0.054857140713616921
+1.7739215462855715 -1.5689102873387162 0
+1.7400179687989206 -1.5898638505656821 0.054857140713616921
+2.0506508083520396 -0.75000000000000011 0.52573111211913359
+2.0189102873387164 -0.75 0.57392154628557113
+1.2339035774866509 -1.2351608280853033 -0.87376742805233332
+1.1451428592863835 -1.2900179687989204 0.83986385056568236
+2.0737674280523333 -0.78390357748665085 0.48516082808530303
+1.7400179687989203 0.089863850565682246 -0.054857140713616907
+1.7739215462855711 0.068910287338716403 0
+1.2000000000000002 -1.3239215462855713 0.81891028733871629
+2.0737674280523333 -0.71609642251334893 -0.48516082808530336
+1.2 -1.3239215462855713 -0.81891028733871629
+1.7400179687989203 0.089863850565682246 0.054857140713616907
+1.7257311121191339 0.10065080835203966 2.4513010918904203e-18
+1.6851608280853034 0.12376742805233321 0.033903577486650911
+2.0737674280523333 -0.78390357748665085 -0.48516082808530336
+2.0737674280523333 -0.71609642251334915 0.48516082808530303
+1.1660964225133497 -1.2351608280853033 0.87376742805233332
+1.2000000000000002 -1.2757311121191335 0.85065080835203988
+1.2339035774866509 -1.2351608280853033 0.87376742805233332
+0.6260784537144285 -1.5689102873387162 0
+0.65998203120107946 -1.5898638505656821 0.054857140713616928
+1.2 -1.2757311121191335 -0.85065080835203988
+1.166096422513349 -1.2351608280853033 -0.87376742805233332
+2.0398638505656823 -0.69514285928638297 -0.54001796879892028
+2.0506508083520396 -0.75 -0.52573111211913359
+2.0189102873387164 -0.75 -0.57392154628557124
+0.71483917191469648 -1.6237674280523331 0.033903577486650918
+0.67426888788086625 -1.6006508083520399 1.2256505459452107e-18
+0.71483917191469648 -1.6237674280523331 -0.033903577486650918
+0.85820988329399439 0.037928268229677653 -0.51219972690999771
+0.46642231325749561 -0.61816149698298017 0.66669512270283449
+0.62391616211425605 -0.4100516430955744 -0.74334549596053467
+0.46642231325749572 -0.6181614969829804 -0.66669512270283449
+0.44237121015229641 -0.68492750010980474 -0.64943374300381462
+0.92750422818221478 0.14756031181852258 0.34659997257597436
+0.69630888727061568 -0.22163878825453975 -0.68346886752821712
+1.0026064739771539 0.22703158208487906 0.080281277350241251
+0.80501511824236338 -0.1070595628598997 -0.65621226556123025
+0.74873333439274126 -0.16249238098892738 -0.67170915887432048
+0.55072013821425636 -0.54530214016523204 -0.73248511743144062
+0.38108971266128355 -0.75 -0.57392154628557113
+0.4423712101522963 -0.68492750010980474 0.64943374300381473
+0.4200019052667272 -0.75 -0.62578188869003293
+0.74873333439274148 -0.16249238098892738 0.67170915887432037
+0.2560925880609819 -0.94654920871264381 -0.26534356265230646
+0.23194392108089312 -0.99136787945551608 0.067889430951449628
+0.92427145868032001 0.078756567168790315 -0.48696645046278475
+0.92750422818221478 0.14756031181852258 -0.34659997257597436
+0.92533155387381627 0.11574218443040096 -0.41838703947458178
+0.86005164309557414 -0.0066545040394655475 -0.57608383788574402
+1.0026064739771541 0.22703158208487906 -0.080281277350241251
+0.24998551690253423 -0.98797402212934882 0.20209118411408999
+0.42000190526672743 -0.75 0.62578188869003293
+0.38108971266128377 -0.75 0.57392154628557124
+0.3601361494343176 -0.80485714071361691 0.54001796879892039
+0.49480292285486538 -0.54987185965655638 0.6801807185069525
+0.92533155387381627 0.11574218443040096 0.41838703947458195
+0.92427145868032001 0.078756567168790315 0.48696645046278492
+0.80501511824236338 -0.1070595628598997 0.65621226556123025
+0.62391616211425593 -0.41005164309557418 0.74334549596053445
+0.6963088872706158 -0.22163878825453964 0.68346886752821701
+0.49480292285486549 -0.54987185965655649 -0.6801807185069525
+0.33700104792563468 -0.84975716552598102 -0.49525883802792392
+0.99529852131735064 0.1770588370822882 -0.31410064822087258
+1.0006230302710439 0.21679589706089264 -0.15985780358782289
+0.99790881588591029 0.20001448309746583 -0.23797402212934918
+0.24998551690253412 -0.98797402212934915 -0.20209118411408994
+0.86456827261077818 -0.05598545619885309 0.63704738383668813
+0.23194392108089312 -0.99136787945551608 -0.067889430951449628
+0.2402206179342532 -1.0307552987238056 0
+1.0034208370403446 0.23048795642276054 0
+1.0006230302710435 0.21679589706089242 0.15985780358782284
+0.99790881588590996 0.20001448309746583 0.23797402212934915
+0.99529852131735064 0.1770588370822882 0.31410064822087264
+0.2560925880609819 -0.94654920871264381 0.26534356265230635
+0.85820988329399461 0.037928268229677764 0.51219972690999771
+0.86005164309557447 -0.0066545040394655475 0.57608383788574402
+0.58553016581808792 -0.47712117915505486 -0.7402458861856146
+0.71201440833835727 -0.28105923500562391 -0.73618246464930537
+0.66601387759394226 -0.34452585126808516 -0.74192286377215244
+0.29827686211693072 -0.9365609960788055 0.38998766307204563
+0.31589117859806226 -0.89324145828887092 -0.44478475305090459
+0.33700104792563468 -0.84975716552598102 0.49525883802792398
+0.3601361494343176 -0.80485714071361691 -0.54001796879892028
+0.24939270379056044 -1.0288981373351189 0.13624095340381406
+0.31589117859806226 -0.89324145828887092 0.44478475305090459
+0.86456827261077818 -0.055985456198852979 -0.63704738383668824
+0.29827686211693072 -0.9365609960788055 -0.38998766307204569
+0.28487018589300406 -0.98033669342916963 -0.33088129441328618
+0.24939270379056055 -1.0288981373351189 -0.13624095340381406
+0.66601387759394237 -0.34452585126808494 0.74192286377215244
+0.28487018589300406 -0.98033669342916951 0.33088129441328606
+0.55072013821425636 -0.54530214016523193 0.73248511743144051
+0.58553016581808792 -0.47712117915505481 0.7402458861856146
+0.71201440833835739 -0.28105923500562369 0.73618246464930526
+3  1361 1397 258
+3  1363 1401 259
+3  2291 2309 260
+3  1365 1405 261
+3  1367 1393 262
+3  1369 1413 263
+3  1371 1416 264
+3  2263 2280 265
+3  1373 1421 266
+3  1375 1409 267
+3  1377 1429 268
+3  1379 1433 269
+3  1381 1437 270
+3  1383 1441 271
+3  1385 1425 272
+3  1387 1399 273
+3  1389 1415 274
+3  1391 1407 275
+3  1393 1367 276
+3  1395 1427 277
+3  1397 1361 278
+3  1399 1387 279
+3  1401 1363 280
+3  1403 1419 281
+3  181 182 2309
+3  1405 1365 282
+3  1407 1391 283
+3  1409 1375 284
+3  1411 1439 285
+3  1413 1369 286
+3  1415 1389 287
+3  1416 1371 288
+3  1419 1403 289
+3  1421 1373 290
+3  1423 1447 291
+3  1425 1385 292
+3  1427 1395 293
+3  1429 1377 294
+3  1431 1459 295
+3  1433 1379 296
+3  1435 1449 297
+3  1437 1381 298
+3  1439 1411 299
+3  1441 1383 300
+3  1443 1445 301
+3  1445 1443 302
+3  1447 1423 303
+3  1449 1435 304
+3  1451 1453 305
+3  1453 1451 306
+3  1455 1457 307
+3  1457 1455 308
+3  1459 1431 309
+3  1461 1467 310
+3  1463 1477 311
+3  1465 1471 312
+3  1467 1461 313
+3  1469 1475 314
+3  1471 1465 315
+3  1473 1479 316
+3  1475 1469 317
+3  1477 1463 318
+3  1479 1473 319
+3  1481 1487 320
+3  1483 1497 321
+3  1485 1491 322
+3  1487 1481 323
+3  1489 1495 324
+3  1491 1485 325
+3  1493 1499 326
+3  1495 1489 327
+3  1497 1483 328
+3  1499 1493 329
+3  1501 1507 330
+3  1503 1517 331
+3  1505 1511 332
+3  1507 1501 333
+3  1509 1515 334
+3  1511 1505 335
+3  1513 1519 336
+3  1515 1509 337
+3  1517 1503 338
+3  1519 1513 339
+3  1521 1543 340
+3  1523 1625 341
+3  1525 1569 342
+3  1527 1609 343
+3  1529 1553 344
+3  1531 1647 345
+3  1533 1557 346
+3  1535 1593 347
+3  1537 1591 348
+3  1539 1541 349
+3  1541 1539 350
+3  1543 1521 351
+3  1545 1635 352
+3  1547 1549 353
+3  1549 1547 354
+3  1551 1577 355
+3  1553 1529 356
+3  1555 1655 357
+3  1557 1533 358
+3  1559 1587 359
+3  1561 1617 360
+3  1563 1615 361
+3  1565 1567 362
+3  1567 1565 363
+3  1569 1525 364
+3  1571 1641 365
+3  1573 1575 366
+3  1575 1573 367
+3  1577 1551 368
+3  1579 1581 369
+3  1581 1579 370
+3  1583 1633 371
+3  1585 1631 372
+3  1587 1559 373
+3  1589 1627 374
+3  1591 1537 375
+3  1593 1535 376
+3  1595 1597 377
+3  1597 1595 378
+3  1599 1653 379
+3  1601 1651 380
+3  1603 1605 381
+3  1605 1603 382
+3  1607 1637 383
+3  1609 1527 384
+3  1611 1613 385
+3  1613 1611 386
+3  1615 1563 387
+3  1617 1561 388
+3  1619 1621 389
+3  1621 1619 390
+3  1623 1629 391
+3  1625 1523 392
+3  1627 1589 393
+3  1629 1623 394
+3  1631 1585 395
+3  1633 1583 396
+3  1635 1545 397
+3  1637 1607 398
+3  1639 1643 399
+3  2278 38 2322
+3  1641 1571 400
+3  1643 1639 401
+3  1645 1649 402
+3  1647 1531 403
+3  3 4 2325
+3  1649 1645 404
+3  1651 1601 405
+3  1653 1599 406
+3  1655 1555 407
+3  1656 1835 408
+3  1657 1762 409
+3  1658 1843 410
+3  1659 1766 411
+3  1660 1847 412
+3  1661 1772 413
+3  1662 1827 414
+3  1663 1758 415
+3  1664 1863 416
+3  1665 1780 417
+3  1666 2312 2269
+3  2297 1869 2281
+3  1667 1786 418
+3  1668 1877 419
+3  1669 1790 420
+3  1670 1855 421
+3  1671 1776 422
+3  1672 1893 423
+3  1673 1798 424
+3  1674 1901 425
+3  1675 1802 426
+3  1676 1909 427
+3  1677 1806 428
+3  1678 1917 429
+3  1679 1810 430
+3  1680 1885 431
+3  1681 1794 432
+3  1682 1839 433
+3  1683 1834 434
+3  1684 1866 435
+3  1685 1862 436
+3  1686 1851 437
+3  1687 1846 438
+3  1688 1773 439
+3  1689 1850 440
+3  1690 1889 441
+3  1691 1884 442
+3  1692 1759 443
+3  1693 1830 444
+3  1694 1815 445
+3  1695 1928 446
+3  1696 1763 447
+3  1697 1838 448
+3  1698 1873 449
+3  1699 1868 450
+3  1700 1767 451
+3  2307 1844 452
+3  1701 2328 453
+3  1702 1823 454
+3  1703 1949 455
+3  1704 1791 456
+3  1705 1880 457
+3  1706 1913 458
+3  1707 1908 459
+3  1708 1777 460
+3  1709 1858 461
+3  1710 1819 462
+3  1711 1935 463
+3  1712 1781 464
+3  1713 1865 465
+3  108 109 2320
+3  1714 1845 466
+3  1715 1842 467
+3  1716 1787 468
+3  1717 1872 469
+3  1718 1929 470
+3  1719 1924 471
+3  1720 1811 472
+3  1721 1920 473
+3  1722 1831 474
+3  1723 1826 475
+3  1724 1795 476
+3  1725 1888 477
+3  1726 1950 478
+3  1727 1945 479
+3  1728 1799 480
+3  1729 1896 481
+3  1730 1933 482
+3  1731 1818 483
+3  1732 1803 484
+3  1733 1904 485
+3  1734 1859 486
+3  1735 1854 487
+3  1736 1807 488
+3  1737 1912 489
+3  1738 1925 490
+3  1739 1814 491
+3  1740 1921 492
+3  1741 1916 493
+3  1742 1881 494
+3  1743 1876 495
+3  1744 1905 496
+3  1745 1900 497
+3  1746 1940 498
+3  1747 1820 499
+3  1748 1936 500
+3  1749 1932 501
+3  1750 1946 502
+3  1751 1822 503
+3  1752 1942 504
+3  1753 1939 505
+3  1754 1897 506
+3  1755 1892 507
+3  1756 1761 508
+3  1757 1770 509
+3  1758 1663 510
+3  1759 1692 511
+3  1760 1765 512
+3  1761 1756 513
+3  1762 1657 514
+3  1763 1696 515
+3  1764 1769 516
+3  1765 1760 517
+3  1766 1659 518
+3  1767 1700 519
+3  1768 1771 520
+3  1769 1764 521
+3  192 193 2301
+3  2328 1701 2294
+3  1770 1757 522
+3  1771 1768 523
+3  1772 1661 524
+3  1773 1688 525
+3  1774 1779 526
+3  1775 1788 527
+3  1776 1671 528
+3  1777 1708 529
+3  1778 1783 530
+3  1779 1774 531
+3  1780 1665 532
+3  1781 1712 533
+3  1782 1785 534
+3  1783 1778 535
+3  2312 1666 536
+3  1784 1789 537
+3  1785 1782 538
+3  1786 1667 539
+3  1787 1716 540
+3  1788 1775 541
+3  1789 1784 542
+3  1790 1669 543
+3  1791 1704 544
+3  1792 1797 545
+3  1793 1808 546
+3  1794 1681 547
+3  1795 1724 548
+3  1796 1801 549
+3  1797 1792 550
+3  1798 1673 551
+3  1799 1728 552
+3  1800 1805 553
+3  1801 1796 554
+3  1802 1675 555
+3  1803 1732 556
+3  1804 1809 557
+3  1805 1800 558
+3  1806 1677 559
+3  1807 1736 560
+3  1808 1793 561
+3  1809 1804 562
+3  1810 1679 563
+3  1811 1720 564
+3  1812 1833 565
+3  1813 1918 566
+3  1814 1739 567
+3  1815 1694 568
+3  1816 1861 569
+3  1817 1902 570
+3  1818 1731 571
+3  1819 1710 572
+3  1820 1747 573
+3  2264 232 2275
+3  1821 1941 574
+3  1822 1751 575
+3  1823 1702 576
+3  1824 1849 577
+3  1825 1886 578
+3  1826 1723 579
+3  1827 1662 580
+3  1828 1883 581
+3  1829 1832 582
+3  1830 1693 583
+3  1831 1722 584
+3  1832 1829 585
+3  1833 1812 586
+3  1834 1683 587
+3  1835 1656 588
+3  1836 1927 589
+3  1837 1840 590
+3  1838 1697 591
+3  1839 1682 592
+3  1840 1837 593
+3  1841 1870 594
+3  1842 1715 595
+3  1843 1658 596
+3  1844 2307 2268
+3  1845 1714 597
+3  1846 1687 598
+3  1847 1660 599
+3  1848 1948 600
+3  1849 1824 601
+3  1850 1689 602
+3  1851 1686 603
+3  1852 1879 604
+3  1853 1910 605
+3  1854 1735 606
+3  1855 1670 607
+3  1856 1907 608
+3  1857 1860 609
+3  1858 1709 610
+3  1859 1734 611
+3  1860 1857 612
+3  1861 1816 613
+3  1862 1685 614
+3  1863 1664 615
+3  2315 1934 616
+3  1864 1867 617
+3  1865 1713 618
+3  1866 1684 619
+3  1867 1864 620
+3  1868 1699 621
+3  1869 2297 622
+3  1870 1841 623
+3  1871 1874 624
+3  1872 1717 625
+3  1873 1698 626
+3  1874 1871 627
+3  1875 1926 628
+3  1876 1743 629
+3  1877 1668 630
+3  1878 1923 631
+3  1879 1852 632
+3  1880 1705 633
+3  1881 1742 634
+3  1882 1919 635
+3  1883 1828 636
+3  1884 1691 637
+3  1885 1680 638
+3  1886 1825 639
+3  1887 1890 640
+3  1888 1725 641
+3  1889 1690 642
+3  1890 1887 643
+3  1891 1947 644
+3  1892 1755 645
+3  1893 1672 646
+3  1894 1944 647
+3  1895 1898 648
+3  1896 1729 649
+3  1897 1754 650
+3  1898 1895 651
+3  1899 1930 652
+3  1900 1745 653
+3  1901 1674 654
+3  1902 1817 655
+3  1903 1906 656
+3  1904 1733 657
+3  1905 1744 658
+3  1906 1903 659
+3  1907 1856 660
+3  1908 1707 661
+3  1909 1676 662
+3  1910 1853 663
+3  1911 1914 664
+3  1912 1737 665
+3  1913 1706 666
+3  1914 1911 667
+3  1915 1922 668
+3  1916 1741 669
+3  1917 1678 670
+3  1918 1813 671
+3  1919 1882 672
+3  1920 1721 673
+3  1921 1740 674
+3  1922 1915 675
+3  1923 1878 676
+3  1924 1719 677
+3  1925 1738 678
+3  1926 1875 679
+3  1927 1836 680
+3  1928 1695 681
+3  1929 1718 682
+3  1930 1899 683
+3  1931 1937 684
+3  1932 1749 685
+3  1933 1730 686
+3  1934 2315 2296
+3  1935 1711 687
+3  1936 1748 688
+3  1937 1931 689
+3  1938 1943 690
+3  1939 1753 691
+3  1940 1746 692
+3  1941 1821 693
+3  2319 1951 2316
+3  1942 1752 694
+3  1943 1938 695
+3  1944 1894 696
+3  1945 1727 697
+3  1946 1750 698
+3  1947 1891 699
+3  1948 1848 700
+3  1949 1703 701
+3  1950 1726 702
+3  1951 2319 703
+3  1953 704 583
+3  1238 705 408
+3  1955 706 591
+3  1246 707 410
+3  174 175 2290
+3  2293 217 2327
+3  1251 708 412
+3  1957 709 602
+3  1229 710 414
+3  1959 711 610
+3  1268 712 416
+3  1960 713 618
+3  82 83 2311
+3  1962 714 625
+3  1282 715 419
+3  1964 716 633
+3  1259 717 421
+3  1966 718 641
+3  1299 719 423
+3  1968 720 649
+3  1307 721 425
+3  1970 722 657
+3  1316 723 427
+3  1972 724 665
+3  1325 725 429
+3  1974 726 673
+3  1290 727 431
+3  1976 728 681
+3  1242 729 433
+3  1978 730 687
+3  1271 731 435
+3  1980 732 701
+3  1255 733 437
+3  1982 734 510
+3  1172 735 439
+3  1984 736 579
+3  1294 737 441
+3  1986 738 514
+3  1157 739 443
+3  1988 740 587
+3  1217 741 445
+3  1990 742 518
+3  1161 743 447
+3  1992 744 595
+3  1277 745 449
+3  1994 2310 2301
+3  1165 746 451
+3  1996 747 524
+3  1168 748 453
+3  1998 749 598
+3  1225 750 454
+3  2000 751 528
+3  1191 752 456
+3  2002 753 606
+3  1320 754 458
+3  2004 755 532
+3  1177 756 460
+3  2006 757 614
+3  1221 758 462
+3  2008 759 536
+3  1181 760 464
+3  2010 761 539
+3  2283 762 2320
+3  2011 763 621
+3  1248 764 466
+3  2013 765 543
+3  1187 766 468
+3  2015 767 629
+3  1337 768 470
+3  2017 769 547
+3  1212 770 472
+3  2019 771 637
+3  1234 772 474
+3  2021 773 551
+3  1196 774 476
+3  2023 775 645
+3  1358 776 478
+3  2025 777 555
+3  1200 778 480
+3  2027 779 653
+3  1341 780 482
+3  2029 781 559
+3  1204 782 484
+3  2031 783 661
+3  1264 784 486
+3  2033 785 563
+3  1208 786 488
+3  2035 787 669
+3  1333 788 490
+3  2037 789 567
+3  1329 790 492
+3  2039 791 677
+3  1286 792 494
+3  2041 793 571
+3  1312 794 496
+3  2043 795 685
+3  1349 796 498
+3  2045 797 573
+3  1344 798 500
+3  2047 799 691
+3  1354 800 502
+3  2049 801 575
+3  1350 802 504
+3  2051 803 697
+3  1303 804 506
+3  2052 805 447
+3  1159 806 508
+3  2053 807 520
+3  1016 808 510
+3  2054 809 451
+3  1163 810 512
+3  2055 811 522
+3  1006 812 514
+3  2056 813 453
+3  1167 814 516
+3  2057 815 508
+3  1009 816 518
+3  2058 817 439
+3  1170 818 520
+3  2059 819 512
+3  1010 820 2301
+3  2060 821 443
+3  1155 822 522
+3  2061 823 516
+3  1013 824 524
+3  2062 825 464
+3  1179 826 526
+3  2063 827 537
+3  1029 828 528
+3  2064 829 2320
+3  1183 830 530
+3  2065 831 541
+3  1019 832 532
+3  2066 833 468
+3  1185 834 534
+3  2067 835 526
+3  1020 836 536
+3  2068 837 456
+3  1189 838 537
+3  2069 839 530
+3  1023 840 539
+3  2070 841 460
+3  1175 842 541
+3  2071 843 534
+3  1026 844 543
+3  2072 845 480
+3  1198 846 545
+3  2073 847 557
+3  1044 848 547
+3  2074 849 484
+3  1202 850 549
+3  2075 851 561
+3  1032 852 551
+3  2076 853 488
+3  1206 854 553
+3  2077 855 545
+3  1035 856 555
+3  2078 857 472
+3  1210 858 557
+3  2079 859 549
+3  1038 860 559
+3  2080 861 476
+3  1194 862 561
+3  2081 863 553
+3  1041 864 563
+3  2082 865 408
+3  1236 866 565
+3  2083 867 635
+3  1129 868 567
+3  2084 869 416
+3  1266 870 569
+3  2085 871 659
+3  1117 872 571
+3  2086 2321 616
+3  1141 873 573
+3  2087 874 412
+3  1249 875 2264
+3  2088 876 703
+3  1147 877 575
+3  2089 878 437
+3  1253 879 577
+3  2090 880 643
+3  1105 881 579
+3  2091 882 431
+3  1288 883 581
+3  2092 884 565
+3  1062 885 583
+3  2093 886 474
+3  1232 887 585
+3  2094 888 671
+3  1047 889 587
+3  2095 890 470
+3  1335 891 589
+3  2096 892 623
+3  1068 893 591
+3  2097 894 433
+3  1240 895 593
+3  2098 896 627
+3  1093 897 595
+3  2270 2305 466
+3  229 230 2264
+3  2099 898 693
+3  1053 899 598
+3  2100 900 478
+3  1356 901 600
+3  2101 902 639
+3  1056 903 602
+3  2102 904 494
+3  1284 905 604
+3  2103 906 667
+3  1123 907 606
+3  2104 908 427
+3  1314 909 608
+3  2105 910 569
+3  1084 911 610
+3  2106 912 486
+3  1262 913 612
+3  2107 914 655
+3  1050 915 614
+3  2108 916 500
+3  1342 917 616
+3  2109 918 2266
+3  1090 919 618
+3  2110 920 435
+3  1269 921 620
+3  2298 2284 621
+3  2111 922 410
+3  1244 923 623
+3  2112 924 679
+3  1096 925 625
+3  2113 926 449
+3  1275 927 627
+3  2114 928 589
+3  1135 929 629
+3  2115 930 490
+3  1331 931 631
+3  2116 932 663
+3  1078 933 633
+3  2117 934 492
+3  1327 935 635
+3  2118 936 585
+3  1059 937 637
+3  2119 938 414
+3  1227 939 639
+3  2120 940 699
+3  1108 941 641
+3  2121 942 441
+3  1292 943 643
+3  2122 944 600
+3  1152 945 645
+3  2123 946 502
+3  1352 947 647
+3  2124 948 683
+3  1114 949 649
+3  2125 950 506
+3  1301 951 651
+3  2126 952 689
+3  1138 953 653
+3  2127 954 462
+3  1219 955 655
+3  2128 956 608
+3  1120 957 657
+3  2129 958 496
+3  1310 959 659
+3  2130 960 612
+3  1081 961 661
+3  2131 962 421
+3  1257 963 663
+3  2132 964 675
+3  1126 965 665
+3  2133 966 458
+3  1318 967 667
+3  2134 968 631
+3  1132 969 669
+3  2135 970 445
+3  1215 971 671
+3  2136 972 581
+3  1102 973 673
+3  2137 974 429
+3  1323 975 675
+3  2138 976 604
+3  1099 977 677
+3  2139 978 419
+3  1280 979 679
+3  2140 980 593
+3  1065 981 681
+3  2141 982 425
+3  1305 983 683
+3  2142 984 695
+3  1144 985 685
+3  2143 986 620
+3  1087 987 687
+3  2144 988 482
+3  1339 989 689
+3  2145 990 647
+3  1149 991 691
+3  2146 992 454
+3  1223 993 693
+3  2147 994 498
+3  1347 995 695
+3  2148 996 651
+3  1111 997 697
+3  2149 998 423
+3  1297 999 699
+3  2150 1000 577
+3  1075 1001 701
+3  2151 1002 504
+3  2314 1003 703
+3  2152 1004 434
+3  1160 1005 409
+3  812 1006 310
+3  738 1986 258
+3  2153 1007 467
+3  1164 1008 411
+3  816 1009 312
+3  742 1990 259
+3  820 1010 314
+3  2310 1994 260
+3  2154 1011 438
+3  1171 1012 413
+3  824 1013 316
+3  747 1996 261
+3  2155 1014 475
+3  1156 1015 415
+3  808 1016 318
+3  734 1982 262
+3  2156 1017 436
+3  1180 1018 417
+3  832 1019 320
+3  755 2004 263
+3  836 1020 322
+3  759 2008 264
+3  2157 1021 450
+3  1186 1022 418
+3  840 1023 324
+3  761 2010 265
+3  2158 1024 495
+3  1190 1025 420
+3  844 1026 326
+3  765 2013 266
+3  2159 1027 487
+3  1176 1028 422
+3  828 1029 328
+3  751 2000 267
+3  2160 1030 507
+3  1199 1031 424
+3  852 1032 330
+3  773 2021 268
+3  2161 1033 497
+3  1203 1034 426
+3  856 1035 332
+3  777 2025 269
+3  2162 1036 459
+3  1207 1037 428
+3  860 1038 334
+3  781 2029 270
+3  2163 1039 493
+3  1211 1040 430
+3  864 1041 336
+3  785 2033 271
+3  2164 1042 442
+3  1195 1043 432
+3  848 1044 338
+3  769 2017 272
+3  2165 1045 448
+3  1237 1046 434
+3  889 1047 340
+3  740 1988 273
+3  2166 1048 465
+3  1267 1049 436
+3  915 1050 342
+3  757 2006 274
+3  2167 1051 440
+3  1250 1052 438
+3  899 1053 344
+3  749 1998 275
+3  2169 1054 413
+3  1254 1055 440
+3  903 1056 346
+3  709 1957 276
+3  2170 1057 477
+3  1289 1058 442
+3  937 1059 348
+3  771 2019 277
+3  2172 1060 415
+3  1233 1061 444
+3  885 1062 350
+3  704 1953 278
+3  2174 1063 491
+3  1336 1064 446
+3  981 1065 352
+3  728 1976 279
+3  2176 1066 409
+3  1241 1067 448
+3  893 1068 354
+3  706 1955 280
+3  2177 1069 469
+3  1273 1070 450
+3  763 2011 281
+3  2179 1071 411
+3  1247 1072 452
+3  2293 2327 282
+3  2181 1073 503
+3  1357 1074 455
+3  1001 1075 357
+3  732 1980 283
+3  2183 1076 420
+3  1285 1077 457
+3  933 1078 359
+3  716 1964 284
+3  2184 1079 489
+3  1315 1080 459
+3  961 1081 361
+3  783 2031 285
+3  2186 1082 422
+3  1263 1083 461
+3  911 1084 363
+3  711 1959 286
+3  2188 1085 483
+3  1343 1086 463
+3  987 1087 365
+3  730 1978 287
+3  2190 1088 417
+3  1270 1089 465
+3  919 1090 367
+3  713 1960 288
+3  99 100 2272
+3  2191 1091 452
+3  1245 1092 467
+3  897 1093 368
+3  744 1992 289
+3  2193 1094 418
+3  1276 1095 469
+3  925 1096 370
+3  714 1962 290
+3  2194 1097 446
+3  1332 1098 471
+3  977 1099 372
+3  791 2039 291
+3  2196 1100 430
+3  1328 1101 473
+3  973 1102 374
+3  726 1974 292
+3  2197 1103 444
+3  1228 1104 475
+3  881 1105 376
+3  736 1984 293
+3  2199 1106 432
+3  1293 1107 477
+3  941 1108 378
+3  718 1966 294
+3  2200 1109 455
+3  1353 1110 479
+3  997 1111 380
+3  803 2051 295
+3  2202 1112 424
+3  1302 1113 481
+3  949 1114 382
+3  720 1968 296
+3  2203 1115 501
+3  1220 1116 483
+3  872 1117 384
+3  793 2041 297
+3  2205 1118 426
+3  1311 1119 485
+3  957 1120 386
+3  722 1970 298
+3  2206 1121 461
+3  1258 1122 487
+3  907 1123 388
+3  753 2002 299
+3  2208 1124 428
+3  1319 1125 489
+3  965 1126 390
+3  724 1972 300
+3  2209 1127 471
+3  1216 1128 491
+3  868 1129 392
+3  789 2037 301
+3  2210 1130 473
+3  1324 1131 493
+3  969 1132 394
+3  787 2035 302
+3  2211 1133 457
+3  1281 1134 495
+3  929 1135 396
+3  767 2015 303
+3  2212 1136 485
+3  1306 1137 497
+3  953 1138 398
+3  779 2027 304
+3  2213 1139 505
+3  1222 1140 499
+3  873 1141 2322
+3  797 2045 305
+3  2214 1142 463
+3  1340 1143 501
+3  985 1144 401
+3  795 2043 306
+3  2215 1145 479
+3  1224 1146 503
+3  877 1147 403
+3  801 2049 307
+3  2216 2318 2279
+3  1348 1148 505
+3  991 1149 404
+3  799 2047 308
+3  2217 1150 481
+3  1298 1151 507
+3  945 1152 406
+3  775 2023 309
+3  2219 2323 499
+3  2279 19 2303
+3  2221 1153 517
+3  1169 1154 509
+3  822 1155 311
+3  811 2055 310
+3  1015 1156 580
+3  1060 2172 511
+3  739 1157 258
+3  821 2060 311
+3  2222 1158 521
+3  1153 2221 513
+3  806 1159 313
+3  815 2057 312
+3  1005 1160 588
+3  1066 2176 515
+3  743 1161 259
+3  805 2052 313
+3  2223 1162 523
+3  1158 2222 517
+3  810 1163 315
+3  819 2059 314
+3  1008 1164 596
+3  1071 2179 519
+3  746 1165 260
+3  809 2054 315
+3  2224 1166 509
+3  1162 2223 521
+3  814 1167 317
+3  823 2061 316
+3  202 203 2294
+3  748 1168 261
+3  813 2056 317
+3  1154 1169 513
+3  1166 2224 523
+3  818 1170 319
+3  807 2053 318
+3  1012 1171 599
+3  1054 2169 525
+3  735 1172 262
+3  817 2058 319
+3  2226 1173 535
+3  1188 1174 527
+3  842 1175 321
+3  831 2065 320
+3  1028 1176 607
+3  1082 2186 529
+3  756 1177 263
+3  841 2070 321
+3  2227 1178 538
+3  1173 2226 531
+3  826 1179 323
+3  835 2067 322
+3  1018 1180 615
+3  1088 2190 533
+3  760 1181 264
+3  825 2062 323
+3  2228 1182 542
+3  1178 2227 535
+3  830 1183 325
+3  839 2069 324
+3  762 2283 265
+3  829 2064 325
+3  2229 1184 527
+3  1182 2228 538
+3  834 1185 327
+3  843 2071 326
+3  1022 1186 622
+3  1094 2193 540
+3  766 1187 266
+3  833 2066 327
+3  1174 1188 531
+3  1184 2229 542
+3  838 1189 329
+3  827 2063 328
+3  1025 1190 630
+3  1076 2183 544
+3  752 1191 267
+3  837 2068 329
+3  2231 1192 554
+3  1209 1193 546
+3  862 1194 331
+3  851 2075 330
+3  1043 1195 638
+3  1106 2199 548
+3  774 1196 268
+3  861 2080 331
+3  2232 1197 558
+3  1192 2231 550
+3  846 1198 333
+3  855 2077 332
+3  1031 1199 646
+3  1112 2202 552
+3  778 1200 269
+3  845 2072 333
+3  2233 1201 562
+3  1197 2232 554
+3  850 1202 335
+3  859 2079 334
+3  1034 1203 654
+3  1118 2205 556
+3  782 1204 270
+3  849 2074 335
+3  2234 1205 546
+3  1201 2233 558
+3  854 1206 337
+3  863 2081 336
+3  1037 1207 662
+3  1124 2208 560
+3  786 1208 271
+3  853 2076 337
+3  1193 1209 550
+3  1205 2234 562
+3  858 1210 339
+3  847 2073 338
+3  1040 1211 670
+3  1100 2196 564
+3  770 1212 272
+3  857 2078 339
+3  2236 1213 582
+3  1326 1214 566
+3  971 1215 341
+3  888 2094 340
+3  1128 1216 678
+3  1063 2174 568
+3  741 1217 273
+3  970 2135 341
+3  2237 1218 609
+3  1308 2256 570
+3  955 1219 343
+3  914 2107 342
+3  1116 1220 686
+3  1085 2188 572
+3  758 1221 274
+3  954 2127 343
+3  1140 1222 692
+3  2323 2219 2302
+3  2286 2287 574
+3  993 1223 345
+3  898 2099 344
+3  1146 1224 698
+3  1073 2181 576
+3  750 1225 275
+3  992 2146 345
+3  2238 1226 700
+3  1291 2250 578
+3  939 1227 347
+3  902 2101 346
+3  1104 1228 584
+3  1014 2155 580
+3  710 1229 276
+3  938 2119 347
+3  2239 1230 672
+3  1235 1231 582
+3  887 1232 349
+3  936 2118 348
+3  1061 1233 511
+3  1103 2197 584
+3  772 1234 277
+3  886 2093 349
+3  1231 1235 636
+3  1213 2236 586
+3  866 1236 351
+3  884 2092 350
+3  1046 1237 592
+3  1004 2152 588
+3  705 1238 278
+3  865 2082 351
+3  2240 1239 628
+3  1243 2241 590
+3  895 1240 353
+3  980 2140 352
+3  1067 1241 515
+3  1045 2165 592
+3  729 1242 279
+3  894 2097 353
+3  2241 1243 680
+3  1274 2245 594
+3  923 1244 355
+3  892 2096 354
+3  1092 1245 597
+3  1007 2153 596
+3  707 1246 280
+3  922 2111 355
+3  1072 1247 519
+3  1091 2191 597
+3  764 1248 281
+3  157 158 2305
+3  875 1249 356
+3  1052 1250 603
+3  1011 2154 599
+3  708 1251 282
+3  874 2087 356
+3  2242 1252 644
+3  1226 2238 601
+3  879 1253 358
+3  1000 2150 357
+3  1055 1254 525
+3  1051 2167 603
+3  733 1255 283
+3  878 2089 358
+3  2243 1256 676
+3  1317 2257 605
+3  963 1257 360
+3  932 2116 359
+3  1122 1258 611
+3  1027 2159 607
+3  717 1259 284
+3  962 2131 360
+3  2244 1260 656
+3  1265 1261 609
+3  913 1262 362
+3  960 2130 361
+3  1083 1263 529
+3  1121 2206 611
+3  784 1264 285
+3  912 2106 362
+3  1261 1265 660
+3  1218 2237 613
+3  870 1266 364
+3  910 2105 363
+3  1049 1267 619
+3  1017 2156 615
+3  712 1268 286
+3  869 2084 364
+3  1272 2317 617
+3  921 1269 366
+3  986 2143 365
+3  1089 1270 533
+3  1048 2166 619
+3  731 1271 287
+3  920 2110 366
+3  2317 1272 2296
+3  2274 60 2276
+3  918 2109 367
+3  2311 2265 288
+3  1070 1273 626
+3  1021 2157 622
+3  2245 1274 590
+3  1278 2247 624
+3  927 1275 369
+3  896 2098 368
+3  1095 1276 540
+3  1069 2177 626
+3  745 1277 289
+3  926 2113 369
+3  2247 1278 594
+3  1334 1279 628
+3  979 1280 371
+3  924 2112 370
+3  1134 1281 634
+3  1024 2158 630
+3  715 1282 290
+3  978 2139 371
+3  2248 1283 668
+3  1256 2243 632
+3  905 1284 373
+3  976 2138 372
+3  1077 1285 544
+3  1133 2211 634
+3  792 1286 291
+3  904 2102 373
+3  2249 1287 566
+3  1230 2239 636
+3  883 1288 375
+3  972 2136 374
+3  1058 1289 642
+3  1042 2164 638
+3  727 1290 292
+3  882 2091 375
+3  2250 1291 601
+3  1295 2252 640
+3  943 1292 377
+3  880 2090 376
+3  1107 1293 548
+3  1057 2170 642
+3  737 1294 293
+3  942 2121 377
+3  2252 1295 578
+3  1355 1296 644
+3  999 1297 379
+3  940 2120 378
+3  1151 1298 650
+3  1030 2160 646
+3  719 1299 294
+3  998 2149 379
+3  2253 1300 690
+3  1304 2254 648
+3  951 1301 381
+3  996 2148 380
+3  1113 1302 552
+3  1150 2217 650
+3  804 1303 295
+3  950 2125 381
+3  2254 1304 696
+3  1338 2260 652
+3  983 1305 383
+3  948 2124 382
+3  1137 1306 658
+3  1033 2161 654
+3  721 1307 296
+3  982 2141 383
+3  2256 1308 613
+3  1313 1309 656
+3  959 1310 385
+3  871 2085 384
+3  1119 1311 556
+3  1136 2212 658
+3  794 1312 297
+3  958 2129 385
+3  1309 1313 570
+3  1260 2244 660
+3  909 1314 387
+3  956 2128 386
+3  1080 1315 666
+3  1036 2162 662
+3  723 1316 298
+3  908 2104 387
+3  2257 1317 632
+3  1321 2259 664
+3  967 1318 389
+3  906 2103 388
+3  1125 1319 560
+3  1079 2184 666
+3  754 1320 299
+3  966 2133 389
+3  2259 1321 605
+3  1330 1322 668
+3  975 1323 391
+3  964 2132 390
+3  1131 1324 674
+3  1039 2163 670
+3  725 1325 300
+3  974 2137 391
+3  1214 1326 586
+3  1287 2249 672
+3  935 1327 393
+3  867 2083 392
+3  1101 1328 564
+3  1130 2210 674
+3  790 1329 301
+3  934 2117 393
+3  1322 1330 664
+3  1283 2248 676
+3  931 1331 395
+3  968 2134 394
+3  1098 1332 682
+3  1127 2209 678
+3  788 1333 302
+3  930 2115 395
+3  1279 1334 624
+3  1239 2240 680
+3  891 1335 397
+3  928 2114 396
+3  1064 1336 568
+3  1097 2194 682
+3  768 1337 303
+3  890 2095 397
+3  2260 1338 648
+3  1345 2262 684
+3  989 1339 399
+3  952 2126 398
+3  1143 1340 688
+3  1115 2203 686
+3  780 1341 304
+3  988 2144 399
+3  917 1342 400
+3  2321 2086 2322
+3  1086 1343 572
+3  1142 2214 688
+3  798 1344 305
+3  916 2108 400
+3  2262 1345 652
+3  1351 1346 690
+3  995 1347 402
+3  984 2142 401
+3  1148 1348 694
+3  1139 2213 692
+3  796 1349 306
+3  994 2147 402
+3  1359 2288 2316
+3  1003 2314 2325
+3  876 2088 403
+3  22 23 2303
+3  2318 2216 694
+3  802 1350 307
+3  1002 2151 2325
+3  1346 1351 684
+3  1300 2253 696
+3  947 1352 405
+3  990 2145 404
+3  1110 1353 702
+3  1145 2215 698
+3  800 1354 308
+3  946 2123 405
+3  1296 1355 640
+3  1252 2242 700
+3  901 1356 407
+3  944 2122 406
+3  1074 1357 576
+3  1109 2200 702
+3  776 1358 309
+3  900 2100 407
+3  2274 2276 617
+3  2288 1359 574
+3  1361 1157 1360
+3  1361 704 278
+3  1363 1161 1362
+3  1363 706 280
+3  2291 1165 1364
+3  178 179 2291
+3  1365 1168 2324
+3  1365 2293 282
+3  1367 1172 1366
+3  1367 709 276
+3  1369 1177 1368
+3  1369 711 286
+3  1371 1181 1370
+3  1371 713 288
+3  1373 1187 1372
+3  1373 714 290
+3  1375 1191 1374
+3  1375 716 284
+3  1377 1196 1376
+3  1377 718 294
+3  1379 1200 1378
+3  1379 720 296
+3  1381 1204 1380
+3  1381 722 298
+3  1383 1208 1382
+3  1383 724 300
+3  1385 1212 1384
+3  1385 726 292
+3  1387 1217 1386
+3  1387 728 279
+3  1389 1221 1388
+3  1389 730 287
+3  1391 1225 1390
+3  1391 732 283
+3  1393 1229 1392
+3  1393 734 262
+3  1395 1234 1394
+3  1395 736 293
+3  1397 1238 1396
+3  1397 738 258
+3  1399 1242 1398
+3  1399 740 273
+3  1401 1246 1400
+3  1401 742 259
+3  1403 1248 1402
+3  1403 744 289
+3  2309 2310 260
+3  1405 1251 1404
+3  1405 747 261
+3  1407 1255 1406
+3  1407 749 275
+3  1409 1259 1408
+3  1409 751 267
+3  1411 1264 1410
+3  1411 753 299
+3  1413 1268 1412
+3  1413 755 263
+3  1415 1271 1414
+3  1415 757 274
+3  1416 2265 2313
+3  1416 759 264
+3  2280 2282 1417
+3  2280 761 265
+3  1419 1277 1418
+3  1419 763 281
+3  1421 1282 1420
+3  1421 765 266
+3  1423 1286 1422
+3  1423 767 303
+3  1425 1290 1424
+3  1425 769 272
+3  1427 1294 1426
+3  1427 771 277
+3  1429 1299 1428
+3  1429 773 268
+3  1431 1303 1430
+3  1431 775 309
+3  1433 1307 1432
+3  1433 777 269
+3  1435 1312 1434
+3  1435 779 304
+3  1437 1316 1436
+3  1437 781 270
+3  1439 1320 1438
+3  1439 783 285
+3  1441 1325 1440
+3  1441 785 271
+3  1443 1329 1442
+3  1443 787 302
+3  1445 1333 1444
+3  1445 789 301
+3  1447 1337 1446
+3  1447 791 291
+3  1449 1341 1448
+3  1449 793 297
+3  1451 1344 1450
+3  1451 795 306
+3  1453 1349 1452
+3  1453 797 305
+3  1455 1350 1454
+3  1455 799 308
+3  1457 1354 1456
+3  1457 801 307
+3  1459 1358 1458
+3  1459 803 295
+3  1461 1006 1460
+3  1461 805 313
+3  1463 1155 1462
+3  1463 807 318
+3  1465 1009 1464
+3  1465 809 315
+3  1467 1159 1466
+3  1467 811 310
+3  1469 1010 1468
+3  1469 813 317
+3  1471 1163 1470
+3  1471 815 312
+3  1473 1013 1472
+3  1473 817 319
+3  1475 1167 1474
+3  1475 819 314
+3  1477 1016 1476
+3  1477 821 311
+3  1479 1170 1478
+3  1479 823 316
+3  1481 1019 1480
+3  1481 825 323
+3  1483 1175 1482
+3  1483 827 328
+3  1485 1020 1484
+3  1485 829 325
+3  1487 1179 1486
+3  1487 831 320
+3  1489 1023 1488
+3  1489 833 327
+3  1491 1183 1490
+3  1491 835 322
+3  1493 1026 1492
+3  1493 837 329
+3  1495 1185 1494
+3  1495 839 324
+3  1497 1029 1496
+3  1497 841 321
+3  1499 1189 1498
+3  1499 843 326
+3  1501 1032 1500
+3  1501 845 333
+3  1503 1194 1502
+3  1503 847 338
+3  1505 1035 1504
+3  1505 849 335
+3  1507 1198 1506
+3  1507 851 330
+3  1509 1038 1508
+3  1509 853 337
+3  1511 1202 1510
+3  1511 855 332
+3  1513 1041 1512
+3  1513 857 339
+3  1515 1206 1514
+3  1515 859 334
+3  1517 1044 1516
+3  1517 861 331
+3  1519 1210 1518
+3  1519 863 336
+3  1521 1047 1520
+3  1521 865 351
+3  1523 1215 1522
+3  1523 867 392
+3  1525 1050 1524
+3  1525 869 364
+3  1527 1219 1526
+3  1527 871 384
+3  39 40 2322
+3  1529 1053 1528
+3  1529 874 356
+3  1531 1223 1530
+3  1531 876 403
+3  1533 1056 1532
+3  1533 878 358
+3  1535 1227 1534
+3  1535 880 376
+3  1537 1059 1536
+3  1537 882 375
+3  1539 1232 1538
+3  1539 884 350
+3  1541 1062 1540
+3  1541 886 349
+3  1543 1236 1542
+3  1543 888 340
+3  1545 1065 1544
+3  1545 890 397
+3  1547 1240 1546
+3  1547 892 354
+3  1549 1068 1548
+3  1549 894 353
+3  1551 1244 1550
+3  1551 896 368
+3  1553 1249 1552
+3  1553 898 344
+3  1555 1075 1554
+3  1555 900 407
+3  1557 1253 1556
+3  1557 902 346
+3  1559 1078 1558
+3  1559 904 373
+3  1561 1257 1560
+3  1561 906 388
+3  1563 1081 1562
+3  1563 908 387
+3  1565 1262 1564
+3  1565 910 363
+3  1567 1084 1566
+3  1567 912 362
+3  1569 1266 1568
+3  1569 914 342
+3  1571 1087 1570
+3  1571 916 400
+3  1573 1269 1572
+3  1573 918 367
+3  1575 1090 1574
+3  1575 920 366
+3  1577 1093 1576
+3  1577 922 355
+3  1579 1275 1578
+3  1579 924 370
+3  1581 1096 1580
+3  1581 926 369
+3  1583 1280 1582
+3  1583 928 396
+3  1585 1099 1584
+3  1585 930 395
+3  1587 1284 1586
+3  1587 932 359
+3  1589 1102 1588
+3  1589 934 393
+3  1591 1288 1590
+3  1591 936 348
+3  1593 1105 1592
+3  1593 938 347
+3  1595 1292 1594
+3  1595 940 378
+3  1597 1108 1596
+3  1597 942 377
+3  1599 1297 1598
+3  1599 944 406
+3  1601 1111 1600
+3  1601 946 405
+3  1603 1301 1602
+3  1603 948 382
+3  1605 1114 1604
+3  1605 950 381
+3  1607 1305 1606
+3  1607 952 398
+3  1609 1117 1608
+3  1609 954 343
+3  1611 1310 1610
+3  1611 956 386
+3  1613 1120 1612
+3  1613 958 385
+3  1615 1314 1614
+3  1615 960 361
+3  1617 1123 1616
+3  1617 962 360
+3  1619 1318 1618
+3  1619 964 390
+3  1621 1126 1620
+3  1621 966 389
+3  1623 1323 1622
+3  1623 968 394
+3  1625 1129 1624
+3  1625 970 341
+3  1627 1327 1626
+3  1627 972 374
+3  1629 1132 1628
+3  1629 974 391
+3  1631 1331 1630
+3  1631 976 372
+3  1633 1135 1632
+3  1633 978 371
+3  1635 1335 1634
+3  1635 980 352
+3  1637 1138 1636
+3  1637 982 383
+3  1639 1339 1638
+3  1639 984 401
+3  2278 1141 2300
+3  1641 1342 1640
+3  1641 986 365
+3  1643 1144 1642
+3  1643 988 399
+3  1645 1347 1644
+3  1645 990 404
+3  1647 1147 1646
+3  1647 992 345
+3  1649 1149 1648
+3  1649 994 402
+3  1651 1352 1650
+3  1651 996 380
+3  1653 1152 1652
+3  1653 998 379
+3  1655 1356 1654
+3  1655 1000 357
+3  9 10 2285
+3  2308 1002 2325
+3  1656 865 1520
+3  1656 1004 588
+3  1657 1066 1460
+3  1657 1006 514
+3  1658 922 1576
+3  1658 1007 596
+3  1659 1071 1464
+3  1659 1009 518
+3  2292 2277 1468
+3  2292 1010 2301
+3  1660 874 1528
+3  1660 1011 599
+3  1661 1054 1472
+3  1661 1013 524
+3  1662 938 1592
+3  1662 1014 580
+3  1663 1060 1476
+3  1663 1016 510
+3  1664 869 1524
+3  1664 1017 615
+3  1665 1088 1480
+3  1665 1019 532
+3  1666 2272 1484
+3  1666 1020 536
+3  135 136 2299
+3  2297 1021 622
+3  1667 1094 1488
+3  1667 1023 539
+3  1668 978 1632
+3  1668 1024 630
+3  1669 1076 1492
+3  1669 1026 543
+3  1670 962 1616
+3  1670 1027 607
+3  1671 1082 1496
+3  1671 1029 528
+3  1672 998 1652
+3  1672 1030 646
+3  1673 1112 1500
+3  1673 1032 551
+3  1674 982 1636
+3  1674 1033 654
+3  1675 1118 1504
+3  1675 1035 555
+3  1676 908 1562
+3  1676 1036 662
+3  1677 1124 1508
+3  1677 1038 559
+3  1678 974 1628
+3  1678 1039 670
+3  1679 1100 1512
+3  1679 1041 563
+3  1680 882 1536
+3  1680 1042 638
+3  1681 1106 1516
+3  1681 1044 547
+3  1682 894 1548
+3  1682 1045 592
+3  1683 1004 1520
+3  1683 1047 587
+3  1684 920 1574
+3  1684 1048 619
+3  1685 1017 1524
+3  1685 1050 614
+3  1686 878 1532
+3  1686 1051 603
+3  1687 1011 1528
+3  1687 1053 598
+3  1688 817 1472
+3  1688 1054 525
+3  1689 1051 1532
+3  1689 1056 602
+3  1690 942 1596
+3  1690 1057 642
+3  1691 1042 1536
+3  1691 1059 637
+3  1692 821 1476
+3  1692 1060 511
+3  1693 1103 1540
+3  1693 1062 583
+3  1694 970 1624
+3  1694 1063 568
+3  1695 1097 1544
+3  1695 1065 681
+3  1696 805 1460
+3  1696 1066 515
+3  1697 1045 1548
+3  1697 1068 591
+3  1698 926 1580
+3  1698 1069 626
+3  1699 1021 2299
+3  1699 2298 621
+3  1700 809 1464
+3  1700 1071 519
+3  2307 1091 2306
+3  169 170 2268
+3  1701 813 1468
+3  1701 2277 2294
+3  1702 992 1646
+3  1702 1073 576
+3  1703 1109 1554
+3  1703 1075 701
+3  1704 837 1492
+3  1704 1076 544
+3  1705 1133 1558
+3  1705 1078 633
+3  1706 966 1620
+3  1706 1079 666
+3  1707 1036 1562
+3  1707 1081 661
+3  1708 841 1496
+3  1708 1082 529
+3  1709 1121 1566
+3  1709 1084 610
+3  1710 954 1608
+3  1710 1085 572
+3  1711 1142 1570
+3  1711 1087 687
+3  1712 825 1480
+3  1712 1088 533
+3  1713 1048 1574
+3  1713 1090 618
+3  2271 829 1484
+3  103 104 2271
+3  1714 2305 2306
+3  1714 1091 597
+3  1715 1007 1576
+3  1715 1093 595
+3  1716 833 1488
+3  1716 1094 540
+3  1717 1069 1580
+3  1717 1096 625
+3  1718 890 1544
+3  1718 1097 682
+3  1719 1127 1584
+3  1719 1099 677
+3  1720 857 1512
+3  1720 1100 564
+3  1721 1130 1588
+3  1721 1102 673
+3  1722 886 1540
+3  1722 1103 584
+3  1723 1014 1592
+3  1723 1105 579
+3  1724 861 1516
+3  1724 1106 548
+3  1725 1057 1596
+3  1725 1108 641
+3  1726 900 1554
+3  1726 1109 702
+3  1727 1145 1600
+3  1727 1111 697
+3  1728 845 1500
+3  1728 1112 552
+3  1729 1150 1604
+3  1729 1114 649
+3  1730 988 1642
+3  1730 1115 686
+3  1731 1085 1608
+3  1731 1117 571
+3  1732 849 1504
+3  1732 1118 556
+3  1733 1136 1612
+3  1733 1120 657
+3  1734 912 1566
+3  1734 1121 611
+3  1735 1027 1616
+3  1735 1123 606
+3  1736 853 1508
+3  1736 1124 560
+3  1737 1079 1620
+3  1737 1126 665
+3  1738 930 1584
+3  1738 1127 678
+3  1739 1063 1624
+3  1739 1129 567
+3  1740 934 1588
+3  1740 1130 674
+3  1741 1039 1628
+3  1741 1132 669
+3  1742 904 1558
+3  1742 1133 634
+3  1743 1024 1632
+3  1743 1135 629
+3  1744 958 1612
+3  1744 1136 658
+3  1745 1033 1636
+3  1745 1138 653
+3  1746 994 1648
+3  1746 1139 692
+3  1747 2323 2300
+3  1747 1141 573
+3  1748 916 1570
+3  1748 1142 688
+3  1749 1115 1642
+3  1749 1144 685
+3  1750 946 1600
+3  1750 1145 698
+3  1751 1073 1646
+3  1751 1147 575
+3  1752 1002 2285
+3  1752 2318 694
+3  1753 1139 1648
+3  1753 1149 691
+3  1754 950 1604
+3  1754 1150 650
+3  1755 1030 1652
+3  1755 1152 645
+3  2302 27 2323
+3  2285 12 2318
+3  1756 815 1470
+3  1756 1153 513
+3  1757 1166 1462
+3  1757 1155 522
+3  1758 734 1392
+3  1758 1156 415
+3  1759 1233 1360
+3  1759 1157 443
+3  1760 819 1474
+3  1760 1158 517
+3  1761 1169 1466
+3  1761 1159 508
+3  1762 738 1396
+3  1762 1160 409
+3  1763 1241 1362
+3  1763 1161 447
+3  1764 823 1478
+3  1764 1162 521
+3  1765 1153 1470
+3  1765 1163 512
+3  1766 742 1400
+3  1766 1164 411
+3  1767 1247 1364
+3  1767 1165 451
+3  1768 807 1462
+3  1768 1166 523
+3  1769 1158 1474
+3  1769 1167 516
+3  209 210 2328
+3  2328 1168 453
+3  1770 811 1466
+3  1770 1169 509
+3  1771 1162 1478
+3  1771 1170 520
+3  1772 747 1404
+3  1772 1171 413
+3  1773 1254 1366
+3  1773 1172 439
+3  1774 835 1490
+3  1774 1173 531
+3  1775 1184 1482
+3  1775 1175 541
+3  1776 751 1408
+3  1776 1176 422
+3  1777 1263 1368
+3  1777 1177 460
+3  1778 839 1494
+3  1778 1178 535
+3  1779 1188 1486
+3  1779 1179 526
+3  1780 755 1412
+3  1780 1180 417
+3  1781 1270 1370
+3  1781 1181 464
+3  1782 843 1498
+3  1782 1182 538
+3  1783 1173 1490
+3  1783 1183 530
+3  2312 759 2313
+3  2320 109 110
+3  1784 827 1482
+3  1784 1184 542
+3  1785 1178 1494
+3  1785 1185 534
+3  1786 761 1417
+3  1786 1186 418
+3  1787 1276 1372
+3  1787 1187 468
+3  1788 831 1486
+3  1788 1188 527
+3  1789 1182 1498
+3  1789 1189 537
+3  1790 765 1420
+3  1790 1190 420
+3  1791 1285 1374
+3  1791 1191 456
+3  1792 855 1510
+3  1792 1192 550
+3  1793 1205 1502
+3  1793 1194 561
+3  1794 769 1424
+3  1794 1195 432
+3  1795 1293 1376
+3  1795 1196 476
+3  1796 859 1514
+3  1796 1197 554
+3  1797 1209 1506
+3  1797 1198 545
+3  1798 773 1428
+3  1798 1199 424
+3  1799 1302 1378
+3  1799 1200 480
+3  1800 863 1518
+3  1800 1201 558
+3  1801 1192 1510
+3  1801 1202 549
+3  1802 777 1432
+3  1802 1203 426
+3  1803 1311 1380
+3  1803 1204 484
+3  1804 847 1502
+3  1804 1205 562
+3  1805 1197 1514
+3  1805 1206 553
+3  1806 781 1436
+3  1806 1207 428
+3  1807 1319 1382
+3  1807 1208 488
+3  1808 851 1506
+3  1808 1209 546
+3  1809 1201 1518
+3  1809 1210 557
+3  1810 785 1440
+3  1810 1211 430
+3  1811 1328 1384
+3  1811 1212 472
+3  1812 884 1538
+3  1812 1213 586
+3  1813 1287 1522
+3  1813 1215 671
+3  1814 789 1444
+3  1814 1216 491
+3  1815 1336 1386
+3  1815 1217 445
+3  1816 910 1564
+3  1816 1218 613
+3  1817 1313 1526
+3  1817 1219 655
+3  1818 793 1448
+3  1818 1220 483
+3  1819 1343 1388
+3  1819 1221 462
+3  1820 797 1452
+3  1820 1222 499
+3  1821 1359 1530
+3  1821 1223 693
+3  1822 801 1456
+3  1822 1224 503
+3  1823 1357 1390
+3  1823 1225 454
+3  1824 1000 1654
+3  1824 1226 601
+3  1825 1295 1534
+3  1825 1227 639
+3  1826 736 1394
+3  1826 1228 475
+3  1827 1156 1392
+3  1827 1229 414
+3  1828 972 1626
+3  1828 1230 636
+3  1829 1213 1538
+3  1829 1232 585
+3  1830 704 1360
+3  1830 1233 444
+3  1831 1228 1394
+3  1831 1234 474
+3  1832 936 1590
+3  1832 1235 582
+3  1833 1326 1542
+3  1833 1236 565
+3  1834 740 1398
+3  1834 1237 434
+3  1835 1160 1396
+3  1835 1238 408
+3  1836 928 1582
+3  1836 1239 680
+3  1837 1274 1546
+3  1837 1240 593
+3  1838 706 1362
+3  1838 1241 448
+3  1839 1237 1398
+3  1839 1242 433
+3  1840 980 1634
+3  1840 1243 590
+3  1841 1278 1550
+3  1841 1244 623
+3  1842 744 1402
+3  1842 1245 467
+3  1843 1164 1400
+3  1843 1246 410
+3  1844 2290 1364
+3  1844 1247 452
+3  1845 1245 1402
+3  1845 1248 466
+3  213 214 2324
+3  2275 2286 1552
+3  2275 1249 2264
+3  1846 749 1406
+3  1846 1250 438
+3  1847 1171 1404
+3  1847 1251 412
+3  1848 944 1598
+3  1848 1252 700
+3  1849 1291 1556
+3  1849 1253 577
+3  1850 709 1366
+3  1850 1254 440
+3  1851 1250 1406
+3  1851 1255 437
+3  1852 976 1630
+3  1852 1256 632
+3  1853 1321 1560
+3  1853 1257 663
+3  1854 753 1410
+3  1854 1258 487
+3  1855 1176 1408
+3  1855 1259 421
+3  1856 956 1610
+3  1856 1260 660
+3  1857 1218 1564
+3  1857 1262 612
+3  1858 711 1368
+3  1858 1263 461
+3  1859 1258 1410
+3  1859 1264 486
+3  1860 960 1614
+3  1860 1265 609
+3  1861 1308 1568
+3  1861 1266 569
+3  1862 757 1414
+3  1862 1267 436
+3  1863 1180 1412
+3  1863 1268 416
+3  44 45 2321
+3  48 49 2315
+3  1864 2276 1572
+3  1864 1269 620
+3  1865 713 1370
+3  1865 1270 465
+3  1866 1267 1414
+3  1866 1271 435
+3  1867 986 1640
+3  1867 1272 617
+3  1868 763 1418
+3  1868 1273 450
+3  1869 1186 1417
+3  1869 2282 2281
+3  1870 892 1546
+3  1870 1274 594
+3  1871 1334 1578
+3  1871 1275 627
+3  1872 714 1372
+3  1872 1276 469
+3  1873 1273 1418
+3  1873 1277 449
+3  1874 896 1550
+3  1874 1278 624
+3  1875 1239 1582
+3  1875 1280 679
+3  1876 767 1422
+3  1876 1281 495
+3  1877 1190 1420
+3  1877 1282 419
+3  1878 968 1622
+3  1878 1283 676
+3  1879 1317 1586
+3  1879 1284 604
+3  1880 716 1374
+3  1880 1285 457
+3  1881 1281 1422
+3  1881 1286 494
+3  1882 867 1522
+3  1882 1287 672
+3  1883 1235 1590
+3  1883 1288 581
+3  1884 771 1426
+3  1884 1289 442
+3  1885 1195 1424
+3  1885 1290 431
+3  1886 902 1556
+3  1886 1291 578
+3  1887 1355 1594
+3  1887 1292 643
+3  1888 718 1376
+3  1888 1293 477
+3  1889 1289 1426
+3  1889 1294 441
+3  1890 880 1534
+3  1890 1295 640
+3  1891 1252 1598
+3  1891 1297 699
+3  1892 775 1430
+3  1892 1298 507
+3  1893 1199 1428
+3  1893 1299 423
+3  1894 990 1644
+3  1894 1300 696
+3  1895 1338 1602
+3  1895 1301 651
+3  1896 720 1378
+3  1896 1302 481
+3  1897 1298 1430
+3  1897 1303 506
+3  1898 996 1650
+3  1898 1304 648
+3  1899 1345 1606
+3  1899 1305 683
+3  1900 779 1434
+3  1900 1306 497
+3  1901 1203 1432
+3  1901 1307 425
+3  1902 914 1568
+3  1902 1308 570
+3  1903 1260 1610
+3  1903 1310 659
+3  1904 722 1380
+3  1904 1311 485
+3  1905 1306 1434
+3  1905 1312 496
+3  1906 871 1526
+3  1906 1313 656
+3  1907 1265 1614
+3  1907 1314 608
+3  1908 783 1438
+3  1908 1315 459
+3  1909 1207 1436
+3  1909 1316 427
+3  1910 932 1586
+3  1910 1317 605
+3  1911 1330 1618
+3  1911 1318 667
+3  1912 724 1382
+3  1912 1319 489
+3  1913 1315 1438
+3  1913 1320 458
+3  1914 906 1560
+3  1914 1321 664
+3  1915 1283 1622
+3  1915 1323 675
+3  1916 787 1442
+3  1916 1324 493
+3  1917 1211 1440
+3  1917 1325 429
+3  1918 888 1542
+3  1918 1326 566
+3  1919 1230 1626
+3  1919 1327 635
+3  1920 726 1384
+3  1920 1328 473
+3  1921 1324 1442
+3  1921 1329 492
+3  1922 964 1618
+3  1922 1330 668
+3  1923 1256 1630
+3  1923 1331 631
+3  1924 791 1446
+3  1924 1332 471
+3  1925 1216 1444
+3  1925 1333 490
+3  1926 924 1578
+3  1926 1334 628
+3  1927 1243 1634
+3  1927 1335 589
+3  1928 728 1386
+3  1928 1336 446
+3  1929 1332 1446
+3  1929 1337 470
+3  1930 948 1602
+3  1930 1338 652
+3  1931 1351 1638
+3  1931 1339 689
+3  1932 795 1450
+3  1932 1340 501
+3  1933 1220 1448
+3  1933 1341 482
+3  1934 1272 1640
+3  1934 1342 616
+3  1935 730 1388
+3  1935 1343 463
+3  1936 1340 1450
+3  1936 1344 500
+3  1937 952 1606
+3  1937 1345 684
+3  1938 1300 1644
+3  1938 1347 695
+3  1939 799 1454
+3  1939 1348 505
+3  1940 1222 1452
+3  1940 1349 498
+3  1941 898 1552
+3  1941 2286 574
+3  2319 2314 703
+3  1942 1348 1454
+3  1942 1350 504
+3  1943 984 1638
+3  1943 1351 690
+3  1944 1304 1650
+3  1944 1352 647
+3  1945 803 1458
+3  1945 1353 479
+3  1946 1224 1456
+3  1946 1354 502
+3  1947 940 1594
+3  1947 1355 644
+3  1948 1226 1654
+3  1948 1356 600
+3  1949 732 1390
+3  1949 1357 455
+3  1950 1353 1458
+3  1950 1358 478
+3  2267 918 1572
+3  1951 876 1530
+3  1951 1359 2316
+3  1953 885 1952
+3  1953 705 278
+3  1238 1835 1396
+3  1238 1397 278
+3  1955 893 1954
+3  1955 707 280
+3  1246 1843 1400
+3  1246 1401 280
+3  221 222 2326
+3  2327 708 282
+3  1251 1847 1404
+3  1251 1405 282
+3  1957 903 1956
+3  1957 710 276
+3  1229 1827 1392
+3  1229 1393 276
+3  1959 911 1958
+3  1959 712 286
+3  1268 1863 1412
+3  1268 1413 286
+3  1960 919 2273
+3  1960 2311 288
+3  2265 86 2313
+3  2265 1416 288
+3  2282 1869 1417
+3  123 124 2282
+3  1962 925 1961
+3  1962 715 290
+3  1282 1877 1420
+3  1282 1421 290
+3  1964 933 1963
+3  1964 717 284
+3  1259 1855 1408
+3  1259 1409 284
+3  1966 941 1965
+3  1966 719 294
+3  1299 1893 1428
+3  1299 1429 294
+3  1968 949 1967
+3  1968 721 296
+3  1307 1901 1432
+3  1307 1433 296
+3  1970 957 1969
+3  1970 723 298
+3  1316 1909 1436
+3  1316 1437 298
+3  1972 965 1971
+3  1972 725 300
+3  1325 1917 1440
+3  1325 1441 300
+3  1974 973 1973
+3  1974 727 292
+3  1290 1885 1424
+3  1290 1425 292
+3  1976 981 1975
+3  1976 729 279
+3  1242 1839 1398
+3  1242 1399 279
+3  1978 987 1977
+3  1978 731 287
+3  1271 1866 1414
+3  1271 1415 287
+3  1980 1001 1979
+3  1980 733 283
+3  1255 1851 1406
+3  1255 1407 283
+3  1982 808 1981
+3  1982 735 262
+3  1172 1773 1366
+3  1172 1367 262
+3  1984 881 1983
+3  1984 737 293
+3  1294 1889 1426
+3  1294 1427 293
+3  1986 812 1985
+3  1986 739 258
+3  1157 1759 1360
+3  1157 1361 258
+3  1988 889 1987
+3  1988 741 273
+3  1217 1815 1386
+3  1217 1387 273
+3  1990 816 1989
+3  1990 743 259
+3  1161 1763 1362
+3  1161 1363 259
+3  1992 897 1991
+3  1992 745 289
+3  1277 1873 1418
+3  1277 1419 289
+3  1994 820 1993
+3  1994 746 260
+3  1165 1767 1364
+3  1165 2291 260
+3  1996 824 1995
+3  1996 748 261
+3  1168 2328 2324
+3  1168 1365 261
+3  1998 899 1997
+3  1998 750 275
+3  1225 1823 1390
+3  1225 1391 275
+3  2000 828 1999
+3  2000 752 267
+3  1191 1791 1374
+3  1191 1375 267
+3  2002 907 2001
+3  2002 754 299
+3  1320 1913 1438
+3  1320 1439 299
+3  2004 832 2003
+3  2004 756 263
+3  1177 1777 1368
+3  1177 1369 263
+3  2006 915 2005
+3  2006 758 274
+3  1221 1819 1388
+3  1221 1389 274
+3  2008 836 2007
+3  2008 760 264
+3  1181 1781 1370
+3  1181 1371 264
+3  2010 840 2009
+3  2010 762 265
+3  2283 2263 265
+3  2011 2284 2304
+3  2011 764 281
+3  1248 1845 1402
+3  1248 1403 281
+3  2013 844 2012
+3  2013 766 266
+3  1187 1787 1372
+3  1187 1373 266
+3  2015 929 2014
+3  2015 768 303
+3  1337 1929 1446
+3  1337 1447 303
+3  2017 848 2016
+3  2017 770 272
+3  1212 1811 1384
+3  1212 1385 272
+3  2019 937 2018
+3  2019 772 277
+3  1234 1831 1394
+3  1234 1395 277
+3  2021 852 2020
+3  2021 774 268
+3  1196 1795 1376
+3  1196 1377 268
+3  2023 945 2022
+3  2023 776 309
+3  1358 1950 1458
+3  1358 1459 309
+3  2025 856 2024
+3  2025 778 269
+3  1200 1799 1378
+3  1200 1379 269
+3  2027 953 2026
+3  2027 780 304
+3  1341 1933 1448
+3  1341 1449 304
+3  2029 860 2028
+3  2029 782 270
+3  1204 1803 1380
+3  1204 1381 270
+3  2031 961 2030
+3  2031 784 285
+3  1264 1859 1410
+3  1264 1411 285
+3  2033 864 2032
+3  2033 786 271
+3  1208 1807 1382
+3  1208 1383 271
+3  2035 969 2034
+3  2035 788 302
+3  1333 1925 1444
+3  1333 1445 302
+3  2037 868 2036
+3  2037 790 301
+3  1329 1921 1442
+3  1329 1443 301
+3  2039 977 2038
+3  2039 792 291
+3  1286 1881 1422
+3  1286 1423 291
+3  2041 872 2040
+3  2041 794 297
+3  1312 1905 1434
+3  1312 1435 297
+3  2043 985 2042
+3  2043 796 306
+3  1349 1940 1452
+3  1349 1453 306
+3  2045 873 2044
+3  2045 798 305
+3  1344 1936 1450
+3  1344 1451 305
+3  2047 991 2046
+3  2047 800 308
+3  1354 1946 1456
+3  1354 1457 308
+3  2049 877 2048
+3  2049 802 307
+3  1350 1942 1454
+3  1350 1455 307
+3  2051 997 2050
+3  2051 804 295
+3  1303 1897 1430
+3  1303 1431 295
+3  2052 743 1989
+3  2052 806 313
+3  1159 1761 1466
+3  1159 1467 313
+3  2053 818 1981
+3  2053 808 318
+3  1016 1663 1476
+3  1016 1477 318
+3  2054 746 1993
+3  2054 810 315
+3  1163 1765 1470
+3  1163 1471 315
+3  2055 822 1985
+3  2055 812 310
+3  1006 1657 1460
+3  1006 1461 310
+3  2056 748 1995
+3  2056 814 317
+3  1167 1769 1474
+3  1167 1475 317
+3  2057 806 1989
+3  2057 816 312
+3  1009 1659 1464
+3  1009 1465 312
+3  2058 735 1981
+3  2058 818 319
+3  1170 1771 1478
+3  1170 1479 319
+3  2059 810 1993
+3  2059 820 314
+3  1010 2292 1468
+3  1010 1469 314
+3  2060 739 1985
+3  2060 822 311
+3  1155 1757 1462
+3  1155 1463 311
+3  2061 814 1995
+3  2061 824 316
+3  1013 1661 1472
+3  1013 1473 316
+3  2062 760 2007
+3  2062 826 323
+3  1179 1779 1486
+3  1179 1487 323
+3  2063 838 1999
+3  2063 828 328
+3  1029 1671 1496
+3  1029 1497 328
+3  2064 762 2009
+3  2064 830 325
+3  1183 1783 1490
+3  1183 1491 325
+3  2065 842 2003
+3  2065 832 320
+3  1019 1665 1480
+3  1019 1481 320
+3  2066 766 2012
+3  2066 834 327
+3  1185 1785 1494
+3  1185 1495 327
+3  2067 826 2007
+3  2067 836 322
+3  1020 1666 1484
+3  1020 1485 322
+3  2068 752 1999
+3  2068 838 329
+3  1189 1789 1498
+3  1189 1499 329
+3  2069 830 2009
+3  2069 840 324
+3  1023 1667 1488
+3  1023 1489 324
+3  2070 756 2003
+3  2070 842 321
+3  1175 1775 1482
+3  1175 1483 321
+3  2071 834 2012
+3  2071 844 326
+3  1026 1669 1492
+3  1026 1493 326
+3  2072 778 2024
+3  2072 846 333
+3  1198 1797 1506
+3  1198 1507 333
+3  2073 858 2016
+3  2073 848 338
+3  1044 1681 1516
+3  1044 1517 338
+3  2074 782 2028
+3  2074 850 335
+3  1202 1801 1510
+3  1202 1511 335
+3  2075 862 2020
+3  2075 852 330
+3  1032 1673 1500
+3  1032 1501 330
+3  2076 786 2032
+3  2076 854 337
+3  1206 1805 1514
+3  1206 1515 337
+3  2077 846 2024
+3  2077 856 332
+3  1035 1675 1504
+3  1035 1505 332
+3  2078 770 2016
+3  2078 858 339
+3  1210 1809 1518
+3  1210 1519 339
+3  2079 850 2028
+3  2079 860 334
+3  1038 1677 1508
+3  1038 1509 334
+3  2080 774 2020
+3  2080 862 331
+3  1194 1793 1502
+3  1194 1503 331
+3  2081 854 2032
+3  2081 864 336
+3  1041 1679 1512
+3  1041 1513 336
+3  2082 705 1952
+3  2082 866 351
+3  1236 1833 1542
+3  1236 1543 351
+3  2083 935 2036
+3  2083 868 392
+3  1129 1739 1624
+3  1129 1625 392
+3  2084 712 1958
+3  2084 870 364
+3  1266 1861 1568
+3  1266 1569 364
+3  2085 959 2040
+3  2085 872 384
+3  1117 1731 1608
+3  1117 1609 384
+3  2086 917 2044
+3  2086 873 2322
+3  1141 1747 2300
+3  1141 2278 2322
+3  2087 708 2326
+3  2087 875 356
+3  1249 2275 1552
+3  1249 1553 356
+3  2088 1003 2048
+3  2088 877 403
+3  1147 1751 1646
+3  1147 1647 403
+3  2089 733 1979
+3  2089 879 358
+3  1253 1849 1556
+3  1253 1557 358
+3  2090 943 1983
+3  2090 881 376
+3  1105 1723 1592
+3  1105 1593 376
+3  2091 727 1973
+3  2091 883 375
+3  1288 1883 1590
+3  1288 1591 375
+3  2092 866 1952
+3  2092 885 350
+3  1062 1693 1540
+3  1062 1541 350
+3  2093 772 2018
+3  2093 887 349
+3  1232 1829 1538
+3  1232 1539 349
+3  2094 971 1987
+3  2094 889 340
+3  1047 1683 1520
+3  1047 1521 340
+3  2095 768 2014
+3  2095 891 397
+3  1335 1927 1634
+3  1335 1635 397
+3  2096 923 1954
+3  2096 893 354
+3  1068 1697 1548
+3  1068 1549 354
+3  2097 729 1975
+3  2097 895 353
+3  1240 1837 1546
+3  1240 1547 353
+3  2098 927 1991
+3  2098 897 368
+3  1093 1715 1576
+3  1093 1577 368
+3  2306 164 165
+3  2270 764 2304
+3  2289 875 2326
+3  2099 993 1997
+3  2099 899 344
+3  1053 1687 1528
+3  1053 1529 344
+3  2100 776 2022
+3  2100 901 407
+3  1356 1948 1654
+3  1356 1655 407
+3  2101 939 1956
+3  2101 903 346
+3  1056 1689 1532
+3  1056 1533 346
+3  2102 792 2038
+3  2102 905 373
+3  1284 1879 1586
+3  1284 1587 373
+3  2103 967 2001
+3  2103 907 388
+3  1123 1735 1616
+3  1123 1617 388
+3  2104 723 1969
+3  2104 909 387
+3  1314 1907 1614
+3  1314 1615 387
+3  2105 870 1958
+3  2105 911 363
+3  1084 1709 1566
+3  1084 1567 363
+3  2106 784 2030
+3  2106 913 362
+3  1262 1857 1564
+3  1262 1565 362
+3  2107 955 2005
+3  2107 915 342
+3  1050 1685 1524
+3  1050 1525 342
+3  2108 798 2044
+3  2108 917 400
+3  1342 1934 1640
+3  1342 1641 400
+3  2109 2295 2273
+3  2109 919 367
+3  1090 1713 1574
+3  1090 1575 367
+3  2110 731 1977
+3  2110 921 366
+3  1269 1864 1572
+3  1269 1573 366
+3  2298 1699 2299
+3  2111 707 1954
+3  2111 923 355
+3  1244 1841 1550
+3  1244 1551 355
+3  2112 979 1961
+3  2112 925 370
+3  1096 1717 1580
+3  1096 1581 370
+3  2113 745 1991
+3  2113 927 369
+3  1275 1871 1578
+3  1275 1579 369
+3  2114 891 2014
+3  2114 929 396
+3  1135 1743 1632
+3  1135 1633 396
+3  2115 788 2034
+3  2115 931 395
+3  1331 1923 1630
+3  1331 1631 395
+3  2116 963 1963
+3  2116 933 359
+3  1078 1705 1558
+3  1078 1559 359
+3  2117 790 2036
+3  2117 935 393
+3  1327 1919 1626
+3  1327 1627 393
+3  2118 887 2018
+3  2118 937 348
+3  1059 1691 1536
+3  1059 1537 348
+3  2119 710 1956
+3  2119 939 347
+3  1227 1825 1534
+3  1227 1535 347
+3  2120 999 1965
+3  2120 941 378
+3  1108 1725 1596
+3  1108 1597 378
+3  2121 737 1983
+3  2121 943 377
+3  1292 1887 1594
+3  1292 1595 377
+3  2122 901 2022
+3  2122 945 406
+3  1152 1755 1652
+3  1152 1653 406
+3  2123 800 2046
+3  2123 947 405
+3  1352 1944 1650
+3  1352 1651 405
+3  2124 983 1967
+3  2124 949 382
+3  1114 1729 1604
+3  1114 1605 382
+3  2125 804 2050
+3  2125 951 381
+3  1301 1895 1602
+3  1301 1603 381
+3  2126 989 2026
+3  2126 953 398
+3  1138 1745 1636
+3  1138 1637 398
+3  2127 758 2005
+3  2127 955 343
+3  1219 1817 1526
+3  1219 1527 343
+3  2128 909 1969
+3  2128 957 386
+3  1120 1733 1612
+3  1120 1613 386
+3  2129 794 2040
+3  2129 959 385
+3  1310 1903 1610
+3  1310 1611 385
+3  2130 913 2030
+3  2130 961 361
+3  1081 1707 1562
+3  1081 1563 361
+3  2131 717 1963
+3  2131 963 360
+3  1257 1853 1560
+3  1257 1561 360
+3  2132 975 1971
+3  2132 965 390
+3  1126 1737 1620
+3  1126 1621 390
+3  2133 754 2001
+3  2133 967 389
+3  1318 1911 1618
+3  1318 1619 389
+3  2134 931 2034
+3  2134 969 394
+3  1132 1741 1628
+3  1132 1629 394
+3  2135 741 1987
+3  2135 971 341
+3  1215 1813 1522
+3  1215 1523 341
+3  2136 883 1973
+3  2136 973 374
+3  1102 1721 1588
+3  1102 1589 374
+3  2137 725 1971
+3  2137 975 391
+3  1323 1915 1622
+3  1323 1623 391
+3  2138 905 2038
+3  2138 977 372
+3  1099 1719 1584
+3  1099 1585 372
+3  2139 715 1961
+3  2139 979 371
+3  1280 1875 1582
+3  1280 1583 371
+3  2140 895 1975
+3  2140 981 352
+3  1065 1695 1544
+3  1065 1545 352
+3  2141 721 1967
+3  2141 983 383
+3  1305 1899 1606
+3  1305 1607 383
+3  2142 995 2042
+3  2142 985 401
+3  1144 1749 1642
+3  1144 1643 401
+3  2143 921 1977
+3  2143 987 365
+3  1087 1711 1570
+3  1087 1571 365
+3  2144 780 2026
+3  2144 989 399
+3  1339 1931 1638
+3  1339 1639 399
+3  2145 947 2046
+3  2145 991 404
+3  1149 1753 1648
+3  1149 1649 404
+3  2146 750 1997
+3  2146 993 345
+3  1223 1821 1530
+3  1223 1531 345
+3  2147 796 2042
+3  2147 995 402
+3  1347 1938 1644
+3  1347 1645 402
+3  2148 951 2050
+3  2148 997 380
+3  1111 1727 1600
+3  1111 1601 380
+3  2149 719 1965
+3  2149 999 379
+3  1297 1891 1598
+3  1297 1599 379
+3  2150 879 1979
+3  2150 1001 357
+3  1075 1703 1554
+3  1075 1555 357
+3  78 79 2273
+3  2151 802 2048
+3  2151 1003 2325
+3  255 256 2314
+3  2314 2 2325
+3  2152 1046 2175
+3  2152 1005 588
+3  1160 1762 1396
+3  1160 1835 588
+3  812 2055 1985
+3  812 1986 514
+3  738 1397 1396
+3  738 1762 514
+3  2153 1092 2178
+3  2153 1008 596
+3  1164 1766 1400
+3  1164 1843 596
+3  816 2057 1989
+3  816 1990 518
+3  742 1401 1400
+3  742 1766 518
+3  820 2059 1993
+3  820 1994 2301
+3  186 187 2310
+3  2310 190 2301
+3  2154 1052 2168
+3  2154 1012 599
+3  1171 1772 1404
+3  1171 1847 599
+3  824 2061 1995
+3  824 1996 524
+3  747 1405 1404
+3  747 1772 524
+3  2155 1104 2171
+3  2155 1015 580
+3  1156 1758 1392
+3  1156 1827 580
+3  808 2053 1981
+3  808 1982 510
+3  734 1393 1392
+3  734 1758 510
+3  2156 1049 2189
+3  2156 1018 615
+3  1180 1780 1412
+3  1180 1863 615
+3  832 2065 2003
+3  832 2004 532
+3  755 1413 1412
+3  755 1780 532
+3  2313 90 2312
+3  836 2067 2007
+3  836 2008 536
+3  759 1416 2313
+3  759 2312 536
+3  2157 1070 2192
+3  2157 1022 622
+3  1186 1786 1417
+3  1186 1869 622
+3  840 2069 2009
+3  840 2010 539
+3  761 2280 1417
+3  761 1786 539
+3  2158 1134 2182
+3  2158 1025 630
+3  1190 1790 1420
+3  1190 1877 630
+3  844 2071 2012
+3  844 2013 543
+3  765 1421 1420
+3  765 1790 543
+3  2159 1122 2185
+3  2159 1028 607
+3  1176 1776 1408
+3  1176 1855 607
+3  828 2063 1999
+3  828 2000 528
+3  751 1409 1408
+3  751 1776 528
+3  2160 1151 2201
+3  2160 1031 646
+3  1199 1798 1428
+3  1199 1893 646
+3  852 2075 2020
+3  852 2021 551
+3  773 1429 1428
+3  773 1798 551
+3  2161 1137 2204
+3  2161 1034 654
+3  1203 1802 1432
+3  1203 1901 654
+3  856 2077 2024
+3  856 2025 555
+3  777 1433 1432
+3  777 1802 555
+3  2162 1080 2207
+3  2162 1037 662
+3  1207 1806 1436
+3  1207 1909 662
+3  860 2079 2028
+3  860 2029 559
+3  781 1437 1436
+3  781 1806 559
+3  2163 1131 2195
+3  2163 1040 670
+3  1211 1810 1440
+3  1211 1917 670
+3  864 2081 2032
+3  864 2033 563
+3  785 1441 1440
+3  785 1810 563
+3  2164 1058 2198
+3  2164 1043 638
+3  1195 1794 1424
+3  1195 1885 638
+3  848 2073 2016
+3  848 2017 547
+3  769 1425 1424
+3  769 1794 547
+3  2165 1067 2175
+3  2165 1046 592
+3  1237 1834 1398
+3  1237 1839 592
+3  889 2094 1987
+3  889 1988 587
+3  740 1399 1398
+3  740 1834 587
+3  2166 1089 2189
+3  2166 1049 619
+3  1267 1862 1414
+3  1267 1866 619
+3  915 2107 2005
+3  915 2006 614
+3  757 1415 1414
+3  757 1862 614
+3  2167 1055 2168
+3  2167 1052 603
+3  1250 1846 1406
+3  1250 1851 603
+3  899 2099 1997
+3  899 1998 598
+3  749 1407 1406
+3  749 1846 598
+3  2169 1012 2168
+3  2169 1055 525
+3  1254 1850 1366
+3  1254 1773 525
+3  903 2101 1956
+3  903 1957 602
+3  709 1367 1366
+3  709 1850 602
+3  2170 1107 2198
+3  2170 1058 642
+3  1289 1884 1426
+3  1289 1889 642
+3  937 2118 2018
+3  937 2019 637
+3  771 1427 1426
+3  771 1884 637
+3  2172 1015 2171
+3  2172 1061 511
+3  1233 1830 1360
+3  1233 1759 511
+3  885 2092 1952
+3  885 1953 583
+3  704 1361 1360
+3  704 1830 583
+3  2174 1128 2173
+3  2174 1064 568
+3  1336 1928 1386
+3  1336 1815 568
+3  981 2140 1975
+3  981 1976 681
+3  728 1387 1386
+3  728 1928 681
+3  2176 1005 2175
+3  2176 1067 515
+3  1241 1838 1362
+3  1241 1763 515
+3  893 2096 1954
+3  893 1955 591
+3  706 1363 1362
+3  706 1838 591
+3  2177 1095 2192
+3  2177 1070 626
+3  1273 1868 1418
+3  1273 1873 626
+3  148 149 2304
+3  2284 2011 621
+3  763 1419 1418
+3  763 1868 621
+3  2179 1008 2178
+3  2179 1072 519
+3  1247 1844 1364
+3  1247 1767 519
+3  2290 2291 1364
+3  2290 1844 2268
+3  208 209 2328
+3  223 224 2326
+3  2293 1365 2324
+3  2181 1146 2180
+3  2181 1074 576
+3  1357 1949 1390
+3  1357 1823 576
+3  1001 2150 1979
+3  1001 1980 701
+3  732 1391 1390
+3  732 1949 701
+3  2183 1025 2182
+3  2183 1077 544
+3  1285 1880 1374
+3  1285 1791 544
+3  933 2116 1963
+3  933 1964 633
+3  716 1375 1374
+3  716 1880 633
+3  2184 1125 2207
+3  2184 1080 666
+3  1315 1908 1438
+3  1315 1913 666
+3  961 2130 2030
+3  961 2031 661
+3  783 1439 1438
+3  783 1908 661
+3  2186 1028 2185
+3  2186 1083 529
+3  1263 1858 1368
+3  1263 1777 529
+3  911 2105 1958
+3  911 1959 610
+3  711 1369 1368
+3  711 1858 610
+3  2188 1116 2187
+3  2188 1086 572
+3  1343 1935 1388
+3  1343 1819 572
+3  987 2143 1977
+3  987 1978 687
+3  730 1389 1388
+3  730 1935 687
+3  2190 1018 2189
+3  2190 1089 533
+3  1270 1865 1370
+3  1270 1781 533
+3  919 2109 2273
+3  919 1960 618
+3  713 1371 1370
+3  713 1865 618
+3  2191 1072 2178
+3  2191 1092 597
+3  1245 1842 1402
+3  1245 1845 597
+3  897 2098 1991
+3  897 1992 595
+3  744 1403 1402
+3  744 1842 595
+3  2193 1022 2192
+3  2193 1095 540
+3  1276 1872 1372
+3  1276 1787 540
+3  925 2112 1961
+3  925 1962 625
+3  714 1373 1372
+3  714 1872 625
+3  2194 1064 2173
+3  2194 1098 682
+3  1332 1924 1446
+3  1332 1929 682
+3  977 2138 2038
+3  977 2039 677
+3  791 1447 1446
+3  791 1924 677
+3  2196 1040 2195
+3  2196 1101 564
+3  1328 1920 1384
+3  1328 1811 564
+3  973 2136 1973
+3  973 1974 673
+3  726 1385 1384
+3  726 1920 673
+3  2197 1061 2171
+3  2197 1104 584
+3  1228 1826 1394
+3  1228 1831 584
+3  881 2090 1983
+3  881 1984 579
+3  736 1395 1394
+3  736 1826 579
+3  2199 1043 2198
+3  2199 1107 548
+3  1293 1888 1376
+3  1293 1795 548
+3  941 2120 1965
+3  941 1966 641
+3  718 1377 1376
+3  718 1888 641
+3  2200 1074 2180
+3  2200 1110 702
+3  1353 1945 1458
+3  1353 1950 702
+3  997 2148 2050
+3  997 2051 697
+3  803 1459 1458
+3  803 1945 697
+3  2202 1031 2201
+3  2202 1113 552
+3  1302 1896 1378
+3  1302 1799 552
+3  949 2124 1967
+3  949 1968 649
+3  720 1379 1378
+3  720 1896 649
+3  2203 1143 2187
+3  2203 1116 686
+3  1220 1818 1448
+3  1220 1933 686
+3  872 2085 2040
+3  872 2041 571
+3  793 1449 1448
+3  793 1818 571
+3  2205 1034 2204
+3  2205 1119 556
+3  1311 1904 1380
+3  1311 1803 556
+3  957 2128 1969
+3  957 1970 657
+3  722 1381 1380
+3  722 1904 657
+3  2206 1083 2185
+3  2206 1122 611
+3  1258 1854 1410
+3  1258 1859 611
+3  907 2103 2001
+3  907 2002 606
+3  753 1411 1410
+3  753 1854 606
+3  2208 1037 2207
+3  2208 1125 560
+3  1319 1912 1382
+3  1319 1807 560
+3  965 2132 1971
+3  965 1972 665
+3  724 1383 1382
+3  724 1912 665
+3  2209 1098 2173
+3  2209 1128 678
+3  1216 1814 1444
+3  1216 1925 678
+3  868 2083 2036
+3  868 2037 567
+3  789 1445 1444
+3  789 1814 567
+3  2210 1101 2195
+3  2210 1131 674
+3  1324 1916 1442
+3  1324 1921 674
+3  969 2134 2034
+3  969 2035 669
+3  787 1443 1442
+3  787 1916 669
+3  2211 1077 2182
+3  2211 1134 634
+3  1281 1876 1422
+3  1281 1881 634
+3  929 2114 2014
+3  929 2015 629
+3  767 1423 1422
+3  767 1876 629
+3  2212 1119 2204
+3  2212 1137 658
+3  1306 1900 1434
+3  1306 1905 658
+3  953 2126 2026
+3  953 2027 653
+3  779 1435 1434
+3  779 1900 653
+3  2213 1148 2218
+3  2213 1140 692
+3  1222 1820 1452
+3  1222 1940 692
+3  873 2086 2044
+3  873 2045 573
+3  797 1453 1452
+3  797 1820 573
+3  2214 1086 2187
+3  2214 1143 688
+3  1340 1932 1450
+3  1340 1936 688
+3  985 2142 2042
+3  985 2043 685
+3  795 1451 1450
+3  795 1932 685
+3  2215 1110 2180
+3  2215 1146 698
+3  1224 1822 1456
+3  1224 1946 698
+3  877 2088 2048
+3  877 2049 575
+3  801 1457 1456
+3  801 1822 575
+3  2216 2303 2218
+3  2216 1148 694
+3  1348 1939 1454
+3  1348 1942 694
+3  991 2145 2046
+3  991 2047 691
+3  799 1455 1454
+3  799 1939 691
+3  2217 1113 2201
+3  2217 1151 650
+3  1298 1892 1430
+3  1298 1897 650
+3  945 2122 2022
+3  945 2023 645
+3  775 1431 1430
+3  775 1892 645
+3  2219 1140 2218
+3  2219 2303 2302
+3  2221 2222 2220
+3  2221 1154 513
+3  1169 1770 1466
+3  1169 1761 513
+3  822 2060 1985
+3  822 2055 522
+3  811 1467 1466
+3  811 1770 522
+3  1015 2155 2171
+3  1015 2172 415
+3  1060 1692 1476
+3  1060 1663 415
+3  739 1986 1985
+3  739 2060 443
+3  821 1477 1476
+3  821 1692 443
+3  2222 2223 2220
+3  2222 2221 517
+3  1153 1756 1470
+3  1153 1765 517
+3  806 2052 1989
+3  806 2057 508
+3  815 1471 1470
+3  815 1756 508
+3  1005 2152 2175
+3  1005 2176 409
+3  1066 1696 1460
+3  1066 1657 409
+3  743 1990 1989
+3  743 2052 447
+3  805 1461 1460
+3  805 1696 447
+3  2223 2224 2220
+3  2223 2222 521
+3  1158 1760 1474
+3  1158 1769 521
+3  810 2054 1993
+3  810 2059 512
+3  819 1475 1474
+3  819 1760 512
+3  1008 2153 2178
+3  1008 2179 411
+3  1071 1700 1464
+3  1071 1659 411
+3  746 1994 1993
+3  746 2054 451
+3  809 1465 1464
+3  809 1700 451
+3  2224 1154 2220
+3  2224 2223 523
+3  1162 1764 1478
+3  1162 1771 523
+3  814 2056 1995
+3  814 2061 516
+3  823 1479 1478
+3  823 1764 516
+3  2277 1701 1468
+3  197 198 2277
+3  748 1996 1995
+3  748 2056 453
+3  813 1469 1468
+3  813 1701 453
+3  1154 2221 2220
+3  1154 2224 509
+3  1166 1768 1462
+3  1166 1757 509
+3  818 2058 1981
+3  818 2053 520
+3  807 1463 1462
+3  807 1768 520
+3  1012 2154 2168
+3  1012 2169 413
+3  1054 1688 1472
+3  1054 1661 413
+3  735 1982 1981
+3  735 2058 439
+3  817 1473 1472
+3  817 1688 439
+3  2226 2227 2225
+3  2226 1174 531
+3  1188 1788 1486
+3  1188 1779 531
+3  842 2070 2003
+3  842 2065 541
+3  831 1487 1486
+3  831 1788 541
+3  1028 2159 2185
+3  1028 2186 422
+3  1082 1708 1496
+3  1082 1671 422
+3  756 2004 2003
+3  756 2070 460
+3  841 1497 1496
+3  841 1708 460
+3  2227 2228 2225
+3  2227 2226 535
+3  1173 1774 1490
+3  1173 1783 535
+3  826 2062 2007
+3  826 2067 526
+3  835 1491 1490
+3  835 1774 526
+3  1018 2156 2189
+3  1018 2190 417
+3  1088 1712 1480
+3  1088 1665 417
+3  760 2008 2007
+3  760 2062 464
+3  825 1481 1480
+3  825 1712 464
+3  2228 2229 2225
+3  2228 2227 538
+3  1178 1778 1494
+3  1178 1785 538
+3  830 2064 2009
+3  830 2069 530
+3  839 1495 1494
+3  839 1778 530
+3  2272 2271 1484
+3  2272 1666 2269
+3  762 2010 2009
+3  762 2064 2320
+3  829 1485 1484
+3  829 2271 2320
+3  2229 1174 2225
+3  2229 2228 542
+3  1182 1782 1498
+3  1182 1789 542
+3  834 2066 2012
+3  834 2071 534
+3  843 1499 1498
+3  843 1782 534
+3  1022 2157 2192
+3  1022 2193 418
+3  1094 1716 1488
+3  1094 1667 418
+3  766 2013 2012
+3  766 2066 468
+3  833 1489 1488
+3  833 1716 468
+3  1174 2226 2225
+3  1174 2229 527
+3  1184 1784 1482
+3  1184 1775 527
+3  838 2068 1999
+3  838 2063 537
+3  827 1483 1482
+3  827 1784 537
+3  1025 2158 2182
+3  1025 2183 420
+3  1076 1704 1492
+3  1076 1669 420
+3  752 2000 1999
+3  752 2068 456
+3  837 1493 1492
+3  837 1704 456
+3  2231 2232 2230
+3  2231 1193 550
+3  1209 1808 1506
+3  1209 1797 550
+3  862 2080 2020
+3  862 2075 561
+3  851 1507 1506
+3  851 1808 561
+3  1043 2164 2198
+3  1043 2199 432
+3  1106 1724 1516
+3  1106 1681 432
+3  774 2021 2020
+3  774 2080 476
+3  861 1517 1516
+3  861 1724 476
+3  2232 2233 2230
+3  2232 2231 554
+3  1192 1792 1510
+3  1192 1801 554
+3  846 2072 2024
+3  846 2077 545
+3  855 1511 1510
+3  855 1792 545
+3  1031 2160 2201
+3  1031 2202 424
+3  1112 1728 1500
+3  1112 1673 424
+3  778 2025 2024
+3  778 2072 480
+3  845 1501 1500
+3  845 1728 480
+3  2233 2234 2230
+3  2233 2232 558
+3  1197 1796 1514
+3  1197 1805 558
+3  850 2074 2028
+3  850 2079 549
+3  859 1515 1514
+3  859 1796 549
+3  1034 2161 2204
+3  1034 2205 426
+3  1118 1732 1504
+3  1118 1675 426
+3  782 2029 2028
+3  782 2074 484
+3  849 1505 1504
+3  849 1732 484
+3  2234 1193 2230
+3  2234 2233 562
+3  1201 1800 1518
+3  1201 1809 562
+3  854 2076 2032
+3  854 2081 553
+3  863 1519 1518
+3  863 1800 553
+3  1037 2162 2207
+3  1037 2208 428
+3  1124 1736 1508
+3  1124 1677 428
+3  786 2033 2032
+3  786 2076 488
+3  853 1509 1508
+3  853 1736 488
+3  1193 2231 2230
+3  1193 2234 546
+3  1205 1804 1502
+3  1205 1793 546
+3  858 2078 2016
+3  858 2073 557
+3  847 1503 1502
+3  847 1804 557
+3  1040 2163 2195
+3  1040 2196 430
+3  1100 1720 1512
+3  1100 1679 430
+3  770 2017 2016
+3  770 2078 472
+3  857 1513 1512
+3  857 1720 472
+3  2236 1231 2235
+3  2236 1214 586
+3  1326 1918 1542
+3  1326 1833 586
+3  971 2135 1987
+3  971 2094 671
+3  888 1543 1542
+3  888 1918 671
+3  1128 2209 2173
+3  1128 2174 491
+3  1063 1694 1624
+3  1063 1739 491
+3  741 1988 1987
+3  741 2135 445
+3  970 1625 1624
+3  970 1694 445
+3  2237 1261 2255
+3  2237 2256 613
+3  1308 1902 1568
+3  1308 1861 613
+3  955 2127 2005
+3  955 2107 655
+3  914 1569 1568
+3  914 1902 655
+3  1116 2203 2187
+3  1116 2188 483
+3  1085 1710 1608
+3  1085 1731 483
+3  758 2006 2005
+3  758 2127 462
+3  954 1609 1608
+3  954 1710 462
+3  1140 2213 2218
+3  1140 2219 499
+3  29 30 2323
+3  2323 1747 499
+3  33 34 2300
+3  2286 1941 1552
+3  2275 235 2286
+3  993 2146 1997
+3  993 2099 693
+3  898 1553 1552
+3  898 1941 693
+3  1146 2215 2180
+3  1146 2181 503
+3  1073 1702 1646
+3  1073 1751 503
+3  750 1998 1997
+3  750 2146 454
+3  992 1647 1646
+3  992 1702 454
+3  2238 2242 2251
+3  2238 2250 601
+3  1291 1886 1556
+3  1291 1849 601
+3  939 2119 1956
+3  939 2101 639
+3  902 1557 1556
+3  902 1886 639
+3  1104 2197 2171
+3  1104 2155 475
+3  1014 1662 1592
+3  1014 1723 475
+3  710 1957 1956
+3  710 2119 414
+3  938 1593 1592
+3  938 1662 414
+3  2239 2249 2235
+3  2239 1231 636
+3  1235 1832 1590
+3  1235 1883 636
+3  887 2093 2018
+3  887 2118 585
+3  936 1591 1590
+3  936 1832 585
+3  1061 2172 2171
+3  1061 2197 444
+3  1103 1722 1540
+3  1103 1693 444
+3  772 2019 2018
+3  772 2093 474
+3  886 1541 1540
+3  886 1722 474
+3  1231 2239 2235
+3  1231 2236 582
+3  1213 1812 1538
+3  1213 1829 582
+3  866 2082 1952
+3  866 2092 565
+3  884 1539 1538
+3  884 1812 565
+3  1046 2165 2175
+3  1046 2152 434
+3  1004 1656 1520
+3  1004 1683 434
+3  705 1953 1952
+3  705 2082 408
+3  865 1521 1520
+3  865 1656 408
+3  2240 1279 2246
+3  2240 2241 680
+3  1243 1840 1634
+3  1243 1927 680
+3  895 2097 1975
+3  895 2140 593
+3  980 1635 1634
+3  980 1840 593
+3  1067 2176 2175
+3  1067 2165 448
+3  1045 1682 1548
+3  1045 1697 448
+3  729 1976 1975
+3  729 2097 433
+3  894 1549 1548
+3  894 1682 433
+3  2241 2240 2246
+3  2241 2245 590
+3  1274 1870 1546
+3  1274 1837 590
+3  923 2111 1954
+3  923 2096 623
+3  892 1547 1546
+3  892 1870 623
+3  1092 2191 2178
+3  1092 2153 467
+3  1007 1658 1576
+3  1007 1715 467
+3  707 1955 1954
+3  707 2111 410
+3  922 1577 1576
+3  922 1658 410
+3  152 153 2270
+3  1072 2179 2178
+3  1072 2191 452
+3  1091 1714 2306
+3  1091 2307 452
+3  764 2011 2304
+3  764 2270 466
+3  161 162 2306
+3  2305 1714 466
+3  875 2087 2326
+3  875 2289 2264
+3  1052 2167 2168
+3  1052 2154 438
+3  1011 1660 1528
+3  1011 1687 438
+3  708 2327 2326
+3  708 2087 412
+3  874 1529 1528
+3  874 1660 412
+3  2242 1296 2251
+3  2242 2238 700
+3  1226 1824 1654
+3  1226 1948 700
+3  879 2089 1979
+3  879 2150 577
+3  1000 1655 1654
+3  1000 1824 577
+3  1055 2169 2168
+3  1055 2167 440
+3  1051 1686 1532
+3  1051 1689 440
+3  733 1980 1979
+3  733 2089 437
+3  878 1533 1532
+3  878 1686 437
+3  2243 2248 2258
+3  2243 2257 632
+3  1317 1910 1586
+3  1317 1879 632
+3  963 2131 1963
+3  963 2116 663
+3  932 1587 1586
+3  932 1910 663
+3  1122 2206 2185
+3  1122 2159 487
+3  1027 1670 1616
+3  1027 1735 487
+3  717 1964 1963
+3  717 2131 421
+3  962 1617 1616
+3  962 1670 421
+3  2244 1309 2255
+3  2244 1261 660
+3  1265 1860 1614
+3  1265 1907 660
+3  913 2106 2030
+3  913 2130 612
+3  960 1615 1614
+3  960 1860 612
+3  1083 2186 2185
+3  1083 2206 461
+3  1121 1734 1566
+3  1121 1709 461
+3  784 2031 2030
+3  784 2106 486
+3  912 1567 1566
+3  912 1734 486
+3  1261 2244 2255
+3  1261 2237 609
+3  1218 1816 1564
+3  1218 1857 609
+3  870 2084 1958
+3  870 2105 569
+3  910 1565 1564
+3  910 1816 569
+3  1049 2166 2189
+3  1049 2156 436
+3  1017 1664 1524
+3  1017 1685 436
+3  712 1959 1958
+3  712 2084 416
+3  869 1525 1524
+3  869 1664 416
+3  51 52 2296
+3  1272 1867 1640
+3  1272 1934 2296
+3  921 2110 1977
+3  921 2143 620
+3  986 1641 1640
+3  986 1867 620
+3  1089 2190 2189
+3  1089 2166 465
+3  1048 1684 1574
+3  1048 1713 465
+3  731 1978 1977
+3  731 2110 435
+3  920 1575 1574
+3  920 1684 435
+3  2317 2274 617
+3  2276 2267 1572
+3  2276 1864 617
+3  2295 76 2273
+3  2295 2109 2266
+3  918 1573 1572
+3  918 2267 2266
+3  2311 1960 2273
+3  1070 2177 2192
+3  1070 2157 450
+3  1021 2297 2299
+3  1021 1699 450
+3  2281 130 131
+3  2245 2241 2246
+3  2245 2247 594
+3  1278 1874 1550
+3  1278 1841 594
+3  927 2113 1991
+3  927 2098 627
+3  896 1551 1550
+3  896 1874 627
+3  1095 2193 2192
+3  1095 2177 469
+3  1069 1698 1580
+3  1069 1717 469
+3  745 1992 1991
+3  745 2113 449
+3  926 1581 1580
+3  926 1698 449
+3  2247 2245 2246
+3  2247 1279 624
+3  1334 1926 1578
+3  1334 1871 624
+3  979 2139 1961
+3  979 2112 679
+3  924 1579 1578
+3  924 1926 679
+3  1134 2211 2182
+3  1134 2158 495
+3  1024 1668 1632
+3  1024 1743 495
+3  715 1962 1961
+3  715 2139 419
+3  978 1633 1632
+3  978 1668 419
+3  2248 1322 2258
+3  2248 2243 676
+3  1256 1852 1630
+3  1256 1923 676
+3  905 2102 2038
+3  905 2138 604
+3  976 1631 1630
+3  976 1852 604
+3  1077 2183 2182
+3  1077 2211 457
+3  1133 1742 1558
+3  1133 1705 457
+3  792 2039 2038
+3  792 2102 494
+3  904 1559 1558
+3  904 1742 494
+3  2249 1214 2235
+3  2249 2239 672
+3  1230 1828 1626
+3  1230 1919 672
+3  883 2091 1973
+3  883 2136 581
+3  972 1627 1626
+3  972 1828 581
+3  1058 2170 2198
+3  1058 2164 442
+3  1042 1680 1536
+3  1042 1691 442
+3  727 1974 1973
+3  727 2091 431
+3  882 1537 1536
+3  882 1680 431
+3  2250 2238 2251
+3  2250 2252 578
+3  1295 1890 1534
+3  1295 1825 578
+3  943 2121 1983
+3  943 2090 643
+3  880 1535 1534
+3  880 1890 643
+3  1107 2199 2198
+3  1107 2170 477
+3  1057 1690 1596
+3  1057 1725 477
+3  737 1984 1983
+3  737 2121 441
+3  942 1597 1596
+3  942 1690 441
+3  2252 2250 2251
+3  2252 1296 640
+3  1355 1947 1594
+3  1355 1887 640
+3  999 2149 1965
+3  999 2120 699
+3  940 1595 1594
+3  940 1947 699
+3  1151 2217 2201
+3  1151 2160 507
+3  1030 1672 1652
+3  1030 1755 507
+3  719 1966 1965
+3  719 2149 423
+3  998 1653 1652
+3  998 1672 423
+3  2253 1346 2261
+3  2253 2254 696
+3  1304 1898 1650
+3  1304 1944 696
+3  951 2125 2050
+3  951 2148 651
+3  996 1651 1650
+3  996 1898 651
+3  1113 2202 2201
+3  1113 2217 481
+3  1150 1754 1604
+3  1150 1729 481
+3  804 2051 2050
+3  804 2125 506
+3  950 1605 1604
+3  950 1754 506
+3  2254 2253 2261
+3  2254 2260 648
+3  1338 1930 1602
+3  1338 1895 648
+3  983 2141 1967
+3  983 2124 683
+3  948 1603 1602
+3  948 1930 683
+3  1137 2212 2204
+3  1137 2161 497
+3  1033 1674 1636
+3  1033 1745 497
+3  721 1968 1967
+3  721 2141 425
+3  982 1637 1636
+3  982 1674 425
+3  2256 2237 2255
+3  2256 1309 570
+3  1313 1906 1526
+3  1313 1817 570
+3  959 2129 2040
+3  959 2085 659
+3  871 1527 1526
+3  871 1906 659
+3  1119 2205 2204
+3  1119 2212 485
+3  1136 1744 1612
+3  1136 1733 485
+3  794 2041 2040
+3  794 2129 496
+3  958 1613 1612
+3  958 1744 496
+3  1309 2256 2255
+3  1309 2244 656
+3  1260 1856 1610
+3  1260 1903 656
+3  909 2104 1969
+3  909 2128 608
+3  956 1611 1610
+3  956 1856 608
+3  1080 2184 2207
+3  1080 2162 459
+3  1036 1676 1562
+3  1036 1707 459
+3  723 1970 1969
+3  723 2104 427
+3  908 1563 1562
+3  908 1676 427
+3  2257 2243 2258
+3  2257 2259 605
+3  1321 1914 1560
+3  1321 1853 605
+3  967 2133 2001
+3  967 2103 667
+3  906 1561 1560
+3  906 1914 667
+3  1125 2208 2207
+3  1125 2184 489
+3  1079 1706 1620
+3  1079 1737 489
+3  754 2002 2001
+3  754 2133 458
+3  966 1621 1620
+3  966 1706 458
+3  2259 2257 2258
+3  2259 1322 664
+3  1330 1922 1618
+3  1330 1911 664
+3  975 2137 1971
+3  975 2132 675
+3  964 1619 1618
+3  964 1922 675
+3  1131 2210 2195
+3  1131 2163 493
+3  1039 1678 1628
+3  1039 1741 493
+3  725 1972 1971
+3  725 2137 429
+3  974 1629 1628
+3  974 1678 429
+3  1214 2236 2235
+3  1214 2249 566
+3  1287 1882 1522
+3  1287 1813 566
+3  935 2117 2036
+3  935 2083 635
+3  867 1523 1522
+3  867 1882 635
+3  1101 2196 2195
+3  1101 2210 473
+3  1130 1740 1588
+3  1130 1721 473
+3  790 2037 2036
+3  790 2117 492
+3  934 1589 1588
+3  934 1740 492
+3  1322 2259 2258
+3  1322 2248 668
+3  1283 1878 1622
+3  1283 1915 668
+3  931 2115 2034
+3  931 2134 631
+3  968 1623 1622
+3  968 1878 631
+3  1098 2194 2173
+3  1098 2209 471
+3  1127 1738 1584
+3  1127 1719 471
+3  788 2035 2034
+3  788 2115 490
+3  930 1585 1584
+3  930 1738 490
+3  1279 2247 2246
+3  1279 2240 628
+3  1239 1836 1582
+3  1239 1875 628
+3  891 2095 2014
+3  891 2114 589
+3  928 1583 1582
+3  928 1836 589
+3  1064 2174 2173
+3  1064 2194 446
+3  1097 1718 1544
+3  1097 1695 446
+3  768 2015 2014
+3  768 2095 470
+3  890 1545 1544
+3  890 1718 470
+3  2260 2254 2261
+3  2260 2262 652
+3  1345 1937 1606
+3  1345 1899 652
+3  989 2144 2026
+3  989 2126 689
+3  952 1607 1606
+3  952 1937 689
+3  1143 2214 2187
+3  1143 2203 501
+3  1115 1730 1642
+3  1115 1749 501
+3  780 2027 2026
+3  780 2144 482
+3  988 1643 1642
+3  988 1730 482
+3  917 2108 2044
+3  917 2086 616
+3  2321 2315 616
+3  1086 2188 2187
+3  1086 2214 463
+3  1142 1748 1570
+3  1142 1711 463
+3  798 2045 2044
+3  798 2108 500
+3  916 1571 1570
+3  916 1748 500
+3  2262 2260 2261
+3  2262 1346 684
+3  1351 1943 1638
+3  1351 1931 684
+3  995 2147 2042
+3  995 2142 695
+3  984 1639 1638
+3  984 1943 695
+3  1148 2216 2218
+3  1148 2213 505
+3  1139 1746 1648
+3  1139 1753 505
+3  796 2043 2042
+3  796 2147 498
+3  994 1649 1648
+3  994 1746 498
+3  2287 2288 574
+3  1359 1951 1530
+3  1359 1821 574
+3  1003 2151 2048
+3  1003 2088 703
+3  876 1531 1530
+3  876 1951 703
+3  2303 2219 2218
+3  2303 2216 2279
+3  2318 1752 2285
+3  14 15 2318
+3  802 2049 2048
+3  802 2151 504
+3  1002 2308 2285
+3  1002 1752 504
+3  1346 2262 2261
+3  1346 2253 690
+3  1300 1894 1644
+3  1300 1938 690
+3  947 2123 2046
+3  947 2145 647
+3  990 1645 1644
+3  990 1894 647
+3  1110 2200 2180
+3  1110 2215 479
+3  1145 1750 1600
+3  1145 1727 479
+3  800 2047 2046
+3  800 2123 502
+3  946 1601 1600
+3  946 1750 502
+3  1296 2252 2251
+3  1296 2242 644
+3  1252 1848 1598
+3  1252 1891 644
+3  901 2100 2022
+3  901 2122 600
+3  944 1599 1598
+3  944 1848 600
+3  1074 2181 2180
+3  1074 2200 455
+3  1109 1726 1554
+3  1109 1703 455
+3  776 2023 2022
+3  776 2100 478
+3  900 1555 1554
+3  900 1726 478
+3  56 57 2317
+3  243 244 2288
+3  248 249 2316
+3  2316 251 2319
+3  229 2289 228
+3  2289 229 2264
+3  2313 89 90
+3  2313 88 89
+3  2313 87 88
+3  2283 115 2263
+3  2283 113 114
+3  2263 115 116
+3  2283 114 115
+3  13 14 2318
+3  12 13 2318
+3  2298 144 2284
+3  2284 144 145
+3  2298 143 144
+3  2298 142 143
+3  257 2314 256
+3  0 2314 1
+3  2 2314 0
+3  1 2314 257
+3  133 134 2297
+3  2281 131 2297
+3  132 133 2297
+3  131 132 2297
+3  105 2271 104
+3  107 2271 106
+3  106 2271 105
+3  152 2304 151
+3  2304 152 2270
+3  2279 18 19
+3  2279 17 18
+3  2312 94 2269
+3  2312 91 92
+3  2312 93 94
+3  2312 92 93
+3  80 2311 79
+3  82 2311 81
+3  81 2311 80
+3  2284 146 147
+3  2284 145 146
+3  35 2278 34
+3  36 2278 35
+3  120 121 2280
+3  2263 119 2280
+3  2280 119 120
+3  2263 118 119
+3  69 2266 68
+3  70 2266 69
+3  2264 231 232
+3  2264 230 231
+3  156 2270 155
+3  2270 156 2305
+3  156 157 2305
+3  84 2265 83
+3  85 2265 84
+3  86 2265 85
+3  2319 252 253
+3  2319 254 255
+3  2319 253 254
+3  202 2277 201
+3  200 201 2277
+3  2277 202 2294
+3  2266 71 2295
+3  2295 71 72
+3  2266 70 71
+3  2276 65 2267
+3  2276 64 65
+3  2276 63 64
+3  169 2307 168
+3  166 167 2307
+3  167 168 2307
+3  2307 169 2268
+3  98 2269 97
+3  2269 98 2272
+3  99 2272 98
+3  2267 68 2266
+3  2267 67 68
+3  2267 66 67
+3  188 2310 187
+3  190 2310 189
+3  189 2310 188
+3  2285 2308 8
+3  8 9 2285
+3  173 2268 172
+3  2268 173 2290
+3  173 174 2290
+3  77 78 2273
+3  76 77 2273
+3  46 2315 45
+3  48 2315 47
+3  47 2315 46
+3  2275 234 235
+3  95 2269 94
+3  96 2269 95
+3  154 2270 153
+3  155 2270 154
+3  103 2272 102
+3  2272 103 2271
+3  101 2272 100
+3  102 2272 101
+3  2300 2323 30
+3  28 29 2323
+3  2311 2273 79
+3  250 2316 249
+3  251 2316 250
+3  58 2274 57
+3  59 2274 58
+3  233 234 2275
+3  232 233 2275
+3  163 2306 162
+3  164 2306 163
+3  199 2277 198
+3  200 2277 199
+3  62 63 2276
+3  61 62 2276
+3  60 61 2276
+3  2277 2292 197
+3  196 197 2292
+3  24 2302 23
+3  25 2302 24
+3  2320 2271 107
+3  107 108 2320
+3  2278 37 38
+3  2278 36 37
+3  236 237 2286
+3  235 236 2286
+3  16 2279 15
+3  17 2279 16
+3  2308 2325 4
+3  2282 2280 123
+3  121 122 2280
+3  122 123 2280
+3  2281 127 128
+3  2282 125 126
+3  2282 127 2281
+3  2282 126 127
+3  2283 110 111
+3  2283 112 113
+3  2283 111 112
+3  2298 141 142
+3  2298 140 141
+3  41 2321 40
+3  42 2321 41
+3  44 2321 43
+3  43 2321 42
+3  2302 2303 23
+3  21 22 2303
+3  2309 2291 181
+3  180 181 2291
+3  179 180 2291
+3  2278 2300 34
+3  32 33 2300
+3  137 2299 136
+3  138 2299 137
+3  2304 2284 148
+3  147 148 2284
+3  11 2285 10
+3  12 2285 11
+3  2292 2301 193
+3  191 192 2301
+3  2308 7 8
+3  2308 6 7
+3  2286 240 2287
+3  2286 239 240
+3  2286 238 239
+3  2286 237 238
+3  242 2287 241
+3  243 2287 242
+3  2288 2287 243
+3  2288 244 245
+3  2288 247 248
+3  2288 246 247
+3  2288 245 246
+3  159 2305 158
+3  160 2305 159
+3  225 2289 224
+3  227 2289 226
+3  226 2289 225
+3  177 2290 176
+3  177 178 2291
+3  2290 177 2291
+3  2292 193 194
+3  2292 195 196
+3  2292 194 195
+3  2327 218 219
+3  2327 220 221
+3  2327 219 220
+3  215 2293 214
+3  216 2293 215
+3  217 2293 216
+3  205 2294 204
+3  206 2294 205
+3  2317 2296 52
+3  2295 73 74
+3  2295 75 76
+3  2295 74 75
+3  53 2317 52
+3  56 2317 55
+3  54 2317 53
+3  55 2317 54
+3  50 2296 49
+3  51 2296 50
+3  2299 2297 135
+3  134 135 2297
+3  2299 139 2298
+3  2298 139 140
+3  2299 138 139
+3  31 2300 30
+3  32 2300 31
+3  190 191 2301
+3  2302 26 27
+3  2302 25 26
+3  20 21 2303
+3  19 20 2303
+3  150 2304 149
+3  151 2304 150
+3  161 2305 160
+3  2305 161 2306
+3  165 166 2307
+3  2306 165 2307
+3  5 2308 4
+3  6 2308 5
+3  185 2309 184
+3  185 186 2310
+3  2309 185 2310
+3  2289 2326 224
+3  222 223 2326
+3  2324 212 213
+3  2324 211 212
+3  2324 210 211
+3  2328 2294 206
+3  207 208 2328
+3  206 207 2328
+3  2265 2311 83
+3  90 91 2312
+3  38 39 2322
+3  86 87 2313
+3  2314 2319 255
+3  97 2269 96
+3  2296 2315 49
+3  2267 65 66
+3  2316 2288 248
+3  2274 2317 57
+3  2279 2318 15
+3  251 252 2319
+3  2320 110 2283
+3  2281 129 130
+3  2274 59 60
+3  2268 170 171
+3  172 2268 171
+3  2315 2321 45
+3  125 2282 124
+3  2321 2322 40
+3  27 28 2323
+3  176 2290 175
+3  2293 2324 214
+3  184 2309 183
+3  2309 182 183
+3  241 2287 240
+3  2 3 2325
+3  2289 227 228
+3  204 2294 203
+3  73 2295 72
+3  118 2263 117
+3  2263 116 117
+3  129 2281 128
+3  2326 2327 221
+3  217 218 2327
+3  2324 2328 210
 
diff --git a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
index 9c27b1cf57ce..7b263c59d6ad 100644
--- a/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
+++ b/Mesh_3/include/CGAL/Polyhedral_complex_mesh_domain_3.h
@@ -997,6 +997,8 @@ add_featured_edges_to_graph(const Polyhedron_type& p,
         g_copy[pair.first].insert(get(fpm, face(he,p)));
       }
     }
+    else
+      std::cout << "self loop ignored at point " << get(vpm, source(e, graph)) << std::endl;
   }
 
 #if CGAL_MESH_3_PROTECTION_DEBUG & 2
diff --git a/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp b/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp
index b68723d67e84..340898f65da7 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp
@@ -10,6 +10,9 @@
 #include <cstdlib>
 #include <cassert>
 
+#include <fstream>
+#include <CGAL/IO/File_medit.h>
+
 // Domain
 typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
 typedef CGAL::Mesh_polyhedron_3<K>::type Polyhedron;
@@ -34,7 +37,7 @@ const char* const filenames[] = {
   "meshes/polyhedral_complex_of_spheres/Sphere2.off",
   "meshes/polyhedral_complex_of_spheres/Sphere3.off",
   "meshes/polyhedral_complex_of_spheres/Intersection12.off",
-  "meshes/polyhedral_complex_of_spheres/Intersection23.off"
+  "meshes/polyhedral_complex_of_spheres/Intersection13.off"
 };
 
 const std::pair<int, int> incident_subdomains[] = {
@@ -42,7 +45,7 @@ const std::pair<int, int> incident_subdomains[] = {
   std::make_pair(2, 0),
   std::make_pair(3, 0),
   std::make_pair(1, 2),
-  std::make_pair(3, 2)
+  std::make_pair(1, 3)
 };
 
 int main()
@@ -67,7 +70,7 @@ int main()
 
   // Mesh criteria
   Mesh_criteria criteria(params::edge_size(1.0).edge_min_size(0.1)
-    .facet_distance(0.1)
+    //.facet_distance(0.1)
     .facet_min_size(0.01)
     //.facet_topology(CGAL::FACET_VERTICES_ON_SAME_SURFACE_PATCH)
     //.cell_radius_edge_ratio(3.)
@@ -78,6 +81,9 @@ int main()
     params::no_perturb(), params::no_exude(),
     params::manifold());
 
+  std::ofstream medit_file("out.mesh");
+  CGAL::IO::write_MEDIT(medit_file, c3t3);
+  medit_file.close();
 
   return EXIT_SUCCESS;
 }

From 4f2ec8abe090457867977683386c09466a54d460 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 17 Nov 2023 16:21:37 +0100
Subject: [PATCH 1060/1398] increase facet size

---
 ...st_meshing_polyhedral_complex_with_manifold_and_min_size.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp b/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp
index 340898f65da7..236e0069aece 100644
--- a/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp
+++ b/Mesh_3/test/Mesh_3/test_meshing_polyhedral_complex_with_manifold_and_min_size.cpp
@@ -71,7 +71,7 @@ int main()
   // Mesh criteria
   Mesh_criteria criteria(params::edge_size(1.0).edge_min_size(0.1)
     //.facet_distance(0.1)
-    .facet_min_size(0.01)
+    .facet_min_size(0.05)
     //.facet_topology(CGAL::FACET_VERTICES_ON_SAME_SURFACE_PATCH)
     //.cell_radius_edge_ratio(3.)
     );

From fa96bf86232add30f1896390a9a82af76180498e Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 17 Nov 2023 17:11:46 +0100
Subject: [PATCH 1061/1398] fix other linter warnings

---
 .../add_toc_to_github_wiki_page.py            | 84 ++++++++++---------
 1 file changed, 44 insertions(+), 40 deletions(-)

diff --git a/Scripts/developer_scripts/add_toc_to_github_wiki_page.py b/Scripts/developer_scripts/add_toc_to_github_wiki_page.py
index 494878cca738..928703c502e8 100644
--- a/Scripts/developer_scripts/add_toc_to_github_wiki_page.py
+++ b/Scripts/developer_scripts/add_toc_to_github_wiki_page.py
@@ -5,7 +5,7 @@
 from urllib.parse import quote
 
 parser = argparse.ArgumentParser()
-parser.add_argument("filename", help="the Mardown file to process")
+parser.add_argument("filename", help="the Markdown file to process")
 parser.add_argument(
     "--codebase",
     help="for a Markdown file of Codebase instead of Github",
@@ -83,48 +83,52 @@ def get_toc_entry(s):
 
 
 # now the main
-filename = args.filename
+def main():
+    filename = args.filename
 
-f = codecs.open(filename, "r", encoding="utf-8")
+    f = codecs.open(filename, "r", encoding="utf-8")
 
-if not f:
-    print("Cannot open " + input + "\n")
-    sys.exit()
+    if not f:
+        print("Cannot open " + input + "\n")
+        sys.exit()
 
-# look for <!--TOC--> the begin of the file
-line = f.readline()
-if line.find("<!--TOC-->") == -1:
-    sys.exit()
-
-# skip current TOC
-line = f.readline()
-while line and line.find("<!--TOC-->") == -1:
+    # look for <!--TOC--> the begin of the file
     line = f.readline()
+    if line.find("<!--TOC-->") == -1:
+        sys.exit()
 
-if not line:
-    sys.exit()
-
-buffer = ""
-TOC = "<!--TOC-->\n\n# Table of Contents\n"
-
-verbatim_mode = False  # to ignore verbatim mode while looking for sections
-TOC_empty = True
-for line in f.readlines():
-    buffer += line
-    if verbatim_mode:
-        if line[:3] == "```":
-            verbatim_mode = False
-    else:
-        if line[:3] == "```":
-            verbatim_mode = True
+    # skip current TOC
+    line = f.readline()
+    while line and line.find("<!--TOC-->") == -1:
+        line = f.readline()
+
+    if not line:
+        sys.exit()
+
+    buffer = ""
+    toc = "<!--TOC-->\n\n# Table of Contents\n"
+
+    verbatim_mode = False  # to ignore verbatim mode while looking for sections
+    toc_empty = True
+    for line in f.readlines():
+        buffer += line
+        if verbatim_mode:
+            if line[:3] == "```":
+                verbatim_mode = False
         else:
-            if line[0] == "#" and get_level(line) <= args.max_level:
-                TOC += get_toc_entry(line) + "\n"
-                TOC_empty = False
-TOC += "\n<!--TOC-->\n"
-
-if not TOC_empty:
-    f.close()
-    f = codecs.open(filename, "w", encoding="utf-8")
-    f.write(TOC)
-    f.write(buffer)
+            if line[:3] == "```":
+                verbatim_mode = True
+            else:
+                if line[0] == "#" and get_level(line) <= args.max_level:
+                    toc += get_toc_entry(line) + "\n"
+                    toc_empty = False
+    toc += "\n<!--TOC-->\n"
+
+    if not toc_empty:
+        f.close()
+        f = codecs.open(filename, "w", encoding="utf-8")
+        f.write(toc)
+        f.write(buffer)
+
+if __name__ == "__main__":
+    main()

From 614ba8d6ae0eb5632b3f1ca531219cedd8ed704a Mon Sep 17 00:00:00 2001
From: "dependabot[bot]" <49699333+dependabot[bot]@users.noreply.github.com>
Date: Mon, 20 Nov 2023 05:04:03 +0000
Subject: [PATCH 1062/1398] Bump actions/github-script from 6 to 7

Bumps [actions/github-script](https://github.com/actions/github-script) from 6 to 7.
- [Release notes](https://github.com/actions/github-script/releases)
- [Commits](https://github.com/actions/github-script/compare/v6...v7)

---
updated-dependencies:
- dependency-name: actions/github-script
  dependency-type: direct:production
  update-type: version-update:semver-major
...

Signed-off-by: dependabot[bot] <support@github.com>
---
 .github/workflows/Remove_labels.yml     |  4 ++--
 .github/workflows/build_doc.yml         | 10 +++++-----
 .github/workflows/filter_testsuite.yml  |  4 ++--
 .github/workflows/wiki_notification.yml |  2 +-
 4 files changed, 10 insertions(+), 10 deletions(-)

diff --git a/.github/workflows/Remove_labels.yml b/.github/workflows/Remove_labels.yml
index 0624fe7a1dfa..ef2127e6e47c 100644
--- a/.github/workflows/Remove_labels.yml
+++ b/.github/workflows/Remove_labels.yml
@@ -10,7 +10,7 @@ jobs:
     name: remove label
     steps:
       - name: removelabel
-        uses: actions/github-script@v6
+        uses: actions/github-script@v7
         with:
           github-token: ${{ secrets.GITHUB_TOKEN }}
           script: |
@@ -21,7 +21,7 @@ jobs:
               name: "Tested",
             });
       - name: Post address
-        uses: actions/github-script@v6
+        uses: actions/github-script@v7
         if: ${{ success() }}
         with:
           script: |
diff --git a/.github/workflows/build_doc.yml b/.github/workflows/build_doc.yml
index b629c1870cf0..d523cc2079d1 100644
--- a/.github/workflows/build_doc.yml
+++ b/.github/workflows/build_doc.yml
@@ -16,7 +16,7 @@ jobs:
 
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/github-script@v6
+      - uses: actions/github-script@v7
         id: get_round
         with:
          result-encoding: string
@@ -38,7 +38,7 @@ jobs:
              }
            }
            return 'stop'
-      - uses: actions/github-script@v6
+      - uses: actions/github-script@v7
         if: steps.get_round.outputs.result != 'stop'
         id: get_pr_number
         with:
@@ -49,7 +49,7 @@ jobs:
            return pr_number
 
       - name: Emoji-comment
-        uses: actions/github-script@v6
+        uses: actions/github-script@v7
         if: steps.get_round.outputs.result != 'stop'
         with:
           script: |
@@ -136,7 +136,7 @@ jobs:
           fi
 
       - name: Post address
-        uses: actions/github-script@v6
+        uses: actions/github-script@v7
         if: ${{ success() && steps.get_round.outputs.result != 'stop' }}
         with:
           script: |
@@ -154,7 +154,7 @@ jobs:
       - name: Post error
         env:
           ERRORMSG: ${{steps.build_and_run.outputs.DoxygenError}}
-        uses: actions/github-script@v6
+        uses: actions/github-script@v7
         if: ${{ failure() && steps.get_round.outputs.result != 'stop' }}
         with:
           script: |
diff --git a/.github/workflows/filter_testsuite.yml b/.github/workflows/filter_testsuite.yml
index 48e4f39d65c3..4aaf03a31405 100644
--- a/.github/workflows/filter_testsuite.yml
+++ b/.github/workflows/filter_testsuite.yml
@@ -14,7 +14,7 @@ jobs:
     if: (github.event.comment.user.login == 'sloriot' || github.event.comment.user.login == 'lrineau') && contains(github.event.comment.body, '/testme')
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/github-script@v6
+      - uses: actions/github-script@v7
         id: get_label
         with:
          result-encoding: string
@@ -63,7 +63,7 @@ jobs:
             ssh ${HOST} "${PATH_TO_SCRIPT}/run_testsuite_from_branch_name.sh $USER_NAME $BRANCH_NAME $BASE $PR_NUMBER"
           done
       - name: Post address
-        uses: actions/github-script@v6
+        uses: actions/github-script@v7
         with:
           script: |
             const address = "Testsuite launched. Results will appear on the following page: https://cgal.geometryfactory.com/~cgaltest/test_suite/TESTRESULTS/index.shtml "
diff --git a/.github/workflows/wiki_notification.yml b/.github/workflows/wiki_notification.yml
index 456fefa51e39..6438af78168f 100644
--- a/.github/workflows/wiki_notification.yml
+++ b/.github/workflows/wiki_notification.yml
@@ -9,7 +9,7 @@ jobs:
       messages: ${{ steps.set-result.outputs.result }}
     steps:
     - name: get informations and prepare email
-      uses: actions/github-script@v6
+      uses: actions/github-script@v7
       id: set-result
       with:
         result-encoding: string

From 730bbba98bbce3c9983644e02a66fb45c508cdf2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 20 Nov 2023 10:03:16 +0100
Subject: [PATCH 1063/1398] add an example with a dummy custom sizing field

---
 .../Polygon_mesh_processing/CMakeLists.txt    |   1 +
 ...c_remeshing_with_custom_sizing_example.cpp | 102 ++++++++++++++++++
 2 files changed, 103 insertions(+)
 create mode 100644 Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index 590305c0c8ad..38d1bce078b0 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -51,6 +51,7 @@ create_single_source_cgal_program("match_faces.cpp")
 create_single_source_cgal_program("cc_compatible_orientations.cpp")
 create_single_source_cgal_program("hausdorff_distance_remeshing_example.cpp")
 create_single_source_cgal_program("hausdorff_bounded_error_distance_example.cpp")
+create_single_source_cgal_program("isotropic_remeshing_with_custom_sizing_example.cpp")
 
 find_package(Eigen3 3.2.0 QUIET) #(requires 3.2.0 or greater)
 include(CGAL_Eigen3_support)
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp
new file mode 100644
index 000000000000..1fc70906f7d7
--- /dev/null
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp
@@ -0,0 +1,102 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Polygon_mesh_processing/remesh.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/Polygon_mesh_processing/bbox.h>
+
+#include <fstream>
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+typedef CGAL::Surface_mesh<K::Point_3> Mesh;
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+// a sizing fied that is increasing the size of edge along the y-axis
+// starting at a minimum size at y-max and ending at a maximum size at
+// y-min, with a linear interpolation of sizes in between the two extreme
+// sizing values
+struct My_sizing_field
+{
+  double min_size, max_size;
+  double ymin, ymax;
+  const Mesh& mesh;
+
+  My_sizing_field(double min_size, double max_size, double ymin, double ymax, const Mesh& mesh)
+    : min_size(min_size)
+    , max_size(max_size)
+    , ymin(ymin)
+    , ymax(ymax)
+    , mesh(mesh)
+  {}
+
+  double at(K::Point_3 p) const
+  {
+    double y=p.y();
+    return CGAL::square( (y-ymin)/(ymax-ymin) * (min_size - max_size) + max_size );
+  }
+  double at(const Mesh::Vertex_index v) const { return at(mesh.point(v)); }
+
+  std::optional<double> is_too_long(const Mesh::Vertex_index va,
+                                    const Mesh::Vertex_index vb) const
+  {
+    // TODO: no mesh as parameters?
+    K::Point_3 mp = CGAL::midpoint(mesh.point(va), mesh.point(vb));
+    double sql_at = at(mp);
+    double sql = CGAL::squared_distance(mesh.point(va), mesh.point(vb));
+    if (sql > sql_at)
+      return sql / sql_at;
+    return std::nullopt;
+  }
+
+  std::optional<double> is_too_short(const Mesh::Halfedge_index h,
+                                     const Mesh&) const
+  {
+    K::Point_3 mp = CGAL::midpoint(mesh.point(source(h, mesh)), mesh.point(target(h, mesh)));
+    double sql_at = at(mp);
+    double sql = CGAL::squared_distance(mesh.point(source(h, mesh)), mesh.point(target(h, mesh)));
+    if (sql < sql_at)
+      return sql / sql_at;
+    return std::nullopt;
+  }
+
+  K::Point_3 split_placement(const Mesh::Halfedge_index h,
+                          const Mesh&) const
+  {
+    return CGAL::midpoint(mesh.point(source(h, mesh)), mesh.point(target(h, mesh)));
+  }
+
+  void update(const Mesh::Vertex_index, const Mesh&) {}
+};
+
+
+int main(int argc, char* argv[])
+{
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/elk.off");
+
+  Mesh mesh;
+  if (!PMP::IO::read_polygon_mesh(filename, mesh) || !CGAL::is_triangle_mesh(mesh)) {
+    std::cerr << "Not a valid input file." << std::endl;
+    return 1;
+  }
+
+  std::cout << "Start remeshing of " << filename
+    << " (" << num_faces(mesh) << " faces)..." << std::endl;
+
+  CGAL::Bbox_3 bb = PMP::bbox(mesh);
+  My_sizing_field sizing_field(0.1, 30, bb.ymin(), bb.ymax(), mesh);
+  unsigned int nb_iter = 5;
+
+  PMP::isotropic_remeshing(
+      faces(mesh),
+      sizing_field,
+      mesh,
+      CGAL::parameters::number_of_iterations(nb_iter)
+                       .number_of_relaxation_steps(3)
+      );
+
+  CGAL::IO::write_polygon_mesh("custom_remesh_out.off", mesh, CGAL::parameters::stream_precision(17));
+
+  std::cout << "Remeshing done." << std::endl;
+
+  return 0;
+}

From 37fb95b5cd7619848b829677de5dd64d6f97a6d5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 20 Nov 2023 11:28:50 +0100
Subject: [PATCH 1064/1398] improve concept

---
 .../Concepts/PMPSizingField.h                 | 27 ++++++++++---------
 ...c_remeshing_with_custom_sizing_example.cpp | 17 ++++++------
 .../Adaptive_sizing_field.h                   |  6 ++---
 .../Uniform_sizing_field.h                    |  6 ++---
 .../Isotropic_remeshing/remesh_impl.h         | 24 ++++++++---------
 .../internal/Sizing_field_base.h              |  7 ++---
 .../tangential_relaxation.h                   |  6 ++---
 7 files changed, 48 insertions(+), 45 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index 8641c30c6caf..02822cea9e70 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -16,6 +16,7 @@ class PMPSizingField{
 public:
 
 /// @name Types
+///  These types are used for the documentation of the functions of the concept and not needed implementation wise.
 /// @{
 
 /// Vertex descriptor type
@@ -38,27 +39,29 @@ typedef unspecified_type FT;
 /// @name Functions
 /// @{
 
-/// a function that returns the sizing value at `v`.
-FT at(const vertex_descriptor v) const;
+/// returns the sizing value at `v` (used during tangential relaxation).
+FT at(const vertex_descriptor v, const PolygonMesh& pmesh) const;
 
-/// a function controlling edge split and edge collapse,
-/// returning the ratio of the current edge length and the local target edge length between
-/// the points of `va` and `vb` in case the current edge is too long, and `std::nullopt` otherwise.
+/// returns the ratio of the current edge squared length and the local target edge squared length between
+/// the points of `va` and `vb` in case the current edge is too long, and `std::nullopt` otherwise
+/// (used for triggering edge splits and preventing some edge collapses).
 std::optional<FT> is_too_long(const vertex_descriptor va,
-                              const vertex_descriptor vb) const;
+                              const vertex_descriptor vb,
+                              const PolygonMesh& pmesh) const;
 
-/// a function controlling edge collapse by returning the ratio of the squared length of `h` and the
-/// local target edge length if it is too short, and `std::nullopt` otherwise.
+/// returns the ratio of the squared length of `h` and the
+/// local target edge squared length if it is too short, and `std::nullopt` otherwise
+/// (used for triggering edge collapses).
 std::optional<FT> is_too_short(const halfedge_descriptor h,
                                const PolygonMesh& pmesh) const;
 
-/// a function returning the location of the split point of the edge of `h`.
+/// returns the position of the new vertex created when splitting the edge of `h`.
 Point_3 split_placement(const halfedge_descriptor h,
                         const PolygonMesh& pmesh) const;
 
-/// a function that updates the sizing field value at the vertex `v`.
-void update(const vertex_descriptor v,
-            const PolygonMesh& pmesh);
+/// function called after the addition of the split vertex `v` in `pmesh`.
+void register_split_vertex(const vertex_descriptor v,
+                           const PolygonMesh& pmesh);
 
 /// @}
 };
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp
index 1fc70906f7d7..53d70af603ff 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/isotropic_remeshing_with_custom_sizing_example.cpp
@@ -19,14 +19,12 @@ struct My_sizing_field
 {
   double min_size, max_size;
   double ymin, ymax;
-  const Mesh& mesh;
 
-  My_sizing_field(double min_size, double max_size, double ymin, double ymax, const Mesh& mesh)
+  My_sizing_field(double min_size, double max_size, double ymin, double ymax)
     : min_size(min_size)
     , max_size(max_size)
     , ymin(ymin)
     , ymax(ymax)
-    , mesh(mesh)
   {}
 
   double at(K::Point_3 p) const
@@ -34,10 +32,11 @@ struct My_sizing_field
     double y=p.y();
     return CGAL::square( (y-ymin)/(ymax-ymin) * (min_size - max_size) + max_size );
   }
-  double at(const Mesh::Vertex_index v) const { return at(mesh.point(v)); }
+  double at(const Mesh::Vertex_index v, const Mesh& mesh) const { return at(mesh.point(v)); }
 
   std::optional<double> is_too_long(const Mesh::Vertex_index va,
-                                    const Mesh::Vertex_index vb) const
+                                    const Mesh::Vertex_index vb,
+                                    const Mesh& mesh) const
   {
     // TODO: no mesh as parameters?
     K::Point_3 mp = CGAL::midpoint(mesh.point(va), mesh.point(vb));
@@ -49,7 +48,7 @@ struct My_sizing_field
   }
 
   std::optional<double> is_too_short(const Mesh::Halfedge_index h,
-                                     const Mesh&) const
+                                     const Mesh& mesh) const
   {
     K::Point_3 mp = CGAL::midpoint(mesh.point(source(h, mesh)), mesh.point(target(h, mesh)));
     double sql_at = at(mp);
@@ -60,12 +59,12 @@ struct My_sizing_field
   }
 
   K::Point_3 split_placement(const Mesh::Halfedge_index h,
-                          const Mesh&) const
+                             const Mesh& mesh) const
   {
     return CGAL::midpoint(mesh.point(source(h, mesh)), mesh.point(target(h, mesh)));
   }
 
-  void update(const Mesh::Vertex_index, const Mesh&) {}
+  void register_split_vertex(const Mesh::Vertex_index, const Mesh&) {}
 };
 
 
@@ -83,7 +82,7 @@ int main(int argc, char* argv[])
     << " (" << num_faces(mesh) << " faces)..." << std::endl;
 
   CGAL::Bbox_3 bb = PMP::bbox(mesh);
-  My_sizing_field sizing_field(0.1, 30, bb.ymin(), bb.ymax(), mesh);
+  My_sizing_field sizing_field(0.1, 30, bb.ymin(), bb.ymax());
   unsigned int nb_iter = 5;
 
   PMP::isotropic_remeshing(
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index a61edc699d06..d576df0e447b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -213,13 +213,13 @@ class Adaptive_sizing_field
   }
 
 public:
-  FT at(const vertex_descriptor v) const
+  FT at(const vertex_descriptor v, const PolygonMesh& /* pmesh */) const
   {
     CGAL_assertion(get(m_vertex_sizing_map, v));
     return get(m_vertex_sizing_map, v);
   }
 
-  std::optional<FT> is_too_long(const vertex_descriptor va, const vertex_descriptor vb) const
+  std::optional<FT> is_too_long(const vertex_descriptor va, const vertex_descriptor vb, const PolygonMesh& /* pmesh */) const
   {
     const FT sqlen = sqlength(va, vb);
     FT sqtarg_len = CGAL::square(4./3. * (CGAL::min)(get(m_vertex_sizing_map, va),
@@ -251,7 +251,7 @@ class Adaptive_sizing_field
                     get(m_vpmap, source(h, pmesh)));
   }
 
-  void update(const vertex_descriptor v, const PolygonMesh& pmesh)
+  void register_split_vertex(const vertex_descriptor v, const PolygonMesh& pmesh)
   {
     // calculating it as the average of two vertices on other ends
     // of halfedges as updating is done during an edge split
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
index a4144ceee650..d14f4be9666d 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Uniform_sizing_field.h
@@ -102,12 +102,12 @@ class Uniform_sizing_field
   }
 
 public:
-  FT at(const vertex_descriptor /* v */) const
+  FT at(const vertex_descriptor /* v */, const PolygonMesh& /* pmesh */) const
   {
     return m_size;
   }
 
-  std::optional<FT> is_too_long(const vertex_descriptor va, const vertex_descriptor vb) const
+  std::optional<FT> is_too_long(const vertex_descriptor va, const vertex_descriptor vb, const PolygonMesh& /* pmesh */) const
   {
     const FT sqlen = sqlength(va, vb);
     if (sqlen > m_sq_long)
@@ -133,7 +133,7 @@ class Uniform_sizing_field
                     get(m_vpmap, source(h, pmesh)));
   }
 
-  void update(const vertex_descriptor /* v */, const PolygonMesh& /* pmesh */)
+  void register_split_vertex(const vertex_descriptor /* v */, const PolygonMesh& /* pmesh */)
   {}
 
 private:
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index c1696428d756..30d201d1ef51 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -246,7 +246,7 @@ namespace internal {
             get(ecmap, e) ||
             get(fpm, face(h,pmesh))!=get(fpm, face(opposite(h,pmesh),pmesh)) )
       {
-        if (sizing.is_too_long(source(h, pmesh), target(h, pmesh)))
+        if (sizing.is_too_long(source(h, pmesh), target(h, pmesh), pmesh))
         {
           return false;
         }
@@ -400,7 +400,7 @@ namespace internal {
       for(edge_descriptor e : edge_range)
       {
         const halfedge_descriptor he = halfedge(e, mesh_);
-        std::optional<double> sqlen = sizing.is_too_long(source(he, mesh_), target(he, mesh_));
+        std::optional<double> sqlen = sizing.is_too_long(source(he, mesh_), target(he, mesh_), mesh_);
         if(sqlen != std::nullopt)
           long_edges.emplace(he, sqlen.value());
       }
@@ -433,16 +433,16 @@ namespace internal {
         std::cout << "   refinement point : " << refinement_point << std::endl;
 #endif
         //update sizing field with the new point
-        sizing.update(vnew, mesh_);
+        sizing.register_split_vertex(vnew, mesh_);
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
-        std::optional<double> sqlen_new = sizing.is_too_long(source(hnew, mesh_), target(hnew, mesh_));
+        std::optional<double> sqlen_new = sizing.is_too_long(source(hnew, mesh_), target(hnew, mesh_), mesh_);
         if(sqlen_new != std::nullopt)
           long_edges.emplace(hnew, sqlen_new.value());
 
         const halfedge_descriptor hnext = next(hnew, mesh_);
-        sqlen_new = sizing.is_too_long(source(hnext, mesh_), target(hnext, mesh_));
+        sqlen_new = sizing.is_too_long(source(hnext, mesh_), target(hnext, mesh_), mesh_);
         if (sqlen_new != std::nullopt)
           long_edges.emplace(hnext, sqlen_new.value());
 
@@ -500,7 +500,7 @@ namespace internal {
         if (!is_split_allowed(e))
           continue;
         const halfedge_descriptor he = halfedge(e, mesh_);
-        std::optional<double> sqlen = sizing.is_too_long(source(he, mesh_), target(he, mesh_));
+        std::optional<double> sqlen = sizing.is_too_long(source(he, mesh_), target(he, mesh_), mesh_);
         if(sqlen != std::nullopt)
           long_edges.emplace(halfedge(e, mesh_), sqlen.value());
       }
@@ -550,16 +550,16 @@ namespace internal {
         halfedge_added(hnew_opp, status(opposite(he, mesh_)));
 
         //update sizing field with the new point
-        sizing.update(vnew, mesh_);
+        sizing.register_split_vertex(vnew, mesh_);
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
-        std::optional<double> sqlen_new = sizing.is_too_long(source(hnew, mesh_), target(hnew, mesh_));
+        std::optional<double> sqlen_new = sizing.is_too_long(source(hnew, mesh_), target(hnew, mesh_), mesh_);
         if(sqlen_new != std::nullopt)
           long_edges.emplace(hnew, sqlen_new.value());
 
         const halfedge_descriptor hnext = next(hnew, mesh_);
-        sqlen_new = sizing.is_too_long(source(hnext, mesh_), target(hnext, mesh_));
+        sqlen_new = sizing.is_too_long(source(hnext, mesh_), target(hnext, mesh_), mesh_);
         if (sqlen_new != std::nullopt)
           long_edges.emplace(hnext, sqlen_new.value());
 
@@ -580,7 +580,7 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            std::optional<double> sql = sizing.is_too_long(source(hnew2, mesh_), target(hnew2, mesh_));
+            std::optional<double> sql = sizing.is_too_long(source(hnew2, mesh_), target(hnew2, mesh_), mesh_);
             if(sql != std::nullopt)
               long_edges.emplace(hnew2, sql.value());
           }
@@ -603,7 +603,7 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            std::optional<double> sql = sizing.is_too_long(source(hnew2, mesh_), target(hnew2, mesh_));
+            std::optional<double> sql = sizing.is_too_long(source(hnew2, mesh_), target(hnew2, mesh_), mesh_);
             if (sql != std::nullopt)
               long_edges.emplace(hnew2, sql.value());
           }
@@ -747,7 +747,7 @@ namespace internal {
         for(halfedge_descriptor ha : halfedges_around_target(va, mesh_))
         {
           vertex_descriptor va_i = source(ha, mesh_);
-          std::optional<double> sqha = sizing.is_too_long(vb, va_i);
+          std::optional<double> sqha = sizing.is_too_long(vb, va_i, mesh_);
           if (sqha != std::nullopt)
           {
             collapse_ok = false;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
index f13135cd873e..c06f0568e681 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Sizing_field_base.h
@@ -60,13 +60,14 @@ class Sizing_field_base
   typedef typename K::FT                                        FT;
 
 public:
-  virtual FT at(const vertex_descriptor v) const = 0;
+  virtual FT at(const vertex_descriptor v, const PolygonMesh&) const = 0;
   virtual std::optional<FT> is_too_long(const vertex_descriptor va,
-                                        const vertex_descriptor vb) const = 0;
+                                        const vertex_descriptor vb,
+                                        const PolygonMesh&) const = 0;
   virtual std::optional<FT> is_too_short(const halfedge_descriptor h,
                                          const PolygonMesh& pmesh) const = 0;
   virtual Point_3 split_placement(const halfedge_descriptor h, const PolygonMesh& pmesh) const = 0;
-  virtual void update(const vertex_descriptor v, const PolygonMesh& pmesh) = 0;
+  virtual void register_split_vertex(const vertex_descriptor v, const PolygonMesh& pmesh) = 0;
 
 };
 
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
index 6693524324a9..145d5a24135f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/tangential_relaxation.h
@@ -288,9 +288,9 @@ void tangential_relaxation(const VertexRange& vertices,
 
             const double tri_area = gt_area(get(vpm, v), get(vpm, v1), get(vpm, v2));
             const double face_weight = tri_area
-                                       / (1. / 3. * (sizing.at(v)
-                                                   + sizing.at(v1)
-                                                   + sizing.at(v2)));
+                                       / (1. / 3. * (sizing.at(v, tm)
+                                                   + sizing.at(v1, tm)
+                                                   + sizing.at(v2, tm)));
             weight += face_weight;
 
             const Point_3 centroid = gt_centroid(get(vpm, v), get(vpm, v1), get(vpm, v2));

From fe32ee586e5ee817cc32fa81421745ed2092fe3d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 20 Nov 2023 11:36:06 +0100
Subject: [PATCH 1065/1398] at Eigen dependency

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h        | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index d576df0e447b..5c3a99efef5b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -38,6 +38,8 @@ namespace Polygon_mesh_processing
 * Edges too long with respect to the local target edge length are split in two, while
 * edges that are too short are collapsed.
 *
+* This class depends on the Eigen library.
+*
 * \cgalModels{PMPSizingField}
 *
 * \sa `isotropic_remeshing()`

From aefededa4bbc49dfdf7f16d4d3d7a93a2d4a5b22 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 21 Nov 2023 17:25:43 +0200
Subject: [PATCH 1066/1398] Made Curve_halfedges public, as we enable iterating
 over such types

---
 .../Arrangement_on_surface_with_history_2.h   | 98 +++++++------------
 1 file changed, 33 insertions(+), 65 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
index af560449961e..6f43c9ef757c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
@@ -170,104 +170,75 @@ class Arrangement_on_surface_with_history_2 :
   // Forward declaration:
   class Curve_halfedges_observer;
 
+public:
   /*! \class
    * Extension of a curve with the set of edges that it induces.
    * Each edge is represented by one of the halfedges.
    */
   class Curve_halfedges : public Curve_2,
-                          public In_place_list_base<Curve_halfedges>
-  {
+                          public In_place_list_base<Curve_halfedges> {
+    using Gt = Geometry_traits_2;
+    using Btt = Base_topology_traits;
+    using Aos_wh = Arrangement_on_surface_with_history_2<Gt, Btt>;
+
     friend class Curve_halfedges_observer;
-    friend class Arrangement_on_surface_with_history_2<Geometry_traits_2,
-                                                       Base_topology_traits>;
-    friend class Arr_with_history_accessor<
-      Arrangement_on_surface_with_history_2<Geometry_traits_2,
-                                            Base_topology_traits> >;
+    friend class Arrangement_on_surface_with_history_2<Gt, Btt>;
+    friend class Arr_with_history_accessor<Aos_wh>;
 
   private:
-    typedef std::set<Halfedge_handle, Less_halfedge_handle>  Halfedges_set;
+    using Halfedges_set = std::set<Halfedge_handle, Less_halfedge_handle>;
 
     // Data members:
     Halfedges_set m_halfedges;
 
   public:
     /*! Default constructor. */
-    Curve_halfedges ()
-    {}
+    Curve_halfedges() {}
 
     /*! Constructor from a given curve. */
-    Curve_halfedges (const Curve_2& curve) :
-      Curve_2(curve)
-    {}
+    Curve_halfedges(const Curve_2& curve) : Curve_2(curve) {}
 
-    typedef typename Halfedges_set::iterator             iterator;
-    typedef typename Halfedges_set::const_iterator       const_iterator;
+    using iterator = typename Halfedges_set::iterator;
+    using const_iterator = typename Halfedges_set::const_iterator;
 
   private:
-
     /*! Get the number of edges induced by the curve. */
-    Size _size () const
-    {
-      return (m_halfedges.size());
-    }
+    Size size() const { return m_halfedges.size(); }
 
     /*! Get an iterator for the first edge in the set (const version). */
-    const_iterator _begin () const
-    {
-      return m_halfedges.begin();
-    }
+    const_iterator begin() const { return m_halfedges.begin(); }
 
     /*! Get an iterator for the first edge in the set (non-const version). */
-    iterator _begin ()
-    {
-      return m_halfedges.begin();
-    }
+    iterator begin() { return m_halfedges.begin(); }
 
     /*! Get a past-the-end iterator for the set edges (const version). */
-    const_iterator _end () const
-    {
-      return m_halfedges.end();
-    }
+    const_iterator end() const { return m_halfedges.end(); }
 
     /*! Get a past-the-end iterator for the set edges (non-const version). */
-    iterator _end ()
-    {
-      return m_halfedges.end();
-    }
+    iterator end() { return m_halfedges.end(); }
 
     /*! Insert an edge to the set. */
-    iterator _insert (Halfedge_handle he)
-    {
+    iterator _insert(Halfedge_handle he) {
       std::pair<iterator, bool> res = m_halfedges.insert(he);
       CGAL_assertion(res.second);
-      return (res.first);
+      return res.first;
     }
 
     /*! Erase an edge, given by its position, from the set. */
-    void _erase(iterator pos)
-    {
-      m_halfedges.erase(pos);
-      return;
-    }
+    void erase(iterator pos) { m_halfedges.erase(pos); }
 
     /*! Erase an edge from the set. */
-    void _erase (Halfedge_handle he)
-    {
+    void _erase(Halfedge_handle he) {
       size_t res = m_halfedges.erase(he);
-      if (res == 0)
-        res = m_halfedges.erase(he->twin());
+      if (res == 0) res = m_halfedges.erase(he->twin());
       CGAL_assertion(res != 0);
-      return;
     }
 
     /*! Cleat the edges set. */
-    void _clear ()
-    {
-      m_halfedges.clear();
-      return;
-    }
+    void clear() { m_halfedges.clear(); }
   };
 
+protected:
   typedef CGAL_ALLOCATOR(Curve_halfedges)               Curves_alloc;
   typedef In_place_list<Curve_halfedges, false>         Curve_halfedges_list;
 
@@ -537,16 +508,13 @@ class Arrangement_on_surface_with_history_2 :
 
   /// \name Traversal of the edges induced by a curve.
   //@{
-  Size number_of_induced_edges (Curve_const_handle c) const
-  {
-    return (c->_size());
-  }
+  Size number_of_induced_edges (Curve_const_handle c) const { return c->size(); }
 
   Induced_edge_iterator
-  induced_edges_begin (Curve_const_handle c) const { return (c->_begin()); }
+  induced_edges_begin (Curve_const_handle c) const { return (c->begin()); }
 
   Induced_edge_iterator
-  induced_edges_end (Curve_const_handle c) const { return (c->_end()); }
+  induced_edges_end (Curve_const_handle c) const { return (c->end()); }
   //@}
 
   /// \name Manipulating edges.
@@ -696,12 +664,12 @@ class Arrangement_on_surface_with_history_2 :
   Size _remove_curve (Curve_handle ch)
   {
     // Go over all edges the given curve induces.
-    Curve_halfedges                           *p_cv = &(*ch);
-    typename Curve_halfedges::const_iterator   it = ch->_begin();
-    Halfedge_handle                            he;
-    Size                                       n_removed = 0;
+    Curve_halfedges* p_cv = &(*ch);
+    Halfedge_handle he;
+    Size n_removed = 0;
 
-    while (it != ch->_end()) {
+    typename Curve_halfedges::const_iterator it = ch->begin();
+    while (it != ch->end()) {
       // Check how many curves have originated the current edge.
       // Note we increment the iterator now, as the edge may be removed.
       he = *it;

From 15af7605fe57265e85b5690aae5932c108f21deb Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 22 Nov 2023 11:34:27 +0100
Subject: [PATCH 1067/1398] Q_DECL_OVERRIDE -> override

---
 Polyhedron/demo/Polyhedron/MainWindow.h       |  14 +--
 .../Plugins/AABB_tree/Cut_plugin.cpp          |  30 ++---
 .../AABB_tree/Do_trees_intersect_plugin.cpp   |   8 +-
 .../Display/Display_property_plugin.cpp       |   8 +-
 .../Plugins/Display/Heat_method_plugin.cpp    |  26 ++--
 .../Polyhedron/Plugins/IO/3mf_io_plugin.cpp   |  14 +--
 .../Mesh_3/Tetrahedra_filtering_plugin.cpp    |   6 +-
 .../Plugins/PCA/Scene_aff_transformed_item.h  |  10 +-
 .../Scene_aff_transformed_point_set_item.h    |  22 ++--
 .../Scene_aff_transformed_polygon_soup_item.h |  22 ++--
 .../Scene_aff_transformed_surface_mesh_item.h |  22 ++--
 .../Plugins/PMP/Engrave_text_plugin.cpp       |   8 +-
 .../Polyhedron/Plugins/PMP/Extrude_plugin.cpp |  26 ++--
 .../Plugins/Point_set/Alpha_shape_plugin.cpp  |  30 ++---
 .../Three_examples/Basic_item_plugin.cpp      |   6 +-
 .../Plugins/Three_examples/Basic_plugin.cpp   |   6 +-
 .../Three_examples/Dock_widget_plugin.cpp     |   8 +-
 .../Plugins/Three_examples/Example_plugin.cpp |  22 ++--
 Polyhedron/demo/Polyhedron/Scene.h            |  80 ++++++------
 Polyhedron/demo/Polyhedron/Scene_lcc_item.h   |  26 ++--
 Polyhedron/demo/Polyhedron/Scene_plane_item.h |  28 ++---
 .../Scene_points_with_normal_item.h           |  30 ++---
 .../demo/Polyhedron/Scene_polygon_soup_item.h |  34 +++---
 .../demo/Polyhedron/Scene_polylines_item.h    |  36 +++---
 .../demo/Polyhedron/Scene_spheres_item.h      |  26 ++--
 .../demo/Polyhedron/Scene_surface_mesh_item.h |  62 +++++-----
 .../demo/Polyhedron/Scene_tetrahedra_item.h   |  20 +--
 .../Polyhedron/Scene_triangulation_3_item.cpp |  26 ++--
 .../Polyhedron/Scene_triangulation_3_item.h   |  58 ++++-----
 Polyhedron/demo/Polyhedron/Viewer.h           | 114 +++++++++---------
 Three/include/CGAL/Three/Edge_container.h     |   6 +-
 Three/include/CGAL/Three/Point_container.h    |   4 +-
 Three/include/CGAL/Three/Scene_group_item.h   |  28 ++---
 .../CGAL/Three/Scene_item_rendering_helper.h  |  16 +--
 Three/include/CGAL/Three/Triangle_container.h |   6 +-
 35 files changed, 444 insertions(+), 444 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/MainWindow.h b/Polyhedron/demo/Polyhedron/MainWindow.h
index 542cc40ea75d..e3100ad783fd 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.h
+++ b/Polyhedron/demo/Polyhedron/MainWindow.h
@@ -122,7 +122,7 @@ public Q_SLOTS:
   //! If `b` is true, recenters the scene.
   void updateViewersBboxes(bool recenter);
   //! Opens a script or a file with the default loader if there is.
-  void open(QString) Q_DECL_OVERRIDE;
+  void open(QString) override;
   //! Is called when the up button is pressed.
   void on_upButton_pressed();
   //! Is called when the down button is pressed.
@@ -242,15 +242,15 @@ public Q_SLOTS:
   /*!
    * Displays a text preceded by the mention "INFO :".
    */
-  void message_information(QString) Q_DECL_OVERRIDE;
+  void message_information(QString) override;
   /*!
    * Displays a blue text preceded by the mention "WARNING :".
    */
-  void message_warning(QString) Q_DECL_OVERRIDE;
+  void message_warning(QString) override;
   /*!
    * Displays a red text preceded by the mention "ERROR :".
    */
-  void message_error(QString) Q_DECL_OVERRIDE;
+  void message_error(QString) override;
 
     //!Displays a text in the chosen html color with the chosen html font.
 
@@ -392,7 +392,7 @@ protected Q_SLOTS:
    * Calls writeSettings() and set the flag accepted for the event.
    * @see writeSettings()
    */
-  void closeEvent(QCloseEvent *event)Q_DECL_OVERRIDE;
+  void closeEvent(QCloseEvent *event)override;
   /*! Returns the currently selected item in the Geometric Objects view. Returns -1
    * if none is selected.
    */
@@ -500,8 +500,8 @@ public Q_SLOTS:
   void lookat();
   void color();
 protected:
-  void closeEvent(QCloseEvent *closeEvent)Q_DECL_OVERRIDE;
-  void changeEvent(QEvent *event) Q_DECL_OVERRIDE;
+  void closeEvent(QCloseEvent *closeEvent)override;
+  void changeEvent(QEvent *event) override;
 private:
   bool is_main;
 };
diff --git a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp
index 2d02ea43c88a..9c6105b5db7c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Cut_plugin.cpp
@@ -301,7 +301,7 @@ class Q_DECL_EXPORT Scene_aabb_plane_item : public Scene_plane_item
   {
     this->edge_sm_trees = edge_trees;
   }
-  void draw(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE
+  void draw(CGAL::Three::Viewer_interface* viewer) const override
   {
     if(!isInit(viewer))
       initGL(viewer);
@@ -338,7 +338,7 @@ class Q_DECL_EXPORT Scene_aabb_plane_item : public Scene_plane_item
       break;
     }
   }
-  void drawEdges(CGAL::Three::Viewer_interface *viewer) const Q_DECL_OVERRIDE
+  void drawEdges(CGAL::Three::Viewer_interface *viewer) const override
   {
     if(!isInit(viewer))
       initGL(viewer);
@@ -364,7 +364,7 @@ class Q_DECL_EXPORT Scene_aabb_plane_item : public Scene_plane_item
     ec->draw(viewer, true);
   }
 
-  void invalidateOpenGLBuffers()Q_DECL_OVERRIDE
+  void invalidateOpenGLBuffers()override
   {
     setBuffersFilled(false);
     getTriangleContainer(0)->reset_vbos(ALL);
@@ -449,7 +449,7 @@ class Q_DECL_EXPORT Scene_aabb_plane_item : public Scene_plane_item
   };
 #endif
 
-  void computeElements() const Q_DECL_OVERRIDE
+  void computeElements() const override
   {
     switch(m_cut_plane)
     {
@@ -533,7 +533,7 @@ class Q_DECL_EXPORT Scene_aabb_plane_item : public Scene_plane_item
 
   }
 
-  void initializeBuffers(CGAL::Three::Viewer_interface *viewer) const Q_DECL_OVERRIDE
+  void initializeBuffers(CGAL::Three::Viewer_interface *viewer) const override
   {
     getTriangleContainer(0)->initializeBuffers(viewer);
     getTriangleContainer(1)->initializeBuffers(viewer);
@@ -940,7 +940,7 @@ class Polyhedron_demo_cut_plugin :
 
    ~Polyhedron_demo_cut_plugin();
 
-  bool applicable(QAction*) const Q_DECL_OVERRIDE{
+  bool applicable(QAction*) const override{
     // returns true if one surface_mesh is in the entries
     for (int i=0; i< scene->numberOfEntries(); ++i)
     {
@@ -950,24 +950,24 @@ class Polyhedron_demo_cut_plugin :
     return false;
   }
 
-  QString name() const Q_DECL_OVERRIDE
+  QString name() const override
   {
     return "cut-plugin";
   }
 
 
-   QString nameFilters() const Q_DECL_OVERRIDE
+   QString nameFilters() const override
   {
     return "Segment soup file (*.polylines.txt *.cgal)";
   }
 
 
-  bool canLoad(QFileInfo) const Q_DECL_OVERRIDE
+  bool canLoad(QFileInfo) const override
   {
     return false;
   }
 
-  QList<Scene_item*> load(QFileInfo , bool& ok, bool add_to_scene=true) Q_DECL_OVERRIDE
+  QList<Scene_item*> load(QFileInfo , bool& ok, bool add_to_scene=true) override
 
   {
     Q_UNUSED(add_to_scene);
@@ -975,7 +975,7 @@ class Polyhedron_demo_cut_plugin :
     return QList<Scene_item*>();
   }
 
-  bool canSave(const CGAL::Three::Scene_item* item) Q_DECL_OVERRIDE
+  bool canSave(const CGAL::Three::Scene_item* item) override
   {
     // This plugin supports edges items
     bool b = qobject_cast<const Scene_edges_item*>(item) != 0;
@@ -983,7 +983,7 @@ class Polyhedron_demo_cut_plugin :
   }
 
 
-  bool save(QFileInfo fileinfo,QList<CGAL::Three::Scene_item*>& items) Q_DECL_OVERRIDE
+  bool save(QFileInfo fileinfo,QList<CGAL::Three::Scene_item*>& items) override
   {
     Scene_item* item = items.front();
     // This plugin supports edges items
@@ -1001,7 +1001,7 @@ class Polyhedron_demo_cut_plugin :
     return ok;
   }
 
-  bool isDefaultLoader(const Scene_item* item) const Q_DECL_OVERRIDE{
+  bool isDefaultLoader(const Scene_item* item) const override{
     if(qobject_cast<const Scene_edges_item*>(item))
       return true;
     return false;
@@ -1010,9 +1010,9 @@ class Polyhedron_demo_cut_plugin :
   using Polyhedron_demo_io_plugin_interface::init;
   void init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* scene_interface,
             Messages_interface* m) override;
-  QList<QAction*> actions() const Q_DECL_OVERRIDE;
+  QList<QAction*> actions() const override;
 
-  bool eventFilter(QObject *, QEvent *event) Q_DECL_OVERRIDE
+  bool eventFilter(QObject *, QEvent *event) override
   {
     if(!plane_item)
       return false;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp
index 979453ec2af6..96741cfd9f04 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/AABB_tree/Do_trees_intersect_plugin.cpp
@@ -25,7 +25,7 @@ class DoTreesIntersectplugin:
   Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0")
 public:
 
-  bool eventFilter(QObject *, QEvent *event) Q_DECL_OVERRIDE
+  bool eventFilter(QObject *, QEvent *event) override
   {
     if(event->type() != QEvent::KeyPress)
       return false;
@@ -38,7 +38,7 @@ class DoTreesIntersectplugin:
     return false;
   }
 
-  bool applicable(QAction*) const Q_DECL_OVERRIDE
+  bool applicable(QAction*) const override
   {
     if(scene->selectionIndices().size() <2)
       return false;
@@ -50,13 +50,13 @@ class DoTreesIntersectplugin:
     return (! group_item);
   }
 
-  QList<QAction*> actions() const Q_DECL_OVERRIDE
+  QList<QAction*> actions() const override
   {
     return _actions;
   }
 
 
-  void init(QMainWindow* mw, CGAL::Three::Scene_interface* sc, Messages_interface* mi) Q_DECL_OVERRIDE
+  void init(QMainWindow* mw, CGAL::Three::Scene_interface* sc, Messages_interface* mi) override
   {
     this->messageInterface = mi;
     this->scene = sc;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index 687cb6a92dfd..40959e98d095 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -109,7 +109,7 @@ class Display_property_plugin
   };
 
 public:
-  bool applicable(QAction*) const Q_DECL_OVERRIDE
+  bool applicable(QAction*) const override
   {
     Scene_item* item = scene->item(scene->mainSelectionIndex());
     if(!item)
@@ -119,14 +119,14 @@ class Display_property_plugin
            qobject_cast<Scene_points_with_normal_item*>(item);
   }
 
-  QList<QAction*> actions() const Q_DECL_OVERRIDE
+  QList<QAction*> actions() const override
   {
     return QList<QAction*>() << actionDisplayProperties;
   }
 
   void init(QMainWindow* mw,
             Scene_interface* sc,
-            Messages_interface*) Q_DECL_OVERRIDE
+            Messages_interface*) override
   {
     this->scene = sc;
     this->mw = mw;
@@ -215,7 +215,7 @@ private Q_SLOTS:
     dock_widget->raise();
   }
 
-  void closure() Q_DECL_OVERRIDE
+  void closure() override
   {
     dock_widget->hide();
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp
index fc6d564379b2..e901d5f3dab4 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Heat_method_plugin.cpp
@@ -66,14 +66,14 @@ class Scene_heat_item
 
   ~Scene_heat_item(){}
 
-  Scene_item* clone() const Q_DECL_OVERRIDE { return nullptr; }
-  QString toolTip() const Q_DECL_OVERRIDE{ return QString(); }
+  Scene_item* clone() const override { return nullptr; }
+  QString toolTip() const override{ return QString(); }
   Scene_surface_mesh_item* getParent() { return parent; }
-  bool isEmpty() const Q_DECL_OVERRIDE { return false; }
+  bool isEmpty() const override { return false; }
 
   SMesh* face_graph() { return sm; }
 
-  void initializeBuffers(Viewer_interface *viewer) const Q_DECL_OVERRIDE
+  void initializeBuffers(Viewer_interface *viewer) const override
   {
     getTriangleContainer(0)->initializeBuffers(viewer);
     getTriangleContainer(0)->setIdxSize(nb_idx);
@@ -88,7 +88,7 @@ class Scene_heat_item
     idx.shrink_to_fit();
   }
 
-  void draw(Viewer_interface *viewer) const Q_DECL_OVERRIDE
+  void draw(Viewer_interface *viewer) const override
   {
     if(!visible())
       return;
@@ -112,24 +112,24 @@ class Scene_heat_item
     getTriangleContainer(0)->draw(viewer, false);
   }
 
-  void compute_bbox() const Q_DECL_OVERRIDE
+  void compute_bbox() const override
   {
     setBbox(parent->bbox());
   }
 
-  virtual bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE
+  virtual bool supportsRenderingMode(RenderingMode m) const override
   {
     return (m == Gouraud);
   }
 
-  virtual void invalidateOpenGLBuffers() Q_DECL_OVERRIDE
+  virtual void invalidateOpenGLBuffers() override
   {
     setBuffersFilled(false);
     compute_bbox();
     getTriangleContainer(0)->reset_vbos(NOT_INSTANCED);
   }
 
-  void computeElements() const Q_DECL_OVERRIDE
+  void computeElements() const override
   {
     typedef CGAL::Buffer_for_vao<float, unsigned int> CPF;
 
@@ -243,7 +243,7 @@ class Heat_method_plugin
   std::unordered_map<Scene_surface_mesh_item*, Heat_method_idt*> idt_heat_methods;
 
 public:
-  bool applicable(QAction*) const Q_DECL_OVERRIDE
+  bool applicable(QAction*) const override
   {
     // Single item => it must be a mesh and the selection item will be created through the plugin's button
     if(scene->selectionIndices().size() == 1)
@@ -265,14 +265,14 @@ class Heat_method_plugin
     return false;
   }
 
-  QList<QAction*> actions() const Q_DECL_OVERRIDE
+  QList<QAction*> actions() const override
   {
     return QList<QAction*>() << actionHeatMethod;
   }
 
   void init(QMainWindow* mw,
             Scene_interface* sc,
-            Messages_interface*) Q_DECL_OVERRIDE
+            Messages_interface*) override
   {
     this->scene = sc;
     this->mw = mw;
@@ -354,7 +354,7 @@ private Q_SLOTS:
     dock_widget->raise();
   }
 
-  void closure() Q_DECL_OVERRIDE
+  void closure() override
   {
     dock_widget->hide();
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/3mf_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/3mf_io_plugin.cpp
index 739eb1801741..d757a5aaba24 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/3mf_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/3mf_io_plugin.cpp
@@ -33,7 +33,7 @@ class Io_3mf_plugin:
   typedef std::vector<Polygon> PolygonRange;
   typedef std::list<PointRange> PolylineRange;
   typedef std::vector<CGAL::IO::Color> ColorRange;
-  void init() Q_DECL_OVERRIDE
+  void init() override
   {
     QMenu* menuFile = CGAL::Three::Three::mainWindow()->findChild<QMenu*>("menuFile");
 
@@ -58,17 +58,17 @@ class Io_3mf_plugin:
     });
     menuFile->insertAction(CGAL::Three::Three::mainWindow()->findChild<QAction*>("actionSa_ve_Scene_as_Script"), actionSaveSceneTo3mf);
   }
-  QString name() const Q_DECL_OVERRIDE { return "3mf_io_plugin"; }
+  QString name() const override { return "3mf_io_plugin"; }
 
 
-  QString nameFilters() const Q_DECL_OVERRIDE { return
+  QString nameFilters() const override { return
         "3mf files (*.3mf)"; }
 
 
-  bool canLoad(QFileInfo) const Q_DECL_OVERRIDE { return true; }
+  bool canLoad(QFileInfo) const override { return true; }
 
 
-  QList<CGAL::Three::Scene_item*> load(QFileInfo fileinfo, bool& ok, bool add_to_scene=true) Q_DECL_OVERRIDE {
+  QList<CGAL::Three::Scene_item*> load(QFileInfo fileinfo, bool& ok, bool add_to_scene=true) override {
     namespace PMP = CGAL::Polygon_mesh_processing;
     // Open file
     ok = true;
@@ -135,10 +135,10 @@ class Io_3mf_plugin:
   }
 
 
-  bool canSave(const CGAL::Three::Scene_item*) Q_DECL_OVERRIDE {return false;}
+  bool canSave(const CGAL::Three::Scene_item*) override {return false;}
 
 
-  bool save(QFileInfo fi, QList<CGAL::Three::Scene_item*>& items) Q_DECL_OVERRIDE {
+  bool save(QFileInfo fi, QList<CGAL::Three::Scene_item*>& items) override {
 
     QList<CGAL::Three::Scene_item*> to_return;
     std::vector<Scene_surface_mesh_item*> sm_items;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Tetrahedra_filtering_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Tetrahedra_filtering_plugin.cpp
index 0fb84c348adb..9c8d9877f59d 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Tetrahedra_filtering_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Tetrahedra_filtering_plugin.cpp
@@ -40,7 +40,7 @@ class Q_DECL_EXPORT Tetrahedra_filtering_plugin:
   Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0" FILE "tetrahedra_filtering_plugin.json")
 public :
 
-  void init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* scene_interface, Messages_interface*)Q_DECL_OVERRIDE {
+  void init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* scene_interface, Messages_interface*)override {
     this->scene = scene_interface;
     this->mw = mainWindow;
     this->tet_item = nullptr;
@@ -66,11 +66,11 @@ public :
       filter();
     });
   }
-  bool applicable(QAction*) const Q_DECL_OVERRIDE
+  bool applicable(QAction*) const override
   {
     return qobject_cast<Scene_c3t3_item*>( scene->item( scene->mainSelectionIndex() ) );
   }
-  QList<QAction*> actions() const Q_DECL_OVERRIDE {
+  QList<QAction*> actions() const override {
     return _actions;
   }
   virtual void closure() override
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_item.h b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_item.h
index 77554fc11023..82f4ae91feb4 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_item.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_item.h
@@ -57,19 +57,19 @@ class SCENE_AFF_TRANSFORMED_ITEM_EXPORT Scene_aff_transformed_item
 
   ~Scene_aff_transformed_item();
 
-  void itemAboutToBeDestroyed(Scene_item *item) Q_DECL_OVERRIDE;
+  void itemAboutToBeDestroyed(Scene_item *item) override;
 
   void setManipulatable(bool b = true) { d->manipulable = b;}
-  bool manipulatable() const Q_DECL_OVERRIDE { return d->manipulable; }
-  CGAL::Three::Scene_item::ManipulatedFrame* manipulatedFrame() Q_DECL_OVERRIDE { return d->frame; }
+  bool manipulatable() const override { return d->manipulable; }
+  CGAL::Three::Scene_item::ManipulatedFrame* manipulatedFrame() override { return d->frame; }
   void setFMatrix(double matrix[16]);
   const QMatrix4x4& getFMatrix() const { return d->f_matrix; }
 
   // below is defined in the specific aff_transformed items
-  virtual void compute_bbox() const Q_DECL_OVERRIDE = 0;
+  virtual void compute_bbox() const override = 0;
   virtual const CGAL::qglviewer::Vec& center() const = 0;
 
-  virtual bool keyPressEvent(QKeyEvent* e) Q_DECL_OVERRIDE;
+  virtual bool keyPressEvent(QKeyEvent* e) override;
 
 Q_SIGNALS:
   void applyTransformation();
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_point_set_item.h b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_point_set_item.h
index 1bd9d46ca9c3..d632ab93b63a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_point_set_item.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_point_set_item.h
@@ -72,24 +72,24 @@ class SCENE_AFF_TRANSFORMED_POINT_SET_ITEM_EXPORT Scene_aff_transformed_point_se
   ~Scene_aff_transformed_point_set_item();
 
   Scene_points_with_normal_item* item() { return d->pts_item; }
-  const CGAL::qglviewer::Vec& center() const Q_DECL_OVERRIDE { return d->center_; }
+  const CGAL::qglviewer::Vec& center() const override { return d->center_; }
 
-  CGAL::Three::Scene_item* clone() const Q_DECL_OVERRIDE { return nullptr; }
-  QString name() const Q_DECL_OVERRIDE { return tr("%1_transformed").arg(d->pts_item->name()); }
-  QString toolTip() const Q_DECL_OVERRIDE;
+  CGAL::Three::Scene_item* clone() const override { return nullptr; }
+  QString name() const override { return tr("%1_transformed").arg(d->pts_item->name()); }
+  QString toolTip() const override;
 
-  bool isEmpty() const Q_DECL_OVERRIDE { return (d->nb_points == 0); }
+  bool isEmpty() const override { return (d->nb_points == 0); }
 
   void updateCache();
 
-  virtual bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE { return m == Points ; }
+  virtual bool supportsRenderingMode(RenderingMode m) const override { return m == Points ; }
 
-  virtual void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
-  void initializeBuffers(CGAL::Three::Viewer_interface* v) const Q_DECL_OVERRIDE;
+  virtual void invalidateOpenGLBuffers() override;
+  void initializeBuffers(CGAL::Three::Viewer_interface* v) const override;
 
-  void compute_bbox() const Q_DECL_OVERRIDE;
-  void computeElements() const Q_DECL_OVERRIDE;
-  void drawPoints(CGAL::Three::Viewer_interface *viewer) const Q_DECL_OVERRIDE;
+  void compute_bbox() const override;
+  void computeElements() const override;
+  void drawPoints(CGAL::Three::Viewer_interface *viewer) const override;
 };
 
 #endif // SCENE_AFF_TRANSFORMED_POINT_SET_ITEM_H
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_polygon_soup_item.h b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_polygon_soup_item.h
index 4222fb455d33..08c2decbd152 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_polygon_soup_item.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_polygon_soup_item.h
@@ -96,23 +96,23 @@ class SCENE_AFF_TRANSFORMED_POLYGON_SOUP_ITEM_EXPORT Scene_aff_transformed_polyg
   ~Scene_aff_transformed_polygon_soup_item();
 
   Scene_polygon_soup_item* item() { return d->ps_item; }
-  const CGAL::qglviewer::Vec& center() const Q_DECL_OVERRIDE { return d->center_; }
+  const CGAL::qglviewer::Vec& center() const override { return d->center_; }
 
-  CGAL::Three::Scene_item* clone() const Q_DECL_OVERRIDE { return nullptr; }
-  QString name() const Q_DECL_OVERRIDE { return tr("%1_transformed").arg(d->ps_item->name()); }
-  QString toolTip() const Q_DECL_OVERRIDE;
+  CGAL::Three::Scene_item* clone() const override { return nullptr; }
+  QString name() const override { return tr("%1_transformed").arg(d->ps_item->name()); }
+  QString toolTip() const override;
 
   void updateCache();
 
-  bool isEmpty() const Q_DECL_OVERRIDE { return (d->nb_lines == 0); }
+  bool isEmpty() const override { return (d->nb_lines == 0); }
 
-  virtual bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE { return m == Wireframe ; }
-  virtual void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
-  void initializeBuffers(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE;
+  virtual bool supportsRenderingMode(RenderingMode m) const override { return m == Wireframe ; }
+  virtual void invalidateOpenGLBuffers() override;
+  void initializeBuffers(CGAL::Three::Viewer_interface*) const override;
 
-  void compute_bbox() const Q_DECL_OVERRIDE;
-  void computeElements() const Q_DECL_OVERRIDE;
-  void drawEdges(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE;
+  void compute_bbox() const override;
+  void computeElements() const override;
+  void drawEdges(CGAL::Three::Viewer_interface*) const override;
 };
 
 #endif // SCENE_AFF_TRANSFORMED_POLYGON_SOUP_ITEM_H
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_surface_mesh_item.h b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_surface_mesh_item.h
index 38ad5b0b124a..849ba139991c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_surface_mesh_item.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Scene_aff_transformed_surface_mesh_item.h
@@ -91,23 +91,23 @@ class SCENE_AFF_TRANSFORMED_SURFACE_MESH_ITEM_EXPORT Scene_aff_transformed_surfa
   ~Scene_aff_transformed_surface_mesh_item();
 
   Scene_surface_mesh_item* item() { return d->sm_item; }
-  const CGAL::qglviewer::Vec& center() const Q_DECL_OVERRIDE { return d->center_; }
+  const CGAL::qglviewer::Vec& center() const override { return d->center_; }
 
-  CGAL::Three::Scene_item* clone() const Q_DECL_OVERRIDE { return nullptr; }
-  QString name() const Q_DECL_OVERRIDE { return tr("%1_transformed").arg(d->sm_item->name()); }
-  QString toolTip() const Q_DECL_OVERRIDE;
+  CGAL::Three::Scene_item* clone() const override { return nullptr; }
+  QString name() const override { return tr("%1_transformed").arg(d->sm_item->name()); }
+  QString toolTip() const override;
 
-  bool isEmpty() const Q_DECL_OVERRIDE { return (d->nb_lines == 0); }
+  bool isEmpty() const override { return (d->nb_lines == 0); }
 
   void updateCache();
 
-  virtual bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE { return m == Wireframe ; }
-  virtual void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
-  void initializeBuffers(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE;
+  virtual bool supportsRenderingMode(RenderingMode m) const override { return m == Wireframe ; }
+  virtual void invalidateOpenGLBuffers() override;
+  void initializeBuffers(CGAL::Three::Viewer_interface*) const override;
 
-  void compute_bbox() const Q_DECL_OVERRIDE;
-  void computeElements() const Q_DECL_OVERRIDE;
-  void drawEdges(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE;
+  void compute_bbox() const override;
+  void computeElements() const override;
+  void drawEdges(CGAL::Three::Viewer_interface*) const override;
 };
 
 #endif // SCENE_AFF_TRANSFORMED_SURFACE_MESH_ITEM_H
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Engrave_text_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Engrave_text_plugin.cpp
index dc45cd9ce624..8c3048eaa3ff 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Engrave_text_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Engrave_text_plugin.cpp
@@ -320,7 +320,7 @@ public :
   }
   void init(QMainWindow*,
             CGAL::Three::Scene_interface*,
-            Messages_interface* m) Q_DECL_OVERRIDE{
+            Messages_interface* m) override{
     //get refs
     this->scene = Three::scene();
     this->mw = Three::mainWindow();
@@ -436,12 +436,12 @@ public :
     dock_widget->graphicsView->installEventFilter(navigation);
     dock_widget->graphicsView->viewport()->installEventFilter(navigation);
   }
-  bool applicable(QAction*) const Q_DECL_OVERRIDE
+  bool applicable(QAction*) const override
   {
     return qobject_cast<Scene_polyhedron_selection_item*>
         (scene->item(scene->mainSelectionIndex()));
   }
-  QList<QAction*> actions() const Q_DECL_OVERRIDE{
+  QList<QAction*> actions() const override{
     return _actions;
   }
 public Q_SLOTS:
@@ -825,7 +825,7 @@ public Q_SLOTS:
     QApplication::restoreOverrideCursor();
   }
 
-  void closure()Q_DECL_OVERRIDE
+  void closure()override
   {
     dock_widget->hide();
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
index f459ae84894b..a2647094914c 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Extrude_plugin.cpp
@@ -56,11 +56,11 @@ public :
     setTriangleContainer(0, new Tc(Vi::PROGRAM_WITH_LIGHT, false));
   }
   // Indicates if rendering mode is supported
-  bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE {
+  bool supportsRenderingMode(RenderingMode m) const override {
     return (m == Gouraud);
   }
   //Displays the item
-  void draw(Viewer_interface* viewer) const Q_DECL_OVERRIDE
+  void draw(Viewer_interface* viewer) const override
   {
     if(!isInit(viewer))
       initGL(viewer);
@@ -89,7 +89,7 @@ public :
     tc->setColor(this->color());
     tc->draw(viewer, true);
   }
-  void invalidateOpenGLBuffers() Q_DECL_OVERRIDE
+  void invalidateOpenGLBuffers() override
   {
     for(CGAL::QGLViewer* v : CGAL::QGLViewer::QGLViewerPool())
     {
@@ -101,13 +101,13 @@ public :
     }
     getTriangleContainer(0)->reset_vbos(ALL);
   }
-  void compute_bbox() const Q_DECL_OVERRIDE {}
-  Scene_item* clone() const Q_DECL_OVERRIDE {return 0;}
-  QString toolTip() const Q_DECL_OVERRIDE {return QString();}
+  void compute_bbox() const override {}
+  Scene_item* clone() const override {return 0;}
+  QString toolTip() const override {return QString();}
   Vec center()const { return center_; }
-  Scene_item::ManipulatedFrame* manipulatedFrame() Q_DECL_OVERRIDE { return frame; }
-  bool manipulatable() const Q_DECL_OVERRIDE { return true; }
-  bool eventFilter(QObject *, QEvent *event) Q_DECL_OVERRIDE
+  Scene_item::ManipulatedFrame* manipulatedFrame() override { return frame; }
+  bool manipulatable() const override { return true; }
+  bool eventFilter(QObject *, QEvent *event) override
   {
     if(event->type() == QEvent::KeyPress || event->type() == QEvent::KeyRelease)
     {
@@ -130,7 +130,7 @@ public :
   double length()const { return length_; }
 private:
   //make an arrow showing the length and direction of the transformation for the extrusion.
-  void initializeBuffers(Viewer_interface *viewer)const Q_DECL_OVERRIDE
+  void initializeBuffers(Viewer_interface *viewer)const override
   {
     std::vector<float> vertices;
     std::vector<float> normals;
@@ -319,7 +319,7 @@ class ExtrudePlugin :
   Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0" FILE "extrude_plugin.json")
 public:
 
-  bool applicable(QAction* action) const Q_DECL_OVERRIDE
+  bool applicable(QAction* action) const override
   {
     if(action == actionCreateItem)
     {
@@ -332,12 +332,12 @@ class ExtrudePlugin :
     return false;
   }
 
-  QList<QAction*> actions() const Q_DECL_OVERRIDE
+  QList<QAction*> actions() const override
   {
     return _actions;
   }
 
-  void init(QMainWindow* mainWindow, Scene_interface* sc, Messages_interface* mi) Q_DECL_OVERRIDE
+  void init(QMainWindow* mainWindow, Scene_interface* sc, Messages_interface* mi) override
   {
     this->messageInterface = mi;
     this->scene = sc;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Alpha_shape_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Alpha_shape_plugin.cpp
index 572f2a698a08..0c9bf82f8afb 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Point_set/Alpha_shape_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Point_set/Alpha_shape_plugin.cpp
@@ -78,18 +78,18 @@ class Scene_alpha_shape_item : public CGAL::Three::Scene_item_rendering_helper
   Q_OBJECT
 public :
   Scene_alpha_shape_item(Scene_points_with_normal_item* , int alpha);
-  bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE {
+  bool supportsRenderingMode(RenderingMode m) const override {
     return (m == Flat);
   }
-  void draw(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE;
-  void drawPoints(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE;
-  void invalidateOpenGLBuffers()Q_DECL_OVERRIDE;
-  void computeElements() const Q_DECL_OVERRIDE;
-  Scene_item* clone() const Q_DECL_OVERRIDE{return 0;}
-  QString toolTip() const Q_DECL_OVERRIDE{return QString();}
-  bool isEmpty() const Q_DECL_OVERRIDE{ return false;}
-  bool isFinite() const Q_DECL_OVERRIDE{ return true;}
-  void compute_bbox() const Q_DECL_OVERRIDE {}
+  void draw(CGAL::Three::Viewer_interface* viewer) const override;
+  void drawPoints(CGAL::Three::Viewer_interface* viewer) const override;
+  void invalidateOpenGLBuffers()override;
+  void computeElements() const override;
+  Scene_item* clone() const override{return 0;}
+  QString toolTip() const override{return QString();}
+  bool isEmpty() const override{ return false;}
+  bool isFinite() const override{ return true;}
+  void compute_bbox() const override {}
   Alpha_shape_3 alpha_shape;
   void createPolygonSoup(std::vector<Kernel::Point_3>& points,
                          std::vector<std::vector<std::size_t> >& polys) const;
@@ -99,7 +99,7 @@ public Q_SLOTS:
 private:
   mutable std::vector<float> vertices;
   mutable std::vector<unsigned int> indices;
-  void initializeBuffers(CGAL::Three::Viewer_interface *viewer)const Q_DECL_OVERRIDE;
+  void initializeBuffers(CGAL::Three::Viewer_interface *viewer)const override;
   Point_set point_set;
 }; //end of class Scene_alpha_shape_item
 
@@ -134,7 +134,7 @@ class Q_DECL_EXPORT Alpha_shape_plugin :
   Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0")
 public :
 
-  void init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* scene_interface, Messages_interface*)Q_DECL_OVERRIDE {
+  void init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* scene_interface, Messages_interface*)override {
     this->scene = scene_interface;
     this->mw = mainWindow;
     QAction* actionAlphaShapes= new QAction("Alpha Shapes", mw);
@@ -167,11 +167,11 @@ public :
 
 
   }
-  bool applicable(QAction*) const Q_DECL_OVERRIDE
+  bool applicable(QAction*) const override
   {
     return qobject_cast<Scene_points_with_normal_item*>( scene->item( scene->mainSelectionIndex() ) );
   }
-  QList<QAction*> actions() const Q_DECL_OVERRIDE {
+  QList<QAction*> actions() const override {
     return _actions;
   }
 public Q_SLOTS:
@@ -260,7 +260,7 @@ public Q_SLOTS:
       dock_widget->poly_itemPushButton->setEnabled(true);
     }
   }
-  void closure() Q_DECL_OVERRIDE
+  void closure() override
   {
     dock_widget->hide();
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Basic_item_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Basic_item_plugin.cpp
index 7be6b48736a8..6aaaf519c940 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Basic_item_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Basic_item_plugin.cpp
@@ -20,18 +20,18 @@ class BasicItemPlugin :
 public:
   //! [applicable]
   //This plugin is only applicable if there is exactly one selected item.
-  bool applicable(QAction*) const Q_DECL_OVERRIDE
+  bool applicable(QAction*) const override
   {
     return scene->selectionIndices().size() ==1;
   }
   //! [applicable]
   //the list of the actions of the plugin.
-  QList<QAction*> actions() const Q_DECL_OVERRIDE
+  QList<QAction*> actions() const override
   {
     return _actions;
   }
   //this acts like a constructor for the plugin. It gets the references to the mainwindow and the scene, and connects the action.
-  void init(QMainWindow* mw, CGAL::Three::Scene_interface* sc, Messages_interface*) Q_DECL_OVERRIDE
+  void init(QMainWindow* mw, CGAL::Three::Scene_interface* sc, Messages_interface*) override
   {
     //get the references
     this->scene = sc;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Basic_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Basic_plugin.cpp
index 6c4e3484f9c5..0edb4560030f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Basic_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Basic_plugin.cpp
@@ -43,17 +43,17 @@ class BasicPlugin :
   Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0")
 public:
   //decides if the plugin's actions will be displayed or not.
-  bool applicable(QAction*) const Q_DECL_OVERRIDE
+  bool applicable(QAction*) const override
   {
     return true;
   }
   //the list of the actions of the plugin.
-  QList<QAction*> actions() const Q_DECL_OVERRIDE
+  QList<QAction*> actions() const override
   {
     return _actions;
   }
   //this acts like a constructor for the plugin. It gets the references to the main window and the scene, and connects the action.
-  void init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* sc, Messages_interface*) Q_DECL_OVERRIDE
+  void init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* sc, Messages_interface*) override
   {
     //get the references
     this->scene = sc;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Dock_widget_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Dock_widget_plugin.cpp
index 2fc76f1c03a2..392b89540a25 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Dock_widget_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Dock_widget_plugin.cpp
@@ -29,18 +29,18 @@ class BasicPlugin :
   Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0")
 public:
   //decides if the plugin's actions will be displayed or not.
-  bool applicable(QAction*) const Q_DECL_OVERRIDE
+  bool applicable(QAction*) const override
   {
     return true;
   }
   //the list of the actions of the plugin.
-  QList<QAction*> actions() const Q_DECL_OVERRIDE
+  QList<QAction*> actions() const override
   {
     return _actions;
   }
   //! [init]
   //this acts like a constructor for the plugin. It gets the references to the mainwindow and the scene, and connects the action.
-  void init(QMainWindow* mw, CGAL::Three::Scene_interface* sc, Messages_interface*) Q_DECL_OVERRIDE
+  void init(QMainWindow* mw, CGAL::Three::Scene_interface* sc, Messages_interface*) override
   {
     //get the references
     this->scene = sc;
@@ -83,7 +83,7 @@ private Q_SLOTS:
   }
   //! [action]
   //! [closure]
-  void closure()Q_DECL_OVERRIDE
+  void closure()override
   {
     dock_widget->hide();
   }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Example_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Example_plugin.cpp
index 127ece2b53f9..ec18b4657542 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Example_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Three_examples/Example_plugin.cpp
@@ -29,30 +29,30 @@ public :
                       double cx,double cy, double cz);
 
   // Indicates if rendering mode is supported
-  bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE {
+  bool supportsRenderingMode(RenderingMode m) const override {
     return (m == Flat);
   }
 
   //Displays the item
-  void draw(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE;
+  void draw(CGAL::Three::Viewer_interface* viewer) const override;
 
   //Specifies that the buffers need to be initialized again.
   //Is mostly called after a change of geometry in the data.
-  void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
+  void invalidateOpenGLBuffers() override;
 
   //fills the std::vector
-  void computeElements() const Q_DECL_OVERRIDE;
+  void computeElements() const override;
 
-  Scene_item* clone() const Q_DECL_OVERRIDE {return 0;}
-  QString toolTip() const Q_DECL_OVERRIDE {return QString();}
-  void compute_bbox() const Q_DECL_OVERRIDE { _bbox = Bbox(); }
+  Scene_item* clone() const override {return 0;}
+  QString toolTip() const override {return QString();}
+  void compute_bbox() const override { _bbox = Bbox(); }
 
 private:
   //contains the data
   mutable std::vector<float> vertices;
   mutable std::size_t nb_pos;
   //Fills the buffers with data. The buffers allow us to give data to the shaders.
-  void initializeBuffers(Viewer_interface *viewer) const Q_DECL_OVERRIDE;
+  void initializeBuffers(Viewer_interface *viewer) const override;
 }; //end of class Scene_triangle_item
 //! [itemdeclaration]
 Scene_triangle_item::Scene_triangle_item(double ax,double ay, double az,
@@ -152,7 +152,7 @@ class Q_DECL_EXPORT Polyhedron_demo_example_plugin :
 
 public :
   // Adds an action to the menu and configures the widget
-  void init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* scene_interface, Messages_interface*) Q_DECL_OVERRIDE{
+  void init(QMainWindow* mainWindow, CGAL::Three::Scene_interface* scene_interface, Messages_interface*) override{
     //get the references
     this->scene = scene_interface;
     this->mw = mainWindow;
@@ -165,11 +165,11 @@ public :
       _actions << actionDrawTriangle;
     }
   }
-  bool applicable(QAction*) const Q_DECL_OVERRIDE
+  bool applicable(QAction*) const override
   {
     return true;
   }
-  QList<QAction*> actions() const Q_DECL_OVERRIDE{
+  QList<QAction*> actions() const override{
     return _actions;
   }
 
diff --git a/Polyhedron/demo/Polyhedron/Scene.h b/Polyhedron/demo/Polyhedron/Scene.h
index 7c42806b23f2..2d0a0cb2c7c9 100644
--- a/Polyhedron/demo/Polyhedron/Scene.h
+++ b/Polyhedron/demo/Polyhedron/Scene.h
@@ -51,22 +51,22 @@ class SCENE_EXPORT Scene  :
                  NumberOfColumns = LastColumn + 1};
   Scene(QObject*  parent);
   ~Scene();
-  int addItem(CGAL::Three::Scene_item* item) Q_DECL_OVERRIDE;
-  void addChild(Scene_item* item) Q_DECL_OVERRIDE;
-  Q_INVOKABLE void changeGroup(CGAL::Three::Scene_item* item, CGAL::Three::Scene_group_item* target_group) Q_DECL_OVERRIDE;
-  CGAL::Three::Scene_item* replaceItem(int index, CGAL::Three::Scene_item* item, bool emit_item_about_to_be_destroyed = false) Q_DECL_OVERRIDE;
-  Q_INVOKABLE int erase(int) Q_DECL_OVERRIDE;
+  int addItem(CGAL::Three::Scene_item* item) override;
+  void addChild(Scene_item* item) override;
+  Q_INVOKABLE void changeGroup(CGAL::Three::Scene_item* item, CGAL::Three::Scene_group_item* target_group) override;
+  CGAL::Three::Scene_item* replaceItem(int index, CGAL::Three::Scene_item* item, bool emit_item_about_to_be_destroyed = false) override;
+  Q_INVOKABLE int erase(int) override;
 
-  int erase(QList<int>) Q_DECL_OVERRIDE;
-  int duplicate(int index) Q_DECL_OVERRIDE;
+  int erase(QList<int>) override;
+  int duplicate(int index) override;
 
   // Accessors (getters)
-  int numberOfEntries() const Q_DECL_OVERRIDE;
+  int numberOfEntries() const override;
   // returns the list of items.
   const QList<CGAL::Three::Scene_item*>& entries() const { return m_entries; }
 
-  Q_INVOKABLE CGAL::Three::Scene_item* item(int) const Q_DECL_OVERRIDE;
-  int item_id(CGAL::Three::Scene_item*) const Q_DECL_OVERRIDE;
+  Q_INVOKABLE CGAL::Three::Scene_item* item(int) const override;
+  int item_id(CGAL::Three::Scene_item*) const override;
 
   //! \todo Replace Index based selection functionality with those
   //! functions.
@@ -77,28 +77,28 @@ class SCENE_EXPORT Scene  :
   QList<CGAL::Three::Scene_item*> selectionB() const;
   ///@}
 
-  int mainSelectionIndex() const Q_DECL_OVERRIDE;
-  QList<int> selectionIndices() const Q_DECL_OVERRIDE;
-  int selectionAindex() const Q_DECL_OVERRIDE;
-  int selectionBindex() const Q_DECL_OVERRIDE;
-  void initializeGL(CGAL::Three::Viewer_interface*) Q_DECL_OVERRIDE;
+  int mainSelectionIndex() const override;
+  QList<int> selectionIndices() const override;
+  int selectionAindex() const override;
+  int selectionBindex() const override;
+  void initializeGL(CGAL::Three::Viewer_interface*) override;
   void initGL(CGAL::Three::Viewer_interface* viewer);
-  void setPickedPixel(const QPoint &p) Q_DECL_OVERRIDE {picked_pixel = p;}
-  void draw(CGAL::Three::Viewer_interface*) Q_DECL_OVERRIDE;
-  void drawWithNames(CGAL::Three::Viewer_interface*) Q_DECL_OVERRIDE;
-  bool keyPressEvent(QKeyEvent* e) Q_DECL_OVERRIDE;
+  void setPickedPixel(const QPoint &p) override {picked_pixel = p;}
+  void draw(CGAL::Three::Viewer_interface*) override;
+  void drawWithNames(CGAL::Three::Viewer_interface*) override;
+  bool keyPressEvent(QKeyEvent* e) override;
   void printPrimitiveId(QPoint point,
-                        CGAL::Three::Viewer_interface*) Q_DECL_OVERRIDE;
-  void printVertexIds() Q_DECL_OVERRIDE;
-  void printEdgeIds() Q_DECL_OVERRIDE;
-  void printFaceIds() Q_DECL_OVERRIDE;
-  void printAllIds() Q_DECL_OVERRIDE;
+                        CGAL::Three::Viewer_interface*) override;
+  void printVertexIds() override;
+  void printEdgeIds() override;
+  void printFaceIds() override;
+  void printAllIds() override;
   //!Re-computes the primitiveIds for `item`
-  void updatePrimitiveIds(Scene_item *item) Q_DECL_OVERRIDE;
-  bool testDisplayId(double x, double y, double z, CGAL::Three::Viewer_interface* viewer) Q_DECL_OVERRIDE;
-  Bbox bbox() const Q_DECL_OVERRIDE;
+  void updatePrimitiveIds(Scene_item *item) override;
+  bool testDisplayId(double x, double y, double z, CGAL::Three::Viewer_interface* viewer) override;
+  Bbox bbox() const override;
   void computeBbox();
-  double len_diagonal() const Q_DECL_OVERRIDE
+  double len_diagonal() const override
   {
     Bbox box = bbox();
     double dx = box.xmax() - box.xmin();
@@ -114,19 +114,19 @@ class SCENE_EXPORT Scene  :
   // QStandardItemModel functions
   //Defines the behavior when a name is drag-and-dropped in the Geometric Objects view
   bool dropMimeData(const QMimeData *, Qt::DropAction, int, int,
-                    const QModelIndex &parent) Q_DECL_OVERRIDE;
+                    const QModelIndex &parent) override;
   //Contains the text and icons of an item in the Geometric Objects view
   QVariant data ( const QModelIndex & index,
-                  int role = ::Qt::DisplayRole ) const Q_DECL_OVERRIDE;
+                  int role = ::Qt::DisplayRole ) const override;
   //@returns the type of data correspondind to the role.
   QVariant headerData ( int section, ::Qt::Orientation orientation,
-                        int role = ::Qt::DisplayRole ) const Q_DECL_OVERRIDE;
+                        int role = ::Qt::DisplayRole ) const override;
   //@returns the flags for the item at the target index.
-  ::Qt::ItemFlags flags ( const QModelIndex & index ) const Q_DECL_OVERRIDE;
+  ::Qt::ItemFlags flags ( const QModelIndex & index ) const override;
   // Sets the column data for the target index. Returns false if index is not valid and
   // if role is not EditRole.
   bool setData(const QModelIndex &index, const QVariant &value,
-               int role) Q_DECL_OVERRIDE;
+               int role) override;
 
   //Returns a list of all the items.
   QList<CGAL::Three::Scene_item*> item_entries() const ;
@@ -142,8 +142,8 @@ class SCENE_EXPORT Scene  :
   void addGroup(Scene_group_item* group);
 
   void zoomToPosition(QPoint point,
-                        CGAL::Three::Viewer_interface*) Q_DECL_OVERRIDE;
-  void setUpdatesEnabled(bool b) Q_DECL_OVERRIDE
+                        CGAL::Three::Viewer_interface*) override;
+  void setUpdatesEnabled(bool b) override
   {
     dont_emit_changes = !b;
     if(!b)
@@ -157,12 +157,12 @@ public Q_SLOTS:
   void setCollapsed(QModelIndex);
   //!Transmits a CGAL::Three::Scene_item::itemChanged() signal to the scene.
   void itemChanged();
-  void itemChanged(int i) Q_DECL_OVERRIDE;
-  void itemChanged(CGAL::Three::Scene_item*) Q_DECL_OVERRIDE;
-  void allItemsChanged() Q_DECL_OVERRIDE;
+  void itemChanged(int i) override;
+  void itemChanged(CGAL::Three::Scene_item*) override;
+  void allItemsChanged() override;
   //!Transmits a CGAL::Three::Scene_item::itemVisibilityChanged() signal to the scene.
   void itemVisibilityChanged();
-  void itemVisibilityChanged(CGAL::Three::Scene_item*) Q_DECL_OVERRIDE;
+  void itemVisibilityChanged(CGAL::Three::Scene_item*) override;
   //!Removes `item` from all the groups of the scene.
   void remove_item_from_groups(CGAL::Three::Scene_item* item);
   //!Re-organizes the sceneView.
@@ -175,7 +175,7 @@ public Q_SLOTS:
     selected_item = i;
     Q_EMIT itemIndexSelected(i);
   }
-  void setSelectedItem(int i ) Q_DECL_OVERRIDE
+  void setSelectedItem(int i ) override
   {
     selected_item = i;
     Q_EMIT selectionChanged(i);
diff --git a/Polyhedron/demo/Polyhedron/Scene_lcc_item.h b/Polyhedron/demo/Polyhedron/Scene_lcc_item.h
index 6a07dfb522a5..828f44b97ffb 100644
--- a/Polyhedron/demo/Polyhedron/Scene_lcc_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_lcc_item.h
@@ -27,26 +27,26 @@ class SCENE_LCC_ITEM_EXPORT Scene_lcc_item : public CGAL::Three::Scene_item_rend
   Scene_lcc_item(const LCC &lcc);
   ~Scene_lcc_item();
 
-  bool isEmpty()const Q_DECL_OVERRIDE;
-  bool isFinite() const Q_DECL_OVERRIDE { return true; }
+  bool isEmpty()const override;
+  bool isFinite() const override { return true; }
 
-  Scene_lcc_item* clone() const Q_DECL_OVERRIDE ;
-  bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE ;
-  QString toolTip() const Q_DECL_OVERRIDE ;
-  void compute_bbox()const Q_DECL_OVERRIDE;
+  Scene_lcc_item* clone() const override ;
+  bool supportsRenderingMode(RenderingMode m) const override ;
+  QString toolTip() const override ;
+  void compute_bbox()const override;
 
 
-  void draw(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE ;
-  void drawEdges(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE ;
-  void drawPoints(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE ;
+  void draw(CGAL::Three::Viewer_interface*) const override ;
+  void drawEdges(CGAL::Three::Viewer_interface*) const override ;
+  void drawPoints(CGAL::Three::Viewer_interface*) const override ;
 
-  void computeElements() const Q_DECL_OVERRIDE;
-  void initializeBuffers(CGAL::Three::Viewer_interface *) const Q_DECL_OVERRIDE;
+  void computeElements() const override;
+  void initializeBuffers(CGAL::Three::Viewer_interface *) const override;
 
-  QMenu* contextMenu() Q_DECL_OVERRIDE ;
+  QMenu* contextMenu() override ;
 
 public Q_SLOTS:
-    void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
+    void invalidateOpenGLBuffers() override;
     void randomFaceColors();
     void randomVolumeColors();
     void resetColors();
diff --git a/Polyhedron/demo/Polyhedron/Scene_plane_item.h b/Polyhedron/demo/Polyhedron/Scene_plane_item.h
index 7cbf72b32881..b2b210671eb7 100644
--- a/Polyhedron/demo/Polyhedron/Scene_plane_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_plane_item.h
@@ -61,27 +61,27 @@ class SCENE_BASIC_OBJECTS_EXPORT Scene_plane_item
                             zdelta*zdelta);
     return diag * 0.7;
   }
-  bool isFinite() const Q_DECL_OVERRIDE { return false; }
-  bool isEmpty() const Q_DECL_OVERRIDE { return false; }
-  void compute_bbox() const Q_DECL_OVERRIDE { _bbox = Bbox(); }
-  bool manipulatable() const Q_DECL_OVERRIDE;
-  ManipulatedFrame* manipulatedFrame() Q_DECL_OVERRIDE;
-  QMenu* contextMenu() Q_DECL_OVERRIDE;
+  bool isFinite() const override { return false; }
+  bool isEmpty() const override { return false; }
+  void compute_bbox() const override { _bbox = Bbox(); }
+  bool manipulatable() const override;
+  ManipulatedFrame* manipulatedFrame() override;
+  QMenu* contextMenu() override;
 
-  Scene_plane_item* clone() const Q_DECL_OVERRIDE ;
+  Scene_plane_item* clone() const override ;
 
-  QString toolTip() const Q_DECL_OVERRIDE ;
+  QString toolTip() const override ;
 
   // Indicate if rendering mode is supported
-  bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE{
+  bool supportsRenderingMode(RenderingMode m) const override{
     return (m == Wireframe || m == Flat || m == FlatPlusEdges);
   }
-  virtual void draw(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE;
-  virtual void drawEdges(CGAL::Three::Viewer_interface* viewer)const Q_DECL_OVERRIDE;
+  virtual void draw(CGAL::Three::Viewer_interface*) const override;
+  virtual void drawEdges(CGAL::Three::Viewer_interface* viewer)const override;
   Plane_3 plane(CGAL::qglviewer::Vec offset = CGAL::qglviewer::Vec(0,0,0)) const;
 
 public Q_SLOTS:
-  virtual void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
+  virtual void invalidateOpenGLBuffers() override;
 
   void setPosition(float x, float y, float z);
 
@@ -121,8 +121,8 @@ public Q_SLOTS:
   mutable bool smooth_shading;
   mutable QOpenGLShaderProgram *program;
 
-  void initializeBuffers(CGAL::Three::Viewer_interface *) const Q_DECL_OVERRIDE;
-  void computeElements() const Q_DECL_OVERRIDE;
+  void initializeBuffers(CGAL::Three::Viewer_interface *) const override;
+  void computeElements() const override;
 };
 
 #endif // SCENE_PLANE_ITEM_H
diff --git a/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.h b/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.h
index e306b96dee22..05a7723b3eb6 100644
--- a/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_points_with_normal_item.h
@@ -41,13 +41,13 @@ class SCENE_POINTS_WITH_NORMAL_ITEM_EXPORT Scene_points_with_normal_item
 
   ~Scene_points_with_normal_item();
 
-  Scene_points_with_normal_item* clone() const Q_DECL_OVERRIDE;
+  Scene_points_with_normal_item* clone() const override;
 
   // Is selection empty?
   virtual bool isSelectionEmpty() const;
 
   // Function to override the context menu
-  QMenu* contextMenu() Q_DECL_OVERRIDE;
+  QMenu* contextMenu() override;
 
   // IO
   bool read_ply_point_set(std::istream& in);
@@ -58,15 +58,15 @@ class SCENE_POINTS_WITH_NORMAL_ITEM_EXPORT Scene_points_with_normal_item
   bool write_xyz_point_set(std::ostream& out) const;
 
   // Function for displaying meta-data of the item
-  virtual QString toolTip() const Q_DECL_OVERRIDE;
+  virtual QString toolTip() const override;
 
-  virtual void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
+  virtual void invalidateOpenGLBuffers() override;
 
   // Indicate if rendering mode is supported
-  virtual bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE;
+  virtual bool supportsRenderingMode(RenderingMode m) const override;
 
-  virtual void drawEdges(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE;
-  virtual void drawPoints(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE;
+  virtual void drawEdges(CGAL::Three::Viewer_interface* viewer) const override;
+  virtual void drawPoints(CGAL::Three::Viewer_interface*) const override;
 
   // Gets wrapped point set
   Point_set*       point_set();
@@ -77,19 +77,19 @@ class SCENE_POINTS_WITH_NORMAL_ITEM_EXPORT Scene_points_with_normal_item
   const std::string& comments() const;
 
   // Gets dimensions
-  virtual bool isFinite() const Q_DECL_OVERRIDE { return true; }
-  virtual bool isEmpty() const Q_DECL_OVERRIDE;
-  virtual void compute_bbox() const Q_DECL_OVERRIDE;
+  virtual bool isFinite() const override { return true; }
+  virtual bool isEmpty() const override;
+  virtual void compute_bbox() const override;
 
   // computes the local point spacing (aka radius) of each point
   void computes_local_spacing(int k);
 
   bool has_normals() const;
-  void copyProperties(Scene_item *) Q_DECL_OVERRIDE;
+  void copyProperties(Scene_item *) override;
   int getNormalSliderValue();
   int getPointSliderValue();
-  void computeElements() const Q_DECL_OVERRIDE;
-  void initializeBuffers(CGAL::Three::Viewer_interface *) const Q_DECL_OVERRIDE;
+  void computeElements() const override;
+  void initializeBuffers(CGAL::Three::Viewer_interface *) const override;
 
 public Q_SLOTS:
   // Delete selection
@@ -106,7 +106,7 @@ public Q_SLOTS:
   void pointSliderPressed();
   //Set the status of the slider as `released`
   void pointSliderReleased();
-  void itemAboutToBeDestroyed(Scene_item *) Q_DECL_OVERRIDE;
+  void itemAboutToBeDestroyed(Scene_item *) override;
   void setPointSize(int size);
   void setNormalSize(int size);
   void resetColors();
@@ -116,7 +116,7 @@ public Q_SLOTS:
   Scene_points_with_normal_item_priv* d;
 
 public:
- void zoomToPosition(const QPoint &, CGAL::Three::Viewer_interface *)const Q_DECL_OVERRIDE;
+ void zoomToPosition(const QPoint &, CGAL::Three::Viewer_interface *)const override;
 }; // end class Scene_points_with_normal_item
 
 
diff --git a/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.h b/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.h
index 5d87338bd156..4169a0dd0649 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.h
@@ -112,7 +112,7 @@ class SCENE_POLYGON_SOUP_ITEM_EXPORT Scene_polygon_soup_item
     Scene_polygon_soup_item();
     ~Scene_polygon_soup_item();
 
-    Scene_polygon_soup_item* clone() const Q_DECL_OVERRIDE;
+    Scene_polygon_soup_item* clone() const override;
 
     template <class Point, typename Polygon>
     void load(const std::vector<Point>& points, const std::vector<Polygon>& polygons);
@@ -129,19 +129,19 @@ class SCENE_POLYGON_SOUP_ITEM_EXPORT Scene_polygon_soup_item
     bool save(std::ostream& out) const;
     std::vector<CGAL::IO::Color> getVColors() const;
     std::vector<CGAL::IO::Color> getFColors() const;
-    QString toolTip() const Q_DECL_OVERRIDE;
+    QString toolTip() const override;
 
     // Indicate if rendering mode is supported
-    virtual bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE{ return ( m!=PointsPlusNormals && m!=ShadedPoints); }
+    virtual bool supportsRenderingMode(RenderingMode m) const override{ return ( m!=PointsPlusNormals && m!=ShadedPoints); }
     // OpenGL drawing in a display list
-    virtual void draw() const Q_DECL_OVERRIDE{}
-    virtual void draw(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE;
-    virtual void drawPoints(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE;
-    virtual void drawEdges(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE;
-    void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
-    bool isFinite() const Q_DECL_OVERRIDE{ return true; }
-    bool isEmpty() const Q_DECL_OVERRIDE;
-    void compute_bbox() const Q_DECL_OVERRIDE;
+    virtual void draw() const override{}
+    virtual void draw(CGAL::Three::Viewer_interface*) const override;
+    virtual void drawPoints(CGAL::Three::Viewer_interface*) const override;
+    virtual void drawEdges(CGAL::Three::Viewer_interface* viewer) const override;
+    void invalidateOpenGLBuffers() override;
+    bool isFinite() const override{ return true; }
+    bool isEmpty() const override;
+    void compute_bbox() const override;
 
     void new_vertex(const double&, const double&, const double&);
     void new_triangle(const std::size_t, const std::size_t, const std::size_t);
@@ -151,8 +151,8 @@ class SCENE_POLYGON_SOUP_ITEM_EXPORT Scene_polygon_soup_item
     const Points& points() const;
     const Polygons& polygons() const;
     const Edges& non_manifold_edges() const;
-    void initializeBuffers(CGAL::Three::Viewer_interface *) const Q_DECL_OVERRIDE;
-    void computeElements() const Q_DECL_OVERRIDE;
+    void initializeBuffers(CGAL::Three::Viewer_interface *) const override;
+    void computeElements() const override;
 
     //statistics
     enum STATS
@@ -177,9 +177,9 @@ class SCENE_POLYGON_SOUP_ITEM_EXPORT Scene_polygon_soup_item
       MEAN_ANGLE
     };
 
-    bool has_stats()const Q_DECL_OVERRIDE{return true;}
-    QString computeStats(int type)Q_DECL_OVERRIDE;
-    CGAL::Three::Scene_item::Header_data header() const Q_DECL_OVERRIDE;
+    bool has_stats()const override{return true;}
+    QString computeStats(int type)override;
+    CGAL::Three::Scene_item::Header_data header() const override;
 public Q_SLOTS:
     void shuffle_orientations();
     bool orient(std::vector<std::size_t>& non_manifold_vertices);
@@ -190,7 +190,7 @@ public Q_SLOTS:
 
     void setDisplayNonManifoldEdges(const bool);
     bool displayNonManifoldEdges() const;
-    void itemAboutToBeDestroyed(Scene_item *item) Q_DECL_OVERRIDE;
+    void itemAboutToBeDestroyed(Scene_item *item) override;
 
 protected:
     friend struct Scene_polygon_soup_item_priv;
diff --git a/Polyhedron/demo/Polyhedron/Scene_polylines_item.h b/Polyhedron/demo/Polyhedron/Scene_polylines_item.h
index fc7d886de080..3bc9578f989f 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polylines_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_polylines_item.h
@@ -33,41 +33,41 @@ class SCENE_POLYLINES_ITEM_EXPORT Scene_polylines_item
       MAX_LENGTH,
       MEAN_LENGTH
     };
-    bool has_stats()const Q_DECL_OVERRIDE {return true;}
-    QString computeStats(int type)Q_DECL_OVERRIDE ;
-    CGAL::Three::Scene_item::Header_data header() const Q_DECL_OVERRIDE ;
+    bool has_stats()const override {return true;}
+    QString computeStats(int type)override ;
+    CGAL::Three::Scene_item::Header_data header() const override ;
 
-    bool isFinite() const Q_DECL_OVERRIDE { return true; }
-    bool isEmpty() const Q_DECL_OVERRIDE ;
-    void compute_bbox() const Q_DECL_OVERRIDE ;
-    Bbox bbox() const Q_DECL_OVERRIDE ;
+    bool isFinite() const override { return true; }
+    bool isEmpty() const override ;
+    void compute_bbox() const override ;
+    Bbox bbox() const override ;
 
-    Scene_polylines_item* clone() const Q_DECL_OVERRIDE ;
+    Scene_polylines_item* clone() const override ;
 
-    QString toolTip() const Q_DECL_OVERRIDE ;
+    QString toolTip() const override ;
 
     // Indicate if rendering mode is supported
-    bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE ;
+    bool supportsRenderingMode(RenderingMode m) const override ;
 
-    QMenu* contextMenu() Q_DECL_OVERRIDE ;
+    QMenu* contextMenu() override ;
 
-    void draw(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE ;
-    void drawEdges(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE ;
-    void drawPoints(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE ;
+    void draw(CGAL::Three::Viewer_interface*) const override ;
+    void drawEdges(CGAL::Three::Viewer_interface*) const override ;
+    void drawPoints(CGAL::Three::Viewer_interface*) const override ;
 
 
     void smooth(std::vector<Point_3>& polyline);
     //When selecting a polylineitem, we don't want to select its children, so
     //we can still apply Operations to it
-    QList<Scene_interface::Item_id> getChildrenForSelection() const Q_DECL_OVERRIDE {
+    QList<Scene_interface::Item_id> getChildrenForSelection() const override {
       return QList<Scene_interface::Item_id>();
     }
     void setWidth(int i);
-    void computeElements() const Q_DECL_OVERRIDE;
-    void initializeBuffers(Viewer_interface *) const Q_DECL_OVERRIDE;
+    void computeElements() const override;
+    void initializeBuffers(Viewer_interface *) const override;
 
 public Q_SLOTS:
-    void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
+    void invalidateOpenGLBuffers() override;
     void change_corner_radii(double);
     void change_corner_radii();
     void split_at_sharp_angles();
diff --git a/Polyhedron/demo/Polyhedron/Scene_spheres_item.h b/Polyhedron/demo/Polyhedron/Scene_spheres_item.h
index bebaf110da5e..dd365a16ac25 100644
--- a/Polyhedron/demo/Polyhedron/Scene_spheres_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_spheres_item.h
@@ -37,30 +37,30 @@ class SCENE_BASIC_OBJECTS_EXPORT Scene_spheres_item
 
   ~Scene_spheres_item();
 
-  bool isFinite() const Q_DECL_OVERRIDE{ return true; }
-  bool isEmpty() const Q_DECL_OVERRIDE{ return false; }
-  Scene_item* clone() const Q_DECL_OVERRIDE{return nullptr;}
-  QString toolTip() const Q_DECL_OVERRIDE;
-  bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE{
+  bool isFinite() const override{ return true; }
+  bool isEmpty() const override{ return false; }
+  Scene_item* clone() const override{return nullptr;}
+  QString toolTip() const override;
+  bool supportsRenderingMode(RenderingMode m) const override{
     return (m == Gouraud || m == Wireframe);
   }
-  void compute_bbox() const Q_DECL_OVERRIDE;
+  void compute_bbox() const override;
   void add_sphere(const Sphere &sphere, std::size_t index = 0, CGAL::IO::Color = CGAL::IO::Color(120,120,120));
   void clear_spheres();
   void setPrecision(int prec);
   void gl_initialization(CGAL::Three::Viewer_interface* viewer);
-  void draw(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE;
-  void drawEdges(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE;
-  void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
+  void draw(CGAL::Three::Viewer_interface* viewer) const override;
+  void drawEdges(CGAL::Three::Viewer_interface* viewer) const override;
+  void invalidateOpenGLBuffers() override;
   void setPlane(Kernel::Plane_3 p_plane);
   void setToolTip(QString s);
-  void setColor(QColor c) Q_DECL_OVERRIDE;
+  void setColor(QColor c) override;
   bool save(const std::string &file_name) const;
 
 
-  void initializeBuffers(Viewer_interface *) const Q_DECL_OVERRIDE;
-  void computeElements() const Q_DECL_OVERRIDE;
-  bool eventFilter(QObject *watched, QEvent *event)Q_DECL_OVERRIDE;
+  void initializeBuffers(Viewer_interface *) const override;
+  void computeElements() const override;
+  bool eventFilter(QObject *watched, QEvent *event)override;
 Q_SIGNALS:
   void on_color_changed();
   void picked(std::size_t id) const;
diff --git a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.h b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.h
index a4d655d17481..555f57f5fd53 100644
--- a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.h
@@ -58,19 +58,19 @@ class SCENE_SURFACE_MESH_ITEM_EXPORT Scene_surface_mesh_item
 
   ~Scene_surface_mesh_item();
 
-  Scene_surface_mesh_item* clone() const Q_DECL_OVERRIDE;
-  void draw(CGAL::Three::Viewer_interface *) const Q_DECL_OVERRIDE;
-  void drawEdges(CGAL::Three::Viewer_interface *) const Q_DECL_OVERRIDE;
-  void drawPoints(CGAL::Three::Viewer_interface *) const Q_DECL_OVERRIDE;
+  Scene_surface_mesh_item* clone() const override;
+  void draw(CGAL::Three::Viewer_interface *) const override;
+  void drawEdges(CGAL::Three::Viewer_interface *) const override;
+  void drawPoints(CGAL::Three::Viewer_interface *) const override;
 
-  bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE;
-  bool isFinite() const Q_DECL_OVERRIDE { return true; }
-  bool isEmpty() const Q_DECL_OVERRIDE;
-  Bbox bbox() const Q_DECL_OVERRIDE;
-  QString toolTip() const Q_DECL_OVERRIDE;
-  void copyProperties(Scene_item *) Q_DECL_OVERRIDE;
+  bool supportsRenderingMode(RenderingMode m) const override;
+  bool isFinite() const override { return true; }
+  bool isEmpty() const override;
+  Bbox bbox() const override;
+  QString toolTip() const override;
+  void copyProperties(Scene_item *) override;
 
-  QMenu* contextMenu() Q_DECL_OVERRIDE;
+  QMenu* contextMenu() override;
 
   void setItemIsMulticolor(bool);
   //to be called before invalidate() to enable or disable the recomputation
@@ -98,11 +98,11 @@ class SCENE_SURFACE_MESH_ITEM_EXPORT Scene_surface_mesh_item
   const std::string& comments() const;
 
   void invalidate_aabb_tree();
-  void invalidateOpenGLBuffers()Q_DECL_OVERRIDE;
+  void invalidateOpenGLBuffers()override;
   void invalidate(Gl_data_names name);
 
 
-  void compute_bbox()const Q_DECL_OVERRIDE;
+  void compute_bbox()const override;
   bool save(std::ostream& out) const;
   bool save_obj(std::ostream& out) const;
   bool load_obj(std::istream& in);
@@ -152,24 +152,24 @@ class SCENE_SURFACE_MESH_ITEM_EXPORT Scene_surface_mesh_item
     MEAN_ANGLE
   };
 
-  bool has_stats()const Q_DECL_OVERRIDE{return true;}
-  QString computeStats(int type)Q_DECL_OVERRIDE;
-  CGAL::Three::Scene_item::Header_data header() const Q_DECL_OVERRIDE;
+  bool has_stats()const override{return true;}
+  QString computeStats(int type)override;
+  CGAL::Three::Scene_item::Header_data header() const override;
   //zoomable interface
-  void zoomToPosition(const QPoint &point, CGAL::Three::Viewer_interface *)const Q_DECL_OVERRIDE;
+  void zoomToPosition(const QPoint &point, CGAL::Three::Viewer_interface *)const override;
  //print_interface
-  void printPrimitiveId(QPoint point, CGAL::Three::Viewer_interface*viewer)Q_DECL_OVERRIDE;
-  bool printVertexIds()const Q_DECL_OVERRIDE;
-  bool printEdgeIds()const Q_DECL_OVERRIDE;
-  bool printFaceIds()const Q_DECL_OVERRIDE;
-  void printAllIds() Q_DECL_OVERRIDE;
-  bool shouldDisplayIds(CGAL::Three::Scene_item *current_item) const Q_DECL_OVERRIDE;
-  bool testDisplayId(double x, double y, double z, CGAL::Three::Viewer_interface*)const Q_DECL_OVERRIDE;
-  float alpha() const Q_DECL_OVERRIDE;
-  void setAlpha(int alpha) Q_DECL_OVERRIDE;
+  void printPrimitiveId(QPoint point, CGAL::Three::Viewer_interface*viewer) override;
+  bool printVertexIds()const override;
+  bool printEdgeIds()const override;
+  bool printFaceIds()const override;
+  void printAllIds() override;
+  bool shouldDisplayIds(CGAL::Three::Scene_item *current_item) const override;
+  bool testDisplayId(double x, double y, double z, CGAL::Three::Viewer_interface*)const override;
+  float alpha() const override;
+  void setAlpha(int alpha) override;
   QSlider* alphaSlider();
-  void computeElements() const Q_DECL_OVERRIDE;
-  void initializeBuffers(CGAL::Three::Viewer_interface*)const Q_DECL_OVERRIDE;
+  void computeElements() const override;
+  void initializeBuffers(CGAL::Three::Viewer_interface*)const override;
   void updateVertex(vertex_descriptor vh);
   void fill_flat_vertex_map();
   void updateIds(vertex_descriptor vh);
@@ -183,14 +183,14 @@ class SCENE_SURFACE_MESH_ITEM_EXPORT Scene_surface_mesh_item
 
 
 public Q_SLOTS:
-  void itemAboutToBeDestroyed(Scene_item *) Q_DECL_OVERRIDE;
-  virtual void selection_changed(bool) Q_DECL_OVERRIDE;
+  void itemAboutToBeDestroyed(Scene_item *) override;
+  virtual void selection_changed(bool) override;
   void select(double orig_x,
               double orig_y,
               double orig_z,
               double dir_x,
               double dir_y,
-              double dir_z) Q_DECL_OVERRIDE;
+              double dir_z) override;
   bool intersect_face(double orig_x,
                       double orig_y,
                       double orig_z,
diff --git a/Polyhedron/demo/Polyhedron/Scene_tetrahedra_item.h b/Polyhedron/demo/Polyhedron/Scene_tetrahedra_item.h
index fdf609481d55..23608d333d5b 100644
--- a/Polyhedron/demo/Polyhedron/Scene_tetrahedra_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_tetrahedra_item.h
@@ -30,18 +30,18 @@ class SCENE_TETRAHEDRA_ITEM_EXPORT Scene_tetrahedra_item : public CGAL::Three::S
   Q_OBJECT
 public :
   Scene_tetrahedra_item(Scene_c3t3_item*);
-  bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE {
+  bool supportsRenderingMode(RenderingMode m) const override {
     return (m == Flat);
   }
-  void draw(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE;
-  void invalidateOpenGLBuffers()Q_DECL_OVERRIDE;
-  void computeElements() const Q_DECL_OVERRIDE;
-  Scene_item* clone() const Q_DECL_OVERRIDE;
-  QString toolTip() const Q_DECL_OVERRIDE{return QString();}
-  bool isEmpty() const Q_DECL_OVERRIDE{ return false;}
-  bool isFinite() const Q_DECL_OVERRIDE{ return true;}
-  void initializeBuffers(CGAL::Three::Viewer_interface *) const Q_DECL_OVERRIDE;
-  void compute_bbox() const Q_DECL_OVERRIDE;
+  void draw(CGAL::Three::Viewer_interface* viewer) const override;
+  void invalidateOpenGLBuffers()override;
+  void computeElements() const override;
+  Scene_item* clone() const override;
+  QString toolTip() const override{return QString();}
+  bool isEmpty() const override{ return false;}
+  bool isFinite() const override{ return true;}
+  void initializeBuffers(CGAL::Three::Viewer_interface *) const override;
+  void compute_bbox() const override;
   void setMinMinLabelPointer(QLabel*);
   void setMinMaxLabelPointer(QLabel*);
   void setMaxMinLabelPointer(QLabel*);
diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
index d2c3ca9a0ea3..507122e3de6d 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
@@ -79,13 +79,13 @@ public :
     setTriangleContainer(0, new Tc(Vi::PROGRAM_C3T3, false));
     setEdgeContainer(0, new Ec(Vi::PROGRAM_NO_SELECTION, false));
   }
-  bool isFinite() const Q_DECL_OVERRIDE{ return false; }
+  bool isFinite() const override{ return false; }
   ~Scene_intersection_item()
   {
     if(alphaSlider)
          delete alphaSlider;
   }
-  void compute_bbox() const Q_DECL_OVERRIDE{}
+  void compute_bbox() const override{}
 
   void gl_initialization(Vi* viewer)
   {
@@ -109,16 +109,16 @@ public :
     barycenters = p_bary;
     subdomain_ids = p_subdomain_ids;
   }
-  void setColor(QColor c) Q_DECL_OVERRIDE
+  void setColor(QColor c) override
   {
     qobject_cast<Scene_triangulation_3_item*>(this->parent())->setColor(c);
     Scene_item::setColor(c);
   }
   // Indicates if rendering mode is supported
-  bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE{
+  bool supportsRenderingMode(RenderingMode m) const override{
     return (m != Gouraud && m != PointsPlusNormals && m != Points && m != ShadedPoints);
   }
-  void computeElements() const Q_DECL_OVERRIDE
+  void computeElements() const override
   {
     getTriangleContainer(0)->reset_vbos(ALL);
     getEdgeContainer(0)->reset_vbos(ALL);
@@ -137,7 +137,7 @@ public :
                             static_cast<int>(edges->size()*sizeof(float)));
     setBuffersFilled(true);
   }
-  void initializeBuffers(CGAL::Three::Viewer_interface *viewer)const Q_DECL_OVERRIDE
+  void initializeBuffers(CGAL::Three::Viewer_interface *viewer)const override
   {
     //vao containing the data for the facets
     {
@@ -152,7 +152,7 @@ public :
   }
 
   //Displays the item
-  void draw(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE
+  void draw(CGAL::Three::Viewer_interface* viewer) const override
   {
     if(is_fast)
       return;
@@ -174,7 +174,7 @@ public :
     getTriangleContainer(0)->setAlpha(alpha());
     getTriangleContainer(0)->draw(viewer, false);
   }
-  void drawEdges(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE
+  void drawEdges(CGAL::Three::Viewer_interface* viewer) const override
   {
     if(is_fast)
       return;
@@ -251,9 +251,9 @@ public :
     }
   }
 
-  Scene_item* clone() const Q_DECL_OVERRIDE{return 0;}
-  QString toolTip() const Q_DECL_OVERRIDE{return QString();}
-  QMenu* contextMenu() Q_DECL_OVERRIDE
+  Scene_item* clone() const override{return 0;}
+  QString toolTip() const override{return QString();}
+  QMenu* contextMenu() override
   {
     QMenu* menu = Scene_item::contextMenu();
 
@@ -279,12 +279,12 @@ public :
     }
     return menu;
   }
-  float alpha() const Q_DECL_OVERRIDE
+  float alpha() const override
   {
     return m_alpha ;
   }
 
-  void setAlpha(int a) Q_DECL_OVERRIDE
+  void setAlpha(int a) override
   {
     m_alpha = a / 255.0f;
     redraw();
diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
index b59026124c2f..eda26394f1fd 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.h
@@ -38,15 +38,15 @@ using namespace CGAL::Three;
   ~Scene_triangulation_3_item();
 
   void common_constructor(bool);
-  bool has_stats()const  Q_DECL_OVERRIDE {return true;}
-  QString computeStats(int type)  Q_DECL_OVERRIDE;
-  CGAL::Three::Scene_item::Header_data header() const Q_DECL_OVERRIDE;
+  bool has_stats()const  override {return true;}
+  QString computeStats(int type)  override;
+  CGAL::Three::Scene_item::Header_data header() const override;
 
 
-  void setColor(QColor c) Q_DECL_OVERRIDE;
+  void setColor(QColor c) override;
   void setUseSubdomainColors(bool use_subdomain_colors);
 
-  void invalidateOpenGLBuffers() Q_DECL_OVERRIDE;
+  void invalidateOpenGLBuffers() override;
 
   void triangulation_changed();
 
@@ -57,20 +57,20 @@ using namespace CGAL::Three;
   virtual const T3& triangulation() const;
   virtual T3& triangulation();
 
-  bool manipulatable() const  Q_DECL_OVERRIDE{
+  bool manipulatable() const  override{
     return true;
   }
 
-  Scene_item::Bbox bbox() const Q_DECL_OVERRIDE;
+  Scene_item::Bbox bbox() const override;
 
   bool has_spheres() const;
   bool has_grid() const;
   bool has_tets() const;
 
-  float alpha() const Q_DECL_OVERRIDE;
-  void setAlpha(int alpha) Q_DECL_OVERRIDE;
+  float alpha() const override;
+  void setAlpha(int alpha) override;
   QSlider* alphaSlider();
-  ManipulatedFrame* manipulatedFrame() Q_DECL_OVERRIDE;
+  ManipulatedFrame* manipulatedFrame() override;
 
   void setPosition(float x, float y, float z) ;
 
@@ -78,8 +78,8 @@ using namespace CGAL::Three;
 
   Geom_traits::Plane_3 plane(CGAL::qglviewer::Vec offset = CGAL::qglviewer::Vec(0,0,0)) const;
 
-  bool isFinite() const Q_DECL_OVERRIDE { return true; }
-  bool isEmpty() const Q_DECL_OVERRIDE {
+  bool isFinite() const override { return true; }
+  bool isEmpty() const override {
     return triangulation().number_of_vertices() == 0
       || ( triangulation().number_of_finite_facets()   == 0
            && triangulation().number_of_finite_cells()    == 0  );
@@ -87,9 +87,9 @@ using namespace CGAL::Three;
   }
 
 
-  void compute_bbox() const Q_DECL_OVERRIDE;
+  void compute_bbox() const override;
 
-  Scene_triangulation_3_item* clone() const  Q_DECL_OVERRIDE;
+  Scene_triangulation_3_item* clone() const  override;
 
   virtual bool load_binary(std::istream& is);
 
@@ -97,24 +97,24 @@ using namespace CGAL::Three;
   const Scene_item* data_item() const;
   void set_data_item(const Scene_item* data_item);
 
-  QString toolTip() const Q_DECL_OVERRIDE;
+  QString toolTip() const override;
 
   // Indicate if rendering mode is supported
-  bool supportsRenderingMode(RenderingMode m) const  Q_DECL_OVERRIDE{
+  bool supportsRenderingMode(RenderingMode m) const  override{
     return (m != Gouraud && m != PointsPlusNormals && m != Points && m != ShadedPoints);
   }
 
-  void draw(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE;
-  void drawEdges(CGAL::Three::Viewer_interface* viewer) const Q_DECL_OVERRIDE;
-  void drawPoints(CGAL::Three::Viewer_interface * viewer) const Q_DECL_OVERRIDE;
+  void draw(CGAL::Three::Viewer_interface* viewer) const override;
+  void drawEdges(CGAL::Three::Viewer_interface* viewer) const override;
+  void drawPoints(CGAL::Three::Viewer_interface * viewer) const override;
    //When selecting a t3 item, we don't want to select its children, so we can still apply Operations to it
-  QList<Scene_interface::Item_id> getChildrenForSelection() const Q_DECL_OVERRIDE { return QList<Scene_interface::Item_id>(); }
+  QList<Scene_interface::Item_id> getChildrenForSelection() const override { return QList<Scene_interface::Item_id>(); }
   public:
-    QMenu* contextMenu() Q_DECL_OVERRIDE;
-    void copyProperties(Scene_item *) Q_DECL_OVERRIDE;
+    QMenu* contextMenu() override;
+    void copyProperties(Scene_item *) override;
     float getShrinkFactor() const;
-    bool keyPressEvent(QKeyEvent *) Q_DECL_OVERRIDE;
-    bool eventFilter(QObject *, QEvent *) Q_DECL_OVERRIDE;
+    bool keyPressEvent(QKeyEvent *) override;
+    bool eventFilter(QObject *, QEvent *) override;
     const std::set<int> &subdomain_indices() const;
     QColor getSubdomainIndexColor(int i) const;
   public Q_SLOTS:
@@ -135,7 +135,7 @@ using namespace CGAL::Three;
   void computeIntersection();
   void set_cut_edge(bool b);
 
-  virtual QPixmap graphicalToolTip() const Q_DECL_OVERRIDE;
+  virtual QPixmap graphicalToolTip() const override;
 
   void update_histogram();
 
@@ -151,11 +151,11 @@ using namespace CGAL::Three;
   void switchVisibleSubdomain(int);
   bool isVisibleSubdomain(int) const;
 
-  void itemAboutToBeDestroyed(Scene_item *) Q_DECL_OVERRIDE;
+  void itemAboutToBeDestroyed(Scene_item *) override;
 
-  void initializeBuffers(Viewer_interface *) const Q_DECL_OVERRIDE;
-  void computeElements() const Q_DECL_OVERRIDE;
-  void newViewer(Viewer_interface *viewer) Q_DECL_OVERRIDE;
+  void initializeBuffers(Viewer_interface *) const override;
+  void computeElements() const override;
+  void newViewer(Viewer_interface *viewer) override;
 
   protected:
     friend struct Scene_triangulation_3_item_priv;
diff --git a/Polyhedron/demo/Polyhedron/Viewer.h b/Polyhedron/demo/Polyhedron/Viewer.h
index 357e8d52ec58..9989344a4026 100644
--- a/Polyhedron/demo/Polyhedron/Viewer.h
+++ b/Polyhedron/demo/Polyhedron/Viewer.h
@@ -40,55 +40,55 @@ class VIEWER_EXPORT Viewer : public CGAL::Three::Viewer_interface {
   Viewer(QWidget * parent, bool antialiasing = false);
   Viewer(QWidget * parent, Viewer *sharedWidget, bool antialiasing = false);
   ~Viewer();
-  bool testDisplayId(double, double, double)Q_DECL_OVERRIDE;
-  void updateIds(CGAL::Three::Scene_item *)Q_DECL_OVERRIDE;
+  bool testDisplayId(double, double, double)override;
+  void updateIds(CGAL::Three::Scene_item *)override;
   //! overload several CGAL::QGLViewer virtual functions
   //! Draws the scene.
-  void draw()Q_DECL_OVERRIDE;
+  void draw()override;
   //!This step happens after draw(). It is here that all the useful information is displayed, like the axis system or the informative text.
-  void drawVisualHints()Q_DECL_OVERRIDE;
+  void drawVisualHints()override;
   //! Deprecated. Does the same as draw().
-  void fastDraw()Q_DECL_OVERRIDE;
-  bool isExtensionFound()Q_DECL_OVERRIDE;
-  void initializeGL() Q_DECL_OVERRIDE;
+  void fastDraw()override;
+  bool isExtensionFound()override;
+  void initializeGL() override;
   //! Initializes the OpenGL functions and sets the backGround color.
-  void init()Q_DECL_OVERRIDE;
+  void init()override;
   //! Draws the scene "with names" to allow picking.
-  void drawWithNames()Q_DECL_OVERRIDE;
+  void drawWithNames()override;
   /*! Uses the parameter pixel's coordinates to get the corresponding point
    * in the World frame. If this point is found, emits selectedPoint, selected,
    * and selectionRay signals.
    */
-  void postSelection(const QPoint&)Q_DECL_OVERRIDE;
+  void postSelection(const QPoint&)override;
   //! Sets the picking matrix to allow the picking.
-  void beginSelection(const QPoint &point)Q_DECL_OVERRIDE;
+  void beginSelection(const QPoint &point)override;
   //! Sets the pick matrix to Identity once the picking is done.
-  void endSelection(const QPoint &point)Q_DECL_OVERRIDE;
+  void endSelection(const QPoint &point)override;
   //! Sets the scene for the viewer.
-  void setScene(CGAL::Three::Scene_draw_interface* scene)Q_DECL_OVERRIDE;
+  void setScene(CGAL::Three::Scene_draw_interface* scene)override;
   //! @returns the antialiasing state.
-  bool antiAliasing() const Q_DECL_OVERRIDE;
+  bool antiAliasing() const override;
   //! @returns the fastDrawing state.
-  bool inFastDrawing() const Q_DECL_OVERRIDE;
+  bool inFastDrawing() const override;
   //! Implementation of `Viewer_interface::inDrawWithNames()`
-  bool inDrawWithNames() const Q_DECL_OVERRIDE;
+  bool inDrawWithNames() const override;
   //! Implementation of `Viewer_interface::attribBuffers()`
-  void attribBuffers(int program_name) const Q_DECL_OVERRIDE;
+  void attribBuffers(int program_name) const override;
   //! Implementation of `Viewer_interface::getShaderProgram()`
-  QOpenGLShaderProgram* getShaderProgram(int name) const Q_DECL_OVERRIDE;
+  QOpenGLShaderProgram* getShaderProgram(int name) const override;
   //!Declares a program names `name`, using `v_shader` as vertex shader and `f_shader` as fragment shader.
   QOpenGLShaderProgram* declare_program(int name,
                                         const char* v_shader,
                                         const char* f_shader)const;
-  QPainter* getPainter()Q_DECL_OVERRIDE;
+  QPainter* getPainter()override;
 
 
-  TextRenderer* textRenderer() Q_DECL_OVERRIDE;
-  void enableClippingBox(QVector4D box[6]) Q_DECL_OVERRIDE;
-  void disableClippingBox() Q_DECL_OVERRIDE;
-  void set2DSelectionMode(bool) Q_DECL_OVERRIDE;
-  void setStaticImage(QImage image) Q_DECL_OVERRIDE;
-  const QImage& staticImage() const Q_DECL_OVERRIDE;
+  TextRenderer* textRenderer() override;
+  void enableClippingBox(QVector4D box[6]) override;
+  void disableClippingBox() override;
+  void set2DSelectionMode(bool) override;
+  void setStaticImage(QImage image) override;
+  const QImage& staticImage() const override;
   //!Set total number of depth peeling passes.
    void setTotalPass(int);
    void resetFov();
@@ -99,32 +99,32 @@ class VIEWER_EXPORT Viewer : public CGAL::Three::Viewer_interface {
   void socketClosed();
 public Q_SLOTS:
   //! Sets the antialiasing to true or false.
-  void setAntiAliasing(bool b) Q_DECL_OVERRIDE;
+  void setAntiAliasing(bool b) override;
   //! If b is true, facets will be ligted from both internal and external sides.
   //! If b is false, only the side that is exposed to the light source will be lighted.
-  void setTwoSides(bool b) Q_DECL_OVERRIDE;
-  void setBackFrontShading(bool b) Q_DECL_OVERRIDE;
-  void SetOrthoProjection( bool b) Q_DECL_OVERRIDE;
+  void setTwoSides(bool b) override;
+  void setBackFrontShading(bool b) override;
+  void SetOrthoProjection( bool b) override;
   //! If b is true, some items are displayed in a simplified version when moving the camera.
   //! If b is false, items display is never altered, even when moving.
-  void setFastDrawing(bool b) Q_DECL_OVERRIDE;
+  void setFastDrawing(bool b) override;
   //! Makes the camera turn around.
-  void turnCameraBy180Degres() Q_DECL_OVERRIDE;
+  void turnCameraBy180Degres() override;
   //! @returns a QString containing the position and orientation of the camera.
-  QString dumpCameraCoordinates() Q_DECL_OVERRIDE;
+  QString dumpCameraCoordinates() override;
   //!Moves the camera to the new coordinates (position and orientation) through an animation.
   bool moveCameraToCoordinates(QString,
-                               float animation_duration = 0.5f) Q_DECL_OVERRIDE;
+                               float animation_duration = 0.5f) override;
   //!Makes the Viewer display a message
   void printMessage(QString message, int ms_delay );
   void displayMessage(const QString &_message, int delay);
   void displayMessage(const QString &_message){displayMessage(_message, 2000);}
   void hideMessage();
-  void setBindingSelect() Q_DECL_OVERRIDE
+  void setBindingSelect() override
   {
     setMouseBinding(::Qt::ShiftModifier, ::Qt::LeftButton, CGAL::qglviewer::SELECT);
   }
-  virtual void setNoBinding() Q_DECL_OVERRIDE
+  virtual void setNoBinding() override
   {
     setMouseBinding(::Qt::ShiftModifier, ::Qt::LeftButton, CGAL::qglviewer::NO_CLICK_ACTION);
   }
@@ -139,21 +139,21 @@ public Q_SLOTS:
   void onTextMessageSocketReceived(QString message);
 #endif
   void scaleScene();
-  void showEntireScene()Q_DECL_OVERRIDE;
+  void showEntireScene()override;
 protected:
-  void paintEvent(QPaintEvent *)Q_DECL_OVERRIDE;
-  void paintGL()Q_DECL_OVERRIDE;
+  void paintEvent(QPaintEvent *)override;
+  void paintGL()override;
 
   //!Defines the behaviour for the mouse press events
-  void mousePressEvent(QMouseEvent*)Q_DECL_OVERRIDE;
-  void mouseDoubleClickEvent(QMouseEvent*)Q_DECL_OVERRIDE;
-  void wheelEvent(QWheelEvent *)Q_DECL_OVERRIDE;
+  void mousePressEvent(QMouseEvent*)override;
+  void mouseDoubleClickEvent(QMouseEvent*)override;
+  void wheelEvent(QWheelEvent *)override;
   //!Defines the behaviour for the key press events
-  void keyPressEvent(QKeyEvent*)Q_DECL_OVERRIDE;
+  void keyPressEvent(QKeyEvent*)override;
   //!Deal with context menu events
-  void contextMenuEvent(QContextMenuEvent*)Q_DECL_OVERRIDE;
+  void contextMenuEvent(QContextMenuEvent*)override;
   //!Defines the behaviour for the key release events
-  void keyReleaseEvent(QKeyEvent *)Q_DECL_OVERRIDE;
+  void keyReleaseEvent(QKeyEvent *)override;
 
 protected:
   friend class Viewer_impl;
@@ -162,19 +162,19 @@ public Q_SLOTS:
   void doBindings();
 
 public:
-  QOpenGLFunctions_4_3_Core* openGL_4_3_functions() Q_DECL_OVERRIDE;
-  void setCurrentPass(int pass) Q_DECL_OVERRIDE;
-   void setDepthWriting(bool writing_depth) Q_DECL_OVERRIDE;
-   void setDepthPeelingFbo(QOpenGLFramebufferObject *fbo) Q_DECL_OVERRIDE;
-   int currentPass()const Q_DECL_OVERRIDE;
-   bool isDepthWriting()const Q_DECL_OVERRIDE;
-   QOpenGLFramebufferObject* depthPeelingFbo()Q_DECL_OVERRIDE;
-   float total_pass()Q_DECL_OVERRIDE;
-   const GLfloat& getGlPointSize()const Q_DECL_OVERRIDE;
-   void setGlPointSize(const GLfloat& p) Q_DECL_OVERRIDE;
-   void makeCurrent() Q_DECL_OVERRIDE;
-   QVector4D* clipBox() const Q_DECL_OVERRIDE;
-   bool isClipping() const Q_DECL_OVERRIDE;
+  QOpenGLFunctions_4_3_Core* openGL_4_3_functions() override;
+  void setCurrentPass(int pass) override;
+   void setDepthWriting(bool writing_depth) override;
+   void setDepthPeelingFbo(QOpenGLFramebufferObject *fbo) override;
+   int currentPass()const override;
+   bool isDepthWriting()const override;
+   QOpenGLFramebufferObject* depthPeelingFbo()override;
+   float total_pass()override;
+   const GLfloat& getGlPointSize()const override;
+   void setGlPointSize(const GLfloat& p) override;
+   void makeCurrent() override;
+   QVector4D* clipBox() const override;
+   bool isClipping() const override;
 }; // end class Viewer
 
 
diff --git a/Three/include/CGAL/Three/Edge_container.h b/Three/include/CGAL/Three/Edge_container.h
index 1de5f9be4369..516f07ab32e4 100644
--- a/Three/include/CGAL/Three/Edge_container.h
+++ b/Three/include/CGAL/Three/Edge_container.h
@@ -67,7 +67,7 @@ struct DEMO_FRAMEWORK_EXPORT Edge_container :public Primitive_container
   //!
   //! \param viewer the active `Viewer_interface`.
   //!
-  void initGL(Viewer_interface *viewer)  Q_DECL_OVERRIDE;
+  void initGL(Viewer_interface *viewer)  override;
 
   //!
   //! \brief draw is the function that actually renders the data.
@@ -75,9 +75,9 @@ struct DEMO_FRAMEWORK_EXPORT Edge_container :public Primitive_container
   //! \param is_color_uniform must be `false` if `VBOs`[`Colors`] is not empty, `true` otherwise.
   //!
   void draw(CGAL::Three::Viewer_interface* viewer,
-            bool is_color_uniform)  Q_DECL_OVERRIDE;
+            bool is_color_uniform)  override;
 
-  void initializeBuffers(Viewer_interface *viewer) Q_DECL_OVERRIDE;
+  void initializeBuffers(Viewer_interface *viewer) override;
 
   /// \name Getters and Setters for the shaders parameters.
   ///
diff --git a/Three/include/CGAL/Three/Point_container.h b/Three/include/CGAL/Three/Point_container.h
index f468fe8e5349..9adc08a708b4 100644
--- a/Three/include/CGAL/Three/Point_container.h
+++ b/Three/include/CGAL/Three/Point_container.h
@@ -65,7 +65,7 @@ struct DEMO_FRAMEWORK_EXPORT Point_container :public Primitive_container
   //!
   //! \param viewer the active `Viewer_interface`.
   //!
-  void initGL(Viewer_interface *viewer)  Q_DECL_OVERRIDE;
+  void initGL(Viewer_interface *viewer)  override;
 
   //!
   //! \brief draw is the function that actually renders the data.
@@ -73,7 +73,7 @@ struct DEMO_FRAMEWORK_EXPORT Point_container :public Primitive_container
   //! \param is_color_uniform must be `false` if `VBOs`[`Colors`] is not empty, `true` otherwise.
   //!
   void draw(CGAL::Three::Viewer_interface* viewer,
-            bool is_color_uniform)  Q_DECL_OVERRIDE;
+            bool is_color_uniform)  override;
 
   /// \name Getters and Setters for the shaders parameters.
   ///
diff --git a/Three/include/CGAL/Three/Scene_group_item.h b/Three/include/CGAL/Three/Scene_group_item.h
index af3f89ceb01a..558c21e53016 100644
--- a/Three/include/CGAL/Three/Scene_group_item.h
+++ b/Three/include/CGAL/Three/Scene_group_item.h
@@ -41,9 +41,9 @@ public :
     Scene_group_item(QString name = QString("New group"));
     ~Scene_group_item() { delete children;}
     //!Returns false to avoid disturbing the BBox of the scene.
-    bool isFinite() const Q_DECL_OVERRIDE;
+    bool isFinite() const override;
     //!Returns true to avoid disturbing the BBox of the scene.
-    bool isEmpty() const Q_DECL_OVERRIDE;
+    bool isEmpty() const override;
     /*!
          * \brief locks a child
          *
@@ -92,15 +92,15 @@ public :
     //! @see isExpanded().
     void setExpanded(bool);
     //!Returns an empty Bbox to avoid disturbing the Bbox of the scene.
-    Bbox bbox() const Q_DECL_OVERRIDE;
+    Bbox bbox() const override;
     //!Not supported.
-    Scene_item* clone() const Q_DECL_OVERRIDE {return nullptr;}
+    Scene_item* clone() const override {return nullptr;}
     //! Indicates if the rendering mode is supported.
     //! \returns true for all rendering modes that are shared by
     //! all of the children.
-    bool supportsRenderingMode(RenderingMode m) const Q_DECL_OVERRIDE;
+    bool supportsRenderingMode(RenderingMode m) const override;
     //!\returns a string containing the number of children.
-    QString toolTip() const Q_DECL_OVERRIDE;
+    QString toolTip() const override;
 
     /// Draw functions
     /// Scene_group_item's children are not drawn by the scene, they are drawn by the group.
@@ -111,21 +111,21 @@ public :
     //! and `Scene_item::drawPoints` for each child if its current
     //! rendering mode is adequat.
     //! @see #RenderingMode
-    virtual void draw(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE;
+    virtual void draw(CGAL::Three::Viewer_interface*) const override;
     //!\brief draws all the children
     //!
     //! Calls `Scene_item::drawEdges()`, then calls `Scene_item::draw()`
     //! and `Scene_item::drawPoints` for each child if its current
     //! rendering mode is adequat.
     //! @see #RenderingMode
-    virtual void drawEdges(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE;
+    virtual void drawEdges(CGAL::Three::Viewer_interface*) const override;
     //!\brief draws all the children
     //!
     //! Calls `Scene_item::drawPoints()`, then calls `Scene_item::draw()`
     //! and `Scene_item::drawEdges()` for each child if its current
     //! rendering mode is adequat.
     //! @see #RenderingMode
-    virtual void drawPoints(CGAL::Three::Viewer_interface*) const Q_DECL_OVERRIDE;
+    virtual void drawPoints(CGAL::Three::Viewer_interface*) const override;
     //!
        //! \brief deals with the rendering, selecting and picking of
        //! the group's children.
@@ -152,11 +152,11 @@ public :
     Scene_item* getChild(Scene_interface::Item_id id) { return scene->item(id);}
     Scene_item* getChild(Scene_interface::Item_id id) const{ return scene->item(id);}
     //!Sets all the children to the specified color.
-    void setColor(QColor c) Q_DECL_OVERRIDE;
+    void setColor(QColor c) override;
     //!Sets all the children in the specified rendering mode.
-    void setRenderingMode(RenderingMode m) Q_DECL_OVERRIDE;
+    void setRenderingMode(RenderingMode m) override;
     //!Sets all the children to the specified visibility.
-    void setVisible(bool b) Q_DECL_OVERRIDE;
+    void setVisible(bool b) override;
     //!Sets all the children in points mode.
     void setPointsMode() {
       setRenderingMode(Points);
@@ -190,7 +190,7 @@ public :
       setRenderingMode(PointsPlusNormals);
     }
     //!Sets the alpha value for the froup and all its children.
-        virtual void setAlpha(int) Q_DECL_OVERRIDE;
+        virtual void setAlpha(int) override;
 
     //! \brief returns a list of all the direct children.
     //!
@@ -227,7 +227,7 @@ public :
     //!Moves a child down in the list.
     void moveDown(int);
 
-    void compute_bbox() const Q_DECL_OVERRIDE{};
+    void compute_bbox() const override{};
 public Q_SLOTS:
     //!\brief redraws children.
     //!
diff --git a/Three/include/CGAL/Three/Scene_item_rendering_helper.h b/Three/include/CGAL/Three/Scene_item_rendering_helper.h
index 72fd4ce154a9..83ee418e4054 100644
--- a/Three/include/CGAL/Three/Scene_item_rendering_helper.h
+++ b/Three/include/CGAL/Three/Scene_item_rendering_helper.h
@@ -69,7 +69,7 @@ class DEMO_FRAMEWORK_EXPORT Scene_item_rendering_helper
 #endif
   Q_DECLARE_FLAGS(Gl_data_names, Gl_data_name)
 
-  QMenu* contextMenu() Q_DECL_OVERRIDE;
+  QMenu* contextMenu() override;
 
   /*!
      * \brief processData calls `computeElements()`
@@ -86,13 +86,13 @@ class DEMO_FRAMEWORK_EXPORT Scene_item_rendering_helper
   //! It must be between 0 and 255.
   //! \param alpha the integer value for the alpha channel.
   //!
-  void setAlpha(int alpha) Q_DECL_OVERRIDE;
+  void setAlpha(int alpha) override;
   //! \brief The item's bounding box.
   //!
   //! If the Bbox has never been computed, computes it and
   //! saves the result for further calls.
   //! @returns the item's bounding box.
-  Scene_item::Bbox bbox()const Q_DECL_OVERRIDE;
+  Scene_item::Bbox bbox()const override;
   //!
   //! \brief getTriangleContainer returns the `id`th `Triangle_container`.
   //!
@@ -174,15 +174,15 @@ class DEMO_FRAMEWORK_EXPORT Scene_item_rendering_helper
   //! saves the result for further calls.
   //! @returns the item's bounding box's diagonal length.
   //! @todo must replace the one from Scene_item eventually
-  virtual double bboxDiagonal() const Q_DECL_OVERRIDE;
+  virtual double bboxDiagonal() const override;
   //!
   //! \brief newViewer adds Vaos for `viewer`.
   //! \param viewer the new viewer.
   //!
-  void newViewer(Viewer_interface *viewer) Q_DECL_OVERRIDE;
+  void newViewer(Viewer_interface *viewer) override;
   //! \brief removeViewer removes the Vaos for `viewer`.
   //! \param viewer the viewer to be removed.
-  void removeViewer(Viewer_interface *viewer) Q_DECL_OVERRIDE;
+  void removeViewer(Viewer_interface *viewer) override;
 protected:
 
 
@@ -194,7 +194,7 @@ class DEMO_FRAMEWORK_EXPORT Scene_item_rendering_helper
 
   //!Returns the float alpha value of an item.
   //! This value is between 0.0f and 1.0f.
-  float alpha() const Q_DECL_OVERRIDE;
+  float alpha() const override;
 
   /*! Fills the `Vbo`s with data.
      */
@@ -205,7 +205,7 @@ class DEMO_FRAMEWORK_EXPORT Scene_item_rendering_helper
   //!
   //! Computes the items Bbox and stores the result. Must be overridden.
   //!@todo must replace the one from Scene_item eventually.
-  virtual void compute_bbox() const Q_DECL_OVERRIDE = 0;
+  virtual void compute_bbox() const override = 0;
   //!
   //! \brief setBbox allows to set the Bbox in compute_bbox();
   //! \param b
diff --git a/Three/include/CGAL/Three/Triangle_container.h b/Three/include/CGAL/Three/Triangle_container.h
index bf8d4224e621..cc9ded272b47 100644
--- a/Three/include/CGAL/Three/Triangle_container.h
+++ b/Three/include/CGAL/Three/Triangle_container.h
@@ -68,7 +68,7 @@ struct DEMO_FRAMEWORK_EXPORT Triangle_container :public Primitive_container
   //!
   //! \param viewer the active `Viewer_interface`.
   //!
-  void initGL(CGAL::Three::Viewer_interface* viewer) Q_DECL_OVERRIDE;
+  void initGL(CGAL::Three::Viewer_interface* viewer) override;
 
   //!
   //! \brief draw is the function that actually renders the data.
@@ -76,9 +76,9 @@ struct DEMO_FRAMEWORK_EXPORT Triangle_container :public Primitive_container
   //! \param is_color_uniform must be `false` if the color buffers are not empty, `true` otherwise.
   //!
   void draw(CGAL::Three::Viewer_interface* viewer,
-            bool is_color_uniform)  Q_DECL_OVERRIDE;
+            bool is_color_uniform)  override;
 
-  void initializeBuffers(Viewer_interface *viewer) Q_DECL_OVERRIDE;
+  void initializeBuffers(Viewer_interface *viewer) override;
   /// \name Getters and Setters for the shaders parameters.
   ///
   /// Each of those depends of the `OpenGL_program_IDs` this container is using.

From f0f1d6a7b82d5232b2a91c604ab1090befc470d6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 22 Nov 2023 13:11:28 +0100
Subject: [PATCH 1068/1398] fix warning

---
 AABB_tree/demo/AABB_tree/Scene.cpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/AABB_tree/demo/AABB_tree/Scene.cpp b/AABB_tree/demo/AABB_tree/Scene.cpp
index abf09661b438..41e11ac62091 100644
--- a/AABB_tree/demo/AABB_tree/Scene.cpp
+++ b/AABB_tree/demo/AABB_tree/Scene.cpp
@@ -618,7 +618,7 @@ void Scene::draw(CGAL::QGLViewer* viewer)
         vao[0].bind();
         attrib_buffers(viewer);
         rendering_program.bind();
-        color.setRgbF(0.7,0.0,0.0);
+        color.setRgbF(0.7f,0.0f,0.0f);
         rendering_program.setUniformValue(colorLocation, color);
         rendering_program.setUniformValue(fLocation, fMatrix);
         gl->glDrawArrays(GL_POINTS, 0, static_cast<GLsizei>(pos_points.size()/3));
@@ -631,7 +631,7 @@ void Scene::draw(CGAL::QGLViewer* viewer)
         vao[1].bind();
         attrib_buffers(viewer);
         rendering_program.bind();
-        color.setRgbF(0.0,0.7,0.0);
+        color.setRgbF(0.0f,0.7f,0.0f);
         rendering_program.setUniformValue(colorLocation, color);
         rendering_program.setUniformValue(fLocation, fMatrix);
         gl->glDrawArrays(GL_LINES, 0, static_cast<GLsizei>(pos_lines.size()/3));
@@ -669,7 +669,7 @@ void Scene::draw(CGAL::QGLViewer* viewer)
             vao[3].bind();
             attrib_buffers(viewer);
             rendering_program.bind();
-            color.setRgbF(1.0,0.0,0.0);
+            color.setRgbF(1.0f,0.0f,0.0f);
             rendering_program.setUniformValue(colorLocation, color);
             rendering_program.setUniformValue(fLocation, fMatrix);
             gl->glDrawArrays(GL_LINES, 0, static_cast<GLsizei>(pos_cut_segments.size()/3));

From 2363e94f7db77ff0a0c8afb5c4a8f4e089e0f774 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 22 Nov 2023 13:30:28 +0100
Subject: [PATCH 1069/1398] Do not use "Polygon" typedef

---
 .../Alpha_wrap_3/pause_and_resume_wrapping.cpp     | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp b/Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp
index b22b21d817bc..cee169048c32 100644
--- a/Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp
+++ b/Alpha_wrap_3/examples/Alpha_wrap_3/pause_and_resume_wrapping.cpp
@@ -32,8 +32,8 @@ using K = CGAL::Exact_predicates_inexact_constructions_kernel;
 using Point_3 = K::Point_3;
 
 using Points = std::vector<Point_3>;
-using Polygon = std::array<std::size_t, 3>;
-using Polygons = std::vector<Polygon>;
+using Face = std::array<std::size_t, 3>;
+using Faces = std::vector<Face>;
 
 using Mesh = CGAL::Surface_mesh<Point_3>;
 using face_descriptor = boost::graph_traits<Mesh>::face_descriptor;
@@ -83,14 +83,14 @@ int main(int argc, char** argv)
 
   // = read the soup
   Points points;
-  Polygons polygons;
-  if(!CGAL::IO::read_polygon_soup(filename, points, polygons) || polygons.empty())
+  Faces faces;
+  if(!CGAL::IO::read_polygon_soup(filename, points, faces) || faces.empty())
   {
     std::cerr << "Invalid soup input: " << filename << std::endl;
     return EXIT_FAILURE;
   }
 
-  std::cout << "Input: " << points.size() << " points, " << polygons.size() << " faces" << std::endl;
+  std::cout << "Input: " << points.size() << " points, " << faces.size() << " faces" << std::endl;
 
   // Compute the alpha and offset values
   const double relative_alpha = (argc > 2) ? std::stod(argv[2]) : rng.get_double(150., 200.);
@@ -111,7 +111,7 @@ int main(int argc, char** argv)
   // Build the wrapper
   using Oracle = CGAL::Alpha_wraps_3::internal::Triangle_soup_oracle<K>;
   Oracle oracle(alpha);
-  oracle.add_triangle_soup(points, polygons, CGAL::parameters::default_values());
+  oracle.add_triangle_soup(points, faces, CGAL::parameters::default_values());
   CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle> aw3(oracle);
 
   // --- Launch the wrapping, and pause when the algorithm has spent 1s flooding
@@ -139,7 +139,7 @@ int main(int argc, char** argv)
 
   // --- Get the final wrap, in one go:
   Mesh single_pass_wrap;
-  CGAL::alpha_wrap_3(points, polygons, alpha, offset, single_pass_wrap);
+  CGAL::alpha_wrap_3(points, faces, alpha, offset, single_pass_wrap);
   std::cout << ">>> The final (from scratch) wrap has " << num_vertices(single_pass_wrap) << " vertices" << std::endl;
 
   output_name = generate_output_name(filename, relative_alpha, relative_offset);

From e4f669561890ae46c61ed238ca8bc1df8ef06a8d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 22 Nov 2023 13:30:37 +0100
Subject: [PATCH 1070/1398] Avoid /!\ in comments

---
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h         | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 94694034cdd1..2bfae11f3b72 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -282,14 +282,14 @@ class Alpha_wrapper_3
     // Whether to keep pockets of "outside" cells that are not connected to the exterior (or to the
     // initial cavities, if used).
     //
-    // /!\ Warning /!\
+    // -- Warning --
     // If you refine or pause while removing pockets, you will get valid but different wraps.
     const bool keep_inner_ccs = choose_parameter(get_parameter(in_np, internal_np::keep_inner_connected_components), true);
 
     // This parameter enables avoiding recomputing the triangulation from scratch when wrapping
     // the same input for multiple values of alpha (and typically the same offset values).
     //
-    // /!\ Warning /!\
+    // -- Warning --
     // If this is enabled, the 3D triangulation will NOT be re-initialized at launch.
     // This means that the triangulation is NOT cleared, even if:
     // - you use an alpha value that is greater than what was used in a previous run; you will

From 22c2318a55d1589bc581b6110b39f6a527b3a4c1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 22 Nov 2023 13:30:48 +0100
Subject: [PATCH 1071/1398] Add a todo

---
 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 2bfae11f3b72..8529af0b0f22 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -1087,6 +1087,9 @@ class Alpha_wrapper_3
       return false;
 #endif
 
+    // @todo could avoid useless facet_status() calls by doing it after the zombie check
+    // for the unsorted priority queue, but AFAIR, it doesn't save noticeable time (and that
+    // increases the queue size).
     const Facet_status status = facet_status(f);
     if(status == Facet_status::IRRELEVANT)
       return false;

From 2bc087a139d19802686da58ff434b38fef85792f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 22 Nov 2023 13:33:45 +0100
Subject: [PATCH 1072/1398] Fix warnings

---
 Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h  | 2 +-
 .../include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h    | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 8529af0b0f22..d3d2beb6c6e4 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -95,7 +95,7 @@ struct Wrapping_default_visitor
   void on_flood_fill_begin(const AlphaWrapper&) { }
 
   template <typename Wrapper>
-  constexpr bool go_further(const Wrapper& wrapper) { return true; }
+  constexpr bool go_further(const Wrapper&) { return true; }
 
   template <typename AlphaWrapper, typename Gate>
   void before_facet_treatment(const AlphaWrapper&, const Gate&) { }
diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
index f7947f246a4b..ec48b4f458b6 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/gate_priority_queue.h
@@ -121,7 +121,7 @@ class Gate
 public:
   const Facet& facet() const { return m_facet; }
 
-  const bool is_zombie() const
+  bool is_zombie() const
   {
     return (m_facet.first->erase_counter() != m_erase_counter_mem) ||
            (m_mirror_facet.first->erase_counter() != m_mirror_erase_counter_mem);

From dac83a571769dfc7313e278866eb1720512a1e42 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 22 Nov 2023 15:11:11 +0000
Subject: [PATCH 1073/1398] PMP examples: unify type names

---
 .../compute_normals_example.cpp                    | 14 +++++++-------
 .../compute_normals_example_Polyhedron.cpp         |  8 ++++----
 .../Polygon_mesh_processing/corefinement_LCC.cpp   |  4 ++--
 .../examples/Polygon_mesh_processing/extrude.cpp   | 14 +++++++-------
 .../hole_filling_example.cpp                       | 10 +++++-----
 .../hole_filling_example_LCC.cpp                   | 10 +++++-----
 .../interpolated_corrected_curvatures_PH.cpp       | 12 ++++++------
 .../interpolated_corrected_curvatures_SM.cpp       | 11 ++++++-----
 .../interpolated_corrected_curvatures_vertex.cpp   |  8 +++++---
 .../orient_polygon_soup_example.cpp                |  6 +++---
 .../point_inside_example.cpp                       | 10 +++++-----
 .../polyhedral_envelope.cpp                        |  6 +++---
 .../polyhedral_envelope_mesh_containment.cpp       | 10 +++++-----
 .../random_perturbation_SM_example.cpp             |  8 ++++----
 .../refine_fair_example.cpp                        | 12 ++++++------
 .../remesh_almost_planar_patches.cpp               |  6 +++---
 .../remesh_planar_patches.cpp                      | 10 +++++-----
 .../stitch_borders_example.cpp                     |  4 ++--
 .../stitch_borders_example_OM.cpp                  |  2 +-
 .../triangulate_faces_example.cpp                  |  6 +++---
 .../triangulate_faces_split_visitor_example.cpp    | 13 ++++++-------
 .../volume_connected_components.cpp                | 13 +++++++------
 22 files changed, 100 insertions(+), 97 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/compute_normals_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/compute_normals_example.cpp
index c7e1fbdb21c4..949fcc8dd649 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/compute_normals_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/compute_normals_example.cpp
@@ -7,14 +7,14 @@
 #include <iostream>
 #include <string>
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel       K;
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
 
-typedef K::Point_3                                                Point;
-typedef K::Vector_3                                               Vector;
+typedef K::Point_3                                          Point;
+typedef K::Vector_3                                         Vector;
 
-typedef CGAL::Surface_mesh<Point>                                 Surface_mesh;
-typedef boost::graph_traits<Surface_mesh>::vertex_descriptor      vertex_descriptor;
-typedef boost::graph_traits<Surface_mesh>::face_descriptor        face_descriptor;
+typedef CGAL::Surface_mesh<Point>                           Mesh;
+typedef boost::graph_traits<Mesh>::vertex_descriptor        vertex_descriptor;
+typedef boost::graph_traits<Mesh>::face_descriptor          face_descriptor;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
@@ -22,7 +22,7 @@ int main(int argc, char* argv[])
 {
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/eight.off");
 
-  Surface_mesh mesh;
+  Mesh mesh;
   if(!PMP::IO::read_polygon_mesh(filename, mesh))
   {
     std::cerr << "Invalid input." << std::endl;
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/compute_normals_example_Polyhedron.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/compute_normals_example_Polyhedron.cpp
index d21d675eb2b8..4418c6096d1b 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/compute_normals_example_Polyhedron.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/compute_normals_example_Polyhedron.cpp
@@ -16,9 +16,9 @@ typedef CGAL::Exact_predicates_inexact_constructions_kernel   K;
 typedef K::Point_3                                            Point;
 typedef K::Vector_3                                           Vector;
 
-typedef CGAL::Polyhedron_3<K>                                 Polyhedron;
-typedef boost::graph_traits<Polyhedron>::vertex_descriptor    vertex_descriptor;
-typedef boost::graph_traits<Polyhedron>::face_descriptor      face_descriptor;
+typedef CGAL::Polyhedron_3<K>                                 Mesh;
+typedef boost::graph_traits<Mesh>::vertex_descriptor          vertex_descriptor;
+typedef boost::graph_traits<Mesh>::face_descriptor            face_descriptor;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
@@ -26,7 +26,7 @@ int main(int argc, char* argv[])
 {
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/eight.off");
 
-  Polyhedron mesh;
+  Mesh mesh;
   if(!PMP::IO::read_polygon_mesh(filename, mesh))
   {
     std::cerr << "Invalid input." << std::endl;
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_LCC.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_LCC.cpp
index 232164a1b957..d4d774d1105f 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_LCC.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_LCC.cpp
@@ -12,7 +12,7 @@ typedef CGAL::Exact_predicates_inexact_constructions_kernel   Kernel;
 typedef Kernel::Point_3                                       Point;
 
 typedef CGAL::Linear_cell_complex_traits<3, Kernel>           MyTraits;
-typedef CGAL::Linear_cell_complex_for_bgl_combinatorial_map_helper<2, 3, MyTraits>::type LCC;
+typedef CGAL::Linear_cell_complex_for_bgl_combinatorial_map_helper<2, 3, MyTraits>::type Mesh;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
@@ -21,7 +21,7 @@ int main(int argc, char* argv[])
   const std::string filename1 = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/blobby.off");
   const std::string filename2 = (argc > 2) ? argv[2] : CGAL::data_file_path("meshes/eight.off");
 
-  LCC mesh1, mesh2;
+  Mesh mesh1, mesh2;
   if(!PMP::IO::read_polygon_mesh(filename1, mesh1) || !PMP::IO::read_polygon_mesh(filename2, mesh2))
   {
     std::cerr << "Invalid input." << std::endl;
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/extrude.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/extrude.cpp
index aa7c2bd40eab..baaa0612452d 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/extrude.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/extrude.cpp
@@ -8,13 +8,13 @@
 #include <fstream>
 #include <string>
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel  Kernel;
-typedef CGAL::Surface_mesh<Kernel::Point_3> SM;
-typedef boost::graph_traits<SM>::vertex_descriptor           vertex_descriptor;
+typedef CGAL::Exact_predicates_inexact_constructions_kernel    Kernel;
+typedef CGAL::Surface_mesh<Kernel::Point_3>                    Mesh;
+typedef boost::graph_traits<Mesh>::vertex_descriptor           vertex_descriptor;
 
-typedef Kernel::Vector_3                                     Vector;
-typedef boost::property_map<SM, CGAL::vertex_point_t>::type  VPMap;
-typedef SM::template Property_map<vertex_descriptor, Vector> VNMap;
+typedef Kernel::Vector_3                                       Vector;
+typedef boost::property_map<Mesh, CGAL::vertex_point_t>::type  VPMap;
+typedef Mesh::template Property_map<vertex_descriptor, Vector> VNMap;
 
 struct Bottom
 {
@@ -52,7 +52,7 @@ struct Top
 
 int main(int argc, char* argv[])
 {
-  SM in, out;
+  Mesh in, out;
 
   std::string filename = (argc > 1) ? std::string(argv[1]) : CGAL::data_file_path("meshes/cube-ouvert.off");
   double vlen = (argc > 2) ? std::stod(argv[2]) : 0.1;
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example.cpp
index 8c7d009461be..194db942db7c 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example.cpp
@@ -12,11 +12,11 @@
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel   Kernel;
 
-typedef CGAL::Polyhedron_3<Kernel>                            Polyhedron;
+typedef CGAL::Polyhedron_3<Kernel>                            Mesh;
 
-typedef Polyhedron::Vertex_handle                             Vertex_handle;
-typedef Polyhedron::Halfedge_handle                           Halfedge_handle;
-typedef Polyhedron::Facet_handle                              Facet_handle;
+typedef Mesh::Vertex_handle                                   Vertex_handle;
+typedef Mesh::Halfedge_handle                                 Halfedge_handle;
+typedef Mesh::Facet_handle                                    Facet_handle;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
@@ -24,7 +24,7 @@ int main(int argc, char* argv[])
 {
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/mech-holes-shark.off");
 
-  Polyhedron poly;
+  Mesh poly;
   if(!PMP::IO::read_polygon_mesh(filename, poly))
   {
     std::cerr << "Invalid input." << std::endl;
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example_LCC.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example_LCC.cpp
index be7b6166e4e1..898256005108 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example_LCC.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/hole_filling_example_LCC.cpp
@@ -14,11 +14,11 @@
 typedef CGAL::Exact_predicates_inexact_constructions_kernel                              Kernel;
 typedef Kernel::Point_3                                                                  Point;
 typedef CGAL::Linear_cell_complex_traits<3, Kernel>                                      MyTraits;
-typedef CGAL::Linear_cell_complex_for_bgl_combinatorial_map_helper<2, 3, MyTraits>::type LCC;
+typedef CGAL::Linear_cell_complex_for_bgl_combinatorial_map_helper<2, 3, MyTraits>::type Mesh;
 
-typedef boost::graph_traits<LCC>::vertex_descriptor                                      vertex_descriptor;
-typedef boost::graph_traits<LCC>::halfedge_descriptor                                    halfedge_descriptor;
-typedef boost::graph_traits<LCC>::face_descriptor                                        face_descriptor;
+typedef boost::graph_traits<Mesh>::vertex_descriptor                                     vertex_descriptor;
+typedef boost::graph_traits<Mesh>::halfedge_descriptor                                   halfedge_descriptor;
+typedef boost::graph_traits<Mesh>::face_descriptor                                       face_descriptor;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
@@ -26,7 +26,7 @@ int main(int argc, char* argv[])
 {
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/mech-holes-shark.off");
 
-  LCC mesh;
+  Mesh mesh;
   if(!PMP::IO::read_polygon_mesh(filename, mesh))
   {
     std::cerr << "Invalid input." << std::endl;
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
index 09bc213068d1..678597ad255c 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_PH.cpp
@@ -7,17 +7,17 @@
 #include <boost/graph/graph_traits.hpp>
 
 #include <iostream>
-#include <unordered_map>
+#include <string>
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
-typedef CGAL::Polyhedron_3<Epic_kernel> Polyhedron;
-typedef boost::graph_traits<Polyhedron>::vertex_descriptor vertex_descriptor;
+typedef CGAL::Polyhedron_3<Epic_kernel>                     Mesh;
+typedef boost::graph_traits<Mesh>::vertex_descriptor        vertex_descriptor;
 
 int main(int argc, char* argv[])
 {
-  Polyhedron polyhedron;
+  Mesh polyhedron;
   const std::string filename = (argc > 1) ?
     argv[1] :
     CGAL::data_file_path("meshes/sphere.off");
@@ -29,11 +29,11 @@ int main(int argc, char* argv[])
   }
 
   // define property map to store curvature value and directions
-  boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
+  boost::property_map<Mesh, CGAL::dynamic_vertex_property_t<Epic_kernel::FT>>::type
     mean_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron),
     Gaussian_curvature_map = get(CGAL::dynamic_vertex_property_t<Epic_kernel::FT>(), polyhedron);
 
-  boost::property_map<Polyhedron, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
+  boost::property_map<Mesh, CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>>::type
     principal_curvatures_and_directions_map =
     get(CGAL::dynamic_vertex_property_t<PMP::Principal_curvatures_and_directions<Epic_kernel>>(), polyhedron);
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
index 74a678ea0624..ac8378781fe4 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_SM.cpp
@@ -11,12 +11,12 @@
 namespace PMP = CGAL::Polygon_mesh_processing;
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
-typedef CGAL::Surface_mesh<Epic_kernel::Point_3> Surface_Mesh;
-typedef boost::graph_traits<Surface_Mesh>::vertex_descriptor vertex_descriptor;
+typedef CGAL::Surface_mesh<Epic_kernel::Point_3> Mesh;
+typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
 
 int main(int argc, char* argv[])
 {
-  Surface_Mesh smesh;
+  Mesh smesh;
   const std::string filename = (argc > 1) ?
     argv[1] :
     CGAL::data_file_path("meshes/sphere.off");
@@ -29,7 +29,7 @@ int main(int argc, char* argv[])
 
   // creating and tying surface mesh property maps for curvatures (with defaults = 0)
   bool created = false;
-  Surface_Mesh::Property_map<vertex_descriptor, Epic_kernel::FT>
+  Mesh::Property_map<vertex_descriptor, Epic_kernel::FT>
     mean_curvature_map, Gaussian_curvature_map;
 
   boost::tie(mean_curvature_map, created) =
@@ -41,7 +41,7 @@ int main(int argc, char* argv[])
   assert(created);
 
   // we use a tuple of 2 scalar values and 2 vectors for principal curvatures and directions
-  Surface_Mesh::Property_map<vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>>
+  Mesh::Property_map<vertex_descriptor, PMP::Principal_curvatures_and_directions<Epic_kernel>>
     principal_curvatures_and_directions_map;
 
   boost::tie(principal_curvatures_and_directions_map, created) =
@@ -67,4 +67,5 @@ int main(int argc, char* argv[])
       << ", GC = " << Gaussian_curvature_map[v] << "\n"
       << ", PC = [ " << PC.min_curvature << " , " << PC.max_curvature << " ]\n";
   }
+  return 0;
 }
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
index bdcdba6b7fd0..dc78152059b7 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/interpolated_corrected_curvatures_vertex.cpp
@@ -6,17 +6,18 @@
 #include <boost/graph/graph_traits.hpp>
 
 #include <iostream>
+#include <string>
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Epic_kernel;
-typedef CGAL::Surface_mesh<Epic_kernel::Point_3> Surface_Mesh;
-typedef boost::graph_traits<Surface_Mesh>::vertex_descriptor vertex_descriptor;
+typedef CGAL::Surface_mesh<Epic_kernel::Point_3>            Mesh;
+typedef boost::graph_traits<Mesh>::vertex_descriptor        vertex_descriptor;
 
 int main(int argc, char* argv[])
 {
   // instantiating and reading mesh
-  Surface_Mesh smesh;
+  Mesh smesh;
   const std::string filename = (argc > 1) ?
     argv[1] :
     CGAL::data_file_path("meshes/sphere.off");
@@ -47,4 +48,5 @@ int main(int argc, char* argv[])
       << ", GC = " << g << "\n"
       << ", PC = [ " << p.min_curvature << " , " << p.max_curvature << " ]\n";
   }
+  return 0;
 }
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/orient_polygon_soup_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/orient_polygon_soup_example.cpp
index f603925bb6b3..072ec4c6360a 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/orient_polygon_soup_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/orient_polygon_soup_example.cpp
@@ -15,7 +15,7 @@
 #include <vector>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel          K;
-typedef CGAL::Polyhedron_3<K, CGAL::Polyhedron_items_with_id_3>      Polyhedron;
+typedef CGAL::Polyhedron_3<K, CGAL::Polyhedron_items_with_id_3>      Mesh;
 
 // Optional visitor for orientating a polygon soup to demonstrate usage for some functions.
 // inherits from the default class as some functions are not overloaded
@@ -59,12 +59,12 @@ int main(int argc, char* argv[])
   Visitor visitor;
   CGAL::Polygon_mesh_processing::orient_polygon_soup(points, polygons, CGAL::parameters::visitor(visitor));
 
-  Polyhedron mesh;
+  Mesh mesh;
   CGAL::Polygon_mesh_processing::polygon_soup_to_polygon_mesh(points, polygons, mesh);
 
   // Number the faces because 'orient_to_bound_a_volume' needs a face <--> index map
   int index = 0;
-  for(Polyhedron::Face_iterator fb=mesh.facets_begin(), fe=mesh.facets_end(); fb!=fe; ++fb)
+  for(Mesh::Face_iterator fb=mesh.facets_begin(), fe=mesh.facets_end(); fb!=fe; ++fb)
     fb->id() = index++;
 
   if(CGAL::is_closed(mesh))
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/point_inside_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/point_inside_example.cpp
index 93b158ce1923..1a8b207cd6bb 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/point_inside_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/point_inside_example.cpp
@@ -12,14 +12,14 @@
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel    K;
 typedef K::Point_3                                             Point;
-typedef CGAL::Polyhedron_3<K>                                  Polyhedron;
+typedef CGAL::Polyhedron_3<K>                                  Mesh;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
-double max_coordinate(const Polyhedron& poly)
+double max_coordinate(const Mesh& poly)
 {
   double max_coord = -std::numeric_limits<double>::infinity();
-  for(Polyhedron::Vertex_handle v : vertices(poly))
+  for(Mesh::Vertex_handle v : vertices(poly))
   {
     Point p = v->point();
     max_coord = (std::max)(max_coord, CGAL::to_double(p.x()));
@@ -33,14 +33,14 @@ int main(int argc, char* argv[])
 {
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/eight.off");
 
-  Polyhedron poly;
+  Mesh poly;
   if(!PMP::IO::read_polygon_mesh(filename, poly) || CGAL::is_empty(poly) || !CGAL::is_triangle_mesh(poly))
   {
     std::cerr << "Invalid input." << std::endl;
     return 1;
   }
 
-  CGAL::Side_of_triangle_mesh<Polyhedron, K> inside(poly);
+  CGAL::Side_of_triangle_mesh<Mesh, K> inside(poly);
 
   double size = max_coordinate(poly);
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/polyhedral_envelope.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/polyhedral_envelope.cpp
index afbb938afb51..5cc9379992f8 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/polyhedral_envelope.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/polyhedral_envelope.cpp
@@ -9,13 +9,13 @@ int main(int argc, char* argv[])
 {
   typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
   typedef Kernel::Point_3 Point_3;
-  typedef CGAL::Surface_mesh<Point_3> Surface_mesh;
-  typedef boost::graph_traits<Surface_mesh>::vertex_descriptor vertex_descriptor;
+  typedef CGAL::Surface_mesh<Point_3> Mesh;
+  typedef boost::graph_traits<Mesh>::vertex_descriptor vertex_descriptor;
 
   typedef CGAL::Polyhedral_envelope<Kernel> Envelope;
 
   std::ifstream in((argc>1) ? argv[1] : CGAL::data_file_path("meshes/blobby.off"));
-  Surface_mesh tmesh;
+  Mesh tmesh;
 
   in >> tmesh;
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/polyhedral_envelope_mesh_containment.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/polyhedral_envelope_mesh_containment.cpp
index 4e814c7dccd5..ede5edf61e8f 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/polyhedral_envelope_mesh_containment.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/polyhedral_envelope_mesh_containment.cpp
@@ -13,19 +13,19 @@ int main(int argc, char* argv[])
 {
   typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
   typedef Kernel::Point_3 Point_3;
-  typedef CGAL::Surface_mesh<Point_3> Surface_mesh;
+  typedef CGAL::Surface_mesh<Point_3> Mesh;
 
   typedef CGAL::Polyhedral_envelope<Kernel> Envelope;
 
   std::ifstream in((argc>1) ? argv[1] : CGAL::data_file_path("meshes/blobby.off"));
-  Surface_mesh tmesh;
+  Mesh tmesh;
   in >> tmesh;
 
   // remesh the input using the longest edge size as target edge length
-  Surface_mesh query = tmesh;
-  Surface_mesh::Edge_iterator longest_edge_it =
+  Mesh query = tmesh;
+  Mesh::Edge_iterator longest_edge_it =
     std::max_element(edges(query).begin(), edges(query).end(),
-                     [&query](Surface_mesh::Edge_index e1, Surface_mesh::Edge_index e2)
+                     [&query](Mesh::Edge_index e1, Mesh::Edge_index e2)
                      {
                         return PMP::edge_length(halfedge(e1, query), query) <
                                PMP::edge_length(halfedge(e2, query), query);
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/random_perturbation_SM_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/random_perturbation_SM_example.cpp
index 742685e7485c..e043f6a9a770 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/random_perturbation_SM_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/random_perturbation_SM_example.cpp
@@ -10,9 +10,9 @@
 typedef CGAL::Exact_predicates_inexact_constructions_kernel   K;
 typedef K::Point_3                                            Point;
 
-typedef CGAL::Surface_mesh<Point>                             Surface_mesh;
-typedef boost::graph_traits<Surface_mesh>::vertex_descriptor  vertex_descriptor;
-typedef boost::graph_traits<Surface_mesh>::face_descriptor    face_descriptor;
+typedef CGAL::Surface_mesh<Point>                             Mesh;
+typedef boost::graph_traits<Mesh>::vertex_descriptor          vertex_descriptor;
+typedef boost::graph_traits<Mesh>::face_descriptor            face_descriptor;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
@@ -20,7 +20,7 @@ int main(int argc, char* argv[])
 {
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/eight.off");
 
-  Surface_mesh mesh;
+  Mesh mesh;
   if(!PMP::IO::read_polygon_mesh(filename, mesh))
   {
     std::cerr << "Invalid input." << std::endl;
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/refine_fair_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/refine_fair_example.cpp
index 23053a6766c3..30f1ed16a14c 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/refine_fair_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/refine_fair_example.cpp
@@ -13,8 +13,8 @@
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
 
-typedef CGAL::Polyhedron_3<Kernel>                          Polyhedron;
-typedef Polyhedron::Vertex_handle                           Vertex_handle;
+typedef CGAL::Polyhedron_3<Kernel>                          Mesh;
+typedef Mesh::Vertex_handle                                 Vertex_handle;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
@@ -34,7 +34,7 @@ void extract_k_ring(Vertex_handle v,
   {
     v = qv[current_index++];
 
-    Polyhedron::Halfedge_around_vertex_circulator e(v->vertex_begin()), e_end(e);
+    Mesh::Halfedge_around_vertex_circulator e(v->vertex_begin()), e_end(e);
     do {
       Vertex_handle new_v = e->opposite()->vertex();
       if (D.insert(std::make_pair(new_v, dist_v + 1)).second)
@@ -47,14 +47,14 @@ int main(int argc, char* argv[])
 {
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/blobby.off");
 
-  Polyhedron poly;
+  Mesh poly;
   if(!PMP::IO::read_polygon_mesh(filename, poly) || !CGAL::is_triangle_mesh(poly))
   {
     std::cerr << "Invalid input." << std::endl;
     return 1;
   }
 
-  std::vector<Polyhedron::Facet_handle>  new_facets;
+  std::vector<Mesh::Facet_handle>  new_facets;
   std::vector<Vertex_handle> new_vertices;
 
   PMP::refine(poly, faces(poly),
@@ -68,7 +68,7 @@ int main(int argc, char* argv[])
   refined_off.close();
   std::cout << "Refinement added " << new_vertices.size() << " vertices." << std::endl;
 
-  Polyhedron::Vertex_iterator v = poly.vertices_begin();
+  Mesh::Vertex_iterator v = poly.vertices_begin();
   std::advance(v, 82/*e.g.*/);
   std::vector<Vertex_handle> region;
   extract_k_ring(v, 12/*e.g.*/, region);
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/remesh_almost_planar_patches.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/remesh_almost_planar_patches.cpp
index e3924c3e095c..381183d0c997 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/remesh_almost_planar_patches.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/remesh_almost_planar_patches.cpp
@@ -14,13 +14,13 @@
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
 typedef Kernel::Point_3 Point_3;
-typedef CGAL::Surface_mesh<Kernel::Point_3> Surface_mesh;
+typedef CGAL::Surface_mesh<Kernel::Point_3> Mesh;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
 int main()
 {
-  Surface_mesh sm;
+  Mesh sm;
   CGAL::IO::read_polygon_mesh(CGAL::data_file_path("meshes/fandisk.off"), sm);
 
   //apply a perturbation to input vertices so that points are no longer coplanar
@@ -51,7 +51,7 @@ int main()
                                                      edge_is_constrained_map(CGAL::make_random_access_property_map(ecm)));
 
   // run the remeshing algorithm using filled properties
-  Surface_mesh out;
+  Mesh out;
   PMP::remesh_almost_planar_patches(sm,
                                     out,
                                     nb_regions, nb_corners,
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/remesh_planar_patches.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/remesh_planar_patches.cpp
index 9f591e6a2696..92aa3b15c6fd 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/remesh_planar_patches.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/remesh_planar_patches.cpp
@@ -12,12 +12,12 @@
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
 typedef Kernel::Point_3 Point_3;
-typedef CGAL::Surface_mesh<Kernel::Point_3> Surface_mesh;
+typedef CGAL::Surface_mesh<Kernel::Point_3> Mesh;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 int main()
 {
-  Surface_mesh sm;
+  Mesh sm;
   CGAL::IO::read_polygon_mesh(CGAL::data_file_path("meshes/cube_quad.off"), sm);
 
   // triangulate faces;
@@ -25,8 +25,8 @@ int main()
   std::cout << "Input mesh has " << faces(sm).size() << " faces" << std::endl;
   assert(faces(sm).size()==12);
 
-  Surface_mesh::Property_map<Surface_mesh::Edge_index, bool> ecm =
-    sm.add_property_map<Surface_mesh::Edge_index, bool>("ecm",false).first;
+  Mesh::Property_map<Mesh::Edge_index, bool> ecm =
+    sm.add_property_map<Mesh::Edge_index, bool>("ecm",false).first;
 
   // detect sharp edges of the cube
   PMP::detect_sharp_edges(sm, 60, ecm);
@@ -37,7 +37,7 @@ int main()
   assert(faces(sm).size()>100);
 
   // decimate the mesh
-  Surface_mesh out;
+  Mesh out;
   PMP::remesh_planar_patches(sm, out);
   CGAL::IO::write_polygon_mesh("cube_decimated.off", out, CGAL::parameters::stream_precision(17));
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/stitch_borders_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/stitch_borders_example.cpp
index a7afc963ed70..28d770626e2c 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/stitch_borders_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/stitch_borders_example.cpp
@@ -9,7 +9,7 @@
 #include <string>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel   K;
-typedef CGAL::Polyhedron_3<K>                                 Polyhedron;
+typedef CGAL::Polyhedron_3<K>                                 Mesh;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
@@ -17,7 +17,7 @@ int main(int argc, char* argv[])
 {
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/quads_to_stitch.off");
 
-  Polyhedron mesh;
+  Mesh mesh;
   if(!PMP::IO::read_polygon_mesh(filename, mesh))
   {
     std::cerr << "Invalid input." << std::endl;
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/stitch_borders_example_OM.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/stitch_borders_example_OM.cpp
index b731e8c02201..cf97918fd3b8 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/stitch_borders_example_OM.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/stitch_borders_example_OM.cpp
@@ -10,8 +10,8 @@
 #include <string>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
-
 typedef OpenMesh::PolyMesh_ArrayKernelT< > Mesh;
+
 int main(int argc, char* argv[])
 {
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/quads_to_stitch.off");
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_faces_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_faces_example.cpp
index 7587d0123638..9c7ef677bc0a 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_faces_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_faces_example.cpp
@@ -11,7 +11,7 @@
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
 typedef Kernel::Point_3                                     Point;
-typedef CGAL::Surface_mesh<Point>                           Surface_mesh;
+typedef CGAL::Surface_mesh<Point>                           Mesh;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
@@ -20,7 +20,7 @@ int main(int argc, char* argv[])
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/P.off");
   const char* outfilename = (argc > 2) ? argv[2] : "P_tri.off";
 
-  Surface_mesh mesh;
+  Mesh mesh;
   if(!PMP::IO::read_polygon_mesh(filename, mesh))
   {
     std::cerr << "Error: Invalid input." << std::endl;
@@ -41,7 +41,7 @@ int main(int argc, char* argv[])
   PMP::triangulate_faces(mesh);
 
   // Confirm that all faces are triangles.
-  for(boost::graph_traits<Surface_mesh>::face_descriptor f : faces(mesh))
+  for(boost::graph_traits<Mesh>::face_descriptor f : faces(mesh))
   {
     if(!CGAL::is_triangle(halfedge(f, mesh), mesh))
       std::cerr << "Error: non-triangular face left in mesh." << std::endl;
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_faces_split_visitor_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_faces_split_visitor_example.cpp
index 9b246f7678df..84695b32e325 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_faces_split_visitor_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/triangulate_faces_split_visitor_example.cpp
@@ -6,15 +6,14 @@
 
 #include <iostream>
 #include <fstream>
-#include <map>
 #include <string>
 #include <unordered_map>
 #include <utility>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
-typedef Kernel::Point_3                    Point;
-typedef CGAL::Surface_mesh<Point>          Surface_mesh;
-typedef boost::graph_traits<Surface_mesh>::face_descriptor face_descriptor;
+typedef Kernel::Point_3                                     Point;
+typedef CGAL::Surface_mesh<Point>                           Mesh;
+typedef boost::graph_traits<Mesh>::face_descriptor          face_descriptor;
 
 class Insert_iterator
 {
@@ -41,7 +40,7 @@ class Insert_iterator
 };
 
 
-struct Visitor : public CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor<Surface_mesh>
+struct Visitor : public CGAL::Polygon_mesh_processing::Triangulate_faces::Default_visitor<Mesh>
 {
    typedef std::unordered_map<face_descriptor,face_descriptor> Container;
 
@@ -78,7 +77,7 @@ int main(int argc, char* argv[])
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/P.off");
   std::ifstream input(filename);
 
-  Surface_mesh mesh;
+  Mesh mesh;
   if (!input || !(input >> mesh) || mesh.is_empty())
   {
     std::cerr << "Not a valid off file." << std::endl;
@@ -87,7 +86,7 @@ int main(int argc, char* argv[])
 
   std::unordered_map<face_descriptor,face_descriptor> t2q;
 
-  Surface_mesh copy;
+  Mesh copy;
 
   CGAL::copy_face_graph(mesh, copy, CGAL::parameters::face_to_face_output_iterator(Insert_iterator(t2q)));
 
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/volume_connected_components.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/volume_connected_components.cpp
index bd4181c3ff48..e07c803b83e6 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/volume_connected_components.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/volume_connected_components.cpp
@@ -12,7 +12,7 @@
 #include <string>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel   Kernel;
-typedef CGAL::Surface_mesh<Kernel::Point_3>                   Surface_mesh;
+typedef CGAL::Surface_mesh<Kernel::Point_3>                   Mesh;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 namespace params = CGAL::parameters;
@@ -21,7 +21,7 @@ int main(int argc, char** argv)
 {
   const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/blobby.off");
 
-  Surface_mesh mesh;
+  Mesh mesh;
   if(!PMP::IO::read_polygon_mesh(filename, mesh))
   {
     std::cerr << "Invalid input." << std::endl;
@@ -29,8 +29,8 @@ int main(int argc, char** argv)
   }
 
   // property map to assign a volume id for each face
-  Surface_mesh::Property_map<Surface_mesh::Face_index, std::size_t> vol_id_map =
-    mesh.add_property_map<Surface_mesh::Face_index, std::size_t>().first;
+  Mesh::Property_map<Mesh::Face_index, std::size_t> vol_id_map =
+    mesh.add_property_map<Mesh::Face_index, std::size_t>().first;
 
   // fill the volume id map
   std::vector<PMP::Volume_error_code> err_codes;
@@ -39,7 +39,7 @@ int main(int argc, char** argv)
   std::cout << "Found " << nb_vol << " volumes\n";
 
   // write each volume in an OFF file
-  typedef CGAL::Face_filtered_graph<Surface_mesh> Filtered_graph;
+  typedef CGAL::Face_filtered_graph<Mesh> Filtered_graph;
   Filtered_graph vol_mesh(mesh, 0, vol_id_map);
   for(std::size_t id = 0; id < nb_vol; ++id)
   {
@@ -49,11 +49,12 @@ int main(int argc, char** argv)
     if(id > 0)
       vol_mesh.set_selected_faces(id, vol_id_map);
 
-    Surface_mesh out;
+    Mesh out;
     CGAL::copy_face_graph(vol_mesh, out);
     std::ostringstream oss;
     oss << "vol_" << id <<".off";
     std::ofstream os(oss.str().data());
     os << out;
   }
+  return 0;
 }

From f042f5a8eb2559146df06b535808af25683d6fe3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 22 Nov 2023 16:13:21 +0100
Subject: [PATCH 1074/1398] Fix initialization warning

---
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h       | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index d3d2beb6c6e4..5adf81dc443a 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -197,11 +197,11 @@ class Alpha_wrapper_3
 
   Alpha_wrapper_3(const Oracle& oracle)
     :
-#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
-      m_queue(4096),
-#endif
       m_oracle(oracle),
       m_tr(Geom_traits(oracle.geom_traits()))
+#ifdef CGAL_AW3_USE_SORTED_PRIORITY_QUEUE
+      , m_queue(4096)
+#endif
   {
     static_assert(std::is_floating_point<FT>::value);
   }

From d9bdf5cfc5eacb36c0c012d2c77651bf7b5dbbcd Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 23 Nov 2023 09:38:28 +0100
Subject: [PATCH 1075/1398] remove extra typename

---
 Triangulation_2/include/CGAL/Regular_triangulation_2.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Triangulation_2/include/CGAL/Regular_triangulation_2.h b/Triangulation_2/include/CGAL/Regular_triangulation_2.h
index d5d1a6c5917a..3353b7d76037 100644
--- a/Triangulation_2/include/CGAL/Regular_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Regular_triangulation_2.h
@@ -528,8 +528,8 @@ class Regular_triangulation_2
   insert(boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > first,
           boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
           std::enable_if_t<
-              typename std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point > &&
-              typename std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
+              std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point > &&
+              std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
           >* =nullptr
 )
   {return insert_with_info< boost::tuple<Weighted_point,typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type> >(first,last);}

From 6cd28f751ed670181c76660623e1e5d6185ce2e0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 23 Nov 2023 09:39:17 +0100
Subject: [PATCH 1076/1398] use std integral_constant

---
 STL_Extension/include/CGAL/tags.h | 15 +--------------
 1 file changed, 1 insertion(+), 14 deletions(-)

diff --git a/STL_Extension/include/CGAL/tags.h b/STL_Extension/include/CGAL/tags.h
index 6aa1988e1cc7..eba9ffdc7215 100644
--- a/STL_Extension/include/CGAL/tags.h
+++ b/STL_Extension/include/CGAL/tags.h
@@ -19,26 +19,13 @@
 #define CGAL_TAGS_H
 
 #include <CGAL/IO/io_tags.h>
-#include <boost/mpl/integral_c.hpp>
 
 namespace CGAL {
 
 struct Void {};
 
-// Boolean_tag<bool> is a model of the Boost Integral Constant concept.
-// https://www.boost.org/libs/mpl/doc/refmanual/integral-constant.html
 template <bool b>
-struct Boolean_tag {
-  typedef boost::mpl::integral_c_tag tag;
-  typedef bool value_type;
-  static const bool value = b;
-  typedef Boolean_tag<b> type;
-  operator bool() const { return this->value; }
-};
-/* In C++11, try:
-template <bool b>
-using Boolean_tag = std::integral_constant<bool, b>;
-*/
+using Boolean_tag = std::bool_constant<b>;
 
 typedef Boolean_tag<true>   Tag_true;
 typedef Boolean_tag<false>  Tag_false;

From 16de47d1e6543e08259f68e83f6625790ceaf2d1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 23 Nov 2023 14:55:30 +0100
Subject: [PATCH 1077/1398] more fixes

---
 .../include/CGAL/Polygon_mesh_processing/intersection.h       | 4 ++--
 QP_solver/test/QP_solver/test_solver.cpp                      | 1 +
 Triangulation_3/include/CGAL/Regular_triangulation_3.h        | 4 ++--
 3 files changed, 5 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
index a72d9ffaafc9..a996edae6483 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/intersection.h
@@ -1428,12 +1428,12 @@ bool do_intersect(const TriangleMesh& tm,
 #ifndef DOXYGEN_RUNNING
                 , const std::enable_if_t<!(
                       std::is_same_v<TriangleMesh, Polyline> || // Added to please MSVC 2015
-                      !boost::has_range_iterator<Polyline>::type>::value || // not a range
+                      !boost::has_range_iterator<Polyline>::value || // not a range
                       boost::has_range_iterator<
                         typename boost::mpl::eval_if<
                           boost::has_range_iterator<Polyline>,
                           boost::range_value<Polyline>,
-                          std::false_type
+                          std::false_type>::type
                         >::value
                     )
                   >* = 0
diff --git a/QP_solver/test/QP_solver/test_solver.cpp b/QP_solver/test/QP_solver/test_solver.cpp
index ad298449b551..4fc641cc2867 100644
--- a/QP_solver/test/QP_solver/test_solver.cpp
+++ b/QP_solver/test/QP_solver/test_solver.cpp
@@ -282,6 +282,7 @@ bool process(const std::string& filename,
 {
   using std::cout;
   using std::endl;
+  using CGAL::check_tag;
 
   // extract verbosity:
   const int verbosity = options.find("Verbosity")->second;
diff --git a/Triangulation_3/include/CGAL/Regular_triangulation_3.h b/Triangulation_3/include/CGAL/Regular_triangulation_3.h
index b4ff7de189cf..180269625203 100644
--- a/Triangulation_3/include/CGAL/Regular_triangulation_3.h
+++ b/Triangulation_3/include/CGAL/Regular_triangulation_3.h
@@ -612,8 +612,8 @@ class Regular_triangulation_3
   insert(boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > first,
          boost::zip_iterator< boost::tuple<InputIterator_1,InputIterator_2> > last,
          std::enable_if_t<
-           typename std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point > &&
-           typename std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
+           std::is_convertible_v< typename std::iterator_traits<InputIterator_1>::value_type, Weighted_point > &&
+           std::is_convertible_v< typename std::iterator_traits<InputIterator_2>::value_type, typename internal::Info_check<typename Triangulation_data_structure::Vertex>::type >
          >* =nullptr)
   {
     return insert_with_info<

From 7fdc36dbbef57506c9431f248c16ee3eeb1d1c58 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 23 Nov 2023 15:48:46 +0100
Subject: [PATCH 1078/1398] remove *_sizing_field criteria from test

---
 .../Mesh_3/test_mesh_criteria_creation.cpp    | 84 ++++---------------
 1 file changed, 16 insertions(+), 68 deletions(-)

diff --git a/Mesh_3/test/Mesh_3/test_mesh_criteria_creation.cpp b/Mesh_3/test/Mesh_3/test_mesh_criteria_creation.cpp
index b81befd7a56a..fb74fa720e4b 100644
--- a/Mesh_3/test/Mesh_3/test_mesh_criteria_creation.cpp
+++ b/Mesh_3/test/Mesh_3/test_mesh_criteria_creation.cpp
@@ -75,28 +75,12 @@ int main()
   Mc ec1(edge_size = 1);
   assert( ec1.edge_criteria_object().sizing_field(bp1,1,index) == 1 );
 
-  Mc ec2(edge_sizing_field = Esf(2));
+  Mc ec2(edge_size = Esf(2));
   assert( ec2.edge_criteria_object().sizing_field(bp1,1,index) == 2 );
 
-  Mc ec3(edge_sizing_field = 3.);
+  Mc ec3(edge_size = 3.);
   assert( ec3.edge_criteria_object().sizing_field(bp1,1,index) == 3 );
 
-  Mc ec4(edge_size = 4.,
-         edge_sizing_field = Esf(5.));
-  assert( ec4.edge_criteria_object().sizing_field(bp1,1,index) == 4. );
-
-  Mc ec5(sizing_field = 5.);
-  assert( ec5.edge_criteria_object().sizing_field(bp1,1,index) == 5 );
-
-  Mc ec6(sizing_field = 6.,
-         edge_sizing_field = 7.);
-  assert( ec6.edge_criteria_object().sizing_field(bp1,1,index) == 7. );
-
-  Mc ec7(sizing_field = 7.,
-         edge_size = 8.);
-  assert( ec7.edge_criteria_object().sizing_field(bp1,1,index) == 8. );
-
-
   // -----------------------------------
   // Test facet criteria
   // -----------------------------------
@@ -114,43 +98,25 @@ int main()
   Mc fc1(facet_size = facet_size_ok);
   assert( ! fc1.facet_criteria_object()(tr, f) );
 
-  Mc fc2(facet_sizing_field = facet_size_ok);
-  assert( ! fc2.facet_criteria_object()(tr, f) );
-
-  Mc fc3(facet_sizing_field = Fsf(facet_size_ok));
+  Mc fc3(facet_size = Fsf(facet_size_ok));
   assert( ! fc3.facet_criteria_object()(tr, f) );
 
-  Mc fc4(facet_sizing_field = facet_size_nok,
-         facet_size = facet_size_ok);
-  assert( ! fc4.facet_criteria_object()(tr, f) );
-
-  Mc fc5(sizing_field = facet_size_ok);
-  assert( ! fc5.facet_criteria_object()(tr, f) );
-
-  Mc fc6(facet_size = facet_size_ok,
-         facet_sizing_field = facet_size_nok,
-         sizing_field = facet_size_nok);
-  assert( ! fc6.facet_criteria_object()(tr, f) );
-
-  Mc fc7(facet_sizing_field = Fsf(facet_size_ok),
-         sizing_field = facet_size_nok);
-  assert( ! fc7.facet_criteria_object()(tr, f) );
-
   Mc fc8(facet_distance = 8.);
   Mc fc9(facet_angle = 9.);
   Mc fc10(facet_angle = 10.1,
           facet_distance = 10.2,
           facet_size = 10.3,
-          facet_min_size = 0.2,
-          facet_sizing_field = Fsf(10.4),
-          sizing_field = 10.5);
+          facet_min_size = 0.2);
+  Mc fc1Ob(facet_angle = 10.11,
+          facet_distance = 10.12,
+          facet_min_size = 0.3,
+          facet_size = Fsf(10.14));
 
   // Test construction from int
   Mc fc11(facet_size = 11);
   Mc fc11b(facet_size = 11, facet_min_size = 1);
-  Mc fc12(facet_sizing_field = 12);
-  Mc fc12b(facet_sizing_field = 12, facet_min_size = 2);
-  Mc fc13(sizing_field = 13);
+  Mc fc12(facet_size = Fsf(12));
+  Mc fc12b(facet_size = Fsf(12), facet_min_size = 1);
 
   // Test topological criterion creation
   Mc fc14(facet_topology = CGAL::FACET_VERTICES_ON_SURFACE);
@@ -173,41 +139,23 @@ int main()
   Mc cc1(cell_size = cell_size_ok);
   assert( ! cc1.cell_criteria_object()(tr, ch) );
 
-  Mc cc2(cell_sizing_field = cell_size_ok);
-  assert( ! cc2.cell_criteria_object()(tr, ch) );
-
-  Mc cc3(cell_sizing_field = Fsf(cell_size_ok));
+  Mc cc3(cell_size = Fsf(cell_size_ok));
   assert( ! cc3.cell_criteria_object()(tr, ch) );
 
-  Mc cc4(cell_sizing_field = cell_size_nok,
-         cell_size = cell_size_ok);
-  assert( ! cc4.cell_criteria_object()(tr, ch) );
-
-  Mc cc5(sizing_field = cell_size_ok);
-  assert( ! cc5.cell_criteria_object()(tr, ch) );
-
-  Mc cc6(cell_size = cell_size_ok,
-         cell_sizing_field = cell_size_nok,
-         sizing_field = cell_size_nok);
-  assert( ! cc6.cell_criteria_object()(tr, ch) );
-
-  Mc cc7(cell_sizing_field = Csf(cell_size_ok),
-         sizing_field = cell_size_nok);
+  Mc cc7(cell_size = Csf(cell_size_ok));
   assert( ! cc7.cell_criteria_object()(tr, ch) );
 
   Mc cc8(cell_radius_edge_ratio = 8.);
   Mc cc9(cell_radius_edge_ratio = 9.1,
-         sizing_field = Csf(9.2) );
+         cell_size = Csf(9.2) );
   Mc cc10(cell_radius_edge_ratio = 10.1,
           cell_size = 10.2,
+          cell_min_size = 0.1);
+  Mc cc10b(cell_radius_edge_ratio = 10.1,
           cell_min_size = 0.1,
-          cell_sizing_field = Csf(10.3),
-          sizing_field = 10.4);
+          cell_size = Csf(10.3));
 
   // Test construction from int
   Mc cc11(cell_size = 11);
   Mc cc11b(cell_size = 11, cell_min_size = 1);
-  Mc cc12(cell_sizing_field = 12);
-  Mc cc12b(cell_sizing_field = 12, cell_min_size = 2);
-  Mc cc13(sizing_field = 13);
 }

From 9262c6a8b681d35903e1eb9e5126012542eb91b7 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 23 Nov 2023 17:25:18 +0100
Subject: [PATCH 1079/1398] Re-add CGAL_ITK_support.cmake

That will allow to be compatible with ITK version 4.13 and 5.x.
---
 Installation/cmake/modules/CGAL_ITK_support.cmake     |  9 +++++++++
 Mesh_3/examples/Mesh_3/CMakeLists.txt                 | 10 +++++-----
 .../demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt     | 11 +++--------
 3 files changed, 17 insertions(+), 13 deletions(-)
 create mode 100644 Installation/cmake/modules/CGAL_ITK_support.cmake

diff --git a/Installation/cmake/modules/CGAL_ITK_support.cmake b/Installation/cmake/modules/CGAL_ITK_support.cmake
new file mode 100644
index 000000000000..a0a8b57b85a6
--- /dev/null
+++ b/Installation/cmake/modules/CGAL_ITK_support.cmake
@@ -0,0 +1,9 @@
+if(ITK_FOUND AND NOT TARGET CGAL::ITK_support)
+  add_library(CGAL::ITK_support INTERFACE IMPORTED)
+  foreach(itk_target ITKCommon ITKSmoothing ITKImageIntensity)
+    if(TARGET ${itk_target})
+      target_link_libraries(CGAL::ITK_support INTERFACE ${itk_target})
+    endif()
+  endforeach()
+  target_compile_definitions(CGAL::ITK_support INTERFACE CGAL_USE_ITK)
+endif()
diff --git a/Mesh_3/examples/Mesh_3/CMakeLists.txt b/Mesh_3/examples/Mesh_3/CMakeLists.txt
index 7f9ccfdb03b6..bb988eb0e50f 100644
--- a/Mesh_3/examples/Mesh_3/CMakeLists.txt
+++ b/Mesh_3/examples/Mesh_3/CMakeLists.txt
@@ -174,20 +174,20 @@ if(TARGET CGAL::CGAL_ImageIO)
     find_package(ITK NAMES ITK InsightToolkit
                      QUIET COMPONENTS ITKCommon ITKThresholding ITKSmoothing ITKImageIntensity)
     if(ITK_FOUND)
+      include(CGAL_ITK_support)
       message(STATUS "ITK found")
       include(${ITK_USE_FILE})
-      set(ITK_LIBS ITKCommon ITKSmoothing ITKImageIntensity)
 
       create_single_source_cgal_program("mesh_3D_weighted_image.cpp")
       target_link_libraries(mesh_3D_weighted_image
-                            PUBLIC CGAL::Eigen3_support ${ITK_LIBS})
+                            PUBLIC CGAL::Eigen3_support CGAL::ITK_support)
 
       create_single_source_cgal_program("mesh_3D_weighted_image_with_detection_of_features.cpp")
       target_link_libraries(mesh_3D_weighted_image_with_detection_of_features
-                            PUBLIC CGAL::Eigen3_support ${ITK_LIBS})
-    else(ITK_FOUND)
+                            PUBLIC CGAL::Eigen3_support CGAL::ITK_support)
+    else()
       message(STATUS "NOTICE: The examples that need ITK will not be compiled.")
-    endif(ITK_FOUND)
+    endif()
 
   else()
     message(STATUS "NOTICE: The examples mesh_3D_image.cpp, mesh_3D_weighted_image.cpp, mesh_3D_image_variable_size.cpp, mesh_optimization_example.cpp and mesh_optimization_lloyd_example.cpp need CGAL_ImageIO to be configured with ZLIB support, and will not be compiled.")
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
index f7cadd99fb66..489a33e32488 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/CMakeLists.txt
@@ -31,15 +31,10 @@ target_include_directories(mesh_3_plugin PRIVATE include)
 find_package(ITK NAMES ITK InsightToolkit
                  QUIET COMPONENTS ITKCommon ITKThresholding ITKSmoothing ITKImageIntensity)
 if(ITK_FOUND)
+  include(CGAL_ITK_support)
+  message(STATUS "ITK found")
   include(${ITK_USE_FILE})
-  set(ITK_LIBS ITKCommon ITKSmoothing ITKImageIntensity)
-  foreach(lib ${ITK_LIBS})
-    if(NOT TARGET ${lib})
-      message(STATUS "ITK library ${lib} not found")
-    endif()
-  endforeach()
-  target_link_libraries(mesh_3_plugin PUBLIC ${ITK_LIBS})
-  target_compile_definitions(mesh_3_plugin PUBLIC CGAL_USE_ITK)
+  target_link_libraries(mesh_3_plugin PUBLIC CGAL::ITK_support)
 endif(ITK_FOUND)
 
 find_package(VTK QUIET COMPONENTS vtkImagingGeneral vtkIOImage vtkIOXML NO_MODULE)

From fbae36fcbe8de7263b2544141d56df53fdddd600 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 24 Nov 2023 08:56:13 +0100
Subject: [PATCH 1080/1398] add missing input file

---
 .../Intersection13.off                        | 1601 +++++++++++++++++
 1 file changed, 1601 insertions(+)
 create mode 100644 Data/data/meshes/polyhedral_complex_of_spheres/Intersection13.off

diff --git a/Data/data/meshes/polyhedral_complex_of_spheres/Intersection13.off b/Data/data/meshes/polyhedral_complex_of_spheres/Intersection13.off
new file mode 100644
index 000000000000..b64038540fe4
--- /dev/null
+++ b/Data/data/meshes/polyhedral_complex_of_spheres/Intersection13.off
@@ -0,0 +1,1601 @@
+OFF
+619 978 0
+
+0.27219661039719134 -0.89987434907152952 0.34005641981910195
+0.27399725512977036 -0.89741802080743249 0.34558774394436154
+0.2679128793459149 -0.90549608434201145 0.32699007860623508
+0.26758089404998364 -0.90597288936521869 0.32585692434233743
+0.26660413751883816 -0.90759811547986069 0.32187126056253501
+0.25697201819559901 -0.92432848622760766 0.28050566540029309
+0.25313054028719528 -0.92991689161909552 0.26460466631117985
+0.25308933658097965 -0.92998804508785282 0.26439588316448515
+0.24930895838975131 -0.93567470552212895 0.24579255546759948
+0.24336599009814622 -0.94602936533555493 0.21094260961626568
+0.24152064540259124 -0.9485706826100101 0.20072208160320942
+0.2389405724498605 -0.95306848001363997 0.18186355091081885
+0.23440017510432309 -0.9594775020158709 0.15035899655759535
+0.23294949527472616 -0.96194916611186088 0.13775142693846476
+0.23259475183323847 -0.96237493457550005 0.13494008765512316
+0.23052646968895496 -0.96592607882051262 0.10986054425367281
+0.22988186145330614 -0.96732927410114633 0.099634331047451258
+0.22762677949308696 -0.97053761901938218 0.067701629511043929
+0.22743420727478347 -0.97114863140943242 0.060907607905721757
+0.22648000271342916 -0.97241808576487498 0.034988854233130681
+0.22628605152906522 -0.97313250261608553 0.01853460685588823
+0.22589145876869662 -0.97323020415808847 -0
+0.22628605152906522 -0.97313250261608553 -0.01853460685588823
+0.22648000271342922 -0.97241808576487498 -0.034988854233130834
+0.2274342072747835 -0.97114863140943242 -0.060907607905721785
+0.22762677949308691 -0.97053761901938207 -0.067701629511043929
+0.22988186145330608 -0.96732927410114655 -0.09963433104745123
+0.23052646968895496 -0.96592607882051251 -0.10986054425367295
+0.23259475183323847 -0.96237493457549972 -0.13494008765512314
+0.23294949527472619 -0.96194916611186088 -0.13775142693846473
+0.23440017510432298 -0.95947750201587068 -0.15035899655759499
+0.23894057244986044 -0.95306848001363997 -0.18186355091081888
+0.24152064540259116 -0.94857068261000999 -0.2007220816032094
+0.24336599009814619 -0.94602936533555493 -0.21094260961626565
+0.24930895838975131 -0.93567470552212884 -0.24579255546759954
+0.2530893365809796 -0.92998804508785282 -0.26439588316448515
+0.25313054028719528 -0.92991689161909541 -0.26460466631117996
+0.25697201819559901 -0.92432848622760766 -0.28050566540029298
+0.26660413751883794 -0.90759811547986147 -0.32187126056253368
+0.26758089404998375 -0.9059728893652188 -0.32585692434233748
+0.26791287934591512 -0.90549608434201145 -0.32699007860623563
+0.27219661039719123 -0.89987434907152986 -0.34005641981910134
+0.27399725512977041 -0.89741802080743249 -0.34558774394436126
+0.27461092234606044 -0.89644305776905853 -0.34753041451074085
+0.28617291708332143 -0.87638371280443894 -0.38483791504434917
+0.29057971437418995 -0.8695923485436825 -0.39708487175152696
+0.29401138453262826 -0.86471241548978539 -0.40567809407889899
+0.30362145533065937 -0.84916410602320314 -0.43023759412454321
+0.30729748704039861 -0.84278707285381271 -0.43974499787970978
+0.31474205002823552 -0.83109069623026088 -0.45671715648324696
+0.31682936237190801 -0.8280363774210906 -0.46105412139556579
+0.32993533901945349 -0.80654749644509327 -0.4886330537542477
+0.3395133710973568 -0.79211156275892003 -0.50664961250726259
+0.34177771381313393 -0.78887113359859207 -0.51061830246204121
+0.34243159318633287 -0.78789291377908466 -0.51176714118576783
+0.34288899659372696 -0.78713443636827329 -0.51257565524045923
+0.35314170479917451 -0.76928684914828649 -0.53075413092765567
+0.36517401588679066 -0.75 -0.5497573450331017
+0.36998650939197825 -0.74269333684247574 -0.5567855194421365
+0.37506412073313466 -0.73422479552976916 -0.56417193374348928
+0.39411849558532475 -0.7042679462719752 -0.58956860097969033
+0.39895802436542988 -0.69687753315555612 -0.5957410107715313
+0.40036321981550371 -0.69465247190942381 -0.5975302451883705
+0.40065939257699101 -0.69413734830776352 -0.5979056290568221
+0.40151480227572495 -0.69274920908571347 -0.59888293763788791
+0.40435813432554835 -0.6879005781223142 -0.60211592452938867
+0.42861413394522363 -0.64891100701386617 -0.62717432611494861
+0.4331208322019765 -0.64210794890239153 -0.63136143448574877
+0.44633019100468196 -0.62042776846682712 -0.64334361719230815
+0.4546732585899762 -0.60749293870920396 -0.65018159643527595
+0.45944041532897179 -0.59972505245462004 -0.65399889841309111
+0.46796403496887884 -0.58666916470964625 -0.66003296952840651
+0.4897853260968788 -0.55056521742650477 -0.67476755984413883
+0.49314081475211935 -0.54531814984023852 -0.67677227421098896
+0.5039242293873103 -0.52945918848859996 -0.68235511400187066
+0.50468001700647158 -0.52828837108788052 -0.68272481536695295
+0.50622685812276502 -0.52571510245600428 -0.68341702461536269
+0.50787822903713031 -0.52299793234814496 -0.68413337702600852
+0.52912853141459681 -0.48757002987147358 -0.69320320770179844
+0.53310523682898858 -0.48133611427487955 -0.69462568959831961
+0.54306000239317154 -0.46664565776233691 -0.69755165300174249
+0.5493198212532957 -0.45674068614295493 -0.69911600851089584
+0.56731181848165257 -0.42664579118104862 -0.70294074606773127
+0.57556494808430081 -0.41363385795819674 -0.70422028778974766
+0.58303192413334481 -0.40257317574481138 -0.70495163176324016
+0.59214384399202524 -0.38815954298187871 -0.70538094374692584
+0.6078561560079746 -0.36184045701812118 -0.70538094374692584
+0.61696807586665503 -0.34742682425518878 -0.70495163176324016
+0.62443505191569915 -0.33636614204180315 -0.70422028778974766
+0.63268818151834738 -0.32335420881895127 -0.70294074606773105
+0.65068017874670414 -0.29325931385704507 -0.69911600851089584
+0.6569399976068282 -0.28335434223766326 -0.69755165300174249
+0.66689476317101137 -0.26866388572512034 -0.69462568959831961
+0.67087146858540314 -0.2624299701285262 -0.69320320770179855
+0.69212177096286942 -0.22700206765185557 -0.68413337702600874
+0.69377314187723493 -0.22428489754399594 -0.68341702461536258
+0.69531998299352837 -0.2217116289121196 -0.68272481536695306
+0.69607577061268988 -0.22054081151140006 -0.68235511400187066
+0.70685918524788072 -0.20468185015976154 -0.67677227421098896
+0.71021467390312099 -0.19943478257349526 -0.67476755984413894
+0.73203596503112101 -0.16333083529035375 -0.66003296952840662
+0.74055958467102845 -0.15027494754537968 -0.65399889841309089
+0.74532674141002375 -0.14250706129079624 -0.65018159643527618
+0.75366980899531777 -0.12957223153317302 -0.64334361719230837
+0.76687916779802356 -0.10789205109760858 -0.63136143448574888
+0.77138586605477633 -0.1010889929861338 -0.62717432611494872
+0.79564186567445128 -0.06209942187768587 -0.60211592452938889
+0.79848519772427506 -0.057250790914286004 -0.59888293763788769
+0.79934060742300872 -0.055862651692236032 -0.59790562905682221
+0.79963678018449613 -0.055347528090576067 -0.59753024518837083
+0.80104197563456991 -0.053122466844444029 -0.59574101077153174
+0.80588150441467521 -0.045732053728024212 -0.58956860097968999
+0.82493587926686529 -0.015775204470230772 -0.56417193374348928
+0.83001349060802165 -0.0073066631575244411 -0.55678551944213672
+0.8348259841132093 -6.1457978060811826e-19 -0.5497573450331017
+0.84685829520082545 0.019286849148286479 -0.53075413092765555
+0.85711100340627278 0.037134436368273155 -0.51257565524045934
+0.85756840681366708 0.037892913779084561 -0.51176714118576794
+0.85822228618686602 0.038871133598591998 -0.51061830246204143
+0.86048662890264316 0.042111562758920099 -0.50664961250726259
+0.87006466098054647 0.056547496445093395 -0.48863305375424759
+0.88317063762809189 0.078036377421090597 -0.46105412139556579
+0.88525794997176432 0.081090696230260814 -0.45671715648324701
+0.89270251295960135 0.092787072853812741 -0.43974499787970978
+0.89637854466934042 0.099164106023202886 -0.43023759412454343
+0.90598861546737153 0.11471241548978532 -0.40567809407889888
+0.9094202856258099 0.11959234854368263 -0.39708487175152668
+0.91382708291667858 0.12638371280443889 -0.38483791504434905
+0.9253890776539393 0.14644305776905842 -0.34753041451074107
+0.92600274487022949 0.14741802080743258 -0.34558774394436131
+0.92780338960280884 0.14987434907153013 -0.34005641981910084
+0.93208712065408494 0.15549608434201162 -0.32699007860623541
+0.9324191059500162 0.15597288936521903 -0.32585692434233743
+0.93339586248116191 0.15759811547986141 -0.32187126056253423
+0.94302798180440084 0.17432848622760777 -0.2805056654002932
+0.94686945971280467 0.17991689161909563 -0.26460466631117985
+0.94691066341902053 0.17998804508785299 -0.26439588316448503
+0.95069104161024875 0.18567470552212903 -0.24579255546759926
+0.95663400990185365 0.19602936533555493 -0.21094260961626565
+0.95847935459740874 0.19857068261001024 -0.20072208160320937
+0.9610594275501394 0.20306848001363986 -0.18186355091081907
+0.96559982489567697 0.20947750201587081 -0.15035899655759494
+0.96705050472527398 0.21194916611186077 -0.13775142693846465
+0.96740524816676143 0.21237493457549977 -0.13494008765512311
+0.96947353031104488 0.21592607882051251 -0.10986054425367317
+0.97011813854669371 0.2173292741011463 -0.099634331047451508
+0.97237322050691288 0.2205376190193819 -0.067701629511043915
+0.97256579272521626 0.22114863140943242 -0.060907607905721556
+0.97351999728657068 0.22241808576487493 -0.034988854233130418
+0.97371394847093473 0.22313250261608547 -0.018534606855888307
+0.9741085412313033 0.22323020415808842 -0
+0.97371394847093473 0.22313250261608547 0.018534606855888314
+0.97351999728657068 0.22241808576487493 0.034988854233130445
+0.97256579272521648 0.22114863140943247 0.060907607905721736
+0.97237322050691288 0.22053761901938193 0.067701629511043915
+0.9701181385466936 0.21732927410114636 0.099634331047451369
+0.96947353031104511 0.21592607882051257 0.10986054425367309
+0.96740524816676143 0.21237493457549983 0.13494008765512311
+0.96705050472527376 0.21194916611186071 0.13775142693846484
+0.96559982489567697 0.20947750201587079 0.15035899655759488
+0.9610594275501394 0.20306848001363986 0.18186355091081891
+0.95847935459740885 0.19857068261001021 0.20072208160320931
+0.95663400990185365 0.1960293653355549 0.21094260961626565
+0.95069104161024875 0.185674705522129 0.24579255546759909
+0.94691066341902042 0.17998804508785277 0.2643958831644852
+0.94686945971280478 0.17991689161909552 0.26460466631117979
+0.94302798180440095 0.1743284862276076 0.2805056654002932
+0.93339586248116191 0.15759811547986138 0.32187126056253412
+0.93241910595001631 0.15597288936521894 0.32585692434233732
+0.93208712065408506 0.15549608434201159 0.3269900786062353
+0.92780338960280884 0.14987434907153008 0.34005641981910095
+0.92600274487022949 0.1474180208074326 0.34558774394436137
+0.92538907765393941 0.14644305776905847 0.34753041451074107
+0.91382708291667858 0.12638371280443894 0.38483791504434894
+0.9094202856258099 0.11959234854368264 0.39708487175152674
+0.90598861546737153 0.11471241548978531 0.40567809407889893
+0.89637854466934042 0.099164106023202803 0.43023759412454371
+0.89270251295960135 0.092787072853812713 0.43974499787970978
+0.88525794997176432 0.0810906962302608 0.4567171564832469
+0.88317063762809189 0.078036377421090528 0.46105412139556584
+0.87006466098054647 0.056547496445093395 0.48863305375424759
+0.86048662890264316 0.042111562758920092 0.50664961250726259
+0.85822228618686625 0.038871133598592303 0.51061830246204098
+0.85756840681366708 0.037892913779084658 0.51176714118576783
+0.85711100340627278 0.037134436368273058 0.51257565524045945
+0.84685829520082545 0.019286849148286413 0.53075413092765555
+0.83482598411320952 6.1457978060812172e-19 0.54975734503310147
+0.83001349060802176 -0.0073066631575244463 0.55678551944213661
+0.82493587926686529 -0.015775204470230869 0.56417193374348917
+0.80588150441467499 -0.045732053728024698 0.58956860097969011
+0.80104197563456947 -0.053122466844444688 0.59574101077153174
+0.79963678018449591 -0.05534752809057629 0.59753024518837039
+0.79934060742300872 -0.055862651692236226 0.5979056290568221
+0.79848519772427518 -0.05725079091428617 0.59888293763788758
+0.7956418656744515 -0.062099421877685829 0.60211592452938856
+0.77138586605477644 -0.10108899298613383 0.62717432611494861
+0.76687916779802356 -0.10789205109760849 0.63136143448574888
+0.75366980899531777 -0.12957223153317304 0.64334361719230837
+0.74532674141002397 -0.14250706129079604 0.65018159643527595
+0.74055958467102845 -0.15027494754537984 0.65399889841309089
+0.73203596503112123 -0.16333083529035369 0.66003296952840662
+0.71021467390312121 -0.19943478257349531 0.67476755984413883
+0.70685918524788072 -0.20468185015976154 0.67677227421098896
+0.69607577061268988 -0.22054081151139987 0.68235511400187043
+0.69531998299352837 -0.22171162891211948 0.68272481536695295
+0.69377314187723504 -0.22428489754399578 0.68341702461536258
+0.69212177096286909 -0.22700206765185593 0.68413337702600874
+0.67087146858540314 -0.2624299701285262 0.69320320770179844
+0.66689476317101137 -0.26866388572512034 0.69462568959831961
+0.65693999760682831 -0.28335434223766309 0.69755165300174227
+0.65068017874670425 -0.29325931385704501 0.69911600851089595
+0.63268818151834738 -0.32335420881895094 0.70294074606773105
+0.62443505191569892 -0.33636614204180326 0.70422028778974766
+0.61696807586665514 -0.34742682425518856 0.70495163176324005
+0.60785615600797449 -0.36184045701812129 0.70538094374692584
+0.59214384399202546 -0.3881595429818786 0.70538094374692573
+0.58303192413334481 -0.40257317574481138 0.70495163176324016
+0.57556494808430092 -0.41363385795819674 0.70422028778974766
+0.5673118184816528 -0.42664579118104884 0.70294074606773105
+0.5493198212532957 -0.45674068614295493 0.69911600851089584
+0.54306000239317154 -0.46664565776233696 0.69755165300174249
+0.53310523682898858 -0.4813361142748796 0.69462568959831961
+0.52912853141459681 -0.48757002987147369 0.69320320770179866
+0.50787822903712998 -0.52299793234814529 0.68413337702600852
+0.50622685812276469 -0.5257151024560045 0.68341702461536258
+0.50468001700647158 -0.52828837108788052 0.68272481536695295
+0.50392422938731019 -0.52945918848859996 0.68235511400187066
+0.49314081475211924 -0.54531814984023841 0.67677227421098896
+0.48978532609687886 -0.55056521742650477 0.67476755984413894
+0.46796403496887878 -0.58666916470964625 0.66003296952840662
+0.45944041532897167 -0.59972505245462004 0.65399889841309089
+0.45467325858997609 -0.60749293870920384 0.65018159643527607
+0.44633019100468213 -0.6204277684668269 0.64334361719230826
+0.4331208322019765 -0.64210794890239153 0.63136143448574877
+0.42861413394522363 -0.64891100701386595 0.62717432611494872
+0.40435813432554857 -0.6879005781223142 0.60211592452938856
+0.401514802275725 -0.69274920908571369 0.59888293763788769
+0.40065939257699124 -0.69413734830776352 0.5979056290568221
+0.40036321981550405 -0.6946524719094237 0.59753024518837061
+0.39895802436543049 -0.69687753315555545 0.59574101077153174
+0.39411849558532508 -0.7042679462719752 0.58956860097969033
+0.37506412073313489 -0.73422479552976916 0.5641719337434894
+0.36998650939197836 -0.74269333684247552 0.55678551944213661
+0.36517401588679066 -0.75 0.5497573450331017
+0.35314170479917451 -0.76928684914828649 0.53075413092765567
+0.34288899659372707 -0.78713443636827329 0.51257565524045945
+0.34243159318633287 -0.78789291377908466 0.51176714118576805
+0.34177771381313388 -0.78887113359859229 0.51061830246204121
+0.33951337109735685 -0.79211156275892003 0.50664961250726281
+0.32993533901945349 -0.80654749644509338 0.4886330537542477
+0.31682936237190812 -0.8280363774210906 0.46105412139556601
+0.31474205002823563 -0.83109069623026077 0.45671715648324707
+0.30729748704039872 -0.84278707285381294 0.43974499787970983
+0.30362145533065943 -0.84916410602320291 0.43023759412454349
+0.29401138453262832 -0.86471241548978517 0.4056780940788991
+0.29057971437419 -0.8695923485436825 0.39708487175152685
+0.28617291708332138 -0.87638371280443861 0.38483791504434917
+0.27461092234606033 -0.8964430577690583 0.34753041451074085
+0.78691464920034204 -0.55218346430918919 -0.27542468411056592
+0.78691464920034204 -0.5521834643091893 0.27542468411056592
+0.82760814841975494 -0.44564650023159885 0.3412681489687433
+0.82760814841975505 -0.44564650023159863 -0.34126814896874336
+0.99782996454078776 -1.231040596610629e-18 0.065843464858177492
+0.99782996454078776 1.231040596610629e-18 -0.065843464858177492
+0.33088129441328606 -0.9151298141069959 0.23033669342916982
+0.52293928186267569 -0.79643145005237237 0.30369631682393589
+0.52293928186267558 -0.79643145005237248 -0.30369631682393589
+0.33088129441328601 -0.9151298141069959 -0.23033669342916974
+0.75327597529184531 -0.65407554465688111 -0.068996282000725426
+0.63457761123722201 -0.72743516805164721 -0.2610542694501149
+0.63457761123722189 -0.7274351680516471 0.26105426945011495
+0.75327597529184531 -0.65407554465688111 0.068996282000725467
+0.9151298141069959 -0.23033669342916982 0.33088129441328606
+0.79643145005237237 -0.30369631682393589 0.52293928186267569
+0.79643145005237248 -0.30369631682393589 -0.52293928186267558
+0.9151298141069959 -0.23033669342916974 -0.33088129441328601
+0.95777186148081694 -0.11869836405462342 0.26188501241256068
+0.95777186148081694 -0.1186983640546234 -0.26188501241256062
+0.52836121174546036 -0.68346886752821701 -0.50369111272938427
+0.89756031181852258 -0.3465999725759743 -0.27249577181778534
+0.88287877117884817 -0.46436496618972251 -0.069930348042498217
+0.77633914798103421 -0.42151877198336174 0.46863573506266099
+0.64151089172333209 -0.61353851948571902 0.46047178079401074
+0.61353851948571902 -0.46047178079401074 0.64151089172333209
+0.81523570763863507 -0.5621285844293008 0.13929176414434621
+0.92483674698373297 -0.35451755943338792 0.13781977899394779
+0.46863573506266087 -0.77633914798103421 0.42151877198336168
+0.69401454380114724 -0.63704738383668813 -0.33543172738922178
+0.68346886752821701 -0.50369111272938438 -0.52836121174546025
+0.98364735641266243 0.12122116383748827 -0.13320400767343918
+0.98364735641266243 -0.12122116383748827 0.13320400767343918
+0.96805607891910661 -0.24136787945551613 -0.067889430951449614
+0.32153744077837104 -0.94689686564994791 1.2287154012371122e-18
+0.49525883802792392 -0.86299895207436528 0.099757165525981087
+0.69401454380114691 -0.63704738383668813 0.33543172738922172
+0.52836121174546025 -0.68346886752821701 0.50369111272938427
+0.45337594379539092 -0.86541618975952417 -0.21331917890744351
+0.43360551911151823 -0.90110279868394083 1.2262216765384848e-18
+0.66669512270283426 -0.73357768674250456 -0.13183850301701969
+0.49525883802792381 -0.86299895207436528 -0.099757165525981059
+0.66669512270283438 -0.73357768674250434 0.13183850301701977
+0.59501600355390494 -0.80134563315795981 -0.061653318916405575
+0.46863573506266104 -0.77633914798103421 -0.42151877198336163
+0.64151089172333209 -0.61353851948571891 -0.46047178079401074
+0.45337594379539092 -0.86541618975952417 0.21331917890744348
+0.59501600355390494 -0.8013456331579597 0.061653318916405561
+0.81523570763863507 -0.5621285844293008 -0.13929176414434621
+0.88287877117884817 -0.46436496618972245 0.069930348042498217
+0.98364735641266243 0.12122116383748827 0.13320400767343918
+0.86541618975952417 -0.21331917890744348 0.45337594379539092
+0.94689686564994791 1.2287154012371122e-18 -0.32153744077837104
+0.94689686564994791 -1.2287154012371122e-18 0.32153744077837104
+0.86299895207436528 -0.099757165525981073 0.49525883802792381
+0.68346886752821712 -0.50369111272938438 0.52836121174546036
+0.77633914798103421 -0.42151877198336163 -0.46863573506266104
+0.61353851948571891 -0.4604717807940108 -0.64151089172333209
+0.86299895207436528 -0.099757165525981059 -0.49525883802792381
+0.98364735641266243 -0.12122116383748827 -0.13320400767343918
+0.92483674698373319 -0.35451755943338792 -0.13781977899394779
+0.90110279868394083 -1.2262216765384848e-18 0.43360551911151823
+0.89756031181852236 -0.34659997257597436 0.27249577181778539
+0.96805607891910661 -0.24136787945551613 0.067889430951449614
+0.86541618975952417 -0.21331917890744351 -0.45337594379539092
+0.90110279868394083 1.2262216765384848e-18 -0.43360551911151823
+0.78437123837371081 -0.46867704983435055 -0.40632940254264294
+0.86230450765389344 -0.37596077789543381 -0.33924096091721673
+0.86574218443040074 -0.41838703947458195 0.27466844612618391
+0.82178222598517658 -0.40100492526839776 0.40480738995889742
+0.74334549596053445 -0.57608383788574413 0.33994835690442576
+0.78076816785433134 -0.58942568680894825 0.20731239180326447
+0.40480738995889742 -0.82178222598517658 0.40100492526839776
+0.8247164420172246 -0.52579382752597525 -0.20828740048796671
+0.74024588618561449 -0.61446983418191203 -0.27287882084494514
+0.9944708773603258 -0.081370946056690249 -0.066381045638217229
+0.99043061207734606 0.040522281668716874 -0.13192856911395229
+0.9944708773603258 0.081370946056690249 0.066381045638217229
+0.99043061207734606 -0.040522281668716874 0.13192856911395229
+0.62457262167826666 -0.75674166021493738 0.19300544019554747
+0.68929656115193505 -0.6730187872058685 0.26817151760031971
+0.39610117388436322 -0.88076789123048704 -0.25952221836449818
+0.38998766307204569 -0.90172313788306901 0.18656099607880575
+0.64061453708709615 -0.69409608332024098 -0.32839555720531116
+0.68018071850695239 -0.70519707714513458 -0.20012814034344362
+0.32271058904772337 -0.94330265629374277 -0.077704403643809677
+0.8004723406749189 -0.59529852733606181 0.069740197633308881
+0.719915307065364 -0.68063975088704354 0.135836225526941
+0.51571602924327076 -0.82401873423925942 -0.23458495860622128
+0.46556504362316592 -0.81129246939324073 -0.35362935294171677
+0.52777252693426735 -0.76383628095354983 0.37149736972483099
+0.46039308870086582 -0.84103330267207554 0.28407954462258922
+0.70227702532207648 -0.70871769768752158 -0.067277074024322203
+0.76957783850217643 -0.62340222914316235 -0.13827368218737227
+0.94330265629374277 0.077704403643809677 0.32271058904772337
+0.97703158208487906 0.080281277350241265 0.19739352602284616
+0.76383628095354983 -0.37149736972483099 0.52777252693426735
+0.84103330267207554 -0.28407954462258922 0.46039308870086582
+0.96471929550963276 0.039734588558411582 -0.26026494835742225
+0.96679589706089264 -0.15985780358782284 0.19937696972895624
+0.96471929550963276 -0.039734588558411582 0.26026494835742225
+0.82401873423925942 -0.23458495860622128 -0.51571602924327076
+0.81129246939324073 -0.35362935294171677 -0.46556504362316592
+0.69409608332024086 -0.32839555720531111 -0.64061453708709615
+0.94330265629374277 -0.077704403643809677 -0.32271058904772337
+0.97703158208487906 -0.080281277350241265 -0.19739352602284616
+0.90172313788306901 -0.18656099607880575 0.38998766307204569
+0.891573746743482 -0.30401279487901056 0.33566720821021839
+0.9236940845413727 -0.2726998137406515 -0.26911716736226499
+0.88076789123048704 -0.25952221836449818 -0.39610117388436322
+0.52372394783737519 -0.63610018157997195 -0.56664784959934422
+0.52777252693426735 -0.76383628095354983 -0.37149736972483099
+0.9506072962094394 -0.27889813733511903 -0.13624095340381404
+0.9168554803037775 -0.39313153246640248 -0.069452331980627613
+0.8004723406749189 -0.59529852733606159 -0.069740197633308867
+0.67170915887432037 -0.45126666560725853 0.58750761901107262
+0.63610018157997195 -0.56664784959934433 0.52372394783737519
+0.64061453708709593 -0.69409608332024109 0.32839555720531116
+0.69409608332024109 -0.32839555720531116 0.64061453708709593
+0.67170915887432026 -0.45126666560725864 -0.58750761901107262
+0.86640575634619166 -0.4993406306021807 0
+0.9168554803037775 -0.39313153246640248 0.069452331980627613
+0.92369408454137258 -0.27269981374065166 0.26911716736226515
+0.58750761901107262 -0.67170915887432037 0.45126666560725853
+0.52372394783737519 -0.63610018157997195 0.56664784959934433
+0.58750761901107273 -0.67170915887432037 -0.45126666560725853
+0.63610018157997195 -0.56664784959934422 -0.52372394783737508
+0.76383628095354983 -0.37149736972483099 -0.52777252693426735
+0.9506072962094394 -0.27889813733511903 0.13624095340381404
+0.95977938206574664 -0.28075529872380572 0
+0.96679589706089264 -0.15985780358782287 -0.19937696972895619
+0.43765447584202588 -0.8962672300889245 -0.071858277492354974
+0.48516082808530336 -0.87376742805233321 0.033903577486650911
+0.51571602924327076 -0.82401873423925942 0.23458495860622128
+0.69116244652106429 -0.55216883979414844 0.46626606661797826
+0.55392361119767786 -0.82440895259656954 -0.11626913535565189
+0.32271058904772337 -0.94330265629374277 0.077704403643809677
+0.62578188869003271 -0.77999809473327264 0
+0.38998766307204552 -0.90172313788306913 -0.18656099607880564
+0.55392361119767786 -0.82440895259656954 0.11626913535565189
+0.62457262167826677 -0.75674166021493716 -0.19300544019554741
+0.46626606661797837 -0.69116244652106429 -0.55216883979414833
+0.74334549596053456 -0.57608383788574391 -0.33994835690442565
+0.43765447584202588 -0.8962672300889245 0.071858277492354974
+0.70227702532207659 -0.70871769768752169 0.067277074024322245
+0.89342795031552769 -0.42716188369754926 -0.13899360672691591
+0.8247164420172246 -0.52579382752597525 0.20828740048796671
+0.8962672300889245 -0.071858277492354974 0.43765447584202588
+0.82440895259656954 -0.11626913535565189 0.55392361119767786
+0.8962672300889245 -0.071858277492354974 -0.43765447584202588
+0.82401873423925942 -0.23458495860622128 0.51571602924327076
+0.78437123837371081 -0.46867704983435066 0.40632940254264294
+0.46626606661797843 -0.69116244652106429 0.55216883979414844
+0.6911624465210644 -0.55216883979414844 -0.46626606661797826
+0.90172313788306913 -0.18656099607880564 -0.38998766307204552
+0.97933072349169759 -0.20226550379446331 0
+0.86574218443040096 -0.41838703947458172 -0.27466844612618396
+0.94330265629374277 -0.077704403643809677 0.32271058904772337
+0.89342795031552757 -0.42716188369754932 0.13899360672691585
+0.9944708773603258 -0.081370946056690249 0.066381045638217229
+0.82440895259656954 -0.11626913535565189 -0.55392361119767786
+0.94330265629374277 0.077704403643809677 -0.32271058904772337
+0.9944708773603258 0.081370946056690249 -0.066381045638217229
+0.74192286377215222 -0.53398612240605769 -0.40547414873191501
+0.78792826822967776 -0.5121997269099976 -0.34179011670600551
+0.86400769557376311 -0.45853354684184838 0.20793674136609452
+0.8287565671687902 -0.48696645046278497 0.27572854131968016
+0.74192286377215222 -0.53398612240605792 0.40547414873191506
+0.78792826822967776 -0.51219972690999771 0.34179011670600545
+0.86400769557376311 -0.45853354684184816 -0.20793674136609455
+0.82875656716879031 -0.48696645046278469 -0.27572854131968005
+0.9925196692479058 -0.12208483180161094 -2.4628875390745819e-18
+0.99916617737278246 -0.040828298939112578 0
+0.9925196692479058 0.12208483180161092 2.4628875390745815e-18
+0.99916617737278246 0.040828298939112578 0
+0.56644608341520675 -0.80357852474018521 0.18275773351615091
+0.57642063043274472 -0.77776655183340049 0.25063608611031907
+0.38368834989905565 -0.91652901576006229 0.1129504910198771
+0.32578454432242587 -0.93266817185682316 0.15490162002342261
+0.58714124035889637 -0.71204046096811668 -0.38505005624480643
+0.58336686281126149 -0.74735820322637392 -0.31802330015895514
+0.38368834989905559 -0.91652901576006229 -0.11295049101987709
+0.32578454432242576 -0.93266817185682316 -0.15490162002342259
+0.82511526248824529 -0.56496442685265946 4.927907460000931e-18
+0.77991607152390563 -0.62588411178006298 6.5652635294160463e-18
+0.56644608341520641 -0.80357852474018532 -0.18275773351615091
+0.57642063043274472 -0.77776655183340049 -0.25063608611031907
+0.58714124035889637 -0.7120404609681168 0.38505005624480637
+0.58336686281126149 -0.74735820322637392 0.31802330015895514
+0.67939657443508372 -0.73377128224391142 3.6838438251301899e-18
+0.73132225045616739 -0.68203208574650398 6.5571195165482265e-18
+0.7120404609681168 -0.38505005624480637 0.58714124035889637
+0.74735820322637392 -0.31802330015895514 0.58336686281126149
+0.95001448309746583 -0.23797402212934904 0.20209118411408986
+0.94390741193901806 -0.19654920871264409 0.26534356265230635
+0.80357852474018521 -0.18275773351615091 0.56644608341520675
+0.77776655183340049 -0.25063608611031907 0.57642063043274472
+0.80357852474018532 -0.18275773351615091 -0.56644608341520641
+0.77776655183340049 -0.25063608611031907 -0.57642063043274483
+0.71204046096811668 -0.38505005624480643 -0.58714124035889637
+0.74735820322637392 -0.31802330015895514 -0.58336686281126149
+0.91652901576006229 -0.11295049101987709 -0.38368834989905559
+0.93266817185682316 -0.15490162002342259 -0.32578454432242576
+0.91652901576006229 -0.1129504910198771 0.38368834989905565
+0.93266817185682316 -0.15490162002342261 0.32578454432242587
+0.95001448309746583 -0.23797402212934904 -0.20209118411408983
+0.94390741193901806 -0.19654920871264411 -0.2653435626523063
+0.52969979418799096 -0.72619883181352507 -0.43823895845745109
+0.9270588370822882 -0.31410064822087247 -0.20470147868264915
+0.84380044240886354 -0.53207395532465163 -0.069986566252294838
+0.72619883181352496 -0.43823895845745114 0.52969979418799107
+0.64294043714010041 -0.65621226556123025 0.39498488175763657
+0.65621226556123025 -0.39498488175763657 0.64294043714010041
+0.65621226556123025 -0.39498488175763669 -0.64294043714010041
+0.84380044240886354 -0.53207395532465163 0.069986566252294838
+0.9270588370822882 -0.31410064822087264 0.20470147868264923
+0.52969979418799107 -0.72619883181352496 0.43823895845745114
+0.64294043714010041 -0.65621226556123025 -0.39498488175763669
+0.72619883181352507 -0.43823895845745109 -0.52969979418799096
+0.97031291378210283 -0.20086000526876321 0.13471491243035441
+0.97031291378210283 -0.20086000526876321 -0.13471491243035441
+0.37971225316070945 -0.92432583806700219 -0.037951941733611459
+0.50619228471494349 -0.84615687966832631 0.16669704821929851
+0.69466625495449252 -0.59667643972673035 0.40176612662410133
+0.46894076499437626 -0.73618246464930526 0.48798559166164268
+0.50619228471494349 -0.84615687966832631 -0.16669704821929851
+0.37971225316070945 -0.92432583806700219 0.037951941733611459
+0.64943374300381451 -0.75762878984770377 -0.06507249989019516
+0.44478475305090454 -0.88410882140193769 -0.14324145828887103
+0.61148180127020324 -0.78108437977813128 0.12648003155423412
+0.61148180127020324 -0.78108437977813128 -0.1264800315542341
+0.46894076499437626 -0.73618246464930537 -0.48798559166164257
+0.69466625495449263 -0.59667643972673012 -0.40176612662410133
+0.44478475305090459 -0.88410882140193769 0.14324145828887105
+0.64943374300381462 -0.75762878984770354 0.06507249989019516
+0.85675191169903997 -0.49650199476975138 -0.13950602492257505
+0.85675191169903997 -0.49650199476975149 0.13950602492257505
+0.88410882140193769 -0.14324145828887105 0.44478475305090459
+0.92432583806700219 -0.037951941733611459 -0.37971225316070945
+0.92432583806700219 0.037951941733611459 0.37971225316070945
+0.84615687966832631 -0.16669704821929851 0.50619228471494349
+0.73618246464930526 -0.48798559166164268 0.46894076499437626
+0.73618246464930537 -0.48798559166164257 -0.46894076499437626
+0.88410882140193769 -0.14324145828887103 -0.44478475305090454
+0.98448758643139411 -0.16208565674454736 -0.067174638370274931
+0.89826812139385259 -0.38781114670466371 -0.20668066329284998
+0.92432583806700219 -0.037951941733611459 0.37971225316070945
+0.89826812139385259 -0.38781114670466382 0.20668066329284998
+0.98448758643139411 -0.16208565674454736 0.067174638370274931
+0.84615687966832631 -0.16669704821929851 -0.50619228471494349
+0.92432583806700219 0.037951941733611459 -0.37971225316070945
+0.85397772162051189 -0.33120809463701678 -0.40127702279442362
+0.82178222598517658 -0.40100492526839771 -0.40480738995889742
+0.85397772162051189 -0.33120809463701684 0.40127702279442379
+0.86230450765389344 -0.37596077789543403 0.33924096091721678
+0.7324851174314404 -0.64927986178574382 0.20469785983476813
+0.74024588618561449 -0.61446983418191226 0.27287882084494519
+0.40127702279442368 -0.85397772162051189 0.33120809463701678
+0.40127702279442373 -0.85397772162051189 -0.33120809463701684
+0.40480738995889742 -0.82178222598517658 -0.40100492526839771
+0.7324851174314404 -0.64927986178574382 -0.20469785983476813
+0.78076816785433134 -0.58942568680894825 -0.20731239180326447
+0.98048795642276054 0 -0.19657916295965558
+0.99043061207734606 -0.040522281668716874 -0.13192856911395229
+0.98048795642276054 0 0.19657916295965558
+0.99043061207734606 0.040522281668716874 0.13192856911395229
+0.68018071850695239 -0.70519707714513458 0.20012814034344362
+0.39610117388436322 -0.88076789123048704 0.25952221836449818
+0.68929656115193516 -0.6730187872058685 -0.26817151760031976
+0.7695778385021762 -0.62340222914316235 0.13827368218737232
+0.46039308870086582 -0.84103330267207554 -0.28407954462258928
+0.46556504362316581 -0.81129246939324073 0.35362935294171682
+0.719915307065364 -0.68063975088704354 -0.135836225526941
+0.96471929550963276 0.039734588558411582 0.26026494835742225
+0.81129246939324073 -0.35362935294171682 0.46556504362316581
+0.97703158208487906 0.080281277350241251 -0.19739352602284607
+0.97703158208487906 -0.080281277350241251 0.19739352602284607
+0.84103330267207554 -0.28407954462258928 -0.46039308870086582
+0.96471929550963276 -0.039734588558411582 -0.26026494835742225
+0.88076789123048704 -0.25952221836449818 0.39610117388436322
+0.891573746743482 -0.30401279487901051 -0.33566720821021828
+0.9453832490724946 -0.3186356302649232 -0.068715700526218768
+0.62674761880757135 -0.51556327979539029 0.58427898032160919
+0.62674761880757146 -0.51556327979539029 -0.58427898032160919
+0.93417235896271567 -0.35682208977308999 1.2321651268072113e-18
+0.90291461058653233 -0.4298199692771042 0
+0.57735026918962573 -0.57735026918962573 0.57735026918962573
+0.58427898032160919 -0.62674761880757135 0.51556327979539029
+0.57735026918962573 -0.57735026918962584 -0.57735026918962573
+0.58427898032160919 -0.62674761880757146 -0.51556327979539029
+0.9453832490724946 -0.31863563026492325 0.068715700526218768
+0.52573111211913348 -0.8506508083520401 -2.4513010918904207e-18
+0.48516082808530336 -0.87376742805233321 -0.033903577486650911
+0.54001796879892028 -0.83986385056568236 -0.054857140713616914
+0.57392154628557124 -0.81891028733871629 0
+0.54001796879892028 -0.83986385056568236 0.054857140713616914
+0.87376742805233321 -0.033903577486650911 0.48516082808530336
+0.87376742805233321 -0.033903577486650911 -0.48516082808530336
+0.55216883979414833 -0.46626606661797837 -0.69116244652106429
+0.59667643972673012 -0.40176612662410133 -0.69466625495449263
+0.63704738383668802 -0.33543172738922172 -0.69401454380114713
+0.67301878720586839 -0.26817151760031971 -0.68929656115193505
+0.40176612662410133 -0.69466625495449263 -0.59667643972673012
+0.33924096091721678 -0.86230450765389344 0.37596077789543403
+0.4604717807940108 -0.64151089172333209 -0.61353851948571891
+0.34126814896874336 -0.82760814841975505 0.44564650023159885
+0.40547414873191512 -0.74192286377215233 -0.53398612240605781
+0.93266817185682316 0.15490162002342261 -0.32578454432242587
+0.91652901576006229 0.1129504910198771 -0.38368834989905565
+0.75674166021493716 -0.19300544019554741 -0.62457262167826677
+0.80134563315795981 -0.061653318916405575 -0.59501600355390494
+0.93266817185682316 0.15490162002342259 0.32578454432242576
+0.91652901576006229 0.11295049101987709 0.38368834989905559
+0.8962672300889245 0.071858277492354974 0.43765447584202588
+0.34126814896874336 -0.82760814841975505 -0.44564650023159863
+0.46047178079401074 -0.64151089172333209 0.61353851948571902
+0.98448758643139411 0.16208565674454742 -0.067174638370274931
+0.26534356265230635 -0.94390741193901806 0.19654920871264409
+0.95777186148081694 0.1186983640546234 0.26188501241256062
+0.63704738383668813 -0.33543172738922172 0.69401454380114691
+0.87376742805233321 0.033903577486650911 0.48516082808530336
+0.85065080835203988 1.2256505459452103e-18 0.52573111211913359
+0.40176612662410133 -0.69466625495449252 0.59667643972673035
+0.51556327979539029 -0.58427898032160919 0.62674761880757135
+0.75674166021493738 -0.19300544019554747 0.62457262167826666
+0.51556327979539029 -0.58427898032160919 -0.62674761880757135
+0.7274351680516471 -0.26105426945011484 -0.63457761123722201
+0.85065080835203988 -1.2256505459452103e-18 -0.52573111211913359
+0.87376742805233321 0.033903577486650911 -0.48516082808530336
+0.8962672300889245 0.071858277492354974 -0.43765447584202588
+0.95777186148081694 0.11869836405462342 -0.26188501241256068
+0.26911716736226499 -0.9236940845413727 -0.2726998137406515
+0.2653435626523063 -0.94390741193901806 -0.19654920871264411
+0.96679589706089264 0.15985780358782284 -0.19937696972895624
+0.97031291378210283 0.20086000526876321 -0.13471491243035441
+0.26026494835742225 -0.96471929550963276 -0.039734588558411582
+0.26188501241256062 -0.95777186148081694 -0.1186983640546234
+0.97933072349169759 0.20226550379446337 0
+0.26188501241256068 -0.95777186148081694 0.11869836405462342
+0.26026494835742225 -0.96471929550963276 0.039734588558411582
+0.98448758643139411 0.16208565674454742 0.067174638370274931
+0.97031291378210283 0.20086000526876321 0.13471491243035441
+0.96679589706089264 0.15985780358782287 0.19937696972895619
+0.59667643972673035 -0.40176612662410133 0.69466625495449252
+0.26911716736226504 -0.9236940845413727 0.27269981374065155
+0.40547414873191501 -0.74192286377215233 0.53398612240605781
+0.8013456331579597 -0.06165331891640554 0.59501600355390483
+0.55216883979414844 -0.46626606661797843 0.69116244652106429
+0.6730187872058685 -0.26817151760031971 0.68929656115193505
+0.78108437977813128 -0.1264800315542341 -0.61148180127020324
+0.33566720821021839 -0.891573746743482 0.30401279487901056
+0.7274351680516471 -0.26105426945011495 0.63457761123722189
+0.83986385056568236 -0.054857140713616914 0.54001796879892028
+0.33924096091721673 -0.86230450765389344 -0.37596077789543381
+0.83986385056568236 -0.054857140713616914 -0.54001796879892028
+0.40632940254264294 -0.78437123837371059 0.46867704983435055
+0.78108437977813128 -0.12648003155423412 0.61148180127020324
+0.56664784959934433 -0.52372394783737519 0.63610018157997195
+0.56664784959934433 -0.5237239478373753 -0.63610018157997195
+0.40632940254264294 -0.78437123837371081 -0.46867704983435055
+0.33566720821021828 -0.891573746743482 -0.30401279487901051
+3  249 250 563
+3  258 422 428
+3  259 424 426
+3  260 426 424
+3  261 428 422
+3  262 430 432
+3  263 432 430
+3  264 575 436
+3  265 434 446
+3  594 590 440
+3  596 436 575
+3  266 438 444
+3  267 440 590
+3  268 442 448
+3  269 444 438
+3  270 446 434
+3  271 448 442
+3  609 450 454
+3  272 452 462
+3  273 454 450
+3  584 456 458
+3  274 458 456
+3  275 460 464
+3  165 166 576
+3  276 462 452
+3  277 464 460
+3  565 133 588
+3  278 465 489
+3  279 466 503
+3  280 467 493
+3  281 468 499
+3  282 469 481
+3  283 470 601
+3  558 471 557
+3  284 472 494
+3  285 473 505
+3  286 474 482
+3  233 234 573
+3  287 475 490
+3  288 476 500
+3  289 592 574
+3  154 155 598
+3  290 477 506
+3  291 478 502
+3  292 479 484
+3  293 480 491
+3  294 481 469
+3  295 482 474
+3  296 483 486
+3  297 484 479
+3  298 485 488
+3  299 486 483
+3  300 487 492
+3  301 488 485
+3  302 489 465
+3  303 490 475
+3  304 491 480
+3  305 492 487
+3  306 493 467
+3  307 494 472
+3  308 598 599
+3  309 495 498
+3  604 194 614
+3  310 496 508
+3  311 497 504
+3  312 498 495
+3  577 601 470
+3  313 499 468
+3  560 64 65
+3  105 106 607
+3  314 500 476
+3  315 557 471
+3  316 501 507
+3  317 502 478
+3  318 503 466
+3  319 504 497
+3  320 505 473
+3  321 506 477
+3  322 507 501
+3  323 508 496
+3  592 144 574
+3  314 510 324
+3  279 414 325
+3  320 512 326
+3  281 409 327
+3  294 514 328
+3  284 404 329
+3  286 613 330
+3  302 517 617
+3  45 46 611
+3  306 519 331
+3  287 400 332
+3  317 521 333
+3  289 420 334
+3  308 523 335
+3  290 417 336
+3  292 394 597
+3  300 524 337
+3  294 375 338
+3  589 41 618
+3  296 396 339
+3  304 525 340
+3  608 1 0
+3  287 526 341
+3  298 398 342
+3  292 593 343
+3  284 527 344
+3  300 402 345
+3  296 528 346
+3  302 369 347
+3  286 529 348
+3  304 391 349
+3  298 530 350
+3  306 372 351
+3  311 531 352
+3  308 600 353
+3  281 532 354
+3  309 408 355
+3  289 533 591
+3  310 419 356
+3  290 534 357
+3  311 415 358
+3  577 376 606
+3  322 535 359
+3  314 385 360
+3  558 559 361
+3  100 101 567
+3  310 536 362
+3  317 388 363
+3  309 537 364
+3  320 380 365
+3  279 538 366
+3  322 412 367
+3  264 608 602
+3  563 253 561
+3  27 28 594
+3  278 399 368
+3  266 347 369
+3  572 617 517
+3  291 539 370
+3  280 403 371
+3  268 351 372
+3  258 331 519
+3  283 540 373
+3  282 392 374
+3  270 338 375
+3  259 328 514
+3  229 230 581
+3  283 605 615
+3  609 606 376
+3  288 541 377
+3  75 76 616
+3  280 543 378
+3  285 416 379
+3  272 365 380
+3  260 326 512
+3  282 545 381
+3  573 410 382
+3  278 547 383
+3  288 411 384
+3  274 360 385
+3  261 324 510
+3  576 353 600
+3  262 335 523
+3  285 548 386
+3  291 413 387
+3  277 363 388
+3  263 333 521
+3  299 550 389
+3  293 401 390
+3  265 349 391
+3  264 340 525
+3  313 374 392
+3  295 381 545
+3  563 330 613
+3  265 348 529
+3  301 551 393
+3  297 389 550
+3  596 597 394
+3  594 343 593
+3  305 552 395
+3  299 393 551
+3  267 339 396
+3  266 346 528
+3  46 47 611
+3  267 589 618
+3  293 553 397
+3  301 395 552
+3  269 342 398
+3  268 350 530
+3  562 368 399
+3  303 383 547
+3  258 332 400
+3  269 341 526
+3  297 390 401
+3  305 397 553
+3  271 345 402
+3  270 337 524
+3  318 371 403
+3  307 378 543
+3  259 329 404
+3  271 344 527
+3  319 554 405
+3  604 406 610
+3  582 201 609
+3  312 610 406
+3  323 586 587
+3  316 555 407
+3  586 120 121
+3  571 178 179
+3  312 405 554
+3  273 355 408
+3  272 364 537
+3  223 224 615
+3  313 373 540
+3  260 327 409
+3  273 354 532
+3  295 382 410
+3  228 229 581
+3  315 616 556
+3  562 69 583
+3  98 99 584
+3  303 384 411
+3  315 377 541
+3  584 361 559
+3  316 418 612
+3  275 367 412
+3  274 359 535
+3  321 387 413
+3  318 370 539
+3  261 325 414
+3  275 366 538
+3  319 571 578
+3  276 358 415
+3  576 352 531
+3  307 379 416
+3  321 386 548
+3  262 336 417
+3  276 357 534
+3  568 612 418
+3  323 407 555
+3  588 356 419
+3  277 362 536
+3  263 334 420
+3  588 591 533
+3  603 245 613
+3  421 422 400
+3  261 422 324
+3  423 424 404
+3  260 424 326
+3  425 426 409
+3  259 426 328
+3  57 58 564
+3  572 53 617
+3  427 428 414
+3  258 428 331
+3  429 430 417
+3  263 430 333
+3  431 432 420
+3  262 432 335
+3  602 8 575
+3  575 12 596
+3  433 434 391
+3  270 434 337
+3  32 33 590
+3  267 590 589
+3  435 436 394
+3  264 436 340
+3  437 438 369
+3  269 438 341
+3  439 440 396
+3  594 440 343
+3  441 442 372
+3  271 442 344
+3  443 444 398
+3  266 444 346
+3  445 446 375
+3  265 446 348
+3  447 448 402
+3  268 448 350
+3  569 170 570
+3  576 569 352
+3  449 450 376
+3  273 450 354
+3  135 136 588
+3  451 452 380
+3  276 452 357
+3  453 454 408
+3  609 454 582
+3  455 456 567
+3  274 456 359
+3  457 458 385
+3  584 458 361
+3  459 460 412
+3  277 460 362
+3  461 462 415
+3  272 462 364
+3  463 464 388
+3  275 464 366
+3  566 565 419
+3  437 465 383
+3  302 465 369
+3  463 466 366
+3  318 466 370
+3  441 467 378
+3  306 467 372
+3  449 468 354
+3  313 468 373
+3  445 469 381
+3  294 469 375
+3  449 470 373
+3  577 470 376
+3  457 471 361
+3  315 471 377
+3  441 472 344
+3  307 472 378
+3  451 473 386
+3  320 473 380
+3  445 474 348
+3  295 474 381
+3  437 475 341
+3  303 475 383
+3  457 476 377
+3  314 476 385
+3  139 140 591
+3  308 599 600
+3  451 477 357
+3  321 477 386
+3  463 478 370
+3  317 478 388
+3  439 479 343
+3  297 479 389
+3  433 480 397
+3  304 480 391
+3  425 481 328
+3  282 481 392
+3  603 482 410
+3  286 482 613
+3  443 483 346
+3  299 483 393
+3  435 484 401
+3  292 484 394
+3  447 485 350
+3  301 485 395
+3  439 486 389
+3  296 486 396
+3  433 487 337
+3  305 487 397
+3  443 488 393
+3  298 488 398
+3  564 489 617
+3  278 489 399
+3  421 490 411
+3  287 490 400
+3  435 491 340
+3  293 491 401
+3  447 492 395
+3  300 492 402
+3  427 493 331
+3  280 493 403
+3  423 494 416
+3  284 494 404
+3  570 174 175
+3  431 598 335
+3  595 152 598
+3  461 495 364
+3  312 495 405
+3  453 614 582
+3  604 614 406
+3  459 496 362
+3  323 496 407
+3  570 497 352
+3  319 497 571
+3  453 498 406
+3  309 498 408
+3  283 601 605
+3  425 499 392
+3  281 499 409
+3  580 240 603
+3  573 580 410
+3  564 560 399
+3  455 607 418
+3  101 102 567
+3  421 500 324
+3  288 500 411
+3  556 81 82
+3  557 86 558
+3  459 501 407
+3  322 501 412
+3  429 502 333
+3  291 502 413
+3  427 503 403
+3  279 503 414
+3  461 504 405
+3  311 504 415
+3  423 505 326
+3  285 505 416
+3  429 506 413
+3  290 506 417
+3  455 507 359
+3  316 507 418
+3  566 508 587
+3  310 508 419
+3  431 574 595
+3  289 574 420
+3  564 58 59
+3  509 510 360
+3  261 510 325
+3  427 414 503
+3  261 414 428
+3  511 512 365
+3  260 512 327
+3  425 409 499
+3  260 409 426
+3  513 514 338
+3  259 514 329
+3  423 404 494
+3  259 404 424
+3  515 561 608
+3  563 561 330
+3  603 613 482
+3  246 247 613
+3  516 517 347
+3  572 517 611
+3  518 519 351
+3  258 519 332
+3  421 400 490
+3  258 400 422
+3  520 521 363
+3  263 521 334
+3  431 420 574
+3  263 420 432
+3  522 523 353
+3  262 523 336
+3  429 417 506
+3  262 417 430
+3  596 17 597
+3  435 394 484
+3  596 394 436
+3  513 524 345
+3  270 524 338
+3  445 375 469
+3  270 375 446
+3  516 618 611
+3  267 618 339
+3  439 396 486
+3  267 396 440
+3  515 525 349
+3  264 525 608
+3  264 602 575
+3  518 526 332
+3  269 526 342
+3  443 398 488
+3  269 398 444
+3  597 21 593
+3  593 24 25
+3  594 29 30
+3  513 527 329
+3  271 527 345
+3  447 402 492
+3  271 402 448
+3  516 528 339
+3  266 528 347
+3  437 369 465
+3  266 369 438
+3  515 529 330
+3  265 529 349
+3  433 391 480
+3  265 391 434
+3  518 530 342
+3  268 530 351
+3  441 372 467
+3  268 372 442
+3  522 531 358
+3  576 531 353
+3  599 159 160
+3  600 163 576
+3  511 532 327
+3  273 532 355
+3  453 408 498
+3  273 408 454
+3  520 533 334
+3  588 533 356
+3  566 419 508
+3  588 419 565
+3  522 534 336
+3  276 534 358
+3  461 415 504
+3  276 415 462
+3  202 203 609
+3  449 376 470
+3  609 376 450
+3  509 535 367
+3  274 535 360
+3  457 385 476
+3  274 385 458
+3  559 95 584
+3  455 567 607
+3  584 567 456
+3  520 536 356
+3  277 536 363
+3  463 388 478
+3  277 388 464
+3  511 537 355
+3  272 537 365
+3  451 380 473
+3  272 380 452
+3  509 538 325
+3  275 538 367
+3  459 412 501
+3  275 412 460
+3  515 608 525
+3  257 1 608
+3  23 24 593
+3  546 583 616
+3  562 583 368
+3  564 399 489
+3  562 399 560
+3  516 347 528
+3  302 347 517
+3  54 55 617
+3  302 617 489
+3  542 539 387
+3  318 539 371
+3  427 403 493
+3  318 403 503
+3  518 351 530
+3  306 351 519
+3  427 331 428
+3  306 331 493
+3  544 540 615
+3  313 540 374
+3  425 392 481
+3  313 392 499
+3  513 338 524
+3  294 338 514
+3  425 328 426
+3  294 328 481
+3  544 581 382
+3  225 226 615
+3  216 217 601
+3  606 208 209
+3  212 213 577
+3  546 541 384
+3  315 541 616
+3  315 556 557
+3  542 543 371
+3  307 543 379
+3  423 416 505
+3  307 416 494
+3  511 365 537
+3  320 365 512
+3  423 326 424
+3  320 326 505
+3  544 545 374
+3  295 545 382
+3  603 410 580
+3  295 410 482
+3  546 547 368
+3  303 547 384
+3  421 411 500
+3  303 411 490
+3  509 360 535
+3  314 360 510
+3  421 324 422
+3  314 324 500
+3  431 595 598
+3  574 146 147
+3  522 353 531
+3  308 353 523
+3  431 335 432
+3  308 335 598
+3  542 548 379
+3  321 548 387
+3  429 413 502
+3  321 413 506
+3  520 363 536
+3  317 363 521
+3  429 333 430
+3  317 333 502
+3  549 550 551
+3  297 550 390
+3  435 401 491
+3  297 401 484
+3  515 349 529
+3  304 349 525
+3  435 340 436
+3  304 340 491
+3  544 374 540
+3  282 374 545
+3  445 381 474
+3  282 381 469
+3  515 330 561
+3  286 330 529
+3  445 348 446
+3  286 348 474
+3  549 551 552
+3  299 551 550
+3  439 389 479
+3  299 389 486
+3  292 597 593
+3  439 343 440
+3  292 343 479
+3  549 552 553
+3  301 552 551
+3  443 393 483
+3  301 393 488
+3  516 339 618
+3  296 339 528
+3  443 346 444
+3  296 346 483
+3  516 611 517
+3  42 43 618
+3  33 34 590
+3  549 553 390
+3  305 553 552
+3  447 395 485
+3  305 395 492
+3  518 342 526
+3  298 342 530
+3  447 350 448
+3  298 350 485
+3  546 368 583
+3  278 368 547
+3  437 383 475
+3  278 383 465
+3  518 332 519
+3  287 332 526
+3  437 341 438
+3  287 341 475
+3  549 390 550
+3  293 390 553
+3  433 397 487
+3  293 397 480
+3  513 345 527
+3  300 345 524
+3  433 337 434
+3  300 337 487
+3  542 371 539
+3  280 371 543
+3  441 378 472
+3  280 378 467
+3  513 329 514
+3  284 329 527
+3  441 344 442
+3  284 344 472
+3  579 186 187
+3  579 554 578
+3  312 554 610
+3  453 406 614
+3  312 406 498
+3  453 582 454
+3  197 198 582
+3  579 610 554
+3  188 189 610
+3  585 586 555
+3  585 555 612
+3  323 555 586
+3  123 124 587
+3  323 587 508
+3  127 128 566
+3  578 181 182
+3  319 578 554
+3  461 405 495
+3  319 405 504
+3  511 355 532
+3  309 355 537
+3  461 364 462
+3  309 364 495
+3  544 615 581
+3  283 615 540
+3  449 373 468
+3  283 373 470
+3  511 327 512
+3  281 327 532
+3  449 354 450
+3  281 354 468
+3  544 382 545
+3  573 382 581
+3  546 616 541
+3  583 74 616
+3  585 115 116
+3  546 384 547
+3  288 384 541
+3  457 377 471
+3  288 377 476
+3  558 89 90
+3  457 361 458
+3  558 361 471
+3  568 111 612
+3  455 418 507
+3  568 418 607
+3  509 367 538
+3  322 367 535
+3  455 359 456
+3  322 359 507
+3  542 387 548
+3  291 387 539
+3  463 370 466
+3  291 370 478
+3  509 325 510
+3  279 325 538
+3  463 366 464
+3  279 366 466
+3  570 571 497
+3  522 358 534
+3  311 358 531
+3  570 352 569
+3  311 352 497
+3  542 379 543
+3  285 379 548
+3  451 386 477
+3  285 386 473
+3  522 336 523
+3  290 336 534
+3  451 357 452
+3  290 357 477
+3  112 113 612
+3  316 612 555
+3  459 407 496
+3  316 407 501
+3  520 356 533
+3  310 356 536
+3  459 362 460
+3  310 362 496
+3  520 334 521
+3  289 334 533
+3  289 591 592
+3  78 556 77
+3  80 556 79
+3  79 556 78
+3  147 148 574
+3  574 148 595
+3  585 612 113
+3  585 113 114
+3  2 602 0
+3  5 602 4
+3  4 602 2
+3  4 2 3
+3  90 91 559
+3  558 90 559
+3  91 92 559
+3  560 62 63
+3  64 560 63
+3  83 84 557
+3  556 82 557
+3  82 83 557
+3  240 580 239
+3  603 240 241
+3  603 241 242
+3  104 607 103
+3  105 607 104
+3  86 557 85
+3  558 86 87
+3  558 87 88
+3  614 195 196
+3  197 614 196
+3  125 587 124
+3  566 587 125
+3  566 125 126
+3  589 590 34
+3  589 34 35
+3  21 597 20
+3  593 21 22
+3  153 154 598
+3  152 153 598
+3  589 37 38
+3  41 589 40
+3  40 589 38
+3  40 38 39
+3  556 616 77
+3  616 76 77
+3  593 22 23
+3  255 561 254
+3  257 561 256
+3  256 561 255
+3  142 592 141
+3  143 592 142
+3  582 614 197
+3  582 198 199
+3  94 559 93
+3  95 559 94
+3  563 247 248
+3  248 249 563
+3  60 61 560
+3  564 60 560
+3  59 60 564
+3  179 180 578
+3  571 179 578
+3  66 67 562
+3  560 65 562
+3  65 66 562
+3  591 588 137
+3  588 136 137
+3  253 254 561
+3  562 67 68
+3  69 562 68
+3  70 71 583
+3  69 70 583
+3  563 250 251
+3  252 563 251
+3  253 563 252
+3  580 573 235
+3  580 235 236
+3  573 234 235
+3  14 596 13
+3  16 596 15
+3  15 596 14
+3  8 602 7
+3  575 8 9
+3  564 55 56
+3  56 57 564
+3  157 599 156
+3  567 99 100
+3  565 566 130
+3  565 130 131
+3  566 128 130
+3  128 129 130
+3  606 609 205
+3  609 203 204
+3  609 204 205
+3  10 575 9
+3  11 575 10
+3  109 568 108
+3  110 568 109
+3  111 568 110
+3  607 567 103
+3  567 102 103
+3  48 572 47
+3  50 572 49
+3  49 572 48
+3  567 584 99
+3  107 568 106
+3  108 568 107
+3  170 569 169
+3  570 170 172
+3  172 170 171
+3  570 172 173
+3  175 176 571
+3  570 175 571
+3  176 177 571
+3  611 43 44
+3  44 45 611
+3  210 211 577
+3  606 210 577
+3  209 210 606
+3  600 161 162
+3  163 600 162
+3  599 157 158
+3  159 599 158
+3  51 572 50
+3  53 572 52
+3  52 572 51
+3  569 576 167
+3  576 166 167
+3  149 595 148
+3  150 595 149
+3  19 597 18
+3  20 597 19
+3  30 31 590
+3  594 30 590
+3  594 26 27
+3  28 29 594
+3  138 591 137
+3  139 591 138
+3  581 226 227
+3  227 228 581
+3  232 573 231
+3  233 573 232
+3  145 146 574
+3  144 145 574
+3  12 575 11
+3  596 12 13
+3  164 165 576
+3  163 164 576
+3  601 577 214
+3  601 214 215
+3  577 213 214
+3  187 188 610
+3  579 187 610
+3  578 184 579
+3  578 183 184
+3  182 183 578
+3  184 185 579
+3  237 580 236
+3  238 580 237
+3  190 604 189
+3  191 604 190
+3  192 604 191
+3  573 581 231
+3  581 230 231
+3  615 605 223
+3  615 224 225
+3  582 199 200
+3  201 582 200
+3  72 583 71
+3  73 583 72
+3  583 73 74
+3  96 97 584
+3  95 96 584
+3  97 98 584
+3  117 118 586
+3  585 116 586
+3  116 117 586
+3  118 119 586
+3  121 122 587
+3  586 121 587
+3  134 135 588
+3  133 134 588
+3  36 589 35
+3  37 589 36
+3  590 31 32
+3  592 591 140
+3  592 140 141
+3  25 26 594
+3  593 25 594
+3  595 150 151
+3  152 595 151
+3  17 596 16
+3  597 17 18
+3  599 598 156
+3  598 155 156
+3  160 161 600
+3  599 160 600
+3  218 601 217
+3  605 601 218
+3  605 218 219
+3  602 5 6
+3  7 602 6
+3  603 242 243
+3  245 603 244
+3  244 603 243
+3  193 604 192
+3  194 604 193
+3  579 185 186
+3  605 220 221
+3  223 605 222
+3  222 605 221
+3  578 180 181
+3  206 606 205
+3  207 606 206
+3  568 607 106
+3  115 585 114
+3  558 88 89
+3  556 80 81
+3  608 0 602
+3  608 561 257
+3  586 119 120
+3  85 557 84
+3  93 559 92
+3  201 202 609
+3  168 569 167
+3  560 61 62
+3  604 610 189
+3  565 132 133
+3  572 611 47
+3  174 570 173
+3  592 143 144
+3  111 112 612
+3  127 566 126
+3  123 587 122
+3  132 565 131
+3  41 42 618
+3  245 246 613
+3  563 613 247
+3  571 177 178
+3  580 238 239
+3  194 195 614
+3  220 605 219
+3  581 615 226
+3  216 601 215
+3  169 569 168
+3  74 75 616
+3  564 617 55
+3  53 54 617
+3  611 618 43
+3  577 211 212
+3  606 207 208
+

From 30fe1ed629dcd31fe7f30f39c57afd8d9305bffc Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 24 Nov 2023 11:16:05 +0100
Subject: [PATCH 1081/1398] shape criterion renamed

---
 .../test/Periodic_3_mesh_3/test_implicit_shapes_bunch.cpp       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Periodic_3_mesh_3/test/Periodic_3_mesh_3/test_implicit_shapes_bunch.cpp b/Periodic_3_mesh_3/test/Periodic_3_mesh_3/test_implicit_shapes_bunch.cpp
index f09fffd0d4f1..87669ceb91d5 100644
--- a/Periodic_3_mesh_3/test/Periodic_3_mesh_3/test_implicit_shapes_bunch.cpp
+++ b/Periodic_3_mesh_3/test/Periodic_3_mesh_3/test_implicit_shapes_bunch.cpp
@@ -230,7 +230,7 @@ int main()
     Periodic_mesh_criteria criteria(facet_angle = 30,
                                     facet_size = 0.05,
                                     facet_distance = 0.025,
-                                    cell_radius_edge = 2,
+                                    cell_radius_edge_ratio = 2,
                                     cell_size = 0.05);
 
     // Mesh generation

From a34698c40340ed90579e0eb19d6d135c56229692 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 24 Nov 2023 11:21:02 +0100
Subject: [PATCH 1082/1398] fix install.sh with Qt6

---
 .github/install.sh | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/.github/install.sh b/.github/install.sh
index 8adc6b5d2d91..0c030be8e7aa 100755
--- a/.github/install.sh
+++ b/.github/install.sh
@@ -12,13 +12,13 @@ sudo apt-get install -y \
  qtbase5-dev libqt5sql5-sqlite libqt5opengl5-dev qtscript5-dev libqt5websockets5-dev \
  libqt5svg5-dev qttools5-dev qttools5-dev-tools \
  libboost-dev libboost-serialization-dev libboost-iostreams-dev libboost-filesystem-dev libboost-filesystem-dev \
- libvtk9-dev libunwind-dev \
+ libvtk9-dev libgdcm-tools libvtkgdcm-dev libunwind-dev \
  libinsighttoolkit5-dev \
  libceres-dev \
  libglpk-dev \
  libopencv-dev \
  zsh \
- qt6-base-dev qt6-declarative-dev
+ qt6-base-dev qt6-declarative-dev libqt6svg6-dev libqt6websockets6-dev
 
 #update CMake
 sudo apt purge --auto-remove cmake

From 7fda26f33ff649f34bb67cd8ac2a4047b80c5a17 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 27 Nov 2023 09:52:49 +0100
Subject: [PATCH 1083/1398] add isotropic remeshing with sizing to CHANGES.md

---
 Installation/CHANGES.md | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index e6dca21c1f6d..2b2524a98570 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -41,7 +41,9 @@ Release date: October 2023
 
 -   Added the function `CGAL::Polygon_mesh_processing::interpolated_corrected_curvatures()` which can be used to compute
     the mean and Gaussian curvatures, as well as the principal curvature and directions.
-    
+-   Added the option to use a variable sizing field for `CGAL::Polygon_mesh_processing::isotropic_remeshing()`,
+    and a sizing function based on a measure of local curvature for adaptive remeshing.
+
 ### [2D Arrangements](https://doc.cgal.org/6.0/Manual/packages.html#PkgArrangementOnSurface2)
 -   Fixed a bug in the zone construction code applied to arrangements of geodesic arcs on a sphere,
     when inserting an arc that lies on the identification curve.

From 30bdbab52427a4761534f0bf98f989d9d6f6acea Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 27 Nov 2023 13:20:38 +0100
Subject: [PATCH 1084/1398] fix warnings

---
 .../predefined_kernel_non_intersecting.cpp                      | 1 -
 Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h | 2 +-
 2 files changed, 1 insertion(+), 2 deletions(-)

diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp
index 0f91300cd605..2300d13c7814 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/predefined_kernel_non_intersecting.cpp
@@ -42,7 +42,6 @@ int main(int argc, char* argv[]) {
 
   std::size_t n;
   in_file >> n;
-  unsigned int i;
   for (std::size_t i = 0; i < n; ++i) {
     double sx, sy, tx, ty;
     in_file >> sx >> sy >> tx >> ty;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
index 810da81aa6f6..b4ecc559815d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_curve_data_traits_2.h
@@ -248,7 +248,7 @@ class Arr_curve_data_traits_2 : public Traits_ {
     const Base_traits_2& m_base;
 
     template <typename T>
-    bool are_mergeable_data(const T& cv1, const T& cv2, long) const {
+    bool are_mergeable_data(const T& /* cv1 */, const T& /* cv2 */, long) const {
       CGAL_error_msg("Equality operator is not supported.");
       return false;
     }

From 65621c2e9e744b78f0889ab33b43ac63d4d8e5e0 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 27 Nov 2023 12:51:20 +0000
Subject: [PATCH 1085/1398] Spatial Searching: Add example storing
 triangulation vertices

---
 Spatial_searching/doc/Spatial_searching/examples.txt        | 1 +
 Spatial_searching/examples/Spatial_searching/CMakeLists.txt | 1 +
 2 files changed, 2 insertions(+)

diff --git a/Spatial_searching/doc/Spatial_searching/examples.txt b/Spatial_searching/doc/Spatial_searching/examples.txt
index defc30a2079e..8c3c7920ff77 100644
--- a/Spatial_searching/doc/Spatial_searching/examples.txt
+++ b/Spatial_searching/doc/Spatial_searching/examples.txt
@@ -11,6 +11,7 @@
 \example Spatial_searching/searching_with_circular_query.cpp
 \example Spatial_searching/searching_surface_mesh_vertices.cpp
 \example Spatial_searching/searching_polyhedron_vertices.cpp
+\example Spatial_searching/searching_triangulation_vertices.cpp
 \example Spatial_searching/searching_with_point_with_info.cpp
 \example Spatial_searching/searching_with_point_with_info_inplace.cpp
 \example Spatial_searching/searching_with_point_with_info_pmap.cpp
diff --git a/Spatial_searching/examples/Spatial_searching/CMakeLists.txt b/Spatial_searching/examples/Spatial_searching/CMakeLists.txt
index f9546507bd49..b273ac3477bf 100644
--- a/Spatial_searching/examples/Spatial_searching/CMakeLists.txt
+++ b/Spatial_searching/examples/Spatial_searching/CMakeLists.txt
@@ -23,6 +23,7 @@ create_single_source_cgal_program("searching_with_point_with_info_inplace.cpp")
 create_single_source_cgal_program("searching_with_point_with_info_pmap.cpp")
 create_single_source_cgal_program("searching_surface_mesh_vertices.cpp")
 create_single_source_cgal_program("searching_polyhedron_vertices.cpp")
+create_single_source_cgal_program("searching_triangulation_vertices.cpp")
 create_single_source_cgal_program("searching_polyhedron_vertices_with_fuzzy_sphere.cpp")
 create_single_source_cgal_program("user_defined_point_and_distance.cpp")
 create_single_source_cgal_program("using_fair_splitting_rule.cpp")

From c018e0fe7c4f6c28f4854756968738e93bbf618c Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 27 Nov 2023 12:54:26 +0000
Subject: [PATCH 1086/1398] The example itself

---
 .../searching_triangulation_vertices.cpp      | 65 +++++++++++++++++++
 1 file changed, 65 insertions(+)
 create mode 100644 Spatial_searching/examples/Spatial_searching/searching_triangulation_vertices.cpp

diff --git a/Spatial_searching/examples/Spatial_searching/searching_triangulation_vertices.cpp b/Spatial_searching/examples/Spatial_searching/searching_triangulation_vertices.cpp
new file mode 100644
index 000000000000..a045313f3f56
--- /dev/null
+++ b/Spatial_searching/examples/Spatial_searching/searching_triangulation_vertices.cpp
@@ -0,0 +1,65 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Search_traits_3.h>
+#include <CGAL/Search_traits_adapter.h>
+#include <CGAL/Orthogonal_k_neighbor_search.h>
+#include <CGAL/Delaunay_triangulation_3.h>
+#include <CGAL/function_objects.h>
+
+#include <boost/property_map/function_property_map.hpp>
+
+#include <fstream>
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
+typedef Kernel::Point_3 Point_3;
+typedef CGAL::Delaunay_triangulation_3<Kernel> Delaunay;
+typedef Delaunay::Vertex_handle Vertex_handle;
+
+
+struct Project {
+  typedef Vertex_handle   argument_type;
+  typedef const Point_3&  Point;
+  typedef Point           result_type;
+  const Point& operator()( Vertex_handle  v) const { return v->point(); }
+};
+
+
+typedef boost::function_property_map<Project, Vertex_handle> Vertex_point_pmap;
+typedef CGAL::Search_traits_3<Kernel>                        Traits_base;
+typedef CGAL::Search_traits_adapter<Vertex_handle,Vertex_point_pmap,Traits_base> Traits;
+typedef CGAL::Orthogonal_k_neighbor_search<Traits>                               K_neighbor_search;
+typedef K_neighbor_search::Tree                                                  Tree;
+typedef Tree::Splitter                                                           Splitter;
+typedef K_neighbor_search::Distance                                              Distance;
+
+int main(int argc, char* argv[])
+{
+  std::ifstream in((argc>1)?argv[1]:CGAL::data_file_path("points_3/kitten.xyz"));
+  std::vector<Point_3> points;
+  Point_3 p;
+  while(in >> p){
+    points.push_back(p);
+  }
+
+  Delaunay dt(points.begin(), points.end());
+
+  const unsigned int K = 5;
+
+  Project project;
+  Vertex_point_pmap vppmap(project);
+
+  // Insert number_of_data_points in the tree
+  Tree tree(dt.finite_vertex_handles().begin(), dt.finite_vertex_handles().end(), Splitter(), Traits(vppmap));
+
+  // search K nearest neighbors
+  Point_3 query(0.0, 0.0, 0.0);
+  Distance tr_dist(vppmap);
+
+  K_neighbor_search search(tree, query, K,0,true,tr_dist);
+  std::cout <<"The "<< K << " nearest vertices to the query point at (0,0,0) are:" << std::endl;
+  for(K_neighbor_search::iterator it = search.begin(); it != search.end(); it++){
+    std::cout << "vertex " << &*(it->first) << " : " << vppmap[it->first] << " at distance "
+              << tr_dist.inverse_of_transformed_distance(it->second) << std::endl;
+  }
+
+  return 0;
+}

From f36693c48e10dcb008a3916e4bae267964ffb2db Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 28 Nov 2023 10:29:46 +0100
Subject: [PATCH 1087/1398] Fix warning

---
 .../Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index 383d1103778f..ddc84bc5002f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -217,7 +217,7 @@ struct AW3_interrupter_visitor
   { }
 
   template <typename Wrapper>
-  constexpr bool go_further(const Wrapper& wrapper)
+  constexpr bool go_further(const Wrapper&)
   {
     return !(*should_stop);
   }

From 566149c0cca8a70bd3153a620e8eac64dfdbc7ec Mon Sep 17 00:00:00 2001
From: Sven Oesau <sven.oesau@geometryfactory.com>
Date: Wed, 29 Nov 2023 08:22:24 +0100
Subject: [PATCH 1088/1398] FacetTriangulator: removing ghost edges from cdt
 and using mark_domain_in_triangulation

---
 .../Polyhedron/Plugins/IO/PLY_io_plugin.cpp   |  2 +-
 .../Polyhedron/Scene_polygon_soup_item.cpp    |  3 +-
 .../Polyhedron/Scene_surface_mesh_item.cpp    |  1 +
 .../demo/Polyhedron/triangulate_primitive.h   | 65 +++++++++++++++++--
 .../include/CGAL/IO/PLY/PLY_reader.h          |  6 ++
 5 files changed, 70 insertions(+), 7 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/PLY_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/PLY_io_plugin.cpp
index fe4120c59191..e7d371e08918 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/PLY_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/PLY_io_plugin.cpp
@@ -132,7 +132,7 @@ load(QFileInfo fileinfo, bool& ok, bool add_to_scene) {
     std::vector<CGAL::IO::Color> fcolors;
     std::vector<CGAL::IO::Color> vcolors;
 
-    if (!(CGAL::IO::read_PLY (in, points, polygons, fcolors, vcolors)))
+    if (!(CGAL::IO::read_PLY (in, points, polygons, fcolors, vcolors, true)))
     {
       QApplication::restoreOverrideCursor();
       ok = false;
diff --git a/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.cpp
index 8ba8813f3494..a7e32dc0d266 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.cpp
@@ -150,6 +150,7 @@ Scene_polygon_soup_item_priv::triangulate_polygon(Polygons_iterator pit, int pol
       pointIds.push_back(pointId);
     } while( ++it != it_end );
     //detect degenerated faces
+/*
     std::vector<FT::PointAndId> pid_stack = pointIds;
     for(std::size_t i = 0; i< pointIds.size(); ++i)
     {
@@ -162,7 +163,7 @@ Scene_polygon_soup_item_priv::triangulate_polygon(Polygons_iterator pit, int pol
         return;
       }
      }
-    }
+    }*/
     FT triangulation(pointIds,normal);
     //iterates on the internal faces to add the vertices to the positions
     //and the normals to the appropriate vectors
diff --git a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
index 49e2da75e659..3dce2285c44e 100644
--- a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
@@ -1040,6 +1040,7 @@ Scene_surface_mesh_item_priv::triangulate_facet(face_descriptor fd,
 
   }
 }
+
 void delete_aabb_tree(Scene_surface_mesh_item* item)
 {
     QVariant aabb_tree_property = item->property(aabb_property_name);
diff --git a/Polyhedron/demo/Polyhedron/triangulate_primitive.h b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
index cf7aa8a457bb..fd154ad05144 100644
--- a/Polyhedron/demo/Polyhedron/triangulate_primitive.h
+++ b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
@@ -6,6 +6,7 @@
 #include <CGAL/Triangulation_vertex_base_with_info_2.h>
 #include <CGAL/Triangulation_face_base_with_info_2.h>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
+#include <CGAL/mark_domain_in_triangulation.h>
 
 #include <CGAL/Projection_traits_3.h>
 
@@ -45,7 +46,7 @@ class FacetTriangulator
   using Fbb = CGAL::Triangulation_face_base_with_info_2<Face_info, P_traits>;
   using Fb = CGAL::Constrained_triangulation_face_base_2<P_traits, Fbb>;
   using TDS = CGAL::Triangulation_data_structure_2<Vb, Fb>;
-  using Itag = CGAL::Exact_predicates_tag;
+  using Itag = CGAL::Exact_predicates_tag;//Exact_intersections_tag
   using CDT = CGAL::Constrained_Delaunay_triangulation_2<P_traits, TDS, Itag>;
 
   using Vertex_handle = typename CDT::Vertex_handle;
@@ -121,13 +122,40 @@ class FacetTriangulator
     P_traits cdt_traits(normal);
     cdt = new CDT(cdt_traits);
 
+    std::map<std::pair<Point_3, Point_3>, std::size_t> edge_map;
+    std::vector<bool> skip(idPoints.size(), false);
+    bool has_ghost_edges = false;
+
+/*
+    for (std::size_t i = 0; i < idPoints.size(); i++) {
+      int prev = (i - 1 + idPoints.size()) % idPoints.size();
+      if (idPoints[i].point < idPoints[prev].point) {
+        auto it = edge_map.emplace(std::make_pair(idPoints[i].point, idPoints[prev].point), i);
+        if (!it.second) {
+          skip[i] = true;
+          skip[it.first->second] = true;
+          has_ghost_edges = true;
+        }
+      }
+      else {
+        auto it = edge_map.emplace(std::make_pair(idPoints[prev].point, idPoints[i].point), i);
+        if (!it.second) {
+          skip[i] = true;
+          skip[it.first->second] = true;
+          has_ghost_edges = true;
+        }
+      }
+    }*/
+
     Vertex_handle previous, first, last_inserted;
+    std::size_t previd, firstid, lastid;
 
     // Iterate the points of the facet and decide if they must be inserted in the CDT
     typename Kernel::FT x(0), y(0), z(0);
 
-    for(const PointAndId& idPoint : idPoints)
+    for(std::size_t i = 0;i<idPoints.size();i++)
     {
+      const PointAndId& idPoint = idPoints[i];
       x += idPoint.point.x();
       y += idPoint.point.y();
       z += idPoint.point.z();
@@ -138,29 +166,52 @@ class FacetTriangulator
       {
         vh = cdt->insert(idPoint.point);
         v2v[vh] = idPoint.id;
-        if(first == Vertex_handle())
+        if (first == Vertex_handle()) {
           first = vh;
+          firstid = idPoint.id;
+        }
 
         if(previous != nullptr && previous != vh)
         {
-          cdt->insert_constraint(previous, vh);
+          if (!skip[i])
+            cdt->insert_constraint(previous, vh);
           last_inserted = previous;
+          lastid = previd;
         }
         previous = vh;
+        previd = idPoint.id;
       }
     }
 
     if(last_inserted == Vertex_handle())
       return false;
 
-    if(previous != first)
+    if(previous != first && !skip[0])
       cdt->insert_constraint(previous, first);
 
+/*
+    std::vector<Point_3> pts;
+    std::ofstream vout("test.polylines.txt");
+    for (auto& e : cdt->constrained_edges()) {
+      // edge is a pair of Face_handle and index
+      auto v1 = e.first->vertex((e.second + 1) % 3);
+      auto v2 = e.first->vertex((e.second + 2) % 3);
+      pts.push_back(v1->point());
+      pts.push_back(v2->point());
+      vout << "2 " << v1->point() << " " << v2->point() << std::endl;
+    }
+    vout.close();*/
+
     // sets mark is_external
     for(Face_handle f2 : cdt->all_face_handles())
       f2->info().is_external = false;
 
+     std::unordered_map<Face_handle, bool> in_domain_map;
+     boost::associative_property_map< std::unordered_map<Face_handle, bool> > in_domain(in_domain_map);
+    CGAL::mark_domain_in_triangulation<CDT>(*cdt, in_domain);
+
     // check if the facet is external or internal
+/*
     std::queue<typename CDT::Face_handle> face_queue;
     face_queue.push(cdt->infinite_vertex()->face());
     while(! face_queue.empty())
@@ -176,6 +227,10 @@ class FacetTriangulator
         if(!cdt->is_constrained(std::make_pair(fh, i)))
           face_queue.push(fh->neighbor(i));
       }
+    }*/
+
+    for (const Face_handle& fh : cdt->all_face_handles()) {
+      fh->info().is_external = !get(in_domain, fh);
     }
 
     return true;
diff --git a/Stream_support/include/CGAL/IO/PLY/PLY_reader.h b/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
index ee8b18ef59c0..c1a0ab4e580a 100644
--- a/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
+++ b/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
@@ -726,6 +726,9 @@ bool read_PLY_faces(std::istream& in,
 
   for(std::size_t j = 0; j < element.number_of_items(); ++ j)
   {
+    if (j == 228)
+      std::cout << std::endl;
+
     for(std::size_t k = 0; k < element.number_of_properties(); ++ k)
     {
       PLY_read_number* property = element.property(k);
@@ -758,6 +761,9 @@ bool read_PLY_faces(std::istream& in,
                                         PLY_property<std::vector<Integer> >(vertex_indices_tag)));
     }
 
+    if (get<0>(new_face).size() == 0)
+      std::cout << "empty face encountered" << std::endl;
+
     polygons.emplace_back();
     ::CGAL::internal::resize(polygons.back(), get<0>(new_face).size());
     for(std::size_t i = 0; i < get<0>(new_face).size(); ++ i)

From abbbb53096037c75c3ffa4da3fed159406ab3827 Mon Sep 17 00:00:00 2001
From: Sven Oesau <sven.oesau@geometryfactory.com>
Date: Wed, 29 Nov 2023 11:03:50 +0100
Subject: [PATCH 1089/1398] added missing dependency to OSQP when default
 solver is used

---
 .../include/CGAL/Shape_regularization/regularize_segments.h    | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Shape_regularization/include/CGAL/Shape_regularization/regularize_segments.h b/Shape_regularization/include/CGAL/Shape_regularization/regularize_segments.h
index 2042cff97b52..ad290801019a 100644
--- a/Shape_regularization/include/CGAL/Shape_regularization/regularize_segments.h
+++ b/Shape_regularization/include/CGAL/Shape_regularization/regularize_segments.h
@@ -70,6 +70,9 @@ namespace Segments {
     that should be addressed. The function is based on the class `QP_regularization`.
     Please refer to that class and these concepts for more information.
 
+    This class requires a `QPSolver` model which defaults to the \ref thirdpartyOSQP "OSQP"
+    library, which must be available on the system.
+
     \tparam InputRange
     a model of `ConstRange` whose iterator type is `RandomAccessIterator`
 

From a64cb2e3c6a7993a8ffc3cb7f8ec4b3c31afb904 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 29 Nov 2023 16:34:24 +0100
Subject: [PATCH 1090/1398] Remove old infra backups

---
 .../magritte.geometryfactory.com/autocgalrc   |   42 -
 .../reference_platforms/common_setup          |   11 -
 .../CMakeCache.txt                            |  742 -----
 .../setup                                     |   11 -
 .../CMakeCache.txt                            |  742 -----
 .../setup                                     |   11 -
 .../CMakeCache.txt                            |  733 -----
 .../setup                                     |   19 -
 .../magritte.geometryfactory.com/update.sh    |    4 -
 .../renoir.geometryfactory.com/.autocgalrc    |   43 -
 .../boost/README.txt                          |   16 -
 .../boost/compile-boost                       |   29 -
 .../boost/user-config.jam                     |  106 -
 .../reference-platforms/setup-common          |    7 -
 .../setup-common-headers-only                 |    5 -
 .../reference-platforms/setup-mkl-64bits      |   11 -
 .../reference-platforms/setup-taucs-64bits    |    3 -
 .../CMakeCache.txt                            | 2127 --------------
 .../setup                                     |   14 -
 .../CMakeCache.txt                            | 2127 --------------
 .../setup                                     |   14 -
 .../CMakeCache.txt                            | 2376 ----------------
 .../setup                                     |   15 -
 .../CMakeCache.txt                            | 2407 ----------------
 .../setup                                     |   15 -
 .../CMakeCache.txt                            | 2410 ----------------
 .../x86-64_Linux-Fedora19_g++-4.8/setup       |    2 -
 .../CMakeCache.txt                            | 2421 ----------------
 .../patch-qt-4.8/QtCore/qobjectdefs.h         |  506 ----
 .../patch-qt-4.8/QtCore/qplugin.h             |  152 -
 .../x86-64_Linux-Fedora19_g++-4.8_CXX0X/setup |   14 -
 .../CMakeCache.txt                            | 2325 ---------------
 .../initial.cmake                             |    1 -
 .../setup                                     |   18 -
 .../CMakeCache.txt                            | 2464 ----------------
 .../setup                                     |    2 -
 .../CMakeCache.txt                            | 2263 ---------------
 .../setup                                     |   13 -
 .../CMakeCache.txt                            | 2476 ----------------
 .../setup                                     |    5 -
 .../CMakeCache.txt                            | 2506 -----------------
 .../initial.cmake                             |    1 -
 .../x86-64_Linux-Fedora19_g++-4.8_ansi/setup  |    6 -
 .../CMakeCache.txt                            | 2255 ---------------
 .../x86-64_Linux-Fedora19_g++-4.8_m32/setup   |    8 -
 .../CMakeCache.txt                            | 2384 ----------------
 .../patch-qt-4.8/QtCore/qobjectdefs.h         |  506 ----
 .../patch-qt-4.8/QtCore/qplugin.h             |  152 -
 .../setup                                     |   13 -
 .../CMakeCache.txt                            | 2446 ----------------
 .../setup                                     |   16 -
 .../suppr.txt                                 |    2 -
 .../CMakeCache.txt                            |  842 ------
 .../setup                                     |    5 -
 .../CMakeCache.txt                            |  842 ------
 .../setup                                     |    5 -
 56 files changed, 38691 deletions(-)
 delete mode 100644 Maintenance/infrastructure/magritte.geometryfactory.com/autocgalrc
 delete mode 100644 Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/common_setup
 delete mode 100644 Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11/setup
 delete mode 100644 Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release/setup
 delete mode 100644 Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP/setup
 delete mode 100755 Maintenance/infrastructure/magritte.geometryfactory.com/update.sh
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/.autocgalrc
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/boost/README.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/boost/compile-boost
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/boost/user-config.jam
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-common
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-common-headers-only
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-mkl-64bits
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-taucs-64bits
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/patch-qt-4.8/QtCore/qobjectdefs.h
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/patch-qt-4.8/QtCore/qplugin.h
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/initial.cmake
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/initial.cmake
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/patch-qt-4.8/QtCore/qobjectdefs.h
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/patch-qt-4.8/QtCore/qplugin.h
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/suppr.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions/setup
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17/CMakeCache.txt
 delete mode 100644 Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17/setup

diff --git a/Maintenance/infrastructure/magritte.geometryfactory.com/autocgalrc b/Maintenance/infrastructure/magritte.geometryfactory.com/autocgalrc
deleted file mode 100644
index 6df1a23afa70..000000000000
--- a/Maintenance/infrastructure/magritte.geometryfactory.com/autocgalrc
+++ /dev/null
@@ -1,42 +0,0 @@
-PATH=$PATH:/usr/local/bin
-export PATH
-CGAL_TESTER="cgaltester"
-CGAL_TESTER_NAME="magritte (GF)"
-CGAL_TESTER_ADDRESS=sebastien.loriot@geometryfactory.com
-CGAL_ROOT=$HOME/cgal_test
-LOGS_DIR="${CGAL_ROOT}/AUTOTEST_LOGS"
-LOCK_FILE="${CGAL_ROOT}/autotest_cgal_with_cmake.lock"
-MYSHELL="/bin/sh -c"
-LC_ALL=C
-
-BUILD_HOSTS="localhost"
-PROCESSORS_localhost=3
-
-LOGS_DIR="${CGAL_ROOT}/AUTOTEST_LOGS"
-LOCK_FILE="${CGAL_ROOT}/autotest_cgal_with_cmake.lock"
-
-#COMPILERS_localhost="x86-64_Darwin-13.0_clang-3.2_isan-Release x86-64_Darwin-13.0_Apple_clang-3.2-Debug x86-64_Darwin-13.0_Apple_clang-3.2-Release"
-#  Laurent Rineau, 2013/03/05: remove the "isan" version
-#COMPILERS_localhost="x86-64_Darwin-13.0_Apple_clang-3.2-Debug x86-64_Darwin-13.0_Apple_clang-3.2-Release"
-#  Laurent Rineau, 2013/04/08: rename the platforms, and add llvm-gcc-4.2
-#COMPILERS_localhost="x86-64_Darwin-13.0_Apple-clang-3.2_Debug x86-64_Darwin-13.0_Apple-clang-3.2_Release x86-64_Darwin-13.0_Apple-llvm-gcc-4.2_Release"
-#  Laurent Rineau, 2013/05/21: add clang-3.2-cpp11 
-
-
-#  Laurent Rineau, 2015/08/20. Only one compiler, after upgrade to Yosemit
-COMPILERS_localhost=""
-COMPILERS_localhost="${COMPILERS_localhost} x86-64_Darwin-13.0_Apple-clang-5.0_Release"
-COMPILERS_localhost="${COMPILERS_localhost} x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11"
-COMPILERS_localhost="${COMPILERS_localhost} x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP"
-BUILD_ON_localhost=all
-
-REFERENCE_PLATFORMS_DIR=$CGAL_ROOT/reference_platforms
-USE_REFERENCE_PLATFORMS=yes
-
-UPLOAD_RESULT_DESTINATION="cgaltest@cgaltest.geometryfactory.com:incoming"
-
-EIGEN3_DIR=/Users/cgaltester/eigen-hg-git
-export EIGEN3_DIR
-
-ULIMIT_OPTIONS="-v 5000000 -c 0 -t 3600"
-export ULIMIT_OPTIONS
diff --git a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/common_setup b/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/common_setup
deleted file mode 100644
index f2c075cd2fe8..000000000000
--- a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/common_setup
+++ /dev/null
@@ -1,11 +0,0 @@
-Qt5_DIR=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5
-export Qt5_DIR
-QGLVIEWERROOT=/Users/cgaltester/libQGLViewer-2.6.3/QGLViewer
-export QGLVIEWERROOT
-
-DYLD_FRAMEWORK_PATH=$QGLVIEWERROOT:$DYLD_FRAMEWORK_PATH
-export DYLD_FRAMEWORK_PATH
-
-#DYLD_FALLBACK_FRAMEWORK_PATH=$QGLVIEWERROOT:$DYLD_FALLBACK_FRAMEWORK_PATH
-#export DYLD_FALLBACK_FRAMEWORK_PATH
-
diff --git a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11/CMakeCache.txt b/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11/CMakeCache.txt
deleted file mode 100644
index e72ea176daae..000000000000
--- a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11/CMakeCache.txt
+++ /dev/null
@@ -1,742 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11
-# It was generated by CMake: /usr/local/Cellar/cmake/3.3.1/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build the doxygen documentation
-BUILD_DOC:BOOL=OFF
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/Users/cgaltester/boost_1_60_0
-
-//Boost library directory DEBUG
-Boost_LIBRARY_DIR_DEBUG:PATH=/Users/cgaltester/boost_1_60_0/stage/lib
-
-//Boost library directory RELEASE
-Boost_LIBRARY_DIR_RELEASE:PATH=/Users/cgaltester/boost_1_60_0/stage/lib
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/local/lib/libmpfr.dylib;general;/usr/local/lib/libgmp.dylib;general;CGAL;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib;
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-4.8-I-108
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;CGAL;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib;general;/System/Library/Frameworks/AGL.framework;general;/System/Library/Frameworks/OpenGL.framework;general;/usr/lib/libz.dylib;
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib;
-
-//Dependencies for the target
-CGAL_Qt5_LIB_DEPENDS:STATIC=general;Qt5::OpenGL;general;Qt5::Svg;general;CGAL;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib;general;/System/Library/Frameworks/AGL.framework;general;/System/Library/Frameworks/OpenGL.framework;
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/Users/cgaltester/cgal_test/CGAL-4.8-I
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler
-CMAKE_CXX_COMPILER:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/clang++
-
-//Flags used by the compiler during all build types.
-CMAKE_CXX_FLAGS:STRING=-Wall -Wextra -Wno-deprecated-register -std=c++11 -stdlib=libc++ -pipe -isystem /Users/cgaltester/boost_1_60_0
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release builds for minimum
-// size.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os
-
-//Flags used by the compiler during release builds.
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during release builds with debug info.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler
-CMAKE_C_COMPILER:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/clang
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release builds for minimum
-// size.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os
-
-//Flags used by the compiler during release builds.
-CMAKE_C_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during release builds with debug info.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Path to a program.
-CMAKE_INSTALL_NAME_TOOL:FILEPATH=/usr/bin/install_name_tool
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/make
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=CMAKE_OBJCOPY-NOTFOUND
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=CMAKE_OBJDUMP-NOTFOUND
-
-//Build architectures for OSX
-CMAKE_OSX_ARCHITECTURES:STRING=
-
-//Minimum OS X version to target for deployment (at runtime); newer
-// APIs weak linked. Set to empty string for default value.
-CMAKE_OSX_DEPLOYMENT_TARGET:STRING=
-
-//The product will be built against the headers and libraries located
-// inside the indicated SDK.
-CMAKE_OSX_SYSROOT:STRING=
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/ranlib
-
-//User-defined flags
-CMAKE_SHARED_LINKER_FLAGS:STRING= -Wl,-dylib_file,/System/Library/Frameworks/OpenGL.framework/Versions/A/Libraries/libGL.dylib:/System/Library/Frameworks/OpenGL.framework/Versions/A/Libraries/libGL.dylib
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//Value Computed by CMake
-Documentation_BINARY_DIR:STATIC=/Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11/doc
-
-//Value Computed by CMake
-Documentation_SOURCE_DIR:STATIC=/Users/cgaltester/cgal_test/CGAL-4.8-I/doc
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/local/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/local/lib/libgmp.dylib
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/local/lib
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/local/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/local/lib/libmpfr.dylib
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/local/lib
-
-//Include for OpenGL on OSX
-OPENGL_INCLUDE_DIR:PATH=/System/Library/Frameworks/OpenGL.framework
-
-//OpenGL lib for OSX
-OPENGL_gl_LIBRARY:FILEPATH=/System/Library/Frameworks/OpenGL.framework
-
-//AGL lib for OSX
-OPENGL_glu_LIBRARY:FILEPATH=/System/Library/Frameworks/AGL.framework
-
-//The directory containing a CMake configuration file for Qt5Core.
-Qt5Core_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Core
-
-//The directory containing a CMake configuration file for Qt5Gui.
-Qt5Gui_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Gui
-
-//The directory containing a CMake configuration file for Qt5OpenGL.
-Qt5OpenGL_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5OpenGL
-
-//The directory containing a CMake configuration file for Qt5Svg.
-Qt5Svg_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Svg
-
-//The directory containing a CMake configuration file for Qt5Widgets.
-Qt5Widgets_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Widgets
-
-//The directory containing a CMake configuration file for Qt5.
-Qt5_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt5
-WITH_CGAL_Qt5:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=OFF
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=OFF
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=OFF
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.dylib
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_DEBUG
-Boost_LIBRARY_DIR_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_RELEASE
-Boost_LIBRARY_DIR_RELEASE-ADVANCED:INTERNAL=1
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/Users/cgaltester/boost_1_60_0
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-//Test CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_DENORMALS_COMPILE_BUG
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_IEEE_754_BUG
-CGAL_CFG_IEEE_754_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_5
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_6
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_7
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_8
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=FALSE
-//Test CGAL_CFG_NO_LIMITS
-CGAL_CFG_NO_LIMITS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_NEXTAFTER
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_STL
-CGAL_CFG_NO_STL:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NUMERIC_LIMITS_BUG
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_USING_BASE_MEMBER_BUG_2
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt5
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Core_LIBRARY:INTERNAL=
-CGAL_DISABLE_GMP:INTERNAL=ON
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/System/Library/Frameworks/OpenGL.framework;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/System/Library/Frameworks/AGL.framework;/System/Library/Frameworks/OpenGL.framework;/usr/lib/libz.dylib
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_ImageIO_LIBRARY:INTERNAL=
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-CGAL_Qt5_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/System/Library/Frameworks/OpenGL.framework
-CGAL_Qt5_3RD_PARTY_LIBRARIES:INTERNAL=/System/Library/Frameworks/AGL.framework;/System/Library/Frameworks/OpenGL.framework
-CGAL_Qt5_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Qt5_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=3
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=Unknown
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of external makefile project generator.
-CMAKE_EXTRA_GENERATOR:INTERNAL=
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator platform.
-CMAKE_GENERATOR_PLATFORM:INTERNAL=
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Source directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-//ADVANCED property for variable: CMAKE_INSTALL_NAME_TOOL
-CMAKE_INSTALL_NAME_TOOL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=6
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/local/Cellar/cmake/3.3.1/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/usr/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding GMP
-FIND_PACKAGE_MESSAGE_DETAILS_GMP:INTERNAL=[/usr/local/lib/libgmp.dylib][/usr/local/include][v()]
-//Details about finding MPFR
-FIND_PACKAGE_MESSAGE_DETAILS_MPFR:INTERNAL=[/usr/local/lib/libmpfr.dylib][/usr/local/include][v()]
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/System/Library/Frameworks/OpenGL.framework][/System/Library/Frameworks/OpenGL.framework][v()]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/libz.dylib][/usr/include][v1.2.5()]
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/Users/cgaltester/boost_1_60_0
-//Last used Boost_LIBRARY_DIR_DEBUG value.
-_Boost_LIBRARY_DIR_DEBUG_LAST:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib
-//Last used Boost_LIBRARY_DIR_RELEASE value.
-_Boost_LIBRARY_DIR_RELEASE_LAST:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib
-//Last used Boost_NAMESPACE value.
-_Boost_NAMESPACE_LAST:INTERNAL=boost
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11/setup b/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11/setup
deleted file mode 100644
index 0c4ce4680614..000000000000
--- a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release-cpp11/setup
+++ /dev/null
@@ -1,11 +0,0 @@
-CXX=/Library/Developer/CommandLineTools/usr/bin/clang++
-CC=/Library/Developer/CommandLineTools/usr/bin/clang
-
-BOOST_LIBRARYDIR=/Users/cgaltester/boost_1_60_0/stage/lib
-BOOST_INCLUDEDIR=/Users/cgaltester/boost_1_60_0
-DYLD_LIBRARY_PATH=$BOOST_LIBRARYDIR:$DYLD_LIBRARY_PATH
-export BOOST_LIBRARYDIR BOOST_INCLUDEDIR DYLD_LIBRARY_PATH
-
-CXXFLAGS="-Wall -Wextra -Wno-deprecated-register -std=c++11 -stdlib=libc++ -pipe -isystem $BOOST_INCLUDEDIR"
-export CXX CC CXXFLAGS
-source /Users/cgaltester/cgal_test/reference_platforms/common_setup
diff --git a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release/CMakeCache.txt b/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release/CMakeCache.txt
deleted file mode 100644
index 02c3d3c4d0ac..000000000000
--- a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release/CMakeCache.txt
+++ /dev/null
@@ -1,742 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release
-# It was generated by CMake: /usr/local/Cellar/cmake/3.3.1/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build the doxygen documentation
-BUILD_DOC:BOOL=OFF
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/Users/cgaltester/boost_1_60_0
-
-//Boost library directory DEBUG
-Boost_LIBRARY_DIR_DEBUG:PATH=/Users/cgaltester/boost_1_60_0/stage/lib
-
-//Boost library directory RELEASE
-Boost_LIBRARY_DIR_RELEASE:PATH=/Users/cgaltester/boost_1_60_0/stage/lib
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/local/lib/libmpfr.dylib;general;/usr/local/lib/libgmp.dylib;general;CGAL;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib;
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-4.8-I-108
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;CGAL;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib;general;/System/Library/Frameworks/AGL.framework;general;/System/Library/Frameworks/OpenGL.framework;general;/usr/lib/libz.dylib;
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib;
-
-//Dependencies for the target
-CGAL_Qt5_LIB_DEPENDS:STATIC=general;Qt5::OpenGL;general;Qt5::Svg;general;CGAL;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib;general;/System/Library/Frameworks/AGL.framework;general;/System/Library/Frameworks/OpenGL.framework;
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/Users/cgaltester/cgal_test/CGAL-4.8-I
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler
-CMAKE_CXX_COMPILER:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/clang++
-
-//Flags used by the compiler during all build types.
-CMAKE_CXX_FLAGS:STRING='-Wall -Wextra -isystem /Users/cgaltester/boost_1_60_0 '
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release builds for minimum
-// size.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os
-
-//Flags used by the compiler during release builds.
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during release builds with debug info.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler
-CMAKE_C_COMPILER:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/clang
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release builds for minimum
-// size.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os
-
-//Flags used by the compiler during release builds.
-CMAKE_C_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during release builds with debug info.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Path to a program.
-CMAKE_INSTALL_NAME_TOOL:FILEPATH=/usr/bin/install_name_tool
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/make
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=CMAKE_OBJCOPY-NOTFOUND
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=CMAKE_OBJDUMP-NOTFOUND
-
-//Build architectures for OSX
-CMAKE_OSX_ARCHITECTURES:STRING=
-
-//Minimum OS X version to target for deployment (at runtime); newer
-// APIs weak linked. Set to empty string for default value.
-CMAKE_OSX_DEPLOYMENT_TARGET:STRING=
-
-//The product will be built against the headers and libraries located
-// inside the indicated SDK.
-CMAKE_OSX_SYSROOT:STRING=
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/ranlib
-
-//User-defined flags
-CMAKE_SHARED_LINKER_FLAGS:STRING= -Wl,-dylib_file,/System/Library/Frameworks/OpenGL.framework/Versions/A/Libraries/libGL.dylib:/System/Library/Frameworks/OpenGL.framework/Versions/A/Libraries/libGL.dylib
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//Value Computed by CMake
-Documentation_BINARY_DIR:STATIC=/Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release/doc
-
-//Value Computed by CMake
-Documentation_SOURCE_DIR:STATIC=/Users/cgaltester/cgal_test/CGAL-4.8-I/doc
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/local/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/local/lib/libgmp.dylib
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/local/lib
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/local/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/local/lib/libmpfr.dylib
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/local/lib
-
-//Include for OpenGL on OSX
-OPENGL_INCLUDE_DIR:PATH=/System/Library/Frameworks/OpenGL.framework
-
-//OpenGL lib for OSX
-OPENGL_gl_LIBRARY:FILEPATH=/System/Library/Frameworks/OpenGL.framework
-
-//AGL lib for OSX
-OPENGL_glu_LIBRARY:FILEPATH=/System/Library/Frameworks/AGL.framework
-
-//The directory containing a CMake configuration file for Qt5Core.
-Qt5Core_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Core
-
-//The directory containing a CMake configuration file for Qt5Gui.
-Qt5Gui_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Gui
-
-//The directory containing a CMake configuration file for Qt5OpenGL.
-Qt5OpenGL_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5OpenGL
-
-//The directory containing a CMake configuration file for Qt5Svg.
-Qt5Svg_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Svg
-
-//The directory containing a CMake configuration file for Qt5Widgets.
-Qt5Widgets_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Widgets
-
-//The directory containing a CMake configuration file for Qt5.
-Qt5_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt5
-WITH_CGAL_Qt5:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=OFF
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=OFF
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=OFF
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.dylib
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_DEBUG
-Boost_LIBRARY_DIR_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_RELEASE
-Boost_LIBRARY_DIR_RELEASE-ADVANCED:INTERNAL=1
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/Users/cgaltester/boost_1_60_0
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-//Test CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_DENORMALS_COMPILE_BUG
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_IEEE_754_BUG
-CGAL_CFG_IEEE_754_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_5
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_6
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_7
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_8
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=FALSE
-//Test CGAL_CFG_NO_LIMITS
-CGAL_CFG_NO_LIMITS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_NEXTAFTER
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_STL
-CGAL_CFG_NO_STL:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NUMERIC_LIMITS_BUG
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_USING_BASE_MEMBER_BUG_2
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt5
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Core_LIBRARY:INTERNAL=
-CGAL_DISABLE_GMP:INTERNAL=ON
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/System/Library/Frameworks/OpenGL.framework;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/System/Library/Frameworks/AGL.framework;/System/Library/Frameworks/OpenGL.framework;/usr/lib/libz.dylib
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_ImageIO_LIBRARY:INTERNAL=
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-CGAL_Qt5_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/System/Library/Frameworks/OpenGL.framework
-CGAL_Qt5_3RD_PARTY_LIBRARIES:INTERNAL=/System/Library/Frameworks/AGL.framework;/System/Library/Frameworks/OpenGL.framework
-CGAL_Qt5_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Qt5_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=3
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=Unknown
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of external makefile project generator.
-CMAKE_EXTRA_GENERATOR:INTERNAL=
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator platform.
-CMAKE_GENERATOR_PLATFORM:INTERNAL=
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Source directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-//ADVANCED property for variable: CMAKE_INSTALL_NAME_TOOL
-CMAKE_INSTALL_NAME_TOOL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=6
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/local/Cellar/cmake/3.3.1/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/usr/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding GMP
-FIND_PACKAGE_MESSAGE_DETAILS_GMP:INTERNAL=[/usr/local/lib/libgmp.dylib][/usr/local/include][v()]
-//Details about finding MPFR
-FIND_PACKAGE_MESSAGE_DETAILS_MPFR:INTERNAL=[/usr/local/lib/libmpfr.dylib][/usr/local/include][v()]
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/System/Library/Frameworks/OpenGL.framework][/System/Library/Frameworks/OpenGL.framework][v()]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/libz.dylib][/usr/include][v1.2.5()]
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/Users/cgaltester/boost_1_60_0
-//Last used Boost_LIBRARY_DIR_DEBUG value.
-_Boost_LIBRARY_DIR_DEBUG_LAST:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib
-//Last used Boost_LIBRARY_DIR_RELEASE value.
-_Boost_LIBRARY_DIR_RELEASE_LAST:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib
-//Last used Boost_NAMESPACE value.
-_Boost_NAMESPACE_LAST:INTERNAL=boost
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release/setup b/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release/setup
deleted file mode 100644
index dfd45ea12fe3..000000000000
--- a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.0_Release/setup
+++ /dev/null
@@ -1,11 +0,0 @@
-CXX=/Library/Developer/CommandLineTools/usr/bin/clang++
-CC=/Library/Developer/CommandLineTools/usr/bin/clang
-
-BOOST_LIBRARYDIR=/Users/cgaltester/boost_1_60_0/stage/lib
-BOOST_INCLUDEDIR=/Users/cgaltester/boost_1_60_0
-DYLD_LIBRARY_PATH=$BOOST_LIBRARYDIR:$DYLD_LIBRARY_PATH
-export BOOST_LIBRARYDIR BOOST_INCLUDEDIR DYLD_LIBRARY_PATH
-
-CXXFLAGS="-Wall -Wextra -isystem $BOOST_INCLUDEDIR"
-export CXX CC CXXFLAGS
-source /Users/cgaltester/cgal_test/reference_platforms/common_setup
diff --git a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP/CMakeCache.txt b/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP/CMakeCache.txt
deleted file mode 100644
index a881550c0d9b..000000000000
--- a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP/CMakeCache.txt
+++ /dev/null
@@ -1,733 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP
-# It was generated by CMake: /usr/local/Cellar/cmake/3.3.1/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build the doxygen documentation
-BUILD_DOC:BOOL=OFF
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/Users/cgaltester/boost_1_60_0
-
-//Boost library directory DEBUG
-Boost_LIBRARY_DIR_DEBUG:PATH=/Users/cgaltester/boost_1_60_0/stage/lib
-
-//Boost library directory RELEASE
-Boost_LIBRARY_DIR_RELEASE:PATH=/Users/cgaltester/boost_1_60_0/stage/lib
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-4.8-I-108
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=optimized;/Users/cgaltester/LEDA/leda-numbers/libleda_numbers.dylib;debug;/Users/cgaltester/LEDA/leda-numbers/libleda_numbers.dylib;general;CGAL;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib;general;/System/Library/Frameworks/AGL.framework;general;/System/Library/Frameworks/OpenGL.framework;general;/usr/lib/libz.dylib;
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=optimized;/Users/cgaltester/LEDA/leda-numbers/libleda_numbers.dylib;debug;/Users/cgaltester/LEDA/leda-numbers/libleda_numbers.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib;
-
-//Dependencies for the target
-CGAL_Qt5_LIB_DEPENDS:STATIC=optimized;/Users/cgaltester/LEDA/leda-numbers/libleda_numbers.dylib;debug;/Users/cgaltester/LEDA/leda-numbers/libleda_numbers.dylib;general;Qt5::OpenGL;general;Qt5::Svg;general;CGAL;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;general;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib;general;/System/Library/Frameworks/AGL.framework;general;/System/Library/Frameworks/OpenGL.framework;
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/Users/cgaltester/cgal_test/CGAL-4.8-I
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler
-CMAKE_CXX_COMPILER:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/clang++
-
-//Flags used by the compiler during all build types.
-CMAKE_CXX_FLAGS:STRING='-Wall -Wextra -isystem /Users/cgaltester/boost_1_60_0 '
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release builds for minimum
-// size.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os
-
-//Flags used by the compiler during release builds.
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during release builds with debug info.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler
-CMAKE_C_COMPILER:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/clang
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release builds for minimum
-// size.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os
-
-//Flags used by the compiler during release builds.
-CMAKE_C_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during release builds with debug info.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Path to a program.
-CMAKE_INSTALL_NAME_TOOL:FILEPATH=/usr/bin/install_name_tool
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/make
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=CMAKE_OBJCOPY-NOTFOUND
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=CMAKE_OBJDUMP-NOTFOUND
-
-//Build architectures for OSX
-CMAKE_OSX_ARCHITECTURES:STRING=
-
-//Minimum OS X version to target for deployment (at runtime); newer
-// APIs weak linked. Set to empty string for default value.
-CMAKE_OSX_DEPLOYMENT_TARGET:STRING=
-
-//The product will be built against the headers and libraries located
-// inside the indicated SDK.
-CMAKE_OSX_SYSROOT:STRING=
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/ranlib
-
-//User-defined flags
-CMAKE_SHARED_LINKER_FLAGS:STRING= -Wl,-dylib_file,/System/Library/Frameworks/OpenGL.framework/Versions/A/Libraries/libGL.dylib:/System/Library/Frameworks/OpenGL.framework/Versions/A/Libraries/libGL.dylib
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/Library/Developer/CommandLineTools/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//Value Computed by CMake
-Documentation_BINARY_DIR:STATIC=/Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP/doc
-
-//Value Computed by CMake
-Documentation_SOURCE_DIR:STATIC=/Users/cgaltester/cgal_test/CGAL-4.8-I/doc
-
-//Compiler flags for the LEDA library
-LEDA_CXX_FLAGS:STRING=
-
-//Definitions for the LEDA library
-LEDA_DEFINITIONS:STRING=-DCGAL_LEDA_VERSION=640
-
-//The directory containing the LEDA header files WITHOUT the LEDA
-// prefix
-LEDA_INCLUDE_DIR:PATH=/Users/cgaltester/LEDA/leda-numbers/incl
-
-//The LEDA library
-LEDA_LIBRARIES:FILEPATH=optimized;/Users/cgaltester/LEDA/leda-numbers/libleda_numbers.dylib;debug;/Users/cgaltester/LEDA/leda-numbers/libleda_numbers.dylib
-
-//Path to the LEDA library
-LEDA_LIBRARY_DEBUG:FILEPATH=/Users/cgaltester/LEDA/leda-numbers/libleda_numbers.dylib
-
-//Path to the LEDA library
-LEDA_LIBRARY_RELEASE:FILEPATH=/Users/cgaltester/LEDA/leda-numbers/libleda_numbers.dylib
-
-//Linker flags for the LEDA library
-LEDA_LINKER_FLAGS:STRING=
-
-//Include for OpenGL on OSX
-OPENGL_INCLUDE_DIR:PATH=/System/Library/Frameworks/OpenGL.framework
-
-//OpenGL lib for OSX
-OPENGL_gl_LIBRARY:FILEPATH=/System/Library/Frameworks/OpenGL.framework
-
-//AGL lib for OSX
-OPENGL_glu_LIBRARY:FILEPATH=/System/Library/Frameworks/AGL.framework
-
-//The directory containing a CMake configuration file for Qt5Core.
-Qt5Core_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Core
-
-//The directory containing a CMake configuration file for Qt5Gui.
-Qt5Gui_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Gui
-
-//The directory containing a CMake configuration file for Qt5OpenGL.
-Qt5OpenGL_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5OpenGL
-
-//The directory containing a CMake configuration file for Qt5Svg.
-Qt5Svg_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Svg
-
-//The directory containing a CMake configuration file for Qt5Widgets.
-Qt5Widgets_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5Widgets
-
-//The directory containing a CMake configuration file for Qt5.
-Qt5_DIR:PATH=/Users/cgaltester/Qt/5.5/clang_64/lib/cmake/Qt5
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt5
-WITH_CGAL_Qt5:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=OFF
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=OFF
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=ON
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=OFF
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.dylib
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_DEBUG
-Boost_LIBRARY_DIR_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_RELEASE
-Boost_LIBRARY_DIR_RELEASE-ADVANCED:INTERNAL=1
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/Users/cgaltester/boost_1_60_0
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib/libboost_thread.dylib;/Users/cgaltester/boost_1_60_0/stage/lib/libboost_system.dylib
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-//Test CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_DENORMALS_COMPILE_BUG
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_IEEE_754_BUG
-CGAL_CFG_IEEE_754_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_5
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_6
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_7
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_8
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=FALSE
-//Test CGAL_CFG_NO_LIMITS
-CGAL_CFG_NO_LIMITS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_NEXTAFTER
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_STL
-CGAL_CFG_NO_STL:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NUMERIC_LIMITS_BUG
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_USING_BASE_MEMBER_BUG_2
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt5
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Core_LIBRARY:INTERNAL=
-CGAL_DISABLE_GMP:INTERNAL=ON
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/System/Library/Frameworks/OpenGL.framework;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/System/Library/Frameworks/AGL.framework;/System/Library/Frameworks/OpenGL.framework;/usr/lib/libz.dylib
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_ImageIO_LIBRARY:INTERNAL=
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-CGAL_Qt5_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/System/Library/Frameworks/OpenGL.framework
-CGAL_Qt5_3RD_PARTY_LIBRARIES:INTERNAL=/System/Library/Frameworks/AGL.framework;/System/Library/Frameworks/OpenGL.framework
-CGAL_Qt5_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Qt5_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/Users/cgaltester/cgal_test/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=3
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/local/Cellar/cmake/3.3.1/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=Unknown
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of external makefile project generator.
-CMAKE_EXTRA_GENERATOR:INTERNAL=
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator platform.
-CMAKE_GENERATOR_PLATFORM:INTERNAL=
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Source directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/Users/cgaltester/cgal_test/CGAL-4.8-I
-//ADVANCED property for variable: CMAKE_INSTALL_NAME_TOOL
-CMAKE_INSTALL_NAME_TOOL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=6
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/local/Cellar/cmake/3.3.1/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/usr/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/System/Library/Frameworks/OpenGL.framework][/System/Library/Frameworks/OpenGL.framework][v()]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/libz.dylib][/usr/include][v1.2.5()]
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/Users/cgaltester/boost_1_60_0
-//Last used Boost_LIBRARY_DIR_DEBUG value.
-_Boost_LIBRARY_DIR_DEBUG_LAST:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib
-//Last used Boost_LIBRARY_DIR_RELEASE value.
-_Boost_LIBRARY_DIR_RELEASE_LAST:INTERNAL=/Users/cgaltester/boost_1_60_0/stage/lib
-//Last used Boost_NAMESPACE value.
-_Boost_NAMESPACE_LAST:INTERNAL=boost
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP/setup b/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP/setup
deleted file mode 100644
index f869d2266fb7..000000000000
--- a/Maintenance/infrastructure/magritte.geometryfactory.com/reference_platforms/x86-64_Darwin-13.0_Apple-clang-5.1_Release-LEDA-without-GMP/setup
+++ /dev/null
@@ -1,19 +0,0 @@
-CXX=/Library/Developer/CommandLineTools/usr/bin/clang++
-CC=/Library/Developer/CommandLineTools/usr/bin/clang
-
-BOOST_LIBRARYDIR=/Users/cgaltester/boost_1_60_0/stage/lib
-BOOST_INCLUDEDIR=/Users/cgaltester/boost_1_60_0
-DYLD_LIBRARY_PATH=$BOOST_LIBRARYDIR:$DYLD_LIBRARY_PATH
-export BOOST_LIBRARYDIR BOOST_INCLUDEDIR DYLD_LIBRARY_PATH
-
-CXXFLAGS="-Wall -Wextra -isystem $BOOST_INCLUDEDIR"
-export CXX CC CXXFLAGS
-
-LEDA_DIR=/Users/cgaltester/LEDA/leda-numbers
-LEDA_LIBRARY_RELEASE=$LEDA_DIR/libleda_numbers.dylib
-DYLD_LIBRARY_PATH=$LEDA_DIR:$DYLD_LIBRARY_PATH
-export LEDA_DIR LEDA_LIBRARY_RELEASE
-
-CGAL_DISABLE_GMP=1
-export CGAL_DISABLE_GMP
-source /Users/cgaltester/cgal_test/reference_platforms/common_setup
diff --git a/Maintenance/infrastructure/magritte.geometryfactory.com/update.sh b/Maintenance/infrastructure/magritte.geometryfactory.com/update.sh
deleted file mode 100755
index b43be434f02b..000000000000
--- a/Maintenance/infrastructure/magritte.geometryfactory.com/update.sh
+++ /dev/null
@@ -1,4 +0,0 @@
-#! /bin/sh
-
-rsync -av --chmod=u+rwX cgaltester@magritte:.autocgalrc autocgalrc
-rsync -Cvr --chmod=u+rwX --exclude include --exclude Makefile --exclude \*.cmake --exclude bin --exclude lib --exclude config --exclude CMakeFiles --exclude src cgaltester@magritte:cgal_test/reference_platforms .
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/.autocgalrc b/Maintenance/infrastructure/renoir.geometryfactory.com/.autocgalrc
deleted file mode 100644
index 9fafecb32d76..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/.autocgalrc
+++ /dev/null
@@ -1,43 +0,0 @@
-# -*- mode: shell-script -*-
-
-CGAL_TESTER="lrineau"
-CGAL_TESTER_NAME="renoir (GF)"
-CGAL_TESTER_ADDRESS=Laurent.Rineau__cgal_testsuite@normalesup.org
-MYSHELL="/bin/sh -c"
-LC_ALL=C
-
-BUILD_HOSTS="localhost"
-
-PROCESSORS_localhost=7
-
-CGAL_ROOT=/no-raid$HOME/CGAL
-LOGS_DIR="${CGAL_ROOT}/AUTOTEST_LOGS"
-LOCK_FILE="${CGAL_ROOT}/autotest_cgal_with_cmake.lock"
-
-COMPILERS_localhost=
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora19_g++-4.8"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora19_g++-4.8_Release"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora19_g++-4.5-branch_Release"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora19_g++-4.8_CXX0X"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora19_g++-4.8_ansi"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora19_g++-4.8_m32"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora_IntelCompiler-17"
-#COMPILERS_localhost="$COMPILERS_localhost x86-64_Linux-Fedora_IntelCompiler-17-with-assertions"
-
-BUILD_ON_localhost=all
-
-REFERENCE_PLATFORMS_DIR=$HOME/infrastructure/reference-platforms
-
-USE_REFERENCE_PLATFORMS=yes
-
-ULIMIT_OPTIONS="-v 5000000 -c 0 -t 3600"
-export ULIMIT_OPTIONS
-
-NICE_OPTIONS="-15"
-
-UPLOAD_RESULT_DESTINATION="cgaltest@cgaltest.geometryfactory.com:incoming"
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/boost/README.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/boost/README.txt
deleted file mode 100644
index b84e9664d2a0..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/boost/README.txt
+++ /dev/null
@@ -1,16 +0,0 @@
-user-config.jam
-        Copy to tools/build/v2/
-
-compile-boost
-        Shell script to launch the compilation of Boost libraries with
-        several configurations (different ABI).
-
-
-The configurations are:
-  - in stage/ for all g++ compilers with default options, gcc>=4.5,
-  - in stage-intel/ for the Intel compilers,
-  - in stage-cxxdebug/ for the g++ compilers with the STL debug mode
-    (different ABI), for gcc>=4.6.
-
-In addition, there is a configuration in stage-4.1/ for the g++-4.1
-compiler (the one used on the Linux distribution RHEL 5).
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/boost/compile-boost b/Maintenance/infrastructure/renoir.geometryfactory.com/boost/compile-boost
deleted file mode 100644
index b3c205d3a4cf..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/boost/compile-boost
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/bin/sh
-
-set -e
-BOOST_DIR=$HOME/CGAL/boost
-VERSION=1_55
-
-OPTS="-j4 --layout=tagged link=shared variant=release threading=multi"
-OPTS="$OPTS --without-python --without-test --without-mpi --without-wave --without-graph_parallel"
-
-if [ -x ./b2 ]; then
-    BJAM=./b2
-else
-    BJAM=./bjam
-fi
-if [ ! -x $BJAM ]; then
-    BJAM=bjam
-fi
-
-# "$BJAM" --prefix="$BOOST_DIR/${VERSION}" --libdir="$BOOST_DIR/${VERSION}-gcc41/lib" --stagedir=stage-4.1 $OPTS --without-log toolset=gcc-4.1 install
-# ln -sf ../${VERSION}/include "$BOOST_DIR/${VERSION}-gcc41/"
-
-# "$BJAM" --prefix="$BOOST_DIR/${VERSION}" $OPTS toolset=gcc-4.5.4 install
-
-"$BJAM" --prefix="$BOOST_DIR/${VERSION}" --libdir="$BOOST_DIR/${VERSION}-gcc-cxxdebug/lib" --stagedir=stage-cxxdebug $OPTS toolset=gcc-cxxdebug install
-ln -sf ../${VERSION}/include "$BOOST_DIR/${VERSION}-gcc-cxxdebug/"
-
-source ~/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/setup
-"$BJAM" --prefix="$BOOST_DIR/${VERSION}" --libdir="$BOOST_DIR/${VERSION}-intel/lib" --stagedir=stage-intel $OPTS toolset=intel cxxflags="-D__SIZEOF_LONG__=8 -D__SIZEOF_LONG_LONG__=8" install
-ln -sf ../${VERSION}/include "$BOOST_DIR/${VERSION}-intel/"
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/boost/user-config.jam b/Maintenance/infrastructure/renoir.geometryfactory.com/boost/user-config.jam
deleted file mode 100644
index d8710f65402e..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/boost/user-config.jam
+++ /dev/null
@@ -1,106 +0,0 @@
-# Copyright 2003, 2005 Douglas Gregor
-# Copyright 2004 John Maddock
-# Copyright 2002, 2003, 2004, 2007 Vladimir Prus
-# Distributed under the Boost Software License, Version 1.0.
-# (See accompanying file LICENSE_1_0.txt or https://www.boost.org/LICENSE_1_0.txt)
-
-#   This file is used to configure your Boost.Build installation. You can modify
-# this file in place, or you can place it in a permanent location so that it
-# does not get overwritten should you get a new version of Boost.Build. See:
-#
-#   https://www.boost.org/build/doc/html/bbv2/overview/configuration.html
-#
-# for documentation about possible permanent locations.
-
-#   This file specifies which toolsets (C++ compilers), libraries, and other
-# tools are available. Often, you should be able to just uncomment existing
-# example lines and adjust them to taste. The complete list of supported tools,
-# and configuration instructions can be found at:
-#
-#   https://www.boost.org/build/doc/html/bbv2/reference/tools.html
-#
-
-#   This file uses Jam language syntax to describe available tools. Mostly,
-# there are 'using' lines, that contain the name of the used tools, and
-# parameters to pass to those tools -- where parameters are separated by
-# semicolons. Important syntax notes:
-#
-#   - Both ':' and ';' must be separated from other tokens by whitespace
-#   - The '\' symbol is a quote character, so when specifying Windows paths you
-#     should use '/' or '\\' instead.
-#
-# More details about the syntax can be found at:
-#
-#   https://www.boost.org/build/doc/html/jam/language.html
-#
-
-# ------------------
-# GCC configuration.
-# ------------------
-
-# Configure gcc (default version).
-# using gcc ;
-
-# Configure specific gcc version, giving alternative name to use.
-# using gcc : 3.2 : g++-3.2 ;
-
-# G++ 4.5
-using gcc : : /usr/local/packages/gcc-4.5/bin/g++ ;
-
-# -------------------
-# MSVC configuration.
-# -------------------
-
-# Configure msvc (default version, searched for in standard locations and PATH).
-# using msvc ;
-
-# Configure specific msvc version (searched for in standard locations and PATH).
-# using msvc : 8.0 ;
-
-
-# ----------------------
-# Borland configuration.
-# ----------------------
-# using borland ;
-
-
-# ----------------------
-# STLPort configuration.
-# ----------------------
-
-#   Configure specifying location of STLPort headers. Libraries must be either
-# not needed or available to the compiler by default.
-# using stlport : : /usr/include/stlport ;
-
-# Configure specifying location of both headers and libraries explicitly.
-# using stlport : : /usr/include/stlport /usr/lib ;
-
-
-# -----------------
-# QT configuration.
-# -----------------
-
-# Configure assuming QTDIR gives the installation prefix.
-# using qt ;
-
-# Configure with an explicit installation prefix.
-# using qt : /usr/opt/qt ;
-
-# ---------------------
-# Python configuration.
-# ---------------------
-
-# Configure specific Python version.
-# using python : 3.1 : /usr/bin/python3 : /usr/include/python3.1 : /usr/lib ;
-
-using gcc
-   : cxxdebug
-   : "/usr/lib64/ccache/g++" # your path to the C++ compiler
-   : <cxxflags>-D_GLIBCXX_DEBUG
-   ;
-
-using gcc
-   : 4.1
-   : "/usr/local/bin/g++41"
-   : <cxxflags>
-   ;
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-common b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-common
deleted file mode 100644
index 72e1d9fac341..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-common
+++ /dev/null
@@ -1,7 +0,0 @@
-#source /home/lrineau/infrastructure/reference-platforms/setup-taucs-64bits
-
-source /home/lrineau/infrastructure/reference-platforms/setup-mkl-64bits
-
-source /home/lrineau/CGAL/MPFI-RS/setup-rs
-
-source /home/lrineau/infrastructure/reference-platforms/setup-common-headers-only
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-common-headers-only b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-common-headers-only
deleted file mode 100644
index 15152d4a292f..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-common-headers-only
+++ /dev/null
@@ -1,5 +0,0 @@
-ESBTL_INC_DIR=/home/lrineau/Git/esbtl/trunk/include
-export ESBTL_INC_DIR
-
-EIGEN3_INC_DIR=/home/lrineau/CGAL/eigen3
-export EIGEN3_INC_DIR
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-mkl-64bits b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-mkl-64bits
deleted file mode 100644
index d1fb00e2032f..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-mkl-64bits
+++ /dev/null
@@ -1,11 +0,0 @@
-if [ -z "$MKLROOT" ]; then
-  MKLROOT=/opt/intel/Compiler/11.1/059/mkl
-fi
-
-if [ -n "$MKLROOT" ]; then
-  MKL_LIB_DIR=$MKLROOT/lib/em64t
-  INTEL_RTL_LIB_DIR=$MKLROOT/../lib/intel64
-  MKL_INC_DIR=$MKLROOT/include
-  export MKL_LIB_DIR MKL_INC_DIR
-  export INTEL_RTL_LIB_DIR
-fi
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-taucs-64bits b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-taucs-64bits
deleted file mode 100644
index 86fdf793246a..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/setup-taucs-64bits
+++ /dev/null
@@ -1,3 +0,0 @@
-TAUCS_LIB_DIR=/home/lrineau/CGAL/taucs_full/install/lib64
-TAUCS_INC_DIR=/home/lrineau/CGAL/taucs_full/install/include
-export TAUCS_INC_DIR TAUCS_LIB_DIR
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/CMakeCache.txt
deleted file mode 100644
index f13ca9f82e0f..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/CMakeCache.txt
+++ /dev/null
@@ -1,2127 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/home/lrineau/CGAL/boost/boost-release-branch
-
-//Boost library directory
-Boost_LIBRARY_DIR:PATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -fp-model strict
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so;
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-4.4-Ic-13
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;/usr/lib64/libz.so;
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so;
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/opt/intel/composer_xe_2013_sp1/bin/icpc
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-w1  -fp-model strict -diag-disable 1017
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/opt/intel/composer_xe_2013_sp1/bin/icc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING='-O3 '
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=OFF
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease-qt4
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate-qt4
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can the qmake-qt4 library be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=QT_QWEBVIEW_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic-qt4
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=OFF
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=X11_XRes_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=X11_Xdmcp_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=X11_Xdmcp_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=/usr/lib64/libxkbfile.so
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=/usr/lib64/libXmu.so
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=/usr/lib64/libXxf86vm.so
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a program.
-XIAR:FILEPATH=/opt/intel/composer_xe_2013_sp1/bin/xiar
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR
-Boost_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE;TAUCS
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=12
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include pthread.h
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/usr/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL=-w1  -fp-model strict -diag-disable 1017
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding GMP
-FIND_PACKAGE_MESSAGE_DETAILS_GMP:INTERNAL=[/usr/lib64/libgmp.so][/usr/include][v()]
-//Details about finding MPFR
-FIND_PACKAGE_MESSAGE_DETAILS_MPFR:INTERNAL=[/usr/lib64/libmpfr.so][/usr/include][v()]
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-IntelCompiler_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-IntelCompiler_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: XIAR
-XIAR-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch
-//Last used Boost_LIBRARY_DIR value.
-_Boost_LIBRARY_DIR_LAST:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/setup
deleted file mode 100644
index 1664da6eab1d..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL/setup
+++ /dev/null
@@ -1,14 +0,0 @@
-source /opt/intel/composer_xe_2013_sp1/bin/compilervars.sh intel64
-CXX=icpc
-CC=icc
-CXXFLAGS="-w1"
-export CXX CC CXXFLAGS
-export QTDIR=/usr/lib64/qt-3.3
-source /home/lrineau/infrastructure/reference-platforms/setup-common
-
-BOOST_INCLUDEDIR=/home/lrineau/CGAL/boost/boost-release-branch
-BOOST_LIBRARYDIR=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib
-export BOOST_INCLUDEDIR BOOST_LIBRARYDIR
-
-#CXXFLAGS="-I$BOOST_INCLUDEDIR/include $CXXFLAGS"
-export CXXFLAGS
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/CMakeCache.txt
deleted file mode 100644
index 23fd5581d197..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/CMakeCache.txt
+++ /dev/null
@@ -1,2127 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/home/lrineau/CGAL/boost/boost-release-branch
-
-//Boost library directory
-Boost_LIBRARY_DIR:PATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -fp-model strict
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so;
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-4.4-Ic-13
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;/usr/lib64/libz.so;
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so;
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/opt/intel/composer_xe_2013_sp1/bin/icpc
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-strict-ansi -w1 -fp-model strict -diag-disable 11 -diag-disable 1017
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/opt/intel/composer_xe_2013_sp1/bin/icc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=OFF
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease-qt4
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate-qt4
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can the qmake-qt4 library be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=QT_QWEBVIEW_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic-qt4
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=OFF
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=X11_XRes_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=X11_Xdmcp_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=X11_Xdmcp_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=/usr/lib64/libxkbfile.so
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=/usr/lib64/libXmu.so
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=/usr/lib64/libXxf86vm.so
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a program.
-XIAR:FILEPATH=/opt/intel/composer_xe_2013_sp1.1.106/bin/intel64/xiar
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR
-Boost_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_thread-mt.so;/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib/libboost_system-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE;TAUCS
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=12
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include pthread.h
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/usr/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL=-strict-ansi -w1 -fp-model strict -diag-disable 11 -diag-disable 1017
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding GMP
-FIND_PACKAGE_MESSAGE_DETAILS_GMP:INTERNAL=[/usr/lib64/libgmp.so][/usr/include][v()]
-//Details about finding MPFR
-FIND_PACKAGE_MESSAGE_DETAILS_MPFR:INTERNAL=[/usr/lib64/libmpfr.so][/usr/include][v()]
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-IntelCompiler_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-IntelCompiler_RUN_RES:INTERNAL=0
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: XIAR
-XIAR-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch
-//Last used Boost_LIBRARY_DIR value.
-_Boost_LIBRARY_DIR_LAST:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/setup
deleted file mode 100644
index c1a3e56bf1df..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_IntelCompiler-14.0-with-g++-4.8-STL_strict-ansi/setup
+++ /dev/null
@@ -1,14 +0,0 @@
-source /opt/intel/composer_xe_2013_sp1/bin/compilervars.sh intel64
-CXX=icpc
-CC=icc
-CXXFLAGS="-strict-ansi -w1 -diag-disable 11"
-export CXX CC CXXFLAGS
-export QTDIR=/usr/lib64/qt-3.3
-source /home/lrineau/infrastructure/reference-platforms/setup-common
-
-BOOST_INCLUDEDIR=/home/lrineau/CGAL/boost/boost-release-branch
-BOOST_LIBRARYDIR=/home/lrineau/CGAL/boost/boost-release-branch/stage-intel/lib
-export BOOST_INCLUDEDIR BOOST_LIBRARYDIR
-
-#CXXFLAGS="-I$BOOST_INCLUDEDIR/include $CXXFLAGS"
-export CXXFLAGS
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/CMakeCache.txt
deleted file mode 100644
index cb8d269af3ca..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/CMakeCache.txt
+++ /dev/null
@@ -1,2376 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//The directory containing a CMake configuration file for Boost.
-Boost_DIR:PATH=Boost_DIR-NOTFOUND
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/home/lrineau/CGAL/boost/1.44-beta1/include
-
-//Boost library directory
-Boost_LIBRARY_DIRS:FILEPATH=/home/lrineau/CGAL/boost/1.44-beta1/lib
-
-//The Boost SYSTEM library
-Boost_SYSTEM_LIBRARY:FILEPATH=/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_system-mt.so
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_system-mt.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_system-mt.so
-
-//The Boost THREAD library
-Boost_THREAD_LIBRARY:FILEPATH=/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_thread-mt.so
-
-//Path to a library.
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_thread-mt.so
-
-//Path to a library.
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_thread-mt.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//Directory containing the Maintenance package
-CGAL_CORE_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -std=c++0x -frounding-math
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/src/Core
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_system-mt.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-I-125
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/src/ImageIO
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_system-mt.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;/usr/lib64/libz.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALImageIO
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_system-mt.so;
-
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/src/Qt3
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_system-mt.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt3
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/src/Qt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_system-mt.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt4
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/local/packages/gcc-4.5/bin/g++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-std=c++0x -frounding-math
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/local/packages/gcc-4.5/bin/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib64/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-//Missing description
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-//Missing description
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib64/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a library.
-QT_DBUS_LIBRARY:FILEPATH=/lib64/libdbus-1.so
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib64/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib64/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/usr/lib64/libglib-2.0.so
-
-//Path to a library.
-QT_GOBJECT_LIBRARY:FILEPATH=/usr/lib64/libgobject-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/usr/lib64/libgthread-2.0.so
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease-qt4
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate-qt4
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib64/libpng.so
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib64/librt.so
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic-qt4
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib64/libm.so
-
-//Path to a library.
-QT_XCURSOR_LIBRARY:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a library.
-QT_XFIXES_LIBRARY:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a library.
-QT_XINERAMA_LIBRARY:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a library.
-QT_XI_LIBRARY:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a library.
-QT_XRANDR_LIBRARY:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib64/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=X11_Xi_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=X11_Xkbfile_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=X11_Xmu_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=X11_Xxf86vm_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIRS
-Boost_LIBRARY_DIRS-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_44
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY
-Boost_SYSTEM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY
-Boost_THREAD_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=104400
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/home/lrineau/CGAL/boost/1.44-beta1/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_thread-mt.so;/home/lrineau/CGAL/boost/1.44-beta1/lib/libboost_system-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/home/lrineau/CGAL/boost/1.44-beta1/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_COPY_N:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_COPY_N_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_NEXT_PREV:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_NEXT_PREV_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-//Variable hidden from user
-CGAL_CGAL_LIBRARY:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/lib/libCGAL.so
-//Variable hidden from user
-CGAL_CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4;Core;ImageIO;Qt3;Qt4
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-//ADVANCED property for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;TAUCS;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//MODIFIED property for variable: CMAKE_BUILD_TYPE
-CMAKE_BUILD_TYPE-MODIFIED:INTERNAL=1
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=8
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 4
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_CXX_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_C_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL=-std=c++0x -frounding-math
-//Variable hidden from user
-Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.5()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-ImageIO_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUS_LIBRARY
-QT_DBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GOBJECT_LIBRARY
-QT_GOBJECT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XCURSOR_LIBRARY
-QT_XCURSOR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XFIXES_LIBRARY
-QT_XFIXES_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XINERAMA_LIBRARY
-QT_XINERAMA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XI_LIBRARY
-QT_XI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRANDR_LIBRARY
-QT_XRANDR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//Variable hidden from user
-Qt3_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-Qt4_LIBRARY_INSTALLED:INTERNAL=
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/setup
deleted file mode 100644
index ed20c9033c06..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_CXX0X/setup
+++ /dev/null
@@ -1,15 +0,0 @@
-QTDIR=/usr/lib64/qt-3.3
-LD_LIBRARY_PATH=/usr/local/packages/gcc-4.5/lib64
-CXX=/usr/local/packages/gcc-4.5/bin/g++
-CC=/usr/local/packages/gcc-4.5/bin/gcc
-
-export CXX CC
-export LD_LIBRARY_PATH QTDIR
-
-source /home/lrineau/infrastructure/reference-platforms/setup-common
-
-BOOST_ROOT=/home/lrineau/CGAL/boost/1.44-beta1
-export BOOST_ROOT
-
-CXXFLAGS=-I$BOOST_ROOT/include
-CXXFLAGS="-std=c++0x $CXX_FLAGS"
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/CMakeCache.txt
deleted file mode 100644
index 82d1538125b7..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/CMakeCache.txt
+++ /dev/null
@@ -1,2407 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//The directory containing a CMake configuration file for Boost.
-Boost_DIR:PATH=Boost_DIR-NOTFOUND
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/home/lrineau/CGAL/boost/1.45/include
-
-//Boost library directory
-Boost_LIBRARY_DIRS:FILEPATH=/home/lrineau/CGAL/boost/1.45/lib
-
-//The Boost SYSTEM library
-Boost_SYSTEM_LIBRARY:FILEPATH=/home/lrineau/CGAL/boost/1.45/lib/libboost_system-mt.so
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/1.45/lib/libboost_system-mt.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/1.45/lib/libboost_system-mt.so
-
-//The Boost THREAD library
-Boost_THREAD_LIBRARY:FILEPATH=/home/lrineau/CGAL/boost/1.45/lib/libboost_thread-mt.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/1.45/lib/libboost_thread-mt.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/1.45/lib/libboost_thread-mt.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//Directory containing the Maintenance package
-CGAL_CORE_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/src/Core
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.45/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.45/lib/libboost_system-mt.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-Ic-33
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/src/ImageIO
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.45/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.45/lib/libboost_system-mt.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;/usr/lib64/libz.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALImageIO
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/boost/1.45/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.45/lib/libboost_system-mt.so;
-
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//Value Computed by CMake
-CGAL_PDB_BINARY_DIR:STATIC=/home/lrineau/CGAL/CGAL-I-REF/cmake/platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/src/CGALPDB
-
-//The CGAL_PDB library
-CGAL_PDB_LIBRARY:STRING=/home/lrineau/CGAL/CGAL-I-REF/cmake/platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL_PDB.so
-
-//Dependencies for the target
-CGAL_PDB_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/CGAL-I-REF/cmake/platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread-mt.so;general;/home/lrineau/CGAL/CGAL-I-REF/cmake/platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread-mt.so;
-
-//Value Computed by CMake
-CGAL_PDB_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALPDB
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/src/Qt3
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.45/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.45/lib/libboost_system-mt.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt3
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/src/Qt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.45/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.45/lib/libboost_system-mt.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt4
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/local/packages/gcc-4.5/bin/g++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING= -frounding-math
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/local/packages/gcc-4.5/bin/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib64/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-//Missing description
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-//Missing description
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib64/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a library.
-QT_DBUS_LIBRARY:FILEPATH=/lib64/libdbus-1.so
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib64/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib64/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/usr/lib64/libglib-2.0.so
-
-//Path to a library.
-QT_GOBJECT_LIBRARY:FILEPATH=/usr/lib64/libgobject-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/usr/lib64/libgthread-2.0.so
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Missing description
-QT_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//The moc executable
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib64/libpng.so
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a file.
-QT_QT_INCLUDE_DIR:PATH=/usr/include/Qt
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib64/librt.so
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//The uic executable
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib64/libm.so
-
-//Path to a library.
-QT_XCURSOR_LIBRARY:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a library.
-QT_XFIXES_LIBRARY:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a library.
-QT_XINERAMA_LIBRARY:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a library.
-QT_XI_LIBRARY:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a library.
-QT_XRANDR_LIBRARY:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component PDB
-WITH_CGAL_PDB:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib64/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=X11_Xi_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=X11_Xkbfile_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=X11_Xmu_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=X11_Xxf86vm_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIRS
-Boost_LIBRARY_DIRS-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_45
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY
-Boost_SYSTEM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY
-Boost_THREAD_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=104500
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/home/lrineau/CGAL/boost/1.45/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/home/lrineau/CGAL/boost/1.45/lib/libboost_thread-mt.so;/home/lrineau/CGAL/boost/1.45/lib/libboost_system-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/home/lrineau/CGAL/boost/1.45/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_COPY_N:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_COPY_N_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_NEXT_PREV:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_NEXT_PREV_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-//Variable hidden from user
-CGAL_CGAL_LIBRARY:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib/libCGAL.so
-//Variable hidden from user
-CGAL_CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4;Core;ImageIO;Qt3;Qt4
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_PDB_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_PDB_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_PDB_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_PDB_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_PDB_LIBRARY
-CGAL_PDB_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_PDB_LIBRARY_NAME:INTERNAL=libCGAL_PDB.so
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-//ADVANCED property for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;TAUCS;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=8
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 4
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_CXX_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_C_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL= -frounding-math
-//Variable hidden from user
-Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.5()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-ImageIO_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUS_LIBRARY
-QT_DBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GOBJECT_LIBRARY
-QT_GOBJECT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_INCLUDE_DIR
-QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT_INCLUDE_DIR
-QT_QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XCURSOR_LIBRARY
-QT_XCURSOR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XFIXES_LIBRARY
-QT_XFIXES_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XINERAMA_LIBRARY
-QT_XINERAMA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XI_LIBRARY
-QT_XI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRANDR_LIBRARY
-QT_XRANDR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//Variable hidden from user
-Qt3_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-Qt4_LIBRARY_INSTALLED:INTERNAL=
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/setup
deleted file mode 100644
index 9b7a097e20b6..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.5-branch_Release/setup
+++ /dev/null
@@ -1,15 +0,0 @@
-QTDIR=/usr/lib64/qt-3.3
-LD_LIBRARY_PATH=/usr/local/packages/gcc-4.5/lib64
-CXX=/usr/local/packages/gcc-4.5/bin/g++
-CC=/usr/local/packages/gcc-4.5/bin/gcc
-
-export CXX CC
-export LD_LIBRARY_PATH QTDIR
-
-BOOST_ROOT=/home/lrineau/CGAL/boost/1.45
-export BOOST_ROOT
-
-CXXFLAGS=-I$BOOST_ROOT/include
-
-source /home/lrineau/infrastructure/reference-platforms/setup-common
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/CMakeCache.txt
deleted file mode 100644
index 09d48ec4b9a7..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/CMakeCache.txt
+++ /dev/null
@@ -1,2410 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIR:PATH=/usr/lib64
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/src/Core
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/lib/libCGAL.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-I-125
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/src/ImageIO
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/lib/libCGAL.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;/usr/lib64/libz.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALImageIO
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/src/Qt3
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/lib/libCGAL.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt3
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/src/Qt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/lib/libCGAL.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt4
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/lib64/ccache/c++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING= -frounding-math
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/lib64/ccache/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib64/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-//Missing description
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-//Missing description
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib64/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a library.
-QT_DBUS_LIBRARY:FILEPATH=/lib64/libdbus-1.so
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib64/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib64/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/usr/lib64/libglib-2.0.so
-
-//Path to a library.
-QT_GOBJECT_LIBRARY:FILEPATH=/usr/lib64/libgobject-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/usr/lib64/libgthread-2.0.so
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease-qt4
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate-qt4
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib64/libpng.so
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib64/librt.so
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic-qt4
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib64/libm.so
-
-//Path to a library.
-QT_XCURSOR_LIBRARY:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a library.
-QT_XFIXES_LIBRARY:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a library.
-QT_XINERAMA_LIBRARY:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a library.
-QT_XI_LIBRARY:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a library.
-QT_XRANDR_LIBRARY:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib64/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=/usr/lib64/libxkbfile.so
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=/usr/lib64/libXmu.so
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=/usr/lib64/libXxf86vm.so
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR
-Boost_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_44
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=104400
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libboost_thread.so;/usr/lib64/libboost_system.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib64
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_COPY_N:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_COPY_N_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_NEXT_PREV:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_NEXT_PREV_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-//Variable hidden from user
-CGAL_CGAL_LIBRARY:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/lib/libCGAL.so
-//Variable hidden from user
-CGAL_CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-//ADVANCED property for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE;TAUCS
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//MODIFIED property for variable: CMAKE_BUILD_TYPE
-CMAKE_BUILD_TYPE-MODIFIED:INTERNAL=1
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=12
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 4
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL= -frounding-math
-//Variable hidden from user
-Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-ImageIO_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUS_LIBRARY
-QT_DBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GOBJECT_LIBRARY
-QT_GOBJECT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XCURSOR_LIBRARY
-QT_XCURSOR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XFIXES_LIBRARY
-QT_XFIXES_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XINERAMA_LIBRARY
-QT_XINERAMA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XI_LIBRARY
-QT_XI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRANDR_LIBRARY
-QT_XRANDR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//Variable hidden from user
-Qt3_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-Qt4_LIBRARY_INSTALLED:INTERNAL=
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/usr/include
-//Last used Boost_LIBRARY_DIR value.
-_Boost_LIBRARY_DIR_LAST:INTERNAL=/usr/lib64
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/setup
deleted file mode 100644
index f9c78ade216e..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8/setup
+++ /dev/null
@@ -1,2 +0,0 @@
-export QTDIR=/usr/lib64/qt-3.3
-source /home/lrineau/infrastructure/reference-platforms/setup-common
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/CMakeCache.txt
deleted file mode 100644
index a1a59997eb2f..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/CMakeCache.txt
+++ /dev/null
@@ -1,2421 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/home/lrineau/CGAL/boost/boost_1_57_0
-
-//Boost library directory
-Boost_LIBRARY_DIR:PATH=/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_system.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_system.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_thread.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_thread.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math -std=c++11
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/src/Core
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_thread.so;general;/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_system.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-I-102
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/src/ImageIO
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_thread.so;general;/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;/usr/lib64/libz.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALImageIO
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_thread.so;general;/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_system.so;
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/src/Qt3
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_thread.so;general;/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_system.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt3
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/src/Qt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_thread.so;general;/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_system.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt4
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/local/packages/gcc-4.8/bin/g++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING= -I/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/patch-qt-4.8 -frounding-math -std=c++11
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/local/packages/gcc-4.8/bin/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=OFF
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib64/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-//Missing description
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-//Missing description
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib64/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a library.
-QT_DBUS_LIBRARY:FILEPATH=/lib64/libdbus-1.so
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib64/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib64/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/usr/lib64/libglib-2.0.so
-
-//Path to a library.
-QT_GOBJECT_LIBRARY:FILEPATH=/usr/lib64/libgobject-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/usr/lib64/libgthread-2.0.so
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Missing description
-QT_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//The moc executable
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib64/libpng.so
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a file.
-QT_QT_INCLUDE_DIR:PATH=/usr/include/Qt
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib64/librt.so
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//The uic executable
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib64/libm.so
-
-//Path to a library.
-QT_XCURSOR_LIBRARY:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a library.
-QT_XFIXES_LIBRARY:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a library.
-QT_XINERAMA_LIBRARY:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a library.
-QT_XI_LIBRARY:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a library.
-QT_XRANDR_LIBRARY:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib64/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=/usr/lib64/libxkbfile.so
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=/usr/lib64/libXmu.so
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=/usr/lib64/libXxf86vm.so
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR
-Boost_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_48
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=104800
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/home/lrineau/CGAL/boost/boost_1_57_0
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_thread.so;/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib/libboost_system.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_COPY_N:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_COPY_N_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_NEXT_PREV:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_NEXT_PREV_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-//Variable hidden from user
-CGAL_CGAL_LIBRARY:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/lib/libCGAL.so
-//Variable hidden from user
-CGAL_CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-//ADVANCED property for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE;TAUCS
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=12
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 4
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL= -I/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/patch-qt-4.8 -frounding-math -std=c++11
-//Variable hidden from user
-Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-ImageIO_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUS_LIBRARY
-QT_DBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GOBJECT_LIBRARY
-QT_GOBJECT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_INCLUDE_DIR
-QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT_INCLUDE_DIR
-QT_QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XCURSOR_LIBRARY
-QT_XCURSOR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XFIXES_LIBRARY
-QT_XFIXES_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XINERAMA_LIBRARY
-QT_XINERAMA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XI_LIBRARY
-QT_XI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRANDR_LIBRARY
-QT_XRANDR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//Variable hidden from user
-Qt3_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-Qt4_LIBRARY_INSTALLED:INTERNAL=
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/home/lrineau/CGAL/boost/boost_1_57_0
-//Last used Boost_LIBRARY_DIR value.
-_Boost_LIBRARY_DIR_LAST:INTERNAL=/home/lrineau/CGAL/boost/boost_1_57_0/stage/lib
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/patch-qt-4.8/QtCore/qobjectdefs.h b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/patch-qt-4.8/QtCore/qobjectdefs.h
deleted file mode 100644
index 1b633566c738..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/patch-qt-4.8/QtCore/qobjectdefs.h
+++ /dev/null
@@ -1,506 +0,0 @@
-/****************************************************************************
-**
-** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
-** All rights reserved.
-** Contact: Nokia Corporation (qt-info@nokia.com)
-**
-** This file is part of the QtCore module of the Qt Toolkit.
-**
-** $QT_BEGIN_LICENSE:LGPL$
-** GNU Lesser General Public License Usage
-** This file may be used under the terms of the GNU Lesser General Public
-** License version 2.1 as published by the Free Software Foundation and
-** appearing in the file LICENSE.LGPL included in the packaging of this
-** file. Please review the following information to ensure the GNU Lesser
-** General Public License version 2.1 requirements will be met:
-** https://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
-**
-** In addition, as a special exception, Nokia gives you certain additional
-** rights. These rights are described in the Nokia Qt LGPL Exception
-** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
-**
-** GNU General Public License Usage
-** Alternatively, this file may be used under the terms of the GNU General
-** Public License version 3.0 as published by the Free Software Foundation
-** and appearing in the file LICENSE.GPL included in the packaging of this
-** file. Please review the following information to ensure the GNU General
-** Public License version 3.0 requirements will be met:
-** https://www.gnu.org/licenses/gpl-3.0.html.
-**
-** Other Usage
-** Alternatively, this file may be used in accordance with the terms and
-** conditions contained in a signed written agreement between you and Nokia.
-**
-**
-**
-**
-**
-** $QT_END_LICENSE$
-**
-****************************************************************************/
-
-#ifndef QOBJECTDEFS_H
-#define QOBJECTDEFS_H
-
-#include <QtCore/qnamespace.h>
-
-QT_BEGIN_HEADER
-
-QT_BEGIN_NAMESPACE
-
-QT_MODULE(Core)
-
-class QByteArray;
-
-class QString;
-
-#ifndef Q_MOC_OUTPUT_REVISION
-#define Q_MOC_OUTPUT_REVISION 63
-#endif
-
-// The following macros are our "extensions" to C++
-// They are used, strictly speaking, only by the moc.
-
-#ifndef Q_MOC_RUN
-# if defined(QT_NO_KEYWORDS)
-#  define QT_NO_EMIT
-# else
-#   define slots
-#   define signals protected
-# endif
-# define Q_SLOTS
-# define Q_SIGNALS protected
-# define Q_PRIVATE_SLOT(d, signature)
-# define Q_EMIT
-#ifndef QT_NO_EMIT
-# define emit
-#endif
-#define Q_CLASSINFO(name, value)
-#define Q_INTERFACES(x)
-#define Q_PROPERTY(text)
-#define Q_PRIVATE_PROPERTY(d, text)
-#define Q_REVISION(v)
-#define Q_OVERRIDE(text)
-#define Q_ENUMS(x)
-#define Q_FLAGS(x)
-#ifdef QT3_SUPPORT
-# define Q_SETS(x)
-#endif
-#define Q_SCRIPTABLE
-#define Q_INVOKABLE
-#define Q_SIGNAL
-#define Q_SLOT
-
-#ifndef QT_NO_TRANSLATION
-# ifndef QT_NO_TEXTCODEC
-// full set of tr functions
-// ### Qt 5: merge overloads
-#  define QT_TR_FUNCTIONS \
-    static inline QString tr(const char *s, const char *c = 0) \
-        { return staticMetaObject.tr(s, c); } \
-    static inline QString trUtf8(const char *s, const char *c = 0) \
-        { return staticMetaObject.trUtf8(s, c); } \
-    static inline QString tr(const char *s, const char *c, int n) \
-        { return staticMetaObject.tr(s, c, n); } \
-    static inline QString trUtf8(const char *s, const char *c, int n) \
-        { return staticMetaObject.trUtf8(s, c, n); }
-# else
-// no QTextCodec, no utf8
-// ### Qt 5: merge overloads
-#  define QT_TR_FUNCTIONS \
-    static inline QString tr(const char *s, const char *c = 0) \
-        { return staticMetaObject.tr(s, c); } \
-    static inline QString tr(const char *s, const char *c, int n) \
-        { return staticMetaObject.tr(s, c, n); }
-# endif
-#else
-// inherit the ones from QObject
-# define QT_TR_FUNCTIONS
-#endif
-
-#if defined(QT_NO_QOBJECT_CHECK)
-/* tmake ignore Q_OBJECT */
-#define Q_OBJECT_CHECK
-#else
-
-/* This is a compile time check that ensures that any class cast with qobject_cast
-   actually contains a Q_OBJECT macro. Note: qobject_cast will fail if a QObject
-   subclass doesn't contain Q_OBJECT.
-
-   In qt_check_for_QOBJECT_macro, we call a dummy templated function with two
-   parameters, the first being "this" and the other the target of the qobject
-   cast. If the types are not identical, we know that a Q_OBJECT macro is missing.
-
-   If you get a compiler error here, make sure that the class you are casting
-   to contains a Q_OBJECT macro.
-*/
-
-/* tmake ignore Q_OBJECT */
-#define Q_OBJECT_CHECK \
-    template <typename T> inline void qt_check_for_QOBJECT_macro(const T &_q_argument) const \
-    { int i = qYouForgotTheQ_OBJECT_Macro(this, &_q_argument); i = i; }
-
-template <typename T>
-inline int qYouForgotTheQ_OBJECT_Macro(T, T) { return 0; }
-
-template <typename T1, typename T2>
-inline void qYouForgotTheQ_OBJECT_Macro(T1, T2) {}
-#endif // QT_NO_QOBJECT_CHECK
-
-#ifdef Q_NO_DATA_RELOCATION
-#define Q_OBJECT_GETSTATICMETAOBJECT static const QMetaObject &getStaticMetaObject();
-#else
-#define Q_OBJECT_GETSTATICMETAOBJECT
-#endif
-
-/* tmake ignore Q_OBJECT */
-#define Q_OBJECT \
-public: \
-    Q_OBJECT_CHECK \
-    static const QMetaObject staticMetaObject; \
-    Q_OBJECT_GETSTATICMETAOBJECT \
-    virtual const QMetaObject *metaObject() const; \
-    virtual void *qt_metacast(const char *); \
-    QT_TR_FUNCTIONS \
-    virtual int qt_metacall(QMetaObject::Call, int, void **); \
-private: \
-    Q_DECL_HIDDEN static const QMetaObjectExtraData staticMetaObjectExtraData; \
-    Q_DECL_HIDDEN static void qt_static_metacall(QObject *, QMetaObject::Call, int, void **);
-
-/* tmake ignore Q_OBJECT */
-#define Q_OBJECT_FAKE Q_OBJECT
-/* tmake ignore Q_GADGET */
-#define Q_GADGET \
-public: \
-    static const QMetaObject staticMetaObject; \
-    Q_OBJECT_GETSTATICMETAOBJECT \
-private:
-#else // Q_MOC_RUN
-#define slots slots
-#define signals signals
-#define Q_SLOTS Q_SLOTS
-#define Q_SIGNALS Q_SIGNALS
-#define Q_CLASSINFO(name, value) Q_CLASSINFO(name, value)
-#define Q_INTERFACES(x) Q_INTERFACES(x)
-#define Q_PROPERTY(text) Q_PROPERTY(text)
-#define Q_PRIVATE_PROPERTY(d, text) Q_PRIVATE_PROPERTY(d, text)
-#define Q_REVISION(v) Q_REVISION(v)
-#define Q_OVERRIDE(text) Q_OVERRIDE(text)
-#define Q_ENUMS(x) Q_ENUMS(x)
-#define Q_FLAGS(x) Q_FLAGS(x)
-#ifdef QT3_SUPPORT
-# define Q_SETS(x) Q_SETS(x)
-#endif
- /* tmake ignore Q_OBJECT */
-#define Q_OBJECT Q_OBJECT
- /* tmake ignore Q_OBJECT */
-#define Q_OBJECT_FAKE Q_OBJECT_FAKE
- /* tmake ignore Q_GADGET */
-#define Q_GADGET Q_GADGET
-#define Q_SCRIPTABLE Q_SCRIPTABLE
-#define Q_INVOKABLE Q_INVOKABLE
-#define Q_SIGNAL Q_SIGNAL
-#define Q_SLOT Q_SLOT
-#endif //Q_MOC_RUN
-
-// macro for onaming members
-#ifdef METHOD
-#undef METHOD
-#endif
-#ifdef SLOT
-#undef SLOT
-#endif
-#ifdef SIGNAL
-#undef SIGNAL
-#endif
-
-Q_CORE_EXPORT const char *qFlagLocation(const char *method);
-
-#define QTOSTRING_HELPER(s) #s
-#define QTOSTRING(s) QTOSTRING_HELPER(s)
-#ifndef QT_NO_DEBUG
-# define QLOCATION "\0" __FILE__ ":" QTOSTRING(__LINE__)
-# ifndef QT_NO_KEYWORDS
-#  define METHOD(a)   qFlagLocation("0"#a QLOCATION)
-# endif
-# define SLOT(a)     qFlagLocation("1"#a QLOCATION)
-# define SIGNAL(a)   qFlagLocation("2"#a QLOCATION)
-#else
-# ifndef QT_NO_KEYWORDS
-#  define METHOD(a)   "0"#a
-# endif
-# define SLOT(a)     "1"#a
-# define SIGNAL(a)   "2"#a
-#endif
-
-#ifdef QT3_SUPPORT
-#define METHOD_CODE   0                        // member type codes
-#define SLOT_CODE     1
-#define SIGNAL_CODE   2
-#endif
-
-#define QMETHOD_CODE  0                        // member type codes
-#define QSLOT_CODE    1
-#define QSIGNAL_CODE  2
-
-#define Q_ARG(type, data) QArgument<type >(#type, data)
-#define Q_RETURN_ARG(type, data) QReturnArgument<type >(#type, data)
-
-class QObject;
-class QMetaMethod;
-class QMetaEnum;
-class QMetaProperty;
-class QMetaClassInfo;
-
-
-class Q_CORE_EXPORT QGenericArgument
-{
-public:
-    inline QGenericArgument(const char *aName = 0, const void *aData = 0)
-        : _data(aData), _name(aName) {}
-    inline void *data() const { return const_cast<void *>(_data); }
-    inline const char *name() const { return _name; }
-
-private:
-    const void *_data;
-    const char *_name;
-};
-
-class Q_CORE_EXPORT QGenericReturnArgument: public QGenericArgument
-{
-public:
-    inline QGenericReturnArgument(const char *aName = 0, void *aData = 0)
-        : QGenericArgument(aName, aData)
-        {}
-};
-
-template <class T>
-class QArgument: public QGenericArgument
-{
-public:
-    inline QArgument(const char *aName, const T &aData)
-        : QGenericArgument(aName, static_cast<const void *>(&aData))
-        {}
-};
-template <class T>
-class QArgument<T &>: public QGenericArgument
-{
-public:
-    inline QArgument(const char *aName, T &aData)
-        : QGenericArgument(aName, static_cast<const void *>(&aData))
-        {}
-};
-
-
-template <typename T>
-class QReturnArgument: public QGenericReturnArgument
-{
-public:
-    inline QReturnArgument(const char *aName, T &aData)
-        : QGenericReturnArgument(aName, static_cast<void *>(&aData))
-        {}
-};
-
-struct Q_CORE_EXPORT QMetaObject
-{
-    const char *className() const;
-    const QMetaObject *superClass() const;
-
-    QObject *cast(QObject *obj) const;
-    const QObject *cast(const QObject *obj) const;
-
-#ifndef QT_NO_TRANSLATION
-    // ### Qt 4: Merge overloads
-    QString tr(const char *s, const char *c) const;
-    QString trUtf8(const char *s, const char *c) const;
-    QString tr(const char *s, const char *c, int n) const;
-    QString trUtf8(const char *s, const char *c, int n) const;
-#endif // QT_NO_TRANSLATION
-
-    int methodOffset() const;
-    int enumeratorOffset() const;
-    int propertyOffset() const;
-    int classInfoOffset() const;
-
-    int constructorCount() const;
-    int methodCount() const;
-    int enumeratorCount() const;
-    int propertyCount() const;
-    int classInfoCount() const;
-
-    int indexOfConstructor(const char *constructor) const;
-    int indexOfMethod(const char *method) const;
-    int indexOfSignal(const char *signal) const;
-    int indexOfSlot(const char *slot) const;
-    int indexOfEnumerator(const char *name) const;
-    int indexOfProperty(const char *name) const;
-    int indexOfClassInfo(const char *name) const;
-
-    QMetaMethod constructor(int index) const;
-    QMetaMethod method(int index) const;
-    QMetaEnum enumerator(int index) const;
-    QMetaProperty property(int index) const;
-    QMetaClassInfo classInfo(int index) const;
-    QMetaProperty userProperty() const;
-
-    static bool checkConnectArgs(const char *signal, const char *method);
-    static QByteArray normalizedSignature(const char *method);
-    static QByteArray normalizedType(const char *type);
-
-    // internal index-based connect
-    static bool connect(const QObject *sender, int signal_index,
-                        const QObject *receiver, int method_index,
-                        int type = 0, int *types = 0);
-    // internal index-based disconnect
-    static bool disconnect(const QObject *sender, int signal_index,
-                           const QObject *receiver, int method_index);
-    static bool disconnectOne(const QObject *sender, int signal_index,
-                              const QObject *receiver, int method_index);
-    // internal slot-name based connect
-    static void connectSlotsByName(QObject *o);
-
-    // internal index-based signal activation
-    static void activate(QObject *sender, int signal_index, void **argv);  //obsolete
-    static void activate(QObject *sender, int from_signal_index, int to_signal_index, void **argv); //obsolete
-    static void activate(QObject *sender, const QMetaObject *, int local_signal_index, void **argv);
-    static void activate(QObject *sender, const QMetaObject *, int from_local_signal_index, int to_local_signal_index, void **argv); //obsolete
-
-    // internal guarded pointers
-    static void addGuard(QObject **ptr);
-    static void removeGuard(QObject **ptr);
-    static void changeGuard(QObject **ptr, QObject *o);
-
-    static bool invokeMethod(QObject *obj, const char *member,
-                             Qt::ConnectionType,
-                             QGenericReturnArgument ret,
-                             QGenericArgument val0 = QGenericArgument(0),
-                             QGenericArgument val1 = QGenericArgument(),
-                             QGenericArgument val2 = QGenericArgument(),
-                             QGenericArgument val3 = QGenericArgument(),
-                             QGenericArgument val4 = QGenericArgument(),
-                             QGenericArgument val5 = QGenericArgument(),
-                             QGenericArgument val6 = QGenericArgument(),
-                             QGenericArgument val7 = QGenericArgument(),
-                             QGenericArgument val8 = QGenericArgument(),
-                             QGenericArgument val9 = QGenericArgument());
-
-    static inline bool invokeMethod(QObject *obj, const char *member,
-                             QGenericReturnArgument ret,
-                             QGenericArgument val0 = QGenericArgument(0),
-                             QGenericArgument val1 = QGenericArgument(),
-                             QGenericArgument val2 = QGenericArgument(),
-                             QGenericArgument val3 = QGenericArgument(),
-                             QGenericArgument val4 = QGenericArgument(),
-                             QGenericArgument val5 = QGenericArgument(),
-                             QGenericArgument val6 = QGenericArgument(),
-                             QGenericArgument val7 = QGenericArgument(),
-                             QGenericArgument val8 = QGenericArgument(),
-                             QGenericArgument val9 = QGenericArgument())
-    {
-        return invokeMethod(obj, member, Qt::AutoConnection, ret, val0, val1, val2, val3,
-                val4, val5, val6, val7, val8, val9);
-    }
-
-    static inline bool invokeMethod(QObject *obj, const char *member,
-                             Qt::ConnectionType type,
-                             QGenericArgument val0 = QGenericArgument(0),
-                             QGenericArgument val1 = QGenericArgument(),
-                             QGenericArgument val2 = QGenericArgument(),
-                             QGenericArgument val3 = QGenericArgument(),
-                             QGenericArgument val4 = QGenericArgument(),
-                             QGenericArgument val5 = QGenericArgument(),
-                             QGenericArgument val6 = QGenericArgument(),
-                             QGenericArgument val7 = QGenericArgument(),
-                             QGenericArgument val8 = QGenericArgument(),
-                             QGenericArgument val9 = QGenericArgument())
-    {
-        return invokeMethod(obj, member, type, QGenericReturnArgument(), val0, val1, val2,
-                                 val3, val4, val5, val6, val7, val8, val9);
-    }
-
-    static inline bool invokeMethod(QObject *obj, const char *member,
-                             QGenericArgument val0 = QGenericArgument(0),
-                             QGenericArgument val1 = QGenericArgument(),
-                             QGenericArgument val2 = QGenericArgument(),
-                             QGenericArgument val3 = QGenericArgument(),
-                             QGenericArgument val4 = QGenericArgument(),
-                             QGenericArgument val5 = QGenericArgument(),
-                             QGenericArgument val6 = QGenericArgument(),
-                             QGenericArgument val7 = QGenericArgument(),
-                             QGenericArgument val8 = QGenericArgument(),
-                             QGenericArgument val9 = QGenericArgument())
-    {
-        return invokeMethod(obj, member, Qt::AutoConnection, QGenericReturnArgument(), val0,
-                val1, val2, val3, val4, val5, val6, val7, val8, val9);
-    }
-
-    QObject *newInstance(QGenericArgument val0 = QGenericArgument(0),
-                         QGenericArgument val1 = QGenericArgument(),
-                         QGenericArgument val2 = QGenericArgument(),
-                         QGenericArgument val3 = QGenericArgument(),
-                         QGenericArgument val4 = QGenericArgument(),
-                         QGenericArgument val5 = QGenericArgument(),
-                         QGenericArgument val6 = QGenericArgument(),
-                         QGenericArgument val7 = QGenericArgument(),
-                         QGenericArgument val8 = QGenericArgument(),
-                         QGenericArgument val9 = QGenericArgument()) const;
-
-    enum Call {
-        InvokeMetaMethod,
-        ReadProperty,
-        WriteProperty,
-        ResetProperty,
-        QueryPropertyDesignable,
-        QueryPropertyScriptable,
-        QueryPropertyStored,
-        QueryPropertyEditable,
-        QueryPropertyUser,
-        CreateInstance
-    };
-
-    int static_metacall(Call, int, void **) const;
-    static int metacall(QObject *, Call, int, void **);
-
-#ifdef QT3_SUPPORT
-    QT3_SUPPORT const char *superClassName() const;
-#endif
-
-    struct { // private data
-        const QMetaObject *superdata;
-        const char *stringdata;
-        const uint *data;
-        const void *extradata;
-    } d;
-};
-
-typedef const QMetaObject& (*QMetaObjectAccessor)();
-
-struct QMetaObjectExtraData
-{
-#ifdef Q_NO_DATA_RELOCATION
-    const QMetaObjectAccessor *objects;
-#else
-    const QMetaObject **objects;
-#endif
-
-    typedef void (*StaticMetacallFunction)(QObject *, QMetaObject::Call, int, void **); //from revision 6
-    //typedef int (*StaticMetaCall)(QMetaObject::Call, int, void **); //used from revison 2 until revison 5
-    StaticMetacallFunction static_metacall;
-};
-
-inline const char *QMetaObject::className() const
-{ return d.stringdata; }
-
-inline const QMetaObject *QMetaObject::superClass() const
-{ return d.superdata; }
-
-#ifdef QT3_SUPPORT
-inline const char *QMetaObject::superClassName() const
-{ return d.superdata ? d.superdata->className() : 0; }
-#endif
-
-QT_END_NAMESPACE
-
-QT_END_HEADER
-
-#endif // QOBJECTDEFS_H
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/patch-qt-4.8/QtCore/qplugin.h b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/patch-qt-4.8/QtCore/qplugin.h
deleted file mode 100644
index d7e475356270..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/patch-qt-4.8/QtCore/qplugin.h
+++ /dev/null
@@ -1,152 +0,0 @@
-/****************************************************************************
-**
-** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
-** All rights reserved.
-** Contact: Nokia Corporation (qt-info@nokia.com)
-**
-** This file is part of the QtCore module of the Qt Toolkit.
-**
-** $QT_BEGIN_LICENSE:LGPL$
-** GNU Lesser General Public License Usage
-** This file may be used under the terms of the GNU Lesser General Public
-** License version 2.1 as published by the Free Software Foundation and
-** appearing in the file LICENSE.LGPL included in the packaging of this
-** file. Please review the following information to ensure the GNU Lesser
-** General Public License version 2.1 requirements will be met:
-** https://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
-**
-** In addition, as a special exception, Nokia gives you certain additional
-** rights. These rights are described in the Nokia Qt LGPL Exception
-** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
-**
-** GNU General Public License Usage
-** Alternatively, this file may be used under the terms of the GNU General
-** Public License version 3.0 as published by the Free Software Foundation
-** and appearing in the file LICENSE.GPL included in the packaging of this
-** file. Please review the following information to ensure the GNU General
-** Public License version 3.0 requirements will be met:
-** https://www.gnu.org/licenses/gpl-3.0.html.
-**
-** Other Usage
-** Alternatively, this file may be used in accordance with the terms and
-** conditions contained in a signed written agreement between you and Nokia.
-**
-**
-**
-**
-**
-** $QT_END_LICENSE$
-**
-****************************************************************************/
-
-#ifndef QPLUGIN_H
-#define QPLUGIN_H
-
-#include <QtCore/qobject.h>
-#include <QtCore/qpointer.h>
-
-QT_BEGIN_HEADER
-
-QT_BEGIN_NAMESPACE
-
-QT_MODULE(Core)
-
-#ifndef Q_EXTERN_C
-#  ifdef __cplusplus
-#    define Q_EXTERN_C extern "C"
-#  else
-#    define Q_EXTERN_C extern
-#  endif
-#endif
-
-typedef QObject *(*QtPluginInstanceFunction)();
-
-void Q_CORE_EXPORT qRegisterStaticPluginInstanceFunction(QtPluginInstanceFunction function);
-
-#define Q_IMPORT_PLUGIN(PLUGIN) \
-        extern QT_PREPEND_NAMESPACE(QObject) *qt_plugin_instance_##PLUGIN(); \
-        class Static##PLUGIN##PluginInstance{ \
-        public: \
-                Static##PLUGIN##PluginInstance() { \
-                qRegisterStaticPluginInstanceFunction(qt_plugin_instance_##PLUGIN); \
-                } \
-        }; \
-       static Static##PLUGIN##PluginInstance static##PLUGIN##Instance;
-
-#define Q_PLUGIN_INSTANCE(IMPLEMENTATION) \
-        { \
-            static QT_PREPEND_NAMESPACE(QPointer)<QT_PREPEND_NAMESPACE(QObject)> _instance; \
-            if (!_instance)      \
-                _instance = new IMPLEMENTATION; \
-            return _instance; \
-        }
-
-#  define Q_EXPORT_PLUGIN(PLUGIN) \
-            Q_EXPORT_PLUGIN2(PLUGIN, PLUGIN)
-
-#  define Q_EXPORT_STATIC_PLUGIN(PLUGIN) \
-            Q_EXPORT_STATIC_PLUGIN2(PLUGIN, PLUGIN)
-
-#if defined(QT_STATICPLUGIN)
-
-#  define Q_EXPORT_PLUGIN2(PLUGIN, PLUGINCLASS) \
-            QT_PREPEND_NAMESPACE(QObject) \
-                *qt_plugin_instance_##PLUGIN() \
-            Q_PLUGIN_INSTANCE(PLUGINCLASS)
-
-#  define Q_EXPORT_STATIC_PLUGIN2(PLUGIN, PLUGINCLASS) \
-            Q_EXPORT_PLUGIN2(PLUGIN, PLUGINCLASS)
-
-#else
-// NOTE: if you change pattern, you MUST change the pattern in
-// qlibrary.cpp as well.  changing the pattern will break all
-// backwards compatibility as well (no old plugins will be loaded).
-// QT5: should probably remove the entire pattern thing and do the section
-//      trick for all platforms. for now, keep it and fallback to scan for it.
-#  ifdef QPLUGIN_DEBUG_STR
-#    undef QPLUGIN_DEBUG_STR
-#  endif
-#  ifdef QT_NO_DEBUG
-#    define QPLUGIN_DEBUG_STR "false"
-#    define QPLUGIN_SECTION_DEBUG_STR ""
-#  else
-#    define QPLUGIN_DEBUG_STR "true"
-#    define QPLUGIN_SECTION_DEBUG_STR ".debug"
-#  endif
-#  define Q_PLUGIN_VERIFICATION_DATA \
-    static const char qt_plugin_verification_data[] = \
-      "pattern=QT_PLUGIN_VERIFICATION_DATA\n" \
-      "version=" QT_VERSION_STR "\n" \
-      "debug=" QPLUGIN_DEBUG_STR "\n" \
-      "buildkey=" QT_BUILD_KEY;
-
-#  if defined (Q_OF_ELF) && defined (Q_CC_GNU)
-#  define Q_PLUGIN_VERIFICATION_SECTION \
-    __attribute__ ((section (".qtplugin"))) __attribute__((used))
-#  else
-#  define Q_PLUGIN_VERIFICATION_SECTION
-#  endif
-
-#  if defined (Q_OS_WIN32) && defined(Q_CC_BOR)
-#     define Q_STANDARD_CALL __stdcall
-#  else
-#     define Q_STANDARD_CALL
-#  endif
-
-#  define Q_EXPORT_PLUGIN2(PLUGIN, PLUGINCLASS)      \
-            Q_PLUGIN_VERIFICATION_SECTION Q_PLUGIN_VERIFICATION_DATA \
-            Q_EXTERN_C Q_DECL_EXPORT \
-            const char * Q_STANDARD_CALL qt_plugin_query_verification_data() \
-            { return qt_plugin_verification_data; } \
-            Q_EXTERN_C Q_DECL_EXPORT QT_PREPEND_NAMESPACE(QObject) * Q_STANDARD_CALL qt_plugin_instance() \
-            Q_PLUGIN_INSTANCE(PLUGINCLASS)
-
-#  define Q_EXPORT_STATIC_PLUGIN2(PLUGIN, PLUGINCLASS)
-
-#endif
-
-QT_END_NAMESPACE
-
-QT_END_HEADER
-
-#endif // Q_PLUGIN_H
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/setup
deleted file mode 100644
index 68b84bf6e113..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXX0X/setup
+++ /dev/null
@@ -1,14 +0,0 @@
-QTDIR=/usr/lib64/qt-3.3
-LD_LIBRARY_PATH=/usr/local/packages/gcc-4.8/lib64
-CXX=/usr/local/packages/gcc-4.8/bin/g++
-CC=/usr/local/packages/gcc-4.8/bin/gcc
-
-BOOSTROOT=/home/lrineau/CGAL/boost/boost_1_57_0
-export BOOSTROOT
-
-export CXX CC
-export LD_LIBRARY_PATH QTDIR
-
-source /home/lrineau/infrastructure/reference-platforms/setup-common
-
-source /opt/intel/tbb/bin/tbbvars.sh intel64
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/CMakeCache.txt
deleted file mode 100644
index bcb5a746bdee..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/CMakeCache.txt
+++ /dev/null
@@ -1,2325 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build the doxygen documentation
-BUILD_DOC:BOOL=OFF
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/home/lrineau/CGAL/boost/boost-release-branch
-
-//Boost library directory DEBUG
-Boost_LIBRARY_DIR_DEBUG:PATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib
-
-//Boost library directory RELEASE
-Boost_LIBRARY_DIR_RELEASE:PATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_system-mt.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_system-mt.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_thread-mt.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_thread-mt.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -D_GLIBCXX_DEBUG -DGLIBCXX_DEBUG_MESSAGE_LENGTH=100 -Wall -frounding-math
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/src/Core
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_system-mt.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-4.0-Ic-251
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/src/ImageIO
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_system-mt.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libz.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALImageIO
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_system-mt.so;
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/src/Qt3
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_system-mt.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt3
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/src/Qt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_system-mt.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt4
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/lib64/ccache/c++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING= -frounding-math -Wall -D_GLIBCXX_DEBUG -DGLIBCXX_DEBUG_MESSAGE_LENGTH=100
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/lib64/ccache/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//Value Computed by CMake
-Documentation_BINARY_DIR:STATIC=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/doc
-
-//Value Computed by CMake
-Documentation_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/doc
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib64/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease-qt4
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate-qt4
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=QT_QWEBVIEW_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic-qt4
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//The directory containing a CMake configuration file for Qt5Core.
-Qt5Core_DIR:PATH=/usr/lib/cmake/Qt5Core
-
-//The directory containing a CMake configuration file for Qt5Gui.
-Qt5Gui_DIR:PATH=/usr/lib/cmake/Qt5Gui
-
-//The directory containing a CMake configuration file for Qt5OpenGL.
-Qt5OpenGL_DIR:PATH=/usr/lib/cmake/Qt5OpenGL
-
-//The directory containing a CMake configuration file for Qt5Svg.
-Qt5Svg_DIR:PATH=Qt5Svg_DIR-NOTFOUND
-
-//The directory containing a CMake configuration file for Qt5Widgets.
-Qt5Widgets_DIR:PATH=/usr/lib/cmake/Qt5Widgets
-
-//The directory containing a CMake configuration file for Qt5.
-Qt5_DIR:PATH=/usr/lib/cmake/Qt5
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Enable CGAL component CGAL_Qt5
-WITH_CGAL_Qt5:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib64/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=/usr/lib64/libxkbfile.so
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=X11_Xmu_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=X11_Xxf86vm_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_DEBUG
-Boost_LIBRARY_DIR_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_RELEASE
-Boost_LIBRARY_DIR_RELEASE-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_52
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=105200
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_thread-mt.so;/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib/libboost_system-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_DENORMALS_COMPILE_BUG
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_IEEE_754_BUG
-CGAL_CFG_IEEE_754_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_5
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_6
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_7
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_8
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_COPY_N:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_COPY_N_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_NEXT_PREV:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_NEXT_PREV_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=FALSE
-//Test CGAL_CFG_NO_LIMITS
-CGAL_CFG_NO_LIMITS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_NEXTAFTER
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_STL
-CGAL_CFG_NO_STL:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NUMERIC_LIMITS_BUG
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_USING_BASE_MEMBER_BUG_2
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-//Variable hidden from user
-CGAL_CGAL_LIBRARY:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/lib/libCGAL.so
-//Variable hidden from user
-CGAL_CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt5
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//MODIFIED property for variable: CGAL_CXX_FLAGS
-CGAL_CXX_FLAGS-MODIFIED:INTERNAL=ON
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Core_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=libCGAL_Core.so
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_ImageIO_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-CGAL_Qt5_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Qt5_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Qt5_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE;TAUCS
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//MODIFIED property for variable: CMAKE_BUILD_TYPE
-CMAKE_BUILD_TYPE-MODIFIED:INTERNAL=ON
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=4
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_CXX_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_C_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator platform.
-CMAKE_GENERATOR_PLATFORM:INTERNAL=
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//number of local generators
-CMAKE_NUMBER_OF_MAKEFILES:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL= -frounding-math -Wall -D_GLIBCXX_DEBUG -DGLIBCXX_DEBUG_MESSAGE_LENGTH=100
-//Variable hidden from user
-Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-ImageIO_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//Variable hidden from user
-Qt3_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-Qt4_LIBRARY_INSTALLED:INTERNAL=
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch
-//Last used Boost_LIBRARY_DIR_DEBUG value.
-_Boost_LIBRARY_DIR_DEBUG_LAST:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib
-//Last used Boost_LIBRARY_DIR_RELEASE value.
-_Boost_LIBRARY_DIR_RELEASE_LAST:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib
-//Last used Boost_NAMESPACE value.
-_Boost_NAMESPACE_LAST:INTERNAL=boost
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/initial.cmake b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/initial.cmake
deleted file mode 100644
index 762a6bc53219..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/initial.cmake
+++ /dev/null
@@ -1 +0,0 @@
-set(CMAKE_DISABLE_FIND_PACKAGE_OpenMesh TRUE CACHE BOOL "Disable OpenMesh")
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/setup
deleted file mode 100644
index 9423d0e44a84..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/setup
+++ /dev/null
@@ -1,18 +0,0 @@
-export QTDIR=/usr/lib64/qt-3.3
-source /home/lrineau/infrastructure/reference-platforms/setup-common
-
-CXXFLAGS="-D_GLIBCXX_DEBUG -DGLIBCXX_DEBUG_MESSAGE_LENGTH=100 -Wall"
-export CXXFLAGS
-
-#BOOST_ROOT=/home/lrineau/CGAL/boost/1.44-beta1
-#export BOOST_ROOT
-BOOST_INCLUDEDIR=/home/lrineau/CGAL/boost/boost-release-branch
-BOOST_LIBRARYDIR=/home/lrineau/CGAL/boost/boost-release-branch/stage-cxxdebug/lib
-export BOOST_LIBRARYDIR BOOST_INCLUDEDIR
-
-CXXFLAGS="-I$BOOST_INCLUDEDIR/include $CXXFLAGS"
-export CXXFLAGS
-
-# Workaround to pass options to cmake
-CMAKE_GENERATOR="-C/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_CXXDEBUG/initial.cmake"
-export CMAKE_GENERATOR
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/CMakeCache.txt
deleted file mode 100644
index 9cd0f2e9d735..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/CMakeCache.txt
+++ /dev/null
@@ -1,2464 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build the doxygen documentation
-BUILD_DOC:BOOL=OFF
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIR:PATH=/usr/lib64
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math -DCGAL_CFG_MATCHING_BUG_6
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/src/Core
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-I-125
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/src/ImageIO
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libz.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALImageIO
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/src/Qt3
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/lib/libCGAL.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt3
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/src/Qt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/lib/libCGAL.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt4
-
-//Dependencies for the target
-CGAL_Qt5_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;Qt5::OpenGL;general;Qt5::Svg;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/lib64/ccache/c++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING= -frounding-math -DCGAL_CFG_MATCHING_BUG_6
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/lib64/ccache/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=NO
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=FALSE
-
-//Value Computed by CMake
-Documentation_BINARY_DIR:STATIC=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/doc
-
-//Value Computed by CMake
-Documentation_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/doc
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib64/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-//Missing description
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-//Missing description
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib64/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a library.
-QT_DBUS_LIBRARY:FILEPATH=/lib64/libdbus-1.so
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib64/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib64/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/usr/lib64/libglib-2.0.so
-
-//Path to a library.
-QT_GOBJECT_LIBRARY:FILEPATH=/usr/lib64/libgobject-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/usr/lib64/libgthread-2.0.so
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease-qt4
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate-qt4
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib64/libpng.so
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib64/librt.so
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic-qt4
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib64/libm.so
-
-//Path to a library.
-QT_XCURSOR_LIBRARY:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a library.
-QT_XFIXES_LIBRARY:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a library.
-QT_XINERAMA_LIBRARY:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a library.
-QT_XI_LIBRARY:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a library.
-QT_XRANDR_LIBRARY:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-//The directory containing a CMake configuration file for Qt5Core.
-Qt5Core_DIR:PATH=/usr/lib64/cmake/Qt5Core
-
-//The directory containing a CMake configuration file for Qt5Gui.
-Qt5Gui_DIR:PATH=/usr/lib64/cmake/Qt5Gui
-
-//The directory containing a CMake configuration file for Qt5OpenGL.
-Qt5OpenGL_DIR:PATH=/usr/lib64/cmake/Qt5OpenGL
-
-//The directory containing a CMake configuration file for Qt5Svg.
-Qt5Svg_DIR:PATH=/usr/lib64/cmake/Qt5Svg
-
-//The directory containing a CMake configuration file for Qt5Widgets.
-Qt5Widgets_DIR:PATH=/usr/lib64/cmake/Qt5Widgets
-
-//The directory containing a CMake configuration file for Qt5.
-Qt5_DIR:PATH=/usr/lib64/cmake/Qt5
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Enable CGAL component CGAL_Qt5
-WITH_CGAL_Qt5:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib64/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=/usr/lib64/libxkbfile.so
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=/usr/lib64/libXmu.so
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=/usr/lib64/libXxf86vm.so
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR
-Boost_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_44
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=104400
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libboost_thread.so;/usr/lib64/libboost_system.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib64
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_DENORMALS_COMPILE_BUG
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_IEEE_754_BUG
-CGAL_CFG_IEEE_754_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_5
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_6
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_7
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_8
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_COPY_N:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_COPY_N_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_NEXT_PREV:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_NEXT_PREV_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=FALSE
-//Test CGAL_CFG_NO_LIMITS
-CGAL_CFG_NO_LIMITS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_NEXTAFTER
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_STL
-CGAL_CFG_NO_STL:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NUMERIC_LIMITS_BUG
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_USING_BASE_MEMBER_BUG_2
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-//Variable hidden from user
-CGAL_CGAL_LIBRARY:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/lib/libCGAL.so
-//Variable hidden from user
-CGAL_CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt5
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Core_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_ImageIO_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-CGAL_Qt5_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_Qt5_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so
-CGAL_Qt5_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Qt5_LIBRARY:INTERNAL=
-//ADVANCED property for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE;TAUCS
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//MODIFIED property for variable: CMAKE_BUILD_TYPE
-CMAKE_BUILD_TYPE-MODIFIED:INTERNAL=1
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=4
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 4
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/ccmake
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator platform.
-CMAKE_GENERATOR_PLATFORM:INTERNAL=
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//number of local generators
-CMAKE_NUMBER_OF_MAKEFILES:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL= -frounding-math -DCGAL_CFG_MATCHING_BUG_6
-//Variable hidden from user
-Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-ImageIO_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUS_LIBRARY
-QT_DBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GOBJECT_LIBRARY
-QT_GOBJECT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XCURSOR_LIBRARY
-QT_XCURSOR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XFIXES_LIBRARY
-QT_XFIXES_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XINERAMA_LIBRARY
-QT_XINERAMA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XI_LIBRARY
-QT_XI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRANDR_LIBRARY
-QT_XRANDR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//Variable hidden from user
-Qt3_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-Qt4_LIBRARY_INSTALLED:INTERNAL=
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/usr/include
-//Last used Boost_LIBRARY_DIR_DEBUG value.
-_Boost_LIBRARY_DIR_DEBUG_LAST:INTERNAL=/usr/lib64
-//Last used Boost_LIBRARY_DIR value.
-_Boost_LIBRARY_DIR_LAST:INTERNAL=/usr/lib64
-//Last used Boost_LIBRARY_DIR_RELEASE value.
-_Boost_LIBRARY_DIR_RELEASE_LAST:INTERNAL=/usr/lib64
-//Last used Boost_NAMESPACE value.
-_Boost_NAMESPACE_LAST:INTERNAL=boost
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/setup
deleted file mode 100644
index f9c78ade216e..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_MATCHING-BUG-6/setup
+++ /dev/null
@@ -1,2 +0,0 @@
-export QTDIR=/usr/lib64/qt-3.3
-source /home/lrineau/infrastructure/reference-platforms/setup-common
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/CMakeCache.txt
deleted file mode 100644
index 846d9915afd2..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/CMakeCache.txt
+++ /dev/null
@@ -1,2263 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build the doxygen documentation
-BUILD_DOC:BOOL=OFF
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/home/lrineau/CGAL/boost/boost-release-branch
-
-//Boost library directory
-Boost_LIBRARY_DIR:PATH=/home/lrineau/CGAL/boost/boost-release-branch/stage/lib
-
-//Boost library directory
-Boost_LIBRARY_DIRS:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage/lib
-
-//The Boost SYSTEM library
-Boost_SYSTEM_LIBRARY:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_system-mt.so
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_system-mt.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_system-mt.so
-
-//The Boost THREAD library
-Boost_THREAD_LIBRARY:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_thread-mt.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_thread-mt.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_thread-mt.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/Installation
-
-//Create CGAL from branch
-CGAL_BRANCH_BUILD:BOOL=ON
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//Script cgal_create_cmake_script, that creates CMakeLists.txt
-// files
-CGAL_CREATE_CMAKE_SCRIPT:FILEPATH=/home/lrineau/Git/cgal/Scripts/scripts/cgal_create_cmake_script
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/LEDA-6.4-openSuse-12.1-g++-4.6.2-64bit-multithread-evaluation/libleda.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_system-mt.so;
-
-CGAL_DISABLE_GMP:BOOL=ON
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Enable the special targets "check_pkg_headers", and "check_pkg_<package>_headers"
-// for each package
-CGAL_ENABLE_CHECK_HEADERS:BOOL=OFF
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-4.2-I-900
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/LEDA-6.4-openSuse-12.1-g++-4.6.2-64bit-multithread-evaluation/libleda.so;general;CGAL;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_system-mt.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;/usr/lib64/libz.so;
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/LEDA-6.4-openSuse-12.1-g++-4.6.2-64bit-multithread-evaluation/libleda.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_system-mt.so;
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/LEDA-6.4-openSuse-12.1-g++-4.6.2-64bit-multithread-evaluation/libleda.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_system-mt.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/LEDA-6.4-openSuse-12.1-g++-4.6.2-64bit-multithread-evaluation/libleda.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_system-mt.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Dependencies for the target
-CGAL_Qt5_LIB_DEPENDS:STATIC=general;/home/lrineau/CGAL/LEDA-6.4-openSuse-12.1-g++-4.6.2-64bit-multithread-evaluation/libleda.so;general;Qt5::OpenGL;general;Qt5::Svg;general;CGAL;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_system-mt.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Switch on to start (naive) detection of duplicate source- and
-// headerfiles in packages
-CGAL_REPORT_DUPLICATE_FILES:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/Git/cgal/Installation
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/lib64/ccache/c++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING= -frounding-math -ffriend-injection -fno-strict-aliasing
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DCGAL_NDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DCGAL_NDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/lib64/ccache/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DCGAL_NDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DCGAL_NDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=' '
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//User-defined flags
-CMAKE_MODULE_LINKER_FLAGS:STRING=  -lX11
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//User-defined flags
-CMAKE_SHARED_LINKER_FLAGS:STRING=  -lX11
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=OFF
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//git command line client
-GIT_EXECUTABLE:FILEPATH=/usr/bin/git
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib64/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//User-defined flags
-LEDA_CXX_FLAGS:STRING= -ffriend-injection -fno-strict-aliasing
-
-//Definitions for the LEDA library
-LEDA_DEFINITIONS:STRING=-DCGAL_LEDA_VERSION=640
-
-//The directory containing the LEDA header files WITHOUT the LEDA
-// prefix
-LEDA_INCLUDE_DIR:PATH=/home/lrineau/CGAL/LEDA-6.4-openSuse-12.1-g++-4.6.2-64bit-multithread-evaluation/incl
-
-//The LEDA library
-LEDA_LIBRARIES:FILEPATH=/home/lrineau/CGAL/LEDA-6.4-openSuse-12.1-g++-4.6.2-64bit-multithread-evaluation/libleda.so
-
-//The LEDA debug-mode libraries
-LEDA_LIBRARY_DEBUG:FILEPATH=
-
-//Path to the LEDA library
-LEDA_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/LEDA-6.4-openSuse-12.1-g++-4.6.2-64bit-multithread-evaluation/libleda.so
-
-//User-defined flags
-LEDA_LINKER_FLAGS:STRING= -lX11
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease-qt4
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate-qt4
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=QT_QWEBVIEW_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic-qt4
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//The directory containing a CMake configuration file for Qt5Core.
-Qt5Core_DIR:PATH=/usr/lib64/cmake/Qt5Core
-
-//The directory containing a CMake configuration file for Qt5Gui.
-Qt5Gui_DIR:PATH=/usr/lib64/cmake/Qt5Gui
-
-//The directory containing a CMake configuration file for Qt5OpenGL.
-Qt5OpenGL_DIR:PATH=/usr/lib64/cmake/Qt5OpenGL
-
-//The directory containing a CMake configuration file for Qt5Svg.
-Qt5Svg_DIR:PATH=/usr/lib64/cmake/Qt5Svg
-
-//The directory containing a CMake configuration file for Qt5Widgets.
-Qt5Widgets_DIR:PATH=/usr/lib64/cmake/Qt5Widgets
-
-//The directory containing a CMake configuration file for Qt5.
-Qt5_DIR:PATH=/usr/lib64/cmake/Qt5
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Enable CGAL component CGAL_Qt5
-WITH_CGAL_Qt5:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=OFF
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=OFF
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=ON
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=OFF
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=X11_XRes_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=X11_Xdmcp_INCLUDE_PATH-NOTFOUND
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=X11_Xdmcp_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=/usr/lib64/libxkbfile.so
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=/usr/lib64/libXmu.so
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=/usr/lib64/libXxf86vm.so
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR
-Boost_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIRS
-Boost_LIBRARY_DIRS-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_54
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY
-Boost_SYSTEM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY
-Boost_THREAD_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=105400
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_thread-mt.so;/home/lrineau/CGAL/boost/boost-release-branch/stage/lib/libboost_system-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_BRANCH_BUILD
-CGAL_BRANCH_BUILD-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-//Test CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_DENORMALS_COMPILE_BUG
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_IEEE_754_BUG
-CGAL_CFG_IEEE_754_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_5
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_6
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_7
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_8
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_LIMITS
-CGAL_CFG_NO_LIMITS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_NEXTAFTER
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_STL
-CGAL_CFG_NO_STL:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NUMERIC_LIMITS_BUG
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_USING_BASE_MEMBER_BUG_2
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt5
-//ADVANCED property for variable: CGAL_CORE_PACKAGE_DIR
-CGAL_CORE_PACKAGE_DIR-ADVANCED:INTERNAL=1
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/Git/cgal/Core
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Core_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//ADVANCED property for variable: CGAL_INSTALLATION_PACKAGE_DIR
-CGAL_INSTALLATION_PACKAGE_DIR-ADVANCED:INTERNAL=1
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/Git/cgal/Installation
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-CGAL_ImageIO_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//ADVANCED property for variable: CGAL_MAINTENANCE_PACKAGE_DIR
-CGAL_MAINTENANCE_PACKAGE_DIR-ADVANCED:INTERNAL=1
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/Git/cgal/Maintenance
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-CGAL_Qt5_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_Qt5_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt5_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Qt5_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE;TAUCS
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=0
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=2
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include pthread.h
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/Git/cgal
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=6
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL= -frounding-math -ffriend-injection -fno-strict-aliasing
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding GMP
-FIND_PACKAGE_MESSAGE_DETAILS_GMP:INTERNAL=[/usr/lib64/libgmp.so][/usr/include][v()]
-//Details about finding GMPXX
-FIND_PACKAGE_MESSAGE_DETAILS_GMPXX:INTERNAL=[/usr/lib64/libgmpxx.so][/usr/include][v()]
-//Details about finding MPFR
-FIND_PACKAGE_MESSAGE_DETAILS_MPFR:INTERNAL=[/usr/lib64/libmpfr.so][/usr/include][v()]
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Add -ffriend-injection on gcc >= 4.1
-LEDA_CGAL_FRIEND_INJECTION:INTERNAL=Using LEDA with gcc version 4.1 or later: Adding -ffriend-injection
-//Link against X11 on *nix
-LEDA_CGAL_LINK_X11:INTERNAL=Using LEDA with gcc on *nix: Adding -lX11
-//Add -fno-strict-aliasing on gcc >= 4.4
-LEDA_CGAL_NO_STRICT_ALIASING:INTERNAL=Using LEDA with gcc version 4.4 or later: Adding -fno-strict-aliasing
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch
-//Last used Boost_LIBRARY_DIR value.
-_Boost_LIBRARY_DIR_LAST:INTERNAL=/home/lrineau/CGAL/boost/boost-release-branch/stage/lib
-//Last used Boost_NAMESPACE value.
-_Boost_NAMESPACE_LAST:INTERNAL=boost
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/setup
deleted file mode 100644
index 60fb92f7e032..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release-LEDA/setup
+++ /dev/null
@@ -1,13 +0,0 @@
-export QTDIR=/usr/lib64/qt-3.3
-source /home/lrineau/infrastructure/reference-platforms/setup-common
-
-BOOST_ROOT=/home/lrineau/CGAL/boost/boost-release-branch
-export BOOST_ROOT
-
-CXXFLAGS=-I$BOOST_ROOT/include
-
-LEDA_DIR=/home/lrineau/CGAL/LEDA-6.4-openSuse-12.1-g++-4.6.2-64bit-multithread-evaluation
-export LEDA_DIR
-
-CGAL_DISABLE_GMP=1
-export CGAL_DISABLE_GMP
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/CMakeCache.txt
deleted file mode 100644
index 7c5e0c8b6dc1..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/CMakeCache.txt
+++ /dev/null
@@ -1,2476 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build the doxygen documentation
-BUILD_DOC:BOOL=OFF
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory DEBUG
-Boost_LIBRARY_DIR_DEBUG:PATH=/usr/lib64
-
-//Boost library directory RELEASE
-Boost_LIBRARY_DIR_RELEASE:PATH=/usr/lib64
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/src/Core
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-Ic-23
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/src/ImageIO
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libz.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALImageIO
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Dependencies for the target
-CGAL_Qt5_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;Qt5::OpenGL;general;Qt5::Svg;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/lib64/ccache/c++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING= -frounding-math
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DCGAL_NDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/lib64/ccache/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=OFF
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//Value Computed by CMake
-Documentation_BINARY_DIR:STATIC=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/doc
-
-//Value Computed by CMake
-Documentation_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/doc
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib64/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-OPENSSL_CRYPTO_LIBRARIES:FILEPATH=/usr/lib64/libcrypto.so
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_SSL_LIBRARIES:FILEPATH=/usr/lib64/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib64/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib64/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/usr/lib64/libglib-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/usr/lib64/libgthread-2.0.so
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-QT_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//The moc executable
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib64/libpng.so
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a file.
-QT_QT_INCLUDE_DIR:PATH=/usr/include/Qt
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib64/librt.so
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//The uic executable
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib64/libm.so
-
-//Path to a library.
-QT_XCURSOR_LIBRARY:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a library.
-QT_XFIXES_LIBRARY:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a library.
-QT_XINERAMA_LIBRARY:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a library.
-QT_XI_LIBRARY:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a library.
-QT_XRANDR_LIBRARY:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-//The directory containing a CMake configuration file for Qt5Core.
-Qt5Core_DIR:PATH=/usr/lib64/cmake/Qt5Core
-
-//The directory containing a CMake configuration file for Qt5Gui.
-Qt5Gui_DIR:PATH=/usr/lib64/cmake/Qt5Gui
-
-//The directory containing a CMake configuration file for Qt5OpenGL.
-Qt5OpenGL_DIR:PATH=/usr/lib64/cmake/Qt5OpenGL
-
-//The directory containing a CMake configuration file for Qt5Svg.
-Qt5Svg_DIR:PATH=/usr/lib64/cmake/Qt5Svg
-
-//The directory containing a CMake configuration file for Qt5Widgets.
-Qt5Widgets_DIR:PATH=/usr/lib64/cmake/Qt5Widgets
-
-//The directory containing a CMake configuration file for Qt5.
-Qt5_DIR:PATH=/usr/lib64/cmake/Qt5
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component PDB
-WITH_CGAL_PDB:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Enable CGAL component CGAL_Qt5
-WITH_CGAL_Qt5:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib64/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=/usr/lib64/libxkbfile.so
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=/usr/lib64/libXmu.so
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=/usr/lib64/libXxf86vm.so
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_PDB;CGAL_Qt3;CGAL_Qt4
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_DEBUG
-Boost_LIBRARY_DIR_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_RELEASE
-Boost_LIBRARY_DIR_RELEASE-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_55
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=105400
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libboost_thread.so;/usr/lib64/libboost_system.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib64
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=FALSE
-//Test CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_DENORMALS_COMPILE_BUG
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_IEEE_754_BUG
-CGAL_CFG_IEEE_754_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_5
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_6
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_7
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_8
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NET2003_MATCHING_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NET2003_MATCHING_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_COPY_N:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_COPY_N_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_NEXT_PREV:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_NEXT_PREV_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=FALSE
-//Test CGAL_CFG_NO_LIMITS
-CGAL_CFG_NO_LIMITS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_NEXTAFTER
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_STL
-CGAL_CFG_NO_STL:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NUMERIC_LIMITS_BUG
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_USING_BASE_MEMBER_BUG_2
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-//Variable hidden from user
-CGAL_CGAL_LIBRARY:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/lib/libCGAL.so
-//Variable hidden from user
-CGAL_CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt5
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Core_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Variable hidden from user
-CGAL_INSTALLED_CGAL_Core_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_INSTALLED_CGAL_ImageIO_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_INSTALLED_CGAL_LIBRARY:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_INSTALLED_CGAL_Qt3_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_INSTALLED_CGAL_Qt4_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_INSTALLED_Core_LIBRARY:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_INSTALLED_ImageIO_LIBRARY:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_INSTALLED_LIBRARY:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_INSTALLED_Qt3_LIBRARY:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_INSTALLED_Qt4_LIBRARY:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_ImageIO_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_PDB_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_PDB_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_PDB_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_PDB_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Variable hidden from user
-CGAL_PDB_LIBRARY_NAME:INTERNAL=libCGAL_PDB.so
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-CGAL_Qt5_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt5_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so
-CGAL_Qt5_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Qt5_LIBRARY:INTERNAL=
-//ADVANCED property for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE;TAUCS
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=4
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_CXX_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_C_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator platform.
-CMAKE_GENERATOR_PLATFORM:INTERNAL=
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//number of local generators
-CMAKE_NUMBER_OF_MAKEFILES:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL= -frounding-math
-//Variable hidden from user
-Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding OpenSSL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenSSL:INTERNAL=[/usr/lib64/libssl.so;/usr/lib64/libcrypto.so][/usr/include]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-ImageIO_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_CRYPTO_LIBRARIES
-OPENSSL_CRYPTO_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_SSL_LIBRARIES
-OPENSSL_SSL_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_INCLUDE_DIR
-QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT_INCLUDE_DIR
-QT_QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XCURSOR_LIBRARY
-QT_XCURSOR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XFIXES_LIBRARY
-QT_XFIXES_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XINERAMA_LIBRARY
-QT_XINERAMA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XI_LIBRARY
-QT_XI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRANDR_LIBRARY
-QT_XRANDR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//Variable hidden from user
-Qt3_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-Qt4_LIBRARY_INSTALLED:INTERNAL=
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/usr/include
-//Last used Boost_LIBRARY_DIR_DEBUG value.
-_Boost_LIBRARY_DIR_DEBUG_LAST:INTERNAL=/usr/lib64
-//Last used Boost_LIBRARY_DIR_RELEASE value.
-_Boost_LIBRARY_DIR_RELEASE_LAST:INTERNAL=/usr/lib64
-//Last used Boost_NAMESPACE value.
-_Boost_NAMESPACE_LAST:INTERNAL=boost
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/setup
deleted file mode 100644
index 4897488c1e5d..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_Release/setup
+++ /dev/null
@@ -1,5 +0,0 @@
-export QTDIR=/usr/lib64/qt-3.3
-source /home/lrineau/infrastructure/reference-platforms/setup-common
-
-PATH=/home/lrineau/bin/cmake-2.8:$PATH
-export PATH
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/CMakeCache.txt
deleted file mode 100644
index 15b516aafbef..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/CMakeCache.txt
+++ /dev/null
@@ -1,2506 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build the doxygen documentation
-BUILD_DOC:BOOL=OFF
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIR:PATH=/usr/lib64
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math -std=c++98 -Wall -pedantic-errors -Wno-long-long -Wno-variadic-macros -fdiagnostics-show-option
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/src/Core
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-I
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/src/ImageIO
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libz.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALImageIO
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Value Computed by CMake
-CGAL_PDB_BINARY_DIR:STATIC=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/src/CGALPDB
-
-//The CGAL_PDB library
-CGAL_PDB_LIBRARY:STRING=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/lib/libCGAL_PDB.so
-
-//Dependencies for the target
-CGAL_PDB_LIB_DEPENDS:STATIC=general;/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/lib/libCGAL.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread-mt.so;general;/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/lib/libCGAL.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread-mt.so;
-
-//Value Computed by CMake
-CGAL_PDB_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALPDB
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/src/Qt3
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/lib/libCGAL.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt3
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/src/Qt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/lib/libCGAL.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt4
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=3
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=3.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/lib64/ccache/c++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING= -frounding-math -std=c++98 -ansi -Wall -pedantic -Wno-long-long -Wno-variadic-macros -pedantic-errors -fdiagnostics-show-option
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/lib64/ccache/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=OFF
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//Value Computed by CMake
-Documentation_BINARY_DIR:STATIC=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/doc
-
-//Value Computed by CMake
-Documentation_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/doc
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib64/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-//Missing description
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-//Missing description
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a library.
-OPENSSL_CRYPTO_LIBRARIES:FILEPATH=OPENSSL_CRYPTO_LIBRARIES-NOTFOUND
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib64/libssl.so
-
-//Path to a file.
-OPENSSL_ROOT_DIR:PATH=/usr
-
-//Path to a library.
-OPENSSL_SSL_LIBRARIES:FILEPATH=OPENSSL_SSL_LIBRARIES-NOTFOUND
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib64/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib64/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/usr/lib64/libglib-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/usr/lib64/libgthread-2.0.so
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Missing description
-QT_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//The moc executable
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib64/libpng.so
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a file.
-QT_QT_INCLUDE_DIR:PATH=/usr/include/Qt
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib64/librt.so
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//The uic executable
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib64/libm.so
-
-//Path to a library.
-QT_XCURSOR_LIBRARY:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a library.
-QT_XFIXES_LIBRARY:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a library.
-QT_XINERAMA_LIBRARY:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a library.
-QT_XI_LIBRARY:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a library.
-QT_XRANDR_LIBRARY:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-//The directory containing a CMake configuration file for Qt5Core.
-Qt5Core_DIR:PATH=/usr/lib/cmake/Qt5Core
-
-//The directory containing a CMake configuration file for Qt5Gui.
-Qt5Gui_DIR:PATH=/usr/lib/cmake/Qt5Gui
-
-//The directory containing a CMake configuration file for Qt5OpenGL.
-Qt5OpenGL_DIR:PATH=/usr/lib/cmake/Qt5OpenGL
-
-//The directory containing a CMake configuration file for Qt5Svg.
-Qt5Svg_DIR:PATH=Qt5Svg_DIR-NOTFOUND
-
-//The directory containing a CMake configuration file for Qt5Widgets.
-Qt5Widgets_DIR:PATH=/usr/lib/cmake/Qt5Widgets
-
-//The directory containing a CMake configuration file for Qt5.
-Qt5_DIR:PATH=/usr/lib/cmake/Qt5
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component PDB
-WITH_CGAL_PDB:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Enable CGAL component CGAL_Qt5
-WITH_CGAL_Qt5:BOOL=ON
-
-//Create package generation rules
-WITH_CPACK:BOOL=OFF
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib64/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=/usr/lib64/libxkbfile.so
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=/usr/lib64/libXmu.so
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=/usr/lib64/libXxf86vm.so
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR
-Boost_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_47
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=104700
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libboost_thread.so;/usr/lib64/libboost_system.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib64
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=FALSE
-//Test CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_DENORMALS_COMPILE_BUG
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_IEEE_754_BUG
-CGAL_CFG_IEEE_754_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_5
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_6
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_7
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_8
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NET2003_MATCHING_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NET2003_MATCHING_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_COPY_N:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_COPY_N_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_NEXT_PREV:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_NEXT_PREV_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=FALSE
-//Test CGAL_CFG_NO_LIMITS
-CGAL_CFG_NO_LIMITS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_NEXTAFTER
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_STL
-CGAL_CFG_NO_STL:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=FALSE
-//Test CGAL_CFG_NUMERIC_LIMITS_BUG
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_USING_BASE_MEMBER_BUG_2
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-//Variable hidden from user
-CGAL_CGAL_LIBRARY:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/lib/libCGAL.so
-//Variable hidden from user
-CGAL_CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt5
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Core_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=libCGAL_Core.so
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_ImageIO_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_PDB_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_PDB_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_PDB_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_PDB_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_PDB_LIBRARY
-CGAL_PDB_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_PDB_LIBRARY_NAME:INTERNAL=libCGAL_PDB.so
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-CGAL_Qt5_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Qt5_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Qt5_LIBRARY:INTERNAL=
-//ADVANCED property for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE;TAUCS
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=4
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 4
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator platform.
-CMAKE_GENERATOR_PLATFORM:INTERNAL=
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//number of local generators
-CMAKE_NUMBER_OF_MAKEFILES:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL= -frounding-math -std=c++98 -ansi -Wall -pedantic -Wno-long-long -Wno-variadic-macros -pedantic-errors -fdiagnostics-show-option
-//Variable hidden from user
-Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-ImageIO_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_CRYPTO_LIBRARIES
-OPENSSL_CRYPTO_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_ROOT_DIR
-OPENSSL_ROOT_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_SSL_LIBRARIES
-OPENSSL_SSL_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_INCLUDE_DIR
-QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT_INCLUDE_DIR
-QT_QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XCURSOR_LIBRARY
-QT_XCURSOR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XFIXES_LIBRARY
-QT_XFIXES_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XINERAMA_LIBRARY
-QT_XINERAMA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XI_LIBRARY
-QT_XI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRANDR_LIBRARY
-QT_XRANDR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//Variable hidden from user
-Qt3_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-Qt4_LIBRARY_INSTALLED:INTERNAL=
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/usr/include
-//Last used Boost_LIBRARY_DIR_DEBUG value.
-_Boost_LIBRARY_DIR_DEBUG_LAST:INTERNAL=/usr/lib64
-//Last used Boost_LIBRARY_DIR value.
-_Boost_LIBRARY_DIR_LAST:INTERNAL=/usr/lib64
-//Last used Boost_LIBRARY_DIR_RELEASE value.
-_Boost_LIBRARY_DIR_RELEASE_LAST:INTERNAL=/usr/lib64
-//Last used Boost_NAMESPACE value.
-_Boost_NAMESPACE_LAST:INTERNAL=boost
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/initial.cmake b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/initial.cmake
deleted file mode 100644
index 5d69fadd49f9..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/initial.cmake
+++ /dev/null
@@ -1 +0,0 @@
-set(CMAKE_DISABLE_FIND_PACKAGE_VTK TRUE CACHE BOOL "Disable VTK with -ansi")
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/setup
deleted file mode 100644
index 20dc529bae12..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/setup
+++ /dev/null
@@ -1,6 +0,0 @@
-export QTDIR=/usr/lib64/qt-3.3
-source /home/lrineau/infrastructure/reference-platforms/setup-common
-
-# Workaround to pass options to cmake
-CMAKE_GENERATOR="-C/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_ansi/initial.cmake"
-export CMAKE_GENERATOR
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/CMakeCache.txt
deleted file mode 100644
index 0c6cf35cdd04..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/CMakeCache.txt
+++ /dev/null
@@ -1,2255 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//The directory containing a CMake configuration file for Boost.
-Boost_DIR:PATH=Boost_DIR-NOTFOUND
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory
-Boost_LIBRARY_DIRS:FILEPATH=/usr/lib
-
-//The Boost SYSTEM library
-Boost_SYSTEM_LIBRARY:FILEPATH=/usr/lib/libboost_system.so
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib/libboost_system.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_system.so
-
-//The Boost THREAD library
-Boost_THREAD_LIBRARY:FILEPATH=/usr/lib/libboost_thread.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib/libboost_thread.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib/libboost_thread.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//Directory containing the Maintenance package
-CGAL_CORE_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING=-m32 -frounding-math
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/src/Core
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/lib/libCGAL.so;general;/usr/lib/libboost_thread.so;general;/usr/lib/libboost_system.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.8-I-176
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/src/ImageIO
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/lib/libCGAL.so;general;/usr/lib/libboost_thread.so;general;/usr/lib/libboost_system.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;general;/usr/lib/libz.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALImageIO
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/usr/lib/libboost_thread.so;general;/usr/lib/libboost_system.so;
-
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/src/Qt3
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/lib/libCGAL.so;general;/usr/lib/libboost_thread.so;general;/usr/lib/libboost_system.so;general;/usr/lib/qt-3.3/lib/libqassistantclient.a;general;/usr/lib/qt-3.3/lib/libqt-mt.so;general;dl;general;-lpthread;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt3
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/src/Qt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib/libmpfr.so;general;/usr/lib/libgmpxx.so;general;/usr/lib/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/lib/libCGAL.so;general;/usr/lib/libboost_thread.so;general;/usr/lib/libboost_system.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib/libGLU.so;general;/usr/lib/libGL.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt4
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=7
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=7.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/lib64/ccache/c++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-m32 -frounding-math
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/lib64/ccache/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=-m32
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib/libgmp.so
-
-//Missing description
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib/libmpfr.so
-
-//Missing description
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//path to qt3 include directory
-QT3_INCLUDE_DIR:PATH=/usr/lib/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease-qt4
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate-qt4
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//Path to a program.
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc-qt4
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//(This variable does not exist and should not be used)
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//Path to a program.
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic-qt4
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=X11_ICE_LIB-NOTFOUND
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=X11_SM_LIB-NOTFOUND
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=X11_X11_LIB-NOTFOUND
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=X11_XTest_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=X11_Xau_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=X11_Xcomposite_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=X11_Xcursor_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=X11_Xdamage_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=X11_Xdmcp_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=X11_Xext_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=X11_Xfixes_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=X11_Xft_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=X11_Xi_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=X11_Xinerama_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=X11_Xinput_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=X11_Xkbfile_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=X11_Xmu_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=X11_Xpm_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=X11_Xrandr_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=X11_Xrender_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=X11_Xscreensaver_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=X11_Xt_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=X11_Xv_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=X11_Xxf86misc_LIB-NOTFOUND
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=X11_Xxf86vm_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIRS
-Boost_LIBRARY_DIRS-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_47
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY
-Boost_SYSTEM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY
-Boost_THREAD_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=104700
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libboost_thread.so;/usr/lib/libboost_system.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_COPY_N:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_COPY_N_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_NEXT_PREV:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_NEXT_PREV_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-//Variable hidden from user
-CGAL_CGAL_LIBRARY:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/lib/libCGAL.so
-//Variable hidden from user
-CGAL_CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4;Core;ImageIO;Qt3;Qt4
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=libCGAL_Core.so
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/libGLU.so;/usr/lib/libGL.so;/usr/lib/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib/qt-3.3/lib/libqassistantclient.a;/usr/lib/qt-3.3/lib/libqt-mt.so;dl;-lpthread;/usr/lib/libGLU.so;/usr/lib/libGL.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib/libGLU.so;/usr/lib/libGL.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-//ADVANCED property for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;TAUCS;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=8
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 4
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_CXX_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_C_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL=-m32 -frounding-math
-//Variable hidden from user
-Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib/libGL.so][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib/libz.so][/usr/include][v1.2.5()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-ImageIO_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=
-//Variable hidden from user
-Qt3_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-Qt4_LIBRARY_INSTALLED:INTERNAL=
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//MODIFIED property for variable: WITH_CGAL_ImageIO
-WITH_CGAL_ImageIO-MODIFIED:INTERNAL=ON
-//MODIFIED property for variable: WITH_CGAL_Qt3
-WITH_CGAL_Qt3-MODIFIED:INTERNAL=ON
-//MODIFIED property for variable: WITH_CGAL_Qt4
-WITH_CGAL_Qt4-MODIFIED:INTERNAL=ON
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library dnet
-X11_LIB_DNET_HAS_DNET_NTOA:INTERNAL=
-//Have library dnet_stub
-X11_LIB_DNET_STUB_HAS_DNET_NTOA:INTERNAL=
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/setup
deleted file mode 100644
index cd2f9c898473..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-4.8_m32/setup
+++ /dev/null
@@ -1,8 +0,0 @@
-export QTDIR=/usr/lib/qt-3.3
-
-CXXFLAGS=-m32
-CFLAGS=-m32
-export CXXFLAGS
-export CFLAGS
-
-source /home/lrineau/infrastructure/reference-platforms/setup-common-headers-only
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/CMakeCache.txt
deleted file mode 100644
index a1abc0f6eec4..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/CMakeCache.txt
+++ /dev/null
@@ -1,2384 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUI's for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//The directory containing a CMake configuration file for Boost.
-Boost_DIR:PATH=Boost_DIR-NOTFOUND
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/home/lrineau/CGAL/boost/1.48/include
-
-//Boost library directory
-Boost_LIBRARY_DIRS:FILEPATH=/home/lrineau/CGAL/boost/1.48/lib
-
-//The Boost SYSTEM library
-Boost_SYSTEM_LIBRARY:FILEPATH=/home/lrineau/CGAL/boost/1.48/lib/libboost_system-mt.so
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/1.48/lib/libboost_system-mt.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/1.48/lib/libboost_system-mt.so
-
-//The Boost THREAD library
-Boost_THREAD_LIBRARY:FILEPATH=/home/lrineau/CGAL/boost/1.48/lib/libboost_thread-mt.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/home/lrineau/CGAL/boost/1.48/lib/libboost_thread-mt.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/home/lrineau/CGAL/boost/1.48/lib/libboost_thread-mt.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//Directory containing the Maintenance package
-CGAL_CORE_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -frounding-math -std=c++11
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/src/Core
-
-//The CGAL_Core library
-CGAL_Core_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/lib/libCGAL_Core.so
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.48/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.48/lib/libboost_system-mt.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-I-102
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/src/ImageIO
-
-//The CGAL_ImageIO library
-CGAL_ImageIO_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/lib/libCGAL_ImageIO.so
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.48/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.48/lib/libboost_system-mt.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;/usr/lib64/libz.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALImageIO
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/CGAL/boost/1.48/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.48/lib/libboost_system-mt.so;
-
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:PATH=/home/lrineau/CGAL/CGAL-I
-
-//Value Computed by CMake
-CGAL_Qt3_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/src/Qt3
-
-//The CGAL_Qt3 library
-CGAL_Qt3_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/lib/libCGAL_Qt3.so
-
-//Dependencies for the target
-CGAL_Qt3_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.48/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.48/lib/libboost_system-mt.so;general;/usr/lib64/qt-3.3/lib/libqassistantclient.a;general;/usr/lib64/qt-3.3/lib/libqt-mt.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;general;dl;general;-lpthread;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt3_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt3
-
-//Value Computed by CMake
-CGAL_Qt4_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/src/Qt4
-
-//The CGAL_Qt4 library
-CGAL_Qt4_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/lib/libCGAL_Qt4.so
-
-//Dependencies for the target
-CGAL_Qt4_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/lib/libCGAL.so;general;/home/lrineau/CGAL/boost/1.48/lib/libboost_thread-mt.so;general;/home/lrineau/CGAL/boost/1.48/lib/libboost_system-mt.so;optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libSM.so;general;/usr/lib64/libICE.so;general;/usr/lib64/libX11.so;general;/usr/lib64/libXext.so;
-
-//Value Computed by CMake
-CGAL_Qt4_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALQt4
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Debug
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/local/packages/gcc-trunk/bin/g++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING= -I/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/patch-qt-4.8 -frounding-math -std=c++11
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/local/packages/gcc-trunk/bin/gcc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=NO
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib64/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-//Missing description
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-//Missing description
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib64/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a library.
-QT_DBUS_LIBRARY:FILEPATH=/lib64/libdbus-1.so
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib64/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib64/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/usr/lib64/libglib-2.0.so
-
-//Path to a library.
-QT_GOBJECT_LIBRARY:FILEPATH=/usr/lib64/libgobject-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/usr/lib64/libgthread-2.0.so
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-//Missing description
-QT_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//The moc executable
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib64/libpng.so
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a file.
-QT_QT_INCLUDE_DIR:PATH=/usr/include/Qt
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib64/librt.so
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//The uic executable
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib64/libm.so
-
-//Path to a library.
-QT_XCURSOR_LIBRARY:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a library.
-QT_XFIXES_LIBRARY:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a library.
-QT_XINERAMA_LIBRARY:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a library.
-QT_XI_LIBRARY:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a library.
-QT_XRANDR_LIBRARY:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib64/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=X11_Xi_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=X11_Xkbfile_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=X11_Xmu_LIB-NOTFOUND
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=X11_Xxf86vm_LIB-NOTFOUND
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIRS
-Boost_LIBRARY_DIRS-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_48
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY
-Boost_SYSTEM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY
-Boost_THREAD_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=104800
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/home/lrineau/CGAL/boost/1.48/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/home/lrineau/CGAL/boost/1.48/lib/libboost_thread-mt.so;/home/lrineau/CGAL/boost/1.48/lib/libboost_system-mt.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/home/lrineau/CGAL/boost/1.48/lib
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_IEEE_754_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_COPY_N:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_COPY_N_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_NEXT_PREV:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_NEXT_PREV_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LIMITS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STL:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-//Variable hidden from user
-CGAL_CGAL_LIBRARY:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/lib/libCGAL.so
-//Variable hidden from user
-CGAL_CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_Qt3;CGAL_Qt4;Core;ImageIO;Qt3;Qt4
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Core_LIBRARY
-CGAL_Core_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_ImageIO_LIBRARY
-CGAL_ImageIO_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt3_LIBRARY
-CGAL_Qt3_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//ADVANCED property for variable: CGAL_Qt4_LIBRARY
-CGAL_Qt4_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-//ADVANCED property for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;TAUCS;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BUILD_TOOL
-CMAKE_BUILD_TOOL-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=2
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=8
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=8
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 4
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_CXX_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-CMAKE_C_COMPILER_WORKS:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL= -I/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/patch-qt-4.8 -frounding-math -std=c++11
-//Variable hidden from user
-Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include;/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.5()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-ImageIO_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUS_LIBRARY
-QT_DBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GOBJECT_LIBRARY
-QT_GOBJECT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_INCLUDE_DIR
-QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LIBRARY_DIR
-QT_LIBRARY_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT_INCLUDE_DIR
-QT_QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XCURSOR_LIBRARY
-QT_XCURSOR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XFIXES_LIBRARY
-QT_XFIXES_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XINERAMA_LIBRARY
-QT_XINERAMA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XI_LIBRARY
-QT_XI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRANDR_LIBRARY
-QT_XRANDR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//Variable hidden from user
-Qt3_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-Qt4_LIBRARY_INSTALLED:INTERNAL=
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/patch-qt-4.8/QtCore/qobjectdefs.h b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/patch-qt-4.8/QtCore/qobjectdefs.h
deleted file mode 100644
index 1b633566c738..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/patch-qt-4.8/QtCore/qobjectdefs.h
+++ /dev/null
@@ -1,506 +0,0 @@
-/****************************************************************************
-**
-** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
-** All rights reserved.
-** Contact: Nokia Corporation (qt-info@nokia.com)
-**
-** This file is part of the QtCore module of the Qt Toolkit.
-**
-** $QT_BEGIN_LICENSE:LGPL$
-** GNU Lesser General Public License Usage
-** This file may be used under the terms of the GNU Lesser General Public
-** License version 2.1 as published by the Free Software Foundation and
-** appearing in the file LICENSE.LGPL included in the packaging of this
-** file. Please review the following information to ensure the GNU Lesser
-** General Public License version 2.1 requirements will be met:
-** https://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
-**
-** In addition, as a special exception, Nokia gives you certain additional
-** rights. These rights are described in the Nokia Qt LGPL Exception
-** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
-**
-** GNU General Public License Usage
-** Alternatively, this file may be used under the terms of the GNU General
-** Public License version 3.0 as published by the Free Software Foundation
-** and appearing in the file LICENSE.GPL included in the packaging of this
-** file. Please review the following information to ensure the GNU General
-** Public License version 3.0 requirements will be met:
-** https://www.gnu.org/licenses/gpl-3.0.html.
-**
-** Other Usage
-** Alternatively, this file may be used in accordance with the terms and
-** conditions contained in a signed written agreement between you and Nokia.
-**
-**
-**
-**
-**
-** $QT_END_LICENSE$
-**
-****************************************************************************/
-
-#ifndef QOBJECTDEFS_H
-#define QOBJECTDEFS_H
-
-#include <QtCore/qnamespace.h>
-
-QT_BEGIN_HEADER
-
-QT_BEGIN_NAMESPACE
-
-QT_MODULE(Core)
-
-class QByteArray;
-
-class QString;
-
-#ifndef Q_MOC_OUTPUT_REVISION
-#define Q_MOC_OUTPUT_REVISION 63
-#endif
-
-// The following macros are our "extensions" to C++
-// They are used, strictly speaking, only by the moc.
-
-#ifndef Q_MOC_RUN
-# if defined(QT_NO_KEYWORDS)
-#  define QT_NO_EMIT
-# else
-#   define slots
-#   define signals protected
-# endif
-# define Q_SLOTS
-# define Q_SIGNALS protected
-# define Q_PRIVATE_SLOT(d, signature)
-# define Q_EMIT
-#ifndef QT_NO_EMIT
-# define emit
-#endif
-#define Q_CLASSINFO(name, value)
-#define Q_INTERFACES(x)
-#define Q_PROPERTY(text)
-#define Q_PRIVATE_PROPERTY(d, text)
-#define Q_REVISION(v)
-#define Q_OVERRIDE(text)
-#define Q_ENUMS(x)
-#define Q_FLAGS(x)
-#ifdef QT3_SUPPORT
-# define Q_SETS(x)
-#endif
-#define Q_SCRIPTABLE
-#define Q_INVOKABLE
-#define Q_SIGNAL
-#define Q_SLOT
-
-#ifndef QT_NO_TRANSLATION
-# ifndef QT_NO_TEXTCODEC
-// full set of tr functions
-// ### Qt 5: merge overloads
-#  define QT_TR_FUNCTIONS \
-    static inline QString tr(const char *s, const char *c = 0) \
-        { return staticMetaObject.tr(s, c); } \
-    static inline QString trUtf8(const char *s, const char *c = 0) \
-        { return staticMetaObject.trUtf8(s, c); } \
-    static inline QString tr(const char *s, const char *c, int n) \
-        { return staticMetaObject.tr(s, c, n); } \
-    static inline QString trUtf8(const char *s, const char *c, int n) \
-        { return staticMetaObject.trUtf8(s, c, n); }
-# else
-// no QTextCodec, no utf8
-// ### Qt 5: merge overloads
-#  define QT_TR_FUNCTIONS \
-    static inline QString tr(const char *s, const char *c = 0) \
-        { return staticMetaObject.tr(s, c); } \
-    static inline QString tr(const char *s, const char *c, int n) \
-        { return staticMetaObject.tr(s, c, n); }
-# endif
-#else
-// inherit the ones from QObject
-# define QT_TR_FUNCTIONS
-#endif
-
-#if defined(QT_NO_QOBJECT_CHECK)
-/* tmake ignore Q_OBJECT */
-#define Q_OBJECT_CHECK
-#else
-
-/* This is a compile time check that ensures that any class cast with qobject_cast
-   actually contains a Q_OBJECT macro. Note: qobject_cast will fail if a QObject
-   subclass doesn't contain Q_OBJECT.
-
-   In qt_check_for_QOBJECT_macro, we call a dummy templated function with two
-   parameters, the first being "this" and the other the target of the qobject
-   cast. If the types are not identical, we know that a Q_OBJECT macro is missing.
-
-   If you get a compiler error here, make sure that the class you are casting
-   to contains a Q_OBJECT macro.
-*/
-
-/* tmake ignore Q_OBJECT */
-#define Q_OBJECT_CHECK \
-    template <typename T> inline void qt_check_for_QOBJECT_macro(const T &_q_argument) const \
-    { int i = qYouForgotTheQ_OBJECT_Macro(this, &_q_argument); i = i; }
-
-template <typename T>
-inline int qYouForgotTheQ_OBJECT_Macro(T, T) { return 0; }
-
-template <typename T1, typename T2>
-inline void qYouForgotTheQ_OBJECT_Macro(T1, T2) {}
-#endif // QT_NO_QOBJECT_CHECK
-
-#ifdef Q_NO_DATA_RELOCATION
-#define Q_OBJECT_GETSTATICMETAOBJECT static const QMetaObject &getStaticMetaObject();
-#else
-#define Q_OBJECT_GETSTATICMETAOBJECT
-#endif
-
-/* tmake ignore Q_OBJECT */
-#define Q_OBJECT \
-public: \
-    Q_OBJECT_CHECK \
-    static const QMetaObject staticMetaObject; \
-    Q_OBJECT_GETSTATICMETAOBJECT \
-    virtual const QMetaObject *metaObject() const; \
-    virtual void *qt_metacast(const char *); \
-    QT_TR_FUNCTIONS \
-    virtual int qt_metacall(QMetaObject::Call, int, void **); \
-private: \
-    Q_DECL_HIDDEN static const QMetaObjectExtraData staticMetaObjectExtraData; \
-    Q_DECL_HIDDEN static void qt_static_metacall(QObject *, QMetaObject::Call, int, void **);
-
-/* tmake ignore Q_OBJECT */
-#define Q_OBJECT_FAKE Q_OBJECT
-/* tmake ignore Q_GADGET */
-#define Q_GADGET \
-public: \
-    static const QMetaObject staticMetaObject; \
-    Q_OBJECT_GETSTATICMETAOBJECT \
-private:
-#else // Q_MOC_RUN
-#define slots slots
-#define signals signals
-#define Q_SLOTS Q_SLOTS
-#define Q_SIGNALS Q_SIGNALS
-#define Q_CLASSINFO(name, value) Q_CLASSINFO(name, value)
-#define Q_INTERFACES(x) Q_INTERFACES(x)
-#define Q_PROPERTY(text) Q_PROPERTY(text)
-#define Q_PRIVATE_PROPERTY(d, text) Q_PRIVATE_PROPERTY(d, text)
-#define Q_REVISION(v) Q_REVISION(v)
-#define Q_OVERRIDE(text) Q_OVERRIDE(text)
-#define Q_ENUMS(x) Q_ENUMS(x)
-#define Q_FLAGS(x) Q_FLAGS(x)
-#ifdef QT3_SUPPORT
-# define Q_SETS(x) Q_SETS(x)
-#endif
- /* tmake ignore Q_OBJECT */
-#define Q_OBJECT Q_OBJECT
- /* tmake ignore Q_OBJECT */
-#define Q_OBJECT_FAKE Q_OBJECT_FAKE
- /* tmake ignore Q_GADGET */
-#define Q_GADGET Q_GADGET
-#define Q_SCRIPTABLE Q_SCRIPTABLE
-#define Q_INVOKABLE Q_INVOKABLE
-#define Q_SIGNAL Q_SIGNAL
-#define Q_SLOT Q_SLOT
-#endif //Q_MOC_RUN
-
-// macro for onaming members
-#ifdef METHOD
-#undef METHOD
-#endif
-#ifdef SLOT
-#undef SLOT
-#endif
-#ifdef SIGNAL
-#undef SIGNAL
-#endif
-
-Q_CORE_EXPORT const char *qFlagLocation(const char *method);
-
-#define QTOSTRING_HELPER(s) #s
-#define QTOSTRING(s) QTOSTRING_HELPER(s)
-#ifndef QT_NO_DEBUG
-# define QLOCATION "\0" __FILE__ ":" QTOSTRING(__LINE__)
-# ifndef QT_NO_KEYWORDS
-#  define METHOD(a)   qFlagLocation("0"#a QLOCATION)
-# endif
-# define SLOT(a)     qFlagLocation("1"#a QLOCATION)
-# define SIGNAL(a)   qFlagLocation("2"#a QLOCATION)
-#else
-# ifndef QT_NO_KEYWORDS
-#  define METHOD(a)   "0"#a
-# endif
-# define SLOT(a)     "1"#a
-# define SIGNAL(a)   "2"#a
-#endif
-
-#ifdef QT3_SUPPORT
-#define METHOD_CODE   0                        // member type codes
-#define SLOT_CODE     1
-#define SIGNAL_CODE   2
-#endif
-
-#define QMETHOD_CODE  0                        // member type codes
-#define QSLOT_CODE    1
-#define QSIGNAL_CODE  2
-
-#define Q_ARG(type, data) QArgument<type >(#type, data)
-#define Q_RETURN_ARG(type, data) QReturnArgument<type >(#type, data)
-
-class QObject;
-class QMetaMethod;
-class QMetaEnum;
-class QMetaProperty;
-class QMetaClassInfo;
-
-
-class Q_CORE_EXPORT QGenericArgument
-{
-public:
-    inline QGenericArgument(const char *aName = 0, const void *aData = 0)
-        : _data(aData), _name(aName) {}
-    inline void *data() const { return const_cast<void *>(_data); }
-    inline const char *name() const { return _name; }
-
-private:
-    const void *_data;
-    const char *_name;
-};
-
-class Q_CORE_EXPORT QGenericReturnArgument: public QGenericArgument
-{
-public:
-    inline QGenericReturnArgument(const char *aName = 0, void *aData = 0)
-        : QGenericArgument(aName, aData)
-        {}
-};
-
-template <class T>
-class QArgument: public QGenericArgument
-{
-public:
-    inline QArgument(const char *aName, const T &aData)
-        : QGenericArgument(aName, static_cast<const void *>(&aData))
-        {}
-};
-template <class T>
-class QArgument<T &>: public QGenericArgument
-{
-public:
-    inline QArgument(const char *aName, T &aData)
-        : QGenericArgument(aName, static_cast<const void *>(&aData))
-        {}
-};
-
-
-template <typename T>
-class QReturnArgument: public QGenericReturnArgument
-{
-public:
-    inline QReturnArgument(const char *aName, T &aData)
-        : QGenericReturnArgument(aName, static_cast<void *>(&aData))
-        {}
-};
-
-struct Q_CORE_EXPORT QMetaObject
-{
-    const char *className() const;
-    const QMetaObject *superClass() const;
-
-    QObject *cast(QObject *obj) const;
-    const QObject *cast(const QObject *obj) const;
-
-#ifndef QT_NO_TRANSLATION
-    // ### Qt 4: Merge overloads
-    QString tr(const char *s, const char *c) const;
-    QString trUtf8(const char *s, const char *c) const;
-    QString tr(const char *s, const char *c, int n) const;
-    QString trUtf8(const char *s, const char *c, int n) const;
-#endif // QT_NO_TRANSLATION
-
-    int methodOffset() const;
-    int enumeratorOffset() const;
-    int propertyOffset() const;
-    int classInfoOffset() const;
-
-    int constructorCount() const;
-    int methodCount() const;
-    int enumeratorCount() const;
-    int propertyCount() const;
-    int classInfoCount() const;
-
-    int indexOfConstructor(const char *constructor) const;
-    int indexOfMethod(const char *method) const;
-    int indexOfSignal(const char *signal) const;
-    int indexOfSlot(const char *slot) const;
-    int indexOfEnumerator(const char *name) const;
-    int indexOfProperty(const char *name) const;
-    int indexOfClassInfo(const char *name) const;
-
-    QMetaMethod constructor(int index) const;
-    QMetaMethod method(int index) const;
-    QMetaEnum enumerator(int index) const;
-    QMetaProperty property(int index) const;
-    QMetaClassInfo classInfo(int index) const;
-    QMetaProperty userProperty() const;
-
-    static bool checkConnectArgs(const char *signal, const char *method);
-    static QByteArray normalizedSignature(const char *method);
-    static QByteArray normalizedType(const char *type);
-
-    // internal index-based connect
-    static bool connect(const QObject *sender, int signal_index,
-                        const QObject *receiver, int method_index,
-                        int type = 0, int *types = 0);
-    // internal index-based disconnect
-    static bool disconnect(const QObject *sender, int signal_index,
-                           const QObject *receiver, int method_index);
-    static bool disconnectOne(const QObject *sender, int signal_index,
-                              const QObject *receiver, int method_index);
-    // internal slot-name based connect
-    static void connectSlotsByName(QObject *o);
-
-    // internal index-based signal activation
-    static void activate(QObject *sender, int signal_index, void **argv);  //obsolete
-    static void activate(QObject *sender, int from_signal_index, int to_signal_index, void **argv); //obsolete
-    static void activate(QObject *sender, const QMetaObject *, int local_signal_index, void **argv);
-    static void activate(QObject *sender, const QMetaObject *, int from_local_signal_index, int to_local_signal_index, void **argv); //obsolete
-
-    // internal guarded pointers
-    static void addGuard(QObject **ptr);
-    static void removeGuard(QObject **ptr);
-    static void changeGuard(QObject **ptr, QObject *o);
-
-    static bool invokeMethod(QObject *obj, const char *member,
-                             Qt::ConnectionType,
-                             QGenericReturnArgument ret,
-                             QGenericArgument val0 = QGenericArgument(0),
-                             QGenericArgument val1 = QGenericArgument(),
-                             QGenericArgument val2 = QGenericArgument(),
-                             QGenericArgument val3 = QGenericArgument(),
-                             QGenericArgument val4 = QGenericArgument(),
-                             QGenericArgument val5 = QGenericArgument(),
-                             QGenericArgument val6 = QGenericArgument(),
-                             QGenericArgument val7 = QGenericArgument(),
-                             QGenericArgument val8 = QGenericArgument(),
-                             QGenericArgument val9 = QGenericArgument());
-
-    static inline bool invokeMethod(QObject *obj, const char *member,
-                             QGenericReturnArgument ret,
-                             QGenericArgument val0 = QGenericArgument(0),
-                             QGenericArgument val1 = QGenericArgument(),
-                             QGenericArgument val2 = QGenericArgument(),
-                             QGenericArgument val3 = QGenericArgument(),
-                             QGenericArgument val4 = QGenericArgument(),
-                             QGenericArgument val5 = QGenericArgument(),
-                             QGenericArgument val6 = QGenericArgument(),
-                             QGenericArgument val7 = QGenericArgument(),
-                             QGenericArgument val8 = QGenericArgument(),
-                             QGenericArgument val9 = QGenericArgument())
-    {
-        return invokeMethod(obj, member, Qt::AutoConnection, ret, val0, val1, val2, val3,
-                val4, val5, val6, val7, val8, val9);
-    }
-
-    static inline bool invokeMethod(QObject *obj, const char *member,
-                             Qt::ConnectionType type,
-                             QGenericArgument val0 = QGenericArgument(0),
-                             QGenericArgument val1 = QGenericArgument(),
-                             QGenericArgument val2 = QGenericArgument(),
-                             QGenericArgument val3 = QGenericArgument(),
-                             QGenericArgument val4 = QGenericArgument(),
-                             QGenericArgument val5 = QGenericArgument(),
-                             QGenericArgument val6 = QGenericArgument(),
-                             QGenericArgument val7 = QGenericArgument(),
-                             QGenericArgument val8 = QGenericArgument(),
-                             QGenericArgument val9 = QGenericArgument())
-    {
-        return invokeMethod(obj, member, type, QGenericReturnArgument(), val0, val1, val2,
-                                 val3, val4, val5, val6, val7, val8, val9);
-    }
-
-    static inline bool invokeMethod(QObject *obj, const char *member,
-                             QGenericArgument val0 = QGenericArgument(0),
-                             QGenericArgument val1 = QGenericArgument(),
-                             QGenericArgument val2 = QGenericArgument(),
-                             QGenericArgument val3 = QGenericArgument(),
-                             QGenericArgument val4 = QGenericArgument(),
-                             QGenericArgument val5 = QGenericArgument(),
-                             QGenericArgument val6 = QGenericArgument(),
-                             QGenericArgument val7 = QGenericArgument(),
-                             QGenericArgument val8 = QGenericArgument(),
-                             QGenericArgument val9 = QGenericArgument())
-    {
-        return invokeMethod(obj, member, Qt::AutoConnection, QGenericReturnArgument(), val0,
-                val1, val2, val3, val4, val5, val6, val7, val8, val9);
-    }
-
-    QObject *newInstance(QGenericArgument val0 = QGenericArgument(0),
-                         QGenericArgument val1 = QGenericArgument(),
-                         QGenericArgument val2 = QGenericArgument(),
-                         QGenericArgument val3 = QGenericArgument(),
-                         QGenericArgument val4 = QGenericArgument(),
-                         QGenericArgument val5 = QGenericArgument(),
-                         QGenericArgument val6 = QGenericArgument(),
-                         QGenericArgument val7 = QGenericArgument(),
-                         QGenericArgument val8 = QGenericArgument(),
-                         QGenericArgument val9 = QGenericArgument()) const;
-
-    enum Call {
-        InvokeMetaMethod,
-        ReadProperty,
-        WriteProperty,
-        ResetProperty,
-        QueryPropertyDesignable,
-        QueryPropertyScriptable,
-        QueryPropertyStored,
-        QueryPropertyEditable,
-        QueryPropertyUser,
-        CreateInstance
-    };
-
-    int static_metacall(Call, int, void **) const;
-    static int metacall(QObject *, Call, int, void **);
-
-#ifdef QT3_SUPPORT
-    QT3_SUPPORT const char *superClassName() const;
-#endif
-
-    struct { // private data
-        const QMetaObject *superdata;
-        const char *stringdata;
-        const uint *data;
-        const void *extradata;
-    } d;
-};
-
-typedef const QMetaObject& (*QMetaObjectAccessor)();
-
-struct QMetaObjectExtraData
-{
-#ifdef Q_NO_DATA_RELOCATION
-    const QMetaObjectAccessor *objects;
-#else
-    const QMetaObject **objects;
-#endif
-
-    typedef void (*StaticMetacallFunction)(QObject *, QMetaObject::Call, int, void **); //from revision 6
-    //typedef int (*StaticMetaCall)(QMetaObject::Call, int, void **); //used from revison 2 until revison 5
-    StaticMetacallFunction static_metacall;
-};
-
-inline const char *QMetaObject::className() const
-{ return d.stringdata; }
-
-inline const QMetaObject *QMetaObject::superClass() const
-{ return d.superdata; }
-
-#ifdef QT3_SUPPORT
-inline const char *QMetaObject::superClassName() const
-{ return d.superdata ? d.superdata->className() : 0; }
-#endif
-
-QT_END_NAMESPACE
-
-QT_END_HEADER
-
-#endif // QOBJECTDEFS_H
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/patch-qt-4.8/QtCore/qplugin.h b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/patch-qt-4.8/QtCore/qplugin.h
deleted file mode 100644
index d7e475356270..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/patch-qt-4.8/QtCore/qplugin.h
+++ /dev/null
@@ -1,152 +0,0 @@
-/****************************************************************************
-**
-** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
-** All rights reserved.
-** Contact: Nokia Corporation (qt-info@nokia.com)
-**
-** This file is part of the QtCore module of the Qt Toolkit.
-**
-** $QT_BEGIN_LICENSE:LGPL$
-** GNU Lesser General Public License Usage
-** This file may be used under the terms of the GNU Lesser General Public
-** License version 2.1 as published by the Free Software Foundation and
-** appearing in the file LICENSE.LGPL included in the packaging of this
-** file. Please review the following information to ensure the GNU Lesser
-** General Public License version 2.1 requirements will be met:
-** https://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
-**
-** In addition, as a special exception, Nokia gives you certain additional
-** rights. These rights are described in the Nokia Qt LGPL Exception
-** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
-**
-** GNU General Public License Usage
-** Alternatively, this file may be used under the terms of the GNU General
-** Public License version 3.0 as published by the Free Software Foundation
-** and appearing in the file LICENSE.GPL included in the packaging of this
-** file. Please review the following information to ensure the GNU General
-** Public License version 3.0 requirements will be met:
-** https://www.gnu.org/licenses/gpl-3.0.html.
-**
-** Other Usage
-** Alternatively, this file may be used in accordance with the terms and
-** conditions contained in a signed written agreement between you and Nokia.
-**
-**
-**
-**
-**
-** $QT_END_LICENSE$
-**
-****************************************************************************/
-
-#ifndef QPLUGIN_H
-#define QPLUGIN_H
-
-#include <QtCore/qobject.h>
-#include <QtCore/qpointer.h>
-
-QT_BEGIN_HEADER
-
-QT_BEGIN_NAMESPACE
-
-QT_MODULE(Core)
-
-#ifndef Q_EXTERN_C
-#  ifdef __cplusplus
-#    define Q_EXTERN_C extern "C"
-#  else
-#    define Q_EXTERN_C extern
-#  endif
-#endif
-
-typedef QObject *(*QtPluginInstanceFunction)();
-
-void Q_CORE_EXPORT qRegisterStaticPluginInstanceFunction(QtPluginInstanceFunction function);
-
-#define Q_IMPORT_PLUGIN(PLUGIN) \
-        extern QT_PREPEND_NAMESPACE(QObject) *qt_plugin_instance_##PLUGIN(); \
-        class Static##PLUGIN##PluginInstance{ \
-        public: \
-                Static##PLUGIN##PluginInstance() { \
-                qRegisterStaticPluginInstanceFunction(qt_plugin_instance_##PLUGIN); \
-                } \
-        }; \
-       static Static##PLUGIN##PluginInstance static##PLUGIN##Instance;
-
-#define Q_PLUGIN_INSTANCE(IMPLEMENTATION) \
-        { \
-            static QT_PREPEND_NAMESPACE(QPointer)<QT_PREPEND_NAMESPACE(QObject)> _instance; \
-            if (!_instance)      \
-                _instance = new IMPLEMENTATION; \
-            return _instance; \
-        }
-
-#  define Q_EXPORT_PLUGIN(PLUGIN) \
-            Q_EXPORT_PLUGIN2(PLUGIN, PLUGIN)
-
-#  define Q_EXPORT_STATIC_PLUGIN(PLUGIN) \
-            Q_EXPORT_STATIC_PLUGIN2(PLUGIN, PLUGIN)
-
-#if defined(QT_STATICPLUGIN)
-
-#  define Q_EXPORT_PLUGIN2(PLUGIN, PLUGINCLASS) \
-            QT_PREPEND_NAMESPACE(QObject) \
-                *qt_plugin_instance_##PLUGIN() \
-            Q_PLUGIN_INSTANCE(PLUGINCLASS)
-
-#  define Q_EXPORT_STATIC_PLUGIN2(PLUGIN, PLUGINCLASS) \
-            Q_EXPORT_PLUGIN2(PLUGIN, PLUGINCLASS)
-
-#else
-// NOTE: if you change pattern, you MUST change the pattern in
-// qlibrary.cpp as well.  changing the pattern will break all
-// backwards compatibility as well (no old plugins will be loaded).
-// QT5: should probably remove the entire pattern thing and do the section
-//      trick for all platforms. for now, keep it and fallback to scan for it.
-#  ifdef QPLUGIN_DEBUG_STR
-#    undef QPLUGIN_DEBUG_STR
-#  endif
-#  ifdef QT_NO_DEBUG
-#    define QPLUGIN_DEBUG_STR "false"
-#    define QPLUGIN_SECTION_DEBUG_STR ""
-#  else
-#    define QPLUGIN_DEBUG_STR "true"
-#    define QPLUGIN_SECTION_DEBUG_STR ".debug"
-#  endif
-#  define Q_PLUGIN_VERIFICATION_DATA \
-    static const char qt_plugin_verification_data[] = \
-      "pattern=QT_PLUGIN_VERIFICATION_DATA\n" \
-      "version=" QT_VERSION_STR "\n" \
-      "debug=" QPLUGIN_DEBUG_STR "\n" \
-      "buildkey=" QT_BUILD_KEY;
-
-#  if defined (Q_OF_ELF) && defined (Q_CC_GNU)
-#  define Q_PLUGIN_VERIFICATION_SECTION \
-    __attribute__ ((section (".qtplugin"))) __attribute__((used))
-#  else
-#  define Q_PLUGIN_VERIFICATION_SECTION
-#  endif
-
-#  if defined (Q_OS_WIN32) && defined(Q_CC_BOR)
-#     define Q_STANDARD_CALL __stdcall
-#  else
-#     define Q_STANDARD_CALL
-#  endif
-
-#  define Q_EXPORT_PLUGIN2(PLUGIN, PLUGINCLASS)      \
-            Q_PLUGIN_VERIFICATION_SECTION Q_PLUGIN_VERIFICATION_DATA \
-            Q_EXTERN_C Q_DECL_EXPORT \
-            const char * Q_STANDARD_CALL qt_plugin_query_verification_data() \
-            { return qt_plugin_verification_data; } \
-            Q_EXTERN_C Q_DECL_EXPORT QT_PREPEND_NAMESPACE(QObject) * Q_STANDARD_CALL qt_plugin_instance() \
-            Q_PLUGIN_INSTANCE(PLUGINCLASS)
-
-#  define Q_EXPORT_STATIC_PLUGIN2(PLUGIN, PLUGINCLASS)
-
-#endif
-
-QT_END_NAMESPACE
-
-QT_END_HEADER
-
-#endif // Q_PLUGIN_H
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/setup
deleted file mode 100644
index 5a4eddfb9bf2..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_g++-trunk_CXX0X/setup
+++ /dev/null
@@ -1,13 +0,0 @@
-QTDIR=/usr/lib64/qt-3.3
-LD_LIBRARY_PATH=/usr/local/packages/gcc-trunk/lib64
-CXX=/usr/local/packages/gcc-trunk/bin/g++
-CC=/usr/local/packages/gcc-trunk/bin/gcc
-
-BOOST_ROOT=/home/lrineau/CGAL/boost/1.48
-export BOOST_ROOT
-
-export CXX CC
-export LD_LIBRARY_PATH QTDIR
-
-source /home/lrineau/infrastructure/reference-platforms/setup-common
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/CMakeCache.txt
deleted file mode 100644
index 0dc4b211c1c7..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/CMakeCache.txt
+++ /dev/null
@@ -1,2446 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build the doxygen documentation
-BUILD_DOC:BOOL=OFF
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory DEBUG
-Boost_LIBRARY_DIR_DEBUG:PATH=/usr/lib64
-
-//Boost library directory RELEASE
-Boost_LIBRARY_DIR_RELEASE:PATH=/usr/lib64
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Select to allow to use all preconfigured external libraries
-CGAL_ALLOW_ALL_PRECONFIGURED_LIBS_COMPONENT:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -fno-strict-aliasing -Wall
-
-//Value Computed by CMake
-CGAL_Core_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/src/Core
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Value Computed by CMake
-CGAL_Core_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALCore
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=share/doc/CGAL-3.7-Ic-62
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=share/man/man1
-
-//Value Computed by CMake
-CGAL_ImageIO_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/src/ImageIO
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libz.so;
-
-//Value Computed by CMake
-CGAL_ImageIO_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/src/CGALImageIO
-
-//The CGAL library
-CGAL_LIBRARY:STRING=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/lib/libCGAL.so
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Dependencies for the target
-CGAL_Qt5_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmpxx.so;general;/usr/lib64/libgmp.so;general;Qt5::OpenGL;general;Qt5::Svg;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;
-
-//soname-version
-CGAL_SONAME_VERSION:STRING=6
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I
-
-//soversion
-CGAL_SOVERSION:STRING=6.0.0
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//For backwards compatibility, what version of CMake commands and
-// syntax should this version of CMake try to support.
-CMAKE_BACKWARDS_COMPATIBILITY:STRING=2.4
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler.
-CMAKE_CXX_COMPILER:FILEPATH=/usr/local/packages/llvm-trunk/bin/clang++
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING= -fno-strict-aliasing -Wall -fsanitize=address -DDONT_USE_BOOST_PROGRAM_OPTIONS
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O2 -fno-omit-frame-pointer
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//C compiler.
-CMAKE_C_COMPILER:FILEPATH=/usr/local/packages/llvm-trunk/bin/clang
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release minsize builds.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds (/MD /Ob1 /Oi
-// /Ot /Oy /Gs will produce slightly less optimized but smaller
-// files).
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DNDEBUG
-
-//Flags used by the compiler during Release with Debug Info builds.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=OFF
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If true, cmake will use relative paths in makefiles and projects.
-CMAKE_USE_RELATIVE_PATHS:BOOL=OFF
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//Value Computed by CMake
-Documentation_BINARY_DIR:STATIC=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/doc
-
-//Value Computed by CMake
-Documentation_SOURCE_DIR:STATIC=/home/lrineau/CGAL/CGAL-I/doc
-
-//The directory containing the GMPXX include files
-GMPXX_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMPXX library
-GMPXX_LIBRARIES:FILEPATH=/usr/lib64/libgmpxx.so
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//Path to a file.
-OPENSSL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENSSL_LIBRARIES:FILEPATH=/usr/lib64/libssl.so
-
-//Path to a file.
-QT3_INCLUDE_DIR:PATH=/usr/lib64/qt-3.3/include
-
-//Path to a program.
-QT3_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/moc
-
-//Path to a library.
-QT3_QASSISTANTCLIENT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqassistantclient.a
-
-//Path to a library.
-QT3_QT_LIBRARY:FILEPATH=/usr/lib64/qt-3.3/lib/libqt-mt.so
-
-//Path to a program.
-QT3_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt-3.3/bin/uic
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_ARTHURPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_ARTHURPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libarthurplugin.so
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG:FILEPATH=QT_CONTAINEREXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcontainerextension.so
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libcustomwidgetplugin.so
-
-//Path to a program.
-QT_DBUSCPP2XML_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbuscpp2xml
-
-//Path to a program.
-QT_DBUSXML2CPP_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qdbusxml2cpp
-
-//Path to a program.
-QT_DESIGNER_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/designer-qt4
-
-//The location of the Qt docs
-QT_DOC_DIR:PATH=/usr/share/doc/qt4
-
-//Path to a library.
-QT_FONTCONFIG_LIBRARY:FILEPATH=/usr/lib64/libfontconfig.so
-
-//Path to a library.
-QT_FREETYPE_LIBRARY:FILEPATH=/usr/lib64/libfreetype.so
-
-//Path to a library.
-QT_GLIB_LIBRARY:FILEPATH=/usr/lib64/libglib-2.0.so
-
-//Path to a library.
-QT_GTHREAD_LIBRARY:FILEPATH=/usr/lib64/libgthread-2.0.so
-
-//The location of the Qt imports
-QT_IMPORTS_DIR:PATH=/usr/lib64/qt4/imports
-
-QT_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a program.
-QT_LINGUIST_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/linguist-qt4
-
-//Path to a program.
-QT_LRELEASE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lrelease
-
-//Path to a program.
-QT_LUPDATE_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/lupdate
-
-//The location of the Qt mkspecs containing qconfig.pri
-QT_MKSPECS_DIR:PATH=/usr/lib64/qt4/mkspecs
-
-//The moc executable
-QT_MOC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/moc
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_PHONONWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONONWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libphononwidgets.so
-
-//Path to a file.
-QT_PHONON_INCLUDE_DIR:PATH=/usr/include/phonon
-
-//The Qt PHONON library
-QT_PHONON_LIBRARY:STRING=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_LIBRARY_DEBUG:FILEPATH=QT_PHONON_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libphonon.so
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_DEBUG:FILEPATH=QT_PHONON_QT7_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_PHONON_QT7_PLUGIN_RELEASE:FILEPATH=QT_PHONON_QT7_PLUGIN_RELEASE-NOTFOUND
-
-//The location of the Qt plugins
-QT_PLUGINS_DIR:PATH=/usr/lib64/qt4/plugins
-
-//Path to a library.
-QT_PNG_LIBRARY:FILEPATH=/usr/lib64/libpng.so
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_DEBUG:FILEPATH=QT_QCNCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCNCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqcncodecs.so
-
-//Path to a program.
-QT_QCOLLECTIONGENERATOR_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/qcollectiongenerator
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_DEBUG:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QCOREWLANBEARER_PLUGIN_RELEASE:FILEPATH=QT_QCOREWLANBEARER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG:FILEPATH=QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqdeclarativeview.so
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE:FILEPATH=QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_DEBUG:FILEPATH=QT_QGENERICBEARER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGENERICBEARER_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/bearer/libqgenericbearer.so
-
-//Path to a library.
-QT_QGIF_PLUGIN_DEBUG:FILEPATH=QT_QGIF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGIF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqgif.so
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqglgraphicssystem.so
-
-//Path to a library.
-QT_QICO_PLUGIN_DEBUG:FILEPATH=QT_QICO_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QICO_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqico.so
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_DEBUG:FILEPATH=QT_QIMSW_MULTI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QIMSW_MULTI_PLUGIN_RELEASE:FILEPATH=QT_QIMSW_MULTI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_DEBUG:FILEPATH=QT_QJPCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqjpcodecs.so
-
-//Path to a library.
-QT_QJPEG_PLUGIN_DEBUG:FILEPATH=QT_QJPEG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QJPEG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqjpeg.so
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_DEBUG:FILEPATH=QT_QKRCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QKRCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqkrcodecs.so
-
-//Where can one of the qmake4 or qmake-qt4 libraries be found
-QT_QMAKE_EXECUTABLE:FILEPATH=/usr/bin/qmake-qt4
-
-//Path to a library.
-QT_QMNG_PLUGIN_DEBUG:FILEPATH=QT_QMNG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QMNG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqmng.so
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_DEBUG:FILEPATH=QT_QSQLDB2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLDB2_PLUGIN_RELEASE:FILEPATH=QT_QSQLDB2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_DEBUG:FILEPATH=QT_QSQLIBASE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLIBASE_PLUGIN_RELEASE:FILEPATH=QT_QSQLIBASE_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE2_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE2_PLUGIN_RELEASE:FILEPATH=QT_QSQLITE2_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_DEBUG:FILEPATH=QT_QSQLITE_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLITE_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlite.so
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLMYSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLMYSQL_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/sqldrivers/libqsqlmysql.so
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_DEBUG:FILEPATH=QT_QSQLOCI_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLOCI_PLUGIN_RELEASE:FILEPATH=QT_QSQLOCI_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_DEBUG:FILEPATH=QT_QSQLODBC_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLODBC_PLUGIN_RELEASE:FILEPATH=QT_QSQLODBC_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_DEBUG:FILEPATH=QT_QSQLPSQL_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLPSQL_PLUGIN_RELEASE:FILEPATH=QT_QSQLPSQL_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_DEBUG:FILEPATH=QT_QSQLTDS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSQLTDS_PLUGIN_RELEASE:FILEPATH=QT_QSQLTDS_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_DEBUG:FILEPATH=QT_QSVGICON_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVGICON_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/iconengines/libqsvgicon.so
-
-//Path to a library.
-QT_QSVG_PLUGIN_DEBUG:FILEPATH=QT_QSVG_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QSVG_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqsvg.so
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqt3supportwidgets.so
-
-//Path to a file.
-QT_QT3SUPPORT_INCLUDE_DIR:PATH=/usr/include/Qt3Support
-
-//The Qt QT3SUPPORT library
-QT_QT3SUPPORT_LIBRARY:STRING=optimized;/usr/lib64/libQt3Support.so;debug;/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQt3Support_debug.so
-
-//Path to a library.
-QT_QT3SUPPORT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQt3Support.so
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblecompatwidgets.so
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG:FILEPATH=QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/accessible/libqtaccessiblewidgets.so
-
-//Path to a file.
-QT_QTASSISTANTCLIENT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANTCLIENT library
-QT_QTASSISTANTCLIENT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//Path to a file.
-QT_QTASSISTANT_INCLUDE_DIR:PATH=/usr/include/QtAssistant
-
-//The Qt QTASSISTANT library
-QT_QTASSISTANT_LIBRARY:STRING=optimized;/usr/lib64/libQtAssistantClient.so;debug;/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtAssistantClient_debug.so
-
-//Path to a library.
-QT_QTASSISTANT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtAssistantClient.so
-
-//The Qt QTCLUCENE library
-QT_QTCLUCENE_LIBRARY:STRING=optimized;/usr/lib64/libQtCLucene.so;debug;/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCLucene_debug.so
-
-//Path to a library.
-QT_QTCLUCENE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCLucene.so
-
-//Path to a file.
-QT_QTCORE_INCLUDE_DIR:PATH=/usr/include/QtCore
-
-//The Qt QTCORE library
-QT_QTCORE_LIBRARY:STRING=optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtCore_debug.so
-
-//Path to a library.
-QT_QTCORE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtCore.so
-
-//Path to a file.
-QT_QTDBUS_INCLUDE_DIR:PATH=/usr/include/QtDBus
-
-//The Qt QTDBUS library
-QT_QTDBUS_LIBRARY:STRING=optimized;/usr/lib64/libQtDBus.so;debug;/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDBus_debug.so
-
-//Path to a library.
-QT_QTDBUS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDBus.so
-
-//Path to a file.
-QT_QTDECLARATIVE_INCLUDE_DIR:PATH=/usr/include/QtDeclarative
-
-//The Qt QTDECLARATIVE library
-QT_QTDECLARATIVE_LIBRARY:STRING=optimized;/usr/lib64/libQtDeclarative.so;debug;/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDeclarative_debug.so
-
-//Path to a library.
-QT_QTDECLARATIVE_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDeclarative.so
-
-//Path to a file.
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNERCOMPONENTS library
-QT_QTDESIGNERCOMPONENTS_LIBRARY:STRING=optimized;/usr/lib64/libQtDesignerComponents.so;debug;/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesignerComponents_debug.so
-
-//Path to a library.
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesignerComponents.so
-
-//Path to a file.
-QT_QTDESIGNER_INCLUDE_DIR:PATH=/usr/include/QtDesigner
-
-//The Qt QTDESIGNER library
-QT_QTDESIGNER_LIBRARY:STRING=optimized;/usr/lib64/libQtDesigner.so;debug;/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtDesigner_debug.so
-
-//Path to a library.
-QT_QTDESIGNER_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtDesigner.so
-
-//Path to a file.
-QT_QTGUI_INCLUDE_DIR:PATH=/usr/include/QtGui
-
-//The Qt QTGUI library
-QT_QTGUI_LIBRARY:STRING=optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtGui_debug.so
-
-//Path to a library.
-QT_QTGUI_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtGui.so
-
-//Path to a file.
-QT_QTHELP_INCLUDE_DIR:PATH=/usr/include/QtHelp
-
-//The Qt QTHELP library
-QT_QTHELP_LIBRARY:STRING=optimized;/usr/lib64/libQtHelp.so;debug;/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtHelp_debug.so
-
-//Path to a library.
-QT_QTHELP_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtHelp.so
-
-//Path to a library.
-QT_QTIFF_PLUGIN_DEBUG:FILEPATH=QT_QTIFF_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTIFF_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/imageformats/libqtiff.so
-
-//Path to a file.
-QT_QTMOTIF_INCLUDE_DIR:PATH=QT_QTMOTIF_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTMOTIF library
-QT_QTMOTIF_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_DEBUG:FILEPATH=QT_QTMOTIF_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTMOTIF_LIBRARY_RELEASE:FILEPATH=QT_QTMOTIF_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTMULTIMEDIA_INCLUDE_DIR:PATH=/usr/include/QtMultimedia
-
-//The Qt QTMULTIMEDIA library
-QT_QTMULTIMEDIA_LIBRARY:STRING=optimized;/usr/lib64/libQtMultimedia.so;debug;/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtMultimedia_debug.so
-
-//Path to a library.
-QT_QTMULTIMEDIA_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtMultimedia.so
-
-//Path to a file.
-QT_QTNETWORK_INCLUDE_DIR:PATH=/usr/include/QtNetwork
-
-//The Qt QTNETWORK library
-QT_QTNETWORK_LIBRARY:STRING=optimized;/usr/lib64/libQtNetwork.so;debug;/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtNetwork_debug.so
-
-//Path to a library.
-QT_QTNETWORK_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtNetwork.so
-
-//Path to a file.
-QT_QTNSPLUGIN_INCLUDE_DIR:PATH=QT_QTNSPLUGIN_INCLUDE_DIR-NOTFOUND
-
-//The Qt QTNSPLUGIN library
-QT_QTNSPLUGIN_LIBRARY:STRING=
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_DEBUG:FILEPATH=QT_QTNSPLUGIN_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTNSPLUGIN_LIBRARY_RELEASE:FILEPATH=QT_QTNSPLUGIN_LIBRARY_RELEASE-NOTFOUND
-
-//Path to a file.
-QT_QTOPENGL_INCLUDE_DIR:PATH=/usr/include/QtOpenGL
-
-//The Qt QTOPENGL library
-QT_QTOPENGL_LIBRARY:STRING=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtOpenGL_debug.so
-
-//Path to a library.
-QT_QTOPENGL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtOpenGL.so
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG:FILEPATH=QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/graphicssystems/libqtracegraphicssystem.so
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG:FILEPATH=QT_QTSCRIPTDBUS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/script/libqtscriptdbus.so
-
-//Path to a file.
-QT_QTSCRIPTTOOLS_INCLUDE_DIR:PATH=/usr/include/QtScriptTools
-
-//The Qt QTSCRIPTTOOLS library
-QT_QTSCRIPTTOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtScriptTools.so;debug;/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScriptTools_debug.so
-
-//Path to a library.
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScriptTools.so
-
-//Path to a file.
-QT_QTSCRIPT_INCLUDE_DIR:PATH=/usr/include/QtScript
-
-//The Qt QTSCRIPT library
-QT_QTSCRIPT_LIBRARY:STRING=optimized;/usr/lib64/libQtScript.so;debug;/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtScript_debug.so
-
-//Path to a library.
-QT_QTSCRIPT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtScript.so
-
-//Path to a file.
-QT_QTSQL_INCLUDE_DIR:PATH=/usr/include/QtSql
-
-//The Qt QTSQL library
-QT_QTSQL_LIBRARY:STRING=optimized;/usr/lib64/libQtSql.so;debug;/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSql_debug.so
-
-//Path to a library.
-QT_QTSQL_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSql.so
-
-//Path to a file.
-QT_QTSVG_INCLUDE_DIR:PATH=/usr/include/QtSvg
-
-//The Qt QTSVG library
-QT_QTSVG_LIBRARY:STRING=optimized;/usr/lib64/libQtSvg.so;debug;/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtSvg_debug.so
-
-//Path to a library.
-QT_QTSVG_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtSvg.so
-
-//Path to a file.
-QT_QTTEST_INCLUDE_DIR:PATH=/usr/include/QtTest
-
-//The Qt QTTEST library
-QT_QTTEST_LIBRARY:STRING=optimized;/usr/lib64/libQtTest.so;debug;/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtTest_debug.so
-
-//Path to a library.
-QT_QTTEST_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtTest.so
-
-//Path to a file.
-QT_QTUITOOLS_INCLUDE_DIR:PATH=/usr/include/QtUiTools
-
-//The Qt QTUITOOLS library
-QT_QTUITOOLS_LIBRARY:STRING=optimized;/usr/lib64/libQtUiTools.a;debug;/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtUiTools_debug.a
-
-//Path to a library.
-QT_QTUITOOLS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtUiTools.a
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_DEBUG:FILEPATH=QT_QTWCODECS_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QTWCODECS_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/codecs/libqtwcodecs.so
-
-//Path to a file.
-QT_QTWEBKIT_INCLUDE_DIR:PATH=/usr/include/QtWebKit
-
-//The Qt QTWEBKIT library
-QT_QTWEBKIT_LIBRARY:STRING=optimized;/usr/lib64/libQtWebKit.so;debug;/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtWebKit_debug.so
-
-//Path to a library.
-QT_QTWEBKIT_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtWebKit.so
-
-//Path to a file.
-QT_QTXMLPATTERNS_INCLUDE_DIR:PATH=/usr/include/QtXmlPatterns
-
-//The Qt QTXMLPATTERNS library
-QT_QTXMLPATTERNS_LIBRARY:STRING=optimized;/usr/lib64/libQtXmlPatterns.so;debug;/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXmlPatterns_debug.so
-
-//Path to a library.
-QT_QTXMLPATTERNS_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXmlPatterns.so
-
-//Path to a file.
-QT_QTXML_INCLUDE_DIR:PATH=/usr/include/QtXml
-
-//The Qt QTXML library
-QT_QTXML_LIBRARY:STRING=optimized;/usr/lib64/libQtXml.so;debug;/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libQtXml_debug.so
-
-//Path to a library.
-QT_QTXML_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libQtXml.so
-
-//Path to a file.
-QT_QT_INCLUDE_DIR:PATH=/usr/include/Qt
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_DEBUG:FILEPATH=QT_QWEBVIEW_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWEBVIEW_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libqwebview.so
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE:FILEPATH=QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-NOTFOUND
-
-//Path to a program.
-QT_RCC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/rcc
-
-//Path to a library.
-QT_RT_LIBRARY:FILEPATH=/usr/lib64/librt.so
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG:FILEPATH=QT_TASKMENUEXTENSION_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libtaskmenuextension.so
-
-//The location of the Qt translations
-QT_TRANSLATIONS_DIR:PATH=/usr/share/qt4/translations
-
-//Path to a program.
-QT_UIC3_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic3
-
-//The uic executable
-QT_UIC_EXECUTABLE:FILEPATH=/usr/lib64/qt4/bin/uic
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG:FILEPATH=QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-NOTFOUND
-
-//Path to a library.
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE:FILEPATH=/usr/lib64/qt4/plugins/designer/libworldtimeclockplugin.so
-
-//Path to a library.
-QT_X11_ICE_LIBRARY:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a library.
-QT_X11_SM_LIBRARY:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a library.
-QT_X11_X11_LIBRARY:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a library.
-QT_X11_Xext_LIBRARY:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a library.
-QT_X11_m_LIBRARY:FILEPATH=/usr/lib64/libm.so
-
-//Path to a library.
-QT_XCURSOR_LIBRARY:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a library.
-QT_XFIXES_LIBRARY:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a library.
-QT_XINERAMA_LIBRARY:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a library.
-QT_XI_LIBRARY:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a library.
-QT_XRANDR_LIBRARY:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a library.
-QT_XRENDER_LIBRARY:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a library.
-QT_ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-//The directory containing a CMake configuration file for Qt5Core.
-Qt5Core_DIR:PATH=/usr/lib64/cmake/Qt5Core
-
-//The directory containing a CMake configuration file for Qt5Gui.
-Qt5Gui_DIR:PATH=/usr/lib64/cmake/Qt5Gui
-
-//The directory containing a CMake configuration file for Qt5OpenGL.
-Qt5OpenGL_DIR:PATH=/usr/lib64/cmake/Qt5OpenGL
-
-//The directory containing a CMake configuration file for Qt5Svg.
-Qt5Svg_DIR:PATH=/usr/lib64/cmake/Qt5Svg
-
-//The directory containing a CMake configuration file for Qt5Widgets.
-Qt5Widgets_DIR:PATH=/usr/lib64/cmake/Qt5Widgets
-
-//The directory containing a CMake configuration file for Qt5.
-Qt5_DIR:PATH=/usr/lib64/cmake/Qt5
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component PDB
-WITH_CGAL_PDB:BOOL=ON
-
-//Enable CGAL component CGAL_Qt3
-WITH_CGAL_Qt3:BOOL=ON
-
-//Enable CGAL component CGAL_Qt4
-WITH_CGAL_Qt4:BOOL=ON
-
-//Enable CGAL component CGAL_Qt5
-WITH_CGAL_Qt5:BOOL=ON
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=ON
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library TAUCS
-WITH_TAUCS:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a file.
-X11_ICE_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_ICE_LIB:FILEPATH=/usr/lib64/libICE.so
-
-//Path to a file.
-X11_SM_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_SM_LIB:FILEPATH=/usr/lib64/libSM.so
-
-//Path to a file.
-X11_X11_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_X11_LIB:FILEPATH=/usr/lib64/libX11.so
-
-//Path to a file.
-X11_XRes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XRes_LIB:FILEPATH=X11_XRes_LIB-NOTFOUND
-
-//Path to a file.
-X11_XShm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XSync_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_XTest_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_XTest_LIB:FILEPATH=/usr/lib64/libXtst.so
-
-//Path to a file.
-X11_Xaccessrules_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xaccessstr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xau_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xau_LIB:FILEPATH=/usr/lib64/libXau.so
-
-//Path to a file.
-X11_Xcomposite_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcomposite_LIB:FILEPATH=/usr/lib64/libXcomposite.so
-
-//Path to a file.
-X11_Xcursor_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xcursor_LIB:FILEPATH=/usr/lib64/libXcursor.so
-
-//Path to a file.
-X11_Xdamage_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdamage_LIB:FILEPATH=/usr/lib64/libXdamage.so
-
-//Path to a file.
-X11_Xdmcp_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xdmcp_LIB:FILEPATH=/usr/lib64/libXdmcp.so
-
-//Path to a library.
-X11_Xext_LIB:FILEPATH=/usr/lib64/libXext.so
-
-//Path to a file.
-X11_Xfixes_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xfixes_LIB:FILEPATH=/usr/lib64/libXfixes.so
-
-//Path to a file.
-X11_Xft_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xft_LIB:FILEPATH=/usr/lib64/libXft.so
-
-//Path to a file.
-X11_Xi_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xi_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xinerama_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinerama_LIB:FILEPATH=/usr/lib64/libXinerama.so
-
-//Path to a file.
-X11_Xinput_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xinput_LIB:FILEPATH=/usr/lib64/libXi.so
-
-//Path to a file.
-X11_Xkb_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xkbfile_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xkbfile_LIB:FILEPATH=/usr/lib64/libxkbfile.so
-
-//Path to a file.
-X11_Xkblib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xlib_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xmu_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xmu_LIB:FILEPATH=/usr/lib64/libXmu.so
-
-//Path to a file.
-X11_Xpm_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xpm_LIB:FILEPATH=/usr/lib64/libXpm.so
-
-//Path to a file.
-X11_Xrandr_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrandr_LIB:FILEPATH=/usr/lib64/libXrandr.so
-
-//Path to a file.
-X11_Xrender_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xrender_LIB:FILEPATH=/usr/lib64/libXrender.so
-
-//Path to a file.
-X11_Xscreensaver_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xscreensaver_LIB:FILEPATH=/usr/lib64/libXss.so
-
-//Path to a file.
-X11_Xshape_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xt_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xt_LIB:FILEPATH=/usr/lib64/libXt.so
-
-//Path to a file.
-X11_Xutil_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_Xv_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a library.
-X11_Xv_LIB:FILEPATH=/usr/lib64/libXv.so
-
-//Path to a library.
-X11_Xxf86misc_LIB:FILEPATH=/usr/lib64/libXxf86misc.so
-
-//Path to a library.
-X11_Xxf86vm_LIB:FILEPATH=/usr/lib64/libXxf86vm.so
-
-//Path to a file.
-X11_dpms_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86misc_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-X11_xf86vmode_INCLUDE_PATH:PATH=/usr/include
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//Name of all CGAL libraries.
-ALL_CGAL_LIBRARIES:INTERNAL=CGAL;CGAL_Core;CGAL_ImageIO;CGAL_PDB;CGAL_Qt3;CGAL_Qt4
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_DEBUG
-Boost_LIBRARY_DIR_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_RELEASE
-Boost_LIBRARY_DIR_RELEASE-ADVANCED:INTERNAL=1
-//The library version string for boost libraries
-Boost_LIB_VERSION:INTERNAL=1_52
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//Whether the Boost SYSTEM library found
-Boost_SYSTEM_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Whether the Boost THREAD library found
-Boost_THREAD_FOUND:INTERNAL=ON
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//The version number for boost libraries
-Boost_VERSION:INTERNAL=105200
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libboost_thread.so;/usr/lib64/libboost_system.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib64
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ARRAY_MEMBER_INITIALIZATION_BUG_COMPILED:INTERNAL=FALSE
-//Test CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_DENORMALS_COMPILE_BUG
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_IEEE_754_BUG
-CGAL_CFG_IEEE_754_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_LONGNAME_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_LONGNAME_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_5
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_6
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_7
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_8
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_AUTO:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_AUTO_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_COPY_N:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_COPY_N_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DECLTYPE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DECLTYPE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DEFAULT_TEMPLATE_ARGUMENTS_FOR_FUNCTION_TEMPLATES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELEGATING_CONSTRUCTORS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_DELETED_AND_DEFAULT_FUNCTIONS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_INITIALIZER_LISTS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_ISFINITE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_ISFINITE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_LAMBDAS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LAMBDAS_COMPILED:INTERNAL=FALSE
-CGAL_CFG_NO_CPP0X_LONG_LONG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_LONG_LONG_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_NEXT_PREV:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_NEXT_PREV_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_RVALUE_REFERENCE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_STATIC_ASSERT_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_CPP0X_VARIADIC_TEMPLATES_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_LIMITS
-CGAL_CFG_NO_LIMITS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LOGICAL_OPERATORS_ALTERNATIVES_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_MESSAGE_PRAGMA_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_NEXTAFTER
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STATEMENT_EXPRESSIONS_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_STL
-CGAL_CFG_NO_STL:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TMPL_IN_TMPL_PARAM_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_ARRAY:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_ARRAY_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_TR1_TUPLE:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_TR1_TUPLE_COMPILED:INTERNAL=TRUE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG:INTERNAL=0
-//Result of TRY_COMPILE
-CGAL_CFG_NO_WARNING_CPP_DIRECTIVE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NUMERIC_LIMITS_BUG
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_USING_BASE_MEMBER_BUG_2
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-//Variable hidden from user
-CGAL_CGAL_LIBRARY:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/lib/libCGAL.so
-//Variable hidden from user
-CGAL_CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt5
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Core_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_Core_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Core.so
-//Variable hidden from user
-CGAL_Core_LIBRARY_NAME:INTERNAL=
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_TAUCS_PREFIX:INTERNAL=TAUCS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_ImageIO_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_ImageIO.so
-//Variable hidden from user
-CGAL_ImageIO_LIBRARY_NAME:INTERNAL=libCGAL_ImageIO.so
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//ADVANCED property for variable: CGAL_LIBRARY
-CGAL_LIBRARY-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL.so
-//Variable hidden from user
-CGAL_LIBRARY_NAME:INTERNAL=libCGAL.so
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/CGAL/CGAL-I
-CGAL_PDB_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_PDB_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_PDB_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_PDB_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Variable hidden from user
-CGAL_PDB_LIBRARY_NAME:INTERNAL=libCGAL_PDB.so
-CGAL_Qt3_3RD_PARTY_DEFINITIONS:INTERNAL=-DQT_SHARED;-DQT_NO_DEBUG;-DQT_THREAD_SUPPORT;-D_REENTRANT
-CGAL_Qt3_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/lib64/qt-3.3/include;/usr/include
-CGAL_Qt3_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/qt-3.3/lib/libqassistantclient.a;/usr/lib64/qt-3.3/lib/libqt-mt.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so;dl;-lpthread;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt3_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt3.so
-//Variable hidden from user
-CGAL_Qt3_LIBRARY_NAME:INTERNAL=libCGAL_Qt3.so
-CGAL_Qt4_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt4_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt4_3RD_PARTY_LIBRARIES:INTERNAL=optimized;/usr/lib64/libQtOpenGL.so;debug;/usr/lib64/libQtOpenGL_debug.so;optimized;/usr/lib64/libQtGui.so;debug;/usr/lib64/libQtGui_debug.so;optimized;/usr/lib64/libQtCore.so;debug;/usr/lib64/libQtCore_debug.so;/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libSM.so;/usr/lib64/libICE.so;/usr/lib64/libX11.so;/usr/lib64/libXext.so
-CGAL_Qt4_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_INSTALLED:INTERNAL=/usr/local/lib/libCGAL_Qt4.so
-//Variable hidden from user
-CGAL_Qt4_LIBRARY_NAME:INTERNAL=libCGAL_Qt4.so
-CGAL_Qt5_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_Qt5_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so
-CGAL_Qt5_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Qt5_LIBRARY:INTERNAL=
-//ADVANCED property for variable: CGAL_SONAME_VERSION
-CGAL_SONAME_VERSION-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_SOVERSION
-CGAL_SOVERSION-ADVANCED:INTERNAL=1
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE;TAUCS
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_BACKWARDS_COMPATIBILITY
-CMAKE_BACKWARDS_COMPATIBILITY-ADVANCED:INTERNAL=1
-//What is the target build tool cmake is generating for.
-CMAKE_BUILD_TOOL:INTERNAL=/usr/bin/gmake
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/CGAL/branches/local-master.git/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=4
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_RELEASE_VERSION:INTERNAL=patch 4
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_CXX_ABI_COMPILED:INTERNAL=TRUE
-//Result of TRY_COMPILE
-CMAKE_DETERMINE_C_ABI_COMPILED:INTERNAL=TRUE
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator platform.
-CMAKE_GENERATOR_PLATFORM:INTERNAL=
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Have function connect
-CMAKE_HAVE_CONNECT:INTERNAL=1
-//Have function gethostbyname
-CMAKE_HAVE_GETHOSTBYNAME:INTERNAL=1
-//Have symbol pthread_create
-CMAKE_HAVE_LIBC_CREATE:INTERNAL=
-//Have library pthreads
-CMAKE_HAVE_PTHREADS_CREATE:INTERNAL=
-//Have library pthread
-CMAKE_HAVE_PTHREAD_CREATE:INTERNAL=1
-//Have include CMAKE_HAVE_PTHREAD_H
-CMAKE_HAVE_PTHREAD_H:INTERNAL=1
-//Have function remove
-CMAKE_HAVE_REMOVE:INTERNAL=1
-//Have function shmat
-CMAKE_HAVE_SHMAT:INTERNAL=1
-//Start directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/CGAL/CGAL-I
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//Have library ICE
-CMAKE_LIB_ICE_HAS_ICECONNECTIONNUMBER:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_LOCAL_GENERATORS:INTERNAL=7
-//number of local generators
-CMAKE_NUMBER_OF_MAKEFILES:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/bin/uname
-//ADVANCED property for variable: CMAKE_USE_RELATIVE_PATHS
-CMAKE_USE_RELATIVE_PATHS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-CONFIG_CXX_FLAGS:INTERNAL= -fno-strict-aliasing -Wall -fsanitize=address -DDONT_USE_BOOST_PROGRAM_OPTIONS
-//Variable hidden from user
-Core_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-EXECUTABLE_OUTPUT_PATH:INTERNAL=
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding Threads
-FIND_PACKAGE_MESSAGE_DETAILS_Threads:INTERNAL=[TRUE][v()]
-//Details about finding X11
-FIND_PACKAGE_MESSAGE_DETAILS_X11:INTERNAL=[/usr/lib64/libX11.so][/usr/include]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GCC_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GCC_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Variable hidden from user
-ImageIO_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-LIBRARY_OUTPUT_PATH:INTERNAL=/home/lrineau/trunk/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/lib
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-OPENGL_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-OPENGL_RUN_RES:INTERNAL=23
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_INCLUDE_DIR
-OPENSSL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENSSL_LIBRARIES
-OPENSSL_LIBRARIES-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_INCLUDE_DIR
-QT3_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_MOC_EXECUTABLE
-QT3_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QASSISTANTCLIENT_LIBRARY
-QT3_QASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_QT_LIBRARY
-QT3_QT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT3_UIC_EXECUTABLE
-QT3_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-QT4_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-QT4_RUN_RES:INTERNAL=23
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_DEBUG
-QT_ARTHURPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ARTHURPLUGIN_PLUGIN_RELEASE
-QT_ARTHURPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_BINARY_DIR:INTERNAL=/usr/lib64/qt4/bin
-//Result of TRY_COMPILE
-QT_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_DEBUG
-QT_CONTAINEREXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CONTAINEREXTENSION_PLUGIN_RELEASE
-QT_CONTAINEREXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE
-QT_CUSTOMWIDGETPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSCPP2XML_EXECUTABLE
-QT_DBUSCPP2XML_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DBUSXML2CPP_EXECUTABLE
-QT_DBUSXML2CPP_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DESIGNER_EXECUTABLE
-QT_DESIGNER_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_DOC_DIR
-QT_DOC_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FONTCONFIG_LIBRARY
-QT_FONTCONFIG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_FREETYPE_LIBRARY
-QT_FREETYPE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GLIB_LIBRARY
-QT_GLIB_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_GTHREAD_LIBRARY
-QT_GTHREAD_LIBRARY-ADVANCED:INTERNAL=1
-QT_HEADERS_DIR:INTERNAL=/usr/include
-//ADVANCED property for variable: QT_IMPORTS_DIR
-QT_IMPORTS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_INCLUDE_DIR
-QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//Qt library dir
-QT_LIBRARY_DIR:INTERNAL=/usr/lib64
-//ADVANCED property for variable: QT_LINGUIST_EXECUTABLE
-QT_LINGUIST_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LRELEASE_EXECUTABLE
-QT_LRELEASE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_LUPDATE_EXECUTABLE
-QT_LUPDATE_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MKSPECS_DIR
-QT_MKSPECS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_MOC_EXECUTABLE
-QT_MOC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_DEBUG
-QT_PHONONWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONONWIDGETS_PLUGIN_RELEASE
-QT_PHONONWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_INCLUDE_DIR
-QT_PHONON_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY
-QT_PHONON_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_DEBUG
-QT_PHONON_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_LIBRARY_RELEASE
-QT_PHONON_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_DEBUG
-QT_PHONON_QT7_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PHONON_QT7_PLUGIN_RELEASE
-QT_PHONON_QT7_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PLUGINS_DIR
-QT_PLUGINS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_PNG_LIBRARY
-QT_PNG_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol _POSIX_TIMERS
-QT_POSIX_TIMERS:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_DEBUG
-QT_QCNCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCNCODECS_PLUGIN_RELEASE
-QT_QCNCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOLLECTIONGENERATOR_EXECUTABLE
-QT_QCOLLECTIONGENERATOR_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_DEBUG
-QT_QCOREWLANBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QCOREWLANBEARER_PLUGIN_RELEASE
-QT_QCOREWLANBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_DEBUG
-QT_QDECLARATIVEVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECLARATIVEVIEW_PLUGIN_RELEASE
-QT_QDECLARATIVEVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_DEBUG
-QT_QDECORATIONDEFAULT_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONDEFAULT_PLUGIN_RELEASE
-QT_QDECORATIONDEFAULT_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_DEBUG
-QT_QDECORATIONWINDOWS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QDECORATIONWINDOWS_PLUGIN_RELEASE
-QT_QDECORATIONWINDOWS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_DEBUG
-QT_QGENERICBEARER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGENERICBEARER_PLUGIN_RELEASE
-QT_QGENERICBEARER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_DEBUG
-QT_QGIF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGIF_PLUGIN_RELEASE
-QT_QGIF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QGLGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QGLGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_DEBUG
-QT_QICO_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QICO_PLUGIN_RELEASE
-QT_QICO_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_DEBUG
-QT_QIMSW_MULTI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QIMSW_MULTI_PLUGIN_RELEASE
-QT_QIMSW_MULTI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_DEBUG
-QT_QJPCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPCODECS_PLUGIN_RELEASE
-QT_QJPCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_DEBUG
-QT_QJPEG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QJPEG_PLUGIN_RELEASE
-QT_QJPEG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_DEBUG
-QT_QKRCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QKRCODECS_PLUGIN_RELEASE
-QT_QKRCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-QT_QMAKE_EXECUTABLE_LAST:INTERNAL=/usr/bin/qmake-qt4
-//ADVANCED property for variable: QT_QMNG_PLUGIN_DEBUG
-QT_QMNG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QMNG_PLUGIN_RELEASE
-QT_QMNG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_DEBUG
-QT_QSQLDB2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLDB2_PLUGIN_RELEASE
-QT_QSQLDB2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_DEBUG
-QT_QSQLIBASE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLIBASE_PLUGIN_RELEASE
-QT_QSQLIBASE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_DEBUG
-QT_QSQLITE2_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE2_PLUGIN_RELEASE
-QT_QSQLITE2_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_DEBUG
-QT_QSQLITE_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLITE_PLUGIN_RELEASE
-QT_QSQLITE_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_DEBUG
-QT_QSQLMYSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLMYSQL_PLUGIN_RELEASE
-QT_QSQLMYSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_DEBUG
-QT_QSQLOCI_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLOCI_PLUGIN_RELEASE
-QT_QSQLOCI_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_DEBUG
-QT_QSQLODBC_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLODBC_PLUGIN_RELEASE
-QT_QSQLODBC_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_DEBUG
-QT_QSQLPSQL_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLPSQL_PLUGIN_RELEASE
-QT_QSQLPSQL_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_DEBUG
-QT_QSQLTDS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSQLTDS_PLUGIN_RELEASE
-QT_QSQLTDS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_DEBUG
-QT_QSVGICON_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVGICON_PLUGIN_RELEASE
-QT_QSVGICON_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_DEBUG
-QT_QSVG_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QSVG_PLUGIN_RELEASE
-QT_QSVG_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG
-QT_QT3SUPPORTWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE
-QT_QT3SUPPORTWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_INCLUDE_DIR
-QT_QT3SUPPORT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY
-QT_QT3SUPPORT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_DEBUG
-QT_QT3SUPPORT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT3SUPPORT_LIBRARY_RELEASE
-QT_QT3SUPPORT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLECOMPATWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG
-QT_QTACCESSIBLEWIDGETS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE
-QT_QTACCESSIBLEWIDGETS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_INCLUDE_DIR
-QT_QTASSISTANTCLIENT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY
-QT_QTASSISTANTCLIENT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_DEBUG
-QT_QTASSISTANTCLIENT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANTCLIENT_LIBRARY_RELEASE
-QT_QTASSISTANTCLIENT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_INCLUDE_DIR
-QT_QTASSISTANT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY
-QT_QTASSISTANT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_DEBUG
-QT_QTASSISTANT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTASSISTANT_LIBRARY_RELEASE
-QT_QTASSISTANT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY
-QT_QTCLUCENE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_DEBUG
-QT_QTCLUCENE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCLUCENE_LIBRARY_RELEASE
-QT_QTCLUCENE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_INCLUDE_DIR
-QT_QTCORE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY
-QT_QTCORE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_DEBUG
-QT_QTCORE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTCORE_LIBRARY_RELEASE
-QT_QTCORE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_INCLUDE_DIR
-QT_QTDBUS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY
-QT_QTDBUS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_DEBUG
-QT_QTDBUS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDBUS_LIBRARY_RELEASE
-QT_QTDBUS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_INCLUDE_DIR
-QT_QTDECLARATIVE_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY
-QT_QTDECLARATIVE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_DEBUG
-QT_QTDECLARATIVE_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDECLARATIVE_LIBRARY_RELEASE
-QT_QTDECLARATIVE_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR
-QT_QTDESIGNERCOMPONENTS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY
-QT_QTDESIGNERCOMPONENTS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG
-QT_QTDESIGNERCOMPONENTS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE
-QT_QTDESIGNERCOMPONENTS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_INCLUDE_DIR
-QT_QTDESIGNER_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY
-QT_QTDESIGNER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_DEBUG
-QT_QTDESIGNER_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTDESIGNER_LIBRARY_RELEASE
-QT_QTDESIGNER_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_INCLUDE_DIR
-QT_QTGUI_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY
-QT_QTGUI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_DEBUG
-QT_QTGUI_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTGUI_LIBRARY_RELEASE
-QT_QTGUI_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_INCLUDE_DIR
-QT_QTHELP_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY
-QT_QTHELP_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_DEBUG
-QT_QTHELP_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTHELP_LIBRARY_RELEASE
-QT_QTHELP_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_DEBUG
-QT_QTIFF_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTIFF_PLUGIN_RELEASE
-QT_QTIFF_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_INCLUDE_DIR
-QT_QTMOTIF_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY
-QT_QTMOTIF_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_DEBUG
-QT_QTMOTIF_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMOTIF_LIBRARY_RELEASE
-QT_QTMOTIF_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_INCLUDE_DIR
-QT_QTMULTIMEDIA_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY
-QT_QTMULTIMEDIA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_DEBUG
-QT_QTMULTIMEDIA_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTMULTIMEDIA_LIBRARY_RELEASE
-QT_QTMULTIMEDIA_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_INCLUDE_DIR
-QT_QTNETWORK_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY
-QT_QTNETWORK_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_DEBUG
-QT_QTNETWORK_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNETWORK_LIBRARY_RELEASE
-QT_QTNETWORK_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_INCLUDE_DIR
-QT_QTNSPLUGIN_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY
-QT_QTNSPLUGIN_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_DEBUG
-QT_QTNSPLUGIN_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTNSPLUGIN_LIBRARY_RELEASE
-QT_QTNSPLUGIN_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_INCLUDE_DIR
-QT_QTOPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY
-QT_QTOPENGL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_DEBUG
-QT_QTOPENGL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTOPENGL_LIBRARY_RELEASE
-QT_QTOPENGL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE
-QT_QTRACEGRAPHICSSYSTEM_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_DEBUG
-QT_QTSCRIPTDBUS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTDBUS_PLUGIN_RELEASE
-QT_QTSCRIPTDBUS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_INCLUDE_DIR
-QT_QTSCRIPTTOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY
-QT_QTSCRIPTTOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_DEBUG
-QT_QTSCRIPTTOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPTTOOLS_LIBRARY_RELEASE
-QT_QTSCRIPTTOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_INCLUDE_DIR
-QT_QTSCRIPT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY
-QT_QTSCRIPT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_DEBUG
-QT_QTSCRIPT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSCRIPT_LIBRARY_RELEASE
-QT_QTSCRIPT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_INCLUDE_DIR
-QT_QTSQL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY
-QT_QTSQL_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_DEBUG
-QT_QTSQL_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSQL_LIBRARY_RELEASE
-QT_QTSQL_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_INCLUDE_DIR
-QT_QTSVG_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY
-QT_QTSVG_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_DEBUG
-QT_QTSVG_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTSVG_LIBRARY_RELEASE
-QT_QTSVG_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_INCLUDE_DIR
-QT_QTTEST_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY
-QT_QTTEST_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_DEBUG
-QT_QTTEST_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTTEST_LIBRARY_RELEASE
-QT_QTTEST_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_INCLUDE_DIR
-QT_QTUITOOLS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY
-QT_QTUITOOLS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_DEBUG
-QT_QTUITOOLS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTUITOOLS_LIBRARY_RELEASE
-QT_QTUITOOLS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_DEBUG
-QT_QTWCODECS_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWCODECS_PLUGIN_RELEASE
-QT_QTWCODECS_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_INCLUDE_DIR
-QT_QTWEBKIT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY
-QT_QTWEBKIT_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_DEBUG
-QT_QTWEBKIT_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTWEBKIT_LIBRARY_RELEASE
-QT_QTWEBKIT_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_INCLUDE_DIR
-QT_QTXMLPATTERNS_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY
-QT_QTXMLPATTERNS_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_DEBUG
-QT_QTXMLPATTERNS_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXMLPATTERNS_LIBRARY_RELEASE
-QT_QTXMLPATTERNS_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_INCLUDE_DIR
-QT_QTXML_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY
-QT_QTXML_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_DEBUG
-QT_QTXML_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QTXML_LIBRARY_RELEASE
-QT_QTXML_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QT_INCLUDE_DIR
-QT_QT_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_DEBUG
-QT_QWEBVIEW_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWEBVIEW_PLUGIN_RELEASE
-QT_QWEBVIEW_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE
-QT_QWSTSLIBMOUSEHANDLER_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RCC_EXECUTABLE
-QT_RCC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_RT_LIBRARY
-QT_RT_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-QT_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_DEBUG
-QT_TASKMENUEXTENSION_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TASKMENUEXTENSION_PLUGIN_RELEASE
-QT_TASKMENUEXTENSION_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_TRANSLATIONS_DIR
-QT_TRANSLATIONS_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC3_EXECUTABLE
-QT_UIC3_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_UIC_EXECUTABLE
-QT_UIC_EXECUTABLE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE
-QT_WORLDTIMECLOCKPLUGIN_PLUGIN_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_ICE_LIBRARY
-QT_X11_ICE_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_SM_LIBRARY
-QT_X11_SM_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_X11_LIBRARY
-QT_X11_X11_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_Xext_LIBRARY
-QT_X11_Xext_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_X11_m_LIBRARY
-QT_X11_m_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XCURSOR_LIBRARY
-QT_XCURSOR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XFIXES_LIBRARY
-QT_XFIXES_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XINERAMA_LIBRARY
-QT_XINERAMA_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XI_LIBRARY
-QT_XI_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRANDR_LIBRARY
-QT_XRANDR_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_XRENDER_LIBRARY
-QT_XRENDER_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: QT_ZLIB_LIBRARY
-QT_ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Have symbol Q_WS_MAC
-Q_WS_MAC:INTERNAL=
-//Have symbol Q_WS_QWS
-Q_WS_QWS:INTERNAL=
-//Have symbol Q_WS_WIN
-Q_WS_WIN:INTERNAL=
-//Have symbol Q_WS_X11
-Q_WS_X11:INTERNAL=1
-//Variable hidden from user
-Qt3_LIBRARY_INSTALLED:INTERNAL=
-//Variable hidden from user
-Qt4_LIBRARY_INSTALLED:INTERNAL=
-//hide this
-Qt_help_window_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_help_window.h
-//hide this
-Qt_widget_OpenGL_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_OpenGL.h
-//hide this
-Qt_widget_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget.h
-//hide this
-Qt_widget_history_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_history.h
-//hide this
-Qt_widget_layer_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_layer.h
-//hide this
-Qt_widget_standard_toolbar_h:INTERNAL=/home/lrineau/CGAL/CGAL-I/include/CGAL/IO/Qt_widget_standard_toolbar.h
-//ADVANCED property for variable: X11_ICE_INCLUDE_PATH
-X11_ICE_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_ICE_LIB
-X11_ICE_LIB-ADVANCED:INTERNAL=1
-//Have library /usr/lib64/libX11.so;/usr/lib64/libXext.so
-X11_LIB_X11_SOLO:INTERNAL=1
-//ADVANCED property for variable: X11_SM_INCLUDE_PATH
-X11_SM_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_SM_LIB
-X11_SM_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_INCLUDE_PATH
-X11_X11_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_X11_LIB
-X11_X11_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_INCLUDE_PATH
-X11_XRes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XRes_LIB
-X11_XRes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XShm_INCLUDE_PATH
-X11_XShm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XSync_INCLUDE_PATH
-X11_XSync_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_INCLUDE_PATH
-X11_XTest_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_XTest_LIB
-X11_XTest_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessrules_INCLUDE_PATH
-X11_Xaccessrules_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xaccessstr_INCLUDE_PATH
-X11_Xaccessstr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_INCLUDE_PATH
-X11_Xau_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xau_LIB
-X11_Xau_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_INCLUDE_PATH
-X11_Xcomposite_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcomposite_LIB
-X11_Xcomposite_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_INCLUDE_PATH
-X11_Xcursor_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xcursor_LIB
-X11_Xcursor_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_INCLUDE_PATH
-X11_Xdamage_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdamage_LIB
-X11_Xdamage_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_INCLUDE_PATH
-X11_Xdmcp_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xdmcp_LIB
-X11_Xdmcp_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xext_LIB
-X11_Xext_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_INCLUDE_PATH
-X11_Xfixes_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xfixes_LIB
-X11_Xfixes_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_INCLUDE_PATH
-X11_Xft_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xft_LIB
-X11_Xft_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_INCLUDE_PATH
-X11_Xi_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xi_LIB
-X11_Xi_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_INCLUDE_PATH
-X11_Xinerama_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinerama_LIB
-X11_Xinerama_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_INCLUDE_PATH
-X11_Xinput_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xinput_LIB
-X11_Xinput_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkb_INCLUDE_PATH
-X11_Xkb_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_INCLUDE_PATH
-X11_Xkbfile_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkbfile_LIB
-X11_Xkbfile_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xkblib_INCLUDE_PATH
-X11_Xkblib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xlib_INCLUDE_PATH
-X11_Xlib_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_INCLUDE_PATH
-X11_Xmu_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xmu_LIB
-X11_Xmu_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_INCLUDE_PATH
-X11_Xpm_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xpm_LIB
-X11_Xpm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_INCLUDE_PATH
-X11_Xrandr_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrandr_LIB
-X11_Xrandr_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_INCLUDE_PATH
-X11_Xrender_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xrender_LIB
-X11_Xrender_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_INCLUDE_PATH
-X11_Xscreensaver_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xscreensaver_LIB
-X11_Xscreensaver_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xshape_INCLUDE_PATH
-X11_Xshape_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_INCLUDE_PATH
-X11_Xt_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xt_LIB
-X11_Xt_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xutil_INCLUDE_PATH
-X11_Xutil_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_INCLUDE_PATH
-X11_Xv_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xv_LIB
-X11_Xv_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86misc_LIB
-X11_Xxf86misc_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_Xxf86vm_LIB
-X11_Xxf86vm_LIB-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_dpms_INCLUDE_PATH
-X11_dpms_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86misc_INCLUDE_PATH
-X11_xf86misc_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: X11_xf86vmode_INCLUDE_PATH
-X11_xf86vmode_INCLUDE_PATH-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY
-ZLIB_LIBRARY-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/usr/include
-//Last used Boost_LIBRARY_DIR_DEBUG value.
-_Boost_LIBRARY_DIR_DEBUG_LAST:INTERNAL=/usr/lib64
-//Last used Boost_LIBRARY_DIR_RELEASE value.
-_Boost_LIBRARY_DIR_RELEASE_LAST:INTERNAL=/usr/lib64
-//Last used Boost_NAMESPACE value.
-_Boost_NAMESPACE_LAST:INTERNAL=boost
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/setup
deleted file mode 100644
index 3e7582c51002..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/setup
+++ /dev/null
@@ -1,16 +0,0 @@
-REFS=/home/lrineau/infrastructure/reference-platforms
-CC=/usr/local/packages/llvm-trunk/bin/clang
-CXX=${CC}++
-export CXX CC 
-export QTDIR=/usr/lib64/qt-3.3
-source ${REFS}/setup-common
-
-CXXFLAGS="-fsanitize=address -DDONT_USE_BOOST_PROGRAM_OPTIONS"
-
-ASAN_OPTIONS="detect_leaks=1"
-LSAN_OPTIONS="suppressions=${REFS}/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/suppr.txt:print_suppressions=0"
-ASAN_SYMBOLIZER_PATH=/usr/local/packages/llvm-trunk/bin/llvm-symbolizer
-export ASAN_OPTIONS LSAN_OPTIONS ASAN_SYMBOLIZER_PATH
-
-ULIMIT_OPTIONS="-c 0 -t 3600 -v unlimited"
-export ULIMIT_OPTIONS
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/suppr.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/suppr.txt
deleted file mode 100644
index b9f9616610bf..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora19_llvm-clang-with-g++-4.8/suppr.txt
+++ /dev/null
@@ -1,2 +0,0 @@
-leak:nvidia/libGL
-leak:libtbb
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions/CMakeCache.txt
deleted file mode 100644
index 779d1af8cc0a..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions/CMakeCache.txt
+++ /dev/null
@@ -1,842 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build the doxygen documentation
-BUILD_DOC:BOOL=OFF
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory DEBUG
-Boost_LIBRARY_DIR_DEBUG:PATH=/usr/lib64
-
-//Boost library directory RELEASE
-Boost_LIBRARY_DIR_RELEASE:PATH=/usr/lib64
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions/Installation
-
-//Create CGAL from branch
-CGAL_BRANCH_BUILD:BOOL=ON
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//Script cgal_create_cmake_script, that creates CMakeLists.txt
-// files
-CGAL_CREATE_CMAKE_SCRIPT:FILEPATH=/home/lrineau/Git/cgal/Scripts/scripts/cgal_create_cmake_script
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -fp-model strict
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Enable the special targets "check_pkg_headers", and "check_pkg_<package>_headers"
-// for each package
-CGAL_ENABLE_CHECK_HEADERS:BOOL=OFF
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib64/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=/usr/local/share/doc/CGAL-4.9-I-900
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib64
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=/usr/local/share/man/man1
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libz.so;
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Dependencies for the target
-CGAL_Qt5_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;Qt5::OpenGL;general;Qt5::Svg;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;
-
-//Switch on to start (naive) detection of duplicate source- and
-// headerfiles in packages
-CGAL_REPORT_DUPLICATE_FILES:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/Git/cgal/Installation
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler
-CMAKE_CXX_COMPILER:FILEPATH=/opt/intel/compilers_and_libraries_2017/linux/bin/intel64/icpc
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-w1 -DDONT_USE_BOOST_PROGRAM_OPTIONS -fp-model strict
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release builds for minimum
-// size.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds.
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3
-
-//Flags used by the compiler during release builds with debug info.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
-
-//C compiler
-CMAKE_C_COMPILER:FILEPATH=/opt/intel/compilers_and_libraries_2017/linux/bin/intel64/icc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release builds for minimum
-// size.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds.
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DCGAL_NDEBUG
-
-//Flags used by the compiler during release builds with debug info.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//user executables (bin)
-CMAKE_INSTALL_BINDIR:PATH=bin
-
-//read-only architecture-independent data (DATAROOTDIR)
-CMAKE_INSTALL_DATADIR:PATH=
-
-//read-only architecture-independent data root (share)
-CMAKE_INSTALL_DATAROOTDIR:PATH=share
-
-//documentation root (DATAROOTDIR/doc/PROJECT_NAME)
-CMAKE_INSTALL_DOCDIR:PATH=
-
-//C header files (include)
-CMAKE_INSTALL_INCLUDEDIR:PATH=include
-
-//info documentation (DATAROOTDIR/info)
-CMAKE_INSTALL_INFODIR:PATH=
-
-//object code libraries (lib64)
-CMAKE_INSTALL_LIBDIR:PATH=lib64
-
-//program executables (libexec)
-CMAKE_INSTALL_LIBEXECDIR:PATH=libexec
-
-//locale-dependent data (DATAROOTDIR/locale)
-CMAKE_INSTALL_LOCALEDIR:PATH=
-
-//modifiable single-machine data (var)
-CMAKE_INSTALL_LOCALSTATEDIR:PATH=var
-
-//man documentation (DATAROOTDIR/man)
-CMAKE_INSTALL_MANDIR:PATH=
-
-//C header files for non-gcc (/usr/include)
-CMAKE_INSTALL_OLDINCLUDEDIR:PATH=/usr/include
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//system admin executables (sbin)
-CMAKE_INSTALL_SBINDIR:PATH=sbin
-
-//modifiable architecture-independent data (com)
-CMAKE_INSTALL_SHAREDSTATEDIR:PATH=com
-
-//read-only single-machine data (etc)
-CMAKE_INSTALL_SYSCONFDIR:PATH=etc
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=OFF
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//Value Computed by CMake
-Documentation_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions/Documentation/doc
-
-//Value Computed by CMake
-Documentation_SOURCE_DIR:STATIC=/home/lrineau/Git/cgal/Documentation/doc
-
-//git command line client
-GIT_EXECUTABLE:FILEPATH=/usr/bin/git
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//The directory containing a CMake configuration file for Qt5Core.
-Qt5Core_DIR:PATH=/usr/lib64/cmake/Qt5Core
-
-//The directory containing a CMake configuration file for Qt5Gui.
-Qt5Gui_DIR:PATH=/usr/lib64/cmake/Qt5Gui
-
-//The directory containing a CMake configuration file for Qt5OpenGL.
-Qt5OpenGL_DIR:PATH=/usr/lib64/cmake/Qt5OpenGL
-
-//The directory containing a CMake configuration file for Qt5Svg.
-Qt5Svg_DIR:PATH=/usr/lib64/cmake/Qt5Svg
-
-//The directory containing a CMake configuration file for Qt5Widgets.
-Qt5Widgets_DIR:PATH=/usr/lib64/cmake/Qt5Widgets
-
-//The directory containing a CMake configuration file for Qt5.
-Qt5_DIR:PATH=/usr/lib64/cmake/Qt5
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt5
-WITH_CGAL_Qt5:BOOL=OFF
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=OFF
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a program.
-XIAR:FILEPATH=/opt/intel/compilers_and_libraries_2017/linux/bin/intel64/xiar
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY_DEBUG:FILEPATH=ZLIB_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-ZLIB_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_DEBUG
-Boost_LIBRARY_DIR_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_RELEASE
-Boost_LIBRARY_DIR_RELEASE-ADVANCED:INTERNAL=1
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libboost_thread.so;/usr/lib64/libboost_system.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib64
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_BRANCH_BUILD
-CGAL_BRANCH_BUILD-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-//Test CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_DENORMALS_COMPILE_BUG
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_IEEE_754_BUG
-CGAL_CFG_IEEE_754_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_5
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_6
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_7
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_8
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_LIMITS
-CGAL_CFG_NO_LIMITS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_NEXTAFTER
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_STL
-CGAL_CFG_NO_STL:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NUMERIC_LIMITS_BUG
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_USING_BASE_MEMBER_BUG_2
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt5
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/Git/cgal/Core
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Core_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//CGAL version
-CGAL_FULL_VERSION:INTERNAL=4.9-I-900
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/Git/cgal/Installation
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_ImageIO_LIBRARY:INTERNAL=
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/Git/cgal/Maintenance
-CGAL_Qt5_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Qt5_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Qt5_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=4
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of external makefile project generator.
-CMAKE_EXTRA_GENERATOR:INTERNAL=
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator platform.
-CMAKE_GENERATOR_PLATFORM:INTERNAL=
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Source directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/Git/cgal
-//ADVANCED property for variable: CMAKE_INSTALL_BINDIR
-CMAKE_INSTALL_BINDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_DATADIR
-CMAKE_INSTALL_DATADIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_DATAROOTDIR
-CMAKE_INSTALL_DATAROOTDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_DOCDIR
-CMAKE_INSTALL_DOCDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_INCLUDEDIR
-CMAKE_INSTALL_INCLUDEDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_INFODIR
-CMAKE_INSTALL_INFODIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_LIBDIR
-CMAKE_INSTALL_LIBDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_LIBEXECDIR
-CMAKE_INSTALL_LIBEXECDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_LOCALEDIR
-CMAKE_INSTALL_LOCALEDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_LOCALSTATEDIR
-CMAKE_INSTALL_LOCALSTATEDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_MANDIR
-CMAKE_INSTALL_MANDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_OLDINCLUDEDIR
-CMAKE_INSTALL_OLDINCLUDEDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_SBINDIR
-CMAKE_INSTALL_SBINDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_SHAREDSTATEDIR
-CMAKE_INSTALL_SHAREDSTATEDIR-ADVANCED:INTERNAL=1
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//ADVANCED property for variable: CMAKE_INSTALL_SYSCONFDIR
-CMAKE_INSTALL_SYSCONFDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_MAKEFILES:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/usr/bin/uname
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-//Details about finding GMP
-FIND_PACKAGE_MESSAGE_DETAILS_GMP:INTERNAL=[/usr/lib64/libgmp.so][/usr/include][v()]
-//Details about finding MPFR
-FIND_PACKAGE_MESSAGE_DETAILS_MPFR:INTERNAL=[/usr/lib64/libmpfr.so][/usr/include][v()]
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-IntelCompiler_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-IntelCompiler_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: XIAR
-XIAR-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY_DEBUG
-ZLIB_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY_RELEASE
-ZLIB_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/usr/include
-//Last used Boost_LIBRARY_DIR_DEBUG value.
-_Boost_LIBRARY_DIR_DEBUG_LAST:INTERNAL=/usr/lib64
-//Last used Boost_LIBRARY_DIR_RELEASE value.
-_Boost_LIBRARY_DIR_RELEASE_LAST:INTERNAL=/usr/lib64
-//Last used Boost_NAMESPACE value.
-_Boost_NAMESPACE_LAST:INTERNAL=boost
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-//CMAKE_INSTALL_PREFIX during last run
-_GNUInstallDirs_LAST_CMAKE_INSTALL_PREFIX:INTERNAL=/usr/local
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions/setup
deleted file mode 100644
index ad648c265ae5..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17-with-assertions/setup
+++ /dev/null
@@ -1,5 +0,0 @@
-source /opt/intel/compilers_and_libraries_2017/linux/bin/compilervars.sh intel64
-CXX=icpc
-CC=icc
-CXXFLAGS="-w1 -DDONT_USE_BOOST_PROGRAM_OPTIONS"
-export CXX CC CXXFLAGS
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17/CMakeCache.txt b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17/CMakeCache.txt
deleted file mode 100644
index 90c55079c7ee..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17/CMakeCache.txt
+++ /dev/null
@@ -1,842 +0,0 @@
-# This is the CMakeCache file.
-# For build in directory: /home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17
-# It was generated by CMake: /usr/bin/cmake
-# You can edit this file to change values found and used by cmake.
-# If you do not want to change any of the values, simply exit the editor.
-# If you do want to change a value, simply edit, save, and exit the editor.
-# The syntax for the file is as follows:
-# KEY:TYPE=VALUE
-# KEY is the name of a variable in the cache.
-# TYPE is a hint to GUIs for the type of VALUE, DO NOT EDIT TYPE!.
-# VALUE is the current value for the KEY.
-
-########################
-# EXTERNAL cache entries
-########################
-
-//Build the doxygen documentation
-BUILD_DOC:BOOL=OFF
-
-//Build shared libraries
-BUILD_SHARED_LIBS:BOOL=ON
-
-//Activate the debug messages of the script FindBoost
-Boost_DEBUG:BOOL=OFF
-
-//Path to a file.
-Boost_INCLUDE_DIR:PATH=/usr/include
-
-//Boost library directory DEBUG
-Boost_LIBRARY_DIR_DEBUG:PATH=/usr/lib64
-
-//Boost library directory RELEASE
-Boost_LIBRARY_DIR_RELEASE:PATH=/usr/lib64
-
-//Boost system library (debug)
-Boost_SYSTEM_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost system library (release)
-Boost_SYSTEM_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_system.so
-
-//Boost thread library (debug)
-Boost_THREAD_LIBRARY_DEBUG:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Boost thread library (release)
-Boost_THREAD_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libboost_thread.so
-
-//Value Computed by CMake
-CGAL_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17/Installation
-
-//Create CGAL from branch
-CGAL_BRANCH_BUILD:BOOL=ON
-
-//Link with static Boost libraries
-CGAL_Boost_USE_STATIC_LIBS:BOOL=OFF
-
-//Script cgal_create_cmake_script, that creates CMakeLists.txt
-// files
-CGAL_CREATE_CMAKE_SCRIPT:FILEPATH=/home/lrineau/Git/cgal/Scripts/scripts/cgal_create_cmake_script
-
-//User-defined flags
-CGAL_CXX_FLAGS:STRING= -fp-model strict
-
-//Dependencies for the target
-CGAL_Core_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Set this to TRUE if you want to define or modify any of CMAKE_*_FLAGS.
-// When this is FALSE, all the CMAKE_*_FLAGS flags are overriden
-// with the values used when building the CGAL libs. For CGAL_*_flags
-// (used for ADDITIONAL flags) , there is no need to set this to
-// TRUE.
-CGAL_DONT_OVERRIDE_CMAKE_FLAGS:BOOL=TRUE
-
-//Enable the special targets "check_pkg_headers", and "check_pkg_<package>_headers"
-// for each package
-CGAL_ENABLE_CHECK_HEADERS:BOOL=OFF
-
-//Select to allow to preconfiguration of external libraries
-CGAL_ENABLE_PRECONFIG:BOOL=ON
-
-//The folder where CGAL user-side scripts will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_BIN_DIR:STRING=bin
-
-//The folder where CGAL CMake modules will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_CMAKE_DIR:STRING=lib64/CGAL
-
-//The folder where CGAL documentation and license files will be
-// installed, relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_DOC_DIR:STRING=/usr/local/share/doc/CGAL-4.9-I-900
-
-//The folder where CGAL header files will be installed, relative
-// to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_INC_DIR:STRING=include
-
-//The folder where CGAL libraries will be installed, relative to
-// CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_LIB_DIR:STRING=lib64
-
-//The folder where manual pages for CGAL scripts will be installed,
-// relative to CMAKE_INSTALL_PREFIX
-CGAL_INSTALL_MAN_DIR:STRING=/usr/local/share/man/man1
-
-//Dependencies for the target
-CGAL_ImageIO_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;general;/usr/lib64/libz.so;
-
-//Dependencies for the target
-CGAL_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;
-
-//Dependencies for the target
-CGAL_Qt5_LIB_DEPENDS:STATIC=general;/usr/lib64/libmpfr.so;general;/usr/lib64/libgmp.so;general;Qt5::OpenGL;general;Qt5::Svg;general;CGAL;general;/usr/lib64/libboost_thread.so;general;/usr/lib64/libboost_system.so;general;/usr/lib64/libGLU.so;general;/usr/lib64/libGL.so;
-
-//Switch on to start (naive) detection of duplicate source- and
-// headerfiles in packages
-CGAL_REPORT_DUPLICATE_FILES:BOOL=OFF
-
-//Value Computed by CMake
-CGAL_SOURCE_DIR:STATIC=/home/lrineau/Git/cgal/Installation
-
-//Path to a program.
-CMAKE_AR:FILEPATH=/usr/bin/ar
-
-//Build type: Release or Debug
-CMAKE_BUILD_TYPE:STRING=Release
-
-//Enable/Disable color output during build.
-CMAKE_COLOR_MAKEFILE:BOOL=ON
-
-//CXX compiler
-CMAKE_CXX_COMPILER:FILEPATH=/opt/intel/compilers_and_libraries_2017/linux/bin/intel64/icpc
-
-//User-defined flags
-CMAKE_CXX_FLAGS:STRING=-w1 -DDONT_USE_BOOST_PROGRAM_OPTIONS -fp-model strict
-
-//Flags used by the compiler during debug builds.
-CMAKE_CXX_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release builds for minimum
-// size.
-CMAKE_CXX_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds.
-CMAKE_CXX_FLAGS_RELEASE:STRING=-O3 -DCGAL_NDEBUG
-
-//Flags used by the compiler during release builds with debug info.
-CMAKE_CXX_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
-
-//C compiler
-CMAKE_C_COMPILER:FILEPATH=/opt/intel/compilers_and_libraries_2017/linux/bin/intel64/icc
-
-//Flags used by the compiler during all build types.
-CMAKE_C_FLAGS:STRING=
-
-//Flags used by the compiler during debug builds.
-CMAKE_C_FLAGS_DEBUG:STRING=-g
-
-//Flags used by the compiler during release builds for minimum
-// size.
-CMAKE_C_FLAGS_MINSIZEREL:STRING=-Os -DNDEBUG
-
-//Flags used by the compiler during release builds.
-CMAKE_C_FLAGS_RELEASE:STRING=-O3 -DCGAL_NDEBUG
-
-//Flags used by the compiler during release builds with debug info.
-CMAKE_C_FLAGS_RELWITHDEBINFO:STRING=-O2 -g -DNDEBUG
-
-//Flags used by the linker.
-CMAKE_EXE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_EXE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_EXE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Enable/Disable output of compile commands during generation.
-CMAKE_EXPORT_COMPILE_COMMANDS:BOOL=OFF
-
-//user executables (bin)
-CMAKE_INSTALL_BINDIR:PATH=bin
-
-//read-only architecture-independent data (DATAROOTDIR)
-CMAKE_INSTALL_DATADIR:PATH=
-
-//read-only architecture-independent data root (share)
-CMAKE_INSTALL_DATAROOTDIR:PATH=share
-
-//documentation root (DATAROOTDIR/doc/PROJECT_NAME)
-CMAKE_INSTALL_DOCDIR:PATH=
-
-//C header files (include)
-CMAKE_INSTALL_INCLUDEDIR:PATH=include
-
-//info documentation (DATAROOTDIR/info)
-CMAKE_INSTALL_INFODIR:PATH=
-
-//object code libraries (lib64)
-CMAKE_INSTALL_LIBDIR:PATH=lib64
-
-//program executables (libexec)
-CMAKE_INSTALL_LIBEXECDIR:PATH=libexec
-
-//locale-dependent data (DATAROOTDIR/locale)
-CMAKE_INSTALL_LOCALEDIR:PATH=
-
-//modifiable single-machine data (var)
-CMAKE_INSTALL_LOCALSTATEDIR:PATH=var
-
-//man documentation (DATAROOTDIR/man)
-CMAKE_INSTALL_MANDIR:PATH=
-
-//C header files for non-gcc (/usr/include)
-CMAKE_INSTALL_OLDINCLUDEDIR:PATH=/usr/include
-
-//Install path prefix, prepended onto install directories.
-CMAKE_INSTALL_PREFIX:PATH=/usr/local
-
-//system admin executables (sbin)
-CMAKE_INSTALL_SBINDIR:PATH=sbin
-
-//modifiable architecture-independent data (com)
-CMAKE_INSTALL_SHAREDSTATEDIR:PATH=com
-
-//read-only single-machine data (etc)
-CMAKE_INSTALL_SYSCONFDIR:PATH=etc
-
-//Path to a program.
-CMAKE_LINKER:FILEPATH=/usr/bin/ld
-
-//Path to a program.
-CMAKE_MAKE_PROGRAM:FILEPATH=/usr/bin/gmake
-
-//Flags used by the linker during the creation of modules.
-CMAKE_MODULE_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_MODULE_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_MODULE_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_NM:FILEPATH=/usr/bin/nm
-
-//Path to a program.
-CMAKE_OBJCOPY:FILEPATH=/usr/bin/objcopy
-
-//Path to a program.
-CMAKE_OBJDUMP:FILEPATH=/usr/bin/objdump
-
-//Value Computed by CMake
-CMAKE_PROJECT_NAME:STATIC=CGAL
-
-//Path to a program.
-CMAKE_RANLIB:FILEPATH=/usr/bin/ranlib
-
-//Flags used by the linker during the creation of dll's.
-CMAKE_SHARED_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_SHARED_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_SHARED_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//If set, runtime paths are not added when installing shared libraries,
-// but are added when building.
-CMAKE_SKIP_INSTALL_RPATH:BOOL=OFF
-
-//If set, runtime paths are not added when using shared libraries.
-CMAKE_SKIP_RPATH:BOOL=OFF
-
-//Flags used by the linker during the creation of static libraries.
-CMAKE_STATIC_LINKER_FLAGS:STRING=
-
-//Flags used by the linker during debug builds.
-CMAKE_STATIC_LINKER_FLAGS_DEBUG:STRING=
-
-//Flags used by the linker during release minsize builds.
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL:STRING=
-
-//Flags used by the linker during release builds.
-CMAKE_STATIC_LINKER_FLAGS_RELEASE:STRING=
-
-//Flags used by the linker during Release with Debug Info builds.
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO:STRING=
-
-//Path to a program.
-CMAKE_STRIP:FILEPATH=/usr/bin/strip
-
-//If this value is on, makefiles will be generated without the
-// .SILENT directive, and all commands will be echoed to the console
-// during the make.  This is useful for debugging only. With Visual
-// Studio IDE projects all commands are done without /nologo.
-CMAKE_VERBOSE_MAKEFILE:BOOL=OFF
-
-//Value Computed by CMake
-Documentation_BINARY_DIR:STATIC=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17/Documentation/doc
-
-//Value Computed by CMake
-Documentation_SOURCE_DIR:STATIC=/home/lrineau/Git/cgal/Documentation/doc
-
-//git command line client
-GIT_EXECUTABLE:FILEPATH=/usr/bin/git
-
-//The directory containing the GMP header files
-GMP_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the GMP library
-GMP_LIBRARIES:FILEPATH=/usr/lib64/libgmp.so
-
-GMP_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//The directory containing the MPFR header files
-MPFR_INCLUDE_DIR:PATH=/usr/include
-
-//Path to the MPFR library
-MPFR_LIBRARIES:FILEPATH=/usr/lib64/libmpfr.so
-
-MPFR_LIBRARIES_DIR:FILEPATH=/usr/lib64
-
-//Path to a file.
-OPENGL_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-OPENGL_gl_LIBRARY:FILEPATH=/usr/lib64/libGL.so
-
-//Path to a library.
-OPENGL_glu_LIBRARY:FILEPATH=/usr/lib64/libGLU.so
-
-//Path to a file.
-OPENGL_xmesa_INCLUDE_DIR:PATH=OPENGL_xmesa_INCLUDE_DIR-NOTFOUND
-
-//The directory containing a CMake configuration file for Qt5Core.
-Qt5Core_DIR:PATH=/usr/lib64/cmake/Qt5Core
-
-//The directory containing a CMake configuration file for Qt5Gui.
-Qt5Gui_DIR:PATH=/usr/lib64/cmake/Qt5Gui
-
-//The directory containing a CMake configuration file for Qt5OpenGL.
-Qt5OpenGL_DIR:PATH=/usr/lib64/cmake/Qt5OpenGL
-
-//The directory containing a CMake configuration file for Qt5Svg.
-Qt5Svg_DIR:PATH=/usr/lib64/cmake/Qt5Svg
-
-//The directory containing a CMake configuration file for Qt5Widgets.
-Qt5Widgets_DIR:PATH=/usr/lib64/cmake/Qt5Widgets
-
-//The directory containing a CMake configuration file for Qt5.
-Qt5_DIR:PATH=/usr/lib64/cmake/Qt5
-
-//Select external library BLAS
-WITH_BLAS:BOOL=OFF
-
-//Enable CGAL component CGAL_Core
-WITH_CGAL_Core:BOOL=ON
-
-//Enable CGAL component CGAL_ImageIO
-WITH_CGAL_ImageIO:BOOL=ON
-
-//Enable CGAL component CGAL_Qt5
-WITH_CGAL_Qt5:BOOL=OFF
-
-//Select external library Coin3D
-WITH_Coin3D:BOOL=OFF
-
-//Select external library ESBTL
-WITH_ESBTL:BOOL=OFF
-
-//Select external library Eigen3
-WITH_Eigen3:BOOL=OFF
-
-//Select external library GMP
-WITH_GMP:BOOL=ON
-
-//Select external library GMPXX
-WITH_GMPXX:BOOL=OFF
-
-//Select external library IPE
-WITH_IPE:BOOL=OFF
-
-//Select external library LAPACK
-WITH_LAPACK:BOOL=OFF
-
-//Select external library LEDA
-WITH_LEDA:BOOL=OFF
-
-//Select external library MPFI
-WITH_MPFI:BOOL=OFF
-
-//Select external library MPFR
-WITH_MPFR:BOOL=ON
-
-//Select external library NTL
-WITH_NTL:BOOL=OFF
-
-//Select external library OpenGL
-WITH_OpenGL:BOOL=OFF
-
-//Select external library OpenNL
-WITH_OpenNL:BOOL=OFF
-
-//Select external library QGLViewer
-WITH_QGLViewer:BOOL=OFF
-
-//Select external library RS
-WITH_RS:BOOL=OFF
-
-//Select external library RS3
-WITH_RS3:BOOL=OFF
-
-//Select external library ZLIB
-WITH_ZLIB:BOOL=OFF
-
-//Select demos
-WITH_demos:BOOL=OFF
-
-//Select examples
-WITH_examples:BOOL=OFF
-
-//Select tests
-WITH_tests:BOOL=OFF
-
-//Path to a program.
-XIAR:FILEPATH=/opt/intel/compilers_and_libraries_2017/linux/bin/intel64/xiar
-
-//Path to a file.
-ZLIB_INCLUDE_DIR:PATH=/usr/include
-
-//Path to a library.
-ZLIB_LIBRARY_DEBUG:FILEPATH=ZLIB_LIBRARY_DEBUG-NOTFOUND
-
-//Path to a library.
-ZLIB_LIBRARY_RELEASE:FILEPATH=/usr/lib64/libz.so
-
-
-########################
-# INTERNAL cache entries
-########################
-
-//ADVANCED property for variable: Boost_DEBUG
-Boost_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_INCLUDE_DIR
-Boost_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_DEBUG
-Boost_LIBRARY_DIR_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_LIBRARY_DIR_RELEASE
-Boost_LIBRARY_DIR_RELEASE-ADVANCED:INTERNAL=1
-//Avoid future search of boost-cmake
-Boost_NO_BOOST_CMAKE:INTERNAL=TRUE
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_DEBUG
-Boost_SYSTEM_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_SYSTEM_LIBRARY_RELEASE
-Boost_SYSTEM_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_DEBUG
-Boost_THREAD_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: Boost_THREAD_LIBRARY_RELEASE
-Boost_THREAD_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-CGAL_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include
-CGAL_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libboost_thread.so;/usr/lib64/libboost_system.so
-CGAL_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=/usr/lib64
-CGAL_3RD_PARTY_PRECONFIGURED:INTERNAL=
-//ADVANCED property for variable: CGAL_BRANCH_BUILD
-CGAL_BRANCH_BUILD-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CGAL_Boost_USE_STATIC_LIBS
-CGAL_Boost_USE_STATIC_LIBS-ADVANCED:INTERNAL=1
-//Test CGAL_CFG_BOOST_VARIANT_SWAP_BUG
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_BOOST_VARIANT_SWAP_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_DENORMALS_COMPILE_BUG
-CGAL_CFG_DENORMALS_COMPILE_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_DENORMALS_COMPILE_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_FPU_ROUNDING_MODE_UNWINDING_VC_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_IEEE_754_BUG
-CGAL_CFG_IEEE_754_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_IEEE_754_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_ISTREAM_INT_BUG
-CGAL_CFG_ISTREAM_INT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_ISTREAM_INT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_5
-CGAL_CFG_MATCHING_BUG_5:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_5_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_6
-CGAL_CFG_MATCHING_BUG_6:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_6_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_7
-CGAL_CFG_MATCHING_BUG_7:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_7_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_MATCHING_BUG_8
-CGAL_CFG_MATCHING_BUG_8:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_MATCHING_BUG_8_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NESTED_CLASS_FRIEND_DECLARATION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_LIMITS
-CGAL_CFG_NO_LIMITS:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_LIMITS_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_NEXTAFTER
-CGAL_CFG_NO_NEXTAFTER:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_NEXTAFTER_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NO_STL
-CGAL_CFG_NO_STL:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NO_STL_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_NUMERIC_LIMITS_BUG
-CGAL_CFG_NUMERIC_LIMITS_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_NUMERIC_LIMITS_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_OUTOFLINE_MEMBER_DEFINITION_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TEMPLATE_IN_DEFAULT_PARAMETER_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_TYPENAME_BEFORE_DEFAULT_ARGUMENT_BUG_COMPILED:INTERNAL=TRUE
-//Test CGAL_CFG_USING_BASE_MEMBER_BUG_2
-CGAL_CFG_USING_BASE_MEMBER_BUG_2:INTERNAL=1
-//Result of TRY_COMPILE
-CGAL_CFG_USING_BASE_MEMBER_BUG_2_COMPILED:INTERNAL=TRUE
-CGAL_CONFIGURED_LIBRARIES:INTERNAL=CGAL_Core;CGAL_ImageIO;CGAL_Qt5
-//Directory containing the Core package
-CGAL_CORE_PACKAGE_DIR:INTERNAL=/home/lrineau/Git/cgal/Core
-CGAL_Core_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Core_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Core_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Core_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_ESSENTIAL_3RD_PARTY_LIBRARIES:INTERNAL=GMP;MPFR
-CGAL_EXECUTABLE_TARGETS:INTERNAL=
-//Variable hidden from user
-CGAL_EXT_LIB_BLAS_PREFIX:INTERNAL=BLAS
-//Variable hidden from user
-CGAL_EXT_LIB_Coin3D_PREFIX:INTERNAL=COIN3D
-//Variable hidden from user
-CGAL_EXT_LIB_ESBTL_PREFIX:INTERNAL=ESBTL
-//Variable hidden from user
-CGAL_EXT_LIB_Eigen3_PREFIX:INTERNAL=EIGEN3
-//Variable hidden from user
-CGAL_EXT_LIB_GMPXX_PREFIX:INTERNAL=GMPXX
-//Variable hidden from user
-CGAL_EXT_LIB_GMP_PREFIX:INTERNAL=GMP
-//Variable hidden from user
-CGAL_EXT_LIB_IPE_PREFIX:INTERNAL=IPE
-//Variable hidden from user
-CGAL_EXT_LIB_LAPACK_PREFIX:INTERNAL=LAPACK
-//Variable hidden from user
-CGAL_EXT_LIB_LEDA_PREFIX:INTERNAL=LEDA
-//Variable hidden from user
-CGAL_EXT_LIB_MPFI_PREFIX:INTERNAL=MPFI
-//Variable hidden from user
-CGAL_EXT_LIB_MPFR_PREFIX:INTERNAL=MPFR
-//Variable hidden from user
-CGAL_EXT_LIB_NTL_PREFIX:INTERNAL=NTL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenGL_PREFIX:INTERNAL=OpenGL
-//Variable hidden from user
-CGAL_EXT_LIB_OpenNL_PREFIX:INTERNAL=OpenNL
-//Variable hidden from user
-CGAL_EXT_LIB_QGLViewer_PREFIX:INTERNAL=QGLVIEWER
-//Variable hidden from user
-CGAL_EXT_LIB_RS3_PREFIX:INTERNAL=RS3
-//Variable hidden from user
-CGAL_EXT_LIB_RS_PREFIX:INTERNAL=RS
-//Variable hidden from user
-CGAL_EXT_LIB_ZLIB_PREFIX:INTERNAL=ZLIB
-//CGAL version
-CGAL_FULL_VERSION:INTERNAL=4.9-I-900
-//Directory containing the Installation package
-CGAL_INSTALLATION_PACKAGE_DIR:INTERNAL=/home/lrineau/Git/cgal/Installation
-CGAL_ImageIO_3RD_PARTY_DEFINITIONS:INTERNAL=-DCGAL_USE_ZLIB
-CGAL_ImageIO_3RD_PARTY_INCLUDE_DIRS:INTERNAL=/usr/include;/usr/include
-CGAL_ImageIO_3RD_PARTY_LIBRARIES:INTERNAL=/usr/lib64/libGLU.so;/usr/lib64/libGL.so;/usr/lib64/libz.so
-CGAL_ImageIO_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_ImageIO_LIBRARY:INTERNAL=
-CGAL_ImageIO_USE_ZLIB:INTERNAL=ON
-//Directory containing the Maintenance package
-CGAL_MAINTENANCE_PACKAGE_DIR:INTERNAL=/home/lrineau/Git/cgal/Maintenance
-CGAL_Qt5_3RD_PARTY_DEFINITIONS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_INCLUDE_DIRS:INTERNAL=
-CGAL_Qt5_3RD_PARTY_LIBRARIES:INTERNAL=
-CGAL_Qt5_3RD_PARTY_LIBRARIES_DIRS:INTERNAL=
-CGAL_Qt5_LIBRARY:INTERNAL=
-//Variable hidden from user
-CGAL_SUPPORTING_3RD_PARTY_LIBRARIES:INTERNAL=GMP;GMPXX;MPFR;ZLIB;OpenGL;LEDA;MPFI;RS;RS3;OpenNL;Eigen3;BLAS;LAPACK;QGLViewer;ESBTL;Coin3D;NTL;IPE
-//ADVANCED property for variable: CMAKE_AR
-CMAKE_AR-ADVANCED:INTERNAL=1
-//This is the directory where this CMakeCache.txt was created
-CMAKE_CACHEFILE_DIR:INTERNAL=/home/lrineau/infrastructure/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17
-//Major version of cmake used to create the current loaded cache
-CMAKE_CACHE_MAJOR_VERSION:INTERNAL=3
-//Minor version of cmake used to create the current loaded cache
-CMAKE_CACHE_MINOR_VERSION:INTERNAL=4
-//Patch version of cmake used to create the current loaded cache
-CMAKE_CACHE_PATCH_VERSION:INTERNAL=1
-//ADVANCED property for variable: CMAKE_COLOR_MAKEFILE
-CMAKE_COLOR_MAKEFILE-ADVANCED:INTERNAL=1
-//Path to CMake executable.
-CMAKE_COMMAND:INTERNAL=/usr/bin/cmake
-//Path to cpack program executable.
-CMAKE_CPACK_COMMAND:INTERNAL=/usr/bin/cpack
-//Path to ctest program executable.
-CMAKE_CTEST_COMMAND:INTERNAL=/usr/bin/ctest
-//ADVANCED property for variable: CMAKE_CXX_COMPILER
-CMAKE_CXX_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS
-CMAKE_CXX_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_DEBUG
-CMAKE_CXX_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_MINSIZEREL
-CMAKE_CXX_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELEASE
-CMAKE_CXX_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_CXX_FLAGS_RELWITHDEBINFO
-CMAKE_CXX_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_COMPILER
-CMAKE_C_COMPILER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS
-CMAKE_C_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_DEBUG
-CMAKE_C_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_MINSIZEREL
-CMAKE_C_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELEASE
-CMAKE_C_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_C_FLAGS_RELWITHDEBINFO
-CMAKE_C_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//Path to cache edit program executable.
-CMAKE_EDIT_COMMAND:INTERNAL=/usr/bin/cmake-gui
-//Executable file format
-CMAKE_EXECUTABLE_FORMAT:INTERNAL=ELF
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS
-CMAKE_EXE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_DEBUG
-CMAKE_EXE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_MINSIZEREL
-CMAKE_EXE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELEASE
-CMAKE_EXE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_EXE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_EXPORT_COMPILE_COMMANDS
-CMAKE_EXPORT_COMPILE_COMMANDS-ADVANCED:INTERNAL=1
-//Name of external makefile project generator.
-CMAKE_EXTRA_GENERATOR:INTERNAL=
-//Name of generator.
-CMAKE_GENERATOR:INTERNAL=Unix Makefiles
-//Name of generator platform.
-CMAKE_GENERATOR_PLATFORM:INTERNAL=
-//Name of generator toolset.
-CMAKE_GENERATOR_TOOLSET:INTERNAL=
-//Source directory with the top level CMakeLists.txt file for this
-// project
-CMAKE_HOME_DIRECTORY:INTERNAL=/home/lrineau/Git/cgal
-//ADVANCED property for variable: CMAKE_INSTALL_BINDIR
-CMAKE_INSTALL_BINDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_DATADIR
-CMAKE_INSTALL_DATADIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_DATAROOTDIR
-CMAKE_INSTALL_DATAROOTDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_DOCDIR
-CMAKE_INSTALL_DOCDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_INCLUDEDIR
-CMAKE_INSTALL_INCLUDEDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_INFODIR
-CMAKE_INSTALL_INFODIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_LIBDIR
-CMAKE_INSTALL_LIBDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_LIBEXECDIR
-CMAKE_INSTALL_LIBEXECDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_LOCALEDIR
-CMAKE_INSTALL_LOCALEDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_LOCALSTATEDIR
-CMAKE_INSTALL_LOCALSTATEDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_MANDIR
-CMAKE_INSTALL_MANDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_OLDINCLUDEDIR
-CMAKE_INSTALL_OLDINCLUDEDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_SBINDIR
-CMAKE_INSTALL_SBINDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_INSTALL_SHAREDSTATEDIR
-CMAKE_INSTALL_SHAREDSTATEDIR-ADVANCED:INTERNAL=1
-//Install .so files without execute permission.
-CMAKE_INSTALL_SO_NO_EXE:INTERNAL=0
-//ADVANCED property for variable: CMAKE_INSTALL_SYSCONFDIR
-CMAKE_INSTALL_SYSCONFDIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_LINKER
-CMAKE_LINKER-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MAKE_PROGRAM
-CMAKE_MAKE_PROGRAM-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS
-CMAKE_MODULE_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_DEBUG
-CMAKE_MODULE_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL
-CMAKE_MODULE_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELEASE
-CMAKE_MODULE_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_MODULE_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_NM
-CMAKE_NM-ADVANCED:INTERNAL=1
-//number of local generators
-CMAKE_NUMBER_OF_MAKEFILES:INTERNAL=7
-//ADVANCED property for variable: CMAKE_OBJCOPY
-CMAKE_OBJCOPY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_OBJDUMP
-CMAKE_OBJDUMP-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_RANLIB
-CMAKE_RANLIB-ADVANCED:INTERNAL=1
-//Path to CMake installation.
-CMAKE_ROOT:INTERNAL=/usr/share/cmake
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS
-CMAKE_SHARED_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_DEBUG
-CMAKE_SHARED_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL
-CMAKE_SHARED_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELEASE
-CMAKE_SHARED_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_SHARED_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_INSTALL_RPATH
-CMAKE_SKIP_INSTALL_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_SKIP_RPATH
-CMAKE_SKIP_RPATH-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS
-CMAKE_STATIC_LINKER_FLAGS-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_DEBUG
-CMAKE_STATIC_LINKER_FLAGS_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL
-CMAKE_STATIC_LINKER_FLAGS_MINSIZEREL-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELEASE
-CMAKE_STATIC_LINKER_FLAGS_RELEASE-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO
-CMAKE_STATIC_LINKER_FLAGS_RELWITHDEBINFO-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: CMAKE_STRIP
-CMAKE_STRIP-ADVANCED:INTERNAL=1
-//Suppress Warnings that are meant for the author of the CMakeLists.txt
-// files.
-CMAKE_SUPPRESS_DEVELOPER_WARNINGS:INTERNAL=FALSE
-//uname command
-CMAKE_UNAME:INTERNAL=/usr/bin/uname
-//ADVANCED property for variable: CMAKE_VERBOSE_MAKEFILE
-CMAKE_VERBOSE_MAKEFILE-ADVANCED:INTERNAL=1
-//Details about finding GMP
-FIND_PACKAGE_MESSAGE_DETAILS_GMP:INTERNAL=[/usr/lib64/libgmp.so][/usr/include][v()]
-//Details about finding MPFR
-FIND_PACKAGE_MESSAGE_DETAILS_MPFR:INTERNAL=[/usr/lib64/libmpfr.so][/usr/include][v()]
-//Details about finding OpenGL
-FIND_PACKAGE_MESSAGE_DETAILS_OpenGL:INTERNAL=[/usr/lib64/libGL.so][/usr/include][v()]
-//Details about finding ZLIB
-FIND_PACKAGE_MESSAGE_DETAILS_ZLIB:INTERNAL=[/usr/lib64/libz.so][/usr/include][v1.2.8()]
-//Result of TRY_COMPILE
-GMP_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-GMP_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-IntelCompiler_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-IntelCompiler_RUN_RES:INTERNAL=0
-//Result of TRY_COMPILE
-MPFR_COMPILE_RES:INTERNAL=TRUE
-//Result of TRY_RUN
-MPFR_RUN_RES:INTERNAL=0
-//ADVANCED property for variable: OPENGL_INCLUDE_DIR
-OPENGL_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_gl_LIBRARY
-OPENGL_gl_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_glu_LIBRARY
-OPENGL_glu_LIBRARY-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: OPENGL_xmesa_INCLUDE_DIR
-OPENGL_xmesa_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: XIAR
-XIAR-ADVANCED:INTERNAL=1
-//Result of TRY_COMPILE
-ZLIB_COMPILE_RES:INTERNAL=TRUE
-//ADVANCED property for variable: ZLIB_INCLUDE_DIR
-ZLIB_INCLUDE_DIR-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY_DEBUG
-ZLIB_LIBRARY_DEBUG-ADVANCED:INTERNAL=1
-//ADVANCED property for variable: ZLIB_LIBRARY_RELEASE
-ZLIB_LIBRARY_RELEASE-ADVANCED:INTERNAL=1
-//Result of TRY_RUN
-ZLIB_RUN_RES:INTERNAL=0
-//Last used Boost_ADDITIONAL_VERSIONS value.
-_Boost_ADDITIONAL_VERSIONS_LAST:INTERNAL=1.69.1;1.69.0;1.69;1.68.1;1.68.0;1.68;1.67.1;1.67.0;1.67;1.66.1;1.66.0;1.66;1.65.1;1.65.0;1.65;1.64.1;1.64.0;1.64;1.63.1;1.63.0;1.63;1.62.1;1.62.0;1.62;1.61.1;1.61.0;1.61;1.60.1;1.60.0;1.60;1.59.1;1.59.0;1.59;1.58.1;1.58.0;1.58;1.57.1;1.57.0;1.57;1.56.1;1.56.0;1.56;1.55.1;1.55.0;1.55;1.54.1;1.54.0;1.54;1.53.1;1.53.0;1.53;1.52.1;1.52.0;1.52;1.51.1;1.51.0;1.51;1.50.1;1.50.0;1.50;1.49.1;1.49.0;1.49;1.48.1;1.48.0;1.48;1.47.1;1.47.0;1.47;1.46.1;1.46.0;1.46;1.45.1;1.45.0;1.45;1.44.1;1.44.0;1.44;1.43.1;1.43.0;1.43;1.42.1;1.42.0;1.42;1.41.1;1.41.0;1.41;1.40.1;1.40.0;1.40;1.39.1;1.39.0;1.39;1.38.1;1.38.0;1.38;1.37.1;1.37.0;1.37
-//Components requested for this build tree.
-_Boost_COMPONENTS_SEARCHED:INTERNAL=system;thread
-//Last used Boost_INCLUDE_DIR value.
-_Boost_INCLUDE_DIR_LAST:INTERNAL=/usr/include
-//Last used Boost_LIBRARY_DIR_DEBUG value.
-_Boost_LIBRARY_DIR_DEBUG_LAST:INTERNAL=/usr/lib64
-//Last used Boost_LIBRARY_DIR_RELEASE value.
-_Boost_LIBRARY_DIR_RELEASE_LAST:INTERNAL=/usr/lib64
-//Last used Boost_NAMESPACE value.
-_Boost_NAMESPACE_LAST:INTERNAL=boost
-//Last used Boost_USE_MULTITHREADED value.
-_Boost_USE_MULTITHREADED_LAST:INTERNAL=TRUE
-//Last used Boost_USE_STATIC_LIBS value.
-_Boost_USE_STATIC_LIBS_LAST:INTERNAL=OFF
-//CMAKE_INSTALL_PREFIX during last run
-_GNUInstallDirs_LAST_CMAKE_INSTALL_PREFIX:INTERNAL=/usr/local
-
diff --git a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17/setup b/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17/setup
deleted file mode 100644
index ad648c265ae5..000000000000
--- a/Maintenance/infrastructure/renoir.geometryfactory.com/reference-platforms/x86-64_Linux-Fedora_IntelCompiler-17/setup
+++ /dev/null
@@ -1,5 +0,0 @@
-source /opt/intel/compilers_and_libraries_2017/linux/bin/compilervars.sh intel64
-CXX=icpc
-CC=icc
-CXXFLAGS="-w1 -DDONT_USE_BOOST_PROGRAM_OPTIONS"
-export CXX CC CXXFLAGS

From c19cd150cb54d05513fe61720cbe7b194178b5f0 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 29 Nov 2023 16:34:50 +0100
Subject: [PATCH 1091/1398] extra cleanups

---
 Installation/LICENSE | 2 --
 copyright            | 1 -
 2 files changed, 3 deletions(-)

diff --git a/Installation/LICENSE b/Installation/LICENSE
index 6babe11444e5..fd3725a9ead5 100644
--- a/Installation/LICENSE
+++ b/Installation/LICENSE
@@ -30,8 +30,6 @@ licenses:
   licensed under the LGPL (see LICENSE.LGPL).
 - ImageIO, in the directory "src/CGAL_ImageIO", is licensed under the LGPL
   (see LICENSE.LGPL).
-- OpenNL, in the directory "include/CGAL/OpenNL", is licensed under the LGPL
-  (see LICENSE.LGPL).
 - ETH Zurich random forest algorithm, in the directory "CGAL/Classification/ETHZ",
   is licensed under a MIT like license (see LICENSE.RFL).
 
diff --git a/copyright b/copyright
index 68da331f8205..b32d3a58fc8a 100644
--- a/copyright
+++ b/copyright
@@ -92,7 +92,6 @@ R = RU Groningen
  Nef_S2                                  M
  NewKernel_d                             I
  Number_types                            ETIMU
- OpenNL                                  third party lib under LGPL 3
  Optimal_bounding_box                    G
  Optimal_transportation_reconstruction_2 I
  Optimisation_basic                      E

From 36958928dfaaa0721f534b85a2cad3365437ea91 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 29 Nov 2023 16:38:58 +0100
Subject: [PATCH 1092/1398] remove opennl from Doxygen config

I checked the compilation of the documentation locally.
---
 Documentation/doc/resources/1.10.0/BaseDoxyfile.in | 1 -
 Documentation/doc/resources/1.9.6/BaseDoxyfile.in  | 1 -
 2 files changed, 2 deletions(-)

diff --git a/Documentation/doc/resources/1.10.0/BaseDoxyfile.in b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
index 4818c4493363..629950d737bd 100644
--- a/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.10.0/BaseDoxyfile.in
@@ -115,7 +115,6 @@ ALIASES                = "cgal=%CGAL" \
                          "taucs=TAUCS" \
                          "lapack=LAPACK" \
                          "blas=BLAS" \
-                         "opennl=OpenNL" \
                          "cpp=C++" \
                          "cpp11=C++11" \
                          "CC=C++" \
diff --git a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
index a7cf70903004..77246b8fcdfc 100644
--- a/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
+++ b/Documentation/doc/resources/1.9.6/BaseDoxyfile.in
@@ -115,7 +115,6 @@ ALIASES                = "cgal=%CGAL" \
                          "taucs=TAUCS" \
                          "lapack=LAPACK" \
                          "blas=BLAS" \
-                         "opennl=OpenNL" \
                          "cpp=C++" \
                          "cpp11=C++11" \
                          "CC=C++" \

From 7b7918947ad3e99b3d046013da409a71a3ff48e4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 29 Nov 2023 16:54:43 +0100
Subject: [PATCH 1093/1398] Fix bbox initialization

---
 .../Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp           | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
index db6845db100c..91390c759ddb 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Alpha_wrap_3/Alpha_wrap_3_plugin.cpp
@@ -646,6 +646,13 @@ public Q_SLOTS:
     std::cout << segments.size() << " edges" << std::endl;
     std::cout << points.size() << " points" << std::endl;
 
+    if(!triangles.empty())
+      m_wrap_bbox = triangles.front().bbox();
+    else if(!segments.empty())
+      m_wrap_bbox = segments.front().bbox();
+    else if(!points.empty())
+      m_wrap_bbox = points.front().bbox();
+
     for(const Kernel::Triangle_3& tr : triangles)
       m_wrap_bbox += tr.bbox();
     for(const Kernel::Segment_3& sg : segments)

From bef03396715f48b90cdbd5ab414a9817334e16db Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 29 Nov 2023 17:43:17 +0100
Subject: [PATCH 1094/1398] fixes for edges entirely on the isoline

---
 .../refine_mesh_at_isolevel.h                 | 27 +++++---
 .../Polygon_mesh_processing/CMakeLists.txt    |  1 +
 .../test_isolevel_refinement.cpp              | 68 +++++++++++++++++++
 3 files changed, 86 insertions(+), 10 deletions(-)
 create mode 100644 Polygon_mesh_processing/test/Polygon_mesh_processing/test_isolevel_refinement.cpp

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
index 293d791a47cd..2c91a8ad5efe 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
@@ -93,27 +93,24 @@ void refine_mesh_at_isolevel(PolygonMesh& pm,
 
   std::unordered_map<face_descriptor, std::vector<halfedge_descriptor> > faces_to_split;
   std::vector<edge_descriptor> to_split;
+  std::unordered_set<vertex_descriptor> vertices_on_isoline;
   for (edge_descriptor e : edges(pm))
   {
     vertex_descriptor src = source(e, pm), tgt = target(e, pm);
+
     if (get(value_map, src)==isovalue)
     {
-      for (halfedge_descriptor h : halfedges_around_source(halfedge(e, pm), pm))
+      vertices_on_isoline.insert(src);
+      if (get(value_map, tgt)==isovalue)
       {
-        face_descriptor f = face(h, pm);
-        if (f!=boost::graph_traits<PolygonMesh>::null_face())
-          faces_to_split[f].push_back(opposite(h, pm));
+        put(ecm, e, true); // special case for faces entirely on an isovalue
+        continue;
       }
       continue;
     }
     if (get(value_map, tgt)==isovalue)
     {
-      for (halfedge_descriptor h : halfedges_around_target(halfedge(e, pm), pm))
-      {
-        face_descriptor f = face(h, pm);
-        if (f!=boost::graph_traits<PolygonMesh>::null_face())
-          faces_to_split[f].push_back(h);
-      }
+      vertices_on_isoline.insert(tgt);
       continue;
     }
     if ( (get(value_map, tgt) < isovalue) != (get(value_map, src) < isovalue) )
@@ -140,6 +137,16 @@ void refine_mesh_at_isolevel(PolygonMesh& pm,
       faces_to_split[f].push_back(hnew);
   }
 
+  for (vertex_descriptor vh : vertices_on_isoline)
+  {
+    for (halfedge_descriptor h : halfedges_around_target(vh, pm))
+    {
+      face_descriptor f = face(h, pm);
+      if (f!=boost::graph_traits<PolygonMesh>::null_face())
+        faces_to_split[f].push_back(h);
+    }
+  }
+
   for (const auto& p : faces_to_split)
   {
     if(p.second.size()!=2) continue;
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index eb9b98cbe593..f2e13399444a 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -65,6 +65,7 @@ create_single_source_cgal_program("triangulate_hole_with_cdt_2_test.cpp")
 create_single_source_cgal_program("test_pmp_polyhedral_envelope.cpp")
 create_single_source_cgal_program("test_pmp_np_function.cpp")
 create_single_source_cgal_program("test_degenerate_pmp_clip_split_corefine.cpp")
+create_single_source_cgal_program("test_isolevel_refinement.cpp")
 #  create_single_source_cgal_program("test_pmp_repair_self_intersections.cpp")
 
 find_package(Eigen3 3.2.0 QUIET) #(requires 3.2.0 or greater)
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_isolevel_refinement.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_isolevel_refinement.cpp
new file mode 100644
index 000000000000..9e07c8314352
--- /dev/null
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_isolevel_refinement.cpp
@@ -0,0 +1,68 @@
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h>
+#include <CGAL/Polygon_mesh_processing/connected_components.h>
+
+#include <fstream>
+#include <iostream>
+
+typedef CGAL::Simple_cartesian<double>                       Kernel;
+typedef Kernel::Point_3                                      Point_3;
+typedef CGAL::Surface_mesh<Point_3>                          Triangle_mesh;
+
+typedef boost::graph_traits<Triangle_mesh>::vertex_descriptor vertex_descriptor;
+typedef boost::graph_traits<Triangle_mesh>::edge_descriptor edge_descriptor;
+
+typedef Triangle_mesh::Property_map<vertex_descriptor,double> Vertex_distance_map;
+
+int main()
+{
+  const std::string filename = CGAL::data_file_path("meshes/elephant.off");
+
+  Triangle_mesh tm;
+  if(!CGAL::IO::read_polygon_mesh(filename, tm) ||
+     CGAL::is_empty(tm) || !CGAL::is_triangle_mesh(tm))
+  {
+    std::cerr << "Invalid input file." << std::endl;
+    return EXIT_FAILURE;
+  }
+  //property map for the distance values to the source set
+  Vertex_distance_map vertex_distance = tm.add_property_map<vertex_descriptor, double>("v:distance", 5).first;
+  std::vector<int> zero_vids={
+    /*a closed polyline*/ 2144,145,2690,1752,339,215,1395,338,77,2145,2052,2054,343,1936,22,1751,214,1499,142,358,2694,1750,301,65,59,2650,2060,205,2651,2061,2490,1939,898,13,298,
+    /*two adjacent triangles*/ 532, 185, 534, 2735,
+    /*another patch with missing crossed edges*/134,73,1883,2533,72,532,185,131,534
+  };
+
+  std::vector<int> minus_vids = {132, 364};
+
+  for (int i : zero_vids)
+    put(vertex_distance, Triangle_mesh::Vertex_index(i), 0);
+  for (int i : minus_vids)
+    put(vertex_distance, Triangle_mesh::Vertex_index(i), -5);
+
+  // property map to flag new cut edge added in the mesh
+  auto ecm = tm.add_property_map<edge_descriptor, bool>("e:is_constrained", 0).first;
+
+  CGAL::Polygon_mesh_processing::refine_mesh_at_isolevel(tm, vertex_distance, 0, CGAL::parameters::edge_is_constrained_map(ecm));
+
+  std::ofstream debug("edges.polylines.txt");
+  for (Triangle_mesh::Edge_index e : edges(tm))
+    if (get(ecm, e))
+      debug << "2 " << tm.point(source(e, tm)) << " " <<  tm.point(target(e, tm)) << "\n";
+  debug.close();
+
+  // split the mesh in connected components bounded by the isocurves
+  std::vector<Triangle_mesh> edges_split;
+  CGAL::Polygon_mesh_processing::split_connected_components(tm, edges_split, CGAL::parameters::edge_is_constrained_map(ecm));
+
+  // export each submesh in a file
+  for(std::size_t i=0; i<edges_split.size(); ++i)
+    std::ofstream("out_"+std::to_string(i)+".off") << std::setprecision(17) << edges_split[i];
+
+  assert(edges_split.size() == 5);
+
+
+  return 0;
+}

From fd37bc3a16070374bfbeaf83ab5e34336a0dff77 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 30 Nov 2023 09:25:04 +0100
Subject: [PATCH 1095/1398] add missing include

---
 .../CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h      | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
index 2c91a8ad5efe..eb52b7816679 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
@@ -18,6 +18,8 @@
 #include <CGAL/boost/graph/Euler_operations.h>
 #include <CGAL/boost/graph/named_params_helper.h>
 
+#include <unordered_map>
+
 namespace CGAL {
 namespace Polygon_mesh_processing {
 

From a207e3af2e118400b15f0946dc06606a814fc7bc Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Thu, 30 Nov 2023 09:35:56 +0100
Subject: [PATCH 1096/1398] wrong header

Co-authored-by: Andreas Fabri <andreas.fabri@geometryfactory.com>
---
 .../CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h     | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
index eb52b7816679..cc0738a365bb 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
@@ -17,7 +17,8 @@
 
 #include <CGAL/boost/graph/Euler_operations.h>
 #include <CGAL/boost/graph/named_params_helper.h>
-
+#include <unordered_set>
+#include <unordered_map>
 #include <unordered_map>
 
 namespace CGAL {

From 8a4c99f19b4942c0bd6e8f1083004013c9c58dee Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 30 Nov 2023 09:53:04 +0100
Subject: [PATCH 1097/1398] remove unused variables

now there is only one possible sizing definition left, they have
become useless
---
 Mesh_3/test/Mesh_3/test_mesh_criteria_creation.cpp | 2 --
 1 file changed, 2 deletions(-)

diff --git a/Mesh_3/test/Mesh_3/test_mesh_criteria_creation.cpp b/Mesh_3/test/Mesh_3/test_mesh_criteria_creation.cpp
index fb74fa720e4b..8436b51c64d9 100644
--- a/Mesh_3/test/Mesh_3/test_mesh_criteria_creation.cpp
+++ b/Mesh_3/test/Mesh_3/test_mesh_criteria_creation.cpp
@@ -93,7 +93,6 @@ int main()
                                               cp(tr.point(ch, k+3))));
 
   FT facet_size_ok = radius_facet*FT(10);
-  FT facet_size_nok = radius_facet/FT(10);
 
   Mc fc1(facet_size = facet_size_ok);
   assert( ! fc1.facet_criteria_object()(tr, f) );
@@ -134,7 +133,6 @@ int main()
                                              cp(tr.point(ch, 3))));
 
   FT cell_size_ok = radius_cell*FT(10);
-  FT cell_size_nok = radius_cell/FT(10);
 
   Mc cc1(cell_size = cell_size_ok);
   assert( ! cc1.cell_criteria_object()(tr, ch) );

From c7ab2ba750bdad57977d79cb652f0df019cb58eb Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 30 Nov 2023 09:50:40 +0100
Subject: [PATCH 1098/1398] fix include

---
 .../CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
index cc0738a365bb..d86b470a2605 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h
@@ -17,9 +17,9 @@
 
 #include <CGAL/boost/graph/Euler_operations.h>
 #include <CGAL/boost/graph/named_params_helper.h>
+
 #include <unordered_set>
 #include <unordered_map>
-#include <unordered_map>
 
 namespace CGAL {
 namespace Polygon_mesh_processing {

From 6ad37cd2e6e7526f7cd562db10c91e19036d3b05 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 30 Nov 2023 11:37:48 +0100
Subject: [PATCH 1099/1398] Enable pocket purging by default

Reasoning is: this is what users expect.
---
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h        | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 5adf81dc443a..727691a80218 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -283,8 +283,9 @@ class Alpha_wrapper_3
     // initial cavities, if used).
     //
     // -- Warning --
-    // If you refine or pause while removing pockets, you will get valid but different wraps.
-    const bool keep_inner_ccs = choose_parameter(get_parameter(in_np, internal_np::keep_inner_connected_components), true);
+    // Pockets of "outside" cells will be purged even if the wrapping is interrupted (and
+    // this option is enabled).
+    const bool keep_inner_ccs = choose_parameter(get_parameter(in_np, internal_np::keep_inner_connected_components), false);
 
     // This parameter enables avoiding recomputing the triangulation from scratch when wrapping
     // the same input for multiple values of alpha (and typically the same offset values).

From fae9bcd5f1d39a090aeb97f790e21abd9bb10154 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 30 Nov 2023 11:38:18 +0100
Subject: [PATCH 1100/1398] Add some comments

---
 .../include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h        | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
index 727691a80218..d6ca4fb356c3 100644
--- a/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
+++ b/Alpha_wrap_3/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h
@@ -94,6 +94,7 @@ struct Wrapping_default_visitor
   template <typename AlphaWrapper>
   void on_flood_fill_begin(const AlphaWrapper&) { }
 
+  // Whether the flood filling process should continue
   template <typename Wrapper>
   constexpr bool go_further(const Wrapper&) { return true; }
 
@@ -277,6 +278,10 @@ class Alpha_wrapper_3
     // Whether or not some cells should be reflagged as "inside" after the refinement+carving loop
     // as ended, as to ensure that the result is not only combinatorially manifold, but also
     // geometrically manifold.
+    //
+    // -- Warning --
+    // Manifoldness postprocessing will be performed even if the wrapping is interrupted (and
+    // this option is enabled).
     const bool do_enforce_manifoldness = choose_parameter(get_parameter(in_np, internal_np::do_enforce_manifoldness), true);
 
     // Whether to keep pockets of "outside" cells that are not connected to the exterior (or to the

From 9115847ed4c7f95b9cf727cd1af896cc74759747 Mon Sep 17 00:00:00 2001
From: Sven Oesau <sven.oesau@geometryfactory.com>
Date: Thu, 30 Nov 2023 16:03:28 +0100
Subject: [PATCH 1101/1398] added handling for rendering of non-triangular
 faces with ghost edges ghost edges are not added to cdt in FacetTriangulator
 mark_domain_in_triangulation is used to mark holes as external

---
 .../Plugins/PMP/Distance_plugin.cpp           |  57 +++---
 .../Polyhedron/Scene_polygon_soup_item.cpp    | 106 +++++------
 .../Scene_polyhedron_selection_item.cpp       |  39 ++--
 .../Polyhedron/Scene_surface_mesh_item.cpp    | 125 +++++++------
 .../demo/Polyhedron/triangulate_primitive.h   | 169 ++++++++----------
 5 files changed, 239 insertions(+), 257 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Distance_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Distance_plugin.cpp
index d6d3c6a1a45b..72e1475f82ff 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Distance_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Distance_plugin.cpp
@@ -190,13 +190,10 @@ class Scene_distance_polyhedron_item: public Scene_item_rendering_helper
 
       for(boost::graph_traits<Face_graph>::face_descriptor f : faces(*poly)) {
         Vector nf = get(nf_pmap, f);
-        typedef FacetTriangulator<Face_graph, Kernel, boost::graph_traits<Face_graph>::vertex_descriptor> FT;
-
         //compute distance with other polyhedron
         //sample facet
         std::vector<Kernel::Point_3> sampled_points;
-        std::size_t nb_points =  (std::max)((int)std::ceil(nb_pts_per_face * PMP::face_area(f,*poly,CGAL::parameters::geom_traits(Kernel()))),
-                                            1);
+        std::size_t nb_points =  (std::max)((int)std::ceil(nb_pts_per_face * PMP::face_area(f,*poly,CGAL::parameters::geom_traits(Kernel()))), 1);
         Kernel::Point_3 &p = get(vpmap,target(halfedge(f,*poly),*poly));
         Kernel::Point_3 &q = get(vpmap,target(next(halfedge(f,*poly),*poly),*poly));
         Kernel::Point_3 &r = get(vpmap,target(next(next(halfedge(f,*poly),*poly),*poly),*poly));
@@ -207,36 +204,42 @@ class Scene_distance_polyhedron_item: public Scene_item_rendering_helper
         sampled_points.push_back(r);
 
         //triangle facets with sample points for color display
-        FT triangulation(f,sampled_points,nf,poly);
-
-        if(triangulation.cdt->dimension() != 2 )
-        {
-          qDebug()<<"Error : cdt not right (dimension != 2). Facet not displayed";
-          continue;
-        }
-
-        //iterates on the internal faces to add the vertices to the positions
-        //and the normals to the appropriate vectors
+        auto func = [&](auto& ffit, auto& v2v) {
+          if (ffit.info().is_external)
+            return;
 
-        for(FT::CDT::Finite_faces_iterator
-            ffit = triangulation.cdt->finite_faces_begin(),
-            end = triangulation.cdt->finite_faces_end();
-            ffit != end; ++ffit)
-        {
-          if(ffit->info().is_external)
-            continue;
-
-          for (int i = 0; i<3; ++i)
+          for (int i = 0; i < 3; ++i)
           {
-            total_points.push_back(ffit->vertex(i)->point());
-            m_vertices.push_back(ffit->vertex(i)->point().x());
-            m_vertices.push_back(ffit->vertex(i)->point().y());
-            m_vertices.push_back(ffit->vertex(i)->point().z());
+            total_points.push_back(ffit.vertex(i)->point());
+            m_vertices.push_back(ffit.vertex(i)->point().x());
+            m_vertices.push_back(ffit.vertex(i)->point().y());
+            m_vertices.push_back(ffit.vertex(i)->point().z());
 
             normals.push_back(nf.x());
             normals.push_back(nf.y());
             normals.push_back(nf.z());
           }
+          };
+
+        try {
+          FacetTriangulator<Face_graph, Kernel, boost::graph_traits<Face_graph>::vertex_descriptor> triangulation(f, sampled_points, nf, poly);
+
+         if (triangulation.cdt->dimension() != 2)
+          {
+            qDebug() << "Error : cdt not right (dimension != 2). Facet not displayed";
+            continue;
+          }
+          triangulation.per_face(func);
+        }
+        catch (...) {
+         FacetTriangulator<Face_graph, Kernel, boost::graph_traits<Face_graph>::vertex_descriptor, CGAL::Exact_intersections_tag> triangulation(f, sampled_points, nf, poly);
+
+         if (triangulation.cdt->dimension() != 2)
+          {
+            qDebug() << "Error : cdt not right (dimension != 2). Facet not displayed";
+            continue;
+          }
+          triangulation.per_face(func);
         }
       }
       //compute the distances
diff --git a/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.cpp
index a7e32dc0d266..7bdc0f69a0c0 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polygon_soup_item.cpp
@@ -137,81 +137,71 @@ Scene_polygon_soup_item_priv::triangulate_polygon(Polygons_iterator pit, int pol
     if (normal == CGAL::NULL_VECTOR) // No normal could be computed, return
       return;
 
-    typedef FacetTriangulator<SMesh, EPICK, std::size_t> FT;
+    typedef std::pair<EPICK::Point_3, std::size_t> PointAndId;
 
     std::size_t it = 0;
     std::size_t it_end =pit->size();
-    std::vector<FT::PointAndId> pointIds;
+    std::vector<PointAndId> pointIds;
     do {
-      FT::PointAndId pointId;
+      PointAndId pointId;
 
-      pointId.point = soup->points[pit->at(it)]+offset;
-      pointId.id = pit->at(it);
+      pointId.first = soup->points[pit->at(it)]+offset;
+      pointId.second = pit->at(it);
       pointIds.push_back(pointId);
     } while( ++it != it_end );
-    //detect degenerated faces
-/*
-    std::vector<FT::PointAndId> pid_stack = pointIds;
-    for(std::size_t i = 0; i< pointIds.size(); ++i)
-    {
-     FT::PointAndId pid = pid_stack.back();
-     pid_stack.pop_back();
-     for(FT::PointAndId poai : pid_stack)
-     {
-      if (pid.point== poai.point)
-      {
-        return;
-      }
-     }
-    }*/
-    FT triangulation(pointIds,normal);
+
     //iterates on the internal faces to add the vertices to the positions
     //and the normals to the appropriate vectors
-    for(FT::CDT::Finite_faces_iterator
-        ffit = triangulation.cdt->finite_faces_begin(),
-        end = triangulation.cdt->finite_faces_end();
-        ffit != end; ++ffit)
-    {
-        if(ffit->info().is_external)
-            continue;
-
-        positions_poly.push_back(ffit->vertex(0)->point().x());
-        positions_poly.push_back(ffit->vertex(0)->point().y());
-        positions_poly.push_back(ffit->vertex(0)->point().z());
+    auto f = [&](auto& ffit, auto& v2v) {
+      if (ffit.info().is_external)
+        return;
 
+      positions_poly.push_back(ffit.vertex(0)->point().x());
+      positions_poly.push_back(ffit.vertex(0)->point().y());
+      positions_poly.push_back(ffit.vertex(0)->point().z());
 
-        positions_poly.push_back(ffit->vertex(1)->point().x());
-        positions_poly.push_back(ffit->vertex(1)->point().y());
-        positions_poly.push_back(ffit->vertex(1)->point().z());
+      positions_poly.push_back(ffit.vertex(1)->point().x());
+      positions_poly.push_back(ffit.vertex(1)->point().y());
+      positions_poly.push_back(ffit.vertex(1)->point().z());
 
-        positions_poly.push_back(ffit->vertex(2)->point().x());
-        positions_poly.push_back(ffit->vertex(2)->point().y());
-        positions_poly.push_back(ffit->vertex(2)->point().z());
+      positions_poly.push_back(ffit.vertex(2)->point().x());
+      positions_poly.push_back(ffit.vertex(2)->point().y());
+      positions_poly.push_back(ffit.vertex(2)->point().z());
 
-        CGAL::IO::Color color;
-        if(!soup->fcolors.empty())
-          color = soup->fcolors[polygon_id];
-        for(int i=0; i<3; i++)
+      CGAL::IO::Color color;
+      if (!soup->fcolors.empty())
+        color = soup->fcolors[polygon_id];
+      for (int i = 0; i < 3; i++)
+      {
+        normals.push_back(normal.x());
+        normals.push_back(normal.y());
+        normals.push_back(normal.z());
+        if (!soup->fcolors.empty())
         {
-          normals.push_back(normal.x());
-          normals.push_back(normal.y());
-          normals.push_back(normal.z());
-          if(!soup->fcolors.empty())
-          {
-            f_colors.push_back(static_cast<float>(color.red())/255);
-            f_colors.push_back(static_cast<float>(color.green())/255);
-            f_colors.push_back(static_cast<float>(color.blue())/255);
-          }
-          if(!soup->vcolors.empty())
-          {
-            CGAL::IO::Color vcolor = soup->vcolors[triangulation.v2v[ffit->vertex(i)]];
-            v_colors.push_back(static_cast<float>(vcolor.red())/255);
-            v_colors.push_back(static_cast<float>(vcolor.green())/255);
-            v_colors.push_back(static_cast<float>(vcolor.blue())/255);
-          }
+          f_colors.push_back(static_cast<float>(color.red()) / 255);
+          f_colors.push_back(static_cast<float>(color.green()) / 255);
+          f_colors.push_back(static_cast<float>(color.blue()) / 255);
+        }
+        if (!soup->vcolors.empty())
+        {
+          CGAL::IO::Color vcolor = soup->vcolors[v2v[ffit.vertex(i)]];
+          v_colors.push_back(static_cast<float>(vcolor.red()) / 255);
+          v_colors.push_back(static_cast<float>(vcolor.green()) / 255);
+          v_colors.push_back(static_cast<float>(vcolor.blue()) / 255);
         }
+      }
+      };
+
+    try {
+      FacetTriangulator<SMesh, EPICK, std::size_t> triangulation(pointIds, normal);
+      triangulation.per_face(f);
+    }
+    catch (...) {
+      FacetTriangulator<SMesh, EPICK, std::size_t, CGAL::Exact_intersections_tag> triangulation(pointIds, normal);
+      triangulation.per_face(f);
     }
 }
+
 void
 Scene_polygon_soup_item_priv::compute_normals_and_vertices() const{
 
diff --git a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
index 893b6bac7196..70cda242d019 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
@@ -282,26 +282,29 @@ Scene_polyhedron_selection_item_priv::triangulate_facet(fg_face_descriptor fit,c
   const CGAL::qglviewer::Vec off = Three::mainViewer()->offset();
   EPICK::Vector_3 offset(off.x,off.y,off.z);
 
-  typedef FacetTriangulator<Face_graph, EPICK, fg_vertex_descriptor> FT;
-  FT triangulation(fit,normal,poly, offset);
-    //iterates on the internal faces to add the vertices to the positions
-    //and the normals to the appropriate vectors
-    for(FT::CDT::Finite_faces_iterator
-        ffit = triangulation.cdt->finite_faces_begin(),
-        end = triangulation.cdt->finite_faces_end();
-        ffit != end; ++ffit)
-    {
-        if(ffit->info().is_external)
-            continue;
+  //iterates on the internal faces to add the vertices to the positions
+  //and the normals to the appropriate vectors
+  auto f = [&](auto& ffit, auto& v2v) {
+    if (ffit.info().is_external)
+      return;
 
-        push_back_xyz(ffit->vertex(0)->point(), p_facets);
-        push_back_xyz(ffit->vertex(1)->point(), p_facets);
-        push_back_xyz(ffit->vertex(2)->point(), p_facets);
+    push_back_xyz(ffit.vertex(0)->point(), p_facets);
+    push_back_xyz(ffit.vertex(1)->point(), p_facets);
+    push_back_xyz(ffit.vertex(2)->point(), p_facets);
 
-        push_back_xyz(normal, p_normals);
-        push_back_xyz(normal, p_normals);
-        push_back_xyz(normal, p_normals);
-    }
+    push_back_xyz(normal, p_normals);
+    push_back_xyz(normal, p_normals);
+    push_back_xyz(normal, p_normals);
+    };
+
+  try {
+    FacetTriangulator<Face_graph, EPICK, fg_vertex_descriptor> triangulation(fit, normal, poly, offset);
+    triangulation.per_face(f);
+  }
+  catch (...) {
+    FacetTriangulator<Face_graph, EPICK, fg_vertex_descriptor, CGAL::Exact_intersections_tag> triangulation(fit, normal, poly, offset);
+    triangulation.per_face(f);
+  }
 }
 
 
diff --git a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
index 3dce2285c44e..688cf8587459 100644
--- a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
@@ -984,60 +984,63 @@ Scene_surface_mesh_item_priv::triangulate_facet(face_descriptor fd,
     return;
   }
 
-  typedef FacetTriangulator<SMesh, EPICK, boost::graph_traits<SMesh>::vertex_descriptor> FT;
   const CGAL::qglviewer::Vec off = static_cast<CGAL::Three::Viewer_interface*>(CGAL::QGLViewer::QGLViewerPool().first())->offset();
   EPICK::Vector_3 offset(off.x,off.y,off.z);
-  FT triangulation(fd,normal,smesh_, offset);
+
   //iterates on the internal faces
-  for(FT::CDT::Finite_faces_iterator
-      ffit = triangulation.cdt->finite_faces_begin(),
-      end = triangulation.cdt->finite_faces_end();
-      ffit != end; ++ffit)
-  {
-    if(ffit->info().is_external)
-      continue;
+  auto f = [&](auto& ffit, auto& v2v) {
+    if (ffit.info().is_external)
+      return;
     //add the vertices to the positions
     //adds the vertices, normals and colors to the appropriate vectors
-    if(!index)
+    if (!index)
     {
       CGAL::IO::Color* color;
-      if(has_fpatch_id)
+      if (has_fpatch_id)
       {
-        QColor c= item->color_vector()[fpatch_id_map[fd] - min_patch_id];
-        color = new CGAL::IO::Color(c.red(),c.green(),c.blue());
+        QColor c = item->color_vector()[fpatch_id_map[fd] - min_patch_id];
+        color = new CGAL::IO::Color(c.red(), c.green(), c.blue());
       }
-      else if(has_fcolors)
+      else if (has_fcolors)
         color = &(*fcolors)[fd];
       else
         color = nullptr;
 
-      addFlatData(ffit->vertex(0)->point()-offset,
-                  (*fnormals)[fd],
-                  color,
-                  name);
-      addFlatData(ffit->vertex(1)->point()-offset,
-                  (*fnormals)[fd],
-                  color,
-                  name);
-
-      addFlatData(ffit->vertex(2)->point()-offset,
-                  (*fnormals)[fd],
-                  color,
-                  name);
-      if(has_fpatch_id)
+      addFlatData(ffit.vertex(0)->point() - offset,
+        (*fnormals)[fd],
+        color,
+        name);
+      addFlatData(ffit.vertex(1)->point() - offset,
+        (*fnormals)[fd],
+        color,
+        name);
+
+      addFlatData(ffit.vertex(2)->point() - offset,
+        (*fnormals)[fd],
+        color,
+        name);
+      if (has_fpatch_id)
         delete color;
     }
     //adds the indices to the appropriate vector
     else
     {
-      if(name.testFlag(Scene_item_rendering_helper::GEOMETRY))
+      if (name.testFlag(Scene_item_rendering_helper::GEOMETRY))
       {
-        idx_data_.push_back((*im)[triangulation.v2v[ffit->vertex(0)]]);
-        idx_data_.push_back((*im)[triangulation.v2v[ffit->vertex(1)]]);
-        idx_data_.push_back((*im)[triangulation.v2v[ffit->vertex(2)]]);
+        idx_data_.push_back((*im)[v2v[ffit.vertex(0)]]);
+        idx_data_.push_back((*im)[v2v[ffit.vertex(1)]]);
+        idx_data_.push_back((*im)[v2v[ffit.vertex(2)]]);
       }
     }
+  };
 
+  try {
+    FacetTriangulator<SMesh, EPICK, boost::graph_traits<SMesh>::vertex_descriptor> triangulation(fd, normal, smesh_, offset);
+    triangulation.per_face(f);
+  }
+  catch (...) {
+    FacetTriangulator<SMesh, EPICK, boost::graph_traits<SMesh>::vertex_descriptor, CGAL::Exact_intersections_tag> triangulation(fd, normal, smesh_, offset);
+    triangulation.per_face(f);
   }
 }
 
@@ -1357,7 +1360,6 @@ void Scene_surface_mesh_item::invalidate(Gl_data_names name)
 QList<EPICK::Triangle_3> Scene_surface_mesh_item_priv::triangulate_primitive(face_descriptor fit,
                                                 EPICK::Vector_3 normal)
 {
-  typedef FacetTriangulator<SMesh, EPICK, boost::graph_traits<SMesh>::vertex_descriptor> FT;
   //The output list
   QList<EPICK::Triangle_3> res;
   //check if normal contains NaN values
@@ -1366,23 +1368,27 @@ QList<EPICK::Triangle_3> Scene_surface_mesh_item_priv::triangulate_primitive(fac
     qDebug()<<"Warning in triangulation of the selection item: normal contains NaN values and is not valid.";
     return QList<EPICK::Triangle_3>();
   }
-  FT triangulation(fit,normal,smesh_);
+
   //iterates on the internal faces to add the vertices to the positions
   //and the normals to the appropriate vectors
-  for( FT::CDT::Finite_faces_iterator
-      ffit = triangulation.cdt->finite_faces_begin(),
-      end = triangulation.cdt->finite_faces_end();
-      ffit != end; ++ffit)
-  {
-    if(ffit->info().is_external)
-      continue;
-
+  auto f = [&](auto &ffit, auto& v2v) {
+    if (ffit.info().is_external)
+      return;
 
-    res << EPICK::Triangle_3(ffit->vertex(0)->point(),
-                              ffit->vertex(1)->point(),
-                              ffit->vertex(2)->point());
+    res << EPICK::Triangle_3(ffit.vertex(0)->point(),
+      ffit.vertex(1)->point(),
+      ffit.vertex(2)->point());
+    };
 
+  try {
+    FacetTriangulator<SMesh, EPICK, boost::graph_traits<SMesh>::vertex_descriptor> triangulation(fit, normal, smesh_);
+    triangulation.per_face(f);
   }
+  catch (...) {
+    FacetTriangulator<SMesh, EPICK, boost::graph_traits<SMesh>::vertex_descriptor, CGAL::Exact_intersections_tag> triangulation(fit, normal, smesh_);
+    triangulation.per_face(f);
+  }
+
   return res;
 }
 
@@ -2620,21 +2626,24 @@ void Scene_surface_mesh_item::fill_flat_vertex_map()
           return;
         }
 
-        typedef FacetTriangulator<SMesh, EPICK, boost::graph_traits<SMesh>::vertex_descriptor> FT;
         const CGAL::qglviewer::Vec off = static_cast<CGAL::Three::Viewer_interface*>(CGAL::QGLViewer::QGLViewerPool().first())->offset();
         EPICK::Vector_3 offset(off.x,off.y,off.z);
-        FT triangulation(fd,normal,face_graph(), offset);
-        //iterates on the internal faces
-        for(FT::CDT::Finite_faces_iterator
-            ffit = triangulation.cdt->finite_faces_begin(),
-            end = triangulation.cdt->finite_faces_end();
-            ffit != end; ++ffit)
-        {
-          if(ffit->info().is_external)
-            continue;
-          d->flat_vertices_map[triangulation.v2v[ffit->vertex(0)]].push_back(counter++);
-          d->flat_vertices_map[triangulation.v2v[ffit->vertex(1)]].push_back(counter++);
-          d->flat_vertices_map[triangulation.v2v[ffit->vertex(2)]].push_back(counter++);
+
+        auto f = [&](auto ffit, auto &v2v) {
+          if (ffit.info().is_external)
+            return;
+          d->flat_vertices_map[v2v[ffit.vertex(0)]].push_back(counter++);
+          d->flat_vertices_map[v2v[ffit.vertex(1)]].push_back(counter++);
+          d->flat_vertices_map[v2v[ffit.vertex(2)]].push_back(counter++);
+          };
+
+        try {
+          FacetTriangulator<SMesh, EPICK, boost::graph_traits<SMesh>::vertex_descriptor> triangulation(fd, normal, face_graph(), offset);
+          triangulation.per_face(f);
+        }
+        catch (...) {
+          FacetTriangulator<SMesh, EPICK, boost::graph_traits<SMesh>::vertex_descriptor, CGAL::Exact_intersections_tag> triangulation(fd, normal, face_graph(), offset);
+          triangulation.per_face(f);
         }
       }
     }
diff --git a/Polyhedron/demo/Polyhedron/triangulate_primitive.h b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
index fd154ad05144..a294581e15d8 100644
--- a/Polyhedron/demo/Polyhedron/triangulate_primitive.h
+++ b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
@@ -23,7 +23,7 @@
 // @todo just use PMP::triangulate_face()...?
 // or at least mark_faces_in_domain()
 
-template<class Mesh, typename Kernel, typename Index_type>
+template<class Mesh, typename Kernel, typename Index_type, typename CDT_ITag = CGAL::Exact_predicates_tag>
 class FacetTriangulator
 {
 public:
@@ -31,6 +31,8 @@ class FacetTriangulator
   using Point = typename Kernel::Point_3;
   using Vector = typename Kernel::Vector_3;
 
+  using Index = Index_type;
+
   using P_traits = CGAL::Projection_traits_3<Traits>;
 
   using halfedge_descriptor = typename boost::graph_traits<Mesh>::halfedge_descriptor;
@@ -46,23 +48,14 @@ class FacetTriangulator
   using Fbb = CGAL::Triangulation_face_base_with_info_2<Face_info, P_traits>;
   using Fb = CGAL::Constrained_triangulation_face_base_2<P_traits, Fbb>;
   using TDS = CGAL::Triangulation_data_structure_2<Vb, Fb>;
-  using Itag = CGAL::Exact_predicates_tag;//Exact_intersections_tag
-  using CDT = CGAL::Constrained_Delaunay_triangulation_2<P_traits, TDS, Itag>;
+  using CDT = CGAL::Constrained_Delaunay_triangulation_2<P_traits, TDS, CDT_ITag>;
 
   using Vertex_handle = typename CDT::Vertex_handle;
   using Face_handle = typename CDT::Face_handle;
 
-  struct PointAndId
-  {
-    Point point;
-    Index_type id;
-    PointAndId() = default;
-    PointAndId(const Point& point, const Index_type id) : point(point), id(id) { }
-  };
-
 public:
   CDT* cdt;
-  CGAL::Unique_hash_map<Vertex_handle, Index_type> v2v;
+  CGAL::Unique_hash_map<Vertex_handle, Index> v2v;
 
 public:
   // Constructor
@@ -71,10 +64,10 @@ class FacetTriangulator
                     Mesh* poly,
                     Vector offset = Vector(0,0,0))
   {
-    std::vector<PointAndId> idPoints;
+    std::vector<std::pair<typename Kernel::Point_3, Index> > idPoints;
     for(halfedge_descriptor he_circ : halfedges_around_face(halfedge(fd, *poly), *poly))
-      idPoints.emplace_back(get(CGAL::vertex_point, *poly, source(he_circ, *poly)) + offset,
-                            source(he_circ, *poly));
+      idPoints.emplace_back(std::make_pair(get(CGAL::vertex_point, *poly, source(he_circ, *poly)) + offset,
+                            source(he_circ, *poly)));
 
     if(!triangulate(idPoints, normal))
       std::cerr << "Facet not displayed" << std::endl;
@@ -86,22 +79,22 @@ class FacetTriangulator
                     Mesh* poly,
                     Vector offset = Vector(0,0,0))
   {
-    std::vector<PointAndId> idPoints;
+    std::vector<std::pair<typename Kernel::Point_3, Index> > idPoints;
     for(halfedge_descriptor he_circ : halfedges_around_face(halfedge(fd, *poly), *poly))
-      idPoints.emplace_back(get(CGAL::vertex_point, *poly, source(he_circ, *poly)) + offset,
-                            source(he_circ, *poly));
+      idPoints.emplace_back(std::make_pair(get(CGAL::vertex_point, *poly, source(he_circ, *poly)) + offset,
+                            source(he_circ, *poly)));
 
     if(!triangulate_with_points(idPoints, more_points, normal))
       std::cerr << "Facet not displayed" << std::endl;
   }
 
-  FacetTriangulator(std::vector<PointAndId>& idPoints,
+  FacetTriangulator(std::vector<std::pair<typename Kernel::Point_3, Index> >& idPoints,
                     const Vector& normal)
   {
     if(!triangulate(idPoints, normal))
       std::cerr << "Facet not displayed" << std::endl;
   }
-  FacetTriangulator(std::vector<PointAndId>& idPoints,
+  FacetTriangulator(std::vector < std::pair<typename Kernel::Point_3, Index> >& idPoints,
                     const std::vector<Point>& more_points,
                     const Vector& normal)
   {
@@ -115,8 +108,14 @@ class FacetTriangulator
       delete cdt;
   }
 
+  template<class Func>
+  void per_face(const Func& f) {
+    for (typename CDT::Finite_faces_iterator fit = cdt->finite_faces_begin(); fit != cdt->finite_faces_end(); ++fit)
+      f(*fit, v2v);
+  }
+
 private:
-  bool triangulate(std::vector<PointAndId>& idPoints,
+  bool triangulate(std::vector<std::pair<typename Kernel::Point_3, Index> >& idPoints,
                    const Vector& normal)
   {
     P_traits cdt_traits(normal);
@@ -124,28 +123,24 @@ class FacetTriangulator
 
     std::map<std::pair<Point_3, Point_3>, std::size_t> edge_map;
     std::vector<bool> skip(idPoints.size(), false);
-    bool has_ghost_edges = false;
 
-/*
     for (std::size_t i = 0; i < idPoints.size(); i++) {
       int prev = (i - 1 + idPoints.size()) % idPoints.size();
-      if (idPoints[i].point < idPoints[prev].point) {
-        auto it = edge_map.emplace(std::make_pair(idPoints[i].point, idPoints[prev].point), i);
+      if (idPoints[i].first < idPoints[prev].first) {
+        auto it = edge_map.emplace(std::make_pair(idPoints[i].first, idPoints[prev].first), i);
         if (!it.second) {
           skip[i] = true;
           skip[it.first->second] = true;
-          has_ghost_edges = true;
         }
       }
       else {
-        auto it = edge_map.emplace(std::make_pair(idPoints[prev].point, idPoints[i].point), i);
+        auto it = edge_map.emplace(std::make_pair(idPoints[prev].first, idPoints[i].first), i);
         if (!it.second) {
           skip[i] = true;
           skip[it.first->second] = true;
-          has_ghost_edges = true;
         }
       }
-    }*/
+    }
 
     Vertex_handle previous, first, last_inserted;
     std::size_t previd, firstid, lastid;
@@ -155,20 +150,20 @@ class FacetTriangulator
 
     for(std::size_t i = 0;i<idPoints.size();i++)
     {
-      const PointAndId& idPoint = idPoints[i];
-      x += idPoint.point.x();
-      y += idPoint.point.y();
-      z += idPoint.point.z();
+      const std::pair<typename Kernel::Point_3, Index>& idPoint = idPoints[i];
+      x += idPoint.first.x();
+      y += idPoint.first.y();
+      z += idPoint.first.z();
 
       Vertex_handle vh;
       // Always insert the first point, then only insert if the distance with the previous is reasonable.
-      if(first == Vertex_handle() || idPoint.point != previous->point())
+      if(first == Vertex_handle() || idPoint.first != previous->point())
       {
-        vh = cdt->insert(idPoint.point);
-        v2v[vh] = idPoint.id;
+        vh = cdt->insert(idPoint.first);
+        v2v[vh] = idPoint.second;
         if (first == Vertex_handle()) {
           first = vh;
-          firstid = idPoint.id;
+          firstid = idPoint.second;
         }
 
         if(previous != nullptr && previous != vh)
@@ -179,7 +174,7 @@ class FacetTriangulator
           lastid = previd;
         }
         previous = vh;
-        previd = idPoint.id;
+        previd = idPoint.second;
       }
     }
 
@@ -189,76 +184,66 @@ class FacetTriangulator
     if(previous != first && !skip[0])
       cdt->insert_constraint(previous, first);
 
-/*
-    std::vector<Point_3> pts;
-    std::ofstream vout("test.polylines.txt");
-    for (auto& e : cdt->constrained_edges()) {
-      // edge is a pair of Face_handle and index
-      auto v1 = e.first->vertex((e.second + 1) % 3);
-      auto v2 = e.first->vertex((e.second + 2) % 3);
-      pts.push_back(v1->point());
-      pts.push_back(v2->point());
-      vout << "2 " << v1->point() << " " << v2->point() << std::endl;
-    }
-    vout.close();*/
-
     // sets mark is_external
     for(Face_handle f2 : cdt->all_face_handles())
       f2->info().is_external = false;
 
-     std::unordered_map<Face_handle, bool> in_domain_map;
-     boost::associative_property_map< std::unordered_map<Face_handle, bool> > in_domain(in_domain_map);
+    std::unordered_map<Face_handle, bool> in_domain_map;
+    boost::associative_property_map< std::unordered_map<Face_handle, bool> > in_domain(in_domain_map);
     CGAL::mark_domain_in_triangulation<CDT>(*cdt, in_domain);
 
-    // check if the facet is external or internal
-/*
-    std::queue<typename CDT::Face_handle> face_queue;
-    face_queue.push(cdt->infinite_vertex()->face());
-    while(! face_queue.empty())
-    {
-      typename CDT::Face_handle fh = face_queue.front();
-      face_queue.pop();
-      if(fh->info().is_external)
-        continue;
-
-      fh->info().is_external = true;
-      for(int i = 0; i <3; ++i)
-      {
-        if(!cdt->is_constrained(std::make_pair(fh, i)))
-          face_queue.push(fh->neighbor(i));
-      }
-    }*/
-
-    for (const Face_handle& fh : cdt->all_face_handles()) {
+    for (const Face_handle& fh : cdt->all_face_handles())
       fh->info().is_external = !get(in_domain, fh);
-    }
 
     return true;
   }
 
-  bool triangulate_with_points(std::vector<PointAndId >& idPoints,
+  bool triangulate_with_points(std::vector<std::pair<typename Kernel::Point_3, Index> >& idPoints,
                                const std::vector<Point>& more_points,
                                const Vector& normal)
   {
     P_traits cdt_traits(normal);
     cdt = new CDT(cdt_traits);
 
+    std::map<std::pair<Point_3, Point_3>, std::size_t> edge_map;
+    std::vector<bool> skip(idPoints.size(), false);
+
+    for (std::size_t i = 0; i < idPoints.size(); i++) {
+      int prev = (i - 1 + idPoints.size()) % idPoints.size();
+      if (idPoints[i].first < idPoints[prev].first) {
+        auto it = edge_map.emplace(std::make_pair(idPoints[i].first, idPoints[prev].first), i);
+        if (!it.second) {
+          skip[i] = true;
+          skip[it.first->second] = true;
+        }
+      }
+      else {
+        auto it = edge_map.emplace(std::make_pair(idPoints[prev].first, idPoints[i].first), i);
+        if (!it.second) {
+          skip[i] = true;
+          skip[it.first->second] = true;
+        }
+      }
+    }
+
     // Iterate the points of the facet and decide if they must be inserted in the CDT
     Vertex_handle previous, first, last_inserted;
-    for(const PointAndId& idPoint : idPoints)
+    for (std::size_t i = 0; i < idPoints.size(); i++)
     {
+      const std::pair<typename Kernel::Point_3, Index>& idPoint = idPoints[i];
       Vertex_handle vh;
       // Always insert the first point, then only insert if the distance with the previous is reasonable.
-      if(first == Vertex_handle() || idPoint.point != previous->point())
+      if(first == Vertex_handle() || idPoint.first != previous->point())
       {
-        vh = cdt->insert(idPoint.point);
-        v2v[vh] = idPoint.id;
+        vh = cdt->insert(idPoint.first);
+        v2v[vh] = idPoint.second;
         if(first == Vertex_handle())
           first = vh;
 
         if(previous != nullptr && previous != vh)
         {
-          cdt->insert_constraint(previous, vh);
+          if (!skip[i])
+            cdt->insert_constraint(previous, vh);
           last_inserted = previous;
         }
         previous = vh;
@@ -268,7 +253,9 @@ class FacetTriangulator
     if(last_inserted == Vertex_handle())
       return false;
 
+    if (previous != first && !skip[0])
     cdt->insert_constraint(previous, first);
+
     for(const Point& point : more_points)
       cdt->insert(point);
 
@@ -276,22 +263,12 @@ class FacetTriangulator
     for(Face_handle f2 : cdt->all_face_handles())
       f2->info().is_external = false;
 
-    // check if the facet is external or internal
-    std::queue<typename CDT::Face_handle> face_queue;
-    face_queue.push(cdt->infinite_vertex()->face());
-    while(!face_queue.empty())
-    {
-      typename CDT::Face_handle fh = face_queue.front();
-      face_queue.pop();
-      if(fh->info().is_external)
-        continue;
-      fh->info().is_external = true;
-      for(int i = 0; i <3; ++i)
-      {
-        if(!cdt->is_constrained(std::make_pair(fh, i)))
-          face_queue.push(fh->neighbor(i));
-      }
-    }
+    std::unordered_map<Face_handle, bool> in_domain_map;
+    boost::associative_property_map< std::unordered_map<Face_handle, bool> > in_domain(in_domain_map);
+    CGAL::mark_domain_in_triangulation<CDT>(*cdt, in_domain);
+
+    for (const Face_handle& fh : cdt->all_face_handles())
+      fh->info().is_external = !get(in_domain, fh);
 
     return true;
   }

From afc5382c8c80f4eb7246ab1a99220d2b30f6ac52 Mon Sep 17 00:00:00 2001
From: Sven Oesau <sven.oesau@geometryfactory.com>
Date: Fri, 1 Dec 2023 08:31:50 +0100
Subject: [PATCH 1102/1398] removed left-overs from debugging bugfixes

---
 Polyhedron/demo/Polyhedron/Plugins/IO/PLY_io_plugin.cpp | 2 +-
 Polyhedron/demo/Polyhedron/triangulate_primitive.h      | 4 ++--
 Stream_support/include/CGAL/IO/PLY/PLY_reader.h         | 6 ------
 3 files changed, 3 insertions(+), 9 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/PLY_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/PLY_io_plugin.cpp
index e7d371e08918..fe4120c59191 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/PLY_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/PLY_io_plugin.cpp
@@ -132,7 +132,7 @@ load(QFileInfo fileinfo, bool& ok, bool add_to_scene) {
     std::vector<CGAL::IO::Color> fcolors;
     std::vector<CGAL::IO::Color> vcolors;
 
-    if (!(CGAL::IO::read_PLY (in, points, polygons, fcolors, vcolors, true)))
+    if (!(CGAL::IO::read_PLY (in, points, polygons, fcolors, vcolors)))
     {
       QApplication::restoreOverrideCursor();
       ok = false;
diff --git a/Polyhedron/demo/Polyhedron/triangulate_primitive.h b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
index a294581e15d8..4fd4afa6a00a 100644
--- a/Polyhedron/demo/Polyhedron/triangulate_primitive.h
+++ b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
@@ -121,7 +121,7 @@ class FacetTriangulator
     P_traits cdt_traits(normal);
     cdt = new CDT(cdt_traits);
 
-    std::map<std::pair<Point_3, Point_3>, std::size_t> edge_map;
+    std::map<std::pair<Point, Point>, std::size_t> edge_map;
     std::vector<bool> skip(idPoints.size(), false);
 
     for (std::size_t i = 0; i < idPoints.size(); i++) {
@@ -205,7 +205,7 @@ class FacetTriangulator
     P_traits cdt_traits(normal);
     cdt = new CDT(cdt_traits);
 
-    std::map<std::pair<Point_3, Point_3>, std::size_t> edge_map;
+    std::map<std::pair<Point, Point>, std::size_t> edge_map;
     std::vector<bool> skip(idPoints.size(), false);
 
     for (std::size_t i = 0; i < idPoints.size(); i++) {
diff --git a/Stream_support/include/CGAL/IO/PLY/PLY_reader.h b/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
index c1a0ab4e580a..ee8b18ef59c0 100644
--- a/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
+++ b/Stream_support/include/CGAL/IO/PLY/PLY_reader.h
@@ -726,9 +726,6 @@ bool read_PLY_faces(std::istream& in,
 
   for(std::size_t j = 0; j < element.number_of_items(); ++ j)
   {
-    if (j == 228)
-      std::cout << std::endl;
-
     for(std::size_t k = 0; k < element.number_of_properties(); ++ k)
     {
       PLY_read_number* property = element.property(k);
@@ -761,9 +758,6 @@ bool read_PLY_faces(std::istream& in,
                                         PLY_property<std::vector<Integer> >(vertex_indices_tag)));
     }
 
-    if (get<0>(new_face).size() == 0)
-      std::cout << "empty face encountered" << std::endl;
-
     polygons.emplace_back();
     ::CGAL::internal::resize(polygons.back(), get<0>(new_face).size());
     for(std::size_t i = 0; i < get<0>(new_face).size(); ++ i)

From 642ea59de7133f7d4847aab74e0d68c50e0354bf Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 1 Dec 2023 10:21:57 +0100
Subject: [PATCH 1103/1398] add tooltip for bounds of approximation value

---
 Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
index b75f648be33e..6056951eba95 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin.cpp
@@ -610,6 +610,8 @@ void Mesh_3_plugin::mesh_3(const Mesh_type mesh_type,
   ui.approx->setRange(diag * 10e-7, // min
                       diag);        // max
   ui.approx->setValue(approx);
+  ui.approx->setToolTip(tr("Approximation error: in [%1; %2]")
+                       .arg(diag * 10e-7).arg(diag));
 
   ui.protect->setEnabled(features_protection_available);
   ui.protect->setChecked(features_protection_available);

From 1ca77d32afa89ef18c065dce44dc95e39d662f10 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 1 Dec 2023 10:23:44 +0100
Subject: [PATCH 1104/1398] fix DoubleEdit with Qt6

- let the user add as many digits as wanted (using -1 in setRange)
- use standard notation, not scientific (which was the default)
- comment QDoubleValidator::fixup that for some reason blocks the edition of the field
---
 Polyhedron/demo/Polyhedron/CGAL_double_edit.cpp | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/CGAL_double_edit.cpp b/Polyhedron/demo/Polyhedron/CGAL_double_edit.cpp
index a50aef4180b2..c452186e1fa5 100644
--- a/Polyhedron/demo/Polyhedron/CGAL_double_edit.cpp
+++ b/Polyhedron/demo/Polyhedron/CGAL_double_edit.cpp
@@ -9,13 +9,14 @@ class DoubleValidator : public QDoubleValidator
     : QDoubleValidator(parent)
   {
     setLocale(QLocale::C);
+    setNotation(QDoubleValidator::StandardNotation);
   }
 
   void fixup ( QString & input ) const
   {
     input.replace(".", locale().decimalPoint());
     input.replace(",", locale().decimalPoint());
-    QDoubleValidator::fixup(input);
+//    QDoubleValidator::fixup(input);
   }
   QValidator::State validate ( QString & input, int & pos ) const
   {
@@ -59,7 +60,7 @@ class DoubleValidator : public QDoubleValidator
 
   void DoubleEdit::setRange(double rmin, double rmax)
   {
-    this->validator->setRange(rmin, rmax, this->validator->decimals());
+    this->validator->setRange(rmin, rmax, -1);
   }
 
   double DoubleEdit::getValue()

From 3fc14d8d56e4fb2649fc63a5173e8c2042276d54 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 1 Dec 2023 11:22:39 +0100
Subject: [PATCH 1105/1398] use QDoubleValidator::fixup() in
 DoubleEdit::fixup()

with this version the user can write with scientific notation or
standard notation, using . or ,

Note that when input is invalid, value() returns 0
---
 Polyhedron/demo/Polyhedron/CGAL_double_edit.cpp | 4 +---
 1 file changed, 1 insertion(+), 3 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/CGAL_double_edit.cpp b/Polyhedron/demo/Polyhedron/CGAL_double_edit.cpp
index c452186e1fa5..9f6f4c9b5a27 100644
--- a/Polyhedron/demo/Polyhedron/CGAL_double_edit.cpp
+++ b/Polyhedron/demo/Polyhedron/CGAL_double_edit.cpp
@@ -9,18 +9,16 @@ class DoubleValidator : public QDoubleValidator
     : QDoubleValidator(parent)
   {
     setLocale(QLocale::C);
-    setNotation(QDoubleValidator::StandardNotation);
   }
 
   void fixup ( QString & input ) const
   {
     input.replace(".", locale().decimalPoint());
     input.replace(",", locale().decimalPoint());
-//    QDoubleValidator::fixup(input);
+    QDoubleValidator::fixup(input);
   }
   QValidator::State validate ( QString & input, int & pos ) const
   {
-    fixup(input);
     return QDoubleValidator::validate(input, pos);
   }
 };

From a8c58f8747f4155c82bb25d81b06e8baebfcc2ab Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 1 Dec 2023 11:52:20 +0100
Subject: [PATCH 1106/1398] copy the buffer to allow modifications during
 iteration

---
 Polyhedron/demo/Polyhedron/MainWindow.cpp | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index 24455668188d..1f92d97129fc 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -376,7 +376,8 @@ void filterMenuOperations(QMenu* menu, QString filter, bool keep_from_here)
     buffer.append(action);
 
   while(!buffer.isEmpty()){
-    for(QAction* action : buffer) {
+    QList<QAction*> buffer_copy=buffer; // make a copy as we modify buffer in the loop
+    for(QAction* action : buffer_copy) {
       if(QMenu* submenu = action->menu())
       {
         bool keep = true;

From f9e405f00454c72c7aff02dda0d232e4c5dfb0ae Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 1 Dec 2023 11:20:12 +0000
Subject: [PATCH 1107/1398] Adress warning

---
 .../Spatial_searching/searching_triangulation_vertices.cpp      | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Spatial_searching/examples/Spatial_searching/searching_triangulation_vertices.cpp b/Spatial_searching/examples/Spatial_searching/searching_triangulation_vertices.cpp
index a045313f3f56..0dfd38e71e1e 100644
--- a/Spatial_searching/examples/Spatial_searching/searching_triangulation_vertices.cpp
+++ b/Spatial_searching/examples/Spatial_searching/searching_triangulation_vertices.cpp
@@ -19,7 +19,7 @@ struct Project {
   typedef Vertex_handle   argument_type;
   typedef const Point_3&  Point;
   typedef Point           result_type;
-  const Point& operator()( Vertex_handle  v) const { return v->point(); }
+  Point operator()( Vertex_handle  v) const { return v->point(); }
 };
 
 

From 07f2f2912bc177a72ea229647a575fe0f10f8fff Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 1 Dec 2023 22:08:15 +0100
Subject: [PATCH 1108/1398] Fix exit codes in benchmark scripts

---
 .../Robustness/compute_robustness_benchmark_data.py       | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py
index 9def2bb6cc16..afd8d6912ab2 100755
--- a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/compute_robustness_benchmark_data.py
@@ -56,18 +56,18 @@ def compute_robustness_benchmark_data(execname, filename, alpha, max_time):
 
     for output_line in output.split("\n"):
       if output_line == "Command terminated by signal 11":
-        exit_code = 9
+        exit_code = 10
         continue
       elif output_line == "Command terminated by signal 6":
-        exit_code = 10
+        exit_code = 11
         continue
       elif output_line == "Command terminated by signal 8":
-        exit_code = 11
+        exit_code = 12
         continue
 
   except subprocess.TimeoutExpired:
     os.killpg(os.getpgid(proc.pid), signal.SIGTERM)
-    exit_code = 12
+    exit_code = 13
     output = "process ran too long"
 
   print(exit_codes[exit_code])

From ac3f6e689228562f6f814a1acb1e80270a8dc281 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 4 Dec 2023 13:09:22 +0100
Subject: [PATCH 1109/1398] improve the Mesh_3 log in demo

---
 .../Mesh_3/Mesh_3_plugin_cgal_code.cpp        |  7 ++-
 .../Polyhedron/Plugins/Mesh_3/Mesh_function.h | 48 +++++++++++++------
 2 files changed, 40 insertions(+), 15 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin_cgal_code.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin_cgal_code.cpp
index abc82f150339..d48aef5bb1f9 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin_cgal_code.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_3_plugin_cgal_code.cpp
@@ -134,6 +134,8 @@ Meshing_thread* cgal_code_mesh_3(QList<const SMesh*> pMeshes,
   param.manifold = manifold;
   param.protect_features = protect_features || protect_borders;
   param.use_sizing_field_with_aabb_tree = polylines.empty() && protect_features;
+  param.image_3_ptr = nullptr;
+  param.weights_ptr = nullptr;
 
   typedef ::Mesh_function<Polyhedral_mesh_domain,
                           Mesh_fnt::Polyhedral_domain_tag> Mesh_function;
@@ -237,6 +239,8 @@ Meshing_thread* cgal_code_mesh_3(const QList<const SMesh*> pMeshes,
   param.manifold = manifold;
   param.protect_features = protect_features || protect_borders;
   param.use_sizing_field_with_aabb_tree = protect_features;
+  param.image_3_ptr = nullptr;
+  param.weights_ptr = nullptr;
 
   typedef ::Mesh_function<Polyhedral_complex_mesh_domain,
                           Mesh_fnt::Polyhedral_domain_tag> Mesh_function;
@@ -292,7 +296,8 @@ Meshing_thread* cgal_code_mesh_3(const Implicit_function_interface* pfunction,
   param.manifold = manifold;
   param.detect_connected_components = false; // to avoid random values
                                              // in the debug displays
-
+  param.image_3_ptr = nullptr;
+  param.weights_ptr = nullptr;
 
   typedef ::Mesh_function<Function_mesh_domain,
                           Mesh_fnt::Implicit_domain_tag> Mesh_function;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_function.h b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_function.h
index dfd31aadd849..8bc5a6c3ff68 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_function.h
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Mesh_function.h
@@ -138,20 +138,40 @@ QStringList
 Mesh_parameters::
 log() const
 {
-  return QStringList()
-  << QString("edge max size: %1").arg(edge_sizing)
-  << QString("edge min size: %1").arg(edge_min_sizing)
-  << QString("facet min angle: %1").arg(facet_angle)
-  << QString("facet max size: %1").arg(facet_sizing)
-  << QString("facet min size: %1").arg(facet_min_sizing)
-  << QString("facet approx error: %1").arg(facet_approx)
-  << QString("tet shape (radius-edge): %1").arg(tet_shape)
-  << QString("tet max size: %1").arg(tet_sizing)
-  << QString("tet min size: %1").arg(tet_min_sizing)
-  << QString("detect connected components: %1")
-    .arg(detect_connected_components)
-  << QString("use weights: %1").arg(weights_ptr != nullptr)
-  << QString("protect features: %1").arg(protect_features);
+  QStringList res("Mesh criteria");
+
+  // doubles
+  if(edge_sizing > 0)
+    res << QString("edge max size: %1").arg(edge_sizing);
+  if(edge_min_sizing > 0)
+    res << QString("edge min size: %1").arg(edge_min_sizing);
+  if(facet_angle > 0)
+    res << QString("facet min angle: %1").arg(facet_angle);
+  if(facet_sizing > 0)
+    res << QString("facet max size: %1").arg(facet_sizing);
+  if(facet_min_sizing > 0)
+    res << QString("facet min size: %1").arg(facet_min_sizing);
+  if(facet_approx > 0)
+    res << QString("facet approx error: %1").arg(facet_approx);
+  if(tet_shape > 0)
+    res << QString("tet shape (radius-edge): %1").arg(tet_shape);
+  if(tet_sizing > 0)
+    res << QString("tet max size: %1").arg(tet_sizing);
+  if(tet_min_sizing > 0)
+    res << QString("tet min size: %1").arg(tet_min_sizing);
+
+  // booleans
+  res << QString("protect features: %1").arg(protect_features);
+  if(image_3_ptr != nullptr)
+  {
+    res << QString("detect connected components: %1")
+             .arg(detect_connected_components);
+    res << QString("use weights: %1").arg(weights_ptr != nullptr);
+  }
+  res << QString("use aabb tree: %1").arg(use_sizing_field_with_aabb_tree);
+  res << QString("manifold: %1").arg(manifold);
+
+  return res;
 }
 
 

From 9c2eba3320a98eebe5e120e840043e122c1da3fb Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 4 Dec 2023 14:46:14 +0100
Subject: [PATCH 1110/1398] simplify example code using Boolean_property_map

---
 .../tetrahedral_remeshing_with_features.cpp   | 65 +++----------------
 1 file changed, 10 insertions(+), 55 deletions(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_with_features.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_with_features.cpp
index 032cca7e1d30..4cb187d96f26 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_with_features.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/tetrahedral_remeshing_with_features.cpp
@@ -12,59 +12,16 @@
 
 #include "tetrahedral_remeshing_generate_input.h"
 
-typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
 
-typedef CGAL::Tetrahedral_remeshing::Remeshing_triangulation_3<K> Remeshing_triangulation;
+using Remeshing_triangulation = CGAL::Tetrahedral_remeshing::Remeshing_triangulation_3<K>;
+using Point = Remeshing_triangulation::Point;
+using Vertex_handle = Remeshing_triangulation::Vertex_handle;
 
-typedef Remeshing_triangulation::Point         Point;
-typedef Remeshing_triangulation::Vertex_handle Vertex_handle;
-typedef Remeshing_triangulation::Cell_handle   Cell_handle;
-typedef Remeshing_triangulation::Edge          Edge;
+using Vertex_pair = std::pair<Vertex_handle, Vertex_handle>;
+using Constraints_set = std::unordered_set<Vertex_pair, boost::hash<Vertex_pair>>;
+using Constraints_pmap = CGAL::Boolean_property_map<Constraints_set>;
 
-class Constrained_edges_property_map
-{
-public:
-  typedef bool                               value_type;
-  typedef bool                               reference;
-  typedef std::pair<Vertex_handle, Vertex_handle> key_type;
-  typedef boost::read_write_property_map_tag category;
-
-private:
-  std::unordered_set<key_type, boost::hash<key_type>>* m_set_ptr;
-
-public:
-  Constrained_edges_property_map()
-    : m_set_ptr(nullptr)
-  {}
-  Constrained_edges_property_map(std::unordered_set<key_type, boost::hash<key_type>>* set_)
-    : m_set_ptr(set_)
-  {}
-
-public:
-  friend void put(Constrained_edges_property_map& map,
-                  const key_type& k,
-                  const bool b)
-  {
-    assert(map.m_set_ptr != nullptr);
-    assert(k.first < k.second);
-    if (b)  map.m_set_ptr->insert(k);
-    else    map.m_set_ptr->erase(k);
-  }
-
-  friend value_type get(const Constrained_edges_property_map& map,
-                        const key_type& k)
-  {
-    assert(map.m_set_ptr != nullptr);
-    assert(k.first < k.second);
-    return (map.m_set_ptr->count(k) > 0);
-  }
-};
-
-void set_subdomain(Remeshing_triangulation& tr, const int index)
-{
-  for (auto cit : tr.finite_cell_handles())
-    cit->set_subdomain_index(index);
-}
 
 int main(int argc, char* argv[])
 {
@@ -73,16 +30,14 @@ int main(int argc, char* argv[])
   const int nbv = (argc > 3) ? atoi(argv[3]) : 500;
 
   Remeshing_triangulation t3;
-  typedef std::pair<Vertex_handle, Vertex_handle> Vertex_pair;
-  std::unordered_set<Vertex_pair, boost::hash<Vertex_pair>> constraints;
 
+  Constraints_set constraints;
   CGAL::Tetrahedral_remeshing::generate_input_cube(nbv, t3, constraints);
   make_constraints_from_cube_edges(t3, constraints);
 
   CGAL::tetrahedral_isotropic_remeshing(t3, target_edge_length,
-    CGAL::parameters::edge_is_constrained_map(
-      Constrained_edges_property_map(&constraints))
-    .number_of_iterations(nb_iter));
+    CGAL::parameters::edge_is_constrained_map(Constraints_pmap(constraints))
+                     .number_of_iterations(nb_iter));
 
   return EXIT_SUCCESS;
 }

From ab2afb24eaea6c625917e18e6ed7d32cae391bc4 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Mon, 4 Dec 2023 16:34:45 +0100
Subject: [PATCH 1111/1398] Incorrect link to "Perturbations for Delaunay and
 weighted Delaunay 3D Triangulations"

The link for the document "Perturbations for Delaunay and weighted Delaunay 3D Triangulations" was in #7781 (based on #7762) changed but it is not available at he address "https://theses.hal.science/inria-00560388/" but at "https://hal.science/inria-00560388/".
(The other changes were correct).

Found in Triangulation_3/citelist.html
---
 Documentation/doc/biblio/cgal_manual.bib | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Documentation/doc/biblio/cgal_manual.bib b/Documentation/doc/biblio/cgal_manual.bib
index e16202c69ddf..51dfb1090046 100644
--- a/Documentation/doc/biblio/cgal_manual.bib
+++ b/Documentation/doc/biblio/cgal_manual.bib
@@ -778,7 +778,7 @@ @article{cgal:dt-pvrdr-06
 , volume      = 44
 , year        = 2011
 , pages       = "160--168"
-, url         = "https://theses.hal.science/inria-00560388/"
+, url         = "https://hal.science/inria-00560388/"
 , doi         = "10.1016/j.comgeo.2010.09.010"
 }
 

From a66999d932d55fd8db0295e8b4f2e26f599b614f Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 5 Dec 2023 11:10:19 +0100
Subject: [PATCH 1112/1398] fill the edge_is_constrained_map based on the c3t3
 complex edges

---
 .../include/CGAL/tetrahedral_remeshing.h      | 26 +++++++++++++++++--
 1 file changed, 24 insertions(+), 2 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
index 8a8ebe925b3b..133d06a39183 100644
--- a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
+++ b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
@@ -316,15 +316,37 @@ void tetrahedral_isotropic_remeshing(
 
 template<typename Tr,
          typename CornerIndex,
-         typename CurveIndex>
+         typename CurveIndex,
+         typename NamedParameters = parameters::Default_named_parameters>
 CGAL::Triangulation_3<typename Tr::Geom_traits,
                       typename Tr::Triangulation_data_structure>
 convert_to_triangulation_3(
-  CGAL::Mesh_complex_3_in_triangulation_3<Tr, CornerIndex, CurveIndex> c3t3)
+  CGAL::Mesh_complex_3_in_triangulation_3<Tr, CornerIndex, CurveIndex> c3t3,
+  const NamedParameters& np = parameters::default_values())
 {
   using GT   = typename Tr::Geom_traits;
   using TDS  = typename Tr::Triangulation_data_structure;
 
+  using Vertex_handle = typename Tr::Vertex_handle;
+  using Edge_vv = std::pair<Vertex_handle, Vertex_handle>;
+  using Default_pmap = Constant_property_map<Edge_vv, bool>;
+  using ECMap = typename internal_np::Lookup_named_param_def <
+                internal_np::edge_is_constrained_t,
+                NamedParameters,
+                Default_pmap
+                >::type;
+  ECMap ecmap = choose_parameter(get_parameter(np, internal_np::edge_is_constrained),
+                                 Default_pmap(false));
+
+  if (!std::is_same_v<ECMap, Default_pmap>)
+  {
+    for (auto e : c3t3.edges_in_complex())
+    {
+      const Edge_vv evv{e.first->vertex(e.second), e.first->vertex(e.third)};
+      put(ecmap, evv, true);
+    }
+  }
+
   CGAL::Triangulation_3<GT, TDS> tr;
   tr.swap(c3t3.triangulation());
   return tr;

From 4ad8027db5b60c052c7a5e3057dd5187bd7cb7bf Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 5 Dec 2023 11:16:06 +0100
Subject: [PATCH 1113/1398] add example using edge_is_constrained_map in
 convert_to_triangulation_3

---
 .../Tetrahedral_remeshing.txt                 |  6 ++
 .../doc/Tetrahedral_remeshing/examples.txt    |  1 +
 .../Tetrahedral_remeshing/CMakeLists.txt      |  4 +
 ...dral_domain_with_features_from_complex.cpp | 96 +++++++++++++++++++
 4 files changed, 107 insertions(+)
 create mode 100644 Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp

diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
index 0500556f0746..e7b717fd001e 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
@@ -103,6 +103,12 @@ setting the named parameter `remesh_boundaries` to `false`.
 
 \cgalExample{Tetrahedral_remeshing/tetrahedral_remeshing_with_features.cpp }
 
+It is also possible to define the polyline features as the ones
+stored as complex edges in a `Mesh_complex_3_in_triangulation_3`
+(e.g. generated by the \ref PkgMesh3 package mesh generation algorithms).
+
+\cgalExample{Tetrahedral_remeshing/tetrahedral_remeshing_with_features_from_complex.cpp }
+
 
 \subsection ssecEx4 Tetrahedral Remeshing After Mesh Generation
 
diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/examples.txt b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/examples.txt
index 018dde267674..06b69b82469a 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/examples.txt
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/examples.txt
@@ -4,5 +4,6 @@
 \example Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
 \example Tetrahedral_remeshing/tetrahedral_remeshing_with_features.cpp
 \example Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
+\example Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp
 \example Tetrahedral_remeshing/tetrahedral_remeshing_from_mesh.cpp
 */
diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/CMakeLists.txt b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/CMakeLists.txt
index b5c4c1da2ab8..4448fd6bde71 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/CMakeLists.txt
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/CMakeLists.txt
@@ -31,9 +31,13 @@ if(TARGET CGAL::Eigen3_support)
   create_single_source_cgal_program( "mesh_and_remesh_polyhedral_domain_with_features.cpp" )
   target_link_libraries(mesh_and_remesh_polyhedral_domain_with_features PUBLIC CGAL::Eigen3_support)
 
+  create_single_source_cgal_program("mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp")
+  target_link_libraries(mesh_and_remesh_polyhedral_domain_with_features_from_complex PUBLIC CGAL::Eigen3_support)
+
   if(CGAL_ACTIVATE_CONCURRENT_MESH_3 AND TARGET CGAL::TBB_support)
     message(STATUS "Found TBB")
     target_link_libraries(mesh_and_remesh_polyhedral_domain_with_features PRIVATE CGAL::TBB_support)
+    target_link_libraries(mesh_and_remesh_polyhedral_domain_with_features_from_complex PRIVATE CGAL::TBB_support)
   endif()
 else()
   message(STATUS "NOTICE: Some examples require Eigen 3.1 (or greater), and will not be compiled.")
diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp
new file mode 100644
index 000000000000..b5a10784e929
--- /dev/null
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp
@@ -0,0 +1,96 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
+#include <CGAL/Mesh_triangulation_3.h>
+#include <CGAL/Mesh_complex_3_in_triangulation_3.h>
+#include <CGAL/Mesh_criteria_3.h>
+
+#include <CGAL/Polyhedral_mesh_domain_with_features_3.h>
+#include <CGAL/make_mesh_3.h>
+
+#include <CGAL/tetrahedral_remeshing.h>
+
+#include <CGAL/IO/File_medit.h>
+
+// Domain
+typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
+typedef CGAL::Mesh_polyhedron_3<K>::type Polyhedron;
+typedef CGAL::Polyhedral_mesh_domain_with_features_3<K> Mesh_domain;
+
+#ifdef CGAL_CONCURRENT_MESH_3
+typedef CGAL::Parallel_tag Concurrency_tag;
+#else
+typedef CGAL::Sequential_tag Concurrency_tag;
+#endif
+
+// Triangulation for Meshing
+typedef CGAL::Mesh_triangulation_3<Mesh_domain, CGAL::Default, Concurrency_tag>::type Tr;
+typedef CGAL::Mesh_complex_3_in_triangulation_3<
+  Tr, Mesh_domain::Corner_index, Mesh_domain::Curve_index> C3t3;
+
+// Criteria
+typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
+
+// Triangulation for Remeshing
+typedef CGAL::Triangulation_3<typename Tr::Geom_traits,
+  typename Tr::Triangulation_data_structure> Triangulation_3;
+using Vertex_handle = Triangulation_3::Vertex_handle;
+
+using Vertex_pair = std::pair<Vertex_handle, Vertex_handle>;
+using Constraints_set = std::unordered_set<Vertex_pair, boost::hash<Vertex_pair>>;
+using Constraints_pmap = CGAL::Boolean_property_map<Constraints_set>;
+
+
+// To avoid verbose function and named parameters call
+using namespace CGAL::parameters;
+
+int main(int argc, char* argv[])
+{
+  const std::string fname = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/fandisk.off");
+  std::ifstream input(fname);
+  Polyhedron polyhedron;
+  input >> polyhedron;
+  if (input.fail() || !CGAL::is_triangle_mesh(polyhedron)) {
+    std::cerr << "Error: Input invalid " << fname << std::endl;
+    return EXIT_FAILURE;
+  }
+
+  // Create domain
+  Mesh_domain domain(polyhedron);
+
+  // Get sharp features
+  domain.detect_features();
+
+  // Mesh criteria
+  Mesh_criteria criteria(edge_size = 0.025,
+    facet_angle = 25, facet_size = 0.05, facet_distance = 0.005,
+    cell_radius_edge_ratio = 3, cell_size = 0.05);
+
+  // Mesh generation
+  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria);
+
+  CGAL::dump_c3t3(c3t3, "out");
+
+  Constraints_set constraints;
+  Constraints_pmap constraints_pmap(constraints);
+
+  Triangulation_3 tr = CGAL::convert_to_triangulation_3(std::move(c3t3),
+    CGAL::parameters::edge_is_constrained_map(constraints_pmap));
+
+  //note we use the move semantic, with std::move(c3t3),
+  //  to avoid a copy of the triangulation by the function
+  //  `CGAL::convert_to_triangulation_3()`
+  //  After the call to this function, c3t3 is an empty and valid C3t3.
+  //It is possible to use :  CGAL::convert_to_triangulation_3(c3t3),
+  //  Then the triangulation is copied and duplicated, and c3t3 remains as is.
+
+  const double target_edge_length = 0.1;//coarsen the mesh
+  CGAL::tetrahedral_isotropic_remeshing(tr, target_edge_length,
+    CGAL::parameters::number_of_iterations(3)
+   .edge_is_constrained_map(constraints_pmap));
+
+  std::ofstream out("out_remeshed.mesh");
+  CGAL::IO::write_MEDIT(out, tr);
+  out.close();
+
+  return EXIT_SUCCESS;
+}

From ef7ab56229c363fb2b246bdbf6a6a84f93879ead Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 5 Dec 2023 14:41:22 +0100
Subject: [PATCH 1114/1398] add missing using

---
 Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
index 133d06a39183..1f2cc574ca9d 100644
--- a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
+++ b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
@@ -324,6 +324,9 @@ convert_to_triangulation_3(
   CGAL::Mesh_complex_3_in_triangulation_3<Tr, CornerIndex, CurveIndex> c3t3,
   const NamedParameters& np = parameters::default_values())
 {
+  using parameters::get_parameter;
+  using parameters::choose_parameter;
+
   using GT   = typename Tr::Geom_traits;
   using TDS  = typename Tr::Triangulation_data_structure;
 

From a91f8d038ed67056944ccd552dcda2efcaa6c914 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 5 Dec 2023 15:08:03 +0100
Subject: [PATCH 1115/1398] doc

---
 .../include/CGAL/tetrahedral_remeshing.h        | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)

diff --git a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
index 1f2cc574ca9d..ae67f4ddde53 100644
--- a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
+++ b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
@@ -310,8 +310,25 @@ void tetrahedral_isotropic_remeshing(
 * @tparam CurveIndex is the type of the indices for feature curves.
 *            If `c3t3` has been generated using `CGAL::make_mesh_3()`, it must match
 *            `MeshDomainWithFeatures_3::Curve_index`.
+* @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
 *
 * @param c3t3 the complex containing the triangulation to be remeshed.
+* @param np optional sequence of \ref bgl_namedparameters "Named Parameters"
+*          among the ones listed below
+*
+* \cgalNamedParamsBegin
+*   \cgalParamNBegin{edge_is_constrained_map}
+*     \cgalParamDescription{a property map containing the constrained-or-not status of each edge of
+*                     `c3t3.triangulation()`.
+*                     For each edge `e` for which `c3t3.is_in_complex(e)` returns `true`,
+*                     the constrained status of `e` is set to `true`.}
+*     \cgalParamType{a class model of `ReadWritePropertyMap`
+*         with `std::pair<Triangulation_3::Vertex_handle, Triangulation_3::Vertex_handle>`
+*         as key type and `bool` as value type. It must be default constructible.}
+*     \cgalParamDefault{a default property map where no edge is constrained}
+*   \cgalParamNEnd
+*
+* \cgalNamedParamsEnd
 */
 
 template<typename Tr,

From bc1f43433e9705b31610822699f80424db440d10 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 5 Dec 2023 14:17:38 +0000
Subject: [PATCH 1116/1398] Polyhedron demo: Add sampling plugin

---
 .../Operations_on_polyhedra/CMakeLists.txt    |   7 ++
 .../Point_set_from_sampling_plugin.cpp        | 105 ++++++++++++++++++
 2 files changed, 112 insertions(+)
 create mode 100644 Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/CMakeLists.txt b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/CMakeLists.txt
index 2e030be7f6df..8c27fa77cad8 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/CMakeLists.txt
@@ -13,6 +13,13 @@ target_link_libraries(
   PUBLIC scene_surface_mesh_item scene_polygon_soup_item
          scene_points_with_normal_item)
 
+polyhedron_demo_plugin(point_set_from_sampling_plugin
+                       Point_set_from_sampling_plugin)
+target_link_libraries(
+  point_set_from_sampling_plugin
+  PUBLIC scene_surface_mesh_item scene_polygon_soup_item
+         scene_points_with_normal_item)
+
 polyhedron_demo_plugin(diff_between_meshes_plugin Diff_between_meshes_plugin)
 target_link_libraries(diff_between_meshes_plugin PUBLIC scene_surface_mesh_item)
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
new file mode 100644
index 000000000000..ae439ee013a7
--- /dev/null
+++ b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
@@ -0,0 +1,105 @@
+#include <QApplication>
+#include <QAction>
+#include <QList>
+#include <QMainWindow>
+#include <QMessageBox>
+#include <QtDebug>
+
+#include "Scene_points_with_normal_item.h"
+#include "Scene_surface_mesh_item.h"
+#include "Scene_polygon_soup_item.h"
+
+#include <CGAL/Three/Polyhedron_demo_plugin_interface.h>
+#include "Messages_interface.h"
+
+#include <CGAL/Polygon_mesh_processing/distance.h>
+
+using namespace CGAL::Three;
+class Polyhedron_demo_point_set_from_sampling_plugin :
+  public QObject,
+  public Polyhedron_demo_plugin_interface
+{
+  Q_OBJECT
+  Q_INTERFACES(CGAL::Three::Polyhedron_demo_plugin_interface)
+  Q_PLUGIN_METADATA(IID "com.geometryfactory.PolyhedronDemo.PluginInterface/1.0")
+
+public:
+  void init(QMainWindow* mainWindow,
+            CGAL::Three::Scene_interface* scene_interface, Messages_interface*);
+
+  bool applicable(QAction*) const {
+    const CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
+
+    return qobject_cast<Scene_surface_mesh_item*>(scene->item(index))
+      || qobject_cast<Scene_polygon_soup_item*>(scene->item(index));
+  }
+
+  QList<QAction*> actions() const;
+
+public Q_SLOTS:
+  void createPointSet();
+
+private:
+  CGAL::Three::Scene_interface* scene;
+  QAction* actionPointSetFromSampling;
+
+
+}; // end Polyhedron_demo_point_set_from_sampling_plugin
+
+void Polyhedron_demo_point_set_from_sampling_plugin::init(QMainWindow* mainWindow,
+                                                          CGAL::Three::Scene_interface* scene_interface,
+                                                          Messages_interface*)
+{
+  scene = scene_interface;
+  actionPointSetFromSampling = new QAction(tr("&Create Point Set from Sampling"), mainWindow);
+  actionPointSetFromSampling->setObjectName("actionPointSetFromSampling");
+  connect(actionPointSetFromSampling, SIGNAL(triggered()),
+          this, SLOT(createPointSet()));
+}
+
+QList<QAction*> Polyhedron_demo_point_set_from_sampling_plugin::actions() const {
+  return QList<QAction*>() << actionPointSetFromSampling;
+}
+
+
+
+void Polyhedron_demo_point_set_from_sampling_plugin::createPointSet()
+{
+  QApplication::setOverrideCursor(Qt::WaitCursor);
+  const CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
+
+  Scene_points_with_normal_item* points = new Scene_points_with_normal_item();
+  std::vector<Kernel::Point_3> pts;
+
+  if (points){
+    points->setColor(Qt::blue);
+  }else{
+    return;
+  }
+  Scene_surface_mesh_item* sm_item =
+    qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
+
+  if (sm_item){
+    points->setName(QString("%1 (sampled)").arg(sm_item->name()));
+    CGAL::Polygon_mesh_processing::sample_triangle_mesh(*sm_item->polyhedron(),
+                                                        std::back_inserter(pts));
+  }
+
+  Scene_polygon_soup_item* soup_item =
+    qobject_cast<Scene_polygon_soup_item*>(scene->item(index));
+
+  if (soup_item){
+    points->setName(QString("%1 (sampled)").arg(soup_item->name()));
+    CGAL::Polygon_mesh_processing::sample_triangle_soup(soup_item->points(),
+                                                        soup_item->polygons(),
+                                                        std::back_inserter(pts));
+  }
+  for (std::size_t i = 0; i < pts.size(); ++i){
+    points->point_set()->insert(pts[i]);
+  }
+    scene->addItem(points);
+  QApplication::restoreOverrideCursor();
+}
+
+
+#include "Point_set_from_sampling_plugin.moc"

From 3584d3489d01090f2cc2a97461d5f1915bacef79 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 5 Dec 2023 15:19:29 +0100
Subject: [PATCH 1117/1398] fix example name

---
 .../doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt         | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
index e7b717fd001e..f0400342db1b 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
@@ -107,7 +107,7 @@ It is also possible to define the polyline features as the ones
 stored as complex edges in a `Mesh_complex_3_in_triangulation_3`
 (e.g. generated by the \ref PkgMesh3 package mesh generation algorithms).
 
-\cgalExample{Tetrahedral_remeshing/tetrahedral_remeshing_with_features_from_complex.cpp }
+\cgalExample{Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp }
 
 
 \subsection ssecEx4 Tetrahedral Remeshing After Mesh Generation

From 1d5bef39067ea8809f76a83c7e15306ed3c55d98 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 5 Dec 2023 17:29:24 +0100
Subject: [PATCH 1118/1398] use ordered pair

---
 Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
index ae67f4ddde53..d0dbede067dc 100644
--- a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
+++ b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
@@ -362,7 +362,7 @@ convert_to_triangulation_3(
   {
     for (auto e : c3t3.edges_in_complex())
     {
-      const Edge_vv evv{e.first->vertex(e.second), e.first->vertex(e.third)};
+      const Edge_vv evv = make_vertex_pair(e);//ordered pair
       put(ecmap, evv, true);
     }
   }

From d98a6233f0b781a259d1d5b5084ebafe7564c243 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 5 Dec 2023 17:32:26 +0100
Subject: [PATCH 1119/1398] collect features and use edge_is_constrained_map in
 demo code

---
 .../Tetrahedral_remeshing_plugin.cpp          | 31 ++++++++++++++++---
 .../internal/tetrahedral_remeshing_helpers.h  | 21 +++++++++++++
 2 files changed, 47 insertions(+), 5 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp
index 05875d4e6ca5..a64a44fa331e 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp
@@ -12,6 +12,7 @@
 #include "C3t3_type.h"
 
 #include <CGAL/tetrahedral_remeshing.h>
+#include <CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h>
 
 #include <unordered_map>
 #include <memory>
@@ -80,6 +81,7 @@ public Q_SLOTS:
 
     Scene_c3t3_item* c3t3_item =
       qobject_cast<Scene_c3t3_item*>(scene->item(index));
+    const auto& c3t3 = c3t3_item->c3t3();
 
     if (c3t3_item)
     {
@@ -100,18 +102,37 @@ public Q_SLOTS:
       bool protect = ui.protect_checkbox->isChecked();
       bool smooth_edges = ui.smoothEdges_checkBox->isChecked();
 
+      // collect constraints
+      using Vertex_handle = Tr::Vertex_handle;
+      using Vertex_pair = std::pair<Vertex_handle, Vertex_handle>;
+      using Constraints_set = std::unordered_set<Vertex_pair, boost::hash<Vertex_pair>>;
+      using Constraints_pmap = CGAL::Boolean_property_map<Constraints_set>;
+
       // wait cursor
       QApplication::setOverrideCursor(Qt::WaitCursor);
 
       QElapsedTimer time;
       time.start();
 
+      Constraints_set constraints;
+      for (const auto e : c3t3_item->c3t3().triangulation().finite_edges())
+      {
+        if (c3t3_item->c3t3().is_in_complex(e)
+          || CGAL::Tetrahedral_remeshing::protecting_balls_intersect(e, c3t3))
+        {
+          Vertex_pair evv = CGAL::Tetrahedral_remeshing::make_vertex_pair<Tr>(e);
+          constraints.insert(evv);
+        }
+      }
+
       CGAL::tetrahedral_isotropic_remeshing(
-          c3t3_item->c3t3(),
-          target_length,
-          CGAL::parameters::remesh_boundaries(!protect)
-          .number_of_iterations(nb_iter)
-          .smooth_constrained_edges(smooth_edges));
+        c3t3_item->c3t3(),
+        target_length,
+        CGAL::parameters::remesh_boundaries(!protect)
+        .number_of_iterations(nb_iter)
+        .smooth_constrained_edges(smooth_edges)
+        .edge_is_constrained_map(Constraints_pmap(constraints))
+      );
 
       std::cout << "Remeshing done (" << time.elapsed() << " ms)" << std::endl;
 
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index f566ab1890fb..09787f05dfdd 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -589,6 +589,27 @@ bool is_edge_in_complex(const typename C3t3::Vertex_handle& v0,
     return false;
 }
 
+template<typename C3t3>
+bool protecting_balls_intersect(const typename C3t3::Edge& e,
+                                const C3t3& c3t3)
+{
+  const auto vv = c3t3.triangulation().vertices(e);
+  if(  c3t3.in_dimension(vv[0]) > 1
+    || c3t3.in_dimension(vv[1]) > 1)
+    return false;
+
+  const auto& p0 = vv[0]->point();
+  const auto& p1 = vv[1]->point();
+  if(p0.weight() == 0 || p1.weight() == 0)
+    return false;
+
+  const auto r0 = CGAL::approximate_sqrt(p0.weight());
+  const auto r1 = CGAL::approximate_sqrt(p1.weight());
+  const auto d = CGAL::approximate_sqrt(CGAL::squared_distance(p0, p1));
+
+  return d < r0 + r1;
+}
+
 template<typename C3t3, typename OutputIterator>
 OutputIterator incident_subdomains(const typename C3t3::Vertex_handle v,
                                    const C3t3& c3t3,

From 43b8b694d0a8e053092781c8d0106b70436c92e5 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 5 Dec 2023 17:32:54 +0100
Subject: [PATCH 1120/1398] use is_in_complex() inside bigger condition

---
 .../internal/tetrahedral_adaptive_remeshing_impl.h    | 11 +----------
 1 file changed, 1 insertion(+), 10 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
index be3dfe8f276f..64e1db2ca603 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
@@ -471,17 +471,8 @@ class Adaptive_remesher
     const Curve_index default_curve_id = default_curve_index();
     for (const Edge& e : tr().finite_edges())
     {
-      if (m_c3t3.is_in_complex(e))
-      {
-        CGAL_assertion(m_c3t3.in_dimension(e.first->vertex(e.second)) <= 1);
-        CGAL_assertion(m_c3t3.in_dimension(e.first->vertex(e.third)) <= 1);
-#ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
-        ++nbe;
-#endif
-        continue;
-      }
-
       if (get(ecmap, CGAL::Tetrahedral_remeshing::make_vertex_pair<Tr>(e))
+          || m_c3t3.is_in_complex(e)
           || nb_incident_subdomains(e, m_c3t3) > 2
           || nb_incident_surface_patches(e, m_c3t3) > 1)
       {

From f6a988664b91fa4b581923741f37e9ec1056c757 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 5 Dec 2023 18:08:15 +0100
Subject: [PATCH 1121/1398] add missing namespace

---
 Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
index d0dbede067dc..b6688e22f097 100644
--- a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
+++ b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
@@ -362,7 +362,7 @@ convert_to_triangulation_3(
   {
     for (auto e : c3t3.edges_in_complex())
     {
-      const Edge_vv evv = make_vertex_pair(e);//ordered pair
+      const Edge_vv evv = CGAL::Tetrahedral_remeshing::make_vertex_pair(e);//ordered pair
       put(ecmap, evv, true);
     }
   }

From d09e1fe00bc1d48849d7c21e017f26e8e1cb70e4 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 5 Dec 2023 18:08:53 +0100
Subject: [PATCH 1122/1398] add missing template

---
 Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
index b6688e22f097..d11d72973b6a 100644
--- a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
+++ b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
@@ -362,7 +362,8 @@ convert_to_triangulation_3(
   {
     for (auto e : c3t3.edges_in_complex())
     {
-      const Edge_vv evv = CGAL::Tetrahedral_remeshing::make_vertex_pair(e);//ordered pair
+      const Edge_vv evv
+        = CGAL::Tetrahedral_remeshing::make_vertex_pair<Tr>(e);//ordered pair
       put(ecmap, evv, true);
     }
   }

From 43213ee0e8fc9c3aec6f276afb83679db0ccbcd8 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 6 Dec 2023 16:13:58 +0100
Subject: [PATCH 1123/1398] Update
 Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp

Co-authored-by: Laurent Rineau <Laurent.Rineau@cgal.org>
---
 .../Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
index ae439ee013a7..c654a51cd6b1 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
@@ -94,10 +94,11 @@ void Polyhedron_demo_point_set_from_sampling_plugin::createPointSet()
                                                         soup_item->polygons(),
                                                         std::back_inserter(pts));
   }
+  points->point_set()->reserve(pts.size());
   for (std::size_t i = 0; i < pts.size(); ++i){
     points->point_set()->insert(pts[i]);
   }
-    scene->addItem(points);
+  scene->addItem(points);
   QApplication::restoreOverrideCursor();
 }
 

From 410ead5f56793752b590aefd8ccb06718cc63603 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 6 Dec 2023 17:31:02 +0100
Subject: [PATCH 1124/1398] also look for Basic viewer in targets

---
 Installation/cmake/modules/CGAL_add_test.cmake               | 5 ++---
 .../modules/CGAL_enable_end_of_configuration_hook.cmake      | 4 ++--
 2 files changed, 4 insertions(+), 5 deletions(-)

diff --git a/Installation/cmake/modules/CGAL_add_test.cmake b/Installation/cmake/modules/CGAL_add_test.cmake
index a163bca7891f..904e35e25f13 100644
--- a/Installation/cmake/modules/CGAL_add_test.cmake
+++ b/Installation/cmake/modules/CGAL_add_test.cmake
@@ -124,9 +124,8 @@ function(cgal_add_compilation_test exe_name)
   if(TARGET CGAL_Qt6_moc_and_resources) # if CGAL_Qt6 was searched, and is header-only
     get_property(linked_libraries TARGET "${exe_name}" PROPERTY LINK_LIBRARIES)
     #  message(STATUS "${exe_name} depends on ${linked_libraries}")
-    string(FIND "${linked_libraries}" "CGAL::CGAL_Qt6" link_with_CGAL_Qt6)
-    if(link_with_CGAL_Qt6 STRGREATER "-1" AND
-        NOT TARGET "compilation_of__CGAL_Qt6_moc_and_resources")
+    if( ("CGAL_Qt6" IN_LIST linked_libraries OR "CGAL::CGAL_Qt6" IN_LIST linked_libraries OR "CGAL::CGAL_Basic_viewer" IN_LIST linked_libraries)
+        AND NOT TARGET "compilation_of__CGAL_Qt6_moc_and_resources")
       # This custom target is useless. It is used only as a flag to
       # detect that the test has already been created.
       add_custom_target("compilation_of__CGAL_Qt6_moc_and_resources")
diff --git a/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake b/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
index 9fd8615c2a94..d69c42fc5dda 100644
--- a/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
+++ b/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
@@ -1,5 +1,5 @@
 # This module install a hook (with `variable_watch()`) on CMAKE_CURRENT_LIST_DIR
-# 
+#
 # That uses the non-documented fact that CMAKE_CURRENT_LIST_DIR is cleared
 # by CMake at the end of the configuration process. So, if the value of
 # that variable gets empty, that means that CMake has reached the end of
@@ -110,7 +110,7 @@ function(CGAL_hook_fix_ctest_depending_on_Qt6)
       continue()
     endif()
     get_property(_target_links TARGET ${_target} PROPERTY LINK_LIBRARIES)
-    if("CGAL_Qt6" IN_LIST _target_links OR "CGAL::CGAL_Qt6" IN_LIST _target_links)
+    if("CGAL_Qt6" IN_LIST _target_links OR "CGAL::CGAL_Qt6" IN_LIST _target_links OR "CGAL::CGAL_Basic_viewer" IN_LIST _target_links)
       set_property(TEST "compilation of  ${_target}" APPEND PROPERTY FIXTURES_REQUIRED CGAL_Qt6_moc_and_resources_Fixture)
     endif()
     endforeach()

From dc04e5baa58f856c386e4b5fa8bc4de84cbe6746 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 7 Dec 2023 11:30:17 +0100
Subject: [PATCH 1125/1398] use doxygen macro

---
 .../CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h        | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
index 5c3a99efef5b..e673ac9dfbb7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h
@@ -38,7 +38,7 @@ namespace Polygon_mesh_processing
 * Edges too long with respect to the local target edge length are split in two, while
 * edges that are too short are collapsed.
 *
-* This class depends on the Eigen library.
+* This class depends on the \eigen library.
 *
 * \cgalModels{PMPSizingField}
 *

From 7aab407b8cfd3a39ecad5f207ea88403246d1735 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 7 Dec 2023 11:32:17 +0100
Subject: [PATCH 1126/1398] add user friendly use case

---
 .../doc/Polygon_mesh_processing/Concepts/PMPSizingField.h        | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index 02822cea9e70..e3c647510c99 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -60,6 +60,7 @@ Point_3 split_placement(const halfedge_descriptor h,
                         const PolygonMesh& pmesh) const;
 
 /// function called after the addition of the split vertex `v` in `pmesh`.
+/// This function can be used for exemple to update a pre-computed sizing field.
 void register_split_vertex(const vertex_descriptor v,
                            const PolygonMesh& pmesh);
 

From 076f04af4a8dda837263fc161e5f614317c3c366 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 7 Dec 2023 10:53:07 +0000
Subject: [PATCH 1127/1398] Add links to the new function

---
 .../File_formats/Supported_file_formats.txt         | 13 +++++++++----
 .../doc/Stream_support/PackageDescription.txt       |  3 +--
 2 files changed, 10 insertions(+), 6 deletions(-)

diff --git a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
index 192e66ddf64f..04436239a407 100644
--- a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
+++ b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
@@ -453,23 +453,28 @@ A precise specification of those formats is available at
     <td rowspan="2" width="75">Input</td>
     <td rowspan="1" width="175">Polygon Mesh</td>
     <td width="250">Any model of `MutableFaceGraph`</td>
-    <td width="500">\link PkgBGLIoFuncsVTP CGAL::IO::read_VTP(const char*, Graph&)\endlink</td>
+    <td width="500">\link PkgBGLIoFuncsVTP CGAL::IO::read_VTP(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsVTP CGAL::IO::read_VTP(const char*, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsVTP CGAL::IO::read_VTP(const std::string&, PointRange&, PolygonRange&)\endlink</td>
+  </tr>
+  <tr>
+    <td>Polygon Soup</td>
+    <td>Any point + polygon range</td>
+    <td>\link PkgStreamSupportIoFuncsVTP CGAL::IO::read_VTK(const std::string&, PointRange&, PolygonRange&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsVTP CGAL::IO::write_VTP(const char*, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsVTP CGAL::IO::write_VTP(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsVTP CGAL::IO::write_VTP(const char*, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsVTP CGAL::IO::write_VTP(const std::string&, const PointRange&, const PolygonRange&)\endlink</td>
   </tr>
 </table>
 
diff --git a/Stream_support/doc/Stream_support/PackageDescription.txt b/Stream_support/doc/Stream_support/PackageDescription.txt
index 9d993ee47799..c41b35ef5f82 100644
--- a/Stream_support/doc/Stream_support/PackageDescription.txt
+++ b/Stream_support/doc/Stream_support/PackageDescription.txt
@@ -20,7 +20,7 @@
 /// I/O Functions for the \ref IOStreamOFF
 /// \ingroup IOstreamFunctions
 
-/// \defgroup PkgStreamSupportIoFuncsVTP VTP I/O Functions
+/// \defgroup PkgStreamSupportIoFuncsVTP VTK I/O Functions
 /// I/O Functions for the \ref IOStreamVTK
 /// \ingroup IOstreamFunctions
 
@@ -101,4 +101,3 @@ the printing mode.
 - \link PkgStreamSupportIoFuncsWKT I/O for WKT files \endlink
 
 */
-

From 96955790a1fd1069343605b7dcb8752ad1e6309a Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Thu, 7 Dec 2023 11:57:42 +0100
Subject: [PATCH 1128/1398] typo

Co-authored-by: Jane Tournois <janetournois@users.noreply.github.com>
---
 .../doc/Polygon_mesh_processing/Concepts/PMPSizingField.h       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
index e3c647510c99..b1216f3281ea 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPSizingField.h
@@ -60,7 +60,7 @@ Point_3 split_placement(const halfedge_descriptor h,
                         const PolygonMesh& pmesh) const;
 
 /// function called after the addition of the split vertex `v` in `pmesh`.
-/// This function can be used for exemple to update a pre-computed sizing field.
+/// This function can be used for example to update a pre-computed sizing field.
 void register_split_vertex(const vertex_descriptor v,
                            const PolygonMesh& pmesh);
 

From 07a06717bde265b60769bba933099128aecf5cd8 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 7 Dec 2023 11:35:03 +0000
Subject: [PATCH 1129/1398] Fix char*; Fix table

---
 .../File_formats/Supported_file_formats.txt   | 83 +++++++++----------
 1 file changed, 39 insertions(+), 44 deletions(-)

diff --git a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
index 04436239a407..a1c15f1826f6 100644
--- a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
+++ b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
@@ -117,23 +117,23 @@ A precise specification of the format is available <a href="https://www.martinre
     <td rowspan="2" width="75">Input</td>
     <td rowspan="1" width="175">Polygon Mesh</td>
     <td width="250">Any model of `MutableFaceGraph`</td>
-    <td width="500">\link PkgBGLIoFuncsOBJ CGAL::IO::read_OBJ(const char*, Graph&)\endlink</td>
+    <td width="500">\link PkgBGLIoFuncsOBJ CGAL::IO::read_OBJ(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsOBJ CGAL::IO::read_OBJ(const char*, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsOBJ CGAL::IO::read_OBJ(const std::string&, PointRange&, PolygonRange&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsOBJ CGAL::IO::write_OBJ(const char*, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsOBJ CGAL::IO::write_OBJ(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsOBJ CGAL::IO::write_OBJ(const char*, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsOBJ CGAL::IO::write_OBJ(const std::string&, PointRange&, PolygonRange&)\endlink</td>
   </tr>
 </table>
 
@@ -158,23 +158,23 @@ A precise specification of those formats is available <a href="https://www.fabbe
     <td rowspan="2" width="75">Input</td>
     <td rowspan="1" width="175">Polygon Mesh</td>
     <td width="250">Any model of `MutableFaceGraph`</td>
-    <td width="500">\link PkgBGLIoFuncsSTL CGAL::IO::read_STL(const char*, Graph&)\endlink</td>
+    <td width="500">\link PkgBGLIoFuncsSTL CGAL::IO::read_STL(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsSTL CGAL::IO::read_STL(const char*, PointRange&, TriangleRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsSTL CGAL::IO::read_STL(const std::string&, PointRange&, TriangleRange&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsSTL CGAL::IO::write_STL(const char*, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsSTL CGAL::IO::write_STL(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsSTL CGAL::IO::write_STL(const char*, PointRange&, TriangleRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsSTL CGAL::IO::write_STL(const std::string&, PointRange&, TriangleRange&)\endlink</td>
   </tr>
 </table>
 
@@ -202,49 +202,49 @@ A precise specification of those formats is available <a href="https://paulbourk
     <td rowspan="5" width="75">Input</td>
     <td rowspan="2" width="175">Polygon Mesh</td>
     <td width="250">`CGAL::Surface_mesh`</td>
-    <td width="500">\link PkgSurfaceMeshIOFuncPLY CGAL::IO::read_PLY(const char*, CGAL::Surface_mesh&)\endlink</td>
+    <td width="500">\link PkgSurfaceMeshIOFuncPLY CGAL::IO::read_PLY(const std::string&, CGAL::Surface_mesh&)\endlink</td>
   </tr>
   <tr>
     <td>Any model of `MutableFaceGraph`</td>
-    <td>\link PkgBGLIoFuncsPLY CGAL::IO::read_PLY(const char*, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsPLY CGAL::IO::read_PLY(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Point Set</td>
     <td>`CGAL::Point_set_3`</td>
-    <td>\link PkgPointSet3IOPLY CGAL::IO::read_PLY(const char*, CGAL::Point_set_3&)\endlink</td>
+    <td>\link PkgPointSet3IOPLY CGAL::IO::read_PLY(const std::string&, CGAL::Point_set_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOPly CGAL::IO::read_PLY(const char*, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOPly CGAL::IO::read_PLY(const std::string&, PointRange&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsPLY CGAL::IO::read_PLY(const char*, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsPLY CGAL::IO::read_PLY(const std::string&, PointRange&, PolygonRange&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="5">Output</td>
     <td rowspan="2">Polygon Mesh</td>
     <td>`CGAL::Surface_mesh`</td>
-    <td>\link PkgSurfaceMeshIOFuncPLY CGAL::IO::write_PLY(const char*, CGAL::Surface_mesh&)\endlink</td>
+    <td>\link PkgSurfaceMeshIOFuncPLY CGAL::IO::write_PLY(const std::string&, CGAL::Surface_mesh&)\endlink</td>
   </tr>
   <tr>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsPLY CGAL::IO::write_PLY(const char*, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsPLY CGAL::IO::write_PLY(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Point Set</td>
     <td>`CGAL::Point_set_3`</td>
-    <td>\link PkgPointSet3IOPLY CGAL::IO::write_PLY(const char*, CGAL::Point_set_3&)\endlink</td>
+    <td>\link PkgPointSet3IOPLY CGAL::IO::write_PLY(const std::string&, CGAL::Point_set_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOPly CGAL::IO::write_PLY(const char*, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOPly CGAL::IO::write_PLY(const std::string&, PointRange&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsPLY CGAL::IO::write_PLY(const char*, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsPLY CGAL::IO::write_PLY(const std::string&, PointRange&, PolygonRange&)\endlink</td>
   </tr>
 </table>
 
@@ -270,21 +270,21 @@ A precise specification of those formats is available
     <td rowspan="2" width="75">Input</td>
     <td rowspan="2" width="175">Point Set</td>
     <td width="250">`CGAL::Point_set_3`</td>
-    <td width="500">\link PkgPointSet3IOLAS CGAL::IO::read_LAS(const char*, CGAL::Point_set_3&)\endlink</td>
+    <td width="500">\link PkgPointSet3IOLAS CGAL::IO::read_LAS(const std::string&, CGAL::Point_set_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOLas CGAL::IO::read_LAS(const char*, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOLas CGAL::IO::read_LAS(const std::string&, PointRange&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Output</td>
     <td rowspan="2">Point Set</td>
     <td>`CGAL::Point_set_3`</td>
-    <td>\link PkgPointSet3IOLAS CGAL::IO::write_LAS(const char*, CGAL::Point_set_3&)\endlink</td>
+    <td>\link PkgPointSet3IOLAS CGAL::IO::write_LAS(const std::string&, CGAL::Point_set_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOLas CGAL::IO::write_LAS(const char*, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOLas CGAL::IO::write_LAS(const std::string&, PointRange&)\endlink</td>
   </tr>
 </table>
 
@@ -303,21 +303,21 @@ of its coordinates and other properties. Only coordinates and normals are curren
     <td rowspan="2" width="75">Input</td>
     <td rowspan="2" width="175">Point Set</td>
     <td width="250">`CGAL::Point_set_3`</td>
-    <td width="500">\link PkgPointSet3IOXYZ CGAL::IO::read_XYZ(const char*, CGAL::Point_set_3&)\endlink</td>
+    <td width="500">\link PkgPointSet3IOXYZ CGAL::IO::read_XYZ(const std::string&, CGAL::Point_set_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOXyz CGAL::IO::read_XYZ(const char*, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOXyz CGAL::IO::read_XYZ(const std::string&, PointRange&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Output</td>
     <td rowspan="2">Point Set</td>
     <td>`CGAL::Point_set_3`</td>
-    <td>\link PkgPointSet3IOXYZ CGAL::IO::write_XYZ(const char*, CGAL::Point_set_3&)\endlink</td>
+    <td>\link PkgPointSet3IOXYZ CGAL::IO::write_XYZ(const std::string&, CGAL::Point_set_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOXyz CGAL::IO::write_XYZ(const char*, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOXyz CGAL::IO::write_XYZ(const std::string&, PointRange&)\endlink</td>
   </tr>
 </table>
 
@@ -337,23 +337,23 @@ A precise specification of the format is available <a href="https://paulbourke.n
     <td rowspan="2" width="75">Input</td>
     <td rowspan="1" width="175">Polygon Mesh</td>
     <td width="250">Any model of `MutableFaceGraph`</td>
-    <td width="500">\link PkgBGLIoFuncsGOCAD CGAL::IO::read_GOCAD(const char*, Graph&)\endlink</td>
+    <td width="500">\link PkgBGLIoFuncsGOCAD CGAL::IO::read_GOCAD(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsGOCAD CGAL::IO::read_GOCAD(const char*, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsGOCAD CGAL::IO::read_GOCAD(const std::string&, PointRange&, PolygonRange&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsGOCAD CGAL::IO::write_GOCAD(const char*, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsGOCAD CGAL::IO::write_GOCAD(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsGOCAD CGAL::IO::write_GOCAD(const char*, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsGOCAD CGAL::IO::write_GOCAD(const std::string&, PointRange&, PolygonRange&)\endlink</td>
   </tr>
 </table>
 
@@ -381,23 +381,23 @@ note that only versions `1.x` are currently supported in \cgal.
     <td rowspan="2" width="75">Input</td>
     <td rowspan="1" width="175">Polygon Mesh</td>
     <td width="250">`CGAL::Surface_mesh`</td>
-    <td width="500">\link PkgSurfaceMeshIOFunc3MF CGAL::IO::read_3MF(const char*, Surface_meshRange&)\endlink</td>
+    <td width="500">\link PkgSurfaceMeshIOFunc3MF CGAL::IO::read_3MF(const std::string&, Surface_meshRange&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncs3MF CGAL::IO::read_3MF(const char*, PointRanges&, PolygonRanges&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncs3MF CGAL::IO::read_3MF(const std::string&, PointRanges&, PolygonRanges&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncs3MF CGAL::IO::write_3MF(const char*, GraphRange&)\endlink</td>
+    <td>\link PkgBGLIoFuncs3MF CGAL::IO::write_3MF(const std::string&, GraphRange&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncs3MF CGAL::IO::write_3MF(const char*, PointRanges&, PolygonRanges&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncs3MF CGAL::IO::write_3MF(const std::string&, PointRanges&, PolygonRanges&)\endlink</td>
   </tr>
 </table>
 
@@ -416,13 +416,13 @@ A precise specification of the format is available <a href="http://gun.teipir.gr
 
 <table class="iotable">
   <tr>
-    <th colspan="4">3D Manufacturing Format (3MF)</th>
+    <th colspan="4">3D VRML Format (WRL)</th>
   </tr>
   <tr>
     <td rowspan="1" width="75">Output</td>
     <td rowspan="1" width="175">Polygon Mesh</td>
     <td width="250">Any model of `FaceGraph`</td>
-    <td width="500">\link PkgBGLIoFuncsWRL CGAL::IO::write_WRL(const char*, Graph&)\endlink</td>
+    <td width="500">\link PkgBGLIoFuncsWRL CGAL::IO::write_WRL(const std::string&, Graph&)\endlink</td>
   </tr>
 </table>
 
@@ -447,23 +447,18 @@ A precise specification of those formats is available at
 
 <table class="iotable">
   <tr>
-    <th colspan="4">VTK (VTU / VTP) File Formats</th>
+    <th colspan="4">VTK (VTU / VTP / legacy) File Formats</th>
   </tr>
   <tr>
     <td rowspan="2" width="75">Input</td>
     <td rowspan="1" width="175">Polygon Mesh</td>
     <td width="250">Any model of `MutableFaceGraph`</td>
-    <td width="500">\link PkgBGLIoFuncsVTP CGAL::IO::read_VTP(const std::string&, Graph&)\endlink</td>
-  </tr>
-  <tr>
-    <td>Polygon Soup</td>
-    <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsVTP CGAL::IO::read_VTP(const std::string&, PointRange&, PolygonRange&)\endlink</td>
+    <td width="800">\link PkgBGLIoFuncsVTP CGAL::IO::read_VTP(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsVTP CGAL::IO::read_VTK(const std::string&, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsVTP CGAL::IO::read_VTP(const std::string&, PointRange&, PolygonRange&)\endlink, <BR> \link PkgStreamSupportIoFuncsVTP CGAL::IO::read_VTK(const std::string&, PointRange&, PolygonRange&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Output</td>

From 79262a365eef6ce6cb2ca7191078cd64f604b108 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 7 Dec 2023 11:56:06 +0000
Subject: [PATCH 1130/1398] polish

---
 .../Stream_support/File_formats/Supported_file_formats.txt  | 6 ++++--
 Stream_support/include/CGAL/IO/VTK.h                        | 2 +-
 2 files changed, 5 insertions(+), 3 deletions(-)

diff --git a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
index a1c15f1826f6..f626a2881c1f 100644
--- a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
+++ b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
@@ -426,7 +426,7 @@ A precise specification of the format is available <a href="http://gun.teipir.gr
   </tr>
 </table>
 
-\section IOStreamVTK VTK (VTU / VTP) File Formats
+\section IOStreamVTK VTK (VTU / VTP / legacy) File Formats
 
 \attention \cgal needs to be configured with the VTK Libraries for this function to be available.
 
@@ -440,7 +440,9 @@ The VTK libraries use different file formats to handle data structures, but we o
 
 - The `VTP` format can be used to store collections of points, lines, and triangles.
   In the <a href="https://vtk.org/"> VTK Libraries</a>, it is the format
-  reserved to store `PolyData`, and in \cgal, we use it to store Polygon Meshes.
+  reserved to store `PolyData`, and in \cgal, we use it to store polygon meshes.
+
+We additionally provide a read function for the legacy non-XML file `VTK` file format for polygon meshes.
 
 A precise specification of those formats is available at
 <a href="https://vtk.org/wp-content/uploads/2015/04/file-formats.pdf">vtk.org</a>.
diff --git a/Stream_support/include/CGAL/IO/VTK.h b/Stream_support/include/CGAL/IO/VTK.h
index d0f605834db2..304987556980 100644
--- a/Stream_support/include/CGAL/IO/VTK.h
+++ b/Stream_support/include/CGAL/IO/VTK.h
@@ -174,7 +174,7 @@ bool read_VTK(const std::string& fname,
 /*!
  * \ingroup PkgStreamSupportIoFuncsVTP
  *
- * \brief reads the content of the input file into `points` and `polygons`, using the \ref IOStreamVTK.
+ * \brief reads the content of the input file into `points` and `polygons`, using the legacy file format of the \ref IOStreamVTK.
  *
  * \attention The polygon soup is not cleared, and the data from the file are appended.
  *

From 0991fc9d614dd06faec523e6eb4111d608c19b33 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 7 Dec 2023 12:53:39 +0000
Subject: [PATCH 1131/1398] fix tag

---
 .../File_formats/Supported_file_formats.txt            | 10 +++++-----
 Stream_support/doc/Stream_support/IOstream.txt         |  4 ++--
 .../doc/Stream_support/PackageDescription.txt          |  4 ++--
 Stream_support/include/CGAL/IO/VTK.h                   |  8 ++++----
 4 files changed, 13 insertions(+), 13 deletions(-)

diff --git a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
index f626a2881c1f..2eb124c86a7d 100644
--- a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
+++ b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
@@ -442,7 +442,7 @@ The VTK libraries use different file formats to handle data structures, but we o
   In the <a href="https://vtk.org/"> VTK Libraries</a>, it is the format
   reserved to store `PolyData`, and in \cgal, we use it to store polygon meshes.
 
-We additionally provide a read function for the legacy non-XML file `VTK` file format for polygon meshes.
+We additionally provide a read function for the legacy non-XML `VTK` file format for polygon meshes.
 
 A precise specification of those formats is available at
 <a href="https://vtk.org/wp-content/uploads/2015/04/file-formats.pdf">vtk.org</a>.
@@ -455,23 +455,23 @@ A precise specification of those formats is available at
     <td rowspan="2" width="75">Input</td>
     <td rowspan="1" width="175">Polygon Mesh</td>
     <td width="250">Any model of `MutableFaceGraph`</td>
-    <td width="800">\link PkgBGLIoFuncsVTP CGAL::IO::read_VTP(const std::string&, Graph&)\endlink</td>
+    <td width="800">\link PkgBGLIoFuncsVTK CGAL::IO::read_VTP(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsVTP CGAL::IO::read_VTP(const std::string&, PointRange&, PolygonRange&)\endlink, <BR> \link PkgStreamSupportIoFuncsVTP CGAL::IO::read_VTK(const std::string&, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsVTK CGAL::IO::read_VTP(const std::string&, PointRange&, PolygonRange&)\endlink, <BR> \link PkgStreamSupportIoFuncsVTK CGAL::IO::read_VTK(const std::string&, PointRange&, PolygonRange&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsVTP CGAL::IO::write_VTP(const std::string&, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsVTK CGAL::IO::write_VTP(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsVTP CGAL::IO::write_VTP(const std::string&, const PointRange&, const PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsVTK CGAL::IO::write_VTP(const std::string&, const PointRange&, const PolygonRange&)\endlink</td>
   </tr>
 </table>
 
diff --git a/Stream_support/doc/Stream_support/IOstream.txt b/Stream_support/doc/Stream_support/IOstream.txt
index be0f7ee02a9a..7d11ad3d16ad 100644
--- a/Stream_support/doc/Stream_support/IOstream.txt
+++ b/Stream_support/doc/Stream_support/IOstream.txt
@@ -386,7 +386,7 @@ their indices per face (i.e a vector of 3 integers represent a triangle face).
       <td>\link PkgStreamSupportIoFuncsOBJ `read_OBJ()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsSTL `read_STL()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsPLY `read_PLY()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsVTP `read_VTP()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsVTK `read_VTP()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsGOCAD `read_GOCAD()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsWKT `read_WKT()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncs3MF `read_3MF()` \endlink</td>
@@ -398,7 +398,7 @@ their indices per face (i.e a vector of 3 integers represent a triangle face).
       <td>\link PkgStreamSupportIoFuncsOBJ `write_OBJ()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsSTL `write_STL()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsPLY `write_PLY()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsVTP `write_VTP()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsVTK `write_VTP()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsGOCAD `write_GOCAD()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsWKT `write_WKT()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncs3MF `write_3MF()` \endlink</td>
diff --git a/Stream_support/doc/Stream_support/PackageDescription.txt b/Stream_support/doc/Stream_support/PackageDescription.txt
index c41b35ef5f82..0cacc80c6312 100644
--- a/Stream_support/doc/Stream_support/PackageDescription.txt
+++ b/Stream_support/doc/Stream_support/PackageDescription.txt
@@ -20,7 +20,7 @@
 /// I/O Functions for the \ref IOStreamOFF
 /// \ingroup IOstreamFunctions
 
-/// \defgroup PkgStreamSupportIoFuncsVTP VTK I/O Functions
+/// \defgroup PkgStreamSupportIoFuncsVTK VTK I/O Functions
 /// I/O Functions for the \ref IOStreamVTK
 /// \ingroup IOstreamFunctions
 
@@ -96,7 +96,7 @@ the printing mode.
 - \link PkgStreamSupportIoFuncsOBJ I/O for OBJ files \endlink
 - \link PkgStreamSupportIoFuncsOFF I/O for OFF files \endlink
 - \link PkgStreamSupportIoFuncsGOCAD I/O for GOCAD files \endlink
-- \link PkgStreamSupportIoFuncsVTP I/O for VTP files \endlink
+- \link PkgStreamSupportIoFuncsVTK I/O for VTK files \endlink
 - \link PkgStreamSupportIoFuncs3MF I/O for 3MF files \endlink
 - \link PkgStreamSupportIoFuncsWKT I/O for WKT files \endlink
 
diff --git a/Stream_support/include/CGAL/IO/VTK.h b/Stream_support/include/CGAL/IO/VTK.h
index 304987556980..fd8f7accc45d 100644
--- a/Stream_support/include/CGAL/IO/VTK.h
+++ b/Stream_support/include/CGAL/IO/VTK.h
@@ -116,7 +116,7 @@ bool read_VTP(const std::string& fname,
 }
 
 /*!
- * \ingroup PkgStreamSupportIoFuncsVTP
+ * \ingroup PkgStreamSupportIoFuncsVTK
  *
  * \brief reads the content of the input file into `points` and `polygons`, using the \ref IOStreamVTK.
  *
@@ -172,7 +172,7 @@ bool read_VTK(const std::string& fname,
 }
 
 /*!
- * \ingroup PkgStreamSupportIoFuncsVTP
+ * \ingroup PkgStreamSupportIoFuncsVTK
  *
  * \brief reads the content of the input file into `points` and `polygons`, using the legacy file format of the \ref IOStreamVTK.
  *
@@ -398,7 +398,7 @@ void write_soup_polys_points(std::ostream& os,
 } // namespace internal
 
 /*!
- * \ingroup PkgStreamSupportIoFuncsVTP
+ * \ingroup PkgStreamSupportIoFuncsVTK
  *
  * \brief writes the content of `points` and `polygons` in `out`, using the \ref IOStreamVTK.
  *
@@ -486,7 +486,7 @@ bool write_VTP(std::ostream& os,
 }
 
 /*!
- * \ingroup PkgStreamSupportIoFuncsVTP
+ * \ingroup PkgStreamSupportIoFuncsVTK
  *
  * \brief writes the content of `points` and `polygons` in a file named `fname`, using the \ref IOStreamVTK.
  *

From 08b06ebefc3d144723bd40199303b8a1a12a9587 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 7 Dec 2023 13:16:53 +0000
Subject: [PATCH 1132/1398] fix tag

---
 .../Stream_support/File_formats/Supported_file_formats.txt    | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
index 2eb124c86a7d..cfc647bf7268 100644
--- a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
+++ b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
@@ -455,7 +455,7 @@ A precise specification of those formats is available at
     <td rowspan="2" width="75">Input</td>
     <td rowspan="1" width="175">Polygon Mesh</td>
     <td width="250">Any model of `MutableFaceGraph`</td>
-    <td width="800">\link PkgBGLIoFuncsVTK CGAL::IO::read_VTP(const std::string&, Graph&)\endlink</td>
+    <td width="800">\link PkgBGLIoFuncsVTP CGAL::IO::read_VTP(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
@@ -466,7 +466,7 @@ A precise specification of those formats is available at
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsVTK CGAL::IO::write_VTP(const std::string&, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsVTP CGAL::IO::write_VTP(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>

From 31d66c332fe3971abef98d1225c3c21d00140bb2 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 7 Dec 2023 14:22:01 +0100
Subject: [PATCH 1133/1398] Fix display of Qt version

---
 Installation/CMakeLists.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Installation/CMakeLists.txt b/Installation/CMakeLists.txt
index 744e4fed4ab1..1e912131c120 100644
--- a/Installation/CMakeLists.txt
+++ b/Installation/CMakeLists.txt
@@ -1253,6 +1253,6 @@ if(RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE)
     "USING BOOST_VERSION = '${Boost_MAJOR_VERSION}.${Boost_MINOR_VERSION}.${Boost_SUBMINOR_VERSION}'"
     )
   if(Qt6_FOUND)
-    message(STATUS "USING Qt6_VERSION = '${Qt6Core_VERSION_STRING}'")
+    message(STATUS "USING Qt6_VERSION = '${Qt6Core_VERSION}'")
   endif()#Qt6_FOUND
 endif()#RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE

From ad8ad2d190c6a8ad21368abac5de105946d65c0a Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 7 Dec 2023 14:38:43 +0100
Subject: [PATCH 1134/1398] display Qt6 version in the test results page

---
 Maintenance/test_handling/create_testresult_page |  2 +-
 Maintenance/test_handling/to_zipped_format       | 11 +++++++----
 2 files changed, 8 insertions(+), 5 deletions(-)

diff --git a/Maintenance/test_handling/create_testresult_page b/Maintenance/test_handling/create_testresult_page
index 3747a4a83133..7cc6ad464c06 100755
--- a/Maintenance/test_handling/create_testresult_page
+++ b/Maintenance/test_handling/create_testresult_page
@@ -474,7 +474,7 @@ sub print_platform_descriptions()
 <th>BOOST</th>
 <th>MPFR</th>
 <th>GMP</th>
-<th>QT5</th>
+<th>QT</th>
 <th>LEDA</th>
 <th>CXXFLAGS</th>
 <th>LDFLAGS</th>
diff --git a/Maintenance/test_handling/to_zipped_format b/Maintenance/test_handling/to_zipped_format
index d8c7c1cd433b..fdf62712b021 100755
--- a/Maintenance/test_handling/to_zipped_format
+++ b/Maintenance/test_handling/to_zipped_format
@@ -51,7 +51,7 @@ sub reformat_results($)
     $_ = $line;
     open (PLATFORM_INFO,">${platform}.info") or return;
     open (PLATFORM_NEW_RESULTS,">${platform}.new_results") or return;
-    my ($CGAL_VERSION,$LEDA_VERSION,$COMPILER,$TESTER_NAME,$TESTER_ADDRESS,$GMP,$MPFR,$ZLIB,$OPENGL,$BOOST,$QT,$QT4,$QT5,$CMAKE) = ("-","-","-","-","-","-","-","-","-","-","-","-","-","-","-","no");
+    my ($CGAL_VERSION,$LEDA_VERSION,$COMPILER,$TESTER_NAME,$TESTER_ADDRESS,$GMP,$MPFR,$ZLIB,$OPENGL,$BOOST,$QT,$CMAKE) = ("-","-","-","-","-","-","-","-","-","-","-","-","-","no");
     my ($LDFLAGS,$CXXFLAGS) = ("", "");
     while (! /^------/) {
         if(/^\s*$/) {
@@ -97,10 +97,13 @@ sub reformat_results($)
 	    $QT="$1";
 	}
 	if (/QT4_VERSION = '([^']+)'/) {
-	    $QT4="$1";
+	    $QT="$1";
 	}
 	if (/Qt5_VERSION = '([^']+)'/) {
-	    $QT5="$1";
+	    $QT="$1";
+	}
+	if (/Qt6_VERSION = '([^']+)'/) {
+	    $QT="$1";
 	}
 	if (/BOOST_VERSION = '([^']+)'/) {
 	    $BOOST="$1";
@@ -147,7 +150,7 @@ $CMAKE
 $BOOST
 $MPFR
 $GMP
-$QT5
+$QT
 $LEDA_VERSION
 $CXXFLAGS
 $LDFLAGS

From 811f78c6a1d9d6c9cb0585062de0f07b45a558e7 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 7 Dec 2023 15:48:09 +0100
Subject: [PATCH 1135/1398] fix the bug about
 CGAL_Qt6_moc_and_resources_Fixture

---
 .../CGAL_CreateSingleSourceCGALProgram.cmake    | 17 ++++-------------
 1 file changed, 4 insertions(+), 13 deletions(-)

diff --git a/Installation/cmake/modules/CGAL_CreateSingleSourceCGALProgram.cmake b/Installation/cmake/modules/CGAL_CreateSingleSourceCGALProgram.cmake
index 2a9fdc4bd870..c51173216b3f 100644
--- a/Installation/cmake/modules/CGAL_CreateSingleSourceCGALProgram.cmake
+++ b/Installation/cmake/modules/CGAL_CreateSingleSourceCGALProgram.cmake
@@ -57,12 +57,6 @@ function(create_single_source_cgal_program firstfile )
       set(NO_TESTING TRUE)
     endif()
 
-    if(NOT NO_TESTING)
-      cgal_add_test(${exe_name})
-    else()
-      cgal_add_test(${exe_name} NO_EXECUTION)
-    endif()
-
     add_to_cached_list( CGAL_EXECUTABLE_TARGETS ${exe_name} )
 
     target_link_libraries(${exe_name} PRIVATE CGAL::CGAL CGAL::Data)
@@ -75,13 +69,10 @@ function(create_single_source_cgal_program firstfile )
       target_link_libraries(${exe_name} PRIVATE ${CGAL_3RD_PARTY_LIBRARIES})
     endif()
 
-    if(POLICY CMP0064)
-      # CMake 3.4 or later
-      if(NOT NO_TESTING)
-        cgal_add_test(${exe_name})
-      else()
-        cgal_add_test(${exe_name} NO_EXECUTION)
-      endif()
+    if(NOT NO_TESTING)
+      cgal_add_test(${exe_name})
+    else()
+      cgal_add_test(${exe_name} NO_EXECUTION)
     endif()
 
   else()

From 09902686dc5b9c8beeb2c838334b8dc68eeeb10a Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 8 Dec 2023 09:00:46 +0300
Subject: [PATCH 1136/1398] minor user man addition

---
 .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 26d5d9c64507..d8532986e8d7 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -998,7 +998,7 @@ solver.
 
 The interpolated curvature measures are then computed for each vertex \f$ v \f$ as the sum of
 the curvature measures of the faces in a ball around \f$ v \f$ weighted by the inclusion ratio of the
-triangle in the ball. If the ball radius is not specified, the sum is instead computed over the incident faces
+triangle in the ball. If the ball radius is not specified (or negative), the sum is instead computed over the incident faces
 of \f$ v \f$.
 
 To get the final curvature value for a vertex \f$ v \f$, the respective interpolated curvature measure

From 5e0a4cabe883c026b7639df68ab8495dc4811947 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 8 Dec 2023 09:04:49 +0300
Subject: [PATCH 1137/1398] minor typo in user man

---
 .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index d8532986e8d7..578fda8cec76 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -974,7 +974,7 @@ introduce a new way to compute curvatures on polygonal meshes. The main idea in
 based on decoupling the normal information from the position information, which is useful for dealing with
 digital surfaces, or meshes with noise on vertex positions. \cgalCite{cgal:lrtc-iccmps-20} introduces some
 extensions to this framework, as it uses linear interpolation on the corrected normal vector field
-to derive new closed form equations for the corrected curvature measures. These <b>interpolated</b>
+to derive new closed-form equations for the corrected curvature measures. These <b>interpolated</b>
 curvature measures are the first step for computing the curvatures. For a triangle \f$ \tau_{ijk} \f$,
 with vertices \a i, \a j, \a k:
 

From 0e60f7cb77b6d04ae52d1d2d88ed9c2530ff0dce Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 8 Dec 2023 09:16:35 +0300
Subject: [PATCH 1138/1398] moving average_edge_length to measure

---
 .../interpolated_corrected_curvatures.h       | 18 ++----------------
 .../CGAL/Polygon_mesh_processing/measure.h    | 19 +++++++++++++++++++
 2 files changed, 21 insertions(+), 16 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index a8d45d8b867f..13cad81b410b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -76,20 +76,6 @@ struct Principal_curvatures_and_directions {
 
 namespace internal {
 
-template<typename PolygonMesh, typename GT>
-typename GT::FT average_edge_length(const PolygonMesh& pmesh) {
-  const std::size_t n = edges(pmesh).size();
-  if (n == 0)
-    return 0;
-
-  typename GT::FT avg_edge_length = 0;
-  for (auto e : edges(pmesh))
-    avg_edge_length += edge_length(e, pmesh);
-
-  avg_edge_length /= static_cast<typename GT::FT>(n);
-  return avg_edge_length;
-}
-
 template<typename GT>
 struct Vertex_measures {
   typename GT::FT area_measure = 0;
@@ -650,7 +636,7 @@ void interpolated_corrected_curvatures_one_vertex(
   typename GT::FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
 
   // calculate avg_edge_length as it is used in case radius is 0, and in the principal curvature computation later
-  typename GT::FT avg_edge_length = average_edge_length<PolygonMesh, GT>(pmesh);
+  typename GT::FT avg_edge_length = average_edge_length<PolygonMesh>(pmesh);
 
   // if the radius is 0, we use a small epsilon to expand the ball (scaled with the average edge length)
   if (is_zero(radius))
@@ -799,7 +785,7 @@ class Interpolated_corrected_curvatures_computer
 
     // if no radius is given, we pass -1 which will make the expansion be only on the incident faces instead of a ball
     const FT radius = choose_parameter(get_parameter(np, internal_np::ball_radius), -1);
-    avg_edge_length = average_edge_length<PolygonMesh, GT>(pmesh);
+    avg_edge_length = average_edge_length<PolygonMesh>(pmesh);
     set_ball_radius(radius);
 
     // check which curvature maps are provided by the user (determines which curvatures are computed)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h
index 8f1c60347eed..520ebbec9be8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/measure.h
@@ -217,6 +217,25 @@ squared_edge_length(typename boost::graph_traits<PolygonMesh>::edge_descriptor e
   return squared_edge_length(halfedge(e, pmesh), pmesh, np);
 }
 
+template<typename PolygonMesh,
+         typename NamedParameters = parameters::Default_named_parameters>
+typename GetGeomTraits<PolygonMesh, NamedParameters>::type::FT
+average_edge_length(const PolygonMesh& pmesh,
+                    const NamedParameters& np = parameters::default_values())
+{
+  typedef typename GetGeomTraits<PolygonMesh, NamedParameters>::type GT;
+
+  const std::size_t n = edges(pmesh).size();
+  CGAL_assertion(n > 0);
+
+  typename GT::FT avg_edge_length = 0;
+  for (auto e : edges(pmesh))
+    avg_edge_length += edge_length(e, pmesh, np);
+
+  avg_edge_length /= static_cast<typename GT::FT>(n);
+  return avg_edge_length;
+}
+
 /**
   * \ingroup PMP_measure_grp
   *

From bcdc0f9f92093d0356afa3d3017150badd6ee74f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 8 Dec 2023 11:45:25 +0100
Subject: [PATCH 1139/1398] remove non needed include

---
 .../examples/Polygon_mesh_processing/soup_autorefinement.cpp    | 2 --
 1 file changed, 2 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index a44d47c8b6d1..5baea1a3964d 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -1,6 +1,4 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
-
 #include <CGAL/Polygon_mesh_processing/autorefinement.h>
 #include <CGAL/Polygon_mesh_processing/repair_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>

From d620bcd61a7d7f05946f6bd6173a3b1fea917473 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 8 Dec 2023 13:20:23 +0100
Subject: [PATCH 1140/1398] user manual

---
 .../Polygon_mesh_processing.txt                     | 13 +++++++++++++
 .../doc/Polygon_mesh_processing/examples.txt        |  1 +
 2 files changed, 14 insertions(+)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 00ccfd382f66..6a658a5829f2 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -864,6 +864,19 @@ vertices at identical positions, can be used to repair this configuration.
 \section PMPGeometricRepair Geometric Repair
 ****************************************
 
+\subsection PMPAutoref Self-intersection Resolution (Autorefinement) in Triangle Soups
+Given a soup of triangles, a self-intersection is defined as the intersection of two triangles from the soup
+such that the intersection is not defined by the convex hull of one, two or three shared vertices.
+In other words, it is an intersection that happens in the interior of one of the two triangles, or in the interior
+of one their edges, except if identical points are associated to different vertices of the triangle soup which
+would then also includes overlaps of duplicated points.
+
+The function `CGAL::Polygon_mesh_processing::autorefine_triangle_soup()` provides a way to refine a triangle soup
+using the intersections of the triangles from the soup. In particular, if some points are duplicated they will be
+merged. Note that if a kernel with exact predicates but inexact constructions is used, some new self-intersections
+might be introduced due to rounding issues of points coordinates.
+To guarantee that the triangle soup is free from self-intersections, a kernel with exact constructions must be used.
+
 \subsection PMPRemoveCapsNeedles Removal of Almost Degenerate Triangle Faces
 Triangle faces of a mesh made up of almost collinear points are badly shaped elements that
 might not be desirable to have in a mesh. The function
diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
index 146e1261ff41..c582dc76739b 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
@@ -43,4 +43,5 @@
 \example Polygon_mesh_processing/cc_compatible_orientations.cpp
 \example Polygon_mesh_processing/remesh_planar_patches.cpp
 \example Polygon_mesh_processing/remesh_almost_planar_patches.cpp
+\example Polygon_mesh_processing/soup_autorefinement.cpp
 */

From 9ac0ef686f157c9311bc5ea969abc1320992e7d8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 8 Dec 2023 13:24:55 +0100
Subject: [PATCH 1141/1398] aspell check

---
 .../doc/Polygon_mesh_processing/Polygon_mesh_processing.txt   | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 6a658a5829f2..d52fd823cd4f 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -214,7 +214,7 @@ it can try to equalize the angles between incident edges, or (and) move vertices
 Border vertices are considered constrained and do not move at any step of the procedure. No vertices are inserted at any time.
 Angle and area smoothing algorithms are based on Surazhsky and Gotsman \cgalCite{cgal:sg-hqct-04}.
 Since area smoothing considers only areas as a smoothing criterion, it may result in long and skinny
-triangles. To paliate this phenomenon, area smoothing is followed by an (optional) step of Delaunay-based edge flips.
+triangles. To palliate this phenomenon, area smoothing is followed by an (optional) step of Delaunay-based edge flips.
 In any case, area smoothing is guaranteed to improve the spatial distribution of the vertices
 over the area that is being smoothed. A simple example can be found in \ref Polygon_mesh_processing/mesh_smoothing_example.cpp.
 
@@ -434,7 +434,7 @@ depicted in red); (iii) `clip_volume=true`: clipping of the volume bounded by th
 \cgalFigureEnd
 
 \cgalFigureBegin{coref_clip_compact, clip_compact.png}
-Clipping a cube with a halfspace: compacity of the clipper (`clip_volume=false` in both cases).
+Clipping a cube with a halfspace: compactivity of the clipper (`clip_volume=false` in both cases).
 From left to right: (i) initial cube and the plane defining the clipping halfspace,
 note that a whole face of the cube (2 triangles) is exactly contained in the plane;
 (ii) `use_compact_clipper=true`: clipping of the surface mesh with a compact halfspace: coplanar faces are part of the output;

From e352f2b17c0d871f56f9829bdd7a0c0ca60473fb Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 8 Dec 2023 13:27:04 +0100
Subject: [PATCH 1142/1398] fix doc

---
 .../Concepts/PMPAutorefinementVisitor.h                       | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPAutorefinementVisitor.h b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPAutorefinementVisitor.h
index e3ef90e9be03..ef2f124329b5 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPAutorefinementVisitor.h
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Concepts/PMPAutorefinementVisitor.h
@@ -6,7 +6,9 @@
 /// the creation of new triangles.
 ///
 /// \cgalRefines{CopyConstructible}
-/// \cgalHasModel `CGAL::Polygon_mesh_processing::Autorefinement::Default_visitor`.
+/// \cgalHasModelsBegin
+/// \cgalHasModels{CGAL::Polygon_mesh_processing::Autorefinement::Default_visitor}
+/// \cgalHasModelsEnd
 
 class PMPAutorefinementVisitor{
 public:

From b0361f7e147f417b99f7fd6a8dbeef72666a7d86 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 8 Dec 2023 13:51:47 +0100
Subject: [PATCH 1143/1398] set_index(v) must be able dimension -1 to deal with
 far points

far points inserted by concurrent Mesh_3
---
 .../internal/tetrahedral_remeshing_helpers.h  | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 09787f05dfdd..9ea06ce7d4ee 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -568,6 +568,8 @@ void set_index(typename C3t3::Vertex_handle v, const C3t3& c3t3)
   case 0:
     v->set_index(Mesh_3::internal::get_index<typename C3t3::Corner_index>(v->index()));
     break;
+  case -1://far points from concurrent Mesh_3
+    break;
   default:
     CGAL_assertion(false);
   }
@@ -1289,6 +1291,18 @@ void check_surface_patch_indices(const C3t3& c3t3)
   }
 }
 
+template<typename C3t3>
+void count_far_points(const C3t3& c3t3)
+{
+  std::size_t count = 0;
+  for (auto v : c3t3.triangulation().finite_vertex_handles())
+  {
+    if(c3t3.in_dimension(v) == -1)
+      ++count;
+  }
+  std::cout << "Nb far points : " << count << std::endl;
+}
+
 template<typename Tr>
 bool are_cell_orientations_valid(const Tr& tr)
 {
@@ -1699,13 +1713,17 @@ void dump_vertices_by_dimension(const Tr& tr, const char* prefix)
   typedef typename Tr::Vertex_handle Vertex_handle;
   std::vector< std::vector<Vertex_handle> > vertices_per_dimension(4);
 
+  std::size_t nb_far_points = 0;
   for (typename Tr::Finite_vertices_iterator
        vit = tr.finite_vertices_begin();
        vit != tr.finite_vertices_end();
        ++vit)
   {
     if (vit->in_dimension() == -1)
+    {
+      ++nb_far_points;
       continue;//far point
+    }
     CGAL_assertion(vit->in_dimension() >= 0 && vit->in_dimension() < 4);
 
     vertices_per_dimension[vit->in_dimension()].push_back(vit);
@@ -1733,6 +1751,7 @@ void dump_vertices_by_dimension(const Tr& tr, const char* prefix)
 
     ofs.close();
   }
+  std::cout << "Nb far points : " << nb_far_points << std::endl;
 }
 
 template<typename Tr>

From 2874c2be608c6c97d62c21116ec3550cb2672b41 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 8 Dec 2023 13:52:09 +0100
Subject: [PATCH 1144/1398] add debug counting far points

---
 .../internal/tetrahedral_adaptive_remeshing_impl.h               | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
index 64e1db2ca603..f07a0a2d793d 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
@@ -530,6 +530,7 @@ class Adaptive_remesher
     CGAL::Tetrahedral_remeshing::debug::dump_vertices_by_dimension(
       m_c3t3.triangulation(), "0-c3t3_vertices_after_init_");
     CGAL::Tetrahedral_remeshing::debug::check_surface_patch_indices(m_c3t3);
+    CGAL::Tetrahedral_remeshing::debug::count_far_points(m_c3t3);
 #endif
   }
 

From 8d0a047685cfea8e1d2f272efe8aa8468b93b5c3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 8 Dec 2023 14:22:41 +0100
Subject: [PATCH 1145/1398] remote debug code and abandonned alternatives

---
 .../Polygon_mesh_processing/autorefinement.h  | 512 +++---------------
 1 file changed, 63 insertions(+), 449 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index d25ea95fe905..bb81855edd55 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -26,7 +26,7 @@
 #include <CGAL/Projection_traits_3.h>
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 
-#ifdef USE_PROGRESS_DISPLAY
+#ifdef CGAL_AUTOREF_USE_PROGRESS_DISPLAY
 #include <boost/timer/progress_display.hpp>
 #endif
 
@@ -52,29 +52,22 @@
 #endif
 #include <tbb/concurrent_map.h>
 #include <tbb/parallel_for.h>
-#ifdef SET_POINT_IDS_USING_MUTEX
+#ifdef CGAL_AUTOREF_SET_POINT_IDS_USING_MUTEX
 #include <CGAL/mutex.h>
 #endif
 #endif
 
 #include <vector>
 
-#define TEST_RESOLVE_INTERSECTION
-#define DEDUPLICATE_SEGMENTS
-//#define USE_DEBUG_PARALLEL_TIMERS
-//#define DEBUG_COUNTERS
-//#define USE_FIXED_PROJECTION_TRAITS
-//#define DEBUG_DEPTH
+//#define CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
+//#define CGAL_AUTOREFINE_DEBUG_COUNTERS
+//#define CGAL_AUTOREF_DEBUG_DEPTH
 
-#ifdef USE_DEBUG_PARALLEL_TIMERS
+#ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
 #include <CGAL/Real_timer.h>
 #endif
 
-#ifdef USE_FIXED_PROJECTION_TRAITS
-#include <CGAL/Kernel_23/internal/Projection_traits_3.h>
-#endif
-
-#if defined(DEBUG_COUNTERS) || defined(USE_DEBUG_PARALLEL_TIMERS)
+#if defined(CGAL_AUTOREFINE_DEBUG_COUNTERS) || defined(CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS)
 #include <CGAL/Real_timer.h>
 #endif
 
@@ -123,20 +116,11 @@ Segment_inter_type
 do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
                                std::size_t ri, std::size_t si,
                                const std::vector<typename K::Point_3>& points,
-                               const typename K::Vector_3& plane_normal,
+                               const typename K::Vector_3& /* plane_normal */,
                                const K& k = K())
 {
   typename K::Collinear_are_ordered_along_line_3 cln_order = k.collinear_are_ordered_along_line_3_object();
-#ifdef USE_PROJECTED_ORIENTATION_2_FOR_COPLANAR_ORIENTATION_TESTS
-  auto cpl_orient =
-    [&plane_normal](const typename K::Point_3& p, const typename K::Point_3& q, const typename K::Point_3& r)
-  {
-    return ::CGAL::orientation(q-p, r-p, plane_normal);
-  };
-#else
   typename K::Coplanar_orientation_3 cpl_orient=k.coplanar_orientation_3_object();
-  CGAL_USE(plane_normal);
-#endif
 
   const typename K::Point_3& p=points[pi];
   const typename K::Point_3& q=points[qi];
@@ -267,75 +251,6 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
   return NO_INTERSECTION;
 }
 
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-template <class Kernel>
-void old_intersection_coplanar_triangles_cutoff(const typename Kernel::Point_3& p,
-                                                const typename Kernel::Point_3& q,
-                                                const typename Kernel::Point_3& r,
-                                                const Kernel& k,
-                                                std::list<typename Kernel::Point_3>& inter_pts)
-{
-  typedef typename std::list<typename Kernel::Point_3>::iterator Iterator;
-
-  if(inter_pts.empty())
-    return;
-
-  typename Kernel::Coplanar_orientation_3 orient = k.coplanar_orientation_3_object();
-  typename Kernel::Construct_line_3 line = k.construct_line_3_object();
-
-  //orient(p,q,r,r) is POSITIVE
-  std::map<const typename Kernel::Point_3*,Orientation> orientations;
-  for (Iterator it=inter_pts.begin();it!=inter_pts.end();++it)
-    orientations[ &(*it) ]=orient(p,q,r,*it);
-
-  CGAL_kernel_assertion_code(int pt_added = 0;)
-
-  const typename Kernel::Point_3* prev = &(*std::prev(inter_pts.end()));
-  Iterator stop = inter_pts.size() > 2 ? inter_pts.end() : std::prev(inter_pts.end());
-  for(Iterator it=inter_pts.begin(); it!=stop; ++it)
-  {
-    const typename Kernel::Point_3& curr = *it;
-    Orientation or_prev = orientations[prev],
-                or_curr = orientations[&curr];
-
-    if((or_prev == POSITIVE && or_curr == NEGATIVE) ||
-       (or_prev == NEGATIVE && or_curr == POSITIVE))
-    {
-      typename Intersection_traits<Kernel, typename Kernel::Line_3, typename Kernel::Line_3>::result_type
-        obj = ::CGAL::Intersections::internal::intersection(line(p,q), line(*prev,curr), k);
-
-      // assert "not empty"
-      CGAL_kernel_assertion(bool(obj));
-
-      const typename Kernel::Point_3* inter = ::CGAL::Intersections::internal::intersect_get<typename Kernel::Point_3>(obj);
-      CGAL_kernel_assertion(inter != nullptr);
-
-      prev = &(*inter_pts.insert(it,*inter));
-      orientations[prev] = COLLINEAR;
-      CGAL_kernel_assertion_code(++pt_added;)
-    }
-
-    prev = &(*it);
-  }
-
-  CGAL_kernel_assertion(pt_added<3);
-  Iterator it = inter_pts.begin();
-  while(it!=inter_pts.end())
-  {
-    if(orientations[&(*it)] == NEGATIVE)
-      inter_pts.erase(it++);
-    else
-      ++it;
-  }
-}
-#endif
-
 // imported from Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
 template<class K>
 void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
@@ -350,146 +265,14 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
   l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(-1,1));
   l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(-1,2));
 
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-  std::list<typename K::Point_3> old_l_inter_pts;
-  old_l_inter_pts.push_back(p2);
-  old_l_inter_pts.push_back(q2);
-  old_l_inter_pts.push_back(r2);
-
-
-  auto enum_to_string = [](CGAL::Orientation o)
-  {
-    if (o==COLLINEAR) return std::string("COLLINEAR");
-    if (o==POSITIVE) return std::string("POSITIVE");
-    return std::string("NEGATIVE");
-  };
-
-  auto to_string = [](const auto& t)
-  {
-    std::stringstream sstr;
-    sstr << "4 "
-         << to_double(t[0].x()) << " "  << to_double(t[0].y()) << " "  << to_double(t[0].z()) << " "
-         << to_double(t[1].x()) << " "  << to_double(t[1].y()) << " "  << to_double(t[1].z()) << " "
-         << to_double(t[2].x()) << " "  << to_double(t[2].y()) << " "  << to_double(t[2].z()) << " "
-         << to_double(t[0].x()) << " "  << to_double(t[0].y()) << " "  << to_double(t[0].z()) << "\n";
-    return sstr.str();
-  };
-
-  std::cout << "intersection_coplanar_triangles\n";
-  std::ofstream("/tmp/t1.polylines.txt") << to_string(t1) << "\n";
-  std::ofstream("/tmp/t2.polylines.txt") << to_string(t2) << "\n";
-
-  std::cout << "Position of vertices of t1: ";
-  std::cout << enum_to_string( coplanar_orientation(p2,q2,r2,p1)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(p2,q2,r2,q1)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(p2,q2,r2,r1)) << "\n";
-  std::cout << "                            ";
-  std::cout << enum_to_string( coplanar_orientation(q2,r2,p2,p1)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(q2,r2,p2,q1)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(q2,r2,p2,r1)) << "\n";
-  std::cout << "                            ";
-  std::cout << enum_to_string( coplanar_orientation(r2,p2,q2,p1)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(r2,p2,q2,q1)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(r2,p2,q2,r1)) << "\n";
-  std::cout << "Position of vertices of t2: ";
-  std::cout << enum_to_string( coplanar_orientation(p1,q1,r1,p2)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(p1,q1,r1,q2)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(p1,q1,r1,r2)) << "\n";
-  std::cout << "                            ";
-  std::cout << enum_to_string( coplanar_orientation(q1,r1,p1,p2)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(q1,r1,p1,q2)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(q1,r1,p1,r2)) << "\n";
-  std::cout << "                            ";
-  std::cout << enum_to_string( coplanar_orientation(r1,p1,q1,p2)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(r1,p1,q1,q2)) << " - ";
-  std::cout << enum_to_string( coplanar_orientation(r1,p1,q1,r2)) << "\n";
-
-  auto print_points = [&]()
-  {
-    for(auto p : l_inter_pts) std::cout << "  (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) "; std::cout <<"\n";
-  };
-  std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
-  print_points();
-#endif
-
   //intersect t2 with the three half planes which intersection defines t1
   K k;
   Intersections::internal::intersection_coplanar_triangles_cutoff(p1,q1,r1,0,p2,q2,r2,k,l_inter_pts); //line p1q1
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-  std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
-  print_points();
-  old_intersection_coplanar_triangles_cutoff(p1,q1,r1,k,old_l_inter_pts);
-  CGAL_assertion(l_inter_pts.size()==old_l_inter_pts.size());
-  for (std::size_t i=0; i<l_inter_pts.size(); ++i)
-  {
-    if (*(std::next(old_l_inter_pts.begin(),i))!=std::next(l_inter_pts.begin(),i)->point(p1,q1,r1,p2,q2,r2,k))
-    {
-      std::cout <<"ERROR with point #" << i << "\n";
-      throw std::runtime_error("invalid output 0");
-    }
-  }
-#endif
   Intersections::internal::intersection_coplanar_triangles_cutoff(q1,r1,p1,1,p2,q2,r2,k,l_inter_pts); //line q1r1
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-  std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
-  print_points();
-  old_intersection_coplanar_triangles_cutoff(q1,r1,p1,k,old_l_inter_pts);
-  CGAL_assertion(l_inter_pts.size()==old_l_inter_pts.size());
-  for (std::size_t i=0; i<l_inter_pts.size(); ++i)
-  {
-    if (*(std::next(old_l_inter_pts.begin(),i))!=std::next(l_inter_pts.begin(),i)->point(p1,q1,r1,p2,q2,r2,k))
-    {
-      std::cout <<"ERROR with point #" << i << "\n";
-      throw std::runtime_error("invalid output 1");
-    }
-  }
-#endif
   Intersections::internal::intersection_coplanar_triangles_cutoff(r1,p1,q1,2,p2,q2,r2,k,l_inter_pts); //line r1p1
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-  std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
-  print_points();
-  old_intersection_coplanar_triangles_cutoff(r1,p1,q1,k,old_l_inter_pts);
-  CGAL_assertion(l_inter_pts.size()==old_l_inter_pts.size());
-  for (std::size_t i=0; i<l_inter_pts.size(); ++i)
-  {
-    if (*(std::next(old_l_inter_pts.begin(),i))!=std::next(l_inter_pts.begin(),i)->point(p1,q1,r1,p2,q2,r2,k))
-    {
-      std::cout <<"ERROR with point #" << i << "\n";
-      throw std::runtime_error("invalid output 2");
-    }
-  }
-#endif
-
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-  std::size_t start=inter_pts.size();
-#endif
 
   for (const Intersections::internal::Point_on_triangle<K>& pot : l_inter_pts)
     inter_pts.push_back( pot.point(p1,q1,r1,p2,q2,r2,k) );
-
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-  for (std::size_t i=0; i<l_inter_pts.size(); ++i)
-  {
-    typename K::Point_3 inter = inter_pts[start+i];
-    CGAL_assertion( coplanar_orientation(p1,q1,r1,inter)!=NEGATIVE );
-    CGAL_assertion( coplanar_orientation(q1,r1,p1,inter)!=NEGATIVE );
-    CGAL_assertion( coplanar_orientation(r1,p1,q1,inter)!=NEGATIVE );
-    CGAL_assertion( coplanar_orientation(p2,q2,r2,inter)!=NEGATIVE );
-    CGAL_assertion( coplanar_orientation(q2,r2,p2,inter)!=NEGATIVE );
-    CGAL_assertion( coplanar_orientation(r2,p2,q2,inter)!=NEGATIVE );
-  }
-
-  std::ofstream debug("interpts.xyz");
-  debug << std::setprecision(17);
-  debug << l_inter_pts.size() << "\n";
-  for (auto pot : l_inter_pts)
-    debug << pot.point(p1,q1,r1,p2,q2,r2,k)  << "\n";
-  debug.close();
-  // std::cout <<"check!\n";
-  // int i;
-  // std::cin >> i;
-#endif
-
 }
 
 // imported from Polygon_mesh_processing/internal/Corefinement/intersect_triangle_segment_3.h
@@ -509,23 +292,6 @@ find_intersection(const typename K::Point_3& p, const typename K::Point_3& q,  /
 
   int nb_coplanar=(ab==COPLANAR?1:0) + (bc==COPLANAR?1:0) + (ca==COPLANAR?1:0);
 
-/*
-  if ( nb_coplanar==0 )
-    return result_type(ON_FACE,hd,is_src_coplanar,is_tgt_coplanar);
-
-  if (nb_coplanar==1){
-    if (ab==COPLANAR)
-      // intersection is ab
-      return result_type(ON_EDGE,next(hd,tm),is_src_coplanar,is_tgt_coplanar);
-    if (bc==COPLANAR)
-      // intersection is bc
-      return result_type(ON_EDGE,prev(hd,tm),is_src_coplanar,is_tgt_coplanar);
-    CGAL_assertion(ca==COPLANAR);
-    // intersection is ca
-    return result_type(ON_EDGE,hd,is_src_coplanar,is_tgt_coplanar);
-  }
-*/
-
   if (is_p_coplanar)
   {
     inter_pts.push_back(p);
@@ -646,7 +412,7 @@ bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   if (ori[0]== COPLANAR && ori[1]==COPLANAR && ori[2]==COPLANAR)
   {
     coplanar_intersections<K>(t1, t2, inter_pts);
-#ifdef DEBUG_DEPTH
+#ifdef CGAL_AUTOREF_DEBUG_DEPTH
     for (auto p : inter_pts)
       if (depth(p)>2) throw std::runtime_error("Depth is not 4: "+std::to_string(depth(p)));
 #endif
@@ -674,7 +440,7 @@ bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   auto last = std::unique(inter_pts.begin(), inter_pts.end());
   inter_pts.erase(last, inter_pts.end());
 
-#ifdef DEBUG_DEPTH
+#ifdef CGAL_AUTOREF_DEBUG_DEPTH
   for (auto p : inter_pts)
     if (depth(p)>2) throw std::runtime_error("Depth is not 2: "+std::to_string(depth(p)));
 #endif
@@ -682,16 +448,7 @@ bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   return false;
 }
 
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-//////////////////////////////////
-
 template <class EK,
-#ifdef USE_FIXED_PROJECTION_TRAITS
-          int dim,
-#endif
           class PointVector
 >
 void generate_subtriangles(std::size_t ti,
@@ -704,20 +461,8 @@ void generate_subtriangles(std::size_t ti,
                            PointVector& new_triangles
                            )
 {
-  // std::cout << "generate_subtriangles()\n";
-  // std::cout << std::setprecision(17);
-
-#ifdef USE_FIXED_PROJECTION_TRAITS
-  typedef ::CGAL::internal::Projection_traits_3<EK, dim> P_traits;
-#else
   typedef CGAL::Projection_traits_3<EK> P_traits;
-#endif
-
-#ifndef TEST_RESOLVE_INTERSECTION
-  typedef CGAL::Exact_intersections_tag Itag;
-#else
   typedef CGAL::No_constraint_intersection_tag Itag;
-#endif
 
   typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits ,Default, Itag> CDT_2;
   //typedef CGAL::Constrained_triangulation_plus_2<CDT_2> CDT;
@@ -729,15 +474,6 @@ void generate_subtriangles(std::size_t ti,
   typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
   typename EK::Point_3 o(CGAL::ORIGIN);
 
-#ifdef USE_FIXED_PROJECTION_TRAITS
-  P_traits cdt_traits;
-  bool orientation_flipped = false;
-  CDT cdt(cdt_traits);
-  // TODO: still need to figure out why I can't make the orientation_flipped correctly
-  cdt.insert(t[0]);
-  cdt.insert(t[1]);
-  cdt.insert(t[2]);
-#else
   bool orientation_flipped = false;
   if ( typename EK::Less_xyz_3()(o+n,o) )
   {
@@ -751,9 +487,8 @@ void generate_subtriangles(std::size_t ti,
   cdt.insert_outside_affine_hull(t[1]);
   typename CDT::Vertex_handle v = cdt.tds().insert_dim_up(cdt.infinite_vertex(), orientation_flipped);
   v->set_point(t[2]);
-#endif
 
-#ifdef DEBUG_COUNTERS
+#ifdef CGAL_AUTOREFINE_DEBUG_COUNTERS
   struct Counter
   {
     int c1=0;
@@ -781,37 +516,11 @@ void generate_subtriangles(std::size_t ti,
   };
 
   static Counter counter;
-#define COUNTER_INSTRUCTION(X) X
+#define CGAL_AUTOREF_COUNTER_INSTRUCTION(X) X
 #else
-#define COUNTER_INSTRUCTION(X)
+#define CGAL_AUTOREF_COUNTER_INSTRUCTION(X)
 #endif
 
-
-#ifdef TEST_RESOLVE_INTERSECTION
-  //~ static std::ofstream debug("inter_segments.polylines.txt");
-  //~ debug.precision(17);
-
-  //~ std::cout << "points.size() " << points.size() << "\n";
-  //~ std::set<std::size_t> all_triangles_indices(in_triangle_ids.begin(), in_triangle_ids.end());
-  //~ all_triangles_indices.insert(ti);
-
-  //~ std::ofstream debug("triangles.polylines.txt");
-  //~ debug << std::setprecision(17);
-  //~ for (std::size_t i : all_triangles_indices)
-    //~ debug << "4 "
-          //~ << triangles[i][0] << " "
-          //~ << triangles[i][1] << " "
-          //~ << triangles[i][2] << " "
-          //~ << triangles[i][0] << "\n";
-  //~ debug.close();
-  //~ debug.open("triangle.off");
-  //~ debug << std::setprecision(17);
-  //~ debug << "OFF\n3 1 0\n";
-  //~ debug << triangles[ti][0] << "\n"
-        //~ << triangles[ti][1] << "\n"
-        //~ << triangles[ti][2] << "\n 3 0 1 2\n";
-  //~ debug.close();
-
   // pre-compute segment intersections
   if (!segments.empty())
   {
@@ -819,7 +528,7 @@ void generate_subtriangles(std::size_t ti,
 
     std::vector< std::vector<std::size_t> > points_on_segments(nbs);
 
-    COUNTER_INSTRUCTION(counter.timer1.start();)
+    CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer1.start();)
 
     std::map<typename EK::Point_3, std::size_t> point_id_map;
 
@@ -831,7 +540,6 @@ void generate_subtriangles(std::size_t ti,
       CGAL_assertion(insertion_ok);
     }
 
-
     auto get_point_id = [&](const typename EK::Point_3& pt)
     {
       auto insert_res = point_id_map.insert(std::make_pair(pt, points.size()));
@@ -855,17 +563,17 @@ void generate_subtriangles(std::size_t ti,
         {
           if ( !do_overlap(segment_boxes[i], segment_boxes[j]) )
           {
-            COUNTER_INSTRUCTION(++counter.c5;)
-            COUNTER_INSTRUCTION(++counter.total;)
+            CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c5;)
+            CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.total;)
             continue;
           }
 
-          COUNTER_INSTRUCTION(counter.timer5.start();)
+          CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer5.start();)
           Segment_inter_type seg_inter_type =
             do_coplanar_segments_intersect<EK>(segments[i].first, segments[i].second,
                                                segments[j].first, segments[j].second,
                                                points, n);
-          COUNTER_INSTRUCTION(counter.timer5.stop();)
+          CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer5.stop();)
 
           switch(seg_inter_type)
           {
@@ -892,25 +600,25 @@ void generate_subtriangles(std::size_t ti,
             case POINT_INTERSECTION:
             {
               if (   coplanar_triangles.count(CGAL::make_sorted_pair(in_triangle_ids[i], in_triangle_ids[j])) == 0
-                  &&  coplanar_triangles.count(CGAL::make_sorted_pair(ti, in_triangle_ids[j])) == 0
-                  &&  coplanar_triangles.count(CGAL::make_sorted_pair(in_triangle_ids[i], ti)) == 0)
+                  && coplanar_triangles.count(CGAL::make_sorted_pair(ti, in_triangle_ids[j])) == 0
+                  && coplanar_triangles.count(CGAL::make_sorted_pair(in_triangle_ids[i], ti)) == 0)
               {
-                COUNTER_INSTRUCTION(counter.timer6.start();)
+                CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer6.start();)
                 typename EK::Point_3 pt = typename EK::Construct_planes_intersection_point_3()(
                   triangles[in_triangle_ids[i]][0], triangles[in_triangle_ids[i]][1],triangles[in_triangle_ids[i]][2],
                   triangles[in_triangle_ids[j]][0], triangles[in_triangle_ids[j]][1],triangles[in_triangle_ids[j]][2],
                   triangles[ti][0], triangles[ti][1],triangles[ti][2]);
-                COUNTER_INSTRUCTION(counter.timer6.stop();)
+                CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer6.stop();)
 
-                COUNTER_INSTRUCTION(++counter.c1;)
+                CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c1;)
                 std::size_t pid = get_point_id(pt);
                 points_on_segments[i].push_back(pid);
                 points_on_segments[j].push_back(pid);
               }
               else
               {
-                COUNTER_INSTRUCTION(++counter.c2;)
-                COUNTER_INSTRUCTION(counter.timer4.start();)
+                CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c2;)
+                CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer4.start();)
                 typename EK::Point_3 pt = typename EK::Construct_coplanar_segments_intersection_point_3()(
                   points[segments[i].first], points[segments[i].second],
                   points[segments[j].first], points[segments[j].second]);
@@ -918,69 +626,63 @@ void generate_subtriangles(std::size_t ti,
                 std::size_t pid = get_point_id(pt);
                 points_on_segments[i].push_back(pid);
                 points_on_segments[j].push_back(pid);
-                COUNTER_INSTRUCTION(counter.timer4.stop();)
-                //~ std::ofstream debug ("/tmp/triangles.polylines.txt");
-                //~ debug << "4 " << triangles[ti][0] << " " << triangles[ti][1] << " " << triangles[ti][2] << " " << triangles[ti][0] << "\n";
-                //~ debug << "4 " << triangles[in_triangle_ids[i]][0] << " " << triangles[in_triangle_ids[i]][1] << " " << triangles[in_triangle_ids[i]][2] << " " << triangles[in_triangle_ids[i]][0] << "\n";
-                //~ debug << "4 " << triangles[in_triangle_ids[j]][0] << " " << triangles[in_triangle_ids[j]][1] << " " << triangles[in_triangle_ids[j]][2] << " " << triangles[in_triangle_ids[j]][0] << "\n";
-                //~ debug.close();
-                //~ throw std::runtime_error("Unexpected case 1");
+                CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer4.stop();)
               }
               break;
             }
             case COPLANAR_SEGMENT_PQ:
             {
-              COUNTER_INSTRUCTION(++counter.c3;)
+              CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c3;)
               points_on_segments[j].push_back(segments[i].first);
               points_on_segments[j].push_back(segments[i].second);
               break;
             }
             case COPLANAR_SEGMENT_RS:
             {
-              COUNTER_INSTRUCTION(++counter.c3;)
+              CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c3;)
               points_on_segments[i].push_back(segments[j].first);
               points_on_segments[i].push_back(segments[j].second);
               break;
             }
             case COPLANAR_SEGMENT_PR:
             {
-              COUNTER_INSTRUCTION(++counter.c3;)
+              CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c3;)
               points_on_segments[i].push_back(segments[j].first);
               points_on_segments[j].push_back(segments[i].first);
               break;
             }
             case COPLANAR_SEGMENT_QS:
             {
-              COUNTER_INSTRUCTION(++counter.c3;)
+              CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c3;)
               points_on_segments[i].push_back(segments[j].second);
               points_on_segments[j].push_back(segments[i].second);
               break;
             }
             case COPLANAR_SEGMENT_PS:
             {
-              COUNTER_INSTRUCTION(++counter.c3;)
+              CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c3;)
               points_on_segments[i].push_back(segments[j].second);
               points_on_segments[j].push_back(segments[i].first);
               break;
             }
             case COPLANAR_SEGMENT_QR:
             {
-              COUNTER_INSTRUCTION(++counter.c3;)
+              CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c3;)
               points_on_segments[i].push_back(segments[j].first);
               points_on_segments[j].push_back(segments[i].second);
               break;
             }
             case NO_INTERSECTION:
             {
-              COUNTER_INSTRUCTION(++counter.c4;)
+              CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c4;)
             }
           }
         }
-        COUNTER_INSTRUCTION(++counter.total;)
+        CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.total;)
       }
     }
-    COUNTER_INSTRUCTION(counter.timer1.stop();)
-    COUNTER_INSTRUCTION(counter.timer2.start();)
+    CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer1.stop();)
+    CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer2.start();)
     std::size_t nb_new_segments=0;
     for (std::size_t i = 0; i<nbs; ++i)
     {
@@ -1013,42 +715,9 @@ void generate_subtriangles(std::size_t ti,
         auto last = std::unique(points_on_segments[i].begin(), points_on_segments[i].end());
         points_on_segments[i].erase(last, points_on_segments[i].end());
         nb_new_segments+=points_on_segments[i].size()-2;
-
-        //~ {
-        //~ std::cout << "cst_points.size() " << cst_points.size() << "\n";
-        //~ std::ofstream debugbis("subcst.polylines.txt");
-        //~ debugbis << std::setprecision(17);
-
-        //~ std::cout << "splittng " << segments[i] << "\n";
-        //~ static int kkk=-1;
-        //~ ++kkk;
-        //~ std::ofstream debugter("subcst_"+std::to_string(i)+".polylines.txt");
-        //~ for (std::size_t k=0; k<=points_on_segments[i].size(); ++k)
-        //~ {
-          //~ exact(cst_points[src_id+k]);
-          //~ exact(cst_points[src_id+k+1]);
-          //~ debugbis << "2 " << cst_points[src_id+k] << " " <<  cst_points[src_id+k+1] << "\n";
-          //~ debugter << "2 " << cst_points[src_id+k] << " " <<  cst_points[src_id+k+1] << "\n";
-        //~ }
-        //~ std::cout << "---\n";
-        //~ }
       }
     }
-    COUNTER_INSTRUCTION(counter.timer2.stop();)
-
-    //~ int max_degree = 0;
-    //~ for (const auto p : cst_points)
-      //~ max_degree = std::max(max_degree, depth(p));
-    //~ std::cout << "max_degree " << max_degree << "\n";
-
-    //~ if (max_degree > 10){
-      //~ for (const auto p : cst_points)
-        //~ std::cout << " -- " << p << "(" << depth(p) << ")\n";
-      //~ std::cout << "segments:\n";
-      //~ for (auto s : segments)
-        //~ std::cout << "  " << depth(s[0]) << " " << depth(s[1]) << "\n";
-      //~ exit(1);
-    //~ }
+    CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer2.stop();)
 
     // now fill segments with new segments
     segments.reserve(segments.size()+nb_new_segments);
@@ -1074,56 +743,25 @@ void generate_subtriangles(std::size_t ti,
   std::sort(segments.begin(), segments.end());
   auto last = std::unique(segments.begin(), segments.end());
   segments.erase(last, segments.end());
-#endif
-
-  //~ std::ofstream("/tmp/tri.xyz") << std::setprecision(17) << triangles[ti][0] << "\n"
-                                                         //~ << triangles[ti][1] << "\n"
-                                                         //~ << triangles[ti][2] << "\n";
-  //~ std::ofstream debug("/tmp/cst.polylines.txt");
-  //~ debug << std::setprecision(17);
-  //~ for(auto s : segments)
-    //~ debug << "2 " << points[s.first] << " " << points[s.second] << "\n";
-  //~ debug.close();
 
-  COUNTER_INSTRUCTION(counter.timer3.start();)
+  CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer3.start();)
   if (segments.empty())
     cdt.insert(points.begin(), points.end());
   else
     cdt.insert_constraints(points.begin(), points.end(), segments.begin(), segments.end());
-  COUNTER_INSTRUCTION(counter.timer3.stop();)
+  CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer3.stop();)
 
-#ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS
-    static int k = 0;
-    std::stringstream buffer;
-    buffer.precision(17);
-    int nbt=0;
-#endif
-    for (typename CDT::Face_handle fh : cdt.finite_face_handles())
-    {
-      if (orientation_flipped)
-        new_triangles.push_back( { CGAL::make_array(fh->vertex(0)->point(),
-                                                    fh->vertex(cdt.cw(0))->point(),
-                                                    fh->vertex(cdt.ccw(0))->point()), ti } );
-      else
-        new_triangles.push_back( { CGAL::make_array(fh->vertex(0)->point(),
-                                                    fh->vertex(cdt.ccw(0))->point(),
-                                                    fh->vertex(cdt.cw(0))->point()), ti } );
-#ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS
-      ++nbt;
-      buffer << fh->vertex(0)->point() << "\n";
-      buffer << fh->vertex(cdt.ccw(0))->point() << "\n";
-      buffer << fh->vertex(cdt.cw(0))->point() << "\n";
-#endif
-    }
-
-#ifdef CGAL_DEBUG_PMP_AUTOREFINE_DUMP_TRIANGULATIONS
-    std::ofstream dump("triangulation_"+std::to_string(k)+".off");
-    dump << "OFF\n" << 3*nbt << " " << nbt << " 0\n";
-    dump << buffer.str();
-    for (int i=0; i<nbt; ++i)
-      dump << "3 " << 3*i << " " << 3*i+1 << " " << 3*i+2 << "\n";
-    ++k;
-#endif
+  for (typename CDT::Face_handle fh : cdt.finite_face_handles())
+  {
+    if (orientation_flipped)
+      new_triangles.push_back( { CGAL::make_array(fh->vertex(0)->point(),
+                                                  fh->vertex(cdt.cw(0))->point(),
+                                                  fh->vertex(cdt.ccw(0))->point()), ti } );
+    else
+      new_triangles.push_back( { CGAL::make_array(fh->vertex(0)->point(),
+                                                  fh->vertex(cdt.ccw(0))->point(),
+                                                  fh->vertex(cdt.cw(0))->point()), ti } );
+  }
 }
 
 } // end of autorefine_impl
@@ -1267,7 +905,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   std::vector< std::vector<std::size_t> > all_in_triangle_ids(triangles.size());
 
   CGAL_PMP_AUTOREFINE_VERBOSE("compute intersections");
-#ifdef USE_DEBUG_PARALLEL_TIMERS
+#ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
   Real_timer t;
   t.start();
 #endif
@@ -1320,14 +958,13 @@ void autorefine_triangle_soup(PointRange& soup_points,
         coplanar_triangles.insert(CGAL::make_sorted_pair(i1, i2));
     }
   }
-#ifdef USE_DEBUG_PARALLEL_TIMERS
+#ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
   t.stop();
   std::cout << t.time() << " sec. for #2" << std::endl;
   t.reset();
 #endif
 
-#ifdef DEDUPLICATE_SEGMENTS
-#ifdef USE_DEBUG_PARALLEL_TIMERS
+#ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
   t.start();
 #endif
 
@@ -1396,11 +1033,10 @@ void autorefine_triangle_soup(PointRange& soup_points,
     deduplicate_inserted_segments(ti);
   }
 
-#ifdef USE_DEBUG_PARALLEL_TIMERS
+#ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
   t.stop();
   std::cout << t.time() << " sec. for #3" << std::endl;
   t.reset();
-#endif
 #endif
 
   CGAL_PMP_AUTOREFINE_VERBOSE("triangulate faces");
@@ -1413,7 +1049,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   std::vector<std::pair<std::array<EK::Point_3,3>, std::size_t>> new_triangles;
 #endif
 
-#ifdef USE_PROGRESS_DISPLAY
+#ifdef CGAL_AUTOREF_USE_PROGRESS_DISPLAY
   boost::timer::progress_display pd(triangles.size());
 #endif
 
@@ -1423,37 +1059,15 @@ void autorefine_triangle_soup(PointRange& soup_points,
       new_triangles.push_back({triangles[ti], ti});
     else
     {
-#ifdef USE_FIXED_PROJECTION_TRAITS
-      const std::array<typename EK::Point_3, 3>& t = triangles[ti];
-      auto is_constant_in_dim = [](const std::array<typename EK::Point_3, 3>& t, int dim)
-      {
-        return t[0][dim] == t[1][dim] && t[0][dim] != t[2][dim];
-      };
-
-      typename EK::Vector_3 orth = CGAL::normal(t[0], t[1], t[2]); // TODO::avoid construction?
-      int c = CGAL::abs(orth[0]) > CGAL::abs(orth[1]) ? 0 : 1;
-      c = CGAL::abs(orth[2]) > CGAL::abs(orth[c]) ? 2 : c;
-
-      if (c == 0) {
-        autorefine_impl::generate_subtriangles<EK, 0>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
-      }
-      else if (c == 1) {
-        autorefine_impl::generate_subtriangles<EK, 1>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
-      }
-      else if (c == 2) {
-        autorefine_impl::generate_subtriangles<EK, 2>(ti, all_segments[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, triangles, new_triangles);
-      }
-#else
       autorefine_impl::generate_subtriangles<EK>(ti, all_segments_ids[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
-#endif
     }
 
-#ifdef USE_PROGRESS_DISPLAY
+#ifdef CGAL_AUTOREF_USE_PROGRESS_DISPLAY
     ++pd;
 #endif
   };
 
-#ifdef USE_DEBUG_PARALLEL_TIMERS
+#ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
   t.start();
 #endif
 #ifdef CGAL_LINKED_WITH_TBB
@@ -1472,7 +1086,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
     refine_triangles(ti);
   }
 
-#ifdef USE_DEBUG_PARALLEL_TIMERS
+#ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
   t.stop();
   std::cout << t.time() << " sec. for #1" << std::endl;
   t.reset();
@@ -1552,12 +1166,12 @@ void autorefine_triangle_soup(PointRange& soup_points,
     return insert_res.first->second;
   };
 
-#ifdef USE_DEBUG_PARALLEL_TIMERS
+#ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
   t.start();
 #endif
 
   std::size_t offset = soup_triangles_out.size();
-#ifdef USE_DEBUG_PARALLEL_TIMERS
+#ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
   std::string mode = "parallel";
 #endif
 
@@ -1565,7 +1179,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 #ifdef CGAL_LINKED_WITH_TBB
   if(parallel_execution && new_triangles.size() > 100)
   {
-#ifdef SET_POINT_IDS_USING_MUTEX
+#ifdef CGAL_AUTOREF_SET_POINT_IDS_USING_MUTEX
     //option 1 (using a mutex)
     CGAL_MUTEX point_container_mutex;
     /// Lambda concurrent_get_point_id()
@@ -1672,7 +1286,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   else
 #endif
   {
-#ifdef USE_DEBUG_PARALLEL_TIMERS
+#ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
     mode = "sequential";
 #endif
     soup_triangles_out.reserve(offset + new_triangles.size());
@@ -1687,7 +1301,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
 
 
-#ifdef USE_DEBUG_PARALLEL_TIMERS
+#ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
   t.stop();
   std::cout << t.time() << " sec. for #4 (" << mode << ")" << std::endl;
   t.reset();

From acd03b166c843928585947fae8a72350517b0db1 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 8 Dec 2023 17:09:00 +0000
Subject: [PATCH 1146/1398] write() operates on const& data

---
 .../Polyhedron/CGAL/IO/Polyhedron_iostream.h  |  7 +--
 .../File_formats/Supported_file_formats.txt   | 58 +++++++++----------
 2 files changed, 32 insertions(+), 33 deletions(-)

diff --git a/Polyhedron/doc/Polyhedron/CGAL/IO/Polyhedron_iostream.h b/Polyhedron/doc/Polyhedron/CGAL/IO/Polyhedron_iostream.h
index 8114a141aa7a..a10c0e632bf2 100644
--- a/Polyhedron/doc/Polyhedron/CGAL/IO/Polyhedron_iostream.h
+++ b/Polyhedron/doc/Polyhedron/CGAL/IO/Polyhedron_iostream.h
@@ -75,7 +75,7 @@ This function overloads the generic function \link PkgBGLIoFuncsOFF `write_OFF(s
 \sa \link PkgPolyhedronIOFunc `operator>>(std::istream& in, Polyhedron_3<Traits>& P)` \endlink
 */
 template <class Traits>
-bool write_OFF( std::ostream& out, Polyhedron_3<Traits>& P);
+bool write_OFF( std::ostream& out, const Polyhedron_3<Traits>& P);
 
 /*!
 \relates Polyhedron_3
@@ -83,7 +83,7 @@ bool write_OFF( std::ostream& out, Polyhedron_3<Traits>& P);
             \link PkgPolyhedronIOFunc `CGAL::IO::write_OFF(std::ostream&, Polyhedron_3<Traits>&)` \endlink should be used instead.
 */
 template <class Traits>
-bool write_off( std::ostream& out, Polyhedron_3<Traits>& P);
+bool write_off( std::ostream& out, const Polyhedron_3<Traits>& P);
 
 /*!
 \relates Polyhedron_3
@@ -91,7 +91,6 @@ bool write_off( std::ostream& out, Polyhedron_3<Traits>& P);
 calls \link write_OFF() `write_OFF(out, P)` \endlink.
 */
 template <class Traits>
-std::ostream& operator<<( std::ostream& out, Polyhedron_3<Traits>& P);
+std::ostream& operator<<( std::ostream& out, const Polyhedron_3<Traits>& P);
 
 } /* namespace CGAL */
-
diff --git a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
index cfc647bf7268..995c18794da5 100644
--- a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
+++ b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
@@ -47,25 +47,25 @@ The following table lists some \cgal data structures that have I/O functions com
   </tr>
   <tr>
     <td>`CGAL::Polyhedron_3`</td>
-    <td>\link PkgPolyhedronIOFunc CGAL::IO::read_OFF(const char*, CGAL::Polyhedron_3&)\endlink</td>
+    <td>\link PkgPolyhedronIOFunc CGAL::IO::read_OFF(const std::string&, CGAL::Polyhedron_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any model of `MutableFaceGraph`</td>
-    <td>\link PkgBGLIoFuncsOFF CGAL::IO::read_OFF(const char*, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsOFF CGAL::IO::read_OFF(const std::string&, Graph&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Point Set</td>
     <td>`CGAL::Point_set_3`</td>
-    <td>\link PkgPointSet3IOOFF CGAL::IO::read_OFF(const char*, CGAL::Point_set_3&)\endlink</td>
+    <td>\link PkgPointSet3IOOFF CGAL::IO::read_OFF(const std::string&, CGAL::Point_set_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOOff CGAL::IO::read_OFF(const char*, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOOff CGAL::IO::read_OFF(const std::string&, PointRange&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsOFF CGAL::IO::read_OFF(const char*, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsOFF CGAL::IO::read_OFF(const std::string&, PointRange&, PolygonRange&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="6">Output</td>
@@ -75,25 +75,25 @@ The following table lists some \cgal data structures that have I/O functions com
   </tr>
   <tr>
     <td>`CGAL::Polyhedron_3`</td>
-    <td>\link PkgPolyhedronIOFunc CGAL::IO::write_OFF(const char*, CGAL::Polyhedron_3&)\endlink</td>
+    <td>\link PkgPolyhedronIOFunc CGAL::IO::write_OFF(const char*, const CGAL::Polyhedron_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsOFF CGAL::IO::write_OFF(const char*, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsOFF CGAL::IO::write_OFF(const std::string&, const Graph&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Point Set</td>
     <td>`CGAL::Point_set_3`</td>
-    <td>\link PkgPointSet3IOOFF CGAL::IO::write_OFF(const char*, CGAL::Point_set_3&)\endlink</td>
+    <td>\link PkgPointSet3IOOFF CGAL::IO::write_OFF(const std::string&, const CGAL::Point_set_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOOff CGAL::IO::write_OFF(const char*, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOOff CGAL::IO::write_OFF(const std::string&, const PointRange&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsOFF CGAL::IO::write_OFF(const char*, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsOFF CGAL::IO::write_OFF(const std::string&, const PointRange&, const PolygonRange&)\endlink</td>
   </tr>
 </table>
 
@@ -128,12 +128,12 @@ A precise specification of the format is available <a href="https://www.martinre
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsOBJ CGAL::IO::write_OBJ(const std::string&, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsOBJ CGAL::IO::write_OBJ(const std::string&, const Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsOBJ CGAL::IO::write_OBJ(const std::string&, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsOBJ CGAL::IO::write_OBJ(const std::string&, const PointRange&, const PolygonRange&)\endlink</td>
   </tr>
 </table>
 
@@ -169,12 +169,12 @@ A precise specification of those formats is available <a href="https://www.fabbe
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsSTL CGAL::IO::write_STL(const std::string&, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsSTL CGAL::IO::write_STL(const std::string&, const Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsSTL CGAL::IO::write_STL(const std::string&, PointRange&, TriangleRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsSTL CGAL::IO::write_STL(const std::string&, const PointRange&, const TriangleRange&)\endlink</td>
   </tr>
 </table>
 
@@ -226,25 +226,25 @@ A precise specification of those formats is available <a href="https://paulbourk
     <td rowspan="5">Output</td>
     <td rowspan="2">Polygon Mesh</td>
     <td>`CGAL::Surface_mesh`</td>
-    <td>\link PkgSurfaceMeshIOFuncPLY CGAL::IO::write_PLY(const std::string&, CGAL::Surface_mesh&)\endlink</td>
+    <td>\link PkgSurfaceMeshIOFuncPLY CGAL::IO::write_PLY(const std::string&, const CGAL::Surface_mesh&)\endlink</td>
   </tr>
   <tr>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsPLY CGAL::IO::write_PLY(const std::string&, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsPLY CGAL::IO::write_PLY(const std::string&, const Graph&)\endlink</td>
   </tr>
   <tr>
     <td rowspan="2">Point Set</td>
     <td>`CGAL::Point_set_3`</td>
-    <td>\link PkgPointSet3IOPLY CGAL::IO::write_PLY(const std::string&, CGAL::Point_set_3&)\endlink</td>
+    <td>\link PkgPointSet3IOPLY CGAL::IO::write_PLY(const std::string&, const CGAL::Point_set_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOPly CGAL::IO::write_PLY(const std::string&, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOPly CGAL::IO::write_PLY(const std::string&, const PointRange&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsPLY CGAL::IO::write_PLY(const std::string&, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsPLY CGAL::IO::write_PLY(const std::string&, const PointRange&, PolygonRange&)\endlink</td>
   </tr>
 </table>
 
@@ -280,11 +280,11 @@ A precise specification of those formats is available
     <td rowspan="2">Output</td>
     <td rowspan="2">Point Set</td>
     <td>`CGAL::Point_set_3`</td>
-    <td>\link PkgPointSet3IOLAS CGAL::IO::write_LAS(const std::string&, CGAL::Point_set_3&)\endlink</td>
+    <td>\link PkgPointSet3IOLAS CGAL::IO::write_LAS(const std::string&, const CGAL::Point_set_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOLas CGAL::IO::write_LAS(const std::string&, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOLas CGAL::IO::write_LAS(const std::string&, const PointRange&)\endlink</td>
   </tr>
 </table>
 
@@ -313,11 +313,11 @@ of its coordinates and other properties. Only coordinates and normals are curren
     <td rowspan="2">Output</td>
     <td rowspan="2">Point Set</td>
     <td>`CGAL::Point_set_3`</td>
-    <td>\link PkgPointSet3IOXYZ CGAL::IO::write_XYZ(const std::string&, CGAL::Point_set_3&)\endlink</td>
+    <td>\link PkgPointSet3IOXYZ CGAL::IO::write_XYZ(const std::string&, const CGAL::Point_set_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOXyz CGAL::IO::write_XYZ(const std::string&, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOXyz CGAL::IO::write_XYZ(const std::string&, const PointRange&)\endlink</td>
   </tr>
 </table>
 
@@ -348,12 +348,12 @@ A precise specification of the format is available <a href="https://paulbourke.n
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsGOCAD CGAL::IO::write_GOCAD(const std::string&, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsGOCAD CGAL::IO::write_GOCAD(const std::string&, const Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncsGOCAD CGAL::IO::write_GOCAD(const std::string&, PointRange&, PolygonRange&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncsGOCAD CGAL::IO::write_GOCAD(const std::string&, const PointRange&, const PolygonRange&)\endlink</td>
   </tr>
 </table>
 
@@ -392,12 +392,12 @@ note that only versions `1.x` are currently supported in \cgal.
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncs3MF CGAL::IO::write_3MF(const std::string&, GraphRange&)\endlink</td>
+    <td>\link PkgBGLIoFuncs3MF CGAL::IO::write_3MF(const std::string&, const GraphRange&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>
     <td>Any point + polygon range</td>
-    <td>\link PkgStreamSupportIoFuncs3MF CGAL::IO::write_3MF(const std::string&, PointRanges&, PolygonRanges&)\endlink</td>
+    <td>\link PkgStreamSupportIoFuncs3MF CGAL::IO::write_3MF(const std::string&, const PointRanges&, const PolygonRanges&)\endlink</td>
   </tr>
 </table>
 
@@ -422,7 +422,7 @@ A precise specification of the format is available <a href="http://gun.teipir.gr
     <td rowspan="1" width="75">Output</td>
     <td rowspan="1" width="175">Polygon Mesh</td>
     <td width="250">Any model of `FaceGraph`</td>
-    <td width="500">\link PkgBGLIoFuncsWRL CGAL::IO::write_WRL(const std::string&, Graph&)\endlink</td>
+    <td width="500">\link PkgBGLIoFuncsWRL CGAL::IO::write_WRL(const std::string&, const Graph&)\endlink</td>
   </tr>
 </table>
 
@@ -466,7 +466,7 @@ A precise specification of those formats is available at
     <td rowspan="2">Output</td>
     <td rowspan="1">Polygon Mesh</td>
     <td>Any model of `FaceGraph`</td>
-    <td>\link PkgBGLIoFuncsVTP CGAL::IO::write_VTP(const std::string&, Graph&)\endlink</td>
+    <td>\link PkgBGLIoFuncsVTP CGAL::IO::write_VTP(const std::string&, const Graph&)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>

From 38d9db972857d490b6055c17767505c642d876f4 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 8 Dec 2023 17:15:46 +0000
Subject: [PATCH 1147/1398] write() operates on const& data

---
 .../Stream_support/File_formats/Supported_file_formats.txt  | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
index 995c18794da5..dddf17673162 100644
--- a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
+++ b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
@@ -43,7 +43,7 @@ The following table lists some \cgal data structures that have I/O functions com
     <td rowspan="6" width="75">Input</td>
     <td rowspan="3" width="175">Polygon Mesh</td>
     <td width="250">`CGAL::Surface_mesh`</td>
-    <td width="500">\link PkgSurfaceMeshIOFuncOFF CGAL::IO::read_OFF(const char*, CGAL::Surface_mesh&)\endlink</td>
+    <td width="500">\link PkgSurfaceMeshIOFuncOFF CGAL::IO::read_OFF(const std::string&, CGAL::Surface_mesh&)\endlink</td>
   </tr>
   <tr>
     <td>`CGAL::Polyhedron_3`</td>
@@ -71,11 +71,11 @@ The following table lists some \cgal data structures that have I/O functions com
     <td rowspan="6">Output</td>
     <td rowspan="3">Polygon Mesh</td>
     <td>`CGAL::Surface_mesh`</td>
-    <td>\link PkgSurfaceMeshIOFuncOFF CGAL::IO::write_OFF(const char*, CGAL::Surface_mesh&)\endlink</td>
+    <td>\link PkgSurfaceMeshIOFuncOFF CGAL::IO::write_OFF(const std::string, CGAL::Surface_mesh&)\endlink</td>
   </tr>
   <tr>
     <td>`CGAL::Polyhedron_3`</td>
-    <td>\link PkgPolyhedronIOFunc CGAL::IO::write_OFF(const char*, const CGAL::Polyhedron_3&)\endlink</td>
+    <td>\link PkgPolyhedronIOFunc CGAL::IO::write_OFF(const std::string&, const CGAL::Polyhedron_3&)\endlink</td>
   </tr>
   <tr>
     <td>Any model of `FaceGraph`</td>

From 33bb65ae17c0615f7f41558e94d1a73837c900a3 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 8 Dec 2023 18:03:22 +0000
Subject: [PATCH 1148/1398] PointRange ->  PointOutputIterator

---
 .../doc/Stream_support/File_formats/Supported_file_formats.txt  | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
index dddf17673162..153d8ca086bb 100644
--- a/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
+++ b/Stream_support/doc/Stream_support/File_formats/Supported_file_formats.txt
@@ -60,7 +60,7 @@ The following table lists some \cgal data structures that have I/O functions com
   </tr>
   <tr>
     <td>Any point range</td>
-    <td>\link PkgPointSetProcessing3IOOff CGAL::IO::read_OFF(const std::string&, PointRange&)\endlink</td>
+    <td>\link PkgPointSetProcessing3IOOff CGAL::IO::read_OFF(const std::string&, PointOutputIterator)\endlink</td>
   </tr>
   <tr>
     <td>Polygon Soup</td>

From 93a1549c6515be7b077d9267ca6ba1be377fed28 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 11 Dec 2023 11:34:42 +0100
Subject: [PATCH 1149/1398] used typedef

---
 .../examples/Polygon_mesh_processing/soup_autorefinement.cpp    | 2 --
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h       | 2 +-
 2 files changed, 1 insertion(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index 5baea1a3964d..a76e1254f6e2 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -13,8 +13,6 @@
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
 typedef Kernel::Point_3                                     Point;
 
-typedef CGAL::Surface_mesh<Point>                           Mesh;
-
 namespace PMP = CGAL::Polygon_mesh_processing;
 
 int main(int argc, char** argv)
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index bb81855edd55..46f9ed9cbe7e 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1126,7 +1126,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   }
 
   TriangleRange soup_triangles_out;
-  soup_triangles_out.reserve(soup_triangles.size()); // TODO: remove #deg tri?
+  soup_triangles_out.reserve(soup_triangles.size());
 
   visitor.number_of_output_triangles(soup_triangles.size()+new_triangles.size());
 

From 20b99521ac05cfe27abf119f15a92d23b4d543a0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Mon, 11 Dec 2023 12:17:49 +0100
Subject: [PATCH 1150/1398] Fix typo in benchmarks

---
 .../Alpha_wrap_3/Robustness/robustness_benchmark.cpp        | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp
index 353e5569d1f9..3bf23fe02012 100644
--- a/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp
+++ b/Alpha_wrap_3/benchmark/Alpha_wrap_3/Robustness/robustness_benchmark.cpp
@@ -21,7 +21,7 @@ enum Robustness_benchmark_exit_code
   VALID_SOLID_OUTPUT = 0,
 
   // Failure
-  INTPUT_IS_INVALID = 1,
+  INPUT_IS_INVALID = 1,
   OUTPUT_IS_NOT_TRIANGLE_MESH = 2,
   OUTPUT_IS_COMBINATORIAL_NON_MANIFOLD = 3,
   OUTPUT_HAS_BORDERS = 4,
@@ -59,7 +59,7 @@ int main(int argc, char** argv)
   }
 
   if(argc < 3 || relative_alpha_ratio <= 0.)
-    return AW3i::INTPUT_IS_INVALID;
+    return AW3i::INPUT_IS_INVALID;
 
   Mesh input_mesh;
   if(!PMP::IO::read_polygon_mesh(entry_name_ptr, input_mesh) ||
@@ -70,7 +70,7 @@ int main(int argc, char** argv)
 #endif
      )
   {
-    return AW3i::INTPUT_IS_INVALID;
+    return AW3i::INPUT_IS_INVALID;
   }
 
   const CGAL::Bbox_3 bbox = PMP::bbox(input_mesh);

From d0c224fafbc08c2156d184f6c9841c8a8545aae6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 11 Dec 2023 14:07:08 +0100
Subject: [PATCH 1151/1398] handle some todos

---
 .../Polygon_mesh_processing/autorefinement.h  | 23 ++++++++++---------
 1 file changed, 12 insertions(+), 11 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 46f9ed9cbe7e..05d05637b16a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1,5 +1,3 @@
-//TODO: add for soup face the id of the input face. not sure it is easy to report intersection edge as a pair of vertex id
-//TODO: only return intersection segments (pay attention to degenerate triangles that are currently ignored)
 // Copyright (c) 2023 GeometryFactory (France).
 // All rights reserved.
 //
@@ -735,8 +733,6 @@ void generate_subtriangles(std::size_t ti,
     CGAL_assertion(points.size()==point_id_map.size());
   }
 
-  // TODO: sorted pair to be constructed when pushing_back
-  // TODO: only needed in case of coplanar segments?
   for (std::pair<std::size_t, size_t>& s : segments)
     if (s.second < s.first)
       std::swap(s.first,s.second);
@@ -853,7 +849,9 @@ void autorefine_triangle_soup(PointRange& soup_points,
   typedef std::size_t Input_TID;
   typedef std::pair<Input_TID, Input_TID> Pair_of_triangle_ids;
 
-  std::vector<Pair_of_triangle_ids> si_pairs; // TODO: check std::vector is fine with Parallel_tag
+  // no need for a concurrent vector as the called function itself
+  // takes care of sequentially writing into the output iterator
+  std::vector<Pair_of_triangle_ids> si_pairs;
 
   // collect intersecting pairs of triangles
   CGAL_PMP_AUTOREFINE_VERBOSE("collect intersecting pairs");
@@ -909,8 +907,8 @@ void autorefine_triangle_soup(PointRange& soup_points,
   Real_timer t;
   t.start();
 #endif
-  std::set<std::pair<std::size_t, std::size_t> > intersecting_triangles; // TODO replace with vector<boost::flat_set<>>>
-  std::set<std::pair<std::size_t, std::size_t> > coplanar_triangles; // TODO replace with vector<boost::flat_set<>>>
+  std::set<std::pair<std::size_t, std::size_t> > intersecting_triangles;
+  std::set<std::pair<std::size_t, std::size_t> > coplanar_triangles;
   //TODO: PARALLEL_FOR #2
   for (const Pair_of_triangle_ids& p : si_pairs)
   {
@@ -1096,7 +1094,6 @@ void autorefine_triangle_soup(PointRange& soup_points,
   CGAL_PMP_AUTOREFINE_VERBOSE("create output soup");
 
   Cartesian_converter<EK, GT> to_input;
-  // TODO: reuse the fact that maps per triangle are already sorted
 
 #ifdef CGAL_LINKED_WITH_TBB
   typedef std::conditional_t<parallel_execution,
@@ -1175,9 +1172,11 @@ void autorefine_triangle_soup(PointRange& soup_points,
   std::string mode = "parallel";
 #endif
 
-  //TODO: 100 should be fined tune and depends on #threads
+// It might be possible to optimise the hardcoded value below
+// but the less triangles the faster will anyway be the operation.
+// So it's probably not critical.
 #ifdef CGAL_LINKED_WITH_TBB
-  if(parallel_execution && new_triangles.size() > 100)
+  if(parallel_execution && new_triangles.size() > 50)
   {
 #ifdef CGAL_AUTOREF_SET_POINT_IDS_USING_MUTEX
     //option 1 (using a mutex)
@@ -1336,6 +1335,8 @@ void autorefine_triangle_soup(PointRange& soup_points,
  * @param tm input triangulated surface mesh
  * @param np an optional sequence of \ref bgl_namedparameters "Named Parameters" among the ones listed below
  *
+ * @warning `clear(tm)` will be called before filling `tm` with the refined mesh.
+ *
  * \cgalNamedParamsBegin
  *   \cgalParamNBegin{concurrency_tag}
  *     \cgalParamDescription{a tag indicating if the task should be done using one or several threads.}
@@ -1378,7 +1379,7 @@ autorefine(      TriangleMesh& tm,
 
   autorefine_triangle_soup(soup_points, soup_triangles, np);
 
-  clear(tm); //TODO: keep properties
+  clear(tm);
   repair_polygon_soup(soup_points, soup_triangles);
 
   duplicate_non_manifold_edges_in_polygon_soup(soup_points, soup_triangles);

From 5544ff48933238e57020bf3b87931d08b50fe1ac Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 12 Dec 2023 01:50:26 +0200
Subject: [PATCH 1152/1398] Eliminated the error-prone c-style casting of the
 arrangement object that occurs when using observers.

---
 .../Arrangement_on_surface_2.txt              | 24 +++++++-------
 .../CGAL/Arr_face_index_map.h                 |  4 +--
 .../CGAL/Arr_triangulation_point_location.h   |  3 +-
 .../CGAL/Arr_vertex_index_map.h               |  9 +-----
 .../face_extension.cpp                        |  8 ++---
 .../Arrangement_on_surface_2/observer.cpp     |  5 ++-
 .../include/CGAL/Arr_face_index_map.h         | 12 +++----
 .../Arr_lm_generator_base.h                   |  7 ++---
 .../Arr_lm_vertices_generator.h               |  9 +++---
 .../CGAL/Arr_trapezoid_ric_point_location.h   |  9 +++---
 .../CGAL/Arr_triangulation_point_location.h   |  5 ++-
 .../include/CGAL/Arr_vertex_index_map.h       | 14 ++++-----
 .../include/CGAL/Arrangement_2.h              | 31 -------------------
 .../Arr_on_surface_with_history_2_impl.h      | 23 --------------
 .../include/CGAL/Arrangement_on_surface_2.h   |  3 +-
 .../Arrangement_on_surface_with_history_2.h   | 22 -------------
 .../include/CGAL/Arrangement_with_history_2.h | 28 -----------------
 .../test_observer.cpp                         |  8 ++---
 .../Envelope_divide_and_conquer_3.h           |  4 +--
 .../Envelope_3/Envelope_element_visitor_3.h   |  2 +-
 .../CGAL/Polygon_vertical_decomposition_2.h   |  4 +--
 .../CGAL/Triangular_expansion_visibility_2.h  |  5 ++-
 22 files changed, 57 insertions(+), 182 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index 7c143578c893..4d95b4e71d32 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -5706,17 +5706,19 @@ changes when they occur. In our case observers can be attached to an
 arrangement object. An attached observer receives notifications about
 the changes this arrangement undergoes.
 
-An observer object, the type of which is an instance of the
-`Arr_observer<Arrangement>` class template, stores a pointer to an
-arrangement object. When the `Arr_observer<Arrangement>` class
-template is instantiated, the `Arrangement` parameter must be
-substituted with the type of the arrangement object. The observer
-receives notifications <em>just before</em> a structural change occurs
-in the arrangement and <em>immediately after</em> such a change takes
-place. `Arr_observer` serves as a base class for other
-observer classes and defines a set of virtual notification
-functions, with default empty implementations. The set of functions
-can be divided into three categories, as follows:
+An observer object that observes changes that an arrangement object of
+type `Arrangement` undergoes must be of a type derived from
+`Arrangement::Observer`. The observer object stores a pointer to the
+observed arrangement object. The observer receives notifications
+<em>just before</em> a structural change occurs in the arrangement and
+<em>immediately after</em> such a change takes place.
+`Arrangement::Observer` is an alias to
+`Arr_observer<CGAL::Arrangement_on_surface_2<>>`, where
+`CGAL::Arrangement_on_surface_2<>` is the type of the arrangement
+object or its base type. It serves as a base type for other observer
+classes and defines a set of virtual notification functions, with
+default empty implementations. The set of functions can be divided
+into three categories, as follows:
 
 <OL>
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h
index bcb0d5c378f2..4c48eb10207b 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h
@@ -21,12 +21,11 @@ to dynamically maintain the mapping of face handles to indices.
 
 \cgalModels{DefaultConstructible,CopyConstructible,Assignable,ReadablePropertyMap}
 
-\sa `Arr_observer<Arrangement>`
 \sa `Arr_vertex_index_map<Arrangement>`
 */
 
 template< typename Arrangement >
-class Arr_face_index_map: public Arr_observer<Arrangement> {
+class Arr_face_index_map: public Arrangement::Observer {
 public:
 
 /// \name Types
@@ -74,4 +73,3 @@ Arr_face_index_map(Arrangement_2& arr);
 
 }; /* end Arr_accessor */
 } /* end namespace CGAL */
-
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
index 5106f32ec366..2bd83d5a125c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
@@ -23,7 +23,6 @@ namespace CGAL {
  */
 
 template <typename Arrangement_>
-class Arr_triangulation_point_location : public Arr_observer<Arrangement_>
-{}
+class Arr_triangulation_point_location : public Arrangement_::Observer {}
 
 }
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h
index 1c915a6b23cf..af17eafb8a70 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h
@@ -21,12 +21,11 @@ to dynamically maintain the mapping of vertex handles to indices.
 
 \cgalModels{DefaultConstructible,CopyConstructible,Assignable,ReadablePropertyMap}
 
-\sa `Arr_observer<Arrangement>`
 \sa `Arr_face_index_map<Arrangement>`
 */
 
 template< typename Arrangement >
-class Arr_vertex_index_map: public Arr_observer<Arrangement> {
+class Arr_vertex_index_map: public Arrangement::Observer {
 public:
 
 /// \name Types
@@ -74,9 +73,3 @@ Arr_vertex_index_map(Arrangement_2& arr);
 
 }; /* end Arr_accessor */
 } /* end namespace CGAL */
-
-
-
-
-
-
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp
index 8befee7dafcf..21494ebb8918 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp
@@ -3,7 +3,6 @@
 
 #include <CGAL/basic.h>
 #include <CGAL/Arr_extended_dcel.h>
-#include <CGAL/Arr_observer.h>
 
 #include "arr_exact_construction_segments.h"
 
@@ -12,15 +11,16 @@ using Ex_arrangement = CGAL::Arrangement_2<Traits, Dcel>;
 
 // An arrangement observer, used to receive notifications of face splits and
 // to update the indices of the newly created faces.
-class Face_index_observer : public CGAL::Arr_observer<Ex_arrangement> {
+class Face_index_observer : public Ex_arrangement::Observer {
 private:
   size_t n_faces;                       // the current number of faces
 
 public:
   Face_index_observer(Ex_arrangement& arr) :
-    CGAL::Arr_observer<Ex_arrangement>(arr), n_faces(0)
+    Ex_arrangement::Observer(arr),
+    n_faces(0)
   {
-    CGAL_precondition (arr.is_empty());
+    CGAL_precondition(arr.is_empty());
     arr.unbounded_face()->set_data (0);
   }
 
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/observer.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/observer.cpp
index d4261d64dd2e..547fdab09c02 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/observer.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/observer.cpp
@@ -2,15 +2,14 @@
 // Using a simple arrangement observer.
 
 #include <CGAL/basic.h>
-#include <CGAL/Arr_observer.h>
 
 #include "arr_exact_construction_segments.h"
 #include "arr_print.h"
 
 // An observer that receives notifications of face splits and face mergers.
-class My_observer : public CGAL::Arr_observer<Arrangement> {
+class My_observer : public Arrangement::Observer {
 public:
-  My_observer(Arrangement& arr) : CGAL::Arr_observer<Arrangement>(arr) {}
+  My_observer(Arrangement& arr) : Arrangement::Observer(arr) {}
 
   virtual void before_split_face(Face_handle, Halfedge_handle e) {
     std::cout << "-> The insertion of :  [ " << e->curve()
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_face_index_map.h b/Arrangement_on_surface_2/include/CGAL/Arr_face_index_map.h
index 1e03af5e1c6c..3fb3915b65a9 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_face_index_map.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_face_index_map.h
@@ -21,7 +21,6 @@
  * Definition of the Arr_face_index_map<Arrangement> class.
  */
 
-#include <CGAL/Arr_observer.h>
 #include <CGAL/Unique_hash_map.h>
 #include <CGAL/property_map.h>
 
@@ -35,8 +34,7 @@ namespace CGAL {
  * of faces in the arrangement.
  */
 template <class Arrangement_>
-class Arr_face_index_map : public Arr_observer<Arrangement_>
-{
+class Arr_face_index_map : public Arrangement_::Observer {
 public:
 
   typedef Arrangement_                            Arrangement_2;
@@ -51,7 +49,7 @@ class Arr_face_index_map : public Arr_observer<Arrangement_>
 private:
 
   typedef Arr_face_index_map<Arrangement_2>       Self;
-  typedef Arr_observer<Arrangement_2>             Base;
+  typedef typename Arrangement_2::Observer        Base;
 
   typedef Unique_hash_map<Face_handle, unsigned int>     Index_map;
 
@@ -73,14 +71,14 @@ class Arr_face_index_map : public Arr_observer<Arrangement_>
 
   /*! Constructor with an associated arrangement. */
   Arr_face_index_map (const Arrangement_2& arr) :
-    Base (const_cast<Arrangement_2&> (arr))
+    Base(const_cast<Arrangement_2&>(arr))
   {
     _init();
   }
 
   /*! Copy constructor. */
   Arr_face_index_map (const Self& other) :
-    Base (const_cast<Arrangement_2&> (*(other.arrangement())))
+    Base(const_cast<typename Base::Arrangement_2&>(*(other.arrangement())))
   {
     _init();
   }
@@ -92,7 +90,7 @@ class Arr_face_index_map : public Arr_observer<Arrangement_>
       return (*this);
 
     this->detach();
-    this->attach (const_cast<Arrangement_2&> (*(other.arrangement())));
+    this->attach(const_cast<typename Base::Arrangement_2&>(*(other.arrangement())));
 
     return (*this);
   }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h
index daf08604ed2a..07cf7520a133 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h
@@ -20,7 +20,6 @@
 * Definition of the Arr_landmarks_generator_base<Arrangement> template.
 */
 #include <CGAL/Arr_point_location_result.h>
-#include <CGAL/Arr_observer.h>
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 #include <CGAL/Arr_point_location/Arr_lm_nearest_neighbor.h>
 #include <CGAL/Arr_batched_point_location.h>
@@ -43,8 +42,8 @@ namespace CGAL {
 */
 template <typename Arrangement_,
           typename Nearest_neighbor_ =
-            Arr_landmarks_nearest_neighbor <Arrangement_> >
-class Arr_landmarks_generator_base : public Arr_observer <Arrangement_> {
+            Arr_landmarks_nearest_neighbor<Arrangement_> >
+class Arr_landmarks_generator_base : public Arrangement_::Observer {
 public:
   typedef Arrangement_                                Arrangement_2;
   typedef Nearest_neighbor_                           Nearest_neighbor;
@@ -110,7 +109,7 @@ class Arr_landmarks_generator_base : public Arr_observer <Arrangement_> {
    * \param arr (in) The arrangement.
    */
   Arr_landmarks_generator_base(const Arrangement_2& arr) :
-    Arr_observer<Arrangement_2> (const_cast<Arrangement_2 &>(arr)),
+    Arrangement_2::Observer(const_cast<Arrangement_2&>(arr)),
     m_traits(static_cast<const Traits_adaptor_2*>(arr.geometry_traits())),
     m_ignore_notifications(false),
     m_ignore_remove_edge(false),
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_vertices_generator.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_vertices_generator.h
index 57478ec79363..01fd5aba0527 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_vertices_generator.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_vertices_generator.h
@@ -98,14 +98,13 @@ class Arr_landmarks_vertices_generator :
   virtual void build_landmark_set()
   {
     // Go over the arrangement, and insert all its vertices as landmarks.
-    NN_Point_list         nnp_list;
-    const Arrangement_2*  arr = this->arrangement();
-    Vertex_const_iterator vit;
+    NN_Point_list nnp_list;
+    const auto* arr = this->arrangement();
     num_landmarks = 0;
-    for (vit = arr->vertices_begin(); vit != arr->vertices_end(); ++vit) {
+    for (auto vit = arr->vertices_begin(); vit != arr->vertices_end(); ++vit) {
       Vertex_const_handle vh = vit;
       nnp_list.push_back(NN_Point_2(vh->point(), this->pl_make_result(vh)));
-      num_landmarks++;
+      ++num_landmarks;
     }
 
     // Update the search structure.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h
index 7a4042e9601f..d04136967bac 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h
@@ -26,7 +26,6 @@
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 #include <CGAL/Arr_point_location/Trapezoidal_decomposition_2.h>
 #include <CGAL/Arr_point_location/Td_traits.h>
-#include <CGAL/Arr_observer.h>
 
 namespace CGAL {
 
@@ -36,7 +35,7 @@ namespace CGAL {
  * The Arrangement parameter corresponds to an arrangement instantiation.
  */
 template <typename Arrangement_>
-class Arr_trapezoid_ric_point_location : public Arr_observer <Arrangement_> {
+class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
 public:
   //type of arrangement on surface
   typedef Arrangement_                          Arrangement_on_surface_2;
@@ -148,8 +147,8 @@ class Arr_trapezoid_ric_point_location : public Arr_observer <Arrangement_> {
                            bool with_guarantees = true,
                            double depth_thrs = CGAL_TD_DEFAULT_DEPTH_THRESHOLD,
                            double size_thrs = CGAL_TD_DEFAULT_SIZE_THRESHOLD) :
-    Arr_observer<Arrangement_on_surface_2>
-              (const_cast<Arrangement_on_surface_2 &>(arr)),
+    Arrangement_on_surface_2::
+    Observer(const_cast<Arrangement_on_surface_2&>(arr)),
     m_with_guarantees(with_guarantees)
   {
     m_traits = static_cast<const Traits_adaptor_2*> (arr.geometry_traits());
@@ -352,7 +351,7 @@ class Arr_trapezoid_ric_point_location : public Arr_observer <Arrangement_> {
     std::vector<Halfedge_const_handle> he_container;
     Edge_const_iterator eit;
     Halfedge_const_handle he_cst;
-    Arrangement_on_surface_2 *arr = this->arrangement();
+    auto* arr = this->arrangement();
     //collect the arrangement halfedges
     for (eit = arr->edges_begin(); eit != arr->edges_end(); ++eit)
     {
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h
index e3f5c3565ff4..98e0f1742fd2 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h
@@ -39,8 +39,7 @@ namespace CGAL {
  * triangulation algorithm.
  */
 template <typename Arrangement_>
-class Arr_triangulation_point_location : public Arr_observer<Arrangement_>
-{
+class Arr_triangulation_point_location : public Arrangement_::Observer {
 public:
   typedef Arrangement_                                  Arrangement_2;
 
@@ -129,7 +128,7 @@ class Arr_triangulation_point_location : public Arr_observer<Arrangement_>
    * \param arr (in) The arrangement.
    */
   Arr_triangulation_point_location(const Arrangement_2& arr) :
-    Arr_observer<Arrangement_2>(const_cast<Arrangement_2&>(arr)),
+    Arrangement_2::Observer(const_cast<Arrangement_2&>(arr)),
     m_traits(static_cast<const Traits_adaptor_2*>(arr.geometry_traits())),
     m_ignore_notifications(false),
     m_ignore_remove_edge(false)
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_vertex_index_map.h b/Arrangement_on_surface_2/include/CGAL/Arr_vertex_index_map.h
index ac6902cc9e22..92f412d2495c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_vertex_index_map.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_vertex_index_map.h
@@ -22,7 +22,6 @@
 /*! \file
  * Definition of the Arr_vertex_index_map<Arrangement> class.
  */
-#include <CGAL/Arr_observer.h>
 #include <CGAL/Unique_hash_map.h>
 #include <CGAL/property_map.h>
 
@@ -36,8 +35,7 @@ namespace CGAL {
  * of vertices in the arrangement.
  */
 template <class Arrangement_>
-class Arr_vertex_index_map : public Arr_observer<Arrangement_>
-{
+class Arr_vertex_index_map : public Arrangement_::Observer {
 public:
 
   typedef Arrangement_                            Arrangement_2;
@@ -52,7 +50,7 @@ class Arr_vertex_index_map : public Arr_observer<Arrangement_>
 private:
 
   typedef Arr_vertex_index_map<Arrangement_2>     Self;
-  typedef Arr_observer<Arrangement_2>             Base;
+  typedef typename Arrangement_2::Observer        Base;
 
   typedef Unique_hash_map<Vertex_handle, unsigned int>     Index_map;
 
@@ -67,21 +65,21 @@ class Arr_vertex_index_map : public Arr_observer<Arrangement_>
 
   /*! Default constructor. */
   Arr_vertex_index_map () :
-    Base (),
+    Base(),
     n_vertices (0),
     rev_map (MIN_REV_MAP_SIZE)
   {}
 
   /*! Constructor with an associated arrangement. */
   Arr_vertex_index_map (const Arrangement_2& arr) :
-    Base (const_cast<Arrangement_2&> (arr))
+    Base(const_cast<Arrangement_2&>(arr))
   {
     _init();
   }
 
   /*! Copy constructor. */
   Arr_vertex_index_map (const Self& other) :
-    Base (const_cast<Arrangement_2&> (*(other.arrangement())))
+    Base(const_cast<typename Base::Arrangement_2&> (*(other.arrangement())))
   {
     _init();
   }
@@ -93,7 +91,7 @@ class Arr_vertex_index_map : public Arr_observer<Arrangement_>
       return (*this);
 
     this->detach();
-    this->attach (const_cast<Arrangement_2&> (*(other.arrangement())));
+    this->attach (const_cast<typename Base::Arrangement_2&> (*(other.arrangement())));
 
     return (*this);
   }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2.h
index 5ff66d78b307..1861d50cbae5 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2.h
@@ -115,12 +115,9 @@ class Arrangement_2 :
   typedef typename Base::Inner_ccb_const_iterator  Hole_const_iterator;
 
 private:
-
-  friend class Arr_observer<Self>;
   friend class Arr_accessor<Self>;
 
 public:
-
   /// \name Constructors.
   //@{
 
@@ -215,34 +212,6 @@ class Arrangement_2 :
   }
 
   //@}
-
-protected:
-
-  /// \name Managing and notifying the arrangement observers.
-  //@{
-  typedef Arr_observer<Self>                      Observer;
-
-  /*!
-   * Register a new observer (so it starts receiving notifications).
-   * \param p_obs A pointer to the observer object.
-   */
-  void _register_observer (Observer *p_obs)
-  {
-    Base::_register_observer ((typename Base::Observer*)p_obs);
-    return;
-  }
-
-  /*!
-   * Unregister a new observer (so it stops receiving notifications).
-   * \param p_obs A pointer to the observer object.
-   * \return Whether the observer was successfully unregistered.
-   */
-  bool _unregister_observer (Observer *p_obs)
-  {
-    return (Base::_unregister_observer ((typename Base::Observer*)p_obs));
-  }
-  //@}
-
 };
 
 } //namespace CGAL
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_on_surface_with_history_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_on_surface_with_history_2_impl.h
index b60f198906f3..8c63a3344c1e 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_on_surface_with_history_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_on_surface_with_history_2_impl.h
@@ -273,29 +273,6 @@ bool Arrangement_on_surface_with_history_2<GeomTr,TopTr>::are_mergeable
                                                         e2->curve()));
 }
 
-//-----------------------------------------------------------------------------
-// Register a new observer (so it starts receiving notifications).
-//
-template<class GeomTr, class TopTr>
-void Arrangement_on_surface_with_history_2<GeomTr,TopTr>::
-_register_observer(Arr_observer<Self> *p_obs)
-{
-  Base_arr_2::_register_observer
-    (reinterpret_cast<Arr_observer<Base_arr_2>*>(p_obs));
-  return;
-}
-
-//-----------------------------------------------------------------------------
-// Unregister an observer (so it stops receiving notifications).
-//
-template<class GeomTr, class TopTr>
-bool Arrangement_on_surface_with_history_2<GeomTr,TopTr>::
-_unregister_observer(Arr_observer<Self> *p_obs)
-{
-  return (Base_arr_2::_unregister_observer
-          (reinterpret_cast<Arr_observer<Base_arr_2>*>(p_obs)));
-}
-
 } //namespace CGAL
 
 #endif
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
index ae87c8ddb28c..f99be868ac05 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
@@ -109,6 +109,8 @@ class Arrangement_on_surface_2 {
   typedef typename Topology_traits::Dcel            Dcel;
   typedef typename Dcel::Size                       Size;
 
+  typedef Arr_observer<Self>                        Observer;
+
 protected:
   friend class Arr_observer<Self>;
   friend class Arr_accessor<Self>;
@@ -892,7 +894,6 @@ class Arrangement_on_surface_2 {
   typedef CGAL_ALLOCATOR(Point_2)                 Points_alloc;
   typedef CGAL_ALLOCATOR(X_monotone_curve_2)      Curves_alloc;
 
-  typedef Arr_observer<Self>                      Observer;
   typedef std::list<Observer*>                    Observers_container;
   typedef typename Observers_container::iterator  Observers_iterator;
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
index af560449961e..ad1413f9f1c0 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
@@ -26,7 +26,6 @@
 #include <CGAL/Arrangement_on_surface_2.h>
 #include <CGAL/Arr_overlay_2.h>
 #include <CGAL/Arr_consolidated_curve_data_traits_2.h>
-#include <CGAL/Arr_observer.h>
 #include <CGAL/In_place_list.h>
 #include <CGAL/Arrangement_2/Arr_with_history_accessor.h>
 
@@ -75,10 +74,7 @@ class Arrangement_on_surface_with_history_2 :
   typedef typename Geometry_traits_2::Curve_2             Curve_2;
   typedef typename Geometry_traits_2::X_monotone_curve_2  X_monotone_curve_2;
 
-  typedef Arr_observer<Self>                              Observer;
-
 protected:
-  friend class Arr_observer<Self>;
   friend class Arr_accessor<Self>;
   friend class Arr_with_history_accessor<Self>;
 
@@ -582,24 +578,6 @@ class Arrangement_on_surface_with_history_2 :
   //@}
 
 protected:
-
-  /// \name Managing and notifying the arrangement observers.
-  //@{
-
-  /*!
-   * Register a new observer (so it starts receiving notifications).
-   * \param p_obs A pointer to the observer object.
-   */
-  void _register_observer (Observer *p_obs);
-
-  /*!
-   * Unregister an observer (so it stops receiving notifications).
-   * \param p_obs A pointer to the observer object.
-   * \return Whether the observer was successfully unregistered.
-   */
-  bool _unregister_observer (Observer *p_obs);
-  //@}
-
   /// \name Curve insertion and deletion.
   //@{
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_with_history_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_with_history_2.h
index 134c2f0c20e7..24853e94b9cc 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_with_history_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_with_history_2.h
@@ -119,7 +119,6 @@ class Arrangement_with_history_2 :
 private:
   typedef Arrangement_with_history_2<Geometry_traits_2, Dcel>   Self;
 
-  friend class Arr_observer<Self>;
   friend class Arr_accessor<Self>;
 
 public:
@@ -233,35 +232,8 @@ class Arrangement_with_history_2 :
 
     return (Face_const_handle (p_oc->face()));
   }
-  //@}
-
-protected:
-
-  /// \name Managing and notifying the arrangement observers.
-  //@{
-  typedef Arr_observer<Self>                      Observer;
 
-  /*!
-   * Register a new observer (so it starts receiving notifications).
-   * \param p_obs A pointer to the observer object.
-   */
-  void _register_observer (Observer *p_obs)
-  {
-    Base::_register_observer ((typename Base::Observer*)p_obs);
-    return;
-  }
-
-  /*!
-   * Unregister a new observer (so it stops receiving notifications).
-   * \param p_obs A pointer to the observer object.
-   * \return Whether the observer was successfully unregistered.
-   */
-  bool _unregister_observer (Observer *p_obs)
-  {
-    return (Base::_unregister_observer ((typename Base::Observer*)p_obs));
-  }
   //@}
-
 };
 
 } //namespace CGAL
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
index 6f12f6e8c736..bc03ddc09572 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
@@ -5,7 +5,6 @@
 #include <CGAL/MP_Float.h>
 #include <CGAL/Arr_segment_traits_2.h>
 #include <CGAL/Arrangement_2.h>
-#include <CGAL/Arr_observer.h>
 #include <CGAL/Arr_enums.h>
 
 #include <iostream>
@@ -57,14 +56,11 @@ void compare_results(std::string str)
 
 // An arrangement observer, used to receive notifications of face splits and
 // face mergers.
-class Test_observer : public CGAL::Arr_observer<Arrangement_2>
-{
+class Test_observer : public Arrangement_2::Observer {
 
 public:
 
-  Test_observer (Arrangement_2& arr) :
-    CGAL::Arr_observer<Arrangement_2> (arr)
-  {}
+  Test_observer(Arrangement_2& arr) : Arrangement_2::Observer(arr) {}
 
   /// \name Notification functions on global arrangement operations.
   //@{
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
index 9b3136be2b4a..757ef127412a 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
@@ -28,7 +28,6 @@
 #include <time.h>
 
 #include <CGAL/enum.h>
-#include <CGAL/Arr_observer.h>
 #include <CGAL/Envelope_3/Envelope_base.h>
 #include <CGAL/Envelope_3/Envelope_overlay_2.h>
 #include <CGAL/Envelope_3/Envelope_element_visitor_3.h>
@@ -134,7 +133,8 @@ class Envelope_divide_and_conquer_3
   typedef typename Minimization_diagram_2::Inner_ccb_iterator
     Inner_ccb_iterator;
 
-  typedef Arr_observer<Minimization_diagram_2>          Md_observer;
+  typedef typename Minimization_diagram_2::Observer
+    Md_observer;
   typedef typename Minimization_diagram_2::Dcel::Dcel_data_iterator
     Envelope_data_iterator;
 
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
index e5184ba9a2a7..d5e118bf8d76 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
@@ -96,7 +96,7 @@ class Envelope_element_visitor_3
   typedef typename Minimization_diagram_2::Dcel::Dcel_data_iterator
                                                         Envelope_data_iterator;
 
-  typedef Arr_observer<Minimization_diagram_2>          Md_observer;
+  typedef typename Minimization_diagram_2::Observer     Md_observer;
   typedef Arr_accessor<Minimization_diagram_2>          Md_accessor;
 
   typedef typename Topology_traits::Default_point_location_strategy
diff --git a/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h b/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h
index 5db68c8abaa3..d040ccb71583 100644
--- a/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h
+++ b/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h
@@ -77,9 +77,9 @@ class Polygon_vertical_decomposition_2 {
 
   // An arrangement observer, used to receive notifications of face splits and
   // face mergers.
-  class My_observer : public CGAL::Arr_observer<Arrangement_2> {
+  class My_observer : public Arrangement_2::Observer {
   public:
-    My_observer(Arrangement_2& arr) : Arr_observer<Arrangement_2>(arr) {}
+    My_observer(Arrangement_2& arr) : Arrangement_2::Observer(arr) {}
 
     virtual void after_split_face(Face_handle f, Face_handle new_f,
                                   bool /* is_hole */)
diff --git a/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h b/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h
index 408bf95c8473..72465c5c97f2 100644
--- a/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h
+++ b/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h
@@ -21,7 +21,6 @@
 #include <memory>
 #include <CGAL/boost/iterator/transform_iterator.hpp>
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
-#include <CGAL/Arr_observer.h>
 #include <CGAL/assertions.h>
 #include <CGAL/use.h>
 
@@ -86,10 +85,10 @@ class Triangular_expansion_visibility_2 {
   };
 
   // Observer to track any changes of the attached arrangement.
-  class Observer : public Arr_observer<Arrangement_2>
+  class Observer : public Arrangement_2::Observer
   {
 
-      typedef Arr_observer<Arrangement_2>                           Base;
+      typedef typename Arrangement_2::Observer                      Base;
       typedef Observer                                              Self;
 
 

From 92e2a7da2d45467218eb37f9df96e7923f36d2a0 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 12 Dec 2023 02:54:19 +0200
Subject: [PATCH 1153/1398] Eliminated the error-prone c-style casting of the
 arrangement that occurs when using observers; renamed Arr_observer =>
 Aos_observer, and introduced Arr_observer for backward compatibility.

---
 .../Arrangement_on_surface_2.txt              |  45 +-
 .../CGAL/Aos_observer.h                       | 409 +++++++++++++
 .../CGAL/Arr_observer.h                       | 422 +------------
 .../PackageDescription.txt                    |   3 +-
 .../face_extension.cpp                        |   5 +-
 .../Arrangement_on_surface_2/observer.cpp     |   5 +-
 .../sgm_point_location.cpp                    |  16 -
 .../include/CGAL/Aos_observer.h               | 573 ++++++++++++++++++
 .../include/CGAL/Arr_observer.h               | 556 +----------------
 .../CGAL/Arr_triangulation_point_location.h   |   1 -
 .../include/CGAL/Arrangement_on_surface_2.h   |   6 +-
 .../Arrangement_on_surface_with_history_2.h   |   2 +-
 .../Envelope_3/Envelope_element_visitor_3.h   |   1 -
 .../CGAL/Triangular_expansion_visibility_2.h  |   2 +-
 14 files changed, 1050 insertions(+), 996 deletions(-)
 create mode 100644 Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
 create mode 100644 Arrangement_on_surface_2/include/CGAL/Aos_observer.h

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index 4d95b4e71d32..622492d43d8a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -5703,22 +5703,25 @@ objects, so that when one object changes state, all its dependents are
 notified and updated automatically. The observed object does not know
 anything about the observers. It merely "publishes" information about
 changes when they occur. In our case observers can be attached to an
-arrangement object. An attached observer receives notifications about
-the changes this arrangement undergoes.
-
-An observer object that observes changes that an arrangement object of
-type `Arrangement` undergoes must be of a type derived from
-`Arrangement::Observer`. The observer object stores a pointer to the
-observed arrangement object. The observer receives notifications
-<em>just before</em> a structural change occurs in the arrangement and
-<em>immediately after</em> such a change takes place.
-`Arrangement::Observer` is an alias to
-`Arr_observer<CGAL::Arrangement_on_surface_2<>>`, where
-`CGAL::Arrangement_on_surface_2<>` is the type of the arrangement
-object or its base type. It serves as a base type for other observer
-classes and defines a set of virtual notification functions, with
-default empty implementations. The set of functions can be divided
-into three categories, as follows:
+arrangement object.
+
+An observer object that observes changes in an arrangement object
+stores a pointer to the attached arrangement object. It receives
+notifications about the changes this arrangement undergoes. The
+observer receives notifications <em>just before</em> a structural
+change occurs in the arrangement and <em>immediately after</em> such a
+change takes place.  An observer object that observes changes in an
+arrangement object of type `Arrangement` must be of a type derived
+from `Arrangement::Observer`, which is an alias to
+`Aos_observer<Arrangement_on_surface_2>`, where
+`Arrangement_on_surface_2` is the type of the arrangement object or
+its base type. An instance of `Aos_observer<>` serves as a base type
+for other observer classes and defines a set of virtual notification
+functions, with default empty implementations.  You can also use the
+template alias `Arr_observer<Arrangement_2>`, where `Arrangement_2` is
+the type of the arrangement object in case it is derived from
+`Arrangement_on_surface_2`.  The set of functions can be divided into
+three categories, as follows:
 
 <OL>
 
@@ -5784,10 +5787,10 @@ the call to `after_global_change()`.
 </OL>
 
 See the Reference Manual for a detailed specification of the
-`Arr_observer` class template and the prototypes of all notification
+`Aos_observer` class template and the prototypes of all notification
 functions.
 
-Each arrangement object stores a list of pointers to `Arr_observer`
+Each arrangement object stores a list of pointers to `Aos_observer`
 objects. This list may be empty, in which case the arrangement does
 not have to notify any external class on the structural changes it
 undergoes. If, however, there are observers associated with the
@@ -5801,7 +5804,7 @@ invoked for each observer.
 <!--  This allows for the nesting of \Index{observer} objects. -->
 
 Concrete arrangement-observer classes should inherit from
-`Arr_observer`. When an observer is constructed, it is attached to a
+`Aos_observer`. When an observer is constructed, it is attached to a
 valid arrangement supplied to the observed constructor, or
 alternatively the observer can be attached to the arrangement at a
 later time.  When this happens, the observer object inserts itself
@@ -5811,8 +5814,8 @@ thereafter. Subsequently, the observer object unregisters itself by
 removing itself from this list just before it is destroyed. Most
 concrete observer-classes do not need to use the full set of
 notifications. Thus, the bodies of all notification methods defined in
-the base class `Arr_observer` are empty. A concrete observer that
-inherits from `Arr_observer` needs to override only the relevant
+the base class `Aos_observer` are empty. A concrete observer that
+inherits from `Aos_observer` needs to override only the relevant
 notification methods. The remaining methods are invoked when
 corresponding changes occur, but they do nothing.
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
new file mode 100644
index 000000000000..8ae211dbe5a4
--- /dev/null
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
@@ -0,0 +1,409 @@
+namespace CGAL {
+
+/*! \ingroup PkgArrangementOnSurface2Ref
+ *
+ * \anchor arr_refarr_obs
+ *
+ * `Aos_observer` serves as an abstract base class for all observer classes that
+ * are attached to an arrangement instance of type `Arrangement` and receive
+ * notifications from the arrangement.  This base class handles the attachment
+ * of the observer to a given arrangement instance or to the detachment of the
+ * observer from this arrangement instance. It also gives a default empty
+ * implementation to all notification functions that are invoked by the
+ * arrangement to notify the observer on local or global changes it undergoes.
+ * The notification functions are all virtual functions, so they can be
+ * overridden by the concrete observer classes that inherit from `Aos_observer`.
+ *
+ * In order to implement a concrete arrangement observer-class, one simply needs
+ * to derive from `Aos_observer` and override the relevant notification
+ * functions. For example, if only face-split events are of interest, it is
+ * sufficient to override just `before_split_face()` (or just
+ * `after_split_face()`).
+ */
+template <typename Arrangement>
+class Aos_observer {
+public:
+
+  /// \name Types
+  /// @{
+
+  /*! the type of the associated arrangement. */
+  typedef unspecified_type Arrangement_2;
+
+  /*! the point type. */
+  typedef typename Arrangement_2::Point_2 Point_2;
+
+  /*! the \f$ x\f$-monotone curve type. */
+  typedef typename Arrangement_2::X_monotone_curve_2 X_monotone_curve_2;
+
+  /*! */
+  typedef typename Arrangement_2::Vertex_handle Vertex_handle;
+
+  /*! */
+  typedef typename Arrangement_2::Halfedge_handle Halfedge_handle;
+
+  /*! */
+  typedef typename Arrangement_2::Face_handle Face_handle;
+
+  /*! represents a connected component of the boundary (CCB), either an outer
+   * boundary or an inner boundary (the latter is also referred to as a hole).
+   */
+  typedef typename Arrangement_2::Ccb_halfedge_circulator Ccb_halfedge_circulator;
+
+  /// @}
+
+  /// \name Creation
+  /// @{
+
+  /*! constructs an observer that is unattached to any arrangement instance. */
+  Aos_observer();
+
+  /*! constructs an observer and attaches it to the given arrangement `arr`. */
+  Aos_observer(Arrangement_2& arr);
+
+  /// @}
+
+  /// \name Modifiers
+  /// @{
+
+  /*! attaches the observer to the given arrangement `arr`. */
+  void attach(Arrangement_2& arr);
+
+  /*! detaches the observer from its arrangement. */
+  void detach();
+
+  /// @}
+
+  /// \name Notifications on Global Arrangement Operations
+  /// @{
+
+  /*! issued just before the attached arrangement is assigned with the contents of
+   * another arrangement `arr`.
+   */
+  virtual void before_assign(const Arrangement_2& arr);
+
+  /*! issued immediately after the attached arrangement has been assigned with the
+   * contents of another arrangement.
+   */
+  virtual void after_assign();
+
+  /*! issued just before the attached arrangement is cleared. */
+  virtual void before_clear();
+
+  /*! issued immediately after the attached arrangement has been cleared, so it
+   * now consists only of a the unbounded face `uf`.
+   */
+  virtual void after_clear(Face_handle uf);
+
+  /*! issued just before a global function starts to modify the attached
+   * arrangement. It is guaranteed that no queries (especially no point-location
+   * queries) are issued until the termination of the global function is indicated
+   * by `after_global_change()`.
+   */
+  virtual void before_global_change();
+
+  /*!
+    issued immediately after a global function has stopped modifying the
+    attached arrangement.
+  */
+  virtual void after_global_change();
+
+  /// @}
+
+  /// \name Notifications on Attachment or Detachment
+  /// @{
+
+  /*! issued just before the observer is attached to the arrangement instance
+   * `arr`.
+   */
+  virtual void before_attach(const Arrangement_2& arr);
+
+  /*! issued immediately after the observer has been attached to an arrangement
+   * instance.
+   */
+  virtual void after_attach();
+
+  /*! issued just before the observer is detached from its arrangement instance.
+   */
+  virtual void before_detach();
+
+  /*! issued immediately after the observer has been detached from its arrangement
+   * instance.
+   */
+  virtual void after_detach();
+
+  /// @}
+
+  /// \name Notifications on Local Changes in the Arrangement
+  /// @{
+
+  /*! issued just before a new vertex that corresponds to the point `p` is
+   * created.
+   */
+  virtual void before_create_vertex(const Point_2& p);
+
+  /*! issued immediately after a new vertex `v` has been created.  Note that the
+   * vertex still has no incident edges and is not connected to any other vertex.
+   */
+  virtual void after_create_vertex(Vertex_handle v);
+
+  /*! issued just before a new vertex at infinity is created, `cv` is the curve
+   * incident to the surface boundary, `ind` is the relevant curve-end, `ps_x` is
+   * the boundary condition of the vertex in \f$ x\f$ and `ps_y` is the boundary
+   * condition of the vertex in \f$ y\f$.
+   */
+  virtual void before_create_boundary_vertex(const X_monotone_curve_2& cv,
+                                             Arr_curve_end ind,
+                                             Arr_parameter_space ps_x,
+                                             Arr_parameter_space ps_y);
+
+  /*! issued immediately after a new vertex `v` has been created.  Note that the
+   * vertex still has no incident edges and is not connected to any other vertex.
+   */
+  virtual void after_create_boundary_vertex(Vertex_handle v);
+
+  /*! issued just before a new edge that corresponds to the \f$ x\f$-monotone
+   * curve `c` and connects the vertices `v1` and `v2` is created.
+   */
+  virtual void before_create_edge(const X_monotone_curve_2& c,
+                                  Vertex_handle v1, Vertex_handle v2);
+
+  /*! issued immediately after a new edge `e` has been created.  The halfedge that
+   * is sent to this function is always directed from `v1` to `v2` (see above).
+   */
+  virtual void after_create_edge(Halfedge_handle e);
+
+  /*! issued just before a vertex `v` is modified to be associated with the point
+   * `p`.
+   */
+  virtual void before_modify_vertex(Vertex_handle v, const Point_2& p);
+
+  /*! issued immediately after an existing vertex `v` has been modified. */
+  virtual void after_modify_vertex(Vertex_handle v);
+
+  /*! issued just before an edge `e` is modified to be associated with the \f$
+   * x\f$-monotone curve `c`.
+   */
+  virtual void before_modify_edge(Halfedge_handle e, const X_monotone_curve_2& c);
+
+  /*! issued immediately after an existing edge `e` has been modified. */
+  virtual void after_modify_edge(Halfedge_handle e);
+
+  /*! issued just before an edge `e` is split into two edges that should be
+   * associated with the \f$ x\f$-monotone curves `c1` and `c2`. The vertex `v`
+   * corresponds to the split point, and will be used to separate the two
+   * resulting edges.
+   */
+  virtual void before_split_edge(Halfedge_handle e, Vertex_handle v,
+                                 const X_monotone_curve_2& c1,
+                                 const X_monotone_curve_2& c2);
+
+  /*! issued immediately after an existing edge has been split into the two given
+   * edges `e1` and `e2`.
+   */
+  virtual void after_split_edge(Halfedge_handle e1, Halfedge_handle e2);
+
+  /*! issued just before a fictitious edge `e` is split into two. The vertex at
+   * infinity `v` corresponds to the split point, and will be used to separate the
+   * two resulting edges.
+   */
+  virtual void before_split_fictitious_edge(Halfedge_handle e, Vertex_handle v);
+
+  /*! issued immediately after an existing fictitious edge has been split into the
+   * two given fictitious edges `e1` and `e2`.
+   */
+  virtual void after_split_fictitious_edge(Halfedge_handle e1, Halfedge_handle e2);
+
+  /*! issued just before a face `f` is split into two, as a result of the
+   * insertion of the edge `e` into the arrangement.
+   */
+  virtual void before_split_face(Face_handle f, Halfedge_handle e);
+
+  /*! issued immediately after the existing face `f1` has been split, such that a
+   * portion of it now forms a new face `f2`. The flag `is_hole` designates
+   * whether `f2` forms a hole (an inner CCB) inside `f1`.
+   */
+  virtual void after_split_face(Face_handle f1, Face_handle f2, bool is_hole);
+
+  /*! issued just before outer ccb `h` inside a face `f` is split into two, as a
+   * result of the removal of the edge `e` from the arrangement.
+   */
+  virtual void before_split_outer_ccb(Face_handle f, Ccb_halfedge_circulator h,
+                                      Halfedge_handle e);
+
+  /*! issued immediately after an outer ccb of the face `f` has been split,
+   * resulting in the two holes `h1` and `h2`.
+   */
+  virtual void after_split_outer_ccb(Face_handle f,
+                                     Ccb_halfedge_circulator h1,
+                                     Ccb_halfedge_circulator h2);
+
+  /*! issued just before an inner ccb `h` inside a face `f` is split into two, as
+   * a result of the removal of the edge `e` from the arrangement.
+   */
+  virtual void before_split_inner_ccb(Face_handle f, Ccb_halfedge_circulator h,
+                                      Halfedge_handle e);
+
+  /*! issued immediately after an inner ccb of the face `f` has been split,
+   * resulting in the two inner CCBs (holes) `h1` and `h2`.
+   */
+  virtual void after_split_inner_ccb(Face_handle f,
+                                     Ccb_halfedge_circulator h1,
+                                     Ccb_halfedge_circulator h2);
+
+  /*! issued just before the edge `e` is inserted as a new outer ccb inside the
+   * face `f`.
+   */
+  virtual void before_add_outer_ccb(Face_handle f, Halfedge_handle e);
+
+  /*! issued immediately after a new outer ccb `h` has been created. The outer ccb
+   * always consists of a single pair of twin halfedges.
+   */
+  virtual void after_add_outer_ccb(Ccb_halfedge_circulator h);
+
+  /*! issued just before the edge `e` is inserted as a new inner ccb inside the
+   * face `f`.
+   */
+  virtual void before_add_inner_ccb(Face_handle f, Halfedge_handle e);
+
+  /*! issued immediately after a new inner ccb `h` has been created. The inner ccb
+   * always consists of a single pair of twin halfedges.
+   */
+  virtual void after_add_inner_ccb(Ccb_halfedge_circulator h);
+
+  /*! issued just before the vertex `v` is inserted as an isolated vertex inside
+   * the face `f`.
+   */
+  virtual void before_add_isolated_vertex(Face_handle f, Vertex_handle v);
+
+  /*! issued immediately after the vertex `v` has been set as an isolated vertex.
+   */
+  virtual void after_add_isolated_vertex(Vertex_handle v);
+
+  /*! issued just before the two edges `e1` and `e2` are merged to form a single
+   * edge that will be associated with the \f$ x\f$-monotone curve `c`.
+   */
+  virtual void before_merge_edge(Halfedge_handle e1, Halfedge_handle e2,
+                                 const X_monotone_curve_2& c);
+
+  /*! issued immediately after two edges have been merged to form the edge `e`. */
+  virtual void after_merge_edge(Halfedge_handle e);
+
+  /*! issued just before the two fictitious edges `e1` and `e2` are merged to form
+   * a single fictitious edge.
+   */
+  virtual void before_merge_fictitious_edge(Halfedge_handle e1,
+                                            Halfedge_handle e2);
+
+  /*! issued immediately after two fictitious edges have been merged to form the
+   * fictitious edge `e`.
+   */
+  virtual void after_merge_fictitious_edge(Halfedge_handle e);
+
+  /*! issued just before the two edges `f1` and `f2` are merged to form a single
+   * face, following the removal of the edge `e` from the arrangement.
+   */
+  virtual void before_merge_face(Face_handle f1, Face_handle f2,
+                                 Halfedge_handle e);
+
+  /*! issued immediately after two faces have been merged to form the face `f`. */
+  virtual void after_merge_face(Face_handle f);
+
+  /*! issued just before two outer ccbs `h1` and `h2` inside the face `f` are
+   * merged to form a single connected component, following the insertion of the
+   * edge `e` into the arrangement.
+   */
+  virtual void before_merge_outer_ccb(Face_handle f,
+                                      Ccb_halfedge_circulator h1,
+                                      Ccb_halfedge_circulator h2,
+                                      Halfedge_handle e);
+
+  /*! issued immediately after two outer ccbs have been merged to form a single
+   * outer ccb `h` inside the face `f`.
+   */
+  virtual void after_merge_outer_ccb(Face_handle f, Ccb_halfedge_circulator h);
+
+  /*! issued just before two inner ccbs `h1` and `h2` inside the face `f` are
+   * merged to form a single connected component, following the insertion of the
+   * edge `e` into the arrangement.
+   */
+  virtual void before_merge_inner_ccb(Face_handle f,
+                                      Ccb_halfedge_circulator h1,
+                                      Ccb_halfedge_circulator h2,
+                                      Halfedge_handle e);
+
+  /*! issued immediately after two inner ccbs have been merged to form a single
+   * inner ccb `h` inside the face `f`.
+   */
+  virtual void after_merge_inner_ccb(Face_handle f, Ccb_halfedge_circulator h);
+
+  /*! issued just before the outer ccb `h` is moved from one face to another.
+   * This can happen if the face `to_f` containing the outer ccb has just been
+   * split from `from_f`.
+   */
+  virtual void before_move_outer_ccb(Face_handle from_f, Face_handle to_f,
+                                     Ccb_halfedge_circulator h);
+
+  /*! issued immediately after the outer ccb `h` has been moved to a new face. */
+  virtual void after_move_outer_ccb(Ccb_halfedge_circulator h);
+
+  /*! issued just before the inner ccb `h` is moved from one face to another.
+   * This can happen if the face `to_f` containing the inner ccb has just been
+   * split from `from_f`.
+   */
+  virtual void before_move_inner_ccb(Face_handle from_f, Face_handle to_f,
+                                     Ccb_halfedge_circulator h);
+
+  /*! issued immediately after the inner ccb `h` has been moved to a new face. */
+  virtual void after_move_inner_ccb(Ccb_halfedge_circulator h);
+
+  /*! issued just before the isolated vertex `v` is moved from one face to
+   * another.  This can happen if the face `to_f` containing the isolated vertex
+   * has just been split from `from_f`.
+   */
+  virtual void before_move_isolated_vertex(Face_handle from_f,
+                                           Face_handle to_f, Vertex_handle v);
+
+  /*! issued immediately after the isolated vertex `v` has been moved to a new
+   * face.
+   */
+  virtual void after_move_isolated_vertex(Vertex_handle v);
+
+  /*! issued just before the vertex `v` is removed from the arrangement. */
+  virtual void before_remove_vertex(Vertex_handle v);
+
+  /*! issued immediately after a vertex has been removed (and deleted) from the
+   * arrangement.
+   */
+  virtual void after_remove_vertex();
+
+  /*! issued just before the edge `e` is removed from the arrangement. */
+  virtual void before_remove_edge(Halfedge_handle e);
+
+  /*! issued immediately after an edge has been removed (and deleted) from the
+   * arrangement.
+   */
+  virtual void after_remove_edge();
+
+  /*! issued just before the outer ccb `f` is removed from inside the face `f`. */
+  virtual void before_remove_outer_ccb(Face_handle f, Ccb_halfedge_circulator h);
+
+  /*! issued immediately after a outer ccb has been removed (and deleted) from
+   * inside the face `f`.
+   */
+  virtual void after_remove_outer_ccb(Face_handle f);
+
+  /*! issued just before the inner ccb `f` is removed from inside the face `f`.
+   */
+  virtual void before_remove_inner_ccb(Face_handle f,
+                                       Ccb_halfedge_circulator h);
+
+  /*! issued immediately after a inner ccb has been removed (and deleted) from
+   * inside the face `f`.
+   */
+  virtual void after_remove_inner_ccb(Face_handle f);
+
+  /// @}
+
+}; /* end Aos_observer */
+} /* end namespace CGAL */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
index fe04d140aeb8..092a1b55732a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
@@ -1,409 +1,33 @@
-namespace CGAL {
-
-/*! \ingroup PkgArrangementOnSurface2Ref
- *
- * \anchor arr_refarr_obs
- *
- * `Arr_observer` serves as an abstract base class for all observer classes that
- * are attached to an arrangement instance of type `Arrangement` and receive
- * notifications from the arrangement.  This base class handles the attachment
- * of the observer to a given arrangement instance or to the detachment of the
- * observer from this arrangement instance. It also gives a default empty
- * implementation to all notification functions that are invoked by the
- * arrangement to notify the observer on local or global changes it undergoes.
- * The notification functions are all virtual functions, so they can be
- * overridden by the concrete observer classes that inherit from `Arr_observer`.
- *
- * In order to implement a concrete arrangement observer-class, one simply needs
- * to derive from `Arr_observer` and override the relevant notification
- * functions. For example, if only face-split events are of interest, it is
- * sufficient to override just `before_split_face()` (or just
- * `after_split_face()`).
- */
-template< typename Arrangement >
-class Arr_observer {
-public:
-
-/// \name Types
-/// @{
-
-/*! the type of the associated arrangement. */
-typedef unspecified_type Arrangement_2;
-
-/*! the point type. */
-typedef typename Arrangement_2::Point_2 Point_2;
-
-/*! the \f$ x\f$-monotone curve type. */
-typedef typename Arrangement_2::X_monotone_curve_2 X_monotone_curve_2;
-
-/*! */
-typedef typename Arrangement_2::Vertex_handle Vertex_handle;
-
-/*! */
-typedef typename Arrangement_2::Halfedge_handle Halfedge_handle;
-
-/*! */
-typedef typename Arrangement_2::Face_handle Face_handle;
-
-/*! represents a connected component of the boundary (CCB), either an outer
- * boundary or an inner boundary (the latter is also referred to as a hole).
- */
-typedef typename Arrangement_2::Ccb_halfedge_circulator Ccb_halfedge_circulator;
-
-/// @}
-
-/// \name Creation
-/// @{
-
-/*! constructs an observer that is unattached to any arrangement instance. */
-Arr_observer();
-
-/*! constructs an observer and attaches it to the given arrangement `arr`. */
-Arr_observer(Arrangement_2& arr);
-
-/// @}
-
-/// \name Modifiers
-/// @{
-
-/*! attaches the observer to the given arrangement `arr`. */
-void attach(Arrangement_2& arr);
-
-/*! detaches the observer from its arrangement. */
-void detach();
-
-/// @}
-
-/// \name Notifications on Global Arrangement Operations
-/// @{
-
-/*! issued just before the attached arrangement is assigned with the contents of
- * another arrangement `arr`.
- */
-virtual void before_assign(const Arrangement_2& arr);
-
-/*! issued immediately after the attached arrangement has been assigned with the
- * contents of another arrangement.
- */
-virtual void after_assign();
-
-/*! issued just before the attached arrangement is cleared. */
-virtual void before_clear();
-
-/*! issued immediately after the attached arrangement has been cleared, so it
- * now consists only of a the unbounded face `uf`.
- */
-virtual void after_clear(Face_handle uf);
-
-/*! issued just before a global function starts to modify the attached
- * arrangement. It is guaranteed that no queries (especially no point-location
- * queries) are issued until the termination of the global function is indicated
- * by `after_global_change()`.
- */
-virtual void before_global_change();
-
-/*!
-issued immediately after a global function has stopped modifying the
-attached arrangement.
-*/
-virtual void after_global_change();
+// Copyright (c) 2023 Tel-Aviv University (Israel).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+//
+// Author(s): Efi Fogel            <efifogel@gmail.com>
 
-/// @}
+#ifndef CGAL_ARR_OBSERVER_H
+#define CGAL_ARR_OBSERVER_H
 
-/// \name Notifications on Attachment or Detachment
-/// @{
-
-/*! issued just before the observer is attached to the arrangement instance
- * `arr`.
- */
-virtual void before_attach(const Arrangement_2& arr);
-
-/*! issued immediately after the observer has been attached to an arrangement
- * instance.
- */
-virtual void after_attach();
-
-/*! issued just before the observer is detached from its arrangement instance.
- */
-virtual void before_detach();
-
-/*! issued immediately after the observer has been detached from its arrangement
- * instance.
- */
-virtual void after_detach();
-
-/// @}
-
-/// \name Notifications on Local Changes in the Arrangement
-/// @{
-
-/*! issued just before a new vertex that corresponds to the point `p` is
- * created.
- */
-virtual void before_create_vertex(const Point_2& p);
-
-/*! issued immediately after a new vertex `v` has been created.  Note that the
- * vertex still has no incident edges and is not connected to any other vertex.
- */
-virtual void after_create_vertex(Vertex_handle v);
-
-/*! issued just before a new vertex at infinity is created, `cv` is the curve
- * incident to the surface boundary, `ind` is the relevant curve-end, `ps_x` is
- * the boundary condition of the vertex in \f$ x\f$ and `ps_y` is the boundary
- * condition of the vertex in \f$ y\f$.
- */
-virtual void before_create_boundary_vertex(const X_monotone_curve_2& cv,
-                                           Arr_curve_end ind,
-                                           Arr_parameter_space ps_x,
-                                           Arr_parameter_space ps_y);
-
-/*! issued immediately after a new vertex `v` has been created.  Note that the
- * vertex still has no incident edges and is not connected to any other vertex.
- */
-virtual void after_create_boundary_vertex(Vertex_handle v);
-
-/*! issued just before a new edge that corresponds to the \f$ x\f$-monotone
- * curve `c` and connects the vertices `v1` and `v2` is created.
- */
-virtual void before_create_edge(const X_monotone_curve_2& c,
-                                Vertex_handle v1, Vertex_handle v2);
-
-/*! issued immediately after a new edge `e` has been created.  The halfedge that
- * is sent to this function is always directed from `v1` to `v2` (see above).
- */
-virtual void after_create_edge(Halfedge_handle e);
-
-/*! issued just before a vertex `v` is modified to be associated with the point
- * `p`.
- */
-virtual void before_modify_vertex(Vertex_handle v, const Point_2& p);
-
-/*! issued immediately after an existing vertex `v` has been modified. */
-virtual void after_modify_vertex(Vertex_handle v);
-
-/*! issued just before an edge `e` is modified to be associated with the \f$
- * x\f$-monotone curve `c`.
- */
-virtual void before_modify_edge(Halfedge_handle e, const X_monotone_curve_2& c);
-
-/*! issued immediately after an existing edge `e` has been modified. */
-virtual void after_modify_edge(Halfedge_handle e);
-
-/*! issued just before an edge `e` is split into two edges that should be
- * associated with the \f$ x\f$-monotone curves `c1` and `c2`. The vertex `v`
- * corresponds to the split point, and will be used to separate the two
- * resulting edges.
+/*! \file
+ * Definition of the Arr_observer<Arrangement> base class mainly for backward compatibility.
  */
-virtual void before_split_edge(Halfedge_handle e, Vertex_handle v,
-                               const X_monotone_curve_2& c1,
-                               const X_monotone_curve_2& c2);
 
-/*! issued immediately after an existing edge has been split into the two given
- * edges `e1` and `e2`.
- */
-virtual void after_split_edge(Halfedge_handle e1, Halfedge_handle e2);
+#include <CGAL/license/Arrangement_on_surface_2.h>
 
-/*! issued just before a fictitious edge `e` is split into two. The vertex at
- * infinity `v` corresponds to the split point, and will be used to separate the
- * two resulting edges.
- */
-virtual void before_split_fictitious_edge(Halfedge_handle e, Vertex_handle v);
+#include <CGAL/disable_warnings.h>
 
-/*! issued immediately after an existing fictitious edge has been split into the
- * two given fictitious edges `e1` and `e2`.
- */
-virtual void after_split_fictitious_edge(Halfedge_handle e1, Halfedge_handle e2);
-
-/*! issued just before a face `f` is split into two, as a result of the
- * insertion of the edge `e` into the arrangement.
- */
-virtual void before_split_face(Face_handle f, Halfedge_handle e);
-
-/*! issued immediately after the existing face `f1` has been split, such that a
- * portion of it now forms a new face `f2`. The flag `is_hole` designates
- * whether `f2` forms a hole (an inner CCB) inside `f1`.
- */
-virtual void after_split_face(Face_handle f1, Face_handle f2, bool is_hole);
-
-/*! issued just before outer ccb `h` inside a face `f` is split into two, as a
- * result of the removal of the edge `e` from the arrangement.
- */
-virtual void before_split_outer_ccb(Face_handle f, Ccb_halfedge_circulator h,
-                                    Halfedge_handle e);
-
-/*! issued immediately after an outer ccb of the face `f` has been split,
- * resulting in the two holes `h1` and `h2`.
- */
-virtual void after_split_outer_ccb(Face_handle f,
-                                   Ccb_halfedge_circulator h1,
-                                   Ccb_halfedge_circulator h2);
-
-/*! issued just before an inner ccb `h` inside a face `f` is split into two, as
- * a result of the removal of the edge `e` from the arrangement.
- */
-virtual void before_split_inner_ccb(Face_handle f, Ccb_halfedge_circulator h,
-                                    Halfedge_handle e);
-
-/*! issued immediately after an inner ccb of the face `f` has been split,
- * resulting in the two inner CCBs (holes) `h1` and `h2`.
- */
-virtual void after_split_inner_ccb(Face_handle f,
-                                   Ccb_halfedge_circulator h1,
-                                   Ccb_halfedge_circulator h2);
-
-/*! issued just before the edge `e` is inserted as a new outer ccb inside the
- * face `f`.
- */
-virtual void before_add_outer_ccb(Face_handle f, Halfedge_handle e);
-
-/*! issued immediately after a new outer ccb `h` has been created. The outer ccb
- * always consists of a single pair of twin halfedges.
- */
-virtual void after_add_outer_ccb(Ccb_halfedge_circulator h);
-
-/*! issued just before the edge `e` is inserted as a new inner ccb inside the
- * face `f`.
- */
-virtual void before_add_inner_ccb(Face_handle f, Halfedge_handle e);
-
-/*! issued immediately after a new inner ccb `h` has been created. The inner ccb
- * always consists of a single pair of twin halfedges.
- */
-virtual void after_add_inner_ccb(Ccb_halfedge_circulator h);
-
-/*! issued just before the vertex `v` is inserted as an isolated vertex inside
- * the face `f`.
- */
-virtual void before_add_isolated_vertex(Face_handle f, Vertex_handle v);
-
-/*! issued immediately after the vertex `v` has been set as an isolated vertex.
- */
-virtual void after_add_isolated_vertex(Vertex_handle v);
-
-/*! issued just before the two edges `e1` and `e2` are merged to form a single
- * edge that will be associated with the \f$ x\f$-monotone curve `c`.
-*/
-virtual void before_merge_edge(Halfedge_handle e1, Halfedge_handle e2,
-                               const X_monotone_curve_2& c);
-
-/*! issued immediately after two edges have been merged to form the edge `e`. */
-virtual void after_merge_edge(Halfedge_handle e);
-
-/*! issued just before the two fictitious edges `e1` and `e2` are merged to form
- * a single fictitious edge.
- */
-virtual void before_merge_fictitious_edge(Halfedge_handle e1,
-                                          Halfedge_handle e2);
-
-/*! issued immediately after two fictitious edges have been merged to form the
- * fictitious edge `e`.
- */
-virtual void after_merge_fictitious_edge(Halfedge_handle e);
-
-/*! issued just before the two edges `f1` and `f2` are merged to form a single
- * face, following the removal of the edge `e` from the arrangement.
- */
-virtual void before_merge_face(Face_handle f1, Face_handle f2,
-                               Halfedge_handle e);
-
-/*! issued immediately after two faces have been merged to form the face `f`. */
-virtual void after_merge_face(Face_handle f);
-
-/*! issued just before two outer ccbs `h1` and `h2` inside the face `f` are
- * merged to form a single connected component, following the insertion of the
- * edge `e` into the arrangement.
- */
-virtual void before_merge_outer_ccb(Face_handle f,
-                                    Ccb_halfedge_circulator h1,
-                                    Ccb_halfedge_circulator h2,
-                                    Halfedge_handle e);
-
-/*! issued immediately after two outer ccbs have been merged to form a single
- * outer ccb `h` inside the face `f`.
- */
-virtual void after_merge_outer_ccb(Face_handle f, Ccb_halfedge_circulator h);
-
-/*! issued just before two inner ccbs `h1` and `h2` inside the face `f` are
- * merged to form a single connected component, following the insertion of the
- * edge `e` into the arrangement.
- */
-virtual void before_merge_inner_ccb(Face_handle f,
-                                    Ccb_halfedge_circulator h1,
-                                    Ccb_halfedge_circulator h2,
-                                    Halfedge_handle e);
-
-/*! issued immediately after two inner ccbs have been merged to form a single
- * inner ccb `h` inside the face `f`.
- */
-virtual void after_merge_inner_ccb(Face_handle f, Ccb_halfedge_circulator h);
-
-/*! issued just before the outer ccb `h` is moved from one face to another.
- * This can happen if the face `to_f` containing the outer ccb has just been
- * split from `from_f`.
- */
-virtual void before_move_outer_ccb(Face_handle from_f, Face_handle to_f,
-                                   Ccb_halfedge_circulator h);
-
-/*! issued immediately after the outer ccb `h` has been moved to a new face. */
-virtual void after_move_outer_ccb(Ccb_halfedge_circulator h);
-
-/*! issued just before the inner ccb `h` is moved from one face to another.
- * This can happen if the face `to_f` containing the inner ccb has just been
- * split from `from_f`.
- */
-virtual void before_move_inner_ccb(Face_handle from_f, Face_handle to_f,
-                                   Ccb_halfedge_circulator h);
-
-/*! issued immediately after the inner ccb `h` has been moved to a new face. */
-virtual void after_move_inner_ccb(Ccb_halfedge_circulator h);
-
-/*! issued just before the isolated vertex `v` is moved from one face to
- * another.  This can happen if the face `to_f` containing the isolated vertex
- * has just been split from `from_f`.
- */
-virtual void before_move_isolated_vertex(Face_handle from_f,
-                                         Face_handle to_f, Vertex_handle v);
-
-/*! issued immediately after the isolated vertex `v` has been moved to a new
- * face.
- */
-virtual void after_move_isolated_vertex(Vertex_handle v);
-
-/*! issued just before the vertex `v` is removed from the arrangement. */
-virtual void before_remove_vertex(Vertex_handle v);
-
-/*! issued immediately after a vertex has been removed (and deleted) from the
- * arrangement.
- */
-virtual void after_remove_vertex();
-
-/*! issued just before the edge `e` is removed from the arrangement. */
-virtual void before_remove_edge(Halfedge_handle e);
-
-/*! issued immediately after an edge has been removed (and deleted) from the
- * arrangement.
- */
-virtual void after_remove_edge();
-
-/*! issued just before the outer ccb `f` is removed from inside the face `f`. */
-virtual void before_remove_outer_ccb(Face_handle f, Ccb_halfedge_circulator h);
-
-/*! issued immediately after a outer ccb has been removed (and deleted) from
- * inside the face `f`.
- */
-virtual void after_remove_outer_ccb(Face_handle f);
+namespace CGAL {
 
-/*! issued just before the inner ccb `f` is removed from inside the face `f`.
- */
-virtual void before_remove_inner_ccb(Face_handle f,
-Ccb_halfedge_circulator h);
+template <typename Arrangement_>
+using Arr_observer = typename Arrangement_::Observer;
 
-/*! issued immediately after a inner ccb has been removed (and deleted) from
- * inside the face `f`.
- */
-virtual void after_remove_inner_ccb(Face_handle f);
+} // namespace CGAL
 
-/// @}
+#include <CGAL/enable_warnings.h>
 
-}; /* end Arr_observer */
-} /* end namespace CGAL */
+#endif
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
index 20dc50a57953..5d9ba63b69b5 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/PackageDescription.txt
@@ -199,7 +199,8 @@ implemented as peripheral classes or as free (global) functions.
 - `CGAL::Arrangement_2<Traits,Dcel>`
 - `CGAL::Arrangement_with_history_2<Traits,Dcel>`
 - `CGAL::Arr_accessor<Arrangement>`
-- `CGAL::Arr_observer<Arrangement>`
+- `CGAL::Aos_observer<ArrangementOnSurface_2>`
+- `CGAL::Arr_observer<Arrangement_2>`
 - `CGAL::Arrangement_2::Vertex`
 - `CGAL::Arrangement_2::Halfedge`
 - `CGAL::Arrangement_2::Face`
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp
index 21494ebb8918..d1bdaa8bb385 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/face_extension.cpp
@@ -3,6 +3,7 @@
 
 #include <CGAL/basic.h>
 #include <CGAL/Arr_extended_dcel.h>
+#include <CGAL/Arr_observer.h>
 
 #include "arr_exact_construction_segments.h"
 
@@ -11,13 +12,13 @@ using Ex_arrangement = CGAL::Arrangement_2<Traits, Dcel>;
 
 // An arrangement observer, used to receive notifications of face splits and
 // to update the indices of the newly created faces.
-class Face_index_observer : public Ex_arrangement::Observer {
+class Face_index_observer : public CGAL::Arr_observer<Ex_arrangement> {
 private:
   size_t n_faces;                       // the current number of faces
 
 public:
   Face_index_observer(Ex_arrangement& arr) :
-    Ex_arrangement::Observer(arr),
+    CGAL::Arr_observer<Ex_arrangement>(arr),
     n_faces(0)
   {
     CGAL_precondition(arr.is_empty());
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/observer.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/observer.cpp
index 547fdab09c02..d4261d64dd2e 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/observer.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/observer.cpp
@@ -2,14 +2,15 @@
 // Using a simple arrangement observer.
 
 #include <CGAL/basic.h>
+#include <CGAL/Arr_observer.h>
 
 #include "arr_exact_construction_segments.h"
 #include "arr_print.h"
 
 // An observer that receives notifications of face splits and face mergers.
-class My_observer : public Arrangement::Observer {
+class My_observer : public CGAL::Arr_observer<Arrangement> {
 public:
-  My_observer(Arrangement& arr) : Arrangement::Observer(arr) {}
+  My_observer(Arrangement& arr) : CGAL::Arr_observer<Arrangement>(arr) {}
 
   virtual void before_split_face(Face_handle, Halfedge_handle e) {
     std::cout << "-> The insertion of :  [ " << e->curve()
diff --git a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
index 1b27e3bdda0e..2fb6649b535d 100644
--- a/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
+++ b/Arrangement_on_surface_2/examples/Arrangement_on_surface_2/sgm_point_location.cpp
@@ -55,22 +55,6 @@ int main() {
   // Landmarks_pl landmarks_pl(gm);
   Walk_pl walk_pl(gm);
   // Trap_pl trap_pl(gm);
-  /* Need to add the code below to both Arr_spherical_gaussian_map_3 and
-   * Arr_polyhedral_sgm, and then work on the trap point location code...
-
-private:
-  friend class Arr_observer<Self>;
-  friend class Arr_accessor<Self>;
-
-protected:
-  typedef Arr_observer<Self>                      Observer;
-
-  void _register_observer(Observer *p_obs)
-  { Base::_register_observer((typename Base::Observer*)p_obs); }
-
-  bool _unregister_observer(Observer *p_obs)
-  { return (Base::_unregister_observer ((typename Base::Observer*)p_obs)); }
-  */
 
   Gm_traits traits;
   Gm_initializer gm_initializer(gm);
diff --git a/Arrangement_on_surface_2/include/CGAL/Aos_observer.h b/Arrangement_on_surface_2/include/CGAL/Aos_observer.h
new file mode 100644
index 000000000000..d74034640e25
--- /dev/null
+++ b/Arrangement_on_surface_2/include/CGAL/Aos_observer.h
@@ -0,0 +1,573 @@
+// Copyright (c) 2006,2007,2009,2010,2011 Tel-Aviv University (Israel).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org).
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+//
+// Author(s): Ron Wein          <wein@post.tau.ac.il>
+//            Efi Fogel         <efifogel@gmail.com>
+
+#ifndef CGAL_AOS_OBSERVER_H
+#define CGAL_AOS_OBSERVER_H
+
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+#include <CGAL/disable_warnings.h>
+
+#include <CGAL/Arr_enums.h>
+
+/*! \file
+ * Definition of the Aos_observer<Arrangement> base class.
+ */
+
+namespace CGAL {
+
+/*! \class
+ * A base class for arrangement observers.
+ * The Arrangement parameter corresponds to an arrangement instantiation.
+ */
+template <typename Arrangement_>
+class Aos_observer
+{
+public:
+  typedef Arrangement_                                     Arrangement_2;
+  typedef Aos_observer<Arrangement_2>                      Self;
+
+  typedef typename Arrangement_2::Point_2                  Point_2;
+  typedef typename Arrangement_2::X_monotone_curve_2       X_monotone_curve_2;
+
+  typedef typename Arrangement_2::Vertex_handle            Vertex_handle;
+  typedef typename Arrangement_2::Halfedge_handle          Halfedge_handle;
+  typedef typename Arrangement_2::Face_handle              Face_handle;
+  typedef typename Arrangement_2::Ccb_halfedge_circulator
+                                                      Ccb_halfedge_circulator;
+
+private:
+  Arrangement_2* p_arr;           // The associated arrangement.
+
+  /*! Copy constructor - not supported. */
+  Aos_observer(const Self&);
+
+  /*! Assignment operator - not supported. */
+  Self& operator=(const Self&);
+
+public:
+  /// \name Construction and destruction functions.
+  //@{
+
+  /*! Default constructor. */
+  Aos_observer() : p_arr(nullptr) {}
+
+  /*! Constructor with an associated arrangement. */
+  Aos_observer(Arrangement_2& arr) : p_arr(&arr)
+  {
+    // Register the observer object in the arrangement.
+    p_arr->_register_observer(this);
+  }
+
+  /*! Destructor. */
+  virtual ~Aos_observer()
+  {
+    // Unregister the observer object from the arrangement.
+    if (p_arr != nullptr)
+      p_arr->_unregister_observer(this);
+  }
+  //@}
+
+  /// \name Modifying the associated arrangement.
+  //@{
+
+  /*! Get the associated arrangement (non-const version). */
+  const Arrangement_2* arrangement() const { return (p_arr); }
+
+  /*! Get the associated arrangement (non-const version). */
+  Arrangement_2* arrangement() { return (p_arr); }
+
+  /*! Attach the observer to an arrangement.
+   * \pre The observer is not already attached to an arrangement.
+   */
+  void attach(Arrangement_2& arr)
+  {
+    // Do nothing if the associated arrangement is not changed.
+    if (p_arr == &arr) return;
+
+    // The observer is not already attached to an arrangement.
+    CGAL_precondition (p_arr == nullptr);
+
+    if (p_arr != nullptr) return;
+
+    // Notify the concrete observer (the sub-class) about the attachment.
+    before_attach(arr);
+
+    // Register the observer object in the new arrangement.
+    p_arr = &arr;
+    p_arr->_register_observer(this);
+
+    // Notify the concrete observer that the attachment took place.
+    after_attach();
+  }
+
+  /*! Detach the observer from the arrangement. */
+  void detach()
+  {
+    if (p_arr == nullptr) return;
+
+    // Notify the concrete observer (the sub-class) about the detachment.
+    before_detach ();
+
+    // Unregister the observer object from the current arrangement, and mark
+    // that the observer is not attached to an arrangement.
+    p_arr->_unregister_observer(this);
+    p_arr = nullptr;
+
+    // Notify the concrete observer that the detachment took place.
+    after_detach();
+  }
+  //@}
+
+  /// \name Notification functions on global arrangement operations.
+  //@{
+
+  /*! Notification before the arrangement is assigned with another
+   * arrangement.
+   * \param arr The arrangement to be copied.
+   */
+  virtual void before_assign(const Arrangement_2& /* arr */) {}
+
+  /*! Notification after the arrangement has been assigned with another
+   * arrangement.
+   */
+  virtual void after_assign() {}
+
+  /*! Notification before the arrangement is cleared. */
+  virtual void before_clear() {}
+
+  /*! Notification after the arrangement is cleared. */
+  virtual void after_clear() {}
+
+  /*! Notification before a global operation modifies the arrangement. */
+  virtual void before_global_change() {}
+
+  /*! Notification after a global operation is completed. */
+  virtual void after_global_change() {}
+  //@}
+
+  /// \name Notification functions on observer attachment or detachment.
+  //@{
+
+  /*! Notification before the observer is attached to an arrangement.
+   * \param arr The arrangement we are about to attach the observer to.
+   */
+  virtual void before_attach(const Arrangement_2& /* arr */) {}
+
+  /*! Notification after the observer has been attached to an arrangement. */
+  virtual void after_attach() {}
+
+  /*! Notification before the observer is detached from the arrangement. */
+  virtual void before_detach() {}
+
+  /*! Notification after the observer has been detached to the arrangement. */
+  virtual void after_detach() {}
+  //@}
+
+  /// \name Notification functions on local changes in the arrangement.
+  //@{
+
+  /*!
+   * Notification before the creation of a new vertex.
+   * \param p The point to be associated with the vertex.
+   *          This point cannot lies on the surface boundaries.
+   */
+  virtual void before_create_vertex(const Point_2& /* p */) {}
+
+  /*! Notification after the creation of a new vertex.
+   * \param v A handle to the created vertex.
+   */
+  virtual void after_create_vertex(Vertex_handle /* v */)
+  {}
+
+  /*! Notification before the creation of a new boundary vertex.
+   * \param p The on the surface boundary.
+   * \param ps_x The boundary condition of the vertex in x.
+   * \param ps_y The boundary condition of the vertex in y.
+   */
+  virtual void before_create_boundary_vertex(const Point_2& /* p */,
+                                             Arr_parameter_space /* ps_x */,
+                                             Arr_parameter_space /* ps_y */)
+  {}
+
+  /*! Notification before the creation of a new boundary vertex.
+   * \param cv The curve incident to the surface boundary.
+   * \param ind The relevant curve-end.
+   * \param ps_x The boundary condition of the vertex in x.
+   * \param ps_y The boundary condition of the vertex in y.
+   */
+  virtual void before_create_boundary_vertex(const X_monotone_curve_2& /* cv */,
+                                             Arr_curve_end /* ind */,
+                                             Arr_parameter_space /* ps_x */,
+                                             Arr_parameter_space /* ps_y */)
+  {}
+
+  /*! Notification after the creation of a new vertex at infinity.
+   * \param v A handle to the created vertex.
+   */
+  virtual void after_create_boundary_vertex(Vertex_handle /* v */) {}
+
+  /*! Notification before the creation of a new edge.
+   * \param c The x-monotone curve to be associated with the edge.
+   * \param v1 A handle to the first end-vertex of the edge.
+   * \param v2 A handle to the second end-vertex of the edge.
+   */
+  virtual void before_create_edge(const X_monotone_curve_2& /* c */,
+                                  Vertex_handle /* v1 */,
+                                  Vertex_handle /* v2 */)
+  {}
+
+  /*! Notification after the creation of a new edge.
+   * \param e A handle to one of the twin halfedges that were created.
+   */
+  virtual void after_create_edge(Halfedge_handle /* e */) {}
+
+  /*! Notification before the modification of an existing vertex.
+   * \param v A handle to the vertex to be updated.
+   * \param p The point to be associated with the vertex.
+   */
+  virtual void before_modify_vertex(Vertex_handle /* v */,
+                                    const Point_2& /* p */)
+  {}
+
+  /*! Notification after a vertex was modified.
+   * \param v A handle to the updated vertex.
+   */
+  virtual void after_modify_vertex(Vertex_handle /* v */) {}
+
+  /*! Notification before the modification of an existing edge.
+   * \param e A handle to one of the twin halfedges to be updated.
+   * \param c The x-monotone curve to be associated with the edge.
+   */
+  virtual void before_modify_edge(Halfedge_handle /* e */,
+                                  const X_monotone_curve_2& /* c */)
+  {}
+
+  /*! Notification after an edge was modified.
+   * \param e A handle to one of the twin halfedges that were updated.
+   */
+  virtual void after_modify_edge(Halfedge_handle /* e */) {}
+
+  /*! Notification before the splitting of an edge into two.
+   * \param e A handle to one of the existing halfedges.
+   * \param v A vertex representing the split point.
+   * \param c1 The x-monotone curve to be associated with the first edge.
+   * \param c2 The x-monotone curve to be associated with the second edge.
+   */
+  virtual void before_split_edge(Halfedge_handle /* e */,
+                                 Vertex_handle /* v */,
+                                 const X_monotone_curve_2& /* c1 */,
+                                 const X_monotone_curve_2& /* c2 */)
+  {}
+
+  /*! Notification after an edge was split.
+   * \param e1 A handle to one of the twin halfedges forming the first edge.
+   * \param e2 A handle to one of the twin halfedges forming the second edge.
+   */
+  virtual void after_split_edge(Halfedge_handle /* e1 */,
+                                Halfedge_handle /* e2 */)
+  {}
+
+  /*! Notification before the splitting of a fictitious edge into two.
+   * \param e A handle to one of the existing halfedges.
+   * \param v A vertex representing the unbounded split point.
+   */
+  virtual void before_split_fictitious_edge(Halfedge_handle /* e */,
+                                            Vertex_handle /* v */)
+  {}
+
+  /*! Notification after a fictitious edge was split.
+   * \param e1 A handle to one of the twin halfedges forming the first edge.
+   * \param e2 A handle to one of the twin halfedges forming the second edge.
+   */
+  virtual void after_split_fictitious_edge(Halfedge_handle /* e1 */,
+                                           Halfedge_handle /* e2 */)
+  {}
+
+  /*! Notification before the splitting of a face into two.
+   * \param f A handle to the existing face.
+   * \param e The new edge whose insertion causes the face to split.
+   */
+  virtual void before_split_face(Face_handle /* f */,
+                                 Halfedge_handle /* e */)
+  {}
+
+  /*! Notification after a face was split.
+   * \param f A handle to the face we have just split.
+   * \param new_f A handle to the new face that has been created.
+   * \param is_hole Whether the new face forms a hole inside f.
+   */
+  virtual void after_split_face(Face_handle /* f */,
+                                Face_handle /* new_f */,
+                                 bool /* is_hole */)
+  {}
+
+  /*! Notification before the splitting of an outer CCB into two.
+   * \param f A handle to the face that owns the outer CCB.
+   * \param h A circulator representing the component boundary.
+   * \param e The new edge whose removal causes the outer CCB to split.
+   */
+  virtual void before_split_outer_ccb(Face_handle /* f */,
+                                      Ccb_halfedge_circulator /* h */,
+                                      Halfedge_handle /* e */)
+  {}
+
+  /*! Notification after an outer CCB was split.
+   * \param f A handle to the face that owns the outer CCBs.
+   * \param h1 A circulator representing the boundary of the first component.
+   * \param h2 A circulator representing the boundary of the second component.
+   */
+  virtual void after_split_outer_ccb(Face_handle /* f */,
+                                     Ccb_halfedge_circulator /* h1 */,
+                                     Ccb_halfedge_circulator /* h2 */)
+  {}
+
+  /*! Notification before the splitting of an inner CCB into two.
+   * \param f A handle to the face containing the inner CCB.
+   * \param h A circulator representing the component boundary.
+   * \param e The new edge whose removal causes the inner CCB to split.
+   */
+  virtual void before_split_inner_ccb(Face_handle /* f */,
+                                      Ccb_halfedge_circulator /* h */,
+                                      Halfedge_handle /* e */)
+  {}
+
+  /*! Notification after an inner CCB was split.
+   * \param f A handle to the face containing the inner CCBs.
+   * \param h1 A circulator representing the boundary of the first component.
+   * \param h2 A circulator representing the boundary of the second component.
+   */
+  virtual void after_split_inner_ccb(Face_handle /* f */,
+                                     Ccb_halfedge_circulator /* h1 */,
+                                     Ccb_halfedge_circulator /* h2 */)
+  {}
+
+  /*! Notification before the creation of a new outer CCB of a face.
+   * \param f A handle to the face that owns the outer CCB.
+   * \param e A halfedge along the new outer CCB.
+   */
+  virtual void before_add_outer_ccb(Face_handle /* f */,
+                                    Halfedge_handle /* e */)
+  {}
+
+  /*! Notification after an outer CCB was added to a face.
+   * \param h A circulator representing the boundary of the new outer CCB.
+   */
+  virtual void after_add_outer_ccb(Ccb_halfedge_circulator /* h */) {}
+
+  /*! Notification before the creation of a new inner CCB inside a face.
+   * \param f A handle to the face containing the inner CCB.
+   * \param e The new halfedge that forms the new inner CCB.
+   */
+  virtual void before_add_inner_ccb(Face_handle /* f */,
+                                    Halfedge_handle /* e */)
+  {}
+
+  /*! Notification after an inner CCB was created inside a face.
+   * \param h A circulator representing the boundary of the new inner CCB.
+   */
+  virtual void after_add_inner_ccb(Ccb_halfedge_circulator /* h */) {}
+
+  /*! Notification before the creation of a new isolated vertex inside a face.
+   * \param f A handle to the face containing the isolated vertex.
+   * \param v The isolated vertex.
+   */
+  virtual void before_add_isolated_vertex(Face_handle /* f */,
+                                          Vertex_handle /* v */)
+  {}
+
+  /*! Notification after an isolated vertex was created inside a face.
+   * \param v The isolated vertex.
+   */
+  virtual void after_add_isolated_vertex(Vertex_handle /* v */) {}
+
+  /*! Notification before the merging of two edges.
+   * \param e1 A handle to one of the halfedges forming the first edge.
+   * \param e2 A handle to one of the halfedges forming the second edge.
+   * \param c The x-monotone curve to be associated with the merged edge.
+   */
+  virtual void before_merge_edge(Halfedge_handle /* e1 */,
+                                 Halfedge_handle /* e2 */,
+                                 const X_monotone_curve_2& /* c */)
+  {}
+
+  /*! Notification after an edge was merged.
+   * \param e A handle to one of the twin halfedges forming the merged edge.
+   */
+  virtual void after_merge_edge(Halfedge_handle /* e */) {}
+
+  /*! Notification before the merging of two fictitious edges.
+   * \param e1 A handle to one of the halfedges forming the first edge.
+   * \param e2 A handle to one of the halfedges forming the second edge.
+   */
+  virtual void before_merge_fictitious_edge(Halfedge_handle /* e1 */,
+                                            Halfedge_handle /* e2 */)
+  {}
+
+  /*! Notification after a fictitious edge was merged.
+   * \param e A handle to one of the twin halfedges forming the merged edge.
+   */
+  virtual void after_merge_fictitious_edge(Halfedge_handle /* e */) {}
+
+  /*! Notification before the merging of two faces.
+   * \param f1 A handle to the first face.
+   * \param f2 A handle to the second face.
+   * \param e The edge whose removal causes the faces to merge.
+   */
+  virtual void before_merge_face(Face_handle /* f1 */,
+                                 Face_handle /* f2 */,
+                                 Halfedge_handle /* e */)
+  {}
+
+  /*! Notification after a face was merged.
+   * \param f A handle to the merged face.
+   */
+  virtual void after_merge_face(Face_handle /* f */) {}
+
+  /*! Notification before the merging of two outer CCBs.
+   * \param f A handle to the face that owns the outer CCBs.
+   * \param h1 A circulator representing the boundary of the first component.
+   * \param h2 A circulator representing the boundary of the second component.
+   * \param e The edge whose insertion or removal causes the CCBs to merge.
+   */
+  virtual void before_merge_outer_ccb(Face_handle /* f */,
+                                      Ccb_halfedge_circulator /* h1 */,
+                                      Ccb_halfedge_circulator /* h2 */,
+                                      Halfedge_handle /* e */)
+  {}
+
+  /*! Notification after an outer CCB was merged.
+   * \param f A handle to the face that owns the outer CCBs.
+   * \param h A circulator representing the boundary of the merged component.
+   */
+  virtual void after_merge_outer_ccb(Face_handle /* f */,
+                                     Ccb_halfedge_circulator /* h */)
+  {}
+
+  /*! Notification before the merging of two inner CCBs (holes).
+   * \param f A handle to the face that contains the inner CCBs.
+   * \param h1 A circulator representing the boundary of the first component.
+   * \param h2 A circulator representing the boundary of the second component.
+   * \param e The edge whose insertion causes the inner CCBs to merge.
+   */
+  virtual void before_merge_inner_ccb(Face_handle /* f */,
+                                      Ccb_halfedge_circulator /* h1 */,
+                                      Ccb_halfedge_circulator /* h2 */,
+                                      Halfedge_handle /* e */)
+  {}
+
+  /*! Notification after an inner CCB was merged.
+   * \param f A handle to the face that contains the inner CCBs.
+   * \param h A circulator representing the boundary of the merged component.
+   */
+  virtual void after_merge_inner_ccb(Face_handle /* f */,
+                                     Ccb_halfedge_circulator /* h */)
+  {}
+
+  /*! Notification before an outer CCB is moved from one face to another.
+   * \param from_f A handle to the face that currently owns the outer CCB.
+   * \param to_f A handle to the face that should own the outer CCB.
+   * \param h A circulator representing the boundary of the component.
+   */
+  virtual void before_move_outer_ccb(Face_handle /* from_f */,
+                                     Face_handle /* to_f */,
+                                     Ccb_halfedge_circulator /* h */)
+  {}
+
+  /*! Notification after an outer CCB is moved from one face to another.
+   * \param h A circulator representing the boundary of the component.
+   */
+  virtual void after_move_outer_ccb(Ccb_halfedge_circulator /* h */) {}
+
+
+  /*! Notification before an inner CCB is moved from one face to another.
+   * \param from_f A handle to the face currently containing the inner CCB.
+   * \param to_f A handle to the face that should contain the inner CCB.
+   * \param h A circulator representing the boundary of the component.
+   */
+  virtual void before_move_inner_ccb(Face_handle /* from_f */,
+                                     Face_handle /* to_f */,
+                                     Ccb_halfedge_circulator /* h */)
+  {}
+
+  /*!
+   * Notification after an inner CCB is moved from one face to another.
+   * \param h A circulator representing the boundary of the component.
+   */
+  virtual void after_move_inner_ccb(Ccb_halfedge_circulator /* h */) {}
+
+  /*! Notification before an isolated vertex is moved from one face to another.
+   * \param from_f A handle to the face currently containing the vertex.
+   * \param to_f A handle to the face that should contain the vertex.
+   * \param v The isolated vertex.
+   */
+  virtual void before_move_isolated_vertex(Face_handle /* from_f */,
+                                           Face_handle /* to_f */,
+                                           Vertex_handle /* v */)
+  {}
+
+  /*! Notification after an isolated vertex is moved from one face to another.
+   * \param v The isolated vertex.
+   */
+  virtual void after_move_isolated_vertex(Vertex_handle /* v */) {}
+
+  /*! Notificaion before the removal of a vertex.
+   * \param v A handle to the vertex to be deleted.
+   */
+  virtual void before_remove_vertex(Vertex_handle /* v */) {}
+
+  /*! Notificaion after the removal of a vertex. */
+  virtual void after_remove_vertex() {}
+
+  /*! Notification before the removal of an edge.
+   * \param e A handle to one of the twin halfedges to be deleted.
+   */
+  virtual void before_remove_edge(Halfedge_handle /* e */) {}
+
+  /*! Notificaion after the removal of an edge. */
+  virtual void after_remove_edge() {}
+
+  /*! Notification before the removal of an outer CCB.
+   * \param f The face that owns the outer CCB.
+   * \param h A circulator representing the boundary of the component.
+   */
+  virtual void before_remove_outer_ccb(Face_handle /* f */,
+                                       Ccb_halfedge_circulator /* h */)
+  {}
+
+  /*! Notificaion after the removal of an outer CCB.
+   * \param f The face that used to own the outer CCB.
+   */
+  virtual void after_remove_outer_ccb(Face_handle /* f */) {}
+
+  /*! Notification before the removal of an inner CCB.
+   * \param f The face containing the inner CCB.
+   * \param h A circulator representing the boundary of the component.
+   */
+  virtual void before_remove_inner_ccb(Face_handle /* f */,
+                                       Ccb_halfedge_circulator /* h */)
+  {}
+
+  /*! Notificaion after the removal of an inner CCB.
+   * \param f The face that used to contain the inner CCB.
+   */
+  virtual void after_remove_inner_ccb(Face_handle /* f */) {}
+
+  //@}
+};
+
+} //namespace CGAL
+
+#include <CGAL/enable_warnings.h>
+
+#endif
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_observer.h b/Arrangement_on_surface_2/include/CGAL/Arr_observer.h
index c622bbe1a325..092a1b55732a 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_observer.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_observer.h
@@ -1,4 +1,4 @@
-// Copyright (c) 2006,2007,2009,2010,2011 Tel-Aviv University (Israel).
+// Copyright (c) 2023 Tel-Aviv University (Israel).
 // All rights reserved.
 //
 // This file is part of CGAL (www.cgal.org).
@@ -8,565 +8,25 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Ron Wein          <wein@post.tau.ac.il>
-//                 Efi Fogel            <efif@post.tau.ac.il>
+// Author(s): Efi Fogel            <efifogel@gmail.com>
 
 #ifndef CGAL_ARR_OBSERVER_H
 #define CGAL_ARR_OBSERVER_H
 
+/*! \file
+ * Definition of the Arr_observer<Arrangement> base class mainly for backward compatibility.
+ */
+
 #include <CGAL/license/Arrangement_on_surface_2.h>
 
 #include <CGAL/disable_warnings.h>
 
-#include <CGAL/Arr_enums.h>
-
-/*! \file
- * Definition of the Arr_observer<Arrangement> base class.
- */
-
 namespace CGAL {
 
-/*! \class
- * A base class for arrangement observers.
- * The Arrangement parameter corresponds to an arrangement instantiation.
- */
 template <typename Arrangement_>
-class Arr_observer
-{
-public:
-  typedef Arrangement_                                     Arrangement_2;
-  typedef Arr_observer<Arrangement_2>                      Self;
-
-  typedef typename Arrangement_2::Point_2                  Point_2;
-  typedef typename Arrangement_2::X_monotone_curve_2       X_monotone_curve_2;
-
-  typedef typename Arrangement_2::Vertex_handle            Vertex_handle;
-  typedef typename Arrangement_2::Halfedge_handle          Halfedge_handle;
-  typedef typename Arrangement_2::Face_handle              Face_handle;
-  typedef typename Arrangement_2::Ccb_halfedge_circulator
-                                                      Ccb_halfedge_circulator;
-
-private:
-  Arrangement_2* p_arr;           // The associated arrangement.
-
-  /*! Copy constructor - not supported. */
-  Arr_observer(const Self&);
-
-  /*! Assignment operator - not supported. */
-  Self& operator=(const Self&);
-
-public:
-  /// \name Construction and destruction functions.
-  //@{
-
-  /*! Default constructor. */
-  Arr_observer() : p_arr(nullptr) {}
-
-  /*! Constructor with an associated arrangement. */
-  Arr_observer(Arrangement_2& arr) : p_arr(&arr)
-  {
-    // Register the observer object in the arrangement.
-    p_arr->_register_observer(this);
-  }
-
-  /*! Destructor. */
-  virtual ~Arr_observer()
-  {
-    // Unregister the observer object from the arrangement.
-    if (p_arr != nullptr)
-      p_arr->_unregister_observer(this);
-  }
-  //@}
-
-  /// \name Modifying the associated arrangement.
-  //@{
-
-  /*! Get the associated arrangement (non-const version). */
-  const Arrangement_2* arrangement() const { return (p_arr); }
-
-  /*! Get the associated arrangement (non-const version). */
-  Arrangement_2* arrangement() { return (p_arr); }
-
-  /*! Attach the observer to an arrangement.
-   * \pre The observer is not already attached to an arrangement.
-   */
-  void attach(Arrangement_2& arr)
-  {
-    // Do nothing if the associated arrangement is not changed.
-    if (p_arr == &arr) return;
-
-    // The observer is not already attached to an arrangement.
-    CGAL_precondition (p_arr == nullptr);
-
-    if (p_arr != nullptr) return;
-
-    // Notify the concrete observer (the sub-class) about the attachment.
-    before_attach(arr);
-
-    // Register the observer object in the new arrangement.
-    p_arr = &arr;
-    p_arr->_register_observer(this);
-
-    // Notify the concrete observer that the attachment took place.
-    after_attach();
-  }
-
-  /*! Detach the observer from the arrangement. */
-  void detach()
-  {
-    if (p_arr == nullptr) return;
-
-    // Notify the concrete observer (the sub-class) about the detachment.
-    before_detach ();
-
-    // Unregister the observer object from the current arrangement, and mark
-    // that the observer is not attached to an arrangement.
-    p_arr->_unregister_observer(this);
-    p_arr = nullptr;
-
-    // Notify the concrete observer that the detachment took place.
-    after_detach();
-  }
-  //@}
-
-  /// \name Notification functions on global arrangement operations.
-  //@{
-
-  /*! Notification before the arrangement is assigned with another
-   * arrangement.
-   * \param arr The arrangement to be copied.
-   */
-  virtual void before_assign(const Arrangement_2& /* arr */) {}
-
-  /*! Notification after the arrangement has been assigned with another
-   * arrangement.
-   */
-  virtual void after_assign() {}
-
-  /*! Notification before the arrangement is cleared. */
-  virtual void before_clear() {}
-
-  /*! Notification after the arrangement is cleared. */
-  virtual void after_clear() {}
-
-  /*! Notification before a global operation modifies the arrangement. */
-  virtual void before_global_change() {}
-
-  /*! Notification after a global operation is completed. */
-  virtual void after_global_change() {}
-  //@}
-
-  /// \name Notification functions on observer attachment or detachment.
-  //@{
-
-  /*! Notification before the observer is attached to an arrangement.
-   * \param arr The arrangement we are about to attach the observer to.
-   */
-  virtual void before_attach(const Arrangement_2& /* arr */) {}
-
-  /*! Notification after the observer has been attached to an arrangement. */
-  virtual void after_attach() {}
-
-  /*! Notification before the observer is detached from the arrangement. */
-  virtual void before_detach() {}
-
-  /*! Notification after the observer has been detached to the arrangement. */
-  virtual void after_detach() {}
-  //@}
-
-  /// \name Notification functions on local changes in the arrangement.
-  //@{
-
-  /*!
-   * Notification before the creation of a new vertex.
-   * \param p The point to be associated with the vertex.
-   *          This point cannot lies on the surface boundaries.
-   */
-  virtual void before_create_vertex(const Point_2& /* p */) {}
-
-  /*! Notification after the creation of a new vertex.
-   * \param v A handle to the created vertex.
-   */
-  virtual void after_create_vertex(Vertex_handle /* v */)
-  {}
-
-  /*! Notification before the creation of a new boundary vertex.
-   * \param p The on the surface boundary.
-   * \param ps_x The boundary condition of the vertex in x.
-   * \param ps_y The boundary condition of the vertex in y.
-   */
-  virtual void before_create_boundary_vertex(const Point_2& /* p */,
-                                             Arr_parameter_space /* ps_x */,
-                                             Arr_parameter_space /* ps_y */)
-  {}
-
-  /*! Notification before the creation of a new boundary vertex.
-   * \param cv The curve incident to the surface boundary.
-   * \param ind The relevant curve-end.
-   * \param ps_x The boundary condition of the vertex in x.
-   * \param ps_y The boundary condition of the vertex in y.
-   */
-  virtual void before_create_boundary_vertex(const X_monotone_curve_2& /* cv */,
-                                             Arr_curve_end /* ind */,
-                                             Arr_parameter_space /* ps_x */,
-                                             Arr_parameter_space /* ps_y */)
-  {}
-
-  /*! Notification after the creation of a new vertex at infinity.
-   * \param v A handle to the created vertex.
-   */
-  virtual void after_create_boundary_vertex(Vertex_handle /* v */) {}
-
-  /*! Notification before the creation of a new edge.
-   * \param c The x-monotone curve to be associated with the edge.
-   * \param v1 A handle to the first end-vertex of the edge.
-   * \param v2 A handle to the second end-vertex of the edge.
-   */
-  virtual void before_create_edge(const X_monotone_curve_2& /* c */,
-                                  Vertex_handle /* v1 */,
-                                  Vertex_handle /* v2 */)
-  {}
-
-  /*! Notification after the creation of a new edge.
-   * \param e A handle to one of the twin halfedges that were created.
-   */
-  virtual void after_create_edge(Halfedge_handle /* e */) {}
-
-  /*! Notification before the modification of an existing vertex.
-   * \param v A handle to the vertex to be updated.
-   * \param p The point to be associated with the vertex.
-   */
-  virtual void before_modify_vertex(Vertex_handle /* v */,
-                                    const Point_2& /* p */)
-  {}
-
-  /*! Notification after a vertex was modified.
-   * \param v A handle to the updated vertex.
-   */
-  virtual void after_modify_vertex(Vertex_handle /* v */) {}
-
-  /*! Notification before the modification of an existing edge.
-   * \param e A handle to one of the twin halfedges to be updated.
-   * \param c The x-monotone curve to be associated with the edge.
-   */
-  virtual void before_modify_edge(Halfedge_handle /* e */,
-                                  const X_monotone_curve_2& /* c */)
-  {}
-
-  /*! Notification after an edge was modified.
-   * \param e A handle to one of the twin halfedges that were updated.
-   */
-  virtual void after_modify_edge(Halfedge_handle /* e */) {}
-
-  /*! Notification before the splitting of an edge into two.
-   * \param e A handle to one of the existing halfedges.
-   * \param v A vertex representing the split point.
-   * \param c1 The x-monotone curve to be associated with the first edge.
-   * \param c2 The x-monotone curve to be associated with the second edge.
-   */
-  virtual void before_split_edge(Halfedge_handle /* e */,
-                                 Vertex_handle /* v */,
-                                 const X_monotone_curve_2& /* c1 */,
-                                 const X_monotone_curve_2& /* c2 */)
-  {}
-
-  /*! Notification after an edge was split.
-   * \param e1 A handle to one of the twin halfedges forming the first edge.
-   * \param e2 A handle to one of the twin halfedges forming the second edge.
-   */
-  virtual void after_split_edge(Halfedge_handle /* e1 */,
-                                Halfedge_handle /* e2 */)
-  {}
-
-  /*! Notification before the splitting of a fictitious edge into two.
-   * \param e A handle to one of the existing halfedges.
-   * \param v A vertex representing the unbounded split point.
-   */
-  virtual void before_split_fictitious_edge(Halfedge_handle /* e */,
-                                            Vertex_handle /* v */)
-  {}
-
-  /*! Notification after a fictitious edge was split.
-   * \param e1 A handle to one of the twin halfedges forming the first edge.
-   * \param e2 A handle to one of the twin halfedges forming the second edge.
-   */
-  virtual void after_split_fictitious_edge(Halfedge_handle /* e1 */,
-                                           Halfedge_handle /* e2 */)
-  {}
-
-  /*! Notification before the splitting of a face into two.
-   * \param f A handle to the existing face.
-   * \param e The new edge whose insertion causes the face to split.
-   */
-  virtual void before_split_face(Face_handle /* f */,
-                                 Halfedge_handle /* e */)
-  {}
-
-  /*! Notification after a face was split.
-   * \param f A handle to the face we have just split.
-   * \param new_f A handle to the new face that has been created.
-   * \param is_hole Whether the new face forms a hole inside f.
-   */
-  virtual void after_split_face(Face_handle /* f */,
-                                Face_handle /* new_f */,
-                                 bool /* is_hole */)
-  {}
-
-  /*! Notification before the splitting of an outer CCB into two.
-   * \param f A handle to the face that owns the outer CCB.
-   * \param h A circulator representing the component boundary.
-   * \param e The new edge whose removal causes the outer CCB to split.
-   */
-  virtual void before_split_outer_ccb(Face_handle /* f */,
-                                      Ccb_halfedge_circulator /* h */,
-                                      Halfedge_handle /* e */)
-  {}
-
-  /*! Notification after an outer CCB was split.
-   * \param f A handle to the face that owns the outer CCBs.
-   * \param h1 A circulator representing the boundary of the first component.
-   * \param h2 A circulator representing the boundary of the second component.
-   */
-  virtual void after_split_outer_ccb(Face_handle /* f */,
-                                     Ccb_halfedge_circulator /* h1 */,
-                                     Ccb_halfedge_circulator /* h2 */)
-  {}
-
-  /*! Notification before the splitting of an inner CCB into two.
-   * \param f A handle to the face containing the inner CCB.
-   * \param h A circulator representing the component boundary.
-   * \param e The new edge whose removal causes the inner CCB to split.
-   */
-  virtual void before_split_inner_ccb(Face_handle /* f */,
-                                      Ccb_halfedge_circulator /* h */,
-                                      Halfedge_handle /* e */)
-  {}
-
-  /*! Notification after an inner CCB was split.
-   * \param f A handle to the face containing the inner CCBs.
-   * \param h1 A circulator representing the boundary of the first component.
-   * \param h2 A circulator representing the boundary of the second component.
-   */
-  virtual void after_split_inner_ccb(Face_handle /* f */,
-                                     Ccb_halfedge_circulator /* h1 */,
-                                     Ccb_halfedge_circulator /* h2 */)
-  {}
-
-  /*! Notification before the creation of a new outer CCB of a face.
-   * \param f A handle to the face that owns the outer CCB.
-   * \param e A halfedge along the new outer CCB.
-   */
-  virtual void before_add_outer_ccb(Face_handle /* f */,
-                                    Halfedge_handle /* e */)
-  {}
-
-  /*! Notification after an outer CCB was added to a face.
-   * \param h A circulator representing the boundary of the new outer CCB.
-   */
-  virtual void after_add_outer_ccb(Ccb_halfedge_circulator /* h */) {}
-
-  /*! Notification before the creation of a new inner CCB inside a face.
-   * \param f A handle to the face containing the inner CCB.
-   * \param e The new halfedge that forms the new inner CCB.
-   */
-  virtual void before_add_inner_ccb(Face_handle /* f */,
-                                    Halfedge_handle /* e */)
-  {}
-
-  /*! Notification after an inner CCB was created inside a face.
-   * \param h A circulator representing the boundary of the new inner CCB.
-   */
-  virtual void after_add_inner_ccb(Ccb_halfedge_circulator /* h */) {}
-
-  /*! Notification before the creation of a new isolated vertex inside a face.
-   * \param f A handle to the face containing the isolated vertex.
-   * \param v The isolated vertex.
-   */
-  virtual void before_add_isolated_vertex(Face_handle /* f */,
-                                          Vertex_handle /* v */)
-  {}
-
-  /*! Notification after an isolated vertex was created inside a face.
-   * \param v The isolated vertex.
-   */
-  virtual void after_add_isolated_vertex(Vertex_handle /* v */) {}
-
-  /*! Notification before the merging of two edges.
-   * \param e1 A handle to one of the halfedges forming the first edge.
-   * \param e2 A handle to one of the halfedges forming the second edge.
-   * \param c The x-monotone curve to be associated with the merged edge.
-   */
-  virtual void before_merge_edge(Halfedge_handle /* e1 */,
-                                 Halfedge_handle /* e2 */,
-                                 const X_monotone_curve_2& /* c */)
-  {}
-
-  /*! Notification after an edge was merged.
-   * \param e A handle to one of the twin halfedges forming the merged edge.
-   */
-  virtual void after_merge_edge(Halfedge_handle /* e */) {}
-
-  /*! Notification before the merging of two fictitious edges.
-   * \param e1 A handle to one of the halfedges forming the first edge.
-   * \param e2 A handle to one of the halfedges forming the second edge.
-   */
-  virtual void before_merge_fictitious_edge(Halfedge_handle /* e1 */,
-                                            Halfedge_handle /* e2 */)
-  {}
-
-  /*! Notification after a fictitious edge was merged.
-   * \param e A handle to one of the twin halfedges forming the merged edge.
-   */
-  virtual void after_merge_fictitious_edge(Halfedge_handle /* e */) {}
-
-  /*! Notification before the merging of two faces.
-   * \param f1 A handle to the first face.
-   * \param f2 A handle to the second face.
-   * \param e The edge whose removal causes the faces to merge.
-   */
-  virtual void before_merge_face(Face_handle /* f1 */,
-                                 Face_handle /* f2 */,
-                                 Halfedge_handle /* e */)
-  {}
-
-  /*! Notification after a face was merged.
-   * \param f A handle to the merged face.
-   */
-  virtual void after_merge_face(Face_handle /* f */) {}
-
-  /*! Notification before the merging of two outer CCBs.
-   * \param f A handle to the face that owns the outer CCBs.
-   * \param h1 A circulator representing the boundary of the first component.
-   * \param h2 A circulator representing the boundary of the second component.
-   * \param e The edge whose insertion or removal causes the CCBs to merge.
-   */
-  virtual void before_merge_outer_ccb(Face_handle /* f */,
-                                      Ccb_halfedge_circulator /* h1 */,
-                                      Ccb_halfedge_circulator /* h2 */,
-                                      Halfedge_handle /* e */)
-  {}
-
-  /*! Notification after an outer CCB was merged.
-   * \param f A handle to the face that owns the outer CCBs.
-   * \param h A circulator representing the boundary of the merged component.
-   */
-  virtual void after_merge_outer_ccb(Face_handle /* f */,
-                                     Ccb_halfedge_circulator /* h */)
-  {}
-
-  /*! Notification before the merging of two inner CCBs (holes).
-   * \param f A handle to the face that contains the inner CCBs.
-   * \param h1 A circulator representing the boundary of the first component.
-   * \param h2 A circulator representing the boundary of the second component.
-   * \param e The edge whose insertion causes the inner CCBs to merge.
-   */
-  virtual void before_merge_inner_ccb(Face_handle /* f */,
-                                      Ccb_halfedge_circulator /* h1 */,
-                                      Ccb_halfedge_circulator /* h2 */,
-                                      Halfedge_handle /* e */)
-  {}
-
-  /*! Notification after an inner CCB was merged.
-   * \param f A handle to the face that contains the inner CCBs.
-   * \param h A circulator representing the boundary of the merged component.
-   */
-  virtual void after_merge_inner_ccb(Face_handle /* f */,
-                                     Ccb_halfedge_circulator /* h */)
-  {}
-
-  /*! Notification before an outer CCB is moved from one face to another.
-   * \param from_f A handle to the face that currently owns the outer CCB.
-   * \param to_f A handle to the face that should own the outer CCB.
-   * \param h A circulator representing the boundary of the component.
-   */
-  virtual void before_move_outer_ccb(Face_handle /* from_f */,
-                                     Face_handle /* to_f */,
-                                     Ccb_halfedge_circulator /* h */)
-  {}
-
-  /*! Notification after an outer CCB is moved from one face to another.
-   * \param h A circulator representing the boundary of the component.
-   */
-  virtual void after_move_outer_ccb(Ccb_halfedge_circulator /* h */) {}
-
-
-  /*! Notification before an inner CCB is moved from one face to another.
-   * \param from_f A handle to the face currently containing the inner CCB.
-   * \param to_f A handle to the face that should contain the inner CCB.
-   * \param h A circulator representing the boundary of the component.
-   */
-  virtual void before_move_inner_ccb(Face_handle /* from_f */,
-                                     Face_handle /* to_f */,
-                                     Ccb_halfedge_circulator /* h */)
-  {}
-
-  /*!
-   * Notification after an inner CCB is moved from one face to another.
-   * \param h A circulator representing the boundary of the component.
-   */
-  virtual void after_move_inner_ccb(Ccb_halfedge_circulator /* h */) {}
-
-  /*! Notification before an isolated vertex is moved from one face to another.
-   * \param from_f A handle to the face currently containing the vertex.
-   * \param to_f A handle to the face that should contain the vertex.
-   * \param v The isolated vertex.
-   */
-  virtual void before_move_isolated_vertex(Face_handle /* from_f */,
-                                           Face_handle /* to_f */,
-                                           Vertex_handle /* v */)
-  {}
-
-  /*! Notification after an isolated vertex is moved from one face to another.
-   * \param v The isolated vertex.
-   */
-  virtual void after_move_isolated_vertex(Vertex_handle /* v */) {}
-
-  /*! Notificaion before the removal of a vertex.
-   * \param v A handle to the vertex to be deleted.
-   */
-  virtual void before_remove_vertex(Vertex_handle /* v */) {}
-
-  /*! Notificaion after the removal of a vertex. */
-  virtual void after_remove_vertex() {}
-
-  /*! Notification before the removal of an edge.
-   * \param e A handle to one of the twin halfedges to be deleted.
-   */
-  virtual void before_remove_edge(Halfedge_handle /* e */) {}
-
-  /*! Notificaion after the removal of an edge. */
-  virtual void after_remove_edge() {}
-
-  /*! Notification before the removal of an outer CCB.
-   * \param f The face that owns the outer CCB.
-   * \param h A circulator representing the boundary of the component.
-   */
-  virtual void before_remove_outer_ccb(Face_handle /* f */,
-                                       Ccb_halfedge_circulator /* h */)
-  {}
-
-  /*! Notificaion after the removal of an outer CCB.
-   * \param f The face that used to own the outer CCB.
-   */
-  virtual void after_remove_outer_ccb(Face_handle /* f */) {}
-
-  /*! Notification before the removal of an inner CCB.
-   * \param f The face containing the inner CCB.
-   * \param h A circulator representing the boundary of the component.
-   */
-  virtual void before_remove_inner_ccb(Face_handle /* f */,
-                                       Ccb_halfedge_circulator /* h */)
-  {}
-
-  /*! Notificaion after the removal of an inner CCB.
-   * \param f The face that used to contain the inner CCB.
-   */
-  virtual void after_remove_inner_ccb(Face_handle /* f */) {}
-
-  //@}
-};
+using Arr_observer = typename Arrangement_::Observer;
 
-} //namespace CGAL
+} // namespace CGAL
 
 #include <CGAL/enable_warnings.h>
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h
index 98e0f1742fd2..91ac2394e392 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h
@@ -21,7 +21,6 @@
  * Definition of the Arr_triangulation_point_location<Arrangement> template.
  */
 
-#include <CGAL/Arr_observer.h>
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 #include <CGAL/Arr_point_location_result.h>
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
index f99be868ac05..108600caec2f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
@@ -40,7 +40,7 @@
 #include <CGAL/Arrangement_2/Arrangement_2_iterators.h>
 #include <CGAL/In_place_list.h>
 #include <CGAL/Arr_default_dcel.h>
-#include <CGAL/Arr_observer.h>
+#include <CGAL/Aos_observer.h>
 #include <CGAL/Arr_accessor.h>
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 #include <CGAL/function_objects.h>
@@ -109,10 +109,10 @@ class Arrangement_on_surface_2 {
   typedef typename Topology_traits::Dcel            Dcel;
   typedef typename Dcel::Size                       Size;
 
-  typedef Arr_observer<Self>                        Observer;
+  typedef Aos_observer<Self>                        Observer;
 
 protected:
-  friend class Arr_observer<Self>;
+  friend class Aos_observer<Self>;
   friend class Arr_accessor<Self>;
 
   // Internal DCEL types:
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
index ad1413f9f1c0..6b59905c8d7c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
@@ -272,7 +272,7 @@ class Arrangement_on_surface_with_history_2 :
    * involving edges and updates the list of halfedges associated with the
    * input curves accordingly.
    */
-  class Curve_halfedges_observer : public Arr_observer<Base_arr_2> {
+  class Curve_halfedges_observer : public Base_arr_2::Observer {
   public:
 
     typedef typename Base_arr_2::Halfedge_handle     Halfedge_handle;
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
index d5e118bf8d76..413559ace7ef 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
@@ -20,7 +20,6 @@
 #include <CGAL/enum.h>
 #include <CGAL/Unique_hash_map.h>
 #include <CGAL/Arr_tags.h>
-#include <CGAL/Arr_observer.h>
 #include <CGAL/Arr_accessor.h>
 #include <CGAL/Arr_walk_along_line_point_location.h>
 #include <CGAL/Arr_naive_point_location.h>
diff --git a/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h b/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h
index 72465c5c97f2..63f59bba6ec6 100644
--- a/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h
+++ b/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h
@@ -102,7 +102,7 @@ class Triangular_expansion_visibility_2 {
           : Base(const_cast<Arrangement_2&>(arr)), has_changed(false)
       {}
 
-      // Arr_observer interface
+      // Aos_observer interface
 
       void after_attach() { has_changed = false; }
 

From 6089c485a1493fb4ad2e7eda2914b4151d687ae1 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 12 Dec 2023 03:06:19 +0200
Subject: [PATCH 1154/1398] Added the description of Arr_observer

---
 .../Arrangement_on_surface_2.txt              |  6 ++--
 .../CGAL/Aos_observer.h                       |  2 +-
 .../CGAL/Arr_observer.h                       | 34 +++++--------------
 3 files changed, 13 insertions(+), 29 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index 622492d43d8a..505576d90243 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -5719,9 +5719,9 @@ its base type. An instance of `Aos_observer<>` serves as a base type
 for other observer classes and defines a set of virtual notification
 functions, with default empty implementations.  You can also use the
 template alias `Arr_observer<Arrangement_2>`, where `Arrangement_2` is
-the type of the arrangement object in case it is derived from
-`Arrangement_on_surface_2`.  The set of functions can be divided into
-three categories, as follows:
+the type of the arrangement object in case it is derived from an
+instance of the template `Arrangement_on_surface_2`.  The set of
+functions can be divided into three categories, as follows:
 
 <OL>
 
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
index 8ae211dbe5a4..5b99967ba770 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
@@ -2,7 +2,7 @@ namespace CGAL {
 
 /*! \ingroup PkgArrangementOnSurface2Ref
  *
- * \anchor arr_refarr_obs
+ * \anchor arr_refaos_obs
  *
  * `Aos_observer` serves as an abstract base class for all observer classes that
  * are attached to an arrangement instance of type `Arrangement` and receive
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
index 092a1b55732a..d3870fc69ea8 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
@@ -1,33 +1,17 @@
 // Copyright (c) 2023 Tel-Aviv University (Israel).
-// All rights reserved.
-//
-// This file is part of CGAL (www.cgal.org).
-//
-// $URL$
-// $Id$
-// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
-//
-//
-// Author(s): Efi Fogel            <efifogel@gmail.com>
-
-#ifndef CGAL_ARR_OBSERVER_H
-#define CGAL_ARR_OBSERVER_H
+namespace CGAL {
 
-/*! \file
- * Definition of the Arr_observer<Arrangement> base class mainly for backward compatibility.
+/*! \ingroup PkgArrangementOnSurface2Ref
+ *
+ * \anchor arr_refarr_obs
+ *
+ * `Arr_observer<Arrangement_2>` is an alias for Aos_observer<Arrangement_on_surface_2>`,
+ * where `Arrangement_2` derives from `Arrangement_on_surface_2` and the latter is an
+ * instance of the template
+ * `CGAL::Arrangement_on_surface_2<GeometryTraits, TopologyTraits>`.
  */
 
-#include <CGAL/license/Arrangement_on_surface_2.h>
-
-#include <CGAL/disable_warnings.h>
-
-namespace CGAL {
-
 template <typename Arrangement_>
 using Arr_observer = typename Arrangement_::Observer;
 
 } // namespace CGAL
-
-#include <CGAL/enable_warnings.h>
-
-#endif

From 81972df60e11ff4fd4455177a89cf9f8041b80e2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 12 Dec 2023 09:39:35 +0100
Subject: [PATCH 1155/1398] Add a convenience IO header

---
 BGL/examples/BGL_LCC/distance_lcc.cpp            |  2 +-
 BGL/examples/BGL_LCC/incident_vertices_lcc.cpp   |  2 +-
 BGL/examples/BGL_LCC/normals_lcc.cpp             |  2 +-
 BGL/examples/BGL_LCC/range_lcc.cpp               |  2 +-
 BGL/examples/BGL_LCC/transform_iterator_lcc.cpp  |  2 +-
 BGL/examples/BGL_OpenMesh/TriMesh.cpp            |  2 +-
 .../BGL_surface_mesh/surface_mesh_partition.cpp  |  2 +-
 BGL/include/CGAL/IO/polygon_mesh_io.h            | 16 ++++++++++++++++
 .../cc_compatible_orientations.cpp               |  2 +-
 .../examples/Polygon_mesh_processing/extrude.cpp |  2 +-
 .../Polygon_mesh_processing/IO/polygon_mesh_io.h |  2 +-
 .../orient_polygon_soup_test.cpp                 |  2 +-
 .../examples/Ridges_3/Ridges_Umbilics_LCC.cpp    |  2 +-
 .../region_growing_lines_on_segment_set.cpp      |  2 +-
 .../region_growing_planes_on_polygon_mesh.cpp    |  2 +-
 .../Straight_skeleton_2/extrude_skeleton.cpp     |  2 +-
 .../test_sls_extrude.cpp                         |  2 +-
 .../edge_collapse_garland_heckbert.cpp           |  2 +-
 .../edge_collapse_linear_cell_complex.cpp        |  2 +-
 .../test_edge_collapse_stability.cpp             |  2 +-
 .../test_edge_deprecated_stop_predicates.cpp     |  2 +-
 .../MCF_Skeleton_LCC_example.cpp                 |  2 +-
 .../simple_mcfskel_LCC_example.cpp               |  2 +-
 23 files changed, 38 insertions(+), 22 deletions(-)
 create mode 100644 BGL/include/CGAL/IO/polygon_mesh_io.h

diff --git a/BGL/examples/BGL_LCC/distance_lcc.cpp b/BGL/examples/BGL_LCC/distance_lcc.cpp
index 9e60c5bfb297..b19f0ab2b384 100644
--- a/BGL/examples/BGL_LCC/distance_lcc.cpp
+++ b/BGL/examples/BGL_LCC/distance_lcc.cpp
@@ -1,7 +1,7 @@
 #include <CGAL/Simple_cartesian.h>
 
 #include <CGAL/boost/graph/graph_traits_Linear_cell_complex_for_combinatorial_map.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 #include <CGAL/boost/graph/breadth_first_search.h> // wrapper to suppress a warning
 
diff --git a/BGL/examples/BGL_LCC/incident_vertices_lcc.cpp b/BGL/examples/BGL_LCC/incident_vertices_lcc.cpp
index f2b66d46ca03..af02d72a81b1 100644
--- a/BGL/examples/BGL_LCC/incident_vertices_lcc.cpp
+++ b/BGL/examples/BGL_LCC/incident_vertices_lcc.cpp
@@ -2,7 +2,7 @@
 
 #include <CGAL/boost/graph/graph_traits_Linear_cell_complex_for_combinatorial_map.h>
 #include <CGAL/boost/graph/iterator.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 #include <iostream>
 #include <fstream>
diff --git a/BGL/examples/BGL_LCC/normals_lcc.cpp b/BGL/examples/BGL_LCC/normals_lcc.cpp
index da1177a70624..b729b0b4792e 100644
--- a/BGL/examples/BGL_LCC/normals_lcc.cpp
+++ b/BGL/examples/BGL_LCC/normals_lcc.cpp
@@ -1,7 +1,7 @@
 #include <CGAL/Simple_cartesian.h>
 
 #include <CGAL/boost/graph/graph_traits_Linear_cell_complex_for_combinatorial_map.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 #include <CGAL/property_map.h>
 
 #include <boost/graph/graph_traits.hpp>
diff --git a/BGL/examples/BGL_LCC/range_lcc.cpp b/BGL/examples/BGL_LCC/range_lcc.cpp
index 02a28d869a0c..cdf89714c30f 100644
--- a/BGL/examples/BGL_LCC/range_lcc.cpp
+++ b/BGL/examples/BGL_LCC/range_lcc.cpp
@@ -2,7 +2,7 @@
 
 #include <CGAL/Iterator_range.h>
 #include <CGAL/boost/graph/graph_traits_Linear_cell_complex_for_combinatorial_map.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 #include <iostream>
 #include <fstream>
diff --git a/BGL/examples/BGL_LCC/transform_iterator_lcc.cpp b/BGL/examples/BGL_LCC/transform_iterator_lcc.cpp
index 0bfc08914376..988c0230bae2 100644
--- a/BGL/examples/BGL_LCC/transform_iterator_lcc.cpp
+++ b/BGL/examples/BGL_LCC/transform_iterator_lcc.cpp
@@ -3,7 +3,7 @@
 #include <CGAL/boost/graph/graph_traits_Linear_cell_complex_for_combinatorial_map.h>
 #include <CGAL/boost/graph/iterator.h>
 #include <CGAL/boost/iterator/transform_iterator.hpp>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 #include <algorithm>
 #include <fstream>
diff --git a/BGL/examples/BGL_OpenMesh/TriMesh.cpp b/BGL/examples/BGL_OpenMesh/TriMesh.cpp
index 0f30d0c10a52..e474020cc67e 100644
--- a/BGL/examples/BGL_OpenMesh/TriMesh.cpp
+++ b/BGL/examples/BGL_OpenMesh/TriMesh.cpp
@@ -6,7 +6,7 @@
 #include <CGAL/boost/graph/graph_traits_TriMesh_ArrayKernelT.h>
 #include <CGAL/boost/graph/iterator.h>
 #include <CGAL/boost/graph/Euler_operations.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 #include <CGAL/mesh_segmentation.h>
 #include <CGAL/property_map.h>
 
diff --git a/BGL/examples/BGL_surface_mesh/surface_mesh_partition.cpp b/BGL/examples/BGL_surface_mesh/surface_mesh_partition.cpp
index 57c96a907d8d..1f57a67524f4 100644
--- a/BGL/examples/BGL_surface_mesh/surface_mesh_partition.cpp
+++ b/BGL/examples/BGL_surface_mesh/surface_mesh_partition.cpp
@@ -3,7 +3,7 @@
 
 #include <CGAL/boost/graph/Face_filtered_graph.h>
 #include <CGAL/boost/graph/partition.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 #include <fstream>
 #include <iostream>
diff --git a/BGL/include/CGAL/IO/polygon_mesh_io.h b/BGL/include/CGAL/IO/polygon_mesh_io.h
new file mode 100644
index 000000000000..0dce62b6a37d
--- /dev/null
+++ b/BGL/include/CGAL/IO/polygon_mesh_io.h
@@ -0,0 +1,16 @@
+// Copyright (c) 2023  GeometryFactory (France).  All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s)     : Mael Rouxel-Labbé
+
+#ifndef CGAL_BOOST_GRAPH_POLYGON_MESH_IO_H
+#define CGAL_BOOST_GRAPH_POLYGON_MESH_IO_H
+
+#include <CGAL/boost/graph/io.h>
+
+#endif // CGAL_BOOST_GRAPH_POLYGON_MESH_IO_H
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/cc_compatible_orientations.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/cc_compatible_orientations.cpp
index 8a47239c5aa5..646e94e9468c 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/cc_compatible_orientations.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/cc_compatible_orientations.cpp
@@ -4,7 +4,7 @@
 #include <CGAL/Polygon_mesh_processing/orientation.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
 #include <CGAL/Polygon_mesh_processing/stitch_borders.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 #include <iostream>
 #include <string>
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/extrude.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/extrude.cpp
index baaa0612452d..300d0182fdb3 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/extrude.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/extrude.cpp
@@ -2,7 +2,7 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Polygon_mesh_processing/compute_normal.h>
 #include <CGAL/Polygon_mesh_processing/extrude.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 #include <iostream>
 #include <fstream>
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h
index f2d93e83f01b..21600e50bfff 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h
@@ -21,7 +21,7 @@
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
 #include <CGAL/Polygon_mesh_processing/repair_polygon_soup.h>
 
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/boost/graph/named_params_helper.h>
 #include <CGAL/IO/polygon_soup_io.h>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_soup_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_soup_test.cpp
index 02b5e000a5e9..f3c541ab65ca 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_soup_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_soup_test.cpp
@@ -5,7 +5,7 @@
 #include <CGAL/Surface_mesh.h>
 
 #include <CGAL/Cartesian_converter.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 #include <CGAL/IO/polygon_soup_io.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
 #include <CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h>
diff --git a/Ridges_3/examples/Ridges_3/Ridges_Umbilics_LCC.cpp b/Ridges_3/examples/Ridges_3/Ridges_Umbilics_LCC.cpp
index 5373ac5e3761..611be7e6c0bf 100644
--- a/Ridges_3/examples/Ridges_3/Ridges_Umbilics_LCC.cpp
+++ b/Ridges_3/examples/Ridges_3/Ridges_Umbilics_LCC.cpp
@@ -9,7 +9,7 @@
 #include <CGAL/Monge_via_jet_fitting.h>
 #include <fstream>
 #include <cassert>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 #include <boost/program_options.hpp>
 namespace po = boost::program_options;
diff --git a/Shape_detection/examples/Shape_detection/region_growing_lines_on_segment_set.cpp b/Shape_detection/examples/Shape_detection/region_growing_lines_on_segment_set.cpp
index c283a4652fe3..270f53d3bda0 100644
--- a/Shape_detection/examples/Shape_detection/region_growing_lines_on_segment_set.cpp
+++ b/Shape_detection/examples/Shape_detection/region_growing_lines_on_segment_set.cpp
@@ -4,7 +4,7 @@
 #include <CGAL/Shape_detection/Region_growing/Segment_set.h>
 #include <CGAL/Shape_detection/Region_growing/Polygon_mesh.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 #include "include/utils.h"
 
 // Typedefs.
diff --git a/Shape_detection/examples/Shape_detection/region_growing_planes_on_polygon_mesh.cpp b/Shape_detection/examples/Shape_detection/region_growing_planes_on_polygon_mesh.cpp
index 37245edcd9d3..43d7b5b291ae 100644
--- a/Shape_detection/examples/Shape_detection/region_growing_planes_on_polygon_mesh.cpp
+++ b/Shape_detection/examples/Shape_detection/region_growing_planes_on_polygon_mesh.cpp
@@ -6,7 +6,7 @@
 #endif
 #include <CGAL/Shape_detection/Region_growing/Region_growing.h>
 #include <CGAL/Shape_detection/Region_growing/Polygon_mesh.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 #include "include/utils.h"
 
 // Typedefs.
diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp
index a50f2efc4da4..cc73aa7493b5 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp
@@ -9,7 +9,7 @@
 #include "CGAL/input_helpers.h" // polygon reading, random polygon with weights generation
 #include <CGAL/extrude_skeleton.h>
 
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/Real_timer.h>
 #include <CGAL/Random.h>
diff --git a/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/test_sls_extrude.cpp b/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/test_sls_extrude.cpp
index eaa971ce880c..d6f68604517c 100644
--- a/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/test_sls_extrude.cpp
+++ b/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/test_sls_extrude.cpp
@@ -6,7 +6,7 @@
 #include <CGAL/extrude_skeleton.h>
 
 #include <CGAL/Polygon_mesh_processing/measure.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 namespace PMP = ::CGAL::Polygon_mesh_processing;
 
diff --git a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_garland_heckbert.cpp b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_garland_heckbert.cpp
index 365fc39d2671..7d2f9500b5db 100644
--- a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_garland_heckbert.cpp
+++ b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_garland_heckbert.cpp
@@ -6,7 +6,7 @@
 #include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/GarlandHeckbert_policies.h>
 #include <CGAL/Surface_mesh_simplification/edge_collapse.h>
 
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 #include <chrono>
 #include <fstream>
diff --git a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_linear_cell_complex.cpp b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_linear_cell_complex.cpp
index 4bedf34619a1..19105b1833b7 100644
--- a/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_linear_cell_complex.cpp
+++ b/Surface_mesh_simplification/examples/Surface_mesh_simplification/edge_collapse_linear_cell_complex.cpp
@@ -8,7 +8,7 @@
 #include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Edge_length_cost.h>
 #include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Midpoint_placement.h>
 
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 #include <iostream>
 #include <fstream>
diff --git a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp
index 1a6a2786c6db..6566b233e610 100644
--- a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp
+++ b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_collapse_stability.cpp
@@ -7,7 +7,7 @@
 #include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_cost.h>
 #include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/LindstromTurk_placement.h>
 
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 
 //bbox
 #include <CGAL/Polygon_mesh_processing/bbox.h>
diff --git a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_deprecated_stop_predicates.cpp b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_deprecated_stop_predicates.cpp
index 238a796eb033..5a898efb4df9 100644
--- a/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_deprecated_stop_predicates.cpp
+++ b/Surface_mesh_simplification/test/Surface_mesh_simplification/test_edge_deprecated_stop_predicates.cpp
@@ -17,7 +17,7 @@
 #include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_stop_predicate.h>
 #include <CGAL/Surface_mesh_simplification/Policies/Edge_collapse/Count_ratio_stop_predicate.h>
 
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 #include <CGAL/boost/graph/internal/helpers.h>
 
 #include <iostream>
diff --git a/Surface_mesh_skeletonization/examples/Surface_mesh_skeletonization/MCF_Skeleton_LCC_example.cpp b/Surface_mesh_skeletonization/examples/Surface_mesh_skeletonization/MCF_Skeleton_LCC_example.cpp
index bc2455499ad8..dd62887970c7 100644
--- a/Surface_mesh_skeletonization/examples/Surface_mesh_skeletonization/MCF_Skeleton_LCC_example.cpp
+++ b/Surface_mesh_skeletonization/examples/Surface_mesh_skeletonization/MCF_Skeleton_LCC_example.cpp
@@ -2,7 +2,7 @@
 #include <CGAL/Linear_cell_complex_for_combinatorial_map.h>
 
 #include <CGAL/boost/graph/graph_traits_Linear_cell_complex_for_combinatorial_map.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 #include <CGAL/Mean_curvature_flow_skeletonization.h>
 
 #include <fstream>
diff --git a/Surface_mesh_skeletonization/examples/Surface_mesh_skeletonization/simple_mcfskel_LCC_example.cpp b/Surface_mesh_skeletonization/examples/Surface_mesh_skeletonization/simple_mcfskel_LCC_example.cpp
index 522ce16fb445..83f07c3d25da 100644
--- a/Surface_mesh_skeletonization/examples/Surface_mesh_skeletonization/simple_mcfskel_LCC_example.cpp
+++ b/Surface_mesh_skeletonization/examples/Surface_mesh_skeletonization/simple_mcfskel_LCC_example.cpp
@@ -3,7 +3,7 @@
 #include <CGAL/boost/graph/graph_traits_Linear_cell_complex_for_combinatorial_map.h>
 #include <CGAL/boost/graph/properties_Linear_cell_complex_for_combinatorial_map.h>
 #include <CGAL/boost/graph/split_graph_into_polylines.h>
-#include <CGAL/boost/graph/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_mesh_io.h>
 #include <CGAL/extract_mean_curvature_flow_skeleton.h>
 
 #include <fstream>

From 07acb78d302fcad1e4f1264f0a7d7233695f3b2f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 12 Dec 2023 09:41:44 +0100
Subject: [PATCH 1156/1398] add tests for autoref

---
 .../Polygon_mesh_processing/autorefinement.h  |  34 ++++--
 .../Polygon_mesh_processing/CMakeLists.txt    |   1 +
 .../test_autorefinement.cmd                   |  56 +++++-----
 .../test_autorefinement.cpp                   | 103 +++++++++++++++---
 4 files changed, 144 insertions(+), 50 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 05d05637b16a..b2d8427875c7 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -46,7 +46,7 @@
 #include <tbb/concurrent_vector.h>
 #if TBB_INTERFACE_VERSION < 12010 && !defined(TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS)
 #define CGAL_HAS_DEFINED_TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS
-#define TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS
+#define TBB_PREVIEW_CONCURRENT_ORDERED_CONTAINERS 1
 #endif
 #include <tbb/concurrent_map.h>
 #include <tbb/parallel_for.h>
@@ -857,7 +857,16 @@ void autorefine_triangle_soup(PointRange& soup_points,
   CGAL_PMP_AUTOREFINE_VERBOSE("collect intersecting pairs");
   triangle_soup_self_intersections<Concurrency_tag>(soup_points, soup_triangles, std::back_inserter(si_pairs), np);
 
-  if (si_pairs.empty()) return;
+  if (si_pairs.empty())
+  {
+    if constexpr (!std::is_same_v<Autorefinement::Default_visitor, Visitor>)
+    {
+      visitor.number_of_output_triangles(soup_triangles.size());
+      for(std::size_t i=0; i<soup_triangles.size(); ++i)
+        visitor.verbatim_triangle_copy(i, i);
+    }
+    return;
+  }
 
   // mark degenerate faces so that we can ignore them
   std::vector<bool> is_degen(soup_triangles.size(), false);
@@ -1125,7 +1134,16 @@ void autorefine_triangle_soup(PointRange& soup_points,
   TriangleRange soup_triangles_out;
   soup_triangles_out.reserve(soup_triangles.size());
 
-  visitor.number_of_output_triangles(soup_triangles.size()+new_triangles.size());
+  if constexpr (!std::is_same_v<Autorefinement::Default_visitor, Visitor>)
+  {
+    std::size_t nbt=0;
+    for (Input_TID f=0; f<soup_triangles.size(); ++f)
+    {
+      int tiid = tri_inter_ids[f];
+      if (tiid == -1) ++nbt;
+    }
+    visitor.number_of_output_triangles(nbt+new_triangles.size());
+  }
 
   // raw copy of input triangles with no intersection
   std::vector<std::size_t> tri_inter_ids_inverse(triangles.size());
@@ -1136,7 +1154,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
     int tiid = tri_inter_ids[f];
     if (tiid == -1)
     {
-      visitor.verbatim_triangle_copy(soup_triangles.size(), f);
+      visitor.verbatim_triangle_copy(soup_triangles_out.size(), f);
       soup_triangles_out.push_back(
         {soup_triangles[f][0], soup_triangles[f][1], soup_triangles[f][2]}
       );
@@ -1200,7 +1218,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
     soup_triangles_out.resize(offset + new_triangles.size());
     //use map iterator triple for triangles to create them concurrently and safely
-    std::vector<std::array<tbb::concurrent_map<EK::Point_3, std::size_t>::iterator, 3>> triangle_buffer(new_triangles.size());
+    std::vector<std::array<typename Point_id_map::iterator, 3>> triangle_buffer(new_triangles.size());
     tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
       [&](const tbb::blocked_range<size_t>& r) {
         for (size_t ti = r.begin(); ti != r.end(); ++ti) {
@@ -1238,10 +1256,8 @@ void autorefine_triangle_soup(PointRange& soup_points,
     std::vector<std::array<typename Point_id_map::iterator, 3>> triangle_buffer(new_triangles.size());
     tbb::parallel_for(tbb::blocked_range<size_t>(0, new_triangles.size()),
       [&](const tbb::blocked_range<size_t>& r) {
-        for (size_t ti = r.begin(); ti != r.end(); ++ti) {
-          if (offset + ti > soup_triangles_out.size()) {
-              std::cout << "ti = " << ti << std::endl;
-          }
+        for (size_t ti = r.begin(); ti != r.end(); ++ti)
+        {
           const std::array<EK::Point_3, 3>& t = new_triangles[ti].first;
           visitor.new_subtriangle(offset+ti, tri_inter_ids_inverse[new_triangles[ti].second]);
           triangle_buffer[ti] = CGAL::make_array(concurrent_get_point_id(t[0]), concurrent_get_point_id(t[1]), concurrent_get_point_id(t[2]));
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
index d9ea1a1cf37c..248831b50517 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/CMakeLists.txt
@@ -105,6 +105,7 @@ if(TARGET CGAL::TBB_support)
   target_link_libraries(test_pmp_distance PUBLIC CGAL::TBB_support)
   target_link_libraries(orient_polygon_soup_test PUBLIC CGAL::TBB_support)
   target_link_libraries(self_intersection_surface_mesh_test PUBLIC CGAL::TBB_support)
+  target_link_libraries(test_autorefinement PUBLIC CGAL::TBB_support)
 else()
   message(STATUS "NOTICE: Intel TBB was not found. Tests will use sequential code.")
 endif()
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cmd b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cmd
index a2ffe2c25393..8c848a2f1065 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cmd
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cmd
@@ -1,28 +1,28 @@
-data-autoref/test_01.off 0 0 4 1 4 0
-data-autoref/test_02.off 1 5 13 1 5 0
-data-autoref/test_03.off 4 8 18 0 18 0
-data-autoref/test_04.off 1 5 17 0 17 0
-data-autoref/test_05.off 1 5 17 0 17 0
-data-autoref/test_06.off 3 55 141 1 76 0
-data-autoref/test_07.off 1 4 10 1 4 0
-data-autoref/test_08.off 1 31 87 1 52 0
-data-autoref/test_09.off 1 4 5 1 4 0
-data-autoref/test_10.off 1 3 13 0 13 0
-data-autoref/test_11.off 1 3 12 0 12 0
-data-autoref/test_12.off 2 2 11 1 11 0
-data-autoref/test_13.off 1 5 16 1 8 0
-data-autoref/test_14.off 1 5 16 1 12 0
-data-autoref/test_15.off 3 8 16 1 12 0
-data-autoref/test_16.off 1 2 6 1 4 0
-data-autoref/test_17.off 1 2 6 1 4 0
-data-autoref/triple_inter_exception/triple.off 0 0 0 0 0 1
-data-autoref/triple_inter_exception/cubes_cpln_1.off 0 0 0 0 0 1
-data-autoref/triple_inter_exception/cubes_cpln_2.off 0 0 0 0 0 1
-data-autoref/triple_inter_exception/cubes_cpln_3.off 0 0 0 0 0 1
-data-autoref/open_01.off 1 65 1377 1 1313 0
-data-autoref/open_02.off 1 33 595 1 562 0
-data-autoref/cpln_01.off 18 42 48 1 30 0
-data-autoref/cpln_02.off 28 56 40 1 24 0
-data-autoref/cpln_03.off 15 35 42 1 27 0
-data-autoref/four_cubes.off 12 94 184 1 78 0
-data-autoref/spiral.off 7 14 26 0 26 0
+data-autoref/test_01.off 0 0 4 1 4 0 4 2
+data-autoref/test_02.off 1 5 13 1 5 0 10 17
+data-autoref/test_03.off 4 8 18 0 18 0 14 20
+data-autoref/test_04.off 1 5 17 0 17 0 13 20
+data-autoref/test_05.off 1 5 17 0 17 0 13 20
+data-autoref/test_06.off 3 55 141 1 76 0 92 248
+data-autoref/test_07.off 1 4 10 1 4 0 8 12
+data-autoref/test_08.off 1 31 87 1 52 0 57 148
+data-autoref/test_09.off 1 4 5 1 4 0 4 4
+data-autoref/test_10.off 1 3 13 0 13 0 10 13
+data-autoref/test_11.off 1 3 12 0 12 0 9 12
+data-autoref/test_12.off 2 2 11 1 11 0 9 6
+data-autoref/test_13.off 1 5 16 1 8 0 16 22
+data-autoref/test_14.off 1 5 16 1 12 0 16 22
+data-autoref/test_15.off 3 8 16 1 12 0 16 24
+data-autoref/test_16.off 1 2 6 1 4 0 6 2
+data-autoref/test_17.off 1 2 6 1 4 0 6 2
+data-autoref/triple_inter_exception/triple.off 0 0 0 0 0 1 15 18
+data-autoref/triple_inter_exception/cubes_cpln_1.off 0 0 0 0 0 1 66 224
+data-autoref/triple_inter_exception/cubes_cpln_2.off 0 0 0 0 0 1 54 196
+data-autoref/triple_inter_exception/cubes_cpln_3.off 0 0 0 0 0 1 61 204
+data-autoref/open_01.off 1 65 1377 1 1313 0 1317 2622
+data-autoref/open_02.off 1 33 595 1 562 0 565 1056
+data-autoref/cpln_01.off 18 42 48 1 30 0 30 88
+data-autoref/cpln_02.off 28 56 40 1 24 0 24 72
+data-autoref/cpln_03.off 15 35 42 1 27 0 27 76
+data-autoref/four_cubes.off 12 94 184 1 78 0 106 352
+data-autoref/spiral.off 7 14 26 0 26 0 19 31
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cpp
index 9c908d7ec245..3af3402a5f22 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cpp
@@ -3,6 +3,10 @@
 
 #include <CGAL/Polygon_mesh_processing/intersection.h>
 #include <CGAL/Polygon_mesh_processing/corefinement.h>
+#include <CGAL/Polygon_mesh_processing/autorefinement.h>
+#include <CGAL/Polygon_mesh_processing/self_intersections.h>
+
+#include <CGAL/IO/polygon_soup_io.h>
 
 #include <fstream>
 #include <sstream>
@@ -13,23 +17,64 @@ typedef CGAL::Surface_mesh<K::Point_3>             Mesh;
 namespace PMP = CGAL::Polygon_mesh_processing;
 
 template <class TriangleMesh>
-struct My_visitor :
+struct My_exp_visitor :
   public CGAL::Polygon_mesh_processing::Corefinement::Default_visitor<TriangleMesh>
 {
   void after_subface_creations(TriangleMesh&){++(*i);}
 
-  My_visitor()
+  My_exp_visitor()
     : i (new int(0) )
   {}
 
   std::shared_ptr<int> i;
 };
 
-void test(const char* fname, std::size_t nb_polylines, std::size_t total_nb_points,
-          std::size_t nb_vertices_after_autorefine, bool all_fixed, std::size_t nb_vertices_after_fix,
-          bool triple_intersection)
+struct My_visitor
 {
-  std::cout << "Running tests on " << fname << "\n";
+  My_visitor(std::size_t nb_input, std::size_t expected_nb_output)
+    : nb_input(nb_input)
+    , expected_nb_output(expected_nb_output)
+  {}
+
+  ~My_visitor()
+  {
+    for(std::size_t i=0; i<tgt_check.size(); ++i)
+    {
+      assert( tgt_check[i]==1 );
+    }
+  }
+  void number_of_output_triangles(std::size_t nbt)
+  {
+    tgt_check.assign(expected_nb_output, 0);
+    assert(nbt==expected_nb_output);
+  }
+
+  void verbatim_triangle_copy(std::size_t tgt_id, std::size_t src_id)
+  {
+    assert(src_id<nb_input);
+    assert(tgt_id<expected_nb_output);
+    assert(tgt_check.size()==expected_nb_output && tgt_check[tgt_id]==0);
+    tgt_check[tgt_id]=1;
+  }
+
+  void new_subtriangle(std::size_t tgt_id, std::size_t src_id)
+  {
+    assert(src_id<nb_input);
+    assert(tgt_id<expected_nb_output);
+    assert(tgt_check.size()==expected_nb_output && tgt_check[tgt_id]==0);
+    tgt_check[tgt_id]=1;
+  }
+
+  std::size_t nb_input;
+  std::size_t expected_nb_output;
+  std::vector<int> tgt_check;
+};
+
+void test_coref_based(const char* fname, std::size_t nb_polylines, std::size_t total_nb_points,
+                      std::size_t nb_vertices_after_autorefine, bool all_fixed, std::size_t nb_vertices_after_fix,
+                      bool triple_intersection)
+{
+  std::cout << "Running tests (coref based) on " << fname << "\n";
   std::ifstream input(fname);
 
   Mesh mesh;
@@ -41,7 +86,7 @@ void test(const char* fname, std::size_t nb_polylines, std::size_t total_nb_poin
   input.close();
   std::size_t nb_vertices_before_autorefine = num_vertices(mesh);
 
-// Testing surface_self_intersection()
+// Testing PMP::experimental::surface_self_intersection()
   try{
     std::vector< std::vector<K::Point_3> >polylines;
     PMP::experimental::surface_self_intersection(mesh, std::back_inserter(polylines));
@@ -57,9 +102,9 @@ void test(const char* fname, std::size_t nb_polylines, std::size_t total_nb_poin
     assert( triple_intersection );
   }
 
-// Testing autorefine()
+// Testing PMP::experimental::autorefine()
   try{
-    My_visitor<Mesh> visitor;
+    My_exp_visitor<Mesh> visitor;
     PMP::experimental::autorefine(mesh,
       CGAL::parameters::visitor(visitor));
     mesh.collect_garbage();
@@ -72,7 +117,7 @@ void test(const char* fname, std::size_t nb_polylines, std::size_t total_nb_poin
     assert( triple_intersection );
   }
 
-// Testing autorefine_and_remove_self_intersections()
+// Testing PMP::experimental::autorefine_and_remove_self_intersections()
   try{
     input.open(fname);
     mesh.clear();
@@ -89,10 +134,42 @@ void test(const char* fname, std::size_t nb_polylines, std::size_t total_nb_poin
   }
 }
 
+template <class Tag>
+void test(const char* fname, std::size_t nb_vertices_after_autorefine, std::size_t expected_nb_output, Tag tag)
+{
+  std::cout << "Running tests on " << fname;
+  if (std::is_same_v<Tag, CGAL::Sequential_tag>)
+    std::cout << " (Sequential)\n";
+  else
+    std::cout << " (Parallel)\n";
+
+  std::vector<K::Point_3> points;
+  std::vector< std::vector<std::size_t> > triangles;
+  if (!CGAL::IO::read_polygon_soup(fname, points, triangles))
+  {
+    std::cerr << "  Input mesh is not a valid file." << std::endl;
+    exit(EXIT_FAILURE);
+  }
+
+// Testing autorefine()
+  My_visitor visitor(triangles.size(), expected_nb_output);
+  PMP::autorefine_triangle_soup(points, triangles, CGAL::parameters::visitor(visitor).concurrency_tag(tag));
+  assert( nb_vertices_after_autorefine==points.size());
+  assert( expected_nb_output==triangles.size());
+  assert( !PMP::does_triangle_soup_self_intersect(points, triangles) );
+//  CGAL::IO::write_polygon_soup("/tmp/debug.off", points, triangles);
+}
+
 int main(int argc, const char** argv)
 {
   // file nb_polylines total_nb_points nb_vertices_after_autorefine all_fixed nb_vertices_after_fix triple_intersection
-  for (int i=0;i<(argc-1)/7; ++i)
-    test(argv[1+7*i], atoi(argv[1+7*i+1]), atoi(argv[1+7*i+2]),
-         atoi(argv[1+7*i+3]), atoi(argv[1+7*i+4])==0?false:true, atoi(argv[1+7*i+5]), atoi(argv[1+7*i+6])==0?false:true);
+  for (int i=0;i<(argc-1)/9; ++i)
+  {
+    test_coref_based(argv[1+9*i], atoi(argv[1+9*i+1]), atoi(argv[1+9*i+2]),
+                     atoi(argv[1+9*i+3]), atoi(argv[1+9*i+4])==0?false:true, atoi(argv[1+9*i+5]), atoi(argv[1+9*i+6])==0?false:true);
+    test(argv[1+9*i], atoi(argv[1+9*i+7]), atoi(argv[1+9*i+8]), CGAL::Sequential_tag());
+#ifdef CGAL_LINKED_WITH_TBB
+    test(argv[1+9*i], atoi(argv[1+9*i+7]), atoi(argv[1+9*i+8]), CGAL::Parallel_tag());
+#endif
+  }
 }

From 6ca34b62109c9d8c30a0e905330d3c3e26d1bb1f Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 12 Dec 2023 08:44:12 +0000
Subject: [PATCH 1157/1398] Add example for sampling

---
 .../Polygon_mesh_processing/CMakeLists.txt    |  1 +
 .../sample_example.cpp                        | 51 +++++++++++++++++++
 2 files changed, 52 insertions(+)
 create mode 100644 Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
index 590305c0c8ad..5adc0de4597c 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/CMakeLists.txt
@@ -7,6 +7,7 @@ project(Polygon_mesh_processing_Examples)
 # CGAL and its components
 find_package(CGAL REQUIRED)
 
+create_single_source_cgal_program("sample_example.cpp" )
 create_single_source_cgal_program("extrude.cpp" )
 create_single_source_cgal_program("polyhedral_envelope.cpp" )
 create_single_source_cgal_program("polyhedral_envelope_of_triangle_soup.cpp" )
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp
new file mode 100644
index 000000000000..474af00a16c5
--- /dev/null
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp
@@ -0,0 +1,51 @@
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Polygon_mesh_processing/distance.h>
+
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/Point_set_3.h>
+#include <iostream>
+#include <string>
+#include <vector>
+
+typedef CGAL::Exact_predicates_inexact_constructions_kernel   K;
+typedef K::Point_3                                            Point;
+
+typedef CGAL::Point_set_3<Point>                              Point_set;
+
+typedef CGAL::Surface_mesh<Point>                             Mesh;
+typedef boost::graph_traits<Mesh>::vertex_descriptor          vertex_descriptor;
+typedef boost::graph_traits<Mesh>::face_descriptor            face_descriptor;
+
+namespace PMP = CGAL::Polygon_mesh_processing;
+
+int main(int argc, char* argv[])
+{
+  const std::string filename = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/eight.off");
+
+  Mesh mesh;
+  if(!PMP::IO::read_polygon_mesh(filename, mesh))
+  {
+    std::cerr << "Invalid input." << std::endl;
+    return 1;
+  }
+
+  const double points_per_face = (argc > 2) ? atof(argv[2]) : 10;
+
+  std::vector<Point> points;
+
+  PMP::sample_triangle_mesh(mesh, std::back_inserter(points), CGAL::parameters::number_of_points_per_face(points_per_face));
+
+  std::cout.precision(17);
+  for(const Point& p : points){
+    std::cout << p << std::endl;
+  }
+
+  Point_set point_set;
+  PMP::sample_triangle_mesh(mesh,
+                            point_set.point_back_inserter(),
+                            CGAL::parameters::point_map(point_set.point_push_map()));
+
+  std::cout << point_set.number_of_points() << std::endl;
+  return 0;
+}

From 4d9476ca5ba78f05c40d2b88d954e7c86407f185 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 12 Dec 2023 08:47:47 +0000
Subject: [PATCH 1158/1398] Add example for sampling

---
 .../doc/Polygon_mesh_processing/examples.txt                    | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
index 6fdeda48ca4d..ba917e038361 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/examples.txt
@@ -46,4 +46,6 @@
 \example Polygon_mesh_processing/cc_compatible_orientations.cpp
 \example Polygon_mesh_processing/remesh_planar_patches.cpp
 \example Polygon_mesh_processing/remesh_almost_planar_patches.cpp
+\example Polygon_mesh_processing/sample_example.cpp
+*/
 */

From 796188e3510a317ab38a70d681bb66a159617f9b Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 12 Dec 2023 08:52:01 +0000
Subject: [PATCH 1159/1398] avoid intermediate vector

---
 .../Point_set_from_sampling_plugin.cpp        | 47 +++++++++++++++----
 1 file changed, 37 insertions(+), 10 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
index c654a51cd6b1..8075bb003f13 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
@@ -4,6 +4,7 @@
 #include <QMainWindow>
 #include <QMessageBox>
 #include <QtDebug>
+#include <QInputDialog>
 
 #include "Scene_points_with_normal_item.h"
 #include "Scene_surface_mesh_item.h"
@@ -69,7 +70,7 @@ void Polyhedron_demo_point_set_from_sampling_plugin::createPointSet()
   const CGAL::Three::Scene_interface::Item_id index = scene->mainSelectionIndex();
 
   Scene_points_with_normal_item* points = new Scene_points_with_normal_item();
-  std::vector<Kernel::Point_3> pts;
+
 
   if (points){
     points->setColor(Qt::blue);
@@ -80,24 +81,50 @@ void Polyhedron_demo_point_set_from_sampling_plugin::createPointSet()
     qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
 
   if (sm_item){
+    int nf = num_faces(*sm_item->polyhedron());
+
+    bool ok;
+    int nb = 0;
+    nb = QInputDialog::getInt(QApplication::activeWindow(), "Sampling",
+                              "Enter number of sample points:",
+                              nf , 0, (std::numeric_limits<int>::max)(), 1, &ok);
+
     points->setName(QString("%1 (sampled)").arg(sm_item->name()));
-    CGAL::Polygon_mesh_processing::sample_triangle_mesh(*sm_item->polyhedron(),
-                                                        std::back_inserter(pts));
+    if( ok & (nb > 0)){
+      points->point_set()->reserve(nb);
+      CGAL::Polygon_mesh_processing::sample_triangle_mesh(*sm_item->polyhedron(),
+                                                          points->point_set()->point_back_inserter(),
+                                                          CGAL::parameters::number_of_points_on_faces(nb)
+                                                          .point_map(points->point_set()->point_push_map())
+                                                          .do_sample_vertices(false)
+                                                          .do_sample_edges(false));
+    }
   }
 
   Scene_polygon_soup_item* soup_item =
     qobject_cast<Scene_polygon_soup_item*>(scene->item(index));
 
   if (soup_item){
+    int nf = soup_item->polygons().size();
+
+    bool ok;
+    int nb = 0;
+    nb = QInputDialog::getInt(QApplication::activeWindow(), "Sampling",
+                              "Enter number of sample points:",
+                              nf , 0, (std::numeric_limits<int>::max)(), 1, &ok);
     points->setName(QString("%1 (sampled)").arg(soup_item->name()));
-    CGAL::Polygon_mesh_processing::sample_triangle_soup(soup_item->points(),
-                                                        soup_item->polygons(),
-                                                        std::back_inserter(pts));
-  }
-  points->point_set()->reserve(pts.size());
-  for (std::size_t i = 0; i < pts.size(); ++i){
-    points->point_set()->insert(pts[i]);
+    if( ok & (nb > 0)){
+      points->point_set()->reserve(nb);
+      CGAL::Polygon_mesh_processing::sample_triangle_soup(soup_item->points(),
+                                                          soup_item->polygons(),
+                                                          points->point_set()->point_back_inserter(),
+                                                          CGAL::parameters::number_of_points_on_faces(nb)
+                                                          .point_map(points->point_set()->point_push_map())
+                                                          .do_sample_vertices(false)
+                                                          .do_sample_edges(false));
+    }
   }
+
   scene->addItem(points);
   QApplication::restoreOverrideCursor();
 }

From 935a0faf2fc4bf92ed996edd28830e5e971e062e Mon Sep 17 00:00:00 2001
From: Mael <mael.rouxel.labbe@geometryfactory.com>
Date: Tue, 12 Dec 2023 10:09:06 +0100
Subject: [PATCH 1160/1398] Update macro name

Co-authored-by: Sebastien Loriot <sloriot.ml@gmail.com>
---
 BGL/include/CGAL/IO/polygon_mesh_io.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/BGL/include/CGAL/IO/polygon_mesh_io.h b/BGL/include/CGAL/IO/polygon_mesh_io.h
index 0dce62b6a37d..c2cdcbc52ee8 100644
--- a/BGL/include/CGAL/IO/polygon_mesh_io.h
+++ b/BGL/include/CGAL/IO/polygon_mesh_io.h
@@ -8,9 +8,9 @@
 //
 // Author(s)     : Mael Rouxel-Labbé
 
-#ifndef CGAL_BOOST_GRAPH_POLYGON_MESH_IO_H
-#define CGAL_BOOST_GRAPH_POLYGON_MESH_IO_H
+#ifndef CGAL_IO_POLYGON_MESH_IO_H
+#define CGAL_IO_POLYGON_MESH_IO_H
 
 #include <CGAL/boost/graph/io.h>
 
-#endif // CGAL_BOOST_GRAPH_POLYGON_MESH_IO_H
+#endif // CGAL_IO_POLYGON_MESH_IO_H

From 62a64ae870dc2832dcfdc97d33cef64e1ecc4485 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 12 Dec 2023 09:28:01 +0000
Subject: [PATCH 1161/1398] Add check that it faces are triangles

---
 .../sample_example.cpp                        |  7 +++--
 .../CGAL/Polygon_mesh_processing/distance.h   |  4 +--
 .../Point_set_from_sampling_plugin.cpp        | 29 +++++++++++++++----
 3 files changed, 29 insertions(+), 11 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp
index 474af00a16c5..113845a9cb6b 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp
@@ -34,7 +34,9 @@ int main(int argc, char* argv[])
 
   std::vector<Point> points;
 
-  PMP::sample_triangle_mesh(mesh, std::back_inserter(points), CGAL::parameters::number_of_points_per_face(points_per_face));
+  PMP::sample_triangle_mesh(mesh,
+                            std::back_inserter(points),
+                            CGAL::parameters::number_of_points_per_face(points_per_face));
 
   std::cout.precision(17);
   for(const Point& p : points){
@@ -43,8 +45,7 @@ int main(int argc, char* argv[])
 
   Point_set point_set;
   PMP::sample_triangle_mesh(mesh,
-                            point_set.point_back_inserter(),
-                            CGAL::parameters::point_map(point_set.point_push_map()));
+                            point_set.point_back_inserter());
 
   std::cout << point_set.number_of_points() << std::endl;
   return 0;
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
index 8b41ff2ecdb7..b3aaf70604f6 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
@@ -747,7 +747,7 @@ struct Triangle_structure_sampler_for_triangle_soup
  * @tparam TriangleMesh a model of the concepts `EdgeListGraph` and `FaceListGraph`
  * @tparam PointOutputIterator a model of `OutputIterator`
  *  holding objects of the same point type as
- *  the value type of the point type associated to the mesh `tm`, i.e. the value type of the vertex
+ *  the value type of the point type associated to the mesh `tm`, i.e., the value type of the vertex
  *  point map property map, if provided, or the value type of the internal point property map otherwise
  * @tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
  *
@@ -1570,7 +1570,7 @@ bounded_error_squared_Hausdorff_distance_impl(const TriangleMesh1& tm1,
     candidate_triangles.pop();
 
     // Only process the triangle if it can contribute to the Hausdorff distance,
-    // i.e. if its upper bound is higher than the currently known best lower bound
+    // i.e., if its upper bound is higher than the currently known best lower bound
     // and the difference between the bounds to be obtained is larger than the
     // user-given error.
     const auto& triangle_bounds = triangle_and_bounds.bounds;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
index 8075bb003f13..33c07c12ec46 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
@@ -1,3 +1,5 @@
+
+#include <CGAL/Three/Three.h>
 #include <QApplication>
 #include <QAction>
 #include <QList>
@@ -14,6 +16,7 @@
 #include "Messages_interface.h"
 
 #include <CGAL/Polygon_mesh_processing/distance.h>
+#include <CGAL/boost/graph/helpers.h>
 
 using namespace CGAL::Three;
 class Polyhedron_demo_point_set_from_sampling_plugin :
@@ -52,7 +55,7 @@ void Polyhedron_demo_point_set_from_sampling_plugin::init(QMainWindow* mainWindo
                                                           Messages_interface*)
 {
   scene = scene_interface;
-  actionPointSetFromSampling = new QAction(tr("&Create Point Set from Sampling"), mainWindow);
+  actionPointSetFromSampling = new QAction(tr("Create Point Set from Sampling"), mainWindow);
   actionPointSetFromSampling->setObjectName("actionPointSetFromSampling");
   connect(actionPointSetFromSampling, SIGNAL(triggered()),
           this, SLOT(createPointSet()));
@@ -75,18 +78,24 @@ void Polyhedron_demo_point_set_from_sampling_plugin::createPointSet()
   if (points){
     points->setColor(Qt::blue);
   }else{
+    QApplication::restoreOverrideCursor();
     return;
   }
   Scene_surface_mesh_item* sm_item =
     qobject_cast<Scene_surface_mesh_item*>(scene->item(index));
 
   if (sm_item){
+    if(! CGAL::is_triangle_mesh(*sm_item->polyhedron())){
+      CGAL::Three::Three::error(QString("The mesh must have triangle faces"));
+      QApplication::restoreOverrideCursor();
+      return;
+    }
     int nf = num_faces(*sm_item->polyhedron());
 
     bool ok;
     int nb = 0;
     nb = QInputDialog::getInt(QApplication::activeWindow(), "Sampling",
-                              "Enter number of sample points:",
+                              "Number of sample points:",
                               nf , 0, (std::numeric_limits<int>::max)(), 1, &ok);
 
     points->setName(QString("%1 (sampled)").arg(sm_item->name()));
@@ -95,9 +104,9 @@ void Polyhedron_demo_point_set_from_sampling_plugin::createPointSet()
       CGAL::Polygon_mesh_processing::sample_triangle_mesh(*sm_item->polyhedron(),
                                                           points->point_set()->point_back_inserter(),
                                                           CGAL::parameters::number_of_points_on_faces(nb)
-                                                          .point_map(points->point_set()->point_push_map())
                                                           .do_sample_vertices(false)
                                                           .do_sample_edges(false));
+      scene->addItem(points);
     }
   }
 
@@ -107,10 +116,18 @@ void Polyhedron_demo_point_set_from_sampling_plugin::createPointSet()
   if (soup_item){
     int nf = soup_item->polygons().size();
 
+    for(const auto& f : soup_item->polygons()){
+      if(f.size() != 3){
+        CGAL::Three::Three::error(QString("The polygons must be triangles"));
+        QApplication::restoreOverrideCursor();
+        return;
+      }
+    }
+
     bool ok;
     int nb = 0;
     nb = QInputDialog::getInt(QApplication::activeWindow(), "Sampling",
-                              "Enter number of sample points:",
+                              "Number of sample points:",
                               nf , 0, (std::numeric_limits<int>::max)(), 1, &ok);
     points->setName(QString("%1 (sampled)").arg(soup_item->name()));
     if( ok & (nb > 0)){
@@ -119,13 +136,13 @@ void Polyhedron_demo_point_set_from_sampling_plugin::createPointSet()
                                                           soup_item->polygons(),
                                                           points->point_set()->point_back_inserter(),
                                                           CGAL::parameters::number_of_points_on_faces(nb)
-                                                          .point_map(points->point_set()->point_push_map())
                                                           .do_sample_vertices(false)
                                                           .do_sample_edges(false));
+      scene->addItem(points);
     }
   }
 
-  scene->addItem(points);
+
   QApplication::restoreOverrideCursor();
 }
 

From 10f4caa29638b86a15df361a4da9eba9db599391 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 12 Dec 2023 11:53:22 +0100
Subject: [PATCH 1162/1398] add missing ref

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h     | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index b2d8427875c7..c9751752d753 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -1200,7 +1200,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
     //option 1 (using a mutex)
     CGAL_MUTEX point_container_mutex;
     /// Lambda concurrent_get_point_id()
-    auto concurrent_get_point_id = [&](const typename EK::Point_3 pt)
+    auto concurrent_get_point_id = [&](const typename EK::Point_3& pt)
     {
       auto insert_res = point_id_map.insert(std::make_pair(pt, -1));
 
@@ -1243,7 +1243,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
     //option 2 (without mutex)
     /// Lambda concurrent_get_point_id()
     tbb::concurrent_vector<typename Point_id_map::iterator> iterators;
-    auto concurrent_get_point_id = [&](const typename EK::Point_3 pt)
+    auto concurrent_get_point_id = [&](const typename EK::Point_3& pt)
     {
       auto insert_res = point_id_map.insert(std::make_pair(pt, -1));
       if (insert_res.second)

From b267b31bea9737dffaaa4b34f0a284ca991d9174 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 12 Dec 2023 13:12:21 +0100
Subject: [PATCH 1163/1398] workaround MSVC 2022 bug

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h    | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index c9751752d753..ec3f02633c84 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -996,9 +996,10 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
       if (!all_points[ti].empty())
       {
-        std::vector<typename EK::Point_3> tmp;
+        using EPoint_3 = EK::Point_3; // workaround for MSVC 2022 bug
+        std::vector<EPoint_3> tmp;
         tmp.swap(all_points[ti]);
-        for (const typename EK::Point_3& pt : tmp)
+        for (const EPoint_3& pt : tmp)
           get_point_id(pt);
       }
 

From 814a92655dfe38b96032772f3eae5aa351becde2 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 12 Dec 2023 13:12:45 +0100
Subject: [PATCH 1164/1398] remove non needed typenames + missing ref

---
 .../Polygon_mesh_processing/autorefinement.h  | 25 +++++++++----------
 1 file changed, 12 insertions(+), 13 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index ec3f02633c84..8a61b92f7178 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -447,8 +447,7 @@ bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
 }
 
 template <class EK,
-          class PointVector
->
+          class PointVector>
 void generate_subtriangles(std::size_t ti,
                            std::vector<std::pair<std::size_t, std::size_t>>& segments,
                            std::vector<typename EK::Point_3>& points,
@@ -896,7 +895,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
   // init the vector of triangles used for the autorefinement of triangles
   typedef CGAL::Exact_predicates_exact_constructions_kernel EK;
-  std::vector< std::array<typename EK::Point_3, 3> > triangles(tiid+1);
+  std::vector< std::array<EK::Point_3, 3> > triangles(tiid+1);
   Cartesian_converter<GT, EK> to_exact;
 
   for(Input_TID f : intersected_faces)
@@ -926,14 +925,14 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
     if (i1==-1 || i2==-1) continue; //skip degenerate faces
 
-    const std::array<typename EK::Point_3, 3>& t1 = triangles[i1];
-    const std::array<typename EK::Point_3, 3>& t2 = triangles[i2];
+    const std::array<EK::Point_3, 3>& t1 = triangles[i1];
+    const std::array<EK::Point_3, 3>& t2 = triangles[i2];
 
-    std::vector<typename EK::Point_3> inter_pts;
+    std::vector<EK::Point_3> inter_pts;
     bool triangles_are_coplanar = autorefine_impl::collect_intersections<EK>(t1, t2, inter_pts);
 
     CGAL_assertion(
-      CGAL::do_intersect(typename EK::Triangle_3(t1[0], t1[1], t1[2]), typename EK::Triangle_3(t2[0], t2[1], t2[2]))
+      CGAL::do_intersect(EK::Triangle_3(t1[0], t1[1], t1[2]), EK::Triangle_3(t2[0], t2[1], t2[2]))
       != inter_pts.empty());
 
     if (!inter_pts.empty())
@@ -985,7 +984,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
       std::map<EK::Point_3, std::size_t> point_id_map;
 
 
-      auto get_point_id = [&](const typename EK::Point_3& pt)
+      auto get_point_id = [&](const EK::Point_3& pt)
       {
         auto insert_res = point_id_map.insert(std::make_pair(pt, all_points[ti].size()));
         if (insert_res.second)
@@ -1010,8 +1009,8 @@ void autorefine_triangle_soup(PointRange& soup_points,
       std::set<std::pair<std::size_t, std::size_t>> segset;
       for (std::size_t si=0; si<nbs; ++si)
       {
-        EK::Point_3 src = all_segments[ti][si][0],
-                    tgt = all_segments[ti][si][1];
+        const EK::Point_3& src = all_segments[ti][si][0];
+        const EK::Point_3& tgt = all_segments[ti][si][1];
         std::size_t src_id = get_point_id(src), tgt_id=get_point_id(tgt);
         if (segset.insert(
               CGAL::make_sorted_pair(src_id, tgt_id)).second)
@@ -1169,7 +1168,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   // import refined triangles
 
   // Lambda to retrieve the id of intersection points
-  auto get_point_id = [&](const typename EK::Point_3& pt)
+  auto get_point_id = [&](const EK::Point_3& pt)
   {
     auto insert_res = point_id_map.insert(std::make_pair(pt, soup_points.size()));
     if (insert_res.second)
@@ -1201,7 +1200,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
     //option 1 (using a mutex)
     CGAL_MUTEX point_container_mutex;
     /// Lambda concurrent_get_point_id()
-    auto concurrent_get_point_id = [&](const typename EK::Point_3& pt)
+    auto concurrent_get_point_id = [&](const EK::Point_3& pt)
     {
       auto insert_res = point_id_map.insert(std::make_pair(pt, -1));
 
@@ -1244,7 +1243,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
     //option 2 (without mutex)
     /// Lambda concurrent_get_point_id()
     tbb::concurrent_vector<typename Point_id_map::iterator> iterators;
-    auto concurrent_get_point_id = [&](const typename EK::Point_3& pt)
+    auto concurrent_get_point_id = [&](const EK::Point_3& pt)
     {
       auto insert_res = point_id_map.insert(std::make_pair(pt, -1));
       if (insert_res.second)

From fa052c3d84a647c95d610639fe07e04979475a2c Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 12 Dec 2023 11:48:14 +0100
Subject: [PATCH 1165/1398] move sliver peeling to its own header file

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
---
 .../internal/peel_slivers.h                   | 117 ++++++++++++++++++
 .../tetrahedral_adaptive_remeshing_impl.h     |  79 +-----------
 2 files changed, 121 insertions(+), 75 deletions(-)
 create mode 100644 Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/peel_slivers.h

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/peel_slivers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/peel_slivers.h
new file mode 100644
index 000000000000..9cbff2ba95a1
--- /dev/null
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/peel_slivers.h
@@ -0,0 +1,117 @@
+// Copyright (c) 2020 GeometryFactory (France) and Telecom Paris (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+//
+//
+// Author(s)     : Jane Tournois, Noura Faraj, Jean-Marc Thiery, Tamy Boubekeur
+
+#ifndef CGAL_INTERNAL_PEEL_SLIVERS_H
+#define CGAL_INTERNAL_PEEL_SLIVERS_H
+
+#include <CGAL/license/Tetrahedral_remeshing.h>
+
+#include <CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h>
+
+namespace CGAL
+{
+namespace Tetrahedral_remeshing
+{
+
+template<typename C3T3, typename CellSelector>
+std::size_t peel_slivers(C3T3& c3t3,
+                         const typename C3T3::Triangulation::Geom_traits::FT& sliver_angle,
+                         const CellSelector& cell_selector)
+{
+  using FT = typename C3T3::Triangulation::Geom_traits::FT;
+  using Cell_handle = typename C3T3::Triangulation::Cell_handle;
+  using Surface_patch_index = typename C3T3::Surface_patch_index;
+
+  auto& tr = c3t3.triangulation();
+
+  std::size_t nb_slivers_peel = 0;
+  std::vector<std::pair<Cell_handle, std::array<bool, 4> > > peelable_cells;
+
+#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+  FT mindh = FT(180);
+#endif
+  for (Cell_handle cit : c3t3.cells_in_complex())
+  {
+    if(!get(cell_selector, cit))
+      continue;
+
+    std::array<bool, 4> facets_on_surface;
+
+    const FT dh = min_dihedral_angle(tr, cit);
+    if (dh < sliver_angle && is_peelable(c3t3, cit, facets_on_surface))
+      peelable_cells.push_back(std::make_pair(cit, facets_on_surface));
+
+#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+      mindh = (std::min)(dh, mindh);
+#endif
+  }
+
+#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+  std::cout << "Min dihedral angle : " << mindh << std::endl;
+  std::cout << "Peelable cells : " << peelable_cells.size() << std::endl;
+#endif
+
+  for (auto c_i : peelable_cells)
+  {
+    Cell_handle c = c_i.first;
+    const std::array<bool, 4>& f_on_surface = c_i.second;
+
+    boost::optional<Surface_patch_index> patch;
+    for (int i = 0; i < 4; ++i)
+    {
+      if (f_on_surface[i])
+      {
+        Surface_patch_index spi = c3t3.surface_patch_index(c, i);
+        if (patch != boost::none && patch != spi)
+        {
+          patch = boost::none;
+          break;
+        }
+        else
+        {
+          patch = spi;
+        }
+      }
+    }
+    if (patch == boost::none)
+      continue;
+
+    for (int i = 0; i < 4; ++i)
+    {
+      if (f_on_surface[i])
+        c3t3.remove_from_complex(c, i);
+      else
+        c3t3.add_to_complex(c, i, patch.get());
+    }
+
+    c3t3.remove_from_complex(c);
+    ++nb_slivers_peel;
+  }
+
+#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+  mindh = FT(180);
+  for (Cell_handle cit : c3t3.cells_in_complex())
+  {
+    const FT dh = min_dihedral_angle(tr, cit);
+    mindh = (std::min)(dh, mindh);
+  }
+  std::cout << "Peeling done (removed " << nb_slivers_peel << " slivers, "
+    << "min dihedral angle = " << mindh << ")." << std::endl;
+#endif
+
+  return nb_slivers_peel;
+}
+
+} // end namespace Tetrahedral_remeshing
+} // end namespace CGAL
+
+#endif // CGAL_INTERNAL_PEEL_SLIVERS_H
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
index be3dfe8f276f..8b2cbe40a6e4 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
@@ -26,6 +26,7 @@
 #include <CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h>
 #include <CGAL/Tetrahedral_remeshing/internal/flip_edges.h>
 #include <CGAL/Tetrahedral_remeshing/internal/smooth_vertices.h>
+#include <CGAL/Tetrahedral_remeshing/internal/peel_slivers.h>
 
 #include <CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h>
 #include <CGAL/Tetrahedral_remeshing/internal/compute_c3t3_statistics.h>
@@ -291,67 +292,8 @@ class Adaptive_remesher
     std::cout.flush();
 #endif
 
-    std::size_t nb_slivers_peel = 0;
-    std::vector<std::pair<Cell_handle, std::array<bool, 4> > > peelable_cells;
-#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-    double mindh = 180.;
-#endif
-    for (Cell_handle cit : tr().finite_cell_handles())
-    {
-      std::array<bool, 4> facets_on_surface;
-      if (m_c3t3.is_in_complex(cit))
-      {
-        const double dh = min_dihedral_angle(tr(), cit);
-        if(dh < sliver_angle && is_peelable(m_c3t3, cit, facets_on_surface))
-          peelable_cells.push_back(std::make_pair(cit, facets_on_surface));
-
-#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-        mindh = (std::min)(dh, mindh);
-#endif
-      }
-    }
-
-#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-    std::cout << "Min dihedral angle : " << mindh << std::endl;
-    std::cout << "Peelable cells : " << peelable_cells.size() << std::endl;
-#endif
-
-    for (auto c_i : peelable_cells)
-    {
-      Cell_handle c = c_i.first;
-      const std::array<bool, 4>& f_on_surface = c_i.second;
-
-      std::optional<Surface_patch_index> patch;
-      for (int i = 0; i < 4; ++i)
-      {
-        if (f_on_surface[i])
-        {
-          Surface_patch_index spi = m_c3t3.surface_patch_index(c, i);
-          if (patch != std::nullopt && patch != spi)
-          {
-            patch = std::nullopt;
-            break;
-          }
-          else
-          {
-            patch = spi;
-          }
-        }
-      }
-      if(patch == std::nullopt)
-        continue;
-
-      for (int i = 0; i < 4; ++i)
-      {
-        if(f_on_surface[i])
-          m_c3t3.remove_from_complex(c, i);
-        else
-          m_c3t3.add_to_complex(c, i, patch.value());
-      }
-
-      m_c3t3.remove_from_complex(c);
-      ++nb_slivers_peel;
-    }
+    const std::size_t nb_peeled
+      = CGAL::Tetrahedral_remeshing::peel_slivers(m_c3t3, sliver_angle, m_cell_selector);
 
 #ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
     CGAL_assertion(tr().tds().is_valid(true));
@@ -360,21 +302,8 @@ class Adaptive_remesher
 #ifdef CGAL_DUMP_REMESHING_STEPS
     CGAL::Tetrahedral_remeshing::debug::dump_c3t3(m_c3t3, "99-postprocess");
 #endif
-#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-    mindh = 180.;
-    for (Cell_handle cit : tr().finite_cell_handles())
-    {
-      if (m_c3t3.is_in_complex(cit))
-      {
-        const double dh = min_dihedral_angle(tr(), cit);
-        mindh = (std::min)(dh, mindh);
-      }
-    }
-    std::cout << "Peeling done (removed " << nb_slivers_peel << " slivers, "
-      << "min dihedral angle = " << mindh << ")." << std::endl;
 
-#endif
-    return nb_slivers_peel;
+    return nb_peeled;
   }
 
   void finalize()

From f241f4b6efe82ee5b59a817c6292a8db9ba80f04 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 12 Dec 2023 17:41:37 +0100
Subject: [PATCH 1166/1398] rename example with shorter name

error on windows testsuites :
"The fully qualified file name must be less than 260 characters."
---
 .../doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt     | 2 +-
 .../doc/Tetrahedral_remeshing/examples.txt                  | 2 +-
 .../examples/Tetrahedral_remeshing/CMakeLists.txt           | 6 +++---
 ...h_features_from_complex.cpp => mesh_and_remesh_c3t3.cpp} | 0
 4 files changed, 5 insertions(+), 5 deletions(-)
 rename Tetrahedral_remeshing/examples/Tetrahedral_remeshing/{mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp => mesh_and_remesh_c3t3.cpp} (100%)

diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
index f0400342db1b..a2e1c0fb1368 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/Tetrahedral_remeshing.txt
@@ -107,7 +107,7 @@ It is also possible to define the polyline features as the ones
 stored as complex edges in a `Mesh_complex_3_in_triangulation_3`
 (e.g. generated by the \ref PkgMesh3 package mesh generation algorithms).
 
-\cgalExample{Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp }
+\cgalExample{Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp }
 
 
 \subsection ssecEx4 Tetrahedral Remeshing After Mesh Generation
diff --git a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/examples.txt b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/examples.txt
index 06b69b82469a..17d90d1f20d8 100644
--- a/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/examples.txt
+++ b/Tetrahedral_remeshing/doc/Tetrahedral_remeshing/examples.txt
@@ -4,6 +4,6 @@
 \example Tetrahedral_remeshing/tetrahedral_remeshing_of_one_subdomain.cpp
 \example Tetrahedral_remeshing/tetrahedral_remeshing_with_features.cpp
 \example Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
-\example Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp
+\example Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp
 \example Tetrahedral_remeshing/tetrahedral_remeshing_from_mesh.cpp
 */
diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/CMakeLists.txt b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/CMakeLists.txt
index 4448fd6bde71..94981f0550bc 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/CMakeLists.txt
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/CMakeLists.txt
@@ -31,13 +31,13 @@ if(TARGET CGAL::Eigen3_support)
   create_single_source_cgal_program( "mesh_and_remesh_polyhedral_domain_with_features.cpp" )
   target_link_libraries(mesh_and_remesh_polyhedral_domain_with_features PUBLIC CGAL::Eigen3_support)
 
-  create_single_source_cgal_program("mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp")
-  target_link_libraries(mesh_and_remesh_polyhedral_domain_with_features_from_complex PUBLIC CGAL::Eigen3_support)
+  create_single_source_cgal_program("mesh_and_remesh_c3t3.cpp")
+  target_link_libraries(mesh_and_remesh_c3t3 PUBLIC CGAL::Eigen3_support)
 
   if(CGAL_ACTIVATE_CONCURRENT_MESH_3 AND TARGET CGAL::TBB_support)
     message(STATUS "Found TBB")
     target_link_libraries(mesh_and_remesh_polyhedral_domain_with_features PRIVATE CGAL::TBB_support)
-    target_link_libraries(mesh_and_remesh_polyhedral_domain_with_features_from_complex PRIVATE CGAL::TBB_support)
+    target_link_libraries(mesh_and_remesh_c3t3 PRIVATE CGAL::TBB_support)
   endif()
 else()
   message(STATUS "NOTICE: Some examples require Eigen 3.1 (or greater), and will not be compiled.")
diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp
similarity index 100%
rename from Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features_from_complex.cpp
rename to Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp

From ee1d222d45019179a9441202ffc7bbab75a7438e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 13 Dec 2023 07:35:53 +0000
Subject: [PATCH 1167/1398] double -> int

---
 .../examples/Polygon_mesh_processing/sample_example.cpp    | 7 +------
 1 file changed, 1 insertion(+), 6 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp
index 113845a9cb6b..fa60ae6538f7 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/sample_example.cpp
@@ -30,18 +30,13 @@ int main(int argc, char* argv[])
     return 1;
   }
 
-  const double points_per_face = (argc > 2) ? atof(argv[2]) : 10;
+  const int points_per_face = (argc > 2) ? std::stoi(argv[2]) : 10;
 
   std::vector<Point> points;
-
   PMP::sample_triangle_mesh(mesh,
                             std::back_inserter(points),
                             CGAL::parameters::number_of_points_per_face(points_per_face));
 
-  std::cout.precision(17);
-  for(const Point& p : points){
-    std::cout << p << std::endl;
-  }
 
   Point_set point_set;
   PMP::sample_triangle_mesh(mesh,

From 0f9e44621998984498ce1c81964227e4a0156854 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 13 Dec 2023 08:57:24 +0000
Subject: [PATCH 1168/1398] static_cast<int>

---
 .../Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp  | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
index 33c07c12ec46..aa6ea4c1ba01 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Operations_on_polyhedra/Point_set_from_sampling_plugin.cpp
@@ -114,7 +114,7 @@ void Polyhedron_demo_point_set_from_sampling_plugin::createPointSet()
     qobject_cast<Scene_polygon_soup_item*>(scene->item(index));
 
   if (soup_item){
-    int nf = soup_item->polygons().size();
+    int nf = static_cast<int>(soup_item->polygons().size());
 
     for(const auto& f : soup_item->polygons()){
       if(f.size() != 3){

From 61ad28c80ca736450c5bd8d56e051b07e31be398 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 13 Dec 2023 09:58:06 +0100
Subject: [PATCH 1169/1398] Swap the contents of CGAL/IO/polygon_mesh_io.h and
 CGAL/BGL/IO/polygon_mesh_io.h

---
 BGL/doc/BGL/Doxyfile.in                       |   3 +-
 BGL/include/CGAL/IO/polygon_mesh_io.h         | 254 +++++++++++++++++-
 .../CGAL/boost/graph/IO/polygon_mesh_io.h     | 253 +----------------
 3 files changed, 256 insertions(+), 254 deletions(-)

diff --git a/BGL/doc/BGL/Doxyfile.in b/BGL/doc/BGL/Doxyfile.in
index 4e5d35a91d2c..72d3e79168c8 100644
--- a/BGL/doc/BGL/Doxyfile.in
+++ b/BGL/doc/BGL/Doxyfile.in
@@ -1,7 +1,8 @@
 @INCLUDE = ${CGAL_DOC_PACKAGE_DEFAULTS}
 
 PROJECT_NAME = "CGAL ${CGAL_DOC_VERSION} - CGAL and the Boost Graph Library"
-INPUT += ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/boost/graph/Euler_operations.h \
+INPUT += ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/IO/polygon_mesh_io.h \
+         ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/boost/graph/Euler_operations.h \
          ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/boost/graph/iterator.h \
          ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/boost/graph/helpers.h \
          ${CGAL_PACKAGE_INCLUDE_DIR}/CGAL/boost/graph/generators.h \
diff --git a/BGL/include/CGAL/IO/polygon_mesh_io.h b/BGL/include/CGAL/IO/polygon_mesh_io.h
index c2cdcbc52ee8..b8b86d45f8f7 100644
--- a/BGL/include/CGAL/IO/polygon_mesh_io.h
+++ b/BGL/include/CGAL/IO/polygon_mesh_io.h
@@ -1,4 +1,4 @@
-// Copyright (c) 2023  GeometryFactory (France).  All rights reserved.
+// Copyright (c) 2020  GeometryFactory (France).  All rights reserved.
 //
 // This file is part of CGAL (www.cgal.org)
 //
@@ -6,11 +6,259 @@
 // $Id$
 // SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Mael Rouxel-Labbé
+// Author(s)     : Maxime Gimeno
+//                 Mael Rouxel-Labbé
 
 #ifndef CGAL_IO_POLYGON_MESH_IO_H
 #define CGAL_IO_POLYGON_MESH_IO_H
 
-#include <CGAL/boost/graph/io.h>
+#include <CGAL/boost/graph/IO/3MF.h>
+#include <CGAL/boost/graph/IO/GOCAD.h>
+#include <CGAL/boost/graph/IO/INP.h>
+#include <CGAL/boost/graph/IO/OBJ.h>
+#include <CGAL/boost/graph/IO/OFF.h>
+#include <CGAL/boost/graph/IO/PLY.h>
+#include <CGAL/boost/graph/IO/STL.h>
+#include <CGAL/boost/graph/IO/VTK.h>
+#include <CGAL/boost/graph/IO/WRL.h>
+#include <CGAL/IO/helpers.h>
+
+#include <fstream>
+#include <string>
+
+namespace CGAL {
+
+namespace IO {
+
+////////////////////////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////////////////////////
+// Read
+
+//not for now : some readers will return "ok" despite not managing to read anything
+/*
+template <class Graph, typename NamedParameters = parameters::Default_named_parameters>
+bool read_polygon_mesh(std::istream& is,
+                       Graph& g,
+                       const NamedParameters& np = parameters::default_values())
+{
+  bool ok = false;
+  ok = read_OFF(is, g, np, false);
+  if(ok)
+    return true;
+  g.clear();
+  is.clear();//reset the error state
+  is.seekg (0, is.beg);
+  ok = read_OBJ(is, g, np, false);
+  if(ok)
+    return true;
+  g.clear();
+  is.clear();
+  is.seekg (0, is.beg);
+  ok = read_PLY(is, g, np, false);
+  if(ok)
+    return true;
+  g.clear();
+  is.clear();
+  is.seekg (0, is.beg);
+  ok = read_STL(is, g, np, false);
+  if(ok)
+    return true;
+  g.clear();
+  is.clear();
+  is.seekg (0, is.beg);
+  ok = read_GOCAD(is, g, np, false);
+  return ok;
+}
+
+*/
+
+/*!
+ * \ingroup PkgBGLIOFct
+ *
+ * \brief reads a polygon mesh from a file.
+ *
+ * Supported file formats are the following:
+ * - \ref IOStreamOFF (`.off`)
+ * - \ref IOStreamOBJ (`.obj`)
+ * - \ref IOStreamSTL (`.stl`)
+ * - \ref IOStreamPLY (`.ply`)
+ * - \ref IOStreamGocad (`.ts`)
+ * - \ref IOStreamVTK (`.vtp`)
+ *
+ * The format is detected from the filename extension (letter case is not important).
+ *
+ * The data is expected to represent a 2-manifold (possibly with borders).
+ *
+ * \tparam Graph a model of `MutableFaceGraph`
+ * \tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+ *
+ * \param fname the name of the file
+ * \param g the mesh
+ * \param np optional \ref bgl_namedparameters "Named Parameters" described below
+ *
+ * \cgalNamedParamsBegin
+ *   \cgalParamNBegin{vertex_point_map}
+ *     \cgalParamDescription{a property map associating points to the vertices of `g`}
+ *     \cgalParamType{a class model of `WritablePropertyMap` with `boost::graph_traits<Graph>::%vertex_descriptor`
+ *                    as key type and `%Point_3` as value type}
+ *     \cgalParamDefault{`boost::get(CGAL::vertex_point, g)`}
+ *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
+ *                     must be available in `Graph`.}
+ *   \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{verbose}
+ *     \cgalParamDescription{whether extra information is printed when an incident occurs during reading}
+ *     \cgalParamType{Boolean}
+ *     \cgalParamDefault{`false`}
+ *   \cgalParamNEnd
+ * \cgalNamedParamsEnd
+ *
+ * Other named parameters may be used according to the file extension, see \ref PkgBGLIOFct for an exhaustive list.
+ *
+ * \return `true` if reading was successful, `false` otherwise.
+ *
+ * \sa \link PMP_IO_grp `CGAL::Polygon_mesh_processing::IO::read_polygon_mesh()`\endlink if the data is not 2-manifold
+*/
+template <class Graph, typename NamedParameters = parameters::Default_named_parameters>
+bool read_polygon_mesh(const std::string& fname,
+                       Graph& g,
+                       const NamedParameters& np = parameters::default_values())
+{
+  const bool verbose = parameters::choose_parameter(parameters::get_parameter(np, internal_np::verbose), false);
+
+  const std::string ext = internal::get_file_extension(fname);
+  if(ext == std::string())
+  {
+    if(verbose)
+      std::cerr << "Error: cannot read from file without extension" << std::endl;
+    return false;
+  }
+
+  if(ext == "obj")
+    return read_OBJ(fname, g, np);
+  else if(ext == "off")
+    return read_OFF(fname, g, np);
+  else if(ext == "ply")
+    return read_PLY(fname, g, np);
+  else if(ext == "stl")
+    return read_STL(fname, g, np);
+  else if(ext == "ts")
+    return read_GOCAD(fname, g, np);
+#ifdef CGAL_USE_VTK
+  else if(ext == "vtp")
+    return read_VTP(fname, g, np);
+#endif
+
+  if(verbose)
+  {
+    std::cerr << "Error: unknown input file extension: " << ext << "\n"
+              << "Please refer to the documentation for the list of supported file formats" << std::endl;
+  }
+
+  return false;
+}
+
+////////////////////////////////////////////////////////////////////////////////////////////////////
+////////////////////////////////////////////////////////////////////////////////////////////////////
+// Write
+
+/*!
+ * \ingroup PkgBGLIOFct
+ *
+ * \brief writes a polygon mesh in a file.
+ *
+ * Supported file formats are the following:
+ * - \ref IOStreamOFF (`.off`)
+ * - \ref IOStreamOBJ (`.obj`)
+ * - \ref IOStreamSTL (`.stl`)
+ * - \ref IOStreamPLY (`.ply`)
+ * - \ref IOStreamGocad (`.ts`)
+ * - \ref IOStreamVTK (`.vtp`)
+ *
+ * The format is detected from the filename extension (letter case is not important).
+ *
+ * \tparam Graph a model of `FaceListGraph` and `HalfedgeListGraph`
+ * \tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
+ *
+ * \param fname the name of the file
+ * \param g the mesh to be output
+ * \param np optional \ref bgl_namedparameters "Named Parameters" described below
+ *
+ * \cgalNamedParamsBegin
+ *   \cgalParamNBegin{vertex_point_map}
+ *     \cgalParamDescription{a property map associating points to the vertices of `g`}
+ *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<Graph>::%vertex_descriptor`
+ *                    as key type and `%Point_3` as value type}
+ *     \cgalParamDefault{`boost::get(CGAL::vertex_point, g)`}
+ *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
+ *                     must be available in `Graph`.}
+ *   \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{stream_precision}
+ *     \cgalParamDescription{a parameter used to set the precision (i.e. how many digits are generated) of the output stream}
+ *     \cgalParamType{int}
+ *     \cgalParamDefault{`6`}
+ *     \cgalParamExtra{This parameter is only meaningful while using \ascii encoding.}
+ *   \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{use_binary_mode}
+ *     \cgalParamDescription{indicates whether data should be written in binary (`true`) or in \ascii (`false`)}
+ *     \cgalParamType{Boolean}
+ *     \cgalParamDefault{`true`}
+ *     \cgalParamExtra{This parameter is only meaningful for formats that support binary encoding.}
+ *   \cgalParamNEnd
+ *
+ *   \cgalParamNBegin{verbose}
+ *     \cgalParamDescription{whether extra information is printed when an incident occurs during reading}
+ *     \cgalParamType{Boolean}
+ *     \cgalParamDefault{`false`}
+ *   \cgalParamNEnd
+ * \cgalNamedParamsEnd
+ *
+ * Other named parameters may be used according to the file extension, see \ref PkgBGLIOFct for an exhaustive list.
+ *
+ * \return `true` if writing was successful, `false` otherwise.
+ */
+template <class Graph, typename NamedParameters = parameters::Default_named_parameters>
+bool write_polygon_mesh(const std::string& fname,
+                        Graph& g,
+                        const NamedParameters& np = parameters::default_values())
+{
+  const bool verbose = parameters::choose_parameter(parameters::get_parameter(np, internal_np::verbose), false);
+
+  const std::string ext = internal::get_file_extension(fname);
+  if(ext == std::string())
+  {
+    if(verbose)
+      std::cerr << "Error: trying to output to file without extension" << std::endl;
+    return false;
+  }
+
+  if(ext == "obj")
+    return write_OBJ(fname, g, np);
+  else if(ext == "off")
+    return write_OFF(fname, g, np);
+  else if(ext == "ply")
+    return write_PLY(fname, g, np);
+  else if(ext == "stl")
+    return write_STL(fname, g, np);
+  else if(ext == "ts")
+    return write_GOCAD(fname, g, np);
+#ifdef CGAL_USE_VTK
+  else if(ext == "vtp")
+    return write_VTP(fname, g, np);
+#endif
+
+  if(verbose)
+  {
+    std::cerr << "Error: unknown output file extension: " << ext << "\n"
+              << "Please refer to the documentation for the list of supported file formats" << std::endl;
+  }
+
+  return false;
+}
+
+} // namespace IO
+} // namespace CGAL
 
 #endif // CGAL_IO_POLYGON_MESH_IO_H
diff --git a/BGL/include/CGAL/boost/graph/IO/polygon_mesh_io.h b/BGL/include/CGAL/boost/graph/IO/polygon_mesh_io.h
index d60af3c9949e..84189cf7373b 100644
--- a/BGL/include/CGAL/boost/graph/IO/polygon_mesh_io.h
+++ b/BGL/include/CGAL/boost/graph/IO/polygon_mesh_io.h
@@ -1,4 +1,4 @@
-// Copyright (c) 2020  GeometryFactory (France).  All rights reserved.
+// Copyright (c) 2023  GeometryFactory (France).  All rights reserved.
 //
 // This file is part of CGAL (www.cgal.org)
 //
@@ -6,258 +6,11 @@
 // $Id$
 // SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Maxime Gimeno
-//                 Mael Rouxel-Labbé
+// Author(s)     : Mael Rouxel-Labbé
 
 #ifndef CGAL_BOOST_GRAPH_POLYGON_MESH_IO_H
 #define CGAL_BOOST_GRAPH_POLYGON_MESH_IO_H
 
-#include <CGAL/boost/graph/IO/3MF.h>
-#include <CGAL/boost/graph/IO/GOCAD.h>
-#include <CGAL/boost/graph/IO/INP.h>
-#include <CGAL/boost/graph/IO/OBJ.h>
-#include <CGAL/boost/graph/IO/OFF.h>
-#include <CGAL/boost/graph/IO/PLY.h>
-#include <CGAL/boost/graph/IO/STL.h>
-#include <CGAL/boost/graph/IO/VTK.h>
-#include <CGAL/boost/graph/IO/WRL.h>
-#include <CGAL/IO/helpers.h>
-
-#include <fstream>
-#include <string>
-
-namespace CGAL {
-
-namespace IO {
-
-////////////////////////////////////////////////////////////////////////////////////////////////////
-////////////////////////////////////////////////////////////////////////////////////////////////////
-// Read
-
-//not for now : some readers will return "ok" despite not managing to read anything
-/*
-template <class Graph, typename NamedParameters = parameters::Default_named_parameters>
-bool read_polygon_mesh(std::istream& is,
-                       Graph& g,
-                       const NamedParameters& np = parameters::default_values())
-{
-  bool ok = false;
-  ok = read_OFF(is, g, np, false);
-  if(ok)
-    return true;
-  g.clear();
-  is.clear();//reset the error state
-  is.seekg (0, is.beg);
-  ok = read_OBJ(is, g, np, false);
-  if(ok)
-    return true;
-  g.clear();
-  is.clear();
-  is.seekg (0, is.beg);
-  ok = read_PLY(is, g, np, false);
-  if(ok)
-    return true;
-  g.clear();
-  is.clear();
-  is.seekg (0, is.beg);
-  ok = read_STL(is, g, np, false);
-  if(ok)
-    return true;
-  g.clear();
-  is.clear();
-  is.seekg (0, is.beg);
-  ok = read_GOCAD(is, g, np, false);
-  return ok;
-}
-
-*/
-
-/*!
- * \ingroup PkgBGLIOFct
- *
- * \brief reads a polygon mesh from a file.
- *
- * Supported file formats are the following:
- * - \ref IOStreamOFF (`.off`)
- * - \ref IOStreamOBJ (`.obj`)
- * - \ref IOStreamSTL (`.stl`)
- * - \ref IOStreamPLY (`.ply`)
- * - \ref IOStreamGocad (`.ts`)
- * - \ref IOStreamVTK (`.vtp`)
- *
- * The format is detected from the filename extension (letter case is not important).
- *
- * The data is expected to represent a 2-manifold (possibly with borders).
- *
- * \tparam Graph a model of `MutableFaceGraph`
- * \tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
- *
- * \param fname the name of the file
- * \param g the mesh
- * \param np optional \ref bgl_namedparameters "Named Parameters" described below
- *
- * \cgalNamedParamsBegin
- *   \cgalParamNBegin{vertex_point_map}
- *     \cgalParamDescription{a property map associating points to the vertices of `g`}
- *     \cgalParamType{a class model of `WritablePropertyMap` with `boost::graph_traits<Graph>::%vertex_descriptor`
- *                    as key type and `%Point_3` as value type}
- *     \cgalParamDefault{`boost::get(CGAL::vertex_point, g)`}
- *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
- *                     must be available in `Graph`.}
- *   \cgalParamNEnd
- *
- *   \cgalParamNBegin{verbose}
- *     \cgalParamDescription{whether extra information is printed when an incident occurs during reading}
- *     \cgalParamType{Boolean}
- *     \cgalParamDefault{`false`}
- *   \cgalParamNEnd
- * \cgalNamedParamsEnd
- *
- * Other named parameters may be used according to the file extension, see \ref PkgBGLIOFct for an exhaustive list.
- *
- * \return `true` if reading was successful, `false` otherwise.
- *
- * \sa \link PMP_IO_grp `CGAL::Polygon_mesh_processing::IO::read_polygon_mesh()`\endlink if the data is not 2-manifold
-*/
-template <class Graph, typename NamedParameters = parameters::Default_named_parameters>
-bool read_polygon_mesh(const std::string& fname,
-                       Graph& g,
-                       const NamedParameters& np = parameters::default_values())
-{
-  const bool verbose = parameters::choose_parameter(parameters::get_parameter(np, internal_np::verbose), false);
-
-  const std::string ext = internal::get_file_extension(fname);
-  if(ext == std::string())
-  {
-    if(verbose)
-      std::cerr << "Error: cannot read from file without extension" << std::endl;
-    return false;
-  }
-
-  if(ext == "obj")
-    return read_OBJ(fname, g, np);
-  else if(ext == "off")
-    return read_OFF(fname, g, np);
-  else if(ext == "ply")
-    return read_PLY(fname, g, np);
-  else if(ext == "stl")
-    return read_STL(fname, g, np);
-  else if(ext == "ts")
-    return read_GOCAD(fname, g, np);
-#ifdef CGAL_USE_VTK
-  else if(ext == "vtp")
-    return read_VTP(fname, g, np);
-#endif
-
-  if(verbose)
-  {
-    std::cerr << "Error: unknown input file extension: " << ext << "\n"
-              << "Please refer to the documentation for the list of supported file formats" << std::endl;
-  }
-
-  return false;
-}
-
-////////////////////////////////////////////////////////////////////////////////////////////////////
-////////////////////////////////////////////////////////////////////////////////////////////////////
-// Write
-
-/*!
- * \ingroup PkgBGLIOFct
- *
- * \brief writes a polygon mesh in a file.
- *
- * Supported file formats are the following:
- * - \ref IOStreamOFF (`.off`)
- * - \ref IOStreamOBJ (`.obj`)
- * - \ref IOStreamSTL (`.stl`)
- * - \ref IOStreamPLY (`.ply`)
- * - \ref IOStreamGocad (`.ts`)
- * - \ref IOStreamVTK (`.vtp`)
- *
- * The format is detected from the filename extension (letter case is not important).
- *
- * \tparam Graph a model of `FaceListGraph` and `HalfedgeListGraph`
- * \tparam NamedParameters a sequence of \ref bgl_namedparameters "Named Parameters"
- *
- * \param fname the name of the file
- * \param g the mesh to be output
- * \param np optional \ref bgl_namedparameters "Named Parameters" described below
- *
- * \cgalNamedParamsBegin
- *   \cgalParamNBegin{vertex_point_map}
- *     \cgalParamDescription{a property map associating points to the vertices of `g`}
- *     \cgalParamType{a class model of `ReadablePropertyMap` with `boost::graph_traits<Graph>::%vertex_descriptor`
- *                    as key type and `%Point_3` as value type}
- *     \cgalParamDefault{`boost::get(CGAL::vertex_point, g)`}
- *     \cgalParamExtra{If this parameter is omitted, an internal property map for `CGAL::vertex_point_t`
- *                     must be available in `Graph`.}
- *   \cgalParamNEnd
- *
- *   \cgalParamNBegin{stream_precision}
- *     \cgalParamDescription{a parameter used to set the precision (i.e. how many digits are generated) of the output stream}
- *     \cgalParamType{int}
- *     \cgalParamDefault{`6`}
- *     \cgalParamExtra{This parameter is only meaningful while using \ascii encoding.}
- *   \cgalParamNEnd
- *
- *   \cgalParamNBegin{use_binary_mode}
- *     \cgalParamDescription{indicates whether data should be written in binary (`true`) or in \ascii (`false`)}
- *     \cgalParamType{Boolean}
- *     \cgalParamDefault{`true`}
- *     \cgalParamExtra{This parameter is only meaningful for formats that support binary encoding.}
- *   \cgalParamNEnd
- *
- *   \cgalParamNBegin{verbose}
- *     \cgalParamDescription{whether extra information is printed when an incident occurs during reading}
- *     \cgalParamType{Boolean}
- *     \cgalParamDefault{`false`}
- *   \cgalParamNEnd
- * \cgalNamedParamsEnd
- *
- * Other named parameters may be used according to the file extension, see \ref PkgBGLIOFct for an exhaustive list.
- *
- * \return `true` if writing was successful, `false` otherwise.
- */
-template <class Graph, typename NamedParameters = parameters::Default_named_parameters>
-bool write_polygon_mesh(const std::string& fname,
-                        Graph& g,
-                        const NamedParameters& np = parameters::default_values())
-{
-  const bool verbose = parameters::choose_parameter(parameters::get_parameter(np, internal_np::verbose), false);
-
-  const std::string ext = internal::get_file_extension(fname);
-  if(ext == std::string())
-  {
-    if(verbose)
-      std::cerr << "Error: trying to output to file without extension" << std::endl;
-    return false;
-  }
-
-  if(ext == "obj")
-    return write_OBJ(fname, g, np);
-  else if(ext == "off")
-    return write_OFF(fname, g, np);
-  else if(ext == "ply")
-    return write_PLY(fname, g, np);
-  else if(ext == "stl")
-    return write_STL(fname, g, np);
-  else if(ext == "ts")
-    return write_GOCAD(fname, g, np);
-#ifdef CGAL_USE_VTK
-  else if(ext == "vtp")
-    return write_VTP(fname, g, np);
-#endif
-
-  if(verbose)
-  {
-    std::cerr << "Error: unknown output file extension: " << ext << "\n"
-              << "Please refer to the documentation for the list of supported file formats" << std::endl;
-  }
-
-  return false;
-}
-
-}} // namespace CGAL::IO
+#include <CGAL/IO/polygon_mesh_io.h>
 
 #endif // CGAL_BOOST_GRAPH_POLYGON_MESH_IO_H

From 74c47e6222a160bd0e2e64b1bf08ef65ea9aeb43 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 13 Dec 2023 09:21:16 +0000
Subject: [PATCH 1170/1398] Add CGAL::IO:: for linking

---
 .../doc/Stream_support/IOstream.txt           | 26 +++++++++----------
 1 file changed, 13 insertions(+), 13 deletions(-)

diff --git a/Stream_support/doc/Stream_support/IOstream.txt b/Stream_support/doc/Stream_support/IOstream.txt
index 7d11ad3d16ad..cc299f2540ab 100644
--- a/Stream_support/doc/Stream_support/IOstream.txt
+++ b/Stream_support/doc/Stream_support/IOstream.txt
@@ -345,7 +345,7 @@ The file formats supported for `CGAL::Point_set_3` are detailed in the table bel
     </tr>
     <tr>
       <td>Input</td>
-      <td>`read_point_set()`</td>
+      <td>`CGAL::IO::read_point_set()`</td>
       <td>\link PkgPointSet3IOOFF `read_OFF()` \endlink</td>
       <td>\link PkgPointSet3IOXYZ `read_XYZ()` \endlink</td>
       <td>\link PkgPointSet3IOPLY `read_PLY()` \endlink</td>
@@ -353,7 +353,7 @@ The file formats supported for `CGAL::Point_set_3` are detailed in the table bel
     </tr>
     <tr>
       <td>Output</td>
-      <td>`write_point_set()`</td>
+      <td>`CGAL::IO::write_point_set()`</td>
       <td>\link PkgPointSet3IOOFF `write_OFF()` \endlink</td>
       <td>\link PkgPointSet3IOXYZ `write_XYZ()` \endlink</td>
       <td>\link PkgPointSet3IOPLY `write_PLY()` \endlink</td>
@@ -381,7 +381,7 @@ their indices per face (i.e a vector of 3 integers represent a triangle face).
     </tr>
     <tr>
       <td>Input</td>
-      <td>`read_polygon_soup()`</td>
+      <td>`CGAL::IO::read_polygon_soup()`</td>
       <td>\link PkgStreamSupportIoFuncsOFF `read_OFF()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsOBJ `read_OBJ()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsSTL `read_STL()` \endlink</td>
@@ -393,7 +393,7 @@ their indices per face (i.e a vector of 3 integers represent a triangle face).
     </tr>
     <tr>
       <td>Output</td>
-      <td>`write_polygon_soup()`</td>
+      <td>`CGAL::IO::write_polygon_soup()`</td>
       <td>\link PkgStreamSupportIoFuncsOFF `write_OFF()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsOBJ `write_OBJ()` \endlink</td>
       <td>\link PkgStreamSupportIoFuncsSTL `write_STL()` \endlink</td>
@@ -424,7 +424,7 @@ The table above only lists the functions that work with any polygon mesh.
     </tr>
     <tr>
       <td>Input</td>
-      <td>`read_polygon_mesh()`</td>
+      <td>`CGAL::IO::read_polygon_mesh()`</td>
       <td>`read_OFF()`</td>
       <td>`read_STL()`</td>
       <td>`read_VTP()`</td>
@@ -434,7 +434,7 @@ The table above only lists the functions that work with any polygon mesh.
     </tr>
     <tr>
       <td>Output</td>
-      <td>`write_polygon_mesh()`</td>
+      <td>``CGAL::IO::write_polygon_mesh()`</td>
       <td>`write_OFF()`</td>
       <td>`write_STL()`</td>
       <td>`write_VTP()`</td>
@@ -478,17 +478,17 @@ from the standard \cgal I/O functions.
 </tr>
 <tr>
 <td>Input</td>
-<td>read_WKT()</td>
-<td>read_multi_point_WKT()</td>
-<td>read_multi_linestring_WKT()</td>
-<td>read_multi_polygon_WKT()</td>
+<td>`CGAL::IO::read_WKT()`</td>
+<td>`CGAL::IO::read_multi_point_WKT()`</td>
+<td>`CGAL::IO::read_multi_linestring_WKT()`</td>
+<td>`CGAL::IO::read_multi_polygon_WKT()`</td>
 </tr>
 <tr>
 <td>Output</td>
 <td><center> - </center></td>
-<td>write_multi_point_WKT()</td>
-<td>write_multi_linestring_WKT()</td>
-<td>write_multi_polygon_WKT()</td>
+<td>`CGAL::IO::write_multi_point_WKT()`</td>
+<td>`CGAL::IO::write_multi_linestring_WKT()`</td>
+<td>`CGAL::IO::write_multi_polygon_WKT()`</td>
 </tr>
 </table>
 

From fd8e6372c7b1e061b2288c39e7281adeafaec51a Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 13 Dec 2023 09:31:25 +0000
Subject: [PATCH 1171/1398] Add CGAL::IO:: for linking

---
 .../doc/Stream_support/IOstream.txt           | 84 +++++++++----------
 1 file changed, 42 insertions(+), 42 deletions(-)

diff --git a/Stream_support/doc/Stream_support/IOstream.txt b/Stream_support/doc/Stream_support/IOstream.txt
index cc299f2540ab..967ef41097f5 100644
--- a/Stream_support/doc/Stream_support/IOstream.txt
+++ b/Stream_support/doc/Stream_support/IOstream.txt
@@ -305,18 +305,18 @@ The following table shows which file formats can be read from and written for po
     <tr>
       <td>Input</td>
       <td>`read_points()`</td>
-      <td>\link PkgPointSetProcessing3IOOff `read_OFF()` \endlink</td>
-      <td>\link PkgPointSetProcessing3IOXyz `read_XYZ()` \endlink</td>
-      <td>\link PkgPointSetProcessing3IOPly `read_PLY()` \endlink</td>
-      <td>\link PkgPointSetProcessing3IOLas `read_LAS()` \endlink</td>
+      <td>\link PkgPointSetProcessing3IOOff `CGAL::IO::read_OFF()` \endlink</td>
+      <td>\link PkgPointSetProcessing3IOXyz `GAL::IO::read_XYZ()` \endlink</td>
+      <td>\link PkgPointSetProcessing3IOPly `GAL::IO::read_PLY()` \endlink</td>
+      <td>\link PkgPointSetProcessing3IOLas `GAL::IO::read_LAS()` \endlink</td>
     </tr>
     <tr>
       <td>Output</td>
       <td>`write_points()`</td>
-      <td>\link PkgPointSetProcessing3IOOff `write_OFF()` \endlink</td>
-      <td>\link PkgPointSetProcessing3IOXyz `write_XYZ()` \endlink</td>
-      <td>\link PkgPointSetProcessing3IOPly `write_PLY()` \endlink</td>
-      <td>\link PkgPointSetProcessing3IOLas `write_LAS()` \endlink</td>
+      <td>\link PkgPointSetProcessing3IOOff `GAL::IO::write_OFF()` \endlink</td>
+      <td>\link PkgPointSetProcessing3IOXyz `GAL::IO::write_XYZ()` \endlink</td>
+      <td>\link PkgPointSetProcessing3IOPly `GAL::IO::write_PLY()` \endlink</td>
+      <td>\link PkgPointSetProcessing3IOLas `GAL::IO::write_LAS()` \endlink</td>
     </tr>
 </table>
 
@@ -346,18 +346,18 @@ The file formats supported for `CGAL::Point_set_3` are detailed in the table bel
     <tr>
       <td>Input</td>
       <td>`CGAL::IO::read_point_set()`</td>
-      <td>\link PkgPointSet3IOOFF `read_OFF()` \endlink</td>
-      <td>\link PkgPointSet3IOXYZ `read_XYZ()` \endlink</td>
-      <td>\link PkgPointSet3IOPLY `read_PLY()` \endlink</td>
-      <td>\link PkgPointSet3IOLAS `read_LAS()` \endlink</td>
+      <td>\link PkgPointSet3IOOFF `GAL::IO::read_OFF()` \endlink</td>
+      <td>\link PkgPointSet3IOXYZ `GAL::IO::read_XYZ()` \endlink</td>
+      <td>\link PkgPointSet3IOPLY `GAL::IO::read_PLY()` \endlink</td>
+      <td>\link PkgPointSet3IOLAS `GAL::IO::read_LAS()` \endlink</td>
     </tr>
     <tr>
       <td>Output</td>
       <td>`CGAL::IO::write_point_set()`</td>
-      <td>\link PkgPointSet3IOOFF `write_OFF()` \endlink</td>
-      <td>\link PkgPointSet3IOXYZ `write_XYZ()` \endlink</td>
-      <td>\link PkgPointSet3IOPLY `write_PLY()` \endlink</td>
-      <td>\link PkgPointSet3IOLAS `write_LAS()` \endlink</td>
+      <td>\link PkgPointSet3IOOFF `GAL::IO::write_OFF()` \endlink</td>
+      <td>\link PkgPointSet3IOXYZ `GAL::IO::write_XYZ()` \endlink</td>
+      <td>\link PkgPointSet3IOPLY `GAL::IO::write_PLY()` \endlink</td>
+      <td>\link PkgPointSet3IOLAS `GAL::IO::write_LAS()` \endlink</td>
     </tr>
 </table>
 
@@ -382,26 +382,26 @@ their indices per face (i.e a vector of 3 integers represent a triangle face).
     <tr>
       <td>Input</td>
       <td>`CGAL::IO::read_polygon_soup()`</td>
-      <td>\link PkgStreamSupportIoFuncsOFF `read_OFF()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsOBJ `read_OBJ()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsSTL `read_STL()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsPLY `read_PLY()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsVTK `read_VTP()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsGOCAD `read_GOCAD()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsWKT `read_WKT()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncs3MF `read_3MF()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsOFF `GAL::IO::read_OFF()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsOBJ `GAL::IO::read_OBJ()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsSTL `GAL::IO::read_STL()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsPLY `GAL::IO::read_PLY()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsVTK `GAL::IO::read_VTP()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsGOCAD `GAL::IO::read_GOCAD()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsWKT `GAL::IO::read_WKT()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncs3MF `GAL::IO::read_3MF()` \endlink</td>
     </tr>
     <tr>
       <td>Output</td>
       <td>`CGAL::IO::write_polygon_soup()`</td>
-      <td>\link PkgStreamSupportIoFuncsOFF `write_OFF()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsOBJ `write_OBJ()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsSTL `write_STL()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsPLY `write_PLY()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsVTK `write_VTP()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsGOCAD `write_GOCAD()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncsWKT `write_WKT()` \endlink</td>
-      <td>\link PkgStreamSupportIoFuncs3MF `write_3MF()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsOFF `GAL::IO::write_OFF()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsOBJ `GAL::IO::write_OBJ()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsSTL `GAL::IO::write_STL()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsPLY `GAL::IO::write_PLY()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsVTK `GAL::IO::write_VTP()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsGOCAD `GAL::IO::write_GOCAD()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncsWKT `GAL::IO::write_WKT()` \endlink</td>
+      <td>\link PkgStreamSupportIoFuncs3MF `GAL::IO::write_3MF()` \endlink</td>
     </tr>
 </table>
 
@@ -425,21 +425,21 @@ The table above only lists the functions that work with any polygon mesh.
     <tr>
       <td>Input</td>
       <td>`CGAL::IO::read_polygon_mesh()`</td>
-      <td>`read_OFF()`</td>
-      <td>`read_STL()`</td>
-      <td>`read_VTP()`</td>
-      <td>`read_OBJ()`</td>
-      <td>`read_GOCAD()`</td>
+      <td>`CGAL::IO::read_OFF()`</td>
+      <td>`CGAL::IO::read_STL()`</td>
+      <td>`CGAL::IO::read_VTP()`</td>
+      <td>`CGAL::IO::read_OBJ()`</td>
+      <td>`CGAL::IO::read_GOCAD()`</td>
       <td><center> - </center></td>
     </tr>
     <tr>
       <td>Output</td>
       <td>``CGAL::IO::write_polygon_mesh()`</td>
-      <td>`write_OFF()`</td>
-      <td>`write_STL()`</td>
-      <td>`write_VTP()`</td>
-      <td>`write_OBJ()`</td>
-      <td>`write_GOCAD()`</td>
+      <td>`CGAL::IO::write_OFF()`</td>
+      <td>`CGAL::IO::write_STL()`</td>
+      <td>`CGAL::IO::write_VTP()`</td>
+      <td>`CGAL::IO::write_OBJ()`</td>
+      <td>`CGAL::IO::write_GOCAD()`</td>
       <td>`write_WRL()`</td>
     </tr>
 </table>

From 2713fe3c41c5afbbcf2315622f46ae902af8c405 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 13 Dec 2023 10:00:44 +0000
Subject: [PATCH 1172/1398] give \link a try for linking

---
 Stream_support/doc/Stream_support/IOstream.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Stream_support/doc/Stream_support/IOstream.txt b/Stream_support/doc/Stream_support/IOstream.txt
index 967ef41097f5..b868f7facb28 100644
--- a/Stream_support/doc/Stream_support/IOstream.txt
+++ b/Stream_support/doc/Stream_support/IOstream.txt
@@ -440,7 +440,7 @@ The table above only lists the functions that work with any polygon mesh.
       <td>`CGAL::IO::write_VTP()`</td>
       <td>`CGAL::IO::write_OBJ()`</td>
       <td>`CGAL::IO::write_GOCAD()`</td>
-      <td>`write_WRL()`</td>
+      <td>\link CGAL::IO::write_WRL() `write_WRL()`\endlink</td>
     </tr>
 </table>
 

From b1195233fae1532c0d0f222b7de7c8fb0a4a26ce Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 13 Dec 2023 10:45:08 +0000
Subject: [PATCH 1173/1398] Add CGAL::IO:: for linking

---
 Stream_support/doc/Stream_support/IOstream.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Stream_support/doc/Stream_support/IOstream.txt b/Stream_support/doc/Stream_support/IOstream.txt
index b868f7facb28..fb4d9fe8afae 100644
--- a/Stream_support/doc/Stream_support/IOstream.txt
+++ b/Stream_support/doc/Stream_support/IOstream.txt
@@ -440,7 +440,7 @@ The table above only lists the functions that work with any polygon mesh.
       <td>`CGAL::IO::write_VTP()`</td>
       <td>`CGAL::IO::write_OBJ()`</td>
       <td>`CGAL::IO::write_GOCAD()`</td>
-      <td>\link CGAL::IO::write_WRL() `write_WRL()`\endlink</td>
+      <td>`CGAL::IO::write_WRL()`</td>
     </tr>
 </table>
 

From 615850c4a6e4fa580671955a5da341998d80bd59 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 13 Dec 2023 13:41:51 +0200
Subject: [PATCH 1174/1398] Cleaned up

---
 .../CGAL/Aos_observer.h                       | 145 ++++++++++--------
 .../CGAL/Arr_observer.h                       |   7 +-
 .../include/CGAL/Aos_observer.h               |  30 ++--
 .../include/CGAL/Arr_observer.h               |   3 +-
 4 files changed, 97 insertions(+), 88 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
index 5b99967ba770..eb3efa4af84a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
@@ -6,7 +6,7 @@ namespace CGAL {
  *
  * `Aos_observer` serves as an abstract base class for all observer classes that
  * are attached to an arrangement instance of type `Arrangement` and receive
- * notifications from the arrangement.  This base class handles the attachment
+ * notifications from the arrangement. This base class handles the attachment
  * of the observer to a given arrangement instance or to the detachment of the
  * observer from this arrangement instance. It also gives a default empty
  * implementation to all notification functions that are invoked by the
@@ -27,22 +27,22 @@ class Aos_observer {
   /// \name Types
   /// @{
 
-  /*! the type of the associated arrangement. */
+  //! the type of the associated arrangement.
   typedef unspecified_type Arrangement_2;
 
-  /*! the point type. */
+  //! the point type.
   typedef typename Arrangement_2::Point_2 Point_2;
 
-  /*! the \f$ x\f$-monotone curve type. */
+  //! the \f$x\f$-monotone curve type.
   typedef typename Arrangement_2::X_monotone_curve_2 X_monotone_curve_2;
 
-  /*! */
+  //! the type of a handle to an arrangement vertex.
   typedef typename Arrangement_2::Vertex_handle Vertex_handle;
 
-  /*! */
+  //! the type of a handle to an arrangement halfedge.
   typedef typename Arrangement_2::Halfedge_handle Halfedge_handle;
 
-  /*! */
+  //! the type of a handle to an arrangement face.
   typedef typename Arrangement_2::Face_handle Face_handle;
 
   /*! represents a connected component of the boundary (CCB), either an outer
@@ -77,13 +77,13 @@ class Aos_observer {
   /// \name Notifications on Global Arrangement Operations
   /// @{
 
-  /*! issued just before the attached arrangement is assigned with the contents of
-   * another arrangement `arr`.
+  /*! issued just before the attached arrangement is assigned with the contents
+   * of another arrangement `arr`.
    */
   virtual void before_assign(const Arrangement_2& arr);
 
-  /*! issued immediately after the attached arrangement has been assigned with the
-   * contents of another arrangement.
+  /*! issued immediately after the attached arrangement has been assigned with
+   * the contents of another arrangement.
    */
   virtual void after_assign();
 
@@ -97,8 +97,8 @@ class Aos_observer {
 
   /*! issued just before a global function starts to modify the attached
    * arrangement. It is guaranteed that no queries (especially no point-location
-   * queries) are issued until the termination of the global function is indicated
-   * by `after_global_change()`.
+   * queries) are issued until the termination of the global function is
+   * indicated by `after_global_change()`.
    */
   virtual void before_global_change();
 
@@ -115,6 +115,7 @@ class Aos_observer {
 
   /*! issued just before the observer is attached to the arrangement instance
    * `arr`.
+   * \param arr The arrangement that is about to attach the observer.
    */
   virtual void before_attach(const Arrangement_2& arr);
 
@@ -127,8 +128,8 @@ class Aos_observer {
    */
   virtual void before_detach();
 
-  /*! issued immediately after the observer has been detached from its arrangement
-   * instance.
+  /*! issued immediately after the observer has been detached from its
+   * arrangement instance.
    */
   virtual void after_detach();
 
@@ -142,34 +143,35 @@ class Aos_observer {
    */
   virtual void before_create_vertex(const Point_2& p);
 
-  /*! issued immediately after a new vertex `v` has been created.  Note that the
+  /*! issued immediately after a new vertex `v` has been created. Note that the
    * vertex still has no incident edges and is not connected to any other vertex.
    */
   virtual void after_create_vertex(Vertex_handle v);
 
   /*! issued just before a new vertex at infinity is created, `cv` is the curve
-   * incident to the surface boundary, `ind` is the relevant curve-end, `ps_x` is
-   * the boundary condition of the vertex in \f$ x\f$ and `ps_y` is the boundary
-   * condition of the vertex in \f$ y\f$.
+   * incident to the surface boundary, `ind` is the relevant curve-end, `ps_x`
+   * is the boundary condition of the vertex in \f$x\f$ and `ps_y` is the
+   * boundary condition of the vertex in \f$y\f$.
    */
   virtual void before_create_boundary_vertex(const X_monotone_curve_2& cv,
                                              Arr_curve_end ind,
                                              Arr_parameter_space ps_x,
                                              Arr_parameter_space ps_y);
 
-  /*! issued immediately after a new vertex `v` has been created.  Note that the
+  /*! issued immediately after a new vertex `v` has been created. Note that the
    * vertex still has no incident edges and is not connected to any other vertex.
    */
   virtual void after_create_boundary_vertex(Vertex_handle v);
 
-  /*! issued just before a new edge that corresponds to the \f$ x\f$-monotone
+  /*! issued just before a new edge that corresponds to the \f$x\f$-monotone
    * curve `c` and connects the vertices `v1` and `v2` is created.
    */
   virtual void before_create_edge(const X_monotone_curve_2& c,
                                   Vertex_handle v1, Vertex_handle v2);
 
-  /*! issued immediately after a new edge `e` has been created.  The halfedge that
-   * is sent to this function is always directed from `v1` to `v2` (see above).
+  /*! issued immediately after a new edge `e` has been created. The halfedge
+   * that is sent to this function is always directed from `v1` to `v2` (see
+   * `before_create_edge()`).
    */
   virtual void after_create_edge(Halfedge_handle e);
 
@@ -181,16 +183,17 @@ class Aos_observer {
   /*! issued immediately after an existing vertex `v` has been modified. */
   virtual void after_modify_vertex(Vertex_handle v);
 
-  /*! issued just before an edge `e` is modified to be associated with the \f$
-   * x\f$-monotone curve `c`.
+  /*! issued just before an edge `e` is modified to be associated with the
+   * \f$x\f$-monotone curve `c`.
    */
-  virtual void before_modify_edge(Halfedge_handle e, const X_monotone_curve_2& c);
+  virtual void before_modify_edge(Halfedge_handle e,
+                                  const X_monotone_curve_2& c);
 
   /*! issued immediately after an existing edge `e` has been modified. */
   virtual void after_modify_edge(Halfedge_handle e);
 
   /*! issued just before an edge `e` is split into two edges that should be
-   * associated with the \f$ x\f$-monotone curves `c1` and `c2`. The vertex `v`
+   * associated with the \f$x\f$-monotone curves `c1` and `c2`. The vertex `v`
    * corresponds to the split point, and will be used to separate the two
    * resulting edges.
    */
@@ -198,76 +201,77 @@ class Aos_observer {
                                  const X_monotone_curve_2& c1,
                                  const X_monotone_curve_2& c2);
 
-  /*! issued immediately after an existing edge has been split into the two given
-   * edges `e1` and `e2`.
+  /*! issued immediately after an existing edge has been split into the two
+   * given edges `e1` and `e2`.
    */
   virtual void after_split_edge(Halfedge_handle e1, Halfedge_handle e2);
 
   /*! issued just before a fictitious edge `e` is split into two. The vertex at
-   * infinity `v` corresponds to the split point, and will be used to separate the
-   * two resulting edges.
+   * infinity `v` corresponds to the split point, and will be used to separate
+   * the two resulting edges.
    */
   virtual void before_split_fictitious_edge(Halfedge_handle e, Vertex_handle v);
 
-  /*! issued immediately after an existing fictitious edge has been split into the
-   * two given fictitious edges `e1` and `e2`.
+  /*! issued immediately after an existing fictitious edge has been split into
+   * the two given fictitious edges `e1` and `e2`.
    */
-  virtual void after_split_fictitious_edge(Halfedge_handle e1, Halfedge_handle e2);
+  virtual void after_split_fictitious_edge(Halfedge_handle e1,
+                                           Halfedge_handle e2);
 
   /*! issued just before a face `f` is split into two, as a result of the
    * insertion of the edge `e` into the arrangement.
    */
   virtual void before_split_face(Face_handle f, Halfedge_handle e);
 
-  /*! issued immediately after the existing face `f1` has been split, such that a
-   * portion of it now forms a new face `f2`. The flag `is_hole` designates
+  /*! issued immediately after the existing face `f1` has been split, such that
+   * a portion of it now forms a new face `f2`. The flag `is_hole` designates
    * whether `f2` forms a hole (an inner CCB) inside `f1`.
    */
   virtual void after_split_face(Face_handle f1, Face_handle f2, bool is_hole);
 
-  /*! issued just before outer ccb `h` inside a face `f` is split into two, as a
+  /*! issued just before outer CCB `h` inside a face `f` is split into two, as a
    * result of the removal of the edge `e` from the arrangement.
    */
   virtual void before_split_outer_ccb(Face_handle f, Ccb_halfedge_circulator h,
                                       Halfedge_handle e);
 
-  /*! issued immediately after an outer ccb of the face `f` has been split,
+  /*! issued immediately after an outer CCB of the face `f` has been split,
    * resulting in the two holes `h1` and `h2`.
    */
   virtual void after_split_outer_ccb(Face_handle f,
                                      Ccb_halfedge_circulator h1,
                                      Ccb_halfedge_circulator h2);
 
-  /*! issued just before an inner ccb `h` inside a face `f` is split into two, as
-   * a result of the removal of the edge `e` from the arrangement.
+  /*! issued just before an inner CCB `h` inside a face `f` is split into two,
+   * as a result of the removal of the edge `e` from the arrangement.
    */
   virtual void before_split_inner_ccb(Face_handle f, Ccb_halfedge_circulator h,
                                       Halfedge_handle e);
 
-  /*! issued immediately after an inner ccb of the face `f` has been split,
+  /*! issued immediately after an inner CCB of the face `f` has been split,
    * resulting in the two inner CCBs (holes) `h1` and `h2`.
    */
   virtual void after_split_inner_ccb(Face_handle f,
                                      Ccb_halfedge_circulator h1,
                                      Ccb_halfedge_circulator h2);
 
-  /*! issued just before the edge `e` is inserted as a new outer ccb inside the
+  /*! issued just before the edge `e` is inserted as a new outer CCB inside the
    * face `f`.
    */
   virtual void before_add_outer_ccb(Face_handle f, Halfedge_handle e);
 
-  /*! issued immediately after a new outer ccb `h` has been created. The outer ccb
-   * always consists of a single pair of twin halfedges.
+  /*! issued immediately after a new outer ccb `h` has been created. The outer
+   * ccb always consists of a single pair of twin halfedges.
    */
   virtual void after_add_outer_ccb(Ccb_halfedge_circulator h);
 
-  /*! issued just before the edge `e` is inserted as a new inner ccb inside the
+  /*! issued just before the edge `e` is inserted as a new inner CCB inside the
    * face `f`.
    */
   virtual void before_add_inner_ccb(Face_handle f, Halfedge_handle e);
 
-  /*! issued immediately after a new inner ccb `h` has been created. The inner ccb
-   * always consists of a single pair of twin halfedges.
+  /*! issued immediately after a new inner CCB `h` has been created. The inner
+   * CCB always consists of a single pair of twin halfedges.
    */
   virtual void after_add_inner_ccb(Ccb_halfedge_circulator h);
 
@@ -281,16 +285,17 @@ class Aos_observer {
   virtual void after_add_isolated_vertex(Vertex_handle v);
 
   /*! issued just before the two edges `e1` and `e2` are merged to form a single
-   * edge that will be associated with the \f$ x\f$-monotone curve `c`.
+   * edge that will be associated with the \f$x\f$-monotone curve `c`.
    */
   virtual void before_merge_edge(Halfedge_handle e1, Halfedge_handle e2,
                                  const X_monotone_curve_2& c);
 
-  /*! issued immediately after two edges have been merged to form the edge `e`. */
+  /*! issued immediately after two edges have been merged to form the edge `e`.
+   */
   virtual void after_merge_edge(Halfedge_handle e);
 
-  /*! issued just before the two fictitious edges `e1` and `e2` are merged to form
-   * a single fictitious edge.
+  /*! issued just before the two fictitious edges `e1` and `e2` are merged to
+   * form a single fictitious edge.
    */
   virtual void before_merge_fictitious_edge(Halfedge_handle e1,
                                             Halfedge_handle e2);
@@ -306,7 +311,8 @@ class Aos_observer {
   virtual void before_merge_face(Face_handle f1, Face_handle f2,
                                  Halfedge_handle e);
 
-  /*! issued immediately after two faces have been merged to form the face `f`. */
+  /*! issued immediately after two faces have been merged to form the face `f`.
+   */
   virtual void after_merge_face(Face_handle f);
 
   /*! issued just before two outer ccbs `h1` and `h2` inside the face `f` are
@@ -318,12 +324,12 @@ class Aos_observer {
                                       Ccb_halfedge_circulator h2,
                                       Halfedge_handle e);
 
-  /*! issued immediately after two outer ccbs have been merged to form a single
-   * outer ccb `h` inside the face `f`.
+  /*! issued immediately after two outer cCBs have been merged to form a single
+   * outer CCB `h` inside the face `f`.
    */
   virtual void after_merge_outer_ccb(Face_handle f, Ccb_halfedge_circulator h);
 
-  /*! issued just before two inner ccbs `h1` and `h2` inside the face `f` are
+  /*! issued just before two inner CCBs `h1` and `h2` inside the face `f` are
    * merged to form a single connected component, following the insertion of the
    * edge `e` into the arrangement.
    */
@@ -332,33 +338,35 @@ class Aos_observer {
                                       Ccb_halfedge_circulator h2,
                                       Halfedge_handle e);
 
-  /*! issued immediately after two inner ccbs have been merged to form a single
-   * inner ccb `h` inside the face `f`.
+  /*! issued immediately after two inner CCBs have been merged to form a single
+   * inner CCB `h` inside the face `f`.
    */
   virtual void after_merge_inner_ccb(Face_handle f, Ccb_halfedge_circulator h);
 
-  /*! issued just before the outer ccb `h` is moved from one face to another.
-   * This can happen if the face `to_f` containing the outer ccb has just been
+  /*! issued just before the outer CCB `h` is moved from one face to another.
+   * This can happen if the face `to_f` containing the outer CCB has just been
    * split from `from_f`.
    */
   virtual void before_move_outer_ccb(Face_handle from_f, Face_handle to_f,
                                      Ccb_halfedge_circulator h);
 
-  /*! issued immediately after the outer ccb `h` has been moved to a new face. */
+  /*! issued immediately after the outer CCB `h` has been moved to a new face.
+   */
   virtual void after_move_outer_ccb(Ccb_halfedge_circulator h);
 
-  /*! issued just before the inner ccb `h` is moved from one face to another.
-   * This can happen if the face `to_f` containing the inner ccb has just been
+  /*! issued just before the inner CCB `h` is moved from one face to another.
+   * This can happen if the face `to_f` containing the inner CCB has just been
    * split from `from_f`.
    */
   virtual void before_move_inner_ccb(Face_handle from_f, Face_handle to_f,
                                      Ccb_halfedge_circulator h);
 
-  /*! issued immediately after the inner ccb `h` has been moved to a new face. */
+  /*! issued immediately after the inner CCB `h` has been moved to a new face.
+   */
   virtual void after_move_inner_ccb(Ccb_halfedge_circulator h);
 
   /*! issued just before the isolated vertex `v` is moved from one face to
-   * another.  This can happen if the face `to_f` containing the isolated vertex
+   * another. This can happen if the face `to_f` containing the isolated vertex
    * has just been split from `from_f`.
    */
   virtual void before_move_isolated_vertex(Face_handle from_f,
@@ -385,20 +393,21 @@ class Aos_observer {
    */
   virtual void after_remove_edge();
 
-  /*! issued just before the outer ccb `f` is removed from inside the face `f`. */
+  /*! issued just before the outer ccb `f` is removed from inside the face `f`.
+   */
   virtual void before_remove_outer_ccb(Face_handle f, Ccb_halfedge_circulator h);
 
-  /*! issued immediately after a outer ccb has been removed (and deleted) from
+  /*! issued immediately after a outer CCB has been removed (and deleted) from
    * inside the face `f`.
    */
   virtual void after_remove_outer_ccb(Face_handle f);
 
-  /*! issued just before the inner ccb `f` is removed from inside the face `f`.
+  /*! issued just before the inner CCB `f` is removed from inside the face `f`.
    */
   virtual void before_remove_inner_ccb(Face_handle f,
                                        Ccb_halfedge_circulator h);
 
-  /*! issued immediately after a inner ccb has been removed (and deleted) from
+  /*! issued immediately after a inner CCB has been removed (and deleted) from
    * inside the face `f`.
    */
   virtual void after_remove_inner_ccb(Face_handle f);
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
index d3870fc69ea8..2c41b89f7a8e 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
@@ -5,9 +5,10 @@ namespace CGAL {
  *
  * \anchor arr_refarr_obs
  *
- * `Arr_observer<Arrangement_2>` is an alias for Aos_observer<Arrangement_on_surface_2>`,
- * where `Arrangement_2` derives from `Arrangement_on_surface_2` and the latter is an
- * instance of the template
+ * `Arr_observer<Arrangement_2>` is an alias for
+ * Aos_observer<Arrangement_on_surface_2>`,
+ * where `Arrangement_2` derives from `Arrangement_on_surface_2` and the latter
+ * is an instance of the template
  * `CGAL::Arrangement_on_surface_2<GeometryTraits, TopologyTraits>`.
  */
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Aos_observer.h b/Arrangement_on_surface_2/include/CGAL/Aos_observer.h
index d74034640e25..6f918138c666 100644
--- a/Arrangement_on_surface_2/include/CGAL/Aos_observer.h
+++ b/Arrangement_on_surface_2/include/CGAL/Aos_observer.h
@@ -21,7 +21,7 @@
 #include <CGAL/Arr_enums.h>
 
 /*! \file
- * Definition of the Aos_observer<Arrangement> base class.
+ * Definition of the `Aos_observer<Arrangement>` base class.
  */
 
 namespace CGAL {
@@ -31,8 +31,7 @@ namespace CGAL {
  * The Arrangement parameter corresponds to an arrangement instantiation.
  */
 template <typename Arrangement_>
-class Aos_observer
-{
+class Aos_observer {
 public:
   typedef Arrangement_                                     Arrangement_2;
   typedef Aos_observer<Arrangement_2>                      Self;
@@ -44,7 +43,7 @@ class Aos_observer
   typedef typename Arrangement_2::Halfedge_handle          Halfedge_handle;
   typedef typename Arrangement_2::Face_handle              Face_handle;
   typedef typename Arrangement_2::Ccb_halfedge_circulator
-                                                      Ccb_halfedge_circulator;
+    Ccb_halfedge_circulator;
 
 private:
   Arrangement_2* p_arr;           // The associated arrangement.
@@ -81,7 +80,7 @@ class Aos_observer
   /// \name Modifying the associated arrangement.
   //@{
 
-  /*! Get the associated arrangement (non-const version). */
+  /*! Get the associated arrangement (const version). */
   const Arrangement_2* arrangement() const { return (p_arr); }
 
   /*! Get the associated arrangement (non-const version). */
@@ -160,7 +159,7 @@ class Aos_observer
   //@{
 
   /*! Notification before the observer is attached to an arrangement.
-   * \param arr The arrangement we are about to attach the observer to.
+   * \param arr The arrangement that is about to attach the observer.
    */
   virtual void before_attach(const Arrangement_2& /* arr */) {}
 
@@ -170,17 +169,16 @@ class Aos_observer
   /*! Notification before the observer is detached from the arrangement. */
   virtual void before_detach() {}
 
-  /*! Notification after the observer has been detached to the arrangement. */
+  /*! Notification after the observer has been detached from the arrangement. */
   virtual void after_detach() {}
   //@}
 
   /// \name Notification functions on local changes in the arrangement.
   //@{
 
-  /*!
-   * Notification before the creation of a new vertex.
+  /*! Notification before the creation of a new vertex.
    * \param p The point to be associated with the vertex.
-   *          This point cannot lies on the surface boundaries.
+   *          This point cannot lie on the surface boundaries.
    */
   virtual void before_create_vertex(const Point_2& /* p */) {}
 
@@ -191,7 +189,7 @@ class Aos_observer
   {}
 
   /*! Notification before the creation of a new boundary vertex.
-   * \param p The on the surface boundary.
+   * \param p The point on the surface boundary.
    * \param ps_x The boundary condition of the vertex in x.
    * \param ps_y The boundary condition of the vertex in y.
    */
@@ -218,7 +216,7 @@ class Aos_observer
   virtual void after_create_boundary_vertex(Vertex_handle /* v */) {}
 
   /*! Notification before the creation of a new edge.
-   * \param c The x-monotone curve to be associated with the edge.
+   * \param c The \f$x\f$-monotone curve to be associated with the edge.
    * \param v1 A handle to the first end-vertex of the edge.
    * \param v2 A handle to the second end-vertex of the edge.
    */
@@ -247,7 +245,7 @@ class Aos_observer
 
   /*! Notification before the modification of an existing edge.
    * \param e A handle to one of the twin halfedges to be updated.
-   * \param c The x-monotone curve to be associated with the edge.
+   * \param c The \f$x\f$-monotone curve to be associated with the edge.
    */
   virtual void before_modify_edge(Halfedge_handle /* e */,
                                   const X_monotone_curve_2& /* c */)
@@ -261,8 +259,8 @@ class Aos_observer
   /*! Notification before the splitting of an edge into two.
    * \param e A handle to one of the existing halfedges.
    * \param v A vertex representing the split point.
-   * \param c1 The x-monotone curve to be associated with the first edge.
-   * \param c2 The x-monotone curve to be associated with the second edge.
+   * \param c1 The \f$x\f$-monotone curve to be associated with the first edge.
+   * \param c2 The \f$x\f$-monotone curve to be associated with the second edge.
    */
   virtual void before_split_edge(Halfedge_handle /* e */,
                                  Vertex_handle /* v */,
@@ -394,7 +392,7 @@ class Aos_observer
   /*! Notification before the merging of two edges.
    * \param e1 A handle to one of the halfedges forming the first edge.
    * \param e2 A handle to one of the halfedges forming the second edge.
-   * \param c The x-monotone curve to be associated with the merged edge.
+   * \param c The \f$x\f$-monotone curve to be associated with the merged edge.
    */
   virtual void before_merge_edge(Halfedge_handle /* e1 */,
                                  Halfedge_handle /* e2 */,
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_observer.h b/Arrangement_on_surface_2/include/CGAL/Arr_observer.h
index 092a1b55732a..1e0791ed05a9 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_observer.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_observer.h
@@ -14,7 +14,8 @@
 #define CGAL_ARR_OBSERVER_H
 
 /*! \file
- * Definition of the Arr_observer<Arrangement> base class mainly for backward compatibility.
+ * Definition of the `Arr_observer<Arrangement>` base class mainly for backward
+ * compatibility.
  */
 
 #include <CGAL/license/Arrangement_on_surface_2.h>

From 0ec51c5110c7640439b36837b12c6448377726cc Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 13 Dec 2023 13:49:14 +0200
Subject: [PATCH 1175/1398] Cleaned up

---
 .../doc/Arrangement_on_surface_2/CGAL/Arr_observer.h             | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
index 2c41b89f7a8e..a248556f6501 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
@@ -1,4 +1,3 @@
-// Copyright (c) 2023 Tel-Aviv University (Israel).
 namespace CGAL {
 
 /*! \ingroup PkgArrangementOnSurface2Ref

From eaa0091bfd1ac862ec7db9920d55191ed5e5215b Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 13 Dec 2023 15:42:44 +0200
Subject: [PATCH 1176/1398] Added an item that describes a fix in the 2D
 Arrangements package that has to do with observers

---
 Installation/CHANGES.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index d802f740b9b1..9dde0d222c3d 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -23,6 +23,8 @@ Release date: October 2023
     `std::variant`. The support for the old macro `CGAL_ARR_POINT_LOCATION_VERSION`
     has been removed.
 
+- Eliminated the error-prone c-type casting that was used to define observers. In general, backward compatibility was maintained; however, the former class template `Arr_observer` was replaced by an alias template. (The former class Arr_observer was renamed to Aos_observer).
+
 #### Envelopes of Surfaces in 3D
 - **Breaking change**: Construct_projected_boundary_2 in `EnvelopeTraits_3` is now using `std::variant` instead of `Object`
 

From c6a21e9f983c47895222fabb3937331eaf42cafb Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Thu, 14 Dec 2023 21:17:29 +0200
Subject: [PATCH 1177/1398] Fixed the definition of the memebrs
 before_assign(arr) before_attach(arr) of all observers (derived from
 Aos_observer)

---
 .../CGAL/Aos_observer.h                       | 16 +++++++++-----
 .../Arr_lm_generator_base.h                   | 16 +++++++-------
 .../Trapezoidal_decomposition_2.h             |  5 +++--
 .../CGAL/Arr_trapezoid_ric_point_location.h   | 21 ++++++++++++++-----
 .../include/CGAL/Arrangement_on_surface_2.h   |  3 ++-
 .../test_observer.cpp                         | 16 +++++++-------
 6 files changed, 49 insertions(+), 28 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
index eb3efa4af84a..2f21f4a886cc 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Aos_observer.h
@@ -77,10 +77,13 @@ class Aos_observer {
   /// \name Notifications on Global Arrangement Operations
   /// @{
 
-  /*! issued just before the attached arrangement is assigned with the contents
-   * of another arrangement `arr`.
+  /*! issued just before the attached arrangement is assigned with the contents of another
+   * arrangement.
+   * \param arr The other arrangement. Notice that the arrangement type is the type used to
+   *            instantiate the observer, which is conveniently defined as
+   *            `Arrangement_2::Base_aos`.
    */
-  virtual void before_assign(const Arrangement_2& arr);
+  virtual void before_assign(const typename Arrangement_2::Base_aos& arr);
 
   /*! issued immediately after the attached arrangement has been assigned with
    * the contents of another arrangement.
@@ -115,9 +118,12 @@ class Aos_observer {
 
   /*! issued just before the observer is attached to the arrangement instance
    * `arr`.
-   * \param arr The arrangement that is about to attach the observer.
+   * \param arr The arrangement that is about to attach the observer. Notice
+   *        that the arrangement type is the type used to instantiate the
+   *        observer, which is conveniently defined as
+   *        `Arrangement_2::Base_aos`.
    */
-  virtual void before_attach(const Arrangement_2& arr);
+  virtual void before_attach(const typename Arrangement_2::Base_aos& arr);
 
   /*! issued immediately after the observer has been attached to an arrangement
    * instance.
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h
index 07cf7520a133..5e573527334c 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h
@@ -45,7 +45,9 @@ template <typename Arrangement_,
             Arr_landmarks_nearest_neighbor<Arrangement_> >
 class Arr_landmarks_generator_base : public Arrangement_::Observer {
 public:
-  typedef Arrangement_                                Arrangement_2;
+  using Arrangement_2 = Arrangement_;
+  using Base_aos = typename Arrangement_2::Base_aos;
+
   typedef Nearest_neighbor_                           Nearest_neighbor;
 
   typedef typename Arrangement_2::Geometry_traits_2     Geometry_traits_2;
@@ -161,13 +163,13 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   /// \name Overloaded observer functions on global changes.
   //@{
 
-  /*!
-   * Notification before the arrangement is assigned with another
+  /*! Notification before the arrangement is assigned with the content of another
    * arrangement.
-   * \param arr The arrangement to be copied.
+   * \param arr The other arrangement. Notice that the arrangement type is the type used to
+   *            instantiate the observer, which is conveniently defined as
+   *            `Arrangement_2::Base_aos`.
    */
-  virtual void before_assign(const Arrangement_2& arr)
-  {
+  virtual void before_assign(const Base_aos& arr) {
     this->clear_landmark_set();
     m_traits = static_cast<const Traits_adaptor_2*>(arr.geometry_traits());
     m_ignore_notifications = true;
@@ -185,7 +187,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   /*! Notification before the observer is attached to an arrangement.
    * \param arr The arrangement we are about to attach the observer to.
    */
-  virtual void before_attach(const Arrangement_2& arr)
+  virtual void before_attach(const Base_aos& arr)
   {
     this->clear_landmark_set();
     m_traits = static_cast<const Traits_adaptor_2*>(arr.geometry_traits());
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
index 1a3549c0008c..82b554cb6a01 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Trapezoidal_decomposition_2.h
@@ -177,6 +177,7 @@ class Trapezoidal_decomposition_2
 
   //typedef of arrangement on surface
   typedef typename Traits::Arrangement_on_surface_2 Arrangement_on_surface_2;
+  using Base_aos = typename Arrangement_on_surface_2::Base_aos;
 
   //type of traits adaptor
   typedef typename Traits::Arrangement_on_surface_2::Traits_adaptor_2
@@ -1804,7 +1805,7 @@ class Trapezoidal_decomposition_2
     return m_number_of_curves;
   }
 
-  void init_arrangement_and_traits(const Arrangement_on_surface_2* arr,
+  void init_arrangement_and_traits(const Base_aos* arr,
                                    bool allocate_traits = true)
   {
     m_arr = arr;
@@ -2125,7 +2126,7 @@ class Trapezoidal_decomposition_2
   unsigned long m_number_of_curves;
   const Traits* traits;
   //Before_split_data m_before_split;
-  const Arrangement_on_surface_2* m_arr;
+  const Base_aos* m_arr;
   const Traits_adaptor_2* m_trts_adaptor;
 
   Halfedge_const_handle m_empty_he_handle;
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h
index d04136967bac..91739414dcb2 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h
@@ -38,7 +38,8 @@ template <typename Arrangement_>
 class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
 public:
   //type of arrangement on surface
-  typedef Arrangement_                          Arrangement_on_surface_2;
+  using Arrangement_on_surface_2 = Arrangement_;
+  using Base_aos = typename Arrangement_on_surface_2::Base_aos;
 
   //type of geometry traits
   typedef typename Arrangement_on_surface_2::Geometry_traits_2
@@ -238,8 +239,13 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
   //        base observer.
   //@{
 
-  virtual void before_assign (const Arrangement_on_surface_2& arr)
-  {
+  /*! Notification before the arrangement is assigned with the content of another
+   * arrangement.
+   * \param arr The other arrangement. Notice that the arrangement type is the type used to
+   *            instantiate the observer, which is conveniently defined as
+   *            `Arrangement_2::Base_aos`.
+   */
+  virtual void before_assign(const Base_aos& arr) {
     td.clear();
     m_traits = static_cast<const Traits_adaptor_2*> (arr.geometry_traits());
     td.init_arrangement_and_traits(&arr, false);
@@ -260,8 +266,13 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
     _construct_td();
   }
 
-  virtual void before_attach (const Arrangement_on_surface_2& arr)
-  {
+  /*! Notification before the observer is attached to an arrangement.
+   * \param arr The arrangement that is about to attach the observer. Notice
+   *        that the arrangement type is the type used to instantiate the
+   *        observer, which is conveniently defined as
+   *        `Arrangement_2::Base_aos`.
+   */
+  virtual void before_attach(const Base_aos& arr) {
     td.clear();
     m_traits = static_cast<const Traits_adaptor_2*> (arr.geometry_traits());
     td.init_arrangement_and_traits(&arr);
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
index 108600caec2f..92c3e9ba698f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
@@ -109,7 +109,8 @@ class Arrangement_on_surface_2 {
   typedef typename Topology_traits::Dcel            Dcel;
   typedef typename Dcel::Size                       Size;
 
-  typedef Aos_observer<Self>                        Observer;
+  using Observer = Aos_observer<Self>;
+  using Base_aos = Self;
 
 protected:
   friend class Aos_observer<Self>;
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
index bc03ddc09572..c095d9c25079 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
@@ -59,21 +59,21 @@ void compare_results(std::string str)
 class Test_observer : public Arrangement_2::Observer {
 
 public:
+  using Base_aos = typename Arrangement_2::Base_aos;
 
   Test_observer(Arrangement_2& arr) : Arrangement_2::Observer(arr) {}
 
   /// \name Notification functions on global arrangement operations.
   //@{
 
-  /*!
-   * Notification before the arrangement is assigned with another
+  /*! Notification before the arrangement is assigned with the content of another
    * arrangement.
-   * \param arr The arrangement to be copied.
+   * \param arr The other arrangement. Notice that the arrangement type is the type used to
+   *            instantiate the observer, which is conveniently defined as
+   *            `Arrangement_2::Base_aos`.
    */
-  virtual void before_assign (const Arrangement_2& /* arr */)
-  {
-    compare_results("before_assign");
-  }
+  virtual void before_assign (const Base_aos& /* arr */)
+  { compare_results("before_assign"); }
 
   /*!
    * Notification after the arrangement has been assigned with another
@@ -118,7 +118,7 @@ class Test_observer : public Arrangement_2::Observer {
    * Notification before the observer is attached to an arrangement.
    * \param arr The arrangement we are about to attach the observer to.
    */
-  virtual void before_attach (const Arrangement_2& /* arr */)
+  virtual void before_attach (const Base_aos& /* arr */)
   {
     compare_results("before_attach");
   }

From 5b66d54cb827fb983c58c8b57eb38c8eb457df57 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Fri, 15 Dec 2023 13:50:10 +0200
Subject: [PATCH 1178/1398] Used new conic construction interface

---
 .../test/Surface_sweep_2/test_sweep.cpp       | 25 ++++++++++---------
 1 file changed, 13 insertions(+), 12 deletions(-)

diff --git a/Surface_sweep_2/test/Surface_sweep_2/test_sweep.cpp b/Surface_sweep_2/test/Surface_sweep_2/test_sweep.cpp
index d44a2bbdd344..dc7851f621dc 100644
--- a/Surface_sweep_2/test/Surface_sweep_2/test_sweep.cpp
+++ b/Surface_sweep_2/test/Surface_sweep_2/test_sweep.cpp
@@ -222,9 +222,10 @@ bool read_xcurves(std::ifstream& inp, X_monotone_curves& xcurves,
 
 #elif CGAL_ARR_TEST_TRAITS == CGAL_CONIC_TRAITS
 
-void read_curve(std::ifstream& is, Curve_2& cv) {
+void read_curve(std::ifstream& is, Curve_2& cv, const Traits& traits) {
   // Read a line from the input file.
   char one_line[128];
+  auto ctr_curve_2 = traits.construct_curve_2_object();
 
   is >> skip_comment;
   is.getline(one_line, 128);
@@ -273,8 +274,8 @@ void read_curve(std::ifstream& is, Curve_2& cv) {
 
     if (type == 'f' || type == 'F') {
       // Create a full ellipse (or circle).
-      if (is_circle) cv = Curve_2 (circle);
-      else cv = Curve_2(r, s, t, u, v, w);
+      if (is_circle) cv = ctr_curve_2(circle);
+      else cv = ctr_curve_2(r, s, t, u, v, w);
     }
     else {
       // Read the endpointd of the arc.
@@ -286,8 +287,8 @@ void read_curve(std::ifstream& is, Curve_2& cv) {
       Point_2 target = Point_2(Algebraic(x2), Algebraic(y2));
 
         // Create the arc. Note that it is always clockwise oriented.
-      if (is_circle) cv = Curve_2(circle, CGAL::CLOCKWISE, source, target);
-      else cv = Curve_2(r, s, t, u, v, w, CGAL::CLOCKWISE, source, target);
+      if (is_circle) cv = ctr_curve_2(circle, CGAL::CLOCKWISE, source, target);
+      else cv = ctr_curve_2(r, s, t, u, v, w, CGAL::CLOCKWISE, source, target);
     }
   }
   else if (type == 's' || type == 'S') {
@@ -300,7 +301,7 @@ void read_curve(std::ifstream& is, Curve_2& cv) {
     Rat_point_2 source = Rat_point_2 (Rational(x1), Rational(y1));
     Rat_point_2 target = Rat_point_2 (Rational(x2), Rational(y2));
 
-    cv = Curve_2(Rat_segment_2 (source, target));
+    cv = ctr_curve_2(Rat_segment_2 (source, target));
   }
 
   // std::cout << cv << std::endl;
@@ -308,7 +309,7 @@ void read_curve(std::ifstream& is, Curve_2& cv) {
 
 /*! Read curves.
  */
-bool read_curves(std::ifstream& inp, Curves& curves, const Traits&) {
+bool read_curves(std::ifstream& inp, Curves& curves, const Traits& traits) {
   // auto ctr_cv = traits.construct_curve_2_object();
   int count;
   inp >> skip_comment >> count;
@@ -316,7 +317,7 @@ bool read_curves(std::ifstream& inp, Curves& curves, const Traits&) {
   char dummy[256];
   inp.getline(dummy, sizeof(dummy));
   for (int i = 0; i < count; ++i) {
-    read_curve(inp, cv);
+    read_curve(inp, cv, traits);
     curves.push_back(cv);
   }
   return true;
@@ -401,11 +402,11 @@ bool test_conic(std::ifstream& inp, Curves& curves,
                 const X_monotone_curves& curves_no_overlap_out,
                 const Points& points_with_ends_out,
                 const Points& points_no_ends_out,
-                const Traits&) {
-
-  CGAL::Bbox_2 bbox = curves.front().bbox();
+                const Traits& traits) {
+  auto ctr_bbox_2 = traits.construct_bbox_2_object();
+  CGAL::Bbox_2 bbox = ctr_bbox_2(curves.front());
   for (auto it = std::next(curves.begin()); it != curves.end(); ++it)
-    bbox = bbox + it->bbox();
+    bbox = bbox + ctr_bbox_2(*it);
 
   // generate the string for the output
   std::stringstream out1;

From 4fe88f8b4901b3c4429d95dbf1abb28c0d707a2f Mon Sep 17 00:00:00 2001
From: Sven Oesau <sven.oesau@geometryfactory.com>
Date: Mon, 18 Dec 2023 15:35:25 +0100
Subject: [PATCH 1179/1398] added transformation of normals

---
 .../Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp    | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
index 1a0a9e34f35e..d651bdcd61b6 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PCA/Affine_transform_plugin.cpp
@@ -614,12 +614,20 @@ endPointSet(const QMatrix4x4& transform_matrix)
   Point_set* new_ps = new_item->point_set();
   CGAL::qglviewer::Vec c = aff_transformed_item->center();
 
+  QMatrix3x3 normal_matrix = transform_matrix.normalMatrix();
+
   for(Point_set::Index idx : *new_ps)
   {
     QVector3D vec = transform_matrix.map(QVector3D(new_ps->point(idx).x() - c.x,
                                                    new_ps->point(idx).y() - c.y,
                                                    new_ps->point(idx).z() - c.z));
     new_ps->point(idx) = Kernel::Point_3(vec.x(), vec.y(), vec.z());
+    if (new_ps->has_normal_map()) {
+      QVector3D n(new_ps->normal(idx).x(), new_ps->normal(idx).y(), new_ps->normal(idx).z());
+      new_ps->normal(idx) = Kernel::Vector_3(normal_matrix(0, 0) * n[0] + normal_matrix(0, 1) * n[1] + normal_matrix(0, 2) * n[2],
+                                             normal_matrix(1, 0) * n[0] + normal_matrix(1, 1) * n[1] + normal_matrix(1, 2) * n[2],
+                                             normal_matrix(2, 0) * n[0] + normal_matrix(2, 1) * n[1] + normal_matrix(2, 2) * n[2]);
+    }
   }
 
   new_item->setName(aff_transformed_item->name());

From 6b90164b554e29e125b6934a857904fb3e4ea24e Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 20 Dec 2023 22:09:34 +0200
Subject: [PATCH 1180/1398] Fixed the types used in all arrangement observers

---
 .../CGAL/Arr_face_index_map.h                 | 106 ++-
 .../CGAL/Arr_triangulation_point_location.h   |   3 +-
 .../CGAL/Arr_vertex_index_map.h               | 106 ++-
 .../include/CGAL/Arr_face_index_map.h         | 181 ++---
 .../Arr_lm_generator_base.h                   | 158 ++--
 .../CGAL/Arr_trapezoid_ric_point_location.h   | 295 +++-----
 .../CGAL/Arr_triangulation_point_location.h   | 172 ++---
 .../include/CGAL/Arr_vertex_index_map.h       | 179 ++---
 .../Arrangement_on_surface_with_history_2.h   | 108 +--
 .../test_observer.cpp                         | 686 +++++++-----------
 .../Envelope_divide_and_conquer_3.h           |  60 +-
 .../Envelope_3/Envelope_element_visitor_3.h   | 246 +++----
 .../CGAL/Polygon_vertical_decomposition_2.h   |   7 +-
 .../CGAL/Triangular_expansion_visibility_2.h  | 112 +--
 14 files changed, 983 insertions(+), 1436 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h
index 4c48eb10207b..21f071f4596d 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_face_index_map.h
@@ -1,75 +1,69 @@
 namespace CGAL {
 
-/*!
-\ingroup PkgArrangementOnSurface2Ref
+  /*! \ingroup PkgArrangementOnSurface2Ref
+   *
+   * `Arr_face_index_map` maintains a mapping of face handles of an attached
+   * arrangement object to indices (of type `unsigned int`).  This class template
+   * is a model of the concept `ReadablePropertyMap`. A mapping between face
+   * handles and indices enables convenient usage of property-map classes supplied
+   * by `boost`.  For example, the property-map class templates
+   * `boost::vector_property_map`, which is based on `std::vector`, and
+   * `boost::iterator_property_map`, which can be used to implement a property map
+   * based on a native \CC array, require the user to supply a mapping such as
+   * `Arr_face_index_map`.
+   *
+   * As new faces might be inserted into the attached arrangement, and
+   * existing faces might be removed, the notification mechanism is used
+   * to dynamically maintain the mapping of face handles to indices.
+   *
+   * \cgalModels{DefaultConstructible,CopyConstructible,Assignable,ReadablePropertyMap}
+   *
+   * \sa `Arr_vertex_index_map<Arrangement>`
+   */
 
-`Arr_face_index_map` maintains a mapping of face handles of an
-attached arrangement object to indices (of type `unsigned int`).
-This class template is a model of the concept
-`ReadablePropertyMap`. A mapping between face handles and indices
-enables convenient usage of property-map classes supplied by `boost`.
-For example, the property-map class templates
-`boost::vector_property_map`, which is based on `std::vector`,
-and `boost::iterator_property_map`, which can be used to implement
-a property map based on a native \CC array, require the
-user to supply a mapping such as `Arr_face_index_map`.
+  template <typename Arrangement_>
+  class Arr_face_index_map: public Arrangement_::Observer {
+  public:
 
-As new faces might be inserted into the attached arrangement, and
-existing faces might be removed, the notification mechanism is used
-to dynamically maintain the mapping of face handles to indices.
+    /// \name Types
+    /// @{
 
+    /*! the type of the attached arrangement.
+     */
+    typedef Arrangement_                                Arrangement_2;
+    typedef typename Arrangement_2::Base_aos            Base_aos;
 
-\cgalModels{DefaultConstructible,CopyConstructible,Assignable,ReadablePropertyMap}
+    typedef boost::readable_property_map_tag            category;
 
-\sa `Arr_vertex_index_map<Arrangement>`
-*/
+    typedef unsigned int                                value_type;
 
-template< typename Arrangement >
-class Arr_face_index_map: public Arrangement::Observer {
-public:
+    typedef unsigned int                                reference;
 
-/// \name Types
-/// @{
+    typedef Face_handle                                 key_type;
 
-/*!
-the type of the attached arrangement.
-*/
-typedef Arrangement Arrangement_2;
+    /*! The face handle type.
+     */
+    typedef typename Base_aos::Face_handle              Face_handle;
 
-typedef boost::readable_property_map_tag category;
+    /*! The type of mapping of faces to indices.
+     */
+    typedef Unique_hash_map<Face_handle, value_type>    Index_map;
 
-typedef unsigned int value_type;
+    /// @}
 
-typedef unsigned int reference;
+    /// \name Creation
+    /// @{
 
-typedef Face_handle key_type;
+    /*! constructs a map that is unattached to any arrangement instance.
+     */
+    Arr_face_index_map();
 
-/*!
-The face handle type.
-*/
-typedef typename Arrangement_2::Face_handle Face_handle;
+    /*! constructs a map and attaches it to the given arrangement `arr`.
+     */
+    Arr_face_index_map(Base_aos& arr);
 
-/*!
-The type of mapping of faces to indices.
-*/
-typedef Unique_hash_map<Face_handle, value_type> Index_map;
+    /// @}
 
-/// @}
+  }; /* end Arr_accessor */
 
-/// \name Creation
-/// @{
-
-/*!
-constructs a map that is unattached to any arrangement instance.
-*/
-Arr_face_index_map();
-
-/*!
-constructs a map and attaches it to the given arrangement `arr`.
-*/
-Arr_face_index_map(Arrangement_2& arr);
-
-/// @}
-
-}; /* end Arr_accessor */
 } /* end namespace CGAL */
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
index 2bd83d5a125c..f0799d553be7 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_triangulation_point_location.h
@@ -1,7 +1,6 @@
 namespace CGAL {
 
-/*!
- * \ingroup PkgArrangementOnSurface2PointLocation
+/*! \ingroup PkgArrangementOnSurface2PointLocation
  *
  * \anchor arr_reftri_pl
  *
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h
index af17eafb8a70..e5bb1449dbf2 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_vertex_index_map.h
@@ -1,75 +1,69 @@
 namespace CGAL {
 
-/*!
-\ingroup PkgArrangementOnSurface2Ref
+  /*! \ingroup PkgArrangementOnSurface2Ref
+   *
+   * `Arr_vertex_index_map` maintains a mapping of vertex handles of an attached
+   * arrangement object to indices (of type `unsigned int`).  This class template
+   * is a model of the concept `ReadablePropertyMap`. A mapping between vertex
+   * handles and indices enables convenient usage of property-map classes supplied
+   * by `boost`.  For example, the property-map class templates
+   * `boost::vector_property_map`, which is based on `std::vector`, and
+   * `boost::iterator_property_map`, which can be used to implement a property map
+   * based on a native \CC array, require the user to supply a mapping such as
+   * `Arr_vertex_index_map`.
+   *
+   * As new vertices might be inserted into the attached arrangement, and
+   * existing vertices might be removed, the notification mechanism is used
+   * to dynamically maintain the mapping of vertex handles to indices.
+   *
+   * \cgalModels{DefaultConstructible,CopyConstructible,Assignable,ReadablePropertyMap}
+   *
+   * \sa `Arr_face_index_map<Arrangement>`
+   */
 
-`Arr_vertex_index_map` maintains a mapping of vertex handles of an
-attached arrangement object to indices (of type `unsigned int`).
-This class template is a model of the concept
-`ReadablePropertyMap`. A mapping between vertex handles and indices
-enables convenient usage of property-map classes supplied by `boost`.
-For example, the property-map class templates
-`boost::vector_property_map`, which is based on `std::vector`,
-and `boost::iterator_property_map`, which can be used to implement
-a property map based on a native \CC array, require the
-user to supply a mapping such as `Arr_vertex_index_map`.
+  template< typename Arrangement_>
+  class Arr_vertex_index_map: public Arrangement_::Observer {
+  public:
 
-As new vertices might be inserted into the attached arrangement, and
-existing vertices might be removed, the notification mechanism is used
-to dynamically maintain the mapping of vertex handles to indices.
+    /// \name Types
+    /// @{
 
+    /*! the type of the attached arrangement.
+     */
+    typedef Arrangement_                                Arrangement_2;
+    typedef typename Arrangement_2::Base_aos            Base_aos;
 
-\cgalModels{DefaultConstructible,CopyConstructible,Assignable,ReadablePropertyMap}
+    typedef boost::readable_property_map_tag            category;
 
-\sa `Arr_face_index_map<Arrangement>`
-*/
+    typedef unsigned int                                value_type;
 
-template< typename Arrangement >
-class Arr_vertex_index_map: public Arrangement::Observer {
-public:
+    typedef unsigned int                                reference;
 
-/// \name Types
-/// @{
+    typedef Vertex_handle                               key_type;
 
-/*!
-the type of the attached arrangement.
-*/
-typedef Arrangement Arrangement_2;
+    /*! The vertex handle type.
+     */
+    typedef typename Base_aos::Vertex_handle            Vertex_handle;
 
-typedef boost::readable_property_map_tag category;
+    /*! The type of mapping of vertices to indices.
+     */
+    typedef Unique_hash_map<Vertex_handle, value_type>  Index_map;
 
-typedef unsigned int value_type;
+    /// @}
 
-typedef unsigned int reference;
+    /// \name Creation
+    /// @{
 
-typedef Vertex_handle key_type;
+    /*! constructs a map that is unattached to any arrangement instance.
+     */
+    Arr_vertex_index_map();
 
-/*!
-The vertex handle type.
-*/
-typedef typename Arrangement_2::Vertex_handle Vertex_handle;
+    /*! constructs a map and attaches it to the given arrangement `arr`.
+     */
+    Arr_vertex_index_map(Base_aos& arr);
 
-/*!
-The type of mapping of vertices to indices.
-*/
-typedef Unique_hash_map<Vertex_handle, value_type> Index_map;
+    /// @}
 
-/// @}
+  }; /* end Arr_accessor */
 
-/// \name Creation
-/// @{
-
-/*!
-constructs a map that is unattached to any arrangement instance.
-*/
-Arr_vertex_index_map();
-
-/*!
-constructs a map and attaches it to the given arrangement `arr`.
-*/
-Arr_vertex_index_map(Arrangement_2& arr);
-
-/// @}
-
-}; /* end Arr_accessor */
 } /* end namespace CGAL */
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_face_index_map.h b/Arrangement_on_surface_2/include/CGAL/Arr_face_index_map.h
index 3fb3915b65a9..ee804c574c54 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_face_index_map.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_face_index_map.h
@@ -33,139 +33,110 @@ namespace CGAL {
  * arrangement faces to the indices 0, ..., (n -1), where n is the number
  * of faces in the arrangement.
  */
-template <class Arrangement_>
+template <typename Arrangement_>
 class Arr_face_index_map : public Arrangement_::Observer {
 public:
+  using Arrangement_2 = Arrangement_;
+  using Base_aos = typename Arrangement_2::Base_aos;
 
-  typedef Arrangement_                            Arrangement_2;
-  typedef typename Arrangement_2::Face_handle     Face_handle;
+  using Halfedge_handle = typename Base_aos::Halfedge_handle;
+  using Face_handle = typename Base_aos::Face_handle;
 
   // Boost property type definitions:
-  typedef boost::readable_property_map_tag        category;
-  typedef unsigned int                            value_type;
-  typedef value_type                              reference;
-  typedef Face_handle                             key_type;
+  using category = boost::readable_property_map_tag;
+  using value_type = unsigned int;
+  using reference = value_type;
+  using key_type = Face_handle;
 
 private:
+  using Self = Arr_face_index_map<Arrangement_2>;
+  using Base = typename Arrangement_2::Observer;
 
-  typedef Arr_face_index_map<Arrangement_2>       Self;
-  typedef typename Arrangement_2::Observer        Base;
-
-  typedef Unique_hash_map<Face_handle, unsigned int>     Index_map;
+  using Index_map = Unique_hash_map<Face_handle, unsigned int>;
 
   // Data members:
-  unsigned int                n_faces;     // The current number of faces.
-  Index_map                   index_map;   // Mapping faces to indices.
-  std::vector<Face_handle>    rev_map;     // Mapping indices to faces.
+  unsigned int n_faces;                    // The current number of faces.
+  Index_map index_map;                     // Mapping faces to indices.
+  std::vector<Face_handle> rev_map;        // Mapping indices to faces.
 
   enum {MIN_REV_MAP_SIZE = 32};
 
 public:
-
   /*! Default constructor. */
-  Arr_face_index_map () :
-    Base (),
-    n_faces (0),
-    rev_map (MIN_REV_MAP_SIZE)
+  Arr_face_index_map() :
+    Base(),
+    n_faces(0),
+    rev_map(MIN_REV_MAP_SIZE)
   {}
 
   /*! Constructor with an associated arrangement. */
-  Arr_face_index_map (const Arrangement_2& arr) :
-    Base(const_cast<Arrangement_2&>(arr))
-  {
-    _init();
-  }
+  Arr_face_index_map(const Base_aos& arr) :
+    Base(const_cast<Base_aos&>(arr))
+  { _init(); }
 
   /*! Copy constructor. */
-  Arr_face_index_map (const Self& other) :
-    Base(const_cast<typename Base::Arrangement_2&>(*(other.arrangement())))
-  {
-    _init();
-  }
+  Arr_face_index_map(const Self& other) :
+    Base(const_cast<Base_aos&>(*(other.arrangement())))
+  { _init(); }
 
   /*! Assignment operator. */
-  Self& operator= (const Self& other)
-  {
-    if (this == &other)
-      return (*this);
+  Self& operator= (const Self& other) {
+    if (this == &other) return (*this);
 
     this->detach();
-    this->attach(const_cast<typename Base::Arrangement_2&>(*(other.arrangement())));
+    this->attach(const_cast<Base_aos&>(*(other.arrangement())));
 
     return (*this);
   }
 
-  /*!
-   * Get the index of a given face.
+  /*! Get the index of a given face.
    * \param f A handle to the face.
    * \pre f is a valid face in the arrangement.
    */
-  unsigned int operator[] (Face_handle f) const
-  {
-    return (index_map[f]);
-  }
+  unsigned int operator[](Face_handle f) const { return (index_map[f]); }
 
-  /*!
-   * Get the face given its index.
+  /*! Get the face given its index.
    * \param i The index of the face.
    * \pre i is less than the number of faces in the arrangement.
    */
-  Face_handle face (const int i) const
-  {
+  Face_handle face(const int i) const {
     CGAL_precondition((unsigned int) i < n_faces);
-
     return (rev_map[i]);
   }
 
   /// \name Notification functions, to keep the mapping up-to-date.
   //@{
 
-  /*!
-   * Update the mapping after the arrangement has been assigned with another
+  /*! Update the mapping after the arrangement has been assigned with another
    * arrangement.
    */
-  virtual void after_assign ()
-  {
-    _init();
-  }
+  virtual void after_assign() override { _init(); }
 
-  /*!
-   * Update the mapping after the arrangement is cleared.
+  /*! Update the mapping after the arrangement is cleared.
    */
-  virtual void after_clear ()
-  {
-    _init();
-  }
+  virtual void after_clear() override { _init(); }
 
-  /*!
-   * Update the mapping after attaching to a new arrangement.
+  /*! Update the mapping after attaching to a new arrangement.
    */
-  virtual void after_attach ()
-  {
-    _init();
-  }
+  virtual void after_attach() override { _init(); }
 
-  /*!
-   * Update the mapping after detaching the arrangement.
+  /*! Update the mapping after detaching the arrangement.
    */
-  virtual void after_detach ()
-  {
+  virtual void after_detach() override {
     n_faces = 0;
     index_map.clear();
   }
 
-  /*!
-   * Update the mapping after the creation of a new face is split from another
+  /*! Update the mapping after the creation of a new face is split from another
    * face.
    * \param f A handle to the existing face.
    * \param new_f A handle to the newly created face.
    */
-  virtual void after_split_face (Face_handle /* f */,
-                                 Face_handle new_f,
-                                 bool /* is_hole */)
-  {
+  virtual void after_split_face(Face_handle /* f */,
+                                Face_handle new_f,
+                                bool /* is_hole */) override {
     // Update the number of vertices.
-    n_faces++;
+    ++n_faces;
 
     // If necessary, allocate memory for the reverse mapping.
     if (rev_map.size() < n_faces)
@@ -174,97 +145,77 @@ class Arr_face_index_map : public Arrangement_::Observer {
     // Update the mapping of the newly created face.
     index_map[new_f] = n_faces - 1;
     rev_map[n_faces - 1] = new_f;
-
-    return;
   }
 
-  /*!
-   * Update the mapping before the merge of two faces.
+  /*! Update the mapping before the merge of two faces.
    * \param f1 A handle to the face that is going to remain.
    * \param f2 A handle to the face that is about to be removed.
    */
-  virtual void before_merge_face (Face_handle /* f1 */,
-                                  Face_handle f2,
-                                  typename
-                                  Arrangement_2::Halfedge_handle /* e */)
-  {
+  virtual void before_merge_face(Face_handle /* f1 */,
+                                 Face_handle f2,
+                                 Halfedge_handle /* e */) override {
     // Update the number of faces.
-    n_faces--;
+    --n_faces;
 
     // Reduce memory consumption in case the number of faces has
     // drastically decreased.
     if (2*n_faces+1 < rev_map.size() &&
         rev_map.size() / 2 >= MIN_REV_MAP_SIZE)
     {
-      rev_map.resize (rev_map.size() / 2);
+      rev_map.resize(rev_map.size() / 2);
     }
 
     // Get the current face index, and assign this index to the face
     // currently indexed (n - 1).
-    unsigned int   index = index_map[f2];
+    unsigned int index = index_map[f2];
 
-    if (index == n_faces)
-      return;
+    if (index == n_faces) return;
 
-    Face_handle    last_f = rev_map[n_faces];
+    Face_handle last_f = rev_map[n_faces];
     index_map[last_f] = index;
     rev_map[index] = last_f;
 
     // Clear the reverse mapping for the last face.
     rev_map[n_faces] = Face_handle();
-
-    return;
   }
   //@}
 
 private:
-
   /*! Initialize the map for the given arrangement. */
-  void _init ()
-  {
+  void _init() {
     // Get the number of faces and allocate the reverse map accordingly.
     n_faces = static_cast<unsigned int>(this->arrangement()->number_of_faces());
 
-    if (n_faces < MIN_REV_MAP_SIZE)
-      rev_map.resize (MIN_REV_MAP_SIZE);
-    else
-      rev_map.resize (n_faces);
+    if (n_faces < MIN_REV_MAP_SIZE) rev_map.resize (MIN_REV_MAP_SIZE);
+    else rev_map.resize (n_faces);
 
     // Clear the current mapping.
     index_map.clear();
 
     // Create the initial mapping.
-    typename Arrangement_2::Face_iterator     fit;
-    Face_handle                               fh;
-    unsigned int                              index = 0;
+    Face_handle fh;
+    unsigned int index = 0;
 
-    for (fit = this->arrangement()->faces_begin();
-         fit != this->arrangement()->faces_end(); ++fit, ++index)
-    {
+    for (auto fit = this->arrangement()->faces_begin();
+         fit != this->arrangement()->faces_end(); ++fit, ++index) {
       // Map the current face to the current index.
       fh = fit;
       index_map[fh] = index;
       rev_map[index] = fh;
     }
-
-    return;
   }
-
 };
 
-/*!
- * Get the index property-map function. Provided so that boost is able to
+/*! Get the index property-map function. Provided so that boost is able to
  * access the Arr_face_index_map above.
  * \param index_map The index map.
  * \param f A face handle.
  * \return The face index.
  */
-template<class Arrangement>
-unsigned int get (const CGAL::Arr_face_index_map<Arrangement>& index_map,
-                  typename Arrangement::Face_handle f)
-{
-  return (index_map[f]);
-}
+template <typename Arrangement>
+unsigned int get(const CGAL::Arr_face_index_map<Arrangement>& index_map,
+                 typename Arrangement::Face_handle f)
+{ return (index_map[f]); }
 
 } //namespace CGAL
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h
index 5e573527334c..42dc494377ff 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_point_location/Arr_lm_generator_base.h
@@ -48,40 +48,38 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   using Arrangement_2 = Arrangement_;
   using Base_aos = typename Arrangement_2::Base_aos;
 
-  typedef Nearest_neighbor_                           Nearest_neighbor;
+  using Nearest_neighbor = Nearest_neighbor_;
 
-  typedef typename Arrangement_2::Geometry_traits_2     Geometry_traits_2;
-  typedef typename Arrangement_2::Vertex_const_handle   Vertex_const_handle;
-  typedef typename Arrangement_2::Halfedge_const_handle Halfedge_const_handle;
-  typedef typename Arrangement_2::Face_const_handle     Face_const_handle;
-  typedef typename Arrangement_2::Vertex_handle         Vertex_handle;
-  typedef typename Arrangement_2::Halfedge_handle       Halfedge_handle;
-  typedef typename Arrangement_2::Face_handle           Face_handle;
-  typedef typename Arrangement_2::Vertex_const_iterator Vertex_const_iterator;
-  typedef typename Arrangement_2::Ccb_halfedge_circulator
-                                                    Ccb_halfedge_circulator;
+  using Geometry_traits_2 = typename Base_aos::Geometry_traits_2;
+  using Vertex_const_handle = typename Base_aos::Vertex_const_handle;
+  using Halfedge_const_handle = typename Base_aos::Halfedge_const_handle;
+  using Face_const_handle = typename Base_aos::Face_const_handle;
+  using Vertex_handle = typename Base_aos::Vertex_handle;
+  using Halfedge_handle = typename Base_aos::Halfedge_handle;
+  using Face_handle = typename Base_aos::Face_handle;
+  using Vertex_const_iterator = typename Base_aos::Vertex_const_iterator;
+  using Ccb_halfedge_circulator = typename Base_aos::Ccb_halfedge_circulator;
 
-  typedef typename Arrangement_2::Point_2               Point_2;
-  typedef typename Arrangement_2::X_monotone_curve_2    X_monotone_curve_2;
+  using Point_2 = typename Base_aos::Point_2;
+  using X_monotone_curve_2 = typename Base_aos::X_monotone_curve_2;
 
-  typedef typename Nearest_neighbor::NN_Point_2         NN_Point_2;
-  typedef std::list<NN_Point_2>                         NN_Points_set;
+  using NN_Point_2 = typename Nearest_neighbor::NN_Point_2;
+  using NN_Points_set = std::list<NN_Point_2>;
 
-  typedef std::vector<Point_2>                          Points_set;
+  using Points_set = std::vector<Point_2>;
 
-  typedef Arr_point_location_result<Arrangement_2>      PL_result;
-  typedef typename PL_result::Type                      PL_result_type;
+  using PL_result = Arr_point_location_result<Base_aos>;
+  using PL_result_type = typename PL_result::Type;
 
-  typedef std::pair<Point_2, PL_result_type>            PL_pair;
-  typedef std::vector<PL_pair>                          Pairs_set;
-  typedef typename std::vector<PL_pair>::iterator       Pairs_iterator;
+  using PL_pair = std::pair<Point_2, PL_result_type>;
+  using Pairs_set = std::vector<PL_pair>;
+  using Pairs_iterator = typename std::vector<PL_pair>::iterator;
 
 private:
-  typedef Arr_landmarks_generator_base<Arrangement_2, Nearest_neighbor>
-                                                        Self;
+  using Self = Arr_landmarks_generator_base<Arrangement_2, Nearest_neighbor>;
 
 protected:
-  typedef Arr_traits_basic_adaptor_2<Geometry_traits_2> Traits_adaptor_2;
+  using Traits_adaptor_2 = Arr_traits_basic_adaptor_2<Geometry_traits_2>;
 
   // Data members:
   const Traits_adaptor_2* m_traits;  // The associated traits object.
@@ -110,8 +108,8 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   /*! Constructor from an arrangement.
    * \param arr (in) The arrangement.
    */
-  Arr_landmarks_generator_base(const Arrangement_2& arr) :
-    Arrangement_2::Observer(const_cast<Arrangement_2&>(arr)),
+  Arr_landmarks_generator_base(const Base_aos& arr) :
+    Base_aos::Observer(const_cast<Base_aos&>(arr)),
     m_traits(static_cast<const Traits_adaptor_2*>(arr.geometry_traits())),
     m_ignore_notifications(false),
     m_ignore_remove_edge(false),
@@ -125,8 +123,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   /*! Create the landmarks set (choosing the landmarks) ,
    * and saving them in the nearest-neighbor search structure.
    */
-  virtual void build_landmark_set()
-  {
+  virtual void build_landmark_set() {
     // Create the landmark points.
     NN_Points_set nn_points;
     _create_nn_points_set(nn_points);
@@ -141,8 +138,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
 
   /*! clear the set of landmarks.
    */
-  virtual void clear_landmark_set()
-  {
+  virtual void clear_landmark_set() {
     nn.clear();
     num_small_not_updated_changes = 0;
     updated = false;
@@ -154,8 +150,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
    *                    arrangement (a vertex, halfedge, or face handle).
    * \return The nearest landmark point.
    */
-  virtual Point_2 closest_landmark(const Point_2& p, PL_result_type& obj)
-  {
+  virtual Point_2 closest_landmark(const Point_2& p, PL_result_type& obj) {
     CGAL_assertion(updated);
     return (nn.find_nearest_neighbor(p, obj));
   }
@@ -163,13 +158,13 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   /// \name Overloaded observer functions on global changes.
   //@{
 
-  /*! Notification before the arrangement is assigned with the content of another
-   * arrangement.
-   * \param arr The other arrangement. Notice that the arrangement type is the type used to
-   *            instantiate the observer, which is conveniently defined as
-   *            `Arrangement_2::Base_aos`.
+  /*! Notification before the arrangement is assigned with the content of
+   * another arrangement.
+   * \param arr The other arrangement. Notice that the arrangement type is the
+   *            type used to instantiate the observer, which is conveniently
+   *            defined as `Arrangement_2::Base_aos`.
    */
-  virtual void before_assign(const Base_aos& arr) {
+  virtual void before_assign(const Base_aos& arr) override {
     this->clear_landmark_set();
     m_traits = static_cast<const Traits_adaptor_2*>(arr.geometry_traits());
     m_ignore_notifications = true;
@@ -178,8 +173,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   /*! Notification after the arrangement has been assigned with another
    * arrangement.
    */
-  virtual void after_assign()
-  {
+  virtual void after_assign() override {
     this->build_landmark_set();
     m_ignore_notifications = false;
   }
@@ -187,8 +181,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   /*! Notification before the observer is attached to an arrangement.
    * \param arr The arrangement we are about to attach the observer to.
    */
-  virtual void before_attach(const Base_aos& arr)
-  {
+  virtual void before_attach(const Base_aos& arr) override {
     this->clear_landmark_set();
     m_traits = static_cast<const Traits_adaptor_2*>(arr.geometry_traits());
     m_ignore_notifications = true;
@@ -196,38 +189,33 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
 
   /*! Notification after the observer has been attached to an arrangement.
    */
-  virtual void after_attach()
-  {
+  virtual void after_attach() override {
     this->build_landmark_set();
     m_ignore_notifications = false;
   }
 
   /*! Notification before the observer is detached from the arrangement.
    */
-  virtual void before_detach()
-  { this->clear_landmark_set(); }
+  virtual void before_detach() override { this->clear_landmark_set(); }
 
   /*! Notification after the arrangement is cleared.
    * \param u A handle to the unbounded face.
    */
-  virtual void after_clear()
-  {
+  virtual void after_clear() override {
     this->clear_landmark_set();
     this->build_landmark_set();
   }
 
   /*! Notification before a global operation modifies the arrangement.
    */
-  virtual void before_global_change()
-  {
+  virtual void before_global_change() override {
     this->clear_landmark_set();
     m_ignore_notifications = true;
   }
 
   /*! Notification after a global operation is completed.
    */
-  virtual void after_global_change()
-  {
+  virtual void after_global_change() override {
     this->build_landmark_set();
     m_ignore_notifications = false;
   }
@@ -239,12 +227,11 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   /*! Notification before the removal of an edge.
    * \param e (in) A handle to one of the twin halfedges to be removed.
    */
-  virtual void before_remove_edge(Halfedge_handle /* e */)
+  virtual void before_remove_edge(Halfedge_handle /* e */) override
   { m_ignore_remove_edge = true; }
 
   /*! Notification after the creation of a new vertex. */
-  virtual void after_create_vertex(Vertex_handle)
-  {
+  virtual void after_create_vertex(Vertex_handle) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -252,8 +239,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after the creation of a new edge. */
-  virtual void after_create_edge(Halfedge_handle)
-  {
+  virtual void after_create_edge(Halfedge_handle) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -261,8 +247,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after an edge was split. */
-  virtual void after_split_edge(Halfedge_handle, Halfedge_handle)
-  {
+  virtual void after_split_edge(Halfedge_handle, Halfedge_handle) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -270,8 +255,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after a face was split. */
-  virtual void after_split_face(Face_handle, Face_handle, bool)
-  {
+  virtual void after_split_face(Face_handle, Face_handle, bool) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -281,8 +265,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   /*! Notification after an outer CCB was split.*/
   virtual void after_split_outer_ccb(Face_handle,
                                      Ccb_halfedge_circulator,
-                                     Ccb_halfedge_circulator)
-  {
+                                     Ccb_halfedge_circulator) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -292,8 +275,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   /*! Notification after an inner CCB was split. */
   virtual void after_split_inner_ccb(Face_handle,
                                      Ccb_halfedge_circulator,
-                                     Ccb_halfedge_circulator)
-  {
+                                     Ccb_halfedge_circulator) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -301,8 +283,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after an outer CCB was added to a face. */
-  virtual void after_add_outer_ccb(Ccb_halfedge_circulator)
-  {
+  virtual void after_add_outer_ccb(Ccb_halfedge_circulator) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -310,8 +291,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after an inner CCB was created inside a face. */
-  virtual void after_add_inner_ccb(Ccb_halfedge_circulator)
-  {
+  virtual void after_add_inner_ccb(Ccb_halfedge_circulator) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -319,8 +299,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after an isolated vertex was created inside a face. */
-  virtual void after_add_isolated_vertex(Vertex_handle)
-  {
+  virtual void after_add_isolated_vertex(Vertex_handle) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -328,8 +307,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after an edge was merged. */
-  virtual void after_merge_edge(Halfedge_handle)
-  {
+  virtual void after_merge_edge(Halfedge_handle) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -337,8 +315,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after a face was merged. */
-  virtual void after_merge_face(Face_handle)
-  {
+  virtual void after_merge_face(Face_handle) override {
     if (! m_ignore_notifications && ! m_ignore_remove_edge) {
       clear_landmark_set();
       build_landmark_set();
@@ -347,7 +324,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
 
   /*! Notification after an outer CCB was merged. */
   virtual void after_merge_outer_ccb(Face_handle, Ccb_halfedge_circulator)
-  {
+  override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -356,7 +333,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
 
   /*! Notification after an inner CCB was merged. */
   virtual void after_merge_inner_ccb(Face_handle, Ccb_halfedge_circulator)
-  {
+  override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -364,8 +341,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after an outer CCB is moved from one face to another. */
-  virtual void after_move_outer_ccb(Ccb_halfedge_circulator )
-  {
+  virtual void after_move_outer_ccb(Ccb_halfedge_circulator) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -373,8 +349,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after an inner CCB is moved from one face to another. */
-  virtual void after_move_inner_ccb(Ccb_halfedge_circulator )
-  {
+  virtual void after_move_inner_ccb(Ccb_halfedge_circulator) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -382,8 +357,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after an isolated vertex is moved. */
-  virtual void after_move_isolated_vertex(Vertex_handle )
-  {
+  virtual void after_move_isolated_vertex(Vertex_handle) override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -391,8 +365,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notificaion after the removal of a vertex. */
-  virtual void after_remove_vertex()
-  {
+  virtual void after_remove_vertex() override {
     if (! m_ignore_notifications && ! m_ignore_remove_edge) {
       clear_landmark_set();
       build_landmark_set();
@@ -400,8 +373,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notification after the removal of an edge. */
-  virtual void after_remove_edge()
-  {
+  virtual void after_remove_edge() override {
     if (! m_ignore_notifications) {
       clear_landmark_set();
       build_landmark_set();
@@ -410,8 +382,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notificaion after the removal of an outer CCB. */
-  virtual void after_remove_outer_ccb(Face_handle)
-  {
+  virtual void after_remove_outer_ccb(Face_handle) override {
     if (! m_ignore_notifications && ! m_ignore_remove_edge) {
       clear_landmark_set();
       build_landmark_set();
@@ -419,8 +390,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
   }
 
   /*! Notificaion after the removal of an inner CCB. */
-  virtual void after_remove_inner_ccb(Face_handle)
-  {
+  virtual void after_remove_inner_ccb(Face_handle) override {
     if (! m_ignore_notifications && ! m_ignore_remove_edge) {
       clear_landmark_set();
       build_landmark_set();
@@ -435,8 +405,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
    */
   virtual void _create_points_set(Points_set&) = 0;
 
-  virtual void _create_nn_points_set(NN_Points_set& nn_points)
-  {
+  virtual void _create_nn_points_set(NN_Points_set& nn_points) {
     Points_set points;
     Pairs_set pairs;
 
@@ -454,8 +423,7 @@ class Arr_landmarks_generator_base : public Arrangement_::Observer {
 
     // Insert all landmarks (paired with their current location in the
     // arrangement) into the nearest-neighbor search structure.
-    Pairs_iterator itr;
-    for (itr = pairs.begin(); itr != pairs.end(); ++itr) {
+    for (auto itr = pairs.begin(); itr != pairs.end(); ++itr) {
       NN_Point_2 np(itr->first, itr->second);
       nn_points.push_back(np);
     }
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h
index 91739414dcb2..5776d9cf3ab8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_trapezoid_ric_point_location.h
@@ -8,8 +8,8 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Idit Haran   <haranidi@post.tau.ac.il>
-//                 (based on old version by Oren Nechushtan and Iddo Hanniel)
+// Author(s): Idit Haran   <haranidi@post.tau.ac.il>
+//            (based on old version by Oren Nechushtan and Iddo Hanniel)
 
 #ifndef CGAL_ARR_TRAPEZOID_RIC_POINT_LOCATION_H
 #define CGAL_ARR_TRAPEZOID_RIC_POINT_LOCATION_H
@@ -42,90 +42,88 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
   using Base_aos = typename Arrangement_on_surface_2::Base_aos;
 
   //type of geometry traits
-  typedef typename Arrangement_on_surface_2::Geometry_traits_2
-                                                Geometry_traits_2;
+  using Geometry_traits_2 = typename Base_aos::Geometry_traits_2;
+
   //type of traits adaptor
-  typedef typename Arrangement_on_surface_2::Traits_adaptor_2
-                                                Traits_adaptor_2;
+  using Traits_adaptor_2 = typename Base_aos::Traits_adaptor_2;
+
   //type of vertex handle
-  typedef typename Arrangement_on_surface_2::Vertex_handle
-                                                Vertex_handle;
+  using Vertex_handle = typename Base_aos::Vertex_handle;
+
   //type of vertex const handle
-  typedef typename Arrangement_on_surface_2::Vertex_const_handle
-                                                Vertex_const_handle;
+  using Vertex_const_handle = typename Base_aos::Vertex_const_handle;
+
   //type of halfedge handle
-  typedef typename Arrangement_on_surface_2::Halfedge_handle
-                                                Halfedge_handle;
+  using Halfedge_handle = typename Base_aos::Halfedge_handle;
+
   //type of halfedge const handle
-  typedef typename Arrangement_on_surface_2::Halfedge_const_handle
-                                                Halfedge_const_handle;
+  using Halfedge_const_handle = typename Base_aos::Halfedge_const_handle;
+
   //type of face const handle
-  typedef typename Arrangement_on_surface_2::Face_const_handle
-                                                Face_const_handle;
+  using Face_const_handle = typename Base_aos::Face_const_handle;
+
   //type of edge const iterator
-  typedef typename Arrangement_on_surface_2::Edge_const_iterator
-                                                Edge_const_iterator;
+  using Edge_const_iterator = typename Base_aos::Edge_const_iterator;
+
   //type of isolated vertex const iterator
-  typedef typename Arrangement_on_surface_2::Isolated_vertex_const_iterator
-                                       Isolated_vertex_const_iterator;
+  using Isolated_vertex_const_iterator =
+    typename Base_aos::Isolated_vertex_const_iterator;
+
   //type of point
-  typedef typename Geometry_traits_2::Point_2             Point_2;
+  using Point_2 = typename Geometry_traits_2::Point_2;
 
   //type of x-monotone curve
-  typedef typename Geometry_traits_2::X_monotone_curve_2
-                                                X_monotone_curve_2;
+  using X_monotone_curve_2 = typename Geometry_traits_2::X_monotone_curve_2;
+
 
   //type of trapezoidal decomposition traits class
-  typedef CGAL::Td_traits<Traits_adaptor_2, Arrangement_on_surface_2>
-                                                Td_traits;
+  using Td_traits = CGAL::Td_traits<Traits_adaptor_2, Base_aos>;
+
   //type of trapezoidal decomposition class
-  typedef Trapezoidal_decomposition_2<Td_traits>
-                                                Trapezoidal_decomposition;
+  using Trapezoidal_decomposition = Trapezoidal_decomposition_2<Td_traits>;
 
   //!types of Td_map_item-s
-  typedef typename Trapezoidal_decomposition::Td_map_item
-                                                Td_map_item;
-  typedef typename Trapezoidal_decomposition::Td_active_vertex
-                                                Td_active_vertex;
-  typedef typename Trapezoidal_decomposition::Td_active_fictitious_vertex
-                                                Td_active_fictitious_vertex;
-  typedef typename Trapezoidal_decomposition::Td_active_edge
-                                                Td_active_edge;
-  typedef typename Trapezoidal_decomposition::Td_active_trapezoid
-                                                Td_active_trapezoid;
+  using Td_map_item = typename Trapezoidal_decomposition::Td_map_item;
+  using Td_active_vertex = typename Trapezoidal_decomposition::Td_active_vertex;
+  using Td_active_fictitious_vertex =
+    typename Trapezoidal_decomposition::Td_active_fictitious_vertex;
+  using Td_active_edge = typename Trapezoidal_decomposition::Td_active_edge;
+  using Td_active_trapezoid =
+    typename Trapezoidal_decomposition::Td_active_trapezoid;
+
   //!type of side tags
-  typedef typename Traits_adaptor_2::Left_side_category   Left_side_category;
-  typedef typename Traits_adaptor_2::Bottom_side_category Bottom_side_category;
-  typedef typename Traits_adaptor_2::Top_side_category    Top_side_category;
-  typedef typename Traits_adaptor_2::Right_side_category  Right_side_category;
+  using Left_side_category = typename Traits_adaptor_2::Left_side_category;
+  using Bottom_side_category = typename Traits_adaptor_2::Bottom_side_category;
+  using Top_side_category = typename Traits_adaptor_2::Top_side_category;
+  using Right_side_category = typename Traits_adaptor_2::Right_side_category;
 
 protected:
-  typedef Arr_point_location_result<Arrangement_on_surface_2>        Result;
-  typedef typename Result::Type                         Result_type;
+  using Result = Arr_point_location_result<Base_aos>;
+  using Result_type = typename Result::Type;
 
 public:
   // Support cpp11::result_of
-  typedef Result_type                                   result_type;
+  using result_type = Result_type;
 
 protected:
   //type of trapezoidal decomposition class
-  typedef Trapezoidal_decomposition                     TD;
+  using TD = Trapezoidal_decomposition;
 
-  typedef typename Arr_all_sides_oblivious_category<Left_side_category,
-                                                    Bottom_side_category,
-                                                    Top_side_category,
-                                                    Right_side_category>::result
-    All_sides_oblivious_category;
+  using All_sides_oblivious_category=
+    typename Arr_all_sides_oblivious_category<Left_side_category,
+                                              Bottom_side_category,
+                                              Top_side_category,
+                                              Right_side_category>::result;
 
   // Data members:
   const Traits_adaptor_2* m_traits; // Its associated traits object.
-  TD  td;                           // instance of trapezoidal decomposition
+  TD td;                            // instance of trapezoidal decomposition
   bool m_with_guarantees;
   //for the notification functions
-  X_monotone_curve_2  m_cv_before_split;
-  Halfedge_handle     m_he_after_merge;
-  //X_monotone_curve_2        m_cv_before_merge1;
-  //X_monotone_curve_2        m_cv_before_merge2;
+  X_monotone_curve_2 m_cv_before_split;
+  Halfedge_handle m_he_after_merge;
+  //X_monotone_curve_2 m_cv_before_merge1;
+  //X_monotone_curve_2 m_cv_before_merge2;
 
   template <typename T>
   Result_type make_result(T t) const { return Result::make_result(t); }
@@ -133,26 +131,25 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
 
 public:
   /*! Default constructor. */
-  Arr_trapezoid_ric_point_location(bool with_guarantees = true,
-                                   double depth_thrs = CGAL_TD_DEFAULT_DEPTH_THRESHOLD,
-                                   double size_thrs = CGAL_TD_DEFAULT_SIZE_THRESHOLD) :
-    m_traits(nullptr), m_with_guarantees(with_guarantees)
-  {
+  Arr_trapezoid_ric_point_location
+  (bool with_guarantees = true,
+   double depth_thrs = CGAL_TD_DEFAULT_DEPTH_THRESHOLD,
+   double size_thrs = CGAL_TD_DEFAULT_SIZE_THRESHOLD) :
+    m_traits(nullptr), m_with_guarantees(with_guarantees) {
     td.set_with_guarantees(with_guarantees);
     td.depth_threshold(depth_thrs);
     td.size_threshold(size_thrs);
   }
 
   /*! Constructor given an arrangement. */
-  Arr_trapezoid_ric_point_location (const Arrangement_on_surface_2& arr,
-                           bool with_guarantees = true,
-                           double depth_thrs = CGAL_TD_DEFAULT_DEPTH_THRESHOLD,
-                           double size_thrs = CGAL_TD_DEFAULT_SIZE_THRESHOLD) :
-    Arrangement_on_surface_2::
-    Observer(const_cast<Arrangement_on_surface_2&>(arr)),
-    m_with_guarantees(with_guarantees)
-  {
-    m_traits = static_cast<const Traits_adaptor_2*> (arr.geometry_traits());
+  Arr_trapezoid_ric_point_location
+  (const Base_aos& arr,
+   bool with_guarantees = true,
+   double depth_thrs = CGAL_TD_DEFAULT_DEPTH_THRESHOLD,
+   double size_thrs = CGAL_TD_DEFAULT_SIZE_THRESHOLD) :
+    Base_aos::Observer(const_cast<Base_aos&>(arr)),
+    m_with_guarantees(with_guarantees) {
+    m_traits = static_cast<const Traits_adaptor_2*>(arr.geometry_traits());
     td.set_with_guarantees(with_guarantees);
     td.init_arrangement_and_traits(&arr);
     td.depth_threshold(depth_thrs);
@@ -161,17 +158,15 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
   }
 
   /*! Destructor. */
-  ~Arr_trapezoid_ric_point_location () { }
+  ~Arr_trapezoid_ric_point_location() { }
 
   /*! defines whether the underlying search structure guarantees logarithmic
    *   query time and linear size */
-  void with_guarantees (bool with_guarantees)
-  {
+  void with_guarantees(bool with_guarantees) {
     //if with_guarantees was changed from false to true - reconstruct
     //  the search structure with guarantees
     td.set_with_guarantees(with_guarantees);
-    if (with_guarantees && !m_with_guarantees)
-    {
+    if (with_guarantees && !m_with_guarantees) {
       td.clear();
       _construct_td();
     }
@@ -182,30 +177,20 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
    *    (the longest path in the DAG)
    */
   unsigned long depth() //longest_dag_path()
-  {
-    return td.largest_leaf_depth() + 1;
-  }
+  { return td.largest_leaf_depth() + 1; }
 
   /*! returns the longest query path in the underlying search structure */
   unsigned long longest_query_path_length()
-  {
-    return td.longest_query_path_length();
-  }
+  { return td.longest_query_path_length(); }
 
 #ifdef CGAL_TD_DEBUG
   //void  locate_and_print (std::ostream& out, const Point_2& p) const
-  //{
-  //  td.locate_and_print(out, p);
-  //}
+  //{  td.locate_and_print(out, p); }
 
-  void print_dag(std::ostream& out) const
-  {
-    td.print_dag(out);
-  }
+  void print_dag(std::ostream& out) const { td.print_dag(out); }
 #endif
 
-  /*!
-   * Locate the arrangement feature containing the given point.
+  /*! Locate the arrangement feature containing the given point.
    * \param p The query point.
    * \return An object representing the arrangement feature containing the
    *         query point. This object is either a Face_const_handle or a
@@ -213,8 +198,7 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
    */
   result_type locate(const Point_2& p) const;
 
-  /*!
-   * Locate the arrangement feature which a upward vertical ray emanating from
+  /*! Locate the arrangement feature which a upward vertical ray emanating from
    * the given point hits.
    * \param p The query point.
    * \return An object representing the arrangement feature the ray hits.
@@ -224,8 +208,7 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
   result_type ray_shoot_up(const Point_2& p) const
   { return (_vertical_ray_shoot(p, true)); }
 
-  /*!
-   * Locate the arrangement feature which a downward vertical ray emanating
+  /*! Locate the arrangement feature which a downward vertical ray emanating
    * from the given point hits.
    * \param p The query point.
    * \return An object representing the arrangement feature the ray hits.
@@ -239,32 +222,23 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
   //        base observer.
   //@{
 
-  /*! Notification before the arrangement is assigned with the content of another
-   * arrangement.
-   * \param arr The other arrangement. Notice that the arrangement type is the type used to
-   *            instantiate the observer, which is conveniently defined as
-   *            `Arrangement_2::Base_aos`.
+  /*! Notification before the arrangement is assigned with the content of
+   * another arrangement.
+   * \param arr The other arrangement. Notice that the arrangement type is the
+   *            type used to instantiate the observer, which is conveniently
+   *            defined as `Arrangement_2::Base_aos`.
    */
-  virtual void before_assign(const Base_aos& arr) {
+  virtual void before_assign(const Base_aos& arr) override {
     td.clear();
     m_traits = static_cast<const Traits_adaptor_2*> (arr.geometry_traits());
     td.init_arrangement_and_traits(&arr, false);
   }
 
-  virtual void after_assign ()
-  {
-    _construct_td();
-  }
+  virtual void after_assign() override { _construct_td(); }
 
-  virtual void before_clear ()
-  {
-    td.clear();
-  }
+  virtual void before_clear() override { td.clear(); }
 
-  virtual void after_clear ()
-  {
-    _construct_td();
-  }
+  virtual void after_clear() override { _construct_td(); }
 
   /*! Notification before the observer is attached to an arrangement.
    * \param arr The arrangement that is about to attach the observer. Notice
@@ -272,49 +246,38 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
    *        observer, which is conveniently defined as
    *        `Arrangement_2::Base_aos`.
    */
-  virtual void before_attach(const Base_aos& arr) {
+  virtual void before_attach(const Base_aos& arr) override {
     td.clear();
     m_traits = static_cast<const Traits_adaptor_2*> (arr.geometry_traits());
     td.init_arrangement_and_traits(&arr);
   }
 
-  virtual void after_attach ()
-  {
-    _construct_td();
-  }
+  virtual void after_attach() override { _construct_td(); }
 
-  virtual void before_detach ()
-  {
-    td.clear();
-  }
+  virtual void before_detach() override { td.clear(); }
 
-  virtual void after_create_edge (Halfedge_handle e)
-  {
-    td.insert(e);
-  }
+  virtual void after_create_edge(Halfedge_handle e) override { td.insert(e); }
 
   //TODO IDIT OREN: what can be done in order to avoid the need
   //to save the original curve is to find the common endpoint of the
   //two new halfedges, locate it in the trapezoid in order to find the
   //curve it lies on, which is the curve that was split, and then remove
   //this curve.
-  virtual void before_split_edge (Halfedge_handle e,
-                                                          Vertex_handle /* v */,
-                                  const X_monotone_curve_2&  /* cv1 */ ,
-                                  const X_monotone_curve_2&  /* cv2 */ )
-  {
-
-    ////MICHAL: commented due to inefficient depth update, remove and insert instead
-    ////save the curve for the "after" function.
+  virtual void before_split_edge(Halfedge_handle e,
+                                 Vertex_handle /* v */,
+                                 const X_monotone_curve_2& /* cv1 */,
+                                 const X_monotone_curve_2& /* cv2 */) override {
+
+    ////MICHAL: commented due to inefficient depth update, remove and insert
+    ////instead save the curve for the "after" function.
     //m_cv_before_split = e->curve();
     //td.before_split_edge(m_cv_before_split, cv1, cv2);
 
     td.remove(e);
   }
 
-  virtual void after_split_edge (Halfedge_handle e1,
-                                 Halfedge_handle e2)
-  {
+  virtual void after_split_edge(Halfedge_handle e1, Halfedge_handle e2)
+    override {
     //MICHAL: commented due to inefficient depth update, remove and insert instead
     //td.split_edge(m_cv_before_split,e1,e2);
 
@@ -322,29 +285,20 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
     td.insert(e2);
   }
 
-  virtual void before_merge_edge (Halfedge_handle e1,
-                                  Halfedge_handle e2,
-                                  const X_monotone_curve_2& cv)
-  {
+  virtual void before_merge_edge(Halfedge_handle e1, Halfedge_handle e2,
+                                 const X_monotone_curve_2& cv) override {
     //save the halfedge handle for the "after" function.
     m_he_after_merge = e1;
     td.merge_edge (e1, e2, cv);
   }
 
-  virtual void after_merge_edge (Halfedge_handle e)
-  {
-    td.after_merge_edge(e, m_he_after_merge);
-  }
+  virtual void after_merge_edge(Halfedge_handle e) override
+  { td.after_merge_edge(e, m_he_after_merge); }
 
-  virtual void before_remove_edge (Halfedge_handle e)
-  {
-    //called before combinatoric deletion
-    td.remove(e);
-  }
+  virtual void before_remove_edge(Halfedge_handle e) override { td.remove(e); }
   //@}
 
 public:
-
 //#ifdef CGAL_TD_DEBUG
 //  void debug()
 //  {
@@ -353,27 +307,22 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
 //#endif
 
 protected:
-
   /*! Construct the trapezoidal decomposition. */
-  void _construct_td ()
-  {
+  void _construct_td() {
     td.clear();
 
     std::vector<Halfedge_const_handle> he_container;
-    Edge_const_iterator eit;
-    Halfedge_const_handle he_cst;
     auto* arr = this->arrangement();
     //collect the arrangement halfedges
-    for (eit = arr->edges_begin(); eit != arr->edges_end(); ++eit)
-    {
-      he_cst = eit;
+    for (auto eit = arr->edges_begin(); eit != arr->edges_end(); ++eit) {
+      Halfedge_const_handle he_cst = eit;
       he_container.push_back(he_cst);
     }
     //container insertion
     td.insert(he_container.begin(), he_container.end());
   }
 
-  /*! gets the unbounded face that contains the point when the trapezoid is
+  /*! Obtain the unbounded face that contains the point when the trapezoid is
    * unbounded
    * \param tr The unbounded trapezoid whose face we should get
    * \param p  The query point.
@@ -381,24 +330,23 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
    * \return A Face_const_handle representing the arrangement unbounded face in
    *         which the point p lies
    */
-  Face_const_handle _get_unbounded_face (const Td_map_item& tr,
-                                         const Point_2& p,
-                                         Arr_all_sides_oblivious_tag) const;
+  Face_const_handle _get_unbounded_face(const Td_map_item& tr,
+                                        const Point_2& p,
+                                        Arr_all_sides_oblivious_tag) const;
 
-  /*! gets the unbounded face that contains the point when the trapezoid is
+  /*! Obtain the unbounded face that contains the point when the trapezoid is
    * unbounded
    * \param tr The unbounded trapezoid whose face we should get
    * \param p  The query point.
    * \param Arr_not_all_sides_oblivious_tag
-   * \return A Face_const_handle representing the arrangement unbounded face in which
-   *         the point p lies
+   * \return A Face_const_handle representing the arrangement unbounded face in
+   *         which the point p lies
    */
-  Face_const_handle _get_unbounded_face (const Td_map_item& tr,
-                                         const Point_2& p,
-                                         Arr_not_all_sides_oblivious_tag) const;
+  Face_const_handle _get_unbounded_face(const Td_map_item& tr,
+                                        const Point_2& p,
+                                        Arr_not_all_sides_oblivious_tag) const;
 
-  /*!
-   * Locate the arrangement feature which a vertical ray emanating from the
+  /*! Locate the arrangement feature which a vertical ray emanating from the
    * given point hits, considering isolated vertices.
    * \param p The query point.
    * \param shoot_up Indicates whether the ray is directed upward or downward.
@@ -413,11 +361,10 @@ class Arr_trapezoid_ric_point_location : public Arrangement_::Observer {
    * we check the isolated vertices inside the face to check whether there
    * is an isolated vertex right above/below the query point.
    */
-  result_type
-  _check_isolated_for_vertical_ray_shoot
-                             (Halfedge_const_handle halfedge_found,
-                              const Point_2& p, bool shoot_up,
-                              const Td_map_item& tr) const;
+  result_type _check_isolated_for_vertical_ray_shoot
+  (Halfedge_const_handle halfedge_found,
+   const Point_2& p, bool shoot_up,
+   const Td_map_item& tr) const;
 };
 
 } //namespace CGAL
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h b/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h
index 91ac2394e392..37aef38630cb 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_triangulation_point_location.h
@@ -40,70 +40,68 @@ namespace CGAL {
 template <typename Arrangement_>
 class Arr_triangulation_point_location : public Arrangement_::Observer {
 public:
-  typedef Arrangement_                                  Arrangement_2;
-
-  typedef typename Arrangement_2::Geometry_traits_2     Geometry_traits_2;
-  typedef typename Geometry_traits_2::Kernel            Kernel;
-
-  typedef typename Arrangement_2::Vertex_const_handle   Vertex_const_handle;
-  typedef typename Arrangement_2::Halfedge_const_handle Halfedge_const_handle;
-  typedef typename Arrangement_2::Face_const_handle     Face_const_handle;
-  typedef typename Arrangement_2::Vertex_handle                Vertex_handle;
-  typedef typename Arrangement_2::Halfedge_handle        Halfedge_handle;
-  typedef typename Arrangement_2::Face_handle                Face_handle;
-
-  typedef typename Arrangement_2::Vertex_const_iterator Vertex_const_iterator;
-  typedef typename Arrangement_2::Edge_const_iterator   Edge_const_iterator;
-  typedef typename Arrangement_2::Face_const_iterator   Face_const_iterator;
-  typedef typename Arrangement_2::Halfedge_const_iterator
-    Halfedge_const_iterator;
-  typedef typename Arrangement_2::Halfedge_around_vertex_const_circulator
-    Halfedge_around_vertex_const_circulator;
-  typedef typename Arrangement_2::Ccb_halfedge_const_circulator
-    Ccb_halfedge_const_circulator;
-  typedef typename Arrangement_2::Ccb_halfedge_circulator
-    Ccb_halfedge_circulator;
-  typedef typename Arrangement_2::Isolated_vertex_const_iterator
-    Isolated_vertex_const_iterator;
-
-  typedef typename Geometry_traits_2::Point_2            Point_2;
-  typedef typename Geometry_traits_2::X_monotone_curve_2 X_monotone_curve_2;
-
-  typedef std::list<Halfedge_const_handle>               Edge_list;
-  typedef typename Edge_list::iterator                   Std_edge_iterator;
+  using Arrangement_2 = Arrangement_;
+  using Base_aos = typename Arrangement_2::Base_aos;
+
+  using Geometry_traits_2 = typename Base_aos::Geometry_traits_2;
+  using Kernel = typename Geometry_traits_2::Kernel;
+
+  using Vertex_const_handle = typename Base_aos::Vertex_const_handle;
+  using Halfedge_const_handle = typename Base_aos::Halfedge_const_handle;
+  using Face_const_handle = typename Base_aos::Face_const_handle;
+  using Vertex_handle = typename Base_aos::Vertex_handle;
+  using Halfedge_handle = typename Base_aos::Halfedge_handle;
+  using Face_handle = typename Base_aos::Face_handle;
+
+  using Vertex_const_iterator = typename Base_aos::Vertex_const_iterator;
+  using Edge_const_iterator = typename Base_aos::Edge_const_iterator;
+  using Face_const_iterator = typename Base_aos::Face_const_iterator;
+  using Halfedge_const_iterator = typename Base_aos::Halfedge_const_iterator;
+  using Halfedge_around_vertex_const_circulator =
+    typename Base_aos::Halfedge_around_vertex_const_circulator;
+  using Ccb_halfedge_const_circulator =
+    typename Base_aos::Ccb_halfedge_const_circulator;
+  using Ccb_halfedge_circulator = typename Base_aos::Ccb_halfedge_circulator;
+  using Isolated_vertex_const_iterator =
+    typename Base_aos::Isolated_vertex_const_iterator;
+
+  using Point_2 = typename Geometry_traits_2::Point_2;
+  using X_monotone_curve_2 = typename Geometry_traits_2::X_monotone_curve_2;
+
+  using Edge_list = std::list<Halfedge_const_handle>;
+  using Std_edge_iterator = typename Edge_list::iterator;
 
   //----------------------------------------------------------
   // Triangulation Types
   //----------------------------------------------------------
-  typedef Triangulation_vertex_base_with_info_2<Vertex_const_handle, Kernel>
-    Vbb;
-  typedef Triangulation_hierarchy_vertex_base_2<Vbb>                  Vb;
+  using Vbb = Triangulation_vertex_base_with_info_2<Vertex_const_handle, Kernel>;
+  using Vb = Triangulation_hierarchy_vertex_base_2<Vbb>;
   //typedef Triangulation_face_base_with_info_2<CGAL::IO::Color,Kernel>    Fbt;
-  typedef Constrained_triangulation_face_base_2<Kernel>               Fb;
-  typedef Triangulation_data_structure_2<Vb,Fb>                       TDS;
-  typedef Exact_predicates_tag                                        Itag;
+  using Fb = Constrained_triangulation_face_base_2<Kernel>;
+  using TDS = Triangulation_data_structure_2<Vb,Fb>;
+  using Itag = Exact_predicates_tag;
   //typedef Constrained_Delaunay_triangulation_2<Kernel, TDS, Itag>    CDT;
-  typedef Constrained_Delaunay_triangulation_2<Kernel, TDS, Itag>     CDT_t;
-  typedef Triangulation_hierarchy_2<CDT_t>                            CDTH;
-  typedef Constrained_triangulation_plus_2<CDTH>                      CDT;
-
-  typedef typename CDT::Point                    CDT_Point;
-  typedef typename CDT::Edge                     CDT_Edge;
-  typedef typename CDT::Face_handle              CDT_Face_handle;
-  typedef typename CDT::Vertex_handle            CDT_Vertex_handle;
-  typedef typename CDT::Finite_faces_iterator    CDT_Finite_faces_iterator;
-  typedef typename CDT::Finite_vertices_iterator CDT_Finite_vertices_iterator;
-  typedef typename CDT::Finite_edges_iterator    CDT_Finite_edges_iterator;
-  typedef typename CDT::Locate_type              CDT_Locate_type;
-
-  typedef Arr_point_location_result<Arrangement_2>       Result;
-  typedef typename Result::Type                          Result_type;
+  using CDT_t = Constrained_Delaunay_triangulation_2<Kernel, TDS, Itag>;
+  using CDTH = Triangulation_hierarchy_2<CDT_t>;
+  using CDT = Constrained_triangulation_plus_2<CDTH>;
+
+  using CDT_Point = typename CDT::Point;
+  using CDT_Edge = typename CDT::Edge;
+  using CDT_Face_handle = typename CDT::Face_handle;
+  using CDT_Vertex_handle = typename CDT::Vertex_handle;
+  using CDT_Finite_faces_iterator = typename CDT::Finite_faces_iterator;
+  using CDT_Finite_vertices_iterator = typename CDT::Finite_vertices_iterator;
+  using CDT_Finite_edges_iterator = typename CDT::Finite_edges_iterator;
+  using CDT_Locate_type = typename CDT::Locate_type;
+
+  using Result = Arr_point_location_result<Base_aos>;
+  using Result_type = typename Result::Type;
 
   // Support cpp11::result_of
-  typedef Result_type                                    result_type;
+  using result_type = Result_type;
 
 protected:
-  typedef Arr_traits_basic_adaptor_2<Geometry_traits_2>  Traits_adaptor_2;
+  using Traits_adaptor_2 = Arr_traits_basic_adaptor_2<Geometry_traits_2>;
 
   // Data members:
   const Traits_adaptor_2* m_traits;     // Its associated traits object.
@@ -126,8 +124,8 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Constructor from an arrangement.
    * \param arr (in) The arrangement.
    */
-  Arr_triangulation_point_location(const Arrangement_2& arr) :
-    Arrangement_2::Observer(const_cast<Arrangement_2&>(arr)),
+  Arr_triangulation_point_location(const Base_aos& arr) :
+    Base_aos::Observer(const_cast<Base_aos&>(arr)),
     m_traits(static_cast<const Traits_adaptor_2*>(arr.geometry_traits())),
     m_ignore_notifications(false),
     m_ignore_remove_edge(false)
@@ -147,12 +145,12 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Attach an arrangement.
    * \param arr (in) The arrangement.
    */
-  virtual void before_attach(const Arrangement_2& arr)
+  virtual void before_attach(const Base_aos& arr) override
   { m_traits = static_cast<const Traits_adaptor_2*>(arr.geometry_traits()); }
 
-  virtual void after_attach() { build_triangulation(); }
+  virtual void after_attach() override { build_triangulation(); }
 
-  virtual void before_detach() { clear_triangulation(); }
+  virtual void before_detach() override { clear_triangulation(); }
 
   /// \name Overloaded observer functions on global changes.
   //@{
@@ -160,32 +158,28 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notification after the arrangement has been assigned with another
    * arrangement.
    */
-  virtual void after_assign()
-  {
+  virtual void after_assign() override {
     clear_triangulation();
     build_triangulation();
   }
 
   /*! Notification after the arrangement is cleared.
    */
-  virtual void after_clear()
-  {
+  virtual void after_clear() override {
     clear_triangulation();
     build_triangulation();
   }
 
   /*! Notification before a global operation modifies the arrangement.
    */
-  virtual void before_global_change()
-  {
+  virtual void before_global_change() override {
     clear_triangulation();
     m_ignore_notifications = true;
   }
 
   /*! Notification after a global operation is completed.
    */
-  virtual void after_global_change()
-  {
+  virtual void after_global_change() override {
     build_triangulation();
     m_ignore_notifications = false;
   }
@@ -197,14 +191,13 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notification before the removal of an edge.
    * \param e (in) A handle to one of the twin halfedges to be removed.
    */
-  virtual void before_remove_edge(Halfedge_handle /* e */)
+  virtual void before_remove_edge(Halfedge_handle /* e */) override
   { m_ignore_remove_edge = true; }
 
   /*! Notification after the creation of a new vertex.
    * \param v (in) A handle to the created vertex.
    */
-  virtual void after_create_vertex(Vertex_handle /* v */)
-  {
+  virtual void after_create_vertex(Vertex_handle /* v */) override {
     if (! m_ignore_notifications) {
       clear_triangulation();
       build_triangulation();
@@ -214,8 +207,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notification after the creation of a new edge.
    * \param e (in) A handle to one of the twin halfedges that were created.
    */
-  virtual void after_create_edge(Halfedge_handle /* e */)
-  {
+  virtual void after_create_edge(Halfedge_handle /* e */) override {
     if (! m_ignore_notifications) {
       clear_triangulation();
       build_triangulation();
@@ -227,8 +219,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
    * \param e2 (in) A handle to one of the twin halfedges forming the second edge.
    */
   virtual void after_split_edge(Halfedge_handle /* e1 */,
-                                Halfedge_handle /* e2 */)
-  {
+                                Halfedge_handle /* e2 */) override {
     if (! m_ignore_notifications) {
       clear_triangulation();
       build_triangulation();
@@ -242,8 +233,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
    */
   virtual void after_split_face(Face_handle /* f */,
                                 Face_handle /* new_f */,
-                                bool /* is_hole */)
-  {
+                                bool /* is_hole */) override {
     if (! m_ignore_notifications) {
       clear_triangulation();
       build_triangulation();
@@ -253,8 +243,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notification after an outer CCB was created inside a face.
    * \param h (in) A circulator representing the boundary of the new outer CCB.
    */
-  virtual void after_add_outer_ccb(Ccb_halfedge_circulator /* h */)
-  {
+  virtual void after_add_outer_ccb(Ccb_halfedge_circulator /* h */) override {
     if (! m_ignore_notifications) {
       clear_triangulation();
       build_triangulation();
@@ -264,8 +253,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notification after an edge was merged.
    * \param e (in) A handle to one of the twin halfedges forming the merged edge.
    */
-  virtual void after_merge_edge(Halfedge_handle /* e */)
-  {
+  virtual void after_merge_edge(Halfedge_handle /* e */) override {
     if (! m_ignore_notifications) {
       clear_triangulation();
       build_triangulation();
@@ -275,8 +263,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notification after a face was merged.
    * \param f (in) A handle to the merged face.
    */
-  virtual void after_merge_face(Face_handle /* f */)
-  {
+  virtual void after_merge_face(Face_handle /* f */) override {
     if (! m_ignore_notifications && ! m_ignore_remove_edge) {
       clear_triangulation();
       build_triangulation();
@@ -286,8 +273,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notification after an outer CCB  is moved from one face to another.
    * \param h (in) A circulator representing the boundary of the component.
    */
-  virtual void after_move_outer_ccb(Ccb_halfedge_circulator /* h */)
-  {
+  virtual void after_move_outer_ccb(Ccb_halfedge_circulator /* h */) override {
     if (! m_ignore_notifications) {
       clear_triangulation();
       build_triangulation();
@@ -297,8 +283,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notificaion before the removal of a vertex.
    * \param v (in) A handle to the vertex to be deleted.
    */
-  virtual void after_remove_vertex()
-  {
+  virtual void after_remove_vertex() override {
     if (! m_ignore_notifications && ! m_ignore_remove_edge) {
       clear_triangulation();
       build_triangulation();
@@ -308,8 +293,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notification before the removal of an edge.
    * \param e (in) A handle to one of the twin halfedges to be deleted.
    */
-  virtual void after_remove_edge()
-  {
+  virtual void after_remove_edge() override {
     if (! m_ignore_notifications) {
       clear_triangulation();
       build_triangulation();
@@ -320,8 +304,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notification before the removal of an outer CCB.
    * \param f (in) The face that used to own the outer CCB.
    */
-  virtual void after_remove_outer_ccb(Face_handle /* f */)
-  {
+  virtual void after_remove_outer_ccb(Face_handle /* f */) override {
     if (! m_ignore_notifications && ! m_ignore_remove_edge) {
       clear_triangulation();
       build_triangulation();
@@ -331,8 +314,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notification after an inner CCB was created inside a face.
    * \param h (in) A circulator representing the boundary of the new inner CCB.
    */
-  virtual void after_add_inner_ccb(Ccb_halfedge_circulator /* h */)
-  {
+  virtual void after_add_inner_ccb(Ccb_halfedge_circulator /* h */) override {
     if (! m_ignore_notifications) {
       clear_triangulation();
       build_triangulation();
@@ -342,8 +324,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notification after an inner CCB is moved from one face to another.
    * \param h (in) A circulator representing the boundary of the component.
    */
-  virtual void after_move_inner_ccb(Ccb_halfedge_circulator /* h */)
-  {
+  virtual void after_move_inner_ccb(Ccb_halfedge_circulator /* h */) override {
     if (! m_ignore_notifications) {
       clear_triangulation();
       build_triangulation();
@@ -353,8 +334,7 @@ class Arr_triangulation_point_location : public Arrangement_::Observer {
   /*! Notificaion after the removal of an inner CCB.
    * \param f (in) The face that used to contain the inner CCB.
    */
-  virtual void after_remove_inner_ccb(Face_handle /* f */)
-  {
+  virtual void after_remove_inner_ccb(Face_handle /* f */) override {
     if (! m_ignore_notifications && ! m_ignore_remove_edge) {
       clear_triangulation();
       build_triangulation();
diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_vertex_index_map.h b/Arrangement_on_surface_2/include/CGAL/Arr_vertex_index_map.h
index 92f412d2495c..a9682dc5bad1 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_vertex_index_map.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_vertex_index_map.h
@@ -34,153 +34,120 @@ namespace CGAL {
  * arrangement vertices to the indices 0, ..., (n -1), where n is the number
  * of vertices in the arrangement.
  */
-template <class Arrangement_>
+template <typename Arrangement_>
 class Arr_vertex_index_map : public Arrangement_::Observer {
 public:
+  using Arrangement_2 = Arrangement_;
+  using Base_aos = typename Arrangement_2::Base_aos;
 
-  typedef Arrangement_                            Arrangement_2;
-  typedef typename Arrangement_2::Vertex_handle   Vertex_handle;
+  using Vertex_handle = typename Base_aos::Vertex_handle;
 
   // Boost property type definitions:
-  typedef boost::readable_property_map_tag        category;
-  typedef unsigned int                            value_type;
-  typedef value_type                              reference;
-  typedef Vertex_handle                           key_type;
+  using category = boost::readable_property_map_tag;
+  using value_type = unsigned int;
+  using reference = value_type;
+  using key_type = Vertex_handle;
 
 private:
+  using Self = Arr_vertex_index_map<Arrangement_2>;
+  using Base = typename Arrangement_2::Observer;
 
-  typedef Arr_vertex_index_map<Arrangement_2>     Self;
-  typedef typename Arrangement_2::Observer        Base;
-
-  typedef Unique_hash_map<Vertex_handle, unsigned int>     Index_map;
+  using Index_map = Unique_hash_map<Vertex_handle, unsigned int>;
 
   // Data members:
-  unsigned int                n_vertices;  // The current number of vertices.
-  Index_map                   index_map;   // Mapping vertices to indices.
-  std::vector<Vertex_handle>  rev_map;     // Mapping indices to vertices.
+  unsigned int n_vertices;                 // The current number of vertices.
+  Index_map index_map;                     // Mapping vertices to indices.
+  std::vector<Vertex_handle> rev_map;      // Mapping indices to vertices.
 
   enum {MIN_REV_MAP_SIZE = 32};
 
 public:
-
   /*! Default constructor. */
-  Arr_vertex_index_map () :
+  Arr_vertex_index_map() :
     Base(),
-    n_vertices (0),
-    rev_map (MIN_REV_MAP_SIZE)
+    n_vertices(0),
+    rev_map(MIN_REV_MAP_SIZE)
   {}
 
   /*! Constructor with an associated arrangement. */
-  Arr_vertex_index_map (const Arrangement_2& arr) :
-    Base(const_cast<Arrangement_2&>(arr))
-  {
-    _init();
-  }
+  Arr_vertex_index_map(const Base_aos& arr) :
+    Base(const_cast<Base_aos&>(arr))
+  { _init(); }
 
   /*! Copy constructor. */
-  Arr_vertex_index_map (const Self& other) :
-    Base(const_cast<typename Base::Arrangement_2&> (*(other.arrangement())))
-  {
-    _init();
-  }
+  Arr_vertex_index_map(const Self& other) :
+    Base(const_cast<Base_aos&>(*(other.arrangement())))
+  { _init(); }
 
   /*! Assignment operator. */
-  Self& operator= (const Self& other)
-  {
-    if (this == &other)
-      return (*this);
+  Self& operator= (const Self& other) {
+    if (this == &other) return (*this);
 
     this->detach();
-    this->attach (const_cast<typename Base::Arrangement_2&> (*(other.arrangement())));
+    this->attach(const_cast<Base_aos&>(*(other.arrangement())));
 
     return (*this);
   }
 
-  /*!
-   * Get the index of a given vertex.
+  /*! Get the index of a given vertex.
    * \param v A handle to the vertex.
    * \pre v is a valid vertex in the arrangement.
    */
-  unsigned int operator[] (Vertex_handle v) const
-  {
-    return index_map[v];
-  }
+  unsigned int operator[](Vertex_handle v) const { return index_map[v]; }
 
-  /*!
-   * Get the vertex given its index.
+  /*! Get the vertex given its index.
    * \param i The index of the vertex.
    * \pre i is less than the number of vertices in the graph.
    */
-  Vertex_handle vertex (const int i) const
-  {
-    CGAL_precondition (i < n_vertices);
-
+  Vertex_handle vertex(const int i) const {
+    CGAL_precondition(i < n_vertices);
     return rev_map[i];
   }
 
   /// \name Notification functions, to keep the mapping up-to-date.
   //@{
 
-  /*!
-   * Update the mapping after the arrangement has been assigned with another
+  /*! Update the mapping after the arrangement has been assigned with another
    * arrangement.
    */
-  virtual void after_assign ()
-  {
-    _init();
-  }
+  virtual void after_assign() override { _init(); }
 
-  /*!
-   * Update the mapping after the arrangement is cleared.
+  /*! Update the mapping after the arrangement is cleared.
    */
-  virtual void after_clear ()
-  {
-    _init();
-  }
+  virtual void after_clear() override { _init(); }
 
-  /*!
-   * Update the mapping after attaching to a new arrangement.
+  /*! Update the mapping after attaching to a new arrangement.
    */
-  virtual void after_attach ()
-  {
-    _init();
-  }
+  virtual void after_attach() override { _init(); }
 
-  /*!
-   * Update the mapping after detaching the arrangement.
+  /*! Update the mapping after detaching the arrangement.
    */
-  virtual void after_detach ()
-  {
+  virtual void after_detach() override {
     n_vertices = 0;
     index_map.clear();
   }
 
-  /*!
-   * Update the mapping after the creation of a new vertex.
+  /*! Update the mapping after the creation of a new vertex.
    * \param v A handle to the created vertex.
    */
-  virtual void after_create_vertex (Vertex_handle v)
-  {
+  virtual void after_create_vertex(Vertex_handle v) override {
     // Update the number of vertices.
-    n_vertices++;
+    ++n_vertices;
 
     // If necessary, allocate memory for the reverse mapping.
-    if (rev_map.size() < n_vertices)
-      rev_map.resize (2 * n_vertices);
+    if (rev_map.size() < n_vertices) rev_map.resize(2 * n_vertices);
 
     // Update the mapping of the newly created vertex.
     index_map[v] = n_vertices - 1;
     rev_map[n_vertices - 1] = v;
   }
 
-  /*!
-   * Update the mapping after the creation of a new boundary vertex.
+  /*! Update the mapping after the creation of a new boundary vertex.
    * \param v A handle to the created vertex.
    */
-  virtual void after_create_boundary_vertex (Vertex_handle v)
-  {
+  virtual void after_create_boundary_vertex(Vertex_handle v) override {
     // Update the number of vertices.
-    n_vertices++;
+    ++n_vertices;
 
     // If necessary, allocate memory for the reverse mapping.
     if (rev_map.size() < n_vertices)
@@ -191,31 +158,28 @@ class Arr_vertex_index_map : public Arrangement_::Observer {
     rev_map[n_vertices - 1] = v;
   }
 
-  /*!
-   * Update the mapping before the removal of a vertex.
+  /*! Update the mapping before the removal of a vertex.
    * \param v A handle to the vertex to be removed.
    */
-  virtual void before_remove_vertex (Vertex_handle v)
-  {
+  virtual void before_remove_vertex(Vertex_handle v) override {
     // Update the number of vertices.
-    n_vertices--;
+    --n_vertices;
 
     // Reduce memory consumption in case the number of vertices has
     // drastically decreased.
     if (2*n_vertices+1 < rev_map.size() &&
         rev_map.size() / 2 >= MIN_REV_MAP_SIZE)
     {
-      rev_map.resize (rev_map.size() / 2);
+      rev_map.resize(rev_map.size() / 2);
     }
 
     // Get the current vertex index, and assign this index to the vertex
     // currently indexed (n - 1).
-    unsigned int   index = index_map[v];
+    unsigned int index = index_map[v];
 
-    if (index == n_vertices)
-      return;
+    if (index == n_vertices) return;
 
-    Vertex_handle  last_v = rev_map[n_vertices];
+    Vertex_handle last_v = rev_map[n_vertices];
     index_map[last_v] = index;
     rev_map[index] = last_v;
 
@@ -225,51 +189,42 @@ class Arr_vertex_index_map : public Arrangement_::Observer {
   //@}
 
 private:
-
   /*! Initialize the map for the given arrangement. */
-  void _init ()
-  {
+  void _init() {
     // Get the number of vertices and allocate the reverse map accordingly.
-    n_vertices = static_cast<unsigned int>(this->arrangement()->number_of_vertices());
+    n_vertices =
+      static_cast<unsigned int>(this->arrangement()->number_of_vertices());
 
-    if (n_vertices < MIN_REV_MAP_SIZE)
-      rev_map.resize (MIN_REV_MAP_SIZE);
-    else
-      rev_map.resize (n_vertices);
+    if (n_vertices < MIN_REV_MAP_SIZE) rev_map.resize (MIN_REV_MAP_SIZE);
+    else rev_map.resize (n_vertices);
 
     // Clear the current mapping.
     index_map.clear();
 
     // Create the initial mapping.
-    typename Arrangement_2::Vertex_iterator   vit;
-    Vertex_handle                             vh;
-    unsigned int                              index = 0;
+    Vertex_handle vh;
+    unsigned int index = 0;
 
-    for (vit = this->arrangement()->vertices_begin();
-         vit != this->arrangement()->vertices_end(); ++vit, ++index)
-    {
+    for (auto vit = this->arrangement()->vertices_begin();
+         vit != this->arrangement()->vertices_end(); ++vit, ++index) {
       // Map the current vertex to the current index.
       vh = vit;
       index_map[vh] = index;
       rev_map[index] = vh;
     }
   }
-
 };
 
-/*!
- * Get the index property-map function. Provided so that boost is able to
+/*! Get the index property-map function. Provided so that boost is able to
  * access the Arr_vertex_index_map above.
  * \param index_map The index map.
  * \param v A vertex handle.
  * \return The vertex index.
  */
-template<class Arrangement>
-unsigned int get (const CGAL::Arr_vertex_index_map<Arrangement>& index_map,
-                  typename Arrangement::Vertex_handle v)
-{
-  return index_map[v];
-}
+template <typename Arrangement>
+unsigned int get(const CGAL::Arr_vertex_index_map<Arrangement>& index_map,
+                 typename Arrangement::Vertex_handle v)
+{ return index_map[v]; }
 
 } //namespace CGAL
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
index 6b59905c8d7c..0c1cb425cf80 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_with_history_2.h
@@ -274,109 +274,85 @@ class Arrangement_on_surface_with_history_2 :
    */
   class Curve_halfedges_observer : public Base_arr_2::Observer {
   public:
+    using Base_aos = typename Base_arr_2::Base_aos;
 
-    typedef typename Base_arr_2::Halfedge_handle     Halfedge_handle;
-    typedef typename Base_arr_2::Vertex_handle       Vertex_handle;
-    typedef typename Base_arr_2::X_monotone_curve_2  X_monotone_curve_2;
+    using Vertex_handle = typename Base_aos::Vertex_handle;
+    using Halfedge_handle = typename Base_aos::Halfedge_handle;
+    using X_monotone_curve_2 = typename Base_aos::X_monotone_curve_2;
 
-    /*!
-     * Notification after the creation of a new edge.
+    /*! Notification after the creation of a new edge.
      * \param e A handle to one of the twin halfedges that were created.
      */
-    virtual void after_create_edge (Halfedge_handle e)
-    {
-      _register_edge(e);
-    }
+    virtual void after_create_edge(Halfedge_handle e) override
+    { _register_edge(e); }
 
     /*!
      * Notification before the modification of an existing edge.
      * \param e A handle to one of the twin halfedges to be updated.
      * \param c The x-monotone curve to be associated with the edge.
      */
-    virtual void before_modify_edge (Halfedge_handle e,
-                                     const X_monotone_curve_2& /* c */)
-    {
-      _unregister_edge(e);
-    }
+    virtual void before_modify_edge(Halfedge_handle e,
+                                    const X_monotone_curve_2& /* c */) override
+    { _unregister_edge(e); }
 
-    /*!
-     * Notification after an edge was modified.
+    /*! Notification after an edge was modified.
      * \param e A handle to one of the twin halfedges that were updated.
      */
-    virtual void after_modify_edge (Halfedge_handle e)
-    {
-      _register_edge(e);
-    }
+    virtual void after_modify_edge(Halfedge_handle e) override
+    { _register_edge(e); }
 
-    /*!
-     * Notification before the splitting of an edge into two.
+    /*! Notification before the splitting of an edge into two.
      * \param e A handle to one of the existing halfedges.
      * \param c1 The x-monotone curve to be associated with the first edge.
      * \param c2 The x-monotone curve to be associated with the second edge.
      */
-    virtual void before_split_edge (Halfedge_handle e,
-                                    Vertex_handle /* v */,
-                                    const X_monotone_curve_2& /* c1 */,
-                                    const X_monotone_curve_2& /* c2 */)
-    {
-      _unregister_edge(e);
-    }
+    virtual void before_split_edge(Halfedge_handle e,
+                                   Vertex_handle /* v */,
+                                   const X_monotone_curve_2& /* c1 */,
+                                   const X_monotone_curve_2& /* c2 */) override
+    { _unregister_edge(e); }
 
-    /*!
-     * Notification after an edge was split.
+    /*! Notification after an edge was split.
      * \param e1 A handle to one of the twin halfedges forming the first edge.
      * \param e2 A handle to one of the twin halfedges forming the second edge.
      */
-    virtual void after_split_edge (Halfedge_handle e1, Halfedge_handle e2)
-    {
+    virtual void after_split_edge(Halfedge_handle e1, Halfedge_handle e2)
+      override {
       _register_edge(e1);
       _register_edge(e2);
     }
 
-    /*!
-     * Notification before the merging of two edges.
+    /*! Notification before the merging of two edges.
      * \param e1 A handle to one of the halfedges forming the first edge.
      * \param e2 A handle to one of the halfedges forming the second edge.
      * \param c The x-monotone curve to be associated with the merged edge.
      */
-    virtual void before_merge_edge (Halfedge_handle e1, Halfedge_handle e2,
-                                    const X_monotone_curve_2& /* c */)
-    {
+    virtual void before_merge_edge(Halfedge_handle e1, Halfedge_handle e2,
+                                   const X_monotone_curve_2& /* c */) override {
       _unregister_edge(e1);
       _unregister_edge(e2);
     }
 
-    /*!
-     * Notification after an edge was merged.
+    /*! Notification after an edge was merged.
      * \param e A handle to one of the twin halfedges forming the merged edge.
      */
-    virtual void after_merge_edge (Halfedge_handle e)
-    {
-      _register_edge(e);
-    }
+    virtual void after_merge_edge(Halfedge_handle e) override
+    { _register_edge(e); }
 
-    /*!
-     * Notification before the removal of an edge.
+    /*! Notification before the removal of an edge.
      * \param e A handle to one of the twin halfedges to be deleted.
      */
-    virtual void before_remove_edge (Halfedge_handle e)
-    {
-      _unregister_edge(e);
-    }
+    virtual void before_remove_edge(Halfedge_handle e) override
+    { _unregister_edge(e); }
 
   private:
 
-    /*!
-     * Register the given halfedge in the set(s) associated with its curve.
+    /*! Register the given halfedge in the set(s) associated with its curve.
      */
-    void _register_edge (Halfedge_handle e)
-    {
-      Curve_halfedges  *curve_halfedges;
-      Data_iterator     di;
-
-      for (di = e->curve().data().begin(); di != e->curve().data().end(); ++di)
-      {
-        curve_halfedges = static_cast<Curve_halfedges*>(*di);
+    void _register_edge(Halfedge_handle e) {
+      for (auto di = e->curve().data().begin(); di != e->curve().data().end();
+           ++di) {
+        Curve_halfedges*  curve_halfedges = static_cast<Curve_halfedges*>(*di);
         curve_halfedges->_insert(e);
       }
     }
@@ -384,14 +360,10 @@ class Arrangement_on_surface_with_history_2 :
     /*!
      * Unregister the given halfedge from the set(s) associated with its curve.
      */
-    void _unregister_edge (Halfedge_handle e)
-    {
-      Curve_halfedges  *curve_halfedges;
-      Data_iterator     di;
-
-      for (di = e->curve().data().begin(); di != e->curve().data().end(); ++di)
-      {
-        curve_halfedges = static_cast<Curve_halfedges*>(*di);
+    void _unregister_edge(Halfedge_handle e) {
+      for (auto di = e->curve().data().begin(); di != e->curve().data().end();
+           ++di) {
+        Curve_halfedges* curve_halfedges = static_cast<Curve_halfedges*>(*di);
         curve_halfedges->_erase(e);
       }
     }
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
index c095d9c25079..5156fde017bf 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
@@ -33,684 +33,509 @@ typedef Traits_2::Point_2                             Point_2;
 typedef Traits_2::X_monotone_curve_2                  Segment_2;
 typedef CGAL::Arrangement_2<Traits_2>                 Arrangement_2;
 
-void skip_comments(std::ifstream & is, char * line)
-{
+void skip_comments(std::ifstream & is, char* line) {
   while (!is.eof()) {
     is.getline(line, 128);
     if (line[0] != '#') break;
   }
 }
 
-void compare_results(std::string str)
-{
-    skip_comments(global_input_file, one_line);
-    std::istringstream str_stream(one_line);
-    str_stream.getline(buff, 128, ' ');
-    if (std::string(buff)!=str)
-    {
-      std::cout << "Expected " << std::string(buff) << " obtained "
-                << str << std::endl;
-      ok=-1;
-    }
+void compare_results(std::string str) {
+  skip_comments(global_input_file, one_line);
+  std::istringstream str_stream(one_line);
+  str_stream.getline(buff, 128, ' ');
+  if (std::string(buff) != str) {
+    std::cout << "Expected " << std::string(buff) << " obtained "
+              << str << std::endl;
+    ok = -1;
+  }
 }
 
 // An arrangement observer, used to receive notifications of face splits and
 // face mergers.
 class Test_observer : public Arrangement_2::Observer {
-
 public:
-  using Base_aos = typename Arrangement_2::Base_aos;
+  using Observer = Arrangement_2::Observer;
+  using Base_aos = Arrangement_2::Base_aos;
+
+  using Vertex_handle = Base_aos::Vertex_handle;
+  using Halfedge_handle = Base_aos::Halfedge_handle;
+  using Face_handle = Base_aos::Face_handle;
+  using Ccb_halfedge_circulator = Base_aos::Ccb_halfedge_circulator;
+  using Point_2 = Base_aos::Point_2;
+  using X_monotone_curve_2 = Base_aos::X_monotone_curve_2;
 
-  Test_observer(Arrangement_2& arr) : Arrangement_2::Observer(arr) {}
+  Test_observer(Base_aos& arr) : Observer(arr) {}
 
   /// \name Notification functions on global arrangement operations.
   //@{
 
-  /*! Notification before the arrangement is assigned with the content of another
-   * arrangement.
-   * \param arr The other arrangement. Notice that the arrangement type is the type used to
-   *            instantiate the observer, which is conveniently defined as
-   *            `Arrangement_2::Base_aos`.
+  /*! Notification before the arrangement is assigned with the content of
+   * another arrangement.
+   * \param arr The other arrangement. Notice that the arrangement type is the
+   *            type used to instantiate the observer, which is conveniently
+   *            defined as `Arrangement_2::Base_aos`.
    */
-  virtual void before_assign (const Base_aos& /* arr */)
+  virtual void before_assign(const Base_aos& /* arr */) override
   { compare_results("before_assign"); }
 
   /*!
    * Notification after the arrangement has been assigned with another
    * arrangement.
    */
-  virtual void after_assign ()
-  {
-    compare_results("after_assign");
-  }
+  virtual void after_assign() override { compare_results("after_assign"); }
 
   /*! Notification before the arrangement is cleared. */
-  virtual void before_clear ()
-  {
-    compare_results("before_clear");
-  }
+  virtual void before_clear() override { compare_results("before_clear"); }
 
   /*!
    * Notification after the arrangement is cleared.
    */
-  virtual void after_clear ()
-  {
-    compare_results("after_clear");
-  }
+  virtual void after_clear() override { compare_results("after_clear"); }
 
   /*! Notification before a global operation modifies the arrangement. */
-  virtual void before_global_change ()
-  {
-    compare_results("before_global_change");
-  }
+  virtual void before_global_change() override
+  { compare_results("before_global_change"); }
 
   /*! Notification after a global operation is completed. */
-  virtual void after_global_change ()
-  {
-    compare_results("after_global_change");
-  }
+  virtual void after_global_change() override
+  { compare_results("after_global_change"); }
   //@}
 
   /// \name Notification functions on observer attachment or detachment.
   //@{
 
-  /*!
-   * Notification before the observer is attached to an arrangement.
+  /*! Notification before the observer is attached to an arrangement.
    * \param arr The arrangement we are about to attach the observer to.
    */
-  virtual void before_attach (const Base_aos& /* arr */)
-  {
-    compare_results("before_attach");
-  }
+  virtual void before_attach(const Base_aos& /* arr */) override
+  { compare_results("before_attach"); }
 
-  /*!
-   * Notification after the observer has been attached to an arrangement.
+  /*! Notification after the observer has been attached to an arrangement.
    */
-  virtual void after_attach ()
-  {
-    compare_results("after_attach");
-  }
+  virtual void after_attach() override { compare_results("after_attach"); }
 
-  /*!
-   * Notification before the observer is detached from the arrangement.
+  /*! Notification before the observer is detached from the arrangement.
    */
-  virtual void before_detach ()
-  {
-    compare_results("before_detach");
-  }
+  virtual void before_detach() override { compare_results("before_detach"); }
 
-  /*!
-   * Notification after the observer has been detached to the arrangement.
+  /*! Notification after the observer has been detached to the arrangement.
    */
-  virtual void after_detach ()
-
-  {
-    compare_results("after_detach");
-  }
+  virtual void after_detach() override { compare_results("after_detach"); }
   //@}
 
   /// \name Notification functions on local changes in the arrangement.
   //@{
 
-  /*!
-   * Notification before the creation of a new vertex.
+  /*! Notification before the creation of a new vertex.
    * \param p The point to be associated with the vertex.
    *          This point cannot lies on the surface boundaries.
    */
-  virtual void before_create_vertex (const Point_2& /* p */)
-  {
-    compare_results("before_create_vertex");
-  }
+  virtual void before_create_vertex(const Point_2& /* p */) override
+  { compare_results("before_create_vertex"); }
 
-  /*!
-   * Notification after the creation of a new vertex.
+  /*! Notification after the creation of a new vertex.
    * \param v A handle to the created vertex.
    */
-  virtual void after_create_vertex (Vertex_handle /* v */)
-  {
-    compare_results("after_create_vertex");
-  }
+  virtual void after_create_vertex(Vertex_handle /* v */) override
+  { compare_results("after_create_vertex"); }
 
-  /*!
-   * Notification before the creation of a new boundary vertex.
+  /*! Notification before the creation of a new boundary vertex.
    * \param cv The curve incident to the surface boundary.
    * \param ind The relevant curve-end.
    * \param bound_x The boundary condition of the vertex in x.
    * \param bound_y The boundary condition of the vertex in y.
    */
-  virtual void before_create_boundary_vertex (const X_monotone_curve_2& /*cv*/,
-                                              CGAL::Arr_curve_end /* ind */,
-                                              CGAL::Arr_parameter_space /* bound_x */,
-                                              CGAL::Arr_parameter_space /* bound_y */)
-  {
-    compare_results("before_create_boundary_vertex");
-  }
+  virtual void
+  before_create_boundary_vertex(const X_monotone_curve_2& /*cv*/,
+                                CGAL::Arr_curve_end /* ind */,
+                                CGAL::Arr_parameter_space /* bound_x */,
+                                CGAL::Arr_parameter_space /* bound_y */)
+    override
+  { compare_results("before_create_boundary_vertex"); }
 
-  /*!
-   * Notification after the creation of a new vertex at infinity.
+  /*! Notification after the creation of a new vertex at infinity.
    * \param v A handle to the created vertex.
    */
-  virtual void after_create_boundary_vertex (Vertex_handle /* v */)
-  {
-    compare_results("after_create_boundary_vertex");
-  }
+  virtual void after_create_boundary_vertex(Vertex_handle /* v */) override
+  { compare_results("after_create_boundary_vertex"); }
 
-  /*!
-   * Notification before the creation of a new edge.
+  /*! Notification before the creation of a new edge.
    * \param c The x-monotone curve to be associated with the edge.
    * \param v1 A handle to the first end-vertex of the edge.
    * \param v2 A handle to the second end-vertex of the edge.
    */
-  virtual void before_create_edge (const X_monotone_curve_2& /* c */,
-                                   Vertex_handle /* v1 */,
-                                   Vertex_handle /* v2 */)
-  {
-    compare_results("before_create_edge");
-  }
+  virtual void before_create_edge(const X_monotone_curve_2& /* c */,
+                                  Vertex_handle /* v1 */,
+                                  Vertex_handle /* v2 */) override
+  { compare_results("before_create_edge"); }
 
-  /*!
-   * Notification after the creation of a new edge.
+  /*! Notification after the creation of a new edge.
    * \param e A handle to one of the twin halfedges that were created.
    */
-  virtual void after_create_edge (Halfedge_handle /* e */)
-  {
-    compare_results("after_create_edge");
-  }
+  virtual void after_create_edge(Halfedge_handle /* e */) override
+  { compare_results("after_create_edge"); }
 
-  /*!
-   * Notification before the modification of an existing vertex.
+  /*! Notification before the modification of an existing vertex.
    * \param v A handle to the vertex to be updated.
    * \param p The point to be associated with the vertex.
    */
-  virtual void before_modify_vertex (Vertex_handle /* v */,
-                                     const Point_2& /* p */)
-  {
-    compare_results("before_modify_vertex");
-  }
+  virtual void before_modify_vertex(Vertex_handle /* v */,
+                                    const Point_2& /* p */) override
+  { compare_results("before_modify_vertex"); }
 
-  /*!
-   * Notification after a vertex was modified.
+  /*! Notification after a vertex was modified.
    * \param v A handle to the updated vertex.
    */
-  virtual void after_modify_vertex (Vertex_handle /* v */)
-  {
-    compare_results("after_modify_vertex");
-  }
+  virtual void after_modify_vertex(Vertex_handle /* v */) override
+  { compare_results("after_modify_vertex"); }
 
-  /*!
-   * Notification before the modification of an existing edge.
+  /*! Notification before the modification of an existing edge.
    * \param e A handle to one of the twin halfedges to be updated.
    * \param c The x-monotone curve to be associated with the edge.
    */
-  virtual void before_modify_edge (Halfedge_handle /* e */,
-                                   const X_monotone_curve_2& /* c */)
-  {
-    compare_results("before_modify_edge");
-  }
+  virtual void before_modify_edge(Halfedge_handle /* e */,
+                                  const X_monotone_curve_2& /* c */) override
+  { compare_results("before_modify_edge"); }
 
-  /*!
-   * Notification after an edge was modified.
+  /*! Notification after an edge was modified.
    * \param e A handle to one of the twin halfedges that were updated.
    */
-  virtual void after_modify_edge (Halfedge_handle /* e */)
-  {
-    compare_results("after_modify_edge");
-  }
+  virtual void after_modify_edge(Halfedge_handle /* e */) override
+  { compare_results("after_modify_edge"); }
 
-  /*!
-   * Notification before the splitting of an edge into two.
+  /*! Notification before the splitting of an edge into two.
    * \param e A handle to one of the existing halfedges.
    * \param v A vertex representing the split point.
    * \param c1 The x-monotone curve to be associated with the first edge.
    * \param c2 The x-monotone curve to be associated with the second edge.
    */
-  virtual void before_split_edge (Halfedge_handle /* e */,
-                                  Vertex_handle /* v */,
-                                  const X_monotone_curve_2& /* c1 */,
-                                  const X_monotone_curve_2& /* c2 */)
-  {
-    compare_results("before_split_edge");
-  }
+  virtual void before_split_edge(Halfedge_handle /* e */,
+                                 Vertex_handle /* v */,
+                                 const X_monotone_curve_2& /* c1 */,
+                                 const X_monotone_curve_2& /* c2 */) override
+  { compare_results("before_split_edge"); }
 
-  /*!
-   * Notification after an edge was split.
+  /*! Notification after an edge was split.
    * \param e1 A handle to one of the twin halfedges forming the first edge.
    * \param e2 A handle to one of the twin halfedges forming the second edge.
    */
-  virtual void after_split_edge (Halfedge_handle /* e1 */,
-                                 Halfedge_handle /* e2 */)
-  {
-    compare_results("after_split_edge");
-  }
+  virtual void after_split_edge(Halfedge_handle /* e1 */,
+                                Halfedge_handle /* e2 */) override
+  { compare_results("after_split_edge"); }
 
-  /*!
-   * Notification before the splitting of a fictitious edge into two.
+  /*! Notification before the splitting of a fictitious edge into two.
    * \param e A handle to one of the existing halfedges.
    * \param v A vertex representing the unbounded split point.
    */
-  virtual void before_split_fictitious_edge (Halfedge_handle /* e */,
-                                             Vertex_handle /* v */)
-  {
-    compare_results("before_split_fictitious_edge");
-  }
+  virtual void before_split_fictitious_edge(Halfedge_handle /* e */,
+                                            Vertex_handle /* v */) override
+  { compare_results("before_split_fictitious_edge"); }
 
-  /*!
-   * Notification after a fictitious edge was split.
+  /*! Notification after a fictitious edge was split.
    * \param e1 A handle to one of the twin halfedges forming the first edge.
    * \param e2 A handle to one of the twin halfedges forming the second edge.
    */
-  virtual void after_split_fictitious_edge (Halfedge_handle /* e1 */,
-                                            Halfedge_handle /* e2 */)
-  {
-    compare_results("after_split_fictitious_edge");
-  }
+  virtual void after_split_fictitious_edge(Halfedge_handle /* e1 */,
+                                           Halfedge_handle /* e2 */) override
+  { compare_results("after_split_fictitious_edge"); }
 
-  /*!
-   * Notification before the splitting of a face into two.
+  /*! Notification before the splitting of a face into two.
    * \param f A handle to the existing face.
    * \param e The new edge whose insertion causes the face to split.
    */
-  virtual void before_split_face (Face_handle /* f */,
-                                  Halfedge_handle /* e */)
-  {
-    compare_results("before_split_face");
-  }
+  virtual void before_split_face(Face_handle /* f */,
+                                 Halfedge_handle /* e */) override
+  { compare_results("before_split_face"); }
 
-  /*!
-   * Notification after a face was split.
+  /*! Notification after a face was split.
    * \param f A handle to the face we have just split.
    * \param new_f A handle to the new face that has been created.
    * \param is_hole Whether the new face forms a hole inside f.
    */
   virtual void after_split_face (Face_handle /* f */,
                                  Face_handle /* new_f */,
-                                 bool /* is_hole */)
-  {
-    compare_results("after_split_face");
-  }
+                                 bool /* is_hole */) override
+  { compare_results("after_split_face"); }
 
-  /*!
-   * Notification before the splitting of an outer CCB into two.
+  /*! Notification before the splitting of an outer CCB into two.
    * \param f A handle to the face that owns the outer CCB.
    * \param h A circulator representing the component boundary.
    * \param e The new edge whose removal causes the outer CCB to split.
    */
-  virtual void before_split_outer_ccb (Face_handle /* f */,
-                                       Ccb_halfedge_circulator /* h */,
-                                       Halfedge_handle /* e */)
-  {
-    compare_results("before_split_outer_ccb");
-  }
+  virtual void before_split_outer_ccb(Face_handle /* f */,
+                                      Ccb_halfedge_circulator /* h */,
+                                      Halfedge_handle /* e */) override
+  { compare_results("before_split_outer_ccb"); }
 
-  /*!
-   * Notification after an outer CCB was split.
+  /*! Notification after an outer CCB was split.
    * \param f A handle to the face that owns the outer CCBs.
    * \param h1 A circulator representing the boundary of the first component.
    * \param h2 A circulator representing the boundary of the second component.
    */
-  virtual void after_split_outer_ccb (Face_handle /* f */,
-                                      Ccb_halfedge_circulator /* h1 */,
-                                      Ccb_halfedge_circulator /* h2 */)
-  {
-    compare_results("after_split_outer_ccb");
-  }
+  virtual void after_split_outer_ccb(Face_handle /* f */,
+                                     Ccb_halfedge_circulator /* h1 */,
+                                     Ccb_halfedge_circulator /* h2 */) override
+  { compare_results("after_split_outer_ccb"); }
 
-  /*!
-   * Notification before the splitting of an inner CCB into two.
+  /*! Notification before the splitting of an inner CCB into two.
    * \param f A handle to the face containing the inner CCB.
    * \param h A circulator representing the component boundary.
    * \param e The new edge whose removal causes the inner CCB to split.
    */
-  virtual void before_split_inner_ccb (Face_handle /* f */,
-                                       Ccb_halfedge_circulator /* h */,
-                                       Halfedge_handle /* e */)
-  {
-    compare_results("before_split_inner_ccb");
-  }
+  virtual void before_split_inner_ccb(Face_handle /* f */,
+                                      Ccb_halfedge_circulator /* h */,
+                                      Halfedge_handle /* e */) override
+  { compare_results("before_split_inner_ccb"); }
 
-  /*!
-   * Notification after an inner CCB was split.
+  /*! Notification after an inner CCB was split.
    * \param f A handle to the face containing the inner CCBs.
    * \param h1 A circulator representing the boundary of the first component.
    * \param h2 A circulator representing the boundary of the second component.
    */
-  virtual void after_split_inner_ccb (Face_handle /* f */,
-                                      Ccb_halfedge_circulator /* h1 */,
-                                      Ccb_halfedge_circulator /* h2 */)
-  {
-    compare_results("after_split_inner_ccb");
-  }
+  virtual void after_split_inner_ccb(Face_handle /* f */,
+                                     Ccb_halfedge_circulator /* h1 */,
+                                     Ccb_halfedge_circulator /* h2 */) override
+  { compare_results("after_split_inner_ccb"); }
 
-  /*!
-   * Notification before the creation of a new outer CCB of a face.
+  /*! Notification before the creation of a new outer CCB of a face.
    * \param f A handle to the face that owns the outer CCB.
    * \param e A halfedge along the new outer CCB.
    */
-  virtual void before_add_outer_ccb (Face_handle /* f */,
-                                     Halfedge_handle /* e */)
-  {
-    compare_results("before_add_outer_ccb");
-  }
+  virtual void before_add_outer_ccb(Face_handle /* f */,
+                                    Halfedge_handle /* e */) override
+  { compare_results("before_add_outer_ccb"); }
 
-  /*!
-   * Notification after an outer CCB was added to a face.
+  /*! Notification after an outer CCB was added to a face.
    * \param h A circulator representing the boundary of the new outer CCB.
    */
-  virtual void after_add_outer_ccb (Ccb_halfedge_circulator /* h */)
-  {
-    compare_results("after_add_outer_ccb");
-  }
+  virtual void after_add_outer_ccb(Ccb_halfedge_circulator /* h */) override
+  { compare_results("after_add_outer_ccb"); }
 
-  /*!
-   * Notification before the creation of a new inner CCB inside a face.
+  /*! Notification before the creation of a new inner CCB inside a face.
    * \param f A handle to the face containing the inner CCB.
    * \param e The new halfedge that forms the new inner CCB.
    */
-  virtual void before_add_inner_ccb (Face_handle /* f */,
-                                     Halfedge_handle /* e */)
-  {
-    compare_results("before_add_inner_ccb");
-  }
+  virtual void before_add_inner_ccb(Face_handle /* f */,
+                                    Halfedge_handle /* e */) override
+  { compare_results("before_add_inner_ccb"); }
 
-  /*!
-   * Notification after an inner CCB was created inside a face.
+  /*! Notification after an inner CCB was created inside a face.
    * \param h A circulator representing the boundary of the new inner CCB.
    */
-  virtual void after_add_inner_ccb (Ccb_halfedge_circulator /* h */)
-  {
-    compare_results("after_add_inner_ccb");
-  }
+  virtual void after_add_inner_ccb(Ccb_halfedge_circulator /* h */) override
+  { compare_results("after_add_inner_ccb"); }
 
-  /*!
-   * Notification before the creation of a new isolated vertex inside a face.
+  /*! Notification before the creation of a new isolated vertex inside a face.
    * \param f A handle to the face containing the isolated vertex.
    * \param v The isolated vertex.
    */
-  virtual void before_add_isolated_vertex (Face_handle /* f */,
-                                           Vertex_handle /* v */)
-  {
-    compare_results("before_add_isolated_vertex");
-  }
+  virtual void before_add_isolated_vertex(Face_handle /* f */,
+                                          Vertex_handle /* v */) override
+  { compare_results("before_add_isolated_vertex"); }
 
-  /*!
-   * Notification after an isolated vertex was created inside a face.
+  /*! Notification after an isolated vertex was created inside a face.
    * \param v The isolated vertex.
    */
-  virtual void after_add_isolated_vertex (Vertex_handle /* v */)
-  {
-    compare_results("after_add_isolated_vertex");
-  }
+  virtual void after_add_isolated_vertex(Vertex_handle /* v */) override
+  { compare_results("after_add_isolated_vertex"); }
 
-  /*!
-   * Notification before the merging of two edges.
+  /*! Notification before the merging of two edges.
    * \param e1 A handle to one of the halfedges forming the first edge.
    * \param e2 A handle to one of the halfedges forming the second edge.
    * \param c The x-monotone curve to be associated with the merged edge.
    */
-  virtual void before_merge_edge (Halfedge_handle /* e1 */,
-                                  Halfedge_handle /* e2 */,
-                                  const X_monotone_curve_2& /* c */)
-  {
-    compare_results("before_merge_edge");
-  }
+  virtual void before_merge_edge(Halfedge_handle /* e1 */,
+                                 Halfedge_handle /* e2 */,
+                                 const X_monotone_curve_2& /* c */) override
+  { compare_results("before_merge_edge"); }
 
-  /*!
-   * Notification after an edge was merged.
+  /*! Notification after an edge was merged.
    * \param e A handle to one of the twin halfedges forming the merged edge.
    */
-  virtual void after_merge_edge (Halfedge_handle /* e */)
-  {
-    compare_results("after_merge_edge");
-  }
+  virtual void after_merge_edge(Halfedge_handle /* e */) override
+  { compare_results("after_merge_edge"); }
 
   /*!
    * Notification before the merging of two fictitious edges.
    * \param e1 A handle to one of the halfedges forming the first edge.
    * \param e2 A handle to one of the halfedges forming the second edge.
    */
-  virtual void before_merge_fictitious_edge (Halfedge_handle /* e1 */,
-                                             Halfedge_handle /* e2 */)
-  {
-    compare_results("before_merge_fictitious_edge");
-  }
+  virtual void before_merge_fictitious_edge(Halfedge_handle /* e1 */,
+                                            Halfedge_handle /* e2 */) override
+  { compare_results("before_merge_fictitious_edge"); }
 
-  /*!
-   * Notification after a fictitious edge was merged.
+  /*! Notification after a fictitious edge was merged.
    * \param e A handle to one of the twin halfedges forming the merged edge.
    */
-  virtual void after_merge_fictitious_edge (Halfedge_handle /* e */)
-  {
-    compare_results("after_merge_fictitious_edge");
-  }
+  virtual void after_merge_fictitious_edge (Halfedge_handle /* e */) override
+  { compare_results("after_merge_fictitious_edge"); }
 
-  /*!
-   * Notification before the merging of two faces.
+  /*! Notification before the merging of two faces.
    * \param f1 A handle to the first face.
    * \param f2 A handle to the second face.
    * \param e The edge whose removal causes the faces to merge.
    */
-  virtual void before_merge_face (Face_handle /* f1 */,
-                                  Face_handle /* f2 */,
-                                  Halfedge_handle /* e */)
-  {
-    compare_results("before_merge_face");
-  }
+  virtual void before_merge_face(Face_handle /* f1 */,
+                                 Face_handle /* f2 */,
+                                 Halfedge_handle /* e */) override
+  { compare_results("before_merge_face"); }
 
-  /*!
-   * Notification after a face was merged.
+  /*! Notification after a face was merged.
    * \param f A handle to the merged face.
    */
-  virtual void after_merge_face (Face_handle /* f */)
-  {
-    compare_results("after_merge_face");
-  }
+  virtual void after_merge_face(Face_handle /* f */) override
+  { compare_results("after_merge_face"); }
 
-  /*!
-   * Notification before the merging of two outer CCBs.
+  /*! Notification before the merging of two outer CCBs.
    * \param f A handle to the face that owns the outer CCBs.
    * \param h1 A circulator representing the boundary of the first component.
    * \param h2 A circulator representing the boundary of the second component.
    * \param e The edge whose insertion or removal causes the CCBs to merge.
    */
-  virtual void before_merge_outer_ccb (Face_handle /* f */,
-                                       Ccb_halfedge_circulator /* h1 */,
-                                       Ccb_halfedge_circulator /* h2 */,
-                                       Halfedge_handle /* e */)
-  {
-    compare_results("before_merge_outer_ccb");
-  }
+  virtual void before_merge_outer_ccb(Face_handle /* f */,
+                                      Ccb_halfedge_circulator /* h1 */,
+                                      Ccb_halfedge_circulator /* h2 */,
+                                      Halfedge_handle /* e */) override
+  { compare_results("before_merge_outer_ccb"); }
 
-  /*!
-   * Notification after an outer CCB was merged.
+  /*! Notification after an outer CCB was merged.
    * \param f A handle to the face that owns the outer CCBs.
    * \param h A circulator representing the boundary of the merged component.
    */
-  virtual void after_merge_outer_ccb (Face_handle /* f */,
-                                      Ccb_halfedge_circulator /* h */)
-  {
-    compare_results("after_merge_outer_ccb");
-  }
+  virtual void after_merge_outer_ccb(Face_handle /* f */,
+                                     Ccb_halfedge_circulator /* h */)
+  { compare_results("after_merge_outer_ccb"); }
 
-  /*!
-   * Notification before the merging of two inner CCBs (holes).
+  /*! Notification before the merging of two inner CCBs (holes).
    * \param f A handle to the face that contains the inner CCBs.
    * \param h1 A circulator representing the boundary of the first component.
    * \param h2 A circulator representing the boundary of the second component.
    * \param e The edge whose insertion causes the inner CCBs to merge.
    */
-  virtual void before_merge_inner_ccb (Face_handle /* f */,
-                                       Ccb_halfedge_circulator /* h1 */,
-                                       Ccb_halfedge_circulator /* h2 */,
-                                       Halfedge_handle /* e */)
-  {
-    compare_results("before_merge_inner_ccb");
-  }
+  virtual void before_merge_inner_ccb(Face_handle /* f */,
+                                      Ccb_halfedge_circulator /* h1 */,
+                                      Ccb_halfedge_circulator /* h2 */,
+                                      Halfedge_handle /* e */) override
+  { compare_results("before_merge_inner_ccb"); }
 
-  /*!
-   * Notification after an inner CCB was merged.
+  /*! Notification after an inner CCB was merged.
    * \param f A handle to the face that contains the inner CCBs.
    * \param h A circulator representing the boundary of the merged component.
    */
-  virtual void after_merge_inner_ccb (Face_handle /* f */,
-                                      Ccb_halfedge_circulator /* h */)
-  {
-    compare_results("after_merge_inner_ccb");
-  }
+  virtual void after_merge_inner_ccb(Face_handle /* f */,
+                                     Ccb_halfedge_circulator /* h */) override
+  { compare_results("after_merge_inner_ccb"); }
 
-  /*!
-   * Notification before an outer CCB is moved from one face to another.
+  /*! Notification before an outer CCB is moved from one face to another.
    * \param from_f A handle to the face that currently owns the outer CCB.
    * \param to_f A handle to the face that should own the outer CCB.
    * \param h A circulator representing the boundary of the component.
    */
-  virtual void before_move_outer_ccb (Face_handle /* from_f */,
-                                      Face_handle /* to_f */,
-                                      Ccb_halfedge_circulator /* h */)
-  {
-    compare_results("before_move_outer_ccb");
-  }
+  virtual void before_move_outer_ccb(Face_handle /* from_f */,
+                                     Face_handle /* to_f */,
+                                     Ccb_halfedge_circulator /* h */) override
+  { compare_results("before_move_outer_ccb"); }
 
-  /*!
-   * Notification after an outer CCB is moved from one face to another.
+  /*! Notification after an outer CCB is moved from one face to another.
    * \param h A circulator representing the boundary of the component.
    */
-  virtual void after_move_outer_ccb (Ccb_halfedge_circulator /* h */)
-  {
-    compare_results("after_move_outer_ccb");
-  }
+  virtual void after_move_outer_ccb(Ccb_halfedge_circulator /* h */) override
+  { compare_results("after_move_outer_ccb"); }
 
 
-  /*!
-   * Notification before an inner CCB is moved from one face to another.
+  /*! Notification before an inner CCB is moved from one face to another.
    * \param from_f A handle to the face currently containing the inner CCB.
    * \param to_f A handle to the face that should contain the inner CCB.
    * \param h A circulator representing the boundary of the component.
    */
-  virtual void before_move_inner_ccb (Face_handle /* from_f */,
-                                      Face_handle /* to_f */,
-                                      Ccb_halfedge_circulator /* h */)
-  {
-    compare_results("before_move_inner_ccb");
-  }
+  virtual void before_move_inner_ccb(Face_handle /* from_f */,
+                                     Face_handle /* to_f */,
+                                     Ccb_halfedge_circulator /* h */) override
+  { compare_results("before_move_inner_ccb"); }
 
-  /*!
-   * Notification after an inner CCB is moved from one face to another.
+  /*! Notification after an inner CCB is moved from one face to another.
    * \param h A circulator representing the boundary of the component.
    */
-  virtual void after_move_inner_ccb (Ccb_halfedge_circulator /* h */)
-  {
-    compare_results("after_move_inner_ccb");
-  }
+  virtual void after_move_inner_ccb(Ccb_halfedge_circulator /* h */) override
+  { compare_results("after_move_inner_ccb"); }
 
-  /*!
-   * Notification before an isolated vertex is moved from one face to another.
+  /*! Notification before an isolated vertex is moved from one face to another.
    * \param from_f A handle to the face currently containing the vertex.
    * \param to_f A handle to the face that should contain the vertex.
    * \param v The isolated vertex.
    */
-  virtual void before_move_isolated_vertex (Face_handle /* from_f */,
-                                            Face_handle /* to_f */,
-                                            Vertex_handle /* v */)
-  {
-    compare_results("before_move_isolated_vertex");
-  }
+  virtual void before_move_isolated_vertex(Face_handle /* from_f */,
+                                           Face_handle /* to_f */,
+                                           Vertex_handle /* v */) override
+  { compare_results("before_move_isolated_vertex"); }
 
-  /*!
-   * Notification after an isolated vertex is moved from one face to another.
+  /*! Notification after an isolated vertex is moved from one face to another.
    * \param v The isolated vertex.
    */
-  virtual void after_move_isolated_vertex (Vertex_handle /* v */)
-  {
-    compare_results("after_move_isolated_vertex");
-  }
+  virtual void after_move_isolated_vertex(Vertex_handle /* v */) override
+  { compare_results("after_move_isolated_vertex"); }
 
-  /*!
-   * Notificaion before the removal of a vertex.
+  /*! Notificaion before the removal of a vertex.
    * \param v A handle to the vertex to be deleted.
    */
-  virtual void before_remove_vertex (Vertex_handle /* v */)
-  {
-    compare_results("before_remove_vertex");
-  }
+  virtual void before_remove_vertex(Vertex_handle /* v */) override
+  { compare_results("before_remove_vertex"); }
 
-  /*!
-   * Notificaion after the removal of a vertex.
+  /*! Notificaion after the removal of a vertex.
    */
-  virtual void after_remove_vertex ()
-  {
-    compare_results("after_remove_vertex");
-  }
+  virtual void after_remove_vertex() override
+  { compare_results("after_remove_vertex"); }
 
-  /*!
-   * Notification before the removal of an edge.
+  /*! Notification before the removal of an edge.
    * \param e A handle to one of the twin halfedges to be deleted.
    */
-  virtual void before_remove_edge (Halfedge_handle /* e */)
-  {
-    compare_results("before_remove_edge");
-  }
+  virtual void before_remove_edge(Halfedge_handle /* e */) override
+  { compare_results("before_remove_edge"); }
 
-  /*!
-   * Notificaion after the removal of an edge.
+  /*! Notificaion after the removal of an edge.
    */
-  virtual void after_remove_edge ()
-  {
-    compare_results("after_remove_edge");
-  }
+  virtual void after_remove_edge() override
+  { compare_results("after_remove_edge"); }
 
-  /*!
-   * Notification before the removal of an outer CCB.
+  /*! Notification before the removal of an outer CCB.
    * \param f The face that owns the outer CCB.
    * \param h A circulator representing the boundary of the component.
    */
-  virtual void before_remove_outer_ccb (Face_handle /* f */,
-                                        Ccb_halfedge_circulator /* h */)
-  {
-    compare_results("before_remove_outer_ccb");
-  }
+  virtual void before_remove_outer_ccb(Face_handle /* f */,
+                                       Ccb_halfedge_circulator /* h */) override
+  { compare_results("before_remove_outer_ccb"); }
 
-  /*!
-   * Notificaion after the removal of an outer CCB.
+  /*! Notificaion after the removal of an outer CCB.
    * \param f The face that used to own the outer CCB.
    */
-  virtual void after_remove_outer_ccb (Face_handle /* f */)
-  {
-    compare_results("after_remove_outer_ccb");
-  }
+  virtual void after_remove_outer_ccb(Face_handle /* f */) override
+  { compare_results("after_remove_outer_ccb"); }
 
-  /*!
-   * Notification before the removal of an inner CCB.
+  /*! Notification before the removal of an inner CCB.
    * \param f The face containing the inner CCB.
    * \param h A circulator representing the boundary of the component.
    */
-  virtual void before_remove_inner_ccb (Face_handle /* f */,
-                                        Ccb_halfedge_circulator /* h */)
-  {
-    compare_results("before_remove_inner_ccb");
-  }
+  virtual void before_remove_inner_ccb(Face_handle /* f */,
+                                       Ccb_halfedge_circulator /* h */) override
+  { compare_results("before_remove_inner_ccb"); }
 
-  /*!
-   * Notificaion after the removal of an inner CCB.
+  /*! Notificaion after the removal of an inner CCB.
    * \param f The face that used to contain the inner CCB.
    */
-  virtual void after_remove_inner_ccb (Face_handle /* f */)
-  {
-    compare_results("after_remove_inner_ccb");
-  }
+  virtual void after_remove_inner_ccb(Face_handle /* f */) override
+  { compare_results("after_remove_inner_ccb"); }
 
   //@}
 
 };
 
-int main (int argc, char * argv[])
-{
-  if (argc != 2)
-  {
+int main (int argc, char* argv[]) {
+  if (argc != 2) {
     std::cout << "Usage: " << argv[0] << " inputfile" << std::endl;
     CGAL_error();
   }
-  else
-  {
+  else {
     // Construct the arrangement containing one diamond-shaped face.
     Arrangement_2  arr;
     global_input_file.open(argv[1]);
@@ -721,55 +546,48 @@ int main (int argc, char * argv[])
     int i_vh = 0, i_heh = 0;
     std::vector<Arrangement_2::Halfedge_handle> heh_vec;
     std::vector<Arrangement_2::Vertex_handle> vh_vec;
-    while (!global_input_file.eof())
-    {
+    while (! global_input_file.eof()) {
       skip_comments(global_input_file, one_line);
       std::istringstream str_stream(one_line);
       char c;
       str_stream >> c;
       if (!global_input_file.gcount())
         break;
-      if (c=='s')
-      {
+      if (c=='s') {
         str_stream >> c;
         //read segment
         str_stream >> s;
-        if (c=='i')
-        {
+        if (c=='i') {
           // si means insert intersecting segment
           insert(arr,s);
           std::cout << "intersecting segment insert " << s << std::endl;
         }
-        else if (c=='n')
-        {
+        else if (c=='n') {
           // sn means insert non intersecting segment
           heh_vec.push_back(insert_non_intersecting_curve (arr, s));
           std::cout << "non intersecting segment insert " << s << std::endl;
         }
       }
-      else if (c=='p')
-      {
+      else if (c=='p') {
         // p means read point
         str_stream >> p ;
-        std::cout << "point insert " << p << " index " << vh_vec.size() << std::endl;
+        std::cout << "point insert " << p << " index " << vh_vec.size()
+                  << std::endl;
         vh_vec.push_back(insert_point(arr,p));
       }
-      else if (c=='e')
-      {
+      else if (c=='e') {
         // e means read edge index to be removed
         str_stream >> i_heh ;
         std::cout << "remove edge " << heh_vec[i_heh]->curve() << std::endl;
         remove_edge(arr,heh_vec[i_heh]);
       }
-      else if (c=='v')
-      {
+      else if (c=='v') {
         // v means read point index to be removed
         str_stream >> i_vh ;
         std::cout << "remove point " << vh_vec[i_vh]->point() << std::endl;
         remove_vertex(arr,vh_vec[i_vh]);
       }
-      else
-      {
+      else {
         //error
         std::cout << "error, unknowen command" << std::endl;
         return -1;
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
index 757ef127412a..2934d17f189a 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
@@ -1584,19 +1584,16 @@ class Envelope_divide_and_conquer_3
 
   // observer for the minimization diagram
   // keeps the relevant data in the new faces
-  class Keep_face_data_observer : public Md_observer
-  {
+  class Keep_face_data_observer : public Md_observer {
   public:
-    typedef typename Minimization_diagram_2::Face_handle Face_handle;
+    using Base_aos = typename Minimization_diagram_2::Base_aos;
+    using Face_handle = typename Base_aos::Face_handle;
 
-    Keep_face_data_observer(Minimization_diagram_2& arr) :
-      Md_observer(arr)
-    {}
+    Keep_face_data_observer(Base_aos& arr) : Md_observer(arr) {}
 
     virtual void after_split_face(Face_handle org_f,
                                   Face_handle new_f,
-                                  bool /* is_hole*/)
-    {
+                                  bool /* is_hole*/) override {
       // update data in the new face from the original face
       if (org_f->get_aux_is_set(0))
         new_f->set_aux_source(0, org_f->get_aux_source(0));
@@ -1610,34 +1607,30 @@ class Envelope_divide_and_conquer_3
 
   // observer for the minimization diagram
   // keeps the relevant data in the new edges & vertices
-  class Keep_edge_data_observer : public Md_observer
-  {
+  class Keep_edge_data_observer : public Md_observer {
   public:
-    typedef typename Minimization_diagram_2::Halfedge_handle   Halfedge_handle;
-    typedef typename Minimization_diagram_2::Vertex_handle     Vertex_handle;
-    typedef typename Minimization_diagram_2::X_monotone_curve_2
-                                                            X_monotone_curve_2;
-
-    typedef typename Envelope_divide_and_conquer_3<Traits,
-                                                   Minimization_diagram_2,
-                                                   EnvelopeResolver_3,
-                                                   Overlay_2>::Self Self;
-    Keep_edge_data_observer(Minimization_diagram_2& arr,
-                            Self* b) :
+    using Base_aos = typename Minimization_diagram_2::Base_aos;
+    using Vertex_handle = typename Base_aos::Vertex_handle;
+    using Halfedge_handle = typename Base_aos::Halfedge_handle;
+    using X_monotone_curve_2 = typename Base_aos::X_monotone_curve_2;
+
+    using Self = typename Envelope_divide_and_conquer_3<Traits,
+                                                        Minimization_diagram_2,
+                                                        EnvelopeResolver_3,
+                                                        Overlay_2>::Self;
+    Keep_edge_data_observer(Base_aos& arr, Self* b) :
       Md_observer(arr), base(b)
-    {
-      CGAL_assertion(base != nullptr);
-    }
+    { CGAL_assertion(base != nullptr); }
 
-    /* virtual void before_split_edge (Halfedge_handle e,
-     *                                 Vertex_handle v,
-     *                                 const X_monotone_curve_2& c1,
-     *                                 const X_monotone_curve_2& c2)
+    /* virtual void before_split_edge(Halfedge_handle e,
+     *                                Vertex_handle v,
+     *                                const X_monotone_curve_2& c1,
+     *                                const X_monotone_curve_2& c2)
      * {}
      */
 
     virtual void after_split_edge(Halfedge_handle he1, Halfedge_handle he2)
-    {
+      override {
       // update data of the new vertex, which is the common vertex of he1 and
       // he2, and of the new edge according to the data in the original edge
       CGAL_assertion(he2->source() == he1->target());
@@ -1657,20 +1650,17 @@ class Envelope_divide_and_conquer_3
       // the second halfedge
       Halfedge_handle org_he = he1, new_he = he2;
 
-      if (org_he->is_decision_set())
-      {
+      if (org_he->is_decision_set()) {
         new_he->set_decision(org_he->get_decision());
         new_he->twin()->set_decision(org_he->get_decision());
         new_vertex->set_decision(org_he->get_decision());
       }
-      if (org_he->get_aux_is_set(0))
-      {
+      if (org_he->get_aux_is_set(0)) {
         new_vertex->set_aux_source(0, org_he->get_aux_source(0));
         new_he->set_aux_source(0, org_he->get_aux_source(0));
         new_he->twin()->set_aux_source(0, org_he->twin()->get_aux_source(0));
       }
-      if (org_he->get_aux_is_set(1))
-      {
+      if (org_he->get_aux_is_set(1)) {
         new_vertex->set_aux_source(1, org_he->get_aux_source(1));
         new_he->set_aux_source(1, org_he->get_aux_source(1));
         new_he->twin()->set_aux_source(1, org_he->twin()->get_aux_source(1));
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
index 413559ace7ef..5a20790628ef 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
@@ -1978,14 +1978,13 @@ class Envelope_element_visitor_3
   // so we can later identify all the faces that form the original given face
   // it also should remember the edges of the face, that are also projected
   // intersections
-  class Copied_face_observer : public Md_observer
-
-  {
+  class Copied_face_observer : public Md_observer {
   public:
-    typedef typename Minimization_diagram_2::Face_handle     Face_handle;
-    typedef typename Minimization_diagram_2::Halfedge_handle Halfedge_handle;
-    typedef typename Minimization_diagram_2::X_monotone_curve_2
-      X_monotone_curve_2;
+    using Base_aos = typename Minimization_diagram_2::Base_aos;
+
+    using Face_handle = typename Base_aos::Face_handle;
+    using Halfedge_handle = typename Base_aos::Halfedge_handle;
+    using X_monotone_curve_2 = typename Base_aos::X_monotone_curve_2;
 
     Copied_face_observer(Halfedges_map& map_h) : map_halfedges(map_h) {}
 
@@ -1997,8 +1996,7 @@ class Envelope_element_visitor_3
                                   Faces_hash& parts,
                                   Vertices_hash& boundaryv,
                                   Vertices_hash& specialv,
-                                  Vertices_to_edges_map& v_to_h)
-    {
+                                  Vertices_to_edges_map& v_to_h) {
       boundary_halfedges = &boundary;
       special_edges = &specialh;
       new_edges = &newh;
@@ -2009,20 +2007,16 @@ class Envelope_element_visitor_3
     }
 
     virtual void after_split_face(Face_handle org_f,
-                                  Face_handle new_f, bool)
-    {
+                                  Face_handle new_f, bool) override {
       // keep track of the face parts
       if (face_parts->is_defined(org_f))
         (*face_parts)[new_f] = face_parts->default_value();
     }
 
     virtual void after_split_edge(Halfedge_handle org_he,
-                                  Halfedge_handle new_he)
-    {
+                                  Halfedge_handle new_he) override {
       // take care of special edges that were split
-      if (special_edges->is_defined(org_he))
-
-      {
+      if (special_edges->is_defined(org_he)) {
         // if original edge was in the set, then now both split parts should
         // be in the set
         (*special_edges)[new_he] = special_edges->default_value();
@@ -2030,15 +2024,13 @@ class Envelope_element_visitor_3
       }
 
       // take care of new edges that were split
-      if (new_edges->is_defined(org_he))
-      {
+      if (new_edges->is_defined(org_he)) {
         (*new_edges)[new_he] = (*new_edges)[org_he];
         (*new_edges)[new_he->twin()] = (*new_edges)[org_he];
       }
 
       // take care for boundary edges
-      if (boundary_halfedges->is_defined(org_he))
-      {
+      if (boundary_halfedges->is_defined(org_he)) {
         (*boundary_halfedges)[new_he] = boundary_halfedges->default_value();
         (*boundary_halfedges)[new_he->twin()] =
           boundary_halfedges->default_value();
@@ -2065,8 +2057,7 @@ class Envelope_element_visitor_3
         Halfedge_handle correct_side_he;
         if (face_parts->is_defined(org_he->face()))
           correct_side_he = org_he;
-        else
-        {
+        else {
           CGAL_assertion(face_parts->is_defined(new_he->twin()->face()));
           // new_he->twin() is directed as org_he, so on the boundary pointing
           // inside the face, and has the new vertex as target
@@ -2079,7 +2070,8 @@ class Envelope_element_visitor_3
         //BZBZ
         /* CGAL_assertion(vertices_to_halfedges->is_defined(correct_side_he->source()) &&
            vertices_to_halfedges->is_defined(correct_side_he->next()->target()));*/
-        (*vertices_to_halfedges)[correct_side_he->next()->target()] = correct_side_he->next();
+        (*vertices_to_halfedges)[correct_side_he->next()->target()] =
+          correct_side_he->next();
 
         if (correct_side_he == org_he &&
             face_parts->is_defined(org_he->twin()->face()))
@@ -2099,46 +2091,42 @@ class Envelope_element_visitor_3
     Halfedges_map& map_halfedges;
   };
 
-
   // this observer is used in the process of resolving a face
   // it listens to what happens in the copied arrangement, and copies back
   // the actions to result arrangements very efficiently
-  class Copy_observer : public Md_observer
-  {
+  class Copy_observer : public Md_observer {
   public:
-    typedef typename Minimization_diagram_2::Face_handle       Face_handle;
-    typedef typename Minimization_diagram_2::Halfedge_handle   Halfedge_handle;
-    typedef typename Minimization_diagram_2::Vertex_handle     Vertex_handle;
-    typedef typename Minimization_diagram_2::Point_2           Point_2;
-    typedef typename Minimization_diagram_2::X_monotone_curve_2
-      X_monotone_curve_2;
-    typedef typename Minimization_diagram_2::Ccb_halfedge_circulator
-     Ccb_halfedge_circulator;
+    using Base_aos = typename Minimization_diagram_2::Base_aos;
 
-    typedef typename Traits::Left_side_category             Left_side_category;
-    typedef typename Traits::Right_side_category            Right_side_category;
-    typedef typename Traits::Top_side_category              Top_side_category;
-    typedef typename Traits::Bottom_side_category           Bottom_side_category;
+    using Face_handle = typename Base_aos::Face_handle;
+    using Halfedge_handle = typename Base_aos::Halfedge_handle;
+    using Vertex_handle = typename Base_aos::Vertex_handle;
+    using Point_2 = typename Base_aos::Point_2;
+    using X_monotone_curve_2 = typename Base_aos::X_monotone_curve_2;
+    using Ccb_halfedge_circulator = typename Base_aos::Ccb_halfedge_circulator;
+
+    using Left_side_category = typename Traits::Left_side_category;
+    using Right_side_category = typename Traits::Right_side_category;
+    using Top_side_category = typename Traits::Top_side_category;
+    using Bottom_side_category = typename Traits::Bottom_side_category;
 
     Copy_observer(Minimization_diagram_2& small_,
                   Minimization_diagram_2& big,
                   Halfedges_map& map_h,
-                  Vertices_map&  map_v,
-                  Faces_map&     map_f)
-      : small_arr(small_), big_arr(big),
-        big_arr_accessor(big_arr),
-        map_halfedges(map_h),
-        map_vertices(map_v),
-        map_faces(map_f)
+                  Vertices_map& map_v,
+                  Faces_map& map_f) :
+      small_arr(small_), big_arr(big),
+      big_arr_accessor(big_arr),
+      map_halfedges(map_h),
+      map_vertices(map_v),
+      map_faces(map_f)
     {}
 
     virtual ~Copy_observer() {}
 
-    virtual void before_create_vertex (const Point_2& /* p */)
-    {}
+    virtual void before_create_vertex (const Point_2& /* p */) override {}
 
-    virtual void after_create_vertex (Vertex_handle v)
-    {
+    virtual void after_create_vertex (Vertex_handle v) override {
       // should create a new vertex with v->point() inside
       Vertex_handle new_v = big_arr_accessor.create_vertex(v->point());
 
@@ -2149,11 +2137,11 @@ class Envelope_element_visitor_3
       new_vertices.push_back(v);
     }
 
-    void before_create_boundary_vertex (const X_monotone_curve_2& cv,
-                                        Arr_curve_end ind,
-                                        Arr_parameter_space in_ps_x,
-                                        Arr_parameter_space in_ps_y)
-    {
+    virtual void before_create_boundary_vertex(const X_monotone_curve_2& cv,
+                                               Arr_curve_end ind,
+                                               Arr_parameter_space in_ps_x,
+                                               Arr_parameter_space in_ps_y)
+    override {
       boundary_vertex_cv = cv;
       boundary_vertex_ind = ind;
       ps_x = in_ps_x;
@@ -2163,8 +2151,7 @@ class Envelope_element_visitor_3
     bool is_bounded_impl(Arr_open_side_tag) { return false; }
     bool is_bounded_impl(Arr_boundary_side_tag) { return true; }
 
-    bool is_bounded()
-    {
+    bool is_bounded() {
       // This is the case of create boundary vertex.
       CGAL_assertion((ps_x != ARR_INTERIOR) || (ps_y != ARR_INTERIOR));
 
@@ -2184,8 +2171,7 @@ class Envelope_element_visitor_3
       return true;
     }
 
-    void after_create_boundary_vertex(Vertex_handle v)
-    {
+    virtual void after_create_boundary_vertex(Vertex_handle v) override {
       CGAL_assertion(big_arr.is_valid());
       Vertex_handle new_v =
         big_arr_accessor.create_boundary_vertex(boundary_vertex_cv,
@@ -2199,16 +2185,15 @@ class Envelope_element_visitor_3
       map_vertices[v] = new_v;
     }
 
-    void before_split_fictitious_edge(Halfedge_handle e,
-                                      Vertex_handle v)
-    {
+    virtual void
+    before_split_fictitious_edge(Halfedge_handle e, Vertex_handle v) override {
       split_fict_v = v;
       split_fict_e = e;
     }
 
-    void after_split_fictitious_edge(Halfedge_handle e1,
-                                     Halfedge_handle e2)
-    {
+    virtual void
+    after_split_fictitious_edge(Halfedge_handle e1, Halfedge_handle e2)
+      override {
       // find the corresponding split vertex in big_arr
       CGAL_assertion(map_vertices.is_defined(split_fict_v));
       Vertex_handle big_v = map_vertices[split_fict_v];
@@ -2235,8 +2220,7 @@ class Envelope_element_visitor_3
 
     virtual void before_create_edge(const X_monotone_curve_2& /* c */,
                                     Vertex_handle v1,
-                                    Vertex_handle v2)
-    {
+                                    Vertex_handle v2) override {
       // save state for after_create_edge event
       create_edge_v1 = v1;
       create_edge_v2 = v2;
@@ -2244,9 +2228,7 @@ class Envelope_element_visitor_3
       is_in_relocate = false;
     }
 
-    virtual void after_create_edge(Halfedge_handle e)
-
-    {
+    virtual void after_create_edge(Halfedge_handle e) override {
       // a new edge e was created in small_arr, we should create a corresponding
       // edge in big_arr
       CGAL_assertion(map_vertices.is_defined(create_edge_v1));
@@ -2260,18 +2242,14 @@ class Envelope_element_visitor_3
       // if we have 2 new vertices, they must be new.
       // if we have only one, we should check which is new
       bool v1_is_new = false, v2_is_new = false;
-      if (new_vertices.size() == 1)
-      {
-        if (new_vertices.back() == create_edge_v1)
-          v1_is_new = true;
-        else
-        {
+      if (new_vertices.size() == 1) {
+        if (new_vertices.back() == create_edge_v1) v1_is_new = true;
+        else {
           CGAL_assertion(new_vertices.back() == create_edge_v2);
           v2_is_new = true;
         }
       }
-      if (new_vertices.size() == 2)
-      {
+      if (new_vertices.size() == 2) {
         v1_is_new = true;
         v2_is_new = true;
       }
@@ -2285,15 +2263,13 @@ class Envelope_element_visitor_3
 
       // if an endpoint is not new, but is isolated, we should remove it from
       // its face's isolated vertices list, and treat it as new
-      if (!v1_is_new && big_v1->is_isolated())
-      {
+      if (!v1_is_new && big_v1->is_isolated()) {
         //Face_handle f = big_v1->face(); //big_arr.incident_face(big_v1);
         //big_arr_accessor.find_and_erase_isolated_vertex(f, big_v1);
         big_arr_accessor.remove_isolated_vertex_ex(big_v1);
         v1_is_new = true;
       }
-      if (!v2_is_new && big_v2->is_isolated())
-      {
+      if (! v2_is_new && big_v2->is_isolated()) {
         //Face_handle f = big_v2->face(); //big_arr.incident_face(big_v2);
         //big_arr_accessor.find_and_erase_isolated_vertex(f, big_v2);
         big_arr_accessor.remove_isolated_vertex_ex(big_v2);
@@ -2301,8 +2277,7 @@ class Envelope_element_visitor_3
       }
 
       // now use the approppriate method to insert the new edge
-      if (v1_is_new && v2_is_new)
-      {
+      if (v1_is_new && v2_is_new) {
         // if both vertices are new - use the O(1) operation
         // _insert_in_face_interior (in the face mapped to by he->face())
         CGAL_assertion(map_faces.is_defined(he->face()));
@@ -2319,8 +2294,7 @@ class Envelope_element_visitor_3
         map_halfedges[he] = new_he;
         map_halfedges[he->twin()] = new_he->twin();
       }
-      else if (!v1_is_new && !v2_is_new)
-      {
+      else if (! v1_is_new && !v2_is_new) {
         // if both vertices are old - use _insert_at_vertices
         // this is a linear action by the size of the faces involved
         // we can get relevant prev halfedges from he
@@ -2360,8 +2334,7 @@ class Envelope_element_visitor_3
 
         // if a new face was created update its mapping too
         // the new face is the incident face of he
-        if (new_face)
-        {
+        if (new_face) {
           map_faces[he->face()] = new_he->face();
           // save state for move_hole/move_isolated_vertex events
           is_in_relocate = true;
@@ -2372,16 +2345,14 @@ class Envelope_element_visitor_3
         CGAL_assertion(map_faces.is_defined(he->face()) &&
                        map_faces[he->face()] == new_he->face());
       }
-      else
-      {
+      else {
         // only one vertex is new - use the O(1) operation _insert_from_vertex
         // we can get the relevant prev halfedge from e
         Halfedge_handle prev = he->prev();
         CGAL_assertion(map_halfedges.is_defined(prev));
         Halfedge_handle big_prev = map_halfedges[prev];
         Halfedge_handle new_he;
-        if (!v1_is_new)
-        {
+        if (!v1_is_new) {
           new_he = big_arr_accessor.insert_from_vertex_ex(big_prev,
                                                           he->curve(), (HE_COMP_RES(he) == SMALLER ? ARR_LEFT_TO_RIGHT : ARR_RIGHT_TO_LEFT),
                                                           big_v2);
@@ -2391,8 +2362,7 @@ class Envelope_element_visitor_3
           map_halfedges[he] = new_he;
           map_halfedges[he->twin()] = new_he->twin();
         }
-        else
-        {
+        else {
           new_he =
             big_arr_accessor.insert_from_vertex_ex(big_prev,
                                                    he->curve(), (HE_COMP_RES(he->twin()) == SMALLER ? ARR_LEFT_TO_RIGHT : ARR_RIGHT_TO_LEFT),
@@ -2410,14 +2380,13 @@ class Envelope_element_visitor_3
                                    Vertex_handle v,
                                    const X_monotone_curve_2& /* c1 */,
                                    const X_monotone_curve_2& /* c2 */)
-    {
+      override {
       // save state info for using _split_edge in after event
       split_v = v;
       split_e = e;
     }
-    virtual void after_split_edge (Halfedge_handle e1,
-                                   Halfedge_handle e2)
-    {
+    virtual void after_split_edge(Halfedge_handle e1,
+                                  Halfedge_handle e2) override {
       // find the corresponding split vertex in big_arr
       CGAL_assertion(map_vertices.is_defined(split_v));
       Vertex_handle big_v = map_vertices[split_v];
@@ -2448,11 +2417,10 @@ class Envelope_element_visitor_3
     }
 
     virtual void before_add_isolated_vertex(Face_handle f,
-                                            Vertex_handle /* v */)
-    {
-      saved_face = f;
-    }
-    virtual void after_add_isolated_vertex(Vertex_handle v)
+                                            Vertex_handle /* v */) override
+    { saved_face = f; }
+
+    virtual void after_add_isolated_vertex(Vertex_handle v) override
     {
       // make sure it is the only new vertex right now
       CGAL_assertion(new_vertices.size() == 1 &&
@@ -2475,15 +2443,14 @@ class Envelope_element_visitor_3
 
     virtual void before_move_inner_ccb(Face_handle from_f,
                                        Face_handle to_f,
-                                       Ccb_halfedge_circulator )
-    {
+                                       Ccb_halfedge_circulator) override {
       // should be used after insert_at_vertices which creates a new face
       CGAL_assertion(is_in_relocate);
       move_from = from_f;
       move_to = to_f;
     }
-    virtual void after_move_inner_ccb(Ccb_halfedge_circulator h)
-    {
+
+    virtual void after_move_inner_ccb(Ccb_halfedge_circulator h) override {
       CGAL_assertion(map_faces.is_defined(move_from));
       CGAL_assertion(map_faces.is_defined(move_to));
       CGAL_assertion(map_halfedges.is_defined(h));
@@ -2500,16 +2467,14 @@ class Envelope_element_visitor_3
 
     virtual void before_move_isolated_vertex(Face_handle from_f,
                                              Face_handle to_f,
-                                             Vertex_handle )
-    {
+                                             Vertex_handle) override {
       // should be used after insert_at_vertices which creates a new face
 
       CGAL_assertion(is_in_relocate);
       move_from = from_f;
       move_to = to_f;
     }
-    virtual void after_move_isolated_vertex(Vertex_handle v)
-    {
+    virtual void after_move_isolated_vertex(Vertex_handle v) override {
       CGAL_assertion(map_faces.is_defined(move_from));
       CGAL_assertion(map_faces.is_defined(move_to));
       CGAL_assertion(map_vertices.is_defined(v));
@@ -2524,12 +2489,12 @@ class Envelope_element_visitor_3
   protected:
     Minimization_diagram_2& small_arr;
     Minimization_diagram_2& big_arr;
-    Md_accessor             big_arr_accessor;
+    Md_accessor big_arr_accessor;
 
     // mappings between small_arr features to big_arr features
     Halfedges_map& map_halfedges;
-    Vertices_map&  map_vertices;
-    Faces_map&     map_faces;
+    Vertices_map& map_vertices;
+    Faces_map& map_faces;
     std::deque<Vertex_handle> new_vertices;
 
     // state for actions
@@ -2537,25 +2502,23 @@ class Envelope_element_visitor_3
     Vertex_handle create_edge_v2;
     Vertex_handle split_v, split_fict_v;
     Halfedge_handle split_e, split_fict_e;
-    Face_handle   saved_face;
-    Face_handle   move_from;
-    Face_handle   move_to;
+    Face_handle saved_face;
+    Face_handle move_from;
+    Face_handle move_to;
 
     // for the create_vertex call-back
-    X_monotone_curve_2  boundary_vertex_cv;
-    Arr_curve_end           boundary_vertex_ind;
+    X_monotone_curve_2 boundary_vertex_cv;
+    Arr_curve_end boundary_vertex_ind;
     Arr_parameter_space ps_x;
     Arr_parameter_space ps_y;
     bool is_in_relocate;
-
   };
 
   // A zone visitor for the Minimization Diagram which only inserts
   // parts of the curve which are inside a given face
   // it also remembers those parts which overlap the boundary of the original
   // face
-  class Copied_face_zone_visitor
-  {
+  class Copied_face_zone_visitor {
   public:
     typedef typename Minimization_diagram_2::Vertex_handle     Vertex_handle;
     typedef typename Minimization_diagram_2::Halfedge_handle   Halfedge_handle;
@@ -2639,7 +2602,7 @@ class Envelope_element_visitor_3
     // the zone visitor functions
 
     /*! Initialize the visitor with an arrangement object. */
-    void init (Minimization_diagram_2* arr)
+    void init(Minimization_diagram_2* arr)
     {
       CGAL_assertion(&copied_arr == arr);
       insert_visitor.init(arr);
@@ -2821,8 +2784,7 @@ class Envelope_element_visitor_3
             result_new_he->twin()->set_has_equal_aux_data_in_target_and_face(1, flag);
           }
         }
-        else
-        {
+        else {
           result_new_he->twin()->set_is_equal_aux_data_in_target(0, true);
           result_new_he->twin()->set_is_equal_aux_data_in_target(1, true);
           result_new_he->twin()->set_has_equal_aux_data_in_target(0, true);
@@ -2833,8 +2795,7 @@ class Envelope_element_visitor_3
 
         return base_result;
       }
-      else
-      {
+      else {
         // we don't insert the subcurve, but it might touch a vertex of the
         // face's boundary - we need to check it and identify special vertices
         if (left_v != Vertex_handle(nullptr) &&
@@ -2852,8 +2813,7 @@ class Envelope_element_visitor_3
       }
     }
 
-    /*!
-     * Handle the a subcurve that overlaps a given edge.
+    /*! Handle the a subcurve that overlaps a given edge.
      * \param cv The overlapping subcurve.
      * \param he The overlapped halfedge (directed from left to right).
      * \param left_v The vertex that corresponds to the left endpoint of cv
@@ -2906,7 +2866,6 @@ class Envelope_element_visitor_3
     }
 
     /*!
-
      * Handle point that lies inside a given face.
      * \param p The point.
      * \param face The face inside which the point lies.
@@ -3134,18 +3093,18 @@ class Envelope_element_visitor_3
     Vertices_list& result_special_vertices;
 
     // helper collections (for copied_arr features)
-    Halfedges_hash        copied_arr_boundary_halfedges;
-    Vertices_hash         copied_arr_orig_vertices;
-    Vertices_hash         copied_arr_new_boundary_vertices;
+    Halfedges_hash copied_arr_boundary_halfedges;
+    Vertices_hash copied_arr_orig_vertices;
+    Vertices_hash copied_arr_new_boundary_vertices;
     Vertices_to_edges_map copied_vertices_to_halfedges;
 
-    Halfedges_hash        copied_arr_special_edges;
+    Halfedges_hash copied_arr_special_edges;
     Halfedges_hash_w_type copied_arr_new_edges;
-    Faces_hash            copied_face_parts;
-    Vertices_hash         copied_arr_special_vertices;
+    Faces_hash copied_face_parts;
+    Vertices_hash copied_arr_special_vertices;
 
     // this observer will take care of the result arrangegment
-    Copy_observer        md_copy_observer;
+    Copy_observer md_copy_observer;
 
     // this observer will keep all our information in the helper collections
     // during the insert process
@@ -3160,26 +3119,23 @@ class Envelope_element_visitor_3
   };
 
   // this minimization diagram observer updates data in new faces created
-  class New_faces_observer : public Md_observer
-  {
+  class New_faces_observer : public Md_observer {
   public:
-    typedef typename Minimization_diagram_2::Face_handle Face_handle;
+    using Base_aos = typename Minimization_diagram_2::Base_aos;
+    using Face_handle = typename Base_aos::Face_handle;
 
-    New_faces_observer(Minimization_diagram_2& arr) : Md_observer(arr) {}
+    New_faces_observer(Base_aos& arr) : Md_observer(arr) {}
 
     virtual ~New_faces_observer() {}
 
-    virtual void after_split_face(Face_handle org_f,
-                                  Face_handle new_f,
-                                  bool)
-    {
+    virtual void after_split_face(Face_handle org_f, Face_handle new_f, bool)
+      override {
       // update the new face's aux_data from original face
       if (org_f->get_aux_is_set(0))
         new_f->set_aux_source(0, org_f->get_aux_source(0));
       if (org_f->get_aux_is_set(1))
         new_f->set_aux_source(1, org_f->get_aux_source(1));
     }
-
   };
 
   //! The geometry traits object.
diff --git a/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h b/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h
index d040ccb71583..28a13dd4dcdb 100644
--- a/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h
+++ b/Minkowski_sum_2/include/CGAL/Polygon_vertical_decomposition_2.h
@@ -79,10 +79,13 @@ class Polygon_vertical_decomposition_2 {
   // face mergers.
   class My_observer : public Arrangement_2::Observer {
   public:
-    My_observer(Arrangement_2& arr) : Arrangement_2::Observer(arr) {}
+    using Base_aos = typename Arrangement_2::Base_aos;
+    using Face_handle = typename Base_aos::Face_handle;
+
+    My_observer(Base_aos& arr) : Arrangement_2::Observer(arr) {}
 
     virtual void after_split_face(Face_handle f, Face_handle new_f,
-                                  bool /* is_hole */)
+                                  bool /* is_hole */) override
     { if (f->contained()) new_f->set_contained(true); }
   };
 
diff --git a/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h b/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h
index 63f59bba6ec6..b1b552a02908 100644
--- a/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h
+++ b/Visibility_2/include/CGAL/Triangular_expansion_visibility_2.h
@@ -87,61 +87,81 @@ class Triangular_expansion_visibility_2 {
   // Observer to track any changes of the attached arrangement.
   class Observer : public Arrangement_2::Observer
   {
-
-      typedef typename Arrangement_2::Observer                      Base;
-      typedef Observer                                              Self;
-
+      using Base = typename Arrangement_2::Observer;
+      using Self = Observer;
 
   public:
+      using Base_aos = typename Arrangement_2::Base_aos;
+      using Vertex_handle = typename Base_aos::Vertex_handle;
+      using Halfedge_handle = typename Base_aos::Halfedge_handle;
+      using Face_handle = typename Base_aos::Face_handle;
+      using Ccb_halfedge_circulator = typename Base_aos::Ccb_halfedge_circulator;
+
       bool has_changed;
 
-      Observer() : Base(), has_changed(false)
-      {}
+      Observer() : Base(), has_changed(false) {}
 
-      Observer(const Arrangement_2& arr)
-          : Base(const_cast<Arrangement_2&>(arr)), has_changed(false)
+      Observer(const Base_aos& arr) :
+        Base(const_cast<Base_aos&>(arr)), has_changed(false)
       {}
 
       // Aos_observer interface
 
-      void after_attach() { has_changed = false; }
-
-
-      void after_global_change() { has_changed = true; }
-      void after_create_vertex(Vertex_handle) { has_changed = true; }
-      void after_create_boundary_vertex(Vertex_handle) { has_changed = true; }
-      void after_create_edge(Halfedge_handle) { has_changed = true; }
-      void after_modify_vertex(Vertex_handle) { has_changed = true; }
-      void after_modify_edge(Halfedge_handle) { has_changed = true; }
-      void after_split_edge(Halfedge_handle, Halfedge_handle) {
-          has_changed = true; }
-      void after_split_fictitious_edge(Halfedge_handle, Halfedge_handle) {
-          has_changed = true; }
-      void after_split_face(Face_handle, Face_handle, bool) {
-          has_changed = true; }
-      void after_split_outer_ccb(Face_handle, Ccb_halfedge_circulator,
-                                 Ccb_halfedge_circulator) {
-          has_changed = true; }
-      void after_split_inner_ccb(Face_handle, Ccb_halfedge_circulator,
-                                 Ccb_halfedge_circulator) {
-          has_changed = true; }
-      void after_add_outer_ccb(Ccb_halfedge_circulator) { has_changed = true; }
-      void after_add_inner_ccb(Ccb_halfedge_circulator) { has_changed = true; }
-      void after_add_isolated_vertex(Vertex_handle) { has_changed = true; }
-      void after_merge_edge(Halfedge_handle) { has_changed = true; }
-      void after_merge_fictitious_edge(Halfedge_handle) { has_changed = true; }
-      void after_merge_face(Face_handle) { has_changed = true; }
-      void after_merge_outer_ccb(Face_handle, Ccb_halfedge_circulator) {
-          has_changed = true; }
-      void after_merge_inner_ccb(Face_handle, Ccb_halfedge_circulator) {
-          has_changed = true; }
-      void after_move_outer_ccb(Ccb_halfedge_circulator) { has_changed = true; }
-      void after_move_inner_ccb(Ccb_halfedge_circulator) { has_changed = true; }
-      void after_move_isolated_vertex(Vertex_handle) { has_changed = true; }
-      void after_remove_vertex() { has_changed = true; }
-      void after_remove_edge() { has_changed = true; }
-      void after_remove_outer_ccb(Face_handle) { has_changed = true; }
-      void after_remove_inner_ccb(Face_handle) { has_changed = true; }
+      virtual void after_attach() override { has_changed = false; }
+
+      virtual void after_global_change() override { has_changed = true; }
+      virtual void after_create_vertex(Vertex_handle) override
+      { has_changed = true; }
+      virtual void after_create_boundary_vertex(Vertex_handle) override
+      { has_changed = true; }
+      virtual void after_create_edge(Halfedge_handle) override
+      { has_changed = true; }
+      virtual void after_modify_vertex(Vertex_handle) override
+      { has_changed = true; }
+      virtual void after_modify_edge(Halfedge_handle) override
+      { has_changed = true; }
+      virtual void after_split_edge(Halfedge_handle, Halfedge_handle) override
+      { has_changed = true; }
+      virtual void after_split_fictitious_edge(Halfedge_handle, Halfedge_handle)
+        override
+      { has_changed = true; }
+      virtual void after_split_face(Face_handle, Face_handle, bool) override
+      { has_changed = true; }
+      virtual void after_split_outer_ccb(Face_handle, Ccb_halfedge_circulator,
+                                         Ccb_halfedge_circulator) override
+      { has_changed = true; }
+      virtual void after_split_inner_ccb(Face_handle, Ccb_halfedge_circulator,
+                                         Ccb_halfedge_circulator) override
+      { has_changed = true; }
+      virtual void after_add_outer_ccb(Ccb_halfedge_circulator) override
+      { has_changed = true; }
+      virtual void after_add_inner_ccb(Ccb_halfedge_circulator) override
+      { has_changed = true; }
+      virtual void after_add_isolated_vertex(Vertex_handle) override
+      { has_changed = true; }
+      virtual void after_merge_edge(Halfedge_handle) override
+      { has_changed = true; }
+      virtual void after_merge_fictitious_edge(Halfedge_handle) override
+      { has_changed = true; }
+      virtual void after_merge_face(Face_handle) override { has_changed = true; }
+      virtual void after_merge_outer_ccb(Face_handle, Ccb_halfedge_circulator)
+        override
+      { has_changed = true; }
+      virtual void after_merge_inner_ccb(Face_handle, Ccb_halfedge_circulator)
+        override
+      { has_changed = true; }
+      virtual void after_move_outer_ccb(Ccb_halfedge_circulator) override
+      { has_changed = true; }
+      virtual void after_move_inner_ccb(Ccb_halfedge_circulator) override
+      { has_changed = true; }
+      virtual void after_move_isolated_vertex(Vertex_handle) override
+      { has_changed = true; }
+      virtual void after_remove_vertex() override { has_changed = true; }
+      virtual void after_remove_edge() override { has_changed = true; }
+      virtual void after_remove_outer_ccb(Face_handle) override
+      { has_changed = true; }
+      virtual void after_remove_inner_ccb(Face_handle) override
+      { has_changed = true; }
   };
 
 

From 18facb24deebcc0bcd6b12927df41df80b73a09b Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Mon, 13 Dec 2021 12:38:30 +0100
Subject: [PATCH 1181/1398] add missing nb_extra_iterations = 0 when macro is
 on (for debugging purposes)

---
 .../include/CGAL/tetrahedral_remeshing.h                  | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
index 8a8ebe925b3b..d41d3dbb987a 100644
--- a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
+++ b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
@@ -280,6 +280,10 @@ void tetrahedral_isotropic_remeshing(
 
   // perform remeshing
   std::size_t nb_extra_iterations = 3;
+#ifdef CGAL_TETRAHEDRAL_REMESHING_NO_EXTRA_ITERATIONS
+  nb_extra_iterations = 0;
+#endif
+
   remesher.remesh(max_it, nb_extra_iterations);
 
 #ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
@@ -458,6 +462,10 @@ void tetrahedral_isotropic_remeshing(
 
   // perform remeshing
   std::size_t nb_extra_iterations = 3;
+#ifdef CGAL_TETRAHEDRAL_REMESHING_NO_EXTRA_ITERATIONS
+  nb_extra_iterations = 0;
+#endif
+
   remesher.remesh(max_it, nb_extra_iterations);
 
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE

From 53455200914ebab6348afe0a1b264d3f2a4ee4ee Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Mon, 13 Dec 2021 12:54:06 +0100
Subject: [PATCH 1182/1398] introduce edge flips on surfaces

this version works with 4-4 flips where an edge is flipped on the surface, and
each pair of incident faces is incident to exactly 2 cells

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 .../internal/flip_edges.h                     | 519 +++++++++++++++++-
 .../internal/tetrahedral_remeshing_helpers.h  |  21 +
 2 files changed, 520 insertions(+), 20 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 798284fa04ea..52d2c5a9d599 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -38,12 +38,6 @@ namespace internal
 enum Flip_Criterion{ MIN_ANGLE_BASED, AVERAGE_ANGLE_BASED,
                      VALENCE_BASED, VALENCE_MIN_DH_BASED };
 
-//template<typename VertexPair>
-//void flip_inside_edges(std::vector<VertexPair>&)
-//{
-//  //TODO
-//}
-
 //outer_mirror_facets contains the set of facets of the outer hull
 //of the set of cells modified by the flip operation,
 //"seen from" outside
@@ -1231,6 +1225,486 @@ std::size_t flip_all_edges(const std::vector<VertexPair>& edges,
   return count;
 }
 
+template<typename C3T3, typename CellSelector>
+void collectBoundaryEdgesAndComputeVerticesValences(
+  const C3T3& c3t3,
+  CellSelector cell_selector,
+  std::vector<typename C3T3::Edge>& boundary_edges,
+  boost::unordered_map<typename C3T3::Vertex_handle,
+                       boost::unordered_map<typename C3T3::Surface_patch_index, unsigned int> >&
+      boundary_vertices_valences,
+  boost::unordered_map<typename C3T3::Vertex_handle, std::vector<typename C3T3::Subdomain_index> >&
+      vertices_subdomain_indices)
+{
+  typedef typename C3T3::Subdomain_index     Subdomain_index;
+  typedef typename C3T3::Surface_patch_index Surface_patch_index;
+  typedef typename C3T3::Vertex_handle       Vertex_handle;
+  typedef typename C3T3::Edge                Edge;
+
+  const typename C3T3::Triangulation& tr = c3t3.triangulation();
+
+  boundary_edges.clear();
+  boundary_vertices_valences.clear();
+
+  for (typename C3T3::Triangulation::Finite_edges_iterator
+       eit = tr.finite_edges_begin();
+       eit != tr.finite_edges_end();
+       ++eit)
+  {
+    const Edge e = *eit;
+    if (is_boundary(c3t3, e, cell_selector))
+      boundary_edges.push_back(e);
+  }
+
+  for(std::size_t i = 0; i < boundary_edges.size(); ++i)
+  {
+    const Edge& e = boundary_edges[i];
+    const Vertex_handle v0 = e.first->vertex(e.second);
+    const Vertex_handle v1 = e.first->vertex(e.third);
+
+    if (vertices_subdomain_indices.find(v0) == vertices_subdomain_indices.end())
+      incident_subdomains(v0, c3t3, std::back_inserter(vertices_subdomain_indices[v0]));
+    if (vertices_subdomain_indices.find(v1) == vertices_subdomain_indices.end())
+      incident_subdomains(v1, c3t3, std::back_inserter(vertices_subdomain_indices[v1]));
+  }
+
+  typedef typename boost::unordered_map<typename C3T3::Vertex_handle,
+                                std::vector<typename C3T3::Subdomain_index> >::iterator Iter;
+  for (Iter it = vertices_subdomain_indices.begin(); it != vertices_subdomain_indices.end(); ++it)
+  {
+    Vertex_handle v = it->first;
+    boost::unordered_set<Surface_patch_index> indices;
+    incident_surface_patches(v, c3t3, std::inserter(indices, indices.begin()));
+
+    CGAL_assertion(!indices.empty());
+
+    for (typename boost::unordered_set<Surface_patch_index>::iterator
+         spit = indices.begin(); spit != indices.end(); ++spit)
+    {
+      boundary_vertices_valences[v][*spit]++;
+    }
+  }
+}
+
+//v0i and v1i are the vertices opposite to `edge`
+//on facets of the surface
+template<typename C3T3>
+Sliver_removal_result flip_on_surface(C3T3& c3t3,
+                                      typename C3T3::Edge& edge,
+                                      typename C3T3::Vertex_handle v0i,
+                                      typename C3T3::Vertex_handle v1i,
+                                      Flip_Criterion flip_criterion)
+{
+  typedef typename C3T3::Triangulation Tr;
+  typedef typename Tr::Cell_handle     Cell_handle;
+  typedef typename Tr::Vertex_handle   Vertex_handle;
+  typedef typename Tr::Cell_circulator Cell_circulator;
+  typedef typename Tr::Point           Point_3;
+
+  Tr& tr = c3t3.triangulation();
+  Cell_circulator circ = tr.incident_cells(edge);
+  Cell_circulator done(circ);
+
+  std::vector<Cell_handle> cells_around_edge;
+  do
+  {
+    cells_around_edge.push_back(circ);
+  } while (++circ != done);
+
+//  if (cells_around_edge.size() != 4)
+//  {
+//    if (cells_around_edge.size() > 4){
+////      if (flip_criterion == VALENCE_BASED){
+////        return find_best_n_m_flip(edge, vh0_index, vh1_index);
+////      }
+////      else {
+//        std::vector<Vertex_handle> boundary_vertices;
+//        boundary_vertices.push_back(vh0);
+//        boundary_vertices.push_back(vh1);
+//
+//        flip_n_to_m(C3t3& c3t3,
+//          typename C3t3::Edge& edge,
+//          typename C3t3::Vertex_handle vh,
+//          IncCellsVectorMap& inc_cells,
+//          Visitor& visitor,
+//          bool check_validity = false)
+//
+//          return flip_n_to_m(c3t3, edge, boundary_vertices, flip_criterion);
+//        //std::cout << "n to m flip "<< cells_around_edge.size() << std::endl;
+////      }
+//    }
+//
+//    return NOT_FLIPPABLE;
+//  }
+//
+
+  Cell_handle ch0, ch1, ch2, ch3;
+  ch0 = cells_around_edge[0];
+  ch1 = cells_around_edge[1];
+  ch2 = cells_around_edge[2];
+  ch3 = cells_around_edge[3];
+
+  Vertex_handle vh0, vh1, vh2, vh3, vh4, vh5;
+
+  int ivh4 = ch0->index(ch1);
+  vh4 = ch0->vertex(ivh4);
+
+  int ivh2 = ch0->index(ch3);
+  vh2 = ch0->vertex(ivh2);
+
+  vh5 = ch1->vertex(ch1->index(ch0));
+  vh0 = ch2->vertex(ch2->index(ch1));
+
+  for (int j = 0; j < 3; j++){
+    if (indices(ivh4, j) == ivh2){
+      int j1 = (j + 1) % 3;
+      int j2 = (j + 2) % 3;
+      vh1 = ch0->vertex(indices(ivh4, j1));
+      vh3 = ch0->vertex(indices(ivh4, j2));
+      break;
+    }
+  }
+
+  bool planar_flip;
+
+  std::vector<std::pair<Point_3, Point_3> > current_edges;
+  current_edges.push_back(std::make_pair(vh1->point(), vh3->point()));
+
+  if (vh0 == v0i && vh2 == v1i || vh2 == v0i && vh0 == v1i)
+  {
+    planar_flip = true;
+    current_edges.push_back(std::make_pair(vh0->point(), vh2->point()));
+  }
+  else if (vh4 == v0i && vh5 == v1i || vh5 == v0i && vh4 == v1i)
+    planar_flip = false;
+  else
+    return NOT_FLIPPABLE;
+
+  //  /*
+//  post_sliver_Removal_cells.clear();
+//  post_sliver_Removal_cells.push_back( ch0 );
+//  post_sliver_Removal_cells.push_back( ch1 );
+//  post_sliver_Removal_cells.push_back( ch2 );
+//  post_sliver_Removal_cells.push_back( ch3 );
+//
+//  post_sliver_Removal_vertices.clear();
+//  post_sliver_Removal_vertices.push_back( vh0 );
+//  post_sliver_Removal_vertices.push_back( vh1 );
+//  post_sliver_Removal_vertices.push_back( vh2 );
+//  post_sliver_Removal_vertices.push_back( vh3 );
+//  post_sliver_Removal_vertices.push_back( vh4 );
+//  post_sliver_Removal_vertices.push_back( vh5 );
+//
+//  pre_sliver_Removal_cells.clear();
+//  pre_sliver_Removal_cells.push_back(K::Tetrahedron_3 ( ch0->vertex(0)->point(), ch0->vertex(1)->point(), ch0->vertex(2)->point(), ch0->vertex(3)->point()  ));
+//  pre_sliver_Removal_cells.push_back(K::Tetrahedron_3 ( ch1->vertex(0)->point(), ch1->vertex(1)->point(), ch1->vertex(2)->point(), ch1->vertex(3)->point()  ));
+//  pre_sliver_Removal_cells.push_back(K::Tetrahedron_3 ( ch2->vertex(0)->point(), ch2->vertex(1)->point(), ch2->vertex(2)->point(), ch2->vertex(3)->point()  ));
+//  pre_sliver_Removal_cells.push_back(K::Tetrahedron_3 ( ch3->vertex(0)->point(), ch3->vertex(1)->point(), ch3->vertex(2)->point(), ch3->vertex(3)->point()  ));
+//
+//  if( ! c3t3_with_info.triangulation().is_valid( ch0 ) ||
+//  ! c3t3_with_info.triangulation().is_valid( ch1 ) || ! c3t3_with_info.triangulation().is_valid( ch2 ) || !c3t3_with_info.triangulation().is_valid( ch3 ) ){
+//  std::cout << "Initial cell PB!!" << std::endl;
+//  return CELL_PBS;
+//  }
+//
+//  std::cout << "vh0 "<< vh0->info() <<", " << vh1->info() << ", " << vh2->info() << ", " << vh3->info()<<", " << vh4->info() << ", " << vh5 ->info() << std::endl;
+//  */
+
+  if (planar_flip)
+  {
+    Cell_handle n_ch3_vh1 = ch3->neighbor(ch3->index(vh1));
+    Cell_handle n_ch0_vh3 = ch0->neighbor(ch0->index(vh3));
+
+    Cell_handle n_ch2_vh1 = ch2->neighbor(ch2->index(vh1));
+    Cell_handle n_ch1_vh3 = ch1->neighbor(ch1->index(vh3));
+
+//    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch3_vh1->vertex(0)->point(), n_ch3_vh1->vertex(1)->point(), n_ch3_vh1->vertex(2)->point(), n_ch3_vh1->vertex(3)->point()));
+//    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch0_vh3->vertex(0)->point(), n_ch0_vh3->vertex(1)->point(), n_ch0_vh3->vertex(2)->point(), n_ch0_vh3->vertex(3)->point()));
+//    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch2_vh1->vertex(0)->point(), n_ch2_vh1->vertex(1)->point(), n_ch2_vh1->vertex(2)->point(), n_ch2_vh1->vertex(3)->point()));
+//    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch1_vh3->vertex(0)->point(), n_ch1_vh3->vertex(1)->point(), n_ch1_vh3->vertex(2)->point(), n_ch1_vh3->vertex(3)->point()));
+
+    ch3->set_vertex(ch3->index(vh3), vh2);
+    ch0->set_vertex(ch0->index(vh1), vh0);
+    ch2->set_vertex(ch2->index(vh3), vh2);
+    ch1->set_vertex(ch1->index(vh1), vh0);
+    if ( !is_well_oriented(tr, ch0)
+      || !is_well_oriented(tr, ch1)
+      || !is_well_oriented(tr, ch2)
+      || !is_well_oriented(tr, ch3))
+    {
+      ch3->set_vertex(ch3->index(vh2), vh3);
+      ch0->set_vertex(ch0->index(vh0), vh1);
+      ch2->set_vertex(ch2->index(vh2), vh3);
+      ch1->set_vertex(ch1->index(vh0), vh1);
+      return NOT_FLIPPABLE;
+    }
+
+    //Top cells 2-2 flip
+    ch3->set_neighbor(ch3->index(vh1), ch0);
+    ch3->set_neighbor(ch3->index(vh0), n_ch0_vh3);
+    n_ch0_vh3->set_neighbor(n_ch0_vh3->index(ch0), ch3);
+
+    ch0->set_neighbor(ch0->index(vh3), ch3);
+    ch0->set_neighbor(ch0->index(vh2), n_ch3_vh1);
+    n_ch3_vh1->set_neighbor(n_ch3_vh1->index(ch3), ch0);
+
+    //Bottom cells 2-2 flip
+
+
+
+    ch2->set_neighbor(ch2->index(vh1), ch1);
+    ch2->set_neighbor(ch2->index(vh0), n_ch1_vh3);
+    n_ch1_vh3->set_neighbor(n_ch1_vh3->index(ch1), ch2);
+
+    ch1->set_neighbor(ch1->index(vh3), ch2);
+    ch1->set_neighbor(ch1->index(vh2), n_ch2_vh1);
+    n_ch2_vh1->set_neighbor(n_ch2_vh1->index(ch2), ch1);
+
+    for (std::size_t i = 0; i < cells_around_edge.size(); i++)
+    {
+      for (int j = 0; j < 4; j++)
+        cells_around_edge[i]->vertex(j)->set_cell(cells_around_edge[i]);
+    }
+
+    Sliver_removal_result db = VALID_FLIP;
+
+//    /*
+//    std::cout << "Ch0 "<< ch0->info()<< std::endl;
+//    if(! c3t3_with_info.triangulation().is_valid(ch0, true) )
+//    db = CELL_PBS;
+//    std::cout << "Ch1 "<< ch1->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(ch1, true))
+//    db = CELL_PBS;
+//    std::cout << "Ch2 "<< ch2->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(ch2, true))
+//    db = CELL_PBS;
+//    std::cout << "Ch3 "<< ch3->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(ch3, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch3_vh1 "<< n_ch3_vh1->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch3_vh1, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch0_vh3 "<< n_ch0_vh3->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch0_vh3, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch2_vh1 "<< n_ch2_vh1->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch2_vh1, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch1_vh3 "<< n_ch1_vh3->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch1_vh3, true))
+//    db = CELL_PBS;
+//
+//    */
+//
+    return db;
+  }
+  else
+  {
+    // Top Flip
+    ch3->set_vertex(ch3->index(vh1), vh5);
+    ch2->set_vertex(ch2->index(vh3), vh4);
+    ch0->set_vertex(ch0->index(vh1), vh5);
+    ch1->set_vertex(ch1->index(vh3), vh4);
+    if ( !is_well_oriented(tr, ch0)
+      || !is_well_oriented(tr, ch1)
+      || !is_well_oriented(tr, ch2)
+      || !is_well_oriented(tr, ch3))
+    {
+      ch3->set_vertex(ch3->index(vh5), vh1);
+      ch2->set_vertex(ch2->index(vh4), vh3);
+      ch0->set_vertex(ch0->index(vh5), vh1);
+      ch1->set_vertex(ch1->index(vh4), vh3);
+      return NOT_FLIPPABLE;
+    }
+
+    //Left cells 2-2 flip
+    Cell_handle n_ch3_vh3 = ch3->neighbor(ch3->index(vh3));
+    Cell_handle n_ch2_vh1 = ch2->neighbor(ch2->index(vh1));
+
+    ch3->set_neighbor(ch3->index(vh3), ch2);
+    ch3->set_neighbor(ch3->index(vh4), n_ch2_vh1);
+    n_ch2_vh1->set_neighbor(n_ch2_vh1->index(ch2), ch3);
+
+    ch2->set_neighbor(ch2->index(vh1), ch3);
+    ch2->set_neighbor(ch2->index(vh5), n_ch3_vh3);
+    n_ch3_vh3->set_neighbor(n_ch3_vh3->index(ch3), ch2);
+
+    //Right cells 2-2 flip
+
+    Cell_handle n_ch0_vh3 = ch0->neighbor(ch0->index(vh3));
+    Cell_handle n_ch1_vh1 = ch1->neighbor(ch1->index(vh1));
+
+    ch0->set_neighbor(ch0->index(vh3), ch1);
+    ch0->set_neighbor(ch0->index(vh4), n_ch1_vh1);
+    n_ch1_vh1->set_neighbor(n_ch1_vh1->index(ch1), ch0);
+
+    ch1->set_neighbor(ch1->index(vh1), ch0);
+    ch1->set_neighbor(ch1->index(vh5), n_ch0_vh3);
+    n_ch0_vh3->set_neighbor(n_ch0_vh3->index(ch0), ch1);
+
+    for (unsigned int i = 0; i < cells_around_edge.size(); i++){
+      for (int j = 0; j < 4; j++)
+        cells_around_edge[i]->vertex(j)->set_cell(cells_around_edge[i]);
+    }
+
+    Sliver_removal_result db = VALID_FLIP;
+//    /*
+//    std::cout << "Ch0 "<< ch0->info()<< std::endl;
+//    if(! c3t3_with_info.triangulation().is_valid(ch0, true) )
+//    db = CELL_PBS;
+//    std::cout << "Ch1 "<< ch1->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(ch1, true))
+//    db = CELL_PBS;
+//    std::cout << "Ch2 "<< ch2->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(ch2, true))
+//    db = CELL_PBS;
+//    std::cout << "Ch3 "<< ch3->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(ch3, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch3_vh3 "<< n_ch3_vh3->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch3_vh3, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch2_vh1 "<< n_ch2_vh1->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch2_vh1, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch0_vh3 "<< n_ch0_vh3->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch0_vh3, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch1_vh1 "<< n_ch1_vh1->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch1_vh1, true))
+//    db = CELL_PBS;
+//    */
+    return db;
+  }
+
+  return VALID_FLIP;
+}
+
+template<typename C3T3, typename SurfaceIndexMapMap, typename Flip_Criterion>
+void flipBoundaryEdges(
+  C3T3& c3t3,
+  std::vector<typename C3T3::Edge>& boundary_edges,
+  SurfaceIndexMapMap& boundary_vertices_valences,
+  boost::unordered_map<typename C3T3::Vertex_handle, std::vector<typename C3T3::Subdomain_index> >&  vertices_subdomain_indices,
+  Flip_Criterion flip_criterion)
+{
+  typedef typename C3T3::Vertex_handle Vertex_handle;
+  typedef typename C3T3::Cell_handle   Cell_handle;
+  typedef typename C3T3::Facet         Facet;
+  typedef typename C3T3::Edge          Edge;
+  typedef typename C3T3::Surface_patch_index Surface_patch_index;
+  typedef typename C3T3::Subdomain_index Subdomain_index;
+  typedef typename C3T3::Triangulation Tr;
+  typedef std::pair<Vertex_handle, Vertex_handle> Edge_vv;
+
+  Tr& tr = c3t3.triangulation();
+
+  std::vector<Edge_vv> candidate_edges_for_flip;
+
+  for (std::size_t i = 0; i < boundary_edges.size(); i++)
+  {
+    const Edge& e = boundary_edges[i];
+    if (c3t3.is_in_complex(e))
+      continue;
+    else
+    {
+      const Vertex_handle& vh0 = e.first->vertex(e.second);
+      const Vertex_handle& vh1 = e.first->vertex(e.third);
+      candidate_edges_for_flip.push_back(std::make_pair(vh0, vh1));
+    }
+  }
+  for (std::size_t ii = 0; ii < candidate_edges_for_flip.size(); ++ii)
+  {
+    const Vertex_handle& vh0 = candidate_edges_for_flip[ii].first;
+    const Vertex_handle& vh1 = candidate_edges_for_flip[ii].second;
+
+    Cell_handle c;
+    int i, j;
+    if (!tr.tds().is_edge(vh0, vh1, c, i, j))
+      continue;
+
+    std::vector<Facet> boundary_facets;
+    Surface_patch_index surfi;
+
+    Edge edge(c, i, j);
+    typename Tr::Facet_circulator fcirc = tr.incident_facets(edge);
+    typename Tr::Facet_circulator done(fcirc);
+    do
+    {
+      if (c3t3.is_in_complex(*fcirc))
+      {
+        surfi = c3t3.surface_patch_index(*fcirc);
+        boundary_facets.push_back(*fcirc);
+      }
+    } while (++fcirc != done);
+
+    if (boundary_facets.size() == 2)
+    {
+      Facet& f0 = boundary_facets[0];
+      Facet& f1 = boundary_facets[1]; 
+
+      Vertex_handle vh2;
+      Vertex_handle vh3;
+      for (int i = 0; i < 3; i++)
+      {
+        Vertex_handle v2 = f0.first->vertex(indices(f0.second, i));
+        Vertex_handle v3 = f1.first->vertex(indices(f1.second, i));
+        if (v2 != vh0 && v2 != vh1)
+          vh2 = v2;
+        if (v3 != vh0 && v3 != vh1)
+          vh3 = v3;
+      }
+
+      Cell_handle t_ch;
+      int t_i0, t_i1;
+      if (!tr.is_edge(vh2, vh3, t_ch, t_i0, t_i1))
+      {
+        int v0 = boundary_vertices_valences[vh0][surfi];
+        int v1 = boundary_vertices_valences[vh1][surfi];
+        int v2 = boundary_vertices_valences[vh2][surfi];
+        int v3 = boundary_vertices_valences[vh3][surfi];
+        int m0 = (vertices_subdomain_indices[vh0].size() >2 ? 4 : 6);
+        int m1 = (vertices_subdomain_indices[vh1].size() >2 ? 4 : 6);
+        int m2 = (vertices_subdomain_indices[vh2].size() >2 ? 4 : 6);
+        int m3 = (vertices_subdomain_indices[vh3].size() >2 ? 4 : 6);
+
+        int initial_cost = (v0 - m0)*(v0 - m0)
+                         + (v1 - m1)*(v1 - m1)
+                         + (v2 - m2)*(v2 - m2)
+                         + (v3 - m3)*(v3 - m3);
+        v0--;
+        v1--;
+        v2++;
+        v3++;
+
+        int final_cost = (v0 - m0)*(v0 - m0)
+                       + (v1 - m1)*(v1 - m1)
+                       + (v2 - m2)*(v2 - m2)
+                       + (v3 - m3)*(v3 - m3);
+        if (initial_cost > final_cost)
+        {
+          Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3, flip_criterion);
+          if (db == VALID_FLIP)
+          {
+            std::cout << "Flip done" << std::endl;
+
+            boundary_vertices_valences[vh0][surfi]--;
+            boundary_vertices_valences[vh1][surfi]--;
+            boundary_vertices_valences[vh2][surfi]++;
+            boundary_vertices_valences[vh3][surfi]++;
+          }
+          else if (db == INVALID_CELL || db == INVALID_VERTEX || db == INVALID_ORIENTATION)
+          {
+            std::cout << "Cell problem" << std::endl;
+            return;
+          }
+        }
+      }
+    }
+  }
+  CGAL_assertion(tr.tds().is_valid(true));
+}
+
 template<typename C3T3, typename CellSelector, typename Visitor>
 void flip_edges(C3T3& c3t3,
                 const bool protect_boundaries,
@@ -1240,7 +1714,9 @@ void flip_edges(C3T3& c3t3,
   CGAL_USE(protect_boundaries);
   typedef typename C3T3::Triangulation       T3;
   typedef typename T3::Vertex_handle         Vertex_handle;
+  typedef typename T3::Edge                  Edge;
   typedef typename std::pair<Vertex_handle, Vertex_handle> Edge_vv;
+  typedef typename C3T3::Subdomain_index     Subdomain_index;
 
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
   std::cout << "Flip edges...";
@@ -1252,24 +1728,27 @@ void flip_edges(C3T3& c3t3,
 
   //compute vertices normals map?
 
-  // typedef typename C3T3::Surface_patch_index Surface_patch_index;
-  // typedef std::unordered_map<Surface_patch_index, unsigned int> Spi_map;
-  //if (!protect_boundaries)
-  //{
-  //  std::cout << "\tBoundary flips" << std::endl;
-  //  //Boundary flip
-  //  std::vector<Spi_map> boundary_vertices_valences;
-  //  std::vector<Edge_vv> boundary_edges;
-
-  //  collectBoundaryEdges(boundary_edges);
-
-  //  computeVerticesValences(boundary_vertices_valences);
+  typedef typename C3T3::Surface_patch_index Surface_patch_index;
+  typedef boost::unordered_map<Surface_patch_index, unsigned int> Spi_map;
+  if (!protect_boundaries)
+  {
+    std::cout << "\tBoundary flips" << std::endl;
+    //Boundary flip
+    std::vector<Edge> boundary_edges;
+    boost::unordered_map<Vertex_handle, Spi_map> boundary_vertices_valences;
+    boost::unordered_map<Vertex_handle, std::vector<Subdomain_index> > vertices_subdomain_indices;
+    collectBoundaryEdgesAndComputeVerticesValences(c3t3,
+                                                   cell_selector,
+                                                   boundary_edges,
+                                                   boundary_vertices_valences,
+                                                   vertices_subdomain_indices);
 
   //  if (criterion == VALENCE_BASED)
   //    flipBoundaryEdges(boundary_edges, boundary_vertices_valences, VALENCE_BASED);
   //  else
-  //    flipBoundaryEdges(boundary_edges, boundary_vertices_valences, MIN_ANGLE_BASED);
-  //}
+    flipBoundaryEdges(c3t3, boundary_edges, boundary_vertices_valences,
+                      vertices_subdomain_indices, MIN_ANGLE_BASED);
+  }
 
   std::vector<Edge_vv> inside_edges;
   get_internal_edges(c3t3,
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index f566ab1890fb..b56f8aca389d 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -642,6 +642,27 @@ OutputIterator incident_surface_patches(const typename C3t3::Edge& e,
   return oit;
 }
 
+template<typename C3t3, typename OutputIterator>
+OutputIterator incident_surface_patches(const typename C3t3::Vertex_handle& v,
+                                        const C3t3& c3t3,
+                                        OutputIterator oit)
+{
+  typedef typename C3t3::Triangulation::Facet Facet;
+  boost::unordered_set<Facet> facets;
+  c3t3.triangulation().incident_facets(v, std::inserter(facets, facets.begin()));
+
+  for (typename boost::unordered_set<Facet>::iterator fit = facets.begin();
+    fit != facets.end();
+    ++fit)
+  {
+    const Facet& f = *fit;
+    if (c3t3.is_in_complex(f))
+      *oit++ = c3t3.surface_patch_index(f);
+  }
+
+  return oit;
+}
+
 template<typename C3t3>
 std::size_t nb_incident_subdomains(const typename C3t3::Vertex_handle v,
                                    const C3t3& c3t3)

From 9734585b358d7c57f8476b5b4a2f667de9adbbf5 Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Tue, 14 Dec 2021 18:33:38 +0100
Subject: [PATCH 1183/1398] wip flip on surfaces

there are holes on surfaces

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 .../internal/flip_edges.h                     | 389 +++++++++++-------
 .../internal/tetrahedral_remeshing_helpers.h  |   2 +
 2 files changed, 250 insertions(+), 141 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 52d2c5a9d599..cd8e4843d522 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -861,15 +861,11 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
   ///*************************************************************/
 
   //Subdomain index?
-  typename C3t3::Subdomain_index subdomain = to_remove[0]->subdomain_index();
+  typedef typename C3t3::Subdomain_index Subdomain_index;
+  Subdomain_index subdomain = to_remove[0]->subdomain_index();
   bool selected = get(cell_selector, to_remove[0]);
   visitor.before_flip(to_remove[0]);
 
-#ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
-  for (std::size_t i = 1; i < to_remove.size(); ++i)
-    CGAL_assertion(subdomain == to_remove[i]->subdomain_index());
-#endif
-
   std::vector<Cell_handle> cells_to_update;
 
   //Create new cells
@@ -1219,7 +1215,9 @@ std::size_t flip_all_edges(const std::vector<VertexPair>& edges,
     }
   }
 
-  for(Cell_handle c : c3t3.triangulation().finite_cell_handles())
+  for (typename Tr::Finite_cells_iterator c = tr.finite_cells_begin();
+       c != tr.finite_cells_end();
+       ++c)
     c->reset_cache_validity();
 
   return count;
@@ -1240,6 +1238,7 @@ void collectBoundaryEdgesAndComputeVerticesValences(
   typedef typename C3T3::Surface_patch_index Surface_patch_index;
   typedef typename C3T3::Vertex_handle       Vertex_handle;
   typedef typename C3T3::Edge                Edge;
+  typedef typename C3T3::Triangulation::Facet_circulator Facet_circulator;
 
   const typename C3T3::Triangulation& tr = c3t3.triangulation();
 
@@ -1256,7 +1255,7 @@ void collectBoundaryEdgesAndComputeVerticesValences(
       boundary_edges.push_back(e);
   }
 
-  for(std::size_t i = 0; i < boundary_edges.size(); ++i)
+  for (std::size_t i = 0; i < boundary_edges.size(); ++i)
   {
     const Edge& e = boundary_edges[i];
     const Vertex_handle v0 = e.first->vertex(e.second);
@@ -1266,34 +1265,51 @@ void collectBoundaryEdgesAndComputeVerticesValences(
       incident_subdomains(v0, c3t3, std::back_inserter(vertices_subdomain_indices[v0]));
     if (vertices_subdomain_indices.find(v1) == vertices_subdomain_indices.end())
       incident_subdomains(v1, c3t3, std::back_inserter(vertices_subdomain_indices[v1]));
-  }
 
-  typedef typename boost::unordered_map<typename C3T3::Vertex_handle,
-                                std::vector<typename C3T3::Subdomain_index> >::iterator Iter;
-  for (Iter it = vertices_subdomain_indices.begin(); it != vertices_subdomain_indices.end(); ++it)
-  {
-    Vertex_handle v = it->first;
-    boost::unordered_set<Surface_patch_index> indices;
-    incident_surface_patches(v, c3t3, std::inserter(indices, indices.begin()));
+    //In case of feature edge
+    if (vertices_subdomain_indices[v0].size() > 2
+      && vertices_subdomain_indices[v1].size() > 2)
+    {
+      Facet_circulator facet_circulator = tr.incident_facets(e);
+      Facet_circulator done(facet_circulator);
+      do
+      {
+        if (c3t3.is_in_complex(*facet_circulator))
+        {
+          Surface_patch_index surfi = c3t3.surface_patch_index(*facet_circulator);
+          boundary_vertices_valences[v0][surfi]++;
+          boundary_vertices_valences[v1][surfi]++;
+        }
+      } while (++facet_circulator != done);
+    }
+    else if (vertices_subdomain_indices[v0].size() == 2)
+    {
+      Surface_patch_index surfi_0 = surface_patch_index(v0, c3t3);
 
-    CGAL_assertion(!indices.empty());
+      boundary_vertices_valences[v0][surfi_0]++;
+      boundary_vertices_valences[v1][surfi_0]++;
 
-    for (typename boost::unordered_set<Surface_patch_index>::iterator
-         spit = indices.begin(); spit != indices.end(); ++spit)
+    }
+    else if (vertices_subdomain_indices[v1].size() == 2)
     {
-      boundary_vertices_valences[v][*spit]++;
+      Surface_patch_index surfi_1 = surface_patch_index(v1, c3t3);
+
+      boundary_vertices_valences[v0][surfi_1]++;
+      boundary_vertices_valences[v1][surfi_1]++;
     }
   }
 }
 
 //v0i and v1i are the vertices opposite to `edge`
 //on facets of the surface
-template<typename C3T3>
+template<typename C3T3, typename IncCellsVectorMap, typename Visitor>
 Sliver_removal_result flip_on_surface(C3T3& c3t3,
                                       typename C3T3::Edge& edge,
                                       typename C3T3::Vertex_handle v0i,
                                       typename C3T3::Vertex_handle v1i,
-                                      Flip_Criterion flip_criterion)
+                                      IncCellsVectorMap& inc_cells,
+                                      Flip_Criterion flip_criterion,
+                                      Visitor& visitor)
 {
   typedef typename C3T3::Triangulation Tr;
   typedef typename Tr::Cell_handle     Cell_handle;
@@ -1311,32 +1327,32 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     cells_around_edge.push_back(circ);
   } while (++circ != done);
 
-//  if (cells_around_edge.size() != 4)
-//  {
+  if (cells_around_edge.size() != 4)
+  {
+    std::cout << "nb cells = " << cells_around_edge.size() << std::endl;
 //    if (cells_around_edge.size() > 4){
-////      if (flip_criterion == VALENCE_BASED){
-////        return find_best_n_m_flip(edge, vh0_index, vh1_index);
-////      }
-////      else {
+//////      if (flip_criterion == VALENCE_BASED){
+//////        return find_best_n_m_flip(edge, vh0_index, vh1_index);
+//////      }
+//////      else {
 //        std::vector<Vertex_handle> boundary_vertices;
-//        boundary_vertices.push_back(vh0);
-//        boundary_vertices.push_back(vh1);
+//        boundary_vertices.push_back(v0i);
+//        boundary_vertices.push_back(v1i);
 //
-//        flip_n_to_m(C3t3& c3t3,
-//          typename C3t3::Edge& edge,
-//          typename C3t3::Vertex_handle vh,
-//          IncCellsVectorMap& inc_cells,
-//          Visitor& visitor,
-//          bool check_validity = false)
-//
-//          return flip_n_to_m(c3t3, edge, boundary_vertices, flip_criterion);
-//        //std::cout << "n to m flip "<< cells_around_edge.size() << std::endl;
+//        return flip_n_to_m(edge, c3t3, boundary_vertices,
+//                           flip_criterion,
+//                           inc_cells,
+//                           visitor);
 ////      }
 //    }
-//
-//    return NOT_FLIPPABLE;
-//  }
-//
+//    else
+      return NOT_FLIPPABLE;
+  }
+
+  if(inc_cells[edge.first->vertex(edge.second)] != boost::none)
+    inc_cells[edge.first->vertex(edge.second)].get().clear();
+  if (inc_cells[edge.first->vertex(edge.third)] != boost::none)
+    inc_cells[edge.first->vertex(edge.third)].get().clear();
 
   Cell_handle ch0, ch1, ch2, ch3;
   ch0 = cells_around_edge[0];
@@ -1367,13 +1383,13 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 
   bool planar_flip;
 
-  std::vector<std::pair<Point_3, Point_3> > current_edges;
-  current_edges.push_back(std::make_pair(vh1->point(), vh3->point()));
+//  std::vector<std::pair<Point_3, Point_3> > current_edges;
+//  current_edges.push_back(std::make_pair(vh1->point(), vh3->point()));
 
   if (vh0 == v0i && vh2 == v1i || vh2 == v0i && vh0 == v1i)
   {
     planar_flip = true;
-    current_edges.push_back(std::make_pair(vh0->point(), vh2->point()));
+//    current_edges.push_back(std::make_pair(vh0->point(), vh2->point()));
   }
   else if (vh4 == v0i && vh5 == v1i || vh5 == v0i && vh4 == v1i)
     planar_flip = false;
@@ -1410,14 +1426,39 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //  std::cout << "vh0 "<< vh0->info() <<", " << vh1->info() << ", " << vh2->info() << ", " << vh3->info()<<", " << vh4->info() << ", " << vh5 ->info() << std::endl;
 //  */
 
+  typedef std::pair<Vertex_handle, Vertex_handle> Edge_uv;
+  typedef typename C3t3::Edge Edge;
+
   if (planar_flip)
   {
+    typename C3t3::Surface_patch_index patch = c3t3.surface_patch_index(ch0, ch0->index(vh4));
+    CGAL_assertion(patch != typename C3t3::Surface_patch_index());
+    c3t3.remove_from_complex(ch0, ch0->index(vh4));
+    c3t3.remove_from_complex(ch3, ch3->index(vh4));
+
     Cell_handle n_ch3_vh1 = ch3->neighbor(ch3->index(vh1));
     Cell_handle n_ch0_vh3 = ch0->neighbor(ch0->index(vh3));
 
     Cell_handle n_ch2_vh1 = ch2->neighbor(ch2->index(vh1));
     Cell_handle n_ch1_vh3 = ch1->neighbor(ch1->index(vh3));
 
+    boost::unordered_map<Edge_uv, typename C3t3::Curve_index> complex_edges;
+    for (Cell_handle c : cells_around_edge)
+    {
+      for (int ii = 0; ii < 4; ++ii)
+      {
+        for (int jj = 0; jj < 4; ++jj)
+        {
+          Edge e(c, ii, jj);
+          if (c3t3.is_in_complex(e))
+          {
+            complex_edges[make_vertex_pair(c->vertex(ii), c->vertex(jj))] = c3t3.curve_index(e);
+            c3t3.remove_from_complex(e);
+          }
+        }
+      }
+    }
+
 //    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch3_vh1->vertex(0)->point(), n_ch3_vh1->vertex(1)->point(), n_ch3_vh1->vertex(2)->point(), n_ch3_vh1->vertex(3)->point()));
 //    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch0_vh3->vertex(0)->point(), n_ch0_vh3->vertex(1)->point(), n_ch0_vh3->vertex(2)->point(), n_ch0_vh3->vertex(3)->point()));
 //    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch2_vh1->vertex(0)->point(), n_ch2_vh1->vertex(1)->point(), n_ch2_vh1->vertex(2)->point(), n_ch2_vh1->vertex(3)->point()));
@@ -1436,6 +1477,9 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
       ch0->set_vertex(ch0->index(vh0), vh1);
       ch2->set_vertex(ch2->index(vh2), vh3);
       ch1->set_vertex(ch1->index(vh0), vh1);
+
+      c3t3.add_to_complex(ch0, ch0->index(vh4), patch);
+      c3t3.add_to_complex(ch3, ch3->index(vh4), patch);
       return NOT_FLIPPABLE;
     }
 
@@ -1449,9 +1493,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     n_ch3_vh1->set_neighbor(n_ch3_vh1->index(ch3), ch0);
 
     //Bottom cells 2-2 flip
-
-
-
     ch2->set_neighbor(ch2->index(vh1), ch1);
     ch2->set_neighbor(ch2->index(vh0), n_ch1_vh3);
     n_ch1_vh3->set_neighbor(n_ch1_vh3->index(ch1), ch2);
@@ -1466,6 +1507,26 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
         cells_around_edge[i]->vertex(j)->set_cell(cells_around_edge[i]);
     }
 
+    c3t3.add_to_complex(ch0, ch0->index(vh4), patch);
+    c3t3.add_to_complex(ch3, ch3->index(vh4), patch);
+
+    for (Cell_handle c : cells_around_edge)
+    {
+      for (int ii = 0; ii < 4; ++ii)
+      {
+        for (int jj = 0; jj < 4; ++jj)
+        {
+          Edge_uv uv = make_vertex_pair(c->vertex(ii), c->vertex(jj));
+          Edge edge_uv(c, ii, jj);
+          if (complex_edges.find(uv) != complex_edges.end())
+          {
+            if(!c3t3.is_in_complex(edge_uv))
+              c3t3.add_to_complex(edge_uv, complex_edges[uv]);
+          }
+        }
+      }
+    }
+
     Sliver_removal_result db = VALID_FLIP;
 
 //    /*
@@ -1498,95 +1559,108 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //
     return db;
   }
-  else
-  {
-    // Top Flip
-    ch3->set_vertex(ch3->index(vh1), vh5);
-    ch2->set_vertex(ch2->index(vh3), vh4);
-    ch0->set_vertex(ch0->index(vh1), vh5);
-    ch1->set_vertex(ch1->index(vh3), vh4);
-    if ( !is_well_oriented(tr, ch0)
-      || !is_well_oriented(tr, ch1)
-      || !is_well_oriented(tr, ch2)
-      || !is_well_oriented(tr, ch3))
-    {
-      ch3->set_vertex(ch3->index(vh5), vh1);
-      ch2->set_vertex(ch2->index(vh4), vh3);
-      ch0->set_vertex(ch0->index(vh5), vh1);
-      ch1->set_vertex(ch1->index(vh4), vh3);
-      return NOT_FLIPPABLE;
-    }
-
-    //Left cells 2-2 flip
-    Cell_handle n_ch3_vh3 = ch3->neighbor(ch3->index(vh3));
-    Cell_handle n_ch2_vh1 = ch2->neighbor(ch2->index(vh1));
-
-    ch3->set_neighbor(ch3->index(vh3), ch2);
-    ch3->set_neighbor(ch3->index(vh4), n_ch2_vh1);
-    n_ch2_vh1->set_neighbor(n_ch2_vh1->index(ch2), ch3);
-
-    ch2->set_neighbor(ch2->index(vh1), ch3);
-    ch2->set_neighbor(ch2->index(vh5), n_ch3_vh3);
-    n_ch3_vh3->set_neighbor(n_ch3_vh3->index(ch3), ch2);
-
-    //Right cells 2-2 flip
-
-    Cell_handle n_ch0_vh3 = ch0->neighbor(ch0->index(vh3));
-    Cell_handle n_ch1_vh1 = ch1->neighbor(ch1->index(vh1));
-
-    ch0->set_neighbor(ch0->index(vh3), ch1);
-    ch0->set_neighbor(ch0->index(vh4), n_ch1_vh1);
-    n_ch1_vh1->set_neighbor(n_ch1_vh1->index(ch1), ch0);
-
-    ch1->set_neighbor(ch1->index(vh1), ch0);
-    ch1->set_neighbor(ch1->index(vh5), n_ch0_vh3);
-    n_ch0_vh3->set_neighbor(n_ch0_vh3->index(ch0), ch1);
-
-    for (unsigned int i = 0; i < cells_around_edge.size(); i++){
-      for (int j = 0; j < 4; j++)
-        cells_around_edge[i]->vertex(j)->set_cell(cells_around_edge[i]);
-    }
-
-    Sliver_removal_result db = VALID_FLIP;
-//    /*
-//    std::cout << "Ch0 "<< ch0->info()<< std::endl;
-//    if(! c3t3_with_info.triangulation().is_valid(ch0, true) )
-//    db = CELL_PBS;
-//    std::cout << "Ch1 "<< ch1->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(ch1, true))
-//    db = CELL_PBS;
-//    std::cout << "Ch2 "<< ch2->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(ch2, true))
-//    db = CELL_PBS;
-//    std::cout << "Ch3 "<< ch3->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(ch3, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch3_vh3 "<< n_ch3_vh3->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch3_vh3, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch2_vh1 "<< n_ch2_vh1->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch2_vh1, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch0_vh3 "<< n_ch0_vh3->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch0_vh3, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch1_vh1 "<< n_ch1_vh1->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch1_vh1, true))
-//    db = CELL_PBS;
-//    */
-    return db;
-  }
+//  else
+//  {
+//    typename C3t3::Surface_patch_index patch = c3t3.surface_patch_index(ch0, ch0->index(vh2));
+//    CGAL_assertion(patch != typename C3t3::Surface_patch_index());
+//
+//    c3t3.remove_from_complex(ch0, ch0->index(vh2));
+//    c3t3.remove_from_complex(ch1, ch1->index(vh2));
+//
+//    // Top Flip
+//    ch3->set_vertex(ch3->index(vh1), vh5);
+//    ch2->set_vertex(ch2->index(vh3), vh4);
+//    ch0->set_vertex(ch0->index(vh1), vh5);
+//    ch1->set_vertex(ch1->index(vh3), vh4);
+//    if ( !is_well_oriented(tr, ch0)
+//      || !is_well_oriented(tr, ch1)
+//      || !is_well_oriented(tr, ch2)
+//      || !is_well_oriented(tr, ch3))
+//    {
+//      ch3->set_vertex(ch3->index(vh5), vh1);
+//      ch2->set_vertex(ch2->index(vh4), vh3);
+//      ch0->set_vertex(ch0->index(vh5), vh1);
+//      ch1->set_vertex(ch1->index(vh4), vh3);
+//
+//      c3t3.add_to_complex(ch0, ch0->index(vh2), patch);
+//      c3t3.add_to_complex(ch1, ch1->index(vh2), patch);
+//
+//      return NOT_FLIPPABLE;
+//    }
+//
+//    //Left cells 2-2 flip
+//    Cell_handle n_ch3_vh3 = ch3->neighbor(ch3->index(vh3));
+//    Cell_handle n_ch2_vh1 = ch2->neighbor(ch2->index(vh1));
+//
+//    ch3->set_neighbor(ch3->index(vh3), ch2);
+//    ch3->set_neighbor(ch3->index(vh4), n_ch2_vh1);
+//    n_ch2_vh1->set_neighbor(n_ch2_vh1->index(ch2), ch3);
+//
+//    ch2->set_neighbor(ch2->index(vh1), ch3);
+//    ch2->set_neighbor(ch2->index(vh5), n_ch3_vh3);
+//    n_ch3_vh3->set_neighbor(n_ch3_vh3->index(ch3), ch2);
+//
+//    //Right cells 2-2 flip
+//    Cell_handle n_ch0_vh3 = ch0->neighbor(ch0->index(vh3));
+//    Cell_handle n_ch1_vh1 = ch1->neighbor(ch1->index(vh1));
+//
+//    ch0->set_neighbor(ch0->index(vh3), ch1);
+//    ch0->set_neighbor(ch0->index(vh4), n_ch1_vh1);
+//    n_ch1_vh1->set_neighbor(n_ch1_vh1->index(ch1), ch0);
+//
+//    ch1->set_neighbor(ch1->index(vh1), ch0);
+//    ch1->set_neighbor(ch1->index(vh5), n_ch0_vh3);
+//    n_ch0_vh3->set_neighbor(n_ch0_vh3->index(ch0), ch1);
+//
+//    for (unsigned int i = 0; i < cells_around_edge.size(); i++){
+//      for (int j = 0; j < 4; j++)
+//        cells_around_edge[i]->vertex(j)->set_cell(cells_around_edge[i]);
+//    }
+//
+//    c3t3.add_to_complex(ch0, ch0->index(vh2), patch);
+//    c3t3.add_to_complex(ch1, ch1->index(vh2), patch);
+//
+//    Sliver_removal_result db = VALID_FLIP;
+////    /*
+////    std::cout << "Ch0 "<< ch0->info()<< std::endl;
+////    if(! c3t3_with_info.triangulation().is_valid(ch0, true) )
+////    db = CELL_PBS;
+////    std::cout << "Ch1 "<< ch1->info()<< std::endl;
+////    if(!c3t3_with_info.triangulation().is_valid(ch1, true))
+////    db = CELL_PBS;
+////    std::cout << "Ch2 "<< ch2->info()<< std::endl;
+////    if(!c3t3_with_info.triangulation().is_valid(ch2, true))
+////    db = CELL_PBS;
+////    std::cout << "Ch3 "<< ch3->info()<< std::endl;
+////    if(!c3t3_with_info.triangulation().is_valid(ch3, true))
+////    db = CELL_PBS;
+////    std::cout << "n_ch3_vh3 "<< n_ch3_vh3->info()<< std::endl;
+////    if(!c3t3_with_info.triangulation().is_valid(n_ch3_vh3, true))
+////    db = CELL_PBS;
+////    std::cout << "n_ch2_vh1 "<< n_ch2_vh1->info()<< std::endl;
+////    if(!c3t3_with_info.triangulation().is_valid(n_ch2_vh1, true))
+////    db = CELL_PBS;
+////    std::cout << "n_ch0_vh3 "<< n_ch0_vh3->info()<< std::endl;
+////    if(!c3t3_with_info.triangulation().is_valid(n_ch0_vh3, true))
+////    db = CELL_PBS;
+////    std::cout << "n_ch1_vh1 "<< n_ch1_vh1->info()<< std::endl;
+////    if(!c3t3_with_info.triangulation().is_valid(n_ch1_vh1, true))
+////    db = CELL_PBS;
+////    */
+//    return db;
+//  }
 
-  return VALID_FLIP;
+  return NOT_FLIPPABLE;
 }
 
-template<typename C3T3, typename SurfaceIndexMapMap, typename Flip_Criterion>
-void flipBoundaryEdges(
+template<typename C3T3, typename SurfaceIndexMapMap, typename Flip_Criterion, typename Visitor>
+std::size_t flipBoundaryEdges(
   C3T3& c3t3,
   std::vector<typename C3T3::Edge>& boundary_edges,
   SurfaceIndexMapMap& boundary_vertices_valences,
   boost::unordered_map<typename C3T3::Vertex_handle, std::vector<typename C3T3::Subdomain_index> >&  vertices_subdomain_indices,
-  Flip_Criterion flip_criterion)
+  Flip_Criterion flip_criterion,
+  Visitor& visitor)
 {
   typedef typename C3T3::Vertex_handle Vertex_handle;
   typedef typename C3T3::Cell_handle   Cell_handle;
@@ -1597,6 +1671,8 @@ void flipBoundaryEdges(
   typedef typename C3T3::Triangulation Tr;
   typedef std::pair<Vertex_handle, Vertex_handle> Edge_vv;
 
+  std::size_t nb = 0;
+
   Tr& tr = c3t3.triangulation();
 
   std::vector<Edge_vv> candidate_edges_for_flip;
@@ -1613,14 +1689,30 @@ void flipBoundaryEdges(
       candidate_edges_for_flip.push_back(std::make_pair(vh0, vh1));
     }
   }
+
+  CGAL_assertion(debug::are_cell_orientations_valid(c3t3.triangulation()));
+
+  std::unordered_map<Vertex_handle,
+    boost::optional<boost::container::small_vector<Cell_handle, 64> > > inc_cells;
+
   for (std::size_t ii = 0; ii < candidate_edges_for_flip.size(); ++ii)
   {
-    const Vertex_handle& vh0 = candidate_edges_for_flip[ii].first;
-    const Vertex_handle& vh1 = candidate_edges_for_flip[ii].second;
+    const std::pair<Vertex_handle, Vertex_handle>& vp = candidate_edges_for_flip[ii];
+    const Vertex_handle& vh0 = vp.first;
+    const Vertex_handle& vh1 = vp.second;
+
+    boost::optional<boost::container::small_vector<Cell_handle, 64>>&
+      o_inc_vh = inc_cells[vp.first];
+    if (o_inc_vh == boost::none || o_inc_vh.get().empty())
+    {
+      boost::container::small_vector<Cell_handle, 64> inc_vec;
+      tr.incident_cells(vp.first, std::back_inserter(inc_vec));
+      o_inc_vh = inc_vec;
+    }
 
     Cell_handle c;
     int i, j;
-    if (!tr.tds().is_edge(vh0, vh1, c, i, j))
+    if (!is_edge_uv(vp.first, vp.second, boost::get(o_inc_vh), c, i, j))
       continue;
 
     std::vector<Facet> boundary_facets;
@@ -1635,13 +1727,14 @@ void flipBoundaryEdges(
       {
         surfi = c3t3.surface_patch_index(*fcirc);
         boundary_facets.push_back(*fcirc);
+        CGAL_assertion(Surface_patch_index() != surfi);
       }
     } while (++fcirc != done);
 
     if (boundary_facets.size() == 2)
     {
-      Facet& f0 = boundary_facets[0];
-      Facet& f1 = boundary_facets[1]; 
+      const Facet& f0 = boundary_facets[0];
+      const Facet& f1 = boundary_facets[1]; 
 
       Vertex_handle vh2;
       Vertex_handle vh3;
@@ -1659,6 +1752,8 @@ void flipBoundaryEdges(
       int t_i0, t_i1;
       if (!tr.is_edge(vh2, vh3, t_ch, t_i0, t_i1))
       {
+        nb_surface_flip_candidates++;
+
         int v0 = boundary_vertices_valences[vh0][surfi];
         int v1 = boundary_vertices_valences[vh1][surfi];
         int v2 = boundary_vertices_valences[vh2][surfi];
@@ -1683,9 +1778,14 @@ void flipBoundaryEdges(
                        + (v3 - m3)*(v3 - m3);
         if (initial_cost > final_cost)
         {
-          Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3, flip_criterion);
+          Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3,
+                                                     inc_cells,
+                                                     flip_criterion,
+                                                     visitor);
           if (db == VALID_FLIP)
           {
+            nb_surface_flip_done++;
+            nb++;
             std::cout << "Flip done" << std::endl;
 
             boundary_vertices_valences[vh0][surfi]--;
@@ -1696,13 +1796,14 @@ void flipBoundaryEdges(
           else if (db == INVALID_CELL || db == INVALID_VERTEX || db == INVALID_ORIENTATION)
           {
             std::cout << "Cell problem" << std::endl;
-            return;
+            return nb;
           }
         }
       }
     }
   }
   CGAL_assertion(tr.tds().is_valid(true));
+  return nb;
 }
 
 template<typename C3T3, typename CellSelector, typename Visitor>
@@ -1743,11 +1844,17 @@ void flip_edges(C3T3& c3t3,
                                                    boundary_vertices_valences,
                                                    vertices_subdomain_indices);
 
+    if(!debug::are_cell_orientations_valid(c3t3.triangulation()))
+      std::cerr << "ERROR in ORIENTATION" << std::endl;
+
   //  if (criterion == VALENCE_BASED)
   //    flipBoundaryEdges(boundary_edges, boundary_vertices_valences, VALENCE_BASED);
   //  else
-    flipBoundaryEdges(c3t3, boundary_edges, boundary_vertices_valences,
-                      vertices_subdomain_indices, MIN_ANGLE_BASED);
+#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+    nb_flips +=
+#endif
+      flipBoundaryEdges(c3t3, boundary_edges, boundary_vertices_valences,
+                        vertices_subdomain_indices, MIN_ANGLE_BASED, visitor);
   }
 
   std::vector<Edge_vv> inside_edges;
@@ -1760,7 +1867,7 @@ void flip_edges(C3T3& c3t3,
   //else
   //{
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-  nb_flips =
+  nb_flips +=
 #endif
     flip_all_edges(inside_edges, c3t3, MIN_ANGLE_BASED, cell_selector, visitor);
   //}
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index b56f8aca389d..10d2825e989d 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -334,6 +334,8 @@ Dihedral_angle_cosine max_cos_dihedral_angle(const Tr& tr,
   if (c->is_cache_valid())
     return Dihedral_angle_cosine(CGAL::sign(c->sliver_value()),
                                  CGAL::abs(c->sliver_value()), 1.);
+  else if(tr.is_infinite(c))
+    return Dihedral_angle_cosine(CGAL::ZERO, 0., 1.);
 
   Dihedral_angle_cosine cos_dh = max_cos_dihedral_angle(tr,
                                                         c->vertex(0),

From 37db44c1d17bfa248a454bffd4c7533cf4328231 Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Tue, 21 Dec 2021 11:43:47 +0100
Subject: [PATCH 1184/1398] fix 4-4 flips on surface with valid c3t3

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 .../internal/flip_edges.h                     | 385 +++++++++++++-----
 1 file changed, 282 insertions(+), 103 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index cd8e4843d522..f175f1fae802 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1427,15 +1427,40 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //  */
 
   typedef std::pair<Vertex_handle, Vertex_handle> Edge_uv;
-  typedef typename C3t3::Edge Edge;
+  typedef typename C3t3::Edge  Edge;
+  typedef typename C3t3::Facet Facet;
+  typedef typename C3t3::Surface_patch_index Surface_patch_index;
 
   if (planar_flip)
   {
-    typename C3t3::Surface_patch_index patch = c3t3.surface_patch_index(ch0, ch0->index(vh4));
-    CGAL_assertion(patch != typename C3t3::Surface_patch_index());
+    Surface_patch_index patch = c3t3.surface_patch_index(ch0, ch0->index(vh4));
+    CGAL_assertion(patch != Surface_patch_index());
+    CGAL_assertion(c3t3.is_in_complex(ch0, ch0->index(vh4)));
     c3t3.remove_from_complex(ch0, ch0->index(vh4));
+    CGAL_assertion(c3t3.is_in_complex(ch3, ch3->index(vh4)));
     c3t3.remove_from_complex(ch3, ch3->index(vh4));
 
+    boost::unordered_map<Facet, Surface_patch_index> opposite_facet_in_complex;
+    for (int i = 0; i < 4; ++i)
+    {
+      Cell_handle chi = cells_around_edge[i];
+      Facet f1(chi, chi->index(vh1));
+      Facet f2(chi, chi->index(vh3));
+
+      if (c3t3.is_in_complex(f1))
+      {
+        Surface_patch_index spi = c3t3.surface_patch_index(f1);
+        opposite_facet_in_complex[c3t3.triangulation().mirror_facet(f1)] = spi;
+        c3t3.remove_from_complex(f1);
+      }
+      if (c3t3.is_in_complex(f2))
+      {
+        Surface_patch_index spi = c3t3.surface_patch_index(f2);
+        opposite_facet_in_complex[c3t3.triangulation().mirror_facet(f2)] = spi;
+        c3t3.remove_from_complex(f2);
+      }
+    }
+
     Cell_handle n_ch3_vh1 = ch3->neighbor(ch3->index(vh1));
     Cell_handle n_ch0_vh3 = ch0->neighbor(ch0->index(vh3));
 
@@ -1480,6 +1505,22 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 
       c3t3.add_to_complex(ch0, ch0->index(vh4), patch);
       c3t3.add_to_complex(ch3, ch3->index(vh4), patch);
+
+      for (int i = 0; i < 4; ++i)
+      {
+        Cell_handle chi = cells_around_edge[i];
+        Facet f1(chi, chi->index(vh1));
+        Facet f2(chi, chi->index(vh3));
+
+        auto it = opposite_facet_in_complex.find(c3t3.triangulation().mirror_facet(f1));
+        if (it != opposite_facet_in_complex.end())
+          c3t3.add_to_complex(f1, it->second);
+
+        it = opposite_facet_in_complex.find(c3t3.triangulation().mirror_facet(f2));
+        if (it != opposite_facet_in_complex.end())
+          c3t3.add_to_complex(f2, it->second);
+      }
+
       return NOT_FLIPPABLE;
     }
 
@@ -1527,6 +1568,21 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
       }
     }
 
+    for (int i = 0; i < 4; ++i)
+    {
+      Cell_handle chi = cells_around_edge[i];
+      Facet f1(chi, chi->index(vh0));
+      Facet f2(chi, chi->index(vh2));
+
+      auto it = opposite_facet_in_complex.find(c3t3.triangulation().mirror_facet(f1));
+      if (it != opposite_facet_in_complex.end())
+        c3t3.add_to_complex(f1, it->second);
+
+      it = opposite_facet_in_complex.find(c3t3.triangulation().mirror_facet(f2));
+      if (it != opposite_facet_in_complex.end())
+        c3t3.add_to_complex(f2, it->second);
+    }
+
     Sliver_removal_result db = VALID_FLIP;
 
 //    /*
@@ -1559,96 +1615,187 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //
     return db;
   }
-//  else
-//  {
-//    typename C3t3::Surface_patch_index patch = c3t3.surface_patch_index(ch0, ch0->index(vh2));
-//    CGAL_assertion(patch != typename C3t3::Surface_patch_index());
-//
-//    c3t3.remove_from_complex(ch0, ch0->index(vh2));
-//    c3t3.remove_from_complex(ch1, ch1->index(vh2));
-//
-//    // Top Flip
-//    ch3->set_vertex(ch3->index(vh1), vh5);
-//    ch2->set_vertex(ch2->index(vh3), vh4);
-//    ch0->set_vertex(ch0->index(vh1), vh5);
-//    ch1->set_vertex(ch1->index(vh3), vh4);
-//    if ( !is_well_oriented(tr, ch0)
-//      || !is_well_oriented(tr, ch1)
-//      || !is_well_oriented(tr, ch2)
-//      || !is_well_oriented(tr, ch3))
-//    {
-//      ch3->set_vertex(ch3->index(vh5), vh1);
-//      ch2->set_vertex(ch2->index(vh4), vh3);
-//      ch0->set_vertex(ch0->index(vh5), vh1);
-//      ch1->set_vertex(ch1->index(vh4), vh3);
-//
-//      c3t3.add_to_complex(ch0, ch0->index(vh2), patch);
-//      c3t3.add_to_complex(ch1, ch1->index(vh2), patch);
-//
-//      return NOT_FLIPPABLE;
-//    }
-//
-//    //Left cells 2-2 flip
-//    Cell_handle n_ch3_vh3 = ch3->neighbor(ch3->index(vh3));
-//    Cell_handle n_ch2_vh1 = ch2->neighbor(ch2->index(vh1));
-//
-//    ch3->set_neighbor(ch3->index(vh3), ch2);
-//    ch3->set_neighbor(ch3->index(vh4), n_ch2_vh1);
-//    n_ch2_vh1->set_neighbor(n_ch2_vh1->index(ch2), ch3);
-//
-//    ch2->set_neighbor(ch2->index(vh1), ch3);
-//    ch2->set_neighbor(ch2->index(vh5), n_ch3_vh3);
-//    n_ch3_vh3->set_neighbor(n_ch3_vh3->index(ch3), ch2);
-//
-//    //Right cells 2-2 flip
-//    Cell_handle n_ch0_vh3 = ch0->neighbor(ch0->index(vh3));
-//    Cell_handle n_ch1_vh1 = ch1->neighbor(ch1->index(vh1));
-//
-//    ch0->set_neighbor(ch0->index(vh3), ch1);
-//    ch0->set_neighbor(ch0->index(vh4), n_ch1_vh1);
-//    n_ch1_vh1->set_neighbor(n_ch1_vh1->index(ch1), ch0);
-//
-//    ch1->set_neighbor(ch1->index(vh1), ch0);
-//    ch1->set_neighbor(ch1->index(vh5), n_ch0_vh3);
-//    n_ch0_vh3->set_neighbor(n_ch0_vh3->index(ch0), ch1);
-//
-//    for (unsigned int i = 0; i < cells_around_edge.size(); i++){
-//      for (int j = 0; j < 4; j++)
-//        cells_around_edge[i]->vertex(j)->set_cell(cells_around_edge[i]);
-//    }
-//
-//    c3t3.add_to_complex(ch0, ch0->index(vh2), patch);
-//    c3t3.add_to_complex(ch1, ch1->index(vh2), patch);
-//
-//    Sliver_removal_result db = VALID_FLIP;
-////    /*
-////    std::cout << "Ch0 "<< ch0->info()<< std::endl;
-////    if(! c3t3_with_info.triangulation().is_valid(ch0, true) )
-////    db = CELL_PBS;
-////    std::cout << "Ch1 "<< ch1->info()<< std::endl;
-////    if(!c3t3_with_info.triangulation().is_valid(ch1, true))
-////    db = CELL_PBS;
-////    std::cout << "Ch2 "<< ch2->info()<< std::endl;
-////    if(!c3t3_with_info.triangulation().is_valid(ch2, true))
-////    db = CELL_PBS;
-////    std::cout << "Ch3 "<< ch3->info()<< std::endl;
-////    if(!c3t3_with_info.triangulation().is_valid(ch3, true))
-////    db = CELL_PBS;
-////    std::cout << "n_ch3_vh3 "<< n_ch3_vh3->info()<< std::endl;
-////    if(!c3t3_with_info.triangulation().is_valid(n_ch3_vh3, true))
-////    db = CELL_PBS;
-////    std::cout << "n_ch2_vh1 "<< n_ch2_vh1->info()<< std::endl;
-////    if(!c3t3_with_info.triangulation().is_valid(n_ch2_vh1, true))
-////    db = CELL_PBS;
-////    std::cout << "n_ch0_vh3 "<< n_ch0_vh3->info()<< std::endl;
-////    if(!c3t3_with_info.triangulation().is_valid(n_ch0_vh3, true))
-////    db = CELL_PBS;
-////    std::cout << "n_ch1_vh1 "<< n_ch1_vh1->info()<< std::endl;
-////    if(!c3t3_with_info.triangulation().is_valid(n_ch1_vh1, true))
-////    db = CELL_PBS;
-////    */
-//    return db;
-//  }
+  else
+  {
+    typename C3t3::Surface_patch_index patch = c3t3.surface_patch_index(ch0, ch0->index(vh2));
+    CGAL_assertion(patch != typename C3t3::Surface_patch_index());
+
+    CGAL_assertion(c3t3.is_in_complex(ch0, ch0->index(vh2)));
+    c3t3.remove_from_complex(ch0, ch0->index(vh2));
+    CGAL_assertion(c3t3.is_in_complex(ch1, ch1->index(vh2)));
+    c3t3.remove_from_complex(ch1, ch1->index(vh2));
+
+    boost::unordered_map<Facet, Surface_patch_index> opposite_facet_in_complex;
+    for (int i = 0; i < 4; ++i)
+    {
+      Cell_handle chi = cells_around_edge[i];
+      Facet f1(chi, chi->index(vh1));
+      Facet f2(chi, chi->index(vh3));
+
+      if (c3t3.is_in_complex(f1))
+      {
+        Surface_patch_index spi = c3t3.surface_patch_index(f1);
+        opposite_facet_in_complex[c3t3.triangulation().mirror_facet(f1)] = spi;
+        c3t3.remove_from_complex(f1);
+      }
+      if (c3t3.is_in_complex(f2))
+      {
+        Surface_patch_index spi = c3t3.surface_patch_index(f2);
+        opposite_facet_in_complex[c3t3.triangulation().mirror_facet(f2)] = spi;
+        c3t3.remove_from_complex(f2);
+      }
+    }
+
+    c3t3.remove_from_complex(ch0, ch0->index(vh2));
+    c3t3.remove_from_complex(ch1, ch1->index(vh2));
+
+    boost::unordered_map<Edge_uv, typename C3t3::Curve_index> complex_edges;
+    for (Cell_handle c : cells_around_edge)
+    {
+      for (int ii = 0; ii < 4; ++ii)
+      {
+        for (int jj = 0; jj < 4; ++jj)
+        {
+          Edge e(c, ii, jj);
+          if (c3t3.is_in_complex(e))
+          {
+            complex_edges[make_vertex_pair(c->vertex(ii), c->vertex(jj))] = c3t3.curve_index(e);
+            c3t3.remove_from_complex(e);
+          }
+        }
+      }
+    }
+
+    // Top Flip
+    ch3->set_vertex(ch3->index(vh1), vh5);
+    ch2->set_vertex(ch2->index(vh3), vh4);
+    ch0->set_vertex(ch0->index(vh1), vh5);
+    ch1->set_vertex(ch1->index(vh3), vh4);
+    if ( !is_well_oriented(tr, ch0)
+      || !is_well_oriented(tr, ch1)
+      || !is_well_oriented(tr, ch2)
+      || !is_well_oriented(tr, ch3))
+    {
+      ch3->set_vertex(ch3->index(vh5), vh1);
+      ch2->set_vertex(ch2->index(vh4), vh3);
+      ch0->set_vertex(ch0->index(vh5), vh1);
+      ch1->set_vertex(ch1->index(vh4), vh3);
+
+      c3t3.add_to_complex(ch0, ch0->index(vh2), patch);
+      c3t3.add_to_complex(ch1, ch1->index(vh2), patch);
+
+      for (int i = 0; i < 4; ++i)
+      {
+        Cell_handle chi = cells_around_edge[i];
+        Facet f1(chi, chi->index(vh1));
+        Facet f2(chi, chi->index(vh3));
+
+        auto it = opposite_facet_in_complex.find(c3t3.triangulation().mirror_facet(f1));
+        if (it != opposite_facet_in_complex.end())
+          c3t3.add_to_complex(f1, it->second);
+
+        it = opposite_facet_in_complex.find(c3t3.triangulation().mirror_facet(f2));
+        if (it != opposite_facet_in_complex.end())
+          c3t3.add_to_complex(f2, it->second);
+      }
+
+      return NOT_FLIPPABLE;
+    }
+
+    //Left cells 2-2 flip
+    Cell_handle n_ch3_vh3 = ch3->neighbor(ch3->index(vh3));
+    Cell_handle n_ch2_vh1 = ch2->neighbor(ch2->index(vh1));
+
+    ch3->set_neighbor(ch3->index(vh3), ch2);
+    ch3->set_neighbor(ch3->index(vh4), n_ch2_vh1);
+    n_ch2_vh1->set_neighbor(n_ch2_vh1->index(ch2), ch3);
+
+    ch2->set_neighbor(ch2->index(vh1), ch3);
+    ch2->set_neighbor(ch2->index(vh5), n_ch3_vh3);
+    n_ch3_vh3->set_neighbor(n_ch3_vh3->index(ch3), ch2);
+
+    //Right cells 2-2 flip
+    Cell_handle n_ch0_vh3 = ch0->neighbor(ch0->index(vh3));
+    Cell_handle n_ch1_vh1 = ch1->neighbor(ch1->index(vh1));
+
+    ch0->set_neighbor(ch0->index(vh3), ch1);
+    ch0->set_neighbor(ch0->index(vh4), n_ch1_vh1);
+    n_ch1_vh1->set_neighbor(n_ch1_vh1->index(ch1), ch0);
+
+    ch1->set_neighbor(ch1->index(vh1), ch0);
+    ch1->set_neighbor(ch1->index(vh5), n_ch0_vh3);
+    n_ch0_vh3->set_neighbor(n_ch0_vh3->index(ch0), ch1);
+
+    for (unsigned int i = 0; i < cells_around_edge.size(); i++){
+      for (int j = 0; j < 4; j++)
+        cells_around_edge[i]->vertex(j)->set_cell(cells_around_edge[i]);
+    }
+
+    c3t3.add_to_complex(ch0, ch0->index(vh2), patch);
+    c3t3.add_to_complex(ch1, ch1->index(vh2), patch);
+
+    for (Cell_handle c : cells_around_edge)
+    {
+      for (int ii = 0; ii < 4; ++ii)
+      {
+        for (int jj = 0; jj < 4; ++jj)
+        {
+          Edge_uv uv = make_vertex_pair(c->vertex(ii), c->vertex(jj));
+          Edge edge_uv(c, ii, jj);
+          if (complex_edges.find(uv) != complex_edges.end())
+          {
+            if (!c3t3.is_in_complex(edge_uv))
+              c3t3.add_to_complex(edge_uv, complex_edges[uv]);
+          }
+        }
+      }
+    }
+
+    for (int i = 0; i < 4; ++i)
+    {
+      Cell_handle chi = cells_around_edge[i];
+      Facet f1(chi, chi->index(vh4));
+      Facet f2(chi, chi->index(vh5));
+
+      auto it = opposite_facet_in_complex.find(c3t3.triangulation().mirror_facet(f1));
+      if (it != opposite_facet_in_complex.end())
+        c3t3.add_to_complex(f1, it->second);
+
+      it = opposite_facet_in_complex.find(c3t3.triangulation().mirror_facet(f2));
+      if (it != opposite_facet_in_complex.end())
+        c3t3.add_to_complex(f2, it->second);
+    }
+
+    Sliver_removal_result db = VALID_FLIP;
+
+//    /*
+//    std::cout << "Ch0 "<< ch0->info()<< std::endl;
+//    if(! c3t3_with_info.triangulation().is_valid(ch0, true) )
+//    db = CELL_PBS;
+//    std::cout << "Ch1 "<< ch1->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(ch1, true))
+//    db = CELL_PBS;
+//    std::cout << "Ch2 "<< ch2->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(ch2, true))
+//    db = CELL_PBS;
+//    std::cout << "Ch3 "<< ch3->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(ch3, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch3_vh3 "<< n_ch3_vh3->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch3_vh3, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch2_vh1 "<< n_ch2_vh1->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch2_vh1, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch0_vh3 "<< n_ch0_vh3->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch0_vh3, true))
+//    db = CELL_PBS;
+//    std::cout << "n_ch1_vh1 "<< n_ch1_vh1->info()<< std::endl;
+//    if(!c3t3_with_info.triangulation().is_valid(n_ch1_vh1, true))
+//    db = CELL_PBS;
+//    */
+    return db;
+  }
 
   return NOT_FLIPPABLE;
 }
@@ -1690,8 +1837,6 @@ std::size_t flipBoundaryEdges(
     }
   }
 
-  CGAL_assertion(debug::are_cell_orientations_valid(c3t3.triangulation()));
-
   std::unordered_map<Vertex_handle,
     boost::optional<boost::container::small_vector<Cell_handle, 64> > > inc_cells;
 
@@ -1701,6 +1846,9 @@ std::size_t flipBoundaryEdges(
     const Vertex_handle& vh0 = vp.first;
     const Vertex_handle& vh1 = vp.second;
 
+    const typename C3T3::Triangulation::Point p0 = vh0->point();
+    const typename C3T3::Triangulation::Point p1 = vh1->point();
+
     boost::optional<boost::container::small_vector<Cell_handle, 64>>&
       o_inc_vh = inc_cells[vp.first];
     if (o_inc_vh == boost::none || o_inc_vh.get().empty())
@@ -1718,6 +1866,8 @@ std::size_t flipBoundaryEdges(
     std::vector<Facet> boundary_facets;
     Surface_patch_index surfi;
 
+    std::ofstream incf("dump_incident_facets.polylines.txt");
+
     Edge edge(c, i, j);
     typename Tr::Facet_circulator fcirc = tr.incident_facets(edge);
     typename Tr::Facet_circulator done(fcirc);
@@ -1728,8 +1878,15 @@ std::size_t flipBoundaryEdges(
         surfi = c3t3.surface_patch_index(*fcirc);
         boundary_facets.push_back(*fcirc);
         CGAL_assertion(Surface_patch_index() != surfi);
+
+        Facet ff = *fcirc;
+        incf << "4 " << ff.first->vertex((ff.second + 1) % 4)->point().point()
+             << " " << ff.first->vertex((ff.second + 2) % 4)->point().point()
+             << " " << ff.first->vertex((ff.second + 3) % 4)->point().point()
+             << " " << ff.first->vertex((ff.second + 4) % 4)->point().point() << std::endl;
       }
     } while (++fcirc != done);
+    incf.close();
 
     if (boundary_facets.size() == 2)
     {
@@ -1778,16 +1935,32 @@ std::size_t flipBoundaryEdges(
                        + (v3 - m3)*(v3 - m3);
         if (initial_cost > final_cost)
         {
+          int nbf = std::distance(c3t3.facets_in_complex_begin(),
+                                  c3t3.facets_in_complex_end());
+
+          CGAL::dump_c3t3(c3t3, "dump_before_flip_");
+
           Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3,
                                                      inc_cells,
                                                      flip_criterion,
                                                      visitor);
           if (db == VALID_FLIP)
           {
+            int nbf_post = std::distance(c3t3.facets_in_complex_begin(),
+                                         c3t3.facets_in_complex_end());
+            CGAL_assertion(nbf == nbf_post);
+
             nb_surface_flip_done++;
             nb++;
             std::cout << "Flip done" << std::endl;
 
+            CGAL::dump_c3t3(c3t3, "dump_after_flip_");
+
+            std::ofstream ofs("dump_edge_flipped.polylines.txt");
+//            ofs << oss_flip.str();
+            ofs << "2 " << p0.point() << " " << p1.point() << std::endl;
+            ofs.close();
+
             boundary_vertices_valences[vh0][surfi]--;
             boundary_vertices_valences[vh1][surfi]--;
             boundary_vertices_valences[vh2][surfi]++;
@@ -1857,15 +2030,21 @@ void flip_edges(C3T3& c3t3,
                         vertices_subdomain_indices, MIN_ANGLE_BASED, visitor);
   }
 
-  std::vector<Edge_vv> inside_edges;
-  get_internal_edges(c3t3,
-                     cell_selector,
-                     std::back_inserter(inside_edges));
+//  std::vector<Edge_vv> inside_edges;
+//  get_internal_edges(c3t3,
+//                     cell_selector,
+//                     std::back_inserter(inside_edges));
+//
+//  //if (criterion == VALENCE_BASED)
+//  //  flip_inside_edges(inside_edges);
+//  //else
+//  //{
+//#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+//  nb_flips +=
+//#endif
+//    flip_all_edges(inside_edges, c3t3, MIN_ANGLE_BASED, visitor);
+//  //}
 
-  //if (criterion == VALENCE_BASED)
-  //  flip_inside_edges(inside_edges);
-  //else
-  //{
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
   nb_flips +=
 #endif

From fd65b6a0cddf6fd852aec3865d72e36a96fe046e Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Tue, 21 Dec 2021 17:10:23 +0100
Subject: [PATCH 1185/1398] check angles before surface-flipping

and add experimental and unused code for n/m flips on surfaces
---
 .../internal/flip_edges.h                     | 99 +++++++++++++++++--
 .../internal/tetrahedral_remeshing_helpers.h  |  4 +
 2 files changed, 93 insertions(+), 10 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index f175f1fae802..f365c7098ff3 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1300,6 +1300,61 @@ void collectBoundaryEdgesAndComputeVerticesValences(
   }
 }
 
+template<typename C3T3, typename IncCellsVector>
+Sliver_removal_result flip_n_to_m_on_surface(typename C3T3::Edge& edge,
+    C3T3& c3t3,
+    typename C3T3::Vertex_handle v0i,//v0 of new edge that will replace edge
+    typename C3T3::Vertex_handle v1i,//v1 of new edge that will replace edge
+    const IncCellsVector& cells_around_edge,
+    Flip_Criterion flip_criterion)
+{
+  typedef typename C3T3::Vertex_handle Vertex_handle;
+  typedef typename C3T3::Cell_handle   Cell_handle;
+  typedef typename C3T3::Triangulation::Geom_traits::Point_3 Point_3;
+
+  typename C3T3::Triangulation& tr = c3t3.triangulation();
+
+  Vertex_handle u = edge.first->vertex(edge.second);
+  Vertex_handle v = edge.first->vertex(edge.third);
+
+  typedef std::pair<int, int> IndInCell;
+  std::map<Cell_handle, IndInCell> indices;
+  for (Cell_handle c : cells_around_edge)
+  {
+    indices[c] = std::make_pair(c->index(u), c->index(v));
+  }
+
+  for (Cell_handle c : cells_around_edge)
+  {
+    int i = indices[c].first;
+    int j = indices[c].second;
+    c->set_vertex(i, v0i);
+    c->set_vertex(j, v1i);
+
+    if (!is_well_oriented(tr, c))
+    {
+      c->set_vertex(j, v0i);
+      c->set_vertex(i, v1i);
+      if (!is_well_oriented(tr, c))
+      {
+        //rollback all changes
+        for (Cell_handle cc : cells_around_edge)
+        {
+          int ii = indices[cc].first;
+          if (cc->vertex(ii) != u)
+          {
+            cc->set_vertex(ii, u);
+            cc->set_vertex(indices[cc].second, v);
+          }
+        }
+        return NOT_FLIPPABLE;
+      }
+    }
+  }
+
+  return VALID_FLIP;
+}
+
 //v0i and v1i are the vertices opposite to `edge`
 //on facets of the surface
 template<typename C3T3, typename IncCellsVectorMap, typename Visitor>
@@ -1339,6 +1394,8 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //        boundary_vertices.push_back(v0i);
 //        boundary_vertices.push_back(v1i);
 //
+//        return flip_n_to_m_on_surface(edge, c3t3, v0i, v1i, cells_around_edge, flip_criterion);
+
 //        return flip_n_to_m(edge, c3t3, boundary_vertices,
 //                           flip_criterion,
 //                           inc_cells,
@@ -1360,6 +1417,11 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
   ch2 = cells_around_edge[2];
   ch3 = cells_around_edge[3];
 
+  Dihedral_angle_cosine curr_max_cosdh = max_cos_dihedral_angle(tr, ch0);
+  for (int i = 1; i < 4; ++i)
+    curr_max_cosdh = (std::max)(curr_max_cosdh,
+                                max_cos_dihedral_angle(tr, cells_around_edge[i]));
+
   Vertex_handle vh0, vh1, vh2, vh3, vh4, vh5;
 
   int ivh4 = ch0->index(ch1);
@@ -1493,10 +1555,20 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     ch0->set_vertex(ch0->index(vh1), vh0);
     ch2->set_vertex(ch2->index(vh3), vh2);
     ch1->set_vertex(ch1->index(vh1), vh0);
-    if ( !is_well_oriented(tr, ch0)
+
+    Sliver_removal_result db = VALID_FLIP;
+    if (!is_well_oriented(tr, ch0)
       || !is_well_oriented(tr, ch1)
       || !is_well_oriented(tr, ch2)
       || !is_well_oriented(tr, ch3))
+      db = NOT_FLIPPABLE;
+    else if (curr_max_cosdh < max_cos_dihedral_angle(tr, ch0)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch1)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch2)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch3))
+      db = NO_BEST_CONFIGURATION;
+
+    if(db == NOT_FLIPPABLE || db == NO_BEST_CONFIGURATION)
     {
       ch3->set_vertex(ch3->index(vh2), vh3);
       ch0->set_vertex(ch0->index(vh0), vh1);
@@ -1521,7 +1593,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
           c3t3.add_to_complex(f2, it->second);
       }
 
-      return NOT_FLIPPABLE;
+      return db;
     }
 
     //Top cells 2-2 flip
@@ -1583,8 +1655,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
         c3t3.add_to_complex(f2, it->second);
     }
 
-    Sliver_removal_result db = VALID_FLIP;
-
 //    /*
 //    std::cout << "Ch0 "<< ch0->info()<< std::endl;
 //    if(! c3t3_with_info.triangulation().is_valid(ch0, true) )
@@ -1671,10 +1741,20 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     ch2->set_vertex(ch2->index(vh3), vh4);
     ch0->set_vertex(ch0->index(vh1), vh5);
     ch1->set_vertex(ch1->index(vh3), vh4);
-    if ( !is_well_oriented(tr, ch0)
+
+    Sliver_removal_result db = VALID_FLIP;
+    if (!is_well_oriented(tr, ch0)
       || !is_well_oriented(tr, ch1)
       || !is_well_oriented(tr, ch2)
       || !is_well_oriented(tr, ch3))
+      db = NOT_FLIPPABLE;
+    else if (curr_max_cosdh < max_cos_dihedral_angle(tr, ch0)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch1)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch2)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch3))
+      db = NO_BEST_CONFIGURATION;
+
+    if (db == NOT_FLIPPABLE || db == NO_BEST_CONFIGURATION)
     {
       ch3->set_vertex(ch3->index(vh5), vh1);
       ch2->set_vertex(ch2->index(vh4), vh3);
@@ -1699,7 +1779,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
           c3t3.add_to_complex(f2, it->second);
       }
 
-      return NOT_FLIPPABLE;
+      return db;
     }
 
     //Left cells 2-2 flip
@@ -1766,7 +1846,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
         c3t3.add_to_complex(f2, it->second);
     }
 
-    Sliver_removal_result db = VALID_FLIP;
+    db = VALID_FLIP;
 
 //    /*
 //    std::cout << "Ch0 "<< ch0->info()<< std::endl;
@@ -1938,7 +2018,7 @@ std::size_t flipBoundaryEdges(
           int nbf = std::distance(c3t3.facets_in_complex_begin(),
                                   c3t3.facets_in_complex_end());
 
-          CGAL::dump_c3t3(c3t3, "dump_before_flip_");
+//          CGAL::dump_c3t3(c3t3, "dump_before_flip_");
 
           Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3,
                                                      inc_cells,
@@ -1954,10 +2034,9 @@ std::size_t flipBoundaryEdges(
             nb++;
             std::cout << "Flip done" << std::endl;
 
-            CGAL::dump_c3t3(c3t3, "dump_after_flip_");
+//            CGAL::dump_c3t3(c3t3, "dump_after_flip_");
 
             std::ofstream ofs("dump_edge_flipped.polylines.txt");
-//            ofs << oss_flip.str();
             ofs << "2 " << p0.point() << " " << p1.point() << std::endl;
             ofs.close();
 
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 10d2825e989d..eeb1df82787d 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -337,6 +337,10 @@ Dihedral_angle_cosine max_cos_dihedral_angle(const Tr& tr,
   else if(tr.is_infinite(c))
     return Dihedral_angle_cosine(CGAL::ZERO, 0., 1.);
 
+  typedef typename Tr::Triangulation_data_structure::Cell::Subdomain_index Subdomain_index;
+  if(c->subdomain_index() == Subdomain_index())
+    return Dihedral_angle_cosine(CGAL::ZERO, 0., 1.);
+  
   Dihedral_angle_cosine cos_dh = max_cos_dihedral_angle(tr,
                                                         c->vertex(0),
                                                         c->vertex(1),

From e4fc54c9732a6a6463d9ca03cafd1946bf75be0d Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Tue, 28 Dec 2021 17:35:24 +0100
Subject: [PATCH 1186/1398] all surface flips succeed

todo : check that dihedral angles do not get worse

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 ...remesh_polyhedral_domain_with_features.cpp | 92 ++++++++++++++-----
 .../internal/flip_edges.h                     | 79 +++++++++++-----
 2 files changed, 123 insertions(+), 48 deletions(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
index 5880052b43c7..ca431766b7e0 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
@@ -1,18 +1,37 @@
+#define CGAL_MESH_3_VERBOSE 1
+#define CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+#define CGAL_DUMP_REMESHING_STEPS
+#define CGAL_TETRAHEDRAL_REMESHING_DEBUG
+#define CGAL_TETRAHEDRAL_REMESHING_NO_EXTRA_ITERATIONS
+
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <CGAL/Mesh_triangulation_3.h>
 #include <CGAL/Mesh_complex_3_in_triangulation_3.h>
 #include <CGAL/Mesh_criteria_3.h>
 
+#include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedral_mesh_domain_with_features_3.h>
-#include <CGAL/make_mesh_3.h>
 
+#include <CGAL/make_mesh_3.h>
 #include <CGAL/tetrahedral_remeshing.h>
 
+#include <CGAL/IO/File_binary_mesh_3.h>
+
+#include <boost/container/flat_set.hpp>
+
+int nb_surface_flip_candidates = 0;
+int nb_surface_flip_done = 0;
+int nb_surface_44_configs = 0;
+int nb_surface_nm_configs = 0;
+std::ostringstream oss_flip("flipped_surface_edges.polylines.txt");
+
+
 // Domain
 typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
-typedef CGAL::Mesh_polyhedron_3<K>::type Polyhedron;
-typedef CGAL::Polyhedral_mesh_domain_with_features_3<K> Mesh_domain;
+typedef CGAL::Surface_mesh<K::Point_3> Polyhedron;
+typedef CGAL::Polyhedral_mesh_domain_with_features_3<K, Polyhedron> Mesh_domain;
+
 
 #ifdef CGAL_CONCURRENT_MESH_3
 typedef CGAL::Parallel_tag Concurrency_tag;
@@ -20,26 +39,32 @@ typedef CGAL::Parallel_tag Concurrency_tag;
 typedef CGAL::Sequential_tag Concurrency_tag;
 #endif
 
-// Triangulation for Meshing
+// Triangulation
 typedef CGAL::Mesh_triangulation_3<Mesh_domain, CGAL::Default, Concurrency_tag>::type Tr;
+
 typedef CGAL::Mesh_complex_3_in_triangulation_3<
   Tr, Mesh_domain::Corner_index, Mesh_domain::Curve_index> C3t3;
 
 // Criteria
 typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
 
-// Triangulation for Remeshing
-typedef CGAL::Triangulation_3<typename Tr::Geom_traits,
-  typename Tr::Triangulation_data_structure> Triangulation_3;
-
 // To avoid verbose function and named parameters call
 using namespace CGAL::parameters;
 
 int main(int argc, char* argv[])
 {
-  const std::string fname = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/fandisk.off");
+  //"data/Shape1/shape1.off" 40. "data/Shape1/mesh_40.binary.cgal" "data/Shape1/remesh_40.binary.cgal"
+  const char* fname = (argc > 1) ? argv[1] : "data/tensileASCII.off";
+  const double target = (argc > 2) ? atof(argv[2]) : 200.;
+  const int nb_iter = (argc > 3) ? atoi(argv[3]) : 1;
+  const char* fname_mesh3 = (argc > 4) ? argv[4] : "data/Tensile/mesh_200.binary.cgal";
+  const char* fname_remesh = (argc > 5) ? argv[5] : "data/Tensile/remesh_200.binary.cgal";
+
   std::ifstream input(fname);
   Polyhedron polyhedron;
+
+  std::string filename(fname);
+  //  if (filename.substr(filename.find_last_of(".")).compare(".off") == 0)
   input >> polyhedron;
   if (input.fail()) {
     std::cerr << "Error: Cannot read file " << fname << std::endl;
@@ -58,24 +83,41 @@ int main(int argc, char* argv[])
   domain.detect_features();
 
   // Mesh criteria
-  Mesh_criteria criteria(edge_size = 0.025,
-    facet_angle = 25, facet_size = 0.05, facet_distance = 0.005,
-    cell_radius_edge_ratio = 3, cell_size = 0.05);
+  double CellSize = 31.3082;
+  int mesh_factor = 50;
+  double size = (CellSize * mesh_factor) / 100;
+  //const double size = 40.;
+  Mesh_criteria criteria(edge_size = size,
+    facet_angle = 25,
+    facet_size = size,
+    cell_radius_edge_ratio = 2,
+    cell_size = size);
 
   // Mesh generation
-  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria);
-
-  Triangulation_3 tr = CGAL::convert_to_triangulation_3(std::move(c3t3));
-  //note we use the move semantic, with std::move(c3t3),
-  //  to avoid a copy of the triangulation by the function
-  //  `CGAL::convert_to_triangulation_3()`
-  //  After the call to this function, c3t3 is an empty and valid C3t3.
-  //It is possible to use :  CGAL::convert_to_triangulation_3(c3t3),
-  //  Then the triangulation is copied and duplicated, and c3t3 remains as is.
-
-  const double target_edge_length = 0.1;//coarsen the mesh
-  CGAL::tetrahedral_isotropic_remeshing(tr, target_edge_length,
-    CGAL::parameters::number_of_iterations(3));
+  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria, no_perturb(), no_exude());
+
+  // Output
+//  std::ofstream os(fname_mesh3, std::ios_base::out | std::ios_base::binary);
+//  CGAL::Mesh_3::save_binary_file(os, c3t3);
+  CGAL::dump_c3t3(c3t3, "out_after_meshing");
+
+  // Remeshing
+  CGAL::tetrahedral_isotropic_remeshing(c3t3, CellSize,
+    CGAL::parameters::number_of_iterations(nb_iter));
+  //    .smooth_constrained_edges(true));
+
+    // Output
+  //  std::ofstream osr(fname_remesh, std::ios_base::out | std::ios_base::binary);
+  //  CGAL::Mesh_3::save_binary_file(osr, c3t3);
+  CGAL::dump_c3t3(c3t3, "out_after_remeshing");
+
+  std::cout << "Meshing and remeshing done." << std::endl;
+
+  std::cout << "Surface flip attempts : " << nb_surface_flip_candidates << std::endl;
+  std::cout << "Surface flip done     : " << nb_surface_flip_done << std::endl;
+  std::cout << "Surface 4/4 flips candidates proportion : "
+    << 100.*nb_surface_44_configs / (double)(nb_surface_nm_configs + nb_surface_44_configs)
+    << " percent" << std::endl;
 
   return EXIT_SUCCESS;
 }
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index f365c7098ff3..1e75032d1848 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -450,12 +450,12 @@ void find_best_flip_to_improve_dh(C3t3& c3t3,
   Cell_circulator cell_circulator = tr.incident_cells(edge);
   Cell_circulator done = cell_circulator;
 
-  boost::container::small_vector<Facet, 60> facets;
   for (std::size_t i = 0; i < opposite_vertices.size(); ++i)
   {
     Vertex_handle vh = opposite_vertices[i];
     bool keep = true;
 
+    boost::container::small_vector<Facet, 60> facets;
     do
     {
       //Store it if it do not have vh
@@ -730,11 +730,20 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
 
   //TODO!!!! Check that the created edges do not exist!!!
 
+  boost::container::small_vector<Facet, 2> facets_in_complex;
+  typename C3t3::Surface_patch_index patch;
+
   Facet_circulator facet_circulator = tr.incident_facets(edge);
   Facet_circulator done_facet_circulator = facet_circulator;
   bool look_for_vh_iterator = true;
   do
   {
+    if (c3t3.is_in_complex(*facet_circulator))
+    {
+      patch = c3t3.surface_patch_index(*facet_circulator);
+      facets_in_complex.push_back(*facet_circulator);
+    }
+
     facet_circulator++;
 
     //Get the ids of the opposite vertices
@@ -743,6 +752,7 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
       if (facet_circulator->first->vertex(indices(facet_circulator->second, i)) == vh)
         look_for_vh_iterator = false;
     }
+
   } while (facet_circulator != done_facet_circulator && look_for_vh_iterator);
 
   if (look_for_vh_iterator) {
@@ -860,9 +870,12 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
   //}
   ///*************************************************************/
 
+  //Surface
+  for (const Facet& f : facets_in_complex)
+    c3t3.remove_from_complex(f);
+
   //Subdomain index?
   typedef typename C3t3::Subdomain_index Subdomain_index;
-  Subdomain_index subdomain = to_remove[0]->subdomain_index();
   bool selected = get(cell_selector, to_remove[0]);
   visitor.before_flip(to_remove[0]);
 
@@ -1034,11 +1047,12 @@ Sliver_removal_result flip_n_to_m(typename C3t3::Edge& edge,
     Cell_circulator circ = c3t3.triangulation().incident_cells(edge);
     Cell_circulator done = circ;
 
-    Dihedral_angle_cosine curr_max_cosdh = max_cos_dihedral_angle(tr, circ++);
-    while (circ != done)
+    Dihedral_angle_cosine curr_max_cosdh(CGAL::POSITIVE, 1., 1.);
+    do
     {
-      curr_max_cosdh = (std::max)(curr_max_cosdh, max_cos_dihedral_angle(tr, circ++));
-    }
+      curr_max_cosdh = (std::max)(curr_max_cosdh, max_cos_dihedral_angle(tr, circ));
+    } while (++circ != done);
+
     if (boundary_vertices.size() == 2)
       find_best_flip_to_improve_dh(c3t3, edge, boundary_vertices[0], boundary_vertices[1],
                                    candidates, curr_max_cosdh);
@@ -1382,30 +1396,34 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     cells_around_edge.push_back(circ);
   } while (++circ != done);
 
+  std::cout << cells_around_edge.size();
+
   if (cells_around_edge.size() != 4)
   {
-    std::cout << "nb cells = " << cells_around_edge.size() << std::endl;
-//    if (cells_around_edge.size() > 4){
+    nb_surface_nm_configs++;
+    if (cells_around_edge.size() > 4){
 //////      if (flip_criterion == VALENCE_BASED){
 //////        return find_best_n_m_flip(edge, vh0_index, vh1_index);
 //////      }
 //////      else {
-//        std::vector<Vertex_handle> boundary_vertices;
-//        boundary_vertices.push_back(v0i);
-//        boundary_vertices.push_back(v1i);
-//
+        std::vector<Vertex_handle> boundary_vertices;
+        boundary_vertices.push_back(v0i);
+        boundary_vertices.push_back(v1i);
+
 //        return flip_n_to_m_on_surface(edge, c3t3, v0i, v1i, cells_around_edge, flip_criterion);
 
-//        return flip_n_to_m(edge, c3t3, boundary_vertices,
-//                           flip_criterion,
-//                           inc_cells,
-//                           visitor);
-////      }
-//    }
-//    else
+        return flip_n_to_m(edge, c3t3, boundary_vertices,
+                           flip_criterion,
+                           inc_cells,
+                           visitor);
+//      }
+    }
+    else
       return NOT_FLIPPABLE;
   }
 
+  nb_surface_44_configs++;
+
   if(inc_cells[edge.first->vertex(edge.second)] != boost::none)
     inc_cells[edge.first->vertex(edge.second)].get().clear();
   if (inc_cells[edge.first->vertex(edge.third)] != boost::none)
@@ -2026,19 +2044,32 @@ std::size_t flipBoundaryEdges(
                                                      visitor);
           if (db == VALID_FLIP)
           {
+            CGAL_assertion(tr.tds().is_edge(vh2, vh3));
+            Cell_handle c;
+            int li, lj, lk;
+            CGAL_assertion_code(bool b =)
+            tr.tds().is_facet(vh2, vh3, vh0, c, li, lj, lk);
+            CGAL_assertion(b);
+            c3t3.add_to_complex(c, (6 - li - lj - lk), surfi);
+
+            CGAL_assertion_code(b = )
+            tr.tds().is_facet(vh2, vh3, vh1, c, li, lj, lk);
+            CGAL_assertion(b);
+            c3t3.add_to_complex(c, (6 - li - lj - lk), surfi);
+
+            std::cout << " done" << std::endl;
             int nbf_post = std::distance(c3t3.facets_in_complex_begin(),
                                          c3t3.facets_in_complex_end());
             CGAL_assertion(nbf == nbf_post);
 
             nb_surface_flip_done++;
             nb++;
-            std::cout << "Flip done" << std::endl;
 
 //            CGAL::dump_c3t3(c3t3, "dump_after_flip_");
 
-            std::ofstream ofs("dump_edge_flipped.polylines.txt");
-            ofs << "2 " << p0.point() << " " << p1.point() << std::endl;
-            ofs.close();
+//            std::ofstream ofs("dump_edge_flipped.polylines.txt");
+//            ofs << "2 " << p0.point() << " " << p1.point() << std::endl;
+//            ofs.close();
 
             boundary_vertices_valences[vh0][surfi]--;
             boundary_vertices_valences[vh1][surfi]--;
@@ -2050,6 +2081,8 @@ std::size_t flipBoundaryEdges(
             std::cout << "Cell problem" << std::endl;
             return nb;
           }
+          else
+            std::cout << " failed" << std::endl;
         }
       }
     }

From 51401bae7cafc051551d49d54216b91a7fa67dde Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Tue, 28 Dec 2021 19:36:20 +0100
Subject: [PATCH 1187/1398] fix surface flips for n/m cells

the angle condition is checked only for in-complex cells
---
 .../Tetrahedral_remeshing/internal/flip_edges.h    | 12 ++++++------
 .../internal/tetrahedral_remeshing_helpers.h       | 14 ++++++++++++++
 2 files changed, 20 insertions(+), 6 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 1e75032d1848..3ae195d6cfb0 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -476,7 +476,7 @@ void find_best_flip_to_improve_dh(C3t3& c3t3,
     Dihedral_angle_cosine max_flip_cos_dh(CGAL::NEGATIVE, 1., 1.);
     for (const Facet& fi : facets)
     {
-      if (!tr.is_infinite(fi.first))
+      if (!tr.is_infinite(fi.first) && c3t3.is_in_complex(fi.first))
       {
         if (is_well_oriented(tr, vh, fi.first->vertex(indices(fi.second, 0)),
                              fi.first->vertex(indices(fi.second, 1)),
@@ -1047,7 +1047,7 @@ Sliver_removal_result flip_n_to_m(typename C3t3::Edge& edge,
     Cell_circulator circ = c3t3.triangulation().incident_cells(edge);
     Cell_circulator done = circ;
 
-    Dihedral_angle_cosine curr_max_cosdh(CGAL::POSITIVE, 1., 1.);
+    Dihedral_angle_cosine curr_max_cosdh = max_cos_dihedral_angle(tr, circ++);
     do
     {
       curr_max_cosdh = (std::max)(curr_max_cosdh, max_cos_dihedral_angle(tr, circ));
@@ -1066,10 +1066,10 @@ Sliver_removal_result flip_n_to_m(typename C3t3::Edge& edge,
       CosAngle_and_vertex curr_cost_vpair = candidates.top();
       candidates.pop();
 
-//      std::cout << "\tcurrent   cos = " << curr_max_cosdh
-//        << "\t angle = " << std::acos(curr_max_cosdh) * 180./CGAL_PI << std::endl;
-//      std::cout << "\tcandidate cos = " << curr_cost_vpair.first
-//        << "\t angle = " << std::acos(curr_cost_vpair.first) * 180./CGAL_PI << std::endl;
+//      std::cout << "\tcurrent   cos = " << curr_max_cosdh.value()
+//        << "\t angle = " << std::acos(curr_max_cosdh.value()) * 180./CGAL_PI << std::endl;
+//      std::cout << "\tcandidate cos = " << curr_cost_vpair.first.value()
+//        << "\t angle = " << std::acos(curr_cost_vpair.first.value()) * 180./CGAL_PI << std::endl;
 //      std::cout << std::endl;
 
       if (curr_max_cosdh <= curr_cost_vpair.first)
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index eeb1df82787d..bbd5a0a5e474 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -201,6 +201,20 @@ struct Dihedral_angle_cosine
     };
   }
 
+  double value() const
+  {
+    switch (m_sgn)
+    {
+    case CGAL::POSITIVE:
+      return CGAL::approximate_sqrt(m_sq_num / m_sq_den);
+    case CGAL::ZERO:
+      return 0.;
+    default:
+      CGAL_assertion(m_sgn == CGAL::NEGATIVE);
+      return -1. * CGAL::approximate_sqrt(m_sq_num / m_sq_den);
+    };
+  }
+
   friend bool operator<(const Dihedral_angle_cosine& l,
                         const Dihedral_angle_cosine& r)
   {

From adf7812bc69093a2a4e3f4b1ad915b85c0ef1c7c Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Tue, 28 Dec 2021 19:39:50 +0100
Subject: [PATCH 1188/1398] comment extra-verbosity

---
 .../CGAL/Tetrahedral_remeshing/internal/flip_edges.h      | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 3ae195d6cfb0..d98658b5f5b3 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1396,7 +1396,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     cells_around_edge.push_back(circ);
   } while (++circ != done);
 
-  std::cout << cells_around_edge.size();
+//  std::cout << cells_around_edge.size();
 
   if (cells_around_edge.size() != 4)
   {
@@ -2057,7 +2057,7 @@ std::size_t flipBoundaryEdges(
             CGAL_assertion(b);
             c3t3.add_to_complex(c, (6 - li - lj - lk), surfi);
 
-            std::cout << " done" << std::endl;
+//            std::cout << " done" << std::endl;
             int nbf_post = std::distance(c3t3.facets_in_complex_begin(),
                                          c3t3.facets_in_complex_end());
             CGAL_assertion(nbf == nbf_post);
@@ -2081,8 +2081,8 @@ std::size_t flipBoundaryEdges(
             std::cout << "Cell problem" << std::endl;
             return nb;
           }
-          else
-            std::cout << " failed" << std::endl;
+//          else
+//            std::cout << " failed" << std::endl;
         }
       }
     }

From d9e0b19b2073c10753135e036695a7bd6f63d4e6 Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Tue, 28 Dec 2021 19:50:59 +0100
Subject: [PATCH 1189/1398] comment debug variables

---
 .../CGAL/Tetrahedral_remeshing/internal/flip_edges.h      | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index d98658b5f5b3..42c9a6540195 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1400,7 +1400,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 
   if (cells_around_edge.size() != 4)
   {
-    nb_surface_nm_configs++;
+//    nb_surface_nm_configs++;
     if (cells_around_edge.size() > 4){
 //////      if (flip_criterion == VALENCE_BASED){
 //////        return find_best_n_m_flip(edge, vh0_index, vh1_index);
@@ -1422,7 +1422,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
       return NOT_FLIPPABLE;
   }
 
-  nb_surface_44_configs++;
+//  nb_surface_44_configs++;
 
   if(inc_cells[edge.first->vertex(edge.second)] != boost::none)
     inc_cells[edge.first->vertex(edge.second)].get().clear();
@@ -2007,7 +2007,7 @@ std::size_t flipBoundaryEdges(
       int t_i0, t_i1;
       if (!tr.is_edge(vh2, vh3, t_ch, t_i0, t_i1))
       {
-        nb_surface_flip_candidates++;
+//        nb_surface_flip_candidates++;
 
         int v0 = boundary_vertices_valences[vh0][surfi];
         int v1 = boundary_vertices_valences[vh1][surfi];
@@ -2062,7 +2062,7 @@ std::size_t flipBoundaryEdges(
                                          c3t3.facets_in_complex_end());
             CGAL_assertion(nbf == nbf_post);
 
-            nb_surface_flip_done++;
+//            nb_surface_flip_done++;
             nb++;
 
 //            CGAL::dump_c3t3(c3t3, "dump_after_flip_");

From 19520600394655e74a036c76914f5e1abc5cab5b Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Tue, 28 Dec 2021 20:26:31 +0100
Subject: [PATCH 1190/1398] wrap debug code in macro

---
 .../include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 42c9a6540195..d79724522ce1 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -2118,7 +2118,6 @@ void flip_edges(C3T3& c3t3,
   typedef boost::unordered_map<Surface_patch_index, unsigned int> Spi_map;
   if (!protect_boundaries)
   {
-    std::cout << "\tBoundary flips" << std::endl;
     //Boundary flip
     std::vector<Edge> boundary_edges;
     boost::unordered_map<Vertex_handle, Spi_map> boundary_vertices_valences;
@@ -2129,8 +2128,10 @@ void flip_edges(C3T3& c3t3,
                                                    boundary_vertices_valences,
                                                    vertices_subdomain_indices);
 
-    if(!debug::are_cell_orientations_valid(c3t3.triangulation()))
+#ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
+   if(!debug::are_cell_orientations_valid(c3t3.triangulation()))
       std::cerr << "ERROR in ORIENTATION" << std::endl;
+#endif
 
   //  if (criterion == VALENCE_BASED)
   //    flipBoundaryEdges(boundary_edges, boundary_vertices_valences, VALENCE_BASED);

From 390f95cb1390f901a5e7c8a4706371b8a7eaef14 Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Tue, 4 Jan 2022 09:52:23 +0100
Subject: [PATCH 1191/1398] wip improve collapse

---
 ..._and_remesh_polyhedral_domain_with_features.cpp | 12 ++++++++++--
 .../internal/collapse_short_edges.h                | 14 ++++++++++++++
 2 files changed, 24 insertions(+), 2 deletions(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
index ca431766b7e0..76dae0ea9d69 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
@@ -3,6 +3,7 @@
 #define CGAL_DUMP_REMESHING_STEPS
 #define CGAL_TETRAHEDRAL_REMESHING_DEBUG
 #define CGAL_TETRAHEDRAL_REMESHING_NO_EXTRA_ITERATIONS
+//#define PROTECT_ANGLES_FROM_COLLAPSE
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
@@ -24,6 +25,9 @@ int nb_surface_flip_candidates = 0;
 int nb_surface_flip_done = 0;
 int nb_surface_44_configs = 0;
 int nb_surface_nm_configs = 0;
+int nb_surface_44_flips_done = 0;
+int nb_surface_nm_flips_done = 0;
+
 std::ostringstream oss_flip("flipped_surface_edges.polylines.txt");
 
 
@@ -56,7 +60,7 @@ int main(int argc, char* argv[])
   //"data/Shape1/shape1.off" 40. "data/Shape1/mesh_40.binary.cgal" "data/Shape1/remesh_40.binary.cgal"
   const char* fname = (argc > 1) ? argv[1] : "data/tensileASCII.off";
   const double target = (argc > 2) ? atof(argv[2]) : 200.;
-  const int nb_iter = (argc > 3) ? atoi(argv[3]) : 1;
+  const int nb_iter = (argc > 3) ? atoi(argv[3]) : 10;
   const char* fname_mesh3 = (argc > 4) ? argv[4] : "data/Tensile/mesh_200.binary.cgal";
   const char* fname_remesh = (argc > 5) ? argv[5] : "data/Tensile/remesh_200.binary.cgal";
 
@@ -102,7 +106,7 @@ int main(int argc, char* argv[])
   CGAL::dump_c3t3(c3t3, "out_after_meshing");
 
   // Remeshing
-  CGAL::tetrahedral_isotropic_remeshing(c3t3, CellSize,
+  CGAL::tetrahedral_isotropic_remeshing(c3t3, CellSize * 5.,
     CGAL::parameters::number_of_iterations(nb_iter));
   //    .smooth_constrained_edges(true));
 
@@ -119,5 +123,9 @@ int main(int argc, char* argv[])
     << 100.*nb_surface_44_configs / (double)(nb_surface_nm_configs + nb_surface_44_configs)
     << " percent" << std::endl;
 
+  std::cout << "nb surface flips 4/4 done = " << nb_surface_44_flips_done << std::endl;
+  std::cout << "nb surface flips n/m done = " << nb_surface_nm_flips_done << std::endl;
+
+
   return EXIT_SUCCESS;
 }
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
index d2ababd2779e..f5fdb880026a 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
@@ -44,6 +44,7 @@ enum Edge_type     { FEATURE, BOUNDARY, INSIDE, MIXTE,
 enum Collapse_type { TO_MIDPOINT, TO_V0, TO_V1, IMPOSSIBLE };
 enum Result_type   { VALID,
                      V_PROBLEM, C_PROBLEM, E_PROBLEM,
+                     ANGLE_PROBLEM,
                      TOPOLOGICAL_PROBLEM, ORIENTATION_PROBLEM, SHARED_NEIGHBOR_PROBLEM };
 
 template<typename C3t3>
@@ -214,6 +215,15 @@ class CollapseTriangulation
 
       } while (++circ != done);
 
+#ifdef PROTECT_ANGLES_FROM_COLLAPSE
+      Dihedral_angle_cosine curr_max_cos
+        = max_cos_dihedral_angle(triangulation, cells_to_remove[0]);
+      for (std::size_t i = 1; i < cells_to_remove.size(); ++i)
+      {
+        curr_max_cos = (std::max)(curr_max_cos,
+          max_cos_dihedral_angle(triangulation, cells_to_remove[i]));
+      }
+#endif
 
       vh0->set_point(Point_3(v0_new_pos.x(), v0_new_pos.y(), v0_new_pos.z()));
       vh1->set_point(Point_3(v0_new_pos.x(), v0_new_pos.y(), v0_new_pos.z()));
@@ -269,6 +279,10 @@ class CollapseTriangulation
           return ORIENTATION_PROBLEM;
         if (!triangulation.tds().is_valid(cit, true))
           return C_PROBLEM;
+#ifdef PROTECT_ANGLES_FROM_COLLAPSE
+        if (curr_max_cos < max_cos_dihedral_angle(triangulation, cit))
+          return ANGLE_PROBLEM;
+#endif
       }
 
       for (Vertex_handle vit : triangulation.finite_vertex_handles())

From 51c2b80330e776c958cd3e304e1962be7b1fc2c0 Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Fri, 7 Jan 2022 10:22:09 +0100
Subject: [PATCH 1192/1398] remove trailing whitespaces

---
 .../include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h    | 2 +-
 .../internal/tetrahedral_remeshing_helpers.h                    | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index d79724522ce1..c3c42cb4c57a 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1989,7 +1989,7 @@ std::size_t flipBoundaryEdges(
     if (boundary_facets.size() == 2)
     {
       const Facet& f0 = boundary_facets[0];
-      const Facet& f1 = boundary_facets[1]; 
+      const Facet& f1 = boundary_facets[1];
 
       Vertex_handle vh2;
       Vertex_handle vh3;
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index bbd5a0a5e474..2410cbbf1b80 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -354,7 +354,7 @@ Dihedral_angle_cosine max_cos_dihedral_angle(const Tr& tr,
   typedef typename Tr::Triangulation_data_structure::Cell::Subdomain_index Subdomain_index;
   if(c->subdomain_index() == Subdomain_index())
     return Dihedral_angle_cosine(CGAL::ZERO, 0., 1.);
-  
+
   Dihedral_angle_cosine cos_dh = max_cos_dihedral_angle(tr,
                                                         c->vertex(0),
                                                         c->vertex(1),

From e5ebc849f5a766f7a90d13c23aaa4b36fcd7a613 Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Fri, 7 Jan 2022 11:21:32 +0100
Subject: [PATCH 1193/1398] fix case

---
 .../internal/flip_edges.h                     | 22 +++++++++----------
 1 file changed, 11 insertions(+), 11 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index c3c42cb4c57a..90ce76590586 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1507,9 +1507,9 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //  */
 
   typedef std::pair<Vertex_handle, Vertex_handle> Edge_uv;
-  typedef typename C3t3::Edge  Edge;
-  typedef typename C3t3::Facet Facet;
-  typedef typename C3t3::Surface_patch_index Surface_patch_index;
+  typedef typename C3T3::Edge  Edge;
+  typedef typename C3T3::Facet Facet;
+  typedef typename C3T3::Surface_patch_index Surface_patch_index;
 
   if (planar_flip)
   {
@@ -1547,7 +1547,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     Cell_handle n_ch2_vh1 = ch2->neighbor(ch2->index(vh1));
     Cell_handle n_ch1_vh3 = ch1->neighbor(ch1->index(vh3));
 
-    boost::unordered_map<Edge_uv, typename C3t3::Curve_index> complex_edges;
+    boost::unordered_map<Edge_uv, typename C3T3::Curve_index> complex_edges;
     for (Cell_handle c : cells_around_edge)
     {
       for (int ii = 0; ii < 4; ++ii)
@@ -1705,8 +1705,8 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
   }
   else
   {
-    typename C3t3::Surface_patch_index patch = c3t3.surface_patch_index(ch0, ch0->index(vh2));
-    CGAL_assertion(patch != typename C3t3::Surface_patch_index());
+    typename C3T3::Surface_patch_index patch = c3t3.surface_patch_index(ch0, ch0->index(vh2));
+    CGAL_assertion(patch != typename C3T3::Surface_patch_index());
 
     CGAL_assertion(c3t3.is_in_complex(ch0, ch0->index(vh2)));
     c3t3.remove_from_complex(ch0, ch0->index(vh2));
@@ -1737,7 +1737,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     c3t3.remove_from_complex(ch0, ch0->index(vh2));
     c3t3.remove_from_complex(ch1, ch1->index(vh2));
 
-    boost::unordered_map<Edge_uv, typename C3t3::Curve_index> complex_edges;
+    boost::unordered_map<Edge_uv, typename C3T3::Curve_index> complex_edges;
     for (Cell_handle c : cells_around_edge)
     {
       for (int ii = 0; ii < 4; ++ii)
@@ -1978,10 +1978,10 @@ std::size_t flipBoundaryEdges(
         CGAL_assertion(Surface_patch_index() != surfi);
 
         Facet ff = *fcirc;
-        incf << "4 " << ff.first->vertex((ff.second + 1) % 4)->point().point()
-             << " " << ff.first->vertex((ff.second + 2) % 4)->point().point()
-             << " " << ff.first->vertex((ff.second + 3) % 4)->point().point()
-             << " " << ff.first->vertex((ff.second + 4) % 4)->point().point() << std::endl;
+        incf << "4 " << ff.first->vertex((ff.second + 1) % 4)->point()
+             << " " << ff.first->vertex((ff.second + 2) % 4)->point()
+             << " " << ff.first->vertex((ff.second + 3) % 4)->point()
+             << " " << ff.first->vertex((ff.second + 4) % 4)->point() << std::endl;
       }
     } while (++fcirc != done);
     incf.close();

From 4bbdabce208654ff001935411f9f0e9b1d27ca93 Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Sun, 9 Jan 2022 23:07:25 +0100
Subject: [PATCH 1194/1398] use set and not vector to count incident subdomains

---
 .../internal/flip_edges.h                     | 41 ++++++-------------
 1 file changed, 13 insertions(+), 28 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 90ce76590586..a08d25d13571 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1245,7 +1245,7 @@ void collectBoundaryEdgesAndComputeVerticesValences(
   boost::unordered_map<typename C3T3::Vertex_handle,
                        boost::unordered_map<typename C3T3::Surface_patch_index, unsigned int> >&
       boundary_vertices_valences,
-  boost::unordered_map<typename C3T3::Vertex_handle, std::vector<typename C3T3::Subdomain_index> >&
+  boost::unordered_map<typename C3T3::Vertex_handle, std::unordered_set<typename C3T3::Subdomain_index> >&
       vertices_subdomain_indices)
 {
   typedef typename C3T3::Subdomain_index     Subdomain_index;
@@ -1276,9 +1276,11 @@ void collectBoundaryEdgesAndComputeVerticesValences(
     const Vertex_handle v1 = e.first->vertex(e.third);
 
     if (vertices_subdomain_indices.find(v0) == vertices_subdomain_indices.end())
-      incident_subdomains(v0, c3t3, std::back_inserter(vertices_subdomain_indices[v0]));
+      incident_subdomains(v0, c3t3,
+        std::inserter(vertices_subdomain_indices[v0], vertices_subdomain_indices[v0].end()));
     if (vertices_subdomain_indices.find(v1) == vertices_subdomain_indices.end())
-      incident_subdomains(v1, c3t3, std::back_inserter(vertices_subdomain_indices[v1]));
+      incident_subdomains(v1, c3t3,
+        std::inserter(vertices_subdomain_indices[v1], vertices_subdomain_indices[v1].end()));
 
     //In case of feature edge
     if (vertices_subdomain_indices[v0].size() > 2
@@ -1903,7 +1905,8 @@ std::size_t flipBoundaryEdges(
   C3T3& c3t3,
   std::vector<typename C3T3::Edge>& boundary_edges,
   SurfaceIndexMapMap& boundary_vertices_valences,
-  boost::unordered_map<typename C3T3::Vertex_handle, std::vector<typename C3T3::Subdomain_index> >&  vertices_subdomain_indices,
+  boost::unordered_map<typename C3T3::Vertex_handle,
+                       std::unordered_set<typename C3T3::Subdomain_index> >&  vertices_subdomain_indices,
   Flip_Criterion flip_criterion,
   Visitor& visitor)
 {
@@ -2065,12 +2068,6 @@ std::size_t flipBoundaryEdges(
 //            nb_surface_flip_done++;
             nb++;
 
-//            CGAL::dump_c3t3(c3t3, "dump_after_flip_");
-
-//            std::ofstream ofs("dump_edge_flipped.polylines.txt");
-//            ofs << "2 " << p0.point() << " " << p1.point() << std::endl;
-//            ofs.close();
-
             boundary_vertices_valences[vh0][surfi]--;
             boundary_vertices_valences[vh1][surfi]--;
             boundary_vertices_valences[vh2][surfi]++;
@@ -2086,6 +2083,8 @@ std::size_t flipBoundaryEdges(
         }
       }
     }
+    else
+      CGAL_assertion(false);
   }
   CGAL_assertion(tr.tds().is_valid(true));
   return nb;
@@ -2114,14 +2113,15 @@ void flip_edges(C3T3& c3t3,
 
   //compute vertices normals map?
 
-  typedef typename C3T3::Surface_patch_index Surface_patch_index;
-  typedef boost::unordered_map<Surface_patch_index, unsigned int> Spi_map;
   if (!protect_boundaries)
   {
+    typedef typename C3T3::Surface_patch_index Surface_patch_index;
+    typedef boost::unordered_map<Surface_patch_index, unsigned int> Spi_map;
+
     //Boundary flip
     std::vector<Edge> boundary_edges;
     boost::unordered_map<Vertex_handle, Spi_map> boundary_vertices_valences;
-    boost::unordered_map<Vertex_handle, std::vector<Subdomain_index> > vertices_subdomain_indices;
+    boost::unordered_map<Vertex_handle, std::unordered_set<Subdomain_index> > vertices_subdomain_indices;
     collectBoundaryEdgesAndComputeVerticesValences(c3t3,
                                                    cell_selector,
                                                    boundary_edges,
@@ -2143,21 +2143,6 @@ void flip_edges(C3T3& c3t3,
                         vertices_subdomain_indices, MIN_ANGLE_BASED, visitor);
   }
 
-//  std::vector<Edge_vv> inside_edges;
-//  get_internal_edges(c3t3,
-//                     cell_selector,
-//                     std::back_inserter(inside_edges));
-//
-//  //if (criterion == VALENCE_BASED)
-//  //  flip_inside_edges(inside_edges);
-//  //else
-//  //{
-//#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-//  nb_flips +=
-//#endif
-//    flip_all_edges(inside_edges, c3t3, MIN_ANGLE_BASED, visitor);
-//  //}
-
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
   nb_flips +=
 #endif

From 6ec474f5e285318592e73b620dba6a7b66f5c4eb Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Sun, 9 Jan 2022 23:09:58 +0100
Subject: [PATCH 1195/1398] filling the surface valence container fixed

it was not counting surface patches properly for vertices
incident to 2 patches, when the vertex is on a complex edge
---
 .../internal/flip_edges.h                     | 36 +++++++++++--------
 1 file changed, 21 insertions(+), 15 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index a08d25d13571..f386cff67971 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1300,18 +1300,23 @@ void collectBoundaryEdgesAndComputeVerticesValences(
     }
     else if (vertices_subdomain_indices[v0].size() == 2)
     {
-      Surface_patch_index surfi_0 = surface_patch_index(v0, c3t3);
-
-      boundary_vertices_valences[v0][surfi_0]++;
-      boundary_vertices_valences[v1][surfi_0]++;
-
-    }
-    else if (vertices_subdomain_indices[v1].size() == 2)
-    {
-      Surface_patch_index surfi_1 = surface_patch_index(v1, c3t3);
+      Facet_circulator facet_circulator = tr.incident_facets(e);
+      Facet_circulator done(facet_circulator);
+      Surface_patch_index first_patch = Surface_patch_index();
+      do
+      {
+        if (c3t3.is_in_complex(*facet_circulator))
+        {
+          Surface_patch_index surfi = c3t3.surface_patch_index(*facet_circulator);
+          if (first_patch == Surface_patch_index())
+            first_patch = surfi;
+          else if (first_patch == surfi)
+            continue;
 
-      boundary_vertices_valences[v0][surfi_1]++;
-      boundary_vertices_valences[v1][surfi_1]++;
+          boundary_vertices_valences[v0][surfi]++;
+          boundary_vertices_valences[v1][surfi]++;
+        }
+      } while (++facet_circulator != done);
     }
   }
 }
@@ -2016,15 +2021,16 @@ std::size_t flipBoundaryEdges(
         int v1 = boundary_vertices_valences[vh1][surfi];
         int v2 = boundary_vertices_valences[vh2][surfi];
         int v3 = boundary_vertices_valences[vh3][surfi];
-        int m0 = (vertices_subdomain_indices[vh0].size() >2 ? 4 : 6);
-        int m1 = (vertices_subdomain_indices[vh1].size() >2 ? 4 : 6);
-        int m2 = (vertices_subdomain_indices[vh2].size() >2 ? 4 : 6);
-        int m3 = (vertices_subdomain_indices[vh3].size() >2 ? 4 : 6);
+        int m0 = (boundary_vertices_valences[vh0].size() > 1 ? 4 : 6);
+        int m1 = (boundary_vertices_valences[vh1].size() > 1 ? 4 : 6);
+        int m2 = (boundary_vertices_valences[vh2].size() > 1 ? 4 : 6);
+        int m3 = (boundary_vertices_valences[vh3].size() > 1 ? 4 : 6);
 
         int initial_cost = (v0 - m0)*(v0 - m0)
                          + (v1 - m1)*(v1 - m1)
                          + (v2 - m2)*(v2 - m2)
                          + (v3 - m3)*(v3 - m3);
+
         v0--;
         v1--;
         v2++;

From ff1b3e0a959380d51717fd32915419613a302566 Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Sun, 9 Jan 2022 23:11:06 +0100
Subject: [PATCH 1196/1398] re-introduce flips inside volume

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 .../Tetrahedral_remeshing/internal/flip_edges.h   | 15 ++++++++++++++-
 1 file changed, 14 insertions(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index f386cff67971..9cb4232667f9 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -2117,7 +2117,20 @@ void flip_edges(C3T3& c3t3,
 
   //const Flip_Criterion criterion = VALENCE_MIN_DH_BASED;
 
-  //compute vertices normals map?
+  std::vector<Edge_vv> inside_edges;
+  get_internal_edges(c3t3,
+                     cell_selector,
+                     std::back_inserter(inside_edges));
+
+  //if (criterion == VALENCE_BASED)
+  //  flip_inside_edges(inside_edges);
+  //else
+  //{
+#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+  nb_flips +=
+#endif
+    flip_all_edges(inside_edges, c3t3, MIN_ANGLE_BASED, visitor);
+  //}
 
   if (!protect_boundaries)
   {

From cddd344d11c5fc8e58f1aa91522f4e9b844fc6a1 Mon Sep 17 00:00:00 2001
From: Jane Tournois <jane.tournois@gmail.com>
Date: Sun, 9 Jan 2022 23:16:12 +0100
Subject: [PATCH 1197/1398] add assertions

---
 .../CGAL/Tetrahedral_remeshing/internal/flip_edges.h      | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 9cb4232667f9..64c355e638e5 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -2011,6 +2011,14 @@ std::size_t flipBoundaryEdges(
           vh3 = v3;
       }
 
+      int li, lj, lk;
+      Cell_handle c;
+      CGAL_assertion(tr.is_facet(vh0, vh1, vh2, c, li, lj, lk));
+      CGAL_assertion(c3t3.is_in_complex(c, (6 - li - lj - lk)));
+
+      CGAL_assertion(tr.is_facet(vh0, vh1, vh3, c, li, lj, lk));
+      CGAL_assertion(c3t3.is_in_complex(c, (6 - li - lj - lk)));
+
       Cell_handle t_ch;
       int t_i0, t_i1;
       if (!tr.is_edge(vh2, vh3, t_ch, t_i0, t_i1))

From 71c0a4815416b1f24182da8d7630a2f244acae76 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 21 Dec 2023 10:34:56 +0100
Subject: [PATCH 1198/1398] fix compilation after updating branch

---
 .../internal/flip_edges.h                     | 71 +++++++++++--------
 1 file changed, 42 insertions(+), 29 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 64c355e638e5..65d09725ea4e 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -82,13 +82,13 @@ void update_c3t3_facets(C3t3& c3t3,
   }
 }
 
-template<typename C3t3, typename IncCellsVectorMap, typename Cell_selector>
+template<typename C3t3, typename IncCellsVectorMap, typename CellSelector>
 Sliver_removal_result flip_3_to_2(typename C3t3::Edge& edge,
                                   C3t3& c3t3,
                                   const std::vector<typename C3t3::Vertex_handle>& vertices_around_edge,
                                   const Flip_Criterion& criterion,
                                   IncCellsVectorMap& inc_cells,
-                                  Cell_selector& cell_selector)
+                                  CellSelector& cell_selector)
 {
   typedef typename C3t3::Triangulation Tr;
   typedef typename C3t3::Facet         Facet;
@@ -701,13 +701,13 @@ void find_best_flip_to_improve_dh(C3t3& c3t3,
 
 template<typename C3t3,
          typename IncCellsVectorMap,
-         typename Cell_selector,
+         typename CellSelector,
          typename Visitor>
 Sliver_removal_result flip_n_to_m(C3t3& c3t3,
                                   typename C3t3::Edge& edge,
                                   typename C3t3::Vertex_handle vh,
                                   IncCellsVectorMap& inc_cells,
-                                  Cell_selector& cell_selector,
+                                  CellSelector& cell_selector,
                                   Visitor& visitor,
                                   bool check_validity = false)
 {
@@ -874,11 +874,17 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
   for (const Facet& f : facets_in_complex)
     c3t3.remove_from_complex(f);
 
-  //Subdomain index?
+  //Subdomain index
   typedef typename C3t3::Subdomain_index Subdomain_index;
+  const Subdomain_index subdomain = to_remove[0]->subdomain_index();
   bool selected = get(cell_selector, to_remove[0]);
   visitor.before_flip(to_remove[0]);
 
+#ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
+  for (auto ci : to_remove)
+    CGAL_assertion(subdomain == ci->subdomain_index());
+#endif
+
   std::vector<Cell_handle> cells_to_update;
 
   //Create new cells
@@ -1086,12 +1092,12 @@ Sliver_removal_result flip_n_to_m(typename C3t3::Edge& edge,
   return result;
 }
 
-template<typename C3t3, typename IncCellsVectorMap, typename Cell_selector, typename Visitor>
+template<typename C3t3, typename IncCellsVectorMap, typename CellSelector, typename Visitor>
 Sliver_removal_result find_best_flip(typename C3t3::Edge& edge,
                                      C3t3& c3t3,
                                      const Flip_Criterion& criterion,
                                      IncCellsVectorMap& inc_cells,
-                                     Cell_selector& cell_selector,
+                                     CellSelector& cell_selector,
                                      Visitor& visitor)
 {
   typedef typename C3t3::Triangulation        Tr;
@@ -1175,11 +1181,11 @@ Sliver_removal_result find_best_flip(typename C3t3::Edge& edge,
 }
 
 
-template<typename VertexPair, typename C3t3, typename Cell_selector, typename Visitor>
+template<typename VertexPair, typename C3t3, typename CellSelector, typename Visitor>
 std::size_t flip_all_edges(const std::vector<VertexPair>& edges,
                            C3t3& c3t3,
                            const Flip_Criterion& criterion,
-                           Cell_selector& cell_selector,
+                           CellSelector& cell_selector,
                            Visitor& visitor)
 {
   typedef typename C3t3::Triangulation Tr;
@@ -1378,13 +1384,15 @@ Sliver_removal_result flip_n_to_m_on_surface(typename C3T3::Edge& edge,
 
 //v0i and v1i are the vertices opposite to `edge`
 //on facets of the surface
-template<typename C3T3, typename IncCellsVectorMap, typename Visitor>
+template<typename C3T3, typename IncCellsVectorMap,
+         typename CellSelector, typename Visitor>
 Sliver_removal_result flip_on_surface(C3T3& c3t3,
                                       typename C3T3::Edge& edge,
                                       typename C3T3::Vertex_handle v0i,
                                       typename C3T3::Vertex_handle v1i,
                                       IncCellsVectorMap& inc_cells,
                                       Flip_Criterion flip_criterion,
+                                      CellSelector& cell_selector,
                                       Visitor& visitor)
 {
   typedef typename C3T3::Triangulation Tr;
@@ -1422,6 +1430,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
         return flip_n_to_m(edge, c3t3, boundary_vertices,
                            flip_criterion,
                            inc_cells,
+                           cell_selector,
                            visitor);
 //      }
     }
@@ -1431,10 +1440,10 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 
 //  nb_surface_44_configs++;
 
-  if(inc_cells[edge.first->vertex(edge.second)] != boost::none)
-    inc_cells[edge.first->vertex(edge.second)].get().clear();
-  if (inc_cells[edge.first->vertex(edge.third)] != boost::none)
-    inc_cells[edge.first->vertex(edge.third)].get().clear();
+  if(inc_cells[edge.first->vertex(edge.second)] != std::nullopt)
+    inc_cells[edge.first->vertex(edge.second)].value().clear();
+  if (inc_cells[edge.first->vertex(edge.third)] != std::nullopt)
+    inc_cells[edge.first->vertex(edge.third)].value().clear();
 
   Cell_handle ch0, ch1, ch2, ch3;
   ch0 = cells_around_edge[0];
@@ -1905,7 +1914,8 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
   return NOT_FLIPPABLE;
 }
 
-template<typename C3T3, typename SurfaceIndexMapMap, typename Flip_Criterion, typename Visitor>
+template<typename C3T3, typename SurfaceIndexMapMap, typename Flip_Criterion,
+         typename CellSelector, typename Visitor>
 std::size_t flipBoundaryEdges(
   C3T3& c3t3,
   std::vector<typename C3T3::Edge>& boundary_edges,
@@ -1913,6 +1923,7 @@ std::size_t flipBoundaryEdges(
   boost::unordered_map<typename C3T3::Vertex_handle,
                        std::unordered_set<typename C3T3::Subdomain_index> >&  vertices_subdomain_indices,
   Flip_Criterion flip_criterion,
+  CellSelector& cell_selector,
   Visitor& visitor)
 {
   typedef typename C3T3::Vertex_handle Vertex_handle;
@@ -1944,7 +1955,7 @@ std::size_t flipBoundaryEdges(
   }
 
   std::unordered_map<Vertex_handle,
-    boost::optional<boost::container::small_vector<Cell_handle, 64> > > inc_cells;
+    std::optional<boost::container::small_vector<Cell_handle, 64> > > inc_cells;
 
   for (std::size_t ii = 0; ii < candidate_edges_for_flip.size(); ++ii)
   {
@@ -1955,9 +1966,9 @@ std::size_t flipBoundaryEdges(
     const typename C3T3::Triangulation::Point p0 = vh0->point();
     const typename C3T3::Triangulation::Point p1 = vh1->point();
 
-    boost::optional<boost::container::small_vector<Cell_handle, 64>>&
+    std::optional<boost::container::small_vector<Cell_handle, 64>>&
       o_inc_vh = inc_cells[vp.first];
-    if (o_inc_vh == boost::none || o_inc_vh.get().empty())
+    if (o_inc_vh == std::nullopt || o_inc_vh.value().empty())
     {
       boost::container::small_vector<Cell_handle, 64> inc_vec;
       tr.incident_cells(vp.first, std::back_inserter(inc_vec));
@@ -1966,7 +1977,7 @@ std::size_t flipBoundaryEdges(
 
     Cell_handle c;
     int i, j;
-    if (!is_edge_uv(vp.first, vp.second, boost::get(o_inc_vh), c, i, j))
+    if (!is_edge_uv(vp.first, vp.second, o_inc_vh.value(), c, i, j))
       continue;
 
     std::vector<Facet> boundary_facets;
@@ -2058,6 +2069,7 @@ std::size_t flipBoundaryEdges(
           Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3,
                                                      inc_cells,
                                                      flip_criterion,
+                                                     cell_selector,
                                                      visitor);
           if (db == VALID_FLIP)
           {
@@ -2130,15 +2142,15 @@ void flip_edges(C3T3& c3t3,
                      cell_selector,
                      std::back_inserter(inside_edges));
 
-  //if (criterion == VALENCE_BASED)
-  //  flip_inside_edges(inside_edges);
-  //else
-  //{
-#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-  nb_flips +=
-#endif
-    flip_all_edges(inside_edges, c3t3, MIN_ANGLE_BASED, visitor);
-  //}
+//  //if (criterion == VALENCE_BASED)
+//  //  flip_inside_edges(inside_edges);
+//  //else
+//  //{
+//#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+//  nb_flips +=
+//#endif
+//    flip_all_edges(inside_edges, c3t3, MIN_ANGLE_BASED, visitor);
+//  //}
 
   if (!protect_boundaries)
   {
@@ -2167,7 +2179,8 @@ void flip_edges(C3T3& c3t3,
     nb_flips +=
 #endif
       flipBoundaryEdges(c3t3, boundary_edges, boundary_vertices_valences,
-                        vertices_subdomain_indices, MIN_ANGLE_BASED, visitor);
+                        vertices_subdomain_indices, MIN_ANGLE_BASED,
+                        cell_selector, visitor);
   }
 
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE

From 619871e04d815a741f19f54a34f375c431cf7b8c Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 21 Dec 2023 11:07:07 +0100
Subject: [PATCH 1199/1398] minor cleaning

---
 .../internal/collapse_short_edges.h           |  4 +--
 .../internal/flip_edges.h                     | 31 ++++++-------------
 .../internal/split_long_edges.h               |  2 +-
 .../tetrahedral_adaptive_remeshing_impl.h     |  2 +-
 .../internal/tetrahedral_remeshing_helpers.h  | 12 +++----
 5 files changed, 18 insertions(+), 33 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
index f5fdb880026a..4defe89c0674 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
@@ -1237,7 +1237,7 @@ void collapse_short_edges(C3T3& c3t3,
 
     FT sqlen = sql(tr.segment(e));
     if (sqlen < sq_low)
-      short_edges.insert(short_edge(make_vertex_pair<T3>(e), sqlen));
+      short_edges.insert(short_edge(make_vertex_pair(e), sqlen));
   }
 
 #ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
@@ -1299,7 +1299,7 @@ void collapse_short_edges(C3T3& c3t3,
 
           const FT sqlen = sql(tr.segment(eshort));
           if (sqlen < sq_low)
-            short_edges.insert(short_edge(make_vertex_pair<T3>(eshort), sqlen));
+            short_edges.insert(short_edge(make_vertex_pair(eshort), sqlen));
         }
 
         //debug::dump_c3t3(c3t3, "dump_after_collapse");
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 65d09725ea4e..9cccf9829dda 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -880,11 +880,6 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
   bool selected = get(cell_selector, to_remove[0]);
   visitor.before_flip(to_remove[0]);
 
-#ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
-  for (auto ci : to_remove)
-    CGAL_assertion(subdomain == ci->subdomain_index());
-#endif
-
   std::vector<Cell_handle> cells_to_update;
 
   //Create new cells
@@ -1941,43 +1936,37 @@ std::size_t flipBoundaryEdges(
 
   std::vector<Edge_vv> candidate_edges_for_flip;
 
-  for (std::size_t i = 0; i < boundary_edges.size(); i++)
+  for (const Edge& e : boundary_edges)
   {
-    const Edge& e = boundary_edges[i];
     if (c3t3.is_in_complex(e))
       continue;
     else
-    {
-      const Vertex_handle& vh0 = e.first->vertex(e.second);
-      const Vertex_handle& vh1 = e.first->vertex(e.third);
-      candidate_edges_for_flip.push_back(std::make_pair(vh0, vh1));
-    }
+      candidate_edges_for_flip.push_back(make_vertex_pair(e));
   }
 
   std::unordered_map<Vertex_handle,
     std::optional<boost::container::small_vector<Cell_handle, 64> > > inc_cells;
 
-  for (std::size_t ii = 0; ii < candidate_edges_for_flip.size(); ++ii)
+  for (const std::pair<Vertex_handle, Vertex_handle>& vp : candidate_edges_for_flip)
   {
-    const std::pair<Vertex_handle, Vertex_handle>& vp = candidate_edges_for_flip[ii];
-    const Vertex_handle& vh0 = vp.first;
-    const Vertex_handle& vh1 = vp.second;
+    const Vertex_handle vh0 = vp.first;
+    const Vertex_handle vh1 = vp.second;
 
-    const typename C3T3::Triangulation::Point p0 = vh0->point();
-    const typename C3T3::Triangulation::Point p1 = vh1->point();
+    const typename C3T3::Triangulation::Point& p0 = vh0->point();
+    const typename C3T3::Triangulation::Point& p1 = vh1->point();
 
     std::optional<boost::container::small_vector<Cell_handle, 64>>&
-      o_inc_vh = inc_cells[vp.first];
+      o_inc_vh = inc_cells[vh0];
     if (o_inc_vh == std::nullopt || o_inc_vh.value().empty())
     {
       boost::container::small_vector<Cell_handle, 64> inc_vec;
-      tr.incident_cells(vp.first, std::back_inserter(inc_vec));
+      tr.incident_cells(vh0, std::back_inserter(inc_vec));
       o_inc_vh = inc_vec;
     }
 
     Cell_handle c;
     int i, j;
-    if (!is_edge_uv(vp.first, vp.second, o_inc_vh.value(), c, i, j))
+    if (!is_edge_uv(vh0, vh1, o_inc_vh.value(), c, i, j))
       continue;
 
     std::vector<Facet> boundary_facets;
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/split_long_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/split_long_edges.h
index 5106fb1835bf..be0e35d7935c 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/split_long_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/split_long_edges.h
@@ -273,7 +273,7 @@ void split_long_edges(C3T3& c3t3,
       = tr.geom_traits().compute_squared_length_3_object();
     FT sqlen = sql(tr.segment(e));
     if (sqlen > sq_high)
-      long_edges.insert(long_edge(make_vertex_pair<T3>(e), sqlen));
+      long_edges.insert(long_edge(make_vertex_pair(e), sqlen));
   }
 
 #ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
index be3dfe8f276f..bedfe78e3679 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
@@ -481,7 +481,7 @@ class Adaptive_remesher
         continue;
       }
 
-      if (get(ecmap, CGAL::Tetrahedral_remeshing::make_vertex_pair<Tr>(e))
+      if (get(ecmap, CGAL::Tetrahedral_remeshing::make_vertex_pair(e))
           || nb_incident_subdomains(e, m_c3t3) > 2
           || nb_incident_surface_patches(e, m_c3t3) > 1)
       {
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 2410cbbf1b80..43dc7dd384de 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -418,14 +418,10 @@ std::pair<Vh, Vh> make_vertex_pair(const Vh v1, const Vh v2)
   else         return std::make_pair(v1, v2);
 }
 
-template<typename Tr>
-std::pair<typename Tr::Vertex_handle, typename Tr::Vertex_handle>
-make_vertex_pair(const typename Tr::Edge& e)
+template<typename Edge>
+auto make_vertex_pair(const Edge& e)
 {
-  typedef typename Tr::Vertex_handle Vertex_handle;
-  Vertex_handle v1 = e.first->vertex(e.second);
-  Vertex_handle v2 = e.first->vertex(e.third);
-  return make_vertex_pair(v1, v2);
+  return make_vertex_pair(e.first->vertex(e.second), e.first->vertex(e.third));
 }
 
 template<typename Vh>
@@ -962,7 +958,7 @@ OutputIterator get_internal_edges(const C3t3& c3t3,
     const typename C3t3::Edge& e = *eit;
     if (is_internal(e, c3t3, cell_selector))
     {
-      *oit++ = make_vertex_pair<typename C3t3::Triangulation>(e);
+      *oit++ = make_vertex_pair(e);
     }
   }
   return oit;

From 0b58c21b11cbfb31c11782f7672ea62ae9e7130f Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 21 Dec 2023 15:45:39 +0100
Subject: [PATCH 1200/1398] improve the script

[skip ci]
---
 .../developer_scripts/add_toc_to_github_wiki_page.py   | 10 +++++++---
 1 file changed, 7 insertions(+), 3 deletions(-)

diff --git a/Scripts/developer_scripts/add_toc_to_github_wiki_page.py b/Scripts/developer_scripts/add_toc_to_github_wiki_page.py
index 928703c502e8..f9f58e4f5b58 100644
--- a/Scripts/developer_scripts/add_toc_to_github_wiki_page.py
+++ b/Scripts/developer_scripts/add_toc_to_github_wiki_page.py
@@ -21,7 +21,8 @@ def get_anchor(s):
     s = s.replace("`", "")
     s = s.replace("(", "")
     s = s.replace(")", "")
-    s = s.replace(".", "")
+    if not args.codebase:
+        s = s.replace(".", "")
     s = s.replace("#", "")
     s = s.replace(":", "")
     s = s.replace(",", "")
@@ -39,11 +40,12 @@ def get_anchor(s):
     s = s.lstrip(" ")
     s = s.rstrip("\n")
     s = s.rstrip(" ")
-    s = re.sub(r"\s+", "-", s)
     if not args.codebase:
         s = s.lower()
     if args.codebase:
+        s = s.replace("' ", "-and-39-")
         s = s.replace("'", "-and-39-")
+    s = re.sub(r"\s+", "-", s)
     return "#" + quote(s)
 
 
@@ -106,7 +108,9 @@ def main():
         sys.exit()
 
     buffer = ""
-    toc = "<!--TOC-->\n\n# Table of Contents\n"
+    toc = "<!--TOC-->\n"
+    toc += "\n<!-- Table of content generated by `add_toc_to_github_wiki_page.py " + " ".join(sys.argv[1:]) + "` -->\n"
+    toc += "\n# Table of Contents\n"
 
     verbatim_mode = False  # to ignore verbatim mode while looking for sections
     toc_empty = True

From bd915f7a167b4a9210593de40ec542cabd330bab Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 22 Dec 2023 15:15:44 +0300
Subject: [PATCH 1201/1398] added a comment about ball radius to user doc

---
 .../Polygon_mesh_processing/Polygon_mesh_processing.txt  | 9 +++++++--
 1 file changed, 7 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 578fda8cec76..beeadb4516e4 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -998,8 +998,13 @@ solver.
 
 The interpolated curvature measures are then computed for each vertex \f$ v \f$ as the sum of
 the curvature measures of the faces in a ball around \f$ v \f$ weighted by the inclusion ratio of the
-triangle in the ball. If the ball radius is not specified (or negative), the sum is instead computed over the incident faces
-of \f$ v \f$.
+triangle in the ball. This ball radius is an optional (named) parameter of the function. There are 3
+cases for the ball radius passed value:
+- A positive value is passed: it is naturally used as the radius of the ball.
+- 0 is passed, a small epsilon (`average_edge_length * 1e-6`) is used
+(to account for the convergence of curvatures at infinitely small balls).
+- It is not specified (or negative), the sum is instead computed over the incident faces
+of the vertex \f$ v \f$.
 
 To get the final curvature value for a vertex \f$ v \f$, the respective interpolated curvature measure
 is divided by the interpolated area measure.

From c1e1084723ffa0ef47f07dd04e91516436281014 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 22 Dec 2023 14:22:36 +0100
Subject: [PATCH 1202/1398] flip edges on surfaces

---
 .../internal/flip_edges.h                     | 154 +++++++++---------
 .../internal/tetrahedral_remeshing_helpers.h  |  98 ++++++++++-
 2 files changed, 170 insertions(+), 82 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 9cccf9829dda..d08b8da91baa 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -722,8 +722,8 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
 
   Tr& tr = c3t3.triangulation();
 
-  Vertex_handle vh0 = edge.first->vertex(edge.second);
-  Vertex_handle vh1 = edge.first->vertex(edge.third);
+  const Vertex_handle vh0 = edge.first->vertex(edge.second);
+  const Vertex_handle vh1 = edge.first->vertex(edge.third);
 
   //This vertex will have its valence augmenting a lot,
   //TODO take the best one
@@ -1260,19 +1260,19 @@ void collectBoundaryEdgesAndComputeVerticesValences(
   boundary_edges.clear();
   boundary_vertices_valences.clear();
 
-  for (typename C3T3::Triangulation::Finite_edges_iterator
-       eit = tr.finite_edges_begin();
-       eit != tr.finite_edges_end();
-       ++eit)
+  for (const Edge& e : tr.finite_edges())
   {
-    const Edge e = *eit;
     if (is_boundary(c3t3, e, cell_selector))
       boundary_edges.push_back(e);
   }
 
-  for (std::size_t i = 0; i < boundary_edges.size(); ++i)
+#ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
+  CGAL::Tetrahedral_remeshing::debug::dump_edges(boundary_edges,
+                                                 "boundary_edges.polylines.txt");
+#endif
+
+  for (const Edge& e : boundary_edges)
   {
-    const Edge& e = boundary_edges[i];
     const Vertex_handle v0 = e.first->vertex(e.second);
     const Vertex_handle v1 = e.first->vertex(e.third);
 
@@ -1322,13 +1322,15 @@ void collectBoundaryEdgesAndComputeVerticesValences(
   }
 }
 
-template<typename C3T3, typename IncCellsVector>
+template<typename C3T3, typename IncCellsVector, typename CellSelector, typename Visitor>
 Sliver_removal_result flip_n_to_m_on_surface(typename C3T3::Edge& edge,
     C3T3& c3t3,
     typename C3T3::Vertex_handle v0i,//v0 of new edge that will replace edge
     typename C3T3::Vertex_handle v1i,//v1 of new edge that will replace edge
     const IncCellsVector& cells_around_edge,
-    Flip_Criterion flip_criterion)
+    Flip_Criterion flip_criterion,
+    CellSelector& cell_selector,
+    Visitor& visitor)
 {
   typedef typename C3T3::Vertex_handle Vertex_handle;
   typedef typename C3T3::Cell_handle   Cell_handle;
@@ -1406,8 +1408,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     cells_around_edge.push_back(circ);
   } while (++circ != done);
 
-//  std::cout << cells_around_edge.size();
-
   if (cells_around_edge.size() != 4)
   {
 //    nb_surface_nm_configs++;
@@ -1416,18 +1416,14 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //////        return find_best_n_m_flip(edge, vh0_index, vh1_index);
 //////      }
 //////      else {
-        std::vector<Vertex_handle> boundary_vertices;
-        boundary_vertices.push_back(v0i);
-        boundary_vertices.push_back(v1i);
-
-//        return flip_n_to_m_on_surface(edge, c3t3, v0i, v1i, cells_around_edge, flip_criterion);
-
-        return flip_n_to_m(edge, c3t3, boundary_vertices,
-                           flip_criterion,
-                           inc_cells,
-                           cell_selector,
-                           visitor);
-//      }
+//        std::vector<Vertex_handle> boundary_vertices;
+//        boundary_vertices.push_back(v0i);
+//        boundary_vertices.push_back(v1i);
+
+        return flip_n_to_m_on_surface(edge, c3t3, v0i, v1i,
+                                      cells_around_edge, flip_criterion,
+                                      cell_selector, visitor);
+//////    }
     }
     else
       return NOT_FLIPPABLE;
@@ -1712,9 +1708,11 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //
 //    */
 //
+//    if (db == VALID_FLIP) nb_surface_44_flips_done++;
+
     return db;
   }
-  else
+  else //Non planar flip
   {
     typename C3T3::Surface_patch_index patch = c3t3.surface_patch_index(ch0, ch0->index(vh2));
     CGAL_assertion(patch != typename C3T3::Surface_patch_index());
@@ -1745,22 +1743,16 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
       }
     }
 
-    c3t3.remove_from_complex(ch0, ch0->index(vh2));
-    c3t3.remove_from_complex(ch1, ch1->index(vh2));
-
     boost::unordered_map<Edge_uv, typename C3T3::Curve_index> complex_edges;
     for (Cell_handle c : cells_around_edge)
     {
-      for (int ii = 0; ii < 4; ++ii)
+      for(Edge e : cell_edges(c, tr))
       {
-        for (int jj = 0; jj < 4; ++jj)
+        if (c3t3.is_in_complex(e))
         {
-          Edge e(c, ii, jj);
-          if (c3t3.is_in_complex(e))
-          {
-            complex_edges[make_vertex_pair(c->vertex(ii), c->vertex(jj))] = c3t3.curve_index(e);
-            c3t3.remove_from_complex(e);
-          }
+          const auto uv = make_vertex_pair(e);
+          complex_edges[uv] = c3t3.curve_index(e);
+          c3t3.remove_from_complex(e);
         }
       }
     }
@@ -1835,9 +1827,10 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     ch1->set_neighbor(ch1->index(vh5), n_ch0_vh3);
     n_ch0_vh3->set_neighbor(n_ch0_vh3->index(ch0), ch1);
 
-    for (unsigned int i = 0; i < cells_around_edge.size(); i++){
+    for (const Cell_handle ce : cells_around_edge)
+    {
       for (int j = 0; j < 4; j++)
-        cells_around_edge[i]->vertex(j)->set_cell(cells_around_edge[i]);
+        ce->vertex(j)->set_cell(ce);
     }
 
     c3t3.add_to_complex(ch0, ch0->index(vh2), patch);
@@ -1845,24 +1838,19 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 
     for (Cell_handle c : cells_around_edge)
     {
-      for (int ii = 0; ii < 4; ++ii)
+      for(const Edge& edge_uv : cell_edges(c, tr))
       {
-        for (int jj = 0; jj < 4; ++jj)
+        const Edge_uv uv = make_vertex_pair(edge_uv);
+        if (complex_edges.find(uv) != complex_edges.end())
         {
-          Edge_uv uv = make_vertex_pair(c->vertex(ii), c->vertex(jj));
-          Edge edge_uv(c, ii, jj);
-          if (complex_edges.find(uv) != complex_edges.end())
-          {
-            if (!c3t3.is_in_complex(edge_uv))
-              c3t3.add_to_complex(edge_uv, complex_edges[uv]);
-          }
+          if (!c3t3.is_in_complex(edge_uv))
+            c3t3.add_to_complex(edge_uv, complex_edges[uv]);
         }
       }
     }
 
-    for (int i = 0; i < 4; ++i)
+    for (Cell_handle chi : cells_around_edge)
     {
-      Cell_handle chi = cells_around_edge[i];
       Facet f1(chi, chi->index(vh4));
       Facet f2(chi, chi->index(vh5));
 
@@ -1876,6 +1864,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     }
 
     db = VALID_FLIP;
+//    nb_surface_44_flips_done++;
 
 //    /*
 //    std::cout << "Ch0 "<< ch0->info()<< std::endl;
@@ -1969,32 +1958,39 @@ std::size_t flipBoundaryEdges(
     if (!is_edge_uv(vh0, vh1, o_inc_vh.value(), c, i, j))
       continue;
 
+    Edge edge(c, i, j);
     std::vector<Facet> boundary_facets;
-    Surface_patch_index surfi;
-
-    std::ofstream incf("dump_incident_facets.polylines.txt");
+    const bool on_boundary = is_boundary_edge(edge, c3t3, cell_selector, boundary_facets);
+
+//    if (on_boundary && boundary_facets.empty())
+//    {
+//      std::cerr << vh0->point().point() << "\t " << vh1->point().point() << std::endl;
+//      bool b = is_boundary_edge(vh0, vh1, c3t3, cell_selector);
+//      CGAL::Tetrahedral_remeshing::debug::dump_c3t3(c3t3, "dump_c3t3_about_boundary_");
+//      CGAL::Tetrahedral_remeshing::debug::dump_facets_in_complex(c3t3, "dump_facets_about_boundary_.off");
+//      CGAL::Tetrahedral_remeshing::debug::dump_facets_from_selection(
+//        c3t3, cell_selector, "dump_facets_from_selection_.off");
+//      std::cerr << "valid = " << tr.tds().is_valid(true) << std::endl;
+//      std::cerr << "boundary = " << b << std::endl;
+//      CGAL_assertion(on_boundary);
+//    }
+//    else if (on_boundary && boundary_facets.size() != 2)
+//    {
+//      std::cerr << vh0->point().point() << "\t " << vh1->point().point() << std::endl;
+//      CGAL::Tetrahedral_remeshing::debug::dump_c3t3(c3t3, "dump_c3t3_about_boundary_");
+//      CGAL::Tetrahedral_remeshing::debug::dump_facets(boundary_facets, "dump_boundary_facets.polylines.txt");
+//      std::vector<Facet> dummy_facets;
+//      bool b = is_boundary_edge(edge, c3t3, cell_selector, dummy_facets, true/**/);
+//      std::cerr << "boundary = " << b << std::endl;
+//    }
+
+    if (!on_boundary)
+      continue;
+    else
+      CGAL_assertion(boundary_facets.size() == 2);
 
-    Edge edge(c, i, j);
-    typename Tr::Facet_circulator fcirc = tr.incident_facets(edge);
-    typename Tr::Facet_circulator done(fcirc);
-    do
-    {
-      if (c3t3.is_in_complex(*fcirc))
-      {
-        surfi = c3t3.surface_patch_index(*fcirc);
-        boundary_facets.push_back(*fcirc);
-        CGAL_assertion(Surface_patch_index() != surfi);
-
-        Facet ff = *fcirc;
-        incf << "4 " << ff.first->vertex((ff.second + 1) % 4)->point()
-             << " " << ff.first->vertex((ff.second + 2) % 4)->point()
-             << " " << ff.first->vertex((ff.second + 3) % 4)->point()
-             << " " << ff.first->vertex((ff.second + 4) % 4)->point() << std::endl;
-      }
-    } while (++fcirc != done);
-    incf.close();
+    const Surface_patch_index surfi = c3t3.surface_patch_index(boundary_facets[0]);
 
-    if (boundary_facets.size() == 2)
     {
       const Facet& f0 = boundary_facets[0];
       const Facet& f1 = boundary_facets[1];
@@ -2087,21 +2083,23 @@ std::size_t flipBoundaryEdges(
             boundary_vertices_valences[vh1][surfi]--;
             boundary_vertices_valences[vh2][surfi]++;
             boundary_vertices_valences[vh3][surfi]++;
+
+//            std::cout << "Valid boundary flip" << std::endl;
+//            CGAL::Tetrahedral_remeshing::debug::dump_c3t3(c3t3, "dump_after_flip_");
+//            nb_surface_nm_flips_done++;
           }
           else if (db == INVALID_CELL || db == INVALID_VERTEX || db == INVALID_ORIENTATION)
           {
-            std::cout << "Cell problem" << std::endl;
+//            std::cout << "Cell problem" << std::endl;
             return nb;
           }
 //          else
-//            std::cout << " failed" << std::endl;
+//            std::cout << "Boundary flip failed" << std::endl;
         }
       }
     }
-    else
-      CGAL_assertion(false);
   }
-  CGAL_assertion(tr.tds().is_valid(true));
+  CGAL_assertion(tr.tds().is_valid());
   return nb;
 }
 
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 43dc7dd384de..f6c594d68955 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -483,16 +483,34 @@ bool is_well_oriented(const Tr& tr, const typename Tr::Cell_handle ch)
 template<typename C3T3, typename CellSelector>
 bool is_boundary(const C3T3& c3t3,
                  const typename C3T3::Facet& f,
-                 const CellSelector& cell_selector)
+                 const CellSelector& cell_selector,
+                 const bool verbose = false)
 {
-  return c3t3.is_in_complex(f)
-    || get(cell_selector, f.first) != get(cell_selector, f.first->neighbor(f.second));
+  if (c3t3.triangulation().is_infinite(f))
+    return false;
+
+  const auto& mf = c3t3.triangulation().mirror_facet(f);
+  const bool res = c3t3.is_in_complex(f)
+    || get(cell_selector, f.first) != get(cell_selector, mf.first);
+
+  if (verbose && res)
+  {
+    std::cout << "is_boundary(f) :"
+      << "\n\t in_complex        = " << c3t3.is_in_complex(f)
+      << "\n\t selector(f.first) = " << get(cell_selector, f.first)
+      << "\n\t selector(mirror ) = " << get(cell_selector, mf.first)
+      << "\n\t subdomain(f.first)= " << f.first->subdomain_index()
+      << "\n\t subdomain(mirror) = " << mf.first->subdomain_index()
+      << std::endl;
+  }
+
+  return res;
 }
 
 template<typename C3T3, typename CellSelector>
 bool is_boundary(const C3T3& c3t3,
                  const typename C3T3::Triangulation::Edge& e,
-                 CellSelector cell_selector)
+                 const CellSelector& cell_selector)
 {
   typedef typename C3T3::Triangulation   Tr;
   typedef typename Tr::Facet_circulator  Facet_circulator;
@@ -529,6 +547,33 @@ bool is_boundary_edge(const typename C3t3::Vertex_handle& v0,
     return false;
 }
 
+template<typename C3t3, typename CellSelector>
+bool is_boundary_edge(const typename C3t3::Edge& e,
+                      const C3t3& c3t3,
+                      const CellSelector& cell_selector,
+                      std::vector<typename C3t3::Facet>& boundary_facets,
+                      const bool verbose = false)
+{
+  using Facet = typename C3t3::Facet;
+
+  auto fcirc = c3t3.triangulation().incident_facets(e);
+  auto fend = fcirc;
+  bool result = false;
+
+  do
+  {
+    const Facet& f = *fcirc;
+    if (is_boundary(c3t3, f, cell_selector, verbose))
+    {
+      boundary_facets.push_back(f);
+      result = true;
+    }
+  }
+  while (++fcirc != fend);
+
+  return result;
+}
+
 template<typename C3t3, typename CellSelector>
 bool is_boundary_vertex(const typename C3t3::Vertex_handle& v,
                         const C3t3& c3t3,
@@ -1203,6 +1248,20 @@ void get_edge_info(const typename C3t3::Edge& edge,
   }
 }
 
+template<typename Tr>
+std::array<typename Tr::Edge, 6>
+cell_edges(const typename Tr::Cell_handle c, const Tr&)
+{
+  using Edge = typename Tr::Edge;
+  std::array<Edge, 6> edges_array = { { Edge(c, 0, 1),
+                                        Edge(c, 0, 2),
+                                        Edge(c, 0, 3),
+                                        Edge(c, 1, 2),
+                                        Edge(c, 1, 3),
+                                        Edge(c, 2, 3) } };
+  return edges_array;
+}
+
 namespace internal
 {
   template<typename C3t3, typename CellSelector>
@@ -1225,6 +1284,9 @@ namespace internal
   {
     //update C3t3
     using Subdomain_index = typename C3t3::Subdomain_index;
+    if(c3t3.is_in_complex(c))
+      c3t3.remove_from_complex(c);
+
     if (Subdomain_index() != subdomain)
       c3t3.add_to_complex(c, subdomain);
     else
@@ -1256,6 +1318,20 @@ void dump_edges(const Bimap& edges, const char* filename)
   ofs.close();
 }
 
+template <typename Edge>
+void dump_edges(const std::vector<Edge>& edges, const char* filename)
+{
+  std::ofstream ofs(filename);
+  ofs.precision(17);
+
+  for (const Edge& e : edges)
+  {
+    ofs << "2 " << point(e.first->vertex(e.second)->point())
+        << " " << point(e.first->vertex(e.third)->point()) << std::endl;
+  }
+  ofs.close();
+}
+
 template<typename Facet, typename OutputStream>
 void dump_facet(const Facet& f, OutputStream& os)
 {
@@ -1278,6 +1354,20 @@ void dump_facets(const FacetRange& facets, const char* filename)
   os.close();
 }
 
+template<typename C3t3, typename CellSelector>
+void dump_facets_from_selection(const C3t3& c3t3,
+  const CellSelector& selector,
+  const char* filename)
+{
+  std::vector<typename C3t3::Facet> facets;
+  for (const auto& f : c3t3.triangulation().finite_facets())
+  {
+    if (get(selector, f.first) != get(selector, f.first->neighbor(f.second)))
+      facets.push_back(f);
+  }
+  dump_facets(facets, filename);
+}
+
 template<typename CellRange>
 void dump_polylines(const CellRange& cells, const char* filename)
 {

From 1748dfadbbf1554b3303bf466ee56e10a0bbe1f0 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 22 Dec 2023 14:52:03 +0100
Subject: [PATCH 1203/1398] fix compilation

---
 .../Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp      | 2 +-
 Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h      | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp
index a64a44fa331e..832fc316a446 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp
@@ -120,7 +120,7 @@ public Q_SLOTS:
         if (c3t3_item->c3t3().is_in_complex(e)
           || CGAL::Tetrahedral_remeshing::protecting_balls_intersect(e, c3t3))
         {
-          Vertex_pair evv = CGAL::Tetrahedral_remeshing::make_vertex_pair<Tr>(e);
+          Vertex_pair evv = CGAL::Tetrahedral_remeshing::make_vertex_pair(e);
           constraints.insert(evv);
         }
       }
diff --git a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
index 8b8fca10ccef..3eac9a222bdd 100644
--- a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
+++ b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
@@ -367,7 +367,7 @@ convert_to_triangulation_3(
     for (auto e : c3t3.edges_in_complex())
     {
       const Edge_vv evv
-        = CGAL::Tetrahedral_remeshing::make_vertex_pair<Tr>(e);//ordered pair
+        = CGAL::Tetrahedral_remeshing::make_vertex_pair(e);//ordered pair
       put(ecmap, evv, true);
     }
   }

From bd98f389b15c22b41d4ecde183f797f5f8d8e0da Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 22 Dec 2023 15:09:29 +0100
Subject: [PATCH 1204/1398] update for qt6

---
 Scripts/developer_scripts/cgal_demo_copy_all_dlls_cygwin.sh | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Scripts/developer_scripts/cgal_demo_copy_all_dlls_cygwin.sh b/Scripts/developer_scripts/cgal_demo_copy_all_dlls_cygwin.sh
index 2af501d48c03..6699629f7c24 100644
--- a/Scripts/developer_scripts/cgal_demo_copy_all_dlls_cygwin.sh
+++ b/Scripts/developer_scripts/cgal_demo_copy_all_dlls_cygwin.sh
@@ -1,7 +1,7 @@
 #!/bin/bash
 
 #use this script from inside the build directory of the Polyhedron demo
-#Needs the Qt5_DIR env variable set to <Qt5_ROOT>/lib/cmake/Qt5
+#Needs the Qt6_DIR env variable set to <Qt6_ROOT>/lib/cmake/Qt6
 
 #No config : in autotest_cgal we use NMake as generator
 #If using MSVC Generator, declare config="Release"
@@ -43,4 +43,4 @@ for file in "${files[@]}"; do
   done; #check dependencies
 done #loop over directories
 mkdir -p "$target_directory/platforms"
-cp "$Qt5_INSTALLATION_DIR/plugins/platforms/qwindows.dll" "$target_directory/platforms"
+cp "$Qt6_INSTALLATION_DIR/plugins/platforms/qwindows.dll" "$target_directory/platforms"

From 4942b8e9180ee8c3b29a15670f9de77d2214f8e9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Dec 2023 10:19:15 +0100
Subject: [PATCH 1205/1398] add QT6 version in test results

---
 Maintenance/test_handling/create_testresult_page | 1 +
 Maintenance/test_handling/to_zipped_format       | 6 +++++-
 2 files changed, 6 insertions(+), 1 deletion(-)

diff --git a/Maintenance/test_handling/create_testresult_page b/Maintenance/test_handling/create_testresult_page
index 3747a4a83133..4b183402d48a 100755
--- a/Maintenance/test_handling/create_testresult_page
+++ b/Maintenance/test_handling/create_testresult_page
@@ -475,6 +475,7 @@ sub print_platform_descriptions()
 <th>MPFR</th>
 <th>GMP</th>
 <th>QT5</th>
+<th>QT6</th>
 <th>LEDA</th>
 <th>CXXFLAGS</th>
 <th>LDFLAGS</th>
diff --git a/Maintenance/test_handling/to_zipped_format b/Maintenance/test_handling/to_zipped_format
index d8c7c1cd433b..e4d8e66bd566 100755
--- a/Maintenance/test_handling/to_zipped_format
+++ b/Maintenance/test_handling/to_zipped_format
@@ -51,7 +51,7 @@ sub reformat_results($)
     $_ = $line;
     open (PLATFORM_INFO,">${platform}.info") or return;
     open (PLATFORM_NEW_RESULTS,">${platform}.new_results") or return;
-    my ($CGAL_VERSION,$LEDA_VERSION,$COMPILER,$TESTER_NAME,$TESTER_ADDRESS,$GMP,$MPFR,$ZLIB,$OPENGL,$BOOST,$QT,$QT4,$QT5,$CMAKE) = ("-","-","-","-","-","-","-","-","-","-","-","-","-","-","-","no");
+    my ($CGAL_VERSION,$LEDA_VERSION,$COMPILER,$TESTER_NAME,$TESTER_ADDRESS,$GMP,$MPFR,$ZLIB,$OPENGL,$BOOST,$QT,$QT4,$QT5,$QT6,$CMAKE) = ("-","-","-","-","-","-","-","-","-","-","-","-","-","-","-","-","no");
     my ($LDFLAGS,$CXXFLAGS) = ("", "");
     while (! /^------/) {
         if(/^\s*$/) {
@@ -102,6 +102,9 @@ sub reformat_results($)
 	if (/Qt5_VERSION = '([^']+)'/) {
 	    $QT5="$1";
 	}
+	if (/Qt6_VERSION = '([^']+)'/) {
+	    $QT6="$1";
+	}
 	if (/BOOST_VERSION = '([^']+)'/) {
 	    $BOOST="$1";
 	}
@@ -148,6 +151,7 @@ $BOOST
 $MPFR
 $GMP
 $QT5
+$QT6
 $LEDA_VERSION
 $CXXFLAGS
 $LDFLAGS

From e760e9795999da66038818ffe789379634e6069a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Dec 2023 11:05:57 +0100
Subject: [PATCH 1206/1398] update indices

---
 Maintenance/test_handling/create_testresult_page | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Maintenance/test_handling/create_testresult_page b/Maintenance/test_handling/create_testresult_page
index 4b183402d48a..8fd78fc58204 100755
--- a/Maintenance/test_handling/create_testresult_page
+++ b/Maintenance/test_handling/create_testresult_page
@@ -531,7 +531,7 @@ EOF
 	    print OUTPUT "<td>$counto</td>\n";
  	    print OUTPUT "<td>$countn</td>\n";
  	    print OUTPUT "<td>$countr</td>\n";
-	    $index = 8;
+	    $index = 9;
 	    while ($index) {
 	        $index--;
 		$_ = $tmp[$index];
@@ -543,7 +543,7 @@ EOF
 	    }
 	} else {
             print OUTPUT ">$pf_short</a>";
-	    my $index = 12;
+	    my $index = 13;
 	    while ($index) {
 		print OUTPUT "<td>?</td>\n";
 	    }

From ee6c73b8494c24a2dd08d8e96c1155464211f3e4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Dec 2023 11:08:23 +0100
Subject: [PATCH 1207/1398] another index

---
 Maintenance/test_handling/create_testresult_page | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Maintenance/test_handling/create_testresult_page b/Maintenance/test_handling/create_testresult_page
index 8fd78fc58204..02d4fb4a38f6 100755
--- a/Maintenance/test_handling/create_testresult_page
+++ b/Maintenance/test_handling/create_testresult_page
@@ -512,7 +512,7 @@ EOF
 	    my $countn = $testresults[$platform_num]->{"n"};
 	    my $countr = $testresults[$platform_num]->{"r"};
 
-	    my $index = 8;
+	    my $index = 9;
 	    my @tmp;
 	    while ($index) {
 	        $index--;

From 37c792a764e9837a94048c5feafcc291301b393b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Dec 2023 11:56:08 +0100
Subject: [PATCH 1208/1398] fix qt6 version

---
 Installation/CMakeLists.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Installation/CMakeLists.txt b/Installation/CMakeLists.txt
index 744e4fed4ab1..1e912131c120 100644
--- a/Installation/CMakeLists.txt
+++ b/Installation/CMakeLists.txt
@@ -1253,6 +1253,6 @@ if(RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE)
     "USING BOOST_VERSION = '${Boost_MAJOR_VERSION}.${Boost_MINOR_VERSION}.${Boost_SUBMINOR_VERSION}'"
     )
   if(Qt6_FOUND)
-    message(STATUS "USING Qt6_VERSION = '${Qt6Core_VERSION_STRING}'")
+    message(STATUS "USING Qt6_VERSION = '${Qt6Core_VERSION}'")
   endif()#Qt6_FOUND
 endif()#RUNNING_CGAL_AUTO_TEST OR CGAL_TEST_SUITE

From ea07530d1d5ee5b17ea8dc8ffb3efee7e1d63ba7 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Dec 2023 12:01:55 +0100
Subject: [PATCH 1209/1398] add missing decrement

---
 Maintenance/test_handling/create_testresult_page | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Maintenance/test_handling/create_testresult_page b/Maintenance/test_handling/create_testresult_page
index 02d4fb4a38f6..37934a2fbcbb 100755
--- a/Maintenance/test_handling/create_testresult_page
+++ b/Maintenance/test_handling/create_testresult_page
@@ -545,6 +545,7 @@ EOF
             print OUTPUT ">$pf_short</a>";
 	    my $index = 13;
 	    while ($index) {
+        $index--;
 		print OUTPUT "<td>?</td>\n";
 	    }
 	}

From 3564fd185161c17f82c9b2827e9b53ba2b029b79 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 27 Dec 2023 14:12:35 +0100
Subject: [PATCH 1210/1398] unify QT

---
 Maintenance/test_handling/create_testresult_page |  9 ++++-----
 Maintenance/test_handling/to_zipped_format       | 11 +++++------
 2 files changed, 9 insertions(+), 11 deletions(-)

diff --git a/Maintenance/test_handling/create_testresult_page b/Maintenance/test_handling/create_testresult_page
index 37934a2fbcbb..edde28fff960 100755
--- a/Maintenance/test_handling/create_testresult_page
+++ b/Maintenance/test_handling/create_testresult_page
@@ -474,8 +474,7 @@ sub print_platform_descriptions()
 <th>BOOST</th>
 <th>MPFR</th>
 <th>GMP</th>
-<th>QT5</th>
-<th>QT6</th>
+<th>QT</th>
 <th>LEDA</th>
 <th>CXXFLAGS</th>
 <th>LDFLAGS</th>
@@ -512,7 +511,7 @@ EOF
 	    my $countn = $testresults[$platform_num]->{"n"};
 	    my $countr = $testresults[$platform_num]->{"r"};
 
-	    my $index = 9;
+	    my $index = 8;
 	    my @tmp;
 	    while ($index) {
 	        $index--;
@@ -531,7 +530,7 @@ EOF
 	    print OUTPUT "<td>$counto</td>\n";
  	    print OUTPUT "<td>$countn</td>\n";
  	    print OUTPUT "<td>$countr</td>\n";
-	    $index = 9;
+	    $index = 8;
 	    while ($index) {
 	        $index--;
 		$_ = $tmp[$index];
@@ -543,7 +542,7 @@ EOF
 	    }
 	} else {
             print OUTPUT ">$pf_short</a>";
-	    my $index = 13;
+	    my $index = 12;
 	    while ($index) {
         $index--;
 		print OUTPUT "<td>?</td>\n";
diff --git a/Maintenance/test_handling/to_zipped_format b/Maintenance/test_handling/to_zipped_format
index e4d8e66bd566..fdf62712b021 100755
--- a/Maintenance/test_handling/to_zipped_format
+++ b/Maintenance/test_handling/to_zipped_format
@@ -51,7 +51,7 @@ sub reformat_results($)
     $_ = $line;
     open (PLATFORM_INFO,">${platform}.info") or return;
     open (PLATFORM_NEW_RESULTS,">${platform}.new_results") or return;
-    my ($CGAL_VERSION,$LEDA_VERSION,$COMPILER,$TESTER_NAME,$TESTER_ADDRESS,$GMP,$MPFR,$ZLIB,$OPENGL,$BOOST,$QT,$QT4,$QT5,$QT6,$CMAKE) = ("-","-","-","-","-","-","-","-","-","-","-","-","-","-","-","-","no");
+    my ($CGAL_VERSION,$LEDA_VERSION,$COMPILER,$TESTER_NAME,$TESTER_ADDRESS,$GMP,$MPFR,$ZLIB,$OPENGL,$BOOST,$QT,$CMAKE) = ("-","-","-","-","-","-","-","-","-","-","-","-","-","no");
     my ($LDFLAGS,$CXXFLAGS) = ("", "");
     while (! /^------/) {
         if(/^\s*$/) {
@@ -97,13 +97,13 @@ sub reformat_results($)
 	    $QT="$1";
 	}
 	if (/QT4_VERSION = '([^']+)'/) {
-	    $QT4="$1";
+	    $QT="$1";
 	}
 	if (/Qt5_VERSION = '([^']+)'/) {
-	    $QT5="$1";
+	    $QT="$1";
 	}
 	if (/Qt6_VERSION = '([^']+)'/) {
-	    $QT6="$1";
+	    $QT="$1";
 	}
 	if (/BOOST_VERSION = '([^']+)'/) {
 	    $BOOST="$1";
@@ -150,8 +150,7 @@ $CMAKE
 $BOOST
 $MPFR
 $GMP
-$QT5
-$QT6
+$QT
 $LEDA_VERSION
 $CXXFLAGS
 $LDFLAGS

From 74c89a16b93417b9d8584cd450f7d6b27f08d18b Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 27 Dec 2023 23:34:49 +0200
Subject: [PATCH 1211/1398] Added missing "override"

---
 .../test/Arrangement_on_surface_2/test_observer.cpp             | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
index 5156fde017bf..6c5d646c62ef 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp
@@ -404,7 +404,7 @@ class Test_observer : public Arrangement_2::Observer {
    * \param h A circulator representing the boundary of the merged component.
    */
   virtual void after_merge_outer_ccb(Face_handle /* f */,
-                                     Ccb_halfedge_circulator /* h */)
+                                     Ccb_halfedge_circulator /* h */) override
   { compare_results("after_merge_outer_ccb"); }
 
   /*! Notification before the merging of two inner CCBs (holes).

From 9985f9cfa0fed1ef7dad30e1941dc58a34e57b83 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 2 Jan 2024 14:04:03 +0100
Subject: [PATCH 1212/1398] autorefinement has its own license file

---
 .../Polygon_mesh_processing/autorefinement.h  | 54 +++++++++++++++++++
 .../interpolated_corrected_curvatures.h       |  8 +--
 Installation/include/CGAL/license/SMDS_3.h    |  4 +-
 .../include/CGAL/license/gpl_package_list.txt |  1 +
 .../Polygon_mesh_processing/autorefinement.h  |  2 +-
 5 files changed, 62 insertions(+), 7 deletions(-)
 create mode 100644 Installation/include/CGAL/license/Polygon_mesh_processing/autorefinement.h

diff --git a/Installation/include/CGAL/license/Polygon_mesh_processing/autorefinement.h b/Installation/include/CGAL/license/Polygon_mesh_processing/autorefinement.h
new file mode 100644
index 000000000000..8f3c9cc5e3fe
--- /dev/null
+++ b/Installation/include/CGAL/license/Polygon_mesh_processing/autorefinement.h
@@ -0,0 +1,54 @@
+// Copyright (c) 2016  GeometryFactory SARL (France).
+// All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+//
+// Author(s) : Andreas Fabri
+//
+// Warning: this file is generated, see include/CGAL/license/README.md
+
+#ifndef CGAL_LICENSE_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_H
+#define CGAL_LICENSE_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_H
+
+#include <CGAL/config.h>
+#include <CGAL/license.h>
+
+#ifdef CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_COMMERCIAL_LICENSE
+
+#  if CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+
+#    if defined(CGAL_LICENSE_WARNING)
+
+       CGAL_pragma_warning("Your commercial license for CGAL does not cover "
+                           "this release of the Polygon Mesh Processing - Autorefinement package.")
+#    endif
+
+#    ifdef CGAL_LICENSE_ERROR
+#      error "Your commercial license for CGAL does not cover this release \
+              of the Polygon Mesh Processing - Autorefinement package. \
+              You get this error, as you defined CGAL_LICENSE_ERROR."
+#    endif // CGAL_LICENSE_ERROR
+
+#  endif // CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_COMMERCIAL_LICENSE < CGAL_RELEASE_DATE
+
+#else // no CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_COMMERCIAL_LICENSE
+
+#  if defined(CGAL_LICENSE_WARNING)
+     CGAL_pragma_warning("\nThe macro CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_COMMERCIAL_LICENSE is not defined."
+                          "\nYou use the CGAL Polygon Mesh Processing - Autorefinement package under "
+                          "the terms of the GPLv3+.")
+#  endif // CGAL_LICENSE_WARNING
+
+#  ifdef CGAL_LICENSE_ERROR
+#    error "The macro CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_COMMERCIAL_LICENSE is not defined.\
+            You use the CGAL Polygon Mesh Processing - Autorefinement package under the terms of \
+            the GPLv3+. You get this error, as you defined CGAL_LICENSE_ERROR."
+#  endif // CGAL_LICENSE_ERROR
+
+#endif // no CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_COMMERCIAL_LICENSE
+
+#endif // CGAL_LICENSE_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_H
diff --git a/Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvatures.h b/Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvatures.h
index e484daaf5eae..5bf31aaa352b 100644
--- a/Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvatures.h
+++ b/Installation/include/CGAL/license/Polygon_mesh_processing/interpolated_corrected_curvatures.h
@@ -9,10 +9,10 @@
 //
 // Author(s) : Andreas Fabri
 //
-// Warning: this file is generated, see include/CGAL/licence/README.md
+// Warning: this file is generated, see include/CGAL/license/README.md
 
-#ifndef CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
-#define CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
+#ifndef CGAL_LICENSE_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
+#define CGAL_LICENSE_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
 
 #include <CGAL/config.h>
 #include <CGAL/license.h>
@@ -51,4 +51,4 @@
 
 #endif // no CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_COMMERCIAL_LICENSE
 
-#endif // CGAL_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
+#endif // CGAL_LICENSE_POLYGON_MESH_PROCESSING_INTERPOLATED_CORRECTED_CURVATURES_H
diff --git a/Installation/include/CGAL/license/SMDS_3.h b/Installation/include/CGAL/license/SMDS_3.h
index 4f349c13acf3..b4011300b50a 100644
--- a/Installation/include/CGAL/license/SMDS_3.h
+++ b/Installation/include/CGAL/license/SMDS_3.h
@@ -24,12 +24,12 @@
 #    if defined(CGAL_LICENSE_WARNING)
 
        CGAL_pragma_warning("Your commercial license for CGAL does not cover "
-                           "this release of the 3D Mesh Data Structure package.")
+                           "this release of the 3D Simplicial Mesh Data Structure package.")
 #    endif
 
 #    ifdef CGAL_LICENSE_ERROR
 #      error "Your commercial license for CGAL does not cover this release \
-              of the 3D Mesh Data Structure package. \
+              of the 3D Simplicial Mesh Data Structure package. \
               You get this error, as you defined CGAL_LICENSE_ERROR."
 #    endif // CGAL_LICENSE_ERROR
 
diff --git a/Installation/include/CGAL/license/gpl_package_list.txt b/Installation/include/CGAL/license/gpl_package_list.txt
index 41612d5b9fca..fd4eeeb7d657 100644
--- a/Installation/include/CGAL/license/gpl_package_list.txt
+++ b/Installation/include/CGAL/license/gpl_package_list.txt
@@ -61,6 +61,7 @@ Polygon_mesh_processing/geometric_repair Polygon Mesh Processing - Geometric Rep
 Polygon_mesh_processing/miscellaneous Polygon Mesh Processing - Miscellaneous
 Polygon_mesh_processing/detect_features Polygon Mesh Processing - Feature Detection
 Polygon_mesh_processing/collision_detection Polygon Mesh Processing - Collision Detection
+Polygon_mesh_processing/autorefinement Polygon Mesh Processing - Autorefinement
 Polyhedron 3D Polyhedral Surface
 Polyline_simplification_2 2D Polyline Simplification
 Polytope_distance_d Optimal Distances
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 8a61b92f7178..a3606f816a7b 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -14,7 +14,7 @@
 #ifndef CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_H
 #define CGAL_POLYGON_MESH_PROCESSING_AUTOREFINEMENT_H
 
-#include <CGAL/license/Polygon_mesh_processing/geometric_repair.h>
+#include <CGAL/license/Polygon_mesh_processing/autorefinement.h>
 
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
 #include <CGAL/Polygon_mesh_processing/shape_predicates.h>

From e23b535f7c30e957d0252596505e661cc4c7ec67 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Tue, 2 Jan 2024 15:33:44 +0100
Subject: [PATCH 1213/1398] Treeview missing due to missing setting in
 header.html

The PR #7946 was withdraw because the `$cookie` was not necessary anymore in the `header...`  files as it was part of the of the `$treeview`.
In `header_package.html` the `$treeview` has been disables and as such the `cookie.js` is not added/
Adding the `cookie.js` explicitly.

The effect was that there was a divider between the treeniew and the textual documentation but it was on the far left (and thus invisible), ith could be moved but after a refresh it was "gone" again.
---
 Documentation/doc/resources/1.10.0/header_package.html | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Documentation/doc/resources/1.10.0/header_package.html b/Documentation/doc/resources/1.10.0/header_package.html
index 827e05a9663d..f2309e17bcd0 100644
--- a/Documentation/doc/resources/1.10.0/header_package.html
+++ b/Documentation/doc/resources/1.10.0/header_package.html
@@ -26,6 +26,7 @@
 <!-- $.treeview -->
 <!-- $.search -->
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script src="$relpath^../Manual/cookie.js" type="text/javascript"></script>
 <script type="text/javascript" src="$relpath^../Manual/resize.js"></script>
 <script type="text/javascript" src="navtreedata.js"></script>
 <script type="text/javascript" src="navtree.js"></script>

From 277c1603eb8f9f355aea4849ae4a1dbbed5edd99 Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Tue, 2 Jan 2024 17:46:42 +0100
Subject: [PATCH 1214/1398] fix warning

---
 Surface_sweep_2/test/Surface_sweep_2/test_sweep.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Surface_sweep_2/test/Surface_sweep_2/test_sweep.cpp b/Surface_sweep_2/test/Surface_sweep_2/test_sweep.cpp
index c0da570e916b..1171fabe6149 100644
--- a/Surface_sweep_2/test/Surface_sweep_2/test_sweep.cpp
+++ b/Surface_sweep_2/test/Surface_sweep_2/test_sweep.cpp
@@ -385,7 +385,7 @@ bool test_points_no_ends(std::ifstream& inp, Curves& /* curves */,
                          const Points& points_no_ends_out,
                          const Traits& tr) {
   Points points_no_ends;
-  if (! read_points(inp, points_no_ends, tr)) return -1;
+  if (! read_points(inp, points_no_ends, tr)) return false;
 
   if (! compare_lists(points_no_ends_out, points_no_ends, tr)) {
     std::cerr << "Error: Intersection points do not match!\n";

From a2e3f9be0db01fbe1ebe10999160496293195a72 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 2 Jan 2024 16:57:45 +0000
Subject: [PATCH 1215/1398] Triangulation_2:  Make IO save by changing file
 names

---
 .../_test_cls_constrained_triangulation_2.h   | 26 +++++++++----------
 .../CGAL/_test_cls_regular_triangulation_2.h  |  8 +++---
 .../CGAL/_test_cls_triangulation_short_2.h    |  8 +++---
 3 files changed, 21 insertions(+), 21 deletions(-)

diff --git a/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_constrained_triangulation_2.h b/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_constrained_triangulation_2.h
index 558f714c5465..b9ff68f77ab9 100644
--- a/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_constrained_triangulation_2.h
+++ b/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_constrained_triangulation_2.h
@@ -222,52 +222,52 @@ _test_cls_constrained_triangulation(const Triang &)
   /******** I/O *******/
   std::cout << "output to a file" << std::endl;
 
-  std::ofstream of0_1("T01.triangulation", std::ios::out);
+  std::ofstream of0_1("T01ct.triangulation", std::ios::out);
   CGAL::IO::set_ascii_mode(of0_1);
    of0_1 << T0_1; of0_1.close();
 
-  std::ofstream of0_2("T02.triangulation");
+  std::ofstream of0_2("T02ct.triangulation");
   CGAL::IO::set_ascii_mode(of0_2);
   of0_2 << T0_2; of0_2.close();
 
-  std::ofstream of1_1("T11.triangulation");
+  std::ofstream of1_1("T11ct.triangulation");
   CGAL::IO::set_ascii_mode(of1_1);
   of1_1 << T1_1; of1_1.close();
 
-  std::ofstream of1_2("T12.triangulation");
+  std::ofstream of1_2("T12ct.triangulation");
   CGAL::IO::set_ascii_mode(of1_2);
    of1_2 << T1_2; of1_2.close();
 
-  std::ofstream of2_1("T21.triangulation");
+  std::ofstream of2_1("T21ct.triangulation");
   CGAL::IO::set_ascii_mode(of2_1);
   of2_1 << T2_1; of2_1.close();
 
-  std::ofstream of2_2("T22.triangulation");
+  std::ofstream of2_2("T22ct.triangulation");
   CGAL::IO::set_ascii_mode(of2_2);
   of2_2 << T2_2; of2_2.close();
 
   std::cout << "input from a file" << std::endl;
-  std::ifstream if0_1("T01.triangulation"); CGAL::IO::set_ascii_mode(if0_1);
+  std::ifstream if0_1("T01ct.triangulation"); CGAL::IO::set_ascii_mode(if0_1);
   Triang T0_1_copy;   if0_1 >> T0_1_copy;
 
-  std::ifstream if0_2("T02.triangulation"); CGAL::IO::set_ascii_mode(if0_2);
+  std::ifstream if0_2("T02ct.triangulation"); CGAL::IO::set_ascii_mode(if0_2);
   Triang T0_2_copy;  if0_2 >> T0_2_copy;
 
-  std::ifstream if1_1("T11.triangulation"); CGAL::IO::set_ascii_mode(if1_1);
+  std::ifstream if1_1("T11ct.triangulation"); CGAL::IO::set_ascii_mode(if1_1);
   Triang T1_1_copy; if1_1 >> T1_1_copy;
 
-  std::ifstream if1_2("T12.triangulation"); CGAL::IO::set_ascii_mode(if1_2);
+  std::ifstream if1_2("T12ct.triangulation"); CGAL::IO::set_ascii_mode(if1_2);
    Triang T1_2_copy; if1_2 >> T1_2_copy;
 
-  std::ifstream if2_1("T21.triangulation"); CGAL::IO::set_ascii_mode(if2_1);
+  std::ifstream if2_1("T21ct.triangulation"); CGAL::IO::set_ascii_mode(if2_1);
   Triang T2_1_copy; if2_1 >> T2_1_copy;
 
-  std::ifstream if2_2("T22.triangulation"); CGAL::IO::set_ascii_mode(if2_2);
+  std::ifstream if2_2("T22ct.triangulation"); CGAL::IO::set_ascii_mode(if2_2);
   Triang T2_2_copy; if2_2 >> T2_2_copy;
 
   // test copy of constrained Triangulation
    Triang T2_4(T2_2);
-  std::ofstream of2_2_bis("T22.triangulation");
+  std::ofstream of2_2_bis("T22ct.triangulation");
   CGAL::IO::set_ascii_mode(of2_2_bis);
   of2_2_bis << T2_4; of2_2_bis.close();
   All_faces_iterator fit2 = T2_2.all_faces_begin();
diff --git a/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_regular_triangulation_2.h b/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_regular_triangulation_2.h
index 2d5656c93b20..762070693ee6 100644
--- a/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_regular_triangulation_2.h
+++ b/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_regular_triangulation_2.h
@@ -749,23 +749,23 @@ _test_cls_regular_triangulation_2( const Triangulation & )
    // input output have not yet been overload
    // so they do not input output hidden vertices
   std::cout << "    output to a file" << std::endl;
-  std::ofstream of1_5("T15.triangulation");
+  std::ofstream of1_5("T15rt.triangulation");
   CGAL::IO::set_ascii_mode(of1_5);
   of1_5 << T1_5; of1_5.close();
-  std::ofstream of2_3("T23.triangulation");
+  std::ofstream of2_3("T23rt.triangulation");
   CGAL::IO::set_ascii_mode(of2_3);
   of2_3 << T2_3; of2_3.close();
 
 
 //   std::cout << "    input from a file" << std::endl;
 
-//   std::ifstream if1_5("T15.triangulation"); CGAL::IO::set_ascii_mode(if1_5);
+//   std::ifstream if1_5("T15rt.triangulation"); CGAL::IO::set_ascii_mode(if1_5);
 //   Cls T1_5_copy; if1_5 >> T1_5_copy;
  //  assert( T1_5_copy.is_valid(verbose) &&
 //           T1_5_copy.number_of_vertices() ==
 //           T1_5.number_of_vertices() - T1_5.number_of_hidden_vertices());
 
-//   std::ifstream if2_3("T23.triangulation"); CGAL::IO::set_ascii_mode(if2_3);
+//   std::ifstream if2_3("T23rt.triangulation"); CGAL::IO::set_ascii_mode(if2_3);
 //   Cls T2_3_copy; if2_3 >> T2_3_copy;
   // assert( T2_3_copy.is_valid(verbose) &&
 //           T2_3_copy.number_of_vertices() ==
diff --git a/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_triangulation_short_2.h b/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_triangulation_short_2.h
index 61fbb042389e..132e487bff27 100644
--- a/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_triangulation_short_2.h
+++ b/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_triangulation_short_2.h
@@ -476,22 +476,22 @@ _test_cls_triangulation_short_2( const Triangul &)
   /********************/
   /******** I/O *******/
   std::cout << "    output to a file" << std::endl;
-  std::ofstream of1_5("T15.triangulation");
+  std::ofstream of1_5("T15short.triangulation");
   CGAL::IO::set_ascii_mode(of1_5);
   of1_5 << T1_5; of1_5.close();
-  std::ofstream of2_3("T23.triangulation");
+  std::ofstream of2_3("T23short.triangulation");
   CGAL::IO::set_ascii_mode(of2_3);
   of2_3 << T2_3; of2_3.close();
 
 
   std::cout << "    input from a file" << std::endl;
 
-  std::ifstream if1_5("T15.triangulation"); CGAL::IO::set_ascii_mode(if1_5);
+  std::ifstream if1_5("T15short.triangulation"); CGAL::IO::set_ascii_mode(if1_5);
   Triangul T1_5_copy; if1_5 >> T1_5_copy;
   assert( T1_5_copy.is_valid() &&
           T1_5_copy.number_of_vertices() == T1_5.number_of_vertices() );
 
-  std::ifstream if2_3("T23.triangulation"); CGAL::IO::set_ascii_mode(if2_3);
+  std::ifstream if2_3("T23short.triangulation"); CGAL::IO::set_ascii_mode(if2_3);
   Triangul T2_3_copy; if2_3 >> T2_3_copy;
   assert( T2_3_copy.is_valid() &&
           T2_3_copy.number_of_vertices() == T2_3.number_of_vertices() );

From e610677ee20d4cf9e79c67f42a4918ea1e262012 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 2 Jan 2024 17:09:24 +0000
Subject: [PATCH 1216/1398] The same for 3D

---
 .../include/CGAL/_test_cls_delaunay_3.h       | 36 +++++++++----------
 1 file changed, 18 insertions(+), 18 deletions(-)

diff --git a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
index 78b8822f5984..6df340643f46 100644
--- a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
+++ b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
@@ -295,10 +295,10 @@ _test_cls_delaunay_3(const Triangulation &)
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
       {
-        std::ofstream oFileT1("Test1_triangulation_IO_3",std::ios::out);
+        std::ofstream oFileT1("Test1_dtriangulation_IO_3",std::ios::out);
         oFileT1 << T0 << std::endl;
       }
-      std::ifstream iFileT1("Test1_triangulation_IO_3",std::ios::in);
+      std::ifstream iFileT1("Test1_dtriangulation_IO_3",std::ios::in);
       iFileT1 >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == -1);
@@ -316,10 +316,10 @@ _test_cls_delaunay_3(const Triangulation &)
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
       {
-        std::ofstream oFileT2("Test2_triangulation_IO_3",std::ios::out);
+        std::ofstream oFileT2("Test2_dtriangulation_IO_3",std::ios::out);
         oFileT2 << T0 << std::endl;
       }
-      std::ifstream iFileT2("Test2_triangulation_IO_3",std::ios::in);
+      std::ifstream iFileT2("Test2_dtriangulation_IO_3",std::ios::in);
       iFileT2 >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 0);
@@ -338,10 +338,10 @@ _test_cls_delaunay_3(const Triangulation &)
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
       {
-        std::ofstream oFileT3("Test3_triangulation_IO_3",std::ios::out);
+        std::ofstream oFileT3("Test3_dtriangulation_IO_3",std::ios::out);
         oFileT3 << T0 << std::endl;
       }
-      std::ifstream iFileT3("Test3_triangulation_IO_3",std::ios::in);
+      std::ifstream iFileT3("Test3_dtriangulation_IO_3",std::ios::in);
       iFileT3 >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 1);
@@ -360,10 +360,10 @@ _test_cls_delaunay_3(const Triangulation &)
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
       {
-        std::ofstream oFileT4("Test4_triangulation_IO_3",std::ios::out);
+        std::ofstream oFileT4("Test4_dtriangulation_IO_3",std::ios::out);
         oFileT4 << T0;
       }
-      std::ifstream iFileT4("Test4_triangulation_IO_3",std::ios::in);
+      std::ifstream iFileT4("Test4_dtriangulation_IO_3",std::ios::in);
       iFileT4 >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 2);
@@ -382,10 +382,10 @@ _test_cls_delaunay_3(const Triangulation &)
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
       {
-        std::ofstream oFileT5("Test5_triangulation_IO_3",std::ios::out);
+        std::ofstream oFileT5("Test5_dtriangulation_IO_3",std::ios::out);
         oFileT5 << T0;
       }
-      std::ifstream iFileT5("Test5_triangulation_IO_3",std::ios::in);
+      std::ifstream iFileT5("Test5_dtriangulation_IO_3",std::ios::in);
       iFileT5 >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 3);
@@ -465,10 +465,10 @@ _test_cls_delaunay_3(const Triangulation &)
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
       {
-        std::ofstream oFileT6("Test6_triangulation_IO_3",std::ios::out);
+        std::ofstream oFileT6("Test6_dtriangulation_IO_3",std::ios::out);
         oFileT6 << T1_2;
       }
-      std::ifstream iFileT6("Test6_triangulation_IO_3",std::ios::in);
+      std::ifstream iFileT6("Test6_dtriangulation_IO_3",std::ios::in);
       iFileT6 >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 1);
@@ -512,10 +512,10 @@ _test_cls_delaunay_3(const Triangulation &)
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
       {
-        std::ofstream oFileT7("Test7_triangulation_IO_3",std::ios::out);
+        std::ofstream oFileT7("Test7_dtriangulation_IO_3",std::ios::out);
         oFileT7 << T2_0;
       }
-      std::ifstream iFileT7("Test7_triangulation_IO_3",std::ios::in);
+      std::ifstream iFileT7("Test7_dtriangulation_IO_3",std::ios::in);
       iFileT7 >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 2);
@@ -588,10 +588,10 @@ _test_cls_delaunay_3(const Triangulation &)
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
       {
-        std::ofstream oFileT8("Test8_triangulation_IO_3",std::ios::out);
+        std::ofstream oFileT8("Test8_dtriangulation_IO_3",std::ios::out);
         oFileT8 << T3_1;
       }
-      std::ifstream iFileT8("Test8_triangulation_IO_3",std::ios::in);
+      std::ifstream iFileT8("Test8_dtriangulation_IO_3",std::ios::in);
       iFileT8 >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 3);
@@ -679,10 +679,10 @@ _test_cls_delaunay_3(const Triangulation &)
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
       {
-        std::ofstream oFileT8("Test13_triangulation_IO_3",std::ios::out);
+        std::ofstream oFileT8("Test13_dtriangulation_IO_3",std::ios::out);
         oFileT8 << T3_13;
       }
-      std::ifstream iFileT8("Test13_triangulation_IO_3",std::ios::in);
+      std::ifstream iFileT8("Test13_dtriangulation_IO_3",std::ios::in);
       iFileT8 >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 3);

From 4e11df578f2158ac7e84fbb41b0fc02b3a9966a9 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 3 Jan 2024 15:10:06 +0100
Subject: [PATCH 1217/1398] Update Installation/README

---
 Installation/README    | 32 --------------------------------
 Installation/README.md | 29 +++++++++++++++++++++++++++++
 2 files changed, 29 insertions(+), 32 deletions(-)
 delete mode 100644 Installation/README
 create mode 100644 Installation/README.md

diff --git a/Installation/README b/Installation/README
deleted file mode 100644
index be07977a7c6f..000000000000
--- a/Installation/README
+++ /dev/null
@@ -1,32 +0,0 @@
-README
--------------------------------------------------------------------------------
-
-This distribution of CGAL includes:
-
-  AUTHORS          - current and former authors of CGAL
-  CHANGES          - history of changes for the library
-  CMakeLists.txt   - main script of the build system
-  INSTALL.md       - information about the installation process
-  LICENSE          - describes the license of CGAL
-  LICENSE.FREE_USE - text of the free use license (see LICENSE file)
-  LICENSE.GPL      - text of  GPL v3 license
-  LICENSE.LGPL     - text of  LGPL v3 license
-  README           - this file
-  VERSION          - version number of this release
-  auxiliary/       - directory containing miscellaneous things, currently only
-                     the icons needed for the demos on MacOS X
-  cmake/           - some scripts needed by the build system
-  config/          - some test programs used during the configuration process
-  demo/            - many demo programs for the library's various packages.
-                     These programs produce visual output (see INSTALL for
-                     prerequisites).
-  doc_html/        - documentation, e.g. the CGAL Installation Guide
-  examples/        - programs illustrating the library's functionality.
-                     These programs do not produce visual output.
-  include/         - the include files for the CGAL library (and other small
-                     external libraries as well, see the LICENSE file)
-  scripts/         - some useful scripts for CGAL programmers
-  src/             - the source code for building the CGAL libraries
-                     (as well as some external libraries, see the LICENSE file)
-
--------------------------------------------------------------------------------
diff --git a/Installation/README.md b/Installation/README.md
new file mode 100644
index 000000000000..19fe3dd963d8
--- /dev/null
+++ b/Installation/README.md
@@ -0,0 +1,29 @@
+README
+======
+
+This distribution of CGAL includes:
+
+- `AUTHORS`: current and former authors of CGAL
+- `CHANGES.md`: history of changes of CGAL
+- `CGALConfig.cmake`:
+- `CGALConfigVersion.cmake`:
+- `CMakeLists.txt`: main CMake project configuration file
+- `INSTALL.md`: information about the installation process
+- `LICENSE`: describes the license of CGAL
+- `LICENSE.BSL`: text of the Boost Software License (BSL) license
+- `LICENSE.COMMERCIAL`: text of the GeometryFactory Commercial license
+- `LICENSE.GPL`: text of the GNU General Public License (GPL) v3 license
+- `LICENSE.LGPL`: text of the GNU LESSER GENERAL PUBLIC License (LGPL) v3 license
+- `LICENSE.RFL`: text of the ETH Zurich Random Forest algorithm License (RFL) license
+- `README.md`: this file
+- `VERSION`: version number of this release of CGAL
+- `auxiliary/`: directory containing miscellaneous things, such as icons needed for the demos on macOS
+- `cmake/`: some scripts needed by the CMake build system
+- `data/`: directory containing various geometric data used by examples and demos of CGAL
+- `demo/`: many demo programs for the various packages of CGAL. These programs produce visual output.
+- `doc_html/`: documentation, e.g. the CGAL Installation Guide
+- `examples/`: programs illustrating the various packages of CGAL. These programs do not produce visual output.
+- `include/`: the include files for the CGAL library (as well as small external libraries, see the file `LICENSE`)
+- `lib/`:
+- `scripts/`: some useful scripts for CGAL programmers
+

From 24a009f93339c259ab20b14520b7171110a140db Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 3 Jan 2024 15:43:55 +0100
Subject: [PATCH 1218/1398] transform to a table, and document CMake files

---
 Installation/README.md | 49 ++++++++++++++++++++++--------------------
 1 file changed, 26 insertions(+), 23 deletions(-)

diff --git a/Installation/README.md b/Installation/README.md
index 19fe3dd963d8..47b4058ec3f7 100644
--- a/Installation/README.md
+++ b/Installation/README.md
@@ -3,27 +3,30 @@ README
 
 This distribution of CGAL includes:
 
-- `AUTHORS`: current and former authors of CGAL
-- `CHANGES.md`: history of changes of CGAL
-- `CGALConfig.cmake`:
-- `CGALConfigVersion.cmake`:
-- `CMakeLists.txt`: main CMake project configuration file
-- `INSTALL.md`: information about the installation process
-- `LICENSE`: describes the license of CGAL
-- `LICENSE.BSL`: text of the Boost Software License (BSL) license
-- `LICENSE.COMMERCIAL`: text of the GeometryFactory Commercial license
-- `LICENSE.GPL`: text of the GNU General Public License (GPL) v3 license
-- `LICENSE.LGPL`: text of the GNU LESSER GENERAL PUBLIC License (LGPL) v3 license
-- `LICENSE.RFL`: text of the ETH Zurich Random Forest algorithm License (RFL) license
-- `README.md`: this file
-- `VERSION`: version number of this release of CGAL
-- `auxiliary/`: directory containing miscellaneous things, such as icons needed for the demos on macOS
-- `cmake/`: some scripts needed by the CMake build system
-- `data/`: directory containing various geometric data used by examples and demos of CGAL
-- `demo/`: many demo programs for the various packages of CGAL. These programs produce visual output.
-- `doc_html/`: documentation, e.g. the CGAL Installation Guide
-- `examples/`: programs illustrating the various packages of CGAL. These programs do not produce visual output.
-- `include/`: the include files for the CGAL library (as well as small external libraries, see the file `LICENSE`)
-- `lib/`:
-- `scripts/`: some useful scripts for CGAL programmers
+| File or directory | Description                                                                                      |
+|-------------------|--------------------------------------------------------------------------------------------------|
+| `AUTHORS`         | current and former authors of CGAL                                                               |
+| `CHANGES.md`      | history of changes of CGAL                                                                       |
+| `CGALConfig.cmake`| [CMake package] configuration file for CGAL                                                      |
+| `CGALConfigVersion.cmake` | [CMake package] version file for CGAL                                                    |
+| `CMakeLists.txt`  | main CMake project configuration file                                                            |
+| `INSTALL.md`      | information about the installation process                                                       |
+| `LICENSE`         | describes the license of CGAL                                                                    |
+| `LICENSE.BSL`     | text of the Boost Software License (BSL) license                                                 |
+| `LICENSE.COMMERCIAL` | text of the GeometryFactory Commercial license                                                |
+| `LICENSE.GPL`     | text of the GNU General Public License (GPL) v3 license                                          |
+| `LICENSE.LGPL`    | text of the GNU Lesser General Public License (LGPL) v3 license                                  |
+| `LICENSE.RFL`     | text of the ETH Zurich Random Forest algorithm License (RFL) license                             |
+| `README.md`       | this file                                                                                        |
+| `VERSION`         | version number of this release of CGAL                                                           |
+| `auxiliary/`      | directory containing miscellaneous things, such as icons needed for the demos on macOS           |
+| `cmake/`          | some scripts needed by the CMake build system                                                    |
+| `data/`           | directory containing various geometric data used by examples and demos of CGAL                   |
+| `demo/`           | many demo programs for the various packages of CGAL. These programs produce visual output.       |
+| `doc_html/`       | documentation, such as the CGAL Installation Guide                                               |
+| `examples/`       | programs illustrating the usage of various packages of CGAL.                                     |
+| `include/`        | the include files for the CGAL library (as well as small external libraries, see the file `LICENSE`) |
+| `lib/`            | contains [CMake package] configuration files for CGAL                                            |
+| `scripts/`        | some useful scripts for CGAL programmers                                                         |
 
+[CMake package]: https://cmake.org/cmake/help/latest/manual/cmake-packages.7.html

From 00219bc0169f802fb8d4c015e2e1710df6f14b85 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 17:38:30 +0100
Subject: [PATCH 1219/1398] default arithmetic kernel when only boost mp is
 here

---
 Arithmetic_kernel/include/CGAL/Arithmetic_kernel.h       | 9 +++++++++
 .../include/CGAL/BOOST_MP_arithmetic_kernel.h            | 2 ++
 2 files changed, 11 insertions(+)

diff --git a/Arithmetic_kernel/include/CGAL/Arithmetic_kernel.h b/Arithmetic_kernel/include/CGAL/Arithmetic_kernel.h
index a01c7b70240c..335d9e19d5dc 100644
--- a/Arithmetic_kernel/include/CGAL/Arithmetic_kernel.h
+++ b/Arithmetic_kernel/include/CGAL/Arithmetic_kernel.h
@@ -59,6 +59,15 @@ typedef GMP_arithmetic_kernel Arithmetic_kernel;
 #endif // CGAL_USE_GMP
 #endif // CGAL_HAS_DEFAULT_ARITHMETIC_KERNEL
 
+#ifndef CGAL_HAS_DEFAULT_ARITHMETIC_KERNEL
+#include <CGAL/BOOST_MP_arithmetic_kernel.h>
+#if defined(CGAL_HAS_BOOST_MP_ARITHMETIC_KERNEL)
+namespace CGAL{
+typedef BOOST_cpp_arithmetic_kernel Arithmetic_kernel;
+}// namespace CGAL
+#define CGAL_HAS_DEFAULT_ARITHMETIC_KERNEL 1
+#endif // CGAL_USE_BOOST_MP
+#endif // CGAL_HAS_DEFAULT_ARITHMETIC_KERNEL
 
 // Macro to snap typedefs in Arithmetic_kernel
 #define CGAL_SNAP_ARITHMETIC_KERNEL_TYPEDEFS(AT) \
diff --git a/Arithmetic_kernel/include/CGAL/BOOST_MP_arithmetic_kernel.h b/Arithmetic_kernel/include/CGAL/BOOST_MP_arithmetic_kernel.h
index b1c1b1532e83..597e350bfd1d 100644
--- a/Arithmetic_kernel/include/CGAL/BOOST_MP_arithmetic_kernel.h
+++ b/Arithmetic_kernel/include/CGAL/BOOST_MP_arithmetic_kernel.h
@@ -25,6 +25,8 @@
 //#include <boost/multiprecision/gmp.hpp>
 //#endif
 
+#define CGAL_HAS_BOOST_MP_ARITHMETIC_KERNEL
+
 // FIXME: the could be several kernels based on Boost.Multiprecision.
 
 namespace CGAL {

From 40e624c0ae4dfbc5e6a6b8fcec86bdf584d96939 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 18:04:32 +0100
Subject: [PATCH 1220/1398] handle when LEDA is not present

---
 .../Arrangement_on_surface_2/cgal_test.cmake  | 25 +++++++++++++------
 .../cgal_test_with_cmake                      | 25 +++++++++++++------
 2 files changed, 36 insertions(+), 14 deletions(-)

diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
index 6ce6ad5b5d30..eb78143e7a9b 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
@@ -72,13 +72,24 @@ if(CGAL_DISABLE_GMP)
 endif()
 
 if(CGAL_DISABLE_GMP)
-  message(STATUS "GMP is disable. Try to use LEDA instead.")
-  set(GMPZ_NT ${LEDA_INT_NT})
-  set(QUOTIENT_CGAL_GMPZ_NT ${LEDA_RAT_NT})
-  set(CGAL_GMPQ_NT ${LEDA_RAT_NT})
-  set(LAZY_CGAL_GMPQ_NT ${LAZY_LEDA_RAT_NT})
-  set(LAZY_GMPZ_NT ${LAZY_LEDA_RAT_NT})
-  set(CGAL_GMPZ_NT ${LEDA_INT_NT})
+  message(STATUS "GMP is disable.)
+  if (CGAL_USE_LEDA)
+    message(STATUS "Try to use LEDA instead.")
+    set(GMPZ_NT ${LEDA_INT_NT})
+    set(QUOTIENT_CGAL_GMPZ_NT ${LEDA_RAT_NT})
+    set(CGAL_GMPQ_NT ${LEDA_RAT_NT})
+    set(LAZY_CGAL_GMPQ_NT ${LAZY_LEDA_RAT_NT})
+    set(LAZY_GMPZ_NT ${LAZY_LEDA_RAT_NT})
+    set(CGAL_GMPZ_NT ${LEDA_INT_NT})
+  else()
+    message(STATUS "Try to use MP float instead.")
+    set(GMPZ_NT ${MP_FLOAT_NT})
+    set(QUOTIENT_CGAL_GMPZ_NT ${QUOTIENT_MP_FLOAT_NT})
+    set(CGAL_GMPQ_NT ${QUOTIENT_MP_FLOAT_NT})
+    set(LAZY_CGAL_GMPQ_NT ${LAZY_QUOTIENT_MP_FLOAT_NT})
+    set(LAZY_GMPZ_NT ${LAZY_QUOTIENT_MP_FLOAT_NT})
+    set(CGAL_GMPZ_NT ${MP_FLOAT_NT})
+  endif()
 endif()
 
 set(COMPARE 1)
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake
index 4d62ce617774..acf5c73f486e 100755
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake
@@ -78,13 +78,24 @@ CORE_INT_NT=15
 CORE_RAT_NT=16
 
 if [ -n "${CGAL_DISABLE_GMP}" ]; then
-    echo GMP is disable. Try to use LEDA instead.
-    GMPZ_NT=$LEDA_INT_NT
-    QUOTIENT_CGAL_GMPZ_NT=$LEDA_RAT_NT
-    CGAL_GMPQ_NT=$LEDA_RAT_NT
-    LAZY_CGAL_GMPQ_NT=$LAZY_LEDA_RAT_NT
-    LAZY_GMPZ_NT=$LAZY_LEDA_RAT_NT
-    CGAL_GMPZ_NT=$LEDA_INT_NT
+    echo GMP is disable.
+    if [ -n "CGAL_USE_LEDA" ]; then
+      echo Try to use LEDA instead.
+      GMPZ_NT=$LEDA_INT_NT
+      QUOTIENT_CGAL_GMPZ_NT=$LEDA_RAT_NT
+      CGAL_GMPQ_NT=$LEDA_RAT_NT
+      LAZY_CGAL_GMPQ_NT=$LAZY_LEDA_RAT_NT
+      LAZY_GMPZ_NT=$LAZY_LEDA_RAT_NT
+      CGAL_GMPZ_NT=$LEDA_INT_NT
+    else
+      echo Try to use MP float instead.
+      GMPZ_NT=$MP_FLOAT_NT
+      QUOTIENT_CGAL_GMPZ_NT=$QUOTIENT_MP_FLOAT_NT
+      CGAL_GMPQ_NT=$QUOTIENT_MP_FLOAT_NT
+      LAZY_CGAL_GMPQ_NT=$LAZY_QUOTIENT_MP_FLOAT_NT
+      LAZY_GMPZ_NT=$LAZY_QUOTIENT_MP_FLOAT_NT
+      CGAL_GMPZ_NT=$MP_FLOAT_NT
+    fi
 fi
 
 COMPARE=1

From 4f9791a40b1ed37e06bf3d4515f201d8b7f15436 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 18:11:50 +0100
Subject: [PATCH 1221/1398] fix dependencies

---
 .../examples/Cone_spanners_2/CMakeLists.txt   | 19 ++++--------------
 .../test/Cone_spanners_2/CMakeLists.txt       | 20 +++++++++++--------
 2 files changed, 16 insertions(+), 23 deletions(-)

diff --git a/Cone_spanners_2/examples/Cone_spanners_2/CMakeLists.txt b/Cone_spanners_2/examples/Cone_spanners_2/CMakeLists.txt
index ded37dfad089..99442720fc15 100644
--- a/Cone_spanners_2/examples/Cone_spanners_2/CMakeLists.txt
+++ b/Cone_spanners_2/examples/Cone_spanners_2/CMakeLists.txt
@@ -5,21 +5,10 @@ find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Core)
 find_package(LEDA QUIET)
 
 if(CGAL_Core_FOUND OR LEDA_FOUND)
-  if(MSVC)
-    # Turn off a boost related warning that appears with VC2015
-    # boost_1_65_1\boost\graph\named_function_params.hpp(240) :
-    # warning C4172: returning address of local variable or temporary
-    set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /wd4172")
-  endif()
-
-  # create a target per cppfile
-  file(
-    GLOB cppfiles
-    RELATIVE ${CMAKE_CURRENT_SOURCE_DIR}
-    ${CMAKE_CURRENT_SOURCE_DIR}/*.cpp)
-  foreach(cppfile ${cppfiles})
-    create_single_source_cgal_program("${cppfile}")
-  endforeach()
+  create_single_source_cgal_program("compute_cones.cpp")
+  create_single_source_cgal_program("theta_io.cpp")
 else()
   message("NOTICE: This program requires the CGAL_Core library (or LEDA), and will not be compiled.")
 endif()
+
+create_single_source_cgal_program("dijkstra_theta.cpp")
diff --git a/Cone_spanners_2/test/Cone_spanners_2/CMakeLists.txt b/Cone_spanners_2/test/Cone_spanners_2/CMakeLists.txt
index 462edfc78196..17c47060a82f 100644
--- a/Cone_spanners_2/test/Cone_spanners_2/CMakeLists.txt
+++ b/Cone_spanners_2/test/Cone_spanners_2/CMakeLists.txt
@@ -5,12 +5,16 @@ cmake_minimum_required(VERSION 3.1...3.23)
 project(Cone_spanners_2_Tests)
 
 find_package(CGAL REQUIRED COMPONENTS Core)
+find_package(LEDA QUIET)
 
-# create a target per cppfile
-file(
-  GLOB cppfiles
-  RELATIVE ${CMAKE_CURRENT_SOURCE_DIR}
-  ${CMAKE_CURRENT_SOURCE_DIR}/*.cpp)
-foreach(cppfile ${cppfiles})
-  create_single_source_cgal_program("${cppfile}")
-endforeach()
+create_single_source_cgal_program("cones_inexact.cpp")
+create_single_source_cgal_program("theta_inexact.cpp")
+create_single_source_cgal_program("yao_inexact.cpp")
+
+if(CGAL_Core_FOUND OR LEDA_FOUND)
+  create_single_source_cgal_program("cones_exact.cpp")
+  create_single_source_cgal_program("theta_exact.cpp")
+  create_single_source_cgal_program("yao_exact.cpp")
+else()
+  message("NOTICE: Some tests require the CGAL_Core library (or LEDA), and will not be compiled.")
+endif()

From 82fbb895098cf584a518de972415ddaecde92942 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 18:14:47 +0100
Subject: [PATCH 1222/1398] encode LEDA/Core dependency

---
 .../Hyperbolic_triangulation_2/CMakeLists.txt |  9 +++++++--
 .../Hyperbolic_triangulation_2/CMakeLists.txt | 19 ++++++++++++-------
 2 files changed, 19 insertions(+), 9 deletions(-)

diff --git a/Hyperbolic_triangulation_2/examples/Hyperbolic_triangulation_2/CMakeLists.txt b/Hyperbolic_triangulation_2/examples/Hyperbolic_triangulation_2/CMakeLists.txt
index e5a66d697336..15433a72b16b 100644
--- a/Hyperbolic_triangulation_2/examples/Hyperbolic_triangulation_2/CMakeLists.txt
+++ b/Hyperbolic_triangulation_2/examples/Hyperbolic_triangulation_2/CMakeLists.txt
@@ -5,6 +5,11 @@ cmake_minimum_required(VERSION 3.1...3.23)
 project(Hyperbolic_triangulation_2_Examples)
 
 find_package(CGAL REQUIRED COMPONENTS Core)
+find_package(LEDA QUIET)
 
-create_single_source_cgal_program("ht2_example.cpp")
-create_single_source_cgal_program("ht2_example_color.cpp")
+if (CGAL_Core_FOUND OR LEDA_FOUND)
+  create_single_source_cgal_program("ht2_example.cpp")
+  create_single_source_cgal_program("ht2_example_color.cpp")
+else()
+  message("NOTICE: Examples require CGAL_Core (or LEDA), and will not be compiled.")
+endif()
diff --git a/Hyperbolic_triangulation_2/test/Hyperbolic_triangulation_2/CMakeLists.txt b/Hyperbolic_triangulation_2/test/Hyperbolic_triangulation_2/CMakeLists.txt
index 451ccac8d32e..b61314c788ba 100644
--- a/Hyperbolic_triangulation_2/test/Hyperbolic_triangulation_2/CMakeLists.txt
+++ b/Hyperbolic_triangulation_2/test/Hyperbolic_triangulation_2/CMakeLists.txt
@@ -5,11 +5,16 @@ cmake_minimum_required(VERSION 3.1...3.23)
 project(Hyperbolic_triangulation_2_Tests)
 
 find_package(CGAL REQUIRED COMPONENTS Core)
+find_package(LEDA QUIET)
 
-create_single_source_cgal_program("ht2_test_clear.cpp")
-create_single_source_cgal_program("ht2_test_locate.cpp")
-create_single_source_cgal_program("ht2_test_remove.cpp")
-create_single_source_cgal_program("ht2_test_swap.cpp")
-create_single_source_cgal_program("ht2_test_copy.cpp")
-create_single_source_cgal_program("ht2_test_hyperbolic_circulator.cpp")
-create_single_source_cgal_program("ht2_test_insert_degenerate.cpp")
+if (CGAL_Core_FOUND OR LEDA_FOUND)
+  create_single_source_cgal_program("ht2_test_clear.cpp")
+  create_single_source_cgal_program("ht2_test_locate.cpp")
+  create_single_source_cgal_program("ht2_test_remove.cpp")
+  create_single_source_cgal_program("ht2_test_swap.cpp")
+  create_single_source_cgal_program("ht2_test_copy.cpp")
+  create_single_source_cgal_program("ht2_test_hyperbolic_circulator.cpp")
+  create_single_source_cgal_program("ht2_test_insert_degenerate.cpp")
+else()
+  message("NOTICE: Tests require CGAL_Core (or LEDA), and will not be compiled.")
+endif()

From 3a8ced2ec99b6e14d5487d60bb0407ed06938a31 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 18:18:42 +0100
Subject: [PATCH 1223/1398] skip if neither core nor leda are present

---
 Kernel_23/test/Kernel_23/test_Has_conversion.cpp | 9 ++++++++-
 1 file changed, 8 insertions(+), 1 deletion(-)

diff --git a/Kernel_23/test/Kernel_23/test_Has_conversion.cpp b/Kernel_23/test/Kernel_23/test_Has_conversion.cpp
index c6f393a502d1..2ef8186000aa 100644
--- a/Kernel_23/test/Kernel_23/test_Has_conversion.cpp
+++ b/Kernel_23/test/Kernel_23/test_Has_conversion.cpp
@@ -14,7 +14,9 @@
 
 #include <CGAL/Simple_cartesian.h>
 #include <CGAL/Simple_homogeneous.h>
+#if defined(CGAL_USE_CORE) || defined(CGAL_USE_LEDA)
 #include <CGAL/Exact_predicates_exact_constructions_kernel_with_kth_root.h>
+#endif
 #include <CGAL/Filtered_kernel.h>
 
 #include <CGAL/Has_conversion.h>
@@ -36,13 +38,16 @@ int main()
   typedef CGAL::Simple_homogeneous<NT_exact>                      SH;
   typedef CGAL::Filtered_kernel<SH>                               FSH;
 
+#if defined(CGAL_USE_CORE) || defined(CGAL_USE_LEDA)
   typedef CGAL::Exact_predicates_exact_constructions_kernel_with_kth_root EPECK;
+  CGAL_USE_TYPE(EPECK);
+#endif
 
   CGAL_USE_TYPE(ASC);
   CGAL_USE_TYPE(FSC);
   CGAL_USE_TYPE(SH);
   CGAL_USE_TYPE(FSH);
-  CGAL_USE_TYPE(EPECK);
+
 
   assert((CGAL::Has_conversion<SC, SC, SC::Point_2, SC::Point_2>::value));
   assert((CGAL::Has_conversion<SC, SC, SC::Object_2, SC::Object_2>::value));
@@ -55,10 +60,12 @@ int main()
   assert((CGAL::Has_conversion<SH, FSH, SH::Vector_3, FSH::Vector_3>::value));
 
   assert((CGAL::Has_conversion<SC, ASC, SC::Sphere_3, ASC::Sphere_3>::value));
+#if defined(CGAL_USE_CORE) || defined(CGAL_USE_LEDA)
   assert((CGAL::Has_conversion<SC, EPECK, SC::Triangle_2, EPECK::Triangle_2>::value));
   assert((CGAL::Has_conversion<EPECK, SC, EPECK::Circle_3, SC::Circle_3>::value));
 
   assert(!(CGAL::Has_conversion<SC, EPECK, SC::Weighted_point_2, EPECK::Weighted_point_3>::value));
+#endif
   assert(!(CGAL::Has_conversion<SC, ASC, SC::Point_2, ASC::Weighted_point_2>::value));
 
   // below will produce static assert failures

From 6decd7abfcd4ffb70854abd34f2b1e8a53e32d83 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 18:21:57 +0100
Subject: [PATCH 1224/1398] use exact integer

---
 Nef_S2/test/Nef_S2/Nef_polyhedron_S2-test.cpp | 9 ++-------
 1 file changed, 2 insertions(+), 7 deletions(-)

diff --git a/Nef_S2/test/Nef_S2/Nef_polyhedron_S2-test.cpp b/Nef_S2/test/Nef_S2/Nef_polyhedron_S2-test.cpp
index e429bab74f2c..0a63acc5c5c0 100644
--- a/Nef_S2/test/Nef_S2/Nef_polyhedron_S2-test.cpp
+++ b/Nef_S2/test/Nef_S2/Nef_polyhedron_S2-test.cpp
@@ -1,14 +1,9 @@
 #include <CGAL/Homogeneous.h>
 #include <CGAL/Nef_polyhedron_S2.h>
 #include <CGAL/test_macros.h>
+#include <CGAL/Exact_integer.h>
 
-#ifdef CGAL_USE_LEDA
-#include <CGAL/leda_integer.h>
-typedef leda_integer NT;
-#else
-#include <CGAL/Gmpz.h>
-typedef CGAL::Gmpz NT;
-#endif
+typedef CGAL::Exact_integer NT;
 
 typedef CGAL::Homogeneous<NT> Kernel;
 typedef CGAL::Nef_polyhedron_S2<Kernel> Nef_polyhedron;

From ed3539f5fe1f3b3d3f76a5d4e4f4b4426d71036d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 18:33:54 +0100
Subject: [PATCH 1225/1398] add missing includes

---
 Number_types/test/Number_types/to_interval_test.cpp | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/Number_types/test/Number_types/to_interval_test.cpp b/Number_types/test/Number_types/to_interval_test.cpp
index 59752059bf61..553199db0a09 100644
--- a/Number_types/test/Number_types/to_interval_test.cpp
+++ b/Number_types/test/Number_types/to_interval_test.cpp
@@ -16,6 +16,11 @@
 #include <CGAL/Gmpz.h>
 #endif
 
+
+#include <CGAL/float.h>
+#include <CGAL/double.h>
+#include <CGAL/int.h>
+
 #if 0
 #ifdef CGAL_USE_CLN
 #include <CGAL/CLN/cl_integer.h>

From 1b0447eab7c66e5871ec9858df963d7450e812f5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 18:36:34 +0100
Subject: [PATCH 1226/1398] EPECK_with_sqrt is actually disabled

---
 .../Polygon_mesh_processing/pmp_compute_normals_test.cpp  | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp
index 88a70ee95c09..ef45266f71d4 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp
@@ -15,10 +15,10 @@
 #include <fstream>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel          EPICK;
-typedef CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt  EPECK;
+//typedef CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt  EPECK;
 
 typedef CGAL::Surface_mesh<EPICK::Point_3>                           EPICK_SM;
-typedef CGAL::Surface_mesh<EPECK::Point_3>                           EPECK_SM;
+//typedef CGAL::Surface_mesh<EPECK::Point_3>                           EPECK_SM;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
@@ -100,8 +100,8 @@ void test(const Mesh& mesh,
     {
       if (PMP::is_degenerate_triangle_face(f, mesh))
       {
-        if (std::is_same<K, EPECK>())
-          assert(get(fnormals, f) == CGAL::NULL_VECTOR);
+//        if (std::is_same<K, EPECK>())
+//          assert(get(fnormals, f) == CGAL::NULL_VECTOR);
       }
       else
         assert(get(fnormals, f) != CGAL::NULL_VECTOR);

From a10f7948319cefb04edf9eadbe1b597ae08ce933 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 18:45:14 +0100
Subject: [PATCH 1227/1398] encode CORE/LEDA dependency

---
 .../Straight_skeleton_2/extrude_skeleton.cpp  |  2 +-
 .../test/Straight_skeleton_2/CMakeLists.txt   | 35 ++++++++++++-------
 2 files changed, 24 insertions(+), 13 deletions(-)

diff --git a/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp b/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp
index cc73aa7493b5..6fb5ad59dd43 100644
--- a/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp
+++ b/Straight_skeleton_2/examples/Straight_skeleton_2/extrude_skeleton.cpp
@@ -1,6 +1,6 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h>
+//#include <CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h>
 #include <CGAL/Surface_mesh.h>
 
 #include <CGAL/draw_straight_skeleton_2.h>
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt b/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt
index 6138c50d054d..ed7ce5a1282e 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt
@@ -5,23 +5,34 @@ cmake_minimum_required(VERSION 3.1...3.23)
 project(Straight_skeleton_2_Tests)
 
 find_package(CGAL REQUIRED COMPONENTS Qt6 Core)
+find_package(LEDA QUIET)
 
 include_directories(BEFORE "include")
 
-# create a target per cppfile
-file(
-  GLOB cppfiles
-  RELATIVE ${CMAKE_CURRENT_SOURCE_DIR}
-  ${CMAKE_CURRENT_SOURCE_DIR}/*.cpp)
-foreach(cppfile ${cppfiles})
-  create_single_source_cgal_program("${cppfile}")
-endforeach()
+create_single_source_cgal_program("issue4533.cpp")")
+create_single_source_cgal_program("issue4684.cpp")
+create_single_source_cgal_program("test_sls.cpp")
+create_single_source_cgal_program("test_sls_previous_issues.cpp")
+create_single_source_cgal_program("test_sls_traits.cpp")
+create_single_source_cgal_program("test_straight_skeleton_copy.cpp")
 
 if(CGAL_Qt6_FOUND)
   target_link_libraries(issue4684 PUBLIC CGAL::CGAL_Basic_viewer)
-  target_link_libraries(issue7149 PUBLIC CGAL::CGAL_Basic_viewer)
-  target_link_libraries(issue7284 PUBLIC CGAL::CGAL_Basic_viewer)
   target_link_libraries(test_sls_previous_issues PUBLIC CGAL::CGAL_Basic_viewer)
-  target_link_libraries(test_sls_offset PUBLIC CGAL::CGAL_Basic_viewer)
-  target_link_libraries(test_sls_weighted_polygons_with_holes PUBLIC CGAL::CGAL_Basic_viewer)
+endif()
+
+if (CGAL_Core_FOUND OR LEDA_FOUND)
+  create_single_source_cgal_program("test_sls_offset.cpp")
+  create_single_source_cgal_program("issue7284.cpp")
+  create_single_source_cgal_program("test_sls_simple.cpp")
+  create_single_source_cgal_program("test_sls_weighted_polygons_with_holes.cpp")
+  create_single_source_cgal_program("issue7149.cpp")
+  if(CGAL_Qt6_FOUND)
+    target_link_libraries(issue7149 PUBLIC CGAL::CGAL_Basic_viewer)
+    target_link_libraries(issue7284 PUBLIC CGAL::CGAL_Basic_viewer)
+    target_link_libraries(test_sls_offset PUBLIC CGAL::CGAL_Basic_viewer)
+    target_link_libraries(test_sls_weighted_polygons_with_holes PUBLIC CGAL::CGAL_Basic_viewer)
+  endif()
+else()
+  message("NOTICE: Some test require CGAL_Core (or LEDA), and will not be compiled.")
 endif()

From 8c17676886e549d3f4a79dea86386c77d0d42ac1 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 18:47:23 +0100
Subject: [PATCH 1228/1398] test requires Core or Leda

---
 .../CMakeLists.txt                            | 19 ++++++++-----------
 1 file changed, 8 insertions(+), 11 deletions(-)

diff --git a/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/CMakeLists.txt b/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/CMakeLists.txt
index 8dd920fdf64f..bfc26d7ea208 100644
--- a/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/CMakeLists.txt
+++ b/Straight_skeleton_extrusion_2/test/Straight_skeleton_extrusion_2/CMakeLists.txt
@@ -5,18 +5,15 @@ cmake_minimum_required(VERSION 3.1...3.23)
 project(Straight_skeleton_extrusion_2_Tests)
 
 find_package(CGAL REQUIRED COMPONENTS Qt6 Core)
+find_package(LEDA QUIET)
 
 include_directories(BEFORE "include")
 
-# create a target per cppfile
-file(
-  GLOB cppfiles
-  RELATIVE ${CMAKE_CURRENT_SOURCE_DIR}
-  ${CMAKE_CURRENT_SOURCE_DIR}/*.cpp)
-foreach(cppfile ${cppfiles})
-  create_single_source_cgal_program("${cppfile}")
-endforeach()
-
-if(CGAL_Qt6_FOUND)
-  target_link_libraries(test_sls_extrude PUBLIC CGAL::CGAL_Basic_viewer)
+if (CGAL_Core_FOUND OR LEDA_FOUND)
+  create_single_source_cgal_program("test_sls_extrude.cpp")
+  if(CGAL_Qt6_FOUND)
+    target_link_libraries(test_sls_extrude PUBLIC CGAL::CGAL_Basic_viewer)
+  endif()
+else()
+  message("NOTICE: Tests require CGAL_Core (or LEDA), and will not be compiled.")
 endif()

From dcc3617c088ffe496e40b8094a0105d66bae1c05 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 18:50:34 +0100
Subject: [PATCH 1229/1398] a test and an example requires Leda or Core

---
 .../examples/Triangulation_on_sphere_2/CMakeLists.txt     | 8 +++++++-
 .../test/Triangulation_on_sphere_2/CMakeLists.txt         | 8 +++++++-
 2 files changed, 14 insertions(+), 2 deletions(-)

diff --git a/Triangulation_on_sphere_2/examples/Triangulation_on_sphere_2/CMakeLists.txt b/Triangulation_on_sphere_2/examples/Triangulation_on_sphere_2/CMakeLists.txt
index 3d3d7367f53a..65ed31daad13 100644
--- a/Triangulation_on_sphere_2/examples/Triangulation_on_sphere_2/CMakeLists.txt
+++ b/Triangulation_on_sphere_2/examples/Triangulation_on_sphere_2/CMakeLists.txt
@@ -3,9 +3,15 @@ cmake_minimum_required(VERSION 3.1...3.23)
 project( Triangulation_on_sphere_2_Examples )
 
 find_package(CGAL REQUIRED COMPONENTS Core)
+find_package(LEDA QUIET)
 
 create_single_source_cgal_program( "triang_on_sphere.cpp" )
 create_single_source_cgal_program( "triang_on_sphere_range.cpp" )
-create_single_source_cgal_program( "triang_on_sphere_exact.cpp" )
 create_single_source_cgal_program( "triang_on_sphere_proj.cpp" )
 create_single_source_cgal_program( "triang_on_sphere_geo.cpp" )
+
+if (CGAL_Core_FOUND OR LEDA_FOUND)
+  create_single_source_cgal_program( "triang_on_sphere_exact.cpp" )
+else()
+  message("NOTICE: Some tests require CGAL_Core (or LEDA), and will not be compiled.")
+endif()
diff --git a/Triangulation_on_sphere_2/test/Triangulation_on_sphere_2/CMakeLists.txt b/Triangulation_on_sphere_2/test/Triangulation_on_sphere_2/CMakeLists.txt
index 6e26394bee1f..0353327dfbe4 100644
--- a/Triangulation_on_sphere_2/test/Triangulation_on_sphere_2/CMakeLists.txt
+++ b/Triangulation_on_sphere_2/test/Triangulation_on_sphere_2/CMakeLists.txt
@@ -3,14 +3,20 @@ cmake_minimum_required(VERSION 3.1...3.23)
 project( Triangulation_on_sphere_2_Tests )
 
 find_package(CGAL REQUIRED COMPONENTS Core)
+find_package(LEDA QUIET)
 
 create_single_source_cgal_program( "test_dtos.cpp" )
 create_single_source_cgal_program( "test_dtos2_remove.cpp" )
-create_single_source_cgal_program( "test_dtos_degenerate_cases.cpp" )
 create_single_source_cgal_program( "test_dtos_illegal_points.cpp" )
 create_single_source_cgal_program( "test_dtos_projection_traits.cpp" )
 create_single_source_cgal_program( "test_dtos_traits.cpp" )
 
+if (CGAL_Core_FOUND OR LEDA_FOUND)
+  create_single_source_cgal_program( "test_dtos_degenerate_cases.cpp" )
+else()
+  message("NOTICE: Some tests require CGAL_Core (or LEDA), and will not be compiled.")
+endif()
+
 find_package(Eigen3 3.1.0 QUIET) #(requires 3.1.0 or greater)
 include(CGAL_Eigen3_support)
 if(TARGET CGAL::Eigen3_support)

From ded0e2b5e8774b8c17a681144376aa36496e974c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 3 Jan 2024 18:57:05 +0100
Subject: [PATCH 1230/1398] typos

---
 .../test/Arrangement_on_surface_2/cgal_test.cmake               | 2 +-
 Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt     | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
index eb78143e7a9b..80d8fcf3fa98 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
@@ -72,7 +72,7 @@ if(CGAL_DISABLE_GMP)
 endif()
 
 if(CGAL_DISABLE_GMP)
-  message(STATUS "GMP is disable.)
+  message(STATUS "GMP is disable.")
   if (CGAL_USE_LEDA)
     message(STATUS "Try to use LEDA instead.")
     set(GMPZ_NT ${LEDA_INT_NT})
diff --git a/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt b/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt
index ed7ce5a1282e..20fdb058a7bb 100644
--- a/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt
+++ b/Straight_skeleton_2/test/Straight_skeleton_2/CMakeLists.txt
@@ -9,7 +9,7 @@ find_package(LEDA QUIET)
 
 include_directories(BEFORE "include")
 
-create_single_source_cgal_program("issue4533.cpp")")
+create_single_source_cgal_program("issue4533.cpp")
 create_single_source_cgal_program("issue4684.cpp")
 create_single_source_cgal_program("test_sls.cpp")
 create_single_source_cgal_program("test_sls_previous_issues.cpp")

From d8ee730a4dae1f909708d51ff496958fd96840ca Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 09:58:55 +0100
Subject: [PATCH 1231/1398] Revert "default arithmetic kernel when only boost
 mp is here"

This reverts commit 00219bc0169f802fb8d4c015e2e1710df6f14b85.
---
 Arithmetic_kernel/include/CGAL/Arithmetic_kernel.h       | 9 ---------
 .../include/CGAL/BOOST_MP_arithmetic_kernel.h            | 2 --
 2 files changed, 11 deletions(-)

diff --git a/Arithmetic_kernel/include/CGAL/Arithmetic_kernel.h b/Arithmetic_kernel/include/CGAL/Arithmetic_kernel.h
index 335d9e19d5dc..a01c7b70240c 100644
--- a/Arithmetic_kernel/include/CGAL/Arithmetic_kernel.h
+++ b/Arithmetic_kernel/include/CGAL/Arithmetic_kernel.h
@@ -59,15 +59,6 @@ typedef GMP_arithmetic_kernel Arithmetic_kernel;
 #endif // CGAL_USE_GMP
 #endif // CGAL_HAS_DEFAULT_ARITHMETIC_KERNEL
 
-#ifndef CGAL_HAS_DEFAULT_ARITHMETIC_KERNEL
-#include <CGAL/BOOST_MP_arithmetic_kernel.h>
-#if defined(CGAL_HAS_BOOST_MP_ARITHMETIC_KERNEL)
-namespace CGAL{
-typedef BOOST_cpp_arithmetic_kernel Arithmetic_kernel;
-}// namespace CGAL
-#define CGAL_HAS_DEFAULT_ARITHMETIC_KERNEL 1
-#endif // CGAL_USE_BOOST_MP
-#endif // CGAL_HAS_DEFAULT_ARITHMETIC_KERNEL
 
 // Macro to snap typedefs in Arithmetic_kernel
 #define CGAL_SNAP_ARITHMETIC_KERNEL_TYPEDEFS(AT) \
diff --git a/Arithmetic_kernel/include/CGAL/BOOST_MP_arithmetic_kernel.h b/Arithmetic_kernel/include/CGAL/BOOST_MP_arithmetic_kernel.h
index 597e350bfd1d..b1c1b1532e83 100644
--- a/Arithmetic_kernel/include/CGAL/BOOST_MP_arithmetic_kernel.h
+++ b/Arithmetic_kernel/include/CGAL/BOOST_MP_arithmetic_kernel.h
@@ -25,8 +25,6 @@
 //#include <boost/multiprecision/gmp.hpp>
 //#endif
 
-#define CGAL_HAS_BOOST_MP_ARITHMETIC_KERNEL
-
 // FIXME: the could be several kernels based on Boost.Multiprecision.
 
 namespace CGAL {

From 1d7cd990f9f3ed1c6cb6a7041e1685814c651e71 Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 10:15:03 +0100
Subject: [PATCH 1232/1398] more fixes when neither Core nor Leda is present

---
 Cone_spanners_2/include/CGAL/Compute_cone_boundaries_2.h      | 4 ++--
 .../include/CGAL/Cone_spanners_2/Less_by_direction_2.h        | 1 -
 2 files changed, 2 insertions(+), 3 deletions(-)

diff --git a/Cone_spanners_2/include/CGAL/Compute_cone_boundaries_2.h b/Cone_spanners_2/include/CGAL/Compute_cone_boundaries_2.h
index 74e12a8f4db3..7e820e12a761 100644
--- a/Cone_spanners_2/include/CGAL/Compute_cone_boundaries_2.h
+++ b/Cone_spanners_2/include/CGAL/Compute_cone_boundaries_2.h
@@ -30,7 +30,6 @@
 #include <CGAL/Polynomial.h>
 #include <CGAL/number_type_config.h>    // CGAL_PI is defined there
 #include <CGAL/enum.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel_with_root_of.h>
 #include <CGAL/Aff_transformation_2.h>
 
 namespace CGAL {
@@ -111,7 +110,7 @@ class Compute_cone_boundaries_2 {
 
 };
 
-
+#if defined(CGAL_USE_LEDA) || defined(CGAL_USE_CORE)
 /*
  The specialised functor for computing the directions of cone boundaries exactly
  with a given cone number and a given initial direction.
@@ -209,6 +208,7 @@ class Compute_cone_boundaries_2<Exact_predicates_exact_constructions_kernel_with
 
     }   // end of operator()
 };      // end of functor specialization: Compute_cone_..._2
+#endif
 
 }  // namespace CGAL
 
diff --git a/Cone_spanners_2/include/CGAL/Cone_spanners_2/Less_by_direction_2.h b/Cone_spanners_2/include/CGAL/Cone_spanners_2/Less_by_direction_2.h
index 6ba9f53652ea..e36137df8fb3 100644
--- a/Cone_spanners_2/include/CGAL/Cone_spanners_2/Less_by_direction_2.h
+++ b/Cone_spanners_2/include/CGAL/Cone_spanners_2/Less_by_direction_2.h
@@ -22,7 +22,6 @@
 #include <CGAL/Polynomial.h>
 #include <CGAL/number_utils.h>
 #include <CGAL/enum.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h>
 #include <CGAL/Aff_transformation_2.h>
 
 #include <boost/config.hpp>

From c984905745905627507f62c1aa050483d778c685 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 4 Jan 2024 09:17:40 +0000
Subject: [PATCH 1233/1398] Image_IO: sprintf -> snprintf

---
 .../include/CGAL/ImageIO/analyze_impl.h       | 91 +++++++++++--------
 CGAL_ImageIO/include/CGAL/ImageIO/gis_impl.h  | 24 ++---
 CGAL_ImageIO/include/CGAL/ImageIO/inr_impl.h  | 16 ++--
 .../include/CGAL/ImageIO/mincio_impl.h        |  2 +-
 CGAL_ImageIO/include/CGAL/ImageIO/pnm_impl.h  | 25 +++--
 5 files changed, 87 insertions(+), 71 deletions(-)

diff --git a/CGAL_ImageIO/include/CGAL/ImageIO/analyze_impl.h b/CGAL_ImageIO/include/CGAL/ImageIO/analyze_impl.h
index 1c326b6fa1f4..c68ee7c32986 100644
--- a/CGAL_ImageIO/include/CGAL/ImageIO/analyze_impl.h
+++ b/CGAL_ImageIO/include/CGAL/ImageIO/analyze_impl.h
@@ -463,60 +463,79 @@ int _readAnalyzeHeader( _image* im, const char* name,
       for ( i=0; i<im->nuser; i++ ) im->user[i] = nullptr;
       i = 0 ;
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("Data lost in the Analyze -> ImageIO conversion:") + 1));
-      sprintf( im->user[i++], "Data lost in the Analyze -> ImageIO conversion:" );
+      size_t buffer_size;
+      buffer_size = strlen("Data lost in the Analyze -> ImageIO conversion:") + 1;
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "Data lost in the Analyze -> ImageIO conversion:" );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  descrip: ") + 1 + strlen(analyzeHeader->hist.descrip) ));
-      sprintf( im->user[i++], "  descrip: %s", analyzeHeader->hist.descrip );
+      buffer_size = strlen("  descrip: ") + 1 + strlen(analyzeHeader->hist.descrip);
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  descrip: %s", analyzeHeader->hist.descrip );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  aux_file: ") + 1 + strlen(analyzeHeader->hist.descrip) ));
-      sprintf( im->user[i++], "  aux_file: %s", analyzeHeader->hist.descrip );
+      buffer_size = strlen("  aux_file: ") + 1 + strlen(analyzeHeader->hist.descrip);
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  aux_file: %s", analyzeHeader->hist.descrip );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  orient: ") + 1+ 2));
-      sprintf( im->user[i++], "  orient: %d", analyzeHeader->hist.orient );
+      buffer_size = strlen("  orient: ") + 1+ 2;
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  orient: %d", analyzeHeader->hist.orient );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  originator: ") + 1 + strlen(analyzeHeader->hist.originator) ));
-      sprintf( im->user[i++], "  originator: %s", analyzeHeader->hist.originator );
+      buffer_size = strlen("  originator: ") + 1 + strlen(analyzeHeader->hist.originator);
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  originator: %s", analyzeHeader->hist.originator );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  generated: ") + 1 + strlen(analyzeHeader->hist.generated) ));
-      sprintf( im->user[i++], "  generated: %s", analyzeHeader->hist.generated );
+      buffer_size = strlen("  generated: ") + 1 + strlen(analyzeHeader->hist.generated);
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  generated: %s", analyzeHeader->hist.generated );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  scannum: ") + 1 + strlen(analyzeHeader->hist.scannum) ));
-      sprintf( im->user[i++], "  scannum: %s", analyzeHeader->hist.scannum );
+      buffer_size = strlen("  scannum: ") + 1 + strlen(analyzeHeader->hist.scannum);
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  scannum: %s", analyzeHeader->hist.scannum );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  patient_id: ") + 1 + strlen(analyzeHeader->hist.patient_id) ));
-      sprintf( im->user[i++], "  patient_id: %s", analyzeHeader->hist.patient_id );
+      buffer_size = strlen("  patient_id: ") + 1 + strlen(analyzeHeader->hist.patient_id);
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  patient_id: %s", analyzeHeader->hist.patient_id );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  exp_date: ") + 1 + strlen(analyzeHeader->hist.exp_date) ));
-      sprintf( im->user[i++], "  exp_date: %s", analyzeHeader->hist.exp_date );
+      buffer_size = strlen("  exp_date: ") + 1 + strlen(analyzeHeader->hist.exp_date);
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  exp_date: %s", analyzeHeader->hist.exp_date );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  exp_time: ") + 1 + strlen(analyzeHeader->hist.exp_time) ));
-      sprintf( im->user[i++], "  exp_time: %s", analyzeHeader->hist.exp_time );
+      buffer_size = strlen("  exp_time: ") + 1 + strlen(analyzeHeader->hist.exp_time);
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  exp_time: %s", analyzeHeader->hist.exp_time );
 
+      buffer_size = strlen("  views: ") + 11 + 1;
       /* A 32 bit int doesn't print on more than 11 chars */
-      im->user[i] = (char *) ImageIO_alloc((strlen("  views: ") + 11 + 1));
-      sprintf( im->user[i++], "  views: %d", analyzeHeader->hist.views );
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  views: %d", analyzeHeader->hist.views );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  vols_added: ") + 11 + 1));
-      sprintf( im->user[i++], "  vols_added: %d", analyzeHeader->hist.vols_added );
+      buffer_size = strlen("  vols_added: ") + 11 + 1;
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  vols_added: %d", analyzeHeader->hist.vols_added );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  start_field: ") + 11 + 1));
-      sprintf( im->user[i++], "  start_field: %d", analyzeHeader->hist.start_field );
+      buffer_size = strlen("  start_field: ") + 11 + 1;
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  start_field: %d", analyzeHeader->hist.start_field );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  field_skip: ") + 11 + 1));
-      sprintf( im->user[i++], "  field_skip: %d", analyzeHeader->hist.field_skip );
+      buffer_size = strlen("  field_skip: ") + 11 + 1;
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  field_skip: %d", analyzeHeader->hist.field_skip );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  omax: ") + 11 + 1));
-      sprintf( im->user[i++], "  omax: %d", analyzeHeader->hist.omax );
+      buffer_size = strlen("  omax: ") + 11 + 1;
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  omax: %d", analyzeHeader->hist.omax );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  omin: ") + 11 + 1));
-      sprintf( im->user[i++], "  omin: %d", analyzeHeader->hist.omin );
+      buffer_size = strlen("  omin: ") + 11 + 1;
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  omin: %d", analyzeHeader->hist.omin );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  smax: ") + 11 + 1));
-      sprintf( im->user[i++], "  smax: %d", analyzeHeader->hist.smax );
+      buffer_size = strlen("  smax: ") + 11 + 1;
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  smax: %d", analyzeHeader->hist.smax );
 
-      im->user[i] = (char *) ImageIO_alloc((strlen("  smin: ") + 11 + 1));
-      sprintf( im->user[i++], "  smin: %d", analyzeHeader->hist.smin );
+      buffer_size = strlen("  smin: ") + 11 + 1;
+      im->user[i] = (char *) ImageIO_alloc(buffer_size);
+      snprintf( im->user[i++], buffer_size, "  smin: %d", analyzeHeader->hist.smin );
 
 
       /* header is read. close header file and open data file. */
diff --git a/CGAL_ImageIO/include/CGAL/ImageIO/gis_impl.h b/CGAL_ImageIO/include/CGAL/ImageIO/gis_impl.h
index e2d9b5b28186..f9c590dd5a7a 100644
--- a/CGAL_ImageIO/include/CGAL/ImageIO/gis_impl.h
+++ b/CGAL_ImageIO/include/CGAL/ImageIO/gis_impl.h
@@ -130,10 +130,10 @@ int writeGis( char *name, _image* im) {
             do {
               memset( str, 0, _LGTH_STRING_ );
               for ( j=0; j<n && i<size; j++, i++ ) {
-                sprintf( str+strlen(str), "%d", theBuf[i] );
-                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
+                snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "%d", theBuf[i] );
+                if ( j<n && i<size ) snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), " " );
               }
-              sprintf( str+strlen(str), "\n" );
+              snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "\n" );
               done = ImageIO_write( im, str, strlen( str )  );
               res = (done == strlen( str )) ? int(done) : -1;
               if ( res  <= 0 ) {
@@ -150,10 +150,10 @@ int writeGis( char *name, _image* im) {
             do {
               memset( str, 0, _LGTH_STRING_ );
               for ( j=0; j<n && i<size; j++, i++ ) {
-                sprintf( str+strlen(str), "%d", theBuf[i] );
-                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
+                snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "%d", theBuf[i] );
+                if ( j<n && i<size ) snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), " " );
               }
-              sprintf( str+strlen(str), "\n" );
+              snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "\n" );
               done = ImageIO_write( im, str, strlen( str )  );
               res = (done == strlen( str )) ? int(done) : -1;
               if ( res  <= 0 ) {
@@ -178,10 +178,10 @@ int writeGis( char *name, _image* im) {
             do {
               memset( str, 0, _LGTH_STRING_ );
               for ( j=0; j<n && i<size; j++, i++ ) {
-                sprintf( str+strlen(str), "%d", theBuf[i] );
-                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
+                snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "%d", theBuf[i] );
+                if ( j<n && i<size ) snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), " " );
               }
-              sprintf( str+strlen(str), "\n" );
+              snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "\n" );
               done = ImageIO_write( im, str, strlen( str )  );
               res = (done == strlen( str )) ? int(done) : -1;
               if ( res  <= 0 ) {
@@ -198,10 +198,10 @@ int writeGis( char *name, _image* im) {
             do {
               memset( str, 0, _LGTH_STRING_ );
               for ( j=0; j<n && i<size; j++, i++ ) {
-                sprintf( str+strlen(str), "%d", theBuf[i] );
-                if ( j<n && i<size ) sprintf( str+strlen(str), " " );
+                snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "%d", theBuf[i] );
+                if ( j<n && i<size ) snprintf( str+strlen(str),_LGTH_STRING_ - strlen(str), " " );
               }
-              sprintf( str+strlen(str), "\n" );
+              snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "\n" );
               done = ImageIO_write( im, str, strlen( str )  );
               res = (done == strlen( str )) ? int(done) : -1;
               if ( res  <= 0 ) {
diff --git a/CGAL_ImageIO/include/CGAL/ImageIO/inr_impl.h b/CGAL_ImageIO/include/CGAL/ImageIO/inr_impl.h
index b33fe2c1af82..5183005ea842 100644
--- a/CGAL_ImageIO/include/CGAL/ImageIO/inr_impl.h
+++ b/CGAL_ImageIO/include/CGAL/ImageIO/inr_impl.h
@@ -77,22 +77,22 @@ int _writeInrimageHeader(const _image *im, ENDIANNESS end) {
     switch(im->wordKind) {
 
     case WK_FLOAT:
-      sprintf(type, "float");
+      snprintf(type, 30, "float");
       scale[0] = '\0';
       break;
 
     case WK_FIXED:
       switch(im->sign) {
       case SGN_SIGNED:
-        sprintf(type, "signed fixed");
+        snprintf(type, 30, "signed fixed");
         break;
       case SGN_UNSIGNED:
-        sprintf(type, "unsigned fixed");
+        snprintf(type, 30, "unsigned fixed");
         break;
       default:
         return -1;
       }
-      sprintf(scale, "SCALE=2**0\n");
+      snprintf(scale, 20, "SCALE=2**0\n");
       break;
 
     default:
@@ -101,17 +101,17 @@ int _writeInrimageHeader(const _image *im, ENDIANNESS end) {
 
     switch(end) {
     case END_LITTLE:
-      sprintf(endianness, "decm");
+      snprintf(endianness, 5, "decm");
       break;
     case END_BIG:
-      sprintf(endianness, "sun");
+      snprintf(endianness, 5, "sun");
       break;
     default:
       /* fix architecture endianness */
       if( _getEndianness() == END_LITTLE)
-        sprintf(endianness, "decm");
+        snprintf(endianness, 5, "decm");
       else
-        sprintf(endianness, "sun");
+        snprintf(endianness, 5, "sun");
       break;
     }
 
diff --git a/CGAL_ImageIO/include/CGAL/ImageIO/mincio_impl.h b/CGAL_ImageIO/include/CGAL/ImageIO/mincio_impl.h
index cd701bb2e893..5addca29f1e1 100644
--- a/CGAL_ImageIO/include/CGAL/ImageIO/mincio_impl.h
+++ b/CGAL_ImageIO/include/CGAL/ImageIO/mincio_impl.h
@@ -357,7 +357,7 @@ int writeMincFile( const _image* im, const char *filename,
         strcat(newname, filename + i + 1);
       }
       else
-        sprintf(newname, "#TMP#%s", filename);
+        snprintf(newname,strlen(filename) + 10, "#TMP#%s", filename);
     }
   }
 
diff --git a/CGAL_ImageIO/include/CGAL/ImageIO/pnm_impl.h b/CGAL_ImageIO/include/CGAL/ImageIO/pnm_impl.h
index 1298dd4e84a8..ceb9d7ff68a2 100644
--- a/CGAL_ImageIO/include/CGAL/ImageIO/pnm_impl.h
+++ b/CGAL_ImageIO/include/CGAL/ImageIO/pnm_impl.h
@@ -524,14 +524,14 @@ int writePgmImage(char *name,_image *im  )
   }
 
   if ( im->dataMode == DM_ASCII )
-    sprintf( string, "%s\n", PGM_ASCII_MAGIC );
+    snprintf( string, 256, "%s\n", PGM_ASCII_MAGIC );
   else
-    sprintf( string, "%s\n", PGM_MAGIC );
+    snprintf( string, 256, "%s\n", PGM_MAGIC );
 
   ImageIO_write( im, string, strlen( string ) );
-  sprintf( string, "# CREATOR: pnm.c $Revision$ $Date$\n" );
+  snprintf( string, 256, "# CREATOR: pnm.c $Revision$ $Date$\n" );
   ImageIO_write( im, string, strlen( string ) );
-  sprintf( string, "%zu %zu\n", im->xdim, im->ydim );
+  snprintf( string, 256, "%zu %zu\n", im->xdim, im->ydim );
   ImageIO_write( im, string, strlen( string ) );
   max = 0;
   switch ( im->wdim ) {
@@ -552,7 +552,7 @@ int writePgmImage(char *name,_image *im  )
   }
   /* max == 0 causes problems for xv */
   if ( max == 0 ) max = 1;
-  sprintf( string, "%d\n", max );
+  snprintf( string, 256, "%d\n", max );
   ImageIO_write( im, string, strlen( string ) );
 
   if ( im->dataMode == DM_ASCII ) {
@@ -574,10 +574,10 @@ int writePgmImage(char *name,_image *im  )
         do {
           memset( str, 0, _LGTH_STRING_ );
           for ( j=0; j<n && i<size; j++, i++ ) {
-            sprintf( str+strlen(str), "%d", theBuf[i] );
-            if ( j<n && i<size ) sprintf( str+strlen(str), " " );
+            snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "%d", theBuf[i] );
+            if ( j<n && i<size ) snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), " " );
           }
-          sprintf( str+strlen(str), "\n" );
+          snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "\n" );
           if ( ImageIO_write( im, str, strlen( str ) ) <= 0 ) {
             fprintf(stderr, "writePgmImage: error when writing data in \'%s\'\n", name );
             return( -3 );
@@ -591,10 +591,10 @@ int writePgmImage(char *name,_image *im  )
         do {
           memset( str, 0, _LGTH_STRING_ );
           for ( j=0; j<n && i<size; j++, i++ ) {
-            sprintf( str+strlen(str), "%d", theBuf[i] );
-            if ( j<n && i<size ) sprintf( str+strlen(str), " " );
+            snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "%d", theBuf[i] );
+            if ( j<n && i<size ) snprintf( str+strlen(str), 2, " " );
           }
-          sprintf( str+strlen(str), "\n" );
+          snprintf( str+strlen(str), _LGTH_STRING_ - strlen(str), "\n" );
           if ( ImageIO_write( im, str, strlen( str ) ) <= 0 ) {
             fprintf(stderr, "writePgmImage: error when writing data in \'%s\'\n", name );
             return( -3 );
@@ -629,6 +629,3 @@ int writePgmImage(char *name,_image *im  )
   im->openMode = OM_CLOSE;
   return 1;
 }
-
-
-

From 7139a34f444344c5126a873a42d741e37a795393 Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 10:20:16 +0100
Subject: [PATCH 1234/1398] hide non used header

---
 .../test/Polygon_mesh_processing/pmp_compute_normals_test.cpp   | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp
index ef45266f71d4..3517709a72ab 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp
@@ -1,7 +1,7 @@
 // #define CGAL_PMP_COMPUTE_NORMAL_DEBUG_PP
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h>
+//#include <CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h>
 
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>

From 241e1bf557d459393b1779632c34e17458ab069e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 11:53:18 +0100
Subject: [PATCH 1235/1398] add missing license include directives

---
 .../Approximate_min_ellipsoid_d_impl.h        |   6 +
 .../Khachiyan_approximation_impl.h            |   7 +
 .../CGAL/Min_circle_2/Min_circle_2_impl.h     |   7 +
 .../Min_circle_2/Optimisation_circle_2_impl.h |   7 +
 .../CGAL/Min_ellipse_2/Min_ellipse_2_impl.h   |   7 +
 .../Optimisation_ellipse_2_impl.h             |   7 +
 .../CGAL/Min_sphere_d/Min_sphere_d_impl.h     |   7 +
 .../CGAL/Circular_kernel_2/interface_macros.h |   2 +
 .../interface_macros.h                        |   2 +
 .../CGAL/Circular_kernel_3/interface_macros.h |   2 +
 .../CGAL/Partition_2/Rotation_tree_2_impl.h   |   7 +
 .../Vertex_visibility_graph_2_impl.h          |   7 +
 .../CGAL/Periodic_2_triangulation_dummy_12.h  |   2 +
 ...riodic_3_regular_triangulation_dummy_288.h |   2 +
 .../Periodic_3_triangulation_dummy_36.h       |   2 +
 ...Periodic_3_triangulation_dummy_generator.h |   2 +
 .../experimental/experimental_code.h          | 228 ------------------
 .../include/CGAL/polygon_mesh_processing.h    |   8 +
 .../include/CGAL/QP_solver/Initialization.h   |   7 +
 .../CGAL/QP_solver/QP__filtered_base_impl.h   |   7 +
 .../CGAL/QP_solver/QP_basis_inverse_impl.h    |   7 +
 .../CGAL/QP_solver/QP_solver_bounds_impl.h    |   7 +
 .../include/CGAL/QP_solver/QP_solver_impl.h   |   7 +
 .../QP_solver_nonstandardform_impl.h          |   7 +
 .../Segment_Delaunay_graph_2_impl.h           |   6 +
 .../Segment_Delaunay_graph_hierarchy_2_impl.h |   5 +
 .../Segment_Delaunay_graph_Linf_2_impl.h      |   7 +
 .../CGAL/surface_mesh_parameterization.h      |   8 +-
 .../CGAL/make_piecewise_smooth_surface_mesh.h |   7 +
 29 files changed, 158 insertions(+), 229 deletions(-)
 delete mode 100644 Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/experimental/experimental_code.h

diff --git a/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h b/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h
index b38b77949670..e6c85c192a65 100644
--- a/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h
+++ b/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Approximate_min_ellipsoid_d_impl.h
@@ -10,6 +10,10 @@
 //
 // Author(s)     : Kaspar Fischer <fischerk@inf.ethz.ch>
 
+#ifndef CGAL_APPROXIMATE_MIN_ELLIPSOID_D_APPROXIMATE_MIN_ELLIPSOID_D_IMPL_H
+#define CGAL_APPROXIMATE_MIN_ELLIPSOID_D_APPROXIMATE_MIN_ELLIPSOID_D_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
 
 #include <CGAL/Default_diagonalize_traits.h>
 
@@ -272,3 +276,5 @@ namespace CGAL {
   }
 
 }
+
+#endif //CGAL_APPROXIMATE_MIN_ELLIPSOID_D_APPROXIMATE_MIN_ELLIPSOID_D_IMPL_H
diff --git a/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Khachiyan_approximation_impl.h b/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Khachiyan_approximation_impl.h
index 90944fd8b7fa..c3c5844f2732 100644
--- a/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Khachiyan_approximation_impl.h
+++ b/Bounding_volumes/include/CGAL/Approximate_min_ellipsoid_d/Khachiyan_approximation_impl.h
@@ -10,6 +10,11 @@
 //
 // Author(s)     : Kaspar Fischer <fischerk@inf.ethz.ch>
 
+#ifndef CGAL_APPROX_MIN_ELLIPSOID_KHACHIYAN_APPROX_IMPL_H
+#define CGAL_APPROX_MIN_ELLIPSOID_KHACHIYAN_APPROX_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 // Note: whenever a comment refers to "Khachiyan's paper" then the
 // paper "Rounding of polytopes in the real number model of
 // computation" is meant (Mathematics of Operations Research, Vol. 21,
@@ -663,3 +668,5 @@ namespace CGAL {
   }
 
 }
+
+#endif // CGAL_APPROX_MIN_ELLIPSOID_KHACHIYAN_APPROX_IMPL_H
diff --git a/Bounding_volumes/include/CGAL/Min_circle_2/Min_circle_2_impl.h b/Bounding_volumes/include/CGAL/Min_circle_2/Min_circle_2_impl.h
index 114a59a297a1..c7f9893103d6 100644
--- a/Bounding_volumes/include/CGAL/Min_circle_2/Min_circle_2_impl.h
+++ b/Bounding_volumes/include/CGAL/Min_circle_2/Min_circle_2_impl.h
@@ -10,6 +10,11 @@
 //
 // Author(s)     : Sven Schoenherr <sven@inf.ethz.ch>, Bernd Gaertner
 
+#ifndef CGAL_MIN_CIRCLE_2_MIN_CIRCLE_2_IMPL_H
+#define CGAL_MIN_CIRCLE_2_MIN_CIRCLE_2_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 #include <iterator>
 
 namespace CGAL {
@@ -98,3 +103,5 @@ operator >> ( std::istream& is, CGAL::Min_circle_2<Traits_>& min_circle)
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif // CGAL_MIN_CIRCLE_2_MIN_CIRCLE_2_IMPL_H
diff --git a/Bounding_volumes/include/CGAL/Min_circle_2/Optimisation_circle_2_impl.h b/Bounding_volumes/include/CGAL/Min_circle_2/Optimisation_circle_2_impl.h
index f2e94333b610..04a47b6d2b0b 100644
--- a/Bounding_volumes/include/CGAL/Min_circle_2/Optimisation_circle_2_impl.h
+++ b/Bounding_volumes/include/CGAL/Min_circle_2/Optimisation_circle_2_impl.h
@@ -10,6 +10,11 @@
 //
 // Author(s)     : Sven Schoenherr <sven@inf.ethz.ch>, Bernd Gaertner
 
+#ifndef CGAL_MIN_SPHERE_D_OPTIMISATION_CIRCLE_2_IMPL_H
+#define CGAL_MIN_SPHERE_D_OPTIMISATION_CIRCLE_2_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 // includes
 #  include <CGAL/assertions.h>
 
@@ -89,3 +94,5 @@ operator >> ( std::istream& is, CGAL::Optimisation_circle_2<K_>& c)
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif //CGAL_MIN_SPHERE_D_OPTIMISATION_CIRCLE_2_IMPL_H
diff --git a/Bounding_volumes/include/CGAL/Min_ellipse_2/Min_ellipse_2_impl.h b/Bounding_volumes/include/CGAL/Min_ellipse_2/Min_ellipse_2_impl.h
index d7bd821350ed..01cc0d2dcf7d 100644
--- a/Bounding_volumes/include/CGAL/Min_ellipse_2/Min_ellipse_2_impl.h
+++ b/Bounding_volumes/include/CGAL/Min_ellipse_2/Min_ellipse_2_impl.h
@@ -10,6 +10,11 @@
 //
 // Author(s)     : Sven Schoenherr <sven@inf.ethz.ch>, Bernd Gaertner
 
+#ifndef CGAL_MIN_ELLIPSE_2_MIN_ELLIPSE_2_IMP_H
+#define CGAL_MIN_ELLIPSE_2_MIN_ELLIPSE_2_IMP_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 #include <iterator>
 
 namespace CGAL {
@@ -98,3 +103,5 @@ operator >> ( std::istream& is, CGAL::Min_ellipse_2<Traits_>& min_ellipse)
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif // CGAL_MIN_ELLIPSE_2_MIN_ELLIPSE_2_IMP_H
diff --git a/Bounding_volumes/include/CGAL/Min_ellipse_2/Optimisation_ellipse_2_impl.h b/Bounding_volumes/include/CGAL/Min_ellipse_2/Optimisation_ellipse_2_impl.h
index 4f94bbe40479..4100d9d3de69 100644
--- a/Bounding_volumes/include/CGAL/Min_ellipse_2/Optimisation_ellipse_2_impl.h
+++ b/Bounding_volumes/include/CGAL/Min_ellipse_2/Optimisation_ellipse_2_impl.h
@@ -10,6 +10,11 @@
 //
 // Author(s)     : Sven Schoenherr <sven@inf.ethz.ch>, Bernd Gaertner
 
+#ifndef CGAL_MIN_ELLIPSE_2_OPTIMISATION_ELLIPSE_2_IMPL_H
+#define CGAL_MIN_ELLIPSE_2_OPTIMISATION_ELLIPSE_2_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 namespace CGAL {
 
 // Class implementation (continued)
@@ -116,3 +121,5 @@ operator >> ( std::istream& is, CGAL::Optimisation_ellipse_2<K_>& e)
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif // CGAL_MIN_ELLIPSE_2_OPTIMISATION_ELLIPSE_2_IMPL_H
diff --git a/Bounding_volumes/include/CGAL/Min_sphere_d/Min_sphere_d_impl.h b/Bounding_volumes/include/CGAL/Min_sphere_d/Min_sphere_d_impl.h
index 17231e575e40..95ebcd1fb310 100644
--- a/Bounding_volumes/include/CGAL/Min_sphere_d/Min_sphere_d_impl.h
+++ b/Bounding_volumes/include/CGAL/Min_sphere_d/Min_sphere_d_impl.h
@@ -11,6 +11,11 @@
 // Author(s)     : Sven Schoenherr <sven@inf.fu-berlin.de>
 //                 Bernd Gaertner
 
+#ifndef CGAL_MIN_SPHERE_D_MIN_SPHERE_D_IMPL_H
+#define CGAL_MIN_SPHERE_D_MIN_SPHERE_D_IMPL_H
+
+#include <CGAL/license/Bounding_volumes.h>
+
 #include <iterator>
 
 namespace CGAL {
@@ -105,3 +110,5 @@ operator >> ( std::istream& is, Min_sphere_d<Traits>& min_sphere)
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif //CGAL_MIN_SPHERE_D_MIN_SPHERE_D_IMPL_H
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/interface_macros.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/interface_macros.h
index ca10ee63135f..544f437b9360 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/interface_macros.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/interface_macros.h
@@ -9,6 +9,8 @@
 //
 // Author(s)     : Monique Teillaud, Sylvain Pion, Pedro Machado
 
+#include <CGAL/license/Circular_kernel_2.h>
+
 // Partially supported by the IST Programme of the EU as a Shared-cost
 // RTD (FET Open) Project under Contract No  IST-2000-26473
 // (ECG - Effective Computational Geometry for Curves and Surfaces)
diff --git a/Circular_kernel_2/include/CGAL/Filtered_bbox_circular_kernel_2/interface_macros.h b/Circular_kernel_2/include/CGAL/Filtered_bbox_circular_kernel_2/interface_macros.h
index 32afcea5df7a..73dd6f14b37d 100644
--- a/Circular_kernel_2/include/CGAL/Filtered_bbox_circular_kernel_2/interface_macros.h
+++ b/Circular_kernel_2/include/CGAL/Filtered_bbox_circular_kernel_2/interface_macros.h
@@ -9,6 +9,8 @@
 //
 // Author(s)     : Monique Teillaud, Sylvain Pion, Pedro Machado
 
+#include <CGAL/license/Circular_kernel_2.h>
+
 // Partially supported by the IST Programme of the EU as a Shared-cost
 // RTD (FET Open) Project under Contract No  IST-2000-26473
 // (ECG - Effective Computational Geometry for Curves and Surfaces)
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/interface_macros.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/interface_macros.h
index dfb43c312983..17d538869ed4 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/interface_macros.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/interface_macros.h
@@ -10,6 +10,8 @@
 // Author(s) : Monique Teillaud, Sylvain Pion, Pedro Machado,
 //             Sebastien Loriot, Julien Hazebrouck, Damien Leroy
 
+#include <CGAL/license/Circular_kernel_3.h>
+
 // Partially supported by the IST Programme of the EU as a
 // STREP (FET Open) Project under Contract No  IST-006413
 // (ACS -- Algorithms for Complex Shapes)
diff --git a/Partition_2/include/CGAL/Partition_2/Rotation_tree_2_impl.h b/Partition_2/include/CGAL/Partition_2/Rotation_tree_2_impl.h
index 7f4b46ffdb7a..e55e1b0d4a6b 100644
--- a/Partition_2/include/CGAL/Partition_2/Rotation_tree_2_impl.h
+++ b/Partition_2/include/CGAL/Partition_2/Rotation_tree_2_impl.h
@@ -10,6 +10,11 @@
 //
 // Author(s)     : Susan Hert <hert@mpi-sb.mpg.de>
 
+#ifndef CGAL_PARTITION_2_ROTATION_TREE_2_IMPL_H
+#define CGAL_PARTITION_2_ROTATION_TREE_2_IMPL_H
+
+#include <CGAL/license/Partition_2.h>
+
 #include <iostream>
 
 namespace CGAL {
@@ -130,3 +135,5 @@ std::ostream& operator<<(std::ostream& os, const Rotation_tree_2<Traits>& tree)
 }
 
 }
+
+#endif // CGAL_PARTITION_2_ROTATION_TREE_2_IMPL_H
diff --git a/Partition_2/include/CGAL/Partition_2/Vertex_visibility_graph_2_impl.h b/Partition_2/include/CGAL/Partition_2/Vertex_visibility_graph_2_impl.h
index 9d9c463a994e..65bf16ac625f 100644
--- a/Partition_2/include/CGAL/Partition_2/Vertex_visibility_graph_2_impl.h
+++ b/Partition_2/include/CGAL/Partition_2/Vertex_visibility_graph_2_impl.h
@@ -10,6 +10,11 @@
 //
 // Author(s)     : Susan Hert <hert@mpi-sb.mpg.de>
 
+#ifndef CGAL_PARTITION_2_VERTEX_VISIBILITY_GRAPH_2_IMPL_H
+#define CGAL_PARTITION_2_VERTEX_VISIBILITY_GRAPH_2_IMPL_H
+
+#include <CGAL/license/Partition_2.h>
+
 namespace CGAL {
 
 
@@ -699,3 +704,5 @@ void Vertex_visibility_graph_2<Traits>::handle(Tree_iterator p,
 }
 
 }
+
+#endif // CGAL_PARTITION_2_VERTEX_VISIBILITY_GRAPH_2_IMPL_H
diff --git a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_dummy_12.h b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_dummy_12.h
index 6c6c6e01a0cf..465ad8c83b08 100644
--- a/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_dummy_12.h
+++ b/Periodic_2_triangulation_2/include/CGAL/Periodic_2_triangulation_dummy_12.h
@@ -9,6 +9,8 @@
 //
 // Author(s)     : Nico Kruithof <Nico@nghk.nl>
 
+#include <CGAL/license/Periodic_2_triangulation_2.h>
+
 #ifdef CGAL_INCLUDE_FROM_PERIODIC_2_TRIANGULATION_2_H
 
 #include <vector>
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_dummy_288.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_dummy_288.h
index f125d86dda01..811d408a654c 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_dummy_288.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_regular_triangulation_dummy_288.h
@@ -10,6 +10,8 @@
 //
 // Author(s)     : Manuel Caroli <Manuel.Caroli@sophia.inria.fr>
 
+#include <CGAL/license/Periodic_3_triangulation_3.h>
+
 #ifdef CGAL_INCLUDE_FROM_PERIODIC_3_REGULAR_TRIANGULATION_3_H
 
 std::vector<Weighted_point> dummy_points()
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_36.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_36.h
index a2197bb2768e..097a60163602 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_36.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_36.h
@@ -10,6 +10,8 @@
 //
 // Author(s)     : Manuel Caroli <Manuel.Caroli@sophia.inria.fr>
 
+#include <CGAL/license/Periodic_3_triangulation_3.h>
+
 #ifdef CGAL_INCLUDE_FROM_PERIODIC_3_TRIANGULATION_3_H
 
 template < class GT, class TDS >
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_generator.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_generator.h
index b501d361cc3e..1d11a29adc51 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_generator.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Periodic_3_triangulation_dummy_generator.h
@@ -10,6 +10,8 @@
 //
 // Author(s)     : Mael Rouxel-Labbé
 
+#include <CGAL/license/Periodic_3_triangulation_3.h>
+
 #ifdef CGAL_INCLUDE_FROM_PERIODIC_3_TRIANGULATION_3_H
 
 template < class GT, class TDS >
diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/experimental/experimental_code.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/experimental/experimental_code.h
deleted file mode 100644
index a33bd8964be8..000000000000
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Hole_filling/experimental/experimental_code.h
+++ /dev/null
@@ -1,228 +0,0 @@
-// Copyright (c) 2015 GeometryFactory (France).
-// All rights reserved.
-//
-// This file is part of CGAL (www.cgal.org).
-//
-// $URL$
-// $Id$
-// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
-//
-//
-// Author(s)     : Ilker O. Yaz
-
-/************************************************************************
- * Currently not useful code pieces, in case there will be any need in the future.
- * Also they might not work when they plugged-in due to recent changes.
- ************************************************************************/
-
-// It can produce a patch from both complete and incomplete lambda
-// WARNING: Not working good for all cases
-// For holes, this code first close them then erase them.
-// However the algorithm might produce holes which are invalid to close (closing them breaks edge manifoldness, so erasing doesn't work)
-template<class Polyhedron, class OutputIteratorPatch, class OutputIteratorHole>
-struct Tracer_polyhedron_incomplete
-{
-  typedef typename Polyhedron::Halfedge_handle Halfedge_handle;
-  typedef typename Polyhedron::Facet_handle    Facet_handle;
-
-  Tracer_polyhedron_incomplete(OutputIteratorPatch out,
-                               OutputIteratorHole out_hole,
-                               Polyhedron& polyhedron,
-                               std::vector<Halfedge_handle>& P)
-    : out(out), out_hole(out_hole), polyhedron(polyhedron), P(P)
-  { }
-
-  template <class LookupTable>
-  void
-  operator()(const LookupTable& lambda, int i, int k)
-  {
-    std::vector<Facet_handle> facets_to_delete;
-    (*this)(lambda, i, k, facets_to_delete, true);
-    for(typename std::vector<Facet_handle>::iterator it = facets_to_delete.begin();
-        it != facets_to_delete.end(); ++it)
-    {
-      *out_hole++=(*it)->halfedge(); // each deleted facet corresponds to a new hole
-      polyhedron.erase_facet((*it)->halfedge());
-    }
-  }
-
-private:
-  template <class LookupTable>
-  Halfedge_handle
-  operator()(const LookupTable& lambda,
-             int i, int k,
-             std::vector<Facet_handle>& facets_to_delete,
-             bool last)
-  {
-    if(i + 1 == k) { return P[i+1]; }
-
-    Halfedge_handle h, g;
-    if(i+2 == k){
-
-      if(last)
-      { h = polyhedron.fill_hole(P[i+1]); }
-      else
-      { h = polyhedron.add_facet_to_border(P[i+1]->prev(), P[i+2/*k*/]); }
-
-      CGAL_assertion(h->facet() != Facet_handle());
-
-      int la = lambda.get(i, k);
-      if(la == -1) {
-        facets_to_delete.push_back(h->facet());
-      }
-      else {
-        *out++ = h->facet();
-      }
-      return h->opposite();
-    }
-    else
-    {
-      int la = lambda.get(i, k);
-      if(la == -1) {
-        if(last)
-        { h = polyhedron.fill_hole(P[i+1]); }
-        else
-        { h = polyhedron.add_facet_to_border(P[i+1]->prev(), P[i+2/*k*/]); }
-        facets_to_delete.push_back(h->facet());
-        return h->opposite();
-      }
-      else {
-        h = operator()(lambda, i, la, facets_to_delete, false);
-        g = operator()(lambda, la, k, facets_to_delete, false);
-
-        if(last)
-        { h = polyhedron.fill_hole(g); }
-        else
-        { h = polyhedron.add_facet_to_border(h->prev(), g); }
-
-        CGAL_assertion(h->facet() != Facet_handle());
-        *out++ = h->facet();
-        return h->opposite();
-      }
-    }
-  }
-
-public:
-  OutputIteratorPatch out;
-  OutputIteratorHole out_hole;
-  Polyhedron& polyhedron;
-  std::vector<Halfedge_handle>& P;
-};
-
-// Try closing holes by gathering incomplete patches together (an external approach)
-template <typename OutputIteratorValueType, typename InputIterator, typename OutputIterator>
-OutputIterator
-triangulate_hole_polyline_incomplete(InputIterator pbegin, InputIterator pend,
-                                     InputIterator qbegin, InputIterator qend,
-                                     OutputIterator out)
-{
-
-  typedef typename std::iterator_traits<InputIterator>::value_type Point_3;
-  typedef Weight_incomplete<Weight_min_max_dihedral_and_area>      Weight;
-  typedef Weight_calculator<Weight, Is_valid_degenerate_triangle>  WC;
-
-  typedef std::vector<std::tuple<int, int, int> >                     Facet_vector; /* deliberately not OutputIteratorValueType*/
-  typedef std::back_insert_iterator<Facet_vector>                     OutIt;
-  typedef Tracer_polyline_incomplete<Facet_vector::value_type, OutIt> Tracer;
-  typedef std::pair<int, int> Range;
-
-  std::vector<Point_3> P(pbegin, pend);
-  std::vector<Point_3> Q(qbegin, qend);
-
-  if(P.front() != P.back()){
-    P.push_back(P.front());
-    if( !Q.empty() && P.size() > Q.size()) {
-      Q.push_back(Q.front());
-    }
-  }
-
-  std::vector<OutputIteratorValueType>   patch_facets;
-  std::stack<Range>                      remaining_holes;
-
-  remaining_holes.push(Range(0, P.size() -2));
-
-  while(!remaining_holes.empty()) {
-    Range h = remaining_holes.top();
-    remaining_holes.pop();
-
-    std::vector<Point_3> P_r(&P[h.first], (&P[h.second]) + 1);
-    std::vector<Point_3> Q_r;
-    if(!Q.empty()) { Q_r.insert(Q_r.begin(), &Q[h.first], (&Q[h.second]) + 1); };
-
-    Facet_vector new_facets;
-    OutIt new_facets_out(new_facets);
-    std::vector<Range> new_holes;
-    std::back_insert_iterator<std::vector<Range> > new_holes_out(new_holes);
-    Tracer tracer(new_facets_out, new_holes_out);
-
-    triangulate_hole_polyline(P_r, Q_r, tracer, WC(), true, true);
-
-    if(new_facets.empty()) {
-      new_holes.clear();
-      //triangulate_hole_polyline(P_r, Q_r, tracer, WC(), false, true);
-      if(new_facets.empty()) {
-        // if no patch facets created and also we are using brute force approach, then there is nothing to do,
-        // leave `out` intact and return
-        CGAL_warning_msg(false, "Returning no output. Filling hole with incomplete patches is not successful!");
-        return out;
-      }
-    }
-    // put new borders to remaining_holes
-    for(typename std::vector<Range>::iterator it = new_holes.begin(); it != new_holes.end(); ++it) {
-      remaining_holes.push(std::make_pair(it->first + h.first, it->second + h.first));
-    }
-    tracer.remaining_holes.clear();
-    for(Facet_vector::iterator it = new_facets.begin(); it != new_facets.end(); ++it) {
-      patch_facets.push_back(
-        OutputIteratorValueType(it->get<0>() + h.first, it->get<1>() + h.first, it->get<2>() + h.first));
-    }
-  }
-
-  return std::copy(patch_facets.begin(), patch_facets.end(), out);
-}
-
-// (for Polyhedron_3) Try closing holes by gathering incomplete patches together (an external approach)
-template<class Polyhedron, class OutputIterator>
-std::pair<OutputIterator, Weight_min_max_dihedral_and_area>
-triangulate_hole_Polyhedron_incomplete(Polyhedron& polyhedron,
-                                       typename Polyhedron::Halfedge_handle border_halfedge,
-                                       OutputIterator out)
-{
-  typedef typename Polyhedron::Halfedge_handle Halfedge_handle;
-  typedef typename Polyhedron::Facet_handle    Facet_handle;
-
-  Weight_min_max_dihedral_and_area weight_total = Weight_min_max_dihedral_and_area::DEFAULT();
-  std::vector<Facet_handle>   patch_facets;
-  std::stack<Halfedge_handle> remaining_holes;
-  remaining_holes.push(border_halfedge);
-
-  while(!remaining_holes.empty()) {
-    Halfedge_handle h = remaining_holes.top();
-    remaining_holes.pop();
-    std::vector<Halfedge_handle> holes_h;
-
-    std::size_t patch_facets_before = patch_facets.size();
-    Weight_min_max_dihedral_and_area w =
-      triangulate_hole_Polyhedron(polyhedron, h, back_inserter(patch_facets), back_inserter(holes_h), true);
-
-    if(patch_facets_before == patch_facets.size()) {
-      holes_h.clear();
-      patch_facets_before = patch_facets.size();
-      w = triangulate_hole_Polyhedron(polyhedron, h, back_inserter(patch_facets), back_inserter(holes_h), false);
-      if(patch_facets_before == patch_facets.size()) {
-        // if no patch facets created and also we are using brute force approach, then there is nothing to do,
-        // leave `out` intact and return
-        CGAL_warning_msg(false, "Returning no output. Filling hole with incomplete patches is not successful!");
-        return std::make_pair(out, Weight_min_max_dihedral_and_area::NOT_VALID());
-      }
-    }
-    // put new borders to remaining_holes and update weight
-    for(typename std::vector<Halfedge_handle>::iterator it = holes_h.begin(); it != holes_h.end(); ++it) {
-      //remaining_holes.push(*it);
-    }
-    weight_total = weight_total + w;
-  }
-
-  out = std::copy(patch_facets.begin(), patch_facets.end(), out);
-  return std::make_pair(out, weight_total);
-}
diff --git a/Polygon_mesh_processing/include/CGAL/polygon_mesh_processing.h b/Polygon_mesh_processing/include/CGAL/polygon_mesh_processing.h
index b9892a67f163..b883e7299359 100644
--- a/Polygon_mesh_processing/include/CGAL/polygon_mesh_processing.h
+++ b/Polygon_mesh_processing/include/CGAL/polygon_mesh_processing.h
@@ -17,6 +17,11 @@
 * the free functions of this package.
 */
 
+#ifndef CGAL_POLYGON_MESH_PROCESSING_H
+#define CGAL_POLYGON_MESH_PROCESSING_H
+
+#include <CGAL/license/Polygon_mesh_processing/core.h>
+
 #include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
@@ -49,3 +54,6 @@
 #include <CGAL/Polygon_mesh_processing/smooth_mesh.h>
 #include <CGAL/Polygon_mesh_processing/smooth_shape.h>
 #include <CGAL/Polygon_mesh_processing/manifoldness.h>
+#include <CGAL/Polygon_mesh_processing/autorefinement.h>
+
+#endif //CGAL_POLYGON_MESH_PROCESSING_H
diff --git a/QP_solver/include/CGAL/QP_solver/Initialization.h b/QP_solver/include/CGAL/QP_solver/Initialization.h
index 88eb0636fb32..99873022d2da 100644
--- a/QP_solver/include/CGAL/QP_solver/Initialization.h
+++ b/QP_solver/include/CGAL/QP_solver/Initialization.h
@@ -13,6 +13,11 @@
 //                 Franz Wessendorp
 //                 Kaspar Fischer
 
+#ifndef CGAL_QP_SOLVER_INITIALIZATION_H
+#define CGAL_QP_SOLVER_INITIALIZATION_H
+
+#include <CGAL/license/QP_solver.h>
+
 #include<CGAL/QP_functions.h>
 #include<CGAL/NT_converter.h>
 
@@ -664,3 +669,5 @@ init_additional_data_members()
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif //CGAL_QP_SOLVER_INITIALIZATION_H
diff --git a/QP_solver/include/CGAL/QP_solver/QP__filtered_base_impl.h b/QP_solver/include/CGAL/QP_solver/QP__filtered_base_impl.h
index 194a7607e64d..bffac7ad089d 100644
--- a/QP_solver/include/CGAL/QP_solver/QP__filtered_base_impl.h
+++ b/QP_solver/include/CGAL/QP_solver/QP__filtered_base_impl.h
@@ -13,6 +13,11 @@
 //                 Franz Wessendorp
 //                 Kaspar Fischer
 
+#ifndef CGAL_QP_FILTERED_BASE_IMPL_H
+#define CGAL_QP_FILTERED_BASE_IMPL_H
+
+#include <CGAL/license/QP_solver.h>
+
 namespace CGAL {
 
 // =============================
@@ -370,3 +375,5 @@ transition( )
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif // CGAL_QP_FILTERED_BASE_IMPL_H
diff --git a/QP_solver/include/CGAL/QP_solver/QP_basis_inverse_impl.h b/QP_solver/include/CGAL/QP_solver/QP_basis_inverse_impl.h
index 04e8f3f36d49..890d1ba296bc 100644
--- a/QP_solver/include/CGAL/QP_solver/QP_basis_inverse_impl.h
+++ b/QP_solver/include/CGAL/QP_solver/QP_basis_inverse_impl.h
@@ -13,6 +13,11 @@
 //                 Franz Wessendorp
 //                 Kaspar Fischer
 
+#ifndef CGAL_QP_SOLVER_QP_BASIS_INVERSE_IMPL_H
+#define CGAL_QP_SOLVER_QP_BASIS_INVERSE_IMPL_H
+
+#include <CGAL/license/QP_solver.h>
+
 namespace CGAL {
 
 // =============================
@@ -700,3 +705,5 @@ print( )
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif //CGAL_QP_SOLVER_QP_BASIS_INVERSE_IMPL_H
diff --git a/QP_solver/include/CGAL/QP_solver/QP_solver_bounds_impl.h b/QP_solver/include/CGAL/QP_solver/QP_solver_bounds_impl.h
index 1f0a73e1a498..1e67055cbf8c 100644
--- a/QP_solver/include/CGAL/QP_solver/QP_solver_bounds_impl.h
+++ b/QP_solver/include/CGAL/QP_solver/QP_solver_bounds_impl.h
@@ -13,6 +13,11 @@
 //                 Franz Wessendorp
 //                 Kaspar Fischer
 
+#ifndef CGAL_QP_SOLVER_QP_SOLVER_BOUNDS_IMPL_H
+#define CGAL_QP_SOLVER_QP_SOLVER_BOUNDS_IMPL_H
+
+#include <CGAL/license/QP_solver.h>
+
 namespace CGAL {
 
 template < typename Q, typename ET, typename Tags >
@@ -89,3 +94,5 @@ QP_solver<Q, ET, Tags>::upper_bnd(int i) const
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif //CGAL_QP_SOLVER_QP_SOLVER_BOUNDS_IMPL_H
diff --git a/QP_solver/include/CGAL/QP_solver/QP_solver_impl.h b/QP_solver/include/CGAL/QP_solver/QP_solver_impl.h
index bc62b5ae88fb..262e20f1ba70 100644
--- a/QP_solver/include/CGAL/QP_solver/QP_solver_impl.h
+++ b/QP_solver/include/CGAL/QP_solver/QP_solver_impl.h
@@ -13,6 +13,11 @@
 //                 Franz Wessendorp
 //                 Kaspar Fischer
 
+#ifndef CGAL_QP_SOLVER_IMPL_H
+#define CGAL_QP_SOLVER_IMPL_H
+
+#include <CGAL/license/QP_solver.h>
+
 #include <CGAL/QP_solver/Initialization.h>
 #include <CGAL/NT_converter.h>
 
@@ -3393,3 +3398,5 @@ get_l() const
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif //CGAL_QP_SOLVER_IMPL_H
diff --git a/QP_solver/include/CGAL/QP_solver/QP_solver_nonstandardform_impl.h b/QP_solver/include/CGAL/QP_solver/QP_solver_nonstandardform_impl.h
index 57118dac1e21..e5f2a0eb5dfb 100644
--- a/QP_solver/include/CGAL/QP_solver/QP_solver_nonstandardform_impl.h
+++ b/QP_solver/include/CGAL/QP_solver/QP_solver_nonstandardform_impl.h
@@ -13,6 +13,11 @@
 //                 Franz Wessendorp
 //                 Kaspar Fischer
 
+#ifndef CGAL_QP_SOLVER_NONSTANDARDFORM_IMPL_H
+#define CGAL_QP_SOLVER_NONSTANDARDFORM_IMPL_H
+
+#include <CGAL/license/QP_solver.h>
+
 namespace CGAL {
 
 // Looks in x_O_v_i which bound is present for variable i and returns
@@ -219,3 +224,5 @@ init_w()
 } //namespace CGAL
 
 // ===== EOF ==================================================================
+
+#endif CGAL_QP_SOLVER_NONSTANDARDFORM_IMPL_H
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h
index 88d634e0324f..00c2130c50a6 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_2_impl.h
@@ -10,6 +10,10 @@
 //
 // Author(s)     : Menelaos Karavelas <mkaravel@iacm.forth.gr>
 
+#ifndef CGAL_SEGMENT_DELAUNAY_GRAPH_2_SDG_2_IMPL_H
+#define CGAL_SEGMENT_DELAUNAY_GRAPH_2_SDG_2_IMPL_H
+
+#include <CGAL/license/Segment_Delaunay_graph_2.h>
 
 // class implementation continued
 //=================================
@@ -3325,3 +3329,5 @@ file_input(std::istream& is, bool read_handle_vector,
 } //namespace CGAL
 
 // EOF
+
+#endif // CGAL_SEGMENT_DELAUNAY_GRAPH_2_SDG_2_IMPL_H
diff --git a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_hierarchy_2_impl.h b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_hierarchy_2_impl.h
index 14697569e3c7..1434020ccd9f 100644
--- a/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_hierarchy_2_impl.h
+++ b/Segment_Delaunay_graph_2/include/CGAL/Segment_Delaunay_graph_2/Segment_Delaunay_graph_hierarchy_2_impl.h
@@ -10,7 +10,10 @@
 //
 // Author(s)     : Menelaos Karavelas <mkaravel@iacm.forth.gr>
 
+#ifndef CGAL_SEGMENT_DELAUNAY_GRAPH_2_SDG_HIERARCHY_IMPL_H
+#define CGAL_SEGMENT_DELAUNAY_GRAPH_2_SDG_HIERARCHY_IMPL_H
 
+#include <CGAL/license/Segment_Delaunay_graph_2.h>
 
 
 // class implementation continued
@@ -1145,3 +1148,5 @@ file_input(std::istream& is)
 
 
 // EOF
+
+#endif //CGAL_SEGMENT_DELAUNAY_GRAPH_2_SDG_HIERARCHY_IMPL_H
diff --git a/Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Segment_Delaunay_graph_Linf_2_impl.h b/Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Segment_Delaunay_graph_Linf_2_impl.h
index 73a5247879e8..4aff29fb69b3 100644
--- a/Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Segment_Delaunay_graph_Linf_2_impl.h
+++ b/Segment_Delaunay_graph_Linf_2/include/CGAL/Segment_Delaunay_graph_Linf_2/Segment_Delaunay_graph_Linf_2_impl.h
@@ -11,6 +11,11 @@
 // Author(s)     : Panagiotis Cheilaris, Sandeep Kumar Dey, Evanthia Papadopoulou
 //philaris@gmail.com, sandeep.kr.dey@gmail.com, evanthia.papadopoulou@usi.ch
 
+#ifndef CGAL_SEGMENT_DELAUNAY_GRAPH_LINF_2_SDG_LINF_2_IMPL_H
+#define CGAL_SEGMENT_DELAUNAY_GRAPH_LINF_2_SDG_LINF_2_IMPL_H
+
+#include <CGAL/license/Segment_Delaunay_graph_Linf_2.h>
+
 namespace CGAL {
 
 // print face in standard output
@@ -759,3 +764,5 @@ insert_point_on_segment(const Storage_site_2& ss, const Site_2& ,
 } //namespace CGAL
 
 // EOF
+
+#endif // CGAL_SEGMENT_DELAUNAY_GRAPH_LINF_2_SDG_LINF_2_IMPL_H
diff --git a/Surface_mesh_parameterization/include/CGAL/surface_mesh_parameterization.h b/Surface_mesh_parameterization/include/CGAL/surface_mesh_parameterization.h
index 09980d6e6dd0..e5b31167532b 100644
--- a/Surface_mesh_parameterization/include/CGAL/surface_mesh_parameterization.h
+++ b/Surface_mesh_parameterization/include/CGAL/surface_mesh_parameterization.h
@@ -10,6 +10,11 @@
 //
 // Author(s)     : Mael Rouxel-Labbé
 
+#ifndef CGAL_SURFACE_MESH_PARAMETERIZATION_H
+#define CGAL_SURFACE_MESH_PARAMETERIZATION_H
+
+#include <CGAL/license/Surface_mesh_parameterization.h>
+
 /**
 * \ingroup PkgSurfaceMeshParameterizationRef
 * \file CGAL/surface_mesh_parameterization.h
@@ -17,7 +22,6 @@
 * the free functions of this package.
 */
 
-
 #include <CGAL/Surface_mesh_parameterization/ARAP_parameterizer_3.h>
 #include <CGAL/Surface_mesh_parameterization/Barycentric_mapping_parameterizer_3.h>
 #include <CGAL/Surface_mesh_parameterization/Discrete_authalic_parameterizer_3.h>
@@ -34,3 +38,5 @@
 #include <CGAL/Surface_mesh_parameterization/Circular_border_parameterizer_3.h>
 #include <CGAL/Surface_mesh_parameterization/Square_border_parameterizer_3.h>
 #include <CGAL/Surface_mesh_parameterization/Two_vertices_parameterizer_3.h>
+
+#endif // CGAL_SURFACE_MESH_PARAMETERIZATION_H
diff --git a/Surface_mesher/include/CGAL/make_piecewise_smooth_surface_mesh.h b/Surface_mesher/include/CGAL/make_piecewise_smooth_surface_mesh.h
index 33f4683b5349..ee7f4c54f0ba 100644
--- a/Surface_mesher/include/CGAL/make_piecewise_smooth_surface_mesh.h
+++ b/Surface_mesher/include/CGAL/make_piecewise_smooth_surface_mesh.h
@@ -9,4 +9,11 @@
 //
 // Author(s)     : Laurent Rineau
 
+#ifndef CGAL_MAKE_PIECEWISE_SMOOTH_SURFACE_MESH_H
+#define CGAL_MAKE_PIECEWISE_SMOOTH_SURFACE_MESH_H
+
+#include <CGAL/license/Surface_mesher.h>
+
 #include <CGAL/make_surface_mesh.h>
+
+#endif //CGAL_MAKE_PIECEWISE_SMOOTH_SURFACE_MESH_H

From 8527509907890170b18392737d501cf2150d1490 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 12:58:04 +0100
Subject: [PATCH 1236/1398] typo

---
 .../include/CGAL/QP_solver/QP_solver_nonstandardform_impl.h     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/QP_solver/include/CGAL/QP_solver/QP_solver_nonstandardform_impl.h b/QP_solver/include/CGAL/QP_solver/QP_solver_nonstandardform_impl.h
index e5f2a0eb5dfb..9b0b230c40af 100644
--- a/QP_solver/include/CGAL/QP_solver/QP_solver_nonstandardform_impl.h
+++ b/QP_solver/include/CGAL/QP_solver/QP_solver_nonstandardform_impl.h
@@ -225,4 +225,4 @@ init_w()
 
 // ===== EOF ==================================================================
 
-#endif CGAL_QP_SOLVER_NONSTANDARDFORM_IMPL_H
+#endif // CGAL_QP_SOLVER_NONSTANDARDFORM_IMPL_H

From e7c26349f286802386824abd7ac0fda1f467f668 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 13:36:34 +0100
Subject: [PATCH 1237/1398] move header in a package to GPL

---
 .../include/CGAL/Arr_algebraic_segment_traits_2.h             | 2 +-
 .../include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h         | 2 +-
 .../Curved_kernel_via_analysis_2/Curve_interval_arcno_cache.h | 2 +-
 .../CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h | 2 +-
 .../Curved_kernel_via_analysis_2_functors.h                   | 2 +-
 .../Curved_kernel_via_analysis_2_impl.h                       | 2 +-
 .../Filtered_curved_kernel_via_analysis_2_impl.h              | 2 +-
 .../include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h | 2 +-
 .../CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h       | 2 +-
 .../CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h     | 2 +-
 .../CGAL/Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h  | 2 +-
 .../include/CGAL/Curved_kernel_via_analysis_2/Point_2.h       | 2 +-
 .../Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h     | 2 +-
 .../CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h  | 2 +-
 .../gfx/Curve_renderer_internals.h                            | 2 +-
 .../Curved_kernel_via_analysis_2/gfx/Curve_renderer_traits.h  | 2 +-
 .../CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_1.h     | 2 +-
 .../CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_2.h     | 2 +-
 .../CGAL/Curved_kernel_via_analysis_2/test/simple_models.h    | 2 +-
 .../include/CGAL/boost/graph/graph_traits_Arrangement_2.h     | 2 +-
 .../CGAL/boost/graph/graph_traits_Dual_Arrangement_2.h        | 2 +-
 Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h    | 2 +-
 Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h    | 2 +-
 Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_2.h | 2 +-
 Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_3.h | 2 +-
 Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_d.h | 2 +-
 .../include/CGAL/Circular_kernel_2/Intersection_traits.h      | 4 ++--
 .../include/CGAL/Circular_kernel_3/Intersection_traits.h      | 2 +-
 .../include/CGAL/Spherical_kernel_type_equality_wrapper.h     | 2 +-
 Convex_hull_2/include/CGAL/Convex_hull_traits_adapter_2.h     | 2 +-
 GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h                 | 2 +-
 GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h            | 2 +-
 GraphicsView/include/CGAL/auto_link/Qt.h                      | 2 +-
 GraphicsView/include/CGAL/export/Qt.h                         | 2 +-
 Nef_2/include/CGAL/Nef_2/Polynomial.h                         | 2 +-
 Nef_2/include/CGAL/Nef_2/Polynomial_impl.h                    | 2 +-
 Nef_2/include/CGAL/Nef_2/debug.h                              | 2 +-
 Nef_2/include/CGAL/Nef_polynomial_fwd.h                       | 2 +-
 Nef_S2/include/CGAL/Nef_S2/OGL_base_object.h                  | 2 +-
 .../Periodic_3_power_side_of_oriented_power_sphere_3.h        | 2 +-
 .../internal/alpha_shape_mesh.h                               | 2 +-
 Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h                 | 2 +-
 Polyhedron/include/CGAL/Polyhedron_items_with_id_3.h          | 2 +-
 .../include/CGAL/boost/graph/graph_traits_Polyhedron_3.h      | 2 +-
 .../CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h     | 2 +-
 Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3.h | 2 +-
 .../CGAL/boost/graph/properties_Polyhedron_3_features.h       | 2 +-
 .../CGAL/boost/graph/properties_Polyhedron_3_time_stamp.h     | 2 +-
 .../include/CGAL/Polytope_distance_d_traits_2.h               | 2 +-
 .../include/CGAL/Polytope_distance_d_traits_3.h               | 2 +-
 .../include/CGAL/Polytope_distance_d_traits_d.h               | 2 +-
 Principal_component_analysis/include/CGAL/Subiterator.h       | 2 +-
 .../include/CGAL/Straight_skeleton_2/IO/Dxf_stream.h          | 2 +-
 .../include/CGAL/Straight_skeleton_2/IO/Dxf_writer.h          | 2 +-
 .../include/CGAL/Straight_skeleton_2/IO/print.h               | 2 +-
 .../include/CGAL/certified_numeric_predicates.h               | 2 +-
 .../include/CGAL/certified_quotient_predicates.h              | 2 +-
 .../include/CGAL/boost/graph/graph_traits_Surface_mesh.h      | 2 +-
 .../include/CGAL/boost/graph/properties_Surface_mesh.h        | 2 +-
 .../CGAL/boost/graph/properties_Surface_mesh_features.h       | 2 +-
 .../CGAL/boost/graph/properties_Surface_mesh_time_stamp.h     | 2 +-
 .../CGAL/Deformation_Eigen_closest_rotation_traits_3.h        | 2 +-
 .../CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h  | 2 +-
 Surface_mesher/include/CGAL/Surface_mesher/Profile_counter.h  | 2 +-
 .../boost/graph/graph_traits_Triangulation_data_structure_2.h | 2 +-
 .../CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h    | 2 +-
 .../boost/graph/properties_Triangulation_data_structure_2.h   | 2 +-
 Triangulation/include/CGAL/IO/Triangulation_off_ostream.h     | 2 +-
 Triangulation_2/include/CGAL/IO/Triangulation_off_ostream_2.h | 2 +-
 .../CGAL/Triangulation_2/internal/CTP2_subconstraint_graph.h  | 2 +-
 Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h         | 2 +-
 .../include/CGAL/Triangulation_face_base_with_id_2.h          | 2 +-
 .../include/CGAL/Triangulation_vertex_base_with_id_2.h        | 2 +-
 Triangulation_2/include/CGAL/apply_to_range.h                 | 2 +-
 .../graph/graph_traits_Constrained_Delaunay_triangulation_2.h | 2 +-
 .../boost/graph/graph_traits_Constrained_triangulation_2.h    | 2 +-
 .../graph/graph_traits_Constrained_triangulation_plus_2.h     | 2 +-
 .../CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h  | 2 +-
 .../CGAL/boost/graph/graph_traits_Regular_triangulation_2.h   | 2 +-
 .../include/CGAL/boost/graph/graph_traits_Triangulation_2.h   | 2 +-
 .../CGAL/boost/graph/graph_traits_Triangulation_hierarchy_2.h | 2 +-
 .../CGAL/boost/graph/internal/graph_traits_2D_triangulation.h | 2 +-
 .../graph/internal/graph_traits_2D_triangulation_helper.h     | 2 +-
 .../CGAL/boost/graph/internal/properties_2D_triangulation.h   | 2 +-
 .../graph/properties_Constrained_Delaunay_triangulation_2.h   | 2 +-
 .../CGAL/boost/graph/properties_Constrained_triangulation_2.h | 2 +-
 .../boost/graph/properties_Constrained_triangulation_plus_2.h | 2 +-
 .../CGAL/boost/graph/properties_Delaunay_triangulation_2.h    | 2 +-
 .../CGAL/boost/graph/properties_Regular_triangulation_2.h     | 2 +-
 .../include/CGAL/boost/graph/properties_Triangulation_2.h     | 2 +-
 .../CGAL/boost/graph/properties_Triangulation_hierarchy_2.h   | 2 +-
 Triangulation_3/include/CGAL/IO/Triangulation_off_ostream_3.h | 2 +-
 Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h         | 2 +-
 93 files changed, 94 insertions(+), 94 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
index af9b28db6f21..ad5dfd4ed550 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s): Michael Kerber    <mkerber@mpi-inf.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h
index 8766eac294d0..3c56db0f0a32 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Eric Berberich <eric@mpi-inf.mpg.de>
 //                 Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_interval_arcno_cache.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_interval_arcno_cache.h
index 7a8cf2840bf1..550037a680a9 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_interval_arcno_cache.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_interval_arcno_cache.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
index 3bb749b395cd..e7b6055422aa 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
 //
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
index 8fe1efa48c79..14b983bcf45e 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Eric Berberich <eric@mpi-inf.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_impl.h
index 66f20cccf099..7457f4bae232 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_impl.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Eric Berberich <eric@mpi-inf.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Filtered_curved_kernel_via_analysis_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Filtered_curved_kernel_via_analysis_2_impl.h
index 45bb19fa5586..80a36a222722 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Filtered_curved_kernel_via_analysis_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Filtered_curved_kernel_via_analysis_2_impl.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Eric Berberich <eric@mpi-inf.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h
index 06ec76eb58f8..b66255a061d8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h
index c465cae03009..050ccd7dcf55 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h
index aae3aea01e9d..f5afe7c8a0b8 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Eric Berberich <eric@mpi-inf.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h
index d2cae5964bfe..8043447ceaac 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
index f64c67b70eac..31a98218fbdd 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Eric Berberich <eric@mpi-inf.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
index 018992c467b4..748e05e4094d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h
index 32d3d4cc8493..e6a4a6cc737d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
 //
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
index c0c62a2ad887..273f40362de1 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
 //
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_traits.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_traits.h
index 32e108b71c0b..56465713530d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_traits.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_traits.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
 //
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_1.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_1.h
index 395b44a9f11e..196d7f53bee0 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_1.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_1.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
 //
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_2.h
index 9358316c0b8d..7a72d48268b1 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
 //
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
index 201bfc19b4bd..14ef6913281d 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
diff --git a/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Arrangement_2.h b/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Arrangement_2.h
index ad371b4667df..0d3fd5af5c83 100644
--- a/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Arrangement_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Arrangement_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Ron Wein <wein@post.tau.ac.il>
diff --git a/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Dual_Arrangement_2.h b/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Dual_Arrangement_2.h
index 5126f0106869..41c102cb65b0 100644
--- a/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Dual_Arrangement_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Dual_Arrangement_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Ron Wein <wein@post.tau.ac.il>
diff --git a/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h b/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h
index 76e2eaf32832..ffd6af38c9ce 100644
--- a/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h
@@ -9,7 +9,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s): Efi Fogel <efifogel@gmail.com>
diff --git a/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h b/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h
index 6eaa81b02f7b..58156ed66408 100644
--- a/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h
+++ b/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h
@@ -9,7 +9,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
diff --git a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_2.h b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_2.h
index 05dd8668050e..434368e3ef18 100644
--- a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_2.h
+++ b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_2.h
@@ -9,7 +9,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Sven Schoenherr <sven@inf.ethz.ch>
diff --git a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_3.h b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_3.h
index 75c7f038d701..7873d6f4b1a7 100644
--- a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_3.h
+++ b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_3.h
@@ -9,7 +9,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Sven Schoenherr <sven@inf.ethz.ch>
diff --git a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_d.h b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_d.h
index 8d2f13a56c67..0730222f2518 100644
--- a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_d.h
+++ b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_d.h
@@ -9,7 +9,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Sven Schoenherr <sven@inf.ethz.ch>
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h
index 34ba0ccc3868..8896e76c23b1 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h
@@ -5,11 +5,11 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Philipp Möller and Sebastien Loriot
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
index 9612d2ca5787..b2319846ecbf 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Philipp Möller and Sebastien Loriot
diff --git a/Circular_kernel_3/include/CGAL/Spherical_kernel_type_equality_wrapper.h b/Circular_kernel_3/include/CGAL/Spherical_kernel_type_equality_wrapper.h
index 5553e5566988..432fc6bc6351 100644
--- a/Circular_kernel_3/include/CGAL/Spherical_kernel_type_equality_wrapper.h
+++ b/Circular_kernel_3/include/CGAL/Spherical_kernel_type_equality_wrapper.h
@@ -11,7 +11,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s) : Monique Teillaud <Monique.Teillaud@sophia.inria.fr>
 //             Sylvain Pion
diff --git a/Convex_hull_2/include/CGAL/Convex_hull_traits_adapter_2.h b/Convex_hull_2/include/CGAL/Convex_hull_traits_adapter_2.h
index f5aa3fe06d7e..b1a7c83210cd 100644
--- a/Convex_hull_2/include/CGAL/Convex_hull_traits_adapter_2.h
+++ b/Convex_hull_2/include/CGAL/Convex_hull_traits_adapter_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Sebastien Loriot
 
diff --git a/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h b/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h
index 6aad119ecc35..c5fdd7c3eff3 100644
--- a/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h
+++ b/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Laurent Rineau
diff --git a/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h b/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
index 5c37bffe9a05..7099eddc48cf 100644
--- a/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
+++ b/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Laurent Rineau and Maxime Gimeno
diff --git a/GraphicsView/include/CGAL/auto_link/Qt.h b/GraphicsView/include/CGAL/auto_link/Qt.h
index a08e108e2d34..f8efb5e983a0 100644
--- a/GraphicsView/include/CGAL/auto_link/Qt.h
+++ b/GraphicsView/include/CGAL/auto_link/Qt.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Laurent Rineau
diff --git a/GraphicsView/include/CGAL/export/Qt.h b/GraphicsView/include/CGAL/export/Qt.h
index a5b1c82fa197..8722c6d344c6 100644
--- a/GraphicsView/include/CGAL/export/Qt.h
+++ b/GraphicsView/include/CGAL/export/Qt.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri
diff --git a/Nef_2/include/CGAL/Nef_2/Polynomial.h b/Nef_2/include/CGAL/Nef_2/Polynomial.h
index a389fd9aae6b..1f335f6d387f 100644
--- a/Nef_2/include/CGAL/Nef_2/Polynomial.h
+++ b/Nef_2/include/CGAL/Nef_2/Polynomial.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Michael Seel <seel@mpi-sb.mpg.de>
diff --git a/Nef_2/include/CGAL/Nef_2/Polynomial_impl.h b/Nef_2/include/CGAL/Nef_2/Polynomial_impl.h
index 66417e9b99ae..19d7c0647787 100644
--- a/Nef_2/include/CGAL/Nef_2/Polynomial_impl.h
+++ b/Nef_2/include/CGAL/Nef_2/Polynomial_impl.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Michael Seel
diff --git a/Nef_2/include/CGAL/Nef_2/debug.h b/Nef_2/include/CGAL/Nef_2/debug.h
index d4ccc190ddc9..2583e37d523c 100644
--- a/Nef_2/include/CGAL/Nef_2/debug.h
+++ b/Nef_2/include/CGAL/Nef_2/debug.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Michael Seel <seel@mpi-sb.mpg.de>
diff --git a/Nef_2/include/CGAL/Nef_polynomial_fwd.h b/Nef_2/include/CGAL/Nef_polynomial_fwd.h
index 6e9af8ea6f90..34a534b0d712 100644
--- a/Nef_2/include/CGAL/Nef_polynomial_fwd.h
+++ b/Nef_2/include/CGAL/Nef_polynomial_fwd.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Stefan Schirra, Sylvain Pion
diff --git a/Nef_S2/include/CGAL/Nef_S2/OGL_base_object.h b/Nef_S2/include/CGAL/Nef_S2/OGL_base_object.h
index 7973729e89e7..2b129cc7ab22 100644
--- a/Nef_S2/include/CGAL/Nef_S2/OGL_base_object.h
+++ b/Nef_S2/include/CGAL/Nef_S2/OGL_base_object.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Peter Hachenberger  <hachenberger@mpi-sb.mpg.de>
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_power_side_of_oriented_power_sphere_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_power_side_of_oriented_power_sphere_3.h
index fa8288872a1d..8a1e06c29ba6 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_power_side_of_oriented_power_sphere_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_power_side_of_oriented_power_sphere_3.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction/internal/alpha_shape_mesh.h b/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction/internal/alpha_shape_mesh.h
index 99fdcbdab99b..20fcb339b2f6 100644
--- a/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction/internal/alpha_shape_mesh.h
+++ b/Polygonal_surface_reconstruction/include/CGAL/Polygonal_surface_reconstruction/internal/alpha_shape_mesh.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s) : Liangliang Nan
 
diff --git a/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h b/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
index c284f6e60b19..c9b266ebbd6f 100644
--- a/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
+++ b/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
 //
diff --git a/Polyhedron/include/CGAL/Polyhedron_items_with_id_3.h b/Polyhedron/include/CGAL/Polyhedron_items_with_id_3.h
index e792a2fe3bf8..008dae42a640 100644
--- a/Polyhedron/include/CGAL/Polyhedron_items_with_id_3.h
+++ b/Polyhedron/include/CGAL/Polyhedron_items_with_id_3.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Polyhedron/include/CGAL/boost/graph/graph_traits_Polyhedron_3.h b/Polyhedron/include/CGAL/boost/graph/graph_traits_Polyhedron_3.h
index 8cff560f0a68..7df39974c107 100644
--- a/Polyhedron/include/CGAL/boost/graph/graph_traits_Polyhedron_3.h
+++ b/Polyhedron/include/CGAL/boost/graph/graph_traits_Polyhedron_3.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Polyhedron/include/CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h b/Polyhedron/include/CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h
index cd0778ea3741..3571d0c3fa2c 100644
--- a/Polyhedron/include/CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h
+++ b/Polyhedron/include/CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3.h b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3.h
index 72fdf06ba751..2b35cb02b4d0 100644
--- a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3.h
+++ b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_features.h b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_features.h
index 70f89908c7f9..06a8f4a15148 100644
--- a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_features.h
+++ b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_features.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri
diff --git a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_time_stamp.h b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_time_stamp.h
index bd8ad12bc5ff..5a2fdc85417b 100644
--- a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_time_stamp.h
+++ b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_time_stamp.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri
diff --git a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_2.h b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_2.h
index 27c168ffa39c..345367b6c119 100644
--- a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_2.h
+++ b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_2.h
@@ -9,7 +9,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Sven Schoenherr <sven@inf.ethz.ch>
diff --git a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_3.h b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_3.h
index 459ea4b06df5..5f24e083d995 100644
--- a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_3.h
+++ b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_3.h
@@ -9,7 +9,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Sven Schoenherr <sven@inf.ethz.ch>
diff --git a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_d.h b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_d.h
index e7de86d30094..b115b610c72d 100644
--- a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_d.h
+++ b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_d.h
@@ -9,7 +9,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Sven Schoenherr <sven@inf.ethz.ch>
diff --git a/Principal_component_analysis/include/CGAL/Subiterator.h b/Principal_component_analysis/include/CGAL/Subiterator.h
index 186776918be3..0d31b12a8e82 100644
--- a/Principal_component_analysis/include/CGAL/Subiterator.h
+++ b/Principal_component_analysis/include/CGAL/Subiterator.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s) : Simon Giraudot
 //
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_stream.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_stream.h
index 6240cdb1a2e5..5adc8c897c20 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_stream.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_stream.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Fernando Cacciola
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_writer.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_writer.h
index 11a41b3a2045..e2d3ec5c50a9 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_writer.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_writer.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Fernando Cacciola
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/print.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/print.h
index a36df07b51e6..a389b96c138c 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/print.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/print.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Fernando Cacciola
diff --git a/Straight_skeleton_2/include/CGAL/certified_numeric_predicates.h b/Straight_skeleton_2/include/CGAL/certified_numeric_predicates.h
index a88aea91d790..5468e8b9699a 100644
--- a/Straight_skeleton_2/include/CGAL/certified_numeric_predicates.h
+++ b/Straight_skeleton_2/include/CGAL/certified_numeric_predicates.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Fernando Cacciola <fernando_cacciola@ciudad.com.ar>
 //
diff --git a/Straight_skeleton_2/include/CGAL/certified_quotient_predicates.h b/Straight_skeleton_2/include/CGAL/certified_quotient_predicates.h
index d6896189349d..46ba2d948c20 100644
--- a/Straight_skeleton_2/include/CGAL/certified_quotient_predicates.h
+++ b/Straight_skeleton_2/include/CGAL/certified_quotient_predicates.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Fernando Cacciola <fernando_cacciola@ciudad.com.ar>
 //
diff --git a/Surface_mesh/include/CGAL/boost/graph/graph_traits_Surface_mesh.h b/Surface_mesh/include/CGAL/boost/graph/graph_traits_Surface_mesh.h
index d044c38a5570..b46df17715ba 100644
--- a/Surface_mesh/include/CGAL/boost/graph/graph_traits_Surface_mesh.h
+++ b/Surface_mesh/include/CGAL/boost/graph/graph_traits_Surface_mesh.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Philipp Moeller
diff --git a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h
index 281c2b37093e..785cec65003d 100644
--- a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h
+++ b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Philipp Möller
diff --git a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h
index b6fbb66f9681..68fd42eb79e1 100644
--- a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h
+++ b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri
diff --git a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h
index d1df35ed90f9..06baa03192ef 100644
--- a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h
+++ b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri
diff --git a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
index 60c52e52e7f9..654560ce4195 100644
--- a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
+++ b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Gael Guennebaud and Ilker O. Yaz
 
diff --git a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
index a73d8225bdb9..b5ba19187ac5 100644
--- a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
+++ b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Gael Guennebaud Ilker O. Yaz
 
diff --git a/Surface_mesher/include/CGAL/Surface_mesher/Profile_counter.h b/Surface_mesher/include/CGAL/Surface_mesher/Profile_counter.h
index 81f88f84017b..32591b239685 100644
--- a/Surface_mesher/include/CGAL/Surface_mesher/Profile_counter.h
+++ b/Surface_mesher/include/CGAL/Surface_mesher/Profile_counter.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Laurent Rineau
diff --git a/TDS_2/include/CGAL/boost/graph/graph_traits_Triangulation_data_structure_2.h b/TDS_2/include/CGAL/boost/graph/graph_traits_Triangulation_data_structure_2.h
index 738013e24896..2ebbf85432b8 100644
--- a/TDS_2/include/CGAL/boost/graph/graph_traits_Triangulation_data_structure_2.h
+++ b/TDS_2/include/CGAL/boost/graph/graph_traits_Triangulation_data_structure_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h b/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h
index 9b5f303250d0..483690396b5f 100644
--- a/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h
+++ b/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/TDS_2/include/CGAL/boost/graph/properties_Triangulation_data_structure_2.h b/TDS_2/include/CGAL/boost/graph/properties_Triangulation_data_structure_2.h
index 0beda7ff5e20..151af643059c 100644
--- a/TDS_2/include/CGAL/boost/graph/properties_Triangulation_data_structure_2.h
+++ b/TDS_2/include/CGAL/boost/graph/properties_Triangulation_data_structure_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/Triangulation/include/CGAL/IO/Triangulation_off_ostream.h b/Triangulation/include/CGAL/IO/Triangulation_off_ostream.h
index 3098d8310229..5dbe2895f10c 100644
--- a/Triangulation/include/CGAL/IO/Triangulation_off_ostream.h
+++ b/Triangulation/include/CGAL/IO/Triangulation_off_ostream.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Clement Jamin
 
diff --git a/Triangulation_2/include/CGAL/IO/Triangulation_off_ostream_2.h b/Triangulation_2/include/CGAL/IO/Triangulation_off_ostream_2.h
index 0274a227cc14..6d96c38bcb96 100644
--- a/Triangulation_2/include/CGAL/IO/Triangulation_off_ostream_2.h
+++ b/Triangulation_2/include/CGAL/IO/Triangulation_off_ostream_2.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Clement Jamin
 
diff --git a/Triangulation_2/include/CGAL/Triangulation_2/internal/CTP2_subconstraint_graph.h b/Triangulation_2/include/CGAL/Triangulation_2/internal/CTP2_subconstraint_graph.h
index 77e212b9f04c..5eab13d4c1ef 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2/internal/CTP2_subconstraint_graph.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2/internal/CTP2_subconstraint_graph.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Simon Giraudot
diff --git a/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h b/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h
index 86d9a71f51e5..6f24fd8e50ef 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
 //
diff --git a/Triangulation_2/include/CGAL/Triangulation_face_base_with_id_2.h b/Triangulation_2/include/CGAL/Triangulation_face_base_with_id_2.h
index d5d344c8aa87..72fd9fcfba6c 100644
--- a/Triangulation_2/include/CGAL/Triangulation_face_base_with_id_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_face_base_with_id_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Mael Rouxel-Labbé
diff --git a/Triangulation_2/include/CGAL/Triangulation_vertex_base_with_id_2.h b/Triangulation_2/include/CGAL/Triangulation_vertex_base_with_id_2.h
index 290fad8db5f0..aca49c503bcb 100644
--- a/Triangulation_2/include/CGAL/Triangulation_vertex_base_with_id_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_vertex_base_with_id_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Triangulation_2/include/CGAL/apply_to_range.h b/Triangulation_2/include/CGAL/apply_to_range.h
index f09433e7d571..9df2dbd23669 100644
--- a/Triangulation_2/include/CGAL/apply_to_range.h
+++ b/Triangulation_2/include/CGAL/apply_to_range.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Radu Ursu
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_Delaunay_triangulation_2.h
index d1d82115ec83..c4a6e7f61bdb 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_Delaunay_triangulation_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_2.h
index 67419f0d7612..3f4fa4e92457 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_plus_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_plus_2.h
index 6cb7c45d8b26..85f44168e9a4 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_plus_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_plus_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h
index 26caf574e037..35ac74f22ea0 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Regular_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Regular_triangulation_2.h
index 572bbeaebbb0..4595604b503f 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Regular_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Regular_triangulation_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_2.h
index 99312b8323f3..42bbed130b5d 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_hierarchy_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_hierarchy_2.h
index e3ae435381b6..cd07894b3131 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_hierarchy_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_hierarchy_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
 // Author(s)     : Andreas Fabri, Fernando Cacciola
diff --git a/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation.h b/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation.h
index 27a5994dcaae..e120e7d626fb 100644
--- a/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation.h
+++ b/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé,
 //                 Andreas Fabri,
diff --git a/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h b/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h
index 0c2904243c5f..46a904bc1c36 100644
--- a/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h
+++ b/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/internal/properties_2D_triangulation.h b/Triangulation_2/include/CGAL/boost/graph/internal/properties_2D_triangulation.h
index 7111e237ef67..65516f9f3b34 100644
--- a/Triangulation_2/include/CGAL/boost/graph/internal/properties_2D_triangulation.h
+++ b/Triangulation_2/include/CGAL/boost/graph/internal/properties_2D_triangulation.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_Delaunay_triangulation_2.h
index 8aa353982405..b070a293df1e 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_Delaunay_triangulation_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_2.h
index 7f95526668aa..e56fc487b477 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_plus_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_plus_2.h
index 915d45b65197..6e0f16ea086b 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_plus_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_plus_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Delaunay_triangulation_2.h
index 000995d9ca9c..6367bc5a58b2 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Delaunay_triangulation_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Regular_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Regular_triangulation_2.h
index 5030385656c2..7d91b01ae968 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Regular_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Regular_triangulation_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_2.h
index 2a076b16cd60..25c60a34d801 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_hierarchy_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_hierarchy_2.h
index f20cef1d9f42..9ed8bbdb1939 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_hierarchy_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_hierarchy_2.h
@@ -4,7 +4,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Mael Rouxel-Labbé
 
diff --git a/Triangulation_3/include/CGAL/IO/Triangulation_off_ostream_3.h b/Triangulation_3/include/CGAL/IO/Triangulation_off_ostream_3.h
index d18ffbb7fea7..4708dc1b7e12 100644
--- a/Triangulation_3/include/CGAL/IO/Triangulation_off_ostream_3.h
+++ b/Triangulation_3/include/CGAL/IO/Triangulation_off_ostream_3.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Clement Jamin
 
diff --git a/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h b/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h
index 14f718f0b138..43079354d0aa 100644
--- a/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h
+++ b/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
 //

From c35a1b15d1dff1fb0b976ae22cb849990aa8e39f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 13:42:27 +0100
Subject: [PATCH 1238/1398] add missing license include directives

---
 .../include/CGAL/Arr_algebraic_segment_traits_2.h        | 9 ++++++---
 .../include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h    | 3 +++
 .../Curve_interval_arcno_cache.h                         | 3 +++
 .../Curved_kernel_via_analysis_2/Curve_renderer_facade.h | 3 +++
 .../Curved_kernel_via_analysis_2_functors.h              | 3 +++
 .../Curved_kernel_via_analysis_2_impl.h                  | 3 +++
 .../Filtered_curved_kernel_via_analysis_2_impl.h         | 3 +++
 .../CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h    | 3 +++
 .../CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h  | 3 +++
 .../Curved_kernel_via_analysis_2/Make_x_monotone_2.h     | 3 +++
 .../Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h  | 3 +++
 .../include/CGAL/Curved_kernel_via_analysis_2/Point_2.h  | 3 +++
 .../Sweep_curves_adapter_2.h                             | 5 ++++-
 .../Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h  | 3 +++
 .../gfx/Curve_renderer_internals.h                       | 5 ++++-
 .../gfx/Curve_renderer_traits.h                          | 3 +++
 .../Curved_kernel_via_analysis_2/gfx/Subdivision_1.h     | 5 ++++-
 .../Curved_kernel_via_analysis_2/gfx/Subdivision_2.h     | 5 ++++-
 .../Curved_kernel_via_analysis_2/test/simple_models.h    | 3 +++
 .../CGAL/boost/graph/graph_traits_Arrangement_2.h        | 3 +++
 .../CGAL/boost/graph/graph_traits_Dual_Arrangement_2.h   | 3 +++
 .../include/CGAL/draw_arrangement_2.h                    | 3 +++
 22 files changed, 73 insertions(+), 7 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
index ad5dfd4ed550..03566eaa9197 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arr_algebraic_segment_traits_2.h
@@ -12,8 +12,11 @@
 //
 // ============================================================================
 
-#ifndef CGAL_ARR_ALGEBRAIC_SEGMENT_TRAITS
-#define CGAL_ARR_ALGEBRAIC_SEGMENT_TRAITS
+#ifndef CGAL_ARR_ALGEBRAIC_SEGMENT_TRAITS_H
+#define CGAL_ARR_ALGEBRAIC_SEGMENT_TRAITS_H
+
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
 
 #include <CGAL/disable_warnings.h>
 
@@ -655,4 +658,4 @@ class Arr_algebraic_segment_traits_2 {
 
 #include <CGAL/enable_warnings.h>
 
-#endif // CGAL_ARR_ALGEBRAIC_SEGMENT_TRAITS
+#endif // CGAL_ARR_ALGEBRAIC_SEGMENT_TRAITS_H
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h
index 3c56db0f0a32..c7a47a2c1b2a 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_ARC_2_H
 #define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_ARC_2_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 /*!\file include/CGAL/Curved_kernel_via_analysis_2/Arc_2.h
  *\brief defines class \c Arc_2 that represents an arc on a curve that
  * can be analyzed.
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_interval_arcno_cache.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_interval_arcno_cache.h
index 550037a680a9..36152129a941 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_interval_arcno_cache.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_interval_arcno_cache.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_CURVE_INTERVAL_ARCNO_CACHE_H
 #define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_CURVE_INTERVAL_ARCNO_CACHE_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 /*!\file include/CGAL/Curved_kernel_via_analysis_2/Curve_interval_arcno_cache.h
  * \brief defines \c Curve_interval_arcno_cache functor
  */
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
index e7b6055422aa..dc31345cf8c0 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curve_renderer_facade.h
@@ -21,6 +21,9 @@
 #ifndef CGAL_CKVA_CURVE_RENDERER_FACADE_H
 #define CGAL_CKVA_CURVE_RENDERER_FACADE_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 // do not compile curve renderer code (for fast debugging)
 //#define CGAL_CKVA_DUMMY_RENDERER
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
index 14b983bcf45e..7087285e754f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
@@ -14,6 +14,9 @@
 #ifndef CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_FUNCTORS_H
 #define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_FUNCTORS_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 /*!\file include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_functors.h
  * \brief defines Curved_kernel_via_analysis_2 function objects + class
  */
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_impl.h
index 7457f4bae232..cbc2a9ad81ad 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Curved_kernel_via_analysis_2_impl.h
@@ -14,6 +14,9 @@
 #ifndef CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_IMPL_H
 #define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_IMPL_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 /*!\file include/CGAL/Curved_kernel_via_analysis_2.h
  * \brief defines class \c Curved_kernel_via_analysis_2
  *
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Filtered_curved_kernel_via_analysis_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Filtered_curved_kernel_via_analysis_2_impl.h
index 80a36a222722..34eb19ae4b29 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Filtered_curved_kernel_via_analysis_2_impl.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Filtered_curved_kernel_via_analysis_2_impl.h
@@ -15,6 +15,9 @@
 #ifndef CGAL_FILTERED_CURVED_KERNEL_VIA_ANALYSIS_2_IMPL_H
 #define CGAL_FILTERED_CURVED_KERNEL_VIA_ANALYSIS_2_IMPL_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 /*!\file include/CGAL/Filtered_curved_kernel_via_analysis_2.h
  * \brief defines class \c Filtered_curved_kernel_via_analysis_2
  *
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h
index b66255a061d8..d0f318f0fa6f 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h
@@ -14,6 +14,9 @@
 #ifndef CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_GENERIC_ARC_2_H
 #define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_GENERIC_ARC_2_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 /*!\file include/CGAL/Curved_kernel_via_analysis_2/Generic_arc_2.h
  * \brief defines class \c Generic_arc_2
  *
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h
index 050ccd7dcf55..b13e3cd0da4a 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_GENERIC_POINT_2_H
 #define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_GENERIC_POINT_2_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 /*!\file include/CGAL/Curved_kernel_via_analysis_2/Generic_point_2.h
  * \brief defines class \c Generic_point_2
  *
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h
index f5afe7c8a0b8..0b495e31bc23 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h
@@ -17,6 +17,9 @@
 #ifndef CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_MAKE_X_MONOTONE_2_H
 #define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_MAKE_X_MONOTONE_2_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 /*!\file include/CGAL/Curved_kernel_via_analysis_2/Make_x_monotone_2.h
  * \brief defines \c Make_x_monotone_2 functor
  */
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h
index 8043447ceaac..9e95d7de5fbc 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_NON_X_MONOTONE_ARC_2_H
 #define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_NON_X_MONOTONE_ARC_2_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 /*!\file include/CGAL/Curved_kernel_via_analysis_2/Non_x_monotone_arc_2.h
  * \brief defines class \c Non_x_monotone_arc_2
  *
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
index 31a98218fbdd..f2c5c1bec8a6 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
@@ -14,6 +14,9 @@
 #ifndef CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_POINT_2_H
 #define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_POINT_2_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 /*!\file include/CGAL/Curved_kernel_via_analysis_2/Point_2.h
  * \brief defines class \c Point_2 that represents a point on a curve that can
  * be analyzed.
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
index 748e05e4094d..9576806a1b38 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
@@ -11,7 +11,10 @@
 // Author(s)     : Pavel Emeliyanenko <asm@mpi-sb.mpg.de>
 
 #ifndef CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_SWEEP_CURVES_ADAPTER_2_H
-#define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_SWEEP_CURVES_ADAPTER_2_H 1
+#define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_SWEEP_CURVES_ADAPTER_2_H
+
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
 
 /*!\file include/CGAL/Curved_kernel_via_analysis_2/Sweep_curves_adapter_2.h
  * \brief defines class \c Sweep_curves_adapter_2
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h
index e6a4a6cc737d..fcf022620d90 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_2.h
@@ -19,6 +19,9 @@
 #ifndef CGAL_CKVA_CURVE_RENDERER_2_H
 #define CGAL_CKVA_CURVE_RENDERER_2_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 #ifndef CGAL_AK_ENABLE_DEPRECATED_INTERFACE
 #define CGAL_AK_ENABLE_DEPRECATED_INTERFACE 1
 #endif
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
index 273f40362de1..1cbc6be55359 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
@@ -22,7 +22,10 @@
  */
 
 #ifndef CGAL_CKVA_CURVE_RENDERER_INTERNALS_H
-#define CGAL_CKVA_CURVE_RENDERER_INTERNALS_H 1
+#define CGAL_CKVA_CURVE_RENDERER_INTERNALS_H
+
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
 
 #include <vector>
 #include <stack>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_traits.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_traits.h
index 56465713530d..5300354df86a 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_traits.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_traits.h
@@ -14,6 +14,9 @@
 #ifndef CGAL_CKVA_CURVE_RENDERER_TRAITS_H
 #define CGAL_CKVA_CURVE_RENDERER_TRAITS_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 #include <CGAL/basic.h>
 #include <CGAL/function_objects.h>
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_1.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_1.h
index 196d7f53bee0..078b7df5b8ea 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_1.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_1.h
@@ -17,7 +17,10 @@
  */
 
 #ifndef CGAL_CKVA_SUBDIVISION_1_H
-#define CGAL_CKVA_SUBDIVISION_1_H 1
+#define CGAL_CKVA_SUBDIVISION_1_H
+
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
 
 #include <vector>
 #include <boost/multi_index_container.hpp>
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_2.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_2.h
index 7a72d48268b1..5a70721c6093 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Subdivision_2.h
@@ -17,7 +17,10 @@
  */
 
 #ifndef CGAL_CKVA_SUBDIVISION_2_H
-#define CGAL_CKVA_SUBDIVISION_2_H 1
+#define CGAL_CKVA_SUBDIVISION_2_H
+
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
 
 #warning this file is considered obsolete
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
index 14ef6913281d..c81fd5b93bd4 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_TEST_SIMPLE_MODELS_H
 #define CGAL_CURVED_KERNEL_VIA_ANALYSIS_2_TEST_SIMPLE_MODELS_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 /*!\file include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
  * \brief defines dummy implementations satisfying Curve_kernel_2
  * concept requirenments
diff --git a/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Arrangement_2.h b/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Arrangement_2.h
index 0d3fd5af5c83..aabdea5bb495 100644
--- a/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Arrangement_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Arrangement_2.h
@@ -14,6 +14,9 @@
 #ifndef CGAL_BOOST_GRAPH_GRAPH_TRAITS_ARRANGEMENT_2_H
 #define CGAL_BOOST_GRAPH_GRAPH_TRAITS_ARRANGEMENT_2_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 #include <CGAL/graph_traits_Arrangement_2.h>
 
 #endif //CGAL_BOOST_GRAPH_GRAPH_TRAITS_ARRANGEMENT_2_H
diff --git a/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Dual_Arrangement_2.h b/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Dual_Arrangement_2.h
index 41c102cb65b0..f46345c3fcc1 100644
--- a/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Dual_Arrangement_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/boost/graph/graph_traits_Dual_Arrangement_2.h
@@ -14,6 +14,9 @@
 #ifndef CGAL_BOOST_GRAPH_GRAPH_TRAITS_DUAL_ARRANGEMENT_2_H
 #define CGAL_BOOST_GRAPH_GRAPH_TRAITS_ARRANGEMENT_2_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 #include <CGAL/graph_traits_dual_arrangement_2.h>
 
 #endif //CGAL_BOOST_GRAPH_GRAPH_TRAITS_DUAL_ARRANGEMENT_2_H
diff --git a/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h b/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h
index ffd6af38c9ce..7810ca4e62f1 100644
--- a/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/draw_arrangement_2.h
@@ -17,6 +17,9 @@
 #ifndef CGAL_DRAW_ARRANGEMENT_2_H
 #define CGAL_DRAW_ARRANGEMENT_2_H
 
+#include <CGAL/license/Arrangement_on_surface_2.h>
+
+
 #include <CGAL/config.h>
 
 #include <unordered_map>

From c99b69a0e7d21df6e2b468936a9f08d47f3dda22 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 13:50:15 +0100
Subject: [PATCH 1239/1398] add missing license headers

---
 .../include/CGAL/draw_polygon_set_2.h                    | 3 +++
 .../include/CGAL/Min_sphere_annulus_d_traits_2.h         | 3 +++
 .../include/CGAL/Min_sphere_annulus_d_traits_3.h         | 3 +++
 .../include/CGAL/Min_sphere_annulus_d_traits_d.h         | 3 +++
 .../include/CGAL/Circular_kernel_2/Intersection_traits.h | 3 +++
 .../include/CGAL/Circular_kernel_3/Intersection_traits.h | 3 +++
 .../CGAL/Spherical_kernel_type_equality_wrapper.h        | 3 +++
 .../include/CGAL/Convex_hull_traits_adapter_2.h          | 3 +++
 GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h            | 3 +++
 GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h       | 3 +++
 GraphicsView/include/CGAL/auto_link/Qt.h                 | 3 +++
 GraphicsView/include/CGAL/export/Qt.h                    | 3 +++
 Nef_2/include/CGAL/Nef_2/Polynomial.h                    | 3 +++
 Nef_2/include/CGAL/Nef_2/Polynomial_impl.h               | 7 +++++++
 Nef_2/include/CGAL/Nef_2/debug.h                         | 3 +++
 Nef_2/include/CGAL/Nef_polynomial_fwd.h                  | 3 +++
 Nef_S2/include/CGAL/Nef_S2/OGL_base_object.h             | 3 +++
 .../Periodic_3_power_side_of_oriented_power_sphere_3.h   | 3 +++
 Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h            | 3 +++
 Polyhedron/include/CGAL/Polyhedron_items_with_id_3.h     | 5 ++++-
 .../include/CGAL/boost/graph/graph_traits_Polyhedron_3.h | 3 +++
 .../boost/graph/halfedge_graph_traits_Polyhedron_3.h     | 3 +++
 .../include/CGAL/boost/graph/properties_Polyhedron_3.h   | 3 +++
 .../CGAL/boost/graph/properties_Polyhedron_3_features.h  | 3 +++
 .../boost/graph/properties_Polyhedron_3_time_stamp.h     | 3 +++
 .../include/CGAL/Polytope_distance_d_traits_2.h          | 3 +++
 .../include/CGAL/Polytope_distance_d_traits_3.h          | 3 +++
 .../include/CGAL/Polytope_distance_d_traits_d.h          | 3 +++
 Principal_component_analysis/include/CGAL/Subiterator.h  | 3 +++
 .../include/CGAL/Straight_skeleton_2/IO/Dxf_stream.h     | 3 +++
 .../include/CGAL/Straight_skeleton_2/IO/Dxf_writer.h     | 3 +++
 .../include/CGAL/Straight_skeleton_2/IO/print.h          | 3 +++
 .../include/CGAL/certified_numeric_predicates.h          | 3 +++
 .../include/CGAL/certified_quotient_predicates.h         | 3 +++
 .../CGAL/boost/graph/properties_Surface_mesh_features.h  | 3 +++
 .../boost/graph/properties_Surface_mesh_time_stamp.h     | 3 +++
 .../include/CGAL/Surface_mesher/Profile_counter.h        | 3 +++
 .../graph/graph_traits_Triangulation_data_structure_2.h  | 3 +++
 .../boost/graph/internal/graph_traits_2D_TDS_helper.h    | 9 ++++++---
 .../graph/properties_Triangulation_data_structure_2.h    | 3 +++
 .../include/CGAL/IO/Triangulation_off_ostream.h          | 3 +++
 .../include/CGAL/IO/Triangulation_off_ostream_2.h        | 3 +++
 Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h    | 3 +++
 .../include/CGAL/Triangulation_face_base_with_id_2.h     | 3 +++
 .../include/CGAL/Triangulation_vertex_base_with_id_2.h   | 3 +++
 Triangulation_2/include/CGAL/apply_to_range.h            | 9 ++++++---
 .../graph_traits_Constrained_Delaunay_triangulation_2.h  | 3 +++
 .../graph/graph_traits_Constrained_triangulation_2.h     | 3 +++
 .../graph_traits_Constrained_triangulation_plus_2.h      | 3 +++
 .../boost/graph/graph_traits_Delaunay_triangulation_2.h  | 3 +++
 .../boost/graph/graph_traits_Regular_triangulation_2.h   | 3 +++
 .../CGAL/boost/graph/graph_traits_Triangulation_2.h      | 3 +++
 .../boost/graph/graph_traits_Triangulation_hierarchy_2.h | 3 +++
 .../boost/graph/internal/graph_traits_2D_triangulation.h | 2 ++
 .../internal/graph_traits_2D_triangulation_helper.h      | 9 ++++++---
 .../boost/graph/internal/properties_2D_triangulation.h   | 3 +++
 .../properties_Constrained_Delaunay_triangulation_2.h    | 3 +++
 .../boost/graph/properties_Constrained_triangulation_2.h | 3 +++
 .../graph/properties_Constrained_triangulation_plus_2.h  | 3 +++
 .../boost/graph/properties_Delaunay_triangulation_2.h    | 3 +++
 .../boost/graph/properties_Regular_triangulation_2.h     | 3 +++
 .../CGAL/boost/graph/properties_Triangulation_2.h        | 3 +++
 .../boost/graph/properties_Triangulation_hierarchy_2.h   | 3 +++
 .../include/CGAL/IO/Triangulation_off_ostream_3.h        | 3 +++
 Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h    | 3 +++
 65 files changed, 208 insertions(+), 10 deletions(-)

diff --git a/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h b/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h
index 58156ed66408..bd9cfec7f7cb 100644
--- a/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h
+++ b/Boolean_set_operations_2/include/CGAL/draw_polygon_set_2.h
@@ -17,6 +17,9 @@
 #ifndef CGAL_DRAW_POLYGON_SET_2_H
 #define CGAL_DRAW_POLYGON_SET_2_H
 
+#include <CGAL/license/Boolean_set_operations_2.h>
+
+
 #include <CGAL/Qt/Basic_viewer_qt.h>
 
 #ifdef DOXYGEN_RUNNING
diff --git a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_2.h b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_2.h
index 434368e3ef18..933212c0c6bc 100644
--- a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_2.h
+++ b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_2.h
@@ -17,6 +17,9 @@
 #ifndef CGAL_MIN_SPHERE_ANNULUS_D_TRAITS_2_H
 #define CGAL_MIN_SPHERE_ANNULUS_D_TRAITS_2_H
 
+#include <CGAL/license/Bounding_volumes.h>
+
+
 // includes
 #  include <CGAL/Optimisation/Access_dimension_2.h>
 #  include <CGAL/Optimisation/Access_coordinates_begin_2.h>
diff --git a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_3.h b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_3.h
index 7873d6f4b1a7..a941f4e0b469 100644
--- a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_3.h
+++ b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_3.h
@@ -17,6 +17,9 @@
 #ifndef CGAL_MIN_SPHERE_ANNULUS_D_TRAITS_3_H
 #define CGAL_MIN_SPHERE_ANNULUS_D_TRAITS_3_H
 
+#include <CGAL/license/Bounding_volumes.h>
+
+
 // includes
 #  include <CGAL/Optimisation/Access_dimension_3.h>
 #  include <CGAL/Optimisation/Access_coordinates_begin_3.h>
diff --git a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_d.h b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_d.h
index 0730222f2518..ff1feca70bde 100644
--- a/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_d.h
+++ b/Bounding_volumes/include/CGAL/Min_sphere_annulus_d_traits_d.h
@@ -17,6 +17,9 @@
 #ifndef CGAL_MIN_SPHERE_ANULUS_D_TRAITS_D_H
 #define CGAL_MIN_SPHERE_ANULUS_D_TRAITS_D_H
 
+#include <CGAL/license/Bounding_volumes.h>
+
+
 // includes
 #  include <CGAL/Optimisation/Access_dimension_d.h>
 #  include <CGAL/Optimisation/Access_coordinates_begin_d.h>
diff --git a/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h b/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h
index 8896e76c23b1..bab7cfadfc11 100644
--- a/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h
+++ b/Circular_kernel_2/include/CGAL/Circular_kernel_2/Intersection_traits.h
@@ -17,6 +17,9 @@
 #ifndef CGAL_CIRCULAR_KERNEL_2_INTERSECTION_TRAITS_H
 #define CGAL_CIRCULAR_KERNEL_2_INTERSECTION_TRAITS_H
 
+#include <CGAL/license/Circular_kernel_2.h>
+
+
 #include <CGAL/Intersection_traits.h>
 
 #include <variant>
diff --git a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
index b2319846ecbf..ed6ac62628fb 100644
--- a/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
+++ b/Circular_kernel_3/include/CGAL/Circular_kernel_3/Intersection_traits.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_CIRCULAR_KERNEL_3_INTERSECTION_TRAITS_H
 #define CGAL_CIRCULAR_KERNEL_3_INTERSECTION_TRAITS_H
 
+#include <CGAL/license/Circular_kernel_3.h>
+
+
 #include <CGAL/Intersection_traits.h>
 
 #include <variant>
diff --git a/Circular_kernel_3/include/CGAL/Spherical_kernel_type_equality_wrapper.h b/Circular_kernel_3/include/CGAL/Spherical_kernel_type_equality_wrapper.h
index 432fc6bc6351..7e3e82c822dc 100644
--- a/Circular_kernel_3/include/CGAL/Spherical_kernel_type_equality_wrapper.h
+++ b/Circular_kernel_3/include/CGAL/Spherical_kernel_type_equality_wrapper.h
@@ -22,6 +22,9 @@
 #ifndef CGAL_SPHERICAL_KERNEL_TYPE_EQUALITY_WRAPPER_H
 #define CGAL_SPHERICAL_KERNEL_TYPE_EQUALITY_WRAPPER_H
 
+#include <CGAL/license/Circular_kernel_3.h>
+
+
 #include <CGAL/user_classes.h>
 #include <CGAL/Circular_arc_point_3.h>
 #include <CGAL/Circular_arc_3.h>
diff --git a/Convex_hull_2/include/CGAL/Convex_hull_traits_adapter_2.h b/Convex_hull_2/include/CGAL/Convex_hull_traits_adapter_2.h
index b1a7c83210cd..eb7f87c96eaa 100644
--- a/Convex_hull_2/include/CGAL/Convex_hull_traits_adapter_2.h
+++ b/Convex_hull_2/include/CGAL/Convex_hull_traits_adapter_2.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_CONVEX_HULL_TRAITS_ADAPTER_2_H
 #define CGAL_CONVEX_HULL_TRAITS_ADAPTER_2_H
 
+#include <CGAL/license/Convex_hull_2.h>
+
+
 #include <boost/call_traits.hpp>
 
 #include <CGAL/property_map.h>
diff --git a/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h b/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h
index c5fdd7c3eff3..a617735b67e7 100644
--- a/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h
+++ b/GraphicsView/include/CGAL/Qt/CGAL_Qt_config.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_QT_CONFIG_H
 #define CGAL_QT_CONFIG_H
 
+#include <CGAL/license/GraphicsView.h>
+
+
 #include <QtCore/qglobal.h>
 
 #if defined(CGAL_Qt6_DLL)
diff --git a/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h b/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
index 7099eddc48cf..c984b85a5d23 100644
--- a/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
+++ b/GraphicsView/include/CGAL/Qt/CreateOpenGLContext.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_QT_CREATE_OPENGL_CONTEXT_H
 #define CGAL_QT_CREATE_OPENGL_CONTEXT_H
 
+#include <CGAL/license/GraphicsView.h>
+
+
 #include <QOpenGLContext>
 
 namespace CGAL{
diff --git a/GraphicsView/include/CGAL/auto_link/Qt.h b/GraphicsView/include/CGAL/auto_link/Qt.h
index f8efb5e983a0..a27bb073b2b3 100644
--- a/GraphicsView/include/CGAL/auto_link/Qt.h
+++ b/GraphicsView/include/CGAL/auto_link/Qt.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_AUTO_LINK_QT_H
 #define CGAL_AUTO_LINK_QT_H
 
+#include <CGAL/license/GraphicsView.h>
+
+
 #include <CGAL/config.h>
 #include <QtCore/qglobal.h>
 
diff --git a/GraphicsView/include/CGAL/export/Qt.h b/GraphicsView/include/CGAL/export/Qt.h
index 8722c6d344c6..14ea46c63800 100644
--- a/GraphicsView/include/CGAL/export/Qt.h
+++ b/GraphicsView/include/CGAL/export/Qt.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_QT_EXPORT_H
 #define CGAL_QT_EXPORT_H
 
+#include <CGAL/license/GraphicsView.h>
+
+
 #include <CGAL/config.h>
 #include <CGAL/export/helpers.h>
 
diff --git a/Nef_2/include/CGAL/Nef_2/Polynomial.h b/Nef_2/include/CGAL/Nef_2/Polynomial.h
index 1f335f6d387f..ef494741b988 100644
--- a/Nef_2/include/CGAL/Nef_2/Polynomial.h
+++ b/Nef_2/include/CGAL/Nef_2/Polynomial.h
@@ -14,6 +14,9 @@
 #ifndef CGAL_NEF_2_POLYNOMIAL_H
 #define CGAL_NEF_2_POLYNOMIAL_H
 
+#include <CGAL/license/Nef_2.h>
+
+
 #include <CGAL/basic.h>
 #include <CGAL/kernel_assertions.h>
 #include <CGAL/Handle_for.h>
diff --git a/Nef_2/include/CGAL/Nef_2/Polynomial_impl.h b/Nef_2/include/CGAL/Nef_2/Polynomial_impl.h
index 19d7c0647787..0e39b126b4d4 100644
--- a/Nef_2/include/CGAL/Nef_2/Polynomial_impl.h
+++ b/Nef_2/include/CGAL/Nef_2/Polynomial_impl.h
@@ -11,6 +11,11 @@
 // Author(s)     : Michael Seel
 //                 Andreas Fabri
 
+#ifndef CGAL_NEF_2_POLYNOMIAL_IMPL_H
+#define CGAL_NEF_2_POLYNOMIAL_IMPL_H
+
+#include <CGAL/license/Nef_2.h>
+
 
 namespace CGAL{
 
@@ -202,3 +207,5 @@ Polynomial<double> Polynomial<double>::gcd(
 
 } // end namespace Nef
 }//end namespace CGAL
+
+#endif //CGAL_NEF_2_POLYNOMIAL_IMPL_H
diff --git a/Nef_2/include/CGAL/Nef_2/debug.h b/Nef_2/include/CGAL/Nef_2/debug.h
index 2583e37d523c..001eaeaa1ef9 100644
--- a/Nef_2/include/CGAL/Nef_2/debug.h
+++ b/Nef_2/include/CGAL/Nef_2/debug.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_NEF_2_DEBUG_H
 #define CGAL_NEF_2_DEBUG_H
 
+#include <CGAL/license/Nef_2.h>
+
+
 #include <iostream>
 
 #ifdef NDEBUG
diff --git a/Nef_2/include/CGAL/Nef_polynomial_fwd.h b/Nef_2/include/CGAL/Nef_polynomial_fwd.h
index 34a534b0d712..17cc9df36f9e 100644
--- a/Nef_2/include/CGAL/Nef_polynomial_fwd.h
+++ b/Nef_2/include/CGAL/Nef_polynomial_fwd.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_NEF_POLYNOMIAL_FWD_H
 #define CGAL_NEF_POLYNOMIAL_FWD_H
 
+#include <CGAL/license/Nef_2.h>
+
+
 #include <CGAL/enum.h>
 
 // Forward declarations of functions over Polynomial and Nef_polynomial
diff --git a/Nef_S2/include/CGAL/Nef_S2/OGL_base_object.h b/Nef_S2/include/CGAL/Nef_S2/OGL_base_object.h
index 2b129cc7ab22..f813b7dc9f44 100644
--- a/Nef_S2/include/CGAL/Nef_S2/OGL_base_object.h
+++ b/Nef_S2/include/CGAL/Nef_S2/OGL_base_object.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_OGL_BASE_OBJECT_H
 #define CGAL_OGL_BASE_OBJECT_H
 
+#include <CGAL/license/Nef_S2.h>
+
+
 #include <CGAL/Simple_cartesian.h>
 
 namespace CGAL {
diff --git a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_power_side_of_oriented_power_sphere_3.h b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_power_side_of_oriented_power_sphere_3.h
index 8a1e06c29ba6..748034a41ab8 100644
--- a/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_power_side_of_oriented_power_sphere_3.h
+++ b/Periodic_3_triangulation_3/include/CGAL/Periodic_3_triangulation_3/internal/Static_filters/Periodic_3_power_side_of_oriented_power_sphere_3.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_INTERNAL_STATIC_FILTERS_PERIODIC_3_POWER_TEST_3_H
 #define CGAL_INTERNAL_STATIC_FILTERS_PERIODIC_3_POWER_TEST_3_H
 
+#include <CGAL/license/Periodic_3_triangulation_3.h>
+
+
 #include <CGAL/Profile_counter.h>
 #include <CGAL/Filtered_kernel/internal/Static_filters/Static_filter_error.h>
 #include <CGAL/Filtered_kernel/internal/Static_filters/tools.h>
diff --git a/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h b/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
index c9b266ebbd6f..18db0dc8e346 100644
--- a/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
+++ b/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_POLYHEDRON_3_TO_LCC_H
 #define CGAL_POLYHEDRON_3_TO_LCC_H
 
+#include <CGAL/license/Polyhedron.h>
+
+
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/assertions.h>
 #include <iostream>
diff --git a/Polyhedron/include/CGAL/Polyhedron_items_with_id_3.h b/Polyhedron/include/CGAL/Polyhedron_items_with_id_3.h
index 008dae42a640..2bbea0027753 100644
--- a/Polyhedron/include/CGAL/Polyhedron_items_with_id_3.h
+++ b/Polyhedron/include/CGAL/Polyhedron_items_with_id_3.h
@@ -10,7 +10,10 @@
 // Author(s)     : Andreas Fabri, Fernando Cacciola
 
 #ifndef CGAL_POLYHEDRON_ITEMS_WITH_ID_3_H
-#define CGAL_POLYHEDRON_ITEMS_WITH_ID_3_H 1
+#define CGAL_POLYHEDRON_ITEMS_WITH_ID_3_H
+
+#include <CGAL/license/Polyhedron.h>
+
 
 #include <CGAL/HalfedgeDS_vertex_max_base_with_id.h>
 #include <CGAL/HalfedgeDS_halfedge_max_base_with_id.h>
diff --git a/Polyhedron/include/CGAL/boost/graph/graph_traits_Polyhedron_3.h b/Polyhedron/include/CGAL/boost/graph/graph_traits_Polyhedron_3.h
index 7df39974c107..f8e6e9a21cad 100644
--- a/Polyhedron/include/CGAL/boost/graph/graph_traits_Polyhedron_3.h
+++ b/Polyhedron/include/CGAL/boost/graph/graph_traits_Polyhedron_3.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_BOOST_GRAPH_GRAPH_TRAITS_POLYHEDRON_3_H
 #define CGAL_BOOST_GRAPH_GRAPH_TRAITS_POLYHEDRON_3_H
 
+#include <CGAL/license/Polyhedron.h>
+
+
 #include <CGAL/boost/graph/graph_traits_HalfedgeDS.h>
 
 #include <CGAL/Polyhedron_3.h>
diff --git a/Polyhedron/include/CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h b/Polyhedron/include/CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h
index 3571d0c3fa2c..6d7bf94b3fb0 100644
--- a/Polyhedron/include/CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h
+++ b/Polyhedron/include/CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_BOOST_GRAPH_HALFEDGE_GRAPH_TRAITS_POLYHEDRON_3_H
 #define CGAL_BOOST_GRAPH_HALFEDGE_GRAPH_TRAITS_POLYHEDRON_3_H
 
+#include <CGAL/license/Polyhedron.h>
+
+
 #define CGAL_DEPRECATED_HEADER "<CGAL/boost/graph/halfedge_graph_traits_Polyhedron_3.h>"
 #define CGAL_REPLACEMENT_HEADER "<CGAL/boost/graph/graph_traits_Polyhedron_3.h>"
 #include <CGAL/Installation/internal/deprecation_warning.h>
diff --git a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3.h b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3.h
index 2b35cb02b4d0..b66e213400d2 100644
--- a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3.h
+++ b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_BOOST_GRAPH_PROPERTIES_POLYHEDRON_3_H
 #define CGAL_BOOST_GRAPH_PROPERTIES_POLYHEDRON_3_H
 
+#include <CGAL/license/Polyhedron.h>
+
+
 #define CGAL_HDS_TMPLT Gt, class I, CGAL_HDS_PARAM_, class A
 #define CGAL_HDS_CLASS CGAL::Polyhedron_3<Gt,I,HDS,A>
 
diff --git a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_features.h b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_features.h
index 06a8f4a15148..d047937ec839 100644
--- a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_features.h
+++ b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_features.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_PROPERTIES_POLYHEDRON_3_FEATURES_H
 #define CGAL_PROPERTIES_POLYHEDRON_3_FEATURES_H
 
+#include <CGAL/license/Polyhedron.h>
+
+
 #include <CGAL/Polyhedron_3.h>
 #include <set>
 
diff --git a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_time_stamp.h b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_time_stamp.h
index 5a2fdc85417b..8d88c8fd895d 100644
--- a/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_time_stamp.h
+++ b/Polyhedron/include/CGAL/boost/graph/properties_Polyhedron_3_time_stamp.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_PROPERTIES_POLYHEDRON_3_TIME_STAMP_H
 #define CGAL_PROPERTIES_POLYHEDRON_3_TIME_STAMP_H
 
+#include <CGAL/license/Polyhedron.h>
+
+
 #include <CGAL/Polyhedron_3.h>
 
 #define CGAL_HDS_PARAM_ template < class Traits, class Items, class Alloc> class HDS
diff --git a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_2.h b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_2.h
index 345367b6c119..c051cf033b35 100644
--- a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_2.h
+++ b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_2.h
@@ -17,6 +17,9 @@
 #ifndef CGAL_POLYTOPE_DISTANCE_D_TRAITS_2_H
 #define CGAL_POLYTOPE_DISTANCE_D_TRAITS_2_H
 
+#include <CGAL/license/Polytope_distance_d.h>
+
+
 // includes
 #  include <CGAL/Optimisation/Access_dimension_2.h>
 #  include <CGAL/Optimisation/Access_coordinates_begin_2.h>
diff --git a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_3.h b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_3.h
index 5f24e083d995..fefc27f69ee9 100644
--- a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_3.h
+++ b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_3.h
@@ -17,6 +17,9 @@
 #ifndef CGAL_POLYTOPE_DISTANCE_D_TRAITS_3_H
 #define CGAL_POLYTOPE_DISTANCE_D_TRAITS_3_H
 
+#include <CGAL/license/Polytope_distance_d.h>
+
+
 // includes
 #  include <CGAL/Optimisation/Access_dimension_3.h>
 #  include <CGAL/Optimisation/Access_coordinates_begin_3.h>
diff --git a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_d.h b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_d.h
index b115b610c72d..1c88c7ee5677 100644
--- a/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_d.h
+++ b/Polytope_distance_d/include/CGAL/Polytope_distance_d_traits_d.h
@@ -17,6 +17,9 @@
 #ifndef CGAL_POLYTOPE_DISTANCE_D_TRAITS_D_H
 #define CGAL_POLYTOPE_DISTANCE_D_TRAITS_D_H
 
+#include <CGAL/license/Polytope_distance_d.h>
+
+
 // includes
 #  include <CGAL/Optimisation/Access_dimension_d.h>
 #  include <CGAL/Optimisation/Access_coordinates_begin_d.h>
diff --git a/Principal_component_analysis/include/CGAL/Subiterator.h b/Principal_component_analysis/include/CGAL/Subiterator.h
index 0d31b12a8e82..c860be7a361b 100644
--- a/Principal_component_analysis/include/CGAL/Subiterator.h
+++ b/Principal_component_analysis/include/CGAL/Subiterator.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_PCA_SUBITERATOR_H
 #define CGAL_PCA_SUBITERATOR_H
 
+#include <CGAL/license/Principal_component_analysis.h>
+
+
 #include <boost/iterator/iterator_facade.hpp>
 
 namespace CGAL
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_stream.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_stream.h
index 5adc8c897c20..61b3eed75b27 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_stream.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_stream.h
@@ -15,6 +15,9 @@
 #ifndef CGAL_DXF_STREAM_H
 #define CGAL_DXF_STREAM_H
 
+#include <CGAL/license/Straight_skeleton_2.h>
+
+
 #include <CGAL/basic.h>
 #include <CGAL/Polygon_2.h>
 
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_writer.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_writer.h
index e2d3ec5c50a9..2251dbe09e24 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_writer.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/Dxf_writer.h
@@ -15,6 +15,9 @@
 #ifndef CGAL_IO_DXF_WRITER_H
 #define CGAL_IO_DXF_WRITER_H
 
+#include <CGAL/license/Straight_skeleton_2.h>
+
+
 #include <CGAL/disable_warnings.h>
 
 #include <CGAL/basic.h>
diff --git a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/print.h b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/print.h
index a389b96c138c..6c9c493ae871 100644
--- a/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/print.h
+++ b/Straight_skeleton_2/include/CGAL/Straight_skeleton_2/IO/print.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_SLS_IO_PRINT_H
 #define CGAL_SLS_IO_PRINT_H
 
+#include <CGAL/license/Straight_skeleton_2.h>
+
+
 #include <CGAL/Point_2.h>
 #include <CGAL/Polygon_2.h>
 #include <CGAL/Polygon_with_holes_2.h>
diff --git a/Straight_skeleton_2/include/CGAL/certified_numeric_predicates.h b/Straight_skeleton_2/include/CGAL/certified_numeric_predicates.h
index 5468e8b9699a..f7d82b3c0933 100644
--- a/Straight_skeleton_2/include/CGAL/certified_numeric_predicates.h
+++ b/Straight_skeleton_2/include/CGAL/certified_numeric_predicates.h
@@ -11,6 +11,9 @@
 #ifndef CGAL_CERTIFIED_NUMERIC_PREDICATES_H
 #define CGAL_CERTIFIED_NUMERIC_PREDICATES_H
 
+#include <CGAL/license/Straight_skeleton_2.h>
+
+
 #include <CGAL/number_utils.h>
 #include <CGAL/Interval_arithmetic.h>
 #include <CGAL/Uncertain.h>
diff --git a/Straight_skeleton_2/include/CGAL/certified_quotient_predicates.h b/Straight_skeleton_2/include/CGAL/certified_quotient_predicates.h
index 46ba2d948c20..5ecf764b5d87 100644
--- a/Straight_skeleton_2/include/CGAL/certified_quotient_predicates.h
+++ b/Straight_skeleton_2/include/CGAL/certified_quotient_predicates.h
@@ -11,6 +11,9 @@
 #ifndef CGAL_CERTIFIED_QUOTIENT_PREDICATES_H
 #define CGAL_CERTIFIED_QUOTIENT_PREDICATES_H
 
+#include <CGAL/license/Straight_skeleton_2.h>
+
+
 #include <CGAL/certified_numeric_predicates.h>
 #include <CGAL/Quotient.h>
 
diff --git a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h
index 68fd42eb79e1..1484943f0788 100644
--- a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h
+++ b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_features.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_PROPERTIES_SURFACE_MESH_FEATURES_H
 #define CGAL_PROPERTIES_SURFACE_MESH_FEATURES_H
 
+#include <CGAL/license/Surface_mesh.h>
+
+
 #ifndef DOXYGEN_RUNNING
 
 #include <CGAL/Surface_mesh.h>
diff --git a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h
index 06baa03192ef..de779d13a282 100644
--- a/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h
+++ b/Surface_mesh/include/CGAL/boost/graph/properties_Surface_mesh_time_stamp.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_PROPERTIES_SURFACE_MESH_TIME_STAMP_H
 #define CGAL_PROPERTIES_SURFACE_MESH_TIME_STAMP_H
 
+#include <CGAL/license/Surface_mesh.h>
+
+
 #ifndef DOXYGEN_RUNNING
 
 #include <CGAL/Surface_mesh.h>
diff --git a/Surface_mesher/include/CGAL/Surface_mesher/Profile_counter.h b/Surface_mesher/include/CGAL/Surface_mesher/Profile_counter.h
index 32591b239685..12a0c01cc94b 100644
--- a/Surface_mesher/include/CGAL/Surface_mesher/Profile_counter.h
+++ b/Surface_mesher/include/CGAL/Surface_mesher/Profile_counter.h
@@ -16,6 +16,9 @@
 #ifndef CGAL_SURFACE_MESHER_PROFILE_COUNTER_H
 #define CGAL_SURFACE_MESHER_PROFILE_COUNTER_H
 
+#include <CGAL/license/Surface_mesher.h>
+
+
 #include <CGAL/Profile_counter.h>
 
 #ifdef CGAL_SURFACE_MESHER_PROFILE
diff --git a/TDS_2/include/CGAL/boost/graph/graph_traits_Triangulation_data_structure_2.h b/TDS_2/include/CGAL/boost/graph/graph_traits_Triangulation_data_structure_2.h
index 2ebbf85432b8..55ff0388bcf0 100644
--- a/TDS_2/include/CGAL/boost/graph/graph_traits_Triangulation_data_structure_2.h
+++ b/TDS_2/include/CGAL/boost/graph/graph_traits_Triangulation_data_structure_2.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_GRAPH_TRAITS_TRIANGULATION_DATA_STRUCTURE_2_H
 #define CGAL_GRAPH_TRAITS_TRIANGULATION_DATA_STRUCTURE_2_H
 
+#include <CGAL/license/TDS_2.h>
+
+
 // include this to avoid a VC15 warning
 #include <CGAL/Named_function_parameters.h>
 #include <CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h>
diff --git a/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h b/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h
index 483690396b5f..1c0b1ae4b40e 100644
--- a/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h
+++ b/TDS_2/include/CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h
@@ -19,8 +19,11 @@
 #include <iterator>
 #include <utility>
 
-#ifndef CGAL_GRAPH_TRAITS_2D_TDS_HELPERS
-#define CGAL_GRAPH_TRAITS_2D_TDS_HELPERS
+#ifndef CGAL_GRAPH_TRAITS_2D_TDS_HELPERS_H
+#define CGAL_GRAPH_TRAITS_2D_TDS_HELPERS_H
+
+#include <CGAL/license/TDS_2.h>
+
 
 namespace CGAL {
 namespace internal {
@@ -319,4 +322,4 @@ struct hash<CGAL::internal::TDS2_halfedge_descriptor<TDS> >
 
 } // namespace std
 
-#endif // CGAL_GRAPH_TRAITS_2D_TDS_HELPERS
+#endif // CGAL_GRAPH_TRAITS_2D_TDS_HELPERS_H
diff --git a/TDS_2/include/CGAL/boost/graph/properties_Triangulation_data_structure_2.h b/TDS_2/include/CGAL/boost/graph/properties_Triangulation_data_structure_2.h
index 151af643059c..91ba969bd6d6 100644
--- a/TDS_2/include/CGAL/boost/graph/properties_Triangulation_data_structure_2.h
+++ b/TDS_2/include/CGAL/boost/graph/properties_Triangulation_data_structure_2.h
@@ -11,6 +11,9 @@
 #ifndef CGAL_PROPERTIES_TRIANGULATION_DATA_STRUCTURE_2_H
 #define CGAL_PROPERTIES_TRIANGULATION_DATA_STRUCTURE_2_H
 
+#include <CGAL/license/TDS_2.h>
+
+
 #include <CGAL/Triangulation_data_structure_2.h>
 #include <CGAL/boost/graph/internal/graph_traits_2D_TDS_helper.h>
 #include <CGAL/boost/graph/internal/Has_member_id.h>
diff --git a/Triangulation/include/CGAL/IO/Triangulation_off_ostream.h b/Triangulation/include/CGAL/IO/Triangulation_off_ostream.h
index 5dbe2895f10c..36fc501daf0f 100644
--- a/Triangulation/include/CGAL/IO/Triangulation_off_ostream.h
+++ b/Triangulation/include/CGAL/IO/Triangulation_off_ostream.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_TRIANGULATION_IO_H
 #define CGAL_TRIANGULATION_IO_H
 
+#include <CGAL/license/Triangulation.h>
+
+
 #include <CGAL/Epick_d.h>
 #include <CGAL/Triangulation.h>
 #include <sstream>
diff --git a/Triangulation_2/include/CGAL/IO/Triangulation_off_ostream_2.h b/Triangulation_2/include/CGAL/IO/Triangulation_off_ostream_2.h
index 6d96c38bcb96..6fdcb5b03c4a 100644
--- a/Triangulation_2/include/CGAL/IO/Triangulation_off_ostream_2.h
+++ b/Triangulation_2/include/CGAL/IO/Triangulation_off_ostream_2.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_TRIANGULATION_OFF_OSTREAM_2_H
 #define CGAL_TRIANGULATION_OFF_OSTREAM_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Triangulation_2.h>
 #include <sstream>
 #include <iostream>
diff --git a/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h b/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h
index 6f24fd8e50ef..21607148403e 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2_to_lcc.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_TRIANGULATION_2_TO_LCC_H
 #define CGAL_TRIANGULATION_2_TO_LCC_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/assertions.h>
 #include <map>
 
diff --git a/Triangulation_2/include/CGAL/Triangulation_face_base_with_id_2.h b/Triangulation_2/include/CGAL/Triangulation_face_base_with_id_2.h
index 72fd9fcfba6c..eec9abb65c39 100644
--- a/Triangulation_2/include/CGAL/Triangulation_face_base_with_id_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_face_base_with_id_2.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_TRIANGULATION_FACE_BASE_WITH_ID_2_H
 #define CGAL_TRIANGULATION_FACE_BASE_WITH_ID_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Triangulation_face_base_2.h>
 
 namespace CGAL {
diff --git a/Triangulation_2/include/CGAL/Triangulation_vertex_base_with_id_2.h b/Triangulation_2/include/CGAL/Triangulation_vertex_base_with_id_2.h
index aca49c503bcb..310d3c158e4e 100644
--- a/Triangulation_2/include/CGAL/Triangulation_vertex_base_with_id_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_vertex_base_with_id_2.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_TRIANGULATION_VERTEX_BASE_WITH_ID_2_H
 #define CGAL_TRIANGULATION_VERTEX_BASE_WITH_ID_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Triangulation_vertex_base_2.h>
 
 namespace CGAL {
diff --git a/Triangulation_2/include/CGAL/apply_to_range.h b/Triangulation_2/include/CGAL/apply_to_range.h
index 9df2dbd23669..fc235d47a48b 100644
--- a/Triangulation_2/include/CGAL/apply_to_range.h
+++ b/Triangulation_2/include/CGAL/apply_to_range.h
@@ -10,8 +10,11 @@
 //
 // Author(s)     : Radu Ursu
 
-#ifndef CGAL_apply_to_range_h
-#define CGAL_apply_to_range_h
+#ifndef CGAL_APPLY_TO_RANGE_H
+#define CGAL_APPLY_TO_RANGE_H
+
+#include <CGAL/license/Triangulation_2.h>
+
 
 #include <CGAL/Point_2.h>
 #include <CGAL/Unique_hash_map.h>
@@ -151,4 +154,4 @@ void apply_to_range(const Tr &t,
 
 }//end namespace
 
-#endif
+#endif //CGAL_APPLY_TO_RANGE_H
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_Delaunay_triangulation_2.h
index c4a6e7f61bdb..ae3cdba64d3b 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_Delaunay_triangulation_2.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_GRAPH_TRAITS_CONSTRAINED_DELAUNAY_TRIANGULATION_2_H
 #define CGAL_GRAPH_TRAITS_CONSTRAINED_DELAUNAY_TRIANGULATION_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 #include <CGAL/boost/graph/properties_Constrained_Delaunay_triangulation_2.h>
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_2.h
index 3f4fa4e92457..50b31a0d05fe 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_2.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_GRAPH_TRAITS_CONSTRAINED_TRIANGULATION_2_H
 #define CGAL_GRAPH_TRAITS_CONSTRAINED_TRIANGULATION_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Constrained_triangulation_2.h>
 #include <CGAL/boost/graph/properties_Constrained_triangulation_2.h>
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_plus_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_plus_2.h
index 85f44168e9a4..fb21cff567a4 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_plus_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Constrained_triangulation_plus_2.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_GRAPH_TRAITS_CONSTRAINED_TRIANGULATION_PLUS_2_H
 #define CGAL_GRAPH_TRAITS_CONSTRAINED_TRIANGULATION_PLUS_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Constrained_triangulation_plus_2.h>
 #include <CGAL/boost/graph/properties_Constrained_triangulation_plus_2.h>
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h
index 35ac74f22ea0..22b95fd4cfd6 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Delaunay_triangulation_2.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_GRAPH_TRAITS_DELAUNAY_TRIANGULATION_2_H
 #define CGAL_GRAPH_TRAITS_DELAUNAY_TRIANGULATION_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Delaunay_triangulation_2.h>
 #include <CGAL/boost/graph/properties_Delaunay_triangulation_2.h>
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Regular_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Regular_triangulation_2.h
index 4595604b503f..127a345a9e27 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Regular_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Regular_triangulation_2.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_GRAPH_TRAITS_REGULAR_TRIANGULATION_2_H
 #define CGAL_GRAPH_TRAITS_REGULAR_TRIANGULATION_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Regular_triangulation_2.h>
 #include <CGAL/boost/graph/properties_Regular_triangulation_2.h>
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_2.h
index 42bbed130b5d..8a50f96e3df8 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_2.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_GRAPH_TRAITS_TRIANGULATION_2_H
 #define CGAL_GRAPH_TRAITS_TRIANGULATION_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Triangulation_2.h>
 #include <CGAL/boost/graph/properties_Triangulation_2.h>
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_hierarchy_2.h b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_hierarchy_2.h
index cd07894b3131..eae9f93cefec 100644
--- a/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_hierarchy_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/graph_traits_Triangulation_hierarchy_2.h
@@ -12,6 +12,9 @@
 #ifndef CGAL_GRAPH_TRAITS_TRIANGULATION_HIERARCHY_2_H
 #define CGAL_GRAPH_TRAITS_TRIANGULATION_HIERARCHY_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Triangulation_hierarchy_2.h>
 #include <CGAL/boost/graph/properties_Triangulation_hierarchy_2.h>
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation.h b/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation.h
index e120e7d626fb..976c6741e633 100644
--- a/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation.h
+++ b/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation.h
@@ -10,6 +10,8 @@
 //                 Andreas Fabri,
 //                 Fernando Cacciola
 
+#include <CGAL/license/Triangulation_2.h>
+
 #ifndef CGAL_2D_TRIANGULATION_TEMPLATE_PARAMETERS
   #error CGAL_2D_TRIANGULATION_TEMPLATE_PARAMETERS is not defined
 #endif
diff --git a/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h b/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h
index 46a904bc1c36..22a4a4c2f3c4 100644
--- a/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h
+++ b/Triangulation_2/include/CGAL/boost/graph/internal/graph_traits_2D_triangulation_helper.h
@@ -17,8 +17,11 @@
 
 #include <utility>
 
-#ifndef CGAL_GRAPH_TRAITS_2D_TRIANGULATION_HELPERS
-#define CGAL_GRAPH_TRAITS_2D_TRIANGULATION_HELPERS
+#ifndef CGAL_GRAPH_TRAITS_2D_TRIANGULATION_HELPERS_H
+#define CGAL_GRAPH_TRAITS_2D_TRIANGULATION_HELPERS_H
+
+#include <CGAL/license/Triangulation_2.h>
+
 
 namespace CGAL {
 namespace internal {
@@ -181,4 +184,4 @@ struct Dereference_to_handle_enforcer
 } // namespace internal
 } // namespace CGAL
 
-#endif // CGAL_GRAPH_TRAITS_2D_TRIANGULATION_HELPERS
+#endif // CGAL_GRAPH_TRAITS_2D_TRIANGULATION_HELPERS_H
diff --git a/Triangulation_2/include/CGAL/boost/graph/internal/properties_2D_triangulation.h b/Triangulation_2/include/CGAL/boost/graph/internal/properties_2D_triangulation.h
index 65516f9f3b34..2ac267ebcf8b 100644
--- a/Triangulation_2/include/CGAL/boost/graph/internal/properties_2D_triangulation.h
+++ b/Triangulation_2/include/CGAL/boost/graph/internal/properties_2D_triangulation.h
@@ -26,6 +26,9 @@
 #ifndef CGAL_BOOST_GRAPH_PROPERTIES_2D_TRIANGULATION_H
 #define CGAL_BOOST_GRAPH_PROPERTIES_2D_TRIANGULATION_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 namespace CGAL {
 namespace internal {
 
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_Delaunay_triangulation_2.h
index b070a293df1e..e3ee3e3bb679 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_Delaunay_triangulation_2.h
@@ -11,6 +11,9 @@
 #ifndef CGAL_PROPERTIES_CONSTRAINED_DELAUNAY_TRIANGULATION_2_H
 #define CGAL_PROPERTIES_CONSTRAINED_DELAUNAY_TRIANGULATION_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Constrained_Delaunay_triangulation_2.h>
 
 #define CGAL_2D_TRIANGULATION_TEMPLATE_PARAMETERS typename GT, typename TDS, typename Itag
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_2.h
index e56fc487b477..0fdc55290c2c 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_2.h
@@ -11,6 +11,9 @@
 #ifndef CGAL_PROPERTIES_CONSTRAINED_TRIANGULATION_2_H
 #define CGAL_PROPERTIES_CONSTRAINED_TRIANGULATION_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Constrained_triangulation_2.h>
 
 #define CGAL_2D_TRIANGULATION_TEMPLATE_PARAMETERS typename GT, typename TDS, typename Itag
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_plus_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_plus_2.h
index 6e0f16ea086b..8d2df8776c97 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_plus_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Constrained_triangulation_plus_2.h
@@ -11,6 +11,9 @@
 #ifndef CGAL_PROPERTIES_CONSTRAINED_TRIANGULATION_PLUS_2_H
 #define CGAL_PROPERTIES_CONSTRAINED_TRIANGULATION_PLUS_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Constrained_triangulation_plus_2.h>
 
 #define CGAL_2D_TRIANGULATION_TEMPLATE_PARAMETERS typename Tr
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Delaunay_triangulation_2.h
index 6367bc5a58b2..a040184b4b8b 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Delaunay_triangulation_2.h
@@ -11,6 +11,9 @@
 #ifndef CGAL_PROPERTIES_DELAUNAY_TRIANGULATION_2_H
 #define CGAL_PROPERTIES_DELAUNAY_TRIANGULATION_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Delaunay_triangulation_2.h>
 
 #define CGAL_2D_TRIANGULATION_TEMPLATE_PARAMETERS typename GT, typename TDS
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Regular_triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Regular_triangulation_2.h
index 7d91b01ae968..a4d0f9a4acc7 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Regular_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Regular_triangulation_2.h
@@ -11,6 +11,9 @@
 #ifndef CGAL_PROPERTIES_REGULAR_TRIANGULATION_2_H
 #define CGAL_PROPERTIES_REGULAR_TRIANGULATION_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Regular_triangulation_2.h>
 
 #define CGAL_2D_TRIANGULATION_TEMPLATE_PARAMETERS typename GT, typename TDS
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_2.h
index 25c60a34d801..6c111297bfae 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_2.h
@@ -11,6 +11,9 @@
 #ifndef CGAL_PROPERTIES_TRIANGULATION_2_H
 #define CGAL_PROPERTIES_TRIANGULATION_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Triangulation_2.h>
 
 #define CGAL_2D_TRIANGULATION_TEMPLATE_PARAMETERS typename GT, typename TDS
diff --git a/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_hierarchy_2.h b/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_hierarchy_2.h
index 9ed8bbdb1939..830c4f8f6b5d 100644
--- a/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_hierarchy_2.h
+++ b/Triangulation_2/include/CGAL/boost/graph/properties_Triangulation_hierarchy_2.h
@@ -11,6 +11,9 @@
 #ifndef CGAL_PROPERTIES_TRIANGULATION_HIERARCHY_2_H
 #define CGAL_PROPERTIES_TRIANGULATION_HIERARCHY_2_H
 
+#include <CGAL/license/Triangulation_2.h>
+
+
 #include <CGAL/Triangulation_hierarchy_2.h>
 
 #define CGAL_2D_TRIANGULATION_TEMPLATE_PARAMETERS typename Tr
diff --git a/Triangulation_3/include/CGAL/IO/Triangulation_off_ostream_3.h b/Triangulation_3/include/CGAL/IO/Triangulation_off_ostream_3.h
index 4708dc1b7e12..55f1b953a5d6 100644
--- a/Triangulation_3/include/CGAL/IO/Triangulation_off_ostream_3.h
+++ b/Triangulation_3/include/CGAL/IO/Triangulation_off_ostream_3.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_TRIANGULATION_OFF_OSTREAM_3_H
 #define CGAL_TRIANGULATION_OFF_OSTREAM_3_H
 
+#include <CGAL/license/Triangulation_3.h>
+
+
 #include <CGAL/Triangulation_3.h>
 #include <sstream>
 #include <iostream>
diff --git a/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h b/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h
index 43079354d0aa..19f495dbfbef 100644
--- a/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h
+++ b/Triangulation_3/include/CGAL/Triangulation_3_to_lcc.h
@@ -13,6 +13,9 @@
 #ifndef CGAL_TRIANGULATION_3_TO_LCC_H
 #define CGAL_TRIANGULATION_3_TO_LCC_H
 
+#include <CGAL/license/Triangulation_3.h>
+
+
 #include <CGAL/assertions.h>
 #include <map>
 #include <CGAL/Weighted_point_3.h>

From cc3278e0a1f0a43d8e63a26879465131db009921 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 13:53:38 +0100
Subject: [PATCH 1240/1398] update license

---
 GraphicsView/package_info/GraphicsView/license.txt | 1 -
 1 file changed, 1 deletion(-)

diff --git a/GraphicsView/package_info/GraphicsView/license.txt b/GraphicsView/package_info/GraphicsView/license.txt
index 3ca1763d670d..b75100428a65 100644
--- a/GraphicsView/package_info/GraphicsView/license.txt
+++ b/GraphicsView/package_info/GraphicsView/license.txt
@@ -1,3 +1,2 @@
 GPL (v3 or later)
-LGPL (v3 or later)
 UNKNOWN

From e214d40c0e58922825703379ca91e86591fc5b8e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 13:55:35 +0100
Subject: [PATCH 1241/1398] add missing license header

---
 .../include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h  | 2 ++
 .../CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h    | 2 ++
 2 files changed, 4 insertions(+)

diff --git a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
index 654560ce4195..ae1085f06866 100644
--- a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
+++ b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
@@ -13,6 +13,8 @@
 #ifndef CGAL_DEFORMATION_EIGEN_CLOSEST_ROTATION_TRAITS_3_H
 #define CGAL_DEFORMATION_EIGEN_CLOSEST_ROTATION_TRAITS_3_H
 
+#include <CGAL/license/Surface_mesh_deformation.h>
+
 #include <Eigen/Eigen>
 #include <Eigen/SVD>
 
diff --git a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
index b5ba19187ac5..4ca1c5d54e11 100644
--- a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
+++ b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
@@ -13,6 +13,8 @@
 #ifndef CGAL_DEFORMATION_EIGEN_POLAR_CLOSEST_ROTATION_TRAITS_3_H
 #define CGAL_DEFORMATION_EIGEN_POLAR_CLOSEST_ROTATION_TRAITS_3_H
 
+#include <CGAL/license/Surface_mesh_deformation.h>
+
 #include <CGAL/Deformation_Eigen_closest_rotation_traits_3.h>
 #include <CGAL/FPU_extension.h>
 #include <CGAL/Profile_counter.h>

From 6f1b34fa6ed441c392a9900f1e0b98eae3a32437 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 14:05:52 +0100
Subject: [PATCH 1242/1398] restore LGPL for file from another institute than
 the package owner

---
 Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h                   | 2 +-
 .../include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h  | 2 +-
 .../CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h    | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h b/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
index 18db0dc8e346..bda362a0d2dd 100644
--- a/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
+++ b/Polyhedron/include/CGAL/Polyhedron_3_to_lcc.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
 //
diff --git a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
index ae1085f06866..b74261b1250b 100644
--- a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
+++ b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_closest_rotation_traits_3.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Gael Guennebaud and Ilker O. Yaz
 
diff --git a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
index 4ca1c5d54e11..9a94375100e3 100644
--- a/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
+++ b/Surface_mesh_deformation/include/CGAL/Deformation_Eigen_polar_closest_rotation_traits_3.h
@@ -5,7 +5,7 @@
 //
 // $URL$
 // $Id$
-// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
+// SPDX-License-Identifier: LGPL-3.0-or-later OR LicenseRef-Commercial
 //
 // Author(s)     : Gael Guennebaud Ilker O. Yaz
 

From b59250bfeb5e1a7ea1e05a7563331c0aca03b95a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 14:44:27 +0100
Subject: [PATCH 1243/1398] conditional compilation

---
 Envelope_3/test/Envelope_3/CMakeLists.txt   | 15 +++++++--------
 Envelope_3/test/Envelope_3/spheres_test.cpp |  2 +-
 2 files changed, 8 insertions(+), 9 deletions(-)

diff --git a/Envelope_3/test/Envelope_3/CMakeLists.txt b/Envelope_3/test/Envelope_3/CMakeLists.txt
index b087dba97efd..c5eb08f87faa 100644
--- a/Envelope_3/test/Envelope_3/CMakeLists.txt
+++ b/Envelope_3/test/Envelope_3/CMakeLists.txt
@@ -6,11 +6,10 @@ project(Envelope_3_Tests)
 
 find_package(CGAL REQUIRED COMPONENTS Core)
 
-# create a target per cppfile
-file(
-  GLOB cppfiles
-  RELATIVE ${CMAKE_CURRENT_SOURCE_DIR}
-  ${CMAKE_CURRENT_SOURCE_DIR}/*.cpp)
-foreach(cppfile ${cppfiles})
-  create_single_source_cgal_program("${cppfile}")
-endforeach()
+create_single_source_cgal_program("triangles_test.cpp")
+
+if (CGAL_Core_FOUND)
+  create_single_source_cgal_program("spheres_test.cpp")
+else()
+  message("NOTICE: A test requires CGAL_Core, and will not be compiled.")
+endif()
diff --git a/Envelope_3/test/Envelope_3/spheres_test.cpp b/Envelope_3/test/Envelope_3/spheres_test.cpp
index 7fd2634e1a93..2d45e12526ac 100644
--- a/Envelope_3/test/Envelope_3/spheres_test.cpp
+++ b/Envelope_3/test/Envelope_3/spheres_test.cpp
@@ -5,7 +5,7 @@
 
 int main ()
 {
-  bool UNTESTED_TRAITS_AS_CORE_IS_NOT_ISTALLED;
+  bool UNTESTED_TRAITS_AS_CORE_IS_NOT_INSTALLED;
   std::cout << std::endl
             << "WARNING: Core is not installed, "
             << "skipping the test ..."

From 336a8f39dc77f7667681a65a35a83909231c12b0 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 15:15:23 +0100
Subject: [PATCH 1244/1398] please CI

---
 Cone_spanners_2/include/CGAL/Compute_cone_boundaries_2.h | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Cone_spanners_2/include/CGAL/Compute_cone_boundaries_2.h b/Cone_spanners_2/include/CGAL/Compute_cone_boundaries_2.h
index 7e820e12a761..4256fd0dc179 100644
--- a/Cone_spanners_2/include/CGAL/Compute_cone_boundaries_2.h
+++ b/Cone_spanners_2/include/CGAL/Compute_cone_boundaries_2.h
@@ -30,6 +30,9 @@
 #include <CGAL/Polynomial.h>
 #include <CGAL/number_type_config.h>    // CGAL_PI is defined there
 #include <CGAL/enum.h>
+#if defined(CGAL_USE_LEDA) || defined(CGAL_USE_CORE)
+#include <CGAL/Exact_predicates_exact_constructions_kernel_with_root_of.h>
+#endif
 #include <CGAL/Aff_transformation_2.h>
 
 namespace CGAL {

From 8242a407b2427cb433acb69f414d476a62d4e059 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 16:34:06 +0100
Subject: [PATCH 1245/1398] remove useless anchor

---
 .../doc/Arrangement_on_surface_2/CGAL/Arr_observer.h            | 2 --
 1 file changed, 2 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
index a248556f6501..99abf22396f1 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_observer.h
@@ -1,8 +1,6 @@
 namespace CGAL {
 
 /*! \ingroup PkgArrangementOnSurface2Ref
- *
- * \anchor arr_refarr_obs
  *
  * `Arr_observer<Arrangement_2>` is an alias for
  * Aos_observer<Arrangement_on_surface_2>`,

From c6eed472fd610c3ec1d2f0c315d02b8caec09da4 Mon Sep 17 00:00:00 2001
From: Sebastien Loriot <sloriot.ml@gmail.com>
Date: Thu, 4 Jan 2024 17:19:47 +0100
Subject: [PATCH 1246/1398] fix warning

---
 Polyhedron/demo/Polyhedron/triangulate_primitive.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/triangulate_primitive.h b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
index 4fd4afa6a00a..5f84f6e0a89e 100644
--- a/Polyhedron/demo/Polyhedron/triangulate_primitive.h
+++ b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
@@ -125,7 +125,7 @@ class FacetTriangulator
     std::vector<bool> skip(idPoints.size(), false);
 
     for (std::size_t i = 0; i < idPoints.size(); i++) {
-      int prev = (i - 1 + idPoints.size()) % idPoints.size();
+      std::size_t prev = (i - 1 + idPoints.size()) % idPoints.size();
       if (idPoints[i].first < idPoints[prev].first) {
         auto it = edge_map.emplace(std::make_pair(idPoints[i].first, idPoints[prev].first), i);
         if (!it.second) {

From 4a2d0704fc7aefcd44f85f8321053085967c0312 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 4 Jan 2024 17:27:10 +0100
Subject: [PATCH 1247/1398] fix warnings

---
 Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp | 2 +-
 Polyhedron/demo/Polyhedron/triangulate_primitive.h     | 4 ----
 2 files changed, 1 insertion(+), 5 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
index 688cf8587459..23aeffc37958 100644
--- a/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_surface_mesh_item.cpp
@@ -1371,7 +1371,7 @@ QList<EPICK::Triangle_3> Scene_surface_mesh_item_priv::triangulate_primitive(fac
 
   //iterates on the internal faces to add the vertices to the positions
   //and the normals to the appropriate vectors
-  auto f = [&](auto &ffit, auto& v2v) {
+  auto f = [&](auto &ffit, auto&) {
     if (ffit.info().is_external)
       return;
 
diff --git a/Polyhedron/demo/Polyhedron/triangulate_primitive.h b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
index 5f84f6e0a89e..4b0d0f137701 100644
--- a/Polyhedron/demo/Polyhedron/triangulate_primitive.h
+++ b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
@@ -143,7 +143,6 @@ class FacetTriangulator
     }
 
     Vertex_handle previous, first, last_inserted;
-    std::size_t previd, firstid, lastid;
 
     // Iterate the points of the facet and decide if they must be inserted in the CDT
     typename Kernel::FT x(0), y(0), z(0);
@@ -163,7 +162,6 @@ class FacetTriangulator
         v2v[vh] = idPoint.second;
         if (first == Vertex_handle()) {
           first = vh;
-          firstid = idPoint.second;
         }
 
         if(previous != nullptr && previous != vh)
@@ -171,10 +169,8 @@ class FacetTriangulator
           if (!skip[i])
             cdt->insert_constraint(previous, vh);
           last_inserted = previous;
-          lastid = previd;
         }
         previous = vh;
-        previd = idPoint.second;
       }
     }
 

From 526700057a68a3a96824a42adbe22f4bbef5e41e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 5 Jan 2024 12:55:10 +0100
Subject: [PATCH 1248/1398] Add missing GPL packages in the
 gpl_package_list.txt collection

---
 Installation/include/CGAL/license/gpl_package_list.txt | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Installation/include/CGAL/license/gpl_package_list.txt b/Installation/include/CGAL/license/gpl_package_list.txt
index 41612d5b9fca..393265b883f7 100644
--- a/Installation/include/CGAL/license/gpl_package_list.txt
+++ b/Installation/include/CGAL/license/gpl_package_list.txt
@@ -20,6 +20,7 @@ Convex_hull_d dD Convex Hulls and Delaunay Triangulations
 Envelope_2 2D Envelopes
 Envelope_3 3D Envelopes
 GraphicsView CGAL and the Qt Graphics View Framework
+Heat_method_3 The Heat Method
 Hyperbolic_triangulation_2 2D Hyperbolic Delaunay Triangulations
 Inscribed_areas Inscribed Areas
 Interpolation 2D and Surface Function Interpolation
@@ -45,6 +46,7 @@ Point_set_2 2D Range and Neighbor Search
 Point_set_3 3D Point Set
 Point_set_processing_3 Point Set Processing
 Poisson_surface_reconstruction_3 Poisson Surface Reconstruction
+Polygonal_surface_reconstruction Polygonal Surface Reconstruction
 Polygon_mesh_processing Polygon Mesh Processing
 Polygon_mesh_processing/Compute_normal Polygon Mesh Processing - Normal Computation
 Polygon_mesh_processing/connected_components Polygon Mesh Processing - Connected Components
@@ -52,6 +54,7 @@ Polygon_mesh_processing/corefinement Polygon Mesh Processing - Corefinement
 Polygon_mesh_processing/core Polygon Mesh Processing - Core
 Polygon_mesh_processing/distance Polygon Mesh Processing - Distance
 Polygon_mesh_processing/interpolated_corrected_curvatures Polygon Mesh Processing - Interpolated Corrected Curvatures
+Polygon_mesh_processing/locate Polygon Mesh Processing - Locate
 Polygon_mesh_processing/measure Polygon Mesh Processing - Geometric Measure
 Polygon_mesh_processing/meshing_hole_filling Polygon Mesh Processing - Meshing and Hole Filling
 Polygon_mesh_processing/orientation Polygon Mesh Processing - Orientation

From b2919c7bd7d907befee0946ceea8a11af7a3039f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 5 Jan 2024 12:55:42 +0100
Subject: [PATCH 1249/1398] Re-order some package names to follow alphabetical
 order

---
 Installation/include/CGAL/license/gpl_package_list.txt | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Installation/include/CGAL/license/gpl_package_list.txt b/Installation/include/CGAL/license/gpl_package_list.txt
index 393265b883f7..36e2d1a2904e 100644
--- a/Installation/include/CGAL/license/gpl_package_list.txt
+++ b/Installation/include/CGAL/license/gpl_package_list.txt
@@ -34,9 +34,9 @@ Minkowski_sum_3 3D Minkowski Sum of Polyhedra
 Nef_2 2D Boolean Operations on Nef Polygons
 Nef_3 3D Boolean Operations on Nef Polyhedra
 Nef_S2 2D Boolean Operations on Nef Polygons Embedded on the Sphere
-Orthtree Quadtrees, Octrees, and Orthtrees
 Optimal_bounding_box Optimal Bounding Box
 Optimal_transportation_reconstruction_2 Optimal Transportation Curve Reconstruction
+Orthtree Quadtrees, Octrees, and Orthtrees
 Partition_2 2D Polygon Partitioning
 Periodic_2_triangulation_2 2D Periodic Triangulations
 Periodic_3_mesh_3 3D Periodic Mesh Generation
@@ -78,15 +78,16 @@ Set_movable_separability_2 2D Movable Separability of Sets
 Shape_detection Shape Detection
 Shape_regularization Shape Regularization
 Skin_surface_3 3D Skin Surface Meshing
+SMDS_3 3D Simplicial Mesh Data Structure
 Snap_rounding_2 2D Snap Rounding
 Spatial_searching dD Spatial Searching
 Straight_skeleton_2 2D Straight Skeleton and Polygon Offsetting
 Straight_skeleton_extrusion_2 2D Straight Skeleton Extrusion
 Stream_lines_2 2D Placement of Streamlines
+Surface_mesh_approximation Triangulated Surface Mesh Approximation
 Surface_mesh_deformation Triangulated Surface Mesh Deformation
 Surface_mesher 3D Surface Mesh Generation
 Surface_mesh Surface Mesh
-Surface_mesh_approximation Triangulated Surface Mesh Approximation
 Surface_mesh_parameterization Triangulated Surface Mesh Parameterization
 Surface_mesh_segmentation Triangulated Surface Mesh Segmentation
 Surface_mesh_shortest_path Triangulated Surface Mesh Shortest Paths
@@ -96,12 +97,11 @@ Surface_mesh_topology Surface Mesh Topology
 Surface_sweep_2 2D Intersection of Curves
 TDS_2 2D Triangulation Data Structure
 TDS_3 3D Triangulation Data Structure
+Tetrahedral_remeshing Tetrahedral Remeshing
 Three Three
-SMDS_3 3D Simplicial Mesh Data Structure
 Triangulation_2 2D Triangulation
-Triangulation_on_sphere_2 2D Triangulation on Sphere
 Triangulation_3 3D Triangulations
 Triangulation dD Triangulations
+Triangulation_on_sphere_2 2D Triangulation on Sphere
 Visibility_2 2D Visibility Computation
 Voronoi_diagram_2 2D Voronoi Diagram Adaptor
-Tetrahedral_remeshing Tetrahedral Remeshing

From c60403165633cac69207f3a1b6dd18717ea3d386 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Fri, 5 Jan 2024 15:46:03 +0100
Subject: [PATCH 1250/1398] Add another missing GPL license to
 gpl_package_list.txt

---
 Installation/include/CGAL/license/gpl_package_list.txt | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Installation/include/CGAL/license/gpl_package_list.txt b/Installation/include/CGAL/license/gpl_package_list.txt
index 36e2d1a2904e..98f2204a3611 100644
--- a/Installation/include/CGAL/license/gpl_package_list.txt
+++ b/Installation/include/CGAL/license/gpl_package_list.txt
@@ -58,6 +58,7 @@ Polygon_mesh_processing/locate Polygon Mesh Processing - Locate
 Polygon_mesh_processing/measure Polygon Mesh Processing - Geometric Measure
 Polygon_mesh_processing/meshing_hole_filling Polygon Mesh Processing - Meshing and Hole Filling
 Polygon_mesh_processing/orientation Polygon Mesh Processing - Orientation
+Polygon_mesh_processing/Polyhedral_envelope Polygon Mesh Processing - Polyhedral Envelope
 Polygon_mesh_processing/predicate Polygon Mesh Processing - Predicate
 Polygon_mesh_processing/combinatorial_repair Polygon Mesh Processing - Combinatorial Repair
 Polygon_mesh_processing/geometric_repair Polygon Mesh Processing - Geometric Repair

From 6b6d55d03ad3b1e495bf0dcddb6cd6ec5f0eee4c Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 6 Jan 2024 12:36:44 +0300
Subject: [PATCH 1251/1398] note about jet fitting package in user man

---
 .../Polygon_mesh_processing/Polygon_mesh_processing.txt    | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index beeadb4516e4..afe829f64905 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -960,6 +960,11 @@ quad meshes, and meshes with n-gon faces (for n-gons, the centroid must be insid
 The algorithms used prove to work well in general. Also, on meshes with noise on vertex positions,
 they give accurate results, under the condition that the correct vertex normals are provided.
 
+It is worth noting that the Principal Curvatures and Directions can also be estimated using the
+\ref PkgJetFitting3 package, which estimates the local differential quantities of a surface at a point
+using a local polynomial fitting (fitting a d-jet). Unlike the Interpolated Corrected Curvatures,
+the Jet Fitting method discards topological information and thus can be used on point clouds as well.
+
 \subsection ICCBackground Brief Background
 
 Surface curvatures are quantities that describe the local geometry of a surface. They are important in many
@@ -1301,7 +1306,7 @@ available on 7th of October 2020.  It only uses the high level algorithm of chec
 is covered by a set of prisms, where each prism is an offset for an input triangle.
 That is, the implementation in \cgal does not use indirect predicates.
 
-The interpolated corrected curvatures were implemented during GSoC 2022. This was implemented by Hossam Saeed and under
+The interpolated corrected curvatures were implemented during GSoC 2022. This was implemented by Hossam Saeed and under the
 supervision of David Coeurjolly, Jaques-Olivier Lachaud, and Sébastien Loriot. The implementation is based on \cgalCite{cgal:lrtc-iccmps-20}.
 <a href="https://dgtal-team.github.io/doc-nightly/moduleCurvatureMeasures.html">DGtal's implementation</a> was also
 used as a reference during the project.

From df09c6894e02c238f23da6564f46e1fe5db11c51 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 6 Jan 2024 15:43:19 +0300
Subject: [PATCH 1252/1398] Performance

---
 .../Polygon_mesh_processing.txt               | 127 +++++++++++++++++-
 1 file changed, 126 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index afe829f64905..f851c2098cba 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -1027,7 +1027,7 @@ These computations are performed using (on all vertices of the mesh) `CGAL::Poly
 where function named parameters are used to select the curvatures (and possibly directions) to be computed. An overload function with the same name
 but taking a given vertex is also available in case the computation should be done only for that vertex.
 
-\subsection ICCResults Results & Performance
+\subsection ICCResults Results
 
 First, \cgalFigureRef{icc_measures} illustrates various curvature measures on a triangular mesh.
 
@@ -1072,6 +1072,131 @@ When changing the integration ball radius, we obtain a scale space of curvature
 \cgalFigureCaptionEnd
 
 
+\subsection ICCPerformance Performance
+
+The implemented algorithms exhibit a linear complexity in the number of faces of the mesh. It is worth noting that
+we pre-computed the vertex normals and passed them as a named parameter to the function to better estimate the
+performance of the curvature computation. For the data reported in the following table, we used a machine with an
+Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compiled with Visual Studio 2019.
+
+\cgalFigureAnchor{icc_performance_table}
+<table class="tg" style="undefined;table-layout: fixed; width: 952px">
+<colgroup>
+<col style="width: 161px">
+<col style="width: 300px">
+<col style="width: 91px">
+<col style="width: 113px">
+<col style="width: 145px">
+<col style="width: 142px">
+</colgroup>
+<thead>
+  <tr>
+    <th class="tg-0pky">Ball <br>Radius</th>
+    <th class="tg-0pky">Computation</th>
+    <th class="tg-0pky">Spot<br>(<span style="font-weight:bold">6k </span>faces)</th>
+    <th class="tg-0pky">Bunny<br>(<span style="font-weight:bold">144K </span>faces)</th>
+    <th class="tg-0pky">Stanford Dragon<br>(<span style="font-weight:bold">871K </span>faces)</th>
+    <th class="tg-0pky">Old Age or Winter<br>(<span style="font-weight:bold">6M </span>faces)</th>
+  </tr>
+</thead>
+<tbody>
+  <tr>
+    <td class="tg-0pky" rowspan="4">vertex<br>1-ring faces <br>(default)</td>
+    <td class="tg-za14">Mean&nbsp;&nbsp;&nbsp;Curvature</td>
+    <td class="tg-dvpl">  &lt; 0.001 s</td>
+    <td class="tg-jkyp">0.019 s</td>
+    <td class="tg-jkyp">0.11 s</td>
+    <td class="tg-jkyp">2.68 s</td>
+  </tr>
+  <tr>
+    <td class="tg-za14">Gaussian Curvature</td>
+    <td class="tg-dvpl"> &lt; 0.001 s</td>
+    <td class="tg-jkyp">0.017 s</td>
+    <td class="tg-jkyp">0.10 s</td>
+    <td class="tg-jkyp">2.77 s</td>
+  </tr>
+  <tr>
+    <td class="tg-za14">Principal Curvature &amp; Directions</td>
+    <td class="tg-jkyp">0.002 s</td>
+    <td class="tg-jkyp">0.044 s</td>
+    <td class="tg-jkyp">0.25 s</td>
+    <td class="tg-jkyp">3.98 s</td>
+  </tr>
+  <tr>
+    <td class="tg-za14">All (optimized for shared computations)</td>
+    <td class="tg-jkyp">0.003 s</td>
+    <td class="tg-jkyp">0.049 s</td>
+    <td class="tg-jkyp">0.28 s</td>
+    <td class="tg-jkyp">4.52 s</td>
+  </tr>
+  <tr>
+    <td class="tg-0pky" rowspan="4">r = 0.1<br>* avg_edge_length</td>
+    <td class="tg-0pky">Mean   Curvature</td>
+    <td class="tg-jkyp">0.017 s</td>
+    <td class="tg-jkyp">0.401 s</td>
+    <td class="tg-jkyp">2.66 s</td>
+    <td class="tg-jkyp">22.29 s</td>
+  </tr>
+  <tr>
+    <td class="tg-0pky">Gaussian Curvature</td>
+    <td class="tg-jkyp">0.018 s</td>
+    <td class="tg-jkyp">0.406 s</td>
+    <td class="tg-jkyp">2.63 s</td>
+    <td class="tg-jkyp">21.61 s</td>
+  </tr>
+  <tr>
+    <td class="tg-0pky">Principal Curvature &amp; Directions</td>
+    <td class="tg-jkyp">0.019 s</td>
+    <td class="tg-jkyp">0.430 s</td>
+    <td class="tg-jkyp">2.85 s</td>
+    <td class="tg-jkyp">23.55 s</td>
+  </tr>
+  <tr>
+    <td class="tg-0pky">All (optimized for shared computations)</td>
+    <td class="tg-jkyp">0.017 s</td>
+    <td class="tg-jkyp">0.428 s</td>
+    <td class="tg-jkyp">2.89 s</td>
+    <td class="tg-jkyp">24.16 s</td>
+  </tr>
+  <tr>
+    <td class="tg-0lax" rowspan="4">r = 0.5<br>* avg_edge_length</td>
+    <td class="tg-0lax">Mean   Curvature</td>
+    <td class="tg-2b7s">0.024 s</td>
+    <td class="tg-2b7s">0.388 s</td>
+    <td class="tg-2b7s">3.18 s</td>
+    <td class="tg-2b7s">22.79 s</td>
+  </tr>
+  <tr>
+    <td class="tg-0lax">Gaussian Curvature</td>
+    <td class="tg-2b7s">0.024 s</td>
+    <td class="tg-2b7s">0.392 s</td>
+    <td class="tg-2b7s">3.21 s</td>
+    <td class="tg-2b7s">23.58 s</td>
+  </tr>
+  <tr>
+    <td class="tg-0lax">Principal Curvature &amp; Directions</td>
+    <td class="tg-2b7s">0.027 s</td>
+    <td class="tg-2b7s">0.428 s</td>
+    <td class="tg-2b7s">3.41 s</td>
+    <td class="tg-2b7s">24.44 s</td>
+  </tr>
+  <tr>
+    <td class="tg-0lax">All (optimized for shared computations)</td>
+    <td class="tg-2b7s">0.025 s</td>
+    <td class="tg-2b7s">0.417 s</td>
+    <td class="tg-2b7s">3.44 s</td>
+    <td class="tg-2b7s">23.93 s</td>
+  </tr>
+</tbody>
+</table>
+\cgalFigureCaptionBegin{icc_performance_table}
+Performance of the curvature computation on various meshes (in seconds). The first row shows the performance of the default value for the ball radius,
+which is using the 1-ring of neighboring faces around each vertex, instead of actually approximating the inclusion ratio of the faces in the ball.
+The other rows show a ball radius of 0.1 (and 0.5) scaled by the average edge length of the mesh. It is clear that using the 1-ring of faces
+is much faster, but it might not be as effective when used on a noisy input mesh.
+\cgalFigureCaptionEnd
+
+
 \ref BGLPropertyMaps are used to record the computed curvatures as shown in examples. In the following examples, for each property map, we associate
 a curvature value to each vertex.
 

From 5cf55e5df693c6b79a08b35718193e74419ca1a0 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 6 Jan 2024 16:06:12 +0300
Subject: [PATCH 1253/1398] unsupported tags fix

---
 .../Polygon_mesh_processing.txt                   | 15 +++------------
 1 file changed, 3 insertions(+), 12 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index f851c2098cba..4ee207ab90c2 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -1080,16 +1080,8 @@ performance of the curvature computation. For the data reported in the following
 Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compiled with Visual Studio 2019.
 
 \cgalFigureAnchor{icc_performance_table}
+<center>
 <table class="tg" style="undefined;table-layout: fixed; width: 952px">
-<colgroup>
-<col style="width: 161px">
-<col style="width: 300px">
-<col style="width: 91px">
-<col style="width: 113px">
-<col style="width: 145px">
-<col style="width: 142px">
-</colgroup>
-<thead>
   <tr>
     <th class="tg-0pky">Ball <br>Radius</th>
     <th class="tg-0pky">Computation</th>
@@ -1098,8 +1090,6 @@ Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compi
     <th class="tg-0pky">Stanford Dragon<br>(<span style="font-weight:bold">871K </span>faces)</th>
     <th class="tg-0pky">Old Age or Winter<br>(<span style="font-weight:bold">6M </span>faces)</th>
   </tr>
-</thead>
-<tbody>
   <tr>
     <td class="tg-0pky" rowspan="4">vertex<br>1-ring faces <br>(default)</td>
     <td class="tg-za14">Mean&nbsp;&nbsp;&nbsp;Curvature</td>
@@ -1187,8 +1177,9 @@ Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compi
     <td class="tg-2b7s">3.44 s</td>
     <td class="tg-2b7s">23.93 s</td>
   </tr>
-</tbody>
 </table>
+</center>
+
 \cgalFigureCaptionBegin{icc_performance_table}
 Performance of the curvature computation on various meshes (in seconds). The first row shows the performance of the default value for the ball radius,
 which is using the 1-ring of neighboring faces around each vertex, instead of actually approximating the inclusion ratio of the faces in the ball.

From 389b4c1809ce1f21c4ecc00227e56063ffe7b45b Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 6 Jan 2024 19:29:05 +0300
Subject: [PATCH 1254/1398] table classes removed

---
 .../Polygon_mesh_processing.txt               | 141 +++++++++---------
 1 file changed, 70 insertions(+), 71 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 4ee207ab90c2..b89df53fb698 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -1081,105 +1081,104 @@ Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compi
 
 \cgalFigureAnchor{icc_performance_table}
 <center>
-<table class="tg" style="undefined;table-layout: fixed; width: 952px">
+<table>
   <tr>
-    <th class="tg-0pky">Ball <br>Radius</th>
-    <th class="tg-0pky">Computation</th>
-    <th class="tg-0pky">Spot<br>(<span style="font-weight:bold">6k </span>faces)</th>
-    <th class="tg-0pky">Bunny<br>(<span style="font-weight:bold">144K </span>faces)</th>
-    <th class="tg-0pky">Stanford Dragon<br>(<span style="font-weight:bold">871K </span>faces)</th>
-    <th class="tg-0pky">Old Age or Winter<br>(<span style="font-weight:bold">6M </span>faces)</th>
+    <th>Ball <br>Radius</th>
+    <th>Computation</th>
+    <th>Spot<br>(<span style="font-weight:bold">6k </span>faces)</th>
+    <th>Bunny<br>(<span style="font-weight:bold">144K </span>faces)</th>
+    <th>Stanford Dragon<br>(<span style="font-weight:bold">871K </span>faces)</th>
+    <th>Old Age or Winter<br>(<span style="font-weight:bold">6M </span>faces)</th>
   </tr>
   <tr>
-    <td class="tg-0pky" rowspan="4">vertex<br>1-ring faces <br>(default)</td>
-    <td class="tg-za14">Mean&nbsp;&nbsp;&nbsp;Curvature</td>
-    <td class="tg-dvpl">  &lt; 0.001 s</td>
-    <td class="tg-jkyp">0.019 s</td>
-    <td class="tg-jkyp">0.11 s</td>
-    <td class="tg-jkyp">2.68 s</td>
+    <td rowspan="4">vertex<br>1-ring faces <br>(default)</td>
+    <td>Mean&nbsp;&nbsp;&nbsp;Curvature</td>
+    <td>  &lt; 0.001 s</td>
+    <td>0.019 s</td>
+    <td>0.11 s</td>
+    <td>2.68 s</td>
   </tr>
   <tr>
-    <td class="tg-za14">Gaussian Curvature</td>
-    <td class="tg-dvpl"> &lt; 0.001 s</td>
-    <td class="tg-jkyp">0.017 s</td>
-    <td class="tg-jkyp">0.10 s</td>
-    <td class="tg-jkyp">2.77 s</td>
+    <td>Gaussian Curvature</td>
+    <td> &lt; 0.001 s</td>
+    <td>0.017 s</td>
+    <td>0.10 s</td>
+    <td>2.77 s</td>
   </tr>
   <tr>
-    <td class="tg-za14">Principal Curvature &amp; Directions</td>
-    <td class="tg-jkyp">0.002 s</td>
-    <td class="tg-jkyp">0.044 s</td>
-    <td class="tg-jkyp">0.25 s</td>
-    <td class="tg-jkyp">3.98 s</td>
+    <td>Principal Curvature &amp; Directions</td>
+    <td>0.002 s</td>
+    <td>0.044 s</td>
+    <td>0.25 s</td>
+    <td>3.98 s</td>
   </tr>
   <tr>
-    <td class="tg-za14">All (optimized for shared computations)</td>
-    <td class="tg-jkyp">0.003 s</td>
-    <td class="tg-jkyp">0.049 s</td>
-    <td class="tg-jkyp">0.28 s</td>
-    <td class="tg-jkyp">4.52 s</td>
+    <td>All (optimized for shared computations)</td>
+    <td>0.003 s</td>
+    <td>0.049 s</td>
+    <td>0.28 s</td>
+    <td>4.52 s</td>
   </tr>
   <tr>
-    <td class="tg-0pky" rowspan="4">r = 0.1<br>* avg_edge_length</td>
-    <td class="tg-0pky">Mean   Curvature</td>
-    <td class="tg-jkyp">0.017 s</td>
-    <td class="tg-jkyp">0.401 s</td>
-    <td class="tg-jkyp">2.66 s</td>
-    <td class="tg-jkyp">22.29 s</td>
+    <td rowspan="4">r = 0.1<br>* avg_edge_length</td>
+    <td>Mean   Curvature</td>
+    <td>0.017 s</td>
+    <td>0.401 s</td>
+    <td>2.66 s</td>
+    <td>22.29 s</td>
   </tr>
   <tr>
-    <td class="tg-0pky">Gaussian Curvature</td>
-    <td class="tg-jkyp">0.018 s</td>
-    <td class="tg-jkyp">0.406 s</td>
-    <td class="tg-jkyp">2.63 s</td>
-    <td class="tg-jkyp">21.61 s</td>
+    <td>Gaussian Curvature</td>
+    <td>0.018 s</td>
+    <td>0.406 s</td>
+    <td>2.63 s</td>
+    <td>21.61 s</td>
   </tr>
   <tr>
-    <td class="tg-0pky">Principal Curvature &amp; Directions</td>
-    <td class="tg-jkyp">0.019 s</td>
-    <td class="tg-jkyp">0.430 s</td>
-    <td class="tg-jkyp">2.85 s</td>
-    <td class="tg-jkyp">23.55 s</td>
+    <td>Principal Curvature &amp; Directions</td>
+    <td>0.019 s</td>
+    <td>0.430 s</td>
+    <td>2.85 s</td>
+    <td>23.55 s</td>
   </tr>
   <tr>
-    <td class="tg-0pky">All (optimized for shared computations)</td>
-    <td class="tg-jkyp">0.017 s</td>
-    <td class="tg-jkyp">0.428 s</td>
-    <td class="tg-jkyp">2.89 s</td>
-    <td class="tg-jkyp">24.16 s</td>
+    <td>All (optimized for shared computations)</td>
+    <td>0.017 s</td>
+    <td>0.428 s</td>
+    <td>2.89 s</td>
+    <td>24.16 s</td>
   </tr>
   <tr>
-    <td class="tg-0lax" rowspan="4">r = 0.5<br>* avg_edge_length</td>
-    <td class="tg-0lax">Mean   Curvature</td>
-    <td class="tg-2b7s">0.024 s</td>
-    <td class="tg-2b7s">0.388 s</td>
-    <td class="tg-2b7s">3.18 s</td>
-    <td class="tg-2b7s">22.79 s</td>
+    <td rowspan="4">r = 0.5<br>* avg_edge_length</td>
+    <td>Mean   Curvature</td>
+    <td>0.024 s</td>
+    <td>0.388 s</td>
+    <td>3.18 s</td>
+    <td>22.79 s</td>
   </tr>
   <tr>
-    <td class="tg-0lax">Gaussian Curvature</td>
-    <td class="tg-2b7s">0.024 s</td>
-    <td class="tg-2b7s">0.392 s</td>
-    <td class="tg-2b7s">3.21 s</td>
-    <td class="tg-2b7s">23.58 s</td>
+    <td>Gaussian Curvature</td>
+    <td>0.024 s</td>
+    <td>0.392 s</td>
+    <td>3.21 s</td>
+    <td>23.58 s</td>
   </tr>
   <tr>
-    <td class="tg-0lax">Principal Curvature &amp; Directions</td>
-    <td class="tg-2b7s">0.027 s</td>
-    <td class="tg-2b7s">0.428 s</td>
-    <td class="tg-2b7s">3.41 s</td>
-    <td class="tg-2b7s">24.44 s</td>
+    <td>Principal Curvature &amp; Directions</td>
+    <td>0.027 s</td>
+    <td>0.428 s</td>
+    <td>3.41 s</td>
+    <td>24.44 s</td>
   </tr>
   <tr>
-    <td class="tg-0lax">All (optimized for shared computations)</td>
-    <td class="tg-2b7s">0.025 s</td>
-    <td class="tg-2b7s">0.417 s</td>
-    <td class="tg-2b7s">3.44 s</td>
-    <td class="tg-2b7s">23.93 s</td>
+    <td>All (optimized for shared computations)</td>
+    <td0.025 s</td>
+    <td0.417 s</td>
+    <td3.44 s</td>
+    <td23.93 s</td>
   </tr>
 </table>
 </center>
-
 \cgalFigureCaptionBegin{icc_performance_table}
 Performance of the curvature computation on various meshes (in seconds). The first row shows the performance of the default value for the ball radius,
 which is using the 1-ring of neighboring faces around each vertex, instead of actually approximating the inclusion ratio of the faces in the ball.

From 4f809743f6954068228fa4cadf664f52d493c2cf Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 6 Jan 2024 19:44:37 +0300
Subject: [PATCH 1255/1398] user man table typo

---
 .../Polygon_mesh_processing.txt               | 20 +++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index b89df53fb698..89684c84ab1e 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -1085,10 +1085,10 @@ Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compi
   <tr>
     <th>Ball <br>Radius</th>
     <th>Computation</th>
-    <th>Spot<br>(<span style="font-weight:bold">6k </span>faces)</th>
-    <th>Bunny<br>(<span style="font-weight:bold">144K </span>faces)</th>
-    <th>Stanford Dragon<br>(<span style="font-weight:bold">871K </span>faces)</th>
-    <th>Old Age or Winter<br>(<span style="font-weight:bold">6M </span>faces)</th>
+    <th>Spot<br>(<span>6k </span>faces)</th>
+    <th>Bunny<br>(<span>144K </span>faces)</th>
+    <th>Stanford Dragon<br>(<span>871K </span>faces)</th>
+    <th>Old Age or Winter<br>(<span>6M </span>faces)</th>
   </tr>
   <tr>
     <td rowspan="4">vertex<br>1-ring faces <br>(default)</td>
@@ -1172,16 +1172,16 @@ Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compi
   </tr>
   <tr>
     <td>All (optimized for shared computations)</td>
-    <td0.025 s</td>
-    <td0.417 s</td>
-    <td3.44 s</td>
-    <td23.93 s</td>
+    <td>0.025 s</td>
+    <td>0.417 s</td>
+    <td>3.44 s</td>
+    <td>23.93 s</td>
   </tr>
 </table>
 </center>
 \cgalFigureCaptionBegin{icc_performance_table}
-Performance of the curvature computation on various meshes (in seconds). The first row shows the performance of the default value for the ball radius,
-which is using the 1-ring of neighboring faces around each vertex, instead of actually approximating the inclusion ratio of the faces in the ball.
+Performance of the curvature computation on various meshes (in seconds). The first 4 rows show the performance of the default value for the ball radius,
+which is using the 1-ring of neighboring faces around each vertex, instead of actually approximating the inclusion ratio of the faces in a ball of certain radius.
 The other rows show a ball radius of 0.1 (and 0.5) scaled by the average edge length of the mesh. It is clear that using the 1-ring of faces
 is much faster, but it might not be as effective when used on a noisy input mesh.
 \cgalFigureCaptionEnd

From a18b2586248f90a24dc724a87fb3f6ba5218db76 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Sat, 6 Jan 2024 21:00:10 +0300
Subject: [PATCH 1256/1398] typo

---
 .../Polygon_mesh_processing.txt                      | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
index 89684c84ab1e..7fb46b51e053 100644
--- a/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
+++ b/Polygon_mesh_processing/doc/Polygon_mesh_processing/Polygon_mesh_processing.txt
@@ -1092,7 +1092,7 @@ Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compi
   </tr>
   <tr>
     <td rowspan="4">vertex<br>1-ring faces <br>(default)</td>
-    <td>Mean&nbsp;&nbsp;&nbsp;Curvature</td>
+    <td>Mean Curvature</td>
     <td>  &lt; 0.001 s</td>
     <td>0.019 s</td>
     <td>0.11 s</td>
@@ -1106,7 +1106,7 @@ Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compi
     <td>2.77 s</td>
   </tr>
   <tr>
-    <td>Principal Curvature &amp; Directions</td>
+    <td>Principal Curvatures &amp; Directions</td>
     <td>0.002 s</td>
     <td>0.044 s</td>
     <td>0.25 s</td>
@@ -1121,7 +1121,7 @@ Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compi
   </tr>
   <tr>
     <td rowspan="4">r = 0.1<br>* avg_edge_length</td>
-    <td>Mean   Curvature</td>
+    <td>Mean Curvature</td>
     <td>0.017 s</td>
     <td>0.401 s</td>
     <td>2.66 s</td>
@@ -1135,7 +1135,7 @@ Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compi
     <td>21.61 s</td>
   </tr>
   <tr>
-    <td>Principal Curvature &amp; Directions</td>
+    <td>Principal Curvatures &amp; Directions</td>
     <td>0.019 s</td>
     <td>0.430 s</td>
     <td>2.85 s</td>
@@ -1150,7 +1150,7 @@ Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compi
   </tr>
   <tr>
     <td rowspan="4">r = 0.5<br>* avg_edge_length</td>
-    <td>Mean   Curvature</td>
+    <td>Mean Curvature</td>
     <td>0.024 s</td>
     <td>0.388 s</td>
     <td>3.18 s</td>
@@ -1164,7 +1164,7 @@ Intel Core i7-8750H CPU @ 2.20GHz, 16GB of RAM, on Windows 11, 64 bits and compi
     <td>23.58 s</td>
   </tr>
   <tr>
-    <td>Principal Curvature &amp; Directions</td>
+    <td>Principal Curvatures &amp; Directions</td>
     <td>0.027 s</td>
     <td>0.428 s</td>
     <td>3.41 s</td>

From 468f4530d08cdb62d1be08b8e95a19e618c18692 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 8 Jan 2024 12:13:22 +0000
Subject: [PATCH 1257/1398] Compute strlen using snprintf

---
 .../include/CGAL/ImageIO/analyze_impl.h       | 34 +++++++++----------
 1 file changed, 17 insertions(+), 17 deletions(-)

diff --git a/CGAL_ImageIO/include/CGAL/ImageIO/analyze_impl.h b/CGAL_ImageIO/include/CGAL/ImageIO/analyze_impl.h
index c68ee7c32986..86bb69221a0d 100644
--- a/CGAL_ImageIO/include/CGAL/ImageIO/analyze_impl.h
+++ b/CGAL_ImageIO/include/CGAL/ImageIO/analyze_impl.h
@@ -468,72 +468,72 @@ int _readAnalyzeHeader( _image* im, const char* name,
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "Data lost in the Analyze -> ImageIO conversion:" );
 
-      buffer_size = strlen("  descrip: ") + 1 + strlen(analyzeHeader->hist.descrip);
+      buffer_size = snprintf(nullptr, 0, "  descrip: %s", analyzeHeader->hist.descrip) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  descrip: %s", analyzeHeader->hist.descrip );
 
-      buffer_size = strlen("  aux_file: ") + 1 + strlen(analyzeHeader->hist.descrip);
+      buffer_size = snprintf(nullptr, 0, "  aux_file: %s", analyzeHeader->hist.descrip ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  aux_file: %s", analyzeHeader->hist.descrip );
 
-      buffer_size = strlen("  orient: ") + 1+ 2;
+      buffer_size = snprintf(nullptr, 0, "  orient: %d", analyzeHeader->hist.orient ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  orient: %d", analyzeHeader->hist.orient );
 
-      buffer_size = strlen("  originator: ") + 1 + strlen(analyzeHeader->hist.originator);
+      buffer_size = snprintf(nullptr, 0, "  originator: %s", analyzeHeader->hist.originator ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  originator: %s", analyzeHeader->hist.originator );
 
-      buffer_size = strlen("  generated: ") + 1 + strlen(analyzeHeader->hist.generated);
+      buffer_size = snprintf(nullptr, 0, "  generated: %s", analyzeHeader->hist.generated ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  generated: %s", analyzeHeader->hist.generated );
 
-      buffer_size = strlen("  scannum: ") + 1 + strlen(analyzeHeader->hist.scannum);
+      buffer_size = snprintf(nullptr, 0, "  scannum: %s", analyzeHeader->hist.scannum ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  scannum: %s", analyzeHeader->hist.scannum );
 
-      buffer_size = strlen("  patient_id: ") + 1 + strlen(analyzeHeader->hist.patient_id);
+      buffer_size = snprintf(nullptr, 0, "  patient_id: %s", analyzeHeader->hist.patient_id ) +1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  patient_id: %s", analyzeHeader->hist.patient_id );
 
-      buffer_size = strlen("  exp_date: ") + 1 + strlen(analyzeHeader->hist.exp_date);
+      buffer_size = snprintf(nullptr, 0,  "  exp_date: %s", analyzeHeader->hist.exp_date ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  exp_date: %s", analyzeHeader->hist.exp_date );
 
-      buffer_size = strlen("  exp_time: ") + 1 + strlen(analyzeHeader->hist.exp_time);
+      buffer_size = snprintf(nullptr, 0,  "  exp_time: %s", analyzeHeader->hist.exp_time ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  exp_time: %s", analyzeHeader->hist.exp_time );
 
-      buffer_size = strlen("  views: ") + 11 + 1;
+      buffer_size = snprintf(nullptr, 0, "  views: %d", analyzeHeader->hist.views ) + 1;
       /* A 32 bit int doesn't print on more than 11 chars */
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  views: %d", analyzeHeader->hist.views );
 
-      buffer_size = strlen("  vols_added: ") + 11 + 1;
+      buffer_size = snprintf(nullptr, 0, "  vols_added: %d", analyzeHeader->hist.vols_added ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  vols_added: %d", analyzeHeader->hist.vols_added );
 
-      buffer_size = strlen("  start_field: ") + 11 + 1;
+      buffer_size = snprintf(nullptr, 0,  "  start_field: %d", analyzeHeader->hist.start_field ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  start_field: %d", analyzeHeader->hist.start_field );
 
-      buffer_size = strlen("  field_skip: ") + 11 + 1;
+      buffer_size = snprintf(nullptr, 0, "  field_skip: %d", analyzeHeader->hist.field_skip ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  field_skip: %d", analyzeHeader->hist.field_skip );
 
-      buffer_size = strlen("  omax: ") + 11 + 1;
+      buffer_size = snprintf(nullptr, 0, "  omax: %d", analyzeHeader->hist.omax ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  omax: %d", analyzeHeader->hist.omax );
 
-      buffer_size = strlen("  omin: ") + 11 + 1;
+      buffer_size = snprintf(nullptr, 0,  "  omin: %d", analyzeHeader->hist.omin ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  omin: %d", analyzeHeader->hist.omin );
 
-      buffer_size = strlen("  smax: ") + 11 + 1;
+      buffer_size = snprintf(nullptr, 0, "  smax: %d", analyzeHeader->hist.smax ) + 1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  smax: %d", analyzeHeader->hist.smax );
 
-      buffer_size = strlen("  smin: ") + 11 + 1;
+      buffer_size = snprintf(nullptr, 0, "  smin: %d", analyzeHeader->hist.smin ) +1;
       im->user[i] = (char *) ImageIO_alloc(buffer_size);
       snprintf( im->user[i++], buffer_size, "  smin: %d", analyzeHeader->hist.smin );
 

From 182b2c779214beffd16391ceaff5573f7cd0e49a Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 8 Jan 2024 16:53:52 +0100
Subject: [PATCH 1258/1398] fix warning

---
 Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
index 70cda242d019..97b1d8306daa 100644
--- a/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_polyhedron_selection_item.cpp
@@ -284,7 +284,7 @@ Scene_polyhedron_selection_item_priv::triangulate_facet(fg_face_descriptor fit,c
 
   //iterates on the internal faces to add the vertices to the positions
   //and the normals to the appropriate vectors
-  auto f = [&](auto& ffit, auto& v2v) {
+  auto f = [&](auto& ffit, auto& /* v2v */) {
     if (ffit.info().is_external)
       return;
 

From de17922ca4ee3ad011eb910b9034e74cf7c7c3f7 Mon Sep 17 00:00:00 2001
From: Sven Oesau <sven.oesau@geometryfactory.com>
Date: Tue, 9 Jan 2024 10:26:19 +0100
Subject: [PATCH 1259/1398] removed warnings

---
 Polyhedron/demo/Polyhedron/Plugins/PMP/Distance_plugin.cpp | 2 +-
 Polyhedron/demo/Polyhedron/triangulate_primitive.h         | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Distance_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Distance_plugin.cpp
index 72e1475f82ff..3034e7f58a3e 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Distance_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Distance_plugin.cpp
@@ -204,7 +204,7 @@ class Scene_distance_polyhedron_item: public Scene_item_rendering_helper
         sampled_points.push_back(r);
 
         //triangle facets with sample points for color display
-        auto func = [&](auto& ffit, auto& v2v) {
+        auto func = [&](auto& ffit, auto&) {
           if (ffit.info().is_external)
             return;
 
diff --git a/Polyhedron/demo/Polyhedron/triangulate_primitive.h b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
index 4b0d0f137701..21c6223a9ea8 100644
--- a/Polyhedron/demo/Polyhedron/triangulate_primitive.h
+++ b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
@@ -205,7 +205,7 @@ class FacetTriangulator
     std::vector<bool> skip(idPoints.size(), false);
 
     for (std::size_t i = 0; i < idPoints.size(); i++) {
-      int prev = (i - 1 + idPoints.size()) % idPoints.size();
+      std::size_t prev = (i - 1 + idPoints.size()) % idPoints.size();
       if (idPoints[i].first < idPoints[prev].first) {
         auto it = edge_map.emplace(std::make_pair(idPoints[i].first, idPoints[prev].first), i);
         if (!it.second) {

From b70576f0222acf428b608c51eacc0a3a0dae2938 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 4 Jan 2024 16:15:50 +0100
Subject: [PATCH 1260/1398] [flip] add verbosity

---
 .../internal/flip_edges.h                     | 24 ++++++++++++++++---
 1 file changed, 21 insertions(+), 3 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index d08b8da91baa..e71bfa94dee9 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1230,9 +1230,7 @@ std::size_t flip_all_edges(const std::vector<VertexPair>& edges,
     }
   }
 
-  for (typename Tr::Finite_cells_iterator c = tr.finite_cells_begin();
-       c != tr.finite_cells_end();
-       ++c)
+  for (Cell_handle c : tr.finite_cell_handles())
     c->reset_cache_validity();
 
   return count;
@@ -1910,6 +1908,12 @@ std::size_t flipBoundaryEdges(
   CellSelector& cell_selector,
   Visitor& visitor)
 {
+#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+  std::cerr << "\n\tFlipping boundary edges...";
+  std::cerr.flush();
+  std::size_t nb_attempts = 0;
+#endif
+
   typedef typename C3T3::Vertex_handle Vertex_handle;
   typedef typename C3T3::Cell_handle   Cell_handle;
   typedef typename C3T3::Facet         Facet;
@@ -1938,6 +1942,14 @@ std::size_t flipBoundaryEdges(
 
   for (const std::pair<Vertex_handle, Vertex_handle>& vp : candidate_edges_for_flip)
   {
+#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+    std::cerr << "\r\tFlipping boundary edges...("
+      << ++nb_attempts << " attempts, "
+      << nb << " done, "
+      << candidate_edges_for_flip.size() << " candidates)";
+    std::cerr.flush();
+#endif
+
     const Vertex_handle vh0 = vp.first;
     const Vertex_handle vh1 = vp.second;
 
@@ -2100,6 +2112,12 @@ std::size_t flipBoundaryEdges(
     }
   }
   CGAL_assertion(tr.tds().is_valid());
+
+#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+  std::cerr << "\r\t Flipping boundary edges done ("
+                     << nb << " flips done)" << std::endl;
+#endif
+
   return nb;
 }
 

From 161d6795314c49505b08f3b9a86a93074c5bde06 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 5 Jan 2024 13:50:29 +0100
Subject: [PATCH 1261/1398] [flips] do not use cache sliver value when it's not
 valid,

invalidate cache sliver value when needed,
and do not remove/add edges to the complex during flips, since complex edges
never get modified

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 .../internal/flip_edges.h                     | 100 ++++++------------
 .../internal/tetrahedral_remeshing_helpers.h  |  45 +++++++-
 2 files changed, 72 insertions(+), 73 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index e71bfa94dee9..5aaa329e9416 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1374,6 +1374,10 @@ Sliver_removal_result flip_n_to_m_on_surface(typename C3T3::Edge& edge,
     }
   }
 
+  for (Cell_handle c : cells_around_edge)
+    c->reset_cache_validity();
+
+
   return VALID_FLIP;
 }
 
@@ -1552,23 +1556,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     Cell_handle n_ch2_vh1 = ch2->neighbor(ch2->index(vh1));
     Cell_handle n_ch1_vh3 = ch1->neighbor(ch1->index(vh3));
 
-    boost::unordered_map<Edge_uv, typename C3T3::Curve_index> complex_edges;
-    for (Cell_handle c : cells_around_edge)
-    {
-      for (int ii = 0; ii < 4; ++ii)
-      {
-        for (int jj = 0; jj < 4; ++jj)
-        {
-          Edge e(c, ii, jj);
-          if (c3t3.is_in_complex(e))
-          {
-            complex_edges[make_vertex_pair(c->vertex(ii), c->vertex(jj))] = c3t3.curve_index(e);
-            c3t3.remove_from_complex(e);
-          }
-        }
-      }
-    }
-
 //    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch3_vh1->vertex(0)->point(), n_ch3_vh1->vertex(1)->point(), n_ch3_vh1->vertex(2)->point(), n_ch3_vh1->vertex(3)->point()));
 //    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch0_vh3->vertex(0)->point(), n_ch0_vh3->vertex(1)->point(), n_ch0_vh3->vertex(2)->point(), n_ch0_vh3->vertex(3)->point()));
 //    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch2_vh1->vertex(0)->point(), n_ch2_vh1->vertex(1)->point(), n_ch2_vh1->vertex(2)->point(), n_ch2_vh1->vertex(3)->point()));
@@ -1585,10 +1572,10 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
       || !is_well_oriented(tr, ch2)
       || !is_well_oriented(tr, ch3))
       db = NOT_FLIPPABLE;
-    else if (curr_max_cosdh < max_cos_dihedral_angle(tr, ch0)
-      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch1)
-      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch2)
-      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch3))
+    else if (curr_max_cosdh < max_cos_dihedral_angle(tr, ch0, false)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch1, false)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch2, false)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch3, false))
       db = NO_BEST_CONFIGURATION;
 
     if(db == NOT_FLIPPABLE || db == NO_BEST_CONFIGURATION)
@@ -1646,23 +1633,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     c3t3.add_to_complex(ch0, ch0->index(vh4), patch);
     c3t3.add_to_complex(ch3, ch3->index(vh4), patch);
 
-    for (Cell_handle c : cells_around_edge)
-    {
-      for (int ii = 0; ii < 4; ++ii)
-      {
-        for (int jj = 0; jj < 4; ++jj)
-        {
-          Edge_uv uv = make_vertex_pair(c->vertex(ii), c->vertex(jj));
-          Edge edge_uv(c, ii, jj);
-          if (complex_edges.find(uv) != complex_edges.end())
-          {
-            if(!c3t3.is_in_complex(edge_uv))
-              c3t3.add_to_complex(edge_uv, complex_edges[uv]);
-          }
-        }
-      }
-    }
-
     for (int i = 0; i < 4; ++i)
     {
       Cell_handle chi = cells_around_edge[i];
@@ -1708,6 +1678,12 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //
 //    if (db == VALID_FLIP) nb_surface_44_flips_done++;
 
+      if (db == VALID_FLIP)
+      {
+        for(Cell_handle c : cells_around_edge)
+          c->reset_cache_validity();
+      }
+
     return db;
   }
   else //Non planar flip
@@ -1741,20 +1717,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
       }
     }
 
-    boost::unordered_map<Edge_uv, typename C3T3::Curve_index> complex_edges;
-    for (Cell_handle c : cells_around_edge)
-    {
-      for(Edge e : cell_edges(c, tr))
-      {
-        if (c3t3.is_in_complex(e))
-        {
-          const auto uv = make_vertex_pair(e);
-          complex_edges[uv] = c3t3.curve_index(e);
-          c3t3.remove_from_complex(e);
-        }
-      }
-    }
-
     // Top Flip
     ch3->set_vertex(ch3->index(vh1), vh5);
     ch2->set_vertex(ch2->index(vh3), vh4);
@@ -1767,10 +1729,10 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
       || !is_well_oriented(tr, ch2)
       || !is_well_oriented(tr, ch3))
       db = NOT_FLIPPABLE;
-    else if (curr_max_cosdh < max_cos_dihedral_angle(tr, ch0)
-      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch1)
-      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch2)
-      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch3))
+    else if (curr_max_cosdh < max_cos_dihedral_angle(tr, ch0, false)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch1, false)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch2, false)
+      || curr_max_cosdh < max_cos_dihedral_angle(tr, ch3, false))
       db = NO_BEST_CONFIGURATION;
 
     if (db == NOT_FLIPPABLE || db == NO_BEST_CONFIGURATION)
@@ -1834,19 +1796,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     c3t3.add_to_complex(ch0, ch0->index(vh2), patch);
     c3t3.add_to_complex(ch1, ch1->index(vh2), patch);
 
-    for (Cell_handle c : cells_around_edge)
-    {
-      for(const Edge& edge_uv : cell_edges(c, tr))
-      {
-        const Edge_uv uv = make_vertex_pair(edge_uv);
-        if (complex_edges.find(uv) != complex_edges.end())
-        {
-          if (!c3t3.is_in_complex(edge_uv))
-            c3t3.add_to_complex(edge_uv, complex_edges[uv]);
-        }
-      }
-    }
-
     for (Cell_handle chi : cells_around_edge)
     {
       Facet f1(chi, chi->index(vh4));
@@ -1890,6 +1839,12 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //    if(!c3t3_with_info.triangulation().is_valid(n_ch1_vh1, true))
 //    db = CELL_PBS;
 //    */
+
+    if (db == VALID_FLIP)
+    {
+      for (Cell_handle c : cells_around_edge)
+        c->reset_cache_validity();
+    }
     return db;
   }
 
@@ -2060,6 +2015,9 @@ std::size_t flipBoundaryEdges(
         {
           int nbf = std::distance(c3t3.facets_in_complex_begin(),
                                   c3t3.facets_in_complex_end());
+          CGAL_assertion_code(int nbe =
+            std::distance(c3t3.edges_in_complex_begin(),
+                          c3t3.edges_in_complex_end()));
 
 //          CGAL::dump_c3t3(c3t3, "dump_before_flip_");
 
@@ -2087,6 +2045,10 @@ std::size_t flipBoundaryEdges(
             int nbf_post = std::distance(c3t3.facets_in_complex_begin(),
                                          c3t3.facets_in_complex_end());
             CGAL_assertion(nbf == nbf_post);
+            CGAL_assertion_code(int nbe_post =
+              std::distance(c3t3.edges_in_complex_begin(),
+                            c3t3.edges_in_complex_end()));
+            CGAL_assertion(nbe == nbe_post);
 
 //            nb_surface_flip_done++;
             nb++;
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 8b5bd1eb1f5f..78d4a9f72f8e 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -37,7 +37,7 @@ namespace Tetrahedral_remeshing
 {
 
 enum Subdomain_relation { EQUAL, DIFFERENT, INCLUDED, INCLUDES };
-enum Sliver_removal_result { INVALID_ORIENTATION, INVALID_CELL, INVALID_VERTEX,
+enum Sliver_removal_result { INVALID_ORIENTATION = 1, INVALID_CELL, INVALID_VERTEX,
   NOT_FLIPPABLE, EDGE_PROBLEM, VALID_FLIP, NO_BEST_CONFIGURATION, EXISTING_EDGE };
 
 template<typename K>
@@ -343,9 +343,10 @@ Dihedral_angle_cosine max_cos_dihedral_angle(const Tr& tr,
 
 template<typename Tr>
 Dihedral_angle_cosine max_cos_dihedral_angle(const Tr& tr,
-                                             const typename Tr::Cell_handle c)
+                                             const typename Tr::Cell_handle c,
+                                             const bool use_cache = true)
 {
-  if (c->is_cache_valid())
+  if (use_cache && c->is_cache_valid())
     return Dihedral_angle_cosine(CGAL::sign(c->sliver_value()),
                                  CGAL::abs(c->sliver_value()), 1.);
   else if(tr.is_infinite(c))
@@ -360,7 +361,8 @@ Dihedral_angle_cosine max_cos_dihedral_angle(const Tr& tr,
                                                         c->vertex(1),
                                                         c->vertex(2),
                                                         c->vertex(3));
-  c->set_sliver_value(cos_dh.signed_square_value());
+  if(use_cache)
+    c->set_sliver_value(cos_dh.signed_square_value());
   return cos_dh;
 }
 
@@ -530,6 +532,23 @@ bool is_boundary(const C3T3& c3t3,
   return false;
 }
 
+template<typename C3T3>
+typename C3T3::Edge get_edge(const typename C3T3::Vertex_handle v0,
+                             const typename C3T3::Vertex_handle v1,
+                             const C3T3& c3t3)
+{
+  typedef typename C3T3::Edge        Edge;
+  typedef typename C3T3::Cell_handle Cell_handle;
+
+  Cell_handle cell;
+  int i0, i1;
+  if (c3t3.triangulation().tds().is_edge(v0, v1, cell, i0, i1))
+    return Edge(cell, i0, i1);
+  else
+    CGAL_assertion(false);
+  return Edge();
+}
+
 template<typename C3t3, typename CellSelector>
 bool is_boundary_edge(const typename C3t3::Vertex_handle& v0,
                       const typename C3t3::Vertex_handle& v1,
@@ -1323,6 +1342,24 @@ namespace internal
 namespace debug
 {
 
+template<typename C3t3>
+bool check_facets(const typename C3t3::Vertex_handle vh0,
+                  const typename C3t3::Vertex_handle vh1,
+                  const typename C3t3::Vertex_handle vh2,
+                  const typename C3t3::Vertex_handle vh3,
+                  const C3t3& c3t3)
+{
+  int li, lj, lk;
+  typename C3t3::Cell_handle c;
+
+  bool b1 = c3t3.triangulation().is_facet(vh0, vh1, vh2, c, li, lj, lk);
+  bool b2 = c3t3.is_in_complex(c, (6 - li - lj - lk));
+  bool b3 = c3t3.triangulation().is_facet(vh0, vh1, vh3, c, li, lj, lk);
+  bool b4 = c3t3.is_in_complex(c, (6 - li - lj - lk));
+
+  return b1 && b2 && b3 && b4;
+}
+
 // forward-declaration
 template<typename Tr, typename CellRange>
 void dump_cells(const CellRange& cells, const char* filename);

From 9efb66f808fe45563f8b184ef108f23ef3bfd3b2 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 8 Jan 2024 09:37:42 +0100
Subject: [PATCH 1262/1398] [flip] use optional pointer

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 .../internal/flip_edges.h                     | 44 +++++++++++--------
 .../internal/tetrahedral_remeshing_helpers.h  | 15 ++++++-
 2 files changed, 38 insertions(+), 21 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 5aaa329e9416..ba88cb89d2dc 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1336,8 +1336,8 @@ Sliver_removal_result flip_n_to_m_on_surface(typename C3T3::Edge& edge,
 
   typename C3T3::Triangulation& tr = c3t3.triangulation();
 
-  Vertex_handle u = edge.first->vertex(edge.second);
-  Vertex_handle v = edge.first->vertex(edge.third);
+  const Vertex_handle u = edge.first->vertex(edge.second);
+  const Vertex_handle v = edge.first->vertex(edge.third);
 
   typedef std::pair<int, int> IndInCell;
   std::map<Cell_handle, IndInCell> indices;
@@ -1362,7 +1362,7 @@ Sliver_removal_result flip_n_to_m_on_surface(typename C3T3::Edge& edge,
         //rollback all changes
         for (Cell_handle cc : cells_around_edge)
         {
-          int ii = indices[cc].first;
+          const int ii = indices[cc].first;
           if (cc->vertex(ii) != u)
           {
             cc->set_vertex(ii, u);
@@ -1377,7 +1377,6 @@ Sliver_removal_result flip_n_to_m_on_surface(typename C3T3::Edge& edge,
   for (Cell_handle c : cells_around_edge)
     c->reset_cache_validity();
 
-
   return VALID_FLIP;
 }
 
@@ -1386,13 +1385,13 @@ Sliver_removal_result flip_n_to_m_on_surface(typename C3T3::Edge& edge,
 template<typename C3T3, typename IncCellsVectorMap,
          typename CellSelector, typename Visitor>
 Sliver_removal_result flip_on_surface(C3T3& c3t3,
-                                      typename C3T3::Edge& edge,
-                                      typename C3T3::Vertex_handle v0i,
-                                      typename C3T3::Vertex_handle v1i,
-                                      IncCellsVectorMap& inc_cells,
-                                      Flip_Criterion flip_criterion,
-                                      CellSelector& cell_selector,
-                                      Visitor& visitor)
+    typename C3T3::Edge& edge,
+    typename C3T3::Vertex_handle v0i,//v0 of new edge that will replace edge
+    typename C3T3::Vertex_handle v1i,//v1 of new edge that will replace edge
+    IncCellsVectorMap& inc_cells,
+    Flip_Criterion flip_criterion,
+    CellSelector& cell_selector,
+    Visitor& visitor)
 {
   typedef typename C3T3::Triangulation Tr;
   typedef typename Tr::Cell_handle     Cell_handle;
@@ -1421,10 +1420,13 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //        std::vector<Vertex_handle> boundary_vertices;
 //        boundary_vertices.push_back(v0i);
 //        boundary_vertices.push_back(v1i);
-
+#ifdef CGAL_FLIP_ON_SURFACE_DISABLE_NM_FLIP
+        return NOT_FLIPPABLE;
+#else
         return flip_n_to_m_on_surface(edge, c3t3, v0i, v1i,
                                       cells_around_edge, flip_criterion,
                                       cell_selector, visitor);
+#endif
 //////    }
     }
     else
@@ -1432,11 +1434,14 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
   }
 
 //  nb_surface_44_configs++;
+#ifdef CGAL_FLIP_ON_SURFACE_DISABLE_44_FLIP
+  return NOT_FLIPPABLE;
+#endif
 
   if(inc_cells[edge.first->vertex(edge.second)] != std::nullopt)
-    inc_cells[edge.first->vertex(edge.second)].value().clear();
+    inc_cells[edge.first->vertex(edge.second)]->clear();
   if (inc_cells[edge.first->vertex(edge.third)] != std::nullopt)
-    inc_cells[edge.first->vertex(edge.third)].value().clear();
+    inc_cells[edge.first->vertex(edge.third)]->clear();
 
   Cell_handle ch0, ch1, ch2, ch3;
   ch0 = cells_around_edge[0];
@@ -1899,7 +1904,7 @@ std::size_t flipBoundaryEdges(
   {
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
     std::cerr << "\r\tFlipping boundary edges...("
-      << ++nb_attempts << " attempts, "
+      << nb_attempts << " attempts, "
       << nb << " done, "
       << candidate_edges_for_flip.size() << " candidates)";
     std::cerr.flush();
@@ -1913,7 +1918,7 @@ std::size_t flipBoundaryEdges(
 
     std::optional<boost::container::small_vector<Cell_handle, 64>>&
       o_inc_vh = inc_cells[vh0];
-    if (o_inc_vh == std::nullopt || o_inc_vh.value().empty())
+    if (o_inc_vh == std::nullopt || o_inc_vh->empty())
     {
       boost::container::small_vector<Cell_handle, 64> inc_vec;
       tr.incident_cells(vh0, std::back_inserter(inc_vec));
@@ -2019,8 +2024,9 @@ std::size_t flipBoundaryEdges(
             std::distance(c3t3.edges_in_complex_begin(),
                           c3t3.edges_in_complex_end()));
 
-//          CGAL::dump_c3t3(c3t3, "dump_before_flip_");
-
+#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+          ++nb_attempts;
+#endif
           Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3,
                                                      inc_cells,
                                                      flip_criterion,
@@ -2065,7 +2071,7 @@ std::size_t flipBoundaryEdges(
           else if (db == INVALID_CELL || db == INVALID_VERTEX || db == INVALID_ORIENTATION)
           {
 //            std::cout << "Cell problem" << std::endl;
-            return nb;
+            continue;
           }
 //          else
 //            std::cout << "Boundary flip failed" << std::endl;
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 78d4a9f72f8e..09c6ddd91983 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -253,6 +253,13 @@ struct Dihedral_angle_cosine
       return l.m_sgn == r.m_sgn
          &&  l.m_sq_num * r.m_sq_den == r.m_sq_num * l.m_sq_den;
   }
+
+  void print(std::ostream& os) const
+  {
+    os << "Dihedral_angle_cosine(" << m_sgn << ", " << m_sq_num << ", " << m_sq_den
+      << ", value = "<< value() <<", angle = " << std::acos(value())* 180./CGAL_PI
+      << ")";
+  }
 };
 
 template<typename Gt>
@@ -478,8 +485,12 @@ bool is_well_oriented(const Tr& tr,
 template<typename Tr>
 bool is_well_oriented(const Tr& tr, const typename Tr::Cell_handle ch)
 {
-  return is_well_oriented(tr, ch->vertex(0), ch->vertex(1),
-                          ch->vertex(2), ch->vertex(3));
+  return tr.is_infinite(ch)
+    || is_well_oriented(tr,
+                        ch->vertex(0),
+                        ch->vertex(1),
+                        ch->vertex(2),
+                        ch->vertex(3));
 }
 
 template<typename C3T3, typename CellSelector>

From 45aeaccbbf121afaf066dd845bb10d8d263f4e0f Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 9 Jan 2024 12:43:00 +0100
Subject: [PATCH 1263/1398] [flip] snap cosine to [-1., 1.] when computed in
 doubles

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
---
 .../internal/tetrahedral_remeshing_helpers.h  | 31 ++++++++++++++-----
 1 file changed, 23 insertions(+), 8 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 09c6ddd91983..262ac2caf284 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -107,6 +107,7 @@ vertices(const typename Tr::Cell_handle c, const Tr&)
                c->vertex(3)};
 }
 
+// returns angle in degrees
 template<typename Gt, typename Point>
 typename Gt::FT dihedral_angle(const Point& p,
                                const Point& q,
@@ -164,6 +165,8 @@ template<typename Tr>
 typename Tr::Geom_traits::FT min_dihedral_angle(const Tr& tr,
                                                 const typename Tr::Cell_handle c)
 {
+  if (tr.is_infinite(c))
+    return 180.;
   return min_dihedral_angle(tr,
                             c->vertex(0),
                             c->vertex(1),
@@ -171,6 +174,18 @@ typename Tr::Geom_traits::FT min_dihedral_angle(const Tr& tr,
                             c->vertex(3));
 }
 
+template<typename C3t3>
+typename C3t3::Triangulation::Geom_traits::FT min_dihedral_angle(const C3t3& c3t3)
+{
+  typename C3t3::Triangulation::Geom_traits::FT min_dh = 180.;
+
+  for (const auto c : c3t3.cells_in_complex())
+    min_dh = (std::min)(min_dh, min_dihedral_angle(c3t3.triangulation(), c));
+
+  return min_dh;
+}
+
+
 struct Dihedral_angle_cosine
 {
   CGAL::Sign m_sgn;
@@ -253,13 +268,6 @@ struct Dihedral_angle_cosine
       return l.m_sgn == r.m_sgn
          &&  l.m_sq_num * r.m_sq_den == r.m_sq_num * l.m_sq_den;
   }
-
-  void print(std::ostream& os) const
-  {
-    os << "Dihedral_angle_cosine(" << m_sgn << ", " << m_sq_num << ", " << m_sq_den
-      << ", value = "<< value() <<", angle = " << std::acos(value())* 180./CGAL_PI
-      << ")";
-  }
 };
 
 template<typename Gt>
@@ -297,8 +305,12 @@ Dihedral_angle_cosine cos_dihedral_angle(const typename Gt::Point_3& i,
 
   const double sqden = CGAL::to_double(
     scalar_product(ijik, ijik) * scalar_product(ilij, ilij));
+  const double sqnum = CGAL::square(CGAL::to_double(num));
 
-  return Dihedral_angle_cosine(CGAL::sign(num), CGAL::square(num), sqden);
+  if(sqnum > sqden)
+    return Dihedral_angle_cosine(CGAL::sign(num), 1., 1.);//snap to 1 or -1
+  else
+    return Dihedral_angle_cosine(CGAL::sign(num), CGAL::square(num), sqden);
 }
 
 template<typename Point, typename Geom_traits>
@@ -331,6 +343,9 @@ Dihedral_angle_cosine max_cos_dihedral_angle(const Point& p,
   a = cos_dihedral_angle(r, s, p, q, gt);
   if (max_cos_dh < a) max_cos_dh = a;
 
+  CGAL_assertion(max_cos_dh.value() <= 1.);
+  CGAL_assertion(max_cos_dh.value() >= -1.);
+
   return max_cos_dh;
 }
 

From ea6ae9462a62db91010c42027ecceda6ca470ced Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 9 Jan 2024 12:46:47 +0100
Subject: [PATCH 1264/1398] [flip] display min_dihedral_angle after each step
 of remeshing

---
 .../internal/tetrahedral_adaptive_remeshing_impl.h  | 13 +++++++++++++
 1 file changed, 13 insertions(+)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
index 9ea323891bc5..9f97a4293052 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
@@ -192,6 +192,8 @@ class Adaptive_remesher
     CGAL::Tetrahedral_remeshing::debug::dump_vertices_by_dimension(
       m_c3t3.triangulation(), "1-c3t3_vertices_after_split");
     CGAL::Tetrahedral_remeshing::debug::check_surface_patch_indices(m_c3t3);
+    const double mdh = CGAL::Tetrahedral_remeshing::min_dihedral_angle(m_c3t3);
+    std::cout << "\t Min dihedral angle = " << mdh << std::endl;
 #endif
 #ifdef CGAL_DUMP_REMESHING_STEPS
     CGAL::Tetrahedral_remeshing::debug::dump_c3t3(m_c3t3, "1-split");
@@ -214,6 +216,8 @@ class Adaptive_remesher
     CGAL::Tetrahedral_remeshing::debug::dump_vertices_by_dimension(
       m_c3t3.triangulation(), "2-c3t3_vertices_after_collapse");
     CGAL::Tetrahedral_remeshing::debug::check_surface_patch_indices(m_c3t3);
+    const double mdh = CGAL::Tetrahedral_remeshing::min_dihedral_angle(m_c3t3);
+    std::cout << "\n\t Min dihedral angle = " << mdh << std::endl;
 #endif
 #ifdef CGAL_DUMP_REMESHING_STEPS
     CGAL::Tetrahedral_remeshing::debug::dump_c3t3(m_c3t3, "2-collapse");
@@ -231,6 +235,8 @@ class Adaptive_remesher
     CGAL::Tetrahedral_remeshing::debug::dump_vertices_by_dimension(
       m_c3t3.triangulation(), "3-c3t3_vertices_after_flip");
     CGAL::Tetrahedral_remeshing::debug::check_surface_patch_indices(m_c3t3);
+    const double mdh = CGAL::Tetrahedral_remeshing::min_dihedral_angle(m_c3t3);
+    std::cout << "\n\t Min dihedral angle = " << mdh << std::endl;
 #endif
 #ifdef CGAL_DUMP_REMESHING_STEPS
     CGAL::Tetrahedral_remeshing::debug::dump_c3t3(m_c3t3, "3-flip");
@@ -247,6 +253,8 @@ class Adaptive_remesher
     CGAL::Tetrahedral_remeshing::debug::dump_vertices_by_dimension(
       m_c3t3.triangulation(), "4-c3t3_vertices_after_smooth");
     CGAL::Tetrahedral_remeshing::debug::check_surface_patch_indices(m_c3t3);
+    const double mdh = CGAL::Tetrahedral_remeshing::min_dihedral_angle(m_c3t3);
+    std::cout << "\n\t Min dihedral angle = " << mdh << std::endl;
 #endif
 #ifdef CGAL_DUMP_REMESHING_STEPS
     CGAL::Tetrahedral_remeshing::debug::dump_c3t3(m_c3t3, "4-smooth");
@@ -455,6 +463,8 @@ class Adaptive_remesher
     std::cout << "\t facets   = " << nbf << std::endl;
     std::cout << "\t edges    = " << nbe << std::endl;
     std::cout << "\t vertices = " << nbv << std::endl;
+    const double mdh = CGAL::Tetrahedral_remeshing::min_dihedral_angle(m_c3t3);
+    std::cout << "\t Min dihedral angle = " << mdh << std::endl;
 
     CGAL::Tetrahedral_remeshing::debug::dump_vertices_by_dimension(
       m_c3t3.triangulation(), "0-c3t3_vertices_after_init_");
@@ -600,6 +610,9 @@ class Adaptive_remesher
       ossi << "statistics_" << it_nb << ".txt";
       Tetrahedral_remeshing::internal::compute_statistics(
         tr(), m_cell_selector, ossi.str().c_str());
+      std::ostringstream oss_it;
+      oss_it << "iteration_" << it_nb;
+      Tetrahedral_remeshing::debug::dump_c3t3(m_c3t3, oss_it.str().c_str());
 #endif
 #ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
       CGAL::Tetrahedral_remeshing::debug::check_surface_patch_indices(m_c3t3);

From 1b0df8e7f08f9b74c001240a28329b8eb15f7a31 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 9 Jan 2024 13:14:40 +0100
Subject: [PATCH 1265/1398] [flip] remove useless optional

operator[] of unordered_map already does all that is needed

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 .../internal/flip_edges.h                     | 139 +++++++-----------
 1 file changed, 54 insertions(+), 85 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index ba88cb89d2dc..683ac6c1ff02 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -21,7 +21,6 @@
 #include <CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h>
 
 #include <boost/container/small_vector.hpp>
-#include <optional>
 #include <boost/functional/hash.hpp>
 
 #include <unordered_map>
@@ -311,7 +310,7 @@ Sliver_removal_result flip_3_to_2(typename C3t3::Edge& edge,
       }
       ch->vertex(v)->set_cell(ch);
 
-      inc_cells[ch->vertex(v)] = std::nullopt;
+      inc_cells[ch->vertex(v)].clear();
       ch->reset_cache_validity();
     }
   }
@@ -590,13 +589,9 @@ void find_best_flip_to_improve_dh(C3t3& c3t3,
     if(tr.is_infinite(vh))
       continue;
 
-    std::optional<boost::container::small_vector<Cell_handle, 64>>& o_inc_vh = inc_cells[vh];
-    if (o_inc_vh == std::nullopt)
-    {
-      boost::container::small_vector<Cell_handle, 64> inc_vec;
-      tr.incident_cells(vh, std::back_inserter(inc_vec));
-      o_inc_vh = inc_vec;
-    }
+    boost::container::small_vector<Cell_handle, 64>& o_inc_vh = inc_cells[vh];
+    if (o_inc_vh.empty())
+      tr.incident_cells(vh, std::back_inserter(o_inc_vh));
 
     Facet_circulator facet_circulator = curr_fcirc;
     Facet_circulator facet_done = curr_fcirc;
@@ -614,7 +609,7 @@ void find_best_flip_to_improve_dh(C3t3& c3t3,
                                       indices(facet_circulator->second, i));
         if (curr_vertex != vh0  && curr_vertex != vh1)
         {
-          if (is_edge_uv(vh, curr_vertex, o_inc_vh.value()))
+          if (is_edge_uv(vh, curr_vertex, o_inc_vh))
           {
             is_edge = true;
             break;
@@ -765,13 +760,9 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
   facet_circulator++;
   facet_circulator++;
 
-  std::optional<boost::container::small_vector<Cell_handle, 64>>& o_inc_vh = inc_cells[vh];
-  if (o_inc_vh == std::nullopt)
-  {
-    boost::container::small_vector<Cell_handle, 64> inc_vec;
-    tr.incident_cells(vh, std::back_inserter(inc_vec));
-    o_inc_vh = inc_vec;
-  }
+  boost::container::small_vector<Cell_handle, 64>& o_inc_vh = inc_cells[vh];
+  if (o_inc_vh.empty())
+    tr.incident_cells(vh, std::back_inserter(o_inc_vh));
 
   do
   {
@@ -782,7 +773,7 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
                                     indices(facet_circulator->second, i));
       if (curr_vertex != vh0  && curr_vertex != vh1)
       {
-        if (is_edge_uv(vh, curr_vertex, o_inc_vh.value()))
+        if (is_edge_uv(vh, curr_vertex, o_inc_vh))
           return NOT_FLIPPABLE;
       }
     }
@@ -952,8 +943,7 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
       }
       ch->vertex(v)->set_cell(ch);
 
-      inc_cells[ch->vertex(v)] = std::nullopt;
-      ch->reset_cache_validity();
+      inc_cells[ch->vertex(v)].clear();
     }
   }
 
@@ -1058,8 +1048,7 @@ Sliver_removal_result flip_n_to_m(typename C3t3::Edge& edge,
       find_best_flip_to_improve_dh(c3t3, edge, boundary_vertices[0], boundary_vertices[1],
                                    candidates, curr_max_cosdh);
     else
-      find_best_flip_to_improve_dh(c3t3, edge, candidates, curr_max_cosdh,
-                                   inc_cells);
+      find_best_flip_to_improve_dh(c3t3, edge, candidates, curr_max_cosdh, inc_cells);
 
     bool flip_performed = false;
     while (!candidates.empty() && !flip_performed)
@@ -1176,9 +1165,11 @@ Sliver_removal_result find_best_flip(typename C3t3::Edge& edge,
 }
 
 
-template<typename VertexPair, typename C3t3, typename CellSelector, typename Visitor>
+template<typename VertexPair, typename C3t3,
+         typename IncidentCellsVectorMap, typename CellSelector, typename Visitor>
 std::size_t flip_all_edges(const std::vector<VertexPair>& edges,
                            C3t3& c3t3,
+                           IncidentCellsVectorMap& inc_cells,
                            const Flip_Criterion& criterion,
                            CellSelector& cell_selector,
                            Visitor& visitor)
@@ -1190,24 +1181,16 @@ std::size_t flip_all_edges(const std::vector<VertexPair>& edges,
 
   Tr& tr = c3t3.triangulation();
 
-  std::unordered_map<Vertex_handle,
-    std::optional<boost::container::small_vector<Cell_handle, 64> > > inc_cells;
-
   std::size_t count = 0;
   for (const VertexPair& vp : edges)
   {
-    std::optional<boost::container::small_vector<Cell_handle, 64>>&
-      o_inc_vh = inc_cells[vp.first];
-    if (o_inc_vh == std::nullopt)
-    {
-      boost::container::small_vector<Cell_handle, 64> inc_vec;
-      tr.incident_cells(vp.first, std::back_inserter(inc_vec));
-      o_inc_vh = inc_vec;
-    }
+    boost::container::small_vector<Cell_handle, 64>& o_inc_vh = inc_cells[vp.first];
+    if (o_inc_vh.empty())
+      tr.incident_cells(vp.first, std::back_inserter(o_inc_vh));
 
     Cell_handle ch;
     int i0, i1;
-    if (is_edge_uv(vp.first, vp.second, o_inc_vh.value(), ch, i0, i1))
+    if (is_edge_uv(vp.first, vp.second, o_inc_vh, ch, i0, i1))
     {
       Edge edge(ch, i0, i1);
 
@@ -1438,10 +1421,8 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
   return NOT_FLIPPABLE;
 #endif
 
-  if(inc_cells[edge.first->vertex(edge.second)] != std::nullopt)
-    inc_cells[edge.first->vertex(edge.second)]->clear();
-  if (inc_cells[edge.first->vertex(edge.third)] != std::nullopt)
-    inc_cells[edge.first->vertex(edge.third)]->clear();
+  inc_cells[edge.first->vertex(edge.second)].clear();
+  inc_cells[edge.first->vertex(edge.third)].clear();
 
   Cell_handle ch0, ch1, ch2, ch3;
   ch0 = cells_around_edge[0];
@@ -1856,23 +1837,23 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
   return NOT_FLIPPABLE;
 }
 
-template<typename C3T3, typename SurfaceIndexMapMap, typename Flip_Criterion,
+template<typename C3T3, typename SurfaceIndexMapMap,
+         typename IncidentCellsVectorMap, typename Flip_Criterion,
          typename CellSelector, typename Visitor>
 std::size_t flipBoundaryEdges(
   C3T3& c3t3,
   std::vector<typename C3T3::Edge>& boundary_edges,
   SurfaceIndexMapMap& boundary_vertices_valences,
-  boost::unordered_map<typename C3T3::Vertex_handle,
-                       std::unordered_set<typename C3T3::Subdomain_index> >&  vertices_subdomain_indices,
-  Flip_Criterion flip_criterion,
+  IncidentCellsVectorMap& inc_cells,
+  const Flip_Criterion& flip_criterion,
   CellSelector& cell_selector,
   Visitor& visitor)
 {
-#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-  std::cerr << "\n\tFlipping boundary edges...";
-  std::cerr.flush();
-  std::size_t nb_attempts = 0;
-#endif
+//#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+//  std::cerr << "\n\tFlipping boundary edges...";
+//  std::cerr.flush();
+//  std::size_t nb_attempts = 0;
+//#endif
 
   typedef typename C3T3::Vertex_handle Vertex_handle;
   typedef typename C3T3::Cell_handle   Cell_handle;
@@ -1897,37 +1878,21 @@ std::size_t flipBoundaryEdges(
       candidate_edges_for_flip.push_back(make_vertex_pair(e));
   }
 
-  std::unordered_map<Vertex_handle,
-    std::optional<boost::container::small_vector<Cell_handle, 64> > > inc_cells;
+//  double min_angle = min_dihedral_angle(c3t3);
+//  std::cout << "Min dihedral angle before surface flips = " << min_angle << std::endl;
 
   for (const std::pair<Vertex_handle, Vertex_handle>& vp : candidate_edges_for_flip)
   {
-#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-    std::cerr << "\r\tFlipping boundary edges...("
-      << nb_attempts << " attempts, "
-      << nb << " done, "
-      << candidate_edges_for_flip.size() << " candidates)";
-    std::cerr.flush();
-#endif
-
     const Vertex_handle vh0 = vp.first;
     const Vertex_handle vh1 = vp.second;
 
-    const typename C3T3::Triangulation::Point& p0 = vh0->point();
-    const typename C3T3::Triangulation::Point& p1 = vh1->point();
-
-    std::optional<boost::container::small_vector<Cell_handle, 64>>&
-      o_inc_vh = inc_cells[vh0];
-    if (o_inc_vh == std::nullopt || o_inc_vh->empty())
-    {
-      boost::container::small_vector<Cell_handle, 64> inc_vec;
-      tr.incident_cells(vh0, std::back_inserter(inc_vec));
-      o_inc_vh = inc_vec;
-    }
+    boost::container::small_vector<Cell_handle, 64>& inc_vh0 = inc_cells[vh0];
+    if (inc_vh0.empty())
+      tr.incident_cells(vh0, std::back_inserter(inc_vh0));
 
     Cell_handle c;
     int i, j;
-    if (!is_edge_uv(vh0, vh1, o_inc_vh.value(), c, i, j))
+    if (!is_edge_uv(vh0, vh1, inc_vh0, c, i, j))
       continue;
 
     Edge edge(c, i, j);
@@ -2024,9 +1989,9 @@ std::size_t flipBoundaryEdges(
             std::distance(c3t3.edges_in_complex_begin(),
                           c3t3.edges_in_complex_end()));
 
-#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-          ++nb_attempts;
-#endif
+//#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+//          ++nb_attempts;
+//#endif
           Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3,
                                                      inc_cells,
                                                      flip_criterion,
@@ -2063,10 +2028,6 @@ std::size_t flipBoundaryEdges(
             boundary_vertices_valences[vh1][surfi]--;
             boundary_vertices_valences[vh2][surfi]++;
             boundary_vertices_valences[vh3][surfi]++;
-
-//            std::cout << "Valid boundary flip" << std::endl;
-//            CGAL::Tetrahedral_remeshing::debug::dump_c3t3(c3t3, "dump_after_flip_");
-//            nb_surface_nm_flips_done++;
           }
           else if (db == INVALID_CELL || db == INVALID_VERTEX || db == INVALID_ORIENTATION)
           {
@@ -2098,6 +2059,7 @@ void flip_edges(C3T3& c3t3,
   CGAL_USE(protect_boundaries);
   typedef typename C3T3::Triangulation       T3;
   typedef typename T3::Vertex_handle         Vertex_handle;
+  typedef typename T3::Cell_handle           Cell_handle;
   typedef typename T3::Edge                  Edge;
   typedef typename std::pair<Vertex_handle, Vertex_handle> Edge_vv;
   typedef typename C3T3::Subdomain_index     Subdomain_index;
@@ -2105,7 +2067,8 @@ void flip_edges(C3T3& c3t3,
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
   std::cout << "Flip edges...";
   std::cout.flush();
-  std::size_t nb_flips = 0;
+  std::size_t nb_flips_in_volume = 0;
+  std::size_t nb_flips_on_surface = 0;
 #endif
 
   //const Flip_Criterion criterion = VALENCE_MIN_DH_BASED;
@@ -2125,6 +2088,13 @@ void flip_edges(C3T3& c3t3,
 //    flip_all_edges(inside_edges, c3t3, MIN_ANGLE_BASED, visitor);
 //  //}
 
+  std::unordered_map<Vertex_handle,
+    boost::container::small_vector<Cell_handle, 64> > inc_cells;
+
+#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
+  nb_flips_in_volume +=
+#endif
+    flip_all_edges(inside_edges, c3t3, inc_cells, MIN_ANGLE_BASED, cell_selector, visitor);
   if (!protect_boundaries)
   {
     typedef typename C3T3::Surface_patch_index Surface_patch_index;
@@ -2149,21 +2119,20 @@ void flip_edges(C3T3& c3t3,
   //    flipBoundaryEdges(boundary_edges, boundary_vertices_valences, VALENCE_BASED);
   //  else
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-    nb_flips +=
+   nb_flips_on_surface +=
 #endif
       flipBoundaryEdges(c3t3, boundary_edges, boundary_vertices_valences,
-                        vertices_subdomain_indices, MIN_ANGLE_BASED,
+                        inc_cells,
+                        MIN_ANGLE_BASED,
                         cell_selector, visitor);
   }
 
-#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-  nb_flips +=
-#endif
-    flip_all_edges(inside_edges, c3t3, MIN_ANGLE_BASED, cell_selector, visitor);
   //}
 
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-  std::cout << " done (" << nb_flips << " flips)." << std::endl;
+  std::cout << "\nFlip edges... done ("
+    << nb_flips_on_surface << "/"
+    << nb_flips_in_volume << " surface/volume flips done)." << std::endl;
 #endif
 }
 

From bc956d6ea36d06d0a6b21e471f92c1d538a2177e Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 9 Jan 2024 13:27:49 +0100
Subject: [PATCH 1266/1398] [flip] reset sliver cache that may have been
 populated with dihedral angles during perturb()

---
 .../CGAL/Tetrahedral_remeshing/internal/flip_edges.h     | 9 ++++++---
 1 file changed, 6 insertions(+), 3 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 683ac6c1ff02..d276d61b4589 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -945,6 +945,7 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
 
       inc_cells[ch->vertex(v)].clear();
     }
+    ch->reset_cache_validity();
   }
 
   // Update c3t3
@@ -954,6 +955,7 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
   for (Cell_handle ch : to_remove)
   {
     treat_before_delete(ch, cell_selector, c3t3);
+    ch->reset_cache_validity();
     tr.tds().delete_cell(ch);
   }
 
@@ -1213,9 +1215,6 @@ std::size_t flip_all_edges(const std::vector<VertexPair>& edges,
     }
   }
 
-  for (Cell_handle c : tr.finite_cell_handles())
-    c->reset_cache_validity();
-
   return count;
 }
 
@@ -2071,6 +2070,10 @@ void flip_edges(C3T3& c3t3,
   std::size_t nb_flips_on_surface = 0;
 #endif
 
+  for (auto c : c3t3.cells_in_complex())
+    c->reset_cache_validity();//we will use sliver_value
+                              //to store the cos_dihedral_angle
+
   //const Flip_Criterion criterion = VALENCE_MIN_DH_BASED;
 
   std::vector<Edge_vv> inside_edges;

From aeda27f4050c544b3107c417d78f0fda2752d607 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Tue, 9 Jan 2024 13:58:03 +0100
Subject: [PATCH 1267/1398] "compilation of  demo_framework" should be in the
 Installation package and Polyhedron

---
 Installation/cmake/modules/CGAL_add_test.cmake          | 4 ++--
 Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/Installation/cmake/modules/CGAL_add_test.cmake b/Installation/cmake/modules/CGAL_add_test.cmake
index 904e35e25f13..edc7b43dbee1 100644
--- a/Installation/cmake/modules/CGAL_add_test.cmake
+++ b/Installation/cmake/modules/CGAL_add_test.cmake
@@ -117,7 +117,7 @@ function(cgal_add_compilation_test exe_name)
     add_test(NAME "check build system"
       COMMAND "${CMAKE_COMMAND}" --build "${CMAKE_BINARY_DIR}" --target "cgal_check_build_system" --config "$<CONFIG>")
     set_property(TEST "check build system"
-      APPEND PROPERTY LABELS "CGAL_build_system")
+      APPEND PROPERTY LABELS "CGAL_build_system" "Installation")
     set_property(TEST "check build system"
        PROPERTY FIXTURES_SETUP "check_build_system_SetupFixture")
   endif()
@@ -133,7 +133,7 @@ function(cgal_add_compilation_test exe_name)
       add_test(NAME "compilation of  CGAL_Qt6_moc_and_resources"
         COMMAND "${CMAKE_COMMAND}" --build "${CMAKE_BINARY_DIR}" --target "CGAL_Qt6_moc_and_resources" --config "$<CONFIG>")
       set_property(TEST "compilation of  CGAL_Qt6_moc_and_resources"
-        APPEND PROPERTY LABELS "CGAL_build_system")
+        APPEND PROPERTY LABELS "CGAL_build_system" "Installation")
       set_property(TEST "compilation of  CGAL_Qt6_moc_and_resources"
         PROPERTY FIXTURES_SETUP "CGAL_Qt6_moc_and_resources_Fixture")
       set_property(TEST "compilation of  CGAL_Qt6_moc_and_resources"
diff --git a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
index 91f4f0866374..731986536075 100644
--- a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
+++ b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
@@ -45,11 +45,11 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
                 COMMAND "${CMAKE_COMMAND}" --build "${CMAKE_BINARY_DIR}" --target "demo_framework" --config "$<CONFIG>")
 
               set_property(TEST "compilation of  demo_framework"
-                APPEND PROPERTY LABELS "CGAL_build_system")
+                APPEND PROPERTY LABELS "CGAL_build_system" "Installation" "${PROJECT_NAME}")
               set_property(TEST "compilation of  demo_framework"
                 APPEND PROPERTY FIXTURES_SETUP "demo_framework_SetupFixture")
               set_property(TEST "compilation of  demo_framework"
-                APPEND PROPERTY DEPENDS "compilation_of__CGAL_Qt6_moc_and_resources")
+                APPEND PROPERTY DEPENDS "check build system" "compilation of  CGAL_Qt6_moc_and_resources")
         endif()
       endif()
     else()

From 49415f30866991c2466d07531c5be402662a3757 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 9 Jan 2024 14:02:59 +0100
Subject: [PATCH 1268/1398] little cleaning

---
 .../mesh_and_remesh_polyhedral_domain_with_features.cpp  | 9 ++++-----
 .../internal/tetrahedral_adaptive_remeshing_impl.h       | 8 ++++----
 2 files changed, 8 insertions(+), 9 deletions(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
index 592573350a18..86cb9b0b5333 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
@@ -1,9 +1,5 @@
 #define CGAL_MESH_3_VERBOSE 1
 #define CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-#define CGAL_DUMP_REMESHING_STEPS
-#define CGAL_TETRAHEDRAL_REMESHING_DEBUG
-#define CGAL_TETRAHEDRAL_REMESHING_NO_EXTRA_ITERATIONS
-//#define PROTECT_ANGLES_FROM_COLLAPSE
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
@@ -98,13 +94,16 @@ int main(int argc, char* argv[])
     cell_size = size);
 
   // Mesh generation
-  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria, no_perturb(), no_exude());
+  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria);// , no_perturb(), no_exude());
 
   // Output
 //  std::ofstream os(fname_mesh3, std::ios_base::out | std::ios_base::binary);
 //  CGAL::Mesh_3::save_binary_file(os, c3t3);
   CGAL::dump_c3t3(c3t3, "out_after_meshing");
 
+  const double min_dihedral_angle = CGAL::Tetrahedral_remeshing::min_dihedral_angle(c3t3);
+  std::cout << "Min dihedral angle after meshing = " << min_dihedral_angle << std::endl;
+
   // Remeshing
   CGAL::tetrahedral_isotropic_remeshing(c3t3, size,
     CGAL::parameters::number_of_iterations(nb_iter));
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
index 9f97a4293052..b932a6ba7ccb 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
@@ -193,7 +193,7 @@ class Adaptive_remesher
       m_c3t3.triangulation(), "1-c3t3_vertices_after_split");
     CGAL::Tetrahedral_remeshing::debug::check_surface_patch_indices(m_c3t3);
     const double mdh = CGAL::Tetrahedral_remeshing::min_dihedral_angle(m_c3t3);
-    std::cout << "\t Min dihedral angle = " << mdh << std::endl;
+    std::cout << "Min dihedral angle = " << mdh << std::endl;
 #endif
 #ifdef CGAL_DUMP_REMESHING_STEPS
     CGAL::Tetrahedral_remeshing::debug::dump_c3t3(m_c3t3, "1-split");
@@ -217,7 +217,7 @@ class Adaptive_remesher
       m_c3t3.triangulation(), "2-c3t3_vertices_after_collapse");
     CGAL::Tetrahedral_remeshing::debug::check_surface_patch_indices(m_c3t3);
     const double mdh = CGAL::Tetrahedral_remeshing::min_dihedral_angle(m_c3t3);
-    std::cout << "\n\t Min dihedral angle = " << mdh << std::endl;
+    std::cout << "Min dihedral angle = " << mdh << std::endl;
 #endif
 #ifdef CGAL_DUMP_REMESHING_STEPS
     CGAL::Tetrahedral_remeshing::debug::dump_c3t3(m_c3t3, "2-collapse");
@@ -236,7 +236,7 @@ class Adaptive_remesher
       m_c3t3.triangulation(), "3-c3t3_vertices_after_flip");
     CGAL::Tetrahedral_remeshing::debug::check_surface_patch_indices(m_c3t3);
     const double mdh = CGAL::Tetrahedral_remeshing::min_dihedral_angle(m_c3t3);
-    std::cout << "\n\t Min dihedral angle = " << mdh << std::endl;
+    std::cout << "Min dihedral angle = " << mdh << std::endl;
 #endif
 #ifdef CGAL_DUMP_REMESHING_STEPS
     CGAL::Tetrahedral_remeshing::debug::dump_c3t3(m_c3t3, "3-flip");
@@ -254,7 +254,7 @@ class Adaptive_remesher
       m_c3t3.triangulation(), "4-c3t3_vertices_after_smooth");
     CGAL::Tetrahedral_remeshing::debug::check_surface_patch_indices(m_c3t3);
     const double mdh = CGAL::Tetrahedral_remeshing::min_dihedral_angle(m_c3t3);
-    std::cout << "\n\t Min dihedral angle = " << mdh << std::endl;
+    std::cout << "Min dihedral angle = " << mdh << std::endl;
 #endif
 #ifdef CGAL_DUMP_REMESHING_STEPS
     CGAL::Tetrahedral_remeshing::debug::dump_c3t3(m_c3t3, "4-smooth");

From a0638f6e0a9c23f209ff9e5210c81ab12670d8ac Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 10 Jan 2024 11:18:50 +0100
Subject: [PATCH 1269/1398] Use file's completeBaseName for item names

---
 .../Polyhedron/Plugins/IO/GOCAD_io_plugin.cpp    |  4 ++--
 .../demo/Polyhedron/Plugins/IO/Nef_io_plugin.cpp |  2 +-
 .../demo/Polyhedron/Plugins/IO/OFF_io_plugin.cpp |  2 +-
 .../Plugins/IO/OFF_to_nef_io_plugin.cpp          |  2 +-
 .../Plugins/IO/Polylines_io_plugin.cpp           |  2 +-
 .../demo/Polyhedron/Plugins/IO/VTK_io_plugin.cpp | 16 ++++++++--------
 .../demo/Polyhedron/Plugins/IO/WKT_io_plugin.cpp |  2 +-
 .../Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp |  6 +++---
 .../Plugins/Mesh_3/C3t3_rib_exporter_plugin.cpp  |  2 +-
 .../Plugins/Mesh_3/Io_image_plugin.cpp           |  8 ++++----
 .../Polyhedron/Plugins/PMP/Selection_plugin.cpp  |  2 +-
 11 files changed, 24 insertions(+), 24 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/GOCAD_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/GOCAD_io_plugin.cpp
index feeef33572e7..36233827a32a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/GOCAD_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/GOCAD_io_plugin.cpp
@@ -85,7 +85,7 @@ Polyhedron_demo_gocad_plugin::load(QFileInfo fileinfo, bool& ok, bool add_to_sce
   t.stop();
   std::cerr << "Reading took " << t.time() << " sec." << std::endl;
   if(name_and_color.first.size() == 0){
-    item->setName(fileinfo.baseName());
+    item->setName(fileinfo.completeBaseName());
   } else {
     item->setName(name_and_color.first.c_str());
   }
@@ -121,7 +121,7 @@ save(QFileInfo fileinfo,QList<CGAL::Three::Scene_item*>& items)
   std::ofstream out(fileinfo.filePath().toUtf8());
   out.precision (std::numeric_limits<double>::digits10 + 2);
   SMesh* poly = const_cast<SMesh*>(sm_item->polyhedron());
-  CGAL::IO::write_GOCAD(out, qPrintable(fileinfo.baseName()), *poly);
+  CGAL::IO::write_GOCAD(out, qPrintable(fileinfo.completeBaseName()), *poly);
   items.pop_front();
   return true;
 
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/Nef_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/Nef_io_plugin.cpp
index ed9658065f70..25b5c1d7432b 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/Nef_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/Nef_io_plugin.cpp
@@ -57,7 +57,7 @@ load(QFileInfo fileinfo, bool& ok, bool add_to_scene) {
 
   // Try to read .nef3 in a polyhedron
   Scene_nef_polyhedron_item* item = new Scene_nef_polyhedron_item();
-  item->setName(fileinfo.baseName());
+  item->setName(fileinfo.completeBaseName());
   if(fileinfo.size() == 0)
   {
     CGAL::Three::Three::warning( tr("The file you are trying to load is empty."));
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/OFF_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/OFF_io_plugin.cpp
index e7de52da567b..c413104e883b 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/OFF_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/OFF_io_plugin.cpp
@@ -215,7 +215,7 @@ Polyhedron_demo_off_plugin::load_obj(QFileInfo fileinfo) {
     return nullptr;
   }
   Scene_surface_mesh_item* item = new Scene_surface_mesh_item();
-  item->setName(fileinfo.baseName());
+  item->setName(fileinfo.completeBaseName());
   if(item->load_obj(in))
     return item;
   //if not polygonmesh load in soup
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/OFF_to_nef_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/OFF_to_nef_io_plugin.cpp
index 0f04fcd2dbf5..9e6cfd399ee4 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/OFF_to_nef_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/OFF_to_nef_io_plugin.cpp
@@ -50,7 +50,7 @@ load(QFileInfo fileinfo, bool& ok, bool add_to_scene){
     return QList<Scene_item*>()<<item;
   }
 
-  item->setName(fileinfo.baseName());
+  item->setName(fileinfo.completeBaseName());
   ok = true;
   if(add_to_scene)
     CGAL::Three::Three::scene()->addItem(item);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
index 3573ec548f3c..75503490a2a9 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/Polylines_io_plugin.cpp
@@ -201,7 +201,7 @@ load(QFileInfo fileinfo, bool& ok, bool add_to_scene){
   }
   Scene_polylines_item* item = new Scene_polylines_item;
   item->polylines = polylines;
-  item->setName(fileinfo.baseName());
+  item->setName(fileinfo.completeBaseName());
   item->setColor(Qt::black);
   item->setProperty("polylines metadata", polylines_metadata);
   std::cerr << "Number of polylines in item: " << item->polylines.size() << std::endl;
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/VTK_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/VTK_io_plugin.cpp
index bf3f4bf54e9f..ca824a3e9ee9 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/VTK_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/VTK_io_plugin.cpp
@@ -348,7 +348,7 @@ class Polyhedron_demo_vtk_plugin :
        || (is_polygon_mesh && is_polyline)
        || (is_c3t3 && is_polyline) )
     {
-      group = new Scene_group_item(fileinfo.baseName());
+      group = new Scene_group_item(fileinfo.completeBaseName());
     }
 
     if(is_polygon_mesh)
@@ -372,12 +372,12 @@ class Polyhedron_demo_vtk_plugin :
       if(poly_item) {
         if(group)
         {
-          poly_item->setName(QString("%1_faces").arg(fileinfo.baseName()));
+          poly_item->setName(QString("%1_faces").arg(fileinfo.completeBaseName()));
           CGAL::Three::Three::scene()->addItem(poly_item);
           CGAL::Three::Three::scene()->changeGroup(poly_item, group);
         }
         else{
-          poly_item->setName(fileinfo.baseName());
+          poly_item->setName(fileinfo.completeBaseName());
           ok = true;
           if(add_to_scene)
             CGAL::Three::Three::scene()->addItem(poly_item);
@@ -484,12 +484,12 @@ class Polyhedron_demo_vtk_plugin :
       c3t3_item->resetCutPlane();
       if(group)
       {
-        c3t3_item->setName(QString("%1_tetrahedra").arg(fileinfo.baseName()));
+        c3t3_item->setName(QString("%1_tetrahedra").arg(fileinfo.completeBaseName()));
         CGAL::Three::Three::scene()->addItem(c3t3_item);
         CGAL::Three::Three::scene()->changeGroup(c3t3_item, group);
       }
       else{
-        c3t3_item->setName(fileinfo.baseName());
+        c3t3_item->setName(fileinfo.completeBaseName());
         ok = true;
         if(add_to_scene)
           CGAL::Three::Three::scene()->addItem(c3t3_item);
@@ -506,12 +506,12 @@ class Polyhedron_demo_vtk_plugin :
           polyline_item->polylines.push_back(segment);
       if(group)
       {
-        polyline_item->setName(QString("%1_lines").arg(fileinfo.baseName()));
+        polyline_item->setName(QString("%1_lines").arg(fileinfo.completeBaseName()));
         CGAL::Three::Three::scene()->addItem(polyline_item);
         CGAL::Three::Three::scene()->changeGroup(polyline_item, group);
       }
       else{
-        polyline_item->setName(fileinfo.baseName());
+        polyline_item->setName(fileinfo.completeBaseName());
         ok = true;
         if(add_to_scene)
           CGAL::Three::Three::scene()->addItem(polyline_item);
@@ -537,7 +537,7 @@ class Polyhedron_demo_vtk_plugin :
       double* p = data->GetPoint(i);
       point_item->point_set()->insert(Point_3(p[0], p[1], p[2]));
     }
-    point_item->setName(fileinfo.baseName());
+    point_item->setName(fileinfo.completeBaseName());
     ok = true;
     if(add_to_scene)
       CGAL::Three::Three::scene()->addItem(point_item);
diff --git a/Polyhedron/demo/Polyhedron/Plugins/IO/WKT_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/IO/WKT_io_plugin.cpp
index 9dbd44d2abe3..8810d81942a4 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/IO/WKT_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/IO/WKT_io_plugin.cpp
@@ -64,7 +64,7 @@ load(QFileInfo fileinfo, bool& ok, bool add_to_scene) {
 
   Scene_polylines_item* item = new Scene_polylines_item;
   item->polylines = polylines;
-  item->setName(fileinfo.baseName());
+  item->setName(fileinfo.completeBaseName());
   item->setColor(Qt::black);
   std::cerr << "Number of polylines in item: " << item->polylines.size() << std::endl;
   item->invalidateOpenGLBuffers();
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
index 4cadd392fd38..536545443d48 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
@@ -96,7 +96,7 @@ Polyhedron_demo_c3t3_binary_io_plugin::load(
     }
     if(fileinfo.suffix().toLower() == "cgal")
     {
-        item->setName(fileinfo.baseName());
+        item->setName(fileinfo.completeBaseName());
 
         if(item->load_binary(in)) {
           if(add_to_scene){
@@ -134,7 +134,7 @@ Polyhedron_demo_c3t3_binary_io_plugin::load(
       in.open(fileinfo.filePath().toUtf8(), std::ios_base::in);//not binary
       CGAL_assertion(!(!in));
 
-      item->setName(fileinfo.baseName());
+      item->setName(fileinfo.completeBaseName());
       item->set_valid(false);
 
       if(CGAL::SMDS_3::build_triangulation_from_file(in, item->c3t3().triangulation(),
@@ -165,7 +165,7 @@ Polyhedron_demo_c3t3_binary_io_plugin::load(
         CGAL_assertion(!(!in));
       }
 
-      item->setName(fileinfo.baseName());
+      item->setName(fileinfo.completeBaseName());
 
       if (CGAL::IO::read_AVIZO_TETRA(in, item->c3t3().triangulation()))
       {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_rib_exporter_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_rib_exporter_plugin.cpp
index 795f6a247f93..8fbe68dfc4ea 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_rib_exporter_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_rib_exporter_plugin.cpp
@@ -387,7 +387,7 @@ save(const Scene_c3t3_item& c3t3_item, const QFileInfo& fileInfo)
   rib_file.precision(8);
 
   // Header
-  QString basename = fileInfo.baseName();
+  QString basename = fileInfo.completeBaseName();
   write_header(qPrintable(basename), rib_file);
 
   // Lights
diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
index fd99361c2902..317e15e7dc78 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/Io_image_plugin.cpp
@@ -1356,7 +1356,7 @@ Io_image_plugin::load(QFileInfo fileinfo, bool& ok, bool add_to_scene)
   {
     //Create planes
     image_item = new Scene_image_item(image,0, true);
-    image_item->setName(fileinfo.baseName());
+    image_item->setName(fileinfo.completeBaseName());
     msgBox.setText("Planes created : 0/3");
     msgBox.setStandardButtons(QMessageBox::NoButton);
     msgBox.show();
@@ -1367,7 +1367,7 @@ Io_image_plugin::load(QFileInfo fileinfo, bool& ok, bool add_to_scene)
   {
     image_item = new Scene_image_item(image,voxel_scale, false);
   }
-  image_item->setName(fileinfo.baseName());
+  image_item->setName(fileinfo.completeBaseName());
 
   if(add_to_scene)
     CGAL::Three::Three::scene()->addItem(image_item);
@@ -1456,7 +1456,7 @@ bool Io_image_plugin::loadDirectory(const QString& dirname,
       {
         // Create planes
         image_item = new Scene_image_item(image,125, true);
-        image_item->setName(fileinfo.baseName());
+        image_item->setName(fileinfo.completeBaseName());
         msgBox.setText("Planes created : 0/3");
         msgBox.setStandardButtons(QMessageBox::NoButton);
         msgBox.show();
@@ -1470,7 +1470,7 @@ bool Io_image_plugin::loadDirectory(const QString& dirname,
         int voxel_scale = ui.precisionList->currentIndex() + 1;
 
         image_item = new Scene_image_item(image,voxel_scale, false);
-        image_item->setName(fileinfo.baseName());
+        image_item->setName(fileinfo.completeBaseName());
         scene->addItem(image_item);
       }
     }
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp
index b1ffae6e97bd..2c50e614ac01 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Selection_plugin.cpp
@@ -111,7 +111,7 @@ class Polyhedron_demo_selection_plugin :
         ok = false;
         return QList<Scene_item*>();
       }
-      item->setName(fileinfo.baseName());
+      item->setName(fileinfo.completeBaseName());
       ok = true;
       if(add_to_scene)
         CGAL::Three::Three::scene()->addItem(item);

From 83fd1fe2b34bcbe6a69437e6d4748412f24889a3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 10 Jan 2024 11:19:12 +0100
Subject: [PATCH 1270/1398] Disable the area smoothing box if Ceres is not
 available

---
 Polyhedron/demo/Polyhedron/Plugins/PMP/Smoothing_plugin.cpp | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Smoothing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Smoothing_plugin.cpp
index 212f2cc60ef7..70747cdddc9f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Smoothing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Smoothing_plugin.cpp
@@ -107,6 +107,10 @@ class Polyhedron_demo_smothing_plugin
     ui_widget.projection_checkBox->setChecked(true);
 
     ui_widget.area_smoothing_checkBox->setChecked(false);
+#ifndef CGAL_PMP_USE_CERES_SOLVER
+    ui_widget.area_smoothing_checkBox->setDisabled(true);
+#endif
+    ui_widget.flip_checkBox->setChecked(true);
     ui_widget.flip_checkBox->setDisabled(true);
   }
 

From 53567bd20a3b3f0231f5841861b462b7644cd112 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 10 Jan 2024 11:19:43 +0100
Subject: [PATCH 1271/1398] Handle non triangulated inputs in the repair plugin

---
 .../Plugins/PMP/Repair_polyhedron_plugin.cpp         | 12 ++++++++++++
 1 file changed, 12 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
index b0ac1f859965..6a6d43c08f2a 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
@@ -373,6 +373,11 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionRemoveDegenerateFaces_tr
     qobject_cast<Item*>(scene->item(index));
   if (poly_item)
   {
+    if(! CGAL::is_triangle_mesh(*poly_item->polyhedron())) {
+      CGAL::Three::Three::error(QString("The mesh must have triangle faces"));
+      return;
+    }
+
     std::size_t nbv = faces(*poly_item->polyhedron()).size();
       CGAL::Polygon_mesh_processing::remove_degenerate_faces(
       *poly_item->polyhedron());
@@ -399,6 +404,11 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionRemoveSelfIntersections_
     qobject_cast<Item*>(scene->item(index));
   if (poly_item)
   {
+    if(! CGAL::is_triangle_mesh(*poly_item->polyhedron())) {
+      CGAL::Three::Three::error(QString("The mesh must have triangle faces"));
+      return;
+    }
+
     bool solved =
       CGAL::Polygon_mesh_processing::experimental::remove_self_intersections(
       *poly_item->polyhedron(), CGAL::parameters::preserve_genus(false));
@@ -424,6 +434,7 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionAutorefine_triggered(Sce
     qobject_cast<Item*>(scene->item(index));
   if (poly_item)
   {
+    CGAL::Polygon_mesh_processing::triangulate_faces(*poly_item->polyhedron());
     try{
       CGAL::Polygon_mesh_processing::experimental::autorefine(*poly_item->polyhedron());
     }
@@ -523,6 +534,7 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionAutorefineAndRMSelfInter
     qobject_cast<Item*>(scene->item(index));
   if (poly_item)
   {
+    CGAL::Polygon_mesh_processing::triangulate_faces(*poly_item->polyhedron());
     try{
       bool solved =
         CGAL::Polygon_mesh_processing::experimental::

From af3608335b8e1f3f88b3150a0616fdac8ca0ba71 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Wed, 10 Jan 2024 11:20:29 +0100
Subject: [PATCH 1272/1398] Misc indentation fixes

---
 Polyhedron/demo/Polyhedron/MainWindow.cpp      |  2 +-
 .../Plugins/PMP/Repair_polyhedron_plugin.cpp   | 18 ++++++------------
 2 files changed, 7 insertions(+), 13 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/MainWindow.cpp b/Polyhedron/demo/Polyhedron/MainWindow.cpp
index 1f92d97129fc..f85d0355570a 100644
--- a/Polyhedron/demo/Polyhedron/MainWindow.cpp
+++ b/Polyhedron/demo/Polyhedron/MainWindow.cpp
@@ -1102,7 +1102,7 @@ void MainWindow::open(QString filename)
   if ( dfs_it==default_plugin_selection.end() )
   {
     // collect all io_plugins and offer them to load if the file extension match one name filter
-    // also collect all available plugin in case of a no extension match
+    // also collect all available plugins in case of a no extension match
     for(CGAL::Three::Polyhedron_demo_io_plugin_interface* io_plugin : io_plugins) {
       if ( file_matches_filter(io_plugin->loadNameFilters(), filename.toLower()) )
       {
diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
index 6a6d43c08f2a..5d87af53f59e 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Repair_polyhedron_plugin.cpp
@@ -182,8 +182,7 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionRemoveIsolatedVertices_t
   if (poly_item)
   {
     std::size_t nbv =
-      CGAL::Polygon_mesh_processing::remove_isolated_vertices(
-        *poly_item->polyhedron());
+      CGAL::Polygon_mesh_processing::remove_isolated_vertices(*poly_item->polyhedron());
     CGAL::Three::Three::information(tr(" %1 isolated vertices have been removed.")
       .arg(nbv));
     poly_item->setNbIsolatedvertices(0);
@@ -369,8 +368,7 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionSnapBorders_triggered()
 template <typename Item>
 void Polyhedron_demo_repair_polyhedron_plugin::on_actionRemoveDegenerateFaces_triggered(Scene_interface::Item_id index)
 {
-  Item* poly_item =
-    qobject_cast<Item*>(scene->item(index));
+  Item* poly_item = qobject_cast<Item*>(scene->item(index));
   if (poly_item)
   {
     if(! CGAL::is_triangle_mesh(*poly_item->polyhedron())) {
@@ -379,8 +377,7 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionRemoveDegenerateFaces_tr
     }
 
     std::size_t nbv = faces(*poly_item->polyhedron()).size();
-      CGAL::Polygon_mesh_processing::remove_degenerate_faces(
-      *poly_item->polyhedron());
+      CGAL::Polygon_mesh_processing::remove_degenerate_faces(*poly_item->polyhedron());
     nbv -= faces(*poly_item->polyhedron()).size();
     poly_item->invalidateOpenGLBuffers();
     Q_EMIT poly_item->itemChanged();
@@ -400,8 +397,7 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionRemoveDegenerateFaces_tr
 template <typename Item>
 void Polyhedron_demo_repair_polyhedron_plugin::on_actionRemoveSelfIntersections_triggered(Scene_interface::Item_id index)
 {
-  Item* poly_item =
-    qobject_cast<Item*>(scene->item(index));
+  Item* poly_item = qobject_cast<Item*>(scene->item(index));
   if (poly_item)
   {
     if(! CGAL::is_triangle_mesh(*poly_item->polyhedron())) {
@@ -430,8 +426,7 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionRemoveSelfIntersections_
 template <typename Item>
 void Polyhedron_demo_repair_polyhedron_plugin::on_actionAutorefine_triggered(Scene_interface::Item_id index)
 {
-  Item* poly_item =
-    qobject_cast<Item*>(scene->item(index));
+  Item* poly_item = qobject_cast<Item*>(scene->item(index));
   if (poly_item)
   {
     CGAL::Polygon_mesh_processing::triangulate_faces(*poly_item->polyhedron());
@@ -530,8 +525,7 @@ void Polyhedron_demo_repair_polyhedron_plugin::on_actionNewAutorefine_triggered(
 template <typename Item>
 void Polyhedron_demo_repair_polyhedron_plugin::on_actionAutorefineAndRMSelfIntersections_triggered(Scene_interface::Item_id index)
 {
-  Item* poly_item =
-    qobject_cast<Item*>(scene->item(index));
+  Item* poly_item = qobject_cast<Item*>(scene->item(index));
   if (poly_item)
   {
     CGAL::Polygon_mesh_processing::triangulate_faces(*poly_item->polyhedron());

From 1f26c03e3bb23c0906cd9de5273a51310ff5b835 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 10 Jan 2024 16:23:44 +0100
Subject: [PATCH 1273/1398] plugins should not depend on `Polyhedron_3`

---
 Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp | 2 +-
 Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake      | 3 ---
 SMDS_3/examples/SMDS_3/c3t3_example.cpp                      | 2 +-
 3 files changed, 2 insertions(+), 5 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
index 4cadd392fd38..c83911ea93f1 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
@@ -138,7 +138,7 @@ Polyhedron_demo_c3t3_binary_io_plugin::load(
       item->set_valid(false);
 
       if(CGAL::SMDS_3::build_triangulation_from_file(in, item->c3t3().triangulation(),
-         /*verbose = */false, /*replace_subdomain_0 = */false, /*allow_non_manifold = */true))
+         /*verbose = */true, /*replace_subdomain_0 = */false, /*allow_non_manifold = */true))
       {
         update_c3t3(item->c3t3());
 
diff --git a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
index 731986536075..c9ffbd9a93e6 100644
--- a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
+++ b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
@@ -61,9 +61,6 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
     endif()
     # Link with CGAL
     target_link_libraries( ${plugin_name} PUBLIC CGAL::CGAL )
-    if(TARGET Polyhedron_3)
-      add_dependencies( ${plugin_name} Polyhedron_3 )
-    endif()
     if(NOT TARGET CGALlab_all_plugins)
       add_custom_target(CGALlab_all_plugins)
     endif()
diff --git a/SMDS_3/examples/SMDS_3/c3t3_example.cpp b/SMDS_3/examples/SMDS_3/c3t3_example.cpp
index 5ebb5cc3e358..f6d7043c2d03 100644
--- a/SMDS_3/examples/SMDS_3/c3t3_example.cpp
+++ b/SMDS_3/examples/SMDS_3/c3t3_example.cpp
@@ -42,7 +42,7 @@ int main(int argc, char* argv[])
   Triangulation tr;
 
   std::ifstream is(filename, std::ios_base::in);
-  if(!CGAL::IO::read_MEDIT(is, tr))
+  if(!CGAL::IO::read_MEDIT(is, tr, CGAL::parameters::verbose(true)))
   {
     std::cerr << "Failed to read" << std::endl;
     return EXIT_FAILURE;

From 37ef2a04f853e1b93857ad746ef5c9970b5bfdad Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 10 Jan 2024 17:08:40 +0000
Subject: [PATCH 1274/1398] Make the file name unique by baking a pointer in it

---
 .../CGAL/_test_cls_triangulation_short_2.h    | 19 ++++++++++++++-----
 1 file changed, 14 insertions(+), 5 deletions(-)

diff --git a/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_triangulation_short_2.h b/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_triangulation_short_2.h
index 132e487bff27..08725583a25d 100644
--- a/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_triangulation_short_2.h
+++ b/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_triangulation_short_2.h
@@ -24,7 +24,8 @@
 
 #include <iostream>
 #include <fstream>
-
+#include <sstream>
+#include <string>
 #include <utility>
 #include <list>
 
@@ -475,23 +476,31 @@ _test_cls_triangulation_short_2( const Triangul &)
 
   /********************/
   /******** I/O *******/
+  std::string T15fname, T23fname;
+  std::stringstream ss15;
+  ss15 << "T15" << &T1_5 << ".triangulation";
+  ss15 >> T15fname;
+  std::stringstream ss23;
+  ss23 << "T23" << &T2_3 << ".triangulation";
+  ss23 >> T23fname;
+
   std::cout << "    output to a file" << std::endl;
-  std::ofstream of1_5("T15short.triangulation");
+  std::ofstream of1_5(T15fname.c_str());
   CGAL::IO::set_ascii_mode(of1_5);
   of1_5 << T1_5; of1_5.close();
-  std::ofstream of2_3("T23short.triangulation");
+  std::ofstream of2_3(T23fname.c_str());
   CGAL::IO::set_ascii_mode(of2_3);
   of2_3 << T2_3; of2_3.close();
 
 
   std::cout << "    input from a file" << std::endl;
 
-  std::ifstream if1_5("T15short.triangulation"); CGAL::IO::set_ascii_mode(if1_5);
+  std::ifstream if1_5(T15fname.c_str()); CGAL::IO::set_ascii_mode(if1_5);
   Triangul T1_5_copy; if1_5 >> T1_5_copy;
   assert( T1_5_copy.is_valid() &&
           T1_5_copy.number_of_vertices() == T1_5.number_of_vertices() );
 
-  std::ifstream if2_3("T23short.triangulation"); CGAL::IO::set_ascii_mode(if2_3);
+  std::ifstream if2_3(T23fname.c_str()); CGAL::IO::set_ascii_mode(if2_3);
   Triangul T2_3_copy; if2_3 >> T2_3_copy;
   assert( T2_3_copy.is_valid() &&
           T2_3_copy.number_of_vertices() == T2_3.number_of_vertices() );

From d4a36120d83cb0de06483d30ff21e26448ad2124 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 11 Jan 2024 09:31:15 +0100
Subject: [PATCH 1275/1398] make sure we can read the file

---
 .../Polygon_mesh_processing/soup_autorefinement.cpp         | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
index a76e1254f6e2..b1b58ae10e3f 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/soup_autorefinement.cpp
@@ -22,7 +22,11 @@ int main(int argc, char** argv)
 
   std::vector<Point> input_points;
   std::vector<boost::container::small_vector<std::size_t, 3>> input_triangles;
-  CGAL::IO::read_polygon_soup(filename, input_points, input_triangles);
+  if (!CGAL::IO::read_polygon_soup(filename, input_points, input_triangles))
+  {
+    std::cerr << "Cannot read " << filename << "\n";
+    return 1;
+  }
   PMP::repair_polygon_soup(input_points, input_triangles);
   PMP::triangulate_polygons(input_points, input_triangles);
 

From f3e547f73838da56f1044fa2d08107561b97454e Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 11 Jan 2024 09:45:05 +0000
Subject: [PATCH 1276/1398] Parabola_segment_2: turn it into a struct

---
 Apollonius_graph_2/include/CGAL/Parabola_segment_2.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Apollonius_graph_2/include/CGAL/Parabola_segment_2.h b/Apollonius_graph_2/include/CGAL/Parabola_segment_2.h
index 7c03ff5d5e51..20883169ba7a 100644
--- a/Apollonius_graph_2/include/CGAL/Parabola_segment_2.h
+++ b/Apollonius_graph_2/include/CGAL/Parabola_segment_2.h
@@ -27,7 +27,7 @@ namespace Qt {
 }
 
 template < class Gt >
-class Parabola_segment_2 : public Parabola_2< Gt >
+struct Parabola_segment_2 : public Parabola_2< Gt >
 {
   typedef CGAL::Parabola_2<Gt>            Base;
   typedef typename Base::Site_2           Site_2;
@@ -39,10 +39,10 @@ class Parabola_segment_2 : public Parabola_2< Gt >
   using Base::t;
   using Base::f;
 
-protected:
+
   Point_2 p1, p2;
 
-public:
+
   Parabola_segment_2() : Parabola_2< Gt >() {}
 
   template<class ApolloniusSite>

From 958eabea9ff7281cc4bd654dafd6c2c87f99bb1b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Mael=20Rouxel-Labb=C3=A9?=
 <mael.rouxel.labbe@geometryfactory.com>
Date: Thu, 11 Jan 2024 12:40:39 +0100
Subject: [PATCH 1277/1398] Add an advanced example to draw cropped duals of
 Segment Delaunay Graphs

---
 .../Segment_Delaunay_graph_2/CMakeLists.txt   |  24 +-
 .../sdg-advanced-draw.cpp                     | 512 ++++++++++++++++++
 2 files changed, 527 insertions(+), 9 deletions(-)
 create mode 100644 Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-advanced-draw.cpp

diff --git a/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/CMakeLists.txt b/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/CMakeLists.txt
index 88944af92745..7d280fb1feba 100644
--- a/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/CMakeLists.txt
+++ b/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/CMakeLists.txt
@@ -4,13 +4,19 @@
 cmake_minimum_required(VERSION 3.1...3.23)
 project(Segment_Delaunay_graph_2_Examples)
 
-find_package(CGAL REQUIRED)
+find_package(CGAL REQUIRED OPTIONAL_COMPONENTS Core)
 
-# create a target per cppfile
-file(
-  GLOB cppfiles
-  RELATIVE ${CMAKE_CURRENT_SOURCE_DIR}
-  ${CMAKE_CURRENT_SOURCE_DIR}/*.cpp)
-foreach(cppfile ${cppfiles})
-  create_single_source_cgal_program("${cppfile}")
-endforeach()
+create_single_source_cgal_program("sdg-count-sites.cpp")
+create_single_source_cgal_program("sdg-fast-sp.cpp")
+create_single_source_cgal_program("sdg-fast-sp-polygon.cpp")
+create_single_source_cgal_program("sdg-filtered-traits.cpp")
+create_single_source_cgal_program("sdg-info-set.cpp")
+create_single_source_cgal_program("sdg-red-blue-info.cpp")
+create_single_source_cgal_program("sdg-voronoi-edges.cpp")
+
+find_package(LEDA QUIET)
+if(CGAL_Core_FOUND OR LEDA_FOUND)
+  create_single_source_cgal_program("sdg-advanced-draw.cpp")
+else()
+  message("NOTICE: The program sdg-advanced-draw requires CGAL_Core or LEDA, and will not be compiled.")
+endif()
diff --git a/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-advanced-draw.cpp b/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-advanced-draw.cpp
new file mode 100644
index 000000000000..95b6b16c84a8
--- /dev/null
+++ b/Segment_Delaunay_graph_2/examples/Segment_Delaunay_graph_2/sdg-advanced-draw.cpp
@@ -0,0 +1,512 @@
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h>
+
+#include <CGAL/Segment_Delaunay_graph_2.h>
+#include <CGAL/Segment_Delaunay_graph_filtered_traits_2.h>
+#include <CGAL/Segment_Delaunay_graph_traits_2.h>
+
+#include <CGAL/Bbox_2.h>
+#include <CGAL/number_utils.h>
+
+#include <fstream>
+#include <iostream>
+#include <list>
+#include <set>
+#include <vector>
+
+#define SDG_DRAW_DEBUG // debug log
+#define SDG_DRAW_DUMP_FILES // print input / ouput
+// #define SINGLE_INPUT_FILE // if not defined, each segment of the input has its own file
+
+#ifdef SDG_DRAW_DUMP_FILES_PP // also print parabolas
+#define SDG_DRAW_DUMP_FILES
+#endif
+
+typedef CGAL::Simple_cartesian<double>                                            CK;
+typedef CK::Point_2                                                               Point_2;
+typedef CK::Segment_2                                                             Segment_2;
+typedef CGAL::Field_with_sqrt_tag                                                 CM;
+typedef CGAL::Exact_predicates_exact_constructions_kernel_with_sqrt               EK;
+typedef CGAL::Field_with_sqrt_tag                                                 EM;
+typedef CGAL::Simple_cartesian<CGAL::Interval_nt<false> >                         FK;
+typedef CGAL::Field_with_sqrt_tag                                                 FM;
+typedef CGAL::Segment_Delaunay_graph_filtered_traits_2<CK, CM, EK, EM, FK, FM>    Gt;
+typedef CGAL::Segment_Delaunay_graph_2<Gt>                                        SDG;
+
+///////////////////////////////// CODE ABOUT EXACT DUALS ///////////////////////////////////////////
+
+template < typename ExactSite, typename ExactKernel,
+           typename SDGSite,   typename InputKernel >
+ExactSite convert_site_to_exact(const SDGSite &site,
+                                const InputKernel & /*k*/,
+                                const ExactKernel & /*ek*/)
+{
+  using To_exact = CGAL::Cartesian_converter<InputKernel, ExactKernel>;
+  To_exact to_exact;
+
+  // Note: in theory, a site can be constructed from more than just one or two points
+  // (e.g. 4 points for the segment defined by the intersection of two segments). Thus, it
+  // would be better to convert the input points at the very beginning and just maintain
+  // a type of map between the base and exact sites.
+  ExactSite es;
+  if(site.is_point())
+    es = ExactSite::construct_site_2(to_exact(site.point()));
+  else
+    es = ExactSite::construct_site_2(to_exact(site.segment().source()), to_exact(site.segment().target()));
+
+  return es;
+}
+
+// Dual (Voronoi site) of an SDG face
+template < typename FiniteFacesIterator, typename InputKernel, typename ExactKernel >
+typename ExactKernel::Point_2 exact_primal(const FiniteFacesIterator sdg_f,
+                                           const InputKernel& k,
+                                           const ExactKernel& ek)
+{
+  using Exact_SDG_traits = CGAL::Segment_Delaunay_graph_traits_2<ExactKernel>;
+  using Exact_site_2 = typename Exact_SDG_traits::Site_2;
+
+  static Exact_SDG_traits e_sdg_gt;
+  const Exact_site_2 es0 = convert_site_to_exact<Exact_site_2>(sdg_f->vertex(0)->site(), k, ek);
+  const Exact_site_2 es1 = convert_site_to_exact<Exact_site_2>(sdg_f->vertex(1)->site(), k, ek);
+  const Exact_site_2 es2 = convert_site_to_exact<Exact_site_2>(sdg_f->vertex(2)->site(), k, ek);
+
+  return e_sdg_gt.construct_svd_vertex_2_object()(es0, es1, es2);
+}
+
+// Dual (Voronoi edge) of an SDG edge
+// this function is identical 'SDG::primal()', but with a conversion to exact sites
+template < typename Edge, typename InputKernel, typename ExactKernel >
+CGAL::Object exact_primal(const Edge& e,
+                          const SDG& sdg,
+                          const InputKernel& k,
+                          const ExactKernel& ek)
+{
+  using Exact_SDG_traits = CGAL::Segment_Delaunay_graph_traits_2<ExactKernel>;
+  using Exact_site_2 = typename Exact_SDG_traits::Site_2;
+
+  using DT = CGAL::Field_with_sqrt_tag;
+  using Construct_sdg_bisector_2 = CGAL::SegmentDelaunayGraph_2::Construct_sdg_bisector_2<Exact_SDG_traits, DT>;
+  using Construct_sdg_bisector_ray_2 = CGAL::SegmentDelaunayGraph_2::Construct_sdg_bisector_ray_2<Exact_SDG_traits, DT>;
+  using Construct_sdg_bisector_segment_2 = CGAL::SegmentDelaunayGraph_2::Construct_sdg_bisector_segment_2<Exact_SDG_traits, DT>;
+
+  CGAL_precondition(!sdg.is_infinite(e));
+
+  if(sdg.dimension() == 1)
+  {
+    Exact_site_2 p = convert_site_to_exact<Exact_site_2>((e.first)->vertex(sdg.cw(e.second))->site(), k, ek);
+    Exact_site_2 q = convert_site_to_exact<Exact_site_2>((e.first)->vertex(sdg.ccw(e.second))->site(), k, ek);
+
+    return make_object(Construct_sdg_bisector_2()(p, q));
+  }
+
+  // dimension == 2
+  // neither of the two adjacent faces is infinite
+  if((!sdg.is_infinite(e.first)) && (!sdg.is_infinite(e.first->neighbor(e.second))))
+  {
+    Exact_site_2 p = convert_site_to_exact<Exact_site_2>((e.first)->vertex(sdg.ccw(e.second))->site(), k, ek);
+    Exact_site_2 q = convert_site_to_exact<Exact_site_2>((e.first)->vertex(sdg.cw(e.second))->site(), k, ek);
+    Exact_site_2 r = convert_site_to_exact<Exact_site_2>((e.first)->vertex(e.second)->site(), k, ek);
+    Exact_site_2 s = convert_site_to_exact<Exact_site_2>(sdg.tds().mirror_vertex(e.first, e.second)->site(), k, ek);
+
+    return Construct_sdg_bisector_segment_2()(p, q, r, s);
+  }
+
+  // both of the adjacent faces are infinite
+  if(sdg.is_infinite(e.first) && sdg.is_infinite(e.first->neighbor(e.second)))
+  {
+    Exact_site_2 p = convert_site_to_exact<Exact_site_2>((e.first)->vertex(sdg.cw(e.second))->site(), k, ek);
+    Exact_site_2 q = convert_site_to_exact<Exact_site_2>((e.first)->vertex(sdg.ccw(e.second))->site(), k, ek);
+
+    return make_object(Construct_sdg_bisector_2()(p, q));
+  }
+
+  // only one of the adjacent faces is infinite
+  CGAL_assertion(sdg.is_infinite(e.first) || sdg.is_infinite(e.first->neighbor(e.second)));
+  CGAL_assertion(!(sdg.is_infinite(e.first) && sdg.is_infinite(e.first->neighbor(e.second))));
+  CGAL_assertion(sdg.is_infinite(e.first->vertex(e.second)) || sdg.is_infinite(sdg.tds().mirror_vertex(e.first, e.second)));
+
+  Edge ee = e;
+  if(sdg.is_infinite(e.first->vertex(e.second)))
+  {
+    ee = Edge(e.first->neighbor(e.second),
+              e.first->neighbor(e.second)->index(sdg.tds().mirror_vertex(e.first, e.second)));
+  }
+
+  Exact_site_2 p = convert_site_to_exact<Exact_site_2>(ee.first->vertex(sdg.ccw(ee.second))->site(), k, ek);
+  Exact_site_2 q = convert_site_to_exact<Exact_site_2>(ee.first->vertex(sdg.cw(ee.second))->site(), k, ek);
+  Exact_site_2 r = convert_site_to_exact<Exact_site_2>(ee.first->vertex(ee.second)->site(), k, ek);
+
+  return make_object(Construct_sdg_bisector_ray_2()(p, q, r));
+}
+
+///////////////////////////////// CODE TO DRAW A CROPPED DIAGRAM ///////////////////////////////////
+
+// Split a Voronoi edge that is a parabola (one site is a point, one site is a segment) into small segments
+template <typename OutputKernel, typename SegmentContainer>
+void segment_parabola(const CGAL::Parabola_segment_2<OutputKernel>& p,
+                      const CGAL::Bbox_2& scaled_bbox,
+                      SegmentContainer& segment_list)
+{
+  using FT = typename OutputKernel::FT;
+  using Point_2 = typename OutputKernel::Point_2;
+
+  const Point_2& o = p.origin();
+  const Point_2& c = p.center();
+
+  // @todo could be cached
+  const Point_2 mm(scaled_bbox.xmin(), scaled_bbox.ymin());
+  const Point_2 mM(scaled_bbox.xmin(), scaled_bbox.ymax());
+  const Point_2 Mm(scaled_bbox.xmax(), scaled_bbox.ymin());
+  const Point_2 MM(scaled_bbox.xmax(), scaled_bbox.ymax());
+
+  FT s = CGAL::squared_distance(mm, c);
+  s = (std::max)(s, CGAL::squared_distance(mM, c));
+  s = (std::max)(s, CGAL::squared_distance(Mm, c));
+  s = (std::max)(s, CGAL::squared_distance(MM, c));
+
+  s = CGAL::sqrt(s) - CGAL::sqrt(CGAL::squared_distance(c, o));
+
+  const double lx = scaled_bbox.xmax() - scaled_bbox.xmin();
+  const double ly = scaled_bbox.ymax() - scaled_bbox.ymin();
+
+  const double max_length = 0.001 * (std::min)(lx, ly); // max length in the discretization of a parabola
+
+#ifdef SDG_DRAW_DEBUG
+  std::cout << "origin & center: " << o << " [[]] " << c << std::endl;
+  std::cout << "max length " << max_length << std::endl;
+#endif
+
+  std::vector<Point_2> points;
+  p.generate_points(points, max_length, -s, s);
+
+#ifdef SDG_DRAW_DEBUG
+  std::cout << "Discretize parabola into " << points.size() << " points" << std::endl;
+  for(const auto& pt : points)
+    std::cout << CGAL::to_double(pt.x()) << " " << CGAL::to_double(pt.y()) << " 0" << std::endl;
+  std::cout << "end of parabola" << std::endl;
+#endif
+
+  if(points.size() < 2)
+    return;
+
+  for(std::size_t i=0, ps=points.size()-1; i<ps; ++i)
+    segment_list.emplace_back(points[i], points[i+1]);
+
+#ifdef SDG_DRAW_DUMP_FILES_PP
+  std::cout << "filled segment list. Dumping parabola..." << std::endl;
+  static int parabola_id = 0;
+  std::stringstream oss;
+  oss << "parabola_" << parabola_id++ << ".cgal" << std::ends;
+  std::ofstream out(oss.str().c_str());
+  out.precision(17);
+
+  for(std::size_t i=1, ps=(points.size()-1); i<ps; ++i)
+  {
+    out << "2 " << CGAL::to_double(points[i].x()) << " ";
+    out << CGAL::to_double(points[i].y()) << " 0 ";
+    out << CGAL::to_double(points[i+1].x()) << " ";
+    out << CGAL::to_double(points[i+1].y()) << " 0\n";
+  }
+#endif
+}
+
+template< typename OutputKernel, typename LineContainer, typename RayContainer, typename SegmentContainer>
+void fill_Voronoi_structure(const SDG& sdg,
+                            const CGAL::Bbox_2& scaled_bbox,
+                            LineContainer& line_list,
+                            RayContainer& ray_list,
+                            SegmentContainer& segment_list)
+{
+  using Line_2 = typename OutputKernel::Line_2;
+  using Ray_2 = typename OutputKernel::Ray_2;
+  using Segment_2 = typename OutputKernel::Segment_2;
+  using SDG_traits = CGAL::Segment_Delaunay_graph_traits_2<OutputKernel>;
+
+  CK k;
+  OutputKernel ek;
+
+  Line_2 l;
+  Ray_2 r;
+  Segment_2 s;
+  CGAL::Parabola_segment_2<SDG_traits> p;
+
+  int nl = 0, ns = 0, nr = 0, np = 0;
+
+  typename SDG::Finite_edges_iterator eit = sdg.finite_edges_begin(),
+                                      eend = sdg.finite_edges_end();
+  for (; eit != eend; ++eit)
+  {
+    CGAL::Object o = exact_primal(*eit, sdg, k, ek);
+
+    if(CGAL::assign(l, o)) { line_list.push_back(l); ++nl; }
+    if(CGAL::assign(s, o)) { segment_list.push_back(s); ++ns; }
+    if(CGAL::assign(r, o)) { ray_list.push_back(r); ++nr; }
+    if(CGAL::assign(p, o)) { segment_parabola(p, scaled_bbox, segment_list); ++np; }
+  }
+
+#ifdef SDG_DRAW_DEBUG
+  std::cout << nl << " lines" << std::endl;
+  std::cout << ns << " segments" << std::endl;
+  std::cout << nr << " rays" << std::endl;
+  std::cout << np << " parabolas" << std::endl;
+#endif
+}
+
+template <typename OutputKernel, typename T, typename OutputIterator>
+struct Box_clipper
+{
+  bool operator()(const T& obj,
+                  const typename OutputKernel::Iso_rectangle_2& bbox,
+                  OutputIterator oit) const
+  {
+    CGAL::Object obj_cgal = CGAL::intersection(obj, bbox);
+
+    typename OutputKernel::Segment_2 s;
+    bool ret = CGAL::assign(s, obj_cgal);
+    if(ret)
+      oit++ = s;
+
+    return ret;
+  }
+};
+
+template <typename OutputKernel, typename OutputIterator>
+struct Box_clipper<OutputKernel, typename OutputKernel::Segment_2, OutputIterator>
+{
+  bool operator()(const typename OutputKernel::Segment_2& is,
+                  const typename OutputKernel::Iso_rectangle_2& bbox,
+                  OutputIterator oit) const
+  {
+    if(bbox.has_on_unbounded_side(is.source()) && bbox.has_on_unbounded_side(is.target()))
+      return false;
+
+    if(!bbox.has_on_unbounded_side(is.source()) && !bbox.has_on_unbounded_side(is.target()))
+    {
+      oit++ = is;
+      return true;
+    }
+
+    CGAL::Object obj_cgal = CGAL::intersection(is, bbox);
+
+    typename OutputKernel::Segment_2 s;
+    bool ret = CGAL::assign(s, obj_cgal);
+    if(ret)
+      oit++ = s;
+
+    return ret;
+  }
+};
+
+template <typename OutputKernel,
+          typename LineContainer, typename RayContainer, typename SegmentContainer,
+          typename OutputIterator>
+void draw_dual(const LineContainer& lines,
+               const RayContainer& rays,
+               const SegmentContainer& segments,
+               const typename OutputKernel::Iso_rectangle_2& bbox,
+               OutputIterator oit)
+{
+  using Line_2 = typename OutputKernel::Line_2;
+  using Ray_2 = typename OutputKernel::Ray_2;
+  using Segment_2 = typename OutputKernel::Segment_2;
+
+  typedef Box_clipper<OutputKernel, Line_2, OutputIterator> Line_clipper;
+  typedef Box_clipper<OutputKernel, Ray_2, OutputIterator> Ray_clipper;
+  typedef Box_clipper<OutputKernel, Segment_2, OutputIterator> Segment_clipper;
+
+  Line_clipper lc;
+  Ray_clipper rc;
+  Segment_clipper sc;
+
+  for(const Line_2& line : lines)
+    lc(line, bbox, oit);
+  for(const Ray_2& ray : rays)
+    rc(ray, bbox, oit);
+  for(const Segment_2& segment : segments)
+    sc(segment, bbox, oit);
+}
+
+template< typename OutputKernel, typename OutputIterator >
+OutputIterator draw_SDG(const SDG& sdg,
+                        const typename OutputKernel::Iso_rectangle_2& bbox,
+                        const CGAL::Bbox_2& scaled_bbox,
+                        OutputIterator oit)
+{
+  using Line_2 = typename OutputKernel::Line_2;
+  using Ray_2 = typename OutputKernel::Ray_2;
+  using Segment_2 = typename OutputKernel::Segment_2;
+
+  std::list<Line_2> line_list;
+  std::list<Ray_2> ray_list;
+  std::list<Segment_2> segment_list;
+
+  fill_Voronoi_structure<OutputKernel>(sdg, scaled_bbox, line_list, ray_list, segment_list);
+  draw_dual<OutputKernel>(line_list, ray_list, segment_list, bbox, oit);
+
+  return oit;
+}
+
+int main(int argc, char** argv)
+{
+  std::cout.precision(17);
+  std::cout << std::fixed;
+
+  if(argc < 2)
+    std::cout << "Usage: " << argv[0] << " input.cin" << std::endl;
+
+#ifdef SDG_DRAW_DUMP_FILES
+  // dump the input
+  std::ifstream input((argc > 1) ? argv[1] : "./data/sites.cin");
+  assert(input);
+
+  std::string str;
+  int i = 0;
+
+# ifdef SINGLE_INPUT_FILE
+  std::ofstream in_out("input.cgal");
+  in_out.precision(17);
+# endif
+
+  // read line by line, and distinguish between point and segment
+  std::string line;
+  while(std::getline(input, line))
+  {
+# ifndef SINGLE_INPUT_FILE
+    std::stringstream oss;
+    oss << "input_" << i++ << ".cgal" << std::ends;
+    std::ofstream in_out(oss.str().c_str());
+    in_out.precision(17);
+# endif
+
+    std::stringstream ss(line);
+    ss >> str;
+    if(str == "s")
+    {
+      double x0, y0, x1, y1;
+      ss >> x0 >> y0 >> x1 >> y1;
+
+      in_out << "2 " << x0 << " " << y0 << " 0 ";
+      in_out << x1 << " " << y1 << " 0\n";
+    }
+    else if(str == "p")
+    {
+      double x, y;
+      ss >> x >> y;
+
+      in_out << "2 " << x << " " << y << " 0\n";
+      in_out << x << " " << y << " 0\n"; // abusive 0-length polyline
+    }
+    else
+    {
+      std::cerr << "Error: Unknown input: " << str << std::endl;
+      return EXIT_FAILURE;
+    }
+
+# ifndef SINGLE_INPUT_FILE
+    in_out.close();
+# endif
+  }
+# ifdef SINGLE_INPUT_FILE
+    in_out.close();
+# endif
+#endif
+
+  std::ifstream ifs((argc > 1) ? argv[1] : "./data/sites.cin");
+  assert(ifs);
+
+  // polygon points
+  std::set<Gt::Point_2> all_points;
+
+  // segments of the polygon as a pair of point indices
+  std::vector<Gt::Point_2> points;
+  std::vector<Gt::Segment_2> segments;
+  SDG::Site_2 site;
+
+  // read segment input, format:
+  // s [x0 y0 x1 y1]
+  // p [x y]
+
+  while (ifs >> site)
+  {
+    if(site.is_segment())
+    {
+      all_points.insert(site.source_of_supporting_site());
+      all_points.insert(site.target_of_supporting_site());
+      segments.push_back(site.segment());
+    }
+    else
+    {
+      all_points.insert(site.point());
+      points.push_back(site.point());
+    }
+  }
+
+  if(points.empty() && segments.empty())
+  {
+    std::cerr << "Nothing in input..." << std::endl;
+    return EXIT_SUCCESS;
+  }
+
+  // insert the sites all at once using spatial sorting to speed the insertion
+  SDG sdg;
+  sdg.insert_points(points.begin(), points.end());
+  sdg.insert_segments(segments.begin(), segments.end());
+  assert(sdg.is_valid(true, 1)); // validate the segment Delaunay graph
+
+  typedef EK OK; // output kernel
+  std::list<OK::Segment_2> svd_edges;
+
+  // Get the bbox of the input points, and grow it a bit
+  const CGAL::Bbox_2 bbox = bbox_2(all_points.begin(), all_points.end());
+  const double xmin = bbox.xmin(), xmax = bbox.xmax();
+  const double ymin = bbox.ymin(), ymax = bbox.ymax();
+  const double xmid = 0.5 * (xmin + xmax), ymid = 0.5 * (ymin + ymax);
+  const double scaling_factor = 3.; // '0.5' gives the identity
+  const double lx = scaling_factor * (xmax - xmin),
+               ly = scaling_factor * (ymax - ymin);
+  const CGAL::Bbox_2 scaled_bbox(xmid - lx, ymid - ly, xmid + lx, ymid + ly);
+  const OK::Iso_rectangle_2 bounding_iso_rec(scaled_bbox);
+
+#ifdef SDG_DRAW_DEBUG
+  std::cout << "bbox: " << bbox.xmin() << " " << bbox.ymin() << std::endl;
+  std::cout << "bbox: " << bbox.xmax() << " " << bbox.ymax() << std::endl;
+  std::cout << "lx/y: " << lx << " " << ly << std::endl;
+  std::cout << "Scaled bbox: " << scaled_bbox.xmin() << " " << scaled_bbox.ymin() << std::endl;
+  std::cout << "Scaled bbox: " << scaled_bbox.xmax() << " " << scaled_bbox.ymax() << std::endl;
+#endif
+
+  draw_SDG<OK>(sdg, bounding_iso_rec, scaled_bbox, std::back_inserter(svd_edges));
+
+#ifdef SDG_DRAW_DEBUG
+  std::cout << "Edges of the diagram (exact form):" << std::endl;
+  for(const OK::Segment_2& edge : svd_edges)
+    std::cout << edge << "\n";
+
+  std::cout << "Now in the double, approximate format..." << std::endl;
+  for(const OK::Segment_2& edge : svd_edges)
+  {
+    std::cout << CGAL::to_double(edge.source().x()) << " ";
+    std::cout << CGAL::to_double(edge.source().y()) << " ";
+    std::cout << CGAL::to_double(edge.target().x()) << " ";
+    std::cout << CGAL::to_double(edge.target().y()) << "\n";
+  }
+#endif
+
+#ifdef SDG_DRAW_DUMP_FILES
+  // This file can be visualized with the CGAL 3D Polyhedron Demo
+  std::ofstream out("dual.cgal");
+  out.precision(17);
+  for(const OK::Segment_2& edge : svd_edges)
+  {
+    out << "2 " << CGAL::to_double(edge.source().x()) << " ";
+    out << CGAL::to_double(edge.source().y()) << " 0 ";
+    out << CGAL::to_double(edge.target().x()) << " ";
+    out << CGAL::to_double(edge.target().y()) << " 0\n";
+  }
+#endif
+
+  std::cout << "Done" << std::endl;
+
+  return EXIT_SUCCESS;
+}

From 2ccb65f6eab056004daaae93b09633f7e730a183 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 11 Jan 2024 15:17:26 +0100
Subject: [PATCH 1278/1398] Revert "plugins should not depend on
 `Polyhedron_3`"

This reverts commit 1f26c03e3bb23c0906cd9de5273a51310ff5b835.
---
 Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp | 2 +-
 Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake      | 3 +++
 SMDS_3/examples/SMDS_3/c3t3_example.cpp                      | 2 +-
 3 files changed, 5 insertions(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
index c83911ea93f1..4cadd392fd38 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Mesh_3/C3t3_io_plugin.cpp
@@ -138,7 +138,7 @@ Polyhedron_demo_c3t3_binary_io_plugin::load(
       item->set_valid(false);
 
       if(CGAL::SMDS_3::build_triangulation_from_file(in, item->c3t3().triangulation(),
-         /*verbose = */true, /*replace_subdomain_0 = */false, /*allow_non_manifold = */true))
+         /*verbose = */false, /*replace_subdomain_0 = */false, /*allow_non_manifold = */true))
       {
         update_c3t3(item->c3t3());
 
diff --git a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
index c9ffbd9a93e6..731986536075 100644
--- a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
+++ b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
@@ -61,6 +61,9 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
     endif()
     # Link with CGAL
     target_link_libraries( ${plugin_name} PUBLIC CGAL::CGAL )
+    if(TARGET Polyhedron_3)
+      add_dependencies( ${plugin_name} Polyhedron_3 )
+    endif()
     if(NOT TARGET CGALlab_all_plugins)
       add_custom_target(CGALlab_all_plugins)
     endif()
diff --git a/SMDS_3/examples/SMDS_3/c3t3_example.cpp b/SMDS_3/examples/SMDS_3/c3t3_example.cpp
index f6d7043c2d03..5ebb5cc3e358 100644
--- a/SMDS_3/examples/SMDS_3/c3t3_example.cpp
+++ b/SMDS_3/examples/SMDS_3/c3t3_example.cpp
@@ -42,7 +42,7 @@ int main(int argc, char* argv[])
   Triangulation tr;
 
   std::ifstream is(filename, std::ios_base::in);
-  if(!CGAL::IO::read_MEDIT(is, tr, CGAL::parameters::verbose(true)))
+  if(!CGAL::IO::read_MEDIT(is, tr))
   {
     std::cerr << "Failed to read" << std::endl;
     return EXIT_FAILURE;

From 1491b754f7c894f0bddc996df8ace27078748832 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 11 Jan 2024 15:28:40 +0100
Subject: [PATCH 1279/1398] If CGAL_TEST_SUITE, then plugins do not depend on
 Polyhedron_3

---
 Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
index 731986536075..d31b0aa911d3 100644
--- a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
+++ b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
@@ -61,7 +61,7 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
     endif()
     # Link with CGAL
     target_link_libraries( ${plugin_name} PUBLIC CGAL::CGAL )
-    if(TARGET Polyhedron_3)
+    if(NOT CGAL_TEST_SUITE AND TARGET Polyhedron_3)
       add_dependencies( ${plugin_name} Polyhedron_3 )
     endif()
     if(NOT TARGET CGALlab_all_plugins)

From 961f00d52b0d65e14d9a220d1ee397047a994525 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 12 Jan 2024 07:04:01 +0000
Subject: [PATCH 1280/1398] Kernel_d: Use integral_division()

---
 .../CGAL/Kernel_d/Linear_algebraHd_impl.h        | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h b/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h
index df22d36cf9a0..9398b3964e92 100644
--- a/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h
+++ b/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h
@@ -95,13 +95,13 @@ linear_solver(const Matrix& A, const Vector& b,
 
       for(i = k + 1; i < rows; i++)
         for (j = 0; j <  rows; j++)  //and all columns of |L|
-          L(i,j) = (L(i,j)*C(k,k) - C(i,k)*L(k,j))/denom;
+          L(i,j) = integral_division((L(i,j)*C(k,k) - C(i,k)*L(k,j)), denom);
 
       for(i = k + 1; i < rows; i++) {
         /* the following iteration uses and changes |C(i,k)| */
         RT temp = C(i,k);
         for (j = k; j <= cols; j++)
-          C(i,j) = (C(i,j)*C(k,k) - temp*C(k,j))/denom;
+          C(i,j) = integral_division((C(i,j)*C(k,k) - temp*C(k,j)), denom);
       }
       denom = C(k,k);
       #ifdef CGAL_LA_SELFTEST
@@ -140,7 +140,7 @@ linear_solver(const Matrix& A, const Vector& b,
       for (j = i + 1; j < rank; j++) {
         h -= C(i,j)*x[var[j]];
       }
-      x[var[i]]= h / C(i,i);
+      x[var[i]]= integral_division(h, C(i,i));
     }
     #ifdef CGAL_LA_SELFTEST
       CGAL_assertion( (M*x).is_zero() );
@@ -156,7 +156,7 @@ linear_solver(const Matrix& A, const Vector& b,
           RT_ h = - C(i,rank + l)*D;
           for ( j= i + 1; j<rank; j++)
             h -= C(i,j)*spanning_vectors(var[j],l);
-          spanning_vectors(var[i],l)= h / C(i,i);
+          spanning_vectors(var[i],l)= integral_division(h, C(i,i));
         }
     #ifdef CGAL_LA_SELFTEST
           /* we check whether the $l$ - th spanning vector is a solution
@@ -908,13 +908,13 @@ homogeneous_linear_solver(const Matrix &A,
 
       for(i = k + 1; i < rows; i++)
         for (j = 0; j <  rows; j++)  //and all columns of |L|
-          L(i,j) = (L(i,j)*C(k,k) - C(i,k)*L(k,j))/denom;
+          L(i,j) = integral_division(L(i,j)*C(k,k) - C(i,k)*L(k,j),denom);
 
       for(i = k + 1; i < rows; i++) {
         /* the following iteration uses and changes |C(i,k)| */
         RT temp = C(i,k);
         for (j = k; j <= cols; j++)
-          C(i,j) = (C(i,j)*C(k,k) - temp*C(k,j))/denom;
+          C(i,j) = integral_division(C(i,j)*C(k,k) - temp*C(k,j), denom);
       }
       denom = C(k,k);
       #ifdef CGAL_LA_SELFTEST
@@ -949,7 +949,7 @@ homogeneous_linear_solver(const Matrix &A,
     for (j = i + 1; j < rank; j++) {
       h -= C(i,j)*x[var[j]];
     }
-    x[var[i]]= h / C(i,i);
+    x[var[i]]= integral_division(h, C(i,i));
   }
   #ifdef CGAL_LA_SELFTEST
     CGAL_assertion( (M*x).is_zero() );
@@ -965,7 +965,7 @@ homogeneous_linear_solver(const Matrix &A,
         RT_ h = - C(i,rank + l)*D;
         for ( j= i + 1; j<rank; j++)
           h -= C(i,j)*spanning_vectors(var[j],l);
-        spanning_vectors(var[i],l)= h / C(i,i);
+        spanning_vectors(var[i],l)= integral_division(h , C(i,i));
       }
   #ifdef CGAL_LA_SELFTEST
         /* we check whether the $l$ - th spanning vector is a solution

From 310ef4c2196549fc3328e28bb6293757bde204e4 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 12 Jan 2024 08:03:00 +0000
Subject: [PATCH 1281/1398] more integral_division()

---
 .../CGAL/Kernel_d/Linear_algebraHd_impl.h     | 22 +++++++++----------
 1 file changed, 11 insertions(+), 11 deletions(-)

diff --git a/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h b/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h
index 9398b3964e92..286211363bba 100644
--- a/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h
+++ b/Kernel_d/include/CGAL/Kernel_d/Linear_algebraHd_impl.h
@@ -241,13 +241,13 @@ determinant(const Matrix& A)
 
       for(i = k + 1; i < rows; i++)
         for (j = 0; j <  rows; j++)  //and all columns of |L|
-          L(i,j) = (L(i,j)*C(k,k) - C(i,k)*L(k,j))/denom;
+          L(i,j) = integral_division(L(i,j)*C(k,k) - C(i,k)*L(k,j), denom);
 
       for(i = k + 1; i < rows; i++) {
         /* the following iteration uses and changes |C(i,k)| */
         RT temp = C(i,k);
         for (j = k; j <= cols; j++)
-          C(i,j) = (C(i,j)*C(k,k) - temp*C(k,j))/denom;
+          C(i,j) = integral_division(C(i,j)*C(k,k) - temp*C(k,j), denom);
       }
       denom = C(k,k);
       #ifdef CGAL_LA_SELFTEST
@@ -355,13 +355,13 @@ determinant(const Matrix& A,
 
       for(i = k + 1; i < rows; i++)
         for (j = 0; j <  rows; j++)  //and all columns of |L|
-          L(i,j) = (L(i,j)*C(k,k) - C(i,k)*L(k,j))/denom;
+          L(i,j) = integral_division(L(i,j)*C(k,k) - C(i,k)*L(k,j), denom);
 
       for(i = k + 1; i < rows; i++) {
         /* the following iteration uses and changes |C(i,k)| */
         RT temp = C(i,k);
         for (j = k; j <= cols; j++)
-          C(i,j) = (C(i,j)*C(k,k) - temp*C(k,j))/denom;
+          C(i,j) = integral_division(C(i,j)*C(k,k) - temp*C(k,j), denom);
       }
       denom = C(k,k);
       #ifdef CGAL_LA_SELFTEST
@@ -551,13 +551,13 @@ independent_columns(const Matrix& A,
 
       for(i = k + 1; i < rows; i++)
         for (j = 0; j <  rows; j++)  //and all columns of |L|
-          L(i,j) = (L(i,j)*C(k,k) - C(i,k)*L(k,j))/denom;
+          L(i,j) = integral_division(L(i,j)*C(k,k) - C(i,k)*L(k,j), denom);
 
       for(i = k + 1; i < rows; i++) {
         /* the following iteration uses and changes |C(i,k)| */
         RT temp = C(i,k);
         for (j = k; j <= cols; j++)
-          C(i,j) = (C(i,j)*C(k,k) - temp*C(k,j))/denom;
+          C(i,j) = integral_division(C(i,j)*C(k,k) - temp*C(k,j), denom);
       }
       denom = C(k,k);
       #ifdef CGAL_LA_SELFTEST
@@ -666,13 +666,13 @@ rank(const Matrix& A)
 
       for(i = k + 1; i < rows; i++)
         for (j = 0; j <  rows; j++)  //and all columns of |L|
-          L(i,j) = (L(i,j)*C(k,k) - C(i,k)*L(k,j))/denom;
+          L(i,j) = integral_division(L(i,j)*C(k,k) - C(i,k)*L(k,j), denom);
 
       for(i = k + 1; i < rows; i++) {
         /* the following iteration uses and changes |C(i,k)| */
         RT temp = C(i,k);
         for (j = k; j <= cols; j++)
-          C(i,j) = (C(i,j)*C(k,k) - temp*C(k,j))/denom;
+          C(i,j) = integral_division(C(i,j)*C(k,k) - temp*C(k,j), denom);
       }
       denom = C(k,k);
       #ifdef CGAL_LA_SELFTEST
@@ -774,13 +774,13 @@ inverse(const Matrix& A, Matrix& inverse,
 
       for(i = k + 1; i < rows; i++)
         for (j = 0; j <  rows; j++)  //and all columns of |L|
-          L(i,j) = (L(i,j)*C(k,k) - C(i,k)*L(k,j))/denom;
+          L(i,j) = integral_division(L(i,j)*C(k,k) - C(i,k)*L(k,j), denom);
 
       for(i = k + 1; i < rows; i++) {
         /* the following iteration uses and changes |C(i,k)| */
         RT temp = C(i,k);
         for (j = k; j <= cols; j++)
-          C(i,j) = (C(i,j)*C(k,k) - temp*C(k,j))/denom;
+          C(i,j) = integral_division(C(i,j)*C(k,k) - temp*C(k,j), denom);
       }
       denom = C(k,k);
       #ifdef CGAL_LA_SELFTEST
@@ -822,7 +822,7 @@ inverse(const Matrix& A, Matrix& inverse,
       h = L (j,i) * D;
       for (int l = j + 1; l<rows; l++)
         h -= C(j,l)*inverse(var[l],i);
-      inverse(var[j],i) = h / C(j,j);
+      inverse(var[j],i) = integral_division(h, C(j,j));
     }
   }
 

From 703eae4aeb5ade13b722c672d45636afcbedbdeb Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 12 Jan 2024 08:04:00 +0000
Subject: [PATCH 1282/1398] Use Exact_integer;     Do not divide a Vector in
 case of Homogeneous

---
 .../test/Kernel_d/Linear_algebra-test.cpp     | 16 ------------
 Kernel_d/test/Kernel_d/interface-test.cpp     | 22 +++++-----------
 Kernel_d/test/Kernel_d/intersection-test.cpp  | 26 +++----------------
 3 files changed, 10 insertions(+), 54 deletions(-)

diff --git a/Kernel_d/test/Kernel_d/Linear_algebra-test.cpp b/Kernel_d/test/Kernel_d/Linear_algebra-test.cpp
index cc12532746ec..d117d61a733f 100644
--- a/Kernel_d/test/Kernel_d/Linear_algebra-test.cpp
+++ b/Kernel_d/test/Kernel_d/Linear_algebra-test.cpp
@@ -10,23 +10,9 @@
 #include <CGAL/Exact_integer.h>
 #include <CGAL/Exact_rational.h>
 
-#if defined( CGAL_USE_LEDA) || defined ( CGAL_USE_GMP )
-
 typedef CGAL::Exact_integer RT;
 typedef CGAL::Exact_rational FT;
 
-#else
-
-// The following are too slow :
-// #include <CGAL/MP_Float.h>
-// #include <CGAL/Quotient.h>
-// typedef CGAL::MP_Float     RT;
-// typedef CGAL::Quotient<RT> FT;
-typedef double RT;
-typedef double FT;
-
-#endif
-
 int main(int argc, char* argv[])
 {
   CGAL_KD_SETDTHREAD(151);
@@ -72,8 +58,6 @@ int main(int argc, char* argv[])
       Vector v21(v13),v22(v13);
       v21 *= 13;
       CGAL_TEST(v21 == NT(13)*v22){}
-      v21 /= 13;
-      CGAL_TEST(v21 == v22){}
       if (IOTEST) CGAL_IO_TEST(v1,v2,CGAL::IO::ASCII);
     }
 
diff --git a/Kernel_d/test/Kernel_d/interface-test.cpp b/Kernel_d/test/Kernel_d/interface-test.cpp
index 1429ac6ac766..c6ab8053689e 100644
--- a/Kernel_d/test/Kernel_d/interface-test.cpp
+++ b/Kernel_d/test/Kernel_d/interface-test.cpp
@@ -5,22 +5,12 @@
 #include <CGAL/double.h>
 #include <CGAL/test_macros.h>
 
-#ifdef CGAL_USE_LEDA
-#include <CGAL/leda_integer.h>
-#include <CGAL/leda_rational.h>
-typedef leda_integer  RT_;
-typedef leda_rational FT_;
-#else
-#ifdef CGAL_USE_GMP
-#include <CGAL/Gmpz.h>
-#include <CGAL/Quotient.h>
-typedef CGAL::Gmpz RT_;
-typedef CGAL::Quotient<RT_> FT_;
-#else
-typedef double RT_;
-typedef double FT_;
-#endif
-#endif
+#include <CGAL/Exact_integer.h>
+#include <CGAL/Exact_rational.h>
+
+typedef CGAL::Exact_integer RT_;
+typedef CGAL::Exact_rational FT_;
+
 
 int main()
 { CGAL_KD_SETDTHREAD(2);
diff --git a/Kernel_d/test/Kernel_d/intersection-test.cpp b/Kernel_d/test/Kernel_d/intersection-test.cpp
index 3f22d193653e..1808c3daf955 100644
--- a/Kernel_d/test/Kernel_d/intersection-test.cpp
+++ b/Kernel_d/test/Kernel_d/intersection-test.cpp
@@ -5,28 +5,11 @@
 #include <CGAL/test_macros.h>
 #include <CGAL/use.h>
 
-#ifdef CGAL_USE_LEDA
+#include <CGAL/Exact_integer.h>
+#include <CGAL/Exact_rational.h>
 
-#include <CGAL/leda_integer.h>
-#include <CGAL/leda_real.h>
-typedef leda_integer RT;
-typedef leda_real    FT;
-
-#elif defined CGAL_USE_GMP
-
-#include <CGAL/Gmpz.h>
-#include <CGAL/Gmpq.h>
-typedef CGAL::Gmpz RT;
-typedef CGAL::Gmpq FT;
-
-#else
-
-#include <CGAL/MP_Float.h>
-#include <CGAL/Quotient.h>
-typedef CGAL::MP_Float     RT;
-typedef CGAL::Quotient<RT> FT;
-
-#endif
+typedef CGAL::Exact_integer RT;
+typedef CGAL::Exact_rational FT;
 
 int main()
 { CGAL::IO::set_pretty_mode ( std::cerr );
@@ -383,4 +366,3 @@ int main()
 }
   CGAL_TEST_END;
 }
-

From a484bfa35a3c5f9b82a0de8a852a66acaa32ec72 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 12 Jan 2024 09:12:09 +0100
Subject: [PATCH 1283/1398] add missing include directives

---
 Number_types/test/Number_types/to_interval_test.cpp | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Number_types/test/Number_types/to_interval_test.cpp b/Number_types/test/Number_types/to_interval_test.cpp
index 59752059bf61..69ae3969e5bc 100644
--- a/Number_types/test/Number_types/to_interval_test.cpp
+++ b/Number_types/test/Number_types/to_interval_test.cpp
@@ -3,6 +3,9 @@
 #include <iostream>
 
 // That one should not be needed in the long term:
+#include <CGAL/double.h>
+#include <CGAL/float.h>
+#include <CGAL/int.h>
 #include <CGAL/Interval_nt.h>
 
 #ifdef CGAL_USE_LEDA

From ecafb2e6494f2ab6897bd933d3aa5ed98e8732bc Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 15 Jan 2024 15:49:39 +0200
Subject: [PATCH 1284/1398] Move to tikz

---
 .../fig_src/curve_history.tex                 | 110 ++++----
 .../fig_src/header.tex                        |  45 +++-
 .../fig_src/simple_arr.tex                    |  63 +++--
 .../fig_src/unb_asymptote.tex                 |   2 +-
 .../fig_src/unb_dcel.tex                      | 255 +++++++++---------
 5 files changed, 252 insertions(+), 223 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/curve_history.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/curve_history.tex
index dc37efec3c99..8b8d55590a09 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/curve_history.tex
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/curve_history.tex
@@ -2,56 +2,62 @@
 \input{header}
 \pagestyle{empty}
 \begin{document}
-\psscalebox{1.8}{\arrset{1}%
-  \pspicture[](-1,-1)(8,7)
-  \arraxes(0,0)(-1,-1)(8,7)
-  \arrMainVertex(0,0){1}
-  \arrMainVertex(0,3){2}
-  \arrEmptyVertex(1,3){3}
-  \arrMainVertex(2,3){4}
-  \arrMainVertex(2,6){5}
-  \arrMainVertex(3,1){6}
-  \arrEmptyVertex(3,3){7}
-  \arrMainVertex(3,4){8}
-  \arrMainVertex(3,5){9}
-  \arrMainVertex(4,3){10}
-  \arrEmptyVertex(4,4){11}
-  \arrMainVertex(5,3){12}
-  \arrMainVertex(6,4){13}
-  \arrMainVertex(7,1){14}
-  \arrCrossVertex(4,6){x1}\uput[-45]{0}(4,6){$q_1$}
-  \arrCrossVertex(6,2){x2}\uput[45]{0}(6,2){$q_2$}
-  \arrCrossVertex(2,4){x3}\uput[45]{0}(2,4){$q_3$}
-  %
-  \ncline[linewidth=1pt,linecolor=blue]{1}{3}
-  \ncline[linewidth=1pt,linecolor=blue]{3}{5}
-  \ncline[linewidth=1pt,linecolor=blue]{5}{9}
-  \ncline[linewidth=1pt,linecolor=blue]{9}{11}
-  \ncline[linewidth=1pt,linecolor=blue]{11}{12}
-  \ncline[linewidth=1pt,linecolor=blue]{12}{14}
-  %
-  \ncline[linewidth=1pt,linecolor=blue]{6}{7}
-  \ncline[linewidth=1pt,linecolor=blue]{7}{8}\Bput[1pt]{\textcolor{blue}{$s_2$}}
-  \ncline[linewidth=1pt,linecolor=blue]{8}{9}
-  %
-  \ncline[linewidth=1pt,linecolor=blue]{8}{11}
-  \ncline[linewidth=1pt,linecolor=blue]{11}{13}
-  %
-  \ncline[linewidth=1pt,linecolor=blue]{4}{7}
-  \ncline[linewidth=1pt,linecolor=blue]{7}{10}
-  \ncline[linewidth=1pt,linecolor=blue]{10}{12}
-  %
-  \ncline[linestyle=dashed,dash=2pt 2pt,linewidth=1pt,linecolor=red]{2}{3}
-  \ncline[linestyle=dashed,dash=2pt 2pt,linewidth=1pt,linecolor=red]{3}{4}
-  \ncline[linestyle=dashed,dash=2pt 2pt,linewidth=1pt,linecolor=red]{4}{7}
-  \ncline[linestyle=dashed,dash=2pt 2pt,linewidth=1pt,linecolor=red]{7}{10}
-  %
-  \pnode(2,2){a}\uput{2pt}[-90]{0}(2,2){\textcolor{red}{$s_1$}}
-  \nccurve[linewidth=0.25pt,angleA=-90,angleB=90]{2}{a}
-  \nccurve[linewidth=0.25pt,angleA=-90,angleB=90]{10}{a}
-  \pnode(3.5,2){b}\uput{2pt}[-90]{0}(3.5,2){\textcolor{blue}{$s_3$}}
-  \nccurve[linewidth=0.25pt,angleA=-90,angleB=90]{4}{b}
-  \nccurve[linewidth=0.25pt,angleA=-90,angleB=90]{12}{b}
-  \endpspicture
-}
+  \begin{tikzpicture}[scale=1]
+    \myAxes{-1}{-1}{8}{7}
+    \coordinate (a) at (0,0);
+    \coordinate (b) at (0,3);
+    \coordinate (d) at (2,3);
+    \coordinate (j) at (4,3);
+    \coordinate (l) at (5,3);
+    %
+    \arrMainVertexZ(a){1}
+    \arrMainVertexZ(b){2}
+    \arrIntersectionVertexZ(1,3){3}
+    \arrMainVertexZ(d){4}
+    \arrMainVertexZ(2,6){5}
+    \arrMainVertexZ(3,1){6}
+    \arrIntersectionVertexZ(3,3){7}
+    \arrMainVertexZ(3,4){8}
+    \arrMainVertexZ(3,5){9}
+    \arrMainVertexZ(j){10}
+    \arrIntersectionVertexZ(4,4){11}
+    \arrMainVertexZ(l){12}
+    \arrMainVertexZ(6,4){13}
+    \arrMainVertexZ(7,1){14}
+    %
+    \draw[edge](1)--(3);
+    \draw[edge](3)--(5);
+    \draw[edge](5)--(9);
+    \draw[edge](9)--(11);
+    \draw[edge](11)--(12);
+    \draw[edge](12)--(14);
+    %
+    \draw[edge](6)--node[sloped,below,pos=0.4] {\textcolor{blue}{$s_2$}} (7);
+    \draw[edge](7)--(8);
+    \draw[edge](8)--(9);
+    %
+    \draw[edge](8)--(11);
+    \draw[edge](11)--(13);
+    %
+    \draw[edge](4)--(7);
+    \draw[edge](7)--(10);
+    \draw[edge](10)--(12);
+    %
+    \draw[edge=red,dashed](2)--(3);
+    \draw[edge=red,dashed](3)--(4);
+    \draw[edge=red,dashed](4)--(7);
+    \draw[edge=red,dashed](7)--(10);
+    %
+    \arrQueryLabeledVertexZ[-45](4,6){x1}{$q_1$}
+    \arrQueryLabeledVertexZ[45](6,2){x2}{$q_2$}
+    \arrQueryLabeledVertexZ[45](2,4){x3}{$q_3$}
+    %
+    \draw [decoration={calligraphic brace,
+        raise=2pt,
+        amplitude=10pt,aspect=0.5},decorate,line width=0.2pt] (j)--(b)
+    node[midway,below=10pt,red]{$s_1$};
+    \draw [decoration={calligraphic brace,raise=2pt,
+        amplitude=10pt,aspect=0.5},decorate,line width=0.2pt] (d)--(l)
+    node[midway,above=10pt,blue]{$s_3$};
+  \end{tikzpicture}
 \end{document}
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex
index 26980faab6f0..474e42804d3c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex
@@ -11,7 +11,7 @@
 % ======== Math ===============================================================
 \usepackage{amsmath,amscd,amsthm}
 \usepackage{empheq}
-
+\usepackage{bm}
 % ======== pdf, url and hyperlink =============================================
 % \usepackage{url}
 \usepackage{hyperref}
@@ -42,24 +42,33 @@
 % graphicx.
 \usepackage{tikz}
 \usepackage{pgfplots}
+% \pgfplotsset{compat=1.16}
+\pgfplotsset{compat=newest}
+\usepgfplotslibrary{fillbetween}
+\usepackage{tikz-3dplot}
 \usepackage{mathptmx}
-\usetikzlibrary{calc}
+\usetikzlibrary{arrows,arrows.meta}
+\usetikzlibrary{automata}
 \usetikzlibrary{backgrounds}
+\usetikzlibrary{calligraphy}
+\usetikzlibrary{calc}
+\usetikzlibrary{chains}
+\usetikzlibrary{cd}
 \usetikzlibrary{decorations.pathmorphing}
 \usetikzlibrary{decorations.markings}
 \usetikzlibrary{decorations.pathreplacing}
-\usetikzlibrary{patterns}
-\usetikzlibrary{matrix}
 \usetikzlibrary{fit}
-\usetikzlibrary{arrows,arrows.meta}
-\usetikzlibrary{automata}
+\usetikzlibrary{intersections}
+\usetikzlibrary{math}
+\usetikzlibrary{matrix}
+\usetikzlibrary{patterns}
 \usetikzlibrary{positioning}
 \usetikzlibrary{shapes}
-\usetikzlibrary{chains}
+\usetikzlibrary{shapes.geometric}
+\usetikzlibrary{shapes.misc}
+\usetikzlibrary{shadows.blur}
 \usetikzlibrary{spy}
-\usetikzlibrary{intersections}
 \usetikzlibrary{through}
-\usetikzlibrary{cd}
 \usepackage{tikz-3dplot}
 %\usetikzlibrary{quotes,angles,graph}
 \tikzset{%
@@ -72,6 +81,24 @@
   point/.default=red,
   halfedge/.style={-{Stealth[left,scale=1.5]},commutative diagrams/shift left=#1},
   halfedge/.default=3pt
+  edge/.style={line width=0.8pt,draw=#1},
+  edge/.default=blue,
+  halfedge/.style={-{Stealth[left,scale=1.5]},
+    commutative diagrams/shift left=#1},
+  halfedge/.default=3pt,
+  cross/.style={#1,cross out,draw,very thick,rotate=0,
+    minimum size=2*(4pt-\pgflinewidth),inner sep=0pt,outer sep=0pt},
+  cross/.default=red
+}
+\pgfplotsset{%
+  axisLimits/.style={enlarge x limits={abs value=\axisLimitsAbsValue,auto},
+    enlarge y limits={abs value=\axisLimitsAbsValue,auto}}}
+\newlength{\axisLimitsAbsValue}\setlength{\axisLimitsAbsValue}{0.08cm}
+% ------------------------------------------------------------------------------
+\newcommand{\mySimpleAxes}[4]{%
+  \draw[-{Stealth[scale=1.5]}] (#1,0)--(#3,0) node[right]{$x$};
+  \draw[-{Stealth[scale=1.5]}] (0,#2)--(0,#4) node[above]{$y$};
+>>>>>>> Stashed changes
 }
 % ------------------------------------------------------------------------------
 % #1 half length of tick
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/simple_arr.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/simple_arr.tex
index 979dc5f58857..7fc10670ba33 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/simple_arr.tex
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/simple_arr.tex
@@ -2,33 +2,38 @@
 \input{header}
 \pagestyle{empty}
 \begin{document}
-\psscalebox{1.8}{\arrset{1}%
-  \pspicture[](-3.1,-0.725)(3.1,1.709)
-  %
-  \pscustom[linecolor=blue,linewidth=0pt,fillstyle=hlines,hatchcolor=orange,hatchsep=2pt,hatchwidth=1pt]{%
-    \psplot{-2}{0}{0 x x mul x mul add x x mul add x 4 mul sub 1 add 8 div}
-    \psplot{0}{-2}{0 x x mul x mul sub x x mul add x 4 mul add 1 add 8 div}
-  }
-  %
-  \pscustom[linecolor=blue,linewidth=0pt,fillstyle=vlines,hatchcolor=orange,hatchsep=2pt,hatchwidth=1pt]{
-    \psplot{0}{2}{0 x x mul x mul add x x mul add x 4 mul sub 1 add 8 div}
-    \psplot{2}{0}{0 x x mul x mul sub x x mul add x 4 mul add 1 add 8 div}
-  }
-  %
-  \psplot[linecolor=blue]{-2.5}{3}{0 x x mul x mul sub x x mul add x 4 mul add 1 add 8 div}
-  \psplot[linecolor=blue]{-3}{2.5}{0 x x mul x mul add x x mul add x 4 mul sub 1 add 8 div}
-  %
-  \arrMainVertex(-3,-0.625){1}
-  \arrMainVertex( 3,-0.625){2}
-  \arrMainVertex(-2.5,1.609){3}
-  \arrMainVertex( 2.5,1.609){4}
-  \arrEmptyVertex(-2,0.625){x1}
-  \arrEmptyVertex( 2,0.625){x2}
-  \arrEmptyVertex(0,0.125){x3}
-  \rput(-2.5,1){\textcolor{blue}{$c_1$}}
-  \rput(-2.9,0.15){\textcolor{blue}{$c_2$}}
-  \rput(-1,0.3){\boldmath{$f_1$}}
-  \rput(1,0.3){\boldmath{$f_2$}}
-  \endpspicture
-}
+\begin{tikzpicture}[scale=1.0,smooth]
+  \begin{axis}[ticks=none,axis line style={draw=none},unit vector ratio*=1 1 1,
+      enlarge x limits={abs value=0.08,auto},
+      enlarge y limits={abs value=0.08,auto},
+      % The following miraculously solves the wierd shift in the intersection
+      % computation
+      anchor=left of west
+    ]
+    % x^3+x^2-4x-8y=-1
+    % -x^3+x^2+4x-8y=-1
+    \addplot [draw=none,name path=f11,domain=-2:0]{(1-x^3+x^2+4*x)*0.125};
+    \addplot [draw=none,name path=f12,domain=0:-2]{(1+x^3+x^2-4*x)*0.125};
+    \addplot [draw=none,name path=f21,domain=0:2]{(1-x^3+x^2+4*x)/8.0};
+    \addplot [draw=none,name path=f22,domain=2:0]{(1+x^3+x^2-4*x)/8.0};
+    %
+    \addplot [name path global=A,color=blue,thick,domain=-2.5:3]
+             {(1-x^3+x^2+4*x)*0.125} coordinate[point,pos=0] coordinate[point];
+    \addplot [name path global=B,color=blue,thick,domain=-3:2.5]
+             {(1+x^3+x^2-4*x)*0.125} coordinate[point,pos=0] coordinate[point];
+    \coordinate [name intersections={of=A and B,name=x}];
+    %
+    \node[point=white] at (x-1) {};
+    \node[point=white] at (x-2) {};
+    \node[point=white] at (x-3) {};
+    %
+    \addplot[pattern={north east lines},pattern color=orange] fill between[of=f11 and f12];
+    \addplot[pattern={north west lines},pattern color=orange] fill between[of=f21 and f22];
+    %
+    \node at (-2.5,1){\textcolor{blue}{$c_1$}};
+    \node at (-2.9,0.15){\textcolor{blue}{$c_2$}};
+    \node at (-1,0.3){$\bm{f_1}$};
+    \node at (1,0.3){$\bm{f_2}$};
+  \end{axis}
+\end{tikzpicture}
 \end{document}
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/unb_asymptote.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/unb_asymptote.tex
index c95d7de8d7c8..6ff476a4a487 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/unb_asymptote.tex
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/unb_asymptote.tex
@@ -2,7 +2,7 @@
 \input{header}
 \pagestyle{empty}
 \begin{document}
-\psscalebox{1.8}{\arrset{0.9}%
+\psscalebox{1.0}{\arrset{0.75}%
   \begin{pspicture}(-3.5,-3.5)(2.1,2.1)
     \newpsstyle{SimpleHandle}{fillstyle=solid,fillcolor=white,framearc=0.5}
     \psframe[linewidth=0.25pt](-2,-2)(2,2)
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/unb_dcel.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/unb_dcel.tex
index e9cbee96d5ae..81b9e033e498 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/unb_dcel.tex
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/unb_dcel.tex
@@ -2,143 +2,134 @@
 \input{header}
 \pagestyle{empty}
 \begin{document}
-\psscalebox{1.8}{\arrset{1}%
-  \begin{pspicture}(0,0)(10,7)
-    \psframe*[linecolor=lightyellow](0,0)(1,7)
-    \psframe*[linecolor=lightyellow](9,0)(10,7)
-    \psframe*[linecolor=lightyellow](1,0)(9,1)
-    \psframe*[linecolor=lightyellow](1,6)(9,7)
-    \psframe[linewidth=0.25pt](0,0)(10,7)
-    %
-    \arrlvertex[225](1,1){bl}{$v_{\mathrm{bl}}$}
-    \arrlvertex[135](1,6){tl}{$v_{\mathrm{tl}}$}
-    \arrlvertex[315](9,1){br}{$v_{\mathrm{br}}$}
-    \arrlvertex[45](9,6){tr}{$v_{\mathrm{tr}}$}
-    \arrv[180](1,2.5){1}
-    \arrv[180](1,4){2}
-    \arrv[180](1,5){3}
-    \arrv[270](5,1){4}
-    \arrv[90](5,6){5}
-    \arrv[0](9,1.5){6}
-    \arrv[0](9,4){7}
-    \arrv[0](9,5.5){8}
-    %
-    \arrEmptyIntersectionVertex(1,4)(9,4)(5,1)(5,6){9}
-    \arrEmptyIntersectionVertex(1,4)(9,4)(1,5)(9,1.5){10}
-    \arrEmptyIntersectionVertex(1,5)(9,1.5)(5,1)(5,6){11}
-    \arrEmptyIntersectionVertex(1,5)(9,1.5)(1,2.5)(9,5.5){12}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{bl}{1}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{bl}{1}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepB=1pt]{->}{1}{bl}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{1}{2}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{1}{2}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepA=1pt,nodesepB=2pt]{->}{2}{1}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{2}{3}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{2}{3}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepA=3pt,nodesepB=1pt]{->}{3}{2}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{3}{tl}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{3}{tl}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepA=1pt]{->}{tl}{3}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{tl}{5}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{tl}{5}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepA=1pt,nodesepB=1pt]{->}{5}{tl}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{5}{tr}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{5}{tr}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepA=1pt,nodesepB=1pt]{->}{tr}{5}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{tr}{8}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{tr}{8}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepB=1pt]{->}{8}{tr}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{8}{7}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{8}{7}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepA=1pt,nodesepB=2pt]{->}{7}{8}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{7}{6}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{7}{6}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepA=3pt,nodesepB=1pt]{->}{6}{7}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{6}{br}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{6}{br}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepA=1pt]{->}{br}{6}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{br}{4}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{br}{4}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepA=1pt,nodesepB=1pt]{->}{4}{br}
-    %
-    \ncline[linestyle=dashed,linewidth=0.5pt]{4}{bl}
-    \ncline[linewidth=0.5pt,offset=3pt]{->}{4}{bl}
-    \ncline[linewidth=0.5pt,offset=3pt,nodesepA=1pt,nodesepB=1pt]{->}{bl}{4}
-    %
-    %\arredge{3}{10}
-    \ncline[linewidth=0.5pt,linecolor=blue]{3}{10}
-    \ncline[linewidth=0.25pt,offset=3pt]{->}{3}{10}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=12pt,nodesepB=2pt]{->}{10}{3}
-    %\arredge{10}{12}
-    \ncline[linewidth=0.5pt,linecolor=blue]{10}{12}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=6pt]{->}{12}{10}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=16pt,nodesepB=-2pt]{->}{10}{12}
-    %\arredge{12}{11}
-    \ncline[linewidth=0.5pt,linecolor=blue]{12}{11}
-    \ncline[linewidth=0.25pt,offset=3pt]{->}{11}{12}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=6pt,nodesepB=2pt]{->}{12}{11}
-    %\arredge{11}{6}
-    \ncline[linewidth=0.5pt,linecolor=blue]{11}{6}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepB=2pt]{->}{11}{6}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepB=2pt]{->}{6}{11}
+  \begin{tikzpicture}[scale=0.93]
+    \fill[lightyellow](0,0)rectangle(1,7);
+    \fill[lightyellow](9,0)rectangle(10,7);
+    \fill[lightyellow](1,0)rectangle(9,1);
+    \fill[lightyellow](1,6)rectangle(9,7);
+    \draw[line width=0.25pt](0,0)rectangle(10,7);
+    %
+    \arrMainLabeledVertexZ[225](1,1){bl}{$v_{\mathrm{bl}}$}
+    \arrMainLabeledVertexZ[135](1,6){tl}{$v_{\mathrm{tl}}$}
+    \arrMainLabeledVertexZ[315](9,1){br}{$v_{\mathrm{br}}$}
+    \arrMainLabeledVertexZ[45](9,6){tr}{$v_{\mathrm{tr}}$}
+    \arrvZ[180](1,2.5){1}
+    \arrvZ[180](1,4){2}
+    \arrvZ[180](1,5){3}
+    \arrvZ[270](5,1){4}
+    \arrvZ[90](5,6){5}
+    \arrvZ[0](9,1.5){6}
+    \arrvZ[0](9,4){7}
+    \arrvZ[0](9,5.5){8}
+    %
+    \node[point=white] (9) at (intersection of 2--7 and 4--5) {};
+    \node[point=white] (10) at (intersection of 2--7 and 3--6) {};
+    \node[point=white] (11) at (intersection of 3--6 and 4--5) {};
+    \node[point=white] (12) at (intersection of 3--6 and 1--8) {};
+    %
+    \draw[dashed,line width=0.5pt](bl)--(1);
+    \draw[halfedge](bl)to(1);
+    \draw[halfedge](1)to(bl);
+    %
+    \draw[dashed,line width=0.5pt](1)--(2);
+    \draw[halfedge](1)to(2);
+    \draw[halfedge,shorten >=1pt](2)to(1);
+    %
+    \draw[dashed,line width=0.5pt](2)--(3);
+    \draw[halfedge](2)to(3);
+    \draw[halfedge,shorten <=2pt](3)to(2);
+    %
+    \draw[dashed,line width=0.5pt](3)--(tl);
+    \draw[halfedge](3)to(tl);
+    \draw[halfedge](tl)to(3);
+    %
+    \draw[dashed,line width=0.5pt](tl)--(5);
+    \draw[halfedge](tl)to(5);
+    \draw[halfedge](5)to(tl);
+    %
+    \draw[dashed,line width=0.5pt](5)--(tr);
+    \draw[halfedge](5)to(tr);
+    \draw[halfedge](tr)to(5);
+    %
+    \draw[dashed,line width=0.5pt](tr)--(8);
+    \draw[halfedge](tr)to(8);
+    \draw[halfedge](8)to(tr);
+    %
+    \draw[dashed,line width=0.5pt](8)--(7);
+    \draw[halfedge](8)to(7);
+    \draw[halfedge,shorten >=1pt](7)to(8);
+    %
+    \draw[dashed,line width=0.5pt](7)--(6);
+    \draw[halfedge](7)to(6);
+    \draw[halfedge,shorten <=1.8pt](6)to(7);
+    %
+    \draw[dashed,line width=0.5pt](6)--(br);
+    \draw[halfedge](6)to(br);
+    \draw[halfedge](br)to(6);
+    %
+    \draw[dashed,line width=0.5pt](br)--(4);
+    \draw[halfedge](br)to(4);
+    \draw[halfedge](4)to(br);
+    %
+    \draw[dashed,line width=0.5pt](4)--(bl);
+    \draw[halfedge](4)to(bl);
+    \draw[halfedge](bl)to(4);
+    %
+    \draw[edge](3)--(10);
+    \draw[halfedge](3)to(10);
+    \draw[halfedge,shorten <=11pt,shorten >=1.6pt](10)to(3);
+    \draw[edge](10)--(12);
+    \draw[halfedge,shorten <=4pt](12)to(10);
+    \draw[halfedge,shorten <=10pt,shorten >=-1.8pt](10)to(12);
+    \draw[edge](12)--(11);
+    \draw[halfedge](11)to(12);
+    \draw[halfedge,shorten <=4.2pt,shorten >=1.2pt](12)to(11);
+    \draw[edge](11)--(6);
+    \draw[halfedge,shorten >=1.6pt](11)to(6);
+    \draw[halfedge,shorten >=1.6pt](6)to(11);
 
-    %\arredge{1}{12}
-    \ncline[linewidth=0.5pt,linecolor=blue]{1}{12}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=2pt,nodesepB=5pt]{->}{1}{12}
-    \ncline[linewidth=0.25pt,offset=3pt]{->}{12}{1}
-    %\arredge{12}{9}
-    \ncline[linewidth=0.5pt,linecolor=blue]{12}{9}
-    \ncline[linewidth=0.25pt,,offset=3pt,nodesepB=12pt]{->}{12}{9}
-    \ncline[linewidth=0.25pt,,offset=3pt,nodesepA=2pt,nodesepB=5pt]{->}{9}{12}
-    %\arredge{9}{8}
-    \ncline[linewidth=0.5pt,linecolor=blue]{9}{8}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=2pt]{->}{9}{8}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=2pt,nodesepB=12pt]{->}{8}{9}
+    \draw[edge](1)--(12);
+    \draw[halfedge,shorten <=1.4pt,shorten >=4pt](1)to(12);
+    \draw[halfedge](12)to(1);
+    \draw[edge](12)--(9);
+    \draw[halfedge,shorten >=11.6pt](12)to(9);
+    \draw[halfedge,shorten <=2pt,shorten >=3.6pt](9)to(12);
+    \draw[edge](9)--(8);
+    \draw[halfedge,shorten <=1.4pt](9)to(8);
+    \draw[halfedge,shorten <=1.8pt,shorten >=11.8pt](8)to(9);
 
-    \ncline[linewidth=0.5pt,linecolor=blue]{2}{10}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=1pt,nodesepB=10pt]{->}{2}{10}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepB=1pt]{->}{10}{2}
+    \draw[edge](2)--(10);
+    \draw[halfedge,shorten >=10pt](2)to(10);
+    \draw[halfedge](10)to(2);
 
-    \ncline[linewidth=0.5pt,linecolor=blue]{10}{9}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepB=1pt]{->}{10}{9}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=16pt,nodesepB=10pt]{->}{9}{10}
+    \draw[edge](10)--(9);
+    \draw[halfedge](10)to(9);
+    \draw[halfedge,shorten <=13pt,shorten >=9.4pt](9)to(10);
 
-    \ncline[linewidth=0.5pt,linecolor=blue]{9}{7}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=16pt,nodesepB=1pt]{->}{9}{7}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=1pt,nodesepB=1pt]{->}{7}{9}
+    \draw[edge](9)--(7);
+    \draw[halfedge,shorten <=13pt](9)to(7);
+    \draw[halfedge](7)to(9);
 
-    \ncline[linewidth=0.5pt,linecolor=blue]{4}{11}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=1pt]{->}{4}{11}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=2pt,nodesepB=1pt]{->}{11}{4}
+    \draw[edge](4)--(11);
+    \draw[halfedge](4)to(11);
+    \draw[halfedge,shorten <=2pt](11)to(4);
 
-    \ncline[linewidth=0.5pt,linecolor=blue]{11}{9}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=1pt]{->}{9}{11}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=2pt,nodesepB=2pt]{->}{11}{9}
+    \draw[edge](11)--(9);
+    \draw[halfedge](9)to(11);
+    \draw[halfedge,shorten <=2pt,shorten >=1pt](11)to(9);
 
-    \ncline[linewidth=0.5pt,linecolor=blue]{9}{5}
-    \ncline[linewidth=0.25pt,offset=3pt,nodesepA=1pt,nodesepB=1pt]{->}{9}{5}
-    \ncline[linewidth=0.25pt,offset=3pt,,nodesepA=1pt,nodesepB=2pt]{->}{5}{9}
-    %
-    \rput(2,6.5){$\tilde{f}$}
-    \rput(6.2,5.2){$f_1$}
-    \rput(8.5,4.4){$f_2$}
-    \rput(8.3,3.4){$f_3$}
-    \rput(6.2,2){$f_4$}
-    \rput(3.8,2){$f_5$}
-    \rput(1.7,3.4){$f_6$}
-    \rput(1.5,4.4){$f_7$}
-    \rput(3.8,5.2){$f_8$}
-  \end{pspicture}
-}
+    \draw[edge](9)--(5);
+    \draw[halfedge](9)to(5);
+    \draw[halfedge,shorten >=1.2pt](5)to(9);
+    %
+    \node at(2,6.5){$\tilde{f}$};
+    \node at(6.2,5.2){$f_1$};
+    \node at(8.5,4.4){$f_2$};
+    \node at(8.3,3.4){$f_3$};
+    \node at(6.2,2){$f_4$};
+    \node at(3.8,2){$f_5$};
+    \node at(1.7,3.4){$f_6$};
+    \node at(1.5,4.4){$f_7$};
+    \node at (3.8,5.2){$f_8$};
+  \end{tikzpicture}
 \end{document}

From d36cb8c29bb4e3a353e4b9652299205f987ae199 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 18 Jan 2024 12:09:46 +0100
Subject: [PATCH 1285/1398] verbose mode cleaning

---
 .../Tetrahedral_remeshing/internal/flip_edges.h    | 14 --------------
 1 file changed, 14 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index d276d61b4589..51f9f99763e8 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1848,12 +1848,6 @@ std::size_t flipBoundaryEdges(
   CellSelector& cell_selector,
   Visitor& visitor)
 {
-//#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-//  std::cerr << "\n\tFlipping boundary edges...";
-//  std::cerr.flush();
-//  std::size_t nb_attempts = 0;
-//#endif
-
   typedef typename C3T3::Vertex_handle Vertex_handle;
   typedef typename C3T3::Cell_handle   Cell_handle;
   typedef typename C3T3::Facet         Facet;
@@ -1988,9 +1982,6 @@ std::size_t flipBoundaryEdges(
             std::distance(c3t3.edges_in_complex_begin(),
                           c3t3.edges_in_complex_end()));
 
-//#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-//          ++nb_attempts;
-//#endif
           Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3,
                                                      inc_cells,
                                                      flip_criterion,
@@ -2041,11 +2032,6 @@ std::size_t flipBoundaryEdges(
   }
   CGAL_assertion(tr.tds().is_valid());
 
-#ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-  std::cerr << "\r\t Flipping boundary edges done ("
-                     << nb << " flips done)" << std::endl;
-#endif
-
   return nb;
 }
 

From 3b003535c717960c6038ef172d6b4a494dbbf0d5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 17 Jan 2024 10:31:19 +0100
Subject: [PATCH 1286/1398] WIP

---
 .../Polygon_mesh_processing/autorefinement.h  | 421 ++++++++++++------
 1 file changed, 274 insertions(+), 147 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index a3606f816a7b..1cb0e3aaa4d8 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -114,7 +114,6 @@ Segment_inter_type
 do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
                                std::size_t ri, std::size_t si,
                                const std::vector<typename K::Point_3>& points,
-                               const typename K::Vector_3& /* plane_normal */,
                                const K& k = K())
 {
   typename K::Collinear_are_ordered_along_line_3 cln_order = k.collinear_are_ordered_along_line_3_object();
@@ -249,11 +248,13 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
   return NO_INTERSECTION;
 }
 
+
 // imported from Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+#warning TODO fill the indices correctly
 template<class K>
 void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
                             const std::array<typename K::Point_3, 3>& t2,
-                            std::vector<typename K::Point_3>& inter_pts)
+                            std::vector<std::tuple<typename K::Point_3, int, int>>& inter_pts)
 {
   const typename K::Point_3& p1 = t1[0], q1 = t1[1], r1 = t1[2];
   const typename K::Point_3& p2 = t2[0], q2 = t2[1], r2 = t2[2];
@@ -270,15 +271,14 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
   Intersections::internal::intersection_coplanar_triangles_cutoff(r1,p1,q1,2,p2,q2,r2,k,l_inter_pts); //line r1p1
 
   for (const Intersections::internal::Point_on_triangle<K>& pot : l_inter_pts)
-    inter_pts.push_back( pot.point(p1,q1,r1,p2,q2,r2,k) );
+    inter_pts.emplace_back(pot.point(p1,q1,r1,p2,q2,r2,k), 0, 0);
 }
 
-// imported from Polygon_mesh_processing/internal/Corefinement/intersect_triangle_segment_3.h
+// imported from Polygon_mesh_processing/internal/Corefinement/intersect_triangle_and_segment_3.h
 template<class K>
-void
+std::optional<std::pair<typename K::Point_3, int>>
 find_intersection(const typename K::Point_3& p, const typename K::Point_3& q,  //segment
                   const typename K::Point_3& a, const typename K::Point_3& b, const typename K::Point_3& c, //triangle
-                  std::vector<typename K::Point_3>& inter_pts,
                   bool is_p_coplanar=false, bool is_q_coplanar=false) // note that in coref this was wrt a halfedge not p/q
 {
   Orientation ab=orientation(p,q,a,b);
@@ -286,54 +286,56 @@ find_intersection(const typename K::Point_3& p, const typename K::Point_3& q,  /
   Orientation ca=orientation(p,q,c,a);
 
   if ( ab==POSITIVE || bc==POSITIVE || ca==POSITIVE )
-    return;
+    return std::nullopt;
 
   int nb_coplanar=(ab==COPLANAR?1:0) + (bc==COPLANAR?1:0) + (ca==COPLANAR?1:0);
 
-  if (is_p_coplanar)
-  {
-    inter_pts.push_back(p);
-    return;
-  }
-  if (is_q_coplanar)
-  {
-    inter_pts.push_back(q);
-    return;
-  }
-
-  if (nb_coplanar!=2)
-  {
-    inter_pts.push_back(
-      typename K::Construct_plane_line_intersection_point_3()(a, b, c, p, q)
-    );
-  }
-  else
+  if (nb_coplanar==2)
   {
+    // even if a common point is not new it is still needed to be reported so
+    // that the intersection segment is known.
     if (ab!=COPLANAR)
-    {
       // intersection is c
-      inter_pts.push_back(c);
-      return;
-    }
-
-    if (bc!=COPLANAR)
-    {
+      return std::make_pair(c, -3);
+    else if (bc!=COPLANAR)
       // intersection is a
-      inter_pts.push_back(a);
-      return;
+      return std::make_pair(a, -1);
+    else
+    {
+      CGAL_assertion(ca!=COPLANAR);
+      // intersection is b
+      return std::make_pair(b, -2);
     }
-    CGAL_assertion(ca!=COPLANAR);
-    // intersection is b
-    inter_pts.push_back(b);
   }
+
+  typename K::Point_3 ipt = is_p_coplanar ? p :
+                            is_q_coplanar ? q :
+                            typename K::Construct_plane_line_intersection_point_3()
+                              (a, b, c, p, q);
+
+  if (nb_coplanar == 0)
+    return std::make_pair(ipt, 0);
+
+
+  CGAL_assertion(nb_coplanar==1);
+
+  if (ab==COPLANAR)
+    // intersection is ab
+    return std::make_pair(ipt, 1);
+  if (bc==COPLANAR)
+    // intersection is bc
+    return std::make_pair(ipt, 2);
+  CGAL_assertion(ca==COPLANAR);
+  // intersection is ca
+  return std::make_pair(ipt, 3);
 }
 
 template <class K>
-void test_edge(const typename K::Point_3& p, const typename K::Point_3& q,
-               const typename K::Point_3& a, const typename K::Point_3& b, const typename K::Point_3& c,
-               const Orientation abcp,
-               const Orientation abcq,
-               std::vector<typename K::Point_3>& inter_pts)
+std::optional<std::pair<typename K::Point_3, int>>
+test_edge(const typename K::Point_3& p, const typename K::Point_3& q,
+          const typename K::Point_3& a, const typename K::Point_3& b, const typename K::Point_3& c,
+          const Orientation abcp,
+          const Orientation abcq)
 {
   switch ( abcp ) {
   case POSITIVE:
@@ -341,46 +343,40 @@ void test_edge(const typename K::Point_3& p, const typename K::Point_3& q,
     case POSITIVE:
       // the segment lies in the positive open halfspaces defined by the
       // triangle's supporting plane
-    break;
+    return std::nullopt;
     case NEGATIVE:
       // p sees the triangle in counterclockwise order
-      find_intersection<K>(p,q,a,b,c,inter_pts);
-    break;
+      return find_intersection<K>(p,q,a,b,c);
     //case COPLANAR:
     default:
       // q belongs to the triangle's supporting plane
       // p sees the triangle in counterclockwise order
-      find_intersection<K>(p,q,a,b,c,inter_pts,false,true);
+      return find_intersection<K>(p,q,a,b,c,false,true);
     }
-  break;
   case NEGATIVE:
     switch ( abcq ) {
     case POSITIVE:
       // q sees the triangle in counterclockwise order
-      find_intersection<K>(q,p,a,b,c,inter_pts);
-    break;
+      return find_intersection<K>(q,p,a,b,c);
     case NEGATIVE:
       // the segment lies in the negative open halfspaces defined by the
       // triangle's supporting plane
-    break;
+    return std::nullopt;
     // case COPLANAR:
     default:
       // q belongs to the triangle's supporting plane
       // p sees the triangle in clockwise order
-      find_intersection<K>(q,p,a,b,c,inter_pts,true,false);
+      return find_intersection<K>(q,p,a,b,c,true,false);
     }
-  break;
   default:
   //case COPLANAR: // p belongs to the triangle's supporting plane
     switch ( abcq ) {
     case POSITIVE:
       // q sees the triangle in counterclockwise order
-      find_intersection<K>(q,p,a,b,c,inter_pts,false, true);
-    break;
+      return find_intersection<K>(q,p,a,b,c,false, true);
     case NEGATIVE:
       // q sees the triangle in clockwise order
-      find_intersection<K>(p,q,a,b,c,inter_pts,true);
-    break;
+      return find_intersection<K>(p,q,a,b,c,true);
     //case COPLANAR:
     default:
       // the segment is coplanar with the triangle's supporting plane
@@ -392,7 +388,7 @@ void test_edge(const typename K::Point_3& p, const typename K::Point_3& q,
         // nothing done as coplanar case handle in collect_intersections
         // and other intersection points will be collected with non-coplanar edges
       //}
-    break;
+      return std::nullopt;
     }
   }
 }
@@ -400,7 +396,7 @@ void test_edge(const typename K::Point_3& p, const typename K::Point_3& q,
 template <class K>
 bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
                            const std::array<typename K::Point_3, 3>& t2,
-                           std::vector<typename K::Point_3>& inter_pts)
+                           std::vector<std::tuple<typename K::Point_3, int, int>>& inter_pts)
 {
   // test edges of t1 vs t2
   std::array<Orientation,3> ori;
@@ -409,6 +405,7 @@ bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
 
   if (ori[0]== COPLANAR && ori[1]==COPLANAR && ori[2]==COPLANAR)
   {
+
     coplanar_intersections<K>(t1, t2, inter_pts);
 #ifdef CGAL_AUTOREF_DEBUG_DEPTH
     for (auto p : inter_pts)
@@ -421,7 +418,17 @@ bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   for (int i=0; i<3; ++i)
   {
     int j=(i+1)%3;
-    test_edge<K>(t1[i], t1[j], t2[0], t2[1], t2[2], ori[i], ori[j], inter_pts);
+    std::optional<std::pair<typename K::Point_3, int> > opt =
+      test_edge<K>(t1[i], t1[j], t2[0], t2[1], t2[2], ori[i], ori[j]);
+    if (opt)
+    {
+      if (ori[i]==COPLANAR)
+        inter_pts.emplace_back(opt->first, -(i+1), opt->second);
+      else if (ori[j]==COPLANAR)
+        inter_pts.emplace_back(opt->first, -(j+1), opt->second);
+      else
+        inter_pts.emplace_back(opt->first,   i+1 , opt->second);
+    }
   }
 
   // test edges of t2 vs t1
@@ -430,12 +437,23 @@ bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   for (int i=0; i<3; ++i)
   {
     int j=(i+1)%3;
-    test_edge<K>(t2[i], t2[j], t1[0], t1[1], t1[2], ori[i], ori[j], inter_pts);
+    std::optional<std::pair<typename K::Point_3, int> > opt =
+      test_edge<K>(t2[i], t2[j], t1[0], t1[1], t1[2], ori[i], ori[j]);
+    if (opt)
+    {
+      if (ori[i]==COPLANAR)
+        inter_pts.emplace_back(opt->first, opt->second, -(i+1));
+      else if (ori[j]==COPLANAR)
+        inter_pts.emplace_back(opt->first, opt->second, -(j+1));
+      else
+        inter_pts.emplace_back(opt->first, opt->second,   i+1 );
+    }
   }
 
+  #warning TODO get rid of sort and unique calls
   // because we don't handle intersection type and can have edge-edge edge-vertex duplicates
-  std::sort(inter_pts.begin(), inter_pts.end());
-  auto last = std::unique(inter_pts.begin(), inter_pts.end());
+  std::sort(inter_pts.begin(), inter_pts.end(), [](auto p, auto q){return get<0>(p)<get<0>(q);});
+  auto last = std::unique(inter_pts.begin(), inter_pts.end(), [](auto p, auto q){return get<0>(p)==get<0>(q);});
   inter_pts.erase(last, inter_pts.end());
 
 #ifdef CGAL_AUTOREF_DEBUG_DEPTH
@@ -446,45 +464,24 @@ bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   return false;
 }
 
+//TODO: rename struct
+struct Triangle_data
+{
+  std::vector<Exact_predicates_exact_constructions_kernel::Point_3> points;
+  std::vector<std::pair<std::size_t,std::size_t>> segments;
+  std::vector<std::size_t> segment_input_triangle_ids;
+};
+
 template <class EK,
           class PointVector>
 void generate_subtriangles(std::size_t ti,
-                           std::vector<std::pair<std::size_t, std::size_t>>& segments,
-                           std::vector<typename EK::Point_3>& points,
-                           const std::vector<std::size_t>& in_triangle_ids,
+                           Triangle_data& triangle_data,
                            const std::set<std::pair<std::size_t, std::size_t> >& intersecting_triangles,
                            const std::set<std::pair<std::size_t, std::size_t> >& coplanar_triangles,
                            const std::vector<std::array<typename EK::Point_3,3>>& triangles,
                            PointVector& new_triangles
                            )
 {
-  typedef CGAL::Projection_traits_3<EK> P_traits;
-  typedef CGAL::No_constraint_intersection_tag Itag;
-
-  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits ,Default, Itag> CDT_2;
-  //typedef CGAL::Constrained_triangulation_plus_2<CDT_2> CDT;
-  typedef CDT_2 CDT;
-
-  const std::array<typename EK::Point_3,3>& t = triangles[ti];
-
-  // positive triangle normal
-  typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
-  typename EK::Point_3 o(CGAL::ORIGIN);
-
-  bool orientation_flipped = false;
-  if ( typename EK::Less_xyz_3()(o+n,o) )
-  {
-    n=-n;
-    orientation_flipped = true;
-  }
-
-  P_traits cdt_traits(n);
-  CDT cdt(cdt_traits);
-  cdt.insert_outside_affine_hull(t[0]);
-  cdt.insert_outside_affine_hull(t[1]);
-  typename CDT::Vertex_handle v = cdt.tds().insert_dim_up(cdt.infinite_vertex(), orientation_flipped);
-  v->set_point(t[2]);
-
 #ifdef CGAL_AUTOREFINE_DEBUG_COUNTERS
   struct Counter
   {
@@ -518,7 +515,13 @@ void generate_subtriangles(std::size_t ti,
 #define CGAL_AUTOREF_COUNTER_INSTRUCTION(X)
 #endif
 
-  // pre-compute segment intersections
+  #warning TODO
+
+  std::vector<Exact_predicates_exact_constructions_kernel::Point_3>& points=triangle_data.points;
+  std::vector<std::pair<std::size_t, std::size_t>>& segments=triangle_data.segments;
+  std::vector<std::size_t>& in_triangle_ids=triangle_data.segment_input_triangle_ids;
+
+// pre-compute segment intersections
   if (!segments.empty())
   {
     std::size_t nbs = segments.size();
@@ -528,7 +531,7 @@ void generate_subtriangles(std::size_t ti,
     CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer1.start();)
 
     std::map<typename EK::Point_3, std::size_t> point_id_map;
-
+//TODO: we already have sorted the points while deduplicating segments!
     for (std::size_t pid=0; pid<points.size(); ++pid)
     {
       CGAL_assertion_code(bool insertion_ok =)
@@ -569,7 +572,7 @@ void generate_subtriangles(std::size_t ti,
           Segment_inter_type seg_inter_type =
             do_coplanar_segments_intersect<EK>(segments[i].first, segments[i].second,
                                                segments[j].first, segments[j].second,
-                                               points, n);
+                                               points);
           CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer5.stop();)
 
           switch(seg_inter_type)
@@ -739,13 +742,63 @@ void generate_subtriangles(std::size_t ti,
   auto last = std::unique(segments.begin(), segments.end());
   segments.erase(last, segments.end());
 
+// init CDT + insert points and constraints
   CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer3.start();)
-  if (segments.empty())
-    cdt.insert(points.begin(), points.end());
-  else
-    cdt.insert_constraints(points.begin(), points.end(), segments.begin(), segments.end());
+  typedef CGAL::Projection_traits_3<EK> P_traits;
+  typedef CGAL::No_constraint_intersection_tag Itag;
+
+  typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits ,Default, Itag> CDT_2;
+  //typedef CGAL::Constrained_triangulation_plus_2<CDT_2> CDT;
+  typedef CDT_2 CDT;
+
+  const std::array<typename EK::Point_3,3>& t = triangles[ti];
+
+  // positive triangle normal
+  typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
+  typename EK::Point_3 o(CGAL::ORIGIN);
+
+  bool orientation_flipped = false;
+  if ( typename EK::Less_xyz_3()(o+n,o) )
+  {
+    n=-n;
+    orientation_flipped = true;
+  }
+
+  std::vector<typename CDT::Vertex_handle> vhandles(triangle_data.points.size());
+  P_traits cdt_traits(n);
+  CDT cdt(cdt_traits);
+  vhandles[0]=cdt.insert_outside_affine_hull(t[0]);
+  vhandles[1]=cdt.insert_outside_affine_hull(t[1]);
+  vhandles[2] = cdt.tds().insert_dim_up(cdt.infinite_vertex(), orientation_flipped);
+  vhandles[2]->set_point(t[2]);
+
+  // insert points and fill vhandles
+  std::vector<std::size_t> indices(triangle_data.points.size()-3);
+  std::iota(indices.begin(), indices.end(), 3);
+  typedef typename Pointer_property_map<typename EK::Point_3>::type Pmap;
+  typedef Spatial_sort_traits_adapter_2<P_traits,Pmap> Search_traits;
+  spatial_sort(indices.begin(), indices.end(),
+               Search_traits(make_property_map(points), cdt_traits));
+
+  typename CDT::Face_handle hint;
+  for (std::size_t i : indices)
+  {
+    vhandles[i] = cdt.insert(points[i], hint);
+    hint=vhandles[i]->face();
+  }
+
+  for (const std::pair<std::size_t, std::size_t>& ids : triangle_data.segments)
+  {
+    //TODO remove me
+    CGAL_assertion(ids.first < vhandles.size());
+    CGAL_assertion(ids.second < vhandles.size());
+    CGAL_assertion( vhandles[ids.first]!= typename CDT::Vertex_handle() );
+    CGAL_assertion( vhandles[ids.second]!= typename CDT::Vertex_handle() );
+    cdt.insert_constraint(vhandles[ids.first], vhandles[ids.second]);
+  }
   CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer3.stop();)
 
+// extract new triangles
   for (typename CDT::Face_handle fh : cdt.finite_face_handles())
   {
     if (orientation_flipped)
@@ -838,7 +891,8 @@ void autorefine_triangle_soup(PointRange& soup_points,
   Visitor visitor(choose_parameter<Visitor>(get_parameter(np, internal_np::visitor)));
 
 
-  constexpr bool parallel_execution = std::is_same_v<Parallel_tag, Concurrency_tag>;
+  //~ constexpr bool parallel_execution = std::is_same_v<Parallel_tag, Concurrency_tag>;
+  constexpr bool parallel_execution = false;
 
 #ifndef CGAL_LINKED_WITH_TBB
   static_assert (!parallel_execution,
@@ -895,21 +949,24 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
   // init the vector of triangles used for the autorefinement of triangles
   typedef CGAL::Exact_predicates_exact_constructions_kernel EK;
-  std::vector< std::array<EK::Point_3, 3> > triangles(tiid+1);
+  std::vector< std::array<EK::Point_3, 3> > triangles(tiid+1); // TODO get rid of triangles and use all_triangle_data
+  // vector of data for refining triangles
+  std::vector<autorefine_impl::Triangle_data> all_triangle_data(triangles.size());
   Cartesian_converter<GT, EK> to_exact;
 
   for(Input_TID f : intersected_faces)
   {
-    triangles[tri_inter_ids[f]]= CGAL::make_array(
+    std::size_t tid=tri_inter_ids[f];
+    triangles[tid]= CGAL::make_array(
       to_exact( get(pm, soup_points[soup_triangles[f][0]]) ),
       to_exact( get(pm, soup_points[soup_triangles[f][1]]) ),
       to_exact( get(pm, soup_points[soup_triangles[f][2]]) ) );
+    all_triangle_data[tid].points.resize(3);
+    all_triangle_data[tid].points[0]=triangles[tri_inter_ids[f]][0];
+    all_triangle_data[tid].points[1]=triangles[tri_inter_ids[f]][1];
+    all_triangle_data[tid].points[2]=triangles[tri_inter_ids[f]][2];
   }
 
-  std::vector< std::vector<std::array<EK::Point_3,2> > > all_segments(triangles.size());
-  std::vector< std::vector<EK::Point_3> > all_points(triangles.size());
-  std::vector< std::vector<std::size_t> > all_in_triangle_ids(triangles.size());
-
   CGAL_PMP_AUTOREFINE_VERBOSE("compute intersections");
 #ifdef CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
   Real_timer t;
@@ -928,7 +985,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
     const std::array<EK::Point_3, 3>& t1 = triangles[i1];
     const std::array<EK::Point_3, 3>& t2 = triangles[i2];
 
-    std::vector<EK::Point_3> inter_pts;
+    std::vector<std::tuple<EK::Point_3, int, int>> inter_pts;
     bool triangles_are_coplanar = autorefine_impl::collect_intersections<EK>(t1, t2, inter_pts);
 
     CGAL_assertion(
@@ -937,27 +994,73 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
     if (!inter_pts.empty())
     {
+      auto get_ipt_id1 = [](const std::tuple<EK::Point_3, int, int>& tpl)
+      {
+        if (get<1>(tpl)<0) return -get<1>(tpl)-1;
+      };
+      auto get_ipt_id2 = [](const std::tuple<EK::Point_3, int, int>& tpl)
+      {
+        if (get<2>(tpl)<0) return -get<2>(tpl)-1;
+      };
+
+
       std::size_t nbi = inter_pts.size();
       switch(nbi)
       {
+        #warning TODO use inter pt info
         case 1:
-          all_points[i1].push_back(inter_pts[0]);
-          all_points[i2].push_back(inter_pts[0]);
+          if (get<1>(inter_pts[0])>=0)
+            all_triangle_data[i1].points.push_back(get<0>(inter_pts[0]));
+          if (get<2>(inter_pts[0])>=0)
+            all_triangle_data[i2].points.push_back(get<0>(inter_pts[0]));
         break;
         case 2:
-          all_segments[i1].push_back(CGAL::make_array(inter_pts[0], inter_pts[1]));
-          all_segments[i2].push_back(CGAL::make_array(inter_pts[0], inter_pts[1]));
-          all_in_triangle_ids[i1].push_back(i2);
-          all_in_triangle_ids[i2].push_back(i1);
+        {
+          std::size_t src_id=get<1>(inter_pts[0])<0?(-get<1>(inter_pts[0])-1):all_triangle_data[i1].points.size();
+          if (get<1>(inter_pts[0])>=0)
+            all_triangle_data[i1].points.push_back(get<0>(inter_pts[0]));
+          std::size_t tgt_id=get<1>(inter_pts[1])<0?(-get<1>(inter_pts[1])-1):all_triangle_data[i1].points.size();
+          if (get<1>(inter_pts[1])>=0)
+            all_triangle_data[i1].points.push_back(get<0>(inter_pts[1]));
+          all_triangle_data[i1].segments.emplace_back(src_id, tgt_id);
+          all_triangle_data[i1].segment_input_triangle_ids.push_back(i2);
+          //
+          src_id=get<2>(inter_pts[0])<0?(-get<2>(inter_pts[0])-1):all_triangle_data[i2].points.size();
+          if (get<2>(inter_pts[0])>=0)
+            all_triangle_data[i2].points.push_back(get<0>(inter_pts[0]));
+          tgt_id=get<2>(inter_pts[1])<0?(-get<2>(inter_pts[1])-1):all_triangle_data[i2].points.size();
+          if (get<2>(inter_pts[1])>=0)
+            all_triangle_data[i2].points.push_back(get<0>(inter_pts[1]));
+          all_triangle_data[i2].segments.emplace_back(src_id, tgt_id);
+          all_triangle_data[i2].segment_input_triangle_ids.push_back(i1);
+        }
         break;
         default:
+        {
+          std::vector<std::size_t> ipt_ids1(nbi+1), ipt_ids2(nbi+1);
+          all_triangle_data[i1].segment_input_triangle_ids.insert(
+            all_triangle_data[i1].segment_input_triangle_ids.end(), nbi, i2);
+          all_triangle_data[i2].segment_input_triangle_ids.insert(
+            all_triangle_data[i2].segment_input_triangle_ids.end(), nbi, i1);
+
           for (std::size_t i=0;i<nbi; ++i)
           {
-            all_segments[i1].push_back(CGAL::make_array(inter_pts[i], inter_pts[(i+1)%nbi]));
-            all_segments[i2].push_back(all_segments[i1].back());
-            all_in_triangle_ids[i1].push_back(i2);
-            all_in_triangle_ids[i2].push_back(i1);
+            std::size_t id1=get<1>(inter_pts[i])<0?(-get<1>(inter_pts[i])-1):all_triangle_data[i1].points.size();
+            std::size_t id2=get<2>(inter_pts[i])<0?(-get<2>(inter_pts[i])-1):all_triangle_data[i2].points.size();
+            if (get<1>(inter_pts[i])>=0) all_triangle_data[i1].points.push_back(get<0>(inter_pts[i]));
+            if (get<2>(inter_pts[i])>=0) all_triangle_data[i2].points.push_back(get<0>(inter_pts[i]));
+            ipt_ids1[i]=id1;
+            ipt_ids2[i]=id2;
           }
+          ipt_ids1.back()=ipt_ids1.front();
+          ipt_ids2.back()=ipt_ids2.front();
+
+          for (std::size_t i=0;i<nbi; ++i)
+          {
+            all_triangle_data[i1].segments.emplace_back(ipt_ids1[i], ipt_ids1[i+1]);
+            all_triangle_data[i2].segments.emplace_back(ipt_ids2[i], ipt_ids2[i+1]);
+          }
+        }
       }
       intersecting_triangles.insert(CGAL::make_sorted_pair(i1, i2));
       if (triangles_are_coplanar)
@@ -975,52 +1078,76 @@ void autorefine_triangle_soup(PointRange& soup_points,
 #endif
 
   // deduplicate inserted segments
-  std::vector<std::vector<std::pair<std::size_t, std::size_t>>> all_segments_ids(all_segments.size());
-
   auto deduplicate_inserted_segments = [&](std::size_t ti)
   {
-    if (!all_segments[ti].empty())
+    if (!all_triangle_data[ti].segments.empty())
     {
-      std::map<EK::Point_3, std::size_t> point_id_map;
+      std::vector<EK::Point_3>& points=all_triangle_data[ti].points;
+      std::vector<std::pair<std::size_t, std::size_t>>& segments=all_triangle_data[ti].segments;
 
+      std::vector<std::size_t> indices(points.size()-3);
+      std::iota(indices.begin(), indices.end(),3);
 
-      auto get_point_id = [&](const EK::Point_3& pt)
-      {
-        auto insert_res = point_id_map.insert(std::make_pair(pt, all_points[ti].size()));
-        if (insert_res.second)
-          all_points[ti].push_back(pt);
-        return insert_res.first->second;
-      };
+      std::sort(indices.begin(), indices.end(), [&points](std::size_t i, std::size_t j)
+                                                { return points[i]<points[j]; });
 
+      std::vector<std::size_t> id_map(points.size());
+      id_map[0]=0;
+      id_map[1]=1;
+      id_map[2]=2;
+      std::vector<std::size_t> unique_ids;
+      unique_ids.reserve(indices.size());
 
-      if (!all_points[ti].empty())
+      //make points unique + create mapping between indices
+      for (std::size_t i=0; i<indices.size(); ++i)
       {
-        using EPoint_3 = EK::Point_3; // workaround for MSVC 2022 bug
-        std::vector<EPoint_3> tmp;
-        tmp.swap(all_points[ti]);
-        for (const EPoint_3& pt : tmp)
-          get_point_id(pt);
+        std::size_t new_id=unique_ids.size()+3;
+        unique_ids.push_back(indices[i]);
+        id_map[indices[i]]=new_id;
+        while(i+1!=indices.size() && points[indices[i]]==points[indices[i+1]])
+        {
+          id_map[indices[++i]]=new_id;
+        }
       }
 
-      std::size_t nbs = all_segments[ti].size();
-      std::vector<std::array<EK::Point_3,2>> filtered_segments;
+      //~ if (unique_ids.size()==indices.size())
+        //~ // TODO: do we want to keep points sorted? if yes always swap twice
+        //~ return; // no duplicates
+
+      // now make points unique
+      using EPoint_3 = EK::Point_3; // workaround for MSVC 2022 bug
+      std::vector<EPoint_3> tmp;
+      tmp.reserve(unique_ids.size()+3);
+      tmp.push_back(points[0]);
+      tmp.push_back(points[1]);
+      tmp.push_back(points[2]);
+      for(std::size_t i : unique_ids)
+        tmp.push_back(points[i]);
+      tmp.swap(points);
+
+      // now make segments unique
+      std::size_t nbs = segments.size();
+      std::vector<std::pair<std::size_t, std::size_t>> filtered_segments;
       std::vector<std::size_t> filtered_in_triangle_ids;
       filtered_segments.reserve(nbs);
+      filtered_in_triangle_ids.reserve(nbs);
       std::set<std::pair<std::size_t, std::size_t>> segset;
       for (std::size_t si=0; si<nbs; ++si)
       {
-        const EK::Point_3& src = all_segments[ti][si][0];
-        const EK::Point_3& tgt = all_segments[ti][si][1];
-        std::size_t src_id = get_point_id(src), tgt_id=get_point_id(tgt);
-        if (segset.insert(
-              CGAL::make_sorted_pair(src_id, tgt_id)).second)
+        CGAL_assertion(id_map.size()>segments[si].first);
+        CGAL_assertion(id_map.size()>segments[si].second);
+        std::pair<std::size_t, std::size_t> seg_ids =
+          CGAL::make_sorted_pair(id_map[segments[si].first], id_map[segments[si].second]);
+        if (segset.insert(seg_ids).second)
         {
-          all_segments_ids[ti].emplace_back(src_id, tgt_id);
-          filtered_in_triangle_ids.push_back(all_in_triangle_ids[ti][si]);
+          filtered_segments.push_back(seg_ids);
+          filtered_in_triangle_ids.push_back(all_triangle_data[ti].segment_input_triangle_ids[si]);
         }
       }
-      if (all_segments_ids[ti].size()!=nbs)
-        filtered_in_triangle_ids.swap(all_in_triangle_ids[ti]);
+      filtered_in_triangle_ids.swap(all_triangle_data[ti].segment_input_triangle_ids);
+      filtered_segments.swap(segments);
+
+      CGAL_assertion(points.size()==std::set<EK::Point_3>(points.begin(), points.end()).size());
     }
   };
 
@@ -1062,11 +1189,11 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
   auto refine_triangles = [&](std::size_t ti)
   {
-    if (all_segments[ti].empty() && all_points[ti].empty())
+    if (all_triangle_data[ti].points.empty())
       new_triangles.push_back({triangles[ti], ti});
     else
     {
-      autorefine_impl::generate_subtriangles<EK>(ti, all_segments_ids[ti], all_points[ti], all_in_triangle_ids[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
+      autorefine_impl::generate_subtriangles<EK>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
     }
 
 #ifdef CGAL_AUTOREF_USE_PROGRESS_DISPLAY

From dbe61d2feb3621491ae09ba8abd8a95a9187e424 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 17 Jan 2024 19:33:31 +0100
Subject: [PATCH 1287/1398] update intersection computation code to always
 report the complete combinatoric of the intersection points

---
 .../Triangle_3_Triangle_3_intersection.h      | 237 ++++++------------
 1 file changed, 76 insertions(+), 161 deletions(-)

diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index 269c86c3e606..37fc2aa19148 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -39,11 +39,15 @@ struct Point_on_triangle
 {
   // triangle points are not stored in this class but are expected
   // to always be passed in the same order. For a triangle pqr,
-  // edge 0 is pq, edge 1 qr and edge 2 rp. Point 0 is p, 1 is q and 2 is r.
+  // edge 1 is pq, edge 2 qr and edge 3 rp. Point -1 is p, -2 is q and -3 is r.
+  //
+  //  (0,-) vertex of t2 inside t1
+  //  (-,-) common point of t1 and t2
+  //  (-,0) vertex of t1 inside t2
+  //  (-,+) vertex of t1 on an edge of t2
+  //  (+,+) edge of t1 intersecting edge of t2
+  //  (+,-) vertex of t2 on an edge of t1
   //
-  // (id, -1) point on t1
-  // (-1, id) point on t2
-  // (id1, id2) intersection of edges
   std::pair<int, int> t1_t2_ids;
   boost::container::flat_set<int> extra_t1; // store other ids of edges containing the point
   typename Kernel::FT alpha; //
@@ -60,16 +64,16 @@ struct Point_on_triangle
   {
     switch(id)
     {
-      case 0:
+      case -1:
         return p;
-      case 1:
+      case -2:
         return q;
       default:
         return r;
     }
   }
 
-  Point_on_triangle(int i1, int i2=-1, typename Kernel::FT alpha = 0.) // TODO add global zero()?
+  Point_on_triangle(int i1, int i2, typename Kernel::FT alpha = 0.) // TODO add global zero()?
     : t1_t2_ids(i1,i2)
     , alpha(alpha)
   {}
@@ -85,20 +89,20 @@ struct Point_on_triangle
                const typename Kernel::Point_3& r2,
                const Kernel& k) const
   {
-    if (t1_t2_ids.first!=-1)
+    if (t1_t2_ids.first!=0 && t1_t2_ids.second >=0)
     {
-      if (t1_t2_ids.second==-1)
+      if (t1_t2_ids.first<0)
         return (edge_id1==t1_t2_ids.first || (edge_id1+1)%3==t1_t2_ids.first) ? ZERO:POSITIVE; // it is a point on t1
       // this is an intersection point
 
       if (t1_t2_ids.first==edge_id1)
         return ZERO;
-      if (t1_t2_ids.first==(edge_id1+1)%3)
+      if (t1_t2_ids.first-1==(edge_id1)%3)
       {
         if (alpha==0) return ZERO;
         return alpha>=0 ? POSITIVE:NEGATIVE;
       }
-      CGAL_assertion((t1_t2_ids.first+1)%3==edge_id1);
+      CGAL_assertion((t1_t2_ids.first)%3==edge_id1-1);
       if (alpha==1) return ZERO;
       return alpha<=1?POSITIVE:NEGATIVE;
     }
@@ -111,9 +115,13 @@ struct Point_on_triangle
     }
   }
 
+
   int id1() const { return t1_t2_ids.first; }
   int id2() const { return t1_t2_ids.second; }
 
+  void set_id1(int i) { t1_t2_ids.first=i; }
+  void set_id2(int i) { t1_t2_ids.second=i; }
+
   // construct the intersection point from the info stored
   typename Kernel::Point_3
   point(const typename Kernel::Point_3& p1,
@@ -124,12 +132,13 @@ struct Point_on_triangle
         const typename Kernel::Point_3& r2,
         const Kernel& k) const
   {
-    if (t1_t2_ids.first==-1)
+    if (t1_t2_ids.second<0)
       return point_from_id(p2,q2,r2,t1_t2_ids.second);
-    if (t1_t2_ids.second==-1)
+    if (t1_t2_ids.first<0)
       return point_from_id(p1,q1,r1,t1_t2_ids.first);
 
-    return k.construct_barycenter_3_object()(point_from_id(p1,q1,r1,(t1_t2_ids.first+1)%3), alpha, point_from_id(p1,q1,r1,t1_t2_ids.first)) ;
+    return k.construct_barycenter_3_object()(point_from_id(p1,q1,r1,-(t1_t2_ids.first)%3), alpha,
+                                             point_from_id(p1,q1,r1,-t1_t2_ids.first)) ;
   }
 };
 
@@ -160,153 +169,50 @@ intersection(const Point_on_triangle<Kernel>& p,
   typename Kernel::Compute_alpha_for_coplanar_triangle_intersection_3 compute_alpha
     = k.compute_alpha_for_coplanar_triangle_intersection_3_object();
   typedef Point_on_triangle<Kernel> Pot;
-  switch(p.id1())
+
+  auto common_edge_id = [](int pid, int qid)
   {
-    case -1:
+    if (pid==0 || qid==0) return 0;
+    if (pid<0)
     {
-      switch(q.id1())
+      if (qid<0)
       {
-        case -1: // A: (-1, ip2) - (-1, iq2)
-        {
-          CGAL_assertion((p.id2()+1)%3 == q.id2() || (q.id2()+1)%3 == p.id2());
-//          CGAL_assertion(p.extra_t1.empty() && q.extra_t1.empty());  // TMP to see if it's worth implementing special case
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-          std::cout << " -- case 1\n";
-#endif
-          typename Kernel::FT alpha = compute_alpha(p1, q1,
-                                                    Pot::point_from_id(p2, q2, r2, p.id2()),
-                                                    Pot::point_from_id(p2, q2, r2, q.id2()));
-          int id2 = (p.id2()+1)%3 == q.id2() ? p.id2() : q.id2();
-          return  Point_on_triangle<Kernel>(edge_id_t1, id2, alpha); // intersection with an original edge of t2
-        }
-        default:
-          if (q.id2()!=-1) // B: (-1, ip2) - (iq1, iq2)
-          {
-            if (p.id2() == q.id2() || p.id2() == (q.id2()+1)%3)
-            {
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-              std::cout << " -- case 2\n";
-#endif
-              // points are on the same edge of t2 --> we shorten an already cut edge
-              typename Kernel::FT alpha = compute_alpha(p1, q1,
-                                                        Pot::point_from_id(p2, q2, r2,  q.id2()),
-                                                        Pot::point_from_id(p2, q2, r2, (q.id2()+1)%3));
-
-              return  Point_on_triangle<Kernel>(edge_id_t1, q.id2(), alpha);
-            }
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-            std::cout << " -- case 3\n";
-#endif
-            // point of t1: look for an edge of t1 containing both points
-            CGAL_assertion( p.extra_t1.count(q.id1())!=0 || p.extra_t1.count(3-q.id1()-edge_id_t1)!=0 );
-            int eid1 = p.extra_t1.count(q.id1())!=0 ? q.id1() : 3-q.id1()-edge_id_t1;
-            return  Point_on_triangle<Kernel>((eid1+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3, -1); // vertex of t1
-          }
-          // C: (-1, ip2) - (iq1, -1)
-          //vertex of t1, special case t1 edge passed thru a vertex of t2
-          CGAL_assertion(edge_id_t1 == 2);
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-          std::cout << " -- case 4\n";
-#endif
-          CGAL_assertion(q.id1()==1);
-          CGAL_assertion(!p.extra_t1.empty());
-          return  Point_on_triangle<Kernel>(p.extra_t1.count(0)==1?0:2,-1);
+        return (-pid)%3==-qid-1 ? -pid:-qid;
+      }
+      else
+      {
+        return (-pid==qid || (qid)%3==-pid-1) ? qid : 0;
       }
     }
-    default:
+    else
     {
-      switch(p.id2())
+      if (qid<0)
       {
-        case -1:
-        {
-          switch(q.id1())
-          {
-            case -1: // G: (ip1, -1) - (-1, iq2)
-              //vertex of t1, special case t1 edge passed thru a vertex of t2
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-              std::cout << " -- case 5\n";
-#endif
-              CGAL_assertion(edge_id_t1 == 2);
-              CGAL_assertion(p.id1()==1);
-              CGAL_assertion(!q.extra_t1.empty());
-              return  Point_on_triangle<Kernel>(q.extra_t1.count(0)==1?0:2,-1);
-            default:
-            {
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-              std::cout << " -- case 6\n";
-#endif
-              CGAL_assertion(q.id2()!=-1); // I: (ip1, -1) - (iq2, -1)
-              //H: (ip1,-1), (iq1, iq2)
-              CGAL_assertion(edge_id_t1==2);
-              // p and q are on the same edge of t1
-              CGAL_assertion(p.id1()==q.id1() || p.id1()==(q.id1()+1)%3);
-              return  Point_on_triangle<Kernel>((q.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3 , -1);
-            }
-          }
-        }
-        default:
-        {
-          switch(q.id1())
-          {
-            case -1: // D: (ip1, ip2) - (-1, iq2)
-            {
-              if (q.id2() == p.id2() || q.id2() == (p.id2()+1)%3)
-              {
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-                std::cout << " -- case 7\n";
-#endif
-                // points are on the same edge of t2 --> we shorten an already cut edge
-                typename Kernel::FT alpha = compute_alpha(p1, q1,
-                                                          Pot::point_from_id(p2, q2, r2,  p.id2()),
-                                                          Pot::point_from_id(p2, q2, r2, (p.id2()+1)%3));
-
-                return  Point_on_triangle<Kernel>(edge_id_t1, p.id2(), alpha);
-              }
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-              std::cout << " -- case 8\n";
-#endif
-              // point of t1
-              //std::cout << "q.extra_t1: "; for(int qet1 : q.extra_t1) std::cout << " " << qet1; std::cout << "\n";
-              CGAL_assertion( q.extra_t1.count(p.id1())!=0 || q.extra_t1.count(3-p.id1()-edge_id_t1)!=0 );
-              int eid1 = q.extra_t1.count(p.id1())!=0 ? p.id1() : 3-p.id1()-edge_id_t1;
-              return  Point_on_triangle<Kernel>((eid1+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3, -1); // vertex of t1
-            }
-            default:
-            {
-              switch(q.id2())
-              {
-                case -1: // F: (ip1, ip2) - (iq1, -1)
-                {
-                  // p and q are on the same edge of t1
-                  CGAL_assertion(q.id1()==p.id1() ||  q.id1()==(p.id1()+1)%3);
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-                  std::cout << " -- case 9\n";
-#endif
-                  return  Point_on_triangle<Kernel>((p.id1()+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3 , -1);
-                }
-                default: // E: (ip1, ip2) - (iq1, iq2)
-                {
-                  if (p.id2()==q.id2())
-                  {
-#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-                    std::cout << " -- case 10\n";
-#endif
-                    typename Kernel::FT alpha = compute_alpha(p1, q1,
-                                                              Pot::point_from_id(p2, q2, r2,  q.id2()),
-                                                              Pot::point_from_id(p2, q2, r2, (q.id2()+1)%3));
-                    return  Point_on_triangle<Kernel>(edge_id_t1, q.id2(), alpha);
-                  }
-                  // we are intersecting an edge of t1
-                  CGAL_assertion(p.id1()==q.id1() || edge_id_t1==2);
-                  int eid1 = p.id1()==q.id1() ? p.id1() : 1;
-                  return  Point_on_triangle<Kernel>((eid1+1)%3==edge_id_t1?edge_id_t1:(edge_id_t1+1)%3, -1); // vertex of t1
-                }
-              }
-            }
-          }
-        }
+        return (-qid==pid || (pid)%3==-qid-1) ? pid : 0;
+      }
+      else
+      {
+        return pid==qid ? pid : 0;
       }
     }
+  };
+
+  int common_eid1 = common_edge_id(p.id1(), q.id1());
+  int common_eid2 = common_edge_id(p.id2(), q.id2());
+
+  if (common_eid1!=0)
+  {
+    CGAL_assertion( (common_eid1)%3==edge_id_t1-1 || (edge_id_t1)%3==common_eid1-1 );
+    int pid1 = (common_eid1)%3==edge_id_t1-1? -edge_id_t1:-common_eid1;
+    return Point_on_triangle<Kernel>(pid1, common_eid2);
+  }
+  else
+  {
+    CGAL_assertion(common_eid2!=0);
+    typename Kernel::FT alpha = compute_alpha(p1, q1,
+                                              Pot::point_from_id(p2, q2, r2, -common_eid2),
+                                              Pot::point_from_id(p2, q2, r2, -(common_eid2)%3-1));
+    return Point_on_triangle<Kernel>(edge_id_t1, common_eid2, alpha);
   }
 }
 
@@ -336,8 +242,17 @@ void intersection_coplanar_triangles_cutoff(const typename Kernel::Point_3& p1,
   for (Point_on_triangle<Kernel>& pot : inter_pts)
   {
     orientations[ &pot ]=pot.orientation(p1,q1,r1,edge_id,p2,q2,r2,k);
-    if (pot.id1()==-1 && orientations[ &pot ]==COLLINEAR)
-      pot.extra_t1.insert(edge_id);
+    if (orientations[ &pot ]==COLLINEAR)
+    {
+      if (pot.id1()==0)
+        pot.set_id1(edge_id);
+      else
+      {
+        CGAL_assertion(pot.id1()>0);
+        CGAL_assertion((edge_id)%3==pot.id1()-1 || (pot.id1())%3==edge_id-1);
+        pot.set_id1( (edge_id)%3==pot.id1()-1 ? -pot.id1(): -edge_id );
+      }
+    }
   }
 
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
@@ -411,30 +326,30 @@ intersection_coplanar_triangles(const typename K::Triangle_3& t1,
                              r2 = t2.vertex(2);
 
   std::list<Point_on_triangle<K>> inter_pts;
-  inter_pts.push_back(Point_on_triangle<K>(-1,0));
-  inter_pts.push_back(Point_on_triangle<K>(-1,1));
-  inter_pts.push_back(Point_on_triangle<K>(-1,2));
+  inter_pts.push_back(Point_on_triangle<K>(0,-1));
+  inter_pts.push_back(Point_on_triangle<K>(0,-2));
+  inter_pts.push_back(Point_on_triangle<K>(0,-3));
 
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   auto print_points = [&]()
   {
-    for(auto p : inter_pts) std::cout << "  (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) "; std::cout <<"\n";
+    for(auto p : inter_pts) {std::cout << "  (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) ";} std::cout <<"\n";
   };
   std::cout << "  ipts size: " << inter_pts.size() << "\n";
   print_points();
 #endif
   //intersect t2 with the three half planes which intersection defines t1
-  intersection_coplanar_triangles_cutoff(p1,q1,r1,0,p2,q2,r2,k,inter_pts); //line pq
+  intersection_coplanar_triangles_cutoff(p1,q1,r1,1,p2,q2,r2,k,inter_pts); //line pq
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "  ipts size: " << inter_pts.size() << "\n";
   print_points();
 #endif
-  intersection_coplanar_triangles_cutoff(q1,r1,p1,1,p2,q2,r2,k,inter_pts); //line qr
+  intersection_coplanar_triangles_cutoff(q1,r1,p1,2,p2,q2,r2,k,inter_pts); //line qr
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "  ipts size: " << inter_pts.size() << "\n";
   print_points();
 #endif
-  intersection_coplanar_triangles_cutoff(r1,p1,q1,2,p2,q2,r2,k,inter_pts); //line rp
+  intersection_coplanar_triangles_cutoff(r1,p1,q1,3,p2,q2,r2,k,inter_pts); //line rp
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "  ipts size: " << inter_pts.size() << "\n";
   print_points();

From b9232b36772dd7ebb1a3cad8773474b02ccb6d20 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 18 Jan 2024 10:56:36 +0100
Subject: [PATCH 1288/1398] fix bad indices

---
 .../internal/Triangle_3_Triangle_3_intersection.h        | 9 +++------
 1 file changed, 3 insertions(+), 6 deletions(-)

diff --git a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
index 37fc2aa19148..471904cd97ab 100644
--- a/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
+++ b/Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
@@ -137,7 +137,7 @@ struct Point_on_triangle
     if (t1_t2_ids.first<0)
       return point_from_id(p1,q1,r1,t1_t2_ids.first);
 
-    return k.construct_barycenter_3_object()(point_from_id(p1,q1,r1,-(t1_t2_ids.first)%3), alpha,
+    return k.construct_barycenter_3_object()(point_from_id(p1,q1,r1,-(t1_t2_ids.first)%3-1), alpha,
                                              point_from_id(p1,q1,r1,-t1_t2_ids.first)) ;
   }
 };
@@ -164,7 +164,7 @@ intersection(const Point_on_triangle<Kernel>& p,
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   std::cout << "    calling intersection: ";
   std::cout << " (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) -";
-  std::cout << " (" << q.id1() << "," << q.id2() << ",[" << q.alpha << "]) || e" << edge_id_t1;
+  std::cout << " (" << q.id1() << "," << q.id2() << ",[" << q.alpha << "]) || e" << edge_id_t1 << "\n";
 #endif
   typename Kernel::Compute_alpha_for_coplanar_triangle_intersection_3 compute_alpha
     = k.compute_alpha_for_coplanar_triangle_intersection_3_object();
@@ -333,25 +333,22 @@ intersection_coplanar_triangles(const typename K::Triangle_3& t1,
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
   auto print_points = [&]()
   {
+    std::cout << "  ipts size: " << inter_pts.size() << "\n";
     for(auto p : inter_pts) {std::cout << "  (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) ";} std::cout <<"\n";
   };
-  std::cout << "  ipts size: " << inter_pts.size() << "\n";
   print_points();
 #endif
   //intersect t2 with the three half planes which intersection defines t1
   intersection_coplanar_triangles_cutoff(p1,q1,r1,1,p2,q2,r2,k,inter_pts); //line pq
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-  std::cout << "  ipts size: " << inter_pts.size() << "\n";
   print_points();
 #endif
   intersection_coplanar_triangles_cutoff(q1,r1,p1,2,p2,q2,r2,k,inter_pts); //line qr
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-  std::cout << "  ipts size: " << inter_pts.size() << "\n";
   print_points();
 #endif
   intersection_coplanar_triangles_cutoff(r1,p1,q1,3,p2,q2,r2,k,inter_pts); //line rp
 #ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
-  std::cout << "  ipts size: " << inter_pts.size() << "\n";
   print_points();
 #endif
 

From 61461b14b3981d3f2582808ddc2ef9f3c06447a3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 18 Jan 2024 10:57:17 +0100
Subject: [PATCH 1289/1398] more debug and fix indices

---
 .../Polygon_mesh_processing/autorefinement.h  | 95 ++++++++++++++-----
 1 file changed, 73 insertions(+), 22 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 1cb0e3aaa4d8..50e7c5b361e5 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -250,7 +250,6 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
 
 
 // imported from Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
-#warning TODO fill the indices correctly
 template<class K>
 void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
                             const std::array<typename K::Point_3, 3>& t2,
@@ -260,18 +259,37 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
   const typename K::Point_3& p2 = t2[0], q2 = t2[1], r2 = t2[2];
 
   std::list<Intersections::internal::Point_on_triangle<K>> l_inter_pts;
-  l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(-1,0));
-  l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(-1,1));
-  l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(-1,2));
+  l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(0,-1));
+  l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(0,-2));
+  l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(0,-3));
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  auto print_points = [&]()
+  {
+    std::cout << "  ipts size: " << l_inter_pts.size() << "\n";
+    for(auto p : l_inter_pts) {std::cout << "  (" << p.id1() << "," << p.id2() << ",[" << p.alpha << "]) ";} std::cout <<"\n";
+  };
+#endif
 
   //intersect t2 with the three half planes which intersection defines t1
   K k;
-  Intersections::internal::intersection_coplanar_triangles_cutoff(p1,q1,r1,0,p2,q2,r2,k,l_inter_pts); //line p1q1
-  Intersections::internal::intersection_coplanar_triangles_cutoff(q1,r1,p1,1,p2,q2,r2,k,l_inter_pts); //line q1r1
-  Intersections::internal::intersection_coplanar_triangles_cutoff(r1,p1,q1,2,p2,q2,r2,k,l_inter_pts); //line r1p1
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  print_points();
+#endif
+  Intersections::internal::intersection_coplanar_triangles_cutoff(p1,q1,r1,1,p2,q2,r2,k,l_inter_pts); //line p1q1
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  print_points();
+#endif
+  Intersections::internal::intersection_coplanar_triangles_cutoff(q1,r1,p1,2,p2,q2,r2,k,l_inter_pts); //line q1r1
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  print_points();
+#endif
+  Intersections::internal::intersection_coplanar_triangles_cutoff(r1,p1,q1,3,p2,q2,r2,k,l_inter_pts); //line r1p1
+#ifdef CGAL_DEBUG_COPLANAR_T3_T3_INTERSECTION
+  print_points();
+#endif
 
   for (const Intersections::internal::Point_on_triangle<K>& pot : l_inter_pts)
-    inter_pts.emplace_back(pot.point(p1,q1,r1,p2,q2,r2,k), 0, 0);
+    inter_pts.emplace_back(pot.point(p1,q1,r1,p2,q2,r2,k), pot.id1(), pot.id2());
 }
 
 // imported from Polygon_mesh_processing/internal/Corefinement/intersect_triangle_and_segment_3.h
@@ -891,8 +909,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   Visitor visitor(choose_parameter<Visitor>(get_parameter(np, internal_np::visitor)));
 
 
-  //~ constexpr bool parallel_execution = std::is_same_v<Parallel_tag, Concurrency_tag>;
-  constexpr bool parallel_execution = false;
+  constexpr bool parallel_execution = std::is_same_v<Parallel_tag, Concurrency_tag>;
 
 #ifndef CGAL_LINKED_WITH_TBB
   static_assert (!parallel_execution,
@@ -994,43 +1011,63 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
     if (!inter_pts.empty())
     {
-      auto get_ipt_id1 = [](const std::tuple<EK::Point_3, int, int>& tpl)
-      {
-        if (get<1>(tpl)<0) return -get<1>(tpl)-1;
-      };
-      auto get_ipt_id2 = [](const std::tuple<EK::Point_3, int, int>& tpl)
-      {
-        if (get<2>(tpl)<0) return -get<2>(tpl)-1;
-      };
-
-
       std::size_t nbi = inter_pts.size();
       switch(nbi)
       {
         #warning TODO use inter pt info
         case 1:
           if (get<1>(inter_pts[0])>=0)
+          {
             all_triangle_data[i1].points.push_back(get<0>(inter_pts[0]));
+            CGAL_assertion(get<0>(inter_pts[0])!=t1[0]);
+            CGAL_assertion(get<0>(inter_pts[0])!=t1[1]);
+            CGAL_assertion(get<0>(inter_pts[0])!=t1[2]);
+          }
           if (get<2>(inter_pts[0])>=0)
+          {
             all_triangle_data[i2].points.push_back(get<0>(inter_pts[0]));
+            CGAL_assertion(get<0>(inter_pts[0])!=t2[0]);
+            CGAL_assertion(get<0>(inter_pts[0])!=t2[1]);
+            CGAL_assertion(get<0>(inter_pts[0])!=t2[2]);
+          }
         break;
         case 2:
         {
           std::size_t src_id=get<1>(inter_pts[0])<0?(-get<1>(inter_pts[0])-1):all_triangle_data[i1].points.size();
           if (get<1>(inter_pts[0])>=0)
+          {
             all_triangle_data[i1].points.push_back(get<0>(inter_pts[0]));
+            CGAL_assertion(get<0>(inter_pts[0])!=t1[0]);
+            CGAL_assertion(get<0>(inter_pts[0])!=t1[1]);
+            CGAL_assertion(get<0>(inter_pts[0])!=t1[2]);
+          }
           std::size_t tgt_id=get<1>(inter_pts[1])<0?(-get<1>(inter_pts[1])-1):all_triangle_data[i1].points.size();
           if (get<1>(inter_pts[1])>=0)
+          {
             all_triangle_data[i1].points.push_back(get<0>(inter_pts[1]));
+            CGAL_assertion(get<0>(inter_pts[1])!=t1[0]);
+            CGAL_assertion(get<0>(inter_pts[1])!=t1[1]);
+            CGAL_assertion(get<0>(inter_pts[1])!=t1[2]);
+          }
           all_triangle_data[i1].segments.emplace_back(src_id, tgt_id);
           all_triangle_data[i1].segment_input_triangle_ids.push_back(i2);
           //
           src_id=get<2>(inter_pts[0])<0?(-get<2>(inter_pts[0])-1):all_triangle_data[i2].points.size();
           if (get<2>(inter_pts[0])>=0)
+          {
             all_triangle_data[i2].points.push_back(get<0>(inter_pts[0]));
+            CGAL_assertion(get<0>(inter_pts[0])!=t2[0]);
+            CGAL_assertion(get<0>(inter_pts[0])!=t2[1]);
+            CGAL_assertion(get<0>(inter_pts[0])!=t2[2]);
+          }
           tgt_id=get<2>(inter_pts[1])<0?(-get<2>(inter_pts[1])-1):all_triangle_data[i2].points.size();
           if (get<2>(inter_pts[1])>=0)
+          {
             all_triangle_data[i2].points.push_back(get<0>(inter_pts[1]));
+            CGAL_assertion(get<0>(inter_pts[1])!=t2[0]);
+            CGAL_assertion(get<0>(inter_pts[1])!=t2[1]);
+            CGAL_assertion(get<0>(inter_pts[1])!=t2[2]);
+          }
           all_triangle_data[i2].segments.emplace_back(src_id, tgt_id);
           all_triangle_data[i2].segment_input_triangle_ids.push_back(i1);
         }
@@ -1047,8 +1084,21 @@ void autorefine_triangle_soup(PointRange& soup_points,
           {
             std::size_t id1=get<1>(inter_pts[i])<0?(-get<1>(inter_pts[i])-1):all_triangle_data[i1].points.size();
             std::size_t id2=get<2>(inter_pts[i])<0?(-get<2>(inter_pts[i])-1):all_triangle_data[i2].points.size();
-            if (get<1>(inter_pts[i])>=0) all_triangle_data[i1].points.push_back(get<0>(inter_pts[i]));
-            if (get<2>(inter_pts[i])>=0) all_triangle_data[i2].points.push_back(get<0>(inter_pts[i]));
+            if (get<1>(inter_pts[i])>=0)
+            {
+              all_triangle_data[i1].points.push_back(get<0>(inter_pts[i]));
+              CGAL_assertion(get<0>(inter_pts[i])!=t1[0]);
+              CGAL_assertion(get<0>(inter_pts[i])!=t1[1]);
+              CGAL_assertion(get<0>(inter_pts[i])!=t1[2]);
+            }
+
+            if (get<2>(inter_pts[i])>=0)
+            {
+              all_triangle_data[i2].points.push_back(get<0>(inter_pts[i]));
+              CGAL_assertion(get<0>(inter_pts[i])!=t2[0]);
+              CGAL_assertion(get<0>(inter_pts[i])!=t2[1]);
+              CGAL_assertion(get<0>(inter_pts[i])!=t2[2]);
+            }
             ipt_ids1[i]=id1;
             ipt_ids2[i]=id2;
           }
@@ -1147,6 +1197,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
       filtered_in_triangle_ids.swap(all_triangle_data[ti].segment_input_triangle_ids);
       filtered_segments.swap(segments);
 
+      CGAL_assertion(points.size()-3==std::set<EK::Point_3>(std::next(points.begin(),3), points.end()).size());
       CGAL_assertion(points.size()==std::set<EK::Point_3>(points.begin(), points.end()).size());
     }
   };

From 81d293891007be8eea4fdaf087066f7e845d2467 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 18 Jan 2024 13:26:36 +0100
Subject: [PATCH 1290/1398] collect on-edge information and do not collect
 segments on the same edge

---
 .../Polygon_mesh_processing/autorefinement.h  | 169 ++++++++++--------
 1 file changed, 93 insertions(+), 76 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 50e7c5b361e5..400e8641de8a 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -485,9 +485,58 @@ bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
 //TODO: rename struct
 struct Triangle_data
 {
-  std::vector<Exact_predicates_exact_constructions_kernel::Point_3> points;
+  using Point_3 = Exact_predicates_exact_constructions_kernel::Point_3;
+  std::vector<Point_3> points;
+  std::vector<int> point_locations;
   std::vector<std::pair<std::size_t,std::size_t>> segments;
   std::vector<std::size_t> segment_input_triangle_ids;
+  template <int i>
+  std::size_t add_point(const std::tuple<Point_3,int, int>& tpl)
+  {
+    if (get<i>(tpl) < 0)
+      return -get<i>(tpl)-1;
+    points.push_back(get<0>(tpl));
+    point_locations.push_back(get<i>(tpl));
+    return points.size()-1;
+  }
+
+#ifndef NDEBUG
+  bool on_same_edge(std::size_t i, std::size_t j)
+#else
+  bool on_same_edge_debug(std::size_t i, std::size_t j)
+#endif
+  {
+    if (point_locations[i]==0 || point_locations[j]==0) return false;
+    if (point_locations[i]>0)
+    {
+      if (point_locations[j]>0)
+        return point_locations[i]==point_locations[j];
+      return -point_locations[j]==point_locations[i] || point_locations[i]%3+1==-point_locations[j];
+    }
+    if (point_locations[j]<0)
+      return true;
+    return -point_locations[i]==point_locations[j] || point_locations[j]%3+1==-point_locations[i];
+  }
+#ifdef NDEBUG
+  bool on_same_edge(std::size_t i, std::size_t j)
+  {
+    bool on = on_same_edge_debug(i,j);
+    if (!on) return false;
+    int eid = point_locations[i]>0 ? point_locations[i] : point_locations[j];
+    if (eid<0) return true;
+    if (!(collinear(points[eid-1], points[(eid)%3], points[i])))
+    {
+      std::cout << point_locations[i] << " " << point_locations[j] << " " << eid << "\n";
+    }
+    if (!(collinear(points[eid-1], points[(eid)%3], points[j])))
+    {
+      std::cout << point_locations[i] << " " << point_locations[j] << " " << eid << "\n";
+    }
+    CGAL_assertion(collinear(points[eid-1], points[(eid)%3], points[i]));
+    CGAL_assertion(collinear(points[eid-1], points[(eid)%3], points[j]));
+    return true;
+  }
+#endif
 };
 
 template <class EK,
@@ -982,6 +1031,10 @@ void autorefine_triangle_soup(PointRange& soup_points,
     all_triangle_data[tid].points[0]=triangles[tri_inter_ids[f]][0];
     all_triangle_data[tid].points[1]=triangles[tri_inter_ids[f]][1];
     all_triangle_data[tid].points[2]=triangles[tri_inter_ids[f]][2];
+    all_triangle_data[tid].point_locations.resize(3);
+    all_triangle_data[tid].point_locations[0]=-1;
+    all_triangle_data[tid].point_locations[1]=-2;
+    all_triangle_data[tid].point_locations[2]=-3;
   }
 
   CGAL_PMP_AUTOREFINE_VERBOSE("compute intersections");
@@ -1016,99 +1069,52 @@ void autorefine_triangle_soup(PointRange& soup_points,
       {
         #warning TODO use inter pt info
         case 1:
-          if (get<1>(inter_pts[0])>=0)
-          {
-            all_triangle_data[i1].points.push_back(get<0>(inter_pts[0]));
-            CGAL_assertion(get<0>(inter_pts[0])!=t1[0]);
-            CGAL_assertion(get<0>(inter_pts[0])!=t1[1]);
-            CGAL_assertion(get<0>(inter_pts[0])!=t1[2]);
-          }
-          if (get<2>(inter_pts[0])>=0)
-          {
-            all_triangle_data[i2].points.push_back(get<0>(inter_pts[0]));
-            CGAL_assertion(get<0>(inter_pts[0])!=t2[0]);
-            CGAL_assertion(get<0>(inter_pts[0])!=t2[1]);
-            CGAL_assertion(get<0>(inter_pts[0])!=t2[2]);
-          }
+          all_triangle_data[i1].add_point<1>(inter_pts[0]);
+          all_triangle_data[i2].add_point<2>(inter_pts[0]);
         break;
         case 2:
         {
-          std::size_t src_id=get<1>(inter_pts[0])<0?(-get<1>(inter_pts[0])-1):all_triangle_data[i1].points.size();
-          if (get<1>(inter_pts[0])>=0)
-          {
-            all_triangle_data[i1].points.push_back(get<0>(inter_pts[0]));
-            CGAL_assertion(get<0>(inter_pts[0])!=t1[0]);
-            CGAL_assertion(get<0>(inter_pts[0])!=t1[1]);
-            CGAL_assertion(get<0>(inter_pts[0])!=t1[2]);
-          }
-          std::size_t tgt_id=get<1>(inter_pts[1])<0?(-get<1>(inter_pts[1])-1):all_triangle_data[i1].points.size();
-          if (get<1>(inter_pts[1])>=0)
+          std::size_t src_id=all_triangle_data[i1].add_point<1>(inter_pts[0]),
+                      tgt_id=all_triangle_data[i1].add_point<1>(inter_pts[1]);
+          if (!all_triangle_data[i1].on_same_edge(src_id, tgt_id))
           {
-            all_triangle_data[i1].points.push_back(get<0>(inter_pts[1]));
-            CGAL_assertion(get<0>(inter_pts[1])!=t1[0]);
-            CGAL_assertion(get<0>(inter_pts[1])!=t1[1]);
-            CGAL_assertion(get<0>(inter_pts[1])!=t1[2]);
+            all_triangle_data[i1].segments.emplace_back(src_id, tgt_id);
+            all_triangle_data[i1].segment_input_triangle_ids.push_back(i2);
           }
-          all_triangle_data[i1].segments.emplace_back(src_id, tgt_id);
-          all_triangle_data[i1].segment_input_triangle_ids.push_back(i2);
           //
-          src_id=get<2>(inter_pts[0])<0?(-get<2>(inter_pts[0])-1):all_triangle_data[i2].points.size();
-          if (get<2>(inter_pts[0])>=0)
+          src_id=all_triangle_data[i2].add_point<2>(inter_pts[0]);
+          tgt_id=all_triangle_data[i2].add_point<2>(inter_pts[1]);
+          if (!all_triangle_data[i2].on_same_edge(src_id, tgt_id))
           {
-            all_triangle_data[i2].points.push_back(get<0>(inter_pts[0]));
-            CGAL_assertion(get<0>(inter_pts[0])!=t2[0]);
-            CGAL_assertion(get<0>(inter_pts[0])!=t2[1]);
-            CGAL_assertion(get<0>(inter_pts[0])!=t2[2]);
+            all_triangle_data[i2].segments.emplace_back(src_id, tgt_id);
+            all_triangle_data[i2].segment_input_triangle_ids.push_back(i1);
           }
-          tgt_id=get<2>(inter_pts[1])<0?(-get<2>(inter_pts[1])-1):all_triangle_data[i2].points.size();
-          if (get<2>(inter_pts[1])>=0)
-          {
-            all_triangle_data[i2].points.push_back(get<0>(inter_pts[1]));
-            CGAL_assertion(get<0>(inter_pts[1])!=t2[0]);
-            CGAL_assertion(get<0>(inter_pts[1])!=t2[1]);
-            CGAL_assertion(get<0>(inter_pts[1])!=t2[2]);
-          }
-          all_triangle_data[i2].segments.emplace_back(src_id, tgt_id);
-          all_triangle_data[i2].segment_input_triangle_ids.push_back(i1);
         }
         break;
         default:
         {
           std::vector<std::size_t> ipt_ids1(nbi+1), ipt_ids2(nbi+1);
-          all_triangle_data[i1].segment_input_triangle_ids.insert(
-            all_triangle_data[i1].segment_input_triangle_ids.end(), nbi, i2);
-          all_triangle_data[i2].segment_input_triangle_ids.insert(
-            all_triangle_data[i2].segment_input_triangle_ids.end(), nbi, i1);
 
           for (std::size_t i=0;i<nbi; ++i)
           {
-            std::size_t id1=get<1>(inter_pts[i])<0?(-get<1>(inter_pts[i])-1):all_triangle_data[i1].points.size();
-            std::size_t id2=get<2>(inter_pts[i])<0?(-get<2>(inter_pts[i])-1):all_triangle_data[i2].points.size();
-            if (get<1>(inter_pts[i])>=0)
-            {
-              all_triangle_data[i1].points.push_back(get<0>(inter_pts[i]));
-              CGAL_assertion(get<0>(inter_pts[i])!=t1[0]);
-              CGAL_assertion(get<0>(inter_pts[i])!=t1[1]);
-              CGAL_assertion(get<0>(inter_pts[i])!=t1[2]);
-            }
-
-            if (get<2>(inter_pts[i])>=0)
-            {
-              all_triangle_data[i2].points.push_back(get<0>(inter_pts[i]));
-              CGAL_assertion(get<0>(inter_pts[i])!=t2[0]);
-              CGAL_assertion(get<0>(inter_pts[i])!=t2[1]);
-              CGAL_assertion(get<0>(inter_pts[i])!=t2[2]);
-            }
-            ipt_ids1[i]=id1;
-            ipt_ids2[i]=id2;
+            ipt_ids1[i]=all_triangle_data[i1].add_point<1>(inter_pts[i]);
+            ipt_ids2[i]=all_triangle_data[i2].add_point<2>(inter_pts[i]);
           }
           ipt_ids1.back()=ipt_ids1.front();
           ipt_ids2.back()=ipt_ids2.front();
 
           for (std::size_t i=0;i<nbi; ++i)
           {
-            all_triangle_data[i1].segments.emplace_back(ipt_ids1[i], ipt_ids1[i+1]);
-            all_triangle_data[i2].segments.emplace_back(ipt_ids2[i], ipt_ids2[i+1]);
+            if (!all_triangle_data[i1].on_same_edge(ipt_ids1[i], ipt_ids1[i+1]))
+            {
+              all_triangle_data[i1].segments.emplace_back(ipt_ids1[i], ipt_ids1[i+1]);
+              all_triangle_data[i1].segment_input_triangle_ids.push_back(i2);
+            }
+            if (!all_triangle_data[i2].on_same_edge(ipt_ids2[i], ipt_ids2[i+1]))
+            {
+              all_triangle_data[i2].segments.emplace_back(ipt_ids2[i], ipt_ids2[i+1]);
+              all_triangle_data[i2].segment_input_triangle_ids.push_back(i1);
+            }
           }
         }
       }
@@ -1160,20 +1166,31 @@ void autorefine_triangle_soup(PointRange& soup_points,
         }
       }
 
-      //~ if (unique_ids.size()==indices.size())
-        //~ // TODO: do we want to keep points sorted? if yes always swap twice
-        //~ return; // no duplicates
+      CGAL_assertion(points.size() == all_triangle_data[ti].point_locations.size());
+      if (unique_ids.size()==indices.size())
+        // TODO: do we want to keep points sorted? if yes always swap the 3 containers
+        return; // no duplicates
 
       // now make points unique
       using EPoint_3 = EK::Point_3; // workaround for MSVC 2022 bug
       std::vector<EPoint_3> tmp;
+      std::vector<int> tmp_locations;
       tmp.reserve(unique_ids.size()+3);
+      tmp_locations.reserve(unique_ids.size()+3);
       tmp.push_back(points[0]);
       tmp.push_back(points[1]);
       tmp.push_back(points[2]);
+      tmp_locations.push_back(-1);
+      tmp_locations.push_back(-2);
+      tmp_locations.push_back(-3);
       for(std::size_t i : unique_ids)
+      {
         tmp.push_back(points[i]);
+        tmp_locations.push_back(all_triangle_data[ti].point_locations[i]);
+      }
       tmp.swap(points);
+      tmp_locations.swap(all_triangle_data[ti].point_locations);
+      CGAL_assertion(points.size() == all_triangle_data[ti].point_locations.size());
 
       // now make segments unique
       std::size_t nbs = segments.size();
@@ -1240,7 +1257,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
   auto refine_triangles = [&](std::size_t ti)
   {
-    if (all_triangle_data[ti].points.empty())
+    if (all_triangle_data[ti].points.size()==3)
       new_triangles.push_back({triangles[ti], ti});
     else
     {

From 0095748cd7a5ab55eb82767b82f4e68e9e051ec5 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Thu, 18 Jan 2024 14:42:47 +0100
Subject: [PATCH 1291/1398] insert points directly on edges

---
 .../Polygon_mesh_processing/autorefinement.h  | 60 +++++++++++++++++--
 1 file changed, 55 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 400e8641de8a..dcd6a0664abc 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -582,9 +582,8 @@ void generate_subtriangles(std::size_t ti,
 #define CGAL_AUTOREF_COUNTER_INSTRUCTION(X)
 #endif
 
-  #warning TODO
-
   std::vector<Exact_predicates_exact_constructions_kernel::Point_3>& points=triangle_data.points;
+  std::vector<int>& point_locations=triangle_data.point_locations;
   std::vector<std::pair<std::size_t, std::size_t>>& segments=triangle_data.segments;
   std::vector<std::size_t>& in_triangle_ids=triangle_data.segment_input_triangle_ids;
 
@@ -611,7 +610,10 @@ void generate_subtriangles(std::size_t ti,
     {
       auto insert_res = point_id_map.insert(std::make_pair(pt, points.size()));
       if (insert_res.second)
+      {
         points.push_back(pt);
+        point_locations.push_back(0);
+      }
       return insert_res.first->second;
     };
 
@@ -840,8 +842,57 @@ void generate_subtriangles(std::size_t ti,
   vhandles[2]->set_point(t[2]);
 
   // insert points and fill vhandles
-  std::vector<std::size_t> indices(triangle_data.points.size()-3);
-  std::iota(indices.begin(), indices.end(), 3);
+
+  //start by points on edges
+  std::array<std::vector<std::size_t>, 3> indices_on_edges;
+  std::vector<std::size_t> indices;
+  for (std::size_t i=3; i<points.size(); ++i)
+  {
+    if (point_locations[i]==0)
+      indices.push_back(i);
+    else
+    {
+      CGAL_assertion(point_locations[i]>0 && point_locations[i]<4);
+      indices_on_edges[point_locations[i]-1].push_back(i);
+    }
+  }
+
+  //sort points on edges and insert them
+  typename CDT::Vertex_handle vinf=cdt.infinite_vertex();
+  for (int i=0; i<3; ++i)
+  {
+    if (indices_on_edges[i].empty()) continue;
+    int src_id=i, tgt_id=(i+1)%3;
+    //look for a sort axis
+    int coord = 0;
+    if (points[src_id].x()==points[tgt_id].x())
+    {
+      coord=1;
+      if (points[src_id].y()==points[tgt_id].y())
+        coord=2;
+    }
+    if (points[src_id][coord]>points[tgt_id][coord])
+      std::swap(src_id, tgt_id);
+
+    std::sort(indices_on_edges[i].begin(), indices_on_edges[i].end(),
+              [&](std::size_t id1, std::size_t id2)
+              {
+                return points[id1][coord]<points[id2][coord];
+              });
+
+    std::size_t prev_id = src_id;
+    for(std::size_t id : indices_on_edges[i])
+    {
+      typename CDT::Face_handle fh;
+      CGAL_assertion_code(bool ok =)
+      cdt.is_face(vhandles[prev_id], vhandles[tgt_id],vinf, fh);
+      CGAL_assertion(ok);
+      vhandles[id]=cdt.insert_in_edge(points[id], fh, fh->index(vinf));
+      prev_id=id;
+    }
+  }
+
+  // then points in the interior
   typedef typename Pointer_property_map<typename EK::Point_3>::type Pmap;
   typedef Spatial_sort_traits_adapter_2<P_traits,Pmap> Search_traits;
   spatial_sort(indices.begin(), indices.end(),
@@ -1067,7 +1118,6 @@ void autorefine_triangle_soup(PointRange& soup_points,
       std::size_t nbi = inter_pts.size();
       switch(nbi)
       {
-        #warning TODO use inter pt info
         case 1:
           all_triangle_data[i1].add_point<1>(inter_pts[0]);
           all_triangle_data[i2].add_point<2>(inter_pts[0]);

From 272a242f1b049af73bc2530e660fba4a14093142 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 19 Jan 2024 10:06:03 +0100
Subject: [PATCH 1292/1398] restore delaunay in CDT + autoref and deduplicate
 identical points in no segments case

---
 .../Polygon_mesh_processing/autorefinement.h  | 26 +++++++++++++++++--
 .../Constrained_Delaunay_triangulation_2.h    | 19 ++++++++++++++
 2 files changed, 43 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index dcd6a0664abc..8de91af1da85 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -843,13 +843,22 @@ void generate_subtriangles(std::size_t ti,
 
   // insert points and fill vhandles
 
+#if 0
+  std::vector<std::size_t> indices(triangle_data.points.size()-3);
+  std::iota(indices.begin(), indices.end(), 3);
+#else
   //start by points on edges
   std::array<std::vector<std::size_t>, 3> indices_on_edges;
   std::vector<std::size_t> indices;
   for (std::size_t i=3; i<points.size(); ++i)
   {
     if (point_locations[i]==0)
+    {
+      CGAL_assertion(!collinear(points[0], points[1], points[i]));
+      CGAL_assertion(!collinear(points[1], points[2], points[i]));
+      CGAL_assertion(!collinear(points[2], points[0], points[i]));
       indices.push_back(i);
+    }
     else
     {
       CGAL_assertion(point_locations[i]>0 && point_locations[i]<4);
@@ -862,7 +871,7 @@ void generate_subtriangles(std::size_t ti,
   for (int i=0; i<3; ++i)
   {
     if (indices_on_edges[i].empty()) continue;
-    int src_id=i, tgt_id=(i+1)%3;
+    std::size_t src_id=i, tgt_id=(i+1)%3;
     //look for a sort axis
     int coord = 0;
     if (points[src_id].x()==points[tgt_id].x())
@@ -879,19 +888,32 @@ void generate_subtriangles(std::size_t ti,
               {
                 return points[id1][coord]<points[id2][coord];
               });
+    if (segments.empty()) // we might have intersection points duplicated
+    {
+      auto it=
+        std::unique(indices_on_edges[i].begin(), indices_on_edges[i].end(),
+                    [&](std::size_t id1, std::size_t id2)
+                    {
+                      return points[id1][coord]==points[id2][coord];
+                    });
+      indices_on_edges[i].erase(it, indices_on_edges[i].end());
+    }
 
     std::size_t prev_id = src_id;
     for(std::size_t id : indices_on_edges[i])
     {
+      CGAL_assertion(collinear(points[src_id], points[tgt_id], points[id]));
       typename CDT::Face_handle fh;
       CGAL_assertion_code(bool ok =)
       cdt.is_face(vhandles[prev_id], vhandles[tgt_id],vinf, fh);
       CGAL_assertion(ok);
       vhandles[id]=cdt.insert_in_edge(points[id], fh, fh->index(vinf));
+      cdt.restore_Delaunay(vhandles[id]); // TODO maybe not each time but one global?
+      CGAL_assertion(cdt.is_valid());
       prev_id=id;
     }
   }
-
+#endif
   // then points in the interior
   typedef typename Pointer_property_map<typename EK::Point_3>::type Pmap;
   typedef Spatial_sort_traits_adapter_2<P_traits,Pmap> Search_traits;
diff --git a/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h b/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
index 52c14ea54b78..714e9295b61f 100644
--- a/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Constrained_Delaunay_triangulation_2.h
@@ -342,6 +342,25 @@ class Constrained_Delaunay_triangulation_2
       return number_of_vertices() - n;
     }
 
+  // function usable only if no constraint has been inserted
+  void restore_Delaunay(Vertex_handle v)
+  {
+    if(this->dimension() <= 1) return;
+
+    Face_handle f=v->face();
+    Face_handle next;
+    int i;
+    Face_handle start(f);
+    do {
+      i = f->index(v);
+      next = f->neighbor(ccw(i));  // turn ccw around v
+      propagating_flip(f,i);
+      f = next;
+    } while(next != start);
+    return;
+  }
+
+
 #ifndef CGAL_TRIANGULATION_2_DONT_INSERT_RANGE_OF_POINTS_WITH_INFO
 private:
   //top stands for tuple-or-pair

From f520602a0dcbcefe0a28a346f11fd84b15249f34 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 19 Jan 2024 10:05:30 +0000
Subject: [PATCH 1293/1398] Comment #warning and qualify get() with std::

---
 .../CGAL/Polygon_mesh_processing/autorefinement.h  | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 8de91af1da85..c38d783572b4 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -468,10 +468,10 @@ bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
     }
   }
 
-  #warning TODO get rid of sort and unique calls
+//  #warning TODO get rid of sort and unique calls
   // because we don't handle intersection type and can have edge-edge edge-vertex duplicates
-  std::sort(inter_pts.begin(), inter_pts.end(), [](auto p, auto q){return get<0>(p)<get<0>(q);});
-  auto last = std::unique(inter_pts.begin(), inter_pts.end(), [](auto p, auto q){return get<0>(p)==get<0>(q);});
+  std::sort(inter_pts.begin(), inter_pts.end(), [](auto p, auto q){return std::get<0>(p)<std::get<0>(q);});
+  auto last = std::unique(inter_pts.begin(), inter_pts.end(), [](auto p, auto q){return std::get<0>(p)==std::get<0>(q);});
   inter_pts.erase(last, inter_pts.end());
 
 #ifdef CGAL_AUTOREF_DEBUG_DEPTH
@@ -493,10 +493,10 @@ struct Triangle_data
   template <int i>
   std::size_t add_point(const std::tuple<Point_3,int, int>& tpl)
   {
-    if (get<i>(tpl) < 0)
-      return -get<i>(tpl)-1;
-    points.push_back(get<0>(tpl));
-    point_locations.push_back(get<i>(tpl));
+    if (std::get<i>(tpl) < 0)
+      return -std::get<i>(tpl)-1;
+    points.push_back(std::get<0>(tpl));
+    point_locations.push_back(std::get<i>(tpl));
     return points.size()-1;
   }
 

From a783412ba77b6a0873bc62f2f4b5f09dde621548 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 9 Jan 2024 16:34:02 +0000
Subject: [PATCH 1294/1398] Use structural filtering for the fixed projection
 traits classes

---
 .../Kernel_23/internal/Projection_traits_3.h  | 11 ++-
 .../include/CGAL/Triangulation_2.h            | 95 +++++++++++++++----
 2 files changed, 89 insertions(+), 17 deletions(-)

diff --git a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
index dd4e24005a48..1cc09421944d 100644
--- a/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
+++ b/Kernel_23/include/CGAL/Kernel_23/internal/Projection_traits_3.h
@@ -20,6 +20,7 @@
 
 #include <CGAL/Kernel/global_functions_2.h>
 #include <CGAL/Kernel_23/internal/Has_boolean_tags.h>
+#include <CGAL/Triangulation_structural_filtering_traits.h>
 
 namespace CGAL {
 
@@ -1210,6 +1211,14 @@ class Projection_traits_3
 };
 
 
-} } //namespace CGAL::internal
+
+} // namespace internal
+
+template <class R, int dim>
+struct Triangulation_structural_filtering_traits<::CGAL::internal::Projection_traits_3<R,dim> > {
+  typedef typename Triangulation_structural_filtering_traits<R>::Use_structural_filtering_tag  Use_structural_filtering_tag;
+};
+
+ } //namespace CGAL
 
 #endif // CGAL_INTERNAL_PROJECTION_TRAITS_3_H
diff --git a/Triangulation_2/include/CGAL/Triangulation_2.h b/Triangulation_2/include/CGAL/Triangulation_2.h
index 14e8604640f1..c0f2c7ba50e0 100644
--- a/Triangulation_2/include/CGAL/Triangulation_2.h
+++ b/Triangulation_2/include/CGAL/Triangulation_2.h
@@ -35,6 +35,7 @@
 #include <CGAL/Triangulation_2/internal/Triangulation_line_face_circulator_2.h>
 #include <CGAL/spatial_sort.h>
 #include <CGAL/Spatial_sort_traits_adapter_2.h>
+#include <CGAL/Kernel_23/internal/Projection_traits_3.h>
 
 #include <CGAL/double.h>
 
@@ -434,6 +435,81 @@ class Triangulation_2
   bool has_inexact_negative_orientation(const Point &p, const Point &q,
                                         const Point &r) const;
 
+
+
+template <class T>
+inline
+bool
+projection_traits_has_inexact_negative_orientation(const Point &p, const Point &q, const Point &r,
+                                                   const T& ) const
+{
+  // So that this code works well with Lazy_kernel
+  internal::Static_filters_predicates::Get_approx<Point> get_approx;
+
+  const double px = to_double(get_approx(p).x());
+  const double py = to_double(get_approx(p).y());
+  const double qx = to_double(get_approx(q).x());
+  const double qy = to_double(get_approx(q).y());
+  const double rx = to_double(get_approx(r).x());
+  const double ry = to_double(get_approx(r).y());
+
+  const double pqx = qx - px;
+  const double pqy = qy - py;
+  const double prx = rx - px;
+  const double pry = ry - py;
+
+  return ( determinant(pqx, pqy, prx, pry) < 0);
+}
+
+template <class T>
+inline
+bool
+projection_traits_has_inexact_negative_orientation(const Point &p, const Point &q, const Point &r,
+                                                   const ::CGAL::internal::Projection_traits_3<T,0>& ) const
+{  // So that this code works well with Lazy_kernel
+  internal::Static_filters_predicates::Get_approx<Point> get_approx;
+
+  const double px = to_double(get_approx(p).y());
+  const double py = to_double(get_approx(p).z());
+  const double qx = to_double(get_approx(q).y());
+  const double qy = to_double(get_approx(q).z());
+  const double rx = to_double(get_approx(r).y());
+  const double ry = to_double(get_approx(r).z());
+
+  const double pqx = qx - px;
+  const double pqy = qy - py;
+  const double prx = rx - px;
+  const double pry = ry - py;
+
+  return ( determinant(pqx, pqy, prx, pry) < 0);
+}
+
+
+template <class T>
+inline
+bool
+projection_traits_has_inexact_negative_orientation(const Point &p, const Point &q, const Point &r,
+                                                   const ::CGAL::internal::Projection_traits_3<T,1>& ) const
+{  // So that this code works well with Lazy_kernel
+  internal::Static_filters_predicates::Get_approx<Point> get_approx;
+
+  const double px = to_double(get_approx(p).x());
+  const double py = to_double(get_approx(p).z());
+  const double qx = to_double(get_approx(q).x());
+  const double qy = to_double(get_approx(q).z());
+  const double rx = to_double(get_approx(r).x());
+  const double ry = to_double(get_approx(r).z());
+
+  const double pqx = qx - px;
+  const double pqy = qy - py;
+  const double prx = rx - px;
+  const double pry = ry - py;
+
+  return ( determinant(pqx, pqy, prx, pry) < 0);
+}
+
+
+
 public:
   Face_handle
   inexact_locate(const Point& p,
@@ -3152,6 +3228,7 @@ inexact_locate(const Point & t, Face_handle start, int n_of_turns) const
   return c;
 }
 
+
 template <class Gt, class Tds >
 inline
 bool
@@ -3159,22 +3236,8 @@ Triangulation_2<Gt, Tds>::
 has_inexact_negative_orientation(const Point &p, const Point &q,
                                  const Point &r) const
 {
-  // So that this code works well with Lazy_kernel
-  internal::Static_filters_predicates::Get_approx<Point> get_approx;
-
-  const double px = to_double(get_approx(p).x());
-  const double py = to_double(get_approx(p).y());
-  const double qx = to_double(get_approx(q).x());
-  const double qy = to_double(get_approx(q).y());
-  const double rx = to_double(get_approx(r).x());
-  const double ry = to_double(get_approx(r).y());
-
-  const double pqx = qx - px;
-  const double pqy = qy - py;
-  const double prx = rx - px;
-  const double pry = ry - py;
-
-  return ( determinant(pqx, pqy, prx, pry) < 0);
+  Gt gt;
+  return projection_traits_has_inexact_negative_orientation(p,q,r,gt);
 }
 #endif
 

From 6b40f5b1894e6f494435bd9221df0508edda1108 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 5 Jan 2024 17:57:31 +0100
Subject: [PATCH 1295/1398] restore axis aligned projection traits

---
 .../Polygon_mesh_processing/autorefinement.h  | 44 +++++++++++++++++--
 1 file changed, 41 insertions(+), 3 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index c38d783572b4..94b6a9c96677 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -55,6 +55,10 @@
 #endif
 #endif
 
+#ifdef USE_FIXED_PROJECTION_TRAITS
+#include <CGAL/Kernel_23/internal/Projection_traits_3.h>
+#endif
+
 #include <vector>
 
 //#define CGAL_AUTOREF_USE_DEBUG_PARALLEL_TIMERS
@@ -540,6 +544,9 @@ struct Triangle_data
 };
 
 template <class EK,
+#ifdef USE_FIXED_PROJECTION_TRAITS
+          int dim,
+#endif
           class PointVector>
 void generate_subtriangles(std::size_t ti,
                            Triangle_data& triangle_data,
@@ -813,7 +820,12 @@ void generate_subtriangles(std::size_t ti,
 
 // init CDT + insert points and constraints
   CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer3.start();)
+#ifdef USE_FIXED_PROJECTION_TRAITS
+  typedef ::CGAL::internal::Projection_traits_3<EK, dim> P_traits;
+#else
   typedef CGAL::Projection_traits_3<EK> P_traits;
+#endif
+
   typedef CGAL::No_constraint_intersection_tag Itag;
 
   typedef CGAL::Constrained_Delaunay_triangulation_2<P_traits ,Default, Itag> CDT_2;
@@ -821,7 +833,17 @@ void generate_subtriangles(std::size_t ti,
   typedef CDT_2 CDT;
 
   const std::array<typename EK::Point_3,3>& t = triangles[ti];
+  std::vector<typename CDT::Vertex_handle> vhandles(triangle_data.points.size());
 
+#ifdef USE_FIXED_PROJECTION_TRAITS
+  P_traits cdt_traits;
+  bool orientation_flipped = false;
+  CDT cdt(cdt_traits);
+  // TODO: still need to figure out why I can't make the orientation_flipped correctly
+  vhandles[0]=cdt.insert(t[0]);
+  vhandles[1]=cdt.insert(t[1]);
+  vhandles[2]=cdt.insert(t[2]);
+#else
   // positive triangle normal
   typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
   typename EK::Point_3 o(CGAL::ORIGIN);
@@ -832,17 +854,16 @@ void generate_subtriangles(std::size_t ti,
     n=-n;
     orientation_flipped = true;
   }
-
-  std::vector<typename CDT::Vertex_handle> vhandles(triangle_data.points.size());
   P_traits cdt_traits(n);
+
   CDT cdt(cdt_traits);
   vhandles[0]=cdt.insert_outside_affine_hull(t[0]);
   vhandles[1]=cdt.insert_outside_affine_hull(t[1]);
   vhandles[2] = cdt.tds().insert_dim_up(cdt.infinite_vertex(), orientation_flipped);
   vhandles[2]->set_point(t[2]);
+#endif
 
   // insert points and fill vhandles
-
 #if 0
   std::vector<std::size_t> indices(triangle_data.points.size()-3);
   std::iota(indices.begin(), indices.end(), 3);
@@ -1333,7 +1354,24 @@ void autorefine_triangle_soup(PointRange& soup_points,
       new_triangles.push_back({triangles[ti], ti});
     else
     {
+#ifdef USE_FIXED_PROJECTION_TRAITS
+      const std::array<typename EK::Point_3, 3>& t = triangles[ti];
+      typename EK::Vector_3 orth = CGAL::normal(t[0], t[1], t[2]); // TODO::avoid construction?
+      int c = CGAL::abs(orth[0]) > CGAL::abs(orth[1]) ? 0 : 1;
+      c = CGAL::abs(orth[2]) > CGAL::abs(orth[c]) ? 2 : c;
+
+      if (c == 0) {
+        autorefine_impl::generate_subtriangles<EK, 0>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
+      }
+      else if (c == 1) {
+        autorefine_impl::generate_subtriangles<EK, 1>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
+      }
+      else if (c == 2) {
+        autorefine_impl::generate_subtriangles<EK, 2>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
+      }
+#else
       autorefine_impl::generate_subtriangles<EK>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
+#endif
     }
 
 #ifdef CGAL_AUTOREF_USE_PROGRESS_DISPLAY

From 806d1247e647fa0a5953411013224750f56f30c4 Mon Sep 17 00:00:00 2001
From: hoskillua <47090776+hoskillua@users.noreply.github.com>
Date: Fri, 19 Jan 2024 14:47:39 +0300
Subject: [PATCH 1296/1398] display plugin ball radius slider update

---
 .../Polyhedron/Plugins/Display/Display_property_plugin.cpp | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
index cbff878abb7a..68826d91862f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Display/Display_property_plugin.cpp
@@ -90,6 +90,7 @@ class Display_property_plugin
   double bI = 0.;
 
   double expand_radius = 0.;
+  double expand_radius_updated = false;
   double maxEdgeLength = -1.;
 
   Color_ramp color_ramp;
@@ -912,6 +913,8 @@ private Q_SLOTS:
 
     expand_radius = (pow(base, val) - 1) * outMax / (pow(base, sliderMax) - 1);
     dock_widget->expandingRadiusLabel->setText(tr("Expanding Radius: %1").arg(expand_radius));
+    CGAL_assertion(expand_radius >= 0);
+    expand_radius_updated = true;
   }
 
 private:
@@ -933,7 +936,7 @@ private Q_SLOTS:
     bool non_init;
     SMesh::Property_map<vertex_descriptor, double> mu_i_map;
     std::tie(mu_i_map, non_init) = smesh.add_property_map<vertex_descriptor, double>(tied_string, 0);
-    if(non_init)
+    if(non_init || expand_radius_updated)
     {
       if(vnm_exists)
       {
@@ -967,6 +970,8 @@ private Q_SLOTS:
                                                                   .ball_radius(expand_radius));
         }
       }
+
+      expand_radius_updated = false;
     }
 
     displaySMProperty<vertex_descriptor>(tied_string, smesh);

From fbd15aa2ae773855565cf5d4373c69bf8a7c8b31 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 19 Jan 2024 13:55:53 +0100
Subject: [PATCH 1297/1398] make it cleaner

---
 .../test/Arrangement_on_surface_2/cgal_test.cmake            | 5 ++---
 .../test/Arrangement_on_surface_2/cgal_test_with_cmake       | 5 ++---
 2 files changed, 4 insertions(+), 6 deletions(-)

diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
index 80d8fcf3fa98..59f174e0ba60 100644
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test.cmake
@@ -72,9 +72,8 @@ if(CGAL_DISABLE_GMP)
 endif()
 
 if(CGAL_DISABLE_GMP)
-  message(STATUS "GMP is disable.")
   if (CGAL_USE_LEDA)
-    message(STATUS "Try to use LEDA instead.")
+    message(STATUS "GMP is disabled, try to use LEDA instead.")
     set(GMPZ_NT ${LEDA_INT_NT})
     set(QUOTIENT_CGAL_GMPZ_NT ${LEDA_RAT_NT})
     set(CGAL_GMPQ_NT ${LEDA_RAT_NT})
@@ -82,7 +81,7 @@ if(CGAL_DISABLE_GMP)
     set(LAZY_GMPZ_NT ${LAZY_LEDA_RAT_NT})
     set(CGAL_GMPZ_NT ${LEDA_INT_NT})
   else()
-    message(STATUS "Try to use MP float instead.")
+    message(STATUS "GMP is disabled, try to use MP float instead.")
     set(GMPZ_NT ${MP_FLOAT_NT})
     set(QUOTIENT_CGAL_GMPZ_NT ${QUOTIENT_MP_FLOAT_NT})
     set(CGAL_GMPQ_NT ${QUOTIENT_MP_FLOAT_NT})
diff --git a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake
index acf5c73f486e..d8c26c683902 100755
--- a/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake
+++ b/Arrangement_on_surface_2/test/Arrangement_on_surface_2/cgal_test_with_cmake
@@ -78,9 +78,8 @@ CORE_INT_NT=15
 CORE_RAT_NT=16
 
 if [ -n "${CGAL_DISABLE_GMP}" ]; then
-    echo GMP is disable.
     if [ -n "CGAL_USE_LEDA" ]; then
-      echo Try to use LEDA instead.
+      echo GMP is disabled, try to use LEDA instead.
       GMPZ_NT=$LEDA_INT_NT
       QUOTIENT_CGAL_GMPZ_NT=$LEDA_RAT_NT
       CGAL_GMPQ_NT=$LEDA_RAT_NT
@@ -88,7 +87,7 @@ if [ -n "${CGAL_DISABLE_GMP}" ]; then
       LAZY_GMPZ_NT=$LAZY_LEDA_RAT_NT
       CGAL_GMPZ_NT=$LEDA_INT_NT
     else
-      echo Try to use MP float instead.
+      echo GMP is disabled, try to use MP float instead.
       GMPZ_NT=$MP_FLOAT_NT
       QUOTIENT_CGAL_GMPZ_NT=$QUOTIENT_MP_FLOAT_NT
       CGAL_GMPQ_NT=$QUOTIENT_MP_FLOAT_NT

From b16f57ece1516fd93d6a86fe34473cc52a0336c6 Mon Sep 17 00:00:00 2001
From: Nicolas Saillant <saillantnicolas01@gmail.com>
Date: Tue, 23 Jan 2024 15:05:00 +0100
Subject: [PATCH 1298/1398] Update build scripts to use the number of available
 processors for parallel compilation

---
 .github/test.sh                 | 3 ++-
 .github/workflows/build_doc.yml | 4 ++--
 2 files changed, 4 insertions(+), 3 deletions(-)

diff --git a/.github/test.sh b/.github/test.sh
index cf69ebee9552..59d4820ecdd0 100755
--- a/.github/test.sh
+++ b/.github/test.sh
@@ -9,4 +9,5 @@ PLUGINS_ARRAY=(${LIST_OF_PLUGINS});
 NB_OF_PLUGINS=${#PLUGINS_ARRAY[@]}
 DEL=$(($NB_OF_PLUGINS / 4))
 cd build
-make -j2 ${PLUGINS_ARRAY[@]:$(($FACTOR * $DEL)):$((($FACTOR + 1) * $DEL))}
+NUM_PROCS=$(nproc)
+make -j${NUM_PROCS} ${PLUGINS_ARRAY[@]:$(($FACTOR * $DEL)):$((($FACTOR + 1) * $DEL))}
diff --git a/.github/workflows/build_doc.yml b/.github/workflows/build_doc.yml
index d523cc2079d1..9735cd3d3c84 100644
--- a/.github/workflows/build_doc.yml
+++ b/.github/workflows/build_doc.yml
@@ -104,8 +104,8 @@ jobs:
               echo "DoxygenError=No package affected." >> $GITHUB_OUTPUT
               exit 1
             fi
-            cd build_doc && make -j2 doc
-            make -j2 doc_with_postprocessing 2>tmp.log
+            cd build_doc && make -j$(nproc) doc
+            make -j$(nproc) doc_with_postprocessing 2>tmp.log
             if [ -s tmp.log ]; then
               content=`cat ./tmp.log`
               delimiter="$(openssl rand -hex 8)"

From a4d713a386c4879583e0180643ac350b68356037 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Wed, 24 Jan 2024 15:53:11 +0100
Subject: [PATCH 1299/1398] do not skip whitespace while reading quotient

---
 Number_types/include/CGAL/Quotient.h | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Number_types/include/CGAL/Quotient.h b/Number_types/include/CGAL/Quotient.h
index 8c117c2fb6d8..56e3432bfba3 100644
--- a/Number_types/include/CGAL/Quotient.h
+++ b/Number_types/include/CGAL/Quotient.h
@@ -421,7 +421,6 @@ operator>>(std::istream& in, Quotient<NT>& r)
   NT num,den=1;
   in >> num;
   if(!in) return in;
-  std::istream::sentry s(in); // skip whitespace
   if(in.peek()!='/'){
           if(!in.good()){
                   in.clear(std::ios_base::eofbit);

From 6c17b256d5fc3d1cec50798ff0b11e577c52dec9 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 24 Jan 2024 22:16:57 +0200
Subject: [PATCH 1300/1398] substituted with => substituted by

---
 .../Arrangement_on_surface_2.txt              | 62 +++++++++----------
 .../Arr_bounded_planar_topology_traits_2.h    |  4 +-
 .../CGAL/Arr_conic_traits_2.h                 |  2 +-
 .../CGAL/Arr_spherical_topology_traits_2.h    |  4 +-
 .../CGAL/Arr_unb_planar_topology_traits_2.h   |  4 +-
 .../CGAL/Arrangement_on_surface_2.h           |  4 +-
 .../Arrangement_on_surface_with_history_2.h   |  4 +-
 .../CGAL/Arrangement_with_history_2.h         |  4 +-
 .../Concepts/ArrangementLandmarkTraits_2.h    |  2 +-
 9 files changed, 45 insertions(+), 45 deletions(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
index 42b4621de21d..5b4b9ed90515 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Arrangement_on_surface_2.txt
@@ -69,10 +69,10 @@ class Arrangement_2 { ... };
 
 An instance of this template represents an arrangement embedded in the
 plane. When the template is instantiated, the `GeometryTraits`
-parameter must be substituted with a type that defines a set of
+parameter must be substituted by a type that defines a set of
 geometric-object types, such as point and curve, and a set of
 operations on objects of these types (see Section \ref
-aos_sec-geom_traits); the `Dcel` parameter must be substituted with a
+aos_sec-geom_traits); the `Dcel` parameter must be substituted by a
 type that represents a doubly-connected edge list (\dcel) data
 structure. It defines types of topological objects, such as vertices,
 edges, and faces, and the operations required to maintain the
@@ -91,7 +91,7 @@ An instance of this template represents a two-dimensional arrangement
 embedded in a surface in three dimensional space. When the template is
 instantiated, the `GeometryTraits` parameter must be substituted as
 described above; the `TopologyTraits` parameter must be substituted
-with a type that deals with the topology of the surface (see Section
+by a type that deals with the topology of the surface (see Section
 \ref aos_sec-topol_traits). In particular, it maintains a
 representation of the arrangement graph embedded in the surface using
 a doubly-connected edge list (\dcel) data-structure suitable for
@@ -390,7 +390,7 @@ the `Arrangement_2` class template; their description follows.
 
 <UL>
 
-<LI>The `Traits` template-parameter should be substituted with a
+<LI>The `Traits` template-parameter should be substituted by a
   model of the `ArrangementBasicTraits_2` concept and optionally
   additional geometry traits concepts. A model of the
   `ArrangementBasicTraits_2` concept defines the types of
@@ -415,10 +415,10 @@ the `Arrangement_2` class template; their description follows.
   rational functions. We exemplify the usage of these traits classes
   in Section \ref aos_sec-geom_traits.
 
-<LI>The `Dcel` template-parameter should be substituted with a class
+<LI>The `Dcel` template-parameter should be substituted by a class
   that models the `ArrangementDcel` concept, which is used to represent
   the topological layout of the arrangement. This parameter is
-  substituted with `Arr_default_dcel<Traits>` by default, and
+  substituted by `Arr_default_dcel<Traits>` by default, and
   we use this default value in this and in the following three
   sections. However, in many applications it is necessary to extend the
   \dcel features. This is done by substituting the `Dcel` parameter with
@@ -1002,7 +1002,7 @@ segments common to all examples that do not construct new geometric
 objects. They are kept in the header file
 `arr_inexact_construction_segments.h`.  In these examples the `Traits`
 parameter of the `Arrangement_2<Traits, Dcel>` class template is
-substituted with an instance of the
+substituted by an instance of the
 `Arr_non_caching_segment_traits_2<Kernel>` class template. The
 `Arr_non_caching_segment_traits_2` class template is instantiated with
 the predefined kernel that evaluates predicates in an exact manner,
@@ -1439,7 +1439,7 @@ vary according to the user choice.} for answering queries:
 
   The landmark strategy requires that the type of the attached
   arrangement be an instance of the `Arrangement_2<Traits,Dcel>` class
-  template, where the `Traits` parameter is substituted with a
+  template, where the `Traits` parameter is substituted by a
   geometry-traits class that models the `ArrangementLandmarkTraits_2`
   concept, which refines the basic `ArrangementBasicTraits_2` concept;
   see Section \ref aos_sssec-tr_landmarks_concept for details. Most
@@ -1743,7 +1743,7 @@ query results, and insert \f$c\f$ at its proper
 location.\cgalFootnote{The \cgalFootnoteCode{CGAL::insert_non_intersecting_curve<>()}
 function template, as all other functions reviewed in this section, is
 parameterized by an arrangement type and a point-location type (The
-latter must be substituted with a model of the
+latter must be substituted by a model of the
 `ArrangementPointLocation_2` concept).} The insertion operation thus
 hardly requires any geometric operations on top of the ones needed to
 answer the point-location queries. Moreover, it is sufficient that the
@@ -1847,7 +1847,7 @@ condition. Consider the call \link CGAL::insert<>() `insert(arr, c,
 pl)`\endlink, where \f$c\f$ is not necessarily \f$x\f$-monotone. In
 this case the type of `arr` must be an instance of the
 `Arrangement_2<Traits, Dcel>` class template, where the `Traits`
-template parameter is substituted with a traits class that models the
+template parameter is substituted by a traits class that models the
 concept `ArrangementTraits_2`, which refines the
 `ArrangementXMonotoneTraits_2` concept. It has to define an additional
 \link ArrangementTraits_2::Curve_2 `Curve_2`\endlink type, which may
@@ -2268,7 +2268,7 @@ accepts the name of an input file that contains the plain-text
 description of the geometric objects and an output iterator for
 storing the newly constructed objects.  When the function is
 instantiated, the first template parameter, namely `Type`, must be
-substituted with the type of objects to read. It is assumed that an
+substituted by the type of objects to read. It is assumed that an
 extractor operator (`>>`) that extracts objects of the given type from
 the input stream is available. The listing of the function template,
 which is defined in the file `read_objects.h`, is omitted here
@@ -2705,7 +2705,7 @@ All the free functions that operate on arrangements of bounded curves
 of unbounded curves. For example, consider a container of linear
 curves that has to be inserted into an arrangement object, the type of
 which is an instance of the `Arrangement_2<Traits,Dcel>` class
-template, where the `Traits` parameter is substituted with the traits
+template, where the `Traits` parameter is substituted by the traits
 class that handles linear curves; see Section \ref
 arr_sssectr_linear. You can do it incrementally; namely, insert the
 curves one by one as follows:
@@ -3486,7 +3486,7 @@ point-location strategy.
 The type of an arrangement associated with the landmark point-location
 strategy (see Section \ref arr_ssecpl) must be an instance of the
 `Arrangement_on_surface_2<GeomTraits, TopolTraits>` class template,
-where the `GeomTraits` parameter is substituted with a model of the
+where the `GeomTraits` parameter is substituted by a model of the
 concept `ArrangementLandmarkTraits_2`. (Naturally, it can also model
 either the `ArrangementXMonotoneTraits_2` concept or the
 `ArrangementTraits_2` concept.) The `ArrangementLandmarkTraits_2`
@@ -4542,7 +4542,7 @@ PkgBooleanSetOperations2Ref. Note that it is not a model of the
 computations with square root numbers, which makes it attractive for
 arrangements induced by line segments, circular arcs, and whole
 circles.  When the traits class-template is instantiated, the `Kernel`
-template parameter must be substituted with a geometric kernel that
+template parameter must be substituted by a geometric kernel that
 models the `Kernel` concept. Always plug in a kernel that uses a
 rational number type, such as
 `Exact_predicates_exact_constructions_kernel`. Observe that the nested
@@ -4723,20 +4723,20 @@ follows:
 
 <UL>
 
-<LI>The `RatKernel` template parameter must be substituted with a
+<LI>The `RatKernel` template parameter must be substituted by a
 geometric kernel whose field type is an exact rational type. It is
 used to define basic geometric entities (e.g., a line segment or a
 circle) with rational coefficients. Typically we use one of the
 standard \cgal kernels, instantiated with the number type
 `NtTraits::Rational` (see below).
 
-<LI>The `AlgKernel` template parameter must be substituted with a
+<LI>The `AlgKernel` template parameter must be substituted by a
 geometric kernel whose field type is an exact algebraic type. It is
 used to define points with algebraic coordinates. Typically, we use
 one of the standard \cgal kernels, instantiated with the number type
 `NtTraits::Algebraic` (see below).
 
-<LI>The `NtTraits` template parameter must be substituted with a type
+<LI>The `NtTraits` template parameter must be substituted by a type
 that encapsulates all the numeric operations needed for performing
 geometric computation carried out by the geometric traits class.  It
 defines the `Integer`, `Rational`, and `Algebraic` number-types, and
@@ -4917,7 +4917,7 @@ provided by the traits in form of functors.
 
 When the `Arr_rational_function_traits_2<AlgebraicKernel_d_1>` class
 template is instantiated, the template parameter must be substituted
-with a model of the `AlgebraicKernel_d_1` concept. Models of this
+by a model of the `AlgebraicKernel_d_1` concept. Models of this
 concept, such as the `Algebraic_kernel_d_1<Coefficient>` class
 template provided by the package \ref PkgAlgebraicFoundations are
 meant to support algebraic functionalities on univariate polynomials
@@ -5177,11 +5177,11 @@ polynomial.  Currently supported integral number types are `Gmpz`,
 statements included in the header file `integer_type.h`, the listings
 of which are omitted here. This header file is used by the two example
 programs listed in this section. The template parameter `Coefficient`
-can be substituted in addition with an instance of the
+can be substituted in addition by an instance of the
 `Sqrt_extension<A,B>` class template, where the template parameters
-`NT` and `Root` are substituted in turn with one of the integral
+`NT` and `Root` are substituted in turn by one of the integral
 number types above. Finally, the template parameter `Coefficient` can
-be substituted also with a rational number type, where the type of the
+be substituted also by a rational number type, where the type of the
 numerator and denominator is one of the types above.
 
 The type \link Arr_algebraic_segment_traits_2::Curve_2
@@ -5488,7 +5488,7 @@ decorator used to attach a data field to curves and to
 \f$x\f$-monotone curves. It is a class template named
 `Arr_curve_data_traits_2<BaseTraits, XMonotoneCurveData, Merge,
 CurveData, Convert>` parameterized by a base-traits class, which must
-be substituted with one of the geometric traits models described in
+be substituted by one of the geometric traits models described in
 the previous subsections or with a user-defined traits model, when the
 decorator is instantiated. The curve-data decorator derives from the
 base-traits class, and in particular inherits its \link
@@ -6108,7 +6108,7 @@ ovl_traits)`\endlink constructs the arrangement `arr_o`, which is the
 overlay of two input arrangement `arr_r` and `arr_b`. All three
 arrangements must use the same geometric primitives. In other words,
 their types are instances of the `Arrangement_2<Traits,Dcel>` class
-template, where the `Traits` parameter is substituted with three
+template, where the `Traits` parameter is substituted by three
 geometry-traits classes, respectively. The geometry-traits classes of
 the input arrangements must be convertible to the geometry-traits
 class of the resulting arrangement.\cgalFootnote{It is sufficient that
@@ -6169,7 +6169,7 @@ arrangement that results from overlaying two face-extended
 arrangements typically also stores additional data-fields with its
 faces. The types of such arrangements, for example, could be instances
 of the `Arrangement_2<Traits,Dcel>` class template, where the `Dcel`
-parameters are substituted with instances of the
+parameters are substituted by instances of the
 `Arr_face_extended_dcel` class template (see Section \ref
 arr_sssecex_dcel_face). The data field that is attached to an overlay
 face can be computed from the data fields of the two faces (in `arr_r`
@@ -6179,7 +6179,7 @@ data fields with all their \dcel records typically also stores
 additional data-fields with all its \dcel records. The types of
 such arrangements, for example, could be instances of the
 `Arrangement_2<Traits,Dcel>` class template, where the `Dcel`
-parameters are substituted with instances of the `Arr_extended_dcel`
+parameters are substituted by instances of the `Arr_extended_dcel`
 class template (see Section \ref arr_sssecex_dcel_all). The data field
 attached to an overlay feature can be computed from the data fields of
 the two features (in `arr_r` and `arr_b`) that induce the overlay
@@ -6194,7 +6194,7 @@ of the overlay traits can be an instance of the class template
 `Arr_face_overlay_traits<ArrangementR,ArrangementB,ArrangementO,OverlayFaceData>`,
 which models the concept `OverlayTraits`. An object of this type
 operates on face-extended arrangements. When instantiated, the
-`OverlayFaceData` parameter must be substituted with a functor that is
+`OverlayFaceData` parameter must be substituted by a functor that is
 capable of combining two face-data fields of types
 `ArrangementR::Dcel::Face_data` and `ArrangementB::Dcel::Face_data`
 and computing the output `ArrangementO::Dcel::Face_data` object. The
@@ -6209,7 +6209,7 @@ flag. A polygon is represented as a <em>marked</em> arrangement face
 (whose flag is set). The example uses an instance of the
 `Arr_face_overlay_traits<ArrR,ArrB,ArrO,OverlayFaceData>` class
 template as the face-overlay traits class where the `OverlayFaceData`
-template parameter is substituted with a functor that simply performs
+template parameter is substituted by a functor that simply performs
 a logical <em>and</em> operation on Boolean flags. As a result, a face
 in the overlay arrangement is marked only when it corresponds to an
 overlapping region of two marked faces in the input
@@ -6407,12 +6407,12 @@ between these curves and the arrangement edges they induce. Similarly,
 the `Arrangement_with_history_2<GeometryTraits,Dcel>` class-template
 extends the `Arrangement_2<GeometryTraits,Dcel>` class template. The
 `GeometryTraits` template parameter, of either class templates, must
-be substituted with a model of the `ArrangementTraits_2` concept; see
+be substituted by a model of the `ArrangementTraits_2` concept; see
 Section \ref aos_ssec-insert_gen. It should define the \link
 ArrangementTraits_2::Curve_2 `Curve_2`\endlink type and support its
 subdivision into \link ArrangementBasicTraits_2::X_monotone_curve_2
 `X_monotone_curve_2`\endlink objects, among the others.  The `Dcel`
-parameter must be substituted with a model of the `ArrangementDcel`
+parameter must be substituted by a model of the `ArrangementDcel`
 concept. You can use either the default \dcel class or an extended
 \dcel class (see Section \ref arr_ssecex_dcel) based on your needs. An
 arrangement that support the cross-mapping mentioned above is referred
@@ -6489,7 +6489,7 @@ iterators is \link Arrangement_with_history_2::Curve_2
 Overlaying two arrangement-with-history objects is possible only if
 their types are instances of the
 `Arrangement_with_history_2<Traits,Dcel>` class template, where the
-respective `Traits` parameters are substituted with two traits classes
+respective `Traits` parameters are substituted by two traits classes
 that are convertible to one another. In this case, the resulting
 arrangement stores a consolidated container of input curves, and
 automatically preserves the cross-mapping between the arrangement
@@ -6974,7 +6974,7 @@ algorithm on a dual arrangement. It uses the functor template
 information stored inside the faces. The functor implements a property
 map that utilizes the `data()` and `set_data()` member functions of the
 extended face to update or obtain the property. When the property map
-is instantiated, the `Type` parameter must be substituted with the
+is instantiated, the `Type` parameter must be substituted by the
 same type that is used to extend the arrangement face; see Section
 \ref arr_sssecex_dcel_face. The functor template is defined in the
 header file `Extended_face_property_map.h` listed below.
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h
index ea05170d37f4..9bda6a296b9c 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_bounded_planar_topology_traits_2.h
@@ -9,13 +9,13 @@ namespace CGAL {
  *
  * The `Arr_bounded_planar_topology_traits_2` template has two parameters:
  * <UL>
- * <LI>The `GeometryTraits_2` template-parameter should be substituted with
+ * <LI>The `GeometryTraits_2` template-parameter should be substituted by
  * a model of the `ArrangementBasicTraits_2` concept. The traits
  * class defines the types of \f$x\f$-monotone curves and two-dimensional
  * points, namely `ArrangementBasicTraits_2::X_monotone_curve_2` and
  * `ArrangementBasicTraits_2::Point_2`,
  *   respectively, and supports basic geometric predicates on them.
- * <LI>The `Dcel` template-parameter should be substituted with
+ * <LI>The `Dcel` template-parameter should be substituted by
  * a class that is a model of the `ArrangementDcel` concept. The
  * value of this parameter is by default
  * `Arr_default_dcel<Traits>`.
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
index c8b960c6324b..2db8001f4b1a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_conic_traits_2.h
@@ -58,7 +58,7 @@ namespace CGAL {
  * <I>integer</I> coefficient of degree \f$d\f$ such that \f$p(\alpha) = 0\f$).
  * We therefore require separate representations of the curve
  * coefficients and the point coordinates. The `NtTraits` should be substituted
- * with a class that defines nested `Integer`, `Rational`, and `Algebraic` number
+ * by a class that defines nested `Integer`, `Rational`, and `Algebraic` number
  * types and supports various operations on them, yielding certified computation
  * results (for example, it can convert rational numbers to algebraic numbers
  * and can compute roots of polynomials with integer coefficients).  The other
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h
index 680f51d0d494..aa95832414a3 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_spherical_topology_traits_2.h
@@ -9,13 +9,13 @@ namespace CGAL {
  *
  * The `Arr_spherical_topology_traits_2` template has two parameters:
  * <UL>
- * <LI>The `GeometryTraits_2` template-parameter should be substituted with
+ * <LI>The `GeometryTraits_2` template-parameter should be substituted by
  * a model of the `ArrangementBasicTraits_2` concept. The traits
  * class defines the types of \f$x\f$-monotone curves and two-dimensional
  * points, namely `ArrangementBasicTraits_2::X_monotone_curve_2` and
  * `ArrangementBasicTraits_2::Point_2`,
  *   respectively, and supports basic geometric predicates on them.
- * <LI>The `Dcel` template-parameter should be substituted with
+ * <LI>The `Dcel` template-parameter should be substituted by
  * a class that is a model of the `ArrangementDcel` concept. The
  * value of this parameter is by default
  * `Arr_default_dcel<Traits>`.
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h
index d8cc5bb046c0..9a3aaf147891 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_unb_planar_topology_traits_2.h
@@ -9,13 +9,13 @@ namespace CGAL {
  *
  * The `Arr_unb_planar_topology_traits_2` template has two parameters:
  * <UL>
- * <LI>The `GeometryTraits_2` template-parameter should be substituted with
+ * <LI>The `GeometryTraits_2` template-parameter should be substituted by
  * a model of the `ArrangementBasicTraits_2` concept. The traits
  * class defines the types of \f$x\f$-monotone curves and two-dimensional
  * points, namely `ArrangementBasicTraits_2::X_monotone_curve_2` and
  * `ArrangementBasicTraits_2::Point_2`,
  *   respectively, and supports basic geometric predicates on them.
- * <LI>The `Dcel` template-parameter should be substituted with
+ * <LI>The `Dcel` template-parameter should be substituted by
  * a class that is a model of the `ArrangementDcel` concept. The
  * value of this parameter is by default
  * `Arr_default_dcel<Traits>`.
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
index 8940d4d93770..4de00662fa5a 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_2.h
@@ -16,14 +16,14 @@ namespace CGAL {
 
  * The `Arrangement_on_surface_2` template has two parameters:
  * <UL>
- * <LI>The `GeometryTraits` template-parameter should be substituted with
+ * <LI>The `GeometryTraits` template-parameter should be substituted by
  * a model of a geometry traits. The minimal requirements are defined by the
  * `ArrangementBasicTraits_2` concept. A model of this concept defines
  * the types of \f$ x\f$-monotone curves and two-dimensional points, namely
  * `ArrangementBasicTraits_2::X_monotone_curve_2` and
  * `ArrangementBasicTraits_2::Point_2`, respectively, and supports basic
  * geometric predicates on them.
- * <LI>The `TopologyTraits` template-parameter should be substituted with a
+ * <LI>The `TopologyTraits` template-parameter should be substituted by a
  * class that is a model of the `ArrangementTopologyTraits` concept.
  * </UL>
  *
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_with_history_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_with_history_2.h
index ba8847d2c603..ac6fac594963 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_with_history_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_on_surface_with_history_2.h
@@ -25,14 +25,14 @@ namespace CGAL {
  * The `Arrangement_on_surface_with_history_2` template has two parameters:
  *
  * <UL>
- * <LI>The `GeometryTraits` template-parameter should be substituted with a
+ * <LI>The `GeometryTraits` template-parameter should be substituted by a
  * model of the `ArrangementTraits_2` concept. The traits class defines the
  * `Curve_2` type, which represents an input curve.  It also defines the types
  * of \f$ x\f$-monotone curves and two-dimensional points, namely
  * `ArrangementTraits_2::X_monotone_curve_2` and
  * `ArrangementTraits_2::Point_2`, respectively, and supports basic
  * geometric predicates on them.
- * <LI>The `TopologyTraits` template-parameter should be substituted with a
+ * <LI>The `TopologyTraits` template-parameter should be substituted by a
  * class that is a model of the `ArrangementTopologyTraits` concept.
  * </UL>
  *
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_with_history_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_with_history_2.h
index dbd72c15ea5e..a4f001847c35 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_with_history_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arrangement_with_history_2.h
@@ -23,13 +23,13 @@ namespace CGAL {
  *
  * The `Arrangement_with_history_2` template has two parameters:
  * <UL>
- * <LI>The `Traits` template-parameter should be substituted with a model of
+ * <LI>The `Traits` template-parameter should be substituted by a model of
  * the `ArrangementTraits_2` concept. The traits class defines the `Curve_2`
  * type, which represents an input curve.  It also defines the types of \f$
  * x\f$-monotone curves and two-dimensional points, namely
  * `ArrangementTraits_2::X_monotone_curve_2` and `ArrangementTraits_2::Point_2`,
  * respectively, and supports basic geometric predicates on them.
- * <LI>The `Dcel` template-parameter should be substituted with a class that is
+ * <LI>The `Dcel` template-parameter should be substituted by a class that is
  * a model of the `ArrangementDcelWithRebind` concept. The value of this
  * parameter is by default `Arr_default_dcel<Traits>`.
  * </UL>
diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
index 75c1a6bd2410..673d553e69d8 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/Concepts/ArrangementLandmarkTraits_2.h
@@ -7,7 +7,7 @@
  * associated with the landmark point-location strategy (see
  * `CGAL::Arr_landmarks_point_location`) must be an instance of the
  * `CGAL::Arrangement_2<Traits,Dcel>` class template, where the Traits parameter
- * is substituted with a model of this concept.
+ * is substituted by a model of this concept.
  *
  * \cgalRefines{ArrangementApproximateTraits_2,ArrangementConstructXMonotoneCurveTraits_2}
  *

From b29afdd560722c495b70cdcd6c80735fd4c78e32 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 24 Jan 2024 22:26:36 +0200
Subject: [PATCH 1301/1398] Cleaned up

---
 .../doc/Arrangement_on_surface_2/fig_src/header.tex              | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex
index 474e42804d3c..35b48e0c31b7 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/fig_src/header.tex
@@ -98,7 +98,6 @@
 \newcommand{\mySimpleAxes}[4]{%
   \draw[-{Stealth[scale=1.5]}] (#1,0)--(#3,0) node[right]{$x$};
   \draw[-{Stealth[scale=1.5]}] (0,#2)--(0,#4) node[above]{$y$};
->>>>>>> Stashed changes
 }
 % ------------------------------------------------------------------------------
 % #1 half length of tick

From 4de87b21b7e5a5d3f676899557cd2b339532d851 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 24 Jan 2024 23:18:13 +0200
Subject: [PATCH 1302/1398] Ops;

---
 .../include/CGAL/Arrangement_on_surface_2.h                     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
index 4dad5388eaa2..35c1c0ebcb88 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_on_surface_2.h
@@ -39,7 +39,7 @@
 #include <CGAL/HalfedgeDS_iterator.h>
 #include <CGAL/Arrangement_2/Arrangement_2_iterators.h>
 #include <CGAL/In_place_list.h>
-#include <CGAL/Arr_observer.h>
+#include <CGAL/Aos_observer.h>
 #include <CGAL/Arr_accessor.h>
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 #include <CGAL/function_objects.h>

From 878d90b20ea1b8151ff1b089bf506ef5c0d04d4d Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 25 Jan 2024 17:46:41 +0000
Subject: [PATCH 1303/1398] Core: Use Expr::is_zero() of AST

---
 Number_types/include/CGAL/CORE_Expr.h | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/Number_types/include/CGAL/CORE_Expr.h b/Number_types/include/CGAL/CORE_Expr.h
index ae0b603b1edc..efeb5ad9363a 100644
--- a/Number_types/include/CGAL/CORE_Expr.h
+++ b/Number_types/include/CGAL/CORE_Expr.h
@@ -115,6 +115,14 @@ template <> class Algebraic_structure_traits< CORE::Expr >
         };  */
     };
 
+    class Is_zero
+      : public CGAL::cpp98::unary_function< Type, bool > {
+      public:
+        bool operator()( const Type& x ) const {
+          return x.isZero();
+        }
+    };
+
 };
 
 template <> class Real_embeddable_traits< CORE::Expr >

From 13485521941e288a70bf427b2dea9864fb74ef47 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 25 Jan 2024 18:23:49 +0000
Subject: [PATCH 1304/1398] Add Is_one

---
 CGAL_Core/examples/Core/CMakeLists.txt |  1 +
 CGAL_Core/examples/Core/zero-one.cpp   | 32 ++++++++++++++++++++++++++
 Number_types/include/CGAL/CORE_Expr.h  | 16 +++++++++++++
 3 files changed, 49 insertions(+)
 create mode 100644 CGAL_Core/examples/Core/zero-one.cpp

diff --git a/CGAL_Core/examples/Core/CMakeLists.txt b/CGAL_Core/examples/Core/CMakeLists.txt
index d4513e22dea4..6d9e732db932 100644
--- a/CGAL_Core/examples/Core/CMakeLists.txt
+++ b/CGAL_Core/examples/Core/CMakeLists.txt
@@ -9,4 +9,5 @@ if(NOT CGAL_Core_FOUND)
   return()
 endif()
 
+create_single_source_cgal_program("zero-one.cpp")
 create_single_source_cgal_program("delaunay.cpp")
diff --git a/CGAL_Core/examples/Core/zero-one.cpp b/CGAL_Core/examples/Core/zero-one.cpp
new file mode 100644
index 000000000000..cfc5a903c19b
--- /dev/null
+++ b/CGAL_Core/examples/Core/zero-one.cpp
@@ -0,0 +1,32 @@
+
+#include <CGAL/CORE_Expr.h>
+
+typedef CORE::Expr Real;
+
+int main()
+{
+  Real r(3.14);
+
+  CGAL::is_zero(r);
+
+  CGAL::is_one(r);
+
+  r = CGAL::sqrt(r);
+
+
+  CGAL::is_zero(r);
+
+  CGAL::is_one(r);
+
+  r = r * r;
+
+  CGAL::is_zero(r);
+
+  CGAL::is_one(r);
+
+  r = r - r;
+
+  CGAL::is_zero(r);
+
+  return 0;
+}
diff --git a/Number_types/include/CGAL/CORE_Expr.h b/Number_types/include/CGAL/CORE_Expr.h
index efeb5ad9363a..3ddb4c7f78fd 100644
--- a/Number_types/include/CGAL/CORE_Expr.h
+++ b/Number_types/include/CGAL/CORE_Expr.h
@@ -123,6 +123,22 @@ template <> class Algebraic_structure_traits< CORE::Expr >
         }
     };
 
+    class Is_one
+      : public CGAL::cpp98::unary_function< Type, bool > {
+      public:
+        bool operator()( const Type& x ) const {
+          double inf, sup;
+          x.doubleInterval(inf,sup);
+          if((inf > 1) || (sup < 1)){
+            return false;
+          }
+          if((inf == 1) && (sup == 1)){
+            return true;
+          }
+          return x.cmp(Type::getOne());
+        }
+    };
+
 };
 
 template <> class Real_embeddable_traits< CORE::Expr >

From 468b81f9f29c26910b4fa8e7fb7571af4cd7dfb0 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 26 Jan 2024 08:47:16 +0100
Subject: [PATCH 1305/1398] Update Number_types/include/CGAL/CORE_Expr.h

Co-authored-by: Marc Glisse <marc.glisse@inria.fr>
---
 Number_types/include/CGAL/CORE_Expr.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Number_types/include/CGAL/CORE_Expr.h b/Number_types/include/CGAL/CORE_Expr.h
index 3ddb4c7f78fd..f38681a08e24 100644
--- a/Number_types/include/CGAL/CORE_Expr.h
+++ b/Number_types/include/CGAL/CORE_Expr.h
@@ -135,7 +135,7 @@ template <> class Algebraic_structure_traits< CORE::Expr >
           if((inf == 1) && (sup == 1)){
             return true;
           }
-          return x.cmp(Type::getOne());
+          return x.cmp(Type::getOne()) == 0;
         }
     };
 

From 60328a74a7227eb3de179f9089537769ed7fa8eb Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 26 Jan 2024 08:48:28 +0100
Subject: [PATCH 1306/1398] Update Number_types/include/CGAL/CORE_Expr.h

Co-authored-by: Marc Glisse <marc.glisse@inria.fr>
---
 Number_types/include/CGAL/CORE_Expr.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Number_types/include/CGAL/CORE_Expr.h b/Number_types/include/CGAL/CORE_Expr.h
index f38681a08e24..e0f72a223266 100644
--- a/Number_types/include/CGAL/CORE_Expr.h
+++ b/Number_types/include/CGAL/CORE_Expr.h
@@ -132,7 +132,7 @@ template <> class Algebraic_structure_traits< CORE::Expr >
           if((inf > 1) || (sup < 1)){
             return false;
           }
-          if((inf == 1) && (sup == 1)){
+          if(inf == sup){
             return true;
           }
           return x.cmp(Type::getOne()) == 0;

From 0f59daafb96286c1fab4cd2188fea73c62db2876 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Fri, 26 Jan 2024 14:56:31 +0100
Subject: [PATCH 1307/1398] Add a hook CGAL_hook_fix_ctest_dependencies

This hook fonction detects dependencies between compilation tests.
---
 ...GAL_enable_end_of_configuration_hook.cmake | 31 +++++++++++++++++++
 Polyhedron/demo/Polyhedron/CMakeLists.txt     | 19 +++++++++++-
 .../Polyhedron/polyhedron_demo_macros.cmake   | 18 +----------
 3 files changed, 50 insertions(+), 18 deletions(-)

diff --git a/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake b/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
index d69c42fc5dda..671d5e23680d 100644
--- a/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
+++ b/Installation/cmake/modules/CGAL_enable_end_of_configuration_hook.cmake
@@ -116,11 +116,36 @@ function(CGAL_hook_fix_ctest_depending_on_Qt6)
     endforeach()
 endfunction()
 
+function(CGAL_hook_fix_ctest_dependencies)
+  get_property(_targets DIRECTORY ${CMAKE_CURRENT_SOURCE_DIR} PROPERTY BUILDSYSTEM_TARGETS)
+  # message(STATUS "  ${CMAKE_CURRENT_SOURCE_DIR} targets: ${_targets}")
+  foreach(_target ${_targets})
+    if(NOT TEST "compilation of  ${_target}")
+      continue()
+    endif()
+    get_property(linked_libraries TARGET "${_target}" PROPERTY LINK_LIBRARIES)
+    get_property(deps TARGET "${_target}" PROPERTY MANUALLY_ADDED_DEPENDENCIES)
+    list(APPEND deps ${linked_libraries})
+    # message("  ${_target} depends on: ${deps}")
+    foreach(dep ${deps})
+      if(TARGET ${dep} AND NOT dep MATCHES "^CGAL::|^CGAL_|^CGAL$" )
+        get_target_property(imported ${dep} IMPORTED)
+        if(NOT imported)
+          # message(STATUS "The target ${dep} is a dependency of ${_target}.")
+          set_property(TEST "compilation of  ${_target}"
+            APPEND PROPERTY DEPENDS "compilation of  ${dep}")
+        endif()
+      endif()
+    endforeach()
+  endforeach()
+endfunction()
+
 function(CGAL_hooks_at_end_of_all_directories)
   CGAL_hook_check_targets()
   CGAL_hook_check_unused_cpp_files()
   if(CGAL_ENABLE_TESTING)
     CGAL_hook_fix_ctest_depending_on_Qt6()
+    CGAL_hook_fix_ctest_dependencies()
   endif()
 endfunction()
 
@@ -155,6 +180,11 @@ function(CGAL_run_at_the_end_of_configuration variable access value current_list
 endfunction()
 
 function(CGAL_install_hooks)
+  get_property(PROPERTY_CGAL_hooks_installed DIRECTORY PROPERTY CGAL_hooks_installed)
+  if(PROPERTY_CGAL_hooks_installed)
+    return()
+  endif()
+  # message(STATUS "Installing hooks in ${CMAKE_CURRENT_SOURCE_DIR}")
   if(CMAKE_VERSION VERSION_LESS 3.19)
     variable_watch("CMAKE_CURRENT_LIST_DIR" CGAL_run_at_the_end_of_configuration)
   else()
@@ -163,6 +193,7 @@ function(CGAL_install_hooks)
       cmake_language(DEFER CALL CGAL_hook_check_CMAKE_BUILD_TYPE)
     endif()
   endif()
+  set_property(DIRECTORY PROPERTY CGAL_hooks_installed TRUE)
 endfunction()
 
 CGAL_install_hooks()
diff --git a/Polyhedron/demo/Polyhedron/CMakeLists.txt b/Polyhedron/demo/Polyhedron/CMakeLists.txt
index a8235cdb832e..172b5bd63e91 100644
--- a/Polyhedron/demo/Polyhedron/CMakeLists.txt
+++ b/Polyhedron/demo/Polyhedron/CMakeLists.txt
@@ -196,7 +196,19 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
     message(STATUS "Qt6WebSockets was found. Using WebSockets is therefore possible.")
   endif()
 
-  #compilation_of__demo_framework is defined in polyhedron_demo_macros.cmake
+  # This custom target is useless. It is used only as a flag to
+  # detect that the test has already been created.
+  add_custom_target("compilation_of__demo_framework")
+  cgal_add_compilation_test(demo_framework)
+  if(TEST "compilation of  demo_framework")
+    set_property(TEST "compilation of  demo_framework"
+      APPEND PROPERTY LABELS "CGAL_build_system" "Installation" "${PROJECT_NAME}")
+    set_property(TEST "compilation of  demo_framework"
+      APPEND PROPERTY FIXTURES_SETUP "demo_framework_SetupFixture")
+    set_property(TEST "compilation of  demo_framework"
+      APPEND PROPERTY DEPENDS "check build system" "compilation of  CGAL_Qt6_moc_and_resources")
+  endif()
+
   # Let's define `three_EXPORT` during the compilation of `demo_framework`,
   # in addition of `demo_framework_EXPORT` (defined automatically by
   # CMake). That is to deal with the visibility of symbols of
@@ -219,13 +231,16 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
                                   ${Show_point_dialogUI_FILES})
   target_link_libraries(point_dialog PUBLIC Qt6::OpenGLWidgets Qt6::Gui
                                             Qt6::Widgets)
+  cgal_add_compilation_test(point_dialog)
 
   macro(add_item item_name)
     add_library(${item_name} SHARED ${ARGN})
     target_link_libraries(
       ${item_name} PUBLIC demo_framework CGAL::CGAL_Qt6 Qt6::OpenGLWidgets Qt6::Gui
                           Qt6::Widgets)
+    cgal_add_compilation_test(${item_name})
     add_to_cached_list(CGAL_EXECUTABLE_TARGETS ${item_name})
+    CGAL_install_hooks()
   endmacro(add_item)
 
   add_item(scene_triangulation_3_item Scene_triangulation_3_item.cpp)
@@ -360,9 +375,11 @@ if(CGAL_Qt6_FOUND AND Qt6_FOUND)
     target_compile_definitions(demo_framework PRIVATE -DCGAL_USE_WEBSOCKETS)
     target_link_libraries(polyhedron_demo PRIVATE Qt6::WebSockets)
   endif()
+  cgal_add_compilation_test(polyhedron_demo)
   add_executable(Polyhedron_3 Polyhedron_3.cpp)
   target_link_libraries(Polyhedron_3 PRIVATE polyhedron_demo)
   add_to_cached_list(CGAL_EXECUTABLE_TARGETS Polyhedron_3)
+  cgal_add_compilation_test(Polyhedron_3)
 
   target_link_libraries(Polyhedron_3 PRIVATE demo_framework)
 
diff --git a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
index d31b0aa911d3..6d87527630e1 100644
--- a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
+++ b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
@@ -35,23 +35,6 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
     if(TARGET demo_framework)
       target_link_libraries( ${plugin_name} PUBLIC demo_framework)
       add_dependencies(${plugin_name} demo_framework)
-      if(CGAL_ENABLE_TESTING AND NOT CMAKE_VS_MSBUILD_COMMAND)
-        if(NOT TARGET "compilation_of__demo_framework")
-              # This custom target is useless. It is used only as a flag to
-              # detect that the test has already been created.
-              add_custom_target("compilation_of__demo_framework")
-              add_dependencies( "compilation_of__demo_framework" demo_framework )
-              add_test(NAME "compilation of  demo_framework"
-                COMMAND "${CMAKE_COMMAND}" --build "${CMAKE_BINARY_DIR}" --target "demo_framework" --config "$<CONFIG>")
-
-              set_property(TEST "compilation of  demo_framework"
-                APPEND PROPERTY LABELS "CGAL_build_system" "Installation" "${PROJECT_NAME}")
-              set_property(TEST "compilation of  demo_framework"
-                APPEND PROPERTY FIXTURES_SETUP "demo_framework_SetupFixture")
-              set_property(TEST "compilation of  demo_framework"
-                APPEND PROPERTY DEPENDS "check build system" "compilation of  CGAL_Qt6_moc_and_resources")
-        endif()
-      endif()
     else()
       target_link_libraries( ${plugin_name} PUBLIC Polyhedron_demo_framework)
       add_dependencies(${plugin_name} Polyhedron_demo_framework)
@@ -98,4 +81,5 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
       string(TIMESTAMP VERSION "%Y-%m-%d %H:%M")
       file(APPEND ${filename} "\"ConfigDate\" : \"${VERSION}\" }")
     endif()
+    CGAL_install_hooks()
   endmacro(polyhedron_demo_plugin)

From ab19b99105cb81f4b96df167155b3c39defa9e6c Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 29 Jan 2024 16:16:17 +0000
Subject: [PATCH 1308/1398] Kernel_23:  Add function squared_length()

---
 .../Kernel_23/CGAL/Kernel/global_functions.h  | 34 +++++++++++++++++++
 .../include/CGAL/Kernel/global_functions_2.h  | 16 +++++++++
 .../include/CGAL/Kernel/global_functions_3.h  | 16 +++++++++
 .../CGAL/Kernel/global_functions_internal_2.h | 17 ++++++++++
 .../CGAL/Kernel/global_functions_internal_3.h | 16 +++++++++
 5 files changed, 99 insertions(+)

diff --git a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
index 243ca48a93e1..b26638c84b18 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
@@ -2691,6 +2691,40 @@ const CGAL::Point_3<Kernel>& r);
 /// \defgroup squared_distance_grp CGAL::squared_distance()
 /// \ingroup kernel_global_function
 
+/// \defgroup squared_radius_grp CGAL::squared_length()
+/// \ingroup kernel_global_function
+
+/*!
+compute the squared length of vector `v`.
+*/
+template <typename Kernel>
+FT
+squared_length(const CGAL::Vector_2<Kernel>& v);
+
+/*!
+compute the squared length of segment `s`.
+*/
+template <typename Kernel>
+FT
+squared_length(const CGAL::Segment_2<Kernel>& s);
+
+/*!
+compute the squared length of vector `v`.
+*/
+template <typename Kernel>
+FT
+squared_length(const CGAL::Vector_3<Kernel>& v);
+
+/*!
+compute the squared length of segment `s`.
+*/
+template <typename Kernel>
+FT
+squared_length(const CGAL::Segment_3<Kernel>& s);
+
+/// @}
+
+
 /// \defgroup squared_radius_grp CGAL::squared_radius()
 /// \ingroup kernel_global_function
 /// \sa `Circle_2<Kernel>_grp`
diff --git a/Kernel_23/include/CGAL/Kernel/global_functions_2.h b/Kernel_23/include/CGAL/Kernel/global_functions_2.h
index e974eae730dc..ad67bff10419 100644
--- a/Kernel_23/include/CGAL/Kernel/global_functions_2.h
+++ b/Kernel_23/include/CGAL/Kernel/global_functions_2.h
@@ -1114,6 +1114,22 @@ side_of_oriented_circle(const Point_2<K> &p,
   return internal::side_of_oriented_circle(p, q, r, t, K());
 }
 
+template < class K >
+inline
+typename K::FT
+squared_length(const Vector_2<K> &v)
+{
+  return internal::squared_length(v, K());
+}
+
+template < class K >
+inline
+typename K::FT
+squared_length(const Segment_2<K> &s)
+{
+  return internal::squared_length(s, K());
+}
+
 template < class K >
 inline
 typename K::FT
diff --git a/Kernel_23/include/CGAL/Kernel/global_functions_3.h b/Kernel_23/include/CGAL/Kernel/global_functions_3.h
index e17211e184be..aa16e5d7cb8c 100644
--- a/Kernel_23/include/CGAL/Kernel/global_functions_3.h
+++ b/Kernel_23/include/CGAL/Kernel/global_functions_3.h
@@ -1276,6 +1276,22 @@ squared_area(const Point_3<K> &p, const Point_3<K> &q, const Point_3<K> &r)
   return internal::squared_area(p, q, r, K());
 }
 
+template < class K >
+inline
+typename K::FT
+squared_length(const Vector_3<K> &v)
+{
+  return internal::squared_length(v, K());
+}
+
+template < class K >
+inline
+typename K::FT
+squared_length(const Segment_3<K> &s)
+{
+  return internal::squared_length(s, K());
+}
+
 template < class K >
 inline
 typename K::FT
diff --git a/Kernel_23/include/CGAL/Kernel/global_functions_internal_2.h b/Kernel_23/include/CGAL/Kernel/global_functions_internal_2.h
index 7212eb7ed60e..a7407a9fd74c 100644
--- a/Kernel_23/include/CGAL/Kernel/global_functions_internal_2.h
+++ b/Kernel_23/include/CGAL/Kernel/global_functions_internal_2.h
@@ -988,6 +988,23 @@ side_of_oriented_circle(const typename K::Point_2 &p,
   return k.side_of_oriented_circle_2_object()(p, q, r, t);
 }
 
+
+template <typename K>
+inline
+typename K::FT
+squared_length(const typename K::Vector_2 &v, const K &k)
+{
+  return k.compute_squared_length_2_object()(v);
+}
+
+template <typename K>
+inline
+typename K::FT
+squared_length(const typename K::Segment_2 &s, const K &k)
+{
+  return k.compute_squared_length_2_object()(s);
+}
+
 template < class K >
 inline
 typename K::FT
diff --git a/Kernel_23/include/CGAL/Kernel/global_functions_internal_3.h b/Kernel_23/include/CGAL/Kernel/global_functions_internal_3.h
index e48ec201f389..8ae26a9c787d 100644
--- a/Kernel_23/include/CGAL/Kernel/global_functions_internal_3.h
+++ b/Kernel_23/include/CGAL/Kernel/global_functions_internal_3.h
@@ -1112,6 +1112,22 @@ squared_area(const typename K::Point_3 &p,
   return k.compute_squared_area_3_object()(p, q, r);
 }
 
+template <typename K>
+inline
+typename K::FT
+squared_length(const typename K::Vector_3 &v, const K &k)
+{
+  return k.compute_squared_length_3_object()(v);
+}
+
+template <typename K>
+inline
+typename K::FT
+squared_length(const typename K::Segment_3 &s, const K &k)
+{
+  return k.compute_squared_length_3_object()(s);
+}
+
 template < class K >
 inline
 typename K::FT

From 276857a49cf4027b25d633209cf679baaa4ee64a Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 29 Jan 2024 16:22:20 +0000
Subject: [PATCH 1309/1398] fix grp

---
 Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
index b26638c84b18..59823ac96c88 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
@@ -2688,12 +2688,14 @@ const CGAL::Point_3<Kernel>& r);
 
 // The same reason as do_intersect.
 
-/// \defgroup squared_distance_grp CGAL::squared_distance()
+/// \defgroup squared_length_grp CGAL::squared_distance()
 /// \ingroup kernel_global_function
 
 /// \defgroup squared_radius_grp CGAL::squared_length()
 /// \ingroup kernel_global_function
 
+/// @{
+
 /*!
 compute the squared length of vector `v`.
 */

From e3ee9990246b7ca94adfd45bd320823ac349ef37 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Mon, 29 Jan 2024 16:26:29 +0000
Subject: [PATCH 1310/1398] fix grp

---
 Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
index 59823ac96c88..f0e1e50973fb 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
@@ -2688,10 +2688,10 @@ const CGAL::Point_3<Kernel>& r);
 
 // The same reason as do_intersect.
 
-/// \defgroup squared_length_grp CGAL::squared_distance()
+/// \defgroup squared_distance_grp CGAL::squared_distance()
 /// \ingroup kernel_global_function
 
-/// \defgroup squared_radius_grp CGAL::squared_length()
+/// \defgroup squared_length_grp CGAL::squared_length()
 /// \ingroup kernel_global_function
 
 /// @{

From e6b72fc7c8f6cd3b2ccc415dd4ecdc0879a041d3 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 29 Jan 2024 19:19:03 +0200
Subject: [PATCH 1311/1398] Cleaned up; added move constructor and move
 assignment

---
 Envelope_2/include/CGAL/Envelope_diagram_1.h | 320 ++++++-------------
 1 file changed, 99 insertions(+), 221 deletions(-)

diff --git a/Envelope_2/include/CGAL/Envelope_diagram_1.h b/Envelope_2/include/CGAL/Envelope_diagram_1.h
index 2d7b8e9f8199..6a3f533a1112 100644
--- a/Envelope_2/include/CGAL/Envelope_diagram_1.h
+++ b/Envelope_2/include/CGAL/Envelope_diagram_1.h
@@ -7,7 +7,8 @@
 // $Id$
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Ron Wein   <wein@post.tau.ac.il>
+// Author(s): Ron Wein   <wein@post.tau.ac.il>
+//            Efi Fogel  <efif@post.tau.ac.il>
 
 #ifndef CGAL_ENVELOPE_DIAGRAM_1_H
 #define CGAL_ENVELOPE_DIAGRAM_1_H
@@ -26,7 +27,7 @@ namespace CGAL {
  * A minimization (or a maximization) diagram that represents the lower (or the
  * upper) envelope of a set of curves in the plane.
  */
-template <class Traits_, class Allocator = CGAL_ALLOCATOR(int) >
+template <typename Traits_, typename Allocator = CGAL_ALLOCATOR(int) >
 class Envelope_diagram_1 {
 public:
   typedef Traits_                                   Traits_2;
@@ -37,228 +38,138 @@ class Envelope_diagram_1 {
   typedef typename Curve_container::const_iterator  Curve_const_iterator;
   typedef std::size_t                               Size;
 
-  /*!
-   * Representation of a diagram vertex, which stores the point it represents
+  /*! Representation of a diagram vertex, which stores the point it represents
    * and a list of all curves that pass at that point.
    */
   class Edge;
 
   class Vertex {
   private:
-    Point_2          _p;
-    Curve_container  _cvs;
+    Point_2 _p;
+    Curve_container _cvs;
     Edge* _leftP;
     Edge* _rightP;
 
   public:
     /*! Constructor. */
-    Vertex () :
+    Vertex() :
       _leftP(nullptr),
       _rightP(nullptr)
     {}
 
     /*! Constructor with a point. */
-    Vertex (const Point_2& p) :
+    Vertex(const Point_2& p) :
       _p(p),
       _leftP(nullptr),
       _rightP(nullptr)
     {}
 
     /*! Get the point. */
-    const Point_2& point () const
-    {
-      return (_p);
-    }
+    const Point_2& point() const { return _p; }
 
     /*! Get the number of curves associated with the vertex. */
-    Size number_of_curves () const
-    {
-      return (_cvs.size());
-    }
+    Size number_of_curves() const { return _cvs.size(); }
 
     /*! Get the range of curves associated with the vertex. */
-    Curve_const_iterator curves_begin () const
-    {
-      return (_cvs.begin());
-    }
+    Curve_const_iterator curves_begin() const { return _cvs.begin(); }
 
-    Curve_const_iterator curves_end () const
-    {
-      return (_cvs.end());
-    }
+    Curve_const_iterator curves_end() const { return _cvs.end(); }
 
     /*! Get the left edge (const version). */
-    const Edge* left () const
-    {
-      return (_leftP);
-    }
+    const Edge* left() const { return _leftP; }
 
     /*! Get the left edge (non-const version). */
-    Edge* left ()
-    {
-      return (_leftP);
-    }
+    Edge* left() { return _leftP; }
 
     /*! Get the right edge (const version). */
-    const Edge* right () const
-    {
-      return (_rightP);
-    }
+    const Edge* right() const { return _rightP; }
 
     /*! Get the right edge (non-const version). */
-    Edge* right ()
-    {
-      return (_rightP);
-    }
+    Edge* right() { return _rightP; }
 
     /*! Set the point. */
-    void set_point (const Point_2& p)
-    {
-      _p = p;
-    }
+    void set_point (const Point_2& p) { _p = p; }
 
     /*! Clear the list of curves. */
-    void clear_curves ()
-    {
-      _cvs.clear();
-    }
+    void clear_curves() { _cvs.clear(); }
 
     /*! Associate a new curve with the vertex. */
-    void add_curve (const X_monotone_curve_2& cv)
-    {
-      _cvs.push_back (cv);
-    }
+    void add_curve(const X_monotone_curve_2& cv) { _cvs.push_back(cv); }
 
     /*! Associate a range of new curves with the vertex. */
-    void add_curves (Curve_const_iterator begin, Curve_const_iterator end)
-    {
-      Curve_const_iterator  iter;
-
-      for (iter = begin; iter != end; ++iter)
-        _cvs.push_back (*iter);
-    }
+    void add_curves(Curve_const_iterator begin, Curve_const_iterator end)
+    { for (auto iter = begin; iter != end; ++iter) _cvs.push_back(*iter); }
 
     /*! Set the left edge. */
-    void set_left (Edge* e)
-    {
-      _leftP = e;
-    }
+    void set_left(Edge* e) { _leftP = e; }
 
     /*! Get the right edge. */
-    void set_right (Edge* e)
-    {
-      _rightP = e;
-    }
+    void set_right(Edge* e) { _rightP = e; }
   };
 
-  /*!
-   * Representation of a diagram edge, which represents an interval and
+  /*! Representation of a diagram edge, which represents an interval and
    * stores all curves that form the envelope on it (usually there's just one
    * curve or zero curves, unless the input contains overlapping curves).
    */
-  class Edge
-  {
+  class Edge {
   private:
-    Curve_container  _cvs;
+    Curve_container _cvs;
     Vertex* _leftP;
     Vertex* _rightP;
 
   public:
     /*! Constructor. */
-    Edge () :
+    Edge() :
       _leftP(nullptr),
       _rightP(nullptr)
     {}
 
     /*! Check if the edge represents an empty interval. */
-    bool is_empty () const
-    {
-      return (_cvs.empty());
-    }
+    bool is_empty() const { return _cvs.empty(); }
 
     /*! Get the number of curves associated with the edge. */
-    Size number_of_curves () const
-    {
-      return (_cvs.size());
-    }
+    Size number_of_curves() const { return _cvs.size(); }
 
-    /*!
-     * Get a representative x-monotone curve.
+    /*! Get a representative x-monotone curve.
      * \pre The edge does not represent an empty interval.
      */
-    const X_monotone_curve_2& curve () const
-    {
-      CGAL_precondition (! _cvs.empty());
+    const X_monotone_curve_2& curve() const {
+      CGAL_precondition(! _cvs.empty());
       return (*(_cvs.begin()));
     }
 
     /*! Get the range of curves associated with the edge. */
-    Curve_const_iterator curves_begin () const
-    {
-      return (_cvs.begin());
-    }
+    Curve_const_iterator curves_begin() const { return _cvs.begin(); }
 
-    Curve_const_iterator curves_end () const
-    {
-      return (_cvs.end());
-    }
+    Curve_const_iterator curves_end() const { return _cvs.end(); }
 
     /*! Get the left vertex (const version). */
-    const Vertex* left () const
-    {
-      return (_leftP);
-    }
+    const Vertex* left() const { return _leftP; }
 
     /*! Get the left vertex (const version). */
-    Vertex* left ()
-    {
-      return (_leftP);
-    }
+    Vertex* left() { return _leftP; }
 
     /*! Get the right vertex (const version). */
-    const Vertex* right () const
-    {
-      return (_rightP);
-    }
+    const Vertex* right() const { return _rightP; }
 
     /*! Get the right vertex (non-const version). */
-    Vertex* right ()
-    {
-      return (_rightP);
-    }
+    Vertex* right() { return _rightP; }
 
     /*! Clear the list of curves. */
-    void clear_curves ()
-    {
-      _cvs.clear();
-    }
+    void clear_curves() { _cvs.clear(); }
 
     /*! Associate a new curve with the edge. */
-    void add_curve (const X_monotone_curve_2& cv)
-    {
-      _cvs.push_back (cv);
-    }
+    void add_curve(const X_monotone_curve_2& cv) { _cvs.push_back (cv); }
 
     /*! Associate a range of new curves with the edge. */
-    void add_curves (Curve_const_iterator begin, Curve_const_iterator end)
-    {
-      Curve_const_iterator  iter;
-
-      for (iter = begin; iter != end; ++iter)
-        _cvs.push_back (*iter);
-    }
+    void add_curves(Curve_const_iterator begin, Curve_const_iterator end)
+    { for (auto iter = begin; iter != end; ++iter) _cvs.push_back (*iter); }
 
     /*! Set the left vertex. */
-    void set_left (Vertex* v)
-    {
-      _leftP = v;
-    }
+    void set_left(Vertex* v) { _leftP = v; }
 
     /*! Get the right vertex. */
-    void set_right (Vertex* v)
-    {
-      _rightP = v;
-    }
+    void set_right(Vertex* v) { _rightP = v; }
   };
 
   typedef Vertex*                        Vertex_handle;
@@ -267,7 +178,6 @@ class Envelope_diagram_1 {
   typedef const Edge*                    Edge_const_handle;
 
 private:
-
   // Vertex allocator.
   typedef std::allocator_traits<Allocator> Allocator_traits;
   typedef typename Allocator_traits::template rebind_alloc<Vertex> Vertex_allocator;
@@ -280,143 +190,111 @@ class Envelope_diagram_1 {
   Edge* _rightmostP;                  // The rightmost edge of the diagram
                                       // (representing the range to +oo).
 
-  Vertex_allocator  vertex_alloc;     // An allocator for vertices.
-  Edge_allocator    edge_alloc;       // An allocator for edges.
+  Vertex_allocator vertex_alloc;      // An allocator for vertices.
+  Edge_allocator edge_alloc;          // An allocator for edges.
 
 public:
+  /*! Constructor.
+   * An empty diagram contains one (empty) edge, representing (-oo, +oo):
+   */
+  Envelope_diagram_1() { _leftmostP = _rightmostP = new_edge(); }
 
-  /*!
-   * Constructor.
+  /*! Move constructor.
    */
-  Envelope_diagram_1 ()
-  {
-    // An empty diagram contains one (empty) edge, representing (-oo, +oo):
-    _leftmostP = _rightmostP = new_edge();
+  Envelope_diagram_1(Envelope_diagram_1&& other) {
+    _leftmostP = other._leftmostP;
+    _rightmostP = other._rightmostP;
+    other._leftmostP = other._rightmostP = new_edge();
   }
 
-  /*!
-   * Destructor.
+  /*! Move assignment operator.
    */
-  ~Envelope_diagram_1 ()
-  {
-    _free();
+  Envelope_diagram_1& operator=(Envelope_diagram_1&& other) {
+    _leftmostP = other._leftmostP;
+    _rightmostP = other._rightmostP;
+    other._leftmostP = other._rightmostP = new_edge();
+    return *this;
   }
 
-  /*!
-   * Get the leftmost edge of the diagram (const version).
+  /*! Destructor.
    */
-  Edge_const_handle leftmost () const
-  {
-    return (_leftmostP);
-  }
+  ~Envelope_diagram_1() { _free(); }
 
-  /*!
-   * Get the leftmost edge of the diagram (non-const version).
+  /*! Get the leftmost edge of the diagram (const version).
    */
-  Edge_handle leftmost ()
-  {
-    return (_leftmostP);
-  }
+  Edge_const_handle leftmost() const { return _leftmostP; }
 
-  /*!
-   * Get the rightmost edge of the diagram (const version).
+  /*! Get the leftmost edge of the diagram (non-const version).
    */
-  Edge_const_handle rightmost () const
-  {
-    return (_rightmostP);
-  }
+  Edge_handle leftmost() { return _leftmostP; }
 
-  /*!
-   * Get the rightmost edge of the diagram (non-const version).
+  /*! Get the rightmost edge of the diagram (const version).
    */
-  Edge_handle rightmost ()
-  {
-    return (_rightmostP);
-  }
+  Edge_const_handle rightmost() const { return _rightmostP; }
+
+  /*! Get the rightmost edge of the diagram (non-const version).
+   */
+  Edge_handle rightmost() { return _rightmostP; }
 
-  /*!
-   * Clear the diagram.
+  /*! Clear the diagram.
    */
-  void clear ()
-  {
+  void clear() {
     _free();
 
     // An empty diagram contains one (empty) edge, representing (-oo, +oo):
     _leftmostP = _rightmostP = new_edge();
   }
 
-  /*!
-   * Set the leftmost edge.
+  /*! Set the leftmost edge.
    */
-  void set_leftmost (Edge_handle e)
-  {
-    _leftmostP = e;
-  }
+  void set_leftmost(Edge_handle e) { _leftmostP = e; }
 
-  /*!
-   * Set the rightmost edge.
+  /*! Set the rightmost edge.
    */
-  void set_rightmost (Edge_handle e)
-  {
-    _rightmostP = e;
-  }
+  void set_rightmost(Edge_handle e) { _rightmostP = e; }
 
-  /*! Create a new vertex. */
-  Vertex_handle new_vertex (const Point_2& p)
-  {
+  /*! Create a new vertex.
+   */
+  Vertex_handle new_vertex(const Point_2& p) {
     Vertex* v = vertex_alloc.allocate (1);
     std::allocator_traits<Vertex_allocator>::construct(vertex_alloc, v, p);
     return (v);
   }
 
-  /*! Create a new edge. */
-  Edge_handle new_edge ()
-  {
+  /*! Create a new edge.
+   */
+  Edge_handle new_edge() {
     Edge* e = edge_alloc.allocate (1);
     std::allocator_traits<Edge_allocator>::construct(edge_alloc, e);
     return (e);
   }
 
-  /*! Delete an existing vertex. */
-  void delete_vertex (Vertex_handle v)
-  {
+  /*! Delete an existing vertex.
+   */
+  void delete_vertex(Vertex_handle v) {
     std::allocator_traits<Vertex_allocator>::destroy(vertex_alloc, v);
     vertex_alloc.deallocate (v, 1);
   }
 
-  /*! Delete an existing edge. */
-  void delete_edge (Edge_handle e)
-  {
+  /*! Delete an existing edge.
+   */
+  void delete_edge(Edge_handle e) {
     std::allocator_traits<Edge_allocator>::destroy(edge_alloc, e);
     edge_alloc.deallocate (e, 1);
   }
 
 private:
-  /*!
-   * Free all diagram elements.
+  /*! Free all diagram elements.
    */
-  void _free ()
-  {
-    Vertex* v;
+  void _free() {
     Edge* e = _leftmostP;
-
     while (e != nullptr) {
-      // Get a pointer to the next vertex.
-      v = e->right();
-
-      // Free the edge and update it to be the next one after v.
-      delete_edge (e);
-
-      if (v != nullptr) {
-        e = v->right();
-
-        // Free the current vertex.
-        delete_vertex (v);
-      }
-      else
-      {
-        e = nullptr;
-      }
+      Vertex* v = e->right();
+      delete_edge(e);
+      if (v == nullptr) break;
+
+      e = v->right();
+      delete_vertex(v);
     }
 
     _leftmostP = nullptr;

From 0bf75c9062d530e8fbfe6f6f0a0e71dc5ea23d27 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 29 Jan 2024 19:19:25 +0200
Subject: [PATCH 1312/1398] Cleaned up

---
 .../Envelope_2/Env_divide_and_conquer_2.h     | 257 +++++++-----------
 1 file changed, 99 insertions(+), 158 deletions(-)

diff --git a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h
index 4e17e189b114..adda5dca0649 100644
--- a/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h
+++ b/Envelope_2/include/CGAL/Envelope_2/Env_divide_and_conquer_2.h
@@ -15,13 +15,11 @@
 #include <CGAL/license/Envelope_2.h>
 
 
-#include <CGAL/Arr_enums.h>
-#include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
-
 #include <optional>
-
 #include <vector>
 
+#include <CGAL/Arr_enums.h>
+#include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 
 namespace CGAL {
 
@@ -29,11 +27,9 @@ namespace CGAL {
  * A class implementing the divide-and-conquer algorithm for computing the
  * lower (or upper) envelope of a set of curves.
  */
-template <class Traits_, class Diagram_>
-class Envelope_divide_and_conquer_2
-{
+template <typename Traits_, typename Diagram_>
+class Envelope_divide_and_conquer_2 {
 public:
-
   typedef Traits_                                  Traits_2;
   typedef typename Traits_2::Point_2               Point_2;
   typedef typename Traits_2::X_monotone_curve_2    X_monotone_curve_2;
@@ -42,11 +38,9 @@ class Envelope_divide_and_conquer_2
   typedef Diagram_                                 Envelope_diagram_1;
 
 protected:
-
   typedef Envelope_divide_and_conquer_2<Traits_2, Envelope_diagram_1>  Self;
 
-  enum Envelope_type
-  {
+  enum Envelope_type {
     LOWER,
     UPPER
   };
@@ -62,159 +56,118 @@ class Envelope_divide_and_conquer_2
   typedef Arr_traits_adaptor_2<Traits_2>           Traits_adaptor_2;
 
   // Data members:
-  const Traits_adaptor_2  *traits;        // The traits object.
-  bool                     own_traits;    // Whether we own the traits object.
-  Envelope_type            env_type;      // Either LOWER or UPPER.
+  const Traits_adaptor_2* traits;       // The traits object.
+  bool own_traits;                      // Whether we own the traits object.
+  Envelope_type env_type;               // Either LOWER or UPPER.
 
   // Copy constructor and assignment operator - not supported.
-  Envelope_divide_and_conquer_2 (const Self& );
-  Self& operator= (const Self& );
+  Envelope_divide_and_conquer_2(const Self&);
+  Self& operator=(const Self& );
 
 public:
-
-  /*!
-   * Constructor.
+  /*! Constructor.
    */
-  Envelope_divide_and_conquer_2 () :
+  Envelope_divide_and_conquer_2() :
     own_traits(true),
     env_type(LOWER)
-  {
-    traits = new Traits_adaptor_2;
-  }
+  { traits = new Traits_adaptor_2; }
 
-  /*!
-   * Constructor with a traits object.
+  /*! Constructor with a traits object.
    * \param _traits The traits object.
    */
-  Envelope_divide_and_conquer_2 (const Traits_2* _traits) :
+  Envelope_divide_and_conquer_2(const Traits_2* _traits) :
     own_traits(false),
     env_type(LOWER)
-  {
-    traits = static_cast<const Traits_adaptor_2*> (_traits);
-  }
+  { traits = static_cast<const Traits_adaptor_2*> (_traits); }
 
-  /*!
-   * Destructor.
+  /*! Destructor.
    */
-  ~Envelope_divide_and_conquer_2 ()
-  {
-    if (own_traits)
-      delete traits;
-  }
+  ~Envelope_divide_and_conquer_2()
+  { if (own_traits) delete traits; }
 
-  /*!
-   * Construct the lower (or upper) envelope to the given range of curves.
+  /*! Construct the lower (or upper) envelope to the given range of curves.
    * \param begin An iterator pointing at the beginning of the curves range.
    * \param end A past-the-end iterator for the curves range.
    * \param type The envelope type (true for lower, false of upper).
    * \param diagram Output: The minimization (or maximization) diagram.
    */
-  template <class CurvesIterator>
-  void insert_curves (CurvesIterator begin, CurvesIterator end,
-                      bool type,
-                      Envelope_diagram_1& diagram)
-  {
+  template <typename CurvesIterator>
+  void insert_curves(CurvesIterator begin, CurvesIterator end, bool type,
+                      Envelope_diagram_1& diagram) {
     // Subdivide the curves into x-monotone subcurves.
-    CurvesIterator                     it;
     std::list<std::variant<Point_2, X_monotone_curve_2>> objects;
-    std::list<X_monotone_curve_2>      x_curves;
+    std::list<X_monotone_curve_2> x_curves;
 
-    for (it = begin; it != end; it++)
-    {
+    for (auto it = begin; it != end; ++it) {
       // Split the current curve to x-monotone subcurves.
       objects.clear();
       traits->make_x_monotone_2_object()(*it, std::back_inserter(objects));
 
-      for (auto obj_it = objects.begin(); obj_it != objects.end(); ++obj_it)
-      {
-        if(const X_monotone_curve_2* xcv_ptr = std::get_if<X_monotone_curve_2>(&(*obj_it)))
+      for (auto obj_it = objects.begin(); obj_it != objects.end(); ++obj_it) {
+        if (const auto* xcv_ptr = std::get_if<X_monotone_curve_2>(&(*obj_it)))
           x_curves.push_back (*xcv_ptr);
       }
     }
 
     // Construct the envelope of the x-monotone curves.
-    insert_x_monotone_curves (x_curves.begin(), x_curves.end(),
-                              type,
-                              diagram);
-    return;
+    insert_x_monotone_curves(x_curves.begin(), x_curves.end(), type, diagram);
   }
 
-  /*!
-   * Construct the lower (or upper) envelope to the given range of
+  /*! Construct the lower (or upper) envelope to the given range of
    * x-monotone curves.
    * \param begin An iterator pointing at the beginning of the curves range.
    * \param end A past-the-end iterator for the curves range.
    * \param type The envelope type (true for lower, false for upper).
    * \param diagram Output: The minimization (or maximization) diagram.
    */
-  template <class XCurvesIterator>
-  void insert_x_monotone_curves (XCurvesIterator begin, XCurvesIterator end,
-                                 bool type,
-                                 Envelope_diagram_1& diagram)
-  {
+  template <typename XCurvesIterator>
+  void insert_x_monotone_curves(XCurvesIterator begin, XCurvesIterator end,
+                                bool type, Envelope_diagram_1& diagram) {
     // Set the envelope type.
     env_type = (type ? LOWER : UPPER);
 
     // Separate the regular curves from the vertical ones.
-    typename Traits_2::Is_vertical_2  is_vertical =
-                                              traits->is_vertical_2_object();
-
-    Curve_pointer_vector  reg_vec;
-    Curve_pointer_vector  vert_vec;
-    XCurvesIterator       iter;
-
-    for (iter = begin; iter != end; ++iter)
-    {
-      if (is_vertical (*iter))
-        vert_vec.push_back (&(*iter));
-      else
-        reg_vec.push_back (&(*iter));
+    auto is_vertical = traits->is_vertical_2_object();
+
+    Curve_pointer_vector reg_vec;
+    Curve_pointer_vector vert_vec;
+
+    for (auto iter = begin; iter != end; ++iter) {
+      if (is_vertical (*iter)) vert_vec.push_back (&(*iter));
+      else reg_vec.push_back (&(*iter));
     }
 
     // Construct the envelope for the non-vertical curves.
-    _construct_envelope_non_vertical (reg_vec.begin(), reg_vec.end(),
-                                      diagram);
+    _construct_envelope_non_vertical(reg_vec.begin(), reg_vec.end(), diagram);
 
     // Merge the vertical segments.
-    if (vert_vec.size() > 0)
-      _merge_vertical_segments (vert_vec,
-                                diagram);
-
-    return;
+    if (vert_vec.size() > 0) _merge_vertical_segments(vert_vec, diagram);
   }
 
-  /*!
-   * Get the traits object.
+  /*! Get the traits object.
    * \return A pointer to the traits object.
    */
-  Traits_2* get_traits () const
-  {
-    return (traits);
-  }
+  Traits_2* get_traits() const { return (traits); }
 
 protected:
-
-  /*!
-   * Construct the lower/upper envelope of the given list of non-vertical
+  /*! Construct the lower/upper envelope of the given list of non-vertical
    * curves.
    * \param begin The first x-monotone curve.
    * \param end A past-the-end iterator for the curves.
    * \param out_d Output: The minimization (or maximization) diagram.
    */
-  void _construct_envelope_non_vertical (Curve_pointer_iterator begin,
-                                         Curve_pointer_iterator end,
-                                         Envelope_diagram_1& out_d);
+  void _construct_envelope_non_vertical(Curve_pointer_iterator begin,
+                                        Curve_pointer_iterator end,
+                                        Envelope_diagram_1& out_d);
 
-  /*!
-   * Construct a singleton diagram, which matches a single curve.
+  /*! Construct a singleton diagram, which matches a single curve.
    * \param cv The x-monotone curve.
    * \param out_d Output: The minimization (or maximization) diagram.
    */
   void _construct_singleton_diagram (const X_monotone_curve_2& cv,
                                      Envelope_diagram_1& out_d);
 
-  /*
-   * Merge two minimization (or maximization) diagrams.
+  /* Merge two minimization (or maximization) diagrams.
    * \param d1 The first diagram,
    *           representing the envelope of the curve set C1.
    * \param d1 The first diagram,
@@ -222,12 +175,11 @@ class Envelope_divide_and_conquer_2
    * \param out_d Output: The merged diagram, representing the envelope of
    *                      the union of C1 and C2.
    */
-  void _merge_envelopes (const Envelope_diagram_1& d1,
-                         const Envelope_diagram_1& d2,
-                         Envelope_diagram_1& out_d);
+  void _merge_envelopes(const Envelope_diagram_1& d1,
+                        const Envelope_diagram_1& d2,
+                        Envelope_diagram_1& out_d);
 
-  /*!
-   * Compare two vertices.
+  /*! Compare two vertices.
    * \param v1 The first vertex.
    * \param v2 The second vertex.
    * \param same_x Output parameter: TRUE iff x(v1) = x(v2).
@@ -239,13 +191,12 @@ class Envelope_divide_and_conquer_2
    *                - we compute the upper envelope, and y(v1) < y(v2).
    *         EQUAL if v1 = v2.
    */
-  Comparison_result _compare_vertices (Vertex_const_handle v1,
-                                       Vertex_const_handle v2,
-                                       bool& same_x) const;
+  Comparison_result _compare_vertices(Vertex_const_handle v1,
+                                      Vertex_const_handle v2,
+                                      bool& same_x) const;
 
-  /*!
-   * Deal with an interval which is non-empty in one of the merged diagrams and
-   * empty in the other.
+  /*! Deal with an interval which is non-empty in one of the merged diagrams
+   * and empty in the other.
    * \param e The non-empty edge.
    * \param other_edge The empty edge.
    * \param v The next vertex to the right.
@@ -256,33 +207,32 @@ class Envelope_divide_and_conquer_2
    *                    the same place.
    * \param out_d The merged diagram.
    */
-  void _merge_single_interval (Edge_const_handle e,
-                               Edge_const_handle other_edge,
-                               Vertex_const_handle v, bool v_exists,
-                               Comparison_result origin_of_v,
-                               Envelope_diagram_1& out_d);
-
-
-  //! Compare the $y$-coordinates of two curves at their endpoints
-  /*! The function compares the $y$ values of two curves with a joint
-    range of $x$ values, at the end of the joint range.
-    \param xcv1 The first curve
-    \param xcv2 The second curve
-    \param curve_end ARR_MIN_END - compare the $y$ value of the smaller
-    endpoint, ARR_MAX_END - compare the $y$ value of the larger endpoint.
-    \pre The two $x$-monotone curves need to have a partially overlapping
-    $x$-ranges.
-    \return
-    \todo Move it to Arr_traits_adaptor ?
-  */
+  void _merge_single_interval(Edge_const_handle e,
+                              Edge_const_handle other_edge,
+                              Vertex_const_handle v, bool v_exists,
+                              Comparison_result origin_of_v,
+                              Envelope_diagram_1& out_d);
+
+
+  /*! Compare the $y$-coordinates of two curves at their endpoints
+   * The function compares the $y$ values of two curves with a joint
+   * range of $x$ values, at the end of the joint range.
+   * \param xcv1 The first curve
+   * \param xcv2 The second curve
+   * \param curve_end ARR_MIN_END - compare the $y$ value of the smaller
+   * endpoint, ARR_MAX_END - compare the $y$ value of the larger endpoint.
+   * \pre The two $x$-monotone curves need to have a partially overlapping
+   * $x$-ranges.
+   * \return
+   * \todo Move it to Arr_traits_adaptor ?
+   */
   Comparison_result compare_y_at_end(const X_monotone_curve_2& xcv1,
                                      const X_monotone_curve_2& xcv2,
                                      Arr_curve_end curve_end) const;
 
 
 
-  /*!
-   * Merge two non-empty intervals into the merged diagram.
+  /*! Merge two non-empty intervals into the merged diagram.
    * \param e1 The first non-empty edge.
    * \param is_leftmost1 Is it the leftmost edge in its diagram.
    * \param e2 The second non-empty edge.
@@ -295,14 +245,13 @@ class Envelope_divide_and_conquer_2
    *                    is still taken from e2.
    * \param out_d The merged diagram.
    */
-  void _merge_two_intervals (Edge_const_handle e1, bool is_leftmost1,
-                             Edge_const_handle e2, bool is_leftmost2,
-                             Vertex_const_handle v, bool v_exists,
-                             Comparison_result origin_of_v,
-                             Envelope_diagram_1& out_d);
-
-  /*!
-   * Append a vertex to the given diagram: The new vertex that represents the
+  void _merge_two_intervals(Edge_const_handle e1, bool is_leftmost1,
+                            Edge_const_handle e2, bool is_leftmost2,
+                            Vertex_const_handle v, bool v_exists,
+                            Comparison_result origin_of_v,
+                            Envelope_diagram_1& out_d);
+
+  /*! Append a vertex to the given diagram: The new vertex that represents the
    * given point as the new rightmost vertex of the diagram. The edge
    * between the current rightmost vertex and the new one contains the same
    * curves as the input edge.
@@ -311,53 +260,45 @@ class Envelope_divide_and_conquer_2
    * \param e The input edge.
    * \return A handle for the vertex.
    */
-  Vertex_handle _append_vertex (Envelope_diagram_1& diag,
-                                const Point_2& p, Edge_const_handle e);
+  Vertex_handle _append_vertex(Envelope_diagram_1& diag,
+                               const Point_2& p, Edge_const_handle e);
 
   /*! \struct
    * A functor used to sort vertical segments by their x-coordinate.
    */
-  class Less_vertical_segment
-  {
+  class Less_vertical_segment {
   private:
-
     typename Traits_2::Compare_x_2             comp_x;
     typename Traits_2::Construct_min_vertex_2  min_vertex;
 
   public:
-
-    Less_vertical_segment (const Traits_2 *traits) :
+    Less_vertical_segment(const Traits_2 *traits) :
         comp_x(traits->compare_x_2_object()),
         min_vertex(traits->construct_min_vertex_2_object())
     {}
 
-    bool operator() (const X_monotone_curve_2 *cv1,
-                     const X_monotone_curve_2 *cv2) const
-    {
-      return (comp_x (min_vertex (*cv1),
-                      min_vertex (*cv2)) == SMALLER);
-    }
+    bool operator()(const X_monotone_curve_2* cv1,
+                    const X_monotone_curve_2* cv2) const
+    { return(comp_x(min_vertex(*cv1), min_vertex(*cv2)) == SMALLER); }
   };
 
-  /*!
-   * Merge the vertical segments into the lower/upper envelope given as a
+  /*! Merge the vertical segments into the lower/upper envelope given as a
    * minimization (or maximization) diagram.
    * \param vert_vec The list of vertical segments.
    * \param out_d The input minimization (or maximization) diagram.
    *             The function merges the vertical segments into this diagram.
    */
-  void _merge_vertical_segments (Curve_pointer_vector& vert_vec,
-                                 Envelope_diagram_1& out_d);
+  void _merge_vertical_segments(Curve_pointer_vector& vert_vec,
+                                Envelope_diagram_1& out_d);
 
-  /*!
-   * Split a given diagram edge by inserting a vertex in its interior.
+  /*! Split a given diagram edge by inserting a vertex in its interior.
    * \param diag The diagram.
    * \param p The point that the new vertex is associated with.
    * \param e The edge to split.
    * \return A handle for the vertex.
    */
-  Vertex_handle _split_edge (Envelope_diagram_1& diag,
-                             const Point_2& p, Edge_handle e);
+  Vertex_handle _split_edge(Envelope_diagram_1& diag,
+                            const Point_2& p, Edge_handle e);
 
 };
 

From 1c7cdad3f0fcba820a8e78e0eff1b47474b1edba Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 29 Jan 2024 19:32:02 +0200
Subject: [PATCH 1313/1398] Cleaned up; replaced 'typedef' with 'using';
 replaced CGAL::Timer with std::chrono

---
 .../examples/Envelope_3/envelope_planes.cpp   |  76 +++++--------
 .../examples/Envelope_3/envelope_spheres.cpp  |  74 ++++++-------
 .../Envelope_3/envelope_triangles.cpp         | 102 +++++++-----------
 3 files changed, 97 insertions(+), 155 deletions(-)

diff --git a/Envelope_3/examples/Envelope_3/envelope_planes.cpp b/Envelope_3/examples/Envelope_3/envelope_planes.cpp
index 6595f5e9585e..ce8e77b6fe42 100644
--- a/Envelope_3/examples/Envelope_3/envelope_planes.cpp
+++ b/Envelope_3/examples/Envelope_3/envelope_planes.cpp
@@ -1,81 +1,63 @@
 //! \file examples/Envelope_3/ex_envelope_planes.cpp
 // Constructing the lower and the upper envelope of a set of planes.
 
+#include <iostream>
+#include <list>
+
 #include <CGAL/Exact_rational.h>
 #include <CGAL/Cartesian.h>
 #include <CGAL/Env_plane_traits_3.h>
 #include <CGAL/envelope_3.h>
-#include <iostream>
-#include <list>
-
-typedef CGAL::Exact_rational                             Number_type;
-typedef CGAL::Cartesian<Number_type>                     Kernel;
-typedef Kernel::Plane_3                                  Plane_3;
-typedef CGAL::Env_plane_traits_3<Kernel>                 Traits_3;
-typedef Traits_3::Surface_3                              Surface_3;
-typedef CGAL::Envelope_diagram_2<Traits_3>               Envelope_diagram_2;
 
+using Number_type = CGAL::Exact_rational;
+using Kernel = CGAL::Cartesian<Number_type>;
+using Plane_3 = Kernel::Plane_3;
+using Traits_3 = CGAL::Env_plane_traits_3<Kernel>;
+using Surface_3 = Traits_3::Surface_3;
+using Envelope_diagram_2 = CGAL::Envelope_diagram_2<Traits_3>;
 
 /* Auxiliary function - print the features of the given envelope diagram. */
-void print_diagram (const Envelope_diagram_2& diag)
-{
+void print_diagram(const Envelope_diagram_2& diag) {
   // Go over all arrangement faces.
-  Envelope_diagram_2::Face_const_iterator            fit;
-  Envelope_diagram_2::Ccb_halfedge_const_circulator  ccb;
-  Envelope_diagram_2::Surface_const_iterator         sit;
-
-  for (fit = diag.faces_begin(); fit != diag.faces_end(); ++fit)
-  {
+  for (auto fit = diag.faces_begin(); fit != diag.faces_end(); ++fit) {
     // Print the face boundary.
 
     // Print the vertices along the outer boundary of the face.
-    ccb = fit->outer_ccb();
-    std::cout << "[Face]  ";
-    do
-    {
-      if(!ccb->is_fictitious())
-        std::cout << '(' << ccb->curve() << ") ";
-      ++ccb;
-    } while (ccb != fit->outer_ccb());
+    auto ccb = fit->outer_ccb();
+    std::cout << "[Face] ";
+    do if (!ccb->is_fictitious()) std::cout << '(' << ccb->curve() << ") ";
+    while (++ccb != fit->outer_ccb());
 
     // Print the planes that induce the envelope on this face.
-    std::cout << "-->  " << fit->number_of_surfaces()
-              << " planes:";
+    std::cout << "--> " << fit->number_of_surfaces() << " planes:";
 
-    for (sit = fit->surfaces_begin(); sit != fit->surfaces_end(); ++sit)
+    for (auto sit = fit->surfaces_begin(); sit != fit->surfaces_end(); ++sit)
       std::cout << ' ' << sit->plane();
     std::cout << std::endl;
   }
-
-  return;
 }
 
 /* The main program: */
-int main ()
-{
+int main() {
   // Construct the input planes.
-  std::list<Surface_3>   planes;
+  std::list<Surface_3> planes;
 
-  planes.push_back (Surface_3(Plane_3(0, -1, 1, 0)));
-  planes.push_back (Surface_3(Plane_3(-1, 0, 1, 0)));
-  planes.push_back (Surface_3(Plane_3(0, 1 , 1, 0)));
-  planes.push_back (Surface_3(Plane_3(1, 0, 1,  0)));
+  planes.push_back(Surface_3(Plane_3(0, -1, 1, 0)));
+  planes.push_back(Surface_3(Plane_3(-1, 0, 1, 0)));
+  planes.push_back(Surface_3(Plane_3(0, 1 , 1, 0)));
+  planes.push_back(Surface_3(Plane_3(1, 0, 1,  0)));
 
   // Compute and print the minimization diagram.
-  Envelope_diagram_2      min_diag;
-
-  CGAL::lower_envelope_3 (planes.begin(), planes.end(), min_diag);
-
+  Envelope_diagram_2 min_diag;
+  CGAL::lower_envelope_3(planes.begin(), planes.end(), min_diag);
   std::cout << std::endl << "The minimization diagram:" << std::endl;
-  print_diagram (min_diag);
+  print_diagram(min_diag);
 
   // Compute and print the maximization diagram.
-  Envelope_diagram_2      max_diag;
-
-  CGAL::upper_envelope_3 (planes.begin(), planes.end(), max_diag);
-
+  Envelope_diagram_2 max_diag;
+  CGAL::upper_envelope_3(planes.begin(), planes.end(), max_diag);
   std::cout << std::endl << "The maximization diagram:" << std::endl;
   print_diagram (max_diag);
 
-  return (0);
+  return 0;
 }
diff --git a/Envelope_3/examples/Envelope_3/envelope_spheres.cpp b/Envelope_3/examples/Envelope_3/envelope_spheres.cpp
index 41c9bb4568ff..e71fb5bba14d 100644
--- a/Envelope_3/examples/Envelope_3/envelope_spheres.cpp
+++ b/Envelope_3/examples/Envelope_3/envelope_spheres.cpp
@@ -5,47 +5,44 @@
 
 #ifndef CGAL_USE_CORE
 #include <iostream>
-int main()
-{
+int main() {
   std::cout << "Sorry, this example needs CORE ..." << std::endl;
   return 0;
 }
 #else
 
+#include <iostream>
+#include <list>
+#include <chrono>
+
 #include <CGAL/Cartesian.h>
 #include <CGAL/CORE_algebraic_number_traits.h>
 #include <CGAL/Arr_conic_traits_2.h>
 #include <CGAL/Env_sphere_traits_3.h>
 #include <CGAL/envelope_3.h>
-#include <CGAL/Timer.h>
-#include <iostream>
-#include <list>
 
-typedef CGAL::CORE_algebraic_number_traits            Nt_traits;
-typedef Nt_traits::Rational                           Rational;
-typedef Nt_traits::Algebraic                          Algebraic;
-typedef CGAL::Cartesian<Rational>                     Rat_kernel;
-typedef Rat_kernel::Point_3                           Rat_point_3;
-typedef CGAL::Cartesian<Algebraic>                    Alg_kernel;
+using Nt_traits = CGAL::CORE_algebraic_number_traits;
+using Rational = Nt_traits::Rational;
+using Algebraic = Nt_traits::Algebraic;
+using Rat_kernel = CGAL::Cartesian<Rational>;
+using Rat_point_3 = Rat_kernel::Point_3;
+using Alg_kernel = CGAL::Cartesian<Algebraic>;
 
-typedef CGAL::Arr_conic_traits_2<Rat_kernel, Alg_kernel, Nt_traits>
-                                                      Conic_traits_2;
+using Conic_traits_2 =
+  CGAL::Arr_conic_traits_2<Rat_kernel, Alg_kernel, Nt_traits>;
 
-typedef CGAL::Env_sphere_traits_3<Conic_traits_2>     Traits_3;
-typedef Traits_3::Surface_3                           Sphere_3;
-typedef CGAL::Envelope_diagram_2<Traits_3>            Envelope_diagram_2;
+using Traits_3 = CGAL::Env_sphere_traits_3<Conic_traits_2>;
+using Sphere_3 = Traits_3::Surface_3;
+using Envelope_diagram_2 = CGAL::Envelope_diagram_2<Traits_3>;
 
-int main(int argc, char **argv)
-{
+int main(int argc, char* argv[]) {
   // Get the name of the input file from the command line, or use the default
   // fan_grids.dat file if no command-line parameters are given.
-  const char * filename = (argc > 1) ? argv[1] : "spheres.dat";
+  const char* filename = (argc > 1) ? argv[1] : "spheres.dat";
 
   // Open the input file.
-  std::ifstream     in_file(filename);
-
-  if (! in_file.is_open())
-  {
+  std::ifstream in_file(filename);
+  if (! in_file.is_open()) {
     std::cerr << "Failed to open " << filename << " ..." << std::endl;
     return 1;
   }
@@ -57,37 +54,28 @@ int main(int argc, char **argv)
   // <x_2> <y_2> <x_2> <R_2>       // center and squared radious of sphere #2.
   //   :     :     :     :
   // <x_n> <y_n> <x_n> <R_n>       // center and squared radious of sphere #n.
-  int                   n = 0;
-  std::list<Sphere_3>   spheres;
-  int                   x = 0, y = 0, z = 0, sqr_r = 0;
-  int                   i;
-
+  int n = 0;
+  std::list<Sphere_3> spheres;
+  int x = 0, y = 0, z = 0, sqr_r = 0;
   in_file >> n;
-  for (i = 0; i < n; ++i)
-  {
+  for (int i = 0; i < n; ++i) {
     in_file >> x >> y >> z >> sqr_r;
     spheres.push_back(Sphere_3(Rat_point_3(x, y, z), Rational(sqr_r)));
   }
   in_file.close();
+  std::cout << "Constructing the lower envelope of " << n << " spheres.\n";
 
   // Compute the lower envelope.
-  Envelope_diagram_2    min_diag;
-  CGAL::Timer           timer;
-
-  std::cout << "Constructing the lower envelope of "
-            << n << " spheres." << std::endl;
-
-  timer.start();
+  Envelope_diagram_2 min_diag;
+  auto start = std::chrono::system_clock::now();
   CGAL::lower_envelope_3(spheres.begin(), spheres.end(), min_diag);
-  timer.stop();
+  std::chrono::duration<double> secs = std::chrono::system_clock::now() - start;
 
   // Print the dimensions of the minimization diagram.
   std::cout << "V = " << min_diag.number_of_vertices()
-            << ",  E = " << min_diag.number_of_edges()
-            << ",  F = " << min_diag.number_of_faces() << std::endl;
-
-  std::cout << "Construction took " << timer.time()
-            << " seconds." << std::endl;
+            << ", E = " << min_diag.number_of_edges()
+            << ", F = " << min_diag.number_of_faces() << std::endl;
+  std::cout << "Construction took " << secs.count() << " seconds.\n";
 
   return 0;
 }
diff --git a/Envelope_3/examples/Envelope_3/envelope_triangles.cpp b/Envelope_3/examples/Envelope_3/envelope_triangles.cpp
index b8715c10b423..b16a229f2909 100644
--- a/Envelope_3/examples/Envelope_3/envelope_triangles.cpp
+++ b/Envelope_3/examples/Envelope_3/envelope_triangles.cpp
@@ -1,110 +1,82 @@
 //! \file examples/Envelope_3/ex_envelope_triangles.cpp
 // Constructing the lower and the upper envelope of a set of triangles.
 
+#include <iostream>
+#include <list>
+
 #include <CGAL/Exact_rational.h>
 #include <CGAL/Cartesian.h>
 #include <CGAL/Env_triangle_traits_3.h>
 #include <CGAL/Env_surface_data_traits_3.h>
 #include <CGAL/envelope_3.h>
-#include <iostream>
-#include <list>
 
-typedef CGAL::Exact_rational                             Number_type;
-typedef CGAL::Cartesian<Number_type>                     Kernel;
-typedef CGAL::Env_triangle_traits_3<Kernel>              Traits_3;
-typedef Kernel::Point_3                                  Point_3;
-typedef Traits_3::Surface_3                              Triangle_3;
-typedef CGAL::Env_surface_data_traits_3<Traits_3, char>  Data_traits_3;
-typedef Data_traits_3::Surface_3                         Data_triangle_3;
-typedef CGAL::Envelope_diagram_2<Data_traits_3>          Envelope_diagram_2;
+using Number_type = CGAL::Exact_rational;
+using Kernel = CGAL::Cartesian<Number_type>;
+using Traits_3 = CGAL::Env_triangle_traits_3<Kernel>;
+using Point_3 = Kernel::Point_3;
+using Triangle_3 = Traits_3::Surface_3;
+using Data_traits_3 = CGAL::Env_surface_data_traits_3<Traits_3, char>;
+using Data_triangle_3 = Data_traits_3::Surface_3;
+using Envelope_diagram_2 = CGAL::Envelope_diagram_2<Data_traits_3>;
 
 /* Auxiliary function - print the features of the given envelope diagram. */
-void print_diagram (const Envelope_diagram_2& diag)
-{
+void print_diagram(const Envelope_diagram_2& diag) {
   // Go over all arrangement faces.
-  Envelope_diagram_2::Face_const_iterator            fit;
-  Envelope_diagram_2::Ccb_halfedge_const_circulator  ccb;
-  Envelope_diagram_2::Surface_const_iterator         sit;
-
-  for (fit = diag.faces_begin(); fit != diag.faces_end(); ++fit)
-  {
+  for (auto fit = diag.faces_begin(); fit != diag.faces_end(); ++fit) {
     // Print the face boundary.
-    if (fit->is_unbounded())
-    {
-      std::cout << "[Unbounded face]";
-    }
-    else
-    {
+    if (fit->is_unbounded()) std::cout << "[Unbounded face]";
+    else {
       // Print the vertices along the outer boundary of the face.
-      ccb = fit->outer_ccb();
+      auto ccb = fit->outer_ccb();
       std::cout << "[Face]  ";
-      do
-      {
-        std::cout << '(' << ccb->target()->point() << ")  ";
-        ++ccb;
-      } while (ccb != fit->outer_ccb());
+      do std::cout << '(' << ccb->target()->point() << ")  ";
+      while (++ccb != fit->outer_ccb());
     }
 
     // Print the labels of the triangles that induce the envelope on this face.
-    std::cout << "-->  " << fit->number_of_surfaces()
-              << " triangles:";
+    std::cout << "-->  " << fit->number_of_surfaces() << " triangles:";
 
-    for (sit = fit->surfaces_begin(); sit != fit->surfaces_end(); ++sit)
+    for (auto sit = fit->surfaces_begin(); sit != fit->surfaces_end(); ++sit)
       std::cout << ' ' << sit->data();
     std::cout << std::endl;
   }
 
   // Go over all arrangement edges.
-  Envelope_diagram_2::Edge_const_iterator            eit;
+  Envelope_diagram_2::Edge_const_iterator eit;
 
-  for (eit = diag.edges_begin(); eit != diag.edges_end(); ++eit)
-  {
+  for (auto eit = diag.edges_begin(); eit != diag.edges_end(); ++eit) {
     // Print the labels of the triangles that induce the envelope on this edge.
     std::cout << "[Edge]  (" << eit->source()->point()
-              << ")  (" << eit->target()->point()
-              << ")  -->  " << eit->number_of_surfaces()
+              << ") (" << eit->target()->point()
+              << ") -->  " << eit->number_of_surfaces()
               << " triangles:";
 
-    for (sit = eit->surfaces_begin(); sit != eit->surfaces_end(); ++sit)
+    for (auto sit = eit->surfaces_begin(); sit != eit->surfaces_end(); ++sit)
       std::cout << ' ' << sit->data();
     std::cout << std::endl;
   }
-
-  return;
 }
 
 /* The main program: */
-int main ()
-{
+int main() {
   // Construct the input triangles, makred A and B.
-  std::list<Data_triangle_3>   triangles;
-
-  triangles.push_back (Data_triangle_3 (Triangle_3 (Point_3 (0, 0, 0),
-                                                    Point_3 (0, 6, 0),
-                                                    Point_3 (5, 3, 4)),
-                                        'A'));
-  triangles.push_back (Data_triangle_3 (Triangle_3 (Point_3 (6, 0, 0),
-                                                    Point_3 (6, 6, 0),
-                                                    Point_3 (1, 3, 4)),
-                                        'B'));
+  std::list<Data_triangle_3> triangles;
+  auto t1 = Triangle_3(Point_3 (0, 0, 0), Point_3 (0, 6, 0), Point_3 (5, 3, 4));
+  triangles.push_back(Data_triangle_3(t1, 'A'));
+  auto t2 = Triangle_3(Point_3 (6, 0, 0), Point_3 (6, 6, 0), Point_3 (1, 3, 4));
+  triangles.push_back(Data_triangle_3(t2, 'B'));
 
   // Compute and print the minimization diagram.
-  Envelope_diagram_2      min_diag;
-
-  CGAL::lower_envelope_3 (triangles.begin(), triangles.end(),
-                          min_diag);
-
+  Envelope_diagram_2 min_diag;
+  CGAL::lower_envelope_3(triangles.begin(), triangles.end(), min_diag);
   std::cout << std::endl << "The minimization diagram:" << std::endl;
-  print_diagram (min_diag);
+  print_diagram(min_diag);
 
   // Compute and print the maximization diagram.
-  Envelope_diagram_2      max_diag;
-
-  CGAL::upper_envelope_3 (triangles.begin(), triangles.end(),
-                          max_diag);
-
+  Envelope_diagram_2 max_diag;
+  CGAL::upper_envelope_3 (triangles.begin(), triangles.end(), max_diag);
   std::cout << std::endl << "The maximization diagram:" << std::endl;
   print_diagram (max_diag);
 
-  return (0);
+  return 0;
 }

From 7381e39e1fd28274239a5f67cc058622025f734d Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 29 Jan 2024 21:55:39 +0200
Subject: [PATCH 1314/1398] Cleaned up; eliminated local kernels

---
 Envelope_3/include/CGAL/Env_plane_traits_3.h  |  488 ++++---
 Envelope_3/include/CGAL/Env_sphere_traits_3.h |  499 ++++---
 .../include/CGAL/Env_surface_data_traits_3.h  |   86 +-
 .../include/CGAL/Env_triangle_traits_3.h      | 1225 +++++++----------
 4 files changed, 1100 insertions(+), 1198 deletions(-)

diff --git a/Envelope_3/include/CGAL/Env_plane_traits_3.h b/Envelope_3/include/CGAL/Env_plane_traits_3.h
index 85fbbf161be3..839f6e9553bd 100644
--- a/Envelope_3/include/CGAL/Env_plane_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_plane_traits_3.h
@@ -7,7 +7,8 @@
 // $Id$
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Baruch Zukerman     <baruchzu@post.tau.ac.il>
+// Author(s) : Baruch Zukerman    <baruchzu@post.tau.ac.il>
+//             Efi Fogel          <efifogel@gmail.com>
 
 #ifndef CGAL_ENV_PLANE_TRAITS_3_H
 #define CGAL_ENV_PLANE_TRAITS_3_H
@@ -27,169 +28,149 @@
 
 namespace CGAL {
 
-template <class Kernel_>
-class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_>
-{
+template <typename Kernel_>
+class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_> {
 public:
-  typedef Kernel_                              Kernel;
-  typedef typename Kernel::FT                  FT;
-  typedef Arr_linear_traits_2<Kernel>          Base;
-  typedef Env_plane_traits_3<Kernel>           Self;
-
-  typedef typename Base::Multiplicity          Multiplicity;
-  typedef typename Base::Point_2               Point_2;
-  typedef typename Base::Curve_2               Curve_2;
-  typedef typename Base::X_monotone_curve_2    X_monotone_curve_2;
-  typedef typename Kernel::Plane_3             Plane_3;
-  typedef typename Kernel::Vector_2            Vector_2;
-  typedef typename Kernel::Vector_3            Vector_3;
-  typedef typename Kernel::Segment_2           Segment_2;
-  typedef typename Kernel::Ray_2               Ray_2;
-  typedef typename Kernel::Line_2              Line_2;
-  typedef typename Kernel::Line_3              Line_3;
-  typedef std::pair<Curve_2, Multiplicity>     Intersection_curve;
-
-  typedef typename Base::Left_side_category    Left_side_category;
-  typedef typename Base::Bottom_side_category  Bottom_side_category;
-  typedef typename Base::Top_side_category     Top_side_category;
-  typedef typename Base::Right_side_category   Right_side_category;
-
-  class Is_vertical_3
-  {
+  using Kernel = Kernel_;
+  using FT = typename Kernel::FT;
+  using Base = Arr_linear_traits_2<Kernel>;
+  using Self = Env_plane_traits_3<Kernel>;
+
+  using Multiplicity = typename Base::Multiplicity;
+  using Point_2 = typename Base::Point_2;
+  using Curve_2 = typename Base::Curve_2;
+  using X_monotone_curve_2 = typename Base::X_monotone_curve_2;
+  using Plane_3 = typename Kernel::Plane_3;
+  using Vector_2 = typename Kernel::Vector_2;
+  using Vector_3 = typename Kernel::Vector_3;
+  using Segment_2 = typename Kernel::Segment_2;
+  using Ray_2 = typename Kernel::Ray_2;
+  using Line_2 = typename Kernel::Line_2;
+  using Line_3 = typename Kernel::Line_3;
+  using Intersection_curve = std::pair<Curve_2, Multiplicity>;
+
+  using Left_side_category = typename Base::Left_side_category;
+  using Bottom_side_category = typename Base::Bottom_side_category;
+  using Top_side_category = typename Base::Top_side_category;
+  using Right_side_category = typename Base::Right_side_category;
+
+  //!
+  class Is_vertical_3 {
   public:
-    bool operator()(const Plane_3& h) const
-    {
-      return CGAL::is_zero(h.c());
-    }
+    bool operator()(const Plane_3& h) const { return CGAL::is_zero(h.c()); }
   };
 
-  Is_vertical_3 is_vertical_3_object() const
-  {
-    return Is_vertical_3();
-  }
+  //! Obtain an Is_vertical_3 functor object.
+  Is_vertical_3 is_vertical_3_object() const { return Is_vertical_3(); }
 
-  class _Env_plane
-  {
+  //
+  class _Env_plane {
   protected:
-    Plane_3              m_plane;
-    Line_2               m_line;
-    bool                 m_is_all_plane; // true -> all plane, false -> halfplane
-    bool                 m_is_vert;
+    Plane_3 m_plane;
+    Line_2 m_line;
+    bool m_is_all_plane; // true -> all plane, false -> halfplane
+    bool m_is_vert;
 
   public:
-    _Env_plane()
-    {}
+    _Env_plane() {}
 
-    _Env_plane(const Plane_3& h) : m_plane(h),
-                                   m_is_all_plane(true)
-    {
+    _Env_plane(const Plane_3& h) : m_plane(h), m_is_all_plane(true) {
       Self s;
       m_is_vert = s.is_vertical_3_object()(h);
     }
 
-    _Env_plane(const Plane_3& h, const Line_2& l) : m_plane(h),
-                                                    m_line(l),
-                                                    m_is_all_plane(false),
-                                                    m_is_vert(false)
-    {
+    _Env_plane(const Plane_3& h, const Line_2& l) :
+      m_plane(h), m_line(l), m_is_all_plane(false), m_is_vert(false) {
       CGAL_precondition_code(Self s);
-      CGAL_precondition(!s.is_vertical_3_object()(h));
-    }
-
-    bool is_vertical() const
-    {
-      return m_is_vert;
+      CGAL_precondition(! s.is_vertical_3_object()(h));
     }
 
-    const Plane_3& plane() const
-    {
-      return m_plane;
-    }
+    bool is_vertical() const { return m_is_vert; }
 
+    const Plane_3& plane() const { return m_plane; }
 
-    operator Plane_3 () const
-    {
-      return (m_plane);
-    }
+    operator Plane_3() const { return m_plane; }
 
-    const Line_2& line() const
-    {
-      CGAL_assertion(!m_is_all_plane);
+    const Line_2& line() const {
+      CGAL_assertion(! m_is_all_plane);
       return m_line;
     }
 
-    bool is_all_plane() const
-    {
-      return m_is_all_plane;
-    }
+    bool is_all_plane() const { return m_is_all_plane; }
   };
 
-  typedef _Env_plane               Xy_monotone_surface_3;
-  typedef _Env_plane               Surface_3;
+  using Xy_monotone_surface_3 = _Env_plane;
+  using Surface_3 = _Env_plane;
 
-  class Make_xy_monotone_3
-  {
+  /*! Subdivide a given surface into \f$xy\f$-monotone parts.
+   */
+  class Make_xy_monotone_3 {
   public:
-
-    template <class OutputIterator>
-    OutputIterator operator()(const Surface_3& s,
-                              bool /* is_lower */,
-                              OutputIterator o) const
-    {
+    template <typename OutputIterator>
+    OutputIterator operator()(const Surface_3& s, bool /* is_lower */,
+                              OutputIterator o) const {
       *o++ = s;
       return o;
     }
   };
 
+  //! Obtain a Make_xy_monotone_3 functor object.
   Make_xy_monotone_3 make_xy_monotone_3_object() const
-  {
-    return Make_xy_monotone_3();
-  }
+  { return Make_xy_monotone_3(); }
 
-  class Compare_z_at_xy_3
-  {
-  public:
+  /*! Determine the relative \f$z\f$-order of two given \f$xy\f$-monotone
+   * surfaces at the \f$xy\f$-coordinates of a given point or \f$x\f$-monotone
+   * curve.
+   */
+  class Compare_z_at_xy_3 {
+  protected:
+    using Traits_3 = Env_plane_traits_3<Kernel>;
+
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
 
+    /*! Constructor
+     * \param traits the traits
+     */
+    Compare_z_at_xy_3(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_plane_traits_3<Kernel>;
+
+  public:
+    //
     Comparison_result operator()(const Point_2& p,
                                  const Xy_monotone_surface_3& h1,
-                                 const Xy_monotone_surface_3& h2) const
-    {
+                                 const Xy_monotone_surface_3& h2) const {
       const Plane_3& plane1 = h1.plane();
       const Plane_3& plane2 = h2.plane();
       Sign sign_of_c1c2 = CGAL::sign(plane1.c() * plane2.c());
       Sign sign_of_expr =
-        CGAL::sign ((p.x()*plane1.a() + p.y()*plane1.b() +
-                     plane1.d())*plane2.c() -
-                    (p.x()*plane2.a() + p.y()*plane2.b() +
-                     plane2.d())*plane1.c());
+        CGAL::sign((p.x()*plane1.a() + p.y()*plane1.b() +
+                    plane1.d())*plane2.c() -
+                   (p.x()*plane2.a() + p.y()*plane2.b() +
+                    plane2.d())*plane1.c());
       int i = -1 * static_cast<int>(sign_of_c1c2) *
         static_cast<int>(sign_of_expr);
       return static_cast<Comparison_result>(i);
     }
 
+    //
     Comparison_result operator()(const X_monotone_curve_2& cv,
                                  const Xy_monotone_surface_3& h1,
-                                 const Xy_monotone_surface_3& h2) const
-    {
-      Kernel k;
-      Point_2 p;
-      if(cv.is_segment())
-        p = k.construct_midpoint_2_object()(cv.left(), cv.right());
-      else
-        if(cv.is_ray())
-          p = k.construct_point_on_2_object()(cv.ray(), 1);
-        else
-        {
-          CGAL_assertion(cv.is_line());
-          p = k.construct_point_on_2_object()(cv.line(), 1);
-        }
+                                 const Xy_monotone_surface_3& h2) const {
+      const Kernel& kernel = m_traits;
+      Point_2 p = (cv.is_segment()) ?
+        kernel.construct_midpoint_2_object()(cv.left(), cv.right()) :
+        ((cv.is_ray()) ?
+         kernel.construct_point_on_2_object()(cv.ray(), 1) :
+         kernel.construct_point_on_2_object()(cv.line(), 1));
 
       return this->operator()(p, h1, h2);
     }
 
+    //
     Comparison_result operator()(const Xy_monotone_surface_3& h1,
-                                 const Xy_monotone_surface_3& h2) const
-    {
+                                 const Xy_monotone_surface_3& h2) const {
       CGAL_assertion(h1.is_all_plane() && h2.is_all_plane());
 
       const Plane_3& p1 = h1.plane();
@@ -201,35 +182,63 @@ class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_>
     }
   };
 
+  //! Obtain a Compare_z_at_xy_3 functor object.
   Compare_z_at_xy_3 compare_z_at_xy_3_object() const
-  {
-    return Compare_z_at_xy_3();
-  }
+  { return Compare_z_at_xy_3(*this); }
+
+  /*! Determine the relative \f$z\f$-order of the two given \f$xy\f$-monotone
+   * surfaces immediately above their projected intersection curve (a planar
+   * point \f$p\f$ is above an \f$x\f$-monotone curve \f$c\f$ if it is in the
+   * \f$x\f$-range of \f$c\f$, and lies to its left when the curve is traversed
+   * from its \f$xy\f$-lexicographically smaller endpoint to its larger
+   * endpoint).
+   */
+  class Compare_z_at_xy_above_3 {
+  protected:
+    using Traits_3 = Env_plane_traits_3<Kernel>;
+
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Compare_z_at_xy_above_3(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_plane_traits_3<Kernel>;
 
-  class Compare_z_at_xy_above_3
-  {
   public:
+    /*! Determine the relative \f$z\f$-order of the two given \f$xy\f$-monotone
+     * surfaces immediately above their projected intersection curve, which is
+     * also given.
+     *
+     * \param cv the intersection curve.
+     * \param h1 the first surface.
+     * \param h2 the second surface.
+     * \pre `h1` and `h2` are defined "above" `cv`, and their relative
+     * \f$z\f$-order is the same for some small enough neighborhood of points
+     * above `cv`.
+     */
     Comparison_result operator()(const X_monotone_curve_2& cv,
                                  const Xy_monotone_surface_3& h1,
-                                 const Xy_monotone_surface_3& h2) const
-    {
+                                 const Xy_monotone_surface_3& h2) const {
       const Plane_3& plane1 = h1.plane();
       const Plane_3& plane2 = h2.plane();
 
-      const FT& a1 = plane1.a(),
-        b1 = plane1.b(),
-        c1 = plane1.c();
+      const FT& a1 = plane1.a();
+      const FT& b1 = plane1.b();
+      const FT& c1 = plane1.c();
 
-      const FT& a2 = plane2.a(),
-        b2 = plane2.b(),
-        c2 = plane2.c();
+      const FT& a2 = plane2.a();
+      const FT& b2 = plane2.b();
+      const FT& c2 = plane2.c();
 
       // our line is a3*x + b3*y + c3 = 0
       // it is assumed that the planes intersect over this line
       const Line_2& line = cv.supp_line();
-      const FT& a3 = line.a(),
-        b3 = line.b(),
-        c3 = line.c();
+      const FT& a3 = line.a();
+      const FT& b3 = line.b();
+      const FT& c3 = line.c();
 
       // if the line was parallel to the y-axis (i.e x = const),
       // then it was enough to compare dz/dx of both planes
@@ -266,62 +275,97 @@ class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_>
       // are transformed to (v1,w1) and (v2,w2), so we need that w2 > w1
       // (otherwise the result should be multiplied by -1)
 
-      Kernel k;
-      Point_2 p1 (k.construct_point_on_2_object()(line, 0));
-      Point_2 p2 (k.construct_point_on_2_object()(line, 1));
+      const Kernel& kernel = m_traits;
+      Point_2 p1 = kernel.construct_point_on_2_object()(line, 0);
+      Point_2 p2 = kernel.construct_point_on_2_object()(line, 1);
 
-      if(k.compare_xy_2_object()(p1, p2) == LARGER)
-        std::swap(p1, p2);
+      if (kernel.compare_xy_2_object()(p1, p2) == LARGER) std::swap(p1, p2);
 
-      CGAL_assertion(k.compare_xy_2_object()(p1, p2) == SMALLER);
+      CGAL_assertion(kernel.compare_xy_2_object()(p1, p2) == SMALLER);
 
-      const FT& x1 = p1.x(),
-        y1 = p1.y(),
-        x2 = p2.x(),
-        y2 = p2.y();
+      const FT& x1 = p1.x();
+      const FT& y1 = p1.y();
+      const FT& x2 = p2.x();
+      const FT& y2 = p2.y();
 
       Sign s2 = CGAL_NTS sign(-b3*x1+a3*y1-(-b3*x2+a3*y2));
       return s1 * s2;
     }
-
   };
 
+  //! Obtain a Compare_z_at_xy_above_3 functor object.
   Compare_z_at_xy_above_3 compare_z_at_xy_above_3_object() const
-  {
-    return Compare_z_at_xy_above_3();
-  }
+  { return Compare_z_at_xy_above_3(*this); }
+
+  /*! Determine the relative \f$z\f$-order of the two given \f$xy\f$-monotone
+   * surfaces immediately below their projected intersection curve (a planar
+   * point \f$p\f$ is below an \f$x\f$-monotone curve \f$c\f$ if it is in the
+   * \f$x\f$-range of \f$c\f$, and lies to its left when the curve is traversed
+   * from its \f$xy\f$-lexicographically smaller endpoint to its larger
+   * endpoint).
+   */
+  class Compare_z_at_xy_below_3 {
+  protected:
+    using Traits_3 = Env_plane_traits_3<Kernel>;
+
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Compare_z_at_xy_below_3(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_plane_traits_3<Kernel>;
 
-  class Compare_z_at_xy_below_3
-  {
   public:
+    /*! Determine the relative \f$z\f$-order of the two given \f$xy\f$-monotone
+     * surfaces immediately below their projected intersection curve, which is
+     * also given.
+     *
+     * \param cv the intersection curve.
+     * \param h1 the first surface.
+     * \param h2 the second surface.
+     * \pre `h1` and `h2` are defined "above" `cv`, and their relative
+     * \f$z\f$-order is the same for some small enough neighborhood of points
+     * below `cv`.
+     */
     Comparison_result operator()(const X_monotone_curve_2& cv,
                                  const Xy_monotone_surface_3& h1,
-                                 const Xy_monotone_surface_3& h2) const
-    {
-      Compare_z_at_xy_above_3 cmp_above;
+                                 const Xy_monotone_surface_3& h2) const {
+      auto cmp_above = m_traits.compare_z_at_xy_above_3_object();
       return CGAL::opposite(cmp_above(cv, h1, h2));
     }
-
   };
 
+  //! Obtain a Compare_z_at_xy_below_3 functor object.
   Compare_z_at_xy_below_3 compare_z_at_xy_below_3_object() const
-  {
-    return Compare_z_at_xy_below_3();
-  }
+  { return Compare_z_at_xy_below_3(*this); }
 
+  /*! Compute all planar \f$x\f$-monotone curves and possibly isolated planar
+   * points that form the projection of the boundary of the given
+   * \f$xy\f$-monotone surface s onto the \f$xy\f$-plane.
+   */
+  class Construct_projected_boundary_2 {
+  protected:
+    using Traits_3 = Env_plane_traits_3<Kernel>;
 
-  class Construct_projected_boundary_2
-  {
-  public:
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Construct_projected_boundary_2(const Traits_3& traits) : m_traits(traits) {}
 
-    template <class OutputIterator>
+    friend class Env_plane_traits_3<Kernel>;
+
+  public:
+    template <typename OutputIterator>
     OutputIterator operator()(const Xy_monotone_surface_3& s,
-                              OutputIterator o) const
-    {
-      if(s.is_all_plane())
-      {
-        if(!s.is_vertical())
-          return o;
+                              OutputIterator o) const {
+      if (s.is_all_plane()) {
+        if (! s.is_vertical()) return o;
 
         const Plane_3& h = s.plane();
         Line_2 proj_line(h.a(), h.b(), h.d());
@@ -331,10 +375,10 @@ class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_>
       }
 
       // s is half-plane
-      Kernel k;
-      const Point_2& p1 = k.construct_point_on_2_object()(s.line(), 0);
-      const Point_2& p2 = k.construct_point_on_2_object()(s.line(), 1);
-      Comparison_result res = k.compare_xy_2_object()(p1, p2);
+      const Kernel& kernel = m_traits;
+      const Point_2& p1 = kernel.construct_point_on_2_object()(s.line(), 0);
+      const Point_2& p2 = kernel.construct_point_on_2_object()(s.line(), 1);
+      Comparison_result res = kernel.compare_xy_2_object()(p1, p2);
 
       Oriented_side side =
         (res == SMALLER) ? ON_POSITIVE_SIDE : ON_NEGATIVE_SIDE;
@@ -343,118 +387,106 @@ class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_>
     }
   };
 
+  //
   Construct_projected_boundary_2
   construct_projected_boundary_2_object() const
-  {
-    return Construct_projected_boundary_2();
-  }
+  { return Construct_projected_boundary_2(*this); }
 
+  /*! compute the projection of the intersections of the \f$xy\f$-monotone
+   * surfaces onto the \f$xy\f$-plane,
+   */
+  class Construct_projected_intersections_2 {
+  protected:
+    using Traits_3 = Env_plane_traits_3<Kernel>;
 
-  class Construct_projected_intersections_2
-  {
-  public:
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
 
-    template <class OutputIterator>
+    /*! Constructor
+     * \param traits the traits
+     */
+    Construct_projected_intersections_2(const Traits_3& traits) :
+      m_traits(traits)
+    {}
+
+    friend class Env_plane_traits_3<Kernel>;
+
+  public:
+    template <typename OutputIterator>
     OutputIterator operator()(const Xy_monotone_surface_3& s1,
                               const Xy_monotone_surface_3& s2,
-                              OutputIterator o) const
-    {
-      Kernel k;
+                              OutputIterator o) const {
+      const Kernel& kernel = m_traits;
 
       const Plane_3& h1 = s1.plane();
       const Plane_3& h2 = s2.plane();
 
-      if(s1.is_vertical() && s2.is_vertical())
-      {
+      if (s1.is_vertical() && s2.is_vertical()) {
         Line_2 l1(h1.a(), h1.b(), h1.d());
         Line_2 l2(h2.a(), h2.b(), h2.d());
-        auto obj = k.intersect_2_object()(l1, l2);
+        auto obj = kernel.intersect_2_object()(l1, l2);
 
-        if(const Point_2* p = std::get_if<Point_2>(&(*obj)))
-          *o++ = *p;
+        if (const auto* p = std::get_if<Point_2>(&(*obj))) *o++ = *p;
 
         // otherwise, the vertical planes are parallel or overlap, so we return
         // nothing.
         return o;
       }
 
-      if(s1.is_all_plane() && s2.is_all_plane())
-      {
-        auto obj = k.intersect_3_object()(h1, h2);
+      if (s1.is_all_plane() && s2.is_all_plane()) {
+        auto obj = kernel.intersect_3_object()(h1, h2);
         CGAL_assertion(obj != std::nullopt);
-        if(const Line_3* l = std::get_if<Line_3>(&(*obj)))
-          *o++ = Intersection_curve(project_xy(*l, k), 1);
-
+        if (const auto* l = std::get_if<Line_3>(&(*obj)))
+          *o++ = Intersection_curve(project_xy(*l, kernel), 1);
         return o;
       }
 
-      if(s1.is_all_plane() && !s2.is_all_plane())
-      {
-        auto obj = plane_half_plane_proj_intersection(h1,
-                                                      h2,
-                                                      s2.line(),
-                                                      k);
-        if(obj ==std::nullopt)
-          return o;
-        if(const Line_2* line = std::get_if<Line_2>(&(*obj)))
-        {
+      if (s1.is_all_plane() && ! s2.is_all_plane()) {
+        auto obj = plane_half_plane_proj_intersection(h1, h2, s2.line(), kernel);
+        if (obj == std::nullopt) return o;
+        if (const auto* line = std::get_if<Line_2>(&(*obj))) {
           *o++ = Intersection_curve(*line, 1);
           return o;
         }
-        if(const Ray_2* ray = std::get_if<Ray_2>(&(*obj)))
-        {
+        if (const auto* ray = std::get_if<Ray_2>(&(*obj))) {
           *o++ = Intersection_curve(*ray, 1);
           return o;
         }
         return o;
       }
-      if(!s2.is_all_plane() && s2.is_all_plane())
-      {
-        auto obj = plane_half_plane_proj_intersection(h2,
-                                                      h1,
-                                                      s1.line(),
-                                                      k);
-        if(obj == std::nullopt)
-          return o;
-        if(const Line_2* line = std::get_if<Line_2>(&(*obj)))
-        {
+      if (! s2.is_all_plane() && s2.is_all_plane()) {
+        auto obj = plane_half_plane_proj_intersection(h2, h1, s1.line(), kernel);
+        if (obj == std::nullopt) return o;
+        if (const auto* line = std::get_if<Line_2>(&(*obj))) {
           *o++ = Intersection_curve(*line, 1);
           return o;
         }
-        if(const Ray_2* ray = std::get_if<Ray_2>(&(*obj)))
-        {
+        if (const auto* ray = std::get_if<Ray_2>(&(*obj))) {
           *o++ = Intersection_curve(*ray, 1);
           return o;
         }
         return o;
       }
 
-      CGAL_assertion(!s2.is_all_plane() && !s2.is_all_plane());
-      auto obj =
-        half_plane_half_plane_proj_intersection(h1, s1.line(), h2, s2.line(), k);
+      CGAL_assertion(! s2.is_all_plane() && ! s2.is_all_plane());
+      auto obj = half_plane_half_plane_proj_intersection(h1, s1.line(),
+                                                         h2, s2.line(), kernel);
 
-      if(obj ==std::nullopt )
-        return o;
+      if (obj == std::nullopt) return o;
 
-      if(const Line_2* line = std::get_if<Line_2>(&(*obj)))
-      {
+      if (const auto* line = std::get_if<Line_2>(&(*obj))) {
         *o++ = Intersection_curve(*line, 1);
         return o;
       }
-      if(const Ray_2* ray = std::get_if<Ray_2>(&(*obj)))
-      {
+      if (const auto* ray = std::get_if<Ray_2>(&(*obj))) {
         *o++ = Intersection_curve(*ray, 1);
         return o;
       }
-
-      if(const Segment_2* seg = std::get_if<Segment_2>(&(*obj)))
-      {
+      if (const auto* seg = std::get_if<Segment_2>(&(*obj))) {
         *o++ = Intersection_curve(*seg, 1);
         return o;
       }
-
-      if(const Point_2* p = std::get_if<Point_2>(&(*obj)))
-      {
+      if (const auto* p = std::get_if<Point_2>(&(*obj))) {
         *o++ = *p;
         return o;
       }
@@ -462,12 +494,10 @@ class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_>
     }
   };
 
+  //! Obtain a Construct_projected_intersections_2 functor object.
   Construct_projected_intersections_2
   construct_projected_intersections_2_object() const
-  {
-    return Construct_projected_intersections_2();
-  }
-
+  { return Construct_projected_intersections_2(*this); }
 };
 
 } //namespace CGAL
diff --git a/Envelope_3/include/CGAL/Env_sphere_traits_3.h b/Envelope_3/include/CGAL/Env_sphere_traits_3.h
index 2a42d07f0a02..67959b4ebe3b 100644
--- a/Envelope_3/include/CGAL/Env_sphere_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_sphere_traits_3.h
@@ -7,10 +7,10 @@
 // $Id$
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
-//                 Baruch Zukerman        <baruchzu@post.tau.ac.il>
-//                 Ron Wein               <wein@post.tau.ac.il>
-//                 Efi Fogel              <fogel@post.tau.ac.il>
+// Author(s) : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+//             Baruch Zukerman        <baruchzu@post.tau.ac.il>
+//             Ron Wein               <wein@post.tau.ac.il>
+//             Efi Fogel              <efifogel@gmail.com>
 
 #ifndef CGAL_ENV_SPHERE_TRAITS_3_H
 #define CGAL_ENV_SPHERE_TRAITS_3_H
@@ -32,96 +32,115 @@ namespace CGAL {
 template <typename ConicTraits_2>
 class Env_sphere_traits_3 : public ConicTraits_2 {
 public:
-  typedef ConicTraits_2                                 Traits_2;
-  typedef Env_sphere_traits_3<Traits_2>                 Self;
+  using Traits_2 = ConicTraits_2;
 
-  typedef typename Traits_2::Point_2                    Point_2;
-  typedef typename Traits_2::Curve_2                    Curve_2;
-  typedef typename Traits_2::X_monotone_curve_2         X_monotone_curve_2;
-  typedef typename Traits_2::Multiplicity               Multiplicity;
+  using Point_2 = typename Traits_2::Point_2;
+  using Curve_2 = typename Traits_2::Curve_2;
+  using X_monotone_curve_2 = typename Traits_2::X_monotone_curve_2;
+  using Multiplicity = typename Traits_2::Multiplicity;
 
-  typedef typename Traits_2::Rat_kernel                 Rat_kernel;
-  typedef typename Traits_2::Alg_kernel                 Alg_kernel;
-  typedef typename Traits_2::Nt_traits                  Nt_traits;
+  using Rat_kernel = typename Traits_2::Rat_kernel;
+  using Alg_kernel = typename Traits_2::Alg_kernel;
+  using Nt_traits = typename Traits_2::Nt_traits;
 
-  typedef typename Rat_kernel::FT                       Rational;
-  typedef typename Rat_kernel::Point_2                  Rat_point_2;
-  typedef typename Rat_kernel::Segment_2                Rat_segment_2;
-  typedef typename Rat_kernel::Line_2                   Rat_line_2;
-  typedef typename Rat_kernel::Circle_2                 Rat_circle_2;
-  typedef typename Rat_kernel::Point_3                  Rat_point_3;
+  using Rational = typename Rat_kernel::FT;
+  using Rat_point_2 = typename Rat_kernel::Point_2;
+  using Rat_segment_2 = typename Rat_kernel::Segment_2;
+  using Rat_line_2 = typename Rat_kernel::Line_2;
+  using Rat_circle_2 = typename Rat_kernel::Circle_2;
+  using Rat_point_3 = typename Rat_kernel::Point_3;
 
-  typedef typename Alg_kernel::FT                       Algebraic;
-  typedef typename Alg_kernel::Point_2                  Alg_point_2;
-  typedef typename Alg_kernel::Circle_2                 Alg_circle_2;
+  using Algebraic = typename Alg_kernel::FT;
+  using Alg_point_2 = typename Alg_kernel::Point_2;
+  using Alg_circle_2 = typename Alg_kernel::Circle_2;
 
-  typedef typename Rat_kernel::Sphere_3                 Surface_3;
+  using Surface_3 = typename Rat_kernel::Sphere_3;
 
   // here we refer to the lower part of the sphere only
-  typedef Surface_3                                     Xy_monotone_surface_3;
+  using Xy_monotone_surface_3 = Surface_3;
 
 protected:
-  typedef std::pair<X_monotone_curve_2, Multiplicity>   Intersection_curve;
+  using Intersection_curve = std::pair<X_monotone_curve_2, Multiplicity>;
 
 public:
+  /*! Subdivide a given surface into \f$xy\f$-monotone parts.
+   */
   class Make_xy_monotone_3 {
   protected:
-    const Self& parent;
+    using Traits_3 = Env_sphere_traits_3<Traits_2>;
 
-  public:
-    Make_xy_monotone_3(const Self * p) : parent(*p) {}
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Make_xy_monotone_3(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_sphere_traits_3<Traits_2>;
 
+  public:
     // create xy-monotone surfaces from a general surface
     // return a past-the-end iterator
-    template <class OutputIterator>
-    OutputIterator operator()(const Surface_3& s,
-                              bool is_lower,
-                              OutputIterator o) const
-    {
+    template <typename OutputIterator>
+    OutputIterator operator()(const Surface_3& s, bool is_lower,
+                              OutputIterator o) const {
       // our half sphere is of same type as our full sphere since we always
       // need only the lower/upper part of each sphere
-      parent.m_is_lower = is_lower;
+      m_traits.m_is_lower = is_lower;
       *o++ = s;
       return o;
     }
   };
 
-  /*! Get a Make_xy_monotone_3 functor object. */
-  Make_xy_monotone_3
-  make_xy_monotone_3_object() const { return Make_xy_monotone_3(this); }
+  /*! Obtain a Make_xy_monotone_3 functor object. */
+  Make_xy_monotone_3 make_xy_monotone_3_object() const
+  { return Make_xy_monotone_3(*this); }
 
+  /*! Compute all planar \f$x\f$-monotone curves and possibly isolated planar
+   * points that form the projection of the boundary of the given
+   * \f$xy\f$-monotone surface s onto the \f$xy\f$-plane.
+   */
   class Construct_projected_boundary_2 {
   protected:
-    const Self& parent;
+    using Traits_3 = Env_sphere_traits_3<Traits_2>;
 
-  public:
-    Construct_projected_boundary_2(const Self* p) : parent(*p) {}
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
 
+    /*! Constructor
+     * \param traits the traits
+     */
+    Construct_projected_boundary_2(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_sphere_traits_3<Traits_2>;
+
+  public:
     // insert into the OutputIterator all the (2d) curves of the boundary of
     // the vertical projection of the surface on the xy-plane
     // the OutputIterator value type is X_monotone_curve_2
-    template <class OutputIterator>
+    template <typename OutputIterator>
     OutputIterator
     operator()(const Xy_monotone_surface_3& s, OutputIterator o) const {
-      const auto gt_2 = parent.geometry_traits_2();
+      const Traits_2& gt2 = m_traits;
 
       // the projected boundary in a circle, with a projected center,
       // and same radius
-      Rat_point_2 proj_center = parent.project(s.center());
+      Rat_point_2 proj_center = m_traits.project(s.center());
       Rat_circle_2 circ(proj_center, s.squared_radius());
-      Curve_2 curve = gt_2->construct_curve_2_object()(circ);
-      typedef std::variant<X_monotone_curve_2, Point_2> Variant;
+      Curve_2 curve = gt2.construct_curve_2_object()(circ);
+      using Variant = std::variant<X_monotone_curve_2, Point_2>;
       Variant objs[2];
 
       CGAL_assertion_code(Variant* p = )
-      parent.make_x_monotone_2_object()(curve, objs);
+      m_traits.make_x_monotone_2_object()(curve, objs);
       CGAL_assertion(p == objs + 2);
 
-      const X_monotone_curve_2* cv1 = std::get_if<X_monotone_curve_2>(&(objs[0]));
-      const X_monotone_curve_2* cv2 = std::get_if<X_monotone_curve_2>(&(objs[1]));
+      const auto* cv1 = std::get_if<X_monotone_curve_2>(&(objs[0]));
+      const auto* cv2 = std::get_if<X_monotone_curve_2>(&(objs[1]));
 
-      CGAL_assertion(cv1!=nullptr);
-      CGAL_assertion(cv2!=nullptr);
+      CGAL_assertion(cv1 != nullptr);
+      CGAL_assertion(cv2 != nullptr);
 
       if (cv1->is_lower()) {
         CGAL_assertion(cv2->is_upper());
@@ -138,39 +157,52 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     }
   };
 
-  /*! Get a Construct_projected_boundary_2 functor object. */
+  /*! Obtain a Construct_projected_boundary_2 functor object. */
   Construct_projected_boundary_2
   construct_projected_boundary_2_object() const
-  { return Construct_projected_boundary_2(this); }
+  { return Construct_projected_boundary_2(*this); }
 
+  /*! compute the projection of the intersections of the \f$xy\f$-monotone
+   * surfaces onto the \f$xy\f$-plane,
+   */
   class Construct_projected_intersections_2 {
   protected:
-    const Self& parent;
+    using Traits_3 = Env_sphere_traits_3<Traits_2>;
 
-  public:
-    Construct_projected_intersections_2(const Self * p) : parent(*p) {}
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Construct_projected_intersections_2(const Traits_3& traits) :
+      m_traits(traits)
+    {}
 
+    friend class Env_sphere_traits_3<Traits_2>;
+
+  public:
     // insert into OutputIterator all the (2d) projections on the xy plane of
     // the intersection objects between the 2 surfaces
     // the data type of OutputIterator is Object
     template <typename OutputIterator>
-    OutputIterator
-    operator()(const Xy_monotone_surface_3& s1, const Xy_monotone_surface_3& s2,
-               OutputIterator o) const {
-      const auto gt_2 = parent.geometry_traits_2();
-      auto ctr_cv = gt_2->construct_curve_2_object();
-      auto nt_traits = gt_2->nt_traits();
-
-      Rat_point_3 p1 = s1.center();
-      Rat_point_3 p2 = s2.center();
-      const Rational a1 = p1.x();
-      const Rational b1 = p1.y();
-      const Rational c1 = p1.z();
-      const Rational a2 = p2.x();
-      const Rational b2 = p2.y();
-      const Rational c2 = p2.z();
-      const Rational sqr_r1 = s1.squared_radius();
-      const Rational sqr_r2 = s2.squared_radius();
+    OutputIterator operator()(const Xy_monotone_surface_3& s1,
+                              const Xy_monotone_surface_3& s2,
+                              OutputIterator o) const {
+      const Traits_2& gt2 = m_traits;
+      auto ctr_cv = gt2.construct_curve_2_object();
+      auto nt_traits = gt2.nt_traits();
+
+      const Rat_point_3& p1 = s1.center();
+      const Rat_point_3& p2 = s2.center();
+      const Rational& a1 = p1.x();
+      const Rational& b1 = p1.y();
+      const Rational& c1 = p1.z();
+      const Rational& a2 = p2.x();
+      const Rational& b2 = p2.y();
+      const Rational& c2 = p2.z();
+      const Rational& sqr_r1 = s1.squared_radius();
+      const Rational& sqr_r2 = s2.squared_radius();
 
       // // the spheres intersect iff d(p1, p2) <= (r1+r2)
       // // squaring this twice, we get the condition
@@ -225,7 +257,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           Rational B = -8*b1*sqr_a_diff;
           Rational C = 4*sqr_a_diff*(sqr_a1+sqr_b1-sqr_r1) + m*m - 4*m*a1*a_diff;
 
-          Algebraic  ys[2];
+          Algebraic ys[2];
 
           Algebraic* ys_end = nt_traits->solve_quadratic_equation(A, B, C, ys);
           std::ptrdiff_t n_ys = ys_end - ys;
@@ -254,7 +286,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           // 2(a1-a2)x - m = 0
           Curve_2 res = ctr_cv(0, 0, 0, 2*a_diff, 0, -m, COLLINEAR, end1, end2);
 
-          parent.add_curve_to_output(res, o);
+          m_traits.add_curve_to_output(res, o);
           //*o++ = Intersection_curve(res, TRANSVERSAL);
         }
         else {
@@ -328,7 +360,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           // 2(a1-a2)x + 2(b1-b2)y - m = 0
           Curve_2 res =
             ctr_cv(0,0,0, 2*a_diff, 2*b_diff, -m, COLLINEAR, end1, end2);
-          parent.add_curve_to_output(res, o);
+          m_traits.add_curve_to_output(res, o);
           //*o++ = Intersection_curve(res, TRANSVERSAL);
         }
       }
@@ -401,14 +433,14 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
         // if the full spheres do not intersect, the equation we get has no
         // real solution, so we should check it:
         bool ellipse_is_point = false;
-        if (! parent.is_valid_conic_equation(R, S, T, U, V, W, ellipse_is_point))
+        if (! m_traits.is_valid_conic_equation(R, S, T, U, V, W, ellipse_is_point))
           return o;
 
         // we need only a part of the ellipse (as stated in (**)) so we
         // construct the cutting line, which is:
         //    equation (*) <= min(c1,c2)    -- for lower envelope
         //    equation (*) >= max(c1,c2)    -- for upper envelope
-        Rational z_plane = (parent.m_is_lower) ?
+        Rational z_plane = (m_traits.m_is_lower) ?
           ((c1 < c2) ? c1 : c2) : ((c1 > c2) ? c1 : c2);
 
 
@@ -423,7 +455,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
 
         // for upper envelope, we should multiply the line equation by -1
         int envelope_coef = 1;
-        if (! parent.m_is_lower) envelope_coef = -1;
+        if (! m_traits.m_is_lower) envelope_coef = -1;
 
         Sign sign_c_diff = CGAL_NTS sign(c_diff);
         Rational la = envelope_coef*2*a_diff*sign_c_diff;
@@ -454,13 +486,12 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
         // intersection - in which case lc >= 0
         // or there is no intersection at all between the 2 half spheres -
         // in which case lc < 0
-        if (CGAL_NTS compare(a_diff, zero) == EQUAL &&
-            CGAL_NTS compare(b_diff, zero) == EQUAL)
-        {
+        if ((CGAL_NTS compare(a_diff, zero) == EQUAL) &&
+            (CGAL_NTS compare(b_diff, zero) == EQUAL)) {
           Sign sign_lc = CGAL_NTS sign(lc);
           if (sign_lc != NEGATIVE) {
             Curve_2 res = ctr_cv(R, S, T, U, V, W);
-            parent.add_curve_to_output(res, o);
+            m_traits.add_curve_to_output(res, o);
             //*o++ = Intersection_curve(res, TRANSVERSAL);
           }
           return o;
@@ -510,7 +541,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
             Curve_2 inter_cv = ctr_cv(R, S, T, U, V, W);
 
             CGAL_precondition_code(x_mid_n_y_points = )
-              gt_2->points_at_x(inter_cv, x_mid_point, x_mid_y_points);
+              gt2.points_at_x(inter_cv, x_mid_point, x_mid_y_points);
 
             CGAL_precondition(x_mid_n_y_points > 0);
 
@@ -566,7 +597,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
             Curve_2 inter_cv = ctr_cv(R, S, T, U, V, W);
 
             CGAL_precondition_code(int y_mid_n_x_points =)
-            gt_2->points_at_y(inter_cv, y_mid_point, y_mid_x_points);
+            gt2.points_at_y(inter_cv, y_mid_point, y_mid_x_points);
             CGAL_precondition(y_mid_n_x_points > 0);
 
             Algebraic x1 = y_mid_x_points[0].x(), x2 = y_mid_x_points[1].x();
@@ -600,7 +631,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           Alg_point_2 vtan_ps[2];
 
           CGAL_assertion_code(std::size_t n_vtan_ps =)
-            gt_2->vertical_tangency_points(inter_cv, vtan_ps);
+            gt2.vertical_tangency_points(inter_cv, vtan_ps);
 
           CGAL_assertion(n_vtan_ps == 2);
 
@@ -609,7 +640,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           Sign lval_sign = CGAL_NTS sign(lval);
           if (lval_sign == POSITIVE) {
             // the full ellipse is in the positive side
-            parent.add_curve_to_output(inter_cv, o);
+            m_traits.add_curve_to_output(inter_cv, o);
             //*o++ = Intersection_curve(inter_cv, TRANSVERSAL);
             return o;
           }
@@ -630,7 +661,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
           lval_sign = CGAL_NTS sign(lval);
           CGAL_assertion(lval_sign != ZERO);
 
-          if (lval_sign == POSITIVE) parent.add_curve_to_output(inter_cv, o);
+          if (lval_sign == POSITIVE) m_traits.add_curve_to_output(inter_cv, o);
             //*o++ = Intersection_curve(inter_cv, TRANSVERSAL);
           else *o++ = Point_2(source);
 
@@ -644,14 +675,14 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
         // If the mid-point forms a left-turn with the source and the target
         // points, the orientation is positive (going counterclockwise).
         // Otherwise, it is negative (going clockwise).
-        auto alg_kernel = gt_2->alg_kernel();
+        auto alg_kernel = gt2.alg_kernel();
         auto orient_f = alg_kernel->orientation_2_object();
         Orientation orient = (orient_f(source, pmid, target) == LEFT_TURN) ?
           CGAL::COUNTERCLOCKWISE : CGAL::CLOCKWISE;
 
         Curve_2 res = ctr_cv(R, S, T, U, V, W, orient, source, target);
         CGAL_assertion(res.is_valid());
-        parent.add_curve_to_output(res, o);
+        m_traits.add_curve_to_output(res, o);
         //*o++ = Intersection_curve(res, TRANSVERSAL);
       }
 
@@ -659,18 +690,30 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     }
   };
 
-  /*! Get a Construct_projected_intersections_2 functor object. */
+  /*! Obtain a Construct_projected_intersections_2 functor object. */
   Construct_projected_intersections_2
   construct_projected_intersections_2_object() const
-  { return Construct_projected_intersections_2(this); }
+  { return Construct_projected_intersections_2(*this); }
 
+  /*! Determine the relative \f$z\f$-order of two given \f$xy\f$-monotone
+   * surfaces at the \f$xy\f$-coordinates of a given point or \f$x\f$-monotone
+   * curve.
+   */
   class Compare_z_at_xy_3 {
   protected:
-    const Self& parent;
+    using Traits_3 = Env_sphere_traits_3<Traits_2>;
 
-  public:
-    Compare_z_at_xy_3(const Self* p) : parent(*p) {}
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Compare_z_at_xy_3(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_sphere_traits_3<Traits_2>;
 
+  public:
     // check which of the surfaces is closer to the envelope at the xy
     // coordinates of point (i.e. lower if computing the lower envelope, or
     // upper if computing the upper envelope)
@@ -697,9 +740,8 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
                                  const Xy_monotone_surface_3& s1,
                                  const Xy_monotone_surface_3& s2) const {
       // we compute a middle point on cv and use the previous function
-      Point_2 mid = parent.construct_middle_point(cv);
-      Comparison_result res = parent.compare_z_at_xy_3_object()(mid, s1, s2);
-      return res;
+      Point_2 mid = m_traits.construct_middle_point(cv);
+      return m_traits.compare_z_at_xy_3_object()(mid, s1, s2);
     }
 
   protected:
@@ -710,12 +752,12 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
                                   const Xy_monotone_surface_3& s1,
                                   const Xy_monotone_surface_3& s2) const {
       // find the z coordinates of surface 1 over p
-      Algebraic z1 = parent.compute_envelope_z_in_point(p, s1);
+      Algebraic z1 = m_traits.compute_envelope_z_in_point(p, s1);
       // find the z coordinates of surface 2 over p
-      Algebraic z2 = parent.compute_envelope_z_in_point(p, s2);
+      Algebraic z2 = m_traits.compute_envelope_z_in_point(p, s2);
 
       Sign res = CGAL_NTS sign(z1 - z2);
-      if (parent.m_is_lower) return res;
+      if (m_traits.m_is_lower) return res;
       else return -res;
     }
 
@@ -735,19 +777,19 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     Comparison_result
     compare_in_point_second_method(const Point_2& p,
                                    const Xy_monotone_surface_3& s1,
-                                   const Xy_monotone_surface_3& s2) const
-    {
-      Rat_point_3 p1 = s1.center();
-      Rat_point_3 p2 = s2.center();
-      const Rational a1 = p1.x();
-      const Rational b1 = p1.y();
-      const Rational c1 = p1.z();
-      const Rational a2 = p2.x();
-      const Rational b2 = p2.y();
-      const Rational c2 = p2.z();
-      const Rational sqr_r1 = s1.squared_radius();
-      const Rational sqr_r2 = s2.squared_radius();
-      const Algebraic x1 = p.x(), y1 = p.y();
+                                   const Xy_monotone_surface_3& s2) const {
+      const Rat_point_3& p1 = s1.center();
+      const Rat_point_3& p2 = s2.center();
+      const Rational& a1 = p1.x();
+      const Rational& b1 = p1.y();
+      const Rational& c1 = p1.z();
+      const Rational& a2 = p2.x();
+      const Rational& b2 = p2.y();
+      const Rational& c2 = p2.z();
+      const Rational& sqr_r1 = s1.squared_radius();
+      const Rational& sqr_r2 = s2.squared_radius();
+      const Algebraic& x1 = p.x();
+      const Algebraic& y1 = p.y();
 
       Rational c_diff = c1 - c2;
       Algebraic x_diff1 = x1 - a1, y_diff1 = y1 - b1;
@@ -773,17 +815,32 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     }
   };
 
-  /*! Get a Compare_z_at_xy_3 functor object. */
+  /*! Obtain a Compare_z_at_xy_3 functor object. */
   Compare_z_at_xy_3
-  compare_z_at_xy_3_object() const { return Compare_z_at_xy_3(this); }
-
+  compare_z_at_xy_3_object() const { return Compare_z_at_xy_3(*this); }
+
+  /*! Determine the relative \f$z\f$-order of the two given \f$xy\f$-monotone
+   * surfaces immediately above their projected intersection curve (a planar
+   * point \f$p\f$ is above an \f$x\f$-monotone curve \f$c\f$ if it is in the
+   * \f$x\f$-range of \f$c\f$, and lies to its left when the curve is traversed
+   * from its \f$xy\f$-lexicographically smaller endpoint to its larger
+   * endpoint).
+   */
   class Compare_z_at_xy_above_3 {
   protected:
-    const Self& parent;
+    using Traits_3 = Env_sphere_traits_3<Traits_2>;
 
-  public:
-    Compare_z_at_xy_above_3(const Self* p) : parent(*p) {}
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Compare_z_at_xy_above_3(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_sphere_traits_3<Traits_2>;
 
+  public:
     // check which of the surfaces is closer to the envelope on the points above
     // the curve cv (i.e. lower if computing the lower envelope, or upper if
     // computing the upper envelope)
@@ -795,35 +852,46 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     operator()(const X_monotone_curve_2& cv,
                const Xy_monotone_surface_3& s1,
                const Xy_monotone_surface_3& s2) const
-    { return parent.compare_on_side(cv, s1, s2, false); }
+    { return m_traits.compare_on_side(cv, s1, s2, false); }
   };
 
-  /*! Get a Compare_z_at_xy_above_3 functor object. */
+  /*! Obtain a Compare_z_at_xy_above_3 functor object. */
   Compare_z_at_xy_above_3
   compare_z_at_xy_above_3_object() const
-  { return Compare_z_at_xy_above_3(this); }
-
+  { return Compare_z_at_xy_above_3(*this); }
+
+  /*! Determine the relative \f$z\f$-order of the two given \f$xy\f$-monotone
+   * surfaces immediately below their projected intersection curve (a planar
+   * point \f$p\f$ is below an \f$x\f$-monotone curve \f$c\f$ if it is in the
+   * \f$x\f$-range of \f$c\f$, and lies to its left when the curve is traversed
+   * from its \f$xy\f$-lexicographically smaller endpoint to its larger
+   * endpoint).
+   */
   class Compare_z_at_xy_below_3 {
   protected:
-    const Self& parent;
+    using Traits_3 = Env_sphere_traits_3<Traits_2>;
 
-  public:
-    Compare_z_at_xy_below_3(const Self* p) : parent(*p) {}
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
 
-    Comparison_result
-    operator()(const X_monotone_curve_2& cv,
-               const Xy_monotone_surface_3& s1,
-               const Xy_monotone_surface_3& s2) const
-    {
-      Comparison_result res = parent.compare_on_side(cv, s1, s2, true);
-      return res;
-    }
+    /*! Constructor
+     * \param traits the traits
+     */
+    Compare_z_at_xy_below_3(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_sphere_traits_3<Traits_2>;
+
+  public:
+    Comparison_result operator()(const X_monotone_curve_2& cv,
+                                 const Xy_monotone_surface_3& s1,
+                                 const Xy_monotone_surface_3& s2) const
+    { return m_traits.compare_on_side(cv, s1, s2, true); }
   };
 
-  /*! Get a Compare_z_at_xy_below_3 functor object. */
+  /*! Obtain a Compare_z_at_xy_below_3 functor object. */
   Compare_z_at_xy_below_3
   compare_z_at_xy_below_3_object() const
-  { return Compare_z_at_xy_below_3(this); }
+  { return Compare_z_at_xy_below_3(*this); }
 
   /***************************************************************************/
 
@@ -832,31 +900,39 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
   // checks if point is in the xy-range of surf
   class Is_defined_over {
   protected:
-    const Self& parent;
+    using Traits_3 = Env_sphere_traits_3<Traits_2>;
 
-  public:
-    Is_defined_over(const Self* p) : parent(*p) {}
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Is_defined_over(const Traits_3& traits) : m_traits(traits) {}
 
+    friend class Env_sphere_traits_3<Traits_2>;
+
+  public:
     // checks if point is in the xy-range of surf
     bool operator()(const Point_2& p, const Xy_monotone_surface_3& s) const {
       // project the surface on the plane
-      Rat_point_2 proj_center = parent.project(s.center());
+      Rat_point_2 proj_center = m_traits.project(s.center());
       Rat_circle_2 boundary(proj_center, s.squared_radius());
 
-      const auto gt_2 = parent.geometry_traits_2();
-      auto nt_traits = gt_2->nt_traits();
+      const Traits_2& gt2 = m_traits;
+      auto nt_traits = gt2.nt_traits();
       Alg_point_2 aproj_center(proj_center.x(), proj_center.y());
       Alg_circle_2 aboundary(aproj_center, nt_traits->convert(s.squared_radius()));
 
       // check if the projected point is inside the projected boundary
-      auto alg_kernel = gt_2->alg_kernel();
+      auto alg_kernel = gt2.alg_kernel();
       return (! alg_kernel->has_on_unbounded_side_2_object()(aboundary, p));
     }
   };
 
-  /*! Get a Is_defined_over functor object. */
+  /*! Obtain a Is_defined_over functor object. */
   Is_defined_over is_defined_over_object() const
-  { return Is_defined_over(this); }
+  { return Is_defined_over(*this); }
 
   /***************************************************************************/
 
@@ -867,8 +943,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
   Comparison_result compare_on_side(const X_monotone_curve_2& cv,
                                     const Xy_monotone_surface_3& s1,
                                     const Xy_monotone_surface_3& s2,
-                                    bool compare_on_right) const
-  {
+                                    bool compare_on_right) const {
     // cv(x,y) : r*x^2 + s*y^2 + t*xy + u*x + v*y + w = 0
     // let p be the leftmost endpoint of cv, p=(x0, y0)
     // the tangence of cv at p is a line. on the infinitesimal region
@@ -881,7 +956,8 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     // since we assume that such point represents better what is going
     // on all internal curve points
     Point_2 cv_point = construct_middle_point(cv);
-    Algebraic x0 = cv_point.x(), y0 = cv_point.y();
+    const Algebraic& x0 = cv_point.x();
+    const Algebraic& y0 = cv_point.y();
 
     // d(cv)/dx : 2r*x + 2s*y*dy/dx + t*y + t*x*dy/dx +u + v*dy/dx = 0
     // in point p=(x0,y0) we get
@@ -895,8 +971,12 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     //    n != 0:    y - y0 = y'(x-x0) ==> -y'x + y + (y'x0 - y0) = 0
     // and in general we have:
     //    -m*x + n*y + (m*x0 -n*y0) = 0 (with integer coordinates)
-    const Rational r = cv.r(), s = cv.s(), t = cv.t(),
-               u = cv.u(), v = cv.v(), w = cv.w();
+    const Rational& r = cv.r();
+    const Rational& s = cv.s();
+    const Rational& t = cv.t();
+    const Rational& u = cv.u();
+    const Rational& v = cv.v();
+    const Rational& w = cv.w();
     Algebraic m = -1 * (2*r*x0 + t*y0 + u);
     Algebraic n = 2*s*y0 + t*x0 + v;
     // line coefficients: A3, B3, C3
@@ -931,14 +1011,14 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     //        Di = -(x0-ai)x0 - (y0-bi)y0 - (z0-ci)z0
     //
     // and we solve the problem as for triangles
-    Rat_point_3 p1 = s1.center();
-    Rat_point_3 p2 = s2.center();
-    const Rational a1 = p1.x();
-    const Rational b1 = p1.y();
-    const Rational c1 = p1.z();
-    const Rational a2 = p2.x();
-    const Rational b2 = p2.y();
-    const Rational c2 = p2.z();
+    const Rat_point_3& p1 = s1.center();
+    const Rat_point_3& p2 = s2.center();
+    const Rational& a1 = p1.x();
+    const Rational& b1 = p1.y();
+    const Rational& c1 = p1.z();
+    const Rational& a2 = p2.x();
+    const Rational& b2 = p2.y();
+    const Rational& c2 = p2.z();
     Algebraic A1 = x0 - a1, B1 = y0 - b1, C1 = z0 - c1;
     Algebraic A2 = x0 - a2, B2 = y0 - b2, C2 = z0 - c2;
     if (C1 != 0 && C2 != 0) {
@@ -971,6 +1051,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     return EQUAL;
   }
 
+  //
   Rat_point_2 project(const Rat_point_3& p) const
   { return Rat_point_2(p.x(), p.y()); }
 
@@ -979,15 +1060,15 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
   // precondition: s is defined at p
   Algebraic compute_envelope_z_in_point(const Point_2& p,
                                         const Xy_monotone_surface_3& s) const {
-    Algebraic res;
-
     // the point coordinates
     const Algebraic x1 = p.x(), y1 = p.y();
 
     // the surface equations
-    Rat_point_3 center = s.center();
-    const Rational a = center.x(), b = center.y(), c = center.z();
-    const Rational sqr_r = s.squared_radius();
+    const Rat_point_3& center = s.center();
+    const Rational& a = center.x();
+    const Rational& b = center.y();
+    const Rational& c = center.z();
+    const Rational& sqr_r = s.squared_radius();
 
     // we substitute x1 and y1 in the equation of s
     // (x-a)^2 + (y-b)^2 + (z-c)^2 = r^2
@@ -999,11 +1080,12 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     Algebraic B = -2*c;
     Algebraic C = x_diff*x_diff + y_diff*y_diff + c*c - sqr_r;
 
-    Algebraic  zs[2];
+    Algebraic zs[2];
     Algebraic* zs_end;
     std::ptrdiff_t n_zs;
 
-    auto nt_traits = m_geometry_traits_2->nt_traits();
+    const Traits_2& gt2 = *this;
+    auto nt_traits = gt2.nt_traits();
     zs_end = nt_traits->solve_quadratic_equation(A, B, C, zs);
     n_zs = zs_end - zs;
 
@@ -1013,6 +1095,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     if (n_zs == 1) return zs[0];
     CGAL_assertion(n_zs == 2);
 
+    Algebraic res;
     Comparison_result comp = CGAL_NTS compare(zs[0], zs[1]);
     if (m_is_lower) res = ((comp == SMALLER) ? zs[0] : zs[1]);
     else res = ((comp == LARGER) ? zs[0] : zs[1]);
@@ -1021,8 +1104,10 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
 
   // construct the point in the middle of cv
   Point_2 construct_middle_point(const X_monotone_curve_2& cv) const {
+    const Traits_2& gt2 = *this;
+
     // get the x-value of the middle point
-    auto alg_kernel = m_geometry_traits_2->alg_kernel();
+    auto alg_kernel = gt2.alg_kernel();
     Alg_point_2 mid_x =
       alg_kernel->construct_midpoint_2_object()(cv.source(), cv.target());
 
@@ -1030,13 +1115,14 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     // maybe we want it there?
     // if (cv.is_segment()) return mid_x;
     if (cv.is_vertical()) return Point_2(mid_x);
-    return Point_2(m_geometry_traits_2->point_at_x(cv, mid_x));
+    return Point_2(gt2.point_at_x(cv, mid_x));
   }
 
 
   // for the test
   Point_2 construct_middle_point(const Point_2& p1, const Point_2& p2) const {
-    auto alg_kernel = m_geometry_traits_2->alg_kernel();
+    const Traits_2& gt2 = *this;
+    auto alg_kernel = gt2.alg_kernel();
     return Point_2(alg_kernel->construct_midpoint_2_object()(p1, p2));
   }
 
@@ -1044,7 +1130,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
   // r*x^2 + s*y^2 + t*xy + u*x + v*y + w = 0
   // has real solutions
   // is_point is set to true if the equation represents just one point
-  template <class NT>
+  template <typename NT>
   bool is_valid_conic_equation(const NT& r, const NT& s, const NT& t,
                                const NT& u, const NT& v, const NT& w,
                                bool& is_point) const {
@@ -1103,30 +1189,31 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
 
   // for the test:
   Point_2 vertical_ray_shoot_2(const Point_2& pt, const X_monotone_curve_2& cv)
-    const
-  {
+    const {
+    const Traits_2& gt2 = *this;
     if (cv.is_vertical()) {
-      auto alg_kernel = m_geometry_traits_2->alg_kernel();
-      if (! alg_kernel->less_y_2_object()(cv.left(), pt))
-        return cv.left();
-      else {
-        CGAL_assertion(alg_kernel->less_y_2_object()(cv.right(), pt));
-        return cv.right();
-      }
+      auto alg_kernel = gt2.alg_kernel();
+      if (! alg_kernel->less_y_2_object()(cv.left(), pt)) return cv.left();
+
+      CGAL_assertion(alg_kernel->less_y_2_object()(cv.right(), pt));
+      return cv.right();
     }
-    else return m_geometry_traits_2->point_at_x(cv, pt);
+
+    return gt2.point_at_x(cv, pt);
   }
 
+  //
   template <typename OutputIterator>
   OutputIterator add_curve_to_output(const Curve_2& c, OutputIterator oi) const {
     std::variant<X_monotone_curve_2, Point_2> objs[2];
 
-    std::variant<X_monotone_curve_2, Point_2>* p_obj = this->make_x_monotone_2_object()(c, objs);
-    for(std::variant<X_monotone_curve_2, Point_2>* o = objs; o != p_obj; ++o) {
-      if(const X_monotone_curve_2* cv = std::get_if<X_monotone_curve_2>(o))
+    std::variant<X_monotone_curve_2, Point_2>* p_obj =
+      this->make_x_monotone_2_object()(c, objs);
+    for (std::variant<X_monotone_curve_2, Point_2>* o = objs; o != p_obj; ++o) {
+      if (const auto* cv = std::get_if<X_monotone_curve_2>(o))
         *oi++ = Intersection_curve(*cv, 1);
       else {
-        const Point_2* pt = std::get_if<Point_2>(o);
+        const auto* pt = std::get_if<Point_2>(o);
         CGAL_assertion(pt!=nullptr);
         *oi++ = *pt;
       }
@@ -1134,55 +1221,39 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     return oi;
   }
 
-  typedef std::shared_ptr<Traits_2>             Shared_geometry_traits_2;
-
   /*! Default constructor. */
-  Env_sphere_traits_3() :
-    m_is_lower(true),
-    m_geometry_traits_2(new Traits_2)
-  {}
-
-  /*! Constructor from a conic 2D geometry traits. */
-  Env_sphere_traits_3(Shared_geometry_traits_2 geometry_traits_2) :
-    m_is_lower(true),
-    m_geometry_traits_2(geometry_traits_2)
-  {}
-
-  /*! Obtain the undelying conic 2D geometry traits.
-   */
-  const Shared_geometry_traits_2 geometry_traits_2() const
-  { return m_geometry_traits_2; }
+  Env_sphere_traits_3() : m_is_lower(true) {}
 
 protected:
   mutable bool m_is_lower;
-
-private:
-  //! The conic geometry-traits.
-  const Shared_geometry_traits_2 m_geometry_traits_2;
 };
 
-/*!
- * Compare two spheres: first compare their center points in an
- * xyz-lexicographic order, then by their radii.
+/*! Compare two spheres: first compare their center points in an
+ * xyz-lexicographic order, then by their squared radii.
+ *
+ * \todo This should be deprecated and instead the traits should provide this
+ * functionality.
  */
 template <typename Kernel>
 bool operator<(const CGAL::Sphere_3<Kernel>& a, const CGAL::Sphere_3<Kernel>& b)
 {
   Kernel k;
   Comparison_result res = k.compare_xyz_3_object()(a.center(), b.center());
-  if (res == EQUAL) res = CGAL::compare (a.squared_radius(), b.squared_radius());
+  if (res == EQUAL) res = CGAL::compare(a.squared_radius(), b.squared_radius());
   return (res == SMALLER);
 }
 
-/*!
- * Compare two spheres for equality.
+/*! Compare two spheres for equality.
+ *
+ * \todo This should be deprecated and instead the traits should provide this
+ * functionality.
  */
 template <typename Kernel>
-bool operator== (const typename Kernel::Sphere_3& a,
-                 const typename Kernel::Sphere_3& b) {
+bool operator==(const typename Kernel::Sphere_3& a,
+                const typename Kernel::Sphere_3& b) {
   Kernel k;
-  if (! k.equal_3_object() (a.center(), b.center())) return (false);
-  return (CGAL::compare (a.squared_radius(), b.squared_radius()) == EQUAL);
+  if (! k.equal_3_object()(a.center(), b.center())) return (false);
+  return (CGAL::compare(a.squared_radius(), b.squared_radius()) == EQUAL);
 }
 
 } //namespace CGAL
diff --git a/Envelope_3/include/CGAL/Env_surface_data_traits_3.h b/Envelope_3/include/CGAL/Env_surface_data_traits_3.h
index 9624b70a79d5..835ec7b35e2c 100644
--- a/Envelope_3/include/CGAL/Env_surface_data_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_surface_data_traits_3.h
@@ -8,7 +8,9 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Ron Wein          <wein@post.tau.ac.il>
+// Author(s) : Ron Wein          <wein@post.tau.ac.il>
+//             Efi Fogel         <efifogel@gmail.com>
+
 #ifndef CGAL_ENV_SURFACE_DATA_TRAITS_3_H
 #define CGAL_ENV_SURFACE_DATA_TRAITS_3_H
 
@@ -19,9 +21,10 @@
  * Definition of the env_surface_data_traits_3<> class template.
  */
 
-#include <CGAL/Arr_geometry_traits/Curve_data_aux.h>
 #include <list>
 
+#include <CGAL/Arr_geometry_traits/Curve_data_aux.h>
+
 namespace CGAL {
 
 /*! \class
@@ -31,95 +34,80 @@ namespace CGAL {
  * It can attach data objects to Surface_3 and to Xy_monotone_surface_3 objects
  * (possibly of two different types).
  */
-template <class Traits_, class XyMonotoneSurfaceData_,
-          class SurfaceData_ = XyMonotoneSurfaceData_,
-          class Convert_ = _Default_convert_func<SurfaceData_,
-                                                 XyMonotoneSurfaceData_> >
-class Env_surface_data_traits_3 : public Traits_
-{
+template <typename Traits_, typename XyMonotoneSurfaceData,
+          typename SurfaceData = XyMonotoneSurfaceData,
+          typename Convert_ = _Default_convert_func<SurfaceData,
+                                                    XyMonotoneSurfaceData>>
+class Env_surface_data_traits_3 : public Traits_ {
 public:
+  using Base_traits_3 = Traits_;
+  using Xy_monotone_surface_data = XyMonotoneSurfaceData;
+  using Surface_data = SurfaceData;
+  using Convert = Convert_;
 
-  typedef Traits_                                  Base_traits_3;
-  typedef XyMonotoneSurfaceData_                   Xy_monotone_surface_data;
-  typedef SurfaceData_                             Surface_data;
-  typedef Convert_                                 Convert;
-
-  typedef typename Base_traits_3::Surface_3        Base_surface_3;
-  typedef typename Base_traits_3::Xy_monotone_surface_3
-                                                   Base_xy_monotone_surface_3;
+  using Base_surface_3 = typename Base_traits_3::Surface_3;
+  using Base_xy_monotone_surface_3 =
+    typename Base_traits_3::Xy_monotone_surface_3;
 
   // Representation of a surface with an additional data field:
-  typedef _Curve_data_ex<Base_surface_3, Surface_data>  Surface_3;
+  using Surface_3 = _Curve_data_ex<Base_surface_3, Surface_data>;
 
   // Representation of an xy-monotone surface with an additional data field:
-  typedef _Curve_data_ex<Base_xy_monotone_surface_3,
-                         Xy_monotone_surface_data>      Xy_monotone_surface_3;
+  using Xy_monotone_surface_3 =
+    _Curve_data_ex<Base_xy_monotone_surface_3, Xy_monotone_surface_data>;
 
 public:
-
   /// \name Construction.
   //@{
 
   /*! Default constructor. */
-  Env_surface_data_traits_3 ()
-  {}
+  Env_surface_data_traits_3() {}
 
   /*! Constructor from a base-traits class. */
-  Env_surface_data_traits_3 (const Base_traits_3 & traits) :
-    Base_traits_3 (traits)
+  Env_surface_data_traits_3(const Base_traits_3& traits) :
+    Base_traits_3(traits)
   {}
   //@}
 
   /// \name Overridden functors.
   //@{
 
-  class Make_xy_monotone_3
-  {
+  class Make_xy_monotone_3 {
   private:
-    const Base_traits_3 * base;
+    const Base_traits_3* base;
 
   public:
-
     /*! Constructor. */
-    Make_xy_monotone_3 (const Base_traits_3 * _base) : base (_base)
-    {}
+    Make_xy_monotone_3(const Base_traits_3* _base) : base (_base) {}
 
-    /*!
-     * Subdivide the given surface into xy-monotone surfaces and insert them
+    /*! Subdivide the given surface into xy-monotone surfaces and insert them
      * to the given output iterator.
      * \param S The surface.
      * \param oi The output iterator,
      *           whose value-type is Xy_monotone_surface_2.
      * \return The past-the-end iterator.
      */
-    template<class OutputIterator>
-    OutputIterator operator() (const Surface_3& S, bool is_lower,
-                               OutputIterator oi) const
-    {
+    template <typename OutputIterator>
+    OutputIterator operator()(const Surface_3& S, bool is_lower,
+                              OutputIterator oi) const {
       // Make the original surface xy-monotone.
-      std::list<Base_xy_monotone_surface_3>                     xy_surfaces;
-      typename std::list<Base_xy_monotone_surface_3>::iterator  xys_it;
+      std::list<Base_xy_monotone_surface_3> xy_surfaces;
+      typename std::list<Base_xy_monotone_surface_3>::iterator xys_it;
 
-      base->make_xy_monotone_3_object()
-        (S, is_lower, std::back_inserter (xy_surfaces));
+      base->make_xy_monotone_3_object()(S, is_lower,
+                                        std::back_inserter(xy_surfaces));
 
       // Attach the data to each of the resulting xy-monotone surfaces.
       for (xys_it = xy_surfaces.begin(); xys_it != xy_surfaces.end(); ++xys_it)
-      {
-        *oi = Xy_monotone_surface_3 (*xys_it,
-                                     Convert() (S.data()));
-        ++oi;
-      }
+        *oi++ = Xy_monotone_surface_3(*xys_it, Convert() (S.data()));
 
-      return (oi);
+      return oi;
     }
   };
 
   /*! Get a Make_xy_monotone_3 functor object. */
   Make_xy_monotone_3 make_xy_monotone_3_object() const
-  {
-    return Make_xy_monotone_3 (this);
-  }
+  { return Make_xy_monotone_3(this); }
 
   //@}
 
diff --git a/Envelope_3/include/CGAL/Env_triangle_traits_3.h b/Envelope_3/include/CGAL/Env_triangle_traits_3.h
index 00ccc69e8faf..10218a7ceb11 100644
--- a/Envelope_3/include/CGAL/Env_triangle_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_triangle_traits_3.h
@@ -7,8 +7,9 @@
 // $Id$
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
-//                 Baruch Zukerman        <baruchzu@post.tau.ac.il>
+// Author(s) : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+//             Baruch Zukerman        <baruchzu@post.tau.ac.il>
+//             Efi Fogel              <efifogel@gmail.com>
 
 /*! \file CGAL/Envelope_triangles_traits_3.h
  * \brief Model for CGAL's EnvelopeTraits_3 concept.
@@ -20,72 +21,61 @@
 
 #include <CGAL/license/Envelope_3.h>
 
+
+#include <vector>
+
 #include <CGAL/enum.h>
 #include <CGAL/Bbox_3.h>
 #include <CGAL/Arr_segment_traits_2.h>
 #include <CGAL/Envelope_3/Envelope_base.h>
 
-#include <vector>
-
 namespace CGAL {
 
-template <class Kernel_> class Env_triangle_3;
+template <typename Kernel_> class Env_triangle_3;
 
 // this traits class supports both triagles and segments in 3d
-template <class Kernel_>
-class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
-{
+template <typename Kernel_>
+class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_> {
 public:
-  typedef Arr_segment_traits_2<Kernel_>             Traits_2;
-  typedef typename Traits_2::Point_2                Point_2;
-  typedef typename Traits_2::X_monotone_curve_2     X_monotone_curve_2;
-  typedef typename Traits_2::Multiplicity           Multiplicity;
+  using Traits_2 = Arr_segment_traits_2<Kernel_>;
+  using Point_2 = typename Traits_2::Point_2;
+  using X_monotone_curve_2 = typename Traits_2::X_monotone_curve_2;
+  using Multiplicity = typename Traits_2::Multiplicity;
 
-  typedef Kernel_                                   Kernel;
-  typedef Env_triangle_traits_3<Kernel>             Self;
+  using Kernel = Kernel_;
+  using Self = Env_triangle_traits_3<Kernel>;
 
-  typedef typename Kernel::Point_3                  Point_3;
+  using Point_3 = typename Kernel::Point_3;
 
-  /*!
-   * \class Representation of a 3d triangle with cached data.
+  /*! \class Representation of a 3d triangle with cached data.
    */
-  class _Triangle_cached_3
-  {
+  class _Triangle_cached_3 {
   public:
-
-    typedef typename Kernel::Plane_3               Plane_3;
-    typedef typename Kernel::Triangle_3            Triangle_3;
-    typedef typename Kernel::Point_3               Point_3;
-    typedef typename Kernel::Segment_3             Segment_3;
+    using Plane_3 = typename Kernel::Plane_3;
+    using Triangle_3 = typename Kernel::Triangle_3;
+    using Point_3 = typename Kernel::Point_3;
+    using Segment_3 = typename Kernel::Segment_3;
 
   protected:
-
     Plane_3 pl;          // The plane that supports the triangle.
     Point_3 vertices[3]; // The vertices of the triangle.
-    bool    is_vert;     // Is this a vertical triangle (or a segment).
-    bool    is_seg;  // Is this a segment.
-  public:
+    bool is_vert;     // Is this a vertical triangle (or a segment).
+    bool is_seg;  // Is this a segment.
 
-    /*!
-     * Default constructor.
+  public:
+    /*! Default constructor.
      */
-    _Triangle_cached_3() :
-      is_vert(false),
-      is_seg(false)
-    {}
+    _Triangle_cached_3() : is_vert(false), is_seg(false) {}
 
-    /*!
-     * Constructor from a non-degenerate triangle.
+    /*! Constructor from a non-degenerate triangle.
      * \param tri The triangle.
      * \pre The triangle is not degenerate.
      */
-    _Triangle_cached_3(const Triangle_3 & tri)
-    {
-      Kernel   kernel;
-      CGAL_assertion(!kernel.is_degenerate_3_object()(tri));
+    _Triangle_cached_3(const Triangle_3& tri) {
+      Kernel kernel;
+      CGAL_assertion(! kernel.is_degenerate_3_object()(tri));
 
-      typename Kernel::Construct_vertex_3
-        construct_vertex = kernel.construct_vertex_3_object();
+      auto construct_vertex = kernel.construct_vertex_3_object();
 
       vertices[0] = construct_vertex(tri, 0);
       vertices[1] = construct_vertex(tri, 1);
@@ -100,25 +90,22 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       is_seg = false;
     }
 
-    /*!
-     * Construct a triangle from three non-collinear end-points.
+    /*! Construct a triangle from three non-collinear end-points.
      * \param p1 The first point.
      * \param p2 The second point.
      * \param p3 The third point.
      * \pre The 3 endpoints are not the collinear.
      */
-    _Triangle_cached_3(const Point_3 &p1, const Point_3 &p2,
-                       const Point_3 &p3)
-    {
-      Kernel   kernel;
-      CGAL_assertion(!kernel.collinear_3_object()(p1, p2, p3));
+    _Triangle_cached_3(const Point_3& p1, const Point_3& p2,
+                       const Point_3& p3) {
+      Kernel kernel;
+      CGAL_assertion(! kernel.collinear_3_object()(p1, p2, p3));
 
       vertices[0] = p1;
       vertices[1] = p2;
       vertices[2] = p3;
 
-      pl = kernel.construct_plane_3_object()(vertices[0],
-                                             vertices[1],
+      pl = kernel.construct_plane_3_object()(vertices[0], vertices[1],
                                              vertices[2]);
       Self self;
       is_vert = kernel.collinear_2_object()(self.project(vertices[0]),
@@ -127,8 +114,7 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       is_seg = false;
     }
 
-    /*!
-     * Construct a triangle from 3 end-points on a supporting plane.
+    /*! Construct a triangle from 3 end-points on a supporting plane.
      * \param supp_plane The supporting plane.
      * \param p1 The first point.
      * \param p2 The second point.
@@ -136,13 +122,10 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
      * \pre The 3 endpoints are not the collinear and all lie on the given
      *      plane.
      */
-    _Triangle_cached_3(const Plane_3& supp_plane,
-                       const Point_3 &p1,
-                       const Point_3 &p2,
-                       const Point_3 &p3) :
-      pl(supp_plane)
-    {
-      Kernel   kernel;
+    _Triangle_cached_3(const Plane_3& supp_plane, const Point_3& p1,
+                       const Point_3& p2, const Point_3& p3) :
+      pl(supp_plane) {
+      Kernel kernel;
 
       CGAL_precondition(kernel.has_on_3_object() (pl, p1) &&
                         kernel.has_on_3_object() (pl, p2) &&
@@ -160,15 +143,13 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       is_seg = false;
     }
 
-    /*!
-     * Constructor from a segment.
+    /*! Constructor from a segment.
      * \param seg The segment.
      * \pre The segment is not degenerate.
      */
-    _Triangle_cached_3(const Segment_3 & seg)
-    {
-      Kernel   kernel;
-      CGAL_assertion(!kernel.is_degenerate_3_object()(seg));
+    _Triangle_cached_3(const Segment_3& seg) {
+      Kernel kernel;
+      CGAL_assertion(! kernel.is_degenerate_3_object()(seg));
 
       typename Kernel::Construct_vertex_3
         construct_vertex = kernel.construct_vertex_3_object();
@@ -182,22 +163,18 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
 
       // construct a vertical plane through the segment
       Point_3 tmp(vertices[0].x(), vertices[0].y(), vertices[0].z()-1);
-      pl = kernel.construct_plane_3_object()(vertices[0],
-                                             vertices[1], tmp);
-
+      pl = kernel.construct_plane_3_object()(vertices[0], vertices[1], tmp);
     }
 
-    /*!
-     * Constructor from two points.
+    /*! Constructor from two points.
      * \param p1 The first point.
      * \param p2 The second point.
      * \param seg The segment.
      * \pre The segment between the points is not degenerate.
      */
-    _Triangle_cached_3(const Point_3 &p1, const Point_3 &p2)
-    {
-      Kernel   kernel;
-      CGAL_assertion(!kernel.equal_3_object()(p1, p2));
+    _Triangle_cached_3(const Point_3& p1, const Point_3& p2) {
+      Kernel kernel;
+      CGAL_assertion(! kernel.equal_3_object()(p1, p2));
 
       vertices[0] = p1;
       vertices[1] = p2;
@@ -208,22 +185,17 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
 
       // construct a vertical plane through the segment
       Point_3 tmp(vertices[0].x(), vertices[0].y(), vertices[0].z()-1);
-      pl = kernel.construct_plane_3_object()(vertices[0],
-                                             vertices[1], tmp);
-
+      pl = kernel.construct_plane_3_object()(vertices[0], vertices[1], tmp);
     }
 
-    /*!
-     * Assignment operator.
+    /*! Assignment operator.
      * \param tri the source triangle to copy from
      */
-    const _Triangle_cached_3& operator=(const Triangle_3 &tri)
-    {
-      Kernel   kernel;
-      CGAL_assertion(!kernel.is_degenerate_3_object()(tri));
+    const _Triangle_cached_3& operator=(const Triangle_3& tri) {
+      Kernel kernel;
+      CGAL_assertion(! kernel.is_degenerate_3_object()(tri));
 
-      typename Kernel_::Construct_vertex_3
-        construct_vertex = kernel.construct_vertex_3_object();
+      auto construct_vertex = kernel.construct_vertex_3_object();
 
       vertices[0] = construct_vertex(tri, 0);
       vertices[1] = construct_vertex(tri, 1);
@@ -240,129 +212,105 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       return (*this);
     }
 
-    /*!
-     * Get the ith endpoint.
+    /*! Get the ith endpoint.
      */
-    const Point_3& vertex(unsigned int i) const
-    {
-      return vertices[i%3];
-    }
+    const Point_3& vertex(unsigned int i) const { return vertices[i%3]; }
 
-    /*!
-     * Get the supporting plane.
+    /*! Get the supporting plane.
      */
-    const Plane_3& plane() const
-    {
-      return (pl);
-    }
+    const Plane_3& plane() const { return (pl); }
 
-    /*!
-     * Check if the triangle is vertical.
+    /*! Check whether the triangle is vertical.
      */
-    bool is_vertical() const
-    {
-      return (is_vert);
-    }
+    bool is_vertical() const { return (is_vert); }
 
-    /*!
-     * Check if the surface is a segment.
+    /*! Check whether the surface is a segment.
      */
-    bool is_segment() const
-    {
-      return (is_seg);
-    }
+    bool is_segment() const { return (is_seg); }
 
-    /*!
-     * Check if the surface is xy-monotone (false, if it is a vertical
+    /*! Check whether the surface is xy-monotone (false, if it is a vertical
      * triangle)
      */
-    bool is_xy_monotone() const
-    {
-      return (!is_vertical() || is_segment());
-    }
+    bool is_xy_monotone() const { return (!is_vertical() || is_segment()); }
   };
 
 public:
-
   // types for EnvelopeTraits_3 concept
   //! type of xy-monotone surfaces
-  typedef Env_triangle_3<Kernel>                    Xy_monotone_surface_3;
+  using Xy_monotone_surface_3 = Env_triangle_3<Kernel>;
   //! type of surfaces
-  typedef Xy_monotone_surface_3                     Surface_3;
+  using Surface_3 = Xy_monotone_surface_3;
 
   // we have a collision between the Kernel's Intersect_2 and the one
   // from the segment traits
-  typedef typename Traits_2::Intersect_2            Intersect_2;
+  using Intersect_2 = typename Traits_2::Intersect_2;
 
 protected:
-  typedef typename Kernel::FT                       FT;
-  typedef typename Kernel::Triangle_2               Triangle_2;
-  typedef typename Kernel::Segment_2                Segment_2;
+  using FT = typename Kernel::FT;
+  using Triangle_2 = typename Kernel::Triangle_2;
+  using Segment_2 = typename Kernel::Segment_2;
 
-  typedef typename Kernel::Segment_3                Segment_3;
-  typedef typename Kernel::Triangle_3               Triangle_3;
-  typedef typename Kernel::Plane_3                  Plane_3;
+  using Segment_3 = typename Kernel::Segment_3;
+  using Triangle_3 = typename Kernel::Triangle_3;
+  using Plane_3 = typename Kernel::Plane_3;
 
-  typedef typename Kernel::Assign_2                 Assign_2;
-  typedef typename Kernel::Construct_vertex_2       Construct_vertex_2;
+  using Assign_2 = typename Kernel::Assign_2;
+  using Construct_vertex_2 = typename Kernel::Construct_vertex_2;
 
-  typedef typename Kernel::Assign_3                 Assign_3;
-  typedef typename Kernel::Intersect_3              Intersect_3;
-  typedef typename Kernel::Construct_vertex_3       Construct_vertex_3;
+  using Assign_3 = typename Kernel::Assign_3;
+  using Intersect_3 = typename Kernel::Intersect_3;
+  using Construct_vertex_3 = typename Kernel::Construct_vertex_3;
 
 
-  typedef typename Kernel::Line_2                   Line_2;
-  typedef typename Kernel::Direction_2              Direction_2;
+  using Line_2 = typename Kernel::Line_2;
+  using Direction_2 = typename Kernel::Direction_2;
 
-  typedef typename Kernel::Line_3                   Line_3;
-  typedef typename Kernel::Direction_3              Direction_3;
+  using Line_3 = typename Kernel::Line_3;
+  using Direction_3 = typename Kernel::Direction_3;
 
-  typedef std::pair<X_monotone_curve_2,
-                    Multiplicity>                   Intersection_curve;
-public:
+  using Intersection_curve = std::pair<X_monotone_curve_2, Multiplicity>;
 
+public:
   /***************************************************************************/
   // EnvelopeTraits_3 functors
   /***************************************************************************/
 
-  /*!\brief
-   * Subdivide the given surface into envelope relevant xy-monotone
-   * parts, and insert them into the output iterator.
-   *
-   * The iterator value-type is Xy_monotone_surface_3
+  /*! Subdivide a given surface into \f$xy\f$-monotone parts.
    */
-  class Make_xy_monotone_3
-  {
+  class Make_xy_monotone_3 {
   protected:
-    const Self * parent;
+    using Traits_3 = Env_triangle_traits_3<Kernel>;
+
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Make_xy_monotone_3(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_triangle_traits_3<Kernel>;
 
   public:
-    Make_xy_monotone_3(const Self * p) : parent(p)
-    {}
     // create xy-monotone surfaces from a general surface
     // return a past-the-end iterator
-    template <class OutputIterator>
-    OutputIterator operator()(const Surface_3& s,
-                              bool is_lower,
-                              OutputIterator o) const
-    {
+    template <typename OutputIterator>
+    OutputIterator operator()(const Surface_3& s, bool is_lower,
+                              OutputIterator o) const {
       m_is_lower = is_lower;
 
       // a non-vertical triangle is already xy-monotone
-      if (!s.is_vertical())
-        *o++ = s;
-      else
-      {
+      if (! s.is_vertical()) *o++ = s;
+      else {
         // split a vertical triangle into one or two segments
-        const Point_3 &a1 = s.vertex(0),
-                       a2 = s.vertex(1),
-                       a3 = s.vertex(2);
-        Point_2 b1 = parent->project(a1),
-                b2 = parent->project(a2),
-                b3 = parent->project(a3);
-        Kernel k;
-        if (k.collinear_are_ordered_along_line_2_object()(b1, b2, b3))
-        {
+        const Point_3& a1 = s.vertex(0);
+        const Point_3& a2 = s.vertex(1);
+        const Point_3& a3 = s.vertex(2);
+        Point_2 b1 = m_traits.project(a1);
+        Point_2 b2 = m_traits.project(a2);
+        Point_2 b3 = m_traits.project(a3);
+        const Kernel& k = m_traits;
+        if (k.collinear_are_ordered_along_line_2_object()(b1, b2, b3)) {
           if (k.equal_2_object()(b1, b2))
             // only one segment in the output - the vertical does not count
             *o++ = Xy_monotone_surface_3(find_envelope_point(a1, a2), a3);
@@ -372,8 +320,7 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
             // check whether two or one segments appear on the envelope
             return find_envelope_segments(a1, a2, a3, s.plane(), o);
         }
-        else if (k.collinear_are_ordered_along_line_2_object()(b1, b3, b2))
-        {
+        else if (k.collinear_are_ordered_along_line_2_object()(b1, b3, b2)) {
           if (k.equal_2_object()(b1, b3))
             // only one segment in the output
             *o++ = Xy_monotone_surface_3(find_envelope_point(a1, a3), a2);
@@ -381,42 +328,35 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
             // check whether two or one segments appear on the envelope
             return find_envelope_segments(a1, a3, a2, s.plane(), o);
         }
-        else
-        {
+        else {
           // check whether two or one segments appear on the envelope
           return find_envelope_segments(a2, a1, a3, s.plane(), o);
         }
-
       }
       return o;
     }
 
   protected:
     // find the envelope point among the two points with same xy coordinates
-    const Point_3& find_envelope_point (const Point_3& p1,
-                                        const Point_3& p2) const
-    {
+    const Point_3& find_envelope_point(const Point_3& p1, const Point_3& p2)
+      const {
       CGAL_precondition(p1.x() == p2.x() && p1.y() == p2.y());
-      Kernel k;
+      const Kernel& k = m_traits;
       Comparison_result cr = k.compare_z_3_object()(p1, p2);
       CGAL_assertion(cr != EQUAL);
-      if ((m_is_lower && cr == SMALLER) ||
-          (!m_is_lower && cr == LARGER))
+      if ((m_is_lower && cr == SMALLER) || (! m_is_lower && cr == LARGER))
         return p1;
-      else
-        return p2;
+      else return p2;
     }
 
     // get the three triangle coordinates (ordered along 2d-line) and find
     // which segment(s) is(are) the envelope of this triangle
     // "plane" is the vertical plane on which the triangle lies
-    template <class OutputIterator>
-    OutputIterator find_envelope_segments(const Point_3& p1,
-                                          const Point_3& p2,
+    template <typename OutputIterator>
+    OutputIterator find_envelope_segments(const Point_3& p1, const Point_3& p2,
                                           const Point_3& p3,
                                           const Plane_3& plane,
-                                          OutputIterator o) const
-    {
+                                          OutputIterator o) const {
       // our vertical plane is a*x + b*y + d = 0
       FT a = plane.a(), b = plane.b();
       CGAL_precondition(plane.c() == 0);
@@ -445,9 +385,9 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       //           (-b*x3 + a*y3 + b*x1 - a*y1)(z2 - z1) -
       //                                 (z3 - z1)(-b*x2 + a*y2 + b*x1 - a*y1)
       //
-      FT w1 = a*p1.y() - b*p1.x(),
-         w2 = a*p2.y() - b*p2.x(),
-         w3 = a*p3.y() - b*p3.x();
+      FT w1 = a*p1.y() - b*p1.x();
+      FT w2 = a*p2.y() - b*p2.x();
+      FT w3 = a*p3.y() - b*p3.x();
 
       Sign s1 = CGAL::sign((w3 - w1)*(p2.z() - p1.z()) -
                            (p3.z() - p1.z())*(w2 - w1));
@@ -461,16 +401,11 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       Sign s = CGAL_NTS sign(int(s1 * s2));
 
       bool use_one_segment = true;
-      if ((m_is_lower  && s == NEGATIVE) ||
-          (!m_is_lower && s == POSITIVE))
+      if ((m_is_lower && (s == NEGATIVE)) || (! m_is_lower && (s == POSITIVE)))
         use_one_segment = false;
 
-      if (use_one_segment)
-      {
-        *o++ = Xy_monotone_surface_3(p1, p3);
-      }
-      else
-      {
+      if (use_one_segment) *o++ = Xy_monotone_surface_3(p1, p3);
+      else {
         *o++ = Xy_monotone_surface_3(p1, p2);
         *o++ = Xy_monotone_surface_3(p2, p3);
       }
@@ -480,50 +415,49 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     mutable bool m_is_lower;
   };
 
-  /*! Get a Make_xy_monotone_3 functor object. */
+  /*! Obtain a Make_xy_monotone_3 functor object. */
   Make_xy_monotone_3
-  make_xy_monotone_3_object() const
-  {
-    return Make_xy_monotone_3(this);
-  }
+  make_xy_monotone_3_object() const { return Make_xy_monotone_3(*this); }
 
-  /*!\brief
-   * Insert all 2D curves, which form the boundary of the vertical
-   * projection of the surface onto the xy-plane, into the output iterator.
-   * The iterator value-type is X_monotone_curve_2.
+  /*! Compute all planar \f$x\f$-monotone curves and possibly isolated planar
+   * points that form the projection of the boundary of the given
+   * \f$xy\f$-monotone surface s onto the \f$xy\f$-plane.
    */
-  class Construct_projected_boundary_2
-  {
+  class Construct_projected_boundary_2 {
   protected:
-    const Self *parent;
-  public:
+    using Traits_3 = Env_triangle_traits_3<Kernel>;
 
-    Construct_projected_boundary_2(const Self* p)
-      : parent(p)
-    {}
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Construct_projected_boundary_2(const Traits_3& traits) : m_traits(traits) {}
 
+    friend class Env_triangle_traits_3<Kernel>;
+
+  public:
     // insert into the OutputIterator all the (2d) curves of the boundary of
     // the vertical projection of the surface on the xy-plane
     // the OutputIterator value type is X_monotone_curve_2
-    template <class OutputIterator>
+    template <typename OutputIterator>
     OutputIterator operator()(const Xy_monotone_surface_3& s,
-                              OutputIterator o) const
-    {
+                              OutputIterator o) const {
       // the input xy-monotone surface should be either non-vertical or
       // a segment
       CGAL_assertion(s.is_xy_monotone());
 
-      if (!s.is_vertical())
-      {
+      if (! s.is_vertical()) {
         // the projection is a triangle
-        const Point_3 &a1 = s.vertex(0),
-                       a2 = s.vertex(1),
-                       a3 = s.vertex(2);
-        Point_2 b1 = parent->project(a1),
-                b2 = parent->project(a2),
-                b3 = parent->project(a3);
+        const Point_3& a1 = s.vertex(0);
+        const Point_3& a2 = s.vertex(1);
+        const Point_3& a3 = s.vertex(2);
+        Point_2 b1 = m_traits.project(a1);
+        Point_2 b2 = m_traits.project(a2);
+        Point_2 b3 = m_traits.project(a3);
 
-        Kernel k;
+        const Kernel& k = m_traits;
 
         X_monotone_curve_2 A(b1, b2);
         X_monotone_curve_2 B(b2, b3);
@@ -540,128 +474,116 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
         Oriented_side s2 = k.oriented_side_2_object()(l2, b1);
         Oriented_side s3 = k.oriented_side_2_object()(l3, b2);
 
-        CGAL_assertion(s1 != ON_ORIENTED_BOUNDARY &&
-                       s2 != ON_ORIENTED_BOUNDARY &&
-                       s3 != ON_ORIENTED_BOUNDARY);
+        CGAL_assertion((s1 != ON_ORIENTED_BOUNDARY) &&
+                       (s2 != ON_ORIENTED_BOUNDARY) &&
+                       (s3 != ON_ORIENTED_BOUNDARY));
 
         *o++ = std::make_pair(A, s1);
         *o++ = std::make_pair(B, s2);
         *o++ = std::make_pair(C, s3);
+        return o;
       }
-      else
-      {
-        // s is a segment, and so is its projection
-        // s shouldn't be a z-vertical segment
-        const Point_3 &a1 = s.vertex(0),
-                       a2 = s.vertex(1);
-
-        Point_2 b1 = parent->project(a1),
-                b2 = parent->project(a2);
-        CGAL_assertion(b1 != b2);
-
-        *o++ = std::make_pair(X_monotone_curve_2(b1, b2),
-                              ON_ORIENTED_BOUNDARY);
-      }
+
+      // s is a segment, and so is its projection
+      // s shouldn't be a z-vertical segment
+      const Point_3& a1 = s.vertex(0);
+      const Point_3& a2 = s.vertex(1);
+
+      Point_2 b1 = m_traits.project(a1);
+      Point_2 b2 = m_traits.project(a2);
+      CGAL_assertion(b1 != b2);
+
+      *o++ = std::make_pair(X_monotone_curve_2(b1, b2), ON_ORIENTED_BOUNDARY);
       return o;
     }
   };
 
-  /*! Get a Construct_projected_boundary_curves_2 functor object. */
+  /*! Obtain a Construct_projected_boundary_curves_2 functor object. */
   Construct_projected_boundary_2
   construct_projected_boundary_2_object() const
-  {
-    return Construct_projected_boundary_2(this);
-  }
+  { return Construct_projected_boundary_2(*this); }
 
-  /*!\brief
-   * Insert all the 2D projections (onto the xy-plane) of the
-   * intersection objects between s1 and s2 into the output iterator.
-   *
-   * The iterator value-type is Object. An Object may be:
-   * 1. A pair<X_monotone_curve_2,Intersection_type>, where the intersection
-   * type is an enumeration that can take the values
-   * {Transversal, Tangency, Unknown}.
-   * 2. A Point_2 instance (in degenerate cases).
+  /*! compute the projection of the intersections of the \f$xy\f$-monotone
+   * surfaces onto the \f$xy\f$-plane,
    */
-  class Construct_projected_intersections_2
-  {
+  class Construct_projected_intersections_2 {
   protected:
-    const Self *parent;
-  public:
+    using Traits_3 = Env_triangle_traits_3<Kernel>;
 
-    Construct_projected_intersections_2(const Self* p)
-      : parent(p)
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Construct_projected_intersections_2(const Traits_3& traits) :
+      m_traits(traits)
     {}
 
+    friend class Env_triangle_traits_3<Kernel>;
+
+  public:
     // insert into OutputIterator all the (2d) projections on the xy plane of
     // the intersection objects between the 2 surfaces
     // the data type of OutputIterator is Object
-    template <class OutputIterator>
+    template <typename OutputIterator>
     OutputIterator operator()(const Xy_monotone_surface_3& s1,
                               const Xy_monotone_surface_3& s2,
-                              OutputIterator o) const
-    {
+                              OutputIterator o) const {
       CGAL_assertion(s1.is_xy_monotone() && s2.is_xy_monotone());
 
-      Kernel k;
-      if (!parent->do_intersect(s1, s2))
-      {
-        return o;
-      }
+      if (! m_traits.do_intersect(s1, s2)) return o;
 
-      std::optional<std::variant<Point_3, Segment_3>> inter_obj
-        = parent->intersection(s1,s2);
-      if (inter_obj == std::nullopt)
-      {
+      const Kernel& k = m_traits;
+      std::optional<std::variant<Point_3, Segment_3>> inter_obj =
+        m_traits.intersection(s1, s2);
+      if (inter_obj == std::nullopt) return o;
+
+      if (const auto* point = std::get_if<Point_3>(&(*inter_obj))) {
+        *o++ = m_traits.project(*point);
         return o;
       }
 
-      if (const Point_3* point = std::get_if<Point_3>(&(*inter_obj)))
-        *o++ = parent->project(*point);
-      else
-      {
-        const Segment_3* curve = std::get_if<Segment_3>(&(*inter_obj));
-        CGAL_assertion(curve != nullptr);
-
-        Segment_2  proj_seg = parent->project(*curve);
-        if (! k.is_degenerate_2_object() (proj_seg))
-        {
-          Intersection_curve inter_cv (proj_seg, 1);
-          *o++ = inter_cv;
-        }
-        else
-        {
-          const Point_2&  p = k.construct_point_on_2_object() (proj_seg, 0);
-          *o++ = p;
-        }
+      const auto* curve = std::get_if<Segment_3>(&(*inter_obj));
+      CGAL_assertion(curve != nullptr);
+
+      Segment_2 proj_seg = m_traits.project(*curve);
+      if (! k.is_degenerate_2_object() (proj_seg)) {
+        Intersection_curve inter_cv (proj_seg, 1);
+        *o++ = inter_cv;
+        return o;
       }
 
+      const Point_2& p = k.construct_point_on_2_object() (proj_seg, 0);
+      *o++ = p;
       return o;
     }
   };
 
-  /*! Get a Construct_projected_intersections_2 functor object. */
+  /*! Obtain a Construct_projected_intersections_2 functor object. */
   Construct_projected_intersections_2
   construct_projected_intersections_2_object() const
-  {
-    return Construct_projected_intersections_2(this);
-  }
+  { return Construct_projected_intersections_2(*this); }
 
-  /*!\brief
-   * Check if the surface s1 is closer/equally distanced/farther
-   * from the envelope with respect to s2 at the xy-coordinates of p/c.
+  /*! Determine the relative \f$z\f$-order of two given \f$xy\f$-monotone
+   * surfaces at the \f$xy\f$-coordinates of a given point or \f$x\f$-monotone
+   * curve.
    */
-  class Compare_z_at_xy_3
-  {
+  class Compare_z_at_xy_3 {
   protected:
-    const Self *parent;
+    using Traits_3 = Env_triangle_traits_3<Kernel>;
 
-  public:
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
 
-    Compare_z_at_xy_3(const Self* p)
-      : parent(p)
-    {}
+    /*! Constructor
+     * \param traits the traits
+     */
+    Compare_z_at_xy_3(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_triangle_traits_3<Kernel>;
 
+  public:
     // check which of the surfaces is closer to the envelope at the xy
     // coordinates of point
     // (i.e. lower if computing the lower envelope, or upper if computing
@@ -669,8 +591,7 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     // precondition: the surfaces are defined in point
     Comparison_result operator()(const Point_2& p,
                                  const Xy_monotone_surface_3& surf1,
-                                 const Xy_monotone_surface_3& surf2) const
-    {
+                                 const Xy_monotone_surface_3& surf2) const {
       // we compute the points on the planes, and then compare their z
       // coordinates
       const Plane_3& plane1 = surf1.plane();
@@ -679,18 +600,14 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       // if the 2 triangles have the same supporting plane, and they are not
       // vertical, then they have the same z coordinate over this point
       if ((plane1 == plane2 || plane1 == plane2.opposite()) &&
-          !surf1.is_vertical())
-      {
+          ! surf1.is_vertical())
         return EQUAL;
-      }
-
-      Kernel k;
 
       // Compute the intersetion between the vertical line and the given
       // surfaces
-      Point_3 ip1 = parent->envelope_point_of_surface(p, surf1);
-      Point_3 ip2 = parent->envelope_point_of_surface(p, surf2);
-
+      const Kernel& k = m_traits;
+      Point_3 ip1 = m_traits.envelope_point_of_surface(p, surf1);
+      Point_3 ip2 = m_traits.envelope_point_of_surface(p, surf2);
       return k.compare_z_3_object()(ip1, ip2);
     }
 
@@ -702,50 +619,49 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     //               and the answer is the same for each of these points
     Comparison_result operator()(const X_monotone_curve_2& cv,
                                  const Xy_monotone_surface_3& surf1,
-                                 const Xy_monotone_surface_3& surf2) const
-    {
+                                 const Xy_monotone_surface_3& surf2) const {
       // first try the endpoints, if cannot be sure, use the mid point
-      Comparison_result res;
-      res = parent->compare_z_at_xy_3_object()(cv.left(), surf1, surf2);
-
-      if (res == EQUAL)
-      {
-        res = parent->compare_z_at_xy_3_object()(cv.right(), surf1, surf2);
-        if (res == EQUAL)
-        {
-          Point_2 mid = parent->construct_middle_point(cv);
-          res = parent->compare_z_at_xy_3_object()(mid, surf1, surf2);
+      Comparison_result res =
+        m_traits.compare_z_at_xy_3_object()(cv.left(), surf1, surf2);
+
+      if (res == EQUAL) {
+        res = m_traits.compare_z_at_xy_3_object()(cv.right(), surf1, surf2);
+        if (res == EQUAL) {
+          Point_2 mid = m_traits.construct_middle_point(cv);
+          res = m_traits.compare_z_at_xy_3_object()(mid, surf1, surf2);
         }
       }
 
       return res;
     }
-
   };
 
-  /*! Get a Compare_z_at_xy_3 functor object. */
+  /*! Obtain a Compare_z_at_xy_3 functor object. */
   Compare_z_at_xy_3
-  compare_z_at_xy_3_object() const
-  {
-    return Compare_z_at_xy_3(this);
-  }
-
-  /*!\brief
-   * Check if the surface s1 is closer/equally distanced/farther
-   * from the envelope with
-   * respect to s2 immediately above the curve c.
+  compare_z_at_xy_3_object() const { return Compare_z_at_xy_3(*this); }
+
+  /*! Determine the relative \f$z\f$-order of the two given \f$xy\f$-monotone
+   * surfaces immediately above their projected intersection curve (a planar
+   * point \f$p\f$ is above an \f$x\f$-monotone curve \f$c\f$ if it is in the
+   * \f$x\f$-range of \f$c\f$, and lies to its left when the curve is traversed
+   * from its \f$xy\f$-lexicographically smaller endpoint to its larger
+   * endpoint).
    */
-  class Compare_z_at_xy_above_3
-  {
+  class Compare_z_at_xy_above_3 {
   protected:
-    const Self *parent;
+    using Traits_3 = Env_triangle_traits_3<Kernel>;
 
-  public:
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
 
-    Compare_z_at_xy_above_3(const Self* p)
-      : parent(p)
-    {}
+    /*! Constructor
+     * \param traits the traits
+     */
+    Compare_z_at_xy_above_3(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_triangle_traits_3<Kernel>;
 
+  public:
     // check which of the surfaces is closer to the envelope on the points
     // above the curve cv
     // (i.e. lower if computing the lower envelope, or upper if computing the
@@ -759,29 +675,24 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     Comparison_result
     operator()(const X_monotone_curve_2& cv,
                const Xy_monotone_surface_3& surf1,
-               const Xy_monotone_surface_3& surf2) const
-    {
+               const Xy_monotone_surface_3& surf2) const {
       // a vertical surface cannot be defined in the infinitesimal region above
       // a curve
-      CGAL_precondition(!surf1.is_vertical());
-      CGAL_precondition(!surf2.is_vertical());
+      CGAL_precondition(! surf1.is_vertical());
+      CGAL_precondition(! surf2.is_vertical());
 
-      CGAL_precondition(parent->compare_z_at_xy_3_object()
-                              (cv, surf1, surf2) == EQUAL);
-      CGAL_precondition(parent->compare_z_at_xy_3_object()
-                              (cv.source(), surf1, surf2) == EQUAL);
-      CGAL_precondition(parent->compare_z_at_xy_3_object()
-                              (cv.target(), surf1, surf2) == EQUAL);
+      CGAL_precondition(m_traits.compare_z_at_xy_3_object()
+                        (cv, surf1, surf2) == EQUAL);
+      CGAL_precondition(m_traits.compare_z_at_xy_3_object()
+                        (cv.source(), surf1, surf2) == EQUAL);
+      CGAL_precondition(m_traits.compare_z_at_xy_3_object()
+                        (cv.target(), surf1, surf2) == EQUAL);
 
-
-      if (parent->do_overlap(surf1, surf2))
-      {
-        return EQUAL;
-      }
+      if (m_traits.do_overlap(surf1, surf2)) return EQUAL;
 
       // now we must have 2 different non-vertical planes:
-             // plane1: a1*x + b1*y + c1*z + d1 = 0  , c1 != 0
-             // plane2: a2*x + b2*y + c2*z + d2 = 0  , c2 != 0
+      // plane1: a1*x + b1*y + c1*z + d1 = 0  , c1 != 0
+      // plane2: a2*x + b2*y + c2*z + d2 = 0  , c2 != 0
 
       const Plane_3& plane1 = surf1.plane();
       const Plane_3& plane2 = surf2.plane();
@@ -789,8 +700,8 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       FT a1 = plane1.a(), b1 = plane1.b(), c1 = plane1.c();
       FT a2 = plane2.a(), b2 = plane2.b(), c2 = plane2.c();
 
-             // our line is a3*x + b3*y + c3 = 0
-             // it is assumed that the planes intersect over this line
+      // our line is a3*x + b3*y + c3 = 0
+      // it is assumed that the planes intersect over this line
       const Line_2& line = cv.line();
       FT a3 = line.a(), b3 = line.b(), c3 = line.c();
 
@@ -838,37 +749,40 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     }
   };
 
-
-  /*! Get a Compare_z_at_xy_above_3 functor object. */
+  /*! Obtain a Compare_z_at_xy_above_3 functor object. */
   Compare_z_at_xy_above_3
   compare_z_at_xy_above_3_object() const
-  {
-    return Compare_z_at_xy_above_3(this);
-  }
-
-  /*!\brief
-   * Check if the surface s1 is closer/equally distanced/farther
-   * from the envelope with
-   * respect to s2 immediately below the curve c.
+  { return Compare_z_at_xy_above_3(*this); }
+
+  /*! Determine the relative \f$z\f$-order of the two given \f$xy\f$-monotone
+   * surfaces immediately below their projected intersection curve (a planar
+   * point \f$p\f$ is below an \f$x\f$-monotone curve \f$c\f$ if it is in the
+   * \f$x\f$-range of \f$c\f$, and lies to its left when the curve is traversed
+   * from its \f$xy\f$-lexicographically smaller endpoint to its larger
+   * endpoint).
    */
-  class Compare_z_at_xy_below_3
-  {
+  class Compare_z_at_xy_below_3 {
   protected:
-    const Self *parent;
+    using Traits_3 = Env_triangle_traits_3<Kernel>;
 
-  public:
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
 
-    Compare_z_at_xy_below_3(const Self* p)
-      : parent(p)
-    {}
+    /*! Constructor
+     * \param traits the traits
+     */
+    Compare_z_at_xy_below_3(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_triangle_traits_3<Kernel>;
 
+  public:
+    //
     Comparison_result
     operator()(const X_monotone_curve_2& cv,
                const Xy_monotone_surface_3& surf1,
-               const Xy_monotone_surface_3& surf2) const
-    {
+               const Xy_monotone_surface_3& surf2) const {
       Comparison_result left_res =
-        parent->compare_z_at_xy_above_3_object()(cv, surf1, surf2);
+        m_traits.compare_z_at_xy_above_3_object()(cv, surf1, surf2);
       return CGAL::opposite(left_res);
 
       /*if (left_res == LARGER)
@@ -880,12 +794,10 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     }
   };
 
-  /*! Get a Compare_z_at_xy_below_3 functor object. */
+  /*! Obtain a Compare_z_at_xy_below_3 functor object. */
   Compare_z_at_xy_below_3
   compare_z_at_xy_below_3_object() const
-  {
-    return Compare_z_at_xy_below_3(this);
-  }
+  { return Compare_z_at_xy_below_3(*this); }
 
   /***************************************************************************/
 
@@ -911,24 +823,33 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
   // public method needed for testing
 
   // checks if point is in the xy-range of surf
-  class Is_defined_over
-  {
+  class Is_defined_over {
+  protected:
+    using Traits_3 = Env_triangle_traits_3<Kernel>;
+
+    //! The traits (in case it has state).
+    const Traits_3& m_traits;
+
+    /*! Constructor
+     * \param traits the traits
+     */
+    Is_defined_over(const Traits_3& traits) : m_traits(traits) {}
+
+    friend class Env_triangle_traits_3<Kernel>;
+
   public:
     // checks if point is in the xy-range of surf
-    bool operator()(const Point_2& point,
-                    const Xy_monotone_surface_3& surf) const
-
-    {
-      Kernel k;
-      Self parent;
+    bool operator()(const Point_2& point, const Xy_monotone_surface_3& surf)
+      const {
+      const Kernel& k = m_traits;
 
       // project the surface on the plane
-      Triangle_2 boundary = parent.project(surf);
+      Triangle_2 boundary = m_traits.project(surf);
 
       // if surface is not vertical (i.e. boundary is not degenerate)
       // check if the projected point is inside the projected boundary
-      if (!k.is_degenerate_2_object()(boundary))
-        return (!k.has_on_unbounded_side_2_object()(boundary, point));
+      if (! k.is_degenerate_2_object()(boundary))
+        return (! k.has_on_unbounded_side_2_object()(boundary, point));
 
       // if surface is vertical, we check if the point is collinear
       // with the projected vertices, and on one of the projected segments
@@ -937,7 +858,7 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       Point_2 v2 = k.construct_vertex_2_object()(boundary, 1);
       Point_2 v3 = k.construct_vertex_2_object()(boundary, 2);
 
-      if (!k.collinear_2_object()(v1, v2, point))
+      if (! k.collinear_2_object()(v1, v2, point))
         return false;
 
       // enough to check 2 edges, because the 3rd is part of their union
@@ -949,67 +870,60 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
 
   /*! Get a Is_defined_over functor object. */
   Is_defined_over is_defined_over_object() const
-  {
-    return Is_defined_over();
-  }
-
-  Segment_2 project (const Segment_3& seg) const
-  {
-    typedef typename Kernel::Construct_vertex_3 Construct_vertex_3;
-
-    Kernel              k;
-    Construct_vertex_3  vertex_on = k.construct_vertex_3_object();
-
-    const Point_3      q0 = (vertex_on (seg, 0));
-    const Point_3      q1 = (vertex_on (seg, 1));
-    const Point_2      p0 (q0.x(), q0.y());
-    const Point_2      p1 (q1.x(), q1.y());
-
+  { return Is_defined_over(*this); }
+
+  //
+  Segment_2 project (const Segment_3& seg) const {
+    using Construct_vertex_3 = typename Kernel::Construct_vertex_3;
+
+    const Kernel& k = *this;
+    Construct_vertex_3 vertex_on = k.construct_vertex_3_object();
+    const Point_3 q0 = vertex_on(seg, 0);
+    const Point_3 q1 = vertex_on(seg, 1);
+    const Point_2 p0(q0.x(), q0.y());
+    const Point_2 p1(q1.x(), q1.y());
     return (k.construct_segment_2_object() (p0, p1));
   }
 
+  //
   Point_2 project(const Point_3& obj) const
-  {
-    return Point_2(obj.x(), obj.y());
-  }
-
-  Triangle_2 project(const Xy_monotone_surface_3& triangle_3) const
-  {
-    const Point_3&  end1 = triangle_3.vertex(0),
-                    end2 = triangle_3.vertex(1),
-                    end3 = triangle_3.vertex(2);
-    Point_2 projected_end1(end1.x(), end1.y()),
-            projected_end2(end2.x(), end2.y()),
-
-            projected_end3(end3.x(), end3.y());
+  { return Point_2(obj.x(), obj.y()); }
+
+  //
+  Triangle_2 project(const Xy_monotone_surface_3& triangle_3) const {
+    const Point_3& end1 = triangle_3.vertex(0);
+    const Point_3& end2 = triangle_3.vertex(1);
+    const Point_3& end3 = triangle_3.vertex(2);
+    Point_2 projected_end1(end1.x(), end1.y());
+    Point_2 projected_end2(end2.x(), end2.y());
+    Point_2 projected_end3(end3.x(), end3.y());
     return Triangle_2(projected_end1, projected_end2, projected_end3);
   }
 
   // triangles overlap if they lie on the same plane and intersect on it.
   // this test is only needed for non-vertical triangles
   bool do_overlap(const Xy_monotone_surface_3& s1,
-                              const Xy_monotone_surface_3& s2) const
-  {
-    CGAL_precondition(s1.is_xy_monotone() && !s1.is_vertical());
-    CGAL_precondition(s2.is_xy_monotone() && !s2.is_vertical());
+                  const Xy_monotone_surface_3& s2) const {
+    CGAL_precondition(s1.is_xy_monotone() && ! s1.is_vertical());
+    CGAL_precondition(s2.is_xy_monotone() && ! s2.is_vertical());
 
-    Kernel k;
-    if (!k.do_intersect_3_object()(static_cast<Triangle_3>(s1),
-                                   static_cast<Triangle_3>(s2)))
+    const Kernel& k = *this;
+    auto do_x = k.do_intersect_3_object();
+    if (! do_x(static_cast<Triangle_3>(s1), static_cast<Triangle_3>(s2)))
       return false;
 
     // check if they are coplanar
-    Point_3 a1 = s1.vertex(0),
-            b1 = s1.vertex(1),
-            c1 = s1.vertex(2);
-    Point_3 a2 = s2.vertex(0),
-            b2 = s2.vertex(1),
-            c2 = s2.vertex(2);
+    Point_3 a1 = s1.vertex(0);
+    Point_3 b1 = s1.vertex(1);
+    Point_3 c1 = s1.vertex(2);
+    Point_3 a2 = s2.vertex(0);
+    Point_3 b2 = s2.vertex(1);
+    Point_3 c2 = s2.vertex(2);
     bool b = k.coplanar_3_object()(a1, b1, c1, a2);
-    if (!b) return false;
+    if (! b) return false;
 
     b = k.coplanar_3_object()(a1, b1, c1, b2);
-    if (!b) return false;
+    if (! b) return false;
 
     b = k.coplanar_3_object()(a1, b1, c1, c2);
     return b;
@@ -1018,75 +932,61 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
   // check whether two xy-monotone surfaces (3D-triangles or segments)
   // intersect
   bool do_intersect(const Xy_monotone_surface_3& s1,
-                    const Xy_monotone_surface_3& s2) const
-  {
+                    const Xy_monotone_surface_3& s2) const {
     CGAL_precondition(s1.is_xy_monotone());
     CGAL_precondition(s2.is_xy_monotone());
-    Kernel k;
-    if (!s1.is_segment() && !s2.is_segment())
-      return k.do_intersect_3_object()(static_cast<Triangle_3>(s1),
-                                       static_cast<Triangle_3>(s2));
-    else if (!s1.is_segment())
-      return k.do_intersect_3_object()(static_cast<Triangle_3>(s1),
-                                       static_cast<Segment_3>(s2));
-    else if (!s2.is_segment())
-      return k.do_intersect_3_object()(static_cast<Segment_3>(s1),
-                                       static_cast<Triangle_3>(s2));
-    else
-      // in case of two segments, we don't use easy do-intersect test
-      return true;
+
+    const Kernel& k = *this;
+    auto do_x = k.do_intersect_3_object();
+    if (! s1.is_segment() && ! s2.is_segment())
+      return do_x(static_cast<Triangle_3>(s1), static_cast<Triangle_3>(s2));
+    else if (! s1.is_segment())
+      return do_x(static_cast<Triangle_3>(s1), static_cast<Segment_3>(s2));
+    else if (! s2.is_segment())
+      return do_x(static_cast<Segment_3>(s1), static_cast<Triangle_3>(s2));
+    else return true; // if two segments, we don't use easy do-intersect test
   }
 
   // intersect two xy-monotone surfaces (3D-triangles or segments)
   // if the triangles overlap, the result is empty
   // the result can be a segment or a point
-  std::optional< std::variant<Point_3, Segment_3>>
-  intersection(const Xy_monotone_surface_3& s1,
-               const Xy_monotone_surface_3& s2) const
-  {
+  std::optional<std::variant<Point_3, Segment_3>>
+  intersection(const Xy_monotone_surface_3& s1, const Xy_monotone_surface_3& s2)
+    const {
     CGAL_precondition(s1.is_xy_monotone());
     CGAL_precondition(s2.is_xy_monotone());
     Kernel k;
 
     // first, try to intersect the bounding boxes of the triangles,
     // efficiently return empty object when the triangles are faraway
-    if (!CGAL::do_overlap(s1.bbox(), s2.bbox()))
-      return std::nullopt;
+    if (! CGAL::do_overlap(s1.bbox(), s2.bbox())) return std::nullopt;
 
     // if intersecting two segment - alculate the intersection
     // as in the case of dimension 2
     if (s1.is_segment() && s2.is_segment())
-    {
       return intersection_of_segments(s1, s2);
-    }
 
     // if both triangles lie on the same (non-vertical) plane, they overlap
     // we don't care about overlaps, because they are not passed to the
     // algorithm anyway, so we save the costly computation
     Plane_3 p1 = s1.plane();
     Plane_3 p2 = s2.plane();
-    if  (p1 == p2 || p1 == p2.opposite())
-        return std::nullopt;
+    if ((p1 == p2) || (p1 == p2.opposite())) return std::nullopt;
 
     // calculate intersection between a triangle and the other triangle's
     // supporting plane
     // if there is no intersection - then the triangles have no intersection
     // between them.
     auto inter_obj = intersection(p1, s2);
-
-    if (inter_obj == std::nullopt)
-      return std::nullopt;
+    if (inter_obj == std::nullopt) return std::nullopt;
 
     // otherwise, if the intersection in a point, we should check if it lies
     // inside the first triangle
-    if (const Point_3* inter_point = std::get_if<Point_3>(&(*inter_obj)))
-    {
+    if (const Point_3* inter_point = std::get_if<Point_3>(&(*inter_obj))) {
       std::optional<Point_3> res = intersection_on_plane_3(p1, s1, *inter_point);
-      if (res != std::nullopt)
-        return res.value();
+      if (res != std::nullopt) return res.value();
     }
-    else
-    {
+    else {
       // if the intersection is a segment, we check the intersection of the
       // other plane-triangle pair
       const Segment_3* inter_seg = std::get_if<Segment_3>(&(*inter_obj));
@@ -1096,51 +996,40 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
 
       // if there is no intersection - then the triangles have no intersection
       // between them.
-      if (inter_obj2 == std::nullopt)
-        return std::nullopt;
+      if (inter_obj2 == std::nullopt) return std::nullopt;
 
-      if (const Point_3* inter_point = std::get_if<Point_3>(&(*inter_obj2)))
-      {
+      if (const Point_3* inter_point = std::get_if<Point_3>(&(*inter_obj2))) {
         // if the intersection is a point, which lies on the segment,
         // than it is the result,
         // otherwise, empty result
-         if (k.has_on_3_object()(*inter_seg, *inter_point))
-           return *inter_point;
-         else
-           return std::nullopt;
+         if (k.has_on_3_object()(*inter_seg, *inter_point)) return *inter_point;
+         else return std::nullopt;
       }
-      else
-      {
+      else {
         // both plane-triangle intersections are segments, which are collinear,
         // and lie on the line which is the intersection of the two supporting
         // planes
         const Segment_3* inter_seg2 = std::get_if<Segment_3>(&(*inter_obj));
         CGAL_assertion(inter_seg2 != nullptr);
 
-        Point_3 min1 = k.construct_min_vertex_3_object()(*inter_seg),
-                max1 = k.construct_max_vertex_3_object()(*inter_seg);
-        Point_3 min2 = k.construct_min_vertex_3_object()(*inter_seg2),
-                max2 = k.construct_max_vertex_3_object()(*inter_seg2);
+        Point_3 min1 = k.construct_min_vertex_3_object()(*inter_seg);
+        Point_3 max1 = k.construct_max_vertex_3_object()(*inter_seg);
+        Point_3 min2 = k.construct_min_vertex_3_object()(*inter_seg2);
+        Point_3 max2 = k.construct_max_vertex_3_object()(*inter_seg2);
 
          CGAL_assertion((k.collinear_3_object()(min1, min2, max1) &&
                          k.collinear_3_object()(min1, max2, max1)));
 
          // we need to find the overlapping part, if exists
          Point_3 min, max;
-         if (k.less_xyz_3_object()(min1, min2))
-           min = min2;
-         else
-           min = min1;
-         if (k.less_xyz_3_object()(max1, max2))
-           max = max1;
-         else
-           max = max2;
+         if (k.less_xyz_3_object()(min1, min2)) min = min2;
+         else min = min1;
+         if (k.less_xyz_3_object()(max1, max2)) max = max1;
+         else max = max2;
 
          Comparison_result comp_res = k.compare_xyz_3_object()(min, max);
-         if (comp_res == EQUAL)
-           return min;
-         else if (comp_res == SMALLER)
-           return Segment_3(min, max);
+         if (comp_res == EQUAL) return min;
+         else if (comp_res == SMALLER) return Segment_3(min, max);
          // else - empty result
       }
     }
@@ -1151,14 +1040,13 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
   std::optional<Point_3>
   intersection_on_plane_3(const Plane_3& plane,
                           const Xy_monotone_surface_3& triangle,
-                          const Point_3& point) const
-  {
-    Kernel k;
-    CGAL_precondition( triangle.is_xy_monotone() );
-    CGAL_precondition( !k.is_degenerate_3_object()(plane) );
-    CGAL_precondition( triangle.plane() == plane ||
-                       triangle.plane() == plane.opposite());
-    CGAL_precondition( k.has_on_3_object()(plane, point) );
+                          const Point_3& point) const {
+    const Kernel& k = *this;
+    CGAL_precondition(triangle.is_xy_monotone() );
+    CGAL_precondition(! k.is_degenerate_3_object()(plane) );
+    CGAL_precondition((triangle.plane() == plane) ||
+                      (triangle.plane() == plane.opposite()));
+    CGAL_precondition(k.has_on_3_object()(plane, point) );
     CGAL_USE(plane);
 
     // if the point is inside the triangle, then the point is the intersection
@@ -1168,63 +1056,55 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
       has_on = k.has_on_3_object()(static_cast<Segment_3>(triangle), point);
     else
       has_on = k.has_on_3_object()(static_cast<Triangle_3>(triangle), point);
-    if (has_on)
-      return point;
-    else
-      return std::nullopt;
+    if (has_on) return point;
+    else return std::nullopt;
   }
 
   // calculate intersection between 2 segments on the same vertical plane plane
-  std::optional< std::variant<Point_3, Segment_3>>
+  std::optional<std::variant<Point_3, Segment_3>>
   intersection_of_segments(const Xy_monotone_surface_3& s1,
-                           const Xy_monotone_surface_3& s2) const
-  {
-    Kernel k;
-    CGAL_precondition( s1.is_xy_monotone() && s1.is_segment());
-    CGAL_precondition( s2.is_xy_monotone() && s2.is_segment());
+                           const Xy_monotone_surface_3& s2) const {
+    const Kernel& k = *this;
+    CGAL_precondition(s1.is_xy_monotone() && s1.is_segment());
+    CGAL_precondition(s2.is_xy_monotone() && s2.is_segment());
 
     // if the segments are not coplanar, they cannot intersect
-    if (!k.coplanar_3_object()(s1.vertex(0), s1.vertex(1),
-                               s2.vertex(0), s2.vertex(1)))
+    if (! k.coplanar_3_object()(s1.vertex(0), s1.vertex(1),
+                                s2.vertex(0), s2.vertex(1)))
       return std::nullopt;
 
     const Plane_3& plane = s1.plane();
-    if (s2.plane() != plane &&
-        s2.plane() != plane.opposite())
+    if (s2.plane() != plane && s2.plane() != plane.opposite())
       // todo: this case is not needed in the algorithm,
       // so we don't implement it
       return std::nullopt;
 
-    CGAL_precondition( !k.is_degenerate_3_object()(plane) );
-    CGAL_precondition( s2.plane() == plane ||
-                       s2.plane() == plane.opposite());
+    CGAL_precondition(! k.is_degenerate_3_object()(plane) );
+    CGAL_precondition((s2.plane() == plane) ||
+                      (s2.plane() == plane.opposite()));
 
     // for simplicity, we transform the segments to the xy-plane,
     // compute the intersection there, and transform it back to the 3d plane.
-    Point_2 v1 = plane.to_2d(s1.vertex(0)),
-            v2 = plane.to_2d(s1.vertex(1));
+    Point_2 v1 = plane.to_2d(s1.vertex(0));
+    Point_2 v2 = plane.to_2d(s1.vertex(1));
     Segment_2 seg1_t(v1, v2);
 
-    Point_2 u1 = plane.to_2d(s2.vertex(0)),
-            u2 = plane.to_2d(s2.vertex(1));
+    Point_2 u1 = plane.to_2d(s2.vertex(0));
+    Point_2 u2 = plane.to_2d(s2.vertex(1));
     Segment_2 seg2_t(u1, u2);
 
     auto inter_obj = k.intersect_2_object()(seg1_t, seg2_t);
-    if (inter_obj == std::nullopt)
-        return std::nullopt;
+    if (inter_obj == std::nullopt) return std::nullopt;
 
     if (const Point_2* inter_point = std::get_if<Point_2>(&(*inter_obj)))
       return plane.to_3d(*inter_point);
-    else
-    {
-      const Segment_2* inter_segment = std::get_if<Segment_2>(&(*inter_obj));
-      CGAL_assertion(inter_segment!=nullptr);
 
-      return Segment_3
-         (plane.to_3d(k.construct_vertex_2_object()(*inter_segment, 0)),
-          plane.to_3d(k.construct_vertex_2_object()(*inter_segment, 1)));
-    }
+    const Segment_2* inter_segment = std::get_if<Segment_2>(&(*inter_obj));
+    CGAL_assertion(inter_segment != nullptr);
 
+    auto ctr_vertex = k.construct_vertex_2_object();
+    return Segment_3(plane.to_3d(ctr_vertex(*inter_segment, 0)),
+                     plane.to_3d(ctr_vertex(*inter_segment, 1)));
   }
 
   // calculate the intersection between a triangle/segment
@@ -1232,12 +1112,10 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
   // the result object can be empty, a point, a segment or the original
   // triangle
   std::optional<std::variant<Point_3, Segment_3>>
-  intersection(const Plane_3& pl,
-               const Xy_monotone_surface_3& tri) const
-  {
-    Kernel k;
-    CGAL_precondition( tri.is_xy_monotone() );
-    CGAL_precondition( !k.is_degenerate_3_object()(pl) );
+  intersection(const Plane_3& pl, const Xy_monotone_surface_3& tri) const {
+    const Kernel& k = *this;
+    CGAL_precondition(tri.is_xy_monotone() );
+    CGAL_precondition(! k.is_degenerate_3_object()(pl) );
 
     if (tri.is_segment())
       return k.intersect_3_object()(pl, static_cast<Segment_3>(tri));
@@ -1255,8 +1133,7 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     int n_points_on_negative = 0;
 
     Oriented_side side;
-    for (int i=0; i<3; ++i)
-    {
+    for (int i = 0; i < 3; ++i) {
       side = pl.oriented_side(tri.vertex(i));
       if (side == ON_NEGATIVE_SIDE)
         points_on_negative[n_points_on_negative++] = i;
@@ -1266,28 +1143,25 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
         points_on_plane[n_points_on_plane++] = i;
     }
 
-    CGAL_assertion(n_points_on_plane + n_points_on_positive + n_points_on_negative == 3);
+    CGAL_assertion(n_points_on_plane + n_points_on_positive +
+                   n_points_on_negative == 3);
 
     // if all vertices of tri lie on the same size (positive/negative) of pl,
     // there is no intersection
-    if (n_points_on_positive == 3 || n_points_on_negative == 3)
+    if ((n_points_on_positive == 3) || (n_points_on_negative == 3))
       return std::nullopt;
 
     // if all vertices of tri lie on pl then we return tri
-    if (n_points_on_plane == 3)
-       return tri;
+    if (n_points_on_plane == 3) return tri;
 
     // if 2 vertices lie on pl, then return the segment between them
-    if (n_points_on_plane == 2)
-    {
+    if (n_points_on_plane == 2) {
       int point_idx1 = points_on_plane[0], point_idx2 = points_on_plane[1];
-      return Segment_3(tri.vertex(point_idx1),
-                       tri.vertex(point_idx2));
+      return Segment_3(tri.vertex(point_idx1), tri.vertex(point_idx2));
     }
 
     // if only 1 lie on pl, should check the segment opposite to it on tri
-    if (n_points_on_plane == 1)
-    {
+    if (n_points_on_plane == 1) {
       int point_on_plane_idx = points_on_plane[0];
 
       // if the other 2 vertices are on the same side of pl,
@@ -1308,23 +1182,20 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
 
       // create the resulting segment
       // (between tri[point_on_plane_idx] and inter_point)
-      return Segment_3(tri.vertex(point_on_plane_idx),
-                                   *inter_point);
-
+      return Segment_3(tri.vertex(point_on_plane_idx), *inter_point);
     }
 
-    CGAL_assertion( n_points_on_plane == 0 );
-    CGAL_assertion( n_points_on_positive + n_points_on_negative == 3 );
-    CGAL_assertion( n_points_on_positive != 0 );
-    CGAL_assertion( n_points_on_negative != 0 );
+    CGAL_assertion(n_points_on_plane == 0);
+    CGAL_assertion(n_points_on_positive + n_points_on_negative == 3);
+    CGAL_assertion(n_points_on_positive != 0);
+    CGAL_assertion(n_points_on_negative != 0);
 
     // now it known that there is an intersection between 2 segments of tri
     // and pl, it is also known which segments are those.
     Point_3 inter_points[2];
-    int pos_it, neg_it, n_inter_points = 0;
-    for(pos_it = 0; pos_it < n_points_on_positive; ++pos_it)
-      for(neg_it = 0; neg_it < n_points_on_negative; ++neg_it)
-      {
+    int n_inter_points = 0;
+    for (int pos_it = 0; pos_it < n_points_on_positive; ++pos_it)
+      for (int neg_it = 0; neg_it < n_points_on_negative; ++neg_it) {
         Segment_3 seg(tri.vertex(points_on_positive[pos_it]),
                       tri.vertex(points_on_negative[neg_it]));
         auto inter_result = k.intersect_3_object()(pl, seg);
@@ -1339,11 +1210,8 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
 
   // compare the value of s1 in p1 to the value of s2 in p2
   Comparison_result
-  compare_z(const Point_2& p1,
-            const Xy_monotone_surface_3& s1,
-            const Point_2& p2,
-            const Xy_monotone_surface_3& s2)
-  {
+  compare_z(const Point_2& p1, const Xy_monotone_surface_3& s1,
+            const Point_2& p2, const Xy_monotone_surface_3& s2) {
     CGAL_precondition(is_defined_over_object()(p1, s1));
     CGAL_precondition(is_defined_over_object()(p2, s2));
 
@@ -1356,21 +1224,18 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
   // find the envelope point of the surface over the given point
   // precondition: the surface is defined in point
   Point_3
-  envelope_point_of_surface(const Point_2& p,
-                            const Xy_monotone_surface_3& s) const
-  {
+  envelope_point_of_surface(const Point_2& p, const Xy_monotone_surface_3& s)
+    const {
     CGAL_precondition(s.is_xy_monotone());
     CGAL_precondition(is_defined_over_object()(p, s));
 
     Point_3 point(p.x(), p.y(), 0);
 
     // Compute the intersetion between the vertical line and the given surfaces
-    if (s.is_segment())
-      return envelope_point_of_segment(point, s);
-    else
-    {
+    if (s.is_segment()) return envelope_point_of_segment(point, s);
+    else {
       // s is a non-vertical triangle
-      CGAL_assertion(!s.is_vertical());
+      CGAL_assertion(! s.is_vertical());
 
       // Construct a vertical line passing through point
       Kernel k;
@@ -1390,8 +1255,7 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
   // find the envelope point of the surface over the given point
   // precondition: the surface is defined in point and is a segment
   Point_3 envelope_point_of_segment(const Point_3& point,
-                                    const Xy_monotone_surface_3& s) const
-  {
+                                    const Xy_monotone_surface_3& s) const {
     Kernel k;
     CGAL_precondition(s.is_segment());
     CGAL_precondition(is_defined_over_object()(project(point), s));
@@ -1401,11 +1265,11 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
 
     // Construct a vertical line passing through point
     Direction_3 dir (0, 0, 1);
-    Line_3      vl = k.construct_line_3_object() (point, dir);
+    Line_3 vl = k.construct_line_3_object() (point, dir);
     // we need 2 points on this line, to be transformed to 2d,
     // and preserve the direction of the envelope
-    Point_3 vl_point1 = k.construct_point_on_3_object()(vl, 0),
-            vl_point2 = k.construct_point_on_3_object()(vl, 1);
+    Point_3 vl_point1 = k.construct_point_on_3_object()(vl, 0);
+    Point_3 vl_point2 = k.construct_point_on_3_object()(vl, 1);
 
     // the surface and the line are on the same plane(plane),
     // so we transform them to the xy-plane, compute the intersecting point
@@ -1427,14 +1291,12 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
     return plane.to_3d(*inter_point);
   }
 
-  Point_2 construct_middle_point(const Point_2& p1, const Point_2& p2) const
-  {
+  Point_2 construct_middle_point(const Point_2& p1, const Point_2& p2) const {
     Kernel k;
     return k.construct_midpoint_2_object()(p1, p2);
   }
 
-  Point_2 construct_middle_point(const X_monotone_curve_2& cv) const
-  {
+  Point_2 construct_middle_point(const X_monotone_curve_2& cv) const {
     Kernel k;
     return k.construct_midpoint_2_object()(cv.source(), cv.target());
   }
@@ -1443,196 +1305,147 @@ class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_>
   // for vertical decomposition
   /***************************************************************************/
 
-  class Construct_vertical_2
-  {
+  class Construct_vertical_2 {
   public:
     X_monotone_curve_2 operator()(const Point_2& p1, const Point_2& p2) const
-    {
-      return X_monotone_curve_2(p1, p2);
-
-    }
+    { return X_monotone_curve_2(p1, p2); }
   };
 
   /*! Get a Construct_vertical_2 functor object. */
   Construct_vertical_2 construct_vertical_2_object() const
-  {
-    return Construct_vertical_2();
-  }
-
+  { return Construct_vertical_2(); }
 
-  Point_2 vertical_ray_shoot_2 (const Point_2& pt,
-                                const X_monotone_curve_2& cv) const
-  {
-    CGAL_precondition(!cv.is_vertical());
+  Point_2 vertical_ray_shoot_2(const Point_2& pt, const X_monotone_curve_2& cv)
+    const {
+    CGAL_precondition(! cv.is_vertical());
 
     typename Kernel::Segment_2 seg = cv;
-    Kernel k;
+    const Kernel& k = *this;
     // If the curve contains pt, return it.
-    if (k.has_on_2_object() (seg, pt))
-      return (pt);
+    if (k.has_on_2_object()(seg, pt)) return (pt);
 
     // Construct a vertical line passing through pt.
-    typename Kernel::Direction_2  dir (0, 1);
-    typename Kernel::Line_2        vl = k.construct_line_2_object() (pt, dir);
+    typename Kernel::Direction_2 dir(0, 1);
+    typename Kernel::Line_2 vl = k.construct_line_2_object()(pt, dir);
 
     // Compute the intersetion between the vertical line and the given curve.
     auto res = k.intersect_2_object()(seg, vl);
     const Point_2* ip = std::get_if<Point_2>(&(*res));
-    CGAL_assertion (ip != nullptr);
+    CGAL_assertion(ip != nullptr);
 
     return *ip;
   }
 };
 
-
-/*!
- * \class A representation of a triangle, as used by the
+/*! \class A representation of a triangle, as used by the
  * Env_triangle_traits_3 traits-class.
  */
-template <class Kernel_>
-class Env_triangle_3 :
-    public Env_triangle_traits_3<Kernel_>::_Triangle_cached_3
+template <typename Kernel_>
+class Env_triangle_3 : public Env_triangle_traits_3<Kernel_>::_Triangle_cached_3
 {
-  typedef Kernel_                                                  Kernel;
-  typedef typename Kernel::Triangle_3                              Triangle_3;
-  typedef typename Kernel::Point_3                                 Point_3;
-  typedef typename Kernel::Plane_3                                 Plane_3;
-  typedef typename Kernel::Segment_3                               Segment_3;
+  using Kernel = Kernel_;
+  using Triangle_3 = typename Kernel::Triangle_3;
+  using Point_3 = typename Kernel::Point_3;
+  using Plane_3 = typename Kernel::Plane_3;
+  using Segment_3 = typename Kernel::Segment_3;
 
-  typedef typename Env_triangle_traits_3<Kernel>::_Triangle_cached_3
-                                                                   Base;
+  using Base = typename Env_triangle_traits_3<Kernel>::_Triangle_cached_3;
 
 public:
-
-  /*!
-   * Default constructor.
+  /*! Default constructor.
    */
-  Env_triangle_3() :
-    Base()
-  {}
+  Env_triangle_3() : Base() {}
 
-  /*!
-   * Constructor from a "kernel" triangle.
+  /*! Constructor from a "kernel" triangle.
    * \param seg The segment.
    */
-  Env_triangle_3(const Triangle_3& tri) :
-    Base(tri)
-  {}
+  Env_triangle_3(const Triangle_3& tri) : Base(tri) {}
 
-  /*!
-   * Construct a triangle from 3 end-points.
+  /*! Construct a triangle from 3 end-points.
    * \param p1 The first point.
    * \param p2 The second point.
    * \param p3 The third point.
    */
-    Env_triangle_3(const Point_3 &p1, const Point_3 &p2, const Point_3 &p3) :
-      Base(p1, p2, p3)
+  Env_triangle_3(const Point_3& p1, const Point_3& p2, const Point_3& p3) :
+    Base(p1, p2, p3)
   {}
 
-  /*!
-   * Construct a triangle from a plane and 3 end-points.
+  /*! Construct a triangle from a plane and 3 end-points.
    * \param pl The supporting plane.
    * \param p1 The first point.
    * \param p2 The second point.
    * \param p3 The third point.
    * \pre All points must be on the supporting plane.
    */
-  Env_triangle_3(const Plane_3& pl,
-                 const Point_3 &p1,
-                 const Point_3 &p2,
-                 const Point_3 &p3) :
+  Env_triangle_3(const Plane_3& pl, const Point_3& p1,
+                 const Point_3& p2, const Point_3& p3) :
     Base(pl, p1, p2, p3)
-
   {}
 
-  /*!
-   * Construct a segment from 2 end-points.
+  /*! Construct a segment from 2 end-points.
    * \param p1 The first point.
    * \param p2 The second point.
    */
-  Env_triangle_3(const Point_3 &p1, const Point_3 &p2) :
-    Base(p1, p2)
-  {}
+  Env_triangle_3(const Point_3& p1, const Point_3& p2) : Base(p1, p2) {}
 
-  /*!
-   * Cast to a triangle.
+  /*! Cast to a triangle.
    */
   operator Triangle_3() const
-  {
-    return (Triangle_3(this->vertex(0), this->vertex(1), this->vertex(2)));
-  }
+  { return (Triangle_3(this->vertex(0), this->vertex(1), this->vertex(2))); }
 
-  /*!
-   * Cast to a segment (only when possible).
+  /*! Cast to a segment (only when possible).
    */
-  operator Segment_3() const
-  {
+  operator Segment_3() const {
     CGAL_precondition(this->is_segment());
     return (Segment_3(this->vertex(0), this->vertex(1)));
   }
 
-  /*!
-   * Create a bounding box for the triangle.
+  /*! Create a bounding box for the triangle.
    */
-  Bbox_3 bbox() const
-  {
+  Bbox_3 bbox() const {
     Triangle_3 tri(this->vertex(0), this->vertex(1), this->vertex(2));
     return (tri.bbox());
   }
 };
 
-template <class Kernel>
-bool
-operator<(const Env_triangle_3<Kernel> &a,
-          const Env_triangle_3<Kernel> &b)
-{
-  if (a.vertex(0) < b.vertex(0))
-    return true;
-  if (a.vertex(0) > b.vertex(0))
-    return false;
-  if (a.vertex(1) < b.vertex(1))
-    return true;
-  if (a.vertex(1) > b.vertex(1))
-    return false;
-  if (a.vertex(2) < b.vertex(2))
-    return true;
-  if (a.vertex(2) > b.vertex(2))
-    return false;
+template <typename Kernel_>
+bool operator<(const Env_triangle_3<Kernel_>& a,
+               const Env_triangle_3<Kernel_>& b) {
+  if (a.vertex(0) < b.vertex(0)) return true;
+  if (a.vertex(0) > b.vertex(0)) return false;
+  if (a.vertex(1) < b.vertex(1)) return true;
+  if (a.vertex(1) > b.vertex(1)) return false;
+  if (a.vertex(2) < b.vertex(2)) return true;
+  if (a.vertex(2) > b.vertex(2)) return false;
 
   return false;
 }
-template <class Kernel>
-bool
-operator==(const Env_triangle_3<Kernel> &a,
-           const Env_triangle_3<Kernel> &b)
-{
-  return (a.vertex(0) == b.vertex(0) &&
-          a.vertex(1) == b.vertex(1) &&
-          a.vertex(2) == b.vertex(2));
+
+template <typename Kernel_>
+bool operator==(const Env_triangle_3<Kernel_>& a,
+                const Env_triangle_3<Kernel_>& b) {
+  return ((a.vertex(0) == b.vertex(0)) &&
+          (a.vertex(1) == b.vertex(1)) &&
+          (a.vertex(2) == b.vertex(2)));
 }
 
-/*!
- * Exporter for the triangle class used by the traits-class.
+/*! Exporter for the triangle class used by the traits-class.
  */
-template <class Kernel, class OutputStream>
-OutputStream& operator<< (OutputStream& os, const Env_triangle_3<Kernel>& tri)
-{
-  os << static_cast<typename Kernel::Triangle_3>(tri);
-  if (tri.is_segment())
-    os << " (segment)";
-  return (os);
+template <typename Kernel_, typename OutputStream>
+OutputStream& operator<<(OutputStream& os, const Env_triangle_3<Kernel_>& tri) {
+  os << static_cast<typename Kernel_::Triangle_3>(tri);
+  if (tri.is_segment()) os << " (segment)";
+  return os;
 }
 
-/*!
- * Importer for the triangle class used by the traits-class.
+/*! Importer for the triangle class used by the traits-class.
  */
-template <class Kernel, class InputStream>
-InputStream& operator>> (InputStream& is, Env_triangle_3<Kernel>& tri)
-{
-  typename Kernel::Triangle_3   kernel_tri;
+template <typename Kernel_, typename InputStream>
+InputStream& operator>>(InputStream& is, Env_triangle_3<Kernel_>& tri) {
+  typename Kernel_::Triangle_3 kernel_tri;
   is >> kernel_tri;
   tri = kernel_tri;
-  return (is);
+  return is;
 }
 
 } //namespace CGAL

From 83d48e6bd3ffd3b628fc024f5218b065c38b93b8 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Mon, 29 Jan 2024 22:36:48 +0200
Subject: [PATCH 1315/1398] Cleaned up; replaced 'typedef' with 'using'

---
 Envelope_3/include/CGAL/envelope_3.h | 117 ++++++++++++---------------
 1 file changed, 52 insertions(+), 65 deletions(-)

diff --git a/Envelope_3/include/CGAL/envelope_3.h b/Envelope_3/include/CGAL/envelope_3.h
index 20cee65f0472..7f0bccc2bbcd 100644
--- a/Envelope_3/include/CGAL/envelope_3.h
+++ b/Envelope_3/include/CGAL/envelope_3.h
@@ -8,8 +8,9 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Ron Wein           <wein@post.tau.ac.il>
-//                 Baruch Zukerman    <baruchzu@post.tau.ac.il>
+// Author(s) : Ron Wein           <wein@post.tau.ac.il>
+//             Baruch Zukerman    <baruchzu@post.tau.ac.il>
+//             Efi Fogel          <efifogel@gmail.com>
 
 #ifndef CGAL_ENVELOPE_3_H
 #define CGAL_ENVELOPE_3_H
@@ -23,100 +24,86 @@
 
 namespace CGAL {
 
-/*!
- * Construct the lower envelope of a given set of surfaces.
+/*! Construct the lower envelope of a given set of surfaces.
  * \param begin An iterator for the first surface.
  * \param end A past-the-end iterator for the surfaces in the range.
  * \param min_diag Output: The minimization diagram.
  * \pre The value-type of InputIterator is Traits::Surface_3.
  */
-template <typename InputIterator, typename GeomTraits,
-          class TopTraits>
-void lower_envelope_3 (InputIterator begin, InputIterator end,
-                       Envelope_diagram_on_surface_2<GeomTraits, TopTraits>&
-                         min_diagram)
-{
-  typedef GeomTraits                                        Traits_3;
-  typedef typename Envelope_diagram_on_surface_2<Traits_3,
-    TopTraits>::Arrangement                                 Envelope_diagram_2;
-  typedef Envelope_divide_and_conquer_3<Traits_3, Envelope_diagram_2>
-                                                            Envelope_algorithm;
-  Envelope_algorithm   env_alg (min_diagram.geometry_traits(), ENVELOPE_LOWER);
-  env_alg.construct_lu_envelope (begin, end, min_diagram);
+template <typename InputIterator, typename GeomTraits, typename TopolTraits>
+void lower_envelope_3(InputIterator begin, InputIterator end,
+                      Envelope_diagram_on_surface_2<GeomTraits, TopolTraits>&
+                        min_diagram) {
+  using Gt = GeomTraits;
+  using Tt = TopolTraits;
+
+  using Edos_2 = Envelope_diagram_on_surface_2<Gt, Tt>;
+  using Ed = typename Edos_2::Arrangement;
+  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Ed>;
+  Envelope_algorithm env_alg(min_diagram.geometry_traits(), ENVELOPE_LOWER);
+  env_alg.construct_lu_envelope(begin, end, min_diagram);
 }
 
-/*!
- * Construct the upper envelope of a given set of surfaces.
+/*! Construct the upper envelope of a given set of surfaces.
  * \param begin An iterator for the first surface.
  * \param end A past-the-end iterator for the surfaces in the range.
  * \param max_diag Output: The maximization diagram.
  * \pre The value-type of InputIterator is Traits::Surface_3.
  */
-template <class InputIterator, class GeomTraits,
-          class TopTraits>
-void upper_envelope_3 (InputIterator begin, InputIterator end,
-                       Envelope_diagram_on_surface_2<GeomTraits, TopTraits>&
-                         max_diagram)
-{
-  typedef GeomTraits                                         Traits_3;
-  typedef typename Envelope_diagram_on_surface_2<
-  Traits_3, TopTraits>::Arrangement                          Envelope_diagram_2;
-  typedef Envelope_divide_and_conquer_3<Traits_3, Envelope_diagram_2>
-                                                            Envelope_algorithm;
-
-  Envelope_algorithm   env_alg (max_diagram.geometry_traits(), ENVELOPE_UPPER);
+template <typename InputIterator, typename GeomTraits, typename TopolTraits>
+void upper_envelope_3(InputIterator begin, InputIterator end,
+                      Envelope_diagram_on_surface_2<GeomTraits, TopolTraits>&
+                        max_diagram) {
+  using Gt = GeomTraits;
+  using Tt = TopolTraits;
+
+  using Edos = Envelope_diagram_on_surface_2<Gt, Tt>;
+  using Ed = typename Edos::Arrangement;
+  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Ed>;
+  Envelope_algorithm env_alg(max_diagram.geometry_traits(), ENVELOPE_UPPER);
   env_alg.construct_lu_envelope (begin, end, max_diagram);
 }
 
 
-/*!
- * Construct the lower envelope of a given set of xy_monotone surfaces.
+/*! Construct the lower envelope of a given set of xy_monotone surfaces.
  * \param begin An iterator for the first xy-monotone surface.
  * \param end A past-the-end iterator for the xy_monotone surfaces in the range.
  * \param min_diag Output: The minimization diagram.
  * \pre The value-type of InputIterator is GeomTraits::Surface_3.
  */
-template <class InputIterator, class GeomTraits,
-          class TopTraits>
-void
-lower_envelope_xy_monotone_3 (InputIterator begin, InputIterator end,
-                              Envelope_diagram_on_surface_2<GeomTraits,
-                              TopTraits>& min_diagram)
-{
-  typedef GeomTraits                                         Traits_3;
-  typedef typename Envelope_diagram_on_surface_2<
-  Traits_3, TopTraits>::Arrangement                          Envelope_diagram_2;
-  typedef Envelope_divide_and_conquer_3<Traits_3, Envelope_diagram_2>
-                                                            Envelope_algorithm;
-  Envelope_algorithm   env_alg (min_diagram.geometry_traits(), ENVELOPE_LOWER);
+template <typename InputIterator, typename GeomTraits, typename TopolTraits>
+void lower_envelope_xy_monotone_3(InputIterator begin, InputIterator end,
+                                  Envelope_diagram_on_surface_2
+                                    <GeomTraits, TopolTraits>& min_diagram) {
+  using Gt = GeomTraits;
+  using Tt = TopolTraits;
+
+  using Edos = Envelope_diagram_on_surface_2<Gt, Tt>;
+  using Ed = typename Edos::Arrangement;
+  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Ed>;
+  Envelope_algorithm env_alg(min_diagram.geometry_traits(), ENVELOPE_LOWER);
   env_alg.construct_envelope_xy_monotone (begin, end, min_diagram);
 }
 
 
-/*!
- * Construct the upper envelope of a given set of xy_monotone surfaces.
+/*! Construct the upper envelope of a given set of xy_monotone surfaces.
  * \param begin An iterator for the first xy_monotone surface.
  * \param end A past-the-end iterator for the xy_monotone surfaces in the range.
  * \param max_diag Output: The maximization diagram.
  * \pre The value-type of InputIterator is Traits::Surface_3.
  */
-template <class InputIterator, class GeomTraits,
-          class TopTraits>
-void
-upper_envelope_xy_monotone_3 (InputIterator begin, InputIterator end,
-                              Envelope_diagram_on_surface_2<GeomTraits,
-                              TopTraits>& max_diagram)
-{
-  typedef GeomTraits                                         Traits_3;
-  typedef typename Envelope_diagram_on_surface_2<
-  Traits_3, TopTraits>::Arrangement                          Envelope_diagram_2;
-  typedef Envelope_divide_and_conquer_3<Traits_3, Envelope_diagram_2>
-                                                            Envelope_algorithm;
-
-  Envelope_algorithm   env_alg (max_diagram.geometry_traits(), ENVELOPE_UPPER);
+template <typename InputIterator, typename GeomTraits, typename TopolTraits>
+void upper_envelope_xy_monotone_3(InputIterator begin, InputIterator end,
+                                  Envelope_diagram_on_surface_2
+                                    <GeomTraits, TopolTraits>& max_diagram) {
+  using Gt = GeomTraits;
+  using Tt = TopolTraits;
+
+  using Edos = Envelope_diagram_on_surface_2<Gt, Tt>;
+  using Ed = typename Edos::Arrangement;
+  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Ed>;
+  Envelope_algorithm env_alg(max_diagram.geometry_traits(), ENVELOPE_UPPER);
   env_alg.construct_envelope_xy_monotone (begin, end, max_diagram);
-
-  return;
 }
 
 

From 420432168808a03a16a82dca8da2bddff6b594bf Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 30 Jan 2024 00:38:08 +0200
Subject: [PATCH 1316/1398] Used Envelope_diagram_on_surface_2::Base_aos
 instead of Envelope_diagram_on_surface_2::Arrangement, which is now obsolete

---
 Envelope_3/include/CGAL/envelope_3.h | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/Envelope_3/include/CGAL/envelope_3.h b/Envelope_3/include/CGAL/envelope_3.h
index 7f0bccc2bbcd..c4487fb6c682 100644
--- a/Envelope_3/include/CGAL/envelope_3.h
+++ b/Envelope_3/include/CGAL/envelope_3.h
@@ -38,8 +38,8 @@ void lower_envelope_3(InputIterator begin, InputIterator end,
   using Tt = TopolTraits;
 
   using Edos_2 = Envelope_diagram_on_surface_2<Gt, Tt>;
-  using Ed = typename Edos_2::Arrangement;
-  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Ed>;
+  using Aos = typename Edos_2::Base_aos;
+  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Aos>;
   Envelope_algorithm env_alg(min_diagram.geometry_traits(), ENVELOPE_LOWER);
   env_alg.construct_lu_envelope(begin, end, min_diagram);
 }
@@ -58,8 +58,8 @@ void upper_envelope_3(InputIterator begin, InputIterator end,
   using Tt = TopolTraits;
 
   using Edos = Envelope_diagram_on_surface_2<Gt, Tt>;
-  using Ed = typename Edos::Arrangement;
-  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Ed>;
+  using Aos = typename Edos::Base_aos;
+  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Aos>;
   Envelope_algorithm env_alg(max_diagram.geometry_traits(), ENVELOPE_UPPER);
   env_alg.construct_lu_envelope (begin, end, max_diagram);
 }
@@ -79,8 +79,8 @@ void lower_envelope_xy_monotone_3(InputIterator begin, InputIterator end,
   using Tt = TopolTraits;
 
   using Edos = Envelope_diagram_on_surface_2<Gt, Tt>;
-  using Ed = typename Edos::Arrangement;
-  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Ed>;
+  using Aos = typename Edos::Base_aos;
+  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Aos>;
   Envelope_algorithm env_alg(min_diagram.geometry_traits(), ENVELOPE_LOWER);
   env_alg.construct_envelope_xy_monotone (begin, end, min_diagram);
 }
@@ -100,8 +100,8 @@ void upper_envelope_xy_monotone_3(InputIterator begin, InputIterator end,
   using Tt = TopolTraits;
 
   using Edos = Envelope_diagram_on_surface_2<Gt, Tt>;
-  using Ed = typename Edos::Arrangement;
-  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Ed>;
+  using Aos = typename Edos::Base_aos;
+  using Envelope_algorithm = Envelope_divide_and_conquer_3<Gt, Aos>;
   Envelope_algorithm env_alg(max_diagram.geometry_traits(), ENVELOPE_UPPER);
   env_alg.construct_envelope_xy_monotone (begin, end, max_diagram);
 }

From 963255fe1b852c16827d1b1949be3e71b80d8312 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 30 Jan 2024 00:38:51 +0200
Subject: [PATCH 1317/1398] Cleaned up; 'typedef => 'using'; added missing
 const; made nested Arrangement obsolete (instead use Base_aos).

---
 .../Envelope_diagram_on_surface_2.h           | 126 +++++++-----------
 1 file changed, 51 insertions(+), 75 deletions(-)

diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_diagram_on_surface_2.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_diagram_on_surface_2.h
index b9f922ef6995..b21fa6b9a6b5 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_diagram_on_surface_2.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_diagram_on_surface_2.h
@@ -7,10 +7,10 @@
 // $Id$
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
-//                 Baruch Zukerman        <baruchzu@post.tau.ac.il>
-//                 Ophir Setter           <ophirset@post.tau.ac.il>
-//                 Efi Fogel              <efif@post.tau.ac.il>
+// Author(s) : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+//             Baruch Zukerman        <baruchzu@post.tau.ac.il>
+//             Ophir Setter           <ophirset@post.tau.ac.il>
+//             Efi Fogel              <efif@post.tau.ac.il>
 
 #ifndef CGAL_ENVELOPE_DIAGRAM_ON_SURFACE_2_H
 #define CGAL_ENVELOPE_DIAGRAM_ON_SURFACE_2_H
@@ -21,9 +21,7 @@
 #include <CGAL/Arrangement_on_surface_2.h>
 #include <CGAL/Arr_spherical_topology_traits_2.h>
 #include <CGAL/Arrangement_2/Arr_default_planar_topology.h>
-
 #include <CGAL/Arrangement_2/arrangement_type_traits.h>
-
 #include <CGAL/Envelope_3/Envelope_pm_dcel.h>
 
 namespace CGAL {
@@ -32,114 +30,93 @@ namespace CGAL {
  * Representation of an envelope diagram (a minimization diagram or a
  * maximization diagram).
  */
-template <class GeomTraits_, class TopTraits_ =
-          typename Default_planar_topology<
-                               GeomTraits_,
-                               Envelope_3::Envelope_pm_dcel<
-                                 GeomTraits_,
-                                 typename GeomTraits_::Xy_monotone_surface_3
-                               > >::Traits
-          >
+template <typename GeomTraits_, typename TopTraits_ =
+          typename Default_planar_topology
+            <GeomTraits_,
+             Envelope_3::Envelope_pm_dcel
+               <GeomTraits_,
+                typename GeomTraits_::Xy_monotone_surface_3>>::Traits>
 class Envelope_diagram_on_surface_2 :
-public Arrangement_on_surface_2<GeomTraits_, TopTraits_>
-{
+    public Arrangement_on_surface_2<GeomTraits_, TopTraits_> {
 public:
-  typedef GeomTraits_                                   Traits_3;
-  typedef TopTraits_                                    TopTraits;
-  typedef typename Traits_3::Xy_monotone_surface_3      Xy_monotone_surface_3;
+  using Traits_3 = GeomTraits_;
+  using TopTraits = TopTraits_;
+  using Xy_monotone_surface_3 = typename Traits_3::Xy_monotone_surface_3;
 
 protected:
-  typedef Envelope_3::Envelope_pm_dcel<Traits_3,
-                           Xy_monotone_surface_3>       Env_dcel;
-  typedef Envelope_diagram_on_surface_2<Traits_3, TopTraits>       Self;
+  using Self = Envelope_diagram_on_surface_2<Traits_3, TopTraits>;
+
   friend class Arr_accessor<Self>;
 
 public:
-  typedef Arrangement_on_surface_2<Traits_3,
-    TopTraits>                                          Base;
-  // This is yacky, but we have not choice because of observer stuff.
-  typedef Base                                          Arrangement;
+  using Base = Arrangement_on_surface_2<Traits_3, TopTraits>;
 
-  typedef typename Env_dcel::Dcel_data_const_iterator   Surface_const_iterator;
+  // The following is not needed anymore, but kept for backward compatibility
+  using Arrangement = Base;
+
+  using Face = typename Base::Face;
+  using Surface_iterator = typename Face::Data_iterator;
+  using Surface_const_iterator = typename Face::Data_const_iterator;
 
   /*! Default constructor. */
-  Envelope_diagram_on_surface_2() :
-    Base()
-  {}
+  Envelope_diagram_on_surface_2() : Base() {}
 
   /*! Constructor with a traits-class instance. */
-  Envelope_diagram_on_surface_2 (Traits_3* tr) :
-    Base (tr)
-  {}
-
+  Envelope_diagram_on_surface_2(const Traits_3* tr) : Base(tr) {}
 };
 
-
 /*! \class
  * Representation of an envelope diagram (a minimization diagram or a
  * maximization diagram).
  */
-
-template <class GeomTraits_,
-          class Dcel_ = Envelope_3::Envelope_pm_dcel<
-            GeomTraits_, typename GeomTraits_::Xy_monotone_surface_3
-            >
-          >
+template <typename GeomTraits,
+          typename Dcel_ = Envelope_3::Envelope_pm_dcel
+            <GeomTraits, typename GeomTraits::Xy_monotone_surface_3>>
 class Envelope_diagram_2 :
-  public Envelope_diagram_on_surface_2< GeomTraits_,
-     typename Default_planar_topology<GeomTraits_,
-                                      Dcel_>::Traits
-    >
+  public Envelope_diagram_on_surface_2<GeomTraits,
+                                       typename Default_planar_topology
+                                         <GeomTraits, Dcel_>::Traits>
 {
 public:
-  typedef GeomTraits_                                   Traits_3;
-  typedef typename Traits_3::Xy_monotone_surface_3      Xy_monotone_surface_3;
+  using Traits_3 = GeomTraits;
+  using Xy_monotone_surface_3 = typename Traits_3::Xy_monotone_surface_3;
 
 protected:
-  typedef Dcel_                                         Env_dcel;
-  typedef Envelope_diagram_2<Traits_3, Env_dcel>        Self;
+  using Env_dcel = Dcel_;
+  using Self = Envelope_diagram_2<Traits_3, Env_dcel>;
+
   friend class Arr_accessor<Self>;
 
 public:
-  typedef typename Default_planar_topology< Traits_3,
-                                   Env_dcel >::Traits   Topology_traits;
-  typedef Envelope_diagram_on_surface_2<Traits_3, Topology_traits>
-                                                        Base;
-  typedef typename Env_dcel::Dcel_data_const_iterator   Surface_const_iterator;
-
-  // This is yacky, but we have not choice because of observer stuff.
-  typedef typename Base::Base                           Arrangement;
+  using Topology_traits =
+    typename Default_planar_topology< Traits_3, Env_dcel>::Traits;
+  using Base = Envelope_diagram_on_surface_2<Traits_3, Topology_traits>;
+  using Surface_iterator = typename Base::Surface_iterator;
+  using Surface_const_iterator = typename Base::Surface_const_iterator;
 
+  // The following is not needed anymore, but kept for backward compatibility
+  using Arrangement = typename Base::Base;
 
   /*! Default constructor. */
-  Envelope_diagram_2() :
-    Base()
-  {}
+  Envelope_diagram_2() : Base() {}
 
   /*! Constructor with a traits-class instance. */
-  Envelope_diagram_2 (Traits_3* tr) :
-    Base (tr)
-  {}
-
+  Envelope_diagram_2(const Traits_3* tr) : Base(tr) {}
 };
 
-
 //--------------------------------  Envelope_on_surface_3
 // specialization
-template <class GeomTraits_, class TopTraits_>
-class is_arrangement_2<
-  Envelope_diagram_on_surface_2<GeomTraits_, TopTraits_>
-> : public std::true_type
+template <typename GeomTraits_, typename TopTraits_>
+class is_arrangement_2<Envelope_diagram_on_surface_2<GeomTraits_, TopTraits_>> :
+    public std::true_type
 {};
 
 // specialization
-template <class GeomTraits_, class DCEL_>
-class is_arrangement_2<
-  Envelope_diagram_2<GeomTraits_, DCEL_>
-> : public std::true_type
+template <typename GeomTraits_, typename Dcel_>
+class is_arrangement_2<Envelope_diagram_2<GeomTraits_, Dcel_>> :
+    public std::true_type
 {};
 
-
 // /*! \class
 //  * Representation of an envelope diagram (a minimization diagram or a
 //  * maximization diagram).
@@ -185,7 +162,6 @@ class is_arrangement_2<
 
 // };
 
-
 } //namespace CGAL
 
 #endif

From fe1843d245b23b67a19c894dd906895c90f40e3a Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 30 Jan 2024 00:47:18 +0200
Subject: [PATCH 1318/1398] Cleaned up; 'typedef' => 'using'

---
 .../Envelope_3/Envelope_overlay_functor.h     | 270 ++++++++----------
 1 file changed, 121 insertions(+), 149 deletions(-)

diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h
index 3c259c2635f3..82ecf38b0954 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h
@@ -7,8 +7,9 @@
 // $Id$
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
-//                 Baruch Zukerman        <baruchzu@post.tau.ac.il>
+// Author(s) : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+//             Baruch Zukerman        <baruchzu@post.tau.ac.il>
+//             Efi Fogel              <efif@post.tau.ac.il>
 
 #ifndef CGAL_ENVELOPE_OVERLAY_FUNCTOR_H
 #define CGAL_ENVELOPE_OVERLAY_FUNCTOR_H
@@ -20,87 +21,77 @@
 
 namespace CGAL {
 
-template < class MinimizationDiagram_2>
-class Envelope_overlay_functor
-{
+template <typename MinimizationDiagram_2>
+class Envelope_overlay_functor {
 public:
-  typedef MinimizationDiagram_2                                  Minimization_diagram_2;
+  using Minimization_diagram_2 = MinimizationDiagram_2;
 
-  typedef typename Minimization_diagram_2::Face_const_handle     Face_const_handle1;
-  typedef typename Minimization_diagram_2::Face_const_handle     Face_const_handle2;
+private:
+  using Md2 = Minimization_diagram_2;
 
-  typedef typename Minimization_diagram_2::Vertex_const_handle   Vertex_const_handle1;
-  typedef typename Minimization_diagram_2::Vertex_const_handle   Vertex_const_handle2;
+public:
+  using Face_const_handle1 = typename Md2::Face_const_handle;
+  using Face_const_handle2 = typename Md2::Face_const_handle;
 
-  typedef typename Minimization_diagram_2::Halfedge_const_handle Halfedge_const_handle1;
-  typedef typename Minimization_diagram_2::Halfedge_const_handle Halfedge_const_handle2;
+  using Vertex_const_handle1 = typename Md2::Vertex_const_handle;
+  using Vertex_const_handle2 = typename Md2::Vertex_const_handle;
 
-  typedef typename Minimization_diagram_2::Face_handle           Face_handle;
-  typedef typename Minimization_diagram_2::Vertex_handle         Vertex_handle;
-  typedef typename Minimization_diagram_2::Halfedge_handle       Halfedge_handle;
+  using Halfedge_const_handle1 = typename Md2::Halfedge_const_handle;
+  using Halfedge_const_handle2 = typename Md2::Halfedge_const_handle;
 
-  typedef typename Minimization_diagram_2::Face_handle           Res_face_handle;
-  typedef typename Minimization_diagram_2::Halfedge_handle       Res_halfedge_handle;
-  typedef typename Minimization_diagram_2::Vertex_handle         Res_vertex_handle;
+  using Face_handle = typename Md2::Face_handle;
+  using Vertex_handle = typename Md2::Vertex_handle;
+  using Halfedge_handle = typename Md2::Halfedge_handle;
 
-protected:
+  using Res_face_handle = typename Md2::Face_handle;
+  using Res_halfedge_handle = typename Md2::Halfedge_handle;
+  using Res_vertex_handle = typename Md2::Vertex_handle;
 
-  typedef typename Minimization_diagram_2::Dcel::Dcel_data_iterator Envelope_data_iterator;
-  typedef std::pair<Vertex_handle, Face_handle>                  Vertex_face_pair;
-  struct Less_vertex_face_pair
-  {
-    bool operator() (const Vertex_face_pair& vf1,
-                     const Vertex_face_pair& vf2) const
-    {
+protected:
+  using Dcel = typename Md2::Dcel;
+  using Face = typename Dcel::Face;
+  using Envelope_data_iterator = typename Face::Data_iterator;
+  using Vertex_face_pair = std::pair<Vertex_handle, Face_handle>;
+
+  struct Less_vertex_face_pair {
+    bool operator() (const Vertex_face_pair& vf1, const Vertex_face_pair& vf2)
+      const {
       Vertex_handle v1 = vf1.first, v2 = vf2.first;
       Face_handle f1 = vf1.second, f2= vf2.second;
-      return (&*v1 < &*v2 ||
-              (&*v1 == &*v2 && &*f1 < &*f2));
+      return (&*v1 < &*v2 || (&*v1 == &*v2 && &*f1 < &*f2));
     }
   };
-  typedef std::map<Vertex_face_pair, Halfedge_handle,
-                   Less_vertex_face_pair>                        Boundary_cache;
+  using Boundary_cache =
+    std::map<Vertex_face_pair, Halfedge_handle, Less_vertex_face_pair>;
 
 public:
+  Envelope_overlay_functor(Md2& md1, Md2& md2, Md2& result) :
+    m_1(md1), m_2(md2), m_result(result)
+  {}
 
-  Envelope_overlay_functor(Minimization_diagram_2& md1,
-                           Minimization_diagram_2& md2,
-                           Minimization_diagram_2& result)
-    : m_1(md1), m_2(md2), m_result(result)
-  {
-  }
+  ~Envelope_overlay_functor() { traversed_vertices.clear(); }
 
-  ~Envelope_overlay_functor()
-  {
-    traversed_vertices.clear();
-  }
-
-  void create_face (Face_const_handle1 f1, Face_const_handle2 f2, Res_face_handle res_f)
-  {
+  void create_face(Face_const_handle1 f1, Face_const_handle2 f2,
+                   Res_face_handle res_f) {
     res_f->set_aux_source(0, m_1.non_const_handle(f1));
     res_f->set_aux_source(1, m_2.non_const_handle(f2));
   }
 
-  void create_vertex(Halfedge_const_handle1 h1,
-                     Halfedge_const_handle2 h2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Halfedge_const_handle1 h1, Halfedge_const_handle2 h2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, m_1.non_const_handle(h1));
     res_v->set_aux_source(1, m_2.non_const_handle(h2));
     //res_v->set_is_intersection(true);
     // res_v cannot be isolated
   }
 
-  void create_vertex(Vertex_const_handle1 v1,
-                     Vertex_const_handle2 v2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Vertex_const_handle1 v1, Vertex_const_handle2 v2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, m_1.non_const_handle(v1));
     res_v->set_aux_source(1, m_2.non_const_handle(v2));
     //res_v->set_is_intersection(false);
 
-    if (v1->is_isolated() && v2->is_isolated())
-    {
+    if (v1->is_isolated() && v2->is_isolated()) {
       res_v->set_is_equal_aux_data_in_face(0, v1->get_is_equal_data_in_face());
       res_v->set_is_equal_aux_data_in_face(1, v2->get_is_equal_data_in_face());
       res_v->set_has_equal_aux_data_in_face(0, v1->get_has_equal_data_in_face());
@@ -108,36 +99,29 @@ class Envelope_overlay_functor
     }
   }
 
-  void create_vertex(Vertex_const_handle1 v1,
-                     Halfedge_const_handle2 h2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Vertex_const_handle1 v1, Halfedge_const_handle2 h2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, m_1.non_const_handle(v1));
     res_v->set_aux_source(1, m_2.non_const_handle(h2));
     //res_v->set_is_intersection(true);
     // res_v cannot be isolated
   }
 
-  void create_vertex(Halfedge_const_handle1 h1,
-                     Vertex_const_handle2 v2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Halfedge_const_handle1 h1, Vertex_const_handle2 v2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, m_1.non_const_handle(h1));
     res_v->set_aux_source(1, m_2.non_const_handle(v2));
     //res_v->set_is_intersection(true);
     // res_v cannot be isolated
   }
 
-  void create_vertex(Face_const_handle1 f1,
-                     Vertex_const_handle2 v2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Face_const_handle1 f1, Vertex_const_handle2 v2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, m_1.non_const_handle(f1));
     res_v->set_aux_source(1, m_2.non_const_handle(v2));
     //res_v->set_is_intersection(false);
 
-    if (v2->is_isolated())
-    {
+    if (v2->is_isolated()) {
       // the res_v is also isolated, and we should update the is_equal/has_equal
       // data in face information
       res_v->set_is_equal_aux_data_in_face(0, true);
@@ -147,16 +131,13 @@ class Envelope_overlay_functor
     }
   }
 
-  void create_vertex(Vertex_const_handle1 v1,
-                     Face_const_handle2 f2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Vertex_const_handle1 v1, Face_const_handle2 f2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, m_1.non_const_handle(v1));
     res_v->set_aux_source(1, m_2.non_const_handle(f2));
     //res_v->set_is_intersection(false);
 
-    if (v1->is_isolated())
-    {
+    if (v1->is_isolated()) {
       // the res_v is also isolated, and we should update the is_equal/has_equal
       // data in face information
       res_v->set_is_equal_aux_data_in_face(0, v1->get_is_equal_data_in_face());
@@ -166,10 +147,8 @@ class Envelope_overlay_functor
     }
   }
 
-  void create_edge(Halfedge_const_handle1 h1,
-                   Halfedge_const_handle2 h2,
-                   Res_halfedge_handle res_h)
-  {
+  void create_edge(Halfedge_const_handle1 h1, Halfedge_const_handle2 h2,
+                   Res_halfedge_handle res_h) {
     // update source
     res_h->set_aux_source(0, m_1.non_const_handle(h1));
     res_h->set_aux_source(1, m_2.non_const_handle(h2));
@@ -183,10 +162,14 @@ class Envelope_overlay_functor
     res_h->set_has_equal_aux_data_in_face(0, h1->get_has_equal_data_in_face());
     res_h->set_has_equal_aux_data_in_face(1, h2->get_has_equal_data_in_face());
 
-    res_h->twin()->set_is_equal_aux_data_in_face(0, h1->twin()->get_is_equal_data_in_face());
-    res_h->twin()->set_is_equal_aux_data_in_face(1, h2->twin()->get_is_equal_data_in_face());
-    res_h->twin()->set_has_equal_aux_data_in_face(0, h1->twin()->get_has_equal_data_in_face());
-    res_h->twin()->set_has_equal_aux_data_in_face(1, h2->twin()->get_has_equal_data_in_face());
+    res_h->twin()->set_is_equal_aux_data_in_face(0, h1->twin()->
+                                                 get_is_equal_data_in_face());
+    res_h->twin()->set_is_equal_aux_data_in_face(1, h2->twin()->
+                                                 get_is_equal_data_in_face());
+    res_h->twin()->set_has_equal_aux_data_in_face(0, h1->twin()->
+                                                  get_has_equal_data_in_face());
+    res_h->twin()->set_has_equal_aux_data_in_face(1, h2->twin()->
+                                                  get_has_equal_data_in_face());
 
     // update is_equal/has_equal data in target
     update_halfedge_flags_on_edge(res_h, m_1.non_const_handle(h1), 0);
@@ -196,17 +179,17 @@ class Envelope_overlay_functor
 
     // update is_equal/has_equal data in source
     // update aux_data(0)
-          update_halfedge_flags_on_edge(res_h->twin(), m_1.non_const_handle(h1->twin()), 0);
+    update_halfedge_flags_on_edge(res_h->twin(),
+                                  m_1.non_const_handle(h1->twin()), 0);
 
     // update aux_data(1)
-          update_halfedge_flags_on_edge(res_h->twin(), m_2.non_const_handle(h2->twin()), 1);
+    update_halfedge_flags_on_edge(res_h->twin(),
+                                  m_2.non_const_handle(h2->twin()), 1);
 
   }
 
-  void create_edge(Halfedge_const_handle1 h1,
-                   Face_const_handle2 f2,
-                   Res_halfedge_handle res_h)
-  {
+  void create_edge(Halfedge_const_handle1 h1, Face_const_handle2 f2,
+                   Res_halfedge_handle res_h) {
     res_h->set_aux_source(0, m_1.non_const_handle(h1));
     res_h->set_aux_source(1, m_2.non_const_handle(f2));
 
@@ -219,16 +202,19 @@ class Envelope_overlay_functor
     res_h->set_has_equal_aux_data_in_face(0, h1->get_has_equal_data_in_face());
     res_h->set_has_equal_aux_data_in_face(1, !f2->has_no_data());
 
-    res_h->twin()->set_is_equal_aux_data_in_face(0, h1->twin()->get_is_equal_data_in_face());
+    res_h->twin()->set_is_equal_aux_data_in_face(0, h1->twin()->
+                                                 get_is_equal_data_in_face());
     res_h->twin()->set_is_equal_aux_data_in_face(1, true);
-    res_h->twin()->set_has_equal_aux_data_in_face(0, h1->twin()->get_has_equal_data_in_face());
+    res_h->twin()->set_has_equal_aux_data_in_face(0, h1->twin()->
+                                                  get_has_equal_data_in_face());
     res_h->twin()->set_has_equal_aux_data_in_face(1, !f2->has_no_data());
 
     // update is_equal/has_equal data in target for the first source map
-          update_halfedge_flags_on_edge(res_h, m_1.non_const_handle(h1), 0);
+    update_halfedge_flags_on_edge(res_h, m_1.non_const_handle(h1), 0);
 
     // update source
-          update_halfedge_flags_on_edge(res_h->twin(), m_1.non_const_handle(h1->twin()), 0);
+    update_halfedge_flags_on_edge(res_h->twin(),
+                                        m_1.non_const_handle(h1->twin()), 0);
 
     // update is_equal/has_equal data in target for the second source map
     update_halfedge_flags_in_face(res_h, m_2.non_const_handle(f2), 1);
@@ -238,10 +224,8 @@ class Envelope_overlay_functor
   }
 
 
-  void create_edge(Face_const_handle1 f1,
-                   Halfedge_const_handle2 h2,
-                   Res_halfedge_handle res_h)
-  {
+  void create_edge(Face_const_handle1 f1, Halfedge_const_handle2 h2,
+                   Res_halfedge_handle res_h) {
     res_h->set_aux_source(0, m_1.non_const_handle(f1));
     res_h->set_aux_source(1, m_2.non_const_handle(h2));
 
@@ -260,10 +244,11 @@ class Envelope_overlay_functor
     res_h->twin()->set_has_equal_aux_data_in_face(1, h2->twin()->get_has_equal_data_in_face());
 
     // update is_equal/has_equal data in target for the second source map
-          update_halfedge_flags_on_edge(res_h, m_2.non_const_handle(h2), 1);
+    update_halfedge_flags_on_edge(res_h, m_2.non_const_handle(h2), 1);
 
     // update source
-          update_halfedge_flags_on_edge(res_h->twin(), m_2.non_const_handle(h2->twin()), 1);
+    update_halfedge_flags_on_edge(res_h->twin(),
+                                  m_2.non_const_handle(h2->twin()), 1);
 
     // update is_equal/has_equal data in target for the first source map
     update_halfedge_flags_in_face(res_h, m_1.non_const_handle(f1), 0);
@@ -273,39 +258,37 @@ class Envelope_overlay_functor
 
 protected:
 
-  template <class Halfedge_handle_t>
-  void copy_halfedge_target_info(Halfedge_handle_t from, Res_halfedge_handle to, unsigned int id)
-  {
+  template <typename Halfedge_handle_t>
+  void copy_halfedge_target_info(Halfedge_handle_t from,
+                                 Res_halfedge_handle to, unsigned int id) {
     to->set_is_equal_aux_data_in_target(id, from->get_is_equal_data_in_target());
     to->set_has_equal_aux_data_in_target(id, from->get_has_equal_data_in_target());
   }
-  void set_halfedge_target_info(Res_halfedge_handle to, unsigned int id, bool info)
-  {
+  void set_halfedge_target_info(Res_halfedge_handle to, unsigned int id,
+                                bool info) {
     to->set_is_equal_aux_data_in_target(id, info);
     to->set_has_equal_aux_data_in_target(id, info);
   }
 
-  template <class Halfedge_handle_t>
+  template <typename Halfedge_handle_t>
   void copy_halfedge_target_info_from_halfedge_face_info(Halfedge_handle_t from,
                                                          Res_halfedge_handle to,
-                                                         unsigned int id)
-  {
+                                                         unsigned int id) {
     to->set_is_equal_aux_data_in_target(id, from->get_is_equal_data_in_face());
     to->set_has_equal_aux_data_in_target(id, from->get_has_equal_data_in_face());
     to->set_has_equal_aux_data_in_target_and_face(id, from->get_has_equal_data_in_face());
   }
-  template <class Vertex_handle_t>
+  template <typename Vertex_handle_t>
   void copy_halfedge_target_info_from_vertex_face_info(Vertex_handle_t from,
                                                        Res_halfedge_handle to,
-                                                       unsigned int id)
-  {
+                                                       unsigned int id) {
     to->set_is_equal_aux_data_in_target(id, from->get_is_equal_data_in_face());
     to->set_has_equal_aux_data_in_target(id, from->get_has_equal_data_in_face());
   }
 
   // find a halfedge that v is its target and f is its face
-  Halfedge_handle find_halfedge_by_vertex_and_face(Vertex_handle v, Face_handle f)
-  {
+  Halfedge_handle find_halfedge_by_vertex_and_face(Vertex_handle v,
+                                                   Face_handle f) {
     // should always invoke this method when v is on the boundary of f
 
     // for the complexity of the total algorithm, we only loop over
@@ -314,11 +297,10 @@ class Envelope_overlay_functor
     Vertex_face_pair query(v, f);
     typename Boundary_cache::iterator iter = traversed_vertices.find(query);
     Halfedge_handle result;
-    if (iter == traversed_vertices.end())
-    {
+    if (iter == traversed_vertices.end()) {
       // first time to check this vertex - traverse all its halfedges
       // and update the map
-      typename Minimization_diagram_2::Halfedge_around_vertex_circulator vc =
+      typename Md2::Halfedge_around_vertex_circulator vc =
         v->incident_halfedges(),
         vc_begin = vc;
       do {
@@ -326,13 +308,11 @@ class Envelope_overlay_functor
         // update the map
         traversed_vertices[Vertex_face_pair(v, hh->face())] = hh;
         // check for reult
-        if (hh->face() == f)
-          result = hh;
+        if (hh->face() == f) result = hh;
         ++vc;
       } while (vc != vc_begin);
     }
-    else
-    {
+    else {
       // take it from the map
       result = iter->second;
     }
@@ -344,29 +324,26 @@ class Envelope_overlay_functor
   // and target-face flags
   // id is the source diagram where on_edge comes from
   // (i.e. the id of the aux information to update)
-  void update_halfedge_flags_on_edge(Halfedge_handle new_h, Halfedge_handle on_edge, unsigned int id)
-  {
-    if(new_h->target()->is_at_open_boundary())
-      return;
+  void update_halfedge_flags_on_edge(Halfedge_handle new_h,
+                                     Halfedge_handle on_edge, unsigned int id) {
+    if(new_h->target()->is_at_open_boundary()) return;
     Vertex_handle vh;
     Halfedge_handle hh;
     const Object& trg_src = new_h->target()->get_aux_source(id);
-    if (assign(vh, trg_src))
-    {
+    if (assign(vh, trg_src)) {
           // vh is the target of on_edge, and we can copy the halfedge-target information
       // from on_edge
       copy_halfedge_target_info(on_edge, new_h, id);
             new_h->set_has_equal_aux_data_in_target_and_face
-                         (id, on_edge->get_has_equal_data_in_target_and_face());
+              (id, on_edge->get_has_equal_data_in_target_and_face());
     }
-    else if (assign(hh, trg_src))
-    {
+    else if (assign(hh, trg_src)) {
       // hh is the "HEMSHECH" of on_edge, so we need to set halfedge_target
       // information to true
       set_halfedge_target_info(new_h, id, true);
             // and target-face information using the original halfedge-face information
-            new_h->set_has_equal_aux_data_in_target_and_face
-                         (id, on_edge->get_has_equal_data_in_face());
+      new_h->set_has_equal_aux_data_in_target_and_face
+        (id, on_edge->get_has_equal_data_in_face());
     }
     else
       // this cannot happen, since we need to touch an edge
@@ -377,28 +354,25 @@ class Envelope_overlay_functor
   // and target-face information
   // id is the source diagram where in_face comes from
   // (i.e. the id of the aux information to update)
-  void update_halfedge_flags_in_face(Halfedge_handle new_h, Face_handle in_face, unsigned int id)
-  {
-    if(new_h->target()->is_at_open_boundary())
-      return;
+  void update_halfedge_flags_in_face(Halfedge_handle new_h,
+                                     Face_handle in_face, unsigned int id) {
+    if (new_h->target()->is_at_open_boundary()) return;
     Vertex_handle vh;
     Halfedge_handle hh;
     Face_handle fh;
     // update target
     const Object& trg_src = new_h->target()->get_aux_source(id);
-    if (assign(vh, trg_src))
-    {
-      if (vh->is_isolated())
-      {
+    if (assign(vh, trg_src)) {
+      if (vh->is_isolated()) {
         copy_halfedge_target_info_from_vertex_face_info(vh, new_h, id);
-                    // the target-face information is taken from vertex-face information too
+        // the target-face information is taken from vertex-face information too
         new_h->set_has_equal_aux_data_in_target_and_face
                                      (id, vh->get_has_equal_data_in_face());
       }
-      else
-      {
+      else {
         // we have a vertex vh on the boundary of the face in_face
-        // todo: get rid of this calculations: (using unknown value for has_equal flag)
+        // todo: get rid of this calculations: (using unknown value for
+        // has_equal flag)
         /*CGAL_assertion_code(
           bool calc_is_equal = vh->is_equal_data(in_face->begin_data(), in_face->end_data());
         )*/
@@ -406,7 +380,7 @@ class Envelope_overlay_functor
 
         // find the halfedge with target vh on the boundary of in_face
         Halfedge_handle h_of_vh_and_in_face =
-               find_halfedge_by_vertex_and_face(vh, in_face);
+          find_halfedge_by_vertex_and_face(vh, in_face);
         // is_equal relationship is easy:
         bool is_equal = h_of_vh_and_in_face->get_is_equal_data_in_face() &&
                         h_of_vh_and_in_face->get_is_equal_data_in_target();
@@ -427,18 +401,16 @@ class Envelope_overlay_functor
         new_h->set_has_equal_aux_data_in_target_and_face(id, has_equal);
       }
     }
-    else if (assign(hh, trg_src))
+    else if (assign(hh, trg_src)) {
       // we should find the halfedge (hh or hh>twin()) that points to face
       // in_face, and check the halfedge-face flags there
-    {
       CGAL_assertion(hh->face() == in_face || hh->twin()->face() == in_face);
       if (hh->face() == in_face)
         copy_halfedge_target_info_from_halfedge_face_info(hh, new_h, id);
       else
         copy_halfedge_target_info_from_halfedge_face_info(hh->twin(), new_h, id);
     }
-    else
-    {
+    else {
       CGAL_assertion_code(bool b =)
       assign(fh, trg_src);
       CGAL_assertion(b);
@@ -452,10 +424,10 @@ class Envelope_overlay_functor
     }
   }
 
-  Minimization_diagram_2& m_1;
-  Minimization_diagram_2& m_2;
-  Minimization_diagram_2& m_result;
-  Boundary_cache          traversed_vertices;
+  Md2& m_1;
+  Md2& m_2;
+  Md2& m_result;
+  Boundary_cache traversed_vertices;
 };
 
 } //namespace CGAL

From afff35cbddac59237da71ce8f6549d8f6b97507a Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 30 Jan 2024 00:55:26 +0200
Subject: [PATCH 1319/1398] Replaced get_data() and set_data() with
 get_env_data() and set_env_data() to avoid clashes with other extensions of
 the Dcel; Added template parameters (vertex-base, halfedge-base, and
 face-base) with default values to Envelope_pm_dcel

---
 .../CGAL/Envelope_3/Envelope_pm_dcel.h        | 499 +++++++-----------
 1 file changed, 181 insertions(+), 318 deletions(-)

diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
index c15c2dead3e2..33117b474f9f 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
@@ -7,10 +7,10 @@
 // $Id$
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
-//                 Baruch Zukerman        <baruchzu@post.tau.ac.il>
-//                 Ron Wein               <wein@post.tau.ac.il>
-//                 Efi Fogel              <efif@post.tau.ac.il>
+// Author(s) : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+//             Baruch Zukerman        <baruchzu@post.tau.ac.il>
+//             Ron Wein               <wein@post.tau.ac.il>
+//             Efi Fogel              <efif@post.tau.ac.il>
 
 #ifndef CGAL_ENVELOPE_PM_DCEL_H
 #define CGAL_ENVELOPE_PM_DCEL_H
@@ -21,19 +21,18 @@
 #include <CGAL/Arr_default_dcel.h>
 #include <CGAL/Envelope_3/Envelope_base.h>
 
-namespace CGAL
-{
-namespace Envelope_3
-{
+namespace CGAL {
 
-template <class Data>
-class Dcel_info
-{
+namespace Envelope_3 {
+
+template <typename Data_>
+class Dcel_info {
 public:
-  typedef Dcel_info<Data>                         Self;
-  typedef std::list<Data>                         Data_container;
-  typedef typename Data_container::iterator       Data_iterator;
-  typedef typename Data_container::const_iterator Data_const_iterator;
+  using Data = Data_;
+  using Self = Dcel_info<Data>;
+  using Data_container = std::list<Data>;
+  using Data_iterator =  typename Data_container::iterator;
+  using Data_const_iterator = typename Data_container::const_iterator;
 
 protected:
   /*! data container */
@@ -46,8 +45,7 @@ class Dcel_info
   Dac_decision m_decision;
 public:
   /*! Constructor */
-  Dcel_info() : m_is_set(false), m_decision(DAC_DECISION_NOT_SET)
-  {}
+  Dcel_info() : m_is_set(false), m_decision(DAC_DECISION_NOT_SET) {}
 
   /*! \brief returns true iff data has been set already */
   bool get_is_set() const { return m_is_set; }
@@ -55,194 +53,127 @@ class Dcel_info
   /*! \brief resets the flag  */
   void set_is_set(bool flag) { m_is_set = flag; }
 
-  bool is_decision_set()
-  {
-    return (m_decision != DAC_DECISION_NOT_SET);
-  }
+  bool is_decision_set() { return (m_decision != DAC_DECISION_NOT_SET); }
 
-  Dac_decision get_decision() const
-  {
-    return m_decision;
-  }
+  Dac_decision get_decision() const { return m_decision; }
 
   void set_decision(Comparison_result comp)
-  {
-    m_decision = enum_cast<Dac_decision>(comp);
-  }
+  { m_decision = enum_cast<Dac_decision>(comp); }
 
-  void set_decision(Dac_decision dec)
-  {
-    m_decision = dec;
-  }
+  void set_decision(Dac_decision dec) { m_decision = dec; }
 
   /*! User-friendly interface: */
-  size_t number_of_surfaces () const
-  {
-    return (m_data.size());
-  }
+  size_t number_of_surfaces() const { return m_data.size(); }
 
-  Data_const_iterator surfaces_begin () const
-  {
-    return (m_data.begin());
-  }
+  Data_const_iterator surfaces_begin() const { return m_data.begin(); }
 
-  Data_const_iterator surfaces_end () const
-  {
-    return (m_data.end());
-  }
+  Data_const_iterator surfaces_end() const { return m_data.end(); }
 
-   /*!
-   * Get the first Xy-monotone surface associated with the face.
-   * \pre number_of_surfaces() is not 0.
-   */
-  const Data& surface() const
-  {
-    CGAL_precondition (m_data.size() > 0);
-    return (m_data.front());
+   /*! Obtain the first Xy-monotone surface associated with the face.
+    * \pre number_of_surfaces() is not 0.
+    */
+  const Data& surface() const {
+    CGAL_precondition(m_data.size() > 0);
+    return m_data.front();
   }
 
-  /*!
-   * Get the number of data objects associated with the face.
+  /*! Obtain the number of data objects associated with the face.
    */
-  int number_of_data_objects() const
-  {
-    return static_cast<int>(m_data.size());
-  }
+  int number_of_data_objects() const { return static_cast<int>(m_data.size()); }
 
-  /*!
-   * check if the data is set to be empty
+  /*! Check whether the data is set to be empty
    */
   bool has_no_data() const
-  {
-    return (m_is_set && number_of_data_objects() == 0);
-  }
+  { return (m_is_set && (number_of_data_objects() == 0)); }
 
-  /*!
-   * Get the first data object associated with the face.
+  /*! Obtain the first data object associated with the face.
    * \pre number_of_data_objects() is not 0.
    */
-  const Data& get_data() const
-  {
-    CGAL_precondition (m_data.size() > 0);
-
-    return (m_data.front());
+  const Data& get_env_data() const {
+    CGAL_precondition(m_data.size() > 0);
+    return m_data.front();
   }
 
-  /*!
-   * Get the data iterators (const version).
+  /*! Obtain the data iterators (const version).
    */
-  Data_const_iterator begin_data() const
-  {
-    return (m_data.begin());
-  }
+  Data_const_iterator begin_data() const { return m_data.begin(); }
 
-  Data_const_iterator end_data() const
-  {
-    return (m_data.end());
-  }
+  Data_const_iterator end_data() const { return m_data.end(); }
 
-  /*!
-   * Get the data iterators (non-const version).
+  /*! Obtain the data iterators (non-const version).
    */
-  Data_iterator begin_data()
-  {
-    return (m_data.begin());
-  }
+  Data_iterator begin_data() { return m_data.begin(); }
 
-  Data_iterator end_data()
-  {
-    return (m_data.end());
-  }
+  Data_iterator end_data() { return m_data.end(); }
 
-  /*!
-   * Set a data object to the face.
+  /*! Set a data object to the face.
    * \param data The data object to set.
    */
-  void set_data (const Data & data)
-  {
+  void set_env_data(const Data& data) {
     clear_data();
     add_data(data);
   }
 
-  /*!
-   * Set a range of data objects to the face.
+  /*! Set a range of data objects to the face.
    * \param begin A begin iterator for the data range.
    * \param end A past-the-end iterator for the data range.
    */
-  template <class InputIterator>
-  void set_data(const InputIterator & begin, const InputIterator & end)
-  {
+  template <typename InputIterator>
+  void set_env_data(InputIterator begin, InputIterator end) {
     clear_data();
     add_data(begin, end);
   }
 
-  /*!
-   * set the data to be empty.
+  /*! set the data to be empty.
    */
-  void set_no_data()
-  {
+  void set_no_data() {
     clear_data();
     m_is_set = true;
   }
 
-   /*!
-   * Add a data object to the face.
+   /*! Add a data object to the face.
    * \param data The additional data object.
    */
-  void add_data (const Data & data)
-  {
+  void add_data(const Data& data) {
     m_data.push_back(data);
     m_is_set = true;
   }
 
-  /*!
-   * Add a range of data objects to the face.
+  /*! Add a range of data objects to the face.
    * \param begin A begin iterator for the data range.
    * \param end A past-the-end iterator for the data range.
    */
-  template <class InputIterator>
-  void add_data (const InputIterator & begin, const InputIterator & end)
-  {
-    InputIterator    it;
-    for (it = begin; it != end; it++)
-      m_data.push_back(*it);
+  template <typename InputIterator>
+  void add_data(InputIterator begin, InputIterator end) {
+    for (auto it = begin; it != end; it++) m_data.push_back(*it);
     m_is_set = true;
   }
 
-  /*!
-   * Clear the data objects.
+  /*! Clear the data objects.
    */
-  void clear_data ()
-  {
+  void clear_data() {
     m_data.clear();
     m_is_set = false;
   }
 
-  /*!
-   * Check if the set of data objects in the input range is equal to our
+  /*! Check whether the set of data objects in the input range is equal to our
    * set of data objects
    */
-  template <class InputIterator>
-  bool is_equal_data(const InputIterator & begin, const InputIterator & end)
-    const
-  {
-    if (!get_is_set())
-      return false;
+  template <typename InputIterator>
+  bool is_equal_data(InputIterator begin, InputIterator end) const {
+    if (! get_is_set()) return false;
 
     // insert the input data objects into a set
     std::set<Data> input_data(begin, end);
     std::set<Data> my_data(begin_data(), end_data());
-    if (input_data.size() != my_data.size())
-      return false;
+    if (input_data.size() != my_data.size()) return false;
     return (my_data == input_data);
   }
 
-  template <class InputIterator>
-  bool has_equal_data(const InputIterator & begin, const InputIterator & end)
-    const
-  {
-    if (!get_is_set())
-      return false;
+  template <typename InputIterator>
+  bool has_equal_data(InputIterator begin, InputIterator end) const {
+    if (! get_is_set()) return false;
+
     // insert the input data objects into a set
     std::set<Data> input_data(begin, end);
     std::set<Data> my_data(begin_data(), end_data());
@@ -260,49 +191,46 @@ class Dcel_info
 
 public:
   template<class HandleType>
-  void set_aux_source(unsigned int id, HandleType h)
-  {
+  void set_aux_source(unsigned int id, HandleType h) {
     CGAL_precondition(id < 2);
     m_aux_source[id] = make_object(h);
   }
-  void set_aux_source(unsigned int id, const Object& o)
-  {
+
+  void set_aux_source(unsigned int id, const Object& o) {
     CGAL_precondition(id < 2);
     CGAL_precondition(!o.is_empty());
     m_aux_source[id] = o;
   }
 
-  const Object& get_aux_source(unsigned int id)
-  {
+  const Object& get_aux_source(unsigned int id) {
     CGAL_precondition(id < 2);
     CGAL_precondition (!m_aux_source[id].is_empty());
     return m_aux_source[id];
   }
 
   /*! \brief returns true iff the point has been set already */
-  bool get_aux_is_set(unsigned int id) const
-  {
+  bool get_aux_is_set(unsigned int id) const {
     CGAL_precondition(id < 2);
-        return (!m_aux_source[id].is_empty());
+    return (! m_aux_source[id].is_empty());
   }
 };
 
 /*! Extend the planar-map vertex */
-template <class Point_2, class Data>
-class Envelope_pm_vertex : public CGAL::Arr_vertex_base<Point_2>,
-                           public Dcel_info<Data>
-{
-  typedef CGAL::Arr_vertex_base<Point_2>       Base_vertex;
-  typedef Dcel_info<Data>                      Base_info;
-  typedef Envelope_pm_vertex<Point_2, Data>    Self;
+template <typename BaseVertex, class VertexData>
+class Envelope_pm_vertex : public BaseVertex, public Dcel_info<VertexData> {
+public:
+  using Base_vertex = BaseVertex;
+  using Vertex_data = VertexData;
+
+private:
+  using Self = Envelope_pm_vertex<Base_vertex, Vertex_data>;
 
 protected:
   // all flags are bits in this variable:
   unsigned short flags;
 
   // the flags indications:
-  enum Bit_pos
-  {
+  enum Bit_pos {
     // for an isolated vertex only
     IS_EQUAL   = 0,
     IS_EQUAL_AUX = 1,
@@ -316,10 +244,12 @@ class Envelope_pm_vertex : public CGAL::Arr_vertex_base<Point_2>,
     // intersection points
     IS_INTERSECTION = 7
   };
+
 public:
+  using Base_info = Dcel_info<Vertex_data>;
+
   /*! Constructor */
-  Envelope_pm_vertex() : Dcel_info<Data>(), flags(0)
-  {}
+  Envelope_pm_vertex() : Dcel_info<Vertex_data>(), flags(0) {}
 
   /*void set_is_fake(bool b)
   {
@@ -339,42 +269,26 @@ class Envelope_pm_vertex : public CGAL::Arr_vertex_base<Point_2>,
     return get_bit(IS_FAKE);
   }*/
 
-  void set_is_equal_data_in_face(bool b)
-  {
-    set_bit(IS_EQUAL, b);
-  }
-  bool get_is_equal_data_in_face() const
-  {
-    return get_bit(IS_EQUAL);
-  }
+  void set_is_equal_data_in_face(bool b) { set_bit(IS_EQUAL, b); }
+  bool get_is_equal_data_in_face() const { return get_bit(IS_EQUAL); }
 
-  void set_has_equal_data_in_face(bool b)
-  {
-    set_bit(HAS_EQUAL, b);
-  }
-  bool get_has_equal_data_in_face() const
-  {
-    return get_bit(HAS_EQUAL);
-  }
+  void set_has_equal_data_in_face(bool b) { set_bit(HAS_EQUAL, b); }
+  bool get_has_equal_data_in_face() const { return get_bit(HAS_EQUAL); }
 
-  void set_is_equal_aux_data_in_face(unsigned int id, bool b)
-  {
+  void set_is_equal_aux_data_in_face(unsigned int id, bool b) {
     CGAL_assertion(id < 2);
     set_bit(IS_EQUAL_AUX+id, b);
   }
-  bool get_is_equal_aux_data_in_face(unsigned int id) const
-  {
+  bool get_is_equal_aux_data_in_face(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(IS_EQUAL_AUX+id);
   }
 
-  void set_has_equal_aux_data_in_face(unsigned int id, bool b)
-  {
+  void set_has_equal_aux_data_in_face(unsigned int id, bool b) {
     CGAL_assertion(id < 2);
     set_bit(HAS_EQUAL_AUX+id, b);
   }
-  bool get_has_equal_aux_data_in_face(unsigned int id) const
-  {
+  bool get_has_equal_aux_data_in_face(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(HAS_EQUAL_AUX+id);
   }
@@ -382,8 +296,7 @@ class Envelope_pm_vertex : public CGAL::Arr_vertex_base<Point_2>,
   /*! Assign from another vertex.
    * \param v the other vertex.
    */
-  virtual void assign(const Base_vertex & v)
-  {
+  virtual void assign(const Base_vertex& v) {
     Base_vertex::assign(v);
 
     const Self & ex_v = static_cast<const Self&>(v);
@@ -392,18 +305,13 @@ class Envelope_pm_vertex : public CGAL::Arr_vertex_base<Point_2>,
   }
 
 protected:
-  void set_bit(unsigned int ind, bool b)
-  {
-    if (b)
-      // set bit "ind" to 1:
-      flags |= (1 << ind);
-    else
-      // set bit "ind" to 0:
-      flags &= ~(1 << ind);
+  void set_bit(unsigned int ind, bool b) {
+    // set bit "ind" to 1 or 0:
+    if (b) flags |= (1 << ind);
+    else flags &= ~(1 << ind);
   }
 
-  bool get_bit(unsigned int ind) const
-  {
+  bool get_bit(unsigned int ind) const {
     // (1 << i) is bit i on, other bits off (start counting from 0)
     unsigned int mask = 1 << ind;
     return ((flags & mask) == mask);
@@ -411,23 +319,22 @@ class Envelope_pm_vertex : public CGAL::Arr_vertex_base<Point_2>,
 };
 
 /*! Extend the planar-map halfedge */
-template <class X_monotone_curve_2, class Data>
-class
-Envelope_pm_halfedge : public CGAL::Arr_halfedge_base<X_monotone_curve_2>,
-                       public Dcel_info<Data>
-{
-  typedef CGAL::Arr_halfedge_base<X_monotone_curve_2>     Base_halfedge;
-  typedef Dcel_info<Data>                                 Base_info;
-  typedef Envelope_pm_halfedge<X_monotone_curve_2, Data>  Self;
+template <typename BaseHalfedge, typename HalfedgeData>
+class Envelope_pm_halfedge : public BaseHalfedge,
+                             public Dcel_info<HalfedgeData> {
+public:
+  using Base_halfedge = BaseHalfedge;
+  using Halfedge_data = HalfedgeData;
 
-protected:
+private:
+  using Self = Envelope_pm_halfedge<Base_halfedge, Halfedge_data>;
 
+protected:
   // all flags are bits in this variable:
   unsigned int flags;
 
   // flags indications
-  enum Bit_pos
-  {
+  enum Bit_pos {
     // indications for the Envelope algorithm
     // relation between halfedge and incident face
     IS_EQUAL_FACE   = 0,
@@ -448,8 +355,9 @@ Envelope_pm_halfedge : public CGAL::Arr_halfedge_base<X_monotone_curve_2>,
   };
 
 public:
-  Envelope_pm_halfedge() : Dcel_info<Data>(), flags(0)
-  {}
+  using Base_info = Dcel_info<Halfedge_data>;
+
+  Envelope_pm_halfedge() : Dcel_info<Halfedge_data>(), flags(0) {}
 
  /* void set_is_fake(bool b)
   {
@@ -460,102 +368,64 @@ Envelope_pm_halfedge : public CGAL::Arr_halfedge_base<X_monotone_curve_2>,
     return get_bit(IS_FAKE);
   }*/
 
-  void set_is_equal_data_in_face(bool b)
-  {
-    set_bit(IS_EQUAL_FACE, b);
-  }
-  bool get_is_equal_data_in_face() const
-  {
-    return get_bit(IS_EQUAL_FACE);
-  }
+  void set_is_equal_data_in_face(bool b) { set_bit(IS_EQUAL_FACE, b); }
+  bool get_is_equal_data_in_face() const { return get_bit(IS_EQUAL_FACE); }
 
-  void set_has_equal_data_in_face(bool b)
-  {
-    set_bit(HAS_EQUAL_FACE, b);
-  }
-  bool get_has_equal_data_in_face() const
-  {
-    return get_bit(HAS_EQUAL_FACE);
-  }
+  void set_has_equal_data_in_face(bool b) { set_bit(HAS_EQUAL_FACE, b); }
+  bool get_has_equal_data_in_face() const { return get_bit(HAS_EQUAL_FACE); }
 
-  void set_is_equal_aux_data_in_face(unsigned int id, bool b)
-  {
+  void set_is_equal_aux_data_in_face(unsigned int id, bool b) {
     CGAL_assertion(id < 2);
     set_bit(IS_EQUAL_AUX_FACE+id, b);
   }
-  bool get_is_equal_aux_data_in_face(unsigned int id) const
-  {
+  bool get_is_equal_aux_data_in_face(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(IS_EQUAL_AUX_FACE+id);
   }
 
-  void set_has_equal_aux_data_in_face(unsigned int id, bool b)
-  {
+  void set_has_equal_aux_data_in_face(unsigned int id, bool b) {
     CGAL_assertion(id < 2);
     set_bit(HAS_EQUAL_AUX_FACE+id, b);
   }
-  bool get_has_equal_aux_data_in_face(unsigned int id) const
-  {
+  bool get_has_equal_aux_data_in_face(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(HAS_EQUAL_AUX_FACE+id);
   }
 
-  void set_is_equal_data_in_target(bool b)
-  {
-    set_bit(IS_EQUAL_TARGET, b);
-  }
-  bool get_is_equal_data_in_target() const
-  {
-    return get_bit(IS_EQUAL_TARGET);
-  }
+  void set_is_equal_data_in_target(bool b) { set_bit(IS_EQUAL_TARGET, b); }
+  bool get_is_equal_data_in_target() const { return get_bit(IS_EQUAL_TARGET); }
 
-  void set_has_equal_data_in_target(bool b)
-  {
-    set_bit(HAS_EQUAL_TARGET, b);
-  }
-  bool get_has_equal_data_in_target() const
-  {
-    return get_bit(HAS_EQUAL_TARGET);
-  }
+  void set_has_equal_data_in_target(bool b) { set_bit(HAS_EQUAL_TARGET, b); }
+  bool get_has_equal_data_in_target() const { return get_bit(HAS_EQUAL_TARGET); }
 
-  void set_is_equal_aux_data_in_target(unsigned int id, bool b)
-  {
+  void set_is_equal_aux_data_in_target(unsigned int id, bool b) {
     CGAL_assertion(id < 2);
     set_bit(IS_EQUAL_AUX_TARGET+id, b);
   }
-  bool get_is_equal_aux_data_in_target(unsigned int id) const
-  {
+  bool get_is_equal_aux_data_in_target(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(IS_EQUAL_AUX_TARGET+id);
   }
 
-  void set_has_equal_aux_data_in_target(unsigned int id, bool b)
-  {
+  void set_has_equal_aux_data_in_target(unsigned int id, bool b) {
     CGAL_assertion(id < 2);
     set_bit(HAS_EQUAL_AUX_TARGET+id, b);
   }
-  bool get_has_equal_aux_data_in_target(unsigned int id) const
-  {
+  bool get_has_equal_aux_data_in_target(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(HAS_EQUAL_AUX_TARGET+id);
   }
   // access to flags that contain relation between target and face
   void set_has_equal_data_in_target_and_face(bool b)
-  {
-    set_bit(HAS_EQUAL_F_T, b);
-  }
+  { set_bit(HAS_EQUAL_F_T, b); }
   bool get_has_equal_data_in_target_and_face() const
-  {
-    return get_bit(HAS_EQUAL_F_T);
-  }
+  { return get_bit(HAS_EQUAL_F_T); }
 
-  void set_has_equal_aux_data_in_target_and_face(unsigned int id, bool b)
-  {
+  void set_has_equal_aux_data_in_target_and_face(unsigned int id, bool b) {
     CGAL_assertion(id < 2);
     set_bit(HAS_EQUAL_AUX_F_T+id, b);
   }
-  bool get_has_equal_aux_data_in_target_and_face(unsigned int id) const
-  {
+  bool get_has_equal_aux_data_in_target_and_face(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(HAS_EQUAL_AUX_F_T+id);
   }
@@ -563,8 +433,7 @@ Envelope_pm_halfedge : public CGAL::Arr_halfedge_base<X_monotone_curve_2>,
   /*! Assign from another halfedge.
    * \param h the other halfedge.
    */
-  virtual void assign(const Base_halfedge & h)
-  {
+  virtual void assign(const Base_halfedge& h) {
     Base_halfedge::assign(h);
 
     const Self & ex_h = static_cast<const Self&>(h);
@@ -573,99 +442,93 @@ Envelope_pm_halfedge : public CGAL::Arr_halfedge_base<X_monotone_curve_2>,
   }
 
 protected:
-  void set_bit(unsigned int ind, bool b)
-  {
-    if (b)
-      // set bit "ind" to 1:
-      flags |= (1 << ind);
-    else
-      // set bit "ind" to 0:
-      flags &= ~(1 << ind);
+  void set_bit(unsigned int ind, bool b) {
+    if (b) flags |= (1 << ind);
+    else flags &= ~(1 << ind);
     CGAL_assertion(get_bit(ind) == b);
   }
 
-  bool get_bit(unsigned int ind) const
-  {
+  bool get_bit(unsigned int ind) const {
     // (1 << i) is bit i on, other bits off (start counting from 0)
     unsigned int mask = 1 << ind;
     return ((flags & mask) == mask);
   }
 };
 
-/*! Extend the planar-map face */
-template <class Data>
-class Envelope_pm_face : public CGAL::Arr_face_base,
-                         public Dcel_info<Data>
-{
-  typedef CGAL::Arr_face_base       Base_face;
-  typedef Dcel_info<Data>           Base_info;
-  typedef Envelope_pm_face<Data>    Self;
+  //! Extend the planar-map face.
+template <typename BaseFace, typename FaceData>
+class Envelope_pm_face : public BaseFace, public Dcel_info<FaceData> {
+public:
+  using Base_face = BaseFace;
+  using Face_data = FaceData;
+
+private:
+  using Self = Envelope_pm_face<Base_face, Face_data>;
 
 public:
-  typedef std::list<Data>                         Data_container;
-  typedef typename Data_container::iterator       Data_iterator;
-  typedef typename Data_container::const_iterator Data_const_iterator;
+  using Base_info = Dcel_info<Face_data>;
+  using Data_container = std::list<Face_data>;
+  using Data_iterator = typename Data_container::iterator;
+  using Data_const_iterator = typename Data_container::const_iterator;
 
-  /*! Constructor */
-  Envelope_pm_face() : Dcel_info<Data>()
-  {}
+  /*! Construct.
+   */
+  Envelope_pm_face() : Dcel_info<Face_data>() {}
 
   /*! Assign from another face.
    * \param f the other face.
    */
-  virtual void assign (const Base_face & f)
-  {
+  virtual void assign(const Base_face& f) {
     Base_face::assign(f);
 
-    const Self & ex_f = static_cast<const Self&>(f);
+    const Self& ex_f = static_cast<const Self&>(f);
     this->Base_info::operator=(ex_f);
   }
 };
 
 /*! A new dcel builder with full Envelope features */
-template <class Traits, class Data>
-class Envelope_pm_dcel : public
-CGAL::Arr_dcel_base<Envelope_pm_vertex<typename Traits::Point_2, Data>,
-                    Envelope_pm_halfedge<typename Traits::X_monotone_curve_2,
-                                         Data>,
-                    Envelope_pm_face<Data> >
-{
+template <typename Traits_, typename DcelData,
+          typename VertexBase = Arr_vertex_base<typename Traits_::Point_2>,
+          typename HalfedgeBase =
+            Arr_halfedge_base<typename Traits_::X_monotone_curve_2>,
+          typename FaceBase = Arr_face_base>
+class Envelope_pm_dcel :
+  public CGAL::Arr_dcel_base<Envelope_pm_vertex<VertexBase, DcelData>,
+                             Envelope_pm_halfedge<HalfedgeBase, DcelData>,
+                             Envelope_pm_face<FaceBase, DcelData>> {
 public:
+  using Dcel_data = DcelData;
+  using Face_base = FaceBase;
 
-  typedef Data                                    Face_data;
-  typedef typename Envelope_pm_face<Data>::Data_iterator
-                                                  Face_data_iterator;
-  typedef typename Envelope_pm_face<Data>::Data_const_iterator
-                                                  Face_data_const_iterator;
-
-  typedef Data                                    Edge_data;
-  typedef Face_data_iterator                      Edge_data_iterator;
-  typedef Face_data_const_iterator                Edge_data_const_iterator;
+  using Face_data = Dcel_data;
+  using Env_pm_face = Envelope_pm_face<Face_base, Dcel_data>;
+  using Face_data_iterator = typename Env_pm_face::Data_iterator;
+  using Face_data_const_iterator = typename Env_pm_face::Data_const_iterator;
 
-  typedef Data                                    Vertex_data;
-  typedef Face_data_iterator                      Vertex_data_iterator;
-  typedef Face_data_const_iterator                Vertex_data_const_iterator;
+  using Edge_data = Dcel_data;
+  using Edge_data_iterator = Face_data_iterator;
+  using Edge_data_const_iterator = Face_data_const_iterator;
 
-  typedef Dcel_info<Data>                         Dcel_elem_with_data;
+  using Vertex_data = Dcel_data;
+  using Vertex_data_iterator = Face_data_iterator;
+  using Vertex_data_const_iterator = Face_data_const_iterator;
 
-  typedef Data                                    Dcel_data;
-  typedef Face_data_iterator                      Dcel_data_iterator;
-  typedef Face_data_const_iterator                Dcel_data_const_iterator;
+  using Dcel_elem_with_data = Dcel_info<Dcel_data>;
+  using Dcel_data_iterator = Face_data_iterator;
+  using Dcel_data_const_iterator = Face_data_const_iterator;
 
   /*! \struct
    * An auxiliary structure for rebinding the DCEL with a new traits class.
    */
   template<typename T>
-  struct rebind
-  {
-    typedef Envelope_pm_dcel<T, Face_data> other;
-  };
+  struct rebind { typedef Envelope_pm_dcel<T, Face_data> other; };
 
   /*! Constructor */
   Envelope_pm_dcel() {}
 };
 
 } // namespace Envelope_3
+
 } // namespace CGAL
 
 #endif

From b25a697fd614d3806cf38ef18089474188c17ee6 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 30 Jan 2024 00:59:19 +0200
Subject: [PATCH 1320/1398] Replaced get_data() and set_data() with
 get_env_data() and set_env_data() to avoid clashes with other extensions of
 the Dcel;

---
 .../Envelope_divide_and_conquer_3.h           |  670 ++++-------
 .../Envelope_3/Envelope_element_visitor_3.h   | 1013 +++++++----------
 .../CGAL/Envelope_3/Envelope_overlay_2.h      |  132 +--
 Envelope_3/test/Envelope_3/Envelope_test_3.h  |  378 +++---
 .../Envelope_test_overlay_functor.h           |  100 +-
 .../Envelope_3/Envelope_triangles_test_3.h    |  305 ++---
 6 files changed, 1015 insertions(+), 1583 deletions(-)

diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
index 2934d17f189a..2bc19cf65c70 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
@@ -7,9 +7,9 @@
 // $Id$
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
-//                 Baruch Zukerman        <baruchzu@post.tau.ac.il>
-//                 Efi Fogel              <efif@post.tau.ac.il>
+// Author(s) : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+//             Baruch Zukerman        <baruchzu@post.tau.ac.il>
+//             Efi Fogel              <efif@post.tau.ac.il>
 
 #ifndef CGAL_ENVELOPE_DIVIDE_AND_CONQUER_3_H
 #define CGAL_ENVELOPE_DIVIDE_AND_CONQUER_3_H
@@ -82,71 +82,48 @@ namespace CGAL {
 //                              of the arrangement
 // 4. Overlay_2               - overlay of 2 MinimizationDiagram_2
 
-template <class EnvelopeTraits_3,
-          class MinimizationDiagram_2,
-          class EnvelopeResolver_3 =
+template <typename EnvelopeTraits_3,
+          typename MinimizationDiagram_2,
+          typename EnvelopeResolver_3 =
             Envelope_element_visitor_3<EnvelopeTraits_3, MinimizationDiagram_2>,
-          class Overlay_2 = Envelope_overlay_2<MinimizationDiagram_2> >
-class Envelope_divide_and_conquer_3
-{
+          typename Overlay_2 = Envelope_overlay_2<MinimizationDiagram_2> >
+class Envelope_divide_and_conquer_3 {
 public:
-  typedef EnvelopeTraits_3                              Traits;
-  typedef typename Traits::Surface_3                    Surface_3;
-  typedef typename Traits::Xy_monotone_surface_3        Xy_monotone_surface_3;
+  using Traits = EnvelopeTraits_3;
+  using Surface_3 = typename Traits::Surface_3;
+  using Xy_monotone_surface_3 = typename Traits::Xy_monotone_surface_3;
 
-  typedef MinimizationDiagram_2                         Minimization_diagram_2;
+  using Minimization_diagram_2 = MinimizationDiagram_2;
 
-  typedef typename Traits::Point_2                      Point_2;
-  typedef typename Traits::X_monotone_curve_2           X_monotone_curve_2;
-  typedef typename Traits::Curve_2                      Curve_2;
+  using Point_2 = typename Traits::Point_2;
+  using X_monotone_curve_2 = typename Traits::X_monotone_curve_2;
+  using Curve_2 = typename Traits::Curve_2;
 
-  typedef EnvelopeResolver_3                            Envelope_resolver;
+  using Envelope_resolver = EnvelopeResolver_3;
 
-  typedef Envelope_divide_and_conquer_3<Traits, Minimization_diagram_2,
-                                        EnvelopeResolver_3,
-                                        Overlay_2>      Self;
+  using Self = Envelope_divide_and_conquer_3<Traits, Minimization_diagram_2,
+                                             Envelope_resolver, Overlay_2>;
 
 protected:
-
-  typedef typename Minimization_diagram_2::Halfedge_const_iterator
-    Halfedge_const_iterator;
-  typedef typename Minimization_diagram_2::Halfedge_handle
-    Halfedge_handle;
-  typedef typename Minimization_diagram_2::Halfedge_iterator
-    Halfedge_iterator;
-  typedef typename Minimization_diagram_2::Face_handle
-    Face_handle;
-  typedef typename Minimization_diagram_2::Edge_iterator
-    Edge_iterator;
-  typedef typename Minimization_diagram_2::Face_iterator
-    Face_iterator;
-  typedef typename Minimization_diagram_2::Vertex_handle
-    Vertex_handle;
-  typedef typename Minimization_diagram_2::Vertex_iterator
-    Vertex_iterator;
-  typedef typename Minimization_diagram_2::Ccb_halfedge_circulator
-    Ccb_halfedge_circulator;
-  typedef typename Minimization_diagram_2::Halfedge_around_vertex_circulator
-    Halfedge_around_vertex_circulator;
-  typedef typename Minimization_diagram_2::Outer_ccb_iterator
-    Outer_ccb_iterator;
-  typedef typename Minimization_diagram_2::Inner_ccb_iterator
-    Inner_ccb_iterator;
-
-  typedef typename Minimization_diagram_2::Observer
-    Md_observer;
-  typedef typename Minimization_diagram_2::Dcel::Dcel_data_iterator
-    Envelope_data_iterator;
+  using Vertex_handle = typename Minimization_diagram_2::Vertex_handle;
+  using Halfedge_handle = typename Minimization_diagram_2::Halfedge_handle;
+  using Face_handle = typename Minimization_diagram_2::Face_handle;
+  using Ccb_halfedge_circulator =
+    typename Minimization_diagram_2::Ccb_halfedge_circulator;
+  using Halfedge_around_vertex_circulator =
+    typename Minimization_diagram_2::Halfedge_around_vertex_circulator;
+
+  using Md_observer = typename Minimization_diagram_2::Observer;
+  using Face = typename Minimization_diagram_2::Face;
+  using Envelope_data_iterator = typename Face::Data_iterator;
 
 #ifdef CGAL_ENVELOPE_USE_BFS_FACE_ORDER
-  typedef CGAL::Dual<Minimization_diagram_2>
-    Dual_Minimization_diagram_2;
+  using Dual_Minimization_diagram_2 = CGAL::Dual<Minimization_diagram_2>;
 #endif
 
 public:
   // c'tor
-  Envelope_divide_and_conquer_3(Envelope_type type = ENVELOPE_LOWER)
-  {
+  Envelope_divide_and_conquer_3(Envelope_type type = ENVELOPE_LOWER) {
     // Allocate the traits.
     m_geom_traits = new Traits;
     m_own_traits = true;
@@ -158,8 +135,7 @@ class Envelope_divide_and_conquer_3
   }
 
   Envelope_divide_and_conquer_3(const Traits* geom_traits,
-                                Envelope_type type = ENVELOPE_LOWER)
-  {
+                                Envelope_type type = ENVELOPE_LOWER) {
     // Set the traits.
     m_geom_traits = geom_traits;
     m_own_traits = false;
@@ -171,11 +147,9 @@ class Envelope_divide_and_conquer_3
   }
 
   // virtual destructor.
-  virtual ~Envelope_divide_and_conquer_3()
-  {
+  virtual ~Envelope_divide_and_conquer_3() {
     // Free the traits object, if necessary.
-    if (m_own_traits)
-      delete m_geom_traits;
+    if (m_own_traits) delete m_geom_traits;
 
     // Free the resolver
     delete resolver;
@@ -183,25 +157,20 @@ class Envelope_divide_and_conquer_3
 
   // compute the envelope of surfaces in 3D, using the default arbitrary
   // divider
-  template <class SurfaceIterator>
+  template <typename SurfaceIterator>
   void construct_lu_envelope(SurfaceIterator begin, SurfaceIterator end,
-                             Minimization_diagram_2& result)
-  {
+                             Minimization_diagram_2& result) {
     Envelope_3::Arbitrary_dividor dividor;
     construct_lu_envelope(begin, end, result, dividor);
   }
 
 
   // compute the envelope of surfaces in 3D using the given set divider
-  template <class SurfaceIterator, class SetDividor>
+  template <typename SurfaceIterator, typename SetDividor>
   void construct_lu_envelope(SurfaceIterator begin, SurfaceIterator end,
                              Minimization_diagram_2& result,
-                             SetDividor& dividor)
-  {
-    if (begin == end)
-    {
-      return; // result is empty
-    }
+                             SetDividor& dividor) {
+    if (begin == end) return; // result is empty
 
     // make the general surfaces xy-monotone
     std::list<Xy_monotone_surface_3> xy_monotones;
@@ -219,25 +188,22 @@ class Envelope_divide_and_conquer_3
 
   // compute the envelope of xy-monotone surfaces in 3D,
   // using the default arbitrary divider
-  template <class SurfaceIterator>
+  template <typename SurfaceIterator>
   void construct_envelope_xy_monotone(SurfaceIterator begin,
                                       SurfaceIterator end,
-                                      Minimization_diagram_2& result)
-  {
+                                      Minimization_diagram_2& result) {
     Envelope_3::Arbitrary_dividor dividor;
     construct_envelope_xy_monotone(begin, end, result, dividor);
   }
 
   // compute the envelope of xy-monotone surfaces in 3D using the given
   // set divider
-  template <class SurfaceIterator, class SetDividor>
+  template <typename SurfaceIterator, typename SetDividor>
   void construct_envelope_xy_monotone(SurfaceIterator begin,
                                       SurfaceIterator end,
                                       Minimization_diagram_2& result,
-                                      SetDividor& dividor)
-  {
-    if (begin == end)
-      return; // result is empty
+                                      SetDividor& dividor) {
+    if (begin == end) return; // result is empty
 
     // recursively construct the envelope of the xy-monotone parts
     construct_lu_envelope_xy_monotones(begin, end, result, dividor);
@@ -245,36 +211,25 @@ class Envelope_divide_and_conquer_3
   }
 
   /*! Access the traits object. */
-  const Traits* get_traits() const
-  {
-    return m_geom_traits;
-  }
+  const Traits* get_traits() const { return m_geom_traits; }
 
-  void reset()
-  {
-    resolver->reset();
-  }
+  void reset() { resolver->reset(); }
 
 protected:
 
   // compute the envelope of xy-monotone surfaces in 3D
-  template <class SurfaceIterator, class SetDividor>
+  template <typename SurfaceIterator, typename SetDividor>
   void construct_lu_envelope_xy_monotones(SurfaceIterator begin,
                                           SurfaceIterator end,
                                           Minimization_diagram_2& result,
-                                          SetDividor& dividor)
-  {
-    if (begin == end)
-    {
-      return; // result is empty
-    }
+                                          SetDividor& dividor) {
+    if (begin == end) return; // result is empty
 
     SurfaceIterator first = begin++;
 
-    if (begin == end)
-    {
+    if (begin == end) {
       // only one surface is in the collection. insert it the result
-      Xy_monotone_surface_3& surf = *first;
+      const Xy_monotone_surface_3& surf = *first;
 
       deal_with_one_surface(surf, result);
       return;
@@ -303,38 +258,34 @@ class Envelope_divide_and_conquer_3
     CGAL_assertion(is_envelope_valid(result));
   }
 
-  void deal_with_one_surface(Xy_monotone_surface_3& surf,
-                             Minimization_diagram_2& result)
-  {
-    typedef std::pair<X_monotone_curve_2, Oriented_side> Boundary_xcurve;
-    typedef std::list<std::variant<Boundary_xcurve,Point_2>> Boundary_list;
+  void deal_with_one_surface(const Xy_monotone_surface_3& surf,
+                             Minimization_diagram_2& result) {
+    using Boundary_xcurve = std::pair<X_monotone_curve_2, Oriented_side>;
+    using Boundary_list = std::list<std::variant<Boundary_xcurve,Point_2>>;
 
-    Boundary_list     boundary;
+    Boundary_list boundary;
     m_geom_traits->
       construct_projected_boundary_2_object()(surf,
                                               std::back_inserter(boundary));
 
-    if (boundary.empty())
-    {
+    if (boundary.empty()) {
       //one infinite surface
       CGAL_assertion_msg(result.number_of_faces() == 1,
                          "In the beginning there should be only one face");
-      result.faces_begin()->set_data(surf);
+      result.faces_begin()->set_env_data(surf);
       return;
     }
 
     for (auto boundary_it = boundary.begin();
          boundary_it != boundary.end();
-         ++boundary_it)
-    {
-      if (const Boundary_xcurve* boundary_cv = std::get_if<Boundary_xcurve>(&(*boundary_it)))
-      {
+         ++boundary_it) {
+      if (const Boundary_xcurve* boundary_cv =
+          std::get_if<Boundary_xcurve>(&(*boundary_it))) {
         Oriented_side side = boundary_cv->second;
         Halfedge_handle he =
           insert_non_intersecting_curve(result, boundary_cv->first);
 
-        if (side == ON_ORIENTED_BOUNDARY)
-        {
+        if (side == ON_ORIENTED_BOUNDARY) {
           // vertical xy-surface
           he->face()->set_no_data();
           he->twin()->face()->set_no_data();
@@ -342,33 +293,29 @@ class Envelope_divide_and_conquer_3
           continue;
         }
 
-        if (he->face() != he->twin()->face())
-        {
+        if (he->face() != he->twin()->face()) {
           // new face created.
           // 'he' is directed from left to right, so the face to the left
           // of 'he'  is above 'cv.
           Face_handle f;
-          if (side == ON_NEGATIVE_SIDE) // the surface is below cv.
-          {
+          if (side == ON_NEGATIVE_SIDE) { // the surface is below cv.
             f = he->twin()->face();
-            f->set_data(surf);
+            f->set_env_data(surf);
             he->face()->set_no_data();
           }
-          else
-          {
+          else {
             CGAL_assertion(side == ON_POSITIVE_SIDE);
             f = he->face();
-            f->set_data(surf);
+            f->set_env_data(surf);
             he->twin()->face()->set_no_data();
           }
 
           // init auxiliary data for f and its boundaries.
-          for(Outer_ccb_iterator ocit = f->outer_ccbs_begin();
-              ocit != f->outer_ccbs_end(); ocit++){
+          for (auto ocit = f->outer_ccbs_begin(); ocit != f->outer_ccbs_end();
+               ocit++) {
             Ccb_halfedge_circulator face_hec = *ocit;
             Ccb_halfedge_circulator face_hec_begin = face_hec;
-            do
-              {
+            do {
                 face_hec->set_is_equal_data_in_face(true);
                 face_hec->set_has_equal_data_in_face(true);
                 face_hec->set_has_equal_data_in_target_and_face(true);
@@ -381,12 +328,11 @@ class Envelope_divide_and_conquer_3
               }
             while(face_hec != face_hec_begin);
           }
-          for(Outer_ccb_iterator icit = f->inner_ccbs_begin();
-              icit != f->inner_ccbs_end(); icit++){
+          for (auto icit = f->inner_ccbs_begin(); icit != f->inner_ccbs_end();
+               icit++) {
             Ccb_halfedge_circulator face_hec = *icit;
             Ccb_halfedge_circulator face_hec_begin = face_hec;
-            do
-              {
+            do {
                 face_hec->set_is_equal_data_in_face(true);
                 face_hec->set_has_equal_data_in_face(true);
                 face_hec->set_has_equal_data_in_target_and_face(true);
@@ -401,8 +347,7 @@ class Envelope_divide_and_conquer_3
           }
         }
       }
-      else
-      {
+      else {
         // the xy-surface is an isolated point
         const Point_2* p = std::get_if<Point_2>(&(*boundary_it));
         CGAL_assertion(p!=nullptr);
@@ -412,10 +357,9 @@ class Envelope_divide_and_conquer_3
 
     // update information in all the edges & vertices to indicate that
     // this surface is the envelope
-    Halfedge_iterator hi = result.halfedges_begin();
-    for (; hi != result.halfedges_end(); ++hi)
+    for (auto hi = result.halfedges_begin(); hi != result.halfedges_end(); ++hi)
     {
-      hi->set_data(surf);
+      hi->set_env_data(surf);
       // since all the edges & vertices have their envelope data equal to the
       // current surface, we can set is/has equal_data_in_target of all
       // halfedges to true
@@ -423,12 +367,9 @@ class Envelope_divide_and_conquer_3
       hi->set_has_equal_data_in_target(true);
     }
 
-    Vertex_iterator vi = result.vertices_begin();
-    for (; vi != result.vertices_end(); ++vi)
-    {
-      vi->set_data(surf);
-      if (vi->is_isolated())
-      {
+    for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
+      vi->set_env_data(surf);
+      if (vi->is_isolated()) {
         // update the is/has equal_data_in_face flags according to the face data
         bool equal_data = !vi->face()->has_no_data();
         vi->set_is_equal_data_in_face(equal_data);
@@ -441,8 +382,7 @@ class Envelope_divide_and_conquer_3
 public:
   void merge_envelopes(Minimization_diagram_2& result1,
                        Minimization_diagram_2& result2,
-                       Minimization_diagram_2& result)
-  {
+                       Minimization_diagram_2& result) {
     // overlay the 2 arrangements
 
     Overlay_2 overlay;
@@ -465,25 +405,20 @@ class Envelope_divide_and_conquer_3
     // compute the surface on the envelope for each edge
     // edge can be split as surfaces can intersect (or touch) over it
     std::list<Halfedge_handle> edges_to_resolve;
-    Edge_iterator ei = result.edges_begin();
-    for (; ei != result.edges_end(); ++ei)
-    {
+    for (auto ei = result.edges_begin(); ei != result.edges_end(); ++ei) {
       Halfedge_handle hh = ei;
       // there must be data from at least one map, because all the surfaces
       // are continuous
-      if (!get_aux_is_set(hh, 0) || !get_aux_is_set(hh, 1))
-        continue;
+      if (!get_aux_is_set(hh, 0) || !get_aux_is_set(hh, 1)) continue;
       CGAL_assertion(get_aux_is_set(hh, 0));
       CGAL_assertion(get_aux_is_set(hh, 1));
       CGAL_assertion(!aux_has_no_data(hh, 1) || !aux_has_no_data(hh, 0));
-      if (aux_has_no_data(hh, 0) && !aux_has_no_data(hh, 1))
-      {
+      if (aux_has_no_data(hh, 0) && !aux_has_no_data(hh, 1)) {
         hh->set_decision(DAC_DECISION_SECOND);
         hh->twin()->set_decision(DAC_DECISION_SECOND);
         continue;
       }
-      else if (!aux_has_no_data(hh, 0) && aux_has_no_data(hh, 1))
-      {
+      else if (!aux_has_no_data(hh, 0) && aux_has_no_data(hh, 1)) {
         hh->set_decision(DAC_DECISION_FIRST);
         hh->twin()->set_decision(DAC_DECISION_FIRST);
         continue;
@@ -506,12 +441,8 @@ class Envelope_divide_and_conquer_3
         edges_to_resolve.push_back(hh);
     }
     // now deal with the edges
-    typename std::list<Halfedge_handle>::iterator li;
-    for (li = edges_to_resolve.begin(); li != edges_to_resolve.end(); ++li)
-    {
+    for (auto li = edges_to_resolve.begin(); li != edges_to_resolve.end(); ++li)
       resolver->resolve(*li, result);
-
-    }
     edges_to_resolve.clear();
 
     // decompose the result, to have faces without holes
@@ -547,25 +478,20 @@ class Envelope_divide_and_conquer_3
     index_map.detach();
 #else
     // traverse the faces in arbitrary order
-    Face_iterator fi = result.faces_begin();
-    for (; fi != result.faces_end(); ++fi)
-    {
+    for (auto fi = result.faces_begin(); fi != result.faces_end(); ++fi) {
       Face_handle fh = fi;
         // if a surface of one map doesn't exist, then we set the second surface
-        if (aux_has_no_data(fh, 0) && !aux_has_no_data(fh, 1))
-        {
+        if (aux_has_no_data(fh, 0) && !aux_has_no_data(fh, 1)) {
           fh->set_decision(DAC_DECISION_SECOND);
           continue;
         }
-        else if (aux_has_no_data(fh, 0) && aux_has_no_data(fh, 1))
-        {
+        else if (aux_has_no_data(fh, 0) && aux_has_no_data(fh, 1)) {
           fh->set_decision(EQUAL);
           fh->set_no_data();
 
           continue;
         }
-        else if (!aux_has_no_data(fh, 0) && aux_has_no_data(fh, 1))
-        {
+        else if (!aux_has_no_data(fh, 0) && aux_has_no_data(fh, 1)) {
           fh->set_decision(DAC_DECISION_FIRST);
           continue;
         }
@@ -592,9 +518,7 @@ class Envelope_divide_and_conquer_3
     edge_observer.detach();
 
     // compute the surface on the envelope for each vertex
-    Vertex_iterator vi = result.vertices_begin();
-    for (; vi != result.vertices_end(); ++vi)
-    {
+    for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
       if (vh->is_decision_set())
         continue;
@@ -603,13 +527,11 @@ class Envelope_divide_and_conquer_3
       CGAL_assertion(get_aux_is_set(vh, 0));
       CGAL_assertion(get_aux_is_set(vh, 1));
       CGAL_assertion(!aux_has_no_data(vh, 1) || !aux_has_no_data(vh, 0));
-      if (aux_has_no_data(vh, 0) && !aux_has_no_data(vh, 1))
-      {
+      if (aux_has_no_data(vh, 0) && !aux_has_no_data(vh, 1)) {
         vh->set_decision(DAC_DECISION_SECOND);
         continue;
       }
-      else if (!aux_has_no_data(vh, 0) && aux_has_no_data(vh, 1))
-      {
+      else if (!aux_has_no_data(vh, 0) && aux_has_no_data(vh, 1)) {
         vh->set_decision(DAC_DECISION_FIRST);
         continue;
       }
@@ -659,39 +581,32 @@ class Envelope_divide_and_conquer_3
 protected:
 
   void deal_with_faces_to_split(std::list<Face_handle>& faces_to_split,
-                                Minimization_diagram_2& result)
-  {
+                                Minimization_diagram_2& result) {
     // for each face in faces_to_split, find the intersection over the face,
     // and split the face
-    typename std::list<Face_handle>::iterator li;
-    for (li = faces_to_split.begin(); li != faces_to_split.end(); ++li)
+    for (auto li = faces_to_split.begin(); li != faces_to_split.end(); ++li)
       resolver->resolve(*li, result);
     faces_to_split.clear();
   }
 
-  template <class InputIterator>
-  bool is_equal_data(const InputIterator& begin1,
-                     const InputIterator& end1,
-                     const InputIterator& begin2,
-                     const InputIterator& end2)
-  {
+  template <typename InputIterator>
+  bool is_equal_data(const InputIterator& begin1, const InputIterator& end1,
+                     const InputIterator& begin2, const InputIterator& end2) {
     // insert the input data objects into a set
     std::set<Xy_monotone_surface_3> first(begin1, end1);
     std::set<Xy_monotone_surface_3> second(begin2, end2);
 
-    if (first.size() != second.size())
-      return false;
+    if (first.size() != second.size()) return false;
 
     return (first == second);
   }
 
   // todo: should remove the uses of this method from this class
-  template <class InputIterator>
+  template <typename InputIterator>
   bool has_equal_data(const InputIterator& begin1,
                       const InputIterator& end1,
                       const InputIterator& begin2,
-                      const InputIterator& end2)
-  {
+                      const InputIterator& end2) {
     // insert the input data objects into a set
     std::set<Xy_monotone_surface_3> first(begin1, end1);
     std::set<Xy_monotone_surface_3> second(begin2, end2);
@@ -702,11 +617,11 @@ class Envelope_divide_and_conquer_3
     return (intersection.size() > 0);
     return true;
   }
+
   // todo: should remove the uses of this method from this class
-  template <class FeatureHandle1, class FeatureHandle2>
+  template <typename FeatureHandle1, typename FeatureHandle2>
   bool has_equal_aux_data(unsigned int id, FeatureHandle1 fh1,
-                          FeatureHandle2 fh2)
-  {
+                          FeatureHandle2 fh2) {
     Envelope_data_iterator begin1, end1, begin2, end2;
     get_aux_data_iterators(id, fh1, begin1, end1);
     get_aux_data_iterators(id, fh2, begin2, end2);
@@ -716,22 +631,17 @@ class Envelope_divide_and_conquer_3
 
   // Remove unnecessary edges, between faces with the same surface
   // (and which are not degenerate)
-  void remove_unnecessary_edges(Minimization_diagram_2& result)
-  {
+  void remove_unnecessary_edges(Minimization_diagram_2& result) {
     // collect all those edges in this list, and remove them all at the end
     // (thus, not destroying the iterator)
     std::list<Halfedge_handle> edges;
-    Halfedge_iterator hi = result.halfedges_begin();
-    for (; hi != result.halfedges_end(); ++hi, ++hi)
-    {
+    for (auto hi = result.halfedges_begin(); hi != result.halfedges_end();
+         ++hi, ++hi) {
       Halfedge_handle hh = hi;
-      if (can_remove_edge(hh))
-        edges.push_back(hh);
+      if (can_remove_edge(hh)) edges.push_back(hh);
     }
 
-    for (typename std::list<Halfedge_handle>::iterator ci = edges.begin();
-         ci != edges.end(); ++ci)
-    {
+    for (auto  ci = edges.begin(); ci != edges.end(); ++ci) {
       // if the endpoints become isolated after the removal we need to remove
       // them if they have the same data as the edge
       Halfedge_handle h = *ci;
@@ -796,11 +706,10 @@ class Envelope_divide_and_conquer_3
     }
   }
 
-  template <class FeatureHandle>
+  template <typename FeatureHandle>
   void get_aux_data_iterators(unsigned int id, FeatureHandle fh,
                               Envelope_data_iterator& begin,
-                              Envelope_data_iterator& end)
-  {
+                              Envelope_data_iterator& end) {
     Halfedge_handle h;
     Vertex_handle v;
     Face_handle f;
@@ -815,18 +724,15 @@ class Envelope_divide_and_conquer_3
     // this is why we start with a check for a face, then halfedge
     // and last vertex
 
-    if (assign(f, o))
-    {
+    if (assign(f, o)) {
       begin = f->begin_data();
       end = f->end_data();
     }
-    else if (assign(h, o))
-    {
+    else if (assign(h, o)) {
       begin = h->begin_data();
       end = h->end_data();
     }
-    else
-    {
+    else {
       CGAL_assertion_code(bool b = )
       assign(v, o);
       CGAL_assertion(b);
@@ -839,8 +745,7 @@ class Envelope_divide_and_conquer_3
   // this can be done if the envelope surfaces on the edge are the same as
   // the envelope surfaces on both sides of the edge
   // (or if the edge is fake, i.e. created in the vd process)
-  bool can_remove_edge(Halfedge_handle hh)
-  {
+  bool can_remove_edge(Halfedge_handle hh) {
     Face_handle f1 = hh->face(), f2 = hh->twin()->face();
 
     // we check if the decision done on the edge is equal to the decision
@@ -860,20 +765,16 @@ class Envelope_divide_and_conquer_3
     bool equal_second = (hh->get_is_equal_aux_data_in_face(1) &&
                          hh->twin()->get_is_equal_aux_data_in_face(1));
 
-    if (decision == DAC_DECISION_FIRST)
-      return equal_first;
+    if (decision == DAC_DECISION_FIRST) return equal_first;
 
-    if (decision == DAC_DECISION_SECOND)
-      return equal_second;
+    if (decision == DAC_DECISION_SECOND) return equal_second;
 
     return (equal_first && equal_second);
   }
 
-
   // check if can remove the edge's target if we remove the edge
   // this means that the target has the same envelope information as the edge
-  bool can_remove_edge_target(Halfedge_handle h)
-  {
+  bool can_remove_edge_target(Halfedge_handle h) {
     // \todo Use new design
     /* The code below uses the is_at_open_boundary.
        The comment from the calling function says:
@@ -886,29 +787,23 @@ class Envelope_divide_and_conquer_3
        if ((v->parameter_space_in_x() != ARR_INTERIOR) ||
           (v->parameter_space_in_y() != ARR_INTERIOR))
           return false;
-
      */
-    Vertex_handle v = h->target();
-    if (v->is_at_open_boundary())
-      return false;
-
-
-    /*if (v->get_is_fake() && !v->is_decision_set())
-      return true;
 
+    Vertex_handle v = h->target();
+    if (v->is_at_open_boundary()) return false;
 
-    if (h->get_is_fake() && !h->is_decision_set())
-    {
-      h->set_decision(h->face()->get_decision());
-      h->twin()->set_decision(h->get_decision());
-    }*/
+    /* if (v->get_is_fake() && !v->is_decision_set()) return true;
+     * if (h->get_is_fake() && !h->is_decision_set()) {
+     *   h->set_decision(h->face()->get_decision());
+     *   h->twin()->set_decision(h->get_decision());
+     * }
+     */
     CGAL_assertion(v->is_decision_set());
     CGAL_assertion(h->is_decision_set());
 
     // if the decision done on the vertex and edge are different,
     // the envelope differs too.
-    if (h->get_decision() != v->get_decision())
-      return false;
+    if (h->get_decision() != v->get_decision()) return false;
 
     // now, check the equality of the surfaces list according to the decision
 
@@ -916,11 +811,9 @@ class Envelope_divide_and_conquer_3
     bool equal_first = (h->get_is_equal_aux_data_in_target(0));
     bool equal_second = (h->get_is_equal_aux_data_in_target(1));
 
-    if (decision == DAC_DECISION_FIRST)
-      return equal_first;
+    if (decision == DAC_DECISION_FIRST) return equal_first;
 
-    if (decision == DAC_DECISION_SECOND)
-      return equal_second;
+    if (decision == DAC_DECISION_SECOND) return equal_second;
 
     return (equal_first && equal_second);
   }
@@ -928,14 +821,12 @@ class Envelope_divide_and_conquer_3
   // check if we can remove an isolated vertex from the envelope
   // this can be done if the envelope surfaces on the vertex are the same as
   // the envelope surfaces on its incident face
-  bool can_remove_isolated_vertex(Vertex_handle vh)
-  {
+  bool can_remove_isolated_vertex(Vertex_handle vh) {
     Face_handle f = vh->face();
     CGAL_assertion(vh->is_decision_set() && f->is_decision_set());
     // if the decision done on the vertex and face are different,
     // the envelope differs too.
-    if (vh->get_decision() != f->get_decision())
-      return false;
+    if (vh->get_decision() != f->get_decision()) return false;
 
     // now, check the equality of the surfaces list according to the decision
     CGAL::Dac_decision decision = vh->get_decision();
@@ -943,11 +834,9 @@ class Envelope_divide_and_conquer_3
     bool equal_first = (vh->get_is_equal_aux_data_in_face(0));
     bool equal_second = (vh->get_is_equal_aux_data_in_face(1));
 
-    if (decision == DAC_DECISION_FIRST)
-      return equal_first;
+    if (decision == DAC_DECISION_FIRST) return equal_first;
 
-    if (decision == DAC_DECISION_SECOND)
-      return equal_second;
+    if (decision == DAC_DECISION_SECOND) return equal_second;
 
     return (equal_first && equal_second);
   }
@@ -957,8 +846,7 @@ class Envelope_divide_and_conquer_3
   // the geometric point of view (i.e. if the curves can merge)
   // this can be done if the envelope surfaces on the vertex are the same as
   // the envelope surfaces on its 2 incident halfedges
-  bool combinatorically_can_remove_vertex(Vertex_handle vh)
-  {
+  bool combinatorically_can_remove_vertex(Vertex_handle vh) {
     Halfedge_around_vertex_circulator hec1 = vh->incident_halfedges();
     Halfedge_around_vertex_circulator hec2 = hec1++;
     Halfedge_handle he1 = hec1, he2 = hec2;
@@ -986,11 +874,9 @@ class Envelope_divide_and_conquer_3
     bool equal_second = (he1->get_is_equal_aux_data_in_target(1) &&
                          he2->get_is_equal_aux_data_in_target(1));
 
-    if (decision == DAC_DECISION_FIRST)
-      return equal_first;
+    if (decision == DAC_DECISION_FIRST) return equal_first;
 
-    if (decision == DAC_DECISION_SECOND)
-      return equal_second;
+    if (decision == DAC_DECISION_SECOND) return equal_second;
 
     return (equal_first && equal_second);
   }
@@ -998,8 +884,7 @@ class Envelope_divide_and_conquer_3
   // Remove unnecessary vertices, which have degree 2, and the 2 curves
   // can be merged
   // (and which are not degenerate)
-  void remove_unnecessary_vertices(Minimization_diagram_2& result)
-  {
+  void remove_unnecessary_vertices(Minimization_diagram_2& result) {
     // we have 2 types of unnecessary vertices: those with degree 2 (that
     // satisfy all the conditions below), and isolated vertices that have the
     // same envelope information as the face they're contained in.
@@ -1017,9 +902,7 @@ class Envelope_divide_and_conquer_3
     std::list<Vertex_handle> candidates_to_remove;
     std::list<Vertex_handle> isolated_to_remove;
 
-    Vertex_iterator vi = result.vertices_begin();
-    for (; vi != result.vertices_end(); ++vi)
-    {
+    for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
       if (!vh->is_decision_set() || vh->degree() == 2)
         candidates_to_remove.push_back(vh);
@@ -1027,22 +910,19 @@ class Envelope_divide_and_conquer_3
         isolated_to_remove.push_back(vh);
     }
 
-    typename Traits::Merge_2 curves_merge = m_geom_traits->merge_2_object();
-    typename Traits::Are_mergeable_2 curves_can_merge =
-      m_geom_traits->are_mergeable_2_object();
+    auto curves_merge = m_geom_traits->merge_2_object();
+    auto curves_can_merge = m_geom_traits->are_mergeable_2_object();
 
     // check the candidates and remove if necessary
-    typename std::list<Vertex_handle>::iterator ci;
-    for (ci = candidates_to_remove.begin();
-        ci != candidates_to_remove.end(); ++ci)
+    for (auto ci = candidates_to_remove.begin();
+         ci != candidates_to_remove.end(); ++ci)
     {
       Vertex_handle vh = *ci;
       CGAL_assertion(vh->degree() == 2);
 
       // we can remove this vertex only if the data on its halfedges is the
       // same
-      if (!combinatorically_can_remove_vertex(vh))
-        continue;
+      if (!combinatorically_can_remove_vertex(vh)) continue;
 
       // merge the edges, if geometrically possible (if data on vertex is not
       // set, then it must be geometrically possible)
@@ -1053,8 +933,7 @@ class Envelope_divide_and_conquer_3
 
       const X_monotone_curve_2& a = he1->curve(), b = he2->curve();
       CGAL_assertion(vh->is_decision_set() || curves_can_merge(a,b));
-      if (vh->is_decision_set() && !curves_can_merge(a,b))
-        continue;
+      if (vh->is_decision_set() && !curves_can_merge(a,b)) continue;
 
       X_monotone_curve_2 c;
       curves_merge(a,b,c);
@@ -1108,8 +987,8 @@ class Envelope_divide_and_conquer_3
 
     // remove isolated vertices
 
-    typename std::list<Vertex_handle>::iterator li;
-    for (li = isolated_to_remove.begin(); li != isolated_to_remove.end(); ++li)
+    for (auto li = isolated_to_remove.begin(); li != isolated_to_remove.end();
+         ++li)
     {
       Vertex_handle vh = *li;
       CGAL_assertion(vh->is_isolated());
@@ -1119,57 +998,47 @@ class Envelope_divide_and_conquer_3
     }
   }
 
-  template <class FeatureHandle>
-  void update_envelope_surfaces_by_decision(FeatureHandle fh)
-  {
+  template <typename FeatureHandle>
+  void update_envelope_surfaces_by_decision(FeatureHandle fh) {
     CGAL::Dac_decision decision = fh->get_decision();
 
     Halfedge_handle h;
     Vertex_handle v;
     Face_handle f;
 
-    if (decision == DAC_DECISION_FIRST || decision == DAC_DECISION_BOTH)
-    {
+    if (decision == DAC_DECISION_FIRST || decision == DAC_DECISION_BOTH) {
       Envelope_data_iterator begin, end;
       get_aux_data_iterators(0, fh, begin, end);
-      fh->set_data(begin, end);
+      fh->set_env_data(begin, end);
     }
-    if (decision == DAC_DECISION_SECOND || decision == DAC_DECISION_BOTH)
-    {
+    if (decision == DAC_DECISION_SECOND || decision == DAC_DECISION_BOTH) {
       // copy data from second envelope
       Envelope_data_iterator begin, end;
       get_aux_data_iterators(1, fh, begin, end);
 
-      if (decision == DAC_DECISION_SECOND)
-        fh->set_data(begin, end);
-      else
-        fh->add_data(begin, end);
+      if (decision == DAC_DECISION_SECOND) fh->set_env_data(begin, end);
+      else fh->add_data(begin, end);
     }
   }
 
   // foreach feature of result, update the envelope surfaces, according
   // to the decision done over this feature, and its aux sources
-  void update_envelope_surfaces_by_decision(Minimization_diagram_2& result)
-  {
+  void update_envelope_surfaces_by_decision(Minimization_diagram_2& result) {
     // vertices
-    Vertex_iterator vi = result.vertices_begin();
-    for (; vi != result.vertices_end(); ++vi)
+    for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi)
       update_envelope_surfaces_by_decision(vi);
 
     // edges
-    Halfedge_iterator hi = result.halfedges_begin();
-    for (; hi != result.halfedges_end(); ++hi)
+    for (auto hi = result.halfedges_begin(); hi != result.halfedges_end(); ++hi)
       update_envelope_surfaces_by_decision(hi);
 
     // faces
-    Face_iterator fi = result.faces_begin();
-    for (; fi != result.faces_end(); ++fi)
+    for (auto fi = result.faces_begin(); fi != result.faces_end(); ++fi)
       update_envelope_surfaces_by_decision(fi);
   }
 
   // update the is_equal/has_equal flags of the result envelope
-  void update_edge_face_flags(Halfedge_handle h)
-  {
+  void update_edge_face_flags(Halfedge_handle h) {
     bool is_equal, has_equal;
     is_equal = (h->get_decision() == h->face()->get_decision());
     // has equal can be true even if the decision is not the same,
@@ -1184,36 +1053,30 @@ class Envelope_divide_and_conquer_3
     bool has_equal_first = (h->get_has_equal_aux_data_in_face(0));
     bool is_equal_second = (h->get_is_equal_aux_data_in_face(1));
     bool has_equal_second = (h->get_has_equal_aux_data_in_face(1));
-    if (decision == DAC_DECISION_FIRST)
-    {
+    if (decision == DAC_DECISION_FIRST) {
       is_equal &= is_equal_first;
       has_equal &= has_equal_first;
     }
-    else if (decision == DAC_DECISION_SECOND)
-    {
+    else if (decision == DAC_DECISION_SECOND) {
       is_equal &= is_equal_second;
       has_equal &= has_equal_second;
     }
-    else
-    {
+    else {
       is_equal &= (is_equal_first & is_equal_second);
       // we check if the halfedge has a different decision, and if so,
 
       // we update the flag according to the halfedge decision
       decision = h->get_decision();
-      if (decision == DAC_DECISION_FIRST)
-      has_equal &= has_equal_first;
-      else if (decision == DAC_DECISION_SECOND)
-      has_equal &= has_equal_second;
-      else
-      has_equal &= (has_equal_first & has_equal_second);
+      if (decision == DAC_DECISION_FIRST) has_equal &= has_equal_first;
+      else if (decision == DAC_DECISION_SECOND) has_equal &= has_equal_second;
+      else has_equal &= (has_equal_first & has_equal_second);
     }
 
     h->set_is_equal_data_in_face(is_equal);
     h->set_has_equal_data_in_face(has_equal);
   }
-  void update_edge_target_flags(Halfedge_handle h)
-  {
+
+  void update_edge_target_flags(Halfedge_handle h) {
     bool is_equal, has_equal;
 
     is_equal = (h->get_decision() == h->target()->get_decision());
@@ -1229,19 +1092,15 @@ class Envelope_divide_and_conquer_3
     bool has_equal_first = (h->get_has_equal_aux_data_in_target(0));
     bool is_equal_second = (h->get_is_equal_aux_data_in_target(1));
     bool has_equal_second = (h->get_has_equal_aux_data_in_target(1));
-    if (decision == DAC_DECISION_FIRST)
-    {
+    if (decision == DAC_DECISION_FIRST) {
       is_equal &= is_equal_first;
       has_equal &= has_equal_first;
     }
-
-    else if (decision == DAC_DECISION_SECOND)
-    {
+    else if (decision == DAC_DECISION_SECOND) {
       is_equal &= is_equal_second;
       has_equal &= has_equal_second;
     }
-    else
-    {
+    else {
       is_equal &= (is_equal_first & is_equal_second);
       // we check if the vertex has a different decision, and if so,
       // we update the flag according to the vertex decision
@@ -1257,8 +1116,8 @@ class Envelope_divide_and_conquer_3
     h->set_is_equal_data_in_target(is_equal);
     h->set_has_equal_data_in_target(has_equal);
   }
-  void update_target_face_flags(Halfedge_handle h)
-  {
+
+  void update_target_face_flags(Halfedge_handle h) {
     bool has_equal;
     // has equal can be true even if the decision is not the same,
     // but has same surfaces, i.e. one of the features got DAC_DECISION_BOTH
@@ -1270,28 +1129,20 @@ class Envelope_divide_and_conquer_3
     CGAL::Dac_decision decision = h->face()->get_decision();
     bool has_equal_first = (h->get_has_equal_aux_data_in_target_and_face(0));
     bool has_equal_second = (h->get_has_equal_aux_data_in_target_and_face(1));
-    if (decision == DAC_DECISION_FIRST)
-      has_equal &= has_equal_first;
-    else if (decision == DAC_DECISION_SECOND)
-      has_equal &= has_equal_second;
-    else
-    {
+    if (decision == DAC_DECISION_FIRST) has_equal &= has_equal_first;
+    else if (decision == DAC_DECISION_SECOND) has_equal &= has_equal_second;
+    else {
       // we check if the vertex has a different decision, and if so,
       // we update the flag according to the vertex decision
       decision = h->target()->get_decision();
-      if (decision == DAC_DECISION_FIRST)
-        has_equal &= has_equal_first;
-      else if (decision == DAC_DECISION_SECOND)
-        has_equal &= has_equal_second;
-
-      else
-        has_equal &= (has_equal_first & has_equal_second);
+      if (decision == DAC_DECISION_FIRST) has_equal &= has_equal_first;
+      else if (decision == DAC_DECISION_SECOND) has_equal &= has_equal_second;
+      else has_equal &= (has_equal_first & has_equal_second);
     }
     h->set_has_equal_data_in_target_and_face(has_equal);
   }
 
-  void update_vertex_face_flags(Vertex_handle v, Face_handle f)
-  {
+  void update_vertex_face_flags(Vertex_handle v, Face_handle f) {
     bool is_equal, has_equal;
     is_equal = (v->get_decision() == f->get_decision());
     // has equal can be true even if the decision is not the same,
@@ -1307,18 +1158,15 @@ class Envelope_divide_and_conquer_3
     bool has_equal_first = (v->get_has_equal_aux_data_in_face(0));
     bool is_equal_second = (v->get_is_equal_aux_data_in_face(1));
     bool has_equal_second = (v->get_has_equal_aux_data_in_face(1));
-    if (decision == DAC_DECISION_FIRST)
-    {
+    if (decision == DAC_DECISION_FIRST) {
       is_equal &= is_equal_first;
       has_equal &= has_equal_first;
     }
-    else if (decision == DAC_DECISION_SECOND)
-    {
+    else if (decision == DAC_DECISION_SECOND) {
       is_equal &= is_equal_second;
       has_equal &= has_equal_second;
     }
-    else
-    {
+    else {
       is_equal &= (is_equal_first & is_equal_second);
       // we check if the face has a different decision, and if so,
       // we update the flag according to the face decision
@@ -1334,11 +1182,9 @@ class Envelope_divide_and_conquer_3
     v->set_has_equal_data_in_face(has_equal);
   }
 
-  void update_flags(Minimization_diagram_2& result)
-  {
+  void update_flags(Minimization_diagram_2& result) {
     // edges
-    Halfedge_iterator hi = result.halfedges_begin();
-    for (; hi != result.halfedges_end(); ++hi)
+    for (auto hi = result.halfedges_begin(); hi != result.halfedges_end(); ++hi)
     {
       update_edge_face_flags(hi);
       update_edge_target_flags(hi);
@@ -1346,22 +1192,16 @@ class Envelope_divide_and_conquer_3
     }
 
     // vertices
-    Vertex_iterator vi = result.vertices_begin();
-    for (; vi != result.vertices_end(); ++vi)
-      if (vi->is_isolated())
-    update_vertex_face_flags(vi, vi->face());
-
+    for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi)
+      if (vi->is_isolated()) update_vertex_face_flags(vi, vi->face());
   }
 
-  template <class FeatureHandle>
+  template <typename FeatureHandle>
   bool get_aux_is_set(FeatureHandle fh, unsigned int id)
-  {
-    return fh->get_aux_is_set(id);
-  }
+  { return fh->get_aux_is_set(id); }
 
-  template <class FeatureHandle>
-  bool aux_has_no_data(FeatureHandle fh, unsigned int id)
-  {
+  template <typename FeatureHandle>
+  bool aux_has_no_data(FeatureHandle fh, unsigned int id) {
     const Object& o = fh->get_aux_source(id);
     Halfedge_handle h;
     Vertex_handle v;
@@ -1372,12 +1212,9 @@ class Envelope_divide_and_conquer_3
     // aux source of a vertex can be face, halfedge or vertex
     // this is why we start with a check for a face, then halfedge
     // and last vertex
-    if (assign(f, o))
-      return f->has_no_data();
-    else if (assign(h, o))
-      return h->has_no_data();
-    else
-    {
+    if (assign(f, o)) return f->has_no_data();
+    else if (assign(h, o)) return h->has_no_data();
+    else {
       CGAL_assertion_code(bool b =)
       assign(v, o);
       CGAL_assertion(b);
@@ -1393,25 +1230,21 @@ class Envelope_divide_and_conquer_3
 
   void get_data_iterators(Object aux_src,
                           Envelope_data_iterator& begin,
-                          Envelope_data_iterator& end)
-  {
+                          Envelope_data_iterator& end) {
     CGAL_assertion(!aux_src.is_empty());
     Vertex_handle v;
     Halfedge_handle h;
     Face_handle f;
 
-    if (assign(v, aux_src))
-    {
+    if (assign(v, aux_src)) {
       begin = v->begin_data();
       end = v->end_data();
     }
-    else if (assign(h, aux_src))
-    {
+    else if (assign(h, aux_src)) {
       begin = h->begin_data();
       end = h->end_data();
     }
-    else
-    {
+    else {
       CGAL_assertion(assign(f, aux_src));
       assign(f, aux_src);
       begin = f->begin_data();
@@ -1419,20 +1252,15 @@ class Envelope_divide_and_conquer_3
     }
   }
   bool is_equal_data(Object o,
-                     Envelope_data_iterator begin,
-                     Envelope_data_iterator end)
-  {
+                     Envelope_data_iterator begin, Envelope_data_iterator end) {
     CGAL_assertion(!o.is_empty());
     Vertex_handle v;
     Halfedge_handle h;
     Face_handle f;
 
-    if (assign(v, o))
-      return v->is_equal_data(begin, end);
-    else if (assign(h, o))
-      return h->is_equal_data(begin, end);
-    else
-    {
+    if (assign(v, o)) return v->is_equal_data(begin, end);
+    else if (assign(h, o)) return h->is_equal_data(begin, end);
+    else {
       CGAL_assertion(assign(f, o));
       assign(f, o);
       return f->is_equal_data(begin, end);
@@ -1440,43 +1268,32 @@ class Envelope_divide_and_conquer_3
   }
   bool has_equal_data(Object o,
                       Envelope_data_iterator begin,
-                      Envelope_data_iterator end)
-  {
+                      Envelope_data_iterator end) {
     CGAL_assertion(!o.is_empty());
     Vertex_handle v;
     Halfedge_handle h;
     Face_handle f;
 
-    if (assign(v, o))
-      return v->has_equal_data(begin, end);
-    else if (assign(h, o))
-      return h->has_equal_data(begin, end);
-    else
-    {
+    if (assign(v, o)) return v->has_equal_data(begin, end);
+    else if (assign(h, o)) return h->has_equal_data(begin, end);
+    else {
       CGAL_assertion(assign(f, o));
       assign(f, o);
       return f->has_equal_data(begin, end);
     }
   }
 
-  void print_decisions(Minimization_diagram_2& result)
-  {
-    Face_iterator fi = result.faces_begin();
-    for (; fi != result.faces_end(); ++fi)
-    {
-      if (fi->is_unbounded())
-        continue;
+  void print_decisions(Minimization_diagram_2& result) {
+    for (auto fi = result.faces_begin(); fi != result.faces_end(); ++fi) {
+      if (fi->is_unbounded()) continue;
       Face_handle fh = fi;
       Ccb_halfedge_circulator face_hec = fh->outer_ccb();
       Ccb_halfedge_circulator face_hec_begin = face_hec;
-      do {
-        ++face_hec;
-      } while(face_hec != face_hec_begin);
-
-      Inner_ccb_iterator inner_iter = fh->holes_begin();
-      for (; inner_iter != fh->holes_end(); ++inner_iter)
+      do ++face_hec;
+      while (face_hec != face_hec_begin);
 
-      {
+      for (auto inner_iter = fh->holes_begin(); inner_iter != fh->holes_end();
+           ++inner_iter) {
         face_hec = face_hec_begin = (*inner_iter);
         do {
           ++face_hec;
@@ -1488,17 +1305,11 @@ class Envelope_divide_and_conquer_3
 
   // confirm that aux source and decision are set over all minimization
   // diagram features
-  bool check_resolve_was_ok(Minimization_diagram_2& result)
-  {
+  bool check_resolve_was_ok(Minimization_diagram_2& result) {
     bool all_ok = true;
-    Vertex_iterator vi = result.vertices_begin();
-    for (; vi != result.vertices_end(); ++vi)
-    {
+    for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
-      /* if (vh->get_is_fake())
-       *   continue;
-       */
-
+      // if (vh->get_is_fake()) continue;
       all_ok &= (vh->get_aux_is_set(0));
       CGAL_assertion_msg(all_ok, "aux source (0) not set over vertex");
       all_ok &= (vh->get_aux_is_set(1));
@@ -1507,8 +1318,7 @@ class Envelope_divide_and_conquer_3
       CGAL_assertion_msg(all_ok, "decision was not set over vertex");
 
     }
-    Halfedge_iterator hi = result.halfedges_begin();
-    for (; hi != result.halfedges_end(); ++hi)
+    for (auto hi = result.halfedges_begin(); hi != result.halfedges_end(); ++hi)
     {
       Halfedge_handle hh = hi;
      /* if (hh->get_is_fake())
@@ -1522,11 +1332,9 @@ class Envelope_divide_and_conquer_3
       all_ok &= (hh->is_decision_set());
       CGAL_assertion_msg(all_ok, "decision was not set over edge");
     }
-    Face_iterator fi = result.faces_begin();
-    for (; fi != result.faces_end(); ++fi)
-    {
-      Face_handle fh = fi;
 
+    for (auto fi = result.faces_begin(); fi != result.faces_end(); ++fi) {
+      Face_handle fh = fi;
       all_ok &= (fh->get_aux_is_set(0));
       CGAL_assertion_msg(all_ok, "aux source (0) not set over face");
       all_ok &= (fh->get_aux_is_set(1));
@@ -1539,12 +1347,9 @@ class Envelope_divide_and_conquer_3
 
   // confirm that envelope data is set over all minimization diagram features
   // and that no fake feature are left
-  bool is_envelope_valid(Minimization_diagram_2& result)
-  {
+  bool is_envelope_valid(Minimization_diagram_2& result) {
     bool all_ok = true;
-    Vertex_iterator vi = result.vertices_begin();
-    for (; vi != result.vertices_end(); ++vi)
-    {
+    for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
 
       all_ok &= (vh->get_is_set());
@@ -1555,26 +1360,23 @@ class Envelope_divide_and_conquer_3
      /* all_ok &= (!vh->get_is_fake());*/
       CGAL_assertion_msg(all_ok, "fake vertex in envelope");
     }
-    Halfedge_iterator hi = result.halfedges_begin();
-    for (; hi != result.halfedges_end(); ++hi)
+
+    for (auto hi = result.halfedges_begin(); hi != result.halfedges_end(); ++hi)
     {
       Halfedge_handle hh = hi;
 
       all_ok &= (hh->get_is_set());
-      if (!all_ok)
-        std::cerr << "edge: " << hh->curve() << std::endl;
+      if (!all_ok) std::cerr << "edge: " << hh->curve() << std::endl;
       CGAL_assertion_msg(all_ok, "data not set over edge");
       all_ok &= (!hh->has_no_data());
-      if (!all_ok)
-        std::cerr << "edge: " << hh->curve() << std::endl;
+      if (!all_ok) std::cerr << "edge: " << hh->curve() << std::endl;
       CGAL_assertion_msg(all_ok, "data empty over edge");
 
       /*all_ok &= (!hh->get_is_fake());*/
       CGAL_assertion_msg(all_ok, "fake edge in envelope");
     }
-    Face_iterator fi = result.faces_begin();
-    for (; fi != result.faces_end(); ++fi)
-    {
+
+    for (auto fi = result.faces_begin(); fi != result.faces_end(); ++fi) {
       Face_handle fh = fi;
       all_ok &= (fh->get_is_set());
       CGAL_assertion_msg(all_ok, "data not set over face");
@@ -1738,14 +1540,13 @@ class Envelope_divide_and_conquer_3
   // A BFS visitor class which collects the faces that need resolving
   // in a list according to the discover time
   // In our case graph vertices represent minimization diagram faces
-  template <class IndexMap>
-  class Faces_order_bfs_visitor : public boost::default_bfs_visitor
-  {
+  template <typename IndexMap>
+  class Faces_order_bfs_visitor : public boost::default_bfs_visitor {
   public:
-    typedef typename Envelope_divide_and_conquer_3<Traits,
-                                                   Minimization_diagram_2,
-                                                   EnvelopeResolver_3,
-                                                   Overlay_2>::Self Self;
+    using Self = typename Envelope_divide_and_conquer_3<Traits,
+                                                        Minimization_diagram_2,
+                                                        EnvelopeResolver_3,
+                                                        Overlay_2>::Self;
 
   protected:
     const IndexMap* index_map;          // Mapping vertices to indices
@@ -1753,28 +1554,23 @@ class Envelope_divide_and_conquer_3
     Self* base;
 
   public:
-
     // Constructor.
     Faces_order_bfs_visitor(const IndexMap& imap, std::list<Face_handle>& f,
                             Self* b) :
       index_map(&imap),
       faces(f),
       base(b)
-    {
-      CGAL_assertion(base != nullptr);
-    }
+    { CGAL_assertion(base != nullptr); }
 
     // Write the discover time for a given vertex.
     template <typename Vertex, typename Graph>
 
-    void discover_vertex(Vertex fh, const Graph&)
-    {
+    void discover_vertex(Vertex fh, const Graph&) {
       // first we check if we can set the decision immediately
       // if a surface of one map doesn't exist, then we set the second surface
       if (base->aux_has_no_data(fh, 0) && !base->aux_has_no_data(fh, 1))
         fh->set_decision(DAC_DECISION_SECOND);
-      else if (base->aux_has_no_data(fh, 0) && base->aux_has_no_data(fh, 1))
-      {
+      else if (base->aux_has_no_data(fh, 0) && base->aux_has_no_data(fh, 1)) {
 
         fh->set_decision(EQUAL);
         fh->set_no_data();
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
index 5a20790628ef..8d50d5bcd1a0 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
@@ -7,8 +7,9 @@
 // $Id$
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
-//                 Baruch Zukerman        <baruchzu@post.tau.ac.il>
+// Author(s) : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+//             Baruch Zukerman        <baruchzu@post.tau.ac.il>
+//             Efi Fogel              <efif@post.tau.ac.il>
 
 #ifndef CGAL_ENVELOPE_ELEMENT_VISITOR_3_H
 #define CGAL_ENVELOPE_ELEMENT_VISITOR_3_H
@@ -16,6 +17,11 @@
 #include <CGAL/license/Envelope_3.h>
 
 
+#include <vector>
+#include <algorithm>
+#include <iostream>
+#include <deque>
+
 #include <CGAL/Object.h>
 #include <CGAL/enum.h>
 #include <CGAL/Unique_hash_map.h>
@@ -26,11 +32,6 @@
 #include <CGAL/utility.h>
 #include <CGAL/Arrangement_2/Arr_traits_adaptor_2.h>
 
-#include <vector>
-#include <algorithm>
-#include <iostream>
-#include <deque>
-
 namespace CGAL {
 
 // Return the comparison result of the halfedge's source and target vertices.
@@ -41,102 +42,90 @@ namespace CGAL {
 // this class does the resolving of edge and face in the divide & conquer
 // algorithm it should handle all faces (it supports holes in the face)
 
-template <class EnvelopeTraits_3, class MinimizationDiagram_2>
-class Envelope_element_visitor_3
-{
+template <typename EnvelopeTraits_3, typename MinimizationDiagram_2>
+class Envelope_element_visitor_3 {
+public:
+  using Traits = EnvelopeTraits_3;
+  using Minimization_diagram_2 = MinimizationDiagram_2;
+
+private:
+  using Md2 = Minimization_diagram_2;
+
 public:
-  typedef EnvelopeTraits_3                             Traits;
-  typedef typename Traits::Multiplicity                Multiplicity;
-  typedef typename Traits::Surface_3                   Surface_3;
-  typedef typename Traits::Xy_monotone_surface_3       Xy_monotone_surface_3;
-  typedef typename Traits::Equal_2                     Equal_2;
-
-  typedef MinimizationDiagram_2                        Minimization_diagram_2;
-  typedef typename Traits::Point_2                     Point_2;
-  typedef typename Traits::X_monotone_curve_2          X_monotone_curve_2;
-  typedef typename Minimization_diagram_2::Are_all_sides_oblivious_category
-    Are_all_sides_oblivious_category;
+  using Multiplicity = typename Traits::Multiplicity;
+  using Surface_3 = typename Traits::Surface_3;
+  using Xy_monotone_surface_3 = typename Traits::Xy_monotone_surface_3;
+  using Equal_2 = typename Traits::Equal_2;
+
+  using Point_2 = typename Traits::Point_2;
+  using X_monotone_curve_2 = typename Traits::X_monotone_curve_2;
+  using Are_all_sides_oblivious_category =
+    typename Md2::Are_all_sides_oblivious_category;
 
 protected:
   class Copied_face_zone_visitor;
 
-  typedef Envelope_element_visitor_3<Traits, Minimization_diagram_2> Self;
-  typedef typename Minimization_diagram_2::Halfedge_const_handle
-                                                        Halfedge_const_handle;
-  typedef typename Minimization_diagram_2::Halfedge_const_iterator
-                                                        Halfedge_const_iterator;
-  typedef typename Minimization_diagram_2::Halfedge_handle
-                                                        Halfedge_handle;
-  typedef typename Minimization_diagram_2::Halfedge_iterator
-                                                        Halfedge_iterator;
-  typedef typename Minimization_diagram_2::Face_const_handle
-                                                        Face_const_handle;
-  typedef typename Minimization_diagram_2::Face_handle
-                                                        Face_handle;
-  typedef typename Minimization_diagram_2::Face_iterator
-                                                        Face_iterator;
-  typedef typename Minimization_diagram_2::Vertex_const_handle
-                                                        Vertex_const_handle;
-  typedef typename Minimization_diagram_2::Vertex_handle
-                                                        Vertex_handle;
-  typedef typename Minimization_diagram_2::Vertex_iterator
-                                                        Vertex_iterator;
-  typedef typename Minimization_diagram_2::Ccb_halfedge_circulator
-    Ccb_halfedge_circulator;
-  typedef typename Minimization_diagram_2::Inner_ccb_iterator
-                                                        Inner_ccb_iterator;
-  typedef typename Minimization_diagram_2::Outer_ccb_iterator
-                                                        Outer_ccb_iterator;
-  typedef typename Minimization_diagram_2::Isolated_vertex_iterator
-    Isolated_vertex_iterator;
-  typedef typename Minimization_diagram_2::Topology_traits
-                                                        Topology_traits;
-  typedef typename Minimization_diagram_2::Dcel         Dcel;
-  typedef typename Minimization_diagram_2::Dcel::Dcel_data_iterator
-                                                        Envelope_data_iterator;
-
-  typedef typename Minimization_diagram_2::Observer     Md_observer;
-  typedef Arr_accessor<Minimization_diagram_2>          Md_accessor;
-
-  typedef typename Topology_traits::Default_point_location_strategy
-    Md_point_location;
-  typedef typename Topology_traits::Zone_insertion_visitor
-    Md_insert_zone_visitor;
-
-  typedef std::list<Halfedge_handle>                    Halfedges_list;
-  typedef typename std::list<Halfedge_handle>::iterator Halfedges_list_iterator;
-
-  typedef std::pair<Halfedge_handle, Multiplicity>      Halfedge_w_type;
-  typedef std::list<Halfedge_w_type>                    Halfedges_w_type_list;
-
-  typedef std::list<Vertex_handle>                      Vertices_list;
-  typedef typename std::list<Vertex_handle>::iterator   Vertices_list_iterator;
-
-  typedef std::list<Face_handle>                        Faces_list;
-  typedef typename std::list<Face_handle>::iterator     Faces_list_iterator;
-
-  typedef Unique_hash_map<Vertex_handle, bool>          Vertices_hash;
-  typedef Unique_hash_map<Halfedge_handle, bool>        Halfedges_hash;
-  typedef Unique_hash_map<Halfedge_handle, Multiplicity>
-                                                        Halfedges_hash_w_type;
-  typedef Unique_hash_map<Face_handle, bool>            Faces_hash;
-
-  typedef Unique_hash_map<Vertex_handle, Vertex_handle> Vertices_map;
-  typedef Unique_hash_map<Halfedge_handle, Halfedge_handle>
-                                                        Halfedges_map;
-  typedef Unique_hash_map<Face_handle, Face_handle>     Faces_map;
-
-  typedef Unique_hash_map<Vertex_handle, Halfedge_handle>
-                                                        Vertices_to_edges_map;
-
-  typedef std::pair<X_monotone_curve_2, Multiplicity>   Intersection_curve;
-  typedef std::list<std::variant<Intersection_curve,
-                    Point_2>>                           Intersections_list;
+  using Self = Envelope_element_visitor_3<Traits, Md2>;
+
+  using Vertex_handle = typename Md2::Vertex_handle;
+  using Halfedge_handle = typename Md2::Halfedge_handle;
+  using Face_handle = typename Md2::Face_handle;
+  using Vertex_const_handle = typename Md2::Vertex_const_handle;
+  using Halfedge_const_handle = typename Md2::Halfedge_const_handle;
+  using Face_const_handle = typename Md2::Face_const_handle;
+  using Vertex_iterator = typename Md2::Vertex_iterator;
+  using Halfedge_iterator = typename Md2::Halfedge_iterator;
+  using Face_iterator = typename Md2::Face_iterator;
+
+  using Halfedge_const_iterator = typename Md2::Halfedge_const_iterator;
+  using Ccb_halfedge_circulator = typename Md2::Ccb_halfedge_circulator;
+  using Inner_ccb_iterator = typename Md2::Inner_ccb_iterator;
+  using Outer_ccb_iterator = typename Md2::Outer_ccb_iterator;
+  using Isolated_vertex_iterator = typename Md2::Isolated_vertex_iterator;
+  using Topology_traits = typename Md2::Topology_traits;
+  using Dcel = typename Md2::Dcel;
+  using Face = typename Dcel::Face;
+  using Envelope_data_iterator = typename Face::Data_iterator;
+
+  using Md_observer = typename Md2::Observer;
+  using Md_accessor = Arr_accessor<Md2>;
+
+  using Md_point_location =
+    typename Topology_traits::Default_point_location_strategy;
+  using Md_insert_zone_visitor =
+    typename Topology_traits::Zone_insertion_visitor;
+
+  using Halfedges_list = std::list<Halfedge_handle>;
+  using Halfedges_list_iterator = typename std::list<Halfedge_handle>::iterator;
+
+  using Halfedge_w_type = std::pair<Halfedge_handle, Multiplicity>;
+  using Halfedges_w_type_list = std::list<Halfedge_w_type>;
+
+  using Vertices_list = std::list<Vertex_handle>;
+  using Vertices_list_iterator = typename std::list<Vertex_handle>::iterator;
+
+  using Faces_list = std::list<Face_handle>;
+  using Faces_list_iterator = typename std::list<Face_handle>::iterator;
+
+  using Vertices_hash = Unique_hash_map<Vertex_handle, bool>;
+  using Halfedges_hash = Unique_hash_map<Halfedge_handle, bool>;
+  using Halfedges_hash_w_type = Unique_hash_map<Halfedge_handle, Multiplicity>;
+  using Faces_hash = Unique_hash_map<Face_handle, bool>;
+
+  using Vertices_map = Unique_hash_map<Vertex_handle, Vertex_handle>;
+  using Halfedges_map = Unique_hash_map<Halfedge_handle, Halfedge_handle>;
+  using Faces_map = Unique_hash_map<Face_handle, Face_handle>;
+
+  using Vertices_to_edges_map = Unique_hash_map<Vertex_handle, Halfedge_handle>;
+
+  using Intersection_curve = std::pair<X_monotone_curve_2, Multiplicity>;
+  using Intersections_list =
+    std::list<std::variant<Intersection_curve, Point_2>>;
 
   // this is used in the resolve edge process
-  typedef Triple<Point_2, bool, bool>                   Point_2_with_info;
-  struct Points_compare
-  {
+  using Point_2_with_info = Triple<Point_2, bool, bool>;
+
+  struct Points_compare {
   protected:
     const Traits* p_traits;
 
@@ -144,22 +133,19 @@ class Envelope_element_visitor_3
     // Constructor
     Points_compare(const Traits& geom_traits) : p_traits(&geom_traits) {}
 
-    bool operator()(const Point_2_with_info& p1,
-                     const Point_2_with_info& p2) const
-    {
+    bool operator()(const Point_2_with_info& p1, const Point_2_with_info& p2)
+      const {
       // The original code seemed to presume that two Points are never equal
       // This is not true, there are various counter examples.
       // e.g the intersection of surf1 and surf2 may have ending edge and
       // a starting edge on the to be resolved edge
-      return
-        p_traits->compare_xy_2_object()(p1.first, p2.first) == SMALLER;
+      return p_traits->compare_xy_2_object()(p1.first, p2.first) == SMALLER;
     }
   };
 
 public:
   // c'tor
-  Envelope_element_visitor_3(Envelope_type t = ENVELOPE_LOWER)
-  {
+  Envelope_element_visitor_3(Envelope_type t = ENVELOPE_LOWER) {
     // Allocate the traits.
     m_traits = new Traits;
     own_traits = true;
@@ -167,8 +153,7 @@ class Envelope_element_visitor_3
   }
 
   Envelope_element_visitor_3(const Traits* tr,
-                             Envelope_type t = ENVELOPE_LOWER)
-  {
+                             Envelope_type t = ENVELOPE_LOWER) {
     // Set the traits.
     m_traits = tr;
     own_traits = false;
@@ -176,17 +161,11 @@ class Envelope_element_visitor_3
   }
 
   // virtual destructor.
-  virtual ~Envelope_element_visitor_3()
-  {
-    // Free the traits object, if necessary.
-    if (own_traits)
-      delete m_traits;
-  }
+  virtual ~Envelope_element_visitor_3() { if (own_traits) delete m_traits; }
 
   // get a face with 2 surfaces defined over it, and compute the arrangement
   // of the/ envelope of these surfaces over the face
-  void resolve(Face_handle face, Minimization_diagram_2& result)
-  {
+  void resolve(Face_handle face, Minimization_diagram_2& result) {
     CGAL_assertion(face->get_aux_is_set(0));
     CGAL_assertion(face->get_aux_is_set(1));
 
@@ -203,8 +182,7 @@ class Envelope_element_visitor_3
 
     get_projected_intersections(surf1, surf2, std::back_inserter(inter_objs));
 
-    if (inter_objs.size() == 0)
-    {
+    if (inter_objs.size() == 0) {
       // here for resolve we can compare the surfaces over the edges only
       // (no need for left/right versions)
       Comparison_result cur_res = resolve_minimal_face(face);
@@ -229,7 +207,7 @@ class Envelope_element_visitor_3
     Vertices_map  map_copied_to_orig_vertices;
     // here we maintain a mapping between faces in the copied arrangement and
     // their corresponding face from result
-    Faces_map     map_copied_to_orig_faces;
+    Faces_map map_copied_to_orig_faces;
 
     // now, insert the face's boundary into the temporary minimization diagram
     // the face is assumed to have outer boundary, and may also have holes,
@@ -243,7 +221,6 @@ class Envelope_element_visitor_3
     CGAL_assertion(copied_face_arr.is_valid());
     map_copied_to_orig_faces[copied_face] = face;
 
-
     // we use our zone visitor, which only inserts into the arrangement the
     // points and curves which are inside the copied face
     // it updates the result arrangement at the same time (action after action
@@ -284,10 +261,8 @@ class Envelope_element_visitor_3
 
     Md_point_location pl(copied_face_arr);
     for (auto inter_objs_it = inter_objs.begin();
-              inter_objs_it != inter_objs.end(); ++inter_objs_it)
-    {
-      if (const Point_2* point = std::get_if<Point_2>(&(*inter_objs_it)))
-      {
+         inter_objs_it != inter_objs.end(); ++inter_objs_it) {
+      if (const Point_2* point = std::get_if<Point_2>(&(*inter_objs_it))) {
         // intersection can be a point when the surfaces only touch each other.
         // we are only interested in the points that are inside the face or
         // on its boundary.
@@ -298,15 +273,14 @@ class Envelope_element_visitor_3
         // the above information is available in zone_visitor
         insert_point(copied_face_arr, *point, pl, zone_visitor);
       }
-      else if (const Intersection_curve* curve = std::get_if<Intersection_curve>(&(*inter_objs_it)))
-      {
+      else if (const auto* curve =
+               std::get_if<Intersection_curve>(&(*inter_objs_it))) {
         zone_visitor.set_current_intersection_type(curve->second);
         insert(copied_face_arr, curve->first, pl, zone_visitor);
         CGAL_assertion(copied_face_arr.is_valid());
         CGAL_assertion(result.is_valid());
       }
-      else
-        CGAL_error_msg( "wrong projected intersection type");
+      else CGAL_error_msg( "wrong projected intersection type");
     }
 
     zone_visitor.finish();
@@ -317,8 +291,7 @@ class Envelope_element_visitor_3
     // go over the new edges, and set data over their faces
     typename Halfedges_w_type_list::iterator new_edge_it;
     for (new_edge_it = result_new_edges.begin();
-         new_edge_it != result_new_edges.end(); ++new_edge_it)
-    {
+         new_edge_it != result_new_edges.end(); ++new_edge_it) {
       Halfedge_handle new_he = (*new_edge_it).first;
       Halfedge_handle new_he_twin = new_he->twin();
 #ifdef CGAL_ENVELOPE_SAVE_COMPARISONS
@@ -339,8 +312,7 @@ class Envelope_element_visitor_3
       // to f1, not only the opposite
       Face_handle f1 = new_he->face(), f2 = new_he_twin->face();
       Comparison_result res;
-      if (!f1->is_decision_set() && !f2->is_decision_set())
-      {
+      if (! f1->is_decision_set() && !f2->is_decision_set()) {
         res = resolve_minimal_face(f1, &new_he);
         copy_data_by_comparison_result(face, f1, res);
       }
@@ -349,11 +321,9 @@ class Envelope_element_visitor_3
 
       // if the other face doesn't have its data, we resolve it using
       // the former result and the intersection type (if exists)
-      if (!f2->is_decision_set())
-      {
+      if (! f2->is_decision_set()) {
 #ifdef CGAL_ENVELOPE_SAVE_COMPARISONS
-        if (itype != 0)
-        {
+        if (itype != 0) {
           res = convert_decision_to_comparison_result(f1->get_decision());
           res = resolve_by_intersection_type(res, itype);
           CGAL_expensive_assertion_code
@@ -361,26 +331,22 @@ class Envelope_element_visitor_3
              resolve_minimal_face(f2, &new_he_twin););
           CGAL_expensive_assertion(tmp_res == res);
         }
-        else
-          res = resolve_minimal_face(f2, &new_he_twin);
+        else res = resolve_minimal_face(f2, &new_he_twin);
 #else
         res = resolve_minimal_face(f2, &new_he_twin);
 #endif
         copy_data_by_comparison_result(face, f2, res);
       }
-      if (!f1->is_decision_set())
-      {
+      if (! f1->is_decision_set()) {
 #ifdef CGAL_ENVELOPE_SAVE_COMPARISONS
-        if (itype != 0)
-        {
+        if (itype != 0) {
           res = convert_decision_to_comparison_result(f2->get_decision());
           res = resolve_by_intersection_type(res, itype);
           CGAL_expensive_assertion_code
             (Comparison_result tmp_res = resolve_minimal_face(f1, &new_he));
           CGAL_expensive_assertion(tmp_res == res);
         }
-        else
-          res = resolve_minimal_face(f1, &new_he);
+        else res = resolve_minimal_face(f1, &new_he);
 #else
         res = resolve_minimal_face(f1, &new_he);
 #endif
@@ -393,22 +359,19 @@ class Envelope_element_visitor_3
     // using compare_left/right versions
     Halfedges_list_iterator special_edge_it;
     for (special_edge_it = result_special_edges.begin();
-         special_edge_it != result_special_edges.end(); ++special_edge_it)
-    {
+         special_edge_it != result_special_edges.end(); ++special_edge_it) {
       // we assume that the halfedge given points to the correct face
       // (which is inside the original face)
       Halfedge_handle special_he = *special_edge_it;
       Face_handle f = special_he->face();
-      if (!f->is_decision_set())
-      {
+      if (! f->is_decision_set()) {
         Comparison_result res = resolve_minimal_face(f, &special_he);
         copy_data_by_comparison_result(face, f, res);
       }
 
       // take care for the edge, if necessary
-      if (!special_he->is_decision_set() &&
-          can_copy_decision_from_face_to_edge(special_he))
-      {
+      if (! special_he->is_decision_set() &&
+          can_copy_decision_from_face_to_edge(special_he)) {
         // if (!special_he->get_aux_is_set(0) || !special_he->get_aux_is_set(1))
         // {
         // // this can only happen when the edge is fake, since the edge is on
@@ -432,21 +395,19 @@ class Envelope_element_visitor_3
     }
 
     // update data on special vertices
-    Vertices_list_iterator special_vertex_it;
-    for (special_vertex_it = result_special_vertices.begin();
-         special_vertex_it != result_special_vertices.end(); ++special_vertex_it)
-    {
+    for (auto special_vertex_it = result_special_vertices.begin();
+         special_vertex_it != result_special_vertices.end();
+         ++special_vertex_it) {
       Vertex_handle special_v = *special_vertex_it;
-      if (!special_v->is_decision_set())
-      {
-
+      if (! special_v->is_decision_set()) {
         if (special_v->get_aux_is_set(0) && special_v->get_aux_is_set(1))
           set_data_by_comparison_result(special_v, EQUAL);
         else
           // this is a new vertex inside the face, so we need to update its
           // aux source information from face also (done in method)
           copy_all_data_to_vertex(face, special_v);
-      } else
+      }
+      else
         CGAL_assertion(special_v->get_aux_is_set(0) &&  \
                        special_v->get_aux_is_set(1));
     }
@@ -455,11 +416,9 @@ class Envelope_element_visitor_3
     // the face, and should use regular resolve_minimal_face
     typename std::list<Face_handle>::iterator new_face_it;
     for (new_face_it = result_face_parts.begin();
-         new_face_it != result_face_parts.end(); ++new_face_it)
-    {
+         new_face_it != result_face_parts.end(); ++new_face_it) {
       Face_handle new_face = *new_face_it;
-      if (!new_face->is_decision_set())
-      {
+      if (! new_face->is_decision_set()) {
         Comparison_result res = resolve_minimal_face(new_face);
         copy_data_by_comparison_result(face, new_face, res);
       }
@@ -473,8 +432,7 @@ class Envelope_element_visitor_3
 
   // get an edge with 2 surfaces defined over it, and split it to get the shape
   // of the envelope of these surfaces over the edge
-  void resolve(Halfedge_handle edge, Minimization_diagram_2& result)
-  {
+  void resolve(Halfedge_handle edge, Minimization_diagram_2& result) {
     const Xy_monotone_surface_3& surf1 = get_aux_surface(edge, 0);
     const Xy_monotone_surface_3& surf2 = get_aux_surface(edge, 1);
 
@@ -482,8 +440,7 @@ class Envelope_element_visitor_3
     std::list<std::variant<Intersection_curve, Point_2>> inter_objs;
     get_projected_intersections(surf1, surf2, std::back_inserter(inter_objs));
 
-    if (inter_objs.size() == 0)
-    {
+    if (inter_objs.size() == 0) {
       resolve_minimal_edge(edge, edge);
 #ifdef CGAL_ENVELOPE_SAVE_COMPARISONS
       copy_data_to_edge_endpoints(edge);
@@ -496,8 +453,7 @@ class Envelope_element_visitor_3
     // we want to work on the halfedge going from left to right
     // we use HE_COMP_RES so this code can compile both with Arr_2
     // and with Aos_2.
-    if (HE_COMP_RES(edge) != SMALLER)
-      edge = edge->twin();
+    if (HE_COMP_RES(edge) != SMALLER) edge = edge->twin();
 
     Vertex_handle original_src = edge->source();
     Vertex_handle original_trg = edge->target();
@@ -511,43 +467,39 @@ class Envelope_element_visitor_3
     // we associate with every point 2 flags:
     // 1. is the point a left endpoint of an overlapping segment
     // 2. is the point a right endpoint of an overlapping segment
-    typedef std::vector<Point_2_with_info>      Points_vec;
-    Points_vec                                  split_points;
+    typedef std::vector<Point_2_with_info> Points_vec;
+    Points_vec split_points;
     bool is_min_end_at_inf = false;
     bool is_max_end_at_inf = false;
 
     for (auto inter_objs_it = inter_objs.begin();
-              inter_objs_it != inter_objs.end(); ++inter_objs_it)
-    {
-      if (const Point_2* point = std::get_if<Point_2>(&(*inter_objs_it)))
-      {
+         inter_objs_it != inter_objs.end(); ++inter_objs_it) {
+      if (const Point_2* point = std::get_if<Point_2>(&(*inter_objs_it))) {
         // if the point is on the curve, should add it the split points
         // list, otherwise, it is irrelevant and should be ignored
         if (is_point_on_curve(*point, original_cv))
           split_points.push_back(Point_2_with_info(*point, false, false));
       }
-      else if (const Intersection_curve* icurve = std::get_if<Intersection_curve>(&(*inter_objs_it)))
-      {
+      else if (const auto* icurve =
+               std::get_if<Intersection_curve>(&(*inter_objs_it))) {
         const X_monotone_curve_2& x_curve = icurve->first;
 
         // find the intersection points and overlapping segments with the
         // original curve and insert them to the list of split points
         // intersect the x-monotone curve with the edge's curve
         typedef std::pair<Point_2, unsigned int> Intersect_point_2;
-        std::list<std::variant<X_monotone_curve_2, Intersect_point_2>> intersections_list;
+        std::list<std::variant<X_monotone_curve_2, Intersect_point_2>>
+          intersections_list;
 
         m_traits->intersect_2_object()(x_curve, original_cv,
                                        std::back_inserter(intersections_list));
 
-        for (auto inter_it = intersections_list.begin(); inter_it != intersections_list.end(); ++inter_it)
-        {
-          if (const Intersect_point_2* ip = std::get_if<Intersect_point_2>(&(*inter_it)))
-          {
+        for (auto inter_it = intersections_list.begin();
+             inter_it != intersections_list.end(); ++inter_it) {
+          if (const auto* ip = std::get_if<Intersect_point_2>(&(*inter_it)))
             split_points.push_back(Point_2_with_info(ip->first, false, false));
-          }
-          else
-          {
-            const X_monotone_curve_2* icv = std::get_if<X_monotone_curve_2>(&(*inter_it));
+          else {
+            const auto* icv = std::get_if<X_monotone_curve_2>(&(*inter_it));
             CGAL_assertion(icv != nullptr);
 
             // we will add the *icv end points to the split_points, unless
@@ -570,21 +522,18 @@ class Envelope_element_visitor_3
                 (*icv, ARR_MAX_END) == ARR_INTERIOR)
               split_points.push_back
                 (Point_2_with_info(m_traits->construct_max_vertex_2_object()
-                                   (*icv),
-                                   false, true));
+                                   (*icv), false, true));
             else
               is_max_end_at_inf = true;
           }
         }
       }
 
-      else
-        CGAL_error_msg( "wrong projected intersection type");
+      else CGAL_error_msg( "wrong projected intersection type");
     }
 
     // if there aren't any split points, we can finish
-    if (split_points.empty())
-    {
+    if (split_points.empty()) {
       resolve_minimal_edge(edge, edge);
 #ifdef CGAL_ENVELOPE_SAVE_COMPARISONS
       copy_data_to_edge_endpoints(edge);
@@ -605,7 +554,7 @@ class Envelope_element_visitor_3
     // by checking the first point in the list
     bool source_is_special = false;
     CGAL_assertion(split_points.size() >= 1);
-    if ((!original_src->is_at_open_boundary() &&
+    if ((! original_src->is_at_open_boundary() &&
          m_traits->equal_2_object()(split_points[0].first,
                                     original_src->point())) ||
         (original_src->is_at_open_boundary() && is_min_end_at_inf))
@@ -618,7 +567,7 @@ class Envelope_element_visitor_3
     // check if target is a special vertex, by checking the last point in
     // the list
     bool target_is_special = false;
-    if ((!original_trg->is_at_open_boundary() &&
+    if ((! original_trg->is_at_open_boundary() &&
          m_traits->equal_2_object()(split_points[split_points.size()-1].first,
                                     original_trg->point())) ||
         (original_trg->is_at_open_boundary() && is_max_end_at_inf))
@@ -636,8 +585,7 @@ class Envelope_element_visitor_3
     // cur_part is the part of the original edge that might be split
     Halfedge_handle cur_part = edge;
 
-    for (unsigned int i = 0; i < split_points.size(); ++i)
-    {
+    for (unsigned int i = 0; i < split_points.size(); ++i) {
       Point_2_with_info cur_p = split_points[i];
       // if we get to the target vertex, we end the loop, since no more splits
 
@@ -649,11 +597,9 @@ class Envelope_element_visitor_3
       Vertex_handle cur_src_vertex = cur_part->source();
 
       // check that the current split point is not already a vertex
-      if ((!cur_src_vertex->is_at_open_boundary() &&
-           !m_traits->equal_2_object()(cur_p.first, cur_src_vertex->point())) ||
-          cur_src_vertex->is_at_open_boundary())
-
-      {
+      if ((! cur_src_vertex->is_at_open_boundary() &&
+           ! m_traits->equal_2_object()(cur_p.first, cur_src_vertex->point())) ||
+          cur_src_vertex->is_at_open_boundary()) {
         // split the edge in this point
         X_monotone_curve_2 a,b;
 
@@ -677,24 +623,20 @@ class Envelope_element_visitor_3
         // involved we can set both aux data on it. otherwise we should use
         // the traits compare method.
         Comparison_result finished_part_res;
-        if (overlaps > 0)
-          finished_part_res = EQUAL;
-        else
-          finished_part_res = resolve_minimal_edge(edge, finished_part);
+        if (overlaps > 0) finished_part_res = EQUAL;
+        else finished_part_res = resolve_minimal_edge(edge, finished_part);
 
         finished_part->set_decision(finished_part_res);
         finished_part->twin()->set_decision(finished_part_res);
 
-        if (finished_part == edge)
-          first_part_res = finished_part_res;
+        if (finished_part == edge) first_part_res = finished_part_res;
       }
 
       // check the overlaps indications
-      if (cur_p.second == true)
-        ++overlaps; // we start a new overlapping segment at this point
-      if (cur_p.third == true)
-        --overlaps; // we end an overlapping segment at this point
-
+      // we start a new overlapping segment at this point
+      if (cur_p.second == true) ++overlaps;
+      // we end an overlapping segment at this point
+      if (cur_p.third == true) --overlaps;
     }
 
     // set envelope data on the last part (cur_part)
@@ -708,8 +650,7 @@ class Envelope_element_visitor_3
     cur_part->set_decision(cur_part_res);
     cur_part->twin()->set_decision(cur_part_res);
 
-    if (cur_part == edge)
-      first_part_res = cur_part_res;
+    if (cur_part == edge) first_part_res = cur_part_res;
 
     // if the original source and target have same aux data as the edge
     // we can set envelope data over them also
@@ -719,9 +660,8 @@ class Envelope_element_visitor_3
 
     // the incident edge part to source should be edge (the first part)
     CGAL_assertion(original_src == edge->source());
-    if (!original_src->is_decision_set() &&
-        can_copy_decision_from_edge_to_vertex(edge->twin()))
-    {
+    if (! original_src->is_decision_set() &&
+        can_copy_decision_from_edge_to_vertex(edge->twin())) {
       if (source_is_special)
         set_data_by_comparison_result(original_src, EQUAL);
 #ifdef CGAL_ENVELOPE_SAVE_COMPARISONS
@@ -732,23 +672,19 @@ class Envelope_element_visitor_3
     }
     // the incident edge part to target should be cur_part (the last part)
     CGAL_assertion(original_trg == cur_part->target());
-    if (!original_trg->is_decision_set() &&
-        can_copy_decision_from_edge_to_vertex(cur_part))
-    {
+    if (! original_trg->is_decision_set() &&
+        can_copy_decision_from_edge_to_vertex(cur_part)) {
       if (target_is_special)
         set_data_by_comparison_result(original_trg, EQUAL);
 #ifdef CGAL_ENVELOPE_SAVE_COMPARISONS
-      else
-        set_data_by_comparison_result(original_trg, cur_part_res);
+      else set_data_by_comparison_result(original_trg, cur_part_res);
 #endif
     }
-
   }
 
   // get a vertex with 2 surfaces defined over it and decide the envelope data
   // on it between them
-  void resolve(Vertex_handle vertex)
-  {
+  void resolve(Vertex_handle vertex) {
     // it is enough to compare only one surface from each group (because they
     // all overlap over the vertex), but set all the group
     const Xy_monotone_surface_3& surf1 = get_aux_surface(vertex, 0);
@@ -768,8 +704,7 @@ class Envelope_element_visitor_3
   // visitor.
   Vertex_handle insert_point(Minimization_diagram_2& arr, const Point_2& p,
                              const Md_point_location& pl,
-                             Copied_face_zone_visitor& visitor)
-  {
+                             Copied_face_zone_visitor& visitor) {
     const Face_const_handle* fh;
     const Halfedge_const_handle* hh;
     const Vertex_const_handle* vh;
@@ -778,17 +713,13 @@ class Envelope_element_visitor_3
     auto obj = pl.locate(p);
     visitor.init(&arr);
 
-    if ((fh = std::get_if<Face_const_handle>(&obj))
-        != nullptr)
-    {
+    if ((fh = std::get_if<Face_const_handle>(&obj)) != nullptr) {
       vh_for_p = visitor.found_point_in_face(p, arr.non_const_handle(*fh));
     }
-    else if ((hh = std::get_if<Halfedge_const_handle>(&obj)))
-    {
+    else if ((hh = std::get_if<Halfedge_const_handle>(&obj))) {
       vh_for_p = visitor.found_point_on_edge(p , arr.non_const_handle(*hh));
     }
-    else
-    {
+    else {
       // In this case p lies on an existing vertex, so we just update this
       // vertex.
       vh = std::get_if<Vertex_const_handle>(&obj);
@@ -797,11 +728,10 @@ class Envelope_element_visitor_3
     }
 
     // Return a handle for the vertex associated with p.
-    return (vh_for_p);
+    return vh_for_p;
 
   }
 
-
   // compute Comparison_result of surfaces over the face, assuming they get
   // the same answer for all points in face
   // if we get a halfedge, it is assumed to be on the outer boundary of the
@@ -813,8 +743,7 @@ class Envelope_element_visitor_3
   // In either case, we try to copy decision from an incident face, is possible
   // before asking the geometric question
   Comparison_result resolve_minimal_face(Face_handle face,
-                                         Halfedge_handle* he = nullptr)
-  {
+                                         Halfedge_handle* he = nullptr) {
     CGAL_precondition(he == nullptr || (*he)->face() == face);
     Comparison_result res = EQUAL;
 
@@ -823,53 +752,43 @@ class Envelope_element_visitor_3
     success = can_copy_decision_from_boundary_edge(face, res);
 #endif
 
-    if (success)
-      return res;
+    if (success) return res;
 
     const Xy_monotone_surface_3& surf1 = get_aux_surface(face, 0);
     const Xy_monotone_surface_3& surf2 = get_aux_surface(face, 1);
 
     Ccb_halfedge_circulator hec;
-    if (he == nullptr)
-    {
+    if (he == nullptr) {
       // compare the surfaces over arbitrary edge
       bool found_edge = false;
       Outer_ccb_iterator outer_ccb = face->outer_ccbs_begin();
-      for (; outer_ccb != face->outer_ccbs_end() && !found_edge; ++outer_ccb)
-      {
+      for (; outer_ccb != face->outer_ccbs_end() && !found_edge; ++outer_ccb) {
         hec = *outer_ccb;
         Ccb_halfedge_circulator curr = hec;
-        do
-        {
+        do {
           Halfedge_handle he = hec;
-          if(he->is_fictitious())
-            ++hec;
-          else
-          {
+          if(he->is_fictitious()) ++hec;
+          else {
             found_edge = true;
             const X_monotone_curve_2& cv = hec->curve();
             res = compare_distance_to_envelope(cv,surf1,surf2);
-
             break;
           }
         }
         while(curr != hec);
       }
 
-      if(!found_edge)
-      {
+      if (! found_edge) {
         // all edges are fictitous, we have two infinite surfaces.
         // but still, there can be holes.
-        if(face->inner_ccbs_begin() != face->inner_ccbs_end())
-        {
+        if (face->inner_ccbs_begin() != face->inner_ccbs_end()) {
           Inner_ccb_iterator hit = face->inner_ccbs_begin();
           hec = *hit;
           CGAL_assertion(!hec->is_fictitious());
           const X_monotone_curve_2& cv = hec->curve();
           res = compare_distance_to_envelope(cv, surf1, surf2);
         }
-        else
-        {
+        else {
           //two infinite surfaces, no outer boundary or holes.
           res =
             compare_distance_to_envelope(surf1, surf2,
@@ -898,25 +817,20 @@ class Envelope_element_visitor_3
       //assertion code end
       return res;
     }
-    else
-    {
+    else {
       // compare the surfaces over the halfedge's curve
       const X_monotone_curve_2& cv = (*he)->curve();
 
       // a face is always to the left of its halfedge
       // we use HE_COMP_RES so this code can compile both with Arr_2
       // and with Aos_2.
-      if (HE_COMP_RES(*he) == SMALLER)
-      {
+      if (HE_COMP_RES(*he) == SMALLER) {
         res = m_traits->compare_z_at_xy_above_3_object()(cv,surf1,surf2);
-        if(type == ENVELOPE_UPPER)
-          res = CGAL::opposite(res);
+        if (type == ENVELOPE_UPPER) res = CGAL::opposite(res);
       }
-      else
-      {
+      else {
         res = m_traits->compare_z_at_xy_below_3_object()(cv,surf1,surf2);
-        if(type == ENVELOPE_UPPER)
-          res = CGAL::opposite(res);
+        if (type == ENVELOPE_UPPER) res = CGAL::opposite(res);
 
       }
     }
@@ -927,24 +841,17 @@ class Envelope_element_visitor_3
   // comparison result of the other side of the intersection curve,
   // if the first side has result "res"
   Comparison_result resolve_by_intersection_type(Comparison_result res,
-                                                 Multiplicity itype)
-  {
+                                                 Multiplicity itype) {
     itype %= 2;
-    if (itype == 1)
-    {
-      if (res == LARGER)
-        return SMALLER;
-      else if (res == SMALLER)
-        return LARGER;
-      else
-        return res;
+    if (itype == 1) {
+      if (res == LARGER) return SMALLER;
+      else if (res == SMALLER) return LARGER;
+      else return res;
     }
-    else
-    {
+    else {
       CGAL_assertion(itype == 0);
       return res;
     }
-
   }
 
   // find intersections between 2 xy-monotone surfaces
@@ -952,8 +859,7 @@ class Envelope_element_visitor_3
   template <typename OutputIterator>
   OutputIterator get_projected_intersections(const Xy_monotone_surface_3& s1,
                                              const Xy_monotone_surface_3& s2,
-                                             OutputIterator o)
-  {
+                                             OutputIterator o) {
     return m_traits->construct_projected_intersections_2_object()(s1, s2, o);
   }
 
@@ -962,8 +868,7 @@ class Envelope_element_visitor_3
   Comparison_result
   compare_distance_to_envelope(Geometry& g,
                                const Xy_monotone_surface_3& s1,
-                               const Xy_monotone_surface_3& s2)
-  {
+                               const Xy_monotone_surface_3& s2) {
     Comparison_result res = m_traits->compare_z_at_xy_3_object()(g, s1, s2);
     return ((type == ENVELOPE_LOWER) ? res : CGAL::opposite(res));
   }
@@ -973,8 +878,7 @@ class Envelope_element_visitor_3
   Comparison_result
   compare_distance_to_envelope(const Xy_monotone_surface_3& s1,
                                const Xy_monotone_surface_3& s2,
-                               Arr_not_all_sides_oblivious_tag)
-  {
+                               Arr_not_all_sides_oblivious_tag) {
     Comparison_result res = m_traits->compare_z_at_xy_3_object()(s1, s2);
     return ((type == ENVELOPE_LOWER) ? res : CGAL::opposite(res));
   }
@@ -982,8 +886,7 @@ class Envelope_element_visitor_3
   // compare two infinite surfaces with no boundary or holes
   Comparison_result compare_distance_to_envelope(const Xy_monotone_surface_3&,
                                                  const Xy_monotone_surface_3&,
-                                                 Arr_all_sides_oblivious_tag)
-  {
+                                                 Arr_all_sides_oblivious_tag) {
     CGAL_error(); // doesn't suppose to reach here at all!!!
     return SMALLER;
   }
@@ -991,8 +894,7 @@ class Envelope_element_visitor_3
   // helper method to get the surfaces we need to work on
   template <typename FeatureHandle>
   const Xy_monotone_surface_3& get_aux_surface(FeatureHandle fh,
-                                               unsigned int id)
-  {
+                                               unsigned int id) {
     const Object& o = fh->get_aux_source(id);
     CGAL_assertion(!o.is_empty());
 
@@ -1002,30 +904,26 @@ class Envelope_element_visitor_3
     // this is why we start with a check for a face, then halfedge
     // and last vertex
     Face_handle f;
-    if (assign(f, o))
-      return f->get_data();
+    if (assign(f, o)) return f->get_env_data();
 
     Halfedge_handle h;
-    if (assign(h, o))
-      return h->get_data();
+    if (assign(h, o)) return h->get_env_data();
 
     Vertex_handle v;
     CGAL_assertion_code(bool b =)
-      assign(v, o);
+    assign(v, o);
     CGAL_assertion(b);
-    return v->get_data();
+    return v->get_env_data();
   }
 
-  bool can_copy_decision_from_face_to_edge(Halfedge_handle h)
-  {
+  bool can_copy_decision_from_face_to_edge(Halfedge_handle h) {
     // can copy decision from face to its incident edge if the aux
     // envelopes are continuous over the face and edge
     return (h->get_has_equal_aux_data_in_face(0) &&
             h->get_has_equal_aux_data_in_face(1));
   }
 
-  bool can_copy_decision_from_edge_to_vertex(Halfedge_handle h)
-  {
+  bool can_copy_decision_from_edge_to_vertex(Halfedge_handle h) {
     // can copy decision from face to its incident edge if the aux
     // envelopes are continuous over the face and edge
     return (h->get_has_equal_aux_data_in_target(0) &&
@@ -1038,29 +936,25 @@ class Envelope_element_visitor_3
   // these features later
   // also consider isolated vertices
   // "res" is the decision made on the face
-  void copy_data_to_face_boundary(Face_handle face)
-  {
+  void copy_data_to_face_boundary(Face_handle face) {
     Ccb_halfedge_circulator ccb;
 
-    Outer_ccb_iterator outer_iter = face->outer_ccbs_begin();
-    for (; outer_iter != face->outer_ccbs_end(); ++outer_iter)
-    {
+    for (auto outer_iter = face->outer_ccbs_begin();
+         outer_iter != face->outer_ccbs_end(); ++outer_iter) {
       ccb = *outer_iter;
       copy_data_to_face_boundary(face, ccb);
     }
 
-    Inner_ccb_iterator inner_iter = face->inner_ccbs_begin();
-    for (; inner_iter != face->inner_ccbs_end(); ++inner_iter)
-    {
+    for (auto inner_iter = face->inner_ccbs_begin();
+         inner_iter != face->inner_ccbs_end(); ++inner_iter) {
       ccb = (*inner_iter);
       copy_data_to_face_boundary(face, ccb);
     }
 
-    Isolated_vertex_iterator iso_iter = face->isolated_vertices_begin();
-    for (; iso_iter != face->isolated_vertices_end(); ++iso_iter)
-    {
+    for (auto iso_iter = face->isolated_vertices_begin();
+         iso_iter != face->isolated_vertices_end(); ++iso_iter) {
       Vertex_handle vh = iso_iter;
-      if (!vh->is_decision_set() && has_equal_aux_data_with_face(vh))
+      if (! vh->is_decision_set() && has_equal_aux_data_with_face(vh))
         // can copy the data from the face, since we already took care of
         // the vertices of projected intersections
         vh->set_decision(face->get_decision());
@@ -1068,13 +962,11 @@ class Envelope_element_visitor_3
   }
 
   void copy_data_to_face_boundary(Face_handle face,
-                                  Ccb_halfedge_circulator hec)
-  {
+                                  Ccb_halfedge_circulator hec) {
     Ccb_halfedge_circulator hec_begin = hec;
     do {
       Halfedge_handle hh = hec;
-      if(hh->is_fictitious())
-      {
+      if (hh->is_fictitious()) {
         ++hec;
         continue;
       }
@@ -1085,8 +977,7 @@ class Envelope_element_visitor_3
         hh->set_decision(face->get_decision());
         hh->twin()->set_decision(face->get_decision());
         }*/
-      if (!hh->is_decision_set() && can_copy_decision_from_face_to_edge(hh))
-      {
+      if (! hh->is_decision_set() && can_copy_decision_from_face_to_edge(hh)) {
         // copy the decision from face to the edge
         hh->set_decision(face->get_decision());
         hh->twin()->set_decision(hh->get_decision());
@@ -1100,22 +991,20 @@ class Envelope_element_visitor_3
       // if the first map is continuous, but the second isn't (i.e. when we move
       // from the face to the edge, the envelope goes closer), then if the
       // second map wins on the face, it wins on the edge also
-      else if (!hh->is_decision_set() &&
+      else if (! hh->is_decision_set() &&
                face->get_decision() == DAC_DECISION_SECOND &&
                hh->get_has_equal_aux_data_in_face(0) &&
-               !hh->get_has_equal_aux_data_in_face(1))
-      {
+               ! hh->get_has_equal_aux_data_in_face(1)) {
         hh->set_decision(DAC_DECISION_SECOND);
         hh->twin()->set_decision(DAC_DECISION_SECOND);
 
       }
       // if the second map is continuous, but the first isn't, then if the
       // first map wins on the face, it wins on the edge also
-      else if (!hh->is_decision_set() &&
+      else if (! hh->is_decision_set() &&
                face->get_decision() == DAC_DECISION_FIRST &&
-               !hh->get_has_equal_aux_data_in_face(0) &&
-               hh->get_has_equal_aux_data_in_face(1))
-      {
+               ! hh->get_has_equal_aux_data_in_face(0) &&
+               hh->get_has_equal_aux_data_in_face(1)) {
         hh->set_decision(DAC_DECISION_FIRST);
         hh->twin()->set_decision(DAC_DECISION_FIRST);
       }
@@ -1136,45 +1025,35 @@ class Envelope_element_visitor_3
   // the last bool indicates whether to check if possible to conclude from
   // face to vertex. it is only possible when hh->face == fh
   void conclude_decision_to_vertex(Vertex_handle vh, Halfedge_handle hh,
-                                   Face_handle fh, bool try_vertex_face)
-  {
-    if (vh->is_decision_set())
-      return;
+                                   Face_handle fh, bool try_vertex_face) {
+    if (vh->is_decision_set()) return;
 
-
-    // first, we try to copy decision from edge, then from face
-    if (hh->is_decision_set() &&
-        can_copy_decision_from_edge_to_vertex(hh))
-    {
+// first, we try to copy decision from edge, then from face
+    if (hh->is_decision_set() && can_copy_decision_from_edge_to_vertex(hh))
       vh->set_decision(hh->get_decision());
-    }
+
     // if the first map is continuous, but the second isn't (i.e. when we move
     // from the edge to the vertex, the envelope goes closer), then if the
     // second map wins on the edge, it wins on the vertex also
     else if (hh->get_decision() == DAC_DECISION_SECOND &&
              hh->get_has_equal_aux_data_in_target(0) &&
-             !hh->get_has_equal_aux_data_in_target(1))
-    {
+             ! hh->get_has_equal_aux_data_in_target(1))
       vh->set_decision(DAC_DECISION_SECOND);
-    }
+
     // if the second map is continuous, but the first isn't, then if the
     // first map wins on the edge, it wins on the vertex also
     else if (hh->get_decision() == DAC_DECISION_FIRST &&
-             !hh->get_has_equal_aux_data_in_target(0) &&
+             ! hh->get_has_equal_aux_data_in_target(0) &&
              hh->get_has_equal_aux_data_in_target(1))
-    {
       vh->set_decision(DAC_DECISION_FIRST);
-    }
+
     // check if we can copy from the face
     // todo: what if has_equal has 3 possible values? (and projected
     // ersection vertices have unknown flags)
-    else if (try_vertex_face)
-    {
+    else if (try_vertex_face) {
       /*CGAL_assertion(has_equal_aux_data_in_target_and_face(hh) ==
         has_equal_aux_data(vh, fh));*/
-      if (has_equal_aux_data_in_target_and_face(hh))
-      {
-
+      if (has_equal_aux_data_in_target_and_face(hh)) {
         // can copy the data from the face, since we already took care of
         // the vertices of projected intersections
         vh->set_decision(fh->get_decision());
@@ -1184,11 +1063,8 @@ class Envelope_element_visitor_3
 
   // todo: this is for checking
   template <typename InputIterator>
-  bool has_equal_data(const InputIterator& begin1,
-                      const InputIterator& end1,
-                      const InputIterator& begin2,
-                      const InputIterator& end2)
-  {
+  bool has_equal_data(const InputIterator& begin1, const InputIterator& end1,
+                      const InputIterator& begin2, const InputIterator& end2) {
     // insert the input data objects into a set
     std::set<Xy_monotone_surface_3> first(begin1, end1);
     std::set<Xy_monotone_surface_3> second(begin2, end2);
@@ -1199,12 +1075,12 @@ class Envelope_element_visitor_3
 
     return (intersection.size() > 0);
   }
+
   // todo: this is for checking
   template <typename FeatureHandle>
   void get_aux_data_iterators(unsigned int id, FeatureHandle fh,
                               Envelope_data_iterator& begin,
-                              Envelope_data_iterator& end)
-  {
+                              Envelope_data_iterator& end) {
     Halfedge_handle h;
     Vertex_handle v;
     Face_handle f;
@@ -1212,18 +1088,15 @@ class Envelope_element_visitor_3
     const Object& o = fh->get_aux_source(id);
     CGAL_assertion(!o.is_empty());
 
-    if (assign(v, o))
-    {
+    if (assign(v, o)) {
       begin = v->begin_data();
       end = v->end_data();
     }
-    else if (assign(h, o))
-    {
+    else if (assign(h, o)) {
       begin = h->begin_data();
       end = h->end_data();
     }
-    else
-    {
+    else {
       CGAL_assertion(assign(f, o));
       assign(f, o);
       begin = f->begin_data();
@@ -1234,8 +1107,7 @@ class Envelope_element_visitor_3
   // todo: this is for checking
   template <typename FeatureHandle1, typename FeatureHandle2>
   bool has_equal_aux_data(unsigned int id, FeatureHandle1 fh1,
-                          FeatureHandle2 fh2)
-  {
+                          FeatureHandle2 fh2) {
     Envelope_data_iterator begin1, end1, begin2, end2;
     get_aux_data_iterators(id, fh1, begin1, end1);
     get_aux_data_iterators(id, fh2, begin2, end2);
@@ -1245,8 +1117,7 @@ class Envelope_element_visitor_3
 
   // todo: this is for checking
   template <typename FeatureHandle1, typename FeatureHandle2>
-  bool has_equal_aux_data(FeatureHandle1 fh1, FeatureHandle2 fh2)
-  {
+  bool has_equal_aux_data(FeatureHandle1 fh1, FeatureHandle2 fh2) {
     return (has_equal_aux_data(0, fh1, fh2) &&
             has_equal_aux_data(1, fh1, fh2));
   }
@@ -1255,31 +1126,25 @@ class Envelope_element_visitor_3
   // check if we can copy the decision made on a boundary edge to the face
   // if so, res will contain this decision's comparison result
   bool can_copy_decision_from_boundary_edge(Face_handle face,
-                                            Comparison_result& res)
-  {
+                                            Comparison_result& res) {
     bool result = false;
     // check outer boundary
     Ccb_halfedge_circulator hec, hec_begin;
 
     // check outer boundary
     Outer_ccb_iterator outer_ccb = face->outer_ccbs_begin();
-    for (; outer_ccb != face->outer_ccbs_end(); ++outer_ccb)
-    {
+    for (; outer_ccb != face->outer_ccbs_end(); ++outer_ccb) {
       hec = *outer_ccb;
       hec_begin = hec;
-      do
-      {
+      do {
         Halfedge_handle hh = hec;
-        if(hh->is_fictitious())
-        {
+        if(hh->is_fictitious()) {
           ++hec;
           continue;
         }
         if (can_copy_decision_from_face_to_edge(hh) &&
-
             hh->is_decision_set() &&
-            hh->get_decision() != DAC_DECISION_BOTH)
-        {
+            hh->get_decision() != DAC_DECISION_BOTH) {
           res = convert_decision_to_comparison_result(hh->get_decision());
           result = true;
         }
@@ -1289,8 +1154,7 @@ class Envelope_element_visitor_3
         else if (hh->is_decision_set() &&
                  hh->get_decision() == DAC_DECISION_FIRST &&
                  hh->get_has_equal_aux_data_in_face(0) &&
-                 !hh->get_has_equal_aux_data_in_face(1))
-        {
+                 ! hh->get_has_equal_aux_data_in_face(1)) {
           res = convert_decision_to_comparison_result(DAC_DECISION_FIRST);
           result = true;
         }
@@ -1299,21 +1163,18 @@ class Envelope_element_visitor_3
         else if (hh->is_decision_set() &&
                  hh->get_decision() == DAC_DECISION_SECOND &&
                  !hh->get_has_equal_aux_data_in_face(0) &&
-                 hh->get_has_equal_aux_data_in_face(1))
-        {
+                 hh->get_has_equal_aux_data_in_face(1)) {
           res = convert_decision_to_comparison_result(DAC_DECISION_SECOND);
           result = true;
         }
         hec++;
       } while(hec != hec_begin && !result);
-      if (result)
-        return true;
+      if (result) return true;
     }
 
     // check inner boundaries
-    Inner_ccb_iterator hole_iter = face->inner_ccbs_begin();
-    for (; hole_iter != face->inner_ccbs_end(); ++hole_iter)
-    {
+    for (auto hole_iter = face->inner_ccbs_begin();
+         hole_iter != face->inner_ccbs_end(); ++hole_iter) {
       hec = (*hole_iter);
       hec_begin = hec;
 
@@ -1321,8 +1182,7 @@ class Envelope_element_visitor_3
         Halfedge_handle hh = hec;
         if (can_copy_decision_from_face_to_edge(hh) &&
             hh->is_decision_set() &&
-            hh->get_decision() != DAC_DECISION_BOTH)
-        {
+            hh->get_decision() != DAC_DECISION_BOTH) {
           res = convert_decision_to_comparison_result(hh->get_decision());
           result = true;
         }
@@ -1332,8 +1192,7 @@ class Envelope_element_visitor_3
         else if (hh->is_decision_set() &&
                  hh->get_decision() == DAC_DECISION_FIRST &&
                  hh->get_has_equal_aux_data_in_face(0) &&
-                 !hh->get_has_equal_aux_data_in_face(1))
-        {
+                 ! hh->get_has_equal_aux_data_in_face(1)) {
           res = convert_decision_to_comparison_result(DAC_DECISION_FIRST);
 
           result = true;
@@ -1342,9 +1201,8 @@ class Envelope_element_visitor_3
         // second map wins on the edge, it wins on the face also
         else if (hh->is_decision_set() &&
                  hh->get_decision() == DAC_DECISION_SECOND &&
-                 !hh->get_has_equal_aux_data_in_face(0) &&
-                 hh->get_has_equal_aux_data_in_face(1))
-        {
+                 ! hh->get_has_equal_aux_data_in_face(0) &&
+                 hh->get_has_equal_aux_data_in_face(1)) {
           res = convert_decision_to_comparison_result(DAC_DECISION_SECOND);
           result = true;
         }
@@ -1368,15 +1226,13 @@ class Envelope_element_visitor_3
       return EQUAL;*/
   }
 
-  bool has_equal_aux_data_with_face(Vertex_handle v)
-  {
+  bool has_equal_aux_data_with_face(Vertex_handle v) {
     CGAL_assertion(v->is_isolated());
     return (v->get_has_equal_aux_data_in_face(0) &&
             v->get_has_equal_aux_data_in_face(1));
   }
 
-  bool has_equal_aux_data_in_target_and_face(Halfedge_handle h)
-  {
+  bool has_equal_aux_data_in_target_and_face(Halfedge_handle h) {
     return (h->get_has_equal_aux_data_in_target_and_face(0) &&
             h->get_has_equal_aux_data_in_target_and_face(1));
   }
@@ -1384,10 +1240,9 @@ class Envelope_element_visitor_3
   // check the aux data on the endpoint vertices of the edge
   // and if it equals the aux data on the edge, copy it, to save calculations
   // for these features later
-  void copy_data_to_edge_endpoints(Halfedge_handle edge)
-  {
+  void copy_data_to_edge_endpoints(Halfedge_handle edge) {
     // take care for source
-    if (!edge->source()->is_decision_set() &&
+    if (! edge->source()->is_decision_set() &&
         can_copy_decision_from_edge_to_vertex(edge->twin()))
       // can copy the data from the edge, since we already took care of
       // the vertices of projected intersections
@@ -1397,16 +1252,14 @@ class Envelope_element_visitor_3
     // second map wins on the edge, it wins on the vertex also
     else if (edge->get_decision() == DAC_DECISION_SECOND &&
              edge->twin()->get_has_equal_aux_data_in_target(0) &&
-             !edge->twin()->get_has_equal_aux_data_in_target(1))
-    {
+             !edge->twin()->get_has_equal_aux_data_in_target(1)) {
       edge->source()->set_decision(DAC_DECISION_SECOND);
     }
     // if the second map is continuous, but the first isn't, then if the
     // first map wins on the edge, it wins on the vertex also
     else if (edge->get_decision() == DAC_DECISION_FIRST &&
              !edge->twin()->get_has_equal_aux_data_in_target(0) &&
-             edge->twin()->get_has_equal_aux_data_in_target(1))
-    {
+             edge->twin()->get_has_equal_aux_data_in_target(1)) {
       edge->source()->set_decision(DAC_DECISION_FIRST);
     }
 
@@ -1421,16 +1274,14 @@ class Envelope_element_visitor_3
     // second map wins on the edge, it wins on the vertex also
     else if (edge->get_decision() == DAC_DECISION_SECOND &&
              edge->get_has_equal_aux_data_in_target(0) &&
-             !edge->get_has_equal_aux_data_in_target(1))
-    {
+             !edge->get_has_equal_aux_data_in_target(1)) {
       edge->target()->set_decision(DAC_DECISION_SECOND);
     }
     // if the second map is continuous, but the first isn't, then if the
     // first map wins on the edge, it wins on the vertex also
     else if (edge->get_decision() == DAC_DECISION_FIRST &&
              !edge->get_has_equal_aux_data_in_target(0) &&
-             edge->get_has_equal_aux_data_in_target(1))
-    {
+             edge->get_has_equal_aux_data_in_target(1)) {
       edge->target()->set_decision(DAC_DECISION_FIRST);
     }
   }
@@ -1439,10 +1290,9 @@ class Envelope_element_visitor_3
   // bounded traits.
   template <typename Halfedge_handle>
   Vertex_handle create_copied_vertex(Halfedge_handle hh,
-                                     Md_accessor &to_accessor,
+                                     Md_accessor& to_accessor,
                                      bool source,
-                                     Arr_all_sides_oblivious_tag)
-  {
+                                     Arr_all_sides_oblivious_tag) {
     // create the 2 vertices and connect them with the edge
     // copied_prev_he should be directed from copied_source to copied_target
     Point_2* p_p =
@@ -1458,12 +1308,9 @@ class Envelope_element_visitor_3
   Vertex_handle create_copied_vertex(Halfedge_handle hh,
                                      Md_accessor& to_accessor,
                                      bool source,
-                                     Arr_not_all_sides_oblivious_tag)
-  {
-    typename Traits::Parameter_space_in_x_2 ps_x_op =
-      this->m_traits->parameter_space_in_x_2_object ();
-    typename Traits::Parameter_space_in_y_2 ps_y_op =
-      this->m_traits->parameter_space_in_y_2_object ();
+                                     Arr_not_all_sides_oblivious_tag) {
+    auto ps_x_op = this->m_traits->parameter_space_in_x_2_object ();
+    auto ps_y_op = this->m_traits->parameter_space_in_y_2_object ();
 
     bool is_directed_right = hh->direction() == ARR_LEFT_TO_RIGHT;
 
@@ -1477,8 +1324,7 @@ class Envelope_element_visitor_3
     if (ps_x != ARR_INTERIOR || ps_y != ARR_INTERIOR)
       return to_accessor.create_boundary_vertex(hh->curve(), ind, ps_x, ps_y,
                                                 true);
-    else
-    {
+    else {
       // create the 2 vertices and connect them with the edge
       // copied_prev_he should be directed from copied_source to copied_target
       Point_2* p_p =
@@ -1500,7 +1346,6 @@ class Envelope_element_visitor_3
                 Halfedges_map& map_orig_to_copied_halfedges,
                 Vertices_map&  map_orig_to_copied_vertices,
                 bool is_outer_ccb) // do we copy an outer (or inner) ccb
-
   {
     Md_accessor to_accessor(to);
     // count the number of faces that are closed by this ccb
@@ -1511,22 +1356,18 @@ class Envelope_element_visitor_3
     Ccb_halfedge_circulator hec_begin = hec;
     bool first_he = true;
     Halfedge_handle copied_prev_he;
-    do
-    {
+    do {
       Halfedge_handle hh = hec;
 
       if (hh->twin()->face() == hh->face() &&
-          map_orig_to_copied_halfedges.is_defined(hh))
-      {
+          map_orig_to_copied_halfedges.is_defined(hh)) {
         // this can happen in the case of antennas, when we get to the same
         // antena halfedge from the other side
         copied_prev_he = map_orig_to_copied_halfedges[hh];
       }
-      else
-      {
+      else {
         const X_monotone_curve_2& current_cv = hh->curve();
-        if (first_he)
-        {
+        if (first_he) {
           first_he = false;
 
           // create the 2 vertices and connect them with the edge
@@ -1556,8 +1397,7 @@ class Envelope_element_visitor_3
           map_copied_to_orig_vertices[copied_prev_he->target()] = hh->target();
           map_orig_to_copied_vertices[hh->target()] = copied_prev_he->target();
         }
-        else
-        {
+        else {
           CGAL_assertion(map_copied_to_orig_halfedges[copied_prev_he]->target()
                          == hh->source());
 
@@ -1566,15 +1406,13 @@ class Envelope_element_visitor_3
           // in which case we should use insert at vertices
           bool use_2_vertices = false;
           Vertex_handle copied_v2;
-          if (map_orig_to_copied_vertices.is_defined(hh->target()))
-          {
+          if (map_orig_to_copied_vertices.is_defined(hh->target())) {
             use_2_vertices = true;
             copied_v2 = map_orig_to_copied_vertices[hh->target()];
           }
 
           Halfedge_handle copied_new_he;
-          if (!use_2_vertices)
-          {
+          if (! use_2_vertices) {
             // create vertex for the new target, and insert the new edge
             Vertex_handle copied_target =
               create_copied_vertex(hh, to_accessor, false,
@@ -1595,8 +1433,7 @@ class Envelope_element_visitor_3
             map_copied_to_orig_vertices[copied_new_he->target()] = hh->target();
             map_orig_to_copied_vertices[hh->target()] = copied_new_he->target();
           }
-          else
-          {
+          else {
             ++n_faces_closed;
 
             // in order to insert the new edge we should determine the prev
@@ -1624,8 +1461,7 @@ class Envelope_element_visitor_3
               // degeneracies (around the current vertices, at least)
               // so we can use the accessor method
               if (n_faces_closed == 1 &&
-                  map_orig_to_copied_halfedges.is_defined(hh->next()))
-              {
+                  map_orig_to_copied_halfedges.is_defined(hh->next())) {
                 bool dummy_swapped_predecessors = false;
                 copied_new_he = to_accessor.insert_at_vertices_ex
                   (copied_prev_he,
@@ -1638,8 +1474,7 @@ class Envelope_element_visitor_3
 
                 CGAL_assertion(new_face);
               }
-              else
-              {
+              else {
                 // TODO:can we use accessor method?
                 copied_new_he = to.insert_at_vertices(current_cv,
                                                       copied_prev_he,
@@ -1650,8 +1485,8 @@ class Envelope_element_visitor_3
               // (we should be careful in cases where more than one face is
               // created by the outer ccb
             }
-            else // copy inner boundary
-            {
+            else {
+              // copy inner boundary
               // should always flip the side of the edge, because the face
               // that we close is never the copied face, even in strane
               // situations like this: (two faces touch in a vertex)
@@ -1698,16 +1533,13 @@ class Envelope_element_visitor_3
                           Halfedges_map& map_copied_to_orig_halfedges,
                           Vertices_map&  map_copied_to_orig_vertices,
                           Halfedges_map& map_orig_to_copied_halfedges,
-                          Vertices_map&  map_orig_to_copied_vertices)
-  {
+                          Vertices_map&  map_orig_to_copied_vertices) {
     // Find a non-fictitous edge (if there is such one) on the CCB.
-    Ccb_halfedge_circulator  hec_end = hec;
-    Halfedge_handle          non_fict;
+    Ccb_halfedge_circulator hec_end = hec;
+    Halfedge_handle non_fict;
 
-    do
-    {
-      if(!hec->is_fictitious())
-      {
+    do {
+      if (! hec->is_fictitious()) {
         non_fict = hec;
         break;
       }
@@ -1716,13 +1548,12 @@ class Envelope_element_visitor_3
 
     // Find an anchor halfedge he_from along the original CCB and locate
     // its image he_to in the target CCB.
-    Md_accessor      from_accessor (from);
-    Md_accessor      to_accessor (to);
-    Halfedge_handle  he_from;
-    Halfedge_handle  he_to;
+    Md_accessor from_accessor (from);
+    Md_accessor to_accessor (to);
+    Halfedge_handle he_from;
+    Halfedge_handle he_to;
 
-    if (non_fict == Halfedge_handle())
-    {
+    if (non_fict == Halfedge_handle()) {
       // In case all edges along the CCB are fictitious, this outer CCB
       // belongs to the single unbounded face in the arrangement (as it
       // contains no unbounded curves at current). In this case, we go
@@ -1732,21 +1563,19 @@ class Envelope_element_visitor_3
       CGAL_assertion_msg
         ((to.number_of_faces() != 0),
          "if all halfedges are fictitious then there should be only one face");
-      Face_handle              to_uf = to.faces_begin();
-      Ccb_halfedge_circulator  to_uf_hec = to_uf->outer_ccb();
+      Face_handle to_uf = to.faces_begin();
+      Ccb_halfedge_circulator to_uf_hec = to_uf->outer_ccb();
 
       he_from = hec;
 
       he_to = to_uf_hec;
       while (he_to->direction() != he_from->direction() ||
-             he_to->next()->direction() != he_from->next()->direction())
-      {
+             he_to->next()->direction() != he_from->next()->direction()) {
         he_to = he_to->next();
         CGAL_assertion (he_to != to_uf_hec);
       }
     }
-    else
-    {
+    else {
       // Use the non-fictitious halfedge as an "anchor": Insert its associated
       // curve into the target arrangement, and keep track of the halfedge we
       // obtained.
@@ -1758,11 +1587,10 @@ class Envelope_element_visitor_3
 
       // Go over all other halfedges along the copied CCB, and store all
       // curves associated with non-fictitious halfedges.
-      Halfedge_handle                 he;
-      std::list<X_monotone_curve_2>   xcvs;
+      Halfedge_handle he;
+      std::list<X_monotone_curve_2> xcvs;
 
-      for (he = he_from->next(); he != he_from; he = he->next())
-      {
+      for (he = he_from->next(); he != he_from; he = he->next()) {
         if (! he->is_fictitious())
           xcvs.push_back (he->curve());
       }
@@ -1776,10 +1604,9 @@ class Envelope_element_visitor_3
     // Map the halfedges and vertices along the two CCBs.
     // Note that we make sure that the two CCBs are of the same size.
     const Halfedge_handle   he_from_end = he_from;
-    CGAL_assertion_code(const Halfedge_handle   he_to_end = he_to;);
+    CGAL_assertion_code(const Halfedge_handle he_to_end = he_to;);
 
-    do
-    {
+    do {
       map_copied_to_orig_vertices[he_to->source()] = he_from->source();
       map_orig_to_copied_vertices[he_from->source()] = he_to->source();
 
@@ -1802,8 +1629,7 @@ class Envelope_element_visitor_3
   Face_handle copy_face(Face_handle face, Minimization_diagram_2& from,
                         Minimization_diagram_2& to,
                         Halfedges_map& map_copied_to_orig_halfedges,
-                        Vertices_map&  map_copied_to_orig_vertices)
-  {
+                        Vertices_map&  map_copied_to_orig_vertices) {
     CGAL_precondition(from.is_valid());
     CGAL_precondition(to.is_empty());
     CGAL_assertion_msg(to.number_of_faces() == 1,
@@ -1813,27 +1639,24 @@ class Envelope_element_visitor_3
     // ones in the copied arrangement. Also keep track of the unbounded face
     // of the copied arrangement: Note that if the face we copy is bounded,
     // then it forms a hole in the unbounded face.
-    Vertices_map  map_orig_to_copied_vertices;
+    Vertices_map map_orig_to_copied_vertices;
     Halfedges_map map_orig_to_copied_halfedges;
-    Face_handle   to_uf = to.faces_begin();
+    Face_handle to_uf = to.faces_begin();
 
     // Copy outer CCB of the face, if it has one.
-    Face_handle     copied_face;
+    Face_handle copied_face;
 
-    if (face->number_of_outer_ccbs() > 0)
-    {
+    if (face->number_of_outer_ccbs() > 0) {
       Ccb_halfedge_circulator  hec = face->outer_ccb();
 
-      if (face->is_unbounded())
-      {
+      if (face->is_unbounded()) {
         copy_ccb_unbounded(hec, from, to,
                            map_copied_to_orig_halfedges,
                            map_copied_to_orig_vertices,
                            map_orig_to_copied_halfedges,
                            map_orig_to_copied_vertices);
       }
-      else
-      {
+      else {
         copy_ccb(hec, from, to_uf, to,
                  map_copied_to_orig_halfedges,
                  map_copied_to_orig_vertices,
@@ -1850,17 +1673,15 @@ class Envelope_element_visitor_3
 
       copied_face = hec_to->face();
     }
-    else
-    {
+    else {
       // In case the copied face has no outer CCB, then it must be the
       // single unbounded face of the arrangement.
       copied_face = to_uf;
     }
 
     // Copy the inner CCB (the holes inside the face).
-    Inner_ccb_iterator  iccb_it = face->inner_ccbs_begin();
-    for (; iccb_it != face->inner_ccbs_end(); ++iccb_it)
-    {
+    for (auto iccb_it = face->inner_ccbs_begin();
+         iccb_it != face->inner_ccbs_end(); ++iccb_it) {
       Ccb_halfedge_circulator  he = *iccb_it;
 
       copy_ccb(he, from, copied_face, to,
@@ -1873,11 +1694,10 @@ class Envelope_element_visitor_3
     }
 
     // Copy the isolated vertices inside the given face.
-    Isolated_vertex_iterator    iv_it = face->isolated_vertices_begin();
-    for (; iv_it != face->isolated_vertices_end(); ++iv_it)
-    {
-      Vertex_handle     iso_v = iv_it;
-      Vertex_handle     copied_iso =
+    for (auto iv_it = face->isolated_vertices_begin();
+         iv_it != face->isolated_vertices_end(); ++iv_it) {
+      Vertex_handle iso_v = iv_it;
+      Vertex_handle copied_iso =
         to.insert_in_face_interior (iso_v->point(), copied_face);
 
       map_copied_to_orig_vertices[copied_iso] = iso_v;
@@ -1891,8 +1711,7 @@ class Envelope_element_visitor_3
   // set envelope data in face "to" according to the comparison result of the
   // aux data of face "from"
   void copy_data_by_comparison_result(Face_handle from, Face_handle to,
-                                      Comparison_result res)
-  {
+                                      Comparison_result res) {
     CGAL_assertion_msg(from->get_aux_is_set(0), "aux_data(0) is not set");
     CGAL_assertion_msg(from->get_aux_is_set(1), "aux_data(1) is not set");
     to->set_aux_source(0, from->get_aux_source(0));
@@ -1902,8 +1721,7 @@ class Envelope_element_visitor_3
 
   // set envelope data in vertex "v" according to the comparison result of the
   // aux data of "v"
-  void set_data_by_comparison_result(Vertex_handle v, Comparison_result res)
-  {
+  void set_data_by_comparison_result(Vertex_handle v, Comparison_result res) {
     CGAL_assertion_msg(v->get_aux_is_set(0), "aux_data(0) is not set");
     CGAL_assertion_msg(v->get_aux_is_set(1), "aux_data(1) is not set");
     v->set_decision(res);
@@ -1911,8 +1729,7 @@ class Envelope_element_visitor_3
 
   // set envelope data in halfedge "h" according to the comparison result of
   // the aux data of "h"
-  void set_data_by_comparison_result(Halfedge_handle h, Comparison_result res)
-  {
+  void set_data_by_comparison_result(Halfedge_handle h, Comparison_result res) {
     CGAL_assertion_msg(h->get_aux_is_set(0), "aux_data(0) is not set");
     CGAL_assertion_msg(h->get_aux_is_set(1), "aux_data(1) is not set");
     h->set_decision(res);
@@ -1923,8 +1740,7 @@ class Envelope_element_visitor_3
   // FeatureHabdle should be a Face_handle, Halfedge_handle or
   // Vertex_handle
   template <typename FeatureHabdle>
-  void copy_all_data_to_vertex(FeatureHabdle from, Vertex_handle to)
-  {
+  void copy_all_data_to_vertex(FeatureHabdle from, Vertex_handle to) {
     CGAL_assertion_msg(from->get_aux_is_set(0), "aux_data(0) is not set");
     CGAL_assertion_msg(from->get_aux_is_set(1), "aux_data(1) is not set");
     CGAL_assertion_msg(!to->is_decision_set(), "data is set in new vertex");
@@ -1946,8 +1762,7 @@ class Envelope_element_visitor_3
   //   }
 
   Comparison_result resolve_minimal_edge(Halfedge_handle orig_he,
-                                         Halfedge_handle new_he)
-  {
+                                         Halfedge_handle new_he) {
     // find and set the envelope data on the new edge
     const Xy_monotone_surface_3& surf1 = get_aux_surface(orig_he, 0);
     const Xy_monotone_surface_3& surf2 = get_aux_surface(orig_he, 1);
@@ -1966,8 +1781,7 @@ class Envelope_element_visitor_3
 
   // check if the point is on the curve.
   // we use the traits adaptor since cv can be an infinite curve
-  bool is_point_on_curve(const Point_2& p, const X_monotone_curve_2& cv)
-  {
+  bool is_point_on_curve(const Point_2& p, const X_monotone_curve_2& cv) {
     Arr_traits_adaptor_2<Traits> tr_adaptor(*m_traits);
     return (tr_adaptor.is_in_x_range_2_object()(cv, p) &&
             m_traits->compare_y_at_x_2_object()(p, cv) == EQUAL);
@@ -2179,8 +1993,7 @@ class Envelope_element_visitor_3
                                                 ps_x, ps_y, true);
       // add indication of a new vertex (that is not connected to anything,
       // and is also not isolated)
-      if (is_bounded())
-        new_vertices.push_back(v);
+      if (is_bounded()) new_vertices.push_back(v);
 
       map_vertices[v] = new_v;
     }
@@ -2294,7 +2107,7 @@ class Envelope_element_visitor_3
         map_halfedges[he] = new_he;
         map_halfedges[he->twin()] = new_he->twin();
       }
-      else if (! v1_is_new && !v2_is_new) {
+      else if (! v1_is_new && ! v2_is_new) {
         // if both vertices are old - use _insert_at_vertices
         // this is a linear action by the size of the faces involved
         // we can get relevant prev halfedges from he
@@ -2352,7 +2165,7 @@ class Envelope_element_visitor_3
         CGAL_assertion(map_halfedges.is_defined(prev));
         Halfedge_handle big_prev = map_halfedges[prev];
         Halfedge_handle new_he;
-        if (!v1_is_new) {
+        if (! v1_is_new) {
           new_he = big_arr_accessor.insert_from_vertex_ex(big_prev,
                                                           he->curve(), (HE_COMP_RES(he) == SMALLER ? ARR_LEFT_TO_RIGHT : ARR_RIGHT_TO_LEFT),
                                                           big_v2);
@@ -2420,11 +2233,9 @@ class Envelope_element_visitor_3
                                             Vertex_handle /* v */) override
     { saved_face = f; }
 
-    virtual void after_add_isolated_vertex(Vertex_handle v) override
-    {
+    virtual void after_add_isolated_vertex(Vertex_handle v) override {
       // make sure it is the only new vertex right now
-      CGAL_assertion(new_vertices.size() == 1 &&
-                     new_vertices.back() == v);
+      CGAL_assertion(new_vertices.size() == 1 && new_vertices.back() == v);
       new_vertices.pop_back();
 
 
@@ -2434,8 +2245,7 @@ class Envelope_element_visitor_3
       // find features in big_arr
       Vertex_handle big_v = map_vertices[v];
 
-      Face_handle   big_face = map_faces[saved_face];
-
+      Face_handle big_face = map_faces[saved_face];
 
       // can use O(1) operation _insert_isolated_vertex
       big_arr_accessor.insert_isolated_vertex(big_face, big_v);
@@ -2520,15 +2330,15 @@ class Envelope_element_visitor_3
   // face
   class Copied_face_zone_visitor {
   public:
-    typedef typename Minimization_diagram_2::Vertex_handle     Vertex_handle;
-    typedef typename Minimization_diagram_2::Halfedge_handle   Halfedge_handle;
-    typedef typename Minimization_diagram_2::Face_handle       Face_handle;
+    using Vertex_handle = typename Minimization_diagram_2::Vertex_handle;
+    using Halfedge_handle = typename Minimization_diagram_2::Halfedge_handle;
+    using Face_handle = typename Minimization_diagram_2::Face_handle;
 
-    typedef typename Minimization_diagram_2::Point_2           Point_2;
-    typedef typename Minimization_diagram_2::X_monotone_curve_2
-      X_monotone_curve_2;
+    using Point_2 = typename Minimization_diagram_2::Point_2;
+    using X_monotone_curve_2 =
+      typename Minimization_diagram_2::X_monotone_curve_2;
 
-    typedef std::pair<Halfedge_handle, bool>                   Result;
+    using Result = std::pair<Halfedge_handle, bool>;
 
     Copied_face_zone_visitor(Minimization_diagram_2& result,
                              Minimization_diagram_2& copied,
@@ -2541,27 +2351,26 @@ class Envelope_element_visitor_3
                              Halfedges_w_type_list& new_edges,
                              Faces_list& face_parts,
                              Vertices_list& sv, // special vertices
-                             Self* p)
-      : copied_arr(copied),
-        result_arr(result),
-        result_original_face(orig_face),
-        map_halfedges(map_h),
-        map_vertices(map_v),
-        map_faces(map_f),
-        result_special_edges(se),
-        result_new_edges(new_edges),
-        result_face_parts(face_parts),
-        result_special_vertices(sv),
-        md_copy_observer(copied, result, map_h, map_v, map_f),
-        md_observer(map_h),
-        parent(p)
+                             Self* p) :
+      copied_arr(copied),
+      result_arr(result),
+      result_original_face(orig_face),
+      map_halfedges(map_h),
+      map_vertices(map_v),
+      map_faces(map_f),
+      result_special_edges(se),
+      result_new_edges(new_edges),
+      result_face_parts(face_parts),
+      result_special_vertices(sv),
+      md_copy_observer(copied, result, map_h, map_v, map_f),
+      md_observer(map_h),
+      parent(p)
     {
       // init maps
       copied_face_parts[copied_face] = copied_face_parts.default_value();
 
-      Halfedge_iterator hi = copied_arr.halfedges_begin();
-      for (; hi != copied_arr.halfedges_end(); ++hi)
-      {
+      for (auto hi = copied_arr.halfedges_begin();
+           hi != copied_arr.halfedges_end(); ++hi) {
         copied_arr_boundary_halfedges[hi] =
           copied_arr_boundary_halfedges.default_value();
         if (hi->face() == copied_face &&
@@ -2569,14 +2378,12 @@ class Envelope_element_visitor_3
           copied_vertices_to_halfedges[hi->target()] = hi;
       }
 
-      Vertex_iterator vi = copied_arr.vertices_begin();
-      for (; vi != copied_arr.vertices_end(); ++vi)
-      {
+      for (auto vi = copied_arr.vertices_begin();
+           vi != copied_arr.vertices_end(); ++vi) {
         copied_arr_orig_vertices[vi] =
           copied_arr_orig_vertices.default_value();
 
-        if (vi->is_isolated())
-        {
+        if (vi->is_isolated()) {
           CGAL_assertion(vi->face() == copied_face);
           copied_vertices_to_halfedges[vi] = Halfedge_handle(nullptr);
         }
@@ -2602,14 +2409,12 @@ class Envelope_element_visitor_3
     // the zone visitor functions
 
     /*! Initialize the visitor with an arrangement object. */
-    void init(Minimization_diagram_2* arr)
-    {
+    void init(Minimization_diagram_2* arr) {
       CGAL_assertion(&copied_arr == arr);
       insert_visitor.init(arr);
     }
 
-    /*!
-     * Handle the a subcurve located in the interior of a given face.
+    /*! Handle the a subcurve located in the interior of a given face.
      * \param cv The subcurve.
      * \param face The face containing cv's interior.
      * \param left_v The vertex that corresponds to the left endpoint of cv
@@ -2628,8 +2433,7 @@ class Envelope_element_visitor_3
     Result found_subcurve(const X_monotone_curve_2& cv,
                           Face_handle face,
                           Vertex_handle left_v, Halfedge_handle left_he,
-                          Vertex_handle right_v, Halfedge_handle right_he)
-    {
+                          Vertex_handle right_v, Halfedge_handle right_he) {
       // insert the curve only if the face is ok
       if (is_face_ok(face))
       {
@@ -2673,13 +2477,11 @@ class Envelope_element_visitor_3
         // and the vertex (or the vertex info if it was isolated)
         // otherwise, we set flags to true since it is a new vertex inside the
         // original face, and have same aux data as all face parts
-        if (is_boundary_vertex(new_he->target()))
-        {
+        if (is_boundary_vertex(new_he->target())) {
           Vertex_handle cur_t = new_he->target();
           CGAL_assertion(copied_vertices_to_halfedges.is_defined(cur_t));
           Halfedge_handle copied_b_he = copied_vertices_to_halfedges[cur_t];
-          if (copied_b_he == Halfedge_handle(nullptr))
-          {
+          if (copied_b_he == Halfedge_handle(nullptr)) {
             // this was an isolated vertex, which we touch
             // since we have in the new edge aux sources as in the face,
             // we can copy the vertex-face flags from the vertex
@@ -2696,8 +2498,7 @@ class Envelope_element_visitor_3
             result_new_he->set_has_equal_aux_data_in_target_and_face
               (1, cur_t->get_has_equal_aux_data_in_face(1));
           }
-          else
-          {
+          else {
             CGAL_assertion(copied_b_he->target() == cur_t);
             CGAL_assertion(is_boundary_edge(copied_b_he));
             Halfedge_handle b_he = map_halfedges[copied_b_he];
@@ -2724,8 +2525,7 @@ class Envelope_element_visitor_3
 
           }
         }
-        else // not a boundary vertex
-        {
+        else { // not a boundary vertex
           result_new_he->set_is_equal_aux_data_in_target(0, true);
           result_new_he->set_is_equal_aux_data_in_target(1, true);
           // the face's data is not empty - so it is ok to set "true" here
@@ -2735,13 +2535,11 @@ class Envelope_element_visitor_3
           result_new_he->set_has_equal_aux_data_in_target_and_face(1, true);
         }
 
-        if (is_boundary_vertex(new_he->source()))
-        {
+        if (is_boundary_vertex(new_he->source())) {
           Vertex_handle cur_t = new_he->source();
           CGAL_assertion(copied_vertices_to_halfedges.is_defined(cur_t));
           Halfedge_handle copied_b_he = copied_vertices_to_halfedges[cur_t];
-          if (copied_b_he == Halfedge_handle(nullptr))
-          {
+          if (copied_b_he == Halfedge_handle(nullptr)) {
             // this was an isolated vertex, which we touch
             // since we have in the new edge aux sources as in the face,
             // we can copy the vertex-face flags from the vertex
@@ -2758,8 +2556,7 @@ class Envelope_element_visitor_3
             result_new_he->twin()->set_has_equal_aux_data_in_target_and_face
               (1, cur_t->get_has_equal_aux_data_in_face(1));
           }
-          else
-          {
+          else {
             CGAL_assertion(copied_b_he->target() == cur_t);
             CGAL_assertion(is_boundary_edge(copied_b_he));
             Halfedge_handle b_he = map_halfedges[copied_b_he];
@@ -2827,8 +2624,7 @@ class Envelope_element_visitor_3
      */
     Result found_overlap(const X_monotone_curve_2& cv,
                          Halfedge_handle he,
-                         Vertex_handle left_v, Vertex_handle right_v)
-    {
+                         Vertex_handle left_v, Vertex_handle right_v) {
       // check if the halfedge is the boundary of the original face
       // (here we assume that this indication is dealt with in an observer
       //  attached to the md, and implements split_edge)
@@ -2851,12 +2647,10 @@ class Envelope_element_visitor_3
         copied_arr_special_vertices[overlap_he->target()] =
           copied_arr_special_vertices.default_value();
 
-      if (!is_boundary)
-        return base_res;
+      if (! is_boundary) return base_res;
 
       // if he is a boundary edge, it is a special edge
-      if (is_boundary)
-      {
+      if (is_boundary) {
         copied_arr_special_edges[overlap_he] =
           copied_arr_special_edges.default_value();
         copied_arr_special_edges[overlap_he->twin()] =
@@ -2865,51 +2659,46 @@ class Envelope_element_visitor_3
       return base_res;
     }
 
-    /*!
-     * Handle point that lies inside a given face.
+    /*! Handle point that lies inside a given face.
      * \param p The point.
      * \param face The face inside which the point lies.
      * \return A handle to the new vertex obtained from the insertion of the
      *         point into the face, or invalid handle if the point wasn't
      *         inserted to the arrangement.
      */
-    Vertex_handle found_point_in_face(const Point_2& p, Face_handle face)
-    {
+    Vertex_handle found_point_in_face(const Point_2& p, Face_handle face) {
       // p lies inside a face: Insert it as an isolated vertex it the interior
       // of this face.
       Vertex_handle vh_for_p;
-      if (is_face_ok(face))
-      {
+      if (is_face_ok(face)) {
         Arr_accessor<Minimization_diagram_2> arr_access (copied_arr);
         arr_access.notify_before_global_change();
         vh_for_p = copied_arr.insert_in_face_interior(p, face);
         arr_access.notify_after_global_change();
 
-              // now should set the is_equal and has_equal flags
-              CGAL_assertion(map_vertices.is_defined(vh_for_p));
-              Vertex_handle result_new_v = map_vertices[vh_for_p];
-              result_new_v->set_is_equal_aux_data_in_face(0, true);
-              result_new_v->set_is_equal_aux_data_in_face(1, true);
+        // now should set the is_equal and has_equal flags
+        CGAL_assertion(map_vertices.is_defined(vh_for_p));
+        Vertex_handle result_new_v = map_vertices[vh_for_p];
+        result_new_v->set_is_equal_aux_data_in_face(0, true);
+        result_new_v->set_is_equal_aux_data_in_face(1, true);
         result_new_v->set_has_equal_aux_data_in_face(0, true);
-              result_new_v->set_has_equal_aux_data_in_face(1, true);
+        result_new_v->set_has_equal_aux_data_in_face(1, true);
       }
       return vh_for_p;
     }
 
-    /*!
-     * Handle point that lies on a given edge.
+    /*! Handle point that lies on a given edge.
      * \param p The point.
      * \param he The edge on which the point lies.
      * \return A handle to the new vertex obtained from the insertion of the
      *         point into the edge, or invalid handle if the point wasn't
      *         inserted to the arrangement.
      */
-    Vertex_handle found_point_on_edge(const Point_2& p, Halfedge_handle he)
-    {
+    Vertex_handle found_point_on_edge(const Point_2& p, Halfedge_handle he) {
       // p lies in the interior of an edge: Split this edge to create a new
       // vertex associated with p.
-      X_monotone_curve_2  sub_cv1, sub_cv2;
-      Halfedge_handle     split_he;
+      X_monotone_curve_2 sub_cv1, sub_cv2;
+      Halfedge_handle split_he;
       copied_arr.geometry_traits()->
         split_2_object() (he->curve(), p, sub_cv1, sub_cv2);
 
@@ -2929,15 +2718,13 @@ class Envelope_element_visitor_3
       return split_he->target();
     }
 
-    /*!
-     * Handle point that lies on a given vertex.
+    /*! Handle point that lies on a given vertex.
      * \param p The point.
      * \param v The vertex on which the point lies.
      * \return A handle to the new vertex obtained from the modifying
      *         the existing vertex.
      */
-    Vertex_handle found_point_on_vertex(const Point_2& p, Vertex_handle v)
-    {
+    Vertex_handle found_point_on_vertex(const Point_2& p, Vertex_handle v) {
       // if the vertex is a boundary vertex, then it is a special vertex
       // if it was created by split of a boundary edge, then it is already
       // marked as special. we need to mark it as special if it is an original
@@ -2949,37 +2736,31 @@ class Envelope_element_visitor_3
       return copied_arr.modify_vertex (v, p);
     }
 
-    /*!
-     * Update all the output collections using the internal data saved during
+    /*! Update all the output collections using the internal data saved during
      * the previous inserts.
      * Should be called after all inserts have finished.
      */
-    void finish()
-    {
+    void finish() {
       // result_special_edges
       // result_new_edges
-      Halfedge_iterator hi = copied_arr.halfedges_begin();
-      for (; hi != copied_arr.halfedges_end(); ++hi, ++hi)
-      {
+      for (auto hi = copied_arr.halfedges_begin();
+           hi != copied_arr.halfedges_end(); ++hi, ++hi) {
         Halfedge_handle h = hi;
         CGAL_assertion(map_halfedges.is_defined(h) &&
                        map_halfedges.is_defined(h->twin()));
 
-
         // we need only one of the twin halfedges to represent the new edge
         if (copied_arr_new_edges.is_defined(h))
           result_new_edges.push_back(std::make_pair(map_halfedges[h],
                                                     copied_arr_new_edges[h]));
 
-        if (copied_arr_special_edges.is_defined(h))
-        {
+        if (copied_arr_special_edges.is_defined(h)) {
           // we need the halfedge that its incident face is inside the original
           // face
           Face_handle f1 = h->face();
           if (copied_face_parts.is_defined(f1))
             result_special_edges.push_back(map_halfedges[h]);
-          else
-          {
+          else {
             CGAL_assertion_code(Face_handle f2 = h->twin()->face());
             CGAL_assertion(copied_face_parts.is_defined(f2));
             result_special_edges.push_back(map_halfedges[h->twin()]);
@@ -2988,28 +2769,23 @@ class Envelope_element_visitor_3
       }
 
       // result_face_parts
-      Face_iterator fi = copied_arr.faces_begin();
-      for (; fi != copied_arr.faces_end(); ++fi)
-      {
+      for (auto fi = copied_arr.faces_begin(); fi != copied_arr.faces_end();
+           ++fi) {
         Face_handle f = fi;
-        if (copied_face_parts.is_defined(f))
-        {
+        if (copied_face_parts.is_defined(f)) {
           CGAL_assertion(map_faces.is_defined(f));
           result_face_parts.push_back(map_faces[f]);
         }
       }
 
       // result_special_vertices
-      Vertex_iterator vi = copied_arr.vertices_begin();
-      for (; vi != copied_arr.vertices_end(); ++vi)
-
-      {
+      for (auto vi = copied_arr.vertices_begin();
+           vi != copied_arr.vertices_end(); ++vi) {
         Vertex_handle v = vi;
         CGAL_assertion(map_vertices.is_defined(v));
         Vertex_handle result_v = map_vertices[v];
 
-        if (copied_arr_orig_vertices.is_defined(v))
-        {
+        if (copied_arr_orig_vertices.is_defined(v)) {
           // original vertex should be mapped to a boundary halfedge whose
           // target is the vertex
           CGAL_assertion(copied_vertices_to_halfedges.is_defined(v));
@@ -3032,9 +2808,8 @@ class Envelope_element_visitor_3
             result_special_vertices.push_back(result_v);
           }
         }
-        else
-        {
-          if (!copied_arr_new_boundary_vertices.is_defined(v))
+        else {
+          if (! copied_arr_new_boundary_vertices.is_defined(v))
             // new vertex inside the face
             result_special_vertices.push_back(result_v);
           else if (copied_arr_special_vertices.is_defined(v))
@@ -3043,30 +2818,22 @@ class Envelope_element_visitor_3
       }
     }
 
-    void set_current_intersection_type(Multiplicity t)
-    {
-      itype = t;
-    }
+    void set_current_intersection_type(Multiplicity t) { itype = t; }
   protected:
 
-    bool is_face_ok(Face_handle face)
-    {
+    bool is_face_ok(Face_handle face) {
       // is this face a part of the original face?
       // check in the copied_face_parts map
       return (copied_face_parts.is_defined(face));
     }
 
     bool is_boundary_edge(Halfedge_handle he)
-    {
-      return (copied_arr_boundary_halfedges.is_defined(he));
-    }
+    { return (copied_arr_boundary_halfedges.is_defined(he)); }
 
     bool is_original_boundary_vertex(Vertex_handle v)
-    {
-      return (copied_arr_orig_vertices.is_defined(v));
-    }
-    bool is_boundary_vertex(Vertex_handle v)
-    {
+    { return (copied_arr_orig_vertices.is_defined(v)); }
+
+    bool is_boundary_vertex(Vertex_handle v) {
       return (copied_arr_orig_vertices.is_defined(v) ||
               copied_arr_new_boundary_vertices.is_defined(v));
     }
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h
index 6951875249ef..118d9825c03f 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h
@@ -8,8 +8,9 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
-//                 Baruch Zukerman        <baruchzu@post.tau.ac.il>
+// Author(s) : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+//             Baruch Zukerman        <baruchzu@post.tau.ac.il>
+//             Efi Fogel              <efif@post.tau.ac.il>
 
 #ifndef CGAL_ENVELOPE_OVERLAY_2_H
 #define CGAL_ENVELOPE_OVERLAY_2_H
@@ -17,40 +18,38 @@
 #include <CGAL/license/Envelope_3.h>
 
 
+#include <iostream>
+
 #include <CGAL/Arr_overlay_2.h>
 #include <CGAL/Envelope_3/Envelope_overlay_functor.h>
 
-#include <iostream>
-
 namespace CGAL {
 
-template <class MinimizationDiagram_2,
-          class OverlayFunctor = Envelope_overlay_functor<MinimizationDiagram_2> >
-class Envelope_overlay_2
-{
+template <typename MinimizationDiagram_2,
+          typename OverlayFunctor =
+            Envelope_overlay_functor<MinimizationDiagram_2>>
+class Envelope_overlay_2 {
 public:
-  typedef MinimizationDiagram_2                                  Minimization_diagram_2;
+  using Minimization_diagram_2 = MinimizationDiagram_2;
+
+  using Face_handle = typename Minimization_diagram_2::Face_handle;
+  using Face_iterator = typename Minimization_diagram_2::Face_iterator;
 
-  typedef typename Minimization_diagram_2::Face_handle           Face_handle;
-  typedef typename Minimization_diagram_2::Face_iterator         Face_iterator;
+  using Vertex_handle = typename Minimization_diagram_2::Vertex_handle;
+  using Vertex_iterator = typename Minimization_diagram_2::Vertex_iterator;
 
-  typedef typename Minimization_diagram_2::Vertex_handle         Vertex_handle;
-  typedef typename Minimization_diagram_2::Vertex_iterator       Vertex_iterator;
+  using Halfedge_handle = typename Minimization_diagram_2::Halfedge_handle;
+  using Halfedge_iterator = typename Minimization_diagram_2::Halfedge_iterator;
 
-  typedef typename Minimization_diagram_2::Halfedge_handle       Halfedge_handle;
-  typedef typename Minimization_diagram_2::Halfedge_iterator     Halfedge_iterator;
+  using Overlay_functor = OverlayFunctor;
 
-  typedef OverlayFunctor                                         Overlay_functor;
 protected:
-  typedef typename Minimization_diagram_2::Geometry_traits_2     Traits;
-  typedef typename Traits::Xy_monotone_surface_3                 Xy_monotone_surface_3;
+  using Traits = typename Minimization_diagram_2::Geometry_traits_2;
+  using Xy_monotone_surface_3 = typename Traits::Xy_monotone_surface_3;
 
 public:
-
-  void operator()(Minimization_diagram_2& md1,
-                  Minimization_diagram_2& md2,
-                  Minimization_diagram_2& result)
-  {
+  void operator()(Minimization_diagram_2& md1, Minimization_diagram_2& md2,
+                  Minimization_diagram_2& result) {
     CGAL_assertion(md1.is_valid());
     CGAL_assertion(md2.is_valid());
 
@@ -60,9 +59,7 @@ class Envelope_overlay_2
     CGAL_assertion_code(post_test_assertions(result));
   }
 
-
 public:
-
   /*
   void print_face(Face_handle fh)
   {
@@ -72,7 +69,7 @@ class Envelope_overlay_2
     {
       std::cout << " #data= " << fh->number_of_data_objects();
       if (fh->number_of_data_objects() > 0)
-        std::cout << " data= " << fh->get_data();
+        std::cout << " data= " << fh->get_env_data();
     }
 
     if (fh->get_aux_is_set(0))
@@ -114,7 +111,7 @@ class Envelope_overlay_2
       {
         std::cout << " #data= " << vh->number_of_data_objects();
         if (vh->number_of_data_objects() > 0)
-          std::cout << " data= " << vh->get_data();
+          std::cout << " data= " << vh->get_env_data();
       }
 
       if (vh->get_aux_is_set(0))
@@ -146,7 +143,7 @@ class Envelope_overlay_2
       {
         std::cout << " #data= " << hh->number_of_data_objects();
         if (hh->number_of_data_objects() > 0)
-          std::cout << " data= " << hh->get_data();
+          std::cout << " data= " << hh->get_env_data();
       }
 
 
@@ -169,75 +166,68 @@ class Envelope_overlay_2
   }
   */
 
-  void post_test_assertions(Minimization_diagram_2& md)
-  {
+  void post_test_assertions(Minimization_diagram_2& md) {
     // check that all data is filled in result
-    Face_iterator fi = md.faces_begin();
-    for(; fi != md.faces_end(); ++fi)
-    {
+    for (auto fi = md.faces_begin(); fi != md.faces_end(); ++fi) {
       Face_handle fh = fi;
-      CGAL_assertion_msg(fh->get_aux_is_set(0), "data from md1 on face is not set");
-      CGAL_assertion_msg(fh->get_aux_is_set(1), "data from md2 on face is not set");
+      CGAL_assertion_msg(fh->get_aux_is_set(0),
+                         "data from md1 on face is not set");
+      CGAL_assertion_msg(fh->get_aux_is_set(1),
+                         "data from md2 on face is not set");
     }
 
-    Halfedge_iterator hi = md.halfedges_begin();
-    for(; hi != md.halfedges_end(); ++hi)
-    {
+    for (auto hi = md.halfedges_begin(); hi != md.halfedges_end(); ++hi) {
       Halfedge_handle hh = hi;
-      CGAL_assertion_msg(hh->get_aux_is_set(0), "data from md1 on halfedge is not set");
-      CGAL_assertion_msg(hh->get_aux_is_set(1), "data from md2 on halfedge is not set");
+      CGAL_assertion_msg(hh->get_aux_is_set(0),
+                         "data from md1 on halfedge is not set");
+      CGAL_assertion_msg(hh->get_aux_is_set(1),
+                         "data from md2 on halfedge is not set");
     }
 
-    Vertex_iterator vi = md.vertices_begin();
-    for(; vi != md.vertices_end(); ++vi)
-    {
+    for (auto vi = md.vertices_begin(); vi != md.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
-      CGAL_assertion_msg(vh->get_aux_is_set(0), "data from md1 on vertex is not set");
-      CGAL_assertion_msg(vh->get_aux_is_set(1), "data from md2 on vertex is not set");
+      CGAL_assertion_msg(vh->get_aux_is_set(0),
+                         "data from md1 on vertex is not set");
+      CGAL_assertion_msg(vh->get_aux_is_set(1),
+                         "data from md2 on vertex is not set");
     }
   }
+
 protected:
   // helper methods
-  template <class FeatureHandle>
-  Xy_monotone_surface_3 get_aux_data(FeatureHandle fh, unsigned int id)
-  {
+  template <typename FeatureHandle>
+  Xy_monotone_surface_3 get_aux_data(FeatureHandle fh, unsigned int id) {
     const Object& o = fh->get_aux_source(id);
     Xy_monotone_surface_3 data;
 
     Halfedge_handle h;
     Vertex_handle v;
-          Face_handle f;
-          if (assign(v, o))
-            data = v->get_data();
-          else if (assign(h, o))
-            data = h->get_data();
-          else
-          {
-            CGAL_assertion(assign(f, o));
+    Face_handle f;
+    if (assign(v, o)) data = v->get_env_data();
+    else if (assign(h, o)) data = h->get_env_data();
+    else {
+      CGAL_assertion(assign(f, o));
       assign(f, o);
-            data = f->get_data();
-          }
+      data = f->get_env_data();
+    }
     return data;
   }
-  template <class FeatureHandle>
-  int get_number_of_aux_data_objects(FeatureHandle fh, unsigned int id)
-  {
+
+  template <typename FeatureHandle>
+  int get_number_of_aux_data_objects(FeatureHandle fh, unsigned int id) {
           const Object& o = fh->get_aux_source(id);
     int data;
 
     Halfedge_handle h;
     Vertex_handle v;
-          Face_handle f;
-          if (assign(v, o))
-            data = v->number_of_data_objects();
-          else if (assign(h, o))
-            data = h->number_of_data_objects();
-          else
-          {
-            CGAL_assertion(assign(f, o));
+    Face_handle f;
+    if (assign(v, o)) data = v->number_of_data_objects();
+    else if (assign(h, o)) data = h->number_of_data_objects();
+    else {
+      CGAL_assertion(assign(f, o));
       assign(f, o);
-            data = f->number_of_data_objects();
-          }
+      data = f->number_of_data_objects();
+    }
     return data;
   }
 
diff --git a/Envelope_3/test/Envelope_3/Envelope_test_3.h b/Envelope_3/test/Envelope_3/Envelope_test_3.h
index 80656676ca7d..37c70646365d 100644
--- a/Envelope_3/test/Envelope_3/Envelope_test_3.h
+++ b/Envelope_3/test/Envelope_3/Envelope_test_3.h
@@ -8,18 +8,12 @@
 // $Name:  $
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+// Author(s) : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+//             Efi Fogel          <efifogel@gmail.com>
 
 #ifndef CGAL_ENVELOPE_TEST_3_H
 #define CGAL_ENVELOPE_TEST_3_H
 
-#include <CGAL/Envelope_3/Envelope_base.h>
-#include "Envelope_test_overlay_functor.h"
-#include <CGAL/Envelope_3/Envelope_overlay_2.h>
-
-#include <CGAL/Arr_walk_along_line_point_location.h>
-#include <CGAL/enum.h>
-
 #include <iostream>
 #include <cassert>
 #include <list>
@@ -27,128 +21,123 @@
 #include <vector>
 #include <map>
 
+#include <CGAL/Envelope_3/Envelope_base.h>
+#include "Envelope_test_overlay_functor.h"
+#include <CGAL/Envelope_3/Envelope_overlay_2.h>
+
+#include <CGAL/Arr_walk_along_line_point_location.h>
+#include <CGAL/enum.h>
+
 //#define CGAL_DEBUG_ENVELOPE_TEST_3
 
-// this is a very trivial and not efficient algorithm for computing the lower envelope
-// of general surfaces in 3d, used for testing.
-// The algorithm projects the surfaces on the plane, and projects all the intersections
-// between surfaces, to get an arrangement that is a partition of the real envelope.
-// Then it computes for each part in the arrangement the surfaces on the envelope over it
-// by comparing them all.
+// this is a very trivial and not efficient algorithm for computing the lower
+// envelope of general surfaces in 3d, used for testing.
+// The algorithm projects the surfaces on the plane, and projects all the
+// intersections between surfaces, to get an arrangement that is a partition of
+// the real envelope.
+// Then it computes for each part in the arrangement the surfaces on the
+// envelope over it by comparing them all.
 
 namespace CGAL {
 
-template <class EnvelopeTraits_3, class MinimizationDiagram_2>
-class Envelope_test_3
-{
+template <typename EnvelopeTraits_3, typename MinimizationDiagram_2>
+class Envelope_test_3 {
 public:
-  typedef EnvelopeTraits_3                                           Traits;
-  typedef typename Traits::Surface_3                                 Surface_3;
-  typedef typename Traits::Xy_monotone_surface_3                     Xy_monotone_surface_3;
+  using Traits = EnvelopeTraits_3;
+  using Minimization_diagram_2 = MinimizationDiagram_2;
 
-  typedef MinimizationDiagram_2                                      Minimization_diagram_2;
-  typedef typename Minimization_diagram_2::Point_2                   Point_2;
-  typedef typename Minimization_diagram_2::X_monotone_curve_2        X_monotone_curve_2;
-  typedef typename Traits::Curve_2                                   Curve_2;
+private:
+  using Md2 = Minimization_diagram_2;
 
-protected:
+public:
+  using Surface_3 = typename Traits::Surface_3;
+  using Xy_monotone_surface_3 = typename Traits::Xy_monotone_surface_3;
 
-  typedef Envelope_test_overlay_functor<Minimization_diagram_2>       Overlay_functor;
-  typedef Envelope_overlay_2<Minimization_diagram_2, Overlay_functor> Overlay_2;
-
-  typedef Arr_walk_along_line_point_location<Minimization_diagram_2> Md_point_location;
-
-  typedef typename Minimization_diagram_2::Halfedge_const_iterator   Halfedge_const_iterator;
-  typedef typename Minimization_diagram_2::Halfedge_const_handle     Halfedge_const_handle;
-  typedef typename Minimization_diagram_2::Halfedge_handle           Halfedge_handle;
-  typedef typename Minimization_diagram_2::Halfedge_iterator         Halfedge_iterator;
-  typedef typename Minimization_diagram_2::Vertex_const_handle       Vertex_const_handle;
-  typedef typename Minimization_diagram_2::Vertex_handle             Vertex_handle;
-  typedef typename Minimization_diagram_2::Vertex_iterator           Vertex_iterator;
-  typedef typename Minimization_diagram_2::Face_handle               Face_handle;
-  typedef typename Minimization_diagram_2::Face_const_iterator       Face_const_iterator;
-  typedef typename Minimization_diagram_2::Face_const_handle         Face_const_handle;
-  typedef typename Minimization_diagram_2::Face_iterator             Face_iterator;
-  typedef typename Minimization_diagram_2::Ccb_halfedge_circulator   Ccb_halfedge_circulator;
-  typedef typename Minimization_diagram_2::Inner_ccb_iterator        Hole_iterator;
-  typedef typename Minimization_diagram_2::Dcel::Face_data_iterator  Face_data_iterator;
-
-  typedef std::pair<X_monotone_curve_2,
-    typename EnvelopeTraits_3::Multiplicity>                         Intersection_curve;
+  using Point_2 = typename Md2::Point_2;
+  using X_monotone_curve_2 = typename Md2::X_monotone_curve_2;
+  using Curve_2 = typename Traits::Curve_2;
+
+protected:
+  using Overlay_functor = Envelope_test_overlay_functor<Md2>;
+  using Overlay_2 = Envelope_overlay_2<Md2, Overlay_functor>;
+
+  using Md_point_location = Arr_walk_along_line_point_location<Md2>;
+
+  using Halfedge_const_iterator = typename Md2::Halfedge_const_iterator;
+  using Halfedge_const_handle = typename Md2::Halfedge_const_handle;
+  using Halfedge_handle = typename Md2::Halfedge_handle;
+  using Halfedge_iterator = typename Md2::Halfedge_iterator;
+  using Vertex_const_handle = typename Md2::Vertex_const_handle;
+  using Vertex_handle = typename Md2::Vertex_handle;
+  using Vertex_iterator = typename Md2::Vertex_iterator;
+  using Face_handle = typename Md2::Face_handle;
+  using Face_const_iterator = typename Md2::Face_const_iterator;
+  using Face_const_handle = typename Md2::Face_const_handle;
+  using Face_iterator = typename Md2::Face_iterator;
+  using Ccb_halfedge_circulator = typename Md2::Ccb_halfedge_circulator;
+  using Hole_iterator = typename Md2::Inner_ccb_iterator;
+  using Face_data_iterator = typename Md2::Dcel::Face_data_iterator;
+
+  using Multiplicity = typename EnvelopeTraits_3::Multiplicity;
+  using Intersection_curve = std::pair<X_monotone_curve_2, Multiplicity>;
 
 public:
   // c'tor
-  Envelope_test_3()
-  {
-  }
+  Envelope_test_3() {}
 
   // virtual destructor.
   virtual ~Envelope_test_3(){}
 
   template <class SurfaceIterator>
-  void construct_lu_envelope(SurfaceIterator begin,
-                             SurfaceIterator end,
-                             Minimization_diagram_2 &result)
-  {
-    if (begin == end)
-    {
-      return; // result is empty
-    }
+  void construct_lu_envelope(SurfaceIterator begin, SurfaceIterator end,
+                             Minimization_diagram_2& result) {
+    if (begin == end) return; // result is empty
 
     std::vector<Xy_monotone_surface_3> surfaces;
-    SurfaceIterator si = begin;
-    for(; si != end; ++si)
-    {
-      surfaces.push_back(*si);
-    }
+    for (auto si = begin; si != end; ++si) surfaces.push_back(*si);
 
     Md_point_location pl(result);
 
     std::size_t number_of_surfaces = surfaces.size();
-    std::size_t j;
     std::list<X_monotone_curve_2> curves_col;
     std::list<Point_2> points_col;
     typename std::list<Curve_2>::iterator boundary_it;
 
-    for(std::size_t i=0; i<number_of_surfaces; ++i)
-    {
-      Xy_monotone_surface_3 &cur_surface = surfaces[i];
-      // first insert all the projected curves of the boundary of the current surface
-      // collect the curve in this list, and use sweepline at the end
+    for (std::size_t i = 0; i < number_of_surfaces; ++i) {
+      Xy_monotone_surface_3& cur_surface = surfaces[i];
+      // first insert all the projected curves of the boundary of the current
+      // surface collect the curve in this list, and use sweepline at the end
       typedef std::pair<X_monotone_curve_2, Oriented_side> Boundary_xcurve;
       std::list<std::variant<Boundary_xcurve, Point_2>> boundary_list;
 
-      traits.construct_projected_boundary_2_object()(cur_surface, std::back_inserter(boundary_list));
-      for(auto boundary_it = boundary_list.begin();
-          boundary_it != boundary_list.end();
-          ++boundary_it)
-      {
-        const Boundary_xcurve* boundary_cv = std::get_if<Boundary_xcurve>(&(*boundary_it));
+      auto ctr_proj_bnd = traits.construct_projected_boundary_2_object();
+      ctr_proj_bnd(cur_surface, std::back_inserter(boundary_list));
+      for (auto boundary_it = boundary_list.begin();
+           boundary_it != boundary_list.end(); ++boundary_it) {
+        const auto* boundary_cv = std::get_if<Boundary_xcurve>(&(*boundary_it));
         assert(boundary_cv!=nullptr);
         curves_col.push_back(boundary_cv->first);
       }
 
       // second, intersect it with all surfaces before it
-      for(j=0; j<i; ++j)
-      {
+      for (std::size_t j = 0; j < i; ++j) {
         Xy_monotone_surface_3& prev_surface = surfaces[j];
 
         std::vector<std::variant<Intersection_curve,Point_2>> inter_objs;
         traits.construct_projected_intersections_2_object()(cur_surface, prev_surface, std::back_inserter(inter_objs));
 
         // we collect all intersections and use sweep to insert them
-        for(std::size_t k=0; k<inter_objs.size(); ++k)
-        {
-          if (const Point_2* point = std::get_if<Point_2>(&inter_objs[k]))
-          {
+        for (std::size_t k = 0; k < inter_objs.size(); ++k) {
+          if (const Point_2* point = std::get_if<Point_2>(&inter_objs[k])) {
             #ifdef CGAL_DEBUG_ENVELOPE_TEST_3
-              std::cout << "intersection between surfaces is a point: " << point << std::endl;
+              std::cout << "intersection between surfaces is a point: "
+                        << point << std::endl;
             #endif
             //insert_vertex(result, point, pl);
             points_col.push_back(*point);
           }
-          else if (const Intersection_curve* curve = std::get_if<Intersection_curve>(&inter_objs[k]))
-          {
+          else if (const auto* curve =
+                   std::get_if<Intersection_curve>(&inter_objs[k])) {
             curves_col.push_back(curve->first);
             /*#ifdef CGAL_DEBUG_ENVELOPE_TEST_3
               std::cout << "intersection between surfaces is a curve: " << curve.first << std::endl;
@@ -165,10 +154,7 @@ class Envelope_test_3
             }*/
             //insert(result, curve.first, pl);
           }
-          else
-          {
-            assert_msg(false, "wrong intersection type");
-          }
+          else assert_msg(false, "wrong intersection type");
         }
       }
     }
@@ -176,8 +162,7 @@ class Envelope_test_3
     // insert the curves
     insert(result, curves_col.begin(), curves_col.end());
     // insert the points
-    typename std::list<Point_2>::iterator pit = points_col.begin();
-    for(; pit != points_col.end(); ++pit)
+    for (auto pit = points_col.begin(); pit != points_col.end(); ++pit)
       insert_point(result, *pit, pl);
 
     m_result = &result;
@@ -185,52 +170,48 @@ class Envelope_test_3
     // now, foreach vertex, edge and face, we should determine which surfaces are minimal over it.
 
     // update vertices' data
-    Vertex_iterator vi = result.vertices_begin();
-    for(; vi != result.vertices_end(); ++vi)
-    {
+    for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
       // first we find the surfaces that are defined over the vertex
       std::list<Xy_monotone_surface_3> defined_surfaces;
-      typename Traits::Is_defined_over is_defined_over = traits.is_defined_over_object();
-      for(std::size_t i=0; i<number_of_surfaces; ++i)
+      auto is_defined_over = traits.is_defined_over_object();
+      for (std::size_t i = 0; i < number_of_surfaces; ++i)
         if (is_defined_over(vh->point(), surfaces[i]))
           defined_surfaces.push_back(surfaces[i]);
 
       // now compare them over the vertex
-      set_minimum_over_vertex(vh, defined_surfaces.begin(), defined_surfaces.end());
+      set_minimum_over_vertex(vh, defined_surfaces.begin(),
+                              defined_surfaces.end());
     }
 
     // update edges' data
-    Halfedge_iterator hi = result.halfedges_begin();
-    for(; hi != result.halfedges_end(); ++hi, ++hi)
-    {
+    for (auto hi = result.halfedges_begin(); hi != result.halfedges_end();
+         ++hi, ++hi) {
       Halfedge_handle hh = hi;
       // first we find the surfaces that are defined over the edge
       std::list<Xy_monotone_surface_3> defined_surfaces;
-      for(std::size_t i=0; i<number_of_surfaces; ++i)
+      for (std::size_t i = 0; i < number_of_surfaces; ++i)
         if (is_surface_defined_over_edge(hh, surfaces[i]))
           defined_surfaces.push_back(surfaces[i]);
 
       // now compare them over the edge
-      set_minimum_over_edge(hh, defined_surfaces.begin(), defined_surfaces.end());
+      set_minimum_over_edge(hh, defined_surfaces.begin(),
+                            defined_surfaces.end());
     }
 
     // update faces' data
 
     // init current face for caching of computation
     current_face = Face_handle();
-
-    Face_iterator fi;
-    for (fi = result.faces_begin(); fi != result.faces_end(); ++fi)
-    {
+    for (auto fi = result.faces_begin(); fi != result.faces_end(); ++fi) {
       #ifdef CGAL_DEBUG_ENVELOPE_TEST_3
-        std::cout << "deal with face" << std::endl;
+      std::cout << "deal with face" << std::endl;
       #endif
 
       Face_handle fh = fi;
       // first we find the surfaces that are defined over the face
       std::list<Xy_monotone_surface_3> defined_surfaces;
-      for (std::size_t i=0; i<number_of_surfaces; ++i)
+      for (std::size_t i = 0; i < number_of_surfaces; ++i)
         if (is_surface_defined_over_face(fh, surfaces[i]))
           defined_surfaces.push_back(surfaces[i]);
 
@@ -240,8 +221,7 @@ class Envelope_test_3
     }
   }
 
-  /*!
-   * compare the 2 envelopes by overlaying them, and then comparing the
+  /*! compare the 2 envelopes by overlaying them, and then comparing the
    * surfaces over the faces of the result map.
    *
    * \todo The overlay compares the data using assertions. This should be
@@ -249,37 +229,31 @@ class Envelope_test_3
    * determine that the 2 diagrams differ, we cannot simply remove the
    * assertions. One option is to generate an exception and catch it.
    */
-  bool compare_diagrams(Minimization_diagram_2 &test_env,
-                        Minimization_diagram_2 &env)
-  {
+  bool compare_diagrams(Minimization_diagram_2& test_env,
+                        Minimization_diagram_2& env) {
     Minimization_diagram_2 overlay_map;
     overlay(test_env, env, overlay_map);
     return true;
   }
 
 protected:
-
   // fill the vertex with the surface on the envelope
   // all the surfaces are known to be defined over the vertex' point
-  template <class SurfaceIterator>
+  template <typename SurfaceIterator>
   void set_minimum_over_vertex(const Vertex_handle& v,
-                               SurfaceIterator begin, SurfaceIterator end)
-  {
-    if (begin == end)
-      v->set_no_data();
-    else
-    {
-      SurfaceIterator si = begin;
+                               SurfaceIterator begin, SurfaceIterator end) {
+    if (begin == end) v->set_no_data();
+    else {
+      auto si = begin;
       // we set the first surface as the minimum, and then compare all the others
-      v->set_data(*si);
+      v->set_env_data(*si);
       ++si;
-      for(; si != end; ++si)
-      {
-        Comparison_result cr = traits.compare_z_at_xy_3_object()(v->point(), v->get_data(), *si);
-        if (cr == EQUAL)
-          v->add_data(*si);
-        else if (cr == LARGER)
-          v->set_data(*si); // this erases all surfaces from vertex's list
+      for (; si != end; ++si) {
+        Comparison_result cr =
+          traits.compare_z_at_xy_3_object()(v->point(), v->get_env_data(), *si);
+        if (cr == EQUAL) v->add_data(*si);
+        // this erases all surfaces from vertex's list
+        else if (cr == LARGER) v->set_env_data(*si);
         // else - new surface has no affect on the envelope
       }
     }
@@ -287,58 +261,53 @@ class Envelope_test_3
 
   // fill the edge with the surface on the envelope
   // all the surfaces are known to be defined over the edge's curve
-  template <class SurfaceIterator>
-  void set_minimum_over_edge(const Halfedge_handle& h, SurfaceIterator begin, SurfaceIterator end)
-  {
-    if (begin == end)
-      h->set_no_data();
-    else
-    {
-      if (h != current_edge)
-        compute_point_in_current_edge(h);
-
-      SurfaceIterator si = begin;
+  template <typename SurfaceIterator>
+  void set_minimum_over_edge(const Halfedge_handle& h, SurfaceIterator begin,
+                             SurfaceIterator end) {
+    if (begin == end) h->set_no_data();
+    else {
+      if (h != current_edge) compute_point_in_current_edge(h);
+
+      auto si = begin;
       // we set the first surface as the minimum, and then compare all the others
-      h->set_data(*si);
+      h->set_env_data(*si);
       ++si;
-      for(; si != end; ++si)
-      {
-        Comparison_result cr = traits.compare_z_at_xy_3_object()(current_point_inside_edge,
-                                                                              h->get_data(), *si);
-        if (cr == EQUAL)
-          h->add_data(*si);
-        else if (cr == LARGER)
-          h->set_data(*si); // this erases all surfaces from halfedge's list
+      for (; si != end; ++si) {
+        Comparison_result cr =
+          traits.compare_z_at_xy_3_object()(current_point_inside_edge,
+                                            h->get_env_data(), *si);
+        if (cr == EQUAL) h->add_data(*si);
+        // this erases all surfaces from halfedge's list
+        else if (cr == LARGER) h->set_env_data(*si);
         // else - new surface has no affect on the envelope
       }
       // set twin's data
-      h->twin()->set_data(h->begin_data(), h->end_data());
+      h->twin()->set_env_data(h->begin_data(), h->end_data());
     }
   }
+
   // fill the face with the surface on the envelope
   // the surfaces are known to not intersect inside the face
   // (but might intersect on its edges)
-  template <class SurfaceIterator>
-  void set_minimum_over_face(const Face_handle& face, SurfaceIterator begin, SurfaceIterator end)
-  {
-    if (face->is_unbounded() || begin == end)
-    {
-      // a special case - no surface over the unbounded face, and when there are no surfaces at all
+  template <typename SurfaceIterator>
+  void set_minimum_over_face(const Face_handle& face, SurfaceIterator begin,
+                             SurfaceIterator end) {
+    if (face->is_unbounded() || begin == end) {
+      // a special case - no surface over the unbounded face, and when there
+      // are no surfaces at all
       face->set_no_data();
     }
-    else
-    {
-      SurfaceIterator si = begin;
+    else {
+      auto si = begin;
       // we set the first surface as the minimum, and then compare all the others
-      face->set_data(*si);
+      face->set_env_data(*si);
       ++si;
-      for(; si != end; ++si)
-      {
-        Comparison_result cr = compare_surfaces_over_face(face, face->get_data(), *si);
-        if (cr == EQUAL)
-          face->add_data(*si);
-        else if (cr == LARGER)
-          face->set_data(*si); // this erases all surfaces from face's list
+      for (; si != end; ++si) {
+        Comparison_result cr =
+          compare_surfaces_over_face(face, face->get_env_data(), *si);
+        if (cr == EQUAL) face->add_data(*si);
+        // this erases all surfaces from face's list
+        else if (cr == LARGER) face->set_env_data(*si);
         // else - new surface has no affect on the envelope
       }
     }
@@ -349,14 +318,13 @@ class Envelope_test_3
   //        LARGER if the second surface is closer to the envelope
   //        EQUAL otherwise
   // this is version 2 which uses a calculated point inside the face
-  Comparison_result compare_surfaces_over_face(const Face_handle& face,
-                                               const Xy_monotone_surface_3 &surf1,
-                                               const Xy_monotone_surface_3& surf2)
-  {
+  Comparison_result
+  compare_surfaces_over_face(const Face_handle& face,
+                             const Xy_monotone_surface_3& surf1,
+                             const Xy_monotone_surface_3& surf2) {
     assert(!face->is_unbounded());
     Comparison_result cur_res;
-    if (face != current_face)
-    compute_point_in_current_face(face);
+    if (face != current_face) compute_point_in_current_face(face);
 
     cur_res = traits.compare_z_at_xy_3_object()(current_point,surf1,surf2);
 
@@ -368,27 +336,24 @@ class Envelope_test_3
   }
 
   // check if the surface is defines over the edge
-  bool is_surface_defined_over_edge(const Halfedge_handle& h, Xy_monotone_surface_3 &surf)
-  {
+  bool is_surface_defined_over_edge(const Halfedge_handle& h,
+                                    Xy_monotone_surface_3& surf) {
     // check it over a point inside the edge's curve
-    if (h != current_edge)
-      compute_point_in_current_edge(h);
+    if (h != current_edge) compute_point_in_current_edge(h);
 
-    bool result = traits.is_defined_over_object()(current_point_inside_edge, surf);
+    auto def_over_obj = traits.is_defined_over_object();
+    bool result = def_over_obj(current_point_inside_edge, surf);
     return result;
   }
 
   // check if the surface is defines over the face
   // this is version checks the point inside the face
   bool is_surface_defined_over_face(const Face_handle& face,
-                                    Xy_monotone_surface_3 &surf)
-  {
+                                    Xy_monotone_surface_3& surf) {
     // we always have bounded surfaces
-    if (face->is_unbounded())
-      return false;
+    if (face->is_unbounded()) return false;
 
-    if (face != current_face)
-      compute_point_in_current_face(face);
+    if (face != current_face) compute_point_in_current_face(face);
 
     bool result = traits.is_defined_over_object()(current_point,surf);
 
@@ -396,9 +361,9 @@ class Envelope_test_3
   }
 
   // compute a point inside the face of the arranegement
-  Point_2 compute_point_inside_face(Minimization_diagram_2 &env, Face_handle face)
-  {
-    assert(!face->is_unbounded());
+  Point_2 compute_point_inside_face(Minimization_diagram_2& env,
+                                    Face_handle face) {
+    assert(! face->is_unbounded());
 
     #ifdef CGAL_DEBUG_ENVELOPE_TEST_3
       std::cout << "in compute point inside face" << std::endl;
@@ -409,8 +374,7 @@ class Envelope_test_3
     Ccb_halfedge_circulator hec_begin = hec;
     bool found = false;
     do {
-      if (!traits.is_vertical_2_object()(hec->curve()))
-      {
+      if (!traits.is_vertical_2_object()(hec->curve())) {
         found = true;
         continue;
       }
@@ -433,7 +397,7 @@ class Envelope_test_3
 //    if (traits.compare_x(found_hh->source()->point(), found_hh->target()->point()) == LARGER)
 //      shoot_up = false;
     if (traits.equal_2_object()(found_hh->source()->point(),
-                              traits.construct_max_vertex_2_object()(found_hh->curve())))
+                                traits.construct_max_vertex_2_object()(found_hh->curve())))
       shoot_up = false;
 
     Md_point_location pl(env);
@@ -443,21 +407,14 @@ class Envelope_test_3
 
     Point_2 shoot_target;
 
-    if (shoot_up)
-      shoot_obj = pl.ray_shoot_up(shoot_source);
-    else
-      shoot_obj = pl.ray_shoot_down(shoot_source);
+    if (shoot_up) shoot_obj = pl.ray_shoot_up(shoot_source);
+    else shoot_obj = pl.ray_shoot_down(shoot_source);
 
     if (assign(shoot_hh, shoot_obj))
-    {
       shoot_target = traits.vertical_ray_shoot_2(shoot_source, shoot_hh->curve());
-    }
     else if (assign(shoot_vh, shoot_obj))
-    {
       shoot_target = (env.non_const_handle(shoot_vh))->point();
-    }
-    else
-      CGAL_error(); // it cannot be the unbounded face
+    else CGAL_error(); // it cannot be the unbounded face
 
     Point_2 res_point = traits.construct_middle_point(shoot_source, shoot_target);
 
@@ -471,37 +428,34 @@ class Envelope_test_3
       assert(test_fh == face);
     #endif
 
-
     return res_point;
   }
 
 
   // compute a point inside the face saved in current_face
   // and put the result into current_point
-  void compute_point_in_current_face(Face_handle face)
-  {
+  void compute_point_in_current_face(Face_handle face) {
     current_face = face;
     current_point = compute_point_inside_face(*m_result, current_face);
   }
 
   // compute a point inside the edge saved in current_edge
   // and put the result into current_point_inside_edge
-  void compute_point_in_current_edge(Halfedge_handle h)
-  {
+  void compute_point_in_current_edge(Halfedge_handle h) {
     current_edge = h;
     current_point_inside_edge = traits.construct_middle_point(h->curve());
   }
 
 protected:
-  Overlay_2              overlay;
-  Traits                 traits;
-  Minimization_diagram_2 *m_result;
+  Overlay_2 overlay;
+  Traits traits;
+  Minimization_diagram_2* m_result;
 
-  Face_handle        current_face;
-  Point_2            current_point;
+  Face_handle current_face;
+  Point_2 current_point;
 
-  Halfedge_handle    current_edge;
-  Point_2            current_point_inside_edge;
+  Halfedge_handle current_edge;
+  Point_2 current_point_inside_edge;
 };
 
 } //namespace CGAL
diff --git a/Envelope_3/test/Envelope_3/Envelope_test_overlay_functor.h b/Envelope_3/test/Envelope_3/Envelope_test_overlay_functor.h
index c3388bed44ac..20cbfbcafb59 100644
--- a/Envelope_3/test/Envelope_3/Envelope_test_overlay_functor.h
+++ b/Envelope_3/test/Envelope_3/Envelope_test_overlay_functor.h
@@ -8,7 +8,8 @@
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
 //
-// Author(s)     : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+// Author(s) : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+//             Efi Fogel              <efif@post.tau.ac.il>
 
 #ifndef ENVELOPE_TEST_OVERLAY_FUNCTOR_H
 #define ENVELOPE_TEST_OVERLAY_FUNCTOR_H
@@ -28,104 +29,87 @@ namespace CGAL {
 
 // this overlay functor compares the data over the 2 features that create new
 // features in the new map
-template <class MinimizationDiagram_2>
-class Envelope_test_overlay_functor
-{
+template <typename MinimizationDiagram_2>
+class Envelope_test_overlay_functor {
 public:
-  typedef MinimizationDiagram_2                                  Minimization_diagram_2;
+  using Minimization_diagram_2 = MinimizationDiagram_2;
 
-  typedef typename Minimization_diagram_2::Face_const_handle     Face_handle1;
-  typedef typename Minimization_diagram_2::Face_const_handle     Face_handle2;
+private:
+  using Md2 = Minimization_diagram_2;
 
-  typedef typename Minimization_diagram_2::Vertex_const_handle   Vertex_handle1;
-  typedef typename Minimization_diagram_2::Vertex_const_handle   Vertex_handle2;
+public:
+  using Face_handle1 = typename Md2::Face_const_handle;
+  using Face_handle2 = typename Md2::Face_const_handle;
 
-  typedef typename Minimization_diagram_2::Halfedge_const_handle Halfedge_handle1;
-  typedef typename Minimization_diagram_2::Halfedge_const_handle Halfedge_handle2;
+  using Vertex_handle1 = typename Md2::Vertex_const_handle;
+  using Vertex_handle2 = typename Md2::Vertex_const_handle;
 
-  typedef typename Minimization_diagram_2::Face_handle           Res_face_handle;
-  typedef typename Minimization_diagram_2::Halfedge_handle       Res_halfedge_handle;
-  typedef typename Minimization_diagram_2::Vertex_handle         Res_vertex_handle;
+  using Halfedge_handle1 = typename Md2::Halfedge_const_handle;
+  using Halfedge_handle2 = typename Md2::Halfedge_const_handle;
 
+  using Res_face_handle = typename Md2::Face_handle;
+  using Res_halfedge_handle = typename Md2::Halfedge_handle;
+  using Res_vertex_handle = typename Md2::Vertex_handle;
 
-  Envelope_test_overlay_functor(Minimization_diagram_2& ,
-                                Minimization_diagram_2& ,
-                                Minimization_diagram_2& )
-  {}
+  Envelope_test_overlay_functor(Md2&, Md2&, Md2&) {}
 
-  void create_face (Face_handle1 f1, Face_handle2 f2, Res_face_handle res_f)
-  {
+  void create_face (Face_handle1 f1, Face_handle2 f2, Res_face_handle res_f) {
     res_f->set_aux_source(0, f1);
     res_f->set_aux_source(1, f2);
     assert_msg(f1->is_equal_data(f2->begin_data(), f2->end_data()),
-                       "data different over face");
+               "data different over face");
   }
 
-  void create_vertex(Halfedge_handle1 h1,
-                     Halfedge_handle2 h2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Halfedge_handle1 h1, Halfedge_handle2 h2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, h1);
     res_v->set_aux_source(1, h2);
     assert_msg(h1->is_equal_data(h2->begin_data(), h2->end_data()),
-                       "data different over vertex");
-
+               "data different over vertex");
   }
 
-  void create_vertex(Vertex_handle1 v1,
-                     Vertex_handle2 v2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Vertex_handle1 v1, Vertex_handle2 v2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, v1);
     res_v->set_aux_source(1, v2);
     assert_msg(v1->is_equal_data(v2->begin_data(), v2->end_data()),
                        "data different over vertex");
   }
 
-  void create_vertex(Vertex_handle1 v1,
-                     Halfedge_handle2 h2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Vertex_handle1 v1, Halfedge_handle2 h2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, v1);
     res_v->set_aux_source(1, h2);
     assert_msg(v1->is_equal_data(h2->begin_data(), h2->end_data()),
                        "data different over vertex");
   }
 
-  void create_vertex(Halfedge_handle1 h1,
-                     Vertex_handle2 v2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Halfedge_handle1 h1, Vertex_handle2 v2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, h1);
     res_v->set_aux_source(1, v2);
     assert_msg(h1->is_equal_data(v2->begin_data(), v2->end_data()),
                        "data different over vertex");
   }
 
-  void create_vertex(Face_handle1 f1,
-                     Vertex_handle2 v2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Face_handle1 f1, Vertex_handle2 v2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, f1);
     res_v->set_aux_source(1, v2);
     assert_msg(f1->is_equal_data(v2->begin_data(), v2->end_data()),
                        "data different over vertex");
   }
 
-  void create_vertex(Vertex_handle1 v1,
-                     Face_handle2 f2,
-                     Res_vertex_handle res_v)
-  {
+  void create_vertex(Vertex_handle1 v1, Face_handle2 f2,
+                     Res_vertex_handle res_v) {
     res_v->set_aux_source(0, v1);
     res_v->set_aux_source(1, f2);
     assert_msg(v1->is_equal_data(f2->begin_data(), f2->end_data()),
                        "data different over vertex");
   }
 
-  void create_edge(Halfedge_handle1 h1,
-                   Halfedge_handle2 h2,
-                   Res_halfedge_handle res_h)
-  {
+  void create_edge(Halfedge_handle1 h1, Halfedge_handle2 h2,
+                   Res_halfedge_handle res_h) {
     res_h->set_aux_source(0, h1);
     res_h->set_aux_source(1, h2);
 
@@ -136,10 +120,8 @@ class Envelope_test_overlay_functor
                        "data different over edge");
   }
 
-  void create_edge(Halfedge_handle1 h1,
-                   Face_handle2 f2,
-                   Res_halfedge_handle res_h)
-  {
+  void create_edge(Halfedge_handle1 h1, Face_handle2 f2,
+                   Res_halfedge_handle res_h) {
     res_h->set_aux_source(0, h1);
     res_h->set_aux_source(1, f2);
 
@@ -150,10 +132,8 @@ class Envelope_test_overlay_functor
                        "data different over edge");
   }
 
-  void create_edge(Face_handle1 f1,
-                   Halfedge_handle2 h2,
-                   Res_halfedge_handle res_h)
-  {
+  void create_edge(Face_handle1 f1, Halfedge_handle2 h2,
+                   Res_halfedge_handle res_h) {
     res_h->set_aux_source(0, f1);
     res_h->set_aux_source(1, h2);
 
@@ -169,5 +149,3 @@ class Envelope_test_overlay_functor
 } //namespace CGAL
 
 #endif
-
-
diff --git a/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h b/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h
index 194b9fb7a120..84a83a62d8ad 100644
--- a/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h
+++ b/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h
@@ -8,17 +8,12 @@
 // $Name:  $
 // SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
 //
-// Author(s)     : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+// Author(s) : Michal Meyerovitch     <gorgymic@post.tau.ac.il>
+//             Efi Fogel          <efifogel@gmail.com>
 
 #ifndef CGAL_ENVELOPE_TRIANGLES_TEST_3_H
 #define CGAL_ENVELOPE_TRIANGLES_TEST_3_H
 
-#include "Envelope_test_overlay_functor.h"
-#include <CGAL/Envelope_3/Envelope_overlay_2.h>
-
-#include <CGAL/Arr_walk_along_line_point_location.h>
-#include <CGAL/enum.h>
-
 #include <iostream>
 #include <cassert>
 #include <list>
@@ -26,6 +21,11 @@
 #include <vector>
 #include <map>
 
+#include "Envelope_test_overlay_functor.h"
+#include <CGAL/Envelope_3/Envelope_overlay_2.h>
+#include <CGAL/Arr_walk_along_line_point_location.h>
+#include <CGAL/enum.h>
+
 //#define CGAL_DEBUG_ENVELOPE_TRIANGLES_TEST_3
 
 // this is a very trivial and not efficient algorithm for computing the lower
@@ -38,59 +38,47 @@
 
 namespace CGAL {
 
-template <class EnvelopeTraits_3, class MinimizationDiagram_2>
+template <typename EnvelopeTraits_3, typename MinimizationDiagram_2>
 class Envelope_triangles_test_3 {
 public:
-  typedef EnvelopeTraits_3                              Traits;
-  typedef typename Traits::Surface_3                    Surface_3;
-  typedef typename Traits::Xy_monotone_surface_3        Xy_monotone_surface_3;
+  using Traits = EnvelopeTraits_3;
+  using Minimization_diagram_2 = MinimizationDiagram_2;
+
+private:
+  using Md2 = Minimization_diagram_2;
+
+public:
+  using Surface_3 = typename Traits::Surface_3;
+  using Xy_monotone_surface_3 = typename Traits::Xy_monotone_surface_3;
 
-  typedef MinimizationDiagram_2                         Minimization_diagram_2;
-  typedef typename Minimization_diagram_2::Point_2      Point_2;
-  typedef typename Minimization_diagram_2::X_monotone_curve_2
-                                                        X_monotone_curve_2;
-  typedef typename Traits::Curve_2                      Curve_2;
+  using Point_2 = typename Md2::Point_2;
+  using X_monotone_curve_2 = typename Md2::X_monotone_curve_2;
+  using Curve_2 = typename Traits::Curve_2;
 
 protected:
-  typedef Envelope_test_overlay_functor<Minimization_diagram_2>
-                                                        Overlay_functor;
-  typedef Envelope_overlay_2<Minimization_diagram_2, Overlay_functor>
-                                                        Overlay_2;
-
-  typedef Arr_walk_along_line_point_location<Minimization_diagram_2>
-                                                        Md_point_location;
-
-  typedef typename Minimization_diagram_2::Halfedge_const_iterator
-                                                        Halfedge_const_iterator;
-  typedef typename Minimization_diagram_2::Halfedge_const_handle
-                                                        Halfedge_const_handle;
-  typedef typename Minimization_diagram_2::Halfedge_handle
-                                                        Halfedge_handle;
-  typedef typename Minimization_diagram_2::Halfedge_iterator
-                                                        Halfedge_iterator;
-  typedef typename Minimization_diagram_2::Vertex_const_handle
-                                                        Vertex_const_handle;
-  typedef typename Minimization_diagram_2::Vertex_handle
-                                                        Vertex_handle;
-  typedef typename Minimization_diagram_2::Vertex_iterator
-                                                        Vertex_iterator;
-  typedef typename Minimization_diagram_2::Face_handle  Face_handle;
-  typedef typename Minimization_diagram_2::Face_const_iterator
-                                                        Face_const_iterator;
-  typedef typename Minimization_diagram_2::Face_const_handle
-                                                        Face_const_handle;
-  typedef typename Minimization_diagram_2::Face_iterator
-                                                        Face_iterator;
-  typedef typename Minimization_diagram_2::Ccb_halfedge_circulator
-                                                        Ccb_halfedge_circulator;
-  typedef typename Minimization_diagram_2::Inner_ccb_iterator
-                                                        Hole_iterator;
-
-  typedef typename Minimization_diagram_2::Dcel::Face_data_iterator
-                                                        Face_data_iterator;
-
-  typedef std::pair<X_monotone_curve_2, typename EnvelopeTraits_3::Multiplicity>
-                                                        Intersection_curve;
+  using Overlay_functor = Envelope_test_overlay_functor<Md2>;
+  using Overlay_2 = Envelope_overlay_2<Md2, Overlay_functor>;
+
+  using Md2_point_location = Arr_walk_along_line_point_location<Md2>;
+
+  using Halfedge_const_iterator = typename Md2::Halfedge_const_iterator;
+  using Halfedge_const_handle = typename Md2::Halfedge_const_handle;
+  using Halfedge_handle = typename Md2::Halfedge_handle;
+  using Halfedge_iterator = typename Md2::Halfedge_iterator;
+  using Vertex_const_handle = typename Md2::Vertex_const_handle;
+  using Vertex_handle = typename Md2::Vertex_handle;
+  using Vertex_iterator = typename Md2::Vertex_iterator;
+  using Face_handle = typename Md2::Face_handle;
+  using Face_const_iterator = typename Md2::Face_const_iterator;
+  using Face_const_handle = typename Md2::Face_const_handle;
+  using Face_iterator = typename Md2::Face_iterator;
+  using Ccb_halfedge_circulator = typename Md2::Ccb_halfedge_circulator;
+  using Hole_iterator = typename Md2::Inner_ccb_iterator;
+
+  using Face_data_iterator = typename Md2::Dcel::Face_data_iterator;
+
+  using Multiplicity = typename EnvelopeTraits_3::Multiplicity;
+  using Intersection_curve = std::pair<X_monotone_curve_2, Multiplicity>;
 
 public:
   // c'tor
@@ -99,27 +87,22 @@ class Envelope_triangles_test_3 {
   // virtual destructor.
   virtual ~Envelope_triangles_test_3() { }
 
-  template <class SurfaceIterator>
+  template <typename SurfaceIterator>
   void construct_lu_envelope(SurfaceIterator begin, SurfaceIterator end,
-                             Minimization_diagram_2 &result)
-  {
-    if (begin == end)
-      return; // result is empty
+                             Minimization_diagram_2& result) {
+    if (begin == end) return; // result is empty
 
     std::vector<Xy_monotone_surface_3> surfaces;
-    SurfaceIterator si = begin;
-    for (; si != end; ++si)
-      surfaces.push_back(*si);
+    for (auto si = begin; si != end; ++si) surfaces.push_back(*si);
 
-    Md_point_location pl(result);
+    Md2_point_location pl(result);
 
     std::size_t number_of_surfaces = surfaces.size();
 
     std::list<X_monotone_curve_2> curves_col;
     std::list<Point_2> points_col;
-    for(std::size_t i=0; i<number_of_surfaces; ++i)
-    {
-      Xy_monotone_surface_3 &cur_surface = surfaces[i];
+    for (std::size_t i = 0; i < number_of_surfaces; ++i) {
+      Xy_monotone_surface_3& cur_surface = surfaces[i];
       // first insert all the projected curves of the boundary of the current
       // surface
 
@@ -134,7 +117,7 @@ class Envelope_triangles_test_3 {
       traits.construct_projected_boundary_2_object()
         (cur_surface, std::back_inserter(boundary_list));
       for (auto bit = boundary_list.begin(); bit != boundary_list.end(); ++bit) {
-        const Boundary_xcurve* boundary_cv = std::get_if<Boundary_xcurve>(&(*bit));
+        const auto* boundary_cv = std::get_if<Boundary_xcurve>(&(*bit));
         assert(boundary_cv!=nullptr);
         curves_col.push_back(boundary_cv->first);
       }
@@ -147,8 +130,7 @@ class Envelope_triangles_test_3 {
           (cur_surface, prev_surface, std::back_inserter(inter_objs));
 
         // we collect all intersections and use sweep to insert them
-        for(std::size_t k=0; k<inter_objs.size(); ++k)
-        {
+        for(std::size_t k=0; k<inter_objs.size(); ++k) {
           if (const Point_2* point = std::get_if<Point_2>(&inter_objs[k])) {
 #ifdef CGAL_DEBUG_ENVELOPE_TRIANGLES_TEST_3
               std::cout << "intersection between surfaces is a point: "
@@ -157,7 +139,8 @@ class Envelope_triangles_test_3 {
             //insert_vertex(result, point, pl);
             points_col.push_back(*point);
           }
-          else if (const Intersection_curve* curve = std::get_if<Intersection_curve>(&inter_objs[k])) {
+          else if (const auto* curve =
+                   std::get_if<Intersection_curve>(&inter_objs[k])) {
 #ifdef CGAL_DEBUG_ENVELOPE_TRIANGLES_TEST_3
               std::cout << "intersection between surfaces is a curve: "
                         << curve.first << std::endl;
@@ -165,26 +148,22 @@ class Envelope_triangles_test_3 {
             curves_col.push_back(curve->first);
             //insert(result, curve.first, pl);
           }
-          else
-          {
-            assert_msg(false, "wrong intersection type");
-          }
+          else assert_msg(false, "wrong intersection type");
         }
       }
     }
 
 #ifdef CGAL_DEBUG_ENVELOPE_TRIANGLES_TEST_3
     std::cout << "inserting the curves: " << std::endl;
-    typename std::list<Curve_2>::iterator curves_it = curves_col.begin();
-    for(; curves_it != curves_col.end(); ++curves_it)
+    for(auto curves_it = curves_col.begin(); curves_it != curves_col.end();
+        ++curves_it)
       std::cout << *curves_it << std::endl;
 #endif
 
     // insert the curves
     insert(result, curves_col.begin(), curves_col.end());
     // insert the points
-    typename std::list<Point_2>::iterator pit = points_col.begin();
-    for (; pit != points_col.end(); ++pit)
+    for (auto pit = points_col.begin(); pit != points_col.end(); ++pit)
       insert_point(result, *pit, pl);
 
     m_result = &result;
@@ -193,8 +172,7 @@ class Envelope_triangles_test_3 {
     // are minimal over it.
 
     // update vertices' data
-    Vertex_iterator vi = result.vertices_begin();
-    for (; vi != result.vertices_end(); ++vi) {
+    for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
       // first we find the surfaces that are defined over the vertex
       std::list<Xy_monotone_surface_3> defined_surfaces;
@@ -210,8 +188,8 @@ class Envelope_triangles_test_3 {
     }
 
     // update edges' data
-    Halfedge_iterator hi = result.halfedges_begin();
-    for (; hi != result.halfedges_end(); ++hi, ++hi) {
+    for (auto hi = result.halfedges_begin(); hi != result.halfedges_end();
+         ++hi, ++hi) {
       Halfedge_handle hh = hi;
       // first we find the surfaces that are defined over the edge
       std::list<Xy_monotone_surface_3> defined_surfaces;
@@ -229,12 +207,11 @@ class Envelope_triangles_test_3 {
     // init current face for caching of computation
     current_face = Face_handle();
 
-    Face_iterator fi;
-    for (fi = result.faces_begin(); fi != result.faces_end(); ++fi) {
+    for (auto fi = result.faces_begin(); fi != result.faces_end(); ++fi) {
       Face_handle fh = fi;
       // first we find the surfaces that are defined over the face
       std::list<Xy_monotone_surface_3> defined_surfaces;
-      for(std::size_t i=0; i<number_of_surfaces; ++i)
+      for (std::size_t i = 0; i < number_of_surfaces; ++i)
         if (is_surface_defined_over_face(fh, surfaces[i]))
           defined_surfaces.push_back(surfaces[i]);
 
@@ -247,17 +224,15 @@ class Envelope_triangles_test_3 {
   // test1
   // compare the 2 envelopes by computing a point inside each face of test_env
   // locating it in env, and comparing the above surfaces
-  bool compare_lu_envelopes_test1(Minimization_diagram_2 &test_env,
-                                  Minimization_diagram_2 &env)
-  {
+  bool compare_lu_envelopes_test1(Minimization_diagram_2& test_env,
+                                  Minimization_diagram_2& env) {
     // foreach face in the test envelope, compute a point inside the face,
     // locate it in the other envelope and compare the surfaces over the 2 faces
-    Md_point_location pl(env);
-    Face_iterator fi = test_env.faces_begin();
+    Md2_point_location pl(env);
     bool eq, result = true;
-    for (; fi != test_env.faces_end(); ++fi) {
+    for (auto fi = test_env.faces_begin(); fi != test_env.faces_end(); ++fi) {
       Face_handle fh = fi;
-      if (!fh->is_unbounded()) {
+      if (! fh->is_unbounded()) {
         Point_2 inside_test = compute_point_inside_face(test_env, fh);
         auto pl_obj = pl.locate(inside_test);
         // faces of env must contain the faces of test
@@ -275,10 +250,9 @@ class Envelope_triangles_test_3 {
   // compare the 2 envelopes by overlaying them, and then comparing the
   // surfaces over the faces of the result map
   // if faces_only = false we also compare the data over the edges & vertices
-  bool compare_lu_envelopes_test2(Minimization_diagram_2 &test_env,
-                                  Minimization_diagram_2 &env,
-                                  bool /* faces_only */ = true)
-  {
+  bool compare_lu_envelopes_test2(Minimization_diagram_2& test_env,
+                                  Minimization_diagram_2& env,
+                                  bool /* faces_only */ = true) {
     Minimization_diagram_2 overlay_map;
     // overlay the 2 maps, the overlay test functor does all the comparisons
     overlay(test_env, env, overlay_map);
@@ -286,27 +260,23 @@ class Envelope_triangles_test_3 {
   }
 
 protected:
-
   // fill the vertex with the surface on the envelope
   // all the surfaces are known to be defined over the vertex' point
-  template <class SurfaceIterator>
+  template <typename SurfaceIterator>
   void set_minimum_over_vertex(Vertex_handle v, SurfaceIterator begin,
-                               SurfaceIterator end)
-  {
-    if (begin == end)
-      v->set_no_data();
+                               SurfaceIterator end) {
+    if (begin == end) v->set_no_data();
     else {
-      SurfaceIterator si = begin;
+      auto si = begin;
       // we set the first surface as the minimum, and then compare all the others
-      v->set_data(*si);
+      v->set_env_data(*si);
       ++si;
       for (; si != end; ++si) {
         Comparison_result cr =
-          traits.compare_z_at_xy_3_object()(v->point(), v->get_data(), *si);
-        if (cr == EQUAL)
-          v->add_data(*si);
-        else if (cr == LARGER)
-          v->set_data(*si); // this erases all surfaces from vertex's list
+          traits.compare_z_at_xy_3_object()(v->point(), v->get_env_data(), *si);
+        if (cr == EQUAL) v->add_data(*si);
+        // this erases all surfaces from vertex's list
+        else if (cr == LARGER) v->set_env_data(*si);
         // else - new surface has no affect on the envelope
       }
     }
@@ -314,59 +284,53 @@ class Envelope_triangles_test_3 {
 
   // fill the edge with the surface on the envelope
   // all the surfaces are known to be defined over the edge's curve
-  template <class SurfaceIterator>
+  template <typename SurfaceIterator>
   void set_minimum_over_edge(const Halfedge_handle& h, SurfaceIterator begin,
-                             SurfaceIterator end)
-  {
-    if (begin == end)
-      h->set_no_data();
+                             SurfaceIterator end) {
+    if (begin == end) h->set_no_data();
     else {
-      if (h != current_edge)
-        compute_point_in_current_edge(h);
+      if (h != current_edge) compute_point_in_current_edge(h);
 
-      SurfaceIterator si = begin;
+      auto si = begin;
       // we set the first surface as the minimum, and then compare all the others
-      h->set_data(*si);
+      h->set_env_data(*si);
       ++si;
       for (; si != end; ++si) {
         Comparison_result cr =
           traits.compare_z_at_xy_3_object()(current_point_inside_edge,
-                                            h->get_data(), *si);
-        if (cr == EQUAL)
-          h->add_data(*si);
-        else if (cr == LARGER)
-          h->set_data(*si); // this erases all surfaces from halfedge's list
+                                            h->get_env_data(), *si);
+        if (cr == EQUAL) h->add_data(*si);
+        // this erases all surfaces from halfedge's list
+        else if (cr == LARGER) h->set_env_data(*si);
         // else - new surface has no affect on the envelope
       }
       // set twin's data
-      h->twin()->set_data(h->begin_data(), h->end_data());
+      h->twin()->set_env_data(h->begin_data(), h->end_data());
     }
   }
   // fill the face with the surface on the envelope
   // the surfaces are known to not intersect inside the face
   // (but might intersect on its edges)
-  template <class SurfaceIterator>
+  template <typename SurfaceIterator>
   void set_minimum_over_face(Face_handle face, SurfaceIterator begin,
-                             SurfaceIterator end)
-  {
+                             SurfaceIterator end) {
     if (face->is_unbounded() || begin == end) {
       // a special case - no surface over the unbounded face, and when there
       // are no surfaces at all
       face->set_no_data();
     }
     else {
-      SurfaceIterator si = begin;
+      auto si = begin;
       // we set the first surface as the minimum, and then compare all the
       // others
-      face->set_data(*si);
+      face->set_env_data(*si);
       ++si;
       for (; si != end; ++si) {
         Comparison_result cr =
-          compare_surfaces_over_face(face, face->get_data(), *si);
-        if (cr == EQUAL)
-          face->add_data(*si);
-        else if (cr == LARGER)
-          face->set_data(*si); // this erases all surfaces from face's list
+          compare_surfaces_over_face(face, face->get_env_data(), *si);
+        if (cr == EQUAL) face->add_data(*si);
+        // this erases all surfaces from face's list
+        else if (cr == LARGER) face->set_env_data(*si);
         // else - new surface has no affect on the envelope
       }
     }
@@ -379,8 +343,7 @@ class Envelope_triangles_test_3 {
   Comparison_result
   compare_surfaces_over_face(Face_handle face,
                              const Xy_monotone_surface_3& surf1,
-                             const Xy_monotone_surface_3& surf2)
-  {
+                             const Xy_monotone_surface_3& surf2) {
     Comparison_result result2 =
       compare_surfaces_over_face_v2(face, surf1, surf2);
 
@@ -407,8 +370,7 @@ class Envelope_triangles_test_3 {
   Comparison_result
   compare_surfaces_over_face_v1(const Face_handle& face,
                                 const Xy_monotone_surface_3& surf1,
-                                const Xy_monotone_surface_3& surf2)
-  {
+                                const Xy_monotone_surface_3& surf2) {
 
     // TODO: this works for triangles, but not for general surfaces
     // in the general case, should use surface_compare_on_right and
@@ -416,7 +378,7 @@ class Envelope_triangles_test_3 {
     // we iterate over the vertices of the face, and look for one that the
     // surfaces are not equal above it. (if doesn't exist, then the surfaces
     // overlap)
-    assert(!face->is_unbounded());
+    assert(! face->is_unbounded());
     Comparison_result cur_res;
     Ccb_halfedge_circulator hec = face->outer_ccb();
     Ccb_halfedge_circulator hec_begin = hec;
@@ -448,10 +410,9 @@ class Envelope_triangles_test_3 {
   // this version also works only for linear surfaces
   Comparison_result
   compare_surfaces_over_face_v2(const Face_handle& face,
-                                const Xy_monotone_surface_3 &surf1,
-                                const Xy_monotone_surface_3& surf2)
-  {
-    assert(!face->is_unbounded());
+                                const Xy_monotone_surface_3& surf1,
+                                const Xy_monotone_surface_3& surf2) {
+    assert(! face->is_unbounded());
     Comparison_result cur_res;
     if (face != current_face)
     compute_point_in_current_face(face);
@@ -468,11 +429,9 @@ class Envelope_triangles_test_3 {
 
   // check if the surface is defines over the edge
   bool is_surface_defined_over_edge(const Halfedge_handle& h,
-                                    Xy_monotone_surface_3 &surf)
-  {
+                                    Xy_monotone_surface_3& surf) {
     // check it over a point inside the edge's curve
-    if (h != current_edge)
-      compute_point_in_current_edge(h);
+    if (h != current_edge) compute_point_in_current_edge(h);
 
     bool result =
       traits.is_defined_over_object()(current_point_inside_edge, surf);
@@ -481,11 +440,10 @@ class Envelope_triangles_test_3 {
 
   // check if the surface is defines over the face
   bool is_surface_defined_over_face(const Face_handle& face,
-                                    Xy_monotone_surface_3 &surf)
+                                    Xy_monotone_surface_3& surf)
   {
     // we always have bounded surfaces
-    if (face->is_unbounded())
-      return false;
+    if (face->is_unbounded()) return false;
 
     bool result2 = is_surface_defined_over_face_v2(face, surf);
 
@@ -505,16 +463,14 @@ class Envelope_triangles_test_3 {
   // check if the surface is defines over the face
   // this is version 1 which check all the vertices of the face
   bool is_surface_defined_over_face_v1(const Face_handle& face,
-                                       Xy_monotone_surface_3 &surf)
-  {
+                                       Xy_monotone_surface_3& surf) {
     // for now, we go over all the vertices of the face
 
-    typename Traits::Is_defined_over is_defined_over =
-      traits.is_defined_over_object();
+    auto is_defined_over = traits.is_defined_over_object();
 
     // check vertices on the outer ccb
     bool result = true;
-    if (!face->is_unbounded()) {
+    if (! face->is_unbounded()) {
       Ccb_halfedge_circulator hec = face->outer_ccb();
       Ccb_halfedge_circulator hec_begin = hec;
       do {
@@ -522,7 +478,7 @@ class Envelope_triangles_test_3 {
         bool tmp_result = is_defined_over(target_2,surf);
 
         #ifdef CGAL_DEBUG_ENVELOPE_TRIANGLES_TEST_3
-          std::cout << "is define over returned " << tmp_result << std::endl;
+        std::cout << "is define over returned " << tmp_result << std::endl;
         #endif
 
         result &= tmp_result;
@@ -530,8 +486,7 @@ class Envelope_triangles_test_3 {
       } while(hec != hec_begin && result);
     }
 
-    if (result == false)
-      return result;
+    if (result == false) return result;
 
     // check vertices on holes boundary
     Hole_iterator hi;
@@ -549,8 +504,7 @@ class Envelope_triangles_test_3 {
         result &= tmp_result;
         hec++;
       } while(hec != hec_begin && result);
-      if (result == false)
-        return result;
+      if (result == false) return result;
     }
 
     return result;
@@ -559,8 +513,7 @@ class Envelope_triangles_test_3 {
   // check if the surface is defines over the face
   // this is version 2 which check the point inside the face
   bool is_surface_defined_over_face_v2(const Face_handle& face,
-                                       Xy_monotone_surface_3 &surf)
-  {
+                                       Xy_monotone_surface_3& surf) {
     if (face != current_face)
       compute_point_in_current_face(face);
 
@@ -570,10 +523,9 @@ class Envelope_triangles_test_3 {
   }
 
   // compute a point inside the face of the arranegement
-  Point_2 compute_point_inside_face(Minimization_diagram_2 &env,
-                                    Face_handle face)
-  {
-    assert(!face->is_unbounded());
+  Point_2 compute_point_inside_face(Minimization_diagram_2& env,
+                                    Face_handle face) {
+    assert(! face->is_unbounded());
 
     #ifdef CGAL_DEBUG_ENVELOPE_TRIANGLES_TEST_3
       std::cout << "in compute point inside face" << std::endl;
@@ -584,7 +536,7 @@ class Envelope_triangles_test_3 {
     Ccb_halfedge_circulator hec_begin = hec;
     bool found = false;
     do {
-      if (!traits.is_vertical_2_object()(hec->curve())) {
+      if (! traits.is_vertical_2_object()(hec->curve())) {
         found = true;
         continue;
       }
@@ -611,17 +563,15 @@ class Envelope_triangles_test_3 {
                                   (found_hh->curve())))
       shoot_up = false;
 
-    Md_point_location pl(env);
+    Md2_point_location pl(env);
     Object shoot_obj;
     Halfedge_const_handle shoot_hh;
     Vertex_const_handle shoot_vh;
 
     Point_2 shoot_target;
 
-    if (shoot_up)
-      shoot_obj = pl.ray_shoot_up(shoot_source);
-    else
-      shoot_obj = pl.ray_shoot_down(shoot_source);
+    if (shoot_up) shoot_obj = pl.ray_shoot_up(shoot_source);
+    else shoot_obj = pl.ray_shoot_down(shoot_source);
 
     if (assign(shoot_hh, shoot_obj)) {
       shoot_target =
@@ -630,8 +580,7 @@ class Envelope_triangles_test_3 {
     else if (assign(shoot_vh, shoot_obj)) {
       shoot_target = (env.non_const_handle(shoot_vh))->point();
     }
-    else
-      CGAL_error(); // it cannot be the unbounded face
+    else CGAL_error(); // it cannot be the unbounded face
 
     Point_2 res_point =
       traits.construct_middle_point(shoot_source, shoot_target);
@@ -652,16 +601,14 @@ class Envelope_triangles_test_3 {
 
   // compute a point inside the face saved in current_face
   // and put the result into current_point
-  void compute_point_in_current_face(Face_handle face)
-  {
+  void compute_point_in_current_face(Face_handle face) {
     current_face = face;
     current_point = compute_point_inside_face(*m_result, current_face);
   }
 
   // compute a point inside the edge saved in current_edge
   // and put the result into current_point_inside_edge
-  void compute_point_in_current_edge(Halfedge_handle h)
-  {
+  void compute_point_in_current_edge(Halfedge_handle h) {
     current_edge = h;
     current_point_inside_edge = traits.construct_middle_point(h->curve());
   }

From 83be94646e6daf02f89244eb6dbf5234c4920107 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 30 Jan 2024 01:07:33 +0200
Subject: [PATCH 1321/1398] Cleaned up

---
 .../CGAL/Env_surface_data_traits_3.h          | 203 ++++++++----------
 1 file changed, 87 insertions(+), 116 deletions(-)

diff --git a/Envelope_3/doc/Envelope_3/CGAL/Env_surface_data_traits_3.h b/Envelope_3/doc/Envelope_3/CGAL/Env_surface_data_traits_3.h
index bcd4f97ab418..cdfb26c219f0 100644
--- a/Envelope_3/doc/Envelope_3/CGAL/Env_surface_data_traits_3.h
+++ b/Envelope_3/doc/Envelope_3/CGAL/Env_surface_data_traits_3.h
@@ -1,84 +1,64 @@
 namespace CGAL {
 
-/*!
-\ingroup PkgEnvelope3Ref
-
-The class `Env_surface_data_traits_3` is a model of the `EnvelopeTraits_3` concept
-and serves as a decorator class that allows the extension of the surfaces
-defined by the base traits-class (the `Traits` parameter), which serves
-as a geometric traits-class (a model of the `EnvelopeTraits_3` concept),
-with extraneous (non-geometric) data fields.
-
-The traits-class decorator extends the `Surface_3` and the
-`Xy_monotone_surface_3` types as detailed below.
-Each `Surface_3` object is associated with a single data field of type
-`SData`, and each `Xy_monotone_surface_3` object is associated with
-a single data field of type `XyData`. When a surface is
-subdivided into \f$ xy\f$-monotone surfaces, its data field is converted using
-the conversion functor, which is specified by the `Cnv` template-parameter,
-and the resulting objects is copied to all `Xy_monotone_surface_3` objects
-induced by this surface. The conversion functor should provide an operator with
-the following prototype:
-
-`XyData operator() (const SData& d) const;`
-
-By default, the two data types are the same, so the conversion operator
-is trivial and just copies the data object:
-
-<TABLE><TR><TD>
-`SData` =
-</TD>
-<TD>
-`XyData`
-</TD></TR>
-<TR><TD>
-`Cnv` =
-</TD>
-<TD>
-`_Default_convert_functor<SData,XyData>`
-</TD></TR>
-</TABLE>
-
-\cgalModels{EnvelopeTraits_3}
-
-*/
-template< typename Traits, typename XyData, typename SData, typename Cnv >
+/*! \ingroup PkgEnvelope3Ref
+ *
+ * The class `Env_surface_data_traits_3` is a model of the `EnvelopeTraits_3`
+ * concept and serves as a decorator class that allows the extension of the
+ * surfaces defined by the base traits-class (the `Traits` parameter), which
+ * serves as a geometric traits-class (a model of the `EnvelopeTraits_3`
+ * concept), with extraneous (non-geometric) data fields.
+ *
+ * The traits-class decorator extends the `Surface_3` and the
+ * `Xy_monotone_surface_3` types as detailed below.  Each `Surface_3` object is
+ * associated with a single data field of type `SData`, and each
+ * `Xy_monotone_surface_3` object is associated with a single data field of type
+ * `XyData`. When a surface is subdivided into \f$ xy\f$-monotone surfaces, its
+ * data field is converted using the conversion functor, which is specified by
+ * the `Cnv` template-parameter, and the resulting objects is copied to all
+ * `Xy_monotone_surface_3` objects induced by this surface. The conversion
+ * functor should provide an operator with the following prototype:
+ *
+ * `XyData operator() (const SData& d) const;`
+ *
+ * By default, the two data types are the same, so the conversion operator
+ * is trivial and just copies the data object:
+ *
+ * <TABLE><TR>
+ * <TD>`SData` =</TD>
+ * <TD>`XyData`</TD>
+ * </TR>
+ * <TR>
+ * <TD>`Cnv` =</TD>
+ * <TD>`_Default_convert_functor<SData,XyData>`</TD>
+ * </TR></TABLE>
+ *
+ * \cgalModels{EnvelopeTraits_3}
+ *
+ */
+template <typename Traits, typename XyData, typename SData, typename Cnv>
 class Env_surface_data_traits_3 : public Traits {
 public:
 
-/// \name Types
-/// @{
+  /// \name Types
+  /// @{
 
-/*!
-the base traits-class.
-*/
-typedef Traits Base_traits_3;
+  //! the base traits-class.
+  typedef Traits Base_traits_3;
 
-/*!
-the base surface.
-*/
-typedef typename Base_traits_3::Surface_3 Base_surface_3;
+  //! the base surface.
+  typedef typename Base_traits_3::Surface_3 Base_surface_3;
 
-/*!
-the base \f$ xy\f$-monotone surface surface.
-*/
-typedef typename Base_traits_3::Xy_monotone_surface_3 Base_xy_monotone_surface_3;
+  //! the base \f$ xy\f$-monotone surface surface.
+  typedef typename Base_traits_3::Xy_monotone_surface_3 Base_xy_monotone_surface_3;
 
-/*!
-the conversion functor.
-*/
-typedef Cnv Convert;
+  //! the conversion functor.
+  typedef Cnv Convert;
 
-/*!
-the type of data associated with surfaces.
-*/
-typedef SData Surface_data;
-
-/*!
-the type of data associated with \f$ xy\f$-monotone surfaces.
-*/
-typedef XyData Xy_monotone_surface_data;
+  //! the type of data associated with surfaces.
+  typedef SData Surface_data;
 
+  //! the type of data associated with \f$ xy\f$-monotone surfaces.
+  typedef XyData Xy_monotone_surface_data;
 
   /// The `Surface_3` class nested within the surface-data traits
   /// extends the `Base_traits_3::Surface_3` type with an extra data field.
@@ -87,38 +67,33 @@ typedef XyData Xy_monotone_surface_data;
     /// \name Creation
     /// @{
 
-    /*!
-    default constructor.
-    */
-    Surface_3 ();
+    /*! default constructor.
+     */
+    Surface_3();
 
-    /*!
-    constructs surface from the given `base` surface with uninitialized
-    data field.
-    */
-    Surface_3 (const Base_surface_3& base);
+    /*! constructs surface from the given `base` surface with uninitialized
+     * data field.
+     */
+    Surface_3(const Base_surface_3& base);
 
-    /*!
-    constructs surface from the given `base` surface with an attached
-    `data` field.
-    */
-    Surface_3 (const Base_surface_3& base, const Surface_data& data);
+    /*! constructs surface from the given `base` surface with an attached
+     * `data` field.
+     */
+    Surface_3(const Base_surface_3& base, const Surface_data& data);
 
     /// @}
 
     /// \name Access Functions
     /// @{
 
-    /*!
-    returns the data field (a non-const version, which returns a reference
-    to the data object, is also available).
-    */
+    /*! returns the data field (a non-const version, which returns a reference
+     * to the data object, is also available).
+     */
     const Surface_data& data () const;
 
-    /*!
-    sets the data field.
-    */
-    void set_data (const Surface_data& data);
+    /*! sets the data field.
+     */
+    void set_env_data (const Surface_data& data);
 
     /// @}
   };
@@ -131,22 +106,19 @@ typedef XyData Xy_monotone_surface_data;
     /// \name Creation
     /// @{
 
-    /*!
-    default constructor.
-    */
+    /*! default constructor.
+     */
     Xy_monotone_surface_3 ();
 
-    /*!
-    constructs an \f$ xy\f$-monotone surface from the given `base` surface with
-    uninitialized data field.
-    */
-    Xy_monotone_surface_3 (const Base_xy_monotone_surface_3& base);
-
-    /*!
-    constructs an \f$ x\f$-monotone surface from the given `base` \f$ x\f$-monotone
-    surface with an attached `data` field.
-    */
-    Xy_monotone_surface_3 (const Base_xy_monotone_surface_3& base,
+    /*! constructs an \f$ xy\f$-monotone surface from the given `base` surface
+     * with uninitialized data field.
+     */
+    Xy_monotone_surface_3(const Base_xy_monotone_surface_3& base);
+
+    /*! constructs an \f$ x\f$-monotone surface from the given `base`
+     * \f$ x\f$-monotone surface with an attached `data` field.
+     */
+    Xy_monotone_surface_3(const Base_xy_monotone_surface_3& base,
     const Xy_monotone_surface_data& data);
 
     /// @}
@@ -154,21 +126,20 @@ typedef XyData Xy_monotone_surface_data;
     /// \name Access Functions
     /// @{
 
-    /*!
-    returns the field (a non-const version, which returns a reference
-    to the data object, is also available).
-    */
-    const Xy_monotone_surface_data& data () const;
+    /*! returns the field (a non-const version, which returns a reference
+     * to the data object, is also available).
+     */
+    const Xy_monotone_surface_data& data() const;
 
-    /*!
-    sets the data field.
-    */
-    void set_data (const Xy_monotone_surface_data& data);
+    /*! sets the data field.
+     */
+    void set_env_data(const Xy_monotone_surface_data& data);
 
     /// @}
   };
 
-/// @}
+  /// @}
 
 }; /* end */
+
 } /* end namespace CGAL */

From 09761aa0c30a9ff188a8eed4c33320144a63d840 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 30 Jan 2024 11:12:49 +0200
Subject: [PATCH 1322/1398] Fixed the 'other' type nested in the rebind struct

---
 .../include/CGAL/Envelope_3/Envelope_pm_dcel.h    | 15 +++++++++++++--
 1 file changed, 13 insertions(+), 2 deletions(-)

diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
index 33117b474f9f..999cdadc140d 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
@@ -498,6 +498,8 @@ class Envelope_pm_dcel :
                              Envelope_pm_face<FaceBase, DcelData>> {
 public:
   using Dcel_data = DcelData;
+  using Vertex_base = VertexBase;
+  using Halfedge_base = HalfedgeBase;
   using Face_base = FaceBase;
 
   using Face_data = Dcel_data;
@@ -520,8 +522,17 @@ class Envelope_pm_dcel :
   /*! \struct
    * An auxiliary structure for rebinding the DCEL with a new traits class.
    */
-  template<typename T>
-  struct rebind { typedef Envelope_pm_dcel<T, Face_data> other; };
+  template <typename T>
+  struct rebind {
+    using Pnt = typename T::Point_2;
+    using Xcv = typename T::X_monotone_curve_2;
+    using Rebind_v = typename Vertex_base::template rebind<Pnt>;
+    using V_other = typename Rebind_v::other;
+    using Rebind_h = typename Halfedge_base::template rebind<Xcv>;
+    using H_other = typename Rebind_h::other;
+
+    typedef Envelope_pm_dcel<T, Dcel_data, V_other, H_other, Face_base> other;
+  };
 
   /*! Constructor */
   Envelope_pm_dcel() {}

From b6fb9a5aa1798438bffa9f6466f206e9086dc8f0 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 30 Jan 2024 14:48:59 +0200
Subject: [PATCH 1323/1398] Made all members of the cell-extension records
 unique (e.g., added 'env_'); this enables the simultaneous extensions
 required by other packages; for example, having a lower envelope diagram with
 history.

---
 .../Envelope_divide_and_conquer_3.h           | 593 +++++++++---------
 .../Envelope_3/Envelope_element_visitor_3.h   | 403 ++++++------
 .../CGAL/Envelope_3/Envelope_overlay_2.h      | 224 +++----
 .../Envelope_3/Envelope_overlay_functor.h     | 119 ++--
 .../CGAL/Envelope_3/Envelope_pm_dcel.h        | 159 +++--
 Envelope_3/test/Envelope_3/Envelope_test_3.h  | 104 +--
 .../Envelope_test_overlay_functor.h           |  38 +-
 .../Envelope_3/Envelope_triangles_test_3.h    |  61 +-
 8 files changed, 818 insertions(+), 883 deletions(-)

diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
index 2bc19cf65c70..ad237a7e99f0 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
@@ -34,9 +34,10 @@
 #include <CGAL/Envelope_3/set_dividors.h>
 
 #ifdef CGAL_ENVELOPE_USE_BFS_FACE_ORDER
+#include <boost/graph/dijkstra_shortest_paths.hpp>
+
 #include <CGAL/Arr_face_index_map.h>
 #include <CGAL/graph_traits_dual_arrangement_on_surface_2.h>
-#include <boost/graph/dijkstra_shortest_paths.hpp>
 #endif
 
 // this base divide & conquer algorithm splits the input into 2 groups,
@@ -129,7 +130,7 @@ class Envelope_divide_and_conquer_3 {
     m_own_traits = true;
 
     // Allocate the Envelope resolver with our traits
-    resolver = new Envelope_resolver(m_geom_traits, type);
+    m_resolver = new Envelope_resolver(m_geom_traits, type);
 
     m_is_lower = ((type == ENVELOPE_LOWER) ? true : false);
   }
@@ -141,7 +142,7 @@ class Envelope_divide_and_conquer_3 {
     m_own_traits = false;
 
     // Allocate the Envelope resolver with our traits
-    resolver = new Envelope_resolver(m_geom_traits, type);
+    m_resolver = new Envelope_resolver(m_geom_traits, type);
 
     m_is_lower = ((type == ENVELOPE_LOWER) ? true : false);
   }
@@ -152,7 +153,7 @@ class Envelope_divide_and_conquer_3 {
     if (m_own_traits) delete m_geom_traits;
 
     // Free the resolver
-    delete resolver;
+    delete m_resolver;
   }
 
   // compute the envelope of surfaces in 3D, using the default arbitrary
@@ -213,7 +214,7 @@ class Envelope_divide_and_conquer_3 {
   /*! Access the traits object. */
   const Traits* get_traits() const { return m_geom_traits; }
 
-  void reset() { resolver->reset(); }
+  void reset() { m_resolver->reset(); }
 
 protected:
 
@@ -276,8 +277,7 @@ class Envelope_divide_and_conquer_3 {
       return;
     }
 
-    for (auto boundary_it = boundary.begin();
-         boundary_it != boundary.end();
+    for (auto boundary_it = boundary.begin(); boundary_it != boundary.end();
          ++boundary_it) {
       if (const Boundary_xcurve* boundary_cv =
           std::get_if<Boundary_xcurve>(&(*boundary_it))) {
@@ -287,8 +287,8 @@ class Envelope_divide_and_conquer_3 {
 
         if (side == ON_ORIENTED_BOUNDARY) {
           // vertical xy-surface
-          he->face()->set_no_data();
-          he->twin()->face()->set_no_data();
+          he->face()->set_no_env_data();
+          he->twin()->face()->set_no_env_data();
 
           continue;
         }
@@ -301,49 +301,45 @@ class Envelope_divide_and_conquer_3 {
           if (side == ON_NEGATIVE_SIDE) { // the surface is below cv.
             f = he->twin()->face();
             f->set_env_data(surf);
-            he->face()->set_no_data();
+            he->face()->set_no_env_data();
           }
           else {
             CGAL_assertion(side == ON_POSITIVE_SIDE);
             f = he->face();
             f->set_env_data(surf);
-            he->twin()->face()->set_no_data();
+            he->twin()->face()->set_no_env_data();
           }
 
           // init auxiliary data for f and its boundaries.
           for (auto ocit = f->outer_ccbs_begin(); ocit != f->outer_ccbs_end();
-               ocit++) {
+               ++ocit) {
             Ccb_halfedge_circulator face_hec = *ocit;
             Ccb_halfedge_circulator face_hec_begin = face_hec;
             do {
-                face_hec->set_is_equal_data_in_face(true);
-                face_hec->set_has_equal_data_in_face(true);
-                face_hec->set_has_equal_data_in_target_and_face(true);
-
-                face_hec->twin()->set_is_equal_data_in_face(false);
-                face_hec->twin()->set_has_equal_data_in_face(false);
-                face_hec->twin()->set_has_equal_data_in_target_and_face(false);
-
-                ++face_hec;
-              }
-            while(face_hec != face_hec_begin);
+              face_hec->set_is_equal_env_data_in_face(true);
+              face_hec->set_has_equal_env_data_in_face(true);
+              face_hec->set_has_equal_env_data_in_target_and_face(true);
+
+              face_hec->twin()->set_is_equal_env_data_in_face(false);
+              face_hec->twin()->set_has_equal_env_data_in_face(false);
+              face_hec->twin()->set_has_equal_env_data_in_target_and_face(false);
+            }
+            while (++face_hec != face_hec_begin);
           }
           for (auto icit = f->inner_ccbs_begin(); icit != f->inner_ccbs_end();
-               icit++) {
+               ++icit) {
             Ccb_halfedge_circulator face_hec = *icit;
             Ccb_halfedge_circulator face_hec_begin = face_hec;
             do {
-                face_hec->set_is_equal_data_in_face(true);
-                face_hec->set_has_equal_data_in_face(true);
-                face_hec->set_has_equal_data_in_target_and_face(true);
-
-                face_hec->twin()->set_is_equal_data_in_face(false);
-                face_hec->twin()->set_has_equal_data_in_face(false);
-                face_hec->twin()->set_has_equal_data_in_target_and_face(false);
-
-                ++face_hec;
-              }
-            while(face_hec != face_hec_begin);
+              face_hec->set_is_equal_env_data_in_face(true);
+              face_hec->set_has_equal_env_data_in_face(true);
+              face_hec->set_has_equal_env_data_in_target_and_face(true);
+
+              face_hec->twin()->set_is_equal_env_data_in_face(false);
+              face_hec->twin()->set_has_equal_env_data_in_face(false);
+              face_hec->twin()->set_has_equal_env_data_in_target_and_face(false);
+            }
+            while (++face_hec != face_hec_begin);
           }
         }
       }
@@ -363,17 +359,17 @@ class Envelope_divide_and_conquer_3 {
       // since all the edges & vertices have their envelope data equal to the
       // current surface, we can set is/has equal_data_in_target of all
       // halfedges to true
-      hi->set_is_equal_data_in_target(true);
-      hi->set_has_equal_data_in_target(true);
+      hi->set_is_equal_env_data_in_target(true);
+      hi->set_has_equal_env_data_in_target(true);
     }
 
     for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
       vi->set_env_data(surf);
       if (vi->is_isolated()) {
         // update the is/has equal_data_in_face flags according to the face data
-        bool equal_data = !vi->face()->has_no_data();
-        vi->set_is_equal_data_in_face(equal_data);
-        vi->set_has_equal_data_in_face(equal_data);
+        bool equal_data = !vi->face()->has_no_env_data();
+        vi->set_is_equal_env_data_in_face(equal_data);
+        vi->set_has_equal_env_data_in_face(equal_data);
       }
     }
   }
@@ -409,9 +405,9 @@ class Envelope_divide_and_conquer_3 {
       Halfedge_handle hh = ei;
       // there must be data from at least one map, because all the surfaces
       // are continuous
-      if (!get_aux_is_set(hh, 0) || !get_aux_is_set(hh, 1)) continue;
-      CGAL_assertion(get_aux_is_set(hh, 0));
-      CGAL_assertion(get_aux_is_set(hh, 1));
+      if (! aux_is_set(hh, 0) || !aux_is_set(hh, 1)) continue;
+      CGAL_assertion(aux_is_set(hh, 0));
+      CGAL_assertion(aux_is_set(hh, 1));
       CGAL_assertion(!aux_has_no_data(hh, 1) || !aux_has_no_data(hh, 0));
       if (aux_has_no_data(hh, 0) && !aux_has_no_data(hh, 1)) {
         hh->set_decision(DAC_DECISION_SECOND);
@@ -426,12 +422,12 @@ class Envelope_divide_and_conquer_3 {
 
       bool should_resolve = true;
 #ifdef CGAL_ENVELOPE_SAVE_COMPARISONS
-        if (hh->get_has_equal_aux_data_in_face(0) &&
-            hh->get_has_equal_aux_data_in_face(1))
+        if (hh->has_equal_aux_data_in_face(0) &&
+            hh->has_equal_aux_data_in_face(1))
           should_resolve = false;
 
-        if (hh->twin()->get_has_equal_aux_data_in_face(0) &&
-            hh->twin()->get_has_equal_aux_data_in_face(1))
+        if (hh->twin()->has_equal_aux_data_in_face(0) &&
+            hh->twin()->has_equal_aux_data_in_face(1))
           should_resolve = false;
 #endif
 
@@ -442,7 +438,7 @@ class Envelope_divide_and_conquer_3 {
     }
     // now deal with the edges
     for (auto li = edges_to_resolve.begin(); li != edges_to_resolve.end(); ++li)
-      resolver->resolve(*li, result);
+      m_resolver->resolve(*li, result);
     edges_to_resolve.clear();
 
     // decompose the result, to have faces without holes
@@ -480,39 +476,36 @@ class Envelope_divide_and_conquer_3 {
     // traverse the faces in arbitrary order
     for (auto fi = result.faces_begin(); fi != result.faces_end(); ++fi) {
       Face_handle fh = fi;
-        // if a surface of one map doesn't exist, then we set the second surface
-        if (aux_has_no_data(fh, 0) && !aux_has_no_data(fh, 1)) {
-          fh->set_decision(DAC_DECISION_SECOND);
-          continue;
-        }
-        else if (aux_has_no_data(fh, 0) && aux_has_no_data(fh, 1)) {
-          fh->set_decision(EQUAL);
-          fh->set_no_data();
-
-          continue;
-        }
-        else if (!aux_has_no_data(fh, 0) && aux_has_no_data(fh, 1)) {
-          fh->set_decision(DAC_DECISION_FIRST);
-          continue;
-        }
-
-        // here, we have both surfaces.
-        // we save the face in a list for a later treatment, because the
-        // face can change and destroy the iterator
-        faces_to_split.push_back(fh);
+      // if a surface of one map doesn't exist, then we set the second surface
+      if (aux_has_no_data(fh, 0) && !aux_has_no_data(fh, 1)) {
+        fh->set_decision(DAC_DECISION_SECOND);
+        continue;
+      }
+      else if (aux_has_no_data(fh, 0) && aux_has_no_data(fh, 1)) {
+        fh->set_decision(EQUAL);
+        fh->set_no_env_data();
+        continue;
       }
+      else if (!aux_has_no_data(fh, 0) && aux_has_no_data(fh, 1)) {
+        fh->set_decision(DAC_DECISION_FIRST);
+        continue;
+      }
+
+      // here, we have both surfaces.
+      // we save the face in a list for a later treatment, because the
+      // face can change and destroy the iterator
+      faces_to_split.push_back(fh);
+    }
 #endif
 
     deal_with_faces_to_split(faces_to_split, result);
 
-//    #ifndef CGAL_ENVELOPE_SAVE_COMPARISONS
-//      hi = result.halfedges_begin();
-//      for (; hi != result.halfedges_end(); ++hi, ++hi)
-//      {
-//        if (!hi->is_decision_set())
-//          resolver->resolve(hi, result);
-//      }
-//    #endif
+    // #ifndef CGAL_ENVELOPE_SAVE_COMPARISONS
+    //   hi = result.halfedges_begin();
+    //   for (; hi != result.halfedges_end(); ++hi, ++hi) {
+    //     if (!hi->is_decision_set()) m_resolver->resolve(hi, result);
+    //   }
+    // #endif
 
     // detach the edge_observer from result, since no need for it anymore
     edge_observer.detach();
@@ -520,12 +513,11 @@ class Envelope_divide_and_conquer_3 {
     // compute the surface on the envelope for each vertex
     for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
-      if (vh->is_decision_set())
-        continue;
+      if (vh->is_decision_set()) continue;
       // there must be data from at least one map, because all the surfaces
       // are continuous
-      CGAL_assertion(get_aux_is_set(vh, 0));
-      CGAL_assertion(get_aux_is_set(vh, 1));
+      CGAL_assertion(aux_is_set(vh, 0));
+      CGAL_assertion(aux_is_set(vh, 1));
       CGAL_assertion(!aux_has_no_data(vh, 1) || !aux_has_no_data(vh, 0));
       if (aux_has_no_data(vh, 0) && !aux_has_no_data(vh, 1)) {
         vh->set_decision(DAC_DECISION_SECOND);
@@ -535,8 +527,7 @@ class Envelope_divide_and_conquer_3 {
         vh->set_decision(DAC_DECISION_FIRST);
         continue;
       }
-      resolver->resolve(vh);
-
+      m_resolver->resolve(vh);
     }
 
     CGAL_expensive_assertion_msg(result.is_valid(),
@@ -562,7 +553,7 @@ class Envelope_divide_and_conquer_3 {
     CGAL_expensive_assertion_msg(result.is_valid(),
                        "after remove vertices result is not valid");
 
-    // update is_equal_data and has_equal_data of halfedge->face and
+    // update is_equal_env_data and has_equal_env_data of halfedge->face and
     // vertex->face relations, according to the decision, and the aux
     // similar flags
     update_flags(result);
@@ -577,21 +568,21 @@ class Envelope_divide_and_conquer_3 {
                                  "after merge result is not valid");
   }
 
-
 protected:
-
   void deal_with_faces_to_split(std::list<Face_handle>& faces_to_split,
                                 Minimization_diagram_2& result) {
     // for each face in faces_to_split, find the intersection over the face,
     // and split the face
     for (auto li = faces_to_split.begin(); li != faces_to_split.end(); ++li)
-      resolver->resolve(*li, result);
+      m_resolver->resolve(*li, result);
     faces_to_split.clear();
   }
 
   template <typename InputIterator>
-  bool is_equal_data(const InputIterator& begin1, const InputIterator& end1,
-                     const InputIterator& begin2, const InputIterator& end2) {
+  bool is_equal_env_data(const InputIterator& begin1,
+                         const InputIterator& end1,
+                         const InputIterator& begin2,
+                         const InputIterator& end2) {
     // insert the input data objects into a set
     std::set<Xy_monotone_surface_3> first(begin1, end1);
     std::set<Xy_monotone_surface_3> second(begin2, end2);
@@ -603,10 +594,10 @@ class Envelope_divide_and_conquer_3 {
 
   // todo: should remove the uses of this method from this class
   template <typename InputIterator>
-  bool has_equal_data(const InputIterator& begin1,
-                      const InputIterator& end1,
-                      const InputIterator& begin2,
-                      const InputIterator& end2) {
+  bool has_equal_env_data(const InputIterator& begin1,
+                          const InputIterator& end1,
+                          const InputIterator& begin2,
+                          const InputIterator& end2) {
     // insert the input data objects into a set
     std::set<Xy_monotone_surface_3> first(begin1, end1);
     std::set<Xy_monotone_surface_3> second(begin2, end2);
@@ -623,9 +614,9 @@ class Envelope_divide_and_conquer_3 {
   bool has_equal_aux_data(unsigned int id, FeatureHandle1 fh1,
                           FeatureHandle2 fh2) {
     Envelope_data_iterator begin1, end1, begin2, end2;
-    get_aux_data_iterators(id, fh1, begin1, end1);
-    get_aux_data_iterators(id, fh2, begin2, end2);
-    bool has_eq = has_equal_data(begin1, end1, begin2, end2);
+    aux_data_iterators(id, fh1, begin1, end1);
+    aux_data_iterators(id, fh2, begin2, end2);
+    bool has_eq = has_equal_env_data(begin1, end1, begin2, end2);
     return has_eq;
   }
 
@@ -641,7 +632,7 @@ class Envelope_divide_and_conquer_3 {
       if (can_remove_edge(hh)) edges.push_back(hh);
     }
 
-    for (auto  ci = edges.begin(); ci != edges.end(); ++ci) {
+    for (auto ci = edges.begin(); ci != edges.end(); ++ci) {
       // if the endpoints become isolated after the removal we need to remove
       // them if they have the same data as the edge
       Halfedge_handle h = *ci;
@@ -650,20 +641,20 @@ class Envelope_divide_and_conquer_3 {
       CGAL_assertion_code(Face_handle h_face = h->face());
       bool remove_src = can_remove_edge_target(h->twin());
       bool remove_trg = can_remove_edge_target(h);
-      bool src_is_equal_0 = (h->twin()->get_is_equal_aux_data_in_face(0) &&
-                             h->twin()->get_is_equal_aux_data_in_target(0));
-      bool src_is_equal_1 = (h->twin()->get_is_equal_aux_data_in_face(1) &&
-                             h->twin()->get_is_equal_aux_data_in_target(1));
-      bool trg_is_equal_0 = (h->get_is_equal_aux_data_in_face(0) &&
-                             h->get_is_equal_aux_data_in_target(0));
-      bool trg_is_equal_1 = (h->get_is_equal_aux_data_in_face(1) &&
-                             h->get_is_equal_aux_data_in_target(1));
+      bool src_is_equal_0 = (h->twin()->is_equal_aux_data_in_face(0) &&
+                             h->twin()->is_equal_aux_data_in_target(0));
+      bool src_is_equal_1 = (h->twin()->is_equal_aux_data_in_face(1) &&
+                             h->twin()->is_equal_aux_data_in_target(1));
+      bool trg_is_equal_0 = (h->is_equal_aux_data_in_face(0) &&
+                             h->is_equal_aux_data_in_target(0));
+      bool trg_is_equal_1 = (h->is_equal_aux_data_in_face(1) &&
+                             h->is_equal_aux_data_in_target(1));
       bool src_has_equal_0 =
-        h->twin()->get_has_equal_aux_data_in_target_and_face(0);
+        h->twin()->has_equal_aux_data_in_target_and_face(0);
       bool src_has_equal_1 =
-        h->twin()->get_has_equal_aux_data_in_target_and_face(1);
-      bool trg_has_equal_0 = h->get_has_equal_aux_data_in_target_and_face(0);
-      bool trg_has_equal_1 = h->get_has_equal_aux_data_in_target_and_face(1);
+        h->twin()->has_equal_aux_data_in_target_and_face(1);
+      bool trg_has_equal_0 = h->has_equal_aux_data_in_target_and_face(0);
+      bool trg_has_equal_1 = h->has_equal_aux_data_in_target_and_face(1);
 
       /* A vertex at an open boundary is removed once it becomes redundant
        * regardless of the boolean values passed as the 2nd and 3rd argument
@@ -690,8 +681,7 @@ class Envelope_divide_and_conquer_3 {
         src->set_has_equal_aux_data_in_face(0, src_has_equal_0);
         src->set_has_equal_aux_data_in_face(1, src_has_equal_1);
       }
-      if (!remove_trg && trg->is_isolated())
-      {
+      if (! remove_trg && trg->is_isolated()) {
         trg->set_is_equal_aux_data_in_face(0, trg_is_equal_0);
         trg->set_is_equal_aux_data_in_face(1, trg_is_equal_1);
         // make sure h_face is also trg face
@@ -707,15 +697,15 @@ class Envelope_divide_and_conquer_3 {
   }
 
   template <typename FeatureHandle>
-  void get_aux_data_iterators(unsigned int id, FeatureHandle fh,
-                              Envelope_data_iterator& begin,
-                              Envelope_data_iterator& end) {
+  void aux_data_iterators(unsigned int id, FeatureHandle fh,
+                          Envelope_data_iterator& begin,
+                          Envelope_data_iterator& end) {
     Halfedge_handle h;
     Vertex_handle v;
     Face_handle f;
 
-    const Object& o = fh->get_aux_source(id);
-    CGAL_assertion(!o.is_empty());
+    const Object& o = fh->aux_source(id);
+    CGAL_assertion(! o.is_empty());
 
     // aux source of a face must be a face!
     // aux source of a halfedge can be face or halfedge
@@ -725,19 +715,19 @@ class Envelope_divide_and_conquer_3 {
     // and last vertex
 
     if (assign(f, o)) {
-      begin = f->begin_data();
-      end = f->end_data();
+      begin = f->begin_env_data();
+      end = f->end_env_data();
     }
     else if (assign(h, o)) {
-      begin = h->begin_data();
-      end = h->end_data();
+      begin = h->begin_env_data();
+      end = h->end_env_data();
     }
     else {
       CGAL_assertion_code(bool b = )
       assign(v, o);
       CGAL_assertion(b);
-      begin = v->begin_data();
-      end = v->end_data();
+      begin = v->begin_env_data();
+      end = v->end_env_data();
     }
   }
 
@@ -752,18 +742,18 @@ class Envelope_divide_and_conquer_3 {
     // done on the faces. if not, then the envelope surfaces must differ
     CGAL_assertion(hh->is_decision_set() && f1->is_decision_set() &&
                    f2->is_decision_set());
-    if (hh->get_decision() != f1->get_decision() ||
-        hh->get_decision() != f2->get_decision())
+    if (hh->decision() != f1->decision() ||
+        hh->decision() != f2->decision())
     {
       return false;
     }
 
     // now, check the equality of the surfaces list according to the decision
-    CGAL::Dac_decision decision = hh->get_decision();
-    bool equal_first = (hh->get_is_equal_aux_data_in_face(0) &&
-                        hh->twin()->get_is_equal_aux_data_in_face(0));
-    bool equal_second = (hh->get_is_equal_aux_data_in_face(1) &&
-                         hh->twin()->get_is_equal_aux_data_in_face(1));
+    CGAL::Dac_decision decision = hh->decision();
+    bool equal_first = (hh->is_equal_aux_data_in_face(0) &&
+                        hh->twin()->is_equal_aux_data_in_face(0));
+    bool equal_second = (hh->is_equal_aux_data_in_face(1) &&
+                         hh->twin()->is_equal_aux_data_in_face(1));
 
     if (decision == DAC_DECISION_FIRST) return equal_first;
 
@@ -792,10 +782,10 @@ class Envelope_divide_and_conquer_3 {
     Vertex_handle v = h->target();
     if (v->is_at_open_boundary()) return false;
 
-    /* if (v->get_is_fake() && !v->is_decision_set()) return true;
-     * if (h->get_is_fake() && !h->is_decision_set()) {
-     *   h->set_decision(h->face()->get_decision());
-     *   h->twin()->set_decision(h->get_decision());
+    /* if (v->is_fake() && !v->is_decision_set()) return true;
+     * if (h->is_fake() && !h->is_decision_set()) {
+     *   h->set_decision(h->face()->decision());
+     *   h->twin()->set_decision(h->decision());
      * }
      */
     CGAL_assertion(v->is_decision_set());
@@ -803,13 +793,13 @@ class Envelope_divide_and_conquer_3 {
 
     // if the decision done on the vertex and edge are different,
     // the envelope differs too.
-    if (h->get_decision() != v->get_decision()) return false;
+    if (h->decision() != v->decision()) return false;
 
     // now, check the equality of the surfaces list according to the decision
 
-    CGAL::Dac_decision decision = h->get_decision();
-    bool equal_first = (h->get_is_equal_aux_data_in_target(0));
-    bool equal_second = (h->get_is_equal_aux_data_in_target(1));
+    CGAL::Dac_decision decision = h->decision();
+    bool equal_first = (h->is_equal_aux_data_in_target(0));
+    bool equal_second = (h->is_equal_aux_data_in_target(1));
 
     if (decision == DAC_DECISION_FIRST) return equal_first;
 
@@ -826,13 +816,13 @@ class Envelope_divide_and_conquer_3 {
     CGAL_assertion(vh->is_decision_set() && f->is_decision_set());
     // if the decision done on the vertex and face are different,
     // the envelope differs too.
-    if (vh->get_decision() != f->get_decision()) return false;
+    if (vh->decision() != f->decision()) return false;
 
     // now, check the equality of the surfaces list according to the decision
-    CGAL::Dac_decision decision = vh->get_decision();
+    CGAL::Dac_decision decision = vh->decision();
 
-    bool equal_first = (vh->get_is_equal_aux_data_in_face(0));
-    bool equal_second = (vh->get_is_equal_aux_data_in_face(1));
+    bool equal_first = (vh->is_equal_aux_data_in_face(0));
+    bool equal_second = (vh->is_equal_aux_data_in_face(1));
 
     if (decision == DAC_DECISION_FIRST) return equal_first;
 
@@ -853,8 +843,8 @@ class Envelope_divide_and_conquer_3 {
     CGAL_assertion(he1 != he2);
     CGAL_assertion(he1->is_decision_set() && he2->is_decision_set());
 
-    /* if (vh->get_is_fake()) {
-     *   CGAL_assertion(he1->get_decision() == he2->get_decision());
+    /* if (vh->is_fake()) {
+     *   CGAL_assertion(he1->decision() == he2->decision());
      *   return true;
      * }
      */
@@ -863,16 +853,16 @@ class Envelope_divide_and_conquer_3 {
     // if the decision done on the vertex and its incident halfedges are
     // different, the envelope differs too.
     CGAL_assertion(vh == he1->target() && vh == he2->target());
-    if (vh->get_decision() != he1->get_decision() ||
-        vh->get_decision() != he2->get_decision())
+    if (vh->decision() != he1->decision() ||
+        vh->decision() != he2->decision())
       return false;
 
     // now, check the equality of the surfaces list according to the decision
-    CGAL::Dac_decision decision = vh->get_decision();
-    bool equal_first = (he1->get_is_equal_aux_data_in_target(0) &&
-                        he2->get_is_equal_aux_data_in_target(0));
-    bool equal_second = (he1->get_is_equal_aux_data_in_target(1) &&
-                         he2->get_is_equal_aux_data_in_target(1));
+    CGAL::Dac_decision decision = vh->decision();
+    bool equal_first = (he1->is_equal_aux_data_in_target(0) &&
+                        he2->is_equal_aux_data_in_target(0));
+    bool equal_second = (he1->is_equal_aux_data_in_target(1) &&
+                         he2->is_equal_aux_data_in_target(1));
 
     if (decision == DAC_DECISION_FIRST) return equal_first;
 
@@ -949,30 +939,30 @@ class Envelope_divide_and_conquer_3 {
       //  <----------- ------------>
       //   he1->twin()   he2->twin()
       he1->set_is_equal_aux_data_in_target
-        (0, he2->twin()->get_is_equal_aux_data_in_target(0));
+        (0, he2->twin()->is_equal_aux_data_in_target(0));
       he1->set_is_equal_aux_data_in_target
-        (1, he2->twin()->get_is_equal_aux_data_in_target(1));
+        (1, he2->twin()->is_equal_aux_data_in_target(1));
       he1->set_has_equal_aux_data_in_target
-        (0, he2->twin()->get_has_equal_aux_data_in_target(0));
+        (0, he2->twin()->has_equal_aux_data_in_target(0));
       he1->set_has_equal_aux_data_in_target
-        (1, he2->twin()->get_has_equal_aux_data_in_target(1));
+        (1, he2->twin()->has_equal_aux_data_in_target(1));
       he1->set_has_equal_aux_data_in_target_and_face
-        (0, he2->twin()->get_has_equal_aux_data_in_target_and_face(0));
+        (0, he2->twin()->has_equal_aux_data_in_target_and_face(0));
       he1->set_has_equal_aux_data_in_target_and_face
-        (1, he2->twin()->get_has_equal_aux_data_in_target_and_face(1));
+        (1, he2->twin()->has_equal_aux_data_in_target_and_face(1));
 
       he2->set_is_equal_aux_data_in_target
-        (0, he1->twin()->get_is_equal_aux_data_in_target(0));
+        (0, he1->twin()->is_equal_aux_data_in_target(0));
       he2->set_is_equal_aux_data_in_target
-        (1, he1->twin()->get_is_equal_aux_data_in_target(1));
+        (1, he1->twin()->is_equal_aux_data_in_target(1));
       he2->set_has_equal_aux_data_in_target
-        (0, he1->twin()->get_has_equal_aux_data_in_target(0));
+        (0, he1->twin()->has_equal_aux_data_in_target(0));
       he2->set_has_equal_aux_data_in_target
-        (1, he1->twin()->get_has_equal_aux_data_in_target(1));
+        (1, he1->twin()->has_equal_aux_data_in_target(1));
       he2->set_has_equal_aux_data_in_target_and_face
-        (0, he1->twin()->get_has_equal_aux_data_in_target_and_face(0));
+        (0, he1->twin()->has_equal_aux_data_in_target_and_face(0));
       he2->set_has_equal_aux_data_in_target_and_face
-        (1, he1->twin()->get_has_equal_aux_data_in_target_and_face(1));
+        (1, he1->twin()->has_equal_aux_data_in_target_and_face(1));
 
       // order of halfedges for merge doesn't matter
 #if !defined(CGAL_NO_ASSERTIONS)
@@ -1000,7 +990,7 @@ class Envelope_divide_and_conquer_3 {
 
   template <typename FeatureHandle>
   void update_envelope_surfaces_by_decision(FeatureHandle fh) {
-    CGAL::Dac_decision decision = fh->get_decision();
+    CGAL::Dac_decision decision = fh->decision();
 
     Halfedge_handle h;
     Vertex_handle v;
@@ -1008,16 +998,16 @@ class Envelope_divide_and_conquer_3 {
 
     if (decision == DAC_DECISION_FIRST || decision == DAC_DECISION_BOTH) {
       Envelope_data_iterator begin, end;
-      get_aux_data_iterators(0, fh, begin, end);
+      aux_data_iterators(0, fh, begin, end);
       fh->set_env_data(begin, end);
     }
     if (decision == DAC_DECISION_SECOND || decision == DAC_DECISION_BOTH) {
       // copy data from second envelope
       Envelope_data_iterator begin, end;
-      get_aux_data_iterators(1, fh, begin, end);
+      aux_data_iterators(1, fh, begin, end);
 
       if (decision == DAC_DECISION_SECOND) fh->set_env_data(begin, end);
-      else fh->add_data(begin, end);
+      else fh->add_env_data(begin, end);
     }
   }
 
@@ -1040,19 +1030,19 @@ class Envelope_divide_and_conquer_3 {
   // update the is_equal/has_equal flags of the result envelope
   void update_edge_face_flags(Halfedge_handle h) {
     bool is_equal, has_equal;
-    is_equal = (h->get_decision() == h->face()->get_decision());
+    is_equal = (h->decision() == h->face()->decision());
     // has equal can be true even if the decision is not the same,
     // but has same surfaces, i.e. one of the features got DAC_DECISION_BOTH
     // decision, and the other didn't
-    has_equal = (h->get_decision() == h->face()->get_decision() ||
-                 h->get_decision() == DAC_DECISION_BOTH ||
-                 h->face()->get_decision() == DAC_DECISION_BOTH);
-
-    CGAL::Dac_decision decision = h->face()->get_decision();
-    bool is_equal_first = (h->get_is_equal_aux_data_in_face(0));
-    bool has_equal_first = (h->get_has_equal_aux_data_in_face(0));
-    bool is_equal_second = (h->get_is_equal_aux_data_in_face(1));
-    bool has_equal_second = (h->get_has_equal_aux_data_in_face(1));
+    has_equal = (h->decision() == h->face()->decision() ||
+                 h->decision() == DAC_DECISION_BOTH ||
+                 h->face()->decision() == DAC_DECISION_BOTH);
+
+    CGAL::Dac_decision decision = h->face()->decision();
+    bool is_equal_first = (h->is_equal_aux_data_in_face(0));
+    bool has_equal_first = (h->has_equal_aux_data_in_face(0));
+    bool is_equal_second = (h->is_equal_aux_data_in_face(1));
+    bool has_equal_second = (h->has_equal_aux_data_in_face(1));
     if (decision == DAC_DECISION_FIRST) {
       is_equal &= is_equal_first;
       has_equal &= has_equal_first;
@@ -1066,32 +1056,32 @@ class Envelope_divide_and_conquer_3 {
       // we check if the halfedge has a different decision, and if so,
 
       // we update the flag according to the halfedge decision
-      decision = h->get_decision();
+      decision = h->decision();
       if (decision == DAC_DECISION_FIRST) has_equal &= has_equal_first;
       else if (decision == DAC_DECISION_SECOND) has_equal &= has_equal_second;
       else has_equal &= (has_equal_first & has_equal_second);
     }
 
-    h->set_is_equal_data_in_face(is_equal);
-    h->set_has_equal_data_in_face(has_equal);
+    h->set_is_equal_env_data_in_face(is_equal);
+    h->set_has_equal_env_data_in_face(has_equal);
   }
 
   void update_edge_target_flags(Halfedge_handle h) {
     bool is_equal, has_equal;
 
-    is_equal = (h->get_decision() == h->target()->get_decision());
+    is_equal = (h->decision() == h->target()->decision());
     // has equal can be true even if the decision is not the same,
     // but has same surfaces, i.e. one of the features got DAC_DECISION_BOTH
     // decision, and the other didn't
-    has_equal = (h->get_decision() == h->target()->get_decision() ||
-                 h->get_decision() == DAC_DECISION_BOTH ||
-                 h->target()->get_decision() == DAC_DECISION_BOTH);
-
-    CGAL::Dac_decision decision = h->get_decision();
-    bool is_equal_first = (h->get_is_equal_aux_data_in_target(0));
-    bool has_equal_first = (h->get_has_equal_aux_data_in_target(0));
-    bool is_equal_second = (h->get_is_equal_aux_data_in_target(1));
-    bool has_equal_second = (h->get_has_equal_aux_data_in_target(1));
+    has_equal = (h->decision() == h->target()->decision() ||
+                 h->decision() == DAC_DECISION_BOTH ||
+                 h->target()->decision() == DAC_DECISION_BOTH);
+
+    CGAL::Dac_decision decision = h->decision();
+    bool is_equal_first = (h->is_equal_aux_data_in_target(0));
+    bool has_equal_first = (h->has_equal_aux_data_in_target(0));
+    bool is_equal_second = (h->is_equal_aux_data_in_target(1));
+    bool has_equal_second = (h->has_equal_aux_data_in_target(1));
     if (decision == DAC_DECISION_FIRST) {
       is_equal &= is_equal_first;
       has_equal &= has_equal_first;
@@ -1104,7 +1094,7 @@ class Envelope_divide_and_conquer_3 {
       is_equal &= (is_equal_first & is_equal_second);
       // we check if the vertex has a different decision, and if so,
       // we update the flag according to the vertex decision
-      decision = h->target()->get_decision();
+      decision = h->target()->decision();
       if (decision == DAC_DECISION_FIRST)
       has_equal &= has_equal_first;
       else if (decision == DAC_DECISION_SECOND)
@@ -1113,8 +1103,8 @@ class Envelope_divide_and_conquer_3 {
       else
       has_equal &= (has_equal_first & has_equal_second);
     }
-    h->set_is_equal_data_in_target(is_equal);
-    h->set_has_equal_data_in_target(has_equal);
+    h->set_is_equal_env_data_in_target(is_equal);
+    h->set_has_equal_env_data_in_target(has_equal);
   }
 
   void update_target_face_flags(Halfedge_handle h) {
@@ -1122,42 +1112,42 @@ class Envelope_divide_and_conquer_3 {
     // has equal can be true even if the decision is not the same,
     // but has same surfaces, i.e. one of the features got DAC_DECISION_BOTH
     // decision, and the other didn't
-    has_equal = (h->face()->get_decision() == h->target()->get_decision() ||
-                 h->face()->get_decision() == DAC_DECISION_BOTH ||
-                 h->target()->get_decision() == DAC_DECISION_BOTH);
+    has_equal = (h->face()->decision() == h->target()->decision() ||
+                 h->face()->decision() == DAC_DECISION_BOTH ||
+                 h->target()->decision() == DAC_DECISION_BOTH);
 
-    CGAL::Dac_decision decision = h->face()->get_decision();
-    bool has_equal_first = (h->get_has_equal_aux_data_in_target_and_face(0));
-    bool has_equal_second = (h->get_has_equal_aux_data_in_target_and_face(1));
+    CGAL::Dac_decision decision = h->face()->decision();
+    bool has_equal_first = (h->has_equal_aux_data_in_target_and_face(0));
+    bool has_equal_second = (h->has_equal_aux_data_in_target_and_face(1));
     if (decision == DAC_DECISION_FIRST) has_equal &= has_equal_first;
     else if (decision == DAC_DECISION_SECOND) has_equal &= has_equal_second;
     else {
       // we check if the vertex has a different decision, and if so,
       // we update the flag according to the vertex decision
-      decision = h->target()->get_decision();
+      decision = h->target()->decision();
       if (decision == DAC_DECISION_FIRST) has_equal &= has_equal_first;
       else if (decision == DAC_DECISION_SECOND) has_equal &= has_equal_second;
       else has_equal &= (has_equal_first & has_equal_second);
     }
-    h->set_has_equal_data_in_target_and_face(has_equal);
+    h->set_has_equal_env_data_in_target_and_face(has_equal);
   }
 
   void update_vertex_face_flags(Vertex_handle v, Face_handle f) {
     bool is_equal, has_equal;
-    is_equal = (v->get_decision() == f->get_decision());
+    is_equal = (v->decision() == f->decision());
     // has equal can be true even if the decision is not the same,
     // but has same surfaces, i.e. one of the features got DAC_DECISION_BOTH
     // decision, and the other didn't
 
-    has_equal = (v->get_decision() == f->get_decision() ||
-                 v->get_decision() == DAC_DECISION_BOTH ||
-                 f->get_decision() == DAC_DECISION_BOTH);
+    has_equal = (v->decision() == f->decision() ||
+                 v->decision() == DAC_DECISION_BOTH ||
+                 f->decision() == DAC_DECISION_BOTH);
 
-    CGAL::Dac_decision decision = v->get_decision();
-    bool is_equal_first = (v->get_is_equal_aux_data_in_face(0));
-    bool has_equal_first = (v->get_has_equal_aux_data_in_face(0));
-    bool is_equal_second = (v->get_is_equal_aux_data_in_face(1));
-    bool has_equal_second = (v->get_has_equal_aux_data_in_face(1));
+    CGAL::Dac_decision decision = v->decision();
+    bool is_equal_first = (v->is_equal_aux_data_in_face(0));
+    bool has_equal_first = (v->has_equal_aux_data_in_face(0));
+    bool is_equal_second = (v->is_equal_aux_data_in_face(1));
+    bool has_equal_second = (v->has_equal_aux_data_in_face(1));
     if (decision == DAC_DECISION_FIRST) {
       is_equal &= is_equal_first;
       has_equal &= has_equal_first;
@@ -1170,7 +1160,7 @@ class Envelope_divide_and_conquer_3 {
       is_equal &= (is_equal_first & is_equal_second);
       // we check if the face has a different decision, and if so,
       // we update the flag according to the face decision
-      decision = f->get_decision();
+      decision = f->decision();
       if (decision == DAC_DECISION_FIRST)
       has_equal &= has_equal_first;
       else if (decision == DAC_DECISION_SECOND)
@@ -1178,8 +1168,8 @@ class Envelope_divide_and_conquer_3 {
       else
       has_equal &= (has_equal_first & has_equal_second);
     }
-    v->set_is_equal_data_in_face(is_equal);
-    v->set_has_equal_data_in_face(has_equal);
+    v->set_is_equal_env_data_in_face(is_equal);
+    v->set_has_equal_env_data_in_face(has_equal);
   }
 
   void update_flags(Minimization_diagram_2& result) {
@@ -1197,12 +1187,12 @@ class Envelope_divide_and_conquer_3 {
   }
 
   template <typename FeatureHandle>
-  bool get_aux_is_set(FeatureHandle fh, unsigned int id)
-  { return fh->get_aux_is_set(id); }
+  bool aux_is_set(FeatureHandle fh, unsigned int id)
+  { return fh->aux_is_set(id); }
 
   template <typename FeatureHandle>
   bool aux_has_no_data(FeatureHandle fh, unsigned int id) {
-    const Object& o = fh->get_aux_source(id);
+    const Object& o = fh->aux_source(id);
     Halfedge_handle h;
     Vertex_handle v;
     Face_handle f;
@@ -1212,13 +1202,13 @@ class Envelope_divide_and_conquer_3 {
     // aux source of a vertex can be face, halfedge or vertex
     // this is why we start with a check for a face, then halfedge
     // and last vertex
-    if (assign(f, o)) return f->has_no_data();
-    else if (assign(h, o)) return h->has_no_data();
+    if (assign(f, o)) return f->has_no_env_data();
+    else if (assign(h, o)) return h->has_no_env_data();
     else {
       CGAL_assertion_code(bool b =)
       assign(v, o);
       CGAL_assertion(b);
-      return v->has_no_data();
+      return v->has_no_env_data();
     }
   }
 
@@ -1228,7 +1218,7 @@ class Envelope_divide_and_conquer_3 {
   // methods for assertion and checking
   //***************************************************************************
 
-  void get_data_iterators(Object aux_src,
+  void env_data_iterators(Object aux_src,
                           Envelope_data_iterator& begin,
                           Envelope_data_iterator& end) {
     CGAL_assertion(!aux_src.is_empty());
@@ -1237,49 +1227,51 @@ class Envelope_divide_and_conquer_3 {
     Face_handle f;
 
     if (assign(v, aux_src)) {
-      begin = v->begin_data();
-      end = v->end_data();
+      begin = v->begin_env_data();
+      end = v->end_env_data();
     }
     else if (assign(h, aux_src)) {
-      begin = h->begin_data();
-      end = h->end_data();
+      begin = h->begin_env_data();
+      end = h->end_env_data();
     }
     else {
       CGAL_assertion(assign(f, aux_src));
       assign(f, aux_src);
-      begin = f->begin_data();
-      end = f->end_data();
+      begin = f->begin_env_data();
+      end = f->end_env_data();
     }
   }
-  bool is_equal_data(Object o,
-                     Envelope_data_iterator begin, Envelope_data_iterator end) {
-    CGAL_assertion(!o.is_empty());
+
+  bool is_equal_env_data(Object o,
+                         Envelope_data_iterator begin,
+                         Envelope_data_iterator end) {
+    CGAL_assertion(! o.is_empty());
     Vertex_handle v;
     Halfedge_handle h;
     Face_handle f;
 
-    if (assign(v, o)) return v->is_equal_data(begin, end);
-    else if (assign(h, o)) return h->is_equal_data(begin, end);
+    if (assign(v, o)) return v->is_equal_env_data(begin, end);
+    else if (assign(h, o)) return h->is_equal_env_data(begin, end);
     else {
       CGAL_assertion(assign(f, o));
       assign(f, o);
-      return f->is_equal_data(begin, end);
+      return f->is_equal_env_data(begin, end);
     }
   }
-  bool has_equal_data(Object o,
-                      Envelope_data_iterator begin,
-                      Envelope_data_iterator end) {
+  bool has_equal_env_data(Object o,
+                          Envelope_data_iterator begin,
+                          Envelope_data_iterator end) {
     CGAL_assertion(!o.is_empty());
     Vertex_handle v;
     Halfedge_handle h;
     Face_handle f;
 
-    if (assign(v, o)) return v->has_equal_data(begin, end);
-    else if (assign(h, o)) return h->has_equal_data(begin, end);
+    if (assign(v, o)) return v->has_equal_env_data(begin, end);
+    else if (assign(h, o)) return h->has_equal_env_data(begin, end);
     else {
       CGAL_assertion(assign(f, o));
       assign(f, o);
-      return f->has_equal_data(begin, end);
+      return f->has_equal_env_data(begin, end);
     }
   }
 
@@ -1295,9 +1287,8 @@ class Envelope_divide_and_conquer_3 {
       for (auto inner_iter = fh->holes_begin(); inner_iter != fh->holes_end();
            ++inner_iter) {
         face_hec = face_hec_begin = (*inner_iter);
-        do {
-          ++face_hec;
-        } while(face_hec != face_hec_begin);
+        do ++face_hec;
+        while(face_hec != face_hec_begin);
       }
     }
   }
@@ -1309,10 +1300,10 @@ class Envelope_divide_and_conquer_3 {
     bool all_ok = true;
     for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
-      // if (vh->get_is_fake()) continue;
-      all_ok &= (vh->get_aux_is_set(0));
+      // if (vh->is_fake()) continue;
+      all_ok &= (vh->aux_is_set(0));
       CGAL_assertion_msg(all_ok, "aux source (0) not set over vertex");
-      all_ok &= (vh->get_aux_is_set(1));
+      all_ok &= (vh->aux_is_set(1));
       CGAL_assertion_msg(all_ok, "aux source (1) not set over vertex");
       all_ok &= (vh->is_decision_set());
       CGAL_assertion_msg(all_ok, "decision was not set over vertex");
@@ -1321,13 +1312,11 @@ class Envelope_divide_and_conquer_3 {
     for (auto hi = result.halfedges_begin(); hi != result.halfedges_end(); ++hi)
     {
       Halfedge_handle hh = hi;
-     /* if (hh->get_is_fake())
-      *   continue;
-      */
+      // if (hh->is_fake()) continue;
 
-      all_ok &= (hh->get_aux_is_set(0));
+      all_ok &= (hh->aux_is_set(0));
       CGAL_assertion_msg(all_ok, "aux source (0) not set over edge");
-      all_ok &= (hh->get_aux_is_set(1));
+      all_ok &= (hh->aux_is_set(1));
       CGAL_assertion_msg(all_ok, "aux source (1) not set over edge");
       all_ok &= (hh->is_decision_set());
       CGAL_assertion_msg(all_ok, "decision was not set over edge");
@@ -1335,9 +1324,9 @@ class Envelope_divide_and_conquer_3 {
 
     for (auto fi = result.faces_begin(); fi != result.faces_end(); ++fi) {
       Face_handle fh = fi;
-      all_ok &= (fh->get_aux_is_set(0));
+      all_ok &= (fh->aux_is_set(0));
       CGAL_assertion_msg(all_ok, "aux source (0) not set over face");
-      all_ok &= (fh->get_aux_is_set(1));
+      all_ok &= (fh->aux_is_set(1));
       CGAL_assertion_msg(all_ok, "aux source (1) not set over face");
       all_ok &= (fh->is_decision_set());
       CGAL_assertion_msg(all_ok, "decision was not set over face");
@@ -1352,12 +1341,12 @@ class Envelope_divide_and_conquer_3 {
     for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
 
-      all_ok &= (vh->get_is_set());
+      all_ok &= (vh->env_is_set());
       CGAL_assertion_msg(all_ok, "data not set over vertex");
-      all_ok &= (!vh->has_no_data());
+      all_ok &= (!vh->has_no_env_data());
 
       CGAL_assertion_msg(all_ok, "data empty over vertex");
-     /* all_ok &= (!vh->get_is_fake());*/
+      /* all_ok &= (!vh->is_fake());*/
       CGAL_assertion_msg(all_ok, "fake vertex in envelope");
     }
 
@@ -1365,20 +1354,20 @@ class Envelope_divide_and_conquer_3 {
     {
       Halfedge_handle hh = hi;
 
-      all_ok &= (hh->get_is_set());
+      all_ok &= (hh->env_is_set());
       if (!all_ok) std::cerr << "edge: " << hh->curve() << std::endl;
       CGAL_assertion_msg(all_ok, "data not set over edge");
-      all_ok &= (!hh->has_no_data());
+      all_ok &= (!hh->has_no_env_data());
       if (!all_ok) std::cerr << "edge: " << hh->curve() << std::endl;
       CGAL_assertion_msg(all_ok, "data empty over edge");
 
-      /*all_ok &= (!hh->get_is_fake());*/
+      /*all_ok &= (!hh->is_fake());*/
       CGAL_assertion_msg(all_ok, "fake edge in envelope");
     }
 
     for (auto fi = result.faces_begin(); fi != result.faces_end(); ++fi) {
       Face_handle fh = fi;
-      all_ok &= (fh->get_is_set());
+      all_ok &= (fh->env_is_set());
       CGAL_assertion_msg(all_ok, "data not set over face");
     }
     return all_ok;
@@ -1397,12 +1386,12 @@ class Envelope_divide_and_conquer_3 {
                                   Face_handle new_f,
                                   bool /* is_hole*/) override {
       // update data in the new face from the original face
-      if (org_f->get_aux_is_set(0))
-        new_f->set_aux_source(0, org_f->get_aux_source(0));
-      if (org_f->get_aux_is_set(1))
-        new_f->set_aux_source(1, org_f->get_aux_source(1));
+      if (org_f->aux_is_set(0))
+        new_f->set_aux_source(0, org_f->aux_source(0));
+      if (org_f->aux_is_set(1))
+        new_f->set_aux_source(1, org_f->aux_source(1));
       if (org_f->is_decision_set())
-        new_f->set_decision(org_f->get_decision());
+        new_f->set_decision(org_f->decision());
     }
   };
 
@@ -1438,97 +1427,95 @@ class Envelope_divide_and_conquer_3 {
       CGAL_assertion(he2->source() == he1->target());
 
       Vertex_handle new_vertex;
-//      if (he2->source() == he1->target() ||
-//          he2->source() == he1->source())
+      // if (he2->source() == he1->target() || he2->source() == he1->source())
       new_vertex = he2->source();
-//      else
-//        new_vertex = he2->target();
+      // else new_vertex = he2->target();
 
       CGAL_assertion(!new_vertex->is_decision_set());
-      CGAL_assertion(!new_vertex->get_aux_is_set(0));
-      CGAL_assertion(!new_vertex->get_aux_is_set(1));
+      CGAL_assertion(!new_vertex->aux_is_set(0));
+      CGAL_assertion(!new_vertex->aux_is_set(1));
 
       // find the halfedge with the additional information, to be copied into
       // the second halfedge
       Halfedge_handle org_he = he1, new_he = he2;
 
       if (org_he->is_decision_set()) {
-        new_he->set_decision(org_he->get_decision());
-        new_he->twin()->set_decision(org_he->get_decision());
-        new_vertex->set_decision(org_he->get_decision());
+        new_he->set_decision(org_he->decision());
+        new_he->twin()->set_decision(org_he->decision());
+        new_vertex->set_decision(org_he->decision());
       }
-      if (org_he->get_aux_is_set(0)) {
-        new_vertex->set_aux_source(0, org_he->get_aux_source(0));
-        new_he->set_aux_source(0, org_he->get_aux_source(0));
-        new_he->twin()->set_aux_source(0, org_he->twin()->get_aux_source(0));
+      if (org_he->aux_is_set(0)) {
+        new_vertex->set_aux_source(0, org_he->aux_source(0));
+        new_he->set_aux_source(0, org_he->aux_source(0));
+        new_he->twin()->set_aux_source(0, org_he->twin()->aux_source(0));
       }
-      if (org_he->get_aux_is_set(1)) {
-        new_vertex->set_aux_source(1, org_he->get_aux_source(1));
-        new_he->set_aux_source(1, org_he->get_aux_source(1));
-        new_he->twin()->set_aux_source(1, org_he->twin()->get_aux_source(1));
+      if (org_he->aux_is_set(1)) {
+        new_vertex->set_aux_source(1, org_he->aux_source(1));
+        new_he->set_aux_source(1, org_he->aux_source(1));
+        new_he->twin()->set_aux_source(1, org_he->twin()->aux_source(1));
       }
 
-      /*new_he->set_is_fake(org_he->get_is_fake());*/
-      /*new_he->twin()->set_is_fake(org_he->get_is_fake());*/
-      /*new_vertex->set_is_fake(org_he->get_is_fake());*/
+      // new_he->set_is_fake(org_he->is_fake());
+      // new_he->twin()->set_is_fake(org_he->is_fake());
+      // new_vertex->set_is_fake(org_he->is_fake());
 
       // update all new bools
       new_he->set_is_equal_aux_data_in_face
-        (0, org_he->get_is_equal_aux_data_in_face(0));
+        (0, org_he->is_equal_aux_data_in_face(0));
       new_he->twin()->set_is_equal_aux_data_in_face
-        (0, org_he->twin()->get_is_equal_aux_data_in_face(0));
+        (0, org_he->twin()->is_equal_aux_data_in_face(0));
       new_he->set_is_equal_aux_data_in_face
-        (1, org_he->get_is_equal_aux_data_in_face(1));
+        (1, org_he->is_equal_aux_data_in_face(1));
       new_he->twin()->set_is_equal_aux_data_in_face
-        (1, org_he->twin()->get_is_equal_aux_data_in_face(1));
+        (1, org_he->twin()->is_equal_aux_data_in_face(1));
 
       new_he->set_has_equal_aux_data_in_face
-        (0, org_he->get_has_equal_aux_data_in_face(0));
+        (0, org_he->has_equal_aux_data_in_face(0));
       new_he->twin()->set_has_equal_aux_data_in_face
-        (0, org_he->twin()->get_has_equal_aux_data_in_face(0));
+        (0, org_he->twin()->has_equal_aux_data_in_face(0));
       new_he->set_has_equal_aux_data_in_face
-        (1, org_he->get_has_equal_aux_data_in_face(1));
+        (1, org_he->has_equal_aux_data_in_face(1));
       new_he->twin()->set_has_equal_aux_data_in_face
-        (1, org_he->twin()->get_has_equal_aux_data_in_face(1));
+        (1, org_he->twin()->has_equal_aux_data_in_face(1));
 
       // new_he->target is the original edge's target, and org_he->target
       // is the new vertex
       new_he->set_is_equal_aux_data_in_target
-        (0, org_he->get_is_equal_aux_data_in_target(0));
+        (0, org_he->is_equal_aux_data_in_target(0));
       new_he->set_is_equal_aux_data_in_target
-        (1, org_he->get_is_equal_aux_data_in_target(1));
+        (1, org_he->is_equal_aux_data_in_target(1));
       org_he->set_is_equal_aux_data_in_target(0, true);
       org_he->set_is_equal_aux_data_in_target(1, true);
       new_he->set_has_equal_aux_data_in_target
-        (0, org_he->get_has_equal_aux_data_in_target(0));
+        (0, org_he->has_equal_aux_data_in_target(0));
       new_he->set_has_equal_aux_data_in_target
-        (1, org_he->get_has_equal_aux_data_in_target(1));
+        (1, org_he->has_equal_aux_data_in_target(1));
       org_he->set_has_equal_aux_data_in_target
         (0, !base->aux_has_no_data(org_he, 0));
       org_he->set_has_equal_aux_data_in_target
         (1, !base->aux_has_no_data(org_he, 1));
       new_he->set_has_equal_aux_data_in_target_and_face
-        (0, org_he->get_has_equal_aux_data_in_target_and_face(0));
+        (0, org_he->has_equal_aux_data_in_target_and_face(0));
       new_he->set_has_equal_aux_data_in_target_and_face
-        (1, org_he->get_has_equal_aux_data_in_target_and_face(1));
+        (1, org_he->has_equal_aux_data_in_target_and_face(1));
       org_he->set_has_equal_aux_data_in_target_and_face
-        (0, org_he->get_has_equal_aux_data_in_face(0));
+        (0, org_he->has_equal_aux_data_in_face(0));
       org_he->set_has_equal_aux_data_in_target_and_face
-        (1, org_he->get_has_equal_aux_data_in_face(1));
+        (1, org_he->has_equal_aux_data_in_face(1));
 
       // new_he->source is the new vertex, and org_he->source is the
       // original vertex
       new_he->twin()->set_is_equal_aux_data_in_target(0, true);
       new_he->twin()->set_is_equal_aux_data_in_target(1, true);
       new_he->twin()->set_has_equal_aux_data_in_target
-        (0,!base->aux_has_no_data(org_he, 0));
+        (0, ! base->aux_has_no_data(org_he, 0));
       new_he->twin()->set_has_equal_aux_data_in_target
-        (1,!base->aux_has_no_data(org_he, 1));
+        (1, ! base->aux_has_no_data(org_he, 1));
 
       new_he->twin()->set_has_equal_aux_data_in_target_and_face
-        (0, org_he->twin()->get_has_equal_aux_data_in_face(0));
+        (0, org_he->twin()->has_equal_aux_data_in_face(0));
       new_he->twin()->set_has_equal_aux_data_in_target_and_face
-        (1, org_he->twin()->get_has_equal_aux_data_in_face(1));
+        (1, org_he->twin()->has_equal_aux_data_in_face(1));
     }
 
   protected:
@@ -1573,7 +1560,7 @@ class Envelope_divide_and_conquer_3 {
       else if (base->aux_has_no_data(fh, 0) && base->aux_has_no_data(fh, 1)) {
 
         fh->set_decision(EQUAL);
-        fh->set_no_data();
+        fh->set_no_env_data();
       }
       else if (!base->aux_has_no_data(fh, 0) && base->aux_has_no_data(fh, 1))
         fh->set_decision(DAC_DECISION_FIRST);
@@ -1587,7 +1574,7 @@ class Envelope_divide_and_conquer_3 {
 #endif
 
 protected:
-  Envelope_resolver* resolver;
+  Envelope_resolver* m_resolver;
   const Traits* m_geom_traits;
   bool m_own_traits;
   bool m_is_lower;
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
index 8d50d5bcd1a0..07e2d706d14f 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
@@ -166,21 +166,21 @@ class Envelope_element_visitor_3 {
   // get a face with 2 surfaces defined over it, and compute the arrangement
   // of the/ envelope of these surfaces over the face
   void resolve(Face_handle face, Minimization_diagram_2& result) {
-    CGAL_assertion(face->get_aux_is_set(0));
-    CGAL_assertion(face->get_aux_is_set(1));
+    CGAL_assertion(face->aux_is_set(0));
+    CGAL_assertion(face->aux_is_set(1));
 
     // we are interested with the envelope's shape over the current face,
     // so we only need to check the first surface from each group, since
     // all the surfaces in a group overlap over the current face.
-    const Xy_monotone_surface_3& surf1 = get_aux_surface(face, 0);
-    const Xy_monotone_surface_3& surf2 = get_aux_surface(face, 1);
+    const Xy_monotone_surface_3& surf1 = aux_surface(face, 0);
+    const Xy_monotone_surface_3& surf2 = aux_surface(face, 1);
 
     // find the projected intersections of the surfaces. if none - we have
     // a simple case:
     // need only resolve non-intersecting and return
     std::list<std::variant<Intersection_curve, Point_2>> inter_objs;
 
-    get_projected_intersections(surf1, surf2, std::back_inserter(inter_objs));
+    projected_intersections(surf1, surf2, std::back_inserter(inter_objs));
 
     if (inter_objs.size() == 0) {
       // here for resolve we can compare the surfaces over the edges only
@@ -234,7 +234,7 @@ class Envelope_element_visitor_3 {
     //    projected intersection that created it.
     Halfedges_w_type_list result_new_edges;
     // 3. the collection of faces that form the face before any insertion
-    Faces_list     result_face_parts;
+    Faces_list result_face_parts;
     // 4. the collection of special vertices, which contains:
     //    - new vertices that were created inside the original face
     //      (both isolated and not isolated)
@@ -289,8 +289,7 @@ class Envelope_element_visitor_3 {
 
     // in order to use resolve_minimal_face with intersection halfedge, we
     // go over the new edges, and set data over their faces
-    typename Halfedges_w_type_list::iterator new_edge_it;
-    for (new_edge_it = result_new_edges.begin();
+    for (auto new_edge_it = result_new_edges.begin();
          new_edge_it != result_new_edges.end(); ++new_edge_it) {
       Halfedge_handle new_he = (*new_edge_it).first;
       Halfedge_handle new_he_twin = new_he->twin();
@@ -298,10 +297,10 @@ class Envelope_element_visitor_3 {
       Multiplicity itype = (*new_edge_it).second;
 #endif
       // set sources of the new edge
-      new_he->set_aux_source(0, face->get_aux_source(0));
-      new_he->set_aux_source(1, face->get_aux_source(1));
-      new_he_twin->set_aux_source(0, face->get_aux_source(0));
-      new_he_twin->set_aux_source(1, face->get_aux_source(1));
+      new_he->set_aux_source(0, face->aux_source(0));
+      new_he->set_aux_source(1, face->aux_source(1));
+      new_he_twin->set_aux_source(0, face->aux_source(0));
+      new_he_twin->set_aux_source(1, face->aux_source(1));
 
       // set data on new edges
       new_he->set_decision(EQUAL);
@@ -312,7 +311,7 @@ class Envelope_element_visitor_3 {
       // to f1, not only the opposite
       Face_handle f1 = new_he->face(), f2 = new_he_twin->face();
       Comparison_result res;
-      if (! f1->is_decision_set() && !f2->is_decision_set()) {
+      if (! f1->is_decision_set() && ! f2->is_decision_set()) {
         res = resolve_minimal_face(f1, &new_he);
         copy_data_by_comparison_result(face, f1, res);
       }
@@ -324,7 +323,7 @@ class Envelope_element_visitor_3 {
       if (! f2->is_decision_set()) {
 #ifdef CGAL_ENVELOPE_SAVE_COMPARISONS
         if (itype != 0) {
-          res = convert_decision_to_comparison_result(f1->get_decision());
+          res = convert_decision_to_comparison_result(f1->decision());
           res = resolve_by_intersection_type(res, itype);
           CGAL_expensive_assertion_code
             (Comparison_result tmp_res =
@@ -340,7 +339,7 @@ class Envelope_element_visitor_3 {
       if (! f1->is_decision_set()) {
 #ifdef CGAL_ENVELOPE_SAVE_COMPARISONS
         if (itype != 0) {
-          res = convert_decision_to_comparison_result(f2->get_decision());
+          res = convert_decision_to_comparison_result(f2->decision());
           res = resolve_by_intersection_type(res, itype);
           CGAL_expensive_assertion_code
             (Comparison_result tmp_res = resolve_minimal_face(f1, &new_he));
@@ -357,8 +356,7 @@ class Envelope_element_visitor_3 {
     // we also need to check the faces incident to the halfedges in
     // special_edges since the envelope data over them should be computed
     // using compare_left/right versions
-    Halfedges_list_iterator special_edge_it;
-    for (special_edge_it = result_special_edges.begin();
+    for (auto special_edge_it = result_special_edges.begin();
          special_edge_it != result_special_edges.end(); ++special_edge_it) {
       // we assume that the halfedge given points to the correct face
       // (which is inside the original face)
@@ -372,17 +370,17 @@ class Envelope_element_visitor_3 {
       // take care for the edge, if necessary
       if (! special_he->is_decision_set() &&
           can_copy_decision_from_face_to_edge(special_he)) {
-        // if (!special_he->get_aux_is_set(0) || !special_he->get_aux_is_set(1))
+        // if (!special_he->aux_is_set(0) || !special_he->aux_is_set(1))
         // {
         // // this can only happen when the edge is fake, since the edge is on
         //// the face's boundary
-        //      CGAL_assertion(special_he->get_is_fake());
-        //      special_he->set_aux_source(0, face->get_aux_source(0));
-        //      special_he->set_aux_source(1, face->get_aux_source(1));
-        //      special_he->twin()->set_aux_source(0, face->get_aux_source(0));
-        //      special_he->twin()->set_aux_source(1, face->get_aux_source(1));
+        //      CGAL_assertion(special_he->is_fake());
+        //      special_he->set_aux_source(0, face->aux_source(0));
+        //      special_he->set_aux_source(1, face->aux_source(1));
+        //      special_he->twin()->set_aux_source(0, face->aux_source(0));
+        //      special_he->twin()->set_aux_source(1, face->aux_source(1));
         //   }
-              //if (special_he->get_is_fake())
+              //if (special_he->is_fake())
               //{
               //  // this edge is not fake anymore, as it coincides with a projected
               //  // intersection
@@ -400,22 +398,19 @@ class Envelope_element_visitor_3 {
          ++special_vertex_it) {
       Vertex_handle special_v = *special_vertex_it;
       if (! special_v->is_decision_set()) {
-        if (special_v->get_aux_is_set(0) && special_v->get_aux_is_set(1))
+        if (special_v->aux_is_set(0) && special_v->aux_is_set(1))
           set_data_by_comparison_result(special_v, EQUAL);
         else
           // this is a new vertex inside the face, so we need to update its
           // aux source information from face also (done in method)
           copy_all_data_to_vertex(face, special_v);
       }
-      else
-        CGAL_assertion(special_v->get_aux_is_set(0) &&  \
-                       special_v->get_aux_is_set(1));
+      else CGAL_assertion(special_v->aux_is_set(0) && special_v->aux_is_set(1));
     }
 
     // assert all new faces got data set, if not, then maybe no curve cuts
     // the face, and should use regular resolve_minimal_face
-    typename std::list<Face_handle>::iterator new_face_it;
-    for (new_face_it = result_face_parts.begin();
+    for (auto new_face_it = result_face_parts.begin();
          new_face_it != result_face_parts.end(); ++new_face_it) {
       Face_handle new_face = *new_face_it;
       if (! new_face->is_decision_set()) {
@@ -433,12 +428,12 @@ class Envelope_element_visitor_3 {
   // get an edge with 2 surfaces defined over it, and split it to get the shape
   // of the envelope of these surfaces over the edge
   void resolve(Halfedge_handle edge, Minimization_diagram_2& result) {
-    const Xy_monotone_surface_3& surf1 = get_aux_surface(edge, 0);
-    const Xy_monotone_surface_3& surf2 = get_aux_surface(edge, 1);
+    const Xy_monotone_surface_3& surf1 = aux_surface(edge, 0);
+    const Xy_monotone_surface_3& surf2 = aux_surface(edge, 1);
 
     // find the projected intersections
     std::list<std::variant<Intersection_curve, Point_2>> inter_objs;
-    get_projected_intersections(surf1, surf2, std::back_inserter(inter_objs));
+    projected_intersections(surf1, surf2, std::back_inserter(inter_objs));
 
     if (inter_objs.size() == 0) {
       resolve_minimal_edge(edge, edge);
@@ -560,8 +555,7 @@ class Envelope_element_visitor_3 {
         (original_src->is_at_open_boundary() && is_min_end_at_inf))
     {
       source_is_special = true;
-      if (split_points.front().third == true)
-        overlaps++;
+      if (split_points.front().third == true) ++overlaps;
     }
 
     // check if target is a special vertex, by checking the last point in
@@ -687,8 +681,8 @@ class Envelope_element_visitor_3 {
   void resolve(Vertex_handle vertex) {
     // it is enough to compare only one surface from each group (because they
     // all overlap over the vertex), but set all the group
-    const Xy_monotone_surface_3& surf1 = get_aux_surface(vertex, 0);
-    const Xy_monotone_surface_3& surf2 = get_aux_surface(vertex, 1);
+    const Xy_monotone_surface_3& surf1 = aux_surface(vertex, 0);
+    const Xy_monotone_surface_3& surf2 = aux_surface(vertex, 1);
     const Point_2& point_2 = vertex->point();
     Comparison_result cur_res =
       compare_distance_to_envelope(point_2, surf1, surf2);
@@ -754,8 +748,8 @@ class Envelope_element_visitor_3 {
 
     if (success) return res;
 
-    const Xy_monotone_surface_3& surf1 = get_aux_surface(face, 0);
-    const Xy_monotone_surface_3& surf2 = get_aux_surface(face, 1);
+    const Xy_monotone_surface_3& surf1 = aux_surface(face, 0);
+    const Xy_monotone_surface_3& surf2 = aux_surface(face, 1);
 
     Ccb_halfedge_circulator hec;
     if (he == nullptr) {
@@ -767,7 +761,7 @@ class Envelope_element_visitor_3 {
         Ccb_halfedge_circulator curr = hec;
         do {
           Halfedge_handle he = hec;
-          if(he->is_fictitious()) ++hec;
+          if (he->is_fictitious()) ++hec;
           else {
             found_edge = true;
             const X_monotone_curve_2& cv = hec->curve();
@@ -775,7 +769,7 @@ class Envelope_element_visitor_3 {
             break;
           }
         }
-        while(curr != hec);
+        while (curr != hec);
       }
 
       if (! found_edge) {
@@ -801,7 +795,7 @@ class Envelope_element_visitor_3 {
       CGAL_assertion_code(Ccb_halfedge_circulator hec_begin = hec;
                           ++hec;
                           while (hec != hec_begin) {
-                            if(hec->is_fictitious()) {
+                            if (hec->is_fictitious()) {
                               ++hec;
                               continue;
                             }
@@ -857,9 +851,9 @@ class Envelope_element_visitor_3 {
   // find intersections between 2 xy-monotone surfaces
   // use caching for repeating questions of same pair of surfaces
   template <typename OutputIterator>
-  OutputIterator get_projected_intersections(const Xy_monotone_surface_3& s1,
-                                             const Xy_monotone_surface_3& s2,
-                                             OutputIterator o) {
+  OutputIterator projected_intersections(const Xy_monotone_surface_3& s1,
+                                         const Xy_monotone_surface_3& s2,
+                                         OutputIterator o) {
     return m_traits->construct_projected_intersections_2_object()(s1, s2, o);
   }
 
@@ -893,9 +887,8 @@ class Envelope_element_visitor_3 {
 
   // helper method to get the surfaces we need to work on
   template <typename FeatureHandle>
-  const Xy_monotone_surface_3& get_aux_surface(FeatureHandle fh,
-                                               unsigned int id) {
-    const Object& o = fh->get_aux_source(id);
+  const Xy_monotone_surface_3& aux_surface(FeatureHandle fh, unsigned int id) {
+    const Object& o = fh->aux_source(id);
     CGAL_assertion(!o.is_empty());
 
     // aux source of a face must be a face!
@@ -904,30 +897,30 @@ class Envelope_element_visitor_3 {
     // this is why we start with a check for a face, then halfedge
     // and last vertex
     Face_handle f;
-    if (assign(f, o)) return f->get_env_data();
+    if (assign(f, o)) return f->env_data_front();
 
     Halfedge_handle h;
-    if (assign(h, o)) return h->get_env_data();
+    if (assign(h, o)) return h->env_data_front();
 
     Vertex_handle v;
     CGAL_assertion_code(bool b =)
     assign(v, o);
     CGAL_assertion(b);
-    return v->get_env_data();
+    return v->env_data_front();
   }
 
   bool can_copy_decision_from_face_to_edge(Halfedge_handle h) {
     // can copy decision from face to its incident edge if the aux
     // envelopes are continuous over the face and edge
-    return (h->get_has_equal_aux_data_in_face(0) &&
-            h->get_has_equal_aux_data_in_face(1));
+    return (h->has_equal_aux_data_in_face(0) &&
+            h->has_equal_aux_data_in_face(1));
   }
 
   bool can_copy_decision_from_edge_to_vertex(Halfedge_handle h) {
     // can copy decision from face to its incident edge if the aux
     // envelopes are continuous over the face and edge
-    return (h->get_has_equal_aux_data_in_target(0) &&
-            h->get_has_equal_aux_data_in_target(1));
+    return (h->has_equal_aux_data_in_target(0) &&
+            h->has_equal_aux_data_in_target(1));
   }
 
 
@@ -957,7 +950,7 @@ class Envelope_element_visitor_3 {
       if (! vh->is_decision_set() && has_equal_aux_data_with_face(vh))
         // can copy the data from the face, since we already took care of
         // the vertices of projected intersections
-        vh->set_decision(face->get_decision());
+        vh->set_decision(face->decision());
     }
   }
 
@@ -966,21 +959,18 @@ class Envelope_element_visitor_3 {
     Ccb_halfedge_circulator hec_begin = hec;
     do {
       Halfedge_handle hh = hec;
-      if (hh->is_fictitious()) {
-        ++hec;
-        continue;
-      }
+      if (hh->is_fictitious()) continue;
       CGAL_assertion(face == hh->face());
       // if it is a vertical decomposition edge, copy data from face
-      /*if (!hh->is_decision_set() && hh->get_is_fake())
-        {
-        hh->set_decision(face->get_decision());
-        hh->twin()->set_decision(face->get_decision());
-        }*/
+      /* if (!hh->is_decision_set() && hh->is_fake()) {
+       *   hh->set_decision(face->decision());
+       *   hh->twin()->set_decision(face->decision());
+       * }
+       */
       if (! hh->is_decision_set() && can_copy_decision_from_face_to_edge(hh)) {
         // copy the decision from face to the edge
-        hh->set_decision(face->get_decision());
-        hh->twin()->set_decision(hh->get_decision());
+        hh->set_decision(face->decision());
+        hh->twin()->set_decision(hh->decision());
       }
       // TODO: is this correct? shouldn't we split the edge first?
       // I think it is correct, because there is no intersection (of
@@ -992,19 +982,18 @@ class Envelope_element_visitor_3 {
       // from the face to the edge, the envelope goes closer), then if the
       // second map wins on the face, it wins on the edge also
       else if (! hh->is_decision_set() &&
-               face->get_decision() == DAC_DECISION_SECOND &&
-               hh->get_has_equal_aux_data_in_face(0) &&
-               ! hh->get_has_equal_aux_data_in_face(1)) {
+               face->decision() == DAC_DECISION_SECOND &&
+               hh->has_equal_aux_data_in_face(0) &&
+               ! hh->has_equal_aux_data_in_face(1)) {
         hh->set_decision(DAC_DECISION_SECOND);
         hh->twin()->set_decision(DAC_DECISION_SECOND);
-
       }
       // if the second map is continuous, but the first isn't, then if the
       // first map wins on the face, it wins on the edge also
       else if (! hh->is_decision_set() &&
-               face->get_decision() == DAC_DECISION_FIRST &&
-               ! hh->get_has_equal_aux_data_in_face(0) &&
-               hh->get_has_equal_aux_data_in_face(1)) {
+               face->decision() == DAC_DECISION_FIRST &&
+               ! hh->has_equal_aux_data_in_face(0) &&
+               hh->has_equal_aux_data_in_face(1)) {
         hh->set_decision(DAC_DECISION_FIRST);
         hh->twin()->set_decision(DAC_DECISION_FIRST);
       }
@@ -1014,9 +1003,7 @@ class Envelope_element_visitor_3 {
       // conclude from one edge, bt can conclude from the other
       conclude_decision_to_vertex(hh->source(), hh->twin(), face, false);
       conclude_decision_to_vertex(hh->target(), hh, face, true);
-
-      hec++;
-    } while(hec != hec_begin);
+    } while (++hec != hec_begin);
   }
 
   // try to conclude the decision from the halfedge or the face to the vertex
@@ -1028,23 +1015,23 @@ class Envelope_element_visitor_3 {
                                    Face_handle fh, bool try_vertex_face) {
     if (vh->is_decision_set()) return;
 
-// first, we try to copy decision from edge, then from face
+    // first, we try to copy decision from edge, then from face
     if (hh->is_decision_set() && can_copy_decision_from_edge_to_vertex(hh))
-      vh->set_decision(hh->get_decision());
+      vh->set_decision(hh->decision());
 
     // if the first map is continuous, but the second isn't (i.e. when we move
     // from the edge to the vertex, the envelope goes closer), then if the
     // second map wins on the edge, it wins on the vertex also
-    else if (hh->get_decision() == DAC_DECISION_SECOND &&
-             hh->get_has_equal_aux_data_in_target(0) &&
-             ! hh->get_has_equal_aux_data_in_target(1))
+    else if (hh->decision() == DAC_DECISION_SECOND &&
+             hh->has_equal_aux_data_in_target(0) &&
+             ! hh->has_equal_aux_data_in_target(1))
       vh->set_decision(DAC_DECISION_SECOND);
 
     // if the second map is continuous, but the first isn't, then if the
     // first map wins on the edge, it wins on the vertex also
-    else if (hh->get_decision() == DAC_DECISION_FIRST &&
-             ! hh->get_has_equal_aux_data_in_target(0) &&
-             hh->get_has_equal_aux_data_in_target(1))
+    else if (hh->decision() == DAC_DECISION_FIRST &&
+             ! hh->has_equal_aux_data_in_target(0) &&
+             hh->has_equal_aux_data_in_target(1))
       vh->set_decision(DAC_DECISION_FIRST);
 
     // check if we can copy from the face
@@ -1056,15 +1043,17 @@ class Envelope_element_visitor_3 {
       if (has_equal_aux_data_in_target_and_face(hh)) {
         // can copy the data from the face, since we already took care of
         // the vertices of projected intersections
-        vh->set_decision(fh->get_decision());
+        vh->set_decision(fh->decision());
       }
     }
   }
 
   // todo: this is for checking
   template <typename InputIterator>
-  bool has_equal_data(const InputIterator& begin1, const InputIterator& end1,
-                      const InputIterator& begin2, const InputIterator& end2) {
+  bool has_equal_env_data(const InputIterator& begin1,
+                          const InputIterator& end1,
+                          const InputIterator& begin2,
+                          const InputIterator& end2) {
     // insert the input data objects into a set
     std::set<Xy_monotone_surface_3> first(begin1, end1);
     std::set<Xy_monotone_surface_3> second(begin2, end2);
@@ -1078,29 +1067,29 @@ class Envelope_element_visitor_3 {
 
   // todo: this is for checking
   template <typename FeatureHandle>
-  void get_aux_data_iterators(unsigned int id, FeatureHandle fh,
-                              Envelope_data_iterator& begin,
-                              Envelope_data_iterator& end) {
+  void aux_data_iterators(unsigned int id, FeatureHandle fh,
+                          Envelope_data_iterator& begin,
+                          Envelope_data_iterator& end) {
     Halfedge_handle h;
     Vertex_handle v;
     Face_handle f;
 
-    const Object& o = fh->get_aux_source(id);
+    const Object& o = fh->aux_source(id);
     CGAL_assertion(!o.is_empty());
 
     if (assign(v, o)) {
-      begin = v->begin_data();
-      end = v->end_data();
+      begin = v->begin_env_data();
+      end = v->end_env_data();
     }
     else if (assign(h, o)) {
-      begin = h->begin_data();
-      end = h->end_data();
+      begin = h->begin_env_data();
+      end = h->end_env_data();
     }
     else {
       CGAL_assertion(assign(f, o));
       assign(f, o);
-      begin = f->begin_data();
-      end = f->end_data();
+      begin = f->begin_env_data();
+      end = f->end_env_data();
     }
   }
 
@@ -1109,9 +1098,9 @@ class Envelope_element_visitor_3 {
   bool has_equal_aux_data(unsigned int id, FeatureHandle1 fh1,
                           FeatureHandle2 fh2) {
     Envelope_data_iterator begin1, end1, begin2, end2;
-    get_aux_data_iterators(id, fh1, begin1, end1);
-    get_aux_data_iterators(id, fh2, begin2, end2);
-    bool has_eq = has_equal_data(begin1, end1, begin2, end2);
+    aux_data_iterators(id, fh1, begin1, end1);
+    aux_data_iterators(id, fh2, begin2, end2);
+    bool has_eq = has_equal_env_data(begin1, end1, begin2, end2);
     return has_eq;
   }
 
@@ -1122,7 +1111,6 @@ class Envelope_element_visitor_3 {
             has_equal_aux_data(1, fh1, fh2));
   }
 
-
   // check if we can copy the decision made on a boundary edge to the face
   // if so, res will contain this decision's comparison result
   bool can_copy_decision_from_boundary_edge(Face_handle face,
@@ -1138,37 +1126,33 @@ class Envelope_element_visitor_3 {
       hec_begin = hec;
       do {
         Halfedge_handle hh = hec;
-        if(hh->is_fictitious()) {
-          ++hec;
-          continue;
-        }
+        if (hh->is_fictitious()) continue;
         if (can_copy_decision_from_face_to_edge(hh) &&
             hh->is_decision_set() &&
-            hh->get_decision() != DAC_DECISION_BOTH) {
-          res = convert_decision_to_comparison_result(hh->get_decision());
+            hh->decision() != DAC_DECISION_BOTH) {
+          res = convert_decision_to_comparison_result(hh->decision());
           result = true;
         }
         // if the first map is continuous, but the second isn't (i.e. when we
         // move from the edge to the face, the envelope goes farther), then
         // if the first map wins on the edge, it wins on the face also
         else if (hh->is_decision_set() &&
-                 hh->get_decision() == DAC_DECISION_FIRST &&
-                 hh->get_has_equal_aux_data_in_face(0) &&
-                 ! hh->get_has_equal_aux_data_in_face(1)) {
+                 hh->decision() == DAC_DECISION_FIRST &&
+                 hh->has_equal_aux_data_in_face(0) &&
+                 ! hh->has_equal_aux_data_in_face(1)) {
           res = convert_decision_to_comparison_result(DAC_DECISION_FIRST);
           result = true;
         }
         // if the second map is continuous, but the first isn't, then if the
         // second map wins on the edge, it wins on the face also
         else if (hh->is_decision_set() &&
-                 hh->get_decision() == DAC_DECISION_SECOND &&
-                 !hh->get_has_equal_aux_data_in_face(0) &&
-                 hh->get_has_equal_aux_data_in_face(1)) {
+                 hh->decision() == DAC_DECISION_SECOND &&
+                 !hh->has_equal_aux_data_in_face(0) &&
+                 hh->has_equal_aux_data_in_face(1)) {
           res = convert_decision_to_comparison_result(DAC_DECISION_SECOND);
           result = true;
         }
-        hec++;
-      } while(hec != hec_begin && !result);
+      } while ((++hec != hec_begin) && ! result);
       if (result) return true;
     }
 
@@ -1182,33 +1166,30 @@ class Envelope_element_visitor_3 {
         Halfedge_handle hh = hec;
         if (can_copy_decision_from_face_to_edge(hh) &&
             hh->is_decision_set() &&
-            hh->get_decision() != DAC_DECISION_BOTH) {
-          res = convert_decision_to_comparison_result(hh->get_decision());
+            hh->decision() != DAC_DECISION_BOTH) {
+          res = convert_decision_to_comparison_result(hh->decision());
           result = true;
         }
         // if the first map is continuous, but the second isn't (i.e. when we
         // move from the edge to the face, the envelope goes farther), then
         // if the first map wins on the edge, it wins on the face also
         else if (hh->is_decision_set() &&
-                 hh->get_decision() == DAC_DECISION_FIRST &&
-                 hh->get_has_equal_aux_data_in_face(0) &&
-                 ! hh->get_has_equal_aux_data_in_face(1)) {
+                 hh->decision() == DAC_DECISION_FIRST &&
+                 hh->has_equal_aux_data_in_face(0) &&
+                 ! hh->has_equal_aux_data_in_face(1)) {
           res = convert_decision_to_comparison_result(DAC_DECISION_FIRST);
-
           result = true;
         }
         // if the second map is continuous, but the first isn't, then if the
         // second map wins on the edge, it wins on the face also
         else if (hh->is_decision_set() &&
-                 hh->get_decision() == DAC_DECISION_SECOND &&
-                 ! hh->get_has_equal_aux_data_in_face(0) &&
-                 hh->get_has_equal_aux_data_in_face(1)) {
+                 hh->decision() == DAC_DECISION_SECOND &&
+                 ! hh->has_equal_aux_data_in_face(0) &&
+                 hh->has_equal_aux_data_in_face(1)) {
           res = convert_decision_to_comparison_result(DAC_DECISION_SECOND);
           result = true;
         }
-
-        hec++;
-      } while(hec != hec_begin && !result);
+      } while ((++hec != hec_begin) && ! result);
       if (result) return true;
     }
 
@@ -1228,13 +1209,13 @@ class Envelope_element_visitor_3 {
 
   bool has_equal_aux_data_with_face(Vertex_handle v) {
     CGAL_assertion(v->is_isolated());
-    return (v->get_has_equal_aux_data_in_face(0) &&
-            v->get_has_equal_aux_data_in_face(1));
+    return (v->has_equal_aux_data_in_face(0) &&
+            v->has_equal_aux_data_in_face(1));
   }
 
   bool has_equal_aux_data_in_target_and_face(Halfedge_handle h) {
-    return (h->get_has_equal_aux_data_in_target_and_face(0) &&
-            h->get_has_equal_aux_data_in_target_and_face(1));
+    return (h->has_equal_aux_data_in_target_and_face(0) &&
+            h->has_equal_aux_data_in_target_and_face(1));
   }
 
   // check the aux data on the endpoint vertices of the edge
@@ -1246,20 +1227,20 @@ class Envelope_element_visitor_3 {
         can_copy_decision_from_edge_to_vertex(edge->twin()))
       // can copy the data from the edge, since we already took care of
       // the vertices of projected intersections
-      edge->source()->set_decision(edge->get_decision());
+      edge->source()->set_decision(edge->decision());
     // if the first map is continuous, but the second isn't (i.e. when we move
     // from the edge to the vertex, the envelope goes closer), then if the
     // second map wins on the edge, it wins on the vertex also
-    else if (edge->get_decision() == DAC_DECISION_SECOND &&
-             edge->twin()->get_has_equal_aux_data_in_target(0) &&
-             !edge->twin()->get_has_equal_aux_data_in_target(1)) {
+    else if (edge->decision() == DAC_DECISION_SECOND &&
+             edge->twin()->has_equal_aux_data_in_target(0) &&
+             !edge->twin()->has_equal_aux_data_in_target(1)) {
       edge->source()->set_decision(DAC_DECISION_SECOND);
     }
     // if the second map is continuous, but the first isn't, then if the
     // first map wins on the edge, it wins on the vertex also
-    else if (edge->get_decision() == DAC_DECISION_FIRST &&
-             !edge->twin()->get_has_equal_aux_data_in_target(0) &&
-             edge->twin()->get_has_equal_aux_data_in_target(1)) {
+    else if (edge->decision() == DAC_DECISION_FIRST &&
+             !edge->twin()->has_equal_aux_data_in_target(0) &&
+             edge->twin()->has_equal_aux_data_in_target(1)) {
       edge->source()->set_decision(DAC_DECISION_FIRST);
     }
 
@@ -1268,20 +1249,20 @@ class Envelope_element_visitor_3 {
         can_copy_decision_from_edge_to_vertex(edge))
       // can copy the data from the edge, since we already took care of
       // the vertices of projected intersections
-      edge->target()->set_decision(edge->get_decision());
+      edge->target()->set_decision(edge->decision());
     // if the first map is continuous, but the second isn't (i.e. when we move
     // from the edge to the vertex, the envelope goes closer), then if the
     // second map wins on the edge, it wins on the vertex also
-    else if (edge->get_decision() == DAC_DECISION_SECOND &&
-             edge->get_has_equal_aux_data_in_target(0) &&
-             !edge->get_has_equal_aux_data_in_target(1)) {
+    else if (edge->decision() == DAC_DECISION_SECOND &&
+             edge->has_equal_aux_data_in_target(0) &&
+             !edge->has_equal_aux_data_in_target(1)) {
       edge->target()->set_decision(DAC_DECISION_SECOND);
     }
     // if the second map is continuous, but the first isn't, then if the
     // first map wins on the edge, it wins on the vertex also
-    else if (edge->get_decision() == DAC_DECISION_FIRST &&
-             !edge->get_has_equal_aux_data_in_target(0) &&
-             edge->get_has_equal_aux_data_in_target(1)) {
+    else if (edge->decision() == DAC_DECISION_FIRST &&
+             !edge->has_equal_aux_data_in_target(0) &&
+             edge->has_equal_aux_data_in_target(1)) {
       edge->target()->set_decision(DAC_DECISION_FIRST);
     }
   }
@@ -1454,8 +1435,7 @@ class Envelope_element_visitor_3 {
             CGAL_assertion(tmp == copied_prev_v2);
 
             bool new_face;
-            if (is_outer_ccb)
-            {
+            if (is_outer_ccb) {
               // if it is the first face created, and the last halfedge to
               // insert, this is a regular outer ccb, with no special
               // degeneracies (around the current vertices, at least)
@@ -1469,8 +1449,8 @@ class Envelope_element_visitor_3 {
                    copied_prev_v2->next(),
                    new_face,
                    dummy_swapped_predecessors);
-                // TODO EBEB 2012-08-06 do we have to care if order has been swapped,
-                // or do we have to disallow swapping?
+                // TODO EBEB 2012-08-06 do we have to care if order has been
+                // swapped, or do we have to disallow swapping?
 
                 CGAL_assertion(new_face);
               }
@@ -1503,8 +1483,8 @@ class Envelope_element_visitor_3 {
                                                   copied_prev_he->next(),
                                                   new_face,
                                                   dummy_swapped_predecessors);
-              // TODO EBEB 2012-08-06 do we have to care if order has been swapped,
-              // or do we have to disallow swapping?
+              // TODO EBEB 2012-08-06 do we have to care if order has been
+              // swapped, or do we have to disallow swapping?
 
               CGAL_assertion(new_face);
               copied_new_he = copied_new_he->twin();
@@ -1522,9 +1502,7 @@ class Envelope_element_visitor_3 {
           copied_prev_he = copied_new_he;
         }
       }
-      hec++;
-    } while(hec != hec_begin);
-
+    } while (++hec != hec_begin);
   }
 
   void copy_ccb_unbounded(Ccb_halfedge_circulator hec,
@@ -1543,8 +1521,7 @@ class Envelope_element_visitor_3 {
         non_fict = hec;
         break;
       }
-      ++hec;
-    } while(hec != hec_end);
+    } while (++hec != hec_end);
 
     // Find an anchor halfedge he_from along the original CCB and locate
     // its image he_to in the target CCB.
@@ -1712,26 +1689,26 @@ class Envelope_element_visitor_3 {
   // aux data of face "from"
   void copy_data_by_comparison_result(Face_handle from, Face_handle to,
                                       Comparison_result res) {
-    CGAL_assertion_msg(from->get_aux_is_set(0), "aux_data(0) is not set");
-    CGAL_assertion_msg(from->get_aux_is_set(1), "aux_data(1) is not set");
-    to->set_aux_source(0, from->get_aux_source(0));
-    to->set_aux_source(1, from->get_aux_source(1));
+    CGAL_assertion_msg(from->aux_is_set(0), "aux_data(0) is not set");
+    CGAL_assertion_msg(from->aux_is_set(1), "aux_data(1) is not set");
+    to->set_aux_source(0, from->aux_source(0));
+    to->set_aux_source(1, from->aux_source(1));
     to->set_decision(res);
   }
 
   // set envelope data in vertex "v" according to the comparison result of the
   // aux data of "v"
   void set_data_by_comparison_result(Vertex_handle v, Comparison_result res) {
-    CGAL_assertion_msg(v->get_aux_is_set(0), "aux_data(0) is not set");
-    CGAL_assertion_msg(v->get_aux_is_set(1), "aux_data(1) is not set");
+    CGAL_assertion_msg(v->aux_is_set(0), "aux_data(0) is not set");
+    CGAL_assertion_msg(v->aux_is_set(1), "aux_data(1) is not set");
     v->set_decision(res);
   }
 
   // set envelope data in halfedge "h" according to the comparison result of
   // the aux data of "h"
   void set_data_by_comparison_result(Halfedge_handle h, Comparison_result res) {
-    CGAL_assertion_msg(h->get_aux_is_set(0), "aux_data(0) is not set");
-    CGAL_assertion_msg(h->get_aux_is_set(1), "aux_data(1) is not set");
+    CGAL_assertion_msg(h->aux_is_set(0), "aux_data(0) is not set");
+    CGAL_assertion_msg(h->aux_is_set(1), "aux_data(1) is not set");
     h->set_decision(res);
   }
 
@@ -1741,38 +1718,38 @@ class Envelope_element_visitor_3 {
   // Vertex_handle
   template <typename FeatureHabdle>
   void copy_all_data_to_vertex(FeatureHabdle from, Vertex_handle to) {
-    CGAL_assertion_msg(from->get_aux_is_set(0), "aux_data(0) is not set");
-    CGAL_assertion_msg(from->get_aux_is_set(1), "aux_data(1) is not set");
+    CGAL_assertion_msg(from->aux_is_set(0), "aux_data(0) is not set");
+    CGAL_assertion_msg(from->aux_is_set(1), "aux_data(1) is not set");
     CGAL_assertion_msg(!to->is_decision_set(), "data is set in new vertex");
-    to->set_aux_source(0, from->get_aux_source(0));
-    to->set_aux_source(1, from->get_aux_source(1));
+    to->set_aux_source(0, from->aux_source(0));
+    to->set_aux_source(1, from->aux_source(1));
     to->set_decision(EQUAL);
   }
 
   //   void deal_with_new_vertex(Halfedge_handle orig_he, Vertex_handle new_v)
   //   {
-  //     const Xy_monotone_surface_3& surf1 = get_aux_surface(orig_he, 0);
-  //     const Xy_monotone_surface_3& surf2 = get_aux_surface(orig_he, 1);
+  //     const Xy_monotone_surface_3& surf1 = aux_surface(orig_he, 0);
+  //     const Xy_monotone_surface_3& surf2 = aux_surface(orig_he, 1);
 
   //     const Point_2& p = new_v->point();
   //     Comparison_result res = compare_distance_to_envelope(p, surf1, surf2);
-  //     new_v->set_aux_source(0, orig_he->get_aux_source(0));
-  //     new_v->set_aux_source(1, orig_he->get_aux_source(1));
+  //     new_v->set_aux_source(0, orig_he->aux_source(0));
+  //     new_v->set_aux_source(1, orig_he->aux_source(1));
   //     new_v->set_decision(res);
   //   }
 
   Comparison_result resolve_minimal_edge(Halfedge_handle orig_he,
                                          Halfedge_handle new_he) {
     // find and set the envelope data on the new edge
-    const Xy_monotone_surface_3& surf1 = get_aux_surface(orig_he, 0);
-    const Xy_monotone_surface_3& surf2 = get_aux_surface(orig_he, 1);
+    const Xy_monotone_surface_3& surf1 = aux_surface(orig_he, 0);
+    const Xy_monotone_surface_3& surf2 = aux_surface(orig_he, 1);
     Comparison_result res =
       compare_distance_to_envelope(new_he->curve(), surf1, surf2);
 
     // the observer keeps this information when splitting an edge
-    CGAL_assertion(new_he->get_aux_is_set(0) && new_he->get_aux_is_set(1));
-    CGAL_assertion(new_he->twin()->get_aux_is_set(0) && \
-                   new_he->twin()->get_aux_is_set(1));
+    CGAL_assertion(new_he->aux_is_set(0) && new_he->aux_is_set(1));
+    CGAL_assertion(new_he->twin()->aux_is_set(0) && \
+                   new_he->twin()->aux_is_set(1));
 
     new_he->set_decision(res);
     new_he->twin()->set_decision(res);
@@ -1856,8 +1833,8 @@ class Envelope_element_visitor_3 {
         CGAL_assertion(map_halfedges.is_defined(org_he));
         CGAL_assertion(org_he->target() == new_he->source());
 
-        if ((map_halfedges[org_he])->get_has_equal_aux_data_in_face(0) &&
-            (map_halfedges[org_he])->get_has_equal_aux_data_in_face(1))
+        if ((map_halfedges[org_he])->has_equal_aux_data_in_face(0) &&
+            (map_halfedges[org_he])->has_equal_aux_data_in_face(1))
           (*special_vertices)[org_he->target()] =
             special_vertices->default_value();
 
@@ -1882,8 +1859,9 @@ class Envelope_element_visitor_3 {
         (*vertices_to_halfedges)[org_he->target()] = correct_side_he;
 
         //BZBZ
-        /* CGAL_assertion(vertices_to_halfedges->is_defined(correct_side_he->source()) &&
-           vertices_to_halfedges->is_defined(correct_side_he->next()->target()));*/
+        // CGAL_assertion
+        //  (vertices_to_halfedges->is_defined(correct_side_he->source()) &&
+        //   vertices_to_halfedges->is_defined(correct_side_he->next()->target()));
         (*vertices_to_halfedges)[correct_side_he->next()->target()] =
           correct_side_he->next();
 
@@ -2435,8 +2413,7 @@ class Envelope_element_visitor_3 {
                           Vertex_handle left_v, Halfedge_handle left_he,
                           Vertex_handle right_v, Halfedge_handle right_he) {
       // insert the curve only if the face is ok
-      if (is_face_ok(face))
-      {
+      if (is_face_ok(face)) {
         CGAL_assertion(copied_arr.is_valid());
         Result base_result = insert_visitor.found_subcurve(cv, face,
                                                            left_v, left_he,
@@ -2486,17 +2463,17 @@ class Envelope_element_visitor_3 {
             // since we have in the new edge aux sources as in the face,
             // we can copy the vertex-face flags from the vertex
             result_new_he->set_is_equal_aux_data_in_target
-              (0, cur_t->get_is_equal_aux_data_in_face(0));
+              (0, cur_t->is_equal_aux_data_in_face(0));
             result_new_he->set_is_equal_aux_data_in_target
-              (1, cur_t->get_is_equal_aux_data_in_face(1));
+              (1, cur_t->is_equal_aux_data_in_face(1));
             result_new_he->set_has_equal_aux_data_in_target
-              (0, cur_t->get_has_equal_aux_data_in_face(0));
+              (0, cur_t->has_equal_aux_data_in_face(0));
             result_new_he->set_has_equal_aux_data_in_target
-              (1, cur_t->get_has_equal_aux_data_in_face(1));
+              (1, cur_t->has_equal_aux_data_in_face(1));
             result_new_he->set_has_equal_aux_data_in_target_and_face
-              (0, cur_t->get_has_equal_aux_data_in_face(0));
+              (0, cur_t->has_equal_aux_data_in_face(0));
             result_new_he->set_has_equal_aux_data_in_target_and_face
-              (1, cur_t->get_has_equal_aux_data_in_face(1));
+              (1, cur_t->has_equal_aux_data_in_face(1));
           }
           else {
             CGAL_assertion(copied_b_he->target() == cur_t);
@@ -2505,20 +2482,20 @@ class Envelope_element_visitor_3 {
 
 
             bool flag;
-            flag = (b_he->get_is_equal_aux_data_in_face(0) &&
-                    b_he->get_is_equal_aux_data_in_target(0));
+            flag = (b_he->is_equal_aux_data_in_face(0) &&
+                    b_he->is_equal_aux_data_in_target(0));
             result_new_he->set_is_equal_aux_data_in_target(0, flag);
 
-            flag = (b_he->get_is_equal_aux_data_in_face(1) &&
-                    b_he->get_is_equal_aux_data_in_target(1));
+            flag = (b_he->is_equal_aux_data_in_face(1) &&
+                    b_he->is_equal_aux_data_in_target(1));
             result_new_he->set_is_equal_aux_data_in_target(1, flag);
 
-            flag = b_he->get_has_equal_aux_data_in_target_and_face(0);
+            flag = b_he->has_equal_aux_data_in_target_and_face(0);
             //CGAL_assertion(flag == parent->has_equal_aux_data(0, b_he->face(), b_he->target()));
             result_new_he->set_has_equal_aux_data_in_target(0, flag);
             result_new_he->set_has_equal_aux_data_in_target_and_face(0, flag);
 
-            flag = b_he->get_has_equal_aux_data_in_target_and_face(1);
+            flag = b_he->has_equal_aux_data_in_target_and_face(1);
             //CGAL_assertion(flag == parent->has_equal_aux_data(1, b_he->face(), b_he->target()));
             result_new_he->set_has_equal_aux_data_in_target(1, flag);
             result_new_he->set_has_equal_aux_data_in_target_and_face(1, flag);
@@ -2544,17 +2521,17 @@ class Envelope_element_visitor_3 {
             // since we have in the new edge aux sources as in the face,
             // we can copy the vertex-face flags from the vertex
             result_new_he->twin()->set_is_equal_aux_data_in_target
-              (0, cur_t->get_is_equal_aux_data_in_face(0));
+              (0, cur_t->is_equal_aux_data_in_face(0));
             result_new_he->twin()->set_is_equal_aux_data_in_target
-              (1, cur_t->get_is_equal_aux_data_in_face(1));
+              (1, cur_t->is_equal_aux_data_in_face(1));
             result_new_he->twin()->set_has_equal_aux_data_in_target
-              (0, cur_t->get_has_equal_aux_data_in_face(0));
+              (0, cur_t->has_equal_aux_data_in_face(0));
             result_new_he->twin()->set_has_equal_aux_data_in_target
-              (1, cur_t->get_has_equal_aux_data_in_face(1));
+              (1, cur_t->has_equal_aux_data_in_face(1));
             result_new_he->twin()->set_has_equal_aux_data_in_target_and_face
-              (0, cur_t->get_has_equal_aux_data_in_face(0));
+              (0, cur_t->has_equal_aux_data_in_face(0));
             result_new_he->twin()->set_has_equal_aux_data_in_target_and_face
-              (1, cur_t->get_has_equal_aux_data_in_face(1));
+              (1, cur_t->has_equal_aux_data_in_face(1));
           }
           else {
             CGAL_assertion(copied_b_he->target() == cur_t);
@@ -2562,20 +2539,20 @@ class Envelope_element_visitor_3 {
             Halfedge_handle b_he = map_halfedges[copied_b_he];
 
             bool flag;
-            flag = (b_he->get_is_equal_aux_data_in_face(0) &&
-                    b_he->get_is_equal_aux_data_in_target(0));
+            flag = (b_he->is_equal_aux_data_in_face(0) &&
+                    b_he->is_equal_aux_data_in_target(0));
             result_new_he->twin()->set_is_equal_aux_data_in_target(0, flag);
 
-            flag = (b_he->get_is_equal_aux_data_in_face(1) &&
-                    b_he->get_is_equal_aux_data_in_target(1));
+            flag = (b_he->is_equal_aux_data_in_face(1) &&
+                    b_he->is_equal_aux_data_in_target(1));
             result_new_he->twin()->set_is_equal_aux_data_in_target(1, flag);
 
-            flag = b_he->get_has_equal_aux_data_in_target_and_face(0);
-            //CGAL_assertion(flag == parent->has_equal_aux_data(0, b_he->face(), b_he->target()));
+            flag = b_he->has_equal_aux_data_in_target_and_face(0);
+            // CGAL_assertion(flag == parent->has_equal_aux_data(0, b_he->face(), b_he->target()));
             result_new_he->twin()->set_has_equal_aux_data_in_target(0, flag);
             result_new_he->twin()->set_has_equal_aux_data_in_target_and_face(0, flag);
 
-            flag = b_he->get_has_equal_aux_data_in_target_and_face(1);
+            flag = b_he->has_equal_aux_data_in_target_and_face(1);
             //CGAL_assertion(flag == parent->has_equal_aux_data(1, b_he->face(), b_he->target()));
             result_new_he->twin()->set_has_equal_aux_data_in_target(1, flag);
             result_new_he->twin()->set_has_equal_aux_data_in_target_and_face(1, flag);
@@ -2898,10 +2875,10 @@ class Envelope_element_visitor_3 {
     virtual void after_split_face(Face_handle org_f, Face_handle new_f, bool)
       override {
       // update the new face's aux_data from original face
-      if (org_f->get_aux_is_set(0))
-        new_f->set_aux_source(0, org_f->get_aux_source(0));
-      if (org_f->get_aux_is_set(1))
-        new_f->set_aux_source(1, org_f->get_aux_source(1));
+      if (org_f->aux_is_set(0))
+        new_f->set_aux_source(0, org_f->aux_source(0));
+      if (org_f->aux_is_set(1))
+        new_f->set_aux_source(1, org_f->aux_source(1));
     }
   };
 
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h
index 118d9825c03f..78dc81612ea3 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h
@@ -60,135 +60,117 @@ class Envelope_overlay_2 {
   }
 
 public:
-  /*
-  void print_face(Face_handle fh)
-  {
-    std::cout << (fh->is_unbounded() ? "unbounded" : "bounded");
-
-    if (fh->get_is_set())
-    {
-      std::cout << " #data= " << fh->number_of_data_objects();
-      if (fh->number_of_data_objects() > 0)
-        std::cout << " data= " << fh->get_env_data();
-    }
-
-    if (fh->get_aux_is_set(0))
-    {
-      std::cout << " #data1= " << get_number_of_aux_data_objects(fh, 0);
-      if (get_number_of_aux_data_objects(fh, 0)>0)
-        std::cout << " data#1= " << get_aux_data(fh, 0);
-    }
-    if (fh->get_aux_is_set(1))
-    {
-      std::cout << " #data2= " << get_number_of_aux_data_objects(fh, 1);
-      if (get_number_of_aux_data_objects(fh, 1)>0)
-        std::cout << " data#2= " << get_aux_data(fh, 1);
-    }
-    std::cout << std::endl;
-  }
-
-  // print the aux data in the faces of md
-  void print_faces(Minimization_diagram_2& md)
-  {
-    Face_iterator fit = md.faces_begin();
-    for(; fit != md.faces_end(); ++fit)
-    {
-      Face_handle fh = fit;
-      print_face(fh);
-    }
-    std::cout << std::endl;
-  }
-
-  void print_vertices(Minimization_diagram_2& md)
-  {
-    Vertex_iterator vit = md.vertices_begin();
-    for(; vit != md.vertices_end(); ++vit)
-    {
-      Vertex_handle vh = vit;
-      std::cout << vh->point();
-
-      if (vh->get_is_set())
-      {
-        std::cout << " #data= " << vh->number_of_data_objects();
-        if (vh->number_of_data_objects() > 0)
-          std::cout << " data= " << vh->get_env_data();
-      }
-
-      if (vh->get_aux_is_set(0))
-      {
-        std::cout << " #data1= " << get_number_of_aux_data_objects(vh, 0);
-        if (get_number_of_aux_data_objects(vh, 0)>0)
-          std::cout << " data#1= " << get_aux_data(vh, 0);
-      }
-      if (vh->get_aux_is_set(1))
-      {
-        std::cout << " #data2= " << get_number_of_aux_data_objects(vh, 1);
-        if (get_number_of_aux_data_objects(vh, 1)>0)
-          std::cout << " data#2= " << get_aux_data(vh, 1);
-      }
-      std::cout << std::endl;
-    }
-    std::cout << std::endl;
-  }
-
-  void print_edges(Minimization_diagram_2& md)
-  {
-    Halfedge_iterator hit = md.halfedges_begin();
-    for(; hit != md.halfedges_end(); ++hit, ++hit)
-    {
-      Halfedge_handle hh = hit;
-      std::cout << hh->curve();
-
-      if (hh->get_is_set())
-      {
-        std::cout << " #data= " << hh->number_of_data_objects();
-        if (hh->number_of_data_objects() > 0)
-          std::cout << " data= " << hh->get_env_data();
-      }
-
-
-      if (hh->get_aux_is_set(0))
-      {
-        std::cout << " #data1= " << get_number_of_aux_data_objects(hh, 0);
-        if (get_number_of_aux_data_objects(hh, 0)>0)
-          std::cout << " data#1= " << get_aux_data(hh, 0);
-      }
-      if (hh->get_aux_is_set(1))
-      {
-        std::cout << " #data2= " << get_number_of_aux_data_objects(hh, 1);
-
-        if (get_number_of_aux_data_objects(hh, 1)>0)
-          std::cout << " data#2= " << get_aux_data(hh, 1);
-      }
-      std::cout << std::endl;
-    }
-    std::cout << std::endl;
-  }
-  */
+  /* void print_face(Face_handle fh) {
+   *   std::cout << (fh->is_unbounded() ? "unbounded" : "bounded");
+   *
+   *   if (fh->env_is_set()) {
+   *     std::cout << " #data= " << fh->env_data_size();
+   *     if (fh->env_data_size() > 0)
+   *       std::cout << " data= " << fh->env_data_front();
+   *   }
+   *
+   *   if (fh->aux_is_set(0)) {
+   *     std::cout << " #data1= " << number_of_aux_data_objects(fh, 0);
+   *     if (number_of_aux_data_objects(fh, 0)>0)
+   *       std::cout << " data#1= " << aux_data(fh, 0);
+   *   }
+   *   if (fh->aux_is_set(1)) {
+   *     std::cout << " #data2= " << number_of_aux_data_objects(fh, 1);
+   *     if (number_of_aux_data_objects(fh, 1)>0)
+   *       std::cout << " data#2= " << aux_data(fh, 1);
+   *   }
+   *   std::cout << std::endl;
+   * }
+   *
+   * // print the aux data in the faces of md
+   * void print_faces(Minimization_diagram_2& md) {
+   *   Face_iterator fit = md.faces_begin();
+   *   for(; fit != md.faces_end(); ++fit) {
+   *     Face_handle fh = fit;
+   *     print_face(fh);
+   *   }
+   *   std::cout << std::endl;
+   * }
+   *
+   * void print_vertices(Minimization_diagram_2& md) {
+   *   Vertex_iterator vit = md.vertices_begin();
+   *   for(; vit != md.vertices_end(); ++vit) {
+   *     Vertex_handle vh = vit;
+   *     std::cout << vh->point();
+   *
+   *      if (vh->env_is_set()) {
+   *       std::cout << " #data= " << vh->env_data_size();
+   *       if (vh->env_data_size() > 0)
+   *         std::cout << " data= " << vh->env_data_front();
+   *     }
+   *
+   *     if (vh->aux_is_set(0)) {
+   *       std::cout << " #data1= " << number_of_aux_data_objects(vh, 0);
+   *       if (number_of_aux_data_objects(vh, 0)>0)
+   *         std::cout << " data#1= " << aux_data(vh, 0);
+   *     }
+   *     if (vh->aux_is_set(1)) {
+   *       std::cout << " #data2= " << number_of_aux_data_objects(vh, 1);
+   *       if (number_of_aux_data_objects(vh, 1)>0)
+   *         std::cout << " data#2= " << aux_data(vh, 1);
+   *     }
+   *     std::cout << std::endl;
+   *   }
+   *   std::cout << std::endl;
+   * }
+   *
+   * void print_edges(Minimization_diagram_2& md) {
+   *   Halfedge_iterator hit = md.halfedges_begin();
+   *   for(; hit != md.halfedges_end(); ++hit, ++hit) {
+   *     Halfedge_handle hh = hit;
+   *     std::cout << hh->curve();
+   *
+   *     if (hh->env_is_set()) {
+   *       std::cout << " #data= " << hh->env_data_size();
+   *       if (hh->env_data_size() > 0)
+   *         std::cout << " data= " << hh->env_data_front();
+   *     }
+   *
+   *     if (hh->aux_is_set(0)) {
+   *       std::cout << " #data1= " << number_of_aux_data_objects(hh, 0);
+   *       if (number_of_aux_data_objects(hh, 0)>0)
+   *         std::cout << " data#1= " << aux_data(hh, 0);
+   *     }
+   *     if (hh->aux_is_set(1)) {
+   *       std::cout << " #data2= " << number_of_aux_data_objects(hh, 1);
+   *
+   *       if (number_of_aux_data_objects(hh, 1)>0)
+   *         std::cout << " data#2= " << aux_data(hh, 1);
+   *     }
+   *     std::cout << std::endl;
+   *   }
+   *   std::cout << std::endl;
+   * }
+   */
 
   void post_test_assertions(Minimization_diagram_2& md) {
     // check that all data is filled in result
     for (auto fi = md.faces_begin(); fi != md.faces_end(); ++fi) {
       Face_handle fh = fi;
-      CGAL_assertion_msg(fh->get_aux_is_set(0),
+      CGAL_assertion_msg(fh->aux_is_set(0),
                          "data from md1 on face is not set");
-      CGAL_assertion_msg(fh->get_aux_is_set(1),
+      CGAL_assertion_msg(fh->aux_is_set(1),
                          "data from md2 on face is not set");
     }
 
     for (auto hi = md.halfedges_begin(); hi != md.halfedges_end(); ++hi) {
       Halfedge_handle hh = hi;
-      CGAL_assertion_msg(hh->get_aux_is_set(0),
+      CGAL_assertion_msg(hh->aux_is_set(0),
                          "data from md1 on halfedge is not set");
-      CGAL_assertion_msg(hh->get_aux_is_set(1),
+      CGAL_assertion_msg(hh->aux_is_set(1),
                          "data from md2 on halfedge is not set");
     }
 
     for (auto vi = md.vertices_begin(); vi != md.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
-      CGAL_assertion_msg(vh->get_aux_is_set(0),
+      CGAL_assertion_msg(vh->aux_is_set(0),
                          "data from md1 on vertex is not set");
-      CGAL_assertion_msg(vh->get_aux_is_set(1),
+      CGAL_assertion_msg(vh->aux_is_set(1),
                          "data from md2 on vertex is not set");
     }
   }
@@ -196,37 +178,37 @@ class Envelope_overlay_2 {
 protected:
   // helper methods
   template <typename FeatureHandle>
-  Xy_monotone_surface_3 get_aux_data(FeatureHandle fh, unsigned int id) {
-    const Object& o = fh->get_aux_source(id);
+  Xy_monotone_surface_3 aux_data(FeatureHandle fh, unsigned int id) {
+    const Object& o = fh->aux_source(id);
     Xy_monotone_surface_3 data;
 
     Halfedge_handle h;
     Vertex_handle v;
     Face_handle f;
-    if (assign(v, o)) data = v->get_env_data();
-    else if (assign(h, o)) data = h->get_env_data();
+    if (assign(v, o)) data = v->env_data_front();
+    else if (assign(h, o)) data = h->env_data_front();
     else {
       CGAL_assertion(assign(f, o));
       assign(f, o);
-      data = f->get_env_data();
+      data = f->env_data_front();
     }
     return data;
   }
 
   template <typename FeatureHandle>
-  int get_number_of_aux_data_objects(FeatureHandle fh, unsigned int id) {
-          const Object& o = fh->get_aux_source(id);
+  int number_of_aux_data_objects(FeatureHandle fh, unsigned int id) {
+    const Object& o = fh->aux_source(id);
     int data;
 
     Halfedge_handle h;
     Vertex_handle v;
     Face_handle f;
-    if (assign(v, o)) data = v->number_of_data_objects();
-    else if (assign(h, o)) data = h->number_of_data_objects();
+    if (assign(v, o)) data = v->env_data_size();
+    else if (assign(h, o)) data = h->env_data_size();
     else {
       CGAL_assertion(assign(f, o));
       assign(f, o);
-      data = f->number_of_data_objects();
+      data = f->env_data_size();
     }
     return data;
   }
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h
index 82ecf38b0954..6b7c6cba6747 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_functor.h
@@ -92,10 +92,10 @@ class Envelope_overlay_functor {
     //res_v->set_is_intersection(false);
 
     if (v1->is_isolated() && v2->is_isolated()) {
-      res_v->set_is_equal_aux_data_in_face(0, v1->get_is_equal_data_in_face());
-      res_v->set_is_equal_aux_data_in_face(1, v2->get_is_equal_data_in_face());
-      res_v->set_has_equal_aux_data_in_face(0, v1->get_has_equal_data_in_face());
-      res_v->set_has_equal_aux_data_in_face(1, v2->get_has_equal_data_in_face());
+      res_v->set_is_equal_aux_data_in_face(0, v1->is_equal_env_data_in_face());
+      res_v->set_is_equal_aux_data_in_face(1, v2->is_equal_env_data_in_face());
+      res_v->set_has_equal_aux_data_in_face(0, v1->has_equal_env_data_in_face());
+      res_v->set_has_equal_aux_data_in_face(1, v2->has_equal_env_data_in_face());
     }
   }
 
@@ -125,9 +125,9 @@ class Envelope_overlay_functor {
       // the res_v is also isolated, and we should update the is_equal/has_equal
       // data in face information
       res_v->set_is_equal_aux_data_in_face(0, true);
-      res_v->set_is_equal_aux_data_in_face(1, v2->get_is_equal_data_in_face());
-      res_v->set_has_equal_aux_data_in_face(0, !f1->has_no_data());
-      res_v->set_has_equal_aux_data_in_face(1, v2->get_has_equal_data_in_face());
+      res_v->set_is_equal_aux_data_in_face(1, v2->is_equal_env_data_in_face());
+      res_v->set_has_equal_aux_data_in_face(0, ! f1->has_no_env_data());
+      res_v->set_has_equal_aux_data_in_face(1, v2->has_equal_env_data_in_face());
     }
   }
 
@@ -140,10 +140,10 @@ class Envelope_overlay_functor {
     if (v1->is_isolated()) {
       // the res_v is also isolated, and we should update the is_equal/has_equal
       // data in face information
-      res_v->set_is_equal_aux_data_in_face(0, v1->get_is_equal_data_in_face());
+      res_v->set_is_equal_aux_data_in_face(0, v1->is_equal_env_data_in_face());
       res_v->set_is_equal_aux_data_in_face(1, true);
-      res_v->set_has_equal_aux_data_in_face(0, v1->get_has_equal_data_in_face());
-      res_v->set_has_equal_aux_data_in_face(1, !f2->has_no_data());
+      res_v->set_has_equal_aux_data_in_face(0, v1->has_equal_env_data_in_face());
+      res_v->set_has_equal_aux_data_in_face(1, ! f2->has_no_env_data());
     }
   }
 
@@ -157,19 +157,19 @@ class Envelope_overlay_functor {
     res_h->twin()->set_aux_source(1, m_2.non_const_handle(h2->twin()));
 
     // update is_equal/has_equal data in face
-    res_h->set_is_equal_aux_data_in_face(0, h1->get_is_equal_data_in_face());
-    res_h->set_is_equal_aux_data_in_face(1, h2->get_is_equal_data_in_face());
-    res_h->set_has_equal_aux_data_in_face(0, h1->get_has_equal_data_in_face());
-    res_h->set_has_equal_aux_data_in_face(1, h2->get_has_equal_data_in_face());
+    res_h->set_is_equal_aux_data_in_face(0, h1->is_equal_env_data_in_face());
+    res_h->set_is_equal_aux_data_in_face(1, h2->is_equal_env_data_in_face());
+    res_h->set_has_equal_aux_data_in_face(0, h1->has_equal_env_data_in_face());
+    res_h->set_has_equal_aux_data_in_face(1, h2->has_equal_env_data_in_face());
 
     res_h->twin()->set_is_equal_aux_data_in_face(0, h1->twin()->
-                                                 get_is_equal_data_in_face());
+                                                 is_equal_env_data_in_face());
     res_h->twin()->set_is_equal_aux_data_in_face(1, h2->twin()->
-                                                 get_is_equal_data_in_face());
+                                                 is_equal_env_data_in_face());
     res_h->twin()->set_has_equal_aux_data_in_face(0, h1->twin()->
-                                                  get_has_equal_data_in_face());
+                                                  has_equal_env_data_in_face());
     res_h->twin()->set_has_equal_aux_data_in_face(1, h2->twin()->
-                                                  get_has_equal_data_in_face());
+                                                  has_equal_env_data_in_face());
 
     // update is_equal/has_equal data in target
     update_halfedge_flags_on_edge(res_h, m_1.non_const_handle(h1), 0);
@@ -197,17 +197,17 @@ class Envelope_overlay_functor {
     res_h->twin()->set_aux_source(1, m_2.non_const_handle(f2));
 
     // update is_equal/has_equal data in face
-    res_h->set_is_equal_aux_data_in_face(0, h1->get_is_equal_data_in_face());
+    res_h->set_is_equal_aux_data_in_face(0, h1->is_equal_env_data_in_face());
     res_h->set_is_equal_aux_data_in_face(1, true);
-    res_h->set_has_equal_aux_data_in_face(0, h1->get_has_equal_data_in_face());
-    res_h->set_has_equal_aux_data_in_face(1, !f2->has_no_data());
+    res_h->set_has_equal_aux_data_in_face(0, h1->has_equal_env_data_in_face());
+    res_h->set_has_equal_aux_data_in_face(1, ! f2->has_no_env_data());
 
     res_h->twin()->set_is_equal_aux_data_in_face(0, h1->twin()->
-                                                 get_is_equal_data_in_face());
+                                                 is_equal_env_data_in_face());
     res_h->twin()->set_is_equal_aux_data_in_face(1, true);
     res_h->twin()->set_has_equal_aux_data_in_face(0, h1->twin()->
-                                                  get_has_equal_data_in_face());
-    res_h->twin()->set_has_equal_aux_data_in_face(1, !f2->has_no_data());
+                                                  has_equal_env_data_in_face());
+    res_h->twin()->set_has_equal_aux_data_in_face(1, ! f2->has_no_env_data());
 
     // update is_equal/has_equal data in target for the first source map
     update_halfedge_flags_on_edge(res_h, m_1.non_const_handle(h1), 0);
@@ -234,14 +234,16 @@ class Envelope_overlay_functor {
 
     // update halfedge-face flags of the new halfedge
     res_h->set_is_equal_aux_data_in_face(0, true);
-    res_h->set_is_equal_aux_data_in_face(1, h2->get_is_equal_data_in_face());
-    res_h->set_has_equal_aux_data_in_face(0, !f1->has_no_data());
-    res_h->set_has_equal_aux_data_in_face(1, h2->get_has_equal_data_in_face());
+    res_h->set_is_equal_aux_data_in_face(1, h2->is_equal_env_data_in_face());
+    res_h->set_has_equal_aux_data_in_face(0, ! f1->has_no_env_data());
+    res_h->set_has_equal_aux_data_in_face(1, h2->has_equal_env_data_in_face());
 
     res_h->twin()->set_is_equal_aux_data_in_face(0, true);
-    res_h->twin()->set_is_equal_aux_data_in_face(1, h2->twin()->get_is_equal_data_in_face());
-    res_h->twin()->set_has_equal_aux_data_in_face(0, !f1->has_no_data());
-    res_h->twin()->set_has_equal_aux_data_in_face(1, h2->twin()->get_has_equal_data_in_face());
+    res_h->twin()->set_is_equal_aux_data_in_face
+      (1, h2->twin()->is_equal_env_data_in_face());
+    res_h->twin()->set_has_equal_aux_data_in_face(0, ! f1->has_no_env_data());
+    res_h->twin()->set_has_equal_aux_data_in_face
+      (1, h2->twin()->has_equal_env_data_in_face());
 
     // update is_equal/has_equal data in target for the second source map
     update_halfedge_flags_on_edge(res_h, m_2.non_const_handle(h2), 1);
@@ -261,8 +263,9 @@ class Envelope_overlay_functor {
   template <typename Halfedge_handle_t>
   void copy_halfedge_target_info(Halfedge_handle_t from,
                                  Res_halfedge_handle to, unsigned int id) {
-    to->set_is_equal_aux_data_in_target(id, from->get_is_equal_data_in_target());
-    to->set_has_equal_aux_data_in_target(id, from->get_has_equal_data_in_target());
+    to->set_is_equal_aux_data_in_target(id, from->is_equal_env_data_in_target());
+    to->set_has_equal_aux_data_in_target
+      (id, from->has_equal_env_data_in_target());
   }
   void set_halfedge_target_info(Res_halfedge_handle to, unsigned int id,
                                 bool info) {
@@ -274,16 +277,17 @@ class Envelope_overlay_functor {
   void copy_halfedge_target_info_from_halfedge_face_info(Halfedge_handle_t from,
                                                          Res_halfedge_handle to,
                                                          unsigned int id) {
-    to->set_is_equal_aux_data_in_target(id, from->get_is_equal_data_in_face());
-    to->set_has_equal_aux_data_in_target(id, from->get_has_equal_data_in_face());
-    to->set_has_equal_aux_data_in_target_and_face(id, from->get_has_equal_data_in_face());
+    to->set_is_equal_aux_data_in_target(id, from->is_equal_env_data_in_face());
+    to->set_has_equal_aux_data_in_target(id, from->has_equal_env_data_in_face());
+    to->set_has_equal_aux_data_in_target_and_face
+      (id, from->has_equal_env_data_in_face());
   }
   template <typename Vertex_handle_t>
   void copy_halfedge_target_info_from_vertex_face_info(Vertex_handle_t from,
                                                        Res_halfedge_handle to,
                                                        unsigned int id) {
-    to->set_is_equal_aux_data_in_target(id, from->get_is_equal_data_in_face());
-    to->set_has_equal_aux_data_in_target(id, from->get_has_equal_data_in_face());
+    to->set_is_equal_aux_data_in_target(id, from->is_equal_env_data_in_face());
+    to->set_has_equal_aux_data_in_target(id, from->has_equal_env_data_in_face());
   }
 
   // find a halfedge that v is its target and f is its face
@@ -309,8 +313,7 @@ class Envelope_overlay_functor {
         traversed_vertices[Vertex_face_pair(v, hh->face())] = hh;
         // check for reult
         if (hh->face() == f) result = hh;
-        ++vc;
-      } while (vc != vc_begin);
+      } while (++vc != vc_begin);
     }
     else {
       // take it from the map
@@ -329,21 +332,21 @@ class Envelope_overlay_functor {
     if(new_h->target()->is_at_open_boundary()) return;
     Vertex_handle vh;
     Halfedge_handle hh;
-    const Object& trg_src = new_h->target()->get_aux_source(id);
+    const Object& trg_src = new_h->target()->aux_source(id);
     if (assign(vh, trg_src)) {
-          // vh is the target of on_edge, and we can copy the halfedge-target information
-      // from on_edge
+      // vh is the target of on_edge, and we can copy the halfedge-target
+      // information from on_edge
       copy_halfedge_target_info(on_edge, new_h, id);
             new_h->set_has_equal_aux_data_in_target_and_face
-              (id, on_edge->get_has_equal_data_in_target_and_face());
+              (id, on_edge->has_equal_env_data_in_target_and_face());
     }
     else if (assign(hh, trg_src)) {
       // hh is the "HEMSHECH" of on_edge, so we need to set halfedge_target
       // information to true
       set_halfedge_target_info(new_h, id, true);
-            // and target-face information using the original halfedge-face information
+      // and target-face information using the original halfedge-face information
       new_h->set_has_equal_aux_data_in_target_and_face
-        (id, on_edge->get_has_equal_data_in_face());
+        (id, on_edge->has_equal_env_data_in_face());
     }
     else
       // this cannot happen, since we need to touch an edge
@@ -361,34 +364,38 @@ class Envelope_overlay_functor {
     Halfedge_handle hh;
     Face_handle fh;
     // update target
-    const Object& trg_src = new_h->target()->get_aux_source(id);
+    const Object& trg_src = new_h->target()->aux_source(id);
     if (assign(vh, trg_src)) {
       if (vh->is_isolated()) {
         copy_halfedge_target_info_from_vertex_face_info(vh, new_h, id);
         // the target-face information is taken from vertex-face information too
         new_h->set_has_equal_aux_data_in_target_and_face
-                                     (id, vh->get_has_equal_data_in_face());
+                                     (id, vh->has_equal_env_data_in_face());
       }
       else {
+
         // we have a vertex vh on the boundary of the face in_face
         // todo: get rid of this calculations: (using unknown value for
         // has_equal flag)
-        /*CGAL_assertion_code(
-          bool calc_is_equal = vh->is_equal_data(in_face->begin_data(), in_face->end_data());
-        )*/
-        //bool calc_has_equal = vh->has_equal_data(in_face->begin_data(), in_face->end_data());
+        // CGAL_assertion_code(
+        //  bool calc_is_equal = vh->is_equal_env_data(in_face->begin_env_data(),
+        //                                         in_face->end_env_data());
+        // )
+        //
+        // bool calc_has_equal = vh->has_equal_env_data(in_face->begin_env_data(),
+        //                                          in_face->end_env_data());
 
         // find the halfedge with target vh on the boundary of in_face
         Halfedge_handle h_of_vh_and_in_face =
           find_halfedge_by_vertex_and_face(vh, in_face);
         // is_equal relationship is easy:
-        bool is_equal = h_of_vh_and_in_face->get_is_equal_data_in_face() &&
-                        h_of_vh_and_in_face->get_is_equal_data_in_target();
+        bool is_equal = h_of_vh_and_in_face->is_equal_env_data_in_face() &&
+                        h_of_vh_and_in_face->is_equal_env_data_in_target();
         //CGAL_assertion(is_equal == calc_is_equal);
 
         // has_equal relationship is problematic in one case:
         bool has_equal =
-          h_of_vh_and_in_face->get_has_equal_data_in_target_and_face();
+          h_of_vh_and_in_face->has_equal_env_data_in_target_and_face();
 
         /*CGAL_assertion(has_equal == calc_has_equal);
         if(has_equal != calc_has_equal)
@@ -419,8 +426,8 @@ class Envelope_overlay_functor {
       // the face data
       CGAL_assertion(fh == in_face);
       new_h->set_is_equal_aux_data_in_target(id, true);
-      new_h->set_has_equal_aux_data_in_target(id, !fh->has_no_data());
-      new_h->set_has_equal_aux_data_in_target_and_face(id, !fh->has_no_data());
+      new_h->set_has_equal_aux_data_in_target(id, ! fh->has_no_env_data());
+      new_h->set_has_equal_aux_data_in_target_and_face(id, ! fh->has_no_env_data());
     }
   }
 
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
index 999cdadc140d..a7ecfc45f461 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
@@ -36,7 +36,7 @@ class Dcel_info {
 
 protected:
   /*! data container */
-  Data_container m_data;
+  Data_container m_env_data;
 
   /*! Indicates that the data (surfaces) have been set already */
   bool m_is_set;
@@ -48,14 +48,14 @@ class Dcel_info {
   Dcel_info() : m_is_set(false), m_decision(DAC_DECISION_NOT_SET) {}
 
   /*! \brief returns true iff data has been set already */
-  bool get_is_set() const { return m_is_set; }
+  bool env_is_set() const { return m_is_set; }
 
   /*! \brief resets the flag  */
   void set_is_set(bool flag) { m_is_set = flag; }
 
   bool is_decision_set() { return (m_decision != DAC_DECISION_NOT_SET); }
 
-  Dac_decision get_decision() const { return m_decision; }
+  Dac_decision decision() const { return m_decision; }
 
   void set_decision(Comparison_result comp)
   { m_decision = enum_cast<Dac_decision>(comp); }
@@ -63,55 +63,56 @@ class Dcel_info {
   void set_decision(Dac_decision dec) { m_decision = dec; }
 
   /*! User-friendly interface: */
-  size_t number_of_surfaces() const { return m_data.size(); }
+  size_t number_of_surfaces() const { return m_env_data.size(); }
 
-  Data_const_iterator surfaces_begin() const { return m_data.begin(); }
+  Data_const_iterator surfaces_begin() const { return m_env_data.begin(); }
 
-  Data_const_iterator surfaces_end() const { return m_data.end(); }
+  Data_const_iterator surfaces_end() const { return m_env_data.end(); }
 
    /*! Obtain the first Xy-monotone surface associated with the face.
     * \pre number_of_surfaces() is not 0.
     */
   const Data& surface() const {
-    CGAL_precondition(m_data.size() > 0);
-    return m_data.front();
+    CGAL_precondition(m_env_data.size() > 0);
+    return m_env_data.front();
   }
 
-  /*! Obtain the number of data objects associated with the face.
+  /*! Obtain the number of data objects associated with the cell.
    */
-  int number_of_data_objects() const { return static_cast<int>(m_data.size()); }
+  int env_data_size() const
+  { return static_cast<int>(m_env_data.size()); }
 
   /*! Check whether the data is set to be empty
    */
-  bool has_no_data() const
-  { return (m_is_set && (number_of_data_objects() == 0)); }
+  bool has_no_env_data() const
+  { return (m_is_set && (env_data_size() == 0)); }
 
-  /*! Obtain the first data object associated with the face.
-   * \pre number_of_data_objects() is not 0.
+  /*! Obtain the first data object associated with the cell.
+   * \pre m_env_data.size() is not 0.
    */
-  const Data& get_env_data() const {
-    CGAL_precondition(m_data.size() > 0);
-    return m_data.front();
+  const Data& env_data_front() const {
+    CGAL_precondition(m_env_data.size() > 0);
+    return m_env_data.front();
   }
 
   /*! Obtain the data iterators (const version).
    */
-  Data_const_iterator begin_data() const { return m_data.begin(); }
+  Data_const_iterator begin_env_data() const { return m_env_data.begin(); }
 
-  Data_const_iterator end_data() const { return m_data.end(); }
+  Data_const_iterator end_env_data() const { return m_env_data.end(); }
 
   /*! Obtain the data iterators (non-const version).
    */
-  Data_iterator begin_data() { return m_data.begin(); }
+  Data_iterator begin_env_data() { return m_env_data.begin(); }
 
-  Data_iterator end_data() { return m_data.end(); }
+  Data_iterator end_env_data() { return m_env_data.end(); }
 
   /*! Set a data object to the face.
    * \param data The data object to set.
    */
   void set_env_data(const Data& data) {
-    clear_data();
-    add_data(data);
+    clear_env_data();
+    add_env_data(data);
   }
 
   /*! Set a range of data objects to the face.
@@ -120,22 +121,22 @@ class Dcel_info {
    */
   template <typename InputIterator>
   void set_env_data(InputIterator begin, InputIterator end) {
-    clear_data();
-    add_data(begin, end);
+    clear_env_data();
+    add_env_data(begin, end);
   }
 
   /*! set the data to be empty.
    */
-  void set_no_data() {
-    clear_data();
+  void set_no_env_data() {
+    clear_env_data();
     m_is_set = true;
   }
 
    /*! Add a data object to the face.
    * \param data The additional data object.
    */
-  void add_data(const Data& data) {
-    m_data.push_back(data);
+  void add_env_data(const Data& data) {
+    m_env_data.push_back(data);
     m_is_set = true;
   }
 
@@ -144,15 +145,15 @@ class Dcel_info {
    * \param end A past-the-end iterator for the data range.
    */
   template <typename InputIterator>
-  void add_data(InputIterator begin, InputIterator end) {
-    for (auto it = begin; it != end; it++) m_data.push_back(*it);
+  void add_env_data(InputIterator begin, InputIterator end) {
+    for (auto it = begin; it != end; ++it) m_env_data.push_back(*it);
     m_is_set = true;
   }
 
   /*! Clear the data objects.
    */
-  void clear_data() {
-    m_data.clear();
+  void clear_env_data() {
+    m_env_data.clear();
     m_is_set = false;
   }
 
@@ -160,23 +161,23 @@ class Dcel_info {
    * set of data objects
    */
   template <typename InputIterator>
-  bool is_equal_data(InputIterator begin, InputIterator end) const {
-    if (! get_is_set()) return false;
+  bool is_equal_env_data(InputIterator begin, InputIterator end) const {
+    if (! env_is_set()) return false;
 
     // insert the input data objects into a set
     std::set<Data> input_data(begin, end);
-    std::set<Data> my_data(begin_data(), end_data());
+    std::set<Data> my_data(begin_env_data(), end_env_data());
     if (input_data.size() != my_data.size()) return false;
     return (my_data == input_data);
   }
 
   template <typename InputIterator>
-  bool has_equal_data(InputIterator begin, InputIterator end) const {
-    if (! get_is_set()) return false;
+  bool has_equal_env_data(InputIterator begin, InputIterator end) const {
+    if (! env_is_set()) return false;
 
     // insert the input data objects into a set
     std::set<Data> input_data(begin, end);
-    std::set<Data> my_data(begin_data(), end_data());
+    std::set<Data> my_data(begin_env_data(), end_env_data());
     std::list<Data> intersection;
     std::set_intersection(my_data.begin(), my_data.end(),
                           input_data.begin(), input_data.end(),
@@ -185,7 +186,6 @@ class Dcel_info {
   }
 
 protected:
-
   /*! Place holder for the source of the overlay data */
   Object m_aux_source[2];
 
@@ -202,14 +202,14 @@ class Dcel_info {
     m_aux_source[id] = o;
   }
 
-  const Object& get_aux_source(unsigned int id) {
+  const Object& aux_source(unsigned int id) {
     CGAL_precondition(id < 2);
     CGAL_precondition (!m_aux_source[id].is_empty());
     return m_aux_source[id];
   }
 
   /*! \brief returns true iff the point has been set already */
-  bool get_aux_is_set(unsigned int id) const {
+  bool aux_is_set(unsigned int id) const {
     CGAL_precondition(id < 2);
     return (! m_aux_source[id].is_empty());
   }
@@ -251,35 +251,25 @@ class Envelope_pm_vertex : public BaseVertex, public Dcel_info<VertexData> {
   /*! Constructor */
   Envelope_pm_vertex() : Dcel_info<Vertex_data>(), flags(0) {}
 
-  /*void set_is_fake(bool b)
-  {
-    set_bit(IS_FAKE, b);
-  }
-  bool get_is_fake() const
-  {
-    return get_bit(IS_FAKE);
-  }*/
+  /* void set_is_fake(bool b) { set_bit(IS_FAKE, b); }
+   * bool is_fake() const { return get_bit(IS_FAKE); }
+   */
 
- /* void set_is_intersection(bool b)
-  {
-    set_bit(IS_INTERSECTION, b);
-  }*/
-  /*bool get_is_intersection() const
-  {
-    return get_bit(IS_FAKE);
-  }*/
+  /* void set_is_intersection(bool b) { set_bit(IS_INTERSECTION, b); }
+   * bool is_intersection() const { return get_bit(IS_FAKE); }
+   */
 
-  void set_is_equal_data_in_face(bool b) { set_bit(IS_EQUAL, b); }
-  bool get_is_equal_data_in_face() const { return get_bit(IS_EQUAL); }
+  void set_is_equal_env_data_in_face(bool b) { set_bit(IS_EQUAL, b); }
+  bool is_equal_env_data_in_face() const { return get_bit(IS_EQUAL); }
 
-  void set_has_equal_data_in_face(bool b) { set_bit(HAS_EQUAL, b); }
-  bool get_has_equal_data_in_face() const { return get_bit(HAS_EQUAL); }
+  void set_has_equal_env_data_in_face(bool b) { set_bit(HAS_EQUAL, b); }
+  bool has_equal_env_data_in_face() const { return get_bit(HAS_EQUAL); }
 
   void set_is_equal_aux_data_in_face(unsigned int id, bool b) {
     CGAL_assertion(id < 2);
     set_bit(IS_EQUAL_AUX+id, b);
   }
-  bool get_is_equal_aux_data_in_face(unsigned int id) const {
+  bool is_equal_aux_data_in_face(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(IS_EQUAL_AUX+id);
   }
@@ -288,7 +278,7 @@ class Envelope_pm_vertex : public BaseVertex, public Dcel_info<VertexData> {
     CGAL_assertion(id < 2);
     set_bit(HAS_EQUAL_AUX+id, b);
   }
-  bool get_has_equal_aux_data_in_face(unsigned int id) const {
+  bool has_equal_aux_data_in_face(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(HAS_EQUAL_AUX+id);
   }
@@ -359,26 +349,21 @@ class Envelope_pm_halfedge : public BaseHalfedge,
 
   Envelope_pm_halfedge() : Dcel_info<Halfedge_data>(), flags(0) {}
 
- /* void set_is_fake(bool b)
-  {
-    set_bit(IS_FAKE, b);
-  }
-  bool get_is_fake() const
-  {
-    return get_bit(IS_FAKE);
-  }*/
+ /* void set_is_fake(bool b) { set_bit(IS_FAKE, b); }
+  * bool is_fake() const { return get_bit(IS_FAKE); }
+  */
 
-  void set_is_equal_data_in_face(bool b) { set_bit(IS_EQUAL_FACE, b); }
-  bool get_is_equal_data_in_face() const { return get_bit(IS_EQUAL_FACE); }
+  void set_is_equal_env_data_in_face(bool b) { set_bit(IS_EQUAL_FACE, b); }
+  bool is_equal_env_data_in_face() const { return get_bit(IS_EQUAL_FACE); }
 
-  void set_has_equal_data_in_face(bool b) { set_bit(HAS_EQUAL_FACE, b); }
-  bool get_has_equal_data_in_face() const { return get_bit(HAS_EQUAL_FACE); }
+  void set_has_equal_env_data_in_face(bool b) { set_bit(HAS_EQUAL_FACE, b); }
+  bool has_equal_env_data_in_face() const { return get_bit(HAS_EQUAL_FACE); }
 
   void set_is_equal_aux_data_in_face(unsigned int id, bool b) {
     CGAL_assertion(id < 2);
     set_bit(IS_EQUAL_AUX_FACE+id, b);
   }
-  bool get_is_equal_aux_data_in_face(unsigned int id) const {
+  bool is_equal_aux_data_in_face(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(IS_EQUAL_AUX_FACE+id);
   }
@@ -387,22 +372,22 @@ class Envelope_pm_halfedge : public BaseHalfedge,
     CGAL_assertion(id < 2);
     set_bit(HAS_EQUAL_AUX_FACE+id, b);
   }
-  bool get_has_equal_aux_data_in_face(unsigned int id) const {
+  bool has_equal_aux_data_in_face(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(HAS_EQUAL_AUX_FACE+id);
   }
 
-  void set_is_equal_data_in_target(bool b) { set_bit(IS_EQUAL_TARGET, b); }
-  bool get_is_equal_data_in_target() const { return get_bit(IS_EQUAL_TARGET); }
+  void set_is_equal_env_data_in_target(bool b) { set_bit(IS_EQUAL_TARGET, b); }
+  bool is_equal_env_data_in_target() const { return get_bit(IS_EQUAL_TARGET); }
 
-  void set_has_equal_data_in_target(bool b) { set_bit(HAS_EQUAL_TARGET, b); }
-  bool get_has_equal_data_in_target() const { return get_bit(HAS_EQUAL_TARGET); }
+  void set_has_equal_env_data_in_target(bool b) { set_bit(HAS_EQUAL_TARGET, b); }
+  bool has_equal_env_data_in_target() const { return get_bit(HAS_EQUAL_TARGET); }
 
   void set_is_equal_aux_data_in_target(unsigned int id, bool b) {
     CGAL_assertion(id < 2);
     set_bit(IS_EQUAL_AUX_TARGET+id, b);
   }
-  bool get_is_equal_aux_data_in_target(unsigned int id) const {
+  bool is_equal_aux_data_in_target(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(IS_EQUAL_AUX_TARGET+id);
   }
@@ -411,21 +396,21 @@ class Envelope_pm_halfedge : public BaseHalfedge,
     CGAL_assertion(id < 2);
     set_bit(HAS_EQUAL_AUX_TARGET+id, b);
   }
-  bool get_has_equal_aux_data_in_target(unsigned int id) const {
+  bool has_equal_aux_data_in_target(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(HAS_EQUAL_AUX_TARGET+id);
   }
   // access to flags that contain relation between target and face
-  void set_has_equal_data_in_target_and_face(bool b)
+  void set_has_equal_env_data_in_target_and_face(bool b)
   { set_bit(HAS_EQUAL_F_T, b); }
-  bool get_has_equal_data_in_target_and_face() const
+  bool has_equal_env_data_in_target_and_face() const
   { return get_bit(HAS_EQUAL_F_T); }
 
   void set_has_equal_aux_data_in_target_and_face(unsigned int id, bool b) {
     CGAL_assertion(id < 2);
     set_bit(HAS_EQUAL_AUX_F_T+id, b);
   }
-  bool get_has_equal_aux_data_in_target_and_face(unsigned int id) const {
+  bool has_equal_aux_data_in_target_and_face(unsigned int id) const {
     CGAL_assertion(id < 2);
     return get_bit(HAS_EQUAL_AUX_F_T+id);
   }
diff --git a/Envelope_3/test/Envelope_3/Envelope_test_3.h b/Envelope_3/test/Envelope_3/Envelope_test_3.h
index 37c70646365d..cce5cc4656a3 100644
--- a/Envelope_3/test/Envelope_3/Envelope_test_3.h
+++ b/Envelope_3/test/Envelope_3/Envelope_test_3.h
@@ -124,34 +124,37 @@ class Envelope_test_3 {
         Xy_monotone_surface_3& prev_surface = surfaces[j];
 
         std::vector<std::variant<Intersection_curve,Point_2>> inter_objs;
-        traits.construct_projected_intersections_2_object()(cur_surface, prev_surface, std::back_inserter(inter_objs));
+        traits.construct_projected_intersections_2_object()
+          (cur_surface, prev_surface, std::back_inserter(inter_objs));
 
         // we collect all intersections and use sweep to insert them
         for (std::size_t k = 0; k < inter_objs.size(); ++k) {
           if (const Point_2* point = std::get_if<Point_2>(&inter_objs[k])) {
-            #ifdef CGAL_DEBUG_ENVELOPE_TEST_3
-              std::cout << "intersection between surfaces is a point: "
-                        << point << std::endl;
-            #endif
+#ifdef CGAL_DEBUG_ENVELOPE_TEST_3
+            std::cout << "intersection between surfaces is a point: "
+                      << point << std::endl;
+#endif
             //insert_vertex(result, point, pl);
             points_col.push_back(*point);
           }
           else if (const auto* curve =
                    std::get_if<Intersection_curve>(&inter_objs[k])) {
             curves_col.push_back(curve->first);
-            /*#ifdef CGAL_DEBUG_ENVELOPE_TEST_3
-              std::cout << "intersection between surfaces is a curve: " << curve.first << std::endl;
-            #endif
-            std::list<Object> objs;
-            traits.make_x_monotone_2_object()(curve.first, std::back_inserter(objs));
-            std::list<Object>::iterator itr;
-            for(itr = objs.begin(); itr != objs.end(); ++itr)
-            {
-              X_monotone_curve_2 curr_cv;
-              assert(assign(curr_cv, *itr));
-              assign(curr_cv, *itr);
-              curves_col.push_back(curr_cv);
-            }*/
+            /* #ifdef CGAL_DEBUG_ENVELOPE_TEST_3
+             * std::cout << "intersection between surfaces is a curve: "
+             *           << curve.first << std::endl;
+             * #endif
+             * std::list<Object> objs;
+             * traits.make_x_monotone_2_object()(curve.first,
+             *                                   std::back_inserter(objs));
+             * std::list<Object>::iterator itr;
+             * for(itr = objs.begin(); itr != objs.end(); ++itr) {
+             *   X_monotone_curve_2 curr_cv;
+             *   assert(assign(curr_cv, *itr));
+             *   assign(curr_cv, *itr);
+             *   curves_col.push_back(curr_cv);
+             * }
+             */
             //insert(result, curve.first, pl);
           }
           else assert_msg(false, "wrong intersection type");
@@ -167,7 +170,8 @@ class Envelope_test_3 {
 
     m_result = &result;
 
-    // now, foreach vertex, edge and face, we should determine which surfaces are minimal over it.
+    // now, foreach vertex, edge and face, we should determine which surfaces
+    // are minimal over it.
 
     // update vertices' data
     for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
@@ -242,16 +246,16 @@ class Envelope_test_3 {
   template <typename SurfaceIterator>
   void set_minimum_over_vertex(const Vertex_handle& v,
                                SurfaceIterator begin, SurfaceIterator end) {
-    if (begin == end) v->set_no_data();
+    if (begin == end) v->set_no_env_data();
     else {
       auto si = begin;
       // we set the first surface as the minimum, and then compare all the others
       v->set_env_data(*si);
       ++si;
       for (; si != end; ++si) {
-        Comparison_result cr =
-          traits.compare_z_at_xy_3_object()(v->point(), v->get_env_data(), *si);
-        if (cr == EQUAL) v->add_data(*si);
+        auto cr = traits.compare_z_at_xy_3_object()(v->point(),
+                                                    v->env_data_front(), *si);
+        if (cr == EQUAL) v->add_env_data(*si);
         // this erases all surfaces from vertex's list
         else if (cr == LARGER) v->set_env_data(*si);
         // else - new surface has no affect on the envelope
@@ -264,7 +268,7 @@ class Envelope_test_3 {
   template <typename SurfaceIterator>
   void set_minimum_over_edge(const Halfedge_handle& h, SurfaceIterator begin,
                              SurfaceIterator end) {
-    if (begin == end) h->set_no_data();
+    if (begin == end) h->set_no_env_data();
     else {
       if (h != current_edge) compute_point_in_current_edge(h);
 
@@ -273,16 +277,15 @@ class Envelope_test_3 {
       h->set_env_data(*si);
       ++si;
       for (; si != end; ++si) {
-        Comparison_result cr =
-          traits.compare_z_at_xy_3_object()(current_point_inside_edge,
-                                            h->get_env_data(), *si);
-        if (cr == EQUAL) h->add_data(*si);
+        auto cr = traits.compare_z_at_xy_3_object()(current_point_inside_edge,
+                                                    h->env_data_front(), *si);
+        if (cr == EQUAL) h->add_env_data(*si);
         // this erases all surfaces from halfedge's list
         else if (cr == LARGER) h->set_env_data(*si);
         // else - new surface has no affect on the envelope
       }
       // set twin's data
-      h->twin()->set_env_data(h->begin_data(), h->end_data());
+      h->twin()->set_env_data(h->begin_env_data(), h->end_env_data());
     }
   }
 
@@ -295,7 +298,7 @@ class Envelope_test_3 {
     if (face->is_unbounded() || begin == end) {
       // a special case - no surface over the unbounded face, and when there
       // are no surfaces at all
-      face->set_no_data();
+      face->set_no_env_data();
     }
     else {
       auto si = begin;
@@ -303,9 +306,8 @@ class Envelope_test_3 {
       face->set_env_data(*si);
       ++si;
       for (; si != end; ++si) {
-        Comparison_result cr =
-          compare_surfaces_over_face(face, face->get_env_data(), *si);
-        if (cr == EQUAL) face->add_data(*si);
+        auto cr = compare_surfaces_over_face(face, face->env_data_front(), *si);
+        if (cr == EQUAL) face->add_env_data(*si);
         // this erases all surfaces from face's list
         else if (cr == LARGER) face->set_env_data(*si);
         // else - new surface has no affect on the envelope
@@ -329,7 +331,8 @@ class Envelope_test_3 {
     cur_res = traits.compare_z_at_xy_3_object()(current_point,surf1,surf2);
 
     #ifdef CGAL_DEBUG_ENVELOPE_TEST_3
-      std::cout << "for comparison inside face, current result = " << cur_res << std::endl;
+    std::cout << "for comparison inside face, current result = " << cur_res
+              << std::endl;
     #endif
 
     return cur_res;
@@ -366,7 +369,7 @@ class Envelope_test_3 {
     assert(! face->is_unbounded());
 
     #ifdef CGAL_DEBUG_ENVELOPE_TEST_3
-      std::cout << "in compute point inside face" << std::endl;
+    std::cout << "in compute point inside face" << std::endl;
     #endif
 
     // 1. find an edge on the outer ccb of the face that is not vertical
@@ -374,12 +377,12 @@ class Envelope_test_3 {
     Ccb_halfedge_circulator hec_begin = hec;
     bool found = false;
     do {
-      if (!traits.is_vertical_2_object()(hec->curve())) {
+      if (! traits.is_vertical_2_object()(hec->curve())) {
         found = true;
         continue;
       }
-      hec++;
-    } while(hec != hec_begin && !found);
+      ++hec;
+    } while ((hec != hec_begin) && ! found);
     assert(found);
 
     Halfedge_handle found_hh = hec;
@@ -388,10 +391,10 @@ class Envelope_test_3 {
     //    (we use the middle of the curve)
     Point_2 shoot_source = traits.construct_middle_point(found_hh->curve());
 
-    // 3. ray shoot up or down, into the face
-    //    and find the intersection point of the ray. the segment between
-    //    the point from which we shoot, and the intersection point lies
-    //    inside the face. we take its middle point as a point inside the face
+    // 3. ray shoot up or down, into the face and find the intersection point
+    //    of the ray. the segment between the point from which we shoot,
+    //    and the intersection point lies inside the face.
+    //    we take its middle point as a point inside the face
     bool shoot_up = true;
 // TODO_NEW_DESIGN - check this
 //    if (traits.compare_x(found_hh->source()->point(), found_hh->target()->point()) == LARGER)
@@ -418,20 +421,19 @@ class Envelope_test_3 {
 
     Point_2 res_point = traits.construct_middle_point(shoot_source, shoot_target);
 
-    #ifdef CGAL_DEBUG_ENVELOPE_TEST_3
-      std::cout << "finished computing point in face" << std::endl;
+#ifdef CGAL_DEBUG_ENVELOPE_TEST_3
+    std::cout << "finished computing point in face" << std::endl;
 
-      // just for checking, locate res_point in env to find face
-      Object test_pl_obj = pl.locate(res_point);
-      Face_const_handle test_fh;
-      assert(assign(test_fh, test_pl_obj));
-      assert(test_fh == face);
-    #endif
+    // just for checking, locate res_point in env to find face
+    Object test_pl_obj = pl.locate(res_point);
+    Face_const_handle test_fh;
+    assert(assign(test_fh, test_pl_obj));
+    assert(test_fh == face);
+#endif
 
     return res_point;
   }
 
-
   // compute a point inside the face saved in current_face
   // and put the result into current_point
   void compute_point_in_current_face(Face_handle face) {
diff --git a/Envelope_3/test/Envelope_3/Envelope_test_overlay_functor.h b/Envelope_3/test/Envelope_3/Envelope_test_overlay_functor.h
index 20cbfbcafb59..aab1b0019182 100644
--- a/Envelope_3/test/Envelope_3/Envelope_test_overlay_functor.h
+++ b/Envelope_3/test/Envelope_3/Envelope_test_overlay_functor.h
@@ -56,7 +56,7 @@ class Envelope_test_overlay_functor {
   void create_face (Face_handle1 f1, Face_handle2 f2, Res_face_handle res_f) {
     res_f->set_aux_source(0, f1);
     res_f->set_aux_source(1, f2);
-    assert_msg(f1->is_equal_data(f2->begin_data(), f2->end_data()),
+    assert_msg(f1->is_equal_env_data(f2->begin_env_data(), f2->end_env_data()),
                "data different over face");
   }
 
@@ -64,7 +64,7 @@ class Envelope_test_overlay_functor {
                      Res_vertex_handle res_v) {
     res_v->set_aux_source(0, h1);
     res_v->set_aux_source(1, h2);
-    assert_msg(h1->is_equal_data(h2->begin_data(), h2->end_data()),
+    assert_msg(h1->is_equal_env_data(h2->begin_env_data(), h2->end_env_data()),
                "data different over vertex");
   }
 
@@ -72,40 +72,40 @@ class Envelope_test_overlay_functor {
                      Res_vertex_handle res_v) {
     res_v->set_aux_source(0, v1);
     res_v->set_aux_source(1, v2);
-    assert_msg(v1->is_equal_data(v2->begin_data(), v2->end_data()),
-                       "data different over vertex");
+    assert_msg(v1->is_equal_env_data(v2->begin_env_data(), v2->end_env_data()),
+               "data different over vertex");
   }
 
   void create_vertex(Vertex_handle1 v1, Halfedge_handle2 h2,
                      Res_vertex_handle res_v) {
     res_v->set_aux_source(0, v1);
     res_v->set_aux_source(1, h2);
-    assert_msg(v1->is_equal_data(h2->begin_data(), h2->end_data()),
-                       "data different over vertex");
+    assert_msg(v1->is_equal_env_data(h2->begin_env_data(), h2->end_env_data()),
+               "data different over vertex");
   }
 
   void create_vertex(Halfedge_handle1 h1, Vertex_handle2 v2,
                      Res_vertex_handle res_v) {
     res_v->set_aux_source(0, h1);
     res_v->set_aux_source(1, v2);
-    assert_msg(h1->is_equal_data(v2->begin_data(), v2->end_data()),
-                       "data different over vertex");
+    assert_msg(h1->is_equal_env_data(v2->begin_env_data(), v2->end_env_data()),
+               "data different over vertex");
   }
 
   void create_vertex(Face_handle1 f1, Vertex_handle2 v2,
                      Res_vertex_handle res_v) {
     res_v->set_aux_source(0, f1);
     res_v->set_aux_source(1, v2);
-    assert_msg(f1->is_equal_data(v2->begin_data(), v2->end_data()),
-                       "data different over vertex");
+    assert_msg(f1->is_equal_env_data(v2->begin_env_data(), v2->end_env_data()),
+               "data different over vertex");
   }
 
   void create_vertex(Vertex_handle1 v1, Face_handle2 f2,
                      Res_vertex_handle res_v) {
     res_v->set_aux_source(0, v1);
     res_v->set_aux_source(1, f2);
-    assert_msg(v1->is_equal_data(f2->begin_data(), f2->end_data()),
-                       "data different over vertex");
+    assert_msg(v1->is_equal_env_data(f2->begin_env_data(), f2->end_env_data()),
+               "data different over vertex");
   }
 
   void create_edge(Halfedge_handle1 h1, Halfedge_handle2 h2,
@@ -116,8 +116,8 @@ class Envelope_test_overlay_functor {
     res_h->twin()->set_aux_source(0, h1->twin());
     res_h->twin()->set_aux_source(1, h2->twin());
 
-    assert_msg(h1->is_equal_data(h2->begin_data(), h2->end_data()),
-                       "data different over edge");
+    assert_msg(h1->is_equal_env_data(h2->begin_env_data(), h2->end_env_data()),
+               "data different over edge");
   }
 
   void create_edge(Halfedge_handle1 h1, Face_handle2 f2,
@@ -128,8 +128,8 @@ class Envelope_test_overlay_functor {
     res_h->twin()->set_aux_source(0, h1->twin());
     res_h->twin()->set_aux_source(1, f2);
 
-    assert_msg(h1->is_equal_data(f2->begin_data(), f2->end_data()),
-                       "data different over edge");
+    assert_msg(h1->is_equal_env_data(f2->begin_env_data(), f2->end_env_data()),
+               "data different over edge");
   }
 
   void create_edge(Face_handle1 f1, Halfedge_handle2 h2,
@@ -139,11 +139,9 @@ class Envelope_test_overlay_functor {
 
     res_h->twin()->set_aux_source(0, f1);
     res_h->twin()->set_aux_source(1, h2->twin());
-    assert_msg(f1->is_equal_data(h2->begin_data(), h2->end_data()),
-                       "data different over edge");
-
+    assert_msg(f1->is_equal_env_data(h2->begin_env_data(), h2->end_env_data()),
+               "data different over edge");
   }
-
 };
 
 } //namespace CGAL
diff --git a/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h b/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h
index 84a83a62d8ad..6eec83590a9f 100644
--- a/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h
+++ b/Envelope_3/test/Envelope_3/Envelope_triangles_test_3.h
@@ -176,9 +176,8 @@ class Envelope_triangles_test_3 {
       Vertex_handle vh = vi;
       // first we find the surfaces that are defined over the vertex
       std::list<Xy_monotone_surface_3> defined_surfaces;
-      typename Traits::Is_defined_over is_defined_over =
-        traits.is_defined_over_object();
-      for(std::size_t i=0; i<number_of_surfaces; ++i)
+      auto is_defined_over = traits.is_defined_over_object();
+      for (std::size_t i=0; i<number_of_surfaces; ++i)
         if (is_defined_over(vh->point(), surfaces[i]))
           defined_surfaces.push_back(surfaces[i]);
 
@@ -229,7 +228,7 @@ class Envelope_triangles_test_3 {
     // foreach face in the test envelope, compute a point inside the face,
     // locate it in the other envelope and compare the surfaces over the 2 faces
     Md2_point_location pl(env);
-    bool eq, result = true;
+    bool result = true;
     for (auto fi = test_env.faces_begin(); fi != test_env.faces_end(); ++fi) {
       Face_handle fh = fi;
       if (! fh->is_unbounded()) {
@@ -237,8 +236,9 @@ class Envelope_triangles_test_3 {
         auto pl_obj = pl.locate(inside_test);
         // faces of env must contain the faces of test
         const Face_const_handle* pl_fh = std::get_if<Face_const_handle>(&pl_obj);
-        assert(pl_fh!=nullptr);
-        eq = fh->is_equal_data((*pl_fh)->begin_data(), (*pl_fh)->end_data());
+        assert(pl_fh != nullptr);
+        auto eq = fh->is_equal_env_data((*pl_fh)->begin_env_data(),
+                                        (*pl_fh)->end_env_data());
         assert(eq);
         result &= eq;
       }
@@ -265,16 +265,16 @@ class Envelope_triangles_test_3 {
   template <typename SurfaceIterator>
   void set_minimum_over_vertex(Vertex_handle v, SurfaceIterator begin,
                                SurfaceIterator end) {
-    if (begin == end) v->set_no_data();
+    if (begin == end) v->set_no_env_data();
     else {
       auto si = begin;
       // we set the first surface as the minimum, and then compare all the others
       v->set_env_data(*si);
       ++si;
       for (; si != end; ++si) {
-        Comparison_result cr =
-          traits.compare_z_at_xy_3_object()(v->point(), v->get_env_data(), *si);
-        if (cr == EQUAL) v->add_data(*si);
+        auto cr = traits.compare_z_at_xy_3_object()(v->point(),
+                                                    v->env_data_front(), *si);
+        if (cr == EQUAL) v->add_env_data(*si);
         // this erases all surfaces from vertex's list
         else if (cr == LARGER) v->set_env_data(*si);
         // else - new surface has no affect on the envelope
@@ -287,7 +287,7 @@ class Envelope_triangles_test_3 {
   template <typename SurfaceIterator>
   void set_minimum_over_edge(const Halfedge_handle& h, SurfaceIterator begin,
                              SurfaceIterator end) {
-    if (begin == end) h->set_no_data();
+    if (begin == end) h->set_no_env_data();
     else {
       if (h != current_edge) compute_point_in_current_edge(h);
 
@@ -296,16 +296,15 @@ class Envelope_triangles_test_3 {
       h->set_env_data(*si);
       ++si;
       for (; si != end; ++si) {
-        Comparison_result cr =
-          traits.compare_z_at_xy_3_object()(current_point_inside_edge,
-                                            h->get_env_data(), *si);
-        if (cr == EQUAL) h->add_data(*si);
+        auto cr = traits.compare_z_at_xy_3_object()(current_point_inside_edge,
+                                                    h->env_data_front(), *si);
+        if (cr == EQUAL) h->add_env_data(*si);
         // this erases all surfaces from halfedge's list
         else if (cr == LARGER) h->set_env_data(*si);
         // else - new surface has no affect on the envelope
       }
       // set twin's data
-      h->twin()->set_env_data(h->begin_data(), h->end_data());
+      h->twin()->set_env_data(h->begin_env_data(), h->end_env_data());
     }
   }
   // fill the face with the surface on the envelope
@@ -317,7 +316,7 @@ class Envelope_triangles_test_3 {
     if (face->is_unbounded() || begin == end) {
       // a special case - no surface over the unbounded face, and when there
       // are no surfaces at all
-      face->set_no_data();
+      face->set_no_env_data();
     }
     else {
       auto si = begin;
@@ -326,9 +325,8 @@ class Envelope_triangles_test_3 {
       face->set_env_data(*si);
       ++si;
       for (; si != end; ++si) {
-        Comparison_result cr =
-          compare_surfaces_over_face(face, face->get_env_data(), *si);
-        if (cr == EQUAL) face->add_data(*si);
+        auto cr = compare_surfaces_over_face(face, face->env_data_front(), *si);
+        if (cr == EQUAL) face->add_env_data(*si);
         // this erases all surfaces from face's list
         else if (cr == LARGER) face->set_env_data(*si);
         // else - new surface has no affect on the envelope
@@ -392,10 +390,9 @@ class Envelope_triangles_test_3 {
                   << cur_res << std::endl;
 #endif
 
-      if (cur_res != EQUAL)
-        found_not_equal = true;
-      hec++;
-    } while(hec != hec_begin && !found_not_equal);
+      if (cur_res != EQUAL) found_not_equal = true;
+      ++hec;
+    } while ((hec != hec_begin) && ! found_not_equal);
     //  std::cout << "for comparison on vertices, result = " << cur_res
     //            << std::endl;
 
@@ -482,11 +479,11 @@ class Envelope_triangles_test_3 {
         #endif
 
         result &= tmp_result;
-        hec++;
-      } while(hec != hec_begin && result);
+        ++hec;
+      } while ((hec != hec_begin) && result);
     }
 
-    if (result == false) return result;
+    if (! result) return result;
 
     // check vertices on holes boundary
     Hole_iterator hi;
@@ -502,9 +499,9 @@ class Envelope_triangles_test_3 {
         #endif
 
         result &= tmp_result;
-        hec++;
-      } while(hec != hec_begin && result);
-      if (result == false) return result;
+        ++hec;
+      } while ((hec != hec_begin) && result);
+      if (! result) return result;
     }
 
     return result;
@@ -540,8 +537,8 @@ class Envelope_triangles_test_3 {
         found = true;
         continue;
       }
-      hec++;
-    } while (hec != hec_begin && !found);
+      ++hec;
+    } while ((hec != hec_begin) && !found);
     assert(found);
 
     Halfedge_handle found_hh = hec;

From 8f7d10a300197a1009101e6f7b4f1e3c7960f596 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Tue, 30 Jan 2024 16:45:42 +0200
Subject: [PATCH 1324/1398] Final cnames changes to avoid collition

---
 .../Envelope_divide_and_conquer_3.h           |  6 ++---
 .../CGAL/Envelope_3/Envelope_overlay_2.h      |  6 ++---
 .../CGAL/Envelope_3/Envelope_pm_dcel.h        | 22 +++++++++----------
 3 files changed, 17 insertions(+), 17 deletions(-)

diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
index ad237a7e99f0..42aa64669a13 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_divide_and_conquer_3.h
@@ -1341,7 +1341,7 @@ class Envelope_divide_and_conquer_3 {
     for (auto vi = result.vertices_begin(); vi != result.vertices_end(); ++vi) {
       Vertex_handle vh = vi;
 
-      all_ok &= (vh->env_is_set());
+      all_ok &= (vh->is_env_set());
       CGAL_assertion_msg(all_ok, "data not set over vertex");
       all_ok &= (!vh->has_no_env_data());
 
@@ -1354,7 +1354,7 @@ class Envelope_divide_and_conquer_3 {
     {
       Halfedge_handle hh = hi;
 
-      all_ok &= (hh->env_is_set());
+      all_ok &= (hh->is_env_set());
       if (!all_ok) std::cerr << "edge: " << hh->curve() << std::endl;
       CGAL_assertion_msg(all_ok, "data not set over edge");
       all_ok &= (!hh->has_no_env_data());
@@ -1367,7 +1367,7 @@ class Envelope_divide_and_conquer_3 {
 
     for (auto fi = result.faces_begin(); fi != result.faces_end(); ++fi) {
       Face_handle fh = fi;
-      all_ok &= (fh->env_is_set());
+      all_ok &= (fh->is_env_set());
       CGAL_assertion_msg(all_ok, "data not set over face");
     }
     return all_ok;
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h
index 78dc81612ea3..a7d5773ce34d 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_overlay_2.h
@@ -63,7 +63,7 @@ class Envelope_overlay_2 {
   /* void print_face(Face_handle fh) {
    *   std::cout << (fh->is_unbounded() ? "unbounded" : "bounded");
    *
-   *   if (fh->env_is_set()) {
+   *   if (fh->is_env_set()) {
    *     std::cout << " #data= " << fh->env_data_size();
    *     if (fh->env_data_size() > 0)
    *       std::cout << " data= " << fh->env_data_front();
@@ -98,7 +98,7 @@ class Envelope_overlay_2 {
    *     Vertex_handle vh = vit;
    *     std::cout << vh->point();
    *
-   *      if (vh->env_is_set()) {
+   *      if (vh->is_env_set()) {
    *       std::cout << " #data= " << vh->env_data_size();
    *       if (vh->env_data_size() > 0)
    *         std::cout << " data= " << vh->env_data_front();
@@ -125,7 +125,7 @@ class Envelope_overlay_2 {
    *     Halfedge_handle hh = hit;
    *     std::cout << hh->curve();
    *
-   *     if (hh->env_is_set()) {
+   *     if (hh->is_env_set()) {
    *       std::cout << " #data= " << hh->env_data_size();
    *       if (hh->env_data_size() > 0)
    *         std::cout << " data= " << hh->env_data_front();
diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
index a7ecfc45f461..31e114b2f48e 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_pm_dcel.h
@@ -39,19 +39,19 @@ class Dcel_info {
   Data_container m_env_data;
 
   /*! Indicates that the data (surfaces) have been set already */
-  bool m_is_set;
+  bool m_is_env_set;
 
   // the decision that was made
   Dac_decision m_decision;
 public:
   /*! Constructor */
-  Dcel_info() : m_is_set(false), m_decision(DAC_DECISION_NOT_SET) {}
+  Dcel_info() : m_is_env_set(false), m_decision(DAC_DECISION_NOT_SET) {}
 
   /*! \brief returns true iff data has been set already */
-  bool env_is_set() const { return m_is_set; }
+  bool is_env_set() const { return m_is_env_set; }
 
   /*! \brief resets the flag  */
-  void set_is_set(bool flag) { m_is_set = flag; }
+  void set_is_env_set(bool flag) { m_is_env_set = flag; }
 
   bool is_decision_set() { return (m_decision != DAC_DECISION_NOT_SET); }
 
@@ -85,7 +85,7 @@ class Dcel_info {
   /*! Check whether the data is set to be empty
    */
   bool has_no_env_data() const
-  { return (m_is_set && (env_data_size() == 0)); }
+  { return (m_is_env_set && (env_data_size() == 0)); }
 
   /*! Obtain the first data object associated with the cell.
    * \pre m_env_data.size() is not 0.
@@ -129,7 +129,7 @@ class Dcel_info {
    */
   void set_no_env_data() {
     clear_env_data();
-    m_is_set = true;
+    m_is_env_set = true;
   }
 
    /*! Add a data object to the face.
@@ -137,7 +137,7 @@ class Dcel_info {
    */
   void add_env_data(const Data& data) {
     m_env_data.push_back(data);
-    m_is_set = true;
+    m_is_env_set = true;
   }
 
   /*! Add a range of data objects to the face.
@@ -147,14 +147,14 @@ class Dcel_info {
   template <typename InputIterator>
   void add_env_data(InputIterator begin, InputIterator end) {
     for (auto it = begin; it != end; ++it) m_env_data.push_back(*it);
-    m_is_set = true;
+    m_is_env_set = true;
   }
 
   /*! Clear the data objects.
    */
   void clear_env_data() {
     m_env_data.clear();
-    m_is_set = false;
+    m_is_env_set = false;
   }
 
   /*! Check whether the set of data objects in the input range is equal to our
@@ -162,7 +162,7 @@ class Dcel_info {
    */
   template <typename InputIterator>
   bool is_equal_env_data(InputIterator begin, InputIterator end) const {
-    if (! env_is_set()) return false;
+    if (! is_env_set()) return false;
 
     // insert the input data objects into a set
     std::set<Data> input_data(begin, end);
@@ -173,7 +173,7 @@ class Dcel_info {
 
   template <typename InputIterator>
   bool has_equal_env_data(InputIterator begin, InputIterator end) const {
-    if (! env_is_set()) return false;
+    if (! is_env_set()) return false;
 
     // insert the input data objects into a set
     std::set<Data> input_data(begin, end);

From 03ad75dbcbdffaf77d447353d6069427a6001f98 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 25 Jan 2024 15:50:35 +0100
Subject: [PATCH 1325/1398] [flip] fix verbose mode

---
 .../include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h    | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 51f9f99763e8..6faa6d3314d4 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -2119,7 +2119,7 @@ void flip_edges(C3T3& c3t3,
   //}
 
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-  std::cout << "\nFlip edges... done ("
+  std::cout << "Flip edges... done ("
     << nb_flips_on_surface << "/"
     << nb_flips_in_volume << " surface/volume flips done)." << std::endl;
 #endif

From 11545be57de9f1c5aa8b5da0f38a12dbf401ad51 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 26 Jan 2024 10:15:09 +0100
Subject: [PATCH 1326/1398] [flip] fix warnings

---
 .../internal/flip_edges.h                     | 29 ++++++-------------
 1 file changed, 9 insertions(+), 20 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 6faa6d3314d4..fc210789306f 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -726,7 +726,6 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
   //TODO!!!! Check that the created edges do not exist!!!
 
   boost::container::small_vector<Facet, 2> facets_in_complex;
-  typename C3t3::Surface_patch_index patch;
 
   Facet_circulator facet_circulator = tr.incident_facets(edge);
   Facet_circulator done_facet_circulator = facet_circulator;
@@ -735,7 +734,6 @@ Sliver_removal_result flip_n_to_m(C3t3& c3t3,
   {
     if (c3t3.is_in_complex(*facet_circulator))
     {
-      patch = c3t3.surface_patch_index(*facet_circulator);
       facets_in_complex.push_back(*facet_circulator);
     }
 
@@ -1178,7 +1176,6 @@ std::size_t flip_all_edges(const std::vector<VertexPair>& edges,
 {
   typedef typename C3t3::Triangulation Tr;
   typedef typename Tr::Cell_handle   Cell_handle;
-  typedef typename Tr::Vertex_handle Vertex_handle;
   typedef typename Tr::Edge          Edge;
 
   Tr& tr = c3t3.triangulation();
@@ -1229,7 +1226,6 @@ void collectBoundaryEdgesAndComputeVerticesValences(
   boost::unordered_map<typename C3T3::Vertex_handle, std::unordered_set<typename C3T3::Subdomain_index> >&
       vertices_subdomain_indices)
 {
-  typedef typename C3T3::Subdomain_index     Subdomain_index;
   typedef typename C3T3::Surface_patch_index Surface_patch_index;
   typedef typename C3T3::Vertex_handle       Vertex_handle;
   typedef typename C3T3::Edge                Edge;
@@ -1302,19 +1298,17 @@ void collectBoundaryEdgesAndComputeVerticesValences(
   }
 }
 
-template<typename C3T3, typename IncCellsVector, typename CellSelector, typename Visitor>
+template<typename C3T3, typename IncCellsVector, typename Visitor>
 Sliver_removal_result flip_n_to_m_on_surface(typename C3T3::Edge& edge,
     C3T3& c3t3,
     typename C3T3::Vertex_handle v0i,//v0 of new edge that will replace edge
     typename C3T3::Vertex_handle v1i,//v1 of new edge that will replace edge
     const IncCellsVector& cells_around_edge,
-    Flip_Criterion flip_criterion,
-    CellSelector& cell_selector,
-    Visitor& visitor)
+    Flip_Criterion /*flip_criterion*/,
+    Visitor& /*visitor*/)
 {
   typedef typename C3T3::Vertex_handle Vertex_handle;
   typedef typename C3T3::Cell_handle   Cell_handle;
-  typedef typename C3T3::Triangulation::Geom_traits::Point_3 Point_3;
 
   typename C3T3::Triangulation& tr = c3t3.triangulation();
 
@@ -1365,14 +1359,13 @@ Sliver_removal_result flip_n_to_m_on_surface(typename C3T3::Edge& edge,
 //v0i and v1i are the vertices opposite to `edge`
 //on facets of the surface
 template<typename C3T3, typename IncCellsVectorMap,
-         typename CellSelector, typename Visitor>
+         typename Visitor>
 Sliver_removal_result flip_on_surface(C3T3& c3t3,
     typename C3T3::Edge& edge,
     typename C3T3::Vertex_handle v0i,//v0 of new edge that will replace edge
     typename C3T3::Vertex_handle v1i,//v1 of new edge that will replace edge
     IncCellsVectorMap& inc_cells,
     Flip_Criterion flip_criterion,
-    CellSelector& cell_selector,
     Visitor& visitor)
 {
   typedef typename C3T3::Triangulation Tr;
@@ -1407,7 +1400,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 #else
         return flip_n_to_m_on_surface(edge, c3t3, v0i, v1i,
                                       cells_around_edge, flip_criterion,
-                                      cell_selector, visitor);
+                                      visitor);
 #endif
 //////    }
     }
@@ -1460,12 +1453,12 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //  std::vector<std::pair<Point_3, Point_3> > current_edges;
 //  current_edges.push_back(std::make_pair(vh1->point(), vh3->point()));
 
-  if (vh0 == v0i && vh2 == v1i || vh2 == v0i && vh0 == v1i)
+  if ((vh0 == v0i && vh2 == v1i) || (vh2 == v0i && vh0 == v1i))
   {
     planar_flip = true;
 //    current_edges.push_back(std::make_pair(vh0->point(), vh2->point()));
   }
-  else if (vh4 == v0i && vh5 == v1i || vh5 == v0i && vh4 == v1i)
+  else if ((vh4 == v0i && vh5 == v1i) || (vh5 == v0i && vh4 == v1i))
     planar_flip = false;
   else
     return NOT_FLIPPABLE;
@@ -1500,8 +1493,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 //  std::cout << "vh0 "<< vh0->info() <<", " << vh1->info() << ", " << vh2->info() << ", " << vh3->info()<<", " << vh4->info() << ", " << vh5 ->info() << std::endl;
 //  */
 
-  typedef std::pair<Vertex_handle, Vertex_handle> Edge_uv;
-  typedef typename C3T3::Edge  Edge;
   typedef typename C3T3::Facet Facet;
   typedef typename C3T3::Surface_patch_index Surface_patch_index;
 
@@ -1853,7 +1844,6 @@ std::size_t flipBoundaryEdges(
   typedef typename C3T3::Facet         Facet;
   typedef typename C3T3::Edge          Edge;
   typedef typename C3T3::Surface_patch_index Surface_patch_index;
-  typedef typename C3T3::Subdomain_index Subdomain_index;
   typedef typename C3T3::Triangulation Tr;
   typedef std::pair<Vertex_handle, Vertex_handle> Edge_vv;
 
@@ -1937,8 +1927,8 @@ std::size_t flipBoundaryEdges(
           vh3 = v3;
       }
 
-      int li, lj, lk;
-      Cell_handle c;
+      CGAL_assertion_code((int li, lj, lk));
+      CGAL_assertion_code(Cell_handle c);
       CGAL_assertion(tr.is_facet(vh0, vh1, vh2, c, li, lj, lk));
       CGAL_assertion(c3t3.is_in_complex(c, (6 - li - lj - lk)));
 
@@ -1985,7 +1975,6 @@ std::size_t flipBoundaryEdges(
           Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3,
                                                      inc_cells,
                                                      flip_criterion,
-                                                     cell_selector,
                                                      visitor);
           if (db == VALID_FLIP)
           {

From 302f8e8b2e8198c5ae1ca07719b6d5c213dd0f1e Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 26 Jan 2024 10:47:32 +0100
Subject: [PATCH 1327/1398] [flip] fix more warnings

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 .../internal/flip_edges.h                     | 20 ++++++++++---------
 1 file changed, 11 insertions(+), 9 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index fc210789306f..933d0a9f550e 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1372,7 +1372,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
   typedef typename Tr::Cell_handle     Cell_handle;
   typedef typename Tr::Vertex_handle   Vertex_handle;
   typedef typename Tr::Cell_circulator Cell_circulator;
-  typedef typename Tr::Point           Point_3;
 
   Tr& tr = c3t3.triangulation();
   Cell_circulator circ = tr.incident_cells(edge);
@@ -1927,7 +1926,9 @@ std::size_t flipBoundaryEdges(
           vh3 = v3;
       }
 
-      CGAL_assertion_code((int li, lj, lk));
+      CGAL_assertion_code(int li);
+      CGAL_assertion_code(int lj);
+      CGAL_assertion_code(int lk);
       CGAL_assertion_code(Cell_handle c);
       CGAL_assertion(tr.is_facet(vh0, vh1, vh2, c, li, lj, lk));
       CGAL_assertion(c3t3.is_in_complex(c, (6 - li - lj - lk)));
@@ -1966,9 +1967,10 @@ std::size_t flipBoundaryEdges(
                        + (v3 - m3)*(v3 - m3);
         if (initial_cost > final_cost)
         {
-          int nbf = std::distance(c3t3.facets_in_complex_begin(),
-                                  c3t3.facets_in_complex_end());
-          CGAL_assertion_code(int nbe =
+          CGAL_assertion_code(std::size_t nbf =
+            std::distance(c3t3.facets_in_complex_begin(),
+                          c3t3.facets_in_complex_end()));
+          CGAL_assertion_code(std::size_t nbe =
             std::distance(c3t3.edges_in_complex_begin(),
                           c3t3.edges_in_complex_end()));
 
@@ -1991,11 +1993,11 @@ std::size_t flipBoundaryEdges(
             CGAL_assertion(b);
             c3t3.add_to_complex(c, (6 - li - lj - lk), surfi);
 
-//            std::cout << " done" << std::endl;
-            int nbf_post = std::distance(c3t3.facets_in_complex_begin(),
-                                         c3t3.facets_in_complex_end());
+            CGAL_assertion_code(std::size_t nbf_post =
+              std::distance(c3t3.facets_in_complex_begin(),
+                            c3t3.facets_in_complex_end()));
             CGAL_assertion(nbf == nbf_post);
-            CGAL_assertion_code(int nbe_post =
+            CGAL_assertion_code(std::size_t nbe_post =
               std::distance(c3t3.edges_in_complex_begin(),
                             c3t3.edges_in_complex_end()));
             CGAL_assertion(nbe == nbe_post);

From 83d99a507a8afb9ef24d2569c410cc9103a9e33c Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 30 Jan 2024 11:59:57 +0100
Subject: [PATCH 1328/1398] [flip] check vertices_subdomain_indices[v] == 2 at
 both endpoints!

and re-write collection of subdomains on boundary
---
 .../internal/flip_edges.h                     | 33 +++++++++++++------
 1 file changed, 23 insertions(+), 10 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 933d0a9f550e..36b534eced80 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1215,10 +1215,26 @@ std::size_t flip_all_edges(const std::vector<VertexPair>& edges,
   return count;
 }
 
+template<typename C3t3>
+void collect_subdomains_on_boundary(const C3t3& c3t3,
+  boost::unordered_map<typename C3t3::Vertex_handle,
+    std::unordered_set<typename C3t3::Subdomain_index> >& vertices_subdomain_indices)
+{
+  for (auto c : c3t3.triangulation().all_cell_handles())
+  {
+    for (auto v : c3t3.triangulation().vertices(c))
+    {
+      const int dim = v->in_dimension();
+      if(dim >= 0 && dim < 3)
+        vertices_subdomain_indices[v].insert(c->subdomain_index());
+    }
+  }
+}
+
 template<typename C3T3, typename CellSelector>
 void collectBoundaryEdgesAndComputeVerticesValences(
   const C3T3& c3t3,
-  CellSelector cell_selector,
+  const CellSelector& cell_selector,
   std::vector<typename C3T3::Edge>& boundary_edges,
   boost::unordered_map<typename C3T3::Vertex_handle,
                        boost::unordered_map<typename C3T3::Surface_patch_index, unsigned int> >&
@@ -1247,18 +1263,14 @@ void collectBoundaryEdgesAndComputeVerticesValences(
                                                  "boundary_edges.polylines.txt");
 #endif
 
+  // collect incident subdomain indices at vertices
+  collect_subdomains_on_boundary(c3t3, vertices_subdomain_indices);
+
   for (const Edge& e : boundary_edges)
   {
     const Vertex_handle v0 = e.first->vertex(e.second);
     const Vertex_handle v1 = e.first->vertex(e.third);
 
-    if (vertices_subdomain_indices.find(v0) == vertices_subdomain_indices.end())
-      incident_subdomains(v0, c3t3,
-        std::inserter(vertices_subdomain_indices[v0], vertices_subdomain_indices[v0].end()));
-    if (vertices_subdomain_indices.find(v1) == vertices_subdomain_indices.end())
-      incident_subdomains(v1, c3t3,
-        std::inserter(vertices_subdomain_indices[v1], vertices_subdomain_indices[v1].end()));
-
     //In case of feature edge
     if (vertices_subdomain_indices[v0].size() > 2
       && vertices_subdomain_indices[v1].size() > 2)
@@ -1275,7 +1287,8 @@ void collectBoundaryEdgesAndComputeVerticesValences(
         }
       } while (++facet_circulator != done);
     }
-    else if (vertices_subdomain_indices[v0].size() == 2)
+    else if (vertices_subdomain_indices[v0].size() == 2
+          || vertices_subdomain_indices[v1].size() == 2)
     {
       Facet_circulator facet_circulator = tr.incident_facets(e);
       Facet_circulator done(facet_circulator);
@@ -2110,7 +2123,7 @@ void flip_edges(C3T3& c3t3,
   //}
 
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-  std::cout << "Flip edges... done ("
+  std::cout << "\rFlip edges... done ("
     << nb_flips_on_surface << "/"
     << nb_flips_in_volume << " surface/volume flips done)." << std::endl;
 #endif

From fd7c4113e5b97309550bc81c1281eeeaf4ecc0fb Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 30 Jan 2024 12:02:57 +0100
Subject: [PATCH 1329/1398] [todo] set as corners the vertices where incident
 complex edges form a sharp angle

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
---
 .../tetrahedral_adaptive_remeshing_impl.h     |  9 ++-
 .../internal/tetrahedral_remeshing_helpers.h  | 73 +++++++++++++++++++
 2 files changed, 80 insertions(+), 2 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
index b932a6ba7ccb..8355dd9fd1da 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
@@ -32,6 +32,7 @@
 #include <CGAL/Tetrahedral_remeshing/internal/compute_c3t3_statistics.h>
 
 #include <optional>
+#include <boost/container/small_vector.hpp>
 
 namespace CGAL
 {
@@ -438,8 +439,12 @@ class Adaptive_remesher
     Corner_index corner_id = 0;
     for (Vertex_handle vit : tr().finite_vertex_handles())
     {
-      if ( vit->in_dimension() == 0
-           || nb_incident_complex_edges(vit, m_c3t3) > 2)
+      boost::container::small_vector<Edge, 3> incident_edges;
+      incident_complex_edges(vit, m_c3t3, std::back_inserter(incident_edges));
+      if ( incident_edges.size() == 1 //tip or endpoint
+        || incident_edges.size() > 2  //corner
+        || (incident_edges.size() == 2
+            && edges_form_a_sharp_angle(incident_edges, 60, m_c3t3)))
       {
         if (!m_c3t3.is_in_complex(vit))
           m_c3t3.add_to_complex(vit, ++corner_id);
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 262ac2caf284..5f1c84089f96 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -388,6 +388,62 @@ Dihedral_angle_cosine max_cos_dihedral_angle(const Tr& tr,
   return cos_dh;
 }
 
+// incident_edges must share a vertex
+template<typename EdgesVector, typename C3t3>
+bool edges_form_a_sharp_angle(const EdgesVector& incident_edges,
+                              const double angle_bound,
+                              const C3t3& c3t3)
+{
+  CGAL_assertion(incident_edges.size() == 2);
+
+  typedef typename EdgesVector::value_type Edge;
+  typedef typename C3t3::Vertex_handle Vertex_handle;
+
+  const std::array<Vertex_handle, 2> ev0
+    = c3t3.triangulation().vertices(incident_edges[0]);
+  const std::array<Vertex_handle, 2> ev1
+    = c3t3.triangulation().vertices(incident_edges[1]);
+
+  Vertex_handle shared_vertex, v1, v2;
+  if (ev0[0] == ev1[0])
+  {
+    shared_vertex = ev0[0];
+    v1 = ev0[1];
+    v2 = ev1[1];
+  }
+  else if(ev0[0] == ev1[1])
+  {
+    shared_vertex = ev0[0];
+    v1 = ev0[1];
+    v2 = ev1[0];
+  }
+  else if(ev0[1] == ev1[0])
+  {
+    shared_vertex = ev0[1];
+    v1 = ev0[0];
+    v2 = ev1[1];
+  }
+  else if(ev0[1] == ev1[1])
+  {
+    shared_vertex = ev0[1];
+    v1 = ev0[0];
+    v2 = ev1[0];
+  }
+  else
+  {
+    CGAL_assertion(false);
+    return false;
+  }
+  CGAL_assertion(shared_vertex != v1);
+  CGAL_assertion(shared_vertex != v2);
+  CGAL_assertion(v1 != v2);
+
+  const double angle = CGAL::approximate_angle(point(v1->point()),
+                                               point(shared_vertex->point()),
+                                               point(v2->point()));
+  return angle < angle_bound;
+}
+
 template<typename C3t3>
 bool is_peelable(const C3t3& c3t3,
                  const typename C3t3::Cell_handle ch,
@@ -828,6 +884,23 @@ std::size_t nb_incident_surface_patches(const typename C3t3::Edge& e,
   return indices.size();
 }
 
+template<typename OutputIterator, typename C3t3>
+OutputIterator incident_complex_edges(const typename C3t3::Vertex_handle v,
+                                      const C3t3& c3t3,
+                                      OutputIterator oit)
+{
+  typedef typename C3t3::Edge Edge;
+  std::unordered_set<Edge> edges;
+  c3t3.triangulation().finite_incident_edges(v, std::inserter(edges, edges.begin()));
+
+  for (const Edge& e : edges)
+  {
+    if (c3t3.is_in_complex(e))
+      *oit++ = e;
+  }
+  return oit;
+}
+
 template<typename C3t3>
 std::size_t nb_incident_complex_edges(const typename C3t3::Vertex_handle v,
                                       const C3t3& c3t3)

From 635081560438f15c66409347fb851c506e9981b9 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 31 Jan 2024 00:00:55 +0200
Subject: [PATCH 1330/1398] Passed the base class of Env_plane_traits_3 as a
 template parameter with a default value (being the 2D arrangement linear
 traits). Similarly, passed the base class of Env_triangle_traits_3 as a
 template parameter with a default value (being the 2D arrangement segment
 traits).

---
 .../doc/Envelope_3/CGAL/Env_plane_traits_3.h  |  70 +--
 .../Envelope_3/CGAL/Env_triangle_traits_3.h   |  76 +--
 .../Envelope_3/Concepts/EnvelopeTraits_3.h    | 432 +++++++++---------
 .../doc/Envelope_3/PackageDescription.txt     |   5 +-
 Envelope_3/include/CGAL/Env_plane_traits_3.h  |   5 +-
 .../include/CGAL/Env_triangle_traits_3.h      |   5 +-
 6 files changed, 292 insertions(+), 301 deletions(-)

diff --git a/Envelope_3/doc/Envelope_3/CGAL/Env_plane_traits_3.h b/Envelope_3/doc/Envelope_3/CGAL/Env_plane_traits_3.h
index 81d5861e3c8b..21872b31f571 100644
--- a/Envelope_3/doc/Envelope_3/CGAL/Env_plane_traits_3.h
+++ b/Envelope_3/doc/Envelope_3/CGAL/Env_plane_traits_3.h
@@ -1,39 +1,43 @@
 namespace CGAL {
 
-/*!
-\ingroup PkgEnvelope3Ref
-
-The traits class `Env_plane_traits_3` models the `EnvelopeTraits_3` concept,
-and is used for the construction of lower and upper envelopes of planes
-and half planes in the space. It is parameterized by a \cgal-kernel model,
-which is parameterized in turn by a number type. The number type should
-support exact rational arithmetic, to avoid numerical errors and
-robustness problems. In particular, the number type should support the
-arithmetic operations \f$ +\f$, \f$ -\f$, \f$ \times\f$, and \f$ \div\f$ without loss of
-precision. For optimal performance, we recommend instantiating the traits
-class with the predefined
-`Exact_predicates_exact_constructions_kernel` provided by \cgal.
-Using this kernel guarantees exactness and robustness, while it incurs
-only a minor overhead (in comparison to working with a fast, inexact number
-type) for most inputs.
-
-Note that an entire plane has no boundaries, and the projection of a
-half-plane is an (unbounded) line. Naturally, rays and segments may occur as
-a result of overlaying projections of several half planes. Indeed,
-`Env_plane_traits_3` inherits from the `Arr_linear_traits_2<Kernel>` traits
-class, and extends it by adding operations on planes and half planes.
-The nested `Xy_monotone_surface_3` and `Surface_3` types refer
-to the same type. They are constructible from a `Kernel::Plane_3`
-in case of an entire plane, or from `Kernel::Plane_3` and
-`Kernel::Line_2` in case of a half-plane. The line orientation
-determines which half is considered.
-
-\cgalModels{EnvelopeTraits_3}
-
-*/
-template< typename Kernel >
-class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel> {
+/*! \ingroup PkgEnvelope3Ref
+ *
+ * The traits class template `Env_plane_traits_3` models the `EnvelopeTraits_3`
+ * concept, and is used for the construction of lower and upper envelopes of
+ * planes and half planes in the space. When the template is instantiated, the
+ * template parameter `Kernel` must be substituted by a \cgal-kernel model, the
+ * number type of which should support exact rational arithmetic, to avoid
+ * numerical errors and robustness problems. In particular, the number type
+ * should support the arithmetic operations \f$ +\f$, \f$ -\f$, \f$ \times\f$,
+ * and \f$ \div\f$ without loss of precision. For optimal performance, we
+ * recommend instantiating the traits class with the predefined
+ * `Exact_predicates_exact_constructions_kernel` provided by \cgal.  Using this
+ * kernel guarantees exactness and robustness, while it incurs only a minor
+ * overhead (in comparison to working with a fast, inexact number type) for most
+ * inputs.
+ *
+ * The second template parameter, namely `ArrLinearTraits`, should be
+ * substituted by a 2D arrangement geometry traits class that supports unbounded
+ * linear objects, i.e, lines, rays, and segments. By default it is substituted
+ * by `Arr_linear_traits_2<Kernel>`.
+ *
+ * Note that an entire plane has no boundaries, and the projection of a
+ * half-plane is an (unbounded) line. Naturally, rays and segments may occur as
+ * a result of overlaying projections of several half planes. Indeed,
+ * `Env_plane_traits_3` inherits from the traits class that substitutes
+ * `ArrLinearTraits`, and extends it by adding operations on planes and half
+ * planes.  The nested `Xy_monotone_surface_3` and `Surface_3` types refer to
+ * the same type. They are constructible from a `Kernel::Plane_3` in case of an
+ * entire plane, or from `Kernel::Plane_3` and `Kernel::Line_2` in case of a
+ * half-plane. The line orientation determines which half is considered.
+ *
+ * \cgalModels{EnvelopeTraits_3}
+ */
+template <typename Kernel,
+          typename ArrLinearTraits = Arr_linear_traits_2<Kernel>>
+class Env_plane_traits_3 : public  ArrLinearTraits {
 public:
 
 }; /* end Env_plane_traits_3 */
+
 } /* end namespace CGAL */
diff --git a/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h b/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h
index 746463520525..30cbba6d6421 100644
--- a/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h
+++ b/Envelope_3/doc/Envelope_3/CGAL/Env_triangle_traits_3.h
@@ -1,42 +1,46 @@
 namespace CGAL {
 
-/*!
-\ingroup PkgEnvelope3Ref
-
-The traits class `Env_triangle_traits_3` models the `EnvelopeTraits_3`
-concept, and is used for the construction of lower and upper envelopes
-of triangles in the space. It is parameterized by a \cgal-kernel,
-which is parameterized in turn by a number type. The number type should
-support exact rational arithmetic, to avoid numerical errors and
-robustness problems. In particular, the number type should support
-the arithmetic operations \f$ +\f$, \f$ -\f$, \f$ \times\f$, and \f$ \div\f$ without loss
-of precision. For optimal performance, we recommend instantiating the
-traits class with the predefined
-`Exact_predicates_exact_constructions_kernel` provided by \cgal.
-Using this kernel guarantees exactness and robustness, while it incurs
-only a minor overhead (in comparison to working with a fast, inexact number
-type) for most inputs.
-
-Note that when we project the boundary of a triangle, or the intersection
-of two triangles, onto the \f$ xy\f$-plane, we obtain line segments. Indeed,
-`Env_triangle_traits_3` inherits from the `Arr_segment_traits_2<Kernel>` traits
-class, and extends it by adding operations on 3D objects, namely spacial
-triangles. Note that the traits class does <I>not</I> define
-`Kernel::Triangle_3` as its surface (and \f$ xy\f$-monotone surface) type,
-as one may expect. This is because the traits class needs to store extra
-data with the triangles in order to efficiently operate on them.
-Nevertheless, the nested `Xy_monotone_surface_3` and `Surface_3`
-types are however constructible from a `Kernel::Triangle_3`
-instance and are also convertible to a `Kernel::Triangle_3` object.
-Both types, `Xy_monotone_surface_3` and `Surface_3`, refer to the
-same class, as <I>every</I> triangle is (weakly) \f$ xy\f$-monotone).
-
-\cgalModels{EnvelopeTraits_3}
-
-*/
-template< typename Kernel >
-class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel> {
+/*! \ingroup PkgEnvelope3Ref
+ *
+ * The traits class template `Env_triangle_traits_3` models the
+ * `EnvelopeTraits_3` concept, and is used for the construction of lower and
+ * upper envelopes of triangles in the space. When the template is instantiated,
+ * the template parameter `Kernel` must be substituted by a \cgal-kernel model,
+ * the number type of which should support exact rational arithmetic, to avoid
+ * numerical errors and robustness problems. In particular, the number type
+ * should support the arithmetic operations \f$ +\f$, \f$ -\f$, \f$ \times\f$,
+ * and \f$ \div\f$ without loss of precision. For optimal performance, we
+ * recommend instantiating the traits class with the predefined
+ * `Exact_predicates_exact_constructions_kernel` provided by \cgal.  Using this
+ * kernel guarantees exactness and robustness, while it incurs only a minor
+ * overhead (in comparison to working with a fast, inexact number type) for most
+ * inputs.
+ *
+ * The second template parameter, namely `ArrSegmentTraits`, should be
+ * substituted by a 2D arrangement geometry traits class that supports
+ * segments. By default it is substituted by `Arr_segment_traits_2<Kernel>`.
+ *
+ * Note that when we project the boundary of a triangle, or the intersection of
+ * two triangles, onto the \f$ xy\f$-plane, we obtain line segments. Indeed,
+ * `Env_triangle_traits_3` inherits from the traits class that substitutes
+ * `ArrSegmentTraits`, and extends it by adding operations on 3D objects, namely
+ * spacial triangles. Note that the traits class does <I>not</I> define
+ * `Kernel::Triangle_3` as its surface (and \f$ xy\f$-monotone surface) type, as
+ * one may expect. This is because the traits class needs to store extra data
+ * with the triangles in order to efficiently operate on them.  Nevertheless,
+ * the nested `Xy_monotone_surface_3` and `Surface_3` types are however
+ * constructible from a `Kernel::Triangle_3` instance and are also convertible
+ * to a `Kernel::Triangle_3` object.  Both types, `Xy_monotone_surface_3` and
+ * `Surface_3`, refer to the same class, as <I>every</I> triangle is (weakly)
+ * \f$ xy\f$-monotone).
+ *
+ * \cgalModels{EnvelopeTraits_3}
+ */
+template <typename Kernel,
+          typename ArrSegmentTraits = Arr_segment_traits_2<Kernel>>
+class Env_triangle_traits_3 : public ArrSegmentTraits {
 public:
 
 }; /* end Env_triangle_traits_3 */
+
 } /* end namespace CGAL */
diff --git a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
index 3665e2ae25a0..fc72154073a5 100644
--- a/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
+++ b/Envelope_3/doc/Envelope_3/Concepts/EnvelopeTraits_3.h
@@ -1,231 +1,213 @@
-/*!
-\ingroup PkgEnvelope3Concepts
-\cgalConcept
-
-This concept defines the minimal set of geometric predicates and
-operations needed to compute the envelope of a set of arbitrary
-surfaces in \f$ \mathbb{R}^3\f$. It refines the
-`ArrangementXMonotoneTraits_2` concept. In addition to the
-`Point_2` and `X_monotone_curve_2` types and the
-`Has_boundary_category` category tag listed in the base concept,
-it also lists the `Surface_3` and `Xy_monotone_surface_3`
-types, which represent arbitrary surfaces and \f$ xy\f$-monotone surfaces,
-respectively, and some constructions and predicates on these types.
-Note however, that these operations usually involve the projection of
-3D objects onto the \f$ xy\f$-plane.
-
-\cgalRefines{ArrangementXMonotoneTraits_2}
-
-\cgalHasModelsBegin
-\cgalHasModels{CGAL::Env_triangle_traits_3<Kernel>}
-\cgalHasModels{CGAL::Env_sphere_traits_3<ConicTraits>}
-\cgalHasModels{CGAL::Env_plane_traits_3<Kernel>}
-\cgalHasModels{CGAL::Env_surface_data_traits_3<Traits,XyData,SData,Cnv>}
-\cgalHasModelsEnd
-
-*/
+/*! \ingroup PkgEnvelope3Concepts
+ * \cgalConcept
+ *
+ * This concept defines the minimal set of geometric predicates and operations
+ * needed to compute the envelope of a set of arbitrary surfaces in \f$
+ * \mathbb{R}^3\f$. It refines the `ArrangementXMonotoneTraits_2` concept. In
+ * addition to the `Point_2` and `X_monotone_curve_2` types and the
+ * `Has_boundary_category` category tag listed in the base concept, it also
+ * lists the `Surface_3` and `Xy_monotone_surface_3` types, which represent
+ * arbitrary surfaces and \f$ xy\f$-monotone surfaces, respectively, and some
+ * constructions and predicates on these types.  Note however, that these
+ * operations usually involve the projection of 3D objects onto the \f$
+ * xy\f$-plane.
+ *
+ * \cgalRefines{ArrangementXMonotoneTraits_2}
+ *
+ * \cgalHasModelsBegin
+ * \cgalHasModels{CGAL::Env_triangle_traits_3<Kernel, ArrLinearTraits>}
+ * \cgalHasModels{CGAL::Env_sphere_traits_3<ConicTraits>}
+ * \cgalHasModels{CGAL::Env_plane_traits_3<Kernel, ArrLinearTraits>}
+ * \cgalHasModels{CGAL::Env_surface_data_traits_3<Traits,XyData,SData,Cnv>}
+ * \cgalHasModelsEnd
+ */
 
 class EnvelopeTraits_3 {
 public:
 
-/// \name Types
-/// @{
-
-/*!
-represents an arbitrary surface in \f$ \mathbb{R}^3\f$.
-*/
-typedef unspecified_type Surface_3;
-
-/*!
-represents a weakly \f$ xy\f$-monotone surface in \f$ \mathbb{R}^3\f$.
-*/
-typedef unspecified_type Xy_monotone_surface_3;
-
-/// @}
-
-/// \name Functor Types
-/// @{
-
-/*!
-provides the operator (templated by the `OutputIterator` type) :
-<UL>
-<LI>`OutputIterator operator() (Surface_3 S, bool is_lower, OutputIterator oi)`
-<BR>
-which subdivides the given surface `S` into \f$ xy\f$-monotone parts
-and inserts them into the output iterator. The value of
-`is_lower` indicates whether we compute the lower or the upper
-envelope, so that \f$ xy\f$-monotone surfaces that are irrelevant to the
-lower-envelope (resp. upper-envelope) computation may be discarded.
-The value-type of `OutputIterator` is `Xy_monotone_surface_3`.
-The operator returns a past-the-end iterator for the output sequence.
-</UL>
-*/
-typedef unspecified_type Make_xy_monotone_3;
-
-/*!
-provides the operator (templated by the `OutputIterator` type) :
-<UL>
-<LI>`OutputIterator operator() (Xy_monotone_surface_3 s, OutputIterator oi)`
-<BR>
-which computes all planar \f$ x\f$-monotone curves and possibly isolated planar
-points that form the projection of the boundary of the given \f$ xy\f$-monotone
-surface \f$ s\f$ onto the \f$ xy\f$-plane, and inserts them into the output iterator.
-The value-type of `OutputIterator` is `Object`, where `Object`
-wraps either a `Point_2`, or a
-`pair<X_monotone_curve_2, Oriented_side>`. In the former case, the
-object represents an isolated point of the projected boundary. In the latter,
-more general, case the object represents an \f$ x\f$-monotone boundary curve
-along with an enumeration value which is either `ON_NEGATIVE_SIDE`
-or `ON_POSITIVE_SIDE`, indicating whether whether the projection of the
-surface onto the \f$ xy\f$-plane lies below or above this \f$ x\f$-monotone curve,
-respectively. In degenerate case, namely when the surface itself is vertical,
-and its projection onto the plane is \f$ 1\f$-dimensional, the `Oriented_side`
-value is `ON_ORIENTED_BOUNDARY`. The operator returns a past-the-end
-iterator for the output sequence.
-</UL>
-*/
-typedef unspecified_type Construct_projected_boundary_2;
-
-/*!
-provides the operator (templated by the `OutputIterator` type) :
-<UL>
-<LI>`OutputIterator operator() (Xy_monotone_surface_3 s1, Xy_monotone_surface_3 s2, OutputIterator oi)`
-<BR>
-which computes the projection of the intersections of the
-\f$ xy\f$-monotone surfaces `s1` and `s2` onto the \f$ xy\f$-plane,
-and inserts them into the output iterator.
-The value-type of `OutputIterator` is `Object`, where
-each `Object` either wraps a `pair<X_monotone_curve_2,Multiplicity>`
-instance, which represents a projected intersection curve with its
-multiplicity (in case the multiplicity is undefined or not known, it
-should be set to \f$ 0\f$) or an `Point_2` instance, representing the
-projected image of a degenerate intersection (the projection of an
-isolated intersection point, or of a vertical intersection curve).
-The operator returns a past-the-end iterator for the output sequence.
-</UL>
-*/
-typedef unspecified_type Construct_projected_intersections_2;
-
-/*!
-provides the operators :
-<UL>
-<LI> `Comparison_result operator() (Point_2 p, Xy_monotone_surface_3 s1, Xy_monotone_surface_3 s2)`
-<BR>
-which determines the relative \f$ z\f$-order of the two given \f$ xy\f$-monotone
-surfaces at the \f$ xy\f$-coordinates of the point `p`, with the
-precondition that both surfaces are defined over `p`. Namely, it
-returns the comparison result of \f$ s_1(p)\f$ and \f$ s_2(p)\f$.
-<LI>`Comparison_result operator() (X_monotone_curve_2 c, Xy_monotone_surface_3 s1, Xy_monotone_surface_3 s2)`
-<BR>
-which determines the relative \f$ z\f$-order of the two given \f$ xy\f$-monotone
-surfaces over the interior of a given \f$ x\f$-monotone curve \f$ c\f$, with the
-precondition that \f$ c\f$ is fully contained in the \f$ xy\f$-definition range
-of both \f$ s_1\f$ and \f$ s_2\f$, and that the surfaces do not intersect over
-\f$ c\f$. The functor should therefore return the comparison result of
-\f$ s_1(p')\f$ and \f$ s_2(p')\f$ for some point \f$ p'\f$ in the interior of \f$ c\f$.
-<LI>`Comparison_result operator() (Xy_monotone_surface_3 s1, Xy_monotone_surface_3 s2)`
-<BR>
-which determines the relative \f$ z\f$-order of the two given unbounded
-\f$ xy\f$-monotone surfaces, which are defined over the entire \f$ xy\f$-plane and
-have no boundary, with the precondition that the surfaces do not intersect
-at all.
-The functor should therefore return the comparison result of
-\f$ s_1(p)\f$ and \f$ s_2(p)\f$ for some planar point \f$ p \in\mathbb{R}^2\f$.
-This operator is required iff the category tag `Has_boundary_category`
-is defined as `Tag_true`.
-</UL>
-*/
-typedef unspecified_type Compare_z_at_xy_3;
-
-/*!
-provides the operator :
-<UL>
-<LI>`Comparison_result operator() (X_monotone_curve_2 c, Xy_monotone_surface_3 s1,  Xy_monotone_surface_3 s2)`
-<BR>
-which determines the relative \f$ z\f$-order of the two given \f$ xy\f$-monotone
-surfaces immediately above their projected intersection curve
-\f$ c\f$ (a planar point \f$ p\f$ is <I>above</I> an \f$ x\f$-monotone curve \f$ c\f$ if it
-is in the \f$ x\f$-range of \f$ c\f$, and lies to its left when the curve is
-traversed from its \f$ xy\f$-lexicographically smaller endpoint to its
-larger endpoint). We have the precondition that both surfaces are
-defined "above" \f$ c\f$, and their relative \f$ z\f$-order is the same for
-some small enough neighborhood of points above \f$ c\f$.
-</UL>
-*/
-typedef unspecified_type Compare_z_at_xy_above_3;
-
-/*!
-provides the operator :
-<UL>
-<LI>`Comparison_result operator() (X_monotone_curve_2 c,  Xy_monotone_surface_3 s1, Xy_monotone_surface_3 s2)`
-<BR>
-which determines the relative \f$ z\f$-order of the two given \f$ xy\f$-monotone
-surfaces immediately below their projected intersection curve
-\f$ c\f$ (a planar point \f$ p\f$ is <I>below</I> an \f$ x\f$-monotone curve \f$ c\f$ if it
-is in the \f$ x\f$-range of \f$ c\f$, and lies to its right when the curve is
-traversed from its \f$ xy\f$-lexicographically smaller endpoint to its
-larger endpoint). We have the precondition that both surfaces are
-defined "below" \f$ c\f$, and their relative \f$ z\f$-order is the same for
-some small enough neighborhood of points below \f$ c\f$.
-</UL>
-*/
-typedef unspecified_type Compare_z_at_xy_below_3;
-
-/// @}
-
-/// \name Creation
-/// @{
-
-/*!
-default constructor.
-*/
-EnvelopeTraits_3();
-
-/*!
-copy constructor.
-*/
-EnvelopeTraits_3(EnvelopeTraits_3 other);
-
-/*!
-assignment operator.
-*/
-EnvelopeTraits_3 operator=(other);
-
-/// @}
-
-/// \name Accessing Functor Objects
-/// @{
-
-/*!
-
-*/
-Make_xy_monotone_3 make_xy_monotone_3_object();
-
-/*!
-
-*/
-Construct_projected_boundary_2 construct_projected_boundary_2_object();
-
-/*!
-
-*/
-Construct_projected_intersections_2 construct_projected_intersections_2_object();
-
-/*!
-
-*/
-Compare_z_at_xy_3 compare_z_at_xy_3_object();
-
-/*!
-
-*/
-Compare_z_at_xy_above_3 compare_z_at_xy_above_3_object();
-
-/*!
-
-*/
-Compare_z_at_xy_below_3 compare_z_at_xy_below_3_object();
-
-/// @}
+  /// \name Types
+  /// @{
+
+  /*! represents an arbitrary surface in \f$ \mathbb{R}^3\f$.
+   */
+  typedef unspecified_type Surface_3;
+
+  /*! represents a weakly \f$ xy\f$-monotone surface in \f$ \mathbb{R}^3\f$.
+   */
+  typedef unspecified_type Xy_monotone_surface_3;
+
+  /// @}
+
+  /// \name Functor Types
+  /// @{
+
+  /*! provides the operator (templated by the `OutputIterator` type) :
+   * <UL>
+   * <LI>`OutputIterator operator() (Surface_3 S, bool is_lower, OutputIterator oi)`
+   * <BR>
+   * which subdivides the given surface `S` into \f$ xy\f$-monotone parts
+   * and inserts them into the output iterator. The value of
+   * `is_lower` indicates whether we compute the lower or the upper
+   * envelope, so that \f$ xy\f$-monotone surfaces that are irrelevant to the
+   * lower-envelope (resp. upper-envelope) computation may be discarded.
+   * The value-type of `OutputIterator` is `Xy_monotone_surface_3`.
+   * The operator returns a past-the-end iterator for the output sequence.
+   * </UL>
+   */
+  typedef unspecified_type Make_xy_monotone_3;
+
+  /*! provides the operator (templated by the `OutputIterator` type) :
+   * <UL>
+   * <LI>`OutputIterator operator() (Xy_monotone_surface_3 s, OutputIterator oi)`
+   * <BR>
+   * which computes all planar \f$ x\f$-monotone curves and possibly isolated
+   * planar points that form the projection of the boundary of the given
+   * \f$ xy\f$-monotone surface \f$ s\f$ onto the \f$ xy\f$-plane, and inserts
+   * them into the output iterator.
+   * The value-type of `OutputIterator` is `Object`, where `Object` wraps either
+   * a `Point_2`, or a `pair<X_monotone_curve_2, Oriented_side>`. In the former
+   * case, the object represents an isolated point of the projected boundary. In
+   * the latter, more general, case the object represents an \f$ x\f$-monotone
+   * boundary curve along with an enumeration value which is either
+   * `ON_NEGATIVE_SIDE` or `ON_POSITIVE_SIDE`, indicating whether whether the
+   * projection of the surface onto the \f$ xy\f$-plane lies below or above this
+   * \f$ x\f$-monotone curve, respectively. In degenerate case, namely when the
+   * surface itself is vertical, and its projection onto the plane is
+   * \f$ 1\f$-dimensional, the `Oriented_side` value is `ON_ORIENTED_BOUNDARY`.
+   * The operator returns a past-the-end iterator for the output sequence.
+   * </UL>
+   */
+  typedef unspecified_type Construct_projected_boundary_2;
+
+  /*! provides the operator (templated by the `OutputIterator` type) :
+   * <UL>
+   * <LI>`OutputIterator operator() (Xy_monotone_surface_3 s1, Xy_monotone_surface_3 s2, OutputIterator oi)`
+   * <BR>
+   * which computes the projection of the intersections of the
+   * \f$ xy\f$-monotone surfaces `s1` and `s2` onto the \f$ xy\f$-plane,
+   * and inserts them into the output iterator.
+   * The value-type of `OutputIterator` is `Object`, where
+   * each `Object` either wraps a `pair<X_monotone_curve_2,Multiplicity>`
+   * instance, which represents a projected intersection curve with its
+   * multiplicity (in case the multiplicity is undefined or not known, it
+   * should be set to \f$ 0\f$) or an `Point_2` instance, representing the
+   * projected image of a degenerate intersection (the projection of an
+   * isolated intersection point, or of a vertical intersection curve).
+   * The operator returns a past-the-end iterator for the output sequence.
+   * </UL>
+   */
+  typedef unspecified_type Construct_projected_intersections_2;
+
+  /*! provides the operators :
+   * <UL>
+   * <LI> `Comparison_result operator() (Point_2 p, Xy_monotone_surface_3 s1, Xy_monotone_surface_3 s2)`
+   * <BR>
+   * which determines the relative \f$ z\f$-order of the two given
+   * \f$ xy\f$-monotone surfaces at the \f$ xy\f$-coordinates of the point `p`,
+   * with the precondition that both surfaces are defined over `p`. Namely, it
+   * returns the comparison result of \f$ s_1(p)\f$ and \f$ s_2(p)\f$.
+   * <LI>`Comparison_result operator() (X_monotone_curve_2 c, Xy_monotone_surface_3 s1, Xy_monotone_surface_3 s2)`
+   * <BR>
+   * which determines the relative \f$ z\f$-order of the two given
+   * \f$ xy\f$-monotone surfaces over the interior of a given \f$ x\f$-monotone
+   * curve \f$ c\f$, with the precondition that \f$ c\f$ is fully contained in
+   * the \f$ xy\f$-definition range of both \f$ s_1\f$ and \f$ s_2\f$, and that
+   * the surfaces do not intersect over \f$ c\f$. The functor should therefore
+   * return the comparison result of \f$ s_1(p')\f$ and \f$ s_2(p')\f$ for some
+   * point \f$ p'\f$ in the interior of \f$ c\f$.
+   * <LI>`Comparison_result operator() (Xy_monotone_surface_3 s1, Xy_monotone_surface_3 s2)`
+   * <BR>
+   * which determines the relative \f$ z\f$-order of the two given unbounded
+   * \f$ xy\f$-monotone surfaces, which are defined over the entire
+   * \f$ xy\f$-plane and have no boundary, with the precondition that the
+   * surfaces do not intersect at all. The functor should therefore return the
+   * comparison result of \f$ s_1(p)\f$ and \f$ s_2(p)\f$ for some planar point
+   * \f$ p \in\mathbb{R}^2\f$. This operator is required iff the category tag
+   * `Has_boundary_category` is defined as `Tag_true`.
+   * </UL>
+   */
+  typedef unspecified_type Compare_z_at_xy_3;
+
+  /*! provides the operator :
+   * <UL>
+   * <LI>`Comparison_result operator() (X_monotone_curve_2 c, Xy_monotone_surface_3 s1,  Xy_monotone_surface_3 s2)`
+   * <BR>
+   * which determines the relative \f$ z\f$-order of the two given
+   * \f$ xy\f$-monotone surfaces immediately above their projected intersection
+   * curve \f$ c\f$ (a planar point \f$ p\f$ is <I>above</I> an
+   * \f$ x\f$-monotone curve \f$ c\f$ if it is in the \f$ x\f$-range of
+   * \f$ c\f$, and lies to its left when the curve is traversed from its
+   * \f$ xy\f$-lexicographically smaller endpoint to its larger endpoint). We
+   * have the precondition that both surfaces are defined "above" \f$ c\f$, and
+   * their relative \f$ z\f$-order is the same for some small enough
+   * neighborhood of points above \f$ c\f$.
+   * </UL>
+   */
+  typedef unspecified_type Compare_z_at_xy_above_3;
+
+  /*! provides the operator :
+   * <UL>
+   * <LI>`Comparison_result operator() (X_monotone_curve_2 c,  Xy_monotone_surface_3 s1, Xy_monotone_surface_3 s2)`
+   * <BR>
+   * which determines the relative \f$ z\f$-order of the two given
+   * \f$ xy\f$-monotone surfaces immediately below their projected intersection
+   * curve \f$ c\f$ (a planar point \f$ p\f$ is <I>below</I> an
+   * \f$ x\f$-monotone curve \f$ c\f$ if it is in the \f$ x\f$-range of
+   * \f$ c\f$, and lies to its right when the curve is traversed from its
+   * \f$ xy\f$-lexicographically smaller endpoint to its larger endpoint). We
+   * have the precondition that both surfaces are defined "below" \f$ c\f$, and
+   * their relative \f$ z\f$-order is the same for some small enough
+   * neighborhood of points below \f$ c\f$.
+   * </UL>
+   */
+  typedef unspecified_type Compare_z_at_xy_below_3;
+
+  /// @}
+
+  /// \name Creation
+  /// @{
+
+  /*! default constructor.
+   */
+  EnvelopeTraits_3();
+
+  /*! copy constructor.
+   */
+  EnvelopeTraits_3(EnvelopeTraits_3 other);
+
+  /*! assignment operator.
+   */
+  EnvelopeTraits_3 operator=(other);
+
+  /// @}
+
+  /// \name Accessing Functor Objects
+  /// @{
+
+  /*!
+   */
+  Make_xy_monotone_3 make_xy_monotone_3_object();
+
+  /*!
+   */
+  Construct_projected_boundary_2 construct_projected_boundary_2_object();
+
+  /*!
+   */
+  Construct_projected_intersections_2 construct_projected_intersections_2_object();
+
+  /*!
+   */
+  Compare_z_at_xy_3 compare_z_at_xy_3_object();
+
+  /*!
+   */
+  Compare_z_at_xy_above_3 compare_z_at_xy_above_3_object();
+
+  /*!
+   */
+  Compare_z_at_xy_below_3 compare_z_at_xy_below_3_object();
+
+  /// @}
 
 }; /* end EnvelopeTraits_3 */
diff --git a/Envelope_3/doc/Envelope_3/PackageDescription.txt b/Envelope_3/doc/Envelope_3/PackageDescription.txt
index df0fb9366678..7579fff2c1ed 100644
--- a/Envelope_3/doc/Envelope_3/PackageDescription.txt
+++ b/Envelope_3/doc/Envelope_3/PackageDescription.txt
@@ -39,10 +39,9 @@ diagram cell is unique.
 \cgalCRPSection{Classes}
 - `CGAL::Envelope_diagram_2<EnvTraits>`
 
-- `CGAL::Env_triangle_traits_3<Kernel>`
+- `CGAL::Env_triangle_traits_3<Kernel, ArrLinearTraits>`
 - `CGAL::Env_sphere_traits_3<ConicTraits>`
-- `CGAL::Env_plane_traits_3<Kernel>`
+- `CGAL::Env_plane_traits_3<Kernel, ArrLinearTraits>`
 - `CGAL::Env_surface_data_traits_3<Traits,XyData,SData,Cnv>`
 
 */
-
diff --git a/Envelope_3/include/CGAL/Env_plane_traits_3.h b/Envelope_3/include/CGAL/Env_plane_traits_3.h
index 839f6e9553bd..3f9fb48b4cb5 100644
--- a/Envelope_3/include/CGAL/Env_plane_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_plane_traits_3.h
@@ -28,8 +28,9 @@
 
 namespace CGAL {
 
-template <typename Kernel_>
-class Env_plane_traits_3 : public Arr_linear_traits_2<Kernel_> {
+template <typename Kernel_,
+          typename ArrLinearTraits = Arr_linear_traits_2<Kernel_>>
+class Env_plane_traits_3 : public ArrLinearTraits {
 public:
   using Kernel = Kernel_;
   using FT = typename Kernel::FT;
diff --git a/Envelope_3/include/CGAL/Env_triangle_traits_3.h b/Envelope_3/include/CGAL/Env_triangle_traits_3.h
index 10218a7ceb11..0bb6e384c455 100644
--- a/Envelope_3/include/CGAL/Env_triangle_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_triangle_traits_3.h
@@ -34,8 +34,9 @@ namespace CGAL {
 template <typename Kernel_> class Env_triangle_3;
 
 // this traits class supports both triagles and segments in 3d
-template <typename Kernel_>
-class Env_triangle_traits_3 : public Arr_segment_traits_2<Kernel_> {
+template <typename Kernel_,
+          typename ArrSegmentTraits = Arr_segment_traits_2<Kernel_>>
+class Env_triangle_traits_3 : public ArrSegmentTraits {
 public:
   using Traits_2 = Arr_segment_traits_2<Kernel_>;
   using Point_2 = typename Traits_2::Point_2;

From 7d7b08084243e1736ea2cc287190100bf5b8fcb4 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 31 Jan 2024 09:39:45 +0000
Subject: [PATCH 1331/1398] PMP: Change inclusion order to check dependencies

---
 .../corefinement_parallel_union_meshes.cpp    |  3 ++-
 ...usdorff_bounded_error_distance_example.cpp | 13 ++++++------
 .../delaunay_remeshing_test.cpp               |  9 +++++----
 .../Polygon_mesh_processing/extrude_test.cpp  |  4 +++-
 .../Polygon_mesh_processing/fairing_test.cpp  |  7 ++++---
 .../Polygon_mesh_processing/measures_test.cpp |  7 +++----
 .../orient_polygon_mesh_test.cpp              |  8 +++++---
 .../orient_polygon_soup_test.cpp              | 20 ++++++++++---------
 .../pmp_compute_normals_test.cpp              | 11 +++++-----
 .../pmp_do_intersect_test.cpp                 | 14 ++++++-------
 .../point_inside_polyhedron_boundary_test.cpp |  3 +--
 .../point_inside_surface_mesh_test.cpp        |  6 +++---
 .../polygon_mesh_slicer_test.cpp              |  9 ++++++---
 .../remeshing_quality_test.cpp                |  6 ++++--
 .../remeshing_test.cpp                        |  9 +++++----
 .../remeshing_test_P_SM_OM.cpp                | 11 ++++++----
 ...meshing_with_isolated_constraints_test.cpp |  9 +++++----
 .../self_intersection_polyhedron_test.cpp     | 16 +++++++--------
 .../self_intersection_surface_mesh_test.cpp   |  9 +++++----
 .../self_intersection_triangle_soup_test.cpp  |  9 +++++----
 .../surface_intersection_sm_poly.cpp          |  7 ++++---
 .../test_autorefinement.cpp                   |  5 +++--
 .../test_coref_epic_points_identity.cpp       |  4 ++--
 .../Polygon_mesh_processing/test_corefine.cpp |  6 ++++--
 .../test_corefinement_and_constraints.cpp     |  4 ++--
 .../test_corefinement_bool_op.cpp             |  4 ++--
 .../test_decimation_of_planar_patches.cpp     | 14 +++++++------
 ...est_degenerate_pmp_clip_split_corefine.cpp |  3 +--
 .../test_detect_features.cpp                  |  4 ++--
 .../test_does_bound_a_volume.cpp              |  4 ++--
 .../test_hausdorff_bounded_error_distance.cpp | 20 ++++++++++---------
 ...test_interpolated_corrected_curvatures.cpp |  3 ++-
 .../test_is_polygon_soup_a_polygon_mesh.cpp   | 17 ++++++++--------
 .../test_isolevel_refinement.cpp              |  6 +++---
 .../test_merging_border_vertices.cpp          |  8 +++-----
 .../test_mesh_smoothing.cpp                   |  7 ++++---
 .../test_orient_cc.cpp                        |  8 +++++---
 .../Polygon_mesh_processing/test_pmp_clip.cpp |  9 ++++-----
 .../test_pmp_collision_detection.cpp          |  5 +++--
 .../test_pmp_locate.cpp                       | 11 +++++-----
 .../test_pmp_manifoldness.cpp                 |  5 +++--
 .../test_pmp_non_conforming_snapping.cpp      | 15 +++++++-------
 .../test_pmp_np_function.cpp                  | 11 ++++++----
 .../test_pmp_polyhedral_envelope.cpp          | 12 ++++++-----
 .../test_pmp_read_polygon_mesh.cpp            |  4 ++--
 .../test_pmp_remove_border_edge.cpp           |  6 ++++--
 .../test_pmp_repair_degeneracies.cpp          |  8 ++++----
 .../test_pmp_repair_self_intersections.cpp    |  6 +++---
 .../test_pmp_snapping.cpp                     | 12 +++++------
 .../test_pmp_transform.cpp                    |  7 ++++---
 .../test_pmp_triangle.cpp                     |  4 +++-
 .../test_remove_caps_needles.cpp              |  9 +++++----
 .../test_repair_polygon_soup.cpp              |  4 ++--
 .../test_shape_predicates.cpp                 |  9 +++++----
 .../test_shape_smoothing.cpp                  |  6 +++---
 .../test_simplify_polylines_pmp.cpp           |  2 +-
 .../test_split_volume.cpp                     |  7 +++++--
 .../test_stitching.cpp                        | 14 +++++++------
 .../triangulate_faces_test.cpp                |  8 +++++---
 ...ate_hole_Polyhedron_3_no_delaunay_test.cpp | 13 ++++++------
 .../triangulate_hole_Polyhedron_3_test.cpp    |  7 +++++--
 .../triangulate_hole_polyline_test.cpp        |  8 ++++----
 .../triangulate_hole_with_cdt_2_test.cpp      | 19 ++++++++++--------
 63 files changed, 290 insertions(+), 238 deletions(-)

diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_parallel_union_meshes.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_parallel_union_meshes.cpp
index 72bd328a50d5..a8f3c2ea5ee2 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_parallel_union_meshes.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/corefinement_parallel_union_meshes.cpp
@@ -10,6 +10,7 @@
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
 typedef Kernel::Point_3 Point_3;
+typedef Kernel::Aff_transformation_3 Aff_transformation_3;
 typedef CGAL::Surface_mesh<Point_3> Mesh;
 
 namespace PMP = CGAL::Polygon_mesh_processing;
@@ -23,7 +24,7 @@ int main(int argc, char** argv)
   in >> meshes[0];
   for (int i=1; i<nb_copies; ++i)
   {
-    CGAL::Aff_transformation_3<Kernel> trans(CGAL::Translation(),  Kernel::Vector_3(i*0.2, 0, 0));
+    Aff_transformation_3 trans(CGAL::Translation(),  Kernel::Vector_3(i*0.2, 0, 0));
     meshes[i]=meshes[0];
     PMP::transform(trans, meshes[i]);
   }
diff --git a/Polygon_mesh_processing/examples/Polygon_mesh_processing/hausdorff_bounded_error_distance_example.cpp b/Polygon_mesh_processing/examples/Polygon_mesh_processing/hausdorff_bounded_error_distance_example.cpp
index 44f1944be0b4..7fa0cbcd5407 100644
--- a/Polygon_mesh_processing/examples/Polygon_mesh_processing/hausdorff_bounded_error_distance_example.cpp
+++ b/Polygon_mesh_processing/examples/Polygon_mesh_processing/hausdorff_bounded_error_distance_example.cpp
@@ -1,5 +1,4 @@
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Aff_transformation_3.h>
 #include <CGAL/IO/OFF.h>
 
 #include <CGAL/Surface_mesh.h>
@@ -8,15 +7,15 @@
 #include <CGAL/Polygon_mesh_processing/distance.h>
 #include <CGAL/Polygon_mesh_processing/transform.h>
 
-using Kernel   = CGAL::Exact_predicates_inexact_constructions_kernel;
-using FT       = typename Kernel::FT;
-using Point_3  = typename Kernel::Point_3;
-using Vector_3 = typename Kernel::Vector_3;
-
+using Kernel                  = CGAL::Exact_predicates_inexact_constructions_kernel;
+using FT                      = typename Kernel::FT;
+using Point_3                 = typename Kernel::Point_3;
+using Vector_3                = typename Kernel::Vector_3;
+using Affine_transformation_3 = typename Kernel::Aff_transformation_3;
 using TAG                     = CGAL::Sequential_tag;
 using Surface_mesh            = CGAL::Surface_mesh<Point_3>;
 using Polyhedron              = CGAL::Polyhedron_3<Kernel>;
-using Affine_transformation_3 = CGAL::Aff_transformation_3<Kernel>;
+
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/delaunay_remeshing_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/delaunay_remeshing_test.cpp
index d1d70fdd1e2a..74a968ec0950 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/delaunay_remeshing_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/delaunay_remeshing_test.cpp
@@ -1,11 +1,12 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-
-#include <CGAL/Surface_mesh.h>
-#include <CGAL/Polyhedron_3.h>
 #include <CGAL/Polygon_mesh_processing/detect_features.h>
 #include <CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Polyhedron_3.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <vector>
 #include <fstream>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/extrude_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/extrude_test.cpp
index b51bf4553f09..0bada4492f98 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/extrude_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/extrude_test.cpp
@@ -1,7 +1,9 @@
+#include <CGAL/Polygon_mesh_processing/extrude.h>
+
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Polygon_mesh_processing/extrude.h>
+
 #include <iostream>
 #include <fstream>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/fairing_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/fairing_test.cpp
index ac066d3ae1a9..df1531c64291 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/fairing_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/fairing_test.cpp
@@ -1,8 +1,9 @@
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/fair.h>
+
 #include <CGAL/Surface_mesh.h>
 
-#include <CGAL/Polygon_mesh_processing/fair.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <CGAL/Timer.h>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/measures_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/measures_test.cpp
index 3050a34753f7..e406db12ec72 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/measures_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/measures_test.cpp
@@ -1,11 +1,11 @@
 #include <CGAL/Polygon_mesh_processing/measure.h>
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/bbox.h>
 
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/Surface_mesh.h>
 
-#include <CGAL/Polygon_mesh_processing/bbox.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 
 #include <CGAL/Bbox_3.h>
 
@@ -376,4 +376,3 @@ int main(int argc, char* argv[])
   std::cerr << "All done." << std::endl;
   return 0;
 }
-
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_mesh_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_mesh_test.cpp
index ce4855f964f2..4c90f3a17612 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_mesh_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_mesh_test.cpp
@@ -1,8 +1,10 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/orientation.h>
+
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/Surface_mesh.h>
-#include <CGAL/Polygon_mesh_processing/orientation.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 
 #include <CGAL/Timer.h>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_soup_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_soup_test.cpp
index f3c541ab65ca..b72e0397fb19 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_soup_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/orient_polygon_soup_test.cpp
@@ -1,18 +1,20 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-
-#include <CGAL/Polyhedron_3.h>
-#include <CGAL/Surface_mesh.h>
-
-#include <CGAL/Cartesian_converter.h>
-#include <CGAL/IO/polygon_mesh_io.h>
-#include <CGAL/IO/polygon_soup_io.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
 #include <CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/orientation.h>
 #include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/orient_polygon_soup_extension.h>
 
+#include <CGAL/IO/polygon_mesh_io.h>
+#include <CGAL/IO/polygon_soup_io.h>
+
+#include <CGAL/Polyhedron_3.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+
+#include <CGAL/Cartesian_converter.h>
+
 #include <algorithm>
 #include <cstdlib>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp
index 3517709a72ab..20a8e8993a14 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_compute_normals_test.cpp
@@ -1,15 +1,16 @@
 // #define CGAL_PMP_COMPUTE_NORMAL_DEBUG_PP
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-//#include <CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h>
+#include <CGAL/Polygon_mesh_processing/compute_normal.h>
+#include <CGAL/Polygon_mesh_processing/bbox.h>
+#include <CGAL/Polygon_mesh_processing/shape_predicates.h>
 
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
 
 #include <CGAL/centroid.h>
-#include <CGAL/Polygon_mesh_processing/compute_normal.h>
-#include <CGAL/Polygon_mesh_processing/bbox.h>
-#include <CGAL/Polygon_mesh_processing/shape_predicates.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+//#include <CGAL/Exact_predicates_exact_constructions_kernel_with_sqrt.h>
 
 #include <iostream>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_do_intersect_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_do_intersect_test.cpp
index e06960044186..f9a083c580ec 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_do_intersect_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/pmp_do_intersect_test.cpp
@@ -1,17 +1,17 @@
+#include <CGAL/Polygon_mesh_processing/intersection.h>
 
-#include <cstdlib>
-#include <iostream>
-#include <fstream>
-#include <sstream>
+#include <CGAL/Surface_mesh.h>
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <CGAL/Polygon_mesh_processing/intersection.h>
-
-#include <CGAL/Surface_mesh.h>
 
 #include <CGAL/Timer.h>
 
+#include <cstdlib>
+#include <iostream>
+#include <fstream>
+#include <sstream>
+
 typedef CGAL::Exact_predicates_inexact_constructions_kernel     Epic;
 typedef CGAL::Exact_predicates_exact_constructions_kernel       Epec;
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/point_inside_polyhedron_boundary_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/point_inside_polyhedron_boundary_test.cpp
index 0421bb411fc8..7029c29a2f8e 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/point_inside_polyhedron_boundary_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/point_inside_polyhedron_boundary_test.cpp
@@ -1,7 +1,6 @@
-
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Side_of_triangle_mesh.h>
 #include <CGAL/Polyhedron_3.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include "point_inside_helpers.h"
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/point_inside_surface_mesh_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/point_inside_surface_mesh_test.cpp
index b0be112cfbc1..ef7bf8f9e992 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/point_inside_surface_mesh_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/point_inside_surface_mesh_test.cpp
@@ -1,11 +1,11 @@
+#include <CGAL/Side_of_triangle_mesh.h>
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/AABB_face_graph_triangle_primitive.h>
 #include <CGAL/boost/graph/helpers.h>
 
-#include <CGAL/Side_of_triangle_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 
 #include "point_inside_helpers.h"
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/polygon_mesh_slicer_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/polygon_mesh_slicer_test.cpp
index add77378cbc9..d74eb2fba20a 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/polygon_mesh_slicer_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/polygon_mesh_slicer_test.cpp
@@ -1,20 +1,23 @@
 // #define USE_SURFACE_MESH
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_slicer.h>
+
 #ifdef USE_SURFACE_MESH
 #include <CGAL/Surface_mesh.h>
 #else
 #include <CGAL/Polyhedron_3.h>
 #endif
+
 #include <CGAL/AABB_halfedge_graph_segment_primitive.h>
 
-#include <CGAL/Polygon_mesh_slicer.h>
 #include <CGAL/Polygon_mesh_processing/orientation.h>
 #include <CGAL/AABB_tree.h>
 #include <CGAL/AABB_traits.h>
 #include <CGAL/Polygon_2.h>
 
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+
 #include <fstream>
 #include <cassert>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
index 7ab20cda4246..ada019dee942 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_quality_test.cpp
@@ -1,9 +1,11 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/remesh.h>
 #include <CGAL/Polygon_mesh_processing/Adaptive_sizing_field.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <fstream>
 #include <limits>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_test.cpp
index 40067cea5120..e8d69008fb04 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_test.cpp
@@ -7,17 +7,18 @@
 //#define CGAL_PMP_REMESHING_VERY_VERBOSE
 //#define CGAL_PMP_REMESHING_EXPENSIVE_DEBUG
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-
-#include <CGAL/Surface_mesh.h>
-
 #include <CGAL/Polygon_mesh_processing/remesh.h>
 #include <CGAL/Polygon_mesh_processing/border.h>
 #include <CGAL/Polygon_mesh_processing/connected_components.h>
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
 #include <CGAL/Polygon_mesh_processing/detect_features.h>
 
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <CGAL/Timer.h>
+
 #include <fstream>
 #include <vector>
 #include <cstdlib>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_test_P_SM_OM.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_test_P_SM_OM.cpp
index eeebc63b3011..91deed70c468 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_test_P_SM_OM.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_test_P_SM_OM.cpp
@@ -1,14 +1,17 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/remesh.h>
+
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
-#include <fstream>
-#include <map>
 #include <OpenMesh/Core/IO/MeshIO.hh>
 #include <OpenMesh/Core/Mesh/PolyMesh_ArrayKernelT.hh>
 #include <OpenMesh/Core/Mesh/TriMesh_ArrayKernelT.hh>
 #include <CGAL/boost/graph/graph_traits_PolyMesh_ArrayKernelT.h>
 #include <CGAL/boost/graph/graph_traits_TriMesh_ArrayKernelT.h>
-#include <CGAL/Polygon_mesh_processing/remesh.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
+#include <fstream>
+#include <map>
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_with_isolated_constraints_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_with_isolated_constraints_test.cpp
index 4e7ebe960925..115f245a9bbf 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_with_isolated_constraints_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/remeshing_with_isolated_constraints_test.cpp
@@ -1,10 +1,11 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
+#include <CGAL/Polygon_mesh_processing/remesh.h>
+#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
 
+#include <CGAL/Surface_mesh.h>
 #include <CGAL/boost/graph/helpers.h>
 #include <CGAL/boost/graph/generators.h>
-#include <CGAL/Polygon_mesh_processing/remesh.h>
-#include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <fstream>
 #include <iostream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_polyhedron_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_polyhedron_test.cpp
index 1d1991ee86bc..1c26f47456a5 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_polyhedron_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_polyhedron_test.cpp
@@ -1,15 +1,15 @@
-#include <cstdlib>
-#include <iostream>
-#include <fstream>
-#include <sstream>
+#include <CGAL/Polygon_mesh_processing/self_intersections.h>
+
+#include <CGAL/Polyhedron_3.h>
+#include <CGAL/Timer.h>
 
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 
-#include <CGAL/Polyhedron_3.h>
-#include <CGAL/Polygon_mesh_processing/self_intersections.h>
-
-#include <CGAL/Timer.h>
+#include <cstdlib>
+#include <iostream>
+#include <fstream>
+#include <sstream>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel     Epic;
 typedef CGAL::Exact_predicates_exact_constructions_kernel       Epec;
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_surface_mesh_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_surface_mesh_test.cpp
index 6e017c948c0b..1e64267703a4 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_surface_mesh_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_surface_mesh_test.cpp
@@ -1,12 +1,13 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-
-#include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+
+#include <CGAL/Surface_mesh.h>
 #include <CGAL/tags.h>
 #include <CGAL/Timer.h>
 
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+
 #include <cstdlib>
 #include <iostream>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_triangle_soup_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_triangle_soup_test.cpp
index e067e13c129c..2cddabbdb964 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_triangle_soup_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/self_intersection_triangle_soup_test.cpp
@@ -1,11 +1,12 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-
-#include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
 #include <CGAL/IO/polygon_soup_io.h>
 #include <CGAL/tags.h>
+
 #include <CGAL/Timer.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 
 #include <cstdlib>
 #include <iostream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/surface_intersection_sm_poly.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/surface_intersection_sm_poly.cpp
index 04f7ddf5ee95..646f75e85db3 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/surface_intersection_sm_poly.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/surface_intersection_sm_poly.cpp
@@ -1,15 +1,16 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/intersection.h>
+
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/Linear_cell_complex_for_combinatorial_map.h>
 #include <CGAL/boost/graph/graph_traits_Linear_cell_complex_for_combinatorial_map.h>
 #include <CGAL/Linear_cell_complex_for_bgl_combinatorial_map_helper.h>
 #include <CGAL/iterator.h>
-
-#include <CGAL/Polygon_mesh_processing/intersection.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 #include <CGAL/Timer.h>
 
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <iostream>
 #include <fstream>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cpp
index 3af3402a5f22..e04e07ba556e 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_autorefinement.cpp
@@ -1,5 +1,3 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
 
 #include <CGAL/Polygon_mesh_processing/intersection.h>
 #include <CGAL/Polygon_mesh_processing/corefinement.h>
@@ -8,6 +6,9 @@
 
 #include <CGAL/IO/polygon_soup_io.h>
 
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <fstream>
 #include <sstream>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_coref_epic_points_identity.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_coref_epic_points_identity.cpp
index 03a50620020a..4c12d15f5de1 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_coref_epic_points_identity.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_coref_epic_points_identity.cpp
@@ -1,6 +1,6 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/corefinement.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <iostream>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefine.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefine.cpp
index 31e4f9c71f2c..f5f59e4419be 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefine.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefine.cpp
@@ -1,7 +1,9 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/corefinement.h>
+
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
-#include <CGAL/Polygon_mesh_processing/corefinement.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <iostream>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
index 6508c4533375..b88c1c712727 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_and_constraints.cpp
@@ -1,6 +1,6 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/corefinement.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <iostream>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_bool_op.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_bool_op.cpp
index 8356106a9b1d..49a182d2bd31 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_bool_op.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_corefinement_bool_op.cpp
@@ -2,9 +2,9 @@
 // #define CGAL_COREFINEMENT_DEBUG
 #define  CGAL_USE_DERIVED_SURFACE_MESH
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/corefinement.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <iostream>
 #include <vector>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_decimation_of_planar_patches.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_decimation_of_planar_patches.cpp
index 8666d862dc41..7ee0c4861066 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_decimation_of_planar_patches.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_decimation_of_planar_patches.cpp
@@ -1,9 +1,3 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#ifdef USE_POLYHEDRON
-#include <CGAL/Polyhedron_3.h>
-#else
-#include <CGAL/Surface_mesh.h>
-#endif
 #include <CGAL/Polygon_mesh_processing/remesh_planar_patches.h>
 #include <CGAL/Polygon_mesh_processing/region_growing.h>
 #include <CGAL/Polygon_mesh_processing/manifoldness.h>
@@ -12,6 +6,14 @@
 #include <CGAL/Polygon_mesh_processing/remesh.h>
 #include <CGAL/subdivision_method_3.h>
 
+#ifdef USE_POLYHEDRON
+#include <CGAL/Polyhedron_3.h>
+#else
+#include <CGAL/Surface_mesh.h>
+#endif
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <iostream>
 #include <fstream>
 #include <sstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_degenerate_pmp_clip_split_corefine.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_degenerate_pmp_clip_split_corefine.cpp
index 0decb1164994..1027c841cfbd 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_degenerate_pmp_clip_split_corefine.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_degenerate_pmp_clip_split_corefine.cpp
@@ -1,8 +1,7 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Polygon_mesh_processing/clip.h>
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
-
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 // #define CGAL_DEBUG_PMP_CLIP
 
 // TODO: test coref
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_detect_features.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_detect_features.cpp
index e2d84414b1fb..5e558a287d09 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_detect_features.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_detect_features.cpp
@@ -1,7 +1,7 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/detect_features.h>
 #include <CGAL/Surface_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
-#include <CGAL/Polygon_mesh_processing/detect_features.h>
 #include <CGAL/Real_timer.h>
 
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_does_bound_a_volume.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_does_bound_a_volume.cpp
index b19f892b98c2..e8c2dbc8678a 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_does_bound_a_volume.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_does_bound_a_volume.cpp
@@ -1,6 +1,6 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/orientation.h>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <iostream>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_hausdorff_bounded_error_distance.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_hausdorff_bounded_error_distance.cpp
index dc5269ac7162..3e011b42feea 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_hausdorff_bounded_error_distance.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_hausdorff_bounded_error_distance.cpp
@@ -4,22 +4,24 @@
 // Use this def in order to get all DEBUG info related to the bounded-error Hausdorff code!
 #define CGAL_HAUSDORFF_DEBUG
 
-#include <CGAL/Simple_cartesian.h>
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
-#include <CGAL/Polyhedron_3.h>
-
-#include <CGAL/Aff_transformation_3.h>
-#include <CGAL/Bbox_3.h>
-#include <CGAL/IO/PLY.h>
 #include <CGAL/Polygon_mesh_processing/bbox.h>
 #include <CGAL/Polygon_mesh_processing/distance.h>
 #include <CGAL/Polygon_mesh_processing/remesh.h>
 #include <CGAL/Polygon_mesh_processing/random_perturbation.h>
 #include <CGAL/Polygon_mesh_processing/transform.h>
+#include <CGAL/Aff_transformation_3.h>
+#include <CGAL/Bbox_3.h>
+#include <CGAL/IO/PLY.h>
+
 #include <CGAL/Real_timer.h>
 
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Polyhedron_3.h>
+
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+
 using SCK   = CGAL::Simple_cartesian<double>;
 using EPICK = CGAL::Exact_predicates_inexact_constructions_kernel;
 using EPECK = CGAL::Exact_predicates_exact_constructions_kernel;
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
index c6a578c795a8..412443a42c74 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_interpolated_corrected_curvatures.cpp
@@ -1,4 +1,3 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Polygon_mesh_processing/interpolated_corrected_curvatures.h>
 #include <CGAL/Polygon_mesh_processing/random_perturbation.h>
 #include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
@@ -6,6 +5,8 @@
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/property_map.h>
 
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <boost/graph/graph_traits.hpp>
 
 #include <iostream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_is_polygon_soup_a_polygon_mesh.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_is_polygon_soup_a_polygon_mesh.cpp
index ce72e576c507..a2843ecae8ca 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_is_polygon_soup_a_polygon_mesh.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_is_polygon_soup_a_polygon_mesh.cpp
@@ -1,17 +1,18 @@
-#include <CGAL/Simple_cartesian.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-
-#include <CGAL/Polyhedron_3.h>
-#include <CGAL/boost/graph/graph_traits_Polyhedron_3.h>
+#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
+#include <CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h>
+#include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
 
 #include <CGAL/boost/graph/helpers.h>
 #include <CGAL/boost/graph/property_maps.h>
 #include <CGAL/Dynamic_property_map.h>
-#include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
-#include <CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h>
-#include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
+
 #include <CGAL/IO/OFF.h>
 
+#include <CGAL/Polyhedron_3.h>
+
+#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+
 #include <array>
 #include <string>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_isolevel_refinement.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_isolevel_refinement.cpp
index 9e07c8314352..c61697135dd5 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_isolevel_refinement.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_isolevel_refinement.cpp
@@ -1,9 +1,9 @@
-#include <CGAL/Simple_cartesian.h>
-#include <CGAL/Surface_mesh.h>
-
 #include <CGAL/Polygon_mesh_processing/refine_mesh_at_isolevel.h>
 #include <CGAL/Polygon_mesh_processing/connected_components.h>
 
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Simple_cartesian.h>
+
 #include <fstream>
 #include <iostream>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_merging_border_vertices.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_merging_border_vertices.cpp
index 2bb8c3cc3fbc..228f3b4c558b 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_merging_border_vertices.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_merging_border_vertices.cpp
@@ -1,11 +1,9 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
-
 #include <CGAL/Polygon_mesh_processing/merge_border_vertices.h>
-#include <CGAL/boost/graph/graph_traits_Surface_mesh.h>
 
-#include <fstream>
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
+#include <fstream>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
 typedef CGAL::Surface_mesh<K::Point_3> Surface_mesh;
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_mesh_smoothing.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_mesh_smoothing.cpp
index 986bdca5b533..de001979aad5 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_mesh_smoothing.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_mesh_smoothing.cpp
@@ -1,9 +1,10 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/angle_and_area_smoothing.h>
+#include <CGAL/Polygon_mesh_processing/tangential_relaxation.h>
 
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
-#include <CGAL/Polygon_mesh_processing/angle_and_area_smoothing.h>
-#include <CGAL/Polygon_mesh_processing/tangential_relaxation.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <CGAL/property_map.h>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_orient_cc.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_orient_cc.cpp
index 827e169310b9..03076dc39d64 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_orient_cc.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_orient_cc.cpp
@@ -1,10 +1,12 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/orientation.h>
+#include <CGAL/Polygon_mesh_processing/corefinement.h>
+
 #include <CGAL/Surface_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <CGAL/boost/graph/named_params_helper.h>
-#include <CGAL/Polygon_mesh_processing/orientation.h>
-#include <CGAL/Polygon_mesh_processing/corefinement.h>
 #include <CGAL/Timer.h>
+
 #include <iostream>
 #include <fstream>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_clip.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_clip.cpp
index c564403312a0..eb38a6ad144f 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_clip.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_clip.cpp
@@ -1,10 +1,11 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Polygon_mesh_processing/clip.h>
+#include <CGAL/Polygon_mesh_processing/transform.h>
+
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
-#include <CGAL/Polygon_mesh_processing/transform.h>
 
-#include <CGAL/boost/graph/Face_filtered_graph.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <boost/property_map/property_map.hpp>
 
 #include <iostream>
@@ -879,5 +880,3 @@ int main()
   std::cout << "Done!" << std::endl;
   return EXIT_SUCCESS;
 }
-
-
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_collision_detection.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_collision_detection.cpp
index e8e28c9c2bd8..986f3b8768ec 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_collision_detection.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_collision_detection.cpp
@@ -1,8 +1,9 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Rigid_triangle_mesh_collision_detection.h>
+
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
 
-#include <CGAL/Rigid_triangle_mesh_collision_detection.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <iostream>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
index d0554ebc9a6e..2ef00998069e 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_locate.cpp
@@ -1,6 +1,4 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Polygon_mesh_processing/locate.h>
 
 // Graphs
 #include <CGAL/Polyhedron_3.h>
@@ -9,7 +7,9 @@
 #include <CGAL/boost/graph/graph_traits_Regular_triangulation_2.h>
 #include <CGAL/boost/graph/properties_Regular_triangulation_2.h>
 
-#include <CGAL/Polygon_mesh_processing/locate.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Simple_cartesian.h>
 
 #include <CGAL/AABB_tree.h>
 #include <CGAL/AABB_face_graph_triangle_primitive.h>
@@ -23,12 +23,11 @@
 #include <CGAL/Origin.h>
 #include <CGAL/property_map.h>
 #include <CGAL/Random.h>
-#include <CGAL/Unique_hash_map.h>
 
 #include <boost/graph/graph_traits.hpp>
 #include <boost/graph/properties.hpp>
-#include <optional>
 
+#include <optional>
 #include <fstream>
 #include <iostream>
 #include <limits>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_manifoldness.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_manifoldness.cpp
index bd48a31364a0..4bf08dd6c34c 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_manifoldness.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_manifoldness.cpp
@@ -1,10 +1,11 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/repair.h>
 
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/Surface_mesh.h>
 
 #include <CGAL/boost/graph/named_params_helper.h>
-#include <CGAL/Polygon_mesh_processing/repair.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <cassert>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_non_conforming_snapping.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_non_conforming_snapping.cpp
index d091b7a3d25f..67390e17648d 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_non_conforming_snapping.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_non_conforming_snapping.cpp
@@ -1,21 +1,21 @@
 //#define CGAL_PMP_SNAP_DEBUG_PP
 //#define CGAL_PMP_SNAP_DEBUG_OUTPUT
 
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-
-#include <CGAL/Polyhedron_3.h>
-#include <CGAL/Polyhedron_items_with_id_3.h>
-#include <CGAL/Surface_mesh.h>
-
 #include <CGAL/Polygon_mesh_processing/border.h>
 #include <CGAL/Polygon_mesh_processing/internal/Snapping/snap.h>
 #include <CGAL/Polygon_mesh_processing/orient_polygon_soup.h>
 #include <CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h>
 
+#include <CGAL/Polyhedron_3.h>
+#include <CGAL/Polyhedron_items_with_id_3.h>
+#include <CGAL/Surface_mesh.h>
+
 #include <CGAL/property_map.h>
 #include <CGAL/IO/STL.h>
 
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <array>
 #include <iostream>
 #include <fstream>
@@ -169,4 +169,3 @@ int main(int, char**)
 
   return EXIT_SUCCESS;
 }
-
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_np_function.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_np_function.cpp
index a9b59a6ffaa6..ed5d96771656 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_np_function.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_np_function.cpp
@@ -1,12 +1,15 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/compute_normal.h>
+#include <CGAL/boost/graph/named_params_helper.h>
+#include <CGAL/Named_function_parameters.h>
+
 #include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <sstream>
 #include <iostream>
 #include <unordered_map>
 
-#include <CGAL/boost/graph/named_params_helper.h>
-#include <CGAL/Named_function_parameters.h>
-#include <CGAL/Polygon_mesh_processing/compute_normal.h>
 
 namespace CGAL {
 template <class PolygonMesh,
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_polyhedral_envelope.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_polyhedral_envelope.cpp
index 1e669ff1039e..1676f97a4b1c 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_polyhedral_envelope.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_polyhedral_envelope.cpp
@@ -1,10 +1,12 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
-#include <CGAL/Polyhedron_3.h>
-#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 #include <CGAL/Polyhedral_envelope.h>
 #include <CGAL/Polygon_mesh_processing/repair_self_intersections.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Polyhedron_3.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 
 namespace PMP = CGAL::Polygon_mesh_processing;
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_read_polygon_mesh.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_read_polygon_mesh.cpp
index 1727cdfaee47..447fe007c99b 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_read_polygon_mesh.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_read_polygon_mesh.cpp
@@ -1,4 +1,4 @@
-#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
 
 #include <CGAL/Surface_mesh.h>
 
@@ -8,7 +8,7 @@
 #include <CGAL/Linear_cell_complex_for_bgl_combinatorial_map_helper.h>
 #include <CGAL/boost/graph/graph_traits_Linear_cell_complex_for_combinatorial_map.h>
 
-#include <CGAL/Polygon_mesh_processing/IO/polygon_mesh_io.h>
+#include <CGAL/Simple_cartesian.h>
 
 #include <fstream>
 #include <vector>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_remove_border_edge.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_remove_border_edge.cpp
index a94e1adadc64..e832627b1629 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_remove_border_edge.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_remove_border_edge.cpp
@@ -1,7 +1,9 @@
-#include <CGAL/Simple_cartesian.h>
+#include <CGAL/Polygon_mesh_processing/repair.h>
+
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
-#include <CGAL/Polygon_mesh_processing/repair.h>
+
+#include <CGAL/Simple_cartesian.h>
 
 #include <fstream>
 #include <cassert>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_repair_degeneracies.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_repair_degeneracies.cpp
index de7e7a2d49ec..847e9dbf6155 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_repair_degeneracies.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_repair_degeneracies.cpp
@@ -1,14 +1,14 @@
 #define CGAL_PMP_DEBUG_SMALL_CC_REMOVAL
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/connected_components.h>
+#include <CGAL/Polygon_mesh_processing/repair.h>
 
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/Polyhedron_items_with_id_3.h>
 
-#include <CGAL/Polygon_mesh_processing/connected_components.h>
-#include <CGAL/Polygon_mesh_processing/repair.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 
 #include <iostream>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_repair_self_intersections.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_repair_self_intersections.cpp
index 822ab16169a8..116e0d57db1c 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_repair_self_intersections.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_repair_self_intersections.cpp
@@ -3,12 +3,12 @@
 #define CGAL_PMP_REMOVE_SELF_INTERSECTION_DEBUG
 #define CGAL_PMP_REMOVE_SELF_INTERSECTION_OUTPUT
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
-
 #include <CGAL/Polygon_mesh_processing/repair.h>
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
 
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <iostream>
 #include <fstream>
 #include <unordered_map>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_snapping.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_snapping.cpp
index fa5fd3ba4793..3c2355717b9d 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_snapping.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_snapping.cpp
@@ -1,18 +1,18 @@
 // #define CGAL_PMP_SNAP_DEBUG_PP
 
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/border.h>
+#include <CGAL/Polygon_mesh_processing/internal/Snapping/snap.h>
+#include <CGAL/Polygon_mesh_processing/internal/Snapping/helper.h>
 
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/Polyhedron_items_with_id_3.h>
 #include <CGAL/Surface_mesh.h>
 
-#include <CGAL/Polygon_mesh_processing/border.h>
-#include <CGAL/Polygon_mesh_processing/internal/Snapping/helper.h>
-#include <CGAL/Polygon_mesh_processing/internal/Snapping/snap.h>
-
 #include <CGAL/property_map.h>
 
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <iostream>
 #include <fstream>
 #include <set>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_transform.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_transform.cpp
index 65d64eb1cbe8..695d4862623f 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_transform.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_transform.cpp
@@ -1,11 +1,12 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Polygon_mesh_processing/transform.h>
-#include <iostream>
-#include <fstream>
 
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Aff_transformation_3.h>
 
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
+#include <iostream>
+#include <fstream>
 
 
 namespace PMP = CGAL::Polygon_mesh_processing;
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_triangle.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_triangle.cpp
index 6009318480d4..3bf1d7619344 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_triangle.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_pmp_triangle.cpp
@@ -1,8 +1,10 @@
 #include <CGAL/Polygon_mesh_processing/triangle.h>
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/boost/graph/generators.h>
 
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
 typedef K::Point_3 Point_3;
 typedef K::Triangle_3 Triangle_3;
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_remove_caps_needles.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_remove_caps_needles.cpp
index fa80d93caf0b..505a731ed892 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_remove_caps_needles.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_remove_caps_needles.cpp
@@ -1,12 +1,13 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
-
 #include <CGAL/Polygon_mesh_processing/self_intersections.h>
-#include <fstream>
 #include <CGAL/Polygon_mesh_processing/repair_degeneracies.h>
+
 #include <CGAL/Polyhedral_envelope.h>
 #include <CGAL/Polygon_mesh_processing/measure.h>
 
+#include <CGAL/Surface_mesh.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
+#include <fstream>
 #include <iostream>
 #include <vector>
 
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_repair_polygon_soup.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_repair_polygon_soup.cpp
index 4b9b0abbd3e0..e57d9b6903bd 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_repair_polygon_soup.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_repair_polygon_soup.cpp
@@ -1,11 +1,11 @@
 #define CGAL_PMP_REPAIR_POLYGON_SOUP_VERBOSE_PP
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-
 #include <CGAL/Polygon_mesh_processing/repair_polygon_soup.h>
 
 #include <CGAL/Surface_mesh.h>
 
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <algorithm>
 #include <deque>
 #include <iostream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_shape_predicates.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_shape_predicates.cpp
index 7b1ef20f6a67..17228d4603ff 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_shape_predicates.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_shape_predicates.cpp
@@ -1,14 +1,15 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/shape_predicates.h>
+#include <CGAL/Polygon_mesh_processing/repair.h>
 
 #include <CGAL/Surface_mesh.h>
 
-#include <CGAL/Polygon_mesh_processing/repair.h>
-#include <CGAL/Polygon_mesh_processing/shape_predicates.h>
-
 #include <CGAL/number_type_config.h>
 
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <fstream>
 #include <iostream>
+#include <vector>
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel         K;
 typedef K::FT                                                       FT;
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_shape_smoothing.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_shape_smoothing.cpp
index 7ed64301e90a..3d726ff3d244 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_shape_smoothing.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_shape_smoothing.cpp
@@ -1,13 +1,13 @@
 #define CGAL_PMP_SMOOTHING_DEBUG
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/smooth_shape.h>
+#include <CGAL/Polygon_mesh_processing/measure.h>
 
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
 #include <CGAL/Polyhedron_items_with_id_3.h>
 
-#include <CGAL/Polygon_mesh_processing/measure.h>
-#include <CGAL/Polygon_mesh_processing/smooth_shape.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <CGAL/utility.h>
 #include <CGAL/use.h>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_simplify_polylines_pmp.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_simplify_polylines_pmp.cpp
index de196c65e643..770b055db8d6 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_simplify_polylines_pmp.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_simplify_polylines_pmp.cpp
@@ -1,5 +1,5 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Polygon_mesh_processing/internal/simplify_polyline.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <vector>
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_split_volume.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_split_volume.cpp
index 167625a4bb5f..a6ef851b78d0 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_split_volume.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_split_volume.cpp
@@ -1,8 +1,11 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
 #include <CGAL/Polygon_mesh_processing/orientation.h>
 #include <CGAL/boost/graph/Face_filtered_graph.h>
 #include <CGAL/Polygon_mesh_processing/transform.h>
+
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <boost/core/ref.hpp>
 
 #include <iostream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_stitching.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_stitching.cpp
index 1b78eb8ca752..d5d2fa63b9d8 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/test_stitching.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/test_stitching.cpp
@@ -1,15 +1,17 @@
 // #define CGAL_PMP_STITCHING_DEBUG_PP
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <CGAL/Polyhedron_3.h>
-#include <CGAL/Surface_mesh.h>
+#include <CGAL/Polygon_mesh_processing/stitch_borders.h>
+#include <CGAL/Polygon_mesh_processing/border.h>
 
 #include <CGAL/boost/graph/named_params_helper.h>
 #include <CGAL/boost/graph/copy_face_graph.h>
 #include <CGAL/Dynamic_property_map.h>
-#include <CGAL/Polygon_mesh_processing/border.h>
-#include <CGAL/Polygon_mesh_processing/stitch_borders.h>
+
+#include <CGAL/Polyhedron_3.h>
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 
 #include <algorithm>
 #include <deque>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_faces_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_faces_test.cpp
index 66085b83c745..8b7b8f345563 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_faces_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_faces_test.cpp
@@ -1,6 +1,3 @@
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <CGAL/Surface_mesh.h>
 
 #include <CGAL/Polygon_mesh_processing/triangulate_faces.h>
 
@@ -10,6 +7,11 @@
 #include <CGAL/centroid.h>
 #include <CGAL/Polygon_mesh_processing/polygon_mesh_to_polygon_soup.h>
 
+#include <CGAL/Surface_mesh.h>
+
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+
 #include <boost/graph/filtered_graph.hpp>
 
 #include <fstream>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp
index 133060f0288e..5b87e5dff42b 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_no_delaunay_test.cpp
@@ -1,23 +1,22 @@
 //#define POLY
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
 #include <CGAL/Polygon_mesh_processing/internal/Hole_filling/do_not_use_DT3.h>
+#include <CGAL/Polygon_mesh_processing/triangulate_hole.h>
+
 #ifdef POLY
 #include <CGAL/Polyhedron_3.h>
 #else
 #include <CGAL/Surface_mesh.h>
 #endif
-#include <CGAL/boost/graph/helpers.h>
-
-#include <CGAL/Polygon_mesh_processing/triangulate_hole.h>
-
-#include <CGAL/assertions.h>
 
+#include <CGAL/boost/graph/helpers.h>
 #include <CGAL/boost/graph/Euler_operations.h>
 
 #include <CGAL/Weights/uniform_weights.h>
 
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+
 #include <cassert>
 #include <vector>
 #include <set>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp
index 146eed2fd875..d2c69c01591b 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_Polyhedron_3_test.cpp
@@ -1,6 +1,8 @@
 //#define POLY
 
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/triangulate_hole.h>
+
+
 #ifdef POLY
 #include <CGAL/Polyhedron_3.h>
 #else
@@ -10,9 +12,10 @@
 #include <CGAL/boost/graph/helpers.h>
 #include <CGAL/assertions.h>
 #include <CGAL/boost/graph/Euler_operations.h>
-#include <CGAL/Polygon_mesh_processing/triangulate_hole.h>
 #include <CGAL/Weights/uniform_weights.h>
 
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+
 #include <cassert>
 #include <vector>
 #include <set>
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_polyline_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_polyline_test.cpp
index 7e96e187d915..3cf12f057016 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_polyline_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_polyline_test.cpp
@@ -1,6 +1,4 @@
-
-#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
-#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+#include <CGAL/Polygon_mesh_processing/triangulate_hole.h>
 
 #include <cassert>
 #include <vector>
@@ -10,7 +8,9 @@
 #include <CGAL/Polyhedron_incremental_builder_3.h>
 #include <CGAL/Polyhedron_3.h>
 
-#include <CGAL/Polygon_mesh_processing/triangulate_hole.h>
+#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
+#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
+
 
 typedef CGAL::Exact_predicates_inexact_constructions_kernel  Epic;
 typedef CGAL::Exact_predicates_exact_constructions_kernel  Epec;
diff --git a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_with_cdt_2_test.cpp b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_with_cdt_2_test.cpp
index 8f1ede58b930..06bfc441eefe 100644
--- a/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_with_cdt_2_test.cpp
+++ b/Polygon_mesh_processing/test/Polygon_mesh_processing/triangulate_hole_with_cdt_2_test.cpp
@@ -1,17 +1,20 @@
-#include <set>
-#include <vector>
-#include <fstream>
-#include <cassert>
-#include <string>
-
 #define CGAL_NO_CDT_2_WARNING
 
+#include <CGAL/Polygon_mesh_processing/triangulate_hole.h>
+#include <CGAL/Polygon_mesh_processing/orientation.h>
+
 #include <CGAL/Surface_mesh.h>
 #include <CGAL/Polyhedron_3.h>
+
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 #include <CGAL/Exact_predicates_exact_constructions_kernel.h>
-#include <CGAL/Polygon_mesh_processing/triangulate_hole.h>
-#include <CGAL/Polygon_mesh_processing/orientation.h>
+
+#include <set>
+#include <vector>
+#include <fstream>
+#include <cassert>
+#include <string>
+
 
 template<
 class PolygonMesh,

From 5b187bd79db0a582da60496365c5c9cac8957d66 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 31 Jan 2024 11:10:00 +0000
Subject: [PATCH 1332/1398] Provide a fix for distance.h

---
 .../CGAL/Polygon_mesh_processing/distance.h   | 22 +++++++++++--------
 1 file changed, 13 insertions(+), 9 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
index b3aaf70604f6..a071b3591d07 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/distance.h
@@ -1449,6 +1449,8 @@ bounded_error_squared_Hausdorff_distance_impl(const TriangleMesh1& tm1,
   using Point_3 = typename Kernel::Point_3;
   using Triangle_3 = typename Kernel::Triangle_3;
 
+  auto midpoint = Kernel().construct_midpoint_3_object();
+
 #ifdef CGAL_HAUSDORFF_DEBUG
   std::cout << " -- Bounded Hausdorff --" << std::endl;
   std::cout << "error bound: " << error_bound << std::endl;
@@ -1645,9 +1647,9 @@ bounded_error_squared_Hausdorff_distance_impl(const TriangleMesh1& tm1,
     }
 
     // Subdivide the triangle into four smaller triangles.
-    const Point_3 v01 = CGAL::midpoint(v0, v1);
-    const Point_3 v02 = CGAL::midpoint(v0, v2);
-    const Point_3 v12 = CGAL::midpoint(v1, v2);
+    const Point_3 v01 = midpoint(v0, v1);
+    const Point_3 v02 = midpoint(v0, v2);
+    const Point_3 v12 = midpoint(v1, v2);
     const std::array<Triangle_3, 4> sub_triangles = { Triangle_3(v0, v01, v02), Triangle_3(v1 , v01, v12),
                                                       Triangle_3(v2, v02, v12), Triangle_3(v01, v02, v12) };
 
@@ -2372,17 +2374,19 @@ typename Kernel::FT recursive_hausdorff_subdivision(const typename Kernel::Point
   using FT = typename Kernel::FT;
   using Point_3 = typename Kernel::Point_3;
 
+  auto midpoint = Kernel().construct_midpoint_3_object();
+  auto squared_distance = Kernel().compute_squared_distance_3_object();
   // If all edge lengths of the triangle are below the error bound,
   // return the maximum of the distances of the three points to TM2 (via TM2_tree).
-  const FT max_squared_edge_length = (CGAL::max)((CGAL::max)(CGAL::squared_distance(p0, p1),
-                                                             CGAL::squared_distance(p0, p2)),
-                                                             CGAL::squared_distance(p1, p2));
+  const FT max_squared_edge_length = (CGAL::max)((CGAL::max)(squared_distance(p0, p1),
+                                                             squared_distance(p0, p2)),
+                                                             squared_distance(p1, p2));
 
   if(max_squared_edge_length < sq_error_bound)
   {
-    return (CGAL::max)((CGAL::max)(CGAL::squared_distance(p0, tm2_tree.closest_point(p0)),
-                                   CGAL::squared_distance(p1, tm2_tree.closest_point(p1))),
-                                   CGAL::squared_distance(p2, tm2_tree.closest_point(p2)));
+    return (CGAL::max)((CGAL::max)(squared_distance(p0, tm2_tree.closest_point(p0)),
+                                   squared_distance(p1, tm2_tree.closest_point(p1))),
+                                   squared_distance(p2, tm2_tree.closest_point(p2)));
   }
 
   // Else subdivide the triangle and proceed recursively.

From edaf59a4b8ac8d1c38c794ded5d1269258dd4517 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 31 Jan 2024 17:11:49 +0200
Subject: [PATCH 1333/1398] dded Arrangement_on_surface_2 and Envelope_3 items

---
 Installation/CHANGES.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index be4ec7fd2b9f..49ee05c637a8 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -25,9 +25,13 @@ Release date: October 2023
 
 - Eliminated the error-prone c-type casting that was used to define observers. In general, backward compatibility was maintained; however, the former class template `Arr_observer` was replaced by an alias template. (The former class Arr_observer was renamed to Aos_observer).
 
+- Introduced `Arr_dcel`, which essentially replaces the former `Arr_default_dcel`. Backward compatibility was maintained by the introduction of the alias template `Arr_default_dcel`. `Arr_dcel`, as opposed to the former `Arr_default_dcel` is templated (in addition to the geometry traits) by Vertex, Halfedge, and Face template parameters, and they have default type values. All this enables the layered extension of DCEL records.
+
 #### Envelopes of Surfaces in 3D
 - **Breaking change**: Construct_projected_boundary_2 in `EnvelopeTraits_3` is now using `std::variant` instead of `Object`
 
+- Passed the base class of `Env_plane_traits_3` as a template parameter with a default value (being the 2D arrangement linear traits). Similarly, passed the base class of `Env_triangle_traits_3` as a template parameter with a default value (being the 2D arrangement segment traits).
+
 ### [Combinatorial Maps](https://doc.cgal.org/6.0/Manual/packages.html#PkgCombinatorialMaps) and [Generalized Maps](https://doc.cgal.org/6.0/Manual/packages.html#PkgGeneralizedMaps)
 
 - Added the function `insert_cell_1_between_two_cells_2()` to the `GenericMap` concept, which enables users to insert an edge between two different faces in order to create faces with holes.

From f505ebb2ded78c4bfaa675d5c104b3a1419570e0 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Tue, 17 Oct 2023 15:14:10 +0200
Subject: [PATCH 1334/1398] rewrite init_c3t3

for better handling of input triangulation not generated by Mesh_3

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
---
 .../internal/tetrahedral_remeshing_helpers.h                     | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 5f1c84089f96..459b68ca086a 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -107,7 +107,6 @@ vertices(const typename Tr::Cell_handle c, const Tr&)
                c->vertex(3)};
 }
 
-// returns angle in degrees
 template<typename Gt, typename Point>
 typename Gt::FT dihedral_angle(const Point& p,
                                const Point& q,

From 8941557a6d451b7a1734179831e2887489596dee Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 1 Feb 2024 11:58:16 +0100
Subject: [PATCH 1335/1398] [flip] add non-manifold edges to the initial
 edge-complex

this avoids trying to flip them
---
 .../tetrahedral_adaptive_remeshing_impl.h       |  3 ++-
 .../internal/tetrahedral_remeshing_helpers.h    | 17 +++++++++++++++++
 2 files changed, 19 insertions(+), 1 deletion(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
index 8355dd9fd1da..8118105559a9 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
@@ -412,7 +412,8 @@ class Adaptive_remesher
       if (get(ecmap, CGAL::Tetrahedral_remeshing::make_vertex_pair(e))
           || m_c3t3.is_in_complex(e)
           || nb_incident_subdomains(e, m_c3t3) > 2
-          || nb_incident_surface_patches(e, m_c3t3) > 1)
+          || nb_incident_surface_patches(e, m_c3t3) > 1
+          || nb_incident_complex_facets(e, m_c3t3) > 2)//non-manifold edges
       {
         const bool in_complex = m_c3t3.is_in_complex(e);
         typename C3t3::Curve_index curve_id = in_complex
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 459b68ca086a..48a91cfbf8ce 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -917,6 +917,23 @@ std::size_t nb_incident_complex_edges(const typename C3t3::Vertex_handle v,
   return count;
 }
 
+template<typename C3t3>
+std::size_t nb_incident_complex_facets(const typename C3t3::Edge& e,
+                                       const C3t3& c3t3)
+{
+  typedef typename C3t3::Triangulation::Facet_circulator Facet_circulator;
+  Facet_circulator circ = c3t3.triangulation().incident_facets(e);
+  Facet_circulator end = circ;
+  std::size_t count = 0;
+  do
+  {
+    const typename C3t3::Facet& f = *circ;
+    if (c3t3.is_in_complex(f))
+      ++count;
+  }
+  while (++circ != end);
+  return count;
+}
 
 template<typename C3t3>
 bool is_feature(const typename C3t3::Vertex_handle v,

From ac3e35477dbd19f2b8afd0f9f838e41ea2a96474 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 1 Feb 2024 12:27:57 +0100
Subject: [PATCH 1336/1398] [flip] flipBoundaryEdges cleaning

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 .../internal/flip_edges.h                     | 30 ++++---------------
 1 file changed, 6 insertions(+), 24 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 36b534eced80..4f914f068138 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1844,7 +1844,7 @@ template<typename C3T3, typename SurfaceIndexMapMap,
          typename CellSelector, typename Visitor>
 std::size_t flipBoundaryEdges(
   C3T3& c3t3,
-  std::vector<typename C3T3::Edge>& boundary_edges,
+  const std::vector<typename C3T3::Edge>& boundary_edges,
   SurfaceIndexMapMap& boundary_vertices_valences,
   IncidentCellsVectorMap& inc_cells,
   const Flip_Criterion& flip_criterion,
@@ -1867,20 +1867,12 @@ std::size_t flipBoundaryEdges(
 
   for (const Edge& e : boundary_edges)
   {
-    if (c3t3.is_in_complex(e))
-      continue;
-    else
+    if (!c3t3.is_in_complex(e))
       candidate_edges_for_flip.push_back(make_vertex_pair(e));
   }
 
-//  double min_angle = min_dihedral_angle(c3t3);
-//  std::cout << "Min dihedral angle before surface flips = " << min_angle << std::endl;
-
-  for (const std::pair<Vertex_handle, Vertex_handle>& vp : candidate_edges_for_flip)
+  for (const auto [vh0, vh1] : candidate_edges_for_flip)
   {
-    const Vertex_handle vh0 = vp.first;
-    const Vertex_handle vh1 = vp.second;
-
     boost::container::small_vector<Cell_handle, 64>& inc_vh0 = inc_cells[vh0];
     if (inc_vh0.empty())
       tr.incident_cells(vh0, std::back_inserter(inc_vh0));
@@ -1918,8 +1910,7 @@ std::size_t flipBoundaryEdges(
 
     if (!on_boundary)
       continue;
-    else
-      CGAL_assertion(boundary_facets.size() == 2);
+    CGAL_assertion(boundary_facets.size() == 2);
 
     const Surface_patch_index surfi = c3t3.surface_patch_index(boundary_facets[0]);
 
@@ -1945,16 +1936,13 @@ std::size_t flipBoundaryEdges(
       CGAL_assertion_code(Cell_handle c);
       CGAL_assertion(tr.is_facet(vh0, vh1, vh2, c, li, lj, lk));
       CGAL_assertion(c3t3.is_in_complex(c, (6 - li - lj - lk)));
-
       CGAL_assertion(tr.is_facet(vh0, vh1, vh3, c, li, lj, lk));
       CGAL_assertion(c3t3.is_in_complex(c, (6 - li - lj - lk)));
 
       Cell_handle t_ch;
       int t_i0, t_i1;
-      if (!tr.is_edge(vh2, vh3, t_ch, t_i0, t_i1))
+      if (!tr.is_edge(vh2, vh3, t_ch, t_i0, t_i1)) // most-likely to happen early exit
       {
-//        nb_surface_flip_candidates++;
-
         int v0 = boundary_vertices_valences[vh0][surfi];
         int v1 = boundary_vertices_valences[vh1][surfi];
         int v2 = boundary_vertices_valences[vh2][surfi];
@@ -2015,7 +2003,6 @@ std::size_t flipBoundaryEdges(
                             c3t3.edges_in_complex_end()));
             CGAL_assertion(nbe == nbe_post);
 
-//            nb_surface_flip_done++;
             nb++;
 
             boundary_vertices_valences[vh0][surfi]--;
@@ -2023,13 +2010,8 @@ std::size_t flipBoundaryEdges(
             boundary_vertices_valences[vh2][surfi]++;
             boundary_vertices_valences[vh3][surfi]++;
           }
-          else if (db == INVALID_CELL || db == INVALID_VERTEX || db == INVALID_ORIENTATION)
-          {
-//            std::cout << "Cell problem" << std::endl;
+          else
             continue;
-          }
-//          else
-//            std::cout << "Boundary flip failed" << std::endl;
         }
       }
     }

From c6ba155a3813f74c820706344734b38a6e05ecfd Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 1 Feb 2024 12:27:57 +0100
Subject: [PATCH 1337/1398] [flip] flipBoundaryEdges cleaning

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 .../CGAL/Tetrahedral_remeshing/internal/flip_edges.h     | 9 ---------
 1 file changed, 9 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 4f914f068138..3aec4263f21b 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1943,15 +1943,6 @@ std::size_t flipBoundaryEdges(
       int t_i0, t_i1;
       if (!tr.is_edge(vh2, vh3, t_ch, t_i0, t_i1)) // most-likely to happen early exit
       {
-        int v0 = boundary_vertices_valences[vh0][surfi];
-        int v1 = boundary_vertices_valences[vh1][surfi];
-        int v2 = boundary_vertices_valences[vh2][surfi];
-        int v3 = boundary_vertices_valences[vh3][surfi];
-        int m0 = (boundary_vertices_valences[vh0].size() > 1 ? 4 : 6);
-        int m1 = (boundary_vertices_valences[vh1].size() > 1 ? 4 : 6);
-        int m2 = (boundary_vertices_valences[vh2].size() > 1 ? 4 : 6);
-        int m3 = (boundary_vertices_valences[vh3].size() > 1 ? 4 : 6);
-
         int initial_cost = (v0 - m0)*(v0 - m0)
                          + (v1 - m1)*(v1 - m1)
                          + (v2 - m2)*(v2 - m2)

From 16abfe9958f1293f6760f8fe37830f3b4e07da6a Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 1 Feb 2024 12:34:10 +0100
Subject: [PATCH 1338/1398] [flip] reindent piece of code

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
---
 .../internal/flip_edges.h                     | 168 +++++++++---------
 1 file changed, 87 insertions(+), 81 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 3aec4263f21b..b9267f39f1e2 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1859,7 +1859,7 @@ std::size_t flipBoundaryEdges(
   typedef typename C3T3::Triangulation Tr;
   typedef std::pair<Vertex_handle, Vertex_handle> Edge_vv;
 
-  std::size_t nb = 0;
+  std::size_t nb_success = 0;
 
   Tr& tr = c3t3.triangulation();
 
@@ -1912,104 +1912,110 @@ std::size_t flipBoundaryEdges(
       continue;
     CGAL_assertion(boundary_facets.size() == 2);
 
-    const Surface_patch_index surfi = c3t3.surface_patch_index(boundary_facets[0]);
+    const Facet& f0 = boundary_facets[0];
+    const Facet& f1 = boundary_facets[1];
 
+    Vertex_handle vh2;
+    Vertex_handle vh3;
+    for (int i = 0; i < 3; i++)
     {
-      const Facet& f0 = boundary_facets[0];
-      const Facet& f1 = boundary_facets[1];
-
-      Vertex_handle vh2;
-      Vertex_handle vh3;
-      for (int i = 0; i < 3; i++)
-      {
-        Vertex_handle v2 = f0.first->vertex(indices(f0.second, i));
-        Vertex_handle v3 = f1.first->vertex(indices(f1.second, i));
-        if (v2 != vh0 && v2 != vh1)
-          vh2 = v2;
-        if (v3 != vh0 && v3 != vh1)
-          vh3 = v3;
-      }
-
-      CGAL_assertion_code(int li);
-      CGAL_assertion_code(int lj);
-      CGAL_assertion_code(int lk);
-      CGAL_assertion_code(Cell_handle c);
-      CGAL_assertion(tr.is_facet(vh0, vh1, vh2, c, li, lj, lk));
-      CGAL_assertion(c3t3.is_in_complex(c, (6 - li - lj - lk)));
-      CGAL_assertion(tr.is_facet(vh0, vh1, vh3, c, li, lj, lk));
-      CGAL_assertion(c3t3.is_in_complex(c, (6 - li - lj - lk)));
-
-      Cell_handle t_ch;
-      int t_i0, t_i1;
-      if (!tr.is_edge(vh2, vh3, t_ch, t_i0, t_i1)) // most-likely to happen early exit
-      {
-        int initial_cost = (v0 - m0)*(v0 - m0)
-                         + (v1 - m1)*(v1 - m1)
-                         + (v2 - m2)*(v2 - m2)
-                         + (v3 - m3)*(v3 - m3);
-
-        v0--;
-        v1--;
-        v2++;
-        v3++;
+      Vertex_handle v2 = f0.first->vertex(indices(f0.second, i));
+      Vertex_handle v3 = f1.first->vertex(indices(f1.second, i));
+      if (v2 != vh0 && v2 != vh1)
+        vh2 = v2;
+      if (v3 != vh0 && v3 != vh1)
+        vh3 = v3;
+    }
 
-        int final_cost = (v0 - m0)*(v0 - m0)
+    CGAL_assertion_code(int li);
+    CGAL_assertion_code(int lj);
+    CGAL_assertion_code(int lk);
+    CGAL_assertion_code(Cell_handle cc);
+    CGAL_assertion(tr.is_facet(vh0, vh1, vh2, cc, li, lj, lk));
+    CGAL_assertion(c3t3.is_in_complex(cc, (6 - li - lj - lk)));
+    CGAL_assertion(tr.is_facet(vh0, vh1, vh3, cc, li, lj, lk));
+    CGAL_assertion(c3t3.is_in_complex(cc, (6 - li - lj - lk)));
+
+    Cell_handle t_ch;
+    int t_i0, t_i1;
+    if (!tr.is_edge(vh2, vh3, t_ch, t_i0, t_i1)) // most-likely to happen early exit
+    {
+      const Surface_patch_index surfi = c3t3.surface_patch_index(boundary_facets[0]);
+
+      int v0 = boundary_vertices_valences.at(vh0)[surfi];
+      int v1 = boundary_vertices_valences.at(vh1)[surfi];
+      int v2 = boundary_vertices_valences.at(vh2)[surfi];
+      int v3 = boundary_vertices_valences.at(vh3)[surfi];
+      int m0 = (boundary_vertices_valences.at(vh0).size() > 1 ? 4 : 6);
+      int m1 = (boundary_vertices_valences.at(vh1).size() > 1 ? 4 : 6);
+      int m2 = (boundary_vertices_valences.at(vh2).size() > 1 ? 4 : 6);
+      int m3 = (boundary_vertices_valences.at(vh3).size() > 1 ? 4 : 6);
+
+      int initial_cost = (v0 - m0)*(v0 - m0)
                        + (v1 - m1)*(v1 - m1)
                        + (v2 - m2)*(v2 - m2)
                        + (v3 - m3)*(v3 - m3);
-        if (initial_cost > final_cost)
+      v0--;
+      v1--;
+      v2++;
+      v3++;
+
+      int final_cost = (v0 - m0)*(v0 - m0)
+                     + (v1 - m1)*(v1 - m1)
+                     + (v2 - m2)*(v2 - m2)
+                     + (v3 - m3)*(v3 - m3);
+      if (initial_cost > final_cost)
+      {
+        CGAL_assertion_code(std::size_t nbf =
+          std::distance(c3t3.facets_in_complex_begin(),
+                        c3t3.facets_in_complex_end()));
+        CGAL_assertion_code(std::size_t nbe =
+          std::distance(c3t3.edges_in_complex_begin(),
+                        c3t3.edges_in_complex_end()));
+
+        Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3,
+                                                   inc_cells,
+                                                   flip_criterion,
+                                                   visitor);
+        if (db == VALID_FLIP)
         {
-          CGAL_assertion_code(std::size_t nbf =
+          CGAL_assertion(tr.tds().is_edge(vh2, vh3));
+          Cell_handle c;
+          int li, lj, lk;
+          CGAL_assertion_code(bool b =)
+          tr.tds().is_facet(vh2, vh3, vh0, c, li, lj, lk);
+          CGAL_assertion(b);
+          c3t3.add_to_complex(c, (6 - li - lj - lk), surfi);
+
+          CGAL_assertion_code(b = )
+          tr.tds().is_facet(vh2, vh3, vh1, c, li, lj, lk);
+          CGAL_assertion(b);
+          c3t3.add_to_complex(c, (6 - li - lj - lk), surfi);
+
+          CGAL_assertion_code(std::size_t nbf_post =
             std::distance(c3t3.facets_in_complex_begin(),
                           c3t3.facets_in_complex_end()));
-          CGAL_assertion_code(std::size_t nbe =
+          CGAL_assertion(nbf == nbf_post);
+          CGAL_assertion_code(std::size_t nbe_post =
             std::distance(c3t3.edges_in_complex_begin(),
                           c3t3.edges_in_complex_end()));
+          CGAL_assertion(nbe == nbe_post);
 
-          Sliver_removal_result db = flip_on_surface(c3t3, edge, vh2, vh3,
-                                                     inc_cells,
-                                                     flip_criterion,
-                                                     visitor);
-          if (db == VALID_FLIP)
-          {
-            CGAL_assertion(tr.tds().is_edge(vh2, vh3));
-            Cell_handle c;
-            int li, lj, lk;
-            CGAL_assertion_code(bool b =)
-            tr.tds().is_facet(vh2, vh3, vh0, c, li, lj, lk);
-            CGAL_assertion(b);
-            c3t3.add_to_complex(c, (6 - li - lj - lk), surfi);
-
-            CGAL_assertion_code(b = )
-            tr.tds().is_facet(vh2, vh3, vh1, c, li, lj, lk);
-            CGAL_assertion(b);
-            c3t3.add_to_complex(c, (6 - li - lj - lk), surfi);
-
-            CGAL_assertion_code(std::size_t nbf_post =
-              std::distance(c3t3.facets_in_complex_begin(),
-                            c3t3.facets_in_complex_end()));
-            CGAL_assertion(nbf == nbf_post);
-            CGAL_assertion_code(std::size_t nbe_post =
-              std::distance(c3t3.edges_in_complex_begin(),
-                            c3t3.edges_in_complex_end()));
-            CGAL_assertion(nbe == nbe_post);
-
-            nb++;
-
-            boundary_vertices_valences[vh0][surfi]--;
-            boundary_vertices_valences[vh1][surfi]--;
-            boundary_vertices_valences[vh2][surfi]++;
-            boundary_vertices_valences[vh3][surfi]++;
-          }
-          else
-            continue;
+          boundary_vertices_valences[vh0][surfi]--;
+          boundary_vertices_valences[vh1][surfi]--;
+          boundary_vertices_valences[vh2][surfi]++;
+          boundary_vertices_valences[vh3][surfi]++;
+
+          nb_success++;
         }
+        else
+          continue;
       }
     }
   }
   CGAL_assertion(tr.tds().is_valid());
 
-  return nb;
+  return nb_success;
 }
 
 template<typename C3T3, typename CellSelector, typename Visitor>

From 854e00e639a01e9b8fa202965ded8e92191c8315 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 1 Feb 2024 14:03:23 +0100
Subject: [PATCH 1339/1398] [flip] add third_vertex(f) helper function

# Conflicts:
#	Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
---
 .../internal/flip_edges.h                      | 18 ++++--------------
 .../internal/tetrahedral_remeshing_helpers.h   | 17 +++++++++++++++++
 2 files changed, 21 insertions(+), 14 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index b9267f39f1e2..b77dff341f1d 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1915,17 +1915,9 @@ std::size_t flipBoundaryEdges(
     const Facet& f0 = boundary_facets[0];
     const Facet& f1 = boundary_facets[1];
 
-    Vertex_handle vh2;
-    Vertex_handle vh3;
-    for (int i = 0; i < 3; i++)
-    {
-      Vertex_handle v2 = f0.first->vertex(indices(f0.second, i));
-      Vertex_handle v3 = f1.first->vertex(indices(f1.second, i));
-      if (v2 != vh0 && v2 != vh1)
-        vh2 = v2;
-      if (v3 != vh0 && v3 != vh1)
-        vh3 = v3;
-    }
+    // find 3rd and 4th vertices to flip on surface
+    const Vertex_handle vh2 = third_vertex(f0, vh0, vh1, tr);
+    const Vertex_handle vh3 = third_vertex(f1, vh0, vh1, tr);
 
     CGAL_assertion_code(int li);
     CGAL_assertion_code(int lj);
@@ -1936,9 +1928,7 @@ std::size_t flipBoundaryEdges(
     CGAL_assertion(tr.is_facet(vh0, vh1, vh3, cc, li, lj, lk));
     CGAL_assertion(c3t3.is_in_complex(cc, (6 - li - lj - lk)));
 
-    Cell_handle t_ch;
-    int t_i0, t_i1;
-    if (!tr.is_edge(vh2, vh3, t_ch, t_i0, t_i1)) // most-likely to happen early exit
+    if (!tr.tds().is_edge(vh2, vh3)) // most-likely to happen early exit
     {
       const Surface_patch_index surfi = c3t3.surface_patch_index(boundary_facets[0]);
 
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index 48a91cfbf8ce..d046f640b2ff 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -79,6 +79,23 @@ inline int indices(const int& i, const int& j)
   return 0;
 }
 
+template<typename Tr>
+typename Tr::Vertex_handle
+third_vertex(const typename Tr::Facet& f,
+             const typename Tr::Vertex_handle v0,
+             const typename Tr::Vertex_handle v1,
+             const Tr& tr)
+{
+  for(auto v : tr.vertices(f))
+    if(v != v0 && v != v1)
+      return v;
+
+  CGAL_assertion(false);
+  return
+    typename Tr::Vertex_handle();
+}
+
+// returns angle in degrees
 template<typename Tr>
 std::array<typename Tr::Vertex_handle, 2>
 vertices(const typename Tr::Edge& e , const Tr&)

From d287ac8ab1494153344e10d653b06ed4484c85d7 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 1 Feb 2024 15:20:52 +0100
Subject: [PATCH 1340/1398] fix example for testsuite

---
 ...remesh_polyhedral_domain_with_features.cpp | 44 ++-----------------
 1 file changed, 4 insertions(+), 40 deletions(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
index 86cb9b0b5333..130f91901fc2 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
@@ -13,19 +13,6 @@
 #include <CGAL/make_mesh_3.h>
 #include <CGAL/tetrahedral_remeshing.h>
 
-#include <CGAL/IO/File_binary_mesh_3.h>
-
-#include <boost/container/flat_set.hpp>
-
-int nb_surface_flip_candidates = 0;
-int nb_surface_flip_done = 0;
-int nb_surface_44_configs = 0;
-int nb_surface_nm_configs = 0;
-int nb_surface_44_flips_done = 0;
-int nb_surface_nm_flips_done = 0;
-
-std::ostringstream oss_flip("flipped_surface_edges.polylines.txt");
-
 
 // Domain
 typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
@@ -53,12 +40,8 @@ using namespace CGAL::parameters;
 
 int main(int argc, char* argv[])
 {
-  //"data/Shape1/shape1.off" 40. "data/Shape1/mesh_40.binary.cgal" "data/Shape1/remesh_40.binary.cgal"
-  const char* fname = (argc > 1) ? argv[1] : "data/tensileASCII.off";
-  const double target = (argc > 2) ? atof(argv[2]) : 200.;
-  const int nb_iter = (argc > 3) ? atoi(argv[3]) : 10;
-  const char* fname_mesh3 = (argc > 4) ? argv[4] : "data/Tensile/mesh_200.binary.cgal";
-  const char* fname_remesh = (argc > 5) ? argv[5] : "data/Tensile/remesh_200.binary.cgal";
+  const std::string fname = (argc > 1) ? argv[1] : CGAL::data_file_path("meshes/anchor.off");
+  const int nb_iter = (argc > 2) ? atoi(argv[2]) : 5;
 
   std::ifstream input(fname);
   Polyhedron polyhedron;
@@ -83,10 +66,7 @@ int main(int argc, char* argv[])
   domain.detect_features();
 
   // Mesh criteria
-  double CellSize = 31.3082;
-  int mesh_factor = 50;
-  double size = (CellSize * mesh_factor) / 100;
-  //const double size = 40.;
+  const double size = 0.072;
   Mesh_criteria criteria(edge_size = size,
     facet_angle = 25,
     facet_size = size,
@@ -94,11 +74,9 @@ int main(int argc, char* argv[])
     cell_size = size);
 
   // Mesh generation
-  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria);// , no_perturb(), no_exude());
+  C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria, no_perturb(), no_exude());
 
   // Output
-//  std::ofstream os(fname_mesh3, std::ios_base::out | std::ios_base::binary);
-//  CGAL::Mesh_3::save_binary_file(os, c3t3);
   CGAL::dump_c3t3(c3t3, "out_after_meshing");
 
   const double min_dihedral_angle = CGAL::Tetrahedral_remeshing::min_dihedral_angle(c3t3);
@@ -110,21 +88,7 @@ int main(int argc, char* argv[])
   //    .smooth_constrained_edges(true));
 
     // Output
-  //  std::ofstream osr(fname_remesh, std::ios_base::out | std::ios_base::binary);
-  //  CGAL::Mesh_3::save_binary_file(osr, c3t3);
   CGAL::dump_c3t3(c3t3, "out_after_remeshing");
 
-  std::cout << "Meshing and remeshing done." << std::endl;
-
-  std::cout << "Surface flip attempts : " << nb_surface_flip_candidates << std::endl;
-  std::cout << "Surface flip done     : " << nb_surface_flip_done << std::endl;
-  std::cout << "Surface 4/4 flips candidates proportion : "
-    << 100.*nb_surface_44_configs / (double)(nb_surface_nm_configs + nb_surface_44_configs)
-    << " percent" << std::endl;
-
-  std::cout << "nb surface flips 4/4 done = " << nb_surface_44_flips_done << std::endl;
-  std::cout << "nb surface flips n/m done = " << nb_surface_nm_flips_done << std::endl;
-
-
   return EXIT_SUCCESS;
 }

From c8d2f8e24aa84e1bcf46dea705a85a715b7a9795 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 1 Feb 2024 15:50:30 +0100
Subject: [PATCH 1341/1398] examples cleaning

---
 .../mesh_and_remesh_c3t3.cpp                  | 25 +++++-----
 ...remesh_polyhedral_domain_with_features.cpp | 48 ++++++++++---------
 2 files changed, 38 insertions(+), 35 deletions(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp
index b5a10784e929..6416f6fd3341 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp
@@ -12,27 +12,27 @@
 #include <CGAL/IO/File_medit.h>
 
 // Domain
-typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
-typedef CGAL::Mesh_polyhedron_3<K>::type Polyhedron;
-typedef CGAL::Polyhedral_mesh_domain_with_features_3<K> Mesh_domain;
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Polyhedron = CGAL::Mesh_polyhedron_3<K>::type;
+using Mesh_domain = CGAL::Polyhedral_mesh_domain_with_features_3<K>;
 
 #ifdef CGAL_CONCURRENT_MESH_3
-typedef CGAL::Parallel_tag Concurrency_tag;
+using Concurrency_tag = CGAL::Parallel_tag;
 #else
-typedef CGAL::Sequential_tag Concurrency_tag;
+using Concurrency_tag = CGAL::Sequential_tag;
 #endif
 
 // Triangulation for Meshing
-typedef CGAL::Mesh_triangulation_3<Mesh_domain, CGAL::Default, Concurrency_tag>::type Tr;
-typedef CGAL::Mesh_complex_3_in_triangulation_3<
-  Tr, Mesh_domain::Corner_index, Mesh_domain::Curve_index> C3t3;
+using Tr = CGAL::Mesh_triangulation_3<Mesh_domain, CGAL::Default, Concurrency_tag>::type;
+using C3t3 = CGAL::Mesh_complex_3_in_triangulation_3<
+  Tr, Mesh_domain::Corner_index, Mesh_domain::Curve_index>;
 
 // Criteria
-typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
+using Mesh_criteria = CGAL::Mesh_criteria_3<Tr>;
 
 // Triangulation for Remeshing
-typedef CGAL::Triangulation_3<typename Tr::Geom_traits,
-  typename Tr::Triangulation_data_structure> Triangulation_3;
+using Triangulation_3 = CGAL::Triangulation_3<Tr::Geom_traits,
+                             Tr::Triangulation_data_structure>;
 using Vertex_handle = Triangulation_3::Vertex_handle;
 
 using Vertex_pair = std::pair<Vertex_handle, Vertex_handle>;
@@ -68,8 +68,7 @@ int main(int argc, char* argv[])
   // Mesh generation
   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria);
 
-  CGAL::dump_c3t3(c3t3, "out");
-
+  // Property map of constraints
   Constraints_set constraints;
   Constraints_pmap constraints_pmap(constraints);
 
diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
index 130f91901fc2..0efe6498a628 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
@@ -1,6 +1,3 @@
-#define CGAL_MESH_3_VERBOSE 1
-#define CGAL_TETRAHEDRAL_REMESHING_VERBOSE
-
 #include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
 
 #include <CGAL/Mesh_triangulation_3.h>
@@ -15,25 +12,32 @@
 
 
 // Domain
-typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
-typedef CGAL::Surface_mesh<K::Point_3> Polyhedron;
-typedef CGAL::Polyhedral_mesh_domain_with_features_3<K, Polyhedron> Mesh_domain;
-
+using K = CGAL::Exact_predicates_inexact_constructions_kernel;
+using Polyhedron = CGAL::Surface_mesh<K::Point_3>;
+using Mesh_domain = CGAL::Polyhedral_mesh_domain_with_features_3<K, Polyhedron>;
 
 #ifdef CGAL_CONCURRENT_MESH_3
-typedef CGAL::Parallel_tag Concurrency_tag;
+using Concurrency_tag = CGAL::Parallel_tag;
 #else
-typedef CGAL::Sequential_tag Concurrency_tag;
+using Concurrency_tag = CGAL::Sequential_tag;
 #endif
 
 // Triangulation
-typedef CGAL::Mesh_triangulation_3<Mesh_domain, CGAL::Default, Concurrency_tag>::type Tr;
-
-typedef CGAL::Mesh_complex_3_in_triangulation_3<
-  Tr, Mesh_domain::Corner_index, Mesh_domain::Curve_index> C3t3;
+using Tr = CGAL::Mesh_triangulation_3<Mesh_domain, CGAL::Default, Concurrency_tag>::type;
+using C3t3 = CGAL::Mesh_complex_3_in_triangulation_3<
+  Tr, Mesh_domain::Corner_index, Mesh_domain::Curve_index>;
 
 // Criteria
-typedef CGAL::Mesh_criteria_3<Tr> Mesh_criteria;
+using Mesh_criteria = CGAL::Mesh_criteria_3<Tr>;
+
+// Triangulation for Remeshing
+using Triangulation_3 = CGAL::Triangulation_3<Tr::Geom_traits,
+                                              Tr::Triangulation_data_structure>;
+using Vertex_handle = Triangulation_3::Vertex_handle;
+using Vertex_pair = std::pair<Vertex_handle, Vertex_handle>;
+using Constraints_set = std::unordered_set<Vertex_pair, boost::hash<Vertex_pair>>;
+using Constraints_pmap = CGAL::Boolean_property_map<Constraints_set>;
+
 
 // To avoid verbose function and named parameters call
 using namespace CGAL::parameters;
@@ -76,19 +80,19 @@ int main(int argc, char* argv[])
   // Mesh generation
   C3t3 c3t3 = CGAL::make_mesh_3<C3t3>(domain, criteria, no_perturb(), no_exude());
 
-  // Output
-  CGAL::dump_c3t3(c3t3, "out_after_meshing");
+  Constraints_set constraints;
+  Constraints_pmap constraints_pmap(constraints);
 
-  const double min_dihedral_angle = CGAL::Tetrahedral_remeshing::min_dihedral_angle(c3t3);
-  std::cout << "Min dihedral angle after meshing = " << min_dihedral_angle << std::endl;
+  Triangulation_3 tr = CGAL::convert_to_triangulation_3(std::move(c3t3),
+    CGAL::parameters::edge_is_constrained_map(constraints_pmap));
 
   // Remeshing
-  CGAL::tetrahedral_isotropic_remeshing(c3t3, size,
+  CGAL::tetrahedral_isotropic_remeshing(tr, size,
     CGAL::parameters::number_of_iterations(nb_iter));
-  //    .smooth_constrained_edges(true));
 
-    // Output
-  CGAL::dump_c3t3(c3t3, "out_after_remeshing");
+  std::ofstream out("out_remeshed.mesh");
+  CGAL::IO::write_MEDIT(out, tr);
+  out.close();
 
   return EXIT_SUCCESS;
 }

From 33b00d679f78d5bb21cf4b5e9f8c20388116eab5 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 1 Feb 2024 22:05:46 +0100
Subject: [PATCH 1342/1398] reduce debug code

---
 .../internal/collapse_short_edges.h                |  8 +++-----
 .../Tetrahedral_remeshing/internal/flip_edges.h    | 14 ++------------
 2 files changed, 5 insertions(+), 17 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
index 4defe89c0674..c51cf5988868 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
@@ -1123,11 +1123,9 @@ typename C3t3::Vertex_handle collapse_edge(typename C3t3::Edge& edge,
   if (are_edge_lengths_valid(edge, c3t3, new_pos, sqhigh, cell_selector/*, adaptive = false*/)
     && collapse_preserves_surface_star(edge, c3t3, new_pos, cell_selector))
   {
-    CGAL_assertion_code(typename Tr::Cell_handle dc);
-    CGAL_assertion_code(int di);
-    CGAL_assertion_code(int dj);
-    CGAL_assertion(c3t3.triangulation().is_edge(edge.first->vertex(edge.second),
-                                                edge.first->vertex(edge.third), dc, di, dj));
+    CGAL_assertion(c3t3.triangulation().tds().is_edge(
+                       edge.first->vertex(edge.second),
+                       edge.first->vertex(edge.third)));
 
     Vertex_handle v0_init = edge.first->vertex(edge.second);
     Vertex_handle v1_init = edge.first->vertex(edge.third);
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index b77dff341f1d..d7010d05552f 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -424,9 +424,7 @@ void find_best_flip_to_improve_dh(C3t3& c3t3,
                                           indices(facet_circulator->second, j));
             if (curr != vh0  && curr != vh1)
             {
-              Cell_handle ch;
-              int i0, i1;
-              if (tr.is_edge(curr, vh, ch, i0, i1))
+              if (tr.tds().is_edge(curr, vh))
                 is_edge = true;
             }
           }
@@ -1864,7 +1862,6 @@ std::size_t flipBoundaryEdges(
   Tr& tr = c3t3.triangulation();
 
   std::vector<Edge_vv> candidate_edges_for_flip;
-
   for (const Edge& e : boundary_edges)
   {
     if (!c3t3.is_in_complex(e))
@@ -1919,14 +1916,7 @@ std::size_t flipBoundaryEdges(
     const Vertex_handle vh2 = third_vertex(f0, vh0, vh1, tr);
     const Vertex_handle vh3 = third_vertex(f1, vh0, vh1, tr);
 
-    CGAL_assertion_code(int li);
-    CGAL_assertion_code(int lj);
-    CGAL_assertion_code(int lk);
-    CGAL_assertion_code(Cell_handle cc);
-    CGAL_assertion(tr.is_facet(vh0, vh1, vh2, cc, li, lj, lk));
-    CGAL_assertion(c3t3.is_in_complex(cc, (6 - li - lj - lk)));
-    CGAL_assertion(tr.is_facet(vh0, vh1, vh3, cc, li, lj, lk));
-    CGAL_assertion(c3t3.is_in_complex(cc, (6 - li - lj - lk)));
+    CGAL_assertion_code(debug::check_facets(vh0, vh1, vh2, vh3, c3t3));
 
     if (!tr.tds().is_edge(vh2, vh3)) // most-likely to happen early exit
     {

From c0ea678cde0d22b8676b8fa72595b6dc95489c7d Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 12 Jan 2024 18:32:33 +0100
Subject: [PATCH 1343/1398] collapse was leaving some complex edges behind

remove from complex the edge that is about to be collapsed
---
 .../CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
index c51cf5988868..c36603287bce 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/collapse_short_edges.h
@@ -805,6 +805,9 @@ collapse(const typename C3t3::Cell_handle ch,
   }
   while (++circ != done);
 
+  if(c3t3.is_in_complex(ch->vertex(from), ch->vertex(to)))
+    c3t3.remove_from_complex(ch->vertex(from), ch->vertex(to));
+
   bool valid = true;
   std::vector<Cell_handle> cells_to_remove;
   std::unordered_set<Cell_handle> invalid_cells;

From ff03290b29729b40f304700c4d6ef50103f024c4 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Thu, 18 Jan 2024 10:28:23 +0100
Subject: [PATCH 1344/1398] re-insert constraints after split

---
 .../internal/split_long_edges.h                     | 13 +++++++++++++
 1 file changed, 13 insertions(+)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/split_long_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/split_long_edges.h
index be0e35d7935c..197753c9784b 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/split_long_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/split_long_edges.h
@@ -41,6 +41,7 @@ typename C3t3::Vertex_handle split_edge(const typename C3t3::Edge& e,
   typedef typename C3t3::Triangulation       Tr;
   typedef typename C3t3::Subdomain_index     Subdomain_index;
   typedef typename C3t3::Surface_patch_index Surface_patch_index;
+  typedef typename C3t3::Curve_index         Curve_index;
   typedef typename Tr::Geom_traits::Point_3 Point;
   typedef typename Tr::Facet                Facet;
   typedef typename Tr::Vertex_handle        Vertex_handle;
@@ -70,6 +71,11 @@ typename C3t3::Vertex_handle split_edge(const typename C3t3::Edge& e,
   }
   CGAL_assertion(dimension > 0);
 
+  // remove complex edge before splitting
+  const Curve_index curve_index = (dimension == 1) ? c3t3.curve_index(e) : Curve_index();
+  if (dimension == 1)
+    c3t3.remove_from_complex(e);
+
   struct Cell_info {
     Subdomain_index subdomain_index_;
     bool selected_;
@@ -194,6 +200,13 @@ typename C3t3::Vertex_handle split_edge(const typename C3t3::Edge& e,
     // will have its patch tagged from the other side, if needed
   }
 
+  // re-insert complex sub-edges
+  if (dimension == 1)
+  {
+    c3t3.add_to_complex(new_v, v1, curve_index);
+    c3t3.add_to_complex(new_v, v2, curve_index);
+  }
+
   set_index(new_v, c3t3);
 
   return new_v;

From e2ef33f4328e51858b458aff2610b45f0f1bcfbe Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Fri, 2 Feb 2024 16:19:57 +0100
Subject: [PATCH 1345/1398] cleaning

- remove useless comments
- add debug early exits for each type of surface flips
- rename variables
- use c++ for loops
---
 .../internal/flip_edges.h                     | 164 +++---------------
 1 file changed, 27 insertions(+), 137 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index d7010d05552f..6d56ca3f2d0c 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -1396,7 +1396,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 
   if (cells_around_edge.size() != 4)
   {
-//    nb_surface_nm_configs++;
     if (cells_around_edge.size() > 4){
 //////      if (flip_criterion == VALENCE_BASED){
 //////        return find_best_n_m_flip(edge, vh0_index, vh1_index);
@@ -1418,7 +1417,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
       return NOT_FLIPPABLE;
   }
 
-//  nb_surface_44_configs++;
 #ifdef CGAL_FLIP_ON_SURFACE_DISABLE_44_FLIP
   return NOT_FLIPPABLE;
 #endif
@@ -1439,75 +1437,41 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
 
   Vertex_handle vh0, vh1, vh2, vh3, vh4, vh5;
 
-  int ivh4 = ch0->index(ch1);
-  vh4 = ch0->vertex(ivh4);
+  int ivh4_in_ch0 = ch0->index(ch1);
+  vh4 = ch0->vertex(ivh4_in_ch0);
 
-  int ivh2 = ch0->index(ch3);
-  vh2 = ch0->vertex(ivh2);
+  int ivh2_in_ch0 = ch0->index(ch3);
+  vh2 = ch0->vertex(ivh2_in_ch0);
 
   vh5 = ch1->vertex(ch1->index(ch0));
   vh0 = ch2->vertex(ch2->index(ch1));
 
   for (int j = 0; j < 3; j++){
-    if (indices(ivh4, j) == ivh2){
+    if (indices(ivh4_in_ch0, j) == ivh2_in_ch0){
       int j1 = (j + 1) % 3;
       int j2 = (j + 2) % 3;
-      vh1 = ch0->vertex(indices(ivh4, j1));
-      vh3 = ch0->vertex(indices(ivh4, j2));
+      vh1 = ch0->vertex(indices(ivh4_in_ch0, j1));
+      vh3 = ch0->vertex(indices(ivh4_in_ch0, j2));
       break;
     }
   }
 
   bool planar_flip;
-
-//  std::vector<std::pair<Point_3, Point_3> > current_edges;
-//  current_edges.push_back(std::make_pair(vh1->point(), vh3->point()));
-
   if ((vh0 == v0i && vh2 == v1i) || (vh2 == v0i && vh0 == v1i))
-  {
     planar_flip = true;
-//    current_edges.push_back(std::make_pair(vh0->point(), vh2->point()));
-  }
   else if ((vh4 == v0i && vh5 == v1i) || (vh5 == v0i && vh4 == v1i))
     planar_flip = false;
   else
     return NOT_FLIPPABLE;
 
-  //  /*
-//  post_sliver_Removal_cells.clear();
-//  post_sliver_Removal_cells.push_back( ch0 );
-//  post_sliver_Removal_cells.push_back( ch1 );
-//  post_sliver_Removal_cells.push_back( ch2 );
-//  post_sliver_Removal_cells.push_back( ch3 );
-//
-//  post_sliver_Removal_vertices.clear();
-//  post_sliver_Removal_vertices.push_back( vh0 );
-//  post_sliver_Removal_vertices.push_back( vh1 );
-//  post_sliver_Removal_vertices.push_back( vh2 );
-//  post_sliver_Removal_vertices.push_back( vh3 );
-//  post_sliver_Removal_vertices.push_back( vh4 );
-//  post_sliver_Removal_vertices.push_back( vh5 );
-//
-//  pre_sliver_Removal_cells.clear();
-//  pre_sliver_Removal_cells.push_back(K::Tetrahedron_3 ( ch0->vertex(0)->point(), ch0->vertex(1)->point(), ch0->vertex(2)->point(), ch0->vertex(3)->point()  ));
-//  pre_sliver_Removal_cells.push_back(K::Tetrahedron_3 ( ch1->vertex(0)->point(), ch1->vertex(1)->point(), ch1->vertex(2)->point(), ch1->vertex(3)->point()  ));
-//  pre_sliver_Removal_cells.push_back(K::Tetrahedron_3 ( ch2->vertex(0)->point(), ch2->vertex(1)->point(), ch2->vertex(2)->point(), ch2->vertex(3)->point()  ));
-//  pre_sliver_Removal_cells.push_back(K::Tetrahedron_3 ( ch3->vertex(0)->point(), ch3->vertex(1)->point(), ch3->vertex(2)->point(), ch3->vertex(3)->point()  ));
-//
-//  if( ! c3t3_with_info.triangulation().is_valid( ch0 ) ||
-//  ! c3t3_with_info.triangulation().is_valid( ch1 ) || ! c3t3_with_info.triangulation().is_valid( ch2 ) || !c3t3_with_info.triangulation().is_valid( ch3 ) ){
-//  std::cout << "Initial cell PB!!" << std::endl;
-//  return CELL_PBS;
-//  }
-//
-//  std::cout << "vh0 "<< vh0->info() <<", " << vh1->info() << ", " << vh2->info() << ", " << vh3->info()<<", " << vh4->info() << ", " << vh5 ->info() << std::endl;
-//  */
-
   typedef typename C3T3::Facet Facet;
   typedef typename C3T3::Surface_patch_index Surface_patch_index;
 
   if (planar_flip)
   {
+#ifdef CGAL_FLIP_ON_SURFACE_DISABLE_PLANAR_44_FLIP
+    return NOT_FLIPPABLE;
+#endif
     Surface_patch_index patch = c3t3.surface_patch_index(ch0, ch0->index(vh4));
     CGAL_assertion(patch != Surface_patch_index());
     CGAL_assertion(c3t3.is_in_complex(ch0, ch0->index(vh4)));
@@ -1516,9 +1480,8 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     c3t3.remove_from_complex(ch3, ch3->index(vh4));
 
     boost::unordered_map<Facet, Surface_patch_index> opposite_facet_in_complex;
-    for (int i = 0; i < 4; ++i)
+    for (Cell_handle chi : cells_around_edge)
     {
-      Cell_handle chi = cells_around_edge[i];
       Facet f1(chi, chi->index(vh1));
       Facet f2(chi, chi->index(vh3));
 
@@ -1542,11 +1505,6 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     Cell_handle n_ch2_vh1 = ch2->neighbor(ch2->index(vh1));
     Cell_handle n_ch1_vh3 = ch1->neighbor(ch1->index(vh3));
 
-//    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch3_vh1->vertex(0)->point(), n_ch3_vh1->vertex(1)->point(), n_ch3_vh1->vertex(2)->point(), n_ch3_vh1->vertex(3)->point()));
-//    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch0_vh3->vertex(0)->point(), n_ch0_vh3->vertex(1)->point(), n_ch0_vh3->vertex(2)->point(), n_ch0_vh3->vertex(3)->point()));
-//    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch2_vh1->vertex(0)->point(), n_ch2_vh1->vertex(1)->point(), n_ch2_vh1->vertex(2)->point(), n_ch2_vh1->vertex(3)->point()));
-//    pre_sliver_Removal_cells.push_back(K::Tetrahedron_3(n_ch1_vh3->vertex(0)->point(), n_ch1_vh3->vertex(1)->point(), n_ch1_vh3->vertex(2)->point(), n_ch1_vh3->vertex(3)->point()));
-
     ch3->set_vertex(ch3->index(vh3), vh2);
     ch0->set_vertex(ch0->index(vh1), vh0);
     ch2->set_vertex(ch2->index(vh3), vh2);
@@ -1564,7 +1522,7 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
       || curr_max_cosdh < max_cos_dihedral_angle(tr, ch3, false))
       db = NO_BEST_CONFIGURATION;
 
-    if(db == NOT_FLIPPABLE || db == NO_BEST_CONFIGURATION)
+    if(db != VALID_FLIP)
     {
       ch3->set_vertex(ch3->index(vh2), vh3);
       ch0->set_vertex(ch0->index(vh0), vh1);
@@ -1574,9 +1532,8 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
       c3t3.add_to_complex(ch0, ch0->index(vh4), patch);
       c3t3.add_to_complex(ch3, ch3->index(vh4), patch);
 
-      for (int i = 0; i < 4; ++i)
+      for (Cell_handle chi : cells_around_edge)
       {
-        Cell_handle chi = cells_around_edge[i];
         Facet f1(chi, chi->index(vh1));
         Facet f2(chi, chi->index(vh3));
 
@@ -1610,18 +1567,17 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     ch1->set_neighbor(ch1->index(vh2), n_ch2_vh1);
     n_ch2_vh1->set_neighbor(n_ch2_vh1->index(ch2), ch1);
 
-    for (std::size_t i = 0; i < cells_around_edge.size(); i++)
+    for (Cell_handle ci : cells_around_edge)
     {
       for (int j = 0; j < 4; j++)
-        cells_around_edge[i]->vertex(j)->set_cell(cells_around_edge[i]);
+        ci->vertex(j)->set_cell(ci);
     }
 
     c3t3.add_to_complex(ch0, ch0->index(vh4), patch);
     c3t3.add_to_complex(ch3, ch3->index(vh4), patch);
 
-    for (int i = 0; i < 4; ++i)
+    for (Cell_handle chi : cells_around_edge)
     {
-      Cell_handle chi = cells_around_edge[i];
       Facet f1(chi, chi->index(vh0));
       Facet f2(chi, chi->index(vh2));
 
@@ -1634,46 +1590,16 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
         c3t3.add_to_complex(f2, it->second);
     }
 
-//    /*
-//    std::cout << "Ch0 "<< ch0->info()<< std::endl;
-//    if(! c3t3_with_info.triangulation().is_valid(ch0, true) )
-//    db = CELL_PBS;
-//    std::cout << "Ch1 "<< ch1->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(ch1, true))
-//    db = CELL_PBS;
-//    std::cout << "Ch2 "<< ch2->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(ch2, true))
-//    db = CELL_PBS;
-//    std::cout << "Ch3 "<< ch3->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(ch3, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch3_vh1 "<< n_ch3_vh1->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch3_vh1, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch0_vh3 "<< n_ch0_vh3->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch0_vh3, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch2_vh1 "<< n_ch2_vh1->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch2_vh1, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch1_vh3 "<< n_ch1_vh3->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch1_vh3, true))
-//    db = CELL_PBS;
-//
-//    */
-//
-//    if (db == VALID_FLIP) nb_surface_44_flips_done++;
-
-      if (db == VALID_FLIP)
-      {
-        for(Cell_handle c : cells_around_edge)
-          c->reset_cache_validity();
-      }
+    for(Cell_handle c : cells_around_edge)
+      c->reset_cache_validity();
 
     return db;
   }
   else //Non planar flip
   {
+#ifdef CGAL_FLIP_ON_SURFACE_DISABLE_NON_PLANAR_44_FLIP
+    return NOT_FLIPPABLE;
+#endif
     typename C3T3::Surface_patch_index patch = c3t3.surface_patch_index(ch0, ch0->index(vh2));
     CGAL_assertion(patch != typename C3T3::Surface_patch_index());
 
@@ -1683,9 +1609,8 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
     c3t3.remove_from_complex(ch1, ch1->index(vh2));
 
     boost::unordered_map<Facet, Surface_patch_index> opposite_facet_in_complex;
-    for (int i = 0; i < 4; ++i)
+    for (Cell_handle chi : cells_around_edge)
     {
-      Cell_handle chi = cells_around_edge[i];
       Facet f1(chi, chi->index(vh1));
       Facet f2(chi, chi->index(vh3));
 
@@ -1731,9 +1656,8 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
       c3t3.add_to_complex(ch0, ch0->index(vh2), patch);
       c3t3.add_to_complex(ch1, ch1->index(vh2), patch);
 
-      for (int i = 0; i < 4; ++i)
+      for (Cell_handle chi : cells_around_edge)
       {
-        Cell_handle chi = cells_around_edge[i];
         Facet f1(chi, chi->index(vh1));
         Facet f2(chi, chi->index(vh3));
 
@@ -1796,42 +1720,10 @@ Sliver_removal_result flip_on_surface(C3T3& c3t3,
         c3t3.add_to_complex(f2, it->second);
     }
 
-    db = VALID_FLIP;
-//    nb_surface_44_flips_done++;
-
-//    /*
-//    std::cout << "Ch0 "<< ch0->info()<< std::endl;
-//    if(! c3t3_with_info.triangulation().is_valid(ch0, true) )
-//    db = CELL_PBS;
-//    std::cout << "Ch1 "<< ch1->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(ch1, true))
-//    db = CELL_PBS;
-//    std::cout << "Ch2 "<< ch2->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(ch2, true))
-//    db = CELL_PBS;
-//    std::cout << "Ch3 "<< ch3->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(ch3, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch3_vh3 "<< n_ch3_vh3->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch3_vh3, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch2_vh1 "<< n_ch2_vh1->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch2_vh1, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch0_vh3 "<< n_ch0_vh3->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch0_vh3, true))
-//    db = CELL_PBS;
-//    std::cout << "n_ch1_vh1 "<< n_ch1_vh1->info()<< std::endl;
-//    if(!c3t3_with_info.triangulation().is_valid(n_ch1_vh1, true))
-//    db = CELL_PBS;
-//    */
-
-    if (db == VALID_FLIP)
-    {
-      for (Cell_handle c : cells_around_edge)
-        c->reset_cache_validity();
-    }
-    return db;
+    for (Cell_handle c : cells_around_edge)
+      c->reset_cache_validity();
+
+    return VALID_FLIP;
   }
 
   return NOT_FLIPPABLE;
@@ -2079,8 +1971,6 @@ void flip_edges(C3T3& c3t3,
                         cell_selector, visitor);
   }
 
-  //}
-
 #ifdef CGAL_TETRAHEDRAL_REMESHING_VERBOSE
   std::cout << "\rFlip edges... done ("
     << nb_flips_on_surface << "/"

From 0a2865b288be5014834899ebb4f03ed7426f241c Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Fri, 2 Feb 2024 18:58:03 +0100
Subject: [PATCH 1346/1398] When running xmllint over the documentation output
 we get a number of waning's like: ```
 save_Periodic_2_triangulation_2/class_c_g_a_l_1_1_periodic__2__triangulation__2.html:1420:
 parser error : Opening and ending tag mismatch: dd line 1420 and div "This is
 an advanced function.">is_triangulation_in_1_sheet()</a></code>  </div>      
                                                                          ^
 ``` they are a consequence of the fact that a a command is not properly ended
 in this case we have a `\pre` command and its documentation states: > The
 `\pre` command ends when a blank line or some other sectioning command is
 encountered.

and in this case the command is followed by the `\cgalAdvancedEnd` command that does not properly end the `\pre` command.
The same is valid in the other cases.
---
 .../CGAL/Periodic_2_triangulation_2.h                  | 10 +++++++---
 Point_set_3/include/CGAL/Point_set_3.h                 |  2 ++
 .../include/CGAL/Mean_curvature_flow_skeletonization.h |  1 +
 .../doc/TDS_3/Concepts/TriangulationDataStructure_3.h  |  2 ++
 .../Triangulation/CGAL/Triangulation_data_structure.h  |  5 ++++-
 .../CGAL/Constrained_triangulation_plus_2.h            |  1 +
 6 files changed, 17 insertions(+), 4 deletions(-)

diff --git a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h
index 52fa86bf7619..05f9da516bcb 100644
--- a/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h
+++ b/Periodic_2_triangulation_2/doc/Periodic_2_triangulation_2/CGAL/Periodic_2_triangulation_2.h
@@ -511,6 +511,7 @@ class Periodic_2_triangulation_2 : public Triangulation_cw_ccw_2
   Converts the current triangulation into the same periodic
   triangulation in the 1-sheeted covering space.
   \pre `is_triangulation_in_1_sheet()`
+
   \cgalAdvancedEnd
   */
   void convert_to_1_sheeted_covering();
@@ -982,6 +983,7 @@ class Periodic_2_triangulation_2 : public Triangulation_cw_ccw_2
   `f`. Face `f` is modified,
   two new faces are created. If the triangulation contains periodic copies, a point is inserted in all periodic copies.
   \pre The point in vertex `v` lies inside face `f`.
+
   \cgalAdvancedEnd
   */
   Vertex_handle insert_in_face(const Point& p, Face_handle f);
@@ -990,7 +992,9 @@ class Periodic_2_triangulation_2 : public Triangulation_cw_ccw_2
   \cgalAdvancedFunction
   \cgalAdvancedBegin
   Removes a vertex of degree three. Two of the incident faces are
-  destroyed, the third one is modified. \pre Vertex `v` is a vertex with degree three.
+  destroyed, the third one is modified.
+  \pre Vertex `v` is a vertex with degree three.
+
   \cgalAdvancedEnd
   */
   void remove_degree_3(Vertex_handle v);
@@ -1012,8 +1016,8 @@ class Periodic_2_triangulation_2 : public Triangulation_cw_ccw_2
   creates a new vertex `v` and use it to star the hole
   whose boundary is described by the sequence of edges
   `[edge_begin, edge_end]`. Returns a handle to the new vertex.
-
   \pre The triangulation is a triangulation of 1 sheet
+
     \cgalAdvancedEnd
   */
   template<class EdgeIt>
@@ -1027,8 +1031,8 @@ class Periodic_2_triangulation_2 : public Triangulation_cw_ccw_2
   same as above, except that the algorithm
   first recycles faces in the sequence `[face_begin, face_end]`
   and create new ones only when the sequence is exhausted.
-
   \pre The triangulation is a triangulation of 1 sheet
+
   \cgalAdvancedEnd
   */
   template<class EdgeIt, class FaceIt>
diff --git a/Point_set_3/include/CGAL/Point_set_3.h b/Point_set_3/include/CGAL/Point_set_3.h
index f0636f1e14b8..f859ae5c43b0 100644
--- a/Point_set_3/include/CGAL/Point_set_3.h
+++ b/Point_set_3/include/CGAL/Point_set_3.h
@@ -1188,6 +1188,7 @@ class Point_set_3
     \return Returns a pair containing: the specified property map and a
     Boolean set to `true` or an empty property map and a Boolean set
     to `false` (if the property was not found).
+
     \cgalAdvancedEnd
   */
   template <class T>
@@ -1213,6 +1214,7 @@ class Point_set_3
 
     \note The normal property must have been added to the point set
     before calling this method (see `add_normal_map()`).
+
     \cgalAdvancedEnd
   */
   Vector_push_map normal_push_map ()
diff --git a/Surface_mesh_skeletonization/include/CGAL/Mean_curvature_flow_skeletonization.h b/Surface_mesh_skeletonization/include/CGAL/Mean_curvature_flow_skeletonization.h
index 44b422ac0c9d..39b928852eac 100644
--- a/Surface_mesh_skeletonization/include/CGAL/Mean_curvature_flow_skeletonization.h
+++ b/Surface_mesh_skeletonization/include/CGAL/Mean_curvature_flow_skeletonization.h
@@ -528,6 +528,7 @@ std::size_t collapse_short_edges();
   /// after a number of `contract_geometry()`, keeping the specified
   /// vertices fixed in place.
   /// \tparam InputIterator a model of `InputIterator` with `boost::graph_traits<TriangleMesh>::%vertex_descriptor` as value type.
+  ///
   /// \cgalAdvancedEnd
   template<class InputIterator>
   void set_fixed_vertices(InputIterator begin, InputIterator end)
diff --git a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
index bdd21ca6d4ba..03e4ad249288 100644
--- a/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
+++ b/TDS_3/doc/TDS_3/Concepts/TriangulationDataStructure_3.h
@@ -130,6 +130,7 @@ data structure that only changes the vertex type. It has to define a type
 `Rebind_vertex<Vb2>::%Other` which is a <I>rebound</I> triangulation data structure, that is, the
 one whose `TriangulationDSVertexBase_3` will be `Vb2`.
 \note It can be implemented using a nested template class.
+
 \cgalAdvancedEnd
 */
 template <typename Vb2>
@@ -143,6 +144,7 @@ data structure that only changes the cell type. It has to define a type
 `Rebind_cell<Cb2>::%Other` which is a <I>rebound</I> triangulation data structure, that is, the
 one whose `TriangulationDSCellBase_3` will be `Cb2`.
 \note It can be implemented using a nested template class.
+
 \cgalAdvancedEnd
 */
 template <typename Cb2>
diff --git a/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h b/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h
index 666f6ece70cb..842bdbbf31e6 100644
--- a/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h
+++ b/Triangulation/doc/Triangulation/CGAL/Triangulation_data_structure.h
@@ -81,6 +81,7 @@ data structure that only changes the vertex type. It has to define a type
 `Other` which is a <I>rebound</I> triangulation data structure with `Vb2`
 as vertex type.
 \note It can be implemented using a nested template class.
+
 \cgalAdvancedEnd
 */
 template <typename Vb2>
@@ -94,6 +95,7 @@ data structure that only changes the full cell type. It has to define a type
 `Other` which is a <I>rebound</I> triangulation data structure with `Fcb2`
 as full cell type.
 \note It can be implemented using a nested template class.
+
 \cgalAdvancedEnd
 */
 template <typename Fcb2>
@@ -112,8 +114,9 @@ A set `C` of full cells satisfying the same condition as in method
 method creates new full cells from vertex `v` to the boundary of `C`.
 The boundary is recognized by checking the mark of the full cells.
 This method is used by `Triangulation_data_structure::insert_in_hole()`.
-s
+
 \pre same as `TriangulationDataStructure::insert_in_hole()`
+
 \cgalAdvancedEnd
 
 */
diff --git a/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_plus_2.h b/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_plus_2.h
index 3318770f9622..29d2b48d7456 100644
--- a/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_plus_2.h
+++ b/Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_plus_2.h
@@ -516,6 +516,7 @@ constraints based on a cost and stop function.
 \pre The vertex referred by vicq is not contained in any other constraint.
 \pre Let `vip` and `vir` be defined as `vip = std::prev(vicq)` and `vir = std::next(vicr)`.
 \pre The line segment between `*vicp->point()` and `*vicr->point()` must not intersect any constraint.
+
 \cgalAdvancedEnd
  */
 void

From a41564060d63f0453243b27f16f7855c0c7c4812 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Sat, 3 Feb 2024 17:49:03 +0100
Subject: [PATCH 1347/1398] Incorrect layout bisector precondition
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

On the page Kernel_23/group__bisector__grp.html we see for `bisector` with the `Point_3` type arguments in the precondition:
```
‘p != q’
```
instead of
```
p != q
```
due to the fact that there is not a backtick but a single quote as closing part
---
 Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
index 243ca48a93e1..d38b5d9290c1 100644
--- a/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
+++ b/Kernel_23/doc/Kernel_23/CGAL/Kernel/global_functions.h
@@ -367,7 +367,7 @@ const CGAL::Line_2<Kernel> &l2);
 /*!
 constructs the bisector plane of the two points `p` and `q`.
 The bisector is oriented in such a way that `p` lies on its
-positive side. \pre `p != q'.
+positive side. \pre `p != q`.
 */
 template <typename Kernel>
 CGAL::Plane_3<Kernel> bisector(const CGAL::Point_3<Kernel> &p,

From 7109a282afcf758e6f03908e2ccf61168c82fecb Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 5 Feb 2024 09:37:15 +0100
Subject: [PATCH 1348/1398] cleaning

---
 .../Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp      | 1 +
 .../mesh_and_remesh_polyhedral_domain_with_features.cpp         | 2 --
 2 files changed, 1 insertion(+), 2 deletions(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp
index 832fc316a446..0a75dbae932f 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/Tetrahedral_remeshing/Tetrahedral_remeshing_plugin.cpp
@@ -3,6 +3,7 @@
 //#define CGAL_TETRAHEDRAL_REMESHING_DEBUG
 //#define CGAL_TETRAHEDRAL_REMESHING_VERBOSE_PROGRESS
 //#define CGAL_TETRAHEDRAL_REMESHING_PROFILE
+//#define CGAL_FLIP_ON_SURFACE_DISABLE_44_FLIP
 
 #include <QtCore/qglobal.h>
 
diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
index 0efe6498a628..2014827dd51b 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_polyhedral_domain_with_features.cpp
@@ -38,7 +38,6 @@ using Vertex_pair = std::pair<Vertex_handle, Vertex_handle>;
 using Constraints_set = std::unordered_set<Vertex_pair, boost::hash<Vertex_pair>>;
 using Constraints_pmap = CGAL::Boolean_property_map<Constraints_set>;
 
-
 // To avoid verbose function and named parameters call
 using namespace CGAL::parameters;
 
@@ -51,7 +50,6 @@ int main(int argc, char* argv[])
   Polyhedron polyhedron;
 
   std::string filename(fname);
-  //  if (filename.substr(filename.find_last_of(".")).compare(".off") == 0)
   input >> polyhedron;
   if (input.fail()) {
     std::cerr << "Error: Cannot read file " << fname << std::endl;

From 248a0523b3912a081a0486f23277fc9238254217 Mon Sep 17 00:00:00 2001
From: albert-github <albert.tests@gmail.com>
Date: Mon, 5 Feb 2024 11:26:14 +0100
Subject: [PATCH 1349/1398] Space before equal sign in ALIASES

There is a space before the `=`-sign and in the newer version of doxygen this is not accepted anymore.
(probably an unknown side effect).
---
 Documentation/doc/Documentation/Doxyfile.in | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Documentation/doc/Documentation/Doxyfile.in b/Documentation/doc/Documentation/Doxyfile.in
index e33963e5c87a..d3e21f24daab 100644
--- a/Documentation/doc/Documentation/Doxyfile.in
+++ b/Documentation/doc/Documentation/Doxyfile.in
@@ -34,4 +34,4 @@ SEARCHENGINE             = true
 
 ALIASES                 += "cgalPkgDescriptionBegin{2}=\subsection \2 \1"
 ALIASES                 += "cgalPkgManuals{2}=<div class=\"PkgManuals\"> <span> \ref \1 \"User Manual\" </span> <span style=\"padding-left: 20px;\">\ref \2 \"Reference Manual\" </span> </div>"
-ALIASES                 += "cgalReleaseNumber =${CGAL_DOC_VERSION}"
+ALIASES                 += "cgalReleaseNumber=${CGAL_DOC_VERSION}"

From b020e1aa4df67fddf2d11a626ad24f87d0570a33 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 6 Feb 2024 08:32:04 +0000
Subject: [PATCH 1350/1398] Point Set Processing: Remove documentation of
 deprecated functions

---
 Point_set_3/include/CGAL/Point_set_3/IO/LAS.h | 12 ---------
 Point_set_3/include/CGAL/Point_set_3/IO/OFF.h | 12 ---------
 Point_set_3/include/CGAL/Point_set_3/IO/PLY.h | 25 -------------------
 Point_set_3/include/CGAL/Point_set_3/IO/XYZ.h | 12 ---------
 .../PackageDescription.txt                    |  3 ---
 .../doc/Point_set_processing_3/dependencies   |  1 +
 .../include/CGAL/IO/read_las_points.h         |  9 -------
 .../include/CGAL/IO/read_off_points.h         |  6 -----
 .../include/CGAL/IO/read_ply_points.h         | 11 --------
 .../include/CGAL/IO/write_las_points.h        |  9 -------
 .../include/CGAL/IO/write_ply_points.h        | 10 --------
 .../include/CGAL/IO/write_xyz_points.h        |  5 ----
 12 files changed, 1 insertion(+), 114 deletions(-)

diff --git a/Point_set_3/include/CGAL/Point_set_3/IO/LAS.h b/Point_set_3/include/CGAL/Point_set_3/IO/LAS.h
index 2a48f9a3a413..1190c31eed48 100644
--- a/Point_set_3/include/CGAL/Point_set_3/IO/LAS.h
+++ b/Point_set_3/include/CGAL/Point_set_3/IO/LAS.h
@@ -168,12 +168,6 @@ bool read_LAS(const std::string& fname, CGAL::Point_set_3<Point, Vector>& point_
 
 #ifndef CGAL_NO_DEPRECATED_CODE
 
-/*!
-  \ingroup PkgPointSet3IODeprecated
-
-  \deprecated This function is deprecated since \cgal 5.3,
-              \link PkgPointSet3IO `CGAL::IO::read_LAS()` \endlink should be used instead.
- */
 template <typename Point, typename Vector>
 CGAL_DEPRECATED bool read_las_point_set(std::istream& is, ///< input stream.
                                         CGAL::Point_set_3<Point, Vector>& point_set) ///< point set
@@ -404,12 +398,6 @@ bool write_LAS(const std::string& fname,
 
 #ifndef CGAL_NO_DEPRECATED_CODE
 
-/*!
-  \ingroup PkgPointSet3IODeprecated
-
-  \deprecated This function is deprecated since \cgal 5.3,
-              \link PkgPointSet3IO `CGAL::IO::write_LAS()` \endlink should be used instead.
- */
 template <typename Point, typename Vector>
 CGAL_DEPRECATED bool write_las_point_set(std::ostream& os, ///< output stream.
                                          CGAL::Point_set_3<Point, Vector>& point_set)  ///< point set
diff --git a/Point_set_3/include/CGAL/Point_set_3/IO/OFF.h b/Point_set_3/include/CGAL/Point_set_3/IO/OFF.h
index 7fc677cff379..e364ca3b9a71 100644
--- a/Point_set_3/include/CGAL/Point_set_3/IO/OFF.h
+++ b/Point_set_3/include/CGAL/Point_set_3/IO/OFF.h
@@ -94,12 +94,6 @@ bool read_OFF(const std::string& fname, CGAL::Point_set_3<Point, Vector>& point_
 
 #ifndef CGAL_NO_DEPRECATED_CODE
 
-/*!
-  \ingroup PkgPointSet3IODeprecated
-
-  \deprecated This function is deprecated since \cgal 5.3,
-              \link PkgPointSet3IO `CGAL::IO::read_OFF()` \endlink  should be used instead.
- */
 template <typename Point, typename Vector>
 CGAL_DEPRECATED bool read_off_point_set(std::istream& is,  ///< input stream.
                                         CGAL::Point_set_3<Point, Vector>& point_set)  ///< point set.
@@ -190,12 +184,6 @@ bool write_OFF(const std::string& fname, const CGAL::Point_set_3<Point, Vector>&
 
 #ifndef CGAL_NO_DEPRECATED_CODE
 
-/*!
-  \ingroup PkgPointSet3IODeprecated
-
-  \deprecated This function is deprecated since \cgal 5.3,
-              \link PkgPointSet3IO `CGAL::IO::write_OFF()` \endlink  should be used instead.
- */
 template <typename Point, typename Vector>
 CGAL_DEPRECATED bool write_off_point_set(std::ostream& os, ///< output stream.
                                          const CGAL::Point_set_3<Point, Vector>& point_set) ///< point set
diff --git a/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h b/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h
index 67aa82e161c9..bbf47ca97319 100644
--- a/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h
+++ b/Point_set_3/include/CGAL/Point_set_3/IO/PLY.h
@@ -367,25 +367,6 @@ bool read_PLY(const std::string& fname, CGAL::Point_set_3<Point, Vector>& point_
 
 #ifndef CGAL_NO_DEPRECATED_CODE
 
-/*!
-  \ingroup PkgPointSet3IODeprecated
-
-  \deprecated This function is deprecated since \cgal 5.3,
-              \link PkgPointSet3IO `CGAL::IO::read_PLY()` \endlink  should be used instead.
-
-  \brief reads a point set with properties from an input stream in \ascii or binary PLY format.
-
-  - the operator reads the vertex `point` property;
-  - if three PLY properties `nx`, `ny` and `nz` with type `float`
-     or `double` are found, the normal map is added;
-  - if any other PLY property is found, a "[name]" property map is
-    added, where `[name]` is the name of the PLY property.
-
-  The `comments` parameter can be omitted. If provided, it will be
-  used to store the potential comments found in the PLY
-  header. Each line starting by "comment " in the header is
-  appended to the `comments` string (without the "comment " word).
- */
 template <typename Point, typename Vector>
 CGAL_DEPRECATED bool read_ply_point_set(std::istream& is, ///< input stream.
                                         CGAL::Point_set_3<Point, Vector>& point_set, ///< point set
@@ -744,12 +725,6 @@ bool write_PLY(const std::string& fname, const CGAL::Point_set_3<Point, Vector>&
 
 #ifndef CGAL_NO_DEPRECATED_CODE
 
-/*!
-  \ingroup PkgPointSet3IODeprecated
-
-  \deprecated This function is deprecated since \cgal 5.3,
-              \link PkgPointSet3IO `CGAL::IO::write_PLY()` \endlink  should be used instead.
- */
 template <typename Point, typename Vector>
 CGAL_DEPRECATED bool write_ply_point_set(std::ostream& os,
                                          const CGAL::Point_set_3<Point, Vector>& point_set,
diff --git a/Point_set_3/include/CGAL/Point_set_3/IO/XYZ.h b/Point_set_3/include/CGAL/Point_set_3/IO/XYZ.h
index bdf76f541ebe..965d11ff9604 100644
--- a/Point_set_3/include/CGAL/Point_set_3/IO/XYZ.h
+++ b/Point_set_3/include/CGAL/Point_set_3/IO/XYZ.h
@@ -93,12 +93,6 @@ bool read_XYZ(const std::string& fname, CGAL::Point_set_3<Point, Vector>& point_
 
 #ifndef CGAL_NO_DEPRECATED_CODE
 
-/*!
-  \ingroup PkgPointSet3IODeprecated
-
-  \deprecated This function is deprecated since \cgal 5.3,
-              \link PkgPointSet3IO `CGAL::IO::read_XYZ()` \endlink  should be used instead.
- */
 template <typename Point, typename Vector>
 CGAL_DEPRECATED bool read_xyz_point_set(std::istream& is, CGAL::Point_set_3<Point, Vector>& point_set)
 {
@@ -187,12 +181,6 @@ bool write_XYZ(const std::string& fname, const CGAL::Point_set_3<Point, Vector>&
 
 #ifndef CGAL_NO_DEPRECATED_CODE
 
-/*!
-  \ingroup PkgPointSet3IODeprecated
-
-  \deprecated This function is deprecated since \cgal 5.3,
-              \link PkgPointSet3IO `CGAL::IO::write_XYZ()` \endlink  should be used instead.
- */
 template <typename Point, typename Vector>
 CGAL_DEPRECATED bool write_xyz_point_set(std::ostream& os, const CGAL::Point_set_3<Point, Vector>& point_set)
 {
diff --git a/Point_set_processing_3/doc/Point_set_processing_3/PackageDescription.txt b/Point_set_processing_3/doc/Point_set_processing_3/PackageDescription.txt
index f9e3c5b663e1..6e01bf6a819c 100644
--- a/Point_set_processing_3/doc/Point_set_processing_3/PackageDescription.txt
+++ b/Point_set_processing_3/doc/Point_set_processing_3/PackageDescription.txt
@@ -10,9 +10,6 @@ simplification, etc.).
 \defgroup PkgPointSetProcessing3IO I/O Functions
 \ingroup PkgPointSetProcessing3Ref
 
-\defgroup PkgPointSetProcessing3IODeprecated I/O Functions (Deprecated)
-\ingroup PkgPointSetProcessing3IO
-
 \defgroup PkgPointSetProcessing3IOOff I/O (OFF Formats)
 \ingroup PkgPointSetProcessing3Ref
 
diff --git a/Point_set_processing_3/doc/Point_set_processing_3/dependencies b/Point_set_processing_3/doc/Point_set_processing_3/dependencies
index a550c93b6607..4ee2cbfeadc9 100644
--- a/Point_set_processing_3/doc/Point_set_processing_3/dependencies
+++ b/Point_set_processing_3/doc/Point_set_processing_3/dependencies
@@ -12,4 +12,5 @@ Jet_fitting_3
 Solver_interface
 Shape_detection
 Advancing_front_surface_reconstruction
+Point_set_3
 BGL
diff --git a/Point_set_processing_3/include/CGAL/IO/read_las_points.h b/Point_set_processing_3/include/CGAL/IO/read_las_points.h
index 0d034a6bcb11..d0511afc8a6d 100644
--- a/Point_set_processing_3/include/CGAL/IO/read_las_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/read_las_points.h
@@ -574,11 +574,7 @@ bool read_las_points(std::istream& is, ///< input stream.
 
 /// \endcond
 
-/**
- \ingroup PkgPointSetProcessing3IODeprecated
 
- \deprecated This function is deprecated since \cgal 5.3, `CGAL::IO::read_LAS_with_properties()` should be used instead.
-*/
 template <typename OutputIteratorValueType,
           typename OutputIterator,
           typename ... PropertyHandler>
@@ -602,11 +598,6 @@ CGAL_DEPRECATED bool read_las_points_with_properties(std::istream& is,
 
 /// \endcond
 
-/**
- \ingroup PkgPointSetProcessing3IODeprecated
-
- \deprecated This function is deprecated since \cgal 5.3, `CGAL::IO::read_LAS()` should be used instead.
-*/
 template <typename OutputIteratorValueType,
           typename OutputIterator,
           typename CGAL_NP_TEMPLATE_PARAMETERS>
diff --git a/Point_set_processing_3/include/CGAL/IO/read_off_points.h b/Point_set_processing_3/include/CGAL/IO/read_off_points.h
index 660601cb9857..e193661dffdd 100644
--- a/Point_set_processing_3/include/CGAL/IO/read_off_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/read_off_points.h
@@ -410,12 +410,6 @@ bool read_off_points(std::istream& is, ///< input stream.
 
 /// \endcond
 
-/*!
- \ingroup PkgPointSetProcessing3IODeprecated
-
- \deprecated This function is deprecated since \cgal 5.3,
-             \link PkgPointSetProcessing3IOOff `CGAL::IO::read_OFF()` \endlink should be used instead.
-*/
 template <typename OutputIteratorValueType,
           typename OutputIterator,
           typename CGAL_NP_TEMPLATE_PARAMETERS>
diff --git a/Point_set_processing_3/include/CGAL/IO/read_ply_points.h b/Point_set_processing_3/include/CGAL/IO/read_ply_points.h
index 93cf9c91356e..d7ec7d9aa60d 100644
--- a/Point_set_processing_3/include/CGAL/IO/read_ply_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/read_ply_points.h
@@ -434,24 +434,13 @@ bool read_ply_points(std::istream& is, ///< input stream.
 
 /// \endcond
 
-/**
- \ingroup PkgPointSetProcessing3IODeprecated
-
- \deprecated This function is deprecated since \cgal 5.3,
-             \link PkgPointSetProcessing3IOPly `CGAL::IO::read_PLY_with_properties()` \endlink should be used instead.
-  */
 template <typename OutputIteratorValueType, typename OutputIterator, typename ... PropertyHandler>
 CGAL_DEPRECATED bool read_ply_points_with_properties(std::istream& is, OutputIterator output, PropertyHandler&& ... properties)
 {
   return IO::read_PLY_with_properties(is, output, std::forward<PropertyHandler>(properties)...);
 }
 
-/**
-  \ingroup PkgPointSetProcessing3IODeprecated
 
-   \deprecated This function is deprecated since \cgal 5.3,
-               \link PkgPointSetProcessing3IOPly `CGAL::IO::read_PLY()` \endlink should be used instead.
-  */
 template <typename OutputIteratorValueType, typename OutputIterator, typename CGAL_NP_TEMPLATE_PARAMETERS>
 CGAL_DEPRECATED bool read_ply_points(std::istream& is, OutputIterator output, const CGAL_NP_CLASS& np = parameters::default_values())
 {
diff --git a/Point_set_processing_3/include/CGAL/IO/write_las_points.h b/Point_set_processing_3/include/CGAL/IO/write_las_points.h
index c1ccb1596c60..7e27158520e4 100644
--- a/Point_set_processing_3/include/CGAL/IO/write_las_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/write_las_points.h
@@ -378,11 +378,6 @@ bool write_las_points(std::ostream& os, ///< output stream.
 
 /// \endcond
 
-/**
-  \ingroup PkgPointSetProcessing3IODeprecated
-
-  \deprecated This function is deprecated since \cgal 5.3, `CGAL::IO::write_LAS_with_properties()` should be used instead.
-*/
 template <typename PointRange,
           typename PointMap,
           typename ... PropertyHandler>
@@ -397,11 +392,7 @@ CGAL_DEPRECATED bool write_las_points_with_properties(std::ostream& os,
   return IO::write_LAS_with_properties(os, points, point_property, std::forward<PropertyHandler>(properties)...);
 }
 
-/**
-   \ingroup PkgPointSetProcessing3IODeprecated
 
-  \deprecated This function is deprecated since \cgal 5.3, `CGAL::IO::write_LAS()` should be used instead.
-*/
 template <typename PointRange, typename CGAL_NP_TEMPLATE_PARAMETERS>
 bool write_las_points(std::ostream& os, const PointRange& points, const CGAL_NP_CLASS& np = parameters::default_values())
 {
diff --git a/Point_set_processing_3/include/CGAL/IO/write_ply_points.h b/Point_set_processing_3/include/CGAL/IO/write_ply_points.h
index 525bc159023e..0ddbb70d6137 100644
--- a/Point_set_processing_3/include/CGAL/IO/write_ply_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/write_ply_points.h
@@ -353,12 +353,7 @@ bool write_ply_points(std::ostream& os, ///< output stream.
 
 /// \endcond
 
-/**
-\ingroup PkgPointSetProcessing3IODeprecated
 
-\deprecated This function is deprecated since \cgal 5.3,
-            \link PkgPointSetProcessing3IOPly `CGAL::IO::write_PLY_with_properties()` \endlink should be used instead.
-*/
 template <typename PointRange,
           typename ... PropertyHandler>
 CGAL_DEPRECATED bool write_ply_points_with_properties(std::ostream& os, ///< output stream.
@@ -368,12 +363,7 @@ CGAL_DEPRECATED bool write_ply_points_with_properties(std::ostream& os, ///< out
   return IO::write_PLY_with_properties(os, points, std::forward<PropertyHandler>(properties)...);
 }
 
-/**
-\ingroup PkgPointSetProcessing3IODeprecated
 
-\deprecated This function is deprecated since \cgal 5.3,
-            \link PkgPointSetProcessing3IOPly `CGAL::IO::write_PLY()` \endlink should be used instead.
-*/
 template <typename PointRange, typename CGAL_NP_TEMPLATE_PARAMETERS>
 CGAL_DEPRECATED bool write_ply_points(std::ostream& os, const PointRange& points, const CGAL_NP_CLASS& np = parameters::default_values())
 {
diff --git a/Point_set_processing_3/include/CGAL/IO/write_xyz_points.h b/Point_set_processing_3/include/CGAL/IO/write_xyz_points.h
index 43875b1a5d88..036e060367b9 100644
--- a/Point_set_processing_3/include/CGAL/IO/write_xyz_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/write_xyz_points.h
@@ -280,12 +280,7 @@ bool write_xyz_points(std::ostream& os, ///< output stream.
 
 /// \endcond
 
-/**
-  \ingroup PkgPointSetProcessing3IODeprecated
 
-  \deprecated This function is deprecated since \cgal 5.3,
-              \link PkgPointSetProcessing3IOXyz `CGAL::write_XYZ()` \endlink should be used instead.
-*/
 template <typename PointRange, typename CGAL_NP_TEMPLATE_PARAMETERS>
 CGAL_DEPRECATED bool write_xyz_points(std::ostream& os, const PointRange& points, const CGAL_NP_CLASS& np = parameters::default_values())
 {

From dc17aa4b83dbe4b5620c3b245ab1340ed689a230 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 6 Feb 2024 08:52:00 +0000
Subject: [PATCH 1351/1398] Fix comment in example

---
 .../Point_set_processing_3/read_write_xyz_point_set_example.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Point_set_processing_3/examples/Point_set_processing_3/read_write_xyz_point_set_example.cpp b/Point_set_processing_3/examples/Point_set_processing_3/read_write_xyz_point_set_example.cpp
index fd14311a732f..604235ffae9a 100644
--- a/Point_set_processing_3/examples/Point_set_processing_3/read_write_xyz_point_set_example.cpp
+++ b/Point_set_processing_3/examples/Point_set_processing_3/read_write_xyz_point_set_example.cpp
@@ -22,7 +22,7 @@ int main(int argc, char*argv[])
   const std::string fname = (argc>1) ? argv[1] : CGAL::data_file_path("points_3/oni.pwn");
 
   // Reads a .xyz point set file in points[].
-  // Note: read_points() requires an output iterator
+  // Note: read_XYZ() requires an output iterator
   // over points and as well as property maps to access each
   // point position and normal.
   std::vector<Pwn> points;

From d9a542fdd6f2c629ae82edb5ff965a2abf02671c Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 6 Feb 2024 11:21:36 +0000
Subject: [PATCH 1352/1398] fix endcond/namespace

---
 Point_set_processing_3/include/CGAL/IO/read_las_points.h  | 2 +-
 Point_set_processing_3/include/CGAL/IO/read_xyz_points.h  | 4 +++-
 Point_set_processing_3/include/CGAL/IO/write_las_points.h | 2 +-
 3 files changed, 5 insertions(+), 3 deletions(-)

diff --git a/Point_set_processing_3/include/CGAL/IO/read_las_points.h b/Point_set_processing_3/include/CGAL/IO/read_las_points.h
index d0511afc8a6d..ebc1744cc7ef 100644
--- a/Point_set_processing_3/include/CGAL/IO/read_las_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/read_las_points.h
@@ -123,7 +123,7 @@ typedef Base<unsigned short, Id::I> I;
 /**
    \ingroup PkgPointSetProcessing3IOLas
 
-   Generates a %LAS property handler to read 3D points. Points are
+   generates a %LAS property handler to read 3D points. Points are
    constructed from the input the using 3 %LAS properties
    `LAS_property::X`, `LAS_property::Y` and `LAS_property::Z`.
 
diff --git a/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h b/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h
index ba023110950f..25227e846f72 100644
--- a/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h
@@ -245,9 +245,11 @@ bool read_XYZ(const std::string& fname, OutputIterator output, const CGAL_NP_CLA
   return read_XYZ<typename value_type_traits<OutputIterator>::type>(is, output, np);
 }
 
+/// \endcond
+
 } // namespace IO
 
-/// \endcond
+
 
 #ifndef CGAL_NO_DEPRECATED_CODE
 
diff --git a/Point_set_processing_3/include/CGAL/IO/write_las_points.h b/Point_set_processing_3/include/CGAL/IO/write_las_points.h
index 7e27158520e4..400aed2092af 100644
--- a/Point_set_processing_3/include/CGAL/IO/write_las_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/write_las_points.h
@@ -304,7 +304,7 @@ bool write_LAS(std::ostream& os,
 /**
    \ingroup PkgPointSetProcessing3IOLas
 
-   Saves the range of `points` (positions only), using the \ref IOStreamLAS.
+   writes the range of `points` (positions only), using the \ref IOStreamLAS.
 
    \tparam PointRange is a model of `ConstRange`. The value type of
    its iterator is the key type of the named parameter `point_map`.

From 598656d7de0d0fb255c1e205c0b0c69010b50787 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 7 Feb 2024 08:53:58 +0000
Subject: [PATCH 1353/1398] more cleanup

---
 Point_set_processing_3/include/CGAL/IO/read_xyz_points.h  | 7 -------
 Point_set_processing_3/include/CGAL/IO/write_off_points.h | 6 ------
 2 files changed, 13 deletions(-)

diff --git a/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h b/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h
index 25227e846f72..5dd9fa8678f5 100644
--- a/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/read_xyz_points.h
@@ -394,14 +394,7 @@ bool read_xyz_points(std::istream& is, ///< input stream.
 
 /// \endcond
 
-/**
-   \ingroup PkgPointSetProcessing3IODeprecated
-
-   \deprecated This function is deprecated since \cgal 5.3,
-               \link PkgPointSetProcessing3IOXyz `CGAL::IO::read_XYZ()` \endlink should be used instead.
 
-   \returns `true` if reading was successful, `false` otherwise.
-*/
 template <typename OutputIteratorValueType,
           typename OutputIterator,
           typename CGAL_NP_TEMPLATE_PARAMETERS>
diff --git a/Point_set_processing_3/include/CGAL/IO/write_off_points.h b/Point_set_processing_3/include/CGAL/IO/write_off_points.h
index d5411b67fd9a..941bc16d518a 100644
--- a/Point_set_processing_3/include/CGAL/IO/write_off_points.h
+++ b/Point_set_processing_3/include/CGAL/IO/write_off_points.h
@@ -292,12 +292,6 @@ bool write_off_points(std::ostream& os, ///< output stream.
 
 /// \endcond
 
-/**
-  \ingroup PkgPointSetProcessing3IODeprecated
-
-  \deprecated This function is deprecated since \cgal 5.3,
-              \link PkgPointSetProcessing3IOOff `CGAL::IO::write_OFF()` \endlink should be used instead.
-*/
 template <typename PointRange, typename CGAL_NP_TEMPLATE_PARAMETERS>
 CGAL_DEPRECATED bool write_off_points(std::ostream& os, const PointRange& points, const CGAL_NP_CLASS& np = parameters::default_values())
 {

From 86e0943dd0742d586388e83605452a30a158e206 Mon Sep 17 00:00:00 2001
From: Marc Glisse <marc.glisse@inria.fr>
Date: Wed, 7 Feb 2024 20:06:29 +0100
Subject: [PATCH 1354/1398] Don't set the point again when reinserting the same
 point

---
 Triangulation/include/CGAL/Delaunay_triangulation.h | 3 +--
 Triangulation/include/CGAL/Triangulation.h          | 1 -
 2 files changed, 1 insertion(+), 3 deletions(-)

diff --git a/Triangulation/include/CGAL/Delaunay_triangulation.h b/Triangulation/include/CGAL/Delaunay_triangulation.h
index 8fa25e4d08ca..7a10b57b12f3 100644
--- a/Triangulation/include/CGAL/Delaunay_triangulation.h
+++ b/Triangulation/include/CGAL/Delaunay_triangulation.h
@@ -673,7 +673,6 @@ ::insert(const Point & p, Locate_type lt, const Face & f, const Facet &, Full_ce
         case Base::ON_VERTEX:
         {
             Vertex_handle v = s->vertex(f.index(0));
-            v->set_point(p);
             return v;
             break;
         }
@@ -762,7 +761,7 @@ ::insert_outside_affine_hull(const Point & p)
 
 Inserts the point `p` in the Delaunay triangulation. Returns a handle to the
 (possibly newly created) vertex at that position.
-\pre The point `p` must be in conflict with the full cell `c`.
+\pre The point `p` must be in conflict with the full cell `s`.
 */
 template< typename DCTraits, typename TDS >
 typename Delaunay_triangulation<DCTraits, TDS>::Vertex_handle
diff --git a/Triangulation/include/CGAL/Triangulation.h b/Triangulation/include/CGAL/Triangulation.h
index 1c1bff783702..1a4d38608585 100644
--- a/Triangulation/include/CGAL/Triangulation.h
+++ b/Triangulation/include/CGAL/Triangulation.h
@@ -843,7 +843,6 @@ ::insert(const Point & p, Locate_type lt, const Face & f, const Facet & ft, Full
             return insert_in_face(p, f);
             break;
         case ON_VERTEX:
-            s->vertex(f.index(0))->set_point(p);
             return s->vertex(f.index(0));
             break;
     }

From 3664fc8fdb24b99918a256b74c458f0465453121 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 8 Feb 2024 11:04:28 +0100
Subject: [PATCH 1355/1398] fix for MSVC projects

---
 Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
index 6d87527630e1..aaea742ca1d3 100644
--- a/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
+++ b/Polyhedron/demo/Polyhedron/polyhedron_demo_macros.cmake
@@ -39,7 +39,7 @@ include(${CGAL_MODULES_DIR}/CGAL_add_test.cmake)
       target_link_libraries( ${plugin_name} PUBLIC Polyhedron_demo_framework)
       add_dependencies(${plugin_name} Polyhedron_demo_framework)
     endif()
-    if(TARGET "compilation_of__demo_framework")
+    if(TARGET "compilation_of__demo_framework" AND TEST "compilation of  ${plugin_name}")
       set_property(TEST "compilation of  ${plugin_name}" APPEND PROPERTY FIXTURES_REQUIRED demo_framework_SetupFixture)
     endif()
     # Link with CGAL

From a77296fbc49aa34d65d799739cb199e9348f89f5 Mon Sep 17 00:00:00 2001
From: Sven Oesau <sven.oesau@geometryfactory.com>
Date: Thu, 8 Feb 2024 12:10:53 +0100
Subject: [PATCH 1356/1398] fix for degenerate polygons for bug introduced by
 https://github.com/CGAL/cgal/pull/7898

---
 Polyhedron/demo/Polyhedron/triangulate_primitive.h | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/Polyhedron/demo/Polyhedron/triangulate_primitive.h b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
index 21c6223a9ea8..54fceb64eb3c 100644
--- a/Polyhedron/demo/Polyhedron/triangulate_primitive.h
+++ b/Polyhedron/demo/Polyhedron/triangulate_primitive.h
@@ -180,6 +180,10 @@ class FacetTriangulator
     if(previous != first && !skip[0])
       cdt->insert_constraint(previous, first);
 
+    // ignore degenerate polygons
+    if (cdt->dimension() != 2)
+      return true;
+
     // sets mark is_external
     for(Face_handle f2 : cdt->all_face_handles())
       f2->info().is_external = false;

From 6ac5b7d871f96d0edd8c9e178ec08dcd4e38a2d5 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 9 Feb 2024 09:10:58 +0000
Subject: [PATCH 1357/1398] Aos: Add default and copy constructor to avoid
 warning

---
 .../gfx/Curve_renderer_internals.h                           | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
index 1cbc6be55359..dcba2b07e185 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
@@ -90,8 +90,11 @@ struct Pixel_2_
 
     Integer sub_x, sub_y; // subpixel coordinates relative to pixel's boundary
                           // (always 0 for pixels)
+    Pixel_2_() = default;
 
-    Pixel_2_& operator =(const Pixel_2_& pix) = default;
+    Pixel_2_(const Pixel_2_&) = default;
+
+    Pixel_2_& operator =(const Pixel_2_&) = default;
 
     bool operator ==(const Pixel_2_& pix) const {
         return (

From 790d9ca8be43d3f1fd2fba97d35f44abc3038fb9 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 9 Feb 2024 09:11:32 +0000
Subject: [PATCH 1358/1398] Do not include deprecated boost header file

---
 .../demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp
index 5e98113dabc5..2a97cf191936 100644
--- a/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp
+++ b/Arrangement_on_surface_2/demo/Arrangement_on_surface_2/Utils/IntersectCurves.cpp
@@ -11,7 +11,7 @@
 
 #include "IntersectCurves.h"
 #include "ArrangementTypes.h"
-#include <boost/function_output_iterator.hpp>
+#include <boost/iterator/function_output_iterator.hpp>
 
 
 template <typename Traits_>

From d12baf74c20ab5872433772a421154ffbb58f902 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 9 Feb 2024 09:12:38 +0000
Subject: [PATCH 1359/1398] Try to avoid a non-initialized warning by
 initializing with std::nullopt

---
 .../include/CGAL/AABB_tree/internal/AABB_traversal_traits.h   | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_traversal_traits.h b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_traversal_traits.h
index 645ce1347cb2..ce9a56e15b9d 100644
--- a/AABB_tree/include/CGAL/AABB_tree/internal/AABB_traversal_traits.h
+++ b/AABB_tree/include/CGAL/AABB_tree/internal/AABB_traversal_traits.h
@@ -73,7 +73,7 @@ class First_intersection_traits
   Result;
 public:
   First_intersection_traits(const AABBTraits& traits)
-    : m_result(), m_traits(traits)
+    : m_result(std::nullopt), m_traits(traits)
   {}
 
   bool go_further() const {
@@ -202,7 +202,7 @@ class First_primitive_traits
 public:
   First_primitive_traits(const AABBTraits& traits)
     : m_is_found(false)
-    , m_result()
+    , m_result(std::nullopt)
     , m_traits(traits) {}
 
   bool go_further() const { return !m_is_found; }

From e1442ecefb0a9eb4898b2bc469fa21454042f434 Mon Sep 17 00:00:00 2001
From: Marc Glisse <marc.glisse@inria.fr>
Date: Fri, 9 Feb 2024 15:54:59 +0100
Subject: [PATCH 1360/1398] Document new ON_VERTEX insertion behavior

---
 Triangulation/doc/Triangulation/CGAL/Delaunay_triangulation.h | 4 ++--
 Triangulation/doc/Triangulation/CGAL/Triangulation.h          | 3 +--
 2 files changed, 3 insertions(+), 4 deletions(-)

diff --git a/Triangulation/doc/Triangulation/CGAL/Delaunay_triangulation.h b/Triangulation/doc/Triangulation/CGAL/Delaunay_triangulation.h
index 322cfb517567..e5f08dd1d5e7 100644
--- a/Triangulation/doc/Triangulation/CGAL/Delaunay_triangulation.h
+++ b/Triangulation/doc/Triangulation/CGAL/Delaunay_triangulation.h
@@ -125,8 +125,8 @@ value of `lt`:
 <DT><B>`OUTSIDE_AFFINE_HULL`</B><DD> Point
 `p` is inserted so as to increase the current dimension of the Delaunay
 triangulation.
-<DT><B>`ON_VERTEX`</B><DD> The position of the vertex `v` described by `f`
-is set to `p`. `v` is returned. <DT><B>Anything else</B><DD> The point `p`
+<DT><B>`ON_VERTEX`</B><DD> The triangulation remains unchanged.
+<DT><B>Anything else</B><DD> The point `p`
 is inserted. the full cell `c` <I>is assumed</I> to be in conflict
 with `p`.
 </DL>
diff --git a/Triangulation/doc/Triangulation/CGAL/Triangulation.h b/Triangulation/doc/Triangulation/CGAL/Triangulation.h
index 1d7b0e1a65d2..32188c443238 100644
--- a/Triangulation/doc/Triangulation/CGAL/Triangulation.h
+++ b/Triangulation/doc/Triangulation/CGAL/Triangulation.h
@@ -556,8 +556,7 @@ Inserts point `p` into the triangulation and returns a handle to the
 `Vertex` at that position. The action taken depends on the value of
 `loc_type`:
 
-<DL> <DT><B>`ON_VERTEX`</B><DD> The point of the
-p`Vertex` described by `f` is set to `p`.
+<DL> <DT><B>`ON_VERTEX`</B><DD> The triangulation remains unchanged.
 <DT><B>`IN_FACE`</B><DD> The point `p` is inserted in the `Face f`.
 <DT><B>`IN_FACET`</B><DD> The point `p` is inserted in the `Facet ft`.
 <DT><B>Anything else</B><DD> The point `p` is inserted in the triangulation according to the value

From 0b71a05d629e1778d30daae3eb6e599277a7f21c Mon Sep 17 00:00:00 2001
From: Marc Glisse <marc.glisse@inria.fr>
Date: Fri, 9 Feb 2024 16:03:27 +0100
Subject: [PATCH 1361/1398] Announce the "breaking" change

Though I would be surprised if anyone was affected negatively.
---
 Installation/CHANGES.md | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index be4ec7fd2b9f..c0500f9645ca 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -76,6 +76,12 @@ Release date: October 2023
 -   Added three functions `vertices()` to the class `Triangulation_3`.
     Each of them returns an array containing the vertices of the given triangulation simplex.
 
+### [dD Triangulations](https://doc.cgal.org/6.0/Manual/packages.html#PkgTriangulations)
+-   **Breaking change**: Inserting multiple unweighted points in the same
+    position now keeps the first one, instead of switching to the latest. This
+    only affects custom point types where not all points in the same position
+    are equivalent.
+
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------
 

From 1e64d0de5157e9aead6858c38f19fe4404bcefd8 Mon Sep 17 00:00:00 2001
From: Marc Glisse <marc.glisse@inria.fr>
Date: Sat, 10 Feb 2024 18:21:44 +0100
Subject: [PATCH 1362/1398] Call 3d static filters from NewKernel_d

---
 .../NewKernel_d/Cartesian_static_filters.h    | 86 ++++++++++++++++++-
 1 file changed, 83 insertions(+), 3 deletions(-)

diff --git a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h
index 122cfe90885b..a89d2da9b1e7 100644
--- a/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h
+++ b/NewKernel_d/include/CGAL/NewKernel_d/Cartesian_static_filters.h
@@ -16,6 +16,8 @@
 #include <CGAL/Filtered_kernel/internal/Static_filters/tools.h> // bug, should be included by the next one
 #include <CGAL/Filtered_kernel/internal/Static_filters/Orientation_2.h>
 #include <CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_circle_2.h>
+#include <CGAL/Filtered_kernel/internal/Static_filters/Orientation_3.h>
+#include <CGAL/Filtered_kernel/internal/Static_filters/Side_of_oriented_sphere_3.h>
 
 namespace CGAL {
 namespace SFA { // static filter adapter
@@ -80,7 +82,72 @@ template <class Base_,class R_> struct Side_of_oriented_sphere_2 : private Store
                 return typename internal::Static_filters_predicates::Side_of_oriented_circle_2<Adapter>()(P(this->kernel(),c,A),P(this->kernel(),c,B),P(this->kernel(),c,C),P(this->kernel(),c,D));
         }
 };
-}
+
+template <class Base_,class R_> struct Adapter_3 {
+        typedef typename Get_type<R_, Point_tag>::type Point;
+        typedef typename Get_functor<R_, Compute_point_cartesian_coordinate_tag>::type CC;
+        typedef typename Get_functor<Base_, Orientation_of_points_tag>::type Orientation_base;
+        typedef typename Get_functor<Base_, Side_of_oriented_sphere_tag>::type Side_of_oriented_sphere_base;
+        struct Point_3 {
+                R_ const&r; CC const&c; Point const& p;
+                Point_3(R_ const&r_, CC const&c_, Point const&p_):r(r_),c(c_),p(p_){}
+                decltype(auto) x()const{return c(p,0);}
+                decltype(auto) y()const{return c(p,1);}
+                decltype(auto) z()const{return c(p,2);}
+        };
+        struct Vector_3 {};
+        struct Sphere_3 {};
+        struct Tetrahedron_3 {};
+        struct Orientation_3 {
+                typedef typename Get_type<R_, Orientation_tag>::type result_type;
+                auto operator()(Point_3 const&A, Point_3 const&B, Point_3 const&C, Point_3 const&D)const{
+                        Point const* t[]={&A.p,&B.p,&C.p,&D.p};
+                        return Orientation_base(A.r)(make_transforming_iterator<Dereference_functor>(t+0),make_transforming_iterator<Dereference_functor>(t+4));
+                }
+        };
+        struct Side_of_oriented_sphere_3 {
+                typedef typename Get_type<R_, Oriented_side_tag>::type result_type;
+                auto operator()(Point_3 const&A, Point_3 const&B, Point_3 const&C, Point_3 const&D, Point_3 const&E)const{
+                        Point const* t[]={&A.p,&B.p,&C.p,&D.p};
+                        return Side_of_oriented_sphere_base(A.r)(make_transforming_iterator<Dereference_functor>(t+0),make_transforming_iterator<Dereference_functor>(t+4),E.p);
+                }
+        };
+};
+template <class Base_,class R_> struct Orientation_of_points_3 : private Store_kernel<R_> {
+        CGAL_FUNCTOR_INIT_STORE(Orientation_of_points_3)
+        typedef typename Get_type<R_, Point_tag>::type Point;
+        typedef typename Get_type<R_, Orientation_tag>::type result_type;
+        typedef typename Get_functor<R_, Compute_point_cartesian_coordinate_tag>::type CC;
+        typedef Adapter_3<Base_, R_> Adapter;
+        template<class Iter> result_type operator()(Iter f, Iter CGAL_assertion_code(e))const{
+                CC c(this->kernel());
+                Point const& A=*f;
+                Point const& B=*++f;
+                Point const& C=*++f;
+                Point const& D=*++f;
+                CGAL_assertion(++f==e);
+                typedef typename Adapter::Point_3 P;
+                return typename internal::Static_filters_predicates::Orientation_3<Adapter>()(P(this->kernel(),c,A),P(this->kernel(),c,B),P(this->kernel(),c,C),P(this->kernel(),c,D));
+        }
+};
+template <class Base_,class R_> struct Side_of_oriented_sphere_3 : private Store_kernel<R_> {
+        CGAL_FUNCTOR_INIT_STORE(Side_of_oriented_sphere_3)
+        typedef typename Get_type<R_, Point_tag>::type Point;
+        typedef typename Get_type<R_, Oriented_side_tag>::type result_type;
+        typedef typename Get_functor<R_, Compute_point_cartesian_coordinate_tag>::type CC;
+        typedef Adapter_3<Base_, R_> Adapter;
+        template<class Iter> result_type operator()(Iter f, Iter CGAL_assertion_code(e), Point const& E)const{
+                CC c(this->kernel());
+                Point const& A=*f;
+                Point const& B=*++f;
+                Point const& C=*++f;
+                Point const& D=*++f;
+                CGAL_assertion(++f==e);
+                typedef typename Adapter::Point_3 P;
+                return typename internal::Static_filters_predicates::Side_of_oriented_sphere_3<Adapter>()(P(this->kernel(),c,A),P(this->kernel(),c,B),P(this->kernel(),c,C),P(this->kernel(),c,D),P(this->kernel(),c,E));
+        }
+};
+} // namespace SFA
 
 template <class Dim_ /* should be implicit */, class R_, class Derived_=Default>
 struct Cartesian_static_filters : public R_ {
@@ -109,6 +176,19 @@ struct Cartesian_static_filters<Dimension_tag<2>, R_, Derived_> : public R_ {
         };
 };
 
-}
-
+template <class R_, class Derived_>
+struct Cartesian_static_filters<Dimension_tag<3>, R_, Derived_> : public R_ {
+  constexpr Cartesian_static_filters(){}
+  constexpr Cartesian_static_filters(int d):R_(d){}
+        typedef Cartesian_static_filters<Dimension_tag<3>, R_, Derived_> Self;
+        typedef typename Default::Get<Derived_,Self>::type Derived;
+        template <class T, class=void> struct Functor : Inherit_functor<R_, T> {};
+        template <class D> struct Functor <Orientation_of_points_tag,D> {
+                typedef SFA::Orientation_of_points_3<R_,Derived> type;
+        };
+        template <class D> struct Functor <Side_of_oriented_sphere_tag,D> {
+                typedef SFA::Side_of_oriented_sphere_3<R_,Derived> type;
+        };
+};
+} // namespace CGAL
 #endif

From 270a2398d6ab397a72fd881f108ebf6724ff136c Mon Sep 17 00:00:00 2001
From: Marc Glisse <marc.glisse@inria.fr>
Date: Sat, 10 Feb 2024 20:40:17 +0100
Subject: [PATCH 1363/1398] Use 'if' rather than %

---
 Triangulation/include/CGAL/Triangulation.h | 14 +++++++++++---
 1 file changed, 11 insertions(+), 3 deletions(-)

diff --git a/Triangulation/include/CGAL/Triangulation.h b/Triangulation/include/CGAL/Triangulation.h
index 1c1bff783702..dc6a0a3e81f4 100644
--- a/Triangulation/include/CGAL/Triangulation.h
+++ b/Triangulation/include/CGAL/Triangulation.h
@@ -993,7 +993,7 @@ ::insert_outside_affine_hull(const Point & p)
             // Otherwise, let's find the right infinite cell
             else
             {
-                inf_v_cell = inf_v_cell->neighbor((inf_v_index + 1) % 2);
+                inf_v_cell = inf_v_cell->neighbor((inf_v_index + 1) & 1);
                 inf_v_index = inf_v_cell->index(infinite_vertex());
                 // Is "inf_v_cell" the right infinite cell?
                 // Then inf_v_index should be 1
@@ -1096,9 +1096,14 @@ ::do_locate(const Point & p, // query point
         // For the remembering stochastic walk, we need to start trying
         // with a random index:
         int j, i = rng_.get_int(0, cur_dim);
-        // we check |p| against all the full_cell's hyperplanes in turn
 
-        for(j = 0; j <= cur_dim; ++j, i = (i + 1) % (cur_dim + 1) )
+        // i = (i + 1) % m where 0 <= i < m
+        auto incr_mod = [] (int&i, int m) {
+          if( ++i >= m ) i = 0; // >= or ==
+        };
+
+        // we check |p| against all the full_cell's hyperplanes in turn
+        for(j = 0; j <= cur_dim; ++j, incr_mod(i, cur_dim + 1))
         {
             Full_cell_handle next = s->neighbor(i);
             if( previous == next )
@@ -1127,6 +1132,9 @@ ::do_locate(const Point & p, // query point
             // full_cell because orientation_[i] == NEGATIVE
             previous = s;
             s = next;
+            // We only need to test is_infinite(next->vertex(next->index(previous)))
+            // or equivalently is_infinite(next->vertex(previous->mirror_index(i)))
+            // but it does not seem to help, even when storing mirror indices.
             if( is_infinite(next) )
             {   // we have arrived OUTSIDE the convex hull of the triangulation,
                 // so we stop the search

From 7a6cae6e7b34c3b56adc409f5d38435af3c9e715 Mon Sep 17 00:00:00 2001
From: Marc Glisse <marc.glisse@inria.fr>
Date: Sat, 10 Feb 2024 22:56:06 +0100
Subject: [PATCH 1364/1398] Store index/dimension in 8 bits

---
 .../include/CGAL/TDS_full_cell_mirror_storage_policy.h      | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/Triangulation/include/CGAL/TDS_full_cell_mirror_storage_policy.h b/Triangulation/include/CGAL/TDS_full_cell_mirror_storage_policy.h
index f3e3bf770d14..748e82286e91 100644
--- a/Triangulation/include/CGAL/TDS_full_cell_mirror_storage_policy.h
+++ b/Triangulation/include/CGAL/TDS_full_cell_mirror_storage_policy.h
@@ -14,8 +14,8 @@
 
 #include <CGAL/license/Triangulation.h>
 
-
 #include <CGAL/TDS_full_cell_default_storage_policy.h>
+#include <cstdint>
 
 namespace CGAL {
 
@@ -30,7 +30,7 @@ struct   TFC_data< Vertex_handle, Full_cell_handle, Maximal_dimension, TDS_full_
     typedef TFC_data< Vertex_handle, Full_cell_handle, Maximal_dimension, TDS_full_cell_default_storage_policy > Base;
     typedef typename Base::Vertex_handle_array          Vertex_handle_array;
     typedef typename Base::Full_cell_handle_array         Full_cell_handle_array;
-    typedef typename internal::S_or_D_array< int, typename Base::Dimen_plus >   Int_array;
+    typedef typename internal::S_or_D_array< std::uint_least8_t, typename Base::Dimen_plus >   Int_array;
 
 private:
     Int_array            mirror_vertices_;
@@ -42,7 +42,7 @@ struct   TFC_data< Vertex_handle, Full_cell_handle, Maximal_dimension, TDS_full_
 
     void set_mirror_index(const int i, const int index)
     {
-        mirror_vertices_[i] = index;
+        mirror_vertices_[i] = static_cast<std::uint_least8_t>(index);
     }
     int mirror_index(const int i) const
     {

From d5db17747ceffcfd3428cfedd7dc6672f5b7c8c3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 13 Feb 2024 11:36:49 +0100
Subject: [PATCH 1365/1398] set focus to the ok button

---
 Polyhedron/demo/Polyhedron/File_loader_dialog.h | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Polyhedron/demo/Polyhedron/File_loader_dialog.h b/Polyhedron/demo/Polyhedron/File_loader_dialog.h
index 99fb143ab92a..059938c3386a 100644
--- a/Polyhedron/demo/Polyhedron/File_loader_dialog.h
+++ b/Polyhedron/demo/Polyhedron/File_loader_dialog.h
@@ -19,6 +19,7 @@ class File_loader_dialog : public QDialog, private Ui::FileLoaderDialog
     {
       File_loader_dialog dialog;
       dialog.buttonBox->button(QDialogButtonBox::Ok)->setDefault(true);
+      dialog.buttonBox->button(QDialogButtonBox::Ok)->setFocus();
       dialog.pluginBox->addItems(item_list);
       dialog.label->setText(tr("Available loaders for %1 :").arg(filename));
       QFileInfo fileinfo(filename);

From 2cd718a0e775fe95f4f6eb2afae927f2f812fdfe Mon Sep 17 00:00:00 2001
From: Marc Glisse <marc.glisse@inria.fr>
Date: Wed, 14 Feb 2024 09:36:15 +0100
Subject: [PATCH 1366/1398] Use a signed type for the index

value -1 is used
---
 .../include/CGAL/TDS_full_cell_mirror_storage_policy.h        | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Triangulation/include/CGAL/TDS_full_cell_mirror_storage_policy.h b/Triangulation/include/CGAL/TDS_full_cell_mirror_storage_policy.h
index 748e82286e91..63176f5ed30f 100644
--- a/Triangulation/include/CGAL/TDS_full_cell_mirror_storage_policy.h
+++ b/Triangulation/include/CGAL/TDS_full_cell_mirror_storage_policy.h
@@ -30,7 +30,7 @@ struct   TFC_data< Vertex_handle, Full_cell_handle, Maximal_dimension, TDS_full_
     typedef TFC_data< Vertex_handle, Full_cell_handle, Maximal_dimension, TDS_full_cell_default_storage_policy > Base;
     typedef typename Base::Vertex_handle_array          Vertex_handle_array;
     typedef typename Base::Full_cell_handle_array         Full_cell_handle_array;
-    typedef typename internal::S_or_D_array< std::uint_least8_t, typename Base::Dimen_plus >   Int_array;
+    typedef typename internal::S_or_D_array< std::int_least8_t, typename Base::Dimen_plus >   Int_array;
 
 private:
     Int_array            mirror_vertices_;
@@ -42,7 +42,7 @@ struct   TFC_data< Vertex_handle, Full_cell_handle, Maximal_dimension, TDS_full_
 
     void set_mirror_index(const int i, const int index)
     {
-        mirror_vertices_[i] = static_cast<std::uint_least8_t>(index);
+        mirror_vertices_[i] = static_cast<std::int_least8_t>(index);
     }
     int mirror_index(const int i) const
     {

From 8fe89f4199b0d4248d518bd6f17b22f87045af76 Mon Sep 17 00:00:00 2001
From: Efi Fogel <efifogel@gmail.com>
Date: Wed, 14 Feb 2024 11:50:17 +0200
Subject: [PATCH 1367/1398] Commmented out unused variables

---
 Envelope_3/include/CGAL/Env_plane_traits_3.h  | 2 +-
 Envelope_3/include/CGAL/Env_sphere_traits_3.h | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/Envelope_3/include/CGAL/Env_plane_traits_3.h b/Envelope_3/include/CGAL/Env_plane_traits_3.h
index 3f9fb48b4cb5..d0eb60494621 100644
--- a/Envelope_3/include/CGAL/Env_plane_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_plane_traits_3.h
@@ -239,7 +239,7 @@ class Env_plane_traits_3 : public ArrLinearTraits {
       const Line_2& line = cv.supp_line();
       const FT& a3 = line.a();
       const FT& b3 = line.b();
-      const FT& c3 = line.c();
+      // const FT& c3 = line.c();       // unused
 
       // if the line was parallel to the y-axis (i.e x = const),
       // then it was enough to compare dz/dx of both planes
diff --git a/Envelope_3/include/CGAL/Env_sphere_traits_3.h b/Envelope_3/include/CGAL/Env_sphere_traits_3.h
index 67959b4ebe3b..3d272f81b29f 100644
--- a/Envelope_3/include/CGAL/Env_sphere_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_sphere_traits_3.h
@@ -976,7 +976,7 @@ class Env_sphere_traits_3 : public ConicTraits_2 {
     const Rational& t = cv.t();
     const Rational& u = cv.u();
     const Rational& v = cv.v();
-    const Rational& w = cv.w();
+    // const Rational& w = cv.w();      // unused
     Algebraic m = -1 * (2*r*x0 + t*y0 + u);
     Algebraic n = 2*s*y0 + t*x0 + v;
     // line coefficients: A3, B3, C3

From b01bb60534a064c795f63c7384df49a2f963f32a Mon Sep 17 00:00:00 2001
From: Marc Glisse <marc.glisse@inria.fr>
Date: Wed, 14 Feb 2024 11:42:21 +0100
Subject: [PATCH 1368/1398] Document limit on dimension.

---
 .../doc/Triangulation/CGAL/Triangulation_ds_full_cell.h         | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_full_cell.h b/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_full_cell.h
index 148985c11b77..9aab53b759f0 100644
--- a/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_full_cell.h
+++ b/Triangulation/doc/Triangulation/CGAL/Triangulation_ds_full_cell.h
@@ -37,7 +37,7 @@ indices are not stored).
 <LI>`CGAL::TDS_full_cell_default_storage_policy`. In that case, the mirror
 indices are not stored.
 <LI>`CGAL::TDS_full_cell_mirror_storage_policy`. In that case, the mirror
-indices are stored.
+indices are stored. This last policy is not supported when the dimension is larger than 127.
 </UL>
 See the user manual for how to choose the second option.
 

From 00e046346b8190e1d4c0979ff7500e559caa9974 Mon Sep 17 00:00:00 2001
From: Marc Glisse <marc.glisse@inria.fr>
Date: Wed, 14 Feb 2024 11:46:02 +0100
Subject: [PATCH 1369/1398] Announce breaking change

---
 Installation/CHANGES.md | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/Installation/CHANGES.md b/Installation/CHANGES.md
index be4ec7fd2b9f..208450afaf5c 100644
--- a/Installation/CHANGES.md
+++ b/Installation/CHANGES.md
@@ -76,6 +76,9 @@ Release date: October 2023
 -   Added three functions `vertices()` to the class `Triangulation_3`.
     Each of them returns an array containing the vertices of the given triangulation simplex.
 
+### [dD Triangulations](https://doc.cgal.org/6.0/Manual/packages.html#PkgTriangulations)
+-   **Breaking change**: `CGAL::TDS_full_cell_mirror_storage_policy` is now unsupported in dimension larger than 127.
+
 [Release 5.6](https://github.com/CGAL/cgal/releases/tag/v5.6)
 -----------
 

From 871a9bb1df9b03373a6ea2dceabf2c68b4145725 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 14 Feb 2024 11:04:46 +0000
Subject: [PATCH 1370/1398] Follow Laurent's suggestion and remove a =default
 instead of adding two

---
 .../gfx/Curve_renderer_internals.h                           | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
index dcba2b07e185..636b7919b334 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/gfx/Curve_renderer_internals.h
@@ -90,11 +90,6 @@ struct Pixel_2_
 
     Integer sub_x, sub_y; // subpixel coordinates relative to pixel's boundary
                           // (always 0 for pixels)
-    Pixel_2_() = default;
-
-    Pixel_2_(const Pixel_2_&) = default;
-
-    Pixel_2_& operator =(const Pixel_2_&) = default;
 
     bool operator ==(const Pixel_2_& pix) const {
         return (

From 4b574dca8ebff69dd34a51de55f196b965f60e07 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Wed, 14 Feb 2024 11:43:34 +0000
Subject: [PATCH 1371/1398] Add tests

---
 .../test/Kernel_23/include/CGAL/_test_3.h     |  2 +
 .../include/CGAL/_test_fct_segment_2.h        |  3 ++
 .../include/CGAL/_test_fct_segment_3.h        | 43 +++++++++++++++++++
 .../include/CGAL/_test_fct_vector_2.h         |  1 +
 .../include/CGAL/_test_fct_vector_3.h         |  1 +
 5 files changed, 50 insertions(+)
 create mode 100644 Kernel_23/test/Kernel_23/include/CGAL/_test_fct_segment_3.h

diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_3.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_3.h
index 02a5e6cf20ce..40b992a857e7 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_3.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_3.h
@@ -31,6 +31,7 @@
 #include "_test_cls_plane_3.h"
 #include "_test_cls_line_3.h"
 #include "_test_cls_segment_3.h"
+#include "_test_fct_segment_3.h"
 #include "_test_cls_sphere_3.h"
 #include "_test_cls_ray_3.h"
 #include "_test_cls_triangle_3.h"
@@ -51,6 +52,7 @@ _test_3(const R& r)
  && _test_fct_point_3(r)
  && _test_fct_weighted_point_3(r)
  && _test_fct_plane_3(r)
+ && _test_fct_segment_3(r)
  && _test_further_fct_point_plane_3(r)
  && _test_cls_direction_3(r)
  && _test_cls_plane_3( r )
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_segment_2.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_segment_2.h
index d97d8c0b1111..9ed30767567c 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_segment_2.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_segment_2.h
@@ -111,6 +111,9 @@ _test_fct_segment_2(const R& )
  assert( CGAL::compare_slope(l6, l9) == CGAL::LARGER );
  assert( CGAL::compare_slope(l9, l7) == CGAL::SMALLER );
 
+ std::cout <<'.';
+ assert( CGAL::squared_distance(l9.source(), l9.target()) == CGAL::squared_length(l9) );
+
  std::cout << "done" << std::endl;
  return true;
 }
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_segment_3.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_segment_3.h
new file mode 100644
index 000000000000..ad0d419ae462
--- /dev/null
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_segment_3.h
@@ -0,0 +1,43 @@
+// Copyright (c) 1999
+// Utrecht University (The Netherlands),
+// ETH Zurich (Switzerland),
+// INRIA Sophia-Antipolis (France),
+// Max-Planck-Institute Saarbruecken (Germany),
+// and Tel-Aviv University (Israel).  All rights reserved.
+//
+// This file is part of CGAL (www.cgal.org)
+//
+// $URL$
+// $Id$
+// SPDX-License-Identifier: LGPL-3.0-or-later
+//
+//
+// Author(s)     : Susan Hert
+
+
+#ifndef CGAL__TEST_FCT_SEGMENT_3_H
+#define CGAL__TEST_FCT_SEGMENT_3_H
+
+template <class R>
+bool
+_test_fct_segment_3(const R& )
+{
+ std::cout << "Testing functions Segment_3" ;
+
+ typedef typename  R::RT          RT;
+
+ typedef typename  R::Point_3     Point_3;
+ typedef typename  R::Segment_3   Segment_3;
+
+ Point_3 p1 ( RT(0), RT(0), RT(0), RT(1) );
+ Point_3 p2 ( RT(1), RT(1), RT(1), RT(1) );
+
+
+  Segment_3 l1(p1, p2);
+  assert( CGAL::squared_distance(l1.source(), l1.target()) == CGAL::squared_length(l1) );
+
+ std::cout << "done" << std::endl;
+ return true;
+}
+
+#endif // CGAL__TEST_FCT_SEGMENT_3_H
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_vector_2.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_vector_2.h
index 7731765f24e7..3140f54902e4 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_vector_2.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_vector_2.h
@@ -87,6 +87,7 @@ _test_fct_vector_2(const R& )
  assert( CGAL::scalar_product(v1, v2) == FT(30) );
  assert( v1 * v0 == FT(0) );
  assert( v1.squared_length() == FT(40) );
+ assert( v1.squared_length() == CGAL::squared_length(v1) );
  assert( CGAL::Vector_2<R>( n1, n2) == v1 * RT(2));
  assert( CGAL::Vector_2<R>( n5, n6) == v2 * RT(3));
  assert( CGAL::Vector_2<R>( n1, n2) == RT(2) * v1);
diff --git a/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_vector_3.h b/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_vector_3.h
index 70e273d1e680..d1c090353efc 100644
--- a/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_vector_3.h
+++ b/Kernel_23/test/Kernel_23/include/CGAL/_test_fct_vector_3.h
@@ -101,6 +101,7 @@ _test_fct_vector_3(const R& )
 
  std::cout << '.';
 
+ assert( v1.squared_length() == CGAL::squared_length(v1) );
  assert( v1.squared_length() == FT(49) );
  assert( v1 * v2 == FT(66) );
  assert( v1 * v0 == FT(0) );

From e4751929b47ca6c384d80b58a7e943b7ddcf3295 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 15 Feb 2024 11:28:24 +0100
Subject: [PATCH 1372/1398] Rename the action "Inside Out" to something more
 explicit

---
 Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp
index 7f2fa8f7dc9f..89e79ac17f80 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp
@@ -29,7 +29,7 @@ class Polyhedron_demo_inside_out_plugin :
   {
       scene = scene_interface;
       this->mw = mw;
-      actionInsideOut = new QAction(tr("Inside Out"), mw);
+      actionInsideOut = new QAction(tr("Reverse surface orientation (\"Inside Out\")"), mw);
 
       actionInsideOut->setProperty("subMenuName", "Polygon Mesh Processing");
       connect(actionInsideOut, SIGNAL(triggered()), this, SLOT(on_actionInsideOut_triggered()));

From 9e29ff0e0f36779cab2d57a7ceb082d79600e253 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 15 Feb 2024 11:40:57 +0100
Subject: [PATCH 1373/1398] remove "surface"

The action only applies to surface meshes, anyway.
---
 Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp
index 89e79ac17f80..81b9b1b9d4ae 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp
@@ -29,7 +29,7 @@ class Polyhedron_demo_inside_out_plugin :
   {
       scene = scene_interface;
       this->mw = mw;
-      actionInsideOut = new QAction(tr("Reverse surface orientation (\"Inside Out\")"), mw);
+      actionInsideOut = new QAction(tr("Reverse orientation (\"Inside Out\")"), mw);
 
       actionInsideOut->setProperty("subMenuName", "Polygon Mesh Processing");
       connect(actionInsideOut, SIGNAL(triggered()), this, SLOT(on_actionInsideOut_triggered()));

From 8fcf8568254af5beb1a6a504d6a6e7586db8f574 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <Laurent.Rineau@cgal.org>
Date: Thu, 15 Feb 2024 14:26:48 +0100
Subject: [PATCH 1374/1398] Update
 Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp

Co-authored-by: Sebastien Loriot <sloriot.ml@gmail.com>
---
 Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp b/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp
index 81b9b1b9d4ae..93633b3ab2a1 100644
--- a/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp
+++ b/Polyhedron/demo/Polyhedron/Plugins/PMP/Inside_out_plugin.cpp
@@ -29,7 +29,7 @@ class Polyhedron_demo_inside_out_plugin :
   {
       scene = scene_interface;
       this->mw = mw;
-      actionInsideOut = new QAction(tr("Reverse orientation (\"Inside Out\")"), mw);
+      actionInsideOut = new QAction(tr("Reverse Orientation (\"Inside Out\")"), mw);
 
       actionInsideOut->setProperty("subMenuName", "Polygon Mesh Processing");
       connect(actionInsideOut, SIGNAL(triggered()), this, SLOT(on_actionInsideOut_triggered()));

From dbb848deb13a65ed8beeb7d355a9e18b0729ede4 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Fri, 16 Feb 2024 08:00:02 +0000
Subject: [PATCH 1375/1398] Triangulation 2/3:  fstream -> sstream

---
 .../_test_cls_constrained_triangulation_2.h   | 58 +++++--------
 .../include/CGAL/_test_cls_delaunay_3.h       | 84 +++++++------------
 2 files changed, 52 insertions(+), 90 deletions(-)

diff --git a/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_constrained_triangulation_2.h b/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_constrained_triangulation_2.h
index b9ff68f77ab9..539001373636 100644
--- a/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_constrained_triangulation_2.h
+++ b/Triangulation_2/test/Triangulation_2/include/CGAL/_test_cls_constrained_triangulation_2.h
@@ -21,7 +21,7 @@
 //
 // coordinator   : INRIA Sophia-Antipolis Mariette.Yvinec@sophia.inria.fr
 // ============================================================================
-
+#include <sstream>
 #include <list>
 #include <type_traits>
 #include <CGAL/_test_cls_triangulation_short_2.h>
@@ -222,54 +222,42 @@ _test_cls_constrained_triangulation(const Triang &)
   /******** I/O *******/
   std::cout << "output to a file" << std::endl;
 
-  std::ofstream of0_1("T01ct.triangulation", std::ios::out);
-  CGAL::IO::set_ascii_mode(of0_1);
-   of0_1 << T0_1; of0_1.close();
+  std::stringstream ss0_1;
+  ss0_1 << T0_1;
 
-  std::ofstream of0_2("T02ct.triangulation");
-  CGAL::IO::set_ascii_mode(of0_2);
-  of0_2 << T0_2; of0_2.close();
+  std::stringstream ss0_2;
+  ss0_2 << T0_2;
 
-  std::ofstream of1_1("T11ct.triangulation");
-  CGAL::IO::set_ascii_mode(of1_1);
-  of1_1 << T1_1; of1_1.close();
+  std::stringstream ss1_1;
+  ss1_1 << T1_1;
 
-  std::ofstream of1_2("T12ct.triangulation");
-  CGAL::IO::set_ascii_mode(of1_2);
-   of1_2 << T1_2; of1_2.close();
+  std::stringstream ss1_2;
+  ss1_2 << T1_2;
 
-  std::ofstream of2_1("T21ct.triangulation");
-  CGAL::IO::set_ascii_mode(of2_1);
-  of2_1 << T2_1; of2_1.close();
+  std::stringstream ss2_1;
+  ss2_1 << T2_1;
 
-  std::ofstream of2_2("T22ct.triangulation");
-  CGAL::IO::set_ascii_mode(of2_2);
-  of2_2 << T2_2; of2_2.close();
+  std::stringstream ss2_2;
+  ss2_2 << T2_2;
 
   std::cout << "input from a file" << std::endl;
-  std::ifstream if0_1("T01ct.triangulation"); CGAL::IO::set_ascii_mode(if0_1);
-  Triang T0_1_copy;   if0_1 >> T0_1_copy;
 
-  std::ifstream if0_2("T02ct.triangulation"); CGAL::IO::set_ascii_mode(if0_2);
-  Triang T0_2_copy;  if0_2 >> T0_2_copy;
+  Triang T0_1_copy;   ss0_1 >> T0_1_copy;
+
+  Triang T0_2_copy;  ss0_2 >> T0_2_copy;
 
-  std::ifstream if1_1("T11ct.triangulation"); CGAL::IO::set_ascii_mode(if1_1);
-  Triang T1_1_copy; if1_1 >> T1_1_copy;
+  Triang T1_1_copy; ss1_1 >> T1_1_copy;
 
-  std::ifstream if1_2("T12ct.triangulation"); CGAL::IO::set_ascii_mode(if1_2);
-   Triang T1_2_copy; if1_2 >> T1_2_copy;
+   Triang T1_2_copy; ss1_2 >> T1_2_copy;
 
-  std::ifstream if2_1("T21ct.triangulation"); CGAL::IO::set_ascii_mode(if2_1);
-  Triang T2_1_copy; if2_1 >> T2_1_copy;
+  Triang T2_1_copy; ss2_1 >> T2_1_copy;
 
-  std::ifstream if2_2("T22ct.triangulation"); CGAL::IO::set_ascii_mode(if2_2);
-  Triang T2_2_copy; if2_2 >> T2_2_copy;
+  Triang T2_2_copy; ss2_2 >> T2_2_copy;
 
   // test copy of constrained Triangulation
-   Triang T2_4(T2_2);
-  std::ofstream of2_2_bis("T22ct.triangulation");
-  CGAL::IO::set_ascii_mode(of2_2_bis);
-  of2_2_bis << T2_4; of2_2_bis.close();
+  Triang T2_4(T2_2);
+  std::stringstream of2_2_bis;
+  of2_2_bis << T2_4;
   All_faces_iterator fit2 = T2_2.all_faces_begin();
   All_faces_iterator fit2_bis = T2_4.all_faces_begin();
   for( ; fit2 != T2_2.all_faces_end(); ++fit2, ++fit2_bis) {
diff --git a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
index 99b71946d006..646bc24d221f 100644
--- a/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
+++ b/Triangulation_3/test/Triangulation_3/include/CGAL/_test_cls_delaunay_3.h
@@ -28,7 +28,7 @@
 
 #include <cassert>
 #include <iostream>
-#include <fstream>
+#include <sstream>
 #include <list>
 #include <vector>
 #include <type_traits>
@@ -293,12 +293,9 @@ _test_cls_delaunay_3(const Triangulation &)
   {
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
-      {
-        std::ofstream oFileT1("Test1_dtriangulation_IO_3",std::ios::out);
-        oFileT1 << T0 << std::endl;
-      }
-      std::ifstream iFileT1("Test1_dtriangulation_IO_3",std::ios::in);
-      iFileT1 >> Tfromfile;
+      std::stringstream ss;
+      ss << T0;
+      ss >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == -1);
       assert(Tfromfile.number_of_vertices() == 0);
@@ -314,12 +311,9 @@ _test_cls_delaunay_3(const Triangulation &)
   {
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
-      {
-        std::ofstream oFileT2("Test2_dtriangulation_IO_3",std::ios::out);
-        oFileT2 << T0 << std::endl;
-      }
-      std::ifstream iFileT2("Test2_dtriangulation_IO_3",std::ios::in);
-      iFileT2 >> Tfromfile;
+      std::stringstream ss;
+      ss << T0;
+      ss >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 0);
       assert(Tfromfile.number_of_vertices() == 1);
@@ -336,12 +330,9 @@ _test_cls_delaunay_3(const Triangulation &)
   {
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
-      {
-        std::ofstream oFileT3("Test3_dtriangulation_IO_3",std::ios::out);
-        oFileT3 << T0 << std::endl;
-      }
-      std::ifstream iFileT3("Test3_dtriangulation_IO_3",std::ios::in);
-      iFileT3 >> Tfromfile;
+      std::stringstream ss;
+      ss << T0;
+      ss >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 1);
       assert(Tfromfile.number_of_vertices() == 2);
@@ -358,12 +349,9 @@ _test_cls_delaunay_3(const Triangulation &)
   {
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
-      {
-        std::ofstream oFileT4("Test4_dtriangulation_IO_3",std::ios::out);
-        oFileT4 << T0;
-      }
-      std::ifstream iFileT4("Test4_dtriangulation_IO_3",std::ios::in);
-      iFileT4 >> Tfromfile;
+      std::stringstream ss;
+      ss << T0;
+      ss >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 2);
       assert(Tfromfile.number_of_vertices() == 3);
@@ -380,12 +368,9 @@ _test_cls_delaunay_3(const Triangulation &)
   {
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
-      {
-        std::ofstream oFileT5("Test5_dtriangulation_IO_3",std::ios::out);
-        oFileT5 << T0;
-      }
-      std::ifstream iFileT5("Test5_dtriangulation_IO_3",std::ios::in);
-      iFileT5 >> Tfromfile;
+      std::stringstream ss;
+      ss << T0;
+      ss >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 3);
       assert(Tfromfile.number_of_vertices() == 4);
@@ -463,12 +448,9 @@ _test_cls_delaunay_3(const Triangulation &)
   {
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
-      {
-        std::ofstream oFileT6("Test6_dtriangulation_IO_3",std::ios::out);
-        oFileT6 << T1_2;
-      }
-      std::ifstream iFileT6("Test6_dtriangulation_IO_3",std::ios::in);
-      iFileT6 >> Tfromfile;
+      std::stringstream ss;
+      ss << T1_2;
+      ss >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 1);
       assert(Tfromfile.number_of_vertices() == n);
@@ -510,12 +492,10 @@ _test_cls_delaunay_3(const Triangulation &)
   {
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
-      {
-        std::ofstream oFileT7("Test7_dtriangulation_IO_3",std::ios::out);
-        oFileT7 << T2_0;
-      }
-      std::ifstream iFileT7("Test7_dtriangulation_IO_3",std::ios::in);
-      iFileT7 >> Tfromfile;
+
+      std::stringstream ss;
+      ss << T2_0;
+      ss >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 2);
       assert(Tfromfile.number_of_vertices() == 8);
@@ -586,12 +566,9 @@ _test_cls_delaunay_3(const Triangulation &)
   {
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
-      {
-        std::ofstream oFileT8("Test8_dtriangulation_IO_3",std::ios::out);
-        oFileT8 << T3_1;
-      }
-      std::ifstream iFileT8("Test8_dtriangulation_IO_3",std::ios::in);
-      iFileT8 >> Tfromfile;
+      std::stringstream ss;
+      ss << T3_1;
+      ss >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 3);
       assert(Tfromfile.number_of_vertices() == 22);
@@ -677,12 +654,9 @@ _test_cls_delaunay_3(const Triangulation &)
   {
       Cls Tfromfile;
       std::cout << "    I/O" << std::endl;
-      {
-        std::ofstream oFileT8("Test13_dtriangulation_IO_3",std::ios::out);
-        oFileT8 << T3_13;
-      }
-      std::ifstream iFileT8("Test13_dtriangulation_IO_3",std::ios::in);
-      iFileT8 >> Tfromfile;
+      std::stringstream ss;
+      ss << T3_13;
+      ss >> Tfromfile;
       assert(Tfromfile.is_valid());
       assert(Tfromfile.dimension() == 3);
       assert(Tfromfile.number_of_vertices() == 22);

From 7aa4f37b6ba35f99cf9594744718e6fb529f1a69 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 16 Feb 2024 11:39:09 +0100
Subject: [PATCH 1376/1398] rename macro

---
 .../CGAL/Polygon_mesh_processing/autorefinement.h      | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 94b6a9c96677..e7108e6d521f 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -55,7 +55,7 @@
 #endif
 #endif
 
-#ifdef USE_FIXED_PROJECTION_TRAITS
+#ifdef CGAL_AUTOREF_USE_FIXED_PROJECTION_TRAITS
 #include <CGAL/Kernel_23/internal/Projection_traits_3.h>
 #endif
 
@@ -544,7 +544,7 @@ struct Triangle_data
 };
 
 template <class EK,
-#ifdef USE_FIXED_PROJECTION_TRAITS
+#ifdef CGAL_AUTOREF_USE_FIXED_PROJECTION_TRAITS
           int dim,
 #endif
           class PointVector>
@@ -820,7 +820,7 @@ void generate_subtriangles(std::size_t ti,
 
 // init CDT + insert points and constraints
   CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer3.start();)
-#ifdef USE_FIXED_PROJECTION_TRAITS
+#ifdef CGAL_AUTOREF_USE_FIXED_PROJECTION_TRAITS
   typedef ::CGAL::internal::Projection_traits_3<EK, dim> P_traits;
 #else
   typedef CGAL::Projection_traits_3<EK> P_traits;
@@ -835,7 +835,7 @@ void generate_subtriangles(std::size_t ti,
   const std::array<typename EK::Point_3,3>& t = triangles[ti];
   std::vector<typename CDT::Vertex_handle> vhandles(triangle_data.points.size());
 
-#ifdef USE_FIXED_PROJECTION_TRAITS
+#ifdef CGAL_AUTOREF_USE_FIXED_PROJECTION_TRAITS
   P_traits cdt_traits;
   bool orientation_flipped = false;
   CDT cdt(cdt_traits);
@@ -1354,7 +1354,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
       new_triangles.push_back({triangles[ti], ti});
     else
     {
-#ifdef USE_FIXED_PROJECTION_TRAITS
+#ifdef CGAL_AUTOREF_USE_FIXED_PROJECTION_TRAITS
       const std::array<typename EK::Point_3, 3>& t = triangles[ti];
       typename EK::Vector_3 orth = CGAL::normal(t[0], t[1], t[2]); // TODO::avoid construction?
       int c = CGAL::abs(orth[0]) > CGAL::abs(orth[1]) ? 0 : 1;

From 5cae5340e99570b8eb16ac2e6a5cc0b942e59365 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 16 Feb 2024 11:48:15 +0100
Subject: [PATCH 1377/1398] remove TODO that are not

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h       | 2 --
 1 file changed, 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index e7108e6d521f..37d9a31f4f13 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -486,7 +486,6 @@ bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
   return false;
 }
 
-//TODO: rename struct
 struct Triangle_data
 {
   using Point_3 = Exact_predicates_exact_constructions_kernel::Point_3;
@@ -950,7 +949,6 @@ void generate_subtriangles(std::size_t ti,
 
   for (const std::pair<std::size_t, std::size_t>& ids : triangle_data.segments)
   {
-    //TODO remove me
     CGAL_assertion(ids.first < vhandles.size());
     CGAL_assertion(ids.second < vhandles.size());
     CGAL_assertion( vhandles[ids.first]!= typename CDT::Vertex_handle() );

From a57800ce07afdfe18429c4922460812b628f38eb Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Fri, 16 Feb 2024 12:12:19 +0100
Subject: [PATCH 1378/1398] get rid of extra container

---
 .../Polygon_mesh_processing/autorefinement.h  | 90 +++++++++----------
 1 file changed, 41 insertions(+), 49 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index 37d9a31f4f13..ff9a8ee4d8a3 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -255,12 +255,12 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
 
 // imported from Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
 template<class K>
-void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
-                            const std::array<typename K::Point_3, 3>& t2,
+void coplanar_intersections(const std::vector<typename K::Point_3>& t1,
+                            const std::vector<typename K::Point_3>& t2,
                             std::vector<std::tuple<typename K::Point_3, int, int>>& inter_pts)
 {
-  const typename K::Point_3& p1 = t1[0], q1 = t1[1], r1 = t1[2];
-  const typename K::Point_3& p2 = t2[0], q2 = t2[1], r2 = t2[2];
+  const typename K::Point_3& p1 = t1[0], & q1 = t1[1], & r1 = t1[2];
+  const typename K::Point_3& p2 = t2[0], & q2 = t2[1], & r2 = t2[2];
 
   std::list<Intersections::internal::Point_on_triangle<K>> l_inter_pts;
   l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(0,-1));
@@ -416,8 +416,8 @@ test_edge(const typename K::Point_3& p, const typename K::Point_3& q,
 }
 
 template <class K>
-bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
-                           const std::array<typename K::Point_3, 3>& t2,
+bool collect_intersections(const std::vector<typename K::Point_3>& t1,
+                           const std::vector<typename K::Point_3>& t2,
                            std::vector<std::tuple<typename K::Point_3, int, int>>& inter_pts)
 {
   // test edges of t1 vs t2
@@ -548,10 +548,9 @@ template <class EK,
 #endif
           class PointVector>
 void generate_subtriangles(std::size_t ti,
-                           Triangle_data& triangle_data,
+                           std::vector<Triangle_data>& all_triangle_data,
                            const std::set<std::pair<std::size_t, std::size_t> >& intersecting_triangles,
                            const std::set<std::pair<std::size_t, std::size_t> >& coplanar_triangles,
-                           const std::vector<std::array<typename EK::Point_3,3>>& triangles,
                            PointVector& new_triangles
                            )
 {
@@ -588,6 +587,7 @@ void generate_subtriangles(std::size_t ti,
 #define CGAL_AUTOREF_COUNTER_INSTRUCTION(X)
 #endif
 
+  Triangle_data& triangle_data=all_triangle_data[ti];
   std::vector<Exact_predicates_exact_constructions_kernel::Point_3>& points=triangle_data.points;
   std::vector<int>& point_locations=triangle_data.point_locations;
   std::vector<std::pair<std::size_t, std::size_t>>& segments=triangle_data.segments;
@@ -680,9 +680,9 @@ void generate_subtriangles(std::size_t ti,
               {
                 CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer6.start();)
                 typename EK::Point_3 pt = typename EK::Construct_planes_intersection_point_3()(
-                  triangles[in_triangle_ids[i]][0], triangles[in_triangle_ids[i]][1],triangles[in_triangle_ids[i]][2],
-                  triangles[in_triangle_ids[j]][0], triangles[in_triangle_ids[j]][1],triangles[in_triangle_ids[j]][2],
-                  triangles[ti][0], triangles[ti][1],triangles[ti][2]);
+                  all_triangle_data[in_triangle_ids[i]].points[0], all_triangle_data[in_triangle_ids[i]].points[1],all_triangle_data[in_triangle_ids[i]].points[2],
+                  all_triangle_data[in_triangle_ids[j]].points[0], all_triangle_data[in_triangle_ids[j]].points[1],all_triangle_data[in_triangle_ids[j]].points[2],
+                  points[0], points[1],points[2]);
                 CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer6.stop();)
 
                 CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c1;)
@@ -831,7 +831,6 @@ void generate_subtriangles(std::size_t ti,
   //typedef CGAL::Constrained_triangulation_plus_2<CDT_2> CDT;
   typedef CDT_2 CDT;
 
-  const std::array<typename EK::Point_3,3>& t = triangles[ti];
   std::vector<typename CDT::Vertex_handle> vhandles(triangle_data.points.size());
 
 #ifdef CGAL_AUTOREF_USE_FIXED_PROJECTION_TRAITS
@@ -839,12 +838,12 @@ void generate_subtriangles(std::size_t ti,
   bool orientation_flipped = false;
   CDT cdt(cdt_traits);
   // TODO: still need to figure out why I can't make the orientation_flipped correctly
-  vhandles[0]=cdt.insert(t[0]);
-  vhandles[1]=cdt.insert(t[1]);
-  vhandles[2]=cdt.insert(t[2]);
+  vhandles[0]=cdt.insert(points[0]);
+  vhandles[1]=cdt.insert(points[1]);
+  vhandles[2]=cdt.insert(points[2]);
 #else
   // positive triangle normal
-  typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
+  typename EK::Vector_3 n = normal(points[0], points[1], points[2]);
   typename EK::Point_3 o(CGAL::ORIGIN);
 
   bool orientation_flipped = false;
@@ -856,18 +855,14 @@ void generate_subtriangles(std::size_t ti,
   P_traits cdt_traits(n);
 
   CDT cdt(cdt_traits);
-  vhandles[0]=cdt.insert_outside_affine_hull(t[0]);
-  vhandles[1]=cdt.insert_outside_affine_hull(t[1]);
+  vhandles[0]=cdt.insert_outside_affine_hull(points[0]);
+  vhandles[1]=cdt.insert_outside_affine_hull(points[1]);
   vhandles[2] = cdt.tds().insert_dim_up(cdt.infinite_vertex(), orientation_flipped);
-  vhandles[2]->set_point(t[2]);
+  vhandles[2]->set_point(points[2]);
 #endif
 
   // insert points and fill vhandles
-#if 0
-  std::vector<std::size_t> indices(triangle_data.points.size()-3);
-  std::iota(indices.begin(), indices.end(), 3);
-#else
-  //start by points on edges
+  // start by points on edges
   std::array<std::vector<std::size_t>, 3> indices_on_edges;
   std::vector<std::size_t> indices;
   for (std::size_t i=3; i<points.size(); ++i)
@@ -933,7 +928,7 @@ void generate_subtriangles(std::size_t ti,
       prev_id=id;
     }
   }
-#endif
+
   // then points in the interior
   typedef typename Pointer_property_map<typename EK::Point_3>::type Pmap;
   typedef Spatial_sort_traits_adapter_2<P_traits,Pmap> Search_traits;
@@ -1107,22 +1102,17 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
   // init the vector of triangles used for the autorefinement of triangles
   typedef CGAL::Exact_predicates_exact_constructions_kernel EK;
-  std::vector< std::array<EK::Point_3, 3> > triangles(tiid+1); // TODO get rid of triangles and use all_triangle_data
   // vector of data for refining triangles
-  std::vector<autorefine_impl::Triangle_data> all_triangle_data(triangles.size());
+  std::vector<autorefine_impl::Triangle_data> all_triangle_data(tiid+1);
   Cartesian_converter<GT, EK> to_exact;
 
   for(Input_TID f : intersected_faces)
   {
     std::size_t tid=tri_inter_ids[f];
-    triangles[tid]= CGAL::make_array(
-      to_exact( get(pm, soup_points[soup_triangles[f][0]]) ),
-      to_exact( get(pm, soup_points[soup_triangles[f][1]]) ),
-      to_exact( get(pm, soup_points[soup_triangles[f][2]]) ) );
     all_triangle_data[tid].points.resize(3);
-    all_triangle_data[tid].points[0]=triangles[tri_inter_ids[f]][0];
-    all_triangle_data[tid].points[1]=triangles[tri_inter_ids[f]][1];
-    all_triangle_data[tid].points[2]=triangles[tri_inter_ids[f]][2];
+    all_triangle_data[tid].points[0]=to_exact( get(pm, soup_points[soup_triangles[f][0]]) );
+    all_triangle_data[tid].points[1]=to_exact( get(pm, soup_points[soup_triangles[f][1]]) );
+    all_triangle_data[tid].points[2]=to_exact( get(pm, soup_points[soup_triangles[f][2]]) );
     all_triangle_data[tid].point_locations.resize(3);
     all_triangle_data[tid].point_locations[0]=-1;
     all_triangle_data[tid].point_locations[1]=-2;
@@ -1144,8 +1134,8 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
     if (i1==-1 || i2==-1) continue; //skip degenerate faces
 
-    const std::array<EK::Point_3, 3>& t1 = triangles[i1];
-    const std::array<EK::Point_3, 3>& t2 = triangles[i2];
+    const std::vector<EK::Point_3>& t1 = all_triangle_data[i1].points;
+    const std::vector<EK::Point_3>& t2 = all_triangle_data[i2].points;
 
     std::vector<std::tuple<EK::Point_3, int, int>> inter_pts;
     bool triangles_are_coplanar = autorefine_impl::collect_intersections<EK>(t1, t2, inter_pts);
@@ -1313,7 +1303,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 #ifdef CGAL_LINKED_WITH_TBB
   if (parallel_execution)
   {
-    tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
+    tbb::parallel_for(tbb::blocked_range<size_t>(0, all_triangle_data.size()),
                       [&](const tbb::blocked_range<size_t>& r) {
                         for (size_t ti = r.begin(); ti != r.end(); ++ti)
                           deduplicate_inserted_segments(ti);
@@ -1322,7 +1312,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   }
   else
 #endif
-  for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
+  for (std::size_t ti = 0; ti < all_triangle_data.size(); ++ti) {
     deduplicate_inserted_segments(ti);
   }
 
@@ -1343,32 +1333,34 @@ void autorefine_triangle_soup(PointRange& soup_points,
 #endif
 
 #ifdef CGAL_AUTOREF_USE_PROGRESS_DISPLAY
-  boost::timer::progress_display pd(triangles.size());
+  boost::timer::progress_display pd(all_triangle_data.size());
 #endif
 
   auto refine_triangles = [&](std::size_t ti)
   {
     if (all_triangle_data[ti].points.size()==3)
-      new_triangles.push_back({triangles[ti], ti});
+      new_triangles.push_back({CGAL::make_array(all_triangle_data[ti].points[0],
+                                                all_triangle_data[ti].points[1],
+                                                all_triangle_data[ti].points[2]),
+                               ti});
     else
     {
 #ifdef CGAL_AUTOREF_USE_FIXED_PROJECTION_TRAITS
-      const std::array<typename EK::Point_3, 3>& t = triangles[ti];
-      typename EK::Vector_3 orth = CGAL::normal(t[0], t[1], t[2]); // TODO::avoid construction?
+      typename EK::Vector_3 orth = CGAL::normal(all_triangle_data[ti].points[0], all_triangle_data[ti].points[1], all_triangle_data[ti].points[2]); // TODO::avoid construction?
       int c = CGAL::abs(orth[0]) > CGAL::abs(orth[1]) ? 0 : 1;
       c = CGAL::abs(orth[2]) > CGAL::abs(orth[c]) ? 2 : c;
 
       if (c == 0) {
-        autorefine_impl::generate_subtriangles<EK, 0>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
+        autorefine_impl::generate_subtriangles<EK, 0>(ti, all_triangle_data, intersecting_triangles, coplanar_triangles, new_triangles);
       }
       else if (c == 1) {
-        autorefine_impl::generate_subtriangles<EK, 1>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
+        autorefine_impl::generate_subtriangles<EK, 1>(ti, all_triangle_data, intersecting_triangles, coplanar_triangles, new_triangles);
       }
       else if (c == 2) {
-        autorefine_impl::generate_subtriangles<EK, 2>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
+        autorefine_impl::generate_subtriangles<EK, 2>(ti, all_triangle_data, intersecting_triangles, coplanar_triangles, new_triangles);
       }
 #else
-      autorefine_impl::generate_subtriangles<EK>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
+      autorefine_impl::generate_subtriangles<EK>(ti, all_triangle_data, intersecting_triangles, coplanar_triangles, new_triangles);
 #endif
     }
 
@@ -1383,7 +1375,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 #ifdef CGAL_LINKED_WITH_TBB
   if (parallel_execution)
   {
-    tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
+    tbb::parallel_for(tbb::blocked_range<size_t>(0, all_triangle_data.size()),
                       [&](const tbb::blocked_range<size_t>& r) {
                         for (size_t ti = r.begin(); ti != r.end(); ++ti)
                           refine_triangles(ti);
@@ -1392,7 +1384,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   }
   else
 #endif
-  for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
+  for (std::size_t ti = 0; ti < all_triangle_data.size(); ++ti) {
     refine_triangles(ti);
   }
 
@@ -1449,7 +1441,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   }
 
   // raw copy of input triangles with no intersection
-  std::vector<std::size_t> tri_inter_ids_inverse(triangles.size());
+  std::vector<std::size_t> tri_inter_ids_inverse(all_triangle_data.size());
   for (Input_TID f=0; f<soup_triangles.size(); ++f)
   {
     if (is_degen[f]) continue; //skip degenerate faces

From bd1d232d409a45970056ee9634e2c017bddc89ec Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 19 Feb 2024 10:02:19 +0100
Subject: [PATCH 1379/1398] fix warnings

---
 .../include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h   | 3 +--
 .../internal/tetrahedral_remeshing_helpers.h                   | 1 -
 2 files changed, 1 insertion(+), 3 deletions(-)

diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
index 6d56ca3f2d0c..a80a883fa17d 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/flip_edges.h
@@ -378,7 +378,6 @@ void find_best_flip_to_improve_dh(C3t3& c3t3,
 {
   typedef typename C3t3::Triangulation  Tr;
   typedef typename C3t3::Vertex_handle  Vertex_handle;
-  typedef typename C3t3::Cell_handle    Cell_handle;
   typedef typename C3t3::Facet          Facet;
   typedef typename Tr::Facet_circulator Facet_circulator;
   typedef typename Tr::Cell_circulator  Cell_circulator;
@@ -1760,7 +1759,7 @@ std::size_t flipBoundaryEdges(
       candidate_edges_for_flip.push_back(make_vertex_pair(e));
   }
 
-  for (const auto [vh0, vh1] : candidate_edges_for_flip)
+  for (const auto& [vh0, vh1] : candidate_edges_for_flip)
   {
     boost::container::small_vector<Cell_handle, 64>& inc_vh0 = inc_cells[vh0];
     if (inc_vh0.empty())
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
index d046f640b2ff..cef3b46ed4a1 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_remeshing_helpers.h
@@ -412,7 +412,6 @@ bool edges_form_a_sharp_angle(const EdgesVector& incident_edges,
 {
   CGAL_assertion(incident_edges.size() == 2);
 
-  typedef typename EdgesVector::value_type Edge;
   typedef typename C3t3::Vertex_handle Vertex_handle;
 
   const std::array<Vertex_handle, 2> ev0

From 62926f920afd09a0b53b18f91c0fdcbb0094bf27 Mon Sep 17 00:00:00 2001
From: agiust <ag.giust@gmail.com>
Date: Mon, 19 Feb 2024 13:57:30 +0100
Subject: [PATCH 1380/1398] fix typo in comment

---
 .../include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h           | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h
index 8f88642aed8a..0bcc3f633a51 100644
--- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h
+++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arr_traits_adaptor_2.h
@@ -577,7 +577,7 @@ class Arr_traits_basic_adaptor_2 : public ArrangementBasicTraits_ {
           return (m_self->compare_y_at_x_right_2_object()(xcv1, xcv2, left1));
       }
 
-      // We now that the curves do not share a common endpoint, and we can
+      // We know that the curves do not share a common endpoint, and we can
       // compare their relative y-position (which does not change to the left
       // of the given point p).
       return (m_self->compare_y_position_2_object()(xcv1, xcv2));

From e190f302cac0594bdc3c2b48d6ba34195a1afa90 Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 19 Feb 2024 15:09:11 +0100
Subject: [PATCH 1381/1398] add vertex_is_constrained_map to
 tetrahedral_isotropic_remeshing()

and to convert_to_triangulation_3(), to collect them
---
 .../mesh_and_remesh_c3t3.cpp                  |  8 +-
 .../tetrahedral_adaptive_remeshing_impl.h     | 11 ++-
 .../include/CGAL/tetrahedral_remeshing.h      | 86 +++++++++++++++----
 3 files changed, 82 insertions(+), 23 deletions(-)

diff --git a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp
index b5a10784e929..1187886dd0c2 100644
--- a/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp
+++ b/Tetrahedral_remeshing/examples/Tetrahedral_remeshing/mesh_and_remesh_c3t3.cpp
@@ -39,6 +39,8 @@ using Vertex_pair = std::pair<Vertex_handle, Vertex_handle>;
 using Constraints_set = std::unordered_set<Vertex_pair, boost::hash<Vertex_pair>>;
 using Constraints_pmap = CGAL::Boolean_property_map<Constraints_set>;
 
+using Corners_set = std::unordered_set<Vertex_handle, boost::hash<Vertex_handle>>;
+using Corners_pmap = CGAL::Boolean_property_map<Corners_set>;
 
 // To avoid verbose function and named parameters call
 using namespace CGAL::parameters;
@@ -73,8 +75,12 @@ int main(int argc, char* argv[])
   Constraints_set constraints;
   Constraints_pmap constraints_pmap(constraints);
 
+  Corners_set corners;
+  Corners_pmap corners_pmap(corners);
+
   Triangulation_3 tr = CGAL::convert_to_triangulation_3(std::move(c3t3),
-    CGAL::parameters::edge_is_constrained_map(constraints_pmap));
+    CGAL::parameters::edge_is_constrained_map(constraints_pmap).
+                      vertex_is_constrained_map(corners_pmap));
 
   //note we use the move semantic, with std::move(c3t3),
   //  to avoid a copy of the triangulation by the function
diff --git a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
index 7a9050928706..baf6b7673197 100644
--- a/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
+++ b/Tetrahedral_remeshing/include/CGAL/Tetrahedral_remeshing/internal/tetrahedral_adaptive_remeshing_impl.h
@@ -76,6 +76,7 @@ struct All_cells_selected
 
 template<typename Triangulation
          , typename SizingFunction
+         , typename VertexIsConstrainedMap
          , typename EdgeIsConstrainedMap
          , typename FacetIsConstrainedMap
          , typename CellSelector
@@ -115,6 +116,7 @@ class Adaptive_remesher
   Adaptive_remesher(Triangulation& tr
                     , const SizingFunction& sizing
                     , const bool protect_boundaries
+                    , VertexIsConstrainedMap vcmap
                     , EdgeIsConstrainedMap ecmap
                     , FacetIsConstrainedMap fcmap
                     , bool smooth_constrained_edges
@@ -131,7 +133,7 @@ class Adaptive_remesher
   {
     m_c3t3.triangulation().swap(tr);
 
-    init_c3t3(ecmap, fcmap);
+    init_c3t3(vcmap, ecmap, fcmap);
     m_vertex_smoother.init(m_c3t3, m_cell_selector, smooth_constrained_edges);
 
 #ifdef CGAL_DUMP_REMESHING_STEPS
@@ -144,6 +146,7 @@ class Adaptive_remesher
   Adaptive_remesher(C3t3& c3t3
                     , const SizingFunction& sizing
                     , const bool protect_boundaries
+                    , VertexIsConstrainedMap vcmap
                     , EdgeIsConstrainedMap ecmap
                     , FacetIsConstrainedMap fcmap
                     , bool smooth_constrained_edges
@@ -160,7 +163,7 @@ class Adaptive_remesher
   {
     m_c3t3.swap(c3t3);
 
-    init_c3t3(ecmap, fcmap);
+    init_c3t3(vcmap, ecmap, fcmap);
     m_vertex_smoother.init(m_c3t3, m_cell_selector, smooth_constrained_edges);
 
 #ifdef CGAL_DUMP_REMESHING_STEPS
@@ -315,7 +318,8 @@ class Adaptive_remesher
   }
 
 private:
-  void init_c3t3(const EdgeIsConstrainedMap& ecmap,
+  void init_c3t3(const VertexIsConstrainedMap& vcmap,
+                 const EdgeIsConstrainedMap& ecmap,
                  const FacetIsConstrainedMap& fcmap)
   {
 #ifdef CGAL_TETRAHEDRAL_REMESHING_DEBUG
@@ -431,6 +435,7 @@ class Adaptive_remesher
     for (Vertex_handle vit : tr().finite_vertex_handles())
     {
       if ( vit->in_dimension() == 0
+           || get(vcmap, vit)
            || nb_incident_complex_edges(vit, m_c3t3) > 2)
       {
         if (!m_c3t3.is_in_complex(vit))
diff --git a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
index d11d72973b6a..67d133b0e813 100644
--- a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
+++ b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
@@ -107,6 +107,15 @@ namespace CGAL
 *                     by `Remeshing_edge_is_constrained_map` and `Remeshing_facet_is_constrained_map`.}
 *   \cgalParamNEnd
 *
+*   \cgalParamNBegin{facet_is_constrained_map}
+*     \cgalParamDescription{a property map containing the constrained-or-not status of each facet of `tr`.}
+*     \cgalParamType{a class model of `ReadablePropertyMap` with `Triangulation_3::Facet`
+*                    as key type and `bool` as value type. It must be default constructible.}
+*     \cgalParamDefault{a default property map where no facet is constrained}
+*     \cgalParamExtra{A constrained facet can be split or collapsed, but not flipped.}
+*     \cgalParamExtra{This map, contrary to the others, is not updated throughout the remeshing process.}
+*   \cgalParamNEnd
+*
 *   \cgalParamNBegin{edge_is_constrained_map}
 *     \cgalParamDescription{a property map containing the constrained-or-not status of each edge of `tr`.}
 *     \cgalParamType{a class model of `ReadWritePropertyMap` with `std::pair<Triangulation_3::Vertex_handle, Triangulation_3::Vertex_handle>`
@@ -118,13 +127,12 @@ namespace CGAL
 *                     with edge splits and collapses, so the property map must be writable.}
 *   \cgalParamNEnd
 *
-*   \cgalParamNBegin{facet_is_constrained_map}
-*     \cgalParamDescription{a property map containing the constrained-or-not status of each facet of `tr`.}
-*     \cgalParamType{a class model of `ReadablePropertyMap` with `Triangulation_3::Facet`
+*   \cgalParamNBegin{vertex_is_constrained_map}
+*     \cgalParamDescription{a property map containing the constrained-or-not status of each vertex of `tr`.}
+*     \cgalParamType{a class model of `ReadWritePropertyMap` with `Triangulation_3::Vertex_handle`
 *                    as key type and `bool` as value type. It must be default constructible.}
-*     \cgalParamDefault{a default property map where no facet is constrained}
-*     \cgalParamExtra{A constrained facet can be split or collapsed, but not flipped.}
-*     \cgalParamExtra{This map, contrary to the others, is not updated throughout the remeshing process.}
+*     \cgalParamDefault{a default property map where no vertex is constrained}
+*     \cgalParamExtra{A constrained vertex cannot be removed by collapse, nor moved by smoothing.}
 *   \cgalParamNEnd
 *
 *   \cgalParamNBegin{cell_is_selected_map}
@@ -147,7 +155,8 @@ namespace CGAL
 *     \cgalParamExtra{The endvertices of constraints listed
 *                     by `edge_is_constrained_map`, and edges incident to at least three subdomains
 *                     are made eligible to one dimensional smoothing, along the constrained polylines they belong to.
-*                     Corners (i.e. vertices incident to more than 2 constrained edges) are not allowed
+*                     Corners (i.e. vertices listed by `vertex_is_constrained_map` or
+*                     incident to more than 2 constrained edges) are not allowed
 *                     to move at all.\n
 *                     Note that activating the smoothing step on polyline constraints tends to reduce
 *                     the quality of the minimal dihedral angle in the mesh.\n
@@ -225,6 +234,15 @@ void tetrahedral_isotropic_remeshing(
     = choose_parameter(get_parameter(np, internal_np::cell_selector),
                        Tetrahedral_remeshing::internal::All_cells_selected<Tr>());
 
+  typedef typename Tr::Vertex_handle Vertex_handle;
+  typedef typename internal_np::Lookup_named_param_def <
+    internal_np::vertex_is_constrained_t,
+    NamedParameters,
+    Constant_property_map<Vertex_handle, bool>//default
+  > ::type VCMap;
+  VCMap vcmap = choose_parameter(get_parameter(np, internal_np::vertex_is_constrained),
+                                 Constant_property_map<Vertex_handle, bool>(false));
+
   typedef std::pair<typename Tr::Vertex_handle, typename Tr::Vertex_handle> Edge_vv;
   typedef typename internal_np::Lookup_named_param_def <
     internal_np::edge_is_constrained_t,
@@ -263,9 +281,9 @@ void tetrahedral_isotropic_remeshing(
 #endif
 
   typedef Tetrahedral_remeshing::internal::Adaptive_remesher<
-    Tr, SizingFunction, ECMap, FCMap, SelectionFunctor, Visitor> Remesher;
+    Tr, SizingFunction, VCMap, ECMap, FCMap, SelectionFunctor, Visitor> Remesher;
   Remesher remesher(tr, sizing, protect
-                  , ecmap, fcmap
+                  , vcmap, ecmap, fcmap
                   , smooth_constrained_edges
                   , cell_select
                   , visitor);
@@ -327,7 +345,16 @@ void tetrahedral_isotropic_remeshing(
 *         as key type and `bool` as value type. It must be default constructible.}
 *     \cgalParamDefault{a default property map where no edge is constrained}
 *   \cgalParamNEnd
-*
+*   \cgalParamNBegin{vertex_is_constrained_map}
+*     \cgalParamDescription{a property map containing the constrained-or-not status of each vertex of
+*                     `c3t3.triangulation()`.
+*                     For each vertex `v` for which `c3t3.is_in_complex(v)` returns `true`,
+*                     the constrained status of `v` is set to `true`.}
+*     \cgalParamType{a class model of `ReadWritePropertyMap`
+*         with `Triangulation_3::Vertex_handle`
+*         as key type and `bool` as value type. It must be default constructible.}
+*     \cgalParamDefault{a default property map where no vertex is constrained}
+*   \cgalParamNEnd
 * \cgalNamedParamsEnd
 */
 
@@ -349,16 +376,25 @@ convert_to_triangulation_3(
 
   using Vertex_handle = typename Tr::Vertex_handle;
   using Edge_vv = std::pair<Vertex_handle, Vertex_handle>;
-  using Default_pmap = Constant_property_map<Edge_vv, bool>;
+  using Default_edge_pmap = Constant_property_map<Edge_vv, bool>;
   using ECMap = typename internal_np::Lookup_named_param_def <
                 internal_np::edge_is_constrained_t,
                 NamedParameters,
-                Default_pmap
+                Default_edge_pmap
+                >::type;
+  using Default_vertex_pmap = Constant_property_map<Vertex_handle, bool>;
+  using VCMap = typename internal_np::Lookup_named_param_def <
+                internal_np::vertex_is_constrained_t,
+                NamedParameters,
+                Default_vertex_pmap
                 >::type;
+
   ECMap ecmap = choose_parameter(get_parameter(np, internal_np::edge_is_constrained),
-                                 Default_pmap(false));
+                                 Default_edge_pmap(false));
+  VCMap vcmap = choose_parameter(get_parameter(np, internal_np::vertex_is_constrained),
+                                 Default_vertex_pmap(false));
 
-  if (!std::is_same_v<ECMap, Default_pmap>)
+  if (!std::is_same_v<ECMap, Default_edge_pmap>)
   {
     for (auto e : c3t3.edges_in_complex())
     {
@@ -367,6 +403,13 @@ convert_to_triangulation_3(
       put(ecmap, evv, true);
     }
   }
+  if (!std::is_same_v<VCMap, Default_vertex_pmap>)
+  {
+    for (auto v : c3t3.vertices_in_complex())
+    {
+      put(vcmap, v, true);
+    }
+  }
 
   CGAL::Triangulation_3<GT, TDS> tr;
   tr.swap(c3t3.triangulation());
@@ -444,6 +487,14 @@ void tetrahedral_isotropic_remeshing(
     = choose_parameter(get_parameter(np, internal_np::cell_selector),
                        Tetrahedral_remeshing::internal::All_cells_selected<Tr>());
 
+  typedef typename internal_np::Lookup_named_param_def <
+              internal_np::vertex_is_constrained_t,
+              NamedParameters,
+              Constant_property_map<Vertex_handle, bool>//default
+              > ::type VCMap;
+  VCMap vcmap = choose_parameter(get_parameter(np, internal_np::vertex_is_constrained),
+                                 Constant_property_map<Vertex_handle, bool>(false));
+
   typedef std::pair<typename Tr::Vertex_handle, typename Tr::Vertex_handle> Edge_vv;
   typedef typename internal_np::Lookup_named_param_def <
   internal_np::edge_is_constrained_t,
@@ -482,12 +533,9 @@ void tetrahedral_isotropic_remeshing(
 #endif
 
   typedef Tetrahedral_remeshing::internal::Adaptive_remesher<
-  Tr, SizingFunction, ECMap, FCMap, SelectionFunctor,
-  Visitor,
-  CornerIndex, CurveIndex
-  > Remesher;
+    Tr, SizingFunction, VCMap, ECMap, FCMap, SelectionFunctor, Visitor> Remesher;
   Remesher remesher(c3t3, sizing, protect
-                    , ecmap, fcmap
+                    , vcmap, ecmap, fcmap
                     , smooth_constrained_edges
                     , cell_select
                     , visitor);

From 26639f4c29509db99a3d59574312d906b8c40fab Mon Sep 17 00:00:00 2001
From: Jane Tournois <janetournois@users.noreply.github.com>
Date: Mon, 19 Feb 2024 16:57:15 +0100
Subject: [PATCH 1382/1398] add missing typedef

---
 Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h | 1 +
 1 file changed, 1 insertion(+)

diff --git a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
index 67d133b0e813..55ee573d570e 100644
--- a/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
+++ b/Tetrahedral_remeshing/include/CGAL/tetrahedral_remeshing.h
@@ -487,6 +487,7 @@ void tetrahedral_isotropic_remeshing(
     = choose_parameter(get_parameter(np, internal_np::cell_selector),
                        Tetrahedral_remeshing::internal::All_cells_selected<Tr>());
 
+  typedef typename Tr::Vertex_handle Vertex_handle;
   typedef typename internal_np::Lookup_named_param_def <
               internal_np::vertex_is_constrained_t,
               NamedParameters,

From 038de7ee03d34c936f4a298233da9dd644810e66 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 20 Feb 2024 17:08:05 +0000
Subject: [PATCH 1383/1398] Envelope: Replace auto

---
 .../CGAL/Envelope_3/Envelope_element_visitor_3.h       | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
index 07e2d706d14f..84247c5d3fe9 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
@@ -932,19 +932,19 @@ class Envelope_element_visitor_3 {
   void copy_data_to_face_boundary(Face_handle face) {
     Ccb_halfedge_circulator ccb;
 
-    for (auto outer_iter = face->outer_ccbs_begin();
+    for (Outer_ccb_iterator outer_iter = face->outer_ccbs_begin();
          outer_iter != face->outer_ccbs_end(); ++outer_iter) {
       ccb = *outer_iter;
       copy_data_to_face_boundary(face, ccb);
     }
 
-    for (auto inner_iter = face->inner_ccbs_begin();
+    for (Inner_ccb_iterator inner_iter = face->inner_ccbs_begin();
          inner_iter != face->inner_ccbs_end(); ++inner_iter) {
       ccb = (*inner_iter);
       copy_data_to_face_boundary(face, ccb);
     }
 
-    for (auto iso_iter = face->isolated_vertices_begin();
+    for (Isolated_vertex_iterator iso_iter = face->isolated_vertices_begin();
          iso_iter != face->isolated_vertices_end(); ++iso_iter) {
       Vertex_handle vh = iso_iter;
       if (! vh->is_decision_set() && has_equal_aux_data_with_face(vh))
@@ -1157,7 +1157,7 @@ class Envelope_element_visitor_3 {
     }
 
     // check inner boundaries
-    for (auto hole_iter = face->inner_ccbs_begin();
+    for (Inner_ccb_iterator hole_iter = face->inner_ccbs_begin();
          hole_iter != face->inner_ccbs_end(); ++hole_iter) {
       hec = (*hole_iter);
       hec_begin = hec;
@@ -1671,7 +1671,7 @@ class Envelope_element_visitor_3 {
     }
 
     // Copy the isolated vertices inside the given face.
-    for (auto iv_it = face->isolated_vertices_begin();
+    for (Isolated_vertex_iterator iv_it = face->isolated_vertices_begin();
          iv_it != face->isolated_vertices_end(); ++iv_it) {
       Vertex_handle iso_v = iv_it;
       Vertex_handle copied_iso =

From 6112a36847f5c1e29a5666e72187d2238285dbef Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Tue, 20 Feb 2024 17:26:37 +0000
Subject: [PATCH 1384/1398] unsigned int -> std::size_t

---
 Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
index 84247c5d3fe9..815b23f6cc25 100644
--- a/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
+++ b/Envelope_3/include/CGAL/Envelope_3/Envelope_element_visitor_3.h
@@ -482,7 +482,7 @@ class Envelope_element_visitor_3 {
         // find the intersection points and overlapping segments with the
         // original curve and insert them to the list of split points
         // intersect the x-monotone curve with the edge's curve
-        typedef std::pair<Point_2, unsigned int> Intersect_point_2;
+        typedef std::pair<Point_2, std::size_t> Intersect_point_2;
         std::list<std::variant<X_monotone_curve_2, Intersect_point_2>>
           intersections_list;
 

From 387d1b80c6dce79def1f51e0c5120fcbe7e2de10 Mon Sep 17 00:00:00 2001
From: Nicolas Saillant <saillantnicolas01@gmail.com>
Date: Wed, 21 Feb 2024 08:30:05 +0100
Subject: [PATCH 1385/1398] Add function to create summary page for test
 results

---
 .../test_handling/create_testresult_page      | 128 ++++++++++++++++++
 1 file changed, 128 insertions(+)

diff --git a/Maintenance/test_handling/create_testresult_page b/Maintenance/test_handling/create_testresult_page
index edde28fff960..323ae475b67b 100755
--- a/Maintenance/test_handling/create_testresult_page
+++ b/Maintenance/test_handling/create_testresult_page
@@ -635,6 +635,8 @@ The doxygen documentation testpage</a>
 (and the <a href="${doxygen_manual_test_url}">overview page</a>)</li>
 <li><a href="https://cgal.geometryfactory.com/~cgaltest/testsuite_comparison/diff_testsuites.html">
 Diff of testsuites results</a></li>
+<li><a href="$testresult_dir/summary-$release_version.html">
+Summary Page</a></li>
 </ol>
 EOF
 }
@@ -674,6 +676,7 @@ sub main()
     print_little_header();
     print_platform_descriptions();
     print_resultpage();
+    create_summary_page();
 
     print OUTPUT << 'EOF';
  <p style="width: 100%">This page has been created by the test results
@@ -719,4 +722,129 @@ sub init_known_platforms()
     close(PLATFORMS);
 }
 
+sub get_warnings_and_errors {
+    my ($result_file) = @_;
+    my $warnings_and_errors = "";
+    my %seen;
+    if (-e $result_file) {
+        my $result = `zcat $result_file`;
+        my @lines = split("\n", $result);
+        foreach my $line (@lines) {
+            if ($line =~ /(warning|error):/i && !$seen{$line}++) {
+            #if ($line !~ /\b(ERROR|WARNING)\b/ && $line =~ /(warning|error):/i) {
+
+                $warnings_and_errors .= $line . "\n";
+            }
+        }
+    } else {
+        print "File $result_file does not exist.\n";
+    }
+
+    return $warnings_and_errors;
+}
+
+sub create_summary_page {
+    my $platform_options = join("\n", map { "<option value=\"$_\">$_</option>" } @platforms_to_do);
+    my $test_directory;
+    my @letters = ('r', 'n', 'w', 'o');
+    my $letters_options = join("\n", map { "<option value=\"$_\">$_</option>" } @letters);
+    my $Summary_output = <<"EOF";
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"
+        "https://www.w3.org/TR/html4/strict.dtd">
+<html lang="en">
+<head>
+  <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
+  <title>Summary</title>
+  <link rel="shortcut icon" href="cgal.ico">
+  <link rel="stylesheet" type="text/css" href="testresult.css">
+  <script>
+    document.addEventListener('DOMContentLoaded', function() {
+        document.getElementById('platformSelector').value = 'all';
+        filterByPlatform();
+        document.getElementById('letterSelector').value = 'all';
+        filterByLetter();
+    });
+    function filterByPlatform() {
+        var selectedPlatform = document.getElementById('platformSelector').value;
+        var divs = document.querySelectorAll('div.platform');
+        divs.forEach(function(div) {
+            if (selectedPlatform === 'all' || div.classList.contains(selectedPlatform)) {
+                div.style.display = '';
+            } else {
+                div.style.display = 'none';
+            }
+        });
+    }
+
+    function filterByLetter() {
+        var selectedLetter = document.getElementById('letterSelector').value;
+        var platforms = document.querySelectorAll('div.platform');
+
+        platforms.forEach(function(platform) {
+            var letters = platform.querySelectorAll('div.result-grid > div.letter');
+            var displayPlatform = false;
+
+            letters.forEach(function(letter) {
+                if (selectedLetter === 'all' || letter.classList.contains(selectedLetter)) {
+                    var childDivs = letter.querySelectorAll('div');
+                    if (childDivs.length > 0) {
+                        letter.style.display = '';
+                        displayPlatform = true;
+                    } else {
+                        letter.style.display = 'none';
+                    }
+                } else {
+                    letter.style.display = 'none';
+                }
+            });
+
+            platform.style.display = displayPlatform ? '' : 'none';
+        });
+    }
+
+
+  </script>
+<!-- This file is generated by a program. Do not edit manually!! -->
+</head>
+<body>
+<h1>Summary Results of ${release_name}</h1>
+<select id="platformSelector" onchange="filterByPlatform()">
+<option value="all" selected>All Platforms</option>
+$platform_options
+</select>
+<select id="letterSelector" onchange="filterByLetter()">
+<option value="all" selected>All</option>
+$letters_options
+</select>
+EOF
+
+    my $summary_page_path = "$testresult_dir/summary".substr($release_name,4).".html";
+    open(my $out, '>', $summary_page_path) or die "Could not open file '$summary_page_path' $!";
+    print $out $Summary_output;
+
+    my ($platform_num, $platform) = (0, "");
+    foreach $platform (@platforms_to_do) {
+        print $out "<div class='platform $platform'><h2>Results of $platform</h2><div class='result-grid'>";
+        foreach my $letter (@letters) {
+            print $out "<div class='letter $letter result-container'><h3>$letter</h3>";
+            foreach my $test_directory (sort keys %test_directories) {
+                my $resulttext = $testresults[$platform_num]->{$test_directory};
+                if (defined($resulttext) && $resulttext eq $letter) {
+                    print $out '<div><a href=',"$release_name/$test_directory/TestReport_$platform.gz>", "$test_directory",'</a></div>';
+                    my $warnings_and_errors = get_warnings_and_errors("$testresult_dir/$release_name/$test_directory/TestReport_$platform.gz");
+                    if ($warnings_and_errors) {
+                        print $out "<pre>$warnings_and_errors</pre>";
+                    }
+                }
+            }
+            print $out "</div>";
+        }
+        print $out "</div></div>";
+        $platform_num++;
+    }
+
+    print $out "</body>\n</html>\n";
+    close $out;
+}
+
 main();

From 290f79777ef676fcc7484dadf3a61cc20ba5f9f1 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <andreas.fabri@geometryfactory.com>
Date: Thu, 22 Feb 2024 08:59:56 +0000
Subject: [PATCH 1386/1398] Keep only Is_zero

---
 Number_types/include/CGAL/CORE_Expr.h | 16 ----------------
 1 file changed, 16 deletions(-)

diff --git a/Number_types/include/CGAL/CORE_Expr.h b/Number_types/include/CGAL/CORE_Expr.h
index e0f72a223266..efeb5ad9363a 100644
--- a/Number_types/include/CGAL/CORE_Expr.h
+++ b/Number_types/include/CGAL/CORE_Expr.h
@@ -123,22 +123,6 @@ template <> class Algebraic_structure_traits< CORE::Expr >
         }
     };
 
-    class Is_one
-      : public CGAL::cpp98::unary_function< Type, bool > {
-      public:
-        bool operator()( const Type& x ) const {
-          double inf, sup;
-          x.doubleInterval(inf,sup);
-          if((inf > 1) || (sup < 1)){
-            return false;
-          }
-          if(inf == sup){
-            return true;
-          }
-          return x.cmp(Type::getOne()) == 0;
-        }
-    };
-
 };
 
 template <> class Real_embeddable_traits< CORE::Expr >

From fa2a031b66ba35a69489057414b751e7f0e8b511 Mon Sep 17 00:00:00 2001
From: Marc Glisse <marc.glisse@inria.fr>
Date: Sat, 24 Feb 2024 16:10:08 +0100
Subject: [PATCH 1387/1398] [[no_unique_address]] to compact
 Triangulation_ds_full_cell

---
 Triangulation/include/CGAL/Triangulation_ds_full_cell.h | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/Triangulation/include/CGAL/Triangulation_ds_full_cell.h b/Triangulation/include/CGAL/Triangulation_ds_full_cell.h
index 3e84630dbd9e..cb361f856e34 100644
--- a/Triangulation/include/CGAL/Triangulation_ds_full_cell.h
+++ b/Triangulation/include/CGAL/Triangulation_ds_full_cell.h
@@ -249,7 +249,9 @@ class Triangulation_ds_full_cell
     const Vertex_handle_array & vertices() const {return combinatorics_.vertices_; }
 
     // DATA MEMBERS
-    Combinatorics       combinatorics_;
+    // With the Itanium ABI, [[no_unique_address]] allows tda_data_ to reuse the
+    // padding bytes at the end of combinatorics_ when using the mirror policy.
+    CGAL_NO_UNIQUE_ADDRESS Combinatorics combinatorics_;
     mutable TDS_data    tds_data_;
 };
 

From ae9efb3c53d3a6fe346c1f2e9dfb6a389b6b1efd Mon Sep 17 00:00:00 2001
From: Nicolas Saillant <saillantnicolas01@gmail.com>
Date: Mon, 26 Feb 2024 09:26:47 +0100
Subject: [PATCH 1388/1398] Fix summary page link in create_testresult_page

---
 Maintenance/test_handling/create_testresult_page | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Maintenance/test_handling/create_testresult_page b/Maintenance/test_handling/create_testresult_page
index 323ae475b67b..8d9a867592de 100755
--- a/Maintenance/test_handling/create_testresult_page
+++ b/Maintenance/test_handling/create_testresult_page
@@ -635,7 +635,7 @@ The doxygen documentation testpage</a>
 (and the <a href="${doxygen_manual_test_url}">overview page</a>)</li>
 <li><a href="https://cgal.geometryfactory.com/~cgaltest/testsuite_comparison/diff_testsuites.html">
 Diff of testsuites results</a></li>
-<li><a href="$testresult_dir/summary-$release_version.html">
+<li><a href="summary-$release_version.html">
 Summary Page</a></li>
 </ol>
 EOF

From c5147435aadcbc9a95f9767b6be2991c46515526 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Mon, 26 Feb 2024 11:49:36 +0100
Subject: [PATCH 1389/1398] reuse.yml: call apt-get update

---
 .github/workflows/reuse.yml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/.github/workflows/reuse.yml b/.github/workflows/reuse.yml
index c55ba6df40d9..1ddd0a776445 100644
--- a/.github/workflows/reuse.yml
+++ b/.github/workflows/reuse.yml
@@ -24,7 +24,7 @@ jobs:
       with:
         args: spdx
     - name: install dependencies
-      run: sudo apt-get install -y cmake
+      run: sudo apt-get update && sudo apt-get install -y cmake
     - name: Create CGAL internal release
       run: |
         mkdir -p ./release

From c6ae91aca40398e991712d9b256ff56a538fe12f Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Mon, 26 Feb 2024 11:49:36 +0100
Subject: [PATCH 1390/1398] reuse.yml: call apt-get update

---
 .github/workflows/reuse.yml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/.github/workflows/reuse.yml b/.github/workflows/reuse.yml
index c55ba6df40d9..1ddd0a776445 100644
--- a/.github/workflows/reuse.yml
+++ b/.github/workflows/reuse.yml
@@ -24,7 +24,7 @@ jobs:
       with:
         args: spdx
     - name: install dependencies
-      run: sudo apt-get install -y cmake
+      run: sudo apt-get update && sudo apt-get install -y cmake
     - name: Create CGAL internal release
       run: |
         mkdir -p ./release

From 7a11b642fbb0a91453ba25339b4fd0961fade845 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 26 Feb 2024 14:18:01 +0100
Subject: [PATCH 1391/1398] Revert "get rid of extra container"

This reverts commit a57800ce07afdfe18429c4922460812b628f38eb.

points vector of Triangle_data can be updated when intersecting
new intersection points. If the container is used at the same time
by another thread calling generate_subtriangles, the container might
be in an invalid state while resizing it.
---
 .../Polygon_mesh_processing/autorefinement.h  | 92 ++++++++++---------
 1 file changed, 51 insertions(+), 41 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index ff9a8ee4d8a3..e9d85736f9d4 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -255,12 +255,12 @@ do_coplanar_segments_intersect(std::size_t pi, std::size_t qi,
 
 // imported from Intersections_3/include/CGAL/Intersections_3/internal/Triangle_3_Triangle_3_intersection.h
 template<class K>
-void coplanar_intersections(const std::vector<typename K::Point_3>& t1,
-                            const std::vector<typename K::Point_3>& t2,
+void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
+                            const std::array<typename K::Point_3, 3>& t2,
                             std::vector<std::tuple<typename K::Point_3, int, int>>& inter_pts)
 {
-  const typename K::Point_3& p1 = t1[0], & q1 = t1[1], & r1 = t1[2];
-  const typename K::Point_3& p2 = t2[0], & q2 = t2[1], & r2 = t2[2];
+  const typename K::Point_3& p1 = t1[0], q1 = t1[1], r1 = t1[2];
+  const typename K::Point_3& p2 = t2[0], q2 = t2[1], r2 = t2[2];
 
   std::list<Intersections::internal::Point_on_triangle<K>> l_inter_pts;
   l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(0,-1));
@@ -416,8 +416,8 @@ test_edge(const typename K::Point_3& p, const typename K::Point_3& q,
 }
 
 template <class K>
-bool collect_intersections(const std::vector<typename K::Point_3>& t1,
-                           const std::vector<typename K::Point_3>& t2,
+bool collect_intersections(const std::array<typename K::Point_3, 3>& t1,
+                           const std::array<typename K::Point_3, 3>& t2,
                            std::vector<std::tuple<typename K::Point_3, int, int>>& inter_pts)
 {
   // test edges of t1 vs t2
@@ -548,9 +548,10 @@ template <class EK,
 #endif
           class PointVector>
 void generate_subtriangles(std::size_t ti,
-                           std::vector<Triangle_data>& all_triangle_data,
+                           Triangle_data& triangle_data,
                            const std::set<std::pair<std::size_t, std::size_t> >& intersecting_triangles,
                            const std::set<std::pair<std::size_t, std::size_t> >& coplanar_triangles,
+                           const std::vector<std::array<typename EK::Point_3,3>>& triangles,
                            PointVector& new_triangles
                            )
 {
@@ -587,7 +588,6 @@ void generate_subtriangles(std::size_t ti,
 #define CGAL_AUTOREF_COUNTER_INSTRUCTION(X)
 #endif
 
-  Triangle_data& triangle_data=all_triangle_data[ti];
   std::vector<Exact_predicates_exact_constructions_kernel::Point_3>& points=triangle_data.points;
   std::vector<int>& point_locations=triangle_data.point_locations;
   std::vector<std::pair<std::size_t, std::size_t>>& segments=triangle_data.segments;
@@ -680,9 +680,9 @@ void generate_subtriangles(std::size_t ti,
               {
                 CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer6.start();)
                 typename EK::Point_3 pt = typename EK::Construct_planes_intersection_point_3()(
-                  all_triangle_data[in_triangle_ids[i]].points[0], all_triangle_data[in_triangle_ids[i]].points[1],all_triangle_data[in_triangle_ids[i]].points[2],
-                  all_triangle_data[in_triangle_ids[j]].points[0], all_triangle_data[in_triangle_ids[j]].points[1],all_triangle_data[in_triangle_ids[j]].points[2],
-                  points[0], points[1],points[2]);
+                  triangles[in_triangle_ids[i]][0], triangles[in_triangle_ids[i]][1],triangles[in_triangle_ids[i]][2],
+                  triangles[in_triangle_ids[j]][0], triangles[in_triangle_ids[j]][1],triangles[in_triangle_ids[j]][2],
+                  triangles[ti][0], triangles[ti][1],triangles[ti][2]);
                 CGAL_AUTOREF_COUNTER_INSTRUCTION(counter.timer6.stop();)
 
                 CGAL_AUTOREF_COUNTER_INSTRUCTION(++counter.c1;)
@@ -831,6 +831,7 @@ void generate_subtriangles(std::size_t ti,
   //typedef CGAL::Constrained_triangulation_plus_2<CDT_2> CDT;
   typedef CDT_2 CDT;
 
+  const std::array<typename EK::Point_3,3>& t = triangles[ti];
   std::vector<typename CDT::Vertex_handle> vhandles(triangle_data.points.size());
 
 #ifdef CGAL_AUTOREF_USE_FIXED_PROJECTION_TRAITS
@@ -838,12 +839,12 @@ void generate_subtriangles(std::size_t ti,
   bool orientation_flipped = false;
   CDT cdt(cdt_traits);
   // TODO: still need to figure out why I can't make the orientation_flipped correctly
-  vhandles[0]=cdt.insert(points[0]);
-  vhandles[1]=cdt.insert(points[1]);
-  vhandles[2]=cdt.insert(points[2]);
+  vhandles[0]=cdt.insert(t[0]);
+  vhandles[1]=cdt.insert(t[1]);
+  vhandles[2]=cdt.insert(t[2]);
 #else
   // positive triangle normal
-  typename EK::Vector_3 n = normal(points[0], points[1], points[2]);
+  typename EK::Vector_3 n = normal(t[0], t[1], t[2]);
   typename EK::Point_3 o(CGAL::ORIGIN);
 
   bool orientation_flipped = false;
@@ -855,14 +856,18 @@ void generate_subtriangles(std::size_t ti,
   P_traits cdt_traits(n);
 
   CDT cdt(cdt_traits);
-  vhandles[0]=cdt.insert_outside_affine_hull(points[0]);
-  vhandles[1]=cdt.insert_outside_affine_hull(points[1]);
+  vhandles[0]=cdt.insert_outside_affine_hull(t[0]);
+  vhandles[1]=cdt.insert_outside_affine_hull(t[1]);
   vhandles[2] = cdt.tds().insert_dim_up(cdt.infinite_vertex(), orientation_flipped);
-  vhandles[2]->set_point(points[2]);
+  vhandles[2]->set_point(t[2]);
 #endif
 
   // insert points and fill vhandles
-  // start by points on edges
+#if 0
+  std::vector<std::size_t> indices(triangle_data.points.size()-3);
+  std::iota(indices.begin(), indices.end(), 3);
+#else
+  //start by points on edges
   std::array<std::vector<std::size_t>, 3> indices_on_edges;
   std::vector<std::size_t> indices;
   for (std::size_t i=3; i<points.size(); ++i)
@@ -928,7 +933,7 @@ void generate_subtriangles(std::size_t ti,
       prev_id=id;
     }
   }
-
+#endif
   // then points in the interior
   typedef typename Pointer_property_map<typename EK::Point_3>::type Pmap;
   typedef Spatial_sort_traits_adapter_2<P_traits,Pmap> Search_traits;
@@ -1102,17 +1107,24 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
   // init the vector of triangles used for the autorefinement of triangles
   typedef CGAL::Exact_predicates_exact_constructions_kernel EK;
+  // even if the info is duplicated with Triangle_data::point, we keep this container
+  // so that we can use it in parallel calls of generate_subtriangles
+  std::vector< std::array<EK::Point_3, 3> > triangles(tiid+1);
   // vector of data for refining triangles
-  std::vector<autorefine_impl::Triangle_data> all_triangle_data(tiid+1);
+  std::vector<autorefine_impl::Triangle_data> all_triangle_data(triangles.size());
   Cartesian_converter<GT, EK> to_exact;
 
   for(Input_TID f : intersected_faces)
   {
     std::size_t tid=tri_inter_ids[f];
+    triangles[tid]= CGAL::make_array(
+      to_exact( get(pm, soup_points[soup_triangles[f][0]]) ),
+      to_exact( get(pm, soup_points[soup_triangles[f][1]]) ),
+      to_exact( get(pm, soup_points[soup_triangles[f][2]]) ) );
     all_triangle_data[tid].points.resize(3);
-    all_triangle_data[tid].points[0]=to_exact( get(pm, soup_points[soup_triangles[f][0]]) );
-    all_triangle_data[tid].points[1]=to_exact( get(pm, soup_points[soup_triangles[f][1]]) );
-    all_triangle_data[tid].points[2]=to_exact( get(pm, soup_points[soup_triangles[f][2]]) );
+    all_triangle_data[tid].points[0]=triangles[tri_inter_ids[f]][0];
+    all_triangle_data[tid].points[1]=triangles[tri_inter_ids[f]][1];
+    all_triangle_data[tid].points[2]=triangles[tri_inter_ids[f]][2];
     all_triangle_data[tid].point_locations.resize(3);
     all_triangle_data[tid].point_locations[0]=-1;
     all_triangle_data[tid].point_locations[1]=-2;
@@ -1134,8 +1146,8 @@ void autorefine_triangle_soup(PointRange& soup_points,
 
     if (i1==-1 || i2==-1) continue; //skip degenerate faces
 
-    const std::vector<EK::Point_3>& t1 = all_triangle_data[i1].points;
-    const std::vector<EK::Point_3>& t2 = all_triangle_data[i2].points;
+    const std::array<EK::Point_3, 3>& t1 = triangles[i1];
+    const std::array<EK::Point_3, 3>& t2 = triangles[i2];
 
     std::vector<std::tuple<EK::Point_3, int, int>> inter_pts;
     bool triangles_are_coplanar = autorefine_impl::collect_intersections<EK>(t1, t2, inter_pts);
@@ -1303,7 +1315,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 #ifdef CGAL_LINKED_WITH_TBB
   if (parallel_execution)
   {
-    tbb::parallel_for(tbb::blocked_range<size_t>(0, all_triangle_data.size()),
+    tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
                       [&](const tbb::blocked_range<size_t>& r) {
                         for (size_t ti = r.begin(); ti != r.end(); ++ti)
                           deduplicate_inserted_segments(ti);
@@ -1312,7 +1324,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   }
   else
 #endif
-  for (std::size_t ti = 0; ti < all_triangle_data.size(); ++ti) {
+  for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
     deduplicate_inserted_segments(ti);
   }
 
@@ -1333,34 +1345,32 @@ void autorefine_triangle_soup(PointRange& soup_points,
 #endif
 
 #ifdef CGAL_AUTOREF_USE_PROGRESS_DISPLAY
-  boost::timer::progress_display pd(all_triangle_data.size());
+  boost::timer::progress_display pd(triangles.size());
 #endif
 
   auto refine_triangles = [&](std::size_t ti)
   {
     if (all_triangle_data[ti].points.size()==3)
-      new_triangles.push_back({CGAL::make_array(all_triangle_data[ti].points[0],
-                                                all_triangle_data[ti].points[1],
-                                                all_triangle_data[ti].points[2]),
-                               ti});
+      new_triangles.push_back({triangles[ti], ti});
     else
     {
 #ifdef CGAL_AUTOREF_USE_FIXED_PROJECTION_TRAITS
-      typename EK::Vector_3 orth = CGAL::normal(all_triangle_data[ti].points[0], all_triangle_data[ti].points[1], all_triangle_data[ti].points[2]); // TODO::avoid construction?
+      const std::array<typename EK::Point_3, 3>& t = triangles[ti];
+      typename EK::Vector_3 orth = CGAL::normal(t[0], t[1], t[2]); // TODO::avoid construction?
       int c = CGAL::abs(orth[0]) > CGAL::abs(orth[1]) ? 0 : 1;
       c = CGAL::abs(orth[2]) > CGAL::abs(orth[c]) ? 2 : c;
 
       if (c == 0) {
-        autorefine_impl::generate_subtriangles<EK, 0>(ti, all_triangle_data, intersecting_triangles, coplanar_triangles, new_triangles);
+        autorefine_impl::generate_subtriangles<EK, 0>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
       }
       else if (c == 1) {
-        autorefine_impl::generate_subtriangles<EK, 1>(ti, all_triangle_data, intersecting_triangles, coplanar_triangles, new_triangles);
+        autorefine_impl::generate_subtriangles<EK, 1>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
       }
       else if (c == 2) {
-        autorefine_impl::generate_subtriangles<EK, 2>(ti, all_triangle_data, intersecting_triangles, coplanar_triangles, new_triangles);
+        autorefine_impl::generate_subtriangles<EK, 2>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
       }
 #else
-      autorefine_impl::generate_subtriangles<EK>(ti, all_triangle_data, intersecting_triangles, coplanar_triangles, new_triangles);
+      autorefine_impl::generate_subtriangles<EK>(ti, all_triangle_data[ti], intersecting_triangles, coplanar_triangles, triangles, new_triangles);
 #endif
     }
 
@@ -1375,7 +1385,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
 #ifdef CGAL_LINKED_WITH_TBB
   if (parallel_execution)
   {
-    tbb::parallel_for(tbb::blocked_range<size_t>(0, all_triangle_data.size()),
+    tbb::parallel_for(tbb::blocked_range<size_t>(0, triangles.size()),
                       [&](const tbb::blocked_range<size_t>& r) {
                         for (size_t ti = r.begin(); ti != r.end(); ++ti)
                           refine_triangles(ti);
@@ -1384,7 +1394,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   }
   else
 #endif
-  for (std::size_t ti = 0; ti < all_triangle_data.size(); ++ti) {
+  for (std::size_t ti = 0; ti < triangles.size(); ++ti) {
     refine_triangles(ti);
   }
 
@@ -1441,7 +1451,7 @@ void autorefine_triangle_soup(PointRange& soup_points,
   }
 
   // raw copy of input triangles with no intersection
-  std::vector<std::size_t> tri_inter_ids_inverse(all_triangle_data.size());
+  std::vector<std::size_t> tri_inter_ids_inverse(triangles.size());
   for (Input_TID f=0; f<soup_triangles.size(); ++f)
   {
     if (is_degen[f]) continue; //skip degenerate faces

From 08ab32e14ace81a980a2566a10d20a7086e05e94 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Mon, 26 Feb 2024 14:23:09 +0100
Subject: [PATCH 1392/1398] missing references

---
 .../include/CGAL/Polygon_mesh_processing/autorefinement.h     | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
index e9d85736f9d4..8de62f6b8021 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/autorefinement.h
@@ -259,8 +259,8 @@ void coplanar_intersections(const std::array<typename K::Point_3, 3>& t1,
                             const std::array<typename K::Point_3, 3>& t2,
                             std::vector<std::tuple<typename K::Point_3, int, int>>& inter_pts)
 {
-  const typename K::Point_3& p1 = t1[0], q1 = t1[1], r1 = t1[2];
-  const typename K::Point_3& p2 = t2[0], q2 = t2[1], r2 = t2[2];
+  const typename K::Point_3& p1 = t1[0], &q1 = t1[1], &r1 = t1[2];
+  const typename K::Point_3& p2 = t2[0], &q2 = t2[1], &r2 = t2[2];
 
   std::list<Intersections::internal::Point_on_triangle<K>> l_inter_pts;
   l_inter_pts.push_back(Intersections::internal::Point_on_triangle<K>(0,-1));

From d68ef56d8d830f19a4429d5781891c1e229b1999 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 28 Feb 2024 15:19:40 +0100
Subject: [PATCH 1393/1398] update the documentation menu

---
 Documentation/doc/resources/1.10.0/menu_version.js | 4 ++--
 Documentation/doc/resources/1.8.13/menu_version.js | 4 ++--
 Documentation/doc/resources/1.9.6/menu_version.js  | 4 ++--
 3 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/Documentation/doc/resources/1.10.0/menu_version.js b/Documentation/doc/resources/1.10.0/menu_version.js
index f3b20c2fe004..5b8d97efba0b 100644
--- a/Documentation/doc/resources/1.10.0/menu_version.js
+++ b/Documentation/doc/resources/1.10.0/menu_version.js
@@ -7,9 +7,9 @@
   var all_versions = [
       'master',
       '6.0-beta1',
-      '5.6',
+      '5.6.1',
       'latest',
-      '5.5.2',
+      '5.5.4',
       '5.4.4',
       '5.3.2',
       '5.2.4',
diff --git a/Documentation/doc/resources/1.8.13/menu_version.js b/Documentation/doc/resources/1.8.13/menu_version.js
index f3b20c2fe004..5b8d97efba0b 100644
--- a/Documentation/doc/resources/1.8.13/menu_version.js
+++ b/Documentation/doc/resources/1.8.13/menu_version.js
@@ -7,9 +7,9 @@
   var all_versions = [
       'master',
       '6.0-beta1',
-      '5.6',
+      '5.6.1',
       'latest',
-      '5.5.2',
+      '5.5.4',
       '5.4.4',
       '5.3.2',
       '5.2.4',
diff --git a/Documentation/doc/resources/1.9.6/menu_version.js b/Documentation/doc/resources/1.9.6/menu_version.js
index f3b20c2fe004..5b8d97efba0b 100644
--- a/Documentation/doc/resources/1.9.6/menu_version.js
+++ b/Documentation/doc/resources/1.9.6/menu_version.js
@@ -7,9 +7,9 @@
   var all_versions = [
       'master',
       '6.0-beta1',
-      '5.6',
+      '5.6.1',
       'latest',
-      '5.5.2',
+      '5.5.4',
       '5.4.4',
       '5.3.2',
       '5.2.4',

From 6461334f797201ca0172463ffb100ec5d0c5153e Mon Sep 17 00:00:00 2001
From: "dependabot[bot]" <49699333+dependabot[bot]@users.noreply.github.com>
Date: Mon, 4 Mar 2024 05:02:49 +0000
Subject: [PATCH 1394/1398] Bump fsfe/reuse-action from 2 to 3

Bumps [fsfe/reuse-action](https://github.com/fsfe/reuse-action) from 2 to 3.
- [Release notes](https://github.com/fsfe/reuse-action/releases)
- [Commits](https://github.com/fsfe/reuse-action/compare/v2...v3)

---
updated-dependencies:
- dependency-name: fsfe/reuse-action
  dependency-type: direct:production
  update-type: version-update:semver-major
...

Signed-off-by: dependabot[bot] <support@github.com>
---
 .github/workflows/reuse.yml | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/.github/workflows/reuse.yml b/.github/workflows/reuse.yml
index 1ddd0a776445..f76a99b18dd1 100644
--- a/.github/workflows/reuse.yml
+++ b/.github/workflows/reuse.yml
@@ -12,15 +12,15 @@ jobs:
     steps:
     - uses: actions/checkout@v4
     - name: REUSE version
-      uses: fsfe/reuse-action@v2
+      uses: fsfe/reuse-action@v3
       with:
         args: --version
     - name: REUSE lint
-      uses: fsfe/reuse-action@v2
+      uses: fsfe/reuse-action@v3
       with:
         args: --include-submodules lint
     - name: REUSE SPDX SBOM
-      uses: fsfe/reuse-action@v2
+      uses: fsfe/reuse-action@v3
       with:
         args: spdx
     - name: install dependencies
@@ -30,6 +30,6 @@ jobs:
         mkdir -p ./release
         cmake -DDESTINATION=./release -DCGAL_VERSION=9.9 -P ./Scripts/developer_scripts/cgal_create_release_with_cmake.cmake
     - name: REUSE lint release tarball
-      uses: fsfe/reuse-action@v2
+      uses: fsfe/reuse-action@v3
       with:
         args: --root ./release/CGAL-9.9 --include-submodules lint

From b34d9d6808e661adc3db62e02dcc1f30f32b8486 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= <sebastien.loriot@cgal.org>
Date: Tue, 5 Mar 2024 13:13:25 +0100
Subject: [PATCH 1395/1398] use raw string

---
 Documentation/doc/scripts/html_output_post_processing.py | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/Documentation/doc/scripts/html_output_post_processing.py b/Documentation/doc/scripts/html_output_post_processing.py
index 90e8547eb587..a253f3147150 100755
--- a/Documentation/doc/scripts/html_output_post_processing.py
+++ b/Documentation/doc/scripts/html_output_post_processing.py
@@ -184,7 +184,7 @@ def automagically_number_figures():
   for el in d('a.elRef'):
     text = pq(el).attr('href')
     if text.find("index.html")!=-1:
-      re_pkg_index=re.compile("\.\./([A-Z_a-z0-9]+)/index\.html")
+      re_pkg_index=re.compile(r'\.\./([A-Z_a-z0-9]+)/index\.html')
       res=re_pkg_index.match(text)
       if res:
         all_packages.append(res.group(1))
@@ -248,7 +248,7 @@ def main():
     #workaround issue with operator<< in pyquery
     all_pages=glob.glob('*/*.html')
     for f in all_pages:
-      re_replace_in_file("operator<<\(\)", "operator&lt;&lt;()", f)
+      re_replace_in_file(r'operator<<\(\)', "operator&lt;&lt;()", f)
 
     # number figure
     automagically_number_figures()
@@ -319,7 +319,7 @@ def main():
 
     filesjs_files=package_glob('./*/files.js')
     for fn in filesjs_files:
-      re_replace_in_file('^.*\[ "Concepts",.*$', '', fn)
+      re_replace_in_file(r'^.*\[ "Concepts",.*$', '', fn)
 
     #Rewrite the path of some images
     re_replace_in_file("'src','ftv2",
@@ -329,7 +329,7 @@ def main():
     # external is placed by doxygen to mark a class from a tagfile, this
     # is more confusing then helpful in our case
     if path.isfile(os.path.join('Manual','annotated.html')):
-      re_replace_in_file('\[external\]', '', os.path.join('Manual','annotated.html'))
+      re_replace_in_file(r'\[external\]', '', os.path.join('Manual','annotated.html'))
     else:
       stderr.write("Error: ./Manual/annotated.html does not exists\n")
     # fix class/concept mismatch in generated pages

From f716cc02605da50af6e2fcfec0162deef954d9a4 Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Wed, 6 Mar 2024 10:25:30 +0100
Subject: [PATCH 1396/1398] fix a bug with devicePixelRatio and picking

---
 GraphicsView/include/CGAL/Qt/qglviewer_impl.h | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
index 3cca531c5fb2..7387b1f48745 100644
--- a/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
+++ b/GraphicsView/include/CGAL/Qt/qglviewer_impl.h
@@ -1047,6 +1047,9 @@ static QString mouseButtonsString(::Qt::MouseButtons b) {
 
 CGAL_INLINE_FUNCTION
 void CGAL::QGLViewer::performClickAction(qglviewer::ClickAction ca, const QMouseEvent *const e) {
+  // the following call is needed to update the pixel ratio
+  camera()->setScreenWidthAndHeight(this->width(), this->height(), this->devicePixelRatio());
+
   // Note: action that need it should call update().
   switch (ca) {
   // # CONNECTION setMouseBinding prevents adding NO_CLICK_ACTION in

From 9e19fd1d7911e8e55445870701b873d4a4af046f Mon Sep 17 00:00:00 2001
From: Laurent Rineau <laurent.rineau@cgal.org>
Date: Thu, 7 Mar 2024 16:00:43 +0100
Subject: [PATCH 1397/1398] C3t3 item: fix a segfault

---
 Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
index 507122e3de6d..58c66145fcea 100644
--- a/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
+++ b/Polyhedron/demo/Polyhedron/Scene_triangulation_3_item.cpp
@@ -2198,7 +2198,7 @@ void Scene_triangulation_3_item::computeIntersection()
 void Scene_triangulation_3_item::set_cut_edge(bool b)
 {
   d->cut_edges = b;
-  d->intersection->setCutEdges(b);
+  if(d->intersection) d->intersection->setCutEdges(b);
   Q_EMIT redraw();
 }
 

From 4ce1f2abaf1fabc7290226182350630fe8126ea4 Mon Sep 17 00:00:00 2001
From: Brian Spilsbury <brian.spilsbury@gmail.com>
Date: Tue, 19 Mar 2024 10:47:16 +0900
Subject: [PATCH 1398/1398] Fix implicit gmp to double conversion failures

---
 .../Isotropic_remeshing/remesh_impl.h         | 43 +++++++++----------
 1 file changed, 21 insertions(+), 22 deletions(-)

diff --git a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
index 30d201d1ef51..9468f6174532 100644
--- a/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
+++ b/Polygon_mesh_processing/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h
@@ -400,9 +400,9 @@ namespace internal {
       for(edge_descriptor e : edge_range)
       {
         const halfedge_descriptor he = halfedge(e, mesh_);
-        std::optional<double> sqlen = sizing.is_too_long(source(he, mesh_), target(he, mesh_), mesh_);
+        auto sqlen = sizing.is_too_long(source(he, mesh_), target(he, mesh_), mesh_);
         if(sqlen != std::nullopt)
-          long_edges.emplace(he, sqlen.value());
+          long_edges.emplace(he, CGAL::to_double(sqlen.value()));
       }
 
       //split long edges
@@ -437,14 +437,14 @@ namespace internal {
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
-        std::optional<double> sqlen_new = sizing.is_too_long(source(hnew, mesh_), target(hnew, mesh_), mesh_);
+        auto sqlen_new = sizing.is_too_long(source(hnew, mesh_), target(hnew, mesh_), mesh_);
         if(sqlen_new != std::nullopt)
-          long_edges.emplace(hnew, sqlen_new.value());
+          long_edges.emplace(hnew, CGAL::to_double(sqlen_new.value()));
 
         const halfedge_descriptor hnext = next(hnew, mesh_);
         sqlen_new = sizing.is_too_long(source(hnext, mesh_), target(hnext, mesh_), mesh_);
         if (sqlen_new != std::nullopt)
-          long_edges.emplace(hnext, sqlen_new.value());
+          long_edges.emplace(hnext, CGAL::to_double(sqlen_new.value()));
 
         //insert new edges to keep triangular faces, and update long_edges
         if (!is_border(hnew, mesh_))
@@ -500,9 +500,9 @@ namespace internal {
         if (!is_split_allowed(e))
           continue;
         const halfedge_descriptor he = halfedge(e, mesh_);
-        std::optional<double> sqlen = sizing.is_too_long(source(he, mesh_), target(he, mesh_), mesh_);
+        auto sqlen = sizing.is_too_long(source(he, mesh_), target(he, mesh_), mesh_);
         if(sqlen != std::nullopt)
-          long_edges.emplace(halfedge(e, mesh_), sqlen.value());
+          long_edges.emplace(halfedge(e, mesh_), CGAL::to_double(sqlen.value()));
       }
 
       //split long edges
@@ -554,14 +554,14 @@ namespace internal {
 
         //check sub-edges
         //if it was more than twice the "long" threshold, insert them
-        std::optional<double> sqlen_new = sizing.is_too_long(source(hnew, mesh_), target(hnew, mesh_), mesh_);
+        auto sqlen_new = sizing.is_too_long(source(hnew, mesh_), target(hnew, mesh_), mesh_);
         if(sqlen_new != std::nullopt)
-          long_edges.emplace(hnew, sqlen_new.value());
+          long_edges.emplace(hnew, CGAL::to_double(sqlen_new.value()));
 
         const halfedge_descriptor hnext = next(hnew, mesh_);
         sqlen_new = sizing.is_too_long(source(hnext, mesh_), target(hnext, mesh_), mesh_);
         if (sqlen_new != std::nullopt)
-          long_edges.emplace(hnext, sqlen_new.value());
+          long_edges.emplace(hnext, CGAL::to_double(sqlen_new.value()));
 
         //insert new edges to keep triangular faces, and update long_edges
         if (!is_on_border(hnew))
@@ -580,9 +580,9 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            std::optional<double> sql = sizing.is_too_long(source(hnew2, mesh_), target(hnew2, mesh_), mesh_);
+            auto sql = sizing.is_too_long(source(hnew2, mesh_), target(hnew2, mesh_), mesh_);
             if(sql != std::nullopt)
-              long_edges.emplace(hnew2, sql.value());
+              long_edges.emplace(hnew2, CGAL::to_double(sql.value()));
           }
         }
 
@@ -603,9 +603,9 @@ namespace internal {
 
           if (snew == PATCH)
           {
-            std::optional<double> sql = sizing.is_too_long(source(hnew2, mesh_), target(hnew2, mesh_), mesh_);
+            auto sql = sizing.is_too_long(source(hnew2, mesh_), target(hnew2, mesh_), mesh_);
             if (sql != std::nullopt)
-              long_edges.emplace(hnew2, sql.value());
+              long_edges.emplace(hnew2, CGAL::to_double(sql.value()));
           }
         }
       }
@@ -648,10 +648,10 @@ namespace internal {
       Boost_bimap short_edges;
       for(edge_descriptor e : edges(mesh_))
       {
-        std::optional<double> sqlen = sizing.is_too_short(halfedge(e, mesh_), mesh_);
+        auto sqlen = sizing.is_too_short(halfedge(e, mesh_), mesh_);
         if(sqlen != std::nullopt
           && is_collapse_allowed(e, collapse_constraints))
-          short_edges.insert(short_edge(halfedge(e, mesh_), sqlen.value()));
+          short_edges.insert(short_edge(halfedge(e, mesh_), CGAL::to_double(sqlen.value())));
       }
 #ifdef CGAL_PMP_REMESHING_VERBOSE_PROGRESS
       std::cout << "done." << std::endl;
@@ -747,8 +747,7 @@ namespace internal {
         for(halfedge_descriptor ha : halfedges_around_target(va, mesh_))
         {
           vertex_descriptor va_i = source(ha, mesh_);
-          std::optional<double> sqha = sizing.is_too_long(vb, va_i, mesh_);
-          if (sqha != std::nullopt)
+          if (sizing.is_too_long(vb, va_i, mesh_))
           {
             collapse_ok = false;
             break;
@@ -813,10 +812,10 @@ namespace internal {
             //insert new/remaining short edges
             for (halfedge_descriptor ht : halfedges_around_target(vkept, mesh_))
             {
-              std::optional<double> sqlen = sizing.is_too_short(ht, mesh_);
+              auto sqlen = sizing.is_too_short(ht, mesh_);
               if (sqlen != std::nullopt
                 && is_collapse_allowed(edge(ht, mesh_), collapse_constraints))
-                short_edges.insert(short_edge(ht, sqlen.value()));
+                short_edges.insert(short_edge(ht, CGAL::to_double(sqlen.value())));
             }
           }
         }//end if(collapse_ok)
@@ -1761,9 +1760,9 @@ namespace internal {
             //insert new edges in 'short_edges'
             if (is_collapse_allowed(edge(hf, mesh_), collapse_constraints))
             {
-              std::optional<double> sqlen = sizing.is_too_short(hf, mesh_);
+              auto sqlen = sizing.is_too_short(hf, mesh_);
               if (sqlen != std::nullopt)
-                short_edges.insert(typename Bimap::value_type(hf, sqlen.value()));
+                short_edges.insert(typename Bimap::value_type(hf, CGAL::to_double(sqlen.value())));
             }
 
             if(!is_border(hf, mesh_) &&